Agents/1 1 posit argument system timothi norman depart comput king aberdeen june abstract system research concern model human anim societi develop principl design practic distribut inform manag system posit paper examin di erenc perspect area discuss issu commun commit interest system research gener introduct comput societi collect autonom agent depend intent stanc describ state agent agent adopt role relationship system ai research signi cantli philosophi cognit psycholog comput societi develop primari model human anim societi view test collect emerg behaviour develop model build system autom manag inform resourc virtual product line electron commerc agent view entiti situat dynam predict environ receiv perceptu input ect perform action fact agent autonom mean high uenc econom game biologi decid condit action perform agent requir attain goal made easier sati ed complet interact similarli agent gener term activ cooper achiev common coordin negoti mutual accept agreement form interact unit fact agent exert uenc subsequ action acquaint make perform problem solv activ abandon exist activ exist uenc process li heart social system behaviour agent determin intern driver interplai environ behaviour social agent uenc interact engag social agent system model wide advoc conceptu framework build intellig agent research attempt captur kei properti formal model work concentr individu agent explicit structur model social activ main reason limit mental state bdi agent view constitut intern motiv attitud model relat agent proposit logic focu relationship agent intern mental attitud state overcom provid complet model agent bdi model extend mechan captur social natur agent abil interact de ned rst issu address social natur agent impact individu mental state question answer agent mental state uenc system relationship mental state interact mechan enabl relationship establish bdi desir intent number theoret model extend bdi framework deal facet question castelfranchi introduc notion social de ned agent commit perform action castelfranchi argu notion reduc intern commit individu agent group captur depend relationship agent cavedon al notion social attitud ect persist perform action attitud de ned ternari depend relat respect proposit mean agent agent respect analogu belief social attitud captur interact agent ect agent mental attitud commit agent perform action type social commit social attitud captur aspect relationship agent su er number shortcom social natur agent impact individu mental state form commit agent perform action agent persuad adopt mental attitud ground form social necessit commit agent involv agent chang mental state basi con denc agent concept agent mental state uenc role system social relationship agent basic ect actual interact potenti potenti interact agent web interconnect exist role role structur system fundament enact impli enact role role relat adopt role impact agent mental state simpli role impli set expect behaviour agent actual social relationship agent necessarili involv social agent mental state uenc attitud eventu establish social interact relat role agent adopt role secretari expect adopt goal ful lling boss goal requir case agent role boss role actual social relationship involv secretari mental state uenc simpli adopt agent eventu boss role role structur role presum enact role interrel secretari boss goal desir awar intent boss boss set expect secretari intent chang goal intent princip ect secretari activ speci instanti relat role rise social relationship agent interrel role give rise social relationship speci agent role boss speci agent role secretari social wai agent uenc anoth mental state author agent accept author permit behaviour guid agent author de ned power agent guid behaviour ect mental state disposit agent uenc adopt acquaint mental attitud simpli intend contribut welfar assumpt benevol present earli distribut problem solv system trust agent uenc acquaint adopt mental attitud critic scrutini review evidenti strength con denc agent exchang agent uenc adopt agent mental state process bargain negoti agent adopt mental attitud return desir behaviour agent uenc adopt agent mental attitud basi argument adopt attitud adopt mental attitud depend convict suggest judg partli partli merit agent make true agent act recommend judg time constraint requir accept recommend agent trust threat agent threaten adopt mental attitud basi futur neg deni rst agent uenc acquaint adopt mental attitud threaten execut action ict oppon goal intent agent uenc threat acquaint act ful goal intent list concentr main mode uenc found multiag system meant exhaust mutual agent decid mental attitud base result mode uenc social relationship relationship main form uenc author boss disposit threat form uenc inappropri cooper problem solv mainten enact cooper social agent import area refer problem solv cooper problem solv process discuss term group gener social practic reason realiti cooper problem solv process inher stage agent involv return previou recognit potenti cooper recognit state potenti cooper practic start point cooper activ individu cooper problem solv begin state world agent intend agent confront practic problem agent solv problem typic individu decisionmak situat cooper problem solv occur potenti cooper potenti relev agent potenti cooper relev number social law individu choic agent physic capabl perform action achiev open lid jam jar act synchroni lift heavi tabl agent act restrict societ law agent perform design person marri cont castelfranchi give analysi depend agent di erent kind depend similar issu discuss permiss green man show attempt cross road road circumst break societ simpli act ect achiev action involv resourc monei time act consid ectiv qualiti outcom give diamond expert cut group gener agent potenti cooper solicit assist agent identifi agent prepar provid assist persuad cooper achiev goal format team agent initi dialogu intend involv social commit achiev goal concern involv context capabl societ law respect exist commit clear agent commit act agent choic adopt commit act explicit request percept weigh present commit commit fit current commit compat current commit forc con ict commit reject social practic reason member newli form group reason plan bring group closer solut practic problem set begin agent practic judgement plan form intent make group perform plan member attempt group closer agreement plan execut stage joint plan joint intent joint commit group act ensu note plan execut consid social practic conclud agreement plan execut group individu agent group agent make time unexpectedli prevent act decid postpon execut lead commit agent futur consequ plan chang mind decid perform newli plan fail execut plan individu agent group made action decid simpli mean give answer practic problem answer practic problem involv practic judgement favour speci commit act simpli perform provid circumst chang realist circumst alter make commit perform action suggest built action note consist idea success practic reason conclud theoret reason conclud justi ed belief conclud action action agent commun establish group social practic reason agent typic commun commun knowledg level commun agent speech act base agent commun languag activ area research languag typic includ indic rain queri question common addit imper issu give advic request exampl imper messag type acl intuit explan messag type sender attempt uenc recipi act attempt uenc mental state hearer recipi common knowledg level commun agent utter indic intent induc belief mean recognit intent speaker attempt uenc hearer adopt belief weather imper attempt uenc hearer futur action mean hearer intent speaker searl descript type illocutionari cohen levesqu provid model act constru attempt speaker chang mental state hearer request hearer attempt chang hearer mental state intent hearer autonom di erent misunderstand speaker cohen levesqu distinguish goal speaker perform act intent case hearer believ speaker intend hearer act hearer act hearer believ intent speaker intent speaker understood commun act unsuccess commun act attempt achiev satisfi intent hearer believ speaker de nition cohen al provid concret commun act common agent er servic respond reject silenc barbuceanu fox extens agent commun languag captur typic agent approach fipa speci cation agreement formal cohen al speci cation acl standard di er set illocutionari act refer kqml formal semant formal semant provid fipa speci cation number limit fipa acl primit understood primit refer action perform state achiev choic refer commun agent formal speci cation primit commun act fipa speci set precondit set ect de nition request reproduc fp issu de nition import discuss model reli state action mention agent request state air action captur notion satisfi precondit includ belief messag sender recipi agent action request robust provid adopt feasibl condit de ned fipa speci cation refer feasibl condit action relev omit semant notion satisfact feasibl condit state agent request action intend action concern depend signi cantli de nition intent agent intend action intend act ground agent commun languag formal model essenti ensur mean commun act clear design agent practic applic agent commun languag su er inher ambigu lead undesir counterintuit result clear design agent commun languag requir input expert argument open question number question interest wai agent incur commit act imper indic shut simpl directli refer action agent commit action declar greater number interconnect condit commit deliv time fee privileg dai paid leav consequ simpl act contract multitud implic futur behaviour agent action commit prevent ful lling commit argu agent forc request command sanction simpl sanction agent sanction mutual time commit enter explicitli express refer jl austin thing word oxford barbuceanu fox integr commun theori coordin agent intern confer autonom page function execut harvard pollack plan practic reason comput noriega jen parson framework negoti intellig agent fourth intern workshop agent architectur volum lectur note arti cial page castelfranchi individu intent group proc int conf page castelfranchi model social action ai agent arti cial cohen levesqu intent choic commit cial cohen levesqu commun action arti cial agent proc int conf page smith team format contemporari action volum social volum page kluwer cont castelfranchi cognit social action ucl dennett intent stanc mit collect commit proc int conf page reddi speech understand integr knowledg resolv uncertainti comput inform knowledg exchang protocol knowledg build knowledg share io foundat intellig physic agent fipa speci cation part agent commun franklin graesser agent taxonomi autonom agent intellig agent intern workshop agent architectur volum lectur note arti cial page georg lanski reactiv reason plan sixth nation confer arti cial page grice mean philosoph luck cooper plan select trust garijo system engin ninth european workshop model autonom agent volum lectur note arti cial page grosz krau collabor plan complex group action arti cial haddadi commun cooper agent pragmat volum lectur note arti cial intellig handi understand penguin fourth buchanan organiz introductori text prentic jen commit foundat coordin system knowledg engin reach agreement logic model implement arti cial lesser corkil distribut vehicl monitor tool investig distribut problem solv network ai marsh trust distribut arti cial intellig castelfranchi arti cial social volum lectur note arti cial page newel knowledg level arti cial norman reed deleg intellig agent seventh intern workshop agent architectur jen commit agreement intern confer page jen agent reason negoti argu journal logic rao georg model ration agent intern confer principl knowledg page reed dialogu frame agent commun intern confer page searl speech essai philosophi languag cambridg design polici joint intent theori intern confer page tamb exibl teamwork journal arti cial intellig walton commit basic concept interperson reason state york wooldridg jen cooper problem solv journal logic
ML/2 6 transact electron packag vol octob decomposit data industri case studi mine offer tool discoveri knowledg larg knowledg extract process complex subset data consid mine numer method decomposit data set discuss decomposit enhanc qualiti knowledg extract larg simplif data mine task idea present illustr exampl industri case studi case studi report data mine approach appli extract knowledg data set extract knowledg predict prevent manufactur fault index integr qualiti engin introduct volum data grow number featur object genet inform thousand featur larg number qualit manufactur data sourc significantli number featur analyz qualiti semiconductor industri upstream chemistri inform prove inform combin manufactur process data result larg number featur object inform collect statist structur event data pattern hypothesi automat extract data formul user tradit model statist mathemat program model data mine draw area machin high perform comput data automat gener number object mine larg time extract knowledg larg data set easili run dai reduc comput complex knowledg discoveri data mine algorithm manuscript receiv februari octob author intellig system iowa ia usa publish item identifi andrew ieee ieee sion make base acquir knowledg reduc volum data process accomplish decomposit numer decomposit approach defin appli effect knowledg discoveri make decomposit offer ad benefit facil dynam knowledg extract coupl result autonom system continu improv predict accuraci research report paper base develop machin learn data mine discuss learn algorithm list induct tree learn algorithm develop quinlan induct learn system gener condit part logic formula domain knowledg gener attribut present input data simpl induct algorithm comput condit probabl class select class highest posterior probabl oblivi graph induct algorithm build oblivi approach lazi tree algorithm build tree test instanc develop friedman al induct algorithm quinlan direct rule induct algorithm clark boswel algorithm combin featur aq prune techniqu similar techniqu relat condit rule aq instanc base learn algorithm aha obliqu algorithm murthi salzberg ieee transact electron packag vol octob tree auer al minim number error discret continu attribut learn exampl rough set system exampl algorithm develop learn data mine found edit volum lin carbonel michalski al book mitchel survei import applic machin learn develop date rule extract algorithm fall tree tree algorithm deriv tree data set classifi make object unknown rule subcategori class includ algorithm base rough set theori pawlak basic concept rough set theori call set featur uniqu identifi object train set formal reduct definit provid pawlak numer algorithm develop extract rule train data set extract knowledg make class algorithm illustr present section approach base rough set theori identifi defect reason rough set theori approach tree approach belief approach suitabl problem consid paper justifi characterist rule deriv algorithm featur parent node common rule deriv typic tree algorithm featur includ rule deriv rough set algorithm form pattern shape offer predict power present section illustr result produc class algorithm ii rule extract present illustr rule deriv algorithm train set fig data object batch featur process paramet featur batch product rule fig deriv data fig tree algorithm object support rule list rule element data set includ rule fig creat pattern matrix fig featur valu fig train data set column involv characterist tree type algorithm set rule extract rough set algorithm pattern shown fig case valu column partial involv rule addit object rule exist rule extract algorithm aim form rule minimum number featur experi data set larg number featur object data frequent automat collect data set semiconductor industri larg number featur chemic composit continu collect decomposit data set kei issu iii decomposit data mine literatur decomposit discuss data mine larg context distribut enhanc make learn sourc paper distribut learn edit volum zaki ho contributor book discuss wai leverag parallel distribut techniqu knowledg data clean learn grossman al outlin fundament challeng mine develop distribut data mine algorithm guo concept knowledg probe distribut data mine knowledg learn organ stage set base classifi learn parallel distribut data set relationship attribut vector class predict base classifi determin zaki discuss project call spider multiprocessor system accomplish parallel data mine distribut data set refer distribut data mine activ area research research outcom parallel data multipl base uniqu softwar mobil base specif hardwar involv hybrid method approach work case data mine continu growth decomposit data mine fig rule set deriv algorithm fig pattern rule fig fig rule set deriv rough set algorithm fig pattern rule fig data base success data mine solv problem busi healthcar determin futur distribut data mine numer research recogn import make distribut environ approach mine combin inform distribut appli machin learn algorithm discov pattern exhibit data combin comput descript combin multipl classif model receiv attent literatur research concern combin model obtain subset singl data set mean accuraci integr distribut inform java agent system address emploi techniqu extract higher level knowledg integr output multipl classifi combin led substanti improv difficult pattern recognit problem typic set classifi train data common data randomli select partit experi similar qualiti train data distribut data mine involv heterogen qualiti quantiti data vari lead larg discrep integr classif model deriv distinct distribut complex decomposit concept discuss paper applic make distribut sourc applic iv decomposit principl basic approach data mine direct mine data set mine transform data set approach appli data set process reason time exist data mine algorithm transform data set data mine algorithm intend larg data set form transform data set decomposit decomposit place space time area decomposit time extens receiv coverag literatur scope paper form decomposit space consid paper featur set partit data set base column spreadsheet object set partit data set base object row spreadsheet type decomposit offer numer benefit data mine reduct comput time transpar data mine process suitabl parallel data mine algorithm effect make base extract knowledg benefit obviou requir justif make effect argument explor discuss detail research benefit due fact made base subset featur algorithm present make algorithm step match featur valu object unknown outcom condit extract rule conflict step step step assign object equal match stop step gener solut assign measur ieee transact electron packag vol octob measur express rule support discuss measur rule note make algorithm rule gener data mine algorithm featur set fulli match featur set individu result gener approxim solut step make algorithm possibl decomposit train data set extract rule set featur dictat object unknown outcom algorithm outlin make make algorithm step list featur valu object unknown outcom step featur step extract rule data mine algorithm step match featur valu object unknown outcom condit extract rule conflict step step step assign object equal match stop step addit featur step step step gener solut algorithm make accuraci concept orthogon algorithm orthogon algorithm make algorithm gener compar gener affin base algorithm multipl primari confirm algorithm type data set decomposit discuss data data set fig featur object featur set decomposit mode featur decomposit discuss featur set mutual partial overlap subset subset featur criteria drive content featur set fig data set featur fig rule set obtain data set fig applic featur valu gener time downstream featur depend upstream featur featur type exist rule extract algorithm intend specif type discret featur featur relev featur show relev measur statist metric context tacit difficult measur impact temperatur comput energi decomposit entropi base rule extract algorithm extract rule data set fig featur rule set shown fig definit entropi discuss entropi algorithm reader refer present survei algorithm extract rule perform support rule vari rule appli object rule support object entropi rule set fig gener rule set featur featur data set extract rule fig subset origin data set fig train data altern approach decomposit featur origin data set treat data set featur set larg number featur cascad numer subset creat cascad concept illustr rule fig cascad decomposit concept find intermedi made intermedi decomposit data mine fig rule set featur fig rule set featur indic path mileston process featur valu gener period time cascad approach make parallel increment learn approach knowledg extract illustr applic rule set fig make scenario made object valu featur valu addit featur gener test perform dai type test order depend outcom intermedi featur valu match rule fig intermedi medium gener intermedi test produc featur gener rule train set featur outcom consid rule extract algorithm featur produc test invok rule fig produc note vector featur valu medium match rule fig deriv form full data set rule set fig gener entropi algorithm paper concept intermedi call rule extract algorithm includ set featur rule discuss case set featur featur illustr power decomposit mine make larg data set featur type decomposit decomposit featur group type handl featur extract algorithm rule set fig deriv subset data set fig categor featur rule fig extract set numer valu featur relev decomposit featur relev issu gener item discuss data mine dictat avail gener applic industri applic data mine set file statist process control design experi data medic data origin unrel clinic studi question featur includ data set relev partial outcom outcom consid make group featur data set fig featur relev issu import data set measur featur relev elimin irrelev combin reduc comput effort vi object set decomposit data set larg number featur refer wide data set includ larg number object refer deep applic type cost data main factor impact width depth data set featur set decomposit discuss previou section intend primarili wide data set decomposit aim deep data set present mode object set decomposit consid object content object group time set object split subset featur object possibl partit subset base select featur object content decomposit object fig arbitrari group rule set extract sunset shown fig featur decomposit case remov object possibl train data set valu set warrant object fig separ subset base featur rule extract data set shown fig decomposit object lead object data set fig rule fig object result set object data set fig rule fig ieee transact electron packag vol octob fig rule set featur intermedi fig rule set featur fig rule set categor featur fig rule set numer featur fig rule set object fig fig rule set object fig fig rule set object fig fig rule set object ai decomposit concept appli case number exampl support outcom posit larg number neg outcom low mine larger data set produc rule support measur number object repres rule set rule defin condit posit outcom object match rule assign posit outcom remain object assign neg outcom time collect suffici number neg fig rule set object ap fig integr circuit mark cut fig data mine control exampl time data collect rule deriv posit exampl support make process vii industri case studi process step semiconductor industri involv polish problem consid improv qualiti elimin wast downstream product stage compani actual integr circuit produc import product problem decomposit data mine fig illustr rule fig rule modifi data set solv tradit approach qualiti design oper research transform integr undergo elabor manufactur process polish final step unknown portion surfac edg round result call surfac undesir reduc area creation chip fig result wast materi undergon lengthi manufactur process exist statist optim approach appli product problem produc satisfactori result ultim goal research discuss paper develop control shown fig featur fabric materi control determin control paramet type polish preliminari analysi data provid industri compani product problem solv data mine approach natur problem illustr featur preliminari data set collect compani qualiti control model algorithm develop research determin set featur high accuraci data set data set includ featur oper denot year sequenti number lot number specif oper rough pad lot number intermedi pad lot number polish identif number rough pad life time intermedi pad life time vacuum rough vacuum intermedi averag remov sigma remov output featur relat qualiti averag sigma comput result preliminari data set collect statist process control data mine data file creat piec process oper due effort data requir systemat data collect organ consid fact numer prior design experi statist process control effort identifi specif qualiti problem hindranc process entir data file object decomposit approach discuss paper creat train set exampl repres entir data set base threshold measur ieee transact electron packag vol octob train set randomli select partit experi perform link oper factor specif qualiti level experi result discuss experi extract rule data set high low granular rule fig illustr natur relationship control paramet process outcom reflect product qualiti experi desir greater deviat poorer qualiti granular chang natur rule illustr fig reason insensit rule detail symbol featur correl chemic properti contribut unaccept level featur result excess valu preliminari result encourag learn phase produc exact impli exist definit link oper factor qualiti predict algorithm discuss gener accur goal build data mine control fig accomplish futur viii comput complex robust knowledg extract larg data set make enhanc decomposit data decomposit structur effect make paper idea illustr exampl industri case studi data mine approach solv qualiti engin problem semiconductor industri approach link oper paramet level product qualiti relationship captur form rule improv qualiti product result deriv requir manufactur actual oper data collect asset data situat costli feasibl refer berri data mine custom support data approach busi upper saddl prentic machin learn mach vol pp increment learn system test applic medic nation confer artifici intellig palo pp domingo condit optim simpl bayesian machin thirteenth intern confer lo morgan pp perform enhanc oblivi phd comput sci stanford thirteenth nation confer artifici intellig aaai press program machin learn lo morgan clark induct machin vol pp irrelev attribut learn int vol pp murthi system induct obliqu artif intel vol pp applic agnost small european confer machin ed springer version rule induct system fund vol pp lin rough set data mine machin paradigm method mit machin learn data method applic langlei machin learn rule commun vol pp comput intellig design manufactur int inform comput vol pp rough theoret aspect reason data zaki parallel data mine mine opportun challeng report nsf workshop mine distribut tech guo probe distribut data proc int conf knowledg discoveri data parallel classif data mine proc ieee int conf data pp learn current ai vol pp java agent distribut proc int conf knowledg discoveri data pp rough set base approach induct rough set knowledg ed pp data mine ieee tran inform technol publish clark induct recent european work session ed pp decomposit data mine andrew professor industri engin iowa citi interest applic comput intellig optim product medic medic technolog publish research paper journal sponsor sme speak frequent intern conduct consult industri corpor serv editori board edit book journal intellig manufactur
IR/3 5 explor versu exploit topic driven crawler pant srinivasan filippo menczer depart manag scienc school librari inform scienc iowa iowa ia dynam natur web highlight scalabl limit search engin topic driven crawler address problem distribut crawl process client comput context topic driven crawler inform priorit link visit focu balanc exploit inform focu explor link suboptim lead relev page investig issu seek relev page start relev seek relev page start link relev subset framework number qualiti metric develop evalu topic driven crawl algorithm fair find mix exploit explor essenti spite penalti earli stage crawl introduct recent project estim size visibl web todai billion page largest search claim billion page coverag web search engin improv past year hardwar bandwidth resourc search engin growth web rate chang scalabl limit stem search attempt crawl answer queri user decentr crawl process scalabl bear addit benefit crawler driven rich context user interpret page select link visit develop topic driven crawler algorithm receiv attent recent year topic driven crawler respond inform express topic queri interest profil individu user time onlin commun share interest search engin evalu topic driven crawler difficult due lack relev set web presenc conflict page qualiti fair gaug time space algorithm complex recent research present evalu framework design support comparison topic driven crawler algorithm resourc constraint paper line research investig rel merit explor versu exploit defin characterist crawl mechan issu exploit versu explor machin learn artifici present task search guid qualiti estim regular assum measur qualiti point search space inform qualiti nearbi point greedi algorithm exploit inform concentr search vicin point strategi lead miss equal good estim search space local optima trap algorithm locat global optima visit point order arriv algorithm complet disregard qualiti estim continu explor uniform random fashion risk stuck local inform bia search spend time explor suboptim area balanc exploit explor clue call heurist search optim point unknown topolog search space understood typic case topic driven crawler fit pictur view web search page point neighborhood defin hyperlink crawler decid page visit base cue provid link nearbi page assum relev page higher probabl relev page random qualiti estim page provid cue exploit bia search process short rang relev clue web relev page link appar irrelev balanc exploit qualiti mate inform explor suboptim page crucial perform topic driven crawler question studi empir respect task seek relev page start set relev link applic task search agent result search engin start point provid user recent person result start relev expect exploratori crawler perform task involv seek relev page start crawl link link relev subset task part web mine competit intellig applic search start home start relev balanc explor exploit empir question evalu framework exampl neighbor order evalu crawler relev neighbor neighbor url extract neighborhood exampl obtain topic open directori ran random crawl start main categori dmoz site crawler identifi dmoz page children categori node leav extern link deriv topic collect topic topic repres type inform deriv leaf page word dmoz hierarchi form keyword extern link form exampl concaten text descript anchor text target url dmoz human form topic descript differ topic keyword topic descript tabl sampl topic descript truncat space limit topic keyword topic descript exampl recreat hot air balloon organ societi australia vari collect photo fact balloon balloon build includ articl theori flight albuquerqu associ site cover rang balloon topic includ balloon local educ safeti fly club activ club histori arizona hot air balloon club give model detail gaug relev crawl page analysi tabl show sampl topic neighbor obtain topic process obtain top inlink return googl top inlink inlink obtain earlier exampl start maximum uniqu url subset url pick random set link subset call neighbor architectur evalu framework compar crawler framework easili plug modul implement arbitrari crawl share data structur util optim effici affect fair evalu mention crawler task crawler start exampl start point neighbor page fetch compon url ad list call frontier crawler keyword guid select frontier url fetch iter crawler crawl max page page crawl end sooner frontier empti timeout web download larg page chop retriev kb protocol http redirect filter content stale link yield http error code remov found good link constrain space resourc crawler algorithm restrict frontier size max buffer url buffer full crawler decid link replac link ad crawl algorithm paper studi notion explor versu exploit begin singl famili crawler algorithm singl greedi paramet control behavior previou experi found naiv crawler displai perform crawler consid studi explor variant crawler examin famili crawler paramet control characterist interest crawler studi basic idea frontier link estim foreach link visit foreach link doc score foreach outlink figur pseudocod crawler criterion select crawl gener iter batch top link crawl select complet crawl page crawler decid batch mention keyword guid crawl specif link select process comput lexic similar keyword sourc page link similar page topic estim relev page link url estim select crawl cosin similar crawler link minimum similar score remov frontier order exce max buffer size figur offer simplifi pseudocod crawler offer ideal context studi paramet control greedi behavior crawler result crawler greater emphasi explor reduc emphasi exploit select smaller set link exploit evid potenti merit link experi test mutant crawler set refer valu evalu method tabl depict methodolog crawler evalu row tabl method gaug page qualiti pure lexic approach similar topic descript assess relev method primarili linkag base approxim method googl pagerank discrimin page number topic keyword column tabl show measur static dynam perspect static approach examin crawl qualiti assess full set page crawl queri contrast dynam measur provid tempor crawl page fetch crawl progress static approach measur abil retriev page qualiti page assess wai row static plot show abil crawler retriev fewer highli relev page analog plot recal function gener dynam approach examin qualiti retriev crawl progress dynam plot offer trajectori time displai dynam behavior crawl measur built averag rank gener relat averag rank proport crawl set expect relev note score rank dynam measur comput calcul point time crawler data gener full crawl pagerank score calcul full set retriev page strategi reason evid judg page qualiti tabl evalu scheme measur static scheme base coverag top page qualiti metric crawl set page visit crawler dynam scheme base rank qualiti metric crawl averag crawl set time static scheme dynam scheme lexic linkag lexic base page qualiti smart system rank retriev page lexic similar topic smart system pool page crawl crawler topic rank topic descript system util term weight strategi involv term frequenc document frequenc comput pool page topic smart comput similar queri topic dot product topic page vector output rank set page base topic similar score page rank refer tabl percentag top page rank smart retriev crawler yield static evalu metric dynam view valu page calcul point crawl denot set page retriev time calcul set page size proce time approxim number page crawl trajectori valu time displai dynam behavior crawler linkag base page qualiti observ content give fair measur qualiti page algorithm hit pagerank linkag structur web rank page pagerank estim global popular page comput pagerank iter process pagerank calcul crawl complet pool page crawl topic crawler calcul pagerank algorithm sort page crawl base number topic keyword sort page number keyword pagerank process page crawl topic static evalu metric measur percentag top page crawl crawler topic dynam plot number page crawl result evalu scheme metric outlin tabl analyz perform crawler task task start exampl task crawler start relev subset hyperlink navig discov relev page result task summar plot figur plot perform select subset crawler behavior remain crawl crawl static lexic perform number top page static linkag perform number top page averag rank averag rank dynam lexic perform page crawl dynam linkag perform page crawl figur static evalu dynam evalu repres crawler task plot correspond lexic linkag qualiti metric error bar correspond standard error topic plot crawler extrapol curv gener observ draw plot achiev significantli perform static evalu superior coverag highli relev page base qualiti metric number top page figur differ coverag crawler consid fewer highli relev page result explor import locat highli relev page start relev exploit harm dynam plot give richer pictur lowest averag rank significantli crawler lexic metric figur linkag metric show pai larg penalti earli stage crawl figur crawler regain qualiti longer run coverag highli relev page crawler figur interpret improv observ phase crawl conjectur explor suboptim link earli capabl eventu discov path highli relev page escap greedi strategi task start neighbor success exploratori algorithm task start relev page crawl crawl static lexic perform breadthfirst number top page static linkag perform breadthfirst number top page averag rank averag rank dynam lexic perform breadthfirst page crawl dynam linkag perform breadthfirst page crawl figur static evalu dynam evalu repres crawler task plot correspond lexic linkag qualiti metric task link obtain neighborhood relev subset start point goal find relev page worst crawler task task add simpl crawler limit size frontier fifo queue crawler ad observ perform blind exploratori algorithm summari result shown plot figur task find exploratori perform significantli static evalu lexic linkag qualiti metric figur dynam plot figur bear initi penalti explor recov long run crawler perform poorli evalu gener result find explor exploit explor guidanc due avail relev subset topic current plot averag recal relev exampl number page crawl plot illustr behavior crawler exampl view target find outperform trail relat research research design effect crawler type crawl algorithm develop chakrabarti al classifi built train set posit neg averag recal breadthfirst page crawl figur averag recal exampl crawl start neighbor page guid crawler infospid begin crawl start point gener clever search engin crawler follow fix adapt crawl learn estim qualiti link question explor versu exploit crawler strategi address number directli limit explor bound depth path suboptim cho al found exploratori crawl behavior implement algorithm lead effici discoveri page good pagerank discuss issu limit memori resourc impact exploit behavior crawl strategi forc crawler make frequent filter crawler find popular page earli crawl explor versu exploit issu continu studi variat major class crawler recent research diligenti al address crawler assess potenti link crawl avoid gain larger gain solut build classifi assign page class base expect link distanc current page relev document area crawler qualiti evalu receiv attent recent research altern assess page import show rang sophist cho al simpl presenc word relev amento al comput similar page centroid seed fact similar assess form basi relev exampl research exploit link inform estim page relev method base hub author cho al page pagerank score threshold relev najork wiener crawler fetch million page calcul averag pagerank page crawl assumpt pagerank estim relev combin link relev estim evid approach paper evalu framework topic driven crawler studi role exploit link estim versu explor suboptim page experi famili simpl crawler algorithm vari limit memori resourc task number scheme qualiti metric deriv lexic featur link analysi introduc appli gaug crawler perform found consist explor lead coverag highli relev spite penalti earli stage crawl obviou explan explor trade short term gain longer term potenti larger gain found blind explor start neighbor relev lead poor result mix explor exploit good perform start relev exampl perform crawler higher explor attribut coverag document close relev subset good perform start relev show exploratori natur complement greedi side find highli relev page extrem exploit blind explor perform exploit result base short crawl page hold longer issu address futur research dynam evalu suggest short crawl lesson incorpor algorithm queri time crawler observ higher explor yield result motiv parallel distribut implement topic driven complet order link requir greedi crawler good perform crawler base local hold perform exploratori strategi effici scalabl distribut implement intend experi variat crawl algorithm infospid adapt distribut exploratori strategi crawler algorithm intend studi futur research includ strategi driven estim lexic plan implement famili link estim base local version metric paper evalu plan test sophist lexic crawler infospid shark search priorit link singl page goal present research identifi optim explor explor greedi degrad perform larg buffer size constrain rang strategi happen experi due small max buffer identifi optim step develop adapt crawler attempt adjust level greedi crawl thing paper analyz time complex crawler perform strategi greedi strategi requir frequent impact effici crawler consid qualiti measur aggreg studi explor exploit depend characterist topic heterogen issu object ongo research refer yu intellig crawl world wide web arbitrari predic proc intl world wide web page hill predict expert qualiti rate web document proc acm sigir conf research develop inform page ur ad support dynam search comput bharat improv algorithm topic distil hyperlink environ proc acm sigir conf research develop inform page brewington cybenko dynam proc intern web brin page anatomi hypertextu web search engin comput kleinberg automat resourc compil analyz hyperlink structur text comput van den dom approach web resourc discoveri comput page effici crawl url order proc intl world wide web size internet white juli de bra post inform retriev world wide make search feasibl proc intl world wide web gori crawl context graph proc intern confer larg page effici comput pagerank technic stanford ur algorithm tailor web site map proc intl web kleinberg authorit sourc hyperlink environ journal lawrenc gile access inform web menczer link lexic semant web content menczer belew adapt retriev intern local context scale web machin srinivasan evalu web crawler proc annual intl acm sigir conf research develop inform najork wiener search crawl yield page proc intern world wide web pant menczer evolv intellig web crawler autonom agent renni mccallum reinforc learn spider web effici proc intern conf machin page morgan san salton smart retriev system experi automat document process englewood
DB/4 3 engin roadmap abstract construct larg class distribut system simplifi leverag layer network oper system applic compon middlewar resolv facilit commun coordin distribut compon state middlewar product enabl softwar engin build system distribut network middlewar research aim push boundari adapt middlewar depend wireless system challeng softwar engin research method tool distribut system construct systemat build exploit capabl middlewar product futur introduct commerci trend lead demand distribut system number merger compani higher year trend bound continu newli merg compani deliv unifi servic custom demand integr system time frame short build system option exist system compon integr distribut system integr comput facil time pressur provid servic exist servic custom achiev compon procur integr system built scratch compon integr incompat requir hardwar oper system platform run deploi system end distribut internet opportun wolfgang dept comput scienc colleg london london offer product servic vast number potenti custom difficult estim scalabl requir site design cope number transact dai find suddenli demand order magnitud larger requir scalabl achiev central architectur system distribut construct distribut system appeal possibl solv problem distribut system integr legaci preserv time scalabl toler failur construct distribut system difficult build central system multipl point failur distribut system compon commun complic commun open door secur attack middlewar order conceal difficulti applic engin increasingli capac middlewar middlewar network oper system network oper hardwar system hardwar network middlewar middlewar network oper system network oper hardwar system hardwar figur middlewar distribut system construct shown figur middlewar layer network oper system applic compon facilit commun coordin compon distribut network host aim middlewar provid solut applic engin solv problem distribut system construct mention idea middlewar build distribut system compar manag system build inform enabl applic engin concurr transact manag network focu applic requir order build distribut system meet softwar engin middlewar suit problem middlewar design implement system softwar engin research method tool systemat build exploit capabl middlewar offer princip contribut paper assess current middlewar product offer middlewar research softwar engin increasingli middlewar build distribut system research distribut softwar engin ignor trend limit impact analyz influenc middlewar softwar engin research agenda paper structur section discuss difficulti involv build distribut system delin requir middlewar section requir attempt assess support current middlewar product provid distribut system construct present overview ongo middlewar research section order provid preview futur middlewar product capabl delin section research agenda softwar engin build capabl current futur middlewar conclud paper section middlewar requir review detail difficult build distribut system difficulti solv applic design solut middlewar solv challeng main requir middlewar network commun shown figur compon distribut system resid host order distribut system integr comput compon commun commun achiev network classifi refer model distribut system built top transport tcp udp good exampl layer underneath provid network oper system transport protocol common transmit messag host messag transmiss low level abstract softwar engin build distribut system request servic remot compon execut atom isol transact paramet compon request servic pass compon servic complex data structur data structur transform form transmit network sequenc byte transform refer marshal call marshal notori tediou middlewar perform marshal coordin virtu fact compon resid distribut system multipl point control compon host execut concurr true parallel achiev compon resid host concurr possibl parallel execut lead synchron compon commun synchron achiev wai compon block wait compon complet execut request servic form commun refer synchron issu compon continu perform oper synchron servic provid compon point synchron initi client compon case interact call defer synchron synchron initi server refer asynchron commun applic engin basic mechan support form synchron commun compon compon involv servic request form commun refer group request case compon interest event occur compon distribut stock ticker applic share price commun multipl distribut displai inform trader updat time manner basic mechan commun multicast network protocol addit support achiev reliabl deliveri modul librari part central applic resid main memori applic execut inappropri distribut compon host shut compon host machin stop host resum resourc requir compon host greater resourc host depend natur compon idl long period wast resourc virtual memori time distribut compon activ deactiv independ applic execut middlewar enabl compon programm determin activ polici defin compon activ request execut thread request queu reliabl network protocol vari reliabl protocol practic necessarili packet sender transmit receiv receiv order preserv distribut system implement put error detect correct mechan place cope reliabl deliveri servic request servic result free reliabl paid perform engin reliabl perform flexibl servic request reliabl practic commun servic request reliabl suggest distribut system literatur effort servic request give assur execut request request execut happen request notifi failur servic request possibl highest reliabl provid execut addit reliabl defin group request literatur mention request denot compon receiv commun specif period deliveri request attempt address compon final group commun denot request overtak request previou group commun reliabl discuss appli individu request extend request transact import primit build reliabl distribut system transact enabl request execut isol durabl manner mean sequenc request perform enforc complet transact consist demand transact isol concurr transact final transact complet effect undon middlewar critic applic support distribut transact reliabl replic compon mean compon resid copi host system compon host replica host provid request servic compon intern state replic state sync involv engin replic applic engin expect middlewar support replic scalabl scalabl denot abil accommod grow futur load central system scalabl limit load host central server system bear limit overcom distribut load host challeng build scalabl distribut system support alloc compon host chang architectur system design code compon dimens transpar identifi refer model respect design architectur system access demand compon access servic compon independ local remot locat demand compon physic locat compon request servic detail discuss transpar dimens scope paper reader refer compon access servic physic locat chang request load balanc mechan migrat compon machin order reduc load host load host transpar user migrat refer migrat transpar replic load balanc nent servic high demand exist multipl copi replic transpar denot transpar request obtain servic master compon replica transpar criteria difficult distribut system built base network protocol middlewar support migrat replic transpar provid basic mechan administr move compon host administ replic polici make system scale heterogen compon distribut system procur includ legaci compon result heterogen heterogen present hardwar oper system program languag middlewar hardwar platform encod atom data number charact mainfram charact unix server ascii pc unicod charact encod charact encod data type platform adjust mainfram risc mean byte encod long float point number byte number host host vice order byte number encod swap integr legaci compon occur program languag program languag follow paradigm legaci compon tend written imper newer compon implement program languag languag differ object type approach inherit late bind differ resolv compon integr coher comput facil approach middlewar avail middlewar solut present select optim singl multipl middlewar system combin varieti reason middlewar requir due avail program languag form middlewar hardwar platform window corba middlewar system perform characterist depend middlewar backbon middlewar local compon middlewar implement middlewar type middlewar order facilit distribut system construct middlewar solut discuss classifi middlewar product categori classif abstract product conceptu framework compar approach discuss address requir delin previou section transact middlewar middlewar support transact involv compon run distribut host middlewar commit protocol implement distribut transact product categori includ cic network transact middlewar enabl applic engin defin servic server compon implement server compon client compon defin transact request servic client server compon resid host request transport network transpar client server compon client compon request servic synchron asynchron commun transact middlewar support activ polici servic activ demand deactiv idl time activ perman server compon resid memori time client compon cluster servic request server compon resid machin order implement transact middlewar assum particip server implement commit protocol server compon built manag deleg implement commit manag system implement standard defin open distribut transact process adopt open defin programmat interfac commit wide support relat manag system mean distribut compon built manag system easili particip distribut transact make automat recov end complet transact transact monitor support load replic server compon replic server base replic capabl manag system provid server compon reli transact middlewar support heterogen compon resid hardwar oper system platform data heterogen resolv client marshal actual servic paramet server return result manual compon programm tediou manag system particip due standard protocol discuss shown transact middlewar simplifi construct distribut system transact weak creat big overhead transact acid semant inappropri client perform activ marshal data structur client paramet servic requir manual api commit standard approach defin servic server compon offer complic port distribut system transact monitor middlewar middlewar support commun distribut system compon facilit messag exchang product categori includ java messag queue network client compon mom send messag server compon network messag notif request execut servic server compon content messag includ servic paramet server respond request client result servic execut strength mom paradigm support asynchron messag deliveri natur client continu process middlewar messag eventu server send messag includ result client collect messag time achiev client server lead scalabl system implement synchron request cumbersom synchron implement manual client strength mom support distribut messag multipl receiv transpar client mom achiev implement messag queue store messag temporarili persist storag sender write messag messag queue receiv unavail due messag queue retain messag receiv assess strength weak note class middlewar implement distribut event notif architectur persist messag queue mean event notif achiev fault toler wai compon receiv event restart failur middlewar weak support messag deliv mom support transact atom deliveri messag receiv limit support scalabl heterogen support scalabl resolut heterogen limit applic builder resolv heterogen data structur transact marshal applic data structur messag program applic make middlewar cumbersom procedur middlewar remot procedur call invent sun microsystem earli part open network comput platform sun provid remot procedur call part oper system submit rpc standard adopt part distribut comput environ rpc unix implement window oper system network rpc support definit server compon rpc program rpc program export number procedur paramet type client resid host invok procedur network procedur middlewar implement procedur call marshal paramet messag host server compon locat server compon messag execut procedur transmit result back requir marshal implement client server automat creat compil rpc program definit rpc synchron interact client server compon asynchron commun support directli procedur middlewar procedur middlewar support form activ server compon activ polici defin remot procedur program start demand startup rpc server start daemon request arriv requir addit configur tabl map remot procedur program locat program file system rpc execut semant procedur middlewar return except rpc fail semant transact support rpc program procedur middlewar program languag hardwar oper system platform procedur middlewar standard defin standard data transport request result standard network data marshal rpc stub translat data standard form map perform procedur middlewar weaker transact middlewar mom fault toler scalabl coordin primit procedur middlewar restrict support synchron invoc directli procedur middlewar improv transact middlewar mom respect interfac definit implement automat marshal servic paramet result disadvantag procedur middlewar interfac definit reflex mean procedur export rpc program return rpc program middlewar resolv problem object compon middlewar middlewar evolv rpc develop middlewar mirror similar evolut program languag program evolv procedur program languag idea make object identif refer develop distribut system system class middlewar includ common object request broker omg latest version compon object remot method invoc capabl java recent product categori includ middlewar support distribut java bean discuss compar import class middlewar briefli refer detail network object middlewar support distribut object client object request execut oper server object resid machin client object object refer server object marshal oper paramet result achiev stub gener interfac definit default synchron primit object middlewar synchron block client object server object return synchron primit corba support defer synchron asynchron object request object middlewar support activ polici includ server object activ time start thread start oper request concurr queu execut sequenti corba support request event servic servic implement architectur default reliabl object request object middlewar support client catch order detect failur occur execut request corba notif servic achiev reliabl object middlewar support concept transact corba object transact servic cluster request distribut object transact integr transact server java transact servic capabl rmi support object middlewar build scalabl applic limit corba implement support emploi server return object refer server load factori creat server object load host support replic limit object middlewar support heterogen wai corba multipl program languag bind client server object written program languag standard data resolv heterogen data form approach heterogen resolv java virtual machin client server object resid form object middlewar corba defin iiop govern corba implement exchang request data leverag protocol transport protocol remot method mean java client remot method invoc corba server vice versa corba specifi specif object middlewar power compon model integr capabl procedur middlewar scalabl object middlewar limit prevent deploi distribut object paradigm middlewar middlewar product successfulli emploi industri numer prevent applic domain shortcom lead inflex system respond chang scale local area depend suit wireless network issu address state art middlewar research discuss flexibl middlewar middlewar product compon identif mom messag directori corba bind compon client compon make resolv bind order obtain refer server compon mean client uniqu identifi albeit applic unreason assum client compon identifi compon obtain servic lead inflex architectur client compon dynam adapt servic provid trade suggest altern offer flexibl iso standard defin princip characterist trade idea similar yellow page telephon directori locat base servic type trader regist type servic server compon offer qualiti servic client queri trader server compon provid servic type demand qo trader match servic queri servic offer return compon refer client client server commun involv trader idea trade matur start adopt middlewar product omg defin trade servic adapt trader idea distribut object paradigm implement servic trade enabl dynam connect client server compon base servic characterist approach flexibl execut environ compon reflect reflect wellknown program languag program reflect mechan discov type class reflect support extend current middlewar product interfac repositori dynam invoc interfac corba enabl client programm discov type server compon dynam creat request compon current research reflect middlewar reflect object compon model aim support meta object protocol protocol inspect adapt middlewar execut environ environ inspect environ support queri behaviour messag thread schedul request adapt environ enabl compon adjust behaviour middlewar event transport marshal middlewar creat undu overhead case data amen transmiss network solv heterogen data investig combin middlewar xml suggest transmit xml document uninterpret byte string middlewar combin motiv fact xml support semant translat data structur fact exist markup languag leverag http protocol xml origin inappropri meet reliabl requir scalabl middlewar middlewar successfulli scalabl applic current middlewar standard product limit prevent global distribut system current middlewar platform support replic extent global distribut state art search address problem replic tanenbaum address problem distribut object middlewar globe project aim globe provid middlewar scale billion user achiev globe make extens replic unlik replic isi globe assum exist applic replic strategi suggest replic transpar design server object globe assum type object replic strategi replic strategi produc replica object proactiv middlewar good summari state art middlewar produc eu fund network excel current middlewar product limit system request prioriti memori requir current middlewar product prevent system problem address research group tao corba prototyp develop support request priorit definit schedul polici corba specif build research standard minim middlewar product implement specif expect wide year middlewar mobil comput current middlewar product assum continu avail network connect achiev physic mobil host reason wireless local area network achiev reason bandwidth oper host reach hundr metr base station network occur mobil host roam area cover base station enter wireless network gsm similar problem cell bandwidth order magnitud gsm achiev state art wide area improv situat year problem occur current middlewar product wireless network protocol treat unreach server client compon except situat error client server compon programm deal transport chosen wire network bandwidth middlewar product tion simplifi translat heterogen data rout messag intend receiv inappropri packet wireless connect research middlewar mobil comput aim overcom issu provid coordin tupl treat unreach normal except situat compress transport save bandwidth good overview state art mobil middlewar avoid delv detail paper softwar engin middlewar trend import discuss impact middlewar softwar engin research middlewar product conceiv deliv benefit construct distribut system rapidli adopt industri middlewar vendor proven track record incorpor middlewar research result product defin adopt corba standard year corba product good chanc research area mobil middlewar state practic year research softwar engin distribut system deliv method tool compat capabl current middlewar product provid middlewar research gener softwar engin research result limit industri industri adopt middlewar deliv benefit ignor incompat softwar engin research middlewar product support program larg ignor activ softwar process distribut system chanc achiev softwar engin middlewar aim section identifi softwar engin research theme lead method tool support life cycl activ build distribut system middlewar requir engin challeng scalabl heterogen distribut system construct discuss section engin face natur softwar engin defin softwar architectur meet requir relationship nonfunct requir softwar architectur poorli understood discuss requir engin perspect relationship exist requir engin method tend strong focu function requir driven approach jacobsen recent ration complet ignor concern provid augment specif address nonfunct concern characterist input concern quantifi order engin scalabl engin quantit requir model requir peak load transact data volum architectur expect scale requir engin research method tool elicit model requir quantit point view middlewar system chosen softwar extrem revert choic adopt middlewar architectur choic influenc requir requir tend unstabl chang time requir chang set system hardwar oper system platform ad result scalabl requir result built interfac custom directli requir engin identifi current elicit estim rang evolv plan life time distribut system softwar architectur work influenc middlewar softwar notabl except research softwar architectur descript languag function complet specif global properti requir achiev architectur attribut individu compon connector architectur descript languag distribut softwar engin research identifi method tool support defin architectur architectur style softwar engin systemat deriv softwar architectur meet set requir overcom includ support identifi middlewar combin middlewar problem hand softwar engin research defin architect process capabl mitig risk wrong middlewar architectur process reli method quantit model perform scalabl architectur achiev model check techniqu valid model meet requir model calibr metric collect observ middlewar perform practic architectur descript languag support explicit model connector mean compon commun main contribut observ connector implement middlewar primit add observ middlewar support limit set connector behaviour connector explicitli adl model architect opt middlewar complet unnecessari connector separ adl develop support connector provid middlewar design argu middlewar design transpar design number factor transpar necessit design awar fact middlewar involv compon commun compon factor network latenc impli commun distribut compon order magnitud slower local commun compon activ state compon lead implement persist compon compon design cope parallel interact bound happen distribut environ compon choic synchron primit middlewar offer exploit properli avoid deadlock live problem occur result synchron primit softwar engin commun develop design method tool concern account discuss state art middlewar research highlight trend give programm influenc system behav replic schedul polici reflect capabl influenc middlewar execut engin design mean effect programm middlewar distribut heterogen transpar middlewar research commun put forward good programm aid design distribut compon method tool design replic schedul polici reflect capabl softwar engin research summari discuss construct distribut system difficult support softwar engin expect current middlewar product simplifi task review current state art middlewar research knowledg deriv softwar engin research agenda produc method tool support activ life cycl softwar engin process refer bate state art distribut depend comput technic laboratori commun cambridg oct proc ifip int conf open distribut page goodman concurr control recoveri system addison build secur reliabl network applic man box essenti addison weslei charl middlewar move forefront ieee page cheung java transact servic sun san antonio palo ca mar wang dcom side step layer layer page januari editor architectur intern reflect st volum lectur note comput scienc van ficka requir acquisit scienc comput di rosenblum exploit adl architectur style induc middlewar infrastructur proc st int conf softwar lo page acm yu gener architectur prototyp ieee workshop futur trend distribut comput page ieee comput societi dec engin distribut object john wilei apr schwarz markup meet middlewar int workshop futur trend distribut south page ieee comput societi introduc standard schreiber distribut comput ibm goldberg languag implement addison grai note oper system oper advanc volum lectur note comput chapter page hall build applic sharma java messag servic specif technic sun nov microsoft transact server program microsoft guid intern structur infin infin network trade model overview iso inform process system open system interconnect basic refer basic model technic intern standard rumbaugh unifi softwar develop process addison softwar case driven approach addison javasoft java remot method invoc jdk oct bobrow art protocol mit javabean neuman scale distribut system read distribut comput system ieee comput societi object manag group common object servic edit connecticut ma decemb object manag group notif servic connecticut ma jan object manag group common object request architectur specif connecticut ma februari open editor remot procedur call open edward instant corba picco softwar engin perspect mobil futur softwar engin acm levin evalu strategi corba dynam schedul intern ieee symposium ieee comput societi siegel compon object preview corba ieee page tanenbaum distribut system ieee page group distribut transact version isbn
Agents/5 1 dynam servic provis hsu softwar technolog laboratori hp laboratori palo usa abstract claim infrastructur provid shift static distribut comput dynam distribut develop infrastructur realiz shift show impact softwar engin comparison distribut system corba demonstr highli dynam system integr servic provis infrastructur extens differ agent platform infrastructur support dynam behavior modif agent design fix set predefin function carri load modifi fly adjust capabl accommod environ requir plai role multipl applic featur support manag facil commonli manag resourc modifi problemsolv capabl infrastructur system develop easili top system support dynam servic modif movement prototyp develop hp lab made extern research group introduct distribut problem solv decentr decentr task handl autonom agent global control cooper task accomplish agent inform exchang task share agent suffici inform solv entir problem support distribut problem system develop voyag concordia effort agent standard agent interop work omg www consortium applic requir particip agent dynam issu properli address intuit player plai role situat action fix dynam modifi exist agent behavior fix time agent creat chang agent total replac agent mobil agent move close reduc commun cost perform predefin static code action cooper import particip agent plai maintain ident consist commun retain knowledg system resourc requir softwar agent capabl partial chang behavior total replac agent support dynam softwar agent distribut dynam tune execut persist store data object program object multipl resourc manag facil manag data program object suffici agent equip fix set practic capabl develop scratch agent motiv develop infrastructur infrastructur extens uniqu featur support dynam behavior modif capabl differenti agent platform infrastructur carrier individu program agent behavior gain modifi dynam load java class repres knowledg applic program provid manag facil distribut store program maintain commonli applic program commun cooper agent infrastructur design make easier develop autonom softwar agent modifi modifi move servic client load program fly infrastructur greatli simplifi cooper system prototyp infrastructur implement hp build distribut data mine system paper explain dynam behavior obtain util demonstr automat action commun describ commun action part action carri discuss trigger mechan dynam behavior paper organ comparison relat work section architectur section cooper discuss section extend illustr section final conclud remark section static relat work distribut comput system construct fundament static dynam distribut static static configur distribut comput system typic characterist fix locat servic configur invok comput remot method make invoc transpar function fix set function remot infrastructur function invok server interfac interfac term interfac definit languag server object essenti implement interfac point server predefin behavior stationari servic servic provid mobil implement interfac necessarili portabl movabl remot function invoc mechan gener base send request result server fix locat flow program object support servic provid static regist distribut comput infrastructur dangl object static configur framework applic obviou limit highli dynam cooper problem solv requir system compon act time adjust behavior fly accommod environ exchang program modul cooper distribut dynam locat static behavior dynam servic servic modifi move flexibl demand requir system compon dynam configur modifi reset capabl fly java program foundat move data program agent includ gener voyag concordia support agent commun mobil agent creat remot site agent commun languag knowledg exchang protocol kqml effort incorpor kqml corba undertaken offer remot invoc provid start point system internet exist agent platform lack reason softwar server client static code predefin function odyssei agent object instanc fix set thing defin object platform support servic reconstruct chang behavior mobil agent bring capabl travel agent lack knowledg program manag facil support dynam behavior cooper solut solut problem implement softwar agent develop manag execut action capabl modifi chang data program object carri cooper establish exchang unlik gener creat problem solv capabl gain dynam load java class repres knowledg applic modifi distinct featur builtin manag capabl handl resourc persist knowledg action object multipl applic comparison remot invoc object interfac refer fix set function view dynam interfac servic configur modifi fly repres altern paradigm distribut comput adequ support todai comparison exist agent support mobil behavior updat function flexibl launch function chang carri maintain consist ident commun channel cooper work featur odyssei agent voyag function chang launch receiv reload program odyssei altern function provid launch addit agent chang behavior made partial base avoid cost move agent knowledg program manag facil carri greatli simplifi develop system system lightweight manag gui enabl form fix part changeabl part consist knowledg action program determin capabl fix part applic program act architectur action carri capabl behavior gain modifi dynam load java class repres knowledg applic program receipt messag api instanti execut carri function access activ commun manag capabl provid lightweight manag capabl distribut action program store knowledg applic program manag messag receiv interpret messag interact style includ messag forward support handl instanti execut applic program carri multipl action program provid varieti continu automat process messag put network locat servic start stop flexibl handler instanti execut agenda object agenda object repres list concurr condit task task request agenda involv agent maintain object data packet java class instanc includ languag address instanc class agent servic api protocol object action mainten auto displai agenda handler agent servic load carri gui resourc handler action handler messag handler execut inbound outbound figur basic structur agent applic execut manag servic access updat data perform commun offer refer underli manag action refer access api servic simplifi develop carri enhanc abil cooper mobil mobil support level action level creat system call run local site launch clone remot site send request instal site clone made option remov remov origin logic move copi origin agent clone launch agent local remot notifi send resourc clone origin agent receiv forward incom make messag lost infrastructur support program exchang program object exchang data object program knowledg modul carri movabl internet benefit reduc bandwidth consumpt met level mobil comparison mobil agent mobil program ad flexibl dynam system reconstruct integr coordin uniqu identifi socket uniqu symbol coordin agent provid servic coordin ad distinct maintain agent registri list attempt regist symbol address coordin send messag coordin commun send messag address consult coordin obtain address instruct load program address consult coordin request sender obtain address record address aliv form hierarch group group coordin option servic resourc directori servic dynam behavior modif capabl applicationspecif function creation gain load local remot rule activ open server dynam system commun commun action carri support action applic develop action java program arbitrari function order access agent servic program wrap java class implement interfac class support class librari network class loader load java program java identifi url instanti instanc load program start execut action fall style action action start task finish daemon action start request provid continu servic addit servic interfac provid explicitli stop kill daemon action action run send messag enabl action api messag start action local open server provid continu servic flexibl load start open server extend capabl servic flexibl configur dynam extend agent dynam extend manag servic open server java class develop subclass class support class inherit capabl function agent includ access servic open applic program open server environ wrap deploi agent applic exogen signal messag program type exogen inform made agent deploi agent analyz request web request forward web server agent cgi program open server deploi agent monitor web request provid cgi convert request agent messag insert input queue open server architectur agent servic incorpor environ wrap function seamlessli agent infrastructur commun commun program carri exchang support carri action agent carri subclass subclass resourc manag facil carri facil send launch clone retriev updat object access load action agent displai data agent carri action start pass inform paramet action action program messag agent action creat receiv thread regist socket instanc agent api carri action multipl action carri exchang inform synchron mechan emploi object piec replac send action receiv action commun specif program modul provid java program commun creat receiv send list socket prior receiv list result object mechan pass document url web cgi program trigger distribut data mine task involv multipl inform relat suggest relat return convei user easi system compon approach conveni dynam system integr mechan trigger modif agent behavior behavior case load program knowledg object oper situat requir chang behavior receiv messag content possibl coordin messag interpret load class receiv request execut program coordin internet address load creat start execut equip specif basic intellig decid chang behavior base knowledg state carri applic enabl applic java develop quickli program develop carri system integr dynam servic provis static structur distribut servic provid stationari introduct liber servic provis static configur underli support persist object integr system integr made fly provid dynam configur servic dynam servic provis scenario implement infrastructur applic program run gener plan base applic logic condit involv multipl manual program task remot order resourc execut requir workflow servic execut provid dynam step launch fly load workflow carri program task messag request download server request download server url messag send messag request download understand assign start process execut task execut work item gener manual task user program task download program execut execut result back flow control termin decid termin workflow server launch agent workflow server client pm process manag pm request load pm server execut busi process send process definit request load server request load process manag pm process manag pm worklist manag worklist manag worklist manag dispatch softwar agent figur dynam servic provis illustr dynam configur workflow cooper provid configur extend cooper team mention earlier player cooper plai role situat dynam modifi consist ident basic featur requir cooper problem solv infrastructur possess list gener featur cooper problem solv commun abil present request exchang move locat support manag resourc action partial chang behavior replac retain ident state cooper problem solv compar move partial chang minim network traffic coordin servic addit servic provid group cooper servic provid coordin design team multilevel problemsolv call shown featur discuss rest detail resourc manag servic maintain directori regist program messag interpret open server agenda directori map program url receiv request execut program exist objectstor url consult obtain address load program case coordin isol servic request servic provid carri applic transpar make request servic featur explain applic carri request servic provid send request send request maintain request queue process request individu thread request forward design address order result back interact servic provid push pull push activ send request servic provid poll wait servic send request repli messag support redund server server request automat balanc enhanc reliabl server request mark urgent receiv period time architectur support seamless interact multipl cooper problem solv distribut system monitor event treat asynchron agent messag deliv event subscrib event event notif event subscrib event gener make subscript call handl event gener event subscript applic domain case singl combin coordin receiv classifi event messag system probe distribut event messag regist event subscrib agent event distribut agent subscrib event prior knowledg subscrib agent arrang multilevel dynam form hierarchi form refer base applic spatial distribut resourc avail minimum includ coordin local servic provid kind resourc option previou exampl consid singl domain hierarch problem divid multipl tackl final solut entir problem gener level level term solut subproblem form coordin servic turn coordin level rule appli group coordin group coordin figur group local coordin domain resolut coordin hierarchi root domain coordin registri coordin coordin creat prior creation coordin domain resolut uniqu identifi regist coordin inform creation time address includ migrat load updat notifi broadcast chang domain resolut messag request messag foreign forward coordin forward involv multipl level request forward push featur form dynam static form distribut comput domain domain extend dynam servic provis manufactur increasingli reli realtim coordin plant subcontractor achiev time deliveri custom order prototyp simplifi manufactur schedul track system base infrastructur coordin set function sell number product commun custom order product group web server product group web server product manag platform product manag platform messag coordin platform plant manag platform plant manag platform plan plan figur agent manufactur process schedul track web check inventori creat custom involv multipl sequenti concurr job track execut deploi agent manag util resourc job assign load gener involv multipl manual program task interact notifi execut statu job make replan track capabl captur except resourc except congest deviat demand report coordin inform make make human expert modifi resourc alloc polici notifi relev polici turn adapt algorithm resourc tabl applic program system develop individu illustr dynam integr construct reconfigur servic featur capabl determin load updat restart carri manag server handl handl commun system compon support execut track plan action finish step emploi filter rule determin replan trigger condit express combin requir slack time knowledg current condit downstream chang remain part plan execut modifi plan perform track knowledg condit dynam filter rule dynam alter switch track plan action program react requir order environ plant polici program activ load handl job system compon plai role replac agent behavior maintain consist identifi commun channel temporari launch carri coordin dynam launch brought line notifi exist dynam gain abil commun exist distribut infrastructur corba provid stationari servic exist mobil agent infrastructur support agent fix set function infrastructur lack support mobil merg develop softwar agent dynam modifi capabl agent core system support impract develop support function scratch agent infrastructur provid solut problem prototyp develop hp lab made extern research group provid core system carri capabl chang fly claim approach repres shift static dynam distribut suitabl highli dynam servic provis higher autonomi cooper exist type agent chang capabl handl multipl task retain support mobil agent level program modul manag knowledg action object provid persist multipl applic point behavior class capabl chang dynam softwar engin point notion introduc work greatli reduc system infrastructur dwell task make easier develop deploi adapt mobil softwar agent carri task cooper dynam experi infrastructur dynam system integr dynam servic provis refer base architectur commun intellig agent cooper servic network manag proc int conf manag multimedia network dayal dynam softwar agent busi intellig applic inten confer autonom chen dayal contract transact hierarchi proc chen dayal transact nest process manag system proc intern confer data engin transact model long run activ proc tim yanni jame mayfield kqml agent commun languag softwar mit franklin graesser taxonomi autonom agent proc intern workshop agent hr mr design manufactur agent interact proc michael genesereth steven ketchpel softwar agent cacm architectur adapt intellig system artifici special issu agent ibm program mobil agent java wooldridg jen intellig theori practic knowledg engin review mae artifici life meet lifelik autonom agent cacm gener magic agent odyssei hs nwana softwar overview knowledg engin omg architectur specif omg doc petri intellig ieee expert smith contract net commun control distribut problem solv ieee tran comput agent societi agent product research activ object space voyag core packag technic overview white
Agents/6 1 intern joint confer autonom agent multiag system juli hybrid mobil robot architectur integr plan control low dept comput scienc nation singapor scienc drive singapor singapor wee dept comput scienc nation singapor scienc drive singapor singapor jr dept mechan engin nation singapor kent ridg singapor singapor abstract research plan control mobil robot receiv attent past decad basic approach emerg research delib reactiv approach distinguish di erent usag data global speed reason complex comput strength complementari weak mitig combin approach hybrid architectur paper describ method navig unpredict environ emploi hybrid architectur asynchron oper behavior modul di er exist hybrid architectur import plan modul produc sequenc checkpoint convent complet addit obstacl reactiv modul perform target reach control neural network neural network train perform smooth motor control move robot checkpoint aspect facilit tight integr plan permit perform easi path modi cation robot en rout goal posit categori subject descriptor arti cial cial neural cial robot gener term theori permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee juli itali copyright acm keyword hybrid agent mobil percept action system introduct research plan control mobil robot receiv attent past decad basic approach emerg research delib reactiv delib approach global world model gener sequenc action agent reach speci ed goal perform approach gener optim sequenc static complex environ plan process typic time approach react quickli unforeseen environ reactiv approach directli coupl data motor action respond robustli time unexpect obstacl unforeseen environ lack global knowledg sequenc action produc global optim fail react correctli complex environ approach distinguish usag data global speed reason complex comput strength complementari weak mitig combin approach hybrid architectur exist hybrid task plan focu integr reactiv motor control motion path plan paper describ method navig unpredict environ emploi hybrid architectur asynchron oper behavior modul di er exist hybrid architectur import architectur framework perform continu encod nite set discret encod set method produc veloc torqu control motor perform smooth motion control plan modul produc sequenc checkpoint complet motion path constraint adher strictli gener path longer exist approach adopt perform exist hybrid architectur optim capabl reactiv compon fulli exploit extrem workload plan modul exce reactiv modul plan modul plan exact motion path gener detail sequenc action execut actuat reactiv modul perform singl obstacl make minor modi cation good action good exploit strength reactiv robot compliant motion control method al control reactiv robot manipul perform polish task react forc act method provid smooth motion control manipul follow contour surfac polish hybrid architectur addit obstacl reactiv modul architectur perform target reach control neural network neural network train perform smooth motor control move robot checkpoint plan plan modul characterist facilit tight integr plan permit realtim perform easi path modi cation robot en rout goal posit integr framework overview integr framework consist main block modul highest delib plan modul produc sequenc checkpoint start point goal variat cell decomposit method main di erenc algorithm oper robot workspac con gurat space unlik convent plan algorithm plot detail path current implement achiev singl goal time achiev possibl con ict plan algorithm order goal reactiv block consist level rst target reach modul determin motion path checkpoint checkpoint state rel current state output motor control signal neural network train produc sequenc control command move robot checkpoint obstacl presenc local unforeseen move obstacl produc addit motor control command repel robot obstacl control modul intern state robot maintain intern stabil coordin automat control oper space control intern joint forc regul dynam behavior robot manipul task execut modul strictli requir mobil robot crucial mobil manipul task robot manipul object environ base motion modul constitut reactiv model motion control command fusion modul combin control command reactiv compon nal command actuat modul oper asynchron di erent rate plan modul typic oper time scale minut depend task complex target reach modul oper servo tick obstacl avoid modul oper interv ms control modul oper ms interv command fusion modul activ control command gener section asynchron execut modul kei preserv reactiv capabl improv perform delib planner planner remov result architectur degrad pure reactiv system capabl complex motion task hybrid architectur applic mobil robot robot manipul paper target reach obstacl avoid modul integr plan speci applic mobil robot target reach task task perform extend kohonen map train produc sequenc motor veloc command method util plan modul gener checkpoint separ paper section describ control achiev indirect map sensori input motor control advantag discuss section indirect map adopt egocentr sensori input vector direct distanc checkpoint rel robot current locat head goal state time sensorimotor coordin linear motor control vector cp relat sensori input vector linear equat cp matrix motor control paramet control problem reduc determin train sampl sensorimotor coordin point check local obstacl actuat obstacl avoid reach target command fusion control state intern plan world model reactiv model time scale delib model figur hybrid architectur integr plan control combin plan modul delib model control reactiv model figur target reach modul neuron map sensori input space indirectli motor control space control paramet space linear problem real motor nite nonzero amount time order chang speed nonlinear problem complic robot solv nonlinear train partit sensori input space local linear region neuron sensori weight vector encod region center set output weight encod output produc neuron unlik exist method output weight neuron repres control paramet paramet space motor control vector control paramet matrix map actual motor control vector cp linear model eq motor control perform motor control sensori input vector determin win neuron win neuron neuron sensori weight vector wk dk nearest input wk min di erenc weight di erenc constant paramet minimum eq set neuron encod similar angl pair direct prioriti distanc competit neuron method robot quickli orient face target move comput motor control vector cp target cp constant vector denot upper limit physic realiz motor control signal khepera robot cp consist motor speed vr robot left wheel de ne cp vr note cp simpli satur wheel speed work target align robot satur wheel speed move robot forward correct robot robot reach target motor control algorithm appli time step comput motor control vector current sensori input repeat robot reach goal state time step approach map sensori input region sensori input space repres neuron discret point ck motor output space cp ck small number point repres neuron motor output space sampl indirect approach map local linear region di erent point cp eq map linear indirect approach map region region provid ner smoother control robot motion direct map indirect map contrast exist onlin train adopt train motor control vector cp gener inaccur control vector cp robot displac produc cp map cp indirectli robot move learn correct sensorimotor control accur onlin train ne tune indirect map train algorithm summar train repeat sensori input execut motor control algorithm move robot sensori input comput actual displac di erenc train input determin win neuron step motor adjust weight neuron neighborhood nk win neuron gaussian function distanc posit neuron constant learn rate updat weight neuron neighborhood nk minim error vk appli gradient descent obtain train weight win neuron neighbor neuron modi ed amount modi cation proport distanc neuron input weight updat actual displac control paramet updat map displac motor control cp neuron stabil state cp win neuron sensori input wk neuron produc motor control output cp yield desir displac wk sensori input wk close wk motor control output cp produc neuron yield correct displac linear hold input region front rear motor motor figur obstacl avoid connect sensor side robot bodi motor opposit side larg neg valu connect small posit valu activ neuron neuron produc approxim linear sensori input space produc ner smoother motion control obstacl avoid reactiv obstacl avoid modul adopt architectur braitenberg vehicl set sensor motor veloc obstacl avoid comput ij control matrix matrix element ij link sensor side robot bodi motor opposit side larg neg matrix element small posit valu robot presenc front motor rotat backward faster left motor rotat turn robot obstacl similar approach adopt architectur ferber main di erenc ferber assign di erent set weight di erent behavior includ obstacl left wall wall corridor left static static forward move method set weight remov recogn di erent situat select di erent simpli es reactiv modul section di erent behavior emerg natur interact robot environ command fusion motor control obstacl avoid ad motor control target reach cp produc nal motor control signal cp constant paramet control ch motor omit equat analog potenti eld method obstacl avoid overcom small unforeseen obstacl move obstacl recal target reach obstacl avoid modul run di erent rate time modul produc motor control updat global motor combin motor control signal robot wheel drive robot absenc motor control signal regular interv presenc addit control signal obstacl detect method robot run smoothli make adjust experi discuss quantit evalu experi conduct assess quantit qualit perform hybrid architectur mobil robot navig experi perform simul khepera mobil robot neuron train environ trial time step time step target reach control sec weight initi correspond regularli space locat sensori input space robot began train origin randomli select sequenc checkpoint present robot task move weight modi cation perform time step robot made move time interv step xed test process conduct robot began origin present random target locat sequenc robot task move target locat train trial repeat ve time test perform averag ve trial test perform index measur trial posit error averag distanc center robot ith target locat stop motor control rn number trial number test target locat result show indirect posit error began stabil time step impli began stabil time step end time robot driven train posit error mm adopt method stabil time robot posit error mm radiu robot mm reason regard robot reach target mm perform indic base target reach criterion direct indirect time step figur posit error train stage target reach probabl measur probabl robot reach closer distanc target locat train normal measur long robot reach closer distanc rn earliest time robot reach closer distanc ith target straight line distanc target locat normal time reach target normal measur averag amount time robot travel distanc result show indirect map robot close target high probabl reach target time step direct robot lower probabl reach close target time step reach test result show indirect robot reach target faster closer direct map advantag indirect map assess result figur illustr end ve train trial neuron cluster radian neuron cluster similar neuron spread sampl distanc neuron sampl distanc note furthest khepera robot move singl time step sampl sensori input space complet produc ner control robot qualit evalu robot perform qualit assess environ unforeseen static move unexpect chang environ environ consist room connect doorwai robot began room task move indirect direct direct indirect figur perform comparison train target reach probabl normal room checkpoint robot regard reach checkpoint mm checkpoint robot requir stop goal target reach modul ran sec interv obstacl avoid modul ran sec interv rst test unforeseen static obstacl middl room rst checkpoint reach rst robot detect wall deviat slightli left reach rst checkpoint move robot detect unforeseen static obstacl react presenc obstacl obstacl reach checkpoint robot made sharp turn due direct goal head test mobil circular serv move obstacl target reach robot rst met obstacl avoid turn encount obstacl divert left move obstacl head nalli goal test checkpoint previou test initi plan robot robot en rout highlevel plan modul realiz environ chang checkpoint plan target reach modul target reach figur result direct indirect map dot denot weight neuron figur motion robot environ unforeseen static obstacl checkpoint black locat doorwai goal posit robot obstacl reach goal room drawn scale figur motion robot environ obstacl move circular path robot negoti past move obstacl proce checkpoint figur motion robot environ chang initi checkpoint plan assumpt lower doorwai open plan modul chang checkpoint checkpoint robot en rout target reach modul react immedi chang robot head modul chang head robot en reach goal checkpoint test demonstr advantag integr approach plan easili modi ed chang checkpoint target reach modul react immedi chang produc chang exist architectur plan entir path make detail modi cation path turn robot account robot current motion robot control train move checkpoint successfulli path robot checkpoint perfectli straight due realist constraint robot motor control inject obstacl avoid target reach modul strictli discret servo interv simul automat inject sensor input motor offer realist simul robot control path close straight line hybrid architectur implement reactiv compar ferber robot exhibit rich set behavior includ move avoid static move react immedi chang path behavior emerg interact robot environ hybrid architectur integr plan control present paper di er exist hybrid architectur wai architectur framework perform continu encod permit smooth motion control plan modul produc sequenc checkpoint complet path integr plan modul reactiv target reach obstacl avoid target reach modul control neural train onlin move robot checkpoint neural network easili train control di erent mobil provid exibl adapt lack reactiv control simpl local reactiv strategi braitenberg emploi obstacl avoid enabl robot overcom unforeseen convex obstacl paper show obstacl avoid capabl enhanc cooper multipl permit negoti unexpect concav obstacl quantit result show neural network perform ne control motion mobil robot accur ecient qualit test result show reactiv control modul seamlessli integr plan modul robot head easili made level robot en rout goal posit continu research goal appli integr framework plan control static mobil robot manipul acknowledg research support nu refer arkin robot mit arkin balch principl practic review theoret slack experi architectur reactiv agent theoret braitenberg experi synthet psycholog mit brock motion framework motion plan con gurat space proc volum page brock khatib execut motion plan robot freedom dynam environ proc volum page brock khatib navig global dynam window approach proc page brook robust layer control system mobil robot ieee robot posit referenc consist world model mobil robot proc choi latomb reactiv architectur plan execut robot motion incomplet knowledg proc volum page connel minimalist mobil coloni architectur arti cial creatur academ connel hybrid architectur appli robot navig proc page ferber action select autonom agent hierarch distribut reactiv plan architectur proc page gat architectur arti cial intellig mobil robot aaai integr navig motion control system autonom mobil robot proc int symp robot veloso plan complet robot agent proc page oja situat motion behavior learn proc page hu bradi bayesian approach obstacl avoid mobil robot autonom ang lim oper space formul implement aircraft polish applic mobil manipul proc khatib uni ed approach motion forc control robot oper space formul ieee robot khatib mobil robot assist robot autonom exact robot navig mean potenti topolog proc page krogh thorp integr path plan dynam steer control autonom vehicl proc page laird rosenbloom learn soar extern environ proc page latomb robot motion plan kluwer low integr plan control mobil robot extend kohonen map master nation ang jr enhanc reactiv capabl integr plan control neural network proc moravec cho bayesian method certainti grid proc aaai spring symp robot page integr pomdp reinforc learn layer simul robot architectur proc page quinlan khatib execut motion task robot ritter extend kohonen map algorithm learn ballist movement von der neural comput layer architectur oc deliveri robot proc page agent architectur ful ll requir proc page schmidt map learn navig rhino mobil case studi success robot page mit gambardella learn coordin mobil robot invert kohonen map proc int workshop neural
DB/7 3 optim extern memori interv manag lar arg je rei scott vitter depart comput scienc duke nc submit siam journal comput april abstract paper present extern interv optim extern memori data structur answer queri set dynam maintain interv extern interv tree optim solut dynam interv manag central problem tempor constraint logic program part structur techniqu ecient manipul balanc tree independ interest extern interv balanc recent develop ecient extern data structur introduct recent year extern memori data structur develop wide rang includ geograph inform system amount data manipul applic larg main memori data resid disk case commun main memori disk bottleneck paper develop extern interv tree data structur answer queri chang set interv structur central part optim solut dynam interv manag problem memori model previou result work standard model extern memori disk assum extern memori access oper transmit extend abstract version paper present ieee symposium foundat comput scienc support part esprit long term research programm eu project number nation scienc foundat career grant part work dept comput denmark support part nation scienc foundat grant armi research oc grant page element measur ecienc algorithm term number perform number disk block dynam interv manag problem problem maintain set interv queri interv interv intersect report ecient discuss problem crucial index constraint constraint tempor kei compon dynam interv manag abil answer queri set queri point interv repres interv point queri reduc special case rang search call diagon corner queri corner line problem rang search subject research variant ed success support extern rang ineci handl problem intern memori ecient structur rang survei structur ecient map extern memori practic support led develop larg number extern data structur good theoret updat queri good behavior common survei perform data structur optim bound achiev dynam extern rang search prior develop structur present number attempt made solv extern queri problem kanellaki al develop tree answer diagon corner queri optim optim block extern memori denot number point report structur support insert amort simpler static structur bound ramaswami intern prioriti search tree mccreight answer gener queri diagon corner rang number attempt made extern structur structur al optim space answer queri structur optim space answer queri paper number dynam version structur develop ramaswami subramanian develop techniqu call path cach transform ecient intern memori data structur structur techniqu prioriti search tree result structur answer gener diagon corner queri gener queri structur answer queri optim support updat amort log log space extern data structur answer queri develop subramanian ramaswami design tree answer queri structur linear answer queri il support updat amort denot iter log number time log appli public extend abstract version paper base result arg al develop optim extern prioriti search immedi impli optim queri structur structur develop gener assum main memori capabl hold block structur develop paper work assumpt space queri bound updat bound prioriti search tree tree amort tree il amort path cach log log amort result figur comparison data structur queri data structur rang search relat problem survei overview result main contribut paper optim extern memori data structur queri problem data structur optim solut interv manag settl open problem highlight structur disk block maintain set insert delet perform queri answer figur compar result previou solut unlik previou updat bound data structur structur work assum intern memori capabl hold element structur signi cantli di erent recent develop extern prioriti search tree greater practic interest fewer random answer queri disk system optim sequenti random longer time sequenti solut queri problem extern version interv tree section present basic structur endpoint interv store structur belong xed set point section remov xed assumpt intern assumpt remov base search tree structur lead amort updat bound unsuit implement extern develop extern memori intern result amort updat bound section show remov amort structur extern interv tree develop structur dynam point locat visual applic chiang silva found applic intern memori convert amort bound bound constant result yield interv tree updat altern complic structur develop order add rang restrict capabl dynam data structur techniqu remov amort updat bound extern prioriti search tree solv gener problem extern interv altern extern interv tree point locat structur intern interv method extern recent develop optim extern prioriti search tree numer structur section discuss idea util extern interv tree develop extern segment tree log space improv extern segment tree log disk block interv tree xed endpoint set section present extern interv tree structur assum endpoint interv store structur belong xed set size assum intern memori capabl hold block remov assumpt section preliminari extern interv tree make extens kind auxiliari gener search tree structur suitabl extern memori lemma set element store structur disk updat queri perform smallest element report sort element built queri data structur ecient number interv store lemma vitter set interv store extern data structur disk queri answer number report interv discuss corner structur made dynam updat insert updat block structur rebuilt updat perform rebuild perform simpli load structur intern rebuild write back extern memori lemma assum set interv store extern data structur disk queri answer updat perform amort structur construct section show updat bound made process remov assumpt size intern memori section clearer structur call structur intern memori interv tree consist binari base tree sort set endpoint interv store secondari structur intern node tree node associ natur interv consist endpoint interv root divid interv vr children interv store interv interv left side boundari store left interv store search tree sort left endpoint interv sort endpoint perform queri report interv report relev interv vr interv interv sort left interv smallest left endpoint largest left meet interv interv interv sort order time report interv queri answer time total order extern interv tree structur ecient fanout base tree height creat problem main idea success extern compar previou attempt idea extern interv tree set interv endpoint xed set size de ned assum loss gener endpoint interv distinct jej base tree perfectli balanc fanout tree endpoint leaf repres consecut point tree height intern intern node associ interv consist endpoint interv divid subinterv interv children refer figur illustr call subinterv left endpoint boundari de ne contigu rang figur node store interv cross boundari boundari parent leaf store interv endpoint endpoint number interv store leaf store block set interv store secondari structur boundari store list interv endpoint sort endpoint left list interv left endpoint sort left endpoint boundari list boundari interv left endpoint endpoint sort endpoint number interv store list store ow structur interv list interv interv store interv list interv store interv ow structur number interv interv store list ow structur list ow structur interv secondari list structur implement ow structur implement corner structur node maintain inform size place structur index block xv xv xv xv xv xv figur node base tree interv store figur interv store list span de nition interv store list list ow structur interv figur store left list list list ow structur note similar list sort list interv node intern interv tree intern store sort list endpoint repres part left leftmost boundari part rightmost boundari unlik intern extern case repres part extrem boundari list extern interv tree linear space base tree block interv store constant number linear space secondari structur number block node index block block ow structur list intern structur total block note store list ow util block result space bound oper structur order answer queri search leaf report relev interv interv store node encount assum li boundari report relev interv load index block report interv list interv cross list perform queri ow structur report result report interv largest smallest encount interv report interv smallest largest encount interv easi algorithm report interv interv store list refer figur algorithm correctli report interv interv order list interv left similar argument hold search queri algorithm optim visit node node report read output load index overhead queri overhead note crucial obtain bound visit list interv lemma assum exist data structur disk block store interv uniqu endpoint set size queri perform interv insert extern interv tree search nding rst node boundari load index block insert relev list list insert interv list store ow structur insert structur bring number interv delet insert updat store index block order delet interv search node store delet list delet delet list delet interv insert updat store index block analyz note insert delet search node updat secondari list structur manipul ow structur case interv move list case updat involv interv requir time cost incur amort cost obtain theorem assum exist data structur disk block store interv uniqu endpoint set size queri perform updat perform amort gener extern interv tree order remov xed endpoint assumpt extern interv dynam search tree base tree intern memori base tree structur secondari structur node weight element involv oper updat access pass reorgan secondari structur result oper perform amort bound perform oper suitabl implement extern binari easi group node order maintain properti natur choic dynam base properti node weight involv oper updat access section develop variant call combin properti balanc normal oper fuse time weight properti import featur ratio largest smallest weight root children node small constant factor ratio exponenti height section show weight balanc remov xed endpoint assumpt extern interv tree normal leav level intern node constant weak wider rang number children de ne constraint weight number children characterist remain leav level perform split fuse intern node de nition weight leaf de ned number element store weight intern node de ned corollari weight intern node equal number element leav de nition branch paramet leaf paramet condit leav level weight intern node level weight intern node level weight larger root child lemma node paramet children root children proof leav ful ll intern node weight minim number children intern node level maxim number children root upper bound argument lower bound de nition corollari height element paramet perform updat rst search relev leaf perform actual order ful ll constraint de nition simplic insert section discuss delet handl global rebuild insert element leaf node path root node level weight order tree split node start work root element leav insert refer parent gener split node weight node weight insert refer parent split creat root perfect split gener perform split rst children rest children node level weight split ith child weight ful ll constraint de nition weight split node chang weight parent structur simpl implement node store level weight inform easili maintain updat previou discuss lemma combin prove lemma number oper insert paramet bound lemma crucial applic lemma split node level node insert perform split root tree element insert perform split proof split weight node split weight reach weight root creat level weight split weight simpler altern exist intern memori data structur ad rang restrict capabl dynam data structur gener techniqu ad rang restrict develop util base interv node augment dynam data structur set element structur rebuilt oper perform split node child child ful ll constraint properti section lead amort bound shown bound obtain complic rede nition branch paramet leaf paramet immedi obtain worst case larg number updat split node immedi impli good amort bound easili made worst case perform secondari structur rebuild lazili idea techniqu construct similar present section paper omit lazi rebuild solut complic perform mean simpli continu queri updat secondari structur lazili build develop numer cient intern extern data structur order obtain extern tree structur suitabl interv obtain theorem exist element search tree data structur disk search insert perform worst case intern node level divid element set insert perform split node node element insert time split order root element insert data structur proof intern node repres block space bound leaf element split perform load block store intern split write block de ning node back disk updat inform parent insert search bound follow directli corollari lemma part theorem directli de nition corollari lemma remov xed endpoint assumpt show remov xed endpoint assumpt extern interv tree base tree insert rst insert endpoint base tree perform insert interv section perform split split node interv tree figur illustr ect split node side boundari boundari side boundari parent interv secondari structur insert secondari structur rest interv store secondari structur result addit boundari interv parent move secondari structur refer figur interv secondari structur interv store left list collect interv move parent scan list rst construct list relev interv sort figur split split boundari parent figur solid interv move interv move interv move endpoint scan list scan list leav start rightmost ad interv automat sort construct list sort left endpoint scan left list similar secondari structur interv endpoint scan list linear number construct list construct list simpli remov interv list remov relev interv list scan leav collect interv list sort construct list construct list construct list simpli remov list remov list construct ow structur rst scan ow structur collect interv construct individu complet construct scan list collect inform index block parent insert interv secondari structur parent move interv structur interv endpoint simplic interv left endpoint interv endpoint interv handl similarli interv left endpoint store parent cross boundari interv left list possibl list introduc boundari interv move left list collect interv sort order scan interv store left list merg collect list interv construct result list easili updat bound interv list move list left boundari easili move relev interv construct scan similarli move interv left list left list interv ow structur list insert interv ow structur easili rebuild complet split process updat index block parent split node endpoint insert time split amort cost split node split obtain lemma assum exist data structur disk block store queri answer interv insert amort mention section delet handl global rebuild delet interv rst delet secondari structur section delet endpoint base tree mark endpoint leav base tree delet number perform updat queri delet perform rebuild structur log lead amort delet scan leav base tree construct sort list endpoint list construct leav base rest base tree insert interv structur base complet descript extern interv tree theorem assum exist extern interv tree disk block store queri answer worst case updat perform amort remov amort section discuss make updat bound theorem amort bound place xed endpoint version amort introduc result amort updat bound ow structur move interv ow list dynam base tree amort introduc amort node split bound global rebuild section show remov amort node split ow updat section show remov assumpt corner structur extern interv tree remain amort remov standard lazi global rebuild techniqu make global rebuild bound worst case log rebuild entir structur number endpoint fall rebuild distribut updat rebuild updat origin structur updat structur construct structur complet updat occur rebuild start perform updat perform oper process continu structur store set interv structur dismiss rebuild nish structur endpoint structur process construct time amort introduc move interv ow structur list remov similar recal move interv ow structur interv list number interv list fell remov amort move interv updat size list fall move interv ow structur insert delet involv insert perform ow structur delet perform ow structur interv move interv number interv ow structur reach move interv updat involv interv optim space queri bound maintain interv process prove main result theorem exist extern interv tree disk block store queri answer worst case updat perform worst case split node lazili recal node split boundari interv move parent interv parent move intern parent section show move interv updat perform split obtain amort split bound section show move interv updat access queri secondari structur ecient obtain worst case split bound lazi node split algorithm work split boundari rst insert partial boundari boundari remain partial nish split order di erent split process interf avoid split node partial boundari split long boundari parent partial discuss section mean split node boundari violat constraint base move relev interv phase rst construct secondari structur remov interv secondari structur collect sort list show lazili updat access queri updat secondari structur phase perform queri simpli ignor partial boundari parent rearrang split switch structur split index block associ list partial boundari parent move relev interv parent construct updat version secondari structur interv endpoint discuss lazili updat access structur queri updat order answer queri correctli rearrang rst perform queri ignor partial boundari report relev interv interv remov insert queri relev list add queri procedur parent optim queri bound maintain end rearrang nish split switch structur mark normal boundari remain describ perform rearrang phase phase perform lazili updat access algorithm assum rearrang phase progress node mean perform phase wait phase nish phase wait wait nish rearrang phase requir access nish access order obtain split ord wait phase perform wait rearrang phase partial requir total access nish phase wait rearrang phase phase parent nish perform rearrang phase phase access total nish split access note wait perform phase node perform partial boundari insert list insert boundari split children rearrang split partial boundari interv list partial boundari partial boundari rearrang phase work node describ perform phase lazili access basic lazi global normal updat maintain copi secondari shadow structur maintain shadow structur origin structur chang asymptot queri bound interv tree rearrang phase start rst shadow structur perform updat store updat arriv perform movement interv shadow structur section easi realiz perform lazili updat access access slight complic make updat perform process store perform shadow perform move relev interv perform shadow structur time updat perform chang updat perform updat origin structur move relev segment perform store updat lazili access final make copi shadow structur bound updat perform copi shadow structur handl handl updat global rebuild extern interv tree remov delet nish phase discard secondari structur updat shadow structur secondari structur remov amort corner structur section sketch al discuss amort updat bound made time remov assumpt corner structur design store set point plane diagon corner queri answer discuss problem queri problem structur de ned divid vertic region point figur point region store block set point boundari region intersect line iter procedur chose subset point horizont orient block explicitli store answer queri corner figur highest point includ proce point turn point recent ad initi set de ned shown figur set answer queri corner answer queri corner add js shown total number block store set corner structur consist block store set shown diagon corner queri answer corner structur easili construct case ts main memori structur easili made dynam amort updat bound updat block global rebuild show construct structur increment block load main memori time immedi remov assumpt result lazi global amort updat point figur vertic set mark dark line repres boundari queri corner point queri shade set point ad consid ac ac bm jb jb jb jb figur de nition de nition bm comput bound made worst start rebuild structur updat collect updat block build structur updat updat rst discuss construct corner structur point block main memori discuss construct perform lazili assum point list sort easili store list corner structur space start rebuild rst merg point updat block list block main memori construct corner structur comput vertic set comput final construct horizont block point vertic block easili simpli list sort coordin easili make copi list comput set block memori ith point sort sequenc point line aid comput rst comput number de ne number point coordin refer figur easili comput block main memori singl scan list point sort comput line includ js number point goal decid includ comput load main memori figur illustr easili comput bm comput total easili comput simpli load relev vertic block comput comput horizont block point answer queri point line point turn assum block posit point list point sort block scan horizont block collect point smaller obtain point horizont block collect remain point horizont block scan list point sort start altogeth js comput block js comput block point shown construct corner structur block main memori algorithm easili modi ed work increment modi ed run step main memori algorithm current state algorithm repres constant number pointer valu step perform load current state main memori perform step nalli write state back disk total prove lemma set interv store extern data structur disk queri answer updat perform structur construct extern segment tree section sketch idea extern interv tree develop extern segment structur space bound structur intern segment tree consist binari base tree interv store secondari structur interv node interv tree unlik interv interv store secondari structur node level base tree interv store node interv interv parent interv tree extern structur base tree intern node de ne secondari structur interv store secondari structur span interv unlik extern interv tree store highest node store figur interv store list largest interv list interv store ow structur note extern segment tree correspond extern interv tree part interv complet span node store list list implement simpl interv store pointer copi store parent children pointer xv xv xv xv xv xv figur node base tree interv store figur split segment tree node directli maintain interv ow structur node separ list interv ow structur pointer maintain interv rebuild ow structur interv maintain ow structur updat bound pointer requir maintain auxiliari interv order interv obtain pointer copi store topmost node store linear secondari structur node linear space extern segment tree log disk block store interv queri extern segment tree answer optim simpli search base tree node queri ow structur report interv list insert interv extern segment tree rst insert endpoint base tree tree split node show node split endpoint insert perform actual insert path base insert relev list list insert list time store relev pointer copi case involv ow structur handl extern interv tree case total insert perform interv delet extern segment tree simpli locat auxiliari pointer topmost occurr pointer interv remov occurr interv tree endpoint easili remov base tree global rebuild remain describ ecient split node boundari split interv move interv fall interv leftmost rightmost boundari refer figur interv store list move interv simpli make copi relev list updat relev pointer interv easili accomplish interv insert move parent interv interv figur interv insert list easili accomplish insert move parent interv store parent pointer store locat delet insert relev list interv move move interv endpoint total split node easi realiz interv tree case perform split updat access theorem exist extern segment tree log disk block store queri answer updat perform open problem paper develop disk space optim extern memori data structur dynam interv manag problem data structur regard extern version interv tree develop improv extern version segment tree part data structur develop independ interest structur subsequ develop numer extern intern data structur refer vitter dynam point locat monoton planar proc symp discret page erickson index move point proc annu acm sympo principl page agarw erickson geometr rang search rel advanc discret comput volum contemporari page american mathemat aggarw vitter complex sort relat problem commun arg bu er techniqu optim proc workshop algorithm data lnc page arg extern memori data structur proc annual european symposium page arg extern memori data structur handbook massiv data set kluwer academ vitter index optim rang search index proc acm symp principl page arg dynam planar point locat proc acm symp comput page vitter algorithm process line segment geograph inform system proc annual european symposium lnc page special issu algorithmica geograph inform system arg vitter optim dynam interv manag extern memori proc ieee symp foundat comp page bayer mccreight organ mainten larg order index acta proc ieee symp foundat comp page extern segment tree prioriti search tree technic nr blum averag number oper tree theoret comput chiang silva optim extract proc ieee page chiang silva extern memori techniqu extract scienti visual extern memori algorithm page american mathemat dimac seri discret mathemat theoret comput schroeder interact extract proc ieee page ubiquit acm comput approach rectangl part int comput approach rectangl part ii int comput access method acm comput ecient extern memori extern memori algorithm page american mathemat dimac seri discret mathemat theoret comput version ecient split merg algorithm order problem inform data structur repres sort list acta prioriti search tree secondari memori proc concept comput lnc page revesz constraint queri languag proc acm symp principl page vitter index data model constraint class journal comput system knuth sort volum art comput program read mccreight prioriti search tree siam journal data structur algorithm search comput geometri monograph theoret comput nievergelt binari search tree bound balanc siam journal nievergelt spatial data concept design choic van algorithm foundat page lnc overmar design dynam data structur lnc ramaswami ecient index constraint tempor proc intern confer lnc page ramaswami kanellaki oodb index class academ ramaswami subramanian path techniqu optim extern search proc acm symp principl page subramanian ramaswami data structur rang search secondari memori proc symp discret page vitter onlin data structur extern memori proc annual intern colloquium lnc page ad rang restrict capabl dynam data structur journal
IR/8 5 pagerank web structur gopal prabhakar raghavan eli comput scienc brown box ri usa veriti ross ca usa abstract recent work model web graph captur distribut observ web point repres heavi relianc properti web studi distribut pagerank valu googl search web distribut independ interest optim search indic storag show pagerank valu web follow power law develop detail model web graph explain remain faith studi distribut analyz compar snapshot web graph gener simul model knowledg repres model web fit distribut web introduct recent work develop increasingli sophist model structur web primari driver model includ develop understand evolut tool optim mine commun structur studi behavior content creator web prior model fit model observ distribut web repres step empir weak approach heavi relianc singl set paramet distribut distribut properti recogn distinct rank order web page search result easi spam easi exhibit graph conform distribut reason led pagerank function googl engin paper present detail approach explain distribut pagerank valu web model augment support part nsf grant nsf itr grant zhang lnc pp berlin heidelberg pagerank web structur distribut achiev previou success explain distribut studi pagerank distribut independ interest web search rank page search engin emploi pagerank rank import understand total pagerank concentr page conjunct queri distribut implic compress invert indic optim storag background relat work web graph view web direct graph node html page hyperlink direct edg natur manner node number edg simplist interpret page popular count number link simpli number href tag page distribut graph function integ fraction page natur distribut direct distribut distribut distribut object prior studi snapshot web rang web page commerci crawl web vari natur distribut approxim function normal constant fraction add distribut approxim function distribut power law distribut recent work dill al explan properti web graph reflect smaller snapshot web provid basi deriv understand properti web studi crawl domain methodolog pioneer barabasi al extrapol domain notr dame made predict diamet undirect version web ignor link properti web graph studi includ connect cliqu distribut diamet pagerank pagerank function present rank mechan commerci search engin googl assign web page posit real call pagerank simplest pagerank document match search queri present order pagerank gopal prabhakar eli origin intuit underli pagerank visual random surfer web page page current locat successor locat page reach hyperlink page uniformli random hyperlink probabl proport pagerank page frequenc steadi page visit surfer surfer frequent visit page page hyperlink calcul elementari probabl pagerank page page hyperlink high pagerank difficulti connect cluster page hyperlink random surfer stuck address brin page introduc decai paramet probabl surfer proce random probabl surfer complet random web independ hyperlink current page refer detail mathemat pagerank practic implement decai paramet web graph model classic random graph model explain power law properti distribut structur web graph clear web graph conform model model explain power law properti barabasi al kei node edg ad graph time incom node connect node node proport current model yield web graph distribut shown converg distribut note empir studi shown fact distribut explain expon kumar al introduc detail process edg node point fraction time paramet call α edg point node chosen uniformli random rest time fraction edg pick intermedi node copi destin random edg edg point destin edg chosen random outgo edg random node kumar al offer behavior explan fraction time content creator creat page refer random topic creat link random destin remaind content creator copi hyperlink exist page case decid interest link explain number empir observ web graph pagerank web structur ing expon larg number structur observ model view gener model barabasi α henceforth refer model select model model explain pagerank distribut observ address introduc model inspir α model edg chose destin random fraction β rest time chose destin proport pagerank behavior motiv kumar thought link random page fraction page highli rate engin googl remaind time content creator link page score high search page easi discov link behavior captur pagerank distribut observ base link explain distribut prior call select model develop model explain observ pagerank lose abil captur observ address present gener model studi paramet probabl edg point page proport probabl point page proport pagerank remain probabl point page chosen uniformli random page famili model hope simultan captur distribut investig pagerank distribut global properti distribut local properti call hybrid select model experi set context explor model section studi distribut pagerank snapshot web brown domain set experi web graph underli brown domain approach motiv recent result natur web themat unifi region larg displai characterist web larg brown web consist page averag close averag report larg crawl web crawl start brown homepag gopal prabhakar eli url domain prune crawl explor experi show distribut power law expon plot strikingli similar report larger crawl web report power law expon crawl million page billion hyperlink interest result studi pagerank distribut describ pagerank comput page hyperlink page assum link back page point intuit justifi drop expect surfer trace back trail reach dead end pagerank comput set decai paramet typic practic converg fast similar fast converg report vari decai paramet significantli chang long paramet fairli close essenti result decai paramet valu main result pagerank distribut plot larg major page small follow power law expon close fraction node pagerank proport section give analysi suggest pagerank base model section data repeat experi corpu recent million document testb conduct web experi result ident brown pagerank distribut follow power law expon close figur show plot pagerank distribut corpu power law sharper brown web unlik brown plot slope entir spectrum pagerank low pagerank explan unlik brown corpu construct care select web page web fit analysi simul section address model question section obtain empir distribut section give analyt predict shape pagerank distribut select model section intent infer choic model paramet give rise distribut observ experi section gener random graph fraction vertic pagerank pagerank web structur fraction vertic pagerank fig plot pagerank distribut brown domain vast major page low follow power law expon close fit fact give rise graph match distribut observ web select graph evolv sequenc time step note section evolut realist context featur web graph model singl node outgo edg ad time step assum start singl node time edg destin node independ probabl proport destin node model essenti analyz barabasi al special case α model α kumar al π repres pagerank time step interpret pagerank stationari probabl random walk underli teleport oper model node surfer decid continu random walk probabl return central node probabl central node jump random node graph write express π defin time sum node network path central node refer node contribut span edg contribut fraction stationari probabl sourc node standard stationari equat bound π random walk π rt rt assum incom node growth gopal prabhakar eli stationari probabl central node diamet network link note fact simpl observ show independ shown suffici diamet graph time logarithm size graph decai factor suffici close approxim π π rt estim approach barabasi al treat write differenti equat rate chang dt hand side denot probabl incom edg connect span node solut equat initi condit node ad time tv equat assum node ad equal time show probabl densiti function π impli pagerank power law expon independ simul model figur predict mention section distribut model power law expon pagerank distribut deriv empir observ power law pagerank expon select model match pagerank expon observ practic natur question make match distribut chang incorpor random select compon node answer surprisingli section select show power law emerg pagerank distribut model assum β node select base expon model argument show equat hold differenti equat previou dt reason probabl probabl incom node node span connect proport sum pagerank span node calcul direct edg contribut sum suffici case pagerank distribut relat suggest similar power law expon distribut analysi node select uniformli random α power law small emerg distribut poisson fraction vertic pagerank web structur pagerank fig plot select α number node shown show slope confirm power law predict analysi total pagerank proport sum plug solut differenti equat equat show probabl densiti function π model φ predict pagerank power law expon show power law expon simul predict select model β match empir observ pagerank expon hope match observ vari unlik select answer β power law expon distribut verifi experi left select model hybrid select model section candid explain observ simul gener model accur model web graph conform observ pagerank distribut simul hybrid select model defin section paramet find set gener observ empir distribut simul graph size vari averag number edg gener node gener real averag rang averag number edg ad node obtain essenti result power irrespect size node number outgo edg step fit distribut kumar copi model suitabl β fit distribut power law expon time gopal prabhakar eli incom node receiv edg exist node probabl β node chosen uniformli probabl β node chosen proport current distribut note distribut fix independ distribut β power law expon equal turn problem fit distribut simul select model set α pagerank distribut power law expon observ α expon pagerank distribut set α bring expon empir α lose fit found set paramet select model simultan fit distribut select model fit empir natur question select irrelev model web graph answer experi hybrid select model section surprisingli simultan fit distribut altern substanti select fit web empir data mention section model plausibl behavior standpoint present analyt studi pagerank distribut web develop accur gener model evolut web graph hybrid model analysi show select model fit empir data model found set paramet model fit simultan distribut pagerank distribut natur question studi model describ web interest question investig relationship pagerank shed insight web structur acknowledg grate joel young provid web crawler hour refer adam huberman power law distribut world wide technic comment pagerank web structur junghoo hector andrea raghavan search web acm transact internet barabasi albert emerg scale random network scienc jeong theori random graph physica random graph academ sequenc random graph process random structur diamet random graph brin page anatomi web search engin www andrew graph structur web www tomkin web intern confer larg jm kleinberg raghavan infer web commun link topolog acm symposium hypertext googl ravi rajagopalan tomkin web model method annual intern comput confer tomkin trawl web emerg www stochast model web annual symposium foundat comput scienc motwani raghavan random cambridg winograd pagerank citat bring order technic comput scienc stanford collect draft paper
DB/9 3 extend kittler surrei uk cp switzerland intern confer audio biometr person authent washington abstract paper describ acquisit content larg intend train test verif system offer video speech data imag sequenc multipl view face consist digit video record hundr subject month interv period month describ protocol evalu verif algorithm made request surrei introduct biometr measur secur applic common level dedic journal monitor develop area extrem reliabl method biometr person identif fingerprint retin iri scan method consid unaccept user scenario person identif system base analysi frontal profil imag face person ident ascertain client assist speech system robust possess inform photograph record client speech person verif approach highli secur person verif system recognit verif system larger train perform achiev volum data requir train system base analysi video audio signal order technolog manipul effect amount data recent form digit video project set address problem secur access build servic automat person verif base strategi order project partner reliabl robustli test compar algorithm larg requir present awar publicli medium larg scale collect subject survei prepar al list small point view size compar client session speech part significantli larger hand qualiti reproduc data tape low reason decid captur larg high qualiti digit video paper section defin specif acquisit system section section content speech shot content head rotat shot present inform protocol design train test person ident verif algorithm section section give inform distribut reach specif design base experi gain result record experi primarili intend research develop person ident verif system reason assum client cooper biometr data record type easili acquir normal access claim access point system client system request client client specif inform gener engag user simpl dialogu request simpl task perform introduc subject dynam session imag sequenc inform extract scenario adopt reflect assum dialogu sec durat perfectli accept practic situat dialogu simul subject utter predefin sentenc subject move head instanc read notic instruct object induc subject make extrem head rotat extract head side profil oper scenario side view camera captur kind biometr inform order captur natur variabl client physic hair subject record separ session uniformli distribut period month continu video record made snapshot record video data facilit imag process task head ey sourc multipl biometr modal includ lip dynam face surfac model continu video support verif shape correl signal subject select includ adult sex ag peopl wear glass interest gain access servic glass instanc present develop robust algorithm good qualiti consum market digit record choic made ground camera system final product low cost state art consum product todai low cost product tomorrow good qualiti record easili perform experi lower qualiti video obtain process degrad colour spatial tempor reduc dynam rang grei level design principl similar adopt main differ size number record subject session size repres applic scenario client popul moder test carri significantli larger applic client order hundr ten led order magnitud size warrant view huge quantiti target subject aim shot distinct session record period constitut shot record distinct session session repetit sentenc main motiv record polici number speech record subject facilit verif algorithm develop fusion design train algorithm requir data record encapsul intra client variabl independ data requir featur select design supervisor multipl expert fusion assum repetit speech utter session suffici consid independ record differ result natur variabl exhibit ident due emot state subject consecut attempt acquisit commenc popul volunt natur complet session visit record speech shot head rotat shot speech shot consist frontal face record subject dialogu part consist head rotat shot data acquir shot detail section acquisit system entir acquir soni digit digit vcr captur video colour sampl tion audio frequenc video data compress fix ratio proprietari dv format format defin frame accur store audio visual data video hardwar interfac comput port intel base pc run window connect digit video equip card softwar util written enabl user remot control vcr frame accuraci search store routin written captur video audio data real time comput hard disk captur camera set constant session head illumin left side sheet illumin uniform blue background head easili segment techniqu microphon record speech video shot record short sequenc uniqu identifi shot subject uniqu identif subject shot type session number colour test chart resolut checker chart enabl check made qualiti record consist resolv potenti error raw approxim hour digit video record manual annot subject index file record session tape number select kei point speech video data inform index file written softwar enabl index automat retriev subset enabl automat produc edit version speech shot short sequenc record subject sit chair microphon clip shirt read sentenc written board posit camera subject read normal briefli end sentenc read sentenc sentenc remain record session father green shoe bench digit sentenc order larg speech whilst sentenc chosen phonet balanc figur show imag grab subject session imag data train test algorithm frontal view authent figur show sequenc imag grab video session speech shot sequenc train test system audio data shot grab audio file file singl sentenc data train test speaker verif recognit algorithm head rotat shot shot consist sequenc rotat head movement shot subject rotat head centr final return centr told full requir run entir sequenc figur show select frame sequenc sequenc constant session imag profil base authent subject wear glass remov short front profil video sequenc film total minut digit video session evalu protocol defin protocol evalu perform person authent system protocol defin task person individu assert ident verif system compar featur person store featur claim ident comput refer score depend system decid ident claim true authent task correspond open test set scenario unknown claim access subject featur store system call client person claim ident refer divid train evalu test set fig train set build client model evalu set select produc client access score find threshold determin person accept reject threshold set satisfi perform level evalu set case evalu set optim combin output classifi test set select simul real authent test set classifi respect subject ident client evalu test set subject set ensur realist evalu claim ident unknown system protocol base record shot record session randomli divid evalu test subject id evalu configur defin differ distribut client train client evalu data fig perform measur error measur verif system accept rate reject rate accept case claim ident accept reject case claim true reject fa fr fa fr ei number number ec number client number client claim fa fr influenc threshold error reduc risk test set protocol shot client verif system perform quot equal error rate eer obtain full authent experi perform true ident test subject calcul threshold fa fr equal eer correspond real authent scenario predict expect system perform practic applic threshold set priori import measur perform system deviat distribut test set evalu set case applic fa fr constrain lai limit import larg sum fa fr distribut interest simul real applic set threshold evalu data obtain accept reject valu fre correspond fa fr obtain evalu threshold test set applic requir constrain fa fr stai system evalu threshold fre arg min jf ae arg min test consist total total error rate obtain sum fa distribut initi edit version made set speech shot head rotat shot subject session set tape relev index file provid form user requir digit video comput softwar session shot session shot session shot session shot evalu evalu evalu test train train train evalu test client train evalu test evalu test client configur configur ii figur diagram show partit protocol configur ii audio video subset linear tape reader point find subset made larg collect speech video data commiss connect biometr train face detect anim offer research commun chanc test face verif algorithm larg hope protocol standard enabl institut easili assess perform algorithm compar futur session peopl acquir scale illumin head chang acknowledg work perform framework project grant european act programm author partner comment suggest design protocol partner sa ag aristotl thessaloniki ecol polytechniqu de lausann universit de surrei renaiss institut percept unit de la de universidad carlo iii refer biometr technolog todai issn person verif tool speech imag multimedia servic techniqu cc mason survei audio visual speech technic kittler pattern statist approach prentic evalu protocol extend commun session session session session speech speech speech speech figur select front profil shot subject session select imag speech shot centr shot head left left profil shot head profil shot centr shot figur select imag rotat head sequenc subject rotat head back centr
Agents/10 1 design implement mobil agent kernel walter binder softwar engin austria effici execut environ mobil agent core system fulfil function tradit oper system domain resourc account paper describ kei concept implement java introduct recent larg number java base mobil agent system emerg java good choic implement execut environ mobil offer featur develop mobil agent portabl languag safeti classload namespac serial state multithread addit high perform java runtim system hardwar platform oper system current java environ provid suffici strong secur mechan protect isol mobil agent vast major current mobil agent platform simpli reli insuffici secur featur system suit commerci mobil agent applic system mobil agent protect java develop kit real protect boundari compon malici agent easili mount denial servic attack possibl crash java virtual machin agent platform agent safe remov system research shown abstract similar process concept oper system order creat secur execut environ mobil agent solut incomplet requir modif java runtim system mobil agent ensur import secur requir modif underli java implement implement pure java run java platform tradit oper system kernel protect process process access foreign memori region region explicitli declar share oper system offer commun control process process kernel ensur remov system free resourc termin process possess java trademark sun list mobil agent platform mobil agent list system present base java addit kernel ensur termin process corrupt share system state process termin perform kernel oper system ensur termin process leav kernel consist state oper system process resourc fulfil role oper system ensur protect agent system secur commun enforc safe domain termin resourc control resourc alloc paper structur section give overview mobil agent system section state requir kernel code written java show kernel entri exit implement effici section deal protect domain resourc account section state requir kernel discuss implement issu techniqu meet requir effici discuss limit suggest extens jdk order improv function perform section compar kernel relat work section present plan futur improv kernel section summar current state implement mobil agent kernel system overview complet redesign secur mobil agent system develop geneva extend java program environ model mobil agent strong hierarch protect domain extens base formal model distribut jan vitek seal calculu enabl express effect enforc secur incur high overhead scale due perform problem ineffici commun protect enorm agent startup suit applic compat yield perform effici commun high level commun framework built top compon model flexibl conveni configur mechan base xml kernel maintain tree hierarchi agent servic agent servic execut protect domain call seal object seal short parent seal creat arbitrari number children seal root tree hierarchi start system servic applic kernel act refer ensur share object refer seal commun distinct seal requir kernel object pass deep copi capsul prevent share load static variabl covert commun channel geneva engag seal multithread domain seal run arbitrari number strand concurr kernel ensur parent seal termin children time strand child domain stop memori resourc child seal elig garbag collect immedi kernel synchron messag pass channel commun mechan model support direct commun seal neighbor seal hierarchi channel commun ensur parent seal isol child complet seal support channel oper offer option timeout synchron channel asynchron send oper addit improv channel kernel introduc extern refer indirect share object seal extern refer enabl effici commun shortcut deep seal hierarchi secur extern refer track kernel invalid time extern refer basi effici high level commun framework kernel code core mobil agent system compact offer minim set abstract program secur agent protect domain agent servic concurr activ commun facil extern requir seal multithread kernel structur access kernel synchron protocol ensur proper synchron prevent deadlock kernel code synchron object access agent agent kernel code block infinit strand agent initi kernel oper strand obtain lock kernel kernel code lock intern privat member kernel abstract kernel oper perform succe leav kernel state unchang kernel oper care except special attent paid except occur thrown thread stop aid stop thread immedi exit monitor hold throw leav object inconsist java platform java platform offer altern mechan thread protect domain termin base kernel ensur stop request defer thread access kernel structur properti share model direct indirect explain thrown virtual machin run memori garbag collector fail reclaim memori kernel oper design avoid oper modifi kernel state simpl solut alloc object requir case advanc made kernel structur emploi jdk collect class alloc object demand implement issu oper system emploi privileg process mode kernel oper process execut kernel mode access processor instruct kernel intern memori kernel similar strand initi kernel enter privileg kernel mode kernel oper complet strand leav kernel mode continu execut user mode main kernel mode prevent strand stop access kernel intern stop request defer strand stop leav kernel addit defer stop kernel mode synchron primit affect kernel protect domain creation strand creation commun request distinguish kernel mode share kernel mode strand enter kernel mode block strand execut kernel mode strand execut kernel strand enter kernel protect domain termin strand stop perform kernel mode strand execut kernel mode stop asynchron except rule strand stop simpl check suffici detect situat implement ensur oper modifi kernel structur protect domain creation oper kernel oper requir read access kernel intern execut share kernel mode access kernel structur kernel mode ensur concurr read write writer access kernel observ suggest simpl singl writer multipl reader lock control access enter kernel mode correspond acquir write share kernel mode requir read lock lock implement ensur strand wait write lock enter kernel strand wait read lock properti make domain termin delai infinit lock object implement strand obtain read lock write execut user mode enter kernel mode mean lock obtain successfulli state lock object chang requir lock forbidden modif kernel object lock strand execut user mode sophist queu techniqu control order kernel entri implement enqueu request modif kernel structur classload affect intern state java runtim ensur classload occur kernel mode strand stop load corrupt intern structur jvm gener classload occur depend virtual machin implement classload strand execut kernel mode kernel offer condit kernel enter share lock obtain request strand execut kernel mode implement oper requir track strand execut kernel mode time enter kernel mode frequent oper commun involv switch kernel ad strand remov strand set strand execut kernel mode highli optim kernel entri exit extrem frequent measur cpu time spent obtain kernel lock benchmark measur commun latenc throughput deep seal show highest kernel frequenc oper requir kernel mode execut kernel lock perform bottleneck resourc control section ensur agent enter kernel arbitrarili kernel lock denial servic attack futur improv real time specif java introduc concept asynchron transfer control enabl implement safe asynchron thread termin section prevent corrupt kernel structur strand termin asynchron classload emploi section ensur consist runtim system avoid overhead maintain set strand execut kernel mode replac concept kernel mode order ensur proper synchron avoid dedic synchron protocol strand enter kernel mode effici implement minim overhead kernel mode entri exit protect kernel tradit oper system ensur process access memori page oper system kernel reli memori manag unit processor order detect illeg memori access mobil agent kernel enforc similar protect kernel protect agent agent system requir languag safeti java basic forg object refer java safeti depend strong memori protect automat memori verif languag safeti protect mobil agent execut environ languag lead situat imposs determin object belong agent check access object valid crucial introduc concept strong protect similar process abstract oper system protect domain draw boundari compon mobil agent encapsul set class requir concurr activ object alloc strand strand execut protect domain special precaut strand cross domain boundari kernel prevent object refer pass protect domain boundari kernel ensur object refer exist singl protect domain properti import memori protect domain set class compon share share static variabl class share static variabl introduc object refer static variabl covert commun channel kernel class jdk share compon order ensur correct function jvm mobil agent emploi jdk class function undermin protect extend verif agent class issu address mobil agent system protect file network port monolith oper system kernel deal resourc architectur simpli ensur secur polici implement higher level mobil agent deal secur polici make privileg domain access system resourc java mean agent domain access core restrict enforc extend verif implement issu classload kernel emploi separ classload namespac protect domain global configur defin set class share domain class load jvm system classload class load protect domain classload order ensur proper function java runtim jdk class share introduc secur extend verifi assur agent danger jdk function replic class limit perform agent startup overhead memori consumpt method compil multipl kernel design minim replic kernel class current implement small class commun subsystem replic ensur serial object graph receiv protect domain classload receiv domain agent class class framework librari replic minim overhead replic framework librari classload configur cach class file resid librari packag load class file disk perform proper cach configur yield speedup agent creation factor extend verif agent class file verifi special verifi order ensur agent jdk kernel class mean kernel protect underli jvm corrupt malici badli program agent protect domain direct declar class referenc direct includ type access restrict eventu includ access individu class forbidden access individu class member forbidden extens class prohibit agent class resid packag thereof possibl prevent extens class control access level individu class member structur kernel clean multipl packag separ part kernel public access modifi distinct kernel compon direct ensur agent access kernel intern declar public softwar engin reason import distinguish softwar engin practic secur engin java access modifi subtyp softwar engin secur engin place specif direct ensur class file violat set direct suffici verifi constant pool class file refer forbidden class member extens superclass prohibit member access verifi class entri class file constant pool verifi code verif algorithm consist constant pool constant pool creat constant pool scan class member type signatur class refer class type signatur denot class member refer member effici arrai constant pool optim intern verif direct minim verif cost benchmark measur agent startup overhead verif overhead cpu time spent classload measur includ cost addit verif ensur proper protect domain termin section futur improv kernel emploi cach techniqu minim overhead replic reload kernel framework class time consum perform bottleneck replic framework class share work mechan detect automat librari class share safe administr modifi global share configur avoid replic librari class maxim share class introduc secur optim minim time load link replic class mention aid class file cach io cost load replic kernel framework class disk reduc significantli time consum oper reload replic class oper involv verif jvm assum class file kernel librari conform java languag specif full control jdk offer option disabl verif class enhanc classload api give programm control verif minim classload overhead improv agent startup perform extend verif agent class classload perform critic agent larg class archiv current implement requir pass verifi class file constant pool java compil produc class constant pool entri type member constant pool entri java compil avoid precondit replac algorithm verifi commun oper system process exchang messag commun facil provid kernel process protect ensur ipc mean exchang inform process boundari case share process obtain share memori segment kernel commun mobil agent kernel isol agent provid mean commun order agent collabor requir stress previou secur mobil agent kernel provid strong protect domain agent execut protect isol rest system agent exchang commun partner kernel establish commun channel kernel ensur commun partner access channel permiss kernel offer commun channel extern refer messag pass kernel creat deep copi messag pass receiv kernel prevent direct share object refer protect domain properti crucial protect domain domain undermin protect resourc account larg simplifi fact object refer exist singl protect domain channel support commun neighbor seal hierarchi neighbor seal issu match send receiv commun kernel pass messag sender receiv match algorithm ensur sender send messag receiv accept messag sender detail channel match algorithm found aid channel achiev complet mediat mean intercept messag agent channel commun perform messag rout seri protect commun involv strand switch proport commun partner distanc seal hierarchi extern refer support indirect share object distinct seal necessarili neighbor seal hierarchi extern refer act capabl invok method share object extern refer pass receiv copi commun extern refer sender invalid copi synchron copi time strand call method copi immedi leav protect domain throw except caller domain properti distinguish extern refer capabl detail extern refer commun model found implement issu direct share object refer protect commun involv copi messag emploi java serial creat deep copi object graph serializ object serializ object pass protect domain kernel ensur commun serial object graph deseri target domain deseri object graph refer class receiv domain serial deseri offer optim object type frequent commun java primit arrai primit string primit type includ object pass simpl wrapper class arrai primit type string load system care copi target domain arrai primit arrai clone special constructor string argument optim perform transpar programm perform measur show capsul optim improv perform capsul creation open factor extern refer complic serial deseri object graph extern refer treat special kernel track extern refer separ rest serial object graph kernel emploi dedic copi algorithm extern detail found implement commun channel ensur messag copi receiv protect domain commun match send receiv request treat commun offer insert kernel queue resid protect domain issu strand kernel check neighbor domain match offer search kernel copi messag receiv domain implement tradit messag sender directli insert messag receiv queue separ sender receiv queue kernel ensur agent mount denial servic attack neighbor domain fill receiv queue eventu receiv exce memori limit termin oper system provid mean termin run process memori resourc termin process alloc process oper system kernel ensur resourc share resourc corrupt process kill requir protect domain strand belong domain stop java mean stop run thread asynchron oper java inher unsaf thread exit monitor immedi throw object left inconsist state section state requir kernel code ensur share intern structur kernel java runtim corrupt strand stop asynchron idea defer stop request strand stop access kernel simpl solut ensur strand access kernel strand stop thread stop aid stop thread termin depend execut caught execut infinit loop kernel ensur resourc protect domain special verif ensur agent code prevent delai domain termin except handler agent benchmark creat capsul consist byte long size string arrai chosen independ immedi caught except offer class file rewrit tool modifi except handler runtim extend bytecod verifi simpli check agent class rewritten correctli addit agent defin final class final special method invok garbag collector object class reclaim method infinit hang system implement issu safe strand stop achiev special kernel entri exit sequenc strand termin protect domain enter kernel mode block strand left kernel termin protect domain atom kernel oper strand belong domain stop kernel oper strand stop enter approach enforc safe domain termin order prevent corrupt intern structur insid classload occur kernel mode detail kernel mode found section order prevent agent delai verifi ensur agent method forbidden java construct method signatur defin method except tabl method examin order determin type caught except agent catch except handler catch supertyp handler code determin actual type caught except handler immedi jvm support special catch type except tabl except caught except handler java compil featur compil statement verifi ensur special except handler includ code caught except except handler catch except present origin java implement rewrit tool process agent class gener standard java compil tool programm packag agent examin except handler potenti catch except insert short sequenc jvm caught except immedi implement base api marku dahm note rewritten except handler except lock import instruct jvm throw eventu lock object unlock strand lock direct share object protect domain kernel code lock object access agent section object belong termin agent left lock state agent remov system verifi simpli check agent class rewritten benchmark show verif mechan introduc overhead runtim complex agent total verif includ constant pool verif section exce total time classload resourc account oper system kernel provid mechan enforc resourc limit process schedul assign process cpu reflect process prioriti kernel access memori resourc process alloc memori region verifi memori limit process mobil agent kernel prevent denial servic agent alloc memori account physic resourc cpu network logic resourc number number nest protect crucial requir kernel manag tree hierarchi nest protect domain resourc control facil reflect hierarch system structur hierarch process model successfulli oper system kernel emploi hierarch schedul cpu inherit schedul order enforc schedul polici parent domain donat percentag cpu resourc child process root hierarchi possess cpu resourc gener cpu inherit schedul fit hierarch domain model system startup root physic logic cpu amount virtual unlimit network maximum number strand underli jvm cope unlimit number nest protect domain creator donat part resourc domain kernel account resourc column column unit column resourc root domain initi physic resourc rel cpu time max activ memori byte jvm heap max max cumul memori byte unlimit logic resourc max activ strand jvm thread max max cumul strand unlimit max activ subdomain unlimit max cumul subdomain unlimit note kernel network account provid access network network access provid multipl servic network servic mediat layer hierarchi network account secur polici design larg number servic agent execut design implement minim overhead resourc account core fulli trust resourc consumpt control kernel domain unlimit access account resourc situat protect domain neighbor hierarchi share resourc resourc limit enforc set protect domain resourc fragment minim agent creat subag task frequent creat agent donat resourc prefer share resourc subag resourc account affect kernel commun facil domain limit size incom messag malici domain hold memori resourc easili mount denial servic attack send larg messag mean receiv maximum size incom messag commun partner attempt send larger except extern refer support messag exchang result caller separ limit incom messag extern refer creat creator specifi maximum size argument messag caller associ limit result messag copi extern refer hold detail extern refer commun found implement issu current implement kernel prepar resourc enforc resourc limit java platform offer mean resourc implement resourc control physic resourc difficult pure java account logic resourc make facil control usag physic resourc combin resourc control physic resourc logic resourc order prevent denial servic attack plan integr resourc control kernel kernel design futur integr resourc account object belong protect domain refer object exist singl domain properti hold intern kernel structur account alloc object protect domain featur simplifi resourc crucial resourc domain termin subsect discuss approach implement account physic resourc java environ memori account rewrit memori account achiev aid rewrit approach resourc account interfac java develop cornel enforc memori limit individu thread maintain total amount memori alloc thread object check alloc thread exce memori limit code method rewritten insert object alloc occur origin method code arrai alloc code comput arrai size creat creat modifi final order detect garbag collector free object maintain weak refer arrai order detect dealloc arrai memori account rewrit big advantag implement pure java nativ code obtain weak refer java refer object achiev function portabl rewrit class domain memori limit fulli trust domain overhead rewrit deal object alloc nativ code account usag jvm compil method rewrit prevent kind denial servic attack memori alloc addit rewrit impact author report memori account yield overhead includ cost higher suggest rewrit agent class agent packag develop kernel simpli verifi method rewritten significantli faster rewrit classload kernel jdk class rewritten system instal comput cpu time account nativ code cpu time account individu thread accomplish associ oper system handl thread poll thread period queri oper system cpu time consumpt resourc account interfac successfulli implement approach techniqu cpu time account reli nativ depend specif oper system jvm execut java runtim system nativ thread map oper system thread cpu time account poll thread configur delai reaction mechan build simpl control algorithm approxim intend schedul high prioriti poll thread period obtain inform total cpu time consumpt protect domain compar actual cpu consumpt desir product rel share cpu time domain total time domain determin domain receiv cpu time differ exce prioriti thread domain adjust longer observ period simpl control algorithm approxim desir schedul control algorithm deal multipl protect domain share cpu quota total sum cpu consumpt thread execut domain calcul parent domain chang cpu share children desir cpu time consumpt comput increment refin cpu consumpt long ago period import schedul recent cpu consumpt addit kernel prevent prioriti case prioriti thread lower hold kernel lock high prioriti thread wait kernel lock delai long time kernel design support real time ensur kernel oper short simpl solut prioriti ceil thread execut kernel mode highest prioriti kernel schedul decid prioriti thread action defer thread leav kernel cpu time account rewrit measur cpu time consumpt abstract unit number instruct emploi rewrit techniqu cpu time account domain kernel maintain counter indic instruct execut period time counter prioriti strand domain lower kernel period execut high prioriti strand increment instruct counter domain rel share cpu time counter posit prioriti strand domain order prevent denial servic crucial thread decrement counter domain basic block counter updat method invoc insid loop techniqu develop profil trace program place counter updat minim account overhead ensur algorithm determin posit place account code consum verifi runtim agent class rewritten correctli complex analysi feasibl memori account approach implement pure java drawback control execut nativ code java runtim system expect overhead verifi execut rewritten code account java virtual machin profil interfac java virtual machin profil interfac profil java applic execut java runtim system java usag monitor profil agent commun jvm collect inform memori alloc cpu time consumpt thread offer java interfac access account inform contrast account object alloc nativ code enforc memori limit exact memori callback gener thread exce memori resourc control mechan base react memori detect commun java runtim implement nativ code port comput architectur oper system support unix platform emploi proc filesystem obtain oper system inform cpu time consumpt nativ thread addit standard profil interfac account java extens resourc control import kind java base applic servlet java enabl web java standard extens resourc account real time specif java concept resourc control real time thread process paramet memori paramet process paramet defin cpu time thread receiv period time latest complet time memori paramet set heap maximum thread limit memori alloc prevent denial servic attack garbag collector paramet object share multipl thread contrast java languag specif schedul algorithm concurr real time specif java specifi implement support preemptiv schedul uniqu prioriti level kernel schedul algorithm advantag specif schedul polici underli jvm portabl manner relat work work mobil agent relat work protect mobil code environ utah flux research group work design implement secur singl address space oper system implement java alta oper system design hierarch process model support cpu account cpu inherit schedul process donat percentag cpu resourc nest child process alta design implement pure java alta reli modif run java implement convinc portabl mobil agent platform crucial success project enorm pace jvm implement offer rapidli imposs maintain modifi jvm offer suffici perform java support multipl protect domain commun base capabl java object share indirectli pass refer capabl object lack hierarch model call block infinit delai protect domain termin support thread memori account rewrit implement complet cpu account requir nativ code java extens task model java base type distinguish pointer remot pointer share multipl task access remot pointer control permit revok time task revok remot pointer task support indirect share domain aid extern remot pointer enabl direct share individu object distinct task base extens java runtim system futur work kernel provid resourc account physic logic resourc section standard java extens resourc account portabl crucial success implement account physic resourc aid rewrit section rewrit successfulli memori account experi cpu time account rewrit experi algorithm order find account accuraci overhead import featur offer futur includ remot configur administr disrupt agent platform integr flexibl architectur debug monitor mobil agent applic graphic user interfac monitor configur multipl platform singl place servic maintain server cluster applic present design implement issu address java base mobil agent platform secur crucial mobil agent system structur similar oper kernel separ part system kernel protect domain resourc control mobil agent system base architectur provid secur featur commerci mobil agent applic kernel implement pure portabl oper system hardwar platform offer strong protect effici commun safe protect domain termin resourc prepar resourc implement reader interest evalu version includ network gui develop small demonstr contact author email acknowledg author andrea klau jan vitek suggest good idea refer back draw red line java seventh ieee workshop hot topic oper rio march java oper design implement technic report depart comput august ball optim profil trace program acm transact program languag juli binder secur mobil agent system workshop agent electron hong decemb extens markup languag februari von resourc account interfac java acm oopsla octob dahm byte code engin septemb meet virtual machin symposium oper system design implement octob ford cpu inherit schedul symposium oper system design octob steel java languag specif java seri von implement multipl protect domain java usenix annual technic june von case protect technic report cornel depart comput march von type system support dynam acm sigplan workshop compil support system von task java oper system novemb le java usag monitor java virtual machin edit sun microsystem java standard edit sun microsystem java virtual machin profil interfac real time java expert group real time specif java nest java os structur mobil code eighth acm sigop european septemb vitek mobil agent kernel joint symposium intern symposium agent system applic intern symposium mobil agent palm octob binder design make java safe agent electron commerc page juli vitek calculu secur mobil comput workshop internet program low level secur java fourth intern confer decemb
DB/11 3 foundat convent tempor queri optim address duplic order christian richard snodgrass technic report foundat convent tempor queri optim address duplic order copyright christian richard snodgrass reserv christian richard snodgrass februari technic report aalborg denmark christian jensen michael dieter kristian usa richard snodgrass moon individu particip curti bond australia fabio itali nick usa gerhard switzerland thoma switzerland nation korea mario canada john south australia nation korea michael usa andrea switzerland vassili usa jef belgium carlo lo usa addit softwar made provid express impli impli warranti merchant fit icon cover combin letter rune alphabet millennium ago successor rune alphabet angular shape lack horizont line primari storag medium wood rune found weapon perceiv hidden power rune arrow icon denot abstract substanti amount data recent advanc tempor queri languag show applic benefit substanti tempor support dbm achiev tempor queri process mechan provid paper present foundat queri optim integr convent tempor queri optim suitabl convent dbm architectur tempor support obtain layer top convent dbm foundat captur duplic order coalesc tempor gener exist approach author includ tempor extend relat algebra sql tempor sql queri type algebra concret queri transform rule obei procedur determin type transform rule applic optim queri plan algorithm present approach partit work requir implementor develop provabl correct queri optim implementor oper design prove correct transform rule satisfi augment mechan determin type rule applic ensur algorithm appli rule ensur map gener correct initi queri plan introduct applic reli data appli travel defin properti data recent advanc tempor queri languag show applic benefit substanti run dbm tempor support potenti benefit applic code simplifi easili programm product data process left potenti lead perform tempor support offer current product limit predefin data informix datablad extens facil enabl user defin data type tempor support data type extend queri languag develop dbm tempor support scratch daunt task feasibl dbm vendor code base modifi larg resourc led approach layer implement tempor support user applic convent dbm layer map tempor sql statement regular sql statement pass remain unalt paper offer foundat convent tempor queri optim applic integr layer make relev dbm vendor plan incorpor tempor featur develop implement tempor support foundat offer integr coverag duplic order coalesc tempor queri tupl adjac time period ident attribut valu foundat enabl tempor extend algebra enhanc exist relat algebra base set multiset integr handl algebra add tempor support addit convent algebra emploi tempor relat timestamp time implement granular independ format tempor relat map format algebra independ specif tempor relat queri languag data model support main class tempor statement found statement tempor semant evalu conceptu point time statement explicitli manipul valu tempor abstract data type conveni oper predic defin tempor aspect consid valid time captur data true model approach extend handl transact combin valid time relat defin kind defin relat set type occur pair snapshot relat deriv pair tempor relat consid set snapshot tempor relat time ø tupl time tempor relat time period type plai queri type result sql queri outermost level specifi result type open possibl appli transform preserv list paper set transform rule satisfi set exist set rule author practic procedur offer determin type transform rule applic queri algorithm provid gener queri evalu plan work report relat algebra multiset recent extens book offer coverag queri transform preserv set multiset formal relat sort permit outermost level push sort queri plan improv perform sort perform earli queri evalu dbmss microsoft access combin predic requir intermedi result sort relat formal support sort achiev mechan offer determin set base includ tempor applic queri optim recent work leung al import duplic queri rewrit rule duplic address special case defin rewrit formal foundat reason offer dozen tempor relat algebra algebra author adequ address issu relat coalesc exist work tempor queri optim primarili consid process join semijoin delv gener queri address coalesc paper structur section describ layer architectur section defin underli structur present extend relat algebra oper type algebra section concret transform rule preserv type provid section section give procedur determin transform rule preserv type applic provid queri plan algorithm extens framework briefli discuss section section survei relat section conclud offer research direct architectur discuss architectur describ function queri optim give structur stratum paper discuss stratum architectur tempor dbm prototyp tempor dbmss tempor strata translat tempor queri languag statement sql perform systemat optim process divid process stratum underli dbm improv queri perform complex tempor oper tempor tempor duplic coalesc process effici convent support stratum term augment stratum addit perform queri optim process figur show process involv optim evalu queri stratum receiv tempor queri languag statement input queri statement map initi express tempor algebra suit intern queri transform gener number queri evalu plan plan select process fourth step step specif stratum fragment plan perform dbm translat sql result sql stratum express evalu obtain result focu develop tempor extend transform queri plan algorithm queri map initi plan cost final plan translat sql code plan plan stratum express figur queri optim evalu tempor stratum evalu figur depict stratum architectur compon perform task figur queri process control pass relev queri fragment underli dbm intern queri collect output result relat statist run time characterist result relat cost estim updat cost model dbm applic tempor queri languag statement result extend algebra sql queri translat algebra queri process control result initi plan tempor queri optim final plan stratum express result dbm figur architectur tempor stratum sql queri cost estim intern queri evalu present extend algebra discuss requir algebra defin relat structur describ defin fundament algebra oper briefli map queri algebra give queri requir fundament requir algebra formal defin equal algebra suitabl implic clear detail algebra incorpor coalesc impli relat list attract convent impli time period tempor finit union time independ granular oper defin start end time argument time period algebra extend convent relat algebra accommod class tempor statement mention statement tempor semant statement explicitli manipul valu time data type conveni accommod introduc tempor oper counterpart exist relat algebra result result ì ì john sale john anna sale anna anna sale figur tempor oper óô oper óô point time tempor relat snapshot time ø result appli óô ö equal result óô appli snapshot ö time ø tempor duplic elimin snapshot reduc duplic elimin desir oper minim orthogon oper perform singl function minim affect replic function easier combin oper queri coalesc affect separ duplic elimin oper oper retain time period order tupl argument coalesc retain order argument combin term includ identifi idiom structur defin relat relat schema instanc turn definit standard adapt address duplic order definit relat schema ë finit set finit set function associ domain attribut tempor relat figur assum time period time valu denot month year john sale januari juli june octob relat schema consist attribut ì formal ì ì ì ì ì ì denot time domain ì definit domain bettini al definit tupl schema ë function ø attribut ø schema instanc ë finit sequenc tupl ë note definit relat schema instanc correspond definit list relat duplic order tupl relat figur tupl ø ì ì ø ì ì ø ì ì ì ì ì ì list relat distinguish snapshot term tempor relat reserv specif attribut ì ì denot time period start period valid tupl tempor relat schema snapshot relat schema tempor relat chosen singl type tempor oper tempor attribut extra argument oper implicitli time attribut algebra oper describ briefli fundament algebra discuss preserv coalesc defin oper section overview oper tabl list oper select project union cartesian product differ duplic elimin aggreg deriv convent relat algebra add tempor denot superscript ì tempor oper conceptu evalu result point time differ regular duplic elimin tempor duplic discuss section add sort merg tupl adjac time period definit coalesc al due requir minim section relat defin list coalesc al merg tupl adjac overlap time result achiev combin tempor duplic elimin coalesc union origin union oper multiset oper includ tupl result time tupl occur argument relat occurr tupl tempor counterpart denot ì oper sort cardin duplic coalesc ò ö ö ò ö retain retain ö ö ò ö gener destroi ö ø ö unord ò ö ò ö gener destroi ö ¢ ö ö ò ö ò ö retain na ö ò ö ö ò ö ò ö retain na ö ö ò ö ò ö elimin na ö ö ò ö elimin na ö ¢ ì ö ö ò ö ò ö retain destroi ö ò ö ò ì ö ö ò ö retain destroi ö ò ì ö ö ö ò ò ö elimin destroi ì ö ö ò ö elimin destroi ö ò ö retain retain ì ö ö ö ò ò ö retain enforc ö ö unord ò ö retain na ò ö ò ö ö ì ö unord ò ö retain destroi ò ö ò ö tabl overview oper tabl includ fundament tempor oper conveni accommod queri statement tempor semant omit deriv oper regular tempor express union regular differ includ idiom illustr deal union oper provid addit join product select regular sql union duplic introduc issu framework idiom includ implement algebra algebra differ fundament algebra present algebra work list specif cartesian union duplic aggreg argument relat ident multiset result relat ident multiset treat relat algebra express algebra present oper express oper list tabl order cardin result oper handl regular duplic coalesc tabl make auxiliari function function ö return list attribut pair sort type relat ö unord function return empti list note special case sort list prefix ö order ö ö list project tempor group attribut pair list equal ì ì ì ì function return largest prefix argument prefix element includ argument relat ö sort ö project list function list return result project sort denot cardin relat ö ò ö lower bound case tabl column reflect behavior oper respect duplic coalesc oper elimin regular duplic result relat distinct retain regular result relat distinct tupl argument distinct gener regular duplic duplic exist argument similar oper enforc result relat retain result relat coalesc argument relat destroi coalesc note coalesc undefin snapshot relat return nontempor oper tempor section defin algebra oper list tabl attempt made defin oper conduc effici implement union simpli concaten argument ì set tupl schema ê set ö ì ì set tupl tempor ê ì set relat tupl ê set relat tupl tempor support definit definit impli actual implement constrain implement algorithm produc order duplic account select select oper ê correspond select oper relat algebra set select predic denot è argument predic express ö schema result relat schema argument relat ö ö è ö ö è ö ö ö argument oper definit dot line argument relat ö empti denot empti relat oper return line relat tupl remain part ö test predic è tupl ö predic oper return return empti relat condit oper return tupl empti relat append result oper appli remain part relat auxiliari function defin appendix project project oper relat counterpart set arithmet express ì ì includ attribut return tupl result schema attribut map attribut type function express ö schema ë function ö ä æ ä schema result relat definit tupl concaten appendix project oper add attribut schema attribut set tupl argument relat tempor attribut tupl argument relat set current time attribut ì maximum timestamp attribut ì union oper ø union argument retain duplic oper append relat relat schema argument relat result relat ø ö ö ö ö ø ö cartesian product oper ¢ comput cartesian product argument relat definit auxiliari function result schema ¢ follow definit tupl concaten except attribut domain result schema special tempor attribut prefix result oper snapshot includ attribut ì ì ¢ ö ö ö ø ö ¢ ö ö ø æ ö ö definit essenti perform cartesian product tempor cartesian product oper ¢ ì ì ì ê ì return tempor cartesian product argument tempor relat definit auxiliari function ì ì ì ì result schema ¢ ì ì follow definit tupl concaten attribut domain result schema retain origin timestamp argument relat timestamp ¢ ì ö ö ì ö ø ö ¢ ö ì ö ö ì ö ø æ ö æ ì ö ì ö ì ö function ì check time period argument tupl overlap function ì intersect time period argument tupl form tupl intersect time return function defin appendix tempor cartesian product retain origin timestamp prefix make accommod select predic involv time attribut relat prefix timestamp remov subsequ project chosen tempor cartesian product snapshot reduc regular cartesian product tempor cartesian product project remov prefix timestamp snapshot reduc regular cartesian product differ oper ò ê return tupl argument relat argument relat schema argument relat result relat except prefix tempor result schema ò ö ö ö ö ö ò ö ö ö ò ö function return true argument tupl exist argument relat function remov occurr argument tupl argument relat function defin appendix tempor differ oper ò ì ì ì ì perform tempor differ argument relat output relat attribut valu denot ò ì ö ö ö ì ö ö ö ò ì ö ø ö ò ì ø ì ö defin tupl argument tupl argument relat overlap find overlap remov overlap tempor part tupl perform differ remain part content depend type overlap allen identifi thirteen relationship figur show case overlap nonoverlap predic meet addit relat adjust remaind remaind æ ì ö æ ö æ ö æ ì ö æ ì ö æ ö æ ö æ ì ö æ ö æ ì ö æ ì ö æ ö æ ì ö æ ö æ ö æ ì ö ö æ ö case start case case overlap case equal case start case finish case finish figur case overlap case overlap case lower bound cardin result relat tupl huge time period argument relat elimin tupl short time period argument relat upper bound big number tupl argument tupl argument tupl result case figur tempor differ relat figur project figur project ì ò ì project result figur note tempor differ sensit duplic tupl anna time relat directli transfer result attribut overlap tupl relat elimin tupl anna duplic elimin oper remov regular duplic argument relat oper retain occurr tupl remov subsequ schema argument result relat except tempor attribut result prefix ö ö ö ö ö ö ö ö tupl argument relat found remain part oper remov found tupl oper return tupl concaten result oper appli remain part relat tempor duplic elimin oper ì ê ì ì remov duplic snapshot argument tempor relat argument result relat schema note oper remov regular duplic project result ì ì ì ì john john john john john john john john anna john anna anna anna anna anna anna anna anna anna figur result relat figur show relat project ä ì ì result regular tempor duplic elimin appli relat relat ê regular duplic ê ê ê ê ì ê ì ì ì ì john john john john john john anna anna anna anna anna anna anna figur result regular tempor duplic elimin tupl anna time relat ê duplic snapshot timestamp tempor duplic elimin preserv order argument relat defin ö ö ì ö ö ö ì ö ì ö ì ö ö ö ì ö ö ì ö ì function ì defin appendix scan argument relat find tupl time period overlap argument tupl tupl ê overlap retain tupl period valid overlap tupl chang result subtract tupl relat overlap tupl result depend time period tupl relat function ì ì ì ì ê ì find argument tupl argument replac tupl argument relat tempor differ return result time period tupl ê obtain subtract time period tupl ê tupl ê ö ø ö ø ö ö ö oper return ò ö tupl ü tupl argument ü time valu mean maximum number valid time period involv time valu ü ü ò ö maximum cardin smaller aggreg oper ¢ ¢ ¢ perform aggreg group attribut aggreg function set attribut schema argument relat denot aggreg function denot aggreg function relat argument return tupl aggreg schema result tupl map attribut type aggreg function oper return tupl uniqu sequenc group attribut schema result relat definit concaten except result tempor prefix definit correspond provid klug al ö ö æ ö æ ö æ æ ö ö ò ö definit auxiliari function ¢ ¢ return tupl argument relat valu equal argument tupl ö ö ö ö ö ö group function return list tupl relat tempor aggreg oper ì ì ¢ òø òø ì perform tempor aggreg group attribut pair aggreg function aggreg attribut set òø includ attribut schema argument attribut group aggreg attribut oper return tupl uniqu sequenc group attribut common time period tupl equal valu group attribut tupl group sort time attribut ascend order schema result relat definit concaten definit correspond definit queri count number work project relat project figur queri express result shown figur tempor aggreg defin ì ö ì ì figur result tempor aggreg ö ì ö ö ø ö ö function ì ì ¢ ì ¢ ì ¢ òø ¢ òø ¢ ¢ ì return aggreg tupl argument relat argument time minimum maximum time valu found tupl group found function defin appendix tupl argument relat valu function find common time period output tupl aggreg valu period ì ì ö æ ö æ ì ì æ ì ì ì ì auxiliari function ì ì ¢ ì ¢ defin appendix scan argument relat return minimum timestamp bigger argument timestamp smaller equal argument timestamp auxiliari function ì ì ¢ ì ¢ ì return tupl argument relat overlap period defin argument timestamp valu ì ö ö ö ö ì ö ì ö tempor aggreg return ö ò ö cardin argument relat reason similar tempor duplic elimin sort function ê sort argument relat denot set order attribut list order defin auxiliari function insert tupl sort argument maintain order denot argument order ö ø ø ö ø function boolean return true argument tupl argument tupl argument order function invok tupl ö ö ö coalesc oper ì ê ì ê ì coalesc tupl argument retain duplic snapshot effect coalesc tupl end tupl equal start tupl argument result relat attribut valu denot ì ö ì ö ö ö ì ö ì ö æ ö æ ö ì ö ö æ ö ì ö ö ì ö ö ö tupl meet tupl oper combin tupl tupl meet function ì defin appendix find tupl argument relat meet argument tupl auxiliari function tupl compar valu return tupl perform coalesc duplic perform tempor duplic elimin coalesc defin combin oper defin figur show relat ê figur coalesc tupl ê merg tupl result relat fourth tupl remain argument result relat union ì ê ì ì john john anna anna figur coalesc relat ê oper return union argument relat restrict number duplic tupl maximum number duplic tupl argument relat oper extens union oper multiset schema argument relat result relat cartesian product tempor result prefix union defin union differ ø ö ò ö tempor union oper ì ì ì ì return tempor counterpart upper bound cardin result deriv cardin union tempor differ ì ø ö ò ì ö map algebra map queri algebra express depend specif languag oper suffici sql wide rang tempor queri languag tempor duplic tempor tempor tempor cartesian product recal section regular simpli map languag tempor semant union sort tempor paramet involv time attribut queri defin exemplifi queri plan stratum kind transform appli optim tempor relat project figur queri work user requir result relat duplic snapshot desir result queri figur anna work sale februari project march result includ month februari result ì ì anna anna anna anna anna john john john john john figur result relat april anna work user request duplic snapshot elimin notic tupl adjac time result sort comput stratum initi straightforward map queri initi algebra shown figur oper ì ë transfer argument dbm initi assum queri comput dbm transfer ì permit queri plan flexibl partit comput stratum dbm sort coalesc ì tempor duplic elimin ì perform obtain format oper ensur snapshot oper ensur tupl adjac time period merg tempor differ ì return time period occur obtain correct left argument duplic ensur ì oper duplic elimin tempor differ sensit duplic anna work project tempor differ includ tupl anna march result wrong queri requir time work work project tempor differ analog handl state queri similar requir ì yield correct transform rule preserv type applic part queri illustr region figur transform preserv lighter shade oper sensit ensur result produc oper correctli order end tempor differ sensit duplic left lower left ì affect result differ presenc absenc duplic relev oper ì oper branch tempor darker shade matter relat produc tempor differ duplic due subsequ ì oper transform rule appli shade region preserv duplic transform appli coalesc oper preserv period dash coalesc return uniqu relat argument relat snapshot duplic top ì ensur argument coalesc oper duplic snapshot section formal concept give procedur determin region queri systemat exploit transform rule preserv type achiev queri tree shown figur transfer oper move tempor differ indic stratum perform tempor duplic tempor differ oper push dbm sort faster stratum part queri dbm ì ë optim express languag support pass order preserv π sort asc coal duplic relev period preserv asc π project sort π coal π project figur algebra express queri work perform optim coalesc perform differ left argument tempor differ expect smaller result tempor due split timestamp observ figur paper relat queri optim relat list relat multiset enabl type treatment type relat list multiset set snapshot list ë ä snapshot multiset ë å snapshot set ë ë relat list multiset ident account set ident ignor duplic order snapshot list hold tempor relat snapshot relat point time list similar condit impli snapshot multiset point relat snapshot set point relat definit relat ö ö list ö ö function boolean return true ö ö ö ö ö ö definit relat ö ö multiset ö ö function boolean return true ö ö ö ö ö definit relat ö ö set ö ö function boolean return true ö ö ö ö ö auxiliari function ê remov occur argument tupl argument relat schema argument relat retain result relat ö ø ö ö ö ö definit tempor relat ö ö snapshot list ö ë ä ö function ë ä ì ì boolean return true ë ä ö auxiliari function ì ì ¢ ì ¢ boolean comput argument relat snapshot argument time interv ì ö ì ö ö oper ì ì return tupl argument relat overlap time remov tempor attribut schema argument relat ë attribut schema result relat ë map type ì ì ö ö ö ì ö ì ö oper introduc duplic project remov attribut omit definit snapshot multiset snapshot set similar definit snapshot list exemplifi type variat relat project tempor attribut figur instanc schema ê duplic relat ê duplic relat ê tempor duplic figur coalesc version project relat figur result sort ë ì ì sort coalesc ë relat ë multiset set relat ê occur number time snapshot point time multiset set relat snapshot list order tupl relat ë ê list order tupl tupl anna time occur ë ê hold relat tupl snapshot ë ê undefin relat ê ë ê ë ì ë ì ì ì ì anna anna anna anna anna john john john john figur variat project tempor attribut relat ë ê tupl john time present ë ê set snapshot list multiset snapshot ë time tupl snapshot relat ê tupl anna ë ë hold relat ë ê mean snapshot set ë ê snapshot time relat ë ë tupl set point snapshot set relat tupl ë sort ë ë ë å ë ë hold ë exampl illustr order type tempor relat multiset impli set snapshot multiset set list implic theorem theorem ö ö relat implic hold point downward appli tempor appendix ö ö ö ö ö ö ö ë ä ö ö ë å ö ö ë ë ö type exploit queri optim transform rule discuss detail divid type rule replac express origin queri plan express result relat produc plan list result relat produc origin evalu argument result relat multiset set type snapshot rule replac plan yield result relat multiset result relat produc origin applic rule preserv order accept result multiset accept result snapshot multiset result relat produc origin queri relat ê return tupl order type result queri determin transform rule exploit section list transform section describ mechan determin transform rule applic transform rule provid set transform rule exist rule set author describ transform rule deriv convent relat algebra exist rule set multiset appli add rule tempor oper discuss duplic transfer rule type specif stratum transform rule express algebra express type section give strongest type hold algebra repres transform rule mark appli transform appli transform mark appli direct transform rule verifi oper type formal definit unlik rule express found error rule theorem amen formal proof appendix proof transform rule transform written proof automat theorem prover construct repetit transform ö base relat oper tree denot attribut domain schema relat ö function return set attribut present select project sort list convent transform rule convent transform rule deriv rule multiset figur show convent transform rule involv tempor oper rule order base oper rule concern select distinguish rule depend kind support rule valid push select cartesian product differ list result relat commut cartesian product union satisfi result relat produc express differ order tupl rule note unlik order argument oper chang freeli affect order result rule involv union regular tempor union rule type weaker rule satisfi predic è è satisfi tupl side transform return instanc tupl union type achiev transform appli equal nontempor tempor transform defin argument relat appli combin nontempor tempor relat rule except hold nontempor relat reason regular differ prefix tempor slightli modifi rule relat figur show convent transform rule involv tempor oper rule counterpart rule figur involv tempor attribut appli rule rule correspond rule condit ö tempor involv project introduc tempor attribut result regular differ tempor cartesian product retain origin tempor remov result subsequ product duplic elimin transform rule duplic elimin rule figur rule duplic elimin note perform tempor duplic elimin tempor result relat ë ë argument relat relat ê ê figur contrari commonli consid union regular sql union remov duplic result relat union regular tempor union oper gener duplic argument relat mean push duplic elimin regular tempor union rule follow aggreg involv function insensit duplic duplic elimin push union oper gener duplic argument relat duplic elimin push regular ö ö ö ö ø ö ö ö ö ö ö ö ö ò ö ì ì ö ö ö ö è ö ö è è ö ¢ ö ö ¢ ö ö ¢ ö ö ¢ ö è ö ¢ ö ö ¢ ö è ö ¢ ö ö ¢ ö ö ¢ ö ö ¢ ö ö ¢ ö ¢ ö ö ¢ ö ¢ ö ö ò ö ö ò ö ö ò ö ö ò ö ö ø ö ö ø ö ö ø ö ö ø ö ö ø ö ö ø ö ö ö ö ö ö ö ö ö ö ö ö ö ö ö è ö ö ä figur convent transform rule ö ì ì ö ò ö ì ì ö ¢ ì ö ö ¢ ì ö ö ¢ ì ö ö ¢ ì ö è ì è ì è ì è ì è ö ¢ ì ö ö ¢ ì ö è ì è ì è ì è ì è ö ¢ ì ö ö ö ö ¢ ì ö ì ì ö ¢ ì ö ¢ ì ö ö ¢ ì ö ¢ ì ö ö ¢ ì ö ¢ ì ö ò ö ¢ ì ö ¢ ì ö ò ü ì ö ò ì ö ö ò ì ö ì è ì è ö ò ì ö ö ò ì ö ì è ì è ö ì ö ë å ö ì ö ö ì ö ö ì ö ì è ì è ö ì ö ë ë ö ì ö ì ö ö è ì ö ö ä figur convent transform rule involv tempor oper differ oper sensit number duplic argument tupl ø occur ü time argument relat ý time argument relat occur ü ý time result regular differ remov duplic tupl ø occur argument regular absent result duplic elimin appli oper manufactur remov duplic elimin rule regular duplic elimin remov perform top regular duplic elimin regular aggreg tempor duplic elimin perform top tempor duplic elimin tempor aggreg rule impli rule ö ö ì ì ö ö ì ö ö ö ö ì ö ì ö ì ì ö ì ö coalesc transform rule rule figur show elimin rule deriv transform rule elimin superflu coalesc rule coalesc select commut select predic involv tempor attribut project coalesc relat coalesc relat set number coalesc argument result coalesc result list coalesc transform extend provid al due differ coalesc definit section duplic snapshot tempor regular transform rule type ë å deriv rule ö ö ö duplic ì ö ö ö duplic snapshot ö ö ì ö ë ë ö ö ö ì ö ì ö ì è ì è ö ö ì ì ö ì ö ¢ ö ö ¢ ö ö ¢ ö ì ö ö ¢ ì ö ì ö ¢ ì ö ì ö ¢ ì ì ö ö ¢ ì ö ö ö ö ö ì ö ì ö ì ö ì ì ö ö ö ì ö ì ö figur duplic elimin transform rule ì ö ö ö coalesc ì ö ë å ö ì ö ì ö ì è ì è ì ö ö ì ì ì ì ö ø ì ö ì ö ø ö ì ì ö ì ì ö ì ö ì ö ì ì ì ö ì ì ö ì ì ì ö ì ì ö ì ö ¢ ì ö ì ö ¢ ì ì ö ö ö duplic snapshot ö ¢ ì ö ì ö ò ì ö ì ö ò ì ì ö ö duplic snapshot ì ì ì ö ì ì ö ö duplic snapshot figur coalesc transform rule ì ö ¢ ì ö ë å ì ö ¢ ì ì ö ö ¢ ì ö ì ö ò ì ö ë å ì ö ò ì ì ö ì ì ö ë å ì ö transform rule ë å type cartesian tempor project destroi coalesc project rule tempor cartesian product retain timestamp argument transform modifi type requir argument duplic snapshot ad rule modifi type type achiev tempor differ sensit distribut tupl left distribut ö ö note period preserv argument tempor coalesc side rule case coalesc significantli reduc cardin retain add requir rule elimin duplic top project potenti introduc duplic lead tupl result sort transform rule sort elimin perform relat satisfi treat relat subsequ sort oper predic list argument return true prefix ö ö ö ö ö ö ö ö ö ö ö ö ¢ ö ö ¢ ö ö ¢ ì ö ö ¢ ì ö ì ì ì ì ö ò ö ö ò ö ö ò ì ö ö ò ì ö ì ì ö ö ì ö ö ì ö ì ö ì ì ö ö ì ö ì ö ì ì figur sort transform rule rule requir prefix elimin side rule rule sort result sort perform argument oper oper preserv order ì fulli partial preserv order argument transfer transform rule transfer transform rule essenti stratum architectur implement oper stratum choic execut oper transfer relat dbm stratum oper ì ë oper ì oper list tabl specif stratum transfer oper appli relat ì ë appli relat dbm impli path leaf root valid express encount altern ì ë ì start end ì ë data start end subsequ figur gener transform rule gener denot óô rule transfer oper óô stratum appli oper implement rule transfer oper óô dbm appli óô translat sql instanc transform rule ì ö ì ì ì ë ö type order list oper relat project slightli restrict impli rule transfer oper stratum vice relat produc side rule dbm implement oper sort oper except transform rule section applic transform rule dbm rule omit figur óô ö ì óô ì ë ö ö óô ö ì ì ë ö óô ì ë ö óô ö ì ë óô ì ö ö óô ö ì ë ì ö óô ì ö ö ì ì ë ö ö ì ë ì ö ì ë ì ö ö ì ì ë ö ö ì ë ì ö ö ì ì ë ö ö figur transfer transform rule applic transform rule queri express queri languag map initi algebra optim appli transform rule strategi algebra express return relat relat return origin assum correctli comput queri type requir result relat depend queri languag actual queri statement queri requir result top assign root queri tree propag requir oper queri tree due characterist oper queri tree requir top oper root top oper requir arbitrarili introduc remov duplic affect top requir constrain type transform rule appli queri plan restrict rule type appli safe transform express evalu result ident list obtain evalu origin express hold type rule applic rule appli queri part tempor variant top depend queri presenc specifi result relat queri specifi order result tupl immateri appli transform rule queri evalu plan result relat produc plan origin plan multiset depend queri top queri faithfulli preserv time period base relat arbitrarili return result relat type rule appli satisfi type result origin plan describ case tempor variant sql statement call map languag algebra top requir semant oper tree queri describ type transform rule appli locat enabl formal procedur determin transform rule applic queri introduc properti oper oper tree section defin section describ updat queri optim section describ properti determin applic transform rule oper tree figur result evalu tree list shade region determin type transform rule applic area order preserv lighter shade appli transform rule relat treat multiset oper ensur result order appropri rule type appli queri fragment duplic darker shade region fragment top tempor duplic elimin bottom tempor duplic elimin ensur left argument tempor differ duplic snapshot section illustr fragment exist oper tree shade absent entir rule type appli queri fragment preserv time dash region true oper coalesc coalesc return result relat snapshot argument duplic snapshot ensur tempor duplic elimin coalesc å rule rule appli duplic relev section describ shade region determin definit properti tabl introduc boolean properti correspond shade region figur oper tree valu properti combin properti tabl type hold result oper relat å project time attribut ä time attribut defin properti descript true result oper preserv order true oper arbitrarili add remov regular duplic true oper replac result tabl properti oper oper tree óô óô óô type true true true true true ë true true true ë true true true ë å true ë ë tabl combin properti valu type properti determin type transform rule applic type transform rule appli result produc side result produc side requir properti top oper properti propag root tree terminolog attribut syntax inherit attribut properti set accord specif queri languag queri statement variant sql requir result sort order result duplic result time period independ queri plan chosen properti set true order properti set true definit properti auxiliari boolean properti propag leaf oper root term deriv attribut properti relat duplic duplic properti definit properti definit properti queri properti set initi queri evalu plan pass queri optim properti propag properti propag sequenc defin properti turn tabl defin properti oper óô properti valu properti hold óô result relat duplic argument oper óô case óô binari óô properti propag bottom tree root oper preserv duplic tabl properti true leaf oper correspond base relat óô óô ì ì ø true óô true ì óô ò ì ¢ ì ì óô óô tabl properti valu oper oper ì ì remov oper ø manufactur duplic project introduc duplic kei argument exist argument includ project list properti set properti argument tabl defin hold oper queri plan snapshot result relat duplic properti true leaf oper correspond tempor relat oper tempor produc nontempor relat duplic snapshot appli project remov tempor attribut case similar properti definit tabl defin properti valu oper óô properti depend parent denot properti independ specif óô parent oper list column tabl binari keyword denot locat óô rel parent properti hold hold parent oper regular duplic child oper deal duplic parent oper regular oper question locat relat produc left child regular duplic parent oper regular aggreg aggreg function function result aggreg oper count number tupl relat affect presenc duplic case properti hold parent properti hold child parent oper regular aggreg aggreg function óô óô ì ì ò ø true ì óô óô ì ò ì ¢ ì ì true óô óô óô tabl properti valu oper óô true true ì ì true óô óô óô ¢ ì óô ¢ ì óô true true true true true true tabl properti valu oper parent properti hold child parent oper regular oper question locat left locat relat produc left child regular duplic similar condit appli regular union properti hold parent oper coalesc number duplic argument lead result relat set tabl defin properti properti hold parent hold parent oper project involv time attribut properti parent oper regular time attribut group attribut aggreg function parent oper tempor parent oper coalesc argument duplic parent oper tempor differ argument child question óô ì ì è true ì ì true ì xor ì ì ì true true ì ì óô true true ¢ ì ¢ project remov origin timestamp ì true true true true true tabl properti valu oper parent properti hold parent properti hold parent select predic involv tempor involv time attribut properti regular time attribut group attribut aggreg function regular duplic regular cartesian tempor cartesian product project remov origin time regular regular union tabl defin properti properti depend parent list column independ specif óô properti hold oper child node hold oper parent node parent node oper preserv order argument order requir select oper order requir child oper parent oper properti hold child order argument immateri óô ì true óô ì true óô true óô ¢ ì ¢ ì true óô true óô true óô true óô true óô true óô true óô óô tabl properti valu oper parent properti hold child ì properti hold ì child produc duplic snapshot ì requir preserv period argument entri show requir comput reli properti propag oper ì ì ò ì ì sequenc sensit argument duplic snapshot left argument ò ì argument ì argument result multiset snapshot oper occur parent requir sequenc tupl chang period preserv oper argument duplic snapshot note stronger requir chang sequenc tupl chang preserv order result requir captur auxiliari properti true oper óô chang sequenc tupl result oper tabl defin properti properti properti check set properti number oper properti true cartesian order argument product matter properti set true hold properti properti set true left argument argument contribut sort result óô true óô ì ì ì true true includ attribut argument oper tabl properti valu oper properti propag requir type relat queri tree happen tempor duplic tempor tempor union argument duplic snapshot left argument ò ì argument ì stratum satisfi underli relat dbm unknown order case underli dbm support express ì ë oper includ sort attribut result mention oper present stratum possibl tupl snapshot point time queri ì ì ë ö run return result relat ö retriev convent dbm queri answer top ë å ë map stage determin requir top satisfi reject queri altern stratum implementor modifi map stage introduc oper oper ensur initi queri plan satisfi requir coalesc combin tempor duplic tempor differ combin tempor duplic elimin result insensit order queri return result stratum architectur queri section adjust properti transform rule appli queri properti adjust transform rule appli prefer avoid scan oper tree time rule local adjust tabl definit previou section accomplish express properti valu term properti valu immedi oper tree adjust valu properti oper properti oper immedi result queri part depend valu tree determin applic transform rule properti valu bottom adjust properti depend valu determin applic transform rule properti top oper reconsid properti oper part tree result queri part adjust properti trigger adjust properti adjust properti trigger adjust properti coalesc depend properti tabl summar trigger adjust adjust trigger adjust adjust node coalesc tempor differ tempor union coalesc regular differ tempor duplic tempor tempor union project tabl trigger properti adjust properti adjust rare applic transform rule lead chang properti top tabl describ adjust transform rule requir adjust trigger rule introduc remov oper tabl repres transform adjust action transform adjust properti adjust properti adjust properti adjust properti root adjust properti tempor duplic tempor tempor union adjust properti regular tempor tempor union adjust properti coalesc adjust properti adjust properti tabl adjust properti properti oper tree enabl formal transform rule applic queri plan section show properti queri plan queri plan give straightforward algorithm gener correct queri evalu subsequ heurist select final queri plan perform note increment mainten properti valu improv full recomput argument queri plan algorithm set plan è è set transform rule output queri evalu plan obtain set transform rule algorithm figur algorithm set transform rule includ rule section rule introduc addit ö ö applic infinit number time heurist restrict rule set heurist rule introduc addit ö ö heurist perform select earli transform rule ì ö ì ö transform rule ì ö ì ö assum heurist place ensur termin plan è ì locat ð è match left side ì local condit satisfi ì rule ì rule ð óô ì rule ð óô óô ì ë ä rule ð óô ì ë å rule ð óô óô ì ë ë rule ð óô óô óô appli ì ð yield è adjust properti è add è è return è figur queri plan algorithm algorithm oper mean determin transform rule applic syntact compon express match semant compon precondit hold properti test applic transform rule properti oper top locat emploi test applic transform rule ì ö ò ì ö ì ö ò ì ì ö properti ì oper algorithm gener set queri plan independ order transform rule locat easili note algorithm appli transform candid plan locat order plan è gener appli transform present è presenc stratum addit correct specif portion evalu underli dbm util oper provid requir ì ë oper satisfi portion evalu stratum util oper provid stratum requir ensur map initi algebra cogniz capabl dbm stratum requir ensur initi queri plan presenc absenc transform move transfer oper oper section requir satisfi properti theorem algorithm figur gener correct queri plan prove prove algorithm appli transform rule type result produc queri plan result produc origin plan top depend queri languag actual queri statement proof divid π coal sort asc coal π project sort asc π coal figur oper tree properti applic region π project type transform rule appendix proof type rule appli correctli top algorithm gener correct gener exploit transform rule correct queri plan gener type transform rule found illustr algorithm queri section initi queri plan figur result tempor differ duplic snapshot left argument duplic appli rule remov top tempor duplic elimin push transfer oper transfer rule rule type appli oper push coalesc tempor differ rule appli rule hold result plan shown figur list properti squar bracket order remov unnecessari coalesc argument tempor rule order time period preserv branch tempor differ push oper rule chang locat oper stratum dbm rule figur show final plan extens framework optim implementor extend foundat present tailor specif queri languag ad oper requir implementor defin map queri languag algebra determin top set initi queri plan ad defin relat transform rule properti valu oper determin implementor transform rule requir properti adjust ensur queri involv oper process satisfi top appli repeatedli proof correct algorithm extend accommod oper stratum translat oper sql develop relat research survei previou work relat tempor algebra address duplic order past work convent tempor queri tempor cover dayal al extend relat model includ multiset call relat defin duplic differ oper provid algebra similar albert extend boolean select give semant usual semant argument set union defin unlik correspond disjunct boolean select union differ relat disjunct boolean select exemplifi transform rule recent book al offer coverag queri transform preserv set multiset formal relat sort permit outermost level defin relat set transform rule extend rule type hold add rule tempor oper leung al present queri rewrit rule decorrel complex implement queri repres queri graph graph repres tabl oper input output tabl duplic address queri graph model queri rewrit graph oper permit duplic duplic preserv distinct duplic permit oper produc argument duplic address special case queri rewrit rule algebra transform rule incorpor handl duplic order oper elimin preserv duplic type correspond replac queri express mumick al studi extens techniqu program multiset aggreg note implement multiset duplic check provid formal basi reason optim techniqu multiset gener intermedi independ user desir multiset semant framework integr treatment relat set grumbach milo studi express power algebra manipul bag studi bag nest affect express power libkin wong provid techniqu studi express power set languag bag languag aggreg function focu studi express power algebra show extend convent relat algebra dozen tempor relat algebra decad algebra author adequ address issu relat coalesc exist work tempor queri optim primarili consid process join semijoin segev defin tempor join discuss tempor select estim strategi optim tempor work delv gener queri optim address coalesc al defin coalesc argu oper implement effici convent dbmss paper coalesc defin merg tupl recent work gadia consid queri optim parametr model tempor present algebra heurist optim algorithm defin relat set weakli relat snapshot refin set paper discuss stratum architectur tempor dbm prototyp tempor dbmss tempor strata translat tempor queri languag statement perform systemat optim process provid framework process stratum underli dbm research direct tempor queri process mechan achiev tempor support dbmss convent tempor algebra vari overlook aspect coalesc past work tempor queri optim primarili consid effici process delv gener queri optim paper offer gener foundat optim convent tempor suitabl provid tempor support tempor dbm layer top convent dbm foundat offer handl duplic order convent tempor coalesc tempor queri foundat enabl tempor enhanc exist relat algebra algebra independ specif variant relat data model independ relat queri languag type algebra queri express lead type transform rule exploit queri optim set rule exist set author depend duplic coalesc requir result queri optim appli type transform rule practic mechan provid determin type transform rule applic queri algorithm gener queri plan present approach partit work requir implementor develop provabl correct queri optim implementor oper formal design transform determin prove transform rule augment set adjust properti algorithm appli transform rule ensur map gener correct initi queri plan complet framework queri optim evalu figur number step remain map cover convert queri initi plan specif queri languag check includ queri ensur task assign dbm express languag dbm oper assign stratum implement algorithm algorithm section gener plan number queri plan heurist provid step select plan expect lowest cost stratum challeng unifi cost model stratum dbm cost function cost function oper perform dbm gener statist obtain issu cost interest research challeng challeng develop strategi divid process stratum integr transform rule heurist cost estim techniqu multipl implement join implement return differ order consid queri plan queri part perform dbm translat sql result return stratum process result stratum subsequ oper temporari tabl creat translat algebra sql left futur research oper locat stratum evalu effici manner work cf paper provid mechan repres queri queri core queri optim intend foundat effici process algebra includ standard oper call type queri oper definit oper concaten list oper algebra explor algebra extend support valu transact time automat theorem prover ensur correct properti plan algorithm case refer albert algebra properti bag data type pp allen maintain knowledg tempor interv commun tiger tempor system current feb jensen point versu tempor data model ieee pp wang glossari time granular concept pp jensen tempor statement modifi unpublish submit decemb tempor system implement acm sigmod soo coalesc tempor pp snodgrass semant acm katz extend relat algebra control duplic elimin acm pp sripada tempor research practic lnc widom system implement prentic hall gadia algebra ident queri optim parametr model relat tempor ieee transact knowledg data gordon denot descript program languag grumbach milo tractabl algebra bag pp segev framework queri optim tempor pp inmon build data edit john wilei son jensen editor consensu glossari tempor concept pp jensen snodgrass tempor data manag ieee transact knowledg data snodgrass unifi tempor data model conceptu model inform semant effici process correl queri aggreg pp klug relat algebra relat calculu queri languag aggreg function journal knuth semant languag mathemat system volum springer pp kline snodgrass comput tempor aggreg ieee pp libkin wong techniqu studi set bag languag aggreg function acm pp hellerstein queri rewrit optim rule ibm read stonebrak hellerstein morgan pp leung muntz stream tempor queri process optim tempor tansel al pp jr snodgrass evalu relat algebra incorpor time dimens acm comput ramakrishnan magic duplic aggreg pp ramakrishnan magic relev acm atlant pp snodgrass tempor survei ieee transact knowledg data snodgrass tempor queri languag tquel acm transact editor tempor queri languag kluwer academ publish snodgrass develop applic sql morgan kaufmann snodgrass stratum approach tempor dbm implement pp widom tempor extens informix germani zicari advanc system morgan kaufmann san auxiliari oper defin auxiliari oper tupl defin auxiliari oper includ fundament oper oper schema argument relat schema result relat auxiliari oper tupl concaten function æ concaten tupl tupl ø ø schema ë ë defin result tupl øö schema attribut schema result tupl prefix attribut schema argument tupl øö ø ø ø ø concaten tupl ø ì ì ø lead tupl øö ì ì chose prefix attribut result retain type relat type sole defin exist attribut ì ì prefix concaten tupl lead prefix function ì ì ì boolean return true time period argument tupl overlap ì ø ø function ì ì ì boolean return true time period argument tupl meet ì ø ø ø ø function ì ì ì ì ì intersect time period argument tupl period form tupl intersect time return ì ø ø æ ø auxiliari function tupl compar valu return tupl schema result tupl ì defin ì ì ì ì ì function ì boolean return true attribut argument tupl equal argument tupl valu denot ø ø ø ø auxiliari oper relat head function return tupl argument relat ö tail function argument relat tupl ö appli relat tupl return empti relat append function argument tupl argument relat ö ø function boolean return true argument tupl exist argument relat ö ø ö ö remov function occur argument tupl argument relat schema argument relat retain result relat ö ø ö ö ö ö function ì ì ì ì scan argument relat find tupl overlap argument tupl ì ö ö ì ö ö ì ö function ì ì ì ì scan argument relat find tupl meet argument tupl argument argument result relat schema ì ö ö ö ö ì ö function ê ì ì scan argument tempor relat return minimum timestamp auxiliari function ì ¢ scan argument tempor relat return smallest timestamp argument timestamp argument relat timestamp valu function exploit fact tempor ì smaller ì ö ö ö ö ö ö ö ö function ê ì ì scan argument tempor relat return maximum timestamp function analog auxiliari function ì ¢ scan argument tempor relat return biggest timestamp argument timestamp argument relat timestamp valu ö ö ö ö ö ö ö ö function ì ¢ ì ¢ ì scan argument tempor relat return smallest timestamp bigger argument timestamp smaller equal argument timestamp auxiliari function ì ¢ ì ¢ ì return argument timestamp case suitabl timestamp found argument relat function undefin ö ö ö ö ö ö ö ö ö ö ö ö ö ö ö ö ö ö ö ö proof theorem ö ö relat implic hold point downward appli tempor ö ö ö ö ö ö ö ë ä ö ö å ö ö ë ö prove ö ö ö ö definit multiset section ö ö hold step condit line true argument relat empti condit line tupl argument relat argument ö ö condit line ö ö number tupl ö ö list condit definit evalu function call remov tupl ö ö ö condit line true condit definit true relat list iter definit oper ensur call function line definit call function line definit tupl argument relat equal tupl argument prove ö ö ö ö show condit line set definit condit line true condit ö ö number tupl function remov number tupl argument relat relat ö ö number multiset condit definit evalu function remov number tupl find tupl ø ö tupl ö condit definit evalu note function remov tupl argument relat ö condit true iter tupl argument relat found argument mean exist ö remov previou exist argument relat ö ö multiset condit definit evalu prove implic ö ö ö ë ä ö definit relat point snapshot list relat ö ö point time tupl posit relat overlap time overlap time counterpart tupl includ ì ö ì ö tupl counterpart equal oper chang order argument counterpart produc order argument relat proof implic similar theorem transform rule ö ö correct prove relat produc side side ofth transform rule list prove tupl posit exist posit implic proven analog assum tupl ø posit ø ö satisfi è è satisfi è è ø number tupl ö satisfi è è occur ø number tupl ö satisfi occur ø number tupl ö satisfi è occur ø select oper section effect linear scan input ø occur posit posit ö posit implic hold tupl satisfi è è satisfi è tupl satisfi satisfi theorem algorithm figur gener correct queri plan prove prove algorithm appli transform rule type result produc queri plan result produc origin plan top depend queri languag actual queri statement proof divid type transform rule provid proof type rule appli correctli top remain part proof work similar fashion applic rule ì denot relat result ì relat result ì ö ì denot result relat produc origin queri plan result relat produc queri plan ö ì prove ì appli prove violat top case case top definit deriv implic includ oper ì ö ö ö ö ¢ ì ö ö ö ö ì ì ö ö ö ö ö ö ö ö ò ì ö ö ò ì ö ö ö ö ö ì ö ö ì ö ö ì ì ö ö ö ë å ö ö ö ö ö ò ì ö ë å ö ò ì ö ö ö ö ö ì ö ë å ö ö ö oper preserv multiset tempor duplic tempor tempor union argument duplic snapshot left argument tempor differ argument tempor union offend multiset snapshot preserv subsequ oper appli ö ì produc relat ë å subsequ oper produc case oper produc å relat oper exist origin queri plan relev argument duplic definit properti deriv case properti hold argument oper bottom queri properti hold argument oper sort properti hold argument properti hold oper altern hold appli ì altern impli properti hold produc relat queri plan list oper argument produc result origin queri plan list altern impli oper óô oper question properti properti parent hold properti hold definit propag case properti hold parent oper hold child oper prove definit oper óô return result å argument case case top hold root oper oper top initi queri plan highest oper óô path root origin plan hold due definit properti tabl sort transform rule sort oper push union regular tempor instanc óô part present argument oper queri plan ë å óô oper deriv implic ö ö ö ö ö ë å ö ö ë ö óô cartesian product contribut argument left argument order definit ¢ deriv implic ö ö óô ö óô ö óô ö ë å ö óô ë ö óô ö óô óô tempor cartesian product tempor contribut argument left argument order implic hold ö ö óô ö óô ö óô ì ò ì ö ë å ö óô ö óô ö óô ò ì óô produc ë relat queri order case relat queri plan oper preserv partial list definit deriv result oper appli óô result sort order column tabl oper appli oper origin queri plan produc final relat sort queri plan produc ö ì oper preserv partial list preserv partial list snapshot oper outlin part relev argument duplic snapshot oper exist óô highest definit hold argument óô oper oper sort attribut oper exist true oper bottom tree appli ì properti hold properti óô return partial snapshot result shown part oper return partial result partial snapshot argument oper properti hold equal óô highest oper properti true produc relat queri plan list oper argument produc result queri plan list relat queri plan ë oper óô return ë å result exist óô similarli part exist oper óô óô return partial result partial snapshot argument
ML/12 6 satellit imag referenc algorithm concret mixtur scott stark joseph nasa center earth studi materi research center technolog institut texa el el tx usa contact email natur test structur integr send signal frequenc compar result signal pass ideal determin elast depend frequenc rang hz perform measur high frequenc area avoid fact chang depend simpli scale perform measur measur depend moder frequenc combin result curv singl curv show fuzzi techniqu autom introduct practic problem materi possess elast properti solid behavior liquid exampl materi rang concret mixtur road aerospac industri applic desir techniqu test structur integr properti structur send signal measur signal pass analyz detect signal structur fault elast depend frequenc detect type depend frequenc rang hz perform measur high frequenc area hz avoid fact practic materi includ concret mix aerospac industri thermal mean chang depend simpli perform measur measur depend moder frequenc appli scale combin result curv singl curv describ frequenc rang research logarithm logarithm logarithm scale equat simpler shift logarithm idea reformul measur depend shift result curv horizont direct form singl approach successfulli problem shift manual expert desir autom process fuzzi method main reason automat shift method exact depend shift temperatur determin reli expert unabl repres term autom desir techniqu specif design formal expert knowledg techniqu fuzzi experi referenc satellit imag problem determin shift function occur analysi concret similar problem occur analysi satellit imag satellit imag area differ unknown shift exist automat method determin imag show method combin curv temperatur ii algorithm fuzzi analysi great find shift equal due inevit measur curv hope valu close differ def small finit measur result frequenc denot total number measur result differ requir shift differ small natur formal requir fuzzi logic membership function describ term belief small equal belief small equal belief condit fuzzi analogu formula shown arbitrari arbitrari approxim strictli practic assum describ expert strictli form strictli function find valu paramet belief model largest function strictli attain maximum auxiliari characterist attain minimum formula describ conclud condit min form formula activ heurist formula statist formula formula robust formula design case exact probabl distribut text show heurist formula justifi fuzzi justif enabl answer natur function base choic opinion expert extract membership function correspond function describ expert requir invari rel rescal method jxj paramet exact formul proof function criterion form je je max formal fuzzi expert addit origin nearbi valu freedom select result comput simplest method method squar condit deriv object function equal linear equat fuzzi logic reason squar method algorithm transform idea algorithm find shift curv measur correspond narrow rang frequenc narrow depend monoton exist exist ideal equal conclud ideal determin valu approxim equal shift approxim equal differ repeat argument valu valu differ estim desir shift ek valu perform comput find singl estim shift close valu def close argument show squar method determin find min differenti equat deriv conclud shift estim averag horizont shift curv arriv algorithm find shift curv ffl pick valu ek ffl valu find valu comput differ ffl estim arithmet averag valu method lead reason combin curv temperatur iii referenc algorithm exist referenc method fast fourier transform referenc algorithm present main idea referenc gener algorithm simplest shift detect absenc case imag differ shift imag differ shift fourier transform relat imag obtain denot jf actual shift obtain formula comput substitut fourier transform ratio equal ideal fourier transform equal point easili determin desir shift ffl appli fft origin imag comput fourier transform ffl comput ratio ffl appli fft ratio comput fourier transform ffl fourth determin desir shift shift detect presenc ideal absolut ratio equal real measur intens valu condit slightli chang repres fact ad actual imag presenc observ valu intens differ actual fourier transform differ valu absolut ratio improv accuraci method simpli process measur addit knowledg absolut actual ratio equal denot actual absenc equat form presenc comput valu fourier transform slightli actual equal approxim addit equat absolut equal jrj denot complex conjug thing unknown ffl satisfi approxim equat ffl satisfi addit constraint estim estim satisfi condit argu optim squar method estim defin error condit satisfi find estim satisfi addit condit squar jej error smallest squar jej error reformul minim express condit condit techniqu lagrang minimum function condit attain real number auxiliari function attain uncondit call lagrang multipli lagrang multipli techniqu lead uncondit minim min find complex variabl express smallest complex variabl pair real minimum found point partial deriv respect variabl equal repres equal comput partial deriv express rel differenti rel linear conclud coeffici determin condit result satisfi equat denomin equat real find suffici find denomin jrj easili achiev absolut jf jf jf choic formula final jf jf presenc exact ratio optim approxim jf jf ideal fourier transform ratio equal equal point presenc expect valu slightli jp larger valu function arriv algorithm determin shift ffl appli fft origin imag comput fourier transform ffl comput ratio ffl appli fft ratio comput fourier transform ffl fourth determin desir shift point jp largest applic analysi appli referenc algorithm lead automat gener combin master master curv compar good manual combin skill expert acknowledg work support part nasa cooper agreement grant air forc offic scientif research grant grant scienc technolog joint nsf grant refer temperatur depend properti concret mix test cylind subject dynam axial shear pave vol pp referenc ieee symposium imag analysi santa april optim proc nasa student april optim algorithm master depart comput texa el decemb mine imag applic satellit imag web data mine comput pp predict model thermal crack concret pave vol pp superposit fundament concret mixtur low temperatur huber decker engin properti mixtur relationship american societi test vol analysi prentic englewood robust triangular kluwer academ klir fuzzi set fuzzi theori prentic upper saddl fuzzi number explain heurist method imag intern confer inform process manag uncertainti system juli pp nguyen applic continu mathemat comput comput explain heurist numer method data process logic work note aaai symposium frontier soft comput novemb pp comput explain heurist numer method data process logic frontier soft comput aaai press pp intern journal approxim vol pp nguyen fuzzi crc boca reddi techniqu imag ieee transact imag vol pp referenc satellit radar ieee cybernet octob pp jr handbook statist method engin publish imag registr base fft algorithm intern confer remot decemb vol pp scienc technolog civil engin prentic englewood
HCI/13 4 robocup search rescu disast domain autonom agent research hiroaki kitano itsuki noda hitoshi matsubara takahashi kitano symbiot system japan scienc technolog tokyo japan soni comput scienc japan depart comput system kobe kobe japan ibaraki japan japan intern academi media art japan japan abstract disast rescu social issu involv larg number agent hostil environ intend promot research develop social domain creat standard simul forum research rescu domain intuit appeal larg scale analysi domain characterist present detail analysi task domain elucid characterist system domain introduct secondari domain robocup activ aim ensur smooth transfer technolog invent robocup activ social real world establish domain complement featur miss examin principl teamwork system multipl domain common domain characterist chess illustr tabl robocup rescu consist simul leagu real robot leagu simul leagu strategi plan team focu real robot leagu capabl individu robot rescu robot collabor accomplish specif task simul disast rescu oper develop simul enabl simul rescu oper contribut qualiti effect actual rescu oper long run develop integr simul larg scale disast number approach compar strategi tactic save peopl properti progress system technolog methodolog invent appli real search rescu system field personnel robot autonom human disast site interlink mission planner carri optim rescu oper categori paper focu research issu robocup rescu simul leagu goal paper present detail analysi disast rescu domain ai elucid characterist plan system paper consist major analysi task identif simul identif requir ai system rescu oper domain characterist scenario happen actual disast visual characterist disast rescu januari larg earthquak moment magnitud hit kobe kill rescu soccer chess number agent team agent team heterogen homogen logist major issu plan major issu involv emerg collabor major issu hostil environ oppon player oppon sec min msec inform access bad good perfect hybrid symbol control distribut central tabl featur chess citi million peopl build build usabl earthquak cost basic infrastructur damag billion total properti damag includ privat properti billion dollar ten time larger earthquak hit southern california area hit facil public transport system total disrupt basic urban infrastructur water system sever damag earthquak inform scale damag immedi transmit part countri inform infrastructur personnel transmit damag report catastroph damag incap send inform victim structur immedi fire start spread wider area fire fight effect water suppli disrupt local reservoir crack water leak hour make situat road open area stop fire turn pathwai air rescu team hard time arriv disast site due disrupt suffici accur inform aerial surveil final provid detail situat surfac problem helicopt aircraft creat hamper ground oper alloc victim sound victim creat sourc inform lesson learn kobe earthquak intellig plan system power system cope chang situat save peopl scale disast speed chang situat mission plan contribut ai robot make major area ai robot research make contribut reach current number contribut futur technolog potenti simul understand optim search rescu strategi larg scale disast illustr previou number incid human capabl make confid provid simul system significantli improv qualiti understand simul unfold simul system integr simul properti infrastructur fire factor group agent deploi examin efficaci specif search rescu strategi simul link mobil commun data acquisit system field simul possibl involv agent event opportun research contribut search rescu build group robot work special specif mobil find victim robot leg walk insert rod microphon camera robot small ccd camera robot collabor cover space effici complet cover teamwork essenti factor number agent involv scenario depend size singl site disast rescu simul system disast simul requir integr simul aspect disast build disrupt water movement statu hospit build simul damag build detail simul made level specif major landmark simul occur spread time composit build type weather factor incorpor spread pattern fire reflect build effect fire fight exist simul model process stochast process propag heat catch fire threshold function static terrain incorpor damag effort simul damag water infrastructur damag simul tightli coupl build damag simul simul predict road level simul coupl simul victim model victim critic compon simul depend type locat magnitud physic mental damag victim suffer differ drastic reflect differ urgenc rescu victim chang involv time frame kind hospit victim type equip time sensit element type causal care short period team arriv time natur oper victim prioriti lower rescu direct urgent victim save victim turn time critic victim urgent factor behavior model model essenti requir simul larg number peopl escap disast find secur search famili friend movement critic import massiv march escap disast site block traffic reach disast site rescu artifici life type approach provid reason simul aspect interact chang terrain due build road perform polic continu chang movement affect simul search rescu strategi find search rescu strategi larg scale disast involv plan teamwork plan hierarch plan kambhampati plan possibl creat exhaust list research major issu domain involv plan execut monitor physic inform capabl dynam chang hostil environ wai planner work coordin global strategi subordin planner flexibl hierarch plan essenti accomplish larg scale plan plan distribut disast site spread wide area commun limit local plan commun planner global planner synchron activ statu achiev optim strategi contrari notion global plan establish technolog total distribut asynchron plan clear global plan center expect global plan site destroi effici strategi plan achiev global plan subordin total distribut plan suffic major research issu entir plan system flexibl dynam reformul plan strategi spectrum distribut plan hierarch plan agent involv heterogen rescu peopl autonom agent critic plan constraint sever situat chang good plan quickli good plan agent case provid plan quickli heterogen agent planner recogn capabl coordin accomplish task capabl miss agent site planner access potenti avail miss request capabl ad agent agent particip team robust plan disast site inform agent maker essenti plan system access reliabl cope error featur planner activ request inform gather critic actual agent involv accid disabl reason oper dispatch agent due unexpect site method cope rang execut plan occas human rescu person make execut search consist planner plan planner cope complex work negoti find solut action human rescu consist planner work learn archiv capabl transfer success action site execut monitor hostil command oper dispatch planner execut expect major question gather inform statu plan cope disrupt deal personnel site provid incorrect inform issu tightli coupl robust plan plan total disast number search rescu scenario militari plan polit social easili incorpor autom rescu strategi creat offic accommod planner set creat plan plan search rescu oper constrain factor number robot personnel arriv specif site time limit agent planner account possibl plan mitig maintain strategi data collect agent plan major problem disast repeat time difficulti accur inform reason time explicit plan agent data coupl agent inform obtain faster reliabl total open investig past discuss number aspect problem ai robot contribut aspect actual issu ffl robust robot system disast mean move uneven surfac hostil environ ffl multipl system flexibl sensor extend captur sign victim ffl intellig system semiautomat carri sensor placement ffl plan system coordin action posit robot team ffl interfac enabl rescu person control team robot effect oper ffl interfac strateg plan system coordin local oper global oper ideal system organ maintain consist robust failur singl multipl failur planner robot issu open problem ai domain rich sourc inspir promot robot gener technolog secondari domain robocup design ensur smooth transfer technolog develop current robocup promot innov complement featur miss soccer simul real robot initi focu aspect activ paper strategi plan aspect simul rich sourc direct contribut societi expect acknowledg paper base discuss technic includ hitoshi itsuki minoru hiroaki member refer challeng ai ai flexibl teamwork persist proc plan design comput proc plan partial hierarch proc proc earthquak analysi proc japan earthquak engin
HCI/14 4 virtual inform tower metaphor inform access mobil environ alexand uw kurt andrea fritz stuttgart institut parallel distribut system germani phone fax abstract paper introduc virtual inform tower concept present access inform mobil client mean structur assign geograph posit area visibl user equip wearabl comput access current locat architectur protocol system user creat access inform internet mechan implement prototyp system client wearabl comput present aspect implement introduct mobil inform access import field applic wearabl comput mobil environ access inform content inform user interest inform depend user current locat tourist interest restaur close restaur end visit applic account user geograph posit answer inform request order determin user geograph posit posit sensor present virtual inform tower metaphor make inform access intuit user electron note suggest approach limit attach textual inform locat flexibl support content type visibl rang hierarch document structur area visibl approxim describ geograph region inform attach relev present user posit remaind paper structur section present basic concept section describ main compon system internet interfac detail implement prototyp system client applic wearabl comput section section reflect relat work conclud paper section outlook futur work concept virtual inform tower creat rough electron column posit fix geograph locat height determin rang visibl higher bigger visibl rang user enter visibl rang displai access inform provid item inform attach area visibl insid area visibl restrict user approach direct figur creat sign point build figur visibl rang restrict visibl rang contrast virtual note perman charact user rememb inform virtual limit annot real world object place simpl textual note complex host complet hierarchi inform call poster poster imag poster provid access exist servic inform web poster includ program develop special servic ticket offic user annot inform access permit user make annot virtual due flexibl achiev support type applic mobil tourist guid system base place histor inform sight arrang guid direct sight public transport system train subwai station displai timet present timet modifi station current time front cinema theater bui ticket make reserv provid inform transport histor content summar profil simpl form profil list keyword profil search inform topic filter present user automat match profil system internet section distribut system permit user creat access internet prototyp system develop part initi work project nexu main compon system shown figur user access system client mobil current posit determin gp sensor base web user view content case attach poster global directori find manag content remaind data structur describ interfac directori manag access mobil commun client posit sensor control messag internet figur compon architectur locat model defin geograph posit area visibl simpl locat model base coordin geograph coordin system gp locat consist coordin repres geograph posit geograph region datatyp area circl defin center radiu coordin corner locat model defin set predic test posit test overlap area calcul distanc posit detail descript predic attribut subsect show main attribut store xml data structur manag inform attach organ hierarchi folder item folder group relat realiz blackboard user attach inform item messag user item url point www store note blackboard set ffl identifi uniqu context manag global uniqu creat similar url concaten local server ffl inform relat geograph defin area visibl visibl user insid area exact geograph posit visual ffl user group user access inform owner access set attribut set default set folder item ffl attribut time modif time expir give time modifi long inform expect valid attribut client determin long data structur cach ffl main folder content start folder folder item set similar access blackboard permit written inform modifi owner item folder locat area visibl insid area visibl restrict direct segment compass creat virtual sign point correct direct side import item inform mark activ present user figur show configur front build faculti comput scienc stuttgart interfac subsect describ detail explain network interfac basic compon manag store manag number web manag intend organiz manag singl administr mention manag identifi local uniqu client protocol access item inform attach ffl locat content item visibl locat item consist hierarch path includ folder userid manag determin user access item exist neg acknowledg ffl userid attach item item includ path content item attach messag request ffl userid main faculti comput scienc stuttgart alexand index plan build plan build faculti comput scienc stuttgart figur defin build faculti comput scienc stuttgart remov item access user permit ffl messag similar creat remov folder directori distribut compar domain system store area keyword address manag exist directori structur hierarch server area request rout server server mechan similar geograph rout directori updat chang send ffl area expir address manag creat area visibl messag specifi address manag store expir date delet chang messag receiv ffl area expir address manag request similar attribut chang expir date reach ffl address manag remov manag directori client directori determin visibl locat current posit user number return reduc maximum size area local interest directori search keyword map area ffl cach max area interest area address return list area visibl includ locat paramet cach size directori return inform nearest fit cach client maximum area send request continu ffl keyword area address similar messag search match keyword ffl area map file return graphic file section fit request coordin corner extens combin www client access system view modifi content client intend run mobil commun system wireless network access posit system gp stationari comput posit user interest enter manual select map client directori find notifi user applic avoid constant cach inform defin size cach client handl registr user manag access inform store implement prototyp system implement client ma iv wearabl comput comparison pda comput power pda easier walk notebook prototyp connect internet gsm wireless lan posit differenti gp system accuraci meter height inform provid gp sensor prove compar inaccur differ case hundr meter figur show user interfac run insid web browser figur user interfac client prototyp directori exist simpl form singl server directori call area manag area area manag select manual client make move area area manag user address area area manag time applic distribut compon requir similar plan develop hierarch area servic effici map servic area directori eventu integr gener directori relat work past year number inform system system metaphor order support user kind inform access except note project kent aim project realiz electron note user make note arbitrari geograph posit note store posit inform displai posit metaphor provid access exist inform manag user enter inform idea integr virtual object real world environ found augment realiti system applic system worker power line water run wall build inform access system design applic provid gener metaphor kind inform futur work present idea virtual inform tower metaphor publish access inform relat geograph locat area shown applic system integr internet simpl client develop wearabl proven suitabl devic view interact implement prototyp system improv enhanc metaphor attach inform geograph posit physic object depend integr exist inform directli attach object real world system simpl model real world consist virtual object object real world attach inform item directli object detail includ real world nexu project start develop platform offer gener support applic maintain distribut augment model world real virtual mobil stationari object inform state real posit mobil updat model platform support type virtual creat modifi user applic virtual note attach object system implement base nexu platform function relat find nearest provid directori perform platform refer dod world system definit relationship local system technic report nation imageri map fritz auf master rothermel nexu open global infrastructur applic annual intern confer mobil comput network acm press support open distribut system phd imperi colleg technolog atkeson rapid prototyp mobil cyberguid case studi annual intern conferenceon mobil comput network page acm press imielinski geograph address rout annual intern conferenceon mobil comput network page acm press nexu nexu project page note extend interfac user intern confer intellig user page comput applic ieee workshop mobil comput system page ieee gibbon activ badg locat system acm transact inform
ML/15 6 learn coordin function structur agent distribut data process nagendra victor lesser depart comput scienc massachusett ma abstract design system coordin problem present involv intric sophist interplai domain system compon achiev effect coordin system difficult problem number reason local view task uncertainti outcom interact task present learn algorithm endow agent capabl coordin algorithm base present problem solv situat domain distribut data process introduct achiev effect coordin system difficult problem number reason agent control base local view task lead inappropri activ result transmit agent result agent agent view task structur agent make inform choic avail type residu uncertainti outcom task futur task result agent exhibit behavior difficulti achiev effect coordin exacerb fact acquir exploit view agent expend comput resourc term commun delai wait inform comput cost provid inform suitabl form agent process inform make local control specif due inher uncertainti agent activ cost worthwhil acquir complet view agent activ sophist coordin strategi permit level materi base work support nation scienc foundat grant content paper necessarili reflect posit polici offici infer activ occur optim coordin local problem solv effici addit overhead coordin nagendra prasad develop tool repres complex coordin problem instanti coordin mechan facilit empir studi effect coordin mechan environ stochast task structur descript languag gener tool model task structur domain stochast graph grammar captur morpholog regular domain grammar augment attribut captur addit aspect domain semant model agent organ interrelationship function domain distribut data process empir studi effect coordin mechan condit domain present learn algorithm endow agent capabl coordin mechan base present problem solv situat maxim perform domain distribut data process rest paper organ briefli review task structur complex coordin problem descript stochast task structur descript languag show tool model distribut data process problem descript close work model organiz design distribut data process present detail describ learn algorithm learn coordin mode level tacit priori commit dynam gener commit present earli encourag result conclud task environ simul framework environ repres coordin problem simplest model task environ specifi action agent action relat perform system repres coordin problem distribut sensor hospit patient airport resourc distribut inform pilot local area network model activ intellig agent oper complex environ ffl task requir specif deadlin ffl environ involv domain goal encod function rate accept agent strive solut necessarili optim term qualiti refer accept characterist tempor characterist ffl optim perform individu comput task due miss incomplet lack process time ffl comput result multipl agent integr form complet solut deal learn ffl subproblem solv independ isol ffl agent concurr contribut achiev multipl goal involv potenti subset agent implic deadlin requir multipl wai accomplish goal trade time produc result qualiti result possibl incomplet miss inform lead agent work satisf mode problem solv structur oper effect miss inform includ call coordin relationship defin term result qualiti comput specif inform arriv prior start comput task effect agent activ quantifi local measur perspect contribut solut goal progress achiev goal occur increment result multipl activ agent activ possibl individu agent activ contribut independ goal model present summari object definit model interest reader find detail exampl descript start environ end agent perceiv defin coordin problem final subsect model discret state agent system time comput state previou time environ gener function arbitrari set paramet set produc episod gener model specif paper discuss gener episod identifi collect problem paper episod collect problem occur distribut data process center full dai describ object task structur episod episod consist set task group ht task group arriv time deadlin task group repres set relat action task group repres direct acycl graph node graph call task task denot root simpli symbol entir task task children call execut method short task root straightforwardli call subtask structur task group meant reflect problem task structur edg graph form subtask relationship task task group qualiti time base subtask relationship qualiti function construct subtask relationship defin set direct subtask qualiti function return qualiti time qualiti semant environ model choic qualiti function arithmet write qualiti achiev task group time mean current qualiti root task execut method repres domain execut blackboard knowledg run instanti execut piec code data execut method function defin current maximum qualiti achiev execut time durat current durat method time number time unit spent execut definit fix qualiti time function model constrain obei qualiti maximum qualiti execut method complet task method start execut execut method finish potenti affect ms execut effect write relat label arc task structur ps paramet specif class effect outcom applic effect durat effect chang qualiti effect chang effect class function method time durat qualiti paramet paramet method initi maximum qualiti durat defin effect consequ effect appli order model defin sixteen effect defin perform measur system function episod default sum task group qualiti defin control function control agent agent current belief time return action agent time statement cooper coordin control problem spirit specif team theori find set control agent attempt maxim expect perform measur entir system agent similar problem studi dai coordin agent control function attempt maxim perform realiz agent task structur gener decker illustr import extens empir studi determin role coordin algorithm task environ studi reli weak task environ gener limit set numer paramet task structur depth varianc number interrelationship task structur rise wide rang task structur huge varianc type capabl system effect handl real applic involv infinit varieti task structur domain semant dictat limit morpholog task structur bound random highli regular model task structur coordin problem instanc paramet depth branch factor introduc graph grammar base task structur specif languag power model topolog relationship occur task structur repres real life applic briefli introduc graph grammar extens tradit graph grammar captur domain semant topolog relationship show model data process captur task structur grammat specif graph grammar graph grammar power tool number captur underli structur regular offer structur describ topolog relationship entiti domain graph grammar fundament similar string differ ly product graph product tripl subgraph replac hand subgraph insert place host graph transform number scheme graph grammar primari differ differ scheme tradit literatur graph grammar deal attribut valu node edg stochast product attribut captur number aspect domain semant addit topolog relationship entiti stochast product add power model potenti grammar captur aspect uncertainti domain call grammar attribut stochast graph grammar graph set vertic refer set edg node edg label attribut stochast graph grammar defin nontermin node alphabet termin node alphabet mutual disjoint respect set start label node finit nonempti set graph product graph product hg graph deriv rewrit graph involv call locat subgraph isomorph product establish area remov edg incid replac emb host graph figur show simpl rewrit stop node label termin alphabet set result graph consid member famili graph gener sake expositori clariti doesnt deal attribut distribut data process exampl section show instanc attribut extens definit graph grammar involv partial edg product link local label label host time applic product edg link node label time due rewrit host graph termin graph reach node hang edg remov point connect connect connect product rewrit figur graph grammar rewrit distribut data process function agent organ deriv domain distribut data process involv number geograph data process center center conduct type analysi task stream satellit data arriv perform data regular interv perform incom data probabl prioriti begin dai probabl low prioriti analysi involv perform special analysi specif archiv data type analysi task prioriti center attend analysi perform data time handl task process center limit resourc conduct analysi incom data deadlin result process data center commun center due interrelationship task center order begin analyz stream satellit center result relat analysi center problem learn algorithm decid coordin center provid fairli simpl driven coordin precomput standard oper complex algorithm commit gener partial global plan approach model coordin algorithm vari sophist discuss data process problem repres task structur repres domain semant data process problem discuss data process center agent interchang figur show data flow problem consist facilit enabl soft interrelationship result process task start durat method achiev reduc qualiti hard interrelationship impli result process start process problem figur leav task crisi analysi perform analysi depend extern situat structur show method task figur show graph grammar task structur avoid attribut shown figur number attribut qualiti termin earliest start time termin method qualiti durat attribut method distribut repres aspect uncertainti underli domain featur grammar lead larg varieti semant task structur structur varieti limit graph product tg data flow taem task structur figur data process problem connect connect connect qualiti fn max probabl attribut tg figur graph grammar rewrit model domain graph gener task structur repres type oper perform incom data grammar activ regular interv arriv time probabl type low prioriti task structur grammar activ probabl prioriti task probabl time achiev crisi task higher final qualiti routin task achiev routin task higher qualiti low prioriti task task deadlin basic determin polici center repres amount process time center process data figur show interrelationship type process task investig experi task distribut agent shown rectangl demarc agent framework graph grammar base gener easili repres explor task domain routin crisi low prioriti figur data process problem instanti coordin mechan order bring bear collect coordin mechan multiag gener partial global plan coordin modul gpgp consist coordin notic featur task structur local respond commun inform gather commit coordin modul track local commit commit receiv multipl schedul local schedul return multipl schedul base gpgp coordin coordin algorithm distribut data process data flow agent commun result perform task agent agent exploit result commit agent agent case facilit result arriv start facilit task recipi agent task enabl start execut receiv result gpgp characterist obtain turn coordin relationship exploit turn view detect commun result repres extrem agent coordin commit relev result commit agent commun agent schedul dynam exploit interdepend task agent relev view coordin detect coordin form commit commun commit result rough coordin similar commun agent agent approxim idea agent complet task commun result base past experi form tacit social contract agent complet time task unrealist expect commit low probabl crisi task low prioriti task follow tacit priori rough commit coordin type rough commit routin task behav data flow crisi low prioriti task agent relev view coordin detect coordin rough commit routin task commun commit result view rough commit precompil social law learn coordin research shown singl coordin mechan good situat literatur deal coordin strategi base situat present learn algorithm abstract coordin problem instanc coordin algorithm class algorithm discuss previou section learn algorithm fall categori learn involv subject system seri run obtain set situat vector system perform base estim system coordin algorithm discuss train run coordin algorithm run problem instanc facilit explor rel perform algorithm system configur agent build store situat vector observ local situat commun agent situat form approxim global situat end problem agent observ commun agent obtain system perform measur regist situat vector train phase build set agent note begin problem solv agent commun local problem solv situat agent agent aggreg local problem solv situat form common global situat agent form ident build global situat vector commun learn agent coordin episod commun form global situat vector index situat instanc retriev neighborhood present situat simpl euclidean similar metric determin past instanc threshold radiu situat neighborhood instanc determin coordin algorithm present situat method choic process gave result base coordin algorithm maximum weight total credibl score credibl score coordin algorithm present situat obtain problem solv situat similar perform total past situat agent ident coordin algorithm situat vector abstract coordin problem effect coordin mechan discuss present compon compon repres approxim effect detect soft coordin relationship qualiti durat local task structur agent creat virtual task structur local task structur agent facilit potenti effect local task effect schedul virtual task structur effect coordin facilit agent compon repres approxim effect detect hard coordin qualiti durat local task structur agent obtain manner similar facilit compon repres time pressur agent sixth compon repres load obtain ratio agent qualiti time perform deadlin infin versu deadlin actual deadlin task structur environ final compon captur organiz paramet repres strength soft coordin probabl redund task structur agent assum set paramet form knowledg agent organ experi number paramet vari produc wide varieti problem solv environ report result earli experi perform set experi vari probabl center crisi task set crisi task group arriv probabl set set low prioriti task arriv probabl routin task time arriv deadlin fix time unit experi train system problem instanc paramet set test test instanc tabl show result set experi cell tabl show qualiti averag run paramet set crisi tg data flow modular rough probabl tabl averag qualiti tabl show crisi task probabl modular perform rough data flow wilcoxon test level crisi task probabl rough algorithm outperform modular discuss reason perform dynam summar refer reader interest detail commit mechan implement gpgp commit predecessor end interrel agent successor end result agent advantag commit agent process delai execut method late agent execut agent expect effect task exact task agent effect commun method enabl result effect pronounc crisi task lead perform simpler coordin algorithm learn algorithm good coordin set experi li advantag dynam environ task structur probabl due extern influenc experi crisi task probabl learn system mistak chose coordin algorithm provid maximum util chose rough modular experi crisi task probabl learn system mistak chose rough modular case learn algorithm perform coordin algorithm close train rectifi extent earli result experi reveal benefit learn coordin extens studi deal aspect problem learn coordin investig implic learn case system agent learn global aspect problem solv control commun suspect number issu crop system studi tackl albeit context learn refer albert learn algorithm machin chomski syntact structur keith decker environ center analysi design coordin mechan phd keith decker victor lesser quantit model complex comput task environ eleventh nation confer artifici page juli keith decker victor lesser quantit model complex environ intern journal intellig system decemb special issu comput model model characterist agent keith decker victor lesser design famili coordin algorithm intern confer san june aaai press longer version umass lesser predict coordin problem solver dynam domain seventh nation confer artifici page st august edmund victor lesser partial global plan coordin distribut problem solver tenth intern joint confer artifici august alan garvei victor lesser schedul uncertainti cs technic report grammat approach engin part research engin nagendra keith alan victor lesser explor organiz design case studi distribut data process intern confer decemb aaai press nagl tutori bibliograph survei graph grammar graph grammar applic comput scienc lnc page rosenschein zlotkin design convent autom ai page fall fu grammar pattern recognit graph grammar applic comput lnc page shoham tennenholtz synthesi social law artifici agent societi tenth nation confer artifici page san juli
DB/16 3 case parallel data wareh olap datta dept mi arizona az moon dept comput scienc arizona az helen thoma dept mi arizona az abstract recent year commun experienc tremend avail technolog support effici storag retriev larg volum data wareh analyt process product effici queri process critic achiev quick time olap queri larg open issu paper solut approach problem appli parallel process techniqu environ suggest effici partit strategi base relat data star incorpor index improv queri process time parallel resourc preliminari parallel strategi introduct recent growth support phenomenon result avail technolog support effici storag retriev larg volum data wareh analyt process product data defin repositori histor data support make olap refer technolog user effici retriev data data refer combin data olap techniqu olap system author list alphabet order characterist olap system transact refer transact process system oltp system design perform structur task detail record updat order emphasi maxim transact throughput contrast oltp data design support long period histor data data tend extrem larg data hundr gigabyt terabyt size inform requir capabl view data varieti perspect aggreg summar data import detail record queri tend complex requir oper join aggreg complic situat fact queri perform tabl potenti million record result deliv interact busi analyst system solut problem olap queri process appli parallel process techniqu work parallel physic design data wareh major dbm vendor offer product support level parallel process describ work detail section remaind paper organ section discuss parallel suit olap section describ parallel implement olap system focu physic design section discuss relat section conclud paper parallel data wareh appeal parallel process strong data environ due inher natur environ mention olap system emphasi interact process complex queri characterist extrem size method rapid queri execut partit data set olap queri execut potenti achiev linear speedup significantli improv queri time addit larg size growth import factor olap system data tend grow rapidli data call detail inform grow rate approxim gb dai scalabl architectur crucial environ architectur shown achiev linear speedup oltp environ complex relat queri worth investig perform olap system reason appeal parallel strong olap system relat logic design point illustr rolap data store relat star schema star schema consist singl fact tabl set dimens tabl star schema present figur deriv benchmark scale factor schema model activ supplier period year fact tabl sale dimens tabl time tabl fact tabl foreign kei dimens tabl schema suggest effici data partit show common type queri olap system queri dimens tabl join fact tabl queri identifi volum sold local supplier unit state period queri select sale time custom supplier state state group set attribut frequent join predic readili identifi structur star schema star sale tabl identifi attribut particip join dimens tabl inform appli vertic partit method attribut achiev benefit parallel specif vertic partit method refer storag structur serv index data discuss detail section turn attent parallel achiev olap system achiev parallel data wareh section preliminari idea achiev parallel data wareh import issu parallel process declust data declust involv chunk partit declust scheme rolap star schema base principl physic design strategi recent literatur present basic principl start point design data exploit parallel consid index data convent set relat tabl separ set indic access structur storag structur serv index data illustr star schema present figur typic relat data manag system tabl store tabl store addit base retriev index structur typic defin data fact tabl sale tabl index attribut number index scheme literatur index type shown olap tree bitmap index project index index project exploit posit index strategi project index simpli mirror imag column index index column fact index column comment byte byte byte byte byte byte byte byte byte byte byte byte byte row row byte row row byte byte quantiti tax discount statu row byte byte byte brand byte type byte size byte byte part byte supplier address nation region phone comment byte byte byte byte byte byte byte byte byte time month alpha week dai byte year byte byte byte byte byte byte sale fact tabl dimens tabl relat kei attribut attribut attribut byte byte address byte nation byte region byte phone byte byte byte byte comment byte custom attribut figur sampl star schema comment byte byte byte quantiti tax discount statu byte byte byte byte byte byte row row row byte row byte row row byte row row byte row byte row row byte byte byte byte byte brand byte type byte size byte byte part byte supplier address nation region phone comment byte byte byte byte byte byte byte byte byte sale sale sale sale byte byte address byte nation byte region byte phone byte ordin map byte byte byte comment byte custom sale time month alpha week dai byte year byte byte byte byte byte byte sale sale fact tabl dimens tabl relat attribut attribut attribut kei attribut figur schema fact tabl result duplic data index store appli divid sale tabl figur smaller shown figur scheme vertic attribut remain column origin sale tabl record origin sale tabl partit result tabl record easili compon row result tabl share ordin posit ordin map kei idea posit index detail tabl describ specif type basic join basic simpli creat vertic partit relat tabl sort partit number column origin unlik project index restrict singl column sort column index remov origin tabl store entri posit base record isol column project index fast access data tabl partit refer basic retriev bdi reli ordin posit rid map exact detail map rid ordin refer join support larg portion workload consist queri oper multipl tabl queri star schema figur access dimens tabl central sale tabl access method effici support join oper crucial support environ idea bdi present previou section easili extend support oper analyst interest trend season discount offer custom analysi base queri select sale group convent relat associ tabl time sale figur implement primari kei relationship link column perform join oper column access determin record join candid exist fast algorithm merg hash evalu join approach pointer underli actual tend give perform join strategi significantli reduc number data block access process join store rid match record dimens tabl kei valu bdi foreign kei column structur join consist list rid time tabl store data direct map individu tupl sale time tabl shown join requir answer queri perform singl scan properti size index proport number tupl tabl deriv applic principl data result physic design exploit parallel queri queri entail star join tabl supplier sale tabl typic scheme star schema obtain procedur algorithm notat procedur remaind paper present tabl symbol descript fact tabl af set fact tabl attribut set fact tabl attribut set fact tabl metric attribut set dimens tabl dimens tabl ad set attribut dimens tabl attribut bdi attribut ba set bdi attribut ba set bdi metric attribut set project attribut set metric project attribut oe set restrict predic ar set restrict attribut set join predic set processor group attribut project column attribut number processor number processor group size byte ratio metric data entir data volum tabl tabl notat star schema figur applic procedur result ffl supplier custom algorithm procedur physic design fact tabl schema af schema disjoint set set set metric attribut set dimens dd schema kei attribut store metric attribut ak store ak bdi dimens tabl store bdi part time dimens ffl bdi sale fact ffl bdi dimens time dimens bdi attribut remain dimens tabl establish present physic design strategi data turn attent describ data placement strategi data placement describ data placement assum architectur processor assum data physic design mechan outlin previou section basic approach partit processor mutual processor group dimens tabl strategi outlin algorithm fact tabl kei assign processor group insid processor group hybrid strategi alloc record individu processor metric bdi alloc group motiv approach provid detail fundament motiv approach task data placement hint structur star schema primari kei dimens tabl foreign kei fact tabl favor candid partit expect join attribut frequent make coloc fact tabl multipl dimens tabl time group dimens tabl partit strategi relat relat tradit horizont partit join dimens tabl fact tabl comput effici parallel data complet independ join comput involv dimens tabl fact tabl gener case size dimens tabl smaller fact small fit main memori number processor aggreg main memori rel size dimens tabl determin ideal parallel dimens tabl algorithm data placement algorithm determin size processor group dimens size processor group metric suggest partit strategi individu processor processor main memori size data repres star schema size dimens tabl byte ratio metric data entir data volum star schema rf processor group partit phase smallest number dimens tabl fit aggreg memori processor group min ds proport data volum store dn rf processor requir previou step increment repeat process assign processor group processor overlap processor group minim physic data placement phase alloc dimens tabl processor group partit dimens tabl horizont respect join attribut alloc metric bdi processor group partit horizont metric data describ algorithm essenti processor group partit phase partit set processor group physic data placement phase alloc data fragment individu processor shown algorithm parallel star join section present algorithm perform star join parallel assum scheme section partit strategi section set dimens tabl jdj dimens tabl set processor group jgj repres gener queri tabl select dk oe tabl particip join assum individu restrict predic oe concern tabl form attribut schema denot comparison oper assum join predic form kei attribut foreign kei referenc fact tabl descript algorithm present algorithm potenti effici gain result primarili parallel process queri capabl perform oper lend high effici measur actual perform algorithm scope expect gain term speedup relat work main approach improv olap queri perform olap precomput strategi index strategi precomput strategi involv deriv tabl store precomput answer queri tabl refer summari tabl materi view tradeoff time storag requir precomput data determin data precomput issu address work index strategi includ tradit index posit form posit index algorithm parallel star join requir scheme section partit strategi section dk ad ba ba oe ar ar ar exist predic oe refer tabl explan attribut ad locat group metric attribut ak locat group dim null restrict attribut ar gener restrict base predic send group dim dim result ba dimens project attribut fetch dim gener project column base dim send group result result ffi output result larg bodi work exist appli parallel process techniqu relat system work emerg notion architectur yield perform system commerci vendor capit fact issu close relat parallel declust larg data set number node parallel machin method develop year distribut data site earli work area concentr base singl kei approach support number vendor informix declust techniqu analyz mention awar publish academ work relat parallel data dbm vendor claim support parallel wareh product paper present framework appli parallel process olap system approach entail physic design base advantag effici partit suggest star schema data declust strategi incorpor task data partit present parallel star join mean perform star join parallel effici oper involv project column approach present leav open issu futur work area includ refin parallel star join implement test develop algorithm olap oper import metric judg perform algorithm parallel refer dayal overview data wareh olap technolog sigmod march provid olap mandat technic ef codd keller data placement proc acm dewitt grai parallel futur high perform system comm june benchmark sql demonstr speedup larg technic report tandem tandem part graef queri evalu techniqu larg acm comput june ullman implement data cube effici proc acm page june inmon build data wilei johnson shasha approach index design cube forest bulletin technic data march research privat moon saltz scalabl analysi declust method rang queri ieee transact knowledg data oneil graef join bitmap join indic sigmod septemb oneil quass improv queri perform variant index proc acm volum sigmod page red brick system star schema process complex queri white juli transact process perform san ca tpc benchmark standard june ramamritham data index effici storag index data technic report dept june submit public
IR/17 5 prune treebank grammar base noun phrase identif clair cardi david pierc depart comput scienc cornel ny morgan san abstract find base noun phrase import subtask natur languag process applic previou empir method base np identif paper simpl algorithm tailor rel simplic task present approach find base np match tag sequenc train phase algorithm base success base np grammar read grammar improv select rule high score simpl algorithm naiv heurist match achiev accuraci evalu penn treebank wall street journal introduct find base noun phrase step natur languag process accur identif base noun phrase arguabl critic compon partial inform retriev system reli base noun phrase main sourc index psycholinguist studi text chunk base noun phrase plai import role human languag process work defin base np noun phrase noun phrase noun phrase descend bracket portion figur show base np sentenc penn treebank wall street journal corpu string sunni confin resort town boca raton hot spring complex base simpler noun typic jet sunni figur base np exampl consid base sunni resort boca hot spring previou empir research address problem base np identif algorithm identifi base noun phrase initi determin modifi katz repeat handcraft noun phrase grammar conjunct heurist find maxim length noun handcraft lexicon constraint grammar find terminolog noun phrase includ preposit phrase church part program probabilist model automat train brown corpu locat core noun phrase assign part speech ramshaw marcu appli learn problem difficult directli compar approach method slightli definit base np evalu corpu approach evalu hand small test set automat comparison larg test corpu annot parti notabl except ramshaw marcu evalu learn approach base np corpu deriv penn treebank achiev recal level approxim paper present algorithm identifi base np arbitrari text earlier work base np algorithm contrast simpl natur base np permit accur identif correspondingli simpl method annot text figur train corpu identifi base np unseen simpli search occurr base np train hot spring mark base np text method suffer data similar back lexic item part identifi base np string tag sequenc base np train corpu train phase algorithm emploi success charniak statist initi base np grammar read grammar improv select rule high score benefit measur ident learn select order set transform simpl algorithm naiv heurist match achiev accuraci evalu base np corpora vari deriv penn treebank wsj base np corpu ramshaw marcu work slightli simpler definit base np conform base np empir sentenc analyz simpler phrase good start point partial parser delai complex attach phase process result approach empir base np finder achiev ramshaw marcu obtain publish result ramshaw provid learn algorithm inform addit inform base np finder control dispar knowledg find base np algorithm perform achiev slightli slightli recal ramshaw marcu approach approach offer import advantag make nlp ffl train exceedingli simpl ffl base np bracket oper time linear length text ffl accuraci treebank approach good applic requir prefer fairli simpl base np ffl learn grammar easili modifi corpora differ train text rule select ad delet grammar worri order effect ffl train phase offer gener approach extract grammar noun phrase grammar annot text note treebank approach base np identif obtain good result spite simpl algorithm base np extrem evalu suggest area improv replac naiv match heurist probabilist base np parser incorpor lexic expect nontrivi recal remain base np error tend follow simpl correct learnabl repair rule remaind paper describ specif approach evalu section present train applic phase treebank approach base np identif detail section describ gener approach prune base np grammar instanti approach evalu discuss result section techniqu reduc train time initi investig local repair heurist treebank approach figur depict treebank approach base np identif algorithm requir corpu annot base np assum train corpu sequenc word set base np annot np bracket word np goal train phase creat base np grammar train assign tag word train corpu extract base noun phrase train corpu sequenc tag form base np rule base np remov duplic rule result identifi base np text np rule np rule extract part speech tagger part speech tagger train corpu typic jet sunni text year nation associ manufactur settl capit indianapoli meet citi decid treat guest rock star factori owner tag text tag text np bracket text settl decid treat train phase applic phase figur treebank approach base np identif assign tag input word proce tag text left point match np rule remain tag text multipl rule match begin longest match rule add base noun phrase set base np continu match rule store data greedi base np fast store rule permit base np identif time linear length tag input text longest match heurist obviou problem algorithm rule rule set extract train corpu rule bracket error tag unusu irregular linguist construct inher ambigu base np spite simplic rule extract erron bracket sentenc exec squeez meet order viabl mechan identifi base np grammar improv remov problemat rule section present method automat prune base np grammar prune base np grammar goal base np corpu extract select set noun phrase rule accur identifi base np text gener prune procedur shown figur divid base np corpu train corpu prune corpu initi base np grammar extract train corpu section prune corpu evalu set rule produc rank rule term util identifi base np rule set longest match heurist find base np prune corpu perform rule set measur term label correct np np assign rule score denot achiev rule np improv corpu benefit rule number np correctli identifi number error rule consid error rule bracket part refer np base np train corpu rule form erron bracket penal rule bracket part refer np fragment base np boca hot palm beach bracket shown resort town np np np rule nnp bracket np bracket np bracket np rule nnp incorrectli identifi boca raton hot noun score rule incorrectli identifi held error previou error nnp origin np hot score rule receiv score correctli identifi palm beach base np benefit score evalu prune corpu rank rule grammar improv rule set discard worst rule investig iter approach discard threshold approach increment approach describ subsect threshold prune rank rule threshold algorithm simpli discard rule score predefin threshold set select rule correct bracket incorrect process discard rule repeat rule score evalu wsj typic requir iter benefit measur rank transform rank np rule discard rule extract rule evalu rule train corpu prune corpu initi rule set rank rule set improv rule set final rule set figur prune base np grammar increment prune threshold mechan prune np grammar interact rule threshold discard rule score absenc rule discard boca raton fragment earlier absenc nnp rule receiv score correctli identifi np explor method discard iter increment prune discard worst rule rank threshold set process discard rule time current rule set prune corpu begin drop rule set maxim final rule set human review experi compar threshold increment method prune np grammar rule set prune hand train corpu exhaust review extract rule practic case initi rule cull wsj approxim base np rule identifi discard individu problemat review identifi problemat class rule remov grammar automat goal human review discard rule introduc ambigu correspond overli complex base np partial np identifi inform compon nlp system viewer identifi class rule possibl rule rule wh rule verb rule pronoun rule misplac comma rule end adject rule cover class omit rule set experi section evalu evalu treebank approach base np creat base np corpora deriv penn treebank wsj corpu attempt duplic base np ramshaw marcu studi corpu slightli complic base np base np suit sentenc empir evalu measur effect noun phrase complex treebank approach base np identif treebank approach base np suffici simpl deriv test set section wall street journal distribut penn treebank ii experi emploi cross valid fold test prune rule remain fold train corpu creat initi rule final partit prune corpu prune bad rule initi rule result averag fold perform measur term recal earlier standard measur accuraci attempt measur correct np np correct np np annot text tabl summar perform treebank approach base np identif empir corpora initi prune rule set column result show perform unprun base np grammar column show perform automat prune rule set empir sentenc analyz reli partial find simpl constitu base np verb group machin learn algorithm oper output partial parser perform attach ultim output parser semant case frame function structur input sentenc treebank approach lexic templat lexic templat tabl comparison treebank approach ramshaw marcu lexic corpu final column perform rule set prune handcraft prune heurist initi rule set perform poorli autom approach provid recal outperform rule set prune handcraft prune heurist effect base np complex base np corpu substanti difficult approach identifi simpler np empir corpu lag publish result approxim straightforward ramshaw marcu learn algorithm access inform addit tag treebank make tag tabl compar ramshaw marcu result lexic knowledg column report perform lexic lexic templat show treebank approach increment prune treebank approach approach lexic templat shown perform compar lexic base np finder address section note small differ threshold increment prune method tabl minor drop perform worth train time effect techniqu speed train motiv charniak observ benefit rule occur train margin discard rule reduc size initi grammar time increment prune perform drop error local repair heurist inform kind error made treebank approach bracket error option incorpor lexic inform base np finder perform achiev base np initi threshold increment human corpu rule set prune prune review empir tabl evalu treebank approach mitr tagger base np threshold threshold increment increment corpu improv local repair improv local repair empir tabl effect local repair heurist ramshaw marcu includ hope similar improv exploit lexic inform treebank approach corpu examin error found linguist construct consist troubl exampl bracket shown ffl conjunct conjunct major problem corpu empir conjunct adject prove ffl difficult construct manufactur titan remov empir bracket oper pose major difficulti corpu ffl np punctuat bracket difficulti np quotat ffl noun phrase tempor np month ffl apposit np michael bracket mistak singl np ffl quantifi np np pp error stem underli close attribut error treebank base np bring effect perform algorithm empir corpu includ base np bracket correctli recogn count error tag error np miss bracket lack rule household product busi bracket special numer account substanti portion error categori error detect produc recogniz pattern linguist construct consecut denot bracket merg consecut np correct context fix error special express correct similarli local repair heurist typic exampl includ chang effect chang chang nt implement local repair heurist merg consecut np time express identifi simpl date express quantifi np merg form product leav untouch heurist merg find exampl produc heurist repres initi explor effect emploi lexic inform phase grammar induct bracket investig current local repair heurist advantag train bracket algorithm simpl fast effect heurist recal shown tabl consist improv corpora prune achiev approxim empir corpu approxim corpu note final result report introduct experi repres initi investig local repair encourag result heurist uniformli boost harm corpu design error empir corpu heurist recov improv expect obtain lexic base result paper present method identifi base np treebank approach simpl techniqu match tag intent captur simplic syntact structur emploi exist initi noun phrase grammar extract directli annot benefit score calcul error improv corpu select subset rule prune algorithm result surprisingli simplic method achiev recal simpl base np achiev recal complex np ramshaw marcu corpu base np finder improv heurist noun phrase bracket replac sophist method account lexic prefer rule disambigu statist distribut induc train investig extens approach close relat weight transduc provid principl appli prune strategi rule encod transduc recent begun explor local repair heurist initi result full impact heurist perform determin systemat learn test train data futur work concentr acquisit local repair heurist treebank approach base np accur fast bracket run time linear length tag text approach simpl train learn grammar easili modifi rule ad delet minim interact problem approach gener framework develop treebank grammar addit base np acknowledg work support part nsf grant mitr provid tagger refer surfac grammat analysi extract terminolog noun phrase page eric brill learn natur languag case studi tag comput charniak treebank grammar thirteenth nation confer artifici page aaai press mit press church stochast part program noun phrase parser unrestrict text confer appli natur languag page associ comput linguist perform psycholinguist linguist cognit john katz technic linguist properti algorithm identif text natur languag build larg annot corpu penn treebank comput fernando pereira michael rilei speech recognit composit weight finit automata yve languag process mit press lanc ramshaw mitchel marcu press text chunk learn natur languag process larg corpora kluwer origin detector english noun phrase workshop larg page associ comput linguist
IR/18 5 review multimod video index gm marcel wor intellig sensori inform netherland multimod video video document multimod integr abstract effici effect handl video document depend avail index manual index larg video collect effect index requir multimod approach modal select modal collabor fashion paper focu similar differ survei method aim autom time resourc consum process video index put forward unifi multimod view video document perspect author framework form guid principl identifi index automat method found literatur form basi categor method introduct manipul video index describ video content requir form crux applic digit librari store multimedia data filter system automat identifi relev video document base user profil cater index rich complet construct index carri manual assign limit number keyword video content specialist natur work make manual index video document time consum task automat video index method solut video index unimod textual modal good review paper techniqu multimod video index strive automat classifi video document base multimod analysi review multimod video index present author focu approach algorithm process auditori visual inform extend ad textual relat type index label put forward unifi multimod framework work extens work combin form complet overview field multimod video index multimod video index framework defin section framework form basi structur discuss video document segment section section role integr multimod analysi overview index type distinguish section end perspect open research question author perspect author video document textual channel express idea content video multimod make multimod view system domain defin capac system commun user type commun channel extract convei mean automat extend definit system domain video author perspect definit capac author video document express predefin semant combin layout specif inform channel inform channel video visual video auditori music sound heard video textual textual resourc describ content video definit natur lead semant content layout perspect perspect express intend semant mean defin segment level semant index hierarchi level relat video document base observ author creat video video document made data analysi video document made product data analysi exclud level defin segment base consist layout content element set video document share similar subset genr video document share similar level semant index hierarchi relat part defin logic continu part video document content consist set event logic unit event defin short segment assign content perspect relat segment element author creat video document element distinguish time place video stori notic static dynam entiti video human video layout perspect consid syntact structur author video document syntact structur modal tempor sequenc fundament tempor dimens individu charact tempor occurr express mean fundament unit aggreg artifact creation refer aggreg fundament unit sensor defin continu sequenc fundament unit result uninterrupt sensor record visual auditori modal lead camera result uninterrupt record microphon result uninterrupt record sensor record exist uninterrupt textual express granular word level sentenc text uninterrupt textual author video document concaten sensor shot coher structur document transit edit visual modal abrupt gradual fade dissolv select import visual sound valuabl transit devic video document relat make fluid natur auditori transit author smooth transit abrupt chang silenc transit textual close author typic color view abrupt cut separ connect smoothli final compon layout option visual auditori special enhanc impact add mean overlai text ad video frame product consid special effect viewer document descript inform content size spatial posit text video frame import viewer base discuss section unifi multimod video index framework base perspect author framework visual figur form basi discuss index techniqu visual auditori textual layout content semant index sensor shot transit edit special effect fundament unit hierarchi event logic unit genr video data figur framework multimod video index letter stand object peopl layout auditori modal hold video document segment analysi process author segment made video document layout content element discuss reconstruct layout modal focu segment content layout reconstruct layout reconstruct task detect sensor shot transit edit video data analysi layout reconstruct layout guid spectat experienc video steer analysi reconstruct visual techniqu exist segment video document camera shot shot boundari detect algorithm video index literatur detect cut video reli comparison success frame fix dynam threshold frame level extens overview cut detect method detect transit edit refer survei refer detect abrupt cut auditori layout achiev detect silenc transit locat categori underli signal literatur method detect shown averag en suffici measur detect silenc segment en comput set sampl averag window segment found lower silenc mark li al silenc detect separ input audio segment silenc segment signal segment detect transit point signal segment break detect break merg comput onset offset break potenti chang categori underli move window signal segment compar en halv window slide posit adjac break type merg singl break music distinguish sound base featur rate fundament frequenc assign probabl music audio featur harmon fundament fundament frequenc concentr valu period varianc rang amplitud detect text shot achiev depend granular interest singl word occurr white space main clue signal necessarili occurr singl hyphen context account reconstruct sentenc textual layout detect period basic heurist reconstruct period sentenc boundari indic transit typic found search predefin pattern layout modal multimod approach reconstruct wont effect task layout reconstruct perform reliabl result improv advanc techniqu method exploit learn capabl statist classifi content segment section introduc element content discuss detect automat detail review algorithm refer peopl detect detect peopl video document wai approach simplifi problem detect human face year method detect face imag imag sequenc critic survei current face detect method face detect face recognit techniqu aim identifi person drawback appli face recognit video limit gener applic report result show face recognit work constrain prefer show frontal face close camera face recognit techniqu video index context account limit applic peopl detect step detect human detect compon human bodi similar approach detect peopl method suit specif genr auditori channel strong clue presenc peopl video document speech segment layout segment classif signal segment speech achiev base featur comput approach chosen base check distinguish speech auditori signal defin featur base featur classif perform weight averag valu elabor audio segment algorithm author segment speech speech speech music accuraci compar auditori featur conclud tempor spectral featur perform cepstral coeffici linear predict coeffici achiev classif accuraci segment label speaker recognit identifi person base speech utter techniqu gener speaker identif system consist modul present author report encourag perform speech segment featur film strong textual cue peopl video document word approach present locat transcript relat problem task entiti field comput linguist seek classifi word document monetari peopl detect video achiev limit error modal necessarili multimod approach detect person video document improv improv fusion modal interest respect recognit specif person object detect object detect form gener problem peopl detect approach object detect base visual rang detect specif object detect approach gener object specif peopl car task easier group base motion absenc knowledg object vari rigid object motion detect valuabl featur approach gener object motion featur typic method detect move object interest start segment imag frame region imag frame share similar motion merg stage result segment specif object detect analyz auditori layout segment video document segment layout segment classifi sound sound analyz presenc specif object sound pattern specif object sound pattern dog ring music instrument detect specif auditori featur detect object textual modal remain challeng task logic intermedi step detect object interest textual modal tag inform tag extract analyz noun tag text make assumpt object present techniqu chunk knowledg chunk combin detect object video document applic prove valuabl extens unimod object detect success detect object limit exampl gener object detector form holi grail video document analysi multimod object detect interest object interest identifi modal specif visual specif mention accompani textual data yield suffici evid robust recognit set detect detect motion set static techniqu field imag retriev complet overview field kei techniqu easili video index focu method assign set label data imag classifi indoor type frequenc inform outdoor imag classifi citi landscap imag featur color color coher discret cosin transform edg direct edg direct coher vector analyz author detect presenc sky veget outdoor imag frame paper subblock independ bayesian classif sky veget base posit featur detect set base auditori achiev detect specif sound pattern author reduc auditori segment small set paramet auditori featur statist techniqu paramet space author accomplish classif retriev sound pattern includ water class natur synthet sound pattern distinguish hidden markov model base rhythm author capabl classifi set sound includ river transcript extract geograph refer inform video document author match place spatial result segment video sequenc index latitud longitud conclud visual auditori modal suit recognit environ video document situat textual locat extract fusion modal provid video document semant visual layout visual content video data video segment integr textual layout auditori layout textual content auditori content speech recognit video ocr event logic unit genr semant index figur role integr multimod video document analysi interest set term veget brazil flow river deriv modal isol multimod analysi reconstruct layout content step analysi process analysi layout content extract semant index role integr multimod video document analysi discuss illustr figur end section overview semant index type found literatur element visual auditori modal text typic compon convert visual modal overlai text video optic charact recognit method detect text video frame divid method util dct coeffici compress video video ocr method visual overlai text object convert textual qualiti result video ocr vari auditori modal typic convert utter speech transcript speech recognit system matur applic singl speaker limit vocabulari perform degrad real world applic lab environ integr integr multimod layout content element improv classif perform end addit modal serv verif method addit inform sourc import synchron align modal common timelin typic time stamp observ literatur modal convert format conform research main audio main imag frame convert imag process main audio sampl assign imag frame camera shot time stamp isnt advanc align procedur procedur error prone output speech recogn compar align accompani close caption broadcast method find match sequenc word transcript close caption perform base align text string segment select sequenc word similar resourc achiev goal multimod approach categor approach distinct properti respect process content classif method process cycl integr method increment content segment perform modal fashion classif statist approach overview integr method found literatur tabl integr method report symmetr follow approach classif data class semant index hierarchi method literatur follow statist approach statist integr method system present system associ detect face calcul factor combin analysi result face detect caption recognit hidden markov model frequent statist classif method multimod integr clear advantag framework capabl integr multimod capabl includ sequenti featur hmm classifi combin method modal symmetr statist iter tabl overview integr method includ product hmm classifi train modal combin comput product observ probabl shown result improv unimod approach contrast product hmm neural approach doesnt assum featur independ approach present train hmm modal categori layer perceptron combin output hmm symmetr fashion advanc statist classifi multimod integr recent probabilist framework semant index video document base call present model content element integr model relat symmetr modal integr author bayesian belief network improv detect perform demonstr framework support detect base iter viabil bayesian network symmetr integr classifi demonstr method doesnt support iter contrast symmetr asymmetr approach present hmm separ input video document broad categori base auditori stage hmm split categori base visual modal drawback method applic result effect classif task asymmetr integr support visual textual modal combin sport music documentari commerci cartoon soap featur film talk show semiot tenni car race guest host anchor report weather interview hunt car chase highlight walk gather graphic dramat event sport event dialogu stori plai break video document footbal soccer ic hockei action entertain inform commun semant figur semant index hierarchi instanc found literatur top bottom instanc logic event dash box group similar node refer found specif semant index gener semant index result form input stage index search visual modal specif time occurr semant event explor integr field imag retriev field method integr visual textual modal combin imag caption html tag earli report method knowledg base system system modal analyz caption identifi expect number face expect rel posit face detector appli restrict part face detect iter step perform relax threshold latent semant index popular mean integr lsi symmetr fashion captur text statist vector form html document word specif html tag higher weight posit word respect posit imag document account imag color histogram domin orient captur vector form combin form unifi vector author search imag report experi show maximum improv achiev visual textual inform emploi video index result improv multimod approach method integr symmetr fashion usag increment context mean iter valuabl addit success integr process usag combin statist classifi multimod video index literatur success statist method classifi combin boost stack result improv substanti advanc classif method field statist pattern disciplin prefer iter fashion semant index video methodolog section appli extract varieti video index section figur present overview semant index found literatur extens overview includ low level inform refer view video document perspect enabl present framework multimod video index framework form start point review video index techniqu end review stress multimod analysi futur form content contrast layout larg lot gain improv segment content set contemporari detector suit detect recognit content element constraint method detect content element adher unimod approach multimod approach prove fruit extens addit context account modal research field multimod video focu gear visual auditori modal semant rich textual modal larg combin visual auditori modal specif content segment method textual modal reflect semant index deriv multimod integr inform sourc emerg trend video index research report integr method improv perform method integr symmetr fashion usag increment context mean iter valuabl addit success integr process success integr method report base hmm bayesian network consid current multimod integr impact mention factor automat index video document make process effici effect yield richer semant index form basi rang innov applic acknowledg research sponsor multimedia inform analysi project institut appli physic refer abnei tag partial young method languag speech page kluwer academ wolf dialogu scene detect hidden markov model multimedia index multimedia tool event base index broadcast sport video collabor ieee transact kriegman eigenfac recognit class specif linear project ieee transact pattern analysi machin weischedel algorithm learn machin petri art watch film mayfield publish mountain modena survei automat index video data journal visual commun imag huang interact map digit video librari ieee harshman index latent semant analysi journal american societi inform wei video classif base hmm text face european signal process muller video index tv broadcast hidden markov model ieee intern confer signal page automat recognit film genr acm multimedia page san bregler find peopl european confer comput volum page wong integr multimod featur video scene classif base hmm ieee workshop multimedia signal mao statist pattern review ieee transact pattern analysi machin jain metadata video acm jang hauptmann learn recogn speech watch ieee intellig li integr multimedia process topic segment classif ieee intern confer imag page la sclaroff combin textual visual cue imag retriev world wide web ieee workshop access imag video mcgee classif gener audio data retriev pattern recognit automat text detect track digit video ieee transact imag man schutz foundat statist natur languag process mit poggio object detect imag compon ieee transact pattern analysi machin violent scene ieee intern confer imag volum page speaker identif video analysi hierarch video shot classif ieee intern confer imag volum washington huang probabilist framework semant video retriev ieee transact dev detect move object video robust motion similar measur ieee transact imag coutaz design space multimod concurr process data fusion page patel sethi audio video index spie storag retriev imag video volum page san patel sethi video classif speaker identif storag retriev imag video san pearl probabilist reason intellig network plausibl infer morgan san starner modular eigenspac face recognit ieee intern confer comput vision pattern scene determin base video audio featur multimedia tool rabin tutori hidden markov model select applic speech recognit leonardi identif stori unit sequenc joint audio video process ieee intern confer imag kanad detect face video ieee schneiderman kanad statist method object detect appli face car ieee comput vision pattern hilton boll automat text extract video annot retriev ieee intern confer pattern page jain content base imag retriev end earli year ieee transact pattern analysi machin wor multimod video review technic report intellig sensori inform system automat index retriev caption imag ieee picard imag classif ieee intern workshop access imag video conjunct video index base interact ieee transact circuit system video jain detect sky veget outdoor imag storag retriev imag video volum san zhang imag citi imag landscap pattern huang multimedia content analysi audio visual clue ieee signal process imag content versu context multimedia inform riao page retriev audio ieee ahuja detect face survei ieee transact pattern analysi machin zhang kuo hierarch classif audio data archiv retriev ieee intern confer signal volum page jain automat caption local compress video ieee transact pattern analysi machin
DB/19 3 discov web access pattern trend appli olap data mine technolog web log zaian man xin jiawei han research laboratori intellig system research laboratori school comput scienc simon fraser canada abstract confluenc data mine www perform data mine web log record collect internet web page access histori behaviour web page reader web server log file analyz explor regular behaviour improv system enhanc qualiti deliveri internet inform servic end identifi popul potenti custom electron commerc observ peopl collect data mine bring contribut digit librari design joint effort project virtual project data develop knowledg discoveri mine web server log file paper present design report current outlin futur work direct introduct web server regist log entri singl access save url ip address request timestamp rapid progress web grow popular huge number web access log record collect popular web site web log grow hundr megabyt dai file raw web log data order retriev inform nontrivi task easi perform systemat analysi huge amount data institut make effect web access histori server perform system design custom research support part natur scienc engin research council stand canadian network centr target electron commerc peopl realiz potenti usag data web log studi conduct analyz system improv system understand natur web understand user reaction innov studi adapt web site improv learn user access encourag excit potenti applic web log file import success applic depend valid reliabl knowledg discov larg raw log data commerci applic web log analysi free internet illinoi maintain list web access analyz hypernew page access dislik user consid inflex difficult maintain argu web log analysi tool limit result provid review twenti analysi includ microsoft market found report tool reveal frequenc count low conceptu descript level type report frequent report web log analysi tool summari report hit byte list top request list top list common browser hit hit domain error directori tree fact report custom major web log analysi tool rigid report web log analysi tool limit regard size web log physic size practic time low speed analysi reduc size log file web log analysi tool make assumpt order filter data fail request page graphic round log entri combin similar request assumpt made web log analysi tool result prospect statist log file report analysi web log web log analysi tool end statist result current web log analysi tool limit depth valid reliabl result recent progress develop data mine data wareh made power data mine data wareh system success data mine system handl larg data file web log file systemat studi develop data wareh mine system mine knowledg web access log record recent research develop data mine technolog promot studi effici data mine user access pattern distribut refer mine path pattern understand user access pattern web site mine techniqu improv web system lead wise market put proper classifi mention mine path pattern infanc paper data mine data wareh techniqu analyz web log record base experi develop relat data data mine intellig system research laboratori simon fraser develop collabor teach learn research laboratori simon fraser jointli studi challeng issu data mine web log system perform data mine web log record collect web page access histori remain paper organ section describ design data mine system web log record implement effort experi present section section summar futur enhanc design web log miner commonli method evalu access web resourc user interest resourc count page access suffici correct web server log file current common web server insuffici data analysi perform data data mine system discov benefici inform web server log file domain ip user user gener request date time method request file result request size data url refer identif client agent log entri automat ad time request resourc reach web server reflect actual resourc record reader behaviour frequent backtrack frequent reload resourc resourc cach browser proxi cach store resourc hand client request leav trace log file frequent backtrack reload suggest defici design site inform site measur sole server log suggest mean data gather log file collect java applet techniqu solv problem creat page backtrack proxi necessit user web server log file enrich collect data mine process sole base inform gather web server research work web log analysi web access count indic user interest measur web page fuller access consid mislead metric sequenc document reach desir document lead final counter increment user interest access counter account user abil access inform appropri inform user access count conjunct infer interest find impoverish state server inform discov data mine techniqu date time collect success request give interest clue user interest evalu time spent user time sequenc analysi time domain collect practic classif resourc base countri type domain sequenc request predict request popular request improv network traffic cach cluster resourc site base user motiv server log record web server filter data mine appli data collect web log stage data filter remov irrelev tion relat creat remain data facilit inform extract data summar base individu attribut user data cube construct dimens analyt process stage slice dice web log data cube fourth data mine techniqu put data cube discov interest correl construct server log data clean data transform data filter step typic step adopt web log analysi tool typic web log analysi tool filter request page graphic sound order concentr data pertain actual page tend entri give interest clue web site traffic user motiv user action gener multipl server request page media request import deduc intend action user typic clean process consist elimin log entri gener web agent web link intellig agent page cach chose screen request gener web agent interest analyz web agent behaviour site compar traffic gener autom agent rest traffic data filter adopt transform data tend data relev elimin minim amount data type data clean data necessit knowledg resourc site clean date time field log knowledg site date time field simpli restructur set field minut filter server request fail transform server error code gener transform ip address domain independ site content associ server request set server request intend action event necessit knowledg site structur dynam gener web page result singl ident server request knowledg paramet provid script gener dynam knowledg sequenc request histori request essenti disambigu server request associ event metadata provid site design requir data clean transform metadata consist map tabl server request sequenc request event repres url transform process replac request sequenc repres url add event tag log entri clean transform web log web log load relat implicit time spent calcul time spent event approxim differ time page current event request time page request threshold case user back server notion time spent approxim actual durat includ time network navig insid metric compar page design web log data cube construct manipul data clean arrai call data built aggreg hit count data cube numer dimens gener dimens repres field valu attribut dimens url server file dimens time year attribut dimens relat partial order indic hierarch relationship dimens attribut hierarchi gener case partit dimens rang automat gener hierarchi dimens file size partit size rang group categori huge data dimens dimens repres attribut ja row ja number distinct valu dimens ja row data row distinct data row sum store summat count column row data cell store count tupl initi case web log count resourc hit sum cell sum repres keyword store sum sum count gener tupl share valu sum data cube view lattic space base consist data cell space consist cell singl sum space consist cell data cube shown fig notic sum sum sum figur data cube summari layer larg number cell cube handl cube matrix technolog appli data cube construct method recent effici comput data scope studi exampl dimens web log data cube includ notic dimens defin concept hierarchi facilit gener special dimens ffl url concept hierarchi defin server directori ffl type defin file type ffl size defin rang ffl time resourc defin time ffl time spent defin rang hierarchi ffl domain request defin domain ffl agent made defin hierarchi web agent ffl defin user ffl server defin error code hierarchi structur data cube remark flexibl manipul data view perspect sum cell quick summar level concept hierarchi defin dimens attribut build web log data cube applic olap analyt slice view analyz web log data deriv ratio comput measur dimens oper navig gener data special attribut step aggreg hierarchi present number hit group dai number hit group hierarchi time oper navig specif gener attribut climb aggreg hierarchi aggreg total request organ dai countri dai summar server domain hierarchi slice oper defin perform select dimens select valu dimens liter cut slice dimens select domain dimens server slice educ internet domain dice oper set consecut slice oper dimens defin perform select dimens deriv dice web log data cube dimens countri month agent file type olap oper assist interact quick retriev data web log data cube quick queri analysi larg web access histori file data mine web log data cube web log analyt process data cube structur offer analyt model includ calcul engin deriv highli interact power data retriev analysi environ environ discov implicit knowledg web log implement data mine techniqu web log data cube knowledg discov repres form visual present form classifi data web access log data mine function briefli explain ffl data function data web log consist find rule summar gener characterist set data rule gener gener data cube produc web log data cube olap oper traffic web server type media time dai summar characterist rule ffl class comparison plai role examin web log data discov discrimin summar featur distinguish data target class contrast class compar request web browser web discrimin rule summar featur discrimin agent file ffl function mine associ rule form abstract discov pattern access resourc consist occur access place occur regular time ffl predict involv predict valu distribut attribut interest base relev attribut relev analysi predict model construct statist analysi techniqu predict valu miss data distribut attribut set object access resourc dai predict base access similar resourc similar traffic page predict base distribut traffic page server directori ffl classif consist build model class base featur web log data gener classif rule model model construct analyz train web log data set class label classif rule develop understand class web log restructur web site custom answer request qualiti base class request ffl analysi analyz data collect time sequenc discov interest involv attribut relev model predict analysi explor techniqu develop mine techniqu similar period analysi web log data pattern trend web page access year suggest improv servic web server data mine function analysi share common work tradit data mine ibm intellig miner silicon graphic paper discuss applic data mine function web log mine detail focu analysi web log record highli goal data mine web log record larg aim mine pattern analysi includ network traffic event sequenc user behavior pattern transit trend analysi avail data cube analysi perform systemat analysi perform multipl dimens multipl granular major differ analysi web log mine comparison tradit data mine process trend analysi illustr process analysi trend web access user web navig behaviour attent interest topic analysi step select user access web page access web page includ analysi access regular standard filter scatter access cycl detect web regular user start set page input leav session long time back start session start restart web sequenc local web page access form cycl data mine task detect cycl effect analysi develop techniqu find cycl detect period effici data cube structur olap techniqu trend analysi accumul discov sequenc analysi perform discov pattern trend interest kind pattern easili discov repetit similar web page access set web user access page repeatedli similar pattern number access page node regist access frequenc data cube access histori gener web page access statist access statist form group web access access tree demonstr clear trend time structur complex access tree easili trend gradual reduc structur complex access show experienc user specif topic reduc number random search scatter topic notic data cube trend demonstr time simpl click button time axi trend human visual tool fulli autom process detail process web page access trend analysi present experi web log miner design base design elabor section experi carri analyz onlin develop research laboratori simon fraser system enabl custom enhanc educ train deliv world wide web collabor teach learn environ accumul larg collect multimedia resourc consist major compon conferenc structur system administr grade upload submiss virtual workspac predomin compon discuss collabor place hold organ set confer instructor student read write messag confer larg number messag gener heavi access traffic base exampl paper primarili event server host rang academ institut industri canada goal analysi server log file understand system term usag pattern user behavior give insight system user interfac characterist user popul data clean transform feed inform log file relat clean transform raw data origin log file entri includ domain ip user login date time method request locat file result request size data transfer entri shown tabl user id mask fake user process data clean transform entri log file map relat inform lost process entri record server request authent page entri potenti inform depend analysi kind question answer maximum inform relat draw relev inform leav rest analysi transform data entri addit indic host server request field deriv path file request entri shown tabl process infer user action pattern request elimin directli map set log entri translat set user action interact page gener dynam user request cgi script page number option user user made cgi call page gener possibl set option infer user action request cgi script paramet tag plain english step analysi user behavior gener problem data process occur similar interact onlin system problem solut extran inform mix inform log entri record request page irrelev current analysi solv problem simpli defin entri elimin multipl server request gener user action case problem user action identifi singl entri entri set simpli tag entri discard rest user action identifi multipl entri entri set infer user action process multipl entri multipl user action gener server request case user add messag preview cancel addit action call cgi script gener entri log time stamp case manag solv problem examin context entri occur case identifi translat entri multipl tag associ suggest made system develop script user action script sign valu local activ back record easi quick solut problem present backtrack infer case user behavior sequenc frequent backtrack context user interfac transform data entri attribut user action entri tabl point interest durat event addit inform interact event metric subject fair amount reason tabl fragment origin log file request ip address user id date time request file request result size receiv sfu sfu join waterloo tabl fragment transform log file time spent file browser unknown user behavior event metric select event valid sampl reveal inform durat time stamp current entri time stamp entri data cube construct manipul data clean relat construct process data cube construct addit dimens section dimens ad data cube dimens defin educ industri institut event dimens defin set user action place system organ partial order data cube olap techniqu appli provid insight target data set perspect conceptu level count summar function data mine typic summar includ ffl request summari give request statist ffl domain summari give request statist ffl event summari give statist occur ffl session summari give statist ffl bandwidth summari give statist gener network ffl error summari give statist error ffl refer organ summari give statist user ffl browser summari give statist browser figur olap analysi web log summari appli user length monthli relat data point summari correspond multipl abstract arbitrari combin drill perform web log data cube examin request network traffic user conveni gain insight system access gener perform insight behavior characterist user popul analysi web web log analyz olap analysi techniqu illustr simpl typic summar olap techniqu interest find messag creat dai week semest chose interest event focu level interest project intersect dimens time dimens locat cell figur show result olap result gener interact data cube structur file request user action result size receiv sfu start sfu join list join confer waterloo ui load page tabl fragment log file user action ad figur usag pattern figur distribut messag creat dai week similar perform event time interest comparison result gain knowledg analysi domain summar question ffl compon featur ffl event ffl distribut network traffic time dai month ffl user distribut domain ffl differ access user geograph question ffl context compon featur ffl typic event ffl gener behavior pattern ffl differ usag behavior user ffl user behavior chang question answer olap analysi requir sophist data mine examin subsect data mine web log data cube web log discuss section perform kind data mine includ predict analysi kind data mine task discuss previou data mine research due limit exampl analyz relat data mine analysi analysi import data mine task web log analysi web log record regist time web access behavior traffic web traffic analysi identifi network load traffic pattern relev time monitor system overlook trend amount user determin optim server size analysi perform gener traffic time dimens drill perform time dimens obtain detail chart traffic fluctuat pattern time figur show network traffic gener month period april chart figur show traffic gener trend month cycl peak vallei indic traffic gener begin week week dai weekend expect experi event sequenc user behavior pattern event sequenc analysi select pattern user categor user behavior pattern understand system user experienc difficulti user behavior figur network traffic gener month period evolv time event sequenc plot timelin chart output analysi form behavior pattern emerg group figur show typic behavior pattern group set event list side time interv top format bar run left event sequenc length bar durat event phenomenon discov begin user tend explor system featur time phenomenon intuit interest find featur consist featur featur time incorpor data cube featur plot data flow chart examin context multipl dimens multipl granular usag pattern analyz data cube base messag base repeat time framework perform framework demonstr regular time attribut transit analysi similar associ sequenc studi literatur figur show transit metric group user period probabl event probabl calcul base event frequenc event sequenc probabl list messag group user problem navig foreseen design metric markov chain analysi give insight access start end trend analysi examin kei event trend event detect consist pattern establish pattern time figur show event tree user behavior fourth month system branch start kei end kei number frequenc figur event pattern diverg frequent converg time figur strong event pattern unread discuss web continu grow kind web biggest repositori built analyz web access log web site understand user behaviour web improv design collect resourc import build tool analyz web access pattern web log analysi tool report interest limit huge size log file continu type data collect web techniqu analyz data imper design good web log analysi tool overcom current limit web log recommend direct web log standard analyz web access trend discov knowledg access record outlin design system benefit olap data mine data interact extract implicit knowledg larg web log file concret exampl techniqu pattern analysi major strength design varieti flexibl perform discoveri potenti design limit due current impoverish web log file web log file structur web server structur ncsa server log evid web server collect enter inform log urgent studi specif web access pattern analysi recommend structur web access log structur significantli simplifi data clean data transform stage experi show data clean data transform step time consum good data filter process metadata provid web site design figur transit metric start list access join show conf list unread list unread list list unread show conf list initi add list list list list unread join list list unread list list unread list list list unread initi add list month event tree start month event tree list initi add list unread displai list unread displai list unread list list unread displai displai displai list unread displai initi add displai displai month event tree start list list unread figur event tree month interpret access record make effect assumpt regard filter irrelev record map label web site metadata specif standard design structur resourc web log analysi tool interpret web log entri metadata specif standard lead construct gener tool data clean data transform implement process prototyp plan integr technolog develop data mine system data cube develop addit modul pattern analysi due import size explod natur web log construct data cube analyt process knowledg demand time consum reduc data cube construct plan build bridg web server data cube propag access inform directli aggreg cell data cube increment updat web log data cube real time web access analysi data mine develop experi report futur refer sarawagi comput aggreg proc int conf larg data page sept web log find recip success kohavi integr system data mine proc int conf knowledg discoveri data mine page newport august yu data overview perspect ieee tran knowledg data ps yu data mine path pattern web environ proc intl conf distribut comput page uthurusami advanc knowledg discoveri data mine fuller de measur user motiv server log file gong period pattern search data set msc simon fraser novemb hit year watch web proc int world wide web santa april zhu system data mine relat data proc meet page novemb han fu discoveri associ rule larg proc int conf larg data page sept chiang mine associ rule data cube proc int conf knowledg discoveri data mine page newport august kimbal data toolkit john wilei perkowitz etzioni adapt automat learn user access pattern proc int world wide web santa april pitkow search reliabl usag data www proc int world wide web santa april srikant agraw mine gener associ rule proc int conf larg data page sept commerci log process tool slice dice log sullivan read reader reaction inferenti analysi web server log file proc conf human factor june greenberg peopl revisit web empir find implic design histori system intern journal human comput special issu world wide web naughton algorithm simultan aggreg proc int conf manag page
DB/20 3 manag oper order problem parallel depart inform austria abstract paper parallel queri optim oper problem introduc class execut strategi call bushi tree compar relat approach gener bushi tree complex reduct oper order problem deriv theoret demonstr compar author optim time improv reach qualiti final demonstr exist commerci parallel queri optim extens modif order handl kei parallel parallel queri bushi extend exist optim introduct modern data mine support pose challeng queri optim process main issu concern process complex queri recent relat data queri involv join size relat reach gigabyt parallel kei technolog handl challeng complex queri optim crucial problem solv queri optim oper order problem oper order describ depend algebra oper queri determin complex queri involv binari queri oper boundari minu oper adopt preprint submit elsevi preprint januari time oper execut concurr oper order problem search optim order respect cost function search space spawn oper order parallel extrem relat queri particip number order low bound context high earli work restrict search order parallel exploit parallel shown effect case high perform parallel machin work manag search complex appli random search heurist method work low cost partit search space access navig local advantag move accept access global low cost strategi accept complex applic navig blindli search space subspac call bushi tree identifi regular structur search space includ parallel face significantli smaller search space gener valid pertin process seri experi perform relat randomli chosen queri author optim time reduct paper organ section section introduc parallel queri optim defin section discuss process relat previou work section determin theoret search space size compar gener search space size section valid effect process discuss result section show select commerci parallel queri optim extend cope section conclud point futur work parallel queri optim bushi tree queri optim dbm roughli divid main task rewrit queri push select scan base oper order problem choic access method index parallel optim problem complic dimens introduc oper ing introduc parallel schedul phase number feasibl execut strategi dramat addit queri number concurr oper bushi process parallel number execut concurr partit input pipelin parallel determin proper schedul alloc resourc critic parallel main develop manag parallel queri optim optim strategi oper order gener solut parallel resourc solut schedul parallel execut phase optim strategi oper order schedul hand hand gener order physic schedul paper focu oper order problem common strategi import problem solv parallel queri problem depend parallel schedul address good solut estim cost order determin parallel concret context sampl parallel machin schema gener methodolog make abstract focu parallel relat remind concentr parallel relat oper join predic methodolog appli true evalu path express queri pointer join extent object involv path express approach remain join oper exchang adapt methodolog complex oper union flatten perform dbm aggreg oper execut join process tree bushi tree order handl oper order special optim call queri process gener introduc repres oper order join predic form relat relat attribut tree bushi tree tree fig process tree left hand tree middl gener bushi tree hand tree leav queri process tree repres base relat particip queri intermedi node model oper receiv input relat incom edg send result relat outgo edg oper root tree produc result queri shape process tree classifi oper order relat parallel queri process strategi major form distinguish linear bushi tree linear join oper execut time type tree base parallel exploit oper work relat partit base pipelin strategi tree includ linear tree bushi join oper ly path queri process process time queri optim work bushi tree consid complet spawn search refer gener bushi tree space interest initi work consid segment tree set call segment result relat segment relat subsequ segment discuss tree form section figur show left hand middl gener bushi tree hand tree join relat built tupl input pipelin tree pipelin implement entir hash tabl relat fit main memori high handl result relat highli select join fit main choic optim task decid strategi search gener bushi tree space resourc avail high case optim handl larg search space size focu process situat requir optim bushi tree scope process call bushi tree bushi tree process tree join oper input base relat singl join figur page figur show join left hand process tree hand left process join base relat singl section posit process strategi relat previou work previou work earli relat work parallel queri optim concentr linear tree parallel work oper order includ parallel high schedul complex difficult synchron parallel dbm pari parallel edit dbm integr parallel queri execut machin schedul member space perform evalu demonstr context suffici high resourc avail term number processor memori parallel exploit complex queri linear tree process risk util resourc ineffici optim support parallel prototyp weak order manag oper order problem random search greedi heurist random search perform method hard predic local transform chosen randomli set space case search end low cost partit search space heurist space defin number particip greedi algorithm singl join input base relat definit relat linear comparison modest exploit parallel construct complet process tree iter initi set tree consist base relat algorithm obtain greedili lowest cost combin join element consid set greedi heurist achiev good qualiti order special case join graph commerci optim tune special star queri applic queri type join graph rang string highli graph point challeng challeng extend star june queri optim implement heurist queri type risk fail applic introduc queri join graph import qualiti featur complex queri optim capabl gener good solut wide varieti input queri type optim investig complet condit resourc avail risk lost search space show origin subspac bushi tree handl significantli effort oper order member space exploit parallel member space higher parallel form due load balanc longer conduc effici complex queri process initi effort construct subspac space undertaken mention segment tree space main drawback exploit space optim higher estim error size intermedi relat size process tree work space reason offer advantag singl join base estim relat whilst segment deep tree long segment input input unsur inform tree orient subspac space consid perform test parallel conduct found simpl extens tree supplement parallel join deliv perform wisconsin benchmark execut processor share system pure tree work consid queri complet space final remark recogn support origin strategi work hong share memori prototyp claim run cpu bound task parallel resourc effici hong consid complex optim issu show experi extens hong result appli show load balanc properti higher load imbal local bushi tree situat introduc section deriv search space size search space size section proof search space size bushi tree significantli smaller gener bushi tree estim lower upper bound space size order comput lower submit queri string upper bound cliqu queri figur cliqu particip relat string queri relat join end join variabl upper lower bound depend number particip relat upper bound lower bound space upper bound lower bound space relat string cliqu star fig queri type star cliqu order calcul introduc bushi tree identifi order evalu join join queri particip relat repres tripl distinguish node call join result complet bushi tree process tree relat call left bushi bushi upper lower bound number gener bushi tree order cliqu queri relat express recurr relat solut recurr string number order express recurr express explain string partit partit left child relationship verifi substitut recurr solut recurr upper lower bound bushi tree calcul upper lower bound space size introduc identif tripl distinguish node call join result complet gener bushi tree space distinguish construct process join input join case figur hand show left hand tree figur number order cliqu queri case ident bushi tree bushi tree fig left hand hand number order calcul recurr term refer process join left input base term input base relat term process join join left fourth term express facilit string partit input relat set fulli connect partit number order express initi valu summari tabl summar formula space size bound depend particip relat lower bound upper bound tabl upper lower bound space discuss tabl displai multipl factor size space multipl valu lower upper bound ident displai growth valu tabl demonstr search size significantli smaller higher number particip smaller space compar result section show import search time reduct achiev restrict space conserv oper order number relat growth tabl growth search space size experi valid effect bushi tree section report seri experi carri order studi effect bushi tree seri base support schema share system simul target system sun sparc workstat cluster connect fast network relat queri util previou protect parallel queri optim project sampl optim parallel queri base optim sophist tupl parallel cost model model queri time comput close formula recurr express space result formula estim complex initi valu esprit technolog transfer node project support european union oper schedul alloc processor comput heurist heurist prioriti local alloc oper uniti input relat store case due memori cpu exploit memori parallel oper alloc memori cpu mean execut import featur reject interest oper order term process qualiti load balanc parallel implement method estim parallel join pipelin parallel implement resourc valid methodolog reli examin local minima distribut gener bushi bushi tree space base iter improv optim search strategi strategi consist individu run number particip random initi process tree comput local transform appli cost improv achiev transform chang rule section methodolog base local minima cost distribut relat protocol characterist support system measur step requir find solut averag cost distribut space compar result load balanc local bushi tree situat solut analyz testb relat schema individu relat characterist relat schema relat join graph develop support applic field star graph special node connect edg figur introduc star queri regard repres dss queri type star queri correspond typic commerci applic lot small relat join larg ment star queri integr relat star graph relat connect string relat star figur reason practic mixtur big star string relat join graph implement star queri join graph highli fig implement queri star high connect long string introduc join graph figur string subgraph node incom outgo order implement string queri subgraph relat highli realiz figur queri particip relat belong subgraph call high connect queri star string queri consid dss high connect queri occur valu relat tupl number attribut number uniqu valu join attribut control join chosen relat relat cardin rang small relat countri tupl larg relat tupl size number attribut architectur system queri characterist relat assum partial declust disk share system schema relat cardin smaller tupl randomli alloc disk relat cardin randomli assign half disk larger relat declust disk queri run classifi complex queri class queri class implement star high connect string queri random queri comparison search complex relat seri experi optim time iter term number appli transform compar space sampl size individu run tabl present result line print queri join instanc queri class tabl line express percent averag reduct supplement averag step search solut oper order relat averag step requir find queri tabl averag reduct rate optim step tabl show averag reduct rate increment queri complex reduct rate averag join averag join averag higher reduct rate expect complex queri rate upto measur join averag achiev reduct rate star queri achiev averag lowest reduct solut cost improv comparison lower supplement optim step comport star queri explain fact true bushi tree bushi tree space linear gener queri class comparison cost distribut relat seri analyz shape solut cost distribut iter improv space tabl show result obtain queri tabl line averag growth rate solut cost displai tabl line percent averag growth rate queri significantli achiev averag reduct rate optim time growth rate augment averag join averag remain constant join averag augment expect complex queri growth rate vari queri star queri achiev low rate tabl averag growth rate solut cost load balanc space oper order process qualiti term number process tupl space relat space size comput section load balanc properti order high parallel space degrad advantag process qualiti compar load balanc local bushi tree situat solut load imbal gener process model sum wait period local bushi tree situat local bushi tree result process tree load join latenc delai pipelin chain minim wait period gener load imbal process tree express sum wait period local bushi tree situat wait period local bushi tree defin formal time differ materi result data page minu materi result page join differ load imbal space ascertain solut load imbal local bushi tree situat import sourc process delai major impact comparison process qualiti process delai pipelin delai redistribut skew delai disadvantag space averag load imbal solut space load imbal load imbal improv space detect gener experi gener effect drawn seri averag reduct rate optim step find solut relat smaller growth rate solut cost averag gain optim time averag queri higher averag local minima cost averag queri absolut valu experi slight averag optim execut time ascertain space averag optim time versu averag execut time singl view import li fact optim highli memori cpu consum queri optim util resourc queri server machin queri execut parallel averag memori consumpt averag mb optim resourc consumpt studi environ concurr submit queri establish optim reduct rate improv parallel perform advantag grow queri complex particip reduct rate optim step averag cost growth rate averag reduct rate reach averag growth rate averag final reduct rate averag growth rate averag advantag independ submit queri star queri fewest true bushi smaller averag reduct ratio compar averag growth rate achiev show load balanc local bushi tree situat partial poorer process qualiti term number process result smaller search space size extend exist parallel optim exploit bushi tree exist parallel optim investig space requir modif space demonstr great type transform determinist search base modifi transform base queri optim parallel queri optim implement transform rule prototyp tandem optim associ rule rule set gener gener bushi tree extend supplement constraint leav space transform rule join order express system rewrit rule part term rewrit system relat algebra rewrit rule implement join order requir specif semant condit guard rule fire join transform rule distinguish exploit gener bushi tree space order express introduc notat join input relat denot join predic introduc predic hold relat result join attribut attr attr member set attribut rule express rule condit join rule condit rule condit space construct start initi order appli rule gener exit space left hand side express swap rule order hand side rule condit rule join associ rule requir import modif rule condit fire rule gener order order express rule condit join exchang predic introduc predic hold base relat schema predic predic hold structur predic hold call result join singl join modifi rule condit express xor xor proof modifi rule condit found technic report supplement condit true order space left obviou structur rule hand deriv complic determinist search base queri optim parallel optim base determinist search dynam program ibm pe product extens search techniqu oper order simpl achiev concentr dynam program util product work iter number relat construct optim process tree base optim involv smaller number relat oper tree space relat built optim relat combin optim relat queri optim search algorithm involv base relat algorithm modifi supplement consid base relat singl join technic report detail algorithm descript modifi determinist search compar search permit constraint input significantli extend step futur work oper order problem parallel consid introduc origin class parallel execut bushi tree problem complex reduct oper order problem compar gener bushi tree conserv good qualiti order argument base theoret practic upper lower bound search space size comput compar result show introduc smaller search space queri involv relat detail protocol establish seri experi carri order demonstr effect modifi base parallel queri optim captur import result reduct rate optim time find local solut compar search solut rate averag conserv good qualiti order gener oper order distinguish averag load balanc local bushi tree situat compar join load imbal improv econom effici solut oper order problem parallel care applic methodolog exist parallel queri optim demonstr detail small great class exist commerci parallel queri optim requir order evalu carri relat adapt process perform pointer join usual commerci product point paper futur work focu interact oper parallel object relat algebra futur framework exploit oper order problem refer ullman achiev opportun centuri sigmod march paul ncr boost support april maier rapid bushi optim cartesian product acm sigmod intern confer manag page june ozsu valduriez distribut parallel page crc valduriez open issu parallel queri optim sigmod septemb jiang high perform distribut parallel architectur confer page springer april tan lu note strategi space multiwai join queri optim problem parallel system sigmod decemb parallel optim larg join queri set oper aggreg parallel environ support pipelin ieee transact knowledg data june fegara heurist optim larg queri intern expert system applic page august springer verlag lnc dd mt ozsu queri optim execut plan gener system ieee transact knowledg data april lu tan join process system journal parallel distribut parallel intern confer larg page york citi august valduriez benchmark parallel queri optim ieee parallel distribut system ioannidi resourc schedul parallel queri acm sigmod intern confer manag page june dj dewitt implement extens queri optim larg februari issu ps yc young segment tree execut pipelin hash join intern confer larg page august schneider dj dewitt tradeoff process complex join queri hash machin intern confer larg page august parallel queri process tree larg march schedul map parallel execut extend sql queri acm cikm page novemb cheng ps yu schedul processor alloc parallel execut queri intern confer data page februari mehta dj dewitt manag parallel parallel intern confer larg page septemb dynam multi resourc load balanc parallel system intern confer larg page septemb aper parallel evolut queri acm sigmod intern confer manag page san ck gp wg wilson parallel edit ibm system editor queri process parallel relat chapter parallel queri ieee comput societi la tk parallel process capabl adapt server data engin ka hc young data skew factor multiwai join queri optim parallel execut larg march wei hong exploit parallel acm sigmod intern confer manag page june invit project parallel queri issu lesson inform model parallel relat queri process queri optim simul parallel process march optim complex support queri parallel execut intern confer page la juli press graef queri evalu techniqu larg acm comput june ye ioannidi cha kang random algorithm optim larg join queri acm sigmod intern confer manag page atlant transact process perform council tpc benchmark standard specif ca ml kersten complex join intern confer larg page septemb pedro queri optim tandem sql product intern confer larg page septemb jark koch queri optim system acm comput june extend exist parallel relat queri optim cope bushi tree technic report tr institut inform technolog februari hasan parallel case studi acm sigmod decemb
IR/21 5 speech recognit base audio index system web van david anna beth pedro michael swain cambridg research compaq comput corpor cambridg ma usa abstract develop audio search engin incorpor speech recognit technolog index spoken document world wide web transcript site index talk radio show cover wide rang topic speak style select public web site multimedia archiv web site similar spirit normal web search actual multimedia content audio show suffer acoust qualiti due bandwidth poor acoust condit show typic sampl khz kbp rate result appropri train acoust model show remark resili high factor combin averag rate standard broadcast benchmark show transcript achiev good retriev perform typic user queri archiv larg hour content grow rate hour total million word grow rapidli measur perform term match return user introduct amount audio video content internet dramat past year index engin limit text imag index multimedia video exclud classic retriev system transcript document simpl mean index content carefulli archiv show nation public radio site archiv radio show web simpl list link long audio hour length searchabl index abil plai segment interest audio file show make archiv access listen interest topic straightforward approach solv problem consist gener transcript automat larg vocabulari speech recognit system speech recognit technolog inher audio qualiti degrad due poor record condit compress scheme show achiev accuraci satisfactori index audio web acoust languag model properli train studi similar goal johnson differ project wai fetch audio document web build index data serv link origin similar tradit search engin system design scale demand document retriev shown remark resili word error rate recent studi show word error rate reduc recal word anna harvard student work perform complet crl error rate reduc explan number recogn miss word recogn time audio document word miss permit retriev document effect retriev affect number factor complex length size inform retriev techniqu web searcher rare past page result search concern top match content index popular talk technic show show unlik tv show close caption close caption textual transcript audio track tv similar subtitl movi show feder commun commiss requir broadcast program close caption order access peopl disabl close caption easili index transcript time align displai index show extrem popular dr laura station report weekli audienc million art coast report weekli audienc million peopl art show hour dr laura show hour long show exist case titl show long show cover varieti subject index show exist archiv link content archiv paper describ architectur system present perform analysi final conclud suggest improv direct futur research system overview public search system similar altavista index audio public web site index updat daili show archiv web site system consist speech librarian index shown figur describ modul paragraph transcod transcod fetch decod video audio file internet extract download media document local repositori convert audio common uncompress file format microsoft wav sampl inform file download sampl stori possibl short descript inform librarian identifi track document process displai result queri user current version transcod handl varieti format document download encod transcod run parallel farm compaq dual mhz pentium ii mb window nt machin handl stream lead maximum throughput hour audio dai internet internet figur architectur system speech decod system larg vocabulari continu speech recognit packag hidden markov model technolog develop compaq cambridg research laboratori produc textual annot download audio file annot stream consist start time end time word word audio file segment speech recognit perform parallel portion document farm workstat ti queu system recogn portion document speech decod achiev throughput portion result assembl creat fulli annot document yield error rate singl pass search arpa evalu corpora averag comput load time real time compaq alpha processor run mhz product system farm compaq dual pentium mhz mb run linux transcript replac speech recognit modul align modul role provid time mark word input text develop method align transcript long audio segment method robust inaccur music noisi speech measur word align librarian compress audio stream user queri link audio document transcod audio metadata transcript web server librarian index speech decod librarian manag workflow task perform index document store inform document regist process workflow request librarian work includ task speech align insert index librarian built oracl relat run compaq gb run unix central model lead robust distribut architectur scale demand index figur ui role index index word retriev time word sentenc occur index modul catalog document base transcript produc speech decod modifi version altavista queri engin origin version index return document queri modifi version return multipl hit hit locat document match queri document arbitrarili system random access document document segment fix length clip order sort document term frequenc document frequenc metric match term multipli factor addit transcript index librarian index base system user interfac web server return page document sort relev figur displai section transcript queri highlight transcript typic produc speech decod error text provid audio align text displai link origin document audio clip displai transcript provid clip interest displai timelin click show figur page show current select clip window enlarg minut clip select directli timelin list clip sort relev menu figur clip document perform analysi ultim interest qualiti inform examin perform speech recognit system speech recognit perform speech recognit system test randomli select segment popular radio coast coast art dr laura ed rick fool radio show segment select show word error rate analysi major audio stream encod kbp audio stream encod higher rate audio store wav file sampl khz acoust condit vari show telephon peopl talk music background select segment transcrib transcript estim word error rate wer insert total number word break test segment smaller utter easili handl recogn languag model train darpa broadcast text corpora vocabulari word correspond million bigram million trigram languag model built set acoust origin train set audio transform transform simul qualiti audio download internet set acoust model train hour broadcast corpu provid ldc origin khz sampl rate record studio acoust qualiti model test data khz set model train train corpu encod kbp decod sampl rate khz oper reduc acoust mismatch train corpora test corpora show segment segment segment segment art bell dr laura ed rick emerson fool figur speech recognit gaussian mixtur compon hmm state test set observ improv averag word error rate set acoust model khz real audio model result system gaussian mixtur compon hmm state figur show full result khz real audio system speech recogn adjust trade process time accuraci limit rang time longer real time pentium mhz processor linux give good time tradeoff product system domin paramet recognit search likelihood beam reduc number calcul requir figur show perform recognit system factor adjust product mode gaussian mixtur compon state beam figur recogn run time real time speech recogn parallel run archiv assum averag time process approxim hour audio dai farm processor number gaussian beam error rate averag time real time figur speech recognit wer speed function beam number gaussian mixtur compon hmm state real audio inform retriev perform retriev perform evalu public site static content independ tester evalu set queri select list frequent submit queri show index hour long topic subdivid show rank return show divid show chunk equal size rank show retriev clip link back part audio show origin broadcast site advantag rank clip show rank complet show user ideal relev part longer document make process search relev inform easier due sequenti natur audio imposs skim longer document search relev textual search solut user directli relev part retriev audio show evalu retriev perform index made collect show roughli hour audio download web measur top retriev show queri select top queri submit public site decemb st word select cover larg varieti vari length word vari type word acronym proper noun queri noun noun phrase maximum length word queri word evalu vocabulari speech recognit engin top document judg relev select base assumpt typic user tend coupl page retriev result order judg relev retriev document consid relev concept queri present retriev document document relev queri refer alien outer relev concept provid judg queri document relev queri mention millennium independ human judg instruct notion relev queri set queri judg abil transcript retriev document listen respect part audio show judg discuss relev document evalu retriev standard averag metric nr number relev document tr total number document retriev averag top document previou experi smaller word chosen transcript show gave similar result averag retriev chunk top retriev show note current size queri return document retriev perform system expect accuraci speech decod reason queri word repeat time show recogn keyword tend longer stop word speech recognit search constrain perform word retriev error due main reason insert substitut recognit error queri word erron transcript kind error repres roughli half case document main reason document retriev queri word commerci middl program briefli mention queri mention queri subject countri subject mention airlin commerci note commerci consid relev dealt subject matter commerci wireless servic provid consid relev queri referr inher ambigu queri word queri return document talk mean approach problem introduc notion subject good search engin googl referr mention queri talk show return guest ibm fact mention discuss relat compani ir techniqu queri introduc bia rank scheme order overcom problem multipl word queri word distribut retriev clip document queri option assum typic user advanc reli default deal problem enforc proxim bia rank system bia part rank work determin import weight attempt improv queri stem porter stemmer frake assum word recogn stem improv small worth overhead stem queri note case report test unsuccess queri due obviou recognit failur queri word dictionari time evalu perform test set evalu interest futur work note test ran real data audio time bigger audio set audio condit content higher qualiti audio make experi uniqu futur work audio index retriev system web incorpor speech recognit technolog oper transcript current version system capabl index hour audio configur easili scale demand uniqu opportun test spoken data retriev system larg scale experi show accept retriev accuraci high recognit error rate suggest index audio document web feasibl current level recognit retriev technolog room improv speech recognit accuraci provid special audio pronunci languag model improv ir investig relev rank altern wai index output speech queri document plan improv user interfac random access multimedia document interest question effici current design plan port speech recognit engin french spanish acknowledg project benefit insight work peopl acknowledg ron angel chang system design engin work paul chri blair matthew sea australia acknowledg catherin warner ui design andrew big rich index audio content adam crl provid system support final test frank gene john support test evalu system refer cook renal robinson retriev broadcast document system seventh text retriev confer gaithersburg usa burrow method index inform patent darpa darpa broadcast transcript understand workshop va moreno swain van index multimedia internet visual inform inform system arnold wm frake cox porter stem algorithm softwar stanford lund spoken document retriev track overview result seventh text retriev confer nist special public googl johnson moor sparck jone woodland pc cambridg spoken document retriev system ieee intern confer signal process johnson sparck jone woodland pc gener queri techniqu spoken document retriev workshop extract inform spoken audio swain ra analysi multimedia index deliveri server technic report crl compaq cambridg research laboratori moreno van algorithm forc align long audio segment porter algorithm suffix strip program salton mcgill introduct modern inform retriev salton automat text retriev inform comput massachusett silverstein marai analysi larg altavista queri log src technic note octob singhal pereira document speech retriev acm trec wactlar hauptmann ag witbrock mj experi speech recognit arpa speech recognit usa broadcast witbrock mj hauptmann ag speech recognit inform experi retriev spoken document darpa speech recognit workshop witbrock search engin boston usa
HCI/22 4 august bristol depart comput scienc context awar acceleromet data cliff randel henk muller context awar acceleromet data cliff randel henk muller depart comput uk abstract paper describ continu work carri part bristol wearabl comput initi research process techniqu data acceleromet enabl wearabl comput determin user activ experi techniqu emploi method data deliv devic number devic singl acceleromet devic techniqu adapt gp base tourist guid wearabl comput applic includ multimedia present user inform media depend user activ locat introduct background version technic report interest wearabl comput centr determin context user develop applic make inform explor concept situat comput sensor determin user gp provid locat awar investig acceleromet provid activ awar previou research wearabl compon sensor badg emploi acceleromet detect basic activ complex project includ glove multipl hand mount technolog enabl awar combin acceleromet varieti sensor work perform collabor support research europ size power research data process techniqu provid higher level activ analysi multipl sensor architectur acceleromet evalu board design specif design understand devic compact modul interfac pc serial interfac output appli board enabl test place long period minim infrastructur interfac pc figur sensor worn pocket figur acceleromet plan wearabl consist small comput connect varieti sensor event manag steadi state main processor switch walk figur rm activ activ part sensor program main processor main processor interest situat arriv order program main processor combin requir applic program sensor send event case emb acceleromet architectur acceleromet sensor user output state applic program regist interest event user activ walk sit wake main user displai relev inform data process collect sampl low frequenc aid low power data sourc ax acceleromet sampl extract featur featur calcul work rang robust cluster algorithm neural network order infer user order experi featur cluster collect peopl perform walk stand ground truth train evalu system featur extract expect activ easi distinguish walk walk difficult studi featur extract sensor data cheapli walk figur integr activ turn extract total featur sensor rm integr valu sensor determin techniqu unnecessari carri analysi determin frequenc compon figur show scatter plot type plot rm valu observ lot overlap figur show scatter plot plot rm valu valu import stress featur discuss person cloth specif strength featur person data featur recognit user activ person walk give result person run repeat test shown result obtain person wear cloth jean neural network analysi determin natur neural network input singl layer neuron output activ interest backpropag adjust valu network transfer function output input medial provid simpl arrang incorpor transfer linux base initi train network ground result person specif train initi result shown infer user activ high accuraci verifi observ acceleromet pic neural network main processor event bu figur final sensor design person small land land difficult real activ label ground truth tempor filter error make system actual accuraci detect peopl activ tempor filter final implement order implement sensor connect acceleromet small neural network chip pic trigger measur calcul pic send event event bu main processor activ chang sensor sensor program main processor order sensor train main processor told user perform main processor order sensor monitor user inform activ applic wearabl develop tourist guid applic incorpor gp hand held displai audio interfac web page audio note render configur depend locat drawback design render media inform distract audio commentari plai busi road potenti singl control media render ensur present inform user activ consist event render inform user user move event trigger chang locat gener simpl set rule formul form wearabl comput design applic oper user activ event signifi interest locat web page commentari trigger user walk commentari plai alert user place web page displai user stop walk applic suspend user run arrang improv user interfac reduc irrit factor inappropri render inform potenti develop complex set rule implement addit sensor microphon determin user speak spoken result demonstr singl acceleromet distinguish activ similar activ experi stuck calcul rm integr measur cluster neural infer user activ initi applic ad activ sensor tourist guid order output mechan quiet user enabl event audio user graphic user stand sit incorpor walk guid user give vital clue user small give feedback wrong shown context sensor determin user activ provid valuabl sourc data potenti improv behaviour wearabl comput refer randel muller context awar acceleromet data situat comput intern symposium wearabl page octob randel muller shop wearabl comput consum intern symposium handheld ubiquit septemb hw beigl wearabl compon intern symposium wearabl page octob aj pd wearabl sensor badg sensor jacket context awar intern symposium wearabl page octob jk glove intern symposium wearabl page octob tea consortium technolog enabl awar muller randel sensor architectur low power wearabl workshop softwar engin wearabl june digit processor neural network data sheet decemb
ML/23 6 algorithm vijai john tsitsikli februari abstract analyz class algorithm algorithm critic tempor learn linearli approxim actor updat approxim gradient direct base inform provid critic show featur critic ideal span subspac prescrib choic actor studi algorithm markov process gener state action space state prove result converg introduct problem commun oper formul dynam program problem formul fact dimens state space larg problem tractabl underli dynam seldom identifi reinforc learn program method overcom combin learn compact polici function vast major method fall method work famili polici gradient respect actor directli estim paramet updat direct improv drawback method gradient estim larg varianc polici gradient estim independ past estim accumul consolid older inform method reli function approxim aim learn approxim solut bellman prescrib polici method indirect optim directli polici space method type succe construct approxim lack reliabl term result polici method aim combin strong point method critic approxim architectur simul learn updat actor polici paramet direct perform improv long desir converg contrast method converg limit set hold deliv faster converg varianc compar method theoret understand research partial support nsf contract afosr contract preliminari version paper present nip confer laboratori inform massachusett institut cambridg ma usa method limit case lookup tabl polici function algorithm critic linearli approxim function provid converg proof algorithm base import number paramet actor updat small number critic attempt comput approxim exact object show critic ideal comput function subspac span set complet determin actor kei insight deriv simultan independ work includ discuss algorithm outlin paper section state formula gradient averag cost markov process state action space provid interpret formula section deriv algorithm section markov process gradient averag cost greater gener describ algorithm gener set section provid analysi asymptot behavior critic appendix gener result track abil linear stochast iter section markov process famili random stationari polici markov process state space action space cost function xy denot probabl state current state current action random stationari polici map assign state probabl distribut action space set random stationari polici term vector pair denot probabl action state polici distinguish paramet refer paramet vector note sequenc state fx sequenc pair fx markov process form markov chain state space make assumpt famili polici assumpt map bound deriv function ln bound bound deriv function bound deriv markov chain fx fx irreduc stationari probabl stand gradient respect vector posit integ state xx denot transit matrix markov chain fx control polici notat xx denot entri matrix averag cost function interest minim natur start polici improv gradient descent reli formula present shortli cost solut poisson xy view state expect futur excess cost top averag cost incur start state plai role similar plai familiar function total discount cost markov problem xy recal state version result establish theorem quantiti formula interpret expect excess cost incur renew period markov chain estim mean lead algorithm provid altern interpret formula theorem arriv set algorithm product function view vector hq notat function rewrit formula hq stand ith compon denot norm induc product denot span vector ng set function form scalar note gradient depend vector possibl high space depend product vector function learn project low subspac project oper arg min kq qk hq project comput algorithm view algorithm stochast gradient algorithm paramet space actor actor paramet vector job critic comput approxim project actor updat polici approxim gradient direct analysi show tempor learn algorithm comput project exact function subspac span featur vector implement critic td algorithm type critic base batch solut squar long aim comput note minor common usag td project function easili achiev replac markov chain fx markov chain fx assum control polici featur vector control polici featur chang actor updat paramet suggest result pose long actor paramet updat slower time scale readi describ critic updat concern critic td algorithm linearli approxim architectur form denot paramet vector critic featur critic depend actor paramet vector chosen assumpt assumpt set featur vector ug bound exist span vector denot note formula hold project long straightforward choic number critic paramet equal number actor paramet possibl properli critic featur ad turn number valu featur vector close linearli depend valu oper neg perform algorithm avoid richer set featur algorithm critic comput approxim exact project addit featur result reduct approxim error avoid featur critic assumpt assumpt exist jjr jj paramet vector critic store auxiliari scalar estim averag repres sutton elig trace actor critic updat place simul singl sampl path control markov chain paramet paramet vector time pair time obtain action appli action gener actor paramet vector critic carri updat similar averag cost method posit paramet variant critic wai updat critic state assumpt actor actor updat paramet vector scalar control actor account current estim critic note denot simul process algorithm paper hat denot simul process updat paramet denot process random stationari polici understand actor recal formula project subspac current good estim steadi state expect equal natur place critic current rk import critic estim accur order scheme converg prove section critic estim asymptot accur assumpt assumpt satisfi function assum satisfi inequ posit constant jrj jrj prove theorem converg actor greater gener theorem algorithm lim inf jr exist close algorithm lim inf jr present algorithm variat problem start initi state run process random termin time time process reiniti object minim expect cost termin averag cost estim unnecessari remov critic updat formula critic paramet reiniti time obtain method close relat william reinforc algorithm method involv function observ episod critic paramet episod observ past episod current critic paramet critic advantag long slowli observ recent episod carri inform current polici discuss algorithm gener space close section exampl famili provid mdp gener state action space verifi assumpt case dynam program guess base engin prove rigor solut bellman equat structur solut close approxim quadrat start famili function fq requir structur properti famili true hope perform greedi polici suggest close optim knowledg structur solut bellman equat context algorithm approxim set greedi polici suggest famili fq set note approxim greedi polici depend posit paramet temperatur polici determinist approach greedi polici suggest algorithm optim famili concret famili class threshold polici multipl multipl resourc system state space subset set integ compon state vector repres number custom system type resourc ip compon ij denot amount resourc type resourc constrain system state space fx ax vector denot resourc problem decid admit reject arriv custom note model problem state consist vector type custom request servic natur class control polici threshold polici matrix threshold vector custom type arriv resourc bx calcul current state compon bx compar compon custom admit lesser class polici approxim class denot admit reject threshold tanh temperatur paramet algorithm gener state control space algorithm markov process gener state action space algorithm case state space repeat section restat assumpt gener notat theori technic term markov abbrevi phrase probabl denot norm real euclidean space norm hilbert space jj probabl measur function denot expect respect preliminari state space control space assum polish space countabl gener note practic space countabl state space polish common intuit probabl hold space describ evolut control markov chain gener state control describ probabl distribut state current state control function probabl measur map measur function call transit kernel describ random stationari describ current state probabl distribut gener control measur map probabl measur call map random stationari polici note cmc fx control markov chain underli probabl space construct canon sampl space outcom sequenc pair uniqu probabl measur satisfi ajx denot expect wrt countabl state control famili repres famili probabl mass function cmc gener state repres famili famili probabl densiti function measur control space famili posit measur function probabl densiti function respect famili densiti view famili denot probabl law markov chain fx polici start state denot expect probabl measur denot law markov chain fx start state distribut averag cost polici assumpt famili assumpt process fx control irreduc aperiod notion irreduc discret state space process gener state usual notion irreduc applic markov chain irreduc rel notion formal measur markov chain fx markov chain fx irreduc set posit reachabl posit probabl start state note discret state assum count usual notion irreduc countabl state space markov chain show irreduc essenti independ measur rel fx measur exist maxim irreduc measur markov chain fx absolut continu respect markov chain fx irreduc aperiod polici proposit exist set state posit integ constant probabl measur paper assum condit hold uniformli assumpt geometr exist posit integ set constant probabl measur exist function constant bi indic function set call function satisfi inequ stochast lyapunov function uniform geometr ergod assumpt restrict assumpt make note assumpt impli part assumpt fx impli hit time state sequenc valu actor time vari markov chain obtain polici time function assumpt close matter simpl algebra calcul geometr ergod result shown assumpt markov chain fx fx steadi state distribut steadi state reach geometr rate exist real valu measur function jf je cv introduc assumpt map deriv bound depend pair assum bound form constant function assumpt ensur steadi state distribut markov chain polici polici paramet valid assumpt automat consequ assumpt assumpt map continu exist lim assumpt prove gradient formula similar ln consequ assumpt proof outlin proof imit show measur jf map bound bound deriv properti averag cost function assum stage cost function assumpt exist jj jj denot product denot function assign pair assumpt impli averag cost function written oper solut poisson equat paramet proposit easili show solut poisson equat paramet exist uniqu constant collinear obviou famili solut poisson equat converg seri consequ solut poisson equat analysi deriv algorithm theorem hold solut poisson equat paramet theorem assumpt proof fix assum famili function solut poisson equat paramet assum map state action pair famili function bound expect respect side equat respect obtain interchang integr uniform integr product side equat fact fi fi obtain hq equal fact necessarili easili fact complet show exist famili function shown imit proof outlin assumpt construct slightli enlarg probabl time sampl markov chain fx kn control polici split techniqu time obtain averag cost function solut poisson equat ju posit impli measur equat rewritten ju dp dp jf condit expect deriv respect assumpt impli map famili function integr impli averag cost function solut poisson equat respect interchang present algorithm gener state control space illustr assumpt context inventori control problem facil amount stock begin neg stock repres demand denot random demand period problem decid amount stock order begin period base current stock previou demand repres amount stock order begin cost incur assum pu price materi cost incur unit hold cost unit stock inventori evolut stock assum demand nonneg iid optim polici form depend distribut good approxim polici form famili random polici chosen random densiti constant pick base prior knowledg upper bound paramet optim polici famili densiti function famili sum measur measur densiti function tanh dynam stock control polici fs iid densiti independ demand stock easi markov chain fx measur prove markov chain aperiod show hold set probabl distribut rest observ integr strictli posit prove lyapunov condit assum exponenti tail assum exist argu intuit function good candid lyapunov function note lyapunov inequ lyapunov function common factor set set larger inventori start stock larger stock order high probabl stock lyapunov function factor inventori start larg demand stock order satisfi demand lyapunov function made js note term bound uniformli term bound neg term bound posit lyapunov function factor factor larg rest assumpt easi verifi jxj critic featur vector assum bound assumpt seldom gener state space reason bound growth featur assumpt assumpt exist exist exist jjr jj assumpt relat featur critic assumpt subspac span featur critic subspac span function critic strengthen assumpt assumpt set consist singl state note requir singl state hit posit probabl strong practic situat involv queue system system made regen split techniqu assumpt expect featur restrict featur vector featur vector satisfi assumpt put assumpt actor assum vector assumpt exist map jr control time gener random polici paramet fact state obtain simul cmc transit kernel express formal sj converg critic analyz converg critic algorithm held constant follow result critic paramet converg show converg establish cast updat critic linear stochast approxim driven markov form equat appendix show critic updat theorem appendix desir result follow start notat time determinist constant clear gener understand role scale factor steadi state expect matrix requir matrix posit linear equat uniqu solut posit block diagon matric diagon shown posit role scale factor reduc term make matrix posit chosen depend paramet depend state proof lemma valu updat critic written appli theorem updat prove assumpt verifi assumpt case separ common lemma prove rest present subsect loss assum lemma proof assumpt note xk result consequ equat assumpt assumpt moment bound uniformli holder easi verifi assumpt identifi assumpt updat term actor iter assumpt assumpt stepsiz concentr remain assumpt section critic process term process fx section polici gz indic function note process fz depend paramet process insid expect probabl measur assum paramet process paramet probabl expect easi markov chain set updat assumpt stop time ju fact assumpt uniform ergod assumpt hq ht show steadi state averag actor paramet prove bound lemma lemma exist jq jt proof prove result jensen inequ assumpt eq theorem jq je ju ju integr side requir result proof part similar lemma bound proof assumpt lemma jj jj jj jj jj bound product bound lemma hq proof equal assumpt equat lemma suggest regen previou algebra verifi satisfi assumpt prove function satisfi assumpt result lemma proof denot vector step size sequenc form time vari markov chain denot condit law process yn sequenc stop time process yn xn due uniform geometr ergod bound easi prove show act lyapunov function algorithm te te te algebra manipul bound verifi bound constant rest result easi verifi assumpt verifi assumpt note express function jf holder inequ previou result assumpt proof theorem likelihood ratio method verifi assumpt lemma assumpt lemma exist proof assumpt jjr jj jrj bound lemma critic analyz critic process easi equat hold critic mean assumpt hp hp assumpt written hp easi inequ jj jj proof lemma bound assumpt lemma exist je ck je ck proof prove part proof part similar je hp inequ assumpt previou clear easi check satisfi assumpt assumpt tediou outlin trick write show map continu constant polynomi factor domin polynomi sum continu verifi assumpt counterpart lemma lemma proof inequ jensen inequ rest fact verifi assumpt lemma lemma exist proof recal vector due eq constant jjp jj jr jjp jj hp jjr jj hp jjr jj jjr jj jjr jj jrj jjr jj jj jrj jrj rest similar proof lemma theorem conclud theorem td lim converg actor actor paramet written bound condit easi taylor seri jh bound constant note quantiti depend paramet critic lemma show quantiti depend lemma critic exist constant proof solut linear equat ri easi part theorem equat assumpt prove write section show explicitli depend easi hp inequ geometr ergod hq solut linear equat ri hq impli rest observ lemma converg lim jh proof proof part similar proof lemma proof part theorem fact bound proof part similar proof lemma jh jh theorem exist close lim inf jr lim inf jr proof proof outlin sequenc random variabl min eq jh lemma impli result easili appendix linear stochast approxim driven slowli vari markov chain state prove gener theorem track abil linear stochast iter driven slowli vari markov chain stochast process fy valu polish space fp famili transit kernel iter updat vector iter fh famili valu valu measur function measur function denot measur function gener make assumpt assumpt measur set sequenc sequenc paramet nonneg process fh bound moment determinist sequenc valu bound moment jf solut poisson exist satisfi poisson equat constant exist repres function constant continu exist measur function jp function exist prove theorem assumpt lim special case theorem page albeit techniqu prove result proof combin techniqu present overview proof intuit overview proof techniqu prove converg stochast approxim broadli method od method construct converg theorem infer converg turn impli converg stochast approxim od view stochast approxim updat random perturb determinist iter prove perturb asymptot neglig impli asymptot behavior determinist iter asymptot behavior stochast approxim converg theorem prove perturb asymptot rest proof essenti determinist method proof note assumpt impli markov chain transit kernel vector matrix steadi state expect valu expect iter steadi chang slowli wrt step size expect formal intuit subsect major part proof involv proof iter present separ prove claim converg subsequ subsect techniqu essenti special gener techniqu develop fact prove converg lemma fa sequenc satisfi sequenc proof lemma matrix gr jrj small proof jrj jrj jrj small result inequ proof sequenc nonneg integ min sequenc jr note iter jr jr view perturb show neglig establish bound circumv posit constant stop time suppress notat import note arbitrarili bound assumpt integ denot minimum lemma bound perturb stop time drop superscript conveni denot jr lemma exist constant max proof ah poisson equat option sampl inequ assumpt max pk suitabl constant assumpt schwartz easi moment contribut pk pk pk inequ follow fact schwartz assumpt max max lemma long perturb remain neglig lemma prove sequenc approxim simpler iter sequenc fr jr stop time lemma easi max jr constant time ball radiu deviat complet insid ball radiu fix constant lemma drop constant notat conveni lemma lim max proof note discret easi max ct max lemma inequ impli max lemma probabl left hand side max rest seri lemma lemma jr proof assumpt lemma impli jr jr jr inequ jr jr jr previou lemma impli jr jr jr jr jr multipli side jr fact jr jr ct lemma jr rest observ jr jr max jr max jr max jr fr previou lemma proof theorem prove theorem sequenc sequenc evolv lemma converg proof part proof similar proof lemma part outlin sequenc stop time jr stop process lemma compon compon bound moment converg calcul expect remain easili absolut converg stop process converg impli converg set outcom fr impli result lemma lim proof assumpt impli jr fh bound converg rest fr recal notat previou section lemma lim max proof discret easi max ct max ct ct rest previou lemma theorem lim proof lemma assumpt lemma impli rest lemma argument similar close argument proof lemma refer approach limit theori recurr markov chain tran amer math anderson element solv learn control problem ieee transact man adapt algorithm stochast approxim bertseka dynam program optim control athena bertseka tsitsikli program athena stochast approxim time scale system control od method converg stochast approxim reinforc learn siam journal control cao chen perturb sensit analysi markov process ieee transact automat stochast approxim mont carlo optim winter simul page likelihood ratio gradient estim stochast advanc appli jordan reinforc learn algorithm partial observ markov problem advanc neural inform process volum page san morgan kaufman jordan control multipl multipl commun network ieee transact automat learn algorithm markov process siam journal control tsitsikli optim markov reward process ieee transact automat press markov chain stochast stabil split techniqu harri recurr chain sutton barto reinforc introduct mit mansour polici gradient method reinforc learn function approxim advanc neural inform process volum page tsitsikli van roi analysi learn function approxim ieee transact automat tsitsikli van roi averag cost learn william simpl statist gradient algorithm connectionist reinforc learn machin
HCI/24 4 interfac tool librari congress nation digit librari program gari catherin anita maryland human comput interact laboratori digit librari research group abstract paper describ collabor effort explor user digit develop interfac prototyp digit suggest prototyp tool digit librarian user librari congress interfac guid assess user aim maxim interact primari resourc support analyt search strategi tool aid user librarian overview preview gather result creat serv begin digit librarian toolkit design process result suggest futur work offer digit librari offer challeng emerg breed digit librarian combin principl practic inform manag rapidli evolv technolog develop creat inform product servic paper describ collabor effort explor user digit develop interfac prototyp digit suggest prototyp tool digit librarian user librari congress team design maryland work lc staff develop interfac tool lc nation digit librari program interfac design principl user maxim interact inform resourc minim attent system search strategi support principl manifest specif design minim reduc navig minim scroll flatten anchor user provid primari inform earliest point interact support rapid relev overview preview tool design user lc staff examin digit object type tool overview collect object object gather paper background digit librari lc nation digit librari describ collabor iter design interfac tool special conclud discuss research develop digit librari research develop digit librari logic extens augment physic librari electron inform societi extens amplifi exist resourc servic augment enabl kind human problem solv express high level attent fund digit librari earli mid lead plethora vision project invari driven find wai appli technolog develop desir creat technolog manag distribut inform resourc april issu commun acm descript dl project issu ieee comput descript promin notabl effort nation librari larg academ effort extend access exist collect digit network access digit librari project develop digit collect provid limit access servic marchionini dl research develop fall cultur research issu relat content includ integr multimedia data includ analog digit metadata extract storag workflow process collect preserv mainten servic research issu strongli depend user interfac includ filter refer question instruct technolog research effort relat secur dl cultur issu includ intellectu insur data organiz interfac commun practic addit research develop meta issu relat manag evalu dl impact peopl organ activ area studi librari congress long serv exemplar librari practic led institut defin librari autom lc initi ambiti nation digit librari program aim digit make million object varieti lc collect fund corpor foundat program develop digit librari american provid opportun research address technic intellectu challeng dl provid program push state art digit larg volum fragil creat high qualiti packag break ground sophist search creat innov interfac public staff user lc program contract maryland interact laboratori collabor interfac develop focu user interfac work research creat interfac inform retriev data visual applic dl number innov approach support www environ recent begun support basic interact techniqu standalon earlier environ multipl state extens html develop java design port interfac web environ import dl project aim improv user inform seek close coupl text search visual method displai result search project user directli manipul integr search dynam queri continu zoom overlai len dl multimedia research led innov interfac widget special materi video skim queri preview zoomabl map improv tool spur interact research appli interfac design metaphor widget web applic book metaphor deck card metaphor elast window shneiderman todai dl depend www increasingli advantag fruit interact research basic made appli dynam queri interact style meet project goal project incept adopt javascript java overcom limit html displai cgi interact overcom lack common metadata object divid user compon develop collect browser distinct browser solut illustr result design phase problem identif team develop phase project entail defin interfac develop design identifi basic function interfac phase activ work group team mail web site regular meet held sketch react work group team mail websit regular meet held sketch react seri public held lc focu attent kei assess conduct input lc read room teacher orient school librari media supervisor state parent worker facil seri interfac design sketch discuss base interfac design user central principl design number step assess tradit user lc collect project potenti user attract remot access plaisant detail phase result illustr search strategi pose set design challeng serv wide rang user serv wide varieti inform user distinguish primari secondari materi layer user make link item collect read room captur essenti element refer interview user find human commun user item give pointer extern resourc creat interfac access user technolog techniqu interfac visual audio queri provid clear delin larger collect physic librari congress entir internet user secondari primari materi distinguish displai sound facilit user collect limit search provid clear linkag collect meet challeng ultim iter interfac implement aim project address phase entail prototyp interfac design digit librarian tool phase interfac design phase experi phase focu project goal project team aim appli phase integr prototyp illustr solut design goal specif challeng project aim develop integr prototyp specif overview preview tool support media type user activ tool end user librarian build model interfac prototyp tool specif collect draw materi multipl lc collect includ multipl media type integr interfac prototyp gave user entri entir american memori illustr interfac corpu interfac prototyp goal reduc navig save time reduc possibl side effect hypertext navig www emerg issu todai web environ due cognit load navig conceptu space uniqu landmark relat side effect distract user follow link logic progress theme span multipl hypertext node research work wai physic abstract inform space visual techniqu view virtual realiti practic approach project design philosophi adopt reduc navig requir flatten hierarchi anchor user stabl context broad shallow menu structur shown effect narrow deep structur design attempt flatten hierarchi site bring surfac sampl item special frame overview tabl content reduc backtrack page structur offer basic search facil top hierarchi prototyp illustr benefit anchor user stabl context consist design interfac american memori level individu collect coordin similar layout organ standard toolbar left screen list function goal illustr user good collect select collect final search review result leav home page approach meant minim user distract user focu cognit effort resourc system navig design provid preview overview materi user preview overview function digit librari user learn collect explor materi attribut turn support search enabl user limit focu search american memori digit collect larg amount materi format vari level descript metadata make search difficult import preview overview support user quickli make judgment efficaci examin full version object affirm case provid rapid access object preview extract primari data repres specif collect item overview construct larg set item show attribut item aggreg inform set preview collect sampl preview photograph thumbnail overview collect show screen collect attribut overview item collect show screen possibl attribut preview result set speed evalu process save user time preview overview user learn collect applic principl illustr exampl organ layout consist cc coordin interfac main function interfac consist layout main function interfac arrang left side screen toolbar present select left bring detail html design figur compact previou iter leav space introduct sampl visibl user page interfac memori consist tab tab top reflect lc main lc home american collect case cc interfac frame critic problemat backtrack anchor frame serv user maintain cognit balanc advantag outweigh side effect frame interfac differenti color scheme red figur singl color suffici current collect home page demonstr style collect figur open screen design american memori show anim sampl collect quick search home page figur consist layout collect introduct sampl introduct page user anim sampl short textual link sampl special present written expert clickabl sampl meant provid access treasur collect forc user navig deep menu hierarchi execut queri user vagu idea hope find present sampl immedi home page experi time user user formul search progress gain subject appreci type materi expert user ignor sampl move immedi object interest pose queri search featur wai present sampl explor sampl present user control automat anim shown select sampl collect collect curat lc staff member job ideal sampl select attract repres feasibl popular period solicit sampl set group educ contest develop themat sampl base current event histor celebr interfac develop interfac american memori interfac develop collect browser appli dynam queri principl filter select collect collect develop gener collect browser design usabl unprocess collect process collect browser provid overview larg set collect set item give user amount materi attribut materi overview select collect locat set item collect similar attribut tool user learn collect topic kind materi form expect formul search queri collect browser collect browser dynam queri dynam queri extend style interact search task close coupl search specif displai result interfac figur featur visual overview collect zoomabl timelin bar collect show time visual queri collect widget menu topic tight coupl compon displai list collect short updat user interact interfac widget zoom timelin simpl cursor chang effect result immedi continu shown displai dynam queri support progress refin continu reformul visual scan identifi result collect browser requir consist metadata collect iter design uncov problem exist metadata metadata materi item level inconsist make imposs develop interfac item level collect team decid defin set consist attribut collect level support lc team member defin metadata metadata gener collect collect list menu creat automat metadata provid principl collect browser item collect consist metadata item collect specif collect homogen data case dl collect american memori reason collect select studi multimedia content develop gener techniqu appli set digit item figur overview collect collect shown timelin list user filter collect select topic collect highlight reveal attribut short descript bottom screen individu collect individu collect browser tool call difficulti user alik repres quantiti inform distribut set link document digit librarian manag huge directori tool visual directori structur data type knowledg quantiti type document user decid web site interest larg number document grow collect easi task size extent larg collect make hard understand tool end user librari staff develop organ collect automat gener hierarch tabl content site case exist link underli directori file structur link exist web directori structur newli digit index annot consist parser program gener tabl content file repres user interfac displai toc interact convent web browser figur show left tabl content varieti top portion frame legend control panel link list bar repres volum inform link user expand hierarchi expand label remov compar file click label individu line file displai frame layout user expand contract tabl content present outlin format left inspect select item frame summar legend left figur individu page shown individu line bar aggreg group file link directori repres total size includ document color repres file length size shadow bar proport number document includ number document size repres displai browser statu area user cursor bar figur toc show small comparison categori observ imposs guess home page smaller shadow small suggest page open arrow button left individu line show individu page text search capabl tabl content displai result context tabl context hierarchi work unprocess collect tool librari staff prepar review collect gener public altern access materi explor collect search inadequ lack find lack searchabl user search appropri expert user quickli jump object deep hierarchi necessarili seri explicit link page time load pilot studi conduct evalu versu plain browser web site navig task result suggest complex add displai make simpler task difficult case complex task add outweigh displai complex user found easi learn presenc site full paper detail result search serv broad rang user web novic search search widget includ quick search part anchor toolbar left search wide web user expect search entir american memori collect type word phrase interfac quick search button search search collect select page quick search appli collect enhanc search support boolean queri restrict scope queri collect object format photograph access attribut common collect search specif collect metadata applic restrict queri collect common data year rang geograph exist item user restrict scope queri photograph collect consist data type photograph item color feasibl automat detect common attribut dynam includ filter enhanc search screen enhanc search screen organ variant scope user defin attribut user enter text search defin result user set number hit set sort variant give user formul queri croft toolbar left side search tab complex box entri field multipl button click background word bring page search function displai result displai result aspect search intermediari search commerci system dialog provid varieti print displai option web user typic deal long list rank titl list multimedia digit librari approach result displai problemat object data type alik result list heterogen materi format motion letter issu granular item find address result displai option creat distinguish level provid volum materi return rudimentari interfac detail cc interfac case screen summari summari result link preview detail result list show user queri conceptu anchor context link specif preview tool ad servic oper smoothli tool web typic launch special viewer cc result screen illustr search result type object return simpl find aid lead find aid collect icon adopt data type aspect design result list show object return search transcript bibliograph link object ad servic great potenti facilit search word found tabl content result list link tabl content bibliograph record transcript relat expert manuscript richer result supplementari filter order result possibl reduc navig effort user decid jump directli greatest interest interfac reli exist underli link item studi collect autom scheme file guess type found file link relat file aspect address make visibl estim number item cover search engin lack metadata textual case larg proport alert user warn messag displai search recommend techniqu final illustr result displai context collect tabl content search result shown open tree branch lead result show result context figur illustr featur techniqu handl result interest begin import typic compon digit librari servic significantli research develop work find wai search result preview tool search yield long list tediou collect photograph search result list oper collect video hour download time megabyt disk space illustr speed larg number item special imag video page browser develop user preview item request detail tool develop collect prototyp specif collect access result summari result screen summari total number photo link imag browser load collect overview topic tabl imag browser abil search queri imag function digit librari imag queri featur order accommod user find imag imag present collect retriev addit function requir user quickli effect retriev set imag figur search result displai screen show search result summari detail list item search sound displai item surrog item record figur show tabl content result search context hierarchi site common method queri imag user enter text descript target imag system text descript match queri text descript imag output match method requir linguist index visual content index subject limit boolean free text search altern method search imag arisen order augment replac text descript imag method requir user draw simpl sketch imag sought execut algorithm gener match queri base input user sketch method provid user direct model user eventu left seri incorrect translat sketch techniqu color ibm uc berkelei dl languag combin case object set retriev preview effici imag browser appar queri imag browser method search user perform user match return queri queri algorithm elimin imag user browser case order find imag imag browser creat project displai thumbnail preview imag time top frame show thumbnail summari inform search result user control center frame view slightli larger version imag bibliograph inform full resolut imag select imag shown flag collect bottom frame thumbnail save person web page figur imag browser view result possibl entir medium size collect thumbnail shown center frame view full resolut imag select imag collect bottom frame thumbnail save person web page figur user chose view larger thumbnail version imag descript textual inform imag shown number imag screen function user prefer screen resolut page imag oper screen user request detail item record full browser good evalu set result item collect complement nice textual list note imag browser requir descript materi wai electron flip box materi librari print photograph read visual larg set thumbnail imag support user textual list titl evalu visual inform textual descript make select harder imag attribut import discrimin judg pictur thumbnail make effici screen real estat provid detail user make select compress visual preview detail view screen browser reduc navig user save time compar present interfac user back list titl individu imag gather materi find materi interest user gather materi page student pictur manuscript report point expert note teacher creat page list materi interest class bookmark larg number bookmark hard manag share easili html editor requir train gather tool creat javascript assist user full advantag invalu materi save figur lc staff quickli gener aggreg item creat hot topic page tool figur gather tool creat person collect templat gener save local immedi class work present prototyp includ gather photo extend type materi user click person button imag html page creat fly gener page consist tabl imag left gener text user html gener page save user local disk space edit rapidli user add text annot imag video browser digit motion pictur document import compon digit librari collect user collect search textual descript case search visual attribut optic shape collect result set search import provid suitabl surrog file document clip short video browser design review set video rapidli list video shown repres frame video video select user preview made select frame video research group work techniqu extract repres kei frame video algorithm develop maryland center autom research al video sequenc shot base physic structur scene identifi content camera motion altern mechan present kei frame includ imag multipl video incorpor figur video browser anim displai kei frame left kei frame motion pictur repres respect film set film collect search result user click select film preview bibliograph inform anim preview film number user studi conduct explor video kei frame control mechan studi examin kei frame slide show displai rate found kei frame rate fp potenti defin function limit object identif accuraci effect found pronounc gist extract studi examin efficaci multipl kei frame slide show run concurr result suggest potenti concurr displai poor perform displai studi underwai page browser type browser import impact usabl collect american memori browser typic interfac provid tabl content link individu requir user back index page page imag imag digit page imag imag browser manuscript journal found browser design import categori kind natur page page size studi collect suggest case book manuscript browser manual prepar manuscript book tool partial autom product browser creat basic design consist frame top frame titl collect journal manuscript link exist complementari materi screen thumbnail page left frame overview journal manuscript shown consist list page tabl content richer find aid frame actual page shown select overview tabl content tightli coupl page imag viewer updat user page continu show locat page user document browser access result list item collect collect overview cluster page index browser html frame cgi script figur page imag browser period top screen show titl number collect belong inform pertin document user select page thumbnail full bibliograph record left list page document arrow page shown main goal provid overview page give feel type text type text handwritten length size document tabl content textual visual overview provid thumbnail view reduc feel lost give orient user document tightli coupl tabl content page imag displai give user feel document page locat relat page contextu orient import case book serial structur document add understand content studi collect work al suggest autom product browser page write note document human creat onlin html document present materi highli repetit tediou process tool autom process minim human develop book chapter catalog figur rudimentari page imag browser creat automat kind limit browser access queri result unprocess collect simpl manual edit lead improv version shown figur figur automat built browser tabl content thumbnail gener automat bibliograph record creat locat provid titl short descript extract automat record note manual gener link automat discuss futur research project demonstr interfac techniqu bring primari inform resourc user quickli anchor user consist context minim support rapid relev overview preview interfac tool digit collect consist techniqu provid user good access metadata absent inconsist distinct design illustr techniqu appli highli homogen collect typic nonstandard collect found digit librari design illustr solut challeng inher serv wide rang user task consist interfac minim provid good overview preview facil aspect prototyp vertic tabl sampl item incorpor recent version lc american memori site user test complex interfac digit librari technolog develop rapidli year librari congress continu lead innov effect interfac program project aim defin trajectori interfac develop facilit design todai technolog assist librari shape futur iter serv broad commun user number research develop issu relat dl gener emerg result work principl guidelin iter design dl develop test step direct dl staff adopt design perspect includ regular user ongo usabl iter design procedur dl static entiti physic librari constantli dl grow chang user technolog dl serv user commun develop interfac vari user depend user agent deal fix encourag altern interfac suit user select specif experi sketch virtual inform desk compon phase build specif tool prototyp interfac altern import follow work develop tool struggl manag megabyt data highlight digit librarian toolkit integr tool digit librarian manag materi web site commun user content manag tool librarian acquir materi digit librari present secur content tool automat test code find inconsist widget manag version invent ad toolkit support creation interfac mainten tool transact log site map automat faq updat digit librarian weed digit collect serv user popul tool content manag categori exist standalon entiti build maintain web site file format convert jpeg link checker robot find broken automat surrog extractor frame text parser find sgml markup encrypt routin tool commun categori includ tool support user servic creat maintain user collect analyz transact build maintain commun particip digit librarian web master acquir develop capabl standalon applic unifi toolkit provid tool cover area digit librari work common interfac dl root organiz cultur influenc develop mainten dl time effort understand stakehold complex organ repres read room world author specif collect work person fulli appreci work user metadata exist websit invest lc unit meet place phase project serv bridg gap develop global set problem specif design flow dl face similar challeng particip prepar time invest relat social polit dimens dl develop prepar earli assess inevit impact dl host organ attent user eventu influenc mission librari work climat physic librari acknowledg librari congress provid partial support project david nation develop visit hcil depart tom ara browser video steve ben shneiderman acknowledg cooper team librari congress head laura campbel mike jeff beth georgia gari barbara virginia susan walter final prototyp project web site refer visual inform tight coupl dynam queri filter acm chi confer proc april hyperlink creation page imag annual confer theori practic digit librari librari zoom graphic interfac explor altern interfac physic seventh annual symposium user interfac softwar technolog del nov acm press web acm chi summari chi acm york cacm special issu digit commun april acm york web inform workspac worldwid search content confer human factor comput acm introduct ieee queri preview network inform proc forum research technolog advanc digit adl ieee cs press studi video strategi technic report maryland ieee symposium visual preview overview digit design surrog support visual inform seek technic report maryland visual term distribut inform full text inform access acm user center comput scienc literatur commun pp elast hierarch web maryland technic report compress domain video segment technic report maryland digit librari research develop encyclopedia librari inform scienc user assess librari congress nation digit librari maryland technic report visual web site hierarch tabl content confer human factor hypertext hypermedia academ press imag retriev system subject percept confer human factor comput acm page imag altern digit librari intern symposium digit librari bring treasur iter design librari congress nation digit librari program chi march acm york rich interact digit commun clarifi framework text search dlib januari html shneiderman object recognit capabl present simultan video kei frame surrog european confer research advanc technolog digit septemb digit librari geograph referenc intellig access digit informedia project
DB/25 3 comput compar semant program logic nicola daniel laboratoir de recherch en de pari bat orsai abstract di erent semant assign logic program correspond di erent assumpt made atom logic valu infer rule found semant correspond assumpt atom semant correspond assumpt atom unknown unifi extend approach introduc semant logic program paramet hold assum atom logic valu infer rule work class logic program de ned fit fit de ne simpl oper comput compar combin semant obtain di erent valu paramet semant fit correspond show approach captur extend usual semant convent logic program unifi comput keyword logic logic inconsist introduct di erent semant assign logic program correspond di erent assumpt made atom logic valu infer rule found semant correspond assumpt atom world semant correspond assumpt atom unknown usual semant logic program context base stabl model semant base semant refer semant rst kind privileg neg assum refer semant kind privileg neg posit assum illustr assert made program john innoc follow pessimist assum john infer john convict follow skeptic assum innoc infer freed convict context envisag call assum true follow assum john infer john convict optimist approach counterpart pessimist approach counterpart skeptic adopt logic envisag inconsist assum true tabl summar semant stand unknown tabl semant approach pessimist optimist skeptic inconsist de ne semant program paramet logic valu repres atom valu infer rule de ne simpl oper comput compar combin semant obtain di erent valu show semant extend semant fit captur usual semant convent logic program unifi comput semant logic roughli pessimist optimist semant motiv work area knowledg contradict occur process collect knowledg di erent expert di erent agent give di erent answer queri import process answer extract maximum inform agent detect item agent give con ict answer motiv area deduct updat lead inconsist inconsist lead framework distribut logic justi ed fact natur model framework applic area mention ari show valu prefer task principl handl valu remain paper organ section recal brie de nition notat stabl model logic fit program section de ne semant fit program de ning oper xed point call xed model treatment section inspir paramet xed model correspond stabl model fit section restrict attent convent logic program show xed model captur stabl semant provid compar studi xed model valu paramet pessimist optimist semant case lead de nition semant section conclud remark suggest research proof theorem omit due lack space preliminari logic stabl model found semant gelfond lifschitz introduc notion stabl model framework classic logic close world assumpt notion extend logic partial van ross schlipf introduc semant przymusinski de ned stabl model shown przymusinski extens captur stabl model semant przymusinski conjunct logic program set form bn bn cm atom valuat map assign ground atom truth set trueg valuat extend ground conjunct ground usual de ne stabl model semant program extend transform assign valuat valuat de ned transform posit program replac neg valu comput xpoint oper de ned ground atom head rule rule occur extens classic disjunct de ned unknown true unknown unknown unknown unknown valuat stabl model stabl model coincid semant de nition approach greater import neg pessimist approach semant work kleen logic fit introduc semant program de nition stabl oper de ned valuat ground atom rule head truth bodi rule head rule head truth bodi unknown greater import lack inform unknown assign atom logic valu infer skeptic approach logic logic de ne logic call intend deal incomplet inconsist inform logic logic denot ff ig valu compar knowledg order truth order knowledg denot valu order knowledg truth statement knowledg express set classic truth valu hold statement knowledg order set order truth denot logic valu order truth statement true compar fig logic order repres doubl diagram figur shown order meet join truth order denot natur gener usual notion conjunct disjunct knowledg meet join denot call consensu repres maxim inform add knowledg repres repres distribut sati es interlac law oper monoton respect fan jn fb jn natur notion negat truth order denot similar notion knowledg call conf denot oper restrict valu classic add oper valu kleen strong logic fit program convent logic program set ff intend space truth queri produc partial model deal inconsist ad natur work logic fit extend notion logic program logic formula express built liter element form xn xn atom formula xn formula xn bodi assum free variabl bodi xn program nite set predic letter head appar restrict loss denot set rule refer extend logic program fit program fit de ned famili convent logic program convent logic program underli space involv program written customari comma denot conjunct semant fit program fit set valuat set ground instanc rule result section inspir deal case consequ oper extend order space valuat de nition ground atom ground atom order similarli oper nite sati es nite interlac condit negat con ation action valuat extend atom formula similarli predic prede ned predic de ned valuat oper assign ground atom truth independ truth assign negat de nition de ned ground atom oper extend formula induct idea repres inform inform fit de ned logic program context gener articl restrict attent minim oper prefer term indic fact oper perform valuat de ne oper inspir infer inform oper depend paramet de nition valuat de ned ground atom head rule occur valuat interlac condit sati ed prove proposit proposit fit program knowledg monoton truth monoton rst argument infer proposit function xed point greatest xed point order de ne oper associ valuat xed point depend iter xed point obtain initi valuat de ned ground atom de nition de ne limit sequenc valuat de ned successor ordin limit ordin truth neg liter comput semant posit program obtain similar manner remark xed point greatest xed point knowledg order xed point greatest xed point truth order illustr de nition program valuat assign ground atom truth atom comput rst replac neg liter comput model posit program obtain respect truth begin valuat assign ground atom truth famili xed model recal valuat model program rule de nition valuat veri es model xed point veri es model de ne famili model call xed model de nition xed valuat xed model program xed point xed model call xed model xed model xed model inconsist studi famili xed model theorem monoton monoton knowledg order complet lattic structur appli theorem theorem xed point denot ix greatest xed denot ix respect knowledg order remark comput ix call xed similar comput semant transform di erent semant fit program show queri evalu di erent context di erent valu xed semant send inform person colleagu pessimist skeptic semant person prove colleagu send inform person colleagu optimist semant person colleagu tabl summar result semant ix ix ix ix ix ix refer program denot ix ix order simplifi omit notat behavior respect truth order simpl order modi cation theorem deal lemma function complet lattic element call extrem oscil point greatest xed point oscil element oscil lie truth complet extrem oscil point order proposit extrem oscil point denot ix ix ix ix truth order extend result theorem fit program ix ix ix ix ix ix ix ix ix ix ix ix famili xed model program bound knowledg xed model ix ix greatest xed truth xed model ix ix necessarili xed model interest note rst equal theorem relat di erent de nition ix repres de nition przymusinski stabl ix ix repres de nition van gelder altern xed point work fit gener approach van gelder przymusinski full present polynomi algorithm approach comput xed semant ground fit program function symbol compar usual semant logic program compar xed model convent logic program usual compar di erent usual semant theorem state famili stabl model includ famili pessimist xed model extend stabl model logic program fit semant semant captur similarli theorem convent logic program stabl model pessimist xed model semant ix semant ix import recal posit neg inform treat separ comput ix case comput semant restrict attent convent method comput semant approach uni es comput usual compar theorem fit program ix ix ix ix skeptic semant inform pessimist optimist semant infer corollari fit program ix ix ix equal sati ed posit accept negat gener corollari suggest possibl de ning ix ix smaller pessimist optimist semant greater skeptic semant show semant context semant ix ix ix ix ix program assert true infer reach optimist pessimist semant reason true assert natur case consensu pessimist optimist unknown give semant check condit ix ix model assum call consensu semant de ned parametr semant famili fit program algorithm comput famili fit program gener includ convent logic program restrict class fit program class convent logic semant coincid convent compar convent semant set combin convent suggest possibl de ning semant consensu semant paper extend work gener logic sign annot topic futur work refer arti cial intellig dunn epstein modern semant logic logic semant logic logic ueda logic intern mit famili stabl logic stabl model semant logic kowalski bowen logic program symposium mit multivalu uniform approach reason arti cial modal logic uni cation de de programm de programm programm par extend stabl semant normal disjunct warren seventh intern confer logic mit semant coincid stabl fund van altern fixpoint logic program eighth symposium principl van unfound set semant gener logic seventh symposium principl van semant gener logic truth
ML/26 6 learn system institut fur und artifici intellig der universitat wien von dr robert trappl und dr gerhard widmer von johann wien im april da im de lernen die von und auf die art der die von und die art der und die von da system ist ein lisp der ein mit system ist es auf zu und auf es es und ander die auf da auf abstract thesi overview subfield classif area machin learn numer variant learn algorithm compar kind data knowledg kind reason learn perform strength weak learn method compar group learn method modular lisp implement number algorithm learn system easili combin preprogram learn algorithm framework simpl integr learn algorithm compon make basic system acknowledg foremost ow prof gave opportun write thesi austrian research institut artifici intellig colleagu depart medic cybernet artifici intellig vienna patient ignor paolo bernhard gerhard johann furnkranz friend endur program session phase write thesi content introduct histori relat system notat convent machin learn machin classif learn system classifi train set test set increment batch learn assess classif perform classif accuraci coverag misclassif cost class condit accuraci compar classifi compar confid interv mcnemar test wilcoxon test kappa metric inform score compar result complex comparison classif method reason case recal solut gener test critic evalu updat learn nearest neighbor similar distanc featur similar measur set sequenc case pointer featur vector similar measur miss valu modif nearest neighbor rule reject option edit rule speed nearest neighbor search featur select aha learn algorithm nearest gener exemplar comput complex ii system architectur class hierarchi manipul common class creat object object descript set index object field indic case indic field type field descript structur case field similar case similar object attribut weight object extern import export data learn algorithm creat classifi hypothesi object classif test cross valid statist statist distribut iii statist object messag ad algorithm portabl incomplet compon programm refer modul modul manual modul defin modul error modul modul modul util modul stat modul object modul modul describ modul modul print modul read modul io modul modul aha modul sim instal list symbol iv refer index chapter introduct thesi subfield machin turn subfield artifici intellig describ area machin learn introduc program system implement learn easi algorithm design easili extens addit learn algorithm thesi partit part present machin reason learn theoret point part discuss program system algorithm chapter short overview machin classif method reason introduc theoret concept section chapter discuss detail learn group machin learn method relat statist nearest neighbor discrimin induct learn extent case base reason method chapter overview architectur describ conceptu issu detail implement describ user point view explain function method system appendix document entir system programm appendix instruct instal set system appendix list describ mathemat symbol document chapter introduct histori work project contribut ai method avoid conflict trappl trappl al suggest applic learn method intern conflict furnkranz softwar meet requir readili design implement lisp complet redesign predecessor support learn manag case librari easi data easi extens modular implement common lisp object system jr data structur visibl user system clo object result clear function make system easier relat system commerci system compar remind system provid comfort graphic user interfac remind includ featur qualit adapt deriv field field calcul field gener simpl tree detail discuss system infer softwar induct found compar program function remind except qualit adapt graphic user interfac support learn similar includ function test gener calcul statist perform test perform function interfac easili expand includ addit learn algorithm featur program portabl platform support system includ clo section inform support grant austrian feder ministri art chapter introduct notat convent number notat convent make text readabl ffl refer filenam oper system command set font ffl text repres set font exampl note input lisp reader arrow prompt print lisp output present lisp code exampl file ffl pseudocod set san font print block indent close ffl lisp compon function macro present document entri short descript return explan argument document text function role argument output data structur vari slightli lisp output shown chapter introduct ffl page refer index set bold type refer document entri item refer exampl set underscor font entri slant font entri index refer explan argument function macro print chapter machin learn chapter overview machin present broad perspect field section classif section reason section machin machin learn mitchel mitchel kodratoff michalski biggest subfield artifici intellig easi reason give simpl definit cover aspect problem defin machin learn complet clear term mean intuit understand suffici situat everydai life artifici term lose applic definit literatur simon denot system adapt enabl system task task drawn popul effici michalski scott process system acquir synthet posteriori michalski make chapter machin learn minski word process lead long term problem simon definit cover phenomena call doesnt cover phenomena includ understand scott definit avoid problem complet ignor behavior aspect speak learn situat hard pinpoint knowledg machin learn research guid subfield ffl result machin learn understand phenomenon ffl studi human learn oper model ffl studi induct reason form reason relat learn ffl reduc comput program interact human exampl machin learn task ffl sequenc find hypothesi predict develop sequenc ffl set find group exampl repres concept ffl gener theori domain specif observ find oper descript subclass repres observ ffl set problem solv current set set find plan reach goal current situat ffl set train assign find hypothesi classifi unseen case optim predefin optim ffl past problem solv acquir knowledg similar problem solv effici futur chapter machin learn differenti machin learn task learn learn task involv kind teacher inform learn system provid guid learn process knowledg classif solut correct incorrect learn algorithm rearrang inform descript obtain import learn induct learn induct learn induct reason deriv hypothesi set exampl oe background knowledg form theori ad aid induct reason oe set exampl deriv hypothesi explain unseen exampl explain consist theori exampl classif classifi learn method induct reason find hypothesi exampl label class determin class label unseen exampl form learn discuss detail section task solv number wai true machin learn classif main approach solv classif task statist huge repertoir parametr method classif method ai method nearest neighbor method origin learn chapter strike parallel statist method number type neural network artifici neural field subdivid numer subfield approach epistemolog claim basic idea artifici neural network approach mcclelland simpl comput unit chapter machin learn interconnect weight link unit link form trainabl associ memori gener perform induct genet approach model member popul compet individu individu reproduc surviv fit hypothesi explain gener mutat encod goldberg symbol symbol method encompass rang ai product symbol knowledg logic program symbol comput critic philosoph unabl creat intellig case method choic program engin point view classif present formal descript problem find classifi intent formal make clear meant term subsequ section notat tabl import symbol found appendix denot set case call instanc chosen domain describ formal languag gd repres inform class label class individu case learn system learn find correct class label arbitrari unclassifi case note gener case relationship case class restrict case belong number class time case descript class label time real life situat differ real case case descript abstract real phenomenon lose learn system receiv subset ae train set input case learn system extract concept descript languag gh case subsequ find correct case unknown learn system extract inform case train aid addit domain knowledg learn train set neg chapter machin learn exampl inform correct class label provid basic concern learn system find concept descript call find class label case perform measur optim perform measur fraction correctli classifi case measur discuss section assum exist unknown relationship case class interest find formul relationship formul express formul descript languag element descript list element descript number descript list number belong set note descript necessarili formula describ set profit descript depend relationship complex concept number element belong concept machin learn algorithm find descript note express easili depend descript languag set descript formul depend descript languag learn system idea unseen case classifi descript base case train set rest partli assumpt regular data formul descript languag describ describ function train data free larg unlimit number descript singl train set method select descript principl select explain phenomenon fisher maximum likelihood principl principl machin learn simplest approach measur simplic complex concept descript exampl measur simplic section simpl descript exist describ train set chapter machin learn simpl descript describ train set except combin short descript except find descript cover case measur simplic combin size descript size encod except descript note descript strict limit case classif practic limit common restrict limit case vector case vector valu attribut featur valu attribut set attribut valu symbol machin learn method assum finit number discret valu valu discret arbitrari set fv featur vector call instanc space specif domain element instanc space probabl case assign class label finit set fc class label relationship case class gener set probabl function fr give probabl assign class instanc specif machin learn literatur simpler model case assign fix class label learn domain formal tupl learn situat domain train multiset ae train instanc set class assum finit number discret valu class label continu speak function approxim discuss case continu valu class assum continu valu attribut learn system classifi formal differenti learn system ae find descript set train classifi ae find class term slightli mean literatur term synonym document train set draw result featur vector assign class result assign class ident featur vector chapter machin learn unclassifi case descript gener learn system write class return featur vector classifi gener set preclassifi case notat kohavi train set test set mention set case present learn system learn phase call train set data set preclassifi case subdivid part train set part test set estim classif perform gener classif system term impli featur vector set learn system case unseen case increment batch learn learn descript set train distinguish princip strategi process batch case train set process descript creat learn system readi classifi case test set increment learn system digest case train set modifi current descript step test case present algorithm classifi descript built definit singl featur vector class occas situat perfectli consist domain situat desir relationship featur vector class function assign class featur vector error process call order assum relationship featur vector class label chapter machin learn constitut deviat relationship call problem real world dataset correct find sampl complex concept descript exist relationship languag common situat portion data hypothesi found learn system rest view except regard data impli data classif task decid classif unseen data regard data impli data fit descript learn system inform provid crucial classif unseen data assess classif perform mention situat interest find descript maxim measur classif perform case present actual classif situat situat requir classif case algorithm perform case case optim algorithm specif order estim measur perform data measur method section implement system chapter definit perform measur estim kohavi classif accuraci commonli measur perform accuraci accuraci rel frequenc correctli classifi number correctli incorrectli classifi depend case type accuraci accuraci accuraci train expect accuraci accuraci expect set case classifi chapter machin learn creat sampl method train set includ unseen gener accuraci expect accuraci unseen case classifi expect accuraci estim method yield estim vari estim error estim method list estim expect accuraci classifi gener learn system train set ar learn algorithm tend optim measur highli optimist test sampl call holdout estim data partit disjunct train set size test set size chosen size origin data set train set find classifi featur vector test set classifi deriv classif compar true class jsj part origin data estim pessimist test instanc view result bernoulli trial larg approxim interv accuraci estim standard normal larger valu simpler formula note standard deviat estim paramet binomi distribut sampl size equal chapter machin learn random origin data set subdivid time accuraci estim calcul run estim ar random subsampl run calcul averag accuraci estim run estim standard deviat calcul standard deviat ar special case random origin data set size subdivid random disjunct subset size classifi gener time hold back test remain train accuraci estim calcul averag correct classif test note calcul estim averag accuraci run number instanc subset deviat problem small sampl condit learn system stabl perturb delet instanc test set kohavi definit standard deviat approxim oe xv stratifi ensur approxim proport class valu occur origin data set special case test set case origin data set size uniformli sampl time produc train multiset case case includ form test set size process repeat time typic bootstrap estim calcul averag accuraci obtain train set test set chapter machin learn expect portion case make test set estim combin estim estim ar ab ar larg number duplic case train set problem learn algorithm ignor duplic nearest neighbor learn bootstrap method consid estim accuraci nearest neighbor learn method chen weiss present modifi approach bootstrap estim neighbor classifi detail discuss accuraci estim bootstrap found coverag classifi find classif case reason situat ffl inform present featur vector incomplet classifi deriv reliabl classif ffl classifi assign uniqu class equal plausibl featur vector ffl class plausibl featur vector classifi assign class featur vector call number correctli incorrectli classifi case number case classifi misclassif cost classif accuraci count number time classifi return correct class featur vector real life situat make differ case correctli classifi classif produc case error desir classifi chapter machin learn case belong rare class import remain class correct misclassif cost matrix give cost assign class case true class result appli classifi test set sum similar class matrix forb list number time class assign case real class matrix addit row number time class assign valu calcul accuraci calcul weight aw note comput cost gener classifi classifi data gener artifici neural net classifi compar nearest neighbor comput cost classifi data higher nn method ann method class condit accuraci class condit accuraci measur accuraci classifi condit true assign class special case accuraci condit true class assign call posit sensit po specif neg chapter machin learn measur classifi distribut misclassif evenli class valu simpl method measur compar number misclassif class class number misclassif correct priori class probabl correct prior class probabl scale element class matrix column sum deviat symmetri measur condit denomin equal distribut freedom easili defin probabl equal probabl function distribut freedom compar classifi order assess perform learn perform classifi gener compar perform classifi import point refer classifi assign mode frequent class featur vector classif accuraci classifi call default accuraci classifi perform significantli statist default accuraci perform chanc compar classifi statist sound broad rang method mention literatur method depend ffl number classifi compar chapter machin learn ffl number run perform classifi run carri data set data set ffl data sequenc partit train set test set ffl perform measur compar classifi discuss comparison classifi train ident train set test ident test set number experi conduct low sequenc reli nonparametr test comparison confid interv compar confid interv confid interv estim binomi distribut calcul mention equat method measur class condit accuraci find confid interv estim accuraci found number total trial number instanc origin data formula equat small reli converg distribut valu total number bernoulli trial number posit result small method determin confid interv exact valu ci ff ff formula standard normal distribut correct small valu kaelbl ff ff ff ff chapter machin learn mcnemar test simpl method directli compar classifi test set mention tf number case classifi correctli incorrectli ft number case classifi probabl function distribut freedom tf ft tf ft ff reject null classifi differ significantli level ff wilcoxon test test analyz influenc pair classif method paramet classif accuraci set data set siegel carri test kappa metric metric everitt light assess correct classif exce measur accuraci classifi maximum valu deviat chanc metric calcul condit assign true class valu chapter machin learn inform score kononenko bratko present perform measur base inform inform measur classifi succe posterior probabl correct classif rel inform score classifi test set entropi log log log rel frequenc correctli assign class label test set observ rel frequenc class label compar result accuraci multipl parallel run test case pair sampl differ mean ff oe oe accuraci oe oe covari accuraci ff ff student distribut freedom complex order assess perform learn analysi complex data train set complex gener concept descript simplest measur complex data set inform content entropi data concentr entropi defin inform classifi instanc correctli expect amount inform class label log chapter machin learn rissanen present minimum descript length principl select concept descript set descript gao li minim sum length length encod data import aspect comput complex algorithm term comput time space creat classifi find classif comparison classif method depend method perform differ comparison machin learn method weiss taylor perform domain method schaffer formul gener accuraci classifi domain train set combin real life situat classifi requir handl fraction train set combin basic assumpt learn situat train set test set repres sampl case reason reason interest reason met origin high expect schank concept altern approach motiv assumpt human activ govern appli knowledg encount situat abstract schank reason model intend explain human reason serv basi comput applic term cbr wide rang approach reason machin learn thing past case solv present problem import field investig call learn approach insight cbr nearest neighbor statist pattern match util memori case classif problem approach outlin detail chapter chapter machin learn riesbeck schank present rang small applic socal memori organ packet reason cook resolut disput situat kolodn recent overview cbr tradit approach present outlin librari past situat solv present situat past situat solv successfulli cbr system arrang librari situat network interlink memori object link memori object repres failur system automat creat link gener principl knowledg situat present system compar situat analyz perspect obtain correct solut retriev match solut memori adapt solut situat solut obtain test perform analyz refin flowchart activ present figur retriev match case justif solut system kolodn differenti type cbr problem solv understand problem individu process step cbr discuss detail case recal step retriev case relev case hand case memori case case memori index attribut found relev problem solv indic retriev case memori share greatest number relev featur similar case store case case hypothet case composit ad case memori result previou reason actual techniqu case retriev depend highli hierarch interlink flat memori structur chosen system design recal relev case worst case memori match case techniqu develop effect search case memori similar case simpl techniqu speed search shallow relev attribut index case memori problem chapter machin learn input assign indic retriev adapt test explain repair repair rule assign indic store case memori index rule match rule adapt rule input indic retriev case solut failur descript causal analysi solut case predict featur figur cbr flow chart riesbeck schank chapter machin learn techniqu attribut relev problem case memori featur index match case valuabl find solut partial remedi situat index abstract actual featur valu elabor techniqu index hierarch common approach build discrimin network priorit list descriptor discrimin network provid fast path case similar case partial match featur high prioriti descriptor list discrimin network miss relev case difficulti discrimin network tree balanc case ad case memori problem featur inform strategi overcom problem find relev case redund discrimin network discrimin network process parallel miss featur requir search continu remain network union retriev case select set retriev relev case case select reason elabor comparison case assess retriev case solut gener step solut store select relev case adapt construct solut problem hand relev case record failur store warn potenti problem case gener solut adapt depend solut kind problem solv criteria princip form structur adapt exist solut part deriv solut current problem common method structur adapt base solut paramet problem paramet adapt process solut paramet problem paramet found case hand method structur adapt solut abstract avoid detail troubl back solut includ critic part adapt patch solut chapter machin learn deriv adapt modifi solut retriev relev case directli rule led solut modifi gener solut suit case test critic cbr system assess usabl solut appli problem method search case memori similar solut tend succe fail past method simul solut analyz result deviat expect result inform back repair repeat previou step find altern solut case librari evalu updat step inform result appli solut problem solut fail failur occur found case memori search case similar failur occur adapt explan failur current situat complet case final ad addit case case memori index inform updat case retriev situat knowledg store relev chapter learn learn term learn algorithm librari case classif term learn nearest neighbor learn reason denot specif subgroup learn algorithm nearest neighbor cbl algorithm built statist nn method basic concept method nonparametr discrimin analysi laid fix hodg set pair metric space metric ae defin set class label found unclassifi vector find nearest neighbor ae class nearest neighbor classif nearest neighbor rule shown number label vector approach probabl assign correct label reach cover hart perform formal studi nearest neighbor method deriv bound probabl probabl error probabl error error method lower bound equal error probabl modif origin nearest neighbor rule import gener rule fischer tightest upper bound shown error probabl number class chapter learn reject option wilcox wilson rule fuzzi rule jr edit rule chang kittler attempt reduc comput complex broder modif context cbl discuss greater detail order find nearest neighbor case case suitabl distanc metric space featur vector defin origin nearest neighbor rule assum compon obviou distanc measur type featur vector euclidean ae featur featur vector number asymptot properti nearest neighbor rule mention reli fact limit featur vector arbitrarili close neighbor actual learn number sampl train set limit higher featur larger volum fix diamet smaller probabl find sampl accuraci achiev dataset theoret limit half accuraci consequ choic metric crucial perform classifi import aspect consid scale featur scale featur influenc contribut featur total distanc featur vector rescal featur domain suitabl weight distanc metric set featur case common scale factor rescal ffl standard deviat occur valu featur chapter learn ffl extrem denot rank featur ffl robust outlier scale euclidean distanc metric calcul weight differ obtain scale ae approach limit influenc give addit weight featur influenc class probabl function distanc metric influenti dimens extrem case weight scheme set scale factor remov featur distanc metric altogeth recommend featur influenc class probabl distribut problem featur irrelev featur subset select techniqu find featur crucial classif drop techniqu discuss section similar distanc concept relat distanc metric similar featur vector wai defin similar straightforward neg distanc metric albert variat defin ident featur vector similar complet featur vector similar distanc metric ae scale return distanc similar measur ae featur vector standard euclidean distanc metric appli method defin distanc similar measur situat defin measur chapter learn defin calcul similar valu singl featur defin combin featur similar similar featur vector featur similar measur ordin scale valu compar rank distanc rank number similar nomin scale valu valu inform similar valu fit abstract hierarchi inform calcul fl denot tree defin node featur arc root node return node node common ancestor function return number arc node formula commerci tool remind approach util prior class condit probabl featur valu differ metric stanfil waltz adapt cost salzberg ae dm fi fi fi fi fi fi fi fi fi fi number time featur occur class total number time featur occur easi ae dm similar measur easili dm ae dm chapter learn describ similar measur nomin scale valu similar measur nomin scale valu base inform theori present lee eq set associ singl attribut set valu theori convert convent featur member attribut specifi occur impract number element occur set typic smaller number valu altern make clear similar set js number valu occur set method calcul similar set number js js measur ignor element reason includ similar element js js sequenc method calcul differ featur sequenc distanc kruskal distanc sequenc minim sum weight oper transform sequenc chapter learn case pointer featur pointer case featur featur similar pointer calcul appli similar measur defin featur featur vector similar measur calcul featur vector valu obtain individu featur commonli valu euclidean distanc metric ae figur show line distanc point valu figur line distanc lee present similar measur base inform theori similar featur vector weight sum chapter learn similar individu featur valu weight featur similar valu featur calcul inform theoret aspect data featur inform content rel classif jf log summat formula valu yield interpret inform attribut rel jf jf order divid total sum mutual inform featur yield li jf jf similar featur nomin scale calcul mutual jf jf jf miss valu featur observ data set reserv miss indic miss valu problemat calcul distanc similar actual unknown featur domain method calcul similar miss ffl ignor featur calcul similar ffl return similar valu miss chapter learn ffl return distanc miss involv ffl return distanc occur frequent featur vector valu miss resort method dixon describ method handl miss data domain statist method modif nearest neighbor rule simplest modif basic singl nearest find nearest neighbor combin inform decid class assign commonli assign frequent class class highest distanc weight frequenc method break ti determin reject option assign incorrect class label higher cost assign classif reason emploi procedur estim risk misclassif refrain assign class risk high method estim misclassif risk nearest neighbor assign class neighbor conserv rule requir agreement neighbor edit rule edit rule restrict number case memori classif good reason case redund inform classif concern prototyp case suffici chapter learn case noisi drop case memori improv perform classifi chang merg algorithm remov case case librari merg prototyp calcul averag origin featur vector method applic featur ration approach prototyp retain case close boundari part featur vector space region class label give earli algorithm attempt algorithm albert salzberg recent attempt direct algorithm present detail section speed nearest neighbor search find nearest neighbor case flat memori case complex manag small case larger set case retriev step learn algorithm routin retriev nearest neighbor larg number section present discrimin network approach speed retriev step close relat discrimin net method base broder method build tree node split set case subset case similar predefin similar measur algorithm requir featur involv ordin scale individu featur similar measur case similar measur monoton symmetr featur select mention irrelev featur exclud process approach find featur subset train filter method wrapper method pfleger filter method select relev featur knowledg learn algorithm wrapper method learn algorithm repeatedli featur subset subset origin train set chapter learn perform remain train set data guid search featur subset aha bankert compar variant featur select hillclimb forward sequenti select backward sequenti select variant algorithm learn system simpl increment nearest neighbor classif algorithm differ algorithm start featur search ad featur featur start featur remov featur aha report outperform outperform domain test algorithm perform featur weight adapt part learn process section aha learn algorithm albert describ seri increment learn algorithm algorithm negat euclidean distanc metric similar measur simplest save instanc complet train set classif simpl edit train similar instanc store retriev classif instanc ad algorithm sensit attempt cope noisi data overcom problem strategi monitor classif util case concept descript decid drop statist test algorithm work shown figur case accept classif record statist test confid interv binomi distribut sampl algorithm formula eq algorithm track valu ffl number correct cc ffl total number tc chapter learn initi cd case remain case cd accept neighbor similar random ts neighbor classifi correctli discard add cd case cd updat classif record xs record remov cd figur algorithm ffl number occurr class label case cd lo ffl total number case cd ti confid interv creat rel frequenc correct classif cc tc rel frequenc class lo ti formula lower bound confid interv cc tc higher upper bound confid interv lo ti case consid accept method decid case confid interv cc tc li fulli confid interv lo ti case consid noisi aha describ extens design handl data irrelev attribut gradual adapt weight featur similar case classifi conform similar class class case classifi valu current current valu initi increment time case classif increment calcul rel frequenc class case classif actual weight featur actual weight lie interv figur chapter learn featur sim similar valu sim ti ti figur weight adapt algorithm nearest gener exemplar aha algorithm attempt reduc storag requir classif time cope noisi data salzberg present altern approach add concept nearest gener exemplar basic nn procedur addit exemplar occupi point featur vector exemplar occupi rang valu dimens exemplar form hyperrectangl featur space hyperrectangl overlap nest hyperrectangl weight determin rang influenc exemplar featur weight global featur weight shape weight hyperrectangl global featur weight adjust increment learn algorithm algorithm find nearest hyperrectangl addit instanc classif hyperrectangl nearest exemplar extend includ instanc step extend hyperrectangl overlap rectangl detail pseudocod algorithm found cost salzberg present modif basic algorithm modifi distanc metric waltz section aha present slightli modifi implement origin algorithm chapter learn result practic applic wettschereck present extens salzberg batch learn increment learn claim achiev higher compress rate addit advantag paramet attempt overcom poor classif perform maintain advantag area hyperrectangl form switch area addit origin algorithm prune step remov small hyperrectangl compress factor classifi comput complex learn algorithm real life comput requir train classif stage crucial paramet briefli discuss space time requir train time requir classif algorithm present chapter denot number case present learn algorithm train number instanc store case base edit case compar algorithm low time requir high space requir train phase classif case match case averag reduc index train instanc build tree complex averag worst case averag cost retriev reduc case complex chapter system section present system describ creat method explain implement detail architectur develop lisp conflict design object ffl portabl run jr compat common lisp system ffl function compon easili locat changeabl adapt function compon ffl function reservoir learn algorithm data easili extens ffl function interfac easi architectur system easi understand ffl access function implement fast object orient program meet design object data structur learn repres clo object manipul set method small chapter system object construct singl keyword argument depend type object note clo object repres repres thing learn learn algorithm object repres specif learn algorithm combin specif set paramet singl function execut learn algorithm specif set train data figur show main compon environ function function interfac set method macro usabl graphic user interfac function perform type action type object method macro belong function interfac document chapter case case case train save make learn algorithm similar measur function interfac layer implement layer object layer hypothesi object set figur architectur system import concept repres clo object belong object layer import concept set store collect case store inform event object vector similar measur describ similar case attribut case learn algorithm describ learn algorithm preliminari version graphic user interfac made garnet packag written earlier version chapter system paramet hypothesi object inform gener train set case learn algorithm object execut function interfac document section implement layer function method intern implement action provid function interfac layer type object class object intern function method compon layer hidden user detail program document part system present appendix class hierarchi instanc subclass class subclass belong ffl class creat object class belong class class indirect subclass ffl intermedi class structur class hierarchi influenc effect method appli object class creat instanc ffl class similar intermedi fit uniqu hierarchi place add addit flavor object class subclass class group group class describ similar object class group refer topmost superclass belong singl class group convent class direct subclass typic exampl class group group learn group field similar measur group statist object tabl show complet list class group list class group compon system defin packag symbol constitut function interfac export packag packag function note current packag part symbol creat chapter system class object case case structur definit field type element ident order unimport element ident order import integ repres valu scale symbol repres valu scale arbitrari number field descript index retriev similar case index retriev case match field valu hash tabl index retriev case match field valu associ list calcul standard calcul similar class condit frequenc case similar linear combin weight featur similar weight euclidean distanc statist valu nomin scale statist statist valu ordin scale statist integ ordin scale statist valu ratio scale tabl tabl classif learn method learn featur weight select aha learn method hypothesi object simpl instanc object aha learn algorithm object inform attribut weight tabl list class group instanti class class group chapter system symbol object section detail creat consist includ packag packag creation time manipul common class manipul common class group implement provid method work class group requir option argument match keyword argument differ method special class method make featur creat object object creat common mi type creat return object class type quot class clo object class creat keyword argument suppli initi instanc method complet initi calcul field object valu store object list pair type object keyword correspond slot class argument mi macro section object type detail document requir keyword argument object reiniti reiniti object set intern valu object creat instanc object creat instanc throw garbag collector time singl object reiniti syntax reiniti object ident creat ri object differ mi paramet class chapter system class group instanc class uniqu class group give ident object belong group theoret lisp object reliabl natur object keyword argument creat mi assign object time function object return object nil object note object call argument shown object recent assign object assign object object object object lose nil nil nil object replac argument object assign form sequenc number make uniqu note system assign chang session chapter system object save reload function retriev object type return object nil found class group object retriev sort list object object group retriev function type return list pair class group list sort object descript class group object descript descript string descript shown common lisp function describ function show object class group describ object shown tabl descript set descript argument call object descript set descript object descript set set object store object primari set object hold type lisp object store set intern repres lisp arrai size arrai automat adjust number element amount initi size arrai increment mi mi creat set object initi size arrai chapter system amount size arrai chang element ad delet set element store set posit index retriev store element implicitli current posit index updat automat time set access set retriev element set element nil current element return return element requir element nil set element index store element index index current posit index index size set index index error signal set index remov element index current index set return number element set set return index bodi iter bodi bind element el turn return express return nil return variabl current posit index bound start start iter index posit macro work macro note element set modifi iter element set iter delet result remov element iter set unpredict reset reset current element set specif index iter random random destruct sequenc element set list posit index index data structur retriev case match case set chapter system subset set nr return set subset element set function retriev nr element nr element randomli creat set nil idx nil idx nil index object element set access posit index number indic provid mean access element content support type field indic access case field express calcul field match case indic retriev case match case field indic element set case object instanc object type associ list index built simpl field complex express combin field mi set express creat initi index object hash set build index field index lambda express construct index lambda express list field involv function comparison function access compon index chapter system return index entri match size index data structur function retriev object match index index return list element set index built match ii case indic case indic index set case instanc good match case group case similar measur section mi set csim creat initi case index object set build index case similar build tree index data structur compon hypothesi object gener learn algorithm tree concept descript method call hypothesi object paramet tree gener learn algorithm priorit make polit conflict bill implement case index object complet time write chapter system mi set set object tree list field object local tree includ branch node field order field branch skip maximum depth tree nil maximum depth equal number field case miss field descriptor tree includ tree note branch end maximum depth tree set case cover end branch minimum set case valu featur test featur miss field prioriti list field type field descript case object compon case defin creat field descript object field case field descript object inform featur case object import inform featur type inform store support field type object creat store field descript object mi local access case object field descript object keyword paramet document symbol indic miss initi field case object creat lisp type valu store field field type object field chapter system figur class hierarchi field type object class hierarchi field type object shown figur keyword argument creat field type object depend class object field type object describ extent semant field valu scale applic mi set sequenc field type object describ type element compound field mi list symbol field includ miss field type sequenc symbol list repres sort order assoc list descript symbol make displai valu readabl field type abstract hierarchi valu mi hierarchi list list sublist chapter system symbol denot root tree sublist describ arc symbol children mean argument field type text mi valu valu list argument lower bound valu upper bound valu structur case case similar lisp case fix number field hold arbitrari data case construct dynam approach case repres case object case object creat object mi creat case structur object pass argument structur object describ structur case approach case case store structur inform separ structur object save lot space case intern repres clo object vector field valu structur object associ field index field vector store hash tabl store structur object order creat structur field descript object desir field creat structur object inform shown short print format mi field list field descript object global list print inform chapter system format inform structur object number case structur creat mi structur return field descript object structur return list local field case structur object structur creat function access field case structur structur origin ad perform reason overhead call addit function outweigh shorter access path lisp system field valu fetch case method store case method case return field case field lisp paramet return case return list valu store case case store field case return error creat field field chapter system field similar field similar object describ method paramet calcul similar distanc valu field depend method calcul object inform field type similar actual field object similar definit frequenc valu similar field similar object field type inform analyz compil closur call valu compil closur encapsul data extract type inform speed similar calcul run time mi creat field similar object section inform similar calcul type valu chapter system field type object describ field similar calcul subsequ field field standard field similar object calcul distanc similar field distanc minu similar field type scale absolut differ valu inform field similar object miss indic similar assign miss similar assign valu miss mi class set field creat field similar object calcul similar modifi differ metric salzberg argument mean field descript object global describ field similar calcul subsequ note field type defin field descript field type provid valu field descript object global class set field type set calcul frequenc defer initi field similar object time macro ri initi note paramet set time calcul similar distanc field valu call function pass field similar object valu return similar defin field similar object note error pass function conform similar definit chapter system case similar object case similar object inform field field similar object individu field similar combin yield case similar type case similar combin individu field similar valu calcul weight normal calcul squar root sum squar field similar valu mi creat case similar object list describ associ field element list list element element field descript object local field element weight element field similar object global mi comput euclidean distanc vector field distanc mean note field similar object defin distanc neg euclidean distanc calcul show creat field similar object combin case similar csim csim chapter system attribut weight object attribut weight object weight field similar combin function case similar object attribut weight object automat creat weight case similar subclass object creat method mi list sublist field descript object global weight set dynam weight attribut weight object updat learn algorithm perform featur weight select attribut weight access replac case similar object clo accessor method attribut weight object case similar object updat case similar object occur automat note list field attribut weight object case similar object match individu weight attribut weight object chang index attribut weight number index automat adapt normal factor sum extern object clo instanc lisp system standard identifi present object standard user function extern storag retriev object clo mechan special method method creat depend global state variabl inform detail inform gener object object class inform chapter system class assign addit inform local field field descript mode statist object nomin scale produc method respect object class case object modifi basi includ arbitrari case field format arbitrari format string mi exampl object found code exampl chapter format extern design object ffl full ascii standard charact subtyp ffl gener lisp system read back lisp ffl preserv object eq save remain eq ffl store inform instanc field case object function print lisp object stream file function return list lisp object read file stream object stream pathnam file write lisp object object save oper previou call function continu addit object finish save stream open addit call set nil stream return chapter system forc close stop stream close stream automat left open read object return list return list note mechan preserv repres cyclic data structur handl set nil gener extern mean cyclic data structur cycl occur object save set lisp printer fall endless repres data specif implement set set set set nil nil nil nil nil nil nil nil nil nil nil nil import export data machin learn program standard machin learn convert format program import filter file data format ad import data set step describ layout data record attribut type chapter system filenam read file creat type structur object return structur object continu attribut type set valu file function read file read actual data filenam structur set point read dataset valu separ charact separ point expect termin point structur creat case store valu fill set case field separ follow immedi file treat empti field reserv separ return number case ad set function read case librari includ function automat creat field descript structur object case object filenam return set case librari file creat export case set easili iter set format field learn algorithm creat classifi learn algorithm implement method oper learn object learn object creat object mi macro depend subclass class group argument creation time learn algorithm field classif learn algorithm implement chapter system mi class csim adapt field descript object field class random train set order case start learn process accept random state case miss class learn method return classifi classif determin case similar object global find similar instanc number similar case determin classif function call adapt classif match origin case function accept origin match csim field classif vote scheme select classif match valu mode random classif frequenc mi class csim evalu wrapper learn method perform featur weight select learn algorithm search space featur weight find algorithm perform paramet csim mean list featur weight valu list determin weight valu search weight space list valu algorithm perform featur featur weight select repeat search process search algorithm stuck local maximum function evalu perform weight set function train set learn object paramet return perform measur higher valu perform learn object describ learn method chapter system evalu step learn object refer case similar function search space weight set default iter hill climb sequenc weight random run yield maximum weight set find vari mi class csim adapt variant learn method addit argument common learn method alpha calcul accuraci confid interv decid case consid noisi drop alpha confid interv decid case consid accept mi class csim adapt variant aha learn algorithm argument actual learn step place call method train learn object train set paramet learn method call hypothesi object concept descript gener learn algorithm hypothesi object return train method train increment keyword paramet hypothesi object extend cover addit case train set train learn set increment run learn algorithm learn set return hypothesi object learn object set train case hypothesi object creat previou run train learn object modifi hypothesi object return chapter system hypothesi object correct type creat previou run train learn content hypothesi object destroi replac inform calcul train set paramet reduc object creation overhead train step perform hypothesi object short period time hypothesi object hypothesi object directli creat user view black box inform return train subsequ classif note hypothesi object store time classif classif unclassifi case perform call classifi hypothesi object unclassifi case paramet classifi return determin addit inform confid vari learn algorithm classifi hypo case return classif case hypothesi object hypo learn function find match case directli search set case similar case set case csim return case set similar case case similar object csim similar case return set case csim return case set similar case case similar object csim case return sort list pair element similar case element match case chapter system test includ function macro simplifi test classifi function test perform classif case test set creat statist classif accuraci function updat class matrix simpl accuraci statist class matrix automat comput perform measur addit classif accuraci test hypo set run test hypothesi object hypo return statist object creat pass statist object type case statist object updat classif carri test run statist object count number unknown classif paramet statist object creat statist object gather statist addit inform return classifi case similar case nn statist collect paramet closur call classif classif return return true classif test set ct similar collect classif statist tabl ct object type defin correct valu object creat show creat learn gener hypothesi object train test gener classifi test chapter system process instanc process case miss class number nil function hypothesi object retriev classif case compar actual hypo case classifi case hypo return defin unknown classif learn object cross valid includ function macro simplifi estim perform classifi gener train perform standard test set return run bodi symbol train set step crossvalid bound symbol test set bound set input number iter express return symbol current step number bound set step train set set train set chapter system number lisp form execut bodi bind explain correct gather statist wai accuraci singl statist object type type nil tr te st test tr test nil number nil form split origin set train set test set test set return replac bodi argument return mean specifi number element draw set form test set draw element replac number element train set receiv element drawn number lisp form execut bind explain effect perform equal number element set replac macro index bodi chapter system execut bodi element index remov temporarili replac set combin nil st st nil number nil statist statist distribut method automat test statist test distribut data function return probabl observ distribut number freedom function calcul relat incomplet gamma dt function calcul incomplet gamma function seri chapter system continu fraction gamma function calcul lanczo seri approxim fl ffl coeffici formula flanneri probabl function standard normal distribut ff standard normal distribut relat rough approxim provid nearest tabl case probabl valu function statist distribut includ df calcul probabl level df freedom calcul standard normal distribut quantil calcul standard normal distribut cumul densiti function calcul standard normal distribut densiti function calcul probabl number poisson random event occur expect valu calcul public domain lisp program luke base david chapter system statist object increment updat type statist calcul statist depend type data sampl support statist ordin ratio scale data field class exist ordin scale symbol ordin scale integ data order gather empti statist object correct type creat object increment updat ad sampl object note sampl store object inform increment calcul statist measur inform explicit record sampl enabl set paramet true statist object creat show updat queri statist object data scale nil note special kind statist accept defin unknown paramet learn object mi fail classif show statist measur displai type statist object note method show addit keyword chapter system depend class object shown number number nil number number nil number sampl nil type predefin statist defin tabl mi creat tabl object column label list row label list ct increment bin tabl ct column indic left method show displai tabl test independ perform automat probabl level shown higher probabl level higher depend row column probabl indic shown shown reliabl requir test chapter system nil number sum sum nil subclass class special type class actual class valu store column assign class valu store addit row case classifi method show show detail tabl object mi class alpha confid level calcul confid interv classif accuraci default accuraci chapter system nil number sum sum default mode probabl nil show method calcul addit statist class matric section detail valu store object access function shown ffl true class condit ffl assign class condit ffl coverag case ffl correct classif percentag case correctli ffl lower upper bound confid interv correct confid level shown squar ffl lower upper bound confid interv default accuraci confid level shown squar ffl mode true class valu chapter system ffl level classif result deviat classif result obtain guess mode mcnemar ffl kappa note type tabl shown rel frequenc round decim place absolut argument number sum sum nil compar classifi data compar confid interv classif accuraci shown gener class matrix object compar classifi data mcnemar test differ proport pair sampl method inform case classifi correctli method incorrectli vice versa method report rel perform classifi train test perform parallel train step train learn algorithm gener hypothesi object perform parallel test step test calcul tabl classif result number sum sum accuraci accuraci freedom probabl level significantli nil chapter system method compar classifi calcul standard deviat multipl run multipl bootstrap compar confid interv obtain formula default accuraci test set obtain separ function learn set list return default accuraci learn method object test set calcul default accuraci print full statist ignor case class miss number number messag level report ffl statu messag inform user live displai messag control set global variabl ffl inform messag report interest data number instanc concept descript similar messag control variabl ffl warn messag report condit intend give error messag print suppress ffl continu error messag report error situat continu user enter correct error ffl error messag report error situat continu note function type messag dynam reassign chang global variabl add graphic user interfac chapter system ad algorithm ad learn algorithm requir basic understand architectur system learn algorithm repres subclass correct place insert class depend field method superclass class algorithm nearest neighbor ad subclass ad method ffl save learn ffl displai object ffl recreat learn object extern ffl complet initi learn ffl train creat hypothesi object train data method exist object type serv model implement object type learn algorithm requir class hypothesi insert class place class add ffl ffl ffl ffl object creat train method ffl classifi accept hypothesi object case descript return classif inform algorithm group addit class definit method definit sourc file ad end paramet file properli includ packag note addit implement packag class hypothesi export packag chapter system portabl main design object portabl code develop run modif lisp system conform jr draft ansi standard specif differ number avoid usag featur affect altern code ansi conform implement import design object abil run wide public domain common lisp system possibl system conform fulli draft ansi develop featur support import miss featur extend error condit code test environ inform return lisp cmu common sparcstat suno acl sparc suno ansi program gnu lucid common juli unix newer specif pass review adopt nation standard await public ansi specif affect public domain common lisp implement bruno michel run microcomput unix workstat chapter system cmu cmu lisp includ nativ clo version includ copi test support option macro method defin separ suitabl incomplet compon compon chapter fulli implement time write compon index object type nearest gener exemplar learn algorithm main compon achiev speedup classif step case retriev speed reduc number case case small gave part system higher prioriti aha learn algorithm restrict rule chapter thesi concern learn method common lisp environ implement method integr tool easi assess classif perform learn method base statist nearest neighbor classif classif unclassifi case deriv search data base case case similar case hand classif inform store case deriv unknown classif learn method extend basic approach concept similar extend applic attribut complex case case librari arrang enhanc speed match select case case librari order reduc storag requir deal background knowledg decid import featur match aid determin target classif set similar case extens borrow domain reason similar learn primari mechan reason librari case cbr method differ wai learn system deal descript intend deal feedback solut system subsequ reason design part cbr system highli depend domain task solv cbr system written common exist system small attempt creat framework implement learn algorithm learn algorithm open addit compon typic chapter cbr system basic chosen case express case collect pair structur object case unlik learn case structur case librari attribut case type includ complex type case sequenc separ case librari learn modif data rescal learn algorithm inform hidden learn algorithm object case librari retriev origin case object case librari parallel learn algorithm function save case librari inform experi select similar measur attribut type similar measur implement learn algorithm learn algorithm literatur restrict specif kind similar implement algorithm combin similar measur suit data set import compon support statist evalu classif result result automat test deviat baselin accuraci statist test method includ statist test direct comparison perform classif method data set implement common lisp test lisp system hardwar platform portabl platform lisp environ common lisp pick implement faster easier develop includ implement common lisp object system import concept case learn similar measur implement clo object object arrang class hierarchi make relationship similar object explicit oper perform call set function method design ensur correct sequenc intern method appli earlier version context project contribut ai avoid conflict analysi chapter data base conflict bill experi shown classif accuraci baselin inform provid set retriev similar case valuabl user structur similar complex learn algorithm support abstract hierarchi nomin scale easili extend attribut type ad method calcul similar compon fulli implement open potenti extend lot wai addit fit nice exist environ advantag nearest neighbor method origin case remain fulli cluster algorithm valuabl user extens origin plan make current version interfac tree learn program design fundament analysi includ repertoir learn algorithm retriev method implement program author valuabl insight clo detail implement learn algorithm remain program prove usabl programm ad addit function environ user work real world appendix programm refer section document compon system system programm point view document describ lisp object return valu inform text section gener automat sourc sourc code place suit includ type document program extract document inform sourc file base mark lisp program chang heavili produc output support addit type document inform compon list order occur sourc modul alphabet list index modul program version turn featur develop mode public domain program cmu ai modul includ consid part mention programm refer appendix programm refer sourc modul develop mode list sourc file compil path sourc modul path automat gener manual file path binari extens sourc file extens binari concaten part filenam file date write access file list pathnam util program load load modul compil load singl modul compil load modul belong modul return sourc file path modul modul return binari file path modul modul load modul modul manual appendix programm refer export recreat manual sourc file form document handler dispatch macro charact form document handler macro charact modul defin export return field exist statu messag print info messag print modul error statu str arg displai statu messag work fix stream flush output buffer info str arg displai work fix stream flush output buffer function function function function appendix programm refer function msg call function defin handl error call function defin handl continu error msg call function defin handl warn msg call function defin handl statu messag msg call function defin handl info messag modul export class object class object note part class uniqu space provid object appendix programm refer class object descript descript object class set object space instanc class type element set arrai element set initi size element tabl increment current size element tabl index element access index element retriev element exist element number element set instanc type class case object arrai field valu structur inform case case delet store complex inform easili code featur vector instanc type class structur object space instanc class appendix programm refer identifi case list field valu format string list field definit number field structur index field list field definit field instanc type class object space instanc class field index field miss field miss initi field lisp type express check assign field instanc subclass instanc type class field type object space instanc class instanc type class simpl type appendix programm refer class type object describ compound data structur type element complex type type field mean class class class minimum maximum class minimum maximum type field case type field case pointer pair car set appendix programm refer cdr case type field set valu type field order sequenc element class field type text field type field list valu associ list descript symbol nomin scale symbol boolean symbol ordin scale field symbol order lowest highest element exist hierarch taxonomi valu field tree field hierarchi list list sublist symbol denot root tree sublist describ arc element child appendix programm refer descript hierarchi class field descript nomin valu list valu descript valu integ boolean valu valu integ nomin scale valu integ ordin scale valu integ ratio scale class field real number valu assum valu ratio scale list valu initi field minimum maximum class index object space instanc class set index belong appendix programm refer index retriev case field field simpl list field complex indic tt index express field function compar valu function object test function access express build access index function object kei set test function match entri queri size index data structur lambda form calcul index express case index built singl field compil code express index retriev case similar case index retriev similar case data structur retriev case similar object index index retriev case tree data structur retriev index retriev case prioriti list field tree maximum depth tree appendix programm refer hash tabl index hashtabl index inform instanc type associ list index associ list index inform class memoiz set memoiz hash tabl memoiz origin function memoiz field similar space instanc class field similar object function return similar valu miss field similar miss regular similar miss valu object return distanc similar instanc type calcul similar type field differ metric note field appendix programm refer ct field object initi field class set sim object initi sim object initi set defer list featur valu miss list class valu miss matrix similar valu calcul similar object tabl pair case similar space instanc class optim field access list csim function calcul similar case creat function case similar object similar distanc measur instanc type standard weight measur list list element field object local field weight field field similar object number field similar weight attribut weight object vector field vector field similar object vector latest field similar normal weight linear combin detail visibl case similar appendix programm refer ject weight euclidean distanc field recalcul space instanc class instanc type data number valu miss indic observ miss number time miss occur sampl stat nomin scale valu associ list valu frequenc test detect equal valu function object test frequent list valu frequent absolut frequenc mode rel frequenc mode number valu stat nomin scale valu appendix programm refer assoc list valu frequenc number correct classif number incorrect classif number case classifi classif accuraci unknown classif classif coverag stat ordin scale valu associ list valu frequenc frequent list valu frequent absolut frequenc mode rel frequenc mode median list quantil quantil number valu stat ordin scale integ valu stat ordin scale symbol order list valu test compar symbol function test stat ratio scale valu sum valu sum squar valu sampl varianc valu appendix programm refer modul export learn method object space instanc class field descript object global list inform function determin good classif return classifi correct argument addit argument list valu return function good train set random accept random state case miss class return classifi classif instanc type instanc base learn method learn method similar function case similar object basic nn learn retriev nearest neighbor number neighbor retriev function adapt class match case field valu case origin case function expect origin match case similar field class appendix programm refer function adapt vote learn strategi search optim set featur weight list weight hill climb procedur repeat function evalu weight set csim set learn object return perform measur function evalu learn object evalu weight set function implement search strategi function set learn object function search data structur learn space instanc class instanc type tt hypothesi automat creat train learn method object creat hypothesi object set learn set retriev list valu appendix programm refer list valu arrai column total arrai row total number valu direct number valu direct arrai valu ct arrai rel proport cell arrai rel column frequenc arrai rel row frequenc list list argument weight ct sum entri ct recalcul length longest occur length longest occur probabl depend probabl reliabl weight arrai format classif valu order final tabl column column valu correspond true class row valu return classifi addit row sum case probabl level confid interv rel frequenc correct classif upper confid interv accuraci level alpha lower confid interv accuraci level alpha default accuraci upper confid interv default accuraci level alpha lower confid interv default accuraci level alpha total number case classifi rel frequenc case assign class probabl level mcnemar test deviat default accuraci mode true class kappa classifi class case concept descript appendix programm refer case instanc refer class weight instanc weight instanc aha algorithm instanc accept number correct classif instanc total number classif attribut weight object list list sublist field maximum weight tabl number attribut vector normal weight element vector field vector field object sum weight modul util export symbol return function bound nil kei list occurr symbol kei list return element list immedi return kei list appendix programm refer occur symbol kei list return list element list immedi return return uniqu symbol temporari object kei test nr insert element list list sort test kei extrem element element list max list grow max element hash return list object hashtabl hash arg gener symbol work argument usabl list return list random permut element list alter list list destruct alter sequenc tt element list return alter list symbol concaten symbol squar squar number multipli modul stat valu standard normal distribut increment step appendix programm refer valu densiti function standard normal distribut increment quantil standard normal distribut valu increment quantil standard normal distribut valu increment quantil standard normal distribut valu increment retriev nearest standard normal distribut tabl retriev nearest densiti standard normal distribut tabl retriev nearest quantil standard normal distribut tabl smaller larger higher resolut tabl df return probabl function probabl observ distribut df freedom return probabl number poisson random event occur expect number incomplet gamma function float coeffici calcul logarithm gamma function xx logarithm gamma function maximum number iter perform epsilon iter appendix programm refer calcul incomplet gamma function seri approxim calcul incomplet gamma continu fraction helper function val helper function calcul upper bound confid interv binomi distribut event occur tt confid level correspond probabl tt calcul lower bound confid interv binomi distribut event occur tt confid level correspond probabl tt modul object export mi recalcul obj forc recalcul inform applic statist object show obj stream recalcul obj send format inform stream type object slot verifi store slot object type type symbol find object type replac symbol object found signal error type verifi type type symbol type return object case appendix programm refer class creat return object class call method care instal valu make return instanc class recal class mi class abbrevi function obj initi cbr object creat valu set valu method call method specif class error situat obj reiniti exist object default reiniti call method ri object shorthand object class specif complet object initi method signal error condit specif method applic object regist object warn shown object store return nil renam entri assign object remov class return object class class class direct subclass object nil return appendix programm refer object return object type return list pair tt car cdr object belong class group type type return object signal error object initi set object element index translat symbol set object perform element index replac element index index set element index add index index posit number element index set current element pointer element pointer index translat symbol set object perform tt index element index index set index retriev element index translat symbol set object perform tt index remov element set chang order element end set remov index current element remov element set current element reset translat object perform reset reset access pointer set set return index bodi macro iter set remov ad case insid bodi remov current element element current element remov miss appendix programm refer process move end set random obj random destruct compound object random random set object random random list subset set nr make return set nr element set random retriev element randomli initi field descript handl type set field type field descript type initi structur object list field object structur return field definit object local structur field nil return object return list field object object case object structur return compil function fast access structur exist function call gener accessor case result unpredict structur redefin gener result unpredict initi case object return field case field part return appendix programm refer return list valu store case set field case field error case initi index object initi case index object index size initi index alloc index data structur store index object size size index set build index data structur set set set set index retriev list case match initi field type object compound type modul appendix programm refer stat updat statist object stat time stat recalcul forc recalcul forc recalcul forc recalcul forc recalcul forc recalcul forc calcul classif accuraci object show show valu list detail max show show show appendix programm refer modul describ export obj descr set descript obj descr stream stream applic primari method provid system stream stream modul nil prohibit defin charact macro dispatch charact modul print export number save object object save object number count object save nil function appendix programm refer object save object file stream stream open output stream file return stop nil continu previou stop equal nil close close stop stream stream object slot print slot object stream slot object stream print object stream stream begin extern open sequenc number indic object referenc referenc handl directli class object descript object follow stream write close brace stream clo fall back print object method defin stream struct case object stream structur object stream field descript object stream stream compound field type object stream symbol field type object stream symbol field type object stream integ field type object appendix programm refer stream ratio field type object stream set object stream index object stream field similar object stream stream stream stream stream stream stream stream stream stream stream print global object stream print trail stream stream field add local field stream add number element stream stream stream stream stream stream appendix programm refer modul read export object read number prepar read reset data structur inform refer number eq object object read object object return list stream read stream return special symbol stream read stream signal error brace read stream tmp read stream expect brace signal error stream read class stream make instanc stream object slot set slot object read stream slot quot object stream initi object data read stream stream read field stream read trail close brace stream struct valu field read initi case object stream read initi structur object appendix programm refer stream read initi field descript object stream stream compound field type object stream symbol field type object stream hierarchi symbol field type object stream integ field type object stream ratio field type object stream read initi set object stream read initi index object stream field similar object stream stream stream stream stream stream stream stream stream stream standard field similar stream char num read defin refer stream char num read object number refer object appendix programm refer stream char return brace read brace macro dispatch macro dispatch modul io export filenam info struct read version librari filenam return set object separ creat return charact separ defin white space special lisp charact defin function filenam structur set point read dataset valu separ charact separ point expect termin point structur creat case store valu fill set case field separ follow immedi treat empti field special separ return number case ad set string read list string read line stream return string comment strip return string file read file creat field type structur object return structur object continu attribut type set valu file appendix programm refer modul export access field instanc object inst store field instanc inst recalcul forc recal recalcul object show kei recal show object show stream recalcul recalcul test set return run bodi iter time bind train element set tt test remain element set chang sequenc element run bind symbol current run number expect set test set return replac bodi draw case set perform bodi train bound case set drawn test bound case drawn replac draw replac index bodi remov element posit index index set perform bodi chang set bodi function alter set check field set perform fold return rel frequenc correct averag run object calcul statist initi learn method object learn appendix programm refer initi learn object addit initi featur weight select learn set creat set instanc tt set train learn set increment set learn creat hypothesi object learn method object learn increment hypothesi object train set increment basic nn learn set case csim find nearest match case case similar object csim set case csim find nearest match case case similar object csim learn classifi case calcul classif case hypo hypo case test hypo test hypo test hypo test set hypo stat object type nil case statist classif correct incorrect gather statist addit inform return classifi pass closur valu return classifi correct class paramet function return stat object pass gener hypo ct test set hypo ct object nil case modifi ct return calc actual arg standard calcul compar calcul class actual return appendix programm refer set list return default accuraci list list full statist set train set increment basic nn learn featur weight select initi hypothesi object nn method return list time element return list element element main diagon set initi tabl initi classif special case check valu add addit element perform rest initi increment bin tabl interpret argument indic label recalcul forc recalcul tabl recalcul forc correct accuraci classif tabl show displai tabl stream percentag show rel frequenc absolut show special treatment add addit statist inform ct retriev tabl appendix programm refer ct retriev tabl column sum ct retriev tabl row sum train test run learn algorithm gener hypothesi object calcul tabl classif result return accuraci significantli return accuraci significantli tt nil accuraci number correct classif total number classif modul aha variant aha algorithm confid drop case confid accept case function train variant implement test variant aha algorithm function train variant implement test hypothesi class aha learn method appendix programm refer frequenc class valu hypothesi class aha learn method arrai valu arrai valu stream stream stream stream initi hypothesi object aha method special init aha type instanc object train set increment variant aha handl learn set increment aha algorithm handl learn set increment aha algorithm handl includ weight adapt csim modul sim export faster method calcul similar set avoid unnecessari calcul similar element union set appendix programm refer initi part field similar object depend class nomin valu equal boolean valu equal ordin scale symbol ordin scale symbol integ ratio scale valu arc result root make flat list node hierarchi node arc parent calcul path singl node root def result calcul path hierarchi path show print hierarchi node path indent helper function compar path return number arc follow node common parent found symbol abstract hierarchi complet initi field similar object slot bin initi initi field similar object appendix programm refer initi attribut weight object index weight posit index check object compat write object csim object initi case similar object weight linear combin field similar store arrai weight tabl latest field similar case similar object initi case similar object calcul weight euclidean distanc store arrai weight tabl latest field similar case similar object initi case similar object sim calcul similar similar object sim memoiz initi field similar object differ metric appendix instal instal fairli straightforward copi sourc file file file extens directori perform decid gener lisp imag load compil file usag prefer decid path directori compil file creat directori gener lisp directori sourc file edit file chang paramet mark comment give path compil file step chang directori sourc file start lisp environ load file note lisp type complet includ extens automat compil load creat perform step lisp system creat file delet load compil file compil file delet file load file file load automat note move compil file chang paramet appendix list symbol symbol consist mean document list roughli alphabet fx short form fx classif accuraci class set class label ith case set ith featur featur vector number featur featur number class label jcj number case test set number correctli incorrectli classifi number case train set probabl event condit probabl event appendix list symbol weight featur featur vector similar function set test case set train case featur vector ith set featur vector set valu featur ith featur ij denot ith featur jth featur vector averag delta class label return classifi gener train set distanc similar standard deviat implicitli random variabl coverag bibliographi learn independ grade concept descript sixth intern workshop machin lo pp morgan kaufmann learn algorithm darpa reason pp implement experi nest gener exemplar algorithm technic report naval research navi center appli research artifici wash dc bankert featur select classif cloud empir comparison aha paper workshop report ca aaai press bankert compar evalu sequenti featur select algorithm intern workshop artifici intellig ft pp kibler learn algorithm eleventh intern joint confer artifici intellig lo pp morgan kaufmann albert learn algorithm machin learn ansi program languag common lisp draft nation standard inform system document number bibliographi raedt lectur note artifici berlin context similar measur bergadano raedt pp strategi effici increment nearest neighbor pattern recognit find prototyp nearest neighbor classifi ieee transact comput hirsh rutger morgan kaufmann salzberg weight nearest neighbor algorithm learn symbol featur machin learn hart nearest neighbor pattern classif ieee transact inform theori neighbor figur recognit partial exposur imperfect intern confer cybernet pp ieee press nearest neighbor nn pattern classif techniqu lo ieee comput societi press kittler edit nearest neighbor rule intern confer pattern lo pp ieee comput societi press pattern recognit partli miss data ieee transact cybernet von zu einer ki neighbor rule ieee transact man cybernet qualiti neural net classifi artifici intellig medicin bibliographi method learn methodolog issu analysi compar studi intern workshop ai fort pp hodg discriminatori nonparametr consist properti technic report project report number usaf school randolph texa reprint dasarathi everitt larg sampl standard error kappa weight kappa psycholog bulletin perform measur base matric journal clinic monitor flexibl metric nearest neighbor classif li minimum descript length principl applic onlin learn charact eleventh intern joint confer artifici intellig lo ca morgan kaufmann genet algorithm optim machin learn kl und der discrimin adapt nearest neighbor classif technic stanford ca nearest neighbor classif rule reject option ieee transact system scienc cybernet statist ass perform neural network classifi john hopkin technic digest chen bootstrap techniqu error estim ieee transact pattern analysi machin intellig pfleger irrelev featur subset select problem cohen hirsh bibliographi learn scheme fuzzi rule pattern recognit letter associ reinforc function machin learn jr fuzzi neighbor algorithm ieee transact cybernet langlei machin learn scienc machin learn michalski machin artifici intellig volum iii san morgan kaufmann studi bootstrap accuraci estim model select featur subset select wrapper overfit dynam search space topolog submit manuscript reason san morgan kaufmann reconstruct comput model cognit scienc improv human make aid ai magazin learn kluwer reprint machin learn bratko evalu criterion classifi perform machin learn genet program program comput mean natur select mit press document prepar system approxim gamma function siam journal numer analysi ser vol learn method inform theoret approach bergadano raedt pp bibliographi measur agreement qualit gener altern psycholog bulletin maurer induct reason case al seki report volum understand natur chapter volum ii mitchel mitchel machin learn artifici intellig approach mitchel machin learn artifici intellig volum ii lo morgan kaufmann taylor machin neural statist classif elli horwood seri artifici intellig elli horwood societi mind simon schuster lee effici algorithm minim cross valid error cohen hirsh pp fit technolog expert system applic effici nearest neighbor classifi pattern recognit letter paradigm artifici intellig case studi common lisp san morgan kaufmann bentlei analysi nearest neighbor search project automata languag volum lectur note comput pp fischer gener neighbor rule inform control vienna reason version programm instal manual technic report austrian research institut artifici vienna bibliographi contribut ai avoid cbr method conflict technic report austrian research institut artifici vienna bill und flanneri numer recip cambridg press program machin learn san morgan kaufmann aha understand reason system cohen hirsh pp classif learn similar measur seki report fb universitat de saarbrucken al germani fachbereich kaiserslautern seki report volum schank insid reason erlbaum stochast complex model annal statist algorithm select nearest neighbor rule ieee transact inform theori mcclelland parallel distribut explor microstructur vol foundat vol psycholog biolog model mit press nearest hyperrectangl learn method machin learn kruskal time string edit macromolecul theori practic sequenc comparison bibliographi neural network implement sa softwar nineteenth annual sa user sa institut neural network statist model nineteenth annual sa user pp sa institut conserv law gener perform cohen hirsh dynam memori theori remind learn comput peopl cambridg press fur system ki construct posteriori knowledg structur nation confer artifici intellig pp nonparametr statist behavior scienc machin chapter mitchel prototyp featur select sampl random mutat hill climb algorithm cohen hirsh pp paradigm ai magazin waltz reason commun acm steel common lisp languag digit element artifici intellig common lisp comput scienc press ai ai newslett reduc intern tension artifici project trappl approach complex system plenum bibliographi role artifici intellig avoid war trappl cybernet system pp world scientif artifici intellig contribut pp artifici intellig und die von und hank und fur da pp adv featur pp san morgan kaufmann learn algorithm al seki report volum small sampl error rate estim classifi ieee transact pattern analysi machin intellig empir comparison pattern neural machin learn classif method eleventh intern joint confer artifici intellig lo pp morgan kaufmann improv retriev step reason al seki report volum hybrid algorithm bergadano raedt european confer machin pp springer wilson singl nearest neighbor rule reject option intern confer pattern lo pp ieee comput societi press asymptot properti nearest neighbor rule edit data ieee transact cybernet bibliographi horn lisp edit techniqu identifi nearest neighbor ieee transact cybernet index index accept accuraci accuraci adapt adapt algorithm alpha ansi architectur index arrai attribut background batch bernoulli bodi case case case case case case case learn chi class class condit class class class classif classif close cmu complex concept confid correct index coverag cover csim ct cyclic default deriv descript descript discrimin discrimin distanc distanc weight domain dt dynam edit el element element error euclidean euclidean evalu expect export express extern featur featur featur vector featur featur weight field field field field field field field field index field function gamma gener genet good hierarch hierarchi hypo hypothesi learn import incorrect increment increment index index induct induct inform inform index instanc kappa kappa kei learn learn learn list lucid machin definit mcnemar median memori organ mi minimum descript misclassif miss index mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mi mode nearest neighbor nearest gener nearest nearest neighbor neural normal nr object object object descript occam index percentag perform posit probabl random random rank recalcul recalcul reject repeat replac return run sampl search set index set set shallow show featur size start statist statu stop structur structur structur sum temporari test test sampl test total train train type unknown usag differ index valu varianc vote warn weight weight wilcoxon
HCI/27 4 pattern approach interact design abstract ìó øó øó øó ý øó ùô ôóöø categori subject descriptor à à gener term keyword introduct ìó óò permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee di york copyright acm jan borcher depart comput scienc darmstadt technolog germani øó øó øó óò ø øó áø ùðø øó óò øó áø øó ø óò øó ôöó áò øó øó pattern languag lingua franca øó áø øó øó øó øó áø øó ø øó øó ëù óò ìó áø ý histori pattern guag øó pattern urban architectur óò óò ø áò øó áò øó øó ý ø øó ôöó áø øó òóø øó øó øó ý øó øó øó óö óö øó óùö ô óò øó óö áø øó øó áø òóø óö øó pattern softwar engin ùô óò ø óò óûò øó óò áø øó ø øó øó òóø ñù øó óò óûò òóø çò òóø çò øó óò òóø ñó pattern hci ø ô ë óòðý øó óñ áø óò øó òóø øðý óò óö øó ø øó øó øó óò óò øó øó ô òó øðý øó øó pattern applic domain øó øó øó ôöó øó óò øó òó óö øó òóø óòðý pattern languag design ôöó formal hypertext model pattern languag øó øó áø øó ý è ê è ê è é è è é é ê è è è è è ò ö øó øó áø øó ðó øó øó óö áø øó óò ó òóø óò ðó øó áø óö øó áø òóø øó óò øó óò óö òóø ôöó òóø øó øó pattern usabl engin lifecycl áø òóø øó øó ô óùø øó ôöó ô ô òóø ôöó ôöó ý ô ø óö óò øó óò òóø øó ø øó øó øó øó óò ø øó òóø ø ý øó ø ø ø øó ø ý øó øó óö ôöó øó øó óð øó øó óûò øó ù ø óò øó óò ý øó ôöó øó øó óò òóø óòðý øó ø ø ô óò ñù ø áò ø øó óò óò øó øó ñó øó øó ôöó øó øó øó áò óö øó øó ø ëù óö øó ø øó óò øó ø ø øó ø øó øó óùø øó øó øó design tive music exhibit óò óùö øó ø ø project çùö óñ øó ø øó øó ñù óö øó óö øó øó øó ðó óò ôöó óò øó ùô ø øó ìó øó óùòø òóø øó óùö øó óùö óò øó óùö óùö øó òóø øó music design pattern óò óö çùö ôöó øó ôöó ø çùö ø øó øóô instrument seventh chord progress blue style chord chord alter transit major chord scale phrase blue note triplet rhythm blue blue tempo øó óò øó ó øó øó á î á á á á á á î î á á øó áø øó óò øó òóø óò øó óò interact design pattern óùö óò øó òó øóô øûó simpl impress layout attract visitor engag visitor deliv messag innov input dev script font interact exhibit dev hardwar input access increment reveal feedback adjust height close loop dynam descriptor tree ø ø øó áò óñ øó çò òóø óö øó øó òóø òó óö øó òóø ø ø óòðý óò óòðý óò ùô áø softwar design pattern øó óùö óò óò øó óò øó ìó øó øó øó øó óö øó ø áø áø øó feedback user control input custom modul timer creator player paramet set basic rhythm rhythm variat modul rhythm music materi modul materi flexibl input óö ôöó øóö øó óö pattern languag áò ùô ø øó óò óòðý ø àóû óùö øó áò óùö øó óò øûó øó ø øó ø pattern educ øó øó óòðý øó øó øó øó óûò ø øó óô áò øó óò óòðý òóø search óùö çùö øó óùö øó óùö øó øó óùö acknowledg øó óò øó øó ç refer ä â à ë å å á ë å ë ë ä ï ê â è ê ì ë à â ã ï ø áò óò ø â ç áò èöó óò â ç â ç â ç øó ç â ç ø øó øóö â ç ê æ ä øó â ç å è è áò ì øó â â ê ê ê â ø øó ôöó ë øó ôöó ë ê áò èöó ë à ë áò óö óò óùö ôöó óñ å â ã áò èöó â ó ë ï óò å áò â óò â óò
Agents/28 1 primit ubiquit system rpc consid harm abstract david comput cambridg rpc wide access modifi remot state procedur call semant argu effici unifi paradigm local remot access experi ubiquit devic control system shown rpc semant block invoc static type interfac overli fail provid effici unifi abstract access modifi state ubiquit system posit paper consid altern mobil awar unifi gener commun paradigm system jini introduct ubiquit environ activ space gener devic control network user interact activ space interfac speech gestur input control system interact user output user discov environ resourc export resourc carri environ applic system home offic autom research group research home area network year paper base experi commun primit system understood group rpc suitabl paradigm system feel larg portion commun research industri rpc newer implement harm easyliv recent soap base rpc home autom notabl mobil agent system sole reli agent interact distribut event architectur mainstream system corba jini implement top rpc allevi applic rpc lead ineffici implement system level posit paper motiv rpc harm ubiquit ubiquit system rich environ context awar access system resourc depend requir resourc commun channel vari network partit possibl resourc enter leav topolog backbon connect data exchang system resourc vari short discret messag continu media stream interfac resourc compil time collabor defin ubiquit interact frequent involv parti remot procedur call remot object effici unifi paradigm transfer data control remot resourc rpc achiev goal abstract syntact semant gap local remot remot resourc access simpl procedur invoc local case rpc server side softwar compil special rpc compil gener stub skeleton stub client address space compil leverag strong type method invok remot object intercept client side stub forward call server side skeleton give local invoc client applic remot object referenc interfac number version number provid contract client server rpc runtim system hide transport detail client server manag interfac implement schedul polici server side resourc wrong semant inconsist rpc abstract remot access discuss author paper conclud circumst abstract transpar rpc paper concern tradit distribut comput focu lack support rpc form applic made advent ubiquit system understand rpc analyz rpc syntax semant rpc dictat semant synchron invoc syntax static bound procedur invoc procedur act order list formal paramet return result make rpc overli inflex ineffici commun requir ubiquit system wai logic physic mobil kei aspect ubiquit system logic agent physic logic process mobil serv ubiquit system load util system fault toler replic migrat dynam extend capabl particip resourc enabl particip ubiquit system due complex overhead strong migrat limit util trend process migrat mobil agent implement weakli mobil framework weak mobil basic reduc context state instruct pointer subroutin entri point block call essenti prevent process mobil migrat execut context save arbitrari system call implement semant facilit weak remot model rpc restrict mobil instanc remot interact outstand strongli mobil pure rpc semant return deliv host process made invoc sever limit reloc load balanc fault toler commun orient system devic control ubiquit system applic follow deliv data mobil object implement effici rpc semant implement violat semant view fix broken paradigm wireless link asymmetr natur asymmetri space ber time disconnect oper semant properti messag direct chang independ featur implement rpc packag link error prone direct reliabl paramet number qo paramet chang link abstract unlik enforc semant disconnect oper support abstract unlik enforc block semant repli request deliv connect applic side wireless devic oper suspend mode save batteri wake period event interest happen rpc result orphan process primit permit decoupl messag direct emploi solut dock station temporarili hold result mobil host deliv mobil host devic control applic experi ubiquit devic control system shown remot interact system command devic notif opposit direct alarm system break rpc enforc tightli coupl bidirect interact block semant call thread suspend interact requir return continu oper mention semant provid implicit reliabl semant implement implicit acknowledg mechan fix hidden rpc runtim system irrespect applic requir mechan violat argument system design approach make explicit notifi applic leav reliabl semant effici correct oper devic control oper effici complex comput requir complex semant correct oper point limit stop rpc parallel program solut inher limit rpc semant multipl thread solut eleg add extra burden thread manag situat warrant multimedia commun addit devic control larg part devic control architectur concern manag multimedia stream ubiquit environ interact sensor state rpc tightli coupl semant discret request direct discret repli opposit deliv process request multimedia repli longer discret continu media destin request media flow set rpc semant gener solut multimedia commun abstract rpc emploi augment distribut system accommod media stream explicit bind repres media flow bind provid number stream manag function addit facil add end point process modul stream abstract enforc synchron interact easili model multimedia commun interact ubiquit environ sensor rich collabor provid servic enter notifi plai dim draw notif door sensor deliv sensor refer point rpc suit group good choic collabor sensor rich ubiquit environ interfac definit rpc model remot interact procedur invoc strongli type interfac defin formal descript languag idl interfac provid languag level map gener client server side stub client exact method signatur remot servic compil time ubiquit environ compon design implement separ point time remot interfac servic kei aspect ubiquit system agil context awar adapt servic discov bind interfac move ubiquit environ experi shown static type overli desir servic fulfil criteria remot interact ambient light carri environ light facil dim color video nearest carri video nearest screen environ facil grace degrad strongli type static interfac paradigm system recogn recent middlewar system facil dynam invoc reflect essenti chang semant messag pass push problem dynam type set primit decoupl messag space host process independ allevi synchron block semant primit type check runtim provid effici abstract ubiquit devic control function mention criterion lead paradigm asynchron event implement top messag pass ubiquit devic control handl video stream error execut event architectur model system set consum moder event produc event produc event regist interest architectur includ event channel moder serv event bu registr notif event decoupl restrict interact discret messag direct notif accommod continu stream client interfac server notifi interfac type check dynam lend natur unifi paradigm feder heterogen system ubiquit system tradit event architectur rich support requir event architectur support featur gener interfac event gener notif dynam type check event static type check remot support feder heterogen system condit notif event express extend event algebra express alarm enter main door qo support event qo sensit multimedia model continu deliveri event mobil support event notif event deliv regist interest notif object set explicitli chang practic work exist event architectur attribut list address issu corba notif architectur closer condit notif framework fulli implement research group implement evolv framework event home network devic control work extend cambridg event languag make event algebra languag ubiquit devic control environ event includ support condit call event languag event archiv queri servic prototyp system architectur work implement xml encod type inform event flexibl basic api offer cea addit support qo mobil api includ notifi subscrib client regist interest event notifi server notifi client happen event match condit condit express xml encod mobil support addit basic framework client explicitli host notifi subscrib host notifi necessarili host subscrib event dest method ad basic api chang destin notif subscrib host qo support addit qo specif paramet subscrib request qo paramet read qo agent negoti maintain reserv resourc deliv futur notif note implement rpc semant top event architectur simpl matter model event gener handler procedur applic written rpc semant accommod modif found implement rpc semant top event paradigm effici offer state flexibl shown paper rpc harm paradigm ubiquit devic control system tightli coupl semant overli inflex fail provid unifi paradigm satisfi system argu fit semant ineffici gener paradigm satisfi requir system asynchron event support condit notif mobil awar call acknowledg jean beacon insight comment improv paper acknowledg contribut daniel gordon implement prototyp comment earlier draft paper paper benefit comment review refer ieee mobil servic acm mobicom easi live msr comput laboratori bacon al support distribut ieee march box al object access protocol ahm singh agent program intern distribut comput system programm commun mobil internet program lnc april extens person mobil servic mobil integr commun ieee workshop mobil comput system applic perform comparison wireless ad hoc network rout proc octob sun microsystem procedur protocol tanenbaum van critiqu remot procedur call pp picco middlewar physic logic technic report februari washington st usa van van amoeba distribut oper commun acm tenenbaum oper prentic wong walsh infrastructur collabor mobil rothermel mobil agent int lnc pp remot procedur call servic mobil st acm mobicom pp baumann hohl rothermel concept mobil agent www special issu applic techniqu web clark argument system acm transact comput page home audio video home area ieee januari architectur storag retriev septemb dc schmidt design perform corba stream hawaii intern confer system scienc multimedia dbm januari andi hopper stuart tim applic technic report olivetti research collabor workshop smart juli object manag group languag map object manag group dynam invoc core jini prentic hall manag group servic moodi event scalabl feder heterogen acm sigop european septemb access home area ieee internet vol bj remot procedur acm transact comput
Agents/29 1 secur support system giovanni michel dipartimento di ingegneria università di itali abstract paper discuss requir agent system secur paper introduc classif modern distribut examin deleg concept secur point view discuss peculiar secur deleg issu present distribut object mobil agent system multi agent case studi describ secur support built jade platform introduct enorm avail low distribut system brought kind busi exploit wide area digit network happen internet happen ubiquit comput commerci exploit distribut system put burden softwar secur mean lightweight servic made internet wireless cellular data travel network infrastructur data transfer oper secur familiar tripl repudi properti past extens research cryptograph algorithm produc fundament nowadai trust implement algorithm differ mathemat strong cryptographi step secur comput secur entail polici organiz structur focu move algorithm techniqu polici infrastructur drive forc mention gener push complex secur aspect blend flexibl adapt order cope demand gener principl inform hide coupl softwar compon import research agent concept describ highli encapsul softwar compon concept number approach tend concentr facet paper analyz secur issu modern distribut discuss concept plai import role flexibl softwar strongli relat secur issu softwar agent system compon structur discuss highlight link architectur deal secur distribut softwar system classifi categori classif exhaust distribut system belong list uniqu system belong singl provid guidanc separ concern main focu classif highlight differ attach categori typic secur deleg issu architectur style modern distribut system term softwar architectur denot larg scale structur softwar concept understand design complex softwar softwar engin commun recogn system softwar system tend cluster small set templat templat identifi document architectur style architectur pattern differ attitud author attempt classif architectur distinguish major data flow system structur inform li motion data part system architectur domin order singl thread control interact process system architectur result commun pattern multipl concurr comput flow repositori multipl comput revolv center data store data directli share system part hierarch system partit subsystem reduc coupl limit interact classif cover architectur suffer heterogen fail analyz suffici detail modern architectur style distribut paper concern classif criteria gener extens accommod newer class architectur style introduc guidelin list compon connector focuss interact criterion highlight differ natur style belong interact process famili explicitli cite distribut object compon call manag object connect remot procedur call remot method author state graph concept direct show preliminari work fail properli describ distribut object architectur style gener classif framework paper interact distribut object data encapsul manipul remot interfac object connect remot method invoc compli constraint express interfac receiv object definit extens distribut system design contract principl distribut object architectur style style distribut system object remot method invoc connector design contract coordin data control popular exampl corba standard dcom infrastructur style mobil agent kind made activ entiti encapsul code transfer mobil object mobil agent case kind belong heavyweight host mobil agent provid execut environ call process environ wai connector style life connect mobil agent place current connect place connect agent migrat connector agent compon dynam chang transfer comput code connector connector base mobil deriv taxonomi gener architectur style mobil code paper mobil agent case commun connector interact process famili base mobil agent softwar system object orient commun connector typic method invoc design contract interact mobil agent architectur style defin data control interact distribut object addit migrat connector agent migrat retain comput state system style mole aglet architectur style multi agent system type compon present style agent notion environ explicitli model connect connector commun connector environ repres act connector distinguish featur agent compon agent initi interact extern stimulu basic autonomi featur held compon mobil agent mobil agent initi commun migrat interact autonom simpl definit major trait multi agent system style peculiar interact commun connector agent exchang messag belong agent commun languag languag base speech act theori gener equip kind logic framework express semant acl commun compon strictli extend design primit notif primit directli exampl style fipa standard dmar system secur threat countermeasur secur rel make claim system secur explicitli state kind threat system successfulli stand secur process fundament step threat model describ attack system natur affect kind threat fear previou classif base architectur style lot threat model task target system distribut object attack unauthor masquerad denial servic system mobil agent style vulner remov trust relationship agent execut environ lot research cope addit interest exampl multi agent system style remov induc secur add layer threat set particip reason negoti protocol piec inform infer special secur aspect involv interact promot system deleg secur gener softwar engin import design system made interact defin interfac case compon held reli helper carri duti term deleg process helper object unknown client line actor languag deleg mechan prove altern recent languag popular distribut object framework inherit deleg base implement remot interfac deleg replac affect secur thing agent agent act behalf deleg action gener impli transfer capabl permiss author extens java secur api support secur deleg mobil object environ ad acl commun autonomi affect deleg act deleg task load social mean author analyz deleg system framework base action eventu semant imper speech act root deontic logic case secur multi user support jade concret outcom address secur deleg issu paper present case studi design implement secur support fipa compliant platform system draw made previou major requir secur model tailor multi agent system architectur style specif overlook fundament common kind distribut system secur model account deleg common interact enabl secur flexibl deleg agent remaind section detail secur model implement jade agent platform jade agent platform jade softwar framework develop system complianc fipa support infrastructur relat fipa transport messag white yellow page agent tool agent debug manag form secur built jade agent platform system agent belong singl author equal permiss mean jade real world electron commerc deal support design implement version leverag java secur api cast secur model agent platform model account peculiar system architectur specif support deleg secur model jade jade agent system implement java obviou build secur model close exist creat extens jade secur model necessarili provid concept repres resourc access manag authent user grant author provid construct system hierarchi princip group role possibl secur deleg task entiti complet task complex commun trust relat rise agent commun remain reserv requir applic critic secur manag transact implement electron commerc protocol java platform adopt user configur secur polici decid grant access permiss execut code code sign case sign control access adopt java tradit secur typic oper center user obviou adapt administ secur infrastructur program interfac authent user assign privileg jade secur model princip repres entiti ident authent princip bound singl compani organiz entiti jade singl agent bound assign system respect user constitut membership make grant permiss agent launch singl user resourc jade secur model care includ provid java includ local file system network environ connect resourc typic system protect unauthor access agent agent execut environ permiss object repres capabl perform action jade inherit java secur repres system resourc permiss includ list action access access control function compar permiss grant princip permiss requir execut access requir permiss tool simplifi secur administr organ deleg administr regard definit subset organ domain exist resourc organ hierarchi make simpl assign administr manag group set resourc fact creat object user access creator deleg stai confin assign domain certif author jade secur great part found avail number ident entiti permiss grant make verifi authent certif certif sign publicli recogn author jade author consist essenti coupl privat made simpl approach insert jade agent platform exist public kei infrastructur authent step assign access permiss agent execut system authent agent jade agent system user authent provid receiv back certif ident grant permiss permiss deleg agent launch system maintain control action singl agent perform creation agent authent user inform remain bound protect object unauthor attempt close user agent lack requir permiss agent authent system requir access protect resourc authent involv present opportun identif ident certif element ident certif includ ident ident emit identif algorithm protect valid period element establish certif valid bind certif agent princip hierarch ident agent includ user entiti higher hierarch author assur access run code bound authent permiss princip control java secur support java secur model protect domain simpli set instanc grant privileg domain identifi base signatur byte code address download form author suffici environ agent belong compani decid resourc access basi author sourc word subject attach current access control context subject possess certif ident princip run code number certif carri permiss typic agent ident agent author list permiss grant agent agent obtain certif creation time directli deleg agent live system system case check passag permiss system make deleg entiti permiss deleg deleg essenc secur deleg verifi declar act behalf author case deleg mechan flexibl basi secur treatment speech act interact revok deleg forbid deleg task grant secur model thought jade adopt facet support style simpl deleg cascad chain mean revok grant deleg model adopt secur deleg jade deriv adapt multi agent system implement permiss structur seri agent involv agent utter imper speech act agent carri task complet task turn request form effect deleg chain final intermedi approach mode appli deleg intermedi request simpl deleg limit unlimit cascad deleg initi combin deleg jade certif implement secur deleg certif document author execut determin action behalf agent start deleg process set content certif govern comput resourc secur mechan deleg agent certif sign acknowledg author check deleg entiti possess permiss intend deleg certif deleg deleg princip report identifi group user agent deleg list permiss grant deleg entiti present secur polici servic implement secur model base access defin set protect resourc condit identifi princip access resourc model defin jade defin secur polici resourc access princip polici extend default polici adopt java effect polici form logic singl access polici multi agent environ secur commun jade connect main platform remot gener geograph commun agent situat locat attack obtain reserv inform obviou solut grant commun remot jade remain reserv provid assur protect transmiss secur socket layer protocol gener protocol provid authent encrypt tcp connect ssl base protect jade transmiss appeal number reason ssl emerg standard secur internet commun popular numer implement fulli written ssl plug system socket applic protocol iiop rmi wire ssl mutual authent parti network connect featur platform protect malici host mask host trust jade platform run rmi distribut object broker enabl secur rmi commun simpli matter replac standard socket ssl socket approach iiop current implement limit rmi commun due lack fipa specif secur address fipa ongo secur futur work paper discuss issu consid provid secur support framework distribut focu multi agent system interest connect deleg secur model practic case studi jade agent platform prototyp implement make mainstream jade code base improv implement effect work secur complet address higher level resourc ontolog work involv jade user fipa commun larg public discuss secur solut refer agha model concurr comput distribut mit jl austin thing oxford rothermel concept mobil agent world wide orient softwar system john wilei system agent practic box fipa specif gp vigna code ieee transact softwar shaw introduct softwar advanc softwar engin knowledg vol world scientif pub pp jade project home page db oshima deploi java mobil agent addison meyer softwar prentic lea protect deleg mobil object proc coot usenix confer orient technolog santa tj reed proc atal intern workshop agent architectur object manag group concept implement ara mobil agent proc ieee workshop enabl infrastructur collabor stanford mp georgeff theori proc icma st intern confer san jalali architectur mobil agent proc intern symposium autonom decentr clement field guid preliminari classif architectur style softwar proc st intern comput softwar applic august pp schneier wilei jr searl essai philosophi cambridg rb ungar inspir proc ecoop
DB/30 3 xml manag mong li li arizona state nation singapor abstract effect exist xml queri languag studi comparison linguist implicitli reflect fact xml tool exist paper focu effici pragmat step systemat benchmark xml queri process platform begin identifi function xml data manag system support review exist approach manag xml data queri process capabl approach compar xml queri benchmark discuss strength limit benchmark highlight bia benchmark data centric view xml motiv select extend document centric queri complet captur inform retriev capabl xml manag system final summar contribut discuss futur direct introduct introduc data extend markup languag quickli emerg standard inform interchang web xml introduc subset sgml gener markup design solv problem face document commun xml augment html text markup data carri mean present detail develop directli mainstream research activ particip develop standard queri languag xml led develop queri languag lorel xsl xql languag design commun data centric view xml xml develop primarili document markup languag power html complex sgml lead question queri languag captur essenc power semistructur data recent xqueri publish world wide web consortium candid standard queri languag combin document data centric characterist xml xml document nest order label order tree simplest abstract xml referenc mechan provid xml simul arbitrari graph repres semistructur data relat object relat repres graph cover xml xml model semistructur data variant semistructur data model object exchang model unql lore model includ xml differenti data schema schema inform queri process queri optim effici storag attempt made extract schema semistructur data result specif relax semistructur natur xml pose queri optim naiv evalu queri entail entir retriev requir prohibit term cost time data model xml opportun issu path queri har power structur requir multipl scan absenc effici index structur research develop index scheme semistructur data xml recent year dataguid dataguid index semistructur data recent index xml data index scheme suitabl facet xml data usag difficult categor scheme subset scheme ideal queri process xml queri system scheme queri optim type xml compar naiv evalu strategi junctur user intend setup xml base data system decid xml queri system base system index scheme schema specif follow absenc standard benchmark xml queri process system test compar greatli user benchmark assess power queri languag xml manag queri languag relat optim techniqu complex develop gener benchmark myriad unknown domain xml queri process system present stand xml web data integr system applic queri process easili judg mention domain similar express power usag metric perform cost vari system system develop gener benchmark junctur highli prematur applic specif benchmark web repositori narrow limit benchmark ¤ paper interchang manag queri process refer data manag tool xml data provid data retriev mechan base xml queri languag test system usabl number scenario gener unabl defin good metric evalu internet system todai store manipul data effici manag interchang larg amount data xml fast emerg standard data interchang format approach store manipul xml data emerg nativ xml data store store data index text extens transfer data xml document xml extend microsoft sql server oracl xml server publish data xml format primarili distribut applic xml portal server content manag system manag gener document stand queri engin queri xml document approach emerg approach provid queri capabl xml data form identifi desir characterist xml queri process system motiv develop benchmark compar queri capabl xml system interest determin benchmark compar xml queri system store data local collect focu queri process power system test benchmark user compar exist system give desir properti futur xml queri process system characterist research queri optim system benchmark xml data store perform compar studi benchmark benchmark term function cover storag retriev techniqu underli data high import system metric measur effici storag retriev section address expect function xml queri languag address benchmark current xml data system section list xml manipul capabl perform compar studi xml data benchmark section section extend ad queri cover document orient xml data process function conclud section highlight contribut extens work xml queri function perform implement queri languag xml depend strongli express function provid expect function affect significantli effici system languag claim xml queri function vari dramat languag lorel offer function provid tradit data orient queri languag sql focu xml integr restructur addit function nest aggreg partial function xsl xql languag quilt xqueri extend approach function handl xml document design benchmark xml queri languag address perform issu connect characterist xml queri function xml queri languag id descript queri data type collect possibl multipl xml document mix queri accept stream data support oper data model text element support hierarch sequenc queri manipul null valu support quantifi queri queri combin part support aggreg gener sort result support composit oper navig environ inform part queri current time support xml updat data model support type coercion preserv structur document transform creat xml structur support id creation support structur tabl desir function xml queri languag function address compar analysi xml queri languag list requir publish xml queri languag work group tabl requir xml queri languag support manipul extract data multipl document access combin part document queri dtd xml schema path data type evalu condit textual element xml queri support implicit order element xml explicit order defin complex data model defin xml data par xml queri languag work differ data model common origin xml semistructur data null valu present miss element null valu element vice versa null manipul addit complex support quantif negat queri xml captur structur inform xml queri languag express structur queri languag sql relat languag support type join oper aggreg sort unlik xml relat model disregard order sort aggreg complex order document structur preserv form languag capabl gener xml structur transform xml structur queri path path consist call structur support queri chang underli data queri languag provid method updat underli benchmark xml queri processor xml lingua franca primarili data exchang format give rise mind vision larg connect data process system store manipul data xml format time score vendor make product xml awar xml store manag system offer data manag vendor time busi close relat inform tool manag data issu evalu reliabl perform busi tool benchmark identifi import perform paramet system vari level load differ environ necess xml manag system broadli classifi xml document sale scientif record exampl xml document similar tradit physic structur order sibl element unimport document document highli mix content physic structur import ascertain inform web market exampl document relat suitabl store retriev xml document nativ xml content manag system suit store retriev xml data discuss divid current xml manag system nativ xml extens transfer data xml document gener design store retriev document data transfer tabl specif design model xml document system provid capabl store document singl column extens queri base storag techniqu nativ xml fall storag system store entir document text form provid limit capabl similar tradit store binari model document dom object exist custom data store main differ nativ xml nativ xml preserv physic structur cdata theoret practic stori data store nativ xml attempt learn schema made allevi problem dom xml relat api access data nativ xml system offer direct access odbc detail classif xml manag relat product refer issu current manag system exist xml specif system built top relat model implement quilt flat file store data work document centric natur xml lore transform store xml data system xml project publish data store xml data order unlik relat data system claim obviou drawback deal implicit order data order inform lost convert xml relat view gener system element system natur expect system displai similar process capabl xml queri nest group hand relat effici storag retriev techniqu make index techniqu evalu queri system optim queri exploit document centric properti xml data text implicit explicit order manag mechan effici storag retriev difficult implement comput complex involv xml data sourc data system flat document end naiv execut xml queri nativ xml show vari perform base storag method nativ storag strategi return entir document text form hand return fragment document combin fragment document model nativ faster situat specif ideal nativ displai characterist model system maintain true order data face system solv data centric document centric view isol true xml system give good perform presenc data orient inform retriev type queri queri exploit featur simultan feasibl exist system data centric start develop evalu system extens includ evalu document centric queri process capabl benchmark xml manag comparison semistructur data model queri languag studi wide storag strategi map scheme xml data relat explor benchmark oltp support inform spatial data manag paper concentr sole queri process capabl system test benchmark test xml system queri process abil document ha titl chapter author head section paragraph link figur id descript comment coverag group document url return complet document origin structur document text retriev queri phrase phrase chosen phrase list id parent element find chapter author author element content queri document group ii return leaf tree structur simul explor document document unknown structur path child node start document root document path element directori structur oper directori document structur unord data url fragment insert date document author join oper group iii document import document kind referenc document group count oper insert join oper document author attribut access metadata group iv insert document url loader gener document url send http server delet document robot request delet tabl queri benchmark test featur provid system benchmark model web applic xml data evalu standard linguist featur queri url aggreg oper workload queri benchmark appli result exist figur show conceptu schema testb attribut omit simplifi diagram tabl list queri provid part benchmark group queri group base common characterist captur group simpl select project queri comparison element valu valu type data text queri group ii requir system element order extract result queri perform join oper maintain order data crucial aggreg function process metadata inform necessit queri group iii queri group group iv perform insert updat interest note oper semant identifi fulli xml data model column tabl point xml function list tabl region region item mailbox profil isa open auction close auction bidder site peopl person open auction close auction auction annot descript edg price categori categori figur develop xml benchmark project recent benchmark xml data store benchmark consist applic scenario model internet auction site xqueri challeng design cover essenti xml queri process queri evalu intern research monet give baselin figur show conceptu schema testb attribut omit simplifi diagram tabl show function cover queri group queri group queri group path queri exploit schema inform specif test string manipul test effici path queri test system abil ascertain exist path gener result group ii make order element test effici process arrai lookup test process queri group iii check perform presenc idref group iv base join id descript comment coverag group return person check abil handl string id regist north america fulli path list reserv open auction queri tag valu captur document person issu bid person orient xml item list test effici handl path express piec prose queri answer cardin relat test implement print keyword emphasi attempt quantifi complet annot close auction path queri check exist path return id auction keyword emphasi group ii return initi open evalu cost arrai lookup author site auction author site relat backend problem determin element essenti queri order data relat system lack return id open auction current complex evalu arrai lookup high initi sold item cost check good dbm perform xml model document orient check type xml return item text search narrow combin descript word queri content structur person homepag determin process qualiti presenc option paramet group iii list person number check effici process idref item bought note pure relat system handl situat foreign kei list person item bought join close group iv list number item base join author feel sale price queri candid exce incom optim list number item sale price exce incom group list person interest restructur rewrit french markup result storag effici check list item regist australia test abil reconstruct descript portion xml document convert currenc reserv user defin function check open auction currenc give alphabet order list queri lead item locat order group lack schema group custom incom processor identifi output cardin group subpart differ valu attribut predic profil visit tabl benchmark queri test good optim techniqu group queri requir aggreg sort oper part document underli design xml queri languag data model queri languag richer structur flexibl model queri complex data xml attempt provid framework handl semistructur encompass model featur complex object model straightforward correspond schema instanc xml dtd data design mind similar data model xml objectori approach adapt benchmark section motiv approach design benchmark base detail analysi similar xml data model titl id text manual man design isa id type modul assembl assembl document document titl id text isa part connect type length figur diagram benchmark figur show conceptu schema model er diagram benchmark evalu manag system perform main oodbm storag manag benchmark tabl outlin list queri provid part group queri main group provid set addit queri cover group queri group simpl queri path express schema inform group ii queri gener result requir explicit order order quantif test system effici handl quantif group iii complex gener order result includ join map schema instanc dtd xml data set evalu perform queri process facil semi system open sourc prototyp work ascii xml data commerci system simpl limit map xml data data characterist measur time queri class time load space requir store data detail test benchmark cover averag function list tabl queri benchmark queri commerci system test sensit result docid id descript coverag group randomli gener number rang return number randomli gener titl document return lookup titl group ii select latest return select latest return select return group iii find find join document docid document addit select xml attribut randomli gener phrase phrase document select document phrase repeat queri replac duplic element idref select select type tabl queri queri test updat note queri test join make hard analyz experi result ascertain featur lead perform observ structur similar basic relationship captur deepli nest adapt extend establish benchmark complex structur deepli nest complex object date found structur complic lack repeat import version benchmark evalu desir xml queri system properti tabl present capabl xml manag system captur benchmark current benchmark cover list coverag provid extend version tabl hand list desir properti xml queri languag needless properti overlap tabl clear benchmark cater view xml manag system benchmark cover properti gener found tradit system mandatori schema requir characterist transact view aggreg oper cover point oper defin xml queri model requir cover delet insert oper coverag provid term complet document queri system characterist select queri project queri remov select element reorder element output structur remot data evalu machin preserv implicit order exploit schema document manipul xlink xpointer manipul stream data schema gener fly transact process text search view process store procedur trigger user defin function aggreg manipul updat delet append data extract result base similar criterion qualiti base result tabl compar benchmark xml system characterist mechan test xml document develop multipl user collabor schema document updat handl highlight trigger activ user updat schema strengthen goal develop benchmark test xml data manag system data capabl xml queri extend queri xml syntax suit semistructur data xml semistructur data subtl differ dwell detail simpl abstract xml label order tree tree xml semi structur data interchang graph structur model differ semistructur data model base unord xml order uniqu identifi element xml refer element made element xml document close observ xml model show similar data model xml similar objectori data model consist node heterogen data heterogen node depend lot dtd schema defin structur xml document data model similar xml semistructur data model respect object entiti tree similar xml assign object ident object referenc object object identifi part namespac refer object web similar notion namespac xml compar data model xml data model method element type attribut similar class attribut model fact xml natur repres relat individu tabl ¢ ¢ ¢ connect ¢ connect modul type cdata manual titl cdata type cdata type cdata type cdata document titl cdata text cdata type cdata docid connect type cdata length idref idref figur dtd xml data benchmark directli repres inform data actual similarli repres relat queri result involv sort xml straight forward wide practic xml exist data manag system core rdbm relat set constraint exist enforc rdbm make rdbm power repres constraint set xml commun xml inher mechan enforc constraint sort schema constraint limit data model present constraint abil enforc constraint characterist rdbm fix record compact storag format design improv reliabl perform easili mimick xml fact standard api xml call dom document object model xml document resourc descript framework id descript comment coverag group find queri path express id greater comparison return occurr test document support find part connect element mainten order length find length compon abil gener data conform greater format result data model count number cardin document document group ii atom part displai parent test effect relat id identifi manipul join document common compar abil perform relat docid perform order style join order unord unord join set data consid sort descend order environ valu sort year result possibl optim return modul document text search queri simpl case text equal find type robust presenc negat group iii return parent element element test data interpret repres intern system return check structur type handl return connect aggreg function handl implicit element length greater order mainten impli group iv type give gener result make id user defin function text equal concaten concaten titl titl element list type implicit order order ascend order maintain complex reorder tabl queri ad describ metadata xml flavour develop benchmark base fact benchmark xml queri system xml data document store local xml data model show high similar model decid benchmark design top benchmark test perform extend extend motiv tabl captur featur xml manag system chang schema add queri augment function benchmark captur feasibl current xml queri characterist identifi tabl dtd conceptu schema figur figur translat involv arbitrari refer detail tabl tabl queri gener model cover substanti number xml queri function identifi earlier section identifi initi data centric queri imper benchmark extend includ queri test document process capabl provid group queri tabl group test level support system test abil maintain order data queri document centric test text process order manipul power system test group ii consist queri combin data document process abil xml queri languag test abil perform effici negat handl sort result group iii test abil support aggreg function effici handl structur group iv queri test support user defin function complex process queri requir implicit explicit order mainten specif mix mode queri gener result requir relat join perform preserv order aggreg function process implicit order test system abil effici interact environ process queri user defin abil tradit provid bring complex involv maintain implicit order present explicit order gener result design assum document order data acknowledg assumpt tilt balanc nativ xml type queri complex involv satisfi assumpt exist manag system rdbm ordbm empir evalu form part futur work extens provid attempt make benchmark complet result comparison exist xml manag system benchmark refer extend set queri test part experi intend part futur work realiz moment assum system realiti system highli preval wide plan extend includ queri queri presenc schema inform aspect plan empir evalu set queri provid compar exist xml system determin feasibl classifi power queri futur work xml ubiquit number manag system xml check system provid xml relat technolog xpointer xml queri deliv benchmark inevit identifi desir xml queri characterist briefli review exist xml manag system provid list desir characterist system introduc exist xml queri benchmark compar term capabl xml queri manag system point exist benchmark test xml process capabl system extend includ capabl extend queri captur queri process featur addit featur extens mean complet intend improv benchmark base singl user oper order test system scale intend extend test platform intend test data manag system extend hope insight develop benchmark xml manag system comput environ intend issu portabl benchmark system system refer le wood document object model extens stylesheet languag work draft abiteboul object support digit librari european confer research advanc technolog digit septemb invit paper suciu data relat semistructur data xml morgan kaufman abiteboul grumbach languag complex object page jl wiener lorel queri languag semistructur data journal digit abiteboul scholl simpl languag complex object data engin ceri compar analysi xml queri languag sigmod appli benchmark xml queri process tool rv guha resourc descript framework schema specif candid recommend malhotra xml schema part datatyp recommend xml cm maler extens markup languag bohm benchmark xml data brai cm extens markup languag buneman semistructur data proc acm symp principl invit tutori tanca graphic queri languag queri restructur xml document intern world wide web mj dj jf naughton benchmark acm sigmod page queri languag xml florescu xml queri languag heterogen data sourc workshop webdb conjunct acm ramakrishnan oracl xml suciu queri languag xml prepar xml schema part primer recommend florescu perform evalu altern map scheme store xml data relat report franc robi xml queri requir widom tsimmi approach data model languag journal intellig inform widom semistructur data migrat lore data model queri languag acm sigmod workshop web grai benchmark transact process system morgan goldman widom enabl queri formul optim semistructur proc intl conf larg data august suciu effici xml data proc acm sigmod symp manag milo suciu index structur path express murata regular languag descript relax octob suciu fernandez queri languag algebra semistructur data base structur vldb xml queri languag proc queri languag decemb mendelzon index xml data fourth intern workshop web sahuguet make mistak made lesson technic dept comput pennsylvania buss xml benchmark project technic report april xml schema part structur recommend transact process perform council vianu web codd xml symposium principl world wide web consortium autom web web languag
DB/31 3 manag larg data flow dynam queri beth colleg comput georgia institut technolog abstract system satisfi client specif inform data stream data stream speak flow data exist video stream larg number distribut high volum busi transact introduc notion conceptu data stream set relat tabl scientist request inform queri transform comput perform data conceptu comput perform consecut view comput view system move queri code data stream compil code relat data model advantag present opportun effici queri set queri exampl global illustr system carri exampl experi establish viabil approach high perform comput baselin benchmark defin latenc determin realist case optim appli show latenc control probabl assign queri queri evalu true introduct motiv network end user increasingli expect rapid access remot rich complex scientif engin imag larg prompt develop solut effici data transmiss oper system support commun support rang middlewar applic server system web group creat middlewar solut specif data flow creat client request data sourc deliveri larg data set client applic requir support includ numer technolog support teleconferenc cooper distribut scientif laboratori remot locat scientist instrument synchron collabor displai gener data comput model produc data applic includ larg data stream result digit librari system nation inform librari terabyt librari servic complex queri simpl browser search dai system dynam queri object system address kei problem data stream unmanag data stream resourc cpu data stream consum unnecessari network bandwidth transmit high fidel scientif data low fidel visual engin potenti benefit deriv manag stream ad comput stream difficult attain difficult custom comput stream stream potenti exist duplic process multipl comput appli singl data stream system enabl user creat queri data queri filter data transform gener data form end user queri execut perform runtim compon term dynam data stream arbitrari includ data intermedi data consum intent distribut filter process action resourc avail applic kei concept goal system reduc latenc identifi forward data data broadli data interest scientist scientist investig deplet data period data gradual rise conceptu data extract data stream set relat tabl user request data comput perform data appli consecut data comput view abstract data model comput explor context xml advantag abstract model abil implement span administr kei requir comput data model relat xml queri data support declar queri turn present opportun optim data stream strength work addit gener advantag common data model declar queri languag present method rigor approach execut queri permit user focu data potenti elimin larg amount unnecessari data process transfer relat queri establish research form solid basi leverag stream optim leverag impli simpli adopt simpl reason oper form data flow tabl stream optim target tradit optim includ stream filter base condit defin optim exist elimin redund stream process order action relat thought attribut column header defin field tupl instanc tabl reconfigur queri process engin final strength work movement queri code data stream form contribut specif contribut paper demonstr queri larg data reduc latenc throughput data provid consum data end user exampl global establish viabil approach high perform applic defin latenc determin optim appli data stream show latenc control dynam determin assign queri probabl evalu lightweight evidenc abil sustain gener rate event hundr kilobyt size event megabyt abil reduc latenc demonstr reduct achiev replac weak condit strong improv queri filter abil similar result achiev internet implement queri result show unoptim queri consum execut demonstr import runtim opportun present optim demonstr earlier result show reduc queri evalu time order magnitud overview motiv research exampl drawn global model section overview system section cost metric evalu perform develop section experi section relat work discuss briefli section conclud remark section motiv work motiv gener data stream creat visual data engin scientif applic data gener parallel distribut global model simul flow chemic specif interact short live speci logic timestep hr model time defin tupl pressur roughli correspond altitud roughli latitud longitud direct creat rule select func figur record region upper defin bound box scientist view data current investig scientist interest data simul imag dai perfectli adequ investig transfer south visual upper southern region circl figur show suitabl queri specif rule accept input event type data ev request ev delin delin action select statement defin result event exist case statement defin queri bodi queri condit nest insid user desir data upper level level region defin bound box gener automat activ user interfac user action event dai discard specifi function execut queri evalu true convert shown function code written procedur languag compil optim script gener librari queri interpret compil runtim code repositori action code compil sql queri action defin scientist action code dynam link compil queri runtim queri code move figur system life rule observ made queri figur scientist data referenc data attribut longitud latitud data structur attribut queri check reli action comput creat event intersect queri specif tediou error make automat gener queri user action profit research direct shown languag support tempor oper time relat polici lower pressur equat upper pressur system overview system tool creat queri dynam rule data stream softwar shown figur consist compil environ compil accept variant sql queri specif languag compil queri intermedi optim gener script version code move consist interpret decod librari dynam creat effici queri runtim result user rule store pile queri script suffici inform retriev dynam action code gather statist inform period trigger dispatch execut manag rule compil compil accept rule consist queri action convert grid slice compil convert base queri queri time procedur order sql specif queri tree undergo optim tree gener code result object code form tcl script declar queri languag common queri queri languag declar obviou strength declar queri languag shift burden order evalu scientist compil scientist compil select execut order power declar languag underestim high perform data effici queri evalu set depend knowledg underli care assum optim queri execut stream queri optim defer runtim clear strategi subsequ involv continu user involv queri optim partial evalu kei contribut attain high perform effici partial queri evalu partial queri evalu abil decid outcom queri evalu entir semant unlik partial evalu languag condit evalu condit condit determin failur express evalu true partial evalu essenti data stream queri continu execut optim queri effici partial queri evalu show section unoptim queri result latenc client runtim kei featur runtim effici queri compil code abil perform runtim queri queri compil code state compil gener tcl script call librari set routin creat compil code queri set routin creat object oper tempor link rule link put librari api akin set style templat invok set creat instanti object custom paramet librari creat custom object repres queri rule belong script queri advantag compact portabl script moder complex queri roughli size compil code swap rule simpli send script dynam continu queri undertaken gener optim version queri research determin optim version difficult obtain strive optim version optim express term total queri execut time defin section optim version result stream data behavior significantli chang newli ad queri optim base histor trace data accomplish histogram collect statist data valu queri intern algorithm control statist gather trigger detail descript algorithm companion paper cost metric cost metric implement queri quantifi notion data transport process model data stream data depict sourc client tq ts tq figur data flow model figur arc depict direct data flow node depict logic data flow impli physic distribut machin data flow model eman multipl sourc coupl transport chemic singl client visual client data process filter present client commun comput effect real time defin effect real time averag latenc larg number event travel sourc depend data behavior achiev success queri data stream reduc client effect real time ad queri data stream client reduc arriv data data pai penalti unwieldi success kei cost metric defin tabl time transfer data event data sourc transform assum event stream model includ instrument overhead event data gener case data record partit multipl total time move entir record explain detail time fastest cpu execut queri action singl data event assum block input time requir transfer transform data singl transform client event deliveri complet event arriv visual client model straightforward calcul latenc singl event reflect possibl multipl transform transfer time client paramet mean number sourc host sourc data transfer time number host tq process time client data transfer time number client host tabl perform model paramet time singl event direct gener stream event influenc data stream behavior queri effici latenc measur averag time time spent call process time process time depend queri action fix overhead time sum queri evalu time queri action execut time action fix overhead time overhead queri action overhead worst case measur impli sequenti execut implement capabl execut parallel smp machin multipl rule cost interact rule reflect overhead improv process time achiev reduct queri execut time queri reduct action comput time action queri probabl probabl queri evalu result outcom reduct action comput time scope work queri probabl discuss detail full version paper evalu experi demonstr perform benefit ffl ffl queri bring perform ffl effect reduc latenc data stream experi paramet experi base data flow section commun model figur sourc gener success slice global data visual client physic resid separ workstat experi run cluster singl processor sun ultra workstat run solari connect mbp switch data stream implement echo middlewar event action work realist obtain experi involv scientist rule graph benchmark architectur event handler support echo event channel echo event channel figur benchmark case test claim benchmark execut time rule softwar architectur benchmark shown figur consist event handl support thread result shown figur measur minimum time requir process event time requir execut event handler handler invoc time copi event dequeu time invok echo send event note measur reflect concurr event handler support copi number figur show copi cost domin total execut time evidenc larg event size grow partli group work version echo remov restrict event retent fulli copi echo buffer optim copi number reflect design copi attribut inform space actual data byte copi event size absenc larg copi total time small fraction millisecond optim copi copi messag size figur benchmark time data copi percent cost copi mbyte event instanc shown tabl larger event size sustain event gener rate rang event size overhead sustain event percentag copi gener rate byte tabl overhead explain term copi cost event gener rate justif queri measur determin percentag time spent execut queri justifi cost reorder oper make singl queri ea rule queri perform select repres simpler queri action convert grid slice part million part billion repres algorithm class oper comput minim copi assum optim copi figur show time queri sustain event gener rate assum block socket select event action event size queri queri consum substanti amount total event queri number show kind gain expect optim queri moder complex earlier studi shown gain order magnitud conclud experi observ larger event queri optim undertaken queri comput time pie successfulli pie queri unoptim optim queri byte figur breakdown time queri action applic realist rule reduc latenc final experi substanti claim system effect reduc latenc data stream measur expand group previou work establish util condit filter show measur impact queri probabl latenc strong rule queri high probabl discard event weak rule pass major event receiv queri probabl defin full version paper measur compar queri extrem compar weak queri discard strong discard obviou case user requir data uninterest favor support initi show latenc reduct weak queri replac strong substanti result requir longer model run data stream vari behavior time ongo effort event size reduct byte tabl extrem effect condit strength relat research detect data stream satisfi client data focu address fuzzi logic control argu static natur approach make adapt chang user data behavior acd dynam split merg stream heavyweight optim ad work activ data repositori similar work evalu queri satisfi client queri evalu freedom emb queri data stream manag stream input sourc origin continu queri system optim return differ current queri result prior result return client delta queri approach complement optim return full result queri highli effici manner user select extract data file select extract thought comput work complement frank model data flow client explicit control data gener intermedi transform appli data event approach direct singl visual client singl event type futur work paper introduc system approach manag larg data stream idea small queri comput data reduc data flow client data client provid data model user express data resourc constraint singl request cross domain make suit comput queri remov burden implement request user enabl optim request futur work target comput number user data sourc scheme appli optim leverag data model map queri push client data stream architectur effici adjust sourc control administr domain ongo work move addit comput capabl queri subject automat optim explor control level servic client latenc metric queri probabl defin paper refer earthquak ground motion model parallel comput supercomput novemb develop intellig monitor control system heterogen numer system simul proc annual simul april peter bruce david case system workshop parallel distribut real time system april greg event servic high perform comput prior experi applic michael joel saltz queri activ data repositori journal supercomput applic high perform comput ian foster ed carl kesselman blueprint futur comput infrastructur morgan frank michael mage reduc data distribut bottleneck emploi data visual filter proc high perform distribut comput adapt comput data stream high perform intern parallel distribut process symposium thoma mari fred parallel spectral model transport process practic novemb ling roger tong zhou differenti evalu continu queri technic report depart comput beth volker greg davi martin realiz distribut comput laboratori intern journal parallel distribut system beth detect parallel distribut applic system intl confer distribut comput system page june beth manag larg data flow dynam queri technic report georgia institut august randi jeffrei daniel reed adapt control distribut applic high perform distribut august
HCI/32 4 approach conflict resolut distribut groupwar system sun david chen school comput inform technolog griffith qld australia abstract groupwar system special class distribut comput system support interact collabor graphic editor group user view edit graphic document time geograph site connect commun network resolv conflict access share object core issu design type system paper distribut approach conflict resolut approach aim preserv work concurr produc multipl user face minim number object version accommod combin effect conflict compat oper major technic contribut work includ formal specif uniqu combin effect group conflict compat distribut algorithm increment creation multipl object consist object identif scheme graphic edit system algorithm scheme present paper grace collabor system implement java keyword collabor graphic consist multipl object groupwar distribut comput introduct groupwar system special class distribut comput system support interact commonli groupwar system collabor editor group user view edit document time geograph site connect commun network collabor editor facil advanc cooper work applic electron confer collabor collabor document system goal research investig principl techniqu underli construct collabor editor major characterist local user action quick notic latenc remot user action low kei perform paramet time observ number oper applic system collabor user resid machin connect internet latenc limit bandwidth internet fiber optic commun commun latenc ieee intern confer distribut comput pp april connect reduc millisecond threshold user notic due speed limit electron signal commun present major challeng achiev high collabor edit system multipl user concurr freeli edit part document order facilit free natur inform flow collabor user major challeng support unconstrain collabor edit manag multipl stream concurr activ system consist maintain face conflict requir high support unconstrain collabor internet led adopt replic architectur storag share share document replic local storag particip edit oper perform local site immedi propag remot site concurr gener oper nondeterminist commun latenc exist major inconsist problem replic architectur diverg oper arriv execut site result final document causal violat oper arriv execut natur system intent violat actual effect oper time execut intend effect oper time gener address inconsist problem consist model context reduc distribut unconstrain cooper project reduc consist model appli collabor text edit domain solv challeng technic problem report research find appli reduc framework grace collabor project collabor graphic edit system classifi paper confin issu collabor graphic edit system graphic object creat updat object repres attribut creat oper creat object object updat oper appli chang attribut object move oper posit attribut target object collabor edit oper conflict occur multipl concurr oper updat object wai resolv conflict access share object core issu design type system focu paper rest paper organ section background inform reduc framework briefli discuss section multipl version strategi conflict resolut rule determin combin effect conflict compat oper deriv formal specif uniqu combin effect group conflict compat oper present section iv distribut algorithm increment creation multipl object version section consist object identif scheme graphic edit system present section vi work compar relat work section vii major result summar work discuss section viii ii previou work basic techniqu adopt previou work briefli reader refer consist model lamport defin causal order relat oper term gener execut sequenc definit causal order relat oper gener site gener happen gener execut site happen gener exist oper ox ox ox definit depend independ oper oper depend iff independ express iff definit intent oper oper intent execut effect achiev appli document state gener definit consist model collabor edit system consist maintain site execut set copi share document site ident pair oper execut site oper local remot execut effect equal os exist oper ox ox execut effect ox execut effect vice versa highlight consist model execut order constraint depend leav open execut order independ oper long converg properti maintain featur consist model lai theoret foundat achiev good permit local oper execut immedi gener properti make user individu oper effect protect point properti independ mainten automat ensur concurr control techniqu consist model assur collabor edit system properti underli concurr control mechan support captur causal relationship oper timestamp scheme base vector logic clock achiev distribut algorithm central notif server causal issu relationship semant techniqu gener applic text graphic editor support converg edit domain requir techniqu text edit optimist concurr control call oper transform grace converg techniqu graphic edit domain investig achiev converg simpl independ paper focu issu result relat achiev iii oper conflict multipl version conflict compat relat graphic edit concurr oper target object conflict user gener oper move object posit user concurr gener oper move posit oper execut local site immedi give quick propag site move object imposs accommod conflict effect target object concurr oper conflict target object chang attribut valu give definit oper notat denot target object oper denot attribut type denot attribut definit conflict relat oper conflict express iff pair oper defin definit compat relat oper conflict express fi accommod oper effect compat target appli object conflict combin effect violat intent combin effect mean conflict oper final effect target object achiev oper found conflict shown fig final result site ident null effect preserv intent oper oper effect remot site effect oper undon independ oper consequ intent violat work concurr involv user destroi effect highli undesir collabor work environ user involv conflict provid explicit inform user intend proper action resolv conflict initi state user user undo reject undo fig conflict oper combin effect retain effect achiev enforc serial effect oper shown fig arriv user move posit undo arriv user reject final result user site ident singl oper effect violat intent oper oper effect user oper chang effect independ oper user consequ intent violat user work preserv consequ user ensur effect set user effect user effect multipl conflict user effect arbitrari number depend order oper arriv site conflict user consist explicit pictur user intend proper action resolv conflict preserv work concurr produc multipl user face base multipl version version appli effect oper accommod separ shown fig preserv intent oper effect local site reject initi state user user fig singl oper effect conflict oper initi docu initi docu user user fig oper effect conflict oper effect remot site chang effect system ensur work produc user retain conflict side effect approach singl version object convert multipl version conflict occur system notifi user highlight multipl version object user provid consist explicit pictur user intend make assess situat decid version desir worth point similar strategi collabor text edit domain concurr insert oper insert string substr string maintain document merg advoc groupwar design face preserv displai user work facilit solut destroi hide user work solut conflict gener system knowledg properli resolv conflict concurr conflict resolv collabor system provid explicit inform user action combin effect rule group oper target mutual compat appli origin target object creat mutual conflict version creat accommod oper effect separ version mixtur compat conflict oper determin version creat appli oper version notat repres object effect ox gf repres initi state start simpl scenario target object mutual conflict relat combin effect oper separ appli version multipl version strategi combin effect combin effect rule oper target object appli version made question combin possibl make separ version problem approach unnecessarili creat version compat oper avoid unnecessari combin compat oper common version minim number version combin effect rule justifi creation version combin effect rule version made object oper appli oper appli scenario target object mutual conflict relat fi fi version creat question version appli possibl combin chosen system total approach produc unnecessari version abnorm phenomenon user shown fig undo redo user user user fig scenario motiv system chosen combin site user abnorm phenomenon appli target object produc arriv combin produc compat knowledg final arriv found conflict undon produc redon version produc achiev system chosen combin user observ effect chang version due inconsist initi effect final effect abnorm effect violat intent oper oper effect independ oper point matter combin effect combin system user user scenario observ origin execut effect undon redon object avoid abnorm interfac combin produc matter order oper final combin effect abnorm interfac effect addit rule determin combin effect compat oper face mix compat conflict oper combin effect rule group mutual compat target effect combin common version target object criteria judg combin effect group oper target object correct appli combin effect conflict oper accommod compat oper combin common pair conflict oper pair version combin effect group compat oper iv combin effect group oper previou simpl scenario deriv illustr criteria determin combin effect conflict compat oper highli concurr collabor edit group oper arbitrari complex conflict relationship major technic problem arbitrari group oper target determin combin compli conflict relat matrix triangl solv introduc conflict relat matrix captur complet pictur conflict relationship group oper target object group target conflict relationship fulli uniqu express conflict relat matrix element fill fill oper shown fig op fi fi fi fi fi fi op fi fi crt fig versu crt fi relat symmetr oper compat omit redund constant relat conflict matrix compress conflict relat triangl fig compress crt fig compat group set altern express relationship group oper call compat group set defin definit compat group set group oper compat group set express cg cg oper cg mutual oper cg cg pair oper ox ox fi cg ox cg conflict relat express crt fig captur cg crt cg deriv algorithm algorithm crt group oper cg crt obtain cg crt fi cg cg cg cg gg shown fig cg crt cg cg cg op fi cg fig crt cg note compat relationship oper explicitli express cg conflict relationship oper implicitli express cg cg compat group set cg cg captur compat relationship group denot cg cg exist transform rule transform cg cg notat cg fi cg oper cg cg mutual compat rule pair cg cg cg cg cg cg cg fi cg cg cg fcg cg fcg cg rule group embrac oper group mutual compat group replac union rule extend group multipl small merg singl big group includ mutual compat oper rule exist cg cg cg cg cg cg fcg rule group subgroup group subgroup remov normal cg interest special form call normal compat group set defin definit normal compat group set cg group oper target cg normal cg group mutual compat oper cg compat oper coexist pair cg cg ox cg cg rule cg transform algorithm obtain crt group oper target object algorithm crt group crt obtain obtain cg crt algorithm appli rule transform cg cg group replac union appli rule transform cg cg subgroup remov return cg appli algorithm transform cg fig theorem establish uniqu properti theorem group oper target uniqu prove exist oper oper mutual compat group condit definit op fi fi fi fi fi cg rule rule fig cg imposs extra compat oper compat group cg oper condit definit subgroup cg contradict condit definit group compat oper proven exist theorem combin effect formal specif combin effect group oper target object definit combin effect group oper target object combin effect cg object version made oper appli version cg combin effect uniqu group oper uniqu theorem establish combin effect compli theorem combin effect satisfi pair oper coexist cg condit definit appli object compli pair compat group cg cg ox cg condit definit correspond compat group object version made combin satisfi group mutual coexist common cg condit definit combin common object compli major result section group oper target combin effect uniqu determin combin effect compli section discuss achiev uniqu correct combin effect consist increment creation multipl version group oper target object construct algorithm multipl version creat oper appli proper version combin effect collabor edit oper gener concurr arriv site order high proper postpon execut oper potenti concurr oper arriv oper execut long causal order mean system execut group oper increment creat version combin effect oper distribut algorithm increment construct site group oper target object arriv causal readi site algorithm construct sequenc group oper final group oper achiev problem appli oper produc identifi object version step problem address section multipl object version increment creation algorithm address problem algorithm notat descript repres ith oper execut site repres oper repres ith oper mean compat oper cg cg mean conflict oper cg object algorithm appli add proper exist compat group creat compat group produc algorithm repeat remov cg fi cg cg fo ffl fi ffl fo ffl fo cg initi empti counter number cg fulli conflict initi size current check cg order compat oper ad mean directli appli object version conflict oper ad mean appli object version counter decrement partial compat oper cg group oper cg compat ad mean appli object version newli creat exist cg possibl addit ad ad group oper compat result group ensur compat group condit definit compat multipl oper exist ad group group compat oper condit definit satisfi check cg oper conflict cg group fo creat condit definit import step algorithm check newli creat group subgroup group remov rule ensur pair conflict oper pair cg condit definit creat compat group correspond creat object ad exist group group correspond appli object version straightforward deriv method execut object version ad exist cg step algorithm appli exist object version cg creat exist cg step remov step object version creat appli creat step object version creat appli order independ properti ic algorithm import matter order group oper final construct algorithm uniqu group oper theorem properti call ensur consist final result achiev collabor site oper execut order formal verif properti scope paper exampl illustr properti oper conflict relationship express fig op fi fi fi fig crt execut execut order execut order rule step execut order check group creat fi check group creat reason group rule final execut order oper conflict relationship express fig op fi fi fi fi fig crt execut execut order execut order rule note conflict relationship oper detect examin timestamp paramet oper crt give complet pictur conflict relationship impli complet crt group oper construct appli algorithm shown step execut order check group creat fi check ad exist group compat oper group group subgroup rule final execut order vi consist object identif algorithm import paramet current oper appli produc technic issu find cg cg correspond object version made origin object target issu convert find object version made origin object target oper kei solv problem object identif scheme identifi object version made origin object requir object identif work replic architectur storag share graphic edit object identif scheme maintain object site uniqu identifi multipl version object identifi trace identifi multipl replica object site identifi uniqu properti ensur object site distinguish object traceabl properti ensur multipl version object traceabl identifi origin object consist properti ensur multipl replica object identifi oper appli replica appli replica properti ensur oper target object appli version replica object site analysi object identif issu start simpl object identif scheme uniqu identifi object denot identifi object oper uniqu denot object uniqu identifi identifi oper creat object object creat oper local assign uniqu identifi equal propag remot replica object creat assign identifi oper appli exist object local paramet arriv remot paramet find replica object appli simpl identif scheme work singl version fail multipl version object creat due oper conflict oper target object conflict relationship fi fi assum oper make pair sid identifi site lc sum state vector execut site order execut target object found origin identifi execut target object found previou execut chang identifi execut version made origin disappear arriv found order combin effect question identifi trace address multipl version identif simpl identif scheme extend version inher identifi origin object traceabl version includ addit identifi oper trigger creation version multipl version distinguish trigger creation simpli identifi mean clear end traceabl includ extend identif scheme ensur multipl version object distinguish traceabl identifi origin object ensur consist identifi multipl replica object illustr assum conflict oper previou execut site trigger creation simpli identifi replica object identifi differ conflict oper execut order solv previou identif scheme version includ addit identifi conflict oper previou matter order conflict oper multipl replica object version identifi consist object identif scheme complet correct subtl inconsist scenario discov resolv target object conflict relationship fi outcom execut oper order execut execut version creat identifi version identifi identif scheme appli exist version directli fi final outcom execut oper identifi identifi oper execut site final outcom execut oper identifi identifi trigger creation replica object version identifi identifi recogn previou object identif scheme version identifi includ identifi oper conflict oper oper trigger creation version clear collect oper identifi object identifi treat list set order ad conflict oper identifi object identifi scheme base consist object identif scheme defin definit scheme identifi object consist set oper oper creat appli conflict oper ox appli version made context scheme realiz oper creat origin object construct oper trigger creation version target object construct oper appli exist object extend includ conflict oper oper appli version object version denot check effect oper ox exist ox includ extend scheme maintain uniqu properti creat oper version object pair conflict oper scheme maintain consist properti set version replic site uniqu properti conflict relationship oper site scheme maintain traceabl properti identifi version object superset answer question begin target object version recognit scheme defin definit scheme oper object version compat group cg current iff vii comparison relat work exist collabor graphic edit system adopt approach base lock system base lock aspect ensembl user place lock object edit prevent user gener conflict oper object lock coordin process system track lock permiss lock request problem lock edit oper wait round trip time send request messag coordin process receiv grant messag execut local site round trip delai internet environ significantli degrad system techniqu overcom problem ensembl oper execut immedi wait approv local gener oper execut messag coordin process coordin process approv effect oper abnorm phenomena user interfac contrast approach strategi paper conflict occur mechan multipl object accommod conflict oper consist conflict resolut left user major advantag approach achiev high system preserv work concurr produc multipl user face conflict lock merit reduc conflict enforc mutual found lock complementari compat optimist concurr control strategi option lock scheme contrast exist compulsori lock enhanc consist mainten capabl system investig integr option lock scheme approach graphic edit domain report forthcom paper altern approach serial oper execut gener give quick oper check execut oper conflict conflict total order oper determin oper effect exampl system approach essenti total approach discuss section iii problem approach major differ refer analysi section iii close relat work tivoli whiteboard tool develop xerox parc tivoli multipl object version replica accommod effect conflict oper major differ tivoli approach grace approach tivoli conflict defin object conflict occur concurr oper target conflict defin object attribut conflict occur concurr oper target object chang attribut valu tivoli compat oper grace conflict appli object concurr move fill oper appli result unnecessari object version grace system oper conflict defin object attribut level minim number object version technic issu solut report paper uniqu address work viii futur work approach conflict resolut collabor graphic edit system approach preserv work concurr produc multipl user face minim number object version accommod combin effect conflict compat oper major technic contribut work includ formal specif uniqu combin effect group conflict compat distribut algorithm increment creation multipl object consist object identif scheme graphic edit system algorithm scheme present paper implement grace prototyp system java current grace prototyp system develop test feasibl approach explor system design implement issu effort direct build robust extern user real applic context evalu research result perspect approach complet solut resolv conflict collabor system complementari techniqu work conjunct techniqu process group awar mechan option lock scheme minim chanc conflict work underwai appli grace techniqu advanc graphic edit system acknowledg work report paper partial support arc research larg grant arc small grant refer rm read groupwar cooper morgan kaufmann publish issu cacm jan experi design implement group draw proc annual hawaii intern confer system pp jan greenberg time groupwar distribut concurr control effect proc acm confer comput support cooper pp nov manag algorithm distribut synchron groupwar parallel vol algorithm distribut groupwar proc intern conferenceon distribut comput pp share edit heterogen usenix journal comput pp order event distribut cacm juli tp design principl share whiteboard groupwar design ed pp window collabor proc acm symposium user interfac softwar pp nov lock ensembl concurr graphic proc acm confer comput support cooper pp nov mo prototyp groupwar design ed pp causal intent preserv cooper edit acm transact march sun transform realtim group proc acm confer cooper sun lock integr oper transform distribut group proc acm symposium principl distribut sun mainten group ieee intern confer distribut comput system pp june von grow cooper edit ieee internet
IR/33 5 evalu cluster techniqu find peopl centr interact system analysi nation po box denmark abstract typic larg knowledg held inform memori leav document link person broken mechan overcom broken link matchmak problem relat problem find potenti work partner larg distribut paper report compar investig standard inform retriev techniqu group base web page inform subsequ redirect broken link peopl work close depart highlight work similar topic paper report design posit result experi conduct nation laboratori compar ir search cluster approach real web page motiv paper address problem automat match peopl peopl base exist written document describ copyright paper belong author permiss copi fee part materi grant provid copi made distribut direct commerci advantag proc int conf practic aspect knowledg manag oct work peopl scenario form match main motiv larg amount inform larg project typic document held memori inform typic includ detail involv project consult problem project solv project document record final result arguabl import inform engin identifi peopl typic interleav search peopl search find engin search document find search peopl interact social inform engag explicit identifi document technic aspect chosen inform context design process typic peopl critic sourc inform explain argu specif made serv individu part problemat implic observ knowledg context project lost staff leav main aim work support find colleagu base automat record work kei document written jone left record work closest jone time document written colleagu comput scienc scotland md act contact point find peopl document project larg distribut highli peopl similar interest work similar project begin awar locat relat work carri depart background hope model present paper bring peopl similar research interest work area identifi major social implic move physic librari digit longer meet fellow research shelv prefac work support interact awar digit robertson state hub social intellectu interact commun virtual librari serv virtual librari focu simpli make hold nichol give short overview matchmak system link work comput support cooper work inform retriev descript work matchmak digit librari found nichol paper report investig inform retriev techniqu automat match peopl base web page result match highlight peopl work close inform highlight potenti collabor histor point searcher colleagu staff left compani paper start describ ir cluster techniqu describ result experi present discuss potenti extens model techniqu advent larg search engin world wide search techniqu increasingli find peopl base base similar research portfolio experi report target find peopl similar topic base test solut problem solut classifi simpl search approach cluster base match approach base index home page standard ir techniqu ir techniqu develop year support search document van rijsbergen search techniqu match peopl base index staff web page perform search base find similar web page user content user web page queri search staff home page result rank user closest user ui closest person defin content home page experi run baselin rank ir engin develop standard ir techniqu salton mcgill frake sparck jone willett implement java document index weight term proport occur current document occur collect jone simpl list base collect common word collect stem algorithm stemmer conflat variant word base walk conflat walk cosin match ir standard account term weight document length mcgill ir engin design index web index content bare omit html greater weight word titl page cluster cluster techniqu long ir improv perform search term time qualiti result jardin van rijsbergen van rijsbergen croft willett work cluster relev document document rijsbergen sparck jone work md paper investig cluster techniqu improv perform peopl match cluster techniqu balanc singl link cluster group averag cluster cluster algorithm hierarch agglom mean hierarch structur cluster creat start small cluster ad document merg cluster singl cluster remain cluster techniqu produc hierarch cluster similar user group lower level hierarchi singl link group averag chosen show significantli perform compar experi document retriev willett balanc cluster ad observ small cluster strong factor perform cluster algorithm balanc cluster balanc cluster approach user ui group user base similar node defin ir engin index approach baselin search pair tripl group similar group base averag vector group essenti balanc variat group averag cluster discuss group group pair tripl top level pair forc process pseudo repeat current set document recent set cluster calcul comparison insert pair list sort weight pair work list element assign record pair cluster element assign prefer higher cluster higher cluster pair higher cluster add higher cluster ignor pair assign cluster remain slow approach closest document group strongest match document cluster manner cluster document permit document lower pair rank list stronger link pair result hierarchi tight fairli balanc maximum node normal minimum singl node cluster singl link cluster singl link cluster base creat hierarch tree continu insert addit node satisfi node similar node insid node select strongest similar ad hierarchi level base strong similar approach fairli fast result hierarchi closest nearest neighbour lower level hierarchi lead cluster yield binari hierarchi comparison strength similar document link level hierarchi implement base pseudo code shown pseudo code base close reader direct complet descript hierarchi insert document place document maximum similar document hierarchi hierarchi document hierarchi updat nearest neighbour doc hierarchi md group averag cluster group averag link cluster base creat hierarch tree initi creat singleton cluster document mark cluster repeat cluster remain merg cluster similar cluster repres cluster repres vector document vector cluster singleton cluster make pair activ cluster form pair pseudo code implement base extract singleton cluster activ cluster left remain sim smaller larger index larger cluster larger group averag cluster slower produc cluster document produc binari tree close relat document initi pair group averag essenti pure version balanc cluster evalu consist comparison simpl list match document requir user user node uj hierarchi score base uj ui count intermedi intern node hierarchi path hierarchi leaf node figur list base smallest highest rank ui figur distanc user subsect describ detail approach balanc singl link cluster group averag cluster set evalu perform peopl find experi conduct base web page system analysi depart nation laboratori sad web home page staff depart complet test member depart form point close work person depart instruct box work close box work box work relat box work unconnect dont person prevent staff defin term closer definit match cluster explan term instruct term left total form return peopl mark form maximum standard deviat tick form max standard deviat standard ir recal figur calcul base md relev weight common approach simpli count relev document found definit test relev weight defin tick mark divid maximum number tick tick result highlight system find peopl user work close simpli work rank list match posit posit recal posit defin relev weight user total relev weight user relev weight user ui consist algorithm produc full rank user entri user collect bar individu recal graph combin standard defin van rijsbergen pp result figur show result algorithm show collect approach effect match peopl simpl search basic ir perform system good cluster group averag perform low recal region peopl match programm main impact substitut colleagu balanc retriev slightli poorer balanc hierarchi lead distanc group averag cluster recal level md recal group averag balanc singl link search figur result experi full list figur show result plot rank posit show tick rank posit tenth rank posit show group averag averag tick found rank posit worst straight achiev tick group averag success rate rose averag tick rank posit consid close colleagu suggest system rank posit group averag cluster balanc cluster singl link cluster straight search figur number tick rank posit examin resili approach store limit inform peopl user work close list creat match techniqu limit element evalu repeat monthli record close peopl member staff involv store record number figur show result drop perform method higher recal drop rang perform group averag cluster unaffect rang store limit inform recal point impli find colleagu result reduc storag recal search balanc singl link group averag figur result experi list limit entri extens document rare exist approach document retriev make hypertext network document found van rijsbergen augment home page connect document link page techniqu shown success improv retriev standard search access document index directli al provid usual benefit index staff home approach solv problem page home page experi fairli consist corpor style cv consist typic found problem frame base front page content base home page simpl front page link page drastic style qualiti quantiti inform provid techniqu bring sourc evid document written staff includ weekli common engin page user involv problem highlight experi report assess interpret staff complet data captur form vari react secretari list staff research colleagu depart manag worth investig classif method search rank posit affect match user roughli level place automat user home page common user drastic level claim investig motiv scenario work requir fast frequent cluster high qualiti cluster algorithm consid worth investig faster lighter compar perform test algorithm result experi show ir techniqu match user home page user find colleagu work similar area fair level success case experi report approxim achiev low level recal approach rank posit averag tick tick repres staff declar work rise total tick rank posit find close colleagu suggest system limit length list show store closest predict effect perform system low recal drastic reduc storag requir histor record experi compar straight ir search match user potenti colleagu cluster approach singl link group cluster approach perform group averag notic stabl low recal reduc length connect peopl base arrang approach creat singl cluster hierarchi depart rank individu arrang md individu person perform straight search work plan investig result corpor set sourc longer user test base approach investig improv effect cluster approach make amen highli variabl style home page visibl acknowledg due staff system analysi depart complet questionnair part evalu work project support danish research foundat centr human machin interact refer modern inform acm press multimedia inform phd glasgow comput scienc research report octob van free text inform process vol inform data structur prentic frei hypertext link retriev pp similar inform document retriev journal american societi inform sparck jone willett retriev hypertext practic search document inform process manag privaci digit strike confer electron librari visual inform research pp algorithm suffix juli sparck jone willett task orient evalu methodolog inform retriev inform virtual librari build commun share intern journal vol pp introduct modern inform extend scheme search inform hypertext inform process march sparck statist interpret term specif applic journal pp sparck read inform morgan support cooper work inform search em annual review inform scienc technolog inform van cj inform retriev van sparck test separ relev document retriev journal implement agglom hierarch cluster algorithm document technic report tr depart comput cornel juli md
DB/34 3 case map featur descript notat daniel abstract case map notat describ featur captur function requir term causal scenario bound underli abstract compon view prove descript wide rang reactiv telecommun system paper present interest construct benefit notat relat question user requir notat recent approv studi group lead recommend current research discuss introduct model reactiv system requir earli emphasi behavior aspect interact system extern world relationship intermedi activ perform system scenario good repres aspect stakehold understand ow distribut critic telecommun system repres complex reactiv system emerg telecommun servic featur requir industri standard bodi describ design increasingli complex protocol true wireless mobil user bring addit dimens complex recent upcom technolog base agent involv complex unpredict negoti commun model issu protocol entiti dynam natur evolv run time telecommun softwar engin research school inform technolog canada design standard telecommun system featur result design process frequent major shown figur stage featur point view prose tabl focu stage control flow entiti repres sequenc diagram messag sequenc chart stage aim provid specif protocol procedur formal specif provid sdl margin develop methodolog decad ago describ servic protocol isdn descript reactiv behavior natur telecommun system scenario mean model system function interact entiti stakehold understand gener intent technic detail stage requir stage stage msc stage inform servic descript stage messag sequenc inform stage specif figur methodolog protocol procedur due inher complex scale emerg telecommun special attent brought earli stage design process focu system function view detail belong lower level stage process member recogn improv process order cope realiti cite studi group evolut standard recent approv question studi studi period develop user requir notat base scenario object question develop recommend year question focu notat develop complement sdl uml captur user requir earli stage design design detail notat describ featur user requir scenario refer messag system compon reusabl scenario wide rang architectur alloc scenario architectur compon notat enabl simpler model dynam earli perform analysi requir earli detect undesir interact scenario uml activ diagram provid capabl area notat dynam refin capabl alloc scenario architectur compon requir case map notat offer capabl basic notat main benefit illustr section section present domain applic featur descript notat overview current tool support research direct case map basic notat element case map notat describ causal relationship bound underli organiz structur abstract compon figur gener repres task compon gener repres softwar entiti function network entiti relationship causal involv concurr partial order activ link precondit trigger effect postcondit result start point system req causal path compon figur simpl case map end point scenario figur repres simplifi call connect initi user req system check call verifi call parti busi idl case assum call request system statu updat result ring event occur bs side ring architectur messag path describ featur earli stage design cycl stage compon involv figur bind path suitabl structur lead visual integr scenario architectur singl view scenario path possess high reusabl lead behavior pattern util wide rang applic path figur bound altern architectur enabl earli architectur reason figur architectur figur convent architectur req req switch sn req figur path bound compon potenti msc path surviv evolut modif underli architectur scenario term messag exchang interact compon figur msc captur scenario figur term messag exchang straightforward interpret artifici messag ital user commun agent agent commun agent msc possibl deriv scenario path ring ring path architectur msc req sn switch ring ring path architectur msc figur potenti msc extract scenario time bound architectur complex protocol negoti mechan involv switch servic result multipl messag commun constraint shown prevent user commun directli servic switch involv relai refin causal relationship req extract scenario inform methodolog shown figur design buri detail scenario wireless intellig network standard attempt refer model due legaci descript version wireless msc scenario compon repres network element belong physic plane design alloc function entiti logic compon distribut function alloc function entiti network entiti lost standard specif map function entiti network vendor build network entiti map design inform scenario explicit view construct bound function entiti delai design implement phase lead multipl problem problem common standard issu relat commun structur evolut version structur abstract focu put reusabl causal scenario structur context scenario integr structur integr scenario altern concurr interest construct scenario integr dynam shown dash diamond figur static stub shown dynam stub multipl select determin select polici polici make composit order select select polici languag suitabl context plugin map describ local featur modifi basic behavior multipl level stub req sig origin default map pd timer map pb basic call map displai dynam stub figur basic call dynam stub figur show basic dynam stub stub includ default repres basic call react absenc featur origin stub origin call screen check call deni event prepar signal bind connect segment stub point deni call provid request made specif time interv person identif number provid invalid enter time manner path leav timer repres timeout path bind relationship featur displai stub call number deliveri displai number origin parti concurr rest scenario bind relationship ad featur collect achiev creat exist ad stub instanc exist select polici updat appropri stub select polici local place scenario undesir featur interact occur simplifi analysi prioriti featur sequenti prioriti oc origin stub spuriou interact featur avoid structur integr scenario proper context ring map pd condit oc map origin stub default map oc map map displai stub default map map select polici displai regist select select default addit notat element notat addit compon type type visual distinguish activ compon passiv compon possess attribut replic factor mutual dynam compon dynam dynam stub show behavior pattern evolv run time structur compon evolv run time dynam static role fill actual instanc compon time dynam move dynam compon path path combin synchron asynchron path involv special point path call wait place scenario path abort evolut path construct model except failur failur point repres explicit place path scenario stop reach end point robust address high level abstract point identifi perform constraint time requir goal tag construct goal relat scenario path relev descript agent system advanc construct descript discuss paper interest reader consult quick refer guid virtual librari user group inform featur descript notat case map number properti satisfi requir section scenario map variat behavior structur scenario structur integr increment facilit earli detect undesir interact earli evalu perform perform properti properti consid macroscop behavior pattern independ detail belong connect compon larg scale dynam situat issu made visibl glanc notat applic wide rang support topic research project discuss briefli section area applic case map suit describ reactiv distribut system featur histori applic descript featur telecommun system natur avoid detect undesir interact scenario featur earli perform analysi restrict telecommun system describ system domain airlin reserv railwai control agent network manag web graphic user draw multimedia bank softwar navig tool notat support navig tool develop carleton order draw tool support path compon notat found appendix maintain bind user navig web visit edit plugin relat stub level navig ensur syntact correct construct tool export import xml file valid document type definit export figur encapsul postscript maker interchang format comput graphic flexibl report gener postscript file readi transform hyperlink index pdf file multipl platform linux window current research figur navig screen shot research develop link case map notat order produc concret implement product featur function requir captur map uml sequenc diagram figur gener process formal autom navig tool hierarch state machin uml statechart diagram loto enabl formal valid detect undesir interact sdl enabl formal valid uml model research project includ gener perform model layer queu abstract test case tree tabular combin program languag notat evolv guidanc newli creat advisori board member industri notat enjoi enthusiast commun user successfulli featur descript notat domain telecommun reactiv system user complain lack formal semant work remedi situat possess attract construct concept consid featur descript languag multipl connect languag enabl creation design trajectori relev telecommun suggest introduct inspir requir captur architectur reason transform msc interact diagram state machin sdl statechart diagram final concret implement autom code perform interact test gener perform stage scenario popular practic approach design reactiv system notat enabl earli descript featur term causal scenario bound underli abstract compon paper illustr core construct main place common design trajectori show notat satisfi express question studi user requir notat notat evolv target research develop project industri partner notat senior design system possess good knowledg domain exist peopl detail surround recent emerg technolog describ desir featur design team understand refin confid notat level abstract address acknowledg work result collabor discuss partner ottawa loto user corpor nortel network indebt luigi rai encourag corpor nortel network support refer nb paper virtual method mobil proc ieee emerg technolog symposium wireless commun april wireless intellig network servic case brazilian symposium comput case map captur valid distribut system fourth ieee intern symposium requir june pp case map loto prototyp valid mobil group call comput ware descript featur interact analysi case map loto sixth intern workshop featur interact telecommun softwar system extens uml case map submit intern confer unifi model octob case map formal method develop wireless mobil atm nasa langlei formal method june ansi wireless intellig network addit modif decemb systemat traceabl progress scenario model commun hierarch finit state machin phd carleton august case map case map architectur entiti complex transact softwar decemb pp visual resolut agent environ intern workshop featur interact telecommun softwar system octob io pp inform process loto formal descript techniqu base tempor order observ behaviour recommend specif descript languag recommend messag sequenc chart question defin notat user requir canadian novemb applic case map system design tool support meng dept system comput carleton octob interact filter case map requir sixth intern workshop featur interact telecommun softwar system object manag unifi model languag version june behaviour case map specif descript brazilian symposium comput wc concurr option softwar seventh intern symposium analysi simul comput telecommun colleg octob pp uml commun octob pp case map web page user march appendix quick refer guid start point end point compon rout share common causal segment altern identifi label condit permiss rout assum identifi share rout interact path effect longer path constitu segment join end end synchron interact interact path effect similar path split concurr segment asynchron interact path interact static stub dynam stub multipl stub imagin trace path system object explain causal leav visual signatur case map captur sequenc start point circl repres precondit trigger causal chain repres function end point repres postcondit result bound entiti object system basic notat interpret wait path timeout path ground symbol path failur point concurr rout fork singl path variat continu clear path timer share gener version rendezv synchron join singl path singl path top path abort bottom path share gener passiv compon activ compon interrupt servic request agent system dynam compon data compon type move creat destroi copi creat dc path delet dc path movement dc data directli path creat dc slot delet dc slot move dc slot move dc slot creat dc pool delet dc pool dc pool put dc pool slot pool movement notat dynam compon multipl instanc mutual placehold dynam compon oper unit refer compon defin map compon attribut gt goal tag start end point goal agent system ts timestamp start end point time requir stub direct arrow path direct ambigu notat extens
HCI/35 4 user frustrat jonathan klein bachelor scienc comput graphic interact ann arbor june submit program media art scienc mit school architectur plan partial fulfil requir master scienc media art massachusett institut technolog student author jonathan klein program media art scienc septemb februari massachusett institut reserv certifi rosalind picard associ professor media technolog mit media laboratori referenc mit media laboratori vision model group technic report technic report updat accommod minor chang appendix accept stephen graduat program media art scienc comput user frustrat jonathan klein submit program media art scienc septemb partial fulfil requir master scienc media art scienc abstract comput technolog side neg emot state human interact comput anxieti similar emot state affect interact social thesi present idea design interact system activ support human user abil recov neg emot frustrat document describ tradit theoret strategi emot design interact agent built author activ reliev evalu show effect agent studi design test agent system built elicit frustrat human subject interact agent initi feedback strategi effort reliev emot state strategi design provid cue human listen emploi reliev neg emot control group frustrat emot support enabl subject report problem comput subsequ behavior data collect behavior result show agent significantli effect control reliev frustrat level subject result demonstr interact comput user experienc frustrat allevi neg state provid evid human benefit short term comput respond social wai emot implic work suggest wholli role comput human life sociolog ramif role discuss thesi rosalind picard associ professor media technolog comput user frustrat comput user frustrat jonathan klein thesi reader professor sociolog program societi mit associ professor depart commun stanford clifford nass moon assist professor busi administr harvard busi school harvard rosalind picard keen insight seemingli patienc effort media lab gener academ advisor great honor privileg time protocol design statist method make thesi project simpli studi debt sincer gratitud extend cliff provid time insight guidanc studi start piec implic live give privileg compani insight believ special shape thesi prior work laid groundwork friendship collabor made easier debt gratitud professor keith gener read canada sit give valuabl advic insight project terri read give great dr clinic gave ground feedback earli breath loui put touch incompar matthew invalu mention good critic stage build version experi softwar acknowledg comput user frustrat wild shape matt margaret assembl critic materi due professor jerom kurt fischer listen gave feedback eric provid spuriou transceiv invari find jennif serv independ coder data analysi bit time real make laugh code data roll put wrote thesi scott brave compani year lab valu perspect reflect focu scope thesi arthur shannon guthri support relief repeatedli feed wife absenc due kate david kelli doug kathi tom martin linda peterson support process elliot judi chri susann jeff michael bailei folk michigan point tom kei wit wisdom gratitud due mother mr marilyn petri late henri support time process support parent special sandra ignit interest psycholog emot place donald kaplan process wade lengthi thesi express deepest love wife ellen care suppli fresh perspect smile comput user frustrat biggest long tabl content comput user frustrat tabl content tabl content acknowledg chapter introduct chapter background emot theori function emot natur emot frustrat theori emot regul social approach emot regul social activ listen comput system frustrat chapter relat work comput system reliev frustrat comput system support emot commun comput program comput relat research activ comput support emot regul complaint human support activ machin support user media social interact comput user frustrat tabl content chapter theori object appli activ listen theori interfac design appli strategi emot regul support interfac design criteria object studi model protocol design model adapt evalu protocol overview chapter method particip note subject apparatu physic softwar technic design game descript game design interact questionnair casper agent control control condit condit casper condit casper repair dialog procedur recruit subject subject contact motiv subject run subject game delai condit condit interact questionnair subject plai game exit questionnair debrief measur data treatment video record consid data clean chapter result frustrat manipul check behavior satisfact level game control gender comput user frustrat tabl content control emot control game experi level chapter discuss discuss primari result manipul check success behavior result found unexpect result effect game floor effect found frustrat level low score condit statist data frustrat longer plai altern interpret result target chapter theoret practic implic theoret implic implic principl design practic implic illustr scenario corpor america design implic chapter sociolog philosoph implic main effect model meet human emot manag assist emot manipul trust imag mirror trust realiti mirror reflect comput sap wind sail absent empathi synthet situat work context approach comput chapter futur direct determin effect compon present studi comput user frustrat tabl content valid experi public repeat determin deeper effect genr chapter appendix subject experi materi solicit inform email confirm questionnair questionnair receipt confirm email remind night appendix subject experi materi script consent form game direct answer questionnair direct game exit questionnair debrief statement appendix data relat document frequenc distribut subject ag rang manipul check main behavior measur gender analysi trait analysi trait analysi experi analysi frequenc dichotomi analysi game perform analysi analysi time control analysi time casper analysi time casper control frustrat questionnair analysi questionnair effect analysi satisfact game code direct independ part code direct independ part question refer note comput user frustrat chapter background chapter introduct comput frustrat solut commonli heard author determin fix problem make prevent problem happen place solut view interact commun year norman problem feasibl insuffici approach ignor user import tend leav user feel feel neg system examin feasibl issu comput softwar hardwar design make system easier peopl mitig potenti sourc frustrat process evid comput grow number shrink move venu modern life human busi portion involv work directli comput system frustrat comput system abil frustrat user imposs task sourc frustrat comput system easili fight night traffic jam work comput user frustrat chapter background sourc frustrat interact comput system newer oper system version exist increasingli complex modern technolog build system accur determin frustrat equal daunt task requir constant surveil strong artifici intellig reason abil possess intellig human term human notori bad determin object emot human fix problem bring potenti modern life speed person control daunt task prevent emot approach nonetheless requir amount mention power mother troubl find fix frustrat year make comput lack major flaw approach address frustrat fact address critic aspect emot person experienc place problem spring origin state frustrat elev level person feel frustrat suddenli diminish abil attent memori retent learn creativ polit social interact frustrat futur impair abil find elicit solut frustrat episod interact comput system leav user feel neg system human treat comput recent demonstr neg experi alter percept cooper good faith part user experi import work relationship approach show hope effect address user comput fruit answer origin question comput address emot state address elicit thesi present evid comput system great deal support user experi hitherto evid suggest system leav user comput user frustrat chapter background feel posit comput system perceiv sourc frustrat place thesi author design built simpl interact agent softwar demonstr activ significantli reliev frustrat human subject softwar agent valid theori creat repres dramat leap abil comput system directli activ support kei aspect human emot system activ support abil manag regul emot person number side benefit agent agent interact interact user occur offic thing god make late file print frustrat file paper confer time dumb spot sound difficult print thing printer approach thing god make late file print hmm sound frustrat bob experienc frustrat printer yesterdai hei bob troubl output printer page sensor send max color output fix repair mondai comput user frustrat chapter background work scenario thing common exampl strategi interact time user experienc emot user feel combin direct comput system activ acknowledg address emot state strategi advanc artifici intellig servic strategi seek determin address emot state strategi aim support user manag principl number social psycholog crisi parent theori consum affair strategi illustr prove effect element approach comput refer comput offer user approach found mislead user present comput state exist machin abil comput discern frustrat research report emot experi privaci issu approach simpli prove ineffect user manag recov neg emot state find person prefer kind machin strategi illustr inappropri user question idea system address respond emot state repres import departur research practic work peripheri current theori hci reflect lack direct emot issu read current hci doubli strang import aspect experi continu larg commun underli hci research design belief peopl comput system capabl prefer perform activ inform wai system design implement peopl chang radic system design match requir comput begin recogn capabl relat user level human inform processor human affect motiv action complex system condit extent comput respond albeit aspect human extent comput user comput user frustrat chapter background major focu inquiri affect comput research group mit media laboratori address mismatch human explor comput system design support fact human work challeng area problem design system meaningfulli respond user frustrat thesi explor solut design construct softwar agent prototyp design reliev frustrat neg affect state human social commun model describ studi conduct test agent result studi show strong behavior evid devic success achiev goal discuss number side benefit genr hci frank discuss risk involv develop devic approach thesi deal emot percept experi affect state ensu elicit event work explor wai address state event event elicit state charg comput system figur user frustrat upset figur solv real akin solv problem machin remain open research scope thesi work demonstr comput support user manag emot state effect worthwhil mean improv product satisfact comput system describ approach review literatur emot frustrat emot regul order comput user frustrat chapter background emot theori chapter background emot histor present problem research save intern hidden view joseph ledoux antonio damasio made research map structur process mediat emot function human brain fundament open question remain emot interrelationship cognit process brain recent emot work function emot literatur emot theori identifi number function emot function emot function relev project list emot descript emot act intern extern progress meet goal fear act encourag person happi peac individu goal drive hunger act individu emot motiv human possess emot part meet goal harm emot appar motiv action neural path work level brain correl strategi deal environ sharp pain extrem yield automat reflex reaction stimuli loom object yield quick infant prompt freez complex emot act motiv abil meet accomplish goal anger frustrat motiv person confront impedi goal feel overcom fear act individu safe potenti danger fear emot serv motiv posit action emot commun emot express social commun natur human fundament comput user frustrat chapter background social infant reli complet meet birth earli continu reli meet vari life clear primari function emot commun state inform order enabl assist meet individu human learn great deal negoti negoti emot abil manag emot state section wide believ learn primarili attach bond child primari caregiv emot regul thought learn express manag emot commun state inform vital aspect emot natur emot natur emot remain subject disput emot theorist lang describ emot continu emot conceptu space emot attribut popular concept continu emot plane figur vector plane emot emot posit vector emot stimul excit person theorist ekman argu model emot discret figur identifi emot state disgust emot emot state gener primarili state figur continu discret emot figur diagram continu comput user frustrat chapter background emot posit horizont emot stimul excit person vertic axi pictur stimuli plane common reaction peopl figur simpl model basic emot ekman treat distinct frustrat theori emot share properti continu discret concept frustrat view discret relat strong neg emot state continu scale research frustrat begun behavior theorist earli work field involv experi anim behavior defin frustrat occurr obstacl prevent satisfact case interpret goal quot al frustrat thought subsequ frustrat event kind frustrat refer uncondit primari hypothet uncondit reaction frustrat event act creat effect consequ increment drive primari affect emot compon frustrat suggest behavior loop anim behavior observ reflect human connect frustrat anger relat state clear oatlei show frustrat common precursor possibl anger left level decai remov elicit environ bring level individu experi calm frustrat experienc frustrat frustrat stimuli exacerb level roof depend current stimuli person posit stimuli frustrat bother person stimuli elicit frustrat contribut frustrat practic social emot human find situat irish solut problem deem worth person experienc comput user frustrat chapter background frustrat find feel frustrat accomplish goal common person problem grow emot reaction person challeng stimul problem emot state emot reaction prove obstacl person initi problem human possess skill strategi emot mediat frustrat level vari emot regul human routin emploi emot regul live emot regul skill modul manag emot make low low high anger critic skill human gener emot chang situat face upset oneself stimuli emot regul human motiv achiev goal emot emot identifi primari compon emot set essenti emot develop argu correl success life iq cite human manag emot state vari depend specif thing emot free attempt manag failur manag emot profound rang product inabl pai attent injuri cooper human relationship due express person stress sever depress health problem chapter excel peopl varieti method manag emot includ intern strategi extern interact media engag food substanc drug strategi simpli origin person comput split opinion psycholog benefit unconstrain call psycholog outlin pp emot research argu calm suggest serv exacerb make angri comput user frustrat chapter background defin varieti support emot passiv activ passiv support peopl manipul address discuss emot includ food substanc interact peopl fall categori engag activ sport strategi emot plai game interact serv person moder emot discuss case neg emot state peopl turn kind support structur famili manag emot state peopl serv activ emot regul support activ support occur peopl address discuss emot mean manag simpli manipul indirectli talk parent care friend make person engag activ support social approach emot regul activ emot support peopl serv multitud posit impetu social bond build emot skill net effect social interact time emot upset person overcom calm feel life abil manag emot regard import compon interperson commun commerci airlin pilot describ reason project delai appreci apolog affect approach manag expect manag develop emot regul skill cry child calm attach figur adult plai team coach confid peopl ag greatli fear seek interact comfort feel social activ listen activ listen myer provid feedback upset focu provid feedback emot content activ listen root social ch school adopt comput user frustrat chapter background practic research parent theori gordon argu children experienc neg emot experi quick relief recoveri activ listen activ listen found effect adult children alik area crisi crisi manag educ consum affair corpor venu activ listen effect strategi reliev neg emot state correctli reliev state quickli effect activ potenti literatur parent theori burn burn finger hurt finger burn hurt hurt terribl bad burn feel burn real bad hurt put ic make put activ listen consist number attribut contribut efficaci wide varieti situat compon enabl individu encount emot distress feel person knowledg feel feel feel feel presenc sincer strong emot emot feel emot state normal accept situat ingredi activ emot state effect commun true import reason commun emot convei inform current state feedback confirm accur recept state inform provid measur relief comput user frustrat chapter background effect activ ear reassur quickli turn neg emot human spend amount time interact appar time peopl live todai fifti year ago place human peopl spend amount time interact home qualiti interact comput qualiti interact comput smooth comput system frustrat tacit aim design minim amount frustrat user experi system effort interfac design huge gain speed comput hardwar user frustrat grow shrink peopl longer hour trend comput softwar system grow sophist order compet market market pressur insist product ship shorter shorter develop cycl preec complex system thick user manual provid relief word henri famou chronicl invent amaz achiev comput softwar industri continu cancel steadi gain made comput hardwar comput learn local comput system contribut user usag slow network traffic speed incomplet resourc world wide web issu user ag mount pressur product thing user destin experi frustrat comput effort ui design effort user frustrat happen place lose battl light logic hci research acknowledg user experienc frustrat comput evid experi futur continu work hard minim elimin elicit condit user begin explor design strategi enabl comput reliev frustrat elicit strategi leverag comput user frustrat chapter background knowledg social scienc interact inform interact design project repres step emot humancomput interact thesi argu comput support manag human emot state frustrat activ emot regul support strategi prove effect commun user requir time passiv support evid discov result thesi project strongli support present chapter comput user frustrat chapter background comput user frustrat chapter relat work chapter relat work comput system reliev frustrat current comput system capabl offer number tool aid human manag emot passiv peopl manipul address discuss emot multimedia comput system capabl plai displai humor comic strip anim engag user wide varieti interact game media role manag emot peopl routin chang mood network comput user commun peopl internet relai chat text read type slight enabl user peopl manag emot media support user manag emot peopl seek automat offer system abil media role limit corpor rule frown plai read exchang email watch compani time email interact method offer limit emot lose channel express found tactil audio make difficult commun emot effect theoret avail passiv comput comput user frustrat chapter relat work offer activ support person emot regul human emot machin liter deaf dumb comput system support emot commun comput built specif task activ support emot system built commun user wai involv form vari mean emot commun human exampl suggest design space system built joseph mit late commun user natur languag textual user type sentenc respond system emploi simpl techniqu borrow activ listen section present intellig repli automat case intellig wide varieti thing user includ word phrase typic charg achiev intellig simpl word word match algorithm state build system sole explor natur languag appreci peopl wildli popular entertain research emot support system mean user talk system diari human sound elicit emot content engag dialog emot comput program life wrote phenomenon comput softwar natur languag bring posit chang psycholog health depress sought bring chang seri regular natur user model system base cognit alter neg behavior thought pattern matter provid inform user thought effect act present cognit therapi comput tool support system depress design engag emot compon interact system charg perform depress packag comput user frustrat chapter relat work natur languag interact influenc directli indirectli system discuss chapter comput relat research comput system recent built support form emot connect user recent phenomenon comput pet pf made foster form emot commun enabl user give affect stroke virtual bodi plai game virtual creatur provid emot user interact arguabl fall categori passiv support emot bit product beep attent algorithm determin attent requir user fulfil role emot regul support comput creatur model emot assist young remain matter futur inquiri gener interact toi vari emot commun user plan futur barnei commun affect young primarili form affect appar attent child interact similar tiger electron schedul year appar design uniqu kind relationship specif detail sketchi capabl address affect state neg design system number compani research laboratori recent work project involv emot emot commun emot synthesi corpor develop robot capabl pur perceiv stimuli user corpor mit robot laboratori work robot dog featur system mean emot express sensori capabl number project mit ai laboratori aspect emot commun build robot breazeal system built attempt emot commun mean recognit express emot clark affect reason interact human multimod audio emot model system emot exhibit abil aim achiev work comput model creat multimod interfac comput user frustrat chapter relat work smooth interact human goal elliot interest make system relat human emot affect reason show achiev level emot sensit interact user goal emot manag simpli emot interact mic muse attempt multimod emot albeit algorithm system attempt simpli mirror identifi current emot state discret graphic graphic music hara team built femal robot head recogn discret emot express main goal hara work appar creat robot human make feel comfort read emot express affect muse robot involv emot regul show potenti platform activ emot regul offer support activ comput support emot regul complaint human support internet site creat user angri frustrat product servic complain public site includ internet newsgroup websit peopl site offer user abil publicli complain frustrat experi product user similar experi reinforc origin complaint site enabl user address frustrat specif engag public system offer effect strategi emot due asynchron mix opinion section emot regul chapter result thesi studi chapter includ interact initi requir time make convinc case write activ machin support user matlab older version mathemat softwar packag produc user type popular command applic respond relev randomli chosen list place function disabl version note effect replac colleagu recent told undergradu student mit work matlab graph problem frustrat point comput user frustrat chapter relat work problem matlab syntax fit unawar bob type word matlab command line machin respond place bob mood chang instantli utter frustrat unexpect word consid formal element program long ago document absolut address problem elicit frustrat neg state suddenli dissolv bob intrigu investig happen enter word word elicit similar bob plai featur contact friend share revel hidden settl back work sudden disposit experi expect discov unexpect gave thought plan fact remain experienc emot reaction seemingli intract bob made bid commun state softwar reaction simpl string system write screen user type string bob relev frustrat emot peak bob express feel state simpl hack produc compon feedback found activ listen section feedback emot acknowledg relev languag interpret messag neg emot state understood humor remark argu event repres pure passiv emot manag support possibl exist connect program intrigu possibl remain compon activ support part sudden chang coincid interest plai settl back work matlab interact design maintain explicit goal activ support user manag emot state thesi investig machin activ effect assist manag emot state human neg emot design system interact affect approach comput user frustrat chapter relat work media social interact recent work clifford nass byron reev stanford suggest peopl displai natur relat machin peopl reev nass show human relat form interact social rule expect deal peopl studi reveal user respond comput media polit collabor thing extent appli human relat comput media reev nass show human accept machin uniqu social activ experi involv build good spell reev real substanc role comput plai user shown prefer system make feel virtual indic system knew mean user feel comput user frustrat chapter relat work comput user frustrat chapter theori object chapter theori object drive thesi media equat end phenomenon extend person area social interact assist emot regul phenomenon involv strong emot discuss emot user experienc comput system reliev frustrat user mean activ support emot hitherto assum uniqu social comput system emploi activ support techniqu make frustrat user feel comput sourc problem machin capabl empathi feel system built exist requir strong ai approach wai address human social feel emot state acknowledg feel understood upset system make plain acknowledg emot content feedback akin primit form activ listen chapter user manag emot skill comput user frustrat chapter theori object human listen quickli user chang emot feel make peopl feel comput busi begin answer specif comput system servic provid kind author hitherto refer activ support person emot casper inform strategi casper agent literatur number disciplin social clinic emot parent research empathi crisi principl consum affair literatur industri goal interdisciplinari research discov effect strategi facilit person emot regul social emot human seek author sought determin human accept media human relat comput media equat peopl comput partial activ support human emot manag appli activ listen theori interfac design compon activ listen design provid activ support emot manag order build guidelin design interact interfac engag activ comput support emot system activ solicit inform emot state feel elicit problem cognit assess queri serv part acknowledg user emot reaction stimuli solicit occur user upset benefit support system offer activ listen ineffect situat user simpli commun inform import system ensur engag dialog interest relev user term address emot state person experienc emot time address emot state fact hour address chanc mushroom approach interest relev futur system frustrat typic involv long decai secondari comput user frustrat chapter theori object make feel peopl frustrat stai long period fact time constraint task instant good time provid support interrupt strategi desir case initi support dialogu initi talk rememb benefici system system proactiv initi dialogu user system requir mean predict high user suggest autom system make user express feel solicit emot feedback user feel provid choic read sad sad neutral happi happi recognit recal relev emot state user vocabulari hand describ method describ state user multipl select emot express discret user frustrat angri simpli list emot state includ option text field user enter descript feel provid emot commun user emot state effect ideal user commun support agent convei idea string word phrase back repair feedback judg wrong step critic activ give individu chanc clarifi initi make feel state accur convei listen time high languag easili fail convei time import person convei situat state accur commun empathi user put comput capabl understand simpli make user feel subject feel salient dynam person emot regul support actual feel support agent ultim interact true human machin train human activ listen enabl interact comput user frustrat chapter theori object attent drift client person client feel listen feel session success effect client interact feel listen understood implic kind human long term discuss chapter empathi consid primari import effect activ care design impress empathi commun comput human convei user term interchang mean subtli conceptu messag empathi understand messag feel lesser empathi activ arguabl import compon critic attribut activ listen feel emot state accept hard achiev easi achiev care maintain feel trivial natur person problem attribut feel appli problemat interact term authent interact topic discuss greater depth chapter convei user emot state comput commun user feel situat note sentiment empathi impress convei share similar understand eyebrow head nod listen feasibl believ comput system commun limit text wai comput commun appar sociolog judgment matter simpl system deal complaint simpl statist analysi gener believ statement feel peopl simpli report problem describ feel extrem appli strategi emot regul support interfac design comput user frustrat chapter theori object compon activ listen prove effect method provid activ emot manag strategi prove effect speak angri consum affair repres emploi varieti interest strategi illustr ten strategi akin activ acknowledg emot show empathi listen strategi includ albeit accept place blame model servic relationship underli affair interact share common current tradit humancomput interact strategi emploi casper albeit care sensit ensur capabl matlab arguabl emploi humor servic support emot manag effect mean lift spirit suggest section peopl humor show servic passiv emot manag support al stanford found human respond social machin design express humor humor effect machin activ support remain humor vari greatli person appropri humor rang wide situat sourc literatur shy humor gordon possibl remain humor prove effect support strategi requir approach test effect studi natur strategi easili implement softwar exist method strategi reach technolog automat recognit emot explor efficaci strategi conceal pretend repres simul interact capabl demonstr sensit empathi interact subject approach empir sound method interfac design test criteria object studi comput user frustrat chapter theori object idea thesi build interfac agent provid test agent human user experienc support present order test casper agent repeat protocol carefulli random group human subject put frustrat result situat feel notic level frustrat agent implement casper theori interact attempt enabl user recov frustrat short order measur effect agent subject protocol provid comparison effect agent frustrat effect stimuli typic comput support strategi research argu prove effect emot order establish efficaci casper effect agent compet user feel determin involv emot tricki busi chapter import function emot social experi seek elicit emot repeat human interact subject repres host variabl interact style express imposs control emerg effect human interact tightli control exact repetit offer excel mean control provid exact stimulu subject ideal subject encount frustrat human contact challeng experi involv emot problem part social natur emot intim interplai emot cognit person feel frustrat elicit emot authent order subject experi authent emot altern mean standard strategi social scienc commun blind leav subject dark natur creat cover stori make conduct studi test model protocol design limit human contact good cover elicit emot reaction human predict small comput cover stori theori section frustrat theori chapter al creat protocol pilot studi frustrat human subject comput observ physiolog comput user frustrat chapter theori object scenario subject recruit plai told game visual test game simpl visual puzzl subject told complet quickli accur subject paid told fastest win subject began plai seemingli random delai built made malfunct subject comment read side administr stick subject incent achiev thwart achiev goal baselin condit studi compar measur experi major subject felt frustrat delai model adapt scenario serv model elicit frustrat present import differ present investig sought frustrat level lower control frustrat level deem practic administr room subject experi subject physic tether apparatu prior bodi connect wire chanc subject find administr encount subject deem great action invari skew result appar hardwar problem cover stori design studi pose great subject assum problem easili remedi decid problem implement mention world wide web credibl sourc frustrat recent due unpredict network slow load time joke www stand wide scenario method choic system believ remot reason cover stori carefulli craft support appar circumst felt game protocol pattern studi wise initi success freez delai game occur seemingli seemingli random interv attribut web order make believ cover game research mit media lab subject plai fit criteria good reason research peopl plai comput user frustrat chapter theori object stori studi fit web element opt cover stori revolv idea prototyp kind kind internet protocol game act raw featur element design interest lab conduct test evalu protocol overview measur criteria determin effect casper agent simpl complet simpli subject felt life simpl social desir problem human tend shy describ intern wai convei attribut make lose make social desir human tend notori bad accur assess feel bad determin sourc reason feel reason excel review emot long social scienc research stori import aspect human emot import element shown damasio thing stop jump object rush emot affect action wai person simpli find reason behavior fact peopl reason peopl vari greatli psycholog commun reliabl indic reason decid studi reli behavior data gather protocol collect data subject goal incent email script administr read direct plai game comput plai hard fix amount time win prize top score answer question screen subject interact casper agent interact user masquerad plai game game count prize player plai game quit time minut fill paper questionnair felt plai game long emot comput user frustrat chapter theori object point experi exit appendix behavior measur focu studi time subject spent plai point score game metric frustrat sit plai game bit tediou excit plai game confirm descript discuss descript game chapter found appendix frustrat theori outlin subject feel frustrat impair abil pai rememb layout maze subject experi frustrat subject feel high level frustrat plai game score fewer player feel subject feel frustrat interact agent plai game score rate experi feel frustrat subject feel frustrat rate frustrat level satisfact fun level feel frustrat literatur suggest aid human recov strong frustrat assist calm feel peopl simpli encourag neg feel rise surfac long person remind situat began run simul event complet initi affect huge varianc walk feel simpli remind frustrat maintain build frustrat level effect elicit event author heard studi directli test manner expect behavior measur reflect number measur remain middl spectrum hypothesi differ casper agent gender emot frequenc game plai number research contend women pai attent interperson commun relationship higher sensit casper agent higher success rate women men trait establish measur proven collect mean roughli correspond emot posit individu event subject score high trait expect affect comput user frustrat chapter theori object toler plai game experienc frustrat delai game support emot regul support casper subject high trait expect feel plai game longer season game experi plai game accept appar web analyt invest season game player affect casper agent expect plai shorter time game comput user frustrat chapter theori object comput user frustrat chapter method chapter method studi consist experi tabl protocol document approv mit human subject pilot protocol prior studi investig human blind subject mislead intent made awar experi complet multimedia comput system iter test perform specif situat tabl condit experi control questionnair questionnair delai game delai game condit condit condit condit comput user frustrat chapter method particip casper questionnair condit condit human subject recruit note subject actual order account includ male femal condit femal tabl page ag rang median ag subject note male appendix children mit faculti staff subject mit undergradu number graduat student occup race note administr extent categori vari data offici record studi prior experi plai comput game comput game averag deriv frequenc relev comput game experi score random distribut curv figur rang experi plai game life plai time week note subject figur distribut ag rang subject subset recruit subject particip preliminari earli version requir comput user frustrat chapter method refin condit usabl remain number experienc rare bug final version softwar made game electron log file data due crash bug due administr error subject particip neglect subject data withdrawn state advanc consent debrief person reason figur distribut relev comput game plai subject figur repres result combin frequenc comput game plai frequenc plai comput game remain subject data omit final studi order homogen sampl count condit subject omit studi chosen chronolog subject particip reason report extern motiv plai game amount suspect command english order understand respond larg number written spoken materi subject remov condit surplu command english comput user frustrat chapter method extrem arriv particip friend offer act explain subject visit china offer interpret treatment subject accept question demonstr inabl understand question suspect subject found subject remov condit surplu subject run condit suspect subject found subject remov condit surplu report lunch reason plai long femal condit report extern motiv plai amount independ coder rate question exit plai game long type option appendix text direct subject remov condit surplu subject run condit suspect subject found apparatu figur schemat physic experi comput user frustrat chapter method physic experi place confer equip oval confer equip larg monitor vcr push minim decor figur singl video camera soni mount tripod record subject interact system side camera record measur screen primari hardwar system consist appl power macintosh tower equip upgrad processor board mhz processor mhz mb dram mb sole output devic appl multipl scan displai thousand color resolut input devic consist standard appl extend keyboard numer sole mean interact standard appl design bu keyboard object tabl includ studi suspect game commun remot due appar activ skill ear detect earli reveal weak step minim effect origin situat monitor move floor tabl partial occlud view subject subject includ final studi minim effect sound hard disk activ case suspicion due hard drive suspicion judg believ hear part internet commun protocol cover support cover ethernet connect consist cabl connect transceiv box connect comput cabl outlet mount view subject outlet connect cabl ethernet connect network comput made led indic transceiv box conspicu dead cover stori subject mit solut simpli turn transceiv box led face floor administr present room subject experi room tightli action room believ subject time inclin examin transceiv box close cover stori prove effect softwar softwar system consist game system simul web browser accompani delai comput user frustrat chapter method questionnair casper interact agent mean record relev questionnair answer element system construct author director platform develop interact multimedia system made heavi program languag system repres major redesign earli version built larg matthew undergradu comput scienc cognit work number element earlier design adopt final system technic design game game author design built simpl scenario charact seek treasur ly maze path game featur graphic execut anim sort support cover stori main anim render design view render orthograph support view paradigm perspect enabl move flat nearer camera main artifact game render anim extrem macintosh figur charact design game design simpl featur design support cover stori provid target satisfi studi reason conduct research environ media lack theme search collect design make appeal women effect typic game femal subject comput user frustrat chapter method figur main artifact game render anim extrem macintosh charact construct anim packag walk turn bend pick thing direct model anim complet charact render camera light scheme made charact turn bend perspect render imag brought adob power batch manipul silhouett compress imag imag import director scheme anim walk charact move direct diagon charact stai stationari center move world mean element world flow scenario afford user complet control charact provid system mode scenario improv origin movement paradigm charact react world slowli scroll charact screen opportun design charact trap prove risk unplan similar delai condit game comput user frustrat chapter method descript game game support cover stori detail script read subject began plai appendix game charact flesh world due stage lack music sound rich graphic subset thing charact finish featur implement ensur experi game engag subject feel compel plai long game subject report exit questionnair game figur exampl movement note charact stai center screen move world drawn move game simpl user press start button direct time counter read start iter subject numer kei move charact world direct layout provid ubiquit background graphic movement constrain occur connect form matrix top feet unabl step path form complex small portion maze visibl time kind treasur found charact point cluster found dead end charact piec bend piec treasur disappear score updat reflect state page element game bit correspond real bug program game maze softwar realiz seri interconnect room path led form maze bug involv flicker insid oval comput user frustrat chapter method center game time charact pass room effect slightli disori slightli difficult track path maze bug serv support cover game subject condit experienc consid factor experi bug involv navig charact hard corner charact stuck appar reason failur charact stop move fail continu move direct kei turn move charact intuit direct corner solv problem experienc subject bit troubl bug involv make subject feel charact similar effect appar prove issu includ direct game problem mention conspicu subject experienc charact respond delai problem estim make impact studi game design minut collect treasur entir maze maze path section section connect middl number section charact backward point trap escap navig maze eventu bit pathwai narrow type gradual escal challeng typic comput maintain interest measur intend maze hard navig visual great cost back path memori asset perform game frustrat rememb score point amount time player charact time chang turn natur arm swing time bend pick piec movement pick ubiquit favor discov treasur charact move slightli faster diagon walk angl phenomena meant found mean intellect game frustrat creativ discov phenomena comput user frustrat chapter method adapt score point player feel frustrat design interact questionnair casper agent number thing kei differ similar condit featur function began exact function dialog box multipl frame advanc text tandem seri label radio blank text field subject enter question button bottom mean advanc identifi input current screen accept screen radio button text subject chang mind input edit text select radio button button bottom screen press condit began ident content content screen comput question game note question comput import voluntari feel free skip question describ radio button ag year year radio plai comput game video game radio button label rang hour subsequ frame differ depend condit tabl page list question user group condit common condit design amount time control comput user frustrat chapter method length time game game time subject spend approxim kind activ effect found casper agent attribut differ time subject interact method time complet base total number similar question previou similar label previou question casper estim time complet base number screen text typic number vari depend amount repair dialog assess screen repair subject encount figur page diagram interact flow casper agent control feedback cue emploi adjust fact casper condit dynam subject base subject control questionnair similar cue tabl subject condit experienc inform control condit subject condit answer question enabl report problem describ felt experi user radio blank text field mean user word describ experi reaction permut game plai fourth frequenc plai femal main question support cover stori question main visibl question event estim relev question frequenc visibl treasur item final question top pick subject implement game male charact femal monster subject instruct game displai condit screen condit ident control condit question includ question frequenc game plai femal main rest question differ control question specif design enabl subject report relev problem network describ felt tabl comput user frustrat chapter method question worst speed smooth network big affect frustrat plai thing frustrat frustrat felt life plai satisfact experi result satisfi satisfi felt plai plai game make feel felt plai fun plai fun fun plai comput user frustrat chapter method femal male ten plai regularli havent time hour scale scale scale scale visibl charact charact list list game interact interest main charact wear abil die back male charact femal pursu featur list control femal male ten plai regularli havent time hour scale scale scale scale worst big frustrat life plai frustrat scale scale place scale enter text larg field femal male ten plai regularli havent time hour scale scale worst big frustrat life plai frustrat comput user frustrat chapter method comput user frustrat chapter method experi plai game make feel angri angri felt plai describ reaction text subject report thought estim relev problem encount interf sever sever impact experi prompt describ intens level emot vector estim relev experi encourag report mind text field casper condit frame condit ident screen frame prior condit question omit balanc tabl question frame ident question frame condit frustrat plai thing point casper agent assum control questionnair figur diagram flow casper reduc screenshot agent base question casper agent respond sentenc descript focu emot content subject report feel frustrat rate agent sound felt frustrat plai game subject press system respond repair enabl subject refin correct assess mean relev radio displai design subject report feel frustrat feedback read sound felt mildli frustrat plai game repair dialog radio button correspond subject feel frustrat frustrat fair amount lot lot subsequ state design mimic natur make figur agent maintain integ variabl correspond estim frustrat level subject initi report feel frustrat level elect repair dialog amend answer bit frustrat variabl amend estim feedback screen point subject press system respond feedback comput user frustrat chapter method empathi base final frustrat estim number system record sound thing hear game wasnt terribl frustrat yield initi sound felt terribl frustrat plai game subject press button subsequ screen feel fun plai simpl experi control comput apolog part give casper repair dialog repair dialog offer apolog grew magnitud subsequ idea role facilit abil subject express feel frustrat screen repres point agent fail provid feedback repair entir function repair screen acknowledg probabl level frustrat level assum mount success failur part system suppli accur feedback estim subject repair expect repair grace resolut agent enabl subject express feel word apolog repair screen describ radio comput difficulti accur describ state give base attempt describ radio accept comput sincer apolog accur captur feel comput user frustrat chapter method peopl typic feel kind thing situat describ feel text subject casper condit present question text field ident condit procedur recruit subject subject recruit post bulletin board mit campu copi page appendix simpli suggest automat enter win plai descript simpl mit media lab evalu kind comput game walk hard chanc win natur studi import maintain cover subject solicit media laboratori build subject work build subject casual inform screen particip knowledg natur belief cover stori subject inform interview debrief confid cover high subject voluntarili respond contact contact inform print stub bottom subject contact subject respond email email give broad detail game particip cover includ monetari request suggest time subject told part studi involv fill send back email questionnair contact questionnair email appendix subject respond phone verbal version schedul arrang made receiv email questionnair email question natur research deflect blanket import subject fresh hold question questionnair trait inventori anticip natur question person inventori appendix odd person comput user frustrat chapter method experi evalu precaut natur questionnair incorpor cover simpli state email person order properli evalu reaction game email order gaug evalu idea time effort mitig effect subject email trait inventori dai advanc case dai subject return questionnair dai return questionnair hour particip subject access lab fill questionnair hour particip fill questionnair return administr wait brought resid dai advanc subject return confirm note subject remind email phone call email exampl email end appendix motiv subject order induc strong frustrat motiv game critic factor number social monetari incent chanc win top game psycholog social incent built cover stori support materi point subject began plai game contact subject told intellig matter novic game player smart chanc win experienc strategi meant accomplish add incent perform accomplish intellig baselin confid level novic experienc game player verbal script administr read subject elabor clarifi appendix text subject told game experienc plai averag hour test game peopl pick plai game live found novic player intellig head game experienc reli reflex normal reflex smart person good chanc instruct game subject remind read subject told comput user frustrat chapter method rememb higher greater chanc win reflex intellig plai make intellig choic compet student mit plai intellig good subject social incent told prototyp develop plai real game situat order good player feel finish run subject minut subject comput system check make oper system softwar program condit set condit plan allot condit set condit time tend run begin studi condit run evalu differ frustrat level show delai condit subject arriv greet told friendli natur subject seat administr sat seat feet subject payment number consent script administr read subject appendix content note script design add substanc believ cover time assist motiv subject plai attempt subject subject affect state posit valenc moder emot time sit plai script subject introduc world comput game develop describ role subject plai built prototyp comput game work feel administr aim studi test internet commun protocol told speed graphic slow game built faster fast modern comput game intent ensur game invit fun script speed season understand subject condit report high level frustrat speed script adapt describ speed issu baselin expect slow script game earli lot plan game implement stage kei comput user frustrat chapter method time begin evalu game import criteria provid subject good reason game simpl excit motiv give titl subject told plai hard order simul game monetari incent motiv counteract effect fact game stage experi eventu subject remind game base intellig smart passag intend baselin confid novic player descript real possibl make desir win encourag idea win intellig strong motiv rank mit student descript structur experi game system present casual remind read set direct game game subject told specif differ game front order ensur administr bia plai game long decid subject read expect contact human subject present payment present subject order bia initi affect consist mildli posit improv receipt gift form consent form read includ separ consent form video footag particip sign subject polit follow administr administr turn video camera subject sign video consent remind subject screen good administr close door subject left read direct game game subject sat find window bare overlap macintosh desktop figur screen shot subject menu bar grei window window button unfamiliar applic icon side menu bar window activ overlap grabber bar activ titl paragraph text button comput user frustrat chapter method window netscap browser window game insid url web support cover displai server media lab server entitl plausibl work titl protocol internet commun titl game lost displai background graphic figur file term small version number line knowledg cover stori told test akin alpha subject read direct game appendix plai game game mount told finish point gather treasur incent told comput stop game automat minut told click netscap window highlight press start button readi subject plai game detail section delai condit game approxim half subject subject delai experienc orchestr sever web delai subject delai condit experienc exact occur random random amount time comput user frustrat chapter method figur screenshot entir screen subject time enter chamber appar delai design simul real web netscap logo larg size begin anim frame typic speed anim legend bottom netscap browser contact host typic messag displai netscap connect displai server url field subject unabl move charact kei work subject function frozen screen timer continu iter plausibl scenario subject element game mount local inform element mount network comput user frustrat chapter method schedul delai delai begin interv plai delai game delai note delai design frustrat context delai occur game delai occur delai end end game delai fast delai total delai occur delai game end subject report close treasur plenti time unabl reach collect treasur piec frozen delai condit half subject plai game delai interact questionnair subject direct screen appendix begin answer question back instruct grei text netscap browser window question subject answer differ condit row tabl begin chapter design detail design interact questionnair casper agent section subject plai game subject condit shown led summari assess perform game figur rig altern featur text score game time game effort equal confid level subject plai game text offer assess game comput user frustrat chapter method subject subject confid plai game assess project affect fear perform badli game statement greater boost figur game perform summari direct game subsequ direct subject plai game screen dump direct appendix plai amount minimum minut player told research test strategi internet game plai told time plai score count prize version inform subject told quit button game window grai enabl point subject told quit time game automat stop subject inform plai full entir particip studi minut player feel pressur plai longer free plai long subject plai game game maze game game began gener area maze game left delai exit questionnair debrief game voluntarili dialog box screen notifi subject leav find paper exit questionnair subject appendix administr led subject desk pen number comput user frustrat chapter method number consent form fill exit question end chapter subject hand debrief statement appendix read told administr happi answer question subject read varieti subject rang complet great interest research complet express note score achiev subject delai condit game expect lower compar fair condit dispar address award prize top condit award scheme part cover told subject debrief measur measur emot trait measur inventori establish form email questionnair fill return subject advanc particip section entitl overview end chapter visual record video camera record interact entir time chamber gender record log direct question ag rang record log direct question game experi level measur collect data interact questionnair game record comput log measur involv question frequenc subject condit question plai comput game video game plai graphic adventur game graphic behavior paramet measur comput system record number subject plai game final score game log file felt exit estim subject felt enter immedi game comput user frustrat chapter method immedi answer interact immedi game frustrat level satisfact level level fun level anger level subject game game plai game long questionnair game made feel data treatment video record consid data consid studi behavior measur video record present captur varieti auxiliari mean data behavior measur yield substant behavior result obtain obviat analysi illustr make present research commun show visibl auditori reaction mean constrain subject action run presenc room intend foster act inhibit curiou subject examin hardwar act cover stori data clean data clean standard practic social scienc make data uniform research commun data conform priori push limit author face similar resort conserv protocol data conform comput user frustrat chapter method outlier control data fit criteria alter standard data standard deviat consid outlier outlier note comment field cumul data automat convert professor reader note research maintain standard outlier point conserv sd standard sd standard wide held conserv figur deal extrem case data clean uniform subject group size advic professor moon subject condit group trim make number subject group homogen men women total subject group surplu group trim subject section begin chapter criteria crop subject group comput user frustrat chapter method comput user frustrat chapter result chapter result base anova plan orthogon comparison conduct test adjust inflat level multipl comparison result base test frustrat manipul check manipul check perform confirm delai condit produc significantli frustrat condit exit particip respond frustrat feel immedi plai game anova appendix reveal particip delai condit rate frustrat level significantli higher game particip condit statist anova determin statist ration variabl actual probabl make type effect respect variabl behavior kei predict experi subject experienc high level result plai game delai comput user frustrat chapter result feel relief feel experienc casper comparison control condit lesser condit base improv affect subject expect feel posit affect sourc game comput system plai subject condit predict plai perform score subject condit result support predict anova appendix reveal main effect main effect plan orthogon comparison particip casper condit plai game significantli longer time particip control condit appendix condit appendix differ behavior particip control condit figur figur time subject plai game type delai condit plai minut comput user frustrat chapter result figur score subject talli game type delai condit score found highli correl time plai main effect particip delai condit plai game significantli longer time particip condit interact effect respect variabl plai time delai condit consist higher condit reason phenomenon discuss chapter analysi conduct test hypothesi subject casper condit alert game score point amount subject control condit frequenc dichotomi analysi conduct analysi varianc conduct frequenc dichotomi analysi result independ variabl analysi time task conduct main effect found score found highli correl time spent plai game found higher time plai casper condit condit comput user frustrat chapter result satisfact level game suspicion end chapter reason measur satisfact level game exit reflect report benefit interact casper contrast interact questionnair anova perform test yield favor unfavor control gender discuss limit reason femal respond posit casper feedback male anova perform test possibl gender ad main effect frustrat remain result show main effect gender interact effect respect variabl gender plai role experi control emot discuss reason individu high emot respond differ experi individu low emot perform test possibl emot measur trait metric method introduc covari main effect frustrat remain result show effect emot covari emot impact result experi emot variabl recod dichotom variabl accomplish ascertain gener variabl particip particip score recod particip score recod anova show interact effect respect variabl control game experi level perform test possibl prior game experi level affect result game experi level introduc covari result show particip comput user frustrat chapter result experi tend plai game longer particip effect approach statist control main effect frustrat remain comput user frustrat chapter discuss discuss primari result manipul check success chapter discuss assess effect agent design reliev strong frustrat human establish peopl test feel demonstr frustrat interact agent discuss chapter natur hard isol verifi human note chapter social scienc commun long data describ affect state human light room simpli room chose simpli subject speak volum subject describ experi plai close interact questionnair appendix unsur plai game correctli lag time frustrat high score race made feel excel depend time frustrat network connect hinder effort achiev high score comput user frustrat chapter discuss subject tend report favor opinion report frustrat level compar report game interest plai constant delai game watch game stop annoi annoi watch time tick host contact typic question delai condit reaction bit frustrat slow charact walk turn didnt find game found sort larg involv walk pike stuff avoid enemi intellig base task subject delai condit respond mix review similar seemingli graphic interfac slow bore number posit attribut game assess bit felt hang fact woman instruct easi hang data sampl tendenc report higher frustrat level condit slightli report gener casper compar condit control questionnair mean report difficult formal code inform examin consid scope thesi appendix complet record textual data statist analysi verifi manipul deriv numer data obtain exit questionnair subject rate frustrat felt kei point particip experi kei point immedi game question enabl condit result manipul check chapter confirm protocol effect achiev intermedi delai condit shown elicit significantli higher level frustrat subject condit comput user frustrat chapter discuss addit main behavior found data clean behavior result found time plai game contrast state end chapter behavior measur impress reliabl indic intern state statist behavior measur experienc higher frustrat level delai condit reveal differ amount time subject control condit plai game point score experienc casper agent displai evid improv time subject plai game point score figur time subject quit game averag time casper subject spent plai game combin time plai subject delai raw time plai raw time subject plai raw time subject plai game amount time subject request plai quit note chapter quit button behavior reinforc subject condit plai half minut longer condit combin game plai strong result actual figur obtain subtract divid equat note twelv subject condit plai maximum time automat stop plai system unknown long subject continu plai upper limit forc condit subject plai minut subject delai condit condit player score game point score subject condit score condit shown figur statist analysi time task discuss chapter reveal strong relationship score time high correl variabl comput user frustrat chapter discuss time good predictor score score higher unit time confirm subject score higher aspect game establish unexpect result effect game condit conform expect expect condit yield player expect plai longer control condit counterpart experienc delai higher level result show subject condit plai game subject delai condit subject delai condit plai game longer subject delai suspect behavior result suggest presenc absenc delai singl import factor time subject plai game main effect delai time subject plai game reason effect found note experienc game delai higher frustrat delai subject experienc effort make experi uniform condit game protocol design mandat game ident natur condit uniform meant delai game game plai game delai game game game action uniform game singl frustrat problem experienc game suddenli fix game rel subject experienc end problem game subject delai condit plai longer game common phenomenon make imposs compar probabl frustrat level delai delai condit manipul check test determin extra frustrat experienc subject delai confirm fact effect diminish power result found condit delai condit behavior result found subject explain effect floor effect found frustrat level comput user frustrat chapter discuss laboratori natur control tend difficult environ elicit genuin human neg initi inher condit tend rule subject frustrat studi requir order show amelior effect protocol design bring element report literatur involv classic frustrat chapter stark relief goal establish reifi script read subject consent form direct game score point game motiv design procedur section chapter thwart goal present game delai condit iter design annoi frustrat chapter procedur section result suggest intent establish frustrat stimulu result show floor subject felt frustrat hard achiev goal manipul check show subject delai condit experienc significantli frustrat delai subject report feel frustrat game coordin effort put pressur subject perform coupl natur game support cover stori apparatu section chapter pressur put fact game design tediou low score condit result low score time subject plai game record delai delai condit condit appar relat discrep contrari varianc game plai time condit high control condit conflict effect emot chapter predict varianc condit delai emot regul strategi author expect abil abil recov frustrat behavior result extrem low sd delai condit high result uniformli floor explain consist poor show strengthen result obtain simpli bad averag yield neg slightli support emot regul reason comput user frustrat chapter discuss implement condit made subject uniformli inclin plai long data yield opinion whatsoev reason behavior emot research pure subject recal frustrat amelior affect user frustrat differ offer support control statist averag yield higher varianc time support discuss match compar support casper approach offer statist data data exit captur affect state point experi strong behavior result data reflect behavior statist compar strong measur assess frustrat level close game level satisfact close game analysi yield result typic data fact usabl support suspicion yield answer put varieti reason notabl illustr data anger extrem low score low evid establish relationship anger discuss ch anger routin report angri kei point routin report highli vari frustrat reason phenomenon lack identifi target candid target discuss reason simpli frustrat absenc anger strong neg affect studi encourag subject feel report fairli high level low ir possibl social desir subject wont suggest cultur consid sign weak frustrat longer plai subject frustrat casper agent interact game passiv plai longer order reliev frustrat comput game upset common strategi passiv support emot comput user frustrat chapter discuss discuss chapter hypothesi reason evid found support data chapter subject exit questionnair report level kei interv studi report tend follow subject gener report feel frustrat enter report higher frustrat level game slightli lower frustrat level interact lower level game subject condit report feel frustrat interact questionnair end game level frustrat report similar statist differ found condit subject condit report feel frustrat questionnair game variant pattern subject deviat typic pattern subsequ plai game maximum time number reason subject plai obviou problem discuss reason subject repres type person type reason hci implement social cue factor behavior result obtain support number factor make frustrat longer plai time explain result satisfactorili correl found frustrat level answer interact time spent plai game statist measur exit questionnair reveal statist manipul check differ frustrat level delai delai condit game subject end exit questionnair interact questionnair answer game made subject feel uncorrel variat subject report feel interact protocol design discourag subject plai game long time delai condit game excit plai bug interact subject made tediou plai fact delai system frustrat level game interact questionnair argument subject perform task system frustrat made feel patient longer comput user frustrat chapter discuss harder argument defend central argument subject plai longer felt altern interpret result discuss time score data game found highli contrast rest condit author argu accept explan differ subject respond differ interact questionnair verifi altern explan obviou simpli chanc yield statist analysi demonstr extrem null sampl larg confid repres popul game interest compar game condit differ amount time interact type work make differ long plai time complet type carefulli estim measur larg varianc casper condit due question end interact questionnair end game start game analyz note time interv includ time spent questionnair time spent read direct game analysi yield varianc sd minut minut varianc sd minut minut varianc sd minut minut note differ time subject spent answer questionnair delai delai casper condit differ merit discuss subject condit greater amount time express find believ subject prompt recal frustrat substant support discuss remain futur work differ time interv amount minut maximum minimum comput user frustrat chapter discuss time correl differ plai time condit game administr influenc subject plai experi wholli involv human contact kind direct game game complet rigid format email phone transmiss dictat subject script protocol present factor administr influenc select subject run time subject factor determin condit work schedul recruit women number consist men top effort random remain room maneuv time sex condit experienc unexpect casper agent subject plai reason state end chapter game mention casper agent plai game interact confirm agent condit demonstr significantli lower score plai time casper condit ag game plai experi influenc player ag game plai experi shown statist analysi relationship time score achiev sex influenc shown statist analysi chapter suspicion contrari trait affect long demonstr statist predict contrari trait shown effect perform predict contrari fact casper condit subject express problem emot state account differ condit perform function fact casper condit interact natur account differ questionnair condit design interact natur radio button gener preciou text field phrase question condit displai start question farther sequenc begin question began cue analog linguist call comput user frustrat chapter discuss effort make question worth note primari benefit casper agent encourag user feel dynam interact user subject perform game affect long plai game correl found score game time game main effect effect condit find strongli subject plai long reason felt frustrat plai game subject felt satisfi experi plai game concentr task score point convinc reason subject condit plai longer score higher experienc casper place queri relev subject led read amount dialog displai total simpl sentenc target argument made subject condit felt forgiv entiti recent serv object frustrat order plai frustrat level subject felt kindli object shift subject led design game ultim faulti game experi subject felt web cover stori base game delai origin web web natur abstract user comput subject studi gener tend familiar common notion web frustrat step design protocol foster attribut problem subject encount web illustr figur web browser window physic locat corner overlap instruct window small margin window resiz local materi gave question gave feedback object neg posit affect perceiv protocol comput activ comput user frustrat chapter discuss singl comput singl recent research tend suggest media equat work end chapter make strong case idea tend relat comput real peopl real place argument media equat work support singl affect attribut comput monitor keyboard subject interact entiti offer activ hand peopl tend respond comput polit suggest peopl tend treat comput work entiti work remain discov extent physic phenomenon multipl target peopl map web badli matter treat game system separ entiti game ident design delai subject encount appar delai interact human repres design finish plai game engag plai simpl game game frustrat game delai game stop frustrat game target target subject condit plai game reconcil neg partial exchang posit affect felt experi gener target involv subject felt good ill fact remain reason subject stop plai game mandatori minut subject plai game offer incent plai account game game found charact happen subject condit made plai longer score point subject delai condit logic reason comput gener specif casper agent uniqu social activ support mechan modul emot state subject delai condit perform pattern line expect made assum effect casper support theori comput user frustrat chapter discuss find point casper agent demonstr support user reliev feel frustrat comput user frustrat chapter theoret practic implic chapter theoret practic implic author built prototyp interact softwar agent demonstr provid provid effect relief neg emot state relat relief neg feel object neg emot agent simpl technolog advanc element found standard graphic user interfac dialog radio text figur diagram interact casper agent occur sole tradit state chapter interact agent amount answer question experi emot reaction read approv error read sentenc express acknowledg empathi problem neg emot reaction entir transact amount roughli read short line press type text theoret implic comput user frustrat chapter theoret practic implic practic theoret implic work discuss project demonstr effect address neg emot state comput find demonstr result condit studi suggest facilit regul neg emot peopl acknowledg made neg result affect state result appli interact inform debat util amelior process casper agent studi social demonstr social interact capabl approach repres departur social agenc video fulli humanoid agent interact includ natur languag speech input anim imag screen bob subsequ wizard assist featur anim charact interact anecdot evid mount user feel neg emot paper clip casper agent demonstr studi offer cue agenc embodi specif program lifelik social extrem crude implic studi includ support argument social agent advanc interact techniqu speech order effect media equat present view interact modul wai social form interact comput work report find import implic hci categori social spatial phenomena phenomena inform user interact comput unclear extent media equat demonstr work report thesi repres dramat extens media indic critic kind social cue affect human user percept machin work demonstr neg emot state activ modul comput system hitherto assum uniqu suggest role closer servic relationship implic principl design standpoint interact implic comput user frustrat chapter theoret practic implic result studi repres contribut design comput design address failur design softwar find enabl design address failur emot state factor design process appreci offer support emot state system failur ignor critic aspect result injuri product maker begin address full scope effect comput system failur user gain knowledg tool make differ subsequ percept ey user function dialog bit text button made differ higher demonstr satisfact constitut compar studi suggest text button underutil overlook method creat agenc point paper clip approach agenc thesi creat agenc practic implic casper agent shown effect reliev neg make subject feel comput system perform frustrat user place find profound practic implic virtual kind softwar system imagin method demonstr repres extrem cheap solut address failur enorm amount big devic make contribut industri product failur part event live user frustrat casper method demonstr user product fail reason wind product casper agent onboard idea posit outcom ti acknowledg failur import lesson industri current assumpt corpor light comput user frustrat chapter theoret practic implic admit offer apolog kind poor perform avoid strong legal case mount work demonstr great benefit custom satisfact thing time apolog machin implic abound practic applic work autom custom servic complaint depart idea talk machin order complain compani product servic sound hard number benefit system member societi peopl shy benefit complain feel heard risk confront servic repres train deal frustrat attract fear confront system benefit likelihood peopl websit call report problem autom servic ideal offer tandem real human servic place effect action illustr scenario corpor america casper agent practic adapt real life microsoft excel compani notori loyal prematur product sever problem fix elicit leav user feel distinctli angri window nt oper system subsequ found critic error design subsequ pack fix bug os address frustrat acknowledg problem offer solut inabl adequ address experi consum confid nt os product compani greatli experi forgotten author occur month pack intend fix problem assum error prematur make custom user feel manipul time imagin servic pack includ agent version simpli agent capabl run effect softwar instal process comput user frustrat chapter theoret practic implic agent engag user dialog product subsequ servic pack queri user feel experi system offer statement offer apolog level type affect express empathi state loss faith product agent encourag user describ word add imagin softwar finish dialog box polit permiss automat send feedback email microsoft headquart specif assur confidenti inform contribut product futur compani track user maintain idea product perceiv marketplac valuabl inform lead design product innov bug fix made left feel product interact work user feel product compani care make user feel accept inform compani abil make inform make maintain authent interact user accept entir user subsequ email note real person user give assur inform heard provid repres chang compani busi futur authent greatli elev affect user feel product servic element authent make subsequ part compani forgiv futur scenario compani orient design complet mechan deal respond feedback design implic work implic design system interact user social affect inform processor studi contribut abil system user recov quickli effici neg emot state implic work lead posit neg posit system includ rapport comput engag user foster comput user frustrat chapter theoret practic implic cooper good feel lead product job satisfact benefici suggest studi teamwork reev neg side effect includ emot cognit object perceiv care part machin empathi emot manag support strategi good interfac includ commun capabl user system except proper design casper agent mitig neg object found data collect studi object unforeseen found subsequ test casper subject inform front practic design implic work tip partial list articul potenti benefit approach hci comput user frustrat chapter theoret practic implic comput user frustrat chapter sociolog philosoph implic chapter sociolog philosoph implic casper agent repres genr interact devic approach carri host posit neg alik implic broad rang level individu cultur scientif impact explor fulli devic ethic put widespread level issu human devic devic chang natur humancomput human defin world devic regularli commerci issu includ ethic incent corpor develop product incent fine product diminish readi avail effect safeti net polit issu run gamut public consensu accept design potenti includ devic maintain disciplin citizen consum level advent devic foster posit chang mean manipul foster societi held valu global comput user frustrat chapter sociolog philosoph implic widespread devic human effect western cultur cultur devic intent leverag human natur heart discuss rel ensu main effect discuss chapter frustrat human abil neg likelihood abil pai interact harmoni frustrat emot judg pain remov pleasur experi agenc demonstr project effect peopl interact time emot show sign improv emot manifest engag significantli longer interact system interact agent kind effect direct activ address effect frustrat effect demonstr possibl human manag difficult render exist stress pleasur effect softwar built thesi hold great similar effect shown improv harmoni interact comput system user abil creativ gener solut problem greater autonomi likelihood subsequ mildli perceiv stronger neg reaction mount effect long act possibl model meet human number side benefit suggest work discuss assum interact constitut percept social exchang evid interact effect enabl human meet social social connect combat appar comput user frustrat chapter sociolog philosoph implic scale cultur trend isol scarciti human resourc human attent cultur evid number quarter suggest cultur preciou human possess skill construct commun skill appreci skill reason lack skill larger cultur kind posit feedback peopl practic skill peopl serv behavior casper devic effect variant behavior human user interact experi note techniqu humancomput interact act posit model subsequ interact argu kind interact casper agent capabl constitut critic lack believ credibl true varieti machin simul behavior problem experienc understand emot person experienc kind interact human number strike similar casper amelior effect part human measur occur dog cat human long benefit interact includ clear anim understand emot human human routin vagu cue sourc human anthropomorph meet emot feel feel accept probabl anim motiv real empathi understand conceiv present emot manag assist emot manipul suggest provid activ support person regul emot tame version involuntari emot mind control concept relationship research frank argu major state goal system support emot manag comput user frustrat chapter sociolog philosoph implic user system manner receiv benefit intent demonstr design studi process heart interact voluntari critic import shown softwar agent perform work suspicion demonstr mean kind mind control experi thesi base involv appar uncov subject note capabl subsequ human tend develop wai resist effort perceiv manipul thesi demonstr strong behavior effect undetect cognit subject felt awar specif manipul approach emot regul involuntari exampl hard imagin trust imag mirror casper approach ideal simul real real real care effect lie leverag fact human hear sound honest true intuit sound real heart simul transact simplic absenc resist notion troubl case simul definit extent model lead plain wrong attribut trust realiti mirror reflect pitfal fact work center simul render interact simul effect suggest posit benefit routin benefici model effect interact user autom human net effect foundat efficaci real simul wrote cave paint duplic suffici render human jade interact softwar recept real human empathi open great concern nonetheless comput comput user frustrat chapter sociolog philosoph implic advent comput legion children grow feel deep connect toi children grown feel attach plai object children seemingli doll toi fulfil kind develop bond conceptu primal attach primari caregiv independ ident young children subsequ babi doll model simul relationship perceiv real world fischer differ gener increasingli interact toi make gener children grow question remain interact armi interact doll social gener children comput emot relationship artifact interact feasibl easi present studi implic relationship credibl possibl entir gener toi capabl kind interact young cry child artifici prevent strong feel host neg emot artifact discourag owner foster healthi interact parent support emot regul provid educ leav children thwart develop skill interact successfulli question develop adult world devic achiev popular human routin manag emot locu control resid world human depend emot relationship emot assum interact pure hard conceiv locu control move machin casper agent model interact order emul rang unpredict effect human transplant behavior human machin result fundament differ subsequ interact machin model human behavior interact percept sap wind sail problem great concern work possibl emot import function emot build frustrat build fuel overcom obstacl frustrat anger prematur comput user frustrat chapter sociolog philosoph implic act kind undermin person abil perform potenti confront compani sold system demand monei back system strong user emot perform servic manufactur number complaint mandat user hard imagin system convinc user genuin interest system undermin goal prematur emot state effect necessarili limit domain hard imagin varieti polit fall prei emploi mass devic manipul constitu current sit presid reconcil imag mind angri tool make perform person act strategi quickli corpor case expert social strategi human authent interact person receiv transact elicit problem address reason person offend appar trust manufactur offer poor product poor albeit apolog eventu develop reput fast user bit slower compani offer autom remain manufactur maintain integr public imag effect devic draw period detriment consum absent empathi empathi consid primari import effect activ listen studi describ care design impress empathi commun comput result benefit effect cultur devic routin profess empathi state exist troubl social interact find support situat believ credibl substanc interact fact lack hard situat social worker conduct session client cry angri comput user frustrat chapter sociolog philosoph implic demonstr feel situat hard work listen distract thought concern notion unrel client listen skill provid kind feedback activ listen provid client cue effect listen import goal interact client make kind progress client client calm tool similar theori casper enabl client feel listen emot state accept distract offer appar empathi genuin felt feel session success effect client interact feel listen understood interact autom system greatli limit capabl qualit experi involv human listen implic kind human long term suspect scope thesi specul inform manner benefit appar authent social similar present emploi human listen synthet wai express machin problemat empathi empathi assum impli correspond skill comput possess impli demonstr faculti exist question effect situat work context focu thesi complic philosoph question work make clear strong ai ag devic effect notion casper agenc backdrop larger question live cultur notion privaci afford ag inform comput act commerc trend public inform separ ownership cultur larg comput user frustrat chapter sociolog philosoph implic issu context scope thesi properli role reveal fact human respond social media make human vulner manipul human emploi devic design moral address ignor simpli explain argument machin design displai capabl limit user idea long tenet hci shneiderman ethic implic violat principl abound suggest machin human remind machin modern comput good transmit inform problemat vision machin conceptu messag excel repositori machin make clear data data interact human natur afford modern capabl simul human behavior quickli cross thing design system extrem authent interact extrem import briefli discuss end chapter thing societi learn find effect wai foster notion order disciplin citizen consum casper agenc repres contribut tool societi develop benefici tool benefit outweigh ill gener wai era hci reduc authent challeng year approach comput approach comput chapter state goal approach comput state goal bring patholog disord techniqu approach thesi inform part techniqu adapt social psycholog activ listen approach intend treatment problem intend make easier user modul emot state short environ support comput user frustrat chapter sociolog philosoph implic comput user frustrat chapter direct futur studi determin effect compon present studi chapter futur direct import extens present studi determin work casper design feedback suffici yield empathi requir maintain humor effect frustrat suggest matlab anecdot illustr end chapter fruit approach research casper condit constitu strateg element subset current experi casper manipul casper agent permut subset current set emploi test implement current strategi relev research question maintain effect make explicit inabl feel empathi affect affect effect make explicit idea comput social remov trace connect agent softwar human idea inform commun user reach human ey contribut muddi effect achiev casper comput user frustrat chapter direct futur studi valid experi studi thesi execut subject unawar administr knowledg condit subject experi experi administr knowledg condit subject remov possibl bia convei subject system implement parti condit run administr dark matter softwar design procedur random condit run subject note present number step remov materi subject particip rigid format appendix detail script read subject arriv appendix commun enter friendli sell cover note behavior desir subject administr complex natur emerg interact imposs convei subject implement result studi public casper shown effect reliev neg affect felt subject sourc subject knowledg goal method achiev goal remain user accept agent agent effect determin futur test agent repeat effect experi expect effect human accept benefit behavior agent akin fool shame determin deeper effect genr effect agent user ramif determin effect potenti problem authent locu control discuss chapter futur studi conduct determin effect chapter subject comput user frustrat chapter direct futur studi work repeatedli determin effect devic comput user frustrat chapter direct futur studi chapter thesi establish comput interfac design activ user recov neg emot relat limit frustrat comput system thesi show interfac ad benefit make comput user feel comput system applic involv elicit frustrat user place implic work span dozen import domain includ human custom product emot humancomput field human busi mention qualiti life averag comput user studi demonstr comput system provid effect support hitherto aspect human modul neg emot natur task repres fundament shift human role human work extend boundari media show human user media wai hitherto assum uniqu person comput comput user frustrat chapter direct futur studi servic activ manag emot human human capac thesi begin articul guidelin design activ emot support futur system research problem varieti interperson emot abil assist regul identifi critic social effect motiv activ hard achiev specif criteria effect complex balanc time abil machin exhibit skill emot manag assist present greater system demonstr import practic contribut number demonstr genr carri potenti implic cultur societi implic risk fabric human number hard question authent advent technolog theoret natur design fact repres system affect benefici chang emot creat complet pictur human user conceiv includ humancomput interact human emot fact singl human user longer design modern technolog comput user frustrat appendix subject experi materi subject materi solicit solicit human post mit campu bulletin board appendix subject experi materi comput user frustrat appendix subject experi materi subject materi inform email inform email repli request schedul contact state interest post mit bulletin jonathan klein game aug aug im interest plai game give hope detail weve build kind adventur game techniqu internet men women evalu arriv mit offic build player plai give highest intellig matter novic game player smart chanc win experienc schedul late open slot thursdai week give media lab work schedul conveni good block time send email questionnair fill send back conveni info collect strictli minut fill count total forward hear jonathan klein grad student research assist mit media laboratori st cambridg ma comput user frustrat appendix subject experi materi subject materi confirm questionnair email note time confirm transmiss trait questionnair jonathan klein game studi confirm questionnair aug aug fridai good fridai work reserv plan meet room media lab build media lab build street east side campu build big white round corner big modern concret arch connect side room left elev straight set door part studi email fill return id rememb minut fill count total particip forward fridai morn jonathan klein grad student research assist mit media laboratori st cambridg ma questionnair particip studi evalu game softwar step ten minut fill questionnair order gaug evalu idea evalu paid chanc win prize entir involv studi amount includ answer question note entir particip studi strictli inform provid domain studi note answer question import voluntari feel free skip question answer comput user frustrat appendix subject experi materi portion letter text dr albert trait scale trait scale copyright dr obtain contact comput user frustrat appendix subject experi materi subject materi questionnair receipt confirm email confirm recept complet questionnair jonathan klein game studi confirm questionnair aug send back questionnair reserv fridai morn room media forward jonathan klein grad student research assist mit media laboratori st cambridg ma subject materi email remind night comput user frustrat appendix subject experi materi remind email note date particip jonathan klein remind game studi tomorrow morn aug hei remind schedul room media lab tomorrow morn particip studi evalu game paid spot chanc win lot media lab build street east side campu build big white round corner big modern concret arch connect side room left elev straight set door forward tomorrow jonathan klein grad student research assist mit media laboratori st cambridg ma comput user frustrat appendix subject experi materi subject materi script read subject arriv laboratori administr friendli natur appendix subject experi materi greet subject consent sign payment lead seat area room confer room experi comput subject question polit read script answer question experi read particip built prototyp comput game work feel basic plai graphic comput game puzzl network local game comput user frustrat appendix subject experi materi plai game wait finish nod plai comput pc video sort thing wait finish nod number peopl plai game subject verbal report plai form comput game time thing comput game player video game player invari notic plai game web graphic game graphic web move hand tandem spoken smile slow graphic reason lot game plai web thing work address problem group work work game network develop protocol internet commun greatli speed graphic slow network modem connect make speed graphic game faster current state affair game find develop fast modern home comput game pc video game interest fast interest feel element experi expect slower slower heard term subject report heard term expect term comput game industri kind alpha earli version comput game game charact screen repres move charact manipul environ game game pc game genesi stage point charact pretti flesh softwar world gener pretti rich graphic final version kind thing charact world gener subset thing eventu phase develop kind critic time develop call bang evalu lot criteria comput user frustrat appendix subject experi materi problem readi problem game bell whistl ad music sound lot element game ad game experi good game expect game game plai good game comput total involv lose track concentr total natur plai hard problem game problem plai finish version evalu game real game situat real game plai offer incent offer prize top game score top win announc winner week encourag plai hard intellig score point game experienc plai averag hour test game peopl pick plai game live found novic player intellig head game experienc reli reflex normal reflex smart person good chanc plai game stop answer question plai time direct plai game provid set question read plai game answer question read direct game game plai comput notifi give paper questionnair fill entir start minut wed give payment offic dollar bill infinit fill hand back wed read fill consent subject consent pen subject fill consent copi payment rush make comput user frustrat appendix subject experi materi feel fill consent start lead subject experi offer seat front comput turn video game room good comput user frustrat appendix subject experi materi subject materi consent form sign administr finish read script payment fill consent form particip experi complet voluntari free withdraw consent request data collect destroi time feel unsur result part discontinu particip repercuss plai prototyp graphic comput game develop game consist move charact virtual world find pick treasur avoid pass opportun plai game interact comput answer seri survei includ question game reaction comput clarifi particip game record videotap fill questionnair time physic free experi suspend payment particip instruct payment earli withdraw encourag particip achiev highest player top score win bonu prize determin studi event tie top winner select top winner contact phone email august collect experi complet anonym point refer id number upper corner packet answer particip comput user frustrat appendix subject experi materi comput user frustrat appendix subject experi materi read sign line read understood explan research project voluntarili consent particip understand remain confidenti termin particip time extrem event physic injuri result particip understand medic treatment mit medic includ aid emerg treatment care insur carrier bill cost treatment provid medic care forego understand make medic treatment provid impli injuri investig fault understand particip studi legal understand contact chairman human mit feel treat subject read videotap collect particip data data collect perman store privat archiv portion record publish present scientif journal scientif confer publish venu inform address privat includ public data time experi request tape destroi sign line give special permiss collect materi comput user frustrat appendix subject experi materi comput user frustrat appendix subject experi materi subject materi game read sign consent comput user frustrat appendix subject experi materi comput user frustrat appendix subject experi materi subject materi direct answer questionnair immedi finish game view interact comput user frustrat appendix subject experi materi subject materi direct game immedi answer interact condit comput user frustrat appendix subject experi materi subject materi exit questionnair subject fill game comput user frustrat appendix subject experi materi comput user frustrat appendix subject experi materi comput user frustrat appendix subject experi materi subject materi debrief statement subject read complet exit debrief statement experi particip design elicit specif understand natur human experi emot daili basi task particip design interest peopl manag emot comput interact frustrat natur interest comput assist user manag feel comput user feel emot state extrem difficult elicit make particip experi order evalu game plai decept game world wide mount local experienc plai game design experi attempt elicit emot reaction frustrat understand decept absolut critic compon experi carefulli evalu approv mit human subject experi ill effect mental result particip hesit call option withdraw particip experi includ repercuss feel free question experi time greatli aid media lab construct softwar assist human manag emot ultim construct enhanc environ comput user frustrat appendix subject experi materi comput user frustrat appendix data analysi relat document analysi appendix data relat document frequenc distribut subject ag rang statist median std deviat varianc rang valid miss subject ag rang subject ag rang code ag rang frequenc percent valid percent cumul percent valid total miss system miss total total comput user frustrat appendix subject experi materi figur distribut subject ag rang comput user frustrat appendix subject experi materi analysi manipul check anova frustrat level immedi game report exit questionnair result case process case includ exclud total percent percent percent frustrat felt immedi plai game experi delai game questionnair subject cell frustrat felt immedi plai game subject experi type questionnair delai game subject experi qa qc total qa qc total total qa qc total grand frustrat felt immedi plai game experi delai game questionnair subject comput user frustrat appendix subject experi materi method sum df sig squar squar frustrat felt immedi plai game main effect subject experi delai game type questionnair subject experi subject experi interact delai game type questionnair subject experi model residu total frustrat felt immedi plai game experi delai game questionnair subject comput user frustrat appendix subject experi materi analysi main behavior measur time subject plai game condit differ case process case includ exclud total percent percent percent time plai game experi delai game questionnair subject cell time plai game subject experi delai type questionnair subject game experi qa qc total qa qc total total qa qc total grand time plai game experi delai game questionnair subject time plai game method sum squar df squar sig main effect interact subject experi delai game type questionnair subject experi subject experi delai game type questionnair subject experi comput user frustrat appendix subject experi materi model residu total time plai game experi delai game questionnair subject comput user frustrat appendix subject experi materi figur time subject plai game condit subject condit plai minut minut condit comput user frustrat appendix subject experi materi analysi gender analysi time subject plai game gender correl case process case includ exclud total percent percent percent time plai game subject experi delai game type questionnair subject gender comput user frustrat time plai game appendix subject experi materi sum squar method df squar sig main effect interact interact subject experi delai game type questionnair subject experi gender subject experi delai game type questionnair subject experi subject experi delai game gender type questionnair subject experi gender subject experi delai game type questionnair subject experi gender model residu total time plai game subject experi delai game type questionnair subject gender comput user frustrat appendix subject experi materi analysi trait analysi time subject plai game raw trait score correl case process case includ exclud total percent percent percent time plai game subject experi delai game type questionnair subject experi time plai game method sum squar df squar sig covari main effect interact subject experi delai game type questionnair subject experi subject experi delai game type questionnair subject experi model residu total time plai game subject experi delai game type questionnair subject experi covari enter comput user frustrat appendix subject experi materi figur distribut trait score raw score adjust subject comput user frustrat appendix subject experi materi analysi trait analysi time subject plai game categor trait score correl case process case includ exclud total percent percent percent time plai game subject experi delai game type questionnair subject comput user frustrat time plai game appendix subject experi materi method sum squar df squar sig main effect interact interact subject experi delai game type questionnair subject experi subject experi delai game type questionnair subject experi subject experi delai game type questionnair subject experi subject experi delai game type questionnair subject experi model residu total time plai game subject experi delai game type questionnair subject comput user frustrat appendix subject experi materi analysi experi analysi time subject plai game combin frequenc comput game plai case process case includ exclud total percent percent percent time plai game subject experi delai game type questionnair subject experi time plai game covari sum squar method df squar sig main effect subject experi delai game type questionnair subject experi subject experi interact delai game type questionnair subject experi model residu total time plai game subject experi delai game type questionnair subject experi covari enter comput user frustrat appendix subject experi materi analysi frequenc dichotomi analysi frequenc dichotomi prepar analysi time task covari case process case includ exclud total percent percent percent time plai game subject experi delai game type questionnair subject comput user frustrat appendix subject experi materi cell time plai game subject experi type questionnair delai game subject experi qa total qc total total total total qa total qc total total total total total qa total qc total total total total grand time plai game subject experi delai game type questionnair subject comput user frustrat time plai game appendix subject experi materi main effect ns ns method sum squar df squar sig subject experi delai game type questionnair subject experi subject experi delai game type questionnair subject experi subject experi delai game type questionnair subject experi subject experi delai game type questionnair subject experi model residu total time plai game subject experi delai game type questionnair subject comput user frustrat appendix subject experi materi analysi game perform analysi effect condit game perform frequenc dichotomi analysi case process case includ exclud total percent percent percent subject experi delai game type questionnair subject experi time plai game cell subject experi type questionnair delai game subject experi qa qc total qa qc total total qa qc total grand subject experi delai game type questionnair subject experi time plai game comput user frustrat appendix subject experi materi method sum squar df squar sig covari time score plai game main effect subject experi delai game type questionnair subject experi subject interact experi delai game type questionnair subject experi model residu total subject experi delai game type questionnair subject experi time plai game covari enter comput user frustrat appendix subject experi materi analysi analysi time control time subject plai game questionnair type differ found time plai game time plai game equal varianc assum equal varianc assum group statist type questionnair std std error subject experi deviat qa leven test equal varianc qc independ sampl test sig df sig equal mean differ std error differ confid interv lower upper comput user frustrat appendix subject experi materi analysi analysi time casper time subject plai game questionnair type differ found time plai game time plai game equal varianc assum equal varianc assum group statist type questionnair std std error subject experi deviat qc leven test equal varianc independ sampl test sig df sig equal mean differ std error differ comput user frustrat confid interv lower upper appendix subject experi materi analysi analysi time casper control time subject plai game questionnair type differ found time plai game time plai game equal varianc assum equal varianc assum group statist type questionnair std std error subject experi deviat qa leven test equal varianc independ sampl test sig df sig equal mean differ std error differ confid interv lower upper comput user frustrat appendix subject experi materi figur score game condit comput user frustrat analysi appendix subject experi materi frustrat questionnair frustrat level experienc questionnair condit exit case process case includ exclud total percent percent percent frustrat felt answer questionnair subject experi delai game type questionnair subject experi uniqu method sum df sig squar squar frustrat felt answer questionnair main effect subject experi delai game type questionnair subject experi subject experi interact delai game type questionnair subject experi model residu total frustrat felt answer questionnair subject experi delai game type questionnair subject experi effect enter simultan comput user frustrat analysi appendix subject experi materi analysi questionnair effect questionnair game made subject feel condit result found case process case includ exclud total percent percent percent subject experi delai game type questionnair subject experi uniqu method sum df sig squar squar questionnair effect main effect subject experi delai game type questionnair subject experi subject experi interact delai game type questionnair subject experi model residu total subject experi delai game type questionnair subject experi effect enter simultan comput user frustrat analysi appendix subject experi materi analysi satisfact game satisfact level immedi game result case process case includ exclud total percent percent percent subject experi delai game type questionnair subject experi uniqu method sum df sig squar squar main effect subject experi delai game type questionnair subject experi subject experi interact delai game type questionnair subject experi model residu total subject experi delai game type questionnair subject experi effect enter simultan comput user frustrat appendix subject experi materi analysi code direct independ part independ judg classifi question exit questionnair direct code question exit questionnair answer code question exit questionnair question enjoi plai enjoi plai entir stack question read compar rate game subject report enjoi upper section code sheet code inform make determin subject enjoi game game subject enjoi game game subject enjoi game equal number code sheet correspond circl number corner exit questionnair larger number smaller number slide subject report dislik enjoi game code disregard reason subject enjoi game subject left answer space code comput user frustrat appendix subject experi materi analysi code direct independ part independ judg classifi question exit questionnair direct code question exit questionnair answer code time question exit questionnair question plai game long entir stack questionnair question read evalu inform make unrel categori deriv game interest collect discov underli factor find real find specif reason plai thought direct plai doubl enjoi plai start bore involv score point score amount code influenc determin long subject intern benchmark subject decid bear mind game involv manipul charact find pick item game subject told plai minut long subject respond multipl pick subject import distinguish reason record evalu code bottom code circl refer number exit questionnair judg code question comput user frustrat appendix subject experi materi analysi question question end casper interact describ condit question interact femal frustrat slow speed figur accumul lot point competit aspect add lot slow gener fun bit slow fulli enjoi danger walk pick difficult target feel strong feel plai reaction bit frustrat slow charact walk turn explor slow annoi process angri impati angri interest particip experi minut time develop strategi hang control figur wall corner bypass low gem speed charact pick item didnt find game found sort larg involv walk pike stuff avoid enemi intellig base task comput user frustrat appendix subject experi materi charact move make move realiz control thought game felt score charact move quickli arrow movement briefli treasur piec placement wasnt thought game pretti neat decent graphic slow speed walk delai timer mildli annoi felt constant delai irrit delai timer stop game stall red left game stall slow main charact movement frustrat aspect game turn charact wait pick object frustrat interest part game path nice charact run time limit object game pick item male bit frustrat knew success predic collect network delai prevent timer count server contact game slow player time slow minut short dont made differ hard plai optim game interest bigger chunk screen idea delai wait browser load pretti frustrat didnt wait charact move walk slow keystrok frustrat network connect hinder effort achiev high score fun game earli simpl lot depth game plai network game isnt lot replai walk pick rock slow pace unsur plai game correctli lag time frustrat high score race made feel excel depend time network succe mind plai feel frustrat bit angri delai happen delai time lost point condit question interact femal comput user frustrat appendix subject experi materi slow smart wasnt frustrat id person wouldnt couldnt figur stand treasur move id forward edg wall comput plai larg amount nice map defeat entir game touch plai game seemingli graphic interfac slow bore fact woman instruct easi hang male sort stop stall annoi charact move pretti fast attack game make feel bad dream move fast caught nasti game worthwhil graphic smooth faster bit felt hang cool nice map plai strateg pick object worth point charact pretti slow id charact fast thought lot empti game sound graphic filler femal simpl id expect speed compar desktop pretti frustrat give graphic speed game slow felt annoi kick keyboard heavili comput user frustrat appendix subject experi materi feel tire delai fun unabl move charact period end interest minut game connect didnt feel feel interest game felt game consid carefulli turn didnt stuck long enjoi interest bigger chunk screen idea delai wait browser load pretti frustrat didnt wait charact move walk slow keystrok male interest note frequent accumul treasur notic pick gold stop bar pick time game pretti good delai contact host affect score great deal lot game pretti atleast delai curiou point game delai comput load minut game reaction time comput stall react game interest plai constant delai game watch game stop annoi comput user frustrat refer refer suppress frustrat disord special develop relat emot cognit cognit vol sept pp frustrat theori cambridg canada peopl love evolut human juli pp work drive put metaphor emot theoret extens metaphor histori cambridg pp simul york select stanford stanford ca beck health enhanc companion anim ownership annual review public health pp commun ag virtual realiti lawrenc jersei attach volum attach edit basic york breazeal regul interact facial express present autonom agent workshop comput user frustrat refer interact acquir compet dimens adult affect relationship function person social psycholog vol march pp emot influenc attach relationship monograph societi research child vol pp expect neg mood cope colleg student journal vol jan pp cole therapi staff dream true clinic north america septemb pp cooper drink regul posit neg motiv model alcohol journal person social vol nov pp ed current edit il damasio reason human brain york lone net educ technolog august ekman argument basic emot cognit vol pp elliot affect process model emot system phd northwestern institut learn technic report resili children studi child york fernandez stochast model physiolog signal hidden markov step frustrat detect interfac mit master septemb fischer dynam develop psycholog structur action thought volum theoret model human handbook child wilei york therapi depress adult colleg student pp comput user frustrat refer mood effect judgment journal person social pp transient mood social judgment person social psycholog pp reader york interview write chapman ny ego mechan defenc press london pet social surviv acut suppress trial american journal cardiolog decemb pp frijda frijda emot studi emot social interact cambridg cambridg gardner frame theori multipl intellig basic york interact essai behavior publish il emot intellig york gordon parent effect train book american york green measur error mask bipolar affect rate journal person social pp gross emot regul mental health clinic psycholog scienc vol summer pp ed accuraci york posit affect facilit creativ problem solv journal person social system emot cognit process psycholog pp jameson signatur visibl chapman ny jameson cultur logic late duke nc ten easi step anger custom relationship vol comput user frustrat refer natur tenth anniversari edit basic book attent ch attent effort prentic englewood nj pp moodi develop love septemb pp ff ed emot influenc percept attent academ york lang reflex psycholog vol pp develop scientif concept york ledoux memori brain scientif june pp lewi lewi william implic view emot mood volum special issu journal social behavior pp marqui marqui elliott poker plai agent note twelfth nation confer artifici intellig workshop artifici artifici entertain mayer emot intellig construct regul feel appli prevent vol sum pp theori evid bear scale trait current spring pp cultur variat review psycholog vol sept pp depress reaction failur naturalist test theori journal abnorm effect humor commun interact confer human factor comput system chi lo angel myer edit worth york myer pursuit happi york norman ed system design lawrenc erlbaum nj comput user frustrat refer norman psycholog everydai thing design everydai basic york test effect activ listen research social work practic pp oatlei experi emot everydai life cognit vol juli pp picard affect comput mit ma preec interact york reev media peopl treat media real peopl place cambridg press frustrat user pilot studi detect emot state confer human factor comput system chi lo angel emot intellig cognit person pp scassellati imit mechan joint structur build social skill humanoid robot part seri shneiderman direct manipul path interfac softwar agent ma strauss make robot smile mit technolog vol oct starr polici simul game american spring pp interfac talk learn media barnei confer human factor comput chi lo angel tannen women men york commun charact feel session charact intern confer multimedia comput system tomkin volum posit affect neg affect york life screen simon york adapt life boston comput user frustrat refer comput program studi natur languag commun man machin commun associ comput machineri pp statist principl edit york transit object transit phenomena chapter plai realiti basic york emot handbook social vol pp pet ownership singl women psycholog report pp pet therapi psychiatri american journal occup therapi januari pp comput user frustrat note jonathan klein complet master media art scienc work professor rosalind picard mit media laboratori ma media lab spent work professor affect comput research effort aim enabl comput media respond human emot mr work involv develop test comput system account emot experi user mr klein receiv bachelor scienc highest honor high distinct interact comput michigan ann arbor work professor elliot solowai develop interact design solut number major research effort educ collabor research virtual world digit librari game web spent year industri art graphic design illustr research interest includ design build express capabl comput system machin learn build speech interfac agent adapt style mr extend research practic agenda hci commun includ support broad rang human mr frustrat peopl marri daughter famili live ma comput user frustrat decemb
IR/36 5 herm notif servic digit librari institut comput scienc universit berlin abstract high public rate scholarli materi make search inconveni oneself activ part inform research notifi paper research area publish publish portal site offer notif servic approach disadvantag introduc herm alert servic integr varieti inform provid make heterogen transpar user herm sophist filter capabl prevent user flood irrelev inform user point view integr provid singl sourc simpl provid interfac make easi publish join servic reach potenti reader directli paper present architectur herm servic discuss issu heterogen inform sourc discuss benefit disadvantag middlewar implement servic digit librari categori subject descriptor storag librari manag gener term digit librari keyword alert digit select dissemin inform permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee june usa copyright acm introduct tradit electron public search user activ find inform usag pattern digit librari notif reader materi interest servic call notif alert servic number scholarli public sophist filter capabl alert servic prevent user flood irrelev public inform provid publish alert public benefici end user approach disadvantag user relev provid deal varieti maintain profil site privaci reason user profil interest arbitrari inform provid duplic notif occur case user receiv notif publish abstract citat avoid capabl express user interest poor user select set journal receiv tabl content issu journal lead low recal notif provid clutter mailbox rare possibl notif notif integr small inform provid alert servic integr alert system integr varieti provid public type hide specif user avoid problem offer unifi interfac sophist profil express capabl includ filter notif schedul open easi join provid feed bibliograph data alert servic materi directli interest target group scalabl support million user profil ten thousand public daili huge amount valuabl scientif literatur web user retriev data publish web site provid capabl instal support interfac integr alert servic wrapper web site emploi make materi notif obviou small number integr alert servic develop digit librari individu alert servic publish springer link alert elsevi content direct servic underli base public publish profil defin basic definit restrict select retriev servic secondari publish swet natur cover wider restrict select materi abstract citat servic notif isi servic uncov reveal servic restrict materi host servic themat portal site underli similar limit commerci sourc includ freeli scientif commun futur number servic special type technic report server ncstrl notif document focu notif restrict alert servic librari sourc materi larg spectrum cover publish type public servic restrict materi librari subscrib alert problem duplic notif due overlap coverag appli alert servic librari problem duplic notif address intermedi integr alert system number servic restrict access profil poor express singl provid sophist profil user restrict provid materi scientif research cover alert servic digit librari environ springer link elsevi content swet alert research alert internet publish uncov research paper network comput scienc technic refer canadian institut scientif technic longer tradit earliest system develop sift tool inform commerci oper sift monolith servic support distribut alert servic implement wai notif event paradigm kind applic distribut notif infrastructur develop order evalu exampl siena profil definit languag support siena restrict support sophist retriev support queri select xml document contrast filter herm applic domain typic focu structur bibliograph refer continu queri project investig updat monitor problem continu queri languag implement prototyp languag support sophist detail definit profil cq system basi alert servic digit middlewar academ project alert servic introduc fulli implement system digit librari context publish free access bibliograph send make web site format data standard problem extract bibliograph data publish web site address method field semistructur data manag wrapper creat queri data web site hide layout structur site answer queri mean collect data multipl link html document separ html code html knowledg structur web site document emploi construct wrapper approach match html document regular express robust respect layout variat structur occur frequent web site approach oper syntax tree html document provid higher robust system herm project support mainten wrapper approach separ concern data extract data main contribut paper architectur alert servic overcom heterogen problem user point view integr kind provid singl sourc paper structur discuss issu implement integr alert system section section present architectur herm system section discuss problem encount develop solut paper conclud short outlook tabl provid type cooper activ send notif metadata send email passiv download metadata make metadata web site issu main problem solv build open integr alert system cope heterogen inform user inform match incom notif user profil heterogen defin type inform provid integr alert system handl classif inform provid inform provid supplier scholarli inform make metadata bibliograph alert servic distinguish type provid introduc provid activ passiv activ provid user darwin subscrib receiv notif issu journal passiv provid servic queri materi schedul manner algorithm optim queri schedul introduc provid cooper cooper provid provid inform standard format handl automat implement protocol support herm provid inform proprietari format special wrapper written case combin provid type shown tabl distinct activ passiv exact push pull mix type occur provid notifi metadata ftp server similar case passiv provid activ extern alert system darwin poll provid regular basi send notif url issu provid web site provid critic alert servic basic html interfac activ cooper provid join herm system regist regularli submit bibliograph metadata standard format heterogen format cooper alert system deal metadata format structur vari unstructur notif ascii format semistructur html page publish web site format xml format citat manag softwar user profil user express inform profil profil aggreg queri notif polici queri part defin inform user receiv notif polici specifi instanc daili protocol format plain bibtex queri consist boolean filter express rank part part option boolean queri simpl set attribut bibliograph metadata field deliv inform provid bibliograph data match boolean queri rank rank part queri rank queri term list proxim term relev threshold document score herm relev threshold deliv user user request deliveri top relev document publish notif period boolean queri part miss incom document score rank queri paper focu boolean queri user creat maintain profil web interfac softwar client refer manag tool access servic dedic api filter scalabl incom bibliograph metadata match user profil scalabl issu frequenc incom notif applic domain digit librari number profil high profil deposit alert match profil notif crucial task architectur herm consist main compon shown figur notifi observ task integr alert system collect inform number inform provid produc combin stream event filter user profil herm compon task call observ provid herm client observ filter notifi messag queue figur architectur herm system observ architectur architectur observ compon treat type inform provid discuss unifi inform provid handl dedic wrapper compon wrapper consum stream notif format produc stream citat intern format herm figur architectur observ case cooper wrapper forward incom notif intern format provid wrapper translat notif intern format activ inform notif gener citat case mix type inform provid wrapper retriev materi notif extern server inform provid complet passiv synthet notif gener schedul compon observ wrapper retriev materi provid notif provid observ compon call receiv protocol exist receiv herm system handl smtp protocol forward content messag wrapper incom notif includ gener schedul form singl stream wrapper subscrib notif origin provid shown fig easili implement top middlewar wrapper bibliograph materi obtain provid typic form resembl journal tabl content publish user toc journal web site send journal toc plain text format toc vari dedic wrapper extract metadata herm system type individu code convert notif activ gener wrapper system turn wrapper publish web site type wrapper convert tabl content citat publish email notif highli wrapper implement individu gener program languag html page structur typic email approach base rule extract bibliograph data publish web gener wrapper consum xml notif darwin alert system refer journal issu refer url point page journal issu publish web site wrapper publish web site load toc page url appli set rule syntax graph page hyperlink page load addit page graph creat pure data extract analyz page graph structur set rule appli graph transform tion extract tabl content set rule rewrit bibliograph data articl syntax tree xml document citat intern format herm citat return system post gener wrapper outgo stream citat compar wrapper program wrapper smaller easier understand maintain rule higher conceptu level filter filter comparison bibliograph data queri part user profil simpl queri boolean filter herm middlewar filter step respect document structur filter attribut extract xml sax parser assign filter messag header field process xml includ messag notifi notifi retriev messag user schedul notif part user profil xml payload retriev messag transform format prefer user transform format perform xsl stylesheet transform notif deliv client client prefer protocol deliveri implement middlewar commun compon perform middlewar advantag compon independ benefit profil match perform mom mom capabl filter messag selector appli messag header field queri part user profil store subscript mom mom filter messag notif due mom access java messag servic api problem solut section discuss issu encount design implement herm heterogen scalabl wrapper cooper provid wrapper inform sourc base knowledg structur format sourc knowledg typic incomplet case obtain process wrapper handl data inform provid knowledg rapidli outdat inform provid autonom chang structur moment notic notif publish intend human user machin unstructur requir heurist count percentag singl letter line distinguish list author titl articl matter fact heurist produc incorrect result case inform extract web deal semistructur html document typic provid hint find separ data item system herm system write rule robust extent respect structur variat reorder page hold long navig path access data page major layout break wrapper case wrapper monitor perman heurist wrapper produc citat journal issu alert system support fix wrapper feed notif part wrapper wrapper turn stabl prefer cooper inform provid herm project agreement major scientif publish deliv bibliograph data cooper provid bibliograph format protocol cooper provid metadata format automat process herm deliv data set inform queri link document journal paper data format header dtd activ cooper provid submit data send http post method data passiv cooper provid load ftp http case passiv provid schedul observ activ configur domain electron journal provid site occur stabl interv observ activ interv tune mention observ easili extend support addit protocol error handl data exchang protocol implement protocol deliveri bibliograph data defin project initi provid central sourc obtain object identifi electron public idea support publish author link bibliographi entri directli refer fulltext locat provid site defin header sgml dtd herm transform sgml document conform xml minor made addit tag locat articl fulltext protocol submiss bibliograph data easili adopt herm bibliograph data format xml dtd batch submiss transfer format data http post diagnost messag return detail failur report dtd diagnost error messag format submit minim set bibliograph data identifi document data provid person filter includ articl titl dtd element keyword abstract publish deliv data herm support protocol futur provid publish join servic modif made addit element carri document abstract keyword open archiv initi publish protocol metadata harvest data provid technic report publish librari make data access servic provid build servic data alert protocol pull protocol servic provid request metadata record data provid base http xml design simpl experienc develop implement dai metadata bibliograph deliv dublin core format schemata request simpl select set set defin date expect protocol implement number data provid appli protocol mean integr passiv cooper provid filter altern match document metadata user implement match algorithm make exist infrastructur compar implement filter middlewar base tabl relat system mom capabl perform basic messag filter messag selector includ transact support messag herm built top mom addit filter capabl applic mom result coupl compon failur singl compon system applic mom number filter restrict boolean queri rank support number subscript limit attribut fact incom messag assign immedi subscrib interest avoid long delai approach scale product number subscrib limit implement messag top relat solut handl subscript rule tupl public messag trigger perform select statement find interest subscrib approach conveni applic messag system restrict subscript rule make small set comparison oper substr import field digit support experi simpl implement messag queue base relat system advantag knowledg applic domain structur messag public frequenc messag delai hour toler user messag queue consist messag tabl messag subscrib tabl store messag actual queue tabl messag assign subscrib messag selector condit express string appli sql statement select messag messag tabl messag public insert messag data messag tabl updat queue altern conceiv obviou implement trigger subscrib execut insert messag trigger match messag subscrib selector insert tupl messag id subscrib id messag queue tabl directli notifi approach scale low frequenc messag execut trigger scope current implement altern singl trigger execut select subscrib selector solv problem advantag fact updat queue defer hour notif scientif queue updat iter select messag interest insert result tupl messag id subscrib id queue select insert perform singl sql statement short execut time time requir updat queue messag subscrib messag select order hour sun processor gb main subscrib receiv messag perform natur join messag queue tabl select messag dedic subscrib subscrib id api access queue conform subset jm api easili implement exist infrastructur system messag queu system easi implement simpl boolean filter text document data text document titl kind queri lead low recal sophist filter rank mention simpl match perform middlewar product satisfi user sourc bibliograph data provid document abstract addit achiev higher appli classic inform retriev method inform retriev document relev measur paramet term frequenc tf indic queri term occur posit influenc relev score document frequenc idf relev search term respect document collect document collect search term influenc score neg problem alert servic document event document collect exist mimic collect collect incom document insert virtual collect idf comput virtual collect access older document requir actual document collect store term statist topic cover alert servic evolv time improv filter term statist virtual collect evolv outlook alert system mean cope amount scholarli literatur exist alert system field proprietari limit coverag function scholar open integr alert system combin bibliograph metadata sourc maxim coverag sophist filter notif facil achiev high select usabl paper introduc open integr alert herm alert servic digit librari instanc servic public instanc cover hundr scientif journal major includ project partner springer technic report server ncstrl alert system oper scientif librari servic user main issu address herm project heterogen inform inform filter user provid integr herm altern approach provid bibliograph metadata herm wrapper wrapper subject failur due format herm provid join alert servic implement simpl protocol data deliveri filter implement low basi middlewar relat restrict simpl boolean filter futur focu improv filter scalabl distribut duplic relev feedback improv filter qualiti achiev appli method text retriev alert herm design scalabl coupl compon deploi multipl instanc share work relat project shown cooper alert servic improv scalabl instanc alert servic receiv metadata publish propag instanc research find method comput cover relat profil digit librari duplic elimin add inform provid overlap coverag due metadata heurist identifi citat public relev feedback user achiev higher select grade return notif alert system plan adapt exist approach classic inform retriev relev feedback acknowledg herm project fund german research ministri global info initi refer abiteboul queri data volum page ashish knoblock wrapper gener internet sourc proc workshop manag semistructur atzeni mecca cut past sixteenth acm symposium principl page architectur event notif servic scalabl network phd politecnico di dec wang scalabl continu queri system internet proc acm sigmod conf manag mediat data haa sigmod acm sigmod intern confer manag june usa acm di fuggetta exploit infrastructur develop complex distribut system intern confer softwar engin apr european workgroup sgml header version softwar spiliopoul build wrapper publish intern journal digit function base featur humboldt comput scienc prepar crespo extract semistructur inform web proc workshop manag semistructur unifi model internet scale alert servic hui lee hui editor internet applic intern comput scienc hong decemb volum lectur note comput scienc java messag servic api tang support internet applic trigger process chang notif hui lee segal arnold left notif servic australian unix open system user group confer van de lagoz open archiv initi protocol metadata harvest protocol specif open archiv jan yan sift tool inform dissemin usenix technic confer unix advanc comput confer page jan usenix usa
IR/37 5 network comput applic onlin open framework test collect laura gari marchionini gari school inform librari north carolina chapel usa futur bring widespread access larg digit librari video great deal research method retriev digit video type work requir investig acquir digit video studi video inform retriev commun collect video research clear share test collect paper framework test collect describ open video project begun develop test collect base framework test collect meant studi wide rang test algorithm creat surrog video content interfac displai result set queri import challeng develop collect store distribut video object paper meant layout video manag issu influenc distribut storag solut paper describ phase creat test set guidelin build serv basi discuss inform subsequ phase invit research commun involv academ press introduct inevit technic limit widespread usag video librari diminish year ahead prepar futur video ubiquit inform research underwai solv problem retriev digit video collect investig explor autom segment video video surrog improv user access video data larg video librari order test search interfac design facilit search video research gather digit collect video research build video test collect emploi answer research question video test collect gener creat research agreement organ video materi specif research project research commun commit investig video retriev advantag collect build larg video collect commun test collect creation test collect content document design formal plan pave research defin set queri work recogn set academ press al video document abil replic experi make comparison techniqu realiz paper present framework video test collect open video test collect studi wide rang question question relat interfac type user queri appli user strategi framework test collect written text recent research capabl realist concentr video multimedia extens work capabl depend inform technolog advanc offer special challeng distribut storag commun movement larg file test possibl user interfac research distribut world benefit ds techniqu move node physic closer user open video project benefit particip project issu open video collect channel infrastructur background user video collect store tape process find video segment time consum imagin teacher short segment water pollut documentari film product crew specif clip event identifi titl video view entir content select desir video segment search titl broad topic locat segment video requir user view hour videotap tediou video resourc specif content chunk easier find video effect practic inform user unabl locat search underutil digit video collect make retriev easier offer potenti user obtain maximum benefit video data search sequenti random access part video digit format elimin frustrat wait segment video permit user jump ahead interv scan content digit video open possibl index abstract difficult achiev text retriev benefit comput strategi statist probabilist analysi video retriev benefit comput analysi visual element element process import research issu open video test collect automat creat salient imag short clip describ essenc entir video exampl digit video user rapidli select relev clip abil find video quickli gain storag video digit format insur greater video data amount video data digit format continu digit camera person comput edit tool commonplac larg collect digit video longer dream futur type video data includ collect consist numer genr genr video includ featur govern sponsor surveil exist digit video collect make easier user locat desir segment access manipul video data storag cost declin comparison network video repositori depend creativ wai manag tradeoff order inform larg digit system search retriev document develop idea search electron environ text document studi extens test collect import testb demonstr text retriev confer corpu coordin nation institut standard technolog trec larg text corpu sourc sponsor ongo set studi confer advanc state retriev engin research methodolog inform retriev gener technolog advanc extend knowledg digit video document includ learn segment video chunk make effect surrog video natur stori unit video recov intern content video file end begin unit content correl scene method detect segment characterist video introduc set index search problem research question focu explor wai user queri make video surrog strategi video research work issu text document retriev built test collect answer question nation institut standard technolog recogn begun develop corpu video video retriev research small sampl project discuss order illustr varieti research problem video retriev commun address al test collect creat defin detail describ major focu section briefli outlin project term type question investig test collect answer question singapor work video retriev sequenc system goal project studi tool manag video data effici number type tool built exampl method divid video shot scene editor user group set shot entiti order test retriev singl video documentari nation singapor video segment video shot video scene text properti video manual enter queri formul test queri set relev shot predetermin queri design evalu specif aspect system inform qualiti video unknown video produc written script action zhang al automat extract keyfram video index system retriev base tempor keyfram featur system perform find similar shot base camera pan averag colour histogram raw video elabor produc danc video experi total length video footag combin minut chosen author felt video repres content materi style present gener find produc wolf al construct video librari world wide web librari test collect type algorithm support access multimedia materi individu program search entir collect annot keyfram surrog includ collect user textual search collect order narrow result set librari appli keyfram video result set arrang slide show format test collect design realist situat audienc educ collect polit nasa documentari select video presidenti librari video public domain titl chosen histor rang hour length video segment small clip teacher classroom open video test collect gauch al creat vision digit video librari index search librari test collect evalu search retriev video network wide rang bandwidth research studi automat mechan librari creation collect video local station cnn video automat segment short segment base content collect intend support network user low bandwidth user kb highest compress ratio coupl lowest imag captur size compress ratio captur size suggest gener audienc kb bandwidth highest qualiti video intend user atm test collect kb imag captur size compress ratio carnegi mellon project built terabyt video digit librari collect primarili documentari obtain sourc includ discoveri public public domain video govern sourc video imag fp format segment averag clip length minut video abstract includ video extract research project feel rang natur video collect lead develop gener video abstract applic kind video collect specif research project christel al hour video public infinit planet space ag explor type video surrog video studi averag minut manual segment studi stem project center speech imag process natur languag process tempor segment extract content index retriev video yeung base system type microscop macroscop microscop refer shot frame macroscop refer video stori scene microscop tool consist keyfram view shot playback mechan satisfi user macroscop method cluster video shot stori unit implement shot extract video program transit repres highlevel structur content clip demonstr system ibm commerci previou studi episod al popular test present result stori unit cluster baltimor learn commun project make dynam queri interfac explor resourc digit video collect displai overview video collect categor dynam chang map video teach sourc video titl keyfram provid preview segment video overview level preview level reveal gist individu segment collect consist hour discoveri channel documentari public domain materi nation archiv nasa video divid minut length manual segment unit design includ part classroom lesson segment design singl distinct section content segment manual index part resourc collect includ textual descript video format futur plan includ video stream directli classroom chang al develop search system imag video world wide web webseek store visual summari pointer visual inform sourc www system web spider collect inform video web detect file extens time system index video sequenc index accomplish kei term html tag url map video subject class semant ontolog webseek process queri oper queri oper support oper support subject navig visual view content review current video collect show research creat varieti solut answer wide rang video retriev question spent great deal time gather digit video order accomplish task type featur select amount motion specif video data number hour vari project project collect gather rang size minut segment hour worth video segment adequ test method automat gener salient investig aspect video requir substanti set data work collect produc excel intend motiv suggest collabor produc test collect video endeavour build test collect open video test collect object open video test collect provid mean research begin understand inform retriev video collect previou test collect text retriev built understand perform retriev algorithm system recal primari measur perform test collect explor recal metric video retriev index techniqu video explor aspect relev video segment test collect studi search action addit search syntact level featur video desert blue broad research explor interact subject navig visual search research address problem algorithm segment wai video surrog wai automat index video advantag open video testb numer collect construct investig video retriev question motiv build test collect underscor benefit creat share collect centr legal aspect build commun problem space properti collect motiv base share distribut test collect content begin type video retriev project requir great initi effort locat digit video research donat video commerci film industri bound agreement prohibit materi distribut project explan difficult replic make comparison video retriev easi share materi test relat motiv creat test collect organ collabor video retriev research commun share result data frustrat cooper test collect construct forc research form strategi futur work field motiv creat test collect collect work effect design content avoid problem test collect test small consid repres sampl difficult find explan collect experi document test collect al overview test collect open video test collect intend initi phase larger endeavor project meant grow particip research commun aim assembl hour open sourc video data preliminari framework present paper hour illustr mix factor video materi public domain obtain ad design collect research trec form text retriev permiss obtain includ copyright materi framework outlin paper includ set condit segment storag issu effort explor index definit set queri relev continu work metric establish phase develop phase research begin work issu framework test collect written text recent research capabl realist concentr video multimedia extens work sparck jone ideal text collect larg reflect real retriev environ sparck jone state document collect real retriev environ exhibit varieti homogen rang languag document text collect repres bibliograph control languag index video written requir test collect analog correl content video document includ test collect ultim select document ad base plan opportunist collect turn narrow broad strategi build larg collect begin initi set specif start resourc easiest obtain distribut public domain video satisfi preliminari requir type issu assembl video amount versu edit content characterist amount video full length compress format test collect resourc gener video ir goal assembl video freeli access order promot studi evalu video storag retriev system open video test collect factor video select manner factor rang time appropri repres collect addit video type video surrog includ phase wai summar video document retriev includ audio text element combin collect ultim text transcript close caption text text visual surrog video chosen part collect realist situat user group requir complet video program smaller segment program storag distribut import note test collect offer capabl transfer complet video file local system commerci appeal stream media solut storag requir obtain assort video compress format support multipl class potenti user challeng face provid suitabl set specif describ content test collect factor consid order maintain test collect video vari specif practic list factor time period run amount colour sound raw footag segment durat compress type test collect suffici larg provid video satisfi combin factor design test collect consist clip desir build collect scatter combin factor valu repres relev research genr word genr defin type categori classifi video pattern numer genr video peopl familiar classif local video scienc public cult war film video refer appli includ game talk public servic announc music video broken finer detail video split detect stori method break genr artist style studio produc studio distinguish past style techniqu al genr chang time genr exist train film surveil home video addit comput anim program initi test collect consist public domain video expect phase collect limit genr obtain primarili govern individu seek commerci gain intellectu properti difficult find video restrict raw public servic govern produc histor train film educ documentari repres genr video project obtain permiss featur program major recent broadcast major benefit public domain collect content freeli research expand collect genr found portion restrict research time attribut type time attribut concern time period film produc durat video import includ video rang time period provid robust test algorithm style product qualiti durat length video term minut factor attempt plan varieti video length ad test collect ahead smaller length video fill hour allot guidelin factor cinema histori broken specif artist stylist period relev specif aspect video retriev film period brought technic advanc start earli creation vocabulari camera movement cinema shape invent lightweight camera late freedom movement benefici note artist period film belong group video test collect strictli period tricki classifi video requir great deal knowledg artist aspect cinema period overlap video fit neatli place initi set video type video fit artist period categori practic find gener time period number hour video interv open video test collect copyright materi ad test group defin time interv base artist technic histori durat video collect minut hour durat count entir portion video edit time product singl program case raw footag cut final product includ pat final product object durat video continu theme topic video video broken segment individu segment subset segment includ test collect motion attribut select video amount motion action depict video factor account research keyfram select motion specif film camera techniqu emploi motion attent dramat scene transit dramat video segment keyfram algorithm produc dispar result base amount motion video build entir collect content high amount motion major phase materi obtain govern effort made balanc collect term amount motion accomplish automat motion detect algorithm place video predefin categori edit attribut proport video test collect dialogu raw neglig detail addit factor import video inform retriev research techniqu produc colour film chang great deal year black white film predomin contrast tone contrast rel dark light area imag tone relationship dark light stock film tone interest earli earli film film give colour step separ strip film record yellow spectrum process produc singl colour version system replac step spectrum layer colour neg manufactur kodak compani colour improv al retriev differ qualiti affect autom process algorithm work differ video specif colour technic capabl produc sound improv sound film develop magnet tape late sound record bulki equip difficult record digit sound record qualiti type record sound influenc retriev research restrict limit movement earli film qualiti sound speech recognit reason video vari sound qualiti addit video sound video stori told depend music complet silent movi red entir stori convei dialogu studi explor method creat abstract research find explor stori dialogu omit type silent film deni video retriev commun wide varieti materi raw footag investig essenti edit version film evid recal video depend underli stori structur shot sequenc includ test collect valuabl investig opportun work edit index video wai retriev segment factor determin natur test collect amount type video segment question hand collect consist program segment clip segment segment algorithm manual segment video descript segment select advantag video program research control video segment drawback video program impract store compress version program effici break program segment compress clip compress method irrelev decid store uncompress impract time format imag size ð pixel uncompress video frame megabyt gigabyt hour needless hour test collect open video test collect requir disk space store compress requir deal video document numer wai compress video techniqu direct effect retriev system effect includ algorithm keyfram extract user view video addit select compress select paramet audio bit compress ratio altern mean provid guidelin order prevent situat entir test collect consist video compress method paramet import compress chosen carefulli depend video class intend user macintosh comput kb bandwidth reason imag captur size compress ratio compress method outdat updat plan ad regularli type chosen influenc qualiti video user determin attribut colour keyfram compress ratio creat specif type applic format suitabl internet video videoconferenc select focu test collect guidelin appl fall quicktim architectur extrem popular commerci rom internet quicktim format gener provid video moder mean approxim low vh standard fp mono sound quarter screen window design typic resolut frame kb microsoft develop proprietari video window video moder qualiti architectur low bandwidth design video stream internet standard fractal gener internet fractal recommend high bandwidth frame rate applic corpor intranet bandwidth scale kbp kbp kbp modem isdn mpeg pictur expert format design deliv full screen video roughli vh qualiti video fp data rate kb design broadcast qualiti digit high definit dvd data rate mbit main profil mbit low bandwidth format internet imposs al format disadvantag advantag depend intend research project major video storag retriev work research institut past ten year involv mpeg compress video preval index research trend work found greater number complet survei project fair guess motion jpeg frequent studi video process uncompress video reason format vari sum explan state mpeg standard arguabl wide accept intern video compress contribut factor mpeg develop organ standard corpor mpeg good qualiti video provid full screen video work began mpeg influenti project mpeg base numer techniqu test collect content provid specif format research commun mpeg domin test format ad demand languag multilingu retriev audio video document import digit librari research topic current user electron resourc limit document languag familiar reliabl retriev realiti research activ investig method audio compon video retriev work speech recognit english languag video complet informedia project work complet area video test collect languag english promot addit research area test collect subgroup question remain languag languag type video metadata investig navig organ video system depend video data type inform extrem includ audio visual metadata video summar video salient audio textual overview number research investig excit distribut output techniqu keyfram extract algorithm open video test collect make test collect opportun output materi implement system evalu close audio descript obtain make excel resourc provid set metadata describ video relat resourc repositori primari reason metadata search enabl research find video segment surrog research size video repositori effici effect search repositori import abil quickli locat video segment produc year includ approxim research includ select metadata content test basi robust search retriev facil primari repositori metadata provid research full descript video work investig primarili interest video segment colour approxim frame length attribut search investig begin work data rate video import provid data part repositori mean determin record reduc burden research extract relev metadata detail video content small set metadata describ video content open video project repositori collect enter tabl shown implement section list metadata includ metadata attribut sourc video produc sort content attribut segment digit sourc video number compress attribut video surrog composit type frame attribut list tabl definit set metadata test seek suggest potenti user repositori metadata import includ make adjust begin stage speed develop research start test collect publicli interfac creat interfac enabl research search content collect attribut result search present summari al access complet detail segment segment click search result displai interfac refin suggest gather digit video research commun metric document collect typic recal design judg user obtain inform retriev method recal proport relev document retriev defin number relev item retriev divid total number relev item collect proport retriev document relev defin number relev item retriev divid total number item retriev text test aim determin techniqu combin techniqu result figur recal measur video collect concept document entir corpu product test collect video basi discuss recal opportun understand measur video collect video collect gener type metric explor studi video keyfram measur abil set keyfram fuzzi idea consid gaug abil search specif object estim abil understand theme video document set keyfram measur judg peopl determin action content multipl set keyfram select relev video type metric plai role futur video ir research eventu research test collect retriev video document collect achiev number wai video search natur languag visual featur imag motion auditori featur queri goal test collect studi characterist behaviour queri formul queri express format list combin result set displai input format combin build test collect size provid set video research work interfac visual displai result set implement plan open video test collect hour minut compress video requir mb hard disk hour claim mb gb addit space video store multipl format segment solut space hold video metadata safe assum terabyt storag problem test collect begin explor feasibl open video project assembl video govern contribut informedia organ sourc begun experi wai organ deliv time hour video genr special channel provid distribut storag infrastructur initi support distribut host research educ commun paper special primari data file store distribut backbon metadata access retriev interfac server north carolina retriev user download select video file server effici manner system dynam redirect url request download place closest replic server rel client preliminari provis ad contribut research commun metadata primari metadata place place video repositori provid link video data maintain hope provid flexibl option institut research commun grow quickli open sourc commun studi linux recommend meant illustr definit global research commun requir proport languag coverag technic advanc requir addit segment code scheme recommend offer start point discuss recommend preliminari list recommend amount type video suppli tabl suggest guess test collect intend stimul discuss list modifi reflect carri video retriev research order understand made creat short summari choic provid factor al tabl preliminari composit estim open video repositori factor type amount amount genr documentari fiction comedi fiction drama fiction action public servic histor record movi surveil sport time period amount motion low medium high colour sound music dialogu sound silent languag english spanish german french footag edit durat hour hour hour hour hour minut minut minut segment segment manual base scene chang base fix time length compress open video test collect genr genr list hour cover small subset categori video content definit genr includ phase list tabl review select video public proport base larg anticip hour consist obtain time period time period chosen base roughli artist film histori mark evolut film econom era silent film span number earli longer restrict technolog improv term sound addit stylist occur ag film fell period advanc due world war ii film industri confront challeng grow film art separ time period present percent hour alloc test collect consist video creat challeng obtain due copyright limit video produc difficult obtain interest edit public domain materi find larg portion raw footag tabl genr definit list present factual inform intend entertain educ edit factual inform includ comment provid report recent event time video fiction fiction work stori convei audienc element charact plot show featur film expect type public group select gener action drama action film includ war film fiction natur dw classic film birth fall public announc govern program benefit serv popul video creat order spread idea inform damag histor record video creat intent record event histori includ presidenti demonstr natur disast genr meant topic home clip depict ordinari life footag camera set observ monitor area video raw depict physic team game al amount motion factor video split medium high low motion mean person sit desk talk video inact interv period high action video amount low high action high motion video action scene great deal frequent footbal person run bird flight rang valu categori establish autom motion detect method autom effici procedur determin segment video medium high motion colour video process colour film print categori includ colour neg number film made stock provid dimens colour acquir consid video part part includ ad phase ii video creat colour sound sound record film late technic allot silent film cover time period addit estim time period home video raw footag silent film creat music dialogu silent film music score accompani score dub film consid music digit audio imag file includ metadata sound categori includ video creat music human dialogu categori speech music video speech music consid video anticip largest proport video music dialogu languag phase english languag video preval acknowledg collect larger size assembl languag suggest chosen base search public domain video collect nation archiv nail small percentag german french video includ research languag wide easili obtain addit asian languag open video test collect explor korean incorpor phase test collect develop difficult locat video languag edit film assembl cut rearrang individu camera shot larger unit histor record home video expect raw footag twenti percent video alloc genr extra genr durat durat refer length segment interv form separ categori make proport video allot categori surveil video long major categori numer shorter length public domain clip account guidelin flexibl due fact imposs result number hour segment chose broad categori video segment video intact file consist topic edit program manual segment video base human unit video segment scene segment techniqu break video chunk base automat detect scene algorithm scene chang detect group categori phase ii includ specif break categori smaller video segment time manual automat segment regular time instanc minut minut compress mpeg compress video domin collect due research demand eighti percent video collect ten percent compress motion popular standard consist quicktim compress numer combin paramet phase break rang phase ii uncompress video exclud phase due high amount space storag metadata metadata store attribut inform video collect provid descript inform video user video repositori refer al search video segment research inform describ characterist sourc digit video surrog supplementari materi video includ specif attribut store list tabl commun establish test collect provid collabor commun research achiev tabl sourc video attribut attribut descript uniqu id uniqu identifi automat gener primari titl main titl video video tape secondari titl secondari distinguish specif product date date origin video produc creat org sourc origin video genr type content public descript gener descript video content colour sound music voic silent amount motion high copyright copyright statement tabl digit video attribut attribut descript digit org organ digit origin video sourc digit date date video segment digit file size size digit mb compress format motion real quick time durat length digit video frame dimens pixel dimens frame number frame total number frame video frame rate frame compress data rate data rate mbp specif compress scheme digit edit video edit digit segment video scene fix time locat complet url video file materi text inform pointer compress version relat materi materi file complet url materi file contributor contribut video contribut contributor org contribut video contributor contributor email contribut video address contributor tabl surrog attribut attribut descript open video test collect uniqu id uniqu identifi kei uniqu id video number number surrog frame creat extract method method extract surrog frame frame size pixel dimens surrog frame open sourc commun led engin econom model softwar time similar effort made inform resourc digit librari movement ultim move addit paper web site encourag repositori discuss sigir workshop video retriev berkelei august symposium host octob chapel hill discuss video retriev evalu test repositori continu encourag discuss promot cooper research improv test collect guidelin suggest paper meant flexibl serv basi perman specif term supplement test commun undertak essenti task concern track describ metric list metric section addit research area hope test collect grow task involv build queri topic consid paper begin studi aspect search provid queri collect consist user suppli queri relev judgement phase ii put hour public domain video place step success test collect type public domain video limit major video document copyright essenti includ phase project focu acquir legal author make resourc copyright restrict topic discuss addit subgroup video aspect focu specif involv video retriev develop queri collect metric gaug user locat video document area inquiri expand phase test collect fulli develop al present motiv build share video test collect benefit build open sourc collect research free constraint copyright materi long unrestrict video retriev system facilit collabor work advantag cooper construct test collect forc commun form strategi conduct research test collect studi wide rang problem focu specif aspect depend direct chosen gain achiev size properti collect construct larg collect quickli work metadata document richer group work data paper overview assort video retriev project order illustr varieti excit question problem solv area video retriev design test collect instrument investig reach goal exist larg collect video enabl research investig storag issu internet tomorrow suggest test collect framework outlin collect requir discuss feedback refin suggest number factor consid build test collect time amount colour sound raw footag segment durat compress type import aspect build test factor modifi factor number hour factor paper touch briefli sourc public domain video govern chang initi paper neglect includ practic manag maintain test queri cost estim project acquir sustain fund design plan test collect potenti valuabl tool video retriev undertaken combin effort discuss test collect illustr number issu interest research develop distribut storag solut facil transfer file stream video requir substanti redund larg file content compress scheme open video test collect strong coupl file variat depend video retriev research upload result experi includ larg file result segment index set refer yeung cluster segment video stori unit paper present intern confer pattern recognit doermann faloutso video repres visual structur video sequenc paper present acm multimedia washington allen england comparison automat video segment algorithm paper present east nov medium video sequenc paper present video abstract commun acm wolf kei frame select motion analysi ieee winkler taylor improv access digit video librari paper present ifip confer australia shot classif method select effect video paper present acm multimedia dynam kei frame present techniqu augment video paper present avi itali ding cognit process multimod surrog video unpublish doctor colleg md marchionini shneiderman object recognit capabl present simultan video kei frame surrog paper present research advanc technolog digit ercim european dl sparck jone van rijsbergen inform retriev test collect progress harman darpa tipster project sigir forum harman sixth text retriev confer nist special public md schmidt digit video test collect paper present acm sigir confer research develop inform california video retriev sequenc system acm transact inform system wu video retriev integr solut paper present acm multimedia week digit video librari world wide web paper present acm multimedia li gauch vision digit video librari inform process manag smith steven intellig access digit informedia project gong hauptmann lesson learn build terabyt digit video librari al winkler taylor multimedia abstract digit video librari paper present acm digit librari pa witbrock inform acquisit retriev intellig multimedia inform retriev mayburi menlo mit press smith kanad video skim quick base audio imag technic report carnegi mellon yeung video visual compact present pictori content research report rc ibm ahlberg shneiderman visual inform tight coupl dynam queri filter displai paper present acm sigchi human factor comput ny marchionini inform seek electron environ cambridg press beal build electron learn design implement paper present acm sigchi human factor comput lo digit resourc learn commun acm dl juli pp beigi benitez visual inform retriev larg distribut onlin repositori commun acm masand stanfil inform retriev test collect paper present trec fox characterist collect comput inform scienc textual bibliograph concept scienc depart technic report cornel harman trec confer paper present read theori film media oxford press manipul effect film person aesthet empir studi art doermann rosenfeld compress domain video segment colleg maryland oard serv user inform retriev digit librari decemb hauptmann speech recognit informedia digit video limit paper present ieee intern confer tool nov waibel wactlar transcrib multilingu broadcast hypothesi driven lexic adapt paper present darpa broadcast transcript understand va feb marchionini preview video kei frame high rate video interfac paper present intern symposium practic digit japan marchionini kei frame preview techniqu video paper present acm digit jone greenberg quantit profil commun open sourc linux develop technic report chapel north carolina open video test collect marchionini augment librari intern symposium digit librari septemb sparck jone perform yardstick test collect journal
Agents/38 1 implement team agent plai simul robot soccer depart comput scienc lund box sweden draft octob abstract articl intend present overview issu relat implement team cooper agent plai simul robot soccer introduc concept robot soccer simul environ discuss robot soccer interest applic area point view robot arti cial intellig main part paper discuss agent theoret practic point view discuss combin individu agent team common strategi goal discuss individu team level introduct robot soccer grow area interest robot arti cial intellig commun reason main complex domain set ned rule govern behaviour agent domain domain suit experi area robot implement mobil control arti cial intellig collect robot commun long time set benchmark compar robot implement scenario aaai confer held year ort creat contest annual robot mit robot build held januari aim attract student provid benchmark scienti robot commun robot benchmark robot soccer environ number solut divid competit robot di erent size enter rang khepera mm robot approxim half meter diamet central system experi complet distribut environ requir robust mechan design set sensori method process sensori data control system care sensori data make act tight requir domain present challeng problem contemporari robot arti cial intellig bene robot soccer benchmark constraint forc design resourc limit construct system creat perfect reason number cope fact agent autonom act chang environ system ration accuraci qualiti hand hand found principl implement ecient complex domain reaction advanc import part design incorpor learn method enter imag level singl robot softwar learn basic individu skill level includ learn cooper behaviour level learn tactic includ learn match interest observ short period activ robot soccer number innov phd emerg recent exampl cite month area interest claim cover relev issu articl meant introduct eld set guidelin pointer relev literatur robot soccer origin idea robot soccer alan suggest major organ promot robot soccer import test domain robot arti cial intellig part involv arrang robot soccer robocup decrypt intern robot soccer doesnt complet logic soccer leagu robocup anim driven korean organ similar goal similar method achiev compet simpli form common organ market goal began recent appar introduct soni leagu distinct hard understand divid competit coupl leagu plan introduc activ maximum size eld robot maximum size eld robot organ competit singl khepera robocup competit divid activ team plai eld complet realiz hardwar enter contest eleven softwar agent build small ve robot maxim diamet plai eld tabl medium ve robot maxim diamet plai eld cm team consist number soni leagu introduc detail found depend type robot develop set suit intend experi leagu central vision disallow regul central control system robot requir complet provid limit coordin room compar condit type system test robot soccer competit gain interest popular recent year arti cial intellig point hardwar realiz autonom agent secondari import realist unpredict test environ theoret develop lead solut scale provid room narrow set behaviour rich simul environ properti import eld robot soccer simul environ er focu set rest paper doesnt rank robocup higher realist testb claim intend make robocup simul interest rich domain provid environ arti cial agent worth interest simul leagu robocup order encourag ai research test idea realist environ noda al creat simul call robocup simul soccer match team consist eleven agent architectur simul present figur client client client socket socket socket field simul messag board window fig structur soccer server soccer server connect number client commun server network datagram socket consid cumbersom program common control protocol broadcast number machin socket good sourc inform program socket commun varieti unix socket faq usual archiv net client send receiv command control player server basic action command client power view angl width bodi sensori inform gather function time time direct client control player restrict client implement platform long obei protocol de ned commun soccer server server consist main eld eld simul care movement calcul object present eld interact modul control game soccer rule reason modul interfac human interact game announc situat kick respect messag board manag commun client simul assum xed eld dimens width goal player ball treat circl move plane paramet describ movement player ball includ veloc decai factor object resolv veloc chang direct appropri order ect uncertainti physic soccer server add random movement object paramet de ned special con gurat le read begin session soccer server recent soccer server softwar time write download robocup home page directli number platform prepar machin run variat unix collect ort put accur manual describ latest server version manual date juli inform build soccer server client conform protocol recent version simul support featur side rule handl possibl turn neck rel direct face player order achiev command neck coach client watch eld game issu train suggest player coach client control player train session issu command object mode plai simpl softwar client program call task visual game crt screen comput run server number monitor client connect soccer server game enjoi multipl spectat soccer monitor run distinct machin soccer server exist robocup simul mail list manag gal kaminka cover implement usag relat topic implementor simul robocup team sourc inform individu agent rst major design issu face robocup programm agent structur chosen player numer textbook text focuss agent exhaust coverag topic number basi person prefer overview area interest reader consult ai textbook good cover area agent perspect agent languag held conjunct ijcai ecai confer recent icma confer good book recent topic robocup workshop includ descript team particip contest valuabl sourc edit volum recent book form agent architectur order provid capabl requir success player architectur player agent decad number plausibl design care specul reactiv aspect agent introduc short overview subsect written architectur burkhard reactiv action packag subsumpt architectur interrap procedur reason system layer architectur reactiv capabl distribut control al stone al cmu player receiv inform updat world model decid action perform execut send command design reactiv vari success success team humboldt appli combin reactiv order achiev game implement skill architectur agent rst step long process team implement step provid player basic set skill act eld skill immedi mind captur kick prede ned pass ball shoot cover skill readi proce team implement import aspect skill capabl requir special reason player decid pass ball explicit reason paramet kick hard angl medium power angl suggest skill execut ecient major factor ect implement skill resourc limit major resourc scarc time cycl time soccer server set player obtain sensori inform cycl issu action command cycl process possibl act lost player wait cycl soccer server issu command inform server world agent incomplet agent yield approxim result listen teammat rang smaller size simul world behav uncertainti built server amount inform process larg neighbour player possibl creat accur world plan adequ futur skill focu inform neglect world model creat error uncertainti architectur chosen order facilit distribut inform make act learn straightforward implement agent reaction put piec softwar dynam complex environ make task point develop learn techniqu tool develop agent skill good overview machin learn consult textbook depend architectur assum agent room learn techniqu kind place agent control system combin achiev result modul agent tree popular ecient rule tabl symbol reason bdi techniqu requir special learn algorithm vast major learn system popular paradigm call reinforc learn good overview consult reinforc learn simplest form requir feedback inform grade success recent execut action feedback reinforc learn ectiv implement system obviou applic learn techniqu improv individu skill agent case classi cation current situat make manner neural learn algorithm prove feedback de common situat design individu agent advanc learn techniqu order properli teach player research learn delai reward initi watkin develop appli team particip robocup suitabl modi learn coordin teammat section interest approach learn base evolutionari strategi straightforward genet algorithm optim paramet set place agent program genet program paradigm evolv control program techniqu limit implement function interest success approach appli recent task evolv control robocup agent idea number agent plai oppon role attack speci properti evolv simultan attack group begin gather properti success begin score defend adapt environ develop skill make attack ecient di erent skill evolv process team system interest eld research case wait time written stone al cmu reinforc level team learn evolutionari strategi prove ecienc improv coach suitabl medium implement learn strategi robocup simul environ robot soccer dynam testb research interest creat ti cial intellig system develop success team easi task combin techniqu develop newli creat succe task challeng system submit robocup competit reli observ number algorithm emerg research initi robocup initi fact innov team cmu rst place competit prove idea common testb ai robot brought fruit hope futur origin contribut push ai forward complex system act realist domain scienti robocup challeng admit de nite great fun develop simul soccer team watch success confront team notic undergradu number base practic part project grow year expect student possibl attract ai techniqu applic nger cross acknowledg paper creat result cooper peopl coradeschi paul collabor cial intellig captur interest area provid lot materi paper base petri work implement idea defer learn student recent provid valuabl understand problem acknowledg provid environ encourag experi contribut mail list overestim particip refer rodnei brook intellig arti cial wendler arti cial soccer ai coradeschi robocup arti cial intellig program journal robot societi proc lnc al ver juli jacqu ferber introduct distribut arti cial intellig jame firbi adapt execut complex dynam world phd depart comput yale gat reliabl reactiv control autonom mobil robot phd virginia institut state michael georg ami lanski reactiv reason plan sixth nation confer arti cial page morgan petri delai reward reinforc experi control proc nation confer page lesli pack michael andrew moor reinforc survei journal arti cial intellig matsubara challeng problem ai ai asada robocup synthet agent challeng proc hiroaki editor robot soccer world cup volum lnai lnc zbigniew michalewicz genet algorithm data structur evolutionari program tom mitchel machin learn magnu erik realtim hierarch control ieee septemb marku michael thiel pragmat approach model autonom interact system preliminari report michael wooldridg nichola workshop agent architectur page august jp mp editor intellig agent agent architectur volum lnai lnc itsuki noda soccer simul robocup workshop entertain reactiv task execut mobil robot phd depart electr decemb stuart russel peter norvig arti cial modern approach prentic stone veloso learn state featur reinforc learn proc intern confer machin peter stone layer learn system phd school comput carnegi mellon decemb watkin learn delai reward phd king gerhard editor multiag modern approach distribut arti cial intellig mit
ML/39 6 formal concept learn system valid volker dotsch universitat leipzig institut fur informatik leipzig germani gunter grieser tu darmstadt fachbereich informatik darmstadt germani klau jantk deutsch forschungszentrum fur kunstlich intelligenz saarbrucken germani steffen lang universitat leipzig institut fur informatik leipzig germani abstract problem area evalu complex softwar distinguish area applic identifi buzzword valid perspect adopt author oleari verif formal base support formal reason tool theorem instanc scope verif approach limit difficulti find suffici complet formal built paramount realist problem valid stringent charact valid result definit aim paper exemplifi valid approach base clear formal theori valid verif brought closer benefit concert action depend softwar system suffici clear author select applic domain algorithm system learn formal languag mean valid toolkit seri valid experi perform result present sake illustr underli formal concept compar valid learn approach invalid interest result motiv power comput system bear abund evid methodolog tool system evalu legal formal copyright american associ artifici intellig reserv german digit signatur act make high expect depend system explicit european inform technolog secur evalu criteria common criteria inform technolog secur evalu kei requir meet larg varieti secur properti high evalu level formal model present reason step verif plai case suffici complet formal model formal reason procedur find system meet user expect necess applic valid term denot area deal problem slightli inform verif wai verif valid closer attack problem possibl verif valid express essenti approach term present paper contribut endeavour author develop formal concept learn system valid lang bring valid closer formal standard verif approach present prove formal concept work practic appli algorithm resp system develop formal languag concept discrimin valid system invalid valid meet verif applic domain learn algorithm resp system subject valid learn formal languag minim collect formal introduc inform semin paper underli learn paradigm invok smith excel survei respect target class formal languag learnt concept list learn theoret investig siromonei drawn attent simpl type list inform list finit sequenc label word label final word wn equal empti word list easili understood classifi word underli alphabet word fed cdl check node check reveal subword input word classifi determin accept input word pass check wn equal subword process termin manner cdl illustr alphabet bg roughli languag accept set word squar complement consist word identifi cdl languag accept meant clear context wai present inform formal languag learnt basic approach defin kei concept text text sequenc word exhaust target languag inform sequenc word label altern word label form text remain word label form text complement target languag fundament result impli arbitrari list learnabl inform knowledg cdl potenti acquir process finit label word languag accept formal learn algorithm success fed inform output sequenc stabil correct hypothesi target cdl albert present simpl learn algorithm design acquir knowledg cdl finit case select collect case subsequ present extend adapt similar concept hope learn siromonei learn subsequ call find learn cdl presenc learn algorithm find total respond input data present valid learn adopt theoret concept learn system valid develop lang seri support experi perform valid toolkit tic design implement evalu induct learn algorithm valid scenario focu present paper interact approach valid complex interact system exemplifi gonzalez abel gonzalez al inspir advoc gonzalez subsequ public type approach system valid systemat interrog specif class target perspect adopt adapt jantk lang jantk instanc base lang author develop investig formal scenario valid induct learn system valid interrog perform essenti stage test case assess test case gener depend intend target behaviour respect peculiar system valid interact valid perform feed test data system receiv system result subject evalu ultim valid assess total evalu outcom adapt scenario valid system design learn list case system emploi basic face valid learn principl jantk valid problem induct learn system type tripl ffl set ffl learn algorithm ffl criterion success question learn cdl respect consid criterion success valid ongo debat necess system knowledg question extent black box valid process extra system knowledg success learn system valid herrmann assum learn algorithm inspect meet properti test data gener test case gener matur research develop area larg varieti approach rang mathemat background al found human kei question suitabl test relat system deriv present applic gener approach cdl test data cdl pair word classif assign ci set test data test case consist cdl set test data tc ei set potenti test case cdl deal problem set learn algorithm learn infinit test learn algorithm abil finit initi approach select randomli idea select cdl complex select typic cdl hand set test data individu cdl infinit probe learn algorithm finit fraction data finit fraction select suffici larg learn target cdl special bound size suffici larg test data set jantk sakakibara siromonei deal test data set size theoret bound test data basi kei activ scientif gener goal investig narrow valid artifact systemat deem essenti scenario determin interact target system learn algorithm subject valid process finit list test data finit set awar output algorithm depend order frequenc test data occur complic slightli deal learn algorithm gener output input contrast lang yield simplif procedur test case ei tc intens paramet determin finit collect list length target learn algorithm test list test data possibl repetit list creat draw randomli independ test data intens paramet learn algorithm output process initi segment length tripl call protocol evalu protocol individu experi subject expert evalu mark number express opinion experi wit learn algorithm abil learn target cdl realiz map eval expert evalu function tupl bi consist protocol expert evalu report question invok comput program evalu protocol yield result lang impress evalu learn algorithm resp system requir comput program achiev man expert involv rate qualiti protocol learn domain learn algorithm poss conveni properti implement suffici evalu corollari proposit lang languag cdl defin regular uniformli decid actual hypothesi learn algorithm resp find describ target cdl correctli deeper studi evalu fix length ratio word length equal correctli classifi eval fraction cardin set evalu protocol establish elementari build block valid assess assess complex huge step evalu local featur qualiti assess author suggest numer approach combin set sequenc report gonzalez result interact monolith valid assess prefer structur combin result complex chart repres knowledg acquir lang finit set report form valid sequenc statement call valid dialogu system valid respect criterion success result success valid inform dialogu experi basi larger larger test data set report expert evalu eval converg discuss section experi provid initi segment potenti infinit valid dialogu learn algorithm inspect meet properti exploit deriv valid statement small number report algorithm chang respect hypothesi case current correctli classifi data call extrapol algorithm behaviour shown conserv learn algorithm output correct hypothesi target algorithm learn cdl requir valid result case perform coupl experi order valid learn algorithm find probe learn algorithm analyz perform learn cdl experi valid toolkit tic jantk select test cdl cdl defin acceptor word termin alphabet cdl classifi word larger termin alphabet cg probe learn algorithm case cdl fix test data set consist test data form word length equal select randomli list length element creat protocol reflect algorithm behaviour initi segment length figur displai essenti result valid show protocol rate evalu subsect varianc vertic interv figur figur displai essenti result valid dialogu case cdl defin target learn task randomli select list length form element test data set consist test data word length equal figur curv tempt conjectur learn algorithm find pretti good learn target cdl closer analysi protocol prove process complet list length find output target cdl find conserv learn prove find learn cdl inform process list length initi segment curv depict learn algorithm show accuraci remark closer protocol output correct hypothesi perform good find account unabl learn situat find perform conjectur find valid valid statement deriv nice fit insight theoret analysi learn algorithm find discov siromonei formal prove find learn cdl inform jantk show cdl inform unabl learn cdl inform depend complet knowledg assess system qualiti base formal method tool high tool support desir requir area system behaviour evalu inform requir valid previou author develop formal framework valid concept concept appli implement valid toolkit tic valid assess base visual sequenc valid report concept successfulli prove learn system valid demonstr learn system invalid valid scenario knowledg system properti lead definit valid result author convinc futur li sophist integr valid verif refer util criteria reduc set test case expert system valid proc florida ai research florida ai research societi gener minim set test case function exhaust system valid proc florida ai research florida ai research societi learn algorithm machin learn survei induct theori method comput survei valid internet agent proc leipzig fit leipzig automat construct test theoret approach baltic comput volum lectur note artifici intellig valid cbl principl proc intern florida ai research societi aaai press tic ein fur commun algorithm learn group fur und fb mathematik und common criteria inform technolog secur evalu version solv stabil problem knowledg acquisit pacif knowledg acquisit south depart artifici intellig tic toolkit valid formal languag learn proc confer languag identif limit inform control person experi valid larg commerci expert system proc leipzig fit leipzig formal framework valid learn system proc leipzig fit leipzig suffici learn system valid proc intern florida ai research societi aaai menlo park valid induct learn system proc intern workshop algorithm learn volum lectur note artifici offic offici public european commun inform technolog secur evalu criteria version german inform commun servic zur fur und lattic knowledg intellig system valid proc intern florida ai research societi aaai press valid data mine system proc leipzig fit leipzig ture test approach intellig system valid proc leipzig fit leipzig fundament ture test approach valid ai system intern scientif volum tu expert system verif survei tutori artifici intellig review logic scientif discoveri hutchinson educ model learn set string proc acm workshop comput learn acm press psycholog aspect human factor test evalu militari system verif valid complex human factor volum nato asi seri comput system scienc verlag valid complex behavior issu verif valid complex human factor volum nato asi seri comput system scienc guidelin expert system evalu intern journal intellig system comput machineri intellig mind
IR/40 5 usag mine languag algorithm john moham zaki comput scienc depart renssela polytechn troi ny abstract xml graph descript languag report descript languag gener web graph format web site web robot system web visual gener report format web site web log file web graph illustr xml applic web data mine show simplic mine algorithm implement effici xml applic provid sampl frequent pattern user web web data mine algorithm web usag web web frequent pattern mine introduct recent xml gain wider accept commerci research establish suggest xml languag web data mine applic util extract complex structur inform extens graph markup model languag xml applic base graph model languag graph descript mml tag describ node edg graph make exchang graph author tool graph graph written straight forward extens stylesheet languag translat graph format tion present detail log markup languag xml applic design describ log report web server web data mine current hot topic comput scienc mine data collect web server studi custom organ web page accomplish web page frequent access web surfer section explain structur web site repres web graph mine data log web graph annot log inform produc summari inform client type browser usag time statist gather client activ web site subgraph web site graph subgraph understand gener user activ web site creat xml vocabulari structur express content inform section discuss detail section describ gener addit modul system recent web data mine gain lot attent potenti commerci benefit web log popular object web user attribut web page mine pattern set sequenc frequent access page site kind inform restructur dynam insert relev link web page base user access pattern mine vendor target potenti onlin custom effect time enabl person servic custom web mine umbrella term refer distinct task web content mine deal problem automat inform filter intellig search person web agent web usag mine hand reli structur concern discov interest inform user navig behavior store web access log focu paper web usag mine extract simpl inform web log mine complex structur inform challeng data clean ration constitut effort mine appli relev data challeng elimin irrelev inform imag file cgi user user session incorpor tempor window user model readi mine result web site raw log web graph itemset mine sequenc mine tree mine figur web usag mine architectur frequent set frequent sequenc frequent languag design facilit web ing process addit store addit detail summari inform extract web log gener document step mine simplifi mine call frequent pattern extract increasingli inform pattern approach applic real log discuss section section illustr appli web provid demonstr inform web site gener style sheet addit inform web extract mine data architectur system shown figur input web mine system web site raw log file span extend period time web site popul web graph web crawler raw log process gener turn process log inform mine kind frequent pattern inform sequenc web graph inform web provid detail statist top note associ sequenc mine appli web usag mine past chen al introduc notion maxim forward chain web page gave algorithm mine system appli sequenc mine analyz navig behavior user web site support integr environ log queri visual coolei al describ data prepar scheme facilit web mine recent advanc detail survei aspect web mine span structur usag discoveri found work differ system xml base languag streamlin web mine process multipl kind mine task perform rel describ compon system start applic describ languag detail gener frequent pattern mine result present final point potenti system web discuss futur work graph markup model set node set edg edg order unord pair node graph data object element node edg data xml ideal repres graph structur world wide web typic graph web page hyperlink wai describ web site structur graph structur document good choic structur inform web site creat system visual web site graph web robot compon navig web site save graph inform file xml mix markup languag describ addit node edg inform structur document document describ graph structur root element element edg att element node element describ node graph edg element describ edg graph addit inform node edg attach element element element graph consid subgraph main graph element includ describ graphic node edg graph node graph public graph form document part xml document namespac graph insid document document document resourc descript framework describ metadata resourc includ metadata inform node edg tag part graph describ web site node repres web page edg repres hyperlink metadata web page includ attribut node rdf dublin core vocabulari describ metadata node renssela comput scienc ms begin program graduat comput program select advanc program model img img valid document valid document xml document valid document valid dtd schema schema base xml schema work draft septemb valid xml document multipl schema namespac suffix element show valid xml document valid xml schema includ schema element attribut main element att graphic graph element root element valid document graph element uniqu document graph includ subgraph main graph element global attribut attribut uniqu number identifi element string identifi element label string text element graph element attribut boolean express graph direct node edg refer document node repres graph shown user point insid node behavior similar hyperlink html document xlink framework creat hyperlink node edg xlink actuat ad attribut node edg element attribut directli xlink work draft element describ properti node object node render graphic object addit meta inform applic program element insid node graphic att graphic node report element graphic node circl bitmap addit meta inform report element node web metadata date creation size web page element describ properti edg object element node element includ graph element edg sourc node target node applic program verifi sourc node target node includ document weight attribut save weight number weight graph element element graphic addit metadata inform element show graphic edg graphic edg line arc element attach addit meta inform relat edg edg metadata anchor string type hyperlink element hold meta inform element element att element att repres structur metadata metadata person object attach metadata node graph att line includ node element defin graphic node center att element element graphic element line element defin point element repres edg center element element repres central point graphic node element permit add inform graphic element inherit markup log report compress version web master gener save web server log file singl dai inform due disk space log data delet make room log inform web master gener html report problem long period time html report size web master gener report larg period combin html report produc final report conceiv make task easier web master gener report combin regular basi effort file combin xslt produc html report offer flexibl combin xml produc graphic statist report combin rdf provid metadata inform web server analyz base document snapshot web site user visit web page hyperlink succinct save user session work draft terminolog definit user session defin delimit set user click web structur typic document section root element section graph describ log graph visit user web page hyperlink section describ graph root element element section addit inform log report top visit top user top keyword section report user session user session subgraph log graph subgraph report list edg refer node log graph edg user session timestamp edg timestamp comput total time user session file larg show part file start end jun sep img access html access html access html access html access html access total access total access html window access html access access access access access access search html inlin hyperlink hyperlink html entri entri uniqu uniqu host uniqu se uniqu extern url uniqu intern url uniqu user request request kbyte kbyte uniqu html move html html html html html html html html html html html html html html html html html html html max min entri start access entri start access valid valid document xml document valid dtd schema namespac suffix element element root element document element rest element classifi respect section document section report log graph element describ graph section report gener statist web server top top refer top visit user section report user session global attribut id uniqu number identifi element document string identifi element document label text element access count number time web server access number time specif user agent access web server total count total number time element found total count keyword byte number byte download html page number html page request web server number html page request specif site element describ log graph add attribut element report number visit node number edg element report metadata inform web page mime type size file element section host host list element attribut count host element insid host element host element empti element inform visit site ip number byte transfer site domain domain element list domain visit web server domain suffix domain site domain site directori directori list top directori web site request web page directori prefix uri web page directori web list user agent user agent made request web server reader refin list comput top platform top web browser user agent inform platform web browser refer refer list list top extern refer list top intern refer extern refer refer host web server host intern refer web server host refer list top host refer web page web server list combin number access refer host keyword keyword search word found uri refer search engin keyword list report keyword list search engin summari element overview essenti inform web server inform import web master effici web server attribut request total number request session total number user session byte total number byte transfer html page total number uniqu html page page total number uniqu html page inlin object total number uniqu inlin object inlin object object insid html page imag hyperlink html total number uniqu hyperlink html page hyperlink total number uniqu hyperlink html page html entri page total number uniqu html page entri page web site web server entri page total number uniqu html page entri page web site web server uniqu site total number uniqu visit site uniqu host refer total number uniqu host refer web page web server uniqu se refer total number uniqu search engin access web server uniqu extern url refer total number uniqu extern uri refer web page web server uniqu intern url refer total number uniqu intern uri refer web page web server uniqu user agent total number uniqu user agent access web page web server request hour number request hour request dai number request dai kbyte hour number kilobyt transfer hour kbyte dai number kilobyt transfer dai search total number search request uniqu keyword total number uniqu keyword search request element summari http statu code request element summari http method web client commun web server element summari http version web client commun web server date element give summari statist date request section document report user session element element element set user session user session path element path collect hyperlink user session path element hyperlink user user session element report hyperlink user session attribut refer node log graph section attribut timestamp user hyperlink report user session entri start access gener written simpl gener part system gener read common extend log file gener file gener read web site analyz combin inform web page hyperlink log inform inform extract common log file includ host date rel uri request http http statu http method number byte transfer web client extend log file absolut uri refer web page string describ user agent browser web made request inform save data structur gener document gener output html report make modul power tool web administr algorithm develop find user session log file simpl algorithm ip host web client identifi user system check user agent date request find user session straight wai find user session requir remot user identif gener find user similar algorithm system gener modul call user manag user manag invok web log line process receiv current url request url ip user user agent user manag access user session web graph web site web log user manag add user session metadata inform web graph size mime type web page step user manag creat finish user session check current user session finish user session consid finish time request time user session current request time greater time window time window paramet gener experi set minut user manag mark finish user session report document check user agent spider spider recogn user agent excess number request web site spider session consid user session user manag skip request spider check current request page inlin object user session report set hyperlink html page inlin object report user session expand user inlin object log graph section document user manag skip inlin object request search user session tabl user session user session identifi ip domain user agent user session user session creat store tabl user session verifi refer request page extern intern url web site analyz refer mean request page entri page user session start user manag check current user session request consid user session current user session user session discard add hyperlink graph user session edg save date user hyperlink timestamp web usag mine gener read web log finish user session report document gener algorithm user manag add finish user session int date url url ip user return return search user user tabl user creat user session return figur log graph comput scienc web site graph visual system displai log graph document user session identifi log file figur show part log graph renssela comput scienc web site number edg time user edg figur show log graph renssela web site number node time user request web page visual main node log graph displai web data mine solv wide class mine problem web data gener term frequent pattern mine encompass import data mine techniqu discov associ frequent time gener problem includ complex pattern tree mine graph mine pattern complex domain web associ frequent subsequ mine specif instanc figur log graph magazin web site studi past discov increasingli complex structur complex pattern includ frequent frequent dag frequent direct undirect subgraph complex structur extract inform pattern underli document store web user subgraph web extract increasingli complex inform pattern document extract web access log popular perform mine task simplest ignor link inform user mine frequent set page access user step form user sequenc link mine frequent user access path forward access mine frequent access site gener web site model direct addit forward back creat cycl user access full inform includ forward backward discov frequent occur subgraph rest formul problem show facilit creation suitabl web mine illustr actual exampl log describ increasingli complex mine task perform frequent pattern problem formul gener framework mine kind frequent pattern collect built set primit item structur repres relationship item set item structur denot fact substructur collect structur set item form partial order set substructur relat structur form item call structur call maxim substructur collect structur defin support structur number structur larg structur support number time occur substructur structur frequent support minimum support set frequent denot fk structur rule express structur support rule structur joint probabl confid condit probabl structur rule strong confid minimum confid frequent pattern mine task gener structur rule support greater min confid greater min conf task broken main find frequent structur minimum support constraint step comput intens search space frequent substructur exponenti worst case minimum support criterion success reduc search space addit constraint find close correl substructur gener strong structur rule minimum confid rule gener exponenti size longest substructur time access set frequent structur web mine design languag facilit web mine document creat web log inform perform task structur mine web make section document section web actual structur web site web graph obtain page url node identifi show snippet pair total extract web graph comput scienc enabl web mine make section document store user session organ subgraph web graph complet histori user click includ time page request user session session id ip host path count number sourc destin node time link simpli extract relev inform depend mine task hand goal discov frequent set page ignor link inform note uniqu sourc destin node user session user session inform part extract set node access user number node node list extract inform user session obtain readi frequent set hand task perform sequenc longest forward gener sequenc time back edg simpl implement maxim forward node sequenc found user session user sequenc node node access complex mine task tree graph inform directli produc user session origin site graph figur web site graph user session illustr instanc paradigm web mine figur pictori depict origin web graph web site form set primit item connect hyperlink document store systemat manner user subgraph web graph figur show page visit user user inform mine kind increasingli complex start frequent access frequent frequent web data mine frequent set associ rule mine collect simpli subset primit item structur denot subset relat mine discov frequent subset subset call itemset associ mine literatur set ab ac abc bc figur frequent set mine cf figur frequent sequenc mine web log shown figur user figur record page access ignor path inform mine task find frequent access set page figur show frequent fk user min af cf maxim frequent itemset appli charm associ mine algorithm real document web site user session averag distinct node session mine minimum support frequent set found shown frequenc node id frequent sequenc problem mine sequenc state event simpli itemset made item sequenc order list event sequenc α denot symbol denot relationship α subsequ necessarili sequenc denot α α complet β structur consist collect denot subsequ relat mine goal discov frequent subsequ sequenc shown figur store path start page leaf wai construct user access minimum support find maxim frequent sequenc appli sequenc mine algorithm actual document web site user obtain maxim forward averag sequenc size mine minimum support set frequenc frequent sequenc found shown frequenc node id figur frequent tree mine frequent tree origin site graph subgraph figur gener user graph denot label tree vt vertex edg branch tree denot edg ancestor descend note definit usual definit requir branch vertic path root leaf figur tree site graph tree vertex set frequent tree mine problem find min tree user access shown figur mine frequent shown figur maxim frequent min initi implement algorithm mine frequent tree appli shortli gener instruct compar pattern return task common web log start ignor link inform obtain frequent set page found frequent final frequent task arrang order complex execut time order inform convei user frequent set page frequent access sequenc mine partial sequenc inform order page tree obtain full knowledg relationship root children mine easi framework base document inform appli constraint pattern web site analyst pattern occur short time occur long gap inform directli extract edg time user session gener gener tree mine problem direct acycl gener direct undirect graph continu web mine gener web site model direct addit forward back creat cycl figur show web graph user access full inform includ forward backward discov frequent occur shown total time minimum support number frequent pattern minimum support maximum pattern length minimum support figur associ total number max pattern length total time minimum support number frequent pattern minimum support maximum pattern length minimum support figur sequenc total number max pattern length experi ran detail experi log file collect month comput scienc depart experi run pentium ii processor run linux log touch total web page web site process user transact associ item transact averag sequenc gener averag sequenc page length figur show total time mine associ rule minimum support valu show total number frequent set found maximum pattern length minimum found pattern maximum set length figur show total time total number pattern maximum sequenc mine frequent sequenc minimum support valu minimum found pattern maximum sequenc length web web concern pattern found web structur web usag web consortium creat web activ group main task measur aspect web languag describ web structur usag characterist web site obtain appli style sheet document show simpl xslt appli file obtain number request web page web site number request web page obtain inform plot line graph shown figur figur plot top request comput scienc web site web report request file file period natur http site rate broken session time extract file appli style sheet applic program dom sax xml parser defin xml web usag mine applic graph file descript ideal candid describ structur web site inform extens collect web usag preprocessor data mine web report gener futur work includ mine user graph inform web visual mine data system perform web content keyword inform content node obtain inform involv analyz web page collect relev keyword work accomplish task refer verkamo fast discoveri associ rule fayyad advanc knowledg discoveri data page aaai menlo agraw srikant mine sequenti pattern intl conf data ms js ps yu data mine path pattern web environ intern confer distribut comput clark extens stylesheet languag version srivastava data prepar mine world wide web pattern knowledg inform thompson al xml schema part structur al extens hypertext markup languag al document object model level specif technic report world wide web scalabl vector graphic specif portabl graph file format technic pitkow summari www comput network isdn april system system analysi synthesi web page webnet novemb extens graph markup model languag specif inform log markup languag specif inform blockeel web mine survei sigkdd june nielsen web terminolog definit sheet haak hypermedia design commun august maler xml link languag verkamo discov frequent episod sequenc intl conf knowledg discoveri data masand editor advanc web usag mine user workshop number lnai springer juli rao silk extract usabl structur web michael victoria robin confer human factor comput system commun page april acm press srivastava web inform pattern discoveri world wide web ieee intl conf tool resourc descript framework model syntax specif wolf rfc dublin core metadata resourc septemb inform sax simpl api spiliopoul lc tool web util analysi edbt workshop lnc springer march srikant agraw mine gener associ rule vldb holland layman namespac xml world wide web consortium work draft extens markup languag recommend technic report world wide web februari sampl code librari wu yu speed web usag mine analysi tool internet zaki scalabl algorithm associ mine ieee transact knowledg data zaki effici algorithm mine frequent sequenc machin learn special issu learn mine tree forest technic report comput scienc renssela polytechn prepar zaki hsiao effici algorithm close associ rule mine technic report comput scienc renssela polytechn octob
DB/41 3 minim view set lose power chen jeffrei ullman comput scienc stanford ca usa abstract problem answer queri view studi extens due relev wide varieti applic select subset view maintain due limit resourc show tradit queri good basi decid view select minim view set lose power formal introduc concept view set view set answer queri answer show tradit queri relat discuss minim view set retain power develop idea view set respect set relationship term rewrit queri view introduct problem answer queri view studi relev wide varieti data manag inform data queri optim problem state queri schema set view answer queri answer levi compil good survei approach problem context queri comput queri materi view speed queri part comput queri comput view data view preclud costli access base relat answer queri quickli precomput view improv perform optim assur chosen view answer expect queri system cach answer local client avoid access base relat server cach result queri thought materi queri view definit client cach answer previou queri answer futur queri benefit present view cost materi view compet limit resourc critic select view carefulli system view repres set web page autonom sourc mediat system crawl web page period refresh cach data local repositori cost manifest bandwidth crawl effort maintain cach materi view part comput queri user pose decid answer queri materi view select optim subset view reduc comput decid answer typic queri architectur store answer past queri larg storag space add mainten cost client deal evolv set answer futur queri redund view cach show view redund make minim tradit queri good basi decid view select power view system cach improv server data access server base relat tupl relat mean book titl author publish prentic hall current price assum client answer cach local cach data denot view set fv view inform book view includ inform book publish prentic hall view pair book publish prentic hall view set elimin view save cost mainten storag assur elimin server access futur queri view includ tupl tempt select fv elimin redund view answer titl price book written smith publish reason includ inform book base publish attribut project view head book publish queri answer trivial drop lost power answer queri note view elimin chang power reason comput select fv fv includ tupl project view definit lose bodi view show section hypothesi wrong paper discuss minim view set lose power introduc concept view stand power view set view set power answer queri answer view set call power answer queri shown view set power tradit view impli show direct impli section show view set base find minim subset view set multipl minim subset user restrict queri determin rel expect set queri section investig question test extra constraint infinit queri set defin finit develop algorithm test rel rewrit queri rewrit analog requir introduc concept defin rewrit show impli finit set conjunct view discuss paper summar tabl full version paper discuss gener result conjunct queri arithmet union conjunct datalog definit test tupl check view vv view view view queri answer check view answer answer rel queri set test definit queri answer finit section answer infinit queri defin queri queri test rewrit tabl finit set conjunct background review concept answer queri view base relat queri conjunct subgoal predic base argument subgoal variabl constant view defin base relat safe conjunct variabl queri head bodi note assumpt view comput exist relat begin letter constant begin letter variabl definit queri queri denot base queri definit queri queri set view denot exp obtain replac view base relat existenti quantifi variabl view replac fresh variabl exp definit queri view set queri rewrit queri view exp rewrit exp queri answer exist rewrit rewrit queri view exp queri answer answer fv paper finit view set algorithm develop answer queri bucket algorithm algorithm algorithm studi complex answer queri view shown problem rewrit queri view compar power view set section introduc concept compar tradit queri discuss minim view set lose power respect queri definit view set view set power denot queri answer answer view set denot view set fv fv answer queri answer give formal proof view fv fv answer queri answer lemma suggest algorithm test lemma view set iff view treat answer due space provid proof lemma theorem proof full version paper import lemma test simpli check view answer finit set mean answer infinit number queri answer algorithm check easi relationship transit result complex test queri answer set theorem problem view set view set view answer view lemma fv fv direct fv fv answer fv mean fv fv compar tradit queri interest relationship tradit concept queri definit make gener concept call cover case view set schema definit view set view set denot hold base tupl view view set view set fv fv view schema show impli guess project view definit variabl bodi view impli show guess incorrect base tupl mean edg vertex vertex graph view fv fw illustr figur view store subgraph shown figur view store subgraph shown figur view project answer show impli view set schema view subgraph view subgraph fig diagram view base relat view set fv fw rewrit find minim subset view storag space number web page crawl view find subset view power definit minim subset view set minim subset fv minim subset view set minim subset power view set fv em fv comput em view set shrink algorithm algorithm shrink initi set view check answer view fv remov repeat process view remov return result em show view set multipl base view fv fv fv shown rewrit rewrit rewrit fv find em total cost select view minimum problem find optim em effici deserv investig test rel queri set till consid view set respect set user queri base relat user restrict queri relationship view set respect set queri infinit queri set defin finit queri definit set queri view set view set wrt denot iff queri answer answer view set wrt denot assum relat store inform citi dealer locat queri fq fw fw wrt answer note gener view set queri set defin minim subset wrt manner definit comput em wrt section method test rel test straightforward check queri answer answer test rel paradigm queri rest section wai test rel wrt infinit queri set defin finit queri queri queri conjunct queri placehold argument posit addit constant variabl placehold denot argument begin sign queri relat queri repres user car make placehold citi placehold dealer make citi instanc dealer toyota honda san francisco instanc queri obtain assign constant domain placehold placehold argument constant posit denot set instanc queri queri set assum domain placehold infinit instanc base infinit repres infinit set queri finit set queri view answer instanc includ inform car dealer citi view answer inform dealer san francisco answer instanc restrict replac placehold sf user inform dealer san francisco view answer instanc dealer attribut head finit set queri view set suggest strategi test deduc instanc answer test answer instanc subsect show perform step show answer instanc queri view set repres finit set queri give algorithm deduc algorithm step discuss base result easili gener finit set queri complet answer queri problem test instanc queri answer view set complet answer definit canon instanc queri view set instanc placehold replac distinct constant lemma queri complet answer view set answer canon instanc lemma suggest algorithm test instanc queri answer view set algorithm construct canon instanc test answer call algorithm answer queri output answer output queri test view answer instanc distinct constant replac placehold obtain canon answer view rewrit lemma view answer instanc answer canon instanc answer instanc argument hold partial answer queri shown view queri view set answer instanc answer instanc instanc answer view instanc repres set queri queri restrict queri instanc instanc queri restrict queri requir argument loc subgoal sf constant placehold queri restrict queri placehold argument constant assign placehold queri restrict gener ad type type placehold assign constant placehold put restrict queri replac placehold type placehold constant put restrict user assign constant placehold instanc combin type restrict constant restrict cg note combin restrict type restrict combin restrict restrict constant restrict combin rc queri deriv ad restrict rc queri restrict denot restrict queri instanc answer show exist queri canon instanc lemma complet answer prove theorem instanc queri answer view set gener finit set queri restrict queri complet answer algorithm queri view set algorithm gener queri restrict complet answer defin instanc answer algorithm gener restrict creat queri combin call algorithm check queri complet answer output queri complet answer test rel finit queri give algorithm test rel queri queri set queri view set algorithm test call algorithm find restrict queri complet answer call algorithm check complet answer theorem iff queri complet answer complet answer algorithm easili gener case finit set queri consid power view respect rewrit queri rewrit introduc concept describ rel power view set term rewrit queri essenti definit rewrit queri view set satisfi finit union conjunct queri view answer comput subset answer union conjunct queri satisfi condit properli rewrit plan view comput maxim answer queri queri answer rewrit queri view relat access view queri view give user inform car dealer san francisco answer definit view set view set denot queri set denot essenti theorem view set proof view queri rewrit definit rewrit lemma lemma view rewrit queri replac view rewrit obtain rewrit queri definit relat work lot work problem select view materi data data model repositori integr inform queri analysi subset queri materi improv base relat access rest queri base relat chang queri result result cost mainten space studi set model problem analysi set set consid materi redund view set cost deduc queri optim subset chosen model feasibl queri answer worst case access base view assumpt incorpor extend notat definit union conjunct queri obviou model replic base relat base relat consid minim access base relat approach lead wrong essenti ensur comput queri maintain view work direct scenario assumpt hold access base relat possibl cach view maintain high cost propag base relat view minim view import retain power power answer queri view set orthogon interplai make interest work term deduc tupl satisfi view definit extens term stand abil set answer queri relat work studi inform content view develop concept subsumpt set capabl distinguish instanc solut set queri base view materi order queri answer author show conjunct queri view infinit number view answer queri author show problem conjunct queri finit space view view term storag space queri answer view answer queri problem specif paper start set queri view assum set view queri arbitrari deduc minim subset view answer queri answer origin set work open problem includ wai find optim em view set find minim subset view set find case impli valuabl comment refer abiteboul duschka complex answer queri materi view page answer queri materi view disjunct page vardi queri answer view data integr web page vardi queri rewrit ceri widom deriv product rule increment view mainten proc chandra merlin optim implement conjunct queri relat data base page genesereth linearli bound reformul conjunct cho synchron improv fresh duschka queri plan optim inform integr phd comput scienc stanford duschka genesereth answer queri view page optim manag data intens proc page grahn mendelzon tableau techniqu queri inform sourc global schema page grumbach content materi aggreg view page zhuge stanford data wareh project ieee data eng special issu materi view data inmon kellei develop data qed publish levi answer queri survei technic comput scienc washington srivastava answer queri view page ordil queri heterogen inform sourc sourc descript proc page ullman minim view set lose power technic comput scienc stanford mitra algorithm answer queri effici view technic stanford levi scalabl algorithm answer queri view proc qian queri fold page sagiv yannakaki relat express union differ oper journal ullman inform integr logic view page widom research problem data wareh proc intl conf inform knowledg wiederhold mediat architectur futur inform system ieee
HCI/42 4 group commun mobil particip raymond cunningham meier laurent ó ø ö ø ø ø abstract ðó øó áò óùö óò ðó øó óò óùö øó keyword ðó introduct óñ áò áò ðó øó ó øó óò øó øó permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee rhode island usa copyright acm distribut system group depart comput scienc triniti colleg dublin dublin ireland ó øó ø ðó ø óò óö ðó ðó áò óò óö áò óò óò ðó óò óò ðó óùö óùòø ðó óò ðó øó ø øó ó ùö óùö óùòø ùô øó óö øó øó áò øó áò óùö øó óùòø óö ðó ðó áò óùö øó óò øó group commun overview ôöó øó óö øó óò óò áò øó øó group membership manag óñ øûó ø øó áò áò òó óò ôöó óùø óö óñ óð base group commun áò øó øó çò óð ôöó áò óð øó óð òóø øó óð óð øó óö óò ý ôöó óð óð óð group commun base messag exchang øó óò óð áò óð øó øó óö ó øó óùø óö øó óò óð øó óò ôöó øó óð ø øó óòðý øó group mobil particip çùö øó óö óö øûó ðó ðó ðó óùö øó ñó óö øó ðó áò definit proxim group óùö øó ðó øó øó øó øó øó øó øó øó ðó øó øó áò ø çùö ðó øó øó ðó øó áò øó ðó ø ìó øó òóø óö óö øó ðó ìó øûó óö áò øó áò øó ë óò ê øó òóø ê òóø øó ê øó øó å øûó áò óö òóø ø øó membership manag proxim group çùö øó ðó øó óö ìó óò øó ø øó óùö çùö øó ó ùö øó øó øó óò locat inform distribut protocol áò óùö øó óð òóø ðó øó øó øó ðó óûò øó øó øó óò øó øó øó øó øó áò ðó ðó óò øó áò óûò ðó ðó ä óûò ä ä ä òóø øó øó ôöó øó òóø óö òóø óð øó ø ðó óò øó øó áò øó ðó óò ðó øó óú áø ø øó óð ø ø ø evalu coverag area óò óò øûó øûó ìó øó øó óö òóø óö coverag estim óò ø øó òó ðó óð æ øó æ ô òóø ô æ ô ü ô ü ý ô ý áò æ ô øó æ î ô è ô ò è ô ô £ áò óùö òó ý æ óùö øó ø øó øó æ ý æ è £ è è þ þ ô æ þ æ ù ý óùö øó è ô æ ô æ ô æ ô æ æ óùö øó øó øó æ ý æ perform evalu coverag estim algorithm øó óùø óò ý øó øó ý øó ý øó øðý øó ý øó óò óò áò óùø óò øó áø øó óò øó ø ø øó øó óò partit anticip áò óùö øó óö øûó øó óö óö óö óö øó øûó ì óö ì ôöó òóø ó áò óùö øó ðó ðó óò øó òóø øó óòðý øûó ó ùö óò ðó øó óö øöù ðó relat work áò øó óùö øó òóø óö øûó óð øó áø óð øó øó øó øó ðó òóø ø óòðý áò øó øó òóø futur work áò ðó áò óò ðó óö ðó óùö øó ðó øó óò refer å ë ôô ã è å çò øóö óð æ à óð óò ê ê óò é à ê áò óò ë óò â â óò î â ç æ à áòø óò à áòø óò ë ê çò øóö óò ë ë â è óñ ë å øó ë ê î è ë óò áò à è ë ï ì ë
IR/43 5 estim resembl midi document michael mitzenmach sean owen abstract search engin emploi techniqu determin syntact similar web page tool avoid return multipl copi essenti page user make queri describ experi extend techniqu midi music file music domain requir modif cope problem introduc music experi suggest properli techniqu prove determin duplic cluster music set introduct extens digit librari domain music requir rethink techniqu design text determin appropri extend recent work describ design invert index structur index perform queri midi music file result suggest addit techniqu pitch music distanc organ queri larg music made effici describ experi extend techniqu design find html web document problem find midi music file techniqu altavista search engin determin html page index ident page index cluster web document similar goal determin techniqu effect set music trend recent work area music extend techniqu music set relat toolkit suit tool estim music resembl manipul music structur wai techniqu describ implement prove addit toolkit note proprietari format translat midi implement music comput scienc harvard support part alfr sloan research nsf career grant equip grant compaq comput corpor support part grant harvard faculti research support search tool format search melodi line comparison entir piec music result suggest find similar midi piec effici hash introduc modif cope addit challeng music set address problem work music similar larg restrict melodi line applic techniqu similar web focu natur applic cluster resembl comput review import aspect midi file format recal basic framework hash techniqu context text document discuss difficulti transfer approach music domain suggest approach mitig difficulti conclud result current implement midi midi instrument digit specif defin protocol describ music seri discret event forc note volum protocol midi file sequenc event time describ event occur rel previou event midi file describ music level sheet music simplic midi popular standard commun music classic music hash techniqu text similar review techniqu base hash determin text document syntact similar follow work broder similar treatment document consid sequenc word canon form contigu subsequ word call specif contigu subsequ word document fix set document set phrase includ view measur resembl text file resembl set defin resembl resembl implicitli depend gener fix paramet resembl number mean document set small larg document affect resembl word chang affect distinct resembl resili swap order paragraph advantag definit resembl easili approxim hash techniqu hash number fix number rabin fingerprint function term refer hash deriv underli word store modulo suitabl prime set modulo document estim resembl estim actual resembl reduc amount storag obtain possibl accur estim resembl smaller set deriv origin call sketch document defin mean text score suggest text text estim estim challeng adapt hash techniqu music greatest challeng adapt hash techniqu similar text text natur repres sequenc music note occur logic serial music data format midi arbitrarili flatten data serial stream note event creat potenti problem relat plai note directli convert midi text file appli techniqu suffici work music resembl obviat problem sequenc note simpl melodi attempt deal music entireti fig excerpt js bach joi man figur show measur js bach joi man notat sequenc note event repres excerpt begin event repres bass note melodi note intuit logic separ sequenc logic group note melodi repres contigu midi note event occur part situat confound attempt deriv resembl estim direct applic text resembl techniqu natur text midi file comput resembl midi file midi file melodi expect correctli identifi similar file adjac event midi file logic group longer context midi file time inform midi record event time fine time note event midi music variat potenti impact resembl estim midi file record varieti music metainform control directli relat music solut pitch pitch basic strategi adapt music data separ note fingerprint sequenc start time note pitch independ separ sketch produc note pitch midi file contigu subsequ note start time pitch group text resembl comput resembl note event document note event document comput direct applic text resembl pitch weight averag resembl comput resembl mitig problem resembl comput note pitch belong logic group reason group note pitch level singl text resembl comput advantag establish techniqu elimin problem arbitrari order simultan simultan event exact group note adjac pitch group note pitch singl sequenc initi result hurt group pitch yield extrem poor perform approach worth advantag pitch pitch approach face strong extens transposit pitch pitch approach music transposit music piec kei midi file piec kei file resembl comput return low resembl music ident note compar note group note correspond note account compar note note correctli resembl trivial pitch pitch transposit maximum resembl resembl midi file solv slow comput substanti transposit practic inform number pitch determin transposit group pitch sequenc possibl possibl ignor octav pitch pitch consid ident note event altogeth produc sequenc potenti creat effect part posit ignor octav cope harmon pitch plai call major rel order major subject harmon qualiti origin chord made note piec note result piec subject piec deem comput ignor octav resolv problem exampl demonstr difficulti involv adequ defin calcul music similar syntact level account transposit harmon domain classic midi file variat gener find kei origin minor imagin domain import time word natur base comput natur base note chosen rel time note natur order word text document found start start time repres note effect length time note vari style valuabl inform ignor start preprocess step make comput effect midi file repres time quantiti durat typic redefin midi event scale time valu midi file preprocess step tick fact ignor midi tempo music tempo similar metric time quantiz nearest multipl durat order filter unimport variat time recal note start time rel previou note music time differ measur forti long period separ consid distinct block note cap time differ correspond measur time record time differ larger option cap start time tick discard extran inform midi file great deal inform irrelev resembl comput analog ignor capit punctuat text note includ addit ignor perform ignor inform instrument author titl base comput sole music practic inform index classifi note inform conjunct impli trust agent gener inform similarli ignor track channel number midi file subdivid multipl typic event describ music part complex music piec track music mean emploi consist note track midi file merg singl track preprocess step midi event channel direct commun channel number music mean ignor differ note time aspect algorithm fingerprint pitch note event pitch midi file extract view sequenc number time recal start time record time event subsequ start time view start time larger tick discard hash rabin fingerprint hash modulo sketch pitch file note number start time likelihood match magnifi effect small variat resembl score found start time reason choic arbitrari start time poorer start time yield perform similar modulu vari smaller valu accuraci resembl estim cost addit vice versa hash econom storag yield small hash space averag midi file produc probabl small justifi storag save note hash valu introduc substanti program complic slow bit practic full hash substanti memori requir resembl sketch pitch file sketch file comput resembl ja ja text resembl comput weight averag valu resembl weight jb scale factor scale factor intuit appeal weight pitch resembl total number approach weight pitch match case file pitch found perform perform unweight averag defin score pitch weight ja result test data knowledg publicli standard corpu midi file develop corpu site offer midi file internet download midi file test site limit download user custom robot program develop obtain midi file respect usag restrict behavior resembl score music resembl comput correspond intuit notion resembl estim resembl reliabl relationship midi file fig percent note event alter estim resembl comput correspond notion file resembl high proport note event common notion resembl natur notion captur text resembl comput test accuraci midi file web gener alter midi file note event chang probabl roughli percentag note event slightli alter random note probabl pitch random probabl delet probabl start chosen uniformli random origin start time time event implicit event tick whichev recent correspond specif model differ midi file feel reason test system perform resembl instanc comput origin distribut result resembl score versu shown figur reason fairli reliabl relationship result resembl score view result small test set consist familiar piec piec wagner variat file note alter file consist part song creat tabl varianc result depend piec flight tabl sampl resembl comput simpl cluster resembl comput compel applic determin midi file repres piec music cluster corpu document pair file threshold put cluster find high threshold elimin content cluster correspond piec piec fail cluster interest variat piec music fairli low resembl score discuss tabl major differ music set text wide variat constitut music text syntact differ consid similar reflect partial problem pitch pitch delai note affect rel time multipl effect larger number low threshold high accuraci piec music cluster music piec cluster bach tend end cluster strong structur harmon similar valu find undesir larg cluster hundr file small cluster aggreg resembl meaningless crowd file gain insight import resembl comparison file corpu figur show number pair histogram resembl score round nearest logarithm graph natur show document low moder resembl score chose find cluster tend correspond distinct piec music present result cluster threshold tabl show site descript inform content repres cluster ident sequenc cluster consist cluster classic midi connect learn iv fig rel frequenc resembl score corpu point attribut possibl incorrect perform midi site determin post midi file web import choic cluster variat resembl member shown tabl variat sequenc sourc sequenc piec music yield sequenc sophist cluster techniqu improv perform increment build put cluster averag resembl member bs vice exce threshold find elimin problemat larg cluster yield ident lower threshold perform perform sourc written compil run compaq mhz gigabyt kb chip cach mb board cach implement fingerprint midi data rate approxim megabyt user typic midi file kilobyt amount produc sketch midi file typic midi file sketch requir byte count bookkeep inform file url approxim resembl comput faster sampl fewer search parallel expect perform improv rewrit prototyp code file descript sequenc sourc cmc book iv min cmc min book variat theme kaufman cmc variat theme kaufman st anthoni summer summer estat summer sheldon sr summer season classic midi cmc op classic midi classic midi urban jone tabl content repres cluster sourc url cmc classic midi sheldon sheldon tabl similar score cluster music resembl comput repres effect adapt establish text resembl techniqu domain midi file pitch pitch fingerprint approach sound framework easili extend tackl complex music issu transposit experi suggest comput discov midi file high accuraci engin tune work optim approach approach conjunct techniqu organ search music import open question techniqu appli music refer midi manufactur associ complet detail midi digit librari popular music od digit librari page broder applic rabin fingerprint method de sequenc method comput page broder resembl document compress complex sequenc page ieee comput syntact cluster web sixth intern world wide web page distanc metric index strategi digit librari popular music ieee intern confer multimedia manber find similar file larg file system usenix winter technic page januari shivakumar copi detect mechan digit document intern confer theori practic digit librari
ML/44 6 distinct featur learn technic report januari comput scienc depart graduat research center massachusett ma expand version paper proc ieee intern workshop biolog motiv comput vision springer lectur note comput copyright berlin heidelberg york main di erenc paper technic report background discuss rst section distinct featur learn januari abstract exist machin vision system perform recognit base xed set geometr decomposit draw neurosci show aspect human perform visual discrimin explain techniqu argu practic recognit task arti cial vision system oper uncontrol condit critic depend increment learn motiv present featur learn method perform biolog plausibl function paper conclud result gener method introduct exibl visual encod neuron human visual predetermin xed develop depend develop point continu evolv answer establish simpl cell recept eld resembl gaussian orient deriv gaussian gabor lter develop recept eld uenc stimul visual system comput model exist explain develop imag natur scene uncommit neuron properli adapt visual system visual function develop adequ perceptu stimul matur sensit stereo vision work support part nation scienc foundat grant air forc research grant expert phd bayesian network librari visual function pattern discrimin capabl subject schedul debat extent featur learn pattern discrimin continu recent psycholog studi human form featur requir discrimin task contrast human visual work machin vision learn level featur detector discuss visual object recognit human argu learn essenti ingredi robust gener visual system section summar evid children adult exibl learn featur recognit fashion section argu machin vision system remaind paper discuss system learn discrimin featur recognit human learn featur human learn recognit princip identi ed schema sensori input match intern object built ned experi di erenti hypothesi postul contrast relat learn serv distinguish item psycholog evid argu strong role di erenti learn discrimin featur discov unclear featur discoveri hard problem human long time learn distinguish appar base statist featur spatial intens varianc contour densiti infant begin note simpl geometr perform poorli presenc distract cue consist pai attent contour shape ag children begin discov detail geometr relationship attent limit featur human learn discov distinct featur overshadow salient distractor grow evid adult learn featur face recognit task typic subject present render unfamiliar object fall categori base speci calli design featur learn subject categor object exhibit control variat diagnost reveal featur learn subject emploi categori rst categori featur featur featur xy composit subject divid group di er order learn categori subject group rst learn discrimin categori learn categori xy group learn xy subject rst group learn categor object base featur subject group learn realiz xy compound consist featur gener driven recognit task summari evid featur learn recent articl featur learn necessarili stop learn concept tanaka taylor found bird expert fast recogn object subordin level basic level consist faster discrimin compar discrimin gauthier train novic expert unfamiliar object obtain similar result nding expert perform recognit qualit di erent novic suggest expert develop special facilit rapid reliabl recognit domain machin vision system learn featur gener theori vision marr spark extens research ort human machin contribut substanti understand visual process oper led arti cial vision system noteworthi gener obviou answer vision hard theori address partial aspect vision isol psycholog experi human visual system solv task recognit base global local geometr model depend task complementari visual algorithm part answer corollari theori vision address adapt learn real world nonstationari variabl xed visual unpredict design todai function vision system highli special oper condit break assumpt task environ hold visual recognit easi express perceiv distinct object object categori requir recognit system exist machin vision system perform recognit base xed set geometr model match rst featur chosen ort order express distinct avoid tting true geometr model detail encod level detail low gener model sucient detail express distinct requir task method restrict task ned design time call task close human visual learn place open task evolv time relat subspac method optim separ instanc class extent consist aspect human recognit face method account biolog discrimin learn toler limit amount object variabl human capabl learn impress varieti distinct rang local featur tini scratch abstract global featur symmetri light evid cite clear human capabl form global local characterist kei concept build arti cial vision system substanti gener robust learn adapt adapt system optim perform respect actual work condit adapt track nonstationari environ adapt expand function increment build optim perform respect individu task adapt paramet describ current work model featur learn recognit address build previou work nite featur space argu xed object insuci learn arbitrari distinct larg featur space method gener distinct featur space make problem nding featur enorm featur space partial order space categor featur level structur complex underli assumpt structur simpl featur easier discov discrimin potenti complic aspect learn problem featur randomli sampl featur begin lowest level complex sophist featur consid requir obviou gener nite partial order featur space primit featur wai yield turn type local imag properti serv primit featur context interact vision gener framework encompass tempor cue addit convent imag properti primit featur current primit featur local descriptor repres vector local lter lter orient deriv gaussian orient chosen form basi properti permit ecient comput lter kernel measur lter deriv speci orient speci system speci variant encod lter basi lter valu encod local intens gradient horizont vertic direct orient gradient direct comput orient strongest local gradient tan gradient magnitud repres consist basi lter rst deriv scale repres local textur signatur orient de ned rst deriv orient entir vector deriv rotat rigidli refer rst deriv comput largest scale argu choic plausibl biolog earli vision biolog visual system make consid attract comput altern absenc massiv parallel hardwar lead rotat invari simpli es arti cial vision system essenti extra cost awar evid biolog faith featur primit featur discrimin spatial combin express wide rang shape textur characterist speci citi gener suggest complementari type featur refer point figur geometr featur order primit featur de ned angl distanc orient speci instanc denot primit geometr relat rel angl distanc particip featur long geometr composit primit featur geometr featur geometr featur geometr featur repres collinear topolog relat refer relax geometr relationship compon featur variabl angl distanc topolog compound featur robust viewpoint geometr speci citi topolog featur topolog featur conjunct featur assert presenc compon featur make statement geometr topolog relationship disjunct featur consid present scene compon featur detect express statement dial number im featur comput gener success subsampl imag factor achiev scale invari composit inher toler scale arrang shown figur appli equal triangl size desir properti featur reli explicit contour extract segment avoid dicult open problem comput vision provid robust kind imag degrad human visual system detect contour remark robust reliabl capabl explain visual support recognit process featur constitut interest bridg extrem pure featur accur geometr model align method hand primit featur express power mel corner gabor patch similar cho dunn schmid recent work motiv techniqu similar contrast featur increasingli complex speci descriptor consist current model cortex assert presenc featur presenc featur point imag denot strength primit comput normal cross correl function model featur function return featur vector locat geometr featur vector compound featur concaten individu featur vector constitu featur case topolog conjunct strength compound featur product strength disjunct maximum recognit base maximum strength featur found scene region find maximum strength featur principl involv measur strength point imag oper serial rapidli local comput massiv parallel process element primari visual cortex restrict search strongest featur salient point return high salienc measur harri steven combin corner edg detector consid edg point detect method advantag detector edg detect algorithm base local autocorrel suppress repetit line pattern consid corner point return detector point reliabl repeat similar imag interest point detect method bayesian network recognit recognit perform basi featur strength introduc section map featur vector class label problem classi algorithm exist chose bayesian network attract properti desir recognit problem section introduc gener net classi er model show appli system bayesian node repres random variabl network structur speci es set condit independ variabl repres node independ valu variabl repres parent node class model net presenc object model discret random variabl true presenc object rise observ repres random variabl distribut condit presenc object class assum featur independ result net topolog arc connect class node featur node observ featur class prior condit featur posterior class probabl infer simpl applic theorem compon network featur arc insert featur node figur featur geometr composit featur featur set presenc featur imag impli presenc featur net arc node node analog argument hold topolog conjunct featur figur combin featur case disjunct direct argument addit propag sophist mechan simpl case condit independ suce instanti variabl observ net brought equilibrium probabl observ net consist interest reader refer literatur bayesian network discret featur recal section featur variabl continu theori belief propag bayesian network appli discret random featur featur featur featur featur class figur bayesian network class note interdepend featur network creat class notabl except theori condit gaussian distribut current method place restrict joint probabl model limit gener applic continu distribut discret bin split featur variabl threshold threshold determin individu featur variabl discrimin power maxim discrimin power featur variabl threshold measur term distanc condit distribut random variabl di erenc cumul probabl variabl condit separ instanc condit bayesian singl recognit recognit imag perform convent rst measur strength featur set featur node net comput posterior probabl class node absenc featur system robust built system set featur node found leav ed posterior probabl featur present easili comput class highest posterior probabl result recognit class present recognit result class posterior probabl greater con denc comput featur valu comput updat bayesian network incorpor featur quit con denc recognit result exce threshold featur process order inform inform featur de ned mutual inform featur class potenti reduc entropi class random variabl fraction featur con denc recognit result entropi class node diminish featur queri phenomenon suggest ectiv forget delet featur recognit adapt featur gener agent human interact vision sensori acquir state inform perform action state requir agent visual featur discrimin relev aspect state world posit featur gener feedback receiv interact world mccallum algorithm resolv hidden state partial observ hidden markov process select featur nite enabl agent improv perform interact world algorithm adapt gener featur nite featur space restrict discuss convent action agent consist class sensori input feedback receiv world consist correct class label assum agent retriev random view class assumpt realist case infant pick object view child receiv exampl letter alphabet teacher learn train set agent object featur present rst simpli rememb correct answer teacher shown guess categori agent wrong learn featur discrimin object categori mistaken categori random bia structur simpl featur emploi heurist step iter constant number pick random featur net part net true promot usag gener featur characterist class sampl featur directli imag pick point turn geometr compound pick point measur featur vector pick random featur part net expand geometr pick addit imag point close pick random featur net combin conjunct featur pick random featur net combin disjunct featur featur evalu small set imag environ exampl true class mistaken discrimin ad net true class condit probabl estim imag imag recogn correctli expand featur learn procedur featur remov learn procedur continu note procedur termin success oper learn instanc list class encount featur queri maintain featur class prior condit probabl net updat list find featur featur learn stop learn train set perfectli system continu search featur qualiti featur discrimin power stage recognit train system develop featur minimum featur recognit procedur featur meet system learn featur minimum iter system fail adequ featur fewer featur queri recogn inferior featur obsolet suggest call featur crude model expert outlin section experi illustr algorithm produc discrimin perform pilot experi task coil imag rst object split disjoint set neighbor viewpoint repres set imag set space view constant elev perform crossvalid set serv train set test role geometr object arti cialli render imag cover small section view sphere perform strati ed data random imag class subset imag figur object coil task task task expert avg featur train test level queri correct wrong correct wrong coil tabl summari result column number featur upgrad iter column case system return ambigu answer result experi summar tabl recognit result fall short current machin recognit achiev uncommit visual system strong bia simpl featur access small number random train view time ci increment train procedur properti contrari current comput vision characterist biolog vision system accord search learn featur isol simpl geometr compound smaller number compound type featur found train set learn perfectli system iter train set ectiv techniqu nding distinct featur call minimum requir featur featur increasingli dicult system featur order learn train set perfectli featur upgrad desir ect number featur queri train set learn reduc number recognit margin correct recognit rate test set overwhelm evid human learn featur recognit manner biolog learn increment present arti cial vision system base nite combinatori featur space search procedur nding discrimin featur method successfulli learn discrimin object develop visual involv construct featur system model minimum requir featur recognit system ect aspect human complet model system discrimin featur biolog vision system complementari algorithm evid human perform geometr match recognit base featur search model model attent mechan suit index model featur learn main limit system undirect search featur imag guid simpl heurist faith model requir schedul initi constrain search featur likelihood nding featur temporarili restrict gener restrict system learn heurist experi area research critic limit current system restrict express featur space encod corner textur inform model roughli correspond human visual system earli infanc complet model encod color featur sophist recognit requir featur qualit featur multipl triangl bicycl wheel hope address futur work refer wilder joint induct shape featur tree classi er ieee tran pattern anal mach sensit period develop human binocular vision novemb theori human imag understand psycholog cho dunn learn shape class ieee tran pattern anal mach freeman design lter ieee tran pattern anal mach gauthier explor mechan face recognit vision gibson develop percept handbook child psycholog vol cognit chapter page harri stephen combin corner edg detector proc fourth vision page unit aug held binocular vision behavior neuron develop bloom page lawrenc erlbaum reprint pp recept binocular interact function architectur cat visual cortex jensen introduct bayesian network editor brain develop cognit van local geometri visual system biolog lauritzen propag varianc mix graphic model journal american statist associ malik perona textur discrimin earli vision mechan opt soc marr comput investig human process visual inform san mccallum reinforc learn select percept hidden state phd depart comput mel combin textur histogram approach visual object recognit neural columbia object imag librari technic report columbia feb freeman encod binocular dispar complex cell cat visual cortex june field emerg eld properti learn code natur imag pearl probabilist reason intellig network plausibl infer morgan learn visual discrimin strategi proc comput vision pattern recognit volum page ft june ieee comput societi pick improv visual form discrimin exp qian zhu physiolog comput binocular dispar vision rao ballard activ vision architectur base icon arti cial rao ballard ecient encod natur time vari imag produc orient recept eld technic report nation resourc laboratori studi brain behavior dept comput august schiel crowlei object recognit recept eld histogram fourth europ conf comput apr schmid structur probabilist model recognit proc comput vision pattern volum page ft june compar evalu interest point int conf comput develop featur object concept behavior brain categor creat function featur exp silver ect visual verbal form discrimin children exp child tanaka taylor object categori basic level ey cognit develop featur children case visual stimuli proc annual meet cognit scienc page lawrenc ullman vision mit ullman recognit linear combin model ieee tran pattern anal mach young gaussian deriv model spatial retin mechan spatial oppenheim ect di erent train method perceptu learn children child
DB/45 3 interact path type constraint peter buneman pennsylvania fan pennsylvania scott weinstein pennsylvania abstract xml emerg import standard data exchang highlight import semistructur data xml standard requir schema type number develop roughli correspond data definit languag constrain structur xml data schema advoc integr form constraint capabl express constraint relationship recent studi path constraint context semistructur data futur xml involv form understand interact paper investig interact studi constraint implic import understand semant system queri optim number result path constraint implic establish presenc absenc type system result demonstr ad type system case simplifi reason path constraint case make harder shown path constraint implic problem decid ptime untyp undecid type system ad implic problem undecid untyp decid cubic time finit type system introduct numer ad structur semant xml document advoc integr constraint concret constraint system develop constraint extens exist type system ad independ ad wai work partli support armi research offic nsf grant support graduat fellowship institut research cognit pennsylvania support nsf grant xlink independ type system express simpl constraint studi constraint type system separ understand interact integr constraint semistructur data origin studi path constraint constraint express constraint extens studi overcom limit central technic problem investig paper question constraint constraint follow constraint necessarili number decid undecid result establish paper semistructur data unconstrain type system schema extend work report investig interact type system constraint system interest result present ad type system case simplifi analysi path constraint implic case make harder exhibit implic problem path constraint undecid context semistructur decid type system ad give constraint implic problem decid ptime untyp undecid type system practic interest implic problem address section cast problem structur repres figur describ xml document semistructur data express number data format semistructur data data repres direct graph figur vertic denot xml edg eman node attribut relationship element edg label book root node connect node repres book element book node author edg connect person ref edg connect book node edg label titl year typic path constraint graph describ relationship author wrote express author author author author ref year ssn ag book titl isbn isbn person book person wrote wrote wrote wrote book isbn ssn titl titl figur xml document constant denot root variabl rang predic denot edg label path graph sequenc edg express formula denot ff sequenc edg label vertex book path root vertex figur constraint state book node author edg connect wrote edg connect constraint state person node wrote edg connect author edg connect note introduc constraint mention type system kind constraint studi addit type document type id id id type specifi book node titl edg connect string author ref edg connect person book node type constrain fashion interest interact form constraint word path constraint class call word constraint introduc studi refer figur typic word constraint figur repres bibliographi pennsylvania refer word constraint assert author book person book written person occur typic integr constraint call extent constraint shown context semistructur implic finit implic problem word constraint decid ptime class path constraint studi mild gener word constraint constraint word constraint link extern bibliographi mit warner call view compon call local graph depict ad edg eman root label lead natur expect constraint hold local constraint constraint local call local constraint constraint exampl word constraint demonstr constraint capabl express natur integr constraint fundament part semant import queri optim queri xml document shown context semistructur implic finit implic problem undecid decid fragment identifi fragment properli class word capabl express local constraint consid class constraint path repres regular express decid implic problem gener constraint languag establish semistructur data constraint languag differ constraint languag express power languag gener form path express captur local constraint express languag variabl fragment languag express constraint observ constraint languag includ categor quantifi prefix fragment result implic problem orthogon classic work problem fragment logic compar current work note question logic implic context type data aim paper explor interact type system simpl integr constraint constraint defin term regular express type system objectori data model gener type refer model support record data structur similar studi restrict support record data set compar featur structur studi featur logic model demonstr impact type construct record set path constraint implic studi interact path constraint richer type system studi result establish path constraint implic undecid context gener type system constraint retrospect recent activ optim queri presenc work formul studi implic problem gener approach constraint repres queri gener framework program optim deal optim implic problem constraint express issu class constraint decid implic problem separ gener optim problem semistructur cleanli separ type issu constraint odl specif relat previou defin book erson interfac book attribut string relationship author interfac person attribut string relationship wrote strike extent declar line chang relationship attribut line left standard declar fact declar express directli languag type templat extent declar ad ffl extent constraint book subset extent person person subset extent book ffl constraint book member person member instanc graph figur suitabl understand odl schema kind type dictat gener structur path constraint dictat set object remark type constraint express path constraint vice versa recent work path constraint develop reason understand context semistructur data interest problem constraint restrict path constraint decid implic problem tempt type regular gener class path constraint decid implic problem case main result paper establish possibl result presenc type complic implic problem path decid path constraint problem undecid presenc type type construct result interact section show schema data alter comput complex path constraint implic problem unexpect wai provid intuit background implic problem logic languag determin collect structur interpret languag finit set sentenc sentenc case structur class structur ae interpret comput complex problem bear obviou connect complex problem famou case collect sentenc singl binari relat class relat structur finit relat structur complet theorem logic church theorem problem theorem problem note order defin section studi implic problem collect path constraint repres proper fragment logic collect structur problem context type constraint problem collect structur satisfi type constraint section give exampl problem problem decid sort situat familiar implic problem logic problem logic decid collect linear order collect determin order section exhibit situat problem problem undecid possibl bit possibl restrict collect structur turn decid implic problem undecid implic problem context collect sentenc restrict implic problem restrict class simpli special case unrestrict implic problem context interact path type case type constraint express path constraint languag question hope observ clarifi result section exhibit path constraint implic problem decid respect collect structur undecid respect collect structur satisfi type constraint organ remaind paper organ section review formal definit describ implic problem implic problem implic problem local extent constraint section present semistructur data model model describ type constraint section investig implic problem context semistructur data model strengthen undecid result report show problem undecid untyp data fragment show undecid result break type system ad show context implic finit implic problem decid finit section demonstr ad type system necessarili constraint implic problem show untyp implic problem local extent constraint decid ptime type problem undecid section briefli describ result establish full paper identifi direct work path constraint review path constraint languag introduc describ implic problem constraint section show problem wildli complex context untyp data type data path constraint languag vocabulari constraint languag relat signatur oe constant finit set binari relat symbol depict direct jgj set set label edg graph figur view structur path finit sequenc label defin path formula ffl denot call empti ffl path free variabl denot tail head node vertic true reachabl sequenc label edg ff write ff paramet clear context concaten path denot simpli ff path ffl ff ffl form ff path ff prefix denot ff exist fi ff fl refer figur node person wrote true path express prefix path person wrote constraint defin definit path constraint express forward form backward form fl path path ff call prefix denot set path constraint denot forward constraint assert vertex reach root path ff vertex reach path reachabl path fl backward constraint state reach ff reach reachabl fl integr constraint encount section includ local constraint proper subclass introduc investig definit word constraint express form fi fl path set word constraint denot pw word constraint forward constraint prefix empti path ffl extent constraint section word local constraint implic problem advantag path import reason rise question logic implic path constraint set path constraint satisfi question logic implic path constraint necessarili satisfi shown path constraint implic queri optim constraint check describ implic finit implic constraint notion refin context section assum standard notion model implic logic structur constraint denot satisfi model finit set constraint denot satisfi model oe oe implic problem problem finit subset model satisfi finit implic problem problem determin finit model satisfi set consist constraint section constraint question model satisfi instanc implic problem section show implic finit implic problem undecid context untyp data problem decid finit context model light undecid result untyp special case constraint implic local extent constraint illustr section local extent constraint local call local extent constraint extent constraint local extent constraint model constraint satisfi constraint local extent constraint implic presenc constraint local set consist local extent constraint local constraint interest model satisfi repres global constraint local augment common prefix constraint repres common prefix mit notion describ local extent constraint definit ff path binari relat symbol constraint bound ff form fi ffl fi prefix subset prefix bound ff finit subset bound ff path ff ff ff ff ff form denot prefix definit subset prefix bound empti path ffl binari relat symbol mit extent constraint bound ffl mit constraint db local connect db path ff constraint bound ff view local extent constraint subset prefix bound ff consist local extent constraint constraint local connect db path ff ff ff partit consist local extent constraint constraint local definit implic problem local extent constraint problem finit subset prefix bound ff constraint bound ff model satisfi question model satisfi instanc implic problem local extent constraint note bound ffl mit section show untyp constraint local constraint interact implic finit implic local extent constraint constraint implic finit implic problem local extent constraint decid ptime context semistructur data longer true type context problem undecid context model semistructur data structur data semistructur data versu structur data investig semistructur data model objectori model present abstract term logic section abstract studi path constraint implic model semistructur data model semistructur data type irregular structur miss schema data structur constrain schema semistructur data commonli found biolog data integr document xml view semistructur data observ semistructur data model root direct unconstrain type system schema abstract semistructur oe signatur form section denot root denot edg label refin notion path constraint implic context semistructur data denot impli denot finit impli finit context semistructur implic problem problem finit subset fg implic problem local extent constraint formal context semistructur data model structur data constrain data found instanc mention section applic data consid xml constrain schema studi gener similar model studi support set structur schema term type constraint section investig interact type constraint path constraint schema instanc describ schema instanc assum fix countabl set fix finit set atom exampl atom type includ int string finit set class set type type defin notat repres set type record schema tripl ffl finit set ffl type ffl type assum schema uniqu entri schema specifi type entri point xml document figur schema ffl consist book ffl map book erson record erson ssn ag wrote book isbn year ref author fp ffl fp book instanc schema tripl ffl oid assign map finit set ffl map oid fv vn denot domain atom type ffl repres entri point instanc set instanc denot type constraint present abstract structur data view semistructur data constrain schema line abstract semistructur data repres structur logic structur satisfi type constraint structur depict direct type constraint abstract simplifi analysi interact path constraint type system defin signatur determin schema schema defin set binari relat symbol set unari relat symbol ffl ffl class note distinguish binari relat denot set membership relat signatur determin schema constant symbol finit set binari relat symbol edg finit set unari relat symbol sort defin signatur determin schema ffl instanc schema intend ffl includ ssn isbn ref author ffl includ fp repres instanc schema structur satisfi type constraint repres data entri point record label set type data structur satisfi type constraint specifi restrict edg vertic type base definit instanc give ffl element jgj uniqu type ffl element jgj type satisfi constraint atom type outgo edg class type outgo edg label lead element type jgj type iff class type outgo edg edg label type jgj type iff node graph repres place restrict number edg label type node edg connect abstract schema finit structur denot set abstract denot set satisfi type constraint sequenc label path structur interest edg label sequenc denot set path sequenc ff edg ff iff assum schema constraint defin term path path constraint natur interpret instanc schema notion defin instanc constraint detail discuss lemma justifi abstract defin lemma schema iff hold type path constraint implic restrict schema schema finit subset denot impli denot finit impli context implic problem problem finit subset fg schema implic problem local extent constraint formal context model restrict denot model support record structur set record consist valu atom type oid finit set class set type defin notion schema instanc defin compar featur structur proven repres linguist data schema defin type constraint set type consid notion defin defin implic finit implic problem local extent constraint context implic constraint section show undecid result path constraint implic establish semistructur data type data prove theorem context semistructur implic finit implic problem undecid theorem context model implic finit implic problem decid finit theorem show ad type system simplifi reason path constraint undecid untyp data theorem shown strengthen result identifi undecid fragment fragment gener pw class word constraint introduc section present fragment recal finit set binari relat symbol signatur oe defin section pw fragment defin pw pw pw context semistructur implic problem pw problem finit subset fg pw theorem establish undecid theorem immedi theorem context semistructur implic finit implic problem pw undecid undecid result pw gener pw mild shown implic finit implic problem pw decid ptime prove theorem reduct word problem monoid give review word problem monoid word problem monoid recal notion finit alphabet free monoid gener equat pair string fi ff fi test equat denot monoid homomorph word problem monoid problem result theorem word problem monoid word problem finit monoid undecid reduct word problem encod word problem monoid term implic problem pw finit alphabet finit set equat assum fl fi ff fi logic signatur oe constant set binari relat symbol note letter binari relat symbol oe ff repres path denot ff denot concaten oper path string encod term pw consist fi fi ff test equat encod pair constraint pw lemma show encod reduct word problem monoid lemma theorem theorem lemma context semistructur fi iff iff proof give proof sketch omit detail lengthi proof due lack encourag reader consult exist finit monoid homomorph defin relat ae iff string ae ae class ae respect distinct node defin oe jgj ae root binari relat popul ae ae structur shown figur verifi finit model finit oe defin relat ae iff ae class ae respect defin ae oper ffi ffi ae verifi finit ln ln ln figur structur proof lemma undecid show context model undecid result establish longer hold undecid due prove straightforward induct length ff untyp lemma hold gener lemma arbitrari schema ff uniqu lemma easi verifi lemma schema forward constraint word constraint ff iff lemma schema backward constraint word constraint ff fi iff base lemma give finit axiomat constraint implic ffl ffl ffl fi ffl ffl ff ffl ff ffl ff fi ffl ff fi infer rule shown complet word constraint implic context untyp data rule longer complet word constraint implic context finit subset ir denot provabl theorem schema finit subset fg iff ir iff ir context implic finit implic problem coincid decid proof sketch theorem sound verifi induct length proof suffic show exist ir ow space omit lengthi definit recommend interest reader detail proof base axiomat algorithm test implic finit implic constraint context lemma constraint appli algorithm properti algorithm low complex space limit includ algorithm interest reader consult theorem theorem exist algorithm implic local extent constraint light theorem tempt ad structur simplifi reason path constraint case section show decid result develop untyp data break type data theorem context semistructur implic finit implic problem local extent constraint decid ptime theorem context data model implic finit implic problem local extent constraint undecid theorem demonstr ad type system make analysi path constraint implic difficult counterintuit type constraint assert data regular structur simplifi reason path constraint notic type constraint place restrict structur consid implic problem path constraint fg finit subset untyp find ptime structur schema exclud set structur consid implic problem type constraint determin constrain structur data peculiar undecid decid untyp data show theorem idea proof reduct word constraint implic shown context untyp implic finit implic problem pw decid ptime defin function construct reduct ff path constraint defin constraint ffl form forward ffl form backward recal definit implic problem local extent constraint definit fg finit subset prefix bound path ff binari relat symbol bound ff definit partit foe oe oe bound ff oe oe forward constraint prefix ff form ff ff ff path ff prefix ff reduct defin step defin function oe oe remov ff prefix oe fg oe fg figur structur proof lemma defin function oe oe remov prefix oe fg oe pw pw function establish lemma context semistructur iff iff iff iff lemma suffic show theorem implic problem local extent constraint reduc implic problem pw note ff determin function comput ptime decid implic problem local extent constraint ptime decid implic problem pw give proof sketch lemma omit detail proof due lack suggest reader consult proof show finit model construct structur ad root path ff easi verifi finit model finit model assum vertic construct structur root verifi finit model proce show argument suffic show assum finit model base construct structur shown figur jh root node vertex definit verifi finit model breakdown decid show decid result establish break context prove theorem reduct word problem monoid recal section defin schema ffl ffl defin fcg ffl note letter record label ff repres path denot ff encod term finit set consist fi fi encod test equat definit easi subset prefix bound set partit ffl consist defin constraint bound ffl consist constraint bound oe prefix oe constraint lemma show encod reduct word problem monoid theorem lemma theorem lemma context fi iff iff ln figur structur proof lemma proof lemma properti uniqu vertic hold due type constraint structur satisfi form shown figur unlik semistructur longer interact includ proof lemma due lack space interest reader detail proof mention proof theorem applic note structur shown figur type constraint form constraint separ semant xml type constraint path constraint investig interact demonstr ad type system case simplifi analysi path constraint case make harder studi constraint introduc interact type system type model similar studi support record set restrict shown implic finit implic problem undecid context semistructur decid finit type ad shown implic finit implic problem local extent constitut fragment decid ptime untyp context type problem undecid result establish full paper due lack result report includ paper mention encourag reader consult recal pw section implic problem implic problem implic problem pw local extent constraint semistructur undecid decid undecid data model decid decid decid model undecid undecid undecid model undecid undecid undecid model tabl main result paper path pw defin gener class word constraint pw pw defin pw pw pw theorem context implic finit implic problem pw undecid studi model support finit set set major differ schema set structur satisfi type constraint defin logic schema order defin implic problem finit implic problem path constraint necessarili lead decid problem shown result develop hold proof analog proof reason mention theorem context implic finit implic problem pw local extent constraint undecid main result summar tabl research interest studi interact path constraint strict type system object relat data model includ path constraint xml document semant import path constraint syntax conform xml xml dtd offer preliminari describ syntax extern link studi remain acknowledg leonid val tannen victor vianu valuabl comment discuss refer abiteboul proc intl conf theori vianu foundat abiteboul kanellaki ident queri proc acm sigmod intl conf manag abiteboul vianu path queri proc acm symp principl system gurevich classic problem malhotra content descript note paoli markup languag recommend buneman tutori proc acm symp principl system weinstein constraint semistructur structur proc acm symp principl system fan weinstein path type technic report depart comput inform cattel morgan san minker semant queri optim deduct foundat deduct logic program morgan san cluet delobel gener framework optim proc acm sigmod intl conf manag suciu queri languag note mathemat introduct logic academ valduriez methodolog queri reformul ci semant special issu formal method cooper inform system vol note lassila swick descript framework model syntax specif work draft de rose note lewi papadimitri element theori comput maler de rose link languag work draft tannen equat chase proc intl conf theori round van benthem ter handbook logic languag
HCI/46 4 technic report aspect network edg intellig andrew robert van copenhagen school electr comput rmit melbourn australia abstract case migrat intellig core network peripheri simpli function ip fundament forc report address issu perspect core network mobil network emerg internet identifi forc conclud long term trend driven simpli argument logic progress trend intellig migrat type intellig form basi progress report conclud identifi challeng internet construct environ ip smart space introduct rapid ip network essenti establish domin approach essenti place intellig end reduc role network core function transport rout attempt unravel forc drive intellig core network edg present present choic base rapid develop argument base inher uncertainti applic set core function form basi ip network emb network case essenti forc drive intellig issu center network peripheri part technolog system commerci forc case core technolog forc drive intellig case quest emb internet everydai physic object object eventu intellig aspect system section core address mobil network final object address challeng creat network edg intellig ii core network prime motiv develop earli telephon switch rel scarciti long distanc transmiss capac import concentr traffic effici share long bandwidth switch slow difficult implement servic involv complex process rise comput period avail comput readili emploi allevi cost long bandwidth earli link speed order avail process cycl faster transmiss speed effici share singl telephon line core architectur internet echo earli dai effici place complex router core network time widespread adopt optic fibr backbon trend direct reduc real cost long bandwidth import price structur exist commerci cost transport packet place reduc dramat year process speed comput process make architectur term ratio time process singl packet node time transmit singl packet typic long optic link network slow router fast link high ratio ratio rel process time singl instruct router term trend year slower slower rel process speed trend show sign prospect advent optic process network node figur core network typic ip network heavili path network node build redund scalabl mesh mechan deal mismatch transport process speed mesh network spread load avoid bottleneck top network imagin approach network call approach approach node queue slow progress packet expend cycl kei question process cycl node network rapidli environ router faster link improv journei intellig select rout current environ router bottleneck consid simpl effort packet deliveri mechan grade servic provid mechan node deal differ grade current situat slow rel mechan provid network edg zhang provid investig provis grade servic edg router core router core network remain substanti edg router perform function admiss control schedul core router updat relev time inform packet network process packet network firstli edg router node packet schedul deliveri core node core packet maintain header state reserv rate flow relev packet time inform essenti problem schedul packet handl edg core node reduc simpli report progress bit ip header reserv report state packet respect deliveri deadlin path control node path requir report approach integr servic direct edg varieti mechan provid admiss control report scalabl accept ip network essenti tree great care ensur scalabl higher node tree node requir flow involv high level node larg number flow tp quickli bottleneck case flow network depth diamet averag node high level node handl order dt flow scalabl great import model serv accept futur includ type internet node smaller cheaper mobil phone scalabl remain high prioriti scenario ubiquit comput node ip place continu prioriti core node simpl argument favour network node implement sophist bill price servic significantli df approach marketplac simpler df servic attract user sensit price packet carri secur surviv secur argument secur issu current internet preval systemat attack domain server futur ip servic futur path imperson ip specif case dn denial servic contrast df approach network requir authent dn expect slow request order magnitud deal denial servic attack df adopt current practic internet progress deni servic node launch attack figur illustr approach matter structur hierarchi point node repeatedli check authent potenti bottleneck df approach illustr figur current central defenc dn attack reli activ isol node point attack node identifi locat progress isol systemat attempt isol edg node closest point attack dn request edg compar make definit advantag requir systemat authent essenti scale long pace frequenc attack figur approach dn attack reliabl link smart df link level slower process rel transport argument swing df direct small number provid higher number df link deal link redund twenti year direct df architectur activ domin movement continu follow df principl iii mobil proport ip node mobil cellular phone pick function desktop comput growth style cellular network develop style local bluetooth network task forc goal creat protocol seamless mobil ip session wireless network similar project possibl user select rang wireless network manner marketplac mobil accompani wider varieti air interfac current mode interact wireless network requir user establish contract network establish connect network user establish tcp session build subsequ move rang network session lost project aim creat protocol air interfac user move bluetooth network build activ session transfer region network provid wide area mobil figur figur illustr process session mobil termin exist session establish local access point bluetooth process seek connect adjac network bluetooth network process proce interact lap contact mobil termin lap assembl candid list consist altern lap place lap distribut activ lap choic choic lap move edg network mobil termin make lap contact assembl surround lap make inform prefer simpl random choic concern mt migrat singl lap basi success report avoid request perform data candid lap make basi report perform inform choic candid illustr prefer migrat intellig mobil termin mt assembl view network make basi inform major concern leav choic lap inform mt request time report person router clark approach wireless mobil base handheld person router long term contract wireless provid process readi mobil network situat figur mt choic lap mechan deal choic user interfac router user simpli select choic user alter balanc altern intellig migrat network mobil termin give user control process attach creat market network attach mobil termin person digit element person router project develop person router project extend directli includ messag origin specif control urgent messag famili satellit network deal immedi routin email work back queu readi deal time arriv critic person implement person interact control deal detail messag email interact content control high person model combin highli develop situat awar requir autom direct mobil give rise migrat intellig network control individu iv internet project cost reduct electron build comput lower cost physic object follow moor law project cost simpli processor smart card project identif order total cost practic item cost time expect greater proport physic object tag case intellig distribut follow hierarch approach wire node intellig tag import distinct sensor network tag network sensor network requir oper natur energi sourc wire node tag network primarili oper construct environ gener power node tag sensor network prioriti conserv sensor network long life prioriti tag network batteri cost high proport tag cost sensor network intend remot reli batteri power extend period silva kei challeng creat protocol provid remot monitor exhaust batteri life extrem sensor network distribut freeli physic environ estrin number scenario applic sensor item factori track scatter disast area tag vehicl explor vision ubiquit comput larg physic environ effort devot design seri protocol meet energi requir approach attempt map physic activ sensor network movement anim partial anticip sensor network order match sensor activ movement simpli sensor select activ probabl sensor activ gather inform substanti reduc power consumpt consid problem sensor design silva issu protocol design construct environ airport termin natur reconsid approach advantag technolog extrem simpl reli exist wire power build avoid batteri power tag interest creativ combin smart space tag nixon applic adapt exist protocol environ select filter messag migrat applic protocol directli space semant construct environ space build defin relationship object tag supermarket load object transact defin condit similarli item sit shelf date item sold handl cry desert sensor environ gain make environ object fig supermarket shelf case tomato pick shelf environ movement vicin monitor light event import environ attempt identifi object move case pick move hear shelf repli point commun place shelf shelf talk warn head prime transit end flag except condit make break exit interact specif call semant supermarket highli specif defin space question address term prime object tag number situat import commun move truck travel supermarket commun time wait load bai supermarket process movement normal condit process applic specif top normal protocol possibl repli motion time resolv conflict replac frequent poll group tailor task encod semant supermarket ensur commun minimum real challeng straightforward journei complex vari life fresh tomato imagin environ fresh tomato paid imag object simpl process detect movement tomato shelf weigh charg enorm challeng reminisc great challeng outdoor robot extrem challeng straightforward case ticket baggag tag rout team autonom robot servic benefit relationship intellig object case instrument physic object make widespread applic autonom robot princip block poor perceptu abil object activ suppli perceptu semant inform home expect clutter structur space smarter object simplifi softwar semant physic space encod applic resid physic simplifi process creat term origin quest understand migrat ultim supermarket intellig shelv tradit architectur supermarket suppli chain model put intellig comput form integr model scanner link report system track demand demand fed back supplier system supermarket intellig integr updat fed back server mainstream ip network system contempl system extens intellig built object media storag concept directli extend wide rang intellig space simpl shelv supermarket improv sale item part process pictur ag stock shelv intellig object report long give instant pictur altern approach requir compar data suppli side scan smart object instant report shelf queri object long mode oper supermarket physic space wire system add complet item space item incorpor directli avoid object drive process system updat supermarket physic space object compat space oper space discuss futur quest understand migrat intellig network core network high speed optic fiber object connect network consid mobil termin tag network found consist movement intellig core peripheri whilst wai continu trend wider adopt end end ip deeper reason continu push migrat forc continu drive intellig network core wide varieti intellig servic environ core telecommun direct gain currenc import challeng crucial intellig space power situat suitabl smart power difficult issu silva energi ambient environ consum power approach print batteri sustain node complet lifetim applic driven requir mean deriv energi construct environ import protocol supermarket advoc applic specif protocol number messag exchang object node store ip network core protocol advantag wide rang applic specif opportun approach case exist modifi suitabl protocol construct environ softwar architectur environ constraint object node environ present challeng softwar develop architectur attempt address address mobil small devic small handheld devic world step present larger popul object wider spectrum capabl advantag unifi approach softwar remain creat suitabl platform compat challeng backward compat exist infrastructur supermarket transform label approach step object slow march rang product path maintain compat exist infrastructur object dual track acknowledg report base talk deliv atr april rmit peter davi atr colleagu rmit input discuss vi refer david arnold al talk usenix workshop basu thoma dc larg smart issu posit paper darpa nist nsf workshop research issu smart georgia institut juli al framework integr servic oper novemb andrea birk system distribut scientif mar pp david clark design end end argument brave commun polici internet ed mit sept servic internet ietf june al distribut ieee custom integr circuit pp david clark john person router silva jl da silva jr al methodolog date al effici code spring technolog deborah ramesh govindan john heidemann coordin sensor intern confer mobil comput pp acm robert grimm al direct workshop hot topic oper system page robert tom brian bershad david system architectur acm sigop european page septemb scalabl robust commun paradigm sensor proc acm mobicom theo adapt extens submiss meet septemb jame ed layer protocol support optim ip internet draft juli protocol internet draft distribut physic acm chi confer extend abstract simon gerard smart workshop softwar engin wearabl comput june ireland jan julio da silva danni patel support ad hoc power wireless ieee juli pp wendi rabin balakrishnan protocol inform dissemin wireless sensor mobicom seattl washington peter arkin bill segal transpar inform deliveri mobil ieee symposium cluster comput ion hui zhang servic flow septemb pp mark weiser comput scientif septemb adapt qo manag ieic tran jan
ML/47 6 robust genet algorithm loui genet adapt system lab depart comput scienc nevada judi johnson genet adapt system lab depart comput scienc nevada abstract investig robust case initi genet algorithm system respect problem index confront seri similar problem store potenti solut associ memori retriev solut improv genet algorithm perform time defin similar kei perform improv studi index scheme class simpl problem provid empir evid robust imperfect index introduct genet algorithm random parallel search algorithm search popul point goldberg typic randomli initi start popul genet algorithm proce sampl search space confront set similar problem make start problem solv search attempt scratch random initi popul previou search attempt yield inform search space seed genet algorithm initi popul solut similar solv problem provid inform search reduc time find qualiti solut approach borrow idea reason problem solut store case solv problem schank memori genet algorithm handl adapt genet algorithm case gener mechan individu gener ga search thought case part case cbr system difficult find problem opposit sift larg number case find potenti seed initi popul copyright american associ artifici intellig reserv store case initi popul attempt problem case chosen base index similar problem problem store ga solut chang ga oper crossov mutat adapt solut problem hope store solut similar problem store build block common solut problem inject store solut initi popul schemata build solut machin learn point case rule store inform approach genet base machin learn holland classifi system goldberg simpl string rule long term storag genet algorithm learn adapt mechan problem solut suppli genet problem solver long term memori lead improv time index major issu case problem prototyp system test problem studi effect index scheme perform studi understood simpl problem analysi intuit principl applic system complex problem preliminari result resili respect index scheme improv perform mislead noisi index scheme section background defin set similar test problem section describ methodolog outlin baselin index scheme result baselin index scheme variat scheme follow section direct futur research background earli work combin genet algorithm system mcgraw approach explain process solut genet algorithm approach concern gather inform develop solut intermedi gener genet algorithm studi initi result seed popul schema gener earli ga run lost work loui dealt schedul circuit host applic provid empir evid combin system efficaci xu loui loui li loui johnson thrust work involv research select case inject number case seed popul result solut found shorter time period earli work field ramsei grefenstett initi popul ga find strategi simul period chang environ solut strategi similar environ initi popul time environ chang improv result observ compar ga run knowledg chang environ ga restart environ alter current work loui johnson show combin genet algorithm system improv perform experi simpl test problem problem combin circuit travel schedul johnson properti test problem set simpl problem index scheme test system type problem distanc chang method case inject studi perform test problem review problem set base number bit string consid problem string string string length posit string number left number fit string fit index problem class maximum fit problem class length string index easi index problem simpli posit defin start string distanc problem distanc problem small solut string problem distanc differ solut bit posit number problem class equal length string solut construct problem simpl effect index scheme test perform problem set establish baselin comparison perturb index scheme test robust respect index initi correct case inject import paramet liu found gener trend case select problem distanc inject case lower fit result solut trend larger problem size quicker flatten perform curv maximum fit versu higher fit individu inject trend index strategi chose lower fit individu problem distanc high higher fit individu problem distanc low set threshold calcul linear problem problem store problem problem distanc threshold solut problem put usabl list seed individu chosen string usabl list distanc proport select probabl solut problem chosen inject cb denot design linear distanc problem distanc proport select similar select classic ga string chosen solut solut problem close problem previou solut threshold problem randomli chosen solut problem usabl list individu chosen gener base problem probabl individu gener proport problem distanc close problem solut chosen gener solut store close ga seed solut earlier gener presum lower fit solv problem store elitist select provid result rest work present paper section studi time find solut problem baselin result chose string length ga run time random solv randomli chosen problem indic result averag run run ga gener set run problem problem chosen figur show number gener find solut problem attempt inject number gener arriv solut inject case time solut remain approxim time approxim problem statist time solv problem number problem solv time solut number problem solv fit figur solv randomli gener problem repetit time solut fit qualiti solut figur fit found inject case experi maximum fit found fairli constant maximum fit problem solv ran ga problem set problem order ga random ga run ga repeat problem run time solut shorter inject fit found inject case set problem problem attempt problem evalu order similar result time solut fit found case qualiti solut found approxim repetit problem time solut slightli longer averag repetit repetit number problem solv gener solut number problem solv fit figur solv randomli order problem repetit ident order ten run time solut fit statist time solut approxim problem solv number problem solv time solut number problem solv fit figur solv randomli order problem repetit ident order ten run time solut fit result learn system improv time arriv solut system conform mitchel definit learn system mitchel defin machin learn program comput program learn experi respect class task perform measur perform task measur improv experi problem confront system task perform measur time qualiti time solut qualiti result perform measur improv result show perform measur improv satisfi improv expect find problem perform measur improv result index scheme system gener result time good index system real world dont properti problem set simpl linear problem distanc index scheme perturb simpl linear index scheme linear scheme rest studi perform realist condit random index studi case distanc linear random problem randomli insert arrai arrai indic calcul problem distanc distanc calcul dist calc indic arrai randomli order problem number actual distanc dist actual dist actual dist calc figur linear arrai arriv fit faster random arrai base random inject reach fit faster pure random initi figur show fit found higher linear distanc calcul random pure random initi expect random arrai case number problem solv gener solut ga linear random number problem solv found ga linear random figur solv randomli order problem repetit ident order ten run linear random inject versu canon ga time solut fit inject creat situat case chosen randomli respect problem distanc expect true measur problem distanc case inject result select case system random random case inject perform random initi randomli chosen case solut problem requir block row block block build block solut problem requir similar block ga find solut faster random initi popul quadrat exponenti index studi robust respect index index quadrat exponenti function problem distanc problem distanc calcul dist calc problem distanc dist calc quadrat exponenti index popul ran ga gener figur quadrat distanc fit linear index produc similar result exponenti distanc poor improv time produc result similar random initi figur number problem solv time solut quad exp linear number problem solv fit exp linear quad figur solv randomli order problem repetit ident order ten run linear initi ga time solut fit linear quadrat index achiev similar fit exponenti index gener lower fit solut chang distanc function quadrat linear place emphasi case problem close problem addit emphasi problem similar result achiev time linear distanc function emphasi close exponenti distanc fit solut gener time arriv solut exponenti distanc place emphasi case closer exploit explor resist test ad randomli chosen number problem distanc index studi percent probabl ad random factor respect time base inject noisi distanc calcul produc result similar linear distanc inject downward trend time problem solv fit noisi index gener fit solut random initi strictli linear distanc index probabl make great differ result figur show random linear inject noisi inject probabl figur linear index noisi inject probabl ad index random randomli initi ga tradeoff explor exploit linear inject exploit close inject solut problem solut arriv fit time ga noisi inject techniqu noisi achiev fit solut explor search space number problem solv fit ga figur mislead linear fit found result demonstr robust respect varieti index scheme test select strategi preliminari result provid evid expect learn improv perform poorli understood domain inform design good index scheme result explain perform number applic domain xu loui loui li loui johnson simpli inject randomli select solut similar problem result perform benefit solut qualiti current result provid evid robust point area investig investig effect select strategi crossov oper work quantifi result base mathemat model system area research index scheme base candid solut similar problem similar reduc domain inform requir applic depend index scheme system acknowledg materi base work support nation scienc foundat grant refer genet algorithm machin learn addisonweslei adapt natur artifici system ann michigan press combin genet algorithm reason structur design ms depart comput scienc solv similar problem genet algorithm memori seventh intern confer genet augment genet algorithm memori solv travel salesman problem joint confer inform combin robot control strategi genet algorithm memori sixth annual confer evolutionari reason assist explan genet algorithm result journal theoret artifici intellig machin learn initi genet algorithm intern confer genet san morgan kauffman insid reason lawrenc erlbaum associ genet algorithm open shop schedul intern confer comput
ML/48 6 learn tag inform extract text fabio abstract algorithm adapt inform extract learn templat fill rule insert sgml tag text base cover algorithm learn rule gener instanc tag corpu test scenario inform domain languag experi report excel result respect current state art introduct gener agreement main barrier wide commerci difficulti adapt system applic domain year interest appli machin learn inform extract text interest applic adapt web page inform domain email build fulli autom system due side econom relev applic side applic complex natur languag fulli autom current state art paper present prototyp adapt scenario user corpu tag test inform domain extens web page free text introduc report result task inform domain languag final compar state art system present futur work ongo industri applic present induc symbol rule task base cascad adapt modul perform text entiti recognit templat fill rule formal induct algorithm modul paper report rule induct templat fill work test product mode mode work requir input collect text analyz morpholog disambigu part speech tagger output text augment sgml tag indic presenc extract set templat summar text content oper train mode requir input text mark sgml tag locat inform la ricerca povo itali futur depart comput unit kingdom extract output produc usual set tag rule extract statist accuraci process train corpu test mode requir collect text tag sgml tag produc standard set statist abil locat inform test corpu produc templat rule induct learn insert sgml tag gener exampl found tag corpu learn introduc tag independ close tag make adapt recogn slot filler learn multi slot rule rule induc rule pool contextu rule correct rule induct induc rule pool algorithm start select posit deriv initi rule posit exampl tag found corpu rest corpu consid pool neg exampl initi rule pattern window text surround tag word word text intern repres featur vector token text lemma lexic categori case inform list user defin class specif word dictionari initi rule gener relax constraint reduc pattern length relax constraint term pattern tabl gener test corpu posit neg match record accuraci score wrong match instanc rule report accuraci cover posit cover part error rate threshold gener discard retain rule part rule pool rule enter rule instanc cover remov posit exampl pool rule induct continu select instanc write rule pool posit exampl void find contextu rule effect rule pool extract inform limit matter fact set rule appli rule deriv seed cover portion input constraint present index token lemma cat case sem tag art seminar seminar noun prep digit pm pm verb tabl start instanc seminar pm test corpu high reduc recal mean instanc gener correctli cover number cover instanc left goal step find set rule recal obtain rule lose step reconsid rule select rule discard report low report high recal idea find set rule reliabl restrict situat rule insert miss test context start tag left context tag sequenc encount train corpu effect program david illinoi pm hall low recal rule discard rule insert tag test context identifi tag left context identifi tag contextu tag applic rule restrict gener restrict applic rule specif linguist context envisag case side model specif pattern recurr specif context seminar announc titl frequent deriv rule produc spuriou result appli sequenc mention contextu tag correctli model sequenc note context model sequenc tag captur gener pattern side contextu index token lemma cat case sem tag digit pm tabl gener rule tabl word drop constraint categori capit relax lemma capit relax tag order context tag rule tag word select good rule tag sequenc capit word word rule good rule constrain presenc tag left context mean rule mean organ tag put tag word word correct rule appli rule pool contextu rule test set report high recal locat inform slot filler boundari detect typic mistak part time express aspect common approach adapt report slot reason induc rule shift wrongli posit tag correct posit learn mistak made appli rule pool correct rule train corpu shift rule wrong tag posit distanc correct posit shift rule induc algorithm tag pattern match tag produc previou step rule shift correct shown tabl constraint relax perform usual produc rule test corpu tag previou step posit neg shift correctli assign count shift rule accept report accept error rate threshold token lemma cat case wrong tag correct tag prep digit pm pm tabl correct rule pattern reduc present longer pattern semant field term extract inform test phase inform extract contextu correct valid rule induc step step rule pool initi tag text contextu rule appli context introduc tag contextu tag appli tag tag gener contextu rule match tag insert contextu rule correct rule appli order correct error final insert tag valid subsect valid tag insert algorithm valid mean produc start tag close tag task strategi uncoupl tag produc gener case uncoupl tag consid spuriou remov case contextu inform order insert miss tag system sequenc tag found train corpu order valid extract inform order cover addit miss inform zone highli regular messag post inform typic sequenc field rapier rec prec rec prec id titl salari compani recruit state citi countri languag platform applic area slot tabl result experi job domain half corpu half test add miss tag post messag discrimin spuriou uncoupl tag correct uncoupl tag check text tag uncoupl tag assign statu correct tag coupl default strategi zone time zone mutual text zone reason miss put tag strategi made abil learn separ start end tag end process system produc set contextu rule shift rule result test corpora inform cmu seminar announc corpu austin job announc itc seminar announc develop experi perform train subset corpu hundr depend test learn rule unseen text cmu seminar announc english corpu announc written english corpu develop dayn freitag cmu made rise initi task consist uniqu identifi speaker start end time locat seminar corpu locat tabl show accuraci obtain compar system system test task discuss accuraci calcul muc task recogn speaker respect recogn locat recogn rapier rec prec rec prec speaker locat slot srv whisk rec prec rec prec speaker locat slot tabl result experi cmu seminar domain half corpu half test task concern job announc written provid mari elain califf made rise initi task consist identifi messag job titl applic salari offer compani offer state citi countri job program languag platform applic area requir year desir year requir desir post date result obtain task report tabl obtain system rapier whisk task test collect seminar announc discuss list articl written mix figur task consist identifi titl date time seminar seminar post task identifi singl occurr order highlight result read compar cmu seminar task requir occurr templat slot fill gener similar cmu titl identif complex task matter fact locat repeat corpu finit time author proper easili identifi titl slot complet content determin priori term syntax content titl span line seminar concern comput content restrict titl identif layout shown text titl fact figur whisk whisk obtain lower accuraci rapier newlin speaker featur complex itc seminar announc task bilingu relev limit possibl morpholog po inform languag italian italian morpholog richer languag italian preprocessor mean part written english return wrong lemma italian plural lemma return lemma morpholog find categori return po tagger english part wrong contribut preprocessor case worst case introduc accuraci determin filler task version italian preprocessor mention test accuraci version preprocessor relat research provid excel result knowledg result obtain corpora mention concern symbol approach result compar obtain multistrategi version srv main featur separ recognit tag independ relat start end tag exploit contextu inform opinion higher recal convert strict threshold separ start end tag easier gener rule write rule learn strategi order learn pattern regular express exampl algorithm write rule reason good result respect system stricter contextu inform experi show gener introduc relev error reason good result reli correct step report recognit slot similar experi accuraci obtain correct rule account accuraci speaker cmu experi correct pai job experi due open filler respect slot job domain close compar posit current state art inform domain section compar algorithm test testb seminar job whisk srv rapier system text form induct logic program induc rule corpu tag target templat slot filler consid target field token target phrase token rapier rule match semant morpholog constraint induct figur itc seminar announc start specif rule match target slot train pair randomli chosen rule relax gener gener process repeat progress made obtain result domain system test reason accuraci introduct correct step mention type initi rule similar singl rapier singl slot system concept real differ gener process rapier rule compress strategi gener rule peculiar appendix opinion risk gener make contribut final result harmon produc spuriou result run time rapier compress algorithm complex smart align methodolog order simplifi process hand rapier rule formal power kleen star option oper whisk possibl gener rule extract system regular express extract pattern test structur free text whisk write rule whisk cover algorithm induc rule find po act cor par mi prec rec street citi provinc zip email telephon fax tabl applic train text test text averag length word po correct answer system produc act answer provid system cor correct answer provid system par partial correct answer provid system partial overlap correct wrong answer provid system system select part text mi inform miss system system miss spuriou answer provid system inform present system provid gener rule cover seed ad term special perform level coverag accuraci longer met activ learn reduc tag corpu conjunct parser free text analysi inform domain whisk report lower result respect low impress due strategi gener exampl matter fact problem gener mention system learn singl slot rule worsen rule express exampl mention found context model whisk rule explan low recal obtain whisk cmu seminar task version whisk opinion opposit contextu inform larg step low high whisk reli concept sentenc inform domain seminar concept sentenc unclear gener contextu inform sentenc boundari inform rule worsen problem scarc gener larg inspir whisk initi idea develop bottomup algorithm design found problem mention global contextu inform necessarili relat sentenc spuriou specif valid strategi real differ whisk whisk pattern process sentenc stop absenc stop process add recal domain whisk reach result whisk test type text futur experi comparison srv target extract convert extract problem phrase potenti slot filler system adopt approach combin evid rote naiv classifi relat rule learner rote learner simpli compar phrase list correct slot filler found train naiv classifi comput estim probabl token phrase found correct slot filler relat learner induc manner set constraint length phrase exist word srv complet approach respect compar point view result similar percentag slot intuit result result slot filler result interest understand perform speaker field futur work paper present cover algorithm adapt inform extract algorithm test templat fill inform domain show state art accuraci prototyp base algorithm evalu number applic www wrapper induct joint project main italian internet portal basi search engin extract integr inform web industri project area pharmaceut research test extract inform person canadian compani tabl report preliminari result applic experi mention paper algorithm templat fill separ test algorithm text zone entiti recognit final prototyp includ complet architectur modul expect result mention improv zone ne recognit expect improv accuraci recogn filler involv proper locat ne recognit zone deriv rule rule specif text improv term accuraci domain introduc addit level contextu addit futur work algorithm involv improv rule formal express order includ form option oper gener rule explor form activ learn order reduc burden text tag tag task requir half person dai graphic interfac algorithm result improv addit activ learn untag corpu rapier whisk includ declar strategi process templat merg task straightforward scenario inform case applic free plan integr modul order overcom limit refer descript entiti system mari elain relat learn techniqu natur languag inform phd univ texa method inform ai fabio home page fabio alberto inform extract european confer io press aaron messag understand confer score softwar user extract applic gener learn proc fifteenth confer artifici intellig dayn machin learn inform extract inform phd carnegi mellon sra system proc sixth messag understand induct inform proc intern artifici annot descript sift system induct inform proc confer autonom learn discoveri ellen construct dictionari inform extract eleventh nation confer artifici pp repositori onlin inform sourc inform extract inform scienc institut inform extract rule semistructur free machin
HCI/49 4 natur interfac virtual environ comput point gestur thoma erik laboratori comput vision media technolog aalborg aalborg denmark abstract paper describ develop natur interfac virtual environ interfac natur point gestur replac point devic interact virtual environ point gestur estim kinemat knowledg arm point monocular comput vision extract posit hand map test system show result averag error point screen implement real time system progress expect run introduct recent year concept virtual environ emerg virtual environ comput gener world imagin virtual world virtual realiti vr screen act window vr ideal feel virtual world believ user wear headmount displai locat front larg complet surround larg screen applic area vr train doctor train simul oper flight collabor work entertain chat virtual museum product develop present construct urban plan data mine art applic user interact pinpoint select menu point number point devic advanc develop support interact technic devic surround interfac base term time natur intuit gener problem human comput interact activ research area trend develop interact method closer speech bodi languag depart virtual environ form side cube figur instal stylu point devic interact applic posit orient stylu regist magnet track system gener bright line virtual world indic point similar paper replac point comput vision system capabl natur point gestur hand marker special assumpt make interact cumbersom intuit explor achiev camera paper focu interact side suffici initi feasibl usabl studi expend side camera crt projector camera screen user crt projector camera crt projector fig schemat view size note projector camera shown user insid cube interact point stylu held hand point gestur point gestur belong class gestur deictic gestur describ point concret gestur depend context person direct pinpoint object direct orient lower arm direct pinpoint object depend distanc object object close user direct index finger idea compar instal cave tm automat virtual electron visual illinoi chicago activ contour estim direct index finger stereo setup identifi object user point extrem case user touch object index finger object user point locat surfac comput close user user point text imag project desk tip index finger found camera desk point larger length arm pointer index finger tip pointer found background subtract object point approxim meter point direct line span hand visual focu experi shown direct consist individu line avoid occlud object result propriocept unknown line good approxim top point head index finger estim extrem point belong silhouett user inform object point found search triangular area imag defin extrem point depth map scene user point subtract data classifi point belong arm point belong rest bodi index finger top head found extrem point class camera estim posit index finger found extrem point silhouett produc phase user point mark posit screen visual focu point estim converg point line span mark mean locat visual focu adapt individu user point habit mean user chang bodi posit point context scenario distanc user screen approxim meter object displai close meter case mention occur point object meter point direct line span hand visual focu user wear figur magnet tracker mount glass measur posit orient head updat imag screen point view simpli posit orient tracker point direct consciou head movement point shown unnatur possibl transform syndrom problem neck region due mida touch problem practic sound posit tracker estim visual focu posit hand estim order calcul point direct replac point devic natur intuit action point gestur estim exact posit hand camera difficult task requir reduc make user system feedback loop user point direct line start hand point direct system point user adjust point direct fly content paper remain part paper structur section method estim point gestur present section present experi carri test method final method result discuss section method focu interact side assum torso respect screen estim posit shoulder base posit head vector glass shoulder call displac vector discuss section point direct estim line span hand visual focu order estim posit hand singl camera exploit fact distanc shoulder hand ¢ independ point direct impli locat surfac sphere radiu ¢ centr shoulder coordin origin system origin centr floor ax parallel side cave rest paper cave coordin system camera system calibr cave coordin system calibr enabl map imag point line cave coordin system estim posit hand imag obtain equat straight line calibr method full ¤ optic centr camera direct unit vector line posit hand found point line intersect sphere obtain insert row equat equat result order equat complex solut intersect real solut exist uniqu elimin solut solut respect orient tracker elimin elimin requir posit previou posit simpl order predictor point direct found line span intersect point visual focu point line express line space similar equat point direct valid posit tracker hand constant amount time estim posit hand imag depart equip miniatur camera upper corner usabl studi comput vision base user interfac illumin sourc imag captur imag side figur ambient illumin insid colour depend displai imag bright insid determin displai imag averag bright applic colour machin vision auto gain camera set maximum shutter switch maximum open result noisi imag colour variat al recent system segment user background order gener video avatar infrar camera cope poor light condit simul refer background imag subtract infrar imag user satisfi result simul background inform illumin user estim intens threshold segment user due orient camera calcul intens field view cover part mean background imag imag process place lot data transfer project camera priori knowledg scenario field user time present rai tube projector projector consist crt equip projector posit orient head magnet tracker background brighter imag side side shorter higher reflect human skin skin good reflect long wavelength figur show algorithm segment hand estim posit imag firstli imag area hand point estim posit orient head magnet model human motor system kinemat constraint relat camera paramet field order predictor estim posit hand posit previou imag frame describ algorithm entir imag illustr head posit orient magnet tracker map imag plane rgb constrain adapt threshold camera search area threshold satur red channel imag intens imag label object determin posit largest object fig segment algorithm posit estim hand camera imag histogram intens imag bimod brighter pixel origin background darker origin figur segment user background optim threshold distribut found weight sum group varianc estim threshold dash line figur result binari imag appli threshold colour variat camera imag poor colour close grai vector satur imag colour empir factor red channel segment pixel maxima skin area long user wear cloth high reflect long wavelength histogram red channel threshold weight sum group varianc threshold label appli figur show segment result largest object posit head associ skin area exclud remain object hand posit imag calcul central moment fig segment user histogram intens imag dash line threshold found weight sum group varianc threshold imag fig red channel camera imag threshold red channel label largest object grai valu imag invert evalu section present evalu part system accuraci point section test segment hand test implement real time system test visual feedback user segment hand camera imag imag sequenc user point insid background illumin condit posit estim hand test sequenc qualit result posit estim work robustli mixtur colour case major applic skin segment fail displai imag dark colour red displai measur red channel camera noisi implement real time system progress calcul intens part estim hand posit work version entir imag reduc region pixel imag pentium iii tm expect introduc reduc search area code point experi visual feedback subsect describ point experi evalu accuraci point direct estim section user point point displai screen shown figur visual feedback user show natur point gestur experi user imag point gestur data magnet head tracker displac vector head tracker shoulder measur user evalu data turn uncertainti posit estim head magnet tracker direct moment calibr devic order achiev higher accuraci error larg head posit inform method previou section order accur posit head visual focu point segment imag data ¤ posit posit visual focu point estim posit estim posit shoulder displac vector section figur show result repres point experi circl real posit displai screen asterisk connect dash line respect estim posit user point error figur estim column axi axi axi axi fig setup point experi visual feedback user distanc approxim screen point raster displai axi axi axi axi axi fig result point experi circl figur real posit screen asterisk estim point direct system result repres constant displac vector result repres displac vector circl show averag error experi outer circl show maximum error experi left intersect sphere equat line span camera hand user error user point left due incorrect assumpt section displac vector constant direct magnitud displac vector tracker shoulder vari illustr figur tracker displac vector shoulder hand posit ε estim hand posit shoulder posit estim shoulder posit fig user displac vector tracker shoulder side illustr error introduc assum torso figur illustr direct magnitud displac vector tracker shoulder head straight ahead head rotat left shoulder rotat illustr figur result wrong centr sphere wrong estim hand posit error illustr angl rotat shoulder squeez make relat tracker rotat displac vector figur show compon displac vector figur repres estim shoulder posit imag data tracker data user lookup tabl displac vector function head rotat build figur show result repres point experi figur displac vector estim posit shoulder notic posit shoulder correct estim left column tabl show averag error maximum error point experi mm respect point screen error illustr figur circl averag error outer circl maximum error averag error point experi point fig compon displac vector function figur tabl averag error mm respect point screen axi axi discuss paper demonstr technic interfac devic replac natur finger point point gestur estim line span posit hand visual defin centr point ey visual focu point moment estim imag data ¤ measur futur posit orient electro magnet tracker mount stereo glass worn user posit hand estim intersect line span hand sphere centr shoulder user radiu equal length arm ¢ point experi user user point point screen distanc due movement shoulder point error estim real posit screen observ reduc error correct posit shoulder reduc averag error maximum error find accur result user stand meter error larg depend applic final system estim point direct bright line stereo glass start finger user end object point error critic user part system loop correct fly effect error hinder user accur point feedback accept system applic feedback effect sourc error error origin imag definit point assumpt torso respect assumpt ¢ constant deriv explicit express error sourc present set test scenario measur effect error experi accuraci usabl real time implement finish experi show method replac tradit point devic suggest test issu intend investig mida touch problem inform system point gestur present simpl test scenario gestur easi determin perform mention gestur posit hand constant number frame realist scenario multipl gestur problem difficult type solut present thumb bottom gestur spoken input path follow decid refer improv interact ad gaze agent environ aalborg track data associ academ visual data mine workbench environ build multimod system intern confer cooper multimod virtual design implement cave comput graphic page acm aug uncalibr stereo vision point interfac iapr workshop machin vision decemb mase point interfac imag process comput gonzalez digit imag process ing integr live video environ ieee juli huang detect estim point gestur dispar map fourth intern confer automat march kahn swain understand peopl perseu system intern symposium comput coral novemb creat plan intern confer comput urban plan urban sept nielsen virtual brain project develop simul accept annual medicin meet virtual januari ritter neural recognit human point gestur real imag neural process macintyr feiner futur multimedia user interfac multimedia hand gestur reveal thought chicago mase gestur interfac virtual workshop perceptu user threshold select method histogram ieee transact polhemu stylu magnet tracker fast track hand fingertip infrar imag augment desk interfac fourth intern confer automat march taylor point behaviour brain tsai versatil camera calibr techniqu machin vision tv camera ieee journal robot august
Agents/50 1 rapid concurr softwar engin competit situat marku hannebau jan wendler pascal gmd humboldt berlin onlin servic gmbh depart comput scienc abstract articl experi report evolutionari develop process multi agent system world champion vice world champion robocup simul leagu detail artif soccer initi robocup tempt domain rapid concurr softwar engin develop process compar evalu lesson learn develop project distribut control conclud report introduct articl project manag describ evolutionari develop process softwar project world champion vice world champion simul leagu artif soccer contest robocup robocup initi recent popular scientist distribut system distribut artifici intellig strong competit charact tight resourc direct observ evalu scientif approach distribut solv common problem autonom system robocup scientist distribut artifici intellig focu aspect correspond multi agent system research bound uncertain dynam environ call applic context report robocup act softwar entiti agent develop process develop process hard robocup competit fix date complex domain enforc cooper design implement involv peopl heterogen knowledg skill call process context section show main problem applic context process context jointli solv mean concurr develop result satisfact time constraint figur graphic overview relat problem solut context section give introduct problem domain challeng concurr softwar engin section present develop process humboldt show difficulti intuit project manag problem cope humboldt section main part present principl program task decomposit inform document process coordin small core team bigger team develop conclud part articl evalu report approach project review problem robocup figur robocup contest pose problem applic context develop process context context robocup challeng softwar engin robocup gener concern foster idea technic solut robot artifici intellig commun hold softwar hardwar soccer player quick movement ball handl human player year abil percept action year requir achiev tactic solut result process context problem applic context reason complex team heterogen reason modular document concurr develop satisfi time constraint coordin convent figur applic process context strateg oppon estim human artif soccer player imag ration social action execut simul leagu percept action execut simplifi messag base simul interfac focu ration reason process report classifi type reason domain compar robocup chess chess player time make thought move base full soccer player make rapidli dynam environ limit local inform chess compar solv mathemat artif soccer act real show percept action execut fuzzi commun player environ continu requir summar term applic domain bound ration reason reflex complex problem applic context problem process ffl envisag function softwar fulli specif substanti year winner specif test practic place phase develop ffl project robocup intern held year perform result softwar directli object evalu contest requir softwar easili reduc meet ffl softwar architectur technolog matter research innov problem develop process lie scientif theori ffl success project robocup complex undertaken scientist pure quantiti robocup develop scientif qualiti robocup team highli heterogen composit year robocup team personnel fluctuat problem process context project manag control fourth problem subsum term team heterogen control care softwar engin focu problem solut humboldt humboldt result step solut present problem applic context effort start begin implement librari capsul sensori action execut interfac simul april student practic join develop brought import part main part work core team develop agent orient program consid tradit logic rule base program contrari approach agent orient techniqu structur method engin approach tradit program relat understood control programm procedur paramet call concret condit implement control structur procedur languag situat case autonom agent highli dynam complex programm advanc condit call procedur paramet criteria call extend chess programm concret criteria fix procedur control agent program implement reason cycl choic procedur main challeng design realiz intern reason cycl artifici soccer agent mention reflex rule classic plan time pure reactiv reason lack abil behav tactic strateg implement golden architectur found cognit scienc appli artifici intellig research claim highli suitabl nondeterminist compet local inform bound ration bdi approach agent maintain model call belief true belief action guid desir repres goal intent partial plan achiev chosen goal action rel stabil intent prevent overload reason useless plan quick reaction dynam environ detail found humboldt team knowledg bdi design implement evolv directli guid develop due result code reflect mental categori desir intent choic desir intent monolith mix control knowledg develop lai hand develop humboldt approach cope problem previou section project problem applic project manag result develop process intuit humboldt success lack engin properti mainten develop humboldt develop sourc code manag code result develop merg costli commun deficit led redund work incompat concept common code result constant method mean program structur poor reflect heterogen team member solut humboldt experi made develop process humboldt led refin fundament solut concept applic context section focu major aspect strategi cope problem humboldt develop subsect describ effort modular monolith reason cycl artifici soccer player peopl develop concurr subsect explain team coordin convent document tool part diploma thesi humboldt berlin design principl bdi reason cycl humboldt monolith peopl parallel complex ai reason process easili usual commerci softwar partit categori decomposit parallel develop process team work central decomposit distinct reason control domain depend knowledg reason modular import step decomposit bdi introduct notion option util world time snapshot inform agent assum situat agent view world repres local incomplet knowledg real environ understand world believ world agent option futur world world fulfil condit desir agent subset world call desir world subset desir world achiev consist respect circumst ration agent intend world option repres partial plan result condit player control fulfil figur show relationship world option intend world desir world figur option futur world main idea fulfil mention demand distinct control decomposit reason process modular heurist option util theori theoret calcul util inher complex environ realiz heurist util approxim option model option implement defin effici util attain layer planner continu enforc predic interfac detach reason process shown figur robocup agent activ desir agent possess ball includ option dribbl agent control passiv option desir option util continu enforc predic determin desir determin intent plan intent forc continu sensor input action output determin constraint figur bdi reason process ner constraint impact reason option initi reason process start determin applic constraint domainspecif set constraint pc util threshold min constraint set applic constraint determin fc pc min constraint set option po util threshold min desir set current desir determin fo po min desir agent intent achiev desir compar util recent intent ri adapt intent form current intent max execut chosen intent plan special planner result action sequenc demand properti bdi reason process dynam environ present reason cycl depend effici util estim constraint option solut util estim approxim deliv comput time control process highli simpl greedi approach calcul costli method case desir control knowledg fulli util plan heurist encapsul option support extens reason cycl option estim util independ option team coordin tool humboldt develop taught give special attent sourc code code document commun detail softwar refer standard read present approach proven valuabl develop humboldt discuss strength weak humboldt octob januari gener architectur artif soccer agent design core team januari februari februari march basic class data commun develop parallel design belief compon led mileston simpl reactiv soccer agent practic attach method ai start april student includ develop process contrast year time start practic world begin juli month student eleven acquaint identifi coupl solv final integr support integr featur detach bdi reason cycl design implement core team april reason interfac featur team start work independ option heurist planner hand core team provid updat core function featur team week test mileston humboldt reach end june refin integr contest begin juli success improv made night project schedul shown figur concurr charact develop april juli easili phase coordin interact featur team core team sourc code manag prior sourc code manag system begin project constitut free usabl linux sun support parallel gener project evalu rc control cv version prc control rc part unix distribut stabl disadvantag eager prevent develop work suitabl parallel develop fulli categori modul disadvantag overcom cv mechan parallel work file modul concept prc sourc code manag cv support restrict function elig distribut softwar project cv emploi humboldt cv serv main synchron concurr work individu team close coordin member team repositori version trace bug file extract complet develop stage perform comparison order distribut code modif made core team featur made parti featur cv regular core team publish agent code featur team incorpor repositori import code parti cv autom merg import made featur team larg requir manual basic class activ option passiv option goal defenc learn passiv option integr refin reason phase student june juli april march februari januari simpl reactiv agent strength robocup core team featur team architectur design reali belief compon figur project schedul humboldt team modifi code find reason code convent easi tool sourc code manag exist code convent creat convent tailor domain hour discuss understand common convent code rule result effort cover detail method code layout comment document softwar import team coordin commonli hold develop background rapidli work team member commonli document neglect document spend urgent meet evalu tool document famou repres system programm add comment tag sourc interpret document softwar minnesota produc html file proprietari markup languag languag awkward produc file develop group markup standard berlin creat html file present inherit relat conveni user manual chose document result lesson learn present solut problem applic context process context gave instruct lesson concurr softwar engin design principl write paper humboldt publish team theoret reconsid techniqu inform present bdi strict review widen group develop led full reimplement humboldt main disadvantag bdi reason sequenti cycl case depend weight combin paramet path tree extrem long complic contrari linear combin paramet easili implement heurist util approxim paramet major tree option concept led decomposit control shown highli valuabl transpar rapid cooper implement encapsul domainspecif option design realiz independ option modular drawback heurist util option found trivial problem global util option remain compar great challeng learn techniqu futur work bdi reason cycl team agent proven modular easili maintain spite hard constraint implement process high expect world develop effect control led success particip robocup team coordin cv proven essenti tool develop humboldt synchron team effect coordin logic basi occur basi develop work part file interf version trace bug file inform deduc bug deriv fix cv solv nice replic problem repositori core team featur team cv distribut core team featur prefer manual merg process combin code review ad code featur team core cv stabl independ robocup project artifici intellig laboratori humboldt creation constitut code convent difficult time expect explain lack experi develop topic report accept code convent develop process particip practic week find exist line code line code form particip team robocup interest fact mere exist code convent import detail structur code convent stabl support particip quick project document kind specif develop comment specifi pai addit attent mean document base develop upcom robocup team review uncov problem develop process humboldt includ main ffl code convent lightli chang project led convent inconsist current code base code convent fix begin project alter ffl integr team time spent introduc architectur develop philosophi project improv accept team coordin code convent ffl object practic ambiti frame time constraint show concept brought start phase project simpli integr lack time satisfi time constraint softwar solut concept problem applic domain solut concept process problem tailor concurr softwar develop summar neg applic solut concept inher softwar engin process difficulti make realiz modul sequenti concept tend tightli coupl phase softwar design applic solut concept abil concurr heurist commerci softwar academ involv reason ai techniqu work robocup proven heurist successfulli applic highli competit situat acknowledg author give special particip practic effort success humboldt prof dr valuabl support concept refer practic reason harvard humboldt practic theori robot soccer world cup lnai artifici soccer ai magazin version manag cv support refer intent choic commit artifici intellig emerg cooper virtual soccer environ distribut autonom robot system program rule recommend telecommun system homepag refer challeng problem ai ai magazin homepag refer humboldt und ein fur den einer diploma thesi humboldt theori game econom behavior edit princeton truth probabl foundat mathemat logic essai brace bdi theori practic proc int conf system layer approach learn client behavior robocup soccer server appli artifici intellig softwar engin edit intern comput scienc seri document system java fur refer
Agents/51 1 copyright jonathan david daniela ru workshop agent context competit autonom url econom market mean open system jonathan david daniela ru depart comput scienc dartmouth colleg nh abstract system gain popular applic design process give softwar engin greater flexibl network depend number user number site particip motiv system donat resourc arbitrari agent remedi problem econom market system agent resourc host site sell servic user agent host site accumul distribut user launch agent argu market regul system discuss open issu implement system introduct recent item network programm tool box code mobil techniqu common applic network manag video conferenc softwar distribut network weather forecast network altern mobil programm easili distribut resourc usag network time resourc content mitig reloc execut util machin network mobil agent schedul comput time remot avoid time congest examin restrict typic present system applic implement commun agent applic submit compet user agent technolog unifi design paradigm cooper competit restrict face usabl system stem distribut natur made coordin human societi implement econom market solut distribut control solut appli creat societi mobil agent mobil agent bui comput resourc host scarc verifi currenc agent prioriti govern limit endow danger attack bound agent expenditur system bui comput resourc flexibl expand comput base idl resourc sold user site fair price system valuabl inform agent autonom balanc network load conclud establish goal implement comput market context verifi currenc price set standard convei rule base price mechan ration plan consumpt motiv mobil commonli network observ applic oper close environ rang site agent jump sever restrict common agent system repres interest singl user cooper group user typic agent commun agent applic number site agent jump limit host agent visit analog question web larg number situat clear advantag web server suppli resourc arbitrari client inform dissemin gener boost reput host site product comput resourc export host control host site gener assur arbitrari agent action benefici incent host system provid resourc arbitrari agent addit congest incur normal mobil agent addit risk attack resourc system depend number particip host number particip user agent applic assum agent issu cooper owner entiti issu mobil agent task entiti repres user work interest agent gener complementari agent interest cooper agent situat view common owner agent share common distribut process network perform agent coordin assess impact action medium inform exchang fast incur minim overhead exampl agent coordin agent involv applic stark world wide web user browser send request thousand host site retriev inform inform retriev simpli examin html file browser exchang cooki negoti secur retriev dynam produc web download forward retriev inform applic process typic web involv dozen applic program goal system market overcom limit experienc mobil establish econom market comput resourc servic mobil agent arriv host site resourc complet task resourc includ access network disk data agent provid valuabl servic user agent benefit agent sell servic user agent currenc accumul host site revenu distribut local user turn incom agent complet cycl currenc comput market necessarili ti legal tender currenc currenc exchang real system administr essenti export import comput resourc access underutil resourc sold mobil agent local resourc content user launch agent carri comput currenc budget resourc consumpt ti agent lifetim limit extent consumpt intent exclud user limit resourc price host happi entertain attack maxim revenu price polici ensur demand price posit correl make attack extrem deter mechan discourag wast serv simpl metric resourc content site congest price simpl mean agent coordin revenu maxim host charg market bear high price due congest give agent incent distribut evenli network defer execut congest time price system implement tempor spatial load balanc idea sell comput resourc mobil program discuss recent implement system market distribut network advantag idl cpu approach intend parallel program interact thread limit geneva messeng project appli market idea alloc cpu usag memori visit lightweight mobil program implement languag host site heurist set price examin amount resourc request present messeng telescript agent carri permit access specif resourc permit host trust diminish permit power result agent lifetim limit permit view limit form market host site distribut permit resourc permit resourc easili convert gener form mechan exchang permit extrem point view exchang form secur level secur access sold user site discount access popul set lower price separ currenc currenc user group challeng hurdl cross implement market system mean exchang secur currenc system market structur reward honest facilit plan structur entiti particip market account market reli secur mean exchang incent particip cooper currenc scarc reinforc prerequisit currenc spent buyer note ensur crux monetari system carri overhead electron currenc context system agent monei essenti data host potenti access design minim cost transact cost currenc exchang option host establish local account agent owner deposit account period made secur payment method agent withdraw local account trust host site correctli decrement account balanc deposit small account long period incent host local account cheat lower conduct honest busi option scale level resourc account agent charg action includ count instruct execut number processor cycl bit network monitor due cost measur agent pai fix fee execut set instruct agent rare exact level servic pai happi medium extrem found profil exist applic technolog give intuit level control sort applic advantag mobil similar resourc requir tailor alloc polici accommod major applic extend strategi host resourc packag bill plan agent pair advantag group applic depend prefer resourc demand polici design dynam drive construct econom polici particip goal maxim system engin enforc alloc ideal conflict poorli design polici simpl market creat act maxim revenu custom lesson learn regul condit exist exist design econom system provid environ buyer seller particip facilit construct mechan parti action express true incent compat mechan open honesti mitig cost plan make polici auction potenti buyer simultan submit singl bid good auction winner particip submit highest winner pai highest lose bid optim strategi buyer submit bid equal buyer valuat good issu polici enforc load resourc manag polici provid strong correl content resourc price accomplish set price quantiti consum rise auction held resourc resourc owner buyer compet set price negoti price resourc alloc resourc manag polici account resourc consumpt schedul system design decid entertain consumpt combin user agent pai servic host sell larger quantiti resourc demand base schedul interest valuabl issu studi plan host client side deal complex issu addit dimens user pai amount proport qualiti servic standard polici requir particip awar guidelin regul system site find publish resourc price alloc polici potenti user agent awar rule requir singl standard protocol express market paramet moder point shield user intricaci comput provid abstract user awar servic qualiti receiv gener level congest request agent perform task market proper tool provid open system enforc addit level secur give incent agent autonom balanc comput load network currenc bui comput resourc exchang legal tender system administr temporarili expand domain import resourc capit idl resourc export implement comput market requir research electron currenc exchang minim overhead currenc valid care made part market design owner distribut resourc mobil agent local user attempt maxim revenu agent plan detect polici polici discoveri requir singl standard languag describ market protocol establish market achiev distribut make system feel market natur solut coordin resourc control eventu mobil agent open work remain implement work system acknowledg work support part navi air forc contract onr muri rome lab contract darpa contract refer mario gian design system activ network intern mobil agent page septemb bernard toni white mobil agent network manag ieee commun septemb steve mark mart paul patrick protocol electron commerc world wide web winter fourth intern world wide web decemb dag johansen mobil agent applic intern mobil agent page tomasz mobil comput dartmouth colleg comput scienc slide michael lightweight protocol secur usenix workshop electron page usenix septemb ori onlin market comput resourc intern confer inform comput page octob acm press christian tschudin open resourc alloc mobil code workshop mobil april william vickrei competit seal tender journal jame white telescript mobil agent gener magic white huberman protect inform system intern confer inform comput page octob acm press
Agents/52 1 graphic model recogn human interact barbara rosario alex pentland media art scienc mit ma abstract describ comput vision machin learn system model recogn human action interact domain recognit motion martial art tai interact visual surveil task system combin inform feedback formul bayesian framework graphic model coupl model individu action shown work effici accur amount train overcom limit amount train demonstr agent develop flexibl prior model interact introduct describ comput vision machin learn system model recogn human behavior action recognit martial art tai chi detect recognit individu human behavior interact visual surveil task system concern detect interact peopl classifi graphic hidden markov model coupl hidden markov model model classifi human behavior offer dynam time train clear bayesian semant individu interact coupl gener process major problem statist model rare limit number train exampl major emphasi effici bayesian integr prior knowledg evid data show situat involv multipl independ partial agent coupl hmm approach gener result tradit hmm method develop synthet agent alif model environ build train flexibl priori model behavior softwar agent simul softwar agent yield synthet data train prior model prior model bayesian framework fit real behavior data synthet agent approach straightforward flexibl method develop prior requir strong analyt assumpt made form prior develop robust model exampl target behavior experi found combin synthet prior limit real data easili achiev high accuraci recognit interact paper structur section present overview statist model behavior model recognit section section result real situat final section summar main futur line research visual input experi type visual input stereo blob tracker tai chi system visual surveil case extend kalman filter track blob color veloc inform repres parametr probabl distribut function mixtur paramet statist mix weight estim expect maxim visual input modul detect track move object bodi part tai chi pedestrian visual surveil task output featur vector describ spatial relationship nearbi move object output featur vector constitut tempor order stream data input stochast behavior model hmm vari structur depend complex classifi observ behavior flow inform continu manag combin move object scene bayesian graphic model offer mathemat framework combin observ complex behavior prior provid expect fed back input visual system visual understand graphic hmm statist direct acycl graph probabilist infer network provid effici solut problem time seri analysi model hmm view simpl case tempor pin dag graphic markov model depict time probabilist infer figur pin present import advantag relev handl incomplet data trainabl easier avoid encod causal natur algorithm predict probabilist offer framework combin prior knowledg final modular paralleliz tradit hmm offer probabilist framework model process structur time offer clear bayesian effici algorithm state paramet automat perform dynam time warp hmm essenti quantiz system configur space small number discret probabl transit note prior form graphic model observ state state observ figur graphic hmm time state singl finit discret variabl index current state system inform histori process futur infer reflect current state variabl interest problem multipl interact merit composit variabl typic case system structur time space singl state markov model problem order model interact complex architectur extens basic markov model gener memori system provid composit state time interest system composit state simultan state variabl exact solut extens basic hmm chain intract case approxim techniqu exist exact solut case interact case coupl hidden markov model model interact separ bodi part individu human architectur state chain coupl matric condit probabl model causal influenc hidden state variabl graphic shown figur graph state time depend state time chain influenc chain causal link paper compar perform hmm maximum posteriori state estim comput sequenc state model observ sequenc fo ng sequenc obtain argmax case hmm posterior state sequenc probabl js fa set discret correspond state time js transit probabl probabl state time system state time write js prior probabl initi state final output probabl state introduc set js output probabl probabl observ state time respond probabl state time chain chain superscript state time probabl express causal influenc chain posterior state probabl express js js js js denot state observ markov chain determinist approxim maximum posterior state estim introduc enabl fast classif paramet estim obtain upper bound cross entropi full posterior minim subspac linear number state variabl dynam program algorithm sampl highest probabl path compact state complex chain state observ data point cartesian product hmm involv number typic requir comput interest compact algorithm perform result experi version tai chi martial practic sit stereo blob tracker obtain hand track data tai chi gestur involv arm left singl left left brush knee figur illustr gestur detail descript set tai chi result found view figur select frame brush knee collect roughli gestur creat featur vector consist centroid blob hand result time seri train hmm train hmm classifi full data set gestur viterbi algorithm find maximum likelihood model hmm test data includ gestur perform vari speed slightli view classif shown tabl outperform hmm differ due model earlier experi larg number train sampl hmm reach similar accuraci conclud data process coordin method requir train achiev high classif accuraci tabl illustr sourc train advantag number tabl recognit accuraci hmm tai chi gestur express parenthesi correspond number paramet largest model recognit result tai chi gestur singl hmm coupl hmm accuraci parenthesi correspond number freedom largest probabl output mean output covari convent hmm larg number covari paramet output architectur output variabl due larger hmm train data yield good gener result experi pedestrian video surveil task goal recogn typic pedestrian behavior open plaza walk run recogn interact pedestrian person greet person task reliabl robustli detect track pedestrian scene case blob featur model pedestrian system main cue cluster pixel blob static background move object detect move object build eigenspac model background depend dynam background scene system adapt big shadow trajectori blob comput save dynam track memori trajectori order ekf predict blob posit veloc frame blob model gaussian pdf rgb color handl figur typic imag pedestrian plaza background input imag blob bound box blob segment imag behavior examin gener pedestrian walk open outdoor environ goal develop composit analysi observ behavior term state transit state time manner state correspond common notion human immedi applic wide rang site view situat figur show typic imag pedestrian pedestrian final segment peopl model gener interact wholli determin behavior intern dynam influenc weakli probabl js js equat describ kind interact intend model effici manner system accur interpret behavior interact pedestrian scene minim train inform system found critic problem gener model captur prior knowledg human behavior achiev goal develop model environ synthet agent mimic pedestrian behavior virtual environ agent assign behavior interact gener interact behavior kind individu behavior behavior meet walk meet separ chang direct order meet continu separ paramet virtual environ model data drawn set real scene train model synthet agent good gener invari obtain flexibl prior model learn human behavior model real scene synthet prior model learn robust behavior model small number real behavior exampl capabl special import visual surveil typic behavior greatest interest test behavior model pedestrian detect track system obtain blob featur person hour video exampl type meet behavior detect process model meet continu meet separ interact versu interact detect test perform perform poorli task result addit featur vector consist deriv rel distanc align product veloc magnitud differ veloc vector test video data model train type model learn environ appli directli real data addit train tune data behavior model train start model model data specif exampl type interact recognit accuraci summar tabl noteworthi train recognit accuraci remain data demonstr abil accomplish extrem rapid refin behavior model initi priori model tabl accuraci real pedestrian priori posterior model accuraci real pedestrian data visual surveil system alarm rate import classif accuraci analyz aspect system calcul system roc curv accuraci alarm rate ideal automat surveil target behavior detect alarm alert human oper examin futur work paper comput vision system mathemat model framework recogn human behavior interact real human action martial art tai chi human interact visual surveil task system combin inform close feedback compon emploi statist bayesian approach statist learn hmm compar model behavior interact superior formul demonstr term train effici classif accuraci synthet agent train system creat order develop flexibl prior behavior demonstr abil prior model accur classifi real behavior addit train real data fact special limit amount train data futur direct current investig extend agent interact interact develop hierarch system complex behavior express term simpler automat discoveri model behavior structur automat determin evalu develop attent mechan foveat camera detail evalu adapt learn behavior structur real explor sampl approach recogn behavior sampl interact gener synthet agent acknowledg sincer michael toni jebara matthew brand refer azarbayejani pentland stereo shape estim blob featur intern confer pattern august ieee brand coupl hidden markov model model interact process novemb submit neural comput brand oliv coupl hidden markov model complex action recognit ieee ghahramani jordan factori hidden markov model volum pentland statist model human behavior percept action rabin tutori hidden markov model select applic speech recognit saul jordan boltzmann chain hidden markov model volum jordan probabilist independ network hidden markov probabl model ai memo feb william hinton field network learn discrimin tempor distort string connectionist model summer page san morgan kaufmann
IR/53 5 load share network processor scheme process packet router load share multipl network processor distribut router complement feedback control mechan design prevent processor overload incom traffic schedul multipl processor base determinist map map formula deriv robust hash rout highest random weight introduc kw ieee dg ieee tran state inform individu flow map map function comput identifi predefin set field packet adapt extens scheme provid order cope traffic pattern prove adapt possess minim disrupt properti respect map exploit properti order minim probabl flow reorder simul result scheme achiev improv processor util higher number router interfac support amount process power introduct le router architectur recent develop transmiss demand perform characterist sought design router central router devic singl processor cope workload replac router effect distribut parallel case distribut architectur packet process load shift call network processor forward typic locat directli router input architectur drawback poor util processor load evenli distribut input reach nomin rate parallel router architectur base pool parallel locat remot processor perform data path process task packet buffer relev field packet packet pool resolut architectur suffer load input combin pool pool interconnect major bottleneck drawback load balanc perform load balanc devic singl point failur entir router success design seek combin approach remot locat switch port input line network processor forward serv predefin set input carri packet process task packet arriv input traffic evenli distribut ibm zurich research switzerland le full professor depart commun system ecol polytechniqu de lausann switzerland ieee lead effici util present packet process seek maxim number router interfac support fix amount network processor process power advantag avoid drawback router architectur basic router load share network processor support greater number perform packet process task carri multipl distribut packet schedul map comput total load router system share multipl process unit subsequ processor util lower total system cost electr power consumpt router fault toler improv load share gener survei load share wide accept taxonomi load share algorithm present studi specif adapt load share consist transfer locat polici work show simpl adapt load share polici yield perform improv rel load share case perform close complex adapt polici locat polici shown bring substanti improv random select locat polici task determin process unit specif process job execut function optim shown gener produc answer necessarili optim typic global task schedul heurist kind dynam processor workload inform input effect workload index topic intens research kunz demonstr workload descriptor yield result complex descriptor network interest load share recent area web web cach cluster digit librari carp distribut cach highest random weight algorithm popular choic web server implement product offer microsoft algorithm load balanc request object adapt potenti vulner traffic local ibm network dispatch softwar tool rout tcp connect multipl server share base monitor load metric algorithm adapt control requir maintain state mation tcp connect map research concentr explor possibl parallel implement packet process router function decomposit individu packet process task determin form parallel spatial pipelin concurr oper specif kind parallel emploi algorithm present spatial packet schedul multipl capabl carri task necessarili possess homogen process map establish flow processor base carp extend adapt control loop network dispatch concept flow map state inform flow store map easili comput high speed lookup map possess advantag load balanc scheme split hash object hash bucket arbitrari determin predefin prove specif method adapt result minimum disrupt map optim adapt map subject work map adapt procedur aim prevent individu processor overload design complic minim probabl packet reorder flow due natur network transport extrem packet reorder packet flow wide tcp protocol attempt tackl problem correct reorder reorder slow data receiv buffer size prevent undesir retransmiss subsequ network congest packet flow process packet reorder easili occur packet belong flow process processor monitor full traffic characterist includ solv map problem due perform limit current fulli optim map achiev show heurist present aggreg traffic monitor stai small bound optim solut outlin paper organ section describ environ relat assumpt section present scheme load share network processor section iv lai theoret basi dynam adapt scheme prove minim disrupt properti adjust describ adapt detail section present result simul discuss optim issu section vi deal aspect practic implement load share scheme router section present conclud remark ieee ii notat assumpt router model processor dedic data plane control plane term network processor denot devic perform packet process task address processor dedic data path router denot control point processor perform router control function shortest path topolog inform dissemin traffic engin work concentr issu primarili relat data path router router consist line cp respect heterogen router processor process power denot process power maximum number packet process unit carri time unit denot µ total system process µ denot actual packet process load amount packet process unit carri interv denot total process load system time defin util total system denot amount packet arriv line card time interv maximum transport link packet inform vector defin set kw packet field process alter router carri inform base subsequ packet treatment appli packet router determin destin sourc denot packet inform vector vector space consist valu packet inform vector packet inform vector consum process unit defin arriv vector vector size element denot number packet inform vector arriv router time interv denot flow identifi vector set predefin packet field chang flow vi repres piec data packet integ kv repres number field vector field packet header predefin set field remain constant flow serv identifi vector work assum denot vector space valu identifi vector format identifi vector typic identifi vector tradit flow consist protocol number sourc destin port sourc destin address kv destin address uniqu repres set flow equal protocol address space defin identifi persist vector vector monitor persist flow identifi time interv flow persist consecut time interv packet belong flow arriv assum persist flow vulner packet flow process processor packet flow arriv time interv assum process subsequ packet flow processor lead reorder assum processor process packet iii load share network processor requir router model object present section reformul router set network processor process power maximum line card speed maxim number interfac router support perform constraint constant definit refer point achiev object def defin accept load share scheme distribut load network processor system individu processor system individu processor overload case accept load singl processor overload entir system minim achiev packet drop probabl addit perform load share system parallel possess flow order reorder occur packet belong flow process assign packet processor fulli determinist respect attempt minim probabl packet belong flow treat processor absenc state state inform assign concurr flow extrem costli term memori process overhead highli desir assign flow processor carri state inform store support heterogen system support heterogen processor process capac present prefer processor amount request process fault system adjust processor failur quickli great disrupt map ieee basi scheme load input traffic arriv line distribut process determinist map figur map comput identifi vector comput determin packet map process function split vector space subspac vj packet subspac map processor arriv packet packet extract field relev packet identifi vector packet inform vector packet map comput packet inform vector resolut packet inform vector process resolut inform treatment appli packet outgo switch qo return request unit packet switch correct outgo port packet alter base resolut appli appli attach label splice tcp map base robust hash map scheme call highest random weight present extend def map function assum random variabl uniform distribut packet arriv input carri identifi vector map comput fig load share scheme abstract xj max xk xj weight multipli assign weight correspond partit vector determin fraction request object space identifi vector space assign process pj map possess map load robust hash map load balanc request object heterogen case extrem abil support processor heterogen process capac map weight fraction load map processor control minim shown case processor remov number request object destin minim properti provid fault toler processor flow map processor observ minim disrupt properti limit special case section iv show similar line proof minim disrupt properti hold special kind adjust map weight exploit fact carri map adapt order minim amount flow adapt map ident line card map line line card map comput function gi form scheme requir weight vector ident card iv adapt feedback problem statement load share multipl processor ineffici attent paid individu processor load control goal adapt prevent undesir processor overload consequ packet drop obviou effect occur map load balanc import note load balanc request object identifi vector space load due actual traffic receiv router input port mean distribut uniformli request object exhibit local pattern mean spite map potenti lead load distribut fig load share feedback map adjust account load distribut receiv traffic object control loop prevent singl processor system prevent singl processor system aim minim amount object formul optim def optim max ieee adapt algorithm adapt scheme work gener figur cp gather inform util adapt threshold cp adjust weight map multipl weight vector download map defin instanc time instanc vector comput order evalu statu individu processor util indic introduc filter processor util measur form integ constant similar filter measur total system util introduc filter reduc influenc fig adapt algorithm load fluctuat obtain inform trend processor util adapt algorithm consist part figur trigger specifi condit adapt specifi act trigger period evalu base specif action trigger polici introduc dynam util threshold ɛ defin ɛ dynam util threshold posit current filter total system util util closer total system util approach higher likelihood violat accept load share bound tighter threshold total system util time interv total system util remain vicin util threshold close provid threshold adapt prevent introduc form threshold comput defin fix threshold close vicin fix prevent adapt carri interv typic set close prevent adapt load stai percent total system util dynam trigger threshold combin util threshold ɛ set determin amount util def trigger threshold dynam util threshold ɛ bound defin trigger threshold defin system total max ɛ min ɛ result comparison filter util threshold act trigger adapt start trigger chosen system total max adapt min adapt adapt polici simpl scheme period oper directli vector proposit provid theoret proposit α α mutual subset map ident function differ weight vector pj denot fraction request object space map node map weight ieee prove inequ contradict assum mean exist identifi vector α α α α α contradict assumpt inequ prove symmetr case equal inequ extrem place α close weight chang chang affect singl identifi vector note complex relationship vector hard gener effect direct adjust proposit α mutual subset map ident function differ weight vector pj denot fraction request object space map node map weight fraction request object space map node map equal amount request object map map destin minim case α trivial prove node object chang map proof divid proposit pj show object map map assum exist identifi vector mean α α xj xk contradict assumpt object map map amount request object map differ node equal fraction request object space proposit pj show object map map assum exist identifi vector mean xj xk contradict assumpt object map map amount request object map differ node equal fraction request object space map differ vector lead fraction differ total proof symmetr import note minim disrupt properti gener hold adapt adjust carri singl constant inequ necessarili hold minim disrupt properti crucial minim amount proposit serv background design adapt vector carri constant def assum trigger condit min ieee adapt case perform symmetr manner case system present adapt lower weight exceedingli respect weight remain unchang system total adapt weight exceedingli respect processor lower weight carri minim util exce threshold maxim util remain threshold factor expon repres effect number processor aggress adjust case processor numer result trace driven simul matlab environ ibm rs machin simul model router multipl line card router traffic trace trace correspond network traffic receiv line card paramet gener trace approxim trace statist gather approxim speed shorten time interv monitor traffic correspond ms trace note transform simplif scale trace differ time data multiplex effect packet time account paramet number flow exist time discret time homogen markov attain valu interv uniform transit probabl state neighbor step chang limit flow differ iter ms number packet arriv time discret time homogen markov attain valu interv uniform transit probabl state neighbor step chang limit packet differ iter ms direct chang number packet correl direct chang number flow packet grow number packet grow vice shown hold flow amount packet flow base analysi exponenti distribut gener individu flow length identifi vector distribut identifi vector approxim typic distribut ip sourc destin address network preval class occupi small portion address space account approxim packet network led normal distribut identifi vector integ paramet fit measur identifi vector flow gener truncat normal distribut integ space simul simplifi problem packet requir constant amount process unit load equal packet assum homogen router equal process full load singl router amount packet ms note amount process unit packet consum vari case prefix lookup tree tree entri locat tree depth simul load distribut requir match trace correspond lookup tabl filter constant set bound evalu adapt trigger carri time interv number link processor simul chosen total system util remain close make investig perform respect accept bound load share figur show effect load share gener load process router equip load share entir load link assign processor compar case load share deploi map load share dynam adapt map figur depict maximum minimum processor util total system util case util packet drop max min processor util ieee time system total min ls min static ls min adapt ls fig processor number packet drop time system total ls static ls adapt ls fig number packet individu processor util remain close vicin total system util load share deploi figur show amount packet drop scenario packet exce processor case close follow total load repres global minimum trace consist identifi vector led balanc distribut traffic processor static case small differ static dynam adapt load share adapt figur show benefit dynam adjust special trace identifi vector pattern result bia processor identifi vector trace gener traffic map processor static worst case static map router load altern section trace weight set trace load process router equip figur depict maximum minimum processor util total system util observ processor util stai close vicin total system util case dynam adapt load oscil util packet drop max min processor util time system total min ls min static ls min adapt ls fig processor number packet drop time system total ls static ls adapt ls fig number packet trace input system case static system figur show amount packet drop scenario packet exce processor adapt case close total load repres global static load share exhibit larg number packet drop overload singl processor target optim figur tabl show number persist flow number flow iter adapt result obtain simul section adjust map possess minimum disrupt small fraction request object persist flow identifi minim amount system bound accept load share determin solv linear optim problem def knowledg flow identifi vector arriv intermedi time interv map time interv unknown def optim map repres term denot unknown optim integ linear program flow ieee persist flow remap persist flow remap flow time fig number persist tabl number persist remap persist remap simul total persist iter flow attempt relax problem bound unknown solut optim interpret probabl map node iter present relax linear optim problem yield solut requir flow show potenti room improv heurist actual amount carri adapt remain close solut vi implement issu router architectur implement router combin distribut router architectur scenario depict figur fig load share distribut router fig consist output memori multipl network share load line card potenti fruit implement shown figur extens concept highli success product network header path separ input output control inform packet header process remot payload temporarili store distribut share memori coupl input switch share load bring util benefit map major implement issu relat load share provid fast comput function comput map properti requir map definit good candid hash function base fibonacci golden ratio multipli present fibonacci hash function lead scrambl sequenc defin φ function fit map scheme φ xor φ valu φ actual comput vector requir basic oper comparison find fibonacci hash comput experi load indic open implement issu measur load processor amount process unit spent time interv good measur number memori access process cycl perform time interv counter period access cp vii futur work scheme share packet process task multipl network processor router ieee scheme base adapt determinist map flow processor scheme requir flow state inform store router map deriv robust hash rout present extend map adapt disciplin aim processor load dynam deriv threshold threshold reflect total system util adapt perform adjust weight reduc amount flow processor handl prove minimum disrupt properti adjust adapt requir small amount flow amount close minim amount shown comparison solut relax linear optim problem probabl packet reorder flow low scheme router input packet requir larg amount process kind statist multiplex incom traffic multipl network processor effect transform router parallel comput improv processor util total router cost power consumpt improv fault toler futur studi plan gain insight traffic pattern influenc perform scheme topic open research influenc load share qo provid router topic investig refer nation laboratori appli network research aix mae west interconnect nasa trace march ip router journal high speed vol pp world wide web trend techniqu ieee commun vol pp taxonomi schedul distribut comput system ieee transact softwar vol pp februari cisco express forward cisco system white leung framework optim cost perform ip router ieee journal select area vol pp june adapt load share homogen distribut system ieee transact softwar vol pp ali lewi task schedul system ieee vol pp decemb cisco edg servic router technolog goldszmidt hunt scale internet servic dynam alloc connect sixth intern symposium integr network pp knuth art comput vol sort search analysi high perform parallel implement ieee confer local comput septemb router architectur differenti servic ieee commun pp kunz influenc workload descript heurist load balanc scheme ieee transact softwar vol pp juli nation laboratori appli network research wan traffic distribut address partridg al fifti ip transact network pp june ross hash rout collect share web cach ieee vol ch internet backbon router evolv internet network white septemb editor schedul load balanc parallel distribut system ieee cs high perform ip router ifip wg workshop protocol high speed map hit rate transact vol pp februari wilder internet traffic pattern characterist ieee vol pp decemb smith adapt load share cluster digit librari server seventh intern symposium high perform distribut pp juli ieee
ML/54 6 approxim nearest neighbor queri revisit timothi chan depart mathemat comput scienc coral fl usa march abstract paper method answer approxim nearest neighbor queri set point euclidean space fix constant data structur log preprocess time log queri time achiev approxim factor variant reduc factor arbitrari data structur log preprocess time log queri time achiev approxim factor applic proxim problem discuss introduct set point site space ir post offic preprocess data structur site closest queri point nearest neighbor found effici distanc measur euclidean metric post offic problem applic comput geometri area data pattern statist voronoi diagram provid optim solut problem log preprocess queri time preprocess method achiev queri base rai shoot requir queri time structur obtain number research turn approxim version post offic site minimum distanc queri point find site distanc time minimum call nearest neighbor number approxim factor constant approxim post offic problem solv optim al structur call balanc tree find approxim nearest neighbor time fix structur construct log time main drawback al method factor hidden notat factor depend paramet held fix actual queri time log worst case preliminari version work proc acm sympo comput page preprocess depend small valu search nearest neighbor method obtain queri approxim method due clarkson base earlier random method arya mount high probabl clarkson queri algorithm requir log preprocess quadrat paramet ae relat ratio distanc farthest pair site distanc closest pair site section obtain strict improv clarkson log queri time obtain log preprocess time space complex log compar clarkson space bound method tree al reduct factor extra log factor queri time log factor remov find closest pair effici low impract high constant factor grow exponenti vari exponenti depend inher al method tradit method base grid al analysi grid method applic vector dimens function circumv exponenti growth demand settl rough approxim post offic problem applic reason metric rough approxim bern interest method find nearest neighbor log time log preprocess time random method find nearest neighbor log queri time high log preprocess time section improv bern techniqu remov exponenti factor complet determinist find nearest neighbor log queri time log preprocess time applic techniqu includ log algorithm approxim euclidean minimum span tree log algorithm find approxim closest pair techniqu yield fast algorithm high major disadvantag solut produc inexact initi draft recent kleinberg indyk motwani al deal avoid exponenti depend smaller approxim factor result paper random data structur find nearest neighbor fix constant queri time polynomi log preprocess time polynomi larg expon depend fine approxim low dimens denot euclidean norm denot norm ir denot euclidean ball fp ir rg point ir denot coordin ir ir denot project point assum dimens fix constant constant notat depend preliminari tree set point site ir tree binari tree node satisfi properti node tree ae ir cell root denot root denot left children intern node disjoint cover assum site li boundari cell cell tree obei cell constant number cell disjoint interior diamet intersect set diamet bound fix constant condit directli al construct tree cell differ box condit consequ pack lemma construct time log lemma ir find node site li base queri algorithm arya mount approxim rang search algorithm nil return diamet return fvg return fv set node return call easi hold show observ intersect diamet point li remain bound run time node expand intersect diamet pack lemma ensur number expand node disjoint interior bound constant cell node level tree disjoint total number expand node constant time depth bound run time number node return data structur set point site ir fix give data structur queri point ir quickli report nearest neighbor site idea number coordin system build tree adopt similar rang obtain dynam data structur approxim nearest neighbor note site li insid narrow cone coordin system show find nearest neighbor restrict cone solv approxim rang search lemma lemma fp ir ffi ffi log preprocess time answer queri ir return site satisfi inequ min fk rg max fk construct tree set fp pg assum site node tree cell sort point set fp coordin augment node arrai store sort list space complex augment tree log tree logarithm depth preprocess time remain log includ sort step point ir find site desir properti algorithm lemma find node project site li defin site minim js found perform binari search sort list node time reduc run time emploi standard attribut intern node tree point pointer successor predecessor sort list preprocess time space constant factor answer queri algorithm perform binari search posit queri point sort list node deduc posit sort list children constant time site remain show inequ hold ffi jp ffi ffi belong js jp js max squar max fk impli set cone angular diamet oe ffi space ir cover cone angular diamet system cone obtain rotat angl yao collect rotat copi cover ir theorem log preprocess time find approxim nearest neighbor queri point ir log time chang coordin replac cone lemma construct data structur cone total preprocess time log answer comput nearest neighbor time al method set observ max fk site return queri algorithm lemma cone site fs ftg closest nearest neighbor queri time log slightli improv time bound set cone techniqu planar voronoi diagram lemma fp ir ffi log preprocess time answer queri ir return site satisfi inequ construct tree set fp pg node tree cell store point set fp voronoi diagram point set space complex augment tree log tree logarithm depth preprocess time log log algorithm construct voronoi diagram reduc preprocess time log construct voronoi diagram planar voronoi diagram transform intersect convex polyhedra comput linear time point ir follow proof lemma algorithm lemma find node project site ffi li defin site minim js js site found perform point locat queri voronoi diagram node optim method planar point comput time satisfi desir properti proof lemma ignor cone angular diamet oe ir cover ir rotat copi lemma impli analogu theorem theorem log preprocess time find nearest neighbor queri point ir log time applic batch applic post offic elimin extra log factor theorem simpl grid scheme place tree fix uniform grid ir grid cell side length creat node grid cell site grid cell node collect fp comput assign point grid floor log time dictionari improv lemma fix lemma ir find site li node grid cell intersect diamet grid cell union grid cell side length time bound dictionari improv theorem weaker type queri involv paramet theorem fix log preprocess time answer queri log ir return site satisfi inequ proof lemma replac tree grid scheme lemma lemma assum model comput perform integ floor avoid oper grid theorem find approxim closest set point point color red closest pair pair ck pair corollari closest pair found log time al data structur comput closest pair log time max fk pair blue point theorem find red point min fk rg min red pair smallest distanc closest pair ir method run log time faster exact method order appli theorem approxim hausdorff distanc point set similar run time rough approxim high dimens assum model comput support integ integ logarithm unit time constant notat depend dimens preliminari balanc standard approach ir base idea box equal size avoid exponenti adopt binari variant perform decomposit box split equal size hyperplan orthogon split hyperplan orthogon suggest box set form integ number call level stage note diamet order build tree balanc lemma due al lemma set ae exist box point set cardin point sort construct time defin sequenc box iter box stage box stage write disjoint union box stage box jp point box smallest index jp exist diamet converg jp jp jp prove exist box proof made construct integ logarithm yield time shown arya al algorithm call balanc point set binari tree node satisfi properti node tree store box leaf store site set site store leav root root denot root denot left children intern node appli lemma tree exist construct log time initi sort phase log time data structur set point site ir approach bern show balanc answer approxim nearest neighbor queri idea set vector fv build balanc translat bern show set find nearest neighbor queri point set log random find approxim nearest neighbor probabl show set carefulli chosen vector suffic yield approxim factor definit ir div mod point ir div div div mod mod mod point ir belong cell div div point cell mod mod observ ir cell belong cell kei lemma lemma ir point ir exist dg cell index dg mod multipli side mod exist distinct indic dg mod mod give data structur answer nearest neighbor queri approxim factor odd replac metric euclidean approxim factor reduc theorem log preprocess time find nearest neighbor queri point ir log time assum set exact nearest neighbor queri point site nearest balanc queri run log time return set algorithm leaf return site vg return return site prove nearest neighbor line statement true leaf intern case assum set line nearest neighbor case assum set line nearest neighbor case level point belong cell observ belong cell impli diamet site set return line nearest neighbor case case argu diamet site found line nearest neighbor conclud return set site nearest neighbor assumpt cell assumpt remov lemma cell dg build balanc point set total preprocess time tree log answer queri point set obtain set log site nearest neighbor return closest point set queri time log applic applic techniqu construct euclidean graph subgraph complet euclidean graph properti shortest path length pair point bound tk number call stretch factor show construct size log stretch factor modifi proof theorem previou algorithm find stretch factor arbitrarili close exponenti depend run time theorem log edg construct log time balanc ae run log time return graph log algorithm leaf return return pg site pair cell prove shortest path length tk case claim induct case claim induct case case proof theorem show diamet path length case similar case conclud path length tk assumpt cell remov assumpt construct balanc lemma union result graph proof diamet graph applic approxim euclidean minimum span tree similar result relat problem euclidean travel salesman tour minimum euclidean steiner tree corollari euclidean span tree weight time weight euclidean minimum span tree construct log time graph theorem construct minimum span tree implement prim log time easi check tree satisfi desir properti applic approxim closest pair section reduc factor run time strategi begin lemma show translat point set half point central grid cell lemma set ae ir point find vector ir point properti cell replac point mod affect condit lemma ensur ae fix dg number div li exist index fi fi div fi fi found time claim vector satisfi desir condit observ rk mod impli div choic point properti half point altern prove lemma pick vector uniformli random straightforward calcul bern reveal probabl fix point greater lemma combin method version approxim problem solut problem binari search lemma ae ir set point color red blue exist pair point sort coordin find pair find vector satisfi condit lemma replac point translat transform affect distanc point ensur point set fp sort order multiset fp div pg sort yield lexicograph order multiset fp div pg time assign point cell time exist cell red point blue distanc found pair pair found belong cell observ solv problem point set run time bound theorem closest pair found log time set dn real number form coordin point distanc closest problem find call procedur determin paramet call suffici binari search precomput cartesian differ time standard techniqu bring quadrat overhead log implicit binari search perform repeat effici implement lemma procedur successfulli find pair decid call unsuccess find tent assum add return pair set call find tent call yield pair made mistak successfulli find pair closest return pair smallest distanc set implement run time algorithm log mention implement dictionari point high dimens toler small error set point ir point distanc ffi find point distanc queri assum toler ffi simpl solut problem uniform locat cell queri point examin neighbor grid cell number reduc remov exponenti depend observ ffi cell neighbor cell explor central assumpt enforc translat lemma simpl data structur insert delet point easili handl examin wai reduc previou approach approxim nearest neighbor queri set point fix dimens approxim factor obtain constant dimens suffici larg approxim obtain constant polynomi dimens time space bound method optim term open problem low dimens reduc space queri time reduc space complex linear theorem interest problem deriv result section algebra oper integ refer euclidean minimum span tree closest pair discret comput agarw rai shoot parametr search siam euclidean proc acm sympo theori page arya mount approxim nearest neighbor queri fix dimens proc sympo discret page arya mount approxim rang search proc acm sympo comput page wu optim algorithm approxim nearest neighbor search proc sympo discret page account boundari effect nearest neighbor search discret comput bern approxim queri high dimens inform process faster algorithm geometr graph problem higher dimens proc sympo discret page chazel optim algorithm intersect convex polyhedra siam comput clarkson algorithm approxim queri proc acm sympo comput page cole slow sort network obtain faster sort algorithm indyk motwani approxim nearest remov proc acm sympo theori johnson mizoguchi select kth element siam techniqu exact approxim dynam problem siam kleinberg algorithm search high dimens proc acm sympo theori page effici search approxim nearest neighbor high space proc acm sympo theori sequenti parallel algorithm closest pair problem int comput geom rai shoot convex polytop discret comput preparata comput introduct construct applic minimum span tree proc acm sympo comput page graph good complet graph point dimens discret comput yao construct minimum span tree space relat problem siam
DB/55 3 geometr framework spatiotempor object jan chomicki peter revesz dept comput scienc dept comput scienc engin west long nj ne usa usa abstract present framework spatiotempor object spatial tempor geometr transform defin number class spatiotempor object studi closur properti introduct natur phenomena spatial tempor extent forest fire properti histori citi store inform phenomena data model construct claim spatiotempor introduc gener framework spatiotempor object defin spatiotempor object spatial tempor continu geometr transform parametr determin imag spatial object time instant belong tempor object number class spatiotempor object natur provid preliminari studi closur respect oper appli oper spatiotempor scenario spatial object repres extent safe area ship account movement extent contact author safe area period time repres spatiotempor object avoid determin intersect object substanti literatur spatial tempor provid guidanc deal spatiotempor phenomena spatial deal spatial object rectangl tempor tempor combin handl discret chang continu requir applic deal phenomena natur growth urban area tempor spatial aspect conveni separ basic notion object definit spatial object dimens subset tempor object subset assum singl tempor spatiotempor object dimens subset definit gener studi restrict class spatial tempor object import practic point view simpl class identifi spatial tempor research clear spatiotempor object repres geometr approach present postul spatiotempor object defin spatial object continu transform produc imag object time instant definit atom geometr object dimens quadrupl ffl spatial call refer spatial object ffl time call refer time ffl subset call time domain ffl function call transform function semant spatiotempor object defin notic transform function defin time rel refer time refer time neg transform function satisfi ffl mean snapshot spatiotempor object time equal refer refer spatial object ffl function continu definit molecular geometr object dimens finit set atom geometr object dimens time domain disjoint class geometr object special class geometr object defin restrict refer spatial time transform function notat refer class atom geometr object refer spatial object belong class spatial time domain class subset transform function class function denot refer class molecular geometr object consist atom object class finit union molecular object paper fix number spatial dimens interv rect side parallel polygon choic mat class transform function defin pair matrix element function displac obtain substitut special mat subclass obtain fix class function mat rat function quotient mat poli mat lin subclass mat form correspond similarli mat defin subclass sc rat sc poli sc lin tran subclass sc defin pair diagon matrix correspond translat tran rat tran poli tran lin id subclass tran vector repres kind continu shrink discret chang model adequ model molecular spatiotempor object separ atom spatiotempor repres incarn simplifi notat write tempor interv molecular object exampl object move rectangl refer time rectangl corner corner unit time rectangl move left speed unit unit time object repres quadrupl set point transform function matrix displac vector object move rectangl refer time rectangl corner corner unit time move left speed unit unit time object repres quadrupl set point transform function matrix displac vector figur show snapshot black grai fill area repres intersect intersect repres object quadrupl set point transform function matrix displac vector function sc lin transform function intersect sc lin object object repres gener geometr transform scale repres intersect figur snapshot closur closur oper set essenti spatiotempor object usabl context queri languag intersect requir spatiotempor notic spatial tempor object consid separ close challeng space time singl spatiotempor object result appli oper spatiotempor object class fail object class essenti determin smallest class result studi kind posit neg posit show appli oper object class result object class close neg show object class result oper appli object object class close show exampl posit neg result work remain closur complet class spatiotempor object start formul framework result worboi worboi framework capabl repres discret chang theorem close union set differ result deal class spatiotempor object repres continu chang theorem sc lin close differ obviou set rectangular object close oper arbitrari rectangular object close oper assum sc lin object repres quadrupl set point transform function matrix ff fl ff fl displac vector fi ffi fi ffi assum sc lin object similar paramet repres superscript intersect repres object quadrupl set point intersect intersect transform function matrix ff fl ff fl displac vector fi ffi fi ffi defin fl ffi fl ffi fl ffi fl ffi interv project spatiotempor object axi time superscript mean left end point interv mean length interv assum refer time object chang find refer time condit hold pair object intersect defin paramet ff fl fi ff ffi fl theorem sc lin close intersect differ spatiotempor object triangl vertic matrix displac spatiotempor object triangl vertic matrix displac vector intersect triangl triangl vertic easi intersect repres spatiotempor object object triangl vertic object triangl vertic clear express scale sc rat close spatiotempor data model queri languag topic grow interest paper mention section present model author talk move point region formal defin approach continu movement growth model linear interpol function author formal spatiotempor data model base constraint discret chang model queri languag present spatiotempor data model base polygon vertic defin linear function time model capabl model continu chang relationship framework present paper explor discret continu chang repres constraint compar approach amen implement standard techniqu implement spatiotempor suffici repres ffl spatial object solv problem class ffl tempor object solv ffl function object knowledg dbm technolog make feasibl earliest postgr store function tupl compon approach potenti gener constraint move ration function basic repres rotat model easi obtain snapshot spatiotempor make task anim straightforward constraint geometr snapshot explicitli construct constraint refer chomicki revesz spatiotempor intern symposium larg spatial page juli lnc rh vazirgianni spatiotempor data approach model queri move object acm symposium geograph inform novemb data handl constraint acm symposium geograph inform novemb revesz constraint queri languag journal comput system august stonebrak postgr manag system commun octob editor tempor implement benjamin worboi unifi model spatial tempor inform comput michael worboi comput perspect
DB/56 3 tool intellig integr inform beneventano bergamaschi universita di modena reggio emilia bologna dsi modena bologna abstract integr design support tool automat integr heterogen sourc schemata object implement momi project carri integr semant approach intellig descript cluster techniqu extend odl repres integr inform start sourc odl descript support design creation integr view sourc express odl languag tool build virtual catalog environ introduct year access distribut inform problem integr data heterogen sourc import compani equip data store system build inform system data relat heterogen substanti web internet intranet enlarg share retriev inform locat sourc obtain integr view elimin contradict redund problem face field due structur applic lack common semant differ inform sourc semant differ kind rang simpl contradict sourc structur conflict repres integr problem relev environ electron catalog kei compon ecommerc organ individu compani catalog particip framework user point import uniform interfac search uniform view data compani catalog uniqu queri languag compani point view import uniqu catalog particip framework virtual synthet approach conceiv instrument dynam retriev inform multipl catalog present product data unifi directli store product data catalog interact multipl heterogen interact uniform virtual catalog work design support tool inform integr structur sourc develop momi system tool suitabl instrument build virtual catalog environ momi project environ multipl inform aim integr data structur data sourc design support tool integr heterogen sourc schema object implement momi project carri integr semant approach intellig descript cluster techniqu extend languag repres extract integr odl start odl descript support design creation integr view sourc express odl languag global schema obtain creat common thesauru intra relationship sourc integr odl languag infer relationship extract share common thesauru research partial fund italian murst project la di su internet intranet initi phase common thesauru enrich obtain ffl lexic wordnet identifi affin concept basi denomin ffl artemi evalu structur affin concept start obtain common thesauru infer artemi cluster global schema gener view integr sourc obtain work describ support design construct common thesauru global schema comparison paper introduc sequenc global schema construct phase full descript interact wordnet work structur section momi architectur introduc refer section common thesauru global schema construct remark report section momi architectur momi design suppli integr access heterogen inform store tradit object file data sourc architectur engin odl interfac wrapper wrapper wrapper global schema builder queri manag mediat artemi file system figur momi architectur repres interfac modul mediat local data sourc function doubl ffl integr translat descript inform held sourc descript suppli odl ffl queri process translat queri receiv mediat common queri oql deriv oql queri express sourc queri languag wrapper export queri result provid mediat data common model system core modul separ ffl global schema builder modul gener global schema provid start sourc descript express odl ffl queri manag queri manag modul gener oql languag queri wrapper start queri pose user global schema qm automat gener translat queri set sourc framework graphic interfac support design integr process descript logic base tool perform schema valid queri optim cluster tool perform odl class analysi cluster architectur sourc integr base individu ontolog share ontolog repres set terminolog relationship call common thesauru shown fig ffl sim integr extract relationship start object semistructur sourc modul perform relationship infer relationship exploit capabl ffl slim lexic integr extract relationship attribut odl class exploit wordnet lexic system fig design graphic interfac interact slim artemi modul show extract relationship common thesauru construct thesauru common artemi sourc schemata wordnet relationship relationship sourc design builder global schema map tabl global schema cluster infer relationship sim integr modul integr modul sourc slim infer relationship relationship figur global schema builder architectur common artemi modul evalu set structur similar class cluster global class view similar class belong set global attribut automat gener set global attribut global class map tabl map global attribut local attribut class cluster interact design design set global attribut map assign global achiev global schema integr process divid gener common gener global schema figur architectur eat datasourc address menlo park green park address phone categori china chicken nearbi address specialti categori spaghetti armi street italian mcdonald owner specialti john smith green street owner phone big bar park avenu york street citi zipcod address manag figur eat sourc run order illustr approach integr restaur guid domain datasourc store inform restaur eat sourc guidebook semistructur object restaur west coast illustr portion model literatur semistructur inform sourc semistructur sourc repres label graph node data imag label edg describ concept repres data node figur root object complex children object repres restaur restaur atom categori specialti restaur atom address complex complex object specifi nearest address job restaur owner deriv explicitli repres schema inform introduc notion object pattern develop wrapper extract xml file odl descript food guid relat inform usa restaur wide varieti public newspap region schema sourc relat figur inform relat restaur maintain restaur relat instanc subset restaur instanc give inform small inform restaur serv wine restaur manag person inform place drink serv store relat food guid zip special tourist menu figur food guid odl languag semant rich sourc schema object pattern inform introduc call odl recommend odmg object data model odl close odl languag odl sourc independ languag inform extract describ heterogen schema structur semistructur data sourc common odl introduc main extens respect union constructor union denot introduc express altern data structur definit odl captur requir semistructur data option constructor option constructor introduc class attribut attribut option instanc constructor introduc captur requir semistructur data integr constraint rule kind rule introduc odl order declar integr constraint rule level relationship terminolog relationship express knowledg sourc schema relationship defin class call term relationship odl ffl syn defin term consid synonym consid sourc sourc denot ffl bt defin term gener mean bt relationship symmetr opposit bt nt ffl rt posit defin term gener context consid sourc relationship terminolog implic structur involv class relationship relationship bt nt class establish relationship relationship defin odl ffl syn ext mean instanc ffl bt ext mean instanc superset instanc ffl nt ext mean instanc subset instanc relationship structur class nt ext semant relationship ffl relationship nt ext relationship isa relationship nt ffl relationship bt ext relationship isa relationship bt ffl relationship syn ext relationship isa isa relationship syn map rule kind rule introduc odl order express relationship hold integr odl schema descript inform sourc odl schema descript origin sourc extract process translat object pattern sourc schema odl descript shown translat perform wrapper report odl food object pattern relat complet odl schema ed fd sourc report appendix interfac sourc semistructur attribut string attribut address attribut integ attribut set attribut string attribut attribut integ attribut owner interfac sourc relat kei refer person attribut string attribut string attribut string attribut string attribut integ attribut string attribut integ attribut integ gener common thesauru common thesauru set terminolog describ knowledg class attribut sourc refer base identif class candid integr subsequ deriv global common express knowledg form terminolog relationship relationship ext bt ext nt ext class attribut common thesauru construct increment process relationship ad terminolog relationship hold level relationship extract sim modul analyz odl schema separ rt relationship extract specif foreign kei relat sourc schema foreign kei primari kei origin referenc relationship extract restaur class odl descript report appendix bt terminolog relationship hold schema level extract slim modul analyz sourc odl schema section examin extract main contribut paper wrt previou paper momi terminolog relationship suppli directli captur specif domain knowledg sourc schema crucial relationship forc belong common thesauru gener global integr schema mean wrong relationship subsequ integr process produc wrong global schema system design detect wrong relationship perform relationship valid step infer terminolog hold infer exploit infer capabl relationship ad common thesauru consid subsequ phase construct global schema detail descript process terminolog relationship defin step hold level definit step design terminolog relationship bt nt class establish hold defin relationship specif impli insert relationship common thesauru enabl subsumpt comput infer consist check class relationship extract relationship base lexic relat hold class attribut deriv mine word kind knowledg base rule data definit languag deriv assign design design task assign correctli interpret interpret uncertainti inher languag bate write probabl person term describ thing knowledg schema opportun exploit extract relationship imposs carri task manual number dimens schema decid experi wordnet lexic system extract design relationship wordnet wordnet lexic develop princeton cognit scienc laboratori wordnet inspir current psycholinguist human lexic memori connect theori regard import research resourc field comput textual analysi relat area lexic wordnet current version lemma organ synonym set start point lexic semant exist convent associ word form pronounc associ give rise properti express word synonym group synset note synset exist synset synset set properti singl word mean correspond word form mean call lexic matrix word mean report row row repres column repres word form matrix element base form mean refer address person organ refer comput address informat sphere base form mean element element matrix null indefinit row row indic word null element repres element column base base form column index semant relationship schema term concept term associ definit class attribut term form class attribut definit class attribut qualifi class qualifi sourc schema class attribut qualifi class belong class attribut set set word relat synset defin wordnet start point defin semant relat word relat obtain wordnet singl word synset context relat correl relat hypernymi set relat synset fs synset set relat function oe insert give synset set synset fs hs synset set defin basi lexic set word synset ft obtain relat word relat exist synset word set word set relat word defin rt relat deriv semant relat insert common thesauru synonymi correspond syn relat hypernymi correspond bt relat correspond rt relat correl correspond rt relat basi algorithm develop input term relat schemata output detect semant input ft jt ng output algorithm present develop slim start schema design fix set word chosen choic involv base form choic design support choic system base form wordnet morpholog processor figur select address obtain address base form morpholog processor base form ambigu design directli introduc mean choic design relat mean choic relat mean made concept complex express word special belong gener relat substitut doesnt add knowledg id tabl foreign relat extract relat schema structur id design support tool hypernymi hierarchi figur show hypernymi hierarchi mean select similar correl relat link synset share ax base form ax axi ax figur address mean design select mean found wordnet start base form chosen step word relat share base form figur mean wordnet relat address base form obtain select word address obtain suitabl examin context shown heat nt food heat nt food nt eat nt food heat rt eat note relationship strang true context resolv mean ambigu coupl mean suppli wordnet concept sourc design choic coupl mean syntact categori verb adject adverb figur approach reduc complex design problem find relat divid term mean list practic word work time read remain occupi choic similar mean speed part select coupl mean figur symbol denot mean chosen design address show gener hierarchi mean order design difficult choic figur case inherit district inherit refer administr select end show relationship deriv wordnet figur design delet show relationship add set relationship satisfi select cluster implicitli save set relationship common thesauru figur slim hypernymi hierarchi street figur slim hypernymi hierarchi citi figur relationship extract slim gener global class common thesauru gener global class activ carri affin cluster gener global attribut work interfac artemi modul design interact artemi satisfi set obtain cluster tool global class set global attribut suppli design interfac global attribut set tool design interfac assign global class detail descript phase cluster gener identifi odl class affin consid sourc artemi hierarch cluster classifi class group level form tree ffl leav repres local adjac leav repres class high leav repres class low ffl node repres cluster level affin coeffici join insert threshold artemi build cluster made class belong root node coeffici higher threshold figur show local class tree cluster artemi identifi threshold room section student professor depart cl cl cl cl locat cl figur affin cluster oe gener global attribut map tabl creat set global attribut determin correspond local attribut class belong cluster global class correspond uniqu case tool identifi kind correspond solv case tool design tool build global attribut set cluster union attribut class belong cluster fusion attribut union class attribut consist mere collect class attribut singl set attribut set redund set phase elimin redund relationship common thesauru fusion process automat attribut valid relationship automat relationship valid oper ffl attribut valid relationship attribut fusion attribut connect syn relationship connect global domain local attribut chosen design explicitli introduc attribut connect nt relationship treat substitut global attribut domain gener attribut attribut connect nt bt special attribut repres global attribut ffl attribut valid relationship common thesauru relationship pass valid belong automat find global attribut limit set design add global attribut complet integr automat individu global attribut perform attribut relationship link syn bt relat class belong repres aggreg hierarchi attribut foreign food place code zone null coast code coast code null coast code coast figur food place global attribut set design extend repres local sourc case occur inform store local sourc metadata creat global build figur mt tabl cl repres set local class belong cluster refer ag repres global attribut set built local global attribut al local element mt tabl assum al ad global attribut refer inform store al local attribut global attribut reflect homonym attribut local special relationship link attribut belong class code global attribut refer code local attribut local class code attribut local al al al attribut repres link valu assum set attribut belong local class global attribut cl global class repres link class local attribut food local class correspond global attribut state valu attribut consid valu class consid case al cost al cost al cost cost constant situat occur global attribut assum set al local attribut belong class choic pass class al act selector case global attribut doesnt refer local class attribut set design mean set global attribut zone global attribut food place global coast constant access local class coast constant access local class null case global access local class doesnt code global food place global doesnt assum local class creat set global class global class design interfac complet view global class includ class set map tabl edit odl descript global schema obtain global class food place figur map tabl figur obtain global class user pose queri restaur respect disregard origin sourc schemata paper support tool integr heterogen data sourc introduc interfac food place attribut map rule attribut categori map rule attribut specialti map rule attribut address map rule code attribut price map rule menu attribut zone map rule figur food place global class specif odl tool work momi develop modena reggio emilia work slim compon implement perform interact wordnet order automat extract relationship direct interact slim effect aid design high number relationship suggest wordnet valid context consid sourc interact implement satisfactori level repres real aid activ good candid tool build virtual catalog environ appli develop virtual catalog car involv catalog refer sartori consist check complex object schemata integr constraint ieee transact knowledg data sartori semant queri optim subsumpt oodb flexibl queri answer volum issn vincini tool semant queri optim oodb int confer data engin vincini semant integr semistructur structur data sourc sigmod march vincini semant integr queri heterogen inform special issu data knowledg engin intellig inform integr preliminari version paper workshop intellig inform integr juli inform momi project proc int conf larg data base bergamaschi nebel acquisit valid complex object schemata support multipl inherit journal appli buneman semistructur data proc symposium principl system page castano de antonelli deriv global conceptu view multipl inform sourc symposium conceptu histor perspect futur catarci lenzerini repres interschema knowledg cooper inform system journal intellig cooper inform cattel editor object data odmg morgan kaufmann san everitt project educ book social scienc research eurowordnet multilingu semant proc spring symposium text speech hull king al arpa refer bate subject access onlin design model journal american societi inform arthur smart catalog virtual intern confer frontier electron octob earlier version usenix workshop electron juli version ag miller lexic english commun momi staff momi environ multipl inform project part project staff project object exchang heterogen inform sourc proc odl sourc descript interfac sourc semistructur attribut string attribut address attribut integ attribut set attribut string attribut restaur attribut integ attribut owner interfac address sourc semistructur attribut string attribut string attribut string union interfac owner sourc semistructur attribut string attribut address attribut string interfac restaur sourc relat kei refer person attribut string attribut string attribut string attribut string attribut integ attribut string attribut integ attribut integ interfac person sourc relat kei attribut integ attribut string attribut string attribut integ interfac sourc relat kei refer refer attribut string attribut set attribut integ interfac sourc relat kei attribut string attribut string attribut string
IR/57 5 learn jose john fisher iii abstract chapter seek extend ubiquit error criterion cost function includ inform train data learn process ultim transfer inform carri data sampl natur goal find cost function directli manipul inform theoret learn order itl independ learn machin requir sole avail requir priori assumpt data distribut chapter present current effort develop itl criteria base integr nonparametr densiti estim quadrat entropi definit motiv start applic mse manipul mation nonlinear characterist learn machin section illustr issu face attempt inform criterion introduc entropi formul show produc criterion relat inform potenti field creat interact pair sampl output learn machin criterion minim maxim mutual inform base diverg measur criterion engin applic convent distinct learn train learn machin mutual inform step ultim goal design train learn machin itl solv blind sourc separ problem tion filter problem pose estim classif synthet apertur radar cation introduct chapter address import issu extract inform directli core issu learn exampl biolog artifici system learn exampl scenario start data set global convei inform goal captur inform paramet learn machin inform exist mode data paramet learn machin success train learn artifici neural network adapt filter correl norm squar criterion compar inform carri signal learn mount evid correl order poor measur ascertain inform desir output mapper fundament issu find methodolog studi elucid issu design system capabl produc transfer inform effici util inform theori mathemat approach deal manipul inform shannon classic paper laid foundat tremend impact design cient reliabl commun system answer kei code maxim amount tion transfer channel spite practic deep mathemat theori concern essenc commun process impact statist statist mechan provid clearer understand natur entropi illustr jayn advanc predic specif data realist design learn machin design primari object develop algorithm learn relationship interest basi input pattern submit thrust innov develop method directli estim entropi set data entrop util full probabl densiti function optim lift present restrict linear gaussian applic world problem achiev goal introduc approach estim entropi discret set data method manipul mutual tion chapter develop criteria train directli sampl linear nonlinear mapper entropi mutual inform maxim minim start review entropi descript theoret learn window method pdf estim fundament effort creat algorithm manipul entropi develop integr squar error criterion indirectli estim entropi output mapper local interact output present comparison applic entropi maxim blind sourc separ section cover principl approach design practic criteria definit entropi order show quadrat entropi easili integr dow estim lead interact model similar data action comput entropi interpret inform potenti field power analog inform theoret learn physic final integr distanc euclidean differ window provid estim mutual inform mutual inform criterion gener learn framework applic algorithm pose mation final train perceptron layer power itl gener definit entropi entropi inform theori mathemat formal intuit notion inform tain messag messag perfectli inform content predict messag larger inform content axiomat approach defin entropi probabl distribut averag amount inform singl observ random variabl valu probabl entropi measur averag amount inform convei event amount ing inform priori distribut inform theori wide appli design commun system definit entropi deriv abstract form gener theori mean real number xn posit weight necessarili pn arbitrari continu strictli monoton function defin real number entropi measur obei ϕ ϕ ip inform measur order inform ip pk ϕ arbitrari inform meet addit ϕ entropi entropi order α obtain denot relat import relat entropi probabl distribut point space due condit probabl measur pk li quadrant hyperplan dimens intersect axi coordin distanc origin α root α root α call probabl distribut entropi written function α α α pk α α α hs α β lim α α α pk α α valu α select end result select norm shannon entropi consid limit case α probabl tion norm notic limit indeterminaci result exist entropi entropi monoton function α pdf essenti monoton function distanc probabl distribut origin freedom α log pk call quadrat entropi due quadrat form correspond probabl distribut continu random variabl pdf obtain differenti version entropi similar rout shannon differenti entropi note quadrat entropi involv squar pdf import observ altern definit entropi entropi goal entropi maxim figur geometr interpret entropi distanc origin relat entropi larg class altern entropi definit call gener entropi measur interest measur complex entropi direct diverg call provid overview import question reader refer entropi optim literatur studi reason α α gener measur entropi stem practic aspect model real world entropi optim algorithm found appli basic optim principl base entropi definit maximum entropi principl minimum principl solut spectrum solut solut found improv research altern definit entropi gener entropi measur digit signal process arena entropi estim successfulli appli spectral analysi studi learn interest gener entropi measur practic difficulti directli estim entropi data ing assumpt pdf definit entropi sum term weight logarithm amen simpl estim logarithm sum power probabl easier util physic show section effect algorithm deriv entropi util successfulli nonlinear dynam estim relat dimens attractor import question stem gener entropi measur justif select measur address question research point state result obtain entropi estim extens mutual inform produc practic solut difficult problem signal process pattern recognit ing exampl choic gener entropi measur plai import role qualiti final solut inform optim principl common entropi optim principl find distribut maxim entropi subject explicit constraint make assumpt miss inform find distribut satisfi minim distanc probabl space distribut wide measur measur direct diverg unknown distribut direct diverg relax concept distanc symmetr obei angular turn respect form target distribut principl constraint maxim uncertainti direct diverg pdf invari coordin mation advantag hold characterist continu case learn parametr map random vector ℜ ℜ equat random vector set paramet observ xi random vector parametr mapper respond goal paramet map figur merit base inform theori output space mapper call ing notic requir avail observ random vector assum priori model probabl densiti function notic mapper linear criterion exploit extern input call desir inform theoret learn includ special case framework learn criterion extern independ mapper briefli review work area ℜ analog optim euclidean adapt paramet mapper manipul output distribut maxim output entropi minim output output signal work bell sejnowski blind sourc separ applic gw bp algorithm map network principl neural network work barlow entropi concept learn ε optim base principl potenti solv engin learn problem comon amari util principl formul solv demonstr previou chapter solut obtain minim mutual inform output mapper formul diverg joint pdf factor margin hy problem estim joint output densiti research util result linear network directli comput output entropi input entropi log wx note full rank linear map requir approach sever straint learn applic instanc map requir step estim margin entropi output comon pdf amari method estim pdf moment method truncat sourc higher order moment pdf estim inform theoret criterion figur train mapper itl tional requir larg amount data robust result pdf gradient base algorithm formul solv problem method appeal point view learn notic gener criterion total independ topolog mapper amari model neural network literatur inform optim principl maximum inform preserv special case mation loss minim principl optim mutual inform extens address optim literatur interest find principl biolog system system issu find criterion adapt paramet mapper goal determin paramet output variabl convei inform principl maxim averag mutual inform presenc linear network gaussian mutual inform maxim maxim output varianc recal tion output varianc basic princip compon analysi local algorithm biolog network organ principl method lead interest solut depend restrict assumpt pdf linear map fact state big challeng extend work arbitrari distribut nonlinear network accomplish work theoret principl maxim diverg measur appli input output determinist principl reduc appli output mapper appli pair random output mapper extern random variabl applic call inform design mapper preserv inform maxim sourc attenu inform input data inform ing exploit chapter learn applic difficulti criteria analyt solut restrict gaussian linear volum preserv map mathemat approxim complex algorithm result neurocomput algorithm appli util data directli basi simpl learn rule distil submit algorithm train nonlinear mapper criterion respect bell algorithm maxim output entropi paradigmat util nonlinear mapper restrict adapt weight simpl batch rule specif input data model solut global lead solut maxim entrop measur show local rule requir extend perceptron connect spirit neural comput seek fundament issu applic criteria neurocomput adapt filter choic criterion quantit measur estim probabl densiti function data sampl learn integr squar error obstacl criteria mutual entropi discret random variabl base shannon definit weight sum rithm pdf integr function logarithm probabl densiti continu random work directli pdf assumpt made reli nonparametr estim densiti estim problem nonparametr densiti estim space approach reli estim output space nonlinear control eral manag problem output dimens number sourc mix window method work estim estim ˆ random vector ℜ vector observ random vector kernel function ℜ satisfi properti pdf window view convolut estim kernel observ symmetr gaussian kernel covari matrix σ requir differenti choic gaussian exist viola estim sampl approxim approxim effici estim interest adapt simpli evalu measur base entropi ˆ σ σ entropi manipul integr squar error nonlinear mapper perceptron mlp output tanh nonlinear function output output entropi maxim output uniformli distribut problem entropi maxim solv compar desir uniform distribut estim output pdf ˆ point set observ metric preserv tradit framework learn util integr squar error pdf actual output estim nonparametr window uniform pdf criterion entropi ˆ dz ˆ estim pdf window method uniform pdf region compon min max output sampl correspond input xi basic applic principl discuss section mse proxi diverg output pdf uniform distribut practic evalu integr sampl squar domain uniformli tribut spatial locat ℜ transform integr sum extern criterion gradient method chain rule minim partial deriv respect gener weight ˆ ˆ ˆ number train ε ˆ ˆ comput error distribut estim output distribut desir uniform distribut wx map sensit exclud map remain term combin comput error train sampl note adapt mlp extern desir error deriv global properti output sampl chain rule map sensit comput algorithm method integr seamlessli main stream neurocomput algorithm gener discuss approach present fisher straightforward approach numer approxim comput error pdf requir evalu error term suffici number point output space comput complex algorithm proport dimens output space number sampl train set fundament comput tion subspac map argu numer method chosen comput shannon entropi definit directli numer approxim advantag lead major cation comput show comput criterion local interact model examin gradient criterion result reduct lead local algorithm bypass necess approxim integr numer basic idea search method comput error data perform comput larg densiti point output space analyt form local kernel extend sampl interact output space note kernel function ε yi yi lead ˆ yi oper directli integr definit deriv respect gener weight mapper expand error yield mean convolut oper repres locat train ple output space evalu ˆ ˆ ˆ yi xi ε ε ε yi ˆ yi yi yi yi yi term term attractor kernel topolog regul overcom fundament limit impli term comput analyt gaussian kernel uniform effect comput estim pdf full space perform calcul sampl locat analyt form local kernel tional complex order quadrat number exemplar reduc complex interpret interest form comput error analyt form gaussian kernel diagon uniform distribut tive π σ exp π σ dimens σ width extent sion uniform σ gaussian kernel evalu standard deviat exp dx error function case symmetri gaussian zi σ σ zn σ zn σ σ gi zi σ function shown case fig figur repres influenc observ local fr repres influenc sampl boundari region support figur attractor function shown top shown bottom function repres local influenc data point output space figur regul function shown top shown estim entropi model local interact zi sampl output interact boundari function form interact dictat show maxim distribut error kernel act local attractor comput pdf error local pdf error neg minim entropi sign interact opposit observ fig understand behavior ter dimens figur show multimod pdf input data uniform distribut assum maxim entropi fig show error comput attractor kernel domain region origin pdf error direct region input pdf attractor kernel concentr achiev uniform distribut converg fig show entropi minim behavior algorithm creat concentr sampl peak input pdf figur mixtur gaussian estim distribut mixtur desir distribut uniform kernel convolv differ distribut shown dot line error direct shown point domain case entropi depict case minim entropi similar interpret present topolog regul kernel notic kernel forc sampl rang sigmoid evalu omit chang appreci form interact conclud function attractor kernel model interact data point function topolog regul term model interact data constraint desir output distribut creat learn algorithm aspect address creat practic algorithm converg algorithm stop criterion intim relat kernel size algorithm converg main implic previou discuss cost function lead manipul global properti output data process local attract sampl kernel error influenc round sampl unlik learn desir error system approach desir shape influenc function size interact sampl control error size verifi case fast adapt learn rate close algorithm tend oscil difficulti conquer local normal kernel start case minim entropi attract singl point work attract function kernel proport σ error point center scale appropri oscil center kernel occur influenc sampl model addit order net attract converg normal gradient center attractor kernel uniti slope origin normal factor gaussian kernel space radial symmetr π σ stabl converg function output space size lead question set kernel size kernel size famili densiti context entropi maxim principl approach σ densiti minimum find entropi direct iter kernel size achiev minimum entropi maxim likelihood observ function score yj ˆ yj yj set data uj subset point estim ˆ line fact radial symmetr gaussian kernel σ optim root σ σ inspect set uj data point yj optim σ condit occur model due interact gener requir numer number fast techniqu find σ line impli approach maxim entropi consequ approach kernel size directli stop kernel size reach maximum entropi reach practic set threshold σ σ yj yj yi σ uj yi uj ˆ yj yi σ uj uj ˆ yj yi σ uj yi σ uj applic algorithm show applic algorithm toi problem real world data goal section show algorithm practic ing result maximum pca comparison illustr differ princip compon analysi approach featur extract driven approach implement algorithm begin simpl case gaussian distribut distribut covari matrix contour plot distribut shown fig imag princip compon vector figur princip compon li draw set observ distribut comput map mlp entropi maxim criterion previou section architectur mlp indic input hidden output node nonlinear hyperbol tangent function nonlinearli map input space output space plot fig show imag maximum entropi map input space contour map maximum entropi map li essenti direct princip compon result expect illustr gaussian assumpt support maximum entropi pca result report research conduct experi illustr differ draw observ random sourc underli distribut gaussian specif pdf mixtur gaussian mode form σ fx xm xm gaussian distribut covari σ specif case shown princip compon distribut eigenvector matrix figur pca entropi gaussian case imag pca featur shown contour entropi map shown contour distribut shown left panel fig princip compon vector map panel fig show imag maximum entropi map network distinct differ map pca result observ map nonlinear observ maximum entropi map tune structur data input space experi illustr differ pca entropi map pca primarili concern direct find sensit statist underli entropi explor structur data class limit order statist suffici describ eral note train mlp algorithm figur pca entropi case imag pca featur shown contour entropi map shown contour maximum entropi map present result maximum entropi featur extractor synthet apertur data map ture experi perceptron singl hidden layer input hidden output network extract featur sequenc imag obtain vehicl vehicl slowli rotat aspect increment exampl imageri shown fig network train maximum entropi find project produc largest entropi output project produc result gener intuit notic case imag ing set vehicl variabl train set creat vari aspect angl vehicl conjectur project maxim output entropi relat aspect angl sourc uncertainti train imag train maximum entropi featur extractor singl vehicl row fig test map vehicl figur imag vehicl experi vehicl rotat aspect rang top bottom row train test set show mlp output ax space fig train input imag sequenti present output connect line output begin train map concentr limit region output space plot clear output mlp extract begun fill output space expect maximum entropi criterion maintain aspect depend origin imag adjac input map adjac output evid method statist independ output tune underli geometr structur input space rotat vehicl aspect independ test set produc similar output train aspect angl input vehicl map specif region output maximum entropi map fact extract featur variabl train set imag aspect evid map maintain topolog neighborhood similar fashion kohonen map differ approach som approach case map som input space map discret lattic relationship maximum entropi figur singl vehicl iter project train test imag featur space figur singl vehicl iter project train test imag featur space adjac aspect angl connect line map approach som topic left research blind sourc separ blind sourc separ formul observ data linear mixtur independ sourc nal inform sourc mix denomin problem find project wx permut scale experi compar algorithm bell method previou separ instantan linear mixtur sourc set experi illustr compar sensit method sourc distribut small sampl size figur singl vehicl iter project train test imag featur space separ sourc separ sourc distribut experi conduct mont carlo run mix matric nalli condit mix matric independ trial initi estim mix matrix ident matrix sourc unit varianc initi ratio db sourc sourc ou combin logist uniform densiti rel logist densiti logist cdf linear experi maximum entropi achiev fig show densiti distribut updat weight neural network window data sampl util updat weight sampl delai autocorrel function window minim relat sampl detail experi found trial bel method sampl draw direct trial comparison method iter coeffici separ matrix estim norm chang number sampl trial set experi sampl drawn sourc distribut repeat distribut type tabl summar show approach perform bel number trial method recov sourc higher snr bel number trial bel similarli perform local interact approach snr lowest snr sourc method trial measur bel bel recov sourc trial greater db entri snr differ singl recov sourc trial approach versu bel trial bel fail recov sourc greater db entri snr bel recov sourc snr method trial bel recov sourc greater db laplac case method compar bel approach perform slightli trial bel recov sourc higher snr versu outperform bel exhibit sourc separ distribut type bel fail uniform sourc densiti point bell sejnowski paper encourag suffer shortcom experi case sourc ian distribut set draw distribut sourc outperform bel trial superior job separ laplac sourc light experi perform conclud addit singl sourc significantli attribut small number sampl warrant tabl perform separ independ sourc distribut laplac logist uniform sourc bel sourc differ vl bel differ nm tabl perform separ independ sourc mix distribut sourc mix bel sourc sourc bel sourc laplac logist uniform min snr differ bel differ select integr squar error theoret arbitrari fact method yield practic method entropi maxim minim work princip fisher account literatur mapper entropi estim directli exampl direct estim entropi mutual inform exampl definit entropi figur densiti cdf case uniform logist inform theoret learn quadrat entropi itl algorithm base combin nonparametr pdf estim procedur comput entropi method work approxim definit entropi util error criterion decid output pdf uniform method approxim comput entropi sampl ineffici space section overcom culti approxim entropi util gener entropi start deriv algorithm state properti gaussian function method gaussian kernel σ σ σ covari data sampl yi yj covari matric gaussian kernel space σ σ shown relat dz yi integr product gaussian kernel obtain interpret convolut gaussian kernel center easi result gaussian function covari equal sum individu covari center ij quadrat entropi cost function discret sampl set sampl random variabl space interest question entropi set data form pdf part answer li methodolog present section estim data pdf window method gaussian gaussian kernel σ covari matrix entropi pdf algorithm estim entropi unrealist complex viola realiz conclud init inform yield practic measur itl quadrat entropi lead simpler form obtain entropi estim set discret data point ˆ simplifi notat repres combin quadrat entropi window lead estim entropi ing interact pair sampl practic cost function itl approxim evalu pdf quadrat entropi inform potenti dz yi yj wrote interest physic interpret entropi assum place physic particl locat prescrib data sampl reason call inform particl yi yj posit proport distanc potenti field creat space interact local field strength dictat gaussian kernel exponenti decai distanc yi yj physic particl interact distanc quadrat entropi gaussian kernel interact law control interact law window estim sum interact ith ipc vi sum pair regard potenti energi data set call potenti energi inform potenti maxim entropi minim ip estim quadrat entropi neg logarithm ip pleasant verifi quest itl algorithm end procedur resembl world interact physic origin concept entropi expect methodolog appli entropi higher order entropi order α comput interact provid inform complex structur data set tion estim extens window method implement gaussian kernel util estim complex algorithm increasingli prohibit α inform forc deriv potenti energi case inform driven forc move data sampl space interact yi yj yi yj yi regard forc ij ipc call inform forc data sampl free move region mation forc pair ipc drive sampl state minimum ip add contribut ensembl sampl net effect inform potenti sampl σ yi yj yi σ concept ip creat criterion extern mapper fig miss step integr criterion adapt parametr mapper mlp ipc output parametr mapper adapt mlp map maxim entropi output problem find mlp ij paramet ip minim ipc free function mlp paramet inform forc appli ipc tion potenti paramet chain rule yi mlp output notic iti output respect mlp paramet inform forc paramet ogi backpropag formal conclud inform forc place inject error backpropag algorithm obtain methodolog adapt arbitrari nonlinear map entropi maxim notic adapt mlp desir criterion establish itl criterion adapt mlp global properti output sampl tribut analyz express detail compar mse note mse comput singl data combin entropi estim pair data inform data fi ε set extract mse criterion sampl data set ferent expect algorithm criterion util directli implement optim requir analyt manipul solv problem iter approach common adapt filter neurocomput constraint topolog mapper weight mlp pe adapt algorithm dual network figur train mlp inform potenti η input δ local error pe goal maxim output entropi requir sign minim output sign requir notic chang interact ipc output space attract reader notic parallel deriv method present tion show inform forc attractor kernel inform forc inform potenti field note σ σ σ exp σ σ convolv kernel deriv convolut commut appli equat put sampl obtain inject error ε attractor kernel inform forc deriv section notic entropi util regul kernel term disappear mlp limit output dynam rang due satur data sampl fill space limit output mimick boundari regul term deriv show fact util quadrat entropi comput interact pair data sampl output principl justif criterion conclud section state methodolog present lai framework construct learn machin capabl estim entropi directli sampl output modifi weight backpropag manipul output entropi electron implement law physic speed calcul intrigu possibl algorithm complex examin interact pair output sampl note ing bell sejnowski approach ica approach conceptu easili extend mlp arbitrari topolog data distribut multimod natur quadrat entropi essenti criterion entropi manipul mlp arbitrari approach attack problem nonlinear ture recent almeida util similar idea separ nonlinear mixtur σ learn quadrat mutual inform section implement nonparametr method solv develop itl criterion estim mutual inform random variabl enabl implement mutual inform capabl quantifi entropi pair random variabl gener measur entropi appli flexibl engin problem mutual inform output mapper comput differ shannon entropi hy rememb shannon entropi easili estim exemplar express util approxim estim mutual inform tive estim mutual inform diverg kl pdf fx gx fx dx gx implicitli entropi util base diverg measur order α pdf fx gx fx α relat diverg measur α α gx dx lim α limit random variabl essenti estim diverg joint pdf factor margin joint margin pdf observ quadrat pdf easili integr inform potenti section distanc measur pdf quadrat term util tool ip develop section basic wai write measur concentr base euclidean differ vector inequ write base inequ write notic express util quadrat length tor dot product util distanc measur approxim direct diverg ad advantag term estim ip formal develop previou section base inequ measur pdf fx gx fx gx fx easi show equal hold true fx gx pdf diverg estim distanc joint quadrat entropi product quadrat entropi margin preserv properti diverg mate diverg pdf fx gx base euclidean distanc fx dx gx dx fx dx mutual inform measur import question find similar mutual inform newli duce measur demonstr simpl problem measur mutual inform cs ed produc minim result mutual tion diverg chapter show tor cs ed base inform potenti appli solv practic problem high success simpl case discret random variabl shown fig valu probabl distribut px similarli probabl distribut px px px joint probabl px px px px px px px px px px px px figur simpl sampl px px px px px px px px treat case fix distribut free px ter chang valu ic calcul fig show quantiti chang px px left graph ic surfac versu px px graph contour plot graph show surfac measur reach minimum line px joint probabl equal factor margin probabl maximum reach point joint iti illustr case mine vice versa px px px px px px px margin probabl free px margin probabl fix factor margin probabl distribut fix joint probabl tribut chang case regard constraint previou case px px fig show measur chang px px px px px px px px ed cs px px px px px minima reach point maxima reach point px px px figur surfac contour cs px px px px px px ed cs px px px px px simpl measur minimum maximum point mutual inform ed convex function confirm fact convex function full case cs behav minimum analysi make prefer maxim estim quadrat mutual inform ed cs random variabl margin pdf joint pdf mutual base distanc measur obviou measur independ variabl mutual evid measur depend variabl mutual unabl provid strict justif ed figur plot ic px call quadrat mutual conveni observ set data sampl variabl variabl yi data sampl joint variabl base window method joint pdf margin pdf estim combin obtain express estim mutual inform base set data ˆ σ σ ˆ ˆ σ σ order interpret express term inform potenti introduc term margin ip calcul subspac variabl ipc joint inform potenti joint vi margin inform potenti potenti sampl margin inform potenti field margin inform potenti averag partial margin inform potenti index potenti measur interact partial margin inform potenti simplifi notat potenti comput sum pair interact ipc margin ij mip definit entropi qualifi superscript describ field refer argument logarithm equat regard normal joint inform potenti inform potenti potenti defin quadrat mutual inform measur concept son obtain consist definit entropi shown relat quadrat entropi ip quadrat mutual inform maxim quadrat entropi minim ing quadrat mutual inform minim minim quadrat mutual inform maxim write function individu field obtain conclud gener measur mip ent level individu ipc partial margin inform potenti margin inform potenti quadrat mutual inform easili extend case ple variabl potenti vi vi yi yj potenti complex inform potenti ent inform potenti contribut potenti mip forc appli ipc tive ip independ call margin inform forc margin forc ipc receiv ik notic forc sourc normal inform balanc consequ logarithm definit margin forc oper data sampl calcul low formula obtain differenti field ik ik forc ipc receiv calcul repres inject error paramet mapper backpropag adapt quadrat mutual inform place margin forc σ σ σ variabl case final quadrat mutual inform euclidean differ measur util express quadrat mutual inform euclidean differ vector inequ equal hold statist dz dz dz dz dz diverg basic measur euclidean distanc joint pdf factor margin previou definit difficult obtain differ measur margin ip found behav maxim quadrat mutual provid similar result minim quadrat mutual inform difficult obtain formula calcul inform forc produc field case euclidean differ measur vj vj vj σ ij ij vj vi vi vk σ cross matric serv forc modifi ij interpret express factor margin pdf suggest joint coordin coordin real ipc locat virtual ipc point coordin real ipc real ipc pdf factor margin pdf ipc relat type ipc illustr figur extrem case real ipc margin ipc virtual ipc left ipc distribut diagon line case virtual ipc maxim scatter joint differ distribut real ipc virtual ipc maxim panel fig ipc compact joint field case virtual ipc occupi locat real ipc figur illustr case field correspond case cal independ margin variabl distribut ipc provid intermedi condit extrem squar euclidean distanc ip real virtual ip field virtual gener measur statist relat variabl note dimens blind sourc separ present result linear system train quadrat mutual inform criterion point problem find project wx ponent output signal independ problem test experi present experi test perform method data set mix comput mix matrix color gaussian segment data point segment data segment concaten shuffl fig show sourc densiti joint space axi sourc fig mix produc mixtur long short difficult separ whiten perform mixtur facilit data distribut recov signal plot fig observ origin sourc densiti obtain high fidel fig evolut snr product matrix train function iter approach figur show method work sourc mix signal recov sourc distribut db mix signal distribut train curv db iter iter experi speech signal sourc signal mix matrix mix direct lar implement window slide speech data window speech data window calcul inform relat forc propag forc adjust matrix window slide matrix updat train curv slide shown fig recov signal distribut figur data distribut sourc mix method learn curv bottom notic db snr method converg fast work snr approach larg spike train curv show perfect matrix estim algorithm adapt adapt algorithm estim direct optim order obtain stabl result learn rate progress reduc result stabil mate whiten whiten process incorpor itl algorithm db result show effect minim mutual inform work comput laboratori formul solv gener criterion itl improv work appli nonlinear mapper inform criterion learn equat solv problem approach decoupl mapper quadrat mutual inform essenti criterion optim train curv slide index figur speech signal result train curv snr db inform theoret learn quadrat mutual inform order appli quadrat mutual inform train mlp variabl framework maxim mutual inform desir output mlp joint space space desir function mlp joint pdf dy random variabl margin pdf desir function input regress indic function classif framework extend learn requir describ relat statist start illustr method pose estim function map problem pose estim mutual inform problem find aspect angl call vehicl synthet apertur radar imageri poor resolut sar combin variabl scatter center make determin pose nontrivi problem pose vehicl tremend simplifi task vehicl recognit figur sar imag personnel carrier pose estim formul term maximum posteriori probabl â estim pose posteriori probabl densiti function imag ax joint pdf pose imag kei issu estim joint pdf high imag make difficult obtain reliabl estim reduct featur output mapper serv featur space pose estim paramet vector case singl layer work input perceptron provid manc advantag work directli imag pose estim crucial point pose estim scheme interpret ture vector convei inform pose obtain effect featur mutual inform featur vector criterion train featur convei inform pose implement euclidean distanc quadrat mutual inform estim â argmax argmax â argmax argmax optim arg max system diagram shown fig true pose angl vehicl train set code rectangular coordin space maximum joint pdf estim network train produc directli pose estim involv pose estim higher dimens ax ay wx pose result ident obtain simpler estim public data set test pose estim algorithm imag chip vehicl roughli center data train linear mapper imag vehicl personnel approxim algorithm converg batch iter stabl configur output train set approxim circl output space solut make perfect norm perspect knowledg problem angl imag input backpropag test imag algorithm output inform potenti field forc figur learn quadrat mutual inform view figur system diamond triangl test true estim pose consecut view test vehicl train move preserv accuraci pose estim tabl show perform algorithm vehicl type tank personnel estim pose type personnel close resolut train set data conclud algorithm gener inform train imag vehicl total vehicl class error show pose estim smooth interest characterist pose estim implement mlp show overtrain train exemplar weight learn method quadrat mutual inform tion project input signal space system weight linear filter concept frequenc inform theori select project preserv input inform desir result report show maxim mutual inform criterion effect section present power quadrat mutual inform learn train mlp tabl test result vehicl vehicl ab error set challeng accept train methodolog perceptron neural network era end algorithm train mlp late backpropag algorithm popular train contribut neural comput time bp util train point research topolog train mlp backpropag accept train intermedi layer requir backpropag error top layer util modif concept train mlp strictli ward fashion model mlp network commun train layer layer mutual inform output layer desir signal maxim layer transfer inform desir notic backpropag error layer network increment train strictli feedforward input layer output layer imposs inform top layer train input layer train simpli maximum inform transfer input layer point view desir itl train make desir explicit network layer figur mlp commun channel input signal output signal hidden layer signal desir signal input layer θ weight set train set xi input pattern di desir output actual output input xi mutual inform output desir signal estim cross inform potenti euclidean differ measur data set comput maxim margin inform forc layer comput gradient mate delta rule adapt weight test method select repres linear tempor map input signal desir output signal frequenc shown fig topolog delai neural hidden layer pe tanh linear output pe shown fig train scheme hidden layer train output layer train curv shown fig output hidden pe output pe train shown fig frequenc final output doubl inform forc field ipc fi fi yi figur train frequenc problem easi paramet input delai line period input explain partial oscil learn curv fine tune learn paramet size learn make learn smoother desir train curv left hidden output layer hidden node hidden node output network figur train curv output pe net output train solv possibl smaller point pose itl substitut bp mlp train simpli illustr error layer layer train system hidden pe idea transfer inform layer achiev maxim mutual inform output layer desir suffici discov complex map notic problem guess hidden pe repres solv train method chapter describ effort develop criterion adapt filter neurocomput optim criteria extern work directli inform assumpt found answer combin nonparametr densiti estim easili comput definit entropi mutual inform entropi definit obei properti altern definit shown practic explor parametr tion entropi settl member famili order α quadrat entropi quadrat entropi readili integr window yield approxim pdf estim optim criterion concept explain idea pdf estim window lead integr squar error method report practic method itl criterion extern mapper linear nonlinear analysi comput show pdf estim bypass criterion comput local interact sampl influenc function algorithm tional complex number train pattern show method practic work extend work bell sejnowski blind sourc separ criterion interest properti hood explor quadrat entropi principl approach directli manipul entropi provid interpret local interact pair sampl inform potenti field inject error mapper interpret mation forc physic analog hope build base approach show relationship inform potenti influenc function obtain import work form entropi estim entropi function estim pdf estim entropi due fact entropi function norm pdf mate directli interact data sampl similar simplif design posteriori probabl estim directli estim pdf save grace make itl practic mutual inform estim euclidean inequ measur diverg joint densiti iz margin proxi advantag easili integr window method implement sampl show minim cost function effici separ mix speech sourc idea minim mutual inform output previou chapter inform potenti method sole inform potenti separ earli mix sourc quadrat mutual inform transcend independ compon analysi applic learn interpret variabl desir output mapper show maxim quadrat mutual inform work inform filter criterion estim pose vehicl imag synthet ture radar show adapt mlp error backpropag layer mlp interpret inform filter explicit goal maxim mutual inform desir output layer backpropag error discov complex map challeng step lie ahead area hope shown learn criteria usabl provid inform data error criterion neurocomput work partial support darpa grant nsf grant refer amari sourc separ statist ieee tran signal vol inform theori provid ecolog theori sensori network barlow minimum entropi neural comput vol burg entropi spectral proc meet societi explor aj tj approach blind separ blind neural maximum likelihood blind sourc ieee signal process vol april comon compon signal proc vol pp cover thoma inform approach neural kung compon neural theori john wilei hart pe classif scene john wilei mit fisher extens minimum averag correl energi phd dept fisher princip sourc separ interact output ieee workshop sig utah strang phy rev vol golub van loan john hopkin haykin macmillan publish rv bell system technic jayn theori statist phy vol pp kapur optim principl jn inform john wilei son kullback theori dover kohonen springer applic principl maximum inform preserv linear advanc neural inform process system touretzki ds local learn rule enabl inform maxim arbitrari input neural spectral simplifi neuron model princip compon journal mathemat biologi estim probabl densiti function ann math stat inform theoret int conf neural vol princip fisher manipul arbitrari nonlinear proc ieee workshop neural net signal random variabl stochast fundament question inform select paper alfr vol pp measur entropi select paper alfr vol pp ge jr natur shannon weaver mathemat theori illinoi ce mathemat theori bell sy tech hh amari learn algorithm blind separ maximum entropi minimum mutual neural vol vapnik vn natur statist learn viola sejnowski entropi manipul proc neural info proc sy decorrel statist phd xu fisher princip mutual inform approach pose algorithm synthet apertur radar imageri vol spie xu princip fisher wu measur independ compon analysi proc vol ii xu entropi inform potenti phd data marqu almeida nonlinear mixtur pattern proc pp
DB/58 3 chapter polynomi base theorem prove wu chapter polynomi base theorem prove present notion infer rule concret infer rule term superposit superposit ii infer rule prove complet introduc confluent superposit show complet complet clausal case open problem relat basi method discuss introduct boolean ring polynomi base theorem prove began work extend idea boolean polynomi repres proposit formula case predic calculu base complet procedur knuth imit framework algorithm comput base polynomi ideal kapur develop approach refer basi method obviou advantag boolean polynomi proposit formula uniqu easi gener logic system al wu tan stimul approach result report dietrich kapur zhang wu liu zhang chapter review work wu liu theorem prove base includ notion infer rule strategi wu liu strategi develop wu open problem discuss mechan applic wu wu liu complet infer rule import theoret aspect theorem prove infer rule complet consid immedi bore difficult base concept infer rule categori infer rule pretti rich roughli infer rule resolut gener resolut jiang murrai wang liu remaind method present concret infer rule superposit superposit ii matter superposit gener resolut zhang restrict superposit ii idea method wu wu method techniqu singl overlap parallel overlap worthwhil appli frame theorem prove origin notic procedur resolut elimin variabl idea emploi similar remaind comput wu method infer rule hard boolean polynomi respect remaind respect encourag phenomenon boolean polynomi respect remaind respect util denot boolean polynomi idempot rule superposit ii emploi singl overlap parallel overlap multipl overlap sequenti overlap basi method multipl overlap sequenti fact kind clausal theorem prove multipl overlap gener infer singl search space multipl overlap comput singl overlap oper mention associ commut zhang prove singl overlap gener peopl interest parallel overlap sequenti overlap investig sequenti overlap replac parallel overlap vice versa reader muller zhang infer rule convert chapter theorem prove formula case associ law formula form oe oe simpler respect clausal form develop strategi crucial work theorem prove challeng give strategi effici complet basic idea famou strategi semant lock resolut loveland wo al depend resolut view basi method strategi util semant resolut lock difficulti li establish infer rule underli version idea advantag reli express style knowledg concern detail improv strategi interest extend basic idea polynomi base theorem prove confluent present design applic issu lost flavor viewpoint effect theorem prove logic vast applic artifici logic deduct program verif specif interest reader find clue chang lee lloyd murrai robinson show infer rule complet superposit ii complet confluent complet clausal case problem discuss complet odd superposit ii pose overlap suffici unif maxim atom basi method motiv problem chapter arrang sect describ basic notion result polynomi base theorem prove sect overview previou work review current work field present definit infer show resolut fact concret infer rule strategi consid sect show mechan applic infer rule complet introduc confluent concret infer relat problem discuss section overview theorem prove sect basic knowledg concept defin reader consult chang lee kapur describ fundament concept result discuss directli base polynomi residu class ring modulo defin polynomi polynomi atom indetermin polynomi ground atom ground call variabl atom variabl polynomi denot obtain remov power atom polynomi simpl arbitrari skolem formula note defin convert skolem formula polynomi skolem formula ps fp unsatisfi ps unsatisfi wu liu suffici firstord polynomi set unsatisfi herbrand theorem resolut lee chapter theorem prove theorem ps unsatisfi unsatisfi constant repres set construct ps replac variabl atom member ps element notat atom specif statement ps polynomi polynomi set mention polynomi denot set atom occur substitut repres denot ff stand substitut power atom directli written form infer rule infer rule defin appli yield finit polynomi histor develop chapter concentr present overview primari work polynomi base theorem make chapter clear reader handl situat call clausal polynomi clausal form product atom call method develop term clausal infer rule mechan applic oe gener extra variabl obtain similar neg resolut featur unit resolut import differ resolut method reduct method resolut strategi factor comput zhang prove complet improv found muller basi method method kapur polynomi gener polynomi unifi maxim term order main infer rule oe oe oe maxim meet condit jv unifi mgu oe action idempot rule rule infer rule fact similar resolut power lot flexibl major differ basi method base basi comput base extens complet procedur handl associ commut oper method zhang extens infer rule chapter theorem prove odd number oe mgu oe maxim partial order atom advantag singl overlap basi method multipl overlap complet close remark inform kind problem paper mention reader consult kapur zhang zhang infer rule mention work wu begin notion infer rule denot polynomi deriv replac call instanc atom gener unifi call factor assum infer rule ir discuss sound denot set result obtain appli ir ir meet condit unit ground stabl condit ground exist split condit exist ae fc lift condit ground instanc exist factor instanc exist instanc main reason introduc unit condit empti deriv similar rule method davi putnam stabl make obtain deduct relat case atom split condit ensur deriv irrelev formula conjunct mechan applic inform lift lemma lift condit ensur lift proposit case predic case show resolut polynomi form deal clausal polynomi case infer rule resolut comput binari resolv express manner viewpoint delet clausal oe mgu oe oe defin binari resolv ground unit condit hold exist binari resolv stabl condit hold clausal split condit hold natur common factor chapter theorem prove oe mgu oe ffi ff oe ffi ff oe oe oe lift condit hold sequel sequenc call deduct ps call sequenc refut ps theorem ps unsatisfi ir exist refut ps theorem infer rule complet stronger sect reader refer wu liu proof exampl describ concret infer rule singl parallel overlap multipl sequenti overlap call infer rule superposit oe mgu idea superposit gener resolut gener gener resolv oe result obtain appli superposit worth convert type resolut polynomi form reduct defin appli similar semant lock strategi complet incomplet lock semant strategi sun infer rule superposit restrict superposit sound mechan applic infer rule call superposit ii oe mgu superposit ii construct idea comput polynomi wu method divid obtain divid repres idempot rule proof system develop emploi superposit call remaind method wu liu advantag basi method partial order introduc unif partial atom order introduc util unif maxim atom major differ superposit ii critic pair comput basi method point singl overlap parallel overlap emploi superposit idempot rule reader easili find differ compar superposit ii infer rule emploi basi method superposit ii sound theorem superposit superposit ii proof reader refer wu liu strategi discuss strategi infer rule strategi superposit ii interest theoret result complet strategi shown infer rule complet matter stronger result chapter theorem prove strategi resolut introduc wo al design restrict applic infer rule gener consid power restrict strategi strategi enabl program prove theorem comput memori time requir advanc result lot impress success problem investig basic research problem relat directli exist restrict strategi power problem basic import linear strategi resolut develop loveland separ special appeal natur simpl structur tree search techniqu heurist method appli easili conveni basic idea frequent practic applic logic program deduct lloyd advantag depend resolut extend resolut strategi polynomi base theorem show infer rule complet ps sequenc call ps support factor element ps fc factor element ps sequenc ps support assum sequenc call ps top factor factor element ps fc sg sequenc call ps top illustr definit ir superposit ps fc mechan applic sequenc ps support sequenc ps top theorem ps ir ps exist ps support ps fc exist ps top proof mathemat induct number element theorem stabl split condit ensur theorem hold ground case lift result requir wu liu theorem show infer rule complet fact requir infer rule chapter theorem prove confluent previou section infer superposit superposit ii strategi introduc partial order atom motiv singl unif maxim multipl overlap unif maxim basi method shown wu method appli proposit logic tan initi work extend framework wu method theorem prove restrict reason design confluent li applic issu polynomi repres knowledg power logic program util normal program pg complet obtain deriv ps fp roughli speak procedur emploi atom order introduc atom order real topic ir stand superposit superposit ii classifi element oe mgu ir superposit call oe ir superposit call oe case call fact exist ae ground arbitrari exist number element instanc mechan applic denot partial order transit binari hold arbitrari impli maxim atom set herbrand interpret ps assum oe mgu oe maxim call satisfi factor oe oe maxim call satisfi call oe maxim oe sequenc call fc ir superposit ir superposit ii sequenc defin basic confluent ps top ps definit basic confluent ps top confluent ps top confluent ps top sequenc confluent ps top confluent ps top confluent ps top sequenc confluent ps top sequenc call sequenc call definit call sequenc confluent ps top ps chapter theorem prove illustr sect sequenc basic confluent ps top sequenc basic confluent ps top sequenc basic confluent ps top sequenc confluent ps top sequenc ps posit herbrand interpret ps mechan applic sequenc ps note fc fact confluent fc top fc fc improv fc satisfi fact lift theorem theorem ps unsatisfi ir superposit superposit ii ps fc exist confluent ps top exist exist ps theorem show superposit ii complet confluent requir ps fc definit basic confluent ps top sequenc call ps top defin ps top similarli theorem ps clausal unsatisfi ir superposit superposit ii ps exist ps top chapter theorem prove theorem demonstr complet clausal theorem prove complet gener case proof theorem theorem reader refer wu proof theorem consult wu wu liu remark proof theorem theorem advantag achiev introduc partial order comput avoid confluent advantag number polynomi rapidli case atom confluent polynomi problem briefli discuss problem relat basi method basi method basi method develop kapur multipl overlap sequenti overlap question parallel overlap sequenti multipl overlap unif maxim atom al kapur zhang detail question pose problem list open problem web site superposit ii singl overlap parallel unif maxim atom infer rule comput main differ basi method parallel overlap idempot rule theorem mechan applic clausal theorem parallel overlap sequenti singl overlap unif maxim atom parallel overlap basi method theorem convert idempot rule basi method hold complet ii discuss ii complet pose open question zhang difficult clausal theorem proof system complet ii coincid case superposit ii present definit arbitrari factor posit herbrand interpret ps superposit ii ii answer question posit unnecessari defin polynomi show true proposit logic ps fc pq pr ps ps odd follow conduct comput superposit uniqu result appli superposit ii unabl deriv ps theorem ii incomplet ii offer inform deriv idempot rule figur inform defin polynomi factor comput chapter theorem prove comput factor superposit answer posit inform problem proof system reader refer wu liu simplif rule introduc simplif rule critic topic theorem prove consid carefulli remark complet superposit ii shown techniqu shrink semant tree lee prove superposit superposit ii complet simplif reduct defin zhang appli reader consult introduc simplif rule similar superposit ii remark ma implement superposit ii mathematica comput data structur made experi statist list classic theorem chosen chang lee stand number input number polynomi gener proof number polynomi constitut proof theorem proof input polynomi procedur exampl ps poli proof mechan applic symmetr transit relat properti reflex verif condit hoar find program ident associ algebra system left solut associ system ident squar element commut group left ident ident group left ident left element subset group impli xy ident subset group impli xy prime divid exist infinit prime number greater prime remark polynomi produc introduc simplif rule matter aim test practic compar effici theorem prove advantag theorem prove convert input formula transform firstord polynomi addit theorem proof system base boolean ring complet gener resolut proof system discuss advantag defect simpl direct relationship gener resolut similar fact reduct polar emploi incomplet strategi hard superposit superposit ii gener superposit gener resolut polynomi version zhang consid restrict strategi superposit odd discard gener defin superposit strategi strategi advantag easili tree search techniqu linear strategi appli complet proof gener consist polynomi gener resolut proof polynomi produc relationship gener resolut superposit point simpl fact gener oe oe gener chapter theorem prove resolv oe gener resolv superposit ii produc polynomi gener resolv neglect result idempot rule case concern theorem prove base firstord polynomi defin infer rule describ condit shown infer rule complet complet present concret infer superposit superposit ii sect demonstr resolut introduc confluent superposit discuss complet close topic worthi investig gener notion redund infer develop investig behavior infer rule combin power notion advantag basi method gener equat theori natur respect consid remaind method point superposit ii similar comput polynomi wu method investig entir framework wu method comput basic comput characterist set appli theorem prove obtain complet method interest topic studi logic program polynomi focu oper semant definit similar cope neg inform gener talk issu foundat technic exist infer rule infer rule singl overlap mechan applic refer infer rule order theorem prove symp logic comput june comput societi press pp theori resolut technic report fur germani restrict resolut phd texa usa algorithm method polynomi ideal theori system theori pp symbol logic mechan theorem prove academ york logic base applic modal logic comput deduct logic program addisonweslei publ england comput procedur quantif theori acm open problem rewrit lectur note comput sci relat resolut algebra complet horn logic intern conf autom juli springer berlin heidelberg pp topic autom theorem prove program gener phd univ illinoi usa refut theorem prove system artif intel rewrit method theorem prove order theori equal comput equat approach theorem prove predic calculu intern joint confer artifici august lo morgan pp overview rewrit rule laboratori lectur note comput sci chapter theorem prove simpl word problem algebra comput problem abstract pergamon pp mechan theorem prove scienc beij sun gener resolut comput technol foundat logic program berlin simplifi format procedur acm autom theorem logic basi york topic complet theorem prove germani multipl overlap complet theorem prove german workshop artifici septemb springer berlin heidelberg york london pari pp complet theorem prove artif intel logic base resolut principl acm automat theorem prove renam semant resolut acm autom theorem prove theori commut associ acm gener resolut comput effici complet set support strategi theorem prove acm autom basic problem prentic jersei order polynomi base theorem prove research report institut mathemat school mathemat china remaind method mechan theorem prove predic calculu comput theorem prove gener mechan applic ii sci china version sci china infer rule theorem prove automat reason algebra method decid deduct problem proposit logic intern symp ieee comput societi pp basic principl mechan theorem prove geometri scienc china basic principl mechan theorem prove elementari geometri syst sci math sci superposit autom reason equat logic phd renssela polytechn usa method boolean ring base theorem prove comput
IR/59 5 inform retriev octob nation research council canada learn algorithm extract peter turnei institut inform technolog nation research council canada abstract academ journal author provid list fifteen page articl kei word phrase prefer call wide varieti task discuss paper approach problem automat extract text learn task treat document set learn algorithm learn classifi posit neg exampl set experi appli tree induct algorithm learn task evalu perform configur set experi appli algorithm task develop algorithm specif automat extract text mental result support claim algorithm incorpor special procedur domain gener algorithm subject human evalu gener extractor suggest accept human reader level perform satisfactori wide varieti applic machin extract introduct turnei learn algorithm extract journal author provid list keyword articl call phrase singl word defin list short list phrase fifteen noun captur main topic discuss document paper concern automat extract text meant serv multipl goal print page journal goal summar enabl reader quickli determin articl field interest print cumul index goal index enabl reader quickli find relev articl reader specif search engin form field label goal enabl reader make search search document match queri term keyword field yield higher qualiti list hit search term full text document serv goal goal share requir short list phrase captur main topic document defin automat extract automat select cal phrase bodi document automat extract special case gener task automat gener phrase necessarili bodi document section discuss measur perform automat extract algorithm experi measur perform compar document averag bodi document ideal extract algorithm gener learn algorithm extract phrase match tool automat creat small minor document todai commerci softwar product automat extract algorithm microsoft automat tion word fill keyword field document metadata templat document veriti automat extract search search engin product line search highlight bold facilit skim list search result automat phrase extract design maintain metadata web page automat extract build index web site applic mention share requir short list phrase captur main topic size list depend applic inclin user algorithm discuss user desir number phrase discuss relat work research section close relat work involv problem automat index gener leung differ extract access metadata templat word select file properti automat fill keyword select tool obviou word microsoft word trademark regist trademark microsoft corpor microsoft veriti proprietari techniqu extract techniqu involv machin learn veriti search trademark regist trademark veriti extract softwar product bot trademark regist trademark softwar comparison word search turnei turnei index gener index differ list index length list topic phrase document index topic phrase list read judg index read entireti automat extract demand task automat index gener extract distinct inform task studi depth messag understand confer inform extract involv extract specif type inform collect report terrorist inform extract involv find specif kind terrorist type incid extract specif goal extract produc topic type document approach automat extract learn task treat document set classifi posit neg ple classic machin learn problem learn ple section describ appli tree induct algorithm task unusu aspect classif problem posit exampl constitut total number exampl typic appli balanc class distribut experi paper collect combin total document collect present section set experi evalu wai appli preliminari experi train found bag improv perform learn algorithm extract bag work gener sion tree vote classif experi number tree techniqu sampl train data experi support hypothesi bag improv perform appli automat extract experi special develop specif learn extract achiev result learn section introduc algorithm hybrid genet algorithm extractor extract algorithm extractor work assign numer score phrase input document final output extractor essenti list highest score phrase behaviour score function determin dozen numer paramet tune set maxim perform extractor set train exampl set experi support hypothesi special algorithm gener algorithm algorithm incorpor amount domain avoid special procedur knowledg applic special procedur knowledg automat extract experi subject human evalu qualiti produc automat gener judg accept judg good section discuss result section present plan futur work conclud section perform level suitabl extractor offici mark nation research council canada patent applic mit extractor practic applic turnei measur perform extract algorithm measur perform extract algorithm number match phrase phrase phrase match correspond sequenc stem stem remain remov suffix word match match order sequenc match porter stem algorithm popular algorithm stem english word algorithm heurist rule remov transform english suffix stemmer aggress porter stemmer stemmer recogn word share incorrectli map distinct word stem found aggress stem extract serv stem aggress stem algorithm call iter stemmer algorithm repeatedli appli word stop chang iter manner necessarili leav aggress stemmer tabl show exampl stem algorithm view extract classif problem task classifi implement porter stem algorithm written jim australia implement includ extens origin handl british spell stem implement written implement part mg search develop group peopl australia zealand mg code learn algorithm extract tabl sampl behaviour stem algorithm word porter stem stem iter stem believ believ belief belief belief belief belief belief believ believ belief belief polic polic polic pol polici polici polic pol assembl assembl assembl assembl assembl assembl probabl probabl prob prob probabl probabl prob prob probabl probabl word phrase document evalu automat extract classif correspond classif perform measur number match divid number varieti number relat work paper discuss automat extract import treat problem learn exampl krulwich heurist extract document base syntact presenc phrase tion acronym motiv produc phrase featur automat classifi document algorithm produc tive larg list low learn algorithm discov algorithm base adapt reson theori neural network algorithm produc larg list low algorithm applic steier belew mutual inform statist discov turnei word approach limit consid extract produc low list phrase time paper submit frank al implement build work treat phrase extract learn bayesian approach genet algorithm approach experi level perform group evalu compon kind search design special support experi suggest kind task easier ind convent search engin interfac similar interfac paper explor task produc summari document extract kei sentenc document marsh johnson salton kupiec jang task similar task difficult extract sentenc lack refer resolv anaphor pronoun definit noun phrase demonstr refer discuss concept sentenc extract context neighbour imposs difficult reader summari determin refer anaphor johnson al attempt automat resolv system produc overli long summari extract avoid problem anaphor list unlik list list randomli permut consequ paper summar sentenc extract describ algorithm learn algorithm extract base manual deriv heurist heurist tend effect intend gener domain extend heurist domain involv amount manual work paper describ learn train suppli document target summari jang learn algorithm extend domain work algorithm manual deriv tic manual work train summari sentenc mean standard abstract suitabl advantag extract suitabl train learn major bodi document bodi relat work address task inform extract tion extract system seek specif inform predefin templat templat specif topic area topic area report terrorist templat inform extract system identifi terrorist organ involv victim type attack inform type arpa sponsor seri messag understand confer inform extract system evalu corpora topic includ terrorist attack corpor merger inform extract system manual built singl topic requir larg amount expert labour highest perform messag understand confer achiev cost year intens program effort recent work demonstr learn algorithm perform manual construct system soderland lehnert tree induct learn compon turnei tion extract system soderland slot templat handl group tree train special slot sion tree base syntact featur presenc word inform extract extract opposit end continuum rang end requir substanti algorithm intermedi point continuum task identifi corpor busi task introduc sixth messag understand confer call entiti recognit task system tic rule recogn entiti relat work address problem automat creat index croft leung leung kan provid good survei work gener class index intend human reader call index intend inform retriev softwar engin search engin index suitabl human index occurr word stop document collect index tend index import occurr interest word phrase older work automat creat index concern build search engin build index leung interest human index relev search engin index leung kan address problem learn assign index term control vocabulari involv build learn algorithm extract cal model index term control vocabulari statist model attempt captur syntact properti distinguish document index term document inappropri result control vocabulari make difficult compar work rithm examin worth note list control index term grow bodi literatur leung softwar continu train nakagawa automat extract simpl compound noun technic creat index compound noun score formula base frequenc compon noun document nakagawa evalu algorithm compar index index index gener assist bia result featur distinguish index list length nakagawa document typic assign index typic index term intend cover index term intend cover small part document distinguish featur sophist index simpli alphabet list term hierarch major index term indent list relat minor index term corpora experi paper base document collect target set gener hand basic statist corpora present tabl journal articl select journal articl nal journal cognit behavior corpu turnei tabl statist collect number document averag number standard deviat percentag document brain scienc preprint hotel industri tional academi hospit chemistri aid molecular full text articl web author suppli articl email messag collect email messag nrc student creat messag aliweb collect web page aliweb search public search engin provid nexor aliweb field peopl enter url add aliweb store aliweb url nasa collect web page langlei research center page includ list fip gather web page feder tion process standard document includ list learn algorithm perform test data significantli train data inconveni learn algorithm requir type document experi random split document train ing set design experi test abil learn algorithm word word document full text journal articl email messag aliweb web page nasa web page fip web page url gener data learn algorithm extract preliminari found main factor influenc gener averag length document train compar test set reason learn short document long document tabl select part nal articl corpu train learn algorithm handl long document part email messag corpu train learn algorithm handl short document train corpu similar test respect document length method appli extract rithm develop train subset journal articl email messag corpora corpora acquir design method appli design algorithm practic ensur risk tune test data tabl correspond test train data test corpu train corpu number document appli extract set tree induct algorithm classifi phrase posit neg exampl describ featur set bag number document journal articl journal articl email messag email messag aliweb web page email messag nasa web page email messag fip web page journal articl turnei method sampl train data task learn learn assign case class case candid classifi posit neg classifi case examin featur featur properti case relev determin class case handl featur valu rang fix set symbol input set train case repres featur vector train teacher assign class featur vector gener output tree el relationship featur class tree root tree intern vertic label test featur valu leaf vertic label class edg leav intern vertex label outcom test vertex featur number word test ture number word phrase outcom case classifi begin root tree path leaf base valu featur case label leaf predict class case convert document set featur vector make list phrase consecut word interven punctuat iter stemmer find stem form phrase uniqu stem gener featur tabl access featur build tree leav tree predict class tree predict class vector phrase tree learn algorithm extract tabl descript featur vector featur descript featur type stem form match phrase ignor frequent phrase ignor output calcul featur number word rang continu occurr normal divid number word document stop continu occurr earliest occur singl stem continu word normal divid number word document stop frequenc normal divid continu number word document stop frequenc frequent singl stem word normal divid number word document stop continu rel length calcul number charact divid averag number charact candid phrase continu proper base capit end final base suffix common base list common class base match stem form phrase suitabl output human reader stem form evalu perform tree preliminari evalu settl featur tabl tabl show number featur vector gener corpu vector train vector test larg major vector neg exampl user desir number output document standard tree user turnei number featur vector classifi belong class ran gener tree tree gener probabl estim class vector user specifi phrase select vector highest estim probabl class addit option maxim bushi tree preliminari found paramet set work conjunct bag involv gener tree vote tree induct algorithm low bia high varianc bag multipl tree improv perform reduc varianc bag impact bia corpu train test combin probabl estim averag vote preliminari experi train obtain good result bag tree ad tree effect tabl number featur vector corpu number document total number vector averag vector document percent class journal email journal email aliweb nasa fip learn algorithm extract standard approach bag randomli sampl train replac preliminari experi train achiev good perform train tree random sampl train data standard approach bag ignor class tion class sampl correspond distribut train data tabl posit exampl constitut total number exampl modifi random sampl procedur sampl exampl class class improv perform preliminari experi train data call stratifi sampl kubat kubat al found stratifi sampl significantli improv manc highli skew catlett report mix result boost popular techniqu combin multipl tree maclin chose bag modif bag tree stratifi simpler appli bag algorithm complic boost algorithm analog modif requir boost perform task experi learn extract section present experi experi establish baselin perform configur section bag gener randomli sampl train equal number sampl class experi vari number tree experi vari ratio class experi vari size random sampl turnei baselin configur bag tree train random sampl train equal sampl class manc measur averag desir number phrase set averag corpu sum averag divid number document individu document number match divid desir number phrase match determin iter stemmer figur show baselin perform desir ber extract plot show test data model gener aliweb nasa journal model gener fip corpu tabl slope curv fip corpu statist anomali figur show ter slope fip experi modifi stratifi sampl slope unusu figur experi baselin learn algorithm extract tabl show time requir train test baselin configur time includ gener featur vector randomli sampl vector tabl experi train test time baselin configur corpu tabl show phrase select baselin configur journal articl test subset desir number phrase set phrase bold match stem algorithm number document experi test hypothesi bag improv perform task automat extract figur show desir number phrase set number tree set total time averag time train journal email total time averag time journal email test aliweb nasa fip total time corpu fifti tree averag time corpu tree total time corpu fifti tree averag time document fifti tree tree routin written quinlan wrote featur vector gener routin random sampl routin code carefulli written speed code written execut pentium ii run window nt duplic document due limit iter stem algorithm tabl duplic kind format featur vector section vector uniqu stem phrase turnei tabl experi exampl select phrase articl base rate base rate ecolog probabl top base base rate rate probabl cell assembl evid process word brain cell event relat gamma lexic power spectral synchroni top cell cognit brain word cell evolut motor system top cognit modern cognit psycholog rise number tree except fip corpu note experi difficulti iz journal articl train data fip test data tabl test rise pair tabl show test tree significantli desir ber phrase set case tree significantli tree fip collect experi test hypothesi stratifi sampl kubat handl skew class distribut figur show percentag exampl class exampl set fall percentag corpu learn algorithm extract figur experi effect vari number tree tabl experi comparison tree tree number document journal email aliweb nasa fip number phrase averag standard deviat tree tree confid turnei tabl experi comparison posit exampl posit exampl corpu figur experi effect vari percentag class number document journal email aliweb nasa fip number phrase averag standard deviat class class confid tabl show test collect drop sampl posit compar email collect benefit balanc sampl class learn algorithm extract reject hypothesi stratifi sampl kubat data preliminari experi train data suggest stratifi sampl hypothesi support test data experi test hypothesi sampl train data result larger sampl figur show sampl size sampl size except email messag corpu fip web page corpu figur experi effect vari sampl rate tabl test pair tabl show test collect sampl rate yield sampl desir number phrase set support hypothesi small sampl size bag larg sampl bag work combin model heterogen turnei sampl size make el homogen corpu tabl experi comparison sampl rate sampl rate number document journal email aliweb nasa fip number phrase hybrid genet algorithm extract experi wai appli automat extract section present experi algorithm learn extract phrase achiev learn algorithm discuss section main insight gain work achiev perform domain find emb special procedur domain knowledg extract rithm motiv develop algorithm averag standard deviat sampl rate genet algorithm extractor extract algorithm extractor document input produc list output extractor twelv paramet determin process input text paramet extractor tune sampl rate confid learn algorithm extract genet algorithm maxim perform train data tune longer train cess complet paramet discard learn system call train system call extractor minu extractor conceptu descript extractor algorithm describ extractor abstract level ignor effici actual extractor softwar essenti effici implement algorithm twelv paramet small capit tabl list ten step extractor find singl make list word input text drop word charact drop stop stop word list convert ing word lower case stem word truncat charact advantag simpl form stem speed flexibl stem truncat faster porter stem algorithm aggress stem adjust ing control level aggress score singl uniqu count stem text note stem word tenth word posit assign score stem score number time stem multipli factor stem extractor written demonstr version extractor demonstr version train user make adjust turnei multipli frequenc stem multipli frequenc typic greater frequent stem receiv high score rare stem receiv low score control weight earli occurr versu weight frequenc select top singl rank stem order score make list top singl stem cut list list arbitrari improv effici extractor act filter elimin lower qualiti stem find stem make list phrase input text phrase defin sequenc word consecut stop word punctuat stem phrase truncat word phrase charact phrase word rare extractor consid phrase word score stem stem count stem phrase text note assign score step paramet make adjust base number stem phrase stem stem multipli score stem multipli score typic greater learn algorithm extract ment score longer phrase phrase stem necessarili frequent frequent singl stem phrase factor design boost score longer fact longer phrase expect lower score shorter phrase expand singl stem list top singl find highest score stem phrase stem singl stem result list stem phrase list order score calcul step singl stem expand stem longer score calcul step score stem phrase replac score singl stem reason adjust score introduc step expand singl stem stem compar rank stem phrase drop list top stem phrase cate singl stem expand stem phrase delet duplic rank list stem preserv highest rank phrase stem truncat posit list top singl stem truncat tenth posit stem expand stem find ari truncat tenth posit list stem phrase delet phrase tenth posit list fewer stem phrase add remain stem find frequent turnei phrase input text ten time text frequent phrase stem phrase count frequenc phrase end frequenc phrase set end adject tive middl phrase word phrase end adject penal phrase frequenc phrase set check list mon verb word noun verb includ list common word verb noun input text stem expand frequenc set end frequenc set list common presenc input text boost score stem measur step likelihood output add phrase suffix find defin word find number capit capit inconsist capit inconsist word capit pattern proper noun word proper noun capit made consist capit learn algorithm extract lowest number capit made inconsist capit made consist capit phrase word text word text number inconsist made final order list lower phrase suffix ad list order score calcul step score phrase base score highest score singl stem phrase length list due step form final output phrase list phrase start output phrase pass phrase output reach end list test phrase capit proper flag set proper suppress proper phrase end phrase longer length measur ratio number charact candid phrase number ter averag averag calcul phrase input text consist consecut phrase shorter rank list candid phrase top list phrase fail test capit phrase turnei word commonli phrase match phrase list stop phrase mean equal ignor includ phrase pass test test procedur capit suffix compar step screen test step base capit suffix step essenti output human reader genet algorithm view method optim string niqu inspir biolog evolut genet algorithm work set bit call popul individu initi popul randomli individu bit creat randomli chang exist al oper call combin substr parent make children oper call individu assign score base measur qualiti bit respect task fitter individu children fit individu genet algorithm individu tend increasingli asymptot genet algorithm contrast genet genesi gener gener genet algorithm updat entir popul result sequenc distinct gener genet algorithm updat popul individu result continu chang distinct ation typic individu replac fit individu current popul sourc code learn algorithm extract whitlei suggest genet algorithm tend aggress greater select gener genet algorithm paramet extractor set standard machin learn paradigm learn algorithm tune consist document pair target list dataset divid train test subset ing process involv adjust paramet maxim match output extractor target train data success learn process measur examin match test data assum user set desir number fifteen set remain ten paramet set binari string bit ten shown tabl run popul size trial default trial consist run extractor paramet set binari process entir train set fit measur binari string base averag train set final output highest score binari string ti broken ing earlier string averag train set fit discov achiev high averag adjust paramet phrase output modifi fit measur penal phrase total number match human total number phrase output number document train set paramet number turnei tabl twelv paramet type rang paramet penalti penalti factor vari effect number fit penalti phrase output equal desir number phrase penalti grow approach squar gap desir number phrase actual number phrase preliminari experi train data confirm fit measur led find paramet valu high averag ing phrase output modifi learn ness measur base stem truncat fit measur base stem chang chang ent actual output list remain constant fit measur iter stemmer paramet type ran select bia mutat rate paramet rang number bit integ integ real real real integ integ integ real real integ boolean total number bit binari paramet set user desir paramet set time learn algorithm extract default set adapt mutat oper reduc gate crossov oper adapt mutat determin level mutat child ham distanc higher mutat rate reduc surrog crossov identifi posit parent string differ crossov point occur posit comparison extractor featur vector show learn essenti featur set algorithm access learn kind model differ set phrase share stem set phrase share stem member set identifi share stem repres phrase set member adjust aggress adjust stem train data design yield high accuraci design yield high high necessarili correspond high accuraci model set valu add step winnow phrase select step path lead algorithm rithm discuss section adjust stem procedur step path lead turnei select top probabl featur estim probabl sensit tune extractor differ desir output desir number gener phrase ing perform measur averag defin equat ensur boost score gener fewer phrase user request number match desir number phrase number match actual number phrase experi learn extract set experi compar figur compar baselin configur configur fair configur test advantag inform test data perform good afford gener figur show averag test desir number phrase set tabl test differ configur tabl show test collect significantli case perform perform tabl show train test time gener fewer randomli select phrase phrase perform note fit measur evalu perform corpu learn algorithm extract figur comparison tabl comparison number document journal email aliweb nasa fip number phrase averag standard deviat confid reproduc compar time tabl unlik train separ valu comparison turnei slower faster train time corpu tabl present exampl phrase select set match author iter stem bold experi human evalu obviou phrase good bad algorithm corpu desir number algorithm corpu number percentag gener accept human experi suggest answer question extract accept human reader tabl train test time number document total time averag time train journal email total time averag time journal email test aliweb nasa fip total time corpu valu averag time corpu total time corpu averag time document learn algorithm extract tabl experi exampl select phrase articl base rate base rate ecolog probabl top base base rate probabilist inform cell assembl evid process word brain cell event relat gamma lexic power spectral synchroni top cell cognit evolut motor system top creat demonstr web demonstr user enter url process softwar download html url send extractor extractor paramet valu learn train set discuss web page extractor paramet learn email messag corpu web page word extractor paramet learn journal articl corpu shown rate left call number fix interfac simpl part interfac shown figur visitor web site rate gener web page delet log rate rate nrc rate web page guag english current version time work turnei figur illustr interfac extractor user enter url result displai user rate qualiti rate document left evalu web summar tabl tabl human evalu automat gener web page number number number maximum document accept interpret data support hypothesi averag mean voter anonym ip reward vote reason give inform instruct voter word plai figur discuss learn algorithm extract present approach task learn extract text approach appli tree induct algorithm bag stratifi sampl kubat experi support claim bag stratifi sampl experi led suspect algorithm form algorithm approach genet algorithm tune paramet extract algorithm present rithm experi support claim perform standard benchmark machin learn research evalu perform classif algorithm effort appli interest examin altern machin learn algorithm contrast compar domain knowledg type domain knowledg implicit design featur vector involv amount domain knowledg stratifi sampl incorpor kind domain knowledg type domain knowledg declar type procedur algorithm embodi declar procedur domain knowledg embodi essenti declar kind featur relev detect special detail procedur domain edg stratifi sampl task turnei ten step extractor algorithm intend ical extract applic avoid special procedur domain knowledg result support view special procedur domain knowledg valuabl learn extract text mention earlier section time submit frank al develop bayesian approach extract includ procedur domain form final oper candid elimin candid higher score frank al compar includ oper corpora subset found statist differ algorithm result support import special procedur domain knowledg result suggest amount procedur domain knowledg requir good perform task smaller suspect percentag match good measur compar tion algorithm compar document extract number captur subject qualiti phrase human evalu qualiti suggest qualiti futur work limit limit approach author avoid bore reader repetit repetit major clue ture tabl candid phrase result significantli improv ad kind synonym detect tion algorithm learn algorithm extract extractor current version time work document work ing spanish korean work ad sentenc extract addit exist phrase extract capabl marsh johnson salton kupiec jang result support claim special procedur domain knowledg valuabl learn extract text extract algorithm incorpor special knowledg perform significantli algorithm knowledg extractor make list averag journal articl quarter speed extractor make applic econom feasibl subject human evalu gener extractor suggest accept human reader level perform satisfactori wide varieti applic acknowledg anonym inform retriev comment paper elain sin calgari creat email messag corpu softwar suggest user feedback mechan illustr figur leagu nrc ottawa tive critic refer turnei lr automat electron public sentenc select inform process arc classifi technic report statist california berkelei bag predictor machin stratifi sampl improv learn shop knowledg discoveri michigan assess credit card applic machin learn ieee fall machin learn larg phd depart comput sydnei phrase structur queri inform retriev annual intern acm sigir confer research develop inform pp acm sampl field william kruskal judith intern encyclopedia statist free press hp method automat extract journal associ jl experi automat phrase index document comparison syntact method phd depart comput cornel report york method learn methodolog issu analysi compar studi intern workshop artifici ft pp bj automat automat assign ing classif free index journal cg learn algorithm extract extract sixteenth intern joint confer artifici intellig pp morgan kaufmann da probabl theori applic press experi boost algorithm machin thirteenth intern confer pp morgan kaufmann unifi approach automat index inform retriev ieee jj guid genesi technic report comput scienc jj optim control paramet genet algorithm ieee tion improv digit librari index support system press sh develop document summar system tive inform servic riao confer inform search pp canada ap applic linguist ing automat abstract gener journal document text view morpholog infer process sixteenth annual intern acm sigir confer research develop inform learn user inform interest extract semant phrase hearst aaai spring machin learn inform access aaai press descript sra system sixth messag understand confer morgan kaufmann turnei machin learn detect oil spill lite radar imag machin trainabl document summar ea annual intern acm sigir confer research develop inform pp acm statist learn approach automat index index term journal american societi inform jb develop stem algorithm mechan translat tional hp automat creation literatur abstract ibm journal research empir evalu bag boost fourteenth nation confer artifici intellig pp aaai press product rule system messag american associ artifici pp aaai press adapt extractor text annual confer canadian associ inform scienc pp messag understand confer morgan kaufmann fourth messag understand confer morgan kaufmann messag understand confer morgan kaufmann sixth messag understand confer morgan kaufmann compound kei word gener document hierarch learn algorithm extract cluster art model intellig data elsevi extract index word manual riao confer inform search pp canada cd construct literatur abstract techniqu prospect tion process pa identif import concept highli structur paper annual intern acm sigir confer research develop inform pp acm mf algorithm suffix strip autom librari inform jr tree probabilist classifi fourth intern workshop machin pp morgan mann jr probabilist tree kodratoff rs machin artifici intellig volum pp morgan mann jr program machin learn morgan kaufmann jr thirteenth nation enc artifici intellig pp aaai press syntact approach automat book index annual meet associ comput pp acm automat theme summar text trainabl modul inform extract journal artifici intellig sparck index exhaust journal american societi inform export statist analysi topic languag turnei casei symposium document analysi inform pp pd extract evalu algorithm nation research institut inform technic report pd learn extract text nation research institut inform technic report algorithm select pressur nation confer genet algorithm pp morgan mann
HCI/60 4 nomad scaleabl contextu notif wearabl audio messag sawhnei chri schmandt speech interfac mit media laboratori ma abstract mobil worker seamless access commun inform servic portabl devic current solut overwhelm user ambigu notif describ scaleabl auditori techniqu contextu notif model provid time minim interrupt user action influenc local adapt model techniqu demonstr nomad wearabl comput platform keyword auditori passiv wearabl adapt notif introduct todai peopl number applianc portabl devic varieti task workplac run devic ubiquit plai uniqu function role user devic notifi user function incom messag except condit typic offic user attend plethora devic notif call asynchron messag email notif desktop remind person organ watch scenario pose number kei problem lack differenti notif cue devic uniqu form notif distinct auditori cue cue gener binari convei occurr notif urgenc dynam state prevent user make time receiv messag shift focu attent primari interact devic access relev inform minim awar user environ notif occur regard user engag current activ focu attent interrupt annoi disrupt user task flow thought prevent undu embarrass social user typic turn pager meet lectur prevent user notif time messag frustrat peopl touch learn prior interact user system typic mechan adapt behavior base posit neg action user pager continu stop ring fact user ignor devic time lack coordin notif devic compet user attent coordin synchron notif notif occur short time user frustrat peopl start carri portabl frequent interrupt inhibit daili task interact social environ devic fail serv intend notif oper effici manner major life cycl user adopt observ obviou problem encount usag current user tend turn devic inhibit optim oper person devic natur interrupt workplac recent observ studi evalu effect interrupt activ mobil workplac defin asynchron initi result recipi discontinu current activ result reveal kei issu acm sigchi confer human factor comput pennsylvania copyright acm subject interrupt time averag durat slightli minut minut hour spent interrupt major interrupt occur due telephon call email pager activ analyz recipi receiv benefit interact suggest blanket approach prevent hold call time prevent benefici interact occur recipi resum work prior activ commun technolog make user easili vulner undesir interrupt interrupt constitut problem mobil tool disrupt activ improv synchron access tool benefit initi leav recipi control interact studi suggest develop improv filter techniqu dont requir attent user disrupt interrupt move interrupt asynchron messag store retriev deliveri time nomad wearabl audio messag person messag demonstr nomad simpl constrain problem domain develop evalu contextu notif model messag requir develop model dynam select suitabl notif strategi base messag usag context system infer user attent monitor current activ interact devic room user prior notif adapt notif time techniqu scaleabl auditori present approach contextu notif recent project util speech audio wearabl devic present inform prototyp augment audio tour guid plai digit audio record index spatial locat visitor museum enabl user perform data entri retriev speech recognit synthesi audio aura explor background auditori cue provid serendipit inform coupl peopl physic locat workplac nomad user infer context actual locat decid deliv scaleabl audio notif recent paper research suggest sensor user model wearabl infer user interrupt incom messag suggest wait break post messag summari user displai paper describ primarili approach provid time inform nomad base varieti contextu cue nomad radio wearabl comput platform unifi interfac remot servic messag voic person calendar event messag automat download devic dai user voic command tactil input system consist client remot server commun wireless util telephoni infrastructur speech interfac group simultan spatial audio stream render java audio api speech provid network implement watson speech api figur primari wearabl audio messag unifi manner auditori cue spatial audio interfac control voic tactil input provid interfac nomad system primarili oper wearabl devic research prototyp patent nortel adapt primari wearabl platform nomad radio consist direct speaker mount user direct microphon chest figur inform feedback provid user combin auditori spatial audio synthet speech integr varieti auditori techniqu wearabl devic access navig lightweight express notif interfac incorpor nomad network infrastructur unifi messag develop wearabl access system oper pc worn user kei issu address paper handl interrupt listen manner reduc provid time notif contextu relev messag usag notif scenario scenario demonstr audio interfac present notif nomad radio voic command user shown pm jane wear nomad radio meet confer room minut system earli notif auditori cue synthet speech schedul event pm motorola sponsor confer room jane scan email messag hear meet check group messag arriv group messag chri schmandt lost jane ignor messag head confer room jane inact time level room system scale notif incom messag moment time messag arriv email jane level lower system plai auditori cue gradual speed background sound water jane hear summari jane meet prevent system plai summari press button nomad radio speak avoid interrupt sound water slow messag playback abort system recogn jane busi turn notif level futur messag hour pm meet system sleep mode import voic messag jane daughter arriv recogn prioriti messag high level low plai auditori cue notifi jane ambient sound briefli begin plai preview messag jane hear daughter voic immedi press button plai messag system start plai full voic messag foreground earlier comput latenc time kathi pick earli school jane meet email nomad radio walk back car kei figur scenario show jane nomad radio listen notif engag task scaleabl auditori present scaleabl present deliv suffici inform minim interrupt listen messag nomad radio scale dynam unfold level notif figur ambient auditori messag full foreground render silenc interrupt conserv mode auditori cue speech feedback messag scale silenc messag prioriti infer low messag relev playback awar base recent usag devic level mode serv conserv power memori resourc portabl devic wearabl comput ambient cue awar nomad ambient auditori cue continu plai background provid awar oper state system ongo statu messag download figur sound flow water form ambient awar system activ sleep sound fade perceptu background short distract listen pitch file momentarili foreground ambient sound short messag sound audio summari heard faster flow water download implicitli messag size addit audio cue prepar listen hear messag awar minim cognit overhead monitor incom messag rel notif plai distinct auditori incur higher cost attent part listen relat work auditori awar simul bottl repetit stream sound peopl track function run machin sound peopl overlook auditori problem machin sound distinct alert sound auditori cue sound plai merg auditori peopl hear plant complex integr process background sound explor prototyp applic notifi user file share activ cohen found pink time consid user understood pitch correl preliminari reaction wave sound consid posit audio aura alarm sound elimin number coher sonic map event music feedback techniqu passiv convei number email messag ident abstract group activ auditori cue notif identif nomad auditori cue crucial mean convei notif provid assur interfac type auditori techniqu provid distinct awar messag inform feedback cue type audio cue feedback number oper event nomad task complet confirm button speech connect finish plai messag mode transit switch ambient mode except condit messag lost connect error prioriti cue notif relat formul stream short sound indic sender content flag keyword nomad messag prioriti infer email content filter distinct auditori cue import messag auditori cue telephon ring voic extract sound station identifi summari identif repres approach easi identif sender base uniqu auditori signatur person creat manual extract audio sampl voic messag caller associ respect email login email messag system queri relat person plai user prioriti cue author found remark effect method quickli convei sender messag short durat techniqu reduc synthet speech distract figur dynam scale incom voic messag life cycl base interrupt listen messag present vari subtl auditori cue foreground present figur ambient auditori stream download incom messag audio cue prioriti identifi sender messag foreground spoken synthet speech silenc ambient auditori preview full bodi foreground summari auditori cue messag prioriti messag summari gener spoken descript incom messag present relev inform manner descript typic util header inform email messag convei sender subject messag nomad messag summari gener includ calendar event summari augment addit attribut messag indic durat audio voic messag system plai audio identifi caller urgenc infer inton caller voic station identifi summari messag preview content summar messag scale listen quickli preview content email voic messag nomad preview text messag extract charact messag default size user heurist gener suffici context listen anticip messag theme urgenc email redund header previou repli elimin preview effect extract text summar base tool develop british flexibl mean scale messag content natur languag techniqu permit scaleabl summari arbitrarili larg text document preview audio sourc voic messag broadcast present messag gradual playback rate time faster normal rang techniqu speech modifi playback rate make audio content summar requir structur descript base annot automat determin speaker topic auditori thumbnail function similar visual counterpart preview structur voic messag provid pertin aspect caller phone structur preview heard headlin full plai complet messag content mode plai entir audio file read full text messag origin playback rate text elimin redund header inform format tag messag augment summari inform indic sender subject messag gener spoken plai background listen audio space foreground render spatial proxim import messag plai foreground listen space audio sourc messag rapidli move closer heard plai durat messag gradual begin fade move back origin posit amplitud remain durat foreground algorithm ensur messag quickli brought perceptu focu pull listen rapidli messag push back slowli provid easi fade effect heard messag move spatial direct maintain listen retain focu audio sourc begin plai rang techniqu provid scaleabl form background auditori spoken feedback foreground render incom messag contextu notif nomad context dynam scale notif incom messag primari contextu cue messag prioriti email usag level base time user likelihood estim realtim analysi auditori scene experi paramet provid suffici context scale data motion locat sensor integr model linear scaleabl auditori notif model base notion estim cost interrupt inform deliv user approach similar recent work perceptu cost focu attent model scaleabl graphic render messag prioriti prioriti incom messag explicitli determin email filter clue filter priorit system clue integr nomad radio determin time natur messag find correl user record outgo messag phone call rule integr static rule creat user priorit specif peopl messag subject email messag keyword sender subject header inform correl static gener filter rule assign prioriti messag email messag priorit user travel meet geograph area area code current prioriti time prioriti logarithm scale prioriti rang logarithm scale ensur higher prioriti messag weight higher rel unimport messag prioriti log log level max usag level user interact devic determin usag level user engag voic command system messag inclin hear notif speech feedback user action activ timer compar time action default valu state transit clock tick messag time arriv compar action time scale base sleep time high usag valu closer messag arriv sleep time assign usag level logarithm scale ensur varianc usag valu recent action rel usag level comput durat closer sleep time user respond effect notif delai minut idl time log current time action time usag time idl time log time problem action set usag level user deactiv annoi action neg reinforc continu usag level relat notif neg action stop audio playback deactiv speech exclud gener action comput usag likelihood environ gaug user social context interrupt system detect occurr speaker period indic situat figur bottom panel show telephon ring speech utter top panel output probabl hmm train speech correctli identifi auditori event detect adapt threshold total energi incorpor constraint event length surround system coeffici pitch estim varieti speech sound hmm markov captur tempor characterist spectral content sound event techniqu featur extract classif auditori scene hmm recent workshop paper likelihood speech detect environ comput event short window time probabl recent time period window consid relev comput speech level evalu classifi effect train varieti speaker background sound notif level weight averag contextu cue notif level level level proport relationship notif lower notif provid high notifi level wt wt wt weight usag level notif level translat discret scale plai messag notif full audio silenc notifi level comput compar threshold scale plai messag appropri notifi level max scale produc threshold greater rang accommod notif level comput vari interrupt reason notif scale messag threshold level log log level max notifi level threshold level assign notif scale notifi level max present latenc latenc repres period time wait plai messag notif cue deliv latenc comput function notif level maximum window time max lowest prioriti messag delai playback default maximum latenc set modifi user latenc notifi level latenc max higher notifi level shorter latenc messag playback vice versa import messag plai group messag plai arriv high usag low latenc primarili user suffici time interrupt deactiv undesir messag plai dynam adapt notif model user initi set weight notif model low weight set select experi notif time interact visual messag paramet observ modifi weight infer effect notif base weight strategi weight provid approxim behavior model bootstrap system novic user system user dynam adjust weight interrupt notif implicit action plai ignor messag system local posit neg reinforc weight monitor action user notif messag system plai auditori cue comput notif level threshold auditori cue comput latenc interv wait plai summari preview messag user request messag plai earlier abort notif messag speech button command weight reduc fix percentag neg reinforc user activ messag playback scale select user weight messag chang made messag remain activ user action continu influenc weight figur adapt notif weight base jane action listen messag figur show zoom view extend scenario introduc jane action reinforc model jane receiv messag group messag recent person messag weight remain jane interrupt time messag abort playback reduc weight futur low prioriti notifi jane voic messag prompt jane reinforc messag plai weight jane notifi group messag shortli voic system detect higher usag activ system correctli scale notif jane bother notif scale jane start system messag effect notif model natur awar notif wearabl devic requir usag evalu conduct ongo basi predict effect notif model evalu quantit basi messag notif paramet captur analysi actual exampl notif comput email messag prioriti figur show auditori cue gener group messag mon apr sec messag group notifi audio cue figur notif comput group email user heard auditori cue time messag figur receiv greater prioriti higher notif level summari playback moder latenc time chosen user interrupt notif button summari playback abort user action reduc weight mon apr sec messag time notifi full bodi comput ms kei server stop audio undesir interrupt reset activ reduc figur notif level latenc comput time email messag user action stop audio plai reduc current weight continu local reinforc time system reach state stabl robust converg user prefer notif user action primarili adjust weight subsequ effect reinforc learn requir model gener notif polici maxim measur reinforc focu futur work action neg posit preliminari evalu author refin techniqu system preliminari evalu conduct novic prior experi mobil phone pager user listen notif attend task parallel read type manag casual discuss hear prefer turn audio import meet advisor peopl nearbi found spoken feedback distract heard cu wait interrupt user volum devic lower minim disrupt maintain privaci messag user request automat volum gain adapt level contrast user found unfold present ambient auditori cue suffici time switch attent incom messag familiar auditori cue prefer longer gradual notif distinct auditori tone prioriti cue indic provid obviou benefit actual prioriti messag import simpli present manner user suggest weav messag prioriti ambient audio found auditori scheme prefer simpl notif consist ambient spoken text user stress ambient audio provid benefit requir cognit effort hear ambient audio time remain reassur system oper unintend effect discov audio stream low batteri power wearabl devic button hold messag particip subtl period auditori alert unread messag wait queue user felt nomad radio provid awar express qualiti justifi pager trial nomad user valid notif techniqu demonstr techniqu scaleabl auditori present messag notif varieti contextu cue auditori techniqu notif model refin base continu usag conduct addit evalu user ongo work explor adapt notif model base reinforc user behavior time effort wearabl audio idea readili util consum devic pda mobil phone minim disrupt provid time inform user move acknowledg brian clarkson ongo work audio classifi stefan marti user evalu lisa fast andr van nortel support project refer benjamin audio augment prototyp autom tour guid chi pp sawhnei alex pentland auditori context awar wearabl workshop perceptu user nov monitor background activ auditori auditori interfac read david deal interrupt chi effect sound complex simul chi april eric approach graphic render uncertainti artifici aug pp scott ian smith electron mail preview audio chi april pp lp ml reinforc survei journal artifici intellig vol pp matthew chri schmandt dynam person messag filter cscw pp novemb elli jb design audio aura chi april mobil speech system icslp chri schmandt speak listen design wearabl audio comput intern symposium wearabl octob augment realiti wearabl comput vol august pp
IR/61 5 multimedia content descript scheme applic ana benitez chang qian huang john lawrenc bergman charl abstract imag advanc laboratori depart electr engin columbia west mc ny describ descript scheme home archiv content standard aim creat multimedia content descript standard order facilit multimedia search filter applic design special care provid simpl power structur repres gener multimedia data extens markup languag illustr exemplifi dss flexibl advantag main compon multimedia descript scheme featur object code modal transcod home media descript instanti dss semant featur physic semant object hierarchi archiv descript scheme aim describ collect multimedia dss aim individu multimedia document archiv descript content archiv repres multipl hierarchi relat graph hierarchi specif case graph relat explicitli includ hierarchi structur dss natur defin composit effici structur structur demonstr feasibl effici descript scheme present applic structur greatli benefit applic visual multimedia broadcast storytel imag meta search metaseek multimedia descript multimedia home archiv introduct past multimedia content digit format increasingli import develop system author organ inform knowledg deriv mass inform improv current applic enabl excit effici manag multimedia multimedia content standard aim satisfi standard framework descript content standard effort divid step work descriptor descript scheme descript definit languag code descript descriptor repres featur data content descript scheme structur semant group descript scheme descriptor descript definit languag descript scheme descriptor scheme code descript satisfi compress transmiss requir improv current multimedia applic enabl excit exampl distribut content person effici multimedia content paper present descript scheme imag video multimedia home media archiv content meet requir outlin multimedia descript scheme gener target specif home media archiv dss applic orient deal special content function descript scheme independ descript definit languag extens markup languag implement xml motiv recogn intuit readabl support add power featur descript scheme present descript xml intend illustr descript scheme goal multimedia descript scheme describ singl content video multimedia share fundament featur object multipl level modal code download content document repres set object relat object object group media visual tempor semant featur featur includ descriptor point extern extract similar match code relat object object hierarchi graph object hierarchi incarn concept multipl level abstract modal transcod termin capabl palmpilot receiv content resolut modal multimedia descript scheme develop gener applic home media descript scheme dss instanti home media applic semant object featur physic semant object hierarchi satisfi requir home media applic contrari archiv descript scheme structur describ collect content video multimedia previou dss multimedia archiv repres multipl hierarchi cluster group object individu content document archiv base media featur object featur categori media gener relationship cluster express multipl graph archiv ds descript scheme includ hierarchi graph hierarchi specif case graph show hierarchi instanti graph relat entiti decid explicitli includ hierarch structur dss hierarchi natur defin composit effici structur structur demonstr util descript scheme respect impact applic system develop applic system capabl critic depend multimedia descript applic visual imag classif system video search multimedia broadcast browser storytel metaseek meta search engin mediat multipl search engin inform paper organ section briefli discuss descript scheme uniqu address requir specif role xml perform describ provid present applic scenario home archiv descript scheme section section section section section basic compon dss hierarchi depth simplest imag ds explan extend dss referenc back imag ds summar kei point descript scheme open issu futur research section design principl goal descript scheme design address requir descript visual content explain design satisfi focu specif requir flexibl extens address xml satisfi gener requir descript scheme satisfi criteria state dss fundament entiti describ multimedia content defin dimens object describ imag group video group segment object describ group primit object base semant visual featur type featur level object visual featur adequ object physic compon semant featur appli object level dss provid effici framework accommod type multimedia content featur domain present applic structur greatli benefit system visual content search filter system applic dss gener support broad rang applic dss cover varieti multimedia content video multimedia home media multimedia collect flexibl dss achiev part dss effici categor featur cluster object index support effici download extern featur descriptor execut code element defin dss deriv element domain home media descript simpli extend featur set type object hierarchi video descript scheme uniqu aspect dss capabl defin multipl abstract level base arbitrari set criteria object hierarchi criteria term visual featur size semant relev relev user interest servic qualiti media tempor featur dss minim set featur object graph addit object featur easili ad modular flexibl type object hierarchi graph defin similar fashion extens markup languag flexibl extens requir critic widespread accept applic domain xml satisfi histor overview xml lead justif present sgml gener markup iso standard languag defin document format sgml document describ grammar tag set document structur relationship tag repres full sgml option featur web applic proven complex current vendor web browser world wide web consortium creat sgml work group build set specif make easi straightforward benefici featur sgml web call xml markup retain kei sgml advantag languag design vastli easier implement full sgml major advantag xml descript combin descript structur descript format document xml capabl import extern structur descript featur multimedia descript scheme highli modular extens section imag descript scheme present imag descript scheme imag descript section clarifi shown figur figur show descript imag imag imag object object graph figur show graphic imag descript scheme uml notat imag descript imag repres set imag relat object hierarchi graph object multipl featur link extern extract similar match code featur categor semant featur object organ multipl object hierarchi relationship object multipl graph multipl level abstract index view object larg imag base semant featur implement object hierarchi special media featur modal transcod user termin specif cellular phone comput connect access imag content adequ modal resolut explain diamond symbol repres composit relationship rang element repres frequenc composit relationship mean mean compon remaind section describ visual structur imag classif person imag object featur format jpg columbia color color histogram media featur peopl person person spatial object hierarchi figur descript imag descript scheme imag object set imag object person imag figur uml imag descript scheme imag ds figur imag element repres imag includ imag object set element object hierarchi element graph hierarchi special case graph entiti relat relationship explicitli includ hierarchi ds hierarchi effici structur retriev photo graph left shake hand visual featur refer semant featur object hierarchi object node refer person person entiti node entiti relat graph entiti relat relat hierarchi natur defin composit object built hierarch structur separ definit object structur describ relationship object flexibl gener object hierarchi graph includ object featur node object hierarchi duplic featur object hierarchi graph mechan identifi node hierarchi graph object object defin includ relat hierarchi extract object relat object stage permit distribut process imag content imag object object set imag object refer arbitrari region continu discontinu space figur object continu region object multipl region separ space distinguish local object global global object featur common entir local object featur section imag global object repres entir imag treat imag object object set share relat earli stage develop imag ds type physic object logic object decid remov categor distinct gener identifi type object visual object defin visual featur red color media semant object defin combin media featur type object determin featur describ object type object ad type object deriv gener object make inherit relationship current specif ddl meet support inherit shown figur set imag object element imag includ object set element object element uniqu identifi imag descript identifi type object express attribut object id object chosen describ imag figur list xml text comment html photograph person person peopl object featur imag object featur element group featur base inform convei figur media visual semant featur tabl compil list featur featur class note semant featur text annot featur annot talk home ds section tabl featur class featur featur class featur semant text visual orient media file file color data file modal date creation featur element imag object includ descriptor select descriptor visual featur shown tabl specif descriptor includ link extern extract similar match code import imag ds includ number featur object extens modular tabl exampl visual featur descriptor featur descriptor color color domin color coher visual color textur edg direct dct coeffici visual textur shape bound binari polygon fourier orient xml show featur descriptor includ imag object express featur global object figur semant featur media featur visual featur color histogram object concept semant categori shown global photograph columbia outdoor jpg object hierarchi imag object hierarchi organ imag object object set base media visual semant combin object hierarchi tree object node refer imag object object set describ object hierarchi section includ illustr object hierarchi build index hierarchi gener level descript hierarchi impli relat child node parent node relat type depend object featur media spatial object hierarchi figur describ visual creat visual featur figur show exampl object hierarchi hierarchi base semant featur hierarchi base color shape featur defin region object satisfi color shape hierarchi combin featur built satisfi requir broader rang applic system earlier phase develop process imag distinguish physic logic object decid similar index hierarchi base combin semant featur section capac gener specif type hierarchi inherit relationship person object hierarchi peopl person face region figur exampl type hierarchi object hierarchi shown figur object hierarchi tree object node object hierarchi includ option string type thesauru provid valu attribut type applic type hierarchi deal left open text object node refer object object set object point back object node refer link mechan effici object object set object node object vice versa object node refer object uniqu identifi object node element includ uniqu identifi form attribut includ object uniqu identifi object point back object node referenc spatial object hierarchi figur express xml object spatial hierarchi photograph person person remind describ object hierarchi build index hierarchi gener level describ larg imag satellit main problem describ retriev object imag effici scalabl frequent structur solv issu index hierarchi figur show imag object index hierarch base size featur creat index creat multipl index hierarchi criteria involv multipl featur object describ index hierarchi cluster object base select semant featur procedur similar cluster imag visual inform retriev engin object larg imag assign imag object object set featur intermedi node object hierarchi repres imag object includ condit constraint skin tone shape face region group object level imag descript includ index hierarchi requir part descript definit index imag figur express xml featur intermedi node object hierarchi provid indic type object hierarchi descript object real object imag object intermedi node hierarchi object figur object larg imag lake satellit index hierarchi object base size tabl object resolut layer resolut layer object continu figur defin level abstract base size object figur tabl abstract scheme scalabl method size size size retriev view object imag approach repres multipl abstract level base featur semant class graph hierarch structur adequ retriev relationship object express tree structur descript scheme specif complex relationship object graph graph graph entiti node relat tabl list type relationship exampl defin specif type provid gener structur custom applic inherit relationship graph figur describ spatial semant hand object object imag relat type tabl exampl relat type relat relat spatial direct top bottom left upper left upper lower left lower topolog adjac neighbor semant rel belong part relat consist figur show imag ds specif graph graph includ set element option uniqu describ bind express graph valu type thesauru entiti relat includ relat element entiti node element element relat element specif relationship entiti node element refer object object set object point back entiti node refer graph figur includ entiti relat object object entiti relat describ object posit object entiti relat describ object hand object xml implement direct entiti relat left semant entiti relat shake hand element includ element effici creat effici nest graph entiti relationship synchron media document nest relationship imag displai parallel audio video sequenc displai sequenti similar nest relationship effici describ tempor relationship object object object sequenc parallel time parallel sequenti hierarchi implement graph entiti relat relationship relationship topolog relationship tabl show hierarchi case express object hierarchi figur graph xml hierarchi shown figur describ object spatial object applic decid conveni coher implement hierarchi graph effici object hierarchi implement hierarchi applic decid graph hierarchi base specif code download descriptor type imag ds includ link extract similar match shown xml link provid mechan content sourc proprietari descriptor search filter effici archiv descript motiv code download mechan intend metaseek section descriptor descript scheme includ descriptor code inform extract similar match code descriptor code element includ pointer execut file descript input output paramet execut code inform type languag java version code defin attribut code element includ descript tamura textur featur specif featur valu link extern code featur extract similar match featur extract inform input output paramet provid descript gener search engin textur queri meta search engin meta search engin code extract featur descriptor result receiv search engin order gener homogen list result user section extract similar match code specif featur valu filter agent extract featur valu process show xml enabl extern defin descript scheme descriptor import combin imag ds extern descriptor kei shape featur import descript xml namespac type descriptor includ extens modular link extract code link similar code import extern shape descriptor dtd modal transcod content broadcast transmit imag content user due differ termin bandwidth user content broadcast transcod imag content media modal resolut specif termin clear imag transcod audio sequenc order receiv cellular phone import media featur includ imag ds modal transcod local object global object includ modal transcod media featur media featur media locat transcod version imag link extern transcod code descriptor point code transcod imag object modal resolut satisfi requir user termin xml audio transcod version imag object visual present visual imag classif system work visual prior work descript scheme system element structur descript object object graph automat imag classif system base set class algorithm perform classif visual user defin class build visual object detector class learn framework visual base hierarchi consist level scene object region region bat ground grass sand region region region region figur hierarchi visual origin automat segment imag instanc definit hierarchi bat class shown construct visual object detector user begin select train imag build object definit hierarchi interest recognit strategi base automat segment train imag imag automat segment region manual label user hierarchi defin figur label region train exampl comput train set featur node hierarchi spatial relationship perceptu area automat extract store data train multipl learn algorithm perform featur select yield set node visual object detector perform automat classif imag appli automat combin classifi group strategi level figur region classifi combin obtain classifi combin pass object classifi explain visual model visual map imag ds perceptu region visual imag object level hierarchi specif set featur featur semant special type object deriv gener object imag level hierarchi repres object hierarchi imag ds graph imag ds describ spatial relationship perceptu area semant label assign user gener automat classif descriptor semant annot featur entir visual model visual repres imag system adapt function descript scheme accept descript user class train exampl instanc imag descript scheme order gener visual model class visual gener descript imag hierarchi compliant imag ds video descript scheme present video ds section video ds natur extens imag ds ad tempor dimens clarifi shown figur figur present simpl video descript video object object graph uml graphic video ds video imag ds figur addit tempor featur video object discuss structur video ds system narrat video object object set video object featur librari format avi documentari columbia york durat interv transit effect narrat narrat figur descript video descript scheme semant object hierarchi basic descript element video ds video object video object extend concept imag object ad tempor dimens video object refer arbitrari region narrat er graph colleagu frame video sequenc distinguish video object repres region video entir frame video entir video object continu time space exampl video object documentari video shown figur global object repres entir video sequenc object segment object continu space time object local video object continu time space discontinu space object chosen describ video sequenc figur list xml documentari librari narrat narrat narrat object object code download video object object code download element inherit directli imag ds extens imag ds tempor tempor visual media featur relat specif video tabl tabl exampl relat featur class video ds figur show semant object hierarchi graph relat type tabl exampl relat type relat relat tempor direct immedi immedi topolog nearbi tabl featur class featur featur class featur visual edit camera motion tempor start end durat video index search system segment tool extract segment semant object video sequenc extract video object repres hierarch structur figur similar video object underli relationship visual featur relat graph semant object region level comput build visual featur librari semant object region includ time featur structur featur describ spatial tempor posit boundari region object semant annot video descript gener system shown figur accept queri form sketch exampl return similar semant object base featur figur show queri interfac queri queri featur weight semant annot order shape time shape time region object figur video object amo queri interfac queri queri featur weight map video model amo system video ds object region amo system video object video ds special class object deriv gener video object region object featur time semant object visual featur semant annot object hierarchi express spatial relationship object region graph repres structur featur object relat region amo segment system output descript segment video object compliant video ds system accept video descript compliant video ds queri input multimedia descript scheme region multimedia descript scheme aim describ multimedia content result integr multipl media stream exampl individu media stream audio natur video synthet video text caption integr multimedia stream documentari program includ text figur multimedia stream refer document exampl multimedia stream slide show set video album imag web page includ video imag multimedia ds build top individu descript includ imag ds video ds goal achiev maximum synergi dss multimedia element structur multimedia ds intuit extens imag video ds multipl stream figur show descript multimedia object object graph figur present uml show relat dss documentari narrat multimedia object featur entranc columbia uni chapel columbia narrat durat minut narrat figur descript multimedia stream descript scheme object set refer object media featur semant featur mm stream object hierarchi figur uml multimedia ds object node refer object hierarchi narrat documentari narrat graph narrat entiti node sequenti entiti relat graph entiti relat documentari narrat relat shown figur multimedia stream repres set multimedia object multimedia object refer set multimedia object exampl object audio object defin respect dss object object code download element inherit directli dss figur includ exampl object hierarchi graph rest explain compon extend imag video discuss multimedia broadcast browser structur multimedia object basic descript element multimedia ds multimedia object set multimedia object multimedia stream includ object set figur introduc multimedia object section multimedia object repres collect object audio multimedia object object belong stream bet synchron time space object hierarchi express multimedia object multimedia object distinguish type multimedia local global object global multimedia object element repres entir multimedia stream local multimedia object limit scope multimedia stream shown figur global object repres stream documentari video text object local object group object relat multimedia object multipl featur featur descriptor multimedia object includ semant tempor media specif inform object multimedia stream figur list xml object set element documentari narrat narrat object object refer type media synthet text object defin descript scheme type media object hierarchi graph import point multimedia object share structur type featur object object object figur includ object set element defin object object hierarchi narrat object multimedia object segment video object text caption multimedia broadcast system discuss applic broadcast domain domain interest distinct practic applic scenario multimedia content domain interest close relat mission due fact broadcast protocol describ content multimedia broadcast browser address domain implement java browser base uniqu integr multimedia process extract layer content integr data descript repres multimedia content briefli discuss descript scheme multimedia program system multimedia program includ video audio text caption text inform close caption automat speech program dai repres global multimedia object figur show relationship local mm mm object relat implement object hierarchi mm object main object object object fact relat object object extract program object act intellig interact agent base linguist knowledg content object construct autom multimod process understand content program consist consist set type repres set stori program mm global object dialog headlin stori commerci mm object stori stori stori commerci commerci figur relationship compon multimedia object figur figur show interact individu dss present relationship compon mm object shown figur part includ speaker content modal captur defin mm object object text object shown shade figur note object interact object relat mm object object figur show object interact object object react input audio link audio text object direct output directli relat object object creat object object object link back object make integr acoust visual interfac dialog video speaker object speaker stori summari figur relationship compon multimedia object figur relationship compon multimedia object gener descript complex mm object descript basic glue inform pull set relat multimedia spatial tempor home media descript scheme stori speaker stori bodi speaker video ds audio ds text ds text object user audio object audio speaker object dialog synthet text synthet object synthet audio mm object text paragraph object synthet video present home media descript scheme develop home media content consid home media content interest scenario due vast amount home media content gener household world clarifi home media content form video sequenc figur figur show descript home video sequenc home media ds rel lake balloon lake physic figur annot home video sequenc exampl physic semant hierarchi home media ds deriv multimedia dss includ semant featur object type object hierarchi physic semant categori object hierarchi figur summar scheme home media ds uml notat gener descript scheme multimedia content instanti furnish specif applic scenario remaind describ semant featur object hierarchi discuss storytel system benefit home media ds diagram figur show graph element compon home stream due space limit semant featur boat lake inflat night home media ds describ home media content natur human tend comment home multimedia content photograph user specif section content time region focuss describ home content author talk peopl anim object action locat event date relev call semant home video captur rel fly son beach object lake balloon son time line home media section content repres object annot categori semant featur media featur object set object tempor featur semant featur action figur uml home media descript scheme home media content segment semant categori home video object section local annot relev concept semant categori express semant featur annot special refer entiti involv action entiti relat describ action exampl semant featur section home media sequenc figur segment tempor object tempor object video sequenc captur trip lake boat tempor object shot trip arizona balloon fair tempor segment record anniversari celebr rel jersei video tempor object repres video object type segment entir video sequenc assign video object type global tempor object annot describ relev concept includ xml descript annot figur rel rel object hierarchi hierarchi refer object hierarchi object node home stream action hierarchi graph hierarchi physic hierarchi hierarchi hierarchi describ home media human describ content categori previou concept person relat concept person person older describ relationship concept object graph focu object hierarchi section home media descript includ object hierarchi physic semant figur show physic hierarchi semant physic hierarchi describ tempor spatial organ object semant hierarchi categori repres hierarch relationship concept object categori termin node hierarchi object result segment home media content local object intermedi node hierarchi assign semant concept object descript root node hierarchi assign semant categori object descript semant object set semant object hierarchi figur express xml termin node object hierarchi tempor object object semant concept semant categori assign special home video sequenc lake boat lake inflat fly rel beach rel semant categori concept rel concept video object follow appli video present home media ds appli home multimedia stream multipl media stream record event video audio imag develop home media descript scheme documentari gener storytel system present storytel system home media ds system user creat stori collect act collect shot process creation user assign descript shot media inform record camera automat process analyz multimedia classif modul storytel system modul extract relev inform categori relat annot stori identifi concept organ concept review multimedia classif system process user descript media content provid inform dimens visual classif detect hit statu lumin scene classif system combin visual textual provid natur automat face detect system gener inform dimens smart camera gp receiv intern clock provid citi date inform storytel system physic hierarchi describ stori collect act collect semant categori hierarchi index shot semant dimens gener relat shot graph storytel system provid user retriev capabl creat stori type text descript queri natur languag process modul system extract relev inform categori match semant hierarchi graph stori index hierarchi graph retriev search complet transpar user simplic clariti system design home media ds straightforward physic object semant object graph relat video object stori shot import point flexibl home ds content descript home video sequenc singl text file edit current ad search descriptor simpl modifi match word text file archiv descript scheme present archiv descript scheme archiv ds element defin multimedia dss multimedia archiv collect multimedia document imag video multimedia dss figur repres video object video sequenc archiv featur space semant subject featur semant featur visual featur color tempor media combin select uml archiv ds shown figur archiv descript ontolog element ontolog hierarchi cluster gener constraint object figur gener relat cluster repres graph remain part section focu basic compon archiv cluster relat individu multimedia graph describ impact standard archiv ds metaseek meta search engin content subject featur space scienc histori figur video object archiv space subject ontolog object art moder expr media featur semant featur media featur archiv ontolog cluster statist featur refer subject ontolog scienc art histori modern entiti node entiti relat graph figur uml archiv descript scheme entiti relat relat cluster basic element archiv descript scheme cluster cluster repres collect similar video object belong multimedia document cluster wide appli effici visual collect video textur webseek system featur cluster base semant featur statist featur cluster prove metaseek featur cluster select optim imag match user interest imag match color cluster search queri color histogram cluster summar set video object multimedia archiv base combin object featur multimedia media featur file visual featur color tempor featur durat start semant featur subject cluster includ uniqu identifi type attribut describ type object includ cluster imag video cluster inform requir constraint satisfi compon cluster featur statist media intern cluster figur exampl cluster featur class featur includ tabl tabl cluster featur class featur featur class featur media link object repres size statist moment detail xml descript cluster ontolog figur cluster group video object archiv level subject featur subject featur level describ subject video object concret art xx featur cluster media link object number element repres statist distribut moment cluster intern art constraint featur cluster element featur art cluster media featur pointer file link object cluster archiv cluster media featur intern cluster impress express moder object element describ constraint object descriptor satisfi cluster compon constraint descriptor includ semant featur combin descriptor combin gener weight give constraint tamura textur descriptor contrast effici content descript archiv document link provid object multimedia dss cluster archiv vice versa assign probabl link semant descriptor content gener confid factor probabl assign link archiv document descript graph hierarch structur cluster provid ontolog archiv ds restrict describ rich content archiv cluster relat wai support ontolog element subject ontolog introduc figur cluster cluster style introduc graph archiv ds implement gener relationship cluster metaseek describ multimedia meta search engin benefit archiv code download implement idea version metaseek meta search engin mediat multipl search engin inform metaseek design intellig select interfac multipl imag search engin rank perform class user queri architectur metaseek shown figur main compon system standard meta search includ queri queri displai interfac receiv dispatch select target search engin queri consult perform metaseek site perform score past queri success failur support search engin queri dispatch select search engin provid compat capabl queri color queri translat user queri suitabl script conform interfac select search engin displai compon perform score merg result search displai user metaseek evalu qualiti result return search engin base feedback inform updat perform oper metaseek restrain interfac limit current search support queri result flat list imag similar inform featur retriev content target search engin multimedia search engin accept queri keyword queri multimedia descript advantag queri search engin descript richer queri combin type featur media queri involv singl multimedia document collect multimedia multimedia ds archiv queri archiv descript effici match cluster statist distribut multimedia collect select featur space user interest collect multimedia document multimedia document target search engin target search engin queri dispatch engin selector perform monitor displai interfac result merger format convert client queri translat queri translat queri translat figur architectur metaseek target search engin perform queri result list match multimedia document descript descript collect archiv ds organ statist cluster result facilit advanc visual result power featur number result retriev retriev engin larg search engin make archiv descript content proprietari code archiv ds code download meta search engin archiv descript descriptor download capabl target search engin learn dynam distribut content cluster relationship capabl search engin knowledg enabl advanc map user prefer queri gener queri individu improv queri search engin effici wai merg result intellig visual search result heterogen sourc search engin queri statist element desir section featur space satisfactori percentag element greater inform provid organ statist cluster archiv descript code extract specif featur made search meta search engin run experi determin map featur user interest futur work present home archiv descript scheme design base framework xml describ dss provid actual exampl note dss gener ddl chosen present descript scheme design address requir state uniqu aspect structur element effect support multimedia search engin develop flexibl extern featur descriptor proprietari code separ object definit object relat structur object hierarchi gener distribut process content provid effect method describ multipl abstract level modal transcod home media descript scheme paper lancast meet receiv favor design evalu basic compon descript scheme incorpor current draft gener visual ds develop featur semant featur archiv ds recommend directli includ model standard test descript scheme testb incorpor prototyp featur extract video search content filter develop xml instanti metaseek search engin test issu applic refer evalu group evalu march imag meta search engin relev ieee internet vol pp home media descript feb archiv descript feb fulli autom video search engin support ieee transact circuit system video vol pp sep web site integr descript scheme multimedia feb semant structur reconstruct gener broadcast proc spie confer electron storag retriev imag video pp san jan gener content hierarchi integr text proc intern confer signal search system ieee transact circuit system video special issu object base code jaim classif visual inform symposium electron multimedia process applic storag retriev imag video san jan descript scheme mpeg atlant oct multimedia internet content ieee transact vol pp march imag descript feb huang video descript feb scheme multimedia content symposium electron visual commun imag san jan scene classif system imag advent project technic report columbia nov requir ddl develop document oct requir requir march gener pictori proc spie confer multimedia comput spie pp san feb smith chang imag video columbia univeristi ctr technic report featur visual ieee tran vol jun uml notat guid version web site video visual descript scheme march wang highli effici system automat face region detect mpeg video ieee transact circuit system video special issu multimedia system vol pp aug world wide web consortium xml web site world wide web consortium web site zhong featur base similar match semant video oct vita ana ana benitez phd candid depart electr engin columbia receiv telecommun engin polytechn award full scholarship graduat studi unit state spanish receiv phil columbia columbia develop meta search engin mediat multipl imag search engin current research interest includ integr larg distribut inform retriev system multimedia content activ particip multimedia descript standard student member ieee acm phd candid depart electr engin columbia current research interest includ artifici machin learn involv project develop prototyp visual inform system activ involv intern standard activ chang associ professor electr engin columbia research multimedia content search digit imag digit applic advent industri consortium lead digit imag research project includ health care digit multimedia educ project support digit system project support nsf activ particip intern confer standard serv consult compani prof chang award young investig award offic naval research faculti develop award ibm career award nation scienc foundat receiv bs electr engin india ms electr engin citi colleg york electr citi york work consult visual commun research depart bell lab gain experi develop softwar hardwar video commun join depart bell lab member technic staff dr princip member technic staff imag process research depart lab present locat red nj dr repres move pictur expert group standard past year activ contribut develop code standard particip video system part standard technic editor involv research video code algorithm number applic video digit storag current research interest area flexibl multimedia system servic particip multimedia descript standard dr hold patent appli patent publish technic paper confer includ invit paper book entitl introduct book multimedia system recipi except contribut individu perform merit award receiv award commun servic technic journal taught graduat imag video code columbia dr member signal process associ editor ieee transact circuit system video technolog qian qian huang receiv bs comput engin tong ms comput scienc kansa state phd comput scienc michigan state postdoctor fellow almaden research center ibm research work qbic imag object segment minimum descript length principl join imag depart siemen corpor research work medic motion ocr text planar autom content base video data acquisit octob multimedia process depart lab research current research interest includ integr process multimedia content autom semant detect multimedia intellig man machin interfac publish technic paper confer includ invit book chapter paper patent pend dr huang recipi nsf award women feder comput research member phi beta phi kappa upsilon pi epsilon john john smith research staff member ibm watson research usa receiv phil phd electr engin columbia develop imag video search retriev includ webseek imag video search visualseek imag retriev system safe integr spatial featur imag system recent develop progress video retriev system call framework adapt access retriev larg document map research interest includ multimedia data visual imag video analyt multimedia access web search engin particip standard effort area visual content descript receiv award columbia outstand achiev graduat student area system commun signal process dr smith member ieee li receiv nation taiwan roc ms phd electr engin comput scienc berkelei join comput scienc ibm watson research center research staff member manag imag inform system depart research interest includ broadband includ digit knowledg discoveri data broadband network includ storag area fiber broadband includ optic chip vlsi circuit design research activ ibm fast tunabl receiv network retriev compress domain larg principl investig satellit imag project fund nasa dr li receiv research award ibm major contribut tunabl receiv design numer invent patent applic award serv technic editor featur editor ieee commun magazin author journal confer paper receiv paper award ieee intern confer comput design senior member ieee laser commun comput circuit system societi lawrenc dr bergman graduat north chapel receiv ms phd comput scienc research staff member ibm tj watson research work develop search technolog applic research interest includ comput program interfac dr conduct led research area multimedia digit imag process earli pioneer digit multimedia network offic autom recent creat mpeg standard champion solut defin big opportun digit storytel research fellow lab ny develop architectur gener imag backbon network prior join kodak held numer research manag posit bell bell lab dr fellow editor multimedia chairman multimedia symposium dr workshop center packet video workshop speech applic telephon center network multimedia public hold patent includ recent integr web real time telephoni figur legend figur descript imag descript scheme figur uml imag descript scheme figur exampl type hierarchi figur object larg imag lake satellit index hierarchi object base size figur hierarchi visual origin automat segment imag instanc definit hierarchi bat class shown figur descript video descript scheme figur video object amo queri interfac queri queri featur weight figur descript multimedia stream descript scheme figur uml multimedia ds figur relationship compon multimedia object figur relationship compon multimedia object figur relationship compon multimedia object figur annot home video sequenc exampl physic semant hierarchi figur uml home media descript scheme figur video object archiv space subject ontolog figur uml archiv descript scheme figur architectur metaseek tabl legend tabl featur class featur tabl exampl visual featur descriptor tabl object resolut layer tabl exampl relat type relat tabl exampl relat type relat tabl featur class featur tabl cluster featur class featur
Agents/62 1 institut ur informationssystem system technisch universit wien austria institut ur informationssystem system agent thoma eiter mascardi subrahmanian research report octob research report research report octob agent thoma eiter mascardi subrahmanian abstract agent todai internet world expand rapidli agent develop proce larg optimist assumpt agent error agent numer reason agent share workspac agent human updat made entiti agent face situat explicitli program deal error code agent lead inconsist situat unclear agent act defin agent execut model agent continu act error type occur agent action automat confront repair continu engag work interact agent unaffect repair institut und ludwig wittgenstein labor fur technisch universitat austria universita di itali part work visit tu wien institut advanc comput institut system research depart comput colleg maryland work support part austrian scienc fund project armi research lab contract number nsf young investig award grant number aro grant grant copyright author rr content introduct impact preliminari architectur formal definit architectur corrupt code call atom suspici code call atom agent state repair repair data structur repair action librari error toler agent cycl method implement suspici add implement implement implement relev agent framework kowalski sadri unifi agent architectur rao georgeff bdi architectur wooldridg comput system relat work inconsist agent framework reason statu set safeti rr introduct agent rapidli grow area research artifici intellig rang span server web search engin numer paradigm agent ai literatur past author work framework call impact maryland platform agent collabor develop theori exist legaci code base data sourc agent state resid data structur messag agent state agent action accord oper principl ensur result state satisfi integr constraint exampl state includ receipt clock receipt servic receipt servic updat data eiter show strong connect agent theori classic method logic nonmonoton reason show shoham aop orient system larg simul impact larg part architectur captur framework framework fact agent decid state major problem address agent framework includ impact assum rule suffici appropri respond request arriv assumpt agent develop cover optimist unreason assumpt program program question agent confront situat act case legaci note legaci system exist gui agent access updat data legaci gui alter agent state wai agent find unaccept agent corrupt extern entiti agent current state violat integr agent unabl find set action execut current state code tackl problem consid extent nonexist statu set integr constraint violat paper present architectur algorithm agent exhibit import properti recoveri agent recov continu agent continu process request continu recov import agent servic lot request organ paper section present overview impact agent architectur add compon error recoveri compon architectur section section provid formal set wrt semant agent assum ration reason statu set semant agent rr legaci data function call action polici secur action base constr integr action constr messag messag agent figur basic architectur impact agent definit request affect agent corrupt unaffect request continu process corrupt corrupt agent attempt recov section describ special repair data structur repair action recoveri compon select repair action host realiz repair section discuss agent result tool previou recov error show impact agent recoveri present modif agent cycl incorpor desir properti recoveri continu section discuss work appli agent framework kowalski sadri bdi work wooldridg relat work discuss section direct futur work discuss section impact preliminari applic program reason type program deal type data manipul varieti critic notion agenthood applic arbitrari softwar program agent develop select data structur suit applic function desir user applic build figur show architectur impact softwar agent import note agent architectur content compon lead behavior capabl offer agent agent data structur agent built exist bodi abstract definit bodi code specif data type data agent manipul data type domain space object type data type countri type countri instanti content data type subset space type rr set data structur manipul set extern program function constitut applic programm interfac api packag top agent built agent includ specif signatur api function call type input function call type output function unifi languag queri softwar packag leverag function defin term code call code call function defin packag state list code call argument valu assum set singl object coerc set code call atom express form term cc code call ground succe answer set valu return fail answer variabl return result answer set ground substitut return true uniform view ground case identifi answer true set void substitut answer empti set substitut code call atom denot logic negat code call extend natur set code call atom xg code call condit conjunct code call atom constraint involv oper constraint atom access field variabl rang record field check state condit constraint atom form op op term code call condit provid power syntax access heterogen data structur code call condit oracl imag complex condit join data oracl imag select peopl make oracl find pictur person person call mari gener notion join relat join relat imag agent assum access messag box data api function call access detail messag box impact found point actual set object data structur messag manag agent constitut state agent identifi state set ground code call true action agent set action variabl chang state action includ read messag messag respond execut clone copi agent move remot updat agent data action express list term action atom repres set action result variabl instanti valu action execut agent action rr precondit code call set effect add list delet list code call describ agent state action execut method implement program languag script languag user deem consist bodi physic code implement action notion concurr agent bodi code implement notion concurr set action current agent state return singl action input action output notion concurr properti state restrict code call atom occur add delet list action make assumpt paper action constraint agent finit set action constraint rule form state satisfi code call action concurr present disregard action sine easili elimin integr constraint agent finit set ic integr constraint ic state agent satisfi ic resp form code call code call atom constraint atom ic mean statement function depend relat packag db express integr constraint db db return tupl relat assum integr constraint exist agent state satisfi integr constraint ic set integr constraint consist determin inconsist undecid autom check softwar agent legal initi state state collect state satisfi integr constraint specif integr accept hold agent program agent set rule call agent program principl agent oper rule deontic agent express action call action statu atom action statu atom read oblig action statu call action statu liter agent program finit set rule action statu code call action statu liter due space repeat semant agent program overview appendix detail architectur formal definit discuss extend architectur fig handl case agent error due violat integr valid statu agent state autonom updat parti omit place safeti aspect appendix rr architectur assum mechan notifi agent state chang parti assum abstract agent receiv messag agent agent answer code call atom resp term cc ground agent agent answer code call atom previou form code call atom set ground substitut mean parti updat agent state answer chang answer minu substitut substitut error occur agent situat incom messag form trigger error valid statu set incom messag entiti send agent messag form updat violat integr constraint leav state invalid deal situat agent develop build impact perform task order impact agent recov corrupt set ra repair action properti section object function evalu cost state idea agent code repair compon automat repair action comput state satisfi integr constraint gener valid statu user specifi compon agent section specifi impact agent develop environ automat convert agent compon repair compon execut bodi java bytecod deploi continu properti agent preserv requir agent state corrupt action extern agent continu process request servic long request ongo repair corrupt part agent manag relat relat find extern corrupt relat queri access relat process agent corrupt relat repair reader messag error incom messag agent chang agent state messag updat agent messag box integr constraint violat messag agent develop write patent absurd integr constraint syntax ic agent develop write rule messag box messag agent messag box messag agent agent corrupt messag agent arriv problem avoid ad restrict syntax agent program type regular agent program introduc avoid problem addit requir ic mention code call atom involv messag allevi problem rr proce section address problem agent code call atom resp set code call code call atom potenti corrupt method appli base syntact analysi agent integr constraint introduc section notion code call atom determin agent make affect potenti corrupt code call central recoveri section corrupt code call atom set code call atom code call atom integr constraint affect defin procedur call set code call atom integr constraint corrupt preliminari definit introduc notion subsumpt code call atom definit call set code call atom subsum set code call atom written instanc substitut singleton set omit write rest implicitli assum code call atom standard unif code call atom subsum defin associ code call condit set code call atom set code call atom occur definit atom set code call condit code call atom set induct defin code call atom constraint code call condit integr constraint ic defin defin describ set potenti corrupt code call atom code call atom corrupt definit integr constraint ic code call atom unifi gener unifi current result code call atom lead inconsist integr constraint code call atom turn corrupt extern entiti modifi state due section rr consid code call atom occur consid corrupt notic unifi gener unifi easili nest term integr constraint ic defin procedur set code call atom consid set code call atom consid corrupt proc set code call set code call ic return end proc notic implement inflationari oper set code call termin finit input output compact remov subsum code call atom reason iter appli corr oper procedur error mask integr ic ic ic ic current state code call atom current state ic violat potenti evalu return result violat integr reflect condit current state coher agent set integr constraint violat current state potenti correct evalu true fact correct evalu case corrupt evalu order satisfi ic rr violat exclud possibl problem propag safe integr constraint corrupt potenti corrupt code call integr constraint ic ic violat current reason suspect code call atom corrupt complet unrel corrupt atom sound approach express proposit state coher state reach chang return valu corrupt code call maintain return valu agent state set ground instanc integr constraint ic violat state set code call atom proposit set code call atom exist agent state ic ground code call atom differ mean turn modifi return result corrupt code call chang result code call atom proof defin suitabl recal agent state exist satisfi integr arbitrari agent state ground code call atom defin notic differ ground subsum ic ground instanc integr constraint ic case exist definit hold iff ic hold impli ic conclud iff ic case ic prove result continu previou state code call atom true code call atom consist reach simpli chang return implement cautiou larger set code call atom corrupt semant appli case case refin pictur minim set code call identifi corrupt view reach coher state chang valu code call atom comput minim set code call atom chang lead gist result rr theorem set gi ground violat ground integr constraint current agent state ground code call atom decid smallest set ground chang valu consist state result proof variant satisfi problem reduc problem fc cm set proposit atom negat softwar packag maintain truth assign proposit api return variabl set true distinguish atom assign true satisfi iff atom agent state atom set integr constraint integr constraint violat belong smallest chang ground code call atom turn consist state iff satisfi assign decid gi easili construct polynomi result suspici code call atom chang subset ground instanc corrupt code call atom recov agent state agent cycl repair procedur repair arriv simpli queu agent find process messag repair proce handl case introduc notion action atom notion code call evalu action atom affect repair access code call atom possibl chang repair process deontic statu action atom chang repair complet impact action atom deontic statu determin run agent program rule program involv affect action atom corrupt code call atom propag action atom code call atom bodi rule consid affect rule fire treat corrupt code call code call safe evalu current agent state affect corrupt state affect attempt repair corrupt part state atom safe evalu repair process agent process messag natur evalu code call atom process messag repair state long process messag delai avoid potenti incorrect result similar appli process messag form case corrupt code call determin suspici code call atom syntact analysi agent program defin procedur set code rr call atom subsum corrupt ground code call atom agent set suspici code call atom procedur oper phase determin code call atom corrupt backward propag integr constraint violat complet repair defin direct action atom code call atom definit affect action action atom directli code call atom exist unifi mgu directli affect directli directli statu evalu ground instanc involv overlap ground instanc code call atom precondit chang repair defin action atom set affect action code call atom definit rule action set action atom occur set action code call unifi mgu directli unifi mgu set union set union rule affect defin exist set action atom action atom assum code call atom corrupt subsum coarser view ground atom simplic effici remark semant appli agent program definit refin case reason statu set semant action atom ad bodi agent manag polici depart store classifi custom medium low classif send custom practic sophist classif rule agent program oracl rule custom enter assum custom high salari del list custom rr add exampl pair oracl code call atom unifi oracl mgu fc oracl directli code call atom unifi oracl mgu fc action atom unifi head mgu fc notion determin action atom affect build statu set agent depend semant wai includ action statu atom statu ration reason statu set action statu atom belong statu set occur deriv action deontic closur rule def feasibl statu set includ case occur respect assum program dummi rule action rule easili ad chang semant program posit defin comput set suspici code call atom set code call atom suspici procedur defin tabl suspici code call atom determin phase iter determin code call atom affect syntact examin rule agent program start knowledg code call atom input algorithm corrupt code call atom bodi rule found affect suspici end phase code call atom possibl affect corrupt code call atom determin lead agent action vari dramat agent develop origin code call atom unintend consequ address corrupt code call condit trigger unintend action care account fact action action integr effect occur integr constraint joint execut corrupt repair state longer execut execut illustr add list code call atom add list integr constraint ic rr proc set code call set code call subsum corrupt ground code call atom phase propag begin find action atom troubl ic ic ic unifi mgu unifi mgu phase back propag poss atom begin return affect action atom return bg end proc tabl procedur rr assum current execut ic integr constraint involv corrupt code call atom repair agent execut execut simultan ic violat repair agent comput statu set execut mean statu action agent corrupt state repair undesir elimin procedur comput action atom lead problem phase comput action atom deriv action atom analyz rule program atom occur mean unifi action atom bodi rule suspici code call atom rule bodi consid effect result code call atom relev consid earlier phase phase code call atom affect rule contribut deriv problemat action atom back care fact action atom code call evalu comput statu set code call consid suspici found affect simpl agent ag integr constraint ic agent program consist ration statu semant add add told find suspici code call atom inform call iter augment initi set reach fixpoint rule fx add action atom set remain code call atom bodi occur rule affect occur action atom ad remain unchang rule affect rule newli affect occur fx unifi atom head newli ad ad rule newli rule affect rr iter bring phase termin comput delet list occur ic set line action add subsum action obtain phase rule affect note rule affect action statu atom unifi action statu atom affect ad affect ad affect unifi head fx sg ad ad affect loop return evalu ad precondit action statu atom omit subsum code call result theorem state procedur input set code call atom set code call atom arbitrari code call atom unifi code call atom base affect ongo attempt repair code call atom action result state involv isol corrupt code call state repair run agent program agent repli messag db queri tabl corrupt code call atom restrict db car tabl provid answer messag doesnt refer car preliminari definit agent program ground code call atom influenc set smallest set action action directli affect action ground instanc rule influenc set arbitrari code call denot union ground instanc theorem agent state repair set code call atom code call atom unifi valid statu set disregard exist valid statu set wrt ic iff hold modal op proof statu set exist lead state hold action belong ground code call corrupt code call subsum virtu phase instanc subsum rr contradict hypothesi statu atom statu set comput access ground code call atom action statu atom op ground code call atom af set action instanti action atom set comput defin statu set af affect action statu action show set lead state coincid result show feasibl statu satisfi condit def kei fact ground instanc rule satisfi af af satisfi rule clear satisfi rule condit satisfi ground action action statu atom belong feasibl statu clear satisfi condit case analysi yield ground instanc ic integr constraint ic satisfi assum corrupt code call code call ic action af chang code call action belong ic assum code call ic action af specifi chang code call ic phase procedur af action specifi chang code call atom ic ic ic code call atom ic chang action af ic violat state ic ic ic satisfi state condit satisfi show feasibl statu set wrt sem ration statu set show proper subset satisfi deriv contradict assum smaller action statu atom set action af smaller statu set satisfi state note ground instanc rule satisfi af deontic action consist action close ration statu set contradict hypothesi coincid wrt statu action af smaller wrt af statu set smaller statu set similar state mean ration statu set contradict prove ration statu set sem reason statu set show ration statu set reduct red reason statu set wrt feasibl statu rr set observ reduct preserv kei properti af similar argument obtain ground reason statu set wrt formal result assur case agent program admit singl statu set state true impact target class regular agent program action repli messag corrupt state repair agent state repair recal agent state content data structur order agent automat handl integr constraint violat lack statu add special set data structur agent call repair data structur data structur special api function call repair data structur repair data structur buffer consist messag wait servic involv access part agent state buffer consist corrupt code call atom buffer consist integr constraint undergo repair auxiliari buffer suspici code call atom set con state consist ground code call atom true distinguish consist state set curr state consist ground code call atom true current state repair data structur support api function code call atom return true impli set code call atom notion infer fix concret implement function wai implement check physic present check instanc code call atom check impli set axiom set implic rule procedur defin section rr add function code call atom corrupt repair return true return implement depend possibl exist section import note repair data structur api call includ part impact agent develop environ program agent agent develop repair action librari addit repair data augment agent set action agent set action agent state repair action implement straightforward extens dynam link librari provid impact agent develop environ definit agent state agent ra repair action librari agent ra iff ra iff state ra action ra execut execut yield state iff ra state ra reachabl state mean sequenc repair action transform illustr grid simpl scenario grid agent manag robot move repair action ra grid action move robot direct describ north similar assum underli softwar api function return posit robot time function call made north grid add grid grid state grid grid grid grid grid grid rr ra grid grid grid ra definit set ra repair action complet wrt agent state iff exist state ic ra complet wrt agent iff ra complet wrt state ra complet agent iff state agent execut repair action consist integr agent state obtain agent develop specifi repair critic complet wrt rest agent scenario previou scenario integr constraint exist state posit occupi robot ra grid complet wrt exist state ra grid satisfi integr constraint ra grid complet wrt agent agent robot occupi posit set repair action grid order provid system develop defin set repair action adopt context repair data structur introduc section state repair action ra init assum agent initi state init time init assum satisfi integr constraint set con init ra complet wrt init defin action ra defin ra repair curr repair con repair curr repair curr function curr con provid repair packag set ground code call atom true current set ground code call atom true distinguish state satisfi integr constraint section action ra appli assum retriev ground code call atom current state repair curr consist state repair con current state chang rr state repair action ra pref prefer state repair action agent develop initi con state pref satisfi integr constraint repair action ra roll instant agent track consist state lk set con equal lk function identifi proper repair action perform reach consist updat con state integr constraint repair agent state reset consist state set repair action consist singl action exampl content con dynam agent life cycl strategi usabl action agent execut fax action find imposs recal repair ra ic repair strategi appli condit integr constraint comparison atom head code call atom bodi agent integr constraint ic ng construct repair action ra ra add code call code call protect atom ra slight variant call ra includ list code call atom repair action ra similar ra delet list code call atom comparison atom prior system check integr constraint comparison atom head code call atom bodi result give idea difficulti check complet concret statement assumpt complex evalu code call domain data type assumpt make similar analysi complex agent program request size agent state bound polynomi size problem input ensur assum number argument code call bound number valu polynomi input code call agent state evalu polynomi time assumpt state refer theorem check complet set repair action ra wrt agent state assumpt undecid gener check complet set repair action ra wrt agent assumpt undecid gener rr proof pspace upper bound consequ fact size agent state bound polynomi pspace lower bound explain fact ture machin polynomi work space easili encod problem check complet set repair action respect agent harder check wrt agent state complet test wrt agent undecid shown reduc problem decid return true instanc relat undecid extens librari complet set repair action easili incorpor impact agent develop agent integr agent automat select ra init ra roll ra ic repair action strategi relev repair action automat comput fill agent impact agent develop environ error toler agent cycl solut problem agent recov corrupt state continu process request unaffect ongo repair note point agent state repair repair messag form attempt process request usual account possibl messag yield valid statu add messag start repair state agent state check ongo repair process current request check code call atom messag affect ongo repair add messag buffer process secur knowledg repair made agent state affect depend current code call atom note case state state repair affect incom captur condit state empti involv ongo repair case dealt uniformli simpl definit definit agent program agent state set wrt statu set wrt modulo condit feasibl statu set definit appendix show agent cycl modifi handl requir recoveri continu modifi agent cycl stand error defin tabl special procedur agent state assembl list ground action statu atom serial execut chang agent state satisfi integr constraint execut list buffer messag handl instanc violat integr repres set corrupt code messag rr proc agent msg msg msg ident dummi id true add affect msg state repair doesnt affect msg set wrt ic exist msg execut action statu set exist error condit set exist msg begin switch repair reiniti buffer instanc ic ic ic st ic ic add requir repair add add poss corrupt ic end msg begin ic ic msg set msg wrt ic exist begin add ic end comput set msg wrt ic execut action end end proc tabl modifi agent cycl rr express ic denot set integr constraint ground instanc integr constraint ic note level msg describ agent state updat state messag msg algorithm captur requir recoveri continu recoveri support step step handl case messag yield valid statu set extern updat integr constraint violat continu support step execut action safe theorem repair process messag step realiz current state repair process step realiz agent program se violat integr state repair state messag flush buffer process statu set comput method implement suspici add coupl altern wai implement function suspici add implement mention wai implement add suspici simpl import note add suspici mutual compat proc return true return end proc proc add end proc insert messag code call atom comput corrupt code call atom function defin section add start evalu suspici code call atom put auxiliari procedur advantag evalu simpl subsumpt check execut time proport product length tabl longest code call atom store disadvantag messag corrupt suspici code call comput insert space consum oper add expect agent state corrupt infrequ comparison number messag process concern corrupt agent state implement implement suspici add work code call atom insert code call atom corrupt comput suspici code call atom messag explicitli determin affect function rr proc return true return end proc proc add end proc unlik spend minor effort insert code call atom arriv attempt check request affect ongo repair find larg lot thing insert time check request affect ongo repair method worth number repair larg request implement procedur procedur function program languag terminolog side current agent state valu procedur find state satisfi agent integr constraint repair reset integr constraint repair code call problem longer problem iter agent cycl messag longer trigger error repair origin reset wait messag handl step simpl handl rest focu step easi step formul classic ai plan problem current state set goal state ic set ra repair action find sequenc action ra yield goal state ra complet set multipl consist state agent transit agent transit repair state wrt state evalu function classic ai plan problem confin cost function evalu state set solut ai literatur easili adopt find state wrt cost function definit state evalu agent agent state integ definit state agent optim wrt agent state iff agent state satisfi rr agent reconsid set sum ham distanc posit robot api function comput ham distanc point integ plane formal set result grid grid grid describ agent state assum grid current agent state grid grid grid grid grid grid optim state wrt satisfi grid integr reach seri action west robot locat corner sum ham distanc maxim note state optim grid grid grid optim state wrt goal state violat agent integr find sequenc repair action yield optim state easili ai plan problem major differ ai plan cost plan typic sum cost monoton function action repair action assess cost state captur state evalu find reachabl state satisfi integr constraint maxim defin state definit code call condit involv integ variabl variabl specif assum exist special packag math support number standard arithmet includ binari oper integ binari function point express grid grid math variabl specif math math variabl specif intend mean ham distanc robot sum ham rr definit code call condit math code call condit input variabl output variabl code call condit safe modulo involv code call atom access math math variabl specif input variabl output variabl variabl specif code call condit math code call condit input variabl output variabl variabl specif math math math variabl specif input variabl output variabl definit function object function specif pair hx math fv gi variabl specif form math math variabl specif input variabl output variabl function continu grid describ object function assign higher valu state robot object function specif hv math fv math math math grid grid math grid grid math grid grid math object function specif measur agent state set ground ground valu math set ground true wrt fx return object continu mean assign xn code call condit reorder evalu left appendix rr relev agent framework shown defin agent cycl appli impact agent corrupt cycl agent continu process unaffect request repair state affect request process effect natur question result paper appli agent framework show context agent agent framework framework due rao georgeff ration agent framework due wooldridg briefli discuss section kowalski sadri unifi agent architectur kowalski sadri analyz similar differ ration reactiv agent architectur unifi architectur aim captur special case agent reason captur proof procedur logic program style search engin reduc goal subgoal manner complet proof reduct procedur paper base observ case replac goal set rule problem control reason process work correctli bound resourc address result cycl govern architectur observ input environ time record resum execut proof procedur current goal propag input continu appli proof procedur total infer select atom action respect time execut action record result extens cycl account complex glanc integr constraint dynam evolv execut cycl goal reduct replac goal statement simpler goal statement form integr constraint case impact integr constraint establish made assumpt extens bdi architectur phrase kowalski sadri integr constraint mean repres condit check current necessarili satisfi shown exampl proof procedur continu execut integr constraint lead goal unsatisfi integr constraint account propag input replac current goal statement simpler account observ input integr constraint agent behavior rr avoid set static integr constraint includ knowledg base kowalski sadri static integr constraint mean impact integr establish repair procedur immedi start unifi agent architectur cycl modifi outlin observ input environ time record check input violat static integr violat start repair procedur concurr evalu resum proof procedur current goal statement lead conflict current repair atom action action unrel current turn execut continu appli proof procedur total infer select atom action respect time execut action record result interrupt process input complet repair procedur kei obstacl appli definit determin mean occur proof procedur repair procedur address wai determin atom affect repair procedur affect proof procedur intersect declar conflict notion similar paper altern solut simul advanc occur proof procedur syntact check rao georgeff bdi architectur bdi architectur base notion agent intent system excel architectur depict figur repres knowledg conjunct disjunct achiev test current procedur knowledg agent mainten set set partial instanti plan typic bdi engin cycl rr belief plan librari bdi engin goal intent action event figur bdi architectur observ world agent intern subsequ updat event gener plan trigger event match event event queue context select set match plan push select plan exist intent event select intent topmost plan execut step current step perform post event queue order extend agent cycl handl modifi step cycl event event queue safe process select plan execut safe execut select intent stack step topmost plan safe execut integr constraint hold integr constraint repair current state recov correct state modifi step bdi agent cycl step safe event event event plan definit plan trigger event match chosen event context satisfi step safe select plan order decid plan safe execut lead inconsist due repair made evalu consequ execut execut push select plan exist intent select newli modifi stack lead execut action affect plan give detail kind action affect repair scope paper good definit adapt bdi framework ignor intent stack analyz step cycl rr plan chosen step unsaf intent stack chosen step problem action perform current repair intent stack step safe select intent previou evalu consequ execut step topmost plan stack action execut potenti affect intent stack select plan select execut step intent stack chose modifi step moment event event execut cycl stop repair complet repair event event queue definit bdi cycl outlin observ world agent intern subsequ updat event queue violat integr constraint start repair procedur concurr event exist event queue event event gener plan trigger event match chosen event context select set match plan provid plan push select plan exist intent event select intent topmost plan execut step current step perform post event queue interrupt process event complet repair procedur wooldridg comput system chapter phd wooldridg formal model intend captur aspect varieti agent system model base agent finit comput agent set explicitli repres belief reason belief accord comput resourc afford belief express logic addit agent capabl commun agent belief mean belief function agent system continu execut rr interpret messag updat belief previou action messag deriv deduct closur belief deriv set send deriv set appli wooldridg defin execut model synchron asynchron agent synchron model begin end execut cycl realist asynchron execut agent act fix point time naiv extens agent cycl defin interpret messag updat belief previou action messag check belief violat agent integr violat start repair procedur concurr deriv deduct closur belief deduct closur belief integr constraint deriv set send deriv set appli interrupt process receiv messag complet repair procedur assum agent set static integr constraint satisfi state messag action messag action current repair procedur determin belief ongo repair defin adapt notion paper case wooldridg syntax relat work work error toler agent system compar work relat work area previou shown idea paper impact agent appli agent system inconsist sourc inform servic requir satisfi integr constraint ic sourc inconsist state interact sourc user place recoveri inconsist complet clear exclud rr user interact inconsist data sourc benefici research provid consist servic inconsist data sourc widespread reason inconsist studi extens context case reason multipl knowledg base notion agent cycl agent continu run process steadili execut request cycl modifi error toler process method incorpor cycl kei contribut paper import effort deal consist queri answer inform system inconsist ic bry approach make recogn answer queri deriv possibl corrupt data exploit notion local formal term minim logic data ic violat consid potenti corrupt answer establish deriv minim potenti corrupt data call inconsist answer consist comput data involv ic violat show minim logic suffic foundat queri answer definit deduct problem address context agent system access extern data sourc code call rule involv action deontic modal consist inconsist answer comput address repres differ bry approach provid algorithm evalu corrupt affect formal prove item correspond intuit notion resp chomicki provid logic consist queri answer relat inconsist ic answer queri pose violat ic obtain minim repair version method comput answer analysi properti basi queri method iter queri evalu arbitrari state return set consist answer origin queri base notion residu context semant queri optim sound approach complet ic termin comput proper condit variant oper proven termin complet class ic extend annot predic calculu logic inconsist inform unravel logic infer inconsist reason inconsist defin repair queri answer approach understand result provid gener algorithm cover class queri main differ approach consist answer evalu rewrit queri account evalu answer rewritten prove consist answer origin evalu process incom messag involv process messag yield case result ic defer complic work extern request made agent state modifi repair repair constraint interest approach basic concept diagnosi adopt discov minim set simultan reason minim logic constructivist weaken classic logic defin term natur deduct proof system depriv absurd rule rr violat constraint reason repair action elimin violat adopt repair action depend user strategi domain independ rang minim undo consist complet violat transact user interact repair process sound complet algorithm minim repair transact inconsist repair strategi similar user strategi suitabl applic applic independ librari eventu prioriti prefer repair interact user repair process briefli sketch assum suitabl environ exist environ user interact repair process easili perform impact set agent framework problem tackl solv agent work state ensur agent recov corrupt state critic agent commun agent find applic domain telecommun process control electron commerc reliabl multiag system kei issu continu recoveri properti support servic error toler awar research agent environ formal develop agent import aspect endeavor build ration make good necessarili situat turn agent ahead action make underli assumpt integr constraint correct imagin integr constraint withdraw modif integr constraint remedi situat agent choic agent state integr part agent entiti access plausibl agent design inform violat integr decid chang integr constraint notion auxiliari technic concept formal intuit action unrel error peculiar make nontrivi task result section show techniqu adapt type agent architectur work agent commun relat shoham explicit program languag base object orient base concept agent state shoham section state complet aop orient system compon restrict formal languag describ mental interpret agent program languag primit command request rr impact agent express shoham aop framework result paper appli shoham aop framework hindrik al develop deontic base agent program framework agent mental state consist set goal set belief agent program framework consist quadrupl transit function effect basic initi set initi set set rule form head guard head complex formula describ goal syntax goal support hindrik goal elementari includ sequenti composit disjunct conjunct goal guard logic bodi structur head hindrik al express impact vice agent cycl similar result error toler appli agent cycl appli paper impact agent cycl case agent make framework initi framework rosenschein agent act action determin rule form true state agent action cycl similar state chang determin base rule involv notion directli rule involv unaffect atom process request repair mechan conduct repair agent state appli irma system bratman al agent gener action base agent intent plan evalu determin consist optim respect achiev intent cycl similar plan involv atom softwar agent provid power paradigm mobil applic softwar agent system build top legaci softwar principl support automat coupl simpl complex action wide varieti applic danger assum agent prototyp declar languag impact free error prolog program year histori program shown bug code account impact base agent agent system build top legaci bug reason agent develop written rule account state agent agent full control state true legaci applic agent vehicl access legaci applic state legaci code top agent built unexpect agent state modest step address difficult problem time agent algorithm good featur incorpor method agent recov state rr agent continu process request long request unaffect ongo repair work contribut endeavor build ration agent shown method appli agent bdi model import aspect reason behavior bdi model discuss demonstr wooldridg ration remain interest issu model extens observ build top classic agent state integr constraint model set classic fact violat integr constraint conclud avoid method paraconsist logic suitabl belief oper contribut paper admittedli panacea problem involv bug agent program handl case agent dont statu set due violat integr constraint violat occur parti manipul agent state agent updat agent rule adequ deal ic violat scenario repres small space error agent program form rich avenu futur research result paper relax futur work wai action atom view action statu atom determin suspici code call atom basi syntact analysi agent program similar paper due interplai semant compon feasibl statu set includ deontic action closur integr provid refin approach studi substanti complex acknowledg review construct comment improv paper work support part austrian scienc fund project armi research lab contract number aro grant grant refer vianu foundat addison chomicki consist queri answer inconsist proc pp acm kifer applic annot predic calculu queri inconsist proc juli subrahmanian platform collabor agent ieee intellig subrahmanian combin multipl knowledg base consist order theori comput rr blair subrahmanian paraconsist logic program theoret comput pollack plan practic reason comput bry queri answer inform system integr constraint integr intern control inform vol confid inform ifip wg work confer integr control inform system chapman decemb cell queri inconsist algorithm implement proc juli jen part electr transport manag ieee williamson middl agent internet proc intern joint confer artifici pp intent stanc mit eiter subrahmanian heterogen activ algorithm complex artifici pick heterogen activ semant artifici roger heterogen activ polynomi implement agent artifici extens framework repair constraint violat integr intern control inform vol confid inform ifip wg work confer control inform pp chapman decemb de van der meyer formal semant abstract agent program languag intern workshop agent languag volum pp kowalski sadri unifi agent architectur combin ration reactiv proc intern workshop logic volum pp san kowalski sadri agent architectur unifi ration reactiv imperi colleg technic kowalski sadri logic program system annal mathemat artifici rr nilsson principl artifici intellig morgan rao georgeff model ration agent fike proc knowledg reason pp san morgan kaufmann publish rosenschein formal theori knowledg ai robot gener shoham agent orient program artifici subrahmanian paraconsist disjunct deduct theoret comput ross heterogen agent theori implement mit sycara zeng integr inform gather support european confer artifici intellig intellig agent telecommun jen agent applic market pp wooldridg logic model comput system phd depart octob wooldridg reason ration agent mit reason statu set appendix succinct form definit concept statu set reader refer inform definit statu set set ground action statu atom valu type domain softwar packag oper op denot set sg definit app agent program agent state app true predic true iff ground ng definit statu set deontic action ground action case impli impli impli statu set denot smallest set close action close rr definit statu agent program agent state statu set feasibl statu set app ground action impli impli action state result execut execut strategi action satisfi integr ic definit ration statu statu set statu set exist satisfi condit feasibl statu set statu set ration statu feasibl statu set ground definit statu agent agent statu set negat action statu atom occur reason statu set iff ration statu set reduct wrt denot red program obtain ground instanc rule remov rule bodi remov neg liter remain rule reason statu set wrt reason statu set program red respect safeti variabl root involv object variabl involv root variabl refer object definit code call code call safe iff ground code call condit safe iff exist permut comparison op constant variabl belong rv st occur constant variabl rv root variabl rr code call atom form cc cc root variabl occur cc belong rv root rv code call reorder code call atom occur evalu atom left assum root variabl increment bound object definit modulo code call set root variabl safe modulo iff assign object variabl case safe
DB/63 3 tr approxim queri translat heterogen inform sourc chang hector comput scienc depart stanford contact chang gate hall comput scienc depart stanford ca usa approxim queri translat heterogen inform sourc tr abstract paper present mechan approxim translat boolean queri constraint heterogen inform sourc achiev translat challeng sourc support constraint formul constraint translat queri translat approxim unlik gener framework adopt customiz metric translat combin recal result show queri translat handl interdepend queri conjunct disjunct identifi essenti requir rule system user encod map atom semant unit algorithm translat complex queri rewrit term semant unit show practic algorithm gener approxim translat respect close metric choic present case studi show techniqu appli practic research introduct enabl mediat system integr heterogen inform sourc data search capabl mediat present unifi context uniform inform translat origin user queri unifi context target sourc nativ execut translat problem critic wide rang dispar sourc click internet achiev translat challeng sourc constraint formul constraint translat paper present framework find perfect map gener account differ attribut data format mediat integr onlin shop site video base case studi section mediat present unifi view user find item actor translat constraint mediat find perfect map translat sourc map case perfect map simpli exist sourc eb translat scheme focu map return potenti answer unwant answer mediat map search return vh dvd item superset map eb true return entir sourc unaccept good approxim favor eb approxim match harrison eb requir miss answer harrison harrison user map true return huge number dvd vh item map simpli vh textual descript map return lot data miss vh item term vh altern map attract view queri boolean express constraint select form op join form op discuss stress approach gener handl join constraint constraint constitut queri transform constraint understood target sourc constraint map attribut map score valu convert score grade oper transform refer detail gener model problem common mediat architectur studi queri translat earlier work implement realiz approxim translat critic applic earlier work map exact result recov superset case approxim practic strictli correct concurr system strict serializ result undesir low case studi scenario inform estim translat reli approxim mediat applic close criteria map essenti translat system flexibl support wide rang close metric paper present approxim translat found virtual reason metric framework support criteria customiz criteria quantifi expect occur analog fashion convent ir paramet recal quantifi occur execut singl queri result show flexibl cope interdepend queri conjunct disjunct critic note queri map simpli matter translat constraint separ interrel constraint form handl discoveri previou studi show queri disjunct translat significantli simplifi translat process approxim translat interrel depend close illustr continu movi search user vh dvd format queri denot closest map close queri mediat adopt gener translat mediat separ map disjunct translat assum mediat concern larg result illustr map mediat close approxim map good vh dvd titl close metric translat separ lead suboptim disjunct queri translat reli human defin constraint translat basic semant unit rule translat pattern rule composit kind queri constitut paper answer identifi essenti requir translat rule system base challeng translat arbitrari queri boolean express constraint handl approach present algorithm origin queri semant translat rule note lead closest map run translat rule semant unit translat queri queri express appli rule obtain solut optim translat answer question paper make main contribut approxim queri ffl gener defin notion translat close framework adopt close metric applic ffl present algorithm systemat find translat respect close metric algorithm find uniqu practic case semant unit ffl develop fundament theorem separ queri safe decomposit result critic develop algorithm attempt approxim queri translat ffl studi estim recal paramet show reason formula exist estim briefli discuss relat work section start section defin close criteria combin recal section studi basic assumpt composit monoton result composit separ section present framework algorithm section conclud case studi show approach appli practic note due space leav detail import result support directli appendix interest reader refer extend report formal proof result relat work inform integr activ research area focu constraint map problem uniqu integr system dealt sourc inform manifold tsimmi infomast garlic disco effort gener queri plan observ grammar restrict nativ queri conjunct disallow work complement effort address semant map analog translat vocabulari nativ output semant map constraint vocabulari understood target input capabl map analyz refer addit detail distinguish focu constraint map problem integr effort approach appli common mediat architectur work data translat schema integr main focu relat effort unifi data mismatch domain transform data unifi queri perform complementari goal map queri nativ domain data resid approach suit autonom sourc larg volum found web econom feasibl transform note constraint map problem data queri capabl map section translat error consid tradit schema data translat work approxim critic queri map virtual translat effort stress notion approxim studi queri work aim reduc process cost approxim refer studi approxim fixpoint datalog figur venn diagram queri map approxim predic filter research explor approxim queri answer reduc time refer develop framework repres approxim support queri explor queri relax approxim answer defin translat metric base paramet recal classic notion commonli quantifi notabl inform retriev measur ir effect section approxim translat discuss paper motiv previou work section earlier model map significantli simplifi translat accommod gener close metric paper specif explor notion deal map virtual reason close metric queri account recal goal queri map find closest translat origin fulli express target quantifi close map approxim origin queri close criterion return normal close higher rate closer approxim framework wide varieti close function discuss intuit import map closest map respect close criterion map ti broken denot closest map approxim erron introduc compar origin queri figur illustr error venn diagram result set queri map quantifi ultim defin metric measur proport map result jq jm denot size result set queri paramet captur compon approxim error figur reduc number jan feb mar apr jun jul aug sep oct nov dec month term jan feb mar apr jun correspond term map figur map term constraint constraint recal measur proport correct result retriev jq jqj dual recal captur higher recal correspond fewer note paramet normal translat calendar system time origin context term target figur show correspond origin context year consist term constraint repres feb target divid year match jan feb illustr map queri figur note cover cover jan jun addit incur eq recal eq estim cover month month equal subset figur dual superset subset map impli perfect high cost lower map perfect perfect recal similarli comput note incur quantifi translat reason metric account compet goal recal defin close criterion function recal applic focu requir recal threshold denot import class close function threshold defin undefin map close similarli recal close invalid map assum repres relev map highest close wrt similarli defin undefin class repres intuit import close metric stress special instanc typic adopt queri applic requir perfect recal subsum goal find map highest subsum queri refer minim subsum map tight upper envelop design retriev minim superset applic requir map return implement close criterion perfect unlik goal find maxim subsum map tight lower envelop refer close criteria determin map closest show calendar applic wrt obtain undefin adopt addit intuit reason criteria function defin adopt averag arithmet averag error measur harmon correspond convent measur inform retriev stress gener framework assum metric requir close criterion monoton map paramet map recal captur reason close metric sampl function satisfi monoton support framework theorem appendix queri composit section address fundament answer build approxim queri translat machineri question composit monoton translat queri ab comput translat independ translat depend fact eventu intersect question gener find translat queri separ translat compon composit monoton queri composit fi fi oper fi assumpt reduc search space translat assumpt queri composit fi fi closest map respect close criterion map fi fi fi fi assumpt search focu build map fi fi map search translat affect term assumpt decomposit fi fi good studi issu section fi fi map decomposit close formal verifi assumpt proof gener hold case assumpt individu lead assumpt valid closest map construct separ compon composit algorithm assumpt harmless stress rare except fi fi remain good map composit separ translat queri composit fi handl subqueri separ fi fi case obtain map simpli translat compon individu turn separ depend close metric chosen result disjunct separ requir perfect recal dual conjunct separ requir perfect due space refer appendix formal result simpli illustr figur closest map queri calendar system compar disjunct conjunct separ figur show closest map show determin turn disjunct verifi obtain opposit conjunct figur disjunct metric conjunct disjunct separ gener framework flexibl approxim metric cope potenti insepar type discuss approxim framework algorithm section present framework algorithm approxim translat section defin translat rule system codifi map basic semant unit base algorithm rewrit origin queri semant unit construct closest map rewrit respect composit separ ensur map present algorithm section semant translat rule queri translat base human resolv semant heterogen section identifi essenti requir rule system codifi human illustr rule base mechan design earlier specif map adapt mechan handl semant unit complex gener approxim translat stress contribut rule system integr gener queri map scheme rule system simpl note algorithm work rule mechan satisfi emit emit emit emit emit emit emit emit emit emit figur map specif med respect sound complet requir adopt sophist rule support queri pattern conjunct arbitrari number simpl system suit queri translat demonstr case studi section figur show map specif med consist rule translat queri search media item video real scenario section discuss assum rule defin closest map respect match queri illustr figur show estim map stress algorithm requir numer valu comput map quantifi actual close output estim base rule techniqu appendix illustr rule translat media format origin context expect format disc vh dvd target accept media type video format constraint atom rule defin map access vh dvd vh account eq close map simpli keyword desc textual descript vh descript mention hand vh item closest map respect relev map rule simpli match format constraint left side defin respect emit side notic queri pair format map perfectli type construct perfect map queri form semant unit rule defin translat left match disjunct pattern satisfi condit pair format match side find type function emit note assum condit function implement extern program languag discuss assum origin queri med run figur queri vh dvd titl tom hank tom note omit oper notat map begin match rule find subqueri construct illustr match med rule med find subqueri med match pattern rule med match complex queri perform match normal dnf normal chosen cnf conjunct normal form choic affect structur subsequ section write med dnf compar dnf pattern rule note dnf form write stress similarli med figur framework rule specifi dnf pattern form dm rule pattern determin rule pattern match subqueri med pattern repres check queri note simpl simpler complex match part pattern match bound constant simpler similarli match simpler match subqueri vd figur med match repeat process rule find match figur match med dnf figur summar match rule output estim figur algorithm paramet valu comput enabl queri assum essenti requir semant rule requir rule defin closest map match queri respect refer sound requir rule gener sound determin sourc statist perform sampl estim recal map highest simpli make intuit practic close function explicitli requir defin map section discuss vd tc med rule match rule output vd vd tc tc match queri dnf match map figur queri med match respect med requir rule semant refer complet enforc rule suppli semant unit queri closest map construct subqueri semant unit queri map manual defin rule note individu constraint semant med describ unit semant unit composit queri separ result show queri composit insepar form depend disjunct separ theorem appendix semant unit rule interrel expect semant unit conjunct theorem section close metric disjunct conjunct semant unit complex queri case unit complex simpl disjunct conjunct med algorithm gener handl complex unit stress sound complet requir enabl analog approach origin queri match semant unit simpli fire rule comput denot rule output match sound requir ensur match rule match complet requir semant unit construct semant unit subqueri med found match subqueri figur semant unit build block construct med construct complex map main challeng discuss algorithm base algorithm section present core algorithm framework translat arbitrari origin queri base rule system algorithm construct map queri semant unit construct complex essenti rewrit semant unit queri med construct map unit tc vd figur med tc vd denot rule output match rewrit med boolean function tc vd tc vd rewrit logic med refer rewrit break queri semant unit base decomposit simpli construct med tc vd exist decomposit tc med queri map find safe composit separ optim map construct straightforwardli simpli separ deal semant unit rule note safe decomposit shown result appendix determin med obtain med tc vd separ composit appli rule unit construct map form med tc vd main challeng map queri find safe decomposit result theorem show practic exist safe decomposit queri algorithm find uniqu decomposit construct closest map queri map rule output closest map respect close metric defin refer figur formul safe decomposit step step final step construct illustr translat med med defin map figur summar show input output step algorithm essenti base boolean normal form systemat rewrit queri safe decomposit figur start normal input queri med dnf step final formul safe decomposit cnf semant step note structur dual algorithm start cnf conclud dnf summar figur show begin step normal med step perform rule match section discuss result match unit figur algorithm systemat rewrit med safe decomposit cnf simpl tree root conjunct leaf disjunct ensur cnf rewrit step algorithm base queri map arbitrari queri origin context constraint map speci cation target system wrt close criterion closest map wrt dnf convert dnf simpl conjunct constraint rule match output rule semant unit match mu wrt note ij safe rewrit safe conjunct conjunct form safe disjunct safe ck rewrit ck xm ck match ij ck found omit redund st cover subset term ck safe term match unit map comput rule relev match output construct map function rewrit queri dnf safe conjunct cnf conjunct rewrit dnf disjunct match found rewrit ij ij disjunct line ij ij simpl ij simpler st ij omit ij simpler cnf standard boolean algebra convert conjunct form rewrit cnf term ij st xm denot ij formul omit redund cnf st store formul conjunct xm formul fm ij cg found st ij cg safe disjunct step rewrit perform rewrit return rewritten safe figur algorithm approxim queri translat form separ conjunct safe similarli step form separ disjunct safe leav step rewrit med conjunct form figur med step rewrit result conjunct separ disjunct semant conjunct tc vd illustr formul safe decomposit tc vd algorithm simpli construct med discuss med tc vd dnf normal med rule match med safe disjunct map construct safe conjunct med tcd med tc vd tc figur algorithm figur illustr algorithm queri med respect rule med explain step algorithm function rewrit input queri conjunct separ determin conjunct develop suffici condit safeti impli separ due space leav appendix safeti formal simpli stress conjunct step formul satisfi safeti condit appendix separ eventu form safe decomposit med semant unit figur form safe decomposit conjunct note med unit written conjunct explicit leav queri med figur show rewrit unit vd omit subexpress redund contribut rewritten med goal formul conjunct root queri rewrit step simpli distribut outer disjunct conjunct standard boolean omit obtain conjunct form med conjunct appendix show conjunct safe step determin conjunct readi step algorithm rewrit test written sum unit essenti safe disjunct step refer figur unit vd write sum vd similarli shown result conjunct written call simpler conjunct queri wx match unit wx wx yz rewrit conjunct written simpli conjunct call rewrit conjunct written process eventu termin produc separ deriv strictli simpler subqueri illustr termin simplest form disjunct atom constraint trivial sum unit refer refer formal proof conjunct formul separ form safe conjunct step algorithm focu disjunct step illustr continu step rewrit conjunct safe disjunct discuss result disjunct satisfi condit theorem appendix step ensur written sum vd remov redund term vd vd obtain vd rewrit tc appendix show disjunct turn semant unit disjunct formul safe separ rare interlock safe decomposit exist step form safe disjunct major result disjunct decomposit safe construct safe algorithm gener illustr base optim map semant unit sound respect constraint depend unit preserv optim queri optim map result show vast major semant unit queri uniqu safe decomposit algorithm find uniqu decomposit construct closest map refer refer proof theorem safe queri map specif wrt close criterion interlock semant unit match ffl exist uniqu safe decomposit wrt ffl algorithm find safe decomposit output interlock safe decomposit exist theorem state queri involv interlock safe decomposit note found unsaf decomposit complet requir section assert construct decomposit semant formal defin interlock illustr definit set semant unit exist dnf dnf ij ij overlap strictli simpler ij strictli complex simpler cnf cnf ij ij ij queri xy match semant unit xz xy note unit interlock exist constraint involv conjunct xy disjunct xz show interlock definit xz xy condit term satisfi respect term similarli term respect term term strictli complex subexpress satisfi cnf cnf cnf condit hold safe decomposit theorem interlock rewrit semant separ disjunct xy conjunct remain xy break depend xz safe fail safeti condit theorem appendix break xy xz unsaf theorem appendix interlock case rare practic intuit note interlock occur unit xy xz interlock happen constraint particip conjunct unit xy disjunct unit xz interlock form unit semant unit repres interdepend complex interlock practic case studi real map system section observ instanc interlock safe decomposit algorithm construct address except case simpli requir interlock queri defin rule find unsaf estim close select note estim paramet close construct show estim techniqu appendix due space limit conclud analyz run time algorithm step step subroutin perform dnf cnf gener exponenti number queri constraint boolean satisfi problem studi practic algorithm literatur queri practic normal effici step algorithm effici run linear time input queri rule input dnf step dq nq number disjunct dnf dr nr dnf queri pattern rule number rule input size step time algorithm match pair constraint factor pair queri rule disjunct factor rule factor step run cq number cnf conjunct upper bound step number match found step step simpli time practic case studi verifi framework make explor inform sourc web studi gener framework specif map system demonstr map rule repres scenario concret understand practic issu number rule typic approxim essenti practic mediat build mediat integr onlin sourc amazon bn onlin eb comparison shop socrat librari onlin publicli scenario assum mediat integr sourc adopt amazon queri context translat sourc demonstr constraint map amazon socrat target compar constraint vocabulari support amazon defin map rule figur rule rule rule eb section rule map match semant unit respect close assum practic requir explicitli close discuss section rule map constraint attribut format amazon context format bn context note defin map focu cluster attribut queri interfac case document url link amazon distinguish author separ ln fn translat target bn emit emit emit emit emit emit emit target socrat emit emit emit true target eb emit emit emit emit emit emit true figur rule map amazon sourc eb context cluster fng amazon correspond map note true trivial trivial map rule effect remov match unit translat queri observ case studi show framework present easili appli practic number map rule observ constraint depend exist cluster attribut fng typic simpl rule describ composit number atom constraint pattern origin context note rule queri pattern instanti start share found true studi map rule sourc share common observ instanc interlock unit section note semant unit essenti correspond junction ln fn versu author similarli month year versu disjunct format versu type observ attribut involv type interlock simpli occur section algorithm gener uniqu map practic case framework formal support notion close function explicitli requir defin map rule semant intuit map compet choic explicitli comput close valu metric map defin implicit metric correspond mind stress theorem algorithm preserv optim respect close metric map rule conform explicitli implicitli case studi show gener notion approxim paper specif essenti framework observ twenti rule figur perfect ratio approxim gener framework deal type superset subset hybrid map approxim translat techniqu present paper practic studi addit scenario present case found observ hold paper present framework algorithm approxim queri translat framework robust virtual reason close metric combin recal intuit present result separ safeti queri composit cover full detail result critic develop algorithm attempt approxim queri translat algorithm gener uniqu practic case semant unit algorithm gener closest comput actual term recal paramet algorithm explicitli paramet valu comput essenti oper case desir estim map complement translat develop simpl formula cover appendix implement run prototyp queri translat stanford digit librari project prototyp base earlier work map experi realiz approxim translat critic motiv work paper process extend prototyp algorithm discuss paper refer wiederhold mediat architectur futur inform system ieee mar ullman inform integr logic view intern confer jan berlin chang mind queri map heterogen inform sourc acm sigmod page june acm york chang mind queri map heterogen inform sourc technic report stanford access refer section end report hull manag semant heterogen theoret perspect acm symposium principl page acm york hearst trend inform integr ieee intellig sept ordil queri heterogen inform sourc sourc descript vldb page vldb calif ordil algorithm inform agent nation confer artifici aug aaai menlo calif ullman mediat system base declar specif intern confer data ullman queri translat scheme rapid implement wrapper intern confer deduct page dec berlin duschka queri plan optim inform integr phd stanford dec duschka inform integr system acm sigmod acm york yang optim queri data sourc vldb page aug vldb calif roth schwarz dont scrap wrap wrapper architectur legaci data sourc vldb page aug vldb calif valduriez deal discrep wrapper function technic report yerneni capabl sensit queri process internet sourc intern confer data mar access ullman answer queri templat bind pattern acm symposium principl page san ullman answer queri limit extern queri processor acm symposium principl page june resolv approach perform relat oper mismatch domain ieee transact knowledg data rosenth semant valu facilit heterogen inform system transact june wong data transform system biolog data sourc vldb vldb calif milo correspond translat heterogen data intern confer berlin mediat data acm sigmod acm york chang conjunct constraint map data translat acm intern confer digit page june acm york chaudhuri find envelop datalog predic acm symposium principl page acm york chaudhuri kolaiti datalog acm symposium principl page acm york chekuri filter approxim predic vldb page york vldb calif ooi answer intern confer data page acm york poosala fast approxim queri answer precomput statist intern confer data page acm york carei kossmann sql acm sigmod page acm york carei kossmann reduc brake distanc sql queri engin vldb page york vldb calif watter semant complex object approxim answer journal comput system aug design implement acm sigmod page acm york rijsbergen inform edit salton automat text process ullman design analysi comput algorithm logic design principl prentic englewood appendix composit separ major complic queri map composit arbitrarili separ obtain map fi fi conjunct separ fi fi section present result separ depend close criteria shown opposit result separ composit focu disjunct note disjunct potenti enhanc recal disjunct repres broader condit disjunct disjunct broader condit actual lead broader map individu disjunct broader map potenti reduc enhanc recal maintain result closer map section explain metric monoton result addit reduc introduc posit result state disjunct valid map perfect recal note translat system explicitli requir map disjunct map perfect recal disjunct enhanc separ theorem formal state result refer refer proof write stress similarli theorem respect close criterion disjunct closest map respect perfect dual result appli theorem state conjunct separ enforc perfect verifi conjunct separ theorem respect close criterion conjunct closest map respect perfect verifi definit satisfi theorem import special map problem elimin complic disjunct conjunct figur closest map theorem show gener close criteria impli insepar type composit reason metric satisfi theorem simpli special case stress disjunct conjunct gener separ contrast continu theorem disjunct separ map refer figur obtain compar miss achiev gener framework cope potenti insepar disjunct conjunct begin semant unit complex queri conjunct map algorithm type composit carefulli paper studi gener map framework composit insepar due practic limit target system complic reinforc gener algorithm focu semant implicitli assum target support queri arbitrari size disjunct insepar similarli conjunct map conjunct queri target full queri perfect map adopt close criterion theorem conjunct theori translat alphabet string miss conceptu translat separ practic unbound map support formul map probabl finit incomplet miss potenti miss separ safeti separ composit section develop safeti condit queri disjunct conjunct separ safeti condit suffici condit impli separ composit theorem queri composit gener separ section discuss mechan determin composit separ base semant unit start show separ disjunct decomposit subqueri med theorem safe separ note match rule med construct decomposit subqueri match match tc figur separ potenti decomposit term semant unit implicitli separ verifi altern tc note simpli rewrit semant unit observ implicitli separ write simpli tc separ clear write implicitli separ contrast subqueri med theorem determin safe separ fact decomposit separ note match vd figur respect med decomposit built unit separ vd pure written correspond separ subsequ deriv decomposit separ miss decomposit lead map vd figur closest show perfect definit note write rule perfectli translat vd rule vd base map perfect observ contrast disjunct form semant unit match found tc semant unit span decomposit implicitli separ match vd found disjunct decomposit vd merg disjunct separ vd construct safe decomposit miss vd critic perfectli map factor determin disjunct safe check effect disjunct semant unit theorem formal state safeti condit illustr give proof refer theorem disjunct cnf im separ wrt rule match wrt ik jh ik jh ik satisfi illustr theorem show safe fail start write cnf cnf test combin fail condit find vd vd vd satisfi condit conclud unsaf separ theorem formal state dual safeti condit conjunct intuit illustr theorem theorem conjunct dnf im separ wrt rule match wrt ik jh ik jh ik satisfi illustr theorem show safe simpli rewrit med share match theorem dnf find conjunct factor combin safe contribut conjunct factor part match find theorem determin safe theorem disregard close criteria semant unit match composit depend map turn defin specif regard section shown unsaf vd match med depend med base metric rule defin vd semant case safe safeti composit essenti mean closest map construct separ estim recal algorithm gener comput term recal queri algorithm find uniqu observ explicitli recal valu semant unit case desir estim map mediat estim comput queri cost submit translat queri estim determin unsaf decomposit interlock case section present simpl formula estim formula reason approxim measur close map goal present approxim formula simpli show formula exist scope paper show formula work practic formula complement translat essenti note estim analog queri optim estim queri result size map queri construct semant estim paramet base estim evolv boolean composit combin basic unit complex map queri approxim recal similarli recal map composit queri find ab ab term disjunct begin comput recal eq ab estim size queri eq note select size rel denot queri write ab factor ab model logic correl factor simpli ab ab correl ab correl estim base assum correl preserv translat assum map correl estim ab eq correl obtain ab substitut rel estim recal eq show ab ab ab ab ab ab ab estim disjunct map find ab ab eq comput recal ab clear estim rel size select disjunct similar analysi disjunct select estim essenti count domin term begin write approxim term comparison comput numer eq observ term eq queri map highli correl arbitrari independ similarli term magnitud magnitud note eq write approxim eq substitut size estim eq obtain ab simpli weight averag deriv ab eq show ab ab extend materi technic appendix proof theorem develop paper composit monoton show assumpt hold dual case shown similarli refer eq valid map queri similarli begin show closest definit definit eq assum show hold deriv conjunct valid superset map conjunct fact map ae follow eq closer map contradict fi fi fi fi closer map composit fi fi recal fi fi fi fi fi fi fi fi follow eq fi fi fi fi refer eq obtain fi fi fi fi assumpt hold composit separ theorem respect close criterion disjunct closest map respect perfect show requir perfect disjunct separ prove contradict assum comput denot monoton higher recal higher imposs perfect higher js jm perfect inequ jsj jm appendix jsj jm follow exist focu show closest map deriv contradict note support target support gener assum unrestrict queri except show closer map monoton ffl recal introduc respect jd jd ffl higher ae remov shown sj show requir perfect construct disjunct separ disjunct assum valid map defin disjunct separ assumpt critic construct hold true requir perfect recal requir assum exist sourc queri subexpress disjunct map satisfi hold note condit hold assum condit lead contrari show higher recal support condit condit correct result miss ad remov result higher recal show oe left side appendix oe deriv oe jm qj jm qj jm qj qj jm qj qj closer map consequ satisfi monoton closest map separ theorem respect close criterion conjunct closest map respect perfect proof straightforwardli parallel theorem omit detail safeti separ composit theorem disjunct cnf im separ wrt rule match wrt ik jh ik jh ik satisfi match wrt exist decomposit decomposit exist complet match sound lemma write decomposit term semant map assumpt composit monoton impli map equal composit result lead closer deriv separ lemma disjunct satisfi theorem wrt rule match wrt decomposit implicitli separ decomposit appendix proof base statement show simpl conjunct match write dnf dnf xm simpl conjunct match statement disjunct rewrit note construct rewrit construct statement decomposit lemma proven show statement correct show statement hold cnf im ij simpl disjunct prove auxiliari statement exist ij ij ij ij cnf ij combin ik exist ik obtain note simpl ik exist base show nj cnf show nj nj nj combin nj ij ij note statement ij term exist satisfi theorem satisfi condit theorem show nj ffl satisfi condit statement condit exist ik ik ik hold appendix ffl satisfi condit exist satisfi condit explain jh jh condit exist ik jh ik ik ik prove contradict assum loss similarli prove assumpt mean ae oe deriv obtain show contrari note redund oe assumpt trivial subsum negat constraint assum posit deriv ae similarli prove theorem conjunct dnf im separ wrt rule match wrt ik jh ik jh ik satisfi proof straightforwardli parallel theorem omit detail lemma conjunct satisfi theorem wrt rule match wrt decomposit implicitli separ decomposit proof parallel lemma uniqu safe decomposit theorem safe queri map specif wrt close criterion interlock semant unit match ffl exist uniqu safe decomposit wrt ffl algorithm find safe decomposit output interlock safe decomposit exist appendix proof consist algorithm find decomposit safe exist safe decomposit find fact safe decomposit lead shown section decomposit unsaf safe decomposit uniqu show algorithm formul safe conjunct step rewrit conjunct safe disjunct step algorithm find safe decomposit begin step make subroutin refer figur continu ij relev match call rewritten strictli simpler term step rewritten strictli simpler conjunct step continu simplest form conjunct simpl disjunct constraint atom constraint match rule section simplest form conjunct satisfi condit line rewritten rewrit input queri step formul safe conjunct input return conjunct rewrit show conjunct safe theorem note formul dnf form km line addit subscript kl repres ij step ij dnf disjunct match found theorem requir test combin ku disjunct dnf ku note ku denot ij simpl conjunct ij term rewrit step rewrit dnf term ij term dm simpl conjunct case ae show case satisfi condit theorem return safe conjunct ffl equal ij construct step conjunct satisfi condit theorem match simpl conjunct ij dnf disjunct simpl hold refer step includ ij includ ij ij ij condit theorem hold appendix ffl subsum ae ij simpl conjunct ij subsumpt impli ij ku ij ku addit ku term correspond ij satisfi condit explain satisfi condit theorem show step rewrit conjunct result step safe disjunct begin note rewrit exist subroutin ensur test condit line fail test rewritten line show disjunct safe theorem cnf ij theorem requir check combin ik ik match found show satisfi condit theorem wrt combin safe ffl includ ik term jk jk conjunct cnf cnf jk condit theorem hold ffl subqueri equal assum condit theorem hold deriv contradict match interlock definit condit theorem dnf dnf ij algorithm match loss match ij overlap note ij strictli simpler subqueri found subqueri subqueri irrelev relev ij ij complex ij strictli complex equal ij includ algorithm includ disjunct case cnf cnf ij note assum condit theorem hold ik focu ik ik irrelev assumpt mean ik proven part algorithm formul safe show decomposit unsaf step rewrit safe appendix conjunct lemma decomposit written decomposit step rewrit safe disjunct kh lemma written kh ki decomposit ki ki ki decomposit differ ki ki begin trivial decomposit ki ki ki note result decomposit algorithm rewrit ki step shown part decomposit safe show decomposit ki ki result unsaf decomposit decomposit ki form ki fi fi fi subqueri ki ki semant unit rule complet ki decomposit ki fi fi ki decomposit ki safe ki trivial decomposit safe decomposit construct algorithm uniqu interlock safe decomposit exist shown counter interlock case appendix
ML/64 6 fast simpl support vector machin perceptron danni comput vision activ percept laboratori royal institut technolog sweden ieee intern workshop neural network signal process decemb abstract simpl implement support vector machin pattern base solv complex quadrat optim problem iter algorithm base simpl heurist algorithm solut fast experi coil extend coil sonar uci irvin solut similar found origin svm solut substanti requir comput resourc origin svm introduct support vector machin belong learn algorithm produc remark perform number dicult learn task requir prior knowledg mention exampl pattern handwritten digit recognit object recognit svm root statist learn theori gener behavior drawback svm implement complex constrain quadrat program problem solv quadrat program slow order converg solut number speedup implement quadrat program algorithm svm chunk sequenti minim optim approach formul real base quadrat optim hide algorithm learn increment favor geometr insight learn process learn process neural perceptron simpler understand consist simpl elementari process abstract simpl learn rule increment updat weight neuron disadvantag neural network learn learn determin automat number neuron determin altern regular paramet set hand gener capac neural network set design neural network empir combin approach unit algorithm theoret foundat svm simpl formul neural network call algorithm algorithm consist singl layer perceptron augment principl base control svm result algorithm base quadrat iter scheme base simpl heurist paper organ give overview origin support vector machin algorithm introduc algorithm conceptu concret implement oper input space ii oper space nal report result conclud support vector machin background reader support vector brie summar svm learn design system prede ne system architectur system ad hoc control manual capac approxim function learn algorithm svm approach algorithm control capac system automat statist learn theori theoret framework automat algorithm vladimir vapnik show learn system gener abil bound learn capac turn express dimens system svm minim system order minim gener error futur principl call structur risk minim concret support vector machin classi cation problem start linear classi linear classi er adapt introduc notion margin classi er closest train point linear classi er larg margin smaller gener properti linear classi er small margin svm search search optim maxim margin refer literatur full train data found kwk constrain order solv optim method lagrang multipli saddl point kwk lagrang multipli nding saddl point dual dual constraint quadrat program problem solut written linear de ned support determin support vector correspond mention closest point linear svm gener svm rst map input featur space dimens search space comput map explicitli formul scalar product calcul input scalar product replac kernel realiz map implicitli separ function written input space sgn note kernel classifi data featur requir comput input space avoid note featur space high input space dimens polynomi kernel result featur space dimens extend svm possibl cope misclassi ed call rst introduc svm implement aspect bound pattern recognit system obtain combin svm scheme construct multiclass classi er construct machin number machin train classi er class class order classifi test competit machin perform analog tenni winner compet winner singl winner remain nal winner determin class test data algorithm idea paramet optim hyperplan solv quadrat optim problem mention algorithm base observ determin support vector determin center support vector main task algorithm set support vector candid support heurist central nding set candid support vector increment heurist opposit class distanc closest probabl support vector select initi candid support vector pair point opposit class candid support heurist set candid support search train maxim violat current orient make data point member set candid support turn orient equal distant initi candid support vector base algorithm formul conceptu origin point center closest point opposit class initi candid support vector initi orient orthogon orient line connect point margin orthogon distanc point algorithm pair opposit class point largest violat respect make candid support vector rotat rotat run center candid support vector initi candid support vector opposit class actual updat subtract orthogon project previou rotat updat linear depend discov number updat equal number train exampl exce updat end point violat lie margin relax paramet found algorithm formul explicitli input space dual formul express data point function train data describ variant implement figur illustr initi algorithm orient rst updat input space star circl repres train point class separ full line current implement learn input space write vector determin origin point function written note interpret abstract neuron weight bia determin threshold found tabl rst updat illustr fig paramet algorithm control typic experi gave result algorithm scale order space number updat scale factor obtain updat orthogon perform previou number comput step updat comput step scale origin point heurist pair closest initi kw calc heurist minim ck ck rk ck kr wk kw updat repeat maxim lg time maxim trial tabl pseudo input space center opposit class candid support vector amount rotat perform order account candid support vector number updat order number support number support vector fraction number train algorithm slower quadrat number train vector note origin svm algorithm scale typic quadrat scale cubic number train scale behavior point number case implement lot pattern recognit task solv linear classi er input space larger compar number train learn data patholog case amount prior knowledg task linear classi er classi er case note applic domain input space common problem percept input space dimens order million learn space build complex classi er linear map data featur space dimens search map space analog map perform implicitli ecient kernel method kernel method requir formul term train data dual normal vector rewritten linear combin train vector origin point heurist pair closest featur space initi calc heurist minim ck rk ck kr wk kw updat repeat maxim lg time maxim trial tabl ii pseudo space write featur space linear combin map train vector capit vector written dual featur space determin coecient origin determin coecient updat consist modifi coecient similar pseudo code ii found tabl time requir execut implement order number updat requir estim base updat orthogon requir comput step comput step involv comput previou support vector calcul perform path reason implement scale cubic number train exampl compar origin svm algorithm actual speedup determin depend dataset result compar result result obtain standard implement origin svm develop royal compar nearest neighbor classi er refer classi er execut time measur sun workstat mhz ultrasparc processor result columbia imag librari extend coil standard data larger total number train data result ii sonar sejnowski part uci repositori machin learn process test learn algorithm handwritten digit recognit moment write result coil coil consist imag object di erent view color imag present space vari diculti problem vari number view object shown train task recogn di erent object unseen view present averag perform ed shown tabl perform svm similar comput requir experi perform task substanti faster memori requir svm object svm tabl classi ed unseen coil object imag left demand gener abil learn algorithm extend coil extend coil coil imag object varieti di erent background bw train consist train view object black background white order make classi er experi variabl previou experi number train view singl object constant perform task similar accuraci svm faster comput resourc uci sonar sonar consist measur sonar data rock mine data repres space train set consist test system polynomi vari perform extend object imag unseen background grei svm tabl extend coil object recognit di erent bw train scheme learn train test time memori time imag min min mb mb ms svm min min mb mb ms mb mb ms tabl approxim requir comput resourc train test coil extend coil experi requir time larger train set svm ident tabl perform report classi er time requir perform experi faster svm kernel polynomi svm tabl number error test set sonar size note perform svm polynomi kernel obtain di erent algorithm implement support vector machin code solv complex quadrat program problem iter updat scheme base heurist result extend uci sonar solut similar origin requir substanti comput resourc train time acknowledg dr wendi li manuscript dr support tmr grant european commiss refer object recognit algorithm realist proc int conf arti cial neural network train algorithm optim margin classi ann workshop comput learn pittsburgh machin learn hidden unit layer network train classifi sonar neural network support vector machin learn practic advanc kernel learn algorithm handwritten digit proc int conf arti cial neural network object imag librari rep dept comp columbia improv train algorithm support vector proc ieee neural sign proc minim fast algorithm train support vector rep microsoft vector machin object recognit ieee tran pattern analysi machin intellig linear support vector applic object recognit clutter proc svm workshop int joint conf artif intel august vector machin refer royal hollowai statist learn seri adapt learn system signal comm john wilei
ML/65 6 error correct output code local learner francesco ricci istituto la ricerca povo itali david aha navi center appli research artifici intellig naval research code dc usa paper bia varianc decomposit analysi local learn nearest neighbor extend error correct output code extend algorithm reduc error comparison nearest neighbor analysi present reveal perform improv obtain drastic reduc bia cost varianc show classif problem class extend codeword length limit assur column separ yield error reduct error reduct due vote mechan output bia output bia varianc error correct output code local learner francesco ricci david aha istituto la ricerca povo itali navi center appli research artifici intellig naval research code dc usa abstract paper bia varianc decomposit analysi local learn nearest neighbor extend error correct output code extend algorithm reduc error comparison nearest neighbor analysi present reveal perform improv obtain drastic reduc bia cost varianc show classif problem class extend codeword length limit assur column separ yield error reduct error reduct due vote mechan output bia introduct dietterich bakiri introduc output code repres class label learn task found ecoc significantli classif accuraci learn algorithm multiclass task kong dietterich analyz algorithm report ecoc reduc bia varianc algorithm investig studi error backpropag rumelhart exampl global learn algorithm gener classif predict examin map instanc class entir train set distinguish local learn algorithm bottou nearest neighbor gener classif predict examin map nearbi instanc inform context distinct global algorithm benefit ecoc classif predict gener output bit correl local algorithm benefit ecoc independ output bit class gener classif predict base inform train output bit predict correl kong wettschereck ricci confirm analysi introduc method overcom featur select independ output ensur technic report local inform gener classif predict output bit result local ecoc extens nearest neighbor significantli classif accuraci multiclass task includ followup analysi explain condit data benefit perform decomposit analysi perform analysi show benefit provid ecoc local learn approach differ provid global learn algorithm ecoc reduc bia varianc local learn reduc bia varianc section review definit bia section review output code section summar decomposit analysi local learn archiv data section discuss wai varianc reduc approach appli task featur bia varianc decomposit section review decomposit error definit classif problem assum exist random describ input paramet discret variabl finit number call class classif problem complet real determinist function goal produc classifi kg minim misclassif error function argument true minimum misclassif rate obtain optim arg max misclassif rate max finit train set mg classifi induc learner depend denot classifi form approxim form rule arg max classifi skip step immedi build case aggreg classifi ya defin ya arg max approxim differ yield behavior optim classifi ya breiman defin classifi ya replic classifi pick correct class set instanc complement point defin bia varianc loss function equat comput decomposit properti definit worth bia varianc neg fact immedi definit neg varianc main limit similar decomposit kong dietterich varianc aggreg classifi aggreg optim classifi properti share determinist classifi behavior independ train set bia classifi simpl consequ definit natur requir share decomposit kohavi wolpert error correct output code error correct output code multiclass classif techniqu class encod string call codeword dietterich test class codeword smallest ham distanc predict codeword assign detail techniqu integr nearest neighbor classifi ricci number class integ creat correspond encod code il ij matrix valu finit set ham distanc row ij tabl class encod class encod type atom distribut ecoc martian italian ham distanc column figur show type encod standard encod class symbol string length encod exampl distribut class encod boolean string length ham distanc pair codeword ecoc encod gener string il row ij minim ham distanc codeword error correct capabl number erron predict bit greater correct class closest ham distanc ecoc encod shown figur column matrix ij partit class instanc disjoint set boolean encod length yield bit function train instanc denot bit function instanc ecoc classifi train test learn function train set gener instanc test set predict bit function assign arg il defin ham comput error averag error test set gener scheme learn techniqu learn bit function step dietterich bakiri report ecoc significantli classif accuraci network train backpropag ricci aha extend result local learn algorithm implement nearest neighbor classifi ecoc work bit function bia error kong ricci show bia error made local learner bit function decorrel select featur function perform featur modifi schemata race algorithm maron ricci section illustr effect ecoc featur select bia varianc compon error bia varianc output code section empir determin bia varianc ecoc classifi archiv data set equat bia varianc estim optim error rate rule error rate data set kohavi wolpert frequenc count estim optim error observ instanc uniqu data set estim optim error rate decomposit error base assumpt reliabl make assumpt reason assum optim error rate mean overestim varianc bia equat posit nearest neighbor classifi high bia decomposit error artifici data set show tabl true bia real data set obtain estim subtract part error rate equat greatli differ high compar size varianc experi perform data error rate decomposit observ similar behavior bia varianc respect nearest neighbor classifi expect aggreg classifi test algorithm similar set bia varianc algorithm due overestim bia varianc fact part error subtract estim bia depend bia set aggreg classifi equat argument appli varianc class distribut data set defin probabl optim error rate comput data set randomli split data data train test rel frequenc instanc data set classifi estim bia set complement obtain base estim summari descript archiv data set shown tabl inform data found ricci archiv data set result experi conduct archiv data shown tabl implement nearest neighbor classifi baselin algorithm atom ecoc correct differ tabl select data set data set size glass gl tabl bia varianc decomposit error archiv data dataset glass bia varianc bia varianc bia varianc bia varianc bia varianc emploi featur select compon distinct featur select task output bit ricci distinct class encod optim error rate report assum explain data set ecoc record smaller error atom ecoc yield higher error class encod space defin class small gener suffici distinct codeword shown tabl conclud ecoc drastic reduc bia compon error cost varianc bia reduc minimum maximum total error obtain ecoc moder varianc ecoc varianc varianc data briefli explor method train set size codeword length varianc train set size exhaust code techniqu gener bit function codeword length emphasi codeword length bia error fig bia error vari codeword length compar tabl train ecoc varianc codeword length reduc ecoc exemplifi figur plot bia total error ecoc codeword length figur show larger varianc bia codeword length choic codeword influenc oscil convinc result obtain cross valid choic codeword synthet classif task state decomposit error archiv data set difficult estim optim error rate rate easili comput synthet classif task assum model data investig set data set instanc class drawn multivari normal distribut unit covari matrix class class class half posit ecoc classifi result aha set codeword codeword length tabl bia varianc decomposit error data dataset bia varianc bia varianc wave bia varianc led bia varianc half neg binari gener data set breiman set optim error rate data set instanc class multivari normal covari matrix time data set similar data set optim error rate wave data set similar cart breiman ten class instanc instanc belong class featur equal featur equal featur random ad featur standard deviat set optim error rate led classic led displai dataset cart breiman boolean featur ten class optim error rate tabl show decomposit error set algorithm appli archiv data set behavior ecoc synthet data set analog observ archiv ecoc record lower error rate reduc bia varianc data error reduc featur select featur relev mutual explain atom record higher error rate ecoc lower error rate led task low bia task room improv discuss improv main find section ecoc extens local classifi featur select perform decorrel reduc bia cost varianc trade posit bia error class techniqu describ report addit investig reduc varianc kong dietterich show varianc error ecoc reduc multipl repetit classifi built bootstrap train set case local classifi ecoc local classifi research regress theori shown varianc combin influenc instanc nearbi queri geman replac neighbor classifi atkeson appli led displai algorithm ecoc variant yield varianc bia equal varianc reduc longer demonstr figur combin predict multipl bit function yield class predict form benefici effect mention appar techniqu data set small number class maxim number codeword column separ row separ number class dietterich note data set bit function creat bit function learn random featur select algorithm bit function defin train featur select differ bia error evalu algorithm longer codeword column distinct bit function appli techniqu codeword length total error var var procedur greatli reduc varianc error task featur decorrel classif error bit function featur select techniqu reason data set featur form redund mean set featur modifi replac chang predict data set featur method applic test hypothesi synthet data set featur figur depict class separ instanc randomli chosen uniform distribut ecoc compar bia bia varianc observ atom behavior featur error significantli higher bia due varianc extend nearest neighbor classifi output code featur select significantli reduc error task error reduct obtain reduc bia compon varianc show classif problem class extend codeword length limit ensur column separ properti reduc error rate reduc varianc extend local learner ecoc data set fig synthet data set local learner small bia high varianc error show replac local learner smaller varianc benefit ecoc encod acknowledg leo breiman suggest research support part grant offic naval research refer aha bankert cloud classif output code artifici intellig natur aha toler attribut learn algorithm intern journal schaal local weight learn artifici intellig leon bottou vladimir vapnik local learn algorithm neural stone classif regress tree wadsworth intern breiman arc classifi technic report april leo breiman bag predictor machin dietterich bakiri output gener method improv multiclass induct learn program ninth nation confer artifici page aaai press dietterich bakiri solv multiclass learn problem output code journal artifici intellig friedman technic stanford august neural network dilemma neural kohavi wolpert bia varianc decomposit loss function thirteenth intern confer machin page morgan kaufmann kong dietterich output code correct bia varianc twelfth intern confer machin page taho morgan kaufmann maron moor race model select lazi learner artifici intellig page quinlan program machin learn morgan san ricci aha extend local learner output code technic report naval research navi center appli research artifici januari rumelhart editor parallel distribut explor cognit mit wettschereck dietterich improv perform radial basi function network learn center locat neural inform process system morgan san articl process macro packag llnc style
DB/66 3 schema evolut heterogen schema transform approach paper peter dept imperi queen london dept comput london mondai march abstract previou work develop gener framework support schema transform integr heterogen architectur framework consist common data model set primit schema transform defin model common data model primit schema transform defin term model kei featur framework primit composit schema transform automat shown earlier work automat queri translat global schema set sourc schema paper show framework readili support evolut sourc global schema queri translat pathwai easili sourc schema introduct common method integr heterogen data sourc requir logic integr due variat design data model logic integr requir transform integr set sourc schema global translat queri pose global schema queri pose sourc schema previou work provid gener formal underpin schema transform automat translat queri pose global schema queri pose sourc schema approach applic main architectur mediat workflow paper problem evolv global schema repair queri translat pathwai face sourc schema evolut current implement tsimmi im garlic term provid mechan user defin global schema construct view sourc schema construct vice versa case focu semant data sourc recent work automat wrapper gener mediat approach provid mechan user specifi transform schema transform autom translat queri global sourc schema approach advantag human input integr process semant data paper automat queri process schema sequenc small step provis set primit transform increment complex transform pathwai schema automat translat queri pose global schema queri pose set sourc enabl systemat repair global schema global queri translat face evolv sourc schema work schema evolut present approach term data model er oo workflow approach repres higherlevel data model languag term underli data model paper method appli common data model languag argu uniform approach schema evolut schema integr desir logic describ relationship contrast approach simpl set schema transform primit augment logic advantag approach distinguish construct distinguish queri translat schema abil present approach approach specif readili transfer data model remaind paper structur section review hypergraph data model underpin approach primit transform schema defin data model present concret version framework adopt specif queri languag section show global schema global queri translat repair face sourc schema evolut sourc schema semant semant contract semant expand schema section show approach appli repair global schema defin model languag section conclud remark direct work schema framework review previou work schema hypergraph data model tripl queri schema express variabl member node edg node edg defin nest hypergraph edg link number node edg facil order support construct composit attribut attribut relat direct hypergraph edg link sequenc node edg constraint set queri node uniqu identifi edg constraint option instanc schema set set satisfi construct node denot ext deriv set deriv set extent node queri languag specif languag deriv point fix framework paper ext valu extent construct link constraint constraint queri construct node edg model tripl ext schema set instanc condit schema subsum schema wrt instanc satisfi instanc schema wrt subsum wrt list primit transform transform function appli model return model transform proviso state transform success unsuccess transform return denot oe transform appli oe return renam node node renam edg edg add constraint evalu true delet constraint exist qi add node extent queri node exist qi delet node queri state extent delet node recov extent remain schema construct violat properti node exist particip edg qi add edg sequenc exist schema construct extent edg queri edg satisfi domain constraint qi delet edg state extent delet edg recov extent remain schema construct edg exist particip edg version extra argument condit satisfi order transform success kei point note queri transform ensur construct ad semant redund state deriv schema construct queri transform ensur construct delet semant redund composit transform sequenc primit transform transform wrt schema return oe model wrt easi schema transform schema mean vice transform mean transform proviso vice wrt develop definit schema context er common data detail comparison approach schema schema transform found hypergraph data model primit transform introduc show paper model languag schema transform defin term develop gener method defin semant model languag term show set primit schema transform model languag automat deriv transform map schema express model languag unifi underli construct model languag mix defin link construct integr situat singl common data model fulli repres construct data sourc develop distinguish featur schema transform defin construct defin term automat primit transform ext oe exist transform ext ext shown notic depend condit success necessarili hold verifi transform transform toi toi qi qi qi qi qi qi qi qi defin transform order transform overlap schema schema sourc schema global schema transform defin term exist transform extend transform void queri construct deriv exist schema construct contract transform void queri similarli remov construct deriv remain schema primit transform success composit composit transform composit transform schema transform set transform pathwai pair schema show pathwai automat translat queri direct pair semant overlap schema transform singl primit case order translat queri pose queri pose appli renam substitut occurr delet node edg restor toi toi qi qi composit substitut success appli order obtain final translat queri paper work part staff skill dept staff skill part locat staff site manag dept staff locat work part locat staff site skill manag dept global integr figur sourc global schema concret schema languag order illustr schema framework review easili illustr approach hand schema evolut henceforth concret version framework assum schema express low level queri constraint express datalog illustr concret schema languag mean exampl show transform integr sourc schema global queri translat global schema sourc schema automat support exampl sourc schema global schema illustr figur inform staff manag depart node extent instanc staff manag link true instanc staff link inform manag constrain peopl datalog rule site integr renam work class manag attribut build global schema transform composit transform list label primit transform step transform refer paper step statement state popul extent node manag extent exist schema construct manag add inform extent manag popul instanc staff link true instanc step statement identifi edg delet statement state extent delet edg recov remain schema construct redund instanc creat manag instanc creat staff member manag paper step statement state extent delet node case simpl valu rest syntax transform begin site end transform begin work skill end transform automat deriv discuss section transform begin site end transform begin skill work end queri translat transform automat translat queri pose queri queri depart staff base work part locat translat conjunct queri shown transform notic conjunct answer fourth conjunct conjunct sourc schema paper sn tn oe figur evolut sourc schema translat work part void global queri work part locat translat void part locat translat build global queri plan list construct mean queri execut schema handl evolut sourc schema global schema repair order reflect sourc queri translat oper repair global schema exampl assum schema datalog treatment fulli gener appli schema construct queri formal section discuss sourc schema sn transform integr global schema transform tn sn transform tn sn automat deriv translat queri pose queri sn sourc schema evolut problem illustr figur sourc schema repair reflect chang queri repair translat order oper loss consist singl primit transform composit transform handl sequenc primit transform class primit transform ffl result schema ffl contract ffl extens paper transform applic primit transform automat deriv transform pathwai transform pathwai rest simplif result case contract extens work transform defin provid automat translat pathwai sourc schema decid evolv schema figur schema model notion manag figur achiev composit transform begin end transform deriv transform begin end transform obtain prefix transform step transform transform begin paper work part staff skill manag dept staff skill manag locat staff site manag figur evolut sourc schema site end transform obtain append transform step transform transform begin site end transform automat translat queri pose queri remov redund transform step composit transform pair primit transform step remov alter effect paper transform composit transform arbitrari sequenc primit primit transform simplifi provid refer construct ad delet transform step obtain expect simplifi transform begin site end transform step obtain expect simplifi transform begin site end contract transform transform primit transform form contract transform pathwai contract translat involv construct correctli replac void seri contract sourc global schema eventu construct longer support sourc schema repair longer unsupport construct dynam repair queri pose construct return void local construct remov note construct remov node remov edg particip repair construct longer support sourc schema static repair trace remov construct repres call global transform trace repres sourc schema sourc construct void remov care remov node remov edg particip illustr remov construct sourc schema construct deriv sourc requir remov construct global schema contract sourc schema paper owner schema decid export inform depart deriv schema illustr figur transform begin dept end adopt static repair approach repair check transform path contract construct work part discov map extent chang adopt dynam repair attempt pose queri work part construct void result queri fragment pose queri chang transform similar result illustr figur transform begin dept end stage transform transform dont list transform begin site dept end transform begin skill work dept end adopt static repair approach check transform path contract construct work part case map void extent sourc schema remov construct obtain schema illustr figur remov contract prior renam transform sourc schema similarli remov extend step paper emploi locat staff site skill manag emploi locat gender staff site skill manag sex figur evolut global schema dynam repair approach wait queri find fragment translat void sourc remov construct transform pathwai sourc schema result transform transform begin site end transform begin skill end notic wrong framework construct global schema map void extent sourc schema sourc schema ad support extent common situat mediat construct translat void repair step simpli matter global schema option extens transform transform primit transform form extend mean construct support deriv paper transform pathwai extend incorrect gener case construct deriv exist construct transform transform global schema append transform local schema origin transform pathwai simplifi extend remov deriv exist construct transform global schema append step extend transform local schema origin transform consist initi contract step match newli append extend step pair step remov order extent usabl queri pose semant newli ad case transform step contract origin transform match newli append extend transform pair step remov order extent usabl queri pose semant newli ad case transform step contract origin transform construct renam result transform extend renam situat revert case notic analog remark end section compulsori repair global schema seri contract left global schema construct unsupport sourc similarli compulsori extend global schema construct ad sourc schema case extend step append transform sourc schema global final extend step remain transform extens sourc schema owner decid extend inform staff member skill sex achiev transform begin skill sex end compar construct introduc construct case construct semant case hold examin transform elimin redund pair redund pair result transform paper transform begin sex end construct introduc case appli extend extend step remov redund pair transform give expect ident transform handl deriv sourc schema construct consid schema construct sourc schema sourc schema intent construct return origin schema figur evolv includ deriv edg emploi popul join work emploi work attempt appli contract step leav popul extent deriv edg gener contract sourc schema construct construct depend permit make chang add step express extend indic emploi construct transform straightforwardli transform begin dept end transform global schema sourc schema straightforwardli transform begin site dept end appli treatment section repair global schema firstli compar determin emploi paper rel ea eb uml ser figur multipl model base deriv work part construct case section pertain convert global schema append step emploi work transform prefix step emploi work transform result pair step transform similarli step transform begin site dept end handl contract step section schema higher level model construct show model languag express construct illustr figur show schema schema construct model languag uml repres node edg underli schema illustr common graph node edg shown constraint uml captur fact instanc instanc show construct higher level model languag defin set construct del renam primit transform automat deriv sequenc primit transform show primit transform uml schema paper skill staff dept work part uml version skill staff manag dept work part uml version skill staff manag uml version skill staff manag dept site work part uml version figur transform uml class diagram defin term primit transform schema present section illustr techniqu appli schema evolut methodolog paper figur illustr uml class diagram semant schema figur repres dept uml skill attribut staff work part relationship repres uml associ figur illustr uml class diagram semant schema figur manag repres uml class hierarchi staff manag counterpart constraint transform achiev transform begin paper end note step equat step ad uml class manag manag ad uml delet uml attribut edg extend uml schema attribut schema node figur illustr schema semant transform draw step transform transform begin end uml schema transform schema analysi section appli evolut sourc schema express uml step queri execut execut transform pathwai transform begin end appli remov redund pair transform section uml level simplifi transform begin end analysi contract extens sourc schema appli uml level obviou uml contract transform contract transform transform begin work paper part dept end perform analysi section work part map void map extent uml remain exampl section transfer uml similar straightforward summari paper shown framework schema transform provid uniform approach handl schema integr schema evolut heterogen architectur sourc schema integr global schema appli sequenc primit transform evolut sourc schema schema set primit transform transform sourc schema global schema systemat repair global schema global queri translat pathwai sourc schema framework base data model primit construct edg constraint previou work shown support wide rang data model languag set primit schema transform enabl automat queri translat semant overlap schema simpl mean approach schema evolut straightforward applic model situat complex data model schema common underli permit transform defin deriv construct data model languag construct data model languag mean integr evolv sourc schema express data model languag translat common data model administr relat evolut schema primit schema transform relat model sourc schema transform uml global schema futur work plan extend schema framework handl dynam aspect eca addit static aspect condit action part eca rule straightforward transform usual problem view translat event part eca interact translat action translat care studi refer manag schema evolut ashish ca knoblock wrapper gener internet sourc sigmod decemb rj bayardo al semant integr inform open dynam environ sigmod june view mechan schema evolut dbm advanc british nation confer volum page paper unifi framework support dynam schema evolut object page ss jd widom tsimmi integr heterogen inform sourc proc meet inform process societi page octob automat gener mediat ontolog engin proc intern workshop knowledg meet volum ceur workshop vassalo wrapper tsimmi system sigmod june hull manag heterogen theoret perspect geppert dynam workflow schema evolut base workflow type version workflow migrat coopi page lv subramanian logic foundat schema integr evolut heterogen system page decemb queri heterogen inform sourc sourc descript proc page pj formal framework er schema transform proc volum page pj semant schema integr inform pj automat migrat wrap applic schema transform approach proc volum page pj uniform approach transform advanc inform system intern confer volum page pj gener formal framework schema transform data knowledg mt roth schwarz dont scrap wrap wrapper architectur data sourc proc vldb page sheth larson feder system acm comput dj van deal complex feder access vldb scale multipl autonom distribut inform sourc proc ifci int conf cooper inform system page
HCI/67 4 connect wearabl comput companion devic radio philip jame laboratori laboratori stoke stoke gifford unit kingdom unit kingdom abstract bristol bristol depart comput scienc engag initi explor technolog wearabl comput describ connect wearabl comput companion devic displai camera radio technolog natur radio high data rate kbp low power consumpt interpret gestur configur request dynam connect introduct interest commun technolog exhibit short rang modest data rate kbp action pick companion devic establish commun link due short rang import aspect suitabl commun technolog user requir touch electrod handl measur zimmerman demonstr technolog term pan area data rate kbp demonstr low power circuit implement pan requir contact electrod data rate limit poor high frequenc characterist human bodi chosen radio term explicit contact electrod requir competitor complimentari technolog physic contact requir capabl high data rate pan equal wearabl comput author correspond address radio author discuss aspect radio previou paper iswc part activ tag technolog develop ultra portabl comput low magnet coupl radio link rang metr develop identifi place object emploi principl develop discuss issu involv radio design demer al configur support kei radio support physic interconnect mount radio transceiv wrist shirt antenna singl turn loop approxim cm diamet limit rang transceiv advantag wearabl identifi enabl devic touch held wearer prefer devic gener pick touch devic hint wearer devic wearabl hint depend applic run wearabl capabl devic simpl detect touch grasp support subtl configur detail refresh rate displai mode establish start default held applic wearabl platform plan wearabl lose contact leav imag displai predetermin amount time detail copi paper displai put applic applic radio link exampl companion displai coil mount wearabl simpli pick displai inform view digit camera support user pictur imag transmit directli store wearabl comput camera store singl imag rule engag wearabl connect detect session wearabl connect rang initi contact period broadcast short signal announc presenc prefer devic perform initi transmiss order conserv power devic batteri oper wearer approach accept handheld displai wearabl establish connect user pick devic find wearabl establish link case wearer move activ displai rang connect establish select move activ displai clear work block diagram shown figur mhz point view circuit differ convent digit radio link respect signal process convent benefit loop antenna loop driver fm block diagram characterist radio link defin rang cell low transmit modest bandwidth kbp design issu radio link loop antenna approxim diamet tune reson low receiv path emploi standard fm chip act direct receiv simplifi receiv path compar singl transmit path gaussian frequenc shift kei loop driver stage reduc transmit bandwidth signal shape binari data filter ensur fcc complianc media access control handl low low power digit signal processor texa instrument oper time duplex refer thoma ibm system post al buse data intern symposium wearabl ieee comp soc situat intern symposium wearabl ieee comp soc local area network field rf wireless person ed bd ts jh norwel ma modul dsp serial link wearabl comput
DB/68 3 institut ur informatik und fur und munchen satisfi check integr constraint norbert proc deduct logic program workshop report april satisfi check integr constraint norbert bry abstract sic interact prototyp assist design finit satisfi integr constraint sic address constraint satisfi problem schema design phase sic combin reason compon interact visual interfac paper outlin function compon theoret background implement aspect reason compon introduct motiv consist schema actual state schema defin structur data integr condit satisfi valid state design schema popul data phase develop involv peopl integr constraint issu constraint check integr constraint satisfi remain satisfi state result transact constraint point discuss ensur integr constraint satisfi state prevent design flaw schema constraint satisfi essenti prerequisit popul phase schema design integr constraint transact reject popul user schema design test indic reason design flaw schema lack skill put transact support schema design detect elimin flaw design flaw result integr constraint infinit larg state actual state satisfi integr constraint support detect elimin kind flaw problem address constraint satisfi real simpl realist exampl design flaw occur easili escap design attent exampl section design work part integr problem inevit rule defin view paper integr assum view data assum strict separ check schema design phase set integr constraint finit remain infin satisfi finit satisfi set set logic relev question decid question set logic formula procedur set formula argument report finit time set satisfi termin question set logic formula finit procedur confirm finit satisfi set finit run forev set question set formula finit desir integr capabl system support design schema design phase set integr constraint finit system report finit support analysi state satisfi set system report finit support design find reason unsatisfi set finit expect system step provid suffici hint design set properti sic prototyp system kind relat combin reason compon call interact compon call reason compon base method complet finit satisfi complet unsatisfi method base idea refin method underli model gener origin develop kind applic compon origin develop debug tool variant thereof interact featur provid support investig state case finit identifi reason set integr constraint finit satisfi exampl exampl section serv illustr design flaw kind easili give intuit idea kind reason sic detect design flaw set integr constraint adapt order save assum quantifi maxim scope evalu interpret note express depart depart depart manag depart member member differ approach base abduct model gener member depart work manag member work member depart depart member depart manag depart work work set integr constraint empti sic start popul phase fine interest case notion user sic modifi state interact reason resum modifi state amount interest state consequ interest nonempti simplest investig state insert interact formula sic reason integr constraint requir exist depart john member case john depart lead contradict remain case depart member hold requir exist manag case john consequ member impli work result contradict case contradict remain case depart member hold work final contradict satisfi integr constraint sic construct deriv reflect reason tree branch tree regard simul attempt combin insert addit insert transact produc valid state branch fail tree systemat cover design integr constraint actual transact reject compon sic make label tree relev argument inform highlight depend formula consequ featur sic give design good chanc identifi design constraint strong happen design overlook borderlin case correct member work constraint satisfi sic show fact construct sampl state satisfi integr schema design invent test data illustr infin problem integr work work work work work relat work work work set integr constraint satisfi empti insert interact order investig interest case reason requir exist john work john work contradict entiti work hold requir exist work case john work work contradict case work contradict entiti requir exist work case entiti contradictori introduc integr constraint satisfi introduc infinit finit number belong class infin procedur termin design sic gradual develop deriv design regular irrelev contradictori branch branch pattern find design constraint hold peopl top compani hierarchi omiss borderlin case turn integr constraint infin axiom suitabl repair work sic demonstr finit satisfi gener kind infin axiom involv reappear pattern unexpect consequ phenomena design suspect sic support make phenomena visibl note analog debugg imper program spite undecid halt problem provid suffici inform programm identifi nontermin loop exampl design flaw straightforward peopl experienc logic formal integr constraint part larger set possibl develop person opinion ampl motiv system style sic method complet unsatisfi finit satisfi reason compon sic base extend posit tableau method ep tableau method extend tableau method underli model gener major featur tableau method gener posit leav neg inform natur approach applic tableau method complet finit set integr constraint finit tableau method necessarili gener reason tableau produc term function symbol nest arbitrari lead infinit branch tableau method avoid support function requir skolem existenti quantifi frequent introduc function symbol applic relat function symbol skolem introduc contrast tableau ep tableau method requir skolem handl existenti quantifi explicitli special rule ensur complet respect finit satisfi underli idea method satisfi existenti formula bind existenti quantifi variabl exist domain element bind variabl newli introduc domain element input syntax ep tableau method fragment shown express power full logic quantif scope quantifi implic scope existenti quantifi conjunct case nest quantifi interpret consid term defin herbrand interpret domain herbrand interpret consist ground term domain term interpret ground term occur ground atom satisfi addit constant denot finit set formula integr constraint view requir syntax ep tableaux set tree node set close formula induct defin tree consist singl node ep tableau ep tableau leaf node formula satisfi term interpret set ground atom tree obtain append children rule applic ep tableau child consist formula conjunct rule part horizont line describ formula rule appli horizont line addit formula ad child node vertic bar separ altern children satisfi interpret branch tupl constant tupl denot formula free occurr member replac member fc set constant occur node constant distinct give ep tableau sake node contrast definit label set singl formula ad wrt node parent definit ep rule appli formula satisfi term interpret branch condit prevent branch model branch ep tableau close open ep tableau open branch close notion fair ep tableau mean open branch applic rule formula branch place finit step ep tableau method properti sound unsatisfi exist close ep tableau sound satisfi fair ep tableau open open branch specifi model consequ complet unsatisfi fair ep tableau method enjoi complet finit satisfi finit minim model fair ep tableau finit open branch renam branch repres properti ep tableaux essenti regard applic proof complex result ep tableau method complet unsatisfi finit prolog prolog program figur construct branch fair ep tableaux strategi backtrack satisfi return term repres set ground atom dynam prolog system element insert remov backtrack predic assum formula repres prolog argument predic axiom activ domain constant occur set formula constant introduc repres predic dom repres quantifi formula member work term model proper subset ground atom satisfi specifi term model satisfi satisfi satisfi atom atom fail figur program repres work prolog comma conjunct disjunct existenti quantifi formula depart member repres existenti quantif nest fair ensur call prolog predic predic violat instanc return instanc formula satisfi predic satisfi insert ground atom order satisfi violat instanc state obtain satisfi perform case analysi syntact form instanc case disjunct existenti possibl satisfi formula predic satisfi return possibl backtrack existenti constant perform backtrack call dom introduct constant perform predic constant atom predic predic predefin semant alter distinguish predic singl satisfi step set instanc satisfi violat satisfi satisfi test formula unsatisfi compon design tool develop debug model gener la develop debug logic compar infer illustr model gener process deriv tree control interact tree program previou section implement simpl control strategi prolog search sic reason compon consist modifi version program support interact control user user varieti predefin strategi option influenc deriv rang depth limit select individu deriv step figur show deriv deriv explain exampl section obtain whichev control strategi tree leaf node middl branch label set atom formula state situat node displai label edg label atom formula newli deriv step number label node edg chang label show integr constraint displai figur compar identifi slightli abbrevi root node interact chang explain previou leaf node mark figur deriv tree symbol repres contradict explain exampl branch deriv natur user figur user mark contradict middl branch squar request depend analysi ad downward point triangl contradict branch newli introduc constant exampl depart reason contradict rightmost branch darker colour featur possibl modifi tent set formula node order anticip effect correct integr constraint model gener process mechan influenc tree displai show compact form abstract detail user current focu altern displai style layout mean deriv construct extern infer engin implement java call www browser perspect sic research prototyp test practic exampl improv reason compon consid obviou improv conveni form express integr constraint rule logic syntax control subset natur languag project point major concern develop sic affect reason compon adapt data model relat adapt data model desir base exist work chimera del present reason compon find minim gener case variant gener minim model techniqu achiev combin model gener case satisfi integr constraint case unsatisfi integr gener explan unsatisfi complex techniqu investig reduc proof size includ lemmata elimin irrelev tableau step integr constraint arithmet comparison handl sic restrict gener treatment requir integr constraint logic program techniqu method assum usual strict separ support separ integr sic refer schutz model gener existenti quantifi variabl constraint int conf algebra logic program springer lnc schutz chr flexibl queri languag proc int conf flexibl queri answer system springer vianu foundat manthei uniform approach constraint satisfact constraint satisfi deduct proc int conf extend data base technolog page springer lnc interact tool design integr constraint demo session page bry manthei check consist logic basi proc int conf larg data base page bry manthei prove finit satisfi deduct workshop comput scienc logic page springer lnc bry model gener applic tableaux method complet finit satisfi research report institut fur bry minim model gener posit unit tableaux workshop theorem prove analyt tableaux relat page springer lnai ceri manthei model languag activ dood system workshop page date introduct system sixth tackl schema valid view updat int conf extend technolog page springer lnc fit logic autom theorem prove applic deduct objectori del workshop program logic int logic program symposium page fuch control english proc int workshop control languag applic hintikka model minim altern circumscript journal autom tableau browser int conf autom deduct page springer lnai wu logic foundat languag journal tableau prover domain minim journal autom manthei satisfi integr reflect neglect problem proc int workshop foundat model languag data manthei bry theorem prover implement prolog int conf autom deduct page springer lnc logic imposs algorithm problem finit class acad translat english amer soc seri
HCI/69 4 multimod gener spatial intellig embodi agent thoma submit depart electr engin comput scienc partial fulfil requir bachelor scienc comput scienc engin master engin electr engin comput scienc massachusett institut technolog copyright thoma reserv author grant mit permiss reproduc distribut publicli paper electron copi thesi grant depart electr engin comput scienc certifi justin cassel thesi supervisor accept arthur smith depart graduat convei multimod gener spatial intellig embodi agent thoma submit depart electr engin comput scienc partial fulfil requir bachelor scienc comput scienc engin master engin electr engin comput scienc abstract creat embodi agent capabl convei understand present spatial inform effect natur manner convei rout person multipl modal refer map present import modal coordin understand human present spatial intellig give creat eca similar capabl empir studi carri observ natur interact model implement mack lab autonom system thesi justin cassel associ mit media laboratori acknowledg professor justin support guidanc past year entir thesi process grate patienc understand essenc motiv research extrem grate member team addit kindli welcom serv constant sourc support tim serv mentor intellectu resourc program design pattern demonstr pronoun ian share graphic talent mack invari good natur humor teach intricaci kqml valuabl insight daili continu patienc server catherin guidanc moral support teach fundament data collect patienc understand consist lend commit toler level dedic thesi love support continu provid strength pursu aspir patienc kind prove entir famili love encourag content content introduct motiv ii research overview iii thesi layout ii relat work embodi agent ii kiosk inform displai iii spatial refer iv rout direct iii research studi ii studi iv model rel descript ii speech gestur iii implement introduct mack ii map iii path calcul iv direct gener vi futur work vii viii refer introduct motiv research comput multimod comput intellig interact system led develop sophist autonom virtual human shift model physic human motion creat underli model behavior intellig year repres continu trend situat public inform access system deliv resourc servic gener public kiosk system place interest constraint interfac design kiosk system stand notic casual user kiosk system time lengthi interact intuit user base typic public space repres set system gear common denomin demonstr abil effect clear advanc inform booth railwai depart museum advantag inform staff member reli physic space share visitor order give describ spatial relationship place thing uniform railwai personnel point proper train depart store show specif product locat unfold store museum staff illustr nonverb size dinosaur great hall issu commun spatial intellig import design public inform kiosk creat embodi agent capabl convei understand present spatial inform effect natur manner give direct person multipl modal refer map present import modal coordin past work street map task unconstrain give build ii research overview goal thesi provid eca framework coordin base underli model behavior addit end structur explor map path gener refer deictic gestur creat empir studi carri observ natur interact studi observ unconstrain interact mit media map easili access wall elev studi control environ examin direct gener detail result model implement mack lab autonom system iii thesi layout chapter present motiv overview research work chapter introduc research context form relat work embodi kiosk inform spatial rout direct chapter iii describ empir studi result produc model defin chapter iv chapter detail implement direct gener system suggest futur work ii relat work ii embodi agent past embodi proven effect engag user reev shown qualit advantag enabl exchang multipl level inform real time eca real estat agent capabl multimod input output user interact rea found interfac intuit human skill requir introduct eca natur choic implement interact system capabl give direct cambridg research laboratori explor concept embodi creat peopl obtain inform public space began tradit public access enhanc anim head speech kiosk pass user deploi kiosk public foremost lesson learn peopl attract anim face watch crl avatar attract entertain success convei interact content anim head lack abil spatial hand arm crucial system direct ii ii kiosk inform displai research public inform kiosk effect interfac shown user accept onlin world serv wide rang individu knowledg transfer kiosk user demonstr gain inform tend system repeatedli initi interact kiosk busi util likelihood reduc time physic staff provid advic current kiosk limit interact requir literaci part hand type inform replac text graphic eca result system wider user eca multimod input output produc intuit interact commun protocol user user skill daili natur languag gestur full advantag share creat spatial bridg user agent research conduct find wai effect present wai user interact inform concentr touch screen intuit interact bodi inform addit research examin natur kind linkag bodi order user engag trail pattern gener evolv interest system creat hypermedia public inform kiosk touch screen interfac short music graphic interact game engag user make feel comfort system improv standard requir user ideal public access system kiosk demonstr emploi natur languag input conjunct touch screen modal select goal creat intuit interfac requir user train touch screen intuit keyboard remain limit primarili process flow eca interfac address limit ad benefit requir user literaci multimod displai multimod input combin text graphic inform methodolog realiz commun goal graphic suggest appeal multimedia present advantag natur languag graphic find pave capabl natur languag nonverb behavior feiner mckeown made similar distinct function pictur word pictur describ physic object languag adept convei inform abstract object relat research led gener text graphic fly gener multimedia tailor explan base type commun act requir similar model stress idea constitu multimod present gener common convei import point stress import correctli coordin multimod output problem result natur output achiev goal coordin ii iii spatial refer design interfac capabl spatial number approach billinghurst implement virtual realiti system form intellig medic interfac design surgeon interact virtual tissu organ achiev continu voic recognit coupl gestur input point grasp simul medic instrument approach achiev spatial refer share virtual realiti implement closer creat share physic realiti devic accompani pda tour guidanc system refer object recommend exhibit interest interfac primarili accent charact icon give ad familiar vicin comput exchang inform kiosk present inform comfort natur user abil refer space multimod address quickset user refer map pen voic input user creat open space map draw area multimod input user interact system natur intuit manner design embodi agent capabl spatial import deictic believ requir agent physic properti world effect knowledg posit object rel locat respect prior explan object knowledg appli creat deictic utter natur unambigu ii iv rout direct research devot rout direct underli structur semant deni examin landmark found landmark frequent specif point point landmark found receiv construct mental unfamiliar environ prepar move spatial refer receiv research includ work spatial refer affect gender region differ assess qualiti rout direct studi element good rout direct familiar unfamiliar environ landmark plai kei role studi found higher qualiti rout direct made rout element found type landmark differ familiar versu unfamiliar rout relev tverski lee peopl speech map convei rout examin extern spatial begun reveal underli structur semant rout step put listen point departur typic appar interlocutor begin implicit step iter goal design start progress prescrib action action orient continu direct work taylor distinguish distinct perspect give rout survei perspect found differ respect point view scene fix refer object refer term rout survei perspect correspond distinct wai experienc environ rout experi environ describ navig survei perspect correspond view environ essenti object part taylor tverski found perspect adopt depend part featur environ research peopl tend survei perspect environ featur size scale rout environ rout occur featur singl size scale natur rout environ rout perspect case direct survei perspect serv method disambigu iii research build relat goal creat accur model peopl give implement model eca creat human subject studi complet studi unconstrain observ peopl give direct mit media map easili access wall elev studi control peopl give direct speech gestur iii studi goal studi observ natur set subject told find distinct locat mit media lab floor stand map build figur sampl interact studi request clarif understand set direct order locat vari phrase request vari figur show sampl interact studi ran uniqu eleven uniqu total twenti instanc receiv request direct uniqu femal male femal male emploi method rel descript descript destin rel impli establish freight explan speech direct recal distinct rout survei perspect strong correl direct method perspect tabl speech gestur direct coincid rout direct coincid survei speech gestur rout perspect survei perspect tabl correl perspect direct method correl direct request question result direct method direct request segment room room room templat room room fall tabl tend prompt mb prompt sg speech gestur tabl direct method question type result show correl request destin direct method correl destin perspect rout vari contradict past research suggest perspect depend rout destin natur rout thought process difficult potenti rout data coincid taylor find initi result studi administ examin content sg direct detail iii ii studi studi sg direct subject femal male subject media lower level give direct distinct locat script subject respond question type control order subject receiv question type order subject unrel research group digit life serv buffer result show peopl tend gestur direct word direct word accompani point gestur gestur rel perspect peopl gestur redundantli gestur gestur contradict direct person narr person give peopl tend switch gestur hand twelv instanc hand gestur exhibit gestur hand entir instanc singl hand hand case switch gestur switch singl hand hand hand left hand result made mention direct segment gener set direct direct subject made past segment data room media carri entranc room tend segment manner subject gave direct locat start indic repeat earlier direct segment question prompt rel descript time prompt listen question stop appar satisfactori correl studi provid understand sg explain detail chapter iv model iv rel descript case gener seek descript destin term impli establish common ground combin result instanc media lab visitor tend unfamiliar kei implicit common ground put media lab build broken multipl floor iv ii speech gestur similar tverski find peopl tend give sg direct segment design landmark prescrib action direct word studi deictic gestur coincid direct word gestur rel perspect destin describ nearbi larg set black happen interact case provid icon gestur coincid landmark mention previou interest discoveri gestur rel question fact gave direct person narr unexpect origin perspect depend question phrase reason elicit direct rel receiv direct rel iv iii recal relat work describ survei perspect rout map mb direct close resembl earlier find earlier work direct map drawn exist mb model repres domain concern map refer map creation start show start point case begin referenc destin simpli proce show refer point elev floor happen directli path segment direct broken path segment start point destin segment consist design landmark point draw path previou landmark area elev hallwai path kitchen area landmark referenc deictic express instanc clear explan method refer contextu influenc object deictic express potenti correl explor type landmark landmark referenc subject tendenc prove landmark elev section hallwai end distinct big clear method predict constitut subject deserv futur research segment continu destin reach tend refer destin point map effect room happen instanc mb direct figur illustr model repeat reach destin direct request mb survei direct start show destin map show refer point map direct segment design landmark draw path finger landmark show map figur model rout direct start show departur point map design landmark deictic direct word icon gestur landmark sg rout direct direct segment design landmark prescrib action direct word deictic gestur describ nearbi landmark destin reach repeat reach destin implement set probabilist rule extract implement exist mack lab autonom system introduct mack mack interact public inform eca kiosk design primari goal multimod input basi natur coordin natur languag gestur abil refer share physic space user motiv exist virtual realiti paradigm user comput virtual world flip virtual agent physic world input mack recogn input speech recognit mit laboratori comput technolog deictic map input paper map atop tabl tablet input oper parallel individu combin user point specif research group mack respond inform group mack multimod output speech synthesi microsoft lcd projector output direct physic map mack refer graphic output includ synchron hand arm head ey movement anim humanoid charact varieti motor skill resolv remain conflict charact figur user interact mack mack blue robot seemingli locat share physic environ figur achiev video camera mount atop screen displai screen mack video direct feed physic background mack implement java platform map input projector output modul make java api store capabl updat directli media intern system design media lab data easili substitut domain ii map exist mack system gave direct call static script store implement develop intern map shown figur physic map typic build depict ey floor intern design coincid floor repres cartesian coordin origin upper corner ax room repres hallwai line landmark point easi data figur sampl physic map mack quickli popul coordin defin map object list landmark base data studi mention landmark section hallwai end landmark referenc uniqu appar object path landmark uniqu appar easili word clarif criteria guidelin determin landmark popul addit repres visibl area area includ locat landmark import landmark room hallwai system peopl walk hallwai pass landmark left hallwai intersect landmark type landmark special properti doorwai landmark serv hallwai room mean direct reach destin endpoint doorwai elev special type doorwai travel floor facilit subclass special properti import design path calcul iii path calcul path determin landmark landmark destin reach travel place room import restrict wall explicitli defin corner defin intersect corner defin hallwai path point calcul perform search complet path found fewest number segment potenti path consist seri segment defin landmark point identifi line segment previou point prescrib action landmark prescrib action direct figur show sampl output path calcul path segment door segment straight door segment corner segment left glass door segment end path segment door segment left door segment end figur sampl text output path calcul path multipl floor determin find path nearest concaten path destin elev destin elev defin method floor iv direct gener path path serv basi direct gener model probabilist system design govern behavior type direct depend phrase request result mb direct lead sg direct mb prompt sg direct time gener direct method mirror model defin chapter base result empir studi sg direct number improv requir gestur librari creat gestur data studi serv basi gestur librari eighteen gestur ad coincid direct word point flat hand addit icon gestur landmark addit arm hand torso movement data show subject turn bodi direct referenc point gestur ad ensur unambigu refer landmark field motiv earlier research deictic believ figur show sampl gestur librari mb direct gener requir addit projector output projector map output redesign coincid intern map meant path segment inform directli express projector output point translat small circl highlight specif point trace path mack highlight line segment time draw line point point rectangular area highlight mack refer specif destin mack gener mb direct subject model earlier glass door figur sampl gestur librari door vi futur work evalu mack observ user interact found peopl comfort system eca made kiosk approach user interact mack prior instruct natur languag commun mack mack instruct user case partial made interact strain time behavior interact person user act mack demonstr agenc trustworthi inform convei mack point user turn turn back mack nod mack success engag entertain peopl invent question simpli hear user engag multipl modal direct gener clear case user nod demonstr understand monitor case user express mack stop clarifi gestur smooth user comment gave direct mack poor job direct focu attent user map request realiz mack give speech gestur direct observ remain improv made mack system addit dialogu manag explicitli model focu attent dialogu manag mack engag attent ensur understand input devic monitor gaze nod behavior enhanc system mack monitor attent understand mack tailor method attent direct attent proper place case user mack stop clarifi direct histori import step mack make mention locat give direct room room make left end mack make previou path segment mack direct start subsequ set direct time explain entir path start finish speech recognit error remain nativ english speaker background futur research address issu relat close speech recognit engin dialogu planner share knowledg system result recognit inform dialogu planner limit rang potenti utter recogn speech recognit engin mack accuraci recogn significantli improv past research multimod error remain progress made simpl feedback partial understand manag user input formul base inform mack provid feedback sourc turn lead improv interact possibl request specif modal case partial understand repeat mack understand map clear multimod suggest method error typic refer synchron redund multipl modal request asynchron redund provid similar result natur user addit mack thesi serv basi interest futur work area spatial intellig specif direct gener work step describ human subject deserv addit research peopl give direct wai depend question phrase variabl affect direct state common ground locat discuss recent person interest explor possibl share realiti area deserv continu attent step interfac emploi virtual realiti model bridg gap user concept share physic space effect approach end mack system share physic map research explor similar wai share object user virtual agent cassel ishii concept share realiti offer myriad opportun interest futur work explor similar wai blur line real virtual world vii present spatial inform import issu design public inform kiosk thesi serv step approach challeng involv bridg gap real virtual world move ideal eca seemingli physic world model motiv interact detail coordin refer framework implement mack domain mit media lab framework easili implement interact system substitut local framework appli continu develop area spatial intellig embodi eca kiosk mack offer level servic public space viii refer al expert surgic intellig virtual environ multimod input medicin meet virtual realiti iv io press yan pretti afford embodi iui la pp yan embodi rea chi acm pp yan share physic collabor virtual peer acm sigchi confer human factor comput system april nl pp yan pretti protocol afford embodi system pp media lab autonom kiosk februari mont carlo action schedul humanoid agent ms thesi electr engin comput scienc mit ad bl averi speak annoi experi intellig kiosk chi acm taylor space describ perspect gestur spatial cognit comput ed vol number kluwer academ netherland pp mckeown autom gener coordin multimedia explan read intellig user interfac ed mayburi wahlster san morgan kaufmann pp weinstein facilit spoken dialogu system develop eurospeech denmark ullmer tangibl seamless interfac bit atom confer human factor comput system acm pp moor roth intent visual ieee symposium inform visual research triangl pp mae agent effect agent ieee commun japan ca gender region differ spatial refer direct give sex pp deictic emot commun anim pedagog agent embodi agent ed churchil mit press pp dr element good rout direct familiar unfamiliar environ confer spatial inform theori plan multimedia explan commun act read intellig user interfac ed mayburi wahlster san morgan kaufmann pp question inform american journal comput linguist pp deni visual landmark give direct confer spatial inform theori tame recognit error multimod interfac commun acm pp multimod interfac process natur commun pp evalu interact techniqu public inform kiosk confer comput human interact special interest group ergonom societi australia charl stuart pp media peopl treat media real peopl place cambridg press cassel literaci learn storytel virtual peer comput support collabor learn experi interact inform kiosk casual user pp cassel share spatial intellig intuit user interfac intellig user interfac jan san pp mase support awar share interest experi commun acm cscw pa tverski perspect spatial descript journal memori pp pu lee pictori verbal tool convei rout confer spatial inform theori germani automat algorithm synthet face digit equip corpor cambridg research laboratori rist integr natur languag graphic gener artifici intellig pp
HCI/70 4 wireless multisensor interfac feet joseph eric hsiao mit media laboratori st ma usa bridg interest wearabl comput system perform interfac digit built highli instrument pair interact danc shoe measur continu paramet express foot transmit wirelessli base station meter updat valu time paper describ illustr outlin music map creat demonstr danc electron sensor incorpor applic year emploi resistor arrai pixel capacit pressur sampl develop research laboratori manufactur treatment facil system gener hardwir stationari portabl system sensor arrai begin treatment prevent foot injuri patient exhibit potenti condit sensor process system cost begin adorn athlet exampl improv balanc swing inerti sensor perform measur shoe interfac virtual realiti applic concentr extend feet exampl ncsa arrai pressur sensor mount drive interact walk cave automat virtual realiti phantom pair shoe track limit area haptic feedback appli drive vibrat sole danc limit simpl pressur measur exampl found wireless electron tap shoe electron pickup mount toe heel shoe sensor gener wire central transmitt cabl run dancer leg goal system make kind measur dancer foot inerti transmit data continu base directli shoe measur kind dynam captur express train dancer evok feet mount requir transmitt directli cabl tether involv applic explor possibl interact music wealth sensor data stream dancer feet interpret comput launch modifi event sensor electron initi concept shoe system built introduc fig show physic layout current shoe includ fig actual photograph oper shoe omit fig protect electron damag inadvert impact proc intern danc technolog temp feb origin built electron subsequ move air match costum design collabor compon insid shoe pickup ground electrod set pressur bend sensor insert sole shoe dancer unabl feel wire sensor depict fig sensor electron mount small circuit card outer side shoe constrain freedom foot solut minim dancer movement addit design electron packag cumbersom integr shoe figur diagram instrument shoe figur photograph shoe electron sensor label fig resistor measur continu pressur point toe point dynam pressur measur point heel film strip bidirect bend sole measur pair resist bend commonli monitor finger glove interfac sensor mount electron line fig toe insert fabric layer toe shoe quickli tilt pitch roll measur acceleromet analog devic larg impact fast kick detect acceleromet amp sensor angular orient twist infer magnet sensor hybrid made venu earth magnet field stabl distort larg amount compass determin orient absolut accuraci nonetheless respond foot angular posit murata dedic measur angular rate speed twist vertic khz transduc receiv sonar ping transmitt scatter translat foot posit determin measur bottom sensor cover receiv label fig tune detect signal transmit conduct strip beneath atop stage strength signal vari capacit coupl shoe distanc transmit reflect height shoe atop transmit zone stage signal digit onboard microcomput run mhz data stream broadcast base station locat maximum distanc meter dancer local rf small fm seri devic technolog devic transmit refresh paramet eleg algorithm simpl manchest approach vicin hz shoe broadcast continu frequenc stub shorter replac wire shoe earlier version electron includ space small camera batteri electron move volt separ mount heel maximum current drain camera batteri reach roughli hour batteri volt batteri addit suffici perform practic session shoe switch enabl batteri shoe send batteri statu indic digit intern suppli rel pic refer binari flag set batteri replac abrupt paramet signifi troubl shoe electron rf continu rate batteri sensor output pair base station receiv rf telemetri stream shoe send data host pc music map control midi serial line base station handl sonar sonar site stage ping combin sensor perform fig show snippet data shoe fig worn pair signal show continu pressur measur toe structur begin end data middl pressur data shoe elev floor freeli articul dynam heel pressur show similar profil strip measur pressur transient continu sole bend sole origin doesnt easili bend foot elev electr field height data forward side tilt acceleromet signal measur pitch roll respond transient give visibl filter host comput twist gyro pick fast yaw dynam dancer wasnt twist rapidli data magnet sensor signal respond foot angular articul shock acceleromet show jump begin pan sensor height data develop sonar code onboard rang data includ figur earlier sonar measur rang feet project simpl khz murata ultrasound attain resolut circa limit pic time algorithm effect background anticip sonar perform adequ switch mode dancer move region stage figur sampl data figur shoe perform mit wearabl show danc applic order evalu prototyp written coupl softwar applic map data shoe simpl music structur written rogu set librari handl midi ran standard pc design wearabl comput fashion show held mit media laboratori octob video intend map simpl easili limit scope shoe total function map design work singl shoe music consist drum bass melodi voic drum voic ran steadili piec gave rough feel fit mood fashion show volum bass drum bass voic control θ tilt volum drum instrument control electr field height sensor tempo adjust slightli bend sensor bass voic melodi voic switch combin detect acceleromet bass voic produc harmoni specif harmoni select rotat shoe φ bass voic articul chang octav detect rear sensor melodi voic plai harmon melodi tone upper rang melodi voic control front pressur sensor pan voic control detect compass direct attach acceleromet trigger heavi kick pan wind sound produc quick φ detect twist gyro mit student dancer practic perform fashion show video clip show short excerpt demonstr aspect map algorithm figur danc pair video clip show recent music map written demonstr pair oper perform shoe kind shown fig map pedestrian trigger modifi simpl sound accord dancer gestur ti random note toe heel bend sole select harmoni chord chang volum accord pitch tilt roll tilt fade addit harmoni chord height shoe electr field transmitt carpet dictat volum bass note volum shoe approach fast movement detect introduc fast rate introduc stream random piano note earth magnet field portion media lab compass map relat softwar sonar perform mit time mia media lab gestur narr languag group project prototyp shoe classif algorithm develop detect danc style shoe data discrimin waltz analysi danc music accompani fade complet step hardwar develop sensor work integr sonar algorithm conclud futur work concentr applic shoe system note shoe produc paramet gestur task map music relev choreograph interest event challeng embark collabor colleagu work danc composit shoe produc wealth data human enabl explor applic sport medicin wireless sensor card develop readili worn part bodi smart object conjunct perform begun examin possibl al wireless interfac devic begin data acut quickli research transmitt replac fix frequenc fm transmitt current devic acknowledg indebt mit mia sarah acknowledg jack analog devic park amp sensor measur provid technic support donat acceleromet media lab colleagu aid matthew grai group prototyp josh physic media softwar hardwar andi wilson synthet charact input develop artist collabor david byron cornel thing consortium sponsor mit media laboratori support project refer al toi direct autonom anim charact siggraph confer abstract acm siggraph fg hewitt je perri pressur foot pp ricci gestur detect applic virtual ieee intern confer cybernet comput cybernet vol oct pp technic document rogu midi di keyboard juli part theori circuit januari pp lj method measur movement patent march bobick toi direct synthet submit pc slip busi oct interact behavior common ibm system vol pp hu danc proc intern symposium wearabl ieee comput societi oct pp music ieee spectrum decemb pp ky hsiao interact proc xii colloquium music septemb pp phantom report tokyo institut siggraph confer abstract acm siggraph tg area ibm system vol pp
DB/71 3 overview activ inform gather infosleuth tm marian jerri brad perri infosleuth mcc west center drive texa octob abstract infosleuth system collabor softwar agent configur perform inform manag activ distribut environ infosleuth agent semant constraint infosleuth broker global domain ontolog broker reason constraint determin minim set agent provid solut queri infosleuth architectur base gener agent shell basic agent commun behavior subset knowledg queri manipul languag individu agent subclass gener shell provid specif kind function infosleuth agent perform number complex queri activ requir resolv queri dynam heterogen includ distribut event monitor mean statist inferenti data trend discoveri complex event stream infosleuth numer applic part infosleuth function data exchang network competit intellig system introduct growth recent year dynam inform sourc led servic assist user extract integr salient knowledg flood data intellig integr correl inform surfac breakthrough topic govern success inform network www applic case studi perform part infosleuth project found fundament problem custom concern custom onlin inform network technolog provid enabl solut ffl deal inform level abstract vari media form ffl fuse overlap inform multipl sourc integr figur dynam agent architectur ffl monitor react pattern occur network inform sourc provid access heterogen sourc gener custom base activ integr exploit inform sourc real concern applic onlin inform network paper provid overview infosleuth project environ manag activ inform gather analysi task heterogen inform sourc environ embodi coupl combin technolog inform inform inform analysi disciplin accomplish appeal cooper agent approach agent specialist interact accomplish inform gather analysi goal infosleuth advanc prototyp system demonstr uniqu amalgam technolog oper inform gather analysi applic infosleuth goal agent system set activ process distribut network internet agent system specialist task inform specialist perform task collect data creat inform higher level abstract collect request gener close overlap multipl agent interact cooper solv complex inform analysi task multipl level abstract typic agent system form broker market bid dynam identifi agent workgroup infosleuth architectur advanc prototyp system emploi agent distribut inform gather analysi figur depict gener model infosleuth applic highlight architectur ffl ontolog exist describ event drive make applic ontolog relat event semant graph node graph repres distinct period inform ffl network inform sourc data vari provid partial evid fact element ontolog ffl resourc agent wrap activ monitor extern inform sourc resourc agent extract content sourc regist domain ontolog ffl user interact system engag session ontolog request user agent ffl infosleuth applic instanc consist network agent capabl perform inform integr infosleuth system dynam identifi subset agent interact exchang inform ontolog request integr inform artifact remaind paper overview infosleuth applic agent agent interact pattern make applic occur implement infosleuth public sigmod paper essenti architectur present valid gener agent shell section paper receiv mention grown includ robust protocol agent commun knowledg interchang format replac languag commun ontolog okbc plan futur work reach implement resourc agent shell access wider rang data resourc case includ base data agent exist queri decomposit concept event deviat detect oracl crystal va site profil ga inform tx remedi technolog oracl tx data registri oracl dod brook tx air forc site profil oracl dod md armi site profil oracl doe id doe site profil oracl doe oak tn doe site profil basel tx basel convent transport data tabl data sourc applic area infosleuth compani infosleuth extern present applic area infosleuth discuss featur type request gener infosleuth user domain remedi data exchang collabor effort depart depart energi protect agenc nation institut standard technolog develop demonstr mean share data possibl includ european environ agenc difficult share data inform typic resid geograph dispar heterogen system complex system access secondari distribut frustrat attempt draw data form understand condit action project creat intellig inform servic provid uniform access specif set geograph distribut inform standard web browser collabor effort understand metadata inform mean share inform incur huge technic polit challeng design integr system autonom entiti burden maintain redund project infosleuth retriev inform dispar data sourc illustr tabl system access pilot project distribut internet access maintain resourc emploi data registri develop describ translat version resourc project perform map data element found system resourc exploit gener essenti multilingu thesauru serv assist standard ontolog provid potenti translat capabl languag applic challeng infosleuth system varieti includ present challeng develop domain struggl provid standard mean semant inform set user drawn multipl agenc countri larg amount real data forc infosleuth system incorpor varieti map facil map inform ontolog construct agenc repres data vocabulari system incorpor facil translat valu lexicon process complic fact lexicon translat function easili agent target user commun infosleuth demand express user interfac queri interfac provid time prevent user invok queri consum larg amount system resourc benefit abil provid explan deriv result broad set resourc system behavior face inevit intermitt failur prove critic system accept competit intellig technolog track servic mcc member compani provid strateg technolog monitor perform technic analysi member compani competitor servic commonli refer appli competit intellig understand awar competitor sector trend guid effort opportun ci process profess ripe exploit onlin inform sourc continu rapidli current manual inform estim ci spend time manual gather data time tool aid gather analysi process interest challeng applic infosleuth monitor ci inform open sourc motiv infosleuth autom activ maintain aspect ci inform gather analysi process ci concern basic ffl provid histor snapshot competitor statist multipl behavior indic ffl detect trend shift trend technolog indic individu group relat gener technolog sector activ perform respect type inform product tabl list type product sampl sourc inform product deriv class term exploit ci applic sampl lexicon includ acm comput patent classif hierarchi note resourc collect text structur record attribut technolog extract semant concept paramount import ci applic sourc categori sampl sourc sec file workforc profil hoover onlin current event press cnn daili growth technolog patent list emerg technolog inspect public acm onlin bibliographi tabl class competit intellig inform sourc review ci repres set request provid request type servic ci desir inform gather analysi tool case request requir level monitor inform network open sourc user agent applet broker agent ontolog agent task plan agent sentinel agent queri agent deriv concept agent deviat detect agent resourc agent resourc agent user layer plan tempor layer queri analysi layer resourc layer user agent user agent applet applet figur layer agent request notifi electron commerc technolog exhibit shift growth technolog public request retriev compar view competitor workforc patent award request retriev set semiconductor patent code compani notifi set request deriv competit associ competitor base citat refer emerg technolog public provid updat deriv dai agent organ figur show basic structur infosleuth agent impli infosleuth agent gener fall user resourc core agent user agent act behalf user formul request form understand infosleuth pass execut match pass back request applet resourc agent wrap activ repositori inform sourc inform resourc implement type resourc agent access type inform ffl jdbc resourc agent access relat jdbc driver enabl integr infosleuth kind legaci relat ffl text resourc agent access text document index standard index call agent refer retsina system includ type resourc agent access document www ffl flat file resourc agent access structur inform store flat file regular express match ffl special imag resourc agent tailor specif set annot imag core agent serv glue gather inform process user filter abstract inform level abstract user requir partit core agent ffl repres vertic box side figur provid intern inform oper agent ffl analysi layer resourc agent figur fuse analyz inform resourc singl ffl tempor layer user agent figur guid request process place period detect complex event implement type core agent infosleuth servic agent ffl broker agent collect maintain knowledg base inform agent knowledg match request servic agent broker collabor implement syntact semant matchmak agent broker make agent broker remov agent knowledg base ffl ontolog agent collect maintain knowledg base ontolog return ontolog inform request ffl monitor agent monitor oper system agent queri process data analysi includ ffl queri agent process complex queri span multipl heterogen term domain ontolog queri includ concept slot ontolog standard function slot ffl deviat detect agent monitor stream data instanc hardwir learn time agent plan process time includ ffl task plan execut agent plan user request process includ result cach special support task plan tailor domain ffl sentinel agent monitor inform event stream complex event complex event pattern compon compon event event inform trigger detect individu deviat detect deviat detect agent agent function ontolog ontolog repres semant concept term familiar user domain repres knowledg independ actual structur data inform domain agent ontolog commun agent commun level semant user interact type inform repres ontolog infosleuth includ ffl attribut relationship ffl relationship class subclass class ffl lexicon refer standard lexicon ffl constraint attribut cardin valu ffl deriv comput underli attribut relationship ffl relev statist summari ffl event type map ontolog underli local term syntax data special class agent call resourc agent encapsul set present inform system term ontolog map encapsul resourc agent resourc agent maintain set resourc agent map set singl set ontolog ontolog repres okbc underli data model okbc model ontolog store okbc server special class agent call ontolog agent agent provid ontolog specif user request resourc agent provid inform agent understand process request formul user broker broker dynam locat recommend activ agent relev specif task request agent specif task locat agent broker recommend specif agent forward request special ontolog agent commun inform agent broker updat agent queri broker agent concept repres infosleuth ontolog content inform access agent term servic agent perform agent properti protocol di profil site san cpu chip profil site figur broker queri product technolog compani site central broker process agent inform provid broker term constraint infosleuth ontolog request agent formul queri servic agent broker term constraint infosleuth ontolog broker reason find servic agent match constraint request agent call semant broker return recommend servic agent request agent queri product technolog compani site central set resourc maintain compani set resourc site inform shown figur broker filter resourc site address central texa set resourc compani profil queri agent access set site execut queri queri process queri process infosleuth involv receiv discov resourc inform request forward fragment queri fuse result singl result answer queri focu queri process task queri agent domain enter infosleuth system user forward task plan execut immedi forward queri agent queri agent queri collect queri fq individu class constraint individu global queri result queri integr gener request result note integr plan involv join statist function queri agent request broker locat resourc provid answer queri fq individu class recal resourc infosleuth made broker ffl type queri resourc agent ffl ontolog resourc agent inform ffl constraint ontolog subset ontolog inform note resourc attribut requir result resourc vertic fragment fragment inform pertin user request inform includ reliabl queri agent identifi resourc class gener queri base queri fq individu collect result temporari result queri agent execut global queri integr plan gener result request ua ra ra qa broker tea qa ra figur agent interact pattern queri process user result forward user task plan execut agent note task plan execut agent isnt queri process action interact pattern shown figur period request period request monitor set time period user specifi queri infosleuth system comput answer queri forward user begin interv implement classic pull interfac acquir inform user specifi infosleuth system immedi gener queri answer queri infosleuth system comput specif forward user implement combin user tailor queri back user subscript request process task plan execut agent receiv queri user store task plan execut agent forward queri queri queri set trigger resourc pertin queri queri agent set trigger broker agent monitor set resourc affect queri trigger ua ra ra qa broker tea ra ua ra ra qa broker tea ra ua ra ra qa broker tea ra figur subscript task execut agent consult qa obtain queri plan subscript content task execut agent place subscript relev ra base queri plan figur data ra chang notifi task execut agent te agent qa return domain element queri turn queri ra figur ra return answer repli domain element return te agent differ element previou qa return user te agent qa queri plan chang resourc subscript figur agent interact pattern subscript set behalf task plan execut trigger set notifi agent task plan execut agent submit queri queri agent defin previou section task plan execut agent cach copi result forward user task plan execut agent receiv notif trigger pertain queri queri agent receiv comput comput differ cach result futur comparison interact pattern shown figur task plan complex event detect infosleuth support subscript retriev inform higher level abstract aggreg necessarili repres underli data inform aggreg abstract varieti data mine complex event detect agent work cascad manner process digest inform level abstract user deriv deviat detect sentinel plan associ rule mine collabor accomplish aggreg abstract task process cover relat discuss infosleuth agent shell gener agent shell infosleuth layer infrastructur standard agent layer clean semant interfac section succinct summari function exist infosleuth agent shell messag layer agent messag layer map logic kqml request made layer physic network exchang agent current messag layer map logic kqml request network exchang http commun protocol messag layer ensur agent emploi consist syntact kqml consist involv assur creation valid kqml messag logic request made check messag receiv agent valid kqml propag layer function free agent worri syntact inconsist kqml layer layer infosleuth architectur defin enforc polici group cooper agent set standard repres speech serv basi simpl commun agent messag ongo dialog agent interpret individu messag depend context dialog particip order set messag transmit set relat conceptu initi speech act polici formal determinist specif order speech act exchang agent infosleuth finit state machin agent system enforc consist interact agent enabl agent maintain reliabl interact gener agent layer gener agent layer embodi servic crucial oper requir agent particip infosleuth commun servic semant matchmak enabl agent request servic locat agent provid servic servic inform knowledg access ontolog defin commun gener agent layer infosleuth agent shell implement interfac gener agent ffl standard interfac broker agent includ agent initi increment ffl standard queri interfac broker agent abil agent queri broker agent servic result broker structur insert agent agent address book ffl standard queri interfac ontolog agent agent queri ontolog agent domain system type knowledg repres agent applic layer agent applic layer implement function specif agent layer agent shell agent develop focu effort primarili agent applic inherit agent shell capabl servic support agent queri resourc data mine agent implement specif capabl agent applic layer process collabor agent applic request repli request embodi speech content languag specif content interag servic request assert abstract detail oper issu messag pass mechan agent locat issu applic develop resourc agent shell infosleuth system set tool java templat build resourc agent minim program infosleuth ra subclass resourc agent shell subclass infosleuth gener agent inherit function defin shell interfac infosleuth system maintain session subscript support underli inform sourc provid trigger construct maintain includ constraint monitor underli inform exploit extern sourc manag map data valu canon consist encod send agent network aggreg function ra particip reactiv agent infosleuth applic user agent shell infosleuth system set tool java templat connect interact infosleuth agent applic infosleuth user agent shell subclass gener agent persist user presenc infosleuth applic basic servic exploit infosleuth applic defin gener client interfac request input result output applic tool link client interfac gain singl point input tool regist rout result stream maintain persist set outstand request user submit applic connect launch disconnect time sync outstand request queu result maintain concept user session request submit session share result flow back infosleuth session manag make easi applic build queri sequenc output queri input queri explan interfac user session manag interfac client applic interrog result cach receiv result exist infosleuth agent contribut construct result applic construct infosleuth infosleuth system box readi develop applic distribut inform system program process construct applic creat find suitabl domain ontolog ontolog repres element problem good ontolog kei problem solut domain essenti care part process infosleuth okbc express incorpor ontolog develop sourc address problem hand infosleuth graphic tool creat edit ontolog suit infosleuth applic identifi configur resourc configur resourc involv basic step graphic tool provid assist activ ffl identifi configur access method mean identifi access account inform text mean select index engin identifi sourc file ffl map resourc ontolog term step requir attent domain understand mean schema underli resourc jdbc map tool construct translat select element list ontolog element schema tabl column text agent configur tool assist identifi grammat structur recogn pattern textual sourc ffl build default behavior tool exist class slot develop time construct map altern simpl maximum minimum valu configur sentinel deviat detect desir distribut inform system construct agent provid power system filter event stream provid notif interest trend deviat comput norm tool exist present time assist develop configur basic behavior straightforward configur accomplish edit configur file prefer line editor develop user interfac numer approach user interfac develop extrem simpl graphic queri editor construct arbitrari equal simpl program submiss sql queri result return displai ascii applic programm interfac provid programm creat graphic user interfac express queri interfac provid java applet support templat queri markup languag browser browser accept simpl syntax express queri ontolog displai english sentenc queri develop hand line editor browser run expert mode browser user interfac requir user agent configur cooper colloc web server configur resourc agent user suffic normal behavior initi task queri agent default initi newli configur resourc user begin queri system queri interfac invok user interfac monitor agent user observ progress queri system time comfort reliabl applic numer subtleti system behavior modifi configur option agent relat work system number agent system target share similar infosleuth function agent system organ agent matchmak servic vari agent ontolog semant queri subscript event system broker process detect simpl sim complex infomast complex infosleuth complex tabl agent inform gather compar function middlewar agent access combin user agent interact user maintain inform prefer task histori provid set function respect semant heterogen global queri complex event detect tabl comparison system agent infrastructur number area agent research relat develop infosleuth architectur includ work agent commun develop support agent architectur framework concept speech act grown philosophi linguist research standard set speech act open system structur agent intend mean content speech act interpret semant structur messag intuit human user system effort defin set speech act agent system share infosleuth polici state includ work kqml kao toolkit work explor interact polici agent system emploi enforc polici agent share rule approach work system agent support reason addit kao retsina jatlit provid agent structur incorpor specif agent agent standard gener architectur messag polici agent retsina kao jatlit jafma infosleuth tabl agent infrastructur relationship infosleuth system analysi paper infosleuth abil extract inform semant integr inform heterogen provid analysi task softwar agent dynam coupl capabl support monitor analysi ontolog concept chang multipl level abstract emerg capabl set interact pattern infosleuth behavior infosleuth advanc prototyp system perform inform gather analysi open inform sourc success infosleuth approach realiz real inform gather applic requir interact inform inform inform analysi technolog technolog receiv prior flexibl integr disciplin occur result success inform gather technolog open inform network major compon ongo work infosleuth activ system distribut inform gather competit intellig applic cooper agent technolog emerg proper technolog address applic environ refer ca shen queri reformul dynam inform integr journal intellig bayardo al semant integr inform open dynam environ proc acm sigmod intern confer manag page acm jun mcc technic report barbuceanu coordin agent role base social constraint plan fourteenth nation confer artifici intellig page open agent architectur jm softwar chapter aaai barbuceanu fox languag describ coordin multiag system intern confer yun tool agent develop agent framework multiag system develop implement phd cohen levesqu commun action artifici agent decker lesser design famili coordin algorithm nation confer artifici page decker kp sycara intellig adapt inform agent journal intellig williamson model inform organiz dynam behavior work note workshop page san june fipa novemb singh virtual inform system proc acm cikm intellig inform agent labrou semant agent commun languag phd sep labrou finin semant agent commun languag fourth intern workshop agent cheyer inform broker agent architectur intern confer practic applic intellig agent april marian nodin ami unruh facilit open commun agent infosleuth infrastructur proc intern workshop agent greg pitt jerri fowler collabor knowledg share project ieee intern symposium electron environ petri jatlit architectur intellig resourc agent proc cooper inform june sycara al retsina labrou finin mayfield kqml agent commun languag softwar edit jm bradshaw aaai perri data mine event detect infosleuth agent technic report mcc infosleuth submit autonom agent
DB/72 3 logic transact serializ burkhard freitag universitat fur mathematik und informatik germani abstract concept logic serv clear express foundat inform system classic logic languag refer singl modern inform system dynam account updat languag complex transit state evalu point complex state transit consid transact isol properti transact poorli address context logic updat import problem sequenti transact paper investig serializ logic transact support mean implement transact manag introduct motiv updat concept base defer updat semant updat goal wrt fix state defin term updat request set insert delet request ground edb tupl prototyp system implement top deduct system transact process method evalu set basic updat request comput potenti transit current state state evalu logic semant updat execut phase valid updat request set materi phase begin comput updat request set nondeterminist chosen appli execut updat physic state materi updat request set combin concept turn bulk updat concurr conjunct semant concurr conjunct defin term semant subformula import modular avoid problem interleav parallel program languag result form parallel support transact suitabl handl concurr transact paper slightli modifi logic semant evalu read oper record updat request materi addit log inform analyz detect conflict transact evalu state materi materi current transact transact abort recomput physic state examin updat request set correspond read certif optimist transact odl materi phase complet independ evalu relev inform pass updat request set evalu engin access consist state determin depend queri updat forc granular read inform level edb idb predic edb relat contribut state interpret queri predic mark read log inform topic futur research standard system oracl read lock base serializ ensur paper attempt emb transact process logic framework updat program adopt singl transact view system defin logic semant singl transact support log read updat oper suitabl basi oper semant rest paper organ describ syntax semant updat languag sketch main theorem adapt section aim find syntact condit term updat request isol execut concurr transact approach formal shown correct section deriv optimist transact process method extens prototyp architectur outlin section summari section due space limit bulk updat paper main result hold updat languag includ form bulk quantif work paper partli fund german research agenc contract number fr updat languag extend logic deduct consist base relat defin set normal deduct updat program consist updat rule defin distinguish set edb idb updat predic updat predic regard complex updat oper definit db term composit function variabl term variabl call ground ground extend construct defin natur atom form term predic distinguish edb idb updat atom depend set predic belong db liter atom negat atom definit herbrand defin updat set ground term call herbrand denot set ground edb idb atom call herbrand base denot set ground updat atom call defin updat base denot element call defin updat atom abbrevi sequenc term write sequenc variabl definit db liter updat liter updat liter basic updat atom del edb updat liter updat atom updat liter induct definit updat liter updat formula updat formula implic updat formula updat formula sequenc variabl updat formula updat formula concurr conjunct sequenti conjunct updat formula avoid squar bracket oper bind composit formula definit updat goal updat formula implic quantif set updat goal defin case definit definit variabl occur insid formula free scope definit updat formula denot formula result replac simultan free occurr variabl term definit idb rule closur implic built idb head atom bodi db liter rule empti bodi call fact definit updat rule closur denot updat atom updat goal rule head denot queri empti bodi updat fact correspond updat liter definit program tupl idb idb denot set idb denot set updat rule idb call idb program call updat program remark updat goal free variabl queri definit idb idb edb idb predic depend directli denot idb iff exist rule idb head predic occur bodi relat idb set edb idb predic defin edg depend graph idb depend wrt updat result updat program relat idb refer retriev edb idb predic set edb predic predic depend detect conflict transact definit idb idb program edb idb predic defin idb fr edb predic idb idb denot reflex transit closur relat idb semant formula program section present semant extend semant defin due space limit bulk updat accommod shown semant base concept defer updat essenti mean updat immedi execut queri evalu updat goal determin potenti updat deriv affect state materi appli earlier materi time potenti updat transit current state state read access edb relat defer read access log certif defer updat log read oper combin optimist synchron protocol potenti updat repres set basic updat request point view updat semant updat request consid assert state updat request set store read tag edb relat access deriv consid local log definit set db ground edb atom call edb instanc definit ground basic updat request form ground edb atom ground basic updat request specifi insert delet edb atom correspond tupl edb relat read tag defin record conflict read updat oper read tag express edb relat contribut result ensur transact isol read tag consid comput updat request set materi section mention granular read tag conflict notic syntact level semant proper conflict determin minim set relev edb data deriv hard problem li scope paper definit read tag form edb predic read tag treat updat request read access oper updat oper defer definit request updat request set set ground basic updat request read tag updat request set consist iff exist atom denot set consist updat request set restrict edb atom definit updat request set call compat union consist definit defin compat read access conflict updat definit concurr composit consist updat request set defin set defin concurr composit set updat request set concurr composit undefin incompat updat request set definit sequenti composit consist updat request set defin captur dynam state db instanc edb state db db updat request set lead db appli db logic framework updat request set physic appli db call state physic edb instanc db hypothet repres term current state repres updat request set implement consid redo log state content edb appli edb semant normal program commonli accept semant subsum model semant assum semant idb union db idb edb instanc db set idb rule idb wfm denot model deal assum wfm repres set true ground atom prefix refer atom definit execut db consist updat request set wrt edb instanc db defin db db definit db db physic edb instanc idb idb program defin db interpret db assign model db idb term interpret usual herbrand interpret map set ground updat formula ground formula defin extens interpret updat atom compon pair refer current state wrt db compon refer set updat request lead state appli hypothet current state pair correspond state transit db multipl pair compon updat interpret choic involv level logic semant implement perform choic oper materi state induct definit ground updat db db interpret definit db idb interpret defin updat map defin interpret extens arbitrari ground updat formula induct db liter edb idb atom db idb db idb basic updat atom updat atom updat atom implic quantif updat formula free variabl arbitrari ground term tupl concurr conjunct exist sequenti conjunct exist consist updat request set consid small repres state switch edb predic presenc edb repres fact switch absenc physic state db equat hold due case definit updat goal del intuit mean switch del state transit list relev updat definit sequenti conjunct del empti exist tupl compon absenc tupl fact goal fail hypothet state extend deduct program idb db physic edb instanc model updat program state definit interpret idb liter wellfound semant wrt idb db find interpret updat atom respect intend semant interpret updat formula complet determin identifi write arbitrari ground updat formula definit updat interpret updat formula model set updat rule iff rule hold rule denot close implic interpret model updat program iff hold ground instanc rule inform mean rule head state transit rule bodi detail explan notion model updat definit order relat interpret defin state transit defin updat atom restrict definit model minim iff hold model theorem uniqu minim updat program uniqu minim model analog proof definit idb db edb instanc db denot minim model wrt fix db interpret determin db idb recal set updat program consist singl updat rule test reset del model del hold minim model db db hold minim refer number state transit interpret defin updat atom test reset note kind minim implicitli enforc induct definit interpret updat formula ensur updat request set compon tupl small provid induct fixpoint uniqu minim model updat program prove properti minim model definit set interpret denot defin lemma order relat definit form complet lattic bottom element top element constant map assert follow similar properti lattic definit consequ updat program defin consequ oper set interpret exist ground instanc rule lemma consequ oper definit continu proof essenti resembl proof analog assert definit program lemma updat program arbitrari updat interpret model iff iff assert easili shown definit definit ordin power fl consequ oper updat program defin usual appendix theorem updat program updat interpret db idb statement uniqu minim model idb db fixpoint gener iter applic start bottom element proof case definit program easili adapt precondit lemmata transact serializ section show logic semant support transact isol transact invok updat queri defin updat toplevel queri extend deduct retriev queri consid definit program db physic state updat queri form free variabl updat request set db call updat commit transact invok updat chosen nondeterminist basic updat physic appli edb physic edb instanc db interpret minim model updat program chang updat queri read tag valid read access edb idb shown remaind section definit consist updat request set call consist updat request set exist updat request inform iff basic updat request chang relat read comput compat condit kei obtain serializ transact evalu wrt physic state lemma db edb instanc idb idb program edb idb defin idb updat request set updat request set restrict idb predic equal restrict idb appendix definit interpret updat formula fix updat request set updat formula free variabl properti wrt defin arbitrari object show minim model db program physic state db satisfi arbitrari updat request set arbitrari ground updat formula assert deriv serializ properti optimist transact process method full isol concurr transact lemma interpret updat formula fix updat request set hold defin updat atom hold updat formula free variabl proof base structur induct appendix lemma uniqu minim model updat program satisfi properti fix updat request set ground updat formula assert prove induct prove theorem express form serializ theorem program db physic edb instanc updat goal free variabl updat request set db db assert lemma appli backward remark ground updat goal db addit theorem comput updat goal valid state updat request goal updat comput wrt physic edb instanc db observ effect equal isol execut transact invok serializ materi requir corollari db theorem remark assum db assert directli theorem case definit remark updat request set comput refer edb instanc db sequenti composit updat serial goal corollari reformul serializ term underli logic sequenti conjunct reader mind fact talk transact invok independ mistaken sequenti concurr composit action singl queri semant full control correct combin updat request set case true precondit check certifi materi concurr transact correl sequenti materi composit updat request set proposit db edb instanc updat request set db hold db hold proof definit recal set theorem proposit offer altern wai deal updat request set materi serial comput materi final updat request set concurr composit appli updat request transact simultan interleav comput interpret merg local log global log question exist updat serializ abort transact restart updat request transact complet appli edb happen optimist protocol result section illustr recal set concurr transact repres updat updat updat request set serial transact materi restart attempt transact logic fail physic state reject fit empti interpret serial execut fail situat unusu concurr transact pair del updat updat request set theorem transact serial materi precomput singl updat request set updat sequenti composit del due corollari materi simultan isol execut imposs serializ requir serial execut final pair del updat request set updat vice read tag updat request set correspond fact read access evalu materi order produc effect arbitrari serial parallel composit defin fit fact serial effect edb express common updat request set architectur prototyp system ultra built top deduct system process updat queri evalu phase materi phase figur illustr system architectur updat queri evalu multipl evalu thread synchron evalu thread queri evalu wrt physic state updat edb perform block transact readi enter materi updat materi process check updat materi belong transact evalu physic state check updat request final carri extern system atom transact condit thread comput altern updat transact abort state updat request set repres suitabl index structur reduc complex isol check mention section evalu process access consist state evalu process synchron materi process formal syntax semant logic updat languag investig problem achiev isol term transact evalu physic state shown updat request set suffici condit serializ transact idb read access multipl thread check isol materi edb materi process updat figur architectur ultra system addit perform updat materi flexibl mention check counterpart read certif optimist transact odl extern system persist materi construct logic system process transact independ phase evalu materi acid properti present formal criterion check serializ transact evalu refer state distinguish approach concurr transact logic question left open isol transact execut parallel topic futur work read inform account sophist version updat request set hypothet state investig semant present repres hypothet state updat request set wrt fix state db hypothet charact intermedi log possibl forthcom implement idb materi wrt db wrt intermedi edb instanc refer vianu foundat goodman concurr control recoveri system publish bonner kifer overview transact logic theoret comput bonner kifer concurr commun transact logic proc joint int conf symp logic program page elkan independ logic queri updat proc acm symp principl page dogac optimist lock techniqu concurr control distribut ieee transact softwar lloyd foundat logic program lausen logic framework activ rule proc int conf manag data warren languag updat foundat deduct logic page morgan kaufmann san van schlipf semant gener logic program journal freitag captur dynam defer updat proc int conf logic program page freitag captur dynam defer updat technic report universitat passau zukowski freitag deduct system proc int conf logic program nonmonoton reason page appendix give detail proof lemmata section lemma db edb instanc idb idb program edb idb defin idb updat request set updat request set restrict idb predic equal restrict idb assumpt read tag edb predic depend updat request chang edb relat relev interpret atom db restrict predic idb equal db restrict idb restrict idb predic equal restrict idb definit interpret updat formula fix updat request set updat formula free variabl properti wrt defin arbitrari lemma interpret updat formula fix updat request set hold defin updat atom hold updat formula free variabl prove assert structur induct hold defin updat atom case arbitrari show definit definit base db liter show assert posit db liter proof neg db liter analog db atom defin idb reason db idb idb idb db lemma essenti proposit depend lemma basic updat atom similar hold basic updat atom del updat atom hold precondit induct induct hold direct proper subformula composit formula implic quantif ground term tupl hold ground term tupl hold concurr conjunct exist exist read tag induct hypothesi applic sequenti conjunct exist exist exist induct hypothesi previou case associ definit ordin power consequ oper updat program defin ff successor ordin ff fi lub fl fl fi limit ordin fi lemma uniqu minim model updat program satisfi properti fix updat request set ground updat formula suffici prove assert defin updat atom assert arbitrari updat formula lemma arbitrari updat request set show induct hold wrt fl arbitrari ordin fl verifi condit defin updat atom arbitrari fl fl base fl defin updat atom properti trivial hold wrt induct successor ordin ff induct hold wrt ff defin updat atom lemma hold ground updat formula defin updat atom arbitrari hold ff exist ground instanc rule ff exist ground instanc rule ff ff induct limit ordin fi properti show hold arbitrari subset lattic interpret induct hold wrt ff defin updat atom defin updat atom arbitrari hold fi ff exist ff fi ff exist ff fi ff ff fi assert hold wrt equal minim model due theorem
DB/73 3 time index scheme move point agarw lar arg jan abstract develop index scheme store set point move linear rang queri futur time answer effici featur index scheme number requir answer queri depend size data set number point answer differ current queri close current time answer queri futur past time center geometr depart comput duke nc usa support part armi research offic muri grant sloan nsf grant grant scienc foundat center geometr depart comput duke nc usa support part nation scienc foundat ess grant ri grant career grant institut fur germani part work visit duke introduct effici index scheme support rang search variant central larg system relat rang search commonli oper problem crucial support languag constraint queri languag class hierarchi spatial geograph inform system rang search plai pivot larg number extern data structur answer queri develop refer store process continu move data wide rang includ digit mobil commun system exist assum data constant explicitli suitabl queri continu move object continu updat queri output obsolet approach repres posit move object function posit explicit chang system updat function veloc object recent work extend capabl exist system handl focu develop effici index scheme store set move point space rang queri locat futur answer quickli queri point lie insid queri rectangl minut focu call time index scheme fast time queri time queri time index scheme import applic queri futur critic queri futur problem statement fp set move point time denot posit time fp assum point move straight line fix denot current time interest answer queri set point move time stamp report point lie insid time report set point move rectangl time stamp report point lie insid time report main interest minim number disk access answer rang problem standard extern memori model assum disk access transmit contigu block unit data singl oper effici index structur measur term amount disk space unit disk number requir answer rang queri interest solut output queri bound express term number point term number point report queri note minimum number disk block store point report output point refer bound previou result overview earli work tempor found survei paper salzberg tsotra earli work concentr data activ develop data model queri languag support continu move object sistla wolfson develop tempor queri languag call futur tempor logic support proxim queri move object sistla al data model call move object move object refin model extend incorpor import includ uncertainti motion commun cost model found number practic method access search move object refer worst queri output size kollio al provabl effici index base partit tree queri type structur disk block answer queri arbitrarili small constant ffl agarw al extend result queri kollio al present scheme answer queri optim disk block index scheme mean evolv time agarw al show index evolv develop index answer queri optim log log disk queri arriv chronolog order achiev notion kinet data structur introduc al main idea kinet framework point move relev combinatori structur data structur chang discret time updat data structur continu kinet updat perform data structur kinet event occur contrast structur updat fix time interv fastest move object determin updat time step entir data kinet data structur base event event natur interpret term underli data structur kinet event occur point equal amort cost kinet event index agarw al total number event show modifi structur order obtain tradeoff queri bound number kinet event agarw al time index scheme context move point develop space structur queri log log space structur cost queri time monoton function differ queri bound exce prove specif bound posit veloc point uniformli distribut insid unit squar result paper present time index scheme queri provabl effici specif queri bound depend differ assumpt trajectori input point make veloc point term futur defin index scheme combinatori measur time term kinet defin reflect configur point chang bound depend number kinet event current time queri time stamp defin number kinet event occur focu queri simpler case queri past handl similarli section describ time index queri base kinet framework kinet event defin time point pass rel order chang index log disk block answer queri time stamp nb log kinet event point pass handl expect note queri time nb answer optim queri effici structur space requir queri arriv chronolog order index scheme simpler make assumpt distribut trajectori order prove bound queri time section describ time index scheme queri kinet event defin time instanc point equal index log disk block answer queri time stamp nb kinet event handl expect queri answer log improv previou structur queri present index section describ geometr index concept paper preliminari arrang set line arrang planar vertic intersect point edg maxim portion line face maxim connect portion plane line face figur figur arrang face arrang defin closur segment line polygon chain monoton respect horizont axi refer figur dei show maximum number vertic arrang line plane toth prove lower bound log complex result agarw al discuss level arrang line vertic comput lemma level vertic arrang line comput log log log fundament index store element order domain disk block rang element queri interv answer element note standard call answer queri current set element persist support rang queri state index updat perform current refer structur exist updat structur exist time lemma persist construct perform updat disk block support rang queri time index move point section queri type assum point move interpret time parametr point trace line notat denot result set line queri correspond report line intersect vertic line segment figur figur line trace queri correspond find line intersect segment vertic line ff induc total order line rel order point order chang point pass note design effici index persist sweep left vertic insert segment persist left endpoint encount delet endpoint encount answer queri rang perform rang queri tree time arrang size lemma impli index answer queri optim space order improv size log time obtain time roughli divid vertic store modifi version index window describ structur describ construct index window strictli lemma hold line segment segment discuss extend result line segment nb figur window arrang line structur sort sequenc vertic arrang set nb defin window vertic ith window dlog vertic figur show arrang line window index consist window structur wi window subsect describ index wi disk block answer queri log index construct log log expect answer queri time interv determin window search wi report point log remain show determin vertic set vertic lie insid describ algorithm comput kth leftmost vertex ly insid point kth smallest repeat algorithm comput note line intersect insid intersect left boundari li left boundari problem count size reduc count number pair line rel order boundari number pair count modifi sort merg sort comput oe log modifi extern set random point sort point sort vertic boundari line pass shown modifi algorithm comput point log comput sort log standard probabilist omit show lemma high vertic perform binari search algorithm step binari comput log log index kth leftmost point li vertic strip algorithm check cn vertic constant hidden notat lemma answer repeat step report oe vertic ly insid strip log desir vertex total obtain lemma set point move fix veloc preprocess log log expect index requir log disk queri time nb nb answer log note build index queri window answer optim modifi queri perform structur deterior time queri nb event answer log circumv rebuild entir structur interv switch structur time answer queri time nb log log log rebuild charg log event pai reconstruct cost obtain theorem set point move fix veloc maintain index expect kinet event queri time nb nb answer index construct log log expect log disk block window data structur defin nb vertic describ preprocess index scheme wi disk block answer queri log nb vertic persist index discuss begin section nb disk block construct number disjoint persist small portion construct separ partit structur store point bundl jb jb clip refer critic level bundl union level jb figur construct wi store critic level persist sweep vertic line segment time instanc comput critic level intersect bundl construct separ persist line assum line uniqu identifi line order identifi updat structur line leav enter line critic level store pointer structur store bundl version note construct index perform updat critic level perform updat vertic perform updat vertic critic level level level level level level level level level level level figur nb critic level line intersect bundl shade queri time report point shade bundl time relev point bundl answer queri segment time find critic level intersect time pointer bundl structur find bundl complet span report point bundl time scan line bundl intersect complet span report relev point total answer queri figur analyz space requir preprocess bound wi determin number vertic critic level order obtain desir bound slightli modifi choic critic level select jb level random integ set level modif chang number asymptot bound size analysi queri bound appli prove lemma integ fa jb integ chosen expect number vertic level lie insid proof total number lie insid level vertex li level nb vertic lie insid expect size cn constant preprocess algorithm work random integ comput lemma size constant lemma abort random repeat step algorithm abort expect expect number construct critic level log log rest algorithm work earlier construct ensur bundl structur construct log total critic level comput wi disk block construct log log expect lemma set point move fix window vertic insid preprocess index scheme wi log log expect queri answer log number disk block index remark improv event handl bound theorem size nb log size bundl wi log queri time scan bundl rebuild structur log event lemma hold segment complet span window long segment obtain extend segment span window intersect simpli construct critic level segment bundl structur segment index move point turn point move analog trace line index queri util gener idea structur queri kinet event case correspond point pass event occur point coincid divid slice slice kinet figur denot boundari index consist slice structur sl slice show sl disk block answer queri construct log log expect requir updat event figur slice line trace project line intersect queri rectangl project plane intersect index log disk block total answer queri time rectangl determin slice queri sl report point index construct log log expect comput arrang obtain project line refer figur discuss section comput time nb divid window size log log comput time nb divid window size nb minf nb nb nb minf nb nb defin slice event rebuild index event obtain theorem set point move fix veloc maintain index expect kinet event queri time nb nb answer structur construct log log expect log disk block slice structur describ slice data structur time slice defin queri correspond find line trace intersect rectangl plane parallel slice data structur sl inspir window data structur wi develop subsect reli fact line intersect project xt intersect figur denot project project level nb level level nb level nb level nb figur critic level arrang project line segment intersect answer queri time queri bundl structur bundl complet span project report relev point bundl intersect span bundl window structur built segment point bundl segment complet span window defin segment enter leav bundl slice plane store set critic level project window persist inspir previou approach rang search store store nb level refer figur critic defin bundl nb level critic level lemma prove total expect size critic level nb collect point bundl store segment window structur wi develop subsect point enter bundl time exit time store part wi structur segment complet span window defin wi construct refer figur remark end section lemma appli extend segment intersect window lemma total bundl structur disk block expect construct log log answer queri find critic intersect bundl complet span queri window structur find point intersect project log scan bundl intersect complet span nb report remain point time refer figur conclud lemma set point move fix time slice nb event preprocess data structur sl log log queri time answer number disk block structur refer track erickson index move point proc annu acm sympo principl page vitter effici search linear constraint proc annu acm sympo principl agarw erickson geometr rang search rel advanc discret comput volum contemporari page american mathemat aggarw vitter complex sort relat problem commun arg extern memori data structur handbook massiv data set kluwer academ data structur mobil data proc sympo discret page bayer mccreight organ mainten larg order index acta asymptot optim vldb chamberlain battl paradigm time intl sympo command control research page chomicki revesz geometr framework spatiotempor object proc intl workshop time page ubiquit acm comput dei improv bound planar relat problem discret comput construct belt arrang applic siam vazirgianni abstract discret model spatiotempor data type acm gi page erwig schneider develop queri languag dexa gunther access method comput june vitter index data model constraint class journal comput system singh optim dynam rang search index structur proc intern confer page tsotra index mobil object proc acm symp principl page koubaraki tractabl queri answer indefinit constraint basic result applic queri spatiotempor inform proc intern workshop page random optim algorithm slope select inform process overmar upper bound measur problem siam approach index move object trajectori proc ieee intern conf larg page ramaswami subramanian path techniqu optim extern search proc acm symp principl page lopez index posit continu move object proc sigmod intl conf manag page salzberg tsotra comparison access method data acm comput sistla wolfson tempor condit integr constraint activ system proc acm sigmod intern confer manag page dao model queri move object proc annual ieee confer data page wolfson dynam attribut index method comput toth point set prepar effici access structur ieee transact knowledg data vitter onlin data structur extern memori proc annual intern colloquium lnc page cost model posit move object proc annual ieee confer data page track mobil unit real time proc intern confer page yesha updat queri track mobil unit distribut parallel chamberlain move object track proc sigmod intl conf manag page jiang move object issu solut intl conf scientif page
ML/74 6 infer learn hybrid bayesian network kevin murphi report januari comput scienc california california abstract survei literatur method infer learn bayesian network discret continu continu node multivari gaussian varianc depend valu discret node briefli hybrid dynam bayesian extens switch kalman filter report meant summar suffici level detail enabl implement dwell formal introduct discuss bayesian network node discret scalar joint distribut node condit gaussian instanti discret node distribut continu node form repres multivari gaussian normal densiti discret node continu parent gener kind bn exact infer algorithm relat review articl start discuss repres condit probabl distribut joint distribut encod give hybrid bn discuss infer learn techniqu repres local condit probabl distribut discret node condit distribut discret node parent mean tabl condit probabl tabl entri ijk denot jth requir ijk note wai condit distribut discret node requir fewer paramet full causal interact model tree default tabl continu node condit distribut continu node parent gaussian linear function covari fix standard linear regress model start assum parent real valu vector final case parent discret work support grant number award prof russel scalar case node parent kp condit distribut jx kp exp ki ki regress coeffici arc node parent write ki oe white random variabl model dont subtract parent ki oe color term vector case imagin simpl extens scheme node vector condit distribut jx kp exp ki view multivari gener linear ki ki figur gx hx write avoid subscript note expand vector yield scalar network shown figur vector notat compact figur bn node matric scalar bn case solid arc coeffici correspond row dot arc coeffici correspond row discret parent case node discret parent continu parent covari weight matrix note case make subtract parent depend discret parent joint distribut introduct state repres continu node repres discret joint distribut specif multivari gaussian show comput paramet function local paramet node scalar case start scalar comput construct diagon matrix varianc standard construct matrix ith column weight vector node assum node number upper triangular rewrit equat vector form sw wn vector term innov differ valu realiz predict linear def sw strictli upper write defin def result hold equat comput global equat subtract parent local mean stack parent jx equat graph topolog order comput simpl jx vector case block block upper triangular figur oe oe oe oe oe oe oe oe oe oe oe oe order node global matrix weight repres connect repres topolog condit independ properti gaussian graphic model section show ij covari matrix call joint mean node repres joint distribut node exp normal constant ensur call moment characterist distribut expand quadrat form collect rewrit exp kx exponenti famili call canon relat moment characterist log jxj write equat scalar exp ij state jz joint densiti factor prove equat hybrid switch kalman filter dynam bayesian network bn model tempor stochast process creat network consecut figur kalman filter repres dynam bayesian network hidden state variabl observ variabl term state evolut sensor model implicit fact distribut jq jq gaussian node variabl state variabl model call hidden markov model discret node ad model switch kalman filter static network requir size figur show repres linear dynam system subject gaussian repres hidden state system time assum evolv linear white random vector distribut stationari set paramet repres observ vector time assum linear function hidden uncorrel fw set paramet task comput probabl hidden state past jy call classic algorithm invent kalman task comput probabl hidden state jy yn call classic algorithm invent detail kalman filter develop track plane missil reason repres state posit missil singl track complic repres complex intern spatial structur object entir network node jointli gaussian replac entir encod jointli gaussian rv result network figur matric claim easier exploit condit independ assumpt learn possibl speed encod graphic encod implicit matrix abc bc cd de def figur origin dag show triangul graph dot arc denot arc introduc moral dash arc denot arc introduc triangul join tree produc squar denot denot cliqu triangul correspond elimin order elimin ensur neighbor lower order mutual connect ad edg elimin connect imagin dynam system repres mean discret shown figur set paramet plane call infer algorithm switch kalman filter state evolut equat sensor model equat briefli discuss comput issu involv perform infer hybrid dbn section infer discuss perform infer hybrid network join tree algorithm work undirect markov tree result deriv direct tree start review discret show gener handl gaussian final hybrid network pure discret case associ function joint probabl variabl evid discret potenti function repres discuss continu case associ potenti separ separ intersect cliqu end arc separ write complet joint probabl distribut pr pr set set joint xn refer figur assum impli properti undirect graphic separ triangul continu final evid arriv node observ updat potenti reflect fact variabl find cliqu call cliqu repres assign repres updat assign probabl combin inconsist discret set tabl entri discuss continu case pr evid event chang potenti idea cliqu send updat potenti reflect piec inform explain cliqu node receiv messag neighbor bar send send messag cliqu eventu global consist restor central version messag pass protocol pick root pivot node induc tree node send messag receiv children root send messag leav pass call pass call phase denot evid root denot rest evid pass cliqu potenti cliqu potenti pass recov posterior margin famili find cliqu margin variabl cliqu comput margin set variabl tree chain structur figur algorithm ident algorithm hmm thing remain initi updat cliqu potenti initi potenti cliqu multipli variabl assign assign assign separ initi forward pass backward result cliqu potenti joint probabl member variabl process illustr refer figur observ comput updat potenti write condit probabl fix constant independ evid potenti separ comput condit probabl comput neighbor separ absorb perform ffl calcul pr ns pr ffl give potenti pr ffl give potenti pr pr pr requir pr set pr tree satisfi requir call pure gaussian case discret potenti cliqu repres tabl gaussian potenti repres gaussian function moment canon form turn oper easier express term canon characterist easier express term moment characterist switch requir matrix slow introduc loss work moment form deriv equat moment state result canon case initi lauritzen spiegelhalt cliqu potenti initi product condit distribut node assign cliqu node assign forward backward pass cliqu potenti joint distribut member variabl call readi incorpor evid repres initi potenti initi forward backward pass moment form reason depend valu variabl assign node assign initi potenti form depend solut work potenti graph topolog cf repres initi potenti canon end initi comput moment form adopt approach vector condit distribut form exp exp log set canon characterist log gener result vector case scalar oe oe bb canon comput initi potenti cliqu multipli potenti variabl assign cliqu convert canon characterist moment characterist full invert easi scalar outer product rank enter evid observ continu variabl specif modifi potenti reduc cliqu potenti oe hx hy ky gener equat vector case comput analog result moment characterist start quadrat form ky expand ky ky ky def ax call complet ax yield oe log log multipl discret multipl updat potenti evid pr pr pr separ cliqu notic pr comput distribut multipli inform defin multipl gaussian case term canon multipli oe oe xn extend domain xn ad comput support function intersect previou support defin oe moment explicit formula condit gaussian margin oe potenti set variabl comput potenti subset ae variabl denot oe oe dimens dimens shown complet squar nice properti log jk log jk moment thing simpler simpli extract compon relat chang constant normal distribut hybrid case chang hybrid case potenti function continu discret node essenti set canon moment characterist discret node oper margin margin continu proce section discret node margin discret node depend sum constant call strong margin varianc depend mixtur simplifi list term arrang thing integr continu node discret node write achiev ensur continu node elimin discret ancestor node elimin order call strong case hybrid elimin node discret ancestor clash desir elimin node slice elimin slice dont strong number mixtur compon exponenti length sequenc standard approach mixtur compon correspond comput give var lauritzen show approxim kl learn discuss find maximum likelihood estim paramet node assum set train assign node network call fulli observ section address issu valu variabl unknown assum paramet node independ maxim separ term joint distribut depend involv comput suffici statist famili linear gaussian mixtur linear gaussian distribut exponenti famili size suffici statist equal size paramet vector independ fulli observ case discret case discret paramet vector ijk tabl number suffici statist ijk number time event occur train set ijk ijk ij ij ijk mle ijk ijk ij gaussian case approach adopt model joint distribut node parent famili comput suffici statist find mle paramet suffici statist exampl def qn def qn simpl updat suffici statist comput paramet node suffici statist linear regress repres child condit densiti jx local paramet node yz zz yy broken individu parent hybrid case exact posterior distribut hybrid potenti mixtur gaussian approxim singl gaussian perform weak margin arbitrarili bad replac multimod distribut unimod error introduc step ffl result show hybrid total error function ffl mix rate markov independ altern approach learn hybrid maxim exact lower bound produc tractabl approxim origin structur partial observ case observ node train longer close form express mle investig method learn circumst method make pass train updat paramet end reach local maximum likelihood batch method easi convert increment updat paramet subset train set increment em increment gradient em basic idea expect maxim algorithm miss valu expect valu wrt current set expect suffici statist comput mle paramet set mle process repeat likelihood stop prove em converg local discret ess ijk gaussian ess je qn je hybrid comput bot kind ess discret parent present em algorithm detail start valu paramet node broad covari good sampl assign unduli low likelihood repeat reset ess node reset train case updat log ii comput posterior margin famili evid iii updat ess famili comput mle paramet famili ess converg step comput infer algorithm discuss earlier gradient descent comput express gradient learn method maintain constraint paramet continu remain symmetr posit discret ijk lie insid unit cube surfac ijk maintain constraint solv problem unconstrain convert back learn paramet softmax function learn paramet end set technic order nomin faster conjug gradient primarili em avoid requir comput point evalu requir call infer engin techniqu approxim hessian dont requir line perform prior comput map estim avoid overfit train comput map estim ml estim suitabl prior discret node dirichlet simpl intuit interpret term pseudo imagin number ijk case event add real count vector gaussian thing complic simpler associ prior distribut famili paramet bx node suitabl prior import lot data ensur posit definit refer infer messag topolog transform vector gaussian continu network proc conf uncertainti baldi smooth learn algorithm hidden markov model neural koller approxim learn dynam model advanc neural inform process submit koller tractabl infer complex stochast process proc conf uncertainti kanazawa adapt probabilist network hidden variabl machin track data associ academ li estim techniqu softwar artech buntin oper learn graphic model ai page chang fung symbol infer continu variabl proc conf uncertainti page optim statist driver implement continu bayesian network sum weight gaussian proc conf uncertainti page thoma dean michael wellman plan control morgan edward introduct graphic model geiger heckerman learn gaussian network proc conf uncertainti volum page ghahramani hinton switch model technic report dept comp univ ghahramani learn dynam bayesian network cl gile adapt process tempor inform lectur note artifici intellig jensen introduct bayesian network ucl influenc diagram junction tree proc conf uncertainti kim dynam linear model lauritzen propag mean varianc mix graphic associ model stat decemb lauritzen graphic model lauritzen spiegelhalt local comput probabl graphic structur expert system stat soc lauritzen graphic model associ qualit quantit annal neal hinton view em algorithm justifi increment variant submit causal probabilist network discret continu variabl ieee transact pattern analysi machin pearl probabilist reason intellig network plausibl infer morgan fusion multipl observ belief network artifici ghahramani unifi review linear gaussian model august jordan probabilist independ network hidden markov probabl model technic report microsoft gaussian influenc diagram manag statist analysi finit mixtur distribut mike west jeff harrison bayesian forecast dynam model whittak graphic model appli multivari statist xu jordan converg properti em algorithm gaussian mixtur neural xu comput margin arbitrari subset margin markov tree
HCI/75 4 softwar platform distribut interact system abstract equip softwar platform design engin support develop distribut interact mix realiti user interfac combin distribut input output devic creat coordin experi equip develop interact heterogen devic handheld devic larg server network wire wireless kei element equip share data combin idea gener event system collabor virtual environ data servic uniqu balanc treatment state commun support distribut comput remot class load passiv data distribut equip project equat interdisciplinari research collabor freeli sourc form work irix introduct develop interact devic mobil commun infrastructur grow focu ubiquit interact system support peopl real world environ system place digit inform physic space deliveri inform user heterogen collect devic rang handheld wearabl comput larg displai major system exploit locat contextu cue drive interact equal trend growth number collabor virtual chri greenhalgh mix realiti nottingham nottingham uk environ manag cooper interact ubiquit comput environ exploit real world system exploit locat virtual world contextu cue interact research approach tend opposit ubiquit comput comput world virtual environ user comput gener world part ongo research explor advantag gain converg collabor virtual environ overlaid top share physic space number kei advantag motiv desir combin physic virtual support interact abil exploit virtual world resourc coordin manag devic interact physic space opportun develop applic span physic digit requir collabor field oper personnel chanc support kind interact combin element virtual world rich media high vari mode access extend geograph area period time period dai ultim goal develop rich interact experi combin physic digit digit interact increasingli everydai interact physic world paper present equip platform develop support merg physic virtual environ part equat interdisciplinari research collabor uk equip freeli make rest paper overview kei element provid exampl equip illustr aspect conclud relat equip work identifi area develop explor merg physic digit equat irc explor relationship physic everydai life work common understand mix realiti rang collabor virtual environ wearabl system extrem involv construct rang environ rang citi museum guid environ school children equip common platform applic develop interact physic world direct digit effect virtual interact virtual manifest physic physic virtual world distinct characterist place demand support infrastructur virtual world amount structur state inform virtual world user rapid updat data user movement demand perform requir realtim render tight integr multipl media realtim audio video devic physic world extrem includ input displai capabl variat network coordin collect person peopl physic environ address equip facilit interfac rang exist independ system servic digit devic access wide rang resourc architect implement equip make applic pattern typic span combin multipl local geograph separ locat kind devic includ pc mobil wearabl devic network vari combin wire wireless infrastructur input output devic distribut multipl io devic modal brought singl interact number addit support java code portabl easier throughput suffici support interact extens softwar make easi add data applic support modular coupl applic encourag support focu paper technic architectur element equip approach data share coordin element kei core runtim structur support dynam code load modul structur support structur code modul convent direct map java core runtim structur illustr figur equip depend core runtim system support code load solid code run netscap portabl runtim portabl java regular jvm includ person equip number modul framework core runtim modul support standard facil memori manag util vector matrix tcp udp network share data incorpor idea previou work effici time data share common interfac type definit render audio video session devic input implement includ specif implement common interfac type render applic client implement applic modul modul core modul portabl figur runtim structur equip modul structur modul fundament part provid basic support softwar compil load figur show structur typic equip modul modul modul idl idl compil gener file loadabl jar modul spec class implement file figur develop time structur equip modul part structur standard implement sourc make file defin modul entri point compil dll jar file framework compil includ java dynam load modul equip applic equip independ definit class definit file equip idl definit object subset corba idl local remot interfac languag bind equal cast pattern match idl subset standard gener code languag bind differ number closer java pattern match oper extens equip data share detail languag bind main benefit idl defin class class instanc process java read process standard facil provid idl compil addit pattern match standard object factori modul convent code load support dynam load modul order support class load programm observ idl declar equip modul singl corba modul namespac modul gener class namespac java class java packag modul match idl modul underscor replac doubl colon modul idl declar uniqu namespac convent equip runtim system map class modul modul load regist object factori class static runtim system load instanti arbitrari class runtim present equip java runtim directli load class nativ class load facil equip dataspac kei advantag equip data share servic refer dataspac provid bridg collabor virtual environ multipl real world environ data space inform element simultan virtual environ devic physic world arrang shown figur share inform equip dataspac figur share data virtual physic applic equip revolv equip data servic make inform commun devic virtual environ share data servic number easi introduct data type tightli integr support data distribut support coupl data exploit pattern inspir tupl space gener event system throughput suffici support interact support intermitt limit bandwidth variabl wireless network current implement applic creat dataspac dataspac client attempt connect dataspac server simpl equip servic dataspac server identifi url scheme form equip data servic combin event distribut state share propag effect interact share inform event distribut equip data share servic event distribut compar standard event base applic programm subclass modul creat event type event send oper dataspac client server portion origin subscrib event creat event pattern includ templat event object event match callback invok illustr figur omit detail subscript event distribut callback subscript client server event client figur simpl event distribut dataspac distribut event server client demand event forward client subscrib current implement forward event gener client exclud specif event forward depend state state share pure event system state addit protocol overlaid event system addit constraint enforc late join client send event inform exist client respond event describ exist state race condit join client receiv updat receiv repli describ state altern late join client discov exist state element environ gener event suffici inform fulli describ impli state equip data share servic integr state share data servic give hybrid distribut servic intend applic programm event action state state element button repres element state subject chang sequenc button exist state observ state chang data servic defin core event gener applic dataspac repres modif remov data server defin abstract base class share applic programm share form state creat modul class extend extens data servic support state twofold data servic client server incorpor dataspac maintain copi data item instanc subclass add event call match data item ad local dataspac updat event updat item dataspac delet event remov referenc item extens data servic option add delet event event subscript made remov subscript express interest updat delet event arrai data item templat item monitor ad dataspac dataspac gener add event match data item local item monitor remov dataspac gener delet event match data item remain local dataspac ensur user item monitor add event match data item item monitor item subsequ ad updat final delet event item monitor item delet illustr figur callback local dataspac data item add updat delet event client server event figur integr event dataspac distribut replic previou descript directli address event data item replic data servic server current implement client send event server add delet event server pass event copi oper data item client replic event client server achiev distribut replic subscript ad data servic reifi concret intern event pattern data item dataspac data item replic server server inform creat local subscript callback forward match event client illustr figur client subscrib event type client data servic creat event pattern data item includ copi event templat add event repres creat data item copi creat subscript event type behalf client client emit event type send copi event server event match subscript held behalf event forward client origin client receiv event event match origin call callback client code execut mechan appli updat delet event data item replic client server initi subscript proxi server subscript subscript pattern data item client subscrib client server server event publish client figur event distribut discuss subscript event data item base builtin pattern match class event data gener pattern match approach commun encourag support coupl applic develop data server blackboard client obtain input irrespect origin pattern match data publish output independ final send back data servic basic event distribut style standard state share style combin distinct featur item ad dataspac cf remov dataspac event pattern delet data item match cf copi dataspac monitor event pattern compar unlik pure item global uniqu identifi data item unambigu prevent ident data item ad dataspac explicit updat requir combin updat identifi reliabl case discard network data servic infrastructur face congest buffer overflow featur chosen provid reason accommod asynchron commun lower bandwidth intermitt connect local perform primit requir remot coordin perform introduct network delai oper avoid network kei equip mechan introduc structur equip data servic section number kei technic element underpin equip present support pattern wai distribut support dynam discoveri devic servic pattern match languag idl compil pattern match oper class gener pattern match oper class flexibl equip data share servic reli heavili facil reflect languag java potenti support pattern match reflect ineffici pattern match oper determin partial instanc match object templat match instanc field primit type string type field templat null equal field instanc null string field act object refer type field templat referenc object treat templat match object refer field instanc null object refer field act arrai type field templat length match field instanc length arrai act definit pattern match place constraint class design primit type field wildcard pattern match oper box separ class object refer field set null templat act wild card oper provid requir semant modul develop implement provid class pattern match semant equat irc interest notion match account element context requir form pattern match code mobil distribut comput descript core data share facil applic suffici share complet passiv state button input devic applic desir distribut element comput exampl collabor virtual dead render object dead reckon dead reckon techniqu commun trade distribut comput data item repres posit virtual vehicl pure passiv data updat vehicl move approxim initi veloc inform extrapol chang posit time data item repres vehicl expect updat current extrapol start deviat significantli actual movement client determin posit evalu dead reckon function vehicl distribut replic render object graphic object distribut passiv scene provid receiv client function render scene graph type object hard repres effici scene continu deform surfac repres evalu mathemat function altern scene graph similar render render includ situat share code requir render object state object draw kind distribut comput equip data item share data space object host program languag idl compil gener default modul programm provid method method render object data item replic dynam code load implement code object load client provid local distribut comput specif object class dynam discoveri challeng creat interact system span multipl machin locat configur element system servic discoveri mechan burden reduc amount find data server devic applic automat equip support number element dynam servic section equip dataspac provid flexibl context servic discoveri publish locat data item repres servic dataspac prior problem locat dataspac form discoveri address problem expand equip url scheme simpl servic support queri form multicast group discoveri dataspac equip applic easili locat current dataspac servic compar locat servic directori implement support multipl redund servic discoveri dataspac singl network potenti server locat local discoveri dataspac standard data item modul exist sensor input simpli begin creat maintain data item discoveri dataspac reflect current state client normal item monitor facil inform exist item exist requir servic actual data case devic mention equip equip number interact experi combin real virtual develop arrang creat number input output modul equip publish input includ gp tilt pc gui input simul simul joystick handheld tag reader light track interfac monitor creat virtual creat control graphic view render includ simpl solid abstract data view object posit global locat audio control massiv audio gener midi messag equip data date number project includ mix realiti interfac collabor experi experi virtual tourist virtual realiti reactor displai physic visitor handheld wireless devic virtual histori experi develop part shape museum shape museum demonstr shape museum demonstr equip perform integr connect physic world form input output devic mobil virtual system virtual figur support wireless user shape museum demonstr world experienc real world interfac handheld devic compaq audio landscap laptop special devic call devic present experi share environ system data distribut facil construct maintain share virtual world standard equip compon provid bridg equip creat render graphic view virtual world convei keyboard input relai inform avatar object virtual world equip creat anim virtual object world data equip dataspac figur show compon shape museum demonstr order give outdoor wireless user avatar virtual world gp client entiti give outdoor wireless user inform object virtual world proxim manag server simpl client run access intermitt connect wireless devic provid proxi servic arrang client send receiv equip data item udp transport protocol support nativ equip commun futur proxi receiv equip item applic dataspac add item behalf client updat issu relev data item arriv client experi arrang found low memori devic receiv larg number event reason rate interim measur addit lightweight ascii protocol develop commun proxi low resourc devic subsequ run full equip client small devic care thread manag avoid addit proxi protocol applic relat work domain interest distribut interact system view approach ubiquit term environ place digit inform physic space support infrastructur exploit contextu inform provid space manag interact servic user develop virtual environ construct collabor virtual environ virtual space manag interact major support servic protocol kind ubiquit comput repres access servic provis commun mechan devic includ extens protocol world wide web number gener devic discoveri mechan platform embodi philosophi place fairli demand devic link support infrastructur contrast focu low cost lightweight infrastructur number devic share inform exist platform focu commun devic protocol incorpor facil share jini incorpor javaspac similar model share state exploit guid system similar share state base model exist collabor virtual environ develop equip number devic commun boundari real permit converg world equip data share servic support share arbitrari data heterogen distribut embrac applic written java equip platform extend work tupl space linda share virtual environ provid activ share state infrastructur equal access larg virtual environ small handheld devic applic platform servic inform enabl number flexibl context driven resourc discoveri polici coexist equip commun perform data direct commun kind indirect commun distribut tupl space gener event distribut system indirect facilit construct coupl distribut system bridg physic digit contrast direct pattern commun found context toolkit term context toolkit adopt real view context equip closer blackboard paradigm dei observ blackboard approach free applic develop focuss specif devic support declar style program hand challeng paradigm integr access control privaci extens blackboard paradigm permit support issu content explicit time challeng address equip futur work satisfi current implement area plan enhanc identifi current process build instal equip intend creat simpler bootstrap trust java applet current system requir compat version equip modul instal machin advanc intend extend support dynam download updat equip simplifi ongo mainten current system reason support servic address part configur manag process interfac prioriti provid stronger support complet activ applic configur manag architect data share servic cope characterist wireless local asynchron independ dataspac replica client work support mode current network emploi constraint order network timeout ideal current implement support dataspac associ period disconnect replic item remov network connect restor network connect restor support activ continu wireless devic period disconnect current system explicit notion histori previou state start appli notion tempor link record replai approach preserv access histor inform facil requir support gener notion histor context acknowledg work carri equat interdisciplinari research collabor fund epsrc uk shape project european framework disappear comput initi refer april support lang virtual ieee comput graphic applic steve john paul martin mike chri toni tom holger ian virtual interfac reveal hidden virtual proc ubicomp page novemb role connect support lectur note comput germani dr flight simul dynam model virtual vol fall pp tupl space base platform adapt mobil proc int confer open distribut platform canada architectur support build phd dept comput georgia institut novemb equat april april david commun acm transact program languag jan vol pp chri jim steve mike adam ian record replai virtual acm intern confer marina del unit acm york insid flexibl support data consist world proc acm confer collabor virtual environ san usa virtual virtual februari issn ibm ian barri steve matthew nick chri dave cliff anthoni tom ian mark visit equat submit taxonomi mix realiti visual ieic transact network netscap portabl april april esp chapter thing arent innov technolog inspir design interact system acm june bill segal david left notif servic septemb holger martin mike paul mix realiti interfac proc chi page acm april anthoni steve nick chri ian cliff holger interfac project annual project technolog march fl interact landscap creativ proc acm confer human factor comput system sun microsystem javaspac sun microsystem jini connect swedish institut comput scienc dive toolkit distribut vr plug plai plug plai overview parctab ubiquit comput experi ieee person commun magazin portabl system dynam virtual present ieee virtual realiti annual intern symposium world wide web extens markup
AI/76 2 proposit modal satisfi descript logic subsumpt ian horrock peter uk bell lab murrai usa abstract effect techniqu make dramat differ perform knowledg system base express descript logic correspond descript logic proposit modal logic techniqu carri proposit modal logic satisfi check system emploi fact make effect satisfi checker proposit modal logic introduct descript logic logic formal knowledg individu descript individu descript logic repres reason descript similar peopl friend doctor peopl children doctor lawyer child comput perform system implement descript logic base determin descript gener scheme comput subsumpt depend express power descript logic complet system descript logic system perform numer subsumpt check subsumpt checker recent work shown determin subsumpt express descript logic determin satisfi formula proposit modal dynam logic part system implement descript logic satisfi checker proposit modal dynam logic descript logic system built descript includ essenti satisfi includ kri crack system incorpor number achiev perform subsumpt checker descript logic system wai oper avoid subsumpt check subsumpt descript logic natur knowledg descript proposit modal satisfi built system explor requir build express descript logic fact full descript logic dlp system provid limit descript logic interfac fact dlp incorpor rang adapt techniqu subsumpt checker system techniqu lexic semant branch boolean constraint depend direct heurist guid search cach techniqu make drastic differ perform system kri load modifi version knowledg base stuck determin thousand subsumpt requir load knowledg base fact higher level easili load knowledg classifi thousand definit hundr perform experi fact dlp test suit proposit modal formula built system qualit chang behaviour test indic util simpli reason proposit modal logic background fact dlp design build maintain taxonomi concept collect definit concept statement determin subsumpt partial order concept determin subsumpt relationship descript descript logic descript logic dlp implement call alc fact implement satisfi fact demonstr alc alc built atom concept kind atom role transit role concept alc form grammar atom concept transit role semant alc standard interpret pair consist domain map concept subset domain role binari relat domain relat transit semant concept express tabl concept subsum extens concept includ extens interpret semant alc simpl transform world semant proposit modal logic transform element domain correspond atom concept correspond proposit syntax descript logic translat syntax modal proposit replac perform obviou replac syntax semant fd fd fd fd tabl semant alc concept express role correspond modal transform show fragment alc correspond transit role alc role alc express formula kt usual encod map determin subsumpt alc relat problem determin concept alc satisfi build practic descript logic system base express descript logic sort intract subsumpt system base descript logic alc gener determin subsumpt hold transform subsumpt question satisfi question attempt construct model tableaux satisfi checker proposit logic attempt construct model formula node node repres individu individu belong concept valu formula set concept form label denot label node node connect modal relationship tree start root node node relat node role node call basic algorithm start singl node repres individu extens concept test satisfi formula evalu true concept expand produc simpler concept individu extens formula evalu disjunct concept give rise choic point algorithm existenti role modal creation successor node repres individu role concept modal augment concept individu belong true order transit role requir filtrat check ensur node set concept node cycl algorithm construct collect node compound concept expand obviou call collect node correspond model initi concept algorithm fail construct collect initi concept unsatisfi detail includ termin fairli found techniqu basic algorithm slow form basi descript logic system investig emploi rang adapt improv perform satisfi test includ lexic semant branch boolean constraint depend direct heurist guid cach theoret descript tableaux algorithm gener assum concept express test negat normal negat appli atom concept simplifi algorithm mean clash detect atom concept negat occur node label test satisfi concept express atom clash detect algorithm creat concept clash detect immedi transform negat normal form larg complex express lead costli wast problem address transform concept express lexic identifi lexic express concept treat clash detect concept express negat occur node label lexic concept express consist atom conjunct concept role express form transform express form transform cn sort duplic elimin process includ simplif extrem case tableau complet elimin simplifi express effici enhanc tag lexic distinct express uniqu code express identifi simpli compar tag tableau concept form complex negat normal dealt kri address complet lazili expand retain node label similar techniqu benefit tag dealt express transform term lead directli creation label occurr lexic tag clash immedi structur standard tableaux algorithm inher ineffici search techniqu base syntact branch expand label node syntact branch work disjunct search model obtain ad disjunct altern branch search tree prevent recurr unsatisfi disjunct branch result wast costli discov unsatisfi requir solut complex tableau node td td unsatisfi concept lead search pattern shown unsatisfi demonstr fcg clash fd fcg clash fd problem dealt semant branch techniqu adapt procedur commonli solv proposit satisfi problem disjunct singl disjunct chosen disjunct obtain ad search strictli possibl wast search syntact branch addit advantag base search techniqu great deal implement algorithm boolean constraint propag heurist guid search size search tree boolean constraint propag techniqu determinist prune search tree clash perform semant branch appli label node determinist expand disjunct present possibl detect clash disjunct possibl number possibl present disjunct equal number disjunct infer rule simplifi express repres node determinist expand disjunct clash clash fc fc dn clash clash prune fig thrash backtrack add identifi clash branch occur inher unsatisfi conceal lead larg amount backtrack search thrash problem exacerb block block requir explor form perform expand node td lead explor inher unsatisfi discov search tree creat tableau algorithm illustr fig problem address adapt form depend direct backtrack call solv constraint satisfi problem similar techniqu harp theorem prover work label concept express depend set indic branch point depend concept express depend branch point ad branch point depend concept express depend branch point concept express depend concept express ad determinist deriv depend clash depend set clash concept identifi recent branch point explor branch allevi clash algorithm jump back interven branch point explor altern branch expand node previou search algorithm perform sequenc eventu lead node xn ae expand algorithm gener concept express expand clash detect ae branch point lead xn depend algorithm return unsatisfi immedi depend set jump directli back recent branch point depend figur illustr search tree prune number explor reduc heurist techniqu guid search size search tree method wide sat algorithm branch disjunct maximum number occurr disjunct minimum size disjunct occur frequent small heurist effect label node disjunct branch lead determinist singl ad disjunct fulli expand ad expand disjunct branch dn singl disjunct expand heurist interact overrid order older disjunct result earlier branch point lead effect prune clash discov heurist reli effect find disjunct recur multipl sat disjunct proposit number variabl small compar number disjunct problem trivial concept satisfi disjunct concept number concept express larg compar number disjunct heurist discov disjunct similar equal guidanc altern strategi emploi heurist effect depend set guid choic heurist concept depend set includ earliest branch point techniqu select disjunct order heurist area continu preliminari result suggest depend heurist techniqu satisfi check successor node creat node tend node concept express role concept time spent comput node end label satisfi algorithm care node satisfi time wast successor creat possibl node entir set concept express node label gener time satisfi statu node complet determin set concept express exist node set initi formula node satisfi statu work potenti save amount work node work successor node downsid cach depend inform requir effect calcul node expand depend set clash detect depend depend set incom concept differ node combin depend set incom concept express depend set unsatisfi node problem cach requir set retain end satisfi chang storag requir algorithm polynomi exponenti worst case test implement fact test efficaci test suit dlp differ implement implement exact heurist time report run machin approxim speed sparc ultra prefer test actual descript logic knowledg fact dlp design descript logic knowledg base construct provid fact dlp test knowledg base construct version accept dlp make role elimin axiom illustr import time dlp refer system dlp fact dlp process knowledg base classifi thousand concept definit requir ten thousand satisfi test dlp kri unabl complet process knowledg base hour test test suit proposit modal proposit modal logic interfac fact dlp test test suit proposit modal logic comparison collect random formula initi gener schmidt test suit consist class formula provabl type exampl supposedli exponenti difficulti result test number largest formula system solv cpu time result test dlp kri tabl test origin lisp implement faster implement fact dlp dlp kri branch lin path ph poli kt branch md path ph poli branch ipc md path ph tabl result benchmark hardest problem solv kri reason transit perform satisfi test fact dlp outperform system dlp clear cach dlp perform system due optim retain dlp outperform system part comparison analysi differ dlp dlp present space show cach import import heurist fact heurist significantli degrad perform case fact dlp result simpli improv absolut perform qualit behaviour illustr fig show actual solut time type formula dlp cach turn exampl qualit improv cpu time problem size cach cpu time problem size cach fig solut time construct satisfi problem due cach common due proposit modal logic test suit method test sat procedur adapt proposit modal giunchiglia sebastiani refin schmidt method random gener produc characterist formula control number paramet formula conjunct disjunct element negat probabl element modal atom form maximum modal depth proposit variabl chosen proposit variabl formula schmidt set denot case test set creat vari give formula probabl satisfi vari gener formula integ median time requir test satisfi limit dlp kri shown fig test perform differ dlp mark case test pure proposit problem depth solv perform depend effici proposit reason depth fact dlp outperform notabl formula hard modal random test suit show perform proposit modal good collect random formula comput difficulti initi compon realist kb expect encount problem hard number successor consid interact compon formula hard collect valid cpu time fact dlp kri cpu time fact dlp kri fig median solut time randomli gener satisfi problem regular structur formula util cach satisfi formula summari collect optim effect improv speed modal proposit logic shown result dramat improv speed subsumpt reason descript logic knowledg base knowledg improv investig modal proposit reason literatur combin uniqu result power reason proposit modal logic benefit optim complet clear cach order understand continu analyz improv incorpor prover plan creat test suit modal natur descript logic embark project creat descript logic system descript logic correspond proposit dynam logic project give opportun investig satisfi reason refer empir analysi optim techniqu terminolog system make kri move principl knowledg intern confer page san dfki baader hollund knowledg infer system sigart baker intellig backtrack constraint satisfact theoret result phd comparison theorem prover modal logic introduct summari de autom reason analyt tableaux relat intern confer number lectur note artifici page implement test express descript preliminari report gerard robert andrew veronica knowledg storag intern kruse page loveland machin program theorem prove commun de exptim tableaux alc collect paper intern descript logic workshop number aaai technic page aaai menlo freeman hard random problem procedur artifici giunchiglia sebastiani procedur alc principl knowledg intern confer page morgan kaufmann san novemb benchmark method proposit modal logic technic report octob horrock tableaux procedur descript logic phd schmidt evalu procedur modal logic technic report fur im februari theorem prover journal autom system dlp bell lab murrai decemb sattler concept languag extend kind transit role deutsch fur kunstlich number lectur note artifici page springer schild correspond theori terminolog preliminari report intern joint confer artifici intellig page
AI/77 2 copyright ieee publish april japan gestur interfac jochen christoph von der malsburg institut germani southern california dept comput scienc section neurobiolog lo usa abstract present gestur interfac implement real robot user give simpl command grasp object put gestur analysi reli realtim track user hand analysi hand shape presenc vari complex background introduct robot futur interact human natur understand spoken gestur command articul speech gestur interest gestur interfac robot oper uncontrol real world environ constraint special case robot visual system cope variabl possibl complex background system requir uniform background exibl real world applic system person independ user oper necess retrain system requir user wear marker color tediou light condit uncontrol robot cope light situat robot capabl real time perform figur robot automat visual gestur recognit hold make interfac natur receiv attent review publish work requir state work franklin al attempt build robot waiter domain pose challeng robot gestur distinguish empti hand hand hold object base skin color figur user point object hand postur indic robot grasp object gestur robot place object visibl system present cui weng recogn hand gestur front complex background reach correct recognit person independ reli slow segment scheme imag heap hogg present method track hand deform work presenc complex background deform model describ hand postur variat aim recogn postur work present campbel al system recogn gestur motion base analyz shape user hand work realtim gestur system control comput user interfac fast minor drawback system hand track adapt user system present similar setup requir constant background gestur hand task robot kinemat redund arm grasp object direct top arm stereo camera head freedom mount tilt vergenc motion camera yield imag pixel size design applic robot recogn gestur human oper grasp object move robot locat front tabl object user point robot grasp hand postur perform user point robot direct grasp object gestur user object robot recogn gestur track hand rest analyz hand postur skill recognit shape orient object point grip plan grip execut discuss track user hand track user hand reli combin motion color cue addit stereo cue rule target plane imag downsampl size pixel color format track run speed hz hand stop move track return posit hand hand postur activ motion cue comput threshold version absolut differ imag intens compon consecut imag threshold step function appli local switch pixel high number direct switch isol motion cue respond move imag move object extent shadow typic result motion cue camera imag depict color cue skin color detect base hue satur compon imag prototyp skin color point hs plane pixel input imag comput euclidean distanc scale ax differ closer figur motion move imag area select note cue prone detect shadow move object figur refer physic scene depict figur pixel higher skin color similar cue select hand approxim object depict cue prove spite prone sensit drastic color produc spotlight tv team onlin skin color prototyp case desir pursu point attent map stereo cue camera result color cue motion cue simpli ad weight stronger weight put color cue ensur system work lower cue break attent map comput convolv summat result gaussian kernel order smooth stress larger blob activ attent map left imag simpli ad activ blob object fall locat attent map strong case object plane principl turn problem practic global maximum sum attent map comput posit gradient ascent perform attent map nearest local maxima triangul yield estim hand posit dimens due low estim rough challeng task track skin figur color area approxim skin color highlight local point hand cue ambigu color object search local maxima sum attent map vicin local maxima found previou frame long object move fast activ track track run mean camera head freedom target center left camera imag scheme activ track control vergenc angl independ pan tilt angl control vergenc angl add attent map left imag rel horizont displac neg number pixel result imag stress featur front plane comput global maxima imag highest imag front plane vergenc angl camera converg highest plane vergenc angl distanc hand comput directli current vergenc angl reach accuraci cm distanc cm distanc highest global maxima close vertic horizont border indic hand leav saccad freedom made bring back imag center movement camera head imag acquisit motion cue track motion activ figur result attent map extract camera ad suppress target plane fixat hand upper figur figur postur robot grasp object side ing effect frame rate depend rate size saccad gener lower hz mention hand postur hand postur analyz posit comput region interest pixel select point yield track camera greyscal imag region downsampl factor serv input hand postur postur depict robot grasp object postur recognit base elast graph successfulli appli object face process grei scale imag work presenc vari complex background adapt earlier system elast graph object repres label node carri local imag inform edg inform geometri model graph creat postur graph studi node edg local imag inform node repres vector gabor base kernel call jet kernel oe exp exp exp orient size kernel sampl depict jet convolut kernel size orient give local imag descript fuse graph obtain person perform postur singl bunch graph detail bunch graph concept complet descript match process imag qualit describ procedur graph repres postur match imag move imag jet node region imag lie match process geometr transform ffl scale graph chang size ffl rotat plane graph rotat imag plane kind transform jet chang gabor robust respect small geometr transform contrast previou version system local singl node part match procedur experi shown recognit reliabl recognit postur singl graph postur sequenti match imag postur graph obtain highest similar select winner contrast scheme deal stereo imag pair postur recognit match graph postur imag sequenti add similiar postur imag postur highest total figur node graph label gabor base kernel form plane wave restrict gaussian envelop function real imaginari part figur graph correct postur match input imag due graph match perfect good recognit chosen recognit result current research deal intellig strategi elast graph match stereo imag match made subject geometr constraint object assum similar scale imag result match process imag camera depict local node graph rigid global scale match reliabl postur recognit experi user show correct case realist moder complex background previou system reach correct recognit postur front highli complex background depict light tightli control mean fewer postur coarser manag reduc previou recognit time gabor transform imag convent sun ultrasparc workstat match model graph add gestur distinguish gestur task posit gestur object grasp postur direct grasp posit graph imag import issu long postur object local recognit step small error determin point space object accuraci imag resolut error pixel graph posit lead error approxim cm hand posit space depth compon distinguish postur requir oper postur perform speed match process factor equal number postur test gestur figur postur perform subject complex background pictur give good impress variabl size postur hand background system kind cope discuss outlook present gestur interfac implement real robot system prove robust demonstr visitor test frequent earlier mention problem track drastic chang light hope solv onlin color system meet requir pose introduct robust work presenc vari complex retrain user requir wear marker track capabl real time perform extens postur complex tradeoff number accuraci speed match process introduct color make system robust respect illumin emploi color inform recognit process work ad color inform jet node model graph preliminari result attempt intend close gestur commun loop robot perform gestur point unfamiliar object user suppli robot combin speech base interfac project achiev natur interact acknowledg work support grant german feder ministri scienc technolog refer vd robot grasp pentland invari featur gestur recognit intern confer automat face gestur recognit octob cui weng hand sign recognit intens imag sequenc complex background intern confer automat face gestur recognit octob firbi happi patron make creat robot waiter perseu anim agent architectur intern confer automat face gestur recognit octob heap hogg hand track deform model intern confer automat face gestur recognit octob gestur tradit user interfac intern confer automat face gestur recognit octob vd distort invari object recognit dynam link architectur ieee transact wai oper comput intern workshop automat gestur recognit june huang visual interpret hand gestur review ieee tran vd malsburg robust hand postur complex background intern confer automat face gestur recognit octob vd malsburg robot gestur recognit gw gestur workshop vd malsburg face recognit elast graph match ieee tran
DB/78 3 improv data clean qualiti data lineag facil galharda inria rocquencourt daniela florescu propel denni shasha courant eric simon inria rocquencourt inria rocquencourt abstract problem data consist remov inconsist error origin data area support system data exist etl transform data clean tool write data clean program insuffici import challeng design data flow graph effect gener clean data gener difficulti lack explan clean result user interact facil tune data clean program paper present solut handl problem enabl user express user interact declar tune data clean program introduct develop internet servic requir integr heterogen sourc data sourc unstructur intend servic requir structur data main challeng provid consist data clean found superior technic lisbon fellowship program praxi xxi copyright paper belong paper author permiss copi fee part materi grant provid copi made distribut direct commerci advantag intern workshop design manag data june illustr difficulti data clean appli sourc unstructur introduc concret run web site collect bibliograph refer comput scienc document web form pdf file enabl web client citat order find time paper referenc data construct site larg set string record record belong data dallan ashish singh jennif widom make view data wareh confer parallel distribut inform system miami www make view data establish paper challeng record kei establish ident syntact format differ record author written format confer abbrevi full text parallel data year public data erron due misspel error introduc automat process postscript pdf titl record record hold citi countri miss record problem data clean support system data transform load tool data reengin tool provid power softwar platform implement larg data transform extract data flow arbitrari data sourc progress combin flow varieti data transform oper clean appropri format data flow obtain result data load tool offer limit clean function informatica dedic data clean integr import realiz data difficult autom clean fix set transform year public record appar refer obviou criteria decid date user explicitli consult exist specif support user consult write data specif file analyz user integr data clean program properli handl exist process data clean unidirect oper analyz inspect log file impedi refin data clean program paper present mechan base except offer data clean framework support refin data clean criteria contribut explicit specif user interact base except automat gener execut data transform oper data lineag facil enabl user interact inspect intermedi data backtrack clean process graph data investig result data transform modifi data transform interact illustr contribut data clean applic set bibliograph textual refer paper organ section overview framework section present except gener fourth section explain data lineag mechan section show result section conclud data clean framework framework support specif data clean applic graph transform migrat data set set string textual bibliograph set structur clean model identifi kei identifi kei identifi event correspond public identifi public kei author kei partial view data clean strategi add kei input record extract input output flow inform rel titl event associ titl author extract input output public data flow inform rel year url public auxiliari dictionari extract citi countri bibliograph refer dictionari store correspond standard synonym recogn elimin duplic flow author titl event aggreg flow titl flow public definit transform consist determin heurist automat lead accuraci clean result amount data reason imposs appli automat criteria record data illustr extract oper strategi separ author list titl assum punctuat citat comma clear detect author list finish titl start concern step titl present motiv consid duplic merg singl titl correctli written instanc consolid phase automat criteria longest titl duplic decid correct import defin interact point clean process oper execut automat input record user analyz record execut interact procedur handl framework permit model data clean program satisfi strategi data flow graph node logic oper input output data flow oper logic model relat map oper singl relat produc relat express data map due extern function view essenti correspond sql select relat input return singl relat express limit map match oper input relat produc singl output comput similar input record arbitrari distanc function cluster oper transform result match oper nest relat nest set cluster record input cluster record arbitrari merg oper relat repres set cluster appli arbitrari data map element cluster data clean strategi map data flow graph figur number data clean oper correspond step strategi output data flow step duplic elimin map sequenc oper merg step map singl oper logic oper make extern defin function implement treatment normal extract substr comput distanc execut creat regular output data flow possibl except data flow regular data flow record automat clean criteria oper process input record throw except entail insert input record except output data flow except input record attach except record stage execut data clean data lineag mechan enabl user analyz proven data flow graph interact appli correct user clean criteria correct criteria separ author titl modifi order includ word lower case assum titl start punctuat mark lower case word punctuat mark begin titl correctli correct logic oper user data led gener except interact correct user interact separ list author titl punctuat mark correct data data flow graph logic oper input function prove essenti experi report section manag except section describ gener except explicitli data clean oper semant syntax logic oper present formal descript declar data clean languag bnf grammar syntax found map oper map oper transform relat relat correspond step creat map kei select paper creat oper standard sql specifi input relat map oper keyword introduc sequenc assign statement assign relat assign express involv invoc extern function regist librari function return atom assign statement atom assign statement construct relat kei extern function argument variabl paper rang attribut paper relat kei construct tupl return except tupl ad relat kei tupl exc ad relat exc statement relat schema target relat select schema built attribut kei map command transform defin target string repres paper assum attribut hold result function function map view match cluster merg match cluster merg map map public citi countri author titl figur partial logic specif bibliograph refer schema section data clean program declar extern defin function schema relat return tabl function oper correspond step figur creat map extract kdd select select select event constraint null select constraint null select assign statement tabl assign statement return tabl relat assign result sql select express make defin relat keyword introduc filter express conjunct normal form syntax similar sql syntax consist select express schema target constraint target relat constraint foreign kei check syntax sql mean due manag except constraint violat output constraint execut map stop input tupl ad relat extract exc explain semant map oper assign statement evalu order tupl input relat syntax assign statement assign relat control order oper logic assign evalu throw filter check return true output constraint tupl ad regular output relat map except evalu output constraint violat except classifi depend place occur except explicitli declar thrown extern function call implement handl except thrown evalu input relat return except input tupl ad special output tabl exc extern function call extract map present gener except citat introduct suggest recogn end list author comma separ element citat except thrown function notifi titl extract anticip except declar explicit implicit explicit except throw possibl explicitli throw introduc throw express implicit except occur output constraint violat implicit except thrown extract oper output constraint violat null event extract briefli present cluster merg oper model duplic elimin author repres step view oper model step figur syntax except oper present differ respect map oper highlight match oper oper input relat intent find duplic mean addit constraint defin atom function assign distanc defin atom function comput integ distanc author produc relat tupl pair tupl filter tupl distanc return greater comput maxim length compar specifi target relat schema distanc creat match distanc distanc syntax compon oper present subtleti syntax match oper symbol input predic relat tupl match match return oper match oper gener implicit except explicit explicit except thrown gener applic match oper requir complet automat user interact requir cluster oper relat gener match oper present cluster oper produc set consist set tupl suffici close correspond author cluster method view tupl binari relationship group cluster tupl transit connect result cluster oper relat attribut input relat match oper defin hold identifi tupl input relat output cluster oper formal relat id attribut appli cluster oper transit closur tupl quass dallan quass quass quass gupta gupta assum identifi author tupl output null null null null null null null null null specif cluster oper transit schema target relat creat cluster method transit closur cluster oper gener except semant consist appli automat cluster method space gener match oper merg oper relat obtain previou cluster set merg strategi gener tupl kei gener obtain longest author author belong cluster format output relat merg oper schema similar differ defin wrt case defin wrt relat attribut relat case interest merg cluster singl tupl relat cluster id attribut assign statement evalu iter cluster input relat construct attribut valu tupl target relat specif notat introduc access attribut valu element identifi identifi attribut input relat attribut variabl rang attribut domain id express refer set tupl identifi belong cluster pg specif describ merg oper introduc intuit creat merg ca kei select kei author ca variabl rang id attribut express refer set author identifi cluster ca set pass function throw except author maximum length belong cluster except input tupl cluster ad relat exc merg oper throw explicit implicit except constraint view oper logic oper correspond sql queri augment integr check result interpret comput result sql select statement form set constraint evalu result constraint except gener specifi sql join aggreg inform result extract citat titl event inform free duplic creat view titl url public constraint null titl data lineag facil present function suppli user correct except methodolog effect interact execut clean program present algorithm increment execut clean program ensur consist integr interact modifi data data flow transform data lineag definit introduc definit tupl data lineag definit lineag logic oper op output relat oper input relat tupl tupl lineag op defin op maxim subset ft case tupl contribut op definit lineag tupl deriv tupl tupl lineag set fact contribut input relat oper relat consum extern function call cluster algorithm extern input relat consid data lineag proposit appli clean oper proposit op op data lineag mechan build proposit tupl identifi tupl op identifi permit obtain lineag output tupl extract map section schema output relat identifi input relat case merg proposit op input relat schema repres attribut respect merg oper partit suffici tupl output identifi partit gener identifi tupl valu merg oper section appli cluster attribut correspond id attribut techniqu work case set tupl input relat contribut output tupl summar compound identifi addit techniqu auxiliari view support tupl lineag suggest spj view mean tupl lineag oper support propag record identifi oper traceabl oper defin lineag trace queri return lineag output tupl oper proposit op spj input relat id output relat id id id id attribut uniqu identifi input proposit op merg input relat repres attribut respect merg output relat defin notion lineag tupl singl traceabl oper introduc definit lineag tupl sequenc traceabl traceabl data clean program definit adapt result oper attribut definit lineag traceabl data clean set tabl output tabl data clean program ident map tupl contribut program contribut op contribut program contribut lineag subset iff contribut lineag denot describ figur comput lineag relat traceabl clean program return result clean concaten lineag clean return figur algorithm data lineag tune data clean program execut data clean data lineag facil offer user inspect set except backtrack data flow graph discov except tupl modifi attribut valu insert delet tupl relat data flow graph order remedi except function permit tune data clean program describ method tune program sequenc step model diagram figur diagram repres data clean process correspond execut clean program execut node repres state data clean process arrow correspond transit label action perform event occur condit satisfi run action correspond execut data clean program execut process state transform execut situat except thrown execut data transform clean process halt reach final state except thrown transform execut trigger run action situat correspond occurr except execut clean program handl except tupl user inspect except regular output relat gener order discov tupl contribut except definit user obtain lineag except tupl lineag algorithm present figur user backtrack except tupl inspect except repres data inspect state user decid procedur correct except situat procedur consist refin logic oper wrongli rewrit incorrect code extern function refin properli separ author titl make view cluster add entri auxiliari dictionari incomplet refin conclud refin oper modifi oper data clean program input relat affect output refin oper run action data clean program constitut data transform oper procedur correct except tupl place except thrown execut clean refin action correct situat occur process data inspect state refin user interact data modif trigger user updat relat gener clean program order disambigu except situat autom decid correct titl equal size similar titl motiv user modif delet updat tupl tupl interact modifi definit tupl arbitrari output relat graph data transform clean program oper produc output relat run action detail data clean oper interact data modif perform increment mode addit methodolog inspect except obei principl order prevent user redund data analysi order user analyz correct except order determin graph transform model data clean program mean except oper regular output contribut output tupl oper analyz correct except tupl occur oper sequenc logic oper repres figur correct except thrown map implement extract correct except occur merg oper duplic elimin step clean program consid rest paper consid traceabl increment execut mode execut data clean program current state clean process figur initi state refin run action materi output oper clean program run materi requir execut oper potenti produc valu output tupl oper execut mode mode execut tupl interact delet updat user correspond data modifi state figur modifi tupl contribut output clean program definit appli oper constitut execut increment mode advantag run oper increment mode prevent useless comput input tupl ftg oper input relat undergo ftg ft defin condit oper satisfi execut increment mode logic oper execut increment mode addit properti input wrt union differ satisfi definit increment view mainten approach definit increment logic oper op execut increment mode wrt input satisfi input relat op tupl delet insert gener definit input straightforward gener kind final state data run run run data initi state inspect refin modifi transform execut figur methodolog clean data data lineag facil ple modif state tupl updat model delet attribut assign insert attribut assign tupl identifi consequ definit oper input relat run oper clean program output tupl lineag belong relat execut mode mean execut oper forc execut oper input affect output relat remark increment mode oper wrt extern input defin case map oper extract repres step figur invok extern function accept dictionari citi countri input dictionari entri map entir set input tupl present type oper increment execut execut mode cluster spj view support increment satisfi properti present definit result depend set input modif subset input relat potenti modifi output relat logic oper support execut increment mode remain spj view tupl id belong relat schema id attribut id id uniqu identifi tupl modifi tupl id oper output relat schema id id recal class cluster algorithm increment execut algorithm envisag object futur work satisfi proposit traceabl base increment oper determin output tupl tupl map oper iter input tupl produc tupl output relat singl tupl modif input increment execut delet insert remain output tupl increment execut match oper input relat input modifi tupl consist delet insert analog reason valid spj view merg oper tupl input relat increment execut merg consist step ft delet output relat ft recomput insert merg output relat figur intuit illustr increment execut merg oper assum user replac tupl belong input relat tupl data modif analyz behaviour oper execut increment mode conflict situat figur op op op op oper execut increment mode time output fulli materi output tupl op assum adequ oper output oper op gener except order correct user interact delet tupl increment execut op op merg merg figur execut increment mode merg remov output definit imagin inspect except tupl gener oper op user decid correct except tupl insert tupl output oper op increment execut op tupl invalid previou user action delet special handl provid avoid conflict situat spj put put match match match match match spj match put match match match match figur algorithm log interact tupl delet insert execut oper increment mode account previou user action appli output sketch user action tupl insert updat tupl updat correspond delet insert tupl explain delet insert user action output tupl delet oper op gener output relat oper memor tupl delet user recal inform user action delet tupl op input op automat recogn exist conflict output tupl insert result user op log user insert user action direct indirectli tupl possibl conflict notifi detail execut introduc auxiliari relat defin notion conflict oper execut increment account user modif appli input relat definit increment mode user insert relat schema relat op consist integr user tupl modif appli output tupl store relat tupl tupl schema conflict situat integr type user modif user modif appli input concern tupl user modif appli output conflict exist tupl mean tupl valu attribut attribut identifi mean increment execut op tupl output delet insert user describ compon execut algorithm increment mode oper op consist integr user modif appli output relat algorithm extens increment execut present definit algorithm permit record user insert delet output relat oper present figur tupl delet op op op op user user figur conflict situat output relat oper op insert relat case input addit output relat match store tupl input relat match tupl input relat introduc section oper output relat tupl modifi addit output relat record tupl user record tupl user insert match oper supplementari automat procedur updat relat match user modif execut algorithm oper op increment mode cope data modif input repres data modif appli output relat record present figur input modif result increment execut oper produc input relat op output modif correspond user action order correct except occur execut op algorithm manag conflict exist integr input output tupl modif simplest case oper accept singl input relat return simpl output relat updat output relat data execut oper op increment mode gener addit tabl except exc exist conflict user modif reflect oper tupl gener conflict ad except tabl input tabl output tabl id identifi except tabl exc schema addit except relat store user modifi tupl identifi input tabl gener conflict textual descript conflict insert exc exc exc exc exc conflict execut increment data modif appli previou oper gg figur algorithm increment execut proposit state valid proposit oper op execut increment input relat output relat clean program algorithm increment conflict detect order user appli data modif interact experi show except data clean applic report result appli methodolog clean section except data lineag except data lineag present exampl illustr mechan except data lineag facil lead refin clean criteria interact extract titl event section throw except separ element citat motiv make view extract exc view consid author extract criteria expect separ author list titl modifi explain section logic function call extract correct tupl return output extract view data merg oper present section function throw except distinct author cluster maximum length tupl written except output data flow exc tupl exc insert except relat gener oper user trace tupl back input tupl gener solicit lineag merg except tupl cluster output tupl gupta gupta tupl constitut lineag except tupl permit user discov interact system fail author user insert directli correct author author person user updat tupl longer consid candid match match oper expand similar interact requir merg titl titl motiv criteria merg automat titl length applic methodolog perform experi order valid mechan methodolog refin data clean program correct data handl automat set dirti bibliograph refer construct site million chose set train set refin criteria construct auxiliari run set assess approach appli methodolog section train set tune data clean program domain bibliograph refer run clean program run set obtain result present tabl kind result obtain sequenc diagram figur run data refin run data modifi run final state number except thrown type oper shown accuraci data transform phase shown term recal metric tabl number except accuraci data obtain phase extract merg set except classifi type data transform extract criteria extract author titl event strategi present extract citi citat normal transform appli extract event duplic elimin appli aim find standard event dictionari map signif keyword standard event keyword identifi standard event confer parallel distribut inform system standard event except thrown user correct refin dictionari write directli correct standard event refin merg oper refer duplic elimin author titl event merg except thrown author titl event automat determin cluster analysi remark normal solv refin merg requir interact clean data extract oper benefit partli refin extract function number extract except reduc partli user procedur column tabl repres inform retriev assess qualiti data transform run set citat manual clean refer call set correct citat recal fraction correct citat return automat clean program fraction citat return automat clean program correct result report confirm expect concern qualiti data obtain phase debug user accuraci obtain slightli improv refin code dictionari entri recal superior gain obtain user data correct present mechan except data lineag facil assist user tune data clean program experi set dirti conclud larg amount data level dirti data clean system tune sampl data paper report set dirti correspond methodolog commerci data clean project data domain bibliograph refer comput handl time increment code refin enrich auxiliari dictionari cumul refin profit project data domain sourc standard dictionari issu report clean suppli entri clean advantag data lineag facil mechan except bring assist user tune activ issu suggest futur work machin learn techniqu incorpor correct except duplic record train system automat modifi except tupl correct pattern limit factor full increment execut data clean program section cluster oper interest analyz class cluster method permit increment execut refer chaudhuri dayal overview data wareh olap technolog sigmod march stefano ceri jennif widom deriv product rule increment view mainten proc int conf larg cui jennif widom practic lineag trace data daniela denni eric cristian declar data algorithm technic daniela denni eric declar data algorithm septemb ashish singh subrahmanian maintain view increment proc acm sigmod conf data informatica informatica home page nec research institut research index evolutionari technolog intern home page hong hai data problem current approach ieee data engin septemb home page home page integr tool
DB/79 3 specif program rewrit logic manuel francisco steven patrick jose jose comput scienc laboratori sri intern march support darpa rome laboratori contract nasa contract offic naval research contract nation scienc foundat grant content introduct logic basi core full applic acknowledg core function modul overload set hierarchi oper evalu strategi rewrit logic system modul modul hierarchi predefin modul truth boolean machin integ quot identifi reflect reflect metalevel comput modul repres term repres modul descent function pretti sort function intern strategi game bubbl parser overview term modul term extend signatur modul gather default gather bubbl metalanguag loop metalanguag system issu debug command line option debug core specif content user facil implement miscellan differ trap problem full function system modul modul syntax modul transform modul system modul structur specif extens command modul program theori modul view modul express syntact restrict caveat semant membership equat logic function modul rewrit logic theori deduct model semant system modul refer list core command rewrit command match command trace command print option command show command debugg command miscellan command system command abbrevi synonym featur grammar core lexic issu signatur full standard librari predefin modul softwar architectur chapter introduct languag system support equat rewrit logic comput wide rang applic influenc import wai equat logic sublanguag essenti sublanguag main differ equat level greater richer equat membership equat logic extend equat logic kei novelti effici support equat comput algebra specif obj support rewrit logic comput rewrit logic logic concurr chang natur deal state highli nondeterminist concurr comput good properti flexibl gener semant framework give semant wide rang languag model concurr support concurr comput reflect design provid special syntax modul comput logic interpret rewrit logic side reason make good semant framework comput level make good logic framework logic metalog logic natur repres implement interest applic metalanguag creat execut environ theorem model comput rewrit logic research shown good sign includ intern workshop hundr research paper refer languag implement contribut broader collect effort build good languag implement rewrit logic kei distinguish featur systemat effici fact rewrit logic reflect featur make remark extens advanc metalanguag applic present paper document explain basic concept leisur inform illustr concept exampl earli languag design implement support present demonstr intern workshop rewrit logic septemb chapter introduct beta version march logic basi function modul theori membership equat logic horn logic atom sentenc equal membership assert form state term sort logic extend equat logic support polymorph overload definit partial function defin domain function modul assum execut engin rewrit techniqu oper semant develop membership equat logic rewrit logic rewrit theori pair membership equat collect label possibl condit rewrit rule involv term signatur system modul rewrit theori rewrit rule equat interpret local transit rule possibl concurr system interpret infer rule logic system make rewrit logic gener semant framework concurr system languag gener logic framework repres execut logic rewrit modulo equat axiom support rewrit modulo combin idempot axiom rule termin rewrit path choic strategi crucial execut rewrit theori strategi part languag intern strategi defin rewrit theori metalevel rewrit logic reflect theori repres finit present rewrit theori term term ht ti ht achiev arbitrari number level reflect effici support reflect tower make declar definit execut rewrit includ extens modul algebra modul oper defin execut logic extens reflect exploit design basic function core extend reflect full core support modul hierarchi consist function system modul modul full extens core written core support modul algebra modul express obj style modul conveni syntax applic chapter introduct core system built core accept modul hierarchi function system modul syntax implement consist rewrit engin front end rewrit engin highli modular code kei compon modul modul core modul class object specif equat connect sort compon modul abstract base class object equat term dag match automata equat theori deriv class modul combin left idempot implement associ idempot symbol special rewrit semant easili ad engin design provid feel interpret hook sourc level user interrupt handl goal prevent number optim implement transform user term rewrit pend evalu stack build reduc term actual implement term rewrit system compil system tabl interpret typic perform current version rewrit rewrit standard hardwar mhz pentium figur ac rewrit highli depend complex ac pattern match size ac subject result obtain fairli simpl linear nonlinear pattern larg nest ac subject front end consist base parser surfac grammar gener gener grammar part user pretti fulli function quot amount code hold class deriv rewrit engin parser implement formal kernel techniqu includ cfg cfg extend basi flexibl syntax effici treatment call syntact input extens core full languag syntax implement point top level extract grammar express modul function modul effici implement kei function theori term reifi element data type modul reifi term data type rewrit rewrit term oper equat attribut chapter introduct modul process reduc term normal form function modul rewrit term system modul default interpret reifi function process appli rule system modul subject term reifi function pretti print term kei sort reifi metalevel function full core extend richer languag extens modul algebra modul oper make modul highli reusabl basic idea extend data modul sort richer sort structur modul instanti modul flatten modul hierarchi singl modul system support obj style program highli gener reusabl modul type oper defin core explicit access modul term provid make modul algebra complet easili extens modul oper transform print function simpl modul provid addit develop core suitabl user interfac full full support core theori semant state formal requir view bind paramet theori modul express instanti modul applic applic typic equat program algebra specif conveni effici support sublanguag function modul paper argu equat membership equat effici offer good advantag logic framework wide rang algebra specif languag base total partial equat logic formal applic equat logic system modul support gener rewrit logic applic import area concurr distribut system specif prototyp support modul reflect make metalanguag applic reflect extrem valuabl applic rewrit logic logic semant framework sustain effort extens evid support claim rewrit logic flexibl simpl semant framework logic framework design chapter introduct architectur descript languag distribut compon natur semant rewrit logic section discuss reflect logic semant framework appendix applic softwar largest applic develop full line substanti applic induct theorem prover checker equat part formal environ languag languag interpret strategi cryptograph protocol network varieti execut translat map architectur descript languag model comput rewrit logic reflect framework develop author refer hope present encourag support applic acknowledg previou work joseph goguen member obj team influenc design import essenti function sublanguag timothi winkler valuabl contribut develop idea carolyn discuss valuabl suggest strategi aspect grate jouannaud adel collabor proof theori theorem prove techniqu membership equat peter moss detail comment paper kind advic html version ralph deserv special encourag develop idea initi stage present grate discuss exchang roberto claud alexand ulrik christian uri peter isabel martin colleagu chapter core introduc function system modul discuss modul hierarchi predefin modul machin quot reflect aspect relat topic intern rewrit strategi defin rewrit rule explain detail facil provid modul treat detail finish section discuss system issu debug function modul function modul defin data type function mean equat theori equat termin mathemat model data function provid initi algebra defin element consist class ground term modulo equat evalu express reduc form equat rewrit rule assign class uniqu canon repres concret initi algebra consist canon valu function express evalu algebra simplif equat obj languag function modul function theori paramet core explain section illustr modul import modul form modul hierarchi modul support full discuss section equat logic function modul base extens equat logic call membership equat logic discuss give detail semant function modul section suffic addit support overload function function modul support membership axiom gener sort constraint term assert sort condit consist conjunct equat uncondit membership test satisfi membership axiom defin partial chapter core defin argument satisfi equat membership condit oe figur automaton illustr support userdefin modul path form path graph graph figur graph describ automaton state node transit label edg behavior automaton path concaten transit target state transit sourc state transit random concaten edg legal string edg behavior automaton path modul axiomat automaton comput path mean path concaten length sourc target axiom membership equat logic path protect sort edg path node edg path op node op edg op op sourc target path node op length path var edg var path path path path eq chapter core path eq eq eq eq eq eq eq eq eq eq eq eq modul introduc function modul syntax path import predefin modul machin integ declar protect predefin modul section modul import modul hierarchi section sort relat modul introduc sort declar declar call type classifi data relat sort interpret mean data includ declar edg path declar edg set edg set path call gener path concaten oper build concaten path oper declar syntax op declar binari oper sort argument result userdefin syntact form oper case infix oper indic place argument side assoc state associ engin inform match equat membership axiom match concaten express oper associ user write express involv instanc oper perfectli accept unambigu express associ condit membership axiom path sort test condit explain rest modul straightforward node edg length standard prefix simpler choic syntact chapter core form equat defin semant oper equat introduc keyword condit variabl sort declar var declar equat left engin simplifi express canon evalu express oper declar keyword op syntact list sort argument oper sort result oper oper assoc attribut path equat axiom satisfi oper term syntact inform inform attribut declar singl pair squar bracket sort result end period syntact form oper string charact charact occur case length oper declar prefix form charact occur number coincid number sort declar argument oper oper indic place argument sort express form oper charact charact oper declar empti syntax declar path concaten oper empti syntax op path express section discuss syntax section gener discuss rule concaten achiev condit membership axiom path simultan declar oper ariti keyword op give nonempti list syntact form op node edg declar list edg node declar oper call constant string blank space consist identifi section detail syntact convent uncondit membership axiom introduc keyword mb modul nat natur number notat defin number multipl declar nat sort nat nat op op nat nat var mb chapter core state edg concaten path path target node edg coincid sourc node path effect defin path concaten partial function total path domain definit path concaten partial function path pair set path pair satisfi equat condit condit membership axiom path explicitli assert modul induct consequ axiom includ simpler membership axiom assert hold initi algebra function mathemat semant modul explain section induct properti prove induct theorem prover style membership axiom declar axiom chosen restrict membership axiom effici illustr distinct axiom explicitli modul induct consequ variabl righthand side equat lefthand side condit condit membership condit involv variabl membership side user equal predic sort predic gener boolean combin predic condit equat membership axiom section detail equal inequ discuss negat boolean combin equal membership predic horn termin assumpt specif note function length defin legal path return unevalu express error function error sort sort machin integ express inform error messag give singl equat form exp exp condit give boolean express exp condit give equat exp true note real loss gener restrict condit singl equat boolean express condit involv conjunct equat membership axiom form um sm singl equat um sm boolean express um sm chapter core system automat add error connect compon poset sort declar set maxim sort connect compon qualifi error error sort call kind theori membership algebra section connect compon order connect compon involv sort error ad note introduc user catch add error connect compon error kind point sort kind implicitli connect compon sort automat ad form system lift automat error oper involv sort connect compon form error express error express give express evalu benefit simplifi legal fulli simplifi error express return error messag illustr sampl evalu express form oper declar modul evalu reduc abbrevi form reduct process equat left rule membership axiom lower sort express express lowest sort simplifi anymor return lowest sort result red result red result red result red result red result red result overload explain syntact convent declar oper explain notion signatur overload kei understand syntax express function system modul chapter core core modul sort identifi path identifi identifi finit string ascii charact ffl white space sequenc def ffl charact break sequenc charact identifi sequenc count ffl charact escap charact blank space special charact break sequenc immedi special nonempti string end string begin string singl identifi pretti printer displai identifi form convent syntact form oper great flexibl syntax oper declar singl identifi automat prefix displai argument oper underscor charact underscor number sort case form prefix wai displai arithmet express oper declar identifi due presenc special blank oper declar op command command command natur languag style syntax program languag identifi declar singl binari underscor indic place argument notat associ oper singl identifi variant form defin oper singl op command command command variant version conveni oper requir extra pair part syntax oper program languag binari oper declar op command command command pretti printer displai oper form turn prefix mode set print command appendix chapter core oper declar op declar involv oper oper declar syntax oper begin end declar oper op command command command turn signatur graph sort declar function modul hold system relat order level algebra order interpret data data edg path declar arbitrari long chain individu set sort sort sort turn sort singl declar featur signatur function symbol declar signatur oper declar oper ariti modul number sort nat nat op nat op nat op nat op nat nat nat op op op var nat var eq eq eq eq eq eq eq declar natur number notat nonzero natur number predecessor addit declar integ modulo addit commut oper chapter core addit oper declar overload kind overload present signatur signatur overload oper relat addit natur number nonzero natur exact bigger oper restrict smaller oper call overload addit number hierarchi familiar present overload natur number addit special case section sort nat sort form connect compon order natur number addit addit semant unrel form overload call overload overload oper avoid ambigu express requir sort ariti oper syntact form connect sort connect compon rule overload constant declar constant element requir natur constant modul connect compon instanc cumbersom qualifi qualifi dot sort declar overload constant natur integ disambigu express note signatur term sort term number modul sort nat signatur call set sort assign term signatur element signatur function system modul assum note extend signatur user modul ad error connect compon ad addit overload oper ariti error famili overload oper origin signatur deal error term oper equal sort sort qualif oper ad section detail extend signatur set hierarchi function modul provid function defin set hierarchi finit set basic element machin integ comment mean oper equat includ text comment begin chapter core protect sort set set op mt set empti set op op set set constructor op set set set intersect op set set set differ op set bool op set set power set op augment set set set op set cardin var var var set equat constructor elimin duplic element eq eq set union eq mt eq set membership eq mt eq eq true fi set intersect eq mt mt eq mt fi eq set differ eq mt mt eq mt fi eq power set auxiliari function eq mt eq mt eq chapter core eq mt eq eq cardin eq mt eq eq fi finit set repres standard notat collect element call curli bracket appli constructor build set set set set entir hierarchi finit set mean oper symbol explain declar comment equat symbol notic oper element set set intersect declar associ commut assoc comm attribut engin perform multiset match rewrit associ order element matter find match engin rewrit modulo combin ident idempot oper specif effect rewrit class modulo axiom term rewrit term note equat axiom declar attribut oper written explicitli equat specif reason declar attribut declar equat explicitli time explicit affect mathemat semant initi algebra specif denot section drastic alter specif oper semant equat left simplif match equat modulo axiom declar attribut oper equat specif assum termin modulo axiom fail properti axiom ad ordinari equat commut equat set union eq make specif nontermin sampl reduct set express red result red chapter core result red result oper evalu strategi collect equat matter equat left simplif rule reach final result final result order evalu effici control equat appli mean strategi express evalu reduc form ffl obtain reduc form appli equat top call eager ffl evalu evalu top equat fi oper typic evalu evalu fi oper ffl evalu top term evalu subterm evalu kind lazi evalu strategi function languag lazi strict analysi ad user live languag adopt flexibl method evalu strategi ad improv approach ensur correct implement oper strategi list number end default eager strategi strategi explicitli declar fi lazi list constructor strategi syntax declar oper strategi op sn ik argument posit mention oper notion reduc express rel strategi coincid standard notion achiev termin reduc express rel strategi case equat nontermin standard factori equat fi nontermin standard termin strategi fi strategi comput infinit data structur evalu slight reformul find prime number lazi appendix chapter core protect sort op nil op nil strat op forc op op op op op prime var var eq eq show nil upto nil eq show upto nil show upto fi eq filter nil nil eq filter filter filter fi eq eq nil nil eq eq prime reduc show prime upto result paper document detail oper semant implement techniqu oper evalu strategi analyz carefulli number subtl anomali implement avoid specif rewrit theori system section formal term graph rewrit implement execut strategi oper evalu design restrict scope applic function modul section system rewrit gener notion strategi gener strategi provid reflect mean intern strategi strategi defin rewrit rule metalevel section scope applic oper evalu strategi restrict function modul equat part system modul chapter core rewrit logic system modul type rewrit typic function modul termin singl outcom step rewrit step replac equal equal find fulli evalu set rewrit rule infinit chain highli diverg rewrit cross rewrit essenti idea rewrit logic semant rewrit drastic chang fruit longer interpret term function state longer interpret rewrit rule local state state portion system state exhibit pattern portion system chang instanc local state chang place independ concurr nonoverlap local state rewrit happen modulo equat structur axiom state system satisfi top level distribut system state structur multiset regard system associ commut state constructor repres rewrit theori theori membership equat specifi state system abstract data set label set label rewrit rule axiomat local state transit system rule condit rewrit logic logic concurr state chang logic rule replac section infer complex concurr state system set rewrit rule describ elementari local natur realiz reactiv system system evolv highli nondeterminist wai path cross gener modul system modul initi model tr rewrit theori initi model transit system state class ground term modulo equat transit proof ff rewrit concurr comput system proof equat modulo natur notion proof correspond comput detail construct tr section system simpl concurr petri net petri net straightforward rewrit logic semant initi model rewrit theori illustr gener method give execut formal specif petri method natur extend algebra petri net petri net repres machin bui cake cake cost dollar appl quarter due unfortun machin accept return quarter user bui allevi part machin chang quarter dollar repres graphic machin convent chapter core chang pq pi place net denot pictur circl place token place slot unit kind disappear token place consum denot rectangular box label transit incom outgo arc indic token consum produc transit button machin transit consum token place incom arc produc token place outgo arc token consum produc arc exact number chang transit requir quarter produc dollar machin concurr provid token simultan push button simultan combin result place dollar quarter slot push chang button simultan dollar chang cake result distribut state collect token call mark natur regard multiset place regard state dollar quarter multiset mesegu montanari observ view petri net ordinari transit node multiset place net chang express petri net rewrit logic obviou view label arc petri net rewrit rule rewrit theori binari associ commut oper rewrit modulo multiset rewrit gather sort place view state element mark place endow multiset union oper empti syntax modul mod sort place mark place mark op mark mark mark op place rl chapter core rl rl rewrit system modul oper set assum union set axiom rewrit modulo support set termin equat modulo consist associ commut label set label set rule introduc keyword rl defin condit rule introduc crl keyword kei result petri net rewrit theori mark reachabl concurr net comput sequent provabl rewrit logic rewrit theori net net comput highli termin happen termin issu execut rewrit logic petri system modul subtl execut express function termin properti uniqu final result order equat appli simplif rule explain section reflect rewrit infer process control great flexibl mean strategi defin rewrit rule metalevel interpret default strategi execut express system modul default strategi appli rule fair provid rewrit keyword rewrit abbrevi assum equat system modul union set equat axiom declar attribut oper rewrit set termin equat modulo applic rewrit rule express simplifi canon form equat simplifi rule condit rule extra variabl righthand side occur lefthand side ident rule sequent calculu linear logic present form rl empti variabl sort constructor multiset proposit negat oper appli rule extra inform extra variabl rule extra variabl appli default rewrit command rewrit term default interpret execut oper modul section present version condit condit rule satisfi requir condit condit equat explain section includ requir variabl condit rule lefthand side futur version plan support gener involv extra variabl equal membership rewrit condit requir term rewrit term reduc term canon form equat appli potenti miss rule appli simplifi appli simplif properti ensur chapter core appli equat modulo rule appli simplifi express modulo axiom default strategi petri net equat simplif process rule applic case ident express command rewritten default strategi rule appli comput gener user maximum rule applic execut command give sampl execut petri net modul bound command result result result result result system modul nondeterminist machin integ nondeterminist choic mod protect sort op var var eq rl regard finit set integ nondeterminist integ sort integ set declar singleton set machin view nondeterminist integ nondetermin elimin union nondeterminist denot associ commut obei idempot equat nondeterminist choic provid choic rule note membership equat logic oper modul lift error give express miss rewrit call coher section coher assum hold system modul plai role analog plai properti function modul chapter core benefit doubt perform arithmet oper nondeterminist integ exemplifi execut result result result result note idempot equat appli appli choic rule note show equat logic semant choic absolut rewrit logic interpret choic instanc obviou absurd system modul introduc modul sort sort vector integ vector repres set pair compon pair vector posit number posit mod sort protect sort pair pair op pair op empti op comm var crl note automat import predefin bool modul modul function condit sort rule top level state fact element sort built associ commut oper state set pair integ sake pair input set pair input set vector requir chapter core explicitli declar give membership axiom present condit label modifi vector integ order put sort order system highli sort rule appli concurr coupl pair set repres vector complex concurr rewrit set pair correspond proof rewrit logic default interpret execut express system modul engin appli rule fair fashion sort vector result default interpret virtual control applic rule modul virtual control rule sort appli problem specif confluent gener control rule appli specif nontermin control strategi section explain rewrit infer process control highli nondeterminist rule game strategi correspond sort algorithm guid sort rule appli point comput concurr system system modul concurr system import subclass special syntact convent specif call objectori modul modul reduc ordinari system modul process strip syntact sugar modul support core support full extens written support modul modul express discuss detail section modul hierarchi specif code structur modul small size facilit understand larg reusabl local effect system support goal achiev full rich extens modul algebra program techniqu style core basic support modular definit modul acycl graph modul import hierarchi partial order theori theori import modul theori submodul recal rewrit theori theori membership equat logic explain section system modul rewrit theori initi semant chapter core note membership equat logic rewrit logic view function modul equat case rewrit rewrit fact initi algebra initi model coincid essenc view modul rewrit theori gener form modul provid includ nonempti list import modul finish period protect keyword restrict form make semant assert relationship initi model theori rewrit theori system theori theori view model model simpli disregard extra membership rule explain section rewrit theori respect initi model tr tr initi tr uniqu tr tr protect import assert sort function isomorph categori mean initi model add initi model submodul protect assert check runtim requir induct theorem prove proof techniqu induct theorem prover membership equat logic checker function natur expect techniqu tool extend similar rewrit theori includ assert make requir make requir proper import protect protect explicitli list modul defin list modul import includ mode give modul number hierarchi natur ration form appendix hierarchi linear order theori bool implicitli bottom partial order defin note import protect import includ core natur context modul renam oper semant modul modifi make copi modul import copi core support support full section renam ad core futur version model rewrit theori sort interpret function theori requir hs biject note expect condit requir due presenc error element kind isomorph condit enlarg error term prove equal detail discuss proof techniqu protect extens membership equat logic chapter core nat sort nat nat op op nat op nat op nat nat nat op nat nat nat op op nat nat bool op nat nat nat op quot nat nat op var nat var eq eq eq eq eq eq eq true eq eq eq eq eq int sort int protect nat nat int int op int int op op int int int op int int int op op quot int int op var int var var eq eq eq eq chapter core eq eq eq eq eq eq eq rat sort rat protect int int rat rat op rat rat op op rat rat op op rat rat rat op rat rat rat op var var rat var eq eq eq eq eq eq eq eq predefin modul standard librari predefin modul enter system begin predefin modul import modul defin user default predefin function modul bool automat import submodul import explicitli disabl discuss basic predefin modul standard syntax similar counterpart standard modul discuss section modul section entir standard librari predefin modul includ appendix chapter core truth boolean predefin modul involv truth bool basic definit sort bool op true bool op bool modul declar true kei thing note special attribut oper declar constant state constant treat standard treatment oper code state special attribut basic construct languag condit condit membership sort predic membership assert evalu truth valu oper predefin modul special oper omit detail hook special oper write full definit found appendix modul truth add number import oper truth protect op bool op bool special op bool special prec attribut oper oper section oper equal inequ predic oper special number wai automat ad modul consid normal oper overload connect compon modul normal understood polymorph sort concret effect instanti oper connect compon oper semant counterpart fi fail rewrit evalu argument equal inequ predic evalu reduc ground term normal form compar result modulo equat axiom attribut oper modul note equal inequ predic modul truth add connect compon modul chapter core effici principl defin cumbersom ineffici user assum equat membership axiom user modul termin modulo axiom oper initi algebra comput algebra data equal inequ comput function tucker equal inequ predic defin termin equat user give explicit equat definit equal provid note inequ predic membership involv real introduct negat underli membership equat remain horn logic ad function provid conveni defin negat modul bool import truth add usual implic oper oper defin bool protect truth op bool bool bool comm prec op bool bool bool comm prec op xor bool bool bool comm prec op bool bool op impli bool bool bool prec var bool eq true eq eq eq xor eq xor eq xor xor eq xor true eq xor xor eq impli xor bool modul includ submodul modul defin user accomplish command set includ bool mention modul case set standard librari enter default disabl user polymorph equal fi oper automat ad exclud usual boolean connect truth write chapter core set includ bool set includ truth modul involv truth valu ident modul includ default modul import explicitli import add connect compon polymorph oper syntact equal inequ ground term compar syntact equat axiom attribut oper perform reduct term equat modul note modul requir explicit definit user level equal function modul semant equal explicitli defin oper entir signatur modul duplic disjoint equat equat axiom oper attribut syntact oper reduc standard semant equal inequ oper disjoint copi signatur ident op bool strat special op bool strat special machin integ machin integ defin constant modul repres data type element sort nonzero machin integ oper declar illustr link integ constant sort oper declar modul repres counterpart mean comment remaind oper produc error term argument machin integ provid fast arithmet data type gener program metalevel hook rewrit engin sort op op op special minu op special minu op special complement op gather special addit op chapter core gather special differ op gather special multipl op gather special multipl op gather special op gather special remaind op gather special op gather special op gather special op gather special xor op gather special left shift op gather special shift op bool special op bool special equal op bool special greater op bool special greater equal quot identifi quot identifi protect sort op op conc op index op strip typic constant sort quot identifi quot identifi quot identifi legal identifi satisfi convent identifi explain section begin quot charact syntax declar modul includ avoid quot constant sort point modul quot identifi modul gener creat massiv ambigu chapter core quot identifi defin oper declar oper conc concaten quot omit quot oper index append result machin integ express end quot identifi oper strip strip charact quot semant infer ab quot data type list quot identifi remain predefin modul standard discuss section import modul protect sort op nil op reflect reflect logic logic import aspect repres object level consist correctli simul relev aspect reflect logic logic faithfulli interpret languag design implement make systemat fact rewrit logic reflect make rewrit logic access user clear principl naiv implement reflect time memori good implement provid effici wai perform reflect comput section explain achiev predefin modul discuss semant metalevel effici dramat conserv extend theori metalevel theori descent function rule lower deduct higher level reflect effici deduct lower level explain term modul semant principl support import special case modul import topic intern strategi reflect essenti discuss section reflect make advanc applic import applic full discuss make essenti reflect provid rich extens modul special instanc gener class applic chapter core metalanguag reifi languag logic rewrit logic section paper refer number import includ rewrit logic logic framework develop theorem prove tool reflect metalevel comput rewrit logic reflect mathemat finit present rewrit theori repres finit present rewrit theori term term term pair term ti achiev arbitrari number level ti hu hu ii chain rewrit comput place level level naiv step reflect tower comput simul singl step rewrit level involv rewrit step level import systemat wai lower level reflect comput rewrit higher level tower strictli achiev systemat descent rewrit comput lower kei idea exploit detail proof case uncondit unsort theori extens case interest condit rewrit theori membership equat logic underli equat essenti assum theori gener class finit present rewrit theori signatur sort respect element term modul kind repres rewrit kind assum defin boolean predic modul kind term bool true kind exploit introduc notion descent function metalevel rewrit theori term rewrit term strategi return result term function simpli express term gener sequenti interpret function rewrit logic partial function finit present rewrit theori term determinist strategi case termin return term rewritten membership equat logic term sort kind kind repres error ad system top connect compon sort defin user chapter core error messag term function undefin case strategi termin finit present rewrit theori term admiss determinist strategi interpret function satisfi correct requir point detail axiomat effect interpret function mean gener finitari equat theori signatur assum extend theori equat obtain extend rewrit theori descent function function modul term paramet term determinist strategi express singl free variabl sort paramet satisfi equal descent function easili defin definit extens theori note ad rewrit rule descent function exploit ad descent rule xi yi true true modul kind paramet exploit effici reason sequenti interpret function instanti effici deduct perform deduct denot rewrit theori form addit descent function descent rule call metalevel theori addit descent rule ad rewrit albeit descent rule ti ti note appli descent descend level reflect tower assum includ descent function ensur conserv assum equat disturb equal term rewrit relat equat assum conserv equal easili achiev assum top lefthand side equat function symbol preserv rewrit relat achiev forbid overlap lefthand side equat chapter core arbitrari rewrit theori term comput effici carri object level kind combin descent section view descent function basic fundament build block defin intern strategi languag combin complex strategi level reflect perform effici sophist metalevel comput section modul kei function metalevel theori descent function effici implement function modul interpret function interpret function theori effici reason summar kei function provid recal function modul equat theori assum termin modulo axiom match algorithm system modul rewrit theori equat part satisfi requir function equat rule assum weakli coher modulo axiom section ffl term reifi element data type term ffl modul reifi term data type modul ffl process reduc term normal form function modul find normal form sort reifi descent function ffl process appli rule system modul subject term reifi descent function ffl process rewrit term system modul default interpret reifi descent function ffl pretti print term kei sort oper compar sort order reifi metalevel function import modul quot standard librari predefin turn modul bool introduc syntax repres explain modul final discuss descent sort function chapter core repres term term reifi element data type term signatur term term op term op term op op term term op term term op term make repres variabl quot identifi variabl repres oper repres constant essenti argument quot argument sort quot form constant modul nat section repres oper correspond construct term argument top oper quot argument list list concaten denot term sort nat modul nat term modul term mention discuss term iter term nat term term involv oper proce term applic equal predic term repres term membership predic unari sort binari predic argument vari natur uniform mean binari constructor argument sort quot identifi membership predic nat repres term nat binari constructor membership predic evalu term question syntact declar modul signatur membership axiom decid sort term smaller equal sort declar data type term constant error element chapter core repres modul function system modul syntax similar origin user syntax main differ term membership rule modul follow fix order introduc kind declar user syntax flexibl introduc declar interleav set declar repres set quot identifi built associ commut oper motiv gener syntax repres illustr simpl modul nat natur number successor commut addit multipl oper nat sort nat nat op op nat nat op nat nat nat op nat nat nat var nat eq eq eq eq syntax oper repres function system modul sort modul modul op op ruleset modul nat nat term nat nil sort nat nat op nil op nat nat op nat nat nat op nat nat nat var nat var nat chapter core eq eq eq eq sort nat list import submodul membership field fill constant nil sort sort successor oper empti set attribut full definit appendix part syntax function system modul list extend natur fragment illustr comparison core mirror close note repres set attribut oper sort attr attribut equat axiom rewrit syntact attribut attribut link oper function section sort modul import sort attr term equat rule ruleset hook modul import sort attr equat rule ruleset hook op op comm op nil op op nil op op includ import op sort chapter core op op op comm op op op comm op op comm op assoc comm attr op id term attr op strat attr op prec attr op gather attr op special attr op op hook op hook op term hook op op op comm op term op term term term op op comm op term term equat op term term term term equat op op comm op term term rule op term term term term rule op ruleset op ruleset ruleset ruleset comm note case sort modul yield term sort iter arbitrari number time fact metalevel comput oper higher level good induct theorem prover modul term infer rule term sort term strategi control applic induct chapter core infer rule illustr modul simpl modul truth valu sort truth op truth term sort term descent function descent provid effici wai reduc metalevel comput oper argument modul term membership predic lazi membership predic modul syntax op modul term term argument term function return fulli reduc form term equat red result note order simplifi present id term id modul explain section full command denot notat core explicitli written red nat nil sort nat nat op nil chapter core op nat nat op nat nat nat op nat nat nat var nat var nat eq eq eq eq result cumbersom big illustr exampl section easi solut defin modul import introduc constant sort modul modul constant give equat identifi constant modul argument membership predic lazi membership predic term fulli reduc equat sort reduc term comput sort term signatur membership axiom modul boolean predic return interpret function rewrit term normal form equat oper evalu strategi section declar oper signatur default oper strategi declar interpret strategi function coincid red command oper syntax op modul term term analog equat part modul equat rule rewrit term default strategi argument modul term argument posit machin integ result term obtain applic rule strategi default appli rule fashion bound number rewrit proce end paradigmat descent interpret strategi rewrit command rewrit oper chapter core op modul term substitut argument modul term label rule set assign defin partial substitut oe variabl rule argument natur number return pair sort consist term substitut syntax substitut result sort assign substitut assign substitut op term assign op substitut op substitut substitut substitut comm op term substitut oper evalu term fulli reduc equat result term match rule label partial instanti match fail satisfi condit rule success match rule appli match step term result appli rule match fulli reduc equat pair form constructor element result fulli reduc term element match reduct return interpret strategi command interpret strategi intern interpret attempt rewrit top explain pretti sort function descent function function natur belong theori axiomat theori effici reason provid function function pretti print term modul perform effici number oper sort declar modul signatur function syntax op modul term chapter core argument modul list token list quot identifi return term list token signatur assum unambigu term error constant return modul nat present section input red result function syntax op modul term argument modul term return list quot identifi encod string token produc pretti print syntax event error empti list return modul nat present section red result pretti print term involv naiv syntax oper gather inform section rel posit underscor oper parent term consid determin insert subterm avoid ambigu overload addit check determin sort disambigu syntax oper sort includ provid commonli function poset sort modul metalevel syntax sort op modul term sort op modul sort sort bool op modul sort sort bool op modul sort op modul sort sort user modul repres quot term sort modul sort sort defin sort defin ad system complet connect sort sort syntax error set maxim sort connect compon op sort function argument modul term comput sort term modul function return error sort defin user comput sort term previou modul nat chapter core red result nat modul relat sort set sort boolean function true note sort pass function sort sort red result modul relat sort set sort boolean function true belong connect compon order note sort pass function sort sort red result note sort explicitli present signatur present extend explain section modul sort function metalevel return set sort strictli smaller red result note case return sort sort gener return set sort error sort sort fact quot function return function sort modul input comput set maxim lower bound sort note asymmetri declar sort sort sort sort asymmetri elimin futur version system comput greatest lower bound sort nat modul nat present red result gener return set sort intern strategi system modul rewrit theori termin good wai control rewrit infer principl undesir mean adequ strategi reflect set maxim lower bound sort singleton greatest lower bound notat subsequ speak lower fact gener notion set maxim lower bound chapter core strategi made intern system defin rewrit rule normal modul reason rule modul great freedom defin strategi languag insid complet user limit fix close strategi languag idea oper basic strategi extend modul addit strategi express semant rule follow methodolog defin prove correct intern strategi languag reflect logic introduc illustr reconsid modul sort sort vector integ introduc section modul run explain applic rule control mention strategi languag defin extens modul introduc modul strategi introduc basic modul equat discuss illustr exampl rest section strategi protect sort bind strategi term op op bind term bind op op bind op modul term strategi op set term strategi op strategi op idl strategi op failur op strategi strategi strategi op appli strategi op substitut strategi op iter strategi strategi op term strategi strategi op strategi strategi strategi op term op substitut op updat bind op modul substitut substitut op chapter core op sort modul var modul var var term var tl var sb substitut var bind var bl bl var mv mv var st st strategi eq sort sort includ sort pair pair op pair op empti nil op comm var var var var crl explain strategi defin strategi languag introduc note default strategi interpret system modul easili call function introduc section result argument explain section bound number rewrit argument intermedi stop point nontermin rewrit result term applic rule rule chapter core result modul strategi function comput strategi express argument modul term fourth argument strategi argument store inform relev definit comput strategi express rewritten control applic rule inform store argument strategi rewritten remain strategi comput case idl strategi strategi express failur return request strategi carri basic strategi express applic rule top term top oper attribut axiom associ associ match modulo match found constraint match substitut basic introduc signatur constructor argument identifi rule label defin oper eq failur fi oper selector extract pair construct eq sb eq comput express result chapter core inform relev comput strategi express record list bind valu valu sort term metavari introduc user constant sort sort declar sort express term comput strategi set updat record inform function updat notic term bound metavari fulli reduc oper term set metavari substitut term bound list bind present updat function recal default oper semant function function eager bottom eq eq eq mv mv fi eq eq ffg eq eq eq mv mv fi eq constant sort rewritten modul readabl rewrit exampl section chapter core comput express result comput strategi appli rule partial instanti set assign top term top oper attribut axiom associ associ match modulo success match consist partial substitut term assign variabl metavari substitut term bound current list bind function eq failur fi eq eq interest strategi defin concaten basic iter strategi strategi branch establish condit comput repres extend basic strategi languag constructor equat strategi iter defin eq failur failur chapter core fi eq failur fi eq failur fi function defin equat eq forc comput sequenc strategi proce strategi consid previou fulli comput illustr comput strategi result result chapter core result strategi make comput strategi condit satisfact condit condit term sort bool condit metavari substitut term bound current list bind notic definit constructor make iter comput strategi argument depend satisfact condit repres argument eq failur fi extend basic strategi languag algorithm insert sort strategi sort vector integ length main loop insert sort element vector integ insert place predecessor vector introduc metavari op insert strategi op var eq chapter core strategi insert sort vector integ length result game illustr great flexibl defin strategi control process execut discuss system modul version game player bag bag remov pebbl bag limit number pebbl remov repres state game pair repres draw bag limit bag player turn make move game move player draw nonempti set pebbl limit bag limit bag readjust number pebbl doubl player left draw bag game continu bag state move axiomat rule mv player empti draw bag win chapter core mod protect sort pebbl bag state pebbl bag op pebbl op bag op bag bag bag op bag bag state op size bag op readjust bag bag bag var bag eq eq eq fi crl initi model modul transit system game move game bad move player win good player avoid bad move win strategi move made player lead matter move player attempt great freedom defin strategi languag insid user decid adopt strategi languag good languag remain fulli featur strategi defin top defin win strategi game extens modul strategi protect strategi op strategi op term term term op term op modul var term chapter core var modul eq includ bool includ sort pebbl bag state pebbl bag op nil pebbl op nil bag op bag op state op size bag op readjust bag var bag var bag var bag eq eq eq eq failur fi eq chapter core fi state strategi find win move equal move eventu lead matter move player assum move player make win move win strategi strategi call function bag pebbl argument argument tent move tent bag valid number pebbl smaller number pebbl limit tent make case state game win move make win move call tent number pebbl remov size tent bag greater size limit win move failur return make win move state draw bag pebbl limit bag pebbl strategi result state game win move made strategi return failur result failur strategi extens modul strategi modul rule termin equat declar oper sake assum rule label chapter core protect strategi sort posit posit op posit op po posit posit posit op posit op term posit term op posit term op replac term term posit term op term posit term op term posit posit op term posit posit var posit var var var term var tl tl eq defin auxiliari function find posit term posit repres metalevel natur empti posit denot posit modul function return term tj valid posit return eq eq eq eq eq eq eq fi eq fi function return posit tree defin term strategi posit function return eq fi chapter core eq eq fi eq fi function return term eq eq eq eq eq eq eq eq fi eq fi eq fi eq fi introduc strategi metainterpret specifi interpret function modul valid modul talk interpret function modul reduc term canon form termin equat interpret function oper repres system modul equat repres rule label chapter core term return canon form respect op metainterpret strategi op posit strategi var modul eq auxiliari strategi specifi interpret appli rule term posit posit tree defin eq failur fi modul mod sort nat tree nat tree op nat op nat nat op nat nat nat var nat rl rl rl op tree tree tree op rev tree tree chapter core var tree rl rl modul tree repres term extend modulo equat op modul eq includ bool sort nat tree op nil nat op nat nat op nat op tree op rev tree tree var nat var nat var tree var tree rl rl rl rl rl result comput strategi metainterpret oper tree chapter core result result tree origin tree leav evalu bubbl section explain function section present gener overview design parser section explain term syntax modul illustr basic function parser exampl conveni express signatur modul extend boolean polymorph sort test section explain extend signatur modul term section concentr strategi specif model pattern modul syntax gener grammar gener resolv ambigu mean definit user control syntact order evalu oper remov ambigu unnecessari syntax section describ rule assign default valu gather pattern section explain call linguist possibl term extract grammar portion syntax modul languag userdefin obtain grammar express support mean facil parser overview comput point semant logic framework provid rewrit logic complement reflect syntact framework reflect effect semant definit wide rang logic languag core full modul rewrit logic act metalanguag chapter core characterist metalanguag reflect logic semant framework pose strong requir design algorithm fulfil constraint ffl interpret languag ffl full grammar model ffl pattern modifi grammat power nontermin symbol ffl grammar extend incorpor bubbl bubbl kei notion implement syntact reflect bubbl sort userdefin ffl techniqu error detect error recoveri support ffl effici main parser surfac rest comput logic kernel current version parser base algorithm parser unrestrict grammar algorithm point prove sound complet comput avoid eleg effici manipul wide set cfg tree level relat partial deriv adjac predict basic obtain high level effici diminish gener algorithm logic prove sound complet version gener grammat term signatur avoid complet problem detect parser analyz cfg extend bubbl algorithm incorpor sophist error detect error recoveri mechan base notion partial deriv origin develop architectur algorithm effici treatment syntact reflect reflect power parser support function modul flexibl natur syntax definit model section detail descript algorithm found notion intern strategi tree formal kernel algorithm found techniqu comput layer effici technic report describ version parser term modul illustr notion term idea term signatur modul mean modul support chapter core natur number arithmet binari notat modul includ usual arithmet oper exponenti natur number binari notat ffl constant constructor sort bit ffl oper repres element sort bit sequenc ffl oper obtain length binari number ffl oper compress binari number suppress left ffl boolean predic ffl perform logic negat string bit protect sort bit bit bit bit op bit op bit bit bit op bit op bit bit op normal bit bit op bit bit bit op bit bit bit op bit bit bool op bool bit bit bit var bit var bit var bool length eq eq eq eq eq normal suppress left binari number eq eq greater eq eq true eq chapter core eq eq eq true eq true fi fi binari addit eq eq eq eq eq eq binari multipl eq eq eq binari exponenti eq eq eq oper eq fi note sort bool sort proper sort signatur inform polymorph belong extend signatur gener automat modul section modul illustr import aspect grammat power ffl empti declar write natur number binari notat sort bit bit bit bit op bit op nil bit op bit bit bit chapter core ffl length oper syntax specif oper red result ffl prefix includ defin prefix syntax red result red result ffl infix oper illustr model specif infix oper red result red result red result true ffl oper notat oper combin infix notat red result previou discuss notat power good basi discuss process term context signatur process divid phase collect inform pertin problem includ set oper special attent notat pattern variabl inform translat grammar time detect term algorithm obtain grammat structur term grammar obtain modul term extend signatur modul reduc term red result chapter core red result true red result red result logic oper sort qualif oper proper part modul structur belong extend signatur modul process grammar gener signatur add automat inform strictli signatur user main structur ad extend signatur modul ffl sort sort signatur gener oper op disambigu overload constant term modul presenc machin constant oper ad hoc overload section term ambigu elimin ambigu sort disambigu qualifi ambigu term sort red result red result red result ffl sort signatur extend signatur modul oper op oper declar oper sort red result ffl prefix form oper simpl identifi oper declar singl identifi prefix form chapter core red result true red result ffl flatten associ argument oper attribut assoc form red result associ oper prefix arbitrarili argument red result ffl polymorph oper bool inform predefin modul truth bool section includ extend signatur modul instanc polymorph oper truth gener sort modul sort sort predic ad note extens signatur specif equat op bool bit bit bit var bool eq true fi fi ffl extend signatur includ error overload lift oper support error term gather rich set notat model specif illustr idea extend signatur modul oper modul complex subtl ambigu unintuit shown exampl concept gather provid flexibl avoid ambigu write unnecessari chapter core ffl reduct red result expect result reason unexpect result process term gener ffl show problemat interact oper expect result term result red result ffl expect term reduc yield result term form appli oper unexpect yield possibl result red result red result ffl term unambigu strictli signatur result result detect select randomli lead unexpect result complex term red line ambigu arbitrarili correct result point word treatment ambigu parser obtain term number ambigu present show user solv problem express fact chapter core red line ambigu arbitrarili correct result ffl exampl illustr problem consequ undefin model oper appli automat algorithm default valu gather pattern assign rule present section addit sourc case relat notion syntact order evalu oper infix oper determin order oper appli oper ffi ffi ffi ffi mean express ffi ffi evalu ffi ffi oper higher oper reason expect express oper consecut time associ red result syntact order evalu order oper contigu modifi result express oper consecut fact grammat red line ambigu arbitrarili correct result syntact order evalu syntact semant notion order evalu argument oper strategi explain section chapter core distinguish type oper point view syntact order left oper group analyz left case arithmet oper oper group analyz left make exponenti oper associ associ associ oper yield syntact order evalu concern oper grammat ambigu extend signatur modul incorpor rule solv ambigu infix oper sourc ambigu solv defin order evalu syntact problem syntact order evalu solv mean gather pattern oper gather pattern user mean gather attribut assign default valu explain section integ greater equal understood output term oper top symbol gather pattern argument oper gather pattern nonempti sequenc ffl argument equal lower oper ffl argument strictli lower oper ffl oper argument illustr notion gather variant modul differ valu gather pattern oper op bit bit bit prec gather op bit length op bit bit gather op normal bit bit op bit bit bit comm prec gather op bit bit bit comm prec gather op bit bit bit gather op bit bit bool gather op bool bit bit bit gather chapter core constant rule appli nil oper term gener oper term term term illustr behavior gather focu declar oper infer ffl term oper top symbol attribut prec ffl argument binari multipl gather term smaller equal argument binari multipl term constant exponenti multipl addit ffl argument binari multipl gather strictli lower argument binari multipl rang mean express top oper multipl argument express top symbol multipl elegantli solv problem order evalu oper simultan gather attribut kind relat oper type syntact order evalu show practic strategi analyz problem detect signatur problem term inform valu gather ambigu solv valu oper modul oper defin op bit bit bit nil prec gather op bit bit bit comm prec gather previou term ffl top symbol term argument addit definit oper term argument addit gather pattern constrain argument smaller oper argument rang condit fulfil argument analysi correct parser figur show chapter core pq figur correct tree qs bn xz error figur incorrect tree graphic situat constant function symbol term maximum gather argument arrow ffl term sequenc main top oper term argument oper term argument subterm argument addit argument constant addit argument oper express valid situat shown figur error argument higher gather pattern argument oper declar resolv ambigu worth note oper automat includ extend signatur modul term grammat correct red result red result subtl problem modul behavior term oper attribut explicitli assoc gather pattern gener default oper left chapter core hj xz figur correct interpret oper gather pattern op bit bit bit comm prec gather op bit bit bit comm prec gather op bit bit bit gather main consequ definit addit argument multipl reduct red result red result exampl illustr gather model oper solv problem order evalu oper ffl term oper involv op bit bit bit comm prec gather op bit bit bit comm prec gather account express evalu addit number multipl red result figur show correct interpret term signatur figur repres incorrect interpret error avoid interpret ffl illustr definit associ oper mean exponenti oper modul left associ analog chapter core hj xz error figur incorrect interpret hj figur correct interpret op bit bit bit gather modifi order evalu term evalu left gather pattern oper figur draw graphic correct incorrect interpret term red result red result hj xz error figur incorrect interpret chapter core default gather section sketch rule gener default valu gather pattern similar valu oper user inform part oper declar rule assign default valu ffl prefix oper user set rule oper normal modul ffl oper oper ffl unari oper modul rule appli oper ffl oper ariti greater rule appli oper rule gener default gather pattern ffl argument prefix oper gather pattern user specif ffl oper gather pattern default argument except rule except mutual overrul except except gather pattern argument argument posit underscor oper leftmost token oper ii rightmost token oper iii adjac underscor oper except gather pattern uniqu argument oper argument oper except oper gather pattern start underscor ii end underscor iii suppli greater iv assoc attribut condit fulfil oper modul except oper start underscor ii end underscor iii suppli greater chapter core iv argument sort connect assoc attribut argument gather pattern chang relat associ argument gather pattern chang relat left associ except oper modul list includ sort list list op list list gener gather pattern gather except appli argument except chang gather pattern gather except prevail except appli real gather pattern oper gather illustr show default gather pattern gener modul present section op bit op bit op nil bit op bit bit bit nil prec gather op bit gather op normal bit bit op bit bit bit comm prec gather op bit bit bit comm prec gather op bit bit bit gather op bit bit bool gather op bool bit bit bit gather op bit bit gather bubbl order gener environ languag includ case languag thing defin syntax extend modul data type auxiliari data type command construct great chapter core flexibl bubbl nonempti string intuit bubbl correspond piec modul languag grammar introduc signatur modul idea languag modul case natur syntax combin call top level syntax syntax introduc modul data type bubbl reflect dualiti level syntax definit similar idea exploit illustr defin syntax sort op op eq notic string charact insid box part top level syntax grammar signatur modul syntax modul combin level syntax term grammar signatur definit syntax reflect dualiti syntax level talk bubbl gener kind bubbl defin type bubbl data type definit bubbl length call defin sort token op token token bubbl defin bubbl sort special attribut bubbl make sort token bubbl sort argument special attribut minimum maximum length bubbl string identifi token bubbl size bubbl length pair valu oper declar case oper bubbl constructor repres token term quot form token repres defin bubbl nonempti sequenc declar current version bubbl modul pass function argument defin bubbl chang futur chapter core sort bubbl op bubbl bubbl bubbl system repres bubbl list quot identifi constructor bubbl bubbl ab cd ef repres cd type bubbl defin special attribut paramet list identifi exclud bubbl defin identifi declar modul declar syntax oper declar modul op token token decl op token bubbl token decl bubbl bigger expect op op special attribut exclud avoid situat declar sort constructor list length greater exclud identifi declar sort op bubbl exclud readi give signatur modul modul definit sort bubbl defin syntax sublanguag function declar variabl oper attribut support oper includ sort bubbl token decl exclud identifi syntax exclud chapter core decl op token token bubbl op bubbl bubbl bubbl op bubbl exclud sort declar op sort token decl oper declar op token token decl op token token decl variabl declar op token token decl equat declar op bubbl bubbl decl function modul op token op notic explicitli declar oper correspond top level syntax repres term sort bubbl piec term syntax function modul term sort sort reflect fact term sort repres modul term sort repres modul bubbl correctli term modul syntax call function modul previou modul transform list point section core modul explicitli full refer modul techniqu explain section chapter core quot identifi red sort op op eq result result eq return box system return bubbl constructor form declar bubbl return result result result sort term convert term term sort straightforward extract term modul signatur defin function op term notic partial function defin sort term term sort result gener element error signatur function modul equat membership build term sort section input list quot identifi automat loop support modul chapter core defin function replac bubbl equat result call extract signatur quot identifi form bubbl op term partial function term term term sort function succe bubbl equat return term sort op term eq reduct red sort op op eq result nil sort op nil op eq metalanguag gener facil provid modul shown extend modul gener loop mod protect sort state system op state system oper persist object input channel output channel state chapter core loop simpl mechan develop maintain futur version plan endow gener support make gener flexibl solut deal persist object input output term sort system give possibl maintain persist state compon state declar complet gener sort state constructor complet flexibl defin term repres persist state loop applic facil extens full object languag implement complet languag tool natur state system complet tailor state sort applic import modul defin structur state rewrit rule chang state interact loop loop illustr basic idea toi system loop echo input case maintain declar constant null repres empti state mod duplic includ op null state var input output crl output input input nil modul initi loop set initi state loop command give loop command term sort state desir initi state start loop empti input output channel type loop current input channel support current distinguish input pass loop input written prompt convert list quot identifi break input stream sequenc sequenc convert token quot identifi put quot front append result list quot slot loop object output handl list quot identifi slot loop print termin appli process chapter core token list output channel clear time output clear input enter input output event implicit rewrit slightli quot input output data loop object object loop initi input data write prompt write output interest loop echo ten input number token store state ten case input introduc store persist albeit simpl repres state pair consist list quot token counter measur length list mod includ protect op state op init system var input output var qi var counter rl init nil rl counter qi counter rl counter counter output loop init chapter core state loop continu command cont result note data output channel remain remov time input event metalanguag exampl toi exampl illustr basic featur interest applic modul metalanguag defin pretti print execut result object languag tool hard work handl maintain persist state object languag interpret tool metalanguag natur consequ good properti rewrit logic logic semant framework kei goal rewrit logic begin provid semant framework model concurr distribut languag natur repres dualiti logic comput rewrit logic reason make rewrit logic suitabl semant make attract logic framework repres logic common logic semant framework applic model languag repres rewrit logic map form typic simpl natur map theori modul rewrit theori languag prototyp obviou question rewrit logic languag support map form metalanguag wide varieti design comput logic system semant implement answer reflect explain section languag design implement make systemat fact rewrit logic reflect provid effici support reflect comput mean modul make map execut result rewrit theori repres theori modul implement reifi map form defin abstract data type repres modul logic languag data type modul term repres rewrit intern map defin function gener tucker comput map finit number termin equat chapter core map defin execut rewrit theori theori modul linear logic structur modul full wide rang languag logic method defin data type extens defin syntax provid satisfactori execut environ support persist state interact interpret defin enter modul execut result execut make environ typic realiz modul submodul illustr conjunct metalanguag discuss detail make implement full complet specif found full state system singl object class object attribut actual modul enter attribut identifi current modul attribut input output simplifi commun loop notat class modul section declar class class db input output default assum object class object sort object belong admiss state persist state full give declar object state give rule initi commun depend kind input state chang output gener give rule declar start declar constant sort oid identifi persist constant init initi loop op oid op init system rule initi loop constant initi rl init note modul system modul core declar directli declar desir modul possibl librari predefin modul predefin configur chapter core db input output default initi loop write loop init text introduc argument oper fact activ enter input modul command user constant grammar modul signatur defin top level syntax full appendix grammar function input case syntact valid input input attribut error messag output channel loop crl db input output default mi db input output incorrect input default mi db input output default mi fi nil output attribut persist object nonempti list quot rule move argument loop core system displai termin crl db input output default mi db input output default mi chapter core nil rewrit rule defin system behavior languag command specif detail languag question illustr case full full function argument result call empti modul kind modul constant rule current return modifi copi process modul case constructor function modul modul grammar op token process function enter system rule rl db input output default mi db input output default note messag output chang current modul modul process modul modul extra perform auxiliari function command handl rule show modul print current modul handl rule rl db input output default mi db input output default mi rl db input output default mi db input output chapter core default mi function modul introduc user flatten version store system issu debug command line option interpret start command execut call linux file directori execut file read interpret read standard input understood flag start interpret prefix mode intend post processor attempt read start handl debug core specif approach debug core specif gener techniqu turn trace command set trace captur log trace script log studi text editor trace number trace option control trace select set trace select trace select foo bar rewrit head oper select trace note oper exist time trace select command select oper creat runtim metalevel approach core debugg reduct happen interrupt debugg automat enter prompt debug number time debugg fulli top level command execut command special call flatten modul version modul modul submodul singl modul chapter core print stack pend explain step execut rewrit trace turn resum exit debugg continu current rewrit task abort exit debugg abandon current rewrit task enter debugg rewrit rewrit continu command prefix debug keyword accomplish debug rewrit user facil implement number import featur implement core list import omiss modul renam garbag collect top level modul special strategi rewrit command case object messag data type error handl recoveri situat rule condit equat membership rewrit memoiz oper assoc attribut miscellan differ true rewrit modulo ident implement restrict version lead nontermin attribut recogn arbitrari forward refer variabl oper modul order statement modul error system ident restrict ident ground term parent oper top cyclic depend ident element explicitli correctli resolv match algorithm renam modul express support full chapter core attribut mean rewrit modulo ad equat idempot lefthand side equat singl lead nontermin error due membership equat error correspond kind oper strategi strat attribut support neg integ restrict subset strategi depend oper attribut strategi bug emul oper assoc attribut oper prefix fi label equat support label sort declar oper attribut respect rearrang permut associ commut chang sort due ident idempot lower sort term leav unchang support interpret written trap bare variabl lefthand side bare variabl lefthand side membership axiom lead unexpect nontermin recommend place rule appli strategi languag membership axiom tricki prime nat var nat prime end membership axiom appli reduc term sort includ evalu nontermin theori attribut mean work infinit congruenc class lefthand side pattern match unexpect wai unlik true match ident omit problemat match modul chapter core foo sort foo op foo op foo foo foo var foo eq pattern match lead nontermin oper ident element top symbol lefthand side trick pattern pattern sort lower ident element nat sort nat nat op nat op nat op nat nat nat comm op nat nat comm var nat var eq match ident match rewrit attribut sort foo op foo op foo foo foo var foo eq rewritten number rewrit axiom creat copi current implement obviou rewrit produc reli nontermin system safe connect compon domain rang oper sort term sort rewrit rule control strategi built free constructor defin function work constructor term rewrit chapter core ident associ associ axiom combin ident axiom unexpect match properti result bar sort foo op foo op foo foo foo left var foo match yield solut solut solut naiv user expect solut match extens yield solut match portion solut match portion solut match portion solut match portion chapter core solut match portion solut match portion subject appar origin problem consid congruenc class valid solut correct simul congruenc class rewrit problem user input check kind undetect error core dump kind error fatal problem gradual error handl recoveri improv interpret stack hungri work deep term unfortun consequ highli modular design rewrit engin stack overflow manifest segment fault corrupt core unix command unlimit stack size run interpret stack overflow characterist nontermin comput heap usag store process larg modul larg memori requir quadrat size signatur problem magnifi top level modul garbag collect delai long time interpret read modul print result chapter full develop system put special emphasi creation facil gener execut environ wide varieti languag logic obviou area metalanguag build languag extens experi report document encourag defin core languag extens notat view modul modul express defin core addit function requir pretti print modul extend discuss section effici implement rewrit modul languag extens execut reason effici support core part function support full full core core modul enter full level present syntact restrict satisfi modul command order accept input full level syntact restrict explain section remov futur execut environ full implement core initi system start thing load modul system assum file locat current type command prompt full system load modul enter modul execut command full initi system full modul order enter modul system maintain persist store theori view introduc start loop type loop init chapter full init constant sort system give initi state full readi recal section text mean modul command intend full written notic core call system program handl input possibl system time function system modul core present previou enter full modul path section enter full path protect sort edg path node edg path op node op edg op op sourc target path node op length path var edg var path path path path eq path eq eq eq eq eq eq eq eq eq eq core enter modul command write directli file command core core write full modul chapter full command file enter singl modul command full addit function system modul core enter view addit command discuss concept section discuss section reduct rewrit syntax command core minor differ explain section result result result result result result rest chapter describ syntax full give declar oper includ actual modul input full techniqu section input addit declar introduc section add declar kind sort case token exclud identifi op bubbl exclud associ comm commut op bubbl exclud basic syntax declar oper full modul declar give declar chapter complet set declar found appendix chapter full sort attr op op sort op sort op op op op op assoc attr op comm attr op bubbl attr op left bubbl attr op bubbl attr op op prec token attr op attr op attr op op token sort op token sort op token sort op token sort op sort op sort op sort op sort full modul acycl graph modul discuss section core program techniqu style full support import includ protect section modul express syntax import declar token op includ op protect syntax declar membership rule op sort op sort op bubbl sort op bubbl sort bubbl op bubbl bubbl chapter full op bubbl bubbl bubbl op token bubbl bubbl op token bubbl bubbl bubbl top syntax function system modul declar op op op token op op modul concurr system concurr call typic structur multiset made object messag evolv concurr rule describ effect commun event object messag messag contact object applic rewrit rule view concurr comput deduct rewrit configur reachabl initi configur sequent provabl rewrit logic rewrit rule behavior system object state repres term object class object attribut valu object attribut repres messag fix syntact form syntact form defin user applic concurr state system multiset object call multiset union empti syntax modul configur defin basic concept concurr object system note sort messag sort oid cid object class moment left call rewrit modulo commut ident chapter full unspecifi fulli defin configur modul extend specif definit modul configur sort oid cid attribut object msg configur object msg configur attribut op op comm op oid cid object op oid cid object op configur op configur configur configur comm full concurr system defin mean keyword syntax conveni system modul assum acquaint basic messag support linguist distinct case modul implicitli includ configur modul assum syntax modul specifi concurr behavior object simpl class bank receiv messag credit transfer fund account protect protect oid class bal msg credit oid msg msg oid oid msg var oid var rl bal bal crl bal bal crl chapter full bal bal bal bal syntax modul class defin keyword class list attribut declar separ comma attribut declar form attribut identifi sort valu attribut identifi rang class declar form class sn declar class attribut syntax class basic syntax class declar oper relationship op token sort op op sort op class sort attribut account declar sort declar modul kind messag involv account transfer syntax introduc keyword msg notic msg defin multipl messag ariti singl declar syntax messag declar oper op token sort op sort rewrit rule modul declar behavior messag multiset structur configur distribut structur system concurr applic rule rewrit simpl configur consist account messag peter bal result object peter bal class inherit directli support type structur subclass declar modul case declar effect subclass declar rule superclass chapter full newli defin rule subclass structur behavior object subclass defin modul save account introduc subclass attribut rate record interest rate account leav unspecifi rule comput credit interest account rate proper express introduc attribut account object includ class rate subclass class immedi class defin subclass class multipl inherit support attribut sort declar declar subclass attribut inherit case multipl requir made attribut occur sort attribut superclass class inherit rule superclass object subclass behav object exhibit addit behavior due introduct rule subclass declar multipl subclass relationship declar class declar subclass class form signatur full appendix sort sort sort list class syntax subclass declar oper op subclass op subclass object class attribut bal receiv messag credit transfer fund object class rewrit obtain result paul bal rate peter bal mari bal rate result configur peter bal gener method system rewrit logic chapter full paul bal rate mari bal rate top level syntax modul declar op transform modul system modul understand class class inherit make explicit full structur left implicit syntact convent adopt modul provid conveni syntax program semant reduc system modul regard special syntax reserv modul syntact sugar modul translat system modul semant definit origin modul modul reduc system import conceptu advantag provid syntax user express thought term viewpoint suit problem hand conceptu advantag lost system modul provid translat basic structur share objectori modul made explicit configur function modul defin begin section translat objectori modul extend structur messag rule introduc modul system modul translat modul introduc earlier note cid introduc rang class identifi subclass subclass present constant sort class identifi mod includ includ includ configur sort oid cid op op credit oid msg op oid msg op oid oid msg op bal attribut var oid var oid var chapter full var var var var var var rl bal bal crl bal bal true crl bal bal bal bal true describ desir transform modul system modul ffl modul configur import ffl class declar form class sort constant sort declar oper attribut attribut ffl subclass relat declar set attribut object class complet ffl rewrit rule modifi make applic object class object class identifi explicitli rule object subclass replac class identifi object rule variabl class sort variabl sort introduc rang addit attribut object subclass object translat att variabl declar sort variabl att sort ffl simplifi notat modul give user possibl mention rule attribut object relev rule explain denot pair notic simplifi transform modul system modul origin chapter full attribut identifi class complet attribut sort valu prescrib attribut modul rule attribut object mention lefthand righthand side exhaust object arbitrari subset object attribut pictur ho al ab ho ab vb ar vri al attribut ab attribut ar attribut transform system rule translat ho al ab ar ac ho al ab vb ar ac variabl sort ac attribut defin class variabl att match remain pair form rule obtain slightli convent similar convent present attribut mention left preserv origin valu attribut mention attribut explicitli mention left unchang rewrit rule origin modul interpret convent form inherit subclass defin inherit rewrit rule credit transfer fund account defin illustr treatment class inherit system modul result transform modul introduc mod includ configur includ sort cid op op rate attribut structur specif extens explain core section full keyword protect pr abbrevi defin structur specif predefin modul introduc section chapter full modul full explain section full support import import modul express metalevel comput conveni refer modul enter system make full import declar form protect id list modul constant id sort modul equat make constant id equal metalevel modul id declar ad enter modul nat sort nat op nat op nat nat op nat nat nat comm var nat eq declar modul protect defin function extract set oper declar function modul protect op var qi var il var sd var ssd var od var vd var ma var eq eq qi il sd ssd od vd ma eq od appli function constant declar equal modul result op nil nat op nat nat nat comm op nat nat modul present section support full chapter full descent function discuss section result term note written actual term intuit notat section full function avoid cumbersom task explicitli write term modul obtain term modul denot write result term explicitli write reduct write result term note modul argument term modul argument term wai depend modul modul term belong obtain correct note reduct make modul import modul function access modul evalu modul import modul function modul argument obtain modul assum previou modul nat enter full denot result nat nil sort nat op nil nat op nat nat nat comm op nat nat var nat var nat eq facil write reduct term present section result term chapter full result metalevel comput level reflect term modul hard read displai output readabl form back term command argument argument modul term return belong desir output term result command argument syntax command op give command nat result nat notic wrote section red result iter level reflect modul protect give command nat red result nat written notat red result command modul command full level enter system distinguish command core context command modul command handl full reduc rewrit command effect full specif homonym command core chapter full syntax reduc command declar notic core red abbrevi reduc command reduc term modul syntax core op red bubbl op bubbl declar defin syntax rewrit command op bubbl op token bubbl op bubbl op token bubbl full maintain modul introduc begin session notic full session start automat start system specif full load loop initi core full independ modul store core modul explicitli system modul gener modul select modul select command op select show command core command show modul theori introduc show flatten version modul show compon modul command core explain section command modul default current modul syntax command op show modul op show modul op show op show op show sort op show sort op show op op show op op show var op show var op show mb command red oper declar op red bubbl command red nat red nat red nat correct function return case arbitrarili prevent possibl syntact limit discuss section overcom futur version theori discuss section chapter full op show mb op show eqn op show eqn op show rl op show rl show view command print view op show view show modul show view command list list present op show modul op show view program theori view basic build block program theori defin interfac structur properti requir actual paramet instanti formal paramet modul actual paramet modul requir view formal interfac theori actual modul view provid interpret actual paramet theori theori declar modul syntact semant properti satisfi actual paramet modul instanti full support type function system theori structur modul counterpart membership assert import theori modul system theori rule theori subclass relationship messag theori rewrit logic theori interpret theori rule equat variabl righthand side condit lefthand side condit membership axiom variabl condit membership assert lefthand side singl variabl current theori execut function theori declar keyword fth system theori keyword theori keyword syntax declar theori op op op view discuss section chapter full begin introduc function theori requir sort sort theori partial order set transit binari oper express poset protect bool sort op bool var eq true theori total order poset pair distinct element includ poset var eq true includ import theori theori semant import theori interpret initi semant initi semant maintain import definit poset declar protect bool ensur initi semant function modul boolean fact crucial requir requir preserv poset includ deal structur part top part modul initi semant kind semant modul theori determin keyword definit import mode system theori choic multiset element choic oper defin multiset rewrit rule nondeterminist pick element multiset express theori sort declar sort choic sort op var var full import modul theori support protect mode note declar import bool ad modul theori current version full set core set includ command chapter full rl theori class attribut sort defin cell sort class cell content theori natur express theori defin cell paramet captur idea defin cell gener present full implement support theori plan extend languag support view modul theori declar interfac requir modul modul theori theori interfac label sort uniqu identifi gener form interfac modul xn xn label tn paramet theori syntax interfac modul declar op token paramet gather paramet op op token current version full sort theori interfac qualifi ambigu label paramet theori sort qualifi section oper map affect entir famili overload oper declar theori paramet modul oper declar bodi oper declar paramet theori modul modul interfac defin sort set set op mt set op set set set comm op comm var eq chapter full note discuss section systemat qualifi modul case set list element introduc repeat sort set list oper qualifi submodul modul express length renam item mean avoid burden long qualif modul includ explicitli renam convent qualifi sort weak deal modul support adhoc overload constant qualifi order problem ambigu signatur reduc sort consist qualifi modul express belong view view instanti modul current version full assum view qualif bodi modul xn sort written form modul instanti view vn sort note sort option perfectli valid declar sort op op sort sort previou modul defin set defin sort op mt op comm op comm var eq section qualif convent sort modul avoid unintend sort make renam practic unnecessari modul set paramet modul paramet happen paramet declar paramet interfac form involv theori paramet treat normal share label regard relationship bodi modul interfac paramet modul constructor evalu gener renam copi includ copi theori chapter full copi paramet theori sort renam label paramet theori sort sort renam reason occurr sort modul mention renam futur version qualif case ambigu modul pair notic qualif sort notic qualif sort sort op op op var var eq eq paramet theori renam process paramet theori carri top renam modul modul defin lexicograph order pair element total order set sort op op bool op op var var eq eq eq repres relat modul initi depict result structur chapter full ks ii oo oo bool ks copi poset modul defin stack element defin defin class link sequenc node object object class attribut identifi node stack stack empti attribut null object class attribut hold identifi null attribut content store sort notic identifi node form identifi stack object node natur number messag pop top argument identifi object insert top stack delet top send messag element top stack object make request protect protect oid class content class oid msg push oid msg msg pop oid msg msg top oid oid msg msg oid msg op null oid op oid oid notic class convent discuss sort chapter full var oid var var rl top nonempti stack content top rl push nonempti stack push content rl push empti stack null push content null rl pop nonempti stack defin stack store data element object class defin modul intend behavior modul theori present section protect protect oid class node oid class oid msg push oid oid msg msg pop oid msg msg top oid oid msg msg oid msg op null oid op oid oid var oid var var chapter full rl top nonempti stack node content top rl push nonempti stack push node rl push empti stack null push node rl pop nonempti stack view view assert target modul theori claim satisfi sourc theori wai requir target modul interpret sourc theori target current version full default view support view defin theori view defin definit view sourc target modul map messag sourc theori current version support default view style part map explicitli ident map attribut ariti map attribut target omit map sort sourc theori ident map view declar set proof axiom sourc theori case axiom translat view hold target target modul interpret verifi proof oblig gener requir induct proof techniqu style support logic chapter full map sort sourc theori sort target express syntax sort map oper express syntax op oper identifi oper identifi ariti sort oper map explicit ariti oper ariti entir famili oper section oper target oper deriv term variabl map function function express case defin view theori oper defin symmetri transit modul oper exist oper defin view map op term map class sourc theori class target express syntax class attribut map form attr attribut class sourc theori attribut imag class view map messag express syntax msg messag identifi messag identifi ariti sort messag map explicit ariti affect entir famili messag declar declar messag syntax view declar op term bubbl bubbl op token token op token sort token op token sort token op sort sort op sort sort op token sort token op token token op token sort token op token sort token op chapter full op preview view sort defin view theori modul view encourag convent view sort map follow add understand specif avoid label interfac modul gener ambigu view instanti view link formal paramet modul actual paramet intermedi formal paramet modul give exampl section view target theori sort case express map function express relat map express oper inequ oper sort var op term notic deal modul structur theori discuss section give view top theori entir import theori futur plan handl theori view give structur theori view modul express clear obj specif languag abstract syntax write specif modul notion modul express understood express defin modul defin modul combin modifi specif set specif modul algebra structur essenti specif facilit construct specif exist flexibl reusabl manag complex understand analyz larg specif chapter full modul import combin modul structur modul complex relationship compon submodul execut typic convert structur modul unstructur modul submodul case flatten modul compil rewrit engin systemat capabl evalu modul express structur modul flatten hierarchi unstructur modul execut modul oper defin rewrit rule oper metalevel term modul essenti idea implement full current version full support type modul instanti modul express view renam modul express set map syntax op instanti op renam section view express singl view sequenc view separ comma case modul instanti paramet modul instanti instanti process actual paramet bound paramet modul modul creat result fact evalu modul express instanti requir view formal paramet actual paramet view bind actual paramet oper target instanti modul made view explicitli defin set machin integ modul express pair machin integ mention section defin view theori theori view instanti modul set view previou section result modul theori instanti view theori obtain modul set machin integ give definit modul idea protect op bool var chapter full var eq modul theori set element function max return maximum element set protect op max var var eq modul express argument protect includ modul reduc rewrit red command gener modul express place modul expect full modul modul time modul express modul express modul gener modul express modul pass engin intend result modul express red command instanti max view present section result notic instanti modul view theori modul result case expect modul target view theori modul renam renam consid function modul list map return copi modul chang map structur renam creation copi top modul renam part submodul structur affect renam submodul structur affect renam copi gener subset map affect complet syntax renam map op token token map op token sort token map op token sort token map op token token map op token sort token map chapter full op token sort token map op sort sort map op token token map op sort sort map op token sort token map op token token map op token sort token map op token sort token map map op prec notic renam rule metalevel applic set attribut renam oper chang syntact valu gather practic relev deal syntax chang syntax oper intend modifi grammat attribut oper chang syntax function max modul max present maximum reduct max maximum result result make perfect fact system term reduc max happen default oper syntax oper default gather valid notic element pass function maximum equat set obtain intend result place set conveni chang valu attribut maximum max maximum maximum reduc max maximum maximum result chapter full exampl found appendix finish section involv stack bank account cell sort class cell attr content cell bal rewrit stack null paul bal peter bal mari bal push push push top result configur stack paul bal peter bal mari bal node peter node mari syntact restrict caveat write function system modul full core syntact differ core full syntact restrict account full write oper messag singl identifi form sort term qualif sort test singl identifi form plan remov syntact restrict futur version rest section explain detail give hint avoid oper singl identifi declar oper singl identifi identifi defin oper equal singl identifi form chapter full singl identifi form oper declar oper core declar oper int op int int bool notic blank special charact break identifi declar full oper element int sort write op int set core oper ariti defin declar keyword oper singl identifi form declar op foo bar notic oper singl boundari syntact form oper oper messag declar singl identifi form defin messag credit declar msg oid msg appli declar multipl messag msg oid msg problem mention begin section qualif term sort sort test qualif sort sort syntact featur extend signatur directli handl core core user forc case defin singl identifi form sort constant nil qualifi check term sort write plan add system function support flexibl treatment syntax full syntact restrict eventu remov chapter semant summar semant foundat system includ discuss modul introduc basic concept membership equat initi algebra provid mathemat semant function modul review basic concept rewrit initi model provid mathemat semant system modul membership equat logic function modul declar languag base rewrit logic rewrit logic underli equat logic paramet version rewrit previou version special case underli equat logic chosen membership equat logic conserv extens equat logic partial equat logic exist equat support oper error specif signatur membership equat logic set fs set sort algebra assign sort subset element sort element sort error undefin element atom formula membership assert form term kind gener sentenc horn atom quantifi finit set variabl condit equat membership axiom form chapter semant membership equat logic usual good sound complet rule initi free free algebra theori function modul equat theori membership equat logic satisfi addit requir termin function theori membership equat logic algebra satisfi equat membership axiom theori accept model semant function modul initi algebra theori semant function modul free functor paramet theori bodi modul list modul form list model trivial paramet theori sort model set element semant functor send set algebra list set sort modul sort list element belong model poset function data type element partial order semant functor send poset algebra list poset sort function similar semant correspond modul theori obj membership equat logic conserv extend equat function modul extend obj modul automat kind infer sort declar user relat declar kind explicitli conveni notat retain syntact sugar oper declar op push nat stack understood syntact sugar membership axiom nat declar stack correspond membership axiom stack comput function modul accomplish equat rewrit rule canon form found equat satisfi addit requir term class modulo equat rewrit uniqu canon canon form assign sort smaller sort assign term class modul satisfi condit reduct strategi reach normal explain section user assign oper function evalu strategi obj style control reduct effici strategi function theori function submodul protect addit requir submodul interpret initi modul paramet form bodi note poset good theori part semant part protect function modul essenti defin partial order predic chapter semant strategi chosen support rewrit modulo equat theori associ understood equat rewrit modulo axiom membership equat logic properti termin equat confluenc critic pair equal membership term sort decid properti equal membership predic comput function tucker conclud predic specifi termin equat function pleasant consequ includ inequ negat sort test condit equat membership seemingli neg predic axiomat insid logic posit provid necessarili constructor specif sort practic explicitli built implement rewrit deduct effici section denot membership equat logic rewrit logic equat theori rewrit theori set rule empti defin conserv map logic function modul regard special case gener system modul rewrit logic defin rewrit theori give logic rule deduct model rewrit includ initi free discuss theori deduct signatur rewrit logic equat theori equat signatur set rewrit oper class term modulo free rewrit syntact constraint term gain greater flexibl decid count data string rewrit obtain associ multiset rewrit associ commut standard term rewrit obtain case set equat empti techniqu rewrit modulo equat studi extens implement rewrit modulo equat theori interest equat attribut oper rewrit modulo axiom rewrit logic choic underli equat membership equat underli equat logic membership equat logic exposit give unsort present chapter semant signatur sentenc rewrit logic sequent form possibl involv denot class term modulo equat rewrit theori rank alphabet function set set set pair compon label compon pair class fx xn countabl infinit set variabl element call rewrit rule understand rule label sequent notat fx xn set variabl occur write xn xn abbrevi notat rewrit theori entail sentenc write obtain finit applic rule deduct assum term form denot simultan substitut reflex congruenc replac rule xn xn transit rewrit logic logic reason correctli concurr system evolv mean transit signatur rewrit theori describ structur state binari state distribut structur rewrit rule theori describ elementari local transit distribut state concurr local transform rule rewrit logic reason correctli gener concurr transit system satisfi descript rewrit step parallel local transit concurr system simplifi exposit rule logic case uncondit rewrit rule idea present extend condit rule gener rule form express power rewrit theori chapter semant adopt logic viewpoint regard rule rewrit logic correct deduct logic system rewrit step logic entail formal system comput logic viewpoint rewrit logic interpret summar diagram state term proposit transit rewrit deduct distribut structur algebra structur proposit structur row import roughli express fact state transform concurr smaller state compon chang independ rewrit logic composit concurr state formal oper signatur rewrit theori axiomat system logic point view oper natur regard proposit connect state structur state subtl addit point row algebra structur system involv equat equat describ system global state concurr data dramat impact amount concurr system note discuss rewrit logic primarili logic deduct directli correspond logic talk chang indirect global manner variant modal tempor logic model sketch construct initi free model rewrit theori model captur nice intuit idea system system state class transit concurr rewrit rule adopt logic comput altern view model formula rewritten formula concurr rewrit correspond proof logic question model natur categori state transit sequenti composit morphism dynam behavior correspond deduct rewrit theori assum label rule model seek categori tr object class term morphism class repres proof rewrit concurr rule gener proof specif respect domain proof term rule rewrit logic note notat morphism fi mean composit ff fi ident chapter semant ff ff ff replac rewrit rule xn xn ff ff ff composit ff fi fi rule gener defin oper proof term argument return result proof term proof term form algebra structur pr consist graph node ident oper rewrit desir model tr quotient pr modulo categori associ fl ident ff ff ff structur preserv composit ff ff fi fi fi ff fi ff fi preserv ident axiom xn xn axiom ff ff ff ff exchang xn xn ff ff note set variabl paramet assum fix countabl adopt notat tr equat make tr equat make forc axiom exchang law state rewrit form repres simultan rewrit term top rule subterm match rewrit sequenti composit rewrit top subterm match variabl sequenti composit rewrit ff top exchang law state rewrit top mean rule rewrit express composit morphism implicitli assum domain codomain match chapter semant ff process independ simultan order proof term descript concurr equat provid equat theori true concurr descript abstract comput note xn xn regard functor tr tr mathemat point view exchang law assert natur transform lemma rewrit rule xn xn famili morphism natur transform xn xn functor xn xn tr tr categori tr model assign rewrit theori gener notion call defin definit rewrit theori categori ffl structur famili functor ff ing satisfi equat xn xn ident functor functor defin induct functor fs obviou ffl rewrit rule natur transform functor fs fs preserv rewrit rule ident natur transform number variabl rule defin categori obviou detail proof theorem exist initi free gener case condit rewrit theori sound complet rewrit logic model prove theorem tr initi object categori tr function jsj extend uniqu tr note diagrammat order horizont ff vertic composit natur transform chapter semant semant system modul point logic membership logic variant rewrit logic system modul rewrit theori logic case semant initi model tr construct unsort case section initi model tr algebra rewrit comput ground term theori system perspect model describ concurr behavior system axiomat exhibit term denot state proof term ff denot possibl concurr comput system modul paramet theori modul rise free extens functor semant modul mean system put rewrit theori full rewrit theori rule rewrit perform modulo equat implement match algorithm equat theori user match modulo arbitrari theori undecid requir theori system modul ffl equat divid set match algorithm exist set equat termin sort modulo equat part function modul ffl rule modul coher call section equat modulo mean critic pair exist rule intermix rewrit rule rewrit equat rewrit comput fail perform rewrit equat deduct step effect rewrit modulo match algorithm simpl strategi circumst reduc canon form appli rule strategi adopt interpret state system system modul axiomat abstract data type equat modulo rule local rule chang practic lefthand side rule involv constructor coher natur byproduct good specif practic complet method check make set rule coher semant modul reduc system explain section systemat process translat modul rewrit engin extens match algorithm theori ad combin exist present match modulo combin attribut support chapter semant system modul ontolog support modul worth exist gener system modul configur object maintain ident state notion fair adequ special arbitrari system modul approach provid logic semant concurr program rewrit logic defin rigor concept foundat paper provid good background foundat paper rewrit logic foundat actor viewpoint paper show modul satisfi simpl initi model semant coincid natur partial order event concurr semant basic idea reflect semant discuss section detail found bibliographi jan john tucker comput data type mean finit equat specif method de van languag seventh page volum implement unif base calculu explicit substitut proc page springer lnc logic framework base comput system proc intl workshop rewrit logic volum electron note theoret comput scienc adel jose mesegu specif proof membership equat logic theoret comput adel jose mesegu specif proof membership equat logic bidoit volum lectur note comput page montanari process term tile logic technic report sri juli rod joseph goguen semant specif languag dine copenhagen winter school abstract softwar page springer lnc castro approach solv binari csp comput system proc intl workshop rewrit logic volum electron note theoret comput scienc lincoln introduct sri march manuel reflect gener logic rewrit applic languag phd bibliographi manuel francisco steven patrick jose mesegu metalevel comput proc intl workshop rewrit logic applic north manuel francisco steven jose mesegu build equat prove tool reflect rewrit logic proc symposium japan april manuel steven patrick jose mesegu principl proc intl workshop rewrit logic volum electron note theoret comput scienc manuel jose mesegu axiomat reflect logic languag san april page manuel jose mesegu reflect strategi rewrit logic proc intl workshop rewrit logic volum electron note theoret comput scienc manuel jose mesegu intern strategi reflect logic workshop strategi autom deduct juli page jouannaud rewrit system van handbook theoret comput vol page francisco jose mesegu extens modul algebra proc intl workshop rewrit logic applic north francisco jose mesegu specif full technic comput scienc sri februari jose mesegu proc intl workshop rewrit logic applic north steven term rewrit oper evalu strategi proc intl workshop rewrit logic applic north steven fast match combin regular equat theori proc intl workshop rewrit logic volum electron note theoret comput scienc bibliographi report world cafe extens specif environ proc intern case girard linear logic theoret comput joseph goguen jose mesegu algebra equat deduct multipl except partial oper theoret comput joseph timothi jose jouannaud introduc obj technic report sri comput scienc ja goguen gr applic algebra specif academ kirchner kirchner proc intl workshop rewrit logic applic north design constraint logic program languag comput system van principl practic constraint newport page mit kirchner prototyp complet constraint comput system proc rewrit techniqu saunder categori work mathematician jose mesegu rewrit logic logic semant framework technic report sri comput scienc august handbook philosoph kluwer academ publish jose mesegu rewrit logic logic semant framework proc intl workshop rewrit logic volum electron note theoret comput scienc mesegu rewrit logic architectur descript languag lectur santa fe seattl march juli jose mesegu logic theori concurr object confer octob page jose mesegu rewrit unifi model concurr technic report sri comput scienc februari june bibliographi jose mesegu condit rewrit logic unifi model concurr theoret comput jose mesegu logic theori concurr object realiz languag peter research direct concurr page mit jose mesegu solv inherit anomali concurr objectori program oscar proc page springer lnc jose mesegu rewrit logic semant framework progress report proc august page springer lnc jose mesegu membership algebra semant framework equat specif proc springer lnc jose mesegu research direct rewrit logic berger comput nato advanc studi juli august jose mesegu joseph goguen algebra solv multipl coercion problem inform jose mesegu montanari petri net monoid inform jose mesegu carolyn partial order event model concurr object novemb jose mesegu timothi winkler parallel program le research direct highlevel parallel program page springer lnc technic report sri comput scienc novemb comput model open distribut system bowman formal method open distribut vol page chapman encod mobil describ mobil softwar architectur proc symposium japan april peter jose mesegu system rewrit logic proc intl workshop rewrit logic volum electron note theoret comput scienc bibliographi bidirect tree mathemat comput model linguist john workshop mathemat linguist pennsylvania state state technic report sri comput scienc menlo ca algorithm technic report sri comput scienc menlo ca jf algorithm base syntact constraint propag phd christoph prototyp combin unif algorithm program languag confer rewrit techniqu applic springer lnc rewrit semant algebra petri net march sri intern cs univ actor rewrit theori proc intl workshop rewrit logic volum electron note theoret comput scienc actor rewrit theori proc intl workshop rewrit logic number electron note theoret comput scienc north van execut languag definit phd rewrit modulo rewrit system cs effect model concurr proc sixth int conf parallel architectur languag juli volum page pour le de langag de programm avec contraint phd universit henri nanci formal approach softwar engin proc intl workshop rewrit logic volum electron note theoret comput scienc appendix list core command rewrit command curli bracket option syntax reduc fin modul term term reduc equat membership axiom modul reduc abbrevi red omit current modul assum reduc reduc rewrit number fin modul term term rewritten equat membership axiom modul default interpret rule appli rule top strategi stop number rule applic reach bound rule appli equat appli omit current modul assum upper bound infin assum rewrit rewrit foo rewrit rewrit bar loop fin modul term command initi loop modul import section term rewritten equat membership axiom modul result loop constructor symbol top current state list quot identifi output posit loop constructor print sequenc identifi appendix list core command command input list identifi loop modul import current modul chang rewrit result previou rewrit loop constructor symbol rewrit command reduc sequenc identifi convert list quot identifi input posit loop nil list quot identifi output posit loop term rewritten equat membership axiom modul term result loop constructor symbol list quot identifi output posit loop constructor print sequenc identifi continu attempt continu rewrit result rewrit command equat membership stop upper bound number rule applic reach command usabl current modul chang rewrit rewrit command reduc upper bound infin assum match command match command directli invok rewrit engin term pattern matcher figur subject match complex pattern match number fin modul pattern subject perform match modul kind match engin appli membership axiom result list number match substitut upper bound infin assum match foo number fin modul pattern subject work similarli previou perform match extens theori includ assoc subject symbol extens theori piec top theori layer top match kind match engin appli equat rule order accur simul congruenc class rewrit result list match part subject part appendix list core command trace command trace produc detail inform rewrit perform condit rewrit attempt typic result unmanag huge volum output command control displai set trace set trace command turn trace trace turn trace inform gener intern slow speed interpret set trace condit set trace condit determin evalu condit trace set trace set trace determin term print rewrit set trace substitut set trace substitut determin substitut print set trace mb set trace mb determin membership axiom applic print set trace eq set trace eq determin equat applic print set trace rl set trace rl determin rule applic print set trace select set trace select determin trace inform select oper symbol print trace select symbol trace deselect symbol oper symbol current modul trace select option trace select foo bar trace deselect print option command set print set print control oper syntax print prefix form syntax support pretti print support advantag uniform prefix notat output tool default set print graph set print graph term intern repres graph result term term reduc term substitut print graph number oper symbol full term patholog case size term exponenti size graph default appendix list core command set print flatten set print flatten control argument function symbol associ attribut print flatten form default set print set print addit term print addit make group explicit default set show stat set show stat determin number rewrit print result rewrit continu command default set show time set show time determin cpu real time rewrit print result rewrit continu command default set show command set show command determin full form command print execut default set show gc set show gc determin messag print garbag collect perform default show command show modul print modul current modul show print flatten modul current modul show sort print sort inform modul current modul show op list oper modul current modul show var list variabl modul current modul show mb list membership axiom modul current modul show eq list equat modul current modul appendix list core command show rl list rule modul current modul show compon list connect compon poset sort modul current modul show summari show summari statist context free grammar term rewrit system gener modul current modul debugg command debug reduc fin modul term work reduc command drop debugg execut rewrit debug rewrit number fin modul term work rewrit command drop debugg execut rewrit resum usabl debugg exit debugg resum current rewrit activ abort usabl debugg exit debugg abandon current rewrit activ step usabl debugg perform singl step current rewrit activ trace switch usabl debugg print stack pend rewrit task explan miscellan command select modul select modul current modul command requir modul refer current modul modul explicitli current modul modul enter set includ modul set includ modul add remov modul set modul automat includ modul appendix list core command system command command control system level thing unlik command period unlik insid modul definit point keyword var legal print path work directori ls run unix ls command list file directori work directori flag depend local implement ls cd work directori save current work directori stack work directori work directori top directori stack pop directori stack file includ point full file full path file current work directori includ file command interpret respond reach end file quit interpret exit abbrevi synonym abbrevi synonym support modul syntax pr protect includ sort sort assoc associ comm commut idempot strat strategi prec var var appendix list core command abbrevi synonym support command syntax red reduc rewrit cond condit substitut cont continu flat flatten cmd command sort sort op op var var mb mb eq eq rl rl kind compon mod modul featur featur support limit backward compat obj famili languag omit futur code command obj command recogn set gc show set show gc set gc show set show gc set stat set show stat set stat set show stat abbrevi synonym abbrevi synonym support modul syntax obj endo cq appendix grammar core appendix describ syntax extend bnf symbol symbol separ squar bracket option repetit repetit denot liter applic nonempti list separ comma comment syntact comment code quit cd push ls select reduc rewrit match continu loop trace select deselect show set modul sort op var mb eq rl summari compon show print trace includ appendix grammar core stat time command gc flat graph condit substitut select mb eq rl debug reduc debug rewrit debug continu resum abort step mod includ sort op op var mb eq rl crl assoc comm left memo strat prec nat gather special os depend os depend os depend simpl convent cap simpl convent capit simpl convent capit appendix grammar core identifi possibl underscor natur number symbol simpl identifi lexic issu token sequenc printabl ascii charact delimit white consid singl charact token singl line comment start end end line comment start end balanc comment appendix signatur full full system defin core modul entir semant full defin execut core full definit full includ definit intern function implement system found grammar full user follow enter modul function submodul full system specif give specif full grammar form wai bnf grammar form sort token bubbl sort attr hook sort attr hook op token token extend sort op sort sort op op sort declar op sort op sort declar op op op op appendix signatur full oper attribut op op assoc attr op associ attr op comm attr op commut attr op bubbl attr op bubbl attr op left bubbl attr op left bubbl attr op bubbl attr op bubbl attr op op op prec token attr op token attr op attr op attr op attr op idempot attr op attr op op token hook op token hook op token token token hook op token token token hook op token bubbl hook oper declar op token sort op token sort op token sort op token sort op sort op sort op sort op sort includ sort paramet paramet token variabl declar op sort op sort appendix signatur full membership axiom declar op bubbl sort op bubbl sort bubbl equat declar op bubbl bubbl op bubbl bubbl bubbl rule declar op token bubbl bubbl op token bubbl bubbl bubbl import declar op includ op op protect op pr modul interfac op token paramet gather op op token declar list op op op function system modul theori op op op op includ sort modul theori op op class declar op sort op class sort op op token sort subclass declar op subclass op subclass appendix signatur full op op messag declar op token sort op sort includ sort map map modul express op op renam map op token token map op token sort token map op token sort token map op token token map op token sort token map op token sort token map op sort sort map op token token map op sort sort map op token sort token map op token token map op token sort token map op token sort token map op prec view includ sort preview view map op term bubbl bubbl op token token op token sort token op token sort token op sort sort op sort sort op token sort token op token token op token sort token op token sort token view op appendix signatur full preview op command includ sort function op reduc command op red bubbl op bubbl op reduc bubbl op bubbl rewrit command op bubbl op token bubbl op bubbl op token bubbl op rewrit bubbl op token bubbl op bubbl op token bubbl select command op select show command op show modul op show modul op show op show op show sort op show sort op show op op show op op show var op show var op show mb op show mb op show eqn op show eqn op show rl op show rl op show view op show modul op show view includ view includ command appendix standard librari predefin modul interpret standard structur adapt interpret standard sort bool op true bool op bool truth protect op bool op bool special op bool special bool protect truth op bool bool bool comm prec op bool bool bool comm prec op xor bool bool bool comm prec op bool bool appendix standard librari op impli bool bool bool prec var bool eq true eq eq eq xor eq xor eq xor xor eq xor true eq xor xor eq impli xor set includ bool ident op bool strat special op bool strat special sort op op op special op special op special op gather special appendix standard librari op gather special op gather special op gather special op gather special op gather special op gather special op gather special op gather special op gather special op appendix standard librari gather special op gather special op bool special op bool special op bool special op bool special protect sort op op conc op index op strip appendix standard librari protect sort op nil op protect sort modul import sort attr term equat rule ruleset assign substitut hook modul import sort attr term term equat rule ruleset assign substitut hook op term op term op gather prec op term term op term term op op comm op nil op op op ruleset modul op nil op op includ import op sort appendix standard librari op op op comm op op op comm op op comm op assoc attr op comm attr op attr op id term attr op term attr op term attr op strat attr op memo attr op prec attr op gather attr op special attr op op hook op hook op term hook op op op comm op term op term term term op op comm op term term equat op term term term term equat op op comm op term term rule op term term term term rule op ruleset op ruleset ruleset ruleset comm op term assign op substitut op substitut substitut substitut comm op term substitut op term op sort op modul term term appendix standard librari ruleset term term term term appendix standard librari term term term term term term term term term term ruleset ruleset term term term term term term term term substitut substitut term term substitut op modul term term modul term op modul term substitut modul term op modul term modul term op modul term appendix standard librari modul term op modul sort sort bool modul term op modul sort sort bool modul term op modul term sort modul term op modul sort modul term op modul sort modul term mod protect sort state system op state system appendix softwar architectur francisco jose mesegu part broader joint project carolyn rewrit logic semant framework architectur descript languag includ exhibit program featur full profit exampl section familiar program featur full interest nontrivi case studi demonstr suitabl rewrit logic semant give formal semant architectur descript languag languag semant model clear correct adl base semant model modest goal model syntax exist adl rewrit logic semant semant model typic includ static implicit invoc model motiv system imag ship inform imag recognit subsystem typic dataflow architectur case dataflow architectur modifi runtim reflex ad recognit unit result imag recognit subsystem summar style command center implicit invoc object react event broadcast object command center send messag inform receiv architectur system summar pictori figur appendix softwar figur semant heterogen architectur protect var var differ number op dif eq fi maximum number op max eq fi sort sort appendix softwar op null sort op op op var var eq eq sort op op op op var var var eq eq eq sort op nil op protect bool sort op mt op comm op comm op bool appendix softwar var var eq eq mt eq function sort domain codomain op domain codomain domain function sort domain codomain function sort codomain protect protect op map var var eq eq protect bool protect protect support sort op op op var var appendix softwar eq eq protect support write pr sort sort op mt op comm op comm op bool var var eq eq eq write pr sort domain sort codomain op sort op map pr sort domain sort codomain op sort op map protect protect support appendix softwar protect sort op mt op op var var op dom domain eq eq op im imag eq eq eq null eq data type port input output port filter object pipe filter model sort protect bool protect sort sort op put set port op flush set port null op empti bool appendix softwar true port set set null op full bool true port set ar null var var var eq eq eq eq true eq eq true eq oid protect op oid sort sort sort imag sort imag sight consist coord appendix softwar imag list block height imag shape list sight pr pr sort op op imag op distanc imag imag distanc imag op size imag op imag op imag op imag op imag var var imag eq eq eq eq eq eq eq eq eq eq eq eq oid oid sort oid sort appendix softwar pr pr class includ protect class var oid var var var var rl null rl null nil rl null includ class cnt subclass var var var oid var crl cnt cnt appendix softwar sight sight sort sight function sort domain sort codomain locat var domain op term sight sort imag sort data protect sight protect sort op mt sort sort op mt op map protect sort sort op mt sort data sight data data op eval op winner eval var lev var var locat var imag appendix softwar eq eq fi data data sort data recogn includ class recogn model imag subclass recogn var locat var imag var oid rl recogn null model recogn null rule assum uniqu input output port singleton data valu recogn filter collector includ class collector cnt subclass collector op eval var var oid var var data eq eq crl collector null cnt collector cnt appendix softwar discrimin includ collector class discrimin collector threshold control oid msg oid locat eval msg var var oid var var lev crl discrimin collector threshold control collector lev discrimin collector null eval crl discrimin collector threshold control collector lev discrimin collector null eval rule locat locat assum locat evalu origin sight locat meta recogn discrimin pr pr sort state op lock cid cid op oid oid op readi state op busi state msg oid imag msg class meta fanout recogn collector state cnt tag var oid appendix softwar var imag var var op max var eq dynam chang configur dataflow network ad recogn object recogn imag pipe hook pipe fanout collector object rl meta state tag meta state recogn tag recogn model nil nil crl meta state recogn fanout collector cnt collector cnt meta state recogn collector includ meta op configur initi configur pipe feed imag link fanout object link pipe recogn aircraft carrier evalu fed pipe collector object discrimin object select evalu appendix softwar accur threshold send object control object dynam chang dataflow network hook recogn pipe eq cnt nil nil nil recogn model recogn model recogn model nil nil nil collector appendix softwar cnt discrimin collector threshold control meta fanout recogn collector state cnt tag pr class bubbl conf configur class implicit tabl msg oid msg op configur configur sort msg var oid var var var var var configur var msg msg var ea crl bc cb bc cb bc cb rl bc empti cb rl bc msg cb msg crl bc implicit tabl cb implicit tabl appendix softwar null crl bc implicit tabl cb msg ot implicit tabl rl bubbl conf bubbl conf ea sort event op event op op sort event sort event locat sort locat eval sort eval sort bubbl class command tabl subordin oid subclass command implicit msg oid locat appendix softwar msg oid locat op oid var oid var locat var ev eval var configur rl eval ev ot control conf control conf ev rl msg ev ot command subordin command ot rl msg ev ot command subordin command ot op configur eq control conf command tabl subordin command tabl subordin rewrit result configur null null null null cnt recogn null null model recogn null null model recogn null null model collector null null null null appendix softwar cnt discrimin control threshold collector meta cnt collector tag state recogn fanout eval ot eval ot eval ot eval ot rewrit ot result configur null null null null null cnt recogn null null model recogn null null model recogn null null model collector null null null null null cnt discrimin control threshold collector meta cnt collector tag state recogn fanout recogn null null model eval ot eval ot eval ot eval ot rewrit result configur null null null null cnt appendix softwar recogn null null model recogn null null model recogn null null model collector null null null null cnt discrimin control threshold collector meta cnt collector tag state recogn fanout control conf command tabl subordin command tabl subordin eval ot eval ot eval ot eval ot
DB/80 3 virtual handwrit vr ivan hiroshima hit washington box japan usa abstract present virtual collect interfac tool user annot document input text virtual environ graphic pen handwrit recognit virtual notepad explor handwrit modal interact ve paper report detail virtual notepad interfac interact discuss implement design report result initi evalu overview applic virtual handwrit introduct write ubiquit everydai activ idea scribbl comment margin book annot blueprint design plan type complet form enter queri note enter text ve imposs cut convent text input particip unabl effect commun textual inform ve walk virtual build evalu architect notic flaw user forc exit virtual environ order note observ access design plan import inform insight lost transit real virtual workspac occas architect sketch design idea correct design plan experienc ve virtual workspac user evalu experi phenomena interest separ workplac perform actual work present virtual collect interfac tool user annot document input text simpli write ve pressur graphic pen handwrit recognit virtual notepad explor handwrit input modal interact ve paper report detail virtual notepad interfac interact discuss implement design report result initi evalu overview applic virtual handwrit relat work major current research interact techniqu ve method direct voic gestur input prime wai interact ve import provid text input note capabl virtual interfac recogn research investig method tool enter manipul textual data ve remain voic input speech recognit view method input text text manipul edit difficult accomplish voic current voic recognit technolog suffer poor perform noisi environ limit sensit differ speaker voic accent virtual annot system develop al user add audio annot virtual object annot repres small marker attach select playback similar system develop harmon al drawback oral annot easi difficult edit search voic annot cumbersom task virtual keyboard suggest text input interact report copyright ieee publish march georgia person materi permit permiss materi promot creat collect work resal redistribut server copyright compon work obtain ieee copyright permiss ieee servic center hoe lane po box nj usa intl suffer lack forc feedback previou report attempt introduc handwrit bodi research investig applic handwrit recognit pen input convent interfac attempt appli pen input gestur interact environ sketch develop brown user quickli sketch scene draw predefin gestur pen system billinghurst al al pen tablet insid virtual environ ubiquit interfac tool creat manipul virtual object virtual notepad investig potenti virtual develop virtual collect simpl interfac tool note text input ve virtual notepad particip write annot document modifi enter distribut ve virtual notepad evalu virtual realiti emerg room environ develop human interfac technolog laboratori quickli prototyp evalu medic interfac metaphor data task evalu virtual notepad note annot medic imag basic virtual notepad figur present basic configur virtual notepad particip displai polhemu track posit orient user head hand user provid small track sensor regist posit virtual notepad posit real tablet rotat movement tablet physic world translat movement virtual notepad world major mode interact support user touch tablet virtual user hand provid user interact object ve usual particip touch real tablet real virtual notepad activ virtual hand replac virtual virtual notepad posit posit real pen real tablet virtual pen user constant visual refer locat entri point user draw physic virtual pen virtual figur physic setup virtual notepad user provid tablet pen note figur virtual notepad spatial regist physic tablet user draw physic virtual pen virtual notepad figur pen stroke remov wipe red line path notepad creat draw directli virtual notepad interact virtual notepad basic metaphor virtual notepad hand held notebook user write note modifi flip page find desir page notebook page notebook clean page note enter document imag user ad notebook discuss interact techniqu implement virtual notepad note virtual notepad tivoli electron whiteboard electron notebook virtual notepad digit ink recognit approach user enter note freeform captur collect ink digit ink approach particip note part virtual write size direct easili combin note essenti part process shortcom pure digit ink approach lack capabl text requir note input command paramet file input text virtual includ handwrit recognit command input function discuss modifi note virtual notepad mistak user note edit stroke manipul gestur provid correct modif input current implement virtual provid user simpl gestur remov individu stroke set stroke notepad remov unwant user simpli flip pen wipe surfac virtual notepad locat end pen cross stroke remov red line indic path notepad disappear user remov pen cue end oper inform evalu virtual notepad shown techniqu intuit easi capit everydai experi real pencil paper abil stroke suffici applic simpler remov rewrit faulti stroke modifi page virtual notepad user page virtual notepad desir clean page note scribbl imag document ad notepad document ad virtual notepad mode insid ve architect bring plan build ve build scan plan instruct virtual notepad add applic start document locat user simpli grab virtual hand virtual notepad bind perform intersect virtual notepad desir document press button virtual notepad figur user grab document ve virtual notepad intersect virtual notepad document press button figur user annot document imag ad virtual notebook digit ink approach easi combin note draw add document notepad oper user page notepad place ve accomplish touch virtual notepad virtual hand press button top page attach virtual hand desir locat ve manipul document virtual notepad virtual notepad set command user manipul flip add blank page remov exist page handwrit capabl virtual menu convent mean command input ve user simpli write virtual recogn handwrit recognit engin execut access page notepad user write add blank user write command chosen input distinguish note command user hold button pen write command ink color visual distinguish written command regular note command disappear design implement virtual notepad implement custom vr softwar toolkit develop extens world toolkit version sgi graphic equip virtual research displai polhemu sensor technolog corpor ii tablet handwrit input devic avoid electromagnet field polhemu sensor mount cm tablet handwrit recognit engin paragraph intern instal window nt commun sgi workstat protocol discuss implement issu virtual notepad implement virtual notepad page virtual notepad implement textur map singl polygon dynam updat cycl simul loop handwrit input user highest resolut tablet depend accur significantli higher current resolut textur user input filter remov excess data resolut virtual notepad lag write real tablet write virtual notepad initi evalu show current resolut suffici simpl note symbol row notepad mode virtual notepad user activ virtual notepad handwrit function physic bring pen close tablet tablet accur regist posit pen mm surfac virtual notepad activ pen close user touch tablet pen tablet virtual hand virtual pen virtual user write user remov pen work rang virtual pen hidden virtual hand figur page virtual notepad ve figur handwritten command flip virtual notepad page user write access page notepad object manipul convent ve interact abil pen physic contact tablet crucial seamless handwrit write pen natur lift write surfac finish stroke virtual notepad switch time user lift real pen virtual pen disappear stroke user accur reposit pen visual refer entri virtual virtual notepad support mode interact physic pen close touch virtual notepad posit user move pen draw virtual notepad pen contact virtual notepad switch handwrit user write lift pen tablet stai work switch virtual notepad back posit perform user fine control pen amount handwritten data enter quickli avoid lose design process collect handwrit filter remov excess data send result trajectori point ve render process notic latenc write tablet stroke virtual notepad evalu virtual notepad show user develop techniqu cope practic applic handwrit requir minim latenc investig approach reduc evalu discuss order identifi strength weak virtual notepad identifi problem inform evalu usabl system conduct handwrit start inform observ user consid method initi evalu virtual notepad preliminari evalu demonstr handwrit intuit modal interact ve interact paradigm emploi real world handwrit advantag skill user develop real world util environ virtual notepad support interact result intuit interact user virtual pen notepad enhanc perform presenc ve hand physic user rest hand tablet write exact registr virtual notepad tablet user easili unconsci move hand relat interact user reli kinesthet cue easili adjust small discrep spatial posit tablet notebook drawback real world metaphor emploi real world experi user base expect experi physic pen paper user expect write happen due latenc led practic receiv user learn write slowli perform significantli improv found visual realism import realism pen behavior exact registr virtual notepad rel tablet correct registr rel user bodi import user hold tablet front expect virtual notepad front due kinesthet cue mention user miss virtual write write uncomfort fatigu properli regist bodi size virtual notepad import paramet virtual notepad obscur ve forc user stretch hand uncomfort notepad make virtual notepad small make write requir accur pen movement prompt user tablet close face draw detail evalu import develop guidelin tradeoff virtual notepad evalu system found simpl set handwritten command quickli execut express easi task virtual menu widget addit elimin clutter control object handwritten command overcom shortcom direct manipul oper group subgroup object direct manipul method tediou task oper object start requir manual select object satisfi condit command languag user easili oper command virtual notepad handwrit implement virtual command interfac extend tradit direct manipul paradigm ve futur work present virtual collect interfac tool introduc explor handwrit interfac virtual user note insid experienc evalu phenomena interest user document physic workplac virtual workspac annot virtual notepad potenti transform ve place gain experi place real work potenti applic handwrit note includ model content creation coupl handwrit input recognit provid natur effici virtual command languag interfac enhanc tradit direct manipul paradigm ve tablet handwrit replac direct voic gestur mean interact ve handwrit addit combin exist ve interfac paradigm enhanc util result effect interact futur research improv add current function virtual notepad problem latenc address optim algorithm softwar architectur system current handwrit recognit limit work investig potenti inform evalu suggest addit gestur stroke manipul tool user magnifi part imag virtual notepad detail examin combin handwrit interfac virtual direct manipul voic gestur input investig acknowledg paragraph intern hit lab virtual world consortium support project individu mark jennif baldi edward miller contribut time effort stage project professor provid import critic corpor explain technic subtleti tablet anonym review comment refer web access virtual environ ieee comput graphic pp virtual annot system ieee ieee cs pp move object exploit propriocept interact acm pp integr perceptu symbol inform vr ieee comput graphic pp design virtual environ mcgraw hill pp virtual verbal commun virtual realiti european simul symposium sc belgium pp dynam organ ink audio notebook acm pp electron whiteboard inform workgroup meet acm pp interact paper digit desk commun pp interfac sketch scene siggraph acm pp virtual realiti content creation tool acm pp person interact panel interfac augment realiti pp interfac metaphor complex inform space monitor object prototyp medicin meet virtual global healthcar editor io press pp prototyp medic inform environ human interfac technolog technic report chunk phrase design human dialogu ifip world comput congress pp virtual realiti tactil augment treatment spider case report behavior research pp passiv interfac prop visual acm pp interfac commun pp
DB/81 3 detect traffic problem ilp saso dzeroski jacob martin molina carlo stephen muggleton wim van stefan slovenia belgium universidad de del spain depart comput uk abstract expert system support recent successfulli introduc road transport manag system includ knowledg traffic problem detect allevi paper describ experi autom acquisit knowledg traffic problem detect task detect road section problem occur sensor data induct logic program relat background knowledg road network essenti appli art ilp system learn detect traffic problem compar perform perform proposit learn system problem introduct expert system support recent successfulli introduc road transport manag direct kit artist gener goal real time traffic expert system support traffic manag center oper control action elimin reduc problem global state traffic assess global state system period receiv read sensor measur magnitud speed flow occup time sensor occupi inform current state control traffic signal traffic signal sidewai cm messag system interpret sensor detect presenc recommend solv reduc usual approach build traffic expert system knowledg base architectur support strategi reason oper approach requir develop knowledg base symbol includ specif domain knowledg transport manag citi system develop knowledg detect specif traffic problem traffic manag center includ basic inform traffic congest locat lack capac due accid excess demand collect sensor gener improv knowledg base problem detect expert system paper explor possibl induct learn techniqu logic gener knowledg traffic problem detect histor data paramet record sensor learn experi paper place context traffic manag expert system develop citi madrid barcelona system knowledg distribut collect knowledg base address specif task data incid problem predict recommend control knowledg incid detect formul domain expert concept descript languag ilp suitabl tool learn detect traffic problem context kind input learn process type background knowledg road present system object orient captur type road relat placement sensor individu road section type sensor read basic quantiti describ traffic flow occup type input detail section goal learn process identifi critic section problem sensor read road geometri technic critic section section road constrain road capac accid occur section past term accid critic section refer section section accid occur frequent note point practic real sensor data simul data experi reason real sensor data immedi manag reason miss sensor data broken sensor amount approxim simul make easili gener wide rang traffic problem accid artifici produc real interact microscop simul urban softwar tool reproduc real traffic condit urban network comput microscop simul approach mean behaviour individu vehicl network continu model simul time period remain insid system traffic behaviour model model citi barcelona develop simul model includ variabl real inform system record sensor calibr inform real system collect exampl accid congest due rush produc learn experi present paper remaind paper organ section describ detail background knowledg road network sensor data section describ dataset experi section present result appli ilp system section conclud discuss road network sensor data road network repres object orient fashion basic object road network section section refer road typic arrai sensor exist type highwai relat previou includ knowledg base complex road structur make section previou section link describ logic group section section form ten type link concept problem area measur experi inform section link static section type number sensor sensor lane link type link predefin set section relationship consid background knowledg learn process sensor provid continu stream send read minut refer minut minut flow car pass sensor occup proport time sensor measur sensor doubl measur averag speed car pass sensor minut measur sensor relat singl section flow sum occup veloc averag lane satur deriv quantiti defin ratio flow capac depend number lane part background knowledg system store inform prolog format prolog format consist fact predic instanc transform fact fact form translat fact form fact form translat fact en transform en dataset methodolog conduct preliminari experi claudien hand simul accid creat larger dataset dataset exampl congest exampl accid locat highwai gener simul learn task formul classif class congest nonc section moment time treat classifi class obtain dataset consist exampl altogeth background knowledg consist fact sensor valu fact road geometri background knowledg predic predic discret continu sensor measur discret alta media road geometri predic type call predic captur relat structur road state note relat class distribut frequenc major class show potenti ilp learn detect traffic preliminari experi tild dataset yield satisfactori perform skew distribut identifi main reason allevi randomli sampl section experi present remaind dataset exampl exampl exampl section dataset creat fold ilp system consid appli entir dataset rule produc shown domain expert time induc hypothesi exampl dataset record system appli induc test unseen case accuraci record fig incomplet list rule gener icl experi result ilp system appli problem formul icl tild oper learn interpret progol oper learn entail set reason slightli form rule induc liter bodi icl tild bodi progol rule icl progol learn tild learn logic tree tree rewritten rule list appli classifi list view list prolog cut set icl minim coverag default default threshold tild limit exampl lookahead fig set rule gener progol progol default set work posit neg exampl set rule induc predic posit exampl predic treat neg exampl posit exampl treat neg exampl rule classif procedur similar icl rule condit appli test number train exampl class cover rule sum class largest sum assign test addit ilp tree learn system comparison account sensor valu focu section access sensor valu neighbor section section previou problem transform proposit form easili loss inform default paramet rule induc progol tild figur number squar bracket number exampl cover respect leav icl rule progol rule congest cover exampl correct class exampl class leaf cover repres accid cover section rule congest progol rule accid leav accid icl tild resp tabl summar accuraci system unseen estim fold crossvalid number bracket standard error icl achiev averag accuraci fold standard error run time sun sparc ultra number rule system exampl dataset list tabl term induct icl tild faster progol domain term classif algorithm perform similar level faster ilp system accuraci lower accuraci achiev ilp system relat inform road structur sensor valu neighbor section ilp system achiev classif focu section import aspect suitabl induc rule expert system domain case traffic engin rule list figur inspect domain expert judg substanti number qualifi overli potenti cover exampl class tild tree rule fare lowest term depend rule list rule make difficult understand posit accid produc tild judg accid rule judg overli gener remain accid leav expect cover section tabl perform ilp system proposit system detect traffic problem system time accuraci rule icl progol tild accid tild state accid section satur low occup section high state accid section satur low occup high veloc section high accid accid accid nonc nonc accid nonc nonc congest congest nonc nonc fig logic tree gener tild fourth accid rule icl expect cover congest accid rule congest rule expect cover section remain icl rule judg correct includ rule section rule congest correct rule congest concern section type congest section satur section high veloc section low progol rule section judg rule congest ident icl correct rule congest state progol accid rule consid overli gener discuss present applic induct logic program domain detect traffic problem task address learn rule identifi road section accid congest occur past shown comparison proposit learn background knowledg road geometri requir ilp task simul data note simul realist calibr data appli ilp system problem compar perform term effici accuraci unseen case induc rule system perform roughli level accuraci concern tild perform term rule difficult understand ilp system slower perform term classif accuraci rule induc progol icl similar receiv similar mark domain expert perform level accuraci concern icl margin choic ilp system consid rule judg overli gener domain expert reason error identifi critic section area accid occur critic section constrain capac case previou section state critic relat ilp system compar problem identifi accid young male driver data consid proposit ilp system perform approxim level slower work remain work concern sensor valu ilp system consid handl real valu problem underwai practic issu import issu real sensor data simul data miss sensor valu problem dealt redund rule built issu address includ map induc problem detect rule expert familiar time seri sensor valu current valu domain traffic control hold challeng machin learn techniqu detect traffic problem step traffic manag suggest action allevi problem natur step exampl oper action detect problem hope problem suggest action allevi traffic problem address machin learn induct logic program acknowledg work support part esprit iv project jacob support flemish institut promot scientif technolog research industri wim van support fund scientif refer advanc interact microscop simul urban network vol system vol user manual departamento de de universidad de spain de lookahead discret ilp proc intl workshop induct logic page berlin rule induct recent improv proc european work session page berlin gener architectur traffic kit approach proc intl conf artifici intellig applic transport engin san ca model adapt traffic manag system transport part de logic set learn artifici intellig de clausal discoveri machin de van induct constraint logic proc sixth intern workshop algorithm learn pp springer sg prototyp expert system surfac street traffic manag control proc intl conf applic advanc technolog transport wa ilp experi detect traffic problem proc eleventh european confer machin learn berlin entail progol gener comput jr program machin learn morgan san ca van comparison ilp system proposit traffic data proc eighth intern confer induct logic program berlin volum articl process macro packag llnc style
Agents/82 1 model simul mobil agent dirk depart comput abstract softwar impli realiz softwar solv problem creat softwar compon move initi join group softwar compon model simul multiag system requir specif mechan variabl structur model agent model environ realiz variabl structur model includ mobil perspect singl autonom agent jame base parallel dev adopt abstract simul model simul place send messag concurr activ local distribut entiti reflect model current structur model simul coin equal perspect introduct definit agent subsum multitud facet agent delib combin reactiv delib capabl activ call requir frequent interact human suffici flexibl adapt chang environ chang requir agent softwar solv problem creat softwar compon move initi join group softwar compon agent model environ constitut framework aim support experi artifici intellig program tempor resourc constraint core librari provid mean descript variabl structur model preprint submit elsevi preprint march distribut parallel execut jame combin concept distribut system parallel dev idea variabl structur model domain system dynam exhibit structur phenomenon structur movement entiti salient featur area multipl agent internet reflect recent develop program paradigm specif framework support design softwar dynam system consist agent interact configur neighborhood continu migrat machin machin heterogen partial disconnect network control enabl movement code mobil agent programm optim requir network connect complex applic mobil agent term number node simul tool requir support test agent strategi paper explor simul layer jame realiz approach emploi simul mobil agent model design jame simul model design jame resembl parallel dev enrich mean induc variabl structur jame distinguish atom coupl model atom model set input state set output confluent transit output time advanc function intern transit function dictat state transit due intern time determin time advanc function extern transit function trigger extern input defin bag simultan arriv input event extern intern event coincid behavior model defin confluent transit function model commun extern input output produc state set variabl context jame agent integr model model repres agent state space atom model easili structur describ link modul delib belief belief agent reflect background knowledg summar percept environ desir goal inform receiv intent typic interpret agent plan decid place order rout visit intent depend desir belief current surround world apt chang frequent affect model determin agent agent forward job depend agent belief abandon longer execut plan seiz opportun valid belief determin effici effect movement effici move rout expect minim travel effect crucial correct address plan belong agent state determin transit function output function determin respect current plan activ agent direct environ atom model constitut frame describ agent coupl model model consist compon coupl compon interfac environ set extern input output set compon atom coupl coupl exist compon compon input output coupl model support modular hierarch model coupl model forward messag produc compon compon output coupl model transit unlik equip dev coupl model behavior structur jame mechan empow atom model chang structur model structur delet creation model build block captur phenomenon agent roam internet agent move place model jame deleg task coupl move applic mobil agent platform mobil agent system aim support design autonom capabl physic move commun network order perform specif servic bui ticket opera telescript commerci platform mobil agent inspir recent system mobil agent motiv desir util effici geograph distribut servic agent dispatch remot server site perform interact local complet task site return result continu journei visit site iter back interact negoti client round trip agent job compar messag pass remot procedur mobil code conserv bandwidth reduc latenc inform resourc oper process high level task mobil code render transfer intermedi data network superflu connect client server break perform oper affect contrast form mobil mobil agent flexibl autonom decid move compar remot procedur call distribut object mobil agent solv support natur solut problem context internet problem possibl mobil agent spawn plethora research activ commerci product architectur mobil agent system gener pattern place agent travel occupi special stationari agent servic place machin server instal accept incom start requir execut load agent state resum execut agent complex applic mobil agent simul system evalu chosen control cooper strategi minar colleagu explor mobil agent util updat inform static network role collabor agent plai context brewington colleagu util plan find optim rout travel compar result greedi search studi introduc currenc control consumpt resourc simul underpin state expect base work channel remot channel remot ii iii channel remot fig model move coupl model remot introduc social reput agent agent network explor emerg cooper electron market emploi built scratch agent network architectur illustr gener framework model simul multipl mobil agent simplifi excerpt network mobil agent roam assum client bui opera ticket price locat site time interact express model directli connect output input special agent sell ticket opera locat special agent deal transport ticket place remot special agent offer home remot site slow commun channel repres atom model channel entiti function client server time task necessit interact serv client assum low throughput expect task necessit close data intens interact atom model decid move model move agent environ structur access directli singl model local constrain conflict agent manipul concurr environ model creat add exist delet remov determin interact environ initi structur launch request model direct access region interest request repres specif type messag handl messag creat output put output coupl collect input bag evalu extern confluent transit function conflict resolv local model region interest distribut deleg strategi realiz variabl structur model presum convent ffl atom model equip method commit remov creat add model coupl model alter interact structur environ ffl awar identifi uniqu model ffl initi structur chang requir knowledg surround creation model requir inform model knowledg exist environ knowledg part belong model belief commun request initi structur ffl atom model equip default reaction evalu execut incom request chang model structur default reaction suppress freedom abil ponder follow environ distinguish activ agent agent mobil impli agent disappear locat reappear unalt intern state ident process move void fig send request extract output function ad remov model coupl chang interact addit possibl send model messag state return fig updat intern state remov coupl model intern transit function output function creat agent action reaction environ event encod messag desir rout part recipi interpret decid output forward messag put output model control messag messag depend coupl model output connect messag model receiv messag model forward messag address depend model forward happen automat malici element network messag reach move agent turn reach movement start creat messag accept add coupl model messag specifi desir coupl locat messag output function intern transit model updat state remov dev output function intern transit function form uniti output function invok intern transit serv fine moment intern transit function model exist coupl model ad coupl model time ensur model compon coupl model time movement complet depend channel simplifi model process messag random delai ad context coupl model remot fig model explicitli deal structur chang request extern confluent transit model adopt default behavior offer class includ class method extern transit function default method trigger automat arriv search input bag messag type interpret execut requir structur clean input bag default behavior model suppress case model decid explicitli react request request answer default dealt explicitli extern transit function structur execut successfulli inform part model belief part receiv messag complet port case add send mail jame extern confluent transit function typic serv entri point resum process state model state agent updat class extend state doubl default handl structur return class extend model state doubl remov request return fig extern transit jame state remov state agent journei start negoti bargain bs job migrat request add move model concurr simul mobil agent jame support experi multiag concurr act plan agent process respect calcul time space support effici avoid serial concurr activ agent time break model jame execut concurr distribut environ block updat time event case structur request atom child perform result time event empti endif set flag estim number incom event coupl model send messag end fig extract coordin simul adopt abstract simul concept parallel simul develop chow dev activ simul object model simul atom model coordin coupl model simul realiz commun concurr simul object emploi algorithm ensur transit place inform arriv strategi avoid costli undo effect previou messag previou messag includ structur cost exce gain emploi optimist strategi disadvantag conserv strategi distribut execut delib agent perform agent start reason simul time ongo research direct equip current execut optimist element structur initi atom structur execut coordin coupl model structur remov model concern coupl model complet level coordin stai transpar user standard messag type introduc addit messag messag confluent transit due intern transit directli execut extern confluent transit simul wait expect input arriv messag inform simul coordin input output event process messag commun transit complet subclass messag class kind structur chang place boundari coupl model notifi coordin confluent transit function compon complet time intern event field specifi requir chang term coupl refer compon ad remov list compon messag type exchang coupl atom model simul coordin coordin inform compon extern confluent event due messag includ number incom event expect coordin wait compon finish process event compon send messag moment finish transit coordin messag manag thread incom messag manag deal messag arriv messag urg updat time event decrement number notif expect compon semaphor expect includ messag semaphor count check evalu slot part coordin slot store structur request arriv messag compon updat compon arrang compon intern event empti slot determin coupl model produc output time intern event final send messag superior coordin model destroi creat structur chang complet coordin updat inform coupl model creat model exist model remov collect structur execut slot compon complet execut requir structur updat compon coupl coupl model structur delai avoid conflict structur place simul time compar creation delet realiz mobil slightli dyadic oper model send request output option intern confluent transit function move model ad model exist belong coupl model moment model charg output port messag type simul awar intent model move make coordin coordin execut coordin confirm remov automat moment transit function complet coordin remov model current interact context coordin coupl model remot receiv messag simul model messag specifi model interact realiz coordin respond updat compon coupl list add send current time simul receiv time intern event newli ad make simul coordin point view model add emb move model interact context actual coordin coupl model belong remot transpar distribut execut describ section distribut simul mobil agent specif java librari provid function model simul jame distribut simul jame emploi remot method invoc function java distribut execut simul simul coordin locat node implement parallel thread simul consist thread handl messag simul coordin locat node master server simul server client export simul servic simul servic import simul servic invok simul servic render simul servic fig master simul server cate direct messag pass commun simul coordin locat node realiz synchron messag pass server node abstract simul coordin reach compon coordin agent regist servic structur hierarch messag flow coupl model local coordin typic address compon superior coordin rare moment structur model move locat broker coordin model address regist initi simul run includ distribut model simul involv node node particip simul run program jame special node master server simul server regist master server make servic public master server store address simul server document current work load simul server frequenc poll estim work load check server aliv client start inform address master send model address regist simul server current master server determin partit model equal distribut work load term atom model simul server determin calcul number atom model plai major calcul coupl model neglig type client fig distribut model simul server atom model suspici calcul execut extern command experi execut plan agent tileworld gener plan easili sun ultra space hour complet hierarch partit facilit distribut master server send model partit address involv simul address client simul server process top model model hierarchi simul server send partit simul server continu distribut hierarch structur partit facilit procedur coordin coupl model child model commun easi replac local remot model connect simul server regist client client chang trace contact simul server opposit simul server feed inform directli graphic interfac client distribut simul server inform simul contact begin master server simul server hold top model point view master server distribut complet master server affect run simul plan master server involv redistribut simul simul server contribut run simul client initi creation simul dev terminolog abstract correspond model structur simul server form model hierarch compound lead simul server hold top model model execut concurr set simul server concept chosen student experi concurr agent design role client submit model master server distribut client receiv answer refer simul server hold top model initi creation abstract simul final creat root coordin stai client part client agent broker plai central role simul mobil agent model move model move physic move network model desir coupl concret model store temporarili agent broker locat client address simul server simul inform agent broker intent model move intern confluent transit simul inform coordin messag move coordin confirm prior messag simul send move agent object includ current state agent broker coordin destroi simul agent broker agent move expect futur model receiv model order execut requir send model requir coordin final creat simul move agent emb final destin perspect model move model network move send model request agent broker move physic network simul server simul server model move peer peer node involv move central server delai determin time simul progress remov interact context ad model interact context jump bean central server architectur simplifi track administr move agent central approach perform bottleneck huge number mobil agent move concurr frequent model network happen model move simul server agent broker fig move model client back simul server simul server hold agent interact context actual movement model mobil agent open environ movement close world limit simul server particip simul run model decid distribut model user move actual network move model form type process migrat transpar user motiv desir balanc load reduc commun physic network equal model stick place coordin commun remot model simul effici jame dev simul forc commun coordin mobil variabl structur problem describ analyz consist agent interact configur neighborhood continu chang address varieti approach context discret event variabl structur model gain lot attent year silent simul system focu creation delet model chang mobil approach support initi structur top composit hierarchi coupl model initi structur local coupl model aim support understand system emerg interact activ autonom mobil agent sequenti predecessor agent initi structur invok intern transit structur restrict direct agent intern immedi reflect agent locat initi structur restrict intern transit agent time initi structur conflict concurr structur occur distribut parallel set model initi chang structur time jame avoid conflict divid environ bare overlap region access model model commit creat add model coupl model belong access interact structur initi structur agent reli knowledg exist reach model execut structur boundari agent turn depend negoti agent direct request chang model structur model execut structur request decid base current state requir chang condit close relationship variabl structur model mobil agent visibl mobil agent explor perspect base parallel dev concept simul layer jame gener flexibl framework descript analysi mobil agent environ jame inherit dev modular model clear distinct model execut layer jame realiz variabl structur model includ mobil perspect singl autonom agent facilit natur simpl handl mobil user perspect due combin abstract simul concept parallel dev variabl structur distribut phenomenon mobil observ execut layer jame model move physic network due reason effici chosen architectur ensur movement entir distribut execut transpar user acknowledg bernd enthusiasm appli prototyp jame agent model simul refer busi mobil petri net technic report fj dynam structur discret event system specif formal transact societi comput simul bernardo pinto scalabl servic mobil agent rothermel workshop mobil agent volum lectur note comput page lf process migrat heterogen distribut system technic report dept comput dartmouth ru resourc control mobil agent intern confer autonom page acm ru mobil agent distribut inform retriev klusch intellig inform agent ac chow parallel parallel modular model formal sc transact comput distribut system concept design addison ad engin jump bean white paper genesereth ketchpel softwar agent commun rs ru secur multipl mobil agent system mobil agent secur wooldridg roadmap agent develop autonom agent db lang dt chang ibm aglet workbench white db lang oshima program deploi java mobil agent aglet bf mb distribut comput autonom object ieee di cf tschudin survei theori mobil agent world wide web page walker calculu mobil process inform mae cooper mobil agent map network hungarian nation confer comput john von neumann comput objectspac eh bs ja simul remot method invoc winter simul rasmussen simul social control secur internet commerc acm shoham program artifici variabl structur model discret event simul proc annual confer artifici simul plan high autonomi page san march arnold distribut maintain knowledg agent variabl structur environ proc annual confer artifici simul plan high autonomi page san decemb bp variabl structur model objectori simul intern journal gener parallel simul delib agent parallel distribut simul confer ieee comput societi press agent discret event simul european simul symposium octob sc je white mobil agent jm softwar page mit menlo infrastructur collabor mobil agent proc intern workshop mobil agent page mj wooldridg jen intellig theori practic knowledg engin simul modular model intellig agent system academ san
ML/83 6 logic program comput meet learn sato dept comput scienc tokyo institut technolog tokyo japan abstract describ recent attempt incorpor learn logic program step adapt softwar learn environ varieti type focu paramet learn logic statist learn em algorithm reinforc learn learn automaton attempt gener framework effici em learn combin tabul obtain result open prospect model complex phenomena introduct start assum reproduc intellig comput constitut great challeng human intellig centuri hand recal assumpt held ai research late seventi achiev write huge program huge knowledg base knew larg assumpt paper thought question light fact softwar ten million short intellig admit size program intellig recogn intellig complex feasibl build complex object ten million compon write program trap kind dilemma write huge program solut build note program smarter born abil write huge complet program learn behav intellig program call specifi thing happen peopl grant program chang spontan time posit neg side properti error error recur indefinit time condit program exhibit strike contrast human grow time learn mistak expect program lack mean learn design symbol construct defin mathemat speak lack learn abil common featur deduct symbol system program symbol system close relationship learn exist stochast formal languag hidden markov model hmm field speech recognit natur languag process bioinformat versatil model learn paramet kei step applic probabilist context grammar extens statist paramet learnabl linguist data turn knowledg notic bayesian graphic finit joint repres knowledg uncertainti real world level standard statist learn paramet symbol system work program dont mean express control data structur integr logic program paramet learn hope suppli build block ai result system abil express program abil learn time comput logic program learn paramet exist coupl problem approach basic semant notic basic principl hidden markov model stochast finit automaton transit made probabilist probabilist chosen alphabet output transit state transit supposedli observ probabilist context free grammar cfg probabl assign product rule nontermin product rule cq probabl assign rule probabl sentenc sum probabl deriv product probabl rule deriv joint joint probabl densiti function bayesian network graphic joint distribut direct acycl graph node random variabl condit probabl tabl repres node repres parent node valu topmost node tabl margin distribut joint distribut content section section base relat work omit due space limit logic connect gener rule thumb statist connect independ fundament differ carri semant logic composit mean function mean probabl function semant mix conflict semant section class logic definit program distribut fact semant call distribut semant consid logic program defin joint distribut infinit subsum standard model semant mention bayesian network establish distribut semant logic program section appli model section show basic comput probabl find comput path learn paramet data solv case talli discov learn algorithm call graphic em algorithm outperform algorithm standard paramet learn algorithm order magnitud section investig direct combin logic program learn incorpor reinforc learn reinforc learn method onlin train reward penalti show logic program incorpor learn simpl reinforc learn devic train behav desir reader familiar basic logic program probabl theori bayesian network stochast grammar reinforc learn learn automaton semant framework defin distribut semant plain place repeat definit sake program definit program db languag countabl constant function symbol predic symbol set unit set avoid mathemat pretend db consist countabl ground head intent definit repres etern law unit repres probabilist fact happen true happen introduc probabl measur pf set ground atom extend probabl measur set herbrand interpret set herbrand interpret set ground atom fix ground atom herbrand interpret correspond infinit seri ls os stipul ai true identifi direct product exist probabl measur pf construct freeli collect finit joint distribut prove satisfi condit exist probabl measur pr present infinit binari tree figur fig make collect finit distribut figur describ gener method construct practic assum probabilist atom independ repres probabilist choic set finit altern introduc atom form simul random assum countabl ground atom switch outcom trial gener primit probabilist event coin toss roll dice henceforth assum pf consist probabilist atom argument arbitrari ground term assum finit set ground term hold write ground atom true trial paramet probabl true ground term random variabl independ speak introduc famili finit tion xk defin pf product measur def base probabl measur pd set herbrand interpret construct extens pf make herbrand model semant logic program herbrand interpret defin set true atom defin ground atom sampl pf determin truth valu ground atom ground atom random variabl formal idea ground atom put introduc collect finit distribut der note satisfi exist probabl db measur pn extens finit sequenc atom binari vector joint tion countabl infinit dimens defin program db wrt pr db random vector infinit dimens distribut pd sampl realiz herbrand interpret distribut semant subsum herbrand semant logic program special case pr place probabl mass make specif set ground atom true defin uniform distribut unit interv herbrand interpret equal probabl cardin interpret real number isomorph probabl case interest distribut extrem reflect observ real world corpu characterist distribut semant summar applic logic program underli firstord languag countabl symbol function program arbitrari base model side iff tion predic tn coincid random variabl ground instanti transform preserv logic program ow regard ground atom close random variabl appli semant model section reinforc learn section explain execut logic program db logic program distribut pf mention goal execut wrt db special sld interpret differ usual action goal call ground case occur ms call time interpret ground term probabl instanti return fulli vector variabl length equal ariti vector occur execut unspecifi call return free variabl interpret instanti return successfulli bound variabl interpret unifi return successfulli unif success fail execut type call sampl execut correspond sampl statist learn logic program blood type logic program defin probabl ground atom aim express observ phenomena observ blood type ground write logic program adjust paramet distribut defin program close approxim empir distribut blood type type ab declar model logic program db figur blood type determin inherit blood type gene note emploi prolog convent string begin case letter variabl quot atom constant underscor anonym variabl appar db direct translat fig abo blood type program db knowledg blood type instanc blood type inherit gene blood type gene father repres event probabilist chosen inherit parent left gene father joint distribut set product pf pa def remain probabl inherit gene parent put observ blood type repres observ atom chosen ab concern estim hidden paramet observ atom reduc observ atom disjunct conjunct atom unfold instanc unfold si call explan call support set account mutual atom calcul valu determin maxim likelihood multipl observ maxim likelihood optim problem solvabl em algorithm iter algorithm ml estim face fundament problem em algorithm statist defin numer repres distribut em algorithm logic program deriv rigor mathemat foundat distribut straightforward deriv em algorithm logic program observ observ atom logic program db model distribut observ explan goal wrt logic program db minim conjunct ms atom support set set explan paramet set maxim likelihood comput em algorithm set paramet atom number time atom form explan procedur begin initi valu small posit comput repeat foreach foreach updat paramet comput termin converg model process logic program db observ summar case multipl observ search explan set em learn appli valu ms graphic em algorithm model logic program real problem scale step model process includ search explan prohibit time consum exponenti explan case search backtrack exponenti time circumv difficulti emploi search complet refut procedur init program comput result save tabl avoid comput goal search explan polynomi time case search time number length input case number length input adopt search yield favor side effect achiev section tm search share partial explan factor make repres support set compactli hierarch graph call support graph reflect share structur tion comput comput time proport number explan gt implement faithfulli formula reorgan comput introduc probabl logic program gener backward algorithm hmm insid probabl order share probabl comput set iff definit predic effici perform time proport size support graph optim comput introduc probabl logic program tion forward algorithm hmm probabl repres probabl context specif atom occur insid probabl probabl comput support graph comput time proport size graph em algorithm call graphic em algorithm incorpor insid probabl probabl work port graph omit descript graphic em algorithm detail combin shown search graphic em algorithm effici special em algorithm develop algorithm algorithm singli connect bayesian effici carri framework easi design algorithm find explan time linear size support graph gener ll detail explan ae found bit em singl design definit condit infinit domain viterbi algorithm hmm introduct support graph insid ti probabl logic program comput support graph effici solv task laid section learn experi report perform data graphic em algorithm conduct learn experi compar perform graphic em algorithm standard paramet learn algorithm real corpu develop atr corpu sentenc minimum averag length maximum length hand craft cfg rule nontermin develop atr corpu chomski normal translat cfg tr chomski normal form algorithm tr rule nontermin creat subgroup randomli sentenc corpu support graph wrt atr tr gener parser compar time iter algorithm updat paramet tm graphic em algorithm updat paramet atr tr result shown figur vertic axi show requir time horizont axi length paramet learn sentenc curv label left graph drawn algorithm cubic predict curv label gem graph drawn graphic em algorithm comment atr graphic em algorithm run time faster algorithm length averag sentenc length atr corpu curv obtain appli graphic em algorithm tr graphic em algorithm run time faster algorithm closer inspect reveal updat time graphic em algorithm linearli depend requir cfg chomski form graphic em accept form product rule improv version avoid appar redund comput instanc immedi graph enlarg version left graphic em requir cfg chomski form comparison made measur time updat paramet common gem gem fig algorithm graphic em algorithm graphic em algorithm time complex differ perform enorm appli real linear depend graphic em sentenc length suggest cope learn complex stochast grammar appli bigger corpu longer sentenc prism implement distribut model languag prism ac develop intend model complex phenomena interpret natur languag gene inherit interact complic social rule program extens prolog predic includ predic special predic manipul atom paramet prism program model util direct part declar system ms atom program model part definit program db defin program ms atom util arbitrari prolog program refer predic defin model part learn predic carri em learn observ atom mode execut sampl execut correspond random sampl drawn distribut defin model part comput probabl atom return support set goal mode execut predic implement graphic em algorithm simplifi search mechan underwai reinforc learn logic program reinforc learn turn attent data learn time idea reinforc learn reactiv adjust paramet receiv reward penalti random popular reinforc learn method base mdp agent expect randomli systemat walk action state maxim discount total expect reward paper adopt learn automaton mdp underli theoret framework affin logic program learn devic learn automaton refer reactiv learn devic work random environ select action proport choic probabl assign adjust gain reward profit action select point make random choic repeatedli action adjust asymptot converg stage reward action averag emb la logic program automat adjust paramet atom theoret question converg collect learn abil la ad logic program make reactiv environ call program reactiv logic program reactiv logic program intend model agent rich background knowledg work uncertain world learn environ behav optim reward return action random variabl assum environ distribut reward chang time leav penalti type conveni requir notion state state chang learn automaton learn automaton learn devic applic situat action probabilist maxim averag reward typic situat imagin plai slot machin lever pull lever win lucki lever yield maximum averag payoff bet coin repeatedli lever pull nth solv problem la action associ choic probabl ci chosen probabl time distribut action time express random vector ci chosen execut reward environ updat scheme reward give chanc select action ci random figur illustr la edg denot action di averag reward action ci el environ fig learn automaton scheme improv averag reward la current distribut averag reward time condit deriv type la call stochast automaton assum normal learn scheme scheme simplest denot expect di averag reward action ci random variabl function averag reward time condit expect side conclud im sep note form hold ks turn construct converg infinit ws prove converg bf set hs prove dec md initi probabl la network reactiv logic paramet logic program train la bed la program constitut dag acycl gener graph structur unlik singl converg behavior la introduc la class la organ dag discuss mathemat properti awar reactiv logic program requir gener graph multipl la connect analysi harder reason la part environ averag reward select action time learn la prevent deriv formula entail structur introduc la network express analyz reward fig la network la network connect dag node outgo edg la node incom edg call root la node descend node call leaf la edg label action probabl figur action chosen sequenti root la leaf la obviou reward simultan la path root leaf updat choic probabl probabl edg graph time averag reward time condit shape la network prove wrt root la set learn rate differ la trial system comput learn rate disadvantag compar common constant learn case prove condit reward binari la network moment hold wrt root la constant learn rate prove averag hold arbitrari la network larg la long common learn rate time decai learn la network gain reward averag time program execut disappoint slow decid constant learn rate set user la librari built librari call la librari predic manipul la logic program explain creat atom la attach equal valu rs fresh execut atom instanc set la output chicago list list arbitrari term ground term execut la current distribut output return adjust learn scheme choic probabl la list base line cost section reinforc condit tackl optim problem reactiv logic program expect repeatedli run paramet la automat reward choic sequenc eventu gain highest execut probabl view appli time comput seek correct answer answer correspond reward choic sequenc reason give reward answer comput obtain answer compar run program comput answer judg reinforc la involv comput invok criterion invoc call reinforc condit conceiv reinforc condit depend type heurist condit cost comput cs cost achiev ca averag cost past trial east present simpl reactiv logic program stochast optim problem problem find rout figur san francisco york travel cost adjac citi attach edg figur vari randomli reason trial task find rout give averag cost defin predic comput rout cost travel current citi york note condit state chicago detroit newyork fig east destin york travel travel travel cost return travel cost adjac citi consist basic cost random increment max determin cost cost tabl basic cost unit trial learn rate reinforc condit obtain rout recommend rout st averag cost learn converg depict figur plot averag cost past trial averag cost rapidli initi trial slowli theoret speak chicago detroit fig rout york averag cost learn rate constant la network account fact averag cost decai learn rate expect provid learn rate suffici small averag trial fig learn curv present attempt make program adapt ad learn abil order unifi comput learn semant distribut semant introduc logic program probabilist fact distribut semant gener model semant definit program world semant distribut appli semant statist model section reactiv program section shown effici model made graphic em algorithm work data structur call support graph learn experi shown graphic em algorithm combin search competit exist special em algorithm case run time faster pleasant appli distribut semant reinforc learn logic program learn show simpl reactiv program appli stochast search problem refer trainabl grammar speech proc spring confer acoust societi expert system probabilist network probabl theori logic logic mit reinforc artifici intellig graphic method paramet learn proc lnai effici em learn logic proc lnai foundat logic foundat statist natur languag mit em algorithm wilei survei partial observ markov manag scienc learn probabilist reason intellig morgan learn automata stochast lectur note control inform scienc foundat speech statist learn method logic program distribut proc languag proc model scientif theori prism ecai workshop machin asymptot properti learn automaton report dept comput tokyo institut algorithm em learn statist proc workshop fusion domain data statist abduct submit paramet learn logic program submit art mit learn predict method tempor machin transform logic proc resolut proc lnc grammar speech nition method proc meet languag inform process societi atr integr speech languag atr interpret telecommun research machin probabilist review open comput
DB/84 3 queri activ data repositori michael chang alan sussman joel saltz dept comput scienc maryland colleg md dept patholog john hopkin medic institut md abstract comput power storag capac process analyz larg volum dataset plai increasingli import role domain scientif research scientif applic make larg scientif dataset import dataset consist complex data applic retriev subset data applicationspecif oper perform data item retriev applic support manag system addit provid function defin complex datatyp scientif dataset runtim support provid optim storag larg dataset execut environ function involv oper paper describ activ data repositori framework build enabl integr retriev process dataset parallel machin system architectur function requir runtim support store process scientif dataset present system architectur perform result applic implement introduct book manag system stonebrak defin classif matrix manag system applic dimens classif simpl data complex data queri queri support word processor typic applic act dataset simpl data queri serv standard file system applic simpl data queri consist laboratori data relat research support nation scienc foundat grant subcontract arpa grant subcontract offic naval research grant maryland ibm experi provid nsf cise institut infrastructur award grant ibm manag system good match requir applic dbm categori act complex queri support data intens comput applic fall categori final dbm categori applic make complex data requir queri support manag system recent emerg system choic applic fall categori develop defin complex data type provid support queri extend sql notat observ import subset scientif applic fall complex data queri support fact process analyz larg volum data plai increasingli import role domain scientif primarili due rapid comput power storag capac typic exampl larg scientif dataset includ long run simul phenomena period gener snapshot state chemic transport simul estim pollut impact water bodi simul planetari simul sweep volum airplan wake simul archiv raw process remot data themat mapper modi archiv medic imag high resolut light ct scientif applic import characterist introduc challeng manag system support dataset larg terabyt function involv oper data retriev argu addit provid function defin complex datatyp scientif dataset special runtim support optim storag larg dataset execut environ function scientif applic minim program complex advantag featur achiev good perform import dataset recogn research commerci system develop manag visual focu lineag retriev visual dataset provid support analyz process dataset argument oper warrant common support applic process dataset decoupl data storag result ineffici due copi loss local applic develop implement support manag schedul process studi larg set applic process involv applic highli styliz basic process consist retriev subset input data select rang map input item output comput output item aggreg input item map output item paper describ call activ data repositori build enabl integr retriev process dataset parallel machin system architectur function requir runtim support manag scientif dataset applic make dataset custom process dataset applic styliz process structur provid support index data memori schedul process parallel machin user interact present system architectur discuss emploi runtim support present perform result applic implement motiv exampl satellit data earth scientist studi earth process data continu acquir amount earth scienc research devot develop correl sensor properti surfac earth typic analysi process satellit data ten dai year gener composit imag area studi gener composit imag requir project globe pixel composit imag comput select sensor map grid point varieti project earth scientist cartograph transform packag support project earth scientist specifi project suit map sensor data chosen gener imag composit project data sensor valu correct effect instrument distort topograph virtual microscop analysi data virtual microscop support interact view process digit data tissu virtual microscop realist digit emul high power light microscop raw data system captur digit scan collect full microscop slide high power digit imag slide effect slide multipl focal plane basic virtual microscop emul physic includ continu move stage chang magnif process virtual microscop requir project high resolut data grid suitabl resolut desir appropri composit pixel map singl grid avoid introduc spuriou artifact displai imag virtual microscop support complet digit dynam enabl mode behavior achiev physic simultan view manipul singl slide multipl user water contamin power simul tool crucial understand predict transport reaction chemic bai tool includ simul flow water domain chemic transport simul reaction chemic bai transport chemic simul time simul gener grid data point repres current statu simul region complet simul chemic transport simul coupl output simul transport chemic domain chemic reaction effect circul fluid veloc data gener contamin studi chemic simul coarser time step code grid chemic simul grid simul emploi run time step chemic transport simul requir retriev output data fall time step dataset store averag output project grid chemic transport project method develop texa austin requir manag larg scientif scientif applic make dataset import characterist dataset complex data item dataset point attribut space defin attribut data item data dimens spatial vari condit veloc magnet field applic typic data dataset dataset gener sensor attach satellit frequent consist number attribut telemetri longitud latitud sensor read earth time applic sensor data limit region subset band access data item rang retriev data item point fall region underli attribut space dataset applic specif oper perform data item retriev studi applic year process highli styliz share import characterist basic process step consist retriev input data item select rang map retriev data item output comput output item aggreg retriev input item map output item map input output item accomplish project input data point point output attribut space find output data item correspond project point correct output depend order input data item aggreg aggreg function correspond distribut algebra aggreg function defin grai al earth imag gener perform correct dai worth raw telemetri project data grid select measur provid view characterist place scientif applic stonebrak complex data queri support categori section manag system develop defin complex data creat integr system provid extend support tradit relat concept tabl sql queri develop repres dataset relat unlik relat tabl row column complex nest tabl scientif dataset logic structur repres case logic structur dataset complex simpl tabl complex type consist nest relat repres dataset complex type support attribut set attribut refer object repres dataset dataset repres measur scale consist nest collect dataset hierarch defin data element point space sequenc measur measur repres electromagnet dataset repres unstructur mesh point distribut space point connect set point formul virtual microscop applic section system provid appendix queri express extend version sql standard support complex data type function standard effort undertaken technic inform technolog iso ansi contribut mainstream system vendor oracl standard expect final major vendor manag system arena start incorpor partial implement draft standard system addit provid support defin complex data type runtim support provid function support scientif ffl optim storag scientif dataset larg rang hundr gigabyt multipl terabyt store larg amount data requir disk distribut collect tertiari storag facil runtim support distribut dataset effici disk effici parallel access dataset store disk farm runtim system provid support access dataset tertiari method cach dataset disk farm faster access ffl support index gener variant offer rang queri relat data structur suffici effici support rang queri complex dataset runtim system provid function defin complex indic lookup method suitabl rang queri data ffl optim evalu queri function oper effect manag oper requir complex queri optim techniqu function queri involv oper queri function benefit greatli parallel process desir perform comput data store ship larg volum data avoid runtim system provid support data memori schedul process parallel machin overview activ data repositori custom process dataset applic styliz process structur provid support index data memori schedul process parallel machin user interact achiev primari advantag abil integr data retriev process wide varieti applic abil maintain jointli process multipl dataset underli attribut space design make carri data aggreg oper processor tightli coupl disk develop set modular servic implement structur mirror wide varieti easi custom type process build version custom domain author custom provid function input access individu input data project point input output attribut aggreg multipl input data item map output item figur show architectur applic implement custom instanc full applic suit consist client implement specif gener request frontend translat request queri send queri process input data store queri consist ffl refer dataset ffl rang queri specifi region dataset dataset ffl refer project function map element dataset element dataset map element coordin attribut space underli dataset coordin dataset bs attribut ffl refer aggreg function describ element dataset combin accumul element dataset ffl specif output dataset updat exist send data network creat dataset ffl refer locat data item interest dataset persist storag client process sequenti output return client process graphic interfac end user gener request displai output return process run separ machin client connect gener request asynchron exist reliev interrupt client process request process consist applic provid part core consist queri submiss servic queri interfac servic applic implement domain engin specif receiv client request translat client request queri format understand exist applic client commun tailor queri plan servic queri execut servic queri submiss servic queri interfac servic meta data client client applic protocol protocol process applic custom meta data app applic index servic dataset servic attribut space servic data aggreg servic figur complet applic suit implement custom applic shade portion repres program part servic custom applic arrow repres interact darker protocol interfac defin lighter follow protocol defin applic shade bar attach data attribut space data aggreg servic index servic repres function ad domain engin part custom process client shown sequenti program client shown parallel program effici natur applic addit metadata store simpl client request involv applic metadata actual dataset store answer directli virtual microscop thumbnail imag store applic metadata applic applic receiv request process invok queri interfac servic acquir refer desir project function aggreg gener queri submit queri queri submiss servic shown figur metadata queri interfac servic store receiv queri submiss servic queri interfac servic valid queri queri valid make compon queri select index index desir input domain select aggreg function domain desir input invalid queri reject valid queri forward signal schedul polici determin queri queri pool queri group process simultan queri submiss servic overload send queri time group queri access data process simultan retriev share data multipl reduc system requir store dataset carri requir data retriev data process queri assum architectur disk farm attach processor dataset partit store disk shown figur process consist servic queri process queri plan servic select index index servic locat set data item retriev data aggreg conjunct knowledg amount resourc gener queri plan queri plan effect defin order data item retriev output item gener goal queri plan servic gener queri plan requir execut time note chang order input data item retriev affect correct requir applic queri execut servic receiv queri plan carri data retriev process queri queri execut servic dataset servic navig input data select project function attribut space servic map input data item output data select aggreg function data aggreg servic combin valu input data item map output data item output return client queri custom specif applic involv custom attribut space dataset index data aggreg shown shade bar attach servic figur custom achiev class inherit set base class virtual function expect implement deriv class ad entri modular servic requir domain engin defin class deriv base class servic provid implement virtual function addit inform newli ad entri provid domain engin store metadata index servic manag indic effici locat data item dataset rang queri persist storag includ index base class search virtual expect implement function ad index requir definit index class deriv base class proper implement search function domain engin specifi dataset store metadata metadata gener metadata expect fulli autom process futur system architectur describ attribut space dataset index servic data aggreg servic domain engin custom applic describ queri interfac servic queri submiss provid part process describ queri plan servic queri execut intern servic provid queri process attribut space servic attribut space servic manag registr attribut space project function attribut space number dimens rang valu dimens project function project point attribut space domain rang attribut space algorithm map dataset servic dataset servic manag dataset store util function load dataset expect dataset partit data chunk consist data item dataset data chunk retriev process queri process data partit chunk domain engin prior load dataset chunk size pick chunk size dataset attribut call nativ attribut space data item point nativ attribut space chunk minimum bound rectangl point constitu data item target queri rang desir store data item close attribut space data chunk dataset identifi nativ attribut list file data mbr placement inform data dataset object deriv dataset base class mbr inform placement describ chunk distribut disk option mbr automat comput function provid dataset object comput placement inform minimax algorithm emploi assign data chunk individu short span path algorithm order set chunk assign disk placement data chunk dataset determin amount disk bandwidth exploit data retriev minimax algorithm shown outperform declust cluster scheme rang queri space analyt simul studi index servic index servic manag indic dataset store index identifi dataset index attribut space construct attribut space refer underli attribut space index kei function index rang queri underli attribut return disk locat set data chunk data item fall insid rang queri creat index servic inform mbr chunk dataset physic locat chunk disk domain engin option index algorithm defin index object deriv index class virtual search function variant data aggreg servic data aggreg servic manag function aggreg encapsul data type intermedi result function final output gener function intermedi data refer consist set accumul element queri process hold partial result gener aggreg function input accumul underli attribut element point attribut space accumul process final output aggreg function accumul data type defin class deriv accumul base class accumul data type implement virtual function alloc accumul element memori constraint access individu accumul element fall insid region underli attribut space default implement function accumul consist regular arrai element evenli space attribut raster imag domain replac function custom implement output data type defin data structur final output gener process queri major task hold final result end queri defin order valu commun back request correctli interpret receiv output data type defin class deriv output base class aggreg function encapsul class deriv aggreg base class implement virtual function initi accumul element aggreg merg valu input data item accumul merg valu set accumul element match set accumul accumul desir final output data aggreg complet function merg accumul element queri execut servic process comput partial result local merg process queri interfac servic queri interfac servic function client find dataset function indic dataset valid queri ensur select index input dataset input output attribut space select project function match nativ attribut space dataset attribut space accumul select aggreg domain aggreg function input dataset metadata queri interfac servic obtain servic store shown figur queri submiss servic queri submiss servic accept queri applic valid queri interfac forward process schedul polici queri submiss servic decid queri queri pool time readi queri polici ensur fair queri avoid overload process reorder queri total requir set queri minim queri submiss servic simpl instruct time send queri queri pool send fix number queri head queue queri plan servic task queri plan servic determin queri plan effici process set queri base amount resourc queri plan specifi part final output queri comput order input data chunk retriev process schedul part final output comput size entir output data structur larg fit main memori function provid accumul data type partit accumul accumul block block fit memori indic index servic locat data chunk retriev disk process accumul block order data chunk retriev comput interleav data chunk resid disk sort data chunk resid disk file offset make retriev set chunk effici implement approach queri process input partit process queri replic accumul accumul block entir accumul larg fit process gener independ intermedi result local accumul data chunk store local final merg accumul process output partit accumul accumul data comput portion output assign process forward process strategi base includ distribut data output attribut placement input data chunk answer queri machin characterist rel cost commun disk queri plan servic implement input partit process implement output partit strategi hybrid variant workload partit strategi queri execut servic queri execut servic manag resourc system carri queri plan gener queri plan servic primari featur queri execut servic abil integr data retriev process wide varieti applic achiev push process oper storag manag process oper access buffer hold data arriv disk avoid level copi layer architectur storag manag process belong layer reduc queri execut queri execut servic overlap disk network oper actual process maintain explicit queue kind oper messag send data switch requir pend asynchron commun oper left oper queue poll asynchron function initi work expect buffer space data chunk retriev process pipelin fashion queri execut servic return final output queri destin queri queri execut servic return output socket interfac interfac socket interfac sequenti interfac parallel client runtim support system system architectur desir function manag larg scientif dataset section infrastructur design make carri data aggreg oper effici architectur dataset creat ad dataset servic servic mechan distribut dataset disk improv data retriev perform index servic variant perform rang queri user defin indic index method user defin project aggreg function attribut space servic data aggreg servic function function add capabl process dataset core system kei compon runtim support mechan support oper dataset queri repres complex type tabl includ nest record nest inherit mainstream current implement custom class inherit set base class virtual function expect implement deriv class provid complex queri optim implement queri plan execut strategi base process structur set applic oper dataset achiev good perform carefulli schedul oper make good system resourc parallel machin addit tool integr servic servic provid exist process statement descript autom custom runtim support data type process sophist optim queri access process dataset support underli mechan tool user applic queri dataset languag addit direct specif result servic implement test ibm maryland maryland consist process run aix disk attach process node implement compil ibm compil queri execut servic interfac mpi underli commun layer show effect custom servic provid function applic section present preliminari perform includ comparison origin system titan virtual microscop respect counterpart implement focu perform queri execut servic execut time section show queri process time queri execut servic includ time send output client satellit data titan titan imag store remot oper maryland gb data sensor nation ocean administr satellit titan dedic sixteen process node interact java gui client fifteen node process data retriev node disk node store declust cluster algorithm provid section place data chunk sixti disk data item dataset refer instantan field view consist attribut kei attribut coordin data attribut observ part electromagnet spectrum data chunk consist prior work shown titan deliv good perform small larg queri custom implement wrapper function directli call comput kernel titan includ custom default function invok project function aggreg function data chunk sampl queri evalu perform implement titan queri select correspond area world sampl queri australia africa south america north america global input data size mb mb mb mb gb tabl total number byte read resolv titan sampl queri system australia africa south america north america global titan tabl queri process time titan period gener composit imag valu output pixel obtain comput normal differ veget index correct valu band select map output base clariti angular posit satellit observ made tabl show total amount data read disk resolv sampl tabl show queri process time titan implement note time experi result report section obtain fourteen process result show perform close titan tabl show time implement spent process data chunk comput commun merg accumul element commun time spent submit poll disk read softwar overhead tabl show implement spent time process data chunk incur overhead comput commun titan comput overhead wrapper turn invok titan comput function commun overhead due fact titan process handl queri estim size incom messag process receiv messag multipl simultan queri accur predict messag size titan processor post receiv earli current implement backend probe size incom messag post receiv redesign commun subsystem reduc commun overhead queri process time includ time gener queri plan system total time comput commun titan tabl queri process breakdown titan global queri system total queri process time comput vm tabl queri process time vm gener queri plan index read disk titan gener queri plan distribut plan node gener queri plan index defin titan index share titan titan load index disk memori read index memori queri discard locat data chunk interest multipl indic cach multipl indic memori significantli reduc amount memori node queri process index dataset load memori implement virtual microscop virtual microscop system abil access high high resolut digit imag entir patholog sampl imag displai local remot client data chunk consist pixel size kb data chunk distribut maryland node default disk node vm queri specifi digit region interest desir magnif displai output imag comput subsampl input imag commun server process requir current implement virtual microscop sampl queri retriev data chunk total evalu perform implement shown tabl queri process time slower vm virtual microscop simpl subsampl comput perform data chunk larg percentag queri execut time vm spent wait block disk request complet comput place system main high overhead due excess virtual function invoc incur implement reduc overhead applic requir comput data current implement virtual aggreg base class data aggreg servic domain engin overload default data chunk process function default data chunk process function invok function servic input element properli aggreg input element accumul gener handl dataset function regist disadvantag extra overhead invok virtual function avoid overhead function domain engin option provid effici implement data chunk process function custom aggreg base class virtual microscop implement optim interfac improv perform significantli earli implement origin interfac time slower current implement work elimin function call overhead implement applic requir larg amount comput order answer function call overhead case virtual overhead perform compar fulli custom implement experi virtual microscop show sophist compil optim optim perform custom process function requir applic function virtual microscop limit simpli serv imag magnif futur project virtual microscop server infrastructur involv imag imag complex imag process requir comput perform data chunk offset seemingli high cost observ current vm implement water contamin bai simul system coupl simul chemic transport simul implement coupl simul call develop armi corp engin model circul pattern coastal chemic transport call develop texa institut comput appli mathemat texa austin simul simul flow water model unstructur chemic transport simul simul transport chemic grid chemic transport simul output simul simul transport chemic transport chemic affect comput flow valu gener chemic transport simul simul chemic transport simul coarser time step simul veloc elev valu time step simul averag gener initi valu time step chemic transport simul averag oper involv comput gradient elev weight averag veloc valu time step averag veloc elev valu grid point convert comput transport chemic simul edg grid chemic transport simul project code develop custom retriev process output simul chemic transport simul output simul partit chunk chunk veloc elev valu set time step subset grid point grid model bai grid point chunk grid point time step simul chunk distribut disk applicationspecif algorithm chunk sort respect minimum time step valu chunk ascend chunk assign disk fashion disk attach processor equal number chunk cover set time step spatial bound box chunk locat chunk creat chunk queri chemic transport code time period total queri process time comput commun sec sec sec sec tabl queri process time specifi time period dataset interest perform retriev averag veloc elev valu dataset time step fall time period interest processor retriev chunk store local disk creat partial result partial result exchang processor creat final valu result chemic transport simul tabl show queri process time queri execut servic backend run processor disk processor sixteen processor disk processor chemic transport simul sequenti program run host processor ibm time result includ time send result chemic transport code queri time period interest time step time number process total queri process time small small queri reason comput time linearli due overhead initi accumul arrai current implement accumul arrai replic processor processor creat full accumul arrai initi overhead commun commun time spent submit poll disk read system overhead larger percent total execut time small queri larger queri relat work runtim support librari file system develop support effici parallel environ system analog plan data movement advanc minim disk access commun attempt optim perform mask latenc comput commun schedul oper base complet disk similar strategi differ system wai carri rang queri direct irregular spatial index satellit data consist strip attribut digit data store heterogen collect spatial regist water contamin simul data repres unstructur mesh simul region bai comput integr part framework user provid procedur carri data preprocess requir comput perform parallel commun collect interfac provid parallel data process begin entir collect oper complet data placement algorithm optim rang queri integr part framework analyt simul studi shown algorithm exploit disk bandwidth entir evenli partit workload processor disk extens system tailor support applic addit function provid relat system provid support ad storag data access oper incorpor access method oper comput model gener relat model system support larg number applic make queri optim difficult number research begun address problem implement restrict process structur mirror process applic process dataset good perform achiev care schedul oper good util system rearrang algebra oper relat queri relat system futur work present customiz parallel integr retriev process dataset servic provid provid perform result applic result show good perform applic discuss runtim support dataset system desir includ optim storag retriev larg parallel process comput manag resourc effici queri execut parallel provid effect runtim support support complex queri scientif dataset current implement set implement custom wide rang initi effort develop techniqu tool integr servic servic provid exist goal defin standard wai integr servic exist system user applic oper dataset languag addit direct runtim system process optim continu experi plan algorithm cost model queri plan servic investig techniqu extend tertiari effici store process dataset larg fit secondari storag method reduc overhead incur applic implement virtual extens aggress compil analysi compil optim techniqu refer sussman tune perform parallel applic fourth acm workshop parallel distribut digit dynam virtual microscop annual fall symposium american medic informat nov maryland technic report wise extens manag system ieee transact softwar nov medic data manag system vldb page aug seeger effici robust access method point rectangl page saltz framework optim parallel scalabl parallel librari page ieee comput societi oct exodu extens dbm overview read page morgan san cole user guid version technic report armi corp engin water experi saltz customiz parallel data acm sigmod mar saltz infrastructur build parallel system data merg intern parallel process symposium symposium parallel distribut ieee comput societi apr saltz high perform intern confer data page ieee comput societi apr wheeler project method construct mass conserv veloc field comput method appli mechan report tx ubiquit acm comput june corbett parallel file system acm transact comput aug yu vldb page morgan kaufmann saltz data parallel runtim librari eleventh intern parallel process symposium ieee comput societi apr melton acm sigmod web chang idea applic vldb page virtual microscop annual fall page american medic informat oct pirahesh data relat aggreg oper gener intern confer data page feb guttman dynam index structur spatial search page june pirahesh extens queri process starburst page june high perform portabl parallel file system acm intern confer page juli ibm informix dynam informix tucker analysi global veget meteorolog satellit data intern journal remot page woelk architectur system read chapter prototyp page morgan kotz multiprocessor symposium oper system design page acm nov land satellit themat mapper tm srinivasan land cover dynam investig parallel comput intern remot quantit remot scienc page juli integr queri visual explor larg dataset page advanc circul model technic report depart armi corp dc dec ma zheng visual airplan wake page oct moder resolut imag moon saltz scalabl analysi declust method rang queri ieee transact knowledg data nasa goddard distribut activ archiv center advanc high resolut global area coverag data land kotz parallel file system intern confer page acm nation trial feasibl assess arch oracl oracl spatial data effect graviti instabl aiaa dec winslett collect supercomput san dec ieee comput societi press ramakrishnan case enhanc abstract data type vldb aug sussman design evalu earth scienc parallel jan sudarshan system concept complet refer scientif engin comput seri mit datablad modul stonebrak brown track great wave morgan kaufman implement postgr ieee transact knowledg data mar tanaka configur solar wind flow magnet field planet magnet calcul journal oct extend method access section arrai scientif winter optim parallel applic ieee june gener cartograph transform version davi progress report human jan appendix virtual microscop applic ordbm formul virtual microscop section base definit exampl descript dataset creat row type pixel val creat arrai imag pixel creat tabl descr dt thumb imag imag creat user defin type pixel store pixel imag arrai complex data type constructor row arrai note data constructor arrai creat imag arrai pixel exist imag type creat set list constructor illustr tabl queri complic arrai constructor arrai type sake simplic clariti tabl imag creat creat tabl user defin function map aggreg clip subsampl process imag store creat function clip integ integ integ integ return imag select img creat function subsampl integ return imag select img factor factor sampl queri find imag store select retriev portion imag produc output imag magnif select queri correspond standard virtual microscop client browser queri
Agents/85 1 chapter verif agent theori depart comput uk dixon depart comput uk schmidt depart comput uk michael fisher depart comput uk ch meyer institut inform comput netherland wieb van der hoek institut inform comput netherland abstract chapter method autom reason system concentr core specif framework model intellig agent behaviour discuss advantag approach suggest wai extend variant cover framework agent agent modal autom reason introduct agent essenti tool understand implement complex softwar system complex compon intellig ration agent system design applic higher level abstract order describ reason number theori ration agenc bdi linder framework framework repres complex logic addit agent basic agenc ration form basi formal method theorem prove vital import agent autom theorem prove examin properti theori comput theori formal theorem prove import develop verif techniqu lead agent theori formal method area share similar logic properti agent theori inform repres agent belief modal logic knowledg modal logic dynam dynam activ tempor dynam motiv repres agent intent goal modal logic predomin approach combin modal logic definit modal logic mention chapter refer reader agent theori short result proposit dynam logic kd proof method develop agent theori bdi framework method exist framework aim paper examin approach develop autom proof method framework studi approach problem proof complex proof method fusion pdl base translat classic logic term fusion ctl proof method direct clausal resolut combin logic approach show verifi properti system repres theori ration fundament differ techniqu approach involv translat modal dynam logic aspect classic logic carri proof defin specif order classic resolut approach retain structur develop resolut rule combin logic branch time tempor proposit dynam repres agent dynam behaviour basic element logic linder meyer formal system reason behaviour ration agent inform attitud basic framework linder express agent fact modal standard modal inform compon logic full system epistem doxast attitud extens studi van der equal foot inform languag encompass dynam compon start atom action ac composit action sequenti composit test condit repetit investig notion choic der hoek framework fit reason precondit express agent perform action opportun result paper concentr variant framework defin core subsystem provid termin infer system logic extend modal logic fusion logic kd modal logic formul languag disjoint set modal base fusion smallest modal logic set axiom ax ax union ax modal oper interact base languag framework defin primit countabl infinit set proposit set ag agent finit subset posit countabl infinit set ac atom action formula defin induct atom proposit proposit formula provid proposit result proposit provid agent action formula proposit id atom action action provid action proposit natur number unari implicit connect includ usual connect proposit dual goal intend goal notat convent paper denot atom action agent proposit variabl formula variabl term function predic symbol atom liter semant logic formula base interpret set map proposit variabl subset ag ac binari relat subset relat agent serial relat relat agent ag world natur wg fw fw fw fw fw fw tabl relat set agent theori motiv compon semant logic relat set extend ag relat set standard dynam logic semant formula logic defin iff iff iff iff iff iff iff iff iff ac hold true formula satisfi iff interpret world tabl transform rule core logic logic defin includ featur refer logic paper make simplifi assum exclud unbound repetit oper implement interact dynam inform compon fragment logic call core logic section discuss simplifi assumpt relax proof translat translat approach modal reason base idea infer modal logic carri translat modal formula logic convent theorem prove techniqu translat morphism exist properti vari extent map modal logic firstord decid fragment logic modal formula comput behaviour theorem prover present procedur satisfi problem core logic consist function reduc complex action formula atom action translat formula fragment transform fragment logic clausal class dl procedur dl reduct complex action rewrit rule tabl similar rule function map formula qk atom proposit qp unari predic symbol uniqu qk predic symbol uniqu binari predic symbol uniqu repres relat semant tabl translat morphism core logic normal form straightforward rewrit relat defin rule confluent termin normal form logic absenc unbound repetit action formula lemma formula core logic occurr unbound repetit oper logic action formula translat logic translat recent special case introduc conceptu simpl procedur extens order resolut compar procedur featur approach absenc loop check mechan transit modal logic loss gener assum modal formula negat normal form defin translat function tabl formula set subformula form formula qk qk binari predic symbol uniqu modal oper addit definit state symmetri transit note translat preserv structur core subformula occurr core formula associ subformula occurr base close correspond translat morphism semant core logic prove theorem formula core logic satisfi iff firstord satisfi proof sketch problem theorem fact ensur relat model relat case relat modal model problem overcom line ut advantag translat morphism de fact formula core logic easili belong number solvabl includ fragment logic guard fragment clausal class dl dl iff liter nest function function term variabl binari liter function variabl set belong class dl iff dl transform dl present structur transform formula clausal form transform translat formula core logic set belong class dl set posit formula posit denot subformula posit result replac posit polar subformula defin occurr subformula polar occurr subformula occurr subformula posit polar insid scope number neg polar insid scope odd number negat structur refer associ element predic symbol liter free variabl symbol occur symbol equal formula def def definit formula def def posit polar def neg polar def def base def induct defin def def def def def maxim respect prefix order posit definit form def subset posit subformula theorem formula satisfi iff def def comput linear provid includ posit subformula occurr recal subformula occurr core formula associ subformula occurr core formula defin set posit subformula show lemma formula core logic clausal form def dl resolut calculu clausal class dl procedur formul resolut framework resolut resolv factor fcg tautolog variant fc dg fcg fdg resolv factor deriv rule gener unifi liter strictli respect maxim respect liter select call posit neg implicitli assum common variabl gener unifi liter select respect tabl infer rule calculu admiss order select function admiss order total strict order ground level liter hold extend level canon manner select function assign possibl empti set occurr neg liter restrict select function calculu consist gener rule repres finit deriv altern rule tabl describ deriv tree expand leav deriv set finit order tree root node set tree construct applic rule leav split resolut appli order assum resolut factor infer comput branch deriv path deriv call close branch iff set empti call open branch deriv refut iff path close branch deriv call fair path limit case deduc note finit path limit equal calculu complet compat gener notion redund addit nondeterminist simplif delet rule appli suffici tautolog variant elimin set deriv theorem fair deriv set path limit satur redund satisfi exist path limit satisfi unsatisfi path set empti procedur dl procedur dl obtain order defin order term defin deeper variabl occur occur deeper defin fs ft multiset extens neg liter denot multiset posit liter denot fag defin order liter iff theorem theorem set dl order liter defin admiss deriv base termin time doubl exponenti size signatur procedur core logic put compon procedur core logic formula core proce rule tabl translat result logic translat morphism transform result formula clausal form def standard form final appli resolut calculu order set obtain theorem formula core logic clausal form def deriv base termin time exponenti size signatur unsatisfi iff branch fair deriv root close proof complet consequ lemma theorem note theorem state deriv set class dl termin time doubl exponenti size signatur basic due fact doubl exponenti upper bound number deriv fact applic infer rule redund elimin step requir polynomi time size deriv set set obtain translat formula core logic obtain singl exponenti upper bound number deriv complex infer step redund elimin step remain provid upper bound state theorem ut comput transform rule tabl requir exponenti time size exponenti size translat logic transform clausal form requir linear time size signatur result set linear size theorem satur requir exponenti time size signatur procedur requir time doubl exponenti size variat approach show satisfi problem core logic obtain procedur core logic requir polynomi space modif requir ensur applic function formula form result formula subformula occur achiev replac proposit variabl ad definit modal section definit reduc formula result transform number subformula occurr form arbitrari ag atom action occur subformula introduc proposit variabl repeat time transform consist seri rewrit step occurr modal oper normal form comput result transform satisfi origin formula comput time polynomi size size quadrat size target logic translat notat variant alc acycl tbox satisfi problem theorem satisfi problem core logic space optim procedur alc acycl base translat refin resolut calculu select function order develop line altern procedur polynomi space worst case proof clausal tempor resolut simpl observ pdl framework similar branch time tempor logic attempt simpl ctl branch time tempor logic repres dynam compon core epistem compon core logic remain unchang clausal theorem prove appli branch time tempor logic fusion ctl iff iff iff iff timelin extend iff timelin extend iff iff iff exist iff exist iff iff timelin tabl semant ctl subsequ page give translat core fusion ctl translat formula ctl normal form resolut procedur translat ctl begin present syntax semant ctl countabl infinit set proposit variabl set ag agent formula ctl defin induct ctl proposit variabl ctl ctl ctl ctl formula agent ctl formula semant ctl formula set state tree structur set state relat state uniqu root node exist infinit discret sequenc index natur number note timelin correspond run halpern vardi halpern set tree set timelin extract union infinit branch start root node tree tl set timelin pair tl timelin tempor index set set timelin construct timelin coincid point atom proposit proposit variabl uniqu tabl translat morphism timelin extend coincid set point interpret ctl structur set infinit distinguish tree relat map subset semant ctl formula defin tabl formula interpret timelin extract distinguish tree satisfi model interpret timelin extract distinguish tree valid assum formula core logic rewrit rule figur defin translat core logic fusion ctl tabl theorem formula core logic satisfi iff proof satisfi formula core construct ctl model satisfi model world logic formula defin ctl interpret relat pt associ world point relat world iff point pt exist point extend pt timelin relat element iff timelin relat element pt proposit iff finit timelin exist point timelin exist extend construct point extend infinit timelin set newli construct point pt pt atom action agent set path construct timelin fusion limit close result emerson fact construct timelin note construct ad relat ensur infinit timelin induct structur formula core logic show satisfi show formula model fusion ctl equal formula core logic construct model function world map point world satisfi point coincid iff exist world point iff exist world proposit iff show induct structur formula core logic satisfi point ut transform separ normal form formula fusion ctl rewritten normal call separ tempor modal aspect formula gener form form relat defin term oper start step hc step hc true true liter modal liter involv modal oper disjunct modal liter knowledg step involv label index form hc similar skolem constant logic index path translat formula translat normal form formula translat step ensur refer path annot index outer oper surround conjunct omit conveni conjunct drop set denot transform formula ctl theorem formula ctl satisfi iff satisfi comput polynomi time proof proof proce line proof fisher formula ctl show model transform model vice versa ut resolut calculu present resolut calculu contrast translat approach previou calculu work directli formula infer rule divid initi resolut knowledg resolut step resolut tempor resolut denot denot liter resolv initi initi resolv disjunct liter true start start start start start knowledg resolut appli rule base modal resolut system introduc gener appli resolut rule liter knowledg liter knowledg relat modal oper true true true true true true true true true true true true function defin disjunct liter modal resolut rule requir explan distribut extern oper surround oper obtain true disjunct liter modal liter axiom delet disjunct modal liter obtain requir resolv final requir rewrit rule obtain set liter step tempor resolut true true disjunct liter resolut consist applic standard classic resolut formula repres constraint moment simplif rule transfer contradict state constraint previou state pair step resolv rule hc hc hc hc hc step resolv liter disjunct index carri resolv give resolut rule true hc true hc contradict state rule gener extra global constraint true path oper rule state satisfi moment time contradict satisfi moment time constraint repres tempor resolut aim resolv set impli set effect interact oper make definit rule translat remov outer level resolut set impli occur contradict hc hc hc hc hc hc case resolv ensur mean eventu satisfi condit trigger eventu satisfi resolv result eventu path similarli resolv hold path set test step perform perform knowledg step resolut simplif termin note resolv continu step select eventu side search set tempor resolut rule appli resolv subsum detect translat step resolv found termin declar step simplif subsumpt carri deriv theorem set deriv unsatisfi iff refut tempor resolut procedur proof proof proce line proof dixon fisher graph construct repres set delet portion graph model construct shown correspond resolut rule empti graph obtain set unsatisfi ut procedur core logic put compon procedur core logic formula core proce rule tabl translat result fusion ctl transform result formula final appli tempor resolut procedur set obtain theorem formula core logic deriv unsatisfi iff refut tempor resolut procedur proof lemma theorem ut ev block world section small block world problem logic show approach section solv problem make specif make implement oper exclud core logic deal implement translat extend translat morphism approach extend translat morphism discuss appropri definit section adam live block world block describ block top block block top atom effect ev abil perform action ident equal axiom describ effect perform put action block longer clear axiom describ properti block world remain unchang perform action block clear equal block put arbitrari block ident leav clear axiom remain true irrespect action perform axiom element denot adam ev recal core logic identifi axiom tower defin initi condit ke ke ke ke prove axiom impli ev adam put block block implement tower show assumpt ke lead contradict problem present order finit domain easili form ground instanc axiom specif express denot proposit variabl uniqu atom specif due axiom state equal inequ block remain ev elimin equat instanti axiom solv ev translat show obtain refut specif ev block world translat approach conjunct axiom cl dl refut axiom origin squar bracket left recal unari predic symbol uniqu proposit variabl simplifi notat write note translat axiom left conjunct existenti quantifi lead introduct skolem function transform clausal normal form unari skolem function skolem function skolem constant introduc ke ke ke ke ke ke ke ke ke ke ke ke ke ke ke obtain refut cl dl theorem prover implement resolut framework order path order path order compat strict subterm procedur theorem mark maxim liter index infer step restrict liter find refut observ consist subject split introduc branch search unit ke element set unit element set set directli obtain contradict set replac posit liter maxim serv posit resolut step deriv ke situat block form tower remaind deriv show assumpt lead contradict deriv note liter skolem term origin neg remain liter origin posit liter skolem term constraint situat perform action situat remain liter final argument constraint situat liter skolem term deeper remain order restrict resolut infer rule restrict applic resolut liter part deriv consecut elimin liter resolut infer obtain liter maxim time relat action posit infer step elimin liter skolem term obtain part deriv establish situat perform action result situat true deriv ke deriv ke ke ke ke deriv ke solv ev tempor resolut specif problem written formula normal form instanti written rule true true conjunct initi condit proposit ke written start true ke similarli conjunct ke ke ke ke prove ke firstli translat negat contradict specif rewrit normal form introduc variabl replac definit start true kei true true true appli rule instanti true hc obtain hc applic step result true appli rule instanti obtain hc applic obtain true resolv obtain true resolv initi condit obtain true final resolv contradict start obtain core logic section present method modal reason restrict core logic method extend cover larger fragment put work complex environ block world full framework defin section extend function defin rewrit rule tabl reduc formula occurr action formula formula logic absenc unbound repetit oper action formula translat approach translat function modifi atom repres relat semant clausal tempor resolut approach simpli repres proposit variabl uniqu altern approach incorpor commit oper exploit idea exclud present full kd modal incorpor translat approach present difficulti translat function extend binari predic symbol uniqu modal oper addit conjunct agent ensur binari relat serial clausal tempor resolut approach addit core requir extens normal form addit sound complet resolut rule kd modal implement oper exclud core logic interest oper logic recal semant defin iff ac abbrevi hold find atom action agent perform sequenc perform sequenc possibl lead situat true prove requir find plan bring situat true intent includ implement oper logic plan problem logic turn intuit slightli mislead give analysi implement add modal oper languag semant iff iff modal oper modal dual modal formula subformula occurr denot formula obtain replac subformula occurr formula lemma formula logic posit subformula occurr neg subformula occurr form satisfi iff satisfi formula logic neg subformula occurr unsatisfi impli unsatisfi vice versa proof lemma fact existenti quantif atom action semant definit restrict atom action occur refer infinit suppli atom action ac ut posit occurr give indic exist plan map translat morphism defin section correct posit occurr neg occurr straightforward translat neg occurr correctli reflect semant languag combin oper master occur surround conjunct posit occurr show correct translat extend model transform sketch proof theorem straightforward translat neg occurr clear current semant definit fail correspond intuit understand implement accur semant definit restrict choic atom action agent perform bring situat finit set set atom action occur formula ac denot finit set atom action occur formula modifi semant definit iff ac specif formula case existenti quantifi definit replac disjunct action ac ctl formula rewritten satisfi set make addit express due index label attach step unbound repetit oper action exclud core logic consid oper defin translat logic base sole semant unbound repetit oper unbound repetit present problem clausal tempor resolut approach requir atom action occur presenc unbound repetit remov occurr action unbound repetit rule tabl similar rewrit rule possibl fruit translat formula atom directli ctl rewritten normal form import note extens core logic unbound repetit logic exist polynomi time satisfi preserv pdl pdl pdl combin reduc satisfi problem extens core logic unbound repetit satisfi problem pdl satisfi problem pdl satisfi problem guard fragment relat bound ariti gf ctl polynomi time comput gf pdl map formula pdl satisfi formula gf base fact polynomi space altern ture machin input gf pdl result formula satisfi iff origin ture machin halt accept state procedur pdl polynomi space altern ture machin pdl gf pdl translat pdl pdl formula formula target logic satisfi properti state procedur target logic provid procedur extens core logic unbound repetit approach establish complex class doubt obtain practic proof method gf pdl induc map comput procedur pdl sourc logic pdl interpret target logic expect effici procedur pdl section constitut map interpret sourc logic interpret target logic constraint solv satisfi problem target logic advantag sophist techniqu target logic full framework interact dynam logic epistem logic compon logic addit properti modal oper investig linder interest axiom schema similar interact axiom linear time tempor logic synchroni perfect recal make valid problem complex singl agent case interact proposit linear time tempor logic turn satisfi problem problem doubl exponenti time complet problem case addit interact lead undecid care interest fragment fusion ctl obtain translat specif obtain translat core conjectur requir tempor resolut rule block world accept plan aim appli area subset reason soccer player simul leagu robocup block number atom action unlik block result action probabl ad framework work show overcom accumul uncertainti sequenc incorpor notion notion updat belief agent richer dynam epistem attitud issu research question agent step end link agent program languag agent program languag enabl programm program dynam mental state semant program conceiv state transform suitabl verif languag program languag analyz languag semant term identifi number properti gave number properti practic reason rule satisfi explain detail requir addit definit detail reader refer exist number theori ration agenc formul framework combin modal work practic proof method express logic involv theori exampl proof method develop rao georgeff proposit bdi logic proof method develop wooldridg tempor logic knowledg paper present current state attempt provid proof method logic express exce previou theori ration agenc present proof method section discuss section show proof method cover interest core fragment essenti gap sign approach due fact combin interact logic inher pose difficult proof theoret receiv attent recent experi support view simpl class tempor dynam logic formula perform theorem prover vari greatli theoret practic problem theorem prove tempor dynam investig motiv pursu approach time fact strength approach li area framework translat approach eleg treatment inform compon clausal tempor resolut approach potenti provid complet calculu dynam compon presenc unbound repetit approach possibl combin proof method present combin clausal tempor resolut linear time tempor translat approach resolut extens logic show termin combin logic acknowledg research support grant netherland organ scientif research british council joint scientif research programm epsrc grant refer andr van modal languag bound fragment predic logic resolut theorem prove handbook autom chapter page elsevi superposit simplif procedur monad class equal proc lnc page springer de modal logic cambridg press logic soccer master netherland de elimin pdl languag de translat gf unpublish manuscript de method modal logic logic resolut logic ration agenc proc ecai page io press resolut tempor logic knowledg logic altern semant tempor logic theoret comput page tempor modal logic van handbook theoret comput page elsevi reason knowledg mit press proposit dynam logic regular program comput system clausal tempor resolut acm tran comput comput space effici minim model gener guard formula proc lnai page springer gr restrain power guard symbol complex reason knowledg time lower bound comput complex reason knowledg extend abstract proc page de van der ch agent program internat autonom agent multiag van der van ch agent abil studia procedur subclass logic phd saarland germani normal form proof combin modal tempor logic proc lnai page springer resolut test modal satisfi build model van highlight satisfi research year page io press formula highlight differ tempor logic dynam logic prover issu design evalu system modal tempor technic report dii page depart siena van van der ch formal abil opportun agent fundamenta complex terminolog reason revisit proc lnai page springer de van van der program agent present london ch van der epistem logic ai comput scienc cambridg press van der van logic approach dynam commit artifici system resolut rule part proposit logic proc lnc page springer languag variabl math logik grundlagen combin hilbert style semant reason resolut framework proc lnai page springer model program logic proc symp found comput page ieee comput societi press model agent proc page morgan kaufmann procedur bdi logic logic robocup robocup web site decid resolut proposit modal logic autom calculi kripk semant system framework short page depart siena dynam logic uniform framework theorem prove logic proc lnai page springer ch al system version proc lnai page springer reason ration agent mit press
AI/86 2 squar conform map automat textur atla gener bruno nicola rai textur atla effici color paint system model textur chart chart unfold chart pack textur space exist textur atla method triangul surfac suffer requir gener larg number small chart simpl border discontinu chart make difficult paint larg area regular pattern main contribut base approxim equat object function minim angl prove minimum independ similar textur independ resolut mesh gener triangl flip function numer behav effici minim approach larg chart complex border introduc segment method model chart natur pack algorithm gather textur space demonstr approach appli paint scan model data set cr graphic shadow textur textur paint polygon model isa franc introduct paint system make enhanc visual model interact ad detail bump map discret surfac fine directli paint vertic desir color finer geometr detail model assum surfac paint provid textur map store color paramet space parametr surfac natur polygon find decor polygon model regular lap textur approach local overlap repeatedli map small textur model textur atla gener model textur partit set part refer provid textur atla easili repres standard file format displai standard textur map hardwar paint textur atla meet chart boundari chosen minim textur sampl textur space uniform atla make optim textur space gener textur atla model partit set chart chart put correspond subset chart gather textur space remaind section present exist method limit respect requir mention introduc textur atla gener meet requir creat chart natur reduc textur artifact previou work segment chart model interact partit user perform automat al group facet normal multiresolut method model chart simplic base complex sander al approach merg chart planar compact criteria approach design produc chart treat exist limit chart convex border larg number chart introduc discontinu construct textur atla chart discret harmon al wide approxim continu harmon map minim metric criterion shown link criterion express term dirichlet energi al describ similar method specif case surfac triangul sphere theori graph studi map introduc biject mathemat specif weight improv qualiti term area deform conform method addit constraint account method mention conform express indirect coupl boundari condit boundari node fix convex border paramet space express mip method make overcom boundari node free move method requir stuck local minima function al method base circl configur circl pattern provid approxim conform map build circl pack approach consist solv angl paramet space result highli constrain optim problem method extrapol absenc triangl flip requir interact user introduc conform map offer effici robust approach case textur biject abil make optimum textur accur repres signal store textur space sander al describ approach minim textur stretch textur deviat level detail approach independ initi appli optim sampl construct method chart pack textur space find optim pack chart textur space bin pack problem studi result algorithm huge amount time problem speed heurist comput graphic commun case individu method author gener case sander al approach pack minim area bound rectangl chart chart arbitrarili shape bound rectangl boundari chart lot textur space wast accur pack algorithm handl complex chart creat segment method overview paper organ main start introduc squar conform map method properti section figur criterion minim angl deform scale effici minim classic na requir complex algorithm prove exist uniqu minimum criterion solver stuck local contrast method properti border chart exist method larg chart arbitrarili shape border prove orient triangl mean triangl flip occur overlap boundari surfac textur space configur automat concern chart subdivid problem seldom encount experi classic method border node fix convex overlap prove result independ resolut mesh type properti reduc textur deviat level detail object section present segment method model chart addit flexibl offer creat larg chart geometr biolog featur charact anim requir number chart dramat artifact discontinu chart larg chart facilit regular pattern paint system section present method pack chart textur space segment method creat chart complex pack chart accur bound previou approach method inspir strategi player paper conclud scan model mesh squar conform map focu problem chart disc shown model set pack chart textur space notat scalar denot normal charact vector denot bold charact complex number denot capit vector complex number denot bold capit map matric denot cursiv font figur bodi scan test case robust singl larg chart complex border result unfold border automat cut make surfac affect larg triangl circl area shadow zone scan conform map quickli introduc notion conform map present approxim conform criterion mathemat properti approxim conform figur conform tangent vector curv orthogon length shown figur applic map domain surfac conform tangent vector curv pass orthogon written denot unit normal surfac conform map local map elementari circl domain elementari circl surfac rewrit equat differenti result weight coeffici paramet found solut separ linear relat indirectli account hand side system type method requir border fix convex polygon mip method express conform relat link coeffici metric tensor result equat approach base remark criterion defin conform map independ rotat scale paramet space unknown angl corner triangl requir timeconsum constrain optim method discret laplac oper vertic dual path conform condit triangl surfac fact similar repres product complex show turn conform problem unconstrain quadrat minim problem paramet link singl global equat direct coupl paramet make effici larg chart complex shown figur cut manual creat larg test case robust method shown section automat cut model chart theorem state surfac find surfac satisfi equat result textur add constraint edg triangul map straight map vari linearli triangl addit satisfi conform condit minim violat condit squar conform triangul triangul correspond set triangl repres tripl pj denot geometr locat vertex triangl provid local orthonorm coordin vertic basi normal local base triangl share edg consist orient restrict triangl appli conform criterion map coordin point local frame equat written complex theorem deriv impli iv formul equat gener strictli minim violat conform condit squar defin criterion da area triangl notat stand modulu complex number sum criterion minim gradient triangl goal associ vertex complex number uj equat satisfi squar triangl rewrit criterion assum map vari linearli triangl scalar vertic dt dt area triangl compon gradient gather complex dt equat rewritten dt dt uj uj object function reduc triangl vertic index multipli factor simplifi squar conform map quadrat complex number written symmetr matrix notat stand conjug instanc gram written matrix index column index coeffici vertex belong triangl figur insensit resolut mesh curv obtain mesh fine remain stabl resolut vari mesh zone figur optim problem set priori valu vector uf vector free coordin variabl optim vector pin coordin length block matric mf matrix mp matrix equat rewritten mu uf notat stand product stand conjug rewrit object function real matric vector yield mf mp superscript stand real imaginari stand time tradit vector real coordin uf vector unknown note vector vector ui vi coordin vertic paramet space move properti minim problem fundament properti prove matrix full rank number pin larger equal minim problem uniqu solut case map fulli conform surfac develop minimum object function pin vertic maxim length short path graph solut minim problem invari similar textur space solut minim problem independ resolut mesh properti illustr figur textur triangl consist orient pin vertic chosen boundari triangl flip occur figur result featur detect function optim choic drive chart grow function show natur result segment driven function segment segment algorithm model set chart design algorithm aim meet chart boundari posit discontinu chart locat zone textur chart introduc deform shade model depend zone high curvatur sharp variat light textur artifact neglig compar shade variat minim design segment algorithm avoid chart boundari flat zone suitabl gener larg chart boundari high curvatur zone present automat mimick user manual segment model user attempt model part resembl cylind detect approach inspir function defin surfac section present featur detect find curv high curvatur zone chart grow algorithm make meet featur curv shown valid subdivid chart remaind surfac repres base data structur detect featur featur detect phase outlin comput sharp criterion edg order differ angl elabor criteria threshold τ proport edg filter percent detect edg remain grow featur curv appli algorithm algorithm attempt anticip filter small featur tag neighborhood detect featur avoid gener larg number featur zone high curvatur paramet set search find string start consecut share vertex length maximum backward tag featur neighbor item append end tag element featur tag neighborhood featur neighbor end end algorithm featur grow control size discontinu expand chart sharp featur chart creat method greedi expand chart simultan set seed similar dijkstra algorithm paradigm comput vision chart boundari meet level algorithm modifi select set intuit idea expect result front propag border featur curv detect previou comput function facet seed found local maxima function close surfac detect propag initi extrem diamet facet propag prioriti advantag approach shown figur figur segment algorithm detect cylindr addit cut ad extrem cylind heap sort initi edg surfac initi heap foreach facet local maximum creat chart seed add heap end foreach phase heap maximum remov heap facet facet opposit facet rel undefin add remov remov edg edg link chart boundari add belong heap ε ε merg end end end algorithm chart grow chart merg meet small distanc ε seed ε denot global maximum chart grow algorithm store facet denot chart scalar denot maximum distanc featur facet set edg repres border chart make patch neighbor remain topolog disc shown figur algorithm detect cylindr approach configur cylind correspond wing chart shape configur detect figur head made singl absenc triangl overlap remov subdivid chart ratio facilit cut ad start seed cut edg path cylind algorithm gener suitabl requir special treatment result chart valid chart chart method present section criteria mention section triangl flip border extrapol border class overlap encount configur effici detect draw paramet space mode pixel drawn correspond overlap overlap chart cut edg border overlap shown figur note segment algorithm gener singl chart head figur overlap problem seldom tini loop form border criterion respect angl shown result section area larg chart zone high curvatur result larg area variat detect minimum maximum model area ratio measur facet ratio greater concern chart grow chart facet minimum maximum exampl shown threshold set pack model set creat textur atla merg domain chart limit amount textur memori suitabl minim space set possibl find placement polygon rectangl minimum area textur coordin fit size textur pack problem approach base comput geometri show good perform term minim lost effici larg complex data set heurist comput graphic method sander al bound rectangl chart pack figur pack algorithm insert chart maintain process chart insert posit minim bottom horizon current horizon top horizon current chart updat horizon result dinosaur data set border arbitrari bound rectangl accur approxim pack chart directli bound rectangl algorithm inspir player approxim chart bound chart rescal make area space equal area space maximum diamet chart orient vertic sort order shown figur chart top horizon bottom horizon comput repres bound chart approxim area curv classic order avoid unwant blend addit margin ad horizon chart insert method shown figur linear function repres maintain algorithm chart uc coordin lower left corner chosen lost space bottom horizon current horizon minim figur horizon updat top horizon current chart paramet space discret natur repres horizon arrai discret textur resolut make algorithm simpler linear function chart discret valu uc test algorithm perform process data set test result appli method data mesh creat model scan mesh result obtain mip mathemat effici comput shown tabl stretch measur result order standard method optim easi result method algorithm border node natur posit arbitrarili fix convex result tabl figur show textur note presenc small geometr detail model problem paint harmon map stretch stretch tabl stretch optim data set figur data set textur space construct method dinosaur vertic facet chart segment time time pack ratio pack ratio stretch stretch tabl statist time angl deform figur model method facilit procedur textur complex pattern area deform figur angl area deform histogram data treat properli exampl textur model shown figur tabl show size data number creat obtain pentium iii time pack algorithm time segment model time chart criterion minim cg algorithm independ resolut suggest approach pack ratio obtain rectangl pack approach algorithm stretch measur appli sander optim method left histogram figur show distribut angl gradient vector map conform triangl differ length gradient measur histogram show area deform obtain data stretch optim show textur area ratio scale map note map isotrop stretch histogram shown area histogram criterion design punish area facet easili fix postprocess sander method result textur combin advantag chart present automat textur atla gener method polygon model complet mathemat valid solut complex model prove effici robust exist method tool real product environ segment driven detect featur inspir model chart natur geometr entiti algorithm applic data compress successfulli appli techniqu scan synthet data make exist paint system futur huge analyz numer method minim includ approach cg includ stretch criterion directli criterion futur direct research acknowledg develop team ben li review comment improv paper properti minim problem section interest properti number pin vertic paramet space suffici assum disc full rank show matric mf full rank denot number pin recal triangul topolog disc increment construct oper figur glue oper creat vertex join oper creat face increment construct creat vertic face simplest triangul face denot number number rest figur increment construct triangul topolog disc glue triangl edg join exist creat triangl show rank mf note min rank mf assum increment construct glue join oper prove result induct size mf loss pin vertic concentr initi triangul ni dimens matrix step observ coeffici step triangul vertic triangl singl column proper coeffici rank assum properti hold step step number row grow number column rank ni step vertex triangl ad vertic matrix dt dt dt easi column linearli independ assum complex number column vector coordin column equat reduc impli full rank equat link coordin vector reduc dt impli column linearli independ matrix full rank result prove mf rank rank impli rank singl minimum show uniqu minimum notic ax rank gram matrix rank rank squar invert minim problem uniqu solut minimum ax invert full fact impli conclud map fulli conform triangul built glue oper invari similar prove solut minim zu problem invari similar transform note vector trivial kernel triangl assum solut problem zz zz mu zz kernel independ resolut show mesh solut augment optim problem restrict vertic initi mesh prove result singl triangl split proof gener easili gener set vertex introduc triangl linear combin vertic assum sake simplic pin call ti triangl creat vi vertex easi mf matrix insert matrix vertex augment number column triangl replac augment number row structur matric mf nf nf nf coeffici denot fj dt easi observ coeffici satisfi pi fi solut initi problem uf mf solut augment relat equat fact suffic observ solut uv squar conform unchang vertic vertex preserv orient sketch proof squar conform map preserv triangl flip figur preserv orient note complex number wi vertic triangl section vertic order posit equal assum triangul increment construct glue join oper denot current triangul ti join result trivial prove result current step glue notat figur imag paramet space wj complex number attach xj complex number attach local base triangl share edg consist defin equat posit assum unfold ti triangl defin equat replac wj xj write equat defin previou find uv vertic unchang addit fact uv uv equat rewrit equat definit equat consist orient glue oper produc triangl prove result refer paint scan surfac proc symposium interact epstein pack gener method recov attribut valu simplifi mesh proc ieee visual page acm stuetzl multiresolut analysi arbitrari mesh siggraph conf page addison report harmon map bull london math parametr smooth approxim surfac triangul comput aid geometr april normal mesh siggraph conf page acm hall conform surfac textur map ieee transact visual comput direct paint textur shape siggraph conf page addison greiner effici global parametr method curv surfac page gross multiresolut featur extract unstructur mesh proc ieee visual flat map human proc volum lectur note comput page adapt interact textur paint symp interact page krishnamurthi fit smooth surfac polygon mesh siggraph conf page addison lazaru level set diagram polyhedr object proc solid model page acm multiresolut adapt surfac siggraph conf page addison constrain textur map polygon mesh siggraph conf page acm textur map shear triangul mesh siggraph conf page addison extens notion map space proc symp theo aspect comp page interact textur map siggraph conf page addison rotat polygon minimum enclosur robust construct comput modul placement proc page pedersen decor implicit surfac siggraph conf page addison comput discret minim surfac conjug seamless textur map surfac model textur blend siggraph conf page acm lap textur siggraph conf page acm textur map progress mesh siggraph conf page acm de param facet surfac mesh flatten engin surfac code base theori ieee comput graphic convex graph proc london math volum textur map surfac flatten scale ieee transact vi
ML/87 6 journal artifici intellig research submit publish distribut stigmerget control commun network di caro marco dorigo universit de av cp belgium abstract paper introduc approach adapt learn rout tabl commun network antnet mobil agent base mont carlo system inspir recent work ant coloni metaphor solv optim problem antnet agent concurr explor network exchang collect inform commun agent indirect mediat network form commun typic social insect call stigmergi compar algorithm rout algorithm telecommun machin learn field algorithm perform evalu set realist testb run experi real artifici ip datagram network number node paradigmat spatial tempor traffic distribut result encourag antnet show superior perform condit respect competitor analyz main characterist algorithm explain reason superior introduct worldwid demand suppli commun network servic grow exponenti techniqu network control onlin monitor manag network plai fundament role exploit transmiss switch technolog meet user request rout core network control system conjunct congest control determin network perform term qualiti quantiti deliv servic rout refer distribut activ build rout node incom data packet outgo link continu travel destin node rout protocol polici accommod conflict object constraint technolog user requir rapidli evolv commerci scientif pressur rout approach requir effici manag distribut multimedia mobil user heterogen servic atm adapt distribut rout algorithm paper onlin mont carlo techniqu inspir previou work artifici ant ai access foundat morgan kaufmann publish reserv di caro dorigo coloni notion stigmergi indirect commun place individu modif induc environ algorithm inspir real ant behavior find shortest path inform trail chemic substanc deposit recent successfulli appli discret optim problem dorigo costa algorithm set artifici ant collect solv problem cooper effort effort mediat indirect commun inform problem structur ant concurr collect build solut stochast polici algorithm set concurr distribut agent collect solv adapt rout problem agent adapt build rout tabl local model network statu indirect commun inform collect explor network ensur valid algorithm perform realist simul environ term network commun protocol traffic pattern focu ip datagram network irregular topolog real artifici topolog number node paradigmat tempor spatial traffic distribut report behavior antnet compar effect static adapt rout algorithm shortest path algorithm recent introduc algorithm base machin learn antnet show perform stabl behavior consid situat experi superior strike discuss result main properti compar competitor paper organ section taxonomi characterist rout problem report section describ commun network model section describ detail rout section briefli describ algorithm compar antnet section set report term network algorithm paramet section report result section discuss result explain antnet superior perform section discuss relat section draw outlin direct futur research definit characterist rout distribut system direct weight node set repres forward unit edg transmiss system main task rout algorithm direct data flow sourc destin node maxim network perform distribut stigmerget control commun network problem interest data flow static assign stochast profil hard model specif case commun network bertseka rout algorithm manag set basic function tightli interact congest admiss control link queu traffic core rout function organ distribut inform traffic network inform gener feasibl rout maxim perform forward user traffic select rout function implement strongli depend underli network switch transmiss featur interact softwar layer point main forward paradigm circuit term setup phase reserv resourc assign incom session data packet belong session follow path router requir state inform activ session reserv state inform maintain router data packet follow path intermedi node autonom node outgo link forward data packet destin work focu techniqu develop manag expect qualit similar result broad taxonomi common featur rout algorithm presenc network node data call rout hold inform algorithm make local forward rout tabl local local model global network statu type inform inform updat strongli depend algorithm characterist broad classif rout algorithm ffl central versu ffl static versu adapt central main control updat node rout tabl make rout central algorithm case small network delai gather inform network statu broadcast make practic central system distribut rout distribut rout comput rout share network exchang inform distribut paradigm major network system static rout path packet determin basi sourc regard current network state di caro dorigo path chosen shortest cost chang account faulti link node adapt router adapt rout polici time spatial vari traffic condit oscil select path fact circular larg fluctuat measur perform adapt rout lead easili inconsist node link failur local topolog stabil inconsist problem evid network interest rout algorithm optim perspect case main paradigm ffl minim rout versu ffl optim rout versu shortest path rout minim router packet minim cost algorithm choic path heurist strategi optim rout perspect object optim function individu link flow function sum link cost assign basi averag packet shortest path rout pair global cost function optim object determin shortest path link cost comput statist descript link state strategi base individu group ration content store rout shortest path algorithm subdivid class call optim rout static solut flow requir knowledg traffic characterist shortest path algorithm dont requir priori knowledg traffic pattern wide rout algorithm appendix detail descript properti optim shortest path rout algorithm report section introduc distribut adapt share optim perspect shortest path algorithm usual implement paradigm depict appendix main characterist rout problem main characterist rout problem commun network summar ffl distribut strong system complet distribut network failur statu inform propag delai neglig respect user distribut stigmerget control commun network traffic pattern imposs complet knowledg distribut remain hidden rout algorithm make delai inform node ffl stochast session arriv data gener process gener stochast stochast process interact rout make build work model system dynam program ffl conflict perform measur account common throughput averag packet delai measur quantiti servic network offer amount time correctli deliv bit time defin qualiti servic produc time cite bertseka page effect good rout throughput averag delai packet high offer load condit averag delai packet low moder offer load perform measur impact rout algorithm network resourc term bandwidth algorithm ffl constraint underli network network servic provid user servic request user distribut multimedia servic heterogen static mobil network evalu technolog commerci network builder servic provid accommod request maxim profit criteria high level reliabl request modern user session formul request network resourc session system session resourc fault event interest note characterist make problem rout belong class reinforc learn problem hidden state distribut system compon rout algorithm determin continu onlin learn rout tabl valu respect network perform criteria exact measur evalu score forward onlin form train set distribut natur problem complet state network hidden agent commun network model focu irregular topolog network network layer simpl transport layer focu network hierarch organ scheme di caro dorigo adopt roughli singl host node connect interfac node call gatewai gatewai perform fairli sophist network layer includ rout group connect arbitrari defin logic area insid gatewai hierarch level rout perform area commun mean area border gatewai comput complex rout reduc area typic group complex design manag rout protocol instanc commun network map direct weight graph node link view bit pipe bandwidth transmiss delai access statist multiplex scheme type hold buffer space incom outgo packet store buffer share resourc queue attach incom outgo link node travel packet subdivid data rout packet packet class queu serv basi rout packet greater prioriti data packet workload defin term applic arriv rate dictat select probabilist model applic connect process send data packet origin node destin node number packet size interv assign defin stochast process didnt make distinct act time host adopt workload model incorpor simpl flow control mechan implement fix product window session packet gener window determin maximum number data packet wait packet consid acknowledg mean transport layer manag error packet acknowledg retransmiss incom node rout compon inform store local rout tabl assign outgo link forward packet target node link resourc reserv transfer set time move packet node neighbor depend packet size link transmiss characterist packet buffer space hold packet discard servic time stochast gener newli arriv packet time repres delai packet arriv time time put buffer queue outgo link local rout compon select situat temporari steadi alter network topolog physic characterist account node ad delet network hierarch structur adopt organ hierarch autonom system multipl rout area insid autonom system choic model mar network simul basic form file transfer protocol distribut stigmerget control commun network develop complet network simul discret event simul main data structur event hold futur event simul time continu variabl set schedul event aim simul close mirror essenti featur concurr distribut behavior gener commun network sacrif effici flexibl code develop end section remark featur model chose implement transport layer proper manag congest control addit control compon impact network make difficult evalu studi properti control algorithm complex interact control compon chose test behavior algorithm competitor condit number interact compon minim rout compon evalu understand properti studi rout conjunct flow congest compon design good match characterist produc effect chose work network scheme network deliv qualiti servic suitabl admiss control algorithm account econom technolog factor step reason check valid rout algorithm reduc number compon heavili influenc network behavior adapt rout algorithm characterist rout problem section make suit solv mobil approach process paradigm good match distribut topolog traffic natur present high level redund handl multipl object constraint flexibl rout algorithm mobil agent system show essenti featur parallel replic mont carlo system antnet inspir previou work artifici ant coloni techniqu solv combinatori optim problem dorigo dorigo telephon network rout author report improv rang perform measur real internet traffic chang version vega version tcp current internet transport control author claim improv rang case current ip servic mean servic qualiti term delai bandwidth assur di caro dorigo core idea techniqu review di repeat concurr simul carri popul artifici agent call gener solut agent stochast local search build solut increment inform collect past simul direct futur search solut artifici ant coloni iter ant build solut type inform local inform distanc citi travel salesman inform ad ant previou iter algorithm build ant collect inform problem characterist inform modifi local ant problem modifi inform past good solut exploit build solut form indirect commun mediat environ call typic social insect retain core idea artifici ant coloni appli solv adapt rout problem datagram network antnet algorithm main characterist summar ffl regular concurr data network node mobil agent asynchron launch randomli select destin node ffl agent act concurr commun indirect inform read write local node ffl agent search minimum cost path join sourc destin node ffl agent move destin node intermedi node greedi stochast polici appli node move polici make local maintain local heurist inform ffl agent collect inform time congest statu node identifi path ffl arriv agent back sourc node move path opposit direct ffl backward local model network statu local rout tabl visit node modifi agent function path good ffl return sourc agent die subsect scheme compon explic detail descript algorithm distribut stigmerget control commun network algorithm descript characterist antnet conveni term set homogen mobil agent call forward backward ant agent set possess differ situat input produc independ output broadli classifi delib behav reactiv retriev set time maintain complet intern state descript agent commun indirect stigmergi inform concurr read write data structur store network node figur network node network node rout tabl statist local traffic network node stat stat outgo link figur node structur mobil agent antnet case node neighbor network node rout tabl organ entri probabilist valu structur statist local traffic plai role local adapt model traffic destin rout tabl organ algorithm appendix probabilist entri defin probabilist rout polici adopt node destin neighbor node store probabl express good current rout node destin node arrai oe data structur defin simpl parametr statist model traffic distribut network local node model adapt sampl mean varianc comput trip time experienc mobil move observ window store agent trip time interchang term ant agent di caro dorigo destin estim oe give expect time stabil exponenti window strategi comput statist chang strategi affect perform observ result exponenti oe oe oe observ agent trip time node destin move observ window comput agent trip time destin observ sampl increment modulu max max maximum size observ window repres memori express move empir lower bound estim time node current node memori local node captur aspect network dynam model maintain absolut estim rout tabl rel probabilist good measur pair current rout polici implement network antnet algorithm regular interv network node mobil agent launch destin node discov path node investig load statu network forward ant share queue data experi traffic load destin local select data traffic pattern gener local sd measur bit number data flow probabl creat node forward ant node destin sd sd ant adapt explor activ vari data traffic distribut travel destin agent memori path traffic condit found identifi visit node time launch time arriv node push memori stack model algorithm estim retransmiss timeout internet factor weight number recent sampl affect averag weight sampl estim approxim latest observ influenc latest number effect observ distribut stigmerget control commun network node travel agent head destin select node move neighbor neighbor case visit neighbor select probabl comput normal sum probabilist entri rout tabl heurist correct factor account state link queue current node ffl heurist correct normal proport length bit wait queue link connect node neighbor jn ff weight import heurist correct respect probabl valu store rout tabl reflect instantan state node assum queue consum process stationari slowli quantit measur queue wait time rout tabl outcom continu learn process captur current past statu network local node correct valu valu system time avoid network fluctuat agent basi combin learn process instantan heurist predict experi observ introduc correct effect mechan depend characterist assign weight ff ff rang perform doesnt chang appreci lower effect higher valu result rout tabl oscil perform degrad cycl ant forc return visit cycl node pop ant stack memori destroi cycl longer lifetim ant enter cycl greater half ant ant destroi case agent wast lot time wrong sequenc congest state agent carri mislead memori network state updat rout tabl destin node agent gener agent transfer di di caro dorigo backward ant path forward opposit direct node path pop stack hop node backward ant share link queue data higher prioriti task quickli propag rout tabl inform accumul forward ant arriv node neighbor node backward ant updat main data structur local model traffic rout tabl entri destin node updat perform entri node ant visit current node trip time statist estim confid interv time updat statist rout tabl trip time deem statist defin dont give correct idea time node forward ant rout made function destin node side local variat traffic load reason perspect dynam problem case good ant addit good rout item updat respect gener node updat valu store stack memori time arriv forward destin node start current node updat varianc oe observ window parametr model travel time destin maintain time vari depend traffic poor time low traffic load good heavi traffic load statist model captur variabl follow robust fluctuat traffic model plai critic role rout tabl updat process item investig wai build effect section rout tabl chang increment probabl fd probabl neighbor destin probabl amount variat probabl depend measur good associ trip time experienc forward time repres explicit feedback signal score path clear indic good rout proport assumpt requir link network modern network reason assumpt distribut stigmerget control commun network length physic point view transmiss capac process speed cross traffic congest point view forward ant share queue data time measur exact error dont trip depend network load statu reinforc signal rise credit assign problem typic reinforc learn field kaelbl defin reinforc function good observ trip time estim basi local traffic model current node posit reinforc node backward ant account averag observ valu score good trip time smaller higher exact definit discuss probabl fd reinforc fd fd fd probabl fd proport reinforc receiv previou node probabl small probabl valu big probabl favor quick exploit discov probabl destin neighbor node implicitli receiv neg reinforc normal valu reduc sum probabl rp import remark discov path receiv posit reinforc select reinforc function good estim trip time assign plai ant arriv rate strategi base trust path receiv high independ low frequent reinforc traffic load path receiv high reinforc explor path transient phase sudden network load path high time respect learn model low situat case good path differenti frequenc ant arriv network congest trip time score poorli respect time observ low load situat path high trip time score good path trip time significantli lower trip time observ congest situat di caro dorigo assign reinforc case path high time implement mechan base frequenc avoid give excess credit path high time due poor qualiti probabilist entri specif antnet observ improv rout tabl probabilist ant data packet observ improv antnet mean rout tabl built antnet match probabilist distribut data packet good path data packet prevent link low probabl remap entri mean power function ff ff high probabl valu reduc lower experi set ff figur descript algorithm figur illustr simpl algorithm behavior detail discuss characterist algorithm postpon section perform algorithm analyz respect set competitor algorithm characterist antnet meaningfulli evalu compar algorithm score good ant trip time reinforc critic quantiti assign main path receiv increment select probabl proport good rel depend traffic estim mean model import follow traffic fluctuat aspect import uncontrol oscil rout tabl main problem shortest path rout import set stabil adapt investig wai assign valu account ffl simplest set independ ant discov path reward simpl work implicit reinforc mechan due differenti ant arriv rate ant travel faster path arriv higher rate path receiv higher cumul reward obviou problem approach li fact ant longer path arriv effect rout tabl ant shorter path core algorithm base capabl ant discov shortest path commun mean pheromon trail becker distribut stigmerget control commun network current end time length time interv ant foreach concurr activ network local traffic node rout end parallel concurr activ node mod destin node traffic sourc end foreach current destin node destin hop node destin link hop hop hop hop current node hop end sourc stack end foreach foreach current destin node destin hop node hop hop current sourc stack reinforc sourc stack current sourc end end foreach end parallel end end foreach figur antnet descript action place complet distribut concurr network node antnet individu ant construct level indent insid context statement parallel execut concurr process data gener forward thought act concurr ant di caro dorigo forward ant backward ant figur antnet behavior forward move path arriv node launch backward ant travel opposit direct node backward ant stack content updat valu oe case good updat valu oe time rout tabl updat increment good node ant case node destin decrement valu neighbor increment function trip time experienc forward ant node destin node rout tabl updat case node node destin node trip time forward ant statist good experi ran algorithm show moder good perform result suggest compon base ant arriv plai import role compet inform path cost ffl elabor approach defin function ant trip time paramet local statist model test quadrat hyperbol combin valu limit discuss function form gave report inf inf inf equat trip time experienc ant travel destin observ window maximum size window maximum number consid sampl reset assign basi coeffici equat weight number sampl effect give contribut defin sort move exponenti window express number effect sampl report footnot set max longterm exponenti window refer compar set evalu fraction sampl distribut stigmerget control commun network inf conveni estim limit approxim confid interv inf set fl select confid level level arbitrari comput confid set asymmetr oe arithmet estim raw estim valu local bootstrap procedur appli extract confid choic reason cpu term equat simpli evalu ratio current trip time trip time observ current observ window term correct evalu inf relat extens confid stabil latest trip time coeffici weight import term term import term plai role correct current implement algorithm set observ shouldnt big upper perform start degrad appreci behavior algorithm stabl valu rang set slightli degrad perform algorithm robust defin confid vari confid level rang perform result obtain valu observ algorithm robust intern paramet set didnt set paramet problem instanc experi carri set improv perform mean finer tune didnt interest implement robust world network vari term switch transmiss obtain equat final transform mean squash function exp squash valu system sensit reward good valu tendenc satur reward bad scale compress lower valu expand upper part emphasi put good bad result plai minor role express obtain inequ definit confid interv random variabl distribut specif probabl densiti bound conveni avoid make assumpt distribut raw estim confid interv di caro dorigo neighbor neighbor neighbor neighbor figur exampl squash function variabl number node neighbor coeffici determin parametr depend squash reinforc number jn neighbor reinforc node greater number higher reinforc figur reason effect good result probabilist rout independ number neighbor node rout algorithm comparison evalu perform compar rout algorithm telecommun machin learn field belong combin static class appendix implement run comparison link implement current interior gatewai protocol internet interest studi rout assumpt section rout protocol implement mirror real protocol detail retain basic featur link cost static assign basi physic characterist rout tabl set result shortest path comput sampl data packet size byte worth remark choic penal version respect real real internet link cost set network administr addit heurist knowledg traffic workload prototyp algorithm dynam metric link cost evalu similar algorithm implement version success implement flood link cost assign discret scale valu metric statist window averag method link cost comput weight averag short statist reflect delai queue transmit node monitor averag packet delai averag packet transmiss time fix observ window assum queue model link util cost measur calcul distribut stigmerget control commun network sion fix time interv obtain valu rescal satur linear function addit discret metric discret gave result term perform stabil discret scale reduc sensit algorithm time reduc undesir oscil bf implement asynchron distribut algorithm dynam metric shankar algorithm implement guidelin appendix link cost assign algorithm todai rout inform protocol suppli version unix enhanc version basic adapt algorithm found literatur extend focu reduc inform dissemin time case link failur link failur major behavior gener basic adapt algorithm boyan littman onlin asynchron version algorithm learn onlin valu estim time reach node node neighbor node send packet neighbor node destin back packet back immedi gener back carri inform current time estim min held node time destin sum queu transmiss time experienc arriv node sum comput variat predict algorithm extens link lowest determinist chosen packet link high expect temporari load link exit node learn model rate variat link call recoveri probe link lowest high recoveri rate daemon optim approxim ideal algorithm defin empir bound achiev perform inform improv absenc priori assumpt traffic empir bound defin algorithm possess read instant state queue network calcul instantan cost link assign di caro dorigo path basi shortest path packet hop link cost shortest path calcul ff transmiss delai link size data packet size queue link exponenti size link queue correct actual size link queue basi observ moment correct weight ff set arbitrari introduc calcul defin daemon algorithm set function commun network govern interact nonlinear unpredict wai choic testb compar compet algorithm easi task limit set class tunabl compon defin class choic explain topolog physic properti net topolog defin basi real net instanc defin analyz influenc import topolog featur node buffer process link propag bandwidth stream multiplex scheme fault probabl distribut defin net instanc number node describ main characterist summar topolog properti mean tripl number indic shortest path term pair varianc total number node number idea connect balanc network difficulti rout problem roughli number ffl small network specif design studi aspect behavior algorithm compar experi design close studi algorithm manag distribut load path node link bandwidth propag delai msec topolog shown figur ffl usa backbon wan node link bandwidth distribut stigmerget control commun network figur number circl node identifi shade node special interpret edg graph repres pair direct link link bandwidth propag delai msec topolog shown figur propag delai rang msec balanc network figur edg graph repres pair direct link link bandwidth propag delai rang msec ffl major backbon ntt telephon telegraph corpor backbon link network link bandwidth propag delai rang msec topolog shown figur balanc network figur edg graph repres pair direct link link bandwidth propag delai rang msec di caro dorigo network simul local node buffer data packet maximum time live set sec traffic pattern traffic defin term open session pair node traffic pattern show huge varieti depend characterist session distribut geograph tempor point view singl session number transmit size time distribut cost request qualiti servic complet session session network time distribut geograph distribut control probabl assign node select session start consid basic pattern tempor distribut spatial distribut tempor ffl poisson node poisson process defin regul arriv session time neg exponenti distribut ffl fix begin fix number session set left constant remaind simul ffl temporari heavi traffic condit gener turn node act hot spot spatial ffl uniform assign tempor characterist session arriv set ident network node ffl random assign tempor characterist session arriv set random network node ffl hot spot node behav hot concentr high rate input traffic fix number session open hot spot node gener traffic pattern obtain combin tempor spatial characterist traffic mean ident poisson process regul arriv rp case process mean hot spot traffic model traffic shape bit stream gener basic ffl constant bit rate bit rate maintain fix exampl applic cbr stream voic signal telephon convert stream bit constant rate compress convert video signal stream distribut stigmerget control commun network ffl gener variabl bit rate gener bit rate time vari term broad gener term design bit stream variabl bit rate averag characterist fluctuat session gener packet size time variabl follow neg exponenti distribut inform characterist directli rout network valu experi shape traffic pattern valu session gener data packet product current network usag comput power packet size distribut set bit experi basic tempor spatial distribut chosen repres wide class situat arbitrarili gener subset real traffic pattern metric perform evalu depend type servic deliv network perform metric defin standard metric perform session equal benefit prioriti possibl request special servic measur interest throughput deliv delai distribut data packet network capac usag data rout express sum link capac divid total link capac rout algorithm paramet algorithm collect paramet set common paramet rout packet size elabor time set paramet shown tabl paramet assign valu previou simul antnet bf packet size packet elabor time tabl rout packet characterist implement algorithm daemon gener rout increment number hop made forward jn number neighbor node number network node work basi heurist evalu knowledg characterist incom cbr bit stream fundament import network deliv qualiti servic basi knowledg network session case resourc di caro dorigo inform encod scheme comput power size forward ant determin size bf packet byte hop store inform node address main specif antnet competitor set find literatur tune paramet obtain result length time interv consecut rout inform broadcast length time window averag link cost set depend experi link cost insid window assign weight sum arithmet averag window exponenti averag decai factor equal obtain valu discret linear scale satur slope set maximum admit variat equal transmiss rout inform total learn adapt rate algorithm author choi observ algorithm robust intern paramet tune fine tune paramet set valu experi ran set text moment paramet discuss report section ant gener interv node set section shown robust antnet respect paramet paramet statist weight number sampl consid model set factor express max put equal confid level factor equal mean confid level approxim result experi report section compar antnet compet rout algorithm section studi perform algorithm traffic examin evolut network statu satur temporari satur condit ffl low load algorithm test similar perform huge variabl traffic hard assess algorithm significantli ffl test algorithm deliv offer throughput similar case gener traffic rout big loss studi packet delai distribut show remark differ algorithm present simul result packet delai decid report empir distribut percentil compar algorithm basi upper delai correctli deliv packet packet delai spread wide rang valu characterist data packet delai rang low valu session open adjac node connect distribut stigmerget control commun network fast higher valu case session involv node connect slow link empir distribut packet delai meaningfulli parametr term percentil empir ffl satur packet loss packet delai network oper slow satur temporari situat structur network ad faster connect improv rout order studi algorithm traffic load temporari satur report data averag trial virtual simul time thousand repres time interv long expir transient statist data evalu behavior rout algorithm fed data algorithm preliminari simul data traffic build initi rout tabl algorithm build rout tabl minimum cost path result throughput report averag valu measur varianc variabl fact percent averag paramet valu traffic characterist figur caption mean previou session time distribut poisson stand packet interarriv time distribut cbr fix packet product rate hs number node session explicitli shape session bit stream assum type result throughput packet delai consid network topolog subsect result network resourc util report section experi design studi algorithm manag distribut load path direct node node figur traffic load set higher capac singl rout effici singl path result throughput case strongli discrimin algorithm type traffic workload small number node determin differ throughput antnet algorithm deliv gener data throughput short transient phase approach close level deliv daemon algorithm attain steadi approxim inferior obtain antnet algorithm behav stabil valu inferior provid antnet di caro dorigo clear antnet algorithm exploit path distribut data traffic induc oscil util rout tabl probabilist data packet case plai fundament role achiev higher qualiti result result throughput confirm packet report graph figur differ empir distribut packet delai reflect approxim proport evidenc throughput case simul time bf antnet daemon empir distribut packet delai bf antnet daemon figur comparison algorithm traffic direct node node packet delai empir distribut carri wide rang experi traffic pattern case differ throughput minor import respect shown packet delai rp case ran distinct group ten trial gradual gener workload term reduc session explain studi behavior algorithm move traffic load satur region differ throughput perform algorithm bf attain perform inferior daemon amount behav slightli delai worth remark experi present perform slightli contrast result present author articl introduc behavior due fact link recoveri rate match system simul time continu simul condit articl produc traffic pattern implement realist network distribut stigmerget control commun network situat fact algorithm antnet produc slightli higher throughput result packet delai trend packet delai confirm experi ran show poor result order high percentil bf behav similar perform order obtain antnet order daemon antnet bf daemon antnet bf daemon figur comparison algorithm load traffic load reduc percentil packet delai empir distribut rp case throughput gener bf antnet slightli perform behav slightli worst algorithm daemon obtain slightli result antnet packet delai result perform show result bit bf order antnet daemon case testb difficult case throughput daemon show result packet delai result algorithm fit scale chosen make clear differ antnet perform algorithm differ order respect bf daemon perform antnet scale testb difficult graph show algorithm behav case situat time hot spot turn exist light traffic transient situat report detail show answer curv report valu di caro dorigo antnet bf daemon antnet bf daemon figur comparison algorithm load rp traffic load reduc percentil packet delai empir distribut antnet bf daemon antnet bf daemon figur comparison algorithm load traffic load reduc hs percentil packet delai empir distribut valu throughput packet delai comput averag move window algorithm similar good perform throughput lose percent packet period graph packet delai confirm previou bf similar antnet daemon algorithm show big properli dump sudden load distribut stigmerget control commun network throughput bf antnet daemon packet delai simul time figur comparison algorithm transient satur condit traffic hs packet delai averag move window set experi run repeat case result sharper obtain antnet perform competitor rp differ throughput practic behav daemon algorithm delai differ antnet competitor order magnitud antnet delai low close obtain perform poorli complet rp case bf perform show slightli bf show similar perform compar irregular delai lower algorithm show interest behavior gener data throughput determin slow deliv throughput delai case load high algorithm balanc throughput di caro dorigo antnet bf daemon antnet bf daemon figur comparison algorithm load traffic load reduc percentil packet delai empir distribut antnet bf daemon antnet bf daemon figur comparison algorithm load rp traffic load reduc percentil packet delai empir distribut packet show lot packet loss made surviv packet obtain lower trip delai experi sudden load confirm previou result follow properli variat throughput delai algorithm follow sudden offer antnet show regular behavior differ packet delai strike antnet perform close obtain daemon curv practic scale bf irregular antnet show delai recov curv huge graph distribut stigmerget control commun network antnet bf daemon antnet bf daemon figur comparison algorithm load traffic load reduc hs percentil packet delai empir distribut hot spot turn show trend approach bf throughput bf antnet daemon packet delai simul time figur comparison algorithm transient satur condit traffic hs packet delai averag move window di caro dorigo rout overhead tabl report result overhead gener rout packet algorithm network load gener rout packet report ratio bandwidth occupi rout packet total network bandwidth row tabl refer discuss experi rout overhead comput experi load load seri antnet bf rp rp tabl rout ratio bandwidth occupi rout packet total network bandwidth data scale factor data scale factor data tabl show rout overhead neglig algorithm respect bandwidth adapt bf show lowest close antnet gener slightli bigger consumpt network wide higher perform produc overhead bit higher antnet rout load algorithm function specif algorithm number data packet length path topolog bad number gener rout packet predict gener overhead function topolog properti network gener rate rout inform packet antnet produc rout overhead depend ant gener rate length path travel ant traffic roughli collect addit traffic network produc small packet relat acknowledg constant bit rate destin match offer data traffic averag ant travel path size grow byte hop rout traffic repres light addit traffic sourc respect network resourc ant launch rate excess high figur sensit antnet respect ant launch rate report sampl case data traffic model studi figur interv consecut ant gener progress valu sampl constant interv logarithm scale rang curv interpol distribut stigmerget control commun network antnet normal power rout overhead interv dg consecut ant gener normal power rout overhead figur antnet normal power rout overhead power defin ratio deliv throughput packet delai gener rout overhead fraction network bandwidth rout packet curv plot data obtain power normal highest power defin ratio deliv throughput packet delai deliv throughput throughput time averag ten packet delai percentil empir distribut excess small excess growth rout consequ reduct algorithm power power slowli diminish plateau number ant gener maintain statist network statu middl extrem region wide rang interv good power rout overhead quickli fall neglig valu figur strongli confirm previou assert robust antnet intern paramet set discuss continu construct rout tabl emerg result collect learn process agent pair complex find good rout adapt rout tabl singl solv global rout optim problem interact agent determin emerg global effect behavior network perform point view ant cooper activ commun indirect agent act independ good rout discov appli polici function inform di caro dorigo access network node inform collect rout eventu node commun mediat explicit implicit node data structur traffic pattern gener data packet util rout tabl commun call match distribut natur rout problem cooper agent modif rout modif local model determin ant perform evalu modif rout tabl directli affect rout ant rout influenc rate arriv ant destin interest remark stigmergi paradigm make antnet mobil agent flexibl softwar engin point view interfac node data structur intern polici agent transpar updat agent exploit carri multipl concurr task collect inform distribut network manag protocol web shown previou result obtain stigmerget model comput excel term throughput averag antnet perform classic recent rout algorithm wide rang condit interest justifi antnet superior perform highlight characterist compar compet algorithm focu main ffl antnet instanc parallel mont carlo simul system explor algorithm explor net explor local tightli connect flux data packet ffl inform antnet maintain node complet organ critic manag algorithm ffl antnet propag local estim competitor mechan make algorithm robust local wrong estim ffl antnet probabilist rout tripl posit effect redistribut data traffic altern provid ant explor mechan exploit ant arriv rate assign cumul reinforc ffl observ antnet robust competitor frequenc rout tabl updat ffl structur antnet draw parallel reinforc learn algorithm characterist rout distribut rl problem sect determin departur antnet structur classic rl algorithm aspect antnet discuss detail distribut stigmerget control commun network antnet mont carlo system explor antnet rout system collect mobil agent collect data network statu concurr perform mont carlo simul mont carlo repeat experi stochast transit compon run collect data statist interest antnet ant explor network perform random experi build path sourc destin node stochast polici depend past current network collect inform network statu varianc reduct effect determin ant destin frequent observ data ant polici make current past traffic inform inspect local queue statu probabilist rout explor path match interest path data traffic point result effici varianc reduct effect stochast sampl path differ usual mont carlo antnet state space sampl perform sampl statist control traffic process perform concurr explor network concurr data traffic algorithm explor explor tightli coupl data traffic local natur shown section extra traffic gener explor ant neglig wide rang good perform inform manag network node kei characterist rout algorithm type inform rout tabl inform propag algorithm static make node main local model cost measur rout tabl bf estim smooth averag local link distanc neighbor node local model maintain estim local compon local model fictiti raw transit time directli updat slightli sophist model respect store measur link util algorithm propag part local inform make updat rout tabl build global view network bf content regular entri depend discard adapt compon rout system repres model adapt content neglig adapt compon algorithm repres smooth averag carri rule antnet show characterist model local perspect global statu network content reinforc weight basi rich statist descript network dynam local node reinforc updat rout adapt compon di caro dorigo maintain node updat carri asynchron function previou valu straightforward probabilist data travel ant select node adapt past model current local link instantan node statu evid antnet build inform compon instantan predictor combin level antnet robustli redistribut complet local compon critic estim antnet robust wrong estim remark differ propag local estim node node rout tabl updat local inform ant experienc trip time ant experi affect entri rout tabl visit rel ant local inform built inform collect travel implicitli reduc varianc estim characterist make antnet robust wrong estim algorithm local wrong estim propag node comput estim destin bad algorithm perform depend long wrong estim effect function time window estim comput learn paramet antnet probabilist rout tabl rout data packet test algorithm antnet determinist rout tabl entri rout tabl estim destin estim provid mislead inform algorithm fast follow traffic case heavi load condit antnet rout tabl probabilist entri reflect good path choic respect forc data packet perceiv path posit effect balanc traffic load result util resourc shown experi remark end section probabilist structur rout tabl updat antnet exploit ant arriv rate assign implicit reinforc discov path obviou effect obtain rout tabl estim estim probabilist case trip time sampl jordan show stochast polici yield higher perform determinist polici case incomplet access state inform environ author develop stochast polici evalu confirm antnet deal incomplet inform problem distribut stigmerget control commun network modifi statist estim simpli oscil expect induc cumul effect probabilist rout tabl provid remark addit give ant explor method discov possibl ant data rout independ explor rout continu data packet exploit reliabl inform interest note probabilist rout tabl entri learn adapt chang posit feedback ignor neg reminisc older automata approach rout telecommun network learn automaton network node automaton defin set action vector continu set input learn algorithm learn associ automata connect feedback configur environ set penalti signal environ action defin rout choic modif learn strategi carri probabilist network condit narendra main differ li fact antnet ant part environ activ direct learn process interest region search space environ plai activ role learn good pair antnet robust rout tabl updat frequenc bf broadcast frequenc rout inform plai critic local network statu frequenc problem easi make avoid larg oscil rout tabl updat data belong pair neighbor node visit packet updat reason strategi explor rout undesir delai data delai discov good great handicap domain good rout chang time rout tabl set static link cost basi physic characterist lack adapt metric main reason poor perform remark section slightli penal respect real addit heurist knowledg traffic pattern network administr set link observ robust ant gener wide rang gener independ network algorithm perform good rout overhead neglig section antnet reinforc learn characterist rout problem interpret stochast rl problem structur make natur draw parallel antnet classic rl approach worth remark rl problem algorithm di caro dorigo problem unlik assumpt markovian process consid satisfi characterist adapt rout problem make difficult suit solv usual rl algorithm explain determin departur antnet classic rl algorithm relat structur antnet rl algorithm connect outcom trip time process transform raw valu refin reinforc reminisc system raw reinforc signal process critic learn model node compon underli fed learn system rout tabl transform evalu polici ant critic account variabl traffic meet comput requir antnet classic rl system relat interpret parallel replic mont carlo system shown singh sutton mc visit state estim simul system batch tempor differ method replac trace decai paramet antnet mc simul import differ type mc singh sutton rl due differ consid class problem outcom experi updat local model captur variabl network statu partial gener sequenc stochast polici mc system consid singh outcom experi comput estim expect varianc state return total reward visit markov chain spite weak parallel method highlight import differ antnet competitor gener td gener stochast transit chain forward inform state tripl destin hop predecessor state reward basi ant trip time inform strictli relev approach complet bf algorithm build distanc estim node predict made node propag estim inform step distribut version class algorithm transform gener transmit backward visit node inform collect rout packet gener data hop greatli rout traffic hop data make approach feasibl tempor differ method context rout present import kei condit estim success state strictli satisfi gener case due predict made node time destin node distribut stigmerget control commun network fact dynam node relat highli dynam traffic process evolv concurr interact traffic pattern control action modif rout aspect explain part poor perform pure algorithm relat work algorithm base ant coloni metaphor inspir ant coloni forag behavior dorigo al dorigo al appli travel salesman problem natur idea applic similar present set agent repeatedli run mont carlo experi outcom chang estim variabl subsequ ant build solut call edg graph repres tsp ant build tour exploit pheromon trail inform node ant node move visit probabl ij function amount pheromon trail edg connect local heurist interest reader find detail descript dorigo pheromon trail updat ant built tour ant add visit edg quantiti pheromon trail proport qualiti tour gener shorter higher quantiti pheromon trail effect similar antnet rout tabl higher pheromon trail edg probabl chosen futur differ due type problem combinatori optim problem versu time problem major previou applic ant coloni inspir algorithm concern combinatori optim recent applic rout schoonderwoerd al rout applic domain ant coloni algorithm control appli rout telephon differ antnet respect main differ direct consequ network model characterist figur connect link potenti carri infinit number fix bandwidth transmiss node switch limit connect necess queue manag bottleneck put congest network express term connect switch network congest statu path complet path connect exhibit addit relat predict destin ks neighbor wai di caro dorigo level congest direct congest depend state node path deal telephon call occupi link bidirect channel link link link figur network node telecommun network model schoonderwoerd al physic channel path multiplex accept depend possibl reserv physic circuit connect caller receiv model assumpt make problem schoonderwoerd al rout problem data network present paper differ reflect algorithm differ abc import abc ant updat pheromon trail wait complet experi antnet reminisc pheromon trail updat strategi implement ant coloni base algorithm make abc behavior closer real made assumpt made author differ abc local model score ant trip local heurist inform memori improv ant polici recov cycl inform ant network model implement detail tightli bound network imposs compar abc algorithm antnet chen algorithm net algorithm straightforward extens schoonderwoerd al system ad uniform addit explor mechan avoid rapid converg algorithm limit subramanian al work algorithm base hypothesi appli network requir met futur work introduc distribut approach rout commun network compar antnet rout algorithm varieti realist testb antnet show superior perform robust intern paramet set experi antnet innov aspect stigmerget commun coordin action set agent cooper build adapt rout tabl applic concept optim problem dorigo distribut stigmerget control commun network dorigo applic present uniqu respect control coupl inform collect ant modifi rout build local model network statu direct rout tabl modif attempt evalu control realist simul commun simul retain basic compon real rout system interest step direct test applic idea present real rerun experi present complet internet simul attempt evalu control compar stigmerget algorithm algorithm realist set benchmark problem antnet turn perform test condit number direct current work list extens current work simul flow congest control compon error requir pair tune rout select match dynam forward ant make random build path sourc node destin node path built exploit inform probabilist rout tabl statu queue visit node build ant collect inform statu network share link queue data measur wait time queue time raw reinforc backward ant forward ant share queue data time requir run experi depend network approxim time requir packet sourc node destin node delai moment inform collect forward ant distribut backward make improv schema add model deplet forward ant high prioriti queue reach destin store cross time step direct di caro backward ant make opposit forward queue local model find estim local queue cross time raw updat rout comput estim delai real inform recent estim inform interest scheme work confid local queue model backward ant build estim accur make improv system effect current cost comput complex node discuss section antnet miss main compon classic inform state previou node polici learn complet local perspect obviou extens work studi version antnet closer algorithm di caro dorigo case node maintain express estim distanc destin neighbor estim updat ant trip time outcom estim success node destin carri backward ant paper appli antnet rout datagram commun network reason antnet easili adapt gener car rout guidanc dynam traffic assign system system exploit emerg vehicl technolog manag control transport system attent highwai provid level inform advic system user make time inform travel adapt rout vehicl traffic present similar featur rout data packet commun network vehicl traffic control system interest properti simplifi layer activ rout implement transport layer commun network exist limit vehicl traffic control algorithm typic transport layer activ data acknowledg retransmiss implement real vehicl flow strong constraint peopl happi forbidden leav offic hour ground car make antnet interest express full potenti rout algorithm ant link desir increment find root ant coloni biolog metaphor inspir obtain excel interest investig neg potenti lead stabil observ peopl work older automata system discuss antnet differ automata system activ role plai ant neg reinforc show reduc probabl link ant perform badli acknowledg work support fellowship award di caro contract marco dorigo research associ gratefulli acknowledg receiv toni nick bradshaw georg comment earlier draft comment provid anonym craig associ editor manag review process appendix optim shortest path rout characterist rout optim shortest path rout section distribut stigmerget control commun network optim rout optim rout perspect object optim function individu link flow optim rout model call flow model optim total flow network flow commod traffic flow sourc cost optim function subject constraint flow conserv node posit flow link worth observ flow conserv constraint explicitli state traffic arriv rate rout polici consist split traffic pair strateg shift traffic gradual altern rout result multipl path traffic flow pair implicit optim rout assumpt main statist characterist traffic optim rout static rout evid kind solut suffer problem static router shortest path rout shortest path rout pair perspect optim global cost function optim rout node pair consid priori knowledg traffic process requir knowledg fruitfulli cost assign dynam base statist measur link congest strong feedback effect introduc rout polici traffic pattern lead undesir theoret predict observ practic wang popular cost metric account queu transmiss link link capac combin measur cost updat involv attempt reduc big variat statist link congest state cost reflect measur traffic load link transmiss capac loss effici case condit priori assumpt traffic pattern strongli violat practic content store rout shortest path algorithm subdivid class call shankar common behavior shortest path algorithm depict node assign cost outgo link cost static dynam updat presenc link failur basi observ statist averag defin di caro dorigo period requir node send neighbor packet inform describ current estim quantiti distanc receiv inform updat local rout tabl execut action rout made determinist path inform store rout adopt flexibl strategi inform store tabl random altern path main featur specif class algorithm make rout tabl consist set tripl form estim defin destin network neighbor node consid switch requir topolog inform repres list reachabl node identifi averag node memori occup order number node network averag connect averag number neighbor node consid algorithm work asynchron distribut inform node send neighbor list estim distanc node network receiv inform neighbor node receiv node updat tabl distanc estim overwrit entri node receiv valu rout node made hop node satisfi arg min fd ij ij assign cost link connect node neighbor estim shortest distanc node destin shown process converg finit time shortest path respect metric link cost time briefli algorithm literatur distribut ford bertseka base principl dynam program prototyp ancestor wider class algorithm develop aim reduc risk circular loop converg case rapid link cost estim node tripl defin destin distribut stigmerget control commun network algorithm make rout tabl inform algorithm core algorithm distribut replic essenti dynam map describ detail compon current interconnect node calcul path algorithm dijkstra algorithm wide varieti altern effici algorithm memori requir node case common form node act broadcast inform link cost state comput shortest path destin basi local link cost estim estim receiv node rout inform packet broadcast neighbor node turn send packet neighbor distribut flood mechan inform transmiss minim number case algorithm gener templat varieti version implement make algorithm behavior robust effici refer design implement rout testb tech rep institut advanc comput studi depart comput colleg park adapt element solv difficult learn control problem ieee transact man trail select shortest path ant journal theoret dynam program princeton press rout problem quarterli appli dynam program optim control athena scientif data network program athena scientif case chaotic adapt rout tech rep depart comput seattl di caro dorigo natur artifici swarm intellig oxford press packet rout chang reinforc learn approach advanc neural inform process system pp san kaufmann tcp techniqu congest detect avoid acm comput commun review extend rout protocol bounc effect acm comput commun review shortest path theori evalu annual symposium discret algorithm pp va acm press predict reinforc learn approach adapt traffic control advanc neural inform process system pp mit press distribut optim ant coloni european confer artifici life pp elsevi ant colour graph journal oper research framework rout internet internet draft internet engin task forc evalu tcp vega live emul tech rep comput scienc southern lo angel di ant coloni algorithm rout datagram network tenth iast intern confer parallel distribut comput system pp press note problem connect graph numer learn natur algorithm phd dipartimento di politecnico di distribut stigmerget control commun network di ant algorithm distribut discret optim tech rep universit de submit artifici life ant coloni cooper learn approach travel salesman problem ieee transact evolutionari posit feedback search strategi tech rep dipartimento di politecnico di ant optim coloni cooper agent ieee transact flow network shortcut ant la reconstruct du le coordin sp la theori de la essai du comport de termit insect mobil gener distribut comput intern symposium parallel synthesi pp ieee comput societi press reinforc learn algorithm partial observ markov problem advanc neural inform process system pp mit press reinforc survei journal artifici intellig rout metric acm sigcomm comput commun rout rout commun chap pp reinforc learn select percept hidden state phd depart comput rochest rout algorithm ieee transact di caro dorigo distribut rout protocol ieee transact anatomi internet rout protocol behavior learn automaton chang environ applic telephon traffic rout ieee transact nonstationari model learn automata rout data commun network ieee transact random variabl stochast process comput system approach morgan kaufmann simul mont carlo method john wilei son qo rout work group report internet internet engin task forc agent load balanc telecommun network intern confer autonom pp acm press load balanc telecommun network adapt perform comparison rout protocol dynam static file transfer connect acm comput commun transient perform rout versu tech rep institut advanc comput studi depart comput colleg park reinforc learn replac elig trace machin learn state estim partial observ markovian process eleventh machin learn pp morgan kaufmann rout commun network multiag survei machin learn tech rep carnegi mellon pa distribut stigmerget control commun network varianc reduct algorithm parallel replic simul uniform markov chain discret event dynam theori ant reinforc case studi rout dynam network intern joint confer artifici pp morgan kaufmann atm forum privat interfac version commun network morgan kaufmann analysi rout algorithm dynam network environ acm comput commun simul laboratori evalu dynam traffic manag system phd depart civil massachusett institut technolog
IR/88 5 automat analyz organ music archiv andrea marku depart softwar vienna technolog austria abstract experienc tremend amount music made digit form creation larg multimedia wai make collect access user music repositori exist limit access content retriev item base textual advanc system support acoust queri facilit explor music librari automat organ music sound characterist similar piec music group classic section music repositori paper present approach obtain organ music data base extens digit librari system text document emploi map creat map music piec music similar sound characterist organ map displai locat piec music map leav relat music intuit explor music archiv music map explor inform user introduct experienc tremend amount music made digit form sweep success music swap system rise amount music distribut electron archiv expect due current move music industri electron distribut product consequ expect larger archiv piec music varieti genr creation larg audio wai make collect access user talk multimedia content di erenti di erent form content made textual automat handl analysi textual data long histori inform promin type multimedia inform reli heavili manual index descript facilit automat access kind metadata descriptor form core entiti standard due complex multimedia data work limit discuss audio data talk interfac electron music archiv basic distinguish primari mode summar access search access search text song search melodi type titl speci music genr music repositori exist todai limit access content rst retriev document base textual metadata band user conveni locat piec music satisfi larg percentag user request slightli challeng task nding piec music base mean access requir transcript text electron creat limit support speech recognit program set search music archiv base form natur approach collect input system form melodi record hum system extract melodi score match tune collect approach address search situat user approach natur support search type speci titl approach explor music archiv promin convent record custom titl organ primarili subsequ alphabet sort artist section user browser section interest piec ect exploratori approach music search direct search titl similar form organ found peopl privat record commonli organ type music make easier pick kind music hear situat support kind interact result creation manual tender group music le electron music artist le music mimick music organ convent music store librari analyz genr hard variat genr larg de ned music archiv list titl di erent organ hierarch layer titl commonli led hierarchi di erent sound characterist titl genr vari make cation weak guidelin match music tast manual classi cation task involv render approach dicult support larg archiv frequent chang collect automat organ music sound characterist similar piec music group classic section music support exploratori interfac audio collect paper present approach obtain organ music data neural network approach creat map titl music archiv task compar organ textual group text subject deal adapt concept digit librari system system provid organ text includ audio data emploi map creat map music piec music sound similar organ map displai locat piec music map leav similar music intuit explor music archiv remaind paper organ section overview relat work eld music retriev present approach automat organ music archiv sound similar section cover featur principl architectur organ music result organ archiv music present section outlook futur work section relat work analysi audio data long focu work area rang spectra identi cation voic fault detect electr drive respect music classi distinguish main reli frequenc spectra melodi approach analog system queri system extract characterist melodi featur match audio le archiv work reli music instrument digit interfac le format repres score seri sound score interpret sound make descript format produc audio le format huge bene ts term melodi reduc complex retriev problem match symbol music note develop system note sequenc enter midi keyboard search tune begin match input facilit acoust queri midi transcript acoust input symbol music note highli requir system make kind badli sung rhythmic di erenc version transform hum queri seri string token repres music note previou subsequ approxim retriev promin repres kind system zealand music digit librari varieti search metadata record system retriev tune base hum queri user trust capabl maintain system match hum melodi tune collect similar system report system focu retriev music data base search separ stream research address analysi classi cation music data concentr extract characterist sound characterist compar refer vector provid classi distinct di erent kind sound semin work eld work al similar system foot vector di erent type speaker er describ system capabl detect video system work directli acoust audio data context concentr beat identifi regular rhythmic structur work direct report spirit work address instrument detect base frequenc analysi special lter appli extract put weight frequenc characterist speci instrument al describ system classi cation identifi instrument clean degrad condit similar work map cluster result featur vector similar incorpor model frequenc transform som cluster data basic principl digit librari system capabl automat organ music data base sound characterist extend digit librari system incorpor audio result system system capabl automat organ collect text document content map popular neural network fig featur som train provid topic sort map word histogram train process includ special featur extract process appli system principl automat organ music data figur overview result system characterist piec music cluster procedur rst creat cluster music segment length cluster result music segment analyz cluster piec music similar principl system popular open sourc media extract frequenc spectra music data wave le frequenc spectra provid evenli space time lagrang transform obtain time snapshot fast fourier transform segment select set frequenc spectra obtain fourier coecient model dynam featur vector train som music segment segment similar sound characterist locat highli di erent sound segment found section map frequent piec music show distinct sound characterist segment spread di erent part map uniqu featur vector creat piec music base cluster distribut segment vector fed som creat map music individu step detail subsect featur extract preprocess music varieti le format basic store sound inform form code modul sampl rate khz analog sound signal repres bit integ number interpret media player reproduc sound signal order comput similar score music featur vector piec music analyz som start popular music le media open sourc multimedia system capabl split data stream frequenc band signal split frequenc approxim sampl ms frequenc band evalu sound order reduc amount data subset frequenc band frequenc select cover spectrum order captur music variat music stream split section treat singl music entiti analyz basic sequenc overlap segment result shown cluster result obtain som subset segment segment begin end speci piec music elimin ignor ect result show interv sucient qualiti data analysi interv frequenc snapshot provid player vari system load occur speci ed time interv set valu ms select frequenc band order obtain data lagrang interpol perform valu provid express repres amplitud sampl point time stamp sampl point result transform data sampl frequenc band result function approxim linear combin sine cosin wave di erent frequenc obtain close frequenc band perform fast fourier transform result set coecient respect sine cosin part combin coecient frequenc band result vector repres segment music featur vector train map map map neural network provid map input space output space preserv topolog relat faithfulli som consist set unit arrang weight vector attach unit element high input refer input vector present som activ unit present input vector calcul euclidean distanc weight vector unit input vector serv activ function step weight vector unit show highest activ smallest euclidean select modi ed close resembl present input vector pragmat weight vector winner move present input signal fraction euclidean distanc learn rate unit activ higher time input signal present weight vector unit neighborhood winner neighborhood function modi ed strong amount winner learn procedur nalli lead topolog order map present input signal weight vector train map serv prototyp cluster centroid similar input data map neighbor region map featur vector map similar map euclidean distanc featur vector unit weight indic featur vector correspond characterist cluster som base architectur found wide appreci eld text cluster due capabl handl featur space cope inher data characterist make som suitabl tool music data cluster similar situat extens basic som algorithm detect hierarch make suitabl interfac explor larg data collect reli standard som music segment piec music featur vector repres music segment thought data point similar piec segment exhibit similar frequenc spectra similar fft locat close som cluster featur expect similar music segment locat close result map displai result segment som segment scatter map mutual similar piec music touch di erent music genr locat di erent homogen piec music locat con ned cluster map intuit interfac music cluster built top segment map obtain group piec music characterist obtain map posit segment piec music creat featur vector piec music locat segment descript attribut som creat weight attribut unit segment som vector attribut repres number segment piec music map respect unit som piec music consist fig creat vector base segment distribut map unit upper left corner segment unit segment neighbor unit depict figur attribut result featur vector song basic set valu subsequ norm unit length make length di erenc song directli number segment map speci unit attribut newli creat input vector piec improv data incorpor inform similar segment weight vector unit map weight vector serv cluster map distanc segment featur vector unit weight vector give higher weight segment similar cluster give lower weight segment map unit distribut contribut segment map speci unit unit util characterist som stabl segment distribut segment map gaussian center winner model contribut segment locat neighbor attribut featur vector music som shade figur creat featur vector piec music base distribut segment segment som train som featur vector obtain cluster piec music map singl locat result similar piec music map close experi experi collect piec rang classic hit cat steven queen break modern tom jone song segment segment total frequenc band notat refer unit column row start upper left corner fig som repres piec music select lagrang interpol fft end featur vector repres segment song featur space featur vector train segment som due space restrict provid result exampl discuss song individu segment map small number neighbor unit segment classic titl map lower area segment som provid segment som unit repres classic segment map av klein segment crash bang classic piec music segment music calm result map segment cluster intro passag song map classic cluster segment som passag frequent guitar independ instrument rest song soft dynam passag segment spread cluster segment song similar characterist characterist song map segment spread larger area segment map order obtain compact music creat featur vector song base locat segment result featur vector song featur vector train som repres figur song map singl posit music characterist classic cluster lower left corner unit repres march piec consist calm piano segment map classic cluster segment map unit repres sole classic air concert piec und klein song folk song rst glanc cluster listen sung woman accompani make perfectli classic organ folk cluster strict music genr neighbor unit piec av und der piec concert import som organ song sound characterist move unit repres dynam piec classic composit vocal piec la bryan adam classic piec music strict term music calm accompani time unit repres piec john main theme movi park list map unit soft love song piano unit cluster nice demonstr topolog preserv capabl som dynam intens piec music left pick di erent section robbi william pet shop boi map unit lou tom jone unit special map worth mention cluster song singl singer alli search kiss neighbor unit sung shepard plai group set accompani instrument titl kiss cover version locat cluster unit access digit librari base mean explor collect order understand inform approach exist ration textual access multimedia collect limit retriev item base textual queri explor multimedia collect found limit facil reli manual categor item paper present approach creat organ music archiv acoust characterist piec music neural creat map similar extract frequenc segment length segment similar sound characterist map physic close result segment som rst music segment organ obtain base cluster complet song obtain level cluster distribut segment som creat featur vector piec fed map level map obtain organ archiv music sound similar classic piec music group close set pop music pop titl classic instrument map closer classic sector map present approach support explor music archiv automat group titl sound creat kind organ nice combin complement tradit interfac music convent queri music advanc retriev method base melodi order improv qualiti addit featur incorpor mere frequenc spectra dynam investig addit beat inform model featur provid separ perceiv similar sound refer digit librari popular music fox proc acm conf digit librari page august acm de auditori model organ neural network classi cation journal music rauber grow hierarch selforgan map proc intern joint conf neural network volum page juli ieee comput societi dixon beat track music knowledg proc european conf arti cial page io press automat index sound neural net comput music foot retriev music audio proc spie multimedia storag archiv system volum page bc queri music inform retriev audio proc acm intern conf page san novemb acm person comput kohonen map massiv document collect ieee transact neural lin semant map inform retriev proc annual intern acm sigir conf research develop inform retriev page octob acm cunningham digit music tune retriev acoust input proc acm intern conf digit page march acm midi speci march goto rhythm track audio signal chord chang detect music proc workshop comput auditori scene august lindsai part ieee page automat audio content analysi proc fourth acm conf page novemb merkl automat detect organ document topic base approach bookshelf creation arrang proc european conf research advanc technolog digit librari number lectur note comput page septemb springer rauber merkl digit librari system abiteboul proc european conf research advanc technolog digit librari number lnc lectur note comput page septemb springer rauber integr automat genr analysi digit librari proc joint conf digit june acm retriev music collect proc annual intern acm sigir conf research develop inform page august acm classi cation search retriev audio ieee fall andrea marku automat analyz organ music archiv proc european conf research advanc technolog digit librari sept lectur note comput scienc germani
IR/89 5 improv text categor method event track yime yang tom thoma pierc charl languag technolog institut comput scienc depart newel simon hall carnegi mellon pa abstract autom track event chronolog order document stream challeng statist text classif exist learn techniqu adapt improv order effect handl difficult situat number posit train instanc event extrem major train document event short durat time adapt text categor specif variant neighbor algorithm rocchio track event method show improv reduct weight error perform origin knn algorithm tdt benchmark make knn system recent offici evalu combin significantli reduc varianc perform event track system data suggest robust solut paramet optim ffl event detect track ffl machin learn ir ffl model ffl text categor ffl evalu introduct topic detect track line research major segment broadcast detect event segment unseg track develop event base sampl stori event focu research paper problem defin automat assign event label document present system chronolog order event tdt context occur specif place time specif action contrast topic tradit text categor event local space time crash topic event system tdt domain distinguish part topic event typic short durat small portion corpu event event track consid text categor problem subject ffl event interest defin set posit instanc manual identifi track knowledg ffl document binari made track system respect defin event ffl document document evalu train data posit instanc rest document unlabel document posit instanc ffl train relev judgement event assum unknown actual user track system identifi small number document relev event interest event interest user expect share relev judgement statist learn difficult identifi document instanc live event stabl topic prior probabl subject categori reuter newswir stori stabl accur estim retrospect collect stori estim prior probabl recent futur event event instanc retrospect data collect event evolv unpredict wai time major train document learn exact surfac difficult event track tradit text categor problem train document label complet categori set classif method reli accur prior probabl estim larg amount label train data perform poorli event track exist text categor method modifi perform tdt condit small size event present special difficulti tune paramet track system produc optim result text standard approach learn optim paramet valid set document train evalu believ suffici repres unseen test document event small number label posit exampl onlin requir test document arriv make difficult construct valid set repres unseen document typic number posit train exampl tdt benchmark evalu size event evalu set larger averag hold posit train exampl valid reduc effect small number posit exampl held valid offer suffici statist paramet tune posit train exampl event repres posit exampl event altern approach paramet optim tune paramet retrospect corpu larger number posit exampl identifi event work long optim paramet set older event optim newer event evalu larg suffici number posit exampl retrospect valid corpu empir result tdt evalu group research shown optim paramet set earli document overli optimist expect optim paramet set gener event open challeng event track partli address recent tdt research benchmark number inform retriev machin learn techniqu includ neighbor tree varieti languag model approach filter systemat analysi behavior event track task begun report research find knn rocchio event track knn method track system offici rocchio approach investig tdt filter system appli tdt similar method document document repres vector weight term word phrase common version term weight defin log log dk weight term document term frequenc log invert document frequenc number document train number train document dk vector rocchio rocchio classic retriev method queri relev judgment rocchio formula defin fi jrj fl jsj origin extend train consist train document relev consist train document irrelev fi fl weight compon summat rocchio appli text categor modifi jrj fl prototyp centroid categori rocchio event defin sn consist measur cosin neg instanc posit centroid formula select neg exampl lie neighborhood base term weight intens studi ir literatur implement standard version provid smart benchmark retriev system test common option found ltc option yield result limit experi ltc term weight scheme document collect find term weight scheme open research question posit centroid categori test document score comput cosin similar binari obtain threshold score note classif rocchio depend estim prior probabl categori assumpt necessarili defici event stori collect short time period similar content small number posit exampl train form tight cluster rocchio perform event track weaker method text categor comparison support vector boost sleep induct rule learn naiv classifi variant knn knn classif method commonli pattern recognit machin learn found knn robust approach text rank classifi evalu benchmark collect method compar perform includ tree boost weiss support vector machin boost method schapir linear squar fit map yang neural network wiener al adapt convent classif knn classif problem event track construct knn event knn comput relev score test document formula call test posit train train set number nearest neighbor system comput pk set posit instanc nearest neighbor binari respect event obtain threshold knn depend estim prior probabl event unlik rocchio perform deal evolv event empir verifi corpu suffici number event corpu knn multipl centroid inform neighborhood local test document perform knn depend choic text empir evalu shown stabl optim perform knn typic occur larg retrospect valid set optim optim test document optim event problem formula small number posit exampl train set larg retriev neg sum easili exce sum posit neg dissimilar test document small similar score small system retriev neg exampl test document close posit train system lose discriminatori power test document resolv modifi score function formula altern call kp kn consist kp nearest neighbor posit document train consist kn nearest neighbor neg document train set score averag score sum modif set larg number neg exampl domin differ version local zone posit nearest neighbor kn neg nearest nearest size zone small system posit neg instanc score test document system lose discriminatori power small local zone empir result show variant knn significantli improv track perform origin knn paramet tune mention paramet tune tricki issu event track knn method valu kp kn rocchio valu fl method threshold binari tune optim result address unavail adequ valid set tdt track combin output set classifi tune paramet combin system retrospect corpu larger number posit exampl identifi event idea strategi invest varieti fund stock market offset volatil yield return averag long practic inform retriev speech recognit combin output larg number system yield result entiti larg individu perform varianc averag produc singl entiti varianc reduc leverag idea effect paramet tune event track combin output multipl classifi error tend perform varianc combin system individu classifi combin system yield result test collect optim valid set individu system optim valid set test hypothesi dozen system larg number system limit empir valid variant knn rocchio care analysi behavior method condit combin design experi verifi effect set data disjoint time corpu corpu corpu set event label posit document set event overlap corpu paramet tune corpu vice versa event split corpu label posit half corpu half test run rocchio corpu paramet set select run optim det global includ optim low alarm low miss balanc error run select normal score select run step origin score standard deviat sum normal score run renorm result result score output combin result gener tune corpu evalu corpu identifi threshold yield minimum result select run step creat parallel run corpu paramet combin parallel run creat parallel borg result corpu evalu parallel run corpu optim paramet corpu compar result parallel run individu classifi swap role corpu corpu repeat step result experi describ section data evalu measur corpora chose corpu stori cover juli june corpu cover januari june corpora corpora set evalu condit close benchmark evalu make result compar publish result evalu develop research tdt pilot research benchmark evalu corpu tdt research consist roughli half stori randomli sampl reuter half cnn broadcast manual transcrib journal graphic institut twenti event manual identifi memori particip period cover corpu scan exhaust relev judgement made event stori corpu document event averag stori assign label focuss mention mention event event note process result subset exist event label complet relev judgment document event corpu split point posit stori split point remain stori test fifteen event maximum event track evalu fix make set consist evalu develop larger richer consist document manual identifi event event consist document averag corpu event exhaust relev judgment entir corpu tdt data collect made linguist data consortium offici tdt stori judg train exclud test evalu make result compar result tdt benchmark evalu document collect radio program document english version document audio sourc transcrib manual automat speech recognit twenti event select evalu basi event parallel corpu posit instanc english mandarin track system posit train instanc event train data dry run corpu split immedi fourth posit english sourc fourth posit mandarin whichev occur stori split point impli split posit train exampl languag explicitli label measur evalu tabl tabl tabl true true perform measur defin ffl miss ffl alarm ffl recal ffl ffl track cost ff ff global perform event evalu obtain sum cell tabl individu event comput global perform score combin obtain comput perform measur averag introduc score bia inform primari measur ff ff benchmark tdt evalu present result measur refer addit measur defin classif tradeoff show vari threshold affect miss rate det curv obtain sweep includ mandarin data import corpu make result compar tdt benchmark evalu result alarm probabl random kn figur knn variant alarm probabl random rocchio rocchio figur borg combin rocchio knn variant threshold rang score gener track evalu perform consecut plot normal deviat miss versu alarm rate interv result primari result test rocchio variant knn paramet set fl kp kn knn yield det curv method paramet set figur show det curv method mean minimum method li curv refer line system random perform ad poor baselin det curv plot normal deviat miss alarm rate random perform gener straight line pass error point det curv low alarm area low miss balanc error curv significantli combin variant knn curv region end larger higher ad rocchio shown figur yield margin improv interpret rocchio centroid larg number neg kn neg train exampl knn tend make similar classif influenc posit train exampl discount neg train exampl combin highli correl method expect produc result individu system optim obtain threshold det curv shown tabl tune system evalu corpu column rocchio fl lowest score individu method variant knn score significantli origin reduc score reduc score tune system evalu improv knn variant event combin rocchio knn variant yield ident score score found individu method corpora result tune system corpu evalu corpu shown column tabl result tune system corpu evalu corpu shown column tabl threshold optim decisionmak evalu run select ffl exact threshold optim system corpu ffl select threshold gener proport tune corpu evalu corpu strategi onlin document strategi yield result provid tabl comparison perform varianc reduct borg combin knn rocchio perform score good slightli individu point borg fine tune techniqu margin improv fix corpu valid goal improv perform consist track system collect event track exampl achiev goal combin classifi learn strategi shown borg combin rocchio knn variant convinc expect multipl learn strategi fail gracefulli data event classifi optim valid corpu multipl learn strategi produc kind error simultan illustr tabl singl method perform poorli data paramet borg tune consist perform yield reduct rocchio appli optim threshold borg corpu score document tabl figur illustr det curv method evalu paramet borg smaller perform varianc region error space compar individu method explain optim threshold easier borg individu method observ strongli support assert section difficulti paramet tune collect support combin classifi reduc perform varianc alarm probabl random paramet paramet figur varianc optim paramet corpu alarm probabl random paramet kn paramet kn figur varianc optim paramet corpu tabl result summari classifi evalu corpu system aa ffi ffi ffi kn rocchio tabl result summari classifi evalu corpu system bb ffi ffi ffi kn rocchio tune test tune test tune test tune test reduct borg individu classifi alarm probabl random rocchio paramet rocchio paramet figur varianc rocchio optim paramet corpu summari futur research paper studi effect knn rocchio event track address open question train classifi extrem small number posit exampl paramet learn valid corpu develop variant knn overcom specif problem origin version appli event version reduc averag cost sum weight error made knn system recent offici evalu found robust solut paramet combin output classifi learn strategi evalu benchmark collect show reduct combin knn variant rocchio singl method valid strongli support effect approach power solut problem event categor document world wide web categori space typic fast grow alarm probabl random borg borg figur varianc optim paramet corpu effect train extrem rate categori convent text categor problem studi approach larg number includ support vector neural network refer jame jaim georg jonathan yime yang topic detect track pilot final report darpa broadcast transcript understand page san morgan kaufmann jame ron victor event detect track annual intern acm sigir confer research develop inform page associ comput machineri jaim yime john ralf tom xin liu cmu report detect track darpa broadcast page san morgan kaufmann william cohen yoram singer learn method text categor nineteenth annual intern acm sigir confer research develop inform associ comput machineri jon system yield reduc word error recogn output vote error reduct ieee workshop automat speech recognit ieee signal process societi jon georg john martin nist topic detect track evalu darpa broadcast transcript understand page san morgan kaufmann lam cy ho gener instanc set automat text categor ann int acm sigir confer research develop inform retriev page larkei bruce croft combin classifi text categor nineteenth annual intern acm sigir confer research develop inform page associ comput machineri ho lee combin multipl evid properti weight scheme eighteenth annual intern acm sigir confer research develop inform page associ comput machineri david robert jame ron papka train algorithm linear text classifi nineteenth annual intern acm sigir confer research develop inform associ comput machineri det curv assess detect task perform eurospeech volum relev feedback inform retriev smart retriev experi automat document page englewood salton bucklei improv retriev perform relev feedback journal american societi inform robert yoram amit singhal boost rocchio appli text filter annual intern acm sigir confer research develop inform page associ comput machineri michael schultz mark liberman topic detect track cosin coeffici darpa broadcast page san morgan kaufmann maximum likelihood model topic classif broadcast shaw edward fox combin multipl search text retriev page schwartz topic detect broadcast darpa broadcast page san morgan kaufmann sm de fj maxim perform ieee intellig yang expert effect effici learn human text categor retriev ann int acm sigir confer research develop inform retriev page yang evalu statist approach text categor journal inform jg thoma brian xin liu learn approach detect track event ieee intellig yang liu text categor method annual intern acm sigir confer research develop inform page associ comput machineri carbonel studi retrospect event detect ann int acm sigir confer research develop inform retriev page
AI/90 2 semant principl induct definit marc deneck depart comput belgium abstract exist induct definit construct mathemat review strong correspond lp model perfect model semant appar point fundament restrict exist argu semant overcom problem superior principl induct definit contribut studi lp knowledg theoret interpret lp logic repres definit knowledg point fundament differ knowledg theoret interpret lp commonli interpret lp default theori theori relev differ knowledg theoret interpret strong impact knowledg methodolog extens lp repres uncertainti induct logic program introduct complet semant clark aim mean logic program set definit map logic program set order logic motiv research nonmonoton logic program default logic logic gelfond semant stratifi logic program base interpret formal gelfond lifschitz motiv stabl semant logic program perspect logic program default theori compar program uniqu dead aliv proposit common semant lp perfect stabl wf uniqu model interpret program correspond theori read dead believ aliv complet semant mean program fol dead read show import differ complet read state aliv read inform aliv complet read map implic negat classic object autoepistem read map negat modal oper preserv implic explain intuit stabl correspond model reason model stabl semant classic logic plai role stabl model belief set atom model model fol repres state world model semant plai simpl comparison reveal mean semant clear correct model theoret comparison mean read complet basi world model theori set model complet set set role model repres state world comparison confirm intuit differ read world model theori set model reflect intuit mean aliv true dead true note belief stabl intersect state set model complet singleton interpret world repres dead aliv observ motiv closer investig relat logic program induct definit induct definit form construct knowledg construct inform defin relat collect construct process iter recip recip defin instanc relat term presenc tupl relat broad class human knowledg area human rang common knowledg situat construct natur reiter situat calculu situat calculu understood induct definit poset situat argu causal inform context ramif problem form construct inform effect forc propag dynam system construct semant causal rule defin induct definit construct mirror physic process effect propag context construct inform excel induct definit suggest transit closur binari relat natur perceiv relat obtain construct process close relat transit rule induct definit studi construct mathemat intuitionist induct definit iter induct definit logic fixpoint logic main goal paper review work show induct definit immedi reveal strong relationship model perfect model semant logic program point fundament knowledg theoret problem formal argu logic program formal semant superior section consid implic induct definit mathemat distinguish posit induct definit definit induct set prototyp definit induct transit closur tr graph tr defin induct tr arc arc arc tr arc formal repres tran ae intend interpret definit transit closur graph satisfi implic graph satisfi implic transit closur obtain construct appli implic bottom satur commonli induct definit transit closur express complet semant typic sort induct definit induct defin concept depend posit uniqu relat exist definit induct wellfound necessarili case definit concept defin domain element term strictli smaller element definit ordin power monoton oper simpl order definit definit number poset defin natur number induct formal definit form implic ae defin predic occur neg bodi rule verifi natur theori infinit minim model semant construct process express clark complet definit complex show element induct richer context concept depth element poset defin depth element induct ordin strict depth element simpl verifi unintend interpret domain bg satisfi complet implic larger ordin depth element depth repres singleton definit depth dx dx dx construct clark complet semant definit defin predic depth occur neg bodi multipl unintend minim model exist applic definit definit depth tree poset set tree valu domain infinit branch partial order relat finit branch depth natur infinit branch depth infinit ordin tree branch tree depth type induct definit requir sort semant question uniform principl induct definit correct induct definit integr complet attempt principl context iter induct definit studi induct definit mathemat start post spector import work area includ offspr research fixpoint overview idea area iter induct definit fixpoint logic overview attempt give faith present essenti idea freedom reformul syntax semant order uniform posit induct definit posit induct definit wai style induct definit interpret repres order logic formula posit occurr defin symbol arbitrari occurr symbol interpret fixpoint relat denot replac predic variabl context unintend minim model studi induct definit abstract obviou correspond definit logic program definit domain proposit symbol repres possibl infinit set rule overview mathemat principl describ semant induct definit model semant definit logic program defin model defin model implic minim model semant express axiom predic minim model express construct fixpoint tp oper definit present induct definit dualli defin monoton tp oper common fixpoint logic model express interpret atom proof tree lp commonli present slightli extend version formal symbol domain includ subset includ truth valu interpret interpret symbol symbol call open interpret symbol definit set rule head bodi consist atom posit neg liter set call set defin set open symbol denot assum symbol rule rule bodi rule empti singleton tree liter root ffl leav posit neg open defin ffl node set descend ffl infinit branch definit repres style repres abstract mathemat structur formula defin domain set atom defin set rule set mean true interpret set posit neg open liter extens formal introduc complex interpret liter extens facilit leap induct definit negat model set atom occur root leav true liter note interpret liter consist extend iter induct definit logic iter induct definit attempt mathemat principl definit induct order iter induct definit introduc studi formul intuit iter induct definit mathemat structur fix interpret interpret predic function posit induct definit prescrib interpret defin interpret defin symbol extend yield interpret top predic defin similar definit predic depend neg defin predic interpret principl iter sequenc posit induct definit abstract definit logic defin explicitli extend extens negat straightforward domain mathemat structur iter induct definit possibl sequenc ff posit induct definit defin symbol defin uniqu ff call ff stratum rule defin atom ff ff defin atom ff ff model definit obtain iter principl posit induct definit sequenc ff obviou correspond iter induct definit stratifi logic program perfect model semant defin semant stratifi logic program base iter induct definit logic defin time perfect model semant stratifi logic program defin appar work stai larg semant base sequent extend mathemat complex obscur simpl intuit underli semant intuit iid formul easi idea implement iid logic reason goal research investig theoret express form iid explain defin studi make finit repres iid abstract set definit infinit object investig iid encod singl fol formula form express semant order formula problem encod extrem tediou blur simpl intuit work similar perfect model semant histor definit encod finit perfect semant express notat definit construct sole illustr sw symbol sw abbrevi repres subsequ number negat definit stratifi strata defin predic model obtain iter ing encod abstract binari mean stratum ff defin true step encod abstract iid ff yield possibl infinit disjunct rule ff ff ff ff ff ff add ff disjunct obtain conjunct ff head conjunct atom stratum liter liter defin lower strata result formula rang ordin ff ff atom set atom formula liter replac open formula ff open formula repres restrict strata higher strata ff complex axiom axiom obtain stratifi abstract iid reason choic stratif defin nice abstract easili formul directli complex axiom determin uniqu predic encod incorrectli stratifi definit semant unnatur simpler axiom determin uniqu due mutual depend predic defin lower higher level disjunct disjunct sw step reduc formula finit show express semant iid axiom express essenti stratum set trueg satisfi definit ff axiom express principl posit induct set satisfi implic ff set satisfi implic denot formula obtain replac express arbitrari term axiom express ordin ff lower satisfi implic ff verifi assign valu ff elimin complex formula reduc disjunct axiom express ordin set satisfi implic ff order set variabl rang set atom variant circumscript encod finit formula encod ordin natur number total order encod ordin encod atom natur obviou encod atom natur number encod stratum sw encod tupl natur number natur number detail tediou irrelev omit infinit number disjunct repres finit formula quantif natur number set disjunct encod fn fn ing fn ing fn sw ing fn result finit inflationari logic extens posit induct definit negat arbitrari formula neg occurr result tp oper monoton fixpoint oper fixpoint construct idea fixpoint logic inflationari semant inflationari fixpoint logic natur induct definit extens relev context paper construct formula posit induct applic inflationari fixpoint unintend fixpoint ing obtain critiqu iter induct definit stratifi iid formal provid correct treatment induct definit negat defin intend knowledg absolut unsuit stratifi formal induct definit negat pose fundament problem stratif definit provid inform defin relat fact stratif definit impact exist wai construct semant iid recur predefin syntact stratif undesir stratif chosen choic explicitli reflect definit stratif iter induct definit base syntact criterion rule set formul alphabet stratifi rule set linguist variant alphabet variant definit illustr assum ing predic concept successor natur induct definit set variant definit stratifi due presenc rule good depend intuit innoc linguist varianc induct definit requir stratifi iid explicit stratif problemat gener definit concept term mathemat stratif definit gener unknown induct definit depth element order depth tree explicit stratif unnecessari unnatur improv principl induct definit argu mathemat variant semant logic program improv principl induct definit perfect model stratifi iter induct definit obtain iter posit induct principl construct sequenc ff interpret start gradual approxim model ff defin truth symbol ff leav atom defin level undefin role stratif process delai part definit inform safe appli posit induct principl part definit idea implement reli explicit syntact partit definit interpret partial interpret partial interpret partial function set atom fg classic total function set atom fg posit induct principl conserv extend definit negat definit defin posit induct oper pid input partial interpret repres truth valu subset deriv extend partial interpret defin truth valu atom deriv posit induct definit truth valu atom inform delai model definit obtain fixpoint construct knowledg theoret point kei problem definit principl posit induct context definit negat base show structur similar posit induct pid induct definit negat idea formal natur extens abstract definit version proposit domain proposit symbol gener definit consist rule posit neg open defin liter bodi set defin symbol head rule denot set open interpret symbol denot interpret open symbol definit defin section tree liter ffl leav open liter neg defin defin atom ffl set direct descend ffl infinit branch leav interpret liter negat defin atom note interpret atom consist root node definit posit induct oper pid map partial interpret leav true leaf true leav exist leav mathemat previou common lead eleg mathemat note plai similar role null real truth place holder undefin truth return issu interpret posit induct oper monoton oper wrt order extens monoton oper wrt fixpoint interpret symbol extend uniqu fixpoint pid definit pid model structur resembl posit induct pid pid appar import properti relat semant wf semant logic program proposit pid stabl model oper ident model model semant conserv extens wf model semant perfect model semant stratifi logic program definit partial model fp note chang role fixpoint comput fixpoint truth atom stage fixpoint mean truth atom undetermin stage truth mean construct defin truth undefin atom fixpoint point ambigu definit treatment ambigu definit consid similar classic ambigu definit model strict definit refin definit pid model model result logic simpl strategi avoid potenti problem model disadvantag inform extract ambigu definit definit entail formula situat analog classic logic permiss treatment definit partial model result sort paraconsist definit logic definit local inconsist local ambigu entail formula conclud remark paper studi concept induct definit paper investig concept past id iid drawback point improv inspir logic program strong connect id iid perfect model semant circumscript semant studi relev studi induct definit improv understand lp knowledg role lp artifici intellig read logic program autoepistem default theori definit give essenti perspect mean logic natur negat symbol implic symbol lp knowledg theoret studi paper relev develop knowledg methodolog widespread view advantag declar logic knowledg intuit linguist case read set rule induct definit read logic methodolog basi knowledg tight connect formal syntax semant clear intuit read facilit explicit expert knowledg formula theori understood expert linguist explicitli construct formal semant knowledg theoret studi import build natur systemat methodolog knowledg aim studi clarifi logic program knowledg sort knowledg repres simpl illustr impact linguist interpret knowledg methodolog definit dead mean natur express lp definit read singleton extend logic program base default correct dead aliv knowledg theoret studi relev design extens logic case lp respect knowledg major problem lp default view definit neg inform repres led gelfond lifschitz extend formal form classic negat extend logic program definit logic program entail plenti definit neg inform matter problem standard lp strength closur atom assum proven true repres uncertainti problem receiv lot attent recent year definit view standard problem predic definit natur idea extend logic open predic arbitrari interpret idea elabor extens call open logic program argu knowledg theoret interpret abduct logic program definit logic abduct solver sldnfa design formal special reason definit abduct deduct problem work base complet complet good induct extend studi semant defin paper futur work knowledg theoret interpret lp induct definit insight relationship class logic area definit logic class includ fixpoint logic descript logic van al show strong correspond descript logic larg descript logic consid correspond intuit semant differ syntact level syntact sugar specif syntact restrict descript logic develop highli effici reason techniqu subject futur work substanti claim broad class human knowledg area human rang common knowledg situat construct knowledg present form interpret defin paper promin role complet circumscript techniqu nmr knowledg hint acknowledg colleagu comment earlier version danni de kristof van refer vianu foundat publish introduct induct definit handbook mathemat page publish kr ha walker theori declar knowledg foundat deduct logic program morgan note lp definit logic provid default argu natur formal express sort default reason problem train cross order repres sort autoepistem modal oper default negat oper ad definit logic iter induct definit subsystem recent studi lectur note mathemat kl clark negat failur gallair logic page plenum deneck terminolog interpret logic program vw intern confer logic program nonmonoton page lectur note artifici intellig deneck de justif unifi framework semant logic program technic report depart comput deneck de abduct procedur abduct logic program journal logic formal theori iter induct definit subsystem analysi proof page north fit semant logic program journal logic gelfond stratifi autoepistem theori proc page morgan gelfond lifschitz stabl model semant logic program proc intern joint confer symposium logic page gelfond lifschitz logic program classic negat warren proc intern confer logic program page mit foundat logic program base induct definit gener gener induct definit technic stanford intuitionist theori iter induct definit je scandinavian logic page mccarthi applic circumscript formal knowledg artif elementari induct abstract structur publish post formal reduct gener combinatori problem american journal przymusinska tc przymusinski weakli perfect model semant logic program ra kowalski ka proc intern confer symposium logic page mit tc przymusinski semant stratifi foundat deduct logic program morgan tc przymusinski found semant coincid valu stabl model fundamenta reiter frame problem situat simpl solut complet result goal regress artifici intellig mathemat theori paper honour john page academ spector induct defin set natur number method symposium foundat page pergamon van de strong correspond descript logic open logic program lee proc intern confer logic page van depend ramif languag proc ninth dutch artifici intellig van emden ra kowalski semant predic logic program languag journal van ka js schlipf semant gener logic program journal
ML/91 6 depart statist madison technic report june januari empir comparison tree classif method loh shih madison nation chung cheng taiwan abstract twenti neural network classifi compar dataset term classif error comput case number termin node found averag error rate major classifi statist comput time classifi differ wide rang statist classifi base logist regress spline algorithm lowest averag error rate intens classifi base standard logist regress tree classifi quest algorithm linear split lowest averag error rate time faster tree classifi univari classifi base quest algorithm combin error rate tree tend leav algorithm classifi base rule good scale method introduct current research machin learn statist commun design algorithm tree classifi emphasi focuss accuraci classifi call statlog project spiegelhalt compar accuraci tree classifi tree classifi larg number dataset studi smaller scale includ brodlei utgoff moonei towel support part grant armi research offic wisconsin support part republ china nation scienc council grant loh shih technic report tree structur receiv attent tree size tree emploi kind test predict fewer leav prefer breslow aha survei method simplifi tree improv criterion larg rel comput speed classifi statlog project classifi uniformli accur dataset studi classifi possess compar accuraci comput speed import criterion paper extend result statlog project addit classif accuraci size compar rel comput speed algorithm studi comput speed affect implement turn larg differ comput time classif method differ attribut implement evalu tree classifi includ statlog kasif holt quest quest uniqu tree neglig select bia split includ newest highli accur statist classifi classif accuraci classifi serv benchmark comparison accuraci tree classifi studi effect addit independ variabl classif accuraci tree size classifi turn possibl classifi adapt variabl examin scalabl classifi sampl size experi compar tree classic modern statist neural network classifi dataset repositori machin learn fourteen dataset domain artifici construct dataset statlog project doubl number dataset ad variabl make total dataset section briefli describ classif algorithm section background dataset section explain setup studi section report result scalabl classifi examin section recommend section descript algorithm short descript algorithm detail found cite refer tree rule version cart implement cart style ind packag gini index split criterion tree base prune rule denot variant cart algorithm written languag chamber clark treat tree probabl model emploi split criterion tree chosen cross valid prune perform function librari loh shih technic report archiv tree denot default includ prune algorithm quinlan tree rule induct program produc set rule tree denot rule fast classif tree algorithm loh emploi statist hypothesi test select variabl split node discrimin analysi find split point size tree determin set stop rule tree base univari split singl denot base linear combin split linear function denot fortran program obtain classif tree algorithm deriv fact method quest univari split linear combin split unlik quest prune featur distinguish quest tree classifi univari classifi perform approxim variabl select variabl independ uninform respect class variabl approxim chanc select split node achiev emploi statist test select variabl emploi cluster discrimin select variabl find split point unord variabl convert order discrimin coordin prior variabl select node tree prune rule denot linear combin quest project data largest discrimin coordin find split point coordin tree denot result paper base version quest detail method loh shih quest code obtain due buntin version default set taylor ind standard predefin style compar style mml opt style mml bayesian opt method extend tree grow tree store compact graph structur time memori provid improv predict accuraci version algorithm murthi al style studi default mixtur linear combin univari split denot univari split denot linear combin split option set default valu algorithm brodlei utgoff construct tree base multivari test linear combin variabl tree denot default valu softwar obtain develop fraunhof institut inform data germani muller version due mueller design specif numer valu attribut procedur handl categor attribut mix attribut includ studi optim paramet control tree construct predefin threshold level ff randomli split train loh shih technic report set stratifi construct tree valid set optim paramet configur emploi program packag automat paramet vari ff step combin valu minim error rate valid set chosen tree construct case train set chosen paramet valu denot cal tree classifi exampl basi split singl attribut auer tree tree denot softwar obtain statist classifi classifi section requir class prior proport train sampl size linear discrimin analysi classic statist method classif model class distribut normal covari matrix yield linear discrimin function classifi model class distribut estim covari matrix sampl covari matrix discrimin function quadrat detail lda found statist johnson sa proc implement lda default set sa proc implement nearest neighbor method pool covari matrix comput mahalanobi distanc logist discrimin analysi result obtain logist regress routin written author flexibl discrimin analysi gener lda tibshirani show lda linear regress optim score repres group obtain nonparametr version discrimin analysi replac linear regress nonparametr regress method regress techniqu postprocess improv classif perform adapt nonparametr regress procedur compar mar function fda mda librari archiv model addit model denot model interact denot form penal lda design situat highli correl obtain discret valu pixel seri imag classif problem cast penal regress framework optim score pda implement function fda stand mixtur discrimin analysi fit gaussian mixtur densiti function class effect classif mda implement librari mda algorithm due stone fit logist regress model linear spline tensor product estim condit class probabl predict class label pol implement function librari archiv model select cross valid loh shih technic report neural network learn vector quantiz algorithm class librari archiv detail lvq algorithm found kohonen codebook initi function size codebook set size train set codebook train fastest robust lvq algorithm addit learn perform function number iter time size train set default valu learn rate radial basi function network fit sa macro feedforward neural network written macro obtain sa network train architectur macro argument construct network hidden layer number hidden unit chosen total number input output unit hidden dna dataset hidden dataset memori space macro perform model select adapt optim number hidden util capabl long dataset tabl result report classifi regard lower bound perform hidden layer fulli connect input output layer direct connect input output layer output class repres unit categori refer categori avoid local preliminari train conduct estim subsequ train detail radial basi function network found bishop riplei descript dataset briefli describ dataset studi modif made experi fourteen real domain artifici creat thirteen dataset obtain uci repositori machin learn descript adapt readm file accompani data wisconsin breast cancer breast cancer collect wisconsin madison part collect irvin problem predict tissu sampl patient breast malign benign tissu sampl consist visual assess nuclear featur fine needl aspir patient breast sampl assign vector dr compon interv refer normal state abnorm state malign determin tissu sampl patient breast perform benign diagnosi confirm period depend patient choic numer observ sixteen instanc singl miss attribut discard analysi result base observ error rate estim cross valid tree analysi earli subset data fact classifi report loh loh loh data analyz linear program method method choic dataset subset nation indonesia preval survei sampl marri women time interview problem predict current method choic woman base demograph characterist numer categor loh shih technic report observ error rate estim cross valid detail analysi found data obtain statlog dna dataset molecular biologi statlog project obtain uci repositori splice junction point dna sequenc dna remov process protein creation higher organ problem sequenc boundari part dna sequenc retain part dna sequenc splice class categor attribut categori categor attribut repres window symbol valu middl point window classifi boundari ei boundari exampl divid randomli train set size test set size error rate estim test set statlog heart uci dataset origin cleveland clinic foundat provid va medic long ca problem concern predict presenc absenc heart result medic test carri patient numer categor observ attribut extract larger set conduct statlog project emploi misclassif cost misclassif incorpor cost matrix error rate estim cross valid boston dataset valu boston numer binari observ dataset obtain uci repositori loh class creat attribut median home class class class error rate estim cross valid led displai domain olshen stone boolean repres set decim digit attribut valu light decim digit attribut probabl invert class attribut integ rang program gener data obtain uci repositori construct observ train set observ test set error rate estim test set liver disord dataset part uci repositori contribut forsyth problem predict male patient liver disord base blood test amount alcohol consumpt numer observ error rate estim cross valid pima indian diabet dataset subset larger maintain nation institut diabet digest donat appli physic john hopkin uci repositori patient dataset femal year pima indian heritag live usa problem predict patient test posit diabet world health organ criteria survei examin found routin medic number physiolog measur medic test result numer observ origin dataset consist observ numer attribut notabl valu physic imposs riplei treat valu miss remov case data omit attribut error rate estim cross valid loh shih technic report statlog satellit imag statlog version satellit imag dataset consist valu spectral pixel neighborhood satellit classif central pixel neighborhood aim predict valu dataset uci repositori sampl class pixel code number class numer attribut train set consist observ test set consist observ error rate estim test set statlog imag segment observ randomli drawn outdoor imag imag creat classif pixel grass dataset part uci collect numer attribut observ dataset error rate estim cross valid case requir larg amount discret valu attribut categori attitud smoke restrict dataset attitud smoke legisl toronto fund welfar collect pederson bull institut social research york obtain problem predict attitud restrict smoke workplac base covari numer categor attribut divid origin dataset train set size test set size error rate estim test set dataset contribut werner ann uci repositori problem determin patient refer clinic class numer binari attribut train set consist observ test set observ error rate estim test set statlog vehicl silhouett uci dataset origin ture scotland problem classifi silhouett type set featur extract silhouett vehicl view angl origin find method distinguish object imag applic ensembl shape featur extractor silhouett object model vehicl doubl decker numer observ error rate estim cross valid vote record dataset origin quarterli volum quarterli contribut schlimmer uci repositori includ vote repres kei vote identifi list type vote pair announc simplifi vote pair announc vote vote present avoid conflict vote make posit unknown unknown problem classifi democrat republican base kei vote categor attribut categori observ miss valu miss denot origin mean convert form categori attribut error rate estim cross valid loh shih technic report waveform artifici domain breiman al problem base waveform class consist random convex combin waveform sampl integ ad descript gener data breiman al program uci repositori numer observ train set test set consist observ error rate estim test set ta evalu data consist evalu teach perform regular semest summer semest teach assist assign statist depart score divid roughli categori form class variabl predictor variabl ta nativ english speaker instructor summer regular semest class size dataset analyz loh shih uniqu dataset experi categor variabl larg number categori tree algorithm cart emploi exhaust search longer comput classifi evalu split categor variabl error rate estim cross valid data obtain summari featur dataset tabl tabl characterist dataset column give number type ad variabl dataset notat denot standard normal denot uniform distribut integ denot uniform distribut unit interv origin attribut type attribut data num categor total numer categor total set case class cmc dna bo led pid sat seg smo wav setup classifi design categor variabl categor variabl convert order variabl code dummi vector affect classifi statist neural network classifi tree classifi loh shih technic report order number dataset studi effect variabl creat dataset ad independ variabl dataset number type variabl ad panel tabl dataset origin dataset addit symbol dataset ad denot wai estim error rate classifi larg dataset larger test set size test set estim error rate classifi construct observ train set test test set twelv dataset analyz remain twenti cross valid experi estim error rate cross valid experi conduct dataset randomli divid disjoint approxim number case sampl stratifi class label ensur subset class proport roughli dataset classifi construct observ subset classifi test subset estim error rate cross valid error estim averag provid estim classifi construct data classifi implement program languag languag type unix workstat studi workstat type implement languag classifi tabl rel perform workstat spec mark tabl number estim ratio amount time workstat complet task averag dec comparison cpu time report term cpu time record divid result error rate cpu time classifi separ tabl dataset appendix tabl report error rate ignor inform covari classifi case major class train sampl error rate tabl summar error rate classifi rel classifi dataset row tabl averag error rate averag dataset minimum maximum error rate plural rule column interest note classifi accur plural rule addit averag error rank classifi number time close number time worst smallest observ error rate dataset obtain independ denot size obtain denot size learn sampl standard error estim classifi error rate consid close total number classifi row tabl classifi worst error rate dataset total number classifi fourth row tabl observ drawn loh shih technic report tabl workstat type classifi type dec alpha model sun sparcstat model sun sparcstat classifi machin languag classifi machin languag tree rule dec dec dec dec cal dec dec dec dec statist dec lda dec sa dec dec sa dec nn dec sa ib log dec im pda mda pol ocl neural network lvq dec rbf dec sa rank classifi term averag error rate yield order pol lowest averag error rate highest rank classifi term total number accur classifi tabl spec benchmark summari workstat sourc dec dec model spec newslett vol issu june sun sparcstat spec newslett model vol issu june sun sparcstat spec newslett vol issu june loh shih technic report classifi highest number exclud classifi accur order number top classifi top posit log classifi statist neural network inaccur classifi term number classifi number nn lvq ocl classifi rank bottom order easiest dataset classifi error rate lie difficult dataset minimum error rate greater difficult dataset smo case lower error rate plural rule classifi lower error rate plural rule dataset largest rang error rate rate rang maximum due maximum error rate drop dataset sat addit variabl significantli error rate classifi cpu time tabl median cpu time classifi rel cpu time classifi dataset ow larg rang cpu order rel fastest classifi dataset report fastest classifi classifi time slow case fastest classifi requir cpu slowest classifi million time slow fastest slowest time dataset column rank fastest slowest term median cpu time fastest classifi close lda classic statist classifi nn fast tree classifi emploi univari split faster loh shih technic report linear combin split slowest neural network rbf claim implement cart ind version faster version reason written written languag import reason ind version heurist person greedi search number categori categor variabl larg appar dataset categor variabl categori case compar hour result tabl suggest ind classif accuraci affect heurist techniqu provost algorithm categor variabl categori size tree tabl number leav tree classifi dataset variabl ad case error rate obtain entri averag number leav tree tabl show number leav addit variabl median number leav classifi column tabl yield largest tree necessarili short classifi shortest tree averag close ocl classifi univari shortest tree addit variabl typic size cal tend grow larger fluctuat wildli studi serv complement oat jensen effect sampl size number leav tree classifi found relationship tree size train sampl size observ tree classifi emploi prune control tree growth statist simpli rank classifi pai attent statist rank statist procedur call analysi varianc test simultan statist differ averag error rate classifi control differ dataset hunter simultan confid interv differ averag error rate obtain tukei method differ averag error rate classifi statist level differ visual figur plot averag error rate classifi versu median solid vertic line plot unit averag error rate classifi pol classifi ly left line averag error rate statist significantli pol top ten classifi identifi accur rbf li vertic line averag error rate rbf significantli higher pol result due lack adapt optim number hidden unit rbf horizont dot line figur simpli divid classifi equal halv cpu time horizont line averag quicker execut line rectangl lower left corner plot delin line identifi subset classifi good averag accuraci comput speed magnifi plot group shown figur top ten classifi list averag error loh shih technic report classifi provid accuraci speed tukei differ averag error rate classifi statist scalabl classifi differ averag error rate pol classifi statist clear error rate sole pol method choic pol classifi cpu time sampl small scalabl studi carri classifi pol data studi construct bootstrap dataset dataset desir sampl size case randomli drawn replac dataset avoid replic class attribut sampl case randomli chang probabl select pool altern equal procedur repeat valu result cpu time requir train classifi plot figur logarithm cpu time linearli major pol reason behavior pol due model select algorithm base sampl gener easi fit produc lower comput time line figur roughli parallel suggest rel comput speed classifi fairli constant rang sampl size consid steeper slope confirm observ cohen scale classifi result show averag error rate classifi suffici similar differ statist lowest averag error rate lie rang small differ import practic user select classifi base criteria comput speed interpret unlik error huge differ cpu time classifi classifi lowest averag error time long classifi log ratio time roughli hour versu figur show maintain wide rang sampl size larg applic time advantag classifi pol interest statist classifi lda averag error rate close minimum design attribut categor attribut transform dummi vector prior applic ineffect situat class popul low error rate lda dataset studi suggest problem expect lda perform similarli applic easi readili statist recommend mean comparison low error rate log lda account perform classifi pol basic modern version log flexibl log emploi function automat model select strategi yield slightli reduc averag error bring top pack good perform similarli attribut lda quest algorithm design overcom difficulti encount lda situat appli modifi form lda partit partit repres leaf tree strategi higher averag error rate show base fact algorithm precursor quest major differ loh shih technic report error rate ib im ocl cal lda nn log pda mda pol lvq rbf method error rate ib im lda pda method lower left rectangl plot figur plot averag error rate versu time solid vertic line plot divid classifi averag error rate classifi left group differ significantli simultan confid minimum averag error rate dot horizont line split classifi group equal size loh shih technic report legend lda log pol sat sampl size cpu time sampl size cpu time sampl size cpu time figur plot versu select classifi data plot obtain perturb bootstrap sampl drawn loh shih technic report quest fact algorithm emploi prune method cart result suggest form prune essenti low error rate construct classifi data rule tree univari split suffic figur show differ averag error rate rule tree classifi statist lowest averag error rate ident averag classifi provid good classif accuraci fastest yield tree leav reason faster speed prune algorithm requir figur show scale larger sampl size similar term error rate size tree produc tree spuriou split acknowledg grate individu project quinlan answer question buntin murthi gave advic instal ind provid program holt point auer explain memori requir kindli provid nation indonesia preval survei data refer categor data john wilei ny effici data mine algorithm marker uthurusami intern confer knowledg discoveri data aaai menlo pp theori applic agnost small russel twelfth intern confer machin morgan san pp wadsworth neural network pattern oxford ny statist york classif regress chapman ny simplifi knowledg engin review multivari versu univari technic report depart comput ma multivari machin learn comparison tree classifi backpropag neural network multimod classif pattern recognit analysi attitud workplac smoke case studi john wilei pp loh shih technic report learn classif statist comput introduct ind version nasa research ca chamber hasti statist model chapman pp fast effect rule russel twelfth intern confer machin morgan san pp neural tree induct discrimin empir journal oper research societi multivari adapt regress spline annal statist construct assess classif john wilei england price demand clean journal econom manag discrimin analysi gaussian journal royal statist seri penal discrimin annal statist flexibl discrimin analysi optim journal american statist associ simpl classif rule perform commonli machin learn appli multivari statist prentic englewood nj heidelberg journal american statist associ determin method servic point secondari analysi nation indonesia preval vol fertil famili popul split select method classif classif gener discrimin analysi journal american statist associ cancer diagnosi linear siam uci repositori machin learn depart inform comput ca loh shih technic report machin neural statist elli london simultan statist york automat construct tree annal oper research algorithm base statist approach split taylor machin learn john wilei pp system induct obliqu journal artifici intellig research effect train set size tree fisher fourteenth intern confer machin morgan san pp program machin morgan san ca improv continu attribut journal artifici intellig research pattern recognit neural cambridg cambridg neural network statist nineteenth annual sa user group intern sa pp sa user version vol sa nc symbol neural learn empir machin learn modern appli statist ny diagnost scheme fine needl aspir breast analyt quantit fine needl aspir breast mass archiv surgeri statist approach fine needl aspir diagnosi breast acta appendix loh shih technic report tabl naiv error rate dataset classifi error rate standard error minimum dataset classifi worst error rate dataset averag error rate classifi row tree rule statist classifi net error rate ib im ocl cal lda nn log pda mda pol lvq rbf min max naiv pp pp cmc dna bo led pid sat seg smo wav loh shih technic report tabl dec cpu rel cpu time classifi row give median cpu time rank classifi entri subsequ row classifi time slower fastest classifi dataset fastest classifi denot entri minimum maximum cpu time column denot hour tree rule statist classifi net cpu time ib im ocl cal lda nn log pda mda pol lvq rbf min max median cpu rank loh shih technic report tabl number termin node tree algorithm number averag experi data classifi cmc dna bo led pid sat seg smo wav averag median ib im ocl cal averag median loh shih technic report tabl differ number termin node tree algorithm dataset neg differ mean tree shorter data classifi cmc dna bo led pid sat seg smo wav averag median ib im ocl cal averag median loh shih technic report tabl breast cancer wisconsin numer error rate estim experi plural rule error rate attribut independ uniform integ variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl method choic numer categor error rate estim experi plural rule error rate error rate greater plural rule print ital attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl statlog dna categor error rate estim test set observ standard error rang plural rule error rate attribut independ uniform integ variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl statlog heart numer categor error rate estim experi plural rule error rate attribut standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl boston numer binari error rate estim experi plural rule error rate attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl led displai binari error rate estim test set observ standard error rang plural rule error rate attribut independ binari variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl liver disord numer error rate estim experi plural rule error rate error rate greater plural rule print ital attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl pima indian diabet numer error rate estim experi plural rule error rate attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl statlog satellit imag numer error rate estim test set observ standard error rang plural rule error rate attribut independ uniform integ variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl statlog imag segment numer error rate estim experi plural rule error rate attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl attitud workplac smoke restrict categor numer error rate estim test set observ standard error rang plural rule error rate error rate greater plural rule print ital attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl numer binari error rate estim test set observ standard error rang plural rule error rate error rate greater plural rule print ital attribut independ binari variat uniform variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl statlog vehicl silhouett numer error rate estim experi plural rule error rate attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl unit state vote record categor error rate estim experi plural rule error rate attribut independ uniform integ variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl waveform numer error rate estim test set observ standard error rang plural rule error rate attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden loh shih technic report tabl teach assist evalu numer categor error rate estim experi plural rule error rate error rate greater plural rule print ital attribut independ standard normal variat origin cpu time method error rate rank error rate rank tree rule ib im ocl cal statist lda nn log pda mda pol neural network lvq rbf hidden
IR/92 5 framework knowledg manag semant web abstract siegfri aifb institut karlsruh karlsruh germani semant web platform develop knowledg manag system problem repres knowledg relev knowledg found machin agent paper present knowledg manag approach base format repres rule techniqu annot knowledg sourc condit statement approach base exist semant web tool main benefit high improv search possibl retriev composit knowledg sourc relev problem solv keyword semant condit knowledg manag introduct semant web gener world wide base semant network knowledg enabl packag inform form call triplet assum term statement base formal mean commun triplet semant process machin agent current semant web applic base atom statement pure reason machin agent understand inform concret suffer treat medicin agent inform commun machin agent make appoint doctor make vision semant web real exchang relat concret individu instanc patient group individu common characterist statement femal patient older suffer atom statement combin express simpl condit form patient male suffer treat medicin implement level form repres form reason atom servic semant web point exist express statement format mean possibl find easili condit statement relev current problem solv condit statement content web resourc express conjunct gener metadata enabl format context queri improv recal search knowledg problem document index keyword cure headach resolv easili condit statement order condit statement knowledg manag scenario semant statement power mechan creat manipul previou work requir repres condit inform format rdf format repres format enabl horn extend uncertainti factor inform rule set set set format descript condit statement form paper present applic framework manag knowledg sourc semant present condit descript effect search knowledg framework base exist semant web tool slightli extend order oper express data format framework elabor section knowledg manag framework main process knowledg manag system possibl find knowledg relev fo problem process provid knowledg resolv problem point view knowledg knowledg sourc divid formal expert rule document order enabl effici search knowledg content document index statement approach statement condit enabl logic mechan manag categori knowledg sourc search relev knowledg result expert rule document figur sketch framework knowledg manag semant reflect varieti knowledg transform distribut knowledg collect sourc store common process order comput interdepend knowledg item resolv final problem solv knowledg manag approach encompass process knowledg knowledg knowledg knowledg share knowledg process relat domain ontolog ontolog domain set domain axiom deriv inform task infer engin describ process figur knowledg manag framework identifi type knowledg treat knowledg captur expert legaci metadata repositori document associ semant web expert knowledg form rule captur simpl ontolog editor ontolog editor extend rule capabl structur lexic layer domain rule creation rule relat domain treat axiom ontolog ontolog axiom case expert rule save rule directli format legaci valuabl sourc sharabl consult solv free price focu collabor problem solv queri feder rule creat expert import relev rule chain rule base prerequisit mechan convert legaci rule potenti candid rule markup plan tool translat content relat ontolog repres support translat metadata web primari knowledg sourc share knowledg futur order make share effici mechan knowledg packag knowledg crawler capabl collect web document fit adapt straightforward previou type relat formal state process machin agent knowledg document inform content document formal state index underli process call semant annot support annot framework inform extract techniqu make annot plan extend techniqu extract tabular content order convert tabular inform set rule automat knowledg repositori relat enabl effici store access rdf metadata repositori rdf repositori knowledg process compon enabl effici manipul store process knowledg repres form deriv depend graph consist check knowledg share search rule satisfi queri condit rdf repositori rule repres reifi rdf statement rdf statement consid view rdf repositori set ground assert form rule relat domain domain axiom deriv assert search inferenc process main object orient infer rdf input note system treat fact queri rule rule bodi rule facil enabl editor queri interfac knowledg relat semant knowledg portal scenario main advantag approach condit statement semant annot knowledg sourc put statement annot context lead effici search knowledg annot knowledg resourc statement enabl semant hyperlink satisfi condit precondit part subsum action part annot resourc queri problem result composit cover problem solv import process knowledg manag search paper present applic framework realiz knowledg manag system semant web framework base exist semant web tool approach introduc enhanc applic semant web tool rule class citizen semant web semant annot condit statement benefit approach integr platform rule sourc rule search knowledg sourc condit descript content possibl knowledg sourc solv rare difficult task refer lassila semant scientif lj search knowledg semant accept flair special track semant web knowledg process ontolog ieee intellig system wagner design markup languag semant web stanford maedch cream creat relat metadata compon annot framework acm vancouv capit seal framework develop semant portal acm vancouv
HCI/93 4 mit media laboratori perceptu comput section technic report submit attent object visual context understand bernt schiel alex pentland media room massachusett institut technolog ma abstract paper exploit wearabl comput uniqu opportun record index visual environ user perspect wearabl camera record user dai wearabl comput camera make comput contextu awar user action camera analyz index visual environ user track action user environ system awar interact user environ import aspect system automat extract object user motion environ rel user introduct wearabl comput potenti user user experi life environ user point wearabl comput offer uniqu opportun recov gener user context import context commun interfac context wearabl comput context model recogn user context record analyz user environ perspect paper wearabl system record visual field view continu user wearabl comput exploit habit human fixat object structur index visual record system design recogn track object peopl automat environ user system structur visual environ base object person observ absolut rel motion object peopl system reason interact peopl object environ durat person fixat move object power indic potenti interest object person physic interact user object touch pick indic relev object user attent object peopl index structur store wearabl comput fact camera reflect view environ enabl exploit habit human fixat object interest system rel motion object respect user abil special natur wearabl comput extract object interest make system standard system exploit habit user extract structur video stream reflect relev import aspect visual environ user user aim build wearabl system awar user context continu model recogn environ user user interest interact environ order put remaind paper section summar system design awar aspect user context section discuss technic requir wearabl system continu observ visual environ user section describ system object recognit modul recogn record object visual field wearabl camera section discuss detail system automat extract track object visual environ relat work section briefli describ system relat system memori memori augment evolv simpl pencil paper paradigm sophist person digit assist relat memori augment system includ system person inform manag inspir weiser ubiquit comput remembr agent wearabl augment realiti memori system system collect organ data relev human user subsequ retriev augment augment realiti system form natur interfac user machin virtual document environ system assist user perform task regist synthet multimedia data acquir video camera inform retriev explicitli user speech command contextu tag infrar visual order enhanc context environ present system displai interest inform environ user system person mann construct imag visual environ wearabl camera system construct imag smaller overlap imag result imag photograph memori visual environ user video index system exist attempt retriev video system global featur color histogram frame video order segment index video notabl except system chang al individu region extract video frame region track time enabl queri video find region color move motion pattern author retriev note import extract match motion region order index video remot wearabl comput collabor remot distant environ present wearabl system remot capabl order cooper mobil technician context awar perceptu system user context includ thing time locat user user action briefli describ system design recogn user locat infrastructur rf tag landmark describ system camera recogn user gestur action recogn user locat system develop lab recogn locat mean wearabl comput system head mount camera figur camera point forward point enabl observ floor system continu calcul color valu imag patch room floor mit hmm train model recogn individu room room reach small number train emploi statist grammar floor recogn user locat accuraci figur camera hat camera view system head mount camera order recogn user locat system recogn locat store inform approach trajectori locat dynam program compar imag sequenc approach system match incom video dictionari locat environ system continu recogn locat reli statist grammar order restrict search system recogn locat environ recoveri environ auditori visual cue classifi user context fly fly understand detail event user ew make gener evalu auditori visual environ similar environ user order make channel detector specif event construct event simpl bright light loud complic speaker sound object set detector higher order pattern observ user environ broken scene talk visit groceri walk busi offic collect specif event car speech recogn scene detector event make scene identifi natur hierarchi person environ detail wearabl camera camera point user track figur viewpoint user lip observ glove bodi suit virtual realiti gear figur surprisingli stabl mount point camera light condit normal constantli visibl nose calibr object wearabl camera observ detect user hand gestur context american sign languag recognit system camera recogn current task user system demonstr set tool direct recov user context complex set time vari signal gestur user camera color blob analysi hmm environ observ wearabl camera point earlier goal build system awar context user analyz reason visual environ user remind paper exploit possibl wearabl comput camera order observ visual environ perspect section discuss potenti applic technic requir system continu record analyz visual environ user section describ wearabl system continu recogn object user visual field section discuss system automat extract object object part visual environ potenti interest user order analysi visual environ perspect give number ffl typic extend period time gener human tendenc fixat object interest extend period time piec art object interest present view system system extract model object interest model index structur store recogn object ffl peopl gaze liter object interest track object person car track object respect rest move analyz rel motion visual system segment object object track user amount system respect relev object user ffl system develop continu track human hand posit hand system extract object environ user move handl system inform order estim respect import object user system user find misplac object exampl exploit fact camera approxim field view user requir exampl extract region visual environ user correspond entir object object part model track region time analyz respect motion rel user rel environ inform extrem respect import object exampl show model user action environ system model interact user environ great wearabl system order model user camera creat video visual environ visual experi user standard techniqu video analysi classifi type scene segment analysi camera make habit human human tend fixat object peopl interest motion object rel user power indic relev object user fact make analysi video perspect standard problem analysi exploit awar human aim extract salient structur wearabl order creat system continu analyz visual environ user system robust order handl data continu move camera vari imag condit calcul system simpl order run close singl featur capabl captur object multipl featur motion shape section describ wearabl system capabl recogn object rate system recogn order object shown robust light situat section system automat extract object object calcul motion shape time fulli automat wearabl camera recogn object wearabl camera implement augment realiti remembr agent sort tag gener object recogn order identifi object real world system call person enhanc realiti retriev media memori base associ real object user encount evok audio video clip relev user overlai top real object user encount system associ system wireless connect desktop comput user visual auditori scene store system user snap shot visual object object act kei vision system detect presenc scene plai back sequenc associ memori oper paradigm clip record push button object interest associ memori modul receiv object label confid level object recognit system confid high retriev memori inform object user overlai inform user field view user record system continu run background mode find object field view sequenc act parallel perceptu remembr agent constantli recogn explain rememb associ user pai attent figur depict overlai process top expert demonstr chang bag vacuum cleaner user record process associ explan imag vacuum bodi user vacuum bottom automat anim left field explain chang dust bag associ retriev process perform onlin seamless manner import part system gener object base probabilist recognit system figur sampl output object repres histogram vector local neighborhood oper object robust view point probabilist object recognit algorithm order determin probabl object imag base small imag region experi show small portion imag order recogn object correctli presenc viewpoint scale recognit system run approxim silicon graphic machin opengl extens librari imag convolut vision system report evalu discrimin object practic unconstrain real world scenario inform physic includ locat time dai number object significantli reduc inform user current interest reduc number interest object object learn model main limit system direct input user order acquir object model wearabl system user build system acquir object model section build model object visual field view step procedur attent object extract track posit motion visual field view figur user listen guid galleri tour step learn object section describ structur automat object learn model point earlier interest extract object object part visual environ order extract model object step learn procedur learn procedur parallel featur singl featur power describ object environ extract object model inform textur shape object part analyz model absolut motion rel motion object part group object part object object present visual field user repeatedli time correspond real object repetit object import relev object user visual environ comput vision algorithm reli fact camera condit vari vari condit comput vision algorithm robust wearabl comput comput vision techniqu context wearabl comput make fact consecut imag condit chang object learn step short video consist region color extract track number frame track imag region learn includ model multipl textur shape region learn step list region candid part object learn step algorithm identifi imag region longer period time step algorithm track rel arrang imag region order find set imag region consist move set imag region candid correspond object output step object consist set imag region respect spatial arrang track rel posit movement imag region import disambigu region correspond object learn step verifi object continu recogn object object identifi repeatedli visual field view extend period time object hypothesi store perman consid learn object attent filter point earlier system exploit person view wearabl system object extract system track time object present visual field view time system extract model object includ textur shape object model recogn repetit object extend period time object fixat time user high interest user base object system extract motion object rel rel user user visual track move object object stai visual view system background constantli motion event detect extract motion object video stream object peopl field view repeatedli extend period time system conclud interest user extract hand user system find physic interact user object touch pick relev object user system attent filter order extract object interest user wearabl system exploit order structur user implement detail exampl current implement cluster order extract candid region correspond object object part system extract color region cluster pixel base standard color featur posit pixel color featur stabl small light condit order match success frame successfulli time cluster enabl extract compact cluster cluster distribut entir frame row figur show origin color imag black row figur show segment result color cluster point system multipl featur order capabl model wide varieti object system extract region base textur featur order autoregress model neighborhood pixel paramet autoregress model posit pixel row figur show imag region obtain cluster textur posit featur imag region extract cluster pixel base color correspond object object part step object learn model consist track imag region coupl frame order match cluster success frame calcul euclidean distanc color featur textur track cluster short period time viterbi algorithm row figur show track sequenc color cluster frame sequenc extract track imag region correspond person stand front wall wearabl system person happen direct focu attent coupl minut color textur model person successfulli extract video provid camera row figur show track correspond part wall person video part coeffici varianc detail wall match figur show frame video sequenc user pick put back tabl box object interest user row show color cluster successfulli track entir sequenc cluster move system correctli region correspond physic object track hand user system extract common motion object hand inform enabl system conclud user move object pick inform object visual environ interact user object eventu structur relev import user paper wearabl system camera order record analyz visual environ user possibl exist model recogn user context video audio inform combin report system camera successfulli recogn object paper exploit human habit fixat object interest order structur index video data system extract object visual environ segment interact user environ structur video data relev import user video data structur great rememb index event import refer wearabl ubiquit comput ieee oct pentland recogn person locat video workshop perceptu user page nov segal collabor wearabl system remot ieee oct advanc standard chapter multimedia figur object learn frame sec video frame row show origin grei row show color cluster row show person extract base color cluster track frame row show textur cluster row show part wall person extract track base textur figur object learn video frame frame row show origin row show color cluster extract imag row show part object pick user focu attent user part object successfulli track entir sequenc figur object learn frame sec video frame row show origin row show color cluster row show part taxi extract base color cluster track frame row show textur cluster sixth row show part street extract track base textur search retriev marcel sf hj zhong autom content base video search system visual cue acm nov clarkson pentland cluster audio video intern confer speech signal duda hart pattern classif scene analysi john wilei webster tour prototyp mobil augment realiti system urban environ ieee page oct ritter track move object base color cluster flow intern confer comput vision pattern page situat comput ieee oct bisson virtual document environ intl symposium wearabl comput bauer adapt wearabl comput remot interfac ieee oct lam flynn intim comput support human memori intl symposium gener human mann person imag tool person documentari investig acm mobil network mao ak jain textur classif segment multiresolut simultan autoregress model pattern ad gener contextu capabl wearabl comput ieee oct sclaroff tool content base manipul imag intern journal comput picard societi model video imag librari ibm system hayashi situat commun physic digit space ieee oct rhode starner remembr continu run autom inform system proc app intellig agent tech april schiel jl crowlei probabilist object recognit recept field histogram intern confer pattern volum page august pentland interact comput vision dynam person enhanc remembr system intern confer vision jan pentland visual contextu awar wearabl comput intern symposium wearabl oct pentland wearabl comput base american sign languag recogn intl symp wearabl ieee press sw jh cy advanc digit chapter chapter video system digit librari lectur
Agents/94 1 system genom annot keith carl denni michaud comput inform scienc depart de abstract growth genom express exemplifi human genom fertil domain applic inform gather hundr econom import organ studi requir effici autom analysi tool multiag approach provid paper give progress report decaf toolkit build reusabl inform gather system bioinformat briefli summar bioinformat classic applic inform decaf support recent extens underwai support analysi path genom inform introduct massiv amount raw data gener biologist sequenc organ raw data analyz applic comput program public web typic raw data valuabl deriv knowledg remain gener unavail publish natur languag text journal articl import note tremend amount genet materi similar organ fruit human mean biologist studi figur gene biologist guess similar gene organ plai similar role huge popul sequenc data function annot sequenc routin compar sequenc clue function method biologist function similar import clue identif gene function organ sequenc gene refer concept function gene larger biolog cell gene product work biologist clue gene function pattern amino acid motif larger activ pattern amino acid end gene product inform similar gene product similar gene larg amount work bioinformat past ten year develop algorithm support work gene function biologist web combin publish site special inform topic protein motif comput scienc problem larg set heterogen dynam chang inform bring bear biolog problem determin genom function biologist produc thousand function case largest sequenc hand singl research student inform gather system lot contribut effort featur make approach problem inform distinct inform content inform content constantli annot work gene biologist make find wide retain control type analysi sourc data constantli system toolkit base retsina taem construct prototyp system autom annot storag sequenc data result system elimin tediou hand make data annot research agent level queri process web site initi open natur multiag solut expand system wai make biologist studi wai paper briefli describ approach inform base work decaf init annot extens function est metabol pathwai reason retsina model inform gather view inform gather phrase indic inform displai inform gather domain inform partial locat constantli chang inform sourc time promot retsina organ build inform gather system retsina approach consist gener class inform extract interact directli extern data wrap web page task interact agent handl bulk inform process task includ agent care care servic complex queri plan interfac interact directli end user surprisingli larg number agent reusabl contribut faster prototyp inform gather system contribut turn relianc queri process common agent action implement system extend tradit system handl dynam inform deriv inform creat open system deriv inform sourc achiev secondari user util expect expect time answer resourc spend achiev answer decaf implement middl reusabl agent tool build inform gather system decaf decaf agent toolkit creat system tool develop specif prototyp inform gather system intern architectur decaf agent design oper set servic soft execut agent action decaf consist set defin control modul concurr work concert control life cycl core task structur share control modul meant agent develop quickli api approach programm creat orchestr architectur agent action section discuss intern architectur gener discuss tool middl system debug inform extract agent built implement inform gather system intern architectur decaf shown figur modul run thread plan file incom kqml messag incom messag queue agent initi task templat pend hashtabl action queue domain fact belief object queue task queue outgo kqml messag decaf task control structur agenda queue dispatch planner schedul executor action result queue fig decaf architectur overview action modul agent agent initi modul read plan file describ capabl htn task task reduct plan file ad task templat hash tabl wait incom kqml fipa messag messag part ann ongo dispatch find action pend action queue set task continu agent action messag part object creat bdi object queue planner agent typic activ achiev planner monitor object queue match goal exist task templat store plan librari copi instanti form htn task queue uniqu identifi provis pass agent incom messag subsequ messag request goal instanti plan templat task network uniqu identifi task queue moment instanti structur action complet incom request schedul wait task queue schedul determin action execut execut order execut determin base provis modul add reason abil schedul modul effort involv annot task structur perform schedul inform schedul select path task complet executor set oper agenda queue action queue executor immedi place task execut thing occur action complet complet return error result action result queue framework wait result distribut result downstream action wait task queue accomplish executor examin agenda queue work executor modul start task separ thread improv throughput assist achiev deadlin action fail case framework failur task request decaf support info gather decaf core intern architectur support secondari user util decaf plan includ altern chosen dynam runtim depend user constraint answer resourc constraint decaf support build inform gather system provid middl agent shell quickli build inform extract agent wrap web site agent server essenti compon agent commun work fashion similar dn resolv agent host port address matchmak serv assist agent find servic task complet broker agent act kind assist agent collect servic broker provid larger servic singl provid manag larg group agent effect proxi agent web page java applet commun decaf agent locat server applet agent manag agent ma design entir run set agent spread internet share singl agent server design queri statu individu agent watch record messag pass traffic inform extract agent shell main function inform extract agent fulfil request extern sourc shot queri price monitor extern sourc period inform price ibm monitor sourc call inform monitor request price ibm function written gener code share agent domain iea oper inform gather extern inform sourc agent set wrapper wrapper induct algorithm stalker extract relev inform web page shown exampl inform gather store local iea java wrapper parka make fairli easi forc difficult part problem back kb ontolog product tool wrap web page dynam answer queri page annot make site wrap easier syntact solv ontolog project decaf system genom analysi tool put creat prototyp system type genom analysi chosen simplifi queri subsystem materi annot remov sophist queri plan reason simplif work fairli small genom gene larger organ construct consensu explicitli figur show overview system overlap organ basic sequenc charg integr remot gene sequenc annot sourc gene sequenc local manag agent complex queri web interfac function annot collect make inform guess function specif gene ontolog fourth est process enabl analysi express sequenc tag produc gene sequenc annot organ sequenc addit applet proxi agent sequenc sourc process agent iea iea annot agent basic sequenc annot iea function annot applet proxi agent ontolog reason agent info extract agent iea ontolog agent genom db iea user queri applet proxi agent queri process agent function annot queri sequenc iea est entri proxi agent est process process est consensu sequenc fig overview decaf system genom analysi import featur note focuss annot servic organ specif result system build queri organ origin subsystem annot simpl queri built annot newli sequenc turkei compar sequenc work begin build chicken extend depth kb viru clinic organ transplant patient basic sequenc annot queri process figur show interact detail basic sequenc annot queri subsystem describ agent retsina classif sequenc addit applet independ task agent annot agent info extract agent info extract agent user queri applet proxi agent queri process agent sequenc sourc process agent task agent info extract agent interfac agent matchmak agent agent server agent local local local local manag agent agent manag agent agent inform extract info extract agent agent fig basic annot queri agent organ inform extract agent agent base iea shell wrap public web site wrapper primarili suppli sequenc similar gene world answer give biologist clue function gene biologist function chang answer queri wrapper primari protein motif pattern search view protein string amino motif regular express match part string kind function protein motif place protein modifi translat addit group wrapper access system estim locat encod protein wrapper access inform encod domain similar motif larger move resourc wrap level biologist local manag agent slightli member class unlik iea store data agent messag queri extern data sourc annot genet inform queri answer updat raw sequenc data indirectli user sequenc addit interfac automat annot control annot task agent queri research limit comput knowledg creat annot sequenc exist wrapper analysi tool necessarili download instal modern relat data storag back end queri limit kb inferenc task agent domain task rest gener middl agent earlier annot agent direct inform annot sequenc store raw sequenc make queri wrap web store indic proven data annot sequenc sourc process agent raw sequenc data format output typic sequenc estim program store main function agent test input intern consist interfac agent interfac applet commun proxi agent agent system orient ad sequenc local queri complet annot kb multipl interfac scratch surfac queri big problem biologist comfort complex queri languag simpl interfac simpl conjunct disjunct queri dynam menu annot applet runtim actual local advanc compar exist public site textual keyword search function annot figur show function annot subsystem subsystem assist biologist difficult problem make function annot gene million gene sequenc fairli comput function simpli free natur languag descript fairli larg group repres primari organ creat consortium dedic creat gene ontolog annot gene function basic biolog process gene plai molecular function gene cellular local subsystem support ontolog biologist sequenc ad eventu lead power analysi result kb inform extract agent gene sequenc bank wrap gene mu organ function annot applet proxi agent ontolog reason agent info extract agent iea ontolog agent genom db iea sequenc iea fig function annot agent organ part gene ontolog spent time make proper function annot find close homolog unannot gene annot homolog annot gene task agent task agent fipa ontolog agent specif start point ontolog agent ontolog map term iea ontolog agent map term record term organ db iea agent map ontolog descript string actual uniqu id servic provid agent explicitli mention fipa ontolog agent ontolog reason agent term relat ontolog ontolog reason agent queri build minimum span tree term return homolog organ displai inform graphic biologist interfac agent interfac agent function interfac consist top pane displai gene bottom displai gener natur languag annot pane displai ontolog molecular cellular mark color homolog organ est process broad applic system accept kind basic input data annot process broaden reach tem start est sequenc complet sequenc agent wrap standard softwar creat sequenc point exist system est part approach sequenc directli sequenc dna sequenc gene express cell method produc short sequenc partial overlap sequenc produc attach lumin marker color read result find overlap short eventu reconstruct entir sequenc express gene approach reli statist sheer number experi eventu produc complet sequenc figur show subsystem autom process est produc consensu gene sequenc side effect inform produc find singl polymorph snp chang singl gene individu conserv strain marker import identif function effect process est entri proxi agent est consensu sequenc assembl sequenc fig est process agent organ inform extract agent process consensu sequenc build snp identif requir extern iea gene sequenc annot est process add store est inform discuss earli sequenc thousand est overlap form contigu est ad process daili task agent task agent deal process essenti set signal rel strength wavelength lumin tag standard unix analysi program exist process essenti posit process agent wrap analysi produc uncertainti score convert output standard remov part sequenc byproduct sequenc part organ sequenc consensu sequenc assembl agent program est found produc set candid gene splice short est sequenc produc set candid gene ad gene sequenc annot process earlier commenc agent oper program est sequenc kb uncertainti score produc nomin singl polymorph wrap program larg number paramet control set consult biologist experi plan experi autom learn mechan paramet adjust interfac agent simpl interfac enter data system data origin calcul uncertainti call est call accomod build consensu find snp gene express process kind genom data swamp amount sequenc data gene express quantit gene product express point time develop system onlin genom metabol pathwai knowledg extend gene express analysi incorpor relationship analysi express data significantli improv pure statist method system integr exist agent eventu relev genom inform made system exist iea metabol pathwai interest investig identifi encyclopedia gene wrapper analysi gene express data perform agent execut statist packag includ cluster pca analysi od result present user webpag hyperlink relev entri gene express identifi set activ gene begin explor dynam natur behavior cell respond physiolog individu gene induc messeng rna protein level complic predetermin reaction network interpret complex underli network gene express experi difficult process current techniqu gene express analysi primarili cluster group gene similar express pattern base result research identifi conserv control region upstream gene similar express behavior gene express data noisi complic pathwai organ gener express significantli limit benefit standard cluster analysi order separ gene pattern gene express process organ develop gather inform order express data function categori cluster reduc data set find gene regul system discov regulatori connect pathwai diagram outlin agent system shown figur system identifi pertin metabol site incorpor futur advantag entri organ ec easili map gene specif organ interest gene express agent system queri local copi publicli cell express data user access data relat cell data reduc system gene metabol pathwai sa statist packag cluster remain data identifi close regul gene organ gene confirm identif conserv promot motif genet code final result analysi run present user graphic form show cluster express pattern hyperlink relev entri explor autom access local cluster present demonstr biolog util approach integr rest system plan relat work work gener algorithm queri select optim ai tsimmi inform manifold infosleuth herm sim fig overview gene express process organ appli agent embodi algorithm compar work creat raw work organ retriev small work comput scienc direct biolog data area heterogen natur data make difficult store usefulli commerci relat work begun appli work wrapper mediat biolog tambi system differ pure implement technolog dynam support persist secondari user util form time resourc limit agent technolog make area word popular connot singl comput program bid found promot materi stand persist queri homolog found collabor commun agent project domain infosleuth annot genet sampl flow inform similar system system set notic public integr data sourc secondari user util project true system annot genom primari design observ sourc data annot updat express idea sourc analysi tool easi integr plai open system describ detail primari differ open system achiev clear possibl corba base share architectur support reason secondari user util decaf simplifi languag call bal discuss system oper web work interfac strongli orient biologist comput support process biologist analyz data primit annot store form impress biologist work compar manual annot flat ascii file recent ad approxim publicli sequenc strain human african result immedi result queri local biologist interest relationship result futur biolog work summer begin test biologist thing system excit biologist rel add type annot analysi fact system build similar system chicken open system concept matchmak annot agent access annot servic initi written secondari user util biologist face make simpl offic queri check result public underli decaf system evalu respect parallel comput resourc singl agent compon execut action run parallel efficaci schedul effici solv restrict subset schedul problem run gene annot system system result true time spent remot access tabl parallel hardwar agent local intens task involv est process motif distrib motif tabl averag process time uniprocessor distribut hardwar futur work paper discuss real problem make tremend amount genet sequenc inform produc inform public access inform sourc result singl research content primari sourc chang sourc techniqu analysi constantli develop cast sequenc annot problem gener inform gather implement basic heterogen problem problem ma solut mechan deal chang dynam mind secondari util characterist obviou distribut process achiev parallel concurr possibl handl secur organiz concern part agent organ mirror human offer system public sequenc system base chicken est end summer intend broaden annot coverag add complex estim physic locat gene function biologist long record trait physic region trait chicken resist gene physic locat region strong indic genet function design interfac biologist full advantag materi data uncomfort complex queri languag build graphic interfac creat commonli analysi queri save futur share agent namespac major subsystem agent link analyz gene express data turn metabol pathwai analysi system data link sequenc function power analysi link question chemic prevent club root acknowledg work happen work wei foster moham function annot subsystem work support nation scienc foundat grant refer adali subrahmanian amalgam knowledg distribut mediat intern journal intellig cooper inform aren ca knoblock intellig data inform server proc intl conf inform knowledg da benson al nucleic acid dt jone appli agent bioinformat fourth intern workshop collabor inform widom tsimmi integr heterogen inform sourc tenth anniversari meet inform process societi decemb davidson al digit librari research digit schmidt system autom genom annot intl conf autonom williamson design behavior inform agent intl conf autonom page marina del februari williamson internet fifteenth intern joint confer artifici page august keith decker victor lesser quantit model complex comput task environ eleventh nation confer artifici page juli keith decker katia sycara intellig adapt inform agent journal intellig inform nodin infosleuth coordin inform analysi complex applic technic report vr po brown explor metabol genet control gene express genom scale mb pt po cluster analysi displai express pattern proc nat acad sci alan garvei victor lesser schedul ieee transact graham ks decker agent framework nr jen intellig agent page springer john graham schedul system phd hendler taylor advanc high perform knowledg technic report maryland institut advanc comput kerschberg knowledg cooper intellig agent support inform kandzia cooper inform inform manifold technic bell ca hsu cooper agent inform retriev proc intl conf cooper inform system univ toronto learn expect rule inform sourc paper workshop ai inform technic report southern california nodin unruh facilit open commun agent infosleuth infrastructur intellig agent page rao mp georgeff bdi theori practic intern confer page san june aaai press steven al transpar access multipl bioinformat inform sourc zeng distribut intellig agent ieee decemb gene ontolog consortium gene tool unif biologi natur lesser complex goal criteria applic schedul fourteenth nation confer artifici juli
ML/95 6 fuzzi incorpor reason activ antoni technic research centr finland inform technolog po box finland abstract tradit trigger includ boolean predic trigger condit fuzzi trigger fuzzi infer util condit evalu approxim reason integr tradit crisp approach pave intuit express applic semant applic fuzzi trigger model set fuzzi rule encapsul function call rule set lead trigger model action express fuzzi trigger model exampl provid illustr fuzzi trigger appli drive control system industri instal introduct interest activ rule trigger commerci decad refer activ provid capabl react possibl call user recent effort integr activ technolog tempor realtim investig issu incorpor fuzzi logic activ object appli fuzzi techniqu evalu trigger condit base boolean predic fuzzi logic deal statement true valu fuzzi bell rue de la canada logic systemat basi repres uncertainti object fl mimic abil human mind effect emploi mode reason approxim exact applic fuzzi logic found field includ automat artifici intellig pattern effort made bring uncertainti trigger similar work address context fuzzi expert system zadeh note expert knowledg fact rule fuzzi fuzzi expert system fuzzi consequ rule form fuzzi proposit util approxim reason deal infer uncertainti main idea work similar spirit consid context fuzzi expert system work origin driven requir real applic domain paper machin drive manag system order avoid failur drive singl mechan abil notifi user process data state requir oper possibl express condit detect simpl intuit captur utter temperatur rise requir typic industri process manag applic amount data store process face lack process user demand appli measur manag inform flood paper present main proc intl conf data engin florida copyright ieee person materi permit permiss materi promot creat collect work resal redistribut server copyright compon work obtain ieee copyright permiss ieee servic center hoe lane po box nj usa intl emb fuzzi rule trigger condit model call present section introduc concept fuzzi action reason mechan select real action trigger model section trigger model oper tradit environ crisp enabl emb applic semant effect intuit shown case studi discuss pro con approach section open question research plan present section basic concept fuzzi infer section introduc basic concept fuzzi set fuzzi infer requir defin fuzzi trigger fuzzi set set boundari transit membership gradual crisp fuzzi set membership function associ element grade membership fuzzi set note classic set special case fuzzi set membership valu linguist variabl basic concept underli fuzzi logic linguist variabl valu word number linguist variabl linguist term set set linguist valu defin syntact rule gener valu semant rule associ mean linguist variabl temperatur term set term fuzzi set interpret temperatur temperatur close temperatur term fuzzi set membership function formul shown fig current temperatur membership fuzzi subset low equal low normal hot low normal hot figur membership function linguist variabl temperatur fuzzi infer fuzzi implic view describ fuzzi relat fuzzi set form implic fuzzi fuzzi implic membership function note measur truth implic relat part implic call part call consequ mamdani membership function fuzzi implic defin easi correct extens tradit proposit logic yield interpret fuzzi implic fuzzi modu ponen extend gener modu ponen input fuzzi rule consequ membership function fuzzi set defin max gener modu ponen adapt wide control mechan call interpol reason mechan applic relationship collect fuzzi rule fuzzi logic interpol algorithm process convert crisp input fuzzi set call fuzzif map input membership function truth map fed rule wide fuzzifi fuzzi singleton defin fuzzi input set crisp element formula fuzzi rule base linguist variabl defin input crisp fact goal determin output interpol reason commonli fuzzi infer method infer method process obtain fuzzi output infer method consist find fire level truth rule appli part rule membership function defin input variabl appli actual valu determin truth rule truth rule refer alpha comput ai bi ai bi rule nonzero truth input match partial rule fire step find min mamdani implic implic interpret fuzzi ai bi ci ai bi ci fuzzi subset assign output variabl combin form singl fuzzi subset output variabl aggreg individu rule output obtain system output max combin output fuzzi subset construct maximum fuzzi subset assign output variabl infer result fuzzi infer system fuzzi set step produc repres crisp final output system method commonli centroid crisp base result output fuzzi set trigger section trigger model incorpor approxim reason process evalu condit part eca trigger call trigger trigger eca execut model trigger easili implement exist fuzzi infer tool incorpor fuzzi infer order util express power fuzzi rule appli fuzzi infer trigger condit special function call rule set function set fuzzi rule rule fp fc fp fuzzi fc fuzzi consequ fp fc construct fuzzi linguist variabl repres fuzzifi term membership term set fuzzi connect fuzzi oper consequ linguist variabl occur fuzzi rule correspond current previou state refer state keyword concret syntax rang domain output linguist variabl yield regular comparison predic true execut model execut model determin trigger behav elabor behavior dimens eca trigger coupl conflict simpl eca trigger execut model shown simpl rule process execut repeatedli execut consecut calcul perform event detect event find relev evalu condit execut action condit true approach incorpor fuzzi infer trigger requir modif calcul step rule process algorithm condit induc rule set function call evalu linguist variabl part rule sourc data fuzzifi infer method appli rule produc fuzzi fuzzi method yield crisp function appli comparison predic show gener alarm drive system main watch temperatur behavior electr motor temperatur motor expect behav motor thermal model defin temperatur function power assum relev motor measur seri store singl tabl ts measur temp measur motor deviat denot deviat thermal model step defin definit linguist rule set function trigger entiti treat class object creat remov similarli exampl formul syntax languag tempo server prototyp implement inform technolog base sql trigger syntax base definit linguist type begin defin input output linguist variabl fuzzi rule input variabl call repres temperatur chang current previou temperatur input variabl call deviat reflect deviat motor thermal model domain linguist variabl defin linguist type repres linguist defin linguist type call creat linguist type float neutral singl output variabl repres sever level alarm variabl linguist type defin creat linguist type sever float definit rule set fuzzi type fuzzi term defin rule set fuzzi rule fuzzi rule seri statement occurr alarm condit assum default alarm consid output rule fire rule set defin creat rule set dev sever default neutral dev neutral dev dev rule set alarm level combin effect temperatur deviat temperatur chang order simplifi output variabl explicitli rule type definit trigger defin trigger condit part function call rule set fuzzi trigger medium high defin test return rule set call shown trigger fire insert measur creat trigger insert motor keyword repres special semant tabl tempor denot insert row denot row insert time seri standard semant updat predic yield action call execut action convent enabl call intern extern execut server depend applic express trigger present limit respect express power tabl rule dealt distinct valu express trigger depend domain rule set industri import capabl reason base histori order understand trend process control rule set function defin section extend correspond current state correspond previou state implement tempor rule motor hot minut fuzzi regular trigger existenti fuzzi trigger base fuzzi rule util wide varieti fuzzi quantifi exemplifi linguist quantifi proposit written xs mean element set satisfi fuzzi predic quantifi proposit motor hot linguist fuzzi quantifi fuzzi quantifi rang extend fuzzi fuzzi rule address state approxim reason fuzzi fuzzi provid capabl store vagu data capabl enabl user summar view data user motor hot obtain crisp context fuzzi infer process fuzzifi valu fuzzif phase result infer fuzzi store sourc event advantag limit trigger summar section trigger highlight advantag limit main advantag adopt trigger design trigger seamless integr fuzzi infer trigger tempo server prototyp implement demonstr exist activ server easili extend fuzzi logic exist fuzzi infer tool base fuzzi enabl easili captur expert knowledg incomplet vagu make trigger suitabl model knowledg fuzzi trigger enabl shorten applic develop time case studi reinforc claim industri partner gave high mark possibl defin fuzzi total dynam limit trigger earli phase place crisp function output evalu result impli difficulti defin boundari comparison predic trigger defici remov implement note trigger inform tempo server prototyp activ system fuzzi trigger tempo server extens activ time seri system util model languag base sql trigger function tempo server deriv case studi requir specif problem real industri applic syntact shape trigger implement tempo server detail demonstr applic tempo server download web site trigger consid trigger extend convent condit part regular trigger includ fuzzi rule rule set function step introduc fuzzi action integr condit part tightli call industri manufactur complex drive system industri instal fuzzi built action specif fuzzi rule main benefit trigger reduc wide acknowledg fact trigger affect perform system make process develop applic activ difficult trigger defin system provid dimens causal activ make process inher process combin extend infer trigger import condit action part regular trigger matter action execut iff condit match matter trigger trigger symbol repres mean event fire evalu fuzzi rule fuzzi fuzzi action consequ model relationship state concret action express fuzzi rule set fp fa fp fa fp fa fp fuzzi predic form trigger fa fuzzi action proposit repres fuzzi action linguist variabl exist set concret action real distinct procedur set map linguist term denot fuzzi action uniqu concret action membership function defin arbitrari domain relationship fuzzi action captur fig fuzzi medium high concret action action action action action low medium high action action action action figur membership function fuzzi action execut model trigger induc modif calcul step condit action part rule process algorithm execut model event event detect linguist variabl part rule sourc data fuzzifi infer method perform result form fusion rule result produc fig result shown term figur fuzzi action proposit action ca figur fuzzi result action action select fuzzi result interpret invok concret uniqu invoc map fuzzi result fuzzi action polici select action yield crisp action ca select fuzzi action membership function yield highest zi ca ca ca zn ca select concret action execut crisp ca map fuzzi action low concret action action multipl invoc map fuzzi result concret action map involv check membership fuzzi infer activ action membership exce threshold gener multipl invoc requir studi present section deal alarm treatment drive control system show trigger specif simplifi trigger assum alarm notif action invok linguist type rule set definit term type sever fuzzi action virtu action shown trigger definit creat fuzzi trigger insert motor infer deviat uniqu trigger job action invok uniqu action specifi uniqu action invoc polici express power trigger achiev major departur tradit trigger condit action part replac rule set part action map discuss fuzzi trigger fuzzi infer evalu situat interest occur section address common critic fuzzi approach discuss applic domain critic fuzzi approach assign membership function linguist term problem knowledg acquisit human requir common user defin shape membership function exist approach gener membership function base soft comput techniqu neural network genet algorithm fuzzi trigger model appli applic combin fuzzi activ behavior regular trigger fuzzi trigger complementari part applic inher fuzzi easili express fuzzi trigger fuzzi trigger case process manag autom system proprietari solut accept technolog industri promot provid mechan meet requir process provid effici mean store queri process measur data mechan fuzzi trigger analyz intellig larg volum store data fuzzi trigger make attract develop industri applic attent reader notic dealt applic requir gener intellig event notif tradit role trigger area maintain studi shown fuzzi trigger futur work trigger model fuzzi quantifi implement project studi perform industri user commun order achiev conveni interfac format mechan remain issu requir gener model fuzzi event captur event composit introduc concept fuzzi event trigger model deal import issu studi fuzzi concept behavior dimens activ system coupl industri requir fuzzi concept captur relev semant fuzzi trigger activ aim combin import fuzzi reason activ extend basic semant rule fuzzi rule fuzzi infer trigger model implement test applic advanc trigger fuzzi action introduc integr infer process trigger reduc trigger provid possibl captur action singl trigger definit exampl util concret show model result intuit interfac refer hansson activ system proc intl workshop activ realtim june fuzzi event approxim reason activ proc sixth ieee intl confer fuzzi system juli pp soft constraint fuzzi posit workshop juli implement tempo fuzzi proc eighth intl confer expert system applic sept pp data engin special issu june mm approxim reason expert system elsevi scienc inform georg klir yuan fuzzi fuzzi select paper advanc fuzzi vol ks mh wong fuzzi expert data knowledg vol pp jm logic system proc special issu engin applic fuzzi march pp march pp appli fuzzi trigger drive control research report inform august mh activ proc intl workshop rule august pp fe fuzzi principl contribut patrick intern seri intellig page rm ja dt activ sigmod record pp ansi languag sql melton march ib membership function fuzzi set vol pp widom ceri activ trigger rule advanc process morgan widom activ pp rapid case requir design proc workshop march newport pp la zadeh inform june pp la role fuzzi logic manag uncertainti expert system pp la fuzzi ieee tran knowledg data pp propag expert pp
IR/96 5 learn web search chen depart comput scienc american tx usa zhu depart comput scienc citi hong kong hong china abstract paper investig applic learn algorithm problem web search web document index boolean featur present practic effici learn algorithm search web document repres disjunct relev featur design implement adapt web search learn compon sail learn relev feedback user search desir web document architectur perform discuss introduct nowadai number search engin peopl search desir web document exist search engin uniqu interfac index cover portion web prove popular search engin user repeatedli refin queri knowledg formul queri search engin return tremend url web document forc user manual sift long list locat desir document user search engin dialogu user user send queri engin queri search meng depart comput scienc american tx usa richard fowler depart comput scienc american tx usa index return list document url user engin relev engin feedback improv search return refin list document url dialogu end engin find desir document user note conceptu queri enter user understood logic express collect document user list document url return engin interpret approxim collect desir document type scenario similar process learn queri user act teacher engin learner user qualifi teacher model averag user common kind document inform search engin easi search engin understand disjunct conjunct keyword chosen express search goal exist search engin user set keyword defin collect desir document receiv relev feedback search engin find effici feedback improv result search perspect machin fundament question learn algorithm applic problem problem web search theoret learn algorithm readi user model user make mistak patienc coupl dozen interact practic factor index rank involv investig applic onlin learn algorithm web search exist search engin support queri repres disjunct conjunct learn algorithm search collect document repres disjunct relev featur conjunct case cope similarli start point investig abil inher rank mechan product weight vector document small updat complex mistak bound learn disjunct relev featur small mistak bound winnow high practic web search tune paramet ¤ mistak bound ln learn disjunct relev featur ¥ boolean vector space huge vocabulari keyword index document web search vocabulari refin search document repres disjunct relev keyword refin user examin properti document design tailor version section problem web search search collect document repres disjunct relev mistak bound promot demot ¤ total number distinct featur index posit exampl judg user receiv search process bound obtain toler featur error averag number relev featur occur posit practic concern project smaller top match assum ¤ make mistak worst case learn disjunct relev featur worst case mistak bound learn disjunct implement adapt web search learner learn compon interest reader access url end paper learn relev feedback user search desir document relev feedback implement sun ultra workstat storag hard disk ibm workstat intern index compon altavista document intern index keyword user perform search search intern match found queri intern turn compon receiv match document altavista perform learn process local effort appli machin learn web search relat scientif articl locat user profil crawl collabor filter remain part paper organ section examin similar learn web discuss properti learn algorithm order applic web search section discuss differ approach web search relev feedback algorithm inform retriev section examin properti web document index design learn algorithm tailor version web search section discuss practic issu document rank queri simul actual employ learn compon discuss architectur perform conclud paper section learn web search learn model goal learner learn concept class domain learn unknown target concept fix teacher order obtain inform learner teacher queri fix hypothesi space teacher learner succe teacher respond algorithm make mistak call posit neg hypothesi issu depend earlier exampl receiv learner learn target concept learn class polynomi time learnabl learner learn target concept time requir learner polynomi size domain size target concept time complex interest total number mistak algorithm make order learn target concept easi number queri learn algorithm learn target concept number mistak algorithm make learn process learn queri approach problem web search vector space model repres document vector space consist boolean vector consist discret frequenc vector index keyword target concept collect set vector document collect learner search engin teacher user goal search engin find target concept minim number mistak defin interact user search engin process start time user feedback search queri begin search engin end time search engin displai search result back user unreason assum user averag judg document relev irrelev provid relev feedback search engin averag user perform dozen interact averag user judg document relev feedback search engin entir search process exist search engin support disjunct conjunct featur queri format practic accept averag paper focu problem search collect web document repres disjunct relev featur conjunct cope similarli base learn algorithm properti order applic problem web abil toler error featur error classif error mistak bound search document repres disjunct relev mistak bound rank mechan move relev document top relev bottom comput interact perform time linear vector dozen practic user qualifi model learn logic target answer queri reason assum user judg web document relev make mistak aspect point case user web document relev case scope paper studi futur research learn relev feedback distinguish learn approach web search relev feedback algorithm inform retriev central idea relev feedback improv search perform queri modifi queri step base judgment relev irrelev document retriev vector space model document queri repres vector discret vector space relev feedback essenti learn queri vector similar measur classifi document relev judgment relev irrelev classifi document exampl updat queri vector linear combin initi queri vector exampl judg user product similar relev feedback learn algorithm variant relev feedback inform retriev popular relev feedback algorithm work step step adapt refin fashion start ¢ initi queri vector algorithm £ search £ document close ¤ similar rank ¢ final present short list ¤ top rank document user user examin return list document judg document relev irrelev step assum list ment user judg algorithm ¢ updat queri vector coeffici step algorithm ¢ updat queri vector similar search relev ¤ rank document present top rank ¤ document user threshold ¤ explicitli select highli rank document coeffici fix formal analysi relev feedback prove boolean vector space typic similar dice cosin jaccard relev feedback algorithm make mistak search collect document repres monoton disjunct relev featur boolean vector space ¥ lower bound independ choic threshold coeffici algorithm updat queri vector make classif lower bound establish relev feedback algorithm base worst case affect effect applic problem theoret formal analysi motiv design learn algorithm inform retriev design section provabl mistak bound learn disjunct relev featur small product similar measur algorithm set featur index web document repres vector space ¥ document £ ¥ denot vector defin ¥ collect ment vector satisfi monoton disjunct class collect document repres monoton disjunct relev featur variabl machin learn effici algorithm construct search collect document theoret effici algorithm exist learn disjunct relev featur meet applic requir discuss section meet requir mistak optim constant high web search user log lower bound learn disjunct relev featur boolean vector essenti imposs improv upper bound gener exploit properti web document seek opportun reduc bound concret case web search definit featur document £ index featur document £ compon featur document vector ¢ £ huge collect featur simplest index web document £ number index featur small easili note web hypertext document hundr distinct good dictionari word argu long document true index word long document index small portion word index close relat classif depth classif tree effici web kilobyt document long current version http protocol creator web document list keyword document index classif peopl list coupl dozen keyword add web challeng problem document index classif resolv automat extract keyword author relat web document tend aggress emploi kind influenc averag web user follow practic user queri search engin find match rank return top rank user strategi studi document rank move relev document top relev bottom classic vector rank algorithm locat author hub work effect document rank relat broad topic pagerank kei rank method googl learn algorithm web search construct advantag exist rank mechan user queri search learn algorithm list return search engin initi search relev feedback user effect propag prefer initi list document return document user interest short list top match learn algorithm begin user interfac dispatch index meta searcher parser index figur architectur web pai attent propag influenc relev document judg user design tailor version exploit natur web search present mistak bound section actual implement document rank queri simul section kei differ set initi weight set initi weight promot strategi set initi weight simpl motiv focu attent propag influenc relev irrelev document adjust search space approach effect implement exist effect document rank mechan coupl learn process discuss section algorithm tailor maintain ¥ weight ¥ featur maintain ¢ threshold ¤ weight promot demot factor classifi document ¥ vector satisfi ¤ ¤ irrelev ¥ user document contradict classif make mistak denot weight current updat user respond document contradict current updat weight document judg user relev ¥ vector set ¢ ¢ document judg user irrelev vector set ¥ denot total number distinct index featur relev document judg user learn process theoret mistak bound obtain learn collect document repres disjunct ¤ ¤ relev featur boolean vector make mistak averag relev featur index featur relev document judg user learn bound theorem improv averag ¤ abil toler featur error classif error boolean pair classif denot featur error respect target concept minim number featur bit chang ¤ ¤ ¤ true number featur error respect target concept sequenc exampl pair classif valu simpli total number featur error pair learn algorithm learn target concept featur error occur learn process number featur error respect sequenc pair receiv algorithm classif judg user boolean ¤ classif error pair respect target concept true point classif error featur error attribut error target concept repres disjunct relev featur state featur bound mistak bound obtain denot total number featur error occur learn process collect document repres disjunct relev featur boolean vector make ¤ mistak user judg document index featur relev featur target concept mistak bound obtain figur interfac averag relev featur index featur relev document judg user learn improv mistak bound ¤ present design implement sail discuss learn compon mention previou document rank queri simul document rank ¥ weight vector maintain rank function independ defin rank function £ web document £ vector £ £ £ ¥ ¥ £ remain constant document £ learn ¢ process strategi ¢ defin pagerank classic vector rank addit tune paramet perform individu document promot demot document judg user relev feedback learn process motiv individu document promot demot statu document determin closer top rank support weight sum relev closer bottom £ £ £ £ £ updat similar fashion updat £ ¥ queri simul rank function rank document classifi return top relev document user top rank document repres approxim classif made user examin short list document feel satisfactori result end search process find document list misclassifi document relev feedback user interest top rank tune order provid view classif made system give user list document rank top select document list randomli select document rank top select bottom rank document architectur adapt web search learner design implement winter break implement sun workstat storag hard disk ibm workstat goal project show work theori work practic emploi learn compon user search desir document relev feedback architectur figur demonstr version interest reader access url end paper work interfac shown figur user enter queri number top match document url return maintain intern index document document index keyword compon queri altavista user enter queri start search search intern index relev document found receiv list top match document extern compon displai search result user format shown figur shown figur interact provid top bottom rank document url document url radio button figur initi queri result user document relev search queri document url clickabl view actual document content user judg document relev accur user click radio click feedback button submit feedback function feedback provid user feedback button click receiv feedback updat weight vector perform individu document promot demot document displai top bottom document url user dispatch queri relev feedback inform interfac decid compon invok continu search index call queri altavista receiv list top match document searcher parser index work receiv document index keyword receiv cach index rank function process relev feedback kind client side metasearch learn featur expand project perform actual perform rel recal measur perform search process shown figur perform januari queri word desir web document relat learn interact relev irrelev document judg user relev colt relat web document initi match move top posit queri ¢ rel recal ¢ total number relev document list ¤ retriev number relev document rank top posit final search result search engin select queri calcul averag rel recal queri repres collect word test return document ¤ number record number interact number document judg user rel recal calcul base manual examin relev return document experi reveal achiev averag rel recal averag interact averag document judg relev feedback conclud remark web interfac human user vast inform gold mine daili life web evolv design practic effect web search algorithm challeng task call innov method strategi field includ machin learn point web search understood learn queri learn algorithm readi web search number realist requir fundament question learn algorithm applic realworld problem web search goal paper start point theori applic learn algorithm problem web search design tailor version small mistak bound practic applic web search design implement adapt web search learner learn compon show work effect practic learn increment depend histori learn process improv learn creat maintain specif thread web search process search process relat thread termin experi learn algorithm emploi client side compon web browser effect user search web realist emploi learn algorithm popular web server side figur refin result interact exampl popular web server thousand user access singl afford maintain thread individu search process url refer angluin queri concept learn machin modern inform retriev gile autonom web agent automat retriev identif interest public intern confer autonom page acm press gile system automat person track scientif literatur web fourth acm confer digit page acm press brin page anatomi hypertextu web search engin seventh world wide web kleinberg automat resourc compil analyz hyperlink structur text seventh world wide web page chen meng client site meta search learner aaai workshop artifici intellig web juli fowler search web queri knowledg inform chen zhu formal analysi relev feedback algorithm technic report dept comput march raghavan infer web commun link topolog ninth acm confer hypertext id interact search strategi dynam file organ inform retriev smart system experi automat document page englewood id experi relev feedback smart system experi automat document page englewood jj rocchio relev feedback inform retriev smart retriev system experi automat document page englewood kleinberg authorit sourc hyperlink environ journal gile index retriev scientif literatur eighth acm intern confer inform knowledg lewi learn intellig inform retriev eighth intern workshop machin page littleston learn quickli irrelev attribut algorithm machin maass warmuth effici learn virtual threshold gate inform nakamura ab collabor filter weight major predict algorithm machin fifteenth intern renni mccallum reinforc learn spider web effici sixteenth intern confer machin salton automat text retriev inform comput yang vector space model automat index comm yuwono lee search rank algorithm locat resourc world wide web intern confer data page
HCI/97 4 introduct user interfac model uml paulo da silva norman paton depart comput oxford manchest uk abstract unifi model languag natur candid user interfac model standard notat object orient model applic mean clear model ui uml paper present user interfac model case studi uml case studi identifi aspect ui model uml set uml constructor model ui model problem weak uml model constructor exploit strength identif strength weak formul strategi extend uml provid greater support user interfac design uml standard languag model softwar applic user part applic model uml uml natur candid notat ui model mean clear model user interfac uml easi identifi user interfac user task support uml applic model report project specif appli uml model ui model problem design case studi complet address design method uml specif made model support design ui notat research design user johnson design ui declar griffith al invent model construct ui exist effect good construct ui rest applic singl notat consolid complet design user interfac research identif ui aspect uml clear aim paper present descript ui model case studi uml case studi common ui model problem set uml constructor diagram applic develop design ui model problem identifi aspect ui cover uml set constructor identifi aspect ui cover uml case studi produc insight uml model ui element develop strategi extend uml order provid support user interfac design case studi describ method ui design method consid find altern model view overcom difficulti identifi idea solv identifi ui model problem uml case studi consid user interfac import categori applic user interfac system ui web applic ui restrict scope user interfac mean user interfac applic figur case diagram word processor simul scope studi ui model introduc case studi ui model baselin develop ui model base uml case studi consid model visual compon import model widget ui design case studi discuss widget widget model case librari system librari case studi identifi user interfac model problem librari system case studi consid simpl catch real problem face model user interfac librari system simpl compar real system prove suffici complex rang problem identifi area user interfac model case diagram figur show actor librari system case actor librarian borrow actor librarian borrow librarian librari system manag book catalogu loan record librarian inform librari system book check check system manag loan record case creat connect list book borrow librari user search book year combin case consid case login system check password borrow book catalogu condit case borrow search oper repeat result search oper librari system regist user login system system borrow perform servic librarian perform servic librarian book select user search book catalogu book user check avail case model extens book select oper user check statu case similar featur behaviour book case book case call creat model share behaviour unidirect associ creat model relationship book common behaviour case diagram system specif paper obtain design domain model repres class diagram shown figur class diagram loan class correspond librarian borrow exist instanc book mean book entri librari catalogu manag librari system class repres copi version book librari book librari catalogu newli order book book damag book insert librari catalogu order case librarian creat instanc loan creat process model case destroi process model case loan object essenti dai figur domain model book return stereotyp stereotyp paper introduc softwar engin incorpor uml stereotyp identifi class class instanc model thing object exist stereotyp identifi class class instanc perform system behaviour stereotyp identifi class class instanc handl interact system user system case studi descript context introduct ui design task model case figur show borrow book borrow log perform function uml terminolog mean actor borrow case case situat slightli complex fact borrow log system borrow login fail case diagram show case extend explain extens problem case diagram design requir provid control flow inform relat task activ diagram figur show borrow interact user interfac librari system notic activ thing activ log mean case system user successfulli log system activ diagram show log system user select search book quit interact applic user check statu book book select activ select book select book check book statu log select function search book book book search book select search option book detail search domain search perform search view result select option figur partial view task model appli activ diagram control user interfac navig resembl tradit hierarch task analysi wide describ user task model case thing similar characterist consid high level activ similar task relationship case activ uml clear case provid featur user design activ diagram singl activ diagram model task flow activ activ mean interrupt time execut activ search book figur explain addit activ diagram shown figur task requir inform domain model inform provid user gener activ diagram figur select book pass activ select book activ check book statu data flow activ diagram model object flow figur activ select book identifi object class book pass activ check book statu data item acquir interact diagram case object flow techniqu provid activ diagram avoid necess check interact diagram discov task access inform abstract present model model ui present natur model applic simpl model part ui present essenti stage detail model ui kind compon compon group oper ui element abstract present model model user successfulli log librari system exemplifi abstract present model figur show sequenc diagram scenario case case diagram figur object initi send messag instanc librari act librari system figur sequenc diagram case practic request connect messag doubl click librari icon window librari system ronment system immedi creat object class execut oper call login password creation object model object send messag object object present user connect user interfac cancel request login password user interfac form shown figur figur uml figur displai uml notat design ui present claim uml ui mock notat lead earli commit term ui layout compon select argu uml notat describ structur abstract user interfac class object diagram notat earli ui design support task design activ diagram explan sequenc diagram requir auxiliari provid abstract present structur abstract present shown figur provid group mechan structur element ui present gener abstract compon repres figur stereotyp identifi abstract present model class categori relat compon provid visual label categori relat compon receiv system event propag system button categori relat compon receiv system event model user option navig menu figur abstract present model provid discuss abstract compon class diagram shown figur framework describ conceptu user interfac object diagram class diagram conceptu descript user interfac conceptu model shown figur link label link instanc label integr abstract present behaviour figur abstract model set oper defin stage design oper provid basic understand set oper implement object messag draw form output devic automat perform object creat collect inform provid user requir transform inform provid suitabl paramet system oper messag model system oper interact system user object gener due system event aggreg compon object oper inform object user submit inform system user abort interact form submit inform abstract present model return sequenc diagram figur librari system creat object class execut method method draw form present user interact ui user send messag object messag event button shown figur abstract present model object perform oper pick data provid user collect object send system oper messag pass login password paramet object prepar queri submit manag system object class person provid instanti person object send messag person object check provid password password object creat object destroi present sequenc diagram restrict scenario user successfulli log system unsuccess attempt log system scenario model section present section abstract present model weakli connect flow object activ diagram activ diagram explain data flow ui underli applic relationship activ instanc facilit design task abstract present activ involv user interact support object difficult identifi object activ identifi activ object concret present model abstract present model describ compon class provid descript layout describ event user interfac compon relat oper class concret present model requir ui design process concret present structur layout concret present point abstract present model present figur design pattern specif ui present model pattern call present framework design pattern present gamma al incorpor describ environ accommod diagram element abstract present sequenc diagram figur concret present model term environ class compon environ terminolog class program compon java show ui class relat environ class stereotyp identifi environ class figur show concret present model present framework java awt compon present framework repres collabor symbol uml present framework pattern clear descript abstract present class replac concret present respect relationship abstract present model figur show frame bound bound label bound bound button bound figur concret present model present framework pattern extend compon bound extens provid declar notat model map abstract concret compon concret present present figur requir model case studi concret present model descript present layout instanc class act instanc aggreg categori layout object ad concret present model ad subclass model ui present layout explain concret present model reli semant environ case concret present model figur java algorithm method work templat model layout present model ui concret present model base present framework larg part design provid model flexibl relationship class compon class compon present figur model awt compon swing replac awt compon natur break abstract present model figur present concret present model present figur model object diagram link integr link introduc section link relat instanc frame role respect instanc link mandatori instanc frame figur show panel model subclass bound class consid part concret present model figur concret present model concret present behaviour model structur concret present model behaviour recal figur number compon behaviour object class button event trigger user press button object class label event handl applic problem present behaviour model identifi uml diagram event object applic model object instanc frame oper event inspect applic messag sequenc diagram figur model messag actor object repres event ui compon model present behaviour produc interact diagram ui event case model success log user system model scenario cancel button press figur show sequenc diagram case user press button cancel cancel button press event repres button press messag user graphic compon cancel button button press messag concret present model event specifi kind event compon button trigger messag messag interrupt interact user librari system figur sequenc diagram case model interact diagram ui event good strategi singl case scenario user interact singl object event strategi handl combin event minimum number interact diagram describ event problem bad compon encapsul part applic behaviour complex compon reduc number event object handl event model booch event thing happen kei button messag call thing happen event user input output stream event figur show gener event model user action event user interfac input event user react input event gener output event present visual feedback visual feedback normal feedback abnorm feedback abnorm visual error difficulti encount enact task user action event user interfac figur event model normal feedback abnorm feedback user system event normal visual feedback event discuss paper figur user interact object send receiv messag object object send receiv messag object aim section discuss strategi model user interfac featur relat special kind event creat unexpect happen system amount function interact applic involv cater unexpect gener insid applic data displai user interfac data applic abnorm visual feedback happen event gener system action model independ section discuss special event turn model except handl defin meyer event routin call routin call fail termin execut state satisfi contract definit complex requir definit contract complex identifi fail except obviou task formal except akin program languag java term user import aspect except solv except lead applic provid visual feedback user wrong except handler solv problem identifi except notifi user except handler solv kind problem user notifi unsolv except involv solut problem problem model aspect user interfac relat except handl structur aspect ui except handler applic model situat except except handler design displai error messag form due except execut queri uml except model stereotyp depend class oper except handler class figur show depend link oper class fail class booch al hierarchi except handler identifi stereotyp except except handler hierarchi caught except handler reach handler hierarchi except handl figur handl except except gener class gener method contract broken fact except handler act model class catch except class categori class introduc figur relationship ui except handler oper class call method method class role class act class class except happen situat class control class except handler requir quit retri origin object compon deal object creat provid commun except handler user term user import class relat hierarchi except object class act object class class aggreg class figur act handl class stereotyp identifi relationship class control behaviour aspect ui except handler except affect task model user interfac modifi flow control activ activ user interact activ perform search figur except queri perform select search option book detail search domain search perform search view result select option handl figur except task model model modif flow control task model straightforward task activ diagram provid branch notat outgo transit depend boolean guard express figur show activ diagram figur extend model except handl branch activ perform search flow control except happen execut perform search guard flow control activ call handl solv handler flow control usual rout identifi keyword event model call synchron ui ui displai data frequent updat object visibl asynchron ui user graphic implement asynchron messag addit problem synchron ui model asynchron messag gener idea solv problem refresh object updat data frequent requir gener event produc ui updat approach model synchron ui gener event call event natur candid event gener locat updat data event gener queri object updat data gener event case event gener object approach model synchron event gener object present class diagram shown figur signal statu figur model synchron uml featur discuss model synchron class render heavi class render signal time constraint depend relationship stereotyp explain featur explain model heavi line instanc class activ object instanc activ behaviour event gener instanc constraint depend mean instanc gener event time updat constraint mean instanc activ mechan identifi state updat stereotyp mean instanc class signal system event type happen mean object class push updat statu stock item class listen kind event signal compart identifi instanc class listen event mean instanc listen notifi time event gener return class diagram figur notic time updat instanc gener current statu stock item event listen instanc send messag instanc updat displai data attribut insid signal work identif mechan prevent object displai statu stock item model approach suitabl system synchron ui essenti complex push mechan insid object complex object oper chang state state monitor identifi state modif object insid method complex push mechan object displai object event object signatur singl event notifi listen put packag applic figur show packag diagram overview system packag diagram show depend compon system figur packag diagram librari system class class instanc group user interfac packag class object abstract present model packag class shown figur control packag class class present sequenc diagram figur domain model packag class class diagram class form domain model figur environ packag class build user interfac environ program languag java compon activex java composit set compon program languag environ concern visual part user import user interfac complex compon concret present model packag class environ packag bound class present framework pattern paper discuss user interfac model librari system case studi applic system model unifi model languag prove model user interfac uml rich set constructor complet model architectur aspect user interfac ui model straightforward process expect desir model problem identifi case uml describ relationship case activ section case provid aspect user requir postcondit design activ diagram uml notat describ abstract present section uml notat order support design ui present uml provid relationship class provid abstract present figur activ difficult identifi ui relat activ involv user section case studi illustr uml term model user interfac summari uml diagram present tabl constructor diagram present paper user interfac element uml resourc domain model class diagram task model activ diagram present model class diagram design pattern interact diagram object diagram event ui relat except handler class diagram activ diagram event ui class diagram tabl summari uml diagram model ui element statechart constructor activ diagram design widget paper reason interest transit transit model widget lesson learn model librari design user interfac complex process requir complet element user interfac ui gener element requir begin design element user interfac depend shown figur design process ui model integr room discuss model user interfac uml wai repres user interfac uml studi paper present approach acknowledg author sponsor de grant refer widget abstract interact object advanc appli page west usa publish jacobson unifi model languag user guid wade object odmg morgan san collin design user interfac redwood vlissid design element reusabl softwar steel java languag specif green survei dialogu model acm transact juli smyth user interfac develop environ object page septemb ieee press grai exploit techniqu user interfac page object manag group omg unifi model languag june version harel execut object model statechart ieee softwar case driven approach addison johnson human comput task analysi softwar engin guid task analysi taylor uml user interfac model intern page june meyer softwar construct prentic upper saddl myer survei user interfac program page program languag retrospect challeng interfac develop design user page press
HCI/98 4 model person emot control behavior anim interact agent elisabeth martin patrick steve thoma rist dfki introduct german research centr artifici intellig recent start advanc understand fundament technolog requir drive social behaviour interact anim agent initi time catch current wave research commerci interest field lifelik charact affect user interfac puppet project promot idea virtual puppet theatr interact learn environ support develop emot intellig skill project featur inhabit market place person trait modifi role virtual actor sale present presenc project intern model possibl affect state guid dialogu agent user project reli similar approach model emot person variat regard underli factor influenc emot complex underli model emot emot person trait made observ model person emot challeng face attempt affect fact term refer class phenomena distinguish mental behaviour event affect literatur describ class motiv control state result valenc reaction object event includ make affect attribut activ valenc class affect state differenti emot tend close specif event object short mood longer durat context defin person complex characterist distinguish individu nation total behaviour emot emot interrupt redirect attent accompani consensu natur mean exist theori model person emot plai role enhanc interact captur affect phenomena entireti start point factor model cognit structur emot model clore model readili amen intent ideal suit task puppet project fund european commun programm school start octob project partner aalborg imag cognit comput financ intern dfki inhabit market place fund bmbf für und creat concret person emot enhanc believ comput charact occ model emot classif scheme common emot label base valenc reaction event object light agent attitud occ model model presenc puppet determin affect state charact event environ pure descript dimens deriv factor analysi larg number peer report adject descript natur explicit model concentr affect interfac directli express trait offer interest possibl attempt recreat person trait analysi emerg social social concentr trait outgo confid agreeabl hostil complianc hostil level emot depend control influenc emot charact addit gener affect express manner easili interpret user case puppet project young person emot convei wai empir charact direct power phrase charact speak faster gestur render dialogu act depend emot state effect mean convei emot includ acoust bodi gestur facial express studi directli applic anthropomorph agent presenc clear extent appli anim anthropomorph featur charact virtual puppet theatr person emot filter constrain process select instanti behaviour defin specif behaviour charact emot state state convei simpli result affect occ easili deriv person trait hunger model mimic activ bodi state motiv drive mechan provid affect input signal role affect person puppet object puppet project develop investig virtual realiti virtual puppet base theoret framework prototyp develop children ag decid model virtual avatar set synthet charact interact fig show screenshot virtual environ develop project partner laboratori imag analysi aalborg deploi avatar synthet charact plai children distinguish master multipl role interact actor audienc main activ enact reflect process children gain basic understand emot state person profil influenc behaviour physic verbal action social interact induc emot approach similar children direct action utter interact children induc emot state select action project partner cog evalu group year children fig puppet environ plai hope find valid assumpt emot intellig skill improv construct simpl model virtual puppet mind role affect person inhabit market place fig inhabit market place fig inhabit market place object inhabit market place investig team lifelik form sale present fig basic idea commun inform mean simul dialogu observ audienc main featur gener present charact commun plain fact subject matter present point view reflect specif person emot interest profil project implement complet model person charact demonstr system design testb experi person role inform system test encourag intent make author system peopl found gener dialogu entertain peopl eager cast agent role order find effect gener present role affect person presenc presenc project lifelik charact virtual accompani guid visitor dfki fig intend explor hypothesi explicit affect model agent guid present strategi dialogu creat natur intuit user interfac tailor individu provid user engag enhanc believ virtual charact presenc project address research flexibl integr multipl input fig presenc prototyp keyboard output video develop descript languag charact base person trait easi combin comput model person emot plan techniqu guid interact lifelik charact present materi visitor local remot world wide explor possibl tailor interact individu user infer affect state project basic psycholog model person differ type implement strategi adopt reflect requir respect applic domain puppet inhabit market explicitli hand code person style affect present plan deal emot structur emot gener rule explicitli connect dialogu act relev anim sequenc utter templat current intern state charact addit constraint behaviour select mechan approach similar lester colleagu pedagog speech act drive select sequenc emot behaviour rapidli prototyp advantag domain approach applic address gener highli stereotyp pattern simpler emot type puppet send clear reproduc affect signal children plai system made consciou separ affect model process gener present plan process maintain fairli model affect state number dialogu topic applic domain produc engag varieti output stage detail descript inhabit market place inform puppet presenc refer andré appli artifici intellig special doubl issu anim interfac vol emploi ai method control behavior anim interfac agent appli artifici intellig van autom design believ dialogu anim present team cassel al embodi mit integr model person emot lifelik charact affect argument basic ed basic lawrenc erlbaum affect process model emot system phd northwestern institut learn scienc tech report languag person gile wp robinson handbook languag social psycholog england john wilei son pe individu differ nonverb dimens style journal person social van agent marina del usa deal view evalu system proc spring dai workshop behavior plan lifelik charact avatar spain deictic emot commun anim pedagog agent cassel al embodi mit believ charact stori creation workshop anim pedagog le franc introduct model applic special issu applic journal person cognit structur emot cambridg press proc workshop affect interact gener held conjunct annual itali believ social emot agent phd thesi technic report school comput carnegi mellon pa extern graphic intern journal kr person marker speech kr gile social marker cambridg pp motiv emot control cognit reprint model yale page proc agent workshop emot wa
DB/99 3 offer tradeoff aggreg queri replic data chri jennif widom stanford abstract strict consist replic data requir distribut current system permit stale cach copi data valu date queri cach data return answer stale answer queri remot master data return potenti poor perform bridg gap class replic system call replic system give user control tradeoff cach store rang bound current data store stale exact valu user suppli quantit constraint queri answer system automat select combin local cach bound exact master data store remot deliv bound answer consist rang wider comput quickli paper defin architectur replic system cover mechan cach data rang queri present optim algorithm answer queri report perform experi demonstr control tradeoff offer system introduct environ replic inform multipl site permit stale enforc exact consist multipl copi data exact consist perform perspect larg varieti reason outlin distribut applic exact consist simpli requir web gener stale replic master copi page maintain web server stale copi cach web browser web read stale cach data browser significantli perform retriev master copi web server press browser cach copi arbitrarili date stale replic system data view data object oper master data multipl stale cach copi queri cach data typic faster queri master copi oper site work support nation scienc foundat grant nasa grant nation scienc foundat graduat research fellowship run scenario motiv exampl simpl replic system monitor network link thousand comput assum node network track averag traffic level incom network link node administr monitor station analyz statu network collect data period network node link monitor station cach latest traffic level figur obtain node administr queri bottleneck bandwidth path total latenc path averag traffic level minimum traffic level fast link link high bandwidth low link high averag latenc link high administr obtain current answer kind collect data valu relev node time queri pose long affect system requir node constantli send updat valu monitor gener unnecessari paper develop approach replic queri process user control tradeoff answer high perform traffic level figur monitor cach exact node send updat exact move cach rang queri execut cach rang return rang current exact answer administr pose provid constraint indic wide rang toler answer administr sampl peak latenc period critic order decid monei invest upgrad network make administr peak latenc obtain answer millisecond system automat combin cach rang valu retriev node order answer queri quickli tradeoff stale replic system potenti offer user mode queri call queri sourc answer potenti poor perform call queri execut cach data answer quickli answer user left guess perform cach data sourc data current replic system perform combin cach sourc data system figur tradeoff base knowledg data stabil recent cach updat figur illustr tradeoff extrem queri mode discrep extrem point figur lead answer obtain mode obtain place heavi load system lead unaccept delai applic requir level extrem point run administr pose queri quantit constraint find middl ground sacrif sacrif perform address kind replic call replic support monoton tradeoff figur queri accompani custom system answer queri combin cach sourc data optim perform meet constraint extrem point system correspond queri mode defin overview approach addit introduc paper focu specif replic system call queri aggreg numer data convent answer queri outermost aggreg oper singl real defin bound answer call bound pair real valu la ha defin rang ha answer lie quantifi width rang la exact repres unbound constraint constant denot maximum accept rang ha la give bound ha queri requir cooper data sourc cach sourc refresh cach data object current exact sourc send rang call bound cover gener case bound function sourc link latenc bandwidth traffic refresh weight cach cach cach cost figur sampl data network monitor actual stai exce bound sourc immedi send refresh cach store bound data object exact cach assur current master bound cach answer bound valu store comput express term bound small tabl figur show sampl data cach network monitor station section current valu network node weight row figur correspond network link link node link node recal master valu traffic incom link measur store link node monitor station store bound traffic cach bound valu comput bound answer queri bound answer queri aggreg comput cach answer satisfi user answer bound wide data refresh sourc improv assum quantit cost refresh data object cost vari data item base node distanc network path show sampl refresh cost figur system optim algorithm attempt find combin cach bound master valu answer order minim cost refresh constraint offer continu relax constraint queri enabl system reli cach improv perform queri tighten constraint system reli master degrad perform yield answer contribut specif contribut paper defin architectur replic offer user control tradeoff method determin bound comput standard relat aggreg function bound data queri select join present algorithm find set tupl refresh order answer aggreg queri select predic discuss optim algorithm analyz complex case exponenti suggest approxim implement algorithm present initi perform result relat work larg bodi work dedic system improv queri perform give approxim answer earli work area report system precomput sampl give answer statist estim scan input data system scan data bound exact provid statist result previou work similar idea move object system replic scheme cach valu permit deviat master valu bound amount unlik system answer queri combin cach master user control tradeoff bound data object set independ constraint bound set static system administr move object bound set maxim singl metric combin elimin user control tradeoff system support aggreg queri demarc protocol techniqu maintain arithmet constraint distribut system system relat work bound data form arithmet constraint demarc protocol design modifi arithmet constraint system updat bound demarc protocol deal queri bound data aggreg queri select approxim approach produc bound answer time permit select predic evalu tupl approxim deal queri bound data work deal queri fuzzi set bound valu consid infinit fuzzi practic approach fuzzi set approxim exact valu cost relat data model data object undergo lossi compress reduc size read compress version data object full system quickli produc approxim answer queri system perform improv reduc number data object read remot reduc size data diverg cach bound number updat permit master copi data object cach bound data valu bodi work deal inform system inform qualiti iq system quantifi accuraci data granular entir data server bound individu data queri concret knowledg individu data valu form bound answer iq system give bound answer queri data object valu rang consid special case constrain valu constraint null variabl local condit incomplet inform work area consid constrain valu bound approxim exact valu store aggreg queri set uncertain membership due select condit bound consid system architectur architectur system illustr figur data sourc maintain exact data object data cach store bound exact valu sourc valu multipl cach possibl cach bound valu multipl sourc user submit queri queri processor local data constraint answer queri queri processor send refresh request refresh monitor respond bound refresh monitor sourc track bound data object relev cach network monitor applic sourc track small number bound applic sourc provid larg number object multipl case scalabl trigger system great benefit refresh monitor detect data object exce bound send bound cach cach bound data object refresh cost incur gener case object cost practic cost refresh object depend sourc amort refresh cost set discuss section cost algorithm tupl refresh order meet constraint queri minimum cost architectur present paper make simplifi assumpt object insert delet occur regular basi insert delet handl propag immedi cach discuss limit level offer system account time send refresh messag process singl queri assum time refresh bound small introduc refresh monitor user constraint queri queri processor data cach bound sourc data answer refresh request refresh figur system architectur assum refresh occur time individu queri process address issu topic futur work discuss section section discuss detail mechan bound valu refresh section gener bound function function section discuss execut aggreg queri present specif optim algorithm aggreg queri section section present preliminari result aggreg queri join refresh cach bound master copi data object resid singl assum singl real denot cach store rang valu data denot sourc send copi data object cach refresh event time addit send current denot send bound discuss refresh occur reason master data object exce bound store cach current time sourc oblig refresh cach current bound refresh refresh occur queri execut cach requir current exact data object order meet constraint sourc send bound queri bound function time section present simpl approach bound data object pair endpoint gener accur approach bound endpoint bound function time function properti refresh initi initi time figur bound overlaid refresh time bound time refresh width endpoint equal current time advanc past endpoint bound diverg bound time refresh sourc send pair bound function cach replac pair figur illustr bound data object overlaid subsequ algorithm result paper independ bound select bodi paper assum bound function evalu current time write write exact current preliminari work investig bound deduc absenc addit inform updat function expand time time recent refresh determin width chosen interest reader refer appendix detail queri execut bound answer execut queri constraint involv combin data store remot sourc bound data store local cach section describ gener bound aggreg queri present cost model algorithm cach data object refresh answer queri remaind paper assum relat implement data model support aggreg numer valu queri form join address section select predic aggreg standard relat aggreg avg predic predic involv column tabl possibl constant nonneg real constant requir bound answer ha queri satisfi ha la omit implicitli comput bound answer queri execut comput initi bound answer base current cach bound determin constraint met algorithm refresh examin cach copi tabl subset tupl tr refresh sourc tupl tr refresh cach copi tupl refresh recomput bound answer base cach partial refresh copi refresh algorithm ensur answer step satisfi constraint section present detail base specif aggreg queri select predic type aggreg queri address comput bound answer base current cach bound problem correspond step set tupl refresh problem correspond step refresh algorithm optim find cheapest subset tr tupl refresh subset total final answer queri satisfi constraint valu refresh tupl current bound assum cost refresh set tupl sum cost refresh member order optim problem manag simplif ignor amort due batch multipl request sourc recal assum separ refresh cost assign practic tupl sourc incur cost note entir set tr tupl refresh select refresh constraint valu tupl tr approach refresh tupl time sourc comput bound answer refresh stop answer section discuss aggreg select predic section specifi comput bound answer bound data valu type aggreg describ algorithm select refresh set aggreg function assum select predic queri involv column exact valu section assum select predic appli aggreg comput tupl satisfi predic queri select predic involv column bound valu cover section join involv bound valu discuss section comput aggreg column ta cach tabl ta tupl store cach bound comput queri processor option tupl read cach bound refresh obtain master cost refresh final answer aggreg bound ha comput min select predic comput bound min ta ha min lowest minimum occur bottom bound highest minimum occur tupl return section find minimum bandwidth link path queri appli bound min bandwidth tupl figur yield optim set tupl refresh min queri constraint algorithm justif proof optim nontrivi appendix refresh algorithm tr tupl min independ refresh cost tr tupl lower bound minimum upper bound minu constraint index exist upper lower set tr found time index upper bound find min index lower bound find tupl satisfi min run time refresh queri find minimum bandwidth path refresh refresh tupl tupl low min tupl bandwidth turn bound answer max aggreg function symmetr min appendix detail subsequ defin section briefli discuss index rang problem activ work comput sum select predic comput bound sum sum valu ha smallest sum occur valu low largest sum occur valu high run bound sum latenc path data figur problem select optim set tr tupl refresh sum queri constraint attack problem select tupl tr tr observ ha la refresh tupl tr valu contribut bound equal combin constraint ha la give constraint optim object satisfi constraint minim total cost tupl tr observ minim total cost tupl tr maxim total cost tupl tr optim problem formul tr maxim constraint turn problem isomorph knapsack problem state set item weight profit knapsack capac hold set item long total weight goal knapsack problem subset sk item place knapsack maxim total profit knapsack capac sk maxim constraint state problem select refresh tupl bound sum queri knapsack assign sk tr knapsack problem approach solv problem dynam exponenti run time approxim algorithm exist polynomi find solut total profit fraction optim run time algorithm log algorithm refresh adjust paramet algorithm trade run time algorithm qualiti solut special case uniform cost tupl knapsack object profit knapsack problem polynomi algorithm optim answer found object order weight knapsack hold object add tupl tr start smallest bound tupl index exist bound width section algorithm run sublinear time index bound run time algorithm log refresh time total refresh cost approxim paramet total cost figur refresh time refresh cost vari queri total latenc path figur show correspond problem knapsack problem knapsack latenc column tupl exponenti knapsack algorithm find total latenc path tupl capac leav tr bound sum latenc refresh tupl perform experi refresh approxim algorithm quickli find cheap set tupl tr refresh constraint hold implement algorithm ran experi actual stock price vari highli dai high low valu dai bound close refresh cost data object set random number run time measur sun model run suno figur fix constraint vari knapsack approxim order plot refresh time total refresh cost select tupl smaller valu refresh time refresh cost refresh time quadrat refresh cost small gener advantag set close refresh extrem figur fix approxim paramet vari order plot constraint versu perform refresh refresh algorithm concret instanti figur show monoton tradeoff perform system sum valu constraint figur tradeoff refresh comput count select predic select predic comput count amount comput cardin tabl requir insert delet propag immedi data cach cardin cach copi tabl equal cardin master refresh comput avg select predic select predic procedur comput avg aggreg comput count discuss section simpli cardin cach comput bound sum section count produc sum ha count count bound width ha la count comput sum count ha la constraint satisfi run time domin run time refresh section queri section comput averag traffic level entir constraint comput count comput sum count column label figur show knapsack weight assign tupl base cach bound traffic optim knapsack sum comput tupl result bound sum divid count bound avg latenc refresh refresh refresh refresh refresh refresh figur classif tupl select predic modif incorpor select predic select predic involv bound valu present comput bound aggreg result refresh tupl meet constraint complic section present modif algorithm section handl aggreg queri select predic begin introduc techniqu common queri aggreg function present select predic involv column bound valu system partit disjoint tupl possibl satisfi predic current bound data tupl satisfi predic current bound data tupl mean exist valu current bound predic valu predic satisfi process classifi tupl select predic involv column bound valu detail appendix interest aspect filter find tupl express simpl predic bound algorithm comput bound answer tupl refresh examin tupl classif express sql queri optim possibl incorpor special index discuss section exampl remaind section refer figur show classif predic data figur exact valu refresh comput min select predic select predic bound min answer ha min min la tupl satisfi predic turn smallest lower bound tupl satisfi predic form lower bound answer ha tupl satisfi predic turn smallest upper bound tupl satisfi predic form upper bound answer run queri find minimum traffic result data figur classif figur tr tupl min algorithm essenti refresh correct optim reason appendix addit case refresh tupl move tupl contribut actual affect bound answer ha constraint hold refresh run time sublinear index upper lower bound run time queri constraint tr tupl pass select predic low valu min tupl turn pass select bound min max aggreg function symmetr min appendix detail comput sum select predic comput sum presenc select ha la occur tupl neg valu satisfi select predic contribut result ha occur tupl posit valu satisfi predic algorithm similar refresh map problem knapsack problem modif requir ignor tupl tupl set valu idea effect extend bound tupl includ tupl contribut sum contribut knapsack extend bound adjust weight comput count select predic bound answer count aggreg function presenc select predic ha queri section number link latenc figur show classif tupl bound count algorithm base fact ha la refresh tupl remov optim algorithm tr cheapest tupl index algorithm run sublinear time run time requir sort log queri select tr cheapest tupl updat tupl turn bound count comput avg select predic comput bound answer comput bound avg predic present complic comput aggreg count bound longer simpl matter divid endpoint sum bound exact count section comput lower bound start comput averag low endpoint averag low endpoint bound time order point averag comput upper bound avg queri section averag latenc link comput lower start averag low endpoint tupl averag low endpoint tupl obtain lower bound averag latenc stop point averag tupl lower bound appendix formal run time log looser bound avg comput linear time comput sum sum count count algorithm section ha sum count linear algorithm yield notic bound looser bound achiev algorithm tupl refresh complic scenario detail provid appendix give descript algorithm fact bound avg achiev function bound sum linear algorithm section refresh tupl provid bound sum count bound avg function bound sum count meet constraint interact accomplish modifi version algorithm understand choic refresh tupl sum affect bound count algorithm set constraint sum account chang bound count constraint avg met preserv knapsack problem structur refresh tupl avg accomplish solv knapsack complex refresh section queri set knapsack capac assign weight tupl shown column label figur knapsack optim tupl refresh tupl tr bound avg aggreg queri join comput bound answer aggreg queri join express multipl tabl select sql join express select predic compar column tabl method determin membership tupl appli join predic select predic classif express sql queri optim system standard join possibl incorpor special index discuss section tupl refresh significantli difficult presenc join tupl contribut refresh subset base tupl subset shrink answer bound depend affect classif combin effect aggreg column base tupl potenti contribut multipl aggreg refresh base tupl aggreg tupl affect aggreg tupl interact make problem complex consid heurist algorithm tupl refresh join queri investig exact complex problem hope find approxim algorithm tunabl approxim algorithm statu futur work implement bound aggreg function refresh algorithm present implement cooper discuss section underwai addit test algorithm realist plan studi choic bound width appendix affect refresh plan investig altern method bound function paper repres initi work replic numer avenu futur work divid futur direct addit function tupl refresh improv perform avail issu addit function expand class aggreg queri algorithm aggreg median preliminari result extend result handl group bound enabl count uniqu queri handl nest aggreg function requir understand bound result aggreg affect outer aggreg aggreg queri idea expand encompass type relat queri constraint run find lowest latenc path network node node constraint requir answer return latenc select distanc answer user express rel absolut constraint rel constraint express constant denot absolut constraint actual answer difficulti advanc base bound deriv pass cach data find conserv absolut constraint algorithm redesign algorithm perform rel bound probabilist system defin paper improv perform provid bound offer absolut discuss section approach improv perform give probabilist interest direct combin provid bound answer probabilist appli idea replic data object resid sourc hierarchi data cach refresh occur cach cach sourc level cascad effect current scenario web cach system inktomi traffic server resid web server web browser extend data visual techniqu advantag investig wai extend data visual system displai imag base bound data draw fuzzi region uncertainti visual set model continu queri constraint formul visual domain tupl refresh adapt refresh algorithm refresh batch account multipl refresh cost sum individu cost adapt refresh algorithm account case refresh tupl reduc cost refresh tupl adapt develop refresh algorithm queri involv join express refresh tupl group join reduc subsequ cost join iter refresh algorithm set tupl advanc adequ actual exact refresh tupl iter constraint met addit develop altern suit interest investig context iter method prefer batch method present paper iter method give bound aggreg queri behavior user present bound answer gradual refin time goal shrink answer bound fast improv perform delai propag insert delet data cach investig wai discrep number tupl comput bound answer queri account bound discrep sourc longer forc send refresh time object insert delet investig special bound function suitabl updat pattern properti bound function shape suggest paper base assumpt inform updat pattern wai amort refresh cost refresh piggyback refresh sourc extra refresh request extra refresh consist valu refresh close edg bound amount refresh piggyback perform depend benefit versu ad overhead benefici perform send unnecessari refresh system load low futur process investig queri process issu bound valu design evalu scheme index bound function time discuss section plan weigh advantag function bound versu potenti index improv bound constant plan studi wai cach data object store pair bound function compress cach store valu data object sourc transmit valu tupl refresh refresh monitor sourc track bound function remot cach data object compress issu address affect techniqu present refresh algorithm independ bound function queri process issu consist issu handl refresh delai network refresh delai time master exce cach bound time cach refresh cach bound short period time avoid problem close edg bound evalu concurr control solut refresh permit occur refresh comput queri evalu answer reflect inconsist data fail satisfi constraint solut implement concurr control permit refresh occur queri read data current queri start acknowledg hector rajeev discuss joe hellerstein anonym comment initi draft marti discuss network monitor refer effici data share inform retriev system intern confer extend page march grahn queri set world acm sigmod intern confer manag page san barbara demarc techniqu maintain linear arithmet constraint distribut system intern confer extend page march goodman concurr control recoveri system queri constraint object acm sigmod intern confer manag page san libkin exact approxim aggreg constraint queri languag acm symposium principl page constraint objectori system acm sigmod intern confer manag page june rivest introduct algorithm mit widom comput median uncertainti acm symposium theori shasha danger replic solut acm sigmod intern confer manag page june garei johnson comput guid theori freeman concret foundat comput scienc gibbon summari statist improv approxim queri answer acm sigmod intern confer manag page june haa interact data analysi control ieee august scalabl trigger process intern confer data page march hellerstein haa onlin aggreg acm sigmod intern confer manag page wolfson diverg cach architectur intern confer parallel distribut inform page septemb kim fast approxim algorithm knapsack sum subset problem journal octob inktomi inktomi traffic aggreg approxim queri process page april revesz constraint queri languag acm symposium principl page april kuper aggreg constraint workshop principl practic constraint rhode april jr semant issu connect incomplet inform acm transact septemb comput base manag inform system embodi answer accuraci user paramet phd uc berkelei comput scienc freytag integr heterogen inform system intern confer larg data septemb stonebrak acm sigmod intern confer manag page june poosala fast approxim queri answer precomput statist ieee intern confer data page march rundenstein bic aggreg possibilist fifteenth intern confer larg data page august silberschatz relat data model eighteenth intern confer larg data page august jiang move object issu solut tenth intern confer scientif statist page juli good bound function return issu allud section briefli discuss good bound function select make problem good bound function separ shape bound determin static call width paramet bound data sourc assum monoton function time data object lower bound upper bound width paramet chosen algorithm problem face task select function algorithm width notic repres pair bound function ad benefit encod current width paramet transmit sourc cach refresh time cach comput time refresh delai sourc transmit refresh time clock synchron neglig threshold term function absenc inform model chang data object random walk dimens model natur common set updat tend small increment decrement current random walk model constant amount time step probabl distribut binomi distribut varianc inequ upper bound probabl distanc start fix probabl unit start point function time bound probabl proport vari tight bound approxim shape function shape bound function bound function form curv figur illustr function vari width sketch dynam algorithm bound width paramet attempt minim number refresh avoid refresh updat master bound wide make exce bound avoid refresh constraint bound narrow chanc type refresh chanc obviou bound width minim total probabl refresh requir factor affect choic bound variat data valu make result function neg deriv note randomli vari move step function rapidli grow continu move function dramat requir user queri difficult adapt algorithm adjust condit chang strategi start time refresh occur signal bound send bound time refresh occur signal bound strategi find middl ground wide bound exce exceedingli narrow bound refresh constantli fluctuat futur plan refin detail suggest techniqu perform experi determin eventu balanc conflict requir queri updat plan bound function case updat pattern conform random walk model proof correct refresh recal section refresh algorithm tr tupl min constraint show choic tr correct show tupl tr solut suffici constraint show tupl tr solut tr refresh tupl refresh tupl result upper bound answer ha la ha min min definit tr min ha la constraint hold tupl tr solut constraint hold show tr suffici constraint min tr note tr min min tupl tr min ha refresh tupl tr bound width case occur tupl tr refresh valu equal comput exact minimum valu greater la ha ha la comput max comput max select predic max aggreg function symmetr min ha max refresh algorithm tr tupl max comput max select predic max aggreg function symmetr min ha max max algorithm tr tupl max classifi tupl select predic algorithm section requir classifi tupl belong predic user assum arbitrari boolean express involv binari comparison defin transform predic transform yield express find tupl possibl satisfi predic base bound valu transform yield express find tupl satisfi predic base bound valu appli find tupl find tupl tupl predic evalu tupl tabl express term attribut valu endpoint min attribut valu rang handl express assum valu case constant attribut min max min max figur set translat boolean express translat rule appli queri select predic obtain note disjunct conjunct implic translat classifi tupl translat classifi tupl case misclassifi tupl extrem unusu involv special case correl note misclassif affect optim correct algorithm illustr rule figur deriv express term rang endpoint predic min max max min column label figur show result classif tupl data figur turn techniqu part gener mathemat framework introduc evalu predic data object set valu infinit set express min max min max min max max min min max min max min max min max min max max min min max min max min max max min figur translat rang comparison express point rang relationship translat notat paper notat select predic influenc evalu section inform select predic classif tupl slight refin made select predic column aggreg special tupl restrict actual select addit bound bound addit restrict predic contribut result advantag addit bound tupl shrunk input result comput refresh algorithm aggreg latenc predic latenc modifi lower bound comput tight bound avg select predic comput tight bound avg select predic section proce sl kl sum cardin low valu repres tupl sort order element sl kl add sl kl advanc continu process sl kl sh kh repres tupl sort order element sh kh add sh kh advanc continu process sh kh ha sl kl sh kh queri section averag latenc link classifi tupl shown figur initi sl kl tupl sort order refin appli select predic restrict aggreg column predic ta tb restrict column ta sl kl set sl sl kl kl sl kl set sl sl kl kl note sl kl stop sl kl comput sh kh proce similarli yield sh kh result give bound avg sl kl sh kh algorithm comput tight bound avg run time log refresh tupl avg select predic refer section note make bound avg section constraint ha la satisfi ha desir find refresh algorithm constraint satisfi exact bound ha sl kl sh kh appendix find algorithm set tupl tr refresh tupl tr comput sum count make bound sum count formul function base set tupl tr refresh valu constraint met relationship sum count rh show case case rh case rh case sum rh case rh sum sum sum sum count case rh rh impli case rh rh impli case rh rh sum bound impli goal express function elimin valu substitut conserv estim valu conserv estim valu obtain comput sum count current cach bound sum sum count count refresh bound shrink sum sum count examin inequ relat sum count substitut sum sum count make side strictli upper bound substitut result sum sum sum sum count count final upper bound function sum sum count comput substitut function constraint recal constraint requir substitut formul constraint term rewrit constraint term count sum sum sum sum count formul constraint place origin constraint algorithm free valu satisfi reformul constraint reduc task refresh tupl avg task refresh tupl sum reformul constraint refresh tupl constraint constraint count sum sum sum sum count function count sum sum sum sum count refresh tupl sum function recal algorithm refresh tupl sum map knapsack knapsack capac make knapsack capac function modif make knapsack capac function constant make knapsack capac function fake recal equal number tupl refresh remain refresh recal set item knapsack correspond tr set tupl refresh equal number tupl knapsack knapsack initi knapsack capac count time tupl ad function line sum sum sum sum count capac knapsack amount time tupl ad knapsack observ knapsack capac item ad weight item simul shrink knapsack time add quantiti weight tupl algorithm algorithm map knapsack count tupl sum sum sum sum count valu sum sum count found comput sum count current cach bound sum sum count count run time domin run time section revisit section queri averag latenc link classifi tupl shown figur comput sum sum count count valu assign weight tupl comput weight tupl ad sum sum sum sum count column label figur show weight knapsack problem count knapsack optim tupl refresh tupl tr bound avg
HCI/100 4 room metaphor transit groupwar saul greenberg mark roseman research report depart comput calgari canada cite greenberg room metaphor transit groupwar research report depart comput januari room metaphor transit groupwar saul greenberg mark roseman depart comput scienc softwar calgari discoveri place alberta canada street nw alberta canada abstract groupwar system gap hinder block natur social interact peopl easili move style work adopt room metaphor transit work natur workplac system show gap remov transit singl user groupwar applic make room suitabl individu group activ peopl move asynchron synchron work room artifact persist peopl leav document annot work occupi room time difficulti initi real time work provid peopl awar automat establish connect user enter common room discuss technic space transform social place describ group craft mean room categori subject descriptor tool design commun conferenc multimedia inform group organ model keyword comput support cooper human comput interact saul greenberg lead develop research foundat lead mark roseman chief design architect workplac room metaphor transit groupwar saul greenberg mark roseman introduct gap groupwar typolog group support system technolog bridg time space typolog appli groupwar johansen subsequ propag introduct cscw nunamak al shneiderman abowd beal baecker preec buxton greenberg tabl show typic matrix quadrant time time place face face interact confer tabl comput public displai dedic tool vote brainstorm place distribut real time interact chat system transpar share singl user applic groupwar video conferenc media space ongo task team room group displai shift work groupwar project manag commun coordin unstructur semistructur electron mail electron bulletin board asynchron conferenc list server workflow system schedul collabor hypertext tabl typic matrix grudin buxton greenberg author extend typolog includ dimens buxton greenberg differ group size multipl individu versu group site al time place predict unpredict particip inform versu formal encount refin time distinguish access system concurr distinguish share term object chunk size frequenc updat abowd beal problem classifi cscw issu reflect wai peopl work practic real peopl move continu style groupwar technolog design handl limit collabor activ situat singl cell exampl tabl peopl move style switch groupwar applic introduc barrier gap normal collabor pattern gap defin physic perceptu boundari groupwar distract particip work block cross room metaphor transit groupwar saul greenberg mark roseman function boundari inher collabor work grudin move peopl make fairli disrupt transit softwar decid person cost great groupwar support gap identifi literatur gap individu share peopl difficulti move work artifact person work area work area grudin baecker chapter technolog gap exist group convent softwar groupwar chapter group work heterogen comput environ gap synchron asynchron time time interact chapter gap phase collabor peopl move work movement peopl move meet actual meet cleanup hayn greenberg gap desir collabor establish groupwar session greenberg gap place part group meet coloc singl part rest offic al baecker chapter gap inform formal activ al preec gap comput desktop physic artifact tool paper document electron artifact tool paint goal modern groupwar research defin mitig unnecessari obstruct perceptu gap grudin similar view express author assert gap bridg groupwar effect chapter call groupwar buxton greenberg argu groupwar system support room metaphor wide rang collabor style singl environ report afford room metaphor impli function mitig remov technic suppli user conceptu model reduc perceptu transit peopl make move style collabor overview paper begin briefli list basic featur room metaphor afford individu collabor work rest workplac system case studi groupwar system design room metaphor section introduc technic featur user interfac section introduc discuss room metaphor realiz workplac transit gap section show room equal suitabl support individu group work transit individu group activ function room number peopl room section show make room artifact persist peopl move synchron asynchron work peopl leav artifact annot work occupi room time illustr show peopl move post meet process formal meet section show room difficulti establish real time connect provid awar real time automat make connect boundari term author express similar concept similar list baecker chapter futur groupwar cscw room metaphor transit groupwar saul greenberg mark roseman enter common room section discuss technic space social place peopl craft mean room paper close review relat work featur inher room metaphor craft physic space peopl field urban plan architectur alexand craft virtual space studi human comput interact henderson jr card kuhn harrison dourish reynard greenhalgh extend work develop list featur suggest room metaphor concentr featur afford individu collabor implic design electron room room metaphor type spatial model featur afford natur provid peopl good collabor opportun kuhn room analog physic room team organ room typic includ olson person share room schedul expect room return state room confer dedic project open offic team share space peopl work leav artifact work team dedic project room similar team member offic war public space social interact casual work common featur section summar column tabl properti inher physic room room bound act item room spatial peopl inhabit collect room section describ featur repres summar rightmost column tabl room bound space properti room bound afford featur wall partit larg space collect room distanc barrier room separ bring peopl artifact dourish individu room act tool work commun overhead artifact support individu group activ room peopl enter leav item brought remov peopl door open window room room afford featur persist custom object left room persist time peopl place store object peopl leav expect object remain spot enter interim persist peopl custom room bring artifact manipul artifact room room custom ownership privaci olson studi cognit artifact dedic project room notic room flip chart item tape wall act share visual displai displai work current statu refer materi room metaphor transit groupwar saul greenberg mark roseman featur descript support bound space partit room collect bound separ wall room artifact peopl enter leav insid door bring thing persist object left room persist time spatial locat custom privaci ownership spatial locat spatial relat proxim action common refer orient peopl custom room bring artifact arrang space room custom ownership object organ room person spatial relat collabor interpret action close object space peopl refer inhabit similar orient reciproc collabor action object space partit set discret individu present larg window individu peopl object room time room gener tool commun work share whiteboard draw creat room number applet instanc artifact creat peopl navig room doorwai room room peopl room level activ peopl room enter peopl copi item room room current state persist server shut turn includ mark applet content privaci peopl chat text type room peopl custom room creat mark ad applet set access applet custom persist time room owner access control set explicitli door state set public privat room applet room close posit persist move mark whiteboard situat applet posit whiteboard applet content telepoint radar overview room ident peopl peopl room peopl portion small radar overview prove view entir room peopl part object fine grain action immedi displai tabl featur physic room support workplac room metaphor transit groupwar saul greenberg mark roseman featur descript support inhabit space presenc awar presenc activ navig room glanc doorwai encount meet initi encount peopl navig enter room habit room inhabit real time meet definit asynchron definit empti meet occur peopl room asynchron collabor occur peopl leav thing room window show peopl present room window show list peopl peopl send messag peopl window mention enter automat initi commun channel physic room popul number peopl time physic meet occur peopl room commun channel automat peopl collabor item room physic asynchron collabor occur person leav note artifact room item enter room tabl featur physic room support workplac spatial locat object room properti room object occupi spatial locat afford featur spatial proxim common refer reciproc spatial relat item room spatial locat rel peopl organ room rank object olson notic softwar develop flip chart sheet dedic work room move cluster sheet time sheet side side peopl similar softwar requir shown team collabor whiteboard tabl top relat text graphic cluster de mich mention physic arrang work space make histor spatial context project visibl collabor proxim action interpret activ close peopl object space dourish object fix common peopl room common refer orient object space dourish reynard greenhalgh tang refer inhabit similar orient collabor expect reciproc action object dourish essenc object arrang room part share visual displai olson common orient reciproc displai depend peopl direct attent gutwin room inhabit collect final properti room inhabit peopl combin afford featur presenc encount room inhabit defin real time meet limit form asynchron interact peopl inhabit collect room show presenc awar habit mean individu present presenc activ move room glanc peopl meet initi encount room metaphor transit groupwar saul greenberg mark roseman navig enter room peopl kuhn room inhabit empti size layout room restrict peopl accommod peopl space defin type interact real time meet defin peopl inhabit commun collabor asynchron collabor occur peopl leav thing peopl inhabit space futur physic room featur impli peopl individu collabor activ featur common realiz groupwar system support featur collabor opportun suggest awkward manner suggest reader offer typic system base notion share whiteboard offer groupwar base room metaphor system present section case studi remaind paper workplac workplac commerci internet groupwar product base room metaphor origin base research prototyp call develop calgari previou provid overview greenberg implement detail roseman greenberg produc video demonstr interfac greenberg influenc earlier work develop groupwar toolkit greenberg featur user interfac workplac paper reflect earli version earli similar prototyp version web differ significantli version present briefli describ interfac featur workplac show user start creat room enter exist room standard groupwar tool room share give overview provid specif support activ defer exampl situat subsequ section tabl summar featur room list section support figur illustr main compon user interfac larg window bottom figur show user share room call user bottom window figur show room user part room top window figur show window setup server network maintain set room commun administr set membership commun user connect server administr defin assign access control room start tradit login user connect client server maintain set room commun default screen similar shown figur busi card detail content room describ user navig creat enter room figur displai window list room commun user enter room select list primarili list displai user room adam carl room door icon primarili social room metaphor transit groupwar saul greenberg mark roseman figur workplac user show room window room metaphor user transit carl groupwar saul greenberg mark roseman figur user view scroll posit window illustr room metaphor transit groupwar saul greenberg mark roseman open door suggest public close door suggest privat room icon reflect system access lock door prevent user enter room creat room user creat room command room room commun chang delet room creator limit action specif subgroup user user window list peopl connect room user work figur peopl log imag pictur provid user version pictur replac video snapshot time minut seek inform user inform user found imag select window displai window includ phone fax email person home page physic locat standard commun featur room custom suit specif group gener facil provid wide rang group activ page user send messag log select window dialog user short messag messag window displai chat simpl chat tool provid user type messag room digit audio video conferenc provid excel complement system requir accommod user hardwar bandwidth share whiteboard share whiteboard occupi room user select color pen pen trai produc draw figur add text shown label room awar featur facil maintain awar team member room facil provid gener awar finegrain awar action room greenberg room user room displai list user current shown figur local user shown imag figur differ user list show idl time long person activ room type move telepoint workspac gestur provid awar action user telepoint person color telepoint user list room overview radar room larger fit singl radar view styliz miniatur overview entir room radar show locat applet posit miniatur telepoint show locat cursor user move room manipul radar track action user scroll independ part room shown figur small part radar person track applet facil provid fairli gener support applet design specif group applet fact groupwar team member includ room select menu room manag softwar project applet task bug report pointer onlin version specif applet card onlin electron left room room metaphor transit groupwar saul greenberg mark roseman travel colleagu room illustr figur set displai annot applet demonstr shown figur applet frame similar fashion compon harkei edward user select applet tool list groupwar applic user delet applet immedi visibl user room applet add command global menu bar calendar menu label figur calendar applet support type applic construct greenberg includ text draw card meet applet fulli share updat simultan edit partial list applet includ provid appendix illustr figur group memori version histori state room applet version automat save user room user explicitli save snapshot user retriev earlier version user previou version complet state room replac earlier version previou applet instanc applet creat room hold earlier version user compar version review earlier stage project figur group file viewer applet view paper written group member version group retriev earlier version paper compar differ low common denomin technolog groupwar access entir requir modest technolog infrastructur work low bandwidth includ modem link run popular includ window flavor unix peopl commun platform collabor move descript workplac system support room metaphor transit groupwar transit individu group work everydai work style peopl shift regularli easili individu group impli softwar support style system categor groupwar forc switch introduc gap peopl move individu group activ applic offer explicit support peopl work comput peopl singl user system collabor effort time distanc barrier high groupwar built fit group inadequ support individu work gap categori mean peopl tool conceptu similar task cross individu group work grudin baecker chapter peopl addit workload shift learn tool translat common format amen singl groupwar system show gap categori lightweight transit singl group activ individu work reflex individu work form cooper work introduc room metaphor transit individu group theme revisit detail section room metaphor transit groupwar saul greenberg mark roseman individu work cooper work cockburn suggest cscw environ problemat dispar system person work cooper work argu reflex perspect cscw blur distinct person group claim individu behav wai resembl behaviour suggest cooper environ support group cater individu requir environ person familiar turn minim extra effort learn dedic groupwar tool reflex perspect cscw suggest individu work properti group individu adopt role work person manag person coordin schedul person activ futur creat leav remind worker person carri step activ project work environ physic work spread machin person spend time commun coordin futur peopl individu work room metaphor workplac reflex manner person room shown figur styliz actual room creat author room artifact creat person calendar person note remind creator urgent action room work review work room includ concept map interfac methodolog develop partial complet paper review room pointer object visibl room includ file titl upload download paper doorwai point room document relev current grant applic implement featur room metaphor make suitabl environ support person manag role worker custom spatial relationship persist natur room fact custom creat person context ownership owner enter item left multipl room mean peopl creat multipl context reflect person task switch quickli accomplish move room jr card card henderson jr mackinlai user tradit graphic environ context rememb relev open posit size screen move correct portion file relationship person manag activ work artifact made spatial proxim annot note remind owner camera readi copi paper report due tomorrow posit top list suggest urgenc close artifact refer paper paper review visibl person whiteboard draw line note posit doorwai room relev inform link relat item tradit system link person manag tool work artifact ti individu mean peopl access room platform unlik page world wide web access room artifact edit peopl make object access room upload room file person import microsoft word file download machin file view edit room metaphor transit groupwar saul greenberg mark roseman figur room support individu work person manag tool includ visibl readi hand work artifact artifact includ pointer work notion ownership spatial relationship inher room capabl facilit reflex cscw support person coordin access work artifact flow individu share work step room facilit peopl smoothli shift individu group theme explor detail subsequ section physic room occupi singl small group larg number peopl bring item individu leav work olson observ physic room afford easi transit individu group team member report individu work provid opportun interrupt notic import room determin room group individu space meet occur tabl real time meet simpli entri departur social convent room metaphor transit groupwar saul greenberg mark roseman room metaphor workplac similar physic counterpart system make technic distinct singl user group singl user groupwar applic artifact room room provid good person manag work space individu exact facil make good group manag work space room group space person enter person enter occupi room applet behav fulli function real time synchron collabor work pursu person enter occupi item left persist behav asynchron groupwar support group manag activ peopl make transit individu share work smoothli room make technic distinct individu group tool tool person manag work tool group manag group work real individu group determin space technolog section delv finer point transit individu share work section discuss peopl move asynchron synchron group work section describ room support casual common peopl move individu group work transit synchron asynchron collabor groupwar support synchron asynchron briefli review major style groupwar show room metaphor peopl move synchron asynchron illustr scenario blend asynchron synchron activ entir meet process groupwar synchron asynchron work major categori asynchron system peopl send messag electron group list server bulletin board sproull group member carri lengthi asynchron conferenc system maintain thread specif topic sproull negoti schedul activ group calendar manag worker coordin commit structur messag system object len lai fry coordin flore lotu team track activ workflow system organ post retriev document organiz memori hypertext system act organiz memori categori synchron system left support commun rang textual chat audio video phone recent advanc commun system cue transmit bodi gaze direct kobayashi grudin gestur gutwin roseman spatial relat particip system support collabor work artifact includ groupwar draw system hayn rada groupwar text editor posner live present busi meet tool brainstorm idea organ denni nunamak group switch asynchron synchron switch tool heavyweight transit applic found commun channel document creat asynchron tool email import groupwar applic share room permit asynchron synchron activ room metaphor offer simpl group move asynchron synchron work team member present room automat work synchron unlik groupwar applic requir peopl creat establish separ connect tool commun room act singl connect point room metaphor transit groupwar saul greenberg mark roseman act enter room immedi connect peopl commun chat work applet background peopl work room work asynchron leav thing room studi real project olson observ team leav coordin document action telephon vacat support type asynchron activ featur support reflex cscw persist work artifact annot left room review chang time spatial proxim link messag artifact remind comment left whiteboard written relev work object artifact work asynchron synchron work room object singl user user time team member work task share task artifact asynchron synchron transit asynchron synchron activ function peopl room function system constraint capabl transit singl user applic section room metaphor implement suppli basic framework asynchron synchron transit applet tool extend tightli integr synchron asynchron commun channel event room event calendar gener electron mail messag inform chang workflow commit track ti room actual work manag interest room metaphor extend capabl current asynchron system bulletin board applet synchron group examin thread evolv time project manag applet creat track project task peopl applet track discuss statu meet flow process section illustr scenario group blend asynchron synchron activ phase meet formal meet organ ahead time consist arrang formal exchang make deleg dub hayn jai style meet process cycl gener lead phase turn varieti detail dub hayn illustr tabl unrel describ meet scenario close match phase groupwar system typic support singl phase activ meet process schedul schedul peopl resourc part process email support particip post meet groupwar singl tool support task process phase exist groupwar gap inhibit peopl move synchron asynchron phase meet process room conjunct transit gap scenario inspir real life situat saul judi technic track adam jeremi confer chair saul charg set meet team figur illustr saul configur room part process saul begin creat room call meet goal potenti note note agenda point time subsequ meet calendar applet saul collect inform relev agenda item agenda item creat room call add relev inform doorwai room includ main meet arrow attach agenda item agenda item upload extern document acm room metaphor transit groupwar saul greenberg mark roseman set goal review previou meet understand statu ongo process describ meet goal establish meet particip develop potenti inform particip meet collect materi develop gather includ agenda circul background materi ahead time select book present tool process aid meet object review agenda tool select monitor activ conform meet constraint time follow process perform meet task requir record event requir summar meet determin step document creat distribut document commun commun step particip tabl phase activ formal meet dub retriev read ahead time agenda item includ url pointer call paper produc previou confer groupwar web browser includ call paper directli meet applet creat action item carri item ad quickli meet includ vote case prime question potenti agenda actual meet inform particip email leav note room meet applet conceiv extend automat inform peopl particip enter review inform add contribut prepar meet room figur show tool partial fill particip asynchron attend meet particip icon visibl room user list imag telepoint room particip work synchron review agenda move agenda inform brought room ahead time move room time work confer schedul tool inform brought support process task salient meet point easili insert note ad action item prepar tool particip review point action item summar meet phase state room part meet version system attach room applet peopl review evolut meet artifact particip room retrospect add document inform summar meet lead room medium group commun asynchron room metaphor transit groupwar saul greenberg mark roseman figur room configur formal meet part meet brought materi tool meet room metaphor portrai support formal meet process unlik group support system georg room meet process dictat agenda item relev inform brought room ahead action item record physic disciplin social structur team afford space creat formal meet room formal protocol encod softwar insist particip follow meet protocol scenario show peopl room move smoothli synchron asynchron activ meet artifact room support asynchron activ particip configur meet room ahead time inform leav messag add inform retrospect room metaphor transit groupwar saul greenberg mark roseman item room groupwar support conferenc person room particip meet room review bring tool support record item poster room persist room repositori meet artifact track evolv time transit awar work real time real peopl regularli serendipit encount encount opportun difficult gap electron knowledg establish groupwar session success team reli regular contact contact inform unplan root cockburn greenberg physic inform interact occur peopl bump happen wait printer resid project room occur peopl coordin action exchang inform request offer opportun peopl monitor progress learn thing olson bottleneck rich spontan interact distanc user wide area network disadvantag overcom distanc barrier mundan factor make contact comput peopl electron address machin peopl readi advanc remot conferenc video conferenc media peopl confer room media equip inform peopl find minim effort peopl select commun channel applic group technic site workstat support media digit special equip video poor network limit applic run human commun channel groupwar match task real time text accommod peopl asynchron peopl make groupwar matter room support real time encount room metaphor mitig transit enter groupwar confer room inhabit afford presenc meet includ featur minim technic compat mention peopl pursu singl user activ physic room individu group peopl real time encount olson reason groupwar session explicit meet interact peopl popul spatial local commun walk glanc public space peopl judg avail door busi varieti cue room metaphor provid similar presenc awar displai inhabit room electron statu inform person identifi commun encourag inform interact user idl indic period video snapshot user list shown window includ peopl log room metaphor transit groupwar saul greenberg mark roseman server reachabl room wander hall offic log peopl comput idl indic locat underneath imag long person keyboard short idl person reachabl longer idl time estim person activ work comput idl indic approxim differ offic door offic version period video snapshot provid peopl feel avail imag replac snapshot time minut inform peopl present modest bandwidth snapshot bring real room environ virtual serv function similar found porthol system bly cue decid avail presenc person physic door open interrupt person mimick peopl room person window door state set visibl window real wide partial open door icon accept bar door suggest room peopl inaccess special room set inform meet place site imag applet point popular daili comic strip popular afford encount establish contact person decid wai establish contact congruent room room subject norm social relat room peopl similar real room occup person enter room pictur start talk chat facil room expect lengthi meet carri room benefit audio text short sporad impract provid audio connect person initi enter page list displai note screen quickli answer invit person phone number found busi card phone call quickli establish made room person attract attent room comput ring bell plai sound comput person establish contact log person revert asynchron tool mention previou leav note room suggest meet time place work power room metaphor work context immedi tool room artifact readi tool easili ad back wall peopl augment time simpli draw artifact annot exist hayn rada style easi chat tool mean low applet room quickli focu door state serv mediat access room open door public close door privat room room metaphor transit groupwar saul greenberg mark roseman room replac rigid concept enforc groupwar system system session peopl creat meet attend meet social phenomenon creat group simpli room time serendipit encount simpl real serv illustr featur work hire student work laboratori month summer schedul part time natur laboratori supervisor chanc talk student greenberg room home dai notic awar facil student work room room activ felt free enter began social progress student discuss present work includ tour work contribut room work artifact back individu work separ room room metaphor afford opportunist illustr summar tabl social opportun meet circumst serendip intent plan peopl pursu individu awar awar tool person easili initi enter room found easi incorpor room context artifact discuss action initi transit real time interact singl click greenberg enter room transit technic space social place work room metaphor appli characterist physic space virtual space characterist space captur rich environ physic space adopt transform social place interact home famili live gener offic person occup hang pictur clutter desk occupi room project room group place pursu activ develop project artifact olson room metaphor serv basi form social place differ space place harrison dourish argu design featur physic space miss crucial aspect collabor space physic venu give opportun understand space turn social place place extend space includ social mean action cultur norm set cultur understand role plai peopl artifact inhabit space harrison dourish reason group forg place time member activ particip space object place social group deriv opportun afford space reynard greenhalgh defin space context navig share spatial frame refer cartesian place context local framework theori social world distinguish social place technic space social world group peopl common site mean commun local actual site group actual mean peopl actual mean work achiev team goal design softwar system form social world team met meet room definit provid tim person commun room metaphor transit groupwar saul greenberg mark roseman visual auditori paper form physic local team met groupwar system conjunct form virtual local virtual local realiz physic site mean social world collabor local framework summar kaplan local foundat defin collect peopl artifact relat central social world local social world consid collect part dynam continu evolv system local fluid place social mean map physic care structur physic space conflict dynam social structur mutual consid interact local maintain share place mutual includ inform peopl artifact make peopl maintain awar inform includ entiti transmit receiv entiti capabl creat level individu view multipl local acknowledg individu particip local individu view aggreg view local peopl manifest view intens local vari focu particip local interact trajectori concern action evolv time peopl local social world past action trajectori describ move peopl negoti plan action structur concern interact fit broader commun level structur consid describ social world local relat peopl find local form dissip aspect local framework describ characterist make social place aspect afford technic space room metaphor construct social place workplac room kaplan argu group creat social place bound physic space suggest room metaphor spatial properti assist distribut group fashion social place electron medium newli form workplac site space lack social context afford room room custom mean individu social world conveni craft room local act social place commun membership format administr control commun group membership act decid enter site defin technic belong commun predefin group member distribut special interest group peopl interest team member confer membership individu interest visit commun access control list format initi commun requir champion motiv member enter particip site includ make softwar correctli instal strong motiv factor commun form member mail list offer set site list member motiv offer experi earli visit expert provid group guidanc list stage work collabor softwar thought offer idea recommend establish ongo host experienc room metaphor transit groupwar saul greenberg mark roseman potenti user log particip capabl receiv posit site set list member invit attend room creat ahead time note includ explicit consid initi format part structur includ explicit set meet time mutual find recept area door offic offic investig door meet room make default leav calendar note calendar date time assist work suggest meet room meet faster load meet room feedback mark group interest correspond involv social construct belong initi social rule convent commun social place establish enter space room metaphor began plai gave group space meet call room initi structur tailor fit group room provid context expect behavior group room creat local room bound space physic entiti wall inform applet person entiti peopl room person group room bound center social world exampl previou section person room figur local membership expand peopl invit place meet room figur local specif ongo meet activ argu set room group individu view shift focu group point user craft mean room social place manipul room custom content fit social group aspect room afford criteria includ local framework mutual afford awar person room interact trajectori afford persist artifact abil revisit previou version structur afford abil leav note room spell term engag directli refer object room proxim explicit pointer local creat goal creat local iter requir engin base soft system requir collect structur local figur illustr toplevel room set doorwai room set room configur support aspect methodolog top room step phase requir includ room scope requir actual room tool document work room set includ requir refin viewpoint analysi solut select center includ meet agenda room local guid structur support social world local group pursu collect requir engin individu navig chang view intens caveat room local room approxim local boundari room fairli act center peopl room individu view perceiv local union room captur full rich local room fluid peopl copi applet content room room metaphor transit groupwar saul greenberg mark roseman figur loren environ room configur support iter requir engin cycl permiss physic space fairli static heavyweight compar dynam social place room metaphor group form social place room serv destin peopl meet work room custom craft local evolv time proxim action impli peopl awar afford mutual room relat local span seri room room revisit post structur develop time transit electron space social place relat work spatial metaphor long foundat interfac design eleg system call built support room act set task jr card varieti collabor system reli sort spatial metaphor briefli describ approach system categor meet social work space meet point system concept gather point collabor idea peopl virtual tool automat invok connect room metaphor transit groupwar saul greenberg mark roseman media space abel physic room connect video audio channel physic person physic greet peopl locat start combin physic space albeit limit manner virtual room meet point popular media space baecker al idea walk virtual room displai user mechan initi connect virtual offic environ room session manag greenberg virtual room gather organ peopl document user room launch extern groupwar edit tool tool separ room run window type system act integr bound space afford contact inform applic launch integr commun persist artifact creat part meet place room activ social space system creat social space interact simplest chat user connect room chat room type messag recent chat room found onlin servic ad rudimentari interact popular class social space born adventur tradit mud system user connect central server server host varieti uniqu descript set object chat person enter number room chat peopl room type command creat modifi object room system augment mud tool project nichol ad audio video conferenc graphic capabl share whiteboard virtual environ creat graphic peopl navig world encount carlsson peopl repres avatar graphic autom includ video text audio connect trigger proxim avatar close hear mud limit wai support collabor appeal social interact tend support virtual enter work group differ softwar support virtual commun product orient team organ work space varieti system develop room model artifact directli support work activ small group face face meet support system gave group meet tool suchman problem design discuss emb tool room metaphor lan metaphor effort consid design implic room metaphor groupwar mushroom project softwar framework type room call user commun inform object user share includ multimedia present displai separ window collabor virtual workspac mitr corpor divid build floor room carlson build applet integr extern tool servic singl displai separ window develop creat tool kansa graphic environ written languag ungar design virtual space kansa flat plane room user locat local portion room metaphor transit groupwar saul greenberg mark roseman kansa radar overview peopl user program run graphic object user alter properti user feel effect similar move kansa make break audio connect user version orbit fitzpatrick al predecessor world kaplan fitzpatrick implement prototyp test local theori support softwar system provid highli flexibl view shift multipl local share object innov approach differ room fix room preserv spatial relat object collabor desktop environ harkei edward desktop metaphor provid rich network place peopl gather work share document requir radic comput complet replac convent oper system desktop metaphor varieti commerci groupwar product notion room bound instinct involv intranet gear primarili asynchron provid support user work artifact room system reli spatial metaphor vari greatli support featur mention tabl mushroom project displai tool separ window user relat spatial proxim orbit world stress highli tailor view idea room kansa unbound space bound room system support asynchron collabor summari room metaphor groupwar transit style work list varieti featur afford room group leverag individu collabor work workplac implement room metaphor groupwar gap show transit gap reduc properti room metaphor distinct singl user groupwar applic remov make room suitabl individu make shift individu group space function number peopl room peopl move synchron asynchron work room artifact peopl work impli occupi room time show peopl move post meet process formal meet room configur tool inform ahead tool support real time make artifact room persist meet phase difficulti establish contact reduc provid peopl awar casual meet enter common room show technic space social place commun form peopl room craft mean understand room metaphor group work research earli stage evalu team virtual room difficult laboratori short term experi reflect team shape room time readi perform field groupwar system room metaphor rare exist deploi recent recogn small design implement defici current system greatli affect team adopt wai realiz full potenti room metaphor benefit room shown paper case studi room metaphor transit groupwar saul greenberg mark roseman softwar avail inform includ direct inform relat research softwar groupwar web site acknowledg peopl team contribut work includ carl gutwin work ted work flexibl toolkit infrastructur alex mitchel mark code earli session manag intel corpor nation scienc engin research council canada fund research grate support encourag provid jim toni refer experi workflow issu gener acm confer comput support cooper pp acm press abel experi exploratori distribut organ intellectu social foundat cooper pp lawrenc erlbaum jersei build oxford press baecker read groupwar cooper assist collabor san ca baecker posner iter design collabor write softwar acm confer human factor comput pp april acm press baecker read human comput year san ca benford brown reynard greenhalgh share acm confer comput support cooper acm press buxton integr share task person space graphic interfac pp morgan kaufmann reprint baecker card henderson jr multipl interfac support user task switch acm human factor comput system graphic pp acm press card robertson mackinlai inform inform workspac acm confer human factor comput pp dive platform virtual environ comput pp cockburn greenberg make group commun groupwar acm confer organiz comput novemb acm press cockburn reflex perspect cscw acm sigchi pp juli hypertext tool exploratori polici discuss confer cooper work pp septemb acm press room metaphor transit groupwar saul greenberg mark roseman captur organiz memori coleman groupwar pp morgan kaufmann reprint baecker room learn support teamwork assess team dedic project intern workshop cooper integr februari germani curti nichol mud grow social virtual realiti real world intern confer cyberspac foundat studi group support system manag scienc human comput interact prentic hall uk dourish bly support awar distribut work group confer human factor comput pp acm press dub hayn distribut concept time acm confer cooper pp fitzpatrick kaplan local explor foundat collabor support sixth australian confer human pp novemb ieee comput societi press flore winograd comput system design organiz interact acm transact offic inform pp republish baecker greenberg share view interact applic confer offic inform pp april greenberg low cost awar commun companion acm confer human factor comput pp acm press greenberg gutwin roseman semant telepoint groupwar sixth australian confer novemb greenberg hayn rada ed groupwar book compani england greenberg roseman www browser real time groupwar companion acm confer human factor comput pp acm press groupwar toolkit synchron work cooper trend softwar john wilei son comput support cooper histori focu ieee groupwar applic problem design evalu technolog pp workspac awar distribut evalu peopl comput xi pp confer held imperi august room metaphor transit groupwar saul greenberg mark roseman harrison dourish role place space collabor system acm confer comput support cooper acm press groupwar system negoti softwar requir msc dept comput canada henderson jr card multipl virtual workspac reduc space content graphic user interfac acm transact offic inform pp ishii seamless share space confer comput support cooper work pp lo octob acm press ishii kobayashi grudin integr interperson space share design experi acm transact inform system octob reprint hayn rada pp run meet harvard busi reprint baecker comput support busi team free press framework collabor interact internet intern workshop cscw sankt februari pattern contact commun scientif collabor confer cooper work pp septemb acm press concept map phd depart comput canada spatial metaphor user interfac acm confer human factor comput tutori note dept technic austria lang electron group experi expect coleman groupwar pp morgan kaufmann reprint baecker de augment multipli space creativ design intern confer support group pp acm press malon lai fry experi radic tailor tool cooper work acm confer comput support cooper work pp octob novemb acm press evolv progress report build local intern confer support group pp acm press baecker sellen buxton wellman experi media space acm confer human factor comput pp acm press light nest distribut problem solv spreadsheet develop comput support cooper work groupwar pp academ london electron meet system support group work commun acm greenberg groupwar environ complet meet acm sigchi confer human factor comput poster short paper room metaphor transit groupwar saul greenberg mark roseman volum pp acm press orfali harkei edward essenti distribut object surviv john wilei son requir virtual colloc environ intern confer support group pp acm press human comput interact elli group hypertext system intern journal man machin pp march republish greenberg design vehicl social confer cooper work pp septemb acm press roseman manag complex internet groupwar applic usenix press roseman greenberg simplifi compon develop integr groupwar environ acm symposium user interfac softwar acm press roseman greenberg network place collabor acm confer comput support cooper acm press roseman greenberg tour technic video track acm confer human factor comput system minut build real time groupwar groupwar toolkit acm transact comput human pp design user strategi effect interact jersei kansa collabor debug share world break commun pp april integr cooper virtual offic environ acm confer comput support cooper acm press collabor virtual workspac intern confer support group pp acm press sproull lesson electron mail sproull wai work network organ pp mit press reprint baecker sproull person connect sproull wai work network pp mit press reprint baecker commun stefik bobrow foster lan wysiwi earli experi interfac acm transact offic inform pp april strauss continu permut de york tang find observ studi collabor work comput support cooper work pp academ press dynam support collabor work world acm confer organiz acm press room metaphor transit groupwar saul greenberg mark roseman life ident ag internet simon schuster commun requir group support journal organiz pp excerpt reprint baecker electron meet concept greenberg comput support cooper work groupwar academ uk softwar lab report pp februari appendix applet applet includ fairli simpli tool immedi train applet manipul visual workspac applet ubiquit sticki note user room chang text note immedi displai note organ note organ team member text fragment applet move fragment full groupwar peopl text item reposit concept map concept map applet organ time graph node graph repres edg idea relat user room simultan add edit node edg node edg type concept map configur peopl creat node type link edg type elli figur illustr small concept map construct methodolog group reconfigur concept map creat set node edg type calendar calendar tool peopl creat simpl group schedul game puzzl applet idea user simultan manipul color piec fit outlin similar provid applet card tabl rule pick game chess board simpl applet provid user defin set give field manipul record replac full suffici hold small collect inform default configur suppli system includ address book list applet navig room doorwai peopl doorwai applet creat direct entranc room group quick direct member group relev inform found room applet import point extern inform imag tool convent room graphic work relat decor ad applet displai imag room imag upload imag file url applet fetch imag http server user annot draw imag whiteboard pen file transfer applet extern file room retriev select user upload file icon filenam user download file room file system extern url refer refer extern web inform applet hold pointer url click icon send url applet room metaphor transit groupwar saul greenberg mark roseman normal web click label chang url share view url action invok browser strictli local peopl applet leav pointer team member file viewer file viewer displai ascii file relax user scroll independ part file scrollbar portion file user greenberg web browser final includ browser roseman convert applet applet coupl simpl web browser groupwar featur telepoint page synchron unlik extern url refer peopl browser real time bring page share navig page discuss inform applet custom applet creat programm fit group provid augment applet commun softwar develop extend applet hand creat suit custom applet possibl includ support version control extern extern inform system applet construct programm api greenberg room metaphor transit groupwar saul greenberg mark roseman
ML/101 6 tic toolkit valid formal languag learn volker dotsch universitat leipzig institut fur informatik leipzig germani klau jantk deutsch forschungszentrum fur kunstlich intelligenz saarbrucken germani abstract heurist common suggest direct improv learn algorithm easi task verifi modif made complic addit influenc inher applic domain order obtain faith impress phenomena role specif domain minim valid toolkit tic explor behaviour algorithm learn formal languag standard applic domain tic oper interact automat control motiv introduct lot learn approach algorithm exist version refin hand desir improv hand make rel strength weak difficult compar hinder transfer result idea approach heurist common suggest direct improv learn algorithm easi task verifi modif tic prototyp type learn algorithm induct algorithm algorithm introduct induct smith copyright american associ artifici intellig reserv overview schank decid restrict attent area learn formal languag ullman practic difficult compar applic domain domain characterist featur domin specif properti useabl learn algorithm influenc specif domain minim interest studi fundament phenomena formal languag wide repres knowledg comput scienc concept gener suppli practic interpret result formal connect acceptor gener theoret examin rich reservoir result result valid evalu investig approach algorithm discuss semin paper underli learn paradigm main task learn learn incomplet inform incomplet approxim practic problem wai present inform formal languag learnt basic approach defin concept text inform text sequenc word exhaust target languag inform sequenc word label word label form text word label form text complement learn algorithm express form learner gener base select case tune similar cf lang similar measur refin learn hypothesi consist case base similar measur small number learn algorithm albert publish reflect standard reason paradigm induct learn algorithm construct explicit gener exampl hypothesi regular learn step learn algorithm output hypothesi learn inform hypothesi possibl output complet learn sequenc produc tic overview tic tool valid algorithm learn formal languag implement basic algorithm version examin algorithm compar algorithm batch processor typic question address ffl algorithm show expect behaviour ffl algorithm stabil correct hypothesi inform ffl fast hypothesi sequenc ffl algorithm repetit special order inform ffl size depend amount inform valid process inspect learn algorithm answer question algorithm ffl basic algorithm learn determinist automata variant ffl david aha albert slightli adapt learn formal type similar measur jantk ffl algorithm find develop sakakibara siromonei siromonei induct learn list ffl algorithm angluin learn regular pattern tic provid framework interact inspect algorithm includ visual document result valid scenario tic focu interact approach valid learn algorithm base idea lang valid scenario consist test case assess test case gener depend intend target possibl respect peculiar system valid interact valid perform feed test data system receiv system result subject evalu question learn algorithm learn target object respect consid criterion success valid problem learn algorithm tripl set automata learn algorithm criterion success test data gener select algorithm evalu fix alphabet tic upper case lower case charact digit select set learn algorithm learn test finit idea select typic test strategi implement finit automata gener automata randomli valid learn algorithm test case consist specif element subset inform test inform user restrict text definit test data process phase user defin list word subset word fix duplic phase tic classifi word select defin list implement comfort editor tic gener word fix alphabet word classifi learn process feed learn algorithm consist select test data editor learn inform make modifi list regular list finit determinist automata exist editor defin type function copi load type gener randomli test equal hand gener word word length length gener word word length load save append complet list current remov duplic current order current list word ascend featur user make list test data show behaviour learn algorithm user valid valid algorithm learn correctli duplic learn remov duplic test data valid algorithm learn correctli feed randomli order test data work learn algorithm gener output input start defin special paramet learn process paramet specifi tic divid list test data initi segment length segment process learn algorithm sequenc inform learn process option word mean learn algorithm figur tic learn test produc hypothesi learn step learn algorithm exampl produc hypothesi learn step algorithm word learn step algorithm work exampl shortest word length test produc hypothesi algorithm work exampl shortest length maxim word length inform provid start maxim word length shortest length defin exampl algorithm work learn step fig step step step exampl number exampl step tic produc sequenc list number chang stabil correct hypothesi stabil point sequenc shown test scenario defin test case save complet scenario set load continu evalu test case hypothesi subject evalu check hypothesi correct criterion target languag decid actual hypothesi learn algorithm describ target languag correctli regular pattern finit automata test tic automat cdl defin test set word alphabet toolkit classifi correctli compar classif select hypothesi misclassif actual hypothesi correct case check hypothesi hand test set test set word suffici check incorrect misclassifi word shown save separ list research ratio qualiti tic test set count number misclassif wrt target languag result shown main window separ word target languag classif word complement target similar measur learn finish learn list stabil point languag word evalu behavior learn algorithm strategi tic gener pictur error rate sequenc make visibl error rate test case figur error rate correct learn hypothesi evalu number express opinion experi wit learn algorithm abil learn target languag case user valid learn algorithm test inform algorithm learn tic show size user evalu relat size inform learn process open separ window hypothesi deeper analysi save hypothesi assess system valid respect criterion experi basi larger larger test data set evalu number evalu converg experi provid initi segment potenti infinit experi implement learn algorithm exploit deriv valid statement small number experi algorithm chang actual hypothesi case current correctli classifi data call conserv extrapol algorithm behaviour conserv learn algorithm output correct hypothesi target algorithm learn languag figur learn randomli arrang good exampl figur show rate misclassif run randomli order good list section applic plain algorithm user domain arrang learn inform learn correctli present valid mean run algorithm inspect input data randomli chosen systemat repres prototyp learn situat expect learn result valid advanc valid system expect demonstr success learn input data fed behavior displai figur success learn bear evid system invalid batch process compar batch process user set set list test data set test case set test set set learn algorithm batch processor run learn scenario algorithm batch processor test correct qualiti error set test hypothesi size hypothesi result test save report file ascii order test case algorithm load report file tool statist analysi gener trend curv size qualiti user batch processor save scenario separ scenario file load continu refin evalu toolkit tic applic approach learn express briefli cbr appli work chang fail input add experi case base dont chang show practic valid presenc substanti user guidanc target class formal languag learnt list learn theoret investig siromonei drawn attent simpl type list cdl finit sequenc label word label list easili understood acceptor word word fed cdl check node check subword word classifi determin accept input word pass wn equal empti word subword process termin manner cdl illustr roughli languag accept word squar word complement learn investig albert natur design learn procedur normal form result al explain learn procedur type rewritten learn procedur task learn collect good case store case base describ knowledg classifi unknown exampl learn algorithm construct explicit gener exampl consist case base similar concept constitu subject task learn consist suitabl tune similar measur due siromonei arbitrari list learnabl knowledg cdl potenti acquir process finit case describ target languag accept languag accept cdl regular languag accept cdl albert present simpl algorithm acquir knowledg finit case select collect case subsequ case paradigmat idea lot cdl seri experi perform test case exhibit catastroph behavior turn algorithm essenti depend user guidanc valid result learn languag complet learn experi individu experi attempt learn sequenc correctli classifi fail complet critic inspect lead concept good list list suffici learn algorithm gener automat difficult target phenomenon suffici build list good exampl addit problem arrang knowledg appropri perform explor import find order inform present basi learn result illumin sensit learn order inform ratio success unaccept realist applic convinc learn cdl simpler problem knowledg acquisit user guidanc acquir knowledg manner practic import exhibit prototyp domain present inevit toi applic domain chosen present work extrem simpl intuit applic domain proper relev larger complex realist domain simpl algorithm idea fail toi domain circumscrib understand provid present find extend adapt similar concept reader direct dotsch dotsch detail inform learn good exampl introduc wiehagen tic toolkit aim valid behavior algorithm gener effect tic produc show sequenc exampl make visibl correct qualiti inform interest algorithm variant implement tic fulli implement algorithm valid strategi analysi evalu plug extend system learn learn function acknowledg implement version tic part project support german research fund grant ja ja ja idea inspir fruit discuss michael christoph globig steffen lang version tic develop implement author cooper udo burghardt stephan todai tic develop author cooper gunter grieser steffen lang refer learn algorithm machin learn survei induct theori method comput survei find pattern common set string journal comput system scienc tic ein fur technic report htwk leipzig solv stabil problem knowledg acquisit proc australia induct infer good exampl proc volum springer learnabl languag gener comput languag identif limit inform control valid induct learn system proc volum springer introduct automata languag comput extend explor necess user guidanc learn technic report japan necess user guidanc knowledg acquisit florida ai research societi learn pattern languag theoret comput scienc algorithm learn incomplet principl problem volum springer reason san morgan kaufmann insid reason erlbaum assoc model learn set string proc acm finit automata behavior synthesi fundament studi comput scienc
ML/102 6 ur informatik der technischen universitat munchen viii autom reason connectionist approach learn heurist autom deduct system report christoph institut fur informatik tu munchen germani tu germani connectionist approach learn heurist autom deduct system christoph abstract central problem autom deduct growth search space proof length connectionist approach learn heurist autom deduct system present show fold architectur type neural network capabl solv learn task structur learn heurist evalu function algebra express evalu function control search process proof problem result autom deduct system algebra domain show perform improv control heurist learn simpl problem domain system solv problem domain reach origin system introduct goal autom deduct automat find formal proof conjectur base set axiom conjectur axiom declar formal languag order predic state develop applic incomplet control knowledg ad long tradit comput scienc symbol ai system perform kind deduct infer applic area found logic comput deduct data verif hardwar central problem ad growth search space proof length price pai abil handl declar knowledg practic method guid control search process make heurist gener heurist effect heurist effect specif applic domain applic good heurist advanc difficult timeconsum develop hand experi good bad direct search easili suppli proof conjectur found paper connectionist approach learn heurist experi present idea simpl proof solv brute forc search simpl gener learn heurist tackl difficult problem kind neural fold architectur network learn heurist evalu function algebra control search process fa suit learn solv learn task involv structur object approach present paper fit context hybrid system result hybrid profit strength symbol connectionist paradigm due symbol compon origin correct proof found connectionist control compon system automat adapt specif applic domain paper organ section briefli discuss problem neural network structur object fa kind structur object handl introduc section show algebra express repres heurist autom deduct system concept learn exampl success search process present result present section section conclud paper briefli compar approach work improv learn previou experi neural network structur object basic problem field scientif technic peopl system assist deal structur object exampl chemic algebra softwar sourc conceptu taxonom graph inform structur object structur object consid size object limit deal object size applic contrast static kind data real handl statist pattern recognit neural network approach tradit approach statist pattern recognit neural network approach domain structur object work introduc featur featur case easili comput properti structur object exampl case algebra express number symbol depth set structur object repres featur vector vector featur valu definit select featur introduc strong bia sever limit class function relat express learn respect domain structur object reason aspect object import learn task complet lost transit difficult extract import featur advanc approach field learn heurist fold architectur network fold architectur network close relat concept neural network frasconi develop solv learn task classif data structur applic field chemistri logo recognit schmitt frasconi structur object handl fa finit label order tree simpli call label tree label assum real vector fix uniform length node label attach label edg order concern children node assum limit number children label tree logic term algebra express finit set symbol easili repres label tree maximum ariti symbol maximum introduc function map symbol real vector fa variant standard network gener recurr neural network learn approxim map label tree ir base sampl map fa appli encod network enc transform network tran sigmoid activ function consid enc comput compress fix length label tree tran input comput final output network figur show fa process label tree maximum enc tran network note case maximum enc tran simpl recurr network ree repres domain label tree process maximum max rep denot dimens compress network final enc tot max rep input neuron rep output neuron enc comput function enc ir rep ir assum label tree ir label ree order list children ffl denot vector concaten function enc ree ir comput compress defin enc ffl ffl ffl ffl nil network virtual unfold encod encod composit tree encod children nil ir fix indic absenc child transform network tran rep input neuron output neuron comput function tran ir ir output encod network enc input tran total network comput function tran ffi enc ree ir figur shown fa approxim function label tree real vector space hammer simul fa fa train structur variant standard backpropag mean error output layer tran propag back entir unfold network exact gradient simpl label tree neuron encod network transform network rep rep neuron rep rep nil nil result nil nil nil encod network unfold transform network network unfold topolog figur fa process logic term respect weight tran enc comput train complet mean compress gener label tree train fa optim respect learn task expect kind inform comput desir output definit featur user longer current refin includ effici label tree train set minim direct acycl graph repres ident occur posit time complex gradient comput linear number node edg train minim speed gradient comput fa close relat label memori fact enc ident encod network crucial differ li train method train learn step process compress gener approach optim respect learn task learn task fa suit comparison heurist evalu function autom deduct basic heurist evalu function figur schemat show finit initi segment gener specif proof problem node edg repres state infer step infer step repres singl logic express state singl logic express set express proof repres state specif properti test easili goal direct heurist repres comput numer rate state infer step restrict state assum state repres singl logic express moser base analyt calculu extens prolog sld resolut full order clausal logic basic principl goal express mean infer rule easier express proof search stop remain express proven trivial repres singl logic call tree logic tableau regard proof attempt repres current decomposit conjectur concept learn present easili extend infer step exchang edg infer step approach applic state consist set express loss gener assum high rate good rate low rate bad search strategi global compar rate mean state explor state infer step typic produc logic express set input express repres infer step result express combin input express singl big express eq state infer step root proof proof proof figur autom deduct system proof problem eval denot pred reflex transit closur predecessor relat learn heurist evalu function infinit number proof provabl conjectur user interest find proof problem care proof found experi heurist show tend focu search proof special shape proof incompat heurist forbid infer step condit prefer combin infer step heurist mimic behaviour macro oper practic remov redund part reformul proof found method learn heurist freedom decid proof focu finit initi segment proof problem explor search standard heurist proof train sampl learn extract state ly path proof exampl posit target rate grei box figur state ly exampl neg rate number neg exampl high reason restrict neg exampl state lie small distanc posit grei box figur distanc state measur term number edg separ select posit neg determin select accept proof maximum distanc neg exampl posit gener strong influenc kind learn select left intuit user case standard error measur train fa standard error measur adequ learn base train sampl individu train exampl independ inform high rate state find respect proof state high rate state high rate harm posit exampl ly low rate reason interest find proof proof problem number exampl train sampl small compar number state explor reason amount time regard perfect wrt sampl direct search proof problem sampl proof sampl lead explor state sampl note global search strategi rate assum found adequ minim error measur learn po set neg set set node ly path root select initi segment proof neg sampl successor state sampl defin neg predecessor state member figur show solv problem tabl result method learn continu differenti error measur achiev approxim max fi fx fi ln fix min fi fx fi ln deriv integr gener sigmoid function fi xn fix fix fi xn defin wrt train sampl proof problem combin sampl proof problem learn maximum error contribut error measur result theorem prover error measur section fa learn heurist experi carri domain word problem group theori system equal handl knuth find confluent termin system rewrit rule group theori system rewrit rule basi effici procedur gener system version special equal difficult intract big advantag good strategi solv problem learn arbitrari number proof problem complex axiomat equal axiomat group theori minim rule termin rewrit system includ equat reason minim solv simpl problem difficult gener train data learn minim axiomat lead long unnatur proof consist answer question ground term build signatur equal wrt group theori fc denot set randomli gener normal solvabl problem solvabl iter deepen search infer bound time limit sun ultra length proof vari infer analyt calculu mean goal equat equat open equat proven trivial equat axiomat standard subgoal select control restrict select infer step solv current subgoal tableaux list subgoal start current subgoal chosen order subgoal list label tree symbol ariti ad repres variabl normal respect variabl appli order identifi semant subgoal list uniqu label encod length chosen symbol signatur maximum ariti solvabl problem kind train sampl gener sampl type proof minim maximum distanc tableaux maximum length subgoal list sampl type proof infer proof minim maximum distanc tableaux maximum length subgoal list type fa train combin train sampl solvabl problem denot rep number unit layer train small network conjug gradient normal place wrt order avoid multipl occurr semant problem train network epoch tabl show result achiev train network control proof search remain test problem line number solv test problem line averag time find proof time limit sun ultra note test problem intract origin version control learn heurist solv test problem averag search time moser version special equal handl solv test problem time limit averag search time experi show domain automat tune gener system learn heurist fa achiev perform compar special develop result word problem group theori gener regard trivial step experi realist applic domain section compar fa tradit approach statist pattern recognit neural network structur object symbol method learn previou experi ad method learn proof schemata proof plan advantag learn knowledg easi understand interpret learn base memor weak gener lead learn redund problem retriev learn knowledg symbol method superior train problem approach superior train problem approach learn heurist present paper restrict logic reason system error measur introduc section learn heurist gener system continu differenti approxim minimum maximum introduc section neural network applic train exampl independ refer logo recognit winner intern theorem prove competit neural network page gener framework adapt process data structur ieee transact neural septemb mat fuch experi heurist past proof experi proc page lnai learn distribut backpropag structur page ieee june christoph connectionist control compon theorem prover workshop combin symbol connectionist hammer neural network approxim map structur object intern confer comput intellig page march de knuth simpl word problem algebra comput problem abstract page pergamon match modulo evalu techniqu proof chri page morgan kaufmann august correspond neural fold architectur tree automata technic report dept neural inform comput model construct chri page morgan kaufmann august model elimin prover special issu journal autom schmitt relat chemic structur activ structur process neural fold architectur june learn distribut classif term chri page morgan kaufmann august cb automat acquisit search guid heurist page springer lnai
Agents/103 1 note comput scienc rule agent motion structur environ marco andrea omicini franco zambonelli dei università di bologna vial bologna itali dsi di modena reggio emilia modena itali abstract design develop cooper internet applic base mobil agent requir model physic space agent roam conceptu space mobil agent interact paper discuss network model hierarch collect local agent dynam acquir inform resourc locat avail permiss issu agent motion rule constrain structur environ mean coordin infrastructur introduct mobil agent technolog design develop cooper applic internet due capabl autonom roam mobil agent move local resourc servic interact provid save bandwidth sort intellig enabl complex dynam interact protocol open unpredict environ internet research area mobil agent greatli dichotomi possibl intellig static commun distribut artifici intellig focuss aspect agent intellig autonom plan capabl commun distribut system wide discuss effect mobil respect tradit solut develop system make practic problem tackl design mobil agent applic mobil intellig exploit achiev complex cooper task inform retriev technolog solut suit face issu mobil make reliabl messag deliveri secur lectur note comput scienc order fulli exploit potenti mobil argu structur model environ agent move interact support infrastructur suggest deepli account support focu specif issu agent resourc internet unknown agent subject access control polici argu infrastructur charg support agent process acquir knowledg environ resourc handl internet flat collect dynam structur network belong rule wai argu agent motion govern infrastructur model scenario regard infrastructur improv agent effici drive specif provid abil acquir knowledg structur network dynam issu strictli relat argu abstract mechan exploit infrastructur make agent awar network topolog structur control govern motion agent possibl move interact part infrastructur resourc strictli complet task access control techniqu appli agent interact mobil adopt topic discuss section section describ infrastructur mobil agent applic structur case studi exploit tucson coordin model base programm tupl space mobil agent applic dynam knowledg agent free charg apriori knowledg dynam explor forc agent follow specif path uniform interact commun resourc access section conclud paper briefli discuss relat work rule agent motion assum virtual case studi discuss problem relat agent mobil internet show infrastructur support agent dynam acquisit knowledg network structur motion case virtual lectur note comput scienc busi activ cross boundari singl compani encompass feder possibl size independ work common project short long requir support electron manag busi process complex due adapt process singl compani emerg heterogen data servic electron infrastructur virtual exhibit due possibl area virtual mobil agent fruitfulli exploit context agent move node virtual effect handl problem dynam adapt process heterogen data exploit intellig capabl local access data resourc unrealist assum agent complet knowledg network resourc virtual highli independ partner complex conveni provid agent detail knowledg structur node resourc time feder form basic secur reason suggest compani data resourc virtual requir process virtual proce agent deal fact access resourc node network deni virtual result suitabl infrastructur mobil agent internet provid dynam knowledg acquisit agent motion resourc avail topolog apriori unknown partial agent support infrastructur acquisit knowledg resourc avail locat order plan action achiev goal dynam explor constrain desir destin mobil agent effect permit reach network consid unpredict agent freeli roam motion interact rule constrain infrastructur access control polici call explor interact agent infrastructur explor topolog result interact knowledg agent acquir access control queri move infrastructur dynam knowledg acquisit lectur note comput scienc everydai search retriev inform rare directli page site exact locat page exploit search engin navig set link interest inform found mobil agent scenario mobil agent applic charg retriev inform internet site agent roam internet site queri inform sourc retriev requir inform internet forc explor complex structur reach locat inform store inform product specif compani agent start explor migrat main locat home page support agent applic produc queri repli inform refin explor case virtual main compani main requir provid inform repli locat subsidiari compani product agent migrat node subsidiari compani repeat queri node provid agent commerci offic increment augment agent knowledg topolog addit permit destin agent migrat infrastructur explor point inform seldom manag deleg local author feder true web virtual mobil agent applic necessarili deal situat inform increment acquir complex network infrastructur support agent dynam acquir knowledg reduc number except agent handl explor plan refin step exploit inform prevent agent move node deni access forc handl number except order support dynam explor infrastructur model structur account local relationship logic node network requir role assign node network node agent execut access specif data resourc plai role place node exploit agent acquir inform network structur resourc plai role gatewai gatewai inform limit set place singl repositori complex larg call domain set node gatewai place inform hierarch topolog gatewai manag model structur figur hierarch structur natur map typic physic structur node administr domain protect possibl cluster higher level structur lectur note comput scienc worth note concept gatewai place automat impli definit uniqu hierarch place part domain gatewai provid inform gatewai place turn local model complex dynam network deriv virtual virtual form feder model composit infrastructur gatewai domain gatewai place domain gatewai place gatewai place place domain domain domain gatewai place figur support infrastructur abstract introduc model physic topolog compani rule motion mobil agent gatewai kei element support agent dynam acquisit knowledg exploit provid mobil agent descript network gatewai describ singl level structur inform network topolog acquir increment cross gatewai enter task mobil agent result complex knowledg manag shift agent infrastructur dynam explor constrain infrastructur model physic logic topolog network agent explor phase system agent move node hold access resourc comput resourc wast agent free reach node resourc access access control enforc limit number attempt access local resourc agent requir dynam handl except deni access resourc except handl neg impact place lectur note comput scienc applic agent viewpoint access resourc prevent agent interact gatewai infrastructur acquir gatewai exploit guid constrain agent movement access resourc inform provid agent gatewai depend ident privileg agent enabl acquir elect knowledg network structur inform manag specif access control network resourc agent access specif resourc node inform node resourc alloc appli access control techniqu entiti access authent gatewai exploit authent incom agent behalf place place domain reject agent authent gatewai enforc agent motion control limit hierarch infrastructur implement effici built current secur framework cryptograph tool approach adopt state agent motion govern basic principl resourc access control mean place hold resourc agent interact migrat agent place extend infrastructur explor agent logic resourc agent complet task tucson infrastructur section describ infrastructur defin rule agent motion structur environ infrastructur base tucson coordin enabl interact agent resourc uniformli manag fashion tucson coordin model tucson coordin model defin interact space spread collect internet node built multipl independ commun abstract call tupl centr tupl centr node denot local uniqu identifi node possibl host multipl tupl provid local tucson space set tupl centr virtual implement tupl centr internet servic tupl centr identifi full internet local support twofold role agent entiti explicitli access remot tupl local entiti lectur note comput scienc current execut node oper remot tupl centr invok full internet local tupl centr access local identifi overcom limit origin linda model tucson tupl centr enhanc tupl space notion behaviour tupl centr program implement observ behaviour commun event simpli trigger basic mechan linda invoc tucson basic commun primit perform agent specif comput call reaction result invoc commun primit perceiv agent transit tupl centr combin altogeth effect primit reaction trigger observ behaviour defin tupl global coordin law due tupl centr exhibit behaviour access event access event ident agent perform tupl centr behav behaviour access event perform agent fruitfulli exploit make tupl centr act media agent commun integr form behaviour specif commun media access resourc provid node repres data form tupl servic form behaviour tucson engin agent motion access control tucson tupl centr exploit rule agent motion structur environ handl access control polici support agent mediat knowledg acquisit constraint movement tupl centr differ node hold tupl centr gatewai implement default tupl repres standard commun media agent interact figur agent arriv queri default tupl centr structur order enabl proce explor default tupl centr agent inform node execut inform resourc locat tupl centr agent inform privileg grant tupl centr agent agent dynam inform structur bound motion resourc access avoid useless migrat improv agent support infrastructur effici tupl centr program behav differ access perform provid agent inform structur depend permiss agent lectur note comput scienc agent arriv access resourc local tupl centr suitabl program tupl centr permit develop requir access control polici protect local resourc lead uniform access resourc access inform network exploit interact model tupl centr local resourc default tupl centr default tupl centr tupl centr local resourc tupl centr tupl centr local resourc local resourc figur tupl centr hierarch topolog tupl centr tabl report typic agent execut move structur network rule tucson infrastructur tabl agent explor protocol tucson explor migrat gatewai authent agent behalf place domain access default tupl centr gatewai obtain inform access place tupl centr pl explor access place domain local interact migrat place pl tc visibl tupl centr place pl tupl centr tc place execut op pl relat work novelti paper discuss infrastructur agent system arrang deal topolog lectur note comput scienc structur dynam unpredict coordin interact mobil access control appli explor infrastructur issu relev fulli address complex reciproc depend agent research tucson framework support infrastructur coher sound fashion system relat relev area infrastructur underli platform agent system enabl control access manag resourc explicitli model locat agent host amount comput resourc agent consum resourc interact mediat mean compon behaviour specif interact type resourc differ tucson agent interact standard resourc emb compon specif tailor resourc type manag heterogen interact space main benefit deriv adopt coordin model issu deriv structur environ explicitli address lime interest coordin mobil agent host mobil agent carri tupl space agent tupl space dynam recomput mobil content tupl space logic merg agent host result global tupl space share agent host differ lime princip investig problem relat aspect infrastructur problem access control topolog consid secur space relev area coordin model modifi linda order offer secur mutual untrust program lock mechan protect data store tupl set develop mean cryptograph techniqu compar tucson goal control agent interact address issu control agent access tupl share blackboard ambit formal model hierarch structur internet explicitli model migrat activ entiti protect domain work consid structur network secur problem scenario differ formal real infrastructur defin term effect technolog solut provid work devot identif suitabl design pattern mobil agent integr jini technolog javaspac coordin model suitabl enhanc model refer lectur note comput scienc agent design element agent applic autonom agent acm internet public kei infrastructur roadmap ietf internet work march coordin model internet applic base mobil ieee feb mobil foundat softwar scienc comput lnc mobil good rc ibm research system extend scope coordin secur topolog fj garijo system engin proc european workshop model autonom agent world lnai page express power languag program coordin media acm symposium appli comput page atlanta understand code ieee transact softwar coordin languag commun feb architectur control agent ensembl ieee intellig special issu intellig roadmap agent research develop intern journal autonom agent system design issu program ieee pp coordin internet applic journal autonom agent sept linda meet mobil proc intern confer softwar engin lo coordin agent secur coordin jini architectur comput commun juli
ML/104 6 statist pattern review jain robert pw mao novemb abstract primari goal pattern recognit cation framework pattern recognit statist approach intens studi practic neural network techniqu method import statist learn theori deserv attent design recognit system requir care attent de nition pattern pattern featur extract cluster classi er design select train test perform evalu spite fty year research develop gener problem recogn complex pattern arbitrari scale remain unsolv depart comput scienc michigan state east mi usa pattern recognit depart appli delft netherland ibm almaden research san ca usa emerg data web retriev multimedia face recognit cursiv handwrit requir robust ecient pattern recognit techniqu object review paper summar compar method stage pattern recognit system identifi research topic applic forefront excit challeng eld statist pattern classi featur featur error classi er neural network introduct time ve year children recogn digit letter small larg machin easili recogn young charact written clutter paper partial occlud abil grant face task teach machin pattern recognit studi machin observ learn distinguish pattern interest make sound reason categori pattern spite fty year design machin pattern recogn remain goal pattern recogn instanc understand human recogn pattern ross work nobel herbert simon central nding pattern recognit critic human make relev pattern hope propon arti cial comput taught recogn pattern success comput program bank store credit doctor pilot land airplan depend pattern recognit pai explicit attent teach pattern goal introduc pattern recognit util domain knowledg make automat pattern automat classi group pattern import problem varieti engin scienti disciplin comput arti cial remot watanab de ne pattern opposit vagu de pattern handwritten cursiv human speech signal cation consist task classi cation discrimin input pattern identi ed member prede ned classi cation pattern assign hitherto unknown class note recognit problem pose classi cation categor class de ned system design classi learn base similar pattern classi interest area pattern recognit renew recent due emerg applic challeng demand tabl applic includ data mine exampl pattern recognit applic problem domain applic input pattern pattern class bioinformat sequenc analysi sequenc type pattern data mine search point compact pattern space separ cluster document internet search text document semant categori classi cation document imag read machin document imag analysi blind word industri autom print circuit board intens rang defect inspect imag natur product multimedia internet search video clip video genr retriev biometr recognit person identi cation author user access control remot forecast crop yield imag land growth pattern crop speech recognit telephon directori speech waveform spoken word oper assist outlier million document classi cation search text nancial organ retriev multimedia biometr identi cation base physic attribut face picard identi ed applic pattern call ectiv comput give comput abil recogn express respond intellig human emploi mechan emot contribut ration make common characterist number applic featur suggest domain extract optim procedur rapidli grow comput enabl faster process huge data facilit elabor method data analysi classi cation demand automat pattern recognit system rise enorm due avail larg stringent perform requir accuraci emerg clear singl approach classi cation multipl method approach combin modal classi er commonli practic pattern recognit design pattern recognit system essenti involv data acquisit data make problem domain dictat choic preprocess make model gener ned sucient constrain recognit problem variat larg lead compact pattern simpl make strategi learn set exampl import desir attribut pattern recognit system approach pattern recognit templat statist classi syntact structur neural network model necessarili independ pattern recognit method exist di erent interpret attempt made design hybrid system involv multipl model descript comparison approach summar tabl tabl pattern recognit model approach recognit function typic criterion templat match curv distanc measur classi cation error statist featur discrimin function classi cation error syntact structur primit grammar accept error neural network featur network function squar error templat match simplest earliest approach pattern recognit base templat match match gener oper pattern recognit determin similar entiti curv type templat templat prototyp pattern recogn pattern recogn match store templat account pose scale similar optim base train set templat learn train set templat match avail faster processor made approach feasibl rigid templat match mention ectiv applic number disadvantag fail pattern distort due imag larg variat pattern deform templat model rubber sheet deform match pattern deform easili explain model directli statist approach statist pattern repres term featur measur view point space goal featur pattern vector belong di erent categori occupi compact disjoint region featur space ectiv space determin pattern di erent class separ set train pattern object establish boundari featur space separ pattern belong di erent class statist theoret boundari determin probabl distribut pattern belong speci ed learn discrimin approach classi rst parametr form boundari linear speci boundari speci ed form found base classi cation train pattern boundari construct squar error criterion direct boundari construct approach support vapnik philosophi possess restrict amount inform solv solv problem directli solv gener problem intermedi step inform sucient direct solut insuci solv gener intermedi syntact approach recognit problem involv complex adopt hierarch perspect pattern view simpl built simpler recogn call primit complex pattern repres term interrelationship primit syntact pattern formal analog drawn structur pattern syntax languag pattern view sentenc belong primit view alphabet sentenc gener grammar larg collect complex pattern small number primit grammat rule grammar pattern class infer train sampl structur pattern recognit intuit appeal addit classi approach descript pattern construct primit paradigm situat pattern de nite structur captur term set textur shape analysi contour implement syntact lead diculti primarili segment noisi pattern detect infer grammar train data fu introduc notion attribut grammar uni es syntact statist pattern recognit syntact approach yield combinatori possibl demand larg train set larg comput ort neural network neural network view massiv parallel comput system consist extrem larg number simpl processor interconnect neural network model attempt organiz principl fault toler distribut network weight direct graph node arti cial neuron direct edg connect neuron output neuron input main di erenc neural network approach pattern recognit network abil learn complex sequenti train procedur gener characterist adapt data commonli famili neural network pattern classi cation task includ perceptron function network network organ layer unidirect connect layer popular network map data cluster featur map learn process involv updat network architectur connect weight network ecient perform speci classi task popular neural network model solv pattern recognit problem primarili due seemingli low depend knowledg due avail ecient learn algorithm neural network provid suit nonlinear algorithm featur extract ing hidden classi cation exist featur extract classi cation algorithm map neural network architectur ecient implement spite seemingli di erent underli neural network model implicitli similar classic statist pattern recognit method tabl riplei anderson al discuss relationship neural network statist pattern recognit anderson al point network statist amateur nn conceal statist neural network er advantag uni ed approach featur extract classi cation exibl procedur nding moder nonlinear solut tabl link statist neural network method statist pattern recognit arti cial neural network linear discrimin function perceptron princip compon analysi pca network posteriori probabl estim perceptron nonlinear discrimin analysi perceptron window classi er radial basi function network edit rule kohonen lvq scope organ remaind paper primarili review statist method pattern classi recent develop discuss close relat algorithm neural network literatur omit bodi literatur fuzzi classi cation fuzzi cluster opinion scope paper interest reader refer book fuzzi pattern recognit pal approach method summar tabl easi quick refer reader due space provid detail omit approach refer goal approach extens evalu demonstr practic trend idea literatur pattern recognit vast scatter numer journal disciplin appli machin neural signal imag quick scan tabl content issu ieee transact pattern analysi machin rst public januari reveal approxim paper deal pattern recognit approxim paper cover statist approach broadli categor reduct classi er design classi er combin error estim classi cation addit excel textbook duda hart fukunaga kittler lugosi bishop riplei mclachlan point excel survei paper written kanal earli root pattern time share research arti cial intellig percept larg part paper introduc number potenti applic pattern recognit interplai featur de nition applic domain knowledg edit stork press linear classi cation nonlinear techniqu base polynomi discrimin function potenti function call kernel time kanal wrote survei paper book pattern recognit publish kanal emphasi model design pattern recognit system discuss automat featur extract base distanc measur probabl densiti function result error bound kanal review larg section structur method pattern grammar comparison state pattern recognit eld kanal sixti todai number commerci pattern recognit system individu bui person machin print charact recognit isol spoken word made technolog develop result avail sensor power desktop comput eld pattern recognit larg review skip detail descript procedur model knowledg structur pattern start point review basic element statist method pattern recognit appar featur vector real world choic strongli uenc classi cation result topic probabilist distanc measur error bound import year dicult estim densiti function high featur space complex classi cation procedur result accuraci gain larg interest danger overtrain consequ complex classi er understood problem circumv complet resolv proper design classi cation procedur studi support vector machin discuss section larg contribut understand real world pattern scatter nonlinear subspac nonlinear procedur subspac approach reduct build classi er neural network er power tool wide accept singl procedur complet solv complex classi cation problem admiss capabl discrimin pattern portion featur space combin classi er heavili studi topic approach estim error rate classi er present section topic classi cation cluster cover section section identi es frontier pattern recognit goal part paper appreci newcom eld pattern recognit includ number exampl illustr perform algorithm realiz due space introduc concept complet reli background knowledg experienc reader statist pattern recognit statist pattern recognit successfulli design number commerci recognit system statist pattern pattern repres set view featur vector concept statist theori util establish boundari pattern class recognit system oper train classi cation fig role preprocess modul segment pattern interest remov normal oper contribut de ning compact pattern train featur modul featur repres input pattern classi er train partit featur space feedback path design optim preprocess featur strategi classi cation train classi er assign input pattern pattern class base measur featur preprocess train learn classif preprocess test pattern train pattern classif featur select featur measur figur model statist pattern recognit make process statist pattern recognit summar pattern assign categori base vector featur valu featur assum probabl densiti mass featur continu function condit pattern class pattern vector belong class view observ drawn randomli probabl function number includ maximum likelihood rule view case rule de ne boundari rule minim risk loss state assign input pattern class condit risk loss function incur decid true class posterior probabl case loss de ned eq condit risk condit probabl misclassi cation choic loss rule simpli ed call maximum posteriori assign input pattern class strategi util design classi er statist pattern depend kind inform densiti densiti complet speci optim rule design classi er densiti practic learn train pattern form densiti multivari paramet densiti vector covari parametr problem common strategi kind problem replac unknown paramet densiti function estim result classi er optim bayesian strategi situat requir addit inform form prior distribut unknown paramet form densiti oper nonparametr mode estim densiti function window directli construct boundari base train data neighbor perceptron view nonparametr method construct boundari dichotomi statist pattern recognit learn train versu learn train label train pattern repres categori pattern belong learn number class learn structur class dichotomi statist pattern recognit shown tree structur fig tree top bottom left inform system design diculti classi cation problem approach statist pattern recognit node tree fig attempt implement rule eld cluster analysi essenti deal make problem nonparametr learn mode cluster analysi number categori cluster speci task discov reason categor data cluster analysi algorithm techniqu visual project data refer exploratori data analysi method densiti theori learn learn nonparametr parametr nonparametr parametr mixtur resolv densiti estim rule rule cluster analysi unknown boundari construct approach geometr approach figur approach statist pattern recognit dichotomi statist pattern recognit base boundari obtain directli indirectli shown fig probabilist approach requir estim densiti function construct discrimin function boundari geometr approach construct boundari directli optim cost function point assumpt densiti approach exampl categori section matter classi cation rule train train sampl perform classi er depend number train sampl speci valu sampl goal design recognit system classifi futur test sampl di erent train sampl optim classi er maxim perform train set result desir perform test set gener abil classi er refer perform classifi test pattern train stage poor gener abil classi er attribut number featur larg rel number train sampl number unknown paramet classi er larg polynomi classi er larg neural classi er intens optim train set analog phenomenon tting regress free paramet overtrain investig theoret classi er minim appar error rate error train classic studi cover vapnik classi er capac complex provid good understand mechan overtrain complex classi er independ larg repres dichotomi dataset frequent measur capac chervonenki result prove interest consist classi er al practic result classi er complex initi limit bound requir number sampl conserv recent develop support vector machin result prove pitfal estim train set observ stage pattern recognit densiti classi er design sound solut independ dataset evalu order avoid necess independ test estim base rotat subset preserv di erent part data optim evalu exampl optim covari estim kernel discrimin analysi bootstrap design classi er error estim classi cation method illustr simpl experi data dataset arti cial dataset consist class bivari gaussian densiti overlap densiti dataset iri dataset consist pattern class iri iri iri dataset digit dataset consist handwritten numer extract collect dutch util map hundr pattern class total form binari imag charact repres term featur fourier coecient charact pro le pixel averag zernik morpholog featur detail dataset experi subset pattern test subset remain pattern train refer digit featur state peak phenomena perform classi er depend interrelationship sampl number classi er complex naiv techniqu featur space cell associ class label requir number train data point exponenti function featur dimens phenomenon term lead phenomenon discuss classi er design probabl misclassi cation rule number featur dataset uci machin learn repositori long densiti complet number train sampl arbitrarili larg repres underli observ practic ad featur degrad perform classi er number train sampl design classi er small rel number featur paradox behavior refer peak phenomenon simpl explan phenomenon commonli parametr classi er estim unknown paramet plug true paramet densiti xed sampl number featur number unknown reliabl paramet estim perform result classi xed sampl degrad number featur trunk provid simpl illustr reproduc classi cation problem equal prior multivari gaussian distribut ident covari matrix class vector class compon note featur statist independ discrimin power success featur monoton rst featur provid maximum discrimin class paramet densiti rest make distinct peak phenomenon trunk consid vector optim rule loss construct boundari probabl error function express pp easi verifi lim perfectli discrimin class arbitrarili number vector unknown label train sampl trunk found maximum likelihood estim rule optim probabl error function written dz trunk show lim impli probabl error approach maximum problem demonstr unlik case arbitrarili number featur paramet densiti estim nite number train sampl practic implic system design select small number salient featur confront limit train set commonli classi includ su er exact relationship probabl misclassi number train number featur true paramet densiti dicult guidelin suggest ratio sampl size gener accept ten time train sampl class number featur good practic follow classi er design complex classi larger ratio sampl size avoid reduct main reason pattern number small measur cost classi cation accuraci limit salient featur set simpli es pattern classi er built select result classi er faster memori state small number featur allevi number train sampl limit reduct number featur lead loss discrimin power lower accuraci result recognit system watanab theorem support care choic make arbitrari pattern similar encod sucient larg number redund featur import make distinct featur select featur extract term featur select refer algorithm select subset input featur set method creat featur base transform combin origin featur set call featur extract algorithm term featur select featur extract interchang literatur note featur extract featur featur extract data princip compon discrimin extract featur low discrimin abil discard choic featur select featur extract depend applic domain speci train data featur select lead save measur cost featur select featur retain origin physic interpret retriev featur import understand physic process gener pattern find featur goal transform featur gener featur extract provid discrimin abil subset featur linear nonlinear combin clear physic mean obtain project multivari data pattern permit visual examin data graphic techniqu exist visual observ multivari object depict pattern pictur number featur repres pattern cartoon face facial nose mouth ey made correspond individu featur fig show face vector iri iri iri class iri data pattern note figur face vector iri iri iri face iri di erent face impli categori separ remain categori featur space evid plot data fig main issu reduct choic criterion function commonli criterion classi cation error featur subset classi cation error reliabl estim ratio sampl size number featur small addit choic criterion determin reduc featur space answer question notion data essenti determin pattern adequ subspac pattern smooth curv irrespect note linear global properti data involv number signi eigenvalu covari matrix data algorithm estim subspac identi ed easili identi ed brie discuss commonli method featur extract featur select featur extract featur extract method determin subspac linear nonlinear origin featur space linear princip compon factor linear discrimin project pursuit wide pattern recognit featur extract reduct linear featur extractor princip compon analysi comput largest eigenvector covari matrix pattern linear transform de ned pattern deriv pattern matrix linear transform column eigenvector pca express featur largest ectiv approxim data linear subspac squar error criterion project pursuit independ compon analysi distribut reli properti data ica successfulli separ extract linear featur combin de ne independ sourc sourc gaussian distribut pca linear featur extract discrimin analysi categori inform pattern extract discriminatori featur discrimin separ replac total covari matrix pca gener separ measur fisher result nding eigenvector product scatter sw scatter criterion densiti base distanc densiti estim wai de ne nonlinear featur extract techniqu method directli relat pca call kernel pca basic idea kernel pca rst map input data featur space typic nonlinear function polynomi perform linear pca map space space high dimens avoid comput map kernel pca emploi mercer kernel dot kernel space ned metric exampl mercer kernel includ polynomi gaussian kernel kx yk normal pattern matrix pattern matrix space linear pca space solv eigenvector correl matrix call kernel matrix kernel rst eigenvector obtain de ne transform size repres desir number pattern map repres rel train set measur featur valu note complet eigenvector kernel kernel linear pca set eigenvector repres origin featur space kernel function chosen applic open issu scale nonlinear featur extract techniqu aim repres dataset dimens distanc matrix origin featur space preserv faithfulli project space stress function measur perform map popular criterion stress function introduc problem md give explicit map place pattern map comput train set repeat map techniqu investig address de cienci rang linear interpol train neural network rede ne md algorithm directli produc map test pattern neural network er integr procedur featur extract classi output hidden layer interpret set featur present output layer classi cation network serv featur extractor network le call share weight layer fact lter extract featur imag lter tune maxim classi cation perform neural network directli featur extract mode fig show architectur network pca subspac neuron linear transfer function figur network nding subspac nonlinear connect network input number featur input forc output layer reconstruct input space hidden layer node hidden layer captur rst princip compon nonlinear layer sigmoid hidden unit includ fig nonlinear subspac found middl layer call bottleneck nonlinear limit size addit layer nonlinear pca network er power tool train describ nonlinear subspac oja show network ica map kohonen map nonlinear featur extract neuron arrang neuron connect input unit weight connect neuron form weight vector pattern present network random order winner weight vector closest input vector rst identi ed neuron neighborhood ned winner updat weight vector move input vector train weight vector neighbor neuron grid repres input pattern close origin featur space map form grid plot origin grid connect stress densiti train data som er map spatial interpret featur extract som di erent learn vector quantiz neighborhood de ned lvq tabl summar featur extract project method discuss note adject nonlinear map nonlinear tabl featur extract project method method properti comment princip compon linear eigenvector base analysi good gaussian data linear discrimin linear pca classi limit analysi compon eigenvalu project pursuit linear interact exploratori analysi independ compon linear blind sourc analysi distribut sourc kernel pca nonlinear kernel replac product pattern vector pca network linear iter neural network linear transfer function hidden layer nonlinear pca linear neural network possibl ica iter nonlinear nonlinear bottleneck network hidden associ network iter nonlinear map optim nonlinear input target nonlinear iter poor sampl size scale project visual map iter base grid neuron featur suitabl extract space low function origin criterion function fig show di erent project iri dataset fig show linear fig depict nonlinear map fisher map make categori main reason map exhibit separ categori featur select problem featur select de ned set select subset size lead smallest classi cation error figur map iri dataset iri iri iri fisher kernel pca order polynomi kernel interest appli featur select method due larg number featur encount comput di erent sensor concaten form featur vector larg number integr multipl data sensor data model di erent model paramet serv paramet di erent model pool yield featur vector set cardin repres desir number featur select subset featur select criterion function set repres assum higher featur natur choic criterion function denot classi cation error criterion function make featur select procedur depend speci classi er size train test set straightforward approach featur select problem requir examin subset size select subset largest number subset grow make exhaust search impract moder valu cover van show sequenti featur select procedur produc optim subset show order classi cation error featur subset order optim featur subset approxim million subset evalu term class monoton criterion featur select method avoid exhaust search base branch bound algorithm procedur avoid exhaust search intermedi result obtain bound nal criterion kei algorithm monoton properti criterion function featur subset perform featur subset improv featur ad commonli criterion function satisfi monoton properti argu featur select typic execut time algorithm critic optim featur subset gener true featur set moder recent data mine document classi involv thousand featur comput requir featur select algorithm extrem import number featur subset evalu easili prohibit larg featur number suboptim select techniqu essenti tradeo optim select subset comput ecienc tabl list featur select method literatur rst method tabl optim subset strategi suboptim due fact pair featur singl featur gener good larger featur set necessarili includ good small set simpl method select individu featur fail dramat rst step larg featur set hundr select advanc method featur depend account oper evalu grow featur set evalu shrink featur set simpl sequenti method tabl featur select method method properti comment exhaust search evalu subset optim feasibl moder larg valu search optim search set provid criterion function tion featur subset sati es monoton complex optim subset algorithm exponenti individu featur evalu featur select individu lead optim subset featur sequenti forward select select singl featur featur add featur time combin attract select subset select featur maxim size examin function ble subset sequenti backward select start featur featur delet featur brought back optim time requir comput sequenti forward select select enlarg featur subset avoid problem featur forward select set encount sf delet featur sb select backward select valu sequenti forward float search gener close optim solut sequenti backward valu comput cost float search determin automat updat dynam sf add featur time sophist techniqu strategi sequenti float search method backtrack long improv compar previou featur set size larg featur select method perform straight sequenti sf sb method set featur remain hidden number featur set easili factor addit search user select evalu featur select method classi cation error featur subset evalu ectiv classi er method error estim di erent classi er di erent method estim error rate lead di erent featur subset select ferri al jain compar featur select algorithm term classi cation error run time gener sequenti forward oat search method perform algorithm demand lower comput resourc al adapt version algorithm shown superior perform featur select method tabl classi er feed forward network pattern classi method simultan determin optim featur subset optim network classi er train remov salient node input hidden reduc network train remov salient node procedur repeat desir classi cation error size network achiev prune input node remov featur reliabl featur select result ratio number train sampl number featur mahalanobi distanc featur select criterion depend averag class covari matrix estim small sampl size situat result optim featur subset di erent optim subset obtain covari matrix jain illustr phenomenon classi cation problem involv gaussian densiti data trunk demonstr qualiti select featur subset small train set improv train set size pattern train algorithm select subset featur includ featur common ideal subset featur densiti pattern train procedur select subset wrong featur fig show featur select procedur oat search techniqu pca featur digit dataset di erent train set size test set size xed pattern select featur space rang classi er design assum gaussian densiti equal covari matric evalu test set featur select criterion minimum mahalanobi distanc small sampl size case train phenomenon observ optim number featur equal number train pattern featur safe side gener classi er featur select classi cation procedur proper classi er design number approach choic classi er dicult problem base classi happen featur classif error train pattern train pattern figur classi cation error versu number featur oat search techniqu user identifi di erent approach design classi er simplest intuit approach classi er design base concept pattern similar assign class good metric establish de ne pattern classi ed templat match minimum distanc classi er prototyp class choic metric prototyp crucial success approach nearest select prototyp simpl pattern class repres singl prototyp vector train pattern class advanc techniqu comput prototyp vector quantiz learn vector quantiz data reduct method neighbor rule edit straightforward rule conveni benchmark classi er provid reason classi cation perform applic classi er requir ed paramet distanc metric nearest euclidean distanc commonli classi cation result implement independ classi cation classi er expect desir invari properti shift invari charact charact chang charact locat ect classi cation preprocess scheme normal input pattern charact repres multipl posit featur space posit de ne subspac invari subspac correspondingli templat match nearest classi er view nding nearest subspac main concept design pattern classi er base probabilist approach optim rule loss assign pattern class maximum posterior probabl rule ed account cost di erent type misclassi cation class condit rule optimum classi prior loss function rule lower risk expect loss probabl prior class probabl equal loss tion rule maximum likelihood rule coincid empir estim densiti place true densiti densiti estim parametr nonparametr commonli parametr model multivari gaussian distribut continu binomi distribut binari distribut featur critic issu gaussian distribut assumpt made covari matric covari matric di erent class assum call linear boundari covari matric assum di result call quadrat boundari addit commonli maximum likelihood estim covari regular techniqu obtain robust estim small sampl size situat estim minim bia logist classi er base maximum likelihood suit mix data type classi er max posterior probabl pattern vector class denot set unknown denot train sampl class discrimin function paramet posterior probabl deriv call logist function linear eq easili optim equat estim class condit posterior probabl optim train set relationship discrimin function posterior probabl deriv function posterior probabl assum optim approxim solv eq result eq nonparametr neighbor rule classi er densiti replac estim window similar give di erent result practic essenti free paramet number neighbor smooth paramet optim estim error rate classi er requir comput distanc test pattern pattern train set conveni avoid larg number comput systemat reduct train vector quantiz techniqu possibl combin optim metric kernel possibl method ecient larg categori classi er construct boundari approach fig directli optim error criterion approach depend chosen classi er type approxim classi er asymptot drive forc train procedur minim criterion appar classi cation error squar error classi er output preset target classic type classi er fisher linear discrimin minim mse classi er output desir label separ hyperplan iter updat function distanc misclassi ed pattern hyperplan sigmoid function combin mse neural net call perceptron show behavior similar linear classi er import note neural network lead di erent classi er depend train hidden layer perceptron nonlinear danger overtrain classi er number network paramet layer neuron layer ad regular neural network regular mechan built slow train combin earli stop regular method includ addit weight decai bayesian learn interest characterist perceptron addit classifi input provid con denc classi approxim posterior probabl con denc valu reject test pattern case doubt radial basi function gaussian suit sigmoid transfer function handl outlier radial basi train di erent perceptron gradient search hidden neuron ad preset perform reach classi cation result compar situat class condit densiti repres weight sum gaussian gaussian section special type classi er tree train iter select individu featur salient node tree criteria featur select tree gener includ inform node fisher criterion classi featur test pattern featur select implicitli commonli tree classi er binari natur singl featur result boundari parallel featur ax tree suboptim applic main advantag tree classi possibl interpret rule term individu featur make tree attract interact expert neural tree easili avoid prune stage tree classi cation system cart public domain benchmark interest recent develop classi er design introduct support vector classi er vapnik studi author primarili classi er optim criterion width margin empti area boundari de ned distanc nearest train pattern call support nalli de ne classi cation function number minim maxim margin function problem deriv support vector classi er written kernel function pattern classi train pattern support vector set subset train label object paramet optim train min constrain train set diagon matrix label matrix store valu kernel function pair train pattern set slack variabl class control penalti weight overlap equat dual form maxim margin penalti valu support vector support vector nalli ad hoc charact penalti term comput complex train procedur quadrat minim drawback method train algorithm literatur includ chunk osuna decomposit method sequenti minim optim kernel function kernel section select simpl dot product input pattern member support result linear classi er nonlinear result polynomi classi er gaussian radial basi function import advantag support vector classi er er possibl train nonlinear classi er space small train set larg train typic select small support set design classi minim comput requir test support vector classi er understood term tradit templat match techniqu support vector replac prototyp main di erenc class boundari boundari de ned minimum distanc possibl combin distanc summar commonli classi er tabl entir famili classi er user modifi paramet criterion function classi er tabl classif method method properti comment templat match assign pattern similar templat metric templat suppli procedur includ nonlinear scale depend nearest classi er assign pattern nearest class train fast scale depend subspac method assign pattern nearest class normal subspac subspac invari scale depend neighbor rule assign pattern class train robust nearest train pattern slow scale depend neighbor rule assign pattern major class asymptot scale nearest neighbor slow test perform optim assign pattern class yield simpl classi er maximum estim posterior gaussian tive densiti estim error logist classi er maximum likelihood rule linear classi iter posterior mal famili di erent distribut ti suitabl mix data type classi er rule asymptot scale estim perform slow test optim kernel fisher linear discrimin linear classi er mse simpl similar gaussian distribut ident covari matric binari tree find set threshold iter train overtrain sequenc featur fast test perceptron iter optim linear sensit train er duce con denc valu perceptron iter mse optim sensit train slow neural layer perceptron nonlinear classi cation sigmoid transfer produc con denc ing regular radial basi network iter mse optim sensit train neural network ear classi cation produc layer neuron con denc overtrain transfer function robust outlier support vector classi er maxim margin scale slow class select minimum overtrain support vector good gener perform exist classi cation problem choic extens comparison larg set classi er di erent problem statlog project show larg variabl rel prove thing optim classi cation rule di erenc boundari obtain di erent classi er illustr fig dataset problem gaussian note small isol area fig rule neural network classi er fig show region seemingli data region probabl small number hidden layer cost poorer class separ larger hidden layer result overtrain illustr fig network neuron hidden layer test set error train set error initi point epoch test set error start train error nal classi er epoch adapt separ isol pattern contribut gener abil classi er combin reason combin multipl classi er solv classi cation problem list design access number di erent classi develop di erent context di erent epoch mean entir train data figur boundari bivari gaussian distribut pattern class classi er neural network hidden layer neuron region class found classifi point featur space problem identi cation person handwrit singl train set collect di erent time di erent environ train set di erent featur di erent classi er train data di er global show strong local di erenc classi er region featur space perform number train epoch classif error train set error test set error figur classi cation error neural network classi er hidden unit train rule epoch class pattern test set error base independ set pattern classi er neural network show di erent result di erent initi due random inher train procedur select network discard combin advantag attempt learn data di erent featur di erent train di erent classi cation method di erent train result set classi er output hope improv classi cation accuraci set classi er problem combin function xed combin optim set input classi section larg number combin scheme literatur typic combin scheme consist set individu classi er combin combin result individu classi er make nal individu classi er invok interact determin architectur combin scheme combin scheme di er characterist select individu classi er scheme combin multipl classi er group main categori cascad serial hierarch parallel individu classi er invok result combin combin combin scheme literatur belong categori gate parallel output individu classi er select weight gate devic combin cascad individu classi er invok linear sequenc number class pattern gradual reduc classi er sequenc invok sake inaccur cheap classi er comput measur consid accur classi er hierarch individu classi er combin similar tree classi er tree complex classi er demand larg number featur advantag architectur high ecienc exibl exploit discrimin power di erent type featur basic build complic classi er combin system select train individu classi er classi er combin individu classi er larg independ di erent train resampl techniqu rotat bootstrap arti cialli creat di erenc exampl stack bag boost output individu classi er train classi er nal made base output stack classi er conjunct output individu classi er di erent dataset creat bootstrap version origin dataset combin xed rule averag boost resampl techniqu gener sequenc train data set distribut train set sequenc pattern misclassi ed earlier classi er sequenc individu classi er train hierarch learn discrimin complex region featur space origin algorithm schapir show combin weak classi er perform slightli random achiev error rate arbitrarili small train data cluster analysi separ individu class train set subclass simpler classi er combin linear result build di erent classi er di erent set train di erent featur set explicitli forc individu classi er independ inform random subspac method combin individu classi er combin call combin combin distinguish requir output individu classi er averag count train trainabl trainabl combin lead improv static combin cost addit train requir addit train data combin scheme adapt combin evalu individu classi er depend input pattern combin treat input pattern adapt combin scheme exploit detail error characterist individu classi er exampl adapt combin includ adapt weight associ mixtur local expert hierarch mle di erent combin expect di erent type output individu classi er xu al group expect measur con abstract con denc classi er output numer class indic belief probabl input pattern belong class rank classi er assign rank class highest rank rst choic rank isol highest rank necessarili high con denc classi cation abstract classi er output uniqu class label class label class equal con denc level convei abstract level amount inform made tabl list number repres combin scheme characterist mean exhaust list tabl classifi combin scheme scheme architectur trainabl adapt comment vote parallel abstract assum independ classi er median parallel con denc assum independ denc estim max parallel con denc assum independ featur gener parallel con denc consid error correl ble adapt weight parallel con denc explor local stack parallel con denc good util train data count parallel rank convert rank con denc logist regress parallel rank convert rank con denc con denc class set reduct parallel rank ecient cascad con denc parallel rank fuse con con denc denc fuzzi integr parallel con denc fuse con denc mixtur local gate parallel con denc explor local expert joint optim hierarch mle gate parallel con denc hierarch hierarch associ switch parallel abstract joint optim bag parallel con denc compar classi er boost parallel abstract improv hierarch sensit compar classi er random subspac parallel con denc compar classi er neural tree hierarch con denc handl larg number class theoret analysi combin scheme larg number studi shown classi er combin improv recognit accuraci exist theoret explan result explan appli simplest combin scheme restrict assumpt rigor theori classi er combin present kleinberg popular analysi combin scheme base dilemma regress classi cation error bia term varianc term unstabl classi er classi er high complex nearest neighbor classi neural low larg varianc stabl classi er classi er low capac low varianc larg bia tumer ghosh provid quantit analysi improv classi cation accuraci combin multipl neural network show combin network linear combin order statist combin reduc varianc actual boundari optimum boundari absenc network reduct ad error directli proport reduct varianc linear combin neural network independ ident distribut error distribut reduc varianc factor rst result sound remark approach varianc reduc realist iid assumpt break larg perron cooper show independ assumpt mi erenc desir output actual averag output neural network reduc squar error factor compar averag mse neural network larg mse ensembl made arbitrarili small mention independ assumpt break perron cooper gener optim linear combin squar error gener weight deriv error correl matrix neural network shown mse gener ensembl smaller mse neural network ensembl result base assumpt row column error correl matrix linearli independ error correl matrix reliabl estim assumpt break kittler al develop common theoret framework class combin scheme individu classi er distinct featur estim posterior probabl input pattern introduc sensit analysi explain sum rule outperform rule class show sum rule sensit error individu classi er estim posterior probabl sum rule combin di erent estim posterior result di erent classi er initi introduct product rule combin prefer independ result estim densiti di independ featur set introduct schapir al di erent explan ectiv vote method explan base notion di erenc combin score correct class highest combin score incorrect class establish gener error bound tail probabl margin distribut train data term function complex singl classi er combin classi er demonstr boost algorithm ectiv improv margin distribut nding similar properti support vector classi show import train pattern margin de ned area overlap class condit densiti illustr characterist number di erent classi er combin rule digit classi cation problem section classi er experi design matlab optim data set di erent featur set digit dataset discuss section enabl illustr perform classi er combin rule di erent classi er di erent featur set con denc valu output classi er directli base posterior probabl logist output function discuss section output obtain version discrimin fisher linear discrimin support vector classi er classi total discrimin comput class combin set remain class test pattern classi ed select class discrimin highest con denc classi er tabl rule assum normal distribut di erent equal covari matric nearest binari tree maximum puriti criterion earli neural network matlab neural network hidden layer consist neuron linear quadrat support vector classi er number neighbor rule smooth paramet classi er optim classi cation result error estim train set combin classi product vote rule train classi er train set individu classi er classi er combin classi er list tabl train train pattern featur set test test pattern result classi cation error featur result classi er print bold individu classi er singl featur set combin ve combin rule nearest vote rule classi er featur set yield error underlin combin result perform individu classi er featur set output classi er classi er combin scheme featur set combin combin rule vote rule tree classi er yield error underlin combin result individu result tree block bottom tabl error rate classifi classifi combin scheme featur set section combin rule classi er med prod vote nm combin rule quadrat linear nearest fisher dec tree median product vote nearest part tabl present combin featur classi er combin scheme separ featur set classi perform data neural network classi er provid poor optim due train session simpl classi er give good perform di erent classi er vari substanti di erent featur set due small train set larg featur classi er outperform linear gener perform show svc classi er nonlinear solut overtrain risk classi er combin train classi er combin rule xed rule result obtain train combin nearest method combin di erent classi er featur set slightli improv individu classi cation result combin rule dataset vote product rule behav di erent classi er featur set provid independ con denc valu combin result obtain classi er di erent featur set frequent outperform individu classi er result improv substanti case tree product rule perform surprisingli similar combin neural network classi er combin rule minimum maximum sensit poorli train individu classi er worthwhil observ combin neural network train combin rule cation error comparison xed rule cation error error estim classi cation error simpli error ultim measur perform classi er compet classi er evalu base error probabl perform measur includ cost measur featur comput requir rule easi de ne probabl error term dicult obtain express simpl case multivari gaussian densiti unequ covari write simpl analyt express error rate analyt express error rate studi behavior function number true paramet valu number train prior class probabl consist train rule approach error sampl size famili distribut tight bound error obtain nite sampl size unknown bound imposs error rate recognit system estim sampl split train test set classi er rst design train evalu base classi cation perform test sampl percentag misclassi ed test sampl estim error rate order error estim reliabl predict futur classi cation train set test set sucient train sampl test sampl independ requir independ train test sampl overlook practic import point mind error estim classi function speci train test set random variabl classi number test sampl total misclassi ed shown probabl densiti function binomi distribut consist estim random con denc interv con denc interv con denc shrink number test sampl plai import role compar compet classi total test sampl misclassifi sampl classi er con denc interv true error probabl classi er con denc interv perform superior analysi pessimist due posit correct error estim base test set sampl split form train test train set result classi er robust low gener abil test set con denc estim error rate low method commonli estim error rate summar tabl method di er util sampl train test set number sampl extrem larg method lead estim error rate method optimist estim error bia smaller smaller ratio number train sampl class featur vector larger larger good guidelin divid sampl train test fukunaga argument favor sampl test classi er design classi er matter data split train test clear di erent random split speci ed size train test result di erent error estim tabl error estim method method properti comment method data optimist train train ratio sampl test set size small holdout method half data train pessimist remain data ferent partit give di train test set ent estim independ method classi er design estim sampl evalu larg larg comput remain repeat requir di erent time di erent train set classi er design size rotat holdout estim lower bia cross divid holdout method cheaper valid sampl disjoint implement method set train remain subset test bootstrap method gener bootstrap sampl bootstrap estim lower set size sampl varianc estim error rate de ned small sampl bootstrap size situat sampl fig show classi cation error linear classi er digit dataset function number train pattern test set error gradual approach train set error number train sampl larg di erenc error rate train pattern class bia error estim reduc enlarg train set curv gure repres averag experi train set size randomli test set pattern xed rotat method version number train pattern class classif error test set error train set error figur classi cation error linear classi er covari function number train sampl test set train set digit dataset approach main disadvantag small sampl size sampl train classi er extrem case cross hold method su er larg bia larg overcom bootstrap method estim error rate bootstrap method resampl pattern replac gener number data set size train set train set estim bia de ne call bootstrap estim error rate result shown bootstrap estim outperform cross valid estim estim error rate pattern recognit adequ perform classi er singl measur error rate system problem evalu match di erent relat error rate interest accept rate ratio number pair di erent incorrectli match system total number match attempt reject rate ratio number pair match system total number match attempt match system tune set threshold match oper desir vice versa receiv oper characterist curv plot versu permit system design assess perform recognit system oper point roc perform measur equal error rate system fig show roc curv digit dataset linear classi er train pattern class exampl roc analysi combin classi er featur select addit error perform measur classi er reject rate test pattern fall boundari class rule correctli classifi classi cation made low con denc altern reject reject rate error accept figur roc curv linear classi er digit dataset doubt pattern assign categori decid reject test reject option reject pattern maximum posteriori probabl larger higher reject rate invok reject option reduc error larger reject smaller error rate relationship repres curv set desir oper point classi er fig show curv digit dataset linear classi er curv monoton reject pattern reduc error rate good choic reject rate base cost reject incorrect appli reject rate classif error figur curv linear classi er digit dataset classi cation applic pattern extrem dicult reliabl label train sampl true categori applic classi cation remot order obtain inform speci site pixel visit categori extract geograph inform classi cation refer situat object construct boundari base unlabel train data classi cation data cluster gener label varieti procedur design natur base measur perceiv similar pattern categori label inform sourc data uenc interpret format cluster classi cation cluster dicult problem data reveal cluster di erent shape size fig compound problem figur cluster di erent shape size number cluster data depend resolut ne view data cluster detect delin region high densiti pattern compar background number function de nition cluster pattern cluster similar pattern belong di erent cluster consist high densiti point separ cluster low densiti point function de nition easi oper de nition cluster challeng select measur similar de ne cluster data context depend cluster analysi import techniqu consist cluster algorithm organ larg amount data constitut overwhelm reason applic data mine inform retriev imag segment signal compress code machin learn hundr cluster algorithm literatur cluster algorithm continu algorithm base popular cluster iter partit cluster agglom hierarch cluster hierarch techniqu organ data nest sequenc group displai form tree partit algorithm attempt obtain partit minim scatter maxim scatter optimum solut examin partit pattern cluster feasibl heurist reduc optim partit cluster techniqu frequent hierarch techniqu pattern recognit restrict coverag partit method recent studi cluster analysi suggest user cluster algorithm issu cluster algorithm cluster dataset exist data subject test cluster tendenc appli cluster valid cluster gener cluster algorithm user cluster algorithm dataset issu data data cluster valid import choic cluster strategi problem partit cluster formal state pattern metric determin partit pattern pattern cluster similar pattern di erent cluster speci ed cluster global adopt global repres cluster prototyp assign pattern cluster similar prototyp local criterion form cluster util local structur data cluster form identifi region pattern space assign pattern nearest neighbor cluster partit cluster techniqu implicitli assum featur vector pattern view metric space featur nomin ordin euclidean distanc cluster center hierarch cluster method appli wong wang cluster algorithm data techniqu conceptu cluster learn exampl pattern repres symbol descriptor object group pattern conceptu simpl class concept de ned term attribut pattern arrang hierarchi class concept brie summar popular approach partit cluster mixtur decomposit cluster method view case mixtur decomposit point di erenc cluster criterion cluster algorithm cluster algorithm implement cluster criterion larg number cluster minim criterion di er choic algorithm paramet cluster algorithm list tabl tabl cluster algorithm algorithm properti comment identi es initi modi ed cluster center addit cluster ter creat ing exist cluster outlier ecient detect provid fuzzi similar initi cluster pattern center cluster membership cluster function minimum span tree cluster form delet provid de nition inconsist edg mst inconsist edg data mutual neighborhood comput mutual neighborhood neighborhood pair neighbor neighbor hierarch cluster algorithm cluster easili chain accept proxim output heurist cut tree tree cluster form cluster maxim connect subgraph pattern hierarch cluster algorithm cluster tend accept proxim small compact combin output nice layer cluster tree hierarchi ter maxim complet heurist form cluster graph pattern mixtur decomposit pattern assum form number underli ly popul densiti popul assum paramet estim estim number criteria unlabel data section cluster commonli partit cluster strategi base criterion gener object obtain partit xed number minim set pattern dimens partit cluster fc cluster pattern pattern cluster de ned centroid pattern belong cluster cluster sum squar euclidean distanc pattern cluster center call variat entir cluster cluster sum object cluster method partit cluster minim xed result partit refer minimum varianc partit gener algorithm iter partit cluster method algorithm iter partit cluster step select initi partit cluster repeat step cluster membership stabil step gener partit assign pattern closest cluster center step comput cluster center centroid cluster step repeat step optimum criterion function found step adjust number cluster merg split exist cluster remov cluster step algorithm detail step algorithm suppli user paramet implicitli hidden comput program detail crucial success program big frustrat cluster program lack guidelin initi updat adjust number stop criterion simpl partit cluster algorithm ecient surprisingli good result cluster shape featur space mahalanobi distanc de ning squar error eq algorithm detect shape cluster numer attempt made improv perform basic algorithm incorpor fuzzi criterion function result fuzzi genet simul determinist tabu search optim result partit map neural network possibl ecient implement enhanc algorithm demand requir addit ed paramet gener guidelin al show combin algorithm enhanc cluster algorithm distribut comput network workstat cluster hundr thousand pattern minut interest note seemingli di erent concept partit cluster lead essenti algorithm easi verifi gener lloyd vector quantiz algorithm commun compress domain algorithm vector quantiz combin encod decod vq consist encod map input alphabet channel symbol set decod map channel symbol set output alphabet distort measur speci es cost optim quantiz minim averag distort size constraint problem vector quantiz pose cluster number cluster size output goal quantiz partit featur space minim averag distort squar input pattern vector quantiz wide number compress code speech waveform imag symbol output alphabet cluster center transmit entir signal vector quantiz ecient tool densiti estim approach mixtur gaussian kernel cluster estim probabl densiti train sampl major issu vq select output alphabet size number minimum descript length principl select paramet section version vq call learn vector quantiz mixtur decomposit finit mixtur exibl power probabilist model tool statist pattern main mixtur de ning formal approach classi cation reason mixtur adequ model situat pattern produc set altern sourc mind strict adher interpret mixtur class model repres arbitrarili complex probabl densiti function make mixtur suit repres complex densiti learn scenario refer finit mixtur featur select tool basic de nition scheme gener random sampl random probabl function time sampl randomli probabl sampl chosen sourc random variabl de ned compound gener mechan nite mixtur probabl function call assum compon function multivari gaussian fit mixtur model set observ fy consist estim set mixtur paramet describ data mixtur built di erent type major literatur gaussian mixtur fundament issu mixtur tting estim paramet de ning mixtur estim number compon rst standard answer algorithm mild converg maximum likelihood estim mixtur author advoc markov chain method question techniqu summar section note output mixtur decomposit good valid assum compon distribut em algorithm algorithm interpret observ incomplet miss part set label fz miss variabl compon gener presenc written log em algorithm proce altern appli comput condit expect complet current paramet eq linear miss mixtur reduc comput condit expect miss updat paramet arg max mix gaussian consist vector covari matrix updat weight version weight standard ml estim main diculti em mixtur model current research local make critic depend possibl converg point boundari paramet space unbound likelihood approach covari arbitrarili close estim number compon ml criterion estim number mixtur compon maxim likelihood function make useless model select criterion instanc identi abil problem classic hypothesi test regular condit met altern approach summar approach xed em algorithm obtain sequenc paramet estim rang valu min max estim de ned minim cost arg min min max cost function includ maxim function addit term role penal larg valu obviou choic class minimum descript length criterion model select criteria schwarz bayesian infer criterion minimum messag length inform criterion scheme approach techniqu closer stochast algorithm method previou paragraph stochast approach gener involv markov chain mont carlo sampl intens em di erent implement model select criteria estim bayesian sampl full posteriori distribut includ unknown formal techniqu demand pattern recognit applic estim true point figur mixtur decomposit fig show mixtur select modi ed mdl criterion data consist pattern distribut gaussian compon vector di erent covari matric cloud point insid cloud point level curv contour constant mahalanobi true underli mixtur estim mixtur data note cluster algorithm identifi due substanti overlap compon discuss earli stage statist pattern recognit core bayesian rule deriv linear quadrat discrimin densiti error estim due limit comput power statist pattern recognit emploi simpl techniqu appli problem earli statist pattern recognit experienc rapid growth frontier expand direct simultan rapid larg driven forc interact collabor di erent includ neural machin comput biologi ort foster techniqu enrich tradit statist pattern recognit paradigm preval fast larg memori storag advanc comput technolog made implement complex search optim algorithm feasibl decad ago tackl real world pattern recognit problem involv million sampl high space thousand emerg data mine document taxonomi creation mainten emerg applic brought challeng foster renew interest statist pattern recognit research ad approach successfulli solv pattern recognit problem predict concept neural inspir biolog neural directli treat principl statist pattern recognit frontier pattern recognit tabl summar topic frontier pattern recognit tabl fundament research problem statist pattern recognit remain forefront eld continu grow model select import issu avoid topic continu research interest common practic model select reli model select base perform valid set valid set method fulli util preciou data train undesir train data set small avoid number model select scheme includ bayesian method minimum descript length inform criterion margin likelihood regular scheme incorpor prior knowledg model structur paramet structur risk minim base notion vc dimens model select model perform bound gener method reduc complex search model complex measur evalu model set ed model assumpt paramet made order simplifi complex evalu model select base stochast complex appli featur select learn learn prune tree number cluster automat determin mixtur model em algorithm section popular approach densiti estim cluster due comput power todai recent number concept techniqu introduc maximum margin object introduc context support vector machin base structur risk minim theori classi er larg margin separ class small vc yield good gener perform success applic svm demonstr superior object function found boost algorithm improv margin distribut maximum margin object consid special regular cost regular margin class regular cost weight decai weight context neural network due introduct linear quadrat program optim techniqu extens studi pattern classi cation quadrat program credit lead nice properti boundari fulli speci ed boundari linear program norm margin yield small set featur optim solut obtain topic local boundari learn receiv lot attent primari emphasi pattern boundari di erent class construct modifi boundari boost algorithm variat misclassi ed subsampl higher probabl correctli classi ed pattern form train set train subsequ classi er combin local expert relat local expert learn local boundari accur global method classi er combin ne boundari varianc respect boundari lead improv recognit accuraci sequenti data real world speech handwrit sequenti pattern recognit import topic pattern recognit hidden markov model popular statist tool model recogn sequenti speech data larg number variat enhanc hmm literatur includ hybrid hmm neural weight markov switch switch model growth sensor technolog comput power enrich avail data wai real world object repres measur sampl high rate physic object nite measur gener highli correl explain model spatial spectral correl markov structur subspac approach compress data physic improv classi cation accuraci simultan learn requir train sampl label true categori collect larg amount label data small amount label data larg amount unlabel data make unlabel data train classi er import problem svm extend perform learn invari pattern recognit desir charact face recognit earli research statist pattern recognit extract invari featur turn dicult task activ design invari recognit method requir invari featur exampl nearest neighbor classi er tangent distanc deform templat match approach achiev invari small amount linear transform nonlinear deform intens al algorithm minim deriv classi er output respect distort improv invari properti classi er select distort make train classi er ecient conclud remark watanab wrote prefac book entitl pattern recognit disciplin easi form summari view newest develop eld harder vision futur tabl frontier pattern recognit topic exampl comment model select gener bayesian make full data margin structur train risk mixtur model em cluster densiti estim soft algorithm mean cluster object function maximum margin provid low vc dimens cation cost good gener optim method quadrat lead support linear program featur select local boundari learn mixtur local focu boundari pattern expert sequenti pattern recognit hidden markov model successfulli appli speech recurr network handwrit recognit deform templat invari local distort tangent distanc independ compon analysi blind sourc featur extract statist independ extract compon combin multipl classi er tabl improv recognit accuraci emerg applic data mine document larg high imag mix data miss data model select biometr recognit handwrit acknowledg author anonym dr tin mario critic construct comment suggest author indebt dr kevin care review student valuabl feedback author indebt colleagu valuabl assist prepar dick de scott vincent dr pavel dr patrick flynn refer mm network maximum likelihood signal vol pp statist model identi ieee tran automat vol pp analysi learn algorithm blind sourc neural vol pp handbook vol pp north neurocomput direct mit cambridg bound error ieee tran pattern analysi machin vol pp tight upper lower bound bayesian probabl ieee tran pattern analysi machin vol pp reason cluster prentic bajcsi elast comput vision graphic imag vol pp rissanen minimum descript length principl code ieee tran inform vol pp oct bell approach blind neural vol pp model sequenti neural comput vol pp support vector proc neural inform process bernardo bayesian john wilei pattern recognit fuzzi object function plenum fuzzi model pattern method search structur ieee sk js cluster inform ieee transact part vol pp neural network pattern clarendon blum relev featur exampl machin learn arti cial vol pp borg modern springer machin vol pp classi cation regress tutori support vector machin pattern data mine knowledg vol pp signal statist proc vol pp lattic conceptu cluster system applic machin vol pp iter prune algorithm feedforward neural ieee tran neural vol pp algorithm network ieee tran neural vol pp cheng review statist statist vol pp face repres point space amer statist vol pp june partit classi cation regress ieee tran pattern analysi machin vol pp compon signal vol pp vector quantiz imag proc vol pp sept statist properti system linear inequ applic pattern ieee tran electron vol pp june independ measur ieee tran syst pp cover van order measur select ieee tran vol pp sept likelihood incomplet data journal royal statist vol neural network toolbox version de ridder map neural pattern recognit vol pp pattern statist prentic pattern studi probabl ieee tran pattern analysi machin vol pp probabilist theori pattern springer fast algorithm classi ieee tran pattern analysi machin vol pp ensembl neural vol pp duda pattern classi cation scene john wilei hart dg pattern classi cation scene john wilei note compar classi pattern recognit vol pp de approach pattern pattern recognit vol pp bootstrap resampl discoveri data unifi proc intl conf knowledg discoveri data august studi techniqu larg scale featur pattern recognit practic pp elsevi scienc tting mixtur energi minim method comput vision pattern hancock springer freund schapir boost proc int conf machin project amer statist vol pp discrimin amer statist vol pp robust competit cluster algorithm applic comput ieee transact pattern analysi machin vol pp syntact pattern recognit englewood cli step uni cation syntact statist pattern ieee tran pattern analysi machin vol pp march introduct statist pattern academ fukunaga ect sampl size classi er ieee tran pattern analysi machin vol pp fukunaga reduc classi ieee tran pattern analysi machin vol pp fukunaga procedur nonparametr error ieee tran pattern analysi machin vol pp neural network model mechan visual pattern ieee tran man vol pp iter grow prune algorithm classi cation tree ieee tran pattern analysi machin vol pp network neural theme lesson data data mine knowledg vol pp biometr veri cation ieee tran pattern analysi machin vol pp ieee assp vol pp april grai quantiz densiti gener pattern oxford advanc error rate pattern recognit vol pp hansen select principl minimum descript technic lucent bell murrai nj vector ieee intellig pp neural englewood cli combin multipl classi er ieee tran pattern analysi machin vol pp random subspac method construct ieee tran pattern analysi machin vol pp ho beck matrix estim classi cation limit train ieee tran pattern analysi machin vol pp independ compon neural comput vol pp fast algorithm independ compon neural vol pp oct mixtur local neural vol pp jain sampl size pattern recognit handbook pr ln vol pp jain algorithm cluster prentic englewood cli techniqu error ieee tran pattern analysi machin vol pp cial neural ieee pp march match deform ieee tran pattern analysi machin vol march jain small sampl ieee tran pattern analysi machin vol pp feb statist method speech mit jordan mixtur expert em neural vol pp parallel data ieee tran pattern analysi machin vol pp pattern ieee tran inform vol pp combin classi ieee tran pattern analysi machin vol pp annal mathemat arti cial vol pp springer seri inform vol krogh network cross activ advanc neural inform process vol mit lam combin pattern classi pattern recognit vol pp le appli handwritten zip code neural vol pp independ compon kluwer academ lee da extract base ieee tran pattern analysi machin vol pp compar studi neural network base featur extract pattern recognit vol pp dr cr rw kj select expect attain pattern recognit vol pp low featur extract feedforward classi er ieee tran pattern analysi machin vol pp djc evid framework appli classi cation neural vol pp mao cial neural network featur extract multivari data ieee tran neural vol pp network design featur select node proc pp oct mao ocr perform charact degrad model boost pattern recognit vol pp discrimin analysi statist pattern john wilei tree proc intl conf knowledg discoveri data aug ce principl roc seminar nuclear vol pp michalski construct classi conceptu cluster versu numer ieee tran pattern analysi machin vol pp machin neural statist classi elli mishra empir studi perform heurist method pattern recognit pp art pattern proc vol pp practic principl pattern ieee tran pattern analysi machin vol pp bayesian learn neural spring nonlinear map pattern vol pp imag compress classi cation vector ieee tran pattern analysi machin vol pp subspac method pattern research studi minor linear neural neural vol pp nonlinear pca learn rule independ compon vol pp improv train algorithm support vector proc ieee workshop neural network signal ieee park design linear tree classi pattern vol pp structur pattern combinatori ieee tran pattern analysi machin vol pp perron network ensembl method hybrid neural neural network speech imag train support vector machin sequenti minim advanc kernel method support vector aj mit ectiv mit search method featur pattern recognit vol pp select base approxim class densiti nite mixtur special pattern vol pp int man machin vol pp program machin morgan kaufmann san tutori hidden markov model select applic speech proc vol pp feb sampl classi cation complex classi cation algorithm pattern ieee tran pattern analysi machin vol pp sampl size ect statist pattern recommend ieee tran pattern analysi machin vol pp gener singl perceptron statist classi neural vol pp classi cation error fisher linear classi er covari pattern recognit vol pp richardson bayesian analysi mixtur unknown number journal royal statist societi vol aspect neural network statist probabilist chapman pattern recognit neural cambridg stochast complex statist world scienti publish anneal classi regress relat optim proc vol pp pp nov nonlinear map data structur ieee tran vol pp strength weak machin vol pp explan ectiv vote annal press support vector phd technisch compon analysi kernel eigenvalu neural vol pp support vector machin gaussian kernel radial basi function classi ieee tran signal vol pp pattern classi uni ed view statist neural john wilei condit popul mixtur model imag ieee tran pattern recognit machin vol pp sethi classi er design mutual ieee tran pattern recognit machin vol pp april setiono featur ieee tran neural vol pp note genet algorithm featur pattern recognit vol pp pattern recognit transform advanc neural inform process system morgan prop formal select invari adapt advanc neural inform process system pp morgan oat search method featur proc june statist analysi finit mixtur john wilei chichest tresp estim weight advanc neural inform process vol mit problem simpl ieee tran pattern analysi machin vol pp juli tumer boundari linearli combin neural classi pattern vol pp select learn applic document proc intl conf machin pp june van den digit recognit combin classi vol pp estim depend base empir statist learn john wilei pattern human watanab frontier pattern academ scale iter major radial basi pattern vol pp weiss comput system morgan kaufmann ratio valid mixtur amer statist vol pp neural vol pp wong data cluster ieee tran pattern analysi machin vol pp multipl classi er local accuraci ieee tran pattern analysi machin vol pp april quantiz techniqu nonparametr classi er ieee tran pattern analysi machin vol pp combin multipl classi er applic handwritten charact ieee tran vol pp list figur model statist pattern recognit approach statist pattern recognit face vector iri iri iri network nding subspac nonlinear connect map iri dataset iri iri iri fisher kernel pca order polynomi kernel classi cation error versu number featur oat search techniqu boundari bivari gaussian distribut pattern class classi er neural network hidden layer neuron region class found classifi point featur space classi cation error neural network classi er hidden unit train rule epoch class pattern test set error base independ set pattern classi cation error linear classi er covari function number train sampl test set train set digit dataset roc curv linear classi er digit dataset curv linear classi er digit dataset cluster di erent shape size mixtur decomposit list tabl exampl pattern recognit applic pattern recognit model link statist neural network method featur extract project method featur select method classif method classifi combin scheme error rate classifi classifi combin scheme error estim method cluster algorithm frontier pattern recognit
DB/105 3 usenix annual technic san june abstract dynam function placement cluster comput david gregori gibson carnegi mellon optim partit applic filesystem function cluster client server difficult problem due dynam variat applic resourc workload mix paper present system monitor dynam function placement applic manipul larg data set exampl workload show import proper function placement depend dynam perform differ frequent reach evalu prototyp adapt system includ variat filter variat applic resourc experi adapt situat adapt converg quickli case perform impact introduct effect util cluster resourc remain difficult problem distribut applic high cost remot versu local perform larg number applic sensit distribut function network effect cluster research support darpa order issu indian head contract addit support provid member includ lsi seagat resourc requir load proper partit function produc consum softwar engin techniqu modular object abil partit applic set interact solid techniqu determin cluster function deploi system continu reli complex manual made programm system administr optim placement function cluster difficult answer optim function placement depend varieti cluster characterist commun bandwidth rel processor speed workload characterist byte move instruct execut basic hardwar characterist chang fail constant system characterist determin applic invoc depend input paramet worst chang due applic chang phase competit concurr applic share resourc system fit solut case perform focu import class applic cluster applic select manipul larg data set applic benefit abil spread parallel comput exploit comput resourc reduc requir network bandwidth effect function partit applic import process power reach devic applianc abund process cycl recent led research augment storag server support execut code refer storag applianc commod activ disk file server remot execut programm storag server addit observ applic characterist simplifi task involv dynam function placement applic move process amount enabl monitor system quickli learn import commun pattern resourc requir inform system rapidli identifi function move reduc commun overhead resourc content prototyp call function data stream move back client server dynam condit programm explicitli partit function data stream distinct conform intuit program model runtim system monitor resourc consumpt commun intern box measur model decid reloc compon optim locat describ design implement set experi evalu abil adapt chang condit explor adapt variat network applic cach access applic data reduct content share phase applic dynam competit resourc concurr applic preliminari result improv applic time select placement placement function initi start node outperform static placement situat dynam proper placement vari execut effect adapt function placement base black box remov programm burden function placement remaind paper organ section discuss relat prior work section describ design section discuss program model applic built section describ system section present varieti experi demonstr dynam function placement abil effect adapt dynam condit section summar contribut relat work exist larg base excel research practic experi relat code mobil cluster larg fulli section discuss relev previou work adapt function placement relat previou system demonstr function placement autom accur profil commun resourc consumpt system histori make good function placement complement previou system dynam adapt placement condit river system dynam adjust rate match product rate meet consumpt rate variat adjust adapt cluster system perform task complement river adapt function placement dynam presenc multipl task system dynam balanc servic singl client server build work develop mechan dynam function placement realist cluster includ complex resourc resourc workload variat hybrid ship techniqu dynam distribut queri process load client server manag system techniqu priori knowledg algorithm implement queri oper estim partit work client server appli wider class applic reli monitor make placement knowledg semant algorithm implement applic compon process migrat system develop mechan cluster explicitli support function placement adapt commun mobil program system emerald rover support mobil applic leav migrat applic programm mobil agent mole agent tcl enabl agent migrat provid algorithm mechan decid agent provid mechan autom migrat explor benefit dynam function design implement prototyp system port test applic consist program model system goal make program model easi applic programm simplifi task system migrat function monitor resourc consum runtim goal improv effect achiev low monitor overhead design scale larg cluster size prototyp larg meet goal program model encourag programm applic function independ compon object mobil object provid explicit method checkpoint restor state migrat applic filesystem repres graph commun mobil object graph thought root storag server anchor storag object client anchor consol object storag object provid persist consol object part applic remain node applic start consol part data intens serv interact user rest system start node typic consist main function program consol part initi invoc propag rest graph shown figur system consist migrat invoc bind manag resourc monitor manag resourc short compon creation refer mobil redirect method invoc face object enact object migrat bind manag notifi local resourc manag procedur call return mobil object resourc manag notif collect statist byte move object resourc object amount memori number instruct execut byte resourc manag monitor load local processor resourc manag updat stat bind manag migrat resourc manag client anchor object applic object migrat raid object bind manag storag server anchor object figur illustr object princip interact show filter applic access stripe file function partit object dark oval depict mobil clear oval mark anchor object method invoc transpar redirect locat transpar invoc compon runtim compon updat local resourc monitor compon procedur call return mobil object arrow label client period send digest collect inform server resourc manag server collect relev statist initi migrat label experienc stall time network transfer storag server activ access local mobil object resourc manag collect statist resourc manag emploi analyt model predict perform benefit move altern placement model account cost includ time wast wait object quiescent time wast checkpoint transfer restor target node analyt resourc manag arriv placement net benefit placement current object migrat place prototyp written leverag featur simplifi write mobil object commun rpc focu prototyp function placement address import orthogon mobil code issu issu code mobil dynam link requir migrat modul static process client server issu protect address import issu product tangenti question address paper program model program model princip mobil repres unit migrat iter process defin mobil object entir data process applic mobil object mobil object explicitli declar programm consist state method manipul state mobil object requir implement method enabl system creat instanc migrat mobil object medium meant simpl primit perform process step data pariti aggreg mobil object privat state access export interfac implement mobil object intern object opaqu mobil object system privat state consist object refer extern object mobil object save privat includ state method call reinstat includ creation initi system invok migrat node method save state buffer file method reinstat state locat method invok extern invoc activ mobil object storag server server data local storag object export flat file interfac storag object access server host migrat migrat portion applic li storag object side consol object applic declar object object implement log declar filesystem effect anchor storag server start server host iter process model synchron invoc start toplevel consol object propag object graph invoc return back consol object result number applic record process invoc return object graph longer activ object activ start invoc initi consol object initi invoc request receiv object occur object perform background work cach assum common mode oper number entir file data set iter properti requir monitor migrat system accumul statist return method invoc make object migrat program make singl procedur call stack collect valuabl inform end point migrat useless exampl stress program model evalu benefit adapt function implement distribut filesystem data intens applic describ section report perform section distribut filesystem applic requir varieti servic underli storag system enabl filesystem explicitli migrat provid storag servic reliabl function approach pioneer filesystem work spring oper system filesystem coher file directori abstract atop flat file space export base storag object file stack object creat repres servic bound file file includ raid object stack file object turn instanti lower level object object graph access file start object stack system propag access lower layer prototyp filesystem distribut addit layer typic found local filesystem cach servic support file directori share filesystem file data directori data cach manipul trust client multipl client concurr share implement af style callback cach coher multipl client concurr updat directori filesystem includ protocol ensur updat perform client consist commit server scheme highli scalabl absenc content requir lock server lock traffic section describ automat concurr control protocol high content lock scheme simpli adapt object placement consol app client cach raid raid isol atom storag consol app directori client network server directori cach raid dir dir isol isol atom atom storag applic interfac vf layer interfac directori block cach updat file cach raid race detect log persist storag typic object placement filesystem object figur architectur distribut filesystem built atop figur show typic file directori object stack object placement shown default network trust client shown compon filesystem object implement date descript function graph consist filesystem object provid vf interfac cach option raid storag object ensur pariti corrupt race involv concurr write raid object anchor storag server object intercept read write base storag object verifi consist updat commit protocol isol object highli scalabl cach object index block share cach filesystem process raid object stripe maintain pariti individu file set storag server storag object provid flat storag configur standard linux filesystem attach secur disk prototyp back store figur show sketch typic file directori stack graph consist directori object storag object directori object directori call cach directori entri object support cach coher optimist concurr ensur atom write directori perform implement object special directori semant raid object object ensur cach coher read write instal callback cach block read call break relev callback write ensur proper concurr control simultan updat timestamp cach block export special method check readset conflict atom write provid ensur set block differ object updat entireti updat log share instanc object filesystem access wai applic includ object directli append object subgraph applic object graph file open filesystem mount standard redirect unmodifi applic standard system call interact filesystem legaci applic mechan legaci applic benefit filesystem object adapt migrat beneath applic applic similarli object perform oper data mine port straightforward search applic iter input data invok success read call filesystem oper buffer time port readset consist list block read client directori oper requir read directori block ensur exist updat block insert number readset case directori block timestamp block updat kind applic simpli requir encapsul filter compon search object write method method state consist posit input output content current buffer system system consist bind manag resourc manag bind manag instanti mobil object invoc method manner migrat object cluster node resourc manag collect statist resourc usag avail measur adapt placement improv total applic time object instanti invoc kind node cluster client server server node base storag object resid client node execut applic access storag server server execut storag server potenti client server applic instanti mobil object make request system filter applic consol object request filter object creat system creat object memori invok oper alloc return caller uniqu call object caller rid invok mobil object rid act layer object refer object current locat bind manag mediat method invoc rid forward current rid gener concaten node identifi object creat local object identifi uniqu node locat maintain inform perform invoc hash tabl map rid object refer pair mobil object move tabl updat reflect node object refer node rid pass argument method system properli redirect method call web object constitut graph node repres object edg repres invoc object object address invoc implement procedur data pass extra copi object commun machin address remot procedur call emploi object migrat addit properli rout object bind manag enact migrat migrat object sourc node target node bind manag sourc node block call migrat object bind manag wait activ invoc migrat object drain migrat cancel step long object checkpoint local invok method object alloc buffer store state write filesystem checkpoint size larg state transfer restor storag node locat tabl sourc target node updat reflect locat invoc unblock redirect proper node updat locat tabl procedur extend migrat subgraph object locat tabl accur provid hint stale node sourc target cach hint locat updat migrat occur stale data detect correct node attempt invok object node node notifi object migrat scalabl node requir maintain forward pointer object host point past node inform caller current locat object node redirect caller node object call home node home node easili determin encod rid home node inform locat migrat locat tabl updat addit tabl sourc target node object move client home extra messag requir updat locat tabl migrat resourc monitor system intermediari role redirect call collect statist monitor code procedur call return mobil slow execut method mobil object section explain statist collect singl thread cross boundari multipl mobil object make method invoc propag stack resourc manag charg time thread spend comput block object charg alloc memori proper object collect requir statist previou refer observ window describ statist data flow graph byte move object monitor inspect argument procedur call return mobil object number byte transfer object record time data flow graph graph maintain move averag byte move pair commun object graph data flow graph tractabl size applic bulk process fashion small stack object memori consumpt monitor amount memori dynam alloc object procedur call return mobil pid thread make call record point system process mobil object activ thread address space wrapper memori alloc routin inspect pid thread invok memori alloc routin pid determin current object object charg memori alloc freed instruct execut byte number byte process comput amount monitor number instruct execut object observ window process rate amount measur time spent comput object combin linux interv timer pentium cycl counter track time spent process mobil object stall time estim amount time thread spend stall inform provid system timer extend system call support type denot block timer decrement thread block implement kernel updat real timer activ updat block timer thread queue mark block interrupt task dynam placement resourc manag server seek perform migrat result minim averag applic time applic access amount figur subset object execut client benefit comput closer data migrat object server potenti reduc amount stall time extend time object spend comput processor overload resourc manag server analyt model determin object migrat client server migrat back server client analyt model consid altern placement configur select net differ benefit move placement cost migrat net benefit repres estim reduct execut time migrat enact resourc manag find placement net benefit exce configur threshold avoid migrat chase small set reflect confid measur model system resourc manag commun figur global optim placement resourc manag decid altern placement applic stream access design robust scalabl reason detail comput requir estim net benefit discuss technic report outlin intuit comput resourc manag receiv measur receiv statist client processor speed current load collect similar measur local system local execut object data flow graph measur stall time latenc model estim chang stall time object locat instruct byte rel load speed estim chang execut time object placement addit chang execut time migrat model estim chang execut time object execut target node result load object treat memori server fix constraint stall time execut time amount benefit placement comput analyt model assum histori repeat window observ cost placement estim sum fix cost time wait object time transfer state sourc destin node estim size checkpoint buffer bandwidth node perform evalu show perform depend placement function subsect follow give increasingli difficult case adapt function placement correct locat hard imposs anticip includ scenario correct locat base hardwar applic applic data access content share data includ scenario stress adapt dynam phase applic behavior content multipl applic perform fair comparison applic run run network filesystem implement differ nf differ give applic advantag adapt function placement evalu environ evalu environ consist client storag server twelv node standard pc run redhat linux equip pentium ii processor main memori experi exhibit page activ server singl id disk drive averag media transfer environ consist switch refer san share refer lan storag server directli connect client connect san san client resid lan lan lan bridg san link network low perform rel speed similar san lan environ san bar graph section adher common format graph show time configur experi migrat object report object static locat begin dynam monitor system potenti migrat static storag server graph confid interv report averag run confid chosen smaller benchmark underscor abil adapt quickli note absolut benefit achiev dynam function placement function durat longer benchmark oper larger file amort adapt delai experi observ set threshold observ window adapt network issu network dictat rel import commun rel server load evalu abil adapt network topolog default execut function client offload contend server server client benefit server requisit cycl goal decid benefit execut due reduct network stall time exce slowdown due slower process raid isol isol atom storag client raid server san raid isol atom storag raid server client lan figur figur show file bound applic access raid object maintain pariti code access storag object run storag devic show bind stack raid object run bind raid object run storag devic thicker line repres data move configur depend bandwidth client storag devic client lan client partit lead lower access latenc experi softwar raid function move amount data touch byte xor content multipl file filesystem bound raid object storag stripe raid object maintain pariti stripe data multipl storag distribut concurr access share stripe client concurr control protocol raid object execut client node storag server object graph file experi shown figur proper placement raid object larg depend perform network connect client storag server recal raid small write involv data pariti write data pariti disk failur block read requir read block stripe reconstruct fail time lan san client adapt server degrad san figur figur show result raid benchmark content cpu resourc make raid lan network bottleneck data result substanti network traffic raid object storag server construct workload evalu raid perform consist client write separ file sequenti stripe size data stripe unit workload consist client read file back degrad mode disk mark result shown figur execut raid object server improv raid small write perform lan case factor execut object host perform experi adapt place object optim san execut raid object local client faster client lower load perform raid function quickli arriv advantag raid slightli pronounc degrad read optim locat fast server arriv optim automat select locat raid object adapt paramet issu applic exhibit drastic behavior base paramet time high lan high san low load drive client adapt server low lan figur perform filter benchmark shown figur execut filter storag server advantag filter run faster cpu resourc show data access filter set determin locat filter run drastic differ grep kernel grep kernel experi data set busi continu increasingli import user applic data filter filter highli select consum larg amount data produc smaller fraction construct synthet filter object return configur percentag input data object highli select filter repres ideal candid execut close long storag resourc vari select cpu consumpt low high defin select filter label low select output data filter high select output input data filter low cpu consumpt minim amount work achiev filter high cpu consumpt simul larg data structur finit state machin text search program time lan san lan client adapt server san figur figur show cach essenti workload exhibit patholog perform insert small record automat enabl disabl client cach place cach object client server result figur show time read filter file number configur set migrat filter client storag ideal filter client migrat filter set achiev perform static locat filter reach optim time requir migrat object bigger fraction total runtim run filter simul load slower storag server make filter run storag server filter execut faster client correctli detect case filter client fourth set move low deem worthi migrat recal migrat threshold note appli estim benefit comput real benefit adapt data access pattern issu cach distribut file system yield dramat reduct storag access latenc avoid slow client total amount memori reduc load server enabl cach yield opposit effect access pattern show appropri migrat cach object data access pattern monitor experi cach provid mobil cach object applic insert small record file store storag server insert requir read block server instal entir block origin block write small record block requir transfer entir content block server applic read cach data desir cach resid client carri experi evalu impact applic access pattern tabl applic insert record file insert write record random locat file tabl applic read record random order block size larg work set applic record experi run warm cach result shown figur locat cach server insert benchmark faster client faster client san optim lan san case differ due rel length cach migrat late san case run multipl observ tabl scan benchmark highlight benefit cach applic workload exhibit leav cach cut execut time cach server lan san test adapt content share data issu filesystem cach namespac distribut improv scalabl content share object client execut object access yield higher scalabl cach local content share object execut effici client invoc serial local avoid overhead retri network kind adapt solv perform cliff share distribut file cach client write rang file happen share common invalid traffic degrad perform server prefer experi chose workload perform directori insert share namespac content benchmark directori present hierarch namespac unix filesystem implement object graph shown figur client access disjoint part directori namespac concurr conflict optimist scheme concurr control check perform isol object section work directori object client maintain cach directori access frequent make directori read fast directori updat minim cheap metadata lock messag perform offload bulk work server result scalabl free storag devic execut demand workload compet client content number retri cach invalid directori object potenti latenc oper content desir directori object migrat storag devic serial client updat elimin retri construct benchmark evalu respond level directori content high content client insert file share directori low content workload client directori directori isol atom storag server client directori network timestamp check cach callback log client client directori isol atom serial server high content directori storag server figur figur show directori updat multipl contend client distribut directori manag client benefici low high content result retri directori oper object move storag multipl client request servic thread serial local cost multipl retri client insert file privat directori result shown figur reduc execut time high content workload migrat directori object server lan optim optim locat directori object host optim high san case worst estim move closer isol object make retri cheaper adapt quickli lan case estim benefit greater observ retri traffic san case decid migrat object low make lan san migrat directori object server migrat start benchmark cold instal read case content applic run estim migrat directori object storag server avoid latenc lan san network time high lan high san low lan client adapt server low san figur figur show time execut directori insert benchmark level directori content migrat directori object fourth case insert scan insert scan tot client adapt server opt tabl phase tabl show perform applic static case applic conclud scan tabl show complet time phase scheme fast model estim instal read network cost limit result show static client storag server configur san case differ migrat threshold benchmark exhibit case placement client popul limit size note directori object client migrat server time server decid migrat base estim migrat benefit client correct ensur object oper verifi occur timestamp order underli object adapt applic phase issu establish optim placement depend system workload note characterist chang time system concern characterist vari algorithm lifetim applic applic rare exhibit behavior consum resourc rate lifetim applic chang phase number point execut input user file result algorithm properti applic make compel case dynam function reloc experi explor revisit file cach run benchmark insert conclud scan phase goal determin benefit estim server applic chang behavior move server recov bad histori quickli achiev adapt applic exhibit multipl contrast phase result tabl show migrat cach locat base behavior applic time migrat cach server insert phase cach object server detect cach client static choic lead bad perform altern phase outperform static compar client compar server case optim row refer minimum execut time pick altern client server case approxim slow optim extrem scenario phase fairli rapidli adapt competit issu share storag server resourc rare dedic serv workload addit complex address provis storag server resourc compet client reduc global applic execut resolv competit object execut quickli server favor object deriv greater benefit experi run filter object file lan filter deriv benefit execut storag server filter produc data filter select output data consum storag memori resourc restrict support filter time result figur show cumul progress filter migrat made select filter start shortli migrat storag server start select filter shortli migrat highli select filter kick back origin node slope curv show filter server run faster filter deriv benefit select filter migrat server notic delai estim benefit close configur threshold longer histori window amort migrat cost longer window result migrat occur sooner histori window long captur iter object statist collect repres applic behavior place overhead compar tradit implement filter implement run run slower implement directli atop unix case migrat occur patholog result perform static part overhead elimin optim implement cumul block process filter move server filter move client filter move server filter filter time figur figur plot cumul number block search filter versu time competit resolv algorithm successfulli select filter filter execut storag server placement case applic complet behavior decid migrat induc migrat back origin chang behavior start cycl applic node incur addit migrat cost linear migrat histori window worst case behavior bound notic object rapidli back locat anchor default placement applic termin demonstr optim function placement depend system workload characterist imposs predict applic design instal time dynam approach function placement continu adapt system base resourc usag avail measur demonstr placement decid base monitor applic system oblivi function implement preliminari evalu show prototyp improv applic time encourag result futur approach richard david shepherd christoph anonym review valuabl feedback refer saltz activ program algorithm evalu eighth intern confer architectur support program languag oper page san oct gold highli concurr share storag intern confer distribut comput republ apr gibson dynam function placement activ storag cluster technic report school comput carnegi mellon june cluster make fast case common sixth workshop parallel distribut page bernstein goodman algorithm concurr control distribut system confer larg oct chamber safeti perform spin oper system symposium oper system page copper dec livni technic summari technic report comput scienc oct dougli ousterhout transpar process design altern implement aug meet virtual machin symposium oper system design implement octob page oct kossmann perform tradeoff queri process acm sigmod intern confer manag volum acm sigmod page june scalabl storag system usenix extrem linux june grai agent flexibl secur mobil agent system fourth annual page juli heidemann develop layer acm transact comput feb ii finkel servic technic report depart comput west scale perform distribut file system acm transact comput feb hunt scott automat distribut partit system symposium oper system design feb kaashoek mobil comput rover toolkit ieee transact special issu mobil mar black mobil emerald system acm transact comput jan hellerstein case intellig disk sigmod record special interest group manag nelson extens file system spring acm symposium oper system page dec flexibl file system base composit acm transact comput aug michel van dam experi distribut process graphic system comput graphic page juli lee safe kernel extens check symposium oper system design faloutso activ storag data mine multimedia vldb confer larg data base august seagat pathwai intellig network press hohl mole java base mobil agent system ecoop workshop mobil object page juli program languag mobil code acm comput sept anderson fault isol acm symposium oper system page dec
DB/106 3 subsumpt xml type gabriel kuper bell laboratori jerom simeon bell laboratori abstract xml data respect type understand relationship type provid import inform manipul data notion subsumpt xml captur relationship subsumpt reli syntact map facilit valid queri process studi properti notion greatest lower bound show guid select storag structur power subsumpt gener mechan notabl extens refin xml subtyp introduct xml data format web applic relat xml document creat respect exist schema web simplifi exchang document deal semistructur data lack type inspir type system xml main challeng context design type scheme retain portabl flexibl untyp xml achiev depart tradit type framework number wai order deal structur semistructur support power regular express predic languag describ atom valu document remain independ document type multipl wai applic featur result addit fact data respect mean difficult recov tradit advantag safeti perform expect type system advantag understand type document relat notion subsumpt captur relationship xml type subsumpt captur fact type captur structur relationship schema show subsumpt facilit commonli oper xml type queri process compar subsumpt mechan aim type subsumpt power captur refin recent introduc xml schema tradit type instanti mechan subsumpt formal foundat techniqu advantag studi lattic theoret properti subsumpt provid techniqu rewrit subsumpt notabl show exist greatest lower bound greatest lower bound captur inform preserv relationship basi storag design practic scenario motiv subsumpt mechan applic scenario order run integr shop site mobil phone compani access catalog sourc left compani extract miscellan page high power attach portabl high power militari type mini compani sell high power inform product left hand side schema write type upper case element lower element children type stand kleen compani option supplement cost side schema compani access inform support gener descript compani kind supplement product product compani string string string price int price int case type string string int rang int supplement int option symbol type compani support effici storag techniqu fast access price case inform fact compani assum type data result mismatch verifi type includ type compani make inform provid conform expect structur specif assign type integr schema element understand price element effici access storag compani requir understand price type relat price element type subsumpt understand relationship advantag import type support queri process find year write defin make match note write exampl concret schema syntax develop system bnf appendix input type product warranti warranti warranti compani support queri effici access queri product warranti relat approach specif access structur warranti integr schema mention greatest lower bound queri type integr schema result schema explicit warranti storag relationship origin schema preserv subsumpt organ paper section introduc type system rest paper notion type assign section defin investig properti valid section compar relat refin extens xml section studi greatest lower bridg gap subsumpt section discuss advantag subsumpt queri process section summar relat work direct futur work data model type system data model data base order label tree similar model denot fix set object id fix set label refer model special type label distinguish symbol child root treat tree root referenc node reason special treatment root explain definit structur form label children od ae label map od children map od label structur obtain children node label tree upper part figur document section correspond structur label children od fo compani stand complement type complement explain section string string price int string case size type string string price int true symbol price case type size high power schema high power compani compani compani schema figur type assign subsumpt map type system adopt type system predic describ label regular express describ children note handl unord model refer slightli xml schema user syntax type explain subsumpt context xml schema set type fix set type predic rang close complement denot element regular express form regular denot languag defin regular express treat singl symbol definit type schema structur form ht predic finit subset predic map predic predic map regular express predic form middl part figur schema hp correspond structur cat ht cat cat cat cat predic cat cat predic cat cat jj predic cat cat ffl predic cat cat ffl write exampl predic regular express write true satisfi tag restrict interact refer type type type assign definit schema type type assign write iff function od predic od type write iff set type fd sg od od label children impli figur illustr type assign document type assign import inform type process call valid xml system effici obtain type data order chose storag queri process run time note type assign inform logic provid xml queri data model def refer type system power captur includ xml schema repres exist type inform heterogen sourc describ mix structur semistructur data remark plai import role rest paper remark defin schema type remark defin schema type type object od predic children fdg write schema type call schema type empti ffl subsumpt subsumpt reli map type role similar type assign regular express type definit schema schema subsum subsumpt map write iff function iff predic predic write exist figur illustr subsumpt map proposit cover elementari properti subsumpt state type check special case direct consequ remark proposit state transit importantli underli subsumpt give mean propag relationship type proposit iff impli subsumpt valid import consequ proposit abil advantag subsumpt comput type assign type assign subsumpt map origin type type assign obtain simpl composit evalu type assign scratch practic includ sketch section xml data gener legaci origin schema check compani comput subsumpt obtain time approach number advantag size schema order magnitud smaller data compil requir access data assum compani run queri store return type correspond integr schema directli type respect integr schema figur comparison al understand scope compar relat xml schema mechan refin instanti mechan type defin term model definit iff iff subsumpt addit inform compar subsumpt map natur question find subsumpt map type hold proposit schema implic proper trivial direct consequ remark implic type ffl ffl type leav tag shown type xml languag proposit impli queri subsumpt map exist case advantag subsumpt practic case subsumpt map type defin xml schema refin extens mechan export tradit type system subtyp show construct schema extens refin xml part defin call extens aim type obviou space explain complex featur xml present reli simpl model mechan extens add field refin syntact mean restrict domain type xml schema declar defin refin address uniqu state element extend zip element type defin type defin remark abil addit field note subsumpt relationship hold address proposit type deriv extens refin type proof refin correspond ad field end type correspond regular express hold extens obtain restrict yield predic restrict correspond regular express reader consult detail hold union type restrict correspond regular express form hold proposit prove induct subtyp literatur larg number mechan call relat subtyp basic subtyp reli addit attribut tupl int string restrict atom type int mechan captur predic restrict captur ad type model tupl instanti notion instanti correspond restrict type mechan restrict label restrict ariti collect restrict xml restrict union xml restrict yield type subsumpt hold greatest lower upper bound schema class schema respect subsumpt order show lattic greatest lower defin import result schema describ type inform common schema assum symbol defin appropri intersect regular regular express type intersect semant regular express intersect definit type schema su st predic su predic predic predic st predic predic st predic su su st st st schema definit schema ffl ffl note type system captur unord semant tupl assum simplic ts disjoint achiev renam ffl ffl defin renam greatest lower bound descript type inform schema type type formal dual result upper proposit similarli theorem incomplet distribut lattic complement theorem essenti relationship syntact definit semant respect schema proof theorem reli remark connect model subsumpt theorem schema untag root introduc result give technic reason special treatment root root distribut data model base forest tree work hold subsumpt weaker schema schema subsum corollari show schema schema rewritten subsum corollari schema exist schema greatest lower bound storag standard relat techniqu design storag structur account queri queri find schema store data queri answer effici integr inform exist techniqu provid relat tree tabl store plai similar role overflow graph greatest lower bound deriv schema includ warranti attribut renam product string string price int warranti int warranti warranti inform store data faster access warranti relat queri process subsumpt illustr subsumpt queri process kei remark navig document captur type approach regular express pattern match languag easili express framework queri type pattern match queri type consid queri mismatch syntax filter underli type step map filter express underli type structur order subsumpt abil construct complement definit schema complement schema type system close complement proposit exist schema complement proof proposit make exist refer complement exist defin complement respect class note result simpl extens result tree grammar predic hold infinit set word proposit schema exist schema model model model model model class model node label bind oper bind oper evalu part queri definit regular express type occur type assign variabl assign set word map word match queri introduct illustr oper convert applic bind oper bind oper match regular express return bind variabl queri valu document xml processor evalu oper load document memori filter make fact knowledg data structur assum store document relat schema subsumpt map greatest lower bound queri type immedi impli valu correspond map type schema store type assign schema attribut access relat work type xml heavili studi problem exist work cover type system type check type infer xml type queri formul queri optim storag error detect notion subsumpt unord semistructur data base graph bisimul work extend approach type involv order regular express direct work continu work work list model applic set semant extend result set interest appli result type object multipl wai formal captur greatest lower provid intuit semant desir discuss complex paper type special case subsumpt complex type hard problem relat type tractabl case unambigu framework definit exist singl unambigu refer unambigu regular effici evalu queri main motiv work complex paramet account impact storag memori manag evalu real impact implement techniqu present context system refer wiener lorel queri languag semistructur data intern journal digit apr beeri milo schema integr translat structur data intern confer theori lectur note comput jan st laurent document definit markup languag version jan note malhotra document content descript xml submiss world wide web juli extens markup languag feb suciu ad structur unstructur data intern confer theori volum lectur note comput page jan cardelli semant multipl inherit inform simeon wrap queri languag effici xml integr acm sigmod confer manag mediat data acm sigmod confer manag page june cluet simeon function declar languag xml draft mar schema xml juli note suciu queri languag xml intern world wide web suciu store semistructur data store acm sigmod confer manag page june fernandez robi xml queri data model work wadler xml queri experi exemplar commun sept fernandez suciu optim regular path express graph schema ieee intern confer data engin feb shim system extract document type descriptor xml document acm sigmod confer manag page goldman widom data enabl queri formul optim semistructur intern confer larg page aug pierc xml process languag intern workshop web pierc regular express type xml submit mar schema languag xml workshop formal method softwar aug makoto relax milo suciu type infer queri semistructur data acm symposium principl page vianu typecheck xml transform acm symposium principl mitchel foundat program languag mit papakonstantin vianu dtd infer view xml data acm symposium principl type infer presenc theori practic technic report sept ramakrishnan gehrk manag system refin extens xml schema rozenberg editor handbook formal languag naughton relat queri xml limit opportun intern confer larg sept simeon cluet build web server intern workshop web volum lectur note comput page mar xml schema part structur work feb concret type languag simpl version concret type languag exampl paper union type complement node leaf tree node children list children node children extens list children children child singl child child children sequenc children child express uniqu child element kleen star children kleen star appli child children appli child option children option appli child node data ref data bool char int float string symbol ref type refer type proof proof proposit implic show defin predic predic ffl defin predic predic ffl satisfi node root leav label subsumpt map map element map subset proof proposit map show map impli proof theorem proof lattic standard properti shown incomplet sequenc schema sn predic sn sn ffl sn ffl schema satisfi claim set fs assum finit jt claim word length word length greater sn length greater prefix length word sn consist distinct contradict length longest word type schema predic true predic ffl subsumpt map map word length extend map obtain mean contradict complement fact fact complement easili shown directli schema predic predic true st st case immedi contradict distribut type ts form ts case root consequ distribut set oper regular languag proof proposit iff immedi proposit proposit show work conjunct statement equal shown st st assum object od reachabl easi induct show proof proposit schema defin predic predic children root refer form direct graph node complement jt od fo figur proof proposit node figur children shown explicitli order children matter graph figur exist jt od defin figur result graph differ child assign type contradict definit schema finit set type ut shorthand ut shorthand order defin distinguish reason object type type predic match children match regular express object type case regular reason type oe defin oe gg posit complement regular express defin repres complement type definit schema partial complement defin elimin cycl replac type label empti predic chang model predic predic construct relat result tree proof main differ predic finit set word
Agents/107 1 format electron market abstract coalit format desir behavior multiag group agent perform task effici singl agent comput commun complex tradit approach coalit make impract larg system mechan coalit format treat agent randomli local interact entiti coalit form agent encount grow singl agent encount behavior lead macroscop model describ number distribut coalit chang time gener complex model agent leav coalit probabl model express mathemat seri differenti equat equat steadi state solut describ equilibrium coalit context specif analyz discuss connect global system util paramet model introduct electron marketplac wit exponenti growth worth project trend intensifi year tool market player restrict abil exploit market opportun implement electron market offer mean buyer seller group exploit materi base work support part muri contract darpa contract nsf grant research fund award shehori inform scienc institut univ southern california marina del ca ibm research lab israel benefit group buyer electron market bui broad type fix price seller buyer make leav buyer submit price auction server rule server determin winner explicit negoti group tool protocol provid burden interact server auction buyer research agent coordin cooper show conceptu activ agent common marketplac research theoret analysi form coalit serv feasibl mean cooper coalit format mechan date appli delib agent suitabl dozen scale thousand expect particip electron due comput commun complex interest paradigm ma design accomod larg number agent provid good perform term agent benefit consumpt comput draw inspir natur system complex global structur behavior result local interact simpl element model present paper mean coalit format simpl buyer agent electron marketplac low comput overhead model make larg system address seller benefit sell larg quantiti good reduc distribut cost pass save buyer buyer individu larg quantiti benefici form entri market reduc price unit implement virtual market date agent collabor perform negoti behalf buyer seller goal main contribut paper low complex coalit format mechan applic larg scale ma analyt studi mechan research feasibl mechan interact agent simpl local strategi lead desir group benefici coalit format show unlik current model coalit approach incur minim commun comput cost low complex approach uniqu solut case coalit format ration agent deal coalit format mechan compon agent strategi show simplest set agent action lead nontrivi group behavior show relat detail mechan goal action creat mathemat descript model construct macroscop model discuss model paramet relat detail microscop interact studi model quantit paramet valu relat result predict group format number size coalit larg scale ma approach previou attempt mathemat studi ma approach advantag shown stem approach note provid servic similar save sale join sale receiv discount provid servic product sell small bulk order offer slight discount manufactur suggest high compar discount sale web particip real market mechan provid deal buyer bypass ma base local interact commun complex model provid simpl agent make mechan simplic result reduc comput complex simplic interact make global properti system amen mathemat analysi analyt approach studi coordin task alloc cooper ma work present ma model cooper coalit interact simpl agent studi quantit bulk properti larg scale draw connect agent properti global system behavior refer system multipl mobil task obtain goal minim price paid good assum agent contact inform vendor suppli request good retail price product inform provid middl agent agent locat mechan assum addit agent priori prefer agent make random select list vendor move vendor site encount agent coalit join coalit case singl form coalit assum agent join coalit choic benefici explor coalit format space result join benefici unlik previou agent leav coalit agent join coalit place order leav coalit withdraw order product order remain open period time order end order price agent pai product base size final coalit coalit format mechan outlin requir minim commun depend sole local requir global knowledg agent learn indirectli presenc size coalit vendor site queri vendor current price product price lower bui coalit exist vendor lie agent agent ly result bad reput harm busi manipul behavior side mechan vastli reduc expect util probabl behavior vendor site relationship size coalit price product simplest relationship linear larger lower price coalit price comput save agent indirect commun analog stigmerget commun insect societi shown lead interest collect behavior model coalit format mechan basic compon approach applic system aggreg occur compon build mathemat model ma model model ideal process model explicitli account salient detail coalit format process describ tool understand process similar model approxim realiti includ detail addit correct quantit result simpler invalid focu simplest model mechan lead coalit format ma initi model refin adapt ma environ leav extens model futur work axiom captur import featur coalit format agent homogen agent goal specif product lowest strategi coalit format agent free coalit agent encount agent coalit randomli strategi determin local size coalit present vendor site benefici agent join member pai product constraint limit maximum size coalit manufactur distribut constraint limit bulk order maximum vendor accept bulk order greater maximum coalit locat site site agent prefer select benefici agent spatial uniformli inher coalit true time agent tend uniformli prefer vendor agent leav exist coalit probabl reason exist coalit join model exclud explicit negoti coalit format process paper show problem domain model lead agent form robust coalit microscop macroscop descript axiom construct microscop theori coalit format treat individu agent fundament unit model model describ agent make join coalit simul system model cellular automata give understand global behavior system construct macroscop model treat coalit fundament unit macroscop descript offer import model directli describ global properti system interest number size quantiti chang time approach fewer variabl microscop model macroscop theori tend power mathemat descript appli system govern abstract outlin axiom heart argument concept separ hold detail microscop interact relev comput valu paramet macroscop model fast coalit idea physicist construct singl model describ behavior seemingli dispar pattern format fluid chemic system descript level case deriv paramet macroscop model microscop theori construct macroscop model captur dynam coalit format process phenomenolog deriv microscop theori model express mathemat set order differenti equat describ number coalit size evolv time argu descript applic chose describ number system aggreg occur simpl connect microscop behavior agent paramet model applic relationship deriv paramet section present mathemat model studi behavior solut paramet valu show solut reach steadi state distribut coalit longer defin util gain measur save achiev agent calcul steadi state solut find steadi state distribut util gain depend strongli rate agent leav coalit discuss implic behavior solut design macroscop model denot number agent system time number coalit size number coalit size time maximum coalit size assum net chang number expect realist dynam process conserv total number agent system total number agent global util gain global util gain measur effici price discount agent receiv member coalit metric expect high larg mean system larg number agent note global benefit achiev agent maxim individu gain retail price agent pai vendor product coalit price member pai pn depend size coalit simplest model pn price decrement total discount agent mx expand conserv number agent elimin yield express util gain rn dynam equat mx initi system consist agent coalit assum spatial depend agent aggreg seri coupl rate equat describ number coalit size time solut rate equat yield coalit distribut time equat written dt mx dt dt number coalit size time rate chang number paramet dt attach control rate agent join coalit size paramet includ contribut rate agent encount factor determin vendor site agent visit period probabl join coalit size detach rate agent leav coalit size solut subject initi rate equat interpret agent find site form coalit size number agent system factor number coalit number singl agent agent join coalit size number singl agent agent leav coalit size number agent encount group size agent leav coalit size absorb agent agent detach equat state agent join coalit maximum restrict attent uniform uniform detach dn bn simplifi rewrit equat form make variabl densiti coalit size rate equat form mx note attach rate longer explicitli equat singl variabl paramet detach rate measur rel strength detach rate agent join coalit investig behavior solut equat paramet vari numer integr equat show solut reach steadi coalit densiti longer time depend sensit steadi state coalit densiti global util gain eq depend paramet figur show time evolut solut valu detach maximum coalit size case densiti agent quickli drop system reach final configur coalit size predomin longer solut reach final valu densiti reach small finit indic unlik agent left late time part coalit notic densiti larger expect number agent detach rate note steadi state equilibrium agent numer integr carri mathematica continu join leav distribut coalit chang system trap intermedi state form larger coalit equat integr numer valu figur show steadi state coalit densiti chang data plot logarithm scale facilit displai variat occur order magnitud set point result steadi state consist coalit size quickli number larger agent small number agent small largest coalit domin grow linearli point coalit start number coalit larger size drop precipit global util gain calcul eq shown solid line figur scale displai side util gain largest small finit substanti case util gain roughli number coalit maximum slowli detach rate grow drop quickli larg detach virtual util system agent larg util gain small time requir reach steadi state solut reach final state solut note discontinu steadi state solut qualit system trap state chanc reach true equilibrium obtain analyt express steadi state densiti term set side eq find late time densiti obei simpl studi behavior solut valu empir obtain scale law steadi state result valid paramet rang interest util gain larg slowli vari equat eq eq densiti densiti densiti time time time figur time evolut coalit densiti detach densiti figur steadi state distribut coalit densiti global util gain detach rate solid line global util gain agent predict steadi state densiti coalit size detach maximum coalit chang expon approach case number coalit size grow linearli lesson learn conclud agent leav util gain steadi reflect presenc small coalit introduc small detach rate basic coalit format process system reach equilibrium steadi state global util gain case price higher util gain time requir reach steadi state solut grow larg small system coalit largest size rel strength detach rate util coalit number agent grow virtual util gain util gain remain larg slowli order magnitud agent design paramet valu result substanti global requir wait long time benefit achiev agent design util gain dict final distribut larg system relat work cooper multipl agent discuss public ephrati al suggest coordin mechan agent minim commun suggest mechan provid mean form group coalit mechan implement test small number scale check scale tool predict analysi behavior provid lack tool appar work sen al differ sen mean format group agent group mechan support pair agent import differ work address complex case sen address case cooper agent note work sen address case agent coalit format discuss shehori al suggest low commun complex coordin mechan larg scale ma suggest model similar physic tool provid physic analyz predict behavior work support format refer cooper agent research cooper agent address approach axelrod al show cooper behavior selfish autonom agent game dynam simul interact agent make payoff agent depend choic made agent strategi lead stabl cooper due mutual payoff coalit format result arriv simul contrast work appli game dynam formal distribut agent adjust strategi compet share finit resourc focu work adapt distribut group agent learn cooper achiev common goal central control present game dynam system huberman work comput ecolog amen mathemat result stabil system achiev simul studi global dynam system local interact research similar aim mathemat analysi demonstr exist evolutionari stabl strategi drive system steadi optim solut differ work cooper mechan abstractli payoff matrix behavior chang action global stabil sacrif adapt address adapt strateg carri detail stabil work suggest steadi state solut stabl futur direct issu work remain unexplor model extend provid wider rang solut incorpor vari likelihood agent leav coalit agent leav larg coalit find coalit join flexibl relat coalit approach multipl interest examin stabil steadi state solut perturb agent stabil question similar effect explor direct follow approach interplai agent complex system complex adapt stabil achiev simpl agent fix strategi compar complex agent chang strategi interest appli rigor mathemat analysi problem acknowledg kl acknowledg ross illumin discuss physic phenomena analog coalit numer integr refer axelrod hamilton evolut cooper barabasi stanlei fractal concept surfac growth cambridg dorigo theraulaz swarm natur artifici system oxford williamson internet page ur deriv coordin filter strategi page hogg huberman learn multiag control smart matter aaai workshop multiag huberman hogg behavior comput ecolog ecolog huberman jen campo social level social agent ieee softwar coalit structur gener artifici shoham tennenholtz adapt load studi learn journal artifici intellig sen sekaran hale learn coordin share inform victor intern confer system mit sen foundat principl promot cooper behavior agent victor mit shehori krau method task alloc agent coalit format artifici shehori krau feasibl format coalit autonom agent environ comput emerg cooper goal satisfact system artifici shehori scalabl agent locat mechan nr jen intellig agent note artifici intellig pattern exampl materi scienc
AI/108 2 argonn nation laboratori south avenu illinoi benchmark optim softwar cop elizabeth jorg mathemat comput scienc technic report novemb work support comput scienc subprogram offic advanc scientif depart contract nation scienc foundat comput grant technolog grant depart electr comput northwestern mathemat comput scienc argonn nation illinoi mathemat comput scienc argonn nation illinoi content abstract introduct test method largest small polygon distribut electron sphere hang chain shape optim cam marin popul dynam flow channel robot arm particl steer goddard rocket hang crack ga oil catalyst mix journal bear minim surfac obstacl acknowledg refer ii benchmark optim softwar cop elizabeth jorg abstract describ version cop set nonlinearli constrain optim problem ad streamlin improv problem provid comparison solver problem introduct cop test set modest select difficult nonlinearli constrain optim problem applic optim fluid paramet optim control report describ version cop problem formul discret origin problem streamlin improv ad problem present cop origin descript problem streamlin problem discuss formul problem structur data tabl formul aim present data provid approxim idea size sparsiti problem tabl descript test problem variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero includ result comput experi solver comput experi differ origin result delet problem consid easi current version comput problem test variat import differ report origin report tabl present comput experi gener automat test script explain detail test method test method perform trial variant constitut version cop set implement written ampl model languag ampl interfac nonlinearli constrain optim solver interest solver includ driver script run problem solver minim effect fluctuat machin load script track time start kill process run declar unsuccess cycl problem record time combin ampl system time interpret model comput vari amount deriv inform requir solver time time return ampl initi record time check discrep solver method calcul execut time includ problem result ampl time time differ ten percent ensur verifi ampl time result present reproduc ten percent accuraci comput run solari run parser search output file kei text pattern indic solver complet successfulli script gather data tabl file calcul ampl interfac solver provid numer option set option solver execut final complet run option problem option involv set output level gather data iter limit limit failur record final trial includ solver error messag violat limit realiz test optim softwar notori difficult problem object test present report perform solver improv significantli option object start point problem perform solver sensit choic start point default stop criteria solver choic bia result affect comparison reli larg time differ spite feel essenti provid indic perform optim solver interest problem report effort direct largest small polygon find polygon maxim polygon side diamet formul classic problem graham coordin vertic minim nv subject constraint implement fix vertex set nv nv fix vertex add bound optim solut regular shown graham interest featur problem presenc order nonlinear nonconvex inequ constraint note expect maxim area converg area problem local minima squar side length triangl vertex ad distanc fix vertex global solut optim number local minima gener solver expect find local solut data problem tabl tabl polygon problem data variabl constraint nv bound linear equal constraint linear inequ constraint nv nonlinear equal constraint nonlinear inequ constraint nv nonzero nonzero perform result ampl implement summar tabl polygon equal side start point global solut shown figur tabl perform largest small polygon problem solver nv nv nv nv violat iter violat iter violat iter violat iter error warn time figur polygon maxim area distribut electron sphere find equilibrium state distribut minim electron posit conduct sphere formul thomson problem find lowest energi configur point charg conduct origin thomson model atom nucleu problem repres import class problem physic chemistri determin structur respect atom posit potenti energi point defin np np constraint point data problem tabl problem local minima object close object global minimum theoret result show min np kv number local minima grow exponenti determin global minimum solver expect find local minimum tabl electron sphere problem data variabl constraint np bound linear equal constraint linear inequ constraint nonlinear equal constraint np nonlinear inequ constraint nonzero nonzero perform result ampl implement summar tabl start point distribut point unit sphere solut shown figur tabl perform electron sphere problem solver np np np np violat iter violat iter violat iter violat iter error warn time solv problem error messag unbound badli problem figur optim distribut electron hang chain find chain uniform length suspend point minim potenti energi implement classic problem page suggest han problem determin function shape minim potenti energi dt subject constraint length dt end condit reformul problem control problem term function optim control version problem dt subject differenti equat constraint length dt discret integr differenti equat trapezoid rule uniform mesh interv data problem tabl tabl hang chain problem data variabl constraint nh bound linear equal constraint nh linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform result ampl implement summar tabl start point quadrat evalu mesh point choic convex satisfi boundari data control function set optim chain shown figur tabl perform hang chain problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time figur hang chain length shape optim cam maxim area valv open rotat convex cam constraint curvatur radiu cam formul formul problem due assum shape cam circular angl radiu min design variabl repres radiu cam equal space angl distribut angl maxim area valv open maxim subject constraint design paramet relat geometri valv requir min max requir cam convex express requir area triangl defin origin point cam surfac convex constraint express min max curvatur requir express departur curvatur constraint express term data problem tabl tabl optim design cam problem data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero follow min max bound area ff curvatur constraint optim cam shape half design angl problem origin formul full angl perform result ampl implement summar tabl start guess min max cam shape ff figur note number activ constraint ff threshold ff ff chang optim solut tabl perform optim cam shape problem solver violat iter violat iter violat iter violat iter error warn time stop prematur messag step small solut show violat problem constraint extent obviou graph solut quit current point improv figur cam shape ff determin reaction coeffici thermal linear kinet model reaction coeffici initi condit problem minim concentr measur time point formul formul problem optim problem colloc uniform partit subinterv standard page basi ij compon solut constraint optim problem initi condit continu colloc equat continu equat interior grid point set linear equat colloc equat set nonlinear equat obtain requir colloc approxim satisfi colloc point data problem tabl tabl data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform provid result ampl formul tabl initi valu paramet initi basi paramet chosen colloc approxim constant interpol data solut data shown figur tabl perform problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time stop messag step solut fail complet unbound badli manag feasibl satisfi dual feasibl figur solut data problem marin popul dynam estim abund popul marin speci stage function determin stage specif growth rate model popul dynam popul unknown growth rate stage ns model assum speci eventu di grow implicit assumpt speci skip stage initi condit differenti equat stage abund measur initi time contamin error minim error comput observ nm stage abund measur problem base work formul formul marin popul dynam colloc uniform partit subinterv nm standard page basi ij compon solut constraint optim problem continu condit colloc equat continu equat set linear equat colloc equat set nonlinear equat obtain requir colloc approxim satisfi colloc point ij tabl marin popul dynam problem data variabl constraint ns bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero paramet problem initi growth basi paramet colloc approxim data problem tabl initi condit differenti initi measur contamin error introduc extra freedom problem formul solver find fit data differ problem paramet estim problem popul dynam data larg observ error perform provid result ampl formul tabl simul dataset stage initi basi paramet chosen colloc approxim constant interpol data tabl perform marin popul dynam problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time return messag step small valu termin intermedi solut return termin close agreement optim solut return solver make progress return error unbound badli problem graph left figur show popul stage graph show popul stage fit model data tight problem small number colloc point case number paramet grow quickli number stage qualiti solut measur popul curv growth paramet stage stage figur marin popul stage figur plot growth paramet stage paramet mark growth paramet mark ffi paramet stage order figur growth paramet marin popul stage flow channel analyz flow fluid inject long vertic assum flow model boundari problem uu potenti tangenti veloc reynold number formul colloc method formul problem optim problem constant merit function equal constraint repres solut uniform partit subinterv standard page basi ij ij note order differenti equat constraint optim problem initi condit continu colloc equat initi condit continu equat set linear equat colloc equat set nonlinear equat obtain requir satisfi colloc point ij colloc point ae root kth polynomi paramet optim problem paramet ij ij data problem tabl tabl flow channel problem data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform result ampl implement summar tabl start point function evalu mesh point solut shown figur problem easi solv small reynold number increasingli difficult solv tabl perform flow channel problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time unabl solv simpl version advanc slowli solut judg merit figur tangenti veloc reynold number robot arm minim time robot arm travel point formul problem origin thesi monika formul arm robot rigid bar length distanc ae origin grip end stick distanc ae opposit direct pivot point arm origin spheric coordin problem phrase term length ae arm horizont vertic angl horizont control ae oe final time bound length angl ju ae ju ju oe equat motion robot arm ae oe oe oe moment defin ae oe ae boundari condit ae oe ae oe model ignor fact spheric coordin refer frame frame term forc implement implement control elimin equal constraint inequ ji ji oe oe implement express term system addit variabl ae oe discret uniform time step trapezoid rule interv data problem shown tabl tabl robot arm problem data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform result ampl implement tabl solver initi valu initi valu ae oe set function ae oe evalu grid point initi valu set discret version match boundari condit initi valu control set initi tabl perform robot arm problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time report find feasibl solut version implement encount describ error evalu nonlinear express figur show variabl oe robot arm function time show figur control ae oe function time note control robot arm note function oe robot arm continu deriv directli proport deriv continu figur variabl oe robot arm function time figur control variabl ae oe robot arm function time particl steer minim time act thrust constant achiev altitud termin veloc formul equat motion posit control angl constant magnitud thrust particl initi rest problem minim travel time particl achiev height termin veloc classic bryson ho page problem dynam optim magnitud thrust boundari condit discret uniform time step trapezoid rule integr system interv data problem shown tabl tabl particl steer problem data variabl constraint bound nh linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform result ampl implement tabl initi valu chosen function tabl perform particl steer problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time initi valu set initi final time plot height control function horizont posit figur return error step small optim solut figur height control function posit particl steer problem goddard rocket maxim final altitud vertic launch thrust control initi fuel drag characterist rocket formul classic problem dynam optim typic control problem singular arc bryson page background inform equat motion rocket altitud center vertic rocket aerodynam gravit constant measur rocket fuel thrust satisfi max drag gravit forc defin exp gravit forc earth surfac rocket initi rest mass end flight fraction initi flight time constant addit bound bound veloc rocket bound direct consequ equat motion equat motion made dimens free scale equat model paramet term follow max choic loss follow discret equat motion trapezoid uniform mesh interv data problem tabl tabl goddard rocket problem data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform result ampl implement shown tabl start point function evalu grid point initi thrust max rocket problem make declar unbound badli problem tabl perform goddard rocket problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time figur show altitud mass rocket function time note altitud maximum altitud mass rocket steadili final mass reach figur show veloc thrust function time thrust region singular occur max figur show optim flight path involv maxim thrust thrust point final mass rocket coast maxim altitud oscil point discontinu thrust paramet remov grid point figur altitud mass goddard rocket problem figur veloc thrust goddard rocket problem hang maxim final horizont posit hang presenc thermal formul formul problem equat motion hang posit mass gravit function defin constant function posit neighborhood drop exponenti function defin wing ae air aerodynam lift drag coeffici ae aerodynam lift coeffici satisfi bound max natur bound problem max boundari condit discret uniform time step trapezoid rule interv data problem shown tabl tabl hang problem data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform result ampl implement shown tabl start point function evalu grid point initi control max fail produc solut problem version present declar problem bad start tabl perform hang problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time figur show altitud control function function time start altitud descend meet center result climb descend desir final altitud time figur altitud control hang problem figur show veloc function time errat behavior veloc control max figur veloc hang problem crack ga oil determin reaction coeffici crack ga oil ga byproduct nonlinear model describ process coeffici initi condit problem minim concentr measur time point formul formul crack ga oil problem optim problem colloc uniform partit interv standard page basi ij compon solut constraint optim problem initi condit continu colloc equat continu equat set linear equat colloc equat set nonlinear equat obtain requir colloc approxim satisfi colloc point data problem tabl tabl crack ga oil data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform provid result ampl formul tabl initi valu paramet initi basi paramet chosen colloc approxim constant interpol data data gener solv numer tjoa valu appli rel random perturb size figur show solut data tabl perform crack ga oil problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time figur solut data crack ga oil problem determin reaction coeffici nonlinear model describ process coeffici initi condit problem minim concentr measur time point formul formul problem optim problem colloc uniform partit interv standard page basi ij compon solut constraint optim problem initi condit continu colloc equat continu equat set linear equat colloc equat set nonlinear equat obtain requir colloc approxim satisfi colloc point data problem tabl tabl data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform provid result ampl formul tabl initi valu paramet initi basi paramet chosen colloc approxim constant interpol data data gener solv numer maria appli rel random perturb size figur show solut data tabl perform problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time figur solut data problem catalyst mix determin optim mix polici catalyst length plug flow reactor involv reaction formul nonlinear model describ reaction initi condit control variabl repres mix ratio catalyst satisfi bound problem minim final time fix discret control state variabl uniform mesh interv standard trapezoid rule data problem tabl tabl catalyst mix data variabl constraint bound nh linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero nonzero perform result ampl implement shown tabl start point evalu grid point catalyst mix problem typic problem singular lead valu control singular obtain valu control figur show control obtain solver result tabl show solver success object function fluctuat due natur problem common approach deal singular control tabl perform catalyst mix problem solver nh nh nh nh violat iter violat iter violat iter violat iter error warn time problem add penalti object function lead smooth ff dt posit ff valu ff work difficult find figur control obtain solver catalyst mix problem determin stress potenti infinit long cylind appli formul problem page formul term angl unit length stress potenti minim quadrat ae oe convex set fv jvj distanc boundari space function gradient vanish boundari finit element approxim problem obtain triangul minim space linear function valu vertic triangul follow triangul intern grid point coordin direct data problem tabl tabl problem data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero ny nonzero perform provid result ampl formul tabl result fix vari start guess function evalu grid node figur show potenti problem number activ constraint problem lim potenti function tabl perform problem solver ny ny ny ny violat iter violat iter violat iter violat iter error warn time figur elast plastic problem journal bear eccentr ffl journal find pressur distribut separ shaft bear formul journal bear problem requir determin pressur circular cylind length radii separ cylind eccentr pressur minim quadrat ae oe convex set fv space function gradient vanish boundari function defin sin eccentr bear finit element approxim journal bear problem obtain triangul minim space linear function valu vertic triangul follow triangul intern grid point coordin direct data problem tabl tabl journal bear problem data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero ny nonzero perform provid result ampl formul tabl ffl result fix vari start guess function evalu grid node figur show pressur distribut journal bear problem tabl perform pressur journal bear problem solver ny ny ny ny violat iter violat iter violat iter violat iter error warn time figur journal bear problem ffl minim surfac obstacl find surfac minim boundari obstacl formul plateau problem determin surfac minim area close curv boundari assum surfac repres nonparametr form add requir obstacl solut obstacl problem minim function convex set space function gradient function defin boundari obstacl assum boundari finit element approxim minim surfac problem obtain triangul minim space linear function valu vertic triangul set triangul intern grid point coordin direct data problem tabl tabl minim surfac problem data variabl constraint bound linear equal constraint linear inequ constraint nonlinear equal constraint nonlinear inequ constraint nonzero ny nonzero perform provid result ampl formul tabl result fix vari start guess function evalu grid node boundari data ae obstacl ae jx jy figur show minim surfac data tabl perform minim surfac area obstacl problem solver ny ny ny ny violat iter violat iter violat iter violat iter error warn time figur minim surfac problem plate obstacl acknowledg version cop problem develop alexand david liz michael contribut essenti version problem close relat origin version bob contribut interest spirit discuss problem bob david gener share ampl han pave cop benchmark work refer converg applic shape preprint argonn nation numer solut boundari problem ordinari differenti mor test problem preprint mathemat comput scienc argonn nation nonlinear program test problem technic report boe comput mor nonlinearli constrain optim technic argonn nation octob problem analysi pp bryson appli optim john wilei dynam von combin direct indirect method nonlinear optim rang maxim hang optim pp free boundari problem theori free boundari theori research note pp optim theori springer handbook test problem local global kluwer academ free boundari problem scienc notic amer math pp ampl model numer method nonlinear variat largest small combin pp adapt strategi solv kinet model estim reduct genet algorithm energi minim point charg phy rev pp estim growth journal pp distribut point math pp tjoa simultan solut optim strategi paramet estim equat ind eng pp nonlinear optim model von user guid direct colloc method numer solut optim control technic technisch universitat
DB/109 3 tableau calculu tempor descript expand domain case holger sturm frank wolter institut fur universitat leipzig germani abstract paper present tableau calculu tempor extens descript logic call logic base tempor languag interpret natur number expand tableau calculu form elabor combin wolper tableau calculu proposit linear tempor standard method introduc wolter zakharyaschev base ingredi paper method procedur construct logic lack finit model properti method appli deal tempor formal introduct applic domain logic comput scienc artifici intellig longer describ static aspect world formal tempor evolut year observ grow interest tempor logic formal mention gener extens epistem logic mean tempor oper suppli logic space tempor oper order describ evolut region work tempor investig tempor logic base logic research concern tempor descript logic recal descript logic alc design repres reason static domain framework inform system softwar engin tempor static formal suggest investig consult survei syntact side tempor add tempor oper origin semant side add dimens domain interpret origin formal easi tempor languag add tempor oper flow time interpret addit dimens simpl understood formal drastic reader consult special issu descript logic journal logic comput overview recent work field comput appar small differ design tempor unexpect drastic consequ comput complex implement result system account progress made concern determin decid complex tempor wit algorithm tableaux resolut algorithm suggest except work paper follow line research develop extens alc introduc model constant domain model domain extend languag alc mean tempor oper appli concept formula form concept formula languag interpret model base natur number equip describ domain moment assum domain moment includ domain moment idea formal alc repres knowledg state process tempor compon describ behaviour process sequenc state note prove satisfi problem languag primari concern paper decid construct implement procedur similar approach base standard tableau alc standard tableau proposit tempor logic develop contrast case simpli tableaux interact alc merg algorithm subtl manner differ reflect fact logic bound domain properti requir satisfi formula grow arbitrari larg consequ unusu featur complet tableaux directli induc satisfi model possibl infinit encod constraint introduc prove decid tempor descript logic appli investig tempor logic contrast paper build defin semant syntact constraint system close constraint rule present modular languag replac alc mean formal replac alc part tableau mean tableau tableau languag replac alc easi model vari domain simul mean model expand domain tableau appli vari domain case constant domain case difficult requir addit tableau rule involv complet proof investig forthcom paper difficult defin mean context paper reader prefer statement confin exampl epistem logic express descript languag alc alc paper section describ syntax semant show lack bound domain properti constraint system relat notion defin section introduc notion prove section satisfi usual turn thing section reserv fix tableau rule main notion respect tableaux introduc section section prove calculu complet decid form topic section section compar result work paper close suggest futur research section acknowledg lutz michael zakharyaschev comment draft paper basic definit languag logic base ffl set concept ffl set role ffl set object set concept defin smallest set concept logic constant close constructor role set formula defin ffl concept object formula ffl fl syntact definit set formula design set subformula formula set object occur set concept unari fl defin union set closur defin similar defin closur set concept fragment gener symbol defin union denot cardin definit tripl set natur number equip usual strict order function associ binari relat subset extens concept model moment symbol defin fd dr fd fd observ oper interpret mean relat pair formula defin standard manner iff iff iff iff iff fl iff formula call satisfi iff exist model moment loss gener assum equal form equal transform equal lemma paper lack bound domain properti exist formula model bound domain model bound domain iff exist show exist similar introduc abbrevi ffl ffl ffl ffl put lemma model bound domain proof show satisfi model bound domain satisfi find exist find find infinit sequenc distinct prove part left reader end section give proof mean tableau method bound domain properti problem attempt find procedur base tableaux finit tableau bound number individu procedur requir formula procedur termin difficulti overcom make method intuit sketch main begin section constraint system main paper provid tableau base procedur decid satisfi common practic descript logic tableau rule oper constraint constraint system finit set formula special languag lc extend mean variabl definit procedur constraint system immedi obtain procedur satisfi begin formal present constraint introduc languag lc constraint system build definit constraint languag lc fix countabl set variabl assum disjoint set object languag variabl object form set lc set lc defin mean lc lc assum equip abbrevi subset defin variabl respect defin constraint system finit set lc special class constraint satur great import paper class consist constraint system satisfi number closur condit respect formula condit requir formula syntact subformula case formula form subconcept formula depend syntact shape give rule close conjunct formula form conjunct end section reader realiz rule complic outlook local gener prove formul closur condit explicitli mean satur rule mean constraint system defin satur rule appli make make auxiliari notion satur definit constraint system lc occur ffl iff satur rule oper formula applic ffl term local satur iff satur rule oper concept appli lc form ffl constraint system satur iff lc occur local satur local gener rule appli ffl constraint system iff pair form pair form formula form write constraint system obtain applic satur rule paper satur rule serv tableau rule build tableau follow strategi definit sequenc constraint system exist satur rule local gener rule rule applic built satur strategi lemma requir concern termin tableau procedur lemma sequenc built satur strategi formula rule list end section proof ae suffic show cardin bound suffic show number variabl bound end show find variabl fc fc properti exist assum exist occur local gener rule appli introduc fc fc fc fc contradict assumpt find concept contradict rememb build strategi fix definit satur rule set satur abbrevi consist rule oper formula modal rule formula ffl ffl ffl ffl ffl ffl ffl fl ffl rule bit formul make applic rule stai underli fragment languag formula fg ffl ffl ffl ffl ffl ffl ffl rule oper concept modal rule concept uc ffl ffl fx ffl fx dg fx ffl ffl fx fx ffl fx fx fx ffl fl ffl concept fx cg ffl ffl fx dg ffl ffl fx ffl ffl ffl fx cg ffl ffl occur ffl local gener rule fv ffl ffl exist ffl variabl ffl ffl fv cg fv sg fv sg ffl variabl ffl block ff xg ff sg section shown lack bound domain properti block procedur scratch closer inspect situat thing turn infinit individu order satisfi formula individu fall finit number class respect fix fragment satisfi finit number concept type suffici repres infinit domain give answer bring plai simplifi sequenc satur constraint system satisfi condit regul interact formal definit condit ensur show respect serv model contrast common variabl occur constraint system stand encod concept set concept coincid concept fix realiz individu moment time individu repres function domain set form fm natur number domain fix set moment exist select variabl sm variabl encod concept type individu function sort call run repres individu requir bit definit formula individu repres satisfi moment mean satisfi moment respect tableau calculu consequ construct tableaux regard effici procedur search reflect fact complet tableau formula assum directli obtain satisfi main result section drawback theorem formula satisfi high time start formal present section fix definit satur constraint system satisfi ffl fa ffl ffl formula definit extend usual suitabl interpret concept form regard concept concept form occur put fc definit extend realiz exist function set term occur fulfil surject object fc sg lemma exist extend realiz proof defin extend model domain set term occur object occur put concept concept form set fx sg role term put yi iff concept fx cg fy sg order show realiz suffici prove concept term claim prove condit definit follow defin ident function claim prove straightforward induct complex proof heavili exploit fact close satur rule note concept form due treat atom concept note induct make measur complex concept measur concept form negat negat complex assum claim definit atom impli closur obtain induct hypothesi case prove similar fact close closur rule variabl fv dg fv sg obtain xr induct hypothesi conclud case remain check xr definit concept fy sg obtain induct chosen shown lemma plai import role proof theorem lemma cardin cardin realiz extend proof modulo chang notat proof fix extend realiz domain defin supremum show satisfi requir condit extend realiz defin disjoint union copi put hd ii ha order prove realiz argu choic function satisfi condit definit defin function put pair function set term fulfil definit prove satisfi suffici prove concept iff proce assum realiz remain prove claim routin induct leav reader definit sequenc call run function domain fm associ term sm satisfi concept sm sm hold definit call object defin run variabl run fl sm hold definit restrict hold formula rich rich term infinit variabl fc fc theorem satisfi proof direct left satisfi model fix defin set fc defin relat put iff class modulo abbrevi finit class individu variabl constraint system defin union ffl ffl fa ffl fv difficult prove show satur show term occur satur start distinguish number case case prove similar content easi semant calcul infer hold hold formula member case similar argument show close remain modal rule oper formula shown fix term local satur left reader rule term occur assum conclud definit yield object argument remain prove close local gener rule case obviou case show formula appli definit dr easi consequ obtain easi satisfi requir condit complet proof satur object satur prove similar infer satur conclud part show satisfi condit definit consequ defin shown defin sequenc order complet proof direct show consequ fact remain check satisfi condit definit condit pretti obviou variabl occur defin easi run definit prove condit remain prove definit semant closur condit turn attent direct form interest part theorem assum cardin cardin run cardin suppli lemma note lemma exist extend ffl hr ffl fc pair defin show prove induct construct fix atom claim choic model appli atom case easi definit induct obtain semant fl rest case definit sm hold result easili obtain make induct hypothesi complet case consid induct show sm claim consequ assumpt fact close induct step assum claim prove distinguish case induct step immedi properti bring case closur fl case induct step trivial case closur make definit infer result obtain closur complet induct proof back proof easi induct hypothesi infer desir result simpl semant argument shown step show claim shown induct atom distinguish object concept definit hr note defin hr concept fix term close applic yield atom case distinguish form clear assum close suppli variabl definit run applic infer shown proof induct step left reader similar proof interest case negat definit definit proof order complet proof theorem reason applic yield mean satisfi tableau rule section introduc set tableau rule tableau calculu base tableau calculu kind rule expand constraint system rule add constraint system tableau case class consist rule fl class divid number subclass distinct rule reflect ontolog constraint system regard partial descript fact hold moment rule fl add inform respect moment regard local rule rule fl add moment structur construct start build satur constraint system tableau calculu appli leaf satur local comfort situat satur rule section except concern rule involv uc technic chang rule part tableau algorithm reason obviou section give hint condit rule appli formula note consequ situat appli rule prove correct end proof lemma turn restrict violat appli rule overcom drop rule appli prevent tableau algorithm termin kind mechan ensur satur constraint occur rule appli wolper method mark formula formula form occur constraint system tableau classifi respect occur mark occur unmark formula mark commun util replac ffl occur unmark ffl similar problem case uc chang rule uc fx ffl occur unmark ffl fx dg fx short remark order chang rule chang notion satur constraint system strictli distinguish satur system satur system tableau rule clear context type satur consid rule rule complet charact formul introduc notion constraint system term occur design set fc sg defin relat set variabl set iff denot class variabl regard relat global gener rule rule ad world fl set fv variabl repres class union set unmark ffl fa ffl fl sg ffl fa ffl fv distinct variabl defin set tableau set rule obtain set satur rule replac uc uc ad global gener rule empti formula form put fl iff fv fl variabl note consequ obtain fl variabl av tableaux complet tableaux section give formal account tableaux relat notion start inform descript tableau rule build tableau formula present follow process build tableau branch defin initi node tableau construct main step appli tableau rule build satur set process appli rule appli modal rule formula reach set reiter step reach satur set rule oper concept term appli appli met satur set branch appli fl obtain set respect ontolog mean node step correspond creation moment satur process start time base satur appli fl satur process continu reach node fulfil constraint system clash rule appli global gener rule applic provid constraint system exist tableau necessarili shown finit number step meet situat satisfi termin condit tableau finit branch yield termin tableau algorithm built complet tableau assum leaf standard tableau calculu satisfi linear tempor criterion appli exist formula complet tableaux open formula satisfi counterexampl sort found formula form reason appli tableau rule formula gener branch tableau start set formula instanc hand set construct attempt realiz mean postpon favor ad process build tableau termin hold branch start clash describ situat eventu realiz case satisfi spite fact fulfil criterion easi complet tableau formula note formal account definit leav order satur rule appli requir local gener rule applic rule applic point short remark order paper concern conceptu present primarili concern comput effici optim procedur left futur work fl clash oe order overcom wolper ad compon tableau procedur built complet tableau elimin node clash eventu node surviv elimin process build model satisfi wolper prove satisfi initi node complet tableau elimin turn wolper elimin rule end definit tableau tripl form oe finit tree label function associ constraint system root tableaux oe tableau rule write iff exist leaf set disjoint ffl ffl oe ffl ffl constraint system exist consist node iff disjunct rule ffl fl rule applic leaf exist fl applic rule fl ffl rule applic leaf tableau complet tableau rule applic tableau oe oe tableau call complet iff complet exist sequenc tableau exist tableau rule node call iff root fl uniqu oe definit complet defin relat oe oe leaf fl denot set satur node exist path oe oe fg write recal number concept formula bound lemma complet number bound length longest fl bound proof observ complet determin ffl set ffl set form fc ffl set upper bound number immedi observ number variabl bound definit rule rule introduc number variabl bound lemma number variabl occur bound claim fact ae oe rule fl process complet tableau appli tableau rule success tableau reach complet finit step definit complet defin relat set satur mean iff uniqu occur path sequenc node interv zg hold fg ng definit complet interv function gi satur properti design term node mean uniqu occur fg ng concept lc ff call eventu constraint system iff ff ff form form definit complet ff eventu ff form realiz iff exist ff form variabl realiz iff domain exist ff form object realiz iff domain exist definit complet rule elimin point elimin point elimin eventu realiz elimin describ elimin procedur complet tableau build sequenc subset elimin node appli step rule turn begin defin set clash defin put fg step elimin node correspond applic rule appli mean elimin eventu realiz defin set remain node lemma assum process stop finit mean reach applic rule lead turn root case elimin rest paper prove suffici condit satisfi correct aim section prove tableau calculu develop correct theorem formula satisfi complet root elimin theorem consequ lemma complet rich exist form lemma prove argu proof assum formula theorem exist loss gener assum rich complet sequenc subset construct mean elimin procedur forego section definit applic lemma suppli form make definit find infinit start lie occur order show node path elimin prove claim induct li induct base clear li claim prove induct step distinguish case assum odd induct hypothesi case ff eventu distinguish ff form choic li definit suppli run definit infer defin put easi strictli claim lemma lemma hold sn simpli set variabl set variabl lemma state sn hold modulo renam relev variabl care requir lot notat give insight satisfi definit requir sequenc induct induct hypothesi hold ff realiz argument ff similar ff form make fourth definit rest remain claim prove consequ obtain infer root elimin complet proof theorem lemma plai import role proof lemma lemma rich run complet assum satur exist hr hn hr defin exist proof satur set variabl put mean class variabl select variabl fc exist properti aim construct find requir run class set ae ffi union ffl fa ffl fl ffl fa rememb term defin set fc variabl iff av ffl variabl ffi difficult ffi obtain applic rule fl exist ffi mind formula form ffi unmark show exist fulfil condit lemma suffici show exist sequenc oe oe node properti requir sequenc construct induct induct base note construct choic depend rule appli construct tableau case rule oper formula appli case appli node oe oe case appli fl node oe node oe fl case determinist case consid obviou manner case appli node oe node oe case rule oper concept appli construct case uc appli fx oe fx oe fx fx case appli fx fx fl oe fx oe fx fl case case uc consid obviou manner case local gener rule appli construct case appli variabl rich assum oe fv case appli term defin subset oe reach rule applic lemma exist put show requir clear suffic check condit rule mark mark exist appli rule uc mark mark exist uc appli domain rang sort form remain check satisfi condit definit concept part present obtain ffi construct rememb shown complet proof claim lemma proof claim conduct manner proof ffi extens properti left reader readi prove lemma proof state lemma show exist sequenc natur eventu realiz construct sequenc induct applic claim lemma obtain fulfil condit state lemma set requir order find argu part case finit sequenc establish satisfi properti state claim construct mn list eventu construct mn induct eventu begin eventu form case domain distinguish proof reason chang rule begin section rule assum situat mean applic assumpt satisfi proce eventu run object find assum minim properti lemma find hold ud defin show realiz end suffic show realiz minim condit requir case case consist part find suitabl successor uniqu node oeg fl ffi applic lemma obtain suitabl hold complet part argument similar case account run minim respect properti applic lemma obtain satisfi defin realiz shown finish minim condit yield complet proof case eventu form distinguish proce eventu exist select run case matter construct sequenc lemma realiz eventu time start role plai construct plai eventu realiz eventu natur number eventu realiz claim prove lemma immedi complet decid theorem complet root elimin satisfi proof assum complet tableau root elimin set node remain execut elimin procedur show satisfi theorem suffici prove exist satisfi order show exist sequenc natur number eventu realiz construct sequenc induct induct argu find set requir order find argument similar case properti state claim construct mn close carri proof lemma bit sketchi list eventu construct sequenc mn induct eventu eventu form proof lemma case distinguish case assum domain remain eventu eventu induct exist domain fm denot concaten domain ig coincid fm ig realiz complet proof case case reason fact elimin mean rule find node oeg hold fl ffi find applic fl satur set suitabl successor sequenc construct rest left similar part proof lemma hold case assum eventu form proce eventu argument exact duplic respect argument proof lemma skip complet proof show sequenc satur defin satur satisfi condit definit check care analysi construct left enthusiast reader theorem effect procedur capabl decid complet root elimin tableau decid satisfi problem proof formula theorem iff complet initi node elimin observ show exist effect procedur capabl decid modulo chang variabl finit complet tableaux gener success effect manner complet decid finit step root elimin decid suitabl complet exist prove claim theorem close section illustr tableau calculu work concret case mean tableau formula introduc section bound domain satisfi proof draw graph fragment tableau root put ffl ffl fx ffl fx remark suffic make pictur arrow drawn pictur applic rule big black node repres satur white remain state repres small black node conveni associ root tableau formal order build suffici addit node belong upper part node left part node part rule appli formula appli concept rule applic appli ax concept rule applic global gener rule fl concept rule appli uc appli concept rule applic appli ax global gener rule fl global gener rule fl fx cg fy fx fy fy fy fz oe relat work paper present procedur tempor descript logic mention work direct close work briefli relat algorithm present ffl schild consid tempor descript logic tempor oper appli concept axiom present approach flow time consist natur number schild develop tableau algorithm decid satisfi concept base tableau schild languag real interact tempor oper alc reflect fact concept satisfi problem satisfi problem languag consid present paper person ffl baader develop procedur basic modal logic base alc interpret model expand domain applic modal oper concept tableau simpler present base alc finit model properti complet constraint system directli transform finit modal requir reflect complex problem person ffl dixon fisher develop procedur tempor logic base epistem modal logic extend proposit tempor tableaux tempor epistem logic interact tempor epistem oper reflect fact satisfi problem system mention develop procedur tempor descript logic tempor part base interv point requir techniqu complet develop present introduc investig resolut method tempor epistem logic conclud remark work present paper shown standard linear proposit tempor logic alc combin obtain tempor alc interact dimens show bridg gap model provid complet tableaux intend model languag tableau present deficit work expand domain constant domain model paper extend give solut problem method combin tableaux fruitfulli appli obtain algorithm logic fragment logic work requir work obtain effici tableau present left futur tableau basic requir algorithm refer van den bussch tempor versu logic queri tempor acm symposium principl page artal franconi comput account descript logic time action fourth confer principl knowledg page morgan kaufman artal franconi tempor descript logic handbook time tempor reason alessandro artal enrico franconi tempor descript logic reason action plan journal artifici intellig research baader terminolog logic modal oper intern joint confer artifici page morgan kaufman bettini reason tempor descript logic data knowledg borgida descript logic data manag ieee tran knowledg data schaerf decid reason terminolog knowledg system journal artifici intellig diego giusepp de maurizio lenzerini decid queri constraint proc acm sigact sigmod sigart sym principl system page diego maurizio daniel nardi descript logic conceptu data model jan chomicki gunter logic inform page kluwer academ catarci lenzerini repres interschema knowledg cooper inform system intellig cooper inform chomicki tempor queri survei gabbai hj tempor intern page vardi reason knowledg mit finger gabbai ad tempor dimens logic system journal languag finger gabbai combin tempor logic system notr dame journal formal dixon resolut base proof method tempor logic knowledg belief intern confer formal appli practic procedur tempor logic phd halpern mose guid complet complex modal logic knowledg belief artifici halpern vardi complex reason knowledg lower bound journal comput system zakharyaschev fragment tempor logic annal pure appli horrock tableaux procedur descript logic phd horrock sattler descript logic transit role role hierarchi journal logic interpret arithmet tempor logic journal theoret comput merz decid incomplet result tempor logic linear time journal appli schild combin terminolog logic logic confer artifici page tempor terminolog logic nation confer american associ artifici page complex modal logic phd depart mathemat comput incomplet tempor logic theoret comput wolper tableau method tempor overview wolter zakharyaschev satisfi problem descript logic modal oper confer principl knowledg morgan kaufman wolter zakharyaschev modal descript modal role fundamenta wolter zakharyaschev tempor descript logic gabbai de frontier combin page studi wolter zakharyaschev reason base sixth confer principl knowledg morgan kaufman fisher proof method tempor logic knowledg belief journal appli gt es gt ke sr ji hh moor configur support manufactur network system ai
HCI/110 4 mitsubishi electr research laboratori plan recognit collabor neal lesh charl rich candac sidner decemb abstract collabor practic applic plan recognit techniqu describ plan recognit algorithm tractabl virtu exploit properti collabor focu partial elabor hierarch possibl clarif demonstr addit plan recognit algorithm implement collabor system reduc amount commun requir user submit seventh int conf user june work copi reproduc part commerci permiss copi part payment fee grant educ research provid partial copi includ notic copi permiss mitsubishi electr inform technolog center acknowledg author individu contribut applic portion copyright notic republish requir payment fee mitsubishi electr inform technolog center america reserv copyright mitsubishi electr inform technolog center massachusett lotu develop corpor public decemb plan recognit collabor neal charl candac sidner mitsubishi electr research laboratori lotu develop corpor abstract collabor practic applic plan recognit techniqu describ plan recognit algorithm tractabl virtu exploit properti collabor focu partial elabor hierarch possibl clarif demonstr addit plan recognit algorithm implement collabor system reduc amount commun requir user introduct import trend recent work interact user model view interact kind collabor human user comput coordin action achiev share goal common set illustr figur focu particip commun observ action share artifact success collabor requir particip substanti mutual understand share goal action intend achiev part grosz sidner call maintain mutual understand verbal particip explicitli discuss goal method achiev effici natur convei intent perform action peopl attempt lock car pick infer plan person reach unlock door plan recognit term gener process infer intent action plan recognit featur human proven difficult incorpor practic collabor system due inher intract gener case section describ exploit properti collabor set order make plan recognit practic properti exploit focu partial elabor hierarch possibl clarif demonstr approach context implement collabor system email section present session illustr gener idea collabor plan recognit reduc commun burden section describ underli plan recognit interpret algorithm detail section present result preliminari experi email domain discuss relat work conclud decemb user agent primit action commun observ share artifact observ primit action set collabor graphic interfac email collabor plan recognit plan recognit work work unread unread read messag messag read messag long lunch long lunch email email read messag chuck read messag chuck read messag window read messag window messag messag expect react messag expect react messag react send fill messag messag send email react messag chuck goal react messag addit edit action addit edit action fill fill cancel save cancel save save save email session plan recognit figur decemb email collabor manag base sharedplan theori collabor experi applic includ air travel email figur show abstract set collabor figur instanti email domain larg window figur graphic interfac email part lotu collabor overlap window corner figur home commun tool kei step build collabor agent develop detail task model domain base empir studi peopl work sidner colleagu formal task structur domain term primit action individu click interfac plan recognit left column figur show function plan recognit part session user initi notic user labori announc goal perform primit action contribut achiev plan maintain mutual understand success collabor simpl collabor occur user return long lunch earlier intent state immedi evid state graphic show browser window click url messag email window base earlier announc agent construct commun back user expect user continu announc subgoal line declar goal fill messag start line agent opportun suggest expect action user request agent perform plan recognit column figur show task left plan recognit algorithm incorpor notic unlik previou user session requir announc goal subgoal perform primit act line line agent construct sharedplan plan recognit total elimin commun intent collabor clarif ambigu interpret action action line consist send messag user react messag chuck chuck suggest send email start unrel email goal agent interrupt user commun line deriv gener capabl maintain call segment interact decemb line resolv ambigu section discuss strategi clarif question role plan recognit collabor section preview main point present remaind abstract detail sharedplan kei compon mental state particip collabor set belief mutual believ goal action mutual believ commit particip particip updat set call base part commun observ particip particip set call goal subgoal gener role plan recognit framework softwar observ perform action agent invok plan recognit determin set extens current sharedplan consist recip knowledg includ user perform agent adopt extens clarif question similar stori told user perform exploit properti collabor set make plan recognit tractabl properti focu attent user work action establish context restrict interpret futur utter action full implic focu attent scope paper work weaker notion limit search requir plan recognit properti collabor exploit process commun execut plan interleav input output plan recogn partial elabor hierarch plan unlik definit plan recognit requir reason complet correct recogn requir increment extend plan natur collabor inher simpli comput requir understand observ mention action abil clarif ensur number action plan recogn interpret small algorithm section present plan recogn describ interpret begin adopt straightforward formal recip act set action includ primit prim act top agent messag dan reaction messag week user react messag focu act call segment sharedplan theori theori specifi rule segment push pop decemb recip action plan qs focu plan recogn qs qs qs qs qs qs plan action appli recip input plan focu figur simpl input output plan recognit collabor primit action execut action achiev indirectli achiev action assum predic return true achiev execut action explicitli refer belief hierarch goal decomposit found formal tupl simpli call set set direct acycl edg edg ai aj mean aj set constraint includ tempor order action logic relat paramet shown figur plan view tree set shown plan defin ai ai assum predic determin defin function return plan result replac action action recip method action subgoal repres recip function map action plan achiev action recip set recip rk function action ai aj ai edg ai aj aj step recip rk achiev ai defin function return plan plan recognit shown figur input plan recogn sequenc action focu action recip librari output recogn set extens input action appli recip focu output shown line figur implement recip option simplic includ featur formul rk return plan applic ai decemb plan recognit foreach ti add foreach gi add remov foreach gi add act prim foreach recip rk foreach sj add return figur algorithm ambigu clarif plan focu act repeat wait input action plan focu null add ai act pick null set focu root plan remov pick pick pick null plan pick focu act action reachabl deriv composit call rk ak smaller plan satisfi properti figur show simpl plan recogn perform exhaust search wai extend input plan explain input action understand search input plan extend includ input action explain recogn appli sequenc recip rk input plan replac action result plan recip appli action plan expand beneath focu act subgoal structur function return set action reachabl appli recip action fring recogn consid appli step ad justifi plan minim extend explain action appli recip multipl action origin plan recogn appli recip step ad consid appli ri step ad size search space explain action bound maximum number step maximum number recip applic number action fring recip sequenc length replac action plan decemb length longest sequenc recip rl algorithm recogn find plan explain input action repeat entir process find wai extend explain action found plan minim explain input action algorithm input complex maximum fring size point number input action compar gener gener recogn search entir plan output plan step depth deepest plan note recip appli explain singl plan depth total number plan search number input action collabor plan recognit problem significantli tractabl gener plan recognit problem number input action small polici clarif number unexplain action threshold ambigu clarif discuss incorpor plan recognit collabor agent figur scope paper present full sharedplan interpret algorithm concentr role focu attent recogn return multipl explan focu attent natur peopl context understand ambigu statement peopl typic interpret potenti ambigu save obviou interpret make focu act restrict search space plan recogn recogn fail find explan current focu expand set focu root current plan call recogn function figur return act act nearest ancestor plan focu gener set goal includ observ mention act focu attent uniqu explan ambigu wait clarif reason wait futur action resolv ambigu reason collabor system user comput util clarif simpl clarif unexplain small set briefli discuss manag clarif collabor agent user recent line bound due cycl recip set halt search cycl encount assum recip librari acycl strategi recogn return explan method clarif ambigu start top level goal work option step current recip decemb plan recognit execut clarif action question rec rec toler ambigu action question step cpu sec plan clarifi plan ambigu recogn figur result averag random trial email domain figur ambigu agent action plan disambigu intermedi recip gener agent pursu varieti clarif includ potenti lengthi dialogu agent user simpl dialogu requir user explan current mixtur agent engag potenti lengthi intend expand repertoir includ strategi evalu incorpor plan recognit present result random experi lotu tm email disclaim perform plan recognit sensit domain structur recip librari mention section recip librari develop base inform observ real user primit action experi step demonstr measur plan recognit collabor randomli instanti plan simul user execut user commun action plan chose simul extrem case user volunt inform execut primit action answer clarif question agent shown figur user goal plan user clarif question plan recal algorithm determin clarif set figur show result experi set note number clarif recogn user plan recognit requir cpu time relat work main differ work previou work set plan recognit work show leverag properti collabor set make plan recognit tractabl demonstr practic plan recognit decemb implement collabor system substanti system plan recogn reason plan goal domin framework plan recognit research observ actor unawar observ recogn input recogn partial elabor plan focu act addit input simplifi plan recognit task recogn extend input appli recip explain input action collabor role plan recognit deduc collabor commun natur effici recent work plan research address limit framework discuss varieti approach illustr set result techniqu differ present plan recogn run polynomi time algorithm recogn top level goal suffici achiev polynomi time step recip total restrict domain fast recognit algorithm adapt formul lochbaum present plan recognit algorithm base sharedplan model collabor plan recogn chain recip perform level recognit make wider rang relat action contribut goal plan recognit studi collabor set particip work plan pool inform coordin action work explor opportun plan recognit particip announc goal fail work close spirit research plan recognit cooper dialogu context narrow scope plan recognit resembl heurist work cooper gener address plan answer question adequ concentr collabor set joint plan maintain collabor share artifact particip interact relat distinct concern ambigu primari sourc ambigu cooper gener work resid determin top level goal student credit ambigu multipl wai connect action higher level goal varieti strategi reduc ambigu includ adopt worst explan observ adversari set assum observ person expert system suggest medic assist domain collabor focu attent reduc fail person appli probabilist approach recognit collabor benefici elimin ambigu clarif collabor fundament collabor plan recognit facilit intellig user decemb comput watch user jump advic assist recogn deduc goal approach view interact particip commit maintain mutual understand common goal make assumpt infer goal plan observ primit interfac action assist mutual understand collabor fruit applic plan recognit particip commit maintain mutual understand goal action perform question softwar agent agent user commun intent shown plan recognit effici natur commun modest comput effort refer dynam user model recognit plan user user model user adapt volum page paul tool intellig system proc int joint conf ai carberri incorpor default infer plan recognit proc nat conf volum page juli van beek framework solicit clarif user plan recognit fourth int confer user page ferguson allen integr intellig assist proc nat conf page webber bia recogn plan goal minim fail proc nat conf page goodman litman plan recognit intellig interfac proc ieee conf ai grosz krau collabor plan complex group action artifici octob grosz sidner plan intent page mit curri mechan dynam chang initi collabor human interact complex system ha kautz jf allen gener plan recognit proc nat conf page lambert carberri model dialogu proc annual meet page lesh etzioni sound fast goal recogn proc int joint conf page lin goebel messag pass algorithm plan recognit proc int joint conf volum page juli decemb lochbaum algorithm plan recognit collabor proc annual meet lochbaum collabor plan model intent structur technic report harvard ctr comput phd thesi lochbaum collabor plan model intent structur comput forthcom sidner model plan support initi report proc nation conf artifici page juli rich sidner collabor manag softwar interfac agent user model special issu comput model interact forthcom publish merl technic report rickel johnson anim agent procedur train virtual motor control appli artifici richard alan dialog control algorithm perform confer appli natur languag april milind tamb paul rosenbloom approach dynam proc int joint conf page grammat analysi plan recognit proc nat conf page robert david marc jame jame wu berkelei unix consult project comput decemb
ML/111 6 system der forschungsgemeinschaft joachim buhmann empir risk induct principl learn preprint empir risk induct principl learn joachim buhmann institut fur informatik germani novemb abstract learn algorithm design extract structur data refer explicit teacher inform qualiti infer structur determin qualiti function guid search valid process structur data paper empir risk approxim induct principl learn hypothesi class structur complex learn model automat control larg deviat bound maximum entropi principl determinist anneal effici search strategi empir risk approxim principl optim infer strategi larg learn problem paramet select learnabl data structur demonstr case cluster learn algorithm design goal mind extract structur data class algorithm wide discuss literatur learn distinct class relat teacher inform learn algorithm miss learn process paper present theori learn base empir risk approxim gener empir risk minim induct principl describ approxim structur data era principl develop analog highli success statist learn theori classif regress learn classif boundari regress function learn algorithm provid point select candid function set call hypothesi class statist learn develop vapnik chervonenki seri semin paper measur amount inform data set determin paramet classif regress model comput learn theori address comput problem learn addit statist constraint empir risk approxim paper theoret framework learn base optim qualiti function structur data set learn algorithm select structur score sampl set averag structur minim empir risk structur statist indistinguish qualiti induct principl refer empir risk approxim summar infer defin hypothesi class structur data qualiti candid structur measur loss function find minimum empir risk inf ff determin approxim accuraci induct reliabl statist learn averag structur empir risk exce minimum empir risk app import note era principl averag structur approxim accuraci minim empir risk select loss function minim empir risk averag prevent induct algorithm extract structur typic level averag loss function similar spirit bayesian infer procedur resembl averag classifi bag boost freund kei problem solv learn determin minim approxim level yield small deviat expect risk empir risk techniqu combin larg deviat bound calcul approxim accuraci cover techniqu requir knowledg data distribut impli deviat philosophi learn quest distribut independ result natur requir specif knowledg data distribut structur data exist scale scale distribut depend gener theori learn base optim learn algorithm return structur valid data evalu comparison function altern structur data explicitli formul learn conceptu reli structur case learn algorithm discuss literatur emphasi optim data cluster vector quantiz buhmann selforgan map ritter princip independ compon analysi bell princip curv project pursuit structur detect imag algorithm relat data scale cluster histogram base cluster method hofmann distribut depend result learn yield scale sensit inform learn curv empir risk approxim altern view learn preval bayesian statist bayesian school neural comput defin learn densiti estim data sourc bayesian view interest question relat structur data answer robust probabilist model data ultim success learn achiev data gener learn learn algorithm infer gener model data mixtur model gaussian mixtur promin exampl concept learn machin gener topograph map neural network model jordan belong class gener model gener framework era principl mathemat formul develop sec sampl complex bound learn paramet select criterion discuss sec theori learn appli case central cluster sec cluster select criterion deriv limit number learnabl cluster mathemat framework learn data sampl ae learn algorithm assum element suitabl euclidian space data distribut measur assum analysi question learn data distribut assum address sect discuss empir expect risk hypothesi class mathemat statement era induct principl requir definit formal notion learn cost structur data qualiti structur extract data set evalu learn cost function denot empir risk learn iid sampl set function loss function statist measur learn cost process gener datum correspond neg stochast model ff parametr individu loss function denot paramet set paramet ff structur data set hypothet consid candid structur learn process valid set loss function denot hypothesi class ff distanc function measur norm altern norm lq norm loss function scale suitabl function differ expect risk close ident term distanc empir risk approxim statist learn theori distinguish class loss function classif bound function unbound function regress problem paper concern class unbound function interest polynomi loss function occur vector princip compon analysi kxk scale kxk densiti estim learn problem fit framework neg loss function loss function render distribut independ learn result imposs reflect scale sensit structur primari target learn assum distribut analysi decai suffici fast rth moment loss function bound der denot expect varianc random distribut depend constant moment constraint distribut hold distribut exponenti fast decai tail includ distribut finit support learn cost function depend iid data set random variabl relev qualiti measur easili evalu empir risk expect expect risk learn minima solut bound empir risk influenc fluctuat expect risk complet determin qualiti learn result sound probabilist fashion qualiti infer process assess measur strongli expect risk minim empir risk loss function ff ff arg min deviat minim expect risk achiev inf estim optim approxim accuraci learn problem select repres subset loss function indic fff ff ff index loss function minim empir risk ad index set simplifi bound argument repres loss function ff chosen function hypothesi class element function ball center function ball radiu defin ae jh ff oe distanc function measur distanc set loss function hr ae ae hypothesi class index subset parametr hr empir risk approxim approxim minim expect risk interest approxim qualiti minim expect risk inf minim empir risk loss function cover properti yield chain bound inf inf deviat empir risk expect risk measur scale maxim standard deviat oe probabl solut poor qualiti select erm principl bound bernstein der ae inf oe exp fhg exp ffl oe oe ffi inequ result upper bound fhg oe probabl larg deviat bound cardin time exponenti factor kei upper bound cardin calcul cardin approxim ratio cardin complet hypothesi class divid cardin function ball center minim loss function cardin fi fi fi fi function ball radiu approxim adopt techniqu statist physic asymptot analysi fi fi fi fi fi dx exp nx log exp xn empir risk approxim denot step function quantiti free energi statist physic paramet denot scale behavior hypothesi class complex hypothesi class determin number cell data space assign sec transform introduc lagrang paramet limit maxim risk differ loss function paramet temperatur statist physic loss function minim expect risk strict lower bound loss function hypothesi class ff function ball radiu ident hypothesi class bound expect sampl complex paramet select larg deviat inequ weigh compet effect learn probabl larg deviat exponenti grow sampl size larg deviat increasingli grow cardin hypothesi class effect determin reliabl estim data set sampl complex ffi defin number data deviat empir risk expect risk rel varianc occur probabl larger ffi eq sampl complex ffi defin log ffl oe oe log ffi equal yield function relationship ffl approxim qualiti fix sampl size confid ffi fulfil requir inf sampl size bound ffl cover function space limit finit achiev qualit insight gain relat neglect factor oe bound essenti assum tail data distribut bound gaussian solv ffl differenti wrt determin minimum nonmonoton reflect uncertainti origin empir fluctuat loss due approxim deriv optim temperatur opt oe log log ffi reader note optim temperatur opt optim grow sampl set size reflect higher infer larger sampl set high opt yield minim deviat empir risk expect risk amount ffl opt oe oe log log ffi app interest situat log cardin hypothesi class scale proport number data situat correspond structur risk minim empir risk approxim principl introduc vapnik larg deviat bound limit infer express discuss mechan context cluster yield criterion select effect number paramet averag structur data era principl requir averag loss function distinguish infer process due lack inform approxim empir risk structur hypothesi class deviat expect risk app bound deviat expect empir risk exist structur minim empir risk combin deviat yield bound differ empir risk structur minim expect minim empir app app app averag set loss function empir risk exce minim empir risk app yield estim statist structur app app lim ffi ffi dx ln exp app xl connect maximum entropi statist mechan approach appar loss function averag weight boltzmann factor exp xl jj function deriv ffi field introduc calcul averag set loss function app bound empir risk averag set loss function canon averag loss function statist physic temperatur loss function cardin calcul correspond approach statist mechan relat inf statist mechan approach learn render maximum entropi optim optim continu method discret continu optim problem valid algorithm simul determinist anneal data analysi distribut depend era critic assumpt era principl learn requir distribut data assum assumpt studi paramet select phenomena structur data unfold specif scale data space scale select data distribut encod moment empir risk approxim distribut varianc wide accept requir learn theori learn distribut independ partial appli structur learn distribut independ impli scale independ infer principl discard structur defin specif scale data distribut occur scale distribut independ set distribut identifi full detail belong class distribut select scale moment constraint bound establish fact sampl complex depend maxim varianc oe random variabl cardin hr independ detail distribut class distribut defin oe yield result era infer process statist learn theori central cluster import gener framework statist theori develop section central vector quantiz interest problem partit data space partit cluster center mass assum risk central cluster data partit repres map kg assign partit label kg data vector qualiti partit measur sum averag squar distanc data point assign empir cost function kx denot delta empir cost measur euclidian distanc data assign cluster criterion favor cluster maxim compact expect risk loss function cluster defin kx xk kx mean quadrat loss depend pair random variabl rewritten loss depend random variabl suffici statist transform pattern recognit literatur empir risk approxim figur loss function mean locat shown bold solid line bound depict dot line respect assign map jump valu hold quadrat loss loss function data mean depict fig hypothesi class cluster defin kx partit centroid complex hypothesi class determin cover finit restrict infinit introduc regular function set natur choic quantiz data requir constant assign data cluster learn theoret approach cluster differ underli hypothesi assum data assign closest data bound support linder linder analysi constraint data assign found algorithm iii hard assign select predefin probabl resembl random select loss function hypothesi class regular hypothesi class natur choic quantiz data space maxim risk differ constant defin nearest neighbor partit arg kx loss function maxim risk consist centroid arg kxk empir risk approxim cluster locat center mass data distribut assum shift origin partit data space risk differ cell fl fi fi fi fi fi regular assign function data space finit granular yield upper bound distanc function summat side yield number cell fl fi fi fi fi fi fi fl denot maxim risk differ equat quantiz space inhomogen low data densiti small loss lead larg part data space high densiti fine partit hypothesi class fl result space quantiz finit consid regular version cardin regular hypothesi class era principl consist step determin approxim averag loss function empir risk app step requir evalu larg deviat bound base bernstein inequ probabl larg deviat limit cardin hypothesi class time exponenti decai hoeffd factor regular hypothesi class fl defin cardin fl calcul count number function function ball radiu cardin fi fi fi fi fi fi fi fi fi dy exp dx log exp scheme regular hypothesi class data data space partit cell size proport probabl data drawn cell empir partit sampl set sampl center voronoi cell correspond scheme empir risk approxim cardin depend entropi determin suffici larg maximum linear term eq neglect cardin scale ns sp calcul summar appendix integr domin maximum respect equat ff iff iff iff exp xn ff exp xn iff fm ffg denot probabl data cell assign averag cluster ff loss function randomli select ball radiu center empir minimum equat probabilist version definit hard assign datum cluster ff encod replac probabilist assign iff import realiz solv determin optim temperatur averag loss era principl requir averag loss function empir risk larger app empir risk minimum averag yield determinist anneal equat central cluster data set buhmann ff iff iff iff exp ff exp auxiliari variabl comp correspond comput temperatur buhmann calcul approxim qualiti app app result replac app determinist anneal approach probabilist cluster util temperatur paramet control smooth effect cost function optim pursu gradual reduc temperatur solut permit kxk case data assign probabl cluster locat center mass data distribut equal equat defin critic point relat phenomenon phase transit cluster addit phase transit occur lower valu data set partit smaller smaller cluster figur show posit cluster mean partit problem mixtur distribut gaussian varianc center bold curv plot mean estim basi sampl temperatur resolut paramet control complex cluster locat cluster separ thin curv depict estim empir risk approxim small sampl set deviat expect posit occur mean separ lower temperatur local minima effect common small sampl size figur posit mean shown function comput temperatur sampl set size data distribut depict mixtur gaussian varianc locat empir risk approxim sampl complex cluster size sampl set relat accuraci cluster estim confid level ffi eq relat ffl oe log ffi deriv neglect correct term oe analysi includ term deriv analog optim temperatur opt requir approxim qualiti ffl assum minim optim temperatur opt oe log opt log ffi oe log opt opt log ffi ae nn cost differ assign cluster ae nearest neighbor centroid nn fact loss function optim temperatur depend robust huber quantiti oe jxj jxj relev scale learn interest situat ffl case classic mode paramet estim fix model complex sampl size data infer process smaller uncertainti data partit asymptot limit cell data space uniqu assign cluster ffl fl fl cell size fl scale proport number data case structur risk minim suggest mechan control model complex minim yield bound temperatur vanish limit infinit larg sampl set lim opt oe fl paramet fl control resolut data assign small valu fl encod fine quantiz data space balanc high temperatur data finit temperatur case relev model complex figur demonstr structur cluster solut unfold temperatur lower approxim qualiti low resolv cluster success temperatur favor split cluster maxim number admit cluster era induct principl principl stop refin extrem cluster data point reach empir risk approxim split data small group warrant uniform converg requir larg fluctuat render cluster estim ff small sampl set comput temperatur act regular paramet prevent cluster refin overfit behavior regular effect pronounc partit problem small ratio sampl dimens spin glass behavior observ worth mention sampl complex depend data distribut minim varianc loss function oe number cell entropi sp quantiti integr distribut measur moment data hold distribut belong class distribut defin moment era achiev analysi probabl distribut data scale paramet control resolut densiti discuss theori era learn problem extend vapnik highli success statist learn theori learn larg class learn problem respect loss function empir risk uniformli converg expect risk loss function app rang empir risk minimum consid infer limit complex hypothesi class number sampl central cluster demonstr underli hypothesi class learn problem possibl assum infinit regular finit set repres loss function cardin set determin entropi solut paramet encod hypothesi class maximum entropi method wide emploi determinist anneal procedur optim problem substanti analysi identifi optim procedur larg scale problem logarithm correct learn problem formul combinatori continu optim problem framework learn defin theori robust algorithm design noisi combinatori optim minimum flow problem noisi cost process optim fluctuat travel salesman problem travel time citi schedul problem fluctuat demand process robust solut noisi optim problem requir stabil fluctuat problem solut gener problem instanc equal instanc real world applic noisi optim problem situat determinist variant neglect influenc search global optimum yield inferior solut hard find comput complex reason structur risk minim introduc vapnik induct principl circumst size sampl set hypothesi class defin nest structur set function subset select number sampl hypothesi class function minim empir risk chosen era base nest sequenc set function differ srm principl era algorithm averag subset sequenc select function minim empir risk empir risk approxim import consequ pattern recognit point view possibl deriv paramet select criterion era principl solut paramet overfit problem paramet gener sampl set sampl set constraint combin larg deviat bound determin statist indistinguish set structur data structur infer process reflect uncertainti answer averag indistinguish structur avoid overfit set statist solut nearest neighbor loss function maxim number set solut cluster center depend minim temperatur statist learn theori learn establish link robust algorithm design optim heurist simul anneal determinist anneal comput temperatur regular paramet similar temperatur depend regular structur risk minim scheme complex control learn appar hint unexplor parallel learn pleasur puzicha tishbi illumin discuss work support german research foundat german israel foundat scienc research develop newton institut neural network machin learn program appendix appendix summar calcul deriv eq fi fi fi fi fi fi ffi ae ym dy dy ffi step function regular transform ffi dx empir risk approxim introduc cluster probabl abbrevi cardin rewritten transform fi fi fi fi fi dy exp dp dp exp dz dx exp dy dp dp dz dx exp exp summat admiss valu assign variabl carri close form variabl occur linearli exponenti function integr auxiliari variabl carri residu formula integr path contour quadrant complex plane posit neg imaginari part transform auxiliari variabl xn intens coordin yield fi fi fi fi fi dy dp dp dx exp exp dy dp dp dx exp empir risk approxim abbrevi xr ln exp cardin fi fi fi fi determin maxima function wrt variat variabl requir equat ae ae ae ae ae ae ae ae ae ae ae ae abbrevi multipli eq ae insert eq result eq yield condit centroid ae term eq vanish point extrem impli consequ auxiliari variabl vanish definit centroid repres data natur conjug field finit valu bia statist integr variabl yield argument exponenti function explicitli depend variabl replac variabl logarithm term deriv cardin fi fi fi fi fi fi fi fi fi dy exp dx log exp correct neglect integr scale ns sp empir risk approxim refer statist mechan densiti estim physic review neural network discov surfac approach blind separ blind deconvolut neural neural network pattern recognit clarendon oxford gener topograph map neural bag predictor machin asymptot method analysi publish amsterdam vector quantiz complex cost ieee transact inform scale number monograph statist appli probabl chapman london machin neural nonparametr densiti view john wilei son probabilist theori pattern recognit springer heidelberg pattern classif scene analysi york boost weak learn algorithm major inform select sampl queri algorithm machin vector quantiz signal process kluwer academ boston princip curv journal american statist empir risk approxim rigor learn curv bound statist mechan machin gener model discov distribut philosoph transact royal data cluster determinist anneal ieee transact pattern analysi machin statist model cooccurr data artif intellig massachusett institut technolog project pursuit annal robust statist york hierarch mixtur expert em algorithm neural analysi hard soft assign method cluster uncertainti artifici intellig aaai scale determinist anneal lectur note comput page springer verlag associ memori berlin rate converg sourc code empir quantiz design lossi sourc code ieee transact inform empir quantiz design presenc sourc channel ieee transact inform mixtur model marcel basel distribut cluster english word annual meet associ comput page network approxim learn empir risk approxim quantiz method ieee transact inform pattern recognit neural network cambridg press neural comput map addison york statist mechan phase transit cluster physic review theori learnabl commun associ comput der van der weak converg empir process heidelberg estim depend base empir data heidelberg statist learn theori york uniform converg rel frequenc event probabl theori probabl
Agents/112 1 result coordin heterogen robot assembl reid david smith robot institut carnegi mellon pa system reli cooper assembl larg requir tighter coordin present gener softwar architectur coordin heterogen robot autonomi individu agent explicit coordin paper present recent result robot configur work robot perform dock task achiev individu introduct robot autonom increasingli complex demand task singl robot insuffici perform task type explor multipl robot effici reliabl multipl robot explicit coordin robot imper research focu class individu robot vastli capabl heterogen robot difficulti construct singl robot applic domain assembl terrestri planetari space solar power structur domain heavi lift dexter manipul connect part motiv scenario assembl steel structur larg build larg crane lift beam move worker destin hand signal guid crane beam close worker grab end move place research goal accomplish scenario team autonom robot initi assembl scenario long heavi beam task strength dexter approach coordin overhead mobil ey crane heavi lift capabl larg manipul dexter weaker smaller workspac fix posit ey accur view guid robot task chosen highlight issu heterogen robot research issu includ techniqu explicit coordin distribut visual plan execut techniqu advantag heterogen natur robot robust monitor except handl team issu includ dynam team format larg number robot distribut plan build complex structur part paper present approach compar work research discuss distribut coordin distribut visual context beam placement task accomplish team robot approach approach coordin heterogen robot base layer architectur increasingli popular autonom system robot autonom consist plan layer decid achiev execut layer synchron sequenc task monitor task behavior layer interfac sensor effector customari tier layer interact agent interact direct connect layer type interact flexibl effici robot coordin planner execut behavior planner execut behavior robot planner execut behavior robot figur layer architectur robot layer directli interact layer robot behavior level typic consist feedback loop connect sensor behavior robot effector behavior creat effici distribut servo visual servo section enabl robot execut interact section easili synchron task perform multipl robot monitor robot handl except robot import robot coordin explicitli perform complex task plan layer flexibl construct multiag plan optim resourc util approach total distribut distribut negoti agent decid agent perform role agent global agent bid subtask agent chang depend dynam negoti agent form team assign task team form joint intent provid basi coordin action individu agent negoti carri assign task robot jointli hold request move order obtain freedom motion addit task monitor ad replac team member problem relat work approach stand contrast current work system current approach categor approach agent explicit coordin coordin emerg properti behavior robot interact environ allianc architectur robot decid task perform rise fall notic task allianc handl heterogen robot motiv deal problem explicit coordin demonstr task requir multipl robot end approach central planner plan detail action robot planner treat dof arm singl dof system plan detail trajectori enabl arm work move bump approach tight local robot autonomi approach emploi central monitor planner invok replan approach suffer singl point failur individu robot autonom solv problem negoti invok planner characterist reduc commun improv reliabl approach similar work coordin strategi explicitli repres reason architectur support dynam team format coordin occur agent fill specif role structur role dynam assign manner similar plan distribut method optim assign role testb testb ey mobil manipul call invert stewart platform built nation institut standard technolog consist larg triangular platform support cabl attach motor enabl move freeli freedom roughli foot cube workspac ad motor pai cabl long beam attach ey robot diamet robot stereo camera mount head mobil manipul built top wheel robot call drive avoid obstacl stereo vision manipul mount front dof arm design built nasa johnson space center end effector electromagnet mount spring end wrist attach hang beam robot commun workstat wavelan radio ethernet figur testb consist dof mobil ey robot distribut coordin perform assembl robot coordin action crane mobil manipul coordin manipul freedom move beam support weight ey crane coordin posit beam estim approach problem distribut coordin extend work singl robot control basic idea agent execut plan dynam construct task tree node task tree repres primit behavior execut goal subgoal monitor period task tree partial tempor constraint constrain goal start goal impli subtask start subtask complet task except termin task tempor constraint goal decomposit strategi encod task descript languag superset explicit syntax support creat control program extend deal synchron multipl agent idea distribut task tree robot maintain part complet tree portion deal goal tempor constraint node robot encod task robot start task robot start extens made enabl robot monitor handl except termin task agent version form infrastructur express synchron constraint address coordin place task plan layer scenario task connect beam call put manag fill agent suffici knowledg comput resourc chosen put request ey mobil depend task hand agent particip ey head conceiv assist assembl proxim team chosen role agent coordin ey crane coordin exchang crane mobil manipul coordin decid move scenario illustr goal multiag current implement fix set fix fix task assign agent decid robot move beam time initi task crane move beam vicin crane base sole encod feedback fiduci beam field view set behavior loop ey crane robot servo beam point monitor progress differ desir observ pose fiduci resolut task ey mobil manipul servo arm grasp beam arm contact initi task ey mobil manipul coordin servo beam complet task handl ey figur robot agent assembl task agent commun directli agent crane mobil manipul negoti directli simpl task failur arm lose contact restart task mobil manipul find limit negoti directli crane robot provid slack beam distribut visual servo crane mobil futur manipul import step research develop techniqu distribut visual servo ey pair camera track fiduci mobil manipul destin site figur track fiduci ey robot fiduci mount fix beam mobil manipul ey move order maintain view fiduci pan tilt camera drive workspac target sight center move back ensur target fill field view stereo comput dof pose object mark differ pose object comput manipul motion command figur illustr data flow modul visual servo run set distribut implement skill manag architectur inform flow modul implement messag pass visual track figur data flow distribut visual servo modul servo control motion hint ey behavior ey pose differ behavior control execut manipul manag motion command crane ey commun crane mobil manipul move beam order posit properli robot commun inform sole term task space relationship beam manipul manag modul compon perform geometr transform task space manipul space pose differ combin knowledg goal comput motion motion transform robot kinemat model determin move achiev desir transform servo process start ey provid inform crane continu crane close base accur crane expect move beam close beam arm grasp final posit crane move beam close goal arm visual servo grasp beam grasp motion arm work similarli crane motion ey track arm horizont beam held crane manipul manag comput desir motion combin knowledg desir grasp point beam arm motion dynam posit command interrupt complet smooth arm motion combin safeti arm stop receiv motion command reason servo loop stop gripper contact beam stick final phase arm move beam dock stationari beam grasp beam hang crane complianc complic motion arm full control beam effect control posit end orient angl beam magnet hold beam subtask ey track posit stationari move arm arm manipul manag comput motion move end beam correct posit angl match angl grasp beam servo loop stop end move beam slot atop fix beam oper accuraci placement hang beam visual servo run set behavior distribut robot ey continu track manipul manag calcul motion command crane crane arm obei command crane move make discret move ignor command previou finish arm move adjust motion command execut modul implement part manag process stop behavior bar code fiduci beam uniqu identif fiduci current robust background track start adapt correctli separ black white fiduci shadow strong light connect compon found pick end fiduci pair endpoint bar code scan pair valid bar code fiduci data found triangul posit corner fit model fiduci data ey motion control ey motion accomplish pan fiduci center move forward backward camera close motion move face fiduci directli run behavior ey directli front fiduci close close danger move field view camera behavior diagram figur result motion depict figur ey behavior receiv inform vision system form motion consist bound box fiduci imag averag angl surfac normal rel camera point angl bound box fiduci pan behavior edg fiduci edg field view simultan bound box forward motion behavior drive ey fiduci side bound box close edg ey back side edg drive forward motion behavior averag fiduci surfac normal angl project ground plane move robot left directli front fiduci import fiduci view angl track fail ey behavior combin produc smooth motion vision updat fast rel drive speed ey figur show motion forward motion output combin vector sum vector defin rel orient camera pan behavior turn direct vector behavior chang robot motion move fiduci trigger pan behavior effect gener smooth motion spiral arc zoom fill frame vector sum pan center target figur motion behavior ey robot result motion ey demonstr preliminari result coordin team heterogen robot perform assembl task ey higher servo accuraci consist larger workspac fix camera system ey greater robust track failur abil stai align fiduci accur camera calibr visual servo rel posit error due calibr affect measur roughli equal implement manipul manag fall short ideal distribut layer architectur distribut function manipul manag behavior layer multipl agent remov bottleneck high bandwidth commun robot autonom calcul motion command manipul manag acknowledg move face target squar research sponsor part grant nasa robot arm mobil manipul develop nasa grant fund grant refer nist journal robot cooper multiag robot journal robot pp experi architectur reactiv journal artifici intellig mb free market architectur distribut control multirobot proc intern confer intellig autonom system pp campo architectur tightli coupl cooper intern confer robot distribut robot experi proc intern symposium robot pp distribut visual servo proc confer intellig robot system octob nr jen specif implement architectur collabor problem intern journal intellig cooper inform pp distribut mobil robot method dynam proc confer distribut autonom robot system forc strategi cooper task multipl mobil manipul proc intern symposium robot octob distribut approach behavior proc spie sensor fusion pp remot ai system artifici intellig pp august architectur fault toler multirobot ieee transact robot pp april anytim coalit structur gener worst case proc fifteenth nation confer artifici intellig pp madison juli shehori method task alloc agent coalit artifici intellig pp structur control autonom ieee transact robot pp februari layer architectur offic deliveri proc intern confer autonom marina del februari simmon task descript languag robot proc confer intellig robot vancouv octob recent progress local global planetari rover proc intern confer robot san francisco april contract net commun control distribut problem ieee transact pp sycara coordin multipl intellig softwar intern journal cooper inform flexibl journal artifici intellig pp
DB/113 3 control architectur flexibl internet auction server peter wurman michael wellman william walsh kevin michigan artifici intellig laboratori februari abstract flexibl support high activ low activ auction requir system bid human softwar agent present control architectur michigan internet discuss system engin issu design introduct michigan internet auctionbot highli configur auction server built support research electron commerc multiag negoti gener architectur simpl concentr aspect system ineffici made problemat run auction fast interact redesign core auctionbot architectur order improv meet origin system capabl conduct larg number simultan auction auctionbot architectur auction open admit activ embodi auction process pattern interact bidder auction depend number bidder frequenc bid softwar agent analyz inform respond chang market condit quickli human counterpart auction host softwar human expect bid frequent auction host smaller number human oper longer time period expect bid extend period origin auctionbot architectur design primarili low activ time auction process ran handl auction event primari improv system architectur persist auction process support high activ auction paper primarili coordin system compon handl auction ffl creat auctionbot system regist user initi auction rule paramet ffl auctionbot system user bid activ bid replac previou bid agent restrict auctionbot permit flexibl bid ffl bidder withdraw subject auction rule ffl expir auction rule permit bidder time bid expir ffl clear act match buyer seller determin condit price exchang auctionbot design support varieti clear extens set paramet control number time clear event ffl quot give intermedi inform current agent set paramet control number time price quot overview architectur basic architectur illustr figur consist class interfac auction program cgi schedul auction process bid withdraw event event expir event insert updat data api user web browser user agent figur auctionbot architectur interfac modul provid access human web server cgi softwar agent program interfac command full rang auctionbot function paper concern interfac featur initi auction subject section schedul discuss detail section primari task sequenc auction event manag system resourc control set activ dynam swap base upcom event auction discuss section implement auction rule price polici auction program instanti multipl concurr manag auction serv central repositori mediat access modul store detail transact schedul brought offlin effici design auction program capabl manag auction time design save overhead initi complex current design fail auction prevent entir class auction progress messag paramet interfac schedul bid bid auction id withdraw user auction id schedul auction bid bid auction time withdraw user auction time expir bid auction time clear auction time quot auction time load auction time deactiv auction schedul expir bid auction time clear auction time quot auction time termin process id tabl event messag auctionbot system mainten due system interfac continu provid statu inform receiv bid schedul brought back extract event process correct order design high level data assur interfac auction process commun unix socket tabl show messag pass system compon time time event schedul occur discuss action compon send receiv messag auction descript store set paramet state variabl concern auction field shown tabl subset bid record shown tabl note bid offici submiss time field bid recept intern field content auction state open close quot time earliest clear time intermedi clear time final clear time tabl import field auction record field content bid state figur time receiv time submit time admit withdraw state time withdraw request expir time time close tabl import field bid record submit expir withdrawn transact replac partial transact reject admit receiv figur state transit bid system compon interfac modul interfac featur initi auction ffl creat user initi interfac modul creat auction record post auction clear quot event schedul ffl user place bid submiss interfac modul creat bid record state receiv interfac modul send schedul bid event ffl user interfac field user bid termin state send singl withdraw event schedul interfac modul error commun schedul fail system design robust schedul schedul event aspect interfac explicitli diagram figur messag pass auctionbot user user notifi outcom auction includ price clear human user softwar agent notifi directli schedul schedul sequenc manag set activ serv offici timestamp interfac gener event schedul applic share data event protect condit variabl main thread event continu check event queue remov top item time listen thread accept connect auction interfac object creat connect thread receiv messag schedul brought event queue popul extract relev event inform auction record time auction schedul clear quot event bid record includ bid state timestamp state transit inform suffici complet rebuild event queue schedul start accept connect connect thread receiv expir simpli put event queue incom bid withdraw requir schedul interact put event queue bid event schedul bid statu submit put current time time submit field withdraw event schedul retriev bid auction belong user state bid updat withdraw state timestamp time withdraw request field connect thread lock event queue time messag receiv final put queue schedul maintain tabl activ call process tabl entri tabl auction process socket deactiv flag set event loop pop event check auction list process tabl schedul send event directli auction process socket auction schedul open slot process tabl clear slot tabl schedul deactiv run auction process schedul send auction process deactiv messag set deactiv flag process tabl auction receiv messag complet task repli termin messag schedul receiv termin put front event queue schedul action send initi deactiv messag complic schedul wait briefli process termin immedi clear slot process tabl instanti auction auction process termin middl complex auction schedul put event back event queue continu event loop iter event loop top event queue termin messag auction clear slot process origin event prompt schedul select auction continu auction deactiv flag respond termin messag progress deactiv auction result auction tabl deactiv flag set room clear auction schedul event belong auction schedul wait deactiv complet detect auction process handshak ensur auction instanti auction auction finish comput clear slot process tabl schedul invok auction send load auction data set load auction instanti slot fill auction overhead process initi elimin deactiv auction issu load messag auction program auction design maintain intern state event long process run implement increment auction algorithm algorithm avoid larg number access auction consist listen event run event loop receiv event past due level object hierarchi build auction event loop auction deriv base class support manag bid effici pointer bid intern data structur base class mechan bid quickli locat owner id withdraw notif expir time level support bid languag current auction bid list improv system schedul put block event back queue algorithm bid tabl user id ptr intern auction base class languag level class algorithm level class expir queue quot notif link clear price notif link figur intern structur auction design languag continu good combinatori auction primari function languag level bid string machin manipul class level implement specif clear algorithm figur diagram data structur level auction algorithm implement famili auction base auction auction event handl auction receiv load retriev auction descript bid admit state bid load order submiss hash owner id bid fix expir bid insert expir queue bidder request notifi price quot bid ad notif bid load process paramet specifi clear price ratio mth price bid expir event tx auction expir bid load intern data structur execut load command explicit bid auction verifi bid satisfi bid admiss criteria addit syntact constraint bid auction rule restrict bid requir bid beat current price quot user previou bid bid fail test immedi transit reject state user notif bid pass record chang state valid enter time bid ad support data auction remov previou bid user auction bid state record close remov intern data structur auction addit step process bid messag fix expir refer bid store expir expir event schedul ensur auction deactiv reactiv handl expir explicit auction expir bid event forc user interfac show bid activ state auction receiv expir remov bid intern data bid state record close time withdraw event prompt auction remov bid updat record reflect state close time action auction receiv quot clear event depend algorithm emploi step common auction clear quot event produc notif messag bidder auction avoid examin bid notif list clear requir ad step form transact agent transact effect bid bid transact fulli transit transact bid complet satisfi remain activ adjust form auction duplic bid record state origin bid bid express copi memori duplic record adjust manner depend bid languag local copi user bid updat refer record bid expir auction clear particip transact auction find close step process bid event calcul time clear quot event post event schedul issu asynchroni address subtl issu swept rug previou section matter clear quot event schedul event queue auction period clear mode gener clear messag clear auction outstand clear event auction clear period inact recalcul clear time bid leav spuriou clear event schedul event queue track elimin catch return auction auctionbot auction ensur clear correct time local record clear time clear event quot event execut fact auction schedul commun asynchron introduc problem situat time calcul intermedi clear time bid receiv schedul auction messag clear delai doesnt reach schedul clear bid messag auction order auction receiv bid messag check execut clear verifi bid relat problem occur post expir event situat auction receiv bid messag time fix expir time clear schedul auction expir messag schedul receiv bid expir clear event auction order expir queue scheme undesir effect auction activ activ ignor decid tradeoff favor design situat auction receiv clear quot check expir queue expir bid present detail relat design scalabl internet auction server accommod activ level human user softwar agent primari featur control architectur facil run auction process persist auction event effici auction program reduct number access acknowledg work support part grant equip donat ibm michigan student stewart brian jonathan ryan chri grate student particip auctionbot experi jeff deserv credit auctionbot run smoothli refer mark steven william trade seal bid exist effici journal econom peter william michael wellman flexibl doubl auction electron theori implement support peter michael william walsh michigan internet configur auction server human softwar agent intern confer autonom page
IR/114 5 optim queri execut process grid yz comput scienc maryland colleg md dept informat ohio state abstract grid environ facilit collabor work user queri process data geograph data repositori past grow interest develop applic interact analyz potenti collabor set describ activ servic cach queri result answer incom gener subqueri part queri produc submit subqueri final process applic server store raw dataset present evalu illustr effect design tradeoff show benefit real applic gain middlewar introduct grid ideal environ run applic extens comput storag resourc research grid comput develop method solv challeng comput data intens applic medicin salient featur grid foster collabor research facilit remot access share resourc multipl client applic emerg set applic involv interact larg dataset geograph locat interact process composit plai import role research support nation scienc foundat grant subcontract lawrenc livermor nation laboratori grant subcontract ieee recent grid comput project advanc tomographi applic project dedic merg technolog remot grid comput feder digit librari object connect desktop remot distribut data imag analysi program project target catalog retriev measur dataset larg scale physic experi goal deliv data product gener dataset physicist network object earth system grid project provid grid technolog analysi larg scale dataset climat model applic expect data queri multipl user explor portion dataset portion dataset tend common sequenc queri physic region point time rapid perform improv cach result queri context web data cach web proxi shown speed servic web request cach popular perform remot transact request satisfi cach consist collect storag system parallel activ storag offer power flexibl environ develop deploi applic analyz larg dataset framework servic gain accept viabl approach applic develop execut distribut environ model facilit implement applic server applic server applic server figur applic server parallel configur depend effici applic share distribut share distribut memori tion servic accommod heterogen dynam natur grid previou work develop framework effici execut multipl queri workload data analysi applic smp machin cluster parallel machin build develop framework design suit servic suit consist activ proxi applic queri process servic shown figur persist data cach servic figur focu design implement activ servic emploi requir ad extra function origin applic structur attempt servic request sole cach result fail request applic server access raw data requir answer request request partial answer applic retriev cach result gener subqueri produc remain result applic server relat work design research aspect make suitabl platform optim execut queri grid environ aspect studi novelti approach li integr piec common framework process queri userdefin oper class data analysi applic section roussopoulo middlewar design interconnect client result queri client client queri result activ queri subqueri result applic server client applic server result subqueri result search aggreg applic server insert insert queri result cach server cach server figur suit consist activ applic queri persist cach optim execut multipl queri workload environ distribut data sourc handl queri oper system handl data reduct oper move code requir process queri locat data data inflat oper move input data client differ approach specif target multipl queri optim cach avoid network util process power distribut comput transpar resourc proxi applic server effici execut queri solut highli distribut applic emploi proxi server mean improv system perform al infrastructur handl data intens applic author shown approach reduc util network reduc queri improv system scalabl wide web proxi primarili cach web page avoid latenc server overhead incur retriev page recent visit object framework similar effort argu addit framework potenti power perform optim emploi semant cach cach result satisfi quest data transform function appli emploi extens queri server engin permit implement multipl applic queri type type environ execut applic found literatur al describ toolkit enabl applic draw comput power transpar grid unlik target number applic line distribut parallel storag server import aspect approach parallel oper distribut server suppli data stream fast enabl execut applic internet environ al show build prototyp framework remot visual larg dataset al point data grid infrastructur servic thousand user highlight manag data replica import aspect applic approach complementari effort enabl applic explor parallel capabl applic step proxi comput leverag cach automat gener subqueri transpar shown section recent effort grid research commun investig mechan execut adapt grid program grid applic develop softwar project support mechan store metainform control program execut grid inform system research project investig applic framework applic develop common compon architectur project lead standard effort build distribut softwar compon system scientif engin applic open grid servic architectur effort draw concept technolog evolv deploi wide distribut commerci scientif applic initi exampl system evolv order integr larger compliant model standard discuss bulk work multipl queri optim refer reader previou paper extens discuss relat research compar approach emploi queri process data data analysi applic data analysi applic differ greatli term input dataset result data process queri applic share common characterist figur show queri process commonli refer gener reduct oper function select identifi set data item dataset intersect queri predic mi scientif data analysi input output dataset repres mi describ rang queri data item coordin fall insid rang bound retriev data item retriev storag system map output item aggreg oper execut input item map output item accumul data structur data structur maintain intermedi result aggreg oper emploi loop commut associ output valu depend order input element aggreg complet intermedi result accumul postprocess gener final output valu data analysi part loop reduct phase characterist gener reduct loop make develop common program runtim support wide rang applic implement optim process singl multipl queri note aggreg oper appli input data commut associ input data partit data intermedi result comput data intermedi result combin creat output data properti queri process loop implic optim execut queri singl partit input data line queri process loop execut parallel distribut environ partit input data declust store input dataset machin applic system intermedi result potenti output cach queri execut multipl queri workload present system queri qi share input element accumul element ae phase call reduct phase output dataset smaller input dataset input dataset output accumul mi queri metainform initi foreach ae ae reduct foreach si read sa foreach ae sa ae final foreach ae oe figur queri process loop output element oe queri qj portion queri qi answer cach data subset extract input dataset intermedi result comput intermedi result combin cach intermedi output result ae oe gener queri directli queri match requir data transform middlewar describ target optim execut process loop comput result persist data effici schedul queri effici queri execut aggreg distribut grid environ activ current design activ implement runtim environ order simultan handl queri submit larg commun manag multipl connect applic server perform dynam workload distribut multipl applic schedul model emploi metric depend current past workload applic server enabl applic structur abstract queri relat queri metainform custom queri achiev directori updat applic applic server server client client client light directori servic workload updat queri workload queri server workload monitor servic applic applic server server ii ii activ subqueri persist data store servic applic applic server server figur function compon directori servic maintain inform locat access method applic server dataset workload monitor collect metric server persist data store maintain cach aggreg semant tag class provid base class implement set virtual method queri cach intermedi result complet partial satisfi queri evalu custom wai intermedi result data transform oper return list intermedi result tag semant inform appli correct data transform oper project method return result overlap index cach result overlap index serv give runtim system opportun cach intermedi result recomput input case project oper input data cach intermedi project transform intermedi result output object requir queri execut project oper simpl copi oper match make queri output data structur point cach intermedi project intermedi result repres grid grid metainform describ part queri answer cach result project method gener list subqueri comput remain part queri proxi runtim system method queri process shown algorithm algorithm cach intermedi result process queri complet resort retriev process input dataset queri process error check cach lookup memori alloc project cach result queri output buffer gener process subqueri remot execut queri applic server queri result complet comput execut includ subqueri gener queri subqueri benefit cach aggreg fashion queri fulli satisfi cach access input ship queri part applic shown algorithm algorithm execut light directori servic consult find applic send queri queri metainform clone subqueri gener remot execut queri ship applic server remot execut result retriev applic server project answer current queri describ major compon queri server compon receiv queri client prioriti queue store queri schedul execut queri select execut instanti invok method algorithm flexibl compon abil easili incorpor type queri applic develop custom method describ queri data lookup data aggreg queri server handl process queri type light directori servic runtim system determin queri comput algorithm void stat complet match stat art complet list stat match error algorithm int tq qu return input system select applic remot execut queri singl applic server process capabl implement process function requir input dataset applic server answer queri ld store inform locat input dataset avail queri process capabl type queri servic interfac ad applic server input regist type queri ld method inform applic server queri applic server defin term polici implement workload monitor servic describ workload monitor servic import aspect applic server load balanc fault toler assign workload applic server overload server fault import highli distribut applic server unavail frequent fashion runtim system account assign queri server provid wm continu monitor regist applic server collect metric relat queri server thread util disk activ metric defin polici implement method ld persist data store servic effici reli heavili identifi opportun cach intermedi result singl serv proxi larg commun client probabl obtain deal set client request tempor local client applic interact work set user spot entir collect dataset main memori increasingli order magnitud secondari storag secondari storag persist invoc implement larg base data store portion main memori larg chunk secondari storag emploi replac polici insur intermedi result maintain intermedi result swap secondari storag cach intermedi result purg persist cach secondari storag space insuffici hold newli comput intermedi result integr grid servic grid research commun prolif develop softwar standard protocol enabl transpar execut highli distribut applic larg bodi work middlewar servic resourc discoveri file storag author work complementari servic target improv execut data analysi oper collabor environ chose implement version servic speed construct prototyp system prototyp integr infrastructur enhanc function specif servic framework immedi replac interfac power light directori servic workload monitor servic directori servic globu toolkit function store queri inform grid resourc md architectur organ basic inform data collect aggreg directori servic function provid ld ldap data model md capabl store inform activ system term identifi applic server correct process capabl queri instanc standpoint client run distribut emploi md infrastructur present broader advantag client leverag directori inform pick specif qualit characterist base directori rout queri process applic server workload monitor servic present paper interact applic server collect inform util level server advantag special wm monitor process custom metric critic set applic main drawback approach load introduc applic share grid resourc directli account effici wm improv interfac grid monitor network weather servic gather sophist includ machin util applic server util network network latenc inform determin applic server candid server queri addit custom nw sensor provid support collect metric schedul algorithm nw design dynam schedul foremost capabl emploi predictor forecast metric behav futur workload base applic server expect reli current behavior product grid environ capabl environ displai complex workload behavior simpl setup document discuss function implement ld support gener discoveri servic featur discoveri servic notif facil enabl client interest warn event inform occurr facil automat learn applic server document describ servic wm set instrument monitor servic primarili ensur integr workload schedul import issu tackl work secur authent emploi md partial solv problem inform credenti access control list store secur problem complic import issu authent prototyp reli simpli socket commun authent encrypt mean client queri applic server directli relianc vanilla unix authent schema option term altern requir client account machin host server util grid secur infrastructur solv scalabl problem cach applic server establish trust relationship concept user proxi queri typic resourc multipl user proxi act behalf real replac manual authent paper design implement compon framework interact applic server answer queri requir input persist data store servic retriev cach aggreg data access achiev data sourc abstract data sourc present underli storag subsystem storag medium dataset assum partit store term page current implement data sourc unix file system storag grid characterist interfac storag system vari wide storag resourc broker interfac varieti storag resourc applic server benefit infrastructur store input cach data heterogen collect storag system metainform catalog compon store metadata inform dataset control framework framework present feasibl infrastructur distribut queri execut process grid system grid environ leverag multipl technolog plan make framework compliant evolv architectur servic make fulli integr grid ecosystem applic briefli describ applic case studi paper detail descript applic found analysi data virtual microscop applic design support interact view process digit imag tissu raw data system captur digit scan collect full microscop slide high resolut vm queri describ region output potenti lower resolut imag gener appli aggreg oper imag chunk implement function process high resolut input chunk produc lower resolut imag vm function result version vm comput similar pattern function emploi simpl subsampl implement averag oper window magnif level subsampl function return pixel region input imag intersect queri dimens averag comput output pixel averag valu pixel input imag averag function view imag process algorithm aggreg input pixel order comput output pixel type data occur queri vm applic queri queri window overlap bound box comput result result clip queri boundari zoom factor queri lower resolut imag queri comput higher resolut imag gener previou queri cover region order detect overlap call comput overlap index ia oa os ia area intersect intermedi result queri oa area queri zoom factor gener os zoom factor current queri os multipl queri intermedi result overlap index volumetr reconstruct vision avail commod hardwar recent advanc virtual realiti special interest track shape analysi rise vision system system multipl camera spread perimet room camera shoot scene period time sequenc multipl perspect algorithm develop volumetr includ applic render volum arbitrari viewpoint point enabl user analyz shape request resolut creat highli accur model shape reflect properti obtain combin shape action model complex object queri imag dataset specifi region frame camera resolut reconstruct queri result reconstruct foreground object region ly queri region background model remov stationari background discuss queri qi queri metainform dataset box set frame depth edg root leaf specifi resolut set camera queri build set volumetr object fall insid box frame frame set camera volumetr object construct set imag camera ci reconstruct volum repres comput depth di deeper higher resolut object individu imag camera store disk data chunk volum singl time step construct aggreg contribut imag frame camera ci output aggreg oper commut associ implement volum reconstruct algorithm emploi part earlier implement implement return frame sequenc frame frame request queri cach metainform potenti opportun gener lower resolut higher resolut comput earlier queri order detect implement function algorithm custom method algorithm float dj return ci cj return transform cach result result incom queri requir util project function transform aggreg appropri algorithm hint project queri box multipl volum form larger volum crop produc smaller entir frame cach frame camera queri requir camera cach gener imag merg depth deeper gener shallow experi implement frame project function explor project oper futur work evalu factor affect perform activ set experi show result size level multithread servic kei aspect framework li capabl project aggreg perform data transform oper show client client client activ tau applic server vm vr dataset applic server vm dataset applic server vm dataset applic server vm dataset applic server vm dataset vm dataset vm dataset vm dataset dataset vm dataset vm dataset vm number frame frequenc access frame vr dataset vr dataset dataset access access access access access figur cach reli local queri submit system setup vm workload imag queri darker region queri impli import featur locat region vr workload dataset frame camera graph show popular frame function number access gener set queri capabl improv system perform set experi detect queri servic sole cach gener forward subqueri applic server multipl applic server servic dataset comput capabl term execut queri replic multipl distinct site distribut queri ship applic server import achiev good load balanc candid applic server set experi compar variat schedul strategi baselin case investig compar approach execut sequenti submit submit group concurr asynchron subqueri applic emploi queri multipl subqueri approach yield perform situat applic server heavili load applic server multithread light subset thread pool gener multipl subqueri emploi comput power wast set experi evalu queri execut strategi evalu scalabl size import perform relat featur architectur level multithread emploi size cach store reusabl aggreg order evalu impact assembl setup consist applic instanc activ depict figur instanti applic server node heterogen pentium iii linux smp machin host dataset volumetr reconstruct virtual mhz pentium iii machin host vm dataset time batch execut time size disabl basic project awar time averag execut time queri size disabl basic project awar figur cach strategi basic aggreg complet match awar cach aggreg partial overlap occur data transform batch execut time averag execut time queri time batch execut time number thread figur batch execut time report vari number simultan execut queri queri server thread pool amount cach space persist data store servic singl applic server serv vm vr queri simultan execut rogu node uniprocessor singl queri servic time host ultrasparc iii smp solari machin emploi client gener queri volum gener pixel averag vm queri vm client workload model emul behavior real user vr client submit queri construct synthet workload model real user trace applic queri request set volum frame select center interv drawn randomli uniform distribut set length interv select normal distribut standard step select randomli depth queri box camera vm dataset pixel total imag vr dataset frame collect total approxim collect figur give measur amount local workload figur provid estim size work set set metric drive effect improv system perform figur amount space alloc persist data store greatli time process set queri submit system fix number drop execut time size fix cach multithread level show measur averag overlap averag fraction queri answer complet cach result observ ratio approxim approxim size independ multithread level averag overlap ratio fix vari multithread higher lower multithread suggest execut queri simultan competit memori competit potenti aggreg cach result show higher multithread level requir space achiev averag overlap ratio evalu cach strategi aspect framework cach aggreg appli transform function profit perform transform recomput aggreg input data result figur compar perform cach cach basic semant cach basic semant cach cach aggreg match request aggreg workload previou experi figur show basic cach improv batch execut time cach size significantli improv perform overlap ratio basic cach remain constant mean work set cach strategi fit cach cach batch execut time compar basic show benefit approach similar result observ measur averag queri execut time evalu applic server assign polici shown figur queri ship applic server directli client varianc time load applic network bandwidth space memori disk memori space fix disk portion vari minim effect oper system file buffer cach primit perform direct disk oper time batch execut time client assign client assign app server round figur impact applic server assign polici workload configur bar workload configur term client activ proxi interact directli applic server wide vari queri time workload monitor servic implement prototyp facil assign queri applic server multipl candid current implement wm collect metric network gather metric thread pool util disk load applic server accomplish poll applic server period individu metric experi relev thread pool refer normal disk read rate refer show percentag thread queri server thread pool busi time poll show disk read rate poll normal percentag assum ideal sustain transfer nomin transfer rate disk machin figur show result round robin assign queri applic variat strategi combin load applic server comput server assign queri determin find server smallest load server servic obtain ld case round robin select server simplifi behav set queri similar comput requir albeit tive result show workload obtain result figur setup client interact directli applic server figur show perform mean client submit queri applic server result graph report number queri submit vari configur due vari number client submit queri result configur directli compar trend clear unbalanc assign client submit directli applic effect strategi assign queri unload applic server batch execut time compar round robin polici polici achiev slightli lower perform round reason system high workload polici distribut workload perform compar assign strategi slightli comput round robin import greater imbal provid accur inform queri execut execut time typic vr queri vm queri vr queri spend execut time comput vm queri spend comput metric show provid accur inform applic server load queri intens intens queri combin variabl good solut knowledg workload present accur strategi polici implement evalu queri execut strategi import aspect design queri process engin expect load strategi optim low high workload greatli differ highli distribut environ load vari light intens result obtain sever client sequenti submit queri queri subqueri cach aggreg subqueri subqueri subqueri subqueri subqueri cach aggreg subqueri subqueri subqueri subqueri partit partit partit figur diagram show automat gener subqueri potenti concurr execut system left diagram show queri priori subqueri gener emploi applic potenti queri servic moment rogu node addit simultan queri applic server util constantli configur handl simultan queri idl resourc lighter workload leverag make sophist queri plan execut strategi figur present result explor queri plan execut concurr subqueri priori partit concurr consist execut maximum number subqueri gener complet parent queri step algorithm concurr thread slice queri multipl subqueri queri receiv queri server execut strategi aim idl thread proxi applic server parallel execut singl assum applic server serv queri evalu perform effect setup emploi workload emploi submit vr queri submit vm queri emploi submit vm queri implement heurist limit subqueri gener applic specif metric number strategi subqueri execut thread queri server idl thread time fall back sequenti execut vm number recommend partit comput time batch execut time workload sequenti concurr priori priori time averag execut time queri workload sequenti concurr priori priori figur queri execut strategi underneath bar denot workload denot workload client regular weight denot queri partit schema strategi detail batch execut time averag execut time queri cation server potenti process queri return light directori smallest number number partit ld comput number applic server queri method regular applic server account weight applic server partit maximum multithread level figur show result combin workload partit strategi term time execut batch queri queri averag observ made result concurr execut subqueri workload workload batch execut time observ averag queri execut time queri batch queri metric larg batch execut larg averag queri compar sequenti execut regular variat weight variat show larg batch execut larg averag queri execut time partit strategi aggress partit yield larger execut time batch larger workload happen averag queri execut time queri reason subqueri gener util idl resourc achiev due higher complic queri partit requir input data vr recommend partit number frame request queri metainform cess due bookkeep project oper incur higher overhead higher queri server util level support data analysi applic context highli distribut comput grid design base servic integr wai accommod specif workload scenario util scenario extens evalu activ proxi configur concentr workload multipl client leverag comput abil respond partial complet queri base aggreg cach local approach result faster queri network util possibl applic effect util resourc partit concurr execut subqueri shown quantit aspect design impact perform system shown activ cach approach perform singl data analysi applic shown make capabl servic incorpor activ larger commun client applic dataset benefit optim resourc web proxi locat closer user local partial shield network latenc tion anticip hierarch network emploi ensur scalabl acknowledg anonym review paper excel comment significantli improv present content specif suggest idea prototyp integr grid infrastructur refer preliminari report design framework distribut visual parallel distribut process techniqu applic digit dynam virtual microscop american medic informat novemb maryland technic report william remot access climat simul challeng problem data grid technolog supercomput novemb gibson dynam function placement cluster comput usenix annual technic san saltz persist cach multipl queri optim framework workshop system scalabl march saltz cach replac polici servic mix data intens queri workload workshop held conjunct acm intern confer june saltz effici execut multipl workload data analysi applic supercomput novemb saltz multipl queri optim data analysi applic cluster smp intern symposium cluster comput saltz schedul multipl data visual queri workload share memori machin ieee intern parallel distribut process fort april jin perform evalu web proxi cach replac polici perform de septemb cluster make fast case common sixth workshop parallel distribut wan network data cach enabl remot distribut visual supercomput novemb saltz design framework applic heterogen comput saltz perform optim data intens grid applic annual intern workshop activ middlewar servic ieee comput societi august saltz perform impact proxi data intens applic intern confer june acm press davi effici system imag volumetr shape analysi workshop parallel distribut comput imag video san compon base servic architectur build distribut applic ninth ieee intern symposium high perform distribut comput august common compon architectur forum kesselman grid inform servic distribut resourc share tenth ieee intern symposium high perform distribut comput august improv proxi cach analysi replac polici ieee internet physiolog grid open grid servic architectur distribut system draft document secur architectur comput grid acm confer comput commun page novemb global grid forum adapt comput data stream high perform ieee intern parallel distribut process page ieee comput societi press thompson distribut environ larg broadband network view high larg scale applic septemb framework prepar execut adapt grid program nsf gener system program fort april kotz parallel file system comput grid ieee intern symposium cluster comput ieee comput societi press von mcgee kei concept servic grid inform februari draft document manag larg data flow dynam queri ninth ieee intern symposium high perform distribut comput august roussopoulo middlewar system distribut data sourc page storag resourc broker rapid construct imag sequenc comput imag process imag thompson overview distribut parallel storag server wessel web cach ieee journal select area april su run comput grid supercomput novemb acm press network weather distribut resourc perform forecast servic journal futur gener comput octob
HCI/115 4 semiot commun model interfac design phd student commun scienc design torino itali abstract research contribut creation semiot framework interfac design commun model hci approach interfac explain central factor commun consid design keyword commun interfac semiot introduct basic assumpt semiot commun send messag semiot underlin world commun cloud differ cloud act produc sign human act commun simpl sender defin consciou commun process sender central role question kind commun commun simpl observ special kind similar commun interact commun observ commun factor function appli interfac design fact interfac failur effect model interact ronald weaver shannon cybernet studi languag identifi basic factor factor factor commun function notic mean messag produc weight exclud commun studi code context discuss make commun receiv mean messag defin interpret receiv central role hci studi deepli design cognit studi human user user collabor method user develop interfac effect semiot studi reader function hci research field eco reader theori opera interpret base sign scienc literatur semiot develop method strategi reader interpret strategi comput scienc cognit improv interact studi deepli gener method develop perspect medium central factor commun process interfac medium complex cmc studi separ sender semiot hci defin interfac messag design user design user design sender messag receiv comput answer real sender commun consciou comput user comput real interfac system world sign oper comput user difficulti understand system resid situat winograd flore show human appli social rule relat comput human comput consciou entiti point clarifi characterist special sender order avoid interact problem deriv misunderstand function aim research understand concept sender influenc mean interpret code code commun code learn mean cloud mean sentenc icon visual sign learn phase understood desktop semiot term describ kind sign signifi similar content theori form sign symbol interfac design icon similar object phase learn understand hci aim creat system approach radic complet avoid view learn creat system analog thing good reach object creation code convent support understand web adopt convent continu work semiot point view commun process enabl previou knowledg code receiv scienc rhetor linguist hci creat simpl interfac languag context context power chang mean messag train window sentenc mountain weather context import term content interfac design context comput concept understand digit environ oper reason creat coher context comput system numer studi consist interfac underlin problem context chang consequ build dynam context comput context studi design participatori design interfac develop concept context studi deepli interest approach theori user engag interfac exampl deeper insight field comput game develop consid hci attent medium factor commun process code context paper refer research project studi effect factor put evid question hci semiot reflect refer andersen semiot workshop semiot approach user interfac design clark make semiot workshop comput semiot june surrei uk crawford lesson comput game laurel art human comput interfac addison de souza semiot engin user interfac intern journal machin studi eco eco di erickson work interfac laurel art human comput interfac addison french smith contribut semiot workshop comput semiot june uk di johnson interfac laurel interfac centr system perspect edit da norman sw nj erlbaum de souza role scenario develop web case iii workshop human factor comput rs influenc comput semiot commun workshop comput semiot media june uk interfac design evalu semiot hix advanc human comput volum nj ablex norman mit press cambridg ma peirc collect paper charl sander de souza method evalu user acm pp de souza garcia semiot framework sigchi bulletin vol de cs case studi evalu interfac design acm design interact ny commun paradigm window system perspect edit da norman sw nj erlbaum cour de sellen nicol build laurel art human comput interfac addison manual di jackson pragmat human ww winograd flore understand comput cognit foundat nj
Agents/116 1 model emot motiv synthet agent juan mit artifici intellig laboratori technolog ma abstract present comput model offer altern approach model dynam natur affect mood flexibl model influenc behavior synthet autonom agent model implement part framework function agent develop design emot agent varieti applic includ entertain synthet agent interact video educ intellig tutor interfac introduct emot essenti part influenc commun research acknowledg import human recent neurolog evid support idea damasio recent develop area synthet blumberg bate elliot reilli affect comput promot studi emot influenc behavior learn kitano comput model emot review model paper describ comput model aspect gener emot influenc behavior synthet agent model develop distribut model gener emot influenc behavior autonom agent model call emot energi object inspir work field includ etholog neurobiolog main object model aspect gener model simpl model copyright american associ artifici intellig reserv motiv algorithm figur high level view model architectur figur architectur model emot gener system model network special emot system compar minski agent repres specif emot famili fear disgust sensor monitor extern event intern drive feedback sensorimotor stimuli exist condit elicit emot repres sensor arrang group repres kind cognit emot activ system input sensor intens emot belong threshold valu control activ emot intens emot output signal emot behavior system turn select behavior state intern emot behavior system extern world motor extern action gener system stimuli stimuli tional system specifi level satur emot consist real life emot system level exce limit import element emot decai control durat emot episod explain figur illustr idea figur emot emot run parallel constantli updat intens control system activ intens valu time intens threshold inhibit excit type interact consist real life emot high system tend inhibit excit emot system fear inhibit happi sad inhibit basic issu emot includ model drawn idea theorist oatlei provid explicit model basic primari emot express basic emot research wai model term claim number separ discret emot differ import evolv prepar deal fundament life fall avoid adjust basic emot singl affect state famili relat affect state member emot famili share similar behavior physiolog characterist differ emot distinguish includ emot basic distress emot blend mix emot affect state consid emot includ list defin concept emot famili includ state variat basic affect state fit categori theorist claim emot evid suggest exist term describ basic emot time exampl blend emot specif sad variat peopl experi feel anger depend situat mention emot activ mean basic emot emot blend mix emot intens level influenc express activ give rise secondari emot cognit emot model taxonomi analyz condit lead emot collin jose claim determin emot felt emot depend evalu interpret event se author extrem posit cognit determin theori gener emot concern cognit strong influenc emot activ draw idea tomkin account exist cognit emot arrang categori includ effect brain agent lead emot mediat system cover sensorimotor facial bodi muscl action central regul ongo emot experi elicit emot system includ motiv lead emot motiv includ drive thirst emot pain regul exampl system includ innat tast produc pain stimul emot sad elicit vice versa emot gener emot stimuli affect intens excitatori input behavior system includ type cognit activ interpret belief cognit basic emot base adapt version roseman theori jose reason influenc roseman theori roseman theori broad scope attempt address stimuli peopl face present clear testabl predict relationship specif configur emot state produc predict support empir research jose fit activ model roseman assum emot motiv case motiv cognit model robust develop flexibl defin agent affect characterist mood affect phenomena number word consid emot term refer mood emot word emot mood interchang psychologist refer aspect affect mood emot interact import wai differ aspect includ function differenti mood emot term level emot consist high specif type brain system activ low level varieti intern weak perceptu input mood explain low level emot mention model emot emot explain high level system high emot tend inhibit mild system concurr lead chanc enorm displai mood state compar limit number basic emot state consist enorm subtleti human mood feel consist common observ mood lower threshold emot emot system provid potenti activ emot consist observ durat mood longer low level intens emot decai slowli model valu activ satur threshold individu fear mood lower threshold emot fear comparison individu emot mention idea threshold level determin intens question subject research collin collin frijda bower cohen emot intens receiv lot attent understand intens emot affect amount natur factor contribut intens emot affect includ previou level emot account contribut emot interact emot excitatori model equat intens emot time previou time function repres emot ke emot detail rang emot emot le excitatori gain emot appli emot lt intens emot time inhibitori gain emot appli emot mt intens emot time function constrain intens emot satur emot decai concept emot intens receiv concept emot decai receiv previou model except reilli issu current evid matter specul emot decai mechan system involv process emot provid decai function control durat emot activ function specif emot model emot decai decai function emot implement constant time complex function emot term resolut ke le lt mt updat cycl decai function activ emot excitatori input intens lower cycl inact behavior system research suggest emot system elicit physiolog elicit impli involv readi specif behavior consequ individu model behavior decid behavior agent emot state point time behavior system distribut system network behavior compet control agent behavior activ base recalcul cycl behavior major express motor compon experienti compon express compon express emot import aspect emot behavior express compon behavior contempl prototyp facial motor command alter facial express bodi seri motor command alter agent bodi postur vocal consist sound includ complex element control tempor variabl experienti compon experi emot mood bia action cognit research experienti compon emot mood identifi motiv process manifest action perceptu select filter memori feel state cohen main aspect consid model motiv main activ behavior experienti compon influenc motiv system behavior affect level affect emot mood discuss sensorimotor emot action action readi action tendenc aspect event emot action tendenc readi model behavior repres behavior includ model direct emot irrit mood influenc emot perceptu select filter includ complex interact cognit system constitut field activ research scope work import acknowledg exist design open model increment addit system compon model influenc select behavior mention behavior compet obtain control agent competit base valu behavior point behavior highest activ behavior updat cycl depend call includ motiv wide varieti extern stimuli idea mechan field work successfulli model blumberg behavior model sum valu behavior relev behavior depend specif natur intern calcul term intens motiv consist sort extern depend sensori input determin stimulu interest present match specif criteria model behavior simpl complex model includ inhibit behavior similar fashion inhibitori input emot includ model behavior deplet fatigu part model made simpl gener integr architectur mae blumberg algorithm emot gener updat intern variabl environ valu agent motiv drive updat valu behavior updat base current sensori stimuli stimuli intern behavior highest activ behavior express compon modifi agent experienti compon evalu order updat motiv testb environ implement total part framework agent develop creat emot agent framework implement power macintosh build environ user interact synthet agent repres young child main goal creat creat believ build environ serv testb experi test intern evalu framework tool creat model emot phenomena emot agent motiv behavior order test relationship design instanc motiv drive emot distress repertoir approxim fifteen correspond action tendenc state motiv system behavior express experienti compon express compon includ facial express similar shown figur behavior includ vocal express form experienti compon includ influenc modifi intens specif action behavior wave figur facial express interact user interact perform action environ menu action vari thing alter level higher level feed chang light temperatur room interact provid stimuli intern stimuli gener motiv system react desir plai toi plai happi level hunger high food level distress eventu sad angri level anger sad happi user manipul paramet figur distinct configur element emot refer affect style agent plai valu give user impress suffer sever case multipl person figur express disgust figur show snapshot environ situat displai disgust eat food issu futur work improv extens made comput model present paper issu work includ extend model influenc emot agent behavior perceptu includ gener explor effect emot memori learn cohen make comput model gener emot influenc behavior synthet agent present draw idea offer altern approach model type dynam differenti kind affect mood contrast model consid cognit flexibl extens model influenc emot behavior account aspect express experienti compon emot refer role emot believ agent commun acm lesson etholog intern confer simul adapt mit press pr emot influenc memori data theori ms st ed affect erlbaum descart human brain argument basic emot ed basic lawrenc erlbaum cd affect process model emot system phd institut learn northwestern emot social consequenti behavior interdisciplinari perspect lawrenc erlbaum emot cambridg press psycholog emot plenum press system emot cognit process psycholog review basic folk theori ed basic lawrenc erlbaum model hormon modul learn montreal emot brain simon schuster evolut simul maker analysi motiv process academ press mae artifici life meet lifelik autonom agent commun acm special issu applic ai mae ed design autonom theori practic biologi engin back mit press minski societi mind simon schuster cognit structur emot cambridg press basic emot wide yield concept distinguish unambigu ed natur emot oxford press artifici intellig model emot ed cognit perspect emot kluwer affect technic report mit media laboratori reilli believ social emot agent technic school comput carnegi mellon test theori discret emot journal person social psycholog emot urg technic school comput cognit studi instinct oxford posit affect springer comput model gener emot influenc behavior autonom agent sm thesi depart electr engin comput massachusett institut technolog
IR/117 5 web crawl agent retriev inform srinivasan acd pant nation librari medicin rockvil pike md manag scienc iowa iowa ia autonom agent topic driven retriev inform web activ area research abil conduct real time search inform import user includ health care gener public present preliminari research retriev agent test abil retriev relev assess genet ontolog agent judg perform fetch inform inform gene discuss kei insight challeng agent base retriev learn initi experi domain introduct autonom agent repres emerg area research agent base technolog appli wide rang complex problem interfac agent recommend system autonom compar shop agent interest design retriev agent seek relev web page user gener topic due limit comput dynam natur search engin index web cover portion web monitor continu fact recent estim visibl web billion page march estim tripl billion page permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee copyright acm joyc mitchel ab filippo menczer health mgmt informat missouri mo librari info scienc iowa iowa ia olivi largest search report web site essenti develop effect agent conduct real time search user goal reflect previou research explor varieti web crawl agent oper lexic criteria assess perform topic deriv yahoo open directori hierarchi altern measur compar exploratori natur exploit evid ongo research studi scalabl crawl agent sensit topic characterist goal paper examin applic agent challeng retriev inform web motiv question locat inform web relat question import aspect scientif viewpoint gener public develop dna studi gene express progress area scientist increasingli challeng grow bodi relev literatur unexpect connect import seemingli disjoint special investig gene gene integr part investig identifi web retriev explor intend part solut problem goal web demand relev locat site remov recogn resourc develop human genom project agent import point view grow segment popul increasingli charg health demand inform health problem underli genet basi potenti genet test engin offer greater rang individu choic consum seek educ link gene consum react press announc complet human genom project inform human genom project path relev inform lai person previou studi show major challeng encount navig phenotyp genotyp includ sheer complex rate discoveri knowledg resourc final idiosyncrat style instanc complex gene gene product number synonym natur synonym gene symbol make difficult find inform nomenclatur human genom organ decid offici gene gene symbol make inform includ metadata link give inherit pattern inform offici gene mutat offici gene mention offici gene mutat type base system human genom make system difficult novic system consum clinician refer directli scientif produc human genom project refer consum orient page genom multipl speci repres connect human primari emphasi princip resourc nation librari medicin includ singl gene main topic subtop curat resourc provid set link document select health scienc librarian consum link document vet currenc sourc lack perceiv readabl connect gene inform inform made search system reveal gene causal relationship definit establish provid detail catalog specif mutat correl sever rich store inform larg hidden lai public gener health care provid set aim assess abil web retriev agent find relev inform specif gene goal agent find inform larger goal web agent bridg gulf web resourc gene studi natur merger strand research conduct earlier studi manual connect phenotyp genotyp decid studi attempt navig direct genotyp intellig agent search emphasi agent deriv previou research explor wide varieti crawl agent special emphasi underli search algorithm method evalu perform section present web crawl agent describ includ detail dataset evalu method outlin result discuss number lesson learn project agent web inform agent topic driven search topic driven crawler respond inform express topic queri interest profil individu user commun share interest support decentr retriev scalabl approach compar central search engin addit benefit agent driven rich context user interpret page select link visit start earli breadth depth crawl agent defin begin varieti crawl algorithm shark search variant fish search crawl agent reli heavili link base criteria diligenti context graph estim likelihood page lead relev relev exploit lexic conceptu knowledg chakrabarti al hierarch topic classifi select link crawl contextu knowledg topic includ receiv relev feedback present part highli creativ phase design topic driven retriev agent research emphasi gener topic deriv yahoo dmoz directori pertain topic goal understand gener domain provid import extens research specif context inform architectur agent share data structur util optim effici affect fair evalu exampl common facil includ http interfac simpl html stemmer benchmark report routin agent implement perl agent visit max page page start seed set timeout web download larg page chop retriev kb protocol http redirect filter page content stale link yield http error code remov found good link limit memori agent constrain buffer size buffer temporarili store typic frontier page link explor agent track maximum max buffer link buffer full agent decid link substitut ad emploi crawl agent studi algorithm base variat call commonli studi algorithm explor agent produc result previou research crawl call develop previou research infospid approach base evolv popul learn agent basic idea crawler frontier link estim criterion select crawl gener iter batch top link crawl select complet crawl page crawler decid batch typic initi case set guid crawl specif link select process comput lexic similar keyword sourc page link similar page topic estim relev page point url estim select crawl cosin similar crawler link minimum similar score remov frontier order exce buffer size max buffer figur offer simplifi pseudocod crawler function return cosin similar topic kp kq fetch frequenc term infospid infospid adapt popul agent search page relev evolv queri vector neural net decid link follow evolutionari approach fit measur base similar local select criterion origin algorithm simplifi implement crawler modul variant schemat illustr figur max pop size maintain distribut frontier total size exce max buffer infospid agent independ crawl parallel adapt agent consist vector keyword topic foreach link foreach link doc score figur pseudocod crawl agent foreach agent theta foreach agent link doc delta theta offspr figur pseudocod infospid crawl agent paramet set max pop neural net evalu link input unit neural net receiv count frequenc keyword occur vicin link weight give import keyword occur link neural net comput link base agent stochast selector pick link page agent receiv energi proport similar queri vector page constant cost charg fetch page agent die visit maximum page yield energi neural net train improv link estim predict similar page link lead agent move newli select page function return true condit termin stochast base probabl δ differ similar current page keyword vector temperatur paramet energi level determin agent surviv agent di run energi reproduc energi level pass constant threshold theta offspr receiv part energi link frontier offspr keyword vector mutat ad term frequent current document mutat infospid uniqu capabl adapt search strategi base clue captur page design topic seed set crawler agent start locat web start crawl page refer seed obtain reason seed strategi util top url return manual search googl agent start set seed select seed remov duplic pointer page pdf file goal find descript defin pool uniqu gene gene instanc group gene select set gene connect gene establish resourc note gene studi restrict list main topic page subtop broader topic page exampl entir page devot includ subtop page repres famili subtop main page muscular gene link data offici gene offici alia gene prefer alia protein phenotyp manual extract set keyword construct gene inform phenotyp offici gene frequent includ keyword includ offici gene keyword form initi search queri submit googl keyword guid crawl previou section googl default conjunct search hit obtain case decid limit search gene symbol case fewer url retriev elimin keyword time minimum topic offici gene syndrom seed url descript syndrom disord connect tissu affect organ includ heart blood vessel condit affect men women race ethnic group estim peopl unit state syndrom relat connect tissu disord target url tabl sampl target url obtain url seed crawler agent page import target set retriev agent gener evalu relev retriev page difficult obtain relev judgment human scale autom mechan estim relev page common approach assess similar retriev page gold standard repres relev page instanc author explor simpl version presenc singl word titl frequenc threshold bodi page relev page amento al comput similar vector centroid seed document measur page qualiti chakrabarti al appli classifi built posit neg page determin page import research gold standard concaten text passag describ relev site written yahoo dmoz editor applic group extract descript target web descript limit page length short half page descript web site remaind combin text extract web site descript overview summari major symptom abbrevi provid tabl measur gaug import page lexic similar page descript sourc evid relev page sourc page word page point sourc view relev set shown figur advantag approach curat resourc confid outlink disadvantag limit constraint implicitli singl curat resourc underli polici determin page link page descript syndrom link directli extens descript exist site avoid host educ institut displai updat date combin method assess page import basi evalu strategi assess method base idea good agent find import match page point match gold standard descript provid expert order make assess block sourc page agent agent find relev page mean evalu metric mechan assess page summar reason perform agent ideal world singl number score differ score differ crawler gener singl number recal complic fact crawler tempor dimens depend perform determin point crawl person interest quickli obtain relev page agent return agent oper establish portal behalf commun high recal high critic larg crawl span differ adopt approach static dynam static approach examin retriev qualiti base full set page retriev lifespan agent static measur calcul end crawl contrast dynam measur provid tempor page fetch crawl progress dynam plot offer trajectori time displai dynam behavior crawl measur studi dynam retriev page compar descript page creat expert measur averag cosin similar tfidf vector descript page tfidf vector page visit point topic cosin similar function equat term frequenc replac tfidf tfidf kd ln nk nk number document term occur set page crawl topic increment set page crawler grow time plot trajectori time assess crawler base capabl remain topic measur assess retriev set topic core underli assumpt crawl relev page dynam target set target page measur simpli percentag target set crawl function number page crawl time static pool page retriev agent topic comput similar shown page descript page identifi top similar page pool measur assess percentag pool crawl agent analysi valu preliminari result crawl run initi topic total topic similar analysi elimin crawl complet integr hardwar seed obtain googl target set provid recal analysi mention retriev page compar descript page creat expert dynam perspect measur averag similar descript page page visit point crawl figur show result set page retriev grow increment perform statist crawl agent plot error bar order graph visual clear show slight edg earli part exploit behavior advantag longer run averag similar page crawl figur dynam perform plot base topic differ averag similar crawler statist averag recal page crawl figur dynam recal target page plot base topic differ averag recal perform crawler statist figur show recal target page identifi topic recal level reach low agent explan discuss section differ perform statist crawl agent final figur show result static measur similar rememb pool page retriev agent topic identifi page similar target descript measur coverag pool valu analysi differ perform statist infospid achiev greedi trend infospid agent good pinpoint page discuss result offer valuabl lesson effect futur effort clear low recal level problem start crawl agent gene inform hard problem base experi domain prove challeng yahoo dmoz base topic consid previou effort recal target averag achiev kei characterist present problem domain natur gene gene product gene symbol frequent acronym duplic word acronym common usag medic languag concept topic observ gene breast cancer symbol gene product mention algorithm gather seed symbol synonym submit googl subset result url subset symbol googl search match gene symbol bach web crawler delv music world breast cancer world fact back data notic topic singl seed remot pertin topic topic elimin initi pool gene analysi topic found seed topic seed agent risk involv obtain seed search engin problem recogn includ seed page longer exist seed page outlink aspect unexpect earlier studi methodolog identifi seed ensur exist outlink major aspect recogn good portion page seed page english page target page limit english mismatch languag recognit compon agent english gener stem rule emploi agent adapt special terminolog domain observ problem agent site emerg lifespan page instanc seed ac gene convert lead search return page essenti recapitul inform small portion output data pertain remain link point dna protein sequenc data intuit situat frequent domain augment agent strategi recogn amount explor site reach maximum limit challeng compound fact crawl number top page figur static perform error bar correspond standard error deviat topic give agent clue fact remind add phenotyp inform keyword elimin gene includ order evalu time relev criteria built descript url realist strategi intermedi agent minim guidelin recogn page possibl gener inform recogn page descript retrospect avoid clue keyword extrem knowledg formal studi agent crawl web page inform gene defin start point intent capit experi web crawl agent appli problem goal seek inform gene real time grow import health care gener public crawl agent appli inform retriev infospid displai perform static similar metric measur differ perform observ conclud exclud studi deep web studi mechan search web abil popul individu level kei featur design crawl agent cope complex search domain inform base present research recogn characterist make retriev inform distinct retriev gener domain plan explor issu follow research continu contribut research agent track inform acknowledg work fund part nation scienc foundat career grant fm refer yu intellig crawl world wide web arbitrari predic proc intl world wide web page hill predict expert qualiti rate web document intern acm sigir confer research develop inform page shoham collabor recommend commun bharat improv algorithm topic distil hyperlink environ intern acm sigir confer research develop inform page van den dom approach web resourc discoveri comput page effici crawl url order seventh intern world wide web size internet white juli de bra post inform retriev world wide make search feasibl intern world wide web gori crawl context graph proc intern confer larg page weld scalabl agent web intern confer autonom page eichmann spider balanc effect search web load comput googl al onlin inherit man human gene genet disord nucleic acid autonom interfac agent intern confer intellig agent ur algorithm tailor web site map proc intern web human genom project human genom kephart shopbot econom autonom agent system forthcom al human gene mutat inform research resourc hum lieberman autonom interfac agent proc acm confer comput human menczer belew adapt retriev intern local context scale web machin srinivasan evalu web crawler proc annual intern acm sigir confer research develop inform privat shop assist proc acm int joint conf autonom agent multiag system build maintain nation librari consum health web servic bull med phenotyp navig inform resourc najork wiener search crawl yield page proc intern world wide web menczer explor versu exploit topic driven crawler proc intern workshop web pinkerton find peopl experi webcrawl intern world wide web porter algorithm suffix strip al resourc nation center updat nucleic acid
Agents/118 1 split clone agent fan turku centr comput scienc technic report split clone agent fan turku centr comput scienc technic report isbn issn abstract clone agent balanc load discharg comput task clone reason transfer smaller clone agent bulki agent mobil comput simpl bdi agent model formal establish semant construct agent inherit behavior exist agent de ned kind clone mechan identi properti clone mechan relationship implement issu discuss agent mobil inherit research group program methodolog research group introduct kind mechan agent agent network individu avoid situat agent agent function leisur popular mechan ma facilit special kind con agent regist servic knowledg facilit balanc load local agent control agent cooper autonomi facilit bottleneck ma extend classic agent architectur furnish agent capabl idea clone comput scienc di erent wai inherit mechan oo paradigm paradigm kind object attribut ned exist clone procedur program pro compil parametr polymorph elimin oo languag clone agent gener concurr agent instanc mental state behavior discharg comput task clone instanc simplest clone deep copi compon templat agent identifi result entiti fresh agent identi er clone agent ecient exibl ancestor prefer kind clone clone agent case agent transfer site desir comput part servic knowledg sucient carri comput task mobil agent consum fewer network resourc transfer smaller comput logic site larger amount data transfer date enjoi full bene ts permit kind agent transfer world restrict perform improv agent split smaller secur agent vulner wai split agent smaller depend constitut agent model question establish simpl formal bdi agent model de ne di erent kind analyz properti relationship agent model de ned section formal de ne semant construct agent inherit behavior exist agent bdi agent pertin import clone mechan section section give di erent kind clone mechan properti section concern implement issu conclud remark section formal model bdi agent agent system situat dynam chang continu perceiv react extern stimulu base intern mental state desir intent primari mental attitud ascrib captur committ aspect set plan behavior pattern agent model mental attitud knowledg agent true fact world accumul belief state agent ect model perceiv environ coexist agent goal speci es desir end state goal compon make agent predic logic speci cation languag goal vector predic set formula form wg formula test goal pre xing achiev goal deduct structur pair set formula consist wrt modu ponen set infer logic relat set formula mean prove rule de nition set consist wrt mp set infer rule deduct closur wrt singleton rule set write deduct structur denot weaker denot ld de nition deduct structur kernel minim subset set hold safe split feasibl logic split exist kernel safe split safe split fb fb gg lost split fb fb gg safe split fb feasibl logic split dynam nite set ag identi er denot set agent current activ nite agent identi er belief goal attitud agent model deduct structur de nition agent knowledg attitud belief attitud goal attitud hk hb hg fk fk fk de normal axiom schema modal dn law doubl rule mp modu ponen formula di erent interpret depend modal oper belief goal agent truth similar interpret belief goal agent close axiom includ infer rule necessit rule exclud avoid notori logic omnisci agent set feasibl logic split exist kernel safe split jsj size set agent conjectur jf jf jm jm show hold exist uniqu kernel wg uniqu kernel wg jf jf jm jm inconsist mental set nite set set infer rule includ mp metavari consist set hold exist nite sequenc distinct formula hold hold hold hold ectiv transit consist set logic trigger hold trigger set denot atom procedur lc make consist procedur procedur lc inher nondeterminist arbitrari order select oper doesnt matter long agent inher nondeterminist nonmonoton reason capabl chang time time atom procedur consist subset long consist initi step fs qg fs tg nite set step procedur procedur termin lemma consist wrt proof exist possibl make empti requir prefer make thing bit complic contract make result set consist consist set gener case lc call make consist case deriv consist subset trigger drop part deriv sequenc consist subset rst case dealt step step deal deriv sequenc wholli step part pre deriv sequenc run complet kind inconsist contract result set consist wai make consist wrt prefer procedur base prefer set requir formula drop make consist inconsist made consist step trigger make set inconsist belong contract set drop trigger step trigger belong element drop deriv step deriv sequenc belong trigger deriv step divid step thing complic bene plan model agent set behavior primit capabl mean primit capabl set plan ascrib agent plan set trigger event guard condit plan postcondit denot plan prioriti util ct ls intern trigger export plan call plan end failur event label call di erent export event trigger guard condit deduct closur current base belief set plan bodi appli function set primit set direct subplan set commun primit de ned plan bodi plan bodi built primit subplan commun primit ow sequenti graph ow relat set node direct graph reachabl node calcul shown de direct acycl cycl broken includ set fag relat direct neighbour base plan cluster write implicit mean mind agent set plan cluster denot fl jl collect exist exist distinct set de nition agent feasibl behavior split agent denot set feasibl behavior split agent jm jm plan plan agent gener identifi subag idea plan subset declar agent creat identifi higher prioriti plan plan denot ct ct set relat class plan transfer denot fm lg plan set prefer obtain determinist iter val jm val current activ focu ground instanc plan bodi ect choic commit agent current mental state set intent agent denot bdi agent denot agent abstract empti agent ag oper semant bdi agent agent receiv stimulu activ task inform coordin intern invok event delet ad belief instanc pertin plan invoc event coincid stimulu collect form select plan set plan instanc committ feasibl context sati ed current knowledg belief collect uni cation append intent set execut intent ect mental state gener make system evolv inherit agent creat inherit agent agent nomenclatur term subag freeli subag creat attribut simpli wrap ascrib inconsist mental state strategi rede ning appli resolv kind discrep case attribut ad creation result origin behavior preserv inform ad viewpoint belief exist contradict exist acquir acquir inform exist part incur discrep abandon schedul problem transfer rede ning plan deserv attent claim behavior veri ed behavior subag result failur plan subag prior suspect inherit mechan introduc agent smoothli system veri ed behavior succe context algorithm rede ned plan optim context subag feasibl solut ascrib higher prioriti rede ned plan applic domain strategi permiss tag mental attitud order subag identifi sourc inherit inherit element wrap tag creation subag tag set atom tag identi chang dynam tag uniqu empti tag set construct tag tag tag tag element tag set tag denot bs tag denot tag ft js set tag extract function de ned tg obviou jt partit oper forget tag object tag object tag function function extend set fb js sg deduct relat set di erenc overridden tag formula priorit set union agent popul inherit de ned set ag agent identi er chang dynam agent creat exist agent pass de ne function simpli pick element belong set de nition agent hk set reject belief set declar agent construct procedur sh singl inherit ag ag hd hd exist agent share behavior exist agent claim subag de nition agent hk hk agent procedur sid singl inherit hd hd call agent commit modi cation appropri furnish attribut de nition set ag fusion procedur fs ag ag hd hd hd agent hk hk denot set agent denot set agent denot ja ja weak associ agent singl inherit theorem agent hk hb hg set consist set obtain appli function theorem hold inconsist fp fq belief attitud result agent left half part theorem belief attitud result agent half part multipl inherit power mechan agent enrich versatil entiti combin attribut exist agent complic creat agent multipl inherit singl inconsist result super di erent super agent singl multipl prefer subag exist contradict super agent contradict origin di erent super discrimin di erent analog situat servic provid major function work time ort subsidiari exist con ict de nition set fa ag hk agent construct procedur mh multipl inherit ag ag bb agent identifi subag set exist agent de nition set fa ag hk hk agent procedur mid multipl inherit bb similar weak associ multipl inherit theorem set ag hb hg set theorem set ag set agent clone simplest agent clone deep copi compon assign fresh identi er result entiti de nition agent hk prototyp clone procedur ps ag ag prototyp clone clone agent ecient exibl prefer kind clone templat de nition agent hk logic split procedur iter ag ag frg agent mean logic split order logic randomli chosen split logic slice set agent belief attitud feasibl logic split ls extend set lemma agent hk hk ag hk ag belief denot weaker belief denot ld set ag agent weaker ag denot ag ag ag consist fs fs restrict ag connect ls fs theorem ag ag fs proof agent set ag agent prove fs fs fm free al fs al fs nition ff fs ag fs fs fa lemma fs fs fm free al fs al fs fs fs ff fs ag nition de nition agent hk fp behavior split procedur iter ag ag frg agent split acquir behavior randomli chosen behavior split behavior slice set agent plan librari feasibl behavior split bs extend set lemma agent hk hk ag hk ag denot weaker denot set ag agent weaker ag denot ag ag ag fs fs restrict ag connect bs fs theorem ag ag fs result clone agent plan relationship logic split behavior split theorem agent tag identi ad element mental behavior compon agent creat inherit append compon inherit part hold reject set function tag disappear compon result agent exist extrem case tag disappear compon result subag case practic subag inherit agent bene reason contribut identi er super agent occur tag subag agent hk split agent inherit ad de ned behavior introduc ect result slice plan compon result clone ad de ned lost clone tag call kind problem featur interact counter behavior preserv behavior preserv problem oo paradigm simpl text input window user text agent gener singl inherit behavior cut past de ned di erent oper chang displai style select text de ned text gener cut past ned ensur select text cut past di erent style text lost note version cut past di erent split speci ed encapsul featur preserv behavior de nition agent hk split procedur rs iter ag ag frg set ag rs extend lemma agent hk agent hk weaker hk denot ld ld ld agent set ag weaker denot ag ag ag consist fs fs restrict ag set result set agent appli split transform weaker shown lemma lemma set ag intent set agent agent speci ed prefer result lemma set ag ag connect rs fs theorem ag ag fs clone relat de set split jaj explicit clone stand perspect origin agent clone di erent window interfac origin agent view provid di erent function servic agent implicit perspect explicit di erent explicit clone combin jaj di erent perspect jaj clone result agent split relationship rs rs complic bs ls agent ii direct chang depend chosen split chang depend chosen ideal case logic split chosen angel ideal stronger relat weaker relat theorem agent analysi relat rs maxim split chosen angel plan librari concern theorem agent implement concern clone mechan easili agent implement compar classic agent capabl di erent architectur pertin clone mechan agent societi form clone evolut trace agent clone virtual shell clone ident origin agent embodi di erent entiti clone ident correspond real entiti ident correspond virtual facilit manag result clone kind virtual entiti state plan librari mental state mental state direct plan librari behavior includ virtual di erent clone subset origin agent plan librari intent clone agent empti virtual shell fusion clone consist entiti ident evolut version clone fusion kind viewpoint mental state clone chang split super agent exist con ict mental state time point clone clone successfulli ful lled respect task initi intent super agent clone point fusion clone acquir knowledg world mental state agent evolut version simpli recov knowledg map virtual shell deriv current mental state clone coordin clone agent improv perform ow fact comput unit execut part function origin cienci virtual shell coordin clone coordin individu clone combin function run separ agent team virtual shell schedul candid clone task case clone fail messag relai deleg forward mechan implement properti share di erent entiti object knowledg origin question forward wrap trace direct ancestor repeatedli question solv context origin object virtual shell agent charg messag forward clone meta virtual shell local societi extern virtual shell discharg clone behavior deleg set clone connect clone virtual consid global entiti clone agent identi insid behavior clone contribut part agent export behavior agent deleg clone virtual shell agent clone distinct compar normal agent independ clone ident clone agent transpar agent clone claim independ agent ident permiss clone agent origin clone agent contract kind dissoci clone back control clone trace inherit attribut agent tag trace sourc agent clone clone histori knowledg base record pertin clone agent isnt direct relat individu clone result split interact coordin common virtual shell migrat architectur clone mechan mobil agent prohibit clone agent claim independ agent transfer comput site clone contract back pertin inform acquir extern comput context fed back clone fusion analog principl agent clone clone individu part gure entiti agent descend clone form virtual agent tree structur combin clone relat evolut trace agent shown main trace line success version agent clone point version fusion point success version version evolut trace clone clone mechan softwar architectur system di er larg construct agent clone capabl facilit longer viewpoint clone agent regist clone agent clone comparison split agent clone behavior composit intellig object collect clone piec clone piec agent organ deleg deleg relat clone agent global entiti real clone piec ident transpar agent ect di erent viewpoint aliat clone intuit mean agent clone compar piec split object perspect aop agent clone piec evolut insid agent di erent clone agent di erent di erent mental time give discrep fusion reason clone integr origin agent evolv version furnish inform extern robust behavior clone chang social posit permiss aliat agent mobil comput agent clone larg transfer entiti prefer discharg mobil agent clone break clone announc clone individu independ agent mobil comput unit smaller parallel comput promot clone transfer comput site time bulki agent undergo long site speci ed task ful lled main contribut paper di erent clone mechan agent pertin properti clone mechan relat studi formal bdi agent formal agent singl multipl inherit clone logic behavior prototyp identi ed bdi agent logic order avoid unnecessari cooper di erent clone incomplet de cienci mental close logic origin belief compon split unit fb ascrib clone case queri hold bene ts logic split local infer simpli ed speed ow number logic formula belief base result clone global inform inform topolog system essenti agent goal intent result clone divert clone agent exist potenti behavior disappear belief clone agent fulli inherit clone behavior feasibl behavior split plan librari construct elabor preserv integr result plan avoid unnecessari cooper di erent clone plan clone agent fulli inherit order clone cooper smoothli smaller plan clone respond quickli ow choic clone accept mobil comput unit frequenc cooper clone solv complex problem split valuabl bene ts logic split behavior split acquir stone origin agent divid inherit sourc element result set clone set super agent current clone agent chang gener agent reason carri make mental state clone agent consist creation ad mental state de ned behavior project compon clone split stage refer perspect complex aggreg intern confer object orient inform page dec uk split disciplin deleg object confer objectori applic san usa acm sigplan notic iter type analysi extend messag split sigplan confer program languag design page methodolog procedur clone comput languag analysi inherit mechan program proc page georg wooldridg model agenc intellig agent lectur note vol march program european confer program finland lnc june deduct model belief pitman london morgan san ca mobil agent futur internet acm oper system review mobil agent mobil comput chapter addison weslei acm kaiser adequ test program journal program procedur proposit logic workshop lnai page bdi agent speak logic comput languag lnai page program arti cial intellig intellig theori practic knowledg engin review choic intellig vol turku centr comput scienc turku finland turku depart mathemat scienc abo depart comput scienc institut advanc manag system research turku school econom busi administr institut inform system scienc
IR/119 5 wrapper gener robert baumgartn tu wien vienna austria univ della pietro itali georg gottlob tu wien vienna austria abstract illustr basic featur wrapper gener user system visual mark select extract task describ construct simpl program current prototyp introduct fulli visual interact wrapper gener tool featur design visual creat program regularli extract relev inform chang web page similarli structur web gener xml companion web page declar languag work client servlet version implement user interact system identifi region interest creat inform filter wrapper gener base exampl select user user open add pattern extract relev inform pattern carri default xml element pattern kind consist filter filter consist condit instanc pattern actual target list satisfi condit filter respect pattern defin user select target simpli click displai web attribut select background system gener basic rule suit element path default attribut user shown target match current filter undesir target choic refin rule instanc element occur desir target fig undesir target subset desir save filter construct filter target target match altern condit ad filter perfectli desir inform finish program program regularli continu extractor gener xml output class similar web page exampl simpl serv illustr pattern creation detail show add extern condit assum user interest current regularli check page revisit page inform short messag rank interest extract part inform write program extract current achiev creat program open page week add pattern root pattern call instanc figur ad pattern permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb select element figur test filter figur ad element figur mark element figur xml companion mark target default attribut set mean link characterist test current filter test current filter return target highlight fig book top list match filter user interest singl restrict opt add condit express element immedi desir target pattern select desir system navig select distanc toler distanc interv element occur set default attribut set kind attribut select put attribut user html knowledg font element characterist target extract exact content insid price test filter extract desir target save pattern program program appli version page repeatedli continu extractor show xml companion wrapper extract rang extract author creat hierarch extract defin book insid extract titl price inform string price currenc split interest exampl includ wrapper gener ebai yahoo auction map common wrap simpl tv queri mask access wrapper tv program web site complex advanc facil concept concept ad link extract refer gottlob visual web inform extract proc consult refer relat work futur develop report addit refer
IR/120 5 report workshop learn text web jaim mark steve tom mitchel yime yang fraction world inform data repres textual form world wide onlin internet sourc tremend volum textual inform goal workshop learn text web explor comput method automat cluster classifi inform text hypertext sourc workshop includ ten oral paper organ discuss panel distinguish hand contribut paper workshop provid good survei state art machin learn method appli text process task present work involv wide arrai learn includ induct neural network accept advic user relat learn method statist cluster algorithm boost method algorithm learn hierarch class activ learn method princip limit approach directli reflect attempt develop formal model text phenomenon interest research present workshop span broad rang applic inform extract inform find inform integr web sourc automat citat index event detect text stream document rout classif organ present document inform retriev system collabor filter lexicon learn queri reformul text gener analysi statist properti text state art learn text web broad rang method appli import interest task remain numer open research goal work present workshop fall overlap make textual inform structur format complex queri problem assist user organ manag inform repres text sourc research aim minton knoblock develop approach learn wrapper web restaur directori method induc extract rule small number label exampl learn extract rule appli web page treat structur work gear shavlik develop approach commun bandwidth user learn agent perform task find approach enabl user give advic learn agent time agent lifetim advic incorpor agent learn model subsequ refin method futur impact research text learn twofold inform text form automat map structur format abil web queri limit keyword search individu document relev queri directli answer queri answer distribut multipl web sourc abil text plan problem solv agent inform web make travel plan impact continu work learn text web greatli improv method present inform data sourc includ web transcrib broadcast newswir stori workshop brought light numer research topic open research question ffl learn structur hypertext opportun document exploit html format pattern connect hypertext ffl develop statist model repres hypertext structur addit develop algorithm exploit document import develop develop statist model task develop stochast model graph link object exploit idea literatur social network ffl exploit nlp techniqu text learn current work text learn concentr word occurr statist ignor linguist structur work understand natur languag process method appli gain accur learner ffl learn tempor pattern text text process topic track event involv stream text data time method detect exploit content web time ffl learn domain advic data addit learn train system advantag background knowledg advic offer user ffl system learn improv organ present inform type perkowitz etzioni begun develop adapt web site relat issu includ learn recogn type learn passiv relev inform ffl develop statist model interact data addit develop effect method system adapt web import develop statist model user interact data ffl learn text classifi word statist current research area explor method term featur document activ hierarch class inform ffl combin evid multipl sourc issu relev inform inform text classif inform combin document rank factor document editori vet document current research learn text web list research topic hard problem area call wide varieti disciplin includ machin inform natur languag interact challeng question research significantli improv state art introduc principl formal model text phenomena determin suitabl empir evalu suffici analyz behavior limit algorithm compar model evalu practic impact specif task inadequ workshop present trend research address theoret empir hofmann lafferti statist languag model document cluster apt present strong empir evid boost improv state art text categor excit research find encourag investig satisfactori answer futur refer weiss text mine rule tree gile autonom system process organ scientif literatur web de collabor filter agent system dynam virtual commun web automat learn syntact govern pattern dictionari text goldszmidt sahami probabilist approach document cluster punch iii autom concept extract plain text hsu dung wrap semistructur web page transduc hull text mine extract chemic compound hofmann learn repres topic kim effect relev input inform learn perform autom build neural network paper sahuguet inform extract heurist lier tadep activ learn preliminari result compar winnow perceptron text categor lafferti simultan word document cluster tool measur statist properti text mladen grobelnik featur select classif base text hierarchi knoblock wrapper induct semistructur inform sourc moonei learn inform recommend nigam mccallum activ learn text perkowitz etzioni adapt web ai challeng fifteenth intern joint confer artifici morgan kaufmann radev learn correl linguist indic semant descript entiti slatteri craven learn exploit document relationship case relat learn web shavlik build intellig agent approach carbonel event detect
HCI/121 4 scheme dynam hand gestur recognit jame chaudhuri agraw depart electr indian institut abstract paper scheme present recogn hand gestur output hand tracker track rectangular window bound hand region hierarch scheme dynam hand gestur recognit base state domin featur trajectori priori knowledg gestur perform introduct hand gestur recognit essenti host applic haptic interfac multimedia virtual realiti environ robot program sign languag human comput telerobot previou attempt recogn similar gestur varieti method davi shah marker track finger tip fingertip trajectori recogn gestur posit valu obtain eigen featur word asl recogn hmm base scheme concept motion energi estim domin motion hand gestur recogn fit finit state model gestur gestur classifi sequenc postur princip compon analysi recogn finit state machin multipl camera extract pose human bodi paramet describ pose trajectori obtain project eigenspac gestur recognit featur trajectori split recognit achiev maxim probabl gestur eigenspac increment recognit strategi extens algorithm recogn gestur base hand trajectori gestur model veloc trajectori algorithm increment match gestur model input data robust hand tracker track hand order extract featur recogn gestur level gestur recogn assign class base domin featur trajectori gestur recogn sequenc state obtain domin featur trajectori gestur sequenc state overcom problem due variat speed gestur avoid time warp data sequenc select featur gestur recognit system intend interfac telerobot system dynam manipul hand gestur suit select ten gestur list tabl form gestur vocabulari hand tracker mention previou section track chang posit shape rectangular window bound palm region hand perform gestur coordin centroid hand region serv good featur chang area hand region captur variat shape palm indic variat hand posit axi camera featur vector ò frame video sequenc select ò ò ò ò ì order valu video sequenc scale centroid width hand region start posit area initi invari magnif due distanc camera gestur perform respect hand size person person note featur made invari start posit requir scheme trajectori sequenc state depend ò ò ò ò ò ò figur smooth featur trajectori gestur obtain featur trajectori smooth figur smooth featur trajectori gestur ò moment hand region obtain track ò frame raw data obtain track noisi data averag filter fig show raw featur obtain tracker gestur depict noisi natur result smooth averag filter length fig featur trajectori unknown gestur smooth manner stage process order elimin smooth featur trajectori gestur perform singl user shown fig initi classif gestur base domin featur observ featur inform convei gestur simultan captur featur case inform horizont motion captur ò featur case featur show variat case call featur captur inform convei gestur domin featur gestur defin set gestur domin featur ò ò ò obtain venn diagram fig show relationship gestur domin featur gestur ò ò convei inform shown belong set ë region fig show base featur domin set cover class subset empti case ò ò domin featur ò domin featur chang area hand convei inform remain show motion small variat area includ class rang variat ò ò small rang variat ò compar ò ò stage classif gestur shown fig domin featur featur determin base rang variat featur obtain tree base scheme shown fig level classif term featur assum form smooth featur trajectori mention earlier order suppress track obtain rang variat featur ò ò ò ò factor make rang chang area compar chang posit studi select assign gestur recogn class sx cw push pull sy closer left figur gestur set base domin featur gestur set ii iii iv left cw push pull closer figur initi classif gestur set base domin featur stage classif proce class class class class ò ò class class logic oper threshold determin motion threshold mean motion greater time initi hand width ñ larg motion threshold class iii lesser fact motion horizont vertic rang variat direct natur reduc compar case larg motion direct gestur recogn variat larg variat variat larg variat variat featur max variat ratio max min class class class ii class iii class iv figur tree stage classif trajectori base classif domin featur trajectori class order recogn gestur observ gestur consist portion motion featur dynam similar distinct inform gestur sequenc portion similar definit gestur incorpor inform defin gestur sequenc state state correspond portion domin featur trajectori similar dynam class sequenc state defin distinguish gestur class result sequenc state obtain trajectori gestur recognit explain class class consist gestur due presenc domin ò state scalar case initi hand show small downward movement long upward motion shown fig ideal ò initi time index index end ñ split state repres select state chang featur portion uniform dynam portion consist motion direct ideal gestur result figur obtain state domin trajectori state ñ frame correspond maxima direct motion chang sign deriv ò order determin domin upward result recognit criterion gestur similar direct summar criterion classif class ii gestur class left class gestur analog class differ ò domin featur class ò domin featur result strategi class left class iii gestur class cw class domin ò ò state construct method select state depict fig trajectori split individu point maxima minima merg obtain state combin trajectori differenti direct rotat select direct chang ò ò element state vector denot trajectori shown fig state ì ì ì ì case cw ideal expect sequenc state due hand move circl return back posit hand rotat bit merg state map state direct figur recognit gestur class iii number state equal case recogn scheme base determin direct rotat defin map ë state direct shown fig defin ì ì ì ì rotat hand result subsequ period sequenc direct rotat sign sum cyclic differ denot differ map defin ã ã case ã recogn gestur cw class iv class push domin featur ò ideal result singl state area monoton similar class defin state ñ recogn gestur check number state æ differenti base direct area result scheme summar class gestur similar ò domin featur show similar variat featur discrimin ò show characterist closer gestur horizont motion ò remain distinct horizont movement left ò show similar behavior gestur ò form state method class ii ideal result state recognit criteria list gestur fall categori result gestur result hierarch gestur recognit scheme base domin featur test data set gestur perform user gestur sequenc length vari form frame depend time perform gestur gestur captur natur offic environ clutter background correctli recognit due manner gestur perform motion led recognit gestur found due skin color detect result faulti track result accuraci recognit scheme tabl summar result techniqu gestur recognit data hand tracker develop earlier hierarch scheme stage classifi base domin featur stage recogn gestur base state describ domin featur trajectori recognit techniqu unaffect rate gestur perform initi posit hand imag due state base approach gestur sequenc state obtain split domin featur trajectori perceptu import segment result fast simpl recognit scheme gestur instanc true left cw push pull closer total refer tabl summari result sharma pavlov interpret hand gestur ieee tran vol pp davi gestur iee proc signal april vol pp weaver starner american sign languag recognit desk wearabl comput base ieee tran dec pp understand dynam hand pattern vol pp martin jl approach proc sep recognit charact recognit techniqu proc ieee sep vol pp hall martin recognit paramet trajectori hand gestur face proc black tempor trajectori proc ieee int conf automat face gestur jame chaudhuri track hand estim erron proc sep
HCI/122 4 amplifi human knowledg experi intellig robot system inform interact peter richard michael john karl david william whittak abstract program develop publicli access displai archiv updat remot environ deriv robot sensor interfac encourag collabor work commun user public explor real remot site present varieti interfac issu address includ time public explor singl robot commun geograph separ user background merg public interfac educ contextu inform extend notion realiti nasa privat project base carnegi mellon introduct publicli fund earth planetari explor conduct knowledg public access knowledg media develop web robot technolog make student public activ particip scientif process remot autonom robot conjunct interfac technolog design creat geograph decentr user project studio creativ robot institut carnegi mellon pa engag scientif process activ explor telerobot mission site build robot interfac work creat nasa scientist visual nasa mar pathfind mission nasa map expedit previou project extend interfac technolog concept public project project design curriculum supplement secondari present web site member public countri access current archiv nasa telerobot mission base project previou project big signal web technolog portal link public robot rover nomad field trial project combin live archiv robot sensor data daili updat mission contextu tool enabl user compar rock nomad found identifi sampl project reach student classroom profil york time web sourc schedul upcom issu asm mechan engin enabl public access nasa mar data gather robot probe mar enabl student public explor virtual martian surfac deriv nasa data set unavail public data futur success mission incorpor mission potenti enabl live data tool technolog develop big signal curriculum develop situat mar data scientif histor context team process team embodi principl interdisciplinari collabor iter design process multidisciplinari team includ expert verbal visual cognit psycholog design project incorpor contribut expert relev previou current project includ earth planetari astronom nasa engin team anticip complet addit project year current nasa mission map strong candid upcom field trial nasa robot includ iter design process develop major aspect interfac content project team member rapidli prototyp present team comment comment integr present team week process repeat aspect project suffici develop conduct extern pilot test conduct full pilot test classroom school includ averag month workshop teacher held prior pilot test order refin interfac content prior test process great enabl problem identifi correct impact project interfac public explor remot site present rang interfac challeng distanc separ user remot robot creat issu time delai data stream interfac user singl robot vehicl maintain explor control challeng major issu includ determin interact give user mean distribut sort data streamlin enabl collabor user link data archiv creat coher wai independ navig vast amount repres remot site spatial time interact paradigm develop resolv enabl rang interact project publicli access educ teacher easili incorpor project classroom design member scientist section discuss interfac issu interfac featur enabl intellig robot system act amplifi human knowledg public control public point robot remain costli rare individu user true control robot compat goal bring robot larg number peopl show peopl robot control tv media rapid evolut coupl capabl offer possibl realworld environ robot recreat digit user download copi fit user experi control explor remot site direct robot physic includ inadvert damag robot termin action robot fall real remot virtual robot fall student launch mar probe reach mar user experi rang outcom telerobot mission harm real robot lose real mission paradigm interest current investig includ research method user control live mission method includ democrat action user virtual world monitor upload popular action forward scientist implement competit model user user team select success perform world scientif merit suggest close cooper team scientist engin partner rang robot project intent pilot test model control map data gather assembl spatial map timelin evolv user view inform gather examin earlier inform comparison remot site user add explor possibl robot gather data convert data spatial chronolog map assembl virtual spatial chronolog recreat robot mission environ explor order robot explor order user follow mission real join mission complet resolv time lag user schedul fig interfac icon refer time spatial event context librari provid background inform context librari rock librari big signal user knowledg understand particip work context librari develop mar build knowledg earth featur bridg assimil knowledg martian landscap context librari blend prior knowledg interfac design user make discoveri addit build knowledg base student facilit commun user skill knowledg level knowledg user context librari refer commun student user explor context librari depth part curriculum flag user comment question specif featur remot place featur user read answer add interfac user flag visibl flag featur develop mar user plant flag simpli run screen click object java shoot onscreen intersect point flag question inform input user form java object fig flag link comment extern intern web site link navig tool web structur link real remot experi inform user click featur remot environ trigger web page open page deliv contextu messag live chat show detail view featur user chang displai mode viewer web page user altern view solar system observ trajectori planetari orbit differ view invok web browser system call resolv url open applic java activ viewer web browser call script open commun main viewer remot method invoc current work team involv robot web offer public paradigm inform interact creat contextu interfac human project robot remot explor locat physic experienc locat robot robot devic paradigm elit group goal extend gener public accomplish creat softwar mimic function scientif run standard contextu remot site applic work educ inform entertain robot devic fulli function robot potenti applic multipli ultim goal work industri defin standard realiti bring real remot experi household workplac worldwid current model interact expand includ boundari separ user comput seamless robot interact physic environ robot act inform experi agent action physic world interact paradigm work refer mar virtual state art map tool mar map map ca juli tt lm cf al realiti map system accid site san ca feb thoma inform interact public telerobot current challeng internet robot full dai ieee intern confer robot bruce accompani robot quest york york polar pioneer scientist nomad comb land cnn onlin carnegi interact web site public explor robot yahoo big wl field demonstr result robot search intern confer field servic august pp
HCI/123 4 dynam framework understand formal construct complex technic set nielsen depart comput aarhu denmark abstract base studi work danish treatment problem work discuss extend technic process symmetr level dynam complex technic work arrang tool understand limit design formal construct set analysi base concept granular goal process structur introduct inevit problem design cscw system work stand work set routin evolv time unusu situat forc deviat routin pure formal construct descript work proven inadequ design real world cscw system suchman set debat role formal empir studi illustr offic work procedur heath luff continu studi work line control room london show seemingli routin task reli awar particip imposs subsum formal construct bower al studi workflow system print industri demonstr inabl encompass support actual work system structur work account smooth execut work cscw commun question abil complet cscw schmidt correctli point concentr part work ignor situat resourc import tool cooper work suggest formal includ written workflow import artefact support cscw true case complex manufactur process formal blueprint physic plant fundament featur robinson argu cscw applic support level formal cultur applic support tend fail treatment plant technic set unlik plant oper independ peopl emploi unlik control risk factor work plant treatment plant interven technic aspect plant work treatment plant present technic procedur complex system differ work set typic found claim investig limit design formal construct treatment set present find add previou work cscw paper report studi modern treatment plant denmark section describ plant oper set scope case studi theoret framework offer wai type work treatment section framework identifi level dynam base theoret framework discuss identifi symmetr level dynam case treatment hand question gener technic hand point framework understand limit studi treatment case studi part research cooper area hci cscw involv comput scienc depart aarhu partner explor theoret notion practic design common inform space project focuss field studi conduct research particip paper report observ work plant select follow worker entir daili routin research video camera captur event special emphasi daili work worker dealt disrupt select group clip present plant feedback session user workshop compar work practic site data collect project research treatment plant treatment plant conduct studi modern treatment plant pai attent flexibl exist work affect coordin work process plant includ chemic biolog phase result segment produc produc electr run plant remaind press plant plant implement automat process remov autom due develop sensor measur control primari paramet oper process radic chemic plant estim capac person constantli run capac plant expand match product work treatment plant emploi total peopl manag manag plant remain work area chemic test receiv preliminari sort sand trap plant control room press pair worker task specif part treatment process individu worker temporarili labour stabl bound set work individu free task situat demand import goal work relev part plant condit underli process run worker home night weekend worker charg lab spend hour morn collect water sampl qualiti water stage process worker charg ga turbin area check machin collect ga produc hour plant area task natur start morn overview statu plant graph list alarm daili routin check mainten highli high unpredict plant major alarm receiv treatment plant water level maximum limit tank alarm call address period dai worker handl time specialist call alarm due machin worker complet break daili routin enter cooper effort worker manag specif pai attent warn alarm physic sign desir prevent recov machin breakdown plant continu engag number experi produc cleaner water cost involv introduc technolog work practic provok unanticip event effect everydai work school disrupt normal visit carefulli plan execut daili work routin dynam structur worker deep understand assign plant order perform task continu reinvent work practic enabl place equip area redefin order task order cope numer event possibl anticip perspect treatment work standard engin literatur treatment fix seri compon analyt perspect mark contrast plant perspect thing result histor basin built predict set tank ad view static dynam situat current context discrep static engin view histor concept coincid result engin optim constel technic fixat variabl import tool plant manag plant longer period plan start star call border run plant process structur static view dynam view understand design technic abandon conceptu framework deal dialect structur process analyt process mean mere sequenc dialect process includ transform introduc analysi process structur framework understand develop work arrang model structur focu set limit time chang structur structur context denot qualiti perceiv solid stabl changeabl model process focu chang subsum structur structur argu choic focu structur process depend situat respect object mean constraint outcom situat establish emerg andersen al reflect relationship system develop highli establish routin high problem work practic solv problem solv situat work practic complet depend emerg natur problem set highli problem mean solv uncertainti work situat interest analysi fundament understand work practic build human activ dynam collabor work level uncertainti andersen al similar hierarch structur human activ identifi activ theori andersen al defin level uncertainti goal mean activ theori structur human act motiv automat human activ mediat artefact dialect process reflect recreat human activ situat histor technic context basic unit analysi connect structur base socio cultur context activ system topmost level hierarch structur activ direct fulfil activ consciou action direct relev goal action unconsci oper trigger structur activ condit environ hierarch framework understand collabor identifi level collabor integr part routin particip act script defin explicit written tradit tacit knowledg collabor direct object share mean share actor actor continu modifi action base intermedi adapt action action process object level motiv creat object work mean obtain fix share actor continu process creat commonli share set object rule framework studi court case al studi dynam collabor hospit set understood elabor uncertainti framework refer point construct goal motiv central aspect dynam collabor treatment situat connect breakdown machin exampl breakdown collabor rare occur treatment plant prompt extern factor legisl critic quantiti qualiti industri citi case primarili involv manag peopl citi offic identifi dynam treatment dynam set process water flow transform structur develop detail analysi dynam identifi dynam treatment plant construct checklist checklist base concept introduc suggest gener tool analysi complex technic work arrang identifi contextu unit granular goal motiv identifi process link process structur contextu unit identifi mode identifi type technic structur identifi contextu unit contextu unit unit set make specif task heterogen overlap star boundari object object parti robust maintain ident heterogen plastic adapt constraint parti work compon treatment plant boundari object part overlap contextu unit interpret gener limit part daili round specif ga motor listen part contextu unit daili round motor constitut isol contextu unit situat repair motor part subpart plant transform ga electr ga product contextu unit time import indic load plant manag offic centr symbol manag gener monitor worker daili enter result laboratori test process control comput system heterogen contextu unit fundament hierarch decomposit mainstream engin literatur granular goal motiv specif alter technic arrang transform basic condit perspect activ reflect mainten stabil introduc clean meant worker extent daili work routin includ task introduct chang work practic point view citi plant perceiv adjust transform differ relat granular goal motiv deal granular understand histor develop background motiv identifi process discuss process understood mere movement time space notion process understand technic arrang treatment plant understand process water phase human work kind possibl highli daili test sampl collect motiv level question process law natur dialect direct motiv technic structur time sampl determin phase account link process contextu unit link process structur contextu unit process structur contextu unit process chang move structur unit test sampl collect round structur distribut test sampl point plant arrang test point plant chang develop wai automat insight requir societi diagram support doesnt fulli acknowledg heterogen natur contextu result variabl featur technic structur identifi mode identif mode primarili relat work consid treat terminolog constraint possibl studi mode term enforc dynam flexibl routin larg part work worker treatment plant daili round form fill sequenti plant impli sequenc serv checklist script relat work laboratori flexibl tool test tube heat order work identifi type technic structur technic structur structur chemic biolog process structur process control autom system structur perspect present limit basic type expert perspect relev engin disciplin autom theori yield distinct process control featur technic structur treatment plant number alarm routin dynam treatment analysi case studi issu dynam level model discuss contradict mainten instanc gener contradict motiv level dynam chosen perspect treatment work correl element structur process hand shape delimit abil transform transcend chose view support understand obtain work field constantli adapt chang reflect level dynam system affect aspect treatment process substanti perspect map kind dynam structur present treatment aid checklist technic process basic level dynam sine movement water pipe tank altern process movement peopl work plant form dynam peopl move larg part work plant walk move remot part plant time dai collect test monitor condit plant vital part prevent breakdown verifi system inform technic period visit treatment technic structur plant chang tank locat tank substanc separ water percentag water process bio ga gener experi treatment capac visit plant week shed build tank experi attain perman statu implic studi dynam technic structur chang begin fluctuat end sustain chang technic structur movement technic chief biologist central offic case mere adjust establish mode oper men shed equip alter work introduc task dai dai call adjust establish build object flexibl routin check area notic surfac water tank immedi build water check filter suspect water turn explain water check filter build part area situat simpl man work welldefin round contextu part plant task physic check number thing situat reveal interest point identif mode process encount brown call causal process interf actual motiv initi chang routin daili round defin term task checkpoint routin leav plenti flexibl order task perform relat task strict relat physic layout plant contradict motiv work process run continu lack warn brown water risk actual machin breakdown physic layout render process imposs connect compon relat process physic stand side side reserv hold doubl cooper situat worker leav routin collect recov machineri flexibl crucial argu high flexibl import everydai case aspect treatment process absurd claim flexibl physic flow water make send water bai chemic mechan clean process argu technic structur treatment process identifi continu chang process transform domain profound treatment develop legisl water qualiti plan pass danish late introduc norm pollut water resourc motiv legisl instanc sever river sea area outlet water primari product longer accept water treatment plant legal public opinion depend effort treatment plant reach legal level technic process work routin chang accord small exist technolog affect process notic implement technolog radic chang task perform staff involv complet chang process contextu level case talk contextu unit plant chang situat call redefinit level contextu possibl includ treatment system citi appar deal rang extern influenc affect treatment possibl similar influenc consequ develop technolog make process effici econom mean effect econom gain rare hand hand mainten discuss tension mainten instanc conflict motiv treatment field studi exampl contextu unit work horizon manag worker manag worker share goal make plant run smoothli manag goal improv plant econom term cleaner water specif experi ad improv qualiti horizon stick canva press make harder empti disrupt work maintain press process work horizon worker type identifi instanc collabor effort break aid identif handl process find fruit work mainten mainten treatment system part stabl run breakdown motiv chang process obtain term cleaner water manag introduc disturb run mainten worker elimin disturb preserv statu goal mainten work reflect stabil context equal complet fix state space defin level dynam affect treatment process mainten work oper work delimit structur level dynam free make arbitrari perspect ident make hard differ motiv possibl contextu unit situat framework offer method work relat motiv assess perspect drive actor collabor activ line mainstream cscw research suchman question formal studi treatment plant establish case deviat situat action hindranc complet question applic formal construct relat technic arrang base analysi type dynam observ treatment perman transform featur expect gener technolog develop bring cost relev comput hardwar level feasibl introduc higher fine mask control treatment plant studi point difficulti implement formal relat flexibl work relat process system dynam technic control system updat rate pai modif control system modifi design approach enabl technic tailor base strong approach locat part control system home process relat flexibl work routin level framework identifi understand domain treatment conceptu tool design complex technic handl design formal construct futur activ project report level dynam evalu basi design acknowledg peopl treatment colleagu project anonym review construct critic ow special wendi mackai work project support danish basic research centr interact danish nation centr project work danish refer system develop prentic hall comput support activ theoret approach design comput support cooper work phd comput scienc depart pb oxford dictionari philosophi oxford press workflow technolog cooper work print industri theori practic treatment john wilei learn approach christoph gregori cooper commun transit legal work quarterli newslett laboratori compar human vol number cc luff collabor crisi manag multimedia technolog london underground line control room cscw pp languag dialect dialect languag human press histor perspect work practic case nation labour inspect servic andersen comput medium cambridg og system develop system develop comput scienc depart doubl level languag confer societi cultur mutual cybernet scienc amsterdam pp coordin cooper paper present ad workshop work learn san januari schmidt map statu formal construct cooper work hayn acm confer support group novemb acm pp structur boundari object heterogen distribut problem solv gasser huhn distribut artifici volum ii pitman pp procedur problem offic technolog vol pp plan situat action cambridg cambridg press
DB/124 3 monitor network log activ lane sara daniel lanc david appli research laboratori depart comput texa austin abstract report progress system driven applic network detect applic typic class problem coin monoton log monitor system system data sourc log transact assur servic support mileston success layer venu languag execut oracl venu abstract machin interfac data abstract oracl nativ trigger mechan identif system interest applic class enabl limit coupl mode identifi effect layer architectur introduct investig activ technolog detect network activ monitor hacker attack militari perform central command privileg comput subnet sniff network traffic initi set execut analyz traffic captur suspici packet discard obviou connect synopsi result filter subset connect log forward central command log oracl program sql period wake analyz activ event alarm condit human network analyst possibl notifi action network analyst exploit arrai queri tool investig track individu event watchdog effort encod central command compon directli rule execut rule tight integr exist platform worth note specif deploi system larg expect encod lead easili extend system pend deduct abil autom task conduct human expert watchdog effort integr rule system legaci consist primari task hook rule compon nativ sql standard trigger mechan select rule coupl mode implement refin ami layer applic challeng function provid layer determin perform bottleneck inhibit perform requir form basi identifi construct possibl impact sql standard research fund expert system project appli research laboratori texa austin sponsor air forc inform warfar center engin analysi contract watchdog compon expert system autom secur incid measur system watchdog typic larg class term monoton log monitor system system process form data log central primari reason dbm chosen storag method exploit servic watchdog receiv connect log suspici packet store monoton support highlight natur log exploit restrict number coupl mode simplifi transact interfac element monoton log monitor system class activ applic exampl rang point medic patient process monitor applic move support process increasingli time analysi success implement watchdog demonstr step technolog properti rule system familiar rule eca rule evalu typic modif recognit rule condit typic execut queri content condit action rule typic modifi extern side effect relat properti monoton log system necessarili monoton relat defin properti relat system borrow terminolog defin relat relat visibl rule system work relat rule system relat relat distinguish monoton relat relat defin monoton relat relat modif visibl rule system append consequ definit rule compon oper commit data rollback insert violat condit leav open possibl monoton relat purg modifi offlin mainten monoton relat includ connect log file network monitor applic custom order histori relat relat relat consist tupl modifi delet normal system oper exampl includ connect user relat inventori level relat distinguish monitor relat poll relat monitor relat relat rule compon automat notifi assum nativ trigger mechan poll relat stream updat rule system distinguish activ relat passiv relat activ relat eca rule mention relat event activ relat trigger condit evalu defin monoton log monitor applic activ relat monoton coupl mode relationship eca rule transact seri coupl mode defin relationship widom ceri summar class coupl mode coupl mode describ relationship occurr event evalu rule coupl mode describ relationship condit evalu action execut claim set coupl mode prune applic rule process necessarili begin insert activ monoton relat rule system oper commit coupl mode decoupl term origin rule assum singl origin rule quickli concern sql standard trigger commit semant oracl fire trigger uncommit counter basic undesir activ system result incorrect behavior includ origin rule execut due abort condit evalu data ad uncommit updat turn oracl facil maintain buffer watchdog successfulli avoid pitfal sql trigger semant address rule enabl event relat descend origin rule remain coupl mode determin ca coupl mode ec coupl mode rule event activ term chain rule discuss ca coupl mode correl mirank explor correct program execut environ categori isol guard guard stabil cursor greatest amount amount isol user mode dictat row access condit evalu action execut mode ensur transact affect rule system serializ mode properti guard stabil mode mode guard stabil stronger serializ impli lock gain condit evalu maintain action execut decoupl ca coupl mode venu system environ clip op oper individu rule atom impli action execut immedi condit evalu ca coupl mode dictat leav ec coupl mode chain rule recal event trigger rule evalu necessarili rule perform activ relat featur venu system constrain choic coupl mode semant venu treat rule atom action postpon action complet ec mode applic venu system support concurr execut strictli serial rule execut sequenc requir choic defer decoupl requir rule engin enforc desir rule order defer mode isol number durat lock decoupl mode potenti concurr reduc amount isol burden programm correct consist issu chose implement watchdog decoupl ec mode note multipl origin rule enabl insert event concurr execut origin rule rule concurr achiev execut multipl independ instanc rule engin rule system relat complet separ anoth buffer detail applic construct layer oracl underli due restrict oracl rule compon exist process address space unfortun situat singl piec inform simultan exist place place inform oracl disk storag area oracl memori address space trust oracl adequ manag buffer concern place rule system memori space perform rule system partial buffer relat impli familiar problem consist lock advantag properti individu relat maxim buffer possibl improv perform condit evalu relat exist address space rule system maintain main memori swap disk virtual memori subsystem monoton monitor properti lock addit occur notifi addit provid easili maintain buffer form activ relat venu languag leap match suit tupl time insert relat buffer access relat type impli lock queri venu activ extens famili expert system languag commonli implement rule modif extent yield rule evalu evalu condit execut action significantli costli extend venu provid eca rule expert system languag watchdog exploit function monitor monoton connect log insert event relat turn event monitor net result amount durat lock fewer access execut extend venu issu command abstract machin interfac instruct set leap program ami encapsul function common interfac heterogen compon applic architectur watchdog implement minim modif exist applic data flow figur illustr data flow watchdog data enter system bank monitor network insert oracl data oracl trigger sql trigger action trigger code special program escap mechan send data program program pass data socket watchdog compon data insert fifo queue data enter watchdog ami mirank instanc ami code remov data fifo place respect venu watchdog rule compon modifi add data oracl instanc ami eca rule subtract ca rule ca rule evalu modif eca rule evalu state event extens subtract modif includ time tag field append tabl definit oracl provid common commerci product provid facil sql standard regul program languag escap function cover standard trigger code unit elimin copi insert tupl data flow control flow bank network program fifo watchdog watchdog rule set evalu oracl db ami wrapper code trigger code network data event detect pass data program insert data fifo wake suspend thread ami call detect data fifo ami wrapper code evalu event db updat figur layer architectur control flow figur illustr control flow watchdog data enter system bank monitor network oracl updat oracl evalu activ monoton relat pass control applic trigger code trigger code spawn program send data socket trigger code transact side maintain decoupl coupl mode watchdog compon detach thread monitor socket data insert detect data fifo data remov share fifo queue insert activ instanc deem safe ami call modifi start process note address rule execut occur parallel tightli layer approach semant batch orient venu program encod coupl mode code modul code unit ad implement layer refin ami definit code commun oracl implement detach thread insert data fifo buffer oracl trigger code code pass data program code escap program pass data socket call interfac compon written program written sql trigger commun system socket fifo data structur manual implement futur compil extend output unit code recognit updat relat effect place read fifo buffer notifi venu activ relat updat complex time maintain ca coupl mode consist venu languag semant layer activ top legal implement implic implement quickli manifest implement lowest prioriti rule root modul rule read data fifo buffer updat system possibl exhaust rule lowest prioriti rule root model effect implement coupl transact start read buffer transact commit fire rule program correct ensur monitor relat append impli evalu improp data method constraint lead unwieldi larg buffer trigger event priorit bound priorit origin trigger insert data fifo buffer priorit origin read origin rule chain rule oper singl transact model maintain coupl mode program correct time transact process updat rate queu model establish execut schedul asynchron oper system hard constraint al correl mirank evalu commit standard option trigger semant notifi insert abort evalu rule incomplet relat util implement method investig altern softwar paper present implement layer system class applic coin monoton log monitor system layer advantag nativ trigger mechan ami implement watchdog demonstr clear expand sql trigger semant includ standard program languag escap order elimin addit copi object order elimin spuriou rule execut abort data rule evalu outdat relat substanti construct requir correct behavior applic examin numer rang coupl mode present literatur applic experi class subsum larg portion coupl mode present class preliminari perform result demonstr layer execut consist expert system data workshop speak result watchdog suggest consequenti simplif enabl practic system built todai bibliographi jc al approach modular intern confer tool artifici ieee dp mirank venu rule intern confer inform knowledg novemb transact load workshop activ dart novemb cl forgi user manual technic report depart comput carnegi mellon juli jc clip user guid artifici intellig johnson space june mccarthi architectur activ manag acm sigmod intern confer manag data pp dp bj perform lazi match product nation confer artifici juli system specif verif acm transact softwar engin vol octob pp dp overview activ intern symposium cooper system advanc applic decemb jeffrei principl system vol freeman decemb ceri activ trigger rule advanc process morgan kaufmann san
IR/125 5 topic local experi observ brian davison depart comput scienc state jersei nj usa juli abstract web page link relat content combin text possibl html anchor describ page foundat usabl web examin extent idea hold empir test topic local mirror spatial local page web find likelihood link page similar textual content similar sibl page link parent close anchor text repres part target anchor text discrimin unseen child page result present foundat success web includ search linkag intellig web agent introduct web page link relat content combin text possibl html anchor describ page foundat usabl web make user follow link link point relev content idea notic research implicit system servic found web todai idea basic case system fail mention explicitli cdr influenc measur paper attempt rectifi situat measur extent idea hold paper primarili address examin presenc textual overlap page relat issu qualiti descript web page relev web crawler search engin link primarili web human browser web shorter version paper confer paper user expect find page link text find page accur descript text present search engin result show empir evid topic local descript text repres target page find likelihood link page similar textual content similar sibl page link parent close anchor text repres part target anchor text discrimin unseen child page experi select set page web follow random subset link present page corpu measur textual similar nearbi remot page explor qualiti anchor link respect document describ motiv work give exampl includ web search rank crawler web prefetch describ present result conclud summari find suggest work motiv web structur small part order page link random glanc inspect gener show typic web page author place random link page except banner creat link page relat topic practic wide believ underli number system servic mention question describ web page common applic content web page situat titl descript page result page queri typic search text link page number system assum accur repres page includ system web index web index page web gener invert index page search popular search engin includ altavista lyco index sort perform function search engin index full text page www worm index titl anchor text index line text recent googl start index titl todai common major engin index titl page smaller servic research project intranet search engin opt reduc storag index common index html meta tag keyword descript search engin index text cite problem search engin spam author place keyword text relev current page design draw popular search index typic includ anchor text hypertext term repres page term describ page referenc except index anchor text googl present target page user redirect page text fact relat target page recent public queri return microsoft highest rank answer googl search engin address question anchor titl meta tag descript text repres target page text titl descript weight term text page goal provid evid make includ text addit target text index process search rank system search engin text analysi find page relev queri search engin incorpor addit factor user popular actual user link popular page link form page statu calcul link popular statu calcul assumpt page author link random page link author direct reader page interest relev topic current page link analysi approach clever depend set interconnect page relev topic interest richli interconnect order calcul page statu anchor text rank relev queri commun discov analysi laser demonstr linkag inform rank page comput textual propag relev backward link point relev page goal enabl engin find page good start point autom page dont rank highli base text analysi explain util anchor text show neighbor page topic engin engin metacrawl savvysearch dogpil search servic search index collect compil result search engin servic present result obtain attempt rank result perform addit process grouper perform result cluster inquiru fetch document analysi simpler version decid fetch page analysi inform provid origin search engin qualiti page descriptor import textual rank cluster page crawler crawler web crawler follow link expect relev client interest queri similar crawler result search engin start crawl web dataset assum find highli relev page local search start relev page dean similar approach find relat page crawler content current anchor text determin expand link examin nearbi page relev anchor text relev intellig agent varieti agent peopl web depend content page text anchor determin suggest user prefetch link user compar text neighbor estim relev page neighbor current find anchor text describ target page method data set initi data set page random set page select web web estim hundr million page entiti complet major search hundr million page fraction page retain dataset sampl web select random subset web open question progress made data set start point paper select random subset web randomli select page approxim million page local research search engin crawl index earli decemb page dataset time gener primarili result inquiri made major search engin hotbot page neighborhood result direct ancestor descend page select page dataset bia sampl page neighborhood page page page score highli queri search remain data set initi data randomli select outgo link page retriev page randomli outgo link page fetch page set test anchor text relev sibl page measur similar sibl page textual extract page retriev perl perl librari text extract html page perform custom code term replac punctuat whitespac term made strictli content text page includ titl meta tag includ alt text imag url extract perl librari custom code standard url format drop maxim match url titl descript bodi text anchor text target url anchor text includ text link surround text term span basic textual item term frequenc textual similar calcul perform textual straightforward describ section measur appli pair term refer word sourc document titl anchor gener document note measur produc score rang ident document gener score document term common gener score tfidf cosin similar calcul select widespread long histori inform retriev note idf valu calcul document combin retriev entir web specif formula pp time number doc number doc term document tfidf normal sum valu term document sum document cosin measur pp term probabl measur design measur likelihood term present target document simpli sum fraction queri term present target number time number term document overlap measur chosen measur amount overlap normal length calcul measur sum term smaller repres fraction experi perform primari experi perform includ measur textual titl descript page page children page random page page ancestor respect distanc parent document refer url anchor text page point anchor text random page anchor text page point link parent measur length descript provid descript meta tag anchor page textual content examin link page perform experi stop word elimin porter term stem similar result clariti graph case postpon appendix end paper featur select term count domain figur twenti common domain combin sort frequenc top ten domain au number page number link number page number link figur view distribut number link web page result gener characterist characterist dataset initi url retriev addit uniqu url retriev randomli fetch distinct child link page initi set fraction page length word figur distribut content length web page percent url match length figur distribut url match length similar top repres host repres url figur show frequent toplevel domain close half url url net approxim url repres home page url path compon initi dataset approxim link distribut shown figur respect content sampl distribut sourc target page present distribut initi dataset shown figur half web page word pair page link domain match time pair percentag random pair domain match time measur number segment match url score mean host port strict domain match point addit path segment match directori match addit distribut segment match length connect page shown figur figur show similar descriptor descript meta tag descript show poorer perform titl term suggest author includ term present page longer text descript find descript higher overlap tfidf score term prob titl desc overlap figur similar score compar text page comparison score graph length descript suggest page page characterist figur present similar score current page link random sibl subset link page metric demonstr random page text link page text common link page sibl page similar link page domain figur plot sibl page similar score function distanc refer url parent page distanc count number link link separ link distanc find closer url share term strikingli found present metric corrobor observ link page similar topic cluster parent page tfidf score term prob random sibl dom link diff dom overlap figur textual similar link random sibl link page link page domain comparison score graph anchor page characterist anchor length shown figur slightli lower averag report amitai titl length term shown figur text anchor term term term figur show anchor text score higher page metric similar anchor text page sibl target page score order magnitud random conflict highest score perform anchor text link page domain sourc case term probabl tfidf score anchor text vari amount surround text constant improv text small term probabl show declin addit word appar addit text provid lower likelihood present target page addit term addit word side chanc target page compar tfidf score term prob overlap num sampl distanc figur plot similar score sibl page function distanc refer url parent page term high neg correl chanc anchor text unlik overlap score figur show improv addit word potenti result compat report chakrabarti al found includ fifti byte text anchor catch refer term larg dataset link yahoo home page interpret addit text chanc import catch unimport lower term probabl score cancel result text surround anchor link text made term fraction anchor anchor length figur distribut number term anchor fraction page titl length figur distribut number term titl text web text web amitai examin linguist choic web author comparison document detail find similar characterist web page bigram popular raw typic bigram text reflect commerci web tabl list frequent bigram paper empir evid topic local page mirror spatial local web www page typic link page similar textual content found page significantli relat topic page page select nearbi page found evid topic local sibl page similar link parent closer found anchor text similar page sibl similar random score statist larg order magnitud suggest anchor tfidf score term prob random sibl dom link diff dom overlap figur perform anchor text link link text link text text sibl text random page comparison score graph mail click http www york home page web site contact web site web page updat world wide site inform unit state reserv page check copyright wide web tabl common bigram found remov bigram form verb text discrimin unseen child page note anchor text term found target page close titl term target titl overlap tfidf cosin similar score point averag text anchor improv similar measur shown anchor text high term probabl high tfidf impli page proxi repres part target page pitkow pirolli observ emploi provid semant linkag manner citat link tfidf score anchor text anchor text anchor text term prob overlap addit word figur perform vari amount anchor text link text document relat demonstr semant approxim textual measur present provid underpin web includ search linkag intellig web agent part futur plan extend analysi includ textual similar page type link model determin intern extern site link match host domain acknowledg due haym paul kantor discuss comment earlier draft member group work support part darpa order number onr contract refer robert dayn thorsten tom mitchel learn world wide web aaai spring symposium inform gather heterogen stanford march aaai press amitai hypertext import master edinburgh technic report amitai common hypertext link identifi phrasal descript target web document workshop hypertext inform retriev amitai anchor corpu analysi web page author convent lynn simon word web comput mediat commun intellect octob krishna bharat andrei broder techniqu measur rel size overlap public web search engin seventh intern world wide web april justin dayn thorsten joachim machin learn architectur optim web search engin aaai workshop inform august krishna bharat monika improv algorithm topic distil hyperlink environ intern acm sigir confer research develop inform page august sergei brin lawrenc page anatomi hypertextu web search engin seventh intern world wide web april marko balabanov yoav shoham collabor recommend commun march israel michael dan vladimir ur ad support dynam search eighth intern world wide web soumen byron david jon ravi prabhakar sridhar andrew tomkin mine web link structur ieee page august soumen byron piotr indyk enhanc hypertext categor hyperlink acm soumen byron prabhakar sridhar david jon kleinberg automat resourc compil analyz hyperlink structur text seventh intern world wide web april junghoo hector lawrenc page crawl url order seventh intern world wide web april soumen martin van den byron dom approach web resourc discoveri eighth intern world wide web brian davison adapt web prefetch workshop adapt system user model page posit paper publish comput scienc report dept mathemat comput eindhoven technolog brian davison topic local web annual intern confer research develop inform retriev juli brian wei wu appli link analysi web search poster eighth intern world wide web page daniel adel experi select search engin metasearch acm transact inform juli dean monika find relat page world wide web eighth intern world wide web page david jon prabhakar raghavan infer web commun link topolog acm confer hypertext hypermedia expand version adel daniel metasearch engin learn search engin queri ai monika allan michael marc najork url sampl ninth intern world wide web thorsten dayn tom mitchel tour guid world wide web fifteenth intern joint confer artifici page morgan august build mainten robot base internet search review current index data collect method prepar work packag eu telemat project septemb jon kleinberg authorit sourc hyperlink environ symposium discret algorithm page san januari expand version brian internet fish phd mit depart electr engin comput ai technic report mit artifici intellig laboratori brian internet fish construct kit sixth intern world wide web santa april steve lawrenc lee gile context page analysi improv web search ieee internet steve lawrenc lee gile neci meta search engin seventh intern world wide web april steve lawrenc lee gile access inform web henri lieberman agent assist web intern joint confer artifici intellig page august henri lieberman autonom interfac agent acm confer human factor comput march filippo menczer richard belew adapt retriev intern local context scale web machin longer version technic report san diego oliv mcbryan tool tame web intern world wide web filippo menczer adapt retriev agent heurist neighborhood inform discoveri intern confer machin learn mladen person implement design technic report depart intellig stefan univ octob martin porter algorithm strip karen sparck jone peter read inform retriev morgan san origin publish jame pitkow peter pirolli law electron frontier acm confer human factor comput march jason renni andrew mccallum web spider reinforc learn sixteenth intern confer machin learn erik selberg oren etzioni search comparison metacrawl fourth intern world wide web decemb erik selberg oren etzioni metacrawl architectur resourc aggreg web ieee tom spring search engin microsoft pc novemb onlin danni sullivan dr search engin novemb danni sullivan search engin featur search engin januari oren zamir oren etzioni web document feasibl demonstr confer research develop inform oren zamir oren etzioni dynam cluster interfac web search result eighth intern world wide web appendix section present result stop word elimin porter term stem figur match ident figur figur scale url match length stop word elimin url match length term stem figur distribut url match length similar titl desc stop word elimin titl desc term stem figur similar score compar text page random sibl dom link diff dom stop word elimin random sibl dom link diff dom term stem figur textual similar link random sibl link page link page domain distanc stop word elimin distanc term stem figur plot similar score sibl page function distanc refer url parent page term random sibl dom link diff dom stop word elimin random sibl dom link diff dom term stem figur perform anchor text link link text link text text sibl text random page
DB/126 3 nearest neighbor queri mobil environ georg kollio gunopulo vassili tsotra polytechn dept comput inform scienc center ny usa riversid depart comput scienc engin ca usa abstract nearest neighbor queri receiv interest recent year due import advanc applic past work address queri static set paper dynam set data object move continu mobil spatiotempor environ motiv real life applic traffic intellig navig cellular commun system version nearest neighbor queri depend tempor predic singl time instant interv closest object object minut object closest object minut data object move continu ineffici updat posit time instant approach emploi method store motion function object answer nearest neighbor queri effici search method introduct spatiotempor system manag data geometri time applic creat includ global chang climat land cover transport surveil intellig transport social multimedia applic gener spatial attribut spatiotempor object time posit object locat insid refer extent area volum object occupi refer depend spatial attribut chang time exampl airplan fly car travel land cover forest object concurr move size anim movi paper concentr applic object chang posit time extent remain unchang repres object point move refer space usual assumpt tradit manag system data store remain constant explicitli chang updat price field remain explicitli updat model data discret ineffici applic continu chang data posit mobil object primari goal correctli repres realiti object move object move continu updat object posit unit time ineffici solut due prohibit larg updat overhead updat repres time instant limit queri accuraci approach abstract object posit function time updat paramet chang speed direct car comput posit mobil object time futur current knowledg motion characterist store motion function minim updat introduc problem directli store data valu function comput valu motion recent attract interest commun gi system support track queri mobil object research present model languag queri locat object present access method index mobil focu spatiotempor rang queri object move dimens object insid queri region minut paper concentr answer nearest neighbor queri futur locat mobil object spatiotempor queri object closest object minut object move motion inform queri find object object closest posit minut posit minut note answer queri tent comput base current knowledg store mobil object futur motion function knowledg queri produc answer examin nearest neighbor queri time interv predic futur object closest object minut answer queri reduc combin rang queri simpl nearest neighbor queri interest provid indic specif design neighbor limit neighbor queri address tradit select base indic modifi search algorithm neighbor queri answer follow approach util index techniqu adapt neighbor search number mobil object applic mobil larg interest extern memori solut gener object move space complex limit treatment object move space locat linear function time strong motiv approach base applic straight line faster point car move network highwai approxim connect straight line segment true rout airplan ship solv simpler problem provid intuit address difficult nearest neighbor queri object move space problem descript track mobil object move finit line segment model object point move constant veloc start specif locat specif time instant inform comput locat object time futur long movement characterist remain object start locat time veloc posit locat time object updat motion time speed direct object reach line segment issu updat updat delet object remov reflect possibl speed insert object delet exist line system dynam examin nearest neighbor queri tupl object closer point time instant section describ geometr primal plane object trajectori repres long line dual plane trajectori dual plane transform examin present effici algorithm answer neighbor queri primal dual plane section perform studi section section examin nearest neighbor queri time interv predic object closer point time interv discuss result extend appli limit object restrict move collect line segment road highwai call case discuss section relat work section section summar find present problem futur research geometr partit mobil object object low speed object speed minimum min maximum speed max object speed greater min case static static object solv tradit approach dont discuss issu problem index mobil object order effici answer nearest neighbor queri locat futur locat object linear function locat object time equal veloc object locat assum object move object updat motion inform treat updat delet inform insert describ geometr problem plot trajectori mobil object line plane equat line slope veloc comput motion inform fact trajectori line start point queri present assum trajectori line affect correct answer figur show number trajectori plane queri express point space answer object correspond line closer point time distanc trajectori queri point line figur answer nearest neighbor queri object dual dualiti transform frequent comput geometri gener map point dualiti transform formul problem intuit manner max fig trajectori queri plane case map line primal plane point dual plane figur line point transform point line uniqu dualiti class transform similar properti transform conveni fig dualiti transform line point dual plane axi repres slope object trajectori axi line equat repres point dual space call transform valu max valu intercept depend current time current time rang max queri transform line dual space line dual queri point show defin point line intersect similarli point line intersect lemma nearest neighbor queri point object dual point closest line dual queri point proof assum queri point object trajectori distanc object queri point time jv comput line dual plane distanc comput line euclidean distanc object queri line dual space easi show slope queri line ut euclidean distanc comput nearest neighbor dual true primal space min max fig data object queri dual plane note dual problem valu intercept unbound simpl solut problem present solv problem assumpt object cross border issu updat delet combin assumpt minim assur object updat motion inform period time period distinct index structur index store object issu updat period period index store object issu updat interv period period object store index time period object store index object issu updat period delet index insert index intercept index comput line index line period intercept valu period queri indic time period index empti object store object issu updat period period time remov empti index initi time period period period continu period time instant initi index remov empti method intercept bound perform index structur remain asymptot structur repres line vt write equat map line point dual plane coordin algorithm answer nearest neighbor queri obviou approach check object return closest queri point method ineffici number mobil object larg discuss method avoid linear scan data set index structur present indic method indic nearest neighbor search tradit method spatial access method index line line segment method includ base indic algorithm samet roussopoulo al find line closer queri point algorithm work hierarch index structur partit note shown algorithm optim algorithm nearest neighbor access smallest number page answer nearest neighbor underli index structur main idea algorithm hierarch structur fashion visit partit list order distanc queri point visit sort order prune minimum distanc partit queri point larger distanc found object global prioriti queue object found sort order obviou algorithm process algorithm work type object differ comput distanc object queri point dont euclidean distanc distanc line main problem approach effici index structur index line larg line segment case hierarch method overlap overlap result poor queri perform method partit data space cell high space consumpt case method dual larg number access method index point structur design address orthogon rang queri express answer nearest neighbor queri approach answer nearest neighbor queri dual space index structur base store dual point experi hb algorithm similar algorithm present find answer differ comput distanc region data point line repres queri dual space point dual min max fig queri dual plane approach base queri approxim method present dual plane queri line plane assum coordin comput gener horizont line equat line data structur index dual point coordin queri line map rang figur rang structur answer nearest neighbor queri note size rang queri proport jy size rang index structur equidist figur correct answer limit replic perform max fig indic store move object indic inform index store coordin data point index closer queri point smaller rang expect queri time process nearest neighbor queri smaller figur describ algorithm answer nearest neighbor queri structur structur closest queri point find rang queri map find closest object queri point insid rang nearest neighbor start visit previou page updat nn stop check find nearest point current nn page previou page stop fig algorithm comput nearest neighbor mobil object perform studi present initi result nearest neighbor compar method tradit base approach describ data gener time gener initi locat mobil point uniformli distribut terrain vari speed gener uniformli min direct randomli posit neg point start move point reach border simpli note equal equal number move object line fig queri perform nearest neighbor queri direct time instant object randomli randomli chang speed direct gener time instant repres time queri execut time instant execut nearest neighbor chosen uniformli time instant run scenario access method time instant verifi index mobil object line segment store trajectori fix page size byte method page capac equal page capac simpl buffer scheme result present tree buffer path root leaf buffer size page queri clear buffer pool run queri updat perform motion inform object figur present result averag number nearest neighbor queri approxim method line segment method worst perform approxim method outperform hb figur plot space consumpt averag number updat report updat perform method high updat space perform hb method object store cluster updat perform hb approxim approach remain constant number mobil object space method linear number object approxim approach space number move object fig space consumpt due observ indic tradeoff perform nearest neighbor queri time interv predic interest nearest neighbor queri queri time interv time point time interv trajectori queri object creat line segment plane answer queri object closest queri object time queri line segment note problem import spatiotempor environ figur queri object time interv answer queri object point time object distanc queri object nearest object belong result method answer queri find line intersect queri line segment run nearest neighbor end line segment answer correct trajectori mobil object straight line show time object closer queri time instant trajectori mobil object common point queri interv primal plane modifi exist algorithm queri point find line closest line segment perform method bad case queri point dual plane method queri find line intersect queri line segment rang queri answer queri method answer number move object fig updat perform run nearest neighbor queri time instant closest object time max fig data object queri time interv predic case interest restrict version gener problem algorithm easili extend object move plane movement restrict collect line segment finit terrain due call case problem strong motiv applic object airplan move network specif rout problem reduc number problem repres predefin rout sequenc connect line segment posit line segment terrain index standard spatial access method number rout smaller number object move rout approxim small number straight maintain index straightforward rout ad index object move rout model techniqu previou section nearest neighbor queri identifi rout pass closest point spatial access method tradit nn techniqu find rout collect rout static rout pass closest queri point find nearest neighbor queri point object rout object nearest point orthogon project queri point rout line find orthogon project queri point solv problem find nearest neighbor project point rout distanc nearest neighbor closest rout queri point obtain upper distanc true nearest neighbor point queri point rout closer queri time find rout perform rang queri sam data structur rout return rout inf distanc queri point sort rout distanc queri point find nearest neighbor queri point updat global nearest point closer point found termin process distanc rout consid larger nearest point found relat work lot work nearest neighbor problem spatial domain work concentr static point object remain fix locat roussopoulo al give base algorithm find point closest queri point samet give algorithm base algorithm extend handl move trajectori point model straightforward modif work result show previou approach point store extern memori recent work nearest neighbor problem main memori algorithm set exact nearest neighbor problem approxim nearest neighbor problem consid algorithm queri time exponenti requir linear space addit approach easili modifi find closest point line note comput geometri work arrang relev set trajectori point plane defin partit plane convex region point time interior region find line closest find line form boundari convex region point examin shown time arrang line time main memori requir space summari futur work paper present effici extern memori data structur solv nearest neighbor problem set point move constant veloc queri answer point time instant find point closest time point time find point closest time interv extend result case plan work nearest neighbor problem point move space main problem dimens trajectori point line dualiti transform euclidean solv problem separ combin result point closer queri point nearest larger euclidean distanc area futur work give algorithm join find point nearest neighbor queri time acknowledg introduc problem index move point wolfson dagstuhl seminar tempor author faloutso subrahmanian discuss code refer agarw arrang applic handbook comput north amsterdam gi track analyst silverman wu optim algorithm approxim nearest neighbor search journal seeger effici robust access method point rectangl proc acmsigmod intern confer manag page atlant kriegel cost model nearest neighbor search data space proc pp chomicki revesz geometr framework spatiotempor object proc intern workshop time ubiquit comput june rh schneider data approach model queri move object proc acm gi symposium salzberg hb modifi support recoveri node consolid proc intern confer larg data septemb page gunther access method acm comput guttman dynam index structur spatial search proc intern confer manag page june samet rank spatial proc int symp spatial pp indyk motwani approxim nearest remov pp jagadish index line segment proc intern confer larg data page august kleinberg algorithm search high dimens proc pp gunopulo vj tsotra index mobil object proc vincent nearest neighbor queri proc int conf manag page june samet design analysi spatial data roussopoulo faloutso dynam index object proc intern confer larg data page septemb dao model queri move object proc ieee intern confer data page april cost model posit move object proc ieee intern confer data page februari jiang move object issu solut intern confer scientif statist manag juli
DB/127 3 extens activ knowledg base system multipl rule type support nick ioanni ahm elmagarmid work partial support eu project support scholarship greek foundat state scholarship work carri author sabbat leav purdu partial support grant intel corpor dept informat aristotl greec dept comput scienc purdu usa abstract paper describ extens activ knowledg base system support process deduct rule activ oodb system infrastructur smooth integr declar rule product deduct activ oodb system support rule map declar rule offer central rule select control correct behavior conflict complex event map condit declar rule monitor increment match condit infrastructur easili extend system ad rule type subtyp exist transpar optim rule match network result system kb user abil express knowledg varieti form advanc problem solv data intens applic knowledg base product deduct deriv activ introduct knowledg base system emerg integr system technolog satisfi demand applic advanc data featur requir complex applic suitabl satisfi design user tool semant richer provid relat main area research rule integr activ deduct activ rule trigger situat deduct rule declar describ data term exact descript data treat activ rule form rule product rule declar rule describ fire situat exact definit situat detect call product deduct rule collect declar due declar natur condit rule procedur explicitli defin activ rule type activ rule implement time constrain applic extens rule monitor state enforc integr deduct rule defin maintain materi view system relat system support rule oodb system present extens call rule integr complex integr product deduct rule activ oodb gener support rule integr base compil condit declar rule type discrimin network consist simpl complex event record combin modif possibl make rule fire paper present architectur system relationship give special emphasi extens system larg extens previou system devic expert system shell support product rule support rule deduct rule deriv aggreg attribut modular extens rule type ad seamlessli achiev abstract semant product rule truth mainten techniqu provid extens rule type hierarchi extens system due infrastructur metaclass partial redefinit rule manag transpar extens improv rule match execut phase paper describ rule manag integr materi deduct deriv aggreg transpar optim storag retriev partial match inform event network rule execut structur paper section refer relat work rule integr activ section present system section present declar rule section describ rule integr section describ extens optim featur section discuss system present result deduct section conclud paper summari main point discuss futur work relat work activ oodb system support eca rule eca rule type easi implement oodb event conform paradigm oo comput recogniz potenti event execut normal method execut activ oodb system support product deduct rule addit eca support rule type od support eca rule product rule primit trigger explicitli evok member function relev constraint ineffici check time object access notion increment condit check chimera prototyp extens oodb support deduct rule product translat rule set eca rule techniqu ceri widom approach simpler delai propag effect object delet due deriv object perform comparison approach show case bulk data load faster approach join object refer relat support multipl rule type ariel support product rule effici match special discrimin network built scratch eca rule emul product rule special differenti file delta record data modif lack event relat environ architectur line system support deduct rule treat special product rule section approach deduct rule extend product rule emul updat rule bodi execut bodi condit satisfi rule semant datalog rule interest properti rule fulli declar semant updat defer execut end queri process introduc inconsist redund declar specif updat static rule analysi detect rule termin confluenc optim rule execut follow integr path core system activ oodb support event eca rule integr base increment match condit declar rule discrimin network built primit activ oodb implement scratch ariel requir introduct data structur blend oo model rule match requir pass updat oodb discrimin function pass back select rule instanti inform part function access data bypass oo interfac violat encapsul messag pass facil oodb make longer primit extens activ oodb system advantag oo extens rule persist discrimin network form event grace coexist eca flexibl experi optim separ part discrimin network dip relat system primit system perform rule condit match dip support tradit eca rule relat postgr starburst origin support eca rule postgr support backward chain deduct rule data retriev event trigger eca rule retriev deriv data starburst extend forward chain deduct rule multipl activ rule translat method similar advantag section perform test section show faster increment insert delet faster bulk insert rule execut algorithm mainten deriv object base count algorithm count algorithm rule algorithm similar count algorithm conjunct mechan activ treat rule event deriv process deriv object infinit deriv work paper extend significantli previou work gener semant product rule declar rule truth mainten techniqu creat gener framework rule type ad seamlessli deduct rule rule deriv aggreg attribut extens rule type hierarchi rule type organ properli manag compar park formal semant defin activ declar rule bit deduct rule rule deriv aggreg attribut park activ rule part consist singl action park semant defin inflationari deriv object maintain deriv relat product rule park consist singl action product rule includ action call arbitrari prolog analysi rule perform park fixpoint algorithm appli easili conflict resolut strategi rule type orthogon rule semant park differ base conflict resolut strategi rule park semant block execut conflict rule architectur implement top prolog extens activ oodb exact extens adam oodb architectur system shown figur compon extend basic activ oodb distinct layer top exact adam system consequ oodb extens metaclass make devic extens model terminolog paper base adam oodb figur show architectur oper user interact system issu adam prolog goal extend messag pass declar rule insert user optim compil eca rule rule trigger event monitor updat possibl make rule fire event manag propag discrimin network inform rule manag rule execut execut rule updat trigger compon includ textual descript rule appli seri transform tree order produc effici easi compil tree compil compil tree network complex event activ rule techniqu section compon oodb metaclass introduc order implement structur behavior rule section rule instanc rule manag eca rule manag gener rule manag part exact system rule manag implement function subclass eca rule manag mean inherit part function gener rule manag order captur semant product deduct rule type event introduc subtyp gener exact event build compon complex event discrimin network match declar rule condit event manag track simpl event occur combin increment match rule condit develop alter origin code exact order make portabl extens activ oodb system featur difficult implement alter structur behavior exact object optim goal provid smoother integr exact declar rule languag section describ system declar rule languag paradigm influenc oodb context type declar rule support express defin pattern object detect action product deduct languag defin eca rule figur architectur system rule condit rule condit defin mike salari exce manag delet condit rule pattern consist conjunct pattern pattern consist attribut pattern pattern denot instanc class emp attribut equal salari manag pattern describ manag salari attribut salari variabl front class denot instanc class insid attribut pattern denot relat directli constant indirectli variabl variabl deliv valu comparison pattern condit action part rule valu object refer normal string notic condit written attribut pattern navig object refer complex complex attribut innermost attribut attribut class emp move left attribut belong class relat attribut class predecessor attribut rule complex attribut express transform simpl attribut express introduc pattern pattern transform condit notic adopt order contrari dot notat commonli stress function data model origin adam oodb interpret chain attribut function composit neg condit neg condit satisfi object satisfi posit condit rule condit identifi salari highest notic safe rule variabl action insid condit variabl insid negat condit insid condit symbol mark end choic condit languag justifi fact condit declar specif state procedur interfac oodb condit languag arbitrari prolog adam goal express small static condit comput valu condit special construct appendix includ full syntax languag action product rule action part product rule defin set updat perform object identifi rule condit updat express extend prolog languag includ default procedur data manipul languag adam syntax adam messag found exampl product rule action previou section mike delet salari higher manag salari mike salari lower higher salari deduct rule deduct rule action deriv class templat defin object deriv condit true deduct rule defin object attribut end instanc class path object class arc attribut class path deriv class instanc deriv deduct rule deriv class templat part deduct rule exist rule deriv class head final set deriv object union object deriv rule defin deriv class transit closur arc relat complet rule object deriv class materi depend type deduct rule oid deriv object head deduct rule rule deriv class templat consist pair variabl condit constant syntax appendix declar rule integr main idea integr declar rule eca base activ oodb declar rule condit eca rule event condit action exist wai translat emb rule activ system primit declar rule compil eca rule order constantli monitor activ condit rule compil complex event eca eca rule depend type declar rule rule translat method rule translat method complex event translat declar rule eca rule product rule translat eca ea eb ec primit event detect insert data item oper denot conjunct event complex event manag increment detect occurr complex event monitor primit event combin paramet detect complex event match rule condit event manag forward paramet rule manag execut notic primit event occurr detect paramet match paramet detect event occurr occur order achiev paramet event occurr complex event network end transact delet explicit delet issu condit part eca rule true condit test incorpor complex event small static condit check condit part eca rule construct altern rule integr scheme deduct product rule rule translat eca trigger deriv singl condit element condit rule condit eca rule condit minu event rule translat eca ea ec case deduct monitor delet object requir consist event da db dc monitor delet data eca rule approach requir rule check delet deriv object due altern deriv delet prevent incorpor check rule requir check mechan account multipli deriv object analyz disadvantag rule translat approach mainten delet temporarili disabl product perform oper relat eca rule requir special care user forget eca rule base inconsist approach avoid problem creat rule maintain easili event simpl complex delet disabl rule automat system redund condit check sequenc event occurr empti ec assum event occur transact eca rule coupl mode eca rule consid trigger execut condit satisfi final condit action execut behavior correct product rule fire insert eca rule condit element check successfulli condit element check time check succe redund lead poorer shown section redund action execut event occurr assumpt eca rule defer ec coupl mode mean end eca rule trigger execut data item insert time rule condit consid rule execut action creat problem incorrect net effect problem ec coupl mode absenc net effect event event trigger rule rule select rule activ effect trigger event problem exist rule ec underli activ system support net rule immedi activ wait end transact mode simpli compat state descript natur product rule condit overcom absenc net case ec defer ca coupl condit insid action eca rule order assur event condit trigger rule event signal true end transact rule scheme ea case defer ec ca check includ ea solut incur overhead perform rule execut duplic check check condit approach avoid problem net event effect discuss section product rule semant product rule manag receiv detect complex event occurr event manag select event activ product rule call event manag detect complex event longer valid case neg rule instanti posit rule instanti remov conflict exist multipl rule instanti conflict ambigu number order rule execut approach appli heurist strategi select uniqu rule instanti execut activ system approach prioriti resolv rule execut order incorpor conflict resolut heurist prioriti mechan activ oodb system applic heurist control class variabl rule manag set notat notat prolog usual program construct mean conflict set prolog list store class attribut product rule manag criteria remov instanti token rule execut conflict list rule prevent rule execut ad year nl recenc criteria insert newli deriv rule instanti begin conflict order consid older rule select execut mike salari assum select execut john creat instanti rule select instanti concern john execut recent mike salari emp specif criteria select conflict set instanti token rule condit specif specif rule determin number event object involv condit match calcul count total number gener event condit previou rule specif condit check specif rule select prefer reflect complex event network network rule logic event object network rule section notic specif rule base number gener event syntact complex deep path express condit produc high specif score simpl rule declar rule involv rule involv instanc specif delet delet rule analyz phase complex rule gener complex event object delet rule manag select rule instanti condit part rule check trivial true condit rule construct present rule definit condit evalu rule fire condit action part rule schedul execut action execut compound prolog goal coupl mode rule select execut initi end transact intermedi checkpoint rule instanti select rule manag checkpoint order continu product cycl previou rule instanti produc execut rule action cycl continu fixpoint rule instanti left conflict set rule action produc rule instanti evok explicit object delet propag conflict set fixpoint control transact back user net effect event ec coupl mode event transact contradictori posit rule instanti placement conflict rule instanti elimin conflict set rule select execut sequenc begin end transact rule execut event issu rule instanti question select similar net effect produc deduct rule semant integr deduct rule achiev map deduct rule semant product rule describ materi approach deriv object store futur approach deriv object store comput normal object demand type rule deriv deriv aggreg present semant deduct condit object head exist declar state condit deriv object insert pair deduct rule defin transit closur network path relat node graph arc object creat rule execut path object creat procedur deduct rule emul product simpl product rule translat scheme extend fulli captur semant deduct rule creation deriv object object distinct object attribut valu exist consequ gener differ oodb deduct arc exist path directli deriv rule indirectli deriv rule rest arc path time path deriv object creat condit deduct rule deriv object head remov ensur deriv object deduc rule instanti arc remov path remov deduc rest path arc order maintain deriv class counter mechan store number deriv object deriv object counter equal counter previou path object counter equal deriv distinct wai arc delet rule counter notic count algorithm deduct rule rule case base class rule condit data cycl instanc deriv object infinit deriv deriv process termin arc present path infinit count algorithm termin termin case infinit deriv object deriv counter insert simpli object process termin event forward discrimin network notic termin problem discuss termin problem function rule languag languag function section discuss path express function composit express condit rule analyz function free express oper semant deduct rule model product condit presenc multipl product rule yield system ineffici manag incur unnecessari product cycl order model delet deriv product rule extend part host deriv object delet algorithm extend deduct rule model singl product rule posit action map action part product neg action map condit rule manag extend order execut rule part receipt neg token event manag semant deduct rule implement deduct rule manag subclass product rule manag inherit part common behavior overrid structur behavior featur section conclud treatment deduct rule simpl product rule deduct rule emploi truth mainten mechan maintain integr deriv class base object product rule recov action condit longer satisfi behavior achiev gener semant product rule part deriv class head deduct rule deduct rule creat deriv class head refer creat structur class deriv templat head extend counter deriv class retriev oper instanc explicit delet modif deriv object violat integr special method retriev instanc deriv class attribut valu prolog provid conflict resolut strategi deduct rule differ product rule recenc strategi set rule instanti append conflict set rule search space navig iter strategi model evalu deduct rule specif criterion overridden control strategi consid stratif rule negat pair rule deriv class depend neg deriv class order evalu correctli class object class deriv call stratifi program hold class depend class program assum class base class deduct rule deriv class condit collect stratum number order algorithm check exist constitut stratifi logic program modifi strata stratum number defin partial order rule resolv rule select deduct rule deriv data perman store comput queri deduct rule special case materi compil activ primit event detect propag discrimin network queri deriv class activ signal execut rule gather deriv class depend graph contribut deriv deriv class question activ rule primit event detect retrospect propag discrimin network select rule execut default mechan deriv rule temporarili materi deriv object queri activ rule rule delet deriv object optim magic set introduc limit number deriv object answer queri magic set rewrit deduct rule addit auxiliari approach implement magic set rewrit compil rule run queri overhead compil larg comput altern solut precompil transform rule set altern goal adorn deriv attribut support deriv attribut calcul attribut describ materi valu deriv attribut store calcul main concern materi approach valu maintain valu attribut depend chang deriv attribut rule declar definit deriv attribut impli attribut salari deriv attribut calcul store attribut delet deriv attribut delet notic updat base attribut emul delet insert semant deriv attribut rule tackl attribut updat semant describ deriv attribut rule emul product deduct rule present earlier section deriv attribut rule manag subclass deduct rule order inherit behavior section rule manag share conflict set deduct rule execut stratif deriv attribut rule product rule prefer order execut compil process deriv attribut rule simpler deduct rule compil procedur obviou mainten deriv deriv attribut rule insert attribut class emp rule creation deriv attribut declar class insert adam oodb support dynam schema aggreg attribut present aggreg deriv attribut implement base syntax deriv attribut previou section rule store deriv attribut class dept total salari depart order correctli maintain aggreg semant creat salari insert depart salari ad aggreg attribut delet salari delet depart salari subtract aggreg attribut updat salari depart emul delet insert semant aggreg attribut rule emul deriv attribut rule translat aggreg attribut rule figur simplifi actual translat shown notic action updat aggreg check time rule run impli assumpt sum aggreg function initi gener descript semant aggreg attribut rule structur translat rule complic order cater aggreg function prefer extens mechan aggreg easi add extens provid class call instanc hold inform aggreg function support system includ initi method calcul possibl method calcul answer queri aggreg attribut transform rule access attribut method instanc class order provid gener translat rule kind aggreg prev prev figur translat rule sum aggreg function class slot method tabl class function tabl show sum aggreg function repres instanc class choic object repres aggreg function justifi fact data model data definit languag object orient function built directli data definit languag basic prolog extend messag pass extens approach applic programm add aggreg function provid function data definit wrap function object semant method obviou demonstr recal averag aggreg function comput sum count attribut averag store aggreg attribut averag tupl sum count averag calcul demand object aggreg attribut queri method calcul averag sum count aggreg valu sum aggreg function method return store advanc object sum current current tabl aggreg function sum object avg avg avg tabl aggreg function avg algebra aggreg function pretti data wareh olap incorpor aggreg max maintain increment delet method complic ineffici tabl method find maximum attribut class delet match current maximum notic input argument list method longer method order pass inform class attribut aggreg extra argument aggreg function max min rest function simpli tabl code method maintain aggreg attribut manual suppli maintain clear method insert gener procedur translat aggreg attribut rule present assum rule object max smallest domain attribut tabl aggreg function max figur gener form translat aggreg attribut rule aggreg attribut class aggreg object class hold aggreg attribut attribut attrib class class aggreg translat rule shown figur notabl featur condit extend pattern retriev oid aggreg function order access initi increment mainten method initi execut due neg rule instanti rule posit execut past concret translat aggreg attribut rule shown figur aggreg attribut rule manag subclass deriv attribut rule manag inherit runtim behavior rule manag share conflict set compil process aggreg attribut rule overrid deriv attribut rule complex condit compil match effici match product rule achiev discrimin rete treat smoothli integr discrimin network activ oodb system set class object map node network complex event object activ system section overview structur behavior network compil process produc detail compil aspect network node found structur behavior complex event network section describ structur behavior complex event network increment match rule condit deduct rule complex event network rule shown figur primit event devic network multipl input sourc primit event detect activ system attribut pattern insid pattern condit map primit event monitor insert valu attribut figur primit class arc type counterpart fact devic network multipl input sourc make suitabl environ updat asynchron input sourc captur updat singl object attribut relat creation object monitor event class pattern method iter attribut newli creat object insert default type method monitor primit type event suffic flexibl captur simpl attribut updat similar argument hold delet object type event optim compil specif extens oodb system requir monitor object creation event signal type primit event denot state reach insert data occurr type event denot pattern rule condit present longer valid model introduc notic type event emul type event signal type event primit event signal event manag forward posit token messag paramet successor network node check method method intern process input token check complex event signal current input signal local histori event activ method construct output token forward event network logic event perform simpl attribut condit satisfi logic event map attribut comparison signal primit event path path path primit event logic event event event activ rule complex event true action schedul schedul action signal arc arc arc arc path token condit pattern figur sampl complex event network perform check paramet check output token propag successor event event network figur logic event attribut test constant event pattern consist attribut pattern translat event call join paramet input event base oid messag recipi object figur event pattern condit rule pattern consist attribut event join attribut pattern join remain attribut pattern event attribut pattern cater multipl pattern map multipl event join pair base share variabl pattern rule condit event call event figur event join event variabl event network map rule directli attach eca rule map origin rule event receiv token input behavior symmetr posit incom token perman store input memori join token opposit memori join produc posit output token pattern propag event network figur assum exist arc start node creation path due rule path object correspond token resid left memori start node store token condit pattern test forward logic event origin arc object store token memori arc object insert signal store join token left memori join succe token signal output event token describ persist insid event memori end transact explicitli delet reflect delet delet token trigger propag network event receiv neg token delet memori neg token output event output token element delet token join token memori delet optim valid token flow event uniqu oid object involv condit ambigu match incomplet token incomplet token arriv input match store full token memori output token inform input variabl rule assum token resid event memori neg token propag input event class arc match store token delet memori incomplet neg token propag event match store variabl instanti token delet memori incomplet token output incomplet token propag deduct rule manag delet partial instanti deriv object partial instanti interpret path end node path delet show event entitl delet optim network action rule oid variabl propag condit action execut join control presenc rule object output event event output join perform delet optim incomplet token output negat neg pattern denot condit met order rule condit true neg pattern treat posit map chain event correspond posit pattern connect node event correspond neg pattern behav slightli manner usual event event input node map neg condit element call neg event arc path object extend length deduct rule extend exist path shortest arc neg condit pattern normal event correspond posit pattern creat event connect pattern posit neg input stem neg condit pattern posit neg event differ behavior detect event neg input event occur differ posit neg event symmetr algorithm input sourc neg behav differ depend input input input contribut valu output token event negat construct stand test reason neg event join event token propag phase ensur order pattern rule condit neg pattern join posit complex event network construct input neg event input input neg event receiv posit token input input token match token store posit token output token store memori neg event token arriv posit match previou token posit token output pattern neg event posit pattern posit event neg pattern posit event neg input posit input figur neg event token arriv posit match token output token propag input receiv posit token match token store neg token output neg token correspond past posit check left optim reason neg token receiv success event match exist input token store left memori neg event posit token arriv neg input match previou token output token propag posit token arriv neg match token neg token output neg event receiv neg token behavior behavior posit event neg token arriv behavior pretti complic input token match token candid output token match memori case singl token match token opposit memori candid output token match token memori final forward posit output token token store left memori neg token store memori neg token arriv neg match token left candid posit output token thessaloniki closest big citi path athen shorter distanc thessaloniki candid token left memori token found propag output match token memori candid token token output compil process compil process consist phase rule complex attribut refer transform simpl attribut multipl pattern tree optim main compil phase consist stage condit scan order identifi creat primit logic event monitor attribut pattern condit stage collect inform assist variabl condit action primit logic event join pair form base common variabl event construct eca rule creat link event discrimin network end rule rule activ phase propag activ messag rule primit event network queri object exist signal token upward network object insert empti network correctli initi inform data easili extend due oo architectur transpar modif exist system compon introduct rule manag exact devic gener flexibl partial modif compon support rule rule manag modif rule semant chang valu class attribut deduct rule rule deriv aggreg attribut exampl extens basic devic system rule type ad step rule manag ad subclass product rule manag rule manag inherit default product rule share common rule conflict conflict resolut rule action execut conflict resolut criteria control class variabl conflict set valu product deduct rule manag conflict resolut section rule type direct relationship conflict resolut share common conflict set share control attribut rule manag share attribut set rule manag independ conflict set activ individu rule schedul variabl set rule manag share conflict set superclass share attribut set exist rule manag shown figur rule manag persist product rule share conflict set volatil product rule deduct deduct rule maintain conflict set deriv aggreg attribut rule common conflict set step rule manag instanc metaclass product rule manag metaclass gener subclass metaclass product rule manag solut rule type rule creation semant rule object gener similar product rule solut rule type partial inherit rule gener semant product rule partial case deduct rule optim complex event network event network requir larg storag space memori duplic content case order avoid wast introduc optim basic discrimin network requir space extra perform cost virtual hybrid memori event note optim complex space overhead idea complex event increment autonom mechan detect multipl event occur space optim extra perform autonom complex event detect virtual memori virtual memori save storag space rule condit includ attribut pattern attribut test optim perform match storag manag larg event memori product rm persist product rm deduct rm aggreg attribut rm deriv attribut rm deduct rm manag figur share conflict set rule manag requir extra time smaller size join relat select node direct test attribut gain store signal token event memori valu attribut end directli retriev origin arc object requir perform penalti principl appli larger pattern pattern consist attribut pattern direct attribut test gain signal token store memori successor event valu attribut directli retriev object requir variabl store save storag space memori virtual memori event successor event hybrid memori hybrid memori mix store virtual variabl valu input token event hybrid memori store absolut inform retriev rest token valu origin object rule condit involv relat instanc class arc differ select criteria event eman output mean arc satisfi pattern arc instanc uniqu identifi store input memori subsequ event rest variabl insid pattern easili retriev access origin object concept illustr figur show token flow event event token store memori addit oid variabl store join variabl event store input order process join extra storag space memori rest variabl flow event store directli access messag object variabl store virtual depend oid variabl store variabl store variabl match incom token success virtual variabl retriev match extra complic token retriev match extra overhead token match step direct object access requir messag attribut gain storag requir variabl store memori space rule execut scheme rule execut cycl consid mean product cycl rule instanti consid optim scheme gather instanti rule execut singl step reduct number product cycl rule execut time demonstr perform section note semant rule execut conflict resolut slightli chang due natur rule execut case rule wait conflict set long time promot execut due singl updat system perform measur perform deduct rule execut compar approach definit path deriv class similar comput deriv path path reachabl initi node node graph arc road connect citi greec initi node capit map citi road connect event event join join figur hybrid memori event eca rule event maintain deriv class approach manual gener test result shown tabl tabl column mark repres materi approach keyword set rule execut column mark repres approach number user cpu time measur sun ultra solari notic tabl show deriv cost messag send object creation cost adam subtract tabl show perform bulk singl insert set orient approach favor bulk insert similar action execut singl product cycl tabl show product cycl test explain approach significantli faster approach slower materi match phase separ object creation piec code redundantli approach slower approach redund condit check match phase section singl insert test show differ set orient approach action cycl execut evid materi approach significantli faster approach increment match materi approach disadvantag storag space occupi discrimin network deriv approach empti space queri execut approach faster approach nice redund condit check join comput larger set instanc approach explain approach instanc test present rule condit tabl show perform delet singl arc delet path path length arc approach faster delet path length exist execut singl product cycl approach significantli slower order propag delet arc path shouldnt delet delet shown tabl product cycl approach shown approach avoid unnecessari delet cost notic advantag delet time delet size search path object restrain begin thessaloniki rapidli due complex road network delet rest delet test show significantli faster reason previou test delet path length slower delet arc affect connect graph futur work paper present architectur extens activ knowledg base call infrastructur integr multipl declar rule system singl activ oodb larg extens older call base translat product rule bulk insert singl insert tabl perform comparison approach insert delet path length length length length tabl perform comparison approach delet bulk insert delet path length length length length tabl product cycl test eca rule trigger network complex event seamless integr declar rule type ad rule manag compil scheme achiev gener function product rule paper integr deduct rule materi rule deriv aggreg attribut fulli implement exact activ oodb perform deduct rule approach measur faster approach increment insert delet rule execut bulk insert plan add rule type integr constraint explor possibl translat function constraint call product rule provid constraint repair action defer coupl devic product rule framework allevi strict temporari integr violat inher integr check techniqu current work includ incorpor declar rule facil parallel oodb practic order provid fast flexibl parallel activ kb work parallel activ rule examin issu rule execut control distribut conflict resolut explor integr modul integr provid system function data wareh provid applic level support integr atom commit offer declar languag defin complex view sourc data effici mechan materi view appendix syntax rule prolog count sum avg max min exist oodb class deriv class exist oodb deriv class oodb class exist attribut oodb class deriv class arbitrari goal valid constant oodb simpl attribut type valid prolog variabl refer function constraint languag data knowledg vol pp concurr object data model parallel inform vol pp compil product rule rule complex inform softwar vol pp product rule activ knowledg base data knowledg ak en system data tech dept comput purdu bertino analysi proc acm symposium principl pp optim rule proc int workshop data engin activ pp ceri increment product rule deduct inform vol pp dbm inform softwar vol pp ap dr activ trigger rule advanc widom morgan kaufmann pp diaz extens approach activ tech dept languag inform san manag object orient uniform proc int conf larg pp cl user tech dept comput cl fast algorithm object pattern match artifici vol pp kr integr activ concept proc workshop program pp nh gehani hv facil activ trigger rule advanc widom morgan kaufmann pp park semant activ proc int conf extend pp relat aggreg oper gener proc ieee int conf data pp kg nw semant data model prentic propag activ dood proc int workshop deduct approach inform system pp view proc acm sigmod int conf manag pp en gener discrimin network product rule proc ijcai workshop product system innov en ariel activ trigger rule advanc widom morgan kaufmann pp cd deduct practic step proc acm sigmod int conf manag atlant pp dp match algorithm ai product proc pp prentic pp jg mullen transact program proc workshop program pp bs data cube summari tabl proc acm sigmod int conf manag pp mumick finit proc acm symposium principl pp nw system implement proc british nation conf pp nw product rule eca rule inform softwar vol pp nw ml activ rule enhanc extens data knowledg vol pp potamiano postgr rule activ trigger rule advanc widom morgan kaufmann pp product system homogen ieee tran knowledg data vol pp cd implement high level activ rule top relat proc int conf larg morgan pp principl comput scienc comparison deduct proc int conf deduct springer pp activ paradigm end proc int workshop rule pp starburst rule activ trigger rule advanc widom morgan kaufmann pp
ML/128 6 abstract learn call market colin human social scienc caltech pasadena ca david southern california ho depart market school pennsylvania philadelphia pa chapter extend learn model call market game buyer seller independ draw privat valu distribut submit bid buyer bid trade midpoint dont trade appli assum player bid partial gener experi condit incent nonlinear optim bid function learn model appli market institut subject econom learn similar past experi environ recogn differ market incent chapter present applic coordin review earlier studi compar belief learn applic show advantag gener adapt model behavior includ element direct learn special case cost complex benefit gener psycholog appeal good foundat build extend understand adapt behavior gener game market institut futur investig similar ψ magnitud market institut call learn august terri daniel suppli data research support nsf grant foundat prefer network postdoctor fellowship david introduct paper learn call market buyer seller privat inform valu submit bid anonym bid trade midpoint bid understand learn call market serv foundat studi learn complex market institut post offer doubl auction forc gener learn model develop simpler game environ learn realiz random valuat gener similar valuat gener natur extend learn undoubtedli import peopl learn complex environ learn explor studi learn game import game theori revolv analysi equilibria wide rang game question equilibrium explor recent theorist activ studi dynam properti model evolut special focu type equilibria dynam converg attent paid dynam model fit predict data natur place start data laboratori good control subject incent percept game inform receiv learn model extend explain predict learn field set ho classifi belief learn reinforc model updat unobserv reinforc chosen strategi earn rel refer belief model form belief base weight averag previou observ player belief comput expect payoff highest expect payoff chosen higher probabl ho creat gener attract hybrid main featur reinforc belief learn strategi attract updat decai lag attract multipli experi weight ad payoff receiv δ time payoff strategi attract divid factor control attract averag cumul past payoff detail model paper extend approach call market singl buyer seller privat inform denot probabl distribut valu commonli submit denot buyer pai seller trade price midpoint trade call market exampl gener call market call trader submit demand suppli market price suppli meet demand mechan determin price case call mechan investig call market reason enorm amount evid market institut influenc price speed natur trader learn model develop carefulli explor learn simpler strateg game appli market data except studi call market buyer seller friedman appli form direct learn laboratori call market buyer seller random suppli demand period found partial adjust post optim bid explain portion observ behavior strong asymmetri adjust place result show actual receiv payoff inform trader guid appli model extrem special case data found significantli reinforc belief base model call market studi bayesian nash equilibrium strategi requir markup valuat buyer bid fraction approxim constant small compar call market weak incent optim contribut asymmetri adjust inabl learn paramet case extend game call hope learn model appli complic market bid strategi complex inform influenc learn cognit plausibl buyer draw valuat bid make trade learn bid valuat similar effect captur model event similar make gener learn cognit psycholog heurist machin learn comput scienc learn arguabl heurist scarc attent alloc vicin current valuat bid approach gener paramet roth close relat approach show reinforc chosen strategi neighbor strategi explain player converg equilibrium rapidli predict sole choic experi conduct van goal approach paper gener theori learn market complex econom environ theori scientif breakthrough connect learn model approach psycholog comput scienc theori market learn practic theorist activ engag design complex incent societi firm agent act wai maxim object function busi firm design ambiti trade internet auction compani ebai mechan discov learn manageri theorist search set rule balanc definit ration mechan design ignor cognit difficulti comput behav difficulti learn experi appli mechan design intuit mechan work fail practic opaqu agent figur learn theori learn formal design intuit suggest constraint ad constraint inform mechan easiest work practic paper proce section describ briefli summar earlier result altern illustr applic coordin game section describ previou result call market call previou research learn game dozen studi fit learn model data summar larg grow mention highlight dwell precursor motiv analysi call market data start notat studi game player index strategi space player si consist mi discret si mi si si si sn cartesian product individu strategi space strategi space game si si denot strategi player element si strategi consist player strategi combin player cardin payoff function player π denot actual strategi chosen player period strategi chosen player denot player payoff period π theori assum strategi numer determin probabl strategi learn consist attract base experi strategi rule map histori player updat attract learn model sort requir specif initi attract updat choic probabl depend attract core model variabl updat round variabl interpret number past experi variabl player attract strategi period place updat govern rule experi weight updat attract updat φ ai δ δ si si si ai indic function attract equal decai lag reinforc receiv payoff si δ time reinforc payoff numer divid free paramet intuit interpret weight payoff δ kind outcom altern competit consid opportun cost decai paramet φ natur interpret player realiz player observ current work endogen φ estim chang session player strateg environ paramet determin growth rate reflect quickli player lock strategi machin learn quickli player shift environ learn attract weight averag lag attract past averag weight φ denomin attract cumul past payoff attract strategi chosen frequent yield posit payoff build larg explor player quickli turn exploit histor inform lock strategi rapidli note subscript kei paramet player game attract determin probabl strategi gener power form fit equal ai ai figur show cube ax repres imagin paramet chang paramet paramet exist theori simpli extrem case learn repres point edg cube cumul averag weight fictiti plai edg fictiti plai vertic cube attract updat equat ai φ ai δ δ si si si simplest form cumul choic reinforc roth featur left attract updat equat ai φ ai δ δ si si si form averag choic reinforc averag previou attract increment extrem case weight fictiti plai attract updat φ ai π si ai φ updat rule correspond updat expect payoff fictiti player weight observ period ago φ form belief normal averag weight belief calcul expect payoff weight fictiti plai includ fictiti plai dynam special case vertic paramet obviou reinforc belief learn model close relat fundament peopl belief learn weight fictiti plai simpli kind gener reinforc strategi reinforc strongli chosen strategi reinforc averag cumul cube suggest good empir reason player paramet configur necessarili cluster vertic reinforc belief learn earli studi wide rang paramet valu found cluster vertic typic studi simpli chose edg vertex specif learn rule match compar benchmark nash equilibrium random intuit reinforc chosen strategi reinforc intuit belief learn compel strategi strongli reinforc scientif reason intuit respect intuit δ learn model interior divid game illustr learn model briefli specif divid median start subject eventu work equilibrium median start eventu converg equilibrium equilibrium payoff shown ital payoff half tabl payoff median choic choic game captur possibl extrem sensit initi condit recent begun fascin sort scientist interest chaotic dynam complex system evid physic system mountain climb friend imaginari line mark point direct water flow direct opposit pour water water south north water made water pacif molecul began close end thousand mile divid figur show time seri median choic ten session conduct line repres time seri median separ group imaginari line choic act divid group start median drawn group start low median converg rememb low earn half high group tini histor accid persist earn consequ estim model divid data fix initi attract predict choic frequenc period match data estim find paramet fit period paramet forecast behavior period procedur actual histori subject face median person predict choic probabl period tabl show estim paramet learn model restrict case correspond reinforc belief base model tabl estim paramet learn model learn reinforc belief learn φ δ ρ λ figur show actual frequenc strategi pool period plot mask dramat evid figur show gener tendenc bifurc show converg equilibrium sharper simul choic estim paramet start initi gener period choic stochast probabl profil attract ident individu subject updat attract actual hypothet attract individu depend actual choic subsequ subject strategi probabl simul divid game learn model estim paramet tabl figur compar distribut choic strategi simul pool player period model match sharp actual reinforc learn model complet miss critic featur game belief learn model adjust quickli lower result lower peak distribut compar data learn miss side lower peak figur show path typic median simul learn model result show potenti import hybrid featur learn model separ model combin belief learn cumul reinforc model player quickli lock exploit learn trial simpli averag expect payoff reinforc level produc kind hybrid figur show similar path belief learn restrict figur show path choic reinforc restrict reinforc fit poorli gener poorli set strategi chosen begin game strategi chosen roth beauti contest game belief learn fit slightli belief learn small notic strategi chosen earli frequent chosen notic strategi frequent chosen earli period chosen period good model captur effect low choic quickli frequent choic choic quickli frequent choic belief learn add visual belief crucial paramet estim significantli belief learn belief learn brake quickli divid data illustr improv margin belief substanti reinforc hybrid featur mixtur empir result compar reinforc belief model mix direct comparison favor reinforc model weight linear combin reinforc expect payoff fit weight expect payoff ten time higher reinforc van mix result due game techniqu power distinguish model studi estim model provid easi compar extrem special case test impli restrict paramet valu tabl summar result model estim data includ earlier call market cost alloc process game ho game signal game patent race game iter domin strategi price game matrix game summar tabl time log likelihood chen column report model reinforc belief model report differ model statist differ fit valu δ tend studi game δ close φ reliabl coupl except model comparison estim paramet part sampl data forecast choic model paramet necessarili fit succe badli predict comparison column predict reinforc predict belief learn larg margin data game necessarili fit comparison reinforc belief model special case case penal extra freedom standard ψ bayesian criteria differ ll point restrict reject ψ test fit accur belief learn fit accur reinforc comparison figur show estim paramet studi tabl point repres result studi strong tendenc paramet estim cluster corner point lower corner learn high φ point note studi variat found statist variat good theori specifi paramet valu empir regular structur properti research question result dozen studi shown figur model combin intuit reinforc belief hard good empir reason attent continu focuss extrem special case theori call market experi experi call market earliest work studi case valu cost uniformli distribut equilibrium bid function agent requir buyer valu seller cost buyer bid bid higher valu session nonuniform distribut predict bid function lower slope find empir bid estim regress actual bid slope slope differ close predict chang distribut predict zheng extend studi forc player submit reserv price bargain behalf found player bargain submit effici high effici higher predict equilibrium bid player violat individu ration constraint sake joint gain varianc price high suggest player bargain put skill bargain player jointli creat surplu predict theori vallei al unpack find compar mechan treatment player pass written bid back commun submit seal bid found subject pair typic reveal valu frequent coordin singl bid effici higher predict equilibrium commun commun studi colleagu extend work fuller elicit entir function symmetr uniform valu experi experi seller cost uniform buyer uniform linear equilibrium buyer make constant bid valu learn point bid function flat portion interest open question bidder learn bid constant function monoton fuller found reason conform subject tend full revel valu time opposit direct replic experi similar result ran experi seller cost uniform buyer uniform analyz data experi equilibrium bid function farthest room observ learn extrem asymmetri valu produc linear equilibrium solut daniel seal replic experi ran experi buyer valu uniform seller cost uniform paramet flip bid function opposit buyer seller bid function experi valu bid cost call market experi symmetr uniform produc linear equilibrium bid function bayesian nash equilibrium bid strategi nonlinear equilibria observ approxim linear bid function clear trader bid linearli happen constant ratio conveni strategi extrem asymmetri linear equilibrium case buyer opportun incent learn complic strateg optim ratio vari rang valu pair randomli match buyer seller period period chang role buyer seller set valu cost order pair figur show bid experi compar linear equilibrium figur show bid time bidder modifi behavior chang bid behavior time buyer learn optim bid function learn behavior market gener learn interest learn gener altern adapt behavior market contrast direct learn model discuss learn priori assum direct adjust ident adjust valu consid payoff combin updat strategi individu depend local impact choic model compar job fit data cost complex sake gener learn discret valu equal increment middl strategi evenli space ratio valu strategi make total depend strategi assum depend initi attract bidder normal distribut mean written ai bi µ σ random µ absolut condit realiz varianc absolut condit realiz α β γ η exp distribut averag absolut price assum quadrat includ linear bid function special function valu initi attract assum distribut standard deviat proport privat valu distribut scale normal probabl densiti function privat put initi attract valu similar absolut level paramet scale initi attract maxim likelihood function similar set initi attract achiev identif earlier model initi attract updat τ φ ai τ π bi vi τ τ φ τ τ τ φ τ subject strategi draw τ paramet ni interpret denot discount experi count experi weight faster attract eqn experi weight depend strategi τ ho reflect partial gener experi neighbor valu strategi paramet τ valu strategi variabl ψ ω decai experi valu bid distanc realiz hypothet valu distanc bid measur strategi distanc valu measur experi call form differ price paramet separ effect distanc qualit τ chosen combin equal gener valu strategi ψ ω τ fall quickli chosen result experi count π easili calcul profit hypothet bid buyer price market close final model convert attract strategi probabl mi adapt behavior seller experi modifi time shown figur chang dramat case learn develop buyer studi adapt behavior gener applic learn model learn environ seller cost drawn uniform observ rang discret cost model strategi evenli space grid cover combin data approxim estim closest strategi strategi simpli absolut markup case buyer simplic absolut markup cost produc similar result rang cost optim function result maximum differ strategi space base optim bid function model markup ratio miss larg number strategi model intercept optim function limit rang player markup ratio strategi experi initi attract profil model normal distribut center linear function defin β linear function quadrat simplic optim bid function linear evid quadrat bid function seller experi scale initi attract standard normal distribut standard deviat estim optim procedur note initi attract updat τ buyer φ ai τ π ai ci ai τ τ φ τ τ τ φ τ subject strategi cost draw τ paramet ψ decai cost distanc ω decai distanc measur gener learn combin similar model paramet similar interpret model estim result nonlinear optim sa proc nlp larg number start point ensur global maximum achiev tabl show estim paramet experi learn model focu result greater asymmetri distribut produc stronger incent nonlinear bid function dramat adapt behavior estim paramet ψ indic reinforc valu strategi typic distribut gener shown figur draw ratio τ fall quickli move realiz combin substanti learn strategi valu low discount attract small mean choic base averag attract cumul model fit data produc notic initi attract segment tabl bootstrap standard error estim paramet gener smaller calcul covari matrix sa figur show simul bid estim paramet figur show averag bid simul individu simul displai similar transit bid time compar actual bid experi promin featur reduct bid varianc le bid function averag simul poor job captur magnitud reduct tabl summar estim learn paramet seller experi model estim initi attract profil approxim normal constant standard deviat contrast estim decai paramet cost similar magnitud gener strategi cost expect optim bid function nonlinear result benefit gener experi valu bid strategi seller constant gener estim φ approxim standard deviat model paramet calcul bootstrap iter result summar tabl standard deviat obtain method gener larger covari matrix similar magnitud segment model show heterogen distribut initi attract evidenc valu log likelihood χ segment differ level linear function figur show simul estim paramet model tighten period similar observ pattern experi direct learn call market daniel al learn experi adapt model buyer lower bid form paramet famili exponenti figur bid function approxim linear full revel strategi flat exponenti function point transit determin paramet higher produc bid closer valu longer rang fulli reveal bid choic paramet fit linear equilibrium adapt success trade lead buyer lower bid form lower potenti profit unsuccess bid lead higher bid period spirit learn direct explain direct learn strength adjust proport actual payoff trade place potenti profit buyer miss trade learn model bt ht ht ht vt bt vt bt strength wt wt discount wt wt discount factor impact outcom direct learn model similar buyer explain observ behavior seller slope function chosen minim model rel observ choic paramet determin aggress function control intercept slope principl adjust analog ct trade ct increment adjust paramet produc optim magnitud adjust constant discount seller bid aggress intercept slope linear function direct proport trade profit miss potenti profit bid aggress period adjust linear function differ bid cost estim individu paramet subject predict period base estim paramet averag period buyer seller experi estim learn model period paramet buyer tabl estim learn paramet call market period paramet α β γ std ψ ω φ buyer seller predict choic period base estim buyer seller number base averag choic simul model stochast choic determinist model number directli compar learn model estim buyer learn model optim individu subject averag individu estim paramet paper produc buyer seller clear prefer model base numer comparison predict choic learn mechan drive model call good learn model predict direct strength adjust period direct learn model suit fit bid behavior individu buyer institut optim bid function simpl order strategi space buyer make payoff profit higher bid higher realiz profit lower bid point actual direct lower bid period buyer miss trade higher direct bid higher period direct chang model data determin optim discount rate fit observ speed adjust discount rate make rate adjust diminish continu neglig learn model parsimoni fit observ adapt behavior institut miss import qualit characterist observ data make profit actual profit fit strength adjust trade profit miss potenti profit trade concern adapt behavior seller direct learn model inconsist actual payoff motiv adapt behavior trade payoff trade learn consid actual payoff choic adjust function form specif institut involv determinist model stochast properti choic converg choic primarili driven discount paramet actual payoff experi applic learn model call market extend gener learn model institut complex strategi subject market learn partial gener experi condit incent nonlinear optim bid function learn model appli market institut subject econom learn similar past experi environ recogn differ market incent applic demonstr captur learn gener account priori direct chang direct learn context price strategi space simpl ordin structur learn market institut simpl price payoff choic produc correct direct adjust ad hoc assumpt direct optim strategi learn produc strength adjust payoff direct learn model effect gener learn captur confid extent subject util payoff adjust choic period period payoff inform complex fulli realiz learn produc gener adapt model behavior includ element direct learn special case cost complex benefit gener logic consist good foundat build extend understand adapt behavior gener game market institut futur investig similar ψ magnitud market institut figur cube fictiti plai averag reinforc weight fictiti plai figur time seri median choic divid game median period cumul reinforc figur distribut choic divid game frequenc choic figur comparison simul choic divid game learn model frequenc belief reinforc choic figur sampl time seri median choic simul divid game learn model median period figur sampl time seri median choic simul divid game reinforc learn model median period figur sampl time seri median choic simul divid game belief learn model median figur comparison actual bid le bid function period figur distribut bid time experi bid figur distribut time experi cost figur distribut gener buyer experi figur simul bid learn paramet buyer experi bid figur averag bid simul learn paramet experi bid figur simul estim learn paramet experi cost figur comparison le bid function paramet exponenti bid function valu paramet bid le valu le tabl summari paramet estim game estim comment citat game δ φ ρ ho seal bid mechan na ω replac ρ ho call market function allianc high reward equal profit share med reward low reward function allianc high reward proport share med reward low reward parallel develop high reward product equal share med reward low reward patent race game low reward symmetr player high reward patent race game strong asymmetr player player weak player anderson signal game confid signal game confid ho coordin game payoff game payoff game payoff game payoff contest ho wang normal form full normal form full chen cost alloc morgan game game matrix game ho coordin tabl summari forecast accuraci game citat game choic reinforc model accuraci comment belief sampl ho seal bid mechan ω replac δ ρ ho call market function allianc high reward equal profit share med reward low reward function allianc high reward proport share med reward low reward parallel develop high reward product equal share med reward low reward patent race game low reward symmetr player high reward patent race game strong player asymmetr player weak player anderson signal game confid signal game confid ho coordin game payoff game payoff game payoff game payoff contest ho wang normal form normal form chen cost alloc na morgan game na game na matrix game na ho coordin fit techniqu tabl summari learn paramet estim buyer experi paramet paramet estim error model model α β γ std dev proport ψ ω φ tabl summari bootstrap paramet distribut buyer experi λ φ fix α β γ std ψ ω averag std dev tabl summari learn paramet seller experi paramet paramet estim error model model α β std dev proport ψ ω φ χ tabl summari bootstrap paramet distribut seller experi std ψ ω φ ll std dev refer christoph colin attract signal econom press larri john van optim incent coordin failur laboratori hunt work colin experi weight attract learn normal form ho sophist learn strateg teach repeat caltech work colin ho attract learn coordin probabl heterogen journal mathemat timothi daniel learn laboratori market random suppli keith test sequenti equilibrium reput econometrica vol asynchroni learn serial averag cost price terri strateg plai adapt learn bargain mechan journal mathemat predict peopl plai reinforc learn game mix strategi american econom eric learnabl class game work drew david theori learn mit chong parsimoni model choic school work keith iter domin iter american econom vol charl industri survei laboratori john ed handbook econom princeton david learn singl call lesli michael litman andrew reinforc journal artifici intellig john design coordin mechan organiz comput journal organiz comput learn cost game econom learn behavior match penni game econom john martin investig alistair rule thumb cycl coordin game roi andrew studi journal econom mix strategi iter elimin strongli domin investig state journal econom behavior terri seal adapt learn asymmetr bargain incomplet inform mark fuller bid strategi incomplet inform journal mathemat bargain experi roth handbook econom princeton learn data simpl dynam model intermedi game econom evid learn learn behavior normal form work evalu econometr model adapt work paper payoff assess incorpor texa work terri daniel inform advantag bargain incomplet journal econom behavior reinhard joachim seal bid price auction directli observ bid game human essai honor ed wei zheng bargain studi dale evid base rule learn symmetr intern journal game van raymond adapt behavior coordin failur journal econom behavior van raymond frederick select dynam adapt behavior texa work paper robert max dyadic strategi outperform equilibrium model commun bargain game harvard busi school work paper decemb ration equilibrium european econom note assum player reinforc monetari reinforc function easili alter account concav convex util fair restrict gener model necessarili fit gener fit criteria bayesian inform penal complex theori extra carefulli construct sampl size grow convent test statist favor complex penalti grow bia chen result exclud estim paramet result game plai stake level estim averag stake level reduc observ tabl figur
DB/129 3 simpl queri facil persist object manag introduct christoph koch cern document discuss reason lead develop queri design restrict intend serv preliminari manual queri facil discuss immedi develop stage finish week queri call satisfi practic persist object cern project support object sole dynam queri data write special applic program facil call queri languag facil restrict make unsuit mine practic follow associ provid access valu object suit reliabl lead critic applic error complex schemata access larg number unsupport design element queri facil discuss document enabl user complex queri declar languag requir write program syntax languag similar standard oql semant lean sql support element object definit includ associ arrai queri facil compli oql standard defin main except list queri result flat tupl sql order achiev project part queri extens semant sql cover featur group construct featur practic due peculiar semant aggreg nest queri distinct order construct part sql support requir left oql case aggreg oper queri singl project accept queri argument coher oql support sql produc relat tabl arrai extens syntax semant queri languag flatten arrai set oper differ support semant simpl power combin simpl unix script combin data satisfi user due languag easi learn semant fairli intuit remark date octob syntax definit defin syntax queri project sourc project project project alia attribut sourc sourc sourc class alia alia alia alia associ class constraint constraint constraint constraint constraint constant aggreg aggreg project sourc attribut string constant string integ term ital queri start termin symbol instanc string string present quot bnf nontermin declar compli standard notat specif sql oql close keyword case insensit string start alphabet charact sequenc charact underscor constraint conjunct normal form complex constraint assembl conjunct disjunct simpl shown simpl constraint syntax defin defin side sourc queri singl project alia queri access join class necessarili addit import restrict relax class associ join queri constitut singl chain class associ branch plan relax requir futur cycl exclud aggreg nest branch select product dr queri unsupport select lemma queri languag syntact valid sentenc languag defin bnf semant semant queri languag optim environ intern data structur queri facil build implement queri execut restrict forward sourc queri chain singl join queri result perform queri execut real join semant lean sql oql result sql oql queri produc possibl complex entail perform schema mainten problem practic data mine constraint queri class queri exist schema consist class attribut exist class superclass attribut associ exist schema connect class connect queri alia bound denot class associ denot arrai index valid arrai denot arrai arrai indic pair explicit join type schema cast class subclass class denot project constraint basic type map structur support section full specif semant queri languag restrict theoret requir due restrict capac implement restrict weaken futur semant queri languag similar oql sql defin make initi definit definit relat bodi data matrix row column project attribut class arriv relat column project attribut row object class definit number column relat denot number row denot cartesian product relat defin relat repres combin row cartesian product relat rn broken relat join standard symbol relat join tool write relat set kei column constraint relat creat relat subset cartesian select product queri join relat pd creat relat combin project result row product reason uniqu kei join defin relationship product built map object arrai tupl introduc redund relat model gener logic sound oid object includ transform tupl biject metaphor join arrai import class arrai access queri cartesian product arrai valu produc worst case relat produc object arrai project attribut queri flatten perform class arrai tupl object iff queri class function biject discuss featur object ddl part relat model map relat featur arrai basic type associ associ impli join case relat join set oid store object class uniqu oid object class select product queri join class product characterist associ order queri associ direct select characterist definit semant defin result relat queri defin subset cartesian product relat defin sourc project project singl row satisfi constraint join oper associ join result independ direct associ hold entail make nontrivi select product product characterist assign row arrai treat relationship object valu arrai arrai indic start select simpl string arrai output relat object line item copi time item column arrai indic valu column displai queri return truth row cartesian product sourc implicit join row part result iff true constraint syntact correct queri conjunct normal complex constraint queri arrang conjunct set term relat logic disjunct set term relat logic logic oper constraint common comparison oper appli string basic type integ real number kind valu convert string comparison iso priorit comparison ascii charact left problem fix futur project date type convert string format queri facil return tabl column project queri row result queri column output order queri futur altern tp produc xml stream format act addit constraint filter object sourc belong specif class make access member access member subclass select ignor object link type subqueri aggreg return result aggreg comput result subqueri complet independ main sourc parent queri refer group oper essenti perform case protect class member attribut access method object implement approach necessarili inferior queri facil access intern data structur data object map memori techniqu relat perform problem initi set object start comput implement queri facil attempt minim develop effort aspect facil mention miss understood implement backend hardwir fix subset schema figur diagram support part schema note class shown figur practic class subclass class implement associ class diagram displai class attribut displai effici point queri class effici barcod store field point class object exist practic product join effici shown exampl queri optim perform queri execut queri facil queri facil command line tool exist solari port window nt futur invok oql tool accept option issu arbitrari order option specifi object boot file path feder access option user set offlin stand option permit set product specif instal chang user overrid boot file tool default connect region center cern connect wide area network fail option turn interact mode recommend option input read file pipe suppli option interact queri input prompt issu oql select product option queri result written written option redirect input platform facil command line interfac shell option run time oql queri execut applic termin issu command syntax error report error messag exist syntax error violat semant constraint messag track error easili error messag written error queri facil termin oql invalid option trigger messag show default oql illeg option oql pr exampl practic queri note queri graph associ join simpl path branch relat discuss section section explain temporarili circumv restrict run queri join simpl unix script queri comput transmiss valu set crystal wave length nm select product queri comput light yield valu set crystal select product queri involv arrai select product note addit constraint virtual improv queri execut time constraint queri left chang result case lead substanti longer queri execut time write unix script join queri result queri section queri branch split make shown select product select product select product request forc queri facil output kei column join queri result start join queri result store sort file kei column requir unix join command file oql output bracket begin end line sort sort join join command join ascii text file design column file kei column output remain column remain column shown sort perform join sort sort join result line clean drop unwant print acknowledg work part implement work author includ construct feedback work arbitrari branch queri oper requir implement earlier discuss vital support xml output logic complet specif constraint arbitrari cascad brace mix attribut insid disjunct constraint set oper union intersect queri backend base activ schema facil make queri facil oper project contraint structur quantifi extend express power refer system concept architectur odmg object standard odmg field characterist figur support hardwir subset schema product
ML/130 6 multipl goal issu function frederick naval academi comput scienc dept hollowai road stop usa abstract paper address concern agent reinforc learn learn achiev multipl simultan goal prove algorithm base act maxim goal time produc maxim expect util agent paper examin type function approxim agent reinforc learn conclud function express power speed learn introduct mobil robot similar agent perform task fulli manag multipl goal agent task construct wall agent achiev multipl subgoal build wall simultan meet goal success task maintain adequ build suppli maintain energi order develop robot learn perform complex includ abil learn achiev multipl goal reinforc learn power mechan enabl robot agent wide multipl goal problem paper address issu multipl goal learn reinforc core system approxim function qualiti function argument environ state candid agent return estim qualiti good action agent state function approxim ned life base extern reinforc simplest approxim lookup scale continu space common approxim continu problem weight linear combin featur advantag work continu model easi comput fast immedi clear scale linear learn achiev multipl goal techniqu scale multipl goal model multipl goal singl multipl qlearn goal system robot system goal robot agent agent independ goal independ agent select maxim activ appli function current situat paper prove agent behav manner behav optim util theori option singl incorpor agent goal state inform argument function paper target model poorli commonli linear paper suggest function power model target maintain linear comput rate learn util theori analysi imagin agent multipl vari independ strength place agent environ target locat goal sati agent goal order select action agent di erent level hunger thirst food water di erent locat move food agent satisfi goal section show scheme select goal activ select action pursu scheme agent shown util show agent behav manner maxim expect util proof demonstr case goal target goal target agent act pursu target order maxim expect util prove assum target locat disappear environ probabl disappear due agent consum resourc ect weather destroi food water sourc agent maxim achiev goal visit target agent elect pursu pursu target goal longer remain environ notat probabl target remain environ xy distanc target locat measur number agent reach target agent travel straight line util target agent strength agent goal target probabl agent achiev target agent action expect util agent action state action action perform order achiev goal action action perform order achiev goal expect util action util agent select action action expect util action greater expect util action agent select action recal case interest present agent goal goal correct action move case sx sy agent closer figur show inequ note signi neg rang smaller imagin xy make larg portion space inequ true order maxim agent act pursu goal agent desir achiev agent pursu maxim goal time maxim expect util figur inequ left axi axi vertic axi linear agent act base maxim goal decid act combin output multipl creat singl manag multipl simultan goal clear output multipl evalu combin dicult consid report di erent function direct relat examin possibl singl function repres problem core system set function potenti action agent deriv agent current state potenti action state output estim qualiti agent perform action state common function linear function qa function simplic make fast interest problem natur highli common approach neural network sigmoid activ function approach advantag neural network properli approxim arbitrari continu function major disadvantag longer converg good due higher complex larger number paramet design ecient model repres target function linear function linear function power function necessarili neural net function found costli neural net examin agent linear function point view util conclud behavior base mirror behavior base expect util agent favor action action agent return larger action action qa true linear function local maximum minimum line show local maximum line lm lm deriv function ng og substitut line local maximum agent act linear behav manner agent maxim expect util function shown linear function question function ideal enabl agent behav agent maxim expect close linear function simplic fast learn inspir directli de nition expect util expect util product agent goal reach multipli likelihood reach target action calcul probabl dicult typic input robot probabl estim function distanc function common perceiv distanc object robot receiv input rang grow monoton object closer linear probabl function estim repres input vector vector distanc function linear combin variabl function form expect util function approxim eu function advantag function comput perform gradient descent system extern input goal input requir paramet paramet requir linear fewer number paramet requir typic neural network assum hidden layer size number paramet larger number paramet neural net requir larger number train longer life robot import number paramet train train paramet updat gradient chang weight linear function chang weight easier calcul paramet updat neural network activ function chang outer layer weight node node hidden layer chang layer weight input node input om di erenc ecienc major improv term actual run time move full neural network function discuss futur work argu multipl goal function linear function neural quantit bene ts perform empir test determin behavior improv function linear function perform test compar actual speed train function neural measur real time number learn iter section assum environ goal locat exist time step probabl util theori accur descript mobil robot environ case small robot cost movement domin probabl environ cost domin intend extend analysi cost action probabl success show agent act maxim activ goal futur plan investig techniqu manag multipl includ multipl correspond di erent goal examin techniqu combin manner consist util theori hope compar techniqu model singl paper present common scenario robot attempt perform act base multipl con ict goal argu robot learn accomplish task learn behav face multipl con ict goal examin applic problem conclud multipl select maxim goal consist util linear model sucient learn behav consist util altern function combin easi comput linear model abil learn behav correct manner acknowledg author kevin chri rebecca suggest refer dyer network agent intern joint confer neural moor reinforc survei journal arti cial intellig sutton barto reinforc learn mit ra howard risk prefer read analysi sri menlo rumelhart editor parallel distribut process explor microstructur volum ii mit bishop neural network pattern recognit clarendon murphi introduct ai robot mit cw curti linear introductori approach dyer goal direct adapt behavior neural famili architectur adapt
IR/131 5 extract queri modif nonlinear svm gari flake eric glover steve lawrenc lee gile nec research independ nj school inform scienc pennsylvania state abstract search user desir result restrict document categori user filter result text classifi minim posit current search engin simpl queri modif autom process gener effect queri introduc sensit method extract rule nonlinear support vector machin method user desir attempt maxim recal method perform level reduct vastli faster search combin featur effect data categori subject descriptor storag inform search gener term keyword queri rule support vector sensit analysi introduct search user desir result specif person home page confer announc search engin return result multipl forc user manual filter result solut autom classifi identifi result close user desir categori search engin low retriev larg number document imposs engin typic retriev maximum number hit singl queri modif improv recal high high introduc method gener collect queri modif satisfi user desir attempt maxim recal copyright held usa acm nonlinear support vector machin initi classifi document problem build classifi import domain text classif typic problem instanc input space word small number posit exampl scarciti posit exampl relat cost human exampl svm specif design space exampl shown extrem accur robust text classif problem svm favor classif method work extract symbol inform motiv desir high accuraci svm extract valuabl symbol similar earlier work perceptron featur extract process sensit analysi underli svm identifi linear model singl queri modif explain subset desir document extract addit queri modif iter procedur dataset neg linear model neg exampl procedur gener addit queri progress made featur extract method similar ripper iter extract method differ svm guid choic rule select identifi set queri modif combin larg portion posit greatli reduc number posit method yield search result built top exist search engin form metasearch engin svm guid rule extract rule gener qualiti origin svm possess approach differ work learn queri modif produc set queri modif work improv set individu effect work paper divid section section discuss www search engin metasearch emphasi result improv metasearch engin section describ method produc effect queri text svm sensit dataset procedur section result identifi person home page confer page show method high improv recal section summar work discuss web page pattern exploit method reduct properti www search metasearch primari tool access data web search engin northern search engin accept keyword queri return list relev rank relev topic measur search engin user typic search queri return thousand place burden user manual filter result common trick combat problem search queri modif design narrow result specif context categori search person home page machin learn ad term densiti valuabl result encourag search engin rank person home page higher page singl queri modif search home page miss coverag search queri improv metasearch savvysearch metacrawl submit user queri multipl search engin fuse potenti higher recal simpl metasearch engin fuse result url short summari return underli search engin difficult assess topic relev determin result type desir user metasearch engin combin search engin risk search engin total drop unlik typic metasearch metasearch inquiru download result full html page rank strategi improv accuraci relev user control desir categori result organ exist result metasearch inquiru low underli search engin low improv coverag improv recal search metasearch northern light user desir categori limit set categori northern light constrain user search result fall chosen savvysearch submit queri search engin desir site approach offer user improv limit problem user desir document categori match provid user submit queri gener search engin improv provid custom categori search categori home user desir document categori easili local cover special metasearch engin work motiv desir build metasearch engin adapt special document categori prototyp inquiru user focu search categori home previou version inquiru queri modif improv search perform search engin work method effect queri modif high high recal gener automat find queri modif method automat identifi effect queri modif process label exampl stage preprocess textual content html document featur discriminatori power document featur train nonlinear svm classifi document sensit analysi svm estim import document featur svm classifi import featur exhaust analyz find combin queri modif yield highest recal desir level document label true posit queri modif remov dataset process repeat svm classifi queri modif found entir method greater detail subsect preprocess preprocess extract full text titl text document convert featur consist consecut word charact convert whitespac capit letter convert lower case page train set featur histogram construct posit neg exemplar number featur document order reduc number featur elimin featur rare proper common stop remov featur score process distinguish titl text full document stop word titl strong common text reduct consid rel abil featur distinguish posit neg exemplar assign score featur score gener posit exampl neg exampl pf fp featur fg nf fn featur fg ignor higher order featur classifi occur set worst featur occur equal percentag occur frequent set simpl score captur notion max jn jn jn probabl equal size set document featur worst random absolut equat predict featur occur perfect classifi remedi add requir featur occur threshold percentag document featur occur threshold remov featur score top experi equal person home confer page top featur page convert binari featur assign indic featur absent svm classif set yn input target output support vector machin model calcul weight sum kernel function output kernel function svm written function obei mercer condit simplest xa train data linearli comput svm data correspond minim svm yield lowest complex linear classifi correctli classifi data solut found solv quadrat program problem defin object function constraint linear solut term lagrang multipli found primal dual lagrangian lagrang multipli nonzero multipli correspond data point lie closest boundari formal svm gener accommod nonlinear kernel function slack variabl write output nonlinear svm dot product nonlinear featur space object function equat subject box constraint linear constraint constant repres balanc model complex approxim multipli sum magnitud slack variabl absorb equat singl minimum respect lagrang minimum equat found famili base constrain quadrat program faster variat sequenti minim optim algorithm experi equat equat classif margin maxim train set case linear kernel function svm find boundari balanc class boundari class nonlinear margin classifi maxim nonlinear featur result nonlinear classif boundari tabl procedur find effect queri modif svm work dataset calcul find largest magnitud sensit combin test queri modif note statist rate desir recal greater found save queri modif return found queri modif experi gaussian kernel function form exp jjx jj choic made reflect smooth featur space densiti train data gener method select choic admittedli ad heurist set success cross valid procedur sensit analysi train nonlinear svm classifi label train form sensit analysi identifi compon document featur space import classifi classifi linear input linear input featur import largest coeffici jw nonlinear linear model point input space taylor linear approxim local accur vicin largest compon featur import linear approxim input critic comput choic restrict attent input larg valu evalu happen input produc largest chang interest aspect svm learn lagrang multipli correspond data point crucial determin maximum margin classifi data point lagrang multipli redund remov alter solut data lagrang multipli solut data point strictli order build svm model problem classif number support vector dramat fewer number data point search valu simplifi search point input space support vector lagrang interest discov rule identifi posit member document restrict attent posit support vector equal search restrict data point import svm model input sensit svm equat gaussian kernel equat easili deriv captur region captur region captur region posit exampl posit exampl linear boundari linear boundari linear boundari posit exampl figur rule find multipl region posit document extract dataset subsequ iter find region input space explain simpl linear rule identifi orthogon previou input space typic text classif orthogon region find effect queri procedur tabl procedur iter posit train exampl lagrang multipli famili queri modif found identifi largest compon sensit vector mainstream search engin user weight individu term inform coeffici sensit vector treat posit coeffici weight neg queri modif thought simpl threshold classifi weight line tabl examin variat queri modif option term restrict search implicit threshold perform weight search bound loop suggest sensit analysi produc duplic suggest hash test queri evalu evalu find queri modif satisfi desir maxim recal queri modif found search effect queri modif finish repeat find effect queri find addit queri modif alter train dataset svm true posit train exemplar remov leav neg exemplar neg dataset find multipl local linear rule fuse figur show styliz method work region disjoint sensit analysi discov linear rule properti locat boundari edg region closest region search support boundari parallel direct greatest sensit region impli boundari perpendicular region direct greatest result boundari view tightest remov region rest train exampl multipl potenti separ larg region posit exampl small number rule procedur structur rule conjunct term composit rule form disjunct disjunct normal rule submit search engin multipl queri result describ method gener effect queri modif identifi person home page confer page notat term term occur titl document search support queri form queri modif term titl full text document person home page train set experi consist person home page random url neg label document preprocess vector featur neg exemplar approxim base human inspect random sampl set desir svm optim set set extract procedur set extract queri modif list tabl line repres singl queri modif notic queri modif addit search term procedur search term singl modif measur effect queri test queri modif gener queri modif result present tabl search engin return manual classifi perform statist manner consist goal queri modif bia search engin rank function tabl extract queri modif person home page data desir set extract queri modif interest interest tabl extract queri modif confer page data desir set extract queri modif confer hotel workshop tabl fourth queri modif home page merg result queri modif highest recal low overlap return result combin high desir note test produc page list link person home type cv resum page label posit desir result confer page confer web page data consist neg exampl posit exampl document preprocess vector featur set desir svm optim set set extract procedur set earlier test extract queri modif shown tabl earlier test top queri modif augment test search network test result summar tabl manual classifi web page queri confer page hand difficult home merg result maintain level close desir recal compar individu queri modif combin queri modif offer insur case singl queri modif fail discuss state section motiv work autom process gener effect queri modif inquiru metasearch engin queri modif select base notion queri support autom method discov queri suggest interest fact document web method paper categori pattern part perform experi person home page reveal interest trend type home page usag languag distinguish experi found effect modifi larg number free person web page host found children home page made refer favorit academ wrote research interest method find multipl queri modif identifi languag trend occur subgroup categori deriv set queri modif recal work support multipl queri modif recal maintain desir data kei facet method dataset elimin true posit train retrain svm procedur tabl perform constrain limit search effect queri modif make queri modif found step akin span larg portion train data remov true posit iter forc procedur find queri modif complement found queri modif continu data similar factor eigenvector matrix eigenvector found method attempt span larg portion document space identifi reduct benefit approach perform reduct wai elimin common uncommon preprocess elimin featur kei identifi subset posit reduc featur space preprocess warrant featur space consist hundr thousand word phrase search sensit posit exemplar assist svm nonlinear model discov support vector posit lagrang train point remov alter solut search sensit posit support reduc number document consid sensit analysi rank featur input space largest effici search optim queri modif input featur dataset step elimin portion train data effect speed train time svm tabl test result extract home page queri refer number top maximum page examin home total queri page page merg queri modif remov duplic merg queri modif remov duplic posit merg queri modif remov duplic posit tabl test result extract confer page queri refer number top maximum page examin confer total queri page page merg queri modif remov duplic posit neg merg queri modif remov duplic merg queri modif remov duplic posit neg simplifi document space search summari altern extrem identifi queri modif linear classifi exhaust search featur space method fail work effect linearli insepar case approach problemat exponenti number binari classifi consid approach exploit underli regular document make www discov correl form queri modif multipl linearli insepar featur procedur termin reason amount time interest compar approach approach repres aggress procedur attempt construct larg set complic queri identifi page set essenti act lookup tabl train data hope gener data enforc reduct find queri modif gener data small size train set issu import restrict find person home page person common topic restrict complex queri modif strive maximum approach multipl queri modif likelihood find narrow search result rank limit search engin acknowledg fran insight andrea ple perform anonym review comment refer cohen fast effect rule induct proc twelfth int conf machin page morgan flake lawrenc effici svm regress train smo machin gomez intellig fusion distribut search engin journal comput gile architectur metasearch engin support user inform eighth intern confer inform knowledg manag page kansa novemb acm press gile recommend web document base user prefer acm sigir workshop recommend august acm press pennock improv categori specif web search learn queri modif symposium applic san januari engin learn search engin queri ai joachim text categor support vector learn relev featur european confer machin number page de joachim transduct infer text classif support vector machin proc intern conf machin page morgan san lawrenc gile context page analysi improv web search ieee internet page platt fast train support vector machin sequenti minim optim advanc kernel method support vector learn mit platt analyt qp speed train support vector machin advanc neural inform process system mit selberg etzioni metacrawl architectur resourc aggreg web ieee towel shavlik extract refin rule neural network machin vapnik natur statist learn theori springer appendix svm experi perform work download
DB/132 3 extend odmg object model time bertino ferrari dipartimento di scienz dellinformazion degli studi di milano itali dipartimento di informatica scienz dellinformazion di genova itali abstract tempor extens relat data model compar amount work context data model extens relat model framework sql attempt made extend standard objectori defin odmg paper present tempor extens standard data model main contribut work formal odmg standard data model extens time contribut work formal main issu introduct time model introduct tempor provid capabl effici manag current valu entir histori data time medic scientif domain busi requir support histor data data interest applic relat time research develop effort area tempor carri context relat model tempor relat issu relat tempor relat data model queri languag extens investig theoret point view research tempor earli stage tempor model amount work compar work report relat model main reason delai develop tempor data model standard object standard formul odmg odmg standard includ refer object model object object definit languag object queri languag definit standard repres import step widespread dbmss success relat tempor due exist standard accept sql standard ensur high portabl simplifi learn relat repres wide relat approach paper tempor extens odmg standard object data model goal work develop tempor data model goal incorpor tempor featur odmg object model extens attempt complement odmg data model tempor capabl odmg data model rich set model primit object state behavior state object repres valu properti properti data relationship relationship declar object type induc pair path type odmg data model support notion set properti valu uniqu identifi object class extent develop tempor extens semant rich data entail interest issu address paper rich set data type provid odmg complement set tempor handl uniform tempor tempor domain ad tempor dimens object attribut relationship relev featur provid odmg support immut static object properti tempor properti properti chang valu time record immut properti properti modifi object static properti properti chang past valu store investig notion kei object consist modifi deal tempor dimens import properti odmg data model extend odmg data model nontempor tempor data coexist integr import applic migrat tempor contribut paper addit time odmg standard data model carri formal basi requir provid formal main compon odmg provid tempor object model present paper base chimera formal data model model repres start point current work work report paper substanti extend previou work odmg richer set type respect chimera odmg support notion relationship kei provid chimera notion tempor type distinct immut inherit revisit context odmg model paper organ section summar main featur odmg standard section introduc type section deal class section discuss exist tempor data model section conclud paper object summar main featur odmg data model refer interest reader descript object definit languag object queri languag basic model concept odmg data model concept object liter main differ object liter object uniqu identifi liter identifi liter constant immut liter chang object mutabl chang valu attribut relationship chang ident object object liter categor type object type partit main atom object type collect object type atom object type type collect object type repres list arrai object liter type partit main atom liter collect liter type structur liter type atom liter type charact collect liter type repres list arrai liter structur liter type fix number variabl liter object odmg support structur implement record formal object liter type differ collect object type collect liter type present subsect object refer instanc type object odmg state behavior state object defin valu properti properti attribut object relationship object object typic object properti chang time behavior object defin set oper execut object object type set properti set defin oper aspect definit type type interfac specif implement specif interfac defin extern characterist instanc type oper invok object state variabl valu access type implement defin intern aspect instanc type distinct interfac implement separ approach odmg support encapsul paper assum type singl implement specif term object interfac class synonym distinguish object type liter object interfac liter term class deal object implement detail relev model point view focu interfac disregard implement specif type attribut declar interfac defin abstract state type attribut liter object identifi relationship defin object type odmg object model support binari relationship instanc referenc object identifi liter type particip relationship object relationship odmg object model similar relationship data model binari relationship depend instanc type particip relationship marriag relationship instanc type person woman mother relationship children teacher student typic particip relationship relationship implicitli defin declar path enabl applic logic connect object particip relationship relationship path direct binari relationship relationship professor teach gener professor teach taught professor teach path defin interfac declar professor type taught path defin interfac declar type fact teach taught path appli relationship path declar relationship implement list arrai attribut relationship characterist type set oper signatur signatur defin type type return oper singl type uniqu type definit oper defin type oper overload oper invok overload specif oper select execut select call oper dispatch oper side effect oper return odmg object model includ formal specif semant highli implement depend final kei supertyp inform option type extent type set instanc type object instanc type necessarili belong extent type subtyp type extent subset extent instanc type uniqu identifi valu carri properti set properti identifi properti call kei scope uniqu extent type extent order kei similar object odmg object model includ inherit base relationship supertyp inform characterist extent kei specif relationship commonli repres orient node repres type exist arc node node supertyp relationship call simpli isa relationship supertyp gener subtyp special type valu section formal introduc odmg type valu give formal odmg type extend odmg type tempor type result model tempor extens odmg model tempor structur liter type detail defin odmg legal valu refer tabl summar function defin model function tabl report signatur output denot oi set object ci set class interfac set attribut rn set relationship mn set method signatur defin except oper context except mean function clarifi remaind discuss signatur output ci im oi extent class instant pe set ci im oi proper extent class instant type ci structur properti type class type ci histor properti type class type ci static properti type class state oi im histor object state oi static object lifespan oi im im lifespan object lifespan oi ci im im lifespan object member class tabl function emploi defin model odmg type mention section object liter categor type give formal definit object type denot set odmg type formal defin subsect definit set odmg object type ot defin ot cot set odmg atom object defin set class identifi set odmg atom object system defin set cot set odmg collect object defin set cot fo fo fo fo definit odmg object type partit set set denot simpl interfac set denot set predefin system type set cot denot type object type direct supertyp collect object note notat collect object type case set denot collect liter collect object set type sake distinguish collect object liter type denot collect object type set denot collect liter type rel atom object system type set direct supertyp odmg collect liter type defin list arrai note ci collect object type collect object type collect object type easi complet substitut collect object type assign definit formal odmg liter type definit set odmg liter type lt defin lt alt st alt set odmg atom liter defin set alt set odmg collect liter defin set set odmg structur liter defin set st set odmg struct liter defin set st tn pn gj import differ collect object type collect liter type instanc collect object type identifi instanc collect liter type identifi detail featur odmg model refer reader set odmg type defin union set odmg object type ot set odmg liter type lt ot lt recal odmg data model type stand type void stand side effect oper return valu interfac type found interfac interest relev work odmg type odmg extend set odmg type collect tempor introduc handl uniform tempor tempor domain odmg type tempor type defin special constructor tempor instanc type partial function instanc type timestamp instanc type elabor inform definit section definit odmg tempor set odmg tempor type defin tempor type definit collect liter struct state definit denot set odmg type definit odmg object set odmg object type ot defin ot cot set odmg atom object definit set odmg atom object system definit cot set odmg collect object defin set cot fo fo fo fo definit odmg liter set odmg liter type lt defin lt alt st alt set odmg atom liter definit set odmg collect liter defin set type timestamp subsect set odmg structur liter defin set st set odmg struct liter defin set st tn pn gj defin set odmg type definit odmg set odmg type defin ot lt remaind discuss denot set odmg type formal tempor structur liter briefli discuss interfac defin part odmg standard structur liter sake introduc interfac deal time zone section model support linear discret time structur singl time valid time odmg structur type provid data structur manag time adher odmg chosen support time featur odmg exist data structur subsect conceptu support linear discret time structur structur type interfac figur time granular model time instant repres pair date type date month time type time instant minut type timestamp denot date denot time instant present interfac specif date time lack refer interest reader note chosen model time instant pair altern chosen emploi date time granular order support time introduc type interfac figur type interfac interv suppli odmg interv interfac implement abstract notion interv set consecut time instant valu type timestamp perform oper time timestamp object type interfac timestamp short date time float timestamp interv timestamp interv boolean timestamp boolean timestamp boolean greater timestamp boolean timestamp boolean timestamp boolean timestamp timestamp fig timestamp interfac interfac timestamp timestamp boolean boolean timestamp fig interfac element start type denot start end time order simplifi obviou mean oper symbol denot equal structur impli implement type exampl equal valu type union time interv variabl type time time denot set consecut time includ time instant time instant identifi time time instant identifi time includ constraint object type singl time instant repres time interv denot null interv oper equal intersect semant interv oper function interv argument instant interv return true instant denot interv union oper input interv set interv return set interv consist set interv set disjoint interv fi ing compact notat set time instant includ interv odmg valu predefin atom liter type alt postul exist set denot domain atom liter type boolean consist classic boolean valu true domain type timestamp set im set pair date type date time type time im repres sequenc time instant start time instant consid system timestamp current date hour system clock set isomorph set natur number easi verifi set valu type date isomorph subset denot set valu type time finit set im isomorph isomorph im isomorph assum time discret pair belong im instanc odmg type oper defin type timestamp appli oper type date appli compon oper type time appli number dai finit number compon pair valu type pair compon type timestamp set valu type cartesian product im im note odmg oid oi handl valu object identifi object type ci legal valu object type ci oid object belong extent instanc proper instanc set object instanc class dynam time defin set legal valu odmg object introduc function ci im oi assign extent object instant set identifi object time belong extent instanc fact interpret type fix time instant denot set legal valu type time definit state set legal valu odmg denot definit legal denot extens type time nil alt timestamp im im im ot vn vn tn pn pn rn ff im im partial function defin instant extens predefin basic type element extens class explicit usual object proper instanc class specif inherit object belong object proper instanc class instanc superclass extens structur time obviou set valu definit model bag denot unord collect element duplic scientif data structur refer denot multiset element type extent time set legal valu collect liter type defin term legal valu compon type extens tempor type set partial function im set legal valu type union set legal valu type instant im variabl type repres set pair partial element im function time variabl type chang instant repres set pair vn vn legal valu time variabl assum instant adopt paper oi short fi bob note type timestamp compon pair denot instant dai consid date class section object type interfac class interfac consist set properti set oper specif attribut tempor natur type relationship tempor type odmg support properti tempor immut static tempor properti properti chang valu time record immut properti properti modifi object static properti properti chang past valu record relationship defin class type relationship type relationship context relationship set object involv relationship odmg lifespan repres time interv class exist assum lifespan class contigu definit class interfac ci class type ot ci class lifespan im lifespan attr set item attribut class item attribut natur attribut tempor type attribut domain rel set item relationship class item rn relationship natur relationship tempor type type ci type inv pair denot path inv inv inv inv rn relationship inv type ot relationship domain meth set item method class item pair mn method sign signatur express tn denot type input paramet denot type output paramet note odmg model input paramet output paramet note method notat void denot method output paramet tn denot method input paramet odmg distinct class identifi class type relev odmg support kind object atom object type collect object type concern atom object type class coincid class identifi class identifi collect object type assign class type type belong cot note attr rel compon interfac constitut properti specif order avoid static type definit attribut type relationship domain tempor attribut type mean attribut specif easili deriv type nat nat nat attribut type comput method sketch legal odmg type invalid attribut specif legal odmg type hold relationship immut attribut kind tempor tempor attribut valu chang object lifespan immut attribut model mean constant function tempor domain set legal valu attribut distinguish immut static attribut tempor attribut attribut tempor type function tempor immut attribut attribut tempor type constant function tempor static attribut attribut static type function tempor section relationship instanc referenc object identifi implement relationship relationship domain list arrai object reason specif compon rel type object type collect type object type similarli relationship static immut relationship interest record entir histori relationship mean interest track set connect instant object lifespan view tempor type type partial im union set legal valu type instant im defin recal ci tempor immut attribut function partial tempor relationship type type odmg legal type relationship teach taught introduc section exampl tempor relationship professor teach period career track professor teach time static relationship relationship static type concern kind interest current record past valu relationship static relationship relationship live class person citi interest citi person live citi person live immut relationship type tempor relationship immut relationship type constant function im type type immut relationship constant time instant immut relationship relationship son relat person parent section supertyp extent specif kei characterist class class characterist defin definit class class characterist repres super set class direct superclass extent pair extent set track instanc extent type kei set pair natur prop rn odmg data model characterist mandatori compon empti class characterist affect introduct tempor featur extent kei schema set superclass class invari time set instanc class tempor context extent class vari time tempor set class repres object instanc set type identifi class remaind discuss pe set ci im cot argument class identifi instant return set oid object specif type inherit hierarchi time set proper instanc identifi type return pe set set class identifi pe object instanc class instant proper instanc class instant function tabl class concern properti part kei absolut rel order clarifi mean kind kei distinguish immut tempor properti properti static kei instanc properti extent properti tempor immut kei instanc properti extent overlap period time properti tempor immut kei instanc properti belong extent time period class person object class attribut ssn immut object address variat time relev applic hand tempor relationship children oper marriag move belong odmg class interfac type person lifespan attr rel meth person string person direct subclass object oi denot instanc type person instanc class ssn extent marri person overlap period time class characterist super object extent fi kei previou definit class specif defin definit class int class definit char class definit impl class implement note due space paper give descript class implement inform definit class implement odmg found simplifi class denot compon interfac dot denot class denot class simplifi notat class characterist note adopt simplifi notat compon class interfac class characterist distinct discuss relationship class properti type identifi class denot object type object type type identifi object instanc class attr compon attr attr nat rel compon rel rel nat inv properti type structur properti type repres type attribut relationship instanc defin pair attr nat nat rel nat nat histor properti type repres type tempor properti instanc defin pair attr fa fa fa ang nat rel fr fr ng nat static properti type repres type static attribut relationship instanc defin pair attr fa fa fa ang nat rel fr fr ng nat correct notat notion histor static properti type class section check object consist defin ci argument class identifi return histor static properti type class identifi object odmg handl uniform histor static object object histor properti tempor static object repres time interv object exist class assum lifespan object contigu object instanc class assum instant exist interfac extent belong fire remain instanc class superclass class till end lifetim histor object histori specif class belong lifespan record static class identifi specif class belong maintain definit object oi oid lifespan im lifespan valu attribut struct hv attribut valu relationship struct hv rn relationship store inform specif class belong time set time class class identifi specif class belong record specif class belong note function type return null argument identifi class instanc function type return null argument class instanc tempor properti class gener class inherit object belong oi person ci chimera lifespan ht avenu address ig fi fi tempor tempor constraint satisfi object lifespan formal constraint defin function oi im im oid return lifespan object identifi inform histor extent class consist class histori object state invari invari object class pe lifespan object partit set depend object specif class object member class lifetim introduc function oi ci im im oid class identifi return interv repres set time instant member class identifi tempor constraint state invari satisfi invari note subclass function lifespan lifespan similar defin impli consist notion object specif class object belong vari time object instanc class time instant case promot subclass extra subordin offici case transfer manag back normal statu migrat object class addit delet attribut object promot manag statu effect ad attribut subordin offici car transfer manag back statu drop attribut subordin offici car object attribut subordin offici car simpli delet object track exist record object migrat class valu object migrat class manag maintain part object anymor requir object consist instanc class belong context object static tempor notion consist assum slightli semant respect classic definit verifi consist object tempor context requir step set attribut object instant lifespan determin correct valu check note instant current identifi tempor attribut object time static attribut record current valu instant lesser current make check correct valu tempor immut attribut object start introduc definit definit tempor properti tempor properti object properti time defin time distinguish kind histor consist valu tempor properti object instant legal valu tempor properti class static consist valu static attribut object legal valu static attribut class tempor properti properti tempor immut object relationship object set object relationship object hv hv instant valu histor pair attr repres valu tempor attribut object time rel repres valu tempor relationship object time fa subset fa ang consist tempor attribut time fr subset fr ng consist tempor relationship time histor time defin attr hv denot time rel hv denot time static pair repres valu static properti object definit analog histor static properti tempor defin oi im receiv object identifi instant return histor object time oi receiv object identifi return static object note object consist tempor state return snapshot object properti time instant readi formal introduc notion histor static make function type type tabl denot compon tupl definit object histor consist instanc class time iff condit legal attribut specif legal relationship specif definit object static consist instanc class condit legal attribut specif legal relationship specif consist object check respect specif object consist respect specif consist respect superclass definit object consist iff condit pair interv lifespan class identifi class instant object class object belong exist vice instant ci belong lifespan tempor properti time object pair histor consist instanc instant ci element object static consist instanc class definit state instant tempor properti class belong time correct type instant properti defin belong lifespan consid object current time consist respect static properti check notion consist uniformli handl static histor object case static definit reduc tradit notion consist relat work tabl compar tempor data model literatur consid approach compar perspect snodgrass emphasi tempor queri data model featur tempor featur disregard tempor model support linear discret time model hierarchi time type time dimens interest tempor valid time time fact true transact time time fact store model valid time approach associ timestamp object associ timestamp object attribut tempor attribut function tempor domain set legal valu note object multipl specif class time structur time dimens discuss attribut approach model odmg object model support attribut kind object properti extend time model import characterist immut tempor attribut support tempor attribut attribut chang valu time record immut attribut attribut modifi object tempor attribut attribut chang past valu store support immut tempor attribut firstli chimera data model main differ chimera odmg underli object data model extend odmg support support odmg specif kei model track dynam link object specif class import dynam aspect object dynam chang special gener current data gener mad gener om odmg model time linear linear linear linear linear linear linear structur discret discret discret discret discret discret discret time valid valid valid valid valid valid arbitrari valid valid dimens tran tran valu object object object object object object object object object relationship attr attr arbitrari object attr object arbitrari object attr timestamp relat relat temp attr set atom list atom atom valu pair valu tupl valu valu kind temp temp temp temp temp temp temp temp temp attribut imm imm imm imm imm imm imm imm imm histori obj type time dimens transact valid time denot function tempor domain time entir object state inform deriv histori object instanc tabl comparison tempor data model immut attribut regard case tempor constant function tempor domain futur work paper present tempor extens odmg object standard data model odmg support static immut object properti introduc notion tempor type defin set legal valu type discuss notion object consist integr notion kei tempor framework prototyp implement model implement top od oodbm histori tempor object properti organ monoton plan extend work direct investig tempor extens odmg queri languag relev extens support multipl time granular calendar current work prefer model time simpl provid clear formal model top formal plan investig multipl granular calendar problem relat data access framework direct deal mechan support select record past valu truth condit properti plan extend work implement inform idea implement method set refer time interv formal treatment tempor method context chimera model found plan extend work compli recent publish odmg standard refer approach handl tempor data technic report dipartimento di scienz di tempor data model theori practic object formal tempor data model proc intl conf extend number lectur note comput page avignon march cattel object cattel object odmg chen model unifi view data acm transact cheng gadia model tempor proc intl workshop infrastructur tempor clifford object time proc fourth ieee intl conf data page ozsu tempor extens uniform behavior object model proc twelfth intl conf volum lectur note comput page realiz tempor data model proc acm sigmod intl conf manag page acm rose segev tempor data model tempor constraint proc tenth intl conf page snodgrass tempor critic comparison modern object page snodgrass tempor queri languag kluwer academ steiner mc norri implement tempor system proc intern confer system advanc page su chen tempor knowledg model queri languag proc seventeenth intl conf larg data page snodgrass tempor implement system applic seri wang tempor bibliographi updat dayal uniform model tempor version objectori tempor page articl process macro packag llnc style
Agents/133 1 la ricerca povo itali ontolog overhear aiello busetta serafini april technic report istituto di limit distribut notic report itc copyright accept public issu technic dissemin content view copi tot distribut public limit peer commun materi form author copyright owner ontolog overhear marco aiello paolo busetta serafini amsterdam tv netherland itali itali abstract collabor intellig agent greatli enhanc understand commun interven give inform act explicitli involv behavior common human call overhear present agent architectur model behavior focu overhear base ontolog overhear semant select piec commun knowledg goal overhear perform team agent plai role classifi commun formal role make suggest time point present formal languag interact agent overhear team prototyp implement jack intellig briefli preliminari result discuss introduct human work team collabor peopl face task manag seek assist observ inspir research cooper analyz teamwork slight shift perspect associ agent readili achiev request equal improv result achiev associ observ initi action offer suggest aim improv colleagu associ commun colleagu feel improv product achiev person gain suggest part work framework introduc abstract architectur base principl call overhear intuit overhear model human interact collabor observ environ overhear architectur describ collabor commun artifici agent achiev mean observ unsolicit suggest paper singl aspect observ agent goal provid framework queri commun channel develop queri typic submit agent provid unsolicit assist defin formal design softwar compon requir perform experi observ channel formal languag includ tempor ontolog formul complex queri order messag exchang paper organ section overview overhear architectur section provid definit languag queri commun show formula languag interpret section present formal languag overhear architectur actual implement show effect present section section discuss relat work conclud identifi potenti futur research overhear overview overhear abstract architectur summar figur servic agent servic agent commun channel observ overhear agent suggest agent subscrib overhear notifi type event occur channel suggest issu suggest servic suggest special messag carri inform command run system coupl agent cover role agent act agent cover role simultan servic overhear differ architectur open agent architectur concern connect control flow messag aim provid commun support flexibl develop methodolog complex adapt system initi phase agent requir achiev basic function built behavior modifi extern observ suggest function basic servic requir applic assum suggest dynam ad hamper abil system reach main object approach advantag enhanc function run system tunabl compon plug bring restart system output suggest servic servic observ overhear agent suggest suggest notifi subscrib commun channel fig overhear architectur tem enhanc suggest addit relat request delet outdat unrel result flexibl cost full implement overhear architectur requir suggest perform agent state base model servic agent messag exchang commun select broadcast turn introduc issu time secur servic engin handl suggest chang behavior overhear appli case simpl demonstr present interest web server suggest send addit data assist agent build dynam html page relat inform easili fit relat schema unstructur target base dynam built user collect assist overhear adopt support paradigm agent collabor concentr interact suggest overhear mention object suggest notifi messag relev interact languag architectur present overhear main monitor commun respond queri suggest agent place depend messag exchang servic vari fulli structur semi structur xql queri xml unstructur bodi email newsgroup content natur multimedia imag sound track feasibl overhear track entir content messag case intens simpli requir memori space overhear track log suitabl amount data messag travel repres interpret messag respect formal domain ontolog suggest notifi messag specif topic subscrib overhear suggest specifi match criterion overhear appli select messag forward provid reliabl found tool express select develop languag inspir descript logic modal tempor languag call languag modal logic simpl descript languag alc famili enrich perform figur highlight main facil list intern clock time log file messag discuss messag interpret subset tempor oper tempor ontolog languag suggest goal bring castl attent potenti tourist region achiev wai suggest inform messag pass public channel agent web agent serv web inform messag specif set word inform messag concept relat castl tourism utter requir interact languag express structur concept tempor dimens express properti tempor order messag suggest agent utter request castl locat castl locat castl suggest express inform natur formula analyz pt alc overhear agent suggest servic servic subscript log file privat clock suggest natur fig overhear interact languag facil overhear alc castl suggest express concept thing castl role locat filler type denot formula suggest interest perform type agent agent stand altern explicitli refer agent involv channel denot formula suggest interest perform occur point express tempor oper give syntax semant compon languag conceptu languag descript logic famili formal research semant network instanc main advantag formal previou approach avail defin semant ensur correct reason task subsumpt check alphabet main atom concept role object castl atom concept entiti castl locat role connect concept concept locat physic castl locat trento alphabet symbol defin set concept repres atom concept denot denot role relat relat object concept express mean type instanc subsumpt statement formula alc denot small greek syntax object concept thing castl locat provinc castl state concept castl gener concept larg formula castl build larg semant term interpret interpret pair domain interpret function assign subset concept subset role element object interpret concept defin fp qi impli fp qi formula verifi falsifi interpret terminolog set subsumpt assert box set instanc select tbox abox form knowledg base denot knowledg base interpret model knowledg base sentenc satisfi interpret perform languag perform level languag express intent connect concept intent repli request identifi set perform repres perform recogn overhear messag pass channel sake concentr perform repres perform queri perform set messag pattern object agent object instanc subsumpt statement messag pattern denot small greek letter denot set agent ag messag pattern call messag messag pattern repres set messag queri post agent concept formula repres set messag queri post agent object instanc concept formal intuit extend semant alc interpret alc extend interpret fig ag cg cg dg subsumpt messag pattern defin term interpret intuit mean interpret messag match pattern match pattern put pattern specif pattern full tempor languag channel phenomenon model time chose formal logic instanc abil refer futur tempor interv place condit futur past event syntax tempor languag previou addit oper formula tempor monad tempor dyadic oper classic connect oper label refer past proposit oper work messag pattern atom formula messag pattern intuit atom formula messag pattern mean messag match pass channel formula mean messag match pass channel formula mean messag match pattern pass channel previou time stamp formula denot greek letter notic messag pattern formula atom object tempor logic perform messag proposit letter true time point usual semant term kripk structur interpret messag pattern semant extens logic case linear discret bound past model knowledg base infinit sequenc index natur natur number pair messag interpret alc model satisfi defin iff iff iff iff iff iff iff iff iff iff iff iff truth condit repres fact messag pass time match messag pattern current interpret conceptu languag overhear connect treat truth condit tempor oper usual condit linear past futur tempor logic bound past answer queri suggest focu overhear suggest suggest inform commun servic formul knowledg gain term messag pattern suggest notifi agent castl answer mention exist castl suggest subscrib overhear intend mean subscript notifi subscrib agent time instant subscrib formula true agent time perform castl time agent perform time formula true overhear notifi suggest imagin suggest directli send messag agent time inform exist castl inform action commun channel observ make formula time greater notifi question overhear formula check log shown figur overhear updat main data log store inform commun file activ subscript agent order interpret messag overhear ontolog assum ontolog knowledg base section log file structur similar kei time sender receiv perform content pm castl pm castl pm forecast updat time perform occur channel activ subscript file simpli list coupl suggest subscrib updat time suggest subscrib log file close resembl model famili messag index natur number bound past futur overhear model check subscrib formula true current time point procedur follow messag observ interpret messag updat log subscrib check true current time step notifi suggest note subsumpt concept castl locat gener concept castl castl present assum suggest formula futur overhear futur optim algorithm formula true futur begin check formula refer past trace relev truth valu past time recalcul truth time step overhear check truth formula time step check messag modifi truth theori practic ran preliminari experi verifi adequ interact languag overhear suggest prototyp interact jack intellig agent bdi platform overhear equip develop subset perform languag chosen core complet overhear form set implement knowledg base section overhear provid weak natur languag process capabl instanc list italian order implement match condit express equat develop algorithm instanc check ident subsumpt check interest portion subsumpt check wai tackl syntact tableau method instanc semant build call graph repres model formula respect knowledg base chose follow extend algorithm borgida extens concept disjunct instanc dealt graph unlik work cyclic axiom definit modif made algorithm deal small ontolog small formula descript graph specif grow exponenti size formula grow size ontolog test prototyp simpl italian newsgroup newsgroup commun channel intellig agent exchang messag natur languag subject messag content interpret overhear ontolog transform automat formula tempor compon plai minor role respect reason suggest interest simpl tempor messag utter past experi follow focu attent portion goal assess languag express power enabl suggest overhear interest result launch prototyp newsgroup italian web call global topic newsgroup travel creat meteorolog consist concept divid meteorolog time polit geographi consist concept instanc list italian overhear observ total messag meteorolog newsgroup messag travel figur ten subscript queri pose suggest overhear question pose meteorolog newsgroup meteorolog ontolog meteorolog ontolog travel newsgroup pose travel newsgroup travel ontolog system role role ontolog simpl tabl figur present result queri assumpt number messag gener notif event suggest parenthesi number wrong messag gener notif prc rec standard inform retriev measur jrj jt column tabl repres main miss notif ont number error due insuffici care design implement nlp number error due retriev techniqu number tabl obtain assum overhear newsgroup member share mean left assum necessarili case frozen water color messag refer ontolog nlp capabl arbitrarili deriv instanc concept assum closest word italian syntax snow snow white la instanc white result shown figur demonstr languag discrimin power suggest express notif ambigu problemat case queri structur meteorolog ontolog low concept relat geographi subsum part concept travel wrong notif note aim build inform filter system robust system interpret natur languag emploi nlp tool present stem techniqu acronym synonym shallow ontolog travel ontolog geograph inform main tourist resort id queri translat snow wind sea lake graph precipit special offer accommod accommod europ sea fig queri perform suggest id prc rec ont nlp prc rec ont nlp fig share ontolog richer ontolog scope spite current significantli power simpl pattern match express singl word pattern gener cartesian product set object subsum hotel camp union object subsum european place defin overhear comparison worthwhil highlight differ relationship agent commun languag kqml logic languag suggest queri log messag overhear similar applic sql interrog remot relat acl transport queri formul messag exchang servic agent chosen acl implicitli constrain perform express acl ontolog explicitli refer correct interpret content messag ontolog overhear match ontolog servic experi section note prevent applic deploi multipl suggest submit queri overhear ontolog match analysi optim interpret messag content base subsumpt overhear servic left futur work altern feasibl approach interact adopt tempor overhear manag intern updat valu extract messag travel suggest notif directli express tempor sql queri advantag gain point view perform applic perman store messag ontolog overhear greatli affect qualiti suggest solut higher abstract level gener field descript system close relat present overview tempor descript formal concern model concept relat time terminolog overhear architectur interest evolut time terminolog express enrich perform express tempor concept ontolog concept specif tempor semant assign achiev concret domain tempor concept follow semant terminolog languag express concept futur work work present origin field cooper softwar overhear architectur gener focu interact languag high abstract level combin element tempor descript logic provid languag queri log messag exchang agent applic overhear architectur bring enhanc agent enabl easi detect commun eventu lead unsolicit collabor agent current overhear capabl tap ontolog queri messag mentalist interpret build model behavior servic agent left suggest perform overhear act filter reduc workload suggest section mention wai enhanc current implement overhear give simpl mental recognit capabl agent intent borrow pen agent result soccer result overhear extra suggest chanc make queri content line epistem logic interest tempor epistem logic present work semant style usual valuat truth definit base descript logic reason mechan addit improv futur work overhear architectur conceptu comput challeng involv understand interven deal unsolicit suggest acknowledg zini particip definit discuss special due trento prof giunchiglia support extend visit marco aiello lead research anonym comment refer fipa acl messag structur specif foundat intellig physic jack intellig agent ver user manual agent orient ver sun artal franconi survei tempor extens descript logic annal mathemat artifici terminolog knowledg terminolog logic technic baader scheme integr concret domain concept languag page modern inform retriev addison giorgini collabor filter implicit gener framework proc workshop recommend system june acm press toman queri tempor logic intern confer extend technolog borgida semant complet algorithm subsumpt classic descript logic journal artifici intellig zini extend cooper overhear technic report sixth intern confer cooper inform septemb open agent architectur aaai spring softwar page aaai wooldridg resolut tempor logic knowledg journal logic norman cooper system knowledg engin mayfield kqml agent commun languag jeff softwar agent mit halpern mose guid complet complex modal logic knowledg belief artifici horrock express descript fact principl knowledg reason page morgan kaufmann san editor intellig inform system lesser cooper inform distribut problem solv approach ieee proc softwar salzberg tsotra comparison access method data comput smolka attribut concept descript complement artifici tempor logic blackwel guid philosoph logic basil blackwel wolter zakharyaschev tempor descript logic kluwer
IR/134 5 improv qualiti label map andrea rauber michael institut public intern vienna research center comput law austria institut softwar vienna technolog austria abstract vector legal document comput classif cluster label content special problem occur strong cluster tend domin neighbour smaller cluster term weight vector influenc label extract overcom effici dedic phase end train neighbourhood radiu train function set experi text collect shown high improv qualiti label introduct law internet describ situat lawyer citizen suffici bibliograph access legal document easi search huge digit librari boolean logic search engin remain riski untrain lawyer citizen simpl task similar document properli support exist inform retriev system effort improv retriev ai structur support overview relat research defici address numer research project introduc inform document relat legal research solut document similar problem vector space cluster analysi classif descript content approach automat detect topic similar structur document collect map method shown legal applic peculiar legal domain creat special challeng statist characterist legal text form text corpora relev term occurr select label remain tricki lengthi argument rule court som automat access legal inform system adapt legal size map larg big document collect thousand court hierarch structur document archiv success layer detail view relev subset document task aim joint research som project focu project move automat classif index tradit map mean document repres map unit show mutual similar order map explor text repres text histogram word document segment part issu order cope legal document method properli describ common similar cluster descript effici evalu relev document collect feasibl grow hierarch som proven research paper address problem label som weaker cluster neighbour larger cluster train process larg neighbourhood rang dedic weight label strong cluster tend domin smaller result mislead descriptor extract unit show simpl addit phase end som train neg side effect elimin materi present remaind paper section give detail vector neural algorithm label descript unit section exposit train result provid section vector emploi map document document repres vector weight term frequenc tf idf weight scheme assign high weight valu word document collect order classif structur document split section treat independ piec inform classif process map neural network tool order data similar input item group spatial close consist layer input unit receiv input pattern propag set output unit output unit arrang common choic grid output unit assign weight vector learn unit highest activ level respect randomli select input pattern select adapt differ unit weight vector input pattern unit refer win winner short common choic comput activ level unit mark euclidean distanc input pattern unit weight vector adapt place train iter gradual reduct differ respect compon input weight vector amount adapt guid mean gradual train addit adapt number unit gradual neighbourhood winner train set unit winner tune present input pattern lead spatial arrang input pattern similar input map region close grid output unit train process result topolog order input signal spatial rang unit winner subject adapt mean neighbourhood function ci account distanc term output unit unit winner current learn iter order provid conveni interfac larger document hierarch prefer grow hierarch som extens som grow hierarchi individu map adapt size input space hierarch structur multipl layer layer consist independ grow map start map grow size order repres collect data level detail start initi row column unit ad area map input discrimin poor improv granular data unit repres data specif minimum level granular unit input data map expand form small som subsequ respect data repres detail newli creat map grow train process unit repres homogen set requir subsequ layer result fulli adapt hierarch structur inher alloc space inhomogen area input space challeng task label determin keyword input pattern map unit characterist cluster approach detail descript unit map label keyword document map unit achiev combin error featur rel import featur weight vector unit vector element set input vector map unit describ unit denomin common featur input pattern unit error vector small index term label unit index term deviat candid label specif problem document classif larg number featur document vector weight respect order avoid featur minim error introduc describ minimum weight vector element featur label experi test environ approach text collect import document european case law german french html format reason easier test german text collect document document permiss offic public european commun document improv grew size unit top layer reach hierarchi depth level maximum previou test feasibl classif label legal text corpora som extens experi text corpora document languag shown improv weight vector requir due legal document segment document split document result court cost disposit succe segment ground number paragraph due insuffici inconsist paragraph html sourc structur part segment part byte part smaller byte discard except disposit end document segment document number suffix indic structur part letter part segment repres document vector length word prior applic stem techniqu automat remov word document term weight tf idf weight scheme experi shown fine classif useabl insuffici label compar label manual produc list relev word describ cluster awar method evalu larger document collect commerci exploit exist challeng improv vector legal content qualit evalu standard ir evalu method recal unsuit exploratori data chosen socal delphi method lawyer review comput scientist assess qualiti label exampl map label describ qualit evalu focu exist potenti futur challeng experi grow hierarch som deal effect techniqu gener special legal classif classif label grow hierarch som show slight improv compar research circl detail evalu map overview document collect upper find case distinctli term content section document case found lower corner legal text make label legal document difficult task import word phrase long argu result low term frequenc import word phrase cluster strong influenc neighbour cluster influenc strong cluster strong cluster occur word high frequenc descriptor unit document strong neighbour procedur context neighbour cluster predomin effect label unit land ownership transfer act addit payment health scope legal social secur nation social reason domin li effect neighbourhood assur similar cluster locat unit form strong cluster input vector map select winner frequent train procedur tend strongli influenc weight vector neighbour unit lead wrong inappropri weight vector element select label neighbour unit due repetit win strong cluster stronger adapt weaker cluster win unit weaker cluster unit tend poorli repres data overcom addit commonli som train qualiti ad converg train procedur phase consist addit train cycl neighbourhood rang learn set unit neighbourhood weight vector subject set win unit weight vector converg data sampl map effect strong neighbour cluster revok result improv learn process deep exampl found qualiti label improv give label unit land ownership transfer act ownership transfer act basic label focu requir transfer land ownership examin except basic freedom free transfer capit term declar point treatment eu citizen resid declar affirm qualifi secondari suffici proof futur work establish import step research segment open door sophist analysi legal document part som capabl describ legal document account featur space show mutual similar ad phase end train domin strong cluster lead high improv qualiti label unit repres weaker cluster plan improv present tool segment success improv xml structur provid qualiti chang tradit tf idf vector modifi vector account descriptor legal thesauri step direct ontolog project acknowledg research support der research project offic public european commun provid document collect valuabl evalu work acknowledg refer ad knowledg learn algorithm index legal proc int conf artifici intellig merkl grow hierarch proc ieee intl joint confer neural network format topolog correct featur biolog vol larg document state proc int conf artifici neural network kaski map document approach interact proc int conf knowledg discoveri data mine connot analysi thesauri base interpret context int conf expert system text collect hierarch featur proc int acm conf inform retriev merkl explor legal text corpora hierarch neural guid tour public intern proc int conf artifici intellig classif lesson vol automat index abstract document kluwer academ rauber label proc int joint conf neural network rauber label selforgan make reveal proc pacif asia conf knowledg discoveri data rauber map organ document archiv subject make map proc int conf expert system automat text retriev inform legal knowledg kluwer law learn techniqu legal document proc int conf artifici intellig rauber remark vector legal proc dexa workshop legal inform system rauber text classif label european proc int conf artifici intellig st smith intellig legal legal text manag ai vol retriev legal ai vol visser intern workshop legal
ML/135 6 learn visual servo mobil robot chri luke fletcher alexand zelinski robot system laboratori depart system engin research school inform scienc engin australian nation act australia abstract reinforc learn algorithm appli visual servo task real mobil robot requir camera actuat model knowledg teacher control learn critic scalar reward learn algorithm handl continu valu state action learn good bad experi includ data gather perform unrel behaviour histor data result present introduct visual servo consist move part robot desir posit visual feedback basic build block robot behaviour target pursuit landmark base navig calibr gener requir achiev visual servo calibr time consum error prone process work show reinforc base learn elimin calibr process flexibl reinforc learn base control learn act bring case reward approach visual target smoothli control motor demonstr continu continu explor insensit reinforc learn algorithm learn real time visual servo mobil robot target explor insensit algorithm learn rang experi gather perform behaviour gener learn algorithm make behaviour servo figur nomad colour camera visual servo visual servo capabl manipul arm mobil robot visual servo requir abil track posit object control effector base feedback track area track process locat object success frame gaug result motion imag space imag captur region imag space store buffer templat compar video frame neighbourhood locat previou frame method measur similar imag cheng differ locat templat current frame match templat frame form vector motion target track templat start origin motion vector success frame ad failur track measur differ templat closest match current imag great basic approach control part visual posit base imag base gener requir form calibr posit base system error signal defin coordin system model describ relationship visual coordin coordin system requir learn model park system suitabl servo manipul joint angl defin posit effector imag base system error signal defin imag space imag jacobian relat desir increment chang imag actuat set learn approxim jacobian complic vari state approach learn direct map imag space state inform actuat command reinforc learn approach develop independ method achiev perform calibr system gain camera move actuat configur chang system work robot system architectur platform research nomad soni colour camera camera point forward downward robot nomad capabl translat rotat camera signal process fujitsu colour track vision card nomad card capabl perform sum absolut differ correl frame frame rate system architectur base behaviour base system cheng zelinski shown figur default behaviour free space search grid correl perform imag space imag carpet result binari matrix indic region ahead robot wander behaviour move nomad region carpet match figur target pursuit behaviour perform visual servo move robot object object identifi camera reinforc learn target locat target pursuit carpet grid wander actual veloc request veloc pid figur system behaviour model nomad figur typic camera view wander behaviour size squar repres differ carpet templat figur visual servo control reinforc learn interest carpet surround carpet interest object identifi target pursuit behaviour domin servo target begin target lost wander resum target pursuit wander creat forag behaviour work replac hard wire target pursuit behaviour learn visual servo behaviour behaviour gener translat rotat veloc target home coordin imag space world monocular camera make assumpt target close floor level target track floor level object fairli uniform vertic templat track slide upward erron data regard form learn process reinforc learn learn system requir form map includ visual actuat command learn approach requir model perform limit abil teacher reinforc learn requir scalar reward base behaviour introduct reinforc learn method provid critic requir measur task achiev task reward signal immedi action true effect action manifest time case reward neg distanc track current desir posit punish energi larg motor command behaviour improv base knowledg action led reward punish good bad experi valuabl part learn process popular reinforc learn flexibl learn action histor data abil call prefer term learn speed improv gather data control complet separ visual servo task work increment updat expect valu action state action assign function reward action expect reward futur base state result action express α γ max expect perform action state α learn rate control converg γ discount factor discount factor make reward earn earlier valuabl receiv implicitli describ action highest continu state action method understood discret case state action symbol numer real command motor concern lead state poor scale number state poor control continu state action qlearn method briefli earlier work method jordan continu continu action reinforc learn algorithm base artifici neural network combin interpol appli approach simul task combin neural network interpol hold action state input neural network state output set real valu action valu sampl interpol action baird describ suitabl interpol scheme call work combin memori base reinforc learn neural network function move squar close relat function combin action expect sampl function lim ˆ ˆ real feed state neural network carri action highest store result chang state state neural network valu chosen action state calcul estim current reward state conveni state neural network wire fitter updat estim calcul valu produc train neural network output conveni neural network wire fitter train valu figur learn procedur step real step opportunist wire total number state ith action qi ith action action vector small smooth factor ɛ avoid action vector number continu variabl action function properti make interpol implement updat requir calcul quickli function argmax calcul quickli action carri properti interpol highest interpol coincid highest valu interpol action highest input action action suffici propag state neural compar output find action requir calcul forward pass neural network work scatter data remain matric requir interpol wire influenc area wire averag wild extrapol occur suffer unlik polynomi scheme partial deriv term point quickli calcul partial deriv error output propag neural network chain rule train procedur shown figur train singl hidden feedforward neural network increment backpropag learn rate constant suggest experi buffer replai repeatedli advantag learn problem singl suboptim action prevent high action carri time action state action time step carri back approxim continu state action approxim power repres valu state action state rel valu action poorli result unsatisfactori control compound time interv control action smaller advantag learn address issu action similar differ action advantag learn optim action lesser action scale factor make effici approxim resourc equat advantag learn updat quantiti analog γ max max simul experi advantag learn improv converg speed reliabl target visual coordin target visual coordin figur target trajectori result system section task robot learn visual servo target object center lower half visual field figur show sequenc video sequenc target select interest oper case soccer ball tabl show action reward reinforc learn algorithm learn visual servo reward function includ term punish energi reduc reaction minor target posit due track learn data reward hundr gather wander rest gather attempt servo target learn algorithm process experi increment abil servo target figur show trajectori target visual state pixel error target pixel veloc target translat rotat veloc robot action command translat rotat veloc robot reward movement target save energi smooth motion tabl learn specif visual servo target visual coordin target visual coordin command rotat command translat figur step motor command ag space step motor command shown figur robot successfulli learn servo target learn behaviour turn target drive forward target goal posit robot learn target closer goal locat import state accur complet earli veloc robot state inform learn fail case analysi data show restrict differ current state order system result state inform simpli filter effect correl command chang state gather data perform benefici robot long period learn begin move servo behaviour part built wander wander behaviour move robot learn servo behaviour move robot backward target close robot flexibl learn import characterist system real world applic visual servo perform adequ minut real track frame perform continu improv hour robot learn servo object posit visual field experi repeat camera necessit strategi order reach goal result similar term step learn time demonstr visual servo behaviour real mobil robot learn trial error reinforc learn calibr requir distinct featur reinforc learn algorithm abil continu state futur work attempt develop learn behaviour acknowledg visual servo softwar base work gordon cheng correl softwar develop jochen real time face track refer baird harri reinforc learn continu action technic report wright fuzzi approach fuzzi dynam program proc ieee int conf fuzzi ieee comput press jl jp neural model visual servo robot manipul proc symposium optim comput engin system applic cheng zelinski visual behaviour navig mobil robot proc intern confer intellig robot system volum osaka chri david alexand zelinski continu state action space proc australian joint confer artifici decemb lectur note comput chri david alexand zelinski reinforc learn appli control autonom underwat vehicl proc australian confer robot autom manc harmon baird residu advantag learn appli differenti game proc intern confer neural washington visual servo system base neural network proc american control jochen alexand zelinski robust face track gestur recognit proc int joint conf artifici hosoda asada versatil visual servo knowledg true jacobian proc intern confer intellig robot system tutori visual servo control ieee transact robot octob mi jordan ra jacob learn control unstabl system forward model proc advanc neural inform process system san peter lancast curv surfac introduct academ wai lo robot visual servo control proc twelfth intern confer robot factori park se young dynam visual servo control robot manipul neural network journal korean institut telemat richard sutton andrew barto reinforc introduct bradford asada continu valu behavior proc intern confer multisensor fusion integr intellig christoph watkin peter dayan technic learn machin wu stanlei modular servo network proc ieee intern confer robot autom
ML/136 6 interpret classifi norbert gr depart comput nichola poland abstract machin learn method frequent creat classifi continu featur linguist variabl condit rule defin membership function linguist variabl optim level singl rule set rule assum gaussian uncertainti input valu accuraci predict estim probabl class detail interpret relev rule confid interv real life interpret person disord approach optim interpret applic system introduct applic classifi creat start machin fuzzi logic neural network method number rule small accuraci suffici high classifi optim reason easili verifi crisp logic rule desir drawback crisp rule class identifi correct provid pictur reliabl crisp rule reject case unclassifi cost function base number error made crisp rule classifi lead difficult optim optim method problem overcom continu membership function lead fuzzi crisp rule fuzzi rule disadvantag crisp involv number paramet determin posit shape membership function avoid system base fuzzi logic frequent fix set membership predetermin shape defin linguist variabl amount effect regular partit input space convex region approach suffer linguist variabl dimens number input combin fuzzi rule simpli pick area input space vector singl class possibl adapt membership function individu cluster singl rule fuzzi rule optim descript cluster result obtain linguist variabl issu interpret result obtain classifi interpret crisp rule straightforward fact mislead small chang singl featur lead sudden chang predict class interpret crisp rule stabl small perturb input valu fuzzi rule respect estim probabl class chang smoothli problem tradeoff fuzzi remain membership function fuzzi class similar crisp perturb input vector significantli chang classif size perturb rang accuraci measur input valu believ predict result explor altern class case danger rough rule suffer interpret problem greater rough classifi produc larg number unstabl rule import biggest advantag classifi practic reliabl interpret set rule simpl solut problem face crisp fuzzi classifi appli data continu featur present paper neural method rule extract data previou public assum small number crisp logic rule found section optim applic set logic rule section deal detail interpret rule condit fourth section illustr optim interpret rule data problem paper finish short discuss applic optim classifi complet methodolog rule extract data select linguist variabl case featur linguist variabl true input linguist variabl interv valu extract rule data machin learn statist techniqu optim linguist variabl extract rule explor rate tradeoff repeat procedur stabl set rule found optim linguist variabl minim number wrong predict matrix classifi simultan maxim predict power classifi interv model minim constraint cost function tr paramet γ determin tradeoff reliabl reject rate vector set rule lower reliabl larger number lower reject rate set rule higher reliabl larger reject rate depend discontinu paramet minim formula requir minim method real input valu obtain measur carri finit natur assum crisp number gaussian distribut center xi perform mont carlo sampl joint gaussian distribut continu featur gx input vector select classifi assign class vector averag result comput probabl sx defin volum input space influenc comput probabl assum uncertainti si constant independ featur valu xi simplif singl featur xi good approxim rule true fulfil gaussian number gx β defin slope logist function larg probabl significantli interv crisp logic rule data gaussian distribut error fuzzi rule membership function defin differ crisp input slope membership determin paramet proport uncertainti input neural network approach rule extract membership function comput network uncorrel input featur xi probabl satisfi rule defin product probabl ri rule extract method produc simpl rule depend featur singl product good approxim problem occur probabl belong class rule estim rule overlap subset featur condit exclud sum normal probabl obtain class give result real mont carlo probabl avoid problem probabl calcul rc set classif rule class set subset number element uncertainti si featur data depend valu xi classif probabl case base direct calcul optim membership function linguist unit neural network lr architectur provid membership relat slope β input uncertainti calcul probabl agreement mont carlo sampl network rule node comput normal ij ij ij ij set indic featur rule combin rule separ set rule indic class probabl class vector probabl class vector rule ri optim model center slope backpropag gradient descend algorithm perceptron network kalman filter approach neural network probabl depend continu linguist variabl paramet rule system error depend gaussian uncertainti input paramet function full optim membership function perform matrix comput probabl error count optim eq method minim perform directli present neural network problem special network architectur uncertainti si valu featur treat addit adapt paramet optim assum uncertainti si percentag rang xi valu optim reduc minim error function approach lead import improv crisp logic rule preserv give maxim probabl class obtain uncertainti input si provid addit adapt paramet gradient method optim larg set rule rule wider classif margin overcom brittl problem wide classif margin desir optim placement improv result test set vector unknown class typic class ck uncertainti si xi input reason time real estim probabl significantli case close class border detail analysi influenc featur classif probabl perform confid interv probabilist confid interv logic rule replac confid interv probabilist confid interv confid interv calcul individu input vector logic rule extract train set interv analysi rule interpret case vector highest probabl found class function equal index probabl class input vector confid interv min featur xr defin min min max max confid interv measur maxim deviat chang probabl classif vector assum featur valu unchang vector li class border confid interv vector typic class confid interv wide probabilist interv confid win class probabl probabl altern min min ρ max max ρ ρ factor determin confid level observ confid interv level ρ inform comparison probabilist interv win class altern class estim likelihood win class method escap danger relai border logic rule assum featur held constant case probabl featur displai fig solid curv probabl win class defin class chang valu dot curv probabl probabl altern class class determin point dash line present probabl km probabl altern class class index km chang probabl carri inform case show stabil classif perturb featur import altern class neighborhood input theoret idea develop expert system support psycholog descript data test focu interpret result coeffici calcul analysi answer give normal displai histogram coeffici measur consist answer number find coeffici form clinic develop measur tendenc valu scale interpret strong worri lead work case belong class drug organ person crimin tendenc determin expert case class rule gener classif tree good classif system gener logic featur space map neural network system easiest complex data result accuraci gener set rule statist estim gener crossvalid gave correct answer fsm unoptim correct answer fuzzif improv fsm crossvalid result summari result tabl accuraci refer accuraci result neural network model group obtain accuraci crossvalid compar tabl comparison result data fuzzi accuraci refer result optim uncertainti result function obtain dataset system crisp rule accuraci fuzzi accuraci women women fsm women men men fsm men rule accur data uncertainti measur scale gaussian center measur valu larger order lead number classif error origin crisp provid softer evalu assign probabl class cover slightli fuzzifi rule input vector case difficult fig influenc grow uncertainti present top plot show profil gaussian curv attribut occur rule classifi case standard deviat attribut equal time rang standard deviat equal time rang box featur present probabl belong singl rule bottom plot show analog properti rule classifi class figur show probabl depend assumpt data uncertainti chang input uncertainti strong influenc probabl win class detail analysi contrast classifi focu singl featur estim condit probabl classifi figur show probabilist interv confid patient scale featur squar fig rule appli case small larg uncertainti fig probabl class rule assum uncertainti percentag total rang featur valu show probabl win class measur input valu scale figur present easi larg probabl case altern class rang shown altern class featur confid interv broad classif depend valu featur featur altern class rang valu set fig simpl winner probabl altern probabl analysi plot show valu scale close border probabl probabl probabl probabl probabl probabl probabl assess sincer state featur detect subtl trial profil featur featur depress featur norm featur featur probabl probabl probabl probabl probabl probabl detect atyp deviat answer style featur featur featur featur featur featur fig altern probabl probabl probabl probabl probabl probabl assess sincer featur detect subtl trial profil featur depress featur featur featur crimin crimin featur probabl probabl probabl probabl probabl probabl detect atyp deviat answer style crimin featur featur featur featur featur featur fig altern discuss machin learn commun artifici case symbol attribut defin real data mine problem attribut present larg set rule classifi rule stabl suffici simpl understood classifi unstabl lead rule significantli train set slightli chang rule inform fact mislead stabl robust rule found user warn potenti probabl classif possibl influenc featur classif probabl paper optim interpret set rule method specif fuzzif crisp membership assumpt uncertainti input analysi chang probabl classif chang uncertainti estim confid perform system confid low detail analysi influenc featur classif probabl start probabilist confid interv appli classif estim enabl detail interpret case practic applic user interest relev featur rare satisfi answer question base quotat complex set logic rule similar altern system import logic descript understand altern classif method support grant gratefulli acknowledg refer gr methodolog optim applic crisp fuzzi logic rule ieee transact neural network gr methodolog optim applic logic rule intellig inform system pp gr extract logic rule backpropag network neural process letter gr neural optim linguist variabl membership function int confer neural inform process nov vol pp breiman instabl stabil bishop neural network machin learn springer verlag neural transfer function neural comput survei statist control network classif int conf artifici neural switzerland pp springer verlag neural network applic classif medic data phd thesi depart comput nichola poland gr neural method analysi data proc applic neural network sept pp march isbn quinlan jr program machin learn san morgan kaufman featur space map adapt comput physic commun develop featur space map model conf neural oct pp
DB/137 3 fulli dynam index structur data martin kriegel institut comput munich germani ester kriegel compani recogn strateg import knowledg hidden larg built data updat collect appli data period batch night deriv inform index structur updat standard approach bulk increment updat data averag runtim singl updat small total runtim batch updat larg content data date introduc fulli dynam index structur data model data cube index structur design applic drawback bulk updat approach critic hierarch index structur similar exploit concept hierarchi typic defin dimens data cube minimum describ set partial order attribut valu induc concept hierarchi minimum bound rectangl artifici total order minimum describ set directori valu measur attribut materi conduct extens perform evalu benchmark data result demonstr yield compar sequenti search process gener rang queri data cube introduct compani recogn strateg import knowledg hidden larg built data data collect data multipl integr common repositori extend summari inform aggreg primarili organiz make data cube model data relat implement data cube consist independ group depend attribut call measur data cube view arrai cell measur respect typic queri data cube involv lot tupl tend common approach materi result relev queri order queri process fail dynam environ queri advanc number queri larg environ gener rang queri support rang queri specifi contigu rang dimens data cube appli aggreg oper set select cell index structur data store deriv inform effici support gener rang queri data updat immedi insert delet oper occur updat collect appli data period batch night deriv inform updat updat effici finish user morn due larg size highli desir perform updat increment approach bulk increment averag runtim updat total runtim batch updat larg larg cube big problem simpli mere bulk increment updat requir time window data olap global compani branch data hour dai content data date critic dynam applic stock market www introduc fulli dynam index structur data avoid drawback index structur design applic drawback approach critic hierarch index structur similar exploit concept hierarchi typic defin dimens custom store paper organ section discuss relat work section present concept section discuss major algorithm construct queri conduct evalu report section section summar contribut paper outlin direct futur research relat work briefli review relat work area data wareh area spatial index structur data cube introduc model data defin independ depend attribut call measur cell data cube measur respect subset data cube materi queri process present effici algorithm select optim subset cell materi set relev queri organ lattic framework assum queri answer smallest materi queri queri deriv consid answer queri combin materi queri type queri support restrict approach initi load support increment dynam updat data index structur effici process queri data bitmap indic popular context bitmap leaf page index structur list record id bit vector bit data record bit vector effici support set oper union intersect discuss type bitmap index structur suitabl queri type introduc bitmap join indic precomput binari join data bitmap static insert data record index entri updat index structur build secondari indic impact cluster show poor perform rang queri data cube index structur data cube develop introduc gener entri node consist descript materi maximum measur index structur effici support queri return maximum measur rang appli queri type queri return sum measur rang queri data prefix sum data cube precomput queri answer access small number depend size data cube prefix sum data set found prefix sum comput region manag minimum bound prefix sum point region store perform result report introduc extend datacub model repres data cube underli relat data uniform map realiz collect pack algorithm present perform bulk increment updat set increment updat sort complet rebuilt mainten evalu demonstr support rang queri effici bulk updat experi show requir time high due huge size data cube optim techniqu explor reduc problem applic requir manag spatial data line polygon note space interest abstract real space part surfac earth space featur vector describ object applic order speed queri process spatial spatial index structur develop restrict search relev part space gener data manag hyperrectangl numer kei organ extend object polygon minimum bound rectangl approxim point object special case rectangl answer rang start set mbr intersect queri rang determin referenc child node search data page reach overlap mbr directori node grow dimens spatial index structur effici moder valu index structur design effici larg valu includ algorithm find split concept iea larg directori node variabl size multipl usual block introduc standard topolog split properti mbr extens partit dead result high split algorithm find split determin base split histori point split number mbr result partit threshold split unbalanc split algorithm termin provid split current node extend standard block size case occur exist extend addit block introduc structur similar normal directori node usag index data mbr replac describ discuss topic explain integr concept hierarchi concept hierarchi data cube consist function group depend attribut call measur data cube view arrai cell measur respect function attribut dimens multipl attribut organ hierarchi schemata concept instanc hierarchi schema figur show dimens custom function attribut nation custom id root concept hierarchi denot union valu concept hierarchi hierarchi schema dimens custom region nation custom id figur hierarchi schema concept hierarchi dimens custom defin partial order dimens concept hierarchi partial order import split algorithm definit definit introduc notion concept data cube formal definit partial order conceptu hierarchi dimens custom di set attribut valu di concept hierarchi di tree node tree repres element di root repres special edg tree repres relationship connect node europ germani di partial order di defin equal son concept hierarchi dimens definit data defin datacub domain di measur dd ℜ element datacub call data record form ad xm ai xj ℜ concept hierarchi figur germani europ hold problem insert tv tv vcr vcr soni tv soni tv soni vcr soni tv soni tv total order soni tv tv soni vcr vcr soni tv vcr product tv vcr partial order figur total order partial order product problem equal treatment attribut tv soni vcr vcr vcr order appli spatial access method index data defin arbitrari total order dimens advantag partial order compar total order illustr figur dimens product total id assign singl product problem occur product insert tv receiv natur fit attribut treat equal total order order figur prefer rang queri make product type partial insert product leaf concept hierarchi organ set structur prefer rang queri product rang queri make answer effici leaf set hierarchi store concept hierarchi dimens assign id attribut data record insert assign perform avoid storag long defin total order note manag concept hierarchi dynam concept hierarchi updat insert depend id insert data empti empti concept hierarchi dimens id height id figur structur id definit id depict figur highest bit defin height id concept hierarchi dimens distinguish id level id fix length requir byte repres concept hierarchi mean dictionari store id father id concept hierarchi dimens custom figur data record includ nation custom id assign id updat concept hierarchi dimens custom minimum describ set minimum bound rectangl approxim method figur demonstr fact partial order dimens arbitrari total order dimens indic valu ai bj lefthand side tradit assum total order dimens suffici definit mbr includ attribut hold dimens partial order describ mbr mbr righthand side figur data record approxim md attribut valu occur data record includ definit md part set md md cover dead space mbr md store inform variabl size md defin definit describ data cube dimens di set data record ad xm ai xj ℜ minimum describ set sequenc md mi di satisfi ad xm mi ai mi ni di satisfi properti mi ni mi ni set id specif function attribut dimens assign examin data record assign id chapter data cube dimens supplier time distinguish data record md singl data record attribut valu lowest level concept hierarchi dimens sampl data md md approxim directori node valu higher level concept figur sampl mbr md md element sampl data record measur measur attribut data cube measur part relat store md node measur md directori node aggreg sum measur valu data record cover md definit introduc notion essenti algorithm definit data cube dimens di md mi di ni di denot cardin set dimens mi ni mi ni volum denot defin mi overlap denot defin mi ni extens denot defin note oper overlap extens dimens element mi ni belong level concept hierarchi union american custom north america make fix storag entri complic mbr structur directori node illustr figur header directori entri consist pointer son node pointer md header md measur valu node entri mi ni entri figur structur directori node directori node fix header directori node variabl size node extens md number entri node assur balanc directori split initi split son node directori node split extens md capac make directori node extend exist algorithm present major algorithm construct queri insert algorithm similar develop complet split algorithm measur valu build queri tree insert mention insert algorithm differ algorithm figur show insert procedur directori node data record insert assign id attribut valu measur updat measur directori algorithm select son data record insert follow split result directori node son split algorithm directori node call success split int insert updat measur directori follow follow insert follow split insert capac reach split split return return return figur insert algorithm directori node creat brother directori node split creat directori node enlarg split unlik insert procedur split algorithm common algorithm exploit partial order induc concept hierarchi algorithm directori node illustr split procedur figur directori split run find split examin dimens split found dimens left dimens level concept adapt entri md directori case balanc node overlap found split found creat figur split algorithm directori node algorithm start select split dimens hierarchi level element md dimens induc balanc structur algorithm select dimens highest hierarchi level element md md dimens dimens attribut valu lower level concept dimens select split dimens directori entri adapt md directori node reason procedur li constraint oper chapter entri node compar dimens element level concept hierarchi md directori node entri directori node section directori md choic adapt modifi chosen split dimens paramet hierarchi algorithm section result group group unbalanc overlap dimens select split found creat hierarchi split hierarchi split base quadrat split initi develop variant idea algorithm split group mbr subgroup subgroup remain mbr insert criteria volum result group run loop consid remain mbr runtim algorithm quadrat split pair comput cover pair largest md remain exist comput extens group split dimens remain md largest differ extens group split insert md group result overlap resolv ti extens resolv ti volum figur hierarchi split hierarchi split shown figur basic structur origin quadrat split seed chosen form initi group algorithm run algorithm make md insert group md made split dimens split split dimens obtain group disjunct attribut valu split dimens algorithm paramet split dimens mbr insert chosen largest differ extens group criterion applic hierarchi split algorithm figur consid extens group split dimens select group md md group share attribut valu split dimens result group disjoint attribut valu split dimens base extens volum order chosen md insert group result overlap group overlap extens consid volum volum group chosen rang queri demonstr make measur valu store entri discuss rang queri algorithm directori node figur queri rang algorithm doubl result directori entri dimens md entri level current adapt md lower level higher overlap md entri empti md entri result measur result entri return figur rang queri algorithm rang queri algorithm run entri directori node make compar similar split algorithm figur case higher level attribut valu overlap md entri entri relev queri result remain analyz overlap md entri fulli measur store son node referenc current directori ad result advantag entri node entri consid algorithm simpli measur comput insert md entri rang overlap measur call rang queri son node case aggreg sum algorithm aggreg averag count treat perform evalu demonstr perform index realist data cube outlin advantag compar sequenti search analyz test environ gener queri illustr test environ perform test tpc benchmark intend data cube creat sql select oper output oper time part year month supplier extend price nation figur scheme brand type order custom store function insert file index structur compar attribut import perform schema simplifi figur result data cube consist part time figur data record attribut organ hierarchi schemata illustr figur attribut measur attribut extend price custom supplier region region nation market segment nation custom brand part type brand type part figur dimens test datacub nation supplier year time month year month gener rang queri evalu gener rang queri process queri sequenti search import figur show algorithm gener rang queri rang md algorithm level concept hierarchi dimens set md dimens assign size rang size limit select select involv attribut valu chosen level dimens attribut valu randomli chosen gener rang queri develop mbr concept hierarchi exist rang queri algorithm test assign dimens level concept hierarchi figur show fourteen dimens hierarchi level dai number queri execut randomli level concept hierarchi select comput percentag valu chosen randomli select chosen number hierarchi valu dimens chosen level store result figur gener rang queri total order id assign attribut valu insert procedur section convert compar index structur total order dimens index structur partial order dimens sequenti search gener algorithm figur rang queri algorithm simpli run exist data record determin data record posit measur data record ad result result present result comparison sequenti search size underli test data cube rang data record data record insert time time rang queri analyz select custom supplier part time brand type year month figur dimens test datacub measur figur show insert time data record store concept hierarchi comput insert time significantli lower figur depict insert singl data record hp workstat megabyt ram hp ux dynam insert data record impact runtim data reason time minut insert time number data record figur insert time insert time data record test rang queri select perform compar effici sequenti search figur show compar test select comparison sequenti search select time queri determin averag random queri assur fair main memori restrict memori size perform test rang queri execut faster compar index structur obtain rang queri compar absolut number figur rang queri select answer faster reason fact li level complet answer rang queri perform cost execut rang queri larger larger queri higher probabl md entri fulli queri md larger number data record time queri averag select number data record time queri averag select time queri averag select figur queri time queri higher level rang queri answer materi measur larger queri md yield perform larger queri md involv comput larg md consist larg set singl dimens queri rang queri select gener small answer queri high level queri rang queri select involv rang queri select perform test number data record number data record time queri averag select number data record seq search comparison sequenti depict figur show sequenti search reason altern select worst case obtain rang queri compar sequenti search data cube quickli popular model data index structur store deriv inform effici support gener rang queri data cube updat collect appli data period batch night deriv inform updat standard approach bulk increment updat data drawback averag runtim updat total runtim batch updat larg content data date introduc fulli dynam index structur data index structur design applic drawback wellknown approach critic hierarch index structur similar exploit concept hierarchi typic defin dimens data cube minimum describ set partial order attribut valu induc concept hierarchi minimum bound rectangl artifici total order minimum describ set directori valu measur attribut materi perform evalu benchmark data demonstr compar sequenti search process gener rang queri data cube futur work includ issu split algorithm split algorithm altern split algorithm investig quadrat cost yield good split data cube typic implement relat dbm integr commerci dbm evalu perform context acknowledg sander fruit discuss earli phase project refer berchtold keim kriegel index structur proc int conf larg data pp grai bosworth layman pirahesh relat aggreg oper gener proc int conf data pp overview data wareh olap acm sigmod record march access acm comput vol pp guttman dynam index structur spatial proc acm sigmod int conf manag pp ho agraw megiddo srikant queri olap data proc acm sigmod int conf manag pp harinarayan rajaraman ullman data cube proc acm sigmod int conf manag pp data wareh proc int conf larg data pp mumick quass mumick data cube summari tabl proc acm sigmod int conf manag pp graef join bitmap join sigmod record pp quass queri perform variant proc acm sigmod int conf manag pp roussopoulo kotidi roussopoulo organ bulk increment updat data proc acm sigmod int conf manag pp transact process council benchmark
ML/138 6 introduc advantag select stephen chen stephen smith robot institut robot institut carnegi mellon carnegi mellon forb avenu forb avenu pa pa abstract crossov framework defin crossov preserv maxim common schema complet solut construct heurist step form select form select isol geni random parent select gener replac geni includ select theoret analysi show construct heurist geni potenti converg optim solut result show effect practic construct heurist amplifi restart shown common hypothesi common solut averag common schemata identifi select uniqu advantag crossov enjoi mutat introduct basic featur genet algorithm popul crossov select proport fit schemata popul process exploit exist knowledg crossov recombin schemata explor occur combin view primari mechan advantag crossov crossov combin correct schemata problem specif heurist incorpor crossov oper enhanc explor nearest neighbor travel salesman problem fit schemata short select directli crossov crossov framework present model design crossov oper defin crossov preserv maxim common schema complet solut construct heurist model common hypothesi suggest schemata common solut averag believ common schemata solut observ fit common hypothesi attempt explicitli identifi good schemata offspr inherit parent combin lead schemata enter offspr good qualiti uncommon schemata oper preserv common schemata solut complet heurist gener schemata design action step common schemata select form select easili observ heurist construct solut common schemata higher ratio fit schemata complet solut higher ratio benefici restart construct heurist partial solut common schemata construct heurist effect restart point start proport fit schemata offspr higher parent isol form select heurist geni algorithm develop geni random parent select gener replac scheme select parent offspr fit select proport fit schemata popul effect construct heurist improv effect call potenti benefit select oper identifi preserv common schemata standard crossov evolutionari algorithm crossov genet algorithm benefit newli introduc form select theoret result geni demonstr select usefulli identifi schemata exploit common hypothesi common solut averag remaind paper present section intuit argument preserv common schemata present section argument formal ideal construct heurist section geni algorithm defin section ideal construct heurist max problem present section construct heurist travel salesman problem heurist examin section select compar random restart section implic theoret result discuss final present section reason preserv common schemata construct heurist increment build solut step time heurist make correct incorrect assum correct correct schemata qualiti solut vari number number correct improv qualiti final solut assum construct heurist make correct incorrect constant ratio number incorrect made construct heurist start partial fewer step heurist make incorrect partial start solut higher proport correct construct heurist final solut higher proport fit schemata solut construct scratch construct heurist effect partial solut high proport fit schemata common schemata heurist construct solut partial solut high proport fit schemata nearest neighbor construct heurist tsp heurist start random citi travel nearest unvisit citi step nearest neighbor select short myopic long edg figur nearest neighbor solut uncommon edg tend cross edg parent parent common uncommon select compar select short select long edg depend start citi nearest neighbor tour short long edg figur partial solut common edg higher ratio short long edg complet nearest neighbor solut theoret perform measur potenti assum construct heurist select correct schemata schemata part optim probabl incorrect schemata probabl heurist gener initi solut expect proport correct proport incorrect schemata random parent tabl show expect distribut uncommon schemata parent pair initi popul common ratio correct incorrect schemata construct heurist select correct schemata incorrect schemata partial solut expect higher ratio correct incorrect schemata solut initi popul exploit schemata achiev select proport correct schemata initi popul proport incorrect schemata extend assum construct heurist heurist oper crossov framework ga random parent select gener correct schemata gener common correct schemata gener correct schemata select construct heurist gener assum constant proport correct schemata gener construct heurist expect proport correct schemata gener repres proport correct schemata gener equal requir converg solut popul converg figur effect construct heurist amplifi select effect call heurist amplif construct heurist complet solut start common schemata parent tabl expect distribut schemata random parent pair initi popul correct incorrect correct common correct uncommon incorrect uncommon common incorrect xc figur expect proport correct schemata gener crossov oper encapsul ideal construct heurist geni algorithm mimic develop theoret geni algorithm defin random parent select gener replac scheme stai close parent mate random gener theoret result impli infinit max experi correct gene allel trivial heurist max select select allel probabl probabl heurist ideal step constant probabl correct heurist common heurist oper implement geni max problem result geni match theoret expect popul size solut figur result experi trivial fit deriv construct heurist ideal travel salesman experi travel salesman problem benchmark combinatori optim problem object find shortest hamiltonian cycl complet graph node feasibl tsp solut constraint node visit construct heurist constant perform ratio maintain correct disallow step heurist nearest neighbor heurist neighbor oper implement geni result disappoint geni demonstr heurist initi surplu reduc start solut final solut tabl number edg determin solut qualiti length incorrect edg import start partial solut short edg necessarili reduc tendenc nearest neighbor result suggest nearest neighbor weak heurist ideal figur expect observ result ideal construct heurist max gener gener figur convex hull heurist arbitrari insert construct heurist tsp insert heurist effect start convex hull random node convex hull partial solut correct maximum partial order largest partial solut insert extend accumul inform figur restart arbitrari insert maximum partial insert heurist oper develop implement result surplu reduc start solut final solut tabl arbitrari insert ideal construct heurist perform constant common restart amplifi effect select identifi schemata higher fit convex hull inform accumul geni difficult geni random restart argu geni fact crossov differ random restart construct heurist heurist crossov oper partial solut restart demonstr advantag provid partial solut chosen run geni trace run tsp averag length gener offspr record gener figur size partial solut preserv select grow rapidli gener averag qualiti solut gener geni improv steadili gener phase converg phase begin degrad solut qualiti baselin gener random restart insert convex plot convex hull static accumul inform previou solut inform solut tabl result geni popul size equal problem size initi popul nn start element valu percent surplu optimum averag run gener instanc size avg nn start tour avg tour averag tabl result geni popul size initi popul ai solut start convex hull valu percent surplu optimum averag run gener instanc size avg start tour avg tour averag parent parent convex hull qualiti improv time result demonstr differ random restart restart partial solut chosen select discuss select isol discoveri introduc advantag crossov genet algorithm suggest mean effect practic construct heurist role select standard crossov algorithm popul select genet algorithm crossov regard distinguish featur algorithm critic search advantag provid crossov attribut mechan combin difficult quantifi advantag practic figur benefici mutat mutat restrict uncommon schemata shown oper combin order crossov improv redesign preserv common schemata current guidelin design recombin oper suggest common compon preserv action crossov emploi select parent fit random bit select mutat benefici mutat mutat common schemata remain uncommon bit tabl benefici mutat mutat benefici mutat common schemata preserv figur crossov view structur mutat benefit select heurist effect select isol geni result valid common common solut averag identifi common oper emploi abil enhanc select select uniqu advantag crossov enjoi mutat heurist amplif common hypothesi perform heurist gener figur comparison select random restart gener parent parent uncommon uncommon intellig incorpor heurist failur behavior heurist unpredict unpredict make mistak independ produc separ applic uncommon label potenti mistak common made reason heurist act intend common averag uncommon averag confid measur amplifi effect construct heurist unlik random restart heurist oper select identifi partial solut accumul construct heurist ideal develop final solut partial solut problem domain random restart construct heurist primari optim restart heurist effect select fundament evolutionari includ genet algorithm crossov framework suggest common schemata preserv form select theoret result demonstr form select capabl identifi schemata effect select isol genet algorithm includ select select present advantag oper crossov oper mutat acknowledg work paper sponsor part advanc research project agenc rome air forc materi grant number cmu robot institut govern author reproduc distribut reprint notwithstand copyright annot thereon view author interpret necessarili repres offici polici express advanc research project agenc rome laboratori govern refer chen sf smith common sequenc genet program annual confer chen sf smith back genet algorithm role crossov hybrid foundat genet algorithm banzhaf ed morgan kaufmann davi adapt algorithm proc ninth intern joint confer artifici intellig davi handbook genet algorithm van nostrand reinhold lj ke jd schaffer control foundat genet algorithm belew ed morgan kaufmann van gucht algorithm travel salesman proc intern confer genet algorithm applic goldberg genet algorithm machin learn holland adapt natur artifici system michigan press nj radcliff analysi random respect proc fourth intern confer genet algorithm travel comput solut tsp applic crossov genet proc intern confer genet algorithm
HCI/139 4 framework activ space fabio kon christoph manuel roi campbel denni depart comput scienc illinoi introduct mobil comput activ space part revolut inform technolog mobil comput includ system digit cellular trac control inform simpl web wireless connect activ space consist physic space lectur meet train citi augment comput devic integr environ object devic provid inform obtain inform user perform activ perform perform convent activ easili multimedia interfac plai fundament role interact applic gradual abandon interfac base text static graphic move interfac dynam base anim expect migrat servic radio tv person video wall distinct data network distinct comput dedic radio receiv integr extens todai internet dynam natur resourc contribut dynam comput environ environ mobil activ ubiquit multimedia present scienc ction stori mind scientist mark weiser realiti import challeng pose proper manag dynam futur comput system con gure adapt environ execut react environ dynam recon gure function good research support nation scienc grant fabio kon support part grant brazilian research irrespect modi cation environ applic system react variat resourc avail dynam adapt updat part replac softwar compon exist softwar infrastructur prepar manag environ properli convent oper system hard time manag static environ base compon microsoft research awar dicult instal softwar nt manag problem compon induc system administr clean upgrad softwar execut user execut run version execut crash ectiv manag gener environ ubiquit comput requir architectur model oper system middlewar illinoi develop gaia oper system activ space paper describ requir face system integr architectur meet requir paper activ space standard trade mechan framework manag heterogen devic oper system activ space tradit oper system softwar manag resourc gaia softwar manag resourc activ space run top tradit kernel middlewar layer er requir distribut servic classifi requir oper system activ space categori rst requir found modern distribut environ requir address research oper system discuss section includ requir directli relat physic natur activ address theme ongo research gaia discuss section gaia oper system oper system develop support scalabl comput system support optim system provid support easi distribut resourc automat con dynam recon secur qualiti servic promot omg standard servic trade de ning servic omg idl distribut commun perform standard corba client commerci open sourc orb interact system exibl requir distribut object ectiv orb provid support dynam gure orb intern engin accommod environ machin limit resourc tini orb deploi achiev memori footprint vari kb dynam softwar evolut facilit design mechan automat con gurat system applic softwar assembl runtim meet dynam requir environ automat con gurat servic conjunct distribut resourc manag servic monitor servic environ servic provid solid basi construct adapt servic applic base underli dynam resourc user system instanti user applic select download repositori enhanc usabl reliabl design includ mechan provid qualiti servic secur privaci physic oper system control activ space provid function system includ servic manag physic space system achiev gaia design incorpor enhanc feder corba server maintain imag structur physic space refer object di erent space group space feder corba trader manag object physic space comput framework repres manag heterogen devic distribut activ space system locat servic maintain inform physic locat entiti move space frequent human gaia incorpor mechan visual adapt network power manag mobil render realist model repres physic space physic structur activ space repres system feder server server partit system partit subdivid smaller unit repres corba context space context repres region citi block organ hierarch context refer trader object devic insid physic space trader feder replic figur screen shot servic browser show sampl space illinoi digit comput lab build figur show trader room locat oor build client applic refer figur hierarch organ activ space trader inform object room omg standard trader constraint languag user request list workstat room execut cpu free ram send queri linux workstat object type processor os static properti object processor util ram free dynam properti updat period resourc manag servic user search devic group room send request trader entir client refer postscript printer print page minut price minim true client locat properti printer physic locat request print postscript le trader organ hierarch trader feder mechan de ned corba standard trader receiv queri forward request trader oor combin printer lowest price trader store part inform local cach result recent queri lessen time system load make trader inform extend tao trader persist mechan base xml le inform maintain trader runtim mirror xml format persist le addit ad trader data trader system enter devic type devic er write text le xml speci cation devic group investig cach strategi feder trader replic trader context promot load balanc framework manag heterogen devic observ abstract oper system plan unix standard interfac access devic le interfac necessarili case led system call develop framework interact heterogen devic devic interfac di erent level detail special gaia devic interfac de ned enabl construct devic driver client program languag simpli ed gaia class diagram depict figur gaia includ devic devic divid devic video camera entiti interfac gener inform devic interfac oper send receiv control oper devic oper return refer data devic exchang type data devic subclass devic emit data receiv data camera input devic emit video frame subclass camera emit video frame type mpeg data system extend featur includ check consist data automat convert data type mpeg optim drop mpeg frame occurr devic entiti microphon keyboard projector monitor camera servic sensor printer user figur hierarch organ activ space entiti network topic subject research data manag system implement implement initi version devic framework interfac de ned omg idl devic driver client implement java implement driver experi creat order evalu design sourc code document recent progress hardwar technolog enabl construct activ space thousand augment percept realiti dimens recent advanc softwar technolog jini exist oper system middlewar prepar manag complex environ exhibit intric depend strict requir respect automat con qualiti servic gaia investig develop requir servic mechan manag complex comput environ encount futur activ space acknowledg author brian prototyp implement locat servic idea devic manag framework heavili uenc work francisco box concept refer campbel secur smart home jini annual comput secur applic francisco replac file ieee workshop hot topic oper system rio march fabio francisco manuel roi denni manag execut environ seventh intern confer parallel distribut system page ieee comput juli christoph francisco roi campbel adapt distribut file servic ecoop phd workshop object orient system june michi hen steve advanc corba program comput seri fabio roi denni francisco distribut oper system dynam heterogen environ ieee intern symposium high perform distribut comput august fabio roi dynam con gurat manag scalabl multimedia distribut system comput commun journal issu distribut system fall elsevi scienc publish fabio kon automat con gurat distribut system phd depart comput illinoi fabio manuel ping roi campbel dynam con gurat ectiv orb intern confer distribut system platform open distribut process number page april mao monitor analyz method invoc oper system master depart comput illinoi bill al oper system futur ieee xu distribut qo compil runtim instanti intern workshop qo june omg common object servic speci cation object manag omg document manuel roi campbel enabl activ space acm sigop european septemb manuel denni fabio roi campbel ubiquit corba workshop ectiv page april jim waldo jini architectur overview mark weiser comput centuri scienti septemb roi bill norman rich karin david john mark weiser overview parctab ubiquit comput experi ieee person page decemb multimedia servic con gurat reserv heterogen environ intern confer distribut comput system april design implement resourc manag servic master depart comput illinoi februari
DB/140 3 integr orient inform system todd mcdonald depart electr comput engin air forc institut technolog afb depart extens famili model simul mission level interact weapon system underli data file creat simul scenario pose great challeng regard unlik tradit data integr method common feder emerg field inform system view data central focu applic provid architectur framework applic develop develop aoi solut relev problem domain combin data model persist program languag commerci objectori agentori analysi design methodolog requir effort air forc research laboratori basi analysi design system implement prototyp applic conceptu demonstr reusabl integr scenario simul model model heterogen integr introduct air forc research laboratori direct effort provid collabor comput environ support simul scenario integr militari simul model includ extend air simul model composit mission simul system joint michael depart electr comput engin air forc institut technolog afb scott deloach depart electr comput engin air forc institut technolog afb interim mission model simul warfar environ gener requir collabor engin real time correl heterogen integr problem repres pictori figur authorit data sourc figur heterogen problem domain problem domain primari goal integr realm concern map real world data convei authorit data sourc side figur languag syntax structur specif type model side figur figur pictori repres forc file relationship correl scenario instanc view express articl author reflect offici polici posit unit state air depart govern document integr scenario input sourc file mosaic simul model simul model type syntact object model figur traceabl form integr deal integr simul model entiti grammar desir grammar translat data item simul grammar requir form integr grammar describ oper scenario vari abil captur concept electron engag figur illustr typic integr scenario type model deal strictli syntax structur mean syntact level form ideal basi integr complex languag specif simul model semant model model schema integr techniqu share semant object scenario scenario figur integr scenario file scenario file syntact object model current solut realm scenario focu schema integr techniqu perspect tradit heterogen feder system approach integr problem syntact level describ approach translat base common semant object found inform discoveri techniqu figur show object closer realworld abstract mean process map authorit sourc scenario file exist scenario model tediou minim softwar support facil collabor assist domain specialist exist research explor benefit inform system implement agent technolog achiev share heterogen data environ develop architectur support integr authorit data famili simul model integr support autom approach scenario construct foundat scenario file structur follow grammar model authorit sourc exist relat form tradit object model techniqu analysi design method defin grammar rule file structur class hierarchi structur model faithfulli captur content scenario file authorit data sourc legaci natur simul engin scenario data file continu method initi execut scenario model object scenario file authorit sourc basi inform interchang storag object offer ideal form encapsul underli data content scenario natur form persist introduc architectur figur illustr concept encapsul scenario file object structur deriv omt analysi design grammar simul model ideal unit storag readili reproduc underli structur requir input execut actual semant object model deriv structur introduc real world abstract provid basi integr player tactic element suscept mover definit grammar tdb edb syntact object model grammar abstract semant object model real world abstract figur object encapsul scenario file syntax model scenario file authorit data sourc serv architectur method deriv inform visual text translat persist object object structur figur illustr concept strength oodbm problem domain persist achiev scenario chang translat data format scenario store objectori exist common data model integr scenario authorit data accomplish scenario file dynam object instanc class structur retriev creat scenario authorit sourc persist object oodbm persist store transact queri inform retriev applic separ architectur scenario file scenario object scenario object persist object scenario file scenario object xml java swing tree figur translat possibl scenario object approach solv integr problem heterogen data thrust provid access possibl larg number inform agent dynam persist repres scenario model scenario exist environ nativ file structur oodbm format inform agent provid map inform broker system relat data activ inform agent perform data translat step common data model figur illustr concept repres oodbm store nativ file format inform agent research demonstr definit agent architectur discuss object creat store persist scenario oodbm scenario data file scenario tdb edb figur inform agent data aoi design inform agent scenario tdb data file idb agent object instanc creat data file narrow discuss scope defin realiz agent conceptu implement ai field concept reserv sole human agent term oblig advoc requir stricter properti ration view agent term program paradigm offer higher level abstract object autonom entiti activ properti requir explicit definit commun specif messag element agent achiev common goal agent defin object goal common commun languag agent concept natur deal inform complex paradigm emerg inform system level problem address relat idea autonom agent term agentori inform system describ adapt principl entir inform life cycl design process inform agent view entiti repres inform sourc knowledg belief offer capabl commit belief interest parti inform agent serv role inform context aoi architectur reflect reason abil natur provid order respond request inform cooper inform agent base tradit notion inform retriev system agent search agent inform respond queri manner architectur ir capabl ad futur initi deal sole replac tradit data storag servic collect inform agent link inform broker system figur illustr tradit notion type system matchmak basi inform registr exchang system figur matchmak broker scheme order introduc principl problem requir kei build block system analysi design techniqu break problem area requir design implement agent hierarchi techniqu similar normal design definit develop environ chosen implement build commun requir agent methodolog methodolog transform domain requir agent architectur discuss system engin system engin approach softwar develop orderli logic design process successfulli captur system requir transform real world softwar hardwar compon process develop system kei differ agent concept construct problem domain system addit normal interact mase gener methodolog similar object orient analysi design captur aspect domain major phase methodolog cascad domain level compon system design analysi problem mase specif seek map requir develop methodolog determin agent develop methodolog design support collabor goal group agent mase assist determin problem domain repres start place agent orient chosen desir abstract implic machin act agent abstract problem defin piec find agent problem domain abstract tool complex involv integr larg number data sourc find common architectur larg number simul model mase methodolog flow requir analysi deriv system level goal goal subgoal conjunct disjunct reflect higher level goal subsum goal goal convert role familiar uml notat role combin agent agent interact human system resourc defin focu scope chose simul model figur authorit data sourc figur basi requir figur show result appli mase problem domain agent type directli traceabl requir small subset entir data requir repres collabor natur autom gener facil desir final system inform servic answer inform request make inform request scenario data sourc assist analyst work concurr scenario defin object data sourc perform semant translat inform offer registr servic reciev request figur agent deriv role notifi assist user build scenario agent type defin tradit case defin normal uml notat goal agent collabor goal requir interact multipl agent complex interact messag pass sequenc agent requir definit type sequenc collabor diagram defin collabor scenario design scenario minimum messag pass state base sequenc diagram deriv directli scenario defin requir includ agent type involv final product mase includ agent hierarchi fulfil system goal defin agent type figur illustr primari agent type defin domain analyst part type unregist regist figur agent type hierarchi agent power abstract tool agent type form repres system function requir implement research agent suit inform provid scenario authorit data applic request data inform provid base matchmak inform match provid figur illustr layer agent layer support collabor analyst develop scenario introduc intellig user interfac provid expert knowledg creat scenario collabor layer inform layer collabor assist inform broker unregist regist inform figur agent layer assist layer semant broker inform provid scenario builder assist develop framework implement agent develop framework chosen environ defin basic class messag research demonstr written java util serial object primari mean inform exchang agent type figur illustr commun architectur class type defin framework figur commun architectur figur illustr natur framework repres applic function inform layer agent architectur comput scenario data gatewai port broker gui port dedic port comput comput port data gatewai scenario data gatewai comput figur applic demonstr implement architectur persist object creat retriev port tdb port port data sourc file persist store manag system persist framework orthogon inform support provid framework oodbm access discuss agent provid uniqu benefit inform integr context provid tradit heterogen architectur semant model domain requir instanc support context data sourc inform agent provid feder tend centric system provid life cycl approach provid direct traceabl user requir system compon agent class aoi technolog system develop data bind data storag mechan agent provid abil abstract underli data inform sourc inform system agent base system expand provid greater function drastic architectur intellig interfac abil achiev coordin goal approach system develop scenario model integr construct inform retriev aspect natur suit underli inform agent architectur aoi implement term system encapsul tradit data sourc part manag system refer data read artifici intellig ed san mateo morgan kaufman sep approach resolv semant heterogen feder heterogen intern journal intellig cooper inform system march williamson sycara technic robot carnegi mellon jen theori knowledg engin inform technic institut march inform agent extens inform system workshop agent orient inform system kei concept inform system requir posit agent orient inform system workshop intern workshop inform scott system methodolog languag design agent workshop inform system wa scott unpublish document air forc institut technolog octob
HCI/141 4 structur distribut virtual environ relat model bori van faculti comput scienc po box netherland abstract paper discuss speci cation techniqu base tradit model model architectur complex interact multimod user interfac user interfac compon softwar compon model commun share structur term agent correspond entiti techniqu consist execut provid level con gurat describ system compon describ behaviour individu agent techniqu combin speci diagram screen layout applic develop cycl small applic illustr usag introduct paper speci cation techniqu multi user multimod virtual environ speci cation techniqu speci cation de ned suit speci cation languag facilit develop wai document facilit reason design reason commun develop di erent disciplin possibl user execut enabl gener full system prototyp plai import role develop properti veri cation error found ectiv mean form assert check model check execut full system part execut capabl speci cation techniqu mean program languag consid integr part speci cation techniqu speci cation techniqu order cover aspect enabl speci cation di erent viewpoint di erent level abstract multipl problem make cation match cumbersom highli iter develop prototyp led techniqu prescrib extrem program extrem program languag view speci cation languag altern wai deal match problem separ multipl program describ aspect system ned match abstract languag execut program languag approach techniqu problem domain techniqu develop part environ system eventu provid suit speci cation standard softwar tool develop virtual environ ve multipl user agent present multimod di erent entiti awar activ di erent commun channel distribut applic necessarili run di erent comput possibl distant locat system virtual music centr speci problem relat type discuss detail multimod impli complex architectur part system gather interpret inform sourc distribut impli technic constraint technic constraint consid import initi system speci practic turn impact function design system speci cation techniqu system prefer deal technic issu integr relat work model exist provid mean structur interfac understand order explain techniqu discuss common class model architectur model architectur model softwar compon model meant provid structur framework user interfac design provid separ user interfac applic domain call domain model essenti aspect abstract call architectur style model explicit implement support form program languag softwar lling detail speci ed architectur style domain model typic model separ softwar compon set user activ speci ed access oper compon clear exampl arch model data system state domain state user interfac speci calli focu di erent model repres state pac mvc encapsul user interfac state speci type softwar compon abstract compon model compon type compon repres displai manipul user present compon view control compon mvc enforc structur separ type model compon model share state pac enforc structur present abstract compon local singl control serv compon interact control compon control compon local present abstract compon call pac agent code remain control compon depend structur control compon tree control compon encapsul number pac agent gener idea separ hierarch encapsul commonli found user interfac model toolkit model provid mean structur commun model descend user repres pac tree agent posit di erent user tree commun directli agent call peer agent commun scheme consid similar replic scheme found model scrollbar show regular view posit user scrollbar gure solut peer scrollbar commun posit directli canva editor editor canva posit posit user root user root view view view canva user root user root overview editor posit canva scrollbar user scrollbar editor window view bar show user scrollbar scrollbar scrollbar overview window file view view bar file edit scrollbar fig canva edit applic model screen layout canva window top show scrollbar displai scrollbar screen layout overview window bottom show user activ le edit tree show situat user system oval line commun depend agent posit state commun grei box dash line rout inform control agent top gure show situat user edit le bottom gure show situat user edit overview window architectur assum user interfac state requir awar typic found insid peer agent work simpl case scrollbar complex architectur chosen model regular scrollbar view bar show user scrollbar separ agent separ part user interfac scrollbar posit commun tree parent back user view bar ad featur exist user interfac requir modi cation made control compon case applic user interfac user di erent window content concept peer commun canva applic includ gener overview window show activ root agent window compon inform resid di erent gure fact commun illustr root agent handl peer ectiv central access point user interfac state small user user interfac state inform inher dicult encapsul meaningfulli multimod parti track activ integr manner exampl view show overview user found assist agent track user activ part user interfac er maintain separ distribut share dataspac model part user interfac state share user case structur dataspac bear relat structur user interfac dataspac simpli bypass architectur model user interfac problem architectur style provid proper notat guidelin model constraint interrel multipl window applic multipl user problem diculti match style essenti featur implement abstract speci cation de ned encod construct inher style speci cation regular program languag style suggest form diagrammat limit inform sketch notat appar role plai speci cation system discuss architectur style program languag describ architectur conceptu model kind model structur user interfac conceptu model speci cation languag diagram variant extens relat implement consid provid suitabl execut speci cation close match abstract model extens model domain model type applic includ relat interact user interfac compon domain model proce view updat oper structur state user interfac model model relationship model inform techniqu model inform structur includ user interfac meant address usabl implement suitabl prescrib execut implement discuss map implement architectur user speci ed speci architectur style abstract graphic notat applic architectur plain speci cation manner ad typic pac tree diagram sketch structur user interfac speci moment time simpli repres tree node entiti arc relationship kind gener pattern tree conform moment relat multipl kind diagram speci es structur correspond agent system similar produc speci cation model editor gener structur system speci ed gure speci es kind editor window overview window moment user editor window view overview window overview window le view user root editor canva scrollbar overview file view filenam posit fig abstract pac architectur editor box entiti eld bottom line relat multipl denot number mean note attribut le correspond user interfac state requir le view user interfac state model mean entiti attribut user interfac toolkit compon structur compon de ne variabl node graph compon interact achiev graph structur read node variabl exampl amulet structur compon speci es interdepend mean queri speci ed term tree structur similar scheme support vrml enabl compon tree structur read variabl di erent node tree encapsul tree visual conceptu group case fundament reason direct label tree compon structur ect relat compon repres entiti toolkit ectiv model relat approach term pac abstract part user interfac model control part oper mean access le edit scrollbar posit ectiv model gure le view conveni obtain inform mean view techniqu speci cation techniqu model model architectur user interfac unlik architectur encapsul inform share entiti attribut engin develop enabl execut speci cation relat approach compar discuss approach compon structur limit enabl closer map abstract conceptu model uniform distribut access mechan commun inform compon separ scheme model interact queri inform requir compon explicit facil model dynam creation delet compon structur speci cation term model suit model gener pattern compon structur conform compon natur deal set valu input develop techniqu techniqu integr execut plai speci role speci cation system languag subject techniqu serv proof concept approach execut system built separ speci cation architectur level system role speci cation plai compar pac control architectur descript languag con gurat languag part speci cation call con gurat level speci cation individu compon call compon level speci cation di erent languag level con gurat languag simpl script languag call html agent html enabl speci cation set compon user interfac element combin element compon con gurat screen layout singl speci cation visual tool gener html compon call speci ed interfac world instanti behaviour separ languag call compon languag thin layer top main integr compon interfac regular java code techniqu execut languag ectiv combin diagram figur rough idea techniqu develop process start develop inform speci cation includ screen layout model user interfac web structur model system concept behaviour rst step identifi di erent type agent system adopt exist agent agent de ning custom agent interfac agent interfac speci speci global describ user interfac state model screen layout user interfac structur directli translat set html le result rst prototyp show system simpl behaviour system lled ned intern custom modifi part con gurat high con gurabl ned user interfac state model chang impact intermedi system ned mean increment nal system compon interfac con gurat languag system speci ed instanti number compon de ning basic compon speci es consist set input output point system con gurat de ned plug output point input point manner altern approach input regular input compon maintain view world view repres set data standard custom agent interfac specif screen layout interfac structur detail descript object agent behaviour world model share standard agent html standard custom agent html standard custom agent html custom agent final system full prototyp simpl prototyp fig develop cycl arrow depend speci cation circl execut system updat input consist addit delet set view automat updat inform output point output regular data object translat updat action script compon con gure coupl queri output write action compon model call agent satisfactorili agent control ow fall scope paper current version agent behaviour speci ed java statement agent interfac speci ed list set list set list agent number regular java number view updat view speci ed list java type stand requir eld updat speci ed set regular java object system con updat languag basic regular procedur languag queri facil subject illustr role languag techniqu script serv agent script speci ed execut agent creat speci es agent view write initi attribut valu agent output agent output script execut agent produc output speci es updat action system con gurat script agent system con gurat script instanti set agent system agent correspond entiti distinguish mean uniqu id agent id access script variabl enabl queri oper speci ed term id case script output agent pass output variabl script languag function creat agent coupl queri view agent script run updat format queri speci cation updat oper basic prolog speci includ pattern match tupl speci ed predic eld attribut speci eld match variabl posit queri speci ed select number variabl list match speci ed list tupl updat speci ed set tupl ad queri speci es valu variabl regular notat applic map diagram eld entiti id repres tupl relat entiti id repres tupl mean entiti type ad easili mean extra type eld ad delet entiti lifetim assum relat gure le view editor obtain scrollbar posit posit line speci es le le view belong line speci es editor edit le line speci es scrollbar posit editor execut engin speci cation execut engin engin base engin layer handl function java layer handl java object integr java code engin run separ access object request broker run top java object stream tcp socket setup enabl applet remot site connect system commun server approach ecient network serv implement distribut approach left subject futur research updat action queri result updat transmit asynchron block agent queu asynchron messag pass dicult understand regular synchron messag asynchroni essenti obtain fast distribut environ applic illustr techniqu mean larger speci cation simpl ve ve inspir virtual centr repres environ static displai di erent ve locat dialogu agent present answer user inquiri user regular web page relat inform graphic primit thing dialogu agent process multimod awar user point activ screen layout applic gure essenti window ve interfac canva displai ve mean user avatar text chat facil window includ regular web page tabl view gui compon model standard agent ve speci ed discret set number object fig prototyp window layout ve speci ed html middl web tabl meant show queri result left ve action window top graphic room object displai text eld user scrollbar posit user avatar list box select avatar text displai show thing chat line directli enabl user type text spoken object exit room object walk point thing dialogu agent call karin karin track user point view listen user show tabl dialogu agent string string string string gener setup shown gure user speci ed possibl view web number web page compon compon point click complet execut code system consist html code code script set ve locat detail part part karin exit url topic regular object web compon link topic view webpag topic ve object room view avatar fig user interfac state model ve notat similar gure field bold option eld line arrow circl arrow point gener di erent line circl di erent box connect show tabl item relat relat attribut item user topic user topic user line creat instanc assign id variabl speci ed brace init coupl queri view command tabl output script creat tabl line show tabl item relat user remov line request document tabl shown user browser tabl item add tabl item shown creat show tabl item relat utter issu speak event line set xed attribut karin avatar posit discuss current techniqu illustr multimod ve structur model techniqu separ con gurat level compon level work found compon con gurat modi excess amount con code execut speci cation found compact count regular web code total line small prototyp canva editor chat built line code order test scalabl approach larg complex system built plain shown speci wide rang semant advanc variant abstract object constraint languag structur constraint ocl speci cation verifi correct system behaviour techniqu suitabl applic requir complex coordin test basic concurr write access model simpli mean concurr applic built requir complex arbitr protocol order test suitabl techniqu drive complex graphic appli vrml anim system role vrml analog detail graphic driven agent vrml code rst vrml prototyp translat rotat command move vrml object similar scheme abstract command trigger drive arbitrari vrml anim natur current engin suitabl distribut applic possibl improv ecienc mean distribut implement engin explor refer architectur con gure distribut applic middlewar ifip intern confer distribut system platform open distribut page sri rapidli build synchron collabor applic direct manipul acm confer comput support cooper kent beck extrem program embrac chang consist tradeo interact groupwar acm confer comput support cooper philipp michel taxonomi evalu formal speci cation interact system peopl comput architectur design gener softwar architectur model cscw chi carei bell annot vrml refer edit steve richard bernhard jo alan amsterdam manifesto ocl uml technic report object manag coutaz architectur user interfac eurograph workshop speci cation veri cation interact page simon davi strategi comput program peopl comput hci miguel concept realiz intellig user support interact graphic applic phd faculti comput patrick joe distribut asynchron abstract interact technic report ecol polytechniqu de lausann commun system depart green benyon beneath model inform artifact intern journal greg phillip architectur synchron groupwar technic report depart comput inform queen andrew david compar mvc pac architectur workshop formal aspect human comput du li richard muntz collabor object coordin architectur acm confer comput support cooper kee yong lim john long muse method usabl engin cambridg pano composit model formal speci cation user interfac softwar phd distribut edit brad richard robert alan andrew bruce andrew alex patrick doan amulet model ectiv user interfac softwar develop ieee transact softwar coutaz softwar architectur bridg world ergonom softwar properti formal method human comput chapter page springer van speech languag interact cultur theatr natur languag process industri applic special accent languag page roseman greenberg build groupwar page oreilli daniel fernando web applic model conceptu model advanc conceptu er workshop evolut chang data engin inform world wide web conceptu bori van process agent base model techniqu dialogu system virtual environ technic report centr telemat inform bori van speci cation techniqu build interfac agent web environ learn workshop interact jan refer manual
IR/142 5 chart dark map larg intranet peter nick craswel dept comput australian nation canberra act australia david hawk csiro mathemat inform australia novemb abstract introduc de ne concept dark matter web dark matter person web crawler consist page reach observ dark matter import understand web portion web depend viewpoint di erent observ di erent overlap section web type dark matter exist discov formal de nition constitut light dark web formul term reachabl case studi dark matter australian nation intranet report estim anu intranet inform dark local search potenti loadabl web data unreach web user discuss implic dark matter estim size web gener web search dark web practic experi introduct web start point inform search engin integr access inform resourc search engin approxim web user locat inform search user search engin erron impress search cover coupl research demonstr search engin coverag declin rel size web search engin provid place emphasi provid good gener coverag provid coverag author acknowledg work partli carri cooper research centr advanc comput system establish australian govern cooper research centr program core inspir concept dark matter rst paul friend colleagu di cancer februari declin coverag attribut number notabl growth size web consequ cost index provid queri process servic data reason complet coverag practic introduc concept dark matter inform web discov individu search engin investig ground case studi provid search servic larg intranet web server australian nation claim broadli web larg outlin web inform lead type page obtain dark matter reason page obtain lead taxonomi dark matter give formal de nition dark light matter web term reachabl discuss methodolog dark matter discov motiv experi quantifi preval dark matter anu intranet access addit inform web server anu greater estim web larg report simpl experi reassess size publicli index web implic dark matter web search gener inform publish discuss relat work peopl explor natur web lawrenc gile work estim size publicli index web includ discuss consid index describ characterist term web interest index cover document dark index number includ northernlight construct directori searchabl facilit access document obtain tradit web crawler pitkow valuabl overview di erent bulk studi explor peopl access server rate chang page analysi diamet web model topolog graph conduct jeong estim averag number link page web nineteen cooper associ internet data analysi develop tool explor tomographi internet work concret live network probe obtain inform speci web protocol awar studi systemat attempt measur quantiti dark matter paper obtain web inform main contribut dark matter concept measur obtain inform depend characterist observ observ peopl download page web browser crawler agent kind web search system automat web data download mirror archiv peopl typic page learn exist link page forg url base cultur search system present page link forg url involv construct url base inform modifi exist url current web search system fall main base data gather reli editori descript site approach base index construct web page collect web crawler popular exampl includ altavista googl approach distribut inform retriev probe search system result interest search system web crawl obtain web page directli ect exist dark matter basic architectur search engin googl web crawl provid raw data search servic engin anu similar index queri process compon compon obtain raw data index web crawler crawler robot spider simpli web crawler behav start set content page retriev scan url polici encod crawler decid url ad queue url retriev simpl polici check url ignor download content url store discard index compon examin dark matter term coin astronom describ observ fritz year ago demonstr substanti amount matter technic term estim astronom amount dark matter dark dark matter equal term analog situat web space understand web page access http protocol person comput internet page incom link outgo link part web provid url gain access content suitabl internet ip address ident page sole content part web search act collect inform part web visibl search engin emerg public altavista search servic index entir web estim size web made base probe commerci web search engin check overlap lawrenc studi estim februari web million page found biggest search engin northern light index approxim web estim substanti overlap search server combin coverag search engin examin approxim web proport percentag page visibl search engin matter inadequ resourc crawl web web complet web crawler agent search engin reject load resourc limit file type cgi restrict load password domain remov longer url content intranet longer page url find link page dark link page figur taxonomi dark matter reason exist issu altavista incomplet coverag web loui chief technic made comment report concept size web site virtual nite dynam gener person page shop basket robot list remark strike heart dark matter issu reason search engin human unabl materi exist web technic due natur web signi valuabl sourc inform dark web shop basket shade dark shade dark matter web reason materi give rise classi cation gure reject dark matter rst kind dark matter observ reject page reason load human observ reject page due limit page requir kind browser plugin softwar web crawler frequent reject page polici reason current search engin web crawler nite limit number document crawl server web crawler exclud crawl part site convent meta tag page content page load polici web crawler exclud le extens crawler search servic attempt load le gif extens interest subcategori materi gener dynam refer gener dark matter page gener program page assembl construct base data pass form web crawler typic exhaust probe area task lling form appropri autom gener page site fact nite number crawler typic reli indic url page gener url base url path presenc common indic marker page crawl undetect gener inform gener content rare dark human observ limit base format url restrict dark matter materi publicli link restrict observ permiss page load page sun java resourc inaccess lling form gener combin rst combin common mechan web site restrict access speci ed user web crawler access protect creation combin free domain restrict web server administr limit access content content primari softwar server restrict local australian access avoid larg intern network trac cost mirror site domain restrict essenc network prevent observ access inform locat observ inform dark dark matter kind dark matter encompass page remain observ reason link locat materi page dark observ page link refer discov link found page dark reason link found exist load abil extract inform link adob pdf document rare extract web crawler softwar interest subcategori dark matter materi publicli link refer page privat dark matter access materi reli guess url inform web server url download person put url public longer privat dark matter set start url critic determin dark matter began current studi anu page australian danc host search servic infer page link reachabl start set host url includ load polici page discov search altavista servic infer page link link exist extern ad url manual altavista start set start anu intranet link site intranet longer dark matter search web page dark multipl wai discuss web matter dark di erent reason singl page dark reason exhibit multipl shade dark develop search servic part made anu intranet make public link privat dark matter pass url part server instal case pass url made link servic publicli access page reject dark matter commerci web search engin adher standard robot materi provid gener perl cgi search engin discov page reject gener dark matter due privaci materi crawl restrict access crawl restrict access server anu intranet observ anu page restrict dark matter de nition dark main diculti de ning constitut dark matter web dark rel constitut observ secondari diculti de ning dark matter observ web highli depend time made observ observ carri period singl instant ect similar uncertainti determin dark web time inform held true abstract speci type dark reason matter matter reach observ lead de nition dark de loss gener make simplifi assumpt entir web instantan observ time return tempor issu section de ne matter reachabl observ de nition reachabl observ de ned locat ip address load strategi written page content url reachabl respect observ page content seed set url set extract page content chosen load actual page content successfulli load reachabl default obtain page content successfulli load url load strategi constrain os bear associ internet address set access permiss password link extract determin le format discov link page load determin url desir load chosen load capabl initi link gener visit page gener search request search server page load polici encompass ignor robot exclud page detect gener page limit load limit site discoveri de nition reachabl foundat reachabl singl success page load url extract page content reach interest de ning set page content singl step observ url extract initi set page content entir set page denot de ne reachabl set page web note reachabl relat transit rememb page content url reachabl observ transit closur respect page content seed set url consequ de nition reachabl de ne page light observ de nition light set light observ set page reachabl page content seed set url light de ne page content url dark entir set dark page de nition dark page content url dark respect observ page content seed set url de ne set dark page dark page content seed set url web light signi aspect de nition simpli url page make content light observ content page loadabl page light import dark rel concept page dark dark combin page combin observ di erent section web depend access home web crawler obei robot restrict part person obei awar part site dark light person point page link gif imag reachabl search imag graphic url understood link read link type browser follow destin reachabl page link evidenc imag search softwar typic le format link extract case text le word rst necessarili identi link link publicli index web consequ de nition de ne meant web refer lawrenc gile explicitli discount server requir kind classifi restrict dark matter remov thing compani present home page multipl ip address singl repres web address signi content gain estim real inform publicli index attempt formal de ne term de page content server reachabl restrict includ term de intuit publicli index web consist page common light observ observ small fraction web restrict domain gener elimin area dark anu intranet page access observ page light de nition publicli index web web construct page link url page found web observ load strategi special access permiss capabl page load polici lp chosen select index le load page discov note link extract polici ep immateri construct page page reachabl publicli index web set page index web index hm suitabl set random locat choic index le format depend observ choic determin natur publicli index web choic suitabl critic chosen restrict gener access web form intersect index broad set includ internet domain deni access web server deni access peopl access australia locat australia dark includ part publicli index web gure show relationship part web publicli index web de nition superset page intend lawrenc gile discuss publicli index web smaller web due dark larger exist search engin coverag web web publicli index web coverag search engin coverag search engin privat dark matter dark matter figur di erent part web remov dark matter web web server server turn page page intermitt network server failur prevent access entir area web page content url addit categori dark matter consequ volatil light matter consid tempor context fourth kind dark matter point remov longer subcategori remov dark di erenti url vanish dark matter remov dark matter exist inform inform place discuss place http mud room rare discov web crawler media replac entir content page daili faster basi page content url captur ad notion observ time notat page content write page content url successfulli load time dark matter observ dead dark matter subcategori interest dead dark matter dead dark matter inform successfulli load time attempt made observ time longer prior exist search engin index estim dead link search engin index rang lawrenc studi web matter dead dark matter depend long time period observ expand notat page content de ne dead dark matter light observ start set dark dead dark matter time scenario occur longer page content longer reachabl dead link observ time period notion instantan observ entir web view page year observ million page estim size publicli index web observ page minut view million page realist observ replac notion instantan point time period time replac exist de nition earlier loss gener notion observ carri time period close correl methodolog carri observ web action successfulli load page content url nite period time load page longer time period page content light dark de nition suggest page content consid light exist time reason light dark default real experi inform page load gener exist time experi page reachabl methodolog server web server australian nation provid basi case studi dark matter web individu http server web address lie internet domain week conduct experi server act anu intranet type ftp central control wide varianc level conform kind standard di erenc server softwar underli size server collect huge varieti inform repres includ peopl home depart softwar research inform web materi server anu anu intranet act reason sampl web larg random select web advantag obtain extra inform server server kei enabl featur conduct studi crawl anu intranet web server obtain actual directori list web data identifi dark page anu larg inform part simultan part web technolog basic technolog crawl anu intranet modi ed version gnu softwar primari modi cation enabl retriev softwar adher convent web crawl delai consecut request delai request server import ethic behaviour crawler individu server overload multipl simultan request thing natur data highli depend date data collect data experi obtain anu intranet week commenc octob total server provid page download total number page download averag number page server usual web distribut page skew approxim power law uniqu link page refer server anu intranet domain dark matter dicult quantifi assist web server obtain directori list server directori list produc unix find command server http directori root mechan includ imag depend setup cover area user home page directori includ perform analysi directori made addit measur presenc quantiti dark matter web server access log determin request dark matter page made feasibl packet network log request data access gener packet network technolog averag dark matter research er examin packet pass point network packet web server access log studi document directori list http access server case crawler log discov dark matter estim produc data fairli page load avail web user estim relat reject restrict dark matter categori crawler load kind le kind restrict encount directori list enabl provid addit estim real amount dark matter part server load polici estim reachabl scenario base vari seed set url map intranet dark matter breakdown light dark matter shown tabl dark matter split categori detect crawler log dark matter detect crawler log remov dark matter column number url categori crawler log data set server directori report averag percentag categori compar le column tabl tabl quantit light matter dark matter categori anu intranet categori data web crawler number page data directori page server light reject restrict tabl quantit reject dark matter kind reason web crawler log reject page directori list reject page server robot gener text imag prog backup map reject dark matter state tabl anu intranet crawl found url reject number reason reject gener dark matter form interest subcategori result gener dark matter count link refer stem url found multipl occurr base prior assum page link gener signi skew server server gener server ve server thirteen fty interest subcategori reject due robot server le descript remaind reject ground crawler extract link le format break major imag le imag readabl document le text program code le prog backup le backup give detail uniqu extens breakdown reject reason tabl percentag url rel total number crawler log data column tabl examin server directori estim quantiti reject dark matter column tabl result present averag percentag total reject server base list individu complet set file server web directori access seed url access link entir web access intranet link access server base url figur light depend begin crawler load strategi averag percentag page set server directori list web server note earlier reject gener dark typic signi skew server le reject percentag reject le text format kind gener exist publicli lter convert suggest download page percentag extrapol anu intranet addit document index search servic map restrict dark matter anu intranet crawl log give reason le loadabl http error code requir access deni report separ restrict due access restrict requir longest directori path restrict map server directori list estim le restrict individu server actual determin load averag server page restrict access restrict area server constitut requir area server bare map dark matter crawler log permit calcul amount dark matter di erenc crawler theoret loadabl access url exist server directori list includ amount loadabl crawl server base url seed set restrict discoveri page server current load gure demonstr di erent seed set url ect quantiti web page light observ di erenc load crawl anu intranet averag page theoret loadabl page url averag page amount dark matter di erenc extrapol anu estim page exist dark roughli page load repres total number le anu intranet number dead page time figur dead page time anu intranet crawl small averag loadabl page server crawl server home page compar crawl entir anu intranet suspect expand entir web crawl yield number page discov anu intranet small map remov dark matter attempt made identifi map remov dark matter anu intranet report gure remov dead dark matter search servic oper anu commenc oper list url crawl intranet time figur plot growth dead link longest time interv polici crawler total number page download dai servic number page longer reachabl subsequ crawl dai servic report reason slight dip dead link crawl dai due server avail crawl crawler page load polici load page commenc servic anu intranet doubl size time size publicli index web lawrenc methodolog estim size publicli index web base crawl randomli select web server home underestim true size page server discov crawl home page straightforward consequ de nition light page reachabl start set url start set singl base url server conduct experi anu intranet crawl server base url restrict crawl server compar number server number page server found crawl anu set server url seed averag number page server crawl restrict server crawl averag number page server calcul geometr ratio server server intranet crawl home page crawl figur histogram number page load server crawl anu intranet compar crawl home page ratio reason larg di erenc due skew data server di erenc method obtain page plot server server gure di erenc gure earlier base directori list due di erenc number server report averag percentag page server di erent categori geometr ratio server directori list set server infer drawn greater page server directori list lawrenc gile estim web million page februari result carri web larg reason size web geometr ratio server million page note estim crawl larger subset discov link part anu link anu futur work expand number server includ directori list interest examin access log inform dark matter page download similar studi conduct intranet anu verifi gure extend web larg reason anu unusu case implic studi larg amount dark matter web inform signi percentag search engin peopl care likelihood inform discov public inform inform web vari intent inform provid public inform partli captur mechan prevent peopl gain access highest level public visibl unrestrict access achiev creat link inform url public page publish url search engin intent inform provid inform form part public index web url fashion email post full colour colour supplement major newspap aspect lower level public visibl achiev di erent wai restrict access inform host domain creat link restrict access smaller group potenti user restrict mechan give rise categori restrict privat dark matter kind dark matter dark dark matter intend restrict privat dark inform dark make light dark matter basic solut limit growth dark matter address issu reachabl make public inform reachabl essenti publish url gener search engin essenti inform discov search engin creat public link inform dicult accomplish page inform provid control longer search engin medic public search servic provid higher qualiti result dedic resourc albeit possibl area interest gener search engin make greater distribut inform retriev techniqu gather result rang search engin polici inform public exist dark matter web document server inform provid page dark individu page inform provid reli implicit understand page made public server ensur remain dark local search system provid basic approach discov public inform directori list design area crawl design public page server local search system list directori uncov materi intend public suit strong control creation distribut inform approach inform creation crawl design public page server approach wide understood user due legaci default inform discoveri mechan web reason essenti prevent inform index local search server gener public web search server inform discoveri mechan adopt server administr administr server make clear user local public polici inform dark make polici clear user prevent inform dark exist dark matter web phenomenon experi suggest exist inform server reachabl major search engin remain page dark user exist inform server consist loadabl web page remain dark matter dark matter privat dark matter unknown import web predomin inform medium continu search engin continu prime inform discoveri exist huge quantiti inform dark search engin assum greater signi canc dream coverag web singl search engin long notabl except fast di erent form web matter imposs nite resourc secur privileg expand system metacrawl combin provis local search facil web document server mechan quantiti dark dark declin web acknowledg helen steve provid comment draft paper gratefulli acknowledg assist web server administr anu provid directori list web area control bibliographi diamet web sept altavista krishna bharat andrei broder techniqu measur rel size overlap public web search engin seventh intern world wide web page diana web octob sergei brin lawrenc page anatomi hypertextu web search engin seventh intern world wide web page daniel internet tomographi natur web jan fast search googl usabl center gvu www user survei octob huberman adam dynam world wide web koster standard robot steve lawrenc privat steve lawrenc lee gile search world wide web scienc april steve lawrenc lee gile distribut inform web nation librari medicin gnu manual northernlight jame pitkow summari www seventh intern world wide web page danni sullivan altavista size controversi sun microsystem
ML/143 6 instruct autonom agent scott bradlei huffman dissert submit partial fulfil requir doctor philosophi scienc michigan januari doctor associ professor john chair assist professor birmingham professor lindsai professor round associ professor solowai fl scott bradlei huffman reserv abstract instruct autonom agent scott bradlei huffman john laird contrast current intellig labori program task meant instruct agent taught task knowledg thesi present gener theori learn tutori instruct produc instruct agent tutori instruct power form instructor commun kind knowledg student point exploit broad tutor agent support full rang interact instructor learn full rang knowledg unlik machin learn target deep learn singl kind knowledg singl kind tutor requir breadth learn broad rang instruct interact theori learn tutori instruct present part comput model intellig problem space comput type knowledg determin agent acquir instruct learn call situat specifi agent learn gener knowledg instruct theori embodi implement built soar architectur learn hierarchi complet extend task knowledg appli fact acquir type knowledg task perform control knowledg oper state interact natur languag instruct varieti learn occur appli situat explan techniqu varieti instruct interact involv varieti type instruct requir flexibl tutori demonstr breadth interact learn capabl previou instruct learn system techniqu form basi futur equip basic taught novic user perform number desir task acknowledg john laird john taught analyz understand build system attack learn system john optim press point readi throw towel larg part make michigan ai lab great place work import john taught success scientist life lab iv excel group peopl work ai lab soar group world lack smart peopl talk problem fun peopl break rick craig doug pearson great friend iv fruit research interact ow nation scienc foundat graduat graduat school michigan nasa famili constant continu sourc encourag support im church famili cornerston christian church addit great group focu import life work greatest gave strength abil work ii tabl content abstract acknowledg ii list vi chapter introduct properti tutori instruct analysi instruct agent task map problem interact problem transfer problem relat work artifici intellig cognit scienc outlin rest thesi theori learn tutori instruct problem space comput model learn situat explan overview determin situat instruct appli explain instruct deal incomplet explan comparison altern approach correl learn learn learn extend procedur soar domain agent initi knowledg learn procedur execut gener oper implement recal strategi extend procedur situat deal incomplet underli domain knowledg iii complet instruct agent learn hypothet state learn state infer knowledg learn oper knowledg hypothet state learn learn reject oper learn hypothet goal learn oper hypothet goal learn oper effect knowledg learn oper effect learn oper comparison knowledg cognit properti model procedur learn tutori instruct cognit model unifi theori cognit soar architectur entail basic properti soar entail soar soar impact interact instruct request initi episod learn situat learn method final gener learn monoton task knowledg analyz soar effect model predict comparison human perform situat learn prior knowledg transfer theori theori theori futur work result empir evalu limit opportun research limit inher tutori instruct limit agent map problem limit interact problem limit transfer problem limit gener instruct agent iv bibliographi list appendix instruct scenario scenario summari result mathemat analysi instruct sequenc flexibl procedur instruct formal problem definit analysi ad hierarchi chunk intern project produc gener rule chunk chunk forward project vi chapter introduct autonom agent futur call perform wide vari rang wide rang lifetim perform task requir knowledg number task circumst larg variabl time flexibl imposs agent requir knowledg agent abil learn part ongo perform power peopl acquir knowledg perform task tutori instruct tutori instruct highli interact dialogu specif perform power instructor commun kind knowledg student point challeng tutor agent support full breadth interact learn flexibl commun knowledg goal thesi present gener theori learn tutori instruct theori develop determin gener specif requir tutor place intellig agent requir encompass wai agent interact comprehend learn requir serv evalu criteria theori instruct learn implement instruct includ work present major specif problem learn tutori requir place complet tutor agent theori learn tutori instruct theori includ comput model intellig agent learn techniqu learn instruct comput model type knowledg determin agent acquir instruct learn techniqu specifi agent acquir gener knowledg instruct implement instruct agent embodi theori call huffman built soar architectur learn perform extend task appli acquir varieti type domain interact natur languag instruct evalu agent base requir complet tutor evalu support broader rang instruct interact learn previou instruct system agent learn type knowledg task perform instruct agent support fulli flexibl interact instruct command instructor give command point agent perform command task agent learn instruct appli situat hand imper command instruct appli hypothet situat condit situat capabl combin produc nineteen distinct interact learn behavior kei contribut breadth behavior produc nineteen singl theori appli breadth tutori learn task secondari goal evalu theori cognit model human tutori learn result broadli consist human procedur make specif behavior predict discuss chapter remaind chapter discuss properti requir tutori instruct analysi task face tutor agent identifi major task capabl languag learn requir complet tutor identifi chapter conclud discuss relat work ai cognit outlin rest thesi properti tutori instruct tutori instruct defin instruct agent attempt perform task domain instruct situat interact situat appli task situat agent act domain interact agent request instruct complet task understand aspect domain previou instruct type instruct common dialogu expert work task segment tutori agent robot shown figur tutori instruct view increment elicit knowledg instructor number properti make elicit easi flexibl situat specif instruct task situat teach instructor provid suggest specif situat produc global procedur includ gener condit applic handl number author advantag situat specif knowledg elicit instruct appli current situat disambigu interpret action perform world give instructor direct feedback effect teach instructor predict effect long instruct reason effect action situat situat specif instruct typic appli situat instructor freedom situat instructor action ongo task perform rare condit instruct fluid cut machin run turn immedi type instruct term explicitli situat languag instruct explicitli aspect situat appli explicitli situat instruct instructor level gener touch hot light push specif step perform specif assembl place left pick red block move yellow tabl move arm red block move move close hand move oper finish home push button move grei tabl move button move oper finish turn push button magnet turn push button light figur tutori instruct increment elicit knowledg acquisit occur increment part agent ongo perform instruct agent unabl perform directli address point agent knowledg lack task structur instructor instructor free structur larger task smaller subtask desir task requir ten primit step taught simpl sequenc ten subtask step agent request addit instruct instructor deem worri agent knowledg agent instruct action perform situat instruct request interact instructor knowledg agent knowledg level instruct refer object action structur data agent interact occur natur languag instructor talk requir artifici terminolog syntax agent intern data structur process tutori instruct typic knowledg applic agent current situat close relat task local control structur task local control control made base present inform global control follow fix regim requir aggreg inform multipl problem solv state make control local control structur characterist construct synthesi primit step form complet solut problem solv method constraint satisfact heurist classif involv global control produc global control strategi combin local teach global method cast pure sequenc local difficult acquir knowledg task involv global effici knowledg acquisit tool marcu birmingham control strategi built thesi instruct task local control structur analysi instruct agent task instructor provid knowledg easi flexibl properti tutori instruct place sever requir instruct agent agent requir interact behav respond appropri instruct learn gener knowledg instruct futur situat agent perform conceptu distinct interrel tutori instruct properti relat instruct map entiti agent intern task illustr figur requir agent appli knowledg commun instruct knowledg level intern process map task involv problem linguist interpret involv reason task domain agent task knowledg find oper pragmat knowledg resolv refer map problem agent interact instructor flexibl obtain instruct advic interact driven agent occur instruct nl knowledg context task knowledg object oper current situat goal world state unambigu instruct agent term figur map problem agent ongo perform address lack knowledg agent flexibl handl instruct relat ongo task situat instruct dialogu appli kind situat structur task wai interact problem agent learn gener knowledg instruct type knowledg instruct provid type knowledg agent lack instruct appli specif situat agent learn gener knowledg transfer situat futur scope applic instruct accur determin rang situat situat featur import gener transfer problem problem distinct close interrel instruct carri type knowledg learn limit interact type instruct time make difficult learn type task knowledg instructor teach natur requir complet solut problem identifi requir form criteria complet tutor agent section requir met theori rest thesi research transfer problem kei part interact approach map problem aspect interact problem develop map problem map problem problem transform languag input intern languag agent domain rang map make problem difficult natur languag make interpret difficult inform instruct map varieti condit solv problem gener extrem focu work fairli standard natur languag process techniqu appli commun suffici rang action situat demonstr learn theori map problem discuss rest thesi explain implement agent oper crucial construct tutor gener issu involv discuss number sampl instruct exampl collect protocol subject instruct simul teacher instruct student flight comput devic manual complex natur languag languag instruct express wai carpent point complic instruct simpl make primarili task instruct difficult construct indirect speech analog type construct difficult problem interact instruct refer resolut incomplet refer resolut determin noun phrase refer topic multipl phd grosz specif target refer resolut dialogu standard refer problem sampl instruct compar refer composit episod refer incomplet problem action inform incomplet instruct extrem instructor expect student fill detail left linguist knowledg common knowledg ffl move arm ffl season salt ffl pull back left exampl miss inform fill linguist context case requir domain knowledg task context season agent domain knowledg season amount typic action martin firbi chapman describ techniqu current execut context deal webber discuss process interpret type incomplet instruct domain knowledg system dealt full rang incomplet instruct complex inform map addit complex natur map problem difficult inform carri instruct complex action instruct requir argument action concurr languag flexibl express paramet difficult scope type action linguist function exampl instruct classifi illustr complex action definit start end point standard paramet ffl pick red block ffl melt main manner result figur motion path motion ground motion realiz phase initi aspect pattern distribut time action rate occur person relat actor speaker relat compar event action occur addit place compar event tempor set spatial set direct tabl semant categori motion construct ffl turn back airport action express constraint satisfi ffl place rightmost side red stand ffl horizon perpendicular ffl load edg tape side record face neg express constrain action ffl unit tv set ffl dont flap ffl care make password obviou continu action explicit monitor condit delin end point ffl adjust rec level control meter needl deflect vu ffl hit thrust full throttl ffl add light constantli complet action map instruct hard find limit attempt space action ai linguist miller analyz semant utter lai semant categori relev shown tabl great amount work understand space action linguist construct map space defin requir map problem place complet tutor agent straightforward complet tutor agent abil correctli comprehend map aspect utter fall scope inform possibl repres agent expect interpret aspect fall abil agent aspect tabl expect correctli map differ abil augment occur build exist abil work map meet complet map perform map demonstr capabl interact problem interact problem problem support flexibl dialogu instructor instruct agent move complet solut interact problem freedom interact instructor properti flexibl interact term individu instruct instruct event receiv singl instruct point ongo task context complet tutor agent handl instruct event coher current point ongo instruct initi student teacher carri piec knowledg command infer made type fulli chapter appli situat current situat hand situat instruct event gener cross product possibl dimens complet tutor agent support instruct event flexibl initi instruct event initi agent instructor flexibl knowledg content knowledg carri instruct event piec type knowledg agent provid knowledg applic ongo task context situat flexibl instruct event appli current task hypothet situat map gener interact problem extrem space instruct event enorm work present complet target dimens flexibl knowledg content situat broader rang interact capabl previou system achiev section discuss dimens interact problem detail flexibl initi human tutori initi instruct mix student teacher studi teacher initi preval earli student initi student learn drop student master task teacher initi domin earli student knowledg teacher assum instruct constantli support instruct event difficult instruct event interrupt ongo process agent engag interrupt instruct event alter agent knowledg chang invalid reason agent engag instruct learn interact knowledg acquisit tool date support fulli instruct event instruct event support instruct direct verif driven impass driven learn leap instructor verifi alter reason step advantag approach step examin step examin altern approach drive instruct request impass agent task perform laird approach impass task perform agent knowledg lack instruct advantag approach agent instruct time disadvantag lack knowledg recogn reach impass occur task solut correct ineffici agent verif attempt induc knowledg verif flexibl knowledg content complet tutor agent handl instruct event involv knowledg applic ongo task context similar notion coher complet tutor agent support instruct event knowledg instruct event deliv knowledg make current context requir difficult meet wide rang knowledg consid relev situat obscur accept utter instructor make point requir power abil relat utter ongo task situat instruct system met requir fulli meet flexibl knowledg content requir class action specif imper type instruct preval tutori instruct procedur support flexibl knowledg content class instruct mean instructor free give command point task concern agent perform command command action agent perform command action agent perform current situat unknown step command action unknown support flexibl knowledg content command mean lead agent instructor skip step command unknown subtask point agent achiev skip step command reach impass instruct theori tutori instruct assum imper command task command appli recent unachiev higher level goal unrel event call assum felic condit tutori commun convent natur interact pattern procedur command taught observ human tutori instruct spontan follow commun strategi direct children understand guid children behavior carri tabl illustr command unknown action skip step red complet unknown procedur instruct request instruct includ complet unknown task appendix teach instructor agent arm red procedur precondit arm arm instructor skip step move hand told agent move pick red block move yellow tabl move arm red block move move close hand move oper finish tabl instruct red block notic sequenc instruct immedi instruct execut support flexibl interact command instructor great amount flexibl teach set task appendix present mathemat analysi number sequenc instruct teach procedur number grow exponenti number action execut perform procedur procedur instruct number grow implement agent handl type instruct action command point ongo dialogu agent complet flexibl chapter situat flexibl complet tutor agent handl instruct appli situat instructor current task hypothet situat instructor specifi instructor make frequent option analysi protocol student taught flight simul reveal instruct involv hypothet remaind appli current situat time instruct appli current situat call implicitli situat situat intend appli implicit explicitli state instruct situat appli current situat task perform current impli exchang protocol instructor teach simul pick block dont robot arm block put hand top block grab lift end block instruct implicitli situat lift appli higher level task state arm hold block block tabl instruct element situat meant appli explicitli situat languag instruct explicitli hypothet situat agent meant carri instruct immedi implicitli situat situat instruct simpl touch hot languag instruct appli hot matter task perform explicitli situat instruct includ condit instruct normal emploi posit add mixtur press pie pan restart hit number research point condit introduc share refer speaker hearer form explicit background interpret evalu consequ ital hypothet situat command remaind instruct meant appli situat partial remaind drawn current chip cook current point explicitli situat instruct instructor teach case describ action situat rare difficult teach implicitli situat instruct explicitli situat instruct teach situat pass import dynam domain situat continu chang hypothet situat creat refer multipl utter complet tutor agent handl possibl flight simul protocol shown tabl entir sequenc instruct appli seri relat hypothet plane flap lower instruct sequenc carri real world theori present cover implicitli explicitli situat chapter implement agent situat flexibl limit singl hypothet situat exist multipl utter handl perform implicitli situat instruct chapter explicitli situat instruct chapter tabl summar requir interact problem transfer problem transfer problem problem learn gener applic knowledg instruct gener knowledg transfer situat futur solv problem involv simpli memor proper condit applic instruct determin exchang instructor block open offic door pick red block drop door type condit follow pattern relev tutori instruct speaker instruct instructor control surfac wing land initi set rid student instructor initi student ground instructor plane rang flap hit capit flap hit student hit time instructor fighter hit time rid tabl hypothet situat exist multipl instruct requir met flexibl initi instruct flexibl instruct knowledg content partial flexibl action situat flexibl partial implicitli explicitli situat multipl utter tabl requir interact problem proper applic condit instruct red simpl memor yield poor block open offic pick red block fact block irrelev case fact block weigh give friction floor hold open crucial proper learn block open object obj obj weigh pound thing pick obj solv transfer problem involv gener special origin instruct gener red isa block drop special transfer problem place number demand complet tutor gener learn specif case agent instruct perform task expect learn gener perform task suffici similar situat fast learn instruct agent expect learn procedur quickli task taught maxim prior knowledg agent appli prior knowledg learn instruct maxim machin learn system gener relev learn instruct learn expect happen quickli increment learn agent continu knowledg instruct lifetim knowledg smoothli integr exist knowledg base part agent ongo perform learn type knowledg task perform agent multipl type knowledg perform control knowledg object knowledg effect agent miss piec knowledg type complet tutor agent learn type knowledg instruct theori learn tutori instruct present chapter make testabl lai type knowledg agent base comput model intellig agent deal incorrect knowledg agent knowledg instruct knowledg incorrect incorrect knowledg part agent origin learn incorrect instruct complet tutor agent perform learn effect face incorrect knowledg learn instruct coexist learn sourc addit complet agent learn sourc knowledg extern analog type learn interact instruct learn instruct suggest notic theori learn tutori instruct present requir list met research ad incomplet knowledg explicitli deal issu incorrect knowledg instruct learn method develop readili combin requir met gener learn specif case situat fast learn procedur taught maxim prior knowledg increment learn learn type knowledg task perform knowledg type problem space comput model deal incorrect knowledg extend incomplet coexist learn sourc tabl requir transfer problem learn sourc focu demonstr requir transfer problem summar tabl distinguish featur abil learn type knowledg task perform instruct term complet respect instruct knowledg type relat work artifici intellig number system produc behav natur languag extens learn earliest famou plan act domain natur languag command focu primarili plan map transform natur languag input code fragment run produc instruct action system small amount rote learn goal specif directli transform sentenc state learn perform procedur recent research investig map problem power agent chapman plai video game instruct system pragmat ongo task understand incomplet instruct project map problem anim agent system learn impress recent agent behav natur languag vere bickmor homer homer live simul sea complex tempor understand rang instruct action time manner homer simpl learn assert condit instruct indic action photograph detail episod instructor refer past event explan action homer learn procedur kind domain knowledg sequenc make prior knowledg produc gener learn learn tutori instruct relat work learn extern guidanc advic carbonel earli system learn ontolog knowledg instruct haa understand simon procedur learn instruct natur languag descript task isomorph tower built oper differ tabl solv task foo bar earli attempt build system learn advic foo bar gener card game heart actual input natur advic perform specif task appli sequenc transform advic potenti appli difficult learn requir larg number produc multipl search heurist plai heart advic human problem difficult focu work thesi situat instruct research begun focu specif issu learn situat natur languag instruct martin firbi discuss approach interpret learn ellipt instruct match instruct expect gener task execut failur colleagu produc system learn oper devic instruct analog devic make written instruct specifi sequenc step achiev type interact instruct work concern learn relat instruct step procedur procedur similar goal work learn input learn system learn system defin consult directli assimil knowledg observ analyz step contribut user normal tutori instruct extend past work interact flexibl type knowledg learn past interact observ expert solut specif problem mitchel attempt solv problem expert verifi critiqu made perform system laird kodratoff gold porter learn observ expert solut provid flexibl interact observ primit action occur canon execut order achiev desir goal expert critiqu typic suggest step instructor verifi reject action tutori instruct interact abil number wai instructor unknown subtask unachiev agent teach larger task past typic specif complet unknown subtask tutori instruct explicitli situat instruct teach present current situat analyt induct learn method learn varieti domain specif focuss learn type oper implement goal decomposit rule oper version abstract goal control knowledg control featur procedur schema combin goal decomposit control learn sierra heurist classif knowledg complet tutor agent learn type knowledg task perform instruct contribut work make requir show evalu delin comput model underli instruct system perform meet demonstr wider breadth learn previou learn system interact knowledg acquisit tool learn relat tutori instruct earli interact requir direct manipul symbol level structur interact knowledg level user understand intern work system recent work elicit base mcdermott idea knowledg role chandrasekaran gener task framework techniqu gain power limit applic specif problem solv set knowledg role knowledg acquisit tool differ tutori instruct elicit class task tool applic task requir global control strategi base built problem solv acquir abstract procedur knowledg acquir knowledg interact concern fill knowledg role situat instruct specif task specif tutori instruct limit problem solv easili appli task requir control cognit scienc cognit studi examin learn individu subject interact procedur instruct instruct studi examin effect linguist form individu instruct file wright learn measur term global instruct train strategi studi shown tutor highli effect teach techniqu robustli produc stronger learn classroom instruct standard deviat number studi shown student amount prior knowledg larg impact learn instruct result relev model learn tutori instruct present model make heavi prior knowledg leverag learn subject instruct oper devic subject prior knowledg devic perform term speed retent relat result involv effect chi subject attempt exampl problem solut studi achiev higher perform solv problem subject theori learn tutori instruct present base chapter receiv tutori instruct studi predict greater learn transfer work compar cognit model procedur learn recent model base anderson model procedur learn turn base theori ident element transfer occur ident element specif rule multipl task anderson relat theori present ident element product rule chapter discuss relev human behavior data relat cognit describ behavior properti predict theori present outlin rest thesi chapter present definit task analysi problem learn tutori instruct problem face instruct map interact transfer problem instruct agent solv problem metric perform comparison instruct requir problem complet tutor agent develop focu work interact transfer problem rest thesi organ chapter present theori learn tutori instruct abstract term theori includ comput model problem space comput learn situat explan comput model defin learn task identifi type knowledg type knowledg learnabl instruct learn techniqu specifi instruct agent learn knowledg interact instruct chapter describ implement instruct embodi theori chapter learn type knowledg task perform handl implicitli explicitli situat rang interact flexibl earlier chapter describ learn complet extens procedur implicitli situat instruct describ capabl make agent basic learn task perform clear chapter describ learn remain type handl explicitli situat instruct applic cognit model explor chapter theori strongli influenc develop soar architectur theori cognit chapter analyz ey influenc aspect soar behavior properti instruct learn model base behavior set behavior predict model predict compar human behavior data cognit model procedur learn chapter result theori implement analyz current limit work opportun futur research discuss detail chapter conclud review major contribut thesi appendix describ perform larg instruct highlight system major capabl appendix mathemat analysi number instruct sequenc teach procedur analysi high flexibl instruct agent instructor appendix describ detail soar chunk mechan produc gener rule situat explan process chapter theori learn tutori instruct chapter present gener theori learn tutori instruct theori part comput model intellig problem space comput model specifi gener form agent indic type knowledg agent affect perform type knowledg defin tutori learn task evalu metric instruct learn knowledg type instruct learn call situat explan specifi instruct agent deriv gener knowledg instruct notion explan emploi deduct induct support interact instruct level explan instruct implement instruct agent embodi theori chapter problem space comput model comput model class system term set oper entiti interpret comput comput model agent defin complet set agent carri perform oper perform defin basic oper agent comput model defin complet set type knowledg agent task perform comput model gener instruct agent meet support gener comput gener type comput requir comput model flexibl close correspond knowledg level compon compon comput model correspond close knowledg level requir goal identifi comput model elucid class knowledg instruct map learn tutori instruct provid knowledg knowledg level section compon comput model knowledg difficult map learn instruct class comput model standard program languag languag support gener comput oper construct symbol direct correspond knowledg level dereferenc pointer directli correspond knowledg level action symbol level comput model provid leverag elucid agent knowledg type addit theori map instruct symbol level compon comput model requir problem exist theoret comput ture machin automata connectionist neural network model comput emploi comput level knowledg level model comput model instruct agent higher level descript comput system implement lower level model comput implement substrat higher level comput model instruct agent logic altern entiti logic match knowledg level logic set legal oper entiti modu combin logic formula logic oper defin space possibl comput logic notion logic provid comput control oper applic implement logic system add extra control mechan logic formal prolog control knowledg crucial type knowledg actual commun instruct desir comput model instruct agent includ control knowledg class comput model knowledg level compon problem solv method defin knowledg acquisit heurist classif constraint satisfact gener task method method knowledg requir term knowledg role control structur design famili method support gener comput flexibl choic comput model gener instruct agent method comput model instruct system target type proto learn heurist classif excel goal agent comput model agent knowledg select theori knowledg comput viabl altern theori defin function structur repres knowledg kind defin content structur conceptu depend theori cyc theori comput procedur knowledg agent comput structur ad theori produc work agent altern comput theori knowledg knowledg comput entiti oper comput model repres complet content theori knowledg provid breakdown knowledg learn categori comput model defin rang knowledg repres import respect map form rang map section map problem focu content theori knowledg includ part theori develop comput model adopt call problem space comput model newel yost describ agent structur comput framework comput problem space refer symbol level structur agent implement comput level symbol approxim knowledg level meet requir close correspond knowledg level compon soar symbol level implement select platform implement instruct agent perceptu modul motor modul extern environ figur process agent problem space comput model triangl repres problem impass schemat agent shown figur percept motor modul connect agent extern environ agent reach goal move sequenc state problem space state consist object attribut reflect current point process agent make progress goal sequenti appli oper current state oper essenti function produc state current modifi intern state action extern world agent reach impass immedi knowledg suffici select fulli appli oper problem space context goal resolv impass oper select appli state impass context comput entiti mediat agent knowledg state oper small set basic function agent perform state infer agent construct current state involv comprehend inform deliv perceptu make infer state properti base state properti agent knowledg block held gripper directli close oper select agent select oper appli current state involv type knowledg oper deem current hand block agent grasp preferenti knowledg preferenti knowledg compar order equal oper applic oper appli make current produc motor command oper appli indirectli subgoal oper applic knowledg oper effect oper appli directli current problem space agent knowledg effect oper state motor command produc select oper appli reach impass select sequenc oper subgoal knowledg oper applic case equal knowledg select oper select knowledg oper termin oper termin action complet termin goal concept oper state condit oper meant achiev termin condit held arm function perform knowledg defin set knowledg type present agent knowledg type summar tabl natur thought achiev subgoal typic oper higher subgoal version slightli present main differ descript includ task basic assum task formul oper knowledg type gener typic knowledg role problem solv method heurist classif thought knowledg role gener problem solv method entiti knowledg type state infer gripper close directli gripper hold block oper goal pick robot dock move oper preferenti pick object object reject pick goal pick small metal object prefer move pick magnet oper effect effect oper move robot dock oper termin termin condit oper gripper hold gripper tabl type knowledg agent complet agent select oper pick directli subgoal subgoal complet pick oper broad formul support gener comput newel problem space basi gener intellig behavior problem space support full rang behavior search base knowledg lean behavior weak method built knowledg rich behavior requir search local type control oper select sequenti base local inform type control match kind task readili taught tutori discuss chapter local control combin exhibit global control demonstr yost work yost knowledg acquisit languag acquir task requir global control support monoton extens agent knowledg appli piec knowledg local piec knowledg type ad requir reformul prior knowledg import properti instruct increment learn knowledg instruct lifetim knowledg conflict exist conflict fatal result impass agent reason possibl receiv resolv conflict comput model clarifi task face instruct agent agent learn type knowledg instruct section discuss learn process learn situat explan learn tutori instruct requir analyt learn prior induct learn prior knowledg goal work produc power analyt techniqu induct method goal theori techniqu appli learn task tutori instruct overview chapter theori learn tutori instruct meet number requir goal theori learn meet requir transfer problem extend incomplet knowledg requir gener learn specif case transfer fast learn task instruct transfer maxim prior knowledg transfer increment learn transfer abil learn type knowledg task perform transfer instruct interact flexibl knowledg full flexibl action interact situat implicitli explicitli situat instruct interact tabl transfer interact requir tutori instruct met learn theori reason step step figur explan reason step appli situat initi state goal achiev support flexibl interact meet target requir interact problem provid flexibl interact affect learn theori learn occur context ongo interact agent instructor tabl summar requir met theori requir primarili evalu place clear constraint type learn approach requir gener learn occur specif make maxim prior knowledg requir strongli learn approach base explan explan produc gener learn common theme machin learn dejong rosenbloom schank minton cognit scienc rosenbloom chi form explan enabl gener learn specif case explan featur case featur explan gener learn explain typic requir singl contrast correl induct requir exampl prior knowledg emploi construct explan prior knowledg strong bia learn form explan reason step lead current state reason achiev current goal determin explan path reason current state reason step diagram figur figur kei element reason step endpoint explan state goal reason step requir complet explan form element explan tutori ffl reason step explain tutori reason step explain individu instruct agent entir instruct episod full sequenc instruct procedur explain appli explan singl step result edg applic step gold explain full sequenc reason step result learn schema encod reason episod schank learn factor piec knowledg monolith schema plan structur knowledg appli reactiv knowledg access local base current situat mesh local control structur explain individu instruct support psycholog result shown subject instruct exampl individu line virtual reflect solut recogn plan span ffl endpoint explan endpoint explan initi state reason goal achiev situat instruct appli requir tabl specifi situat current state world goal hypothet situat explicitli languag instruct work machin learn involv explan base current situat perform goal state except learn system learn observ expert goal observ action meant achiev state determin goal observ action process plan recognit kautz type instruct consid plan recognit goal instruct intend achiev current goal hypothet goal ffl requir reason step complet explan agent bring prior knowledg bear complet path instruct achiev goal instruct appli earli work learn dejong requir deduct explan built complet correct domain theori tutori instruct requir broader notion point receiv instruct agent knowledg incomplet wai explan includ step base directli prior induct step prior instruct requir complet miss part number research discuss learn explan involv induct step induct step base naiv theori explan causal occam explan pattern base unexplain featur explain rosenbloom induct step explan approach knowledg level learn simpli compil knowledg present perform system knowledg level learn requir learn tutori agent expect learn complet unknown effect requir learn type learn knowledg compil theori learn tutori instruct base produc explan individu instruct appli situat explan process situat situat instruct appli endpoint explan determin situat instruct appli current hypothet situat construct instruct agent attempt explain instruct lead goal achiev situat state agent explain perform instruct situat lead goal achiev goal neg gener learn instruct explan featur situat instruct crucial crucial featur situat instruct appli futur explan agent miss kei knowledg figur point agent learn miss knowledg complet abandon explan subsect elabor determin situat instruct appli situat consist initi state goal achiev addit state situat includ goal success goal success complet expect immedi current instruct carri failur complet failur complet expect block carri current situat featur implicitli appli agent current situat languag instruct explicitli featur state goal instruct intend appli make kind explicitli situat instruct light push hypothet includ light turn flip hypothet goal turn machin simpl action command assum lead success achiev prohibit action expect failur achiev goal assum success achiev perform chapter implement agent present construct hypothet situat base comprehend singl instruct hypothet state hypothet goal hypothet situat exist multipl instruct support situat applic instruct agent attempt explain instruct lead expect outcom situat explain instruct explain instruct prior knowledg prefer make induct leap explan presum prior knowledg high qualiti suffici explan learn high qualiti instruct agent explain instruct prior knowledg prior knowledg agent knowledg oper state execut knowledg appli current situat select appli oper make infer point natur knowledg explain instruct appli situat instruct explain explan form forward intern agent instruct run appli step knowledg state imagin situat expect goal outcom reach project path situat state instruct step goal explan instruct forward project common techniqu plan contrast aim search project project effect step instruct oper op appli state achiev goal process intern project op diagram figur process state meet oper xs termin condit op state oper subgoal state infer op situat state situat goal instruct oper tc op tc tc tc figur structur process explain instruct oper situat begin top state select oper arrow move lower level repres impass lead process subgoal agent situat applic state oper complet goal correspond oper complet subgoal agent attempt complet perform instruct oper op involv simul agent happen instruct project op knowledg appli project select appli effect oper make direct applic prior knowledg situat explan op success subgoal achiev reach expect complet project knowledg agent possess explain instruct intern project explan instruct command oper op perform instruct commun type knowledg similar explan knowledg requir explan instruct involv knowledg oper op goal oper state project pass figur elabor explan indic point type knowledg compon appli project process figur categori knowledg intern project explain state infer knowledg appli state intern project map knowledg op produc select instruct knowledg effect op directli seri appli state alter reflect execut op op primit project op requir applic seri requir carri op involv oper oper oper effect knowledg knowledg op termin goal agent termin op point intern project op tc op op tc tc tc instruct state infer op instruct knowledg oper effect op termin condit op termin condit implement op effect implement effect categori figur type knowledg explain instruct op complet explan agent rest implement select effect seri oper op complet involv oper oper oper effect knowledg lead complet agent termin condit recogn goal complet intern project requir knowledg categori includ type intern project process result success explan op situat explan crucial featur op requir agent learn gener knowledg op state reach goal deal incomplet explan agent unabl complet explan piec knowledg categori unknown agent incomplet explan unresolv impass intern project preclud complet possibl miss knowledg summar figur agent kei effect crucial state make unabl reach gs termin condit intern project command oper op complet unknown instruct oper agent explain complet explan piec knowledg learn agent explain piec knowledg mk categori figur unknown command perform oper op op mk knowledg effect op figur show kind chapter instruct turn push agent learn push button goal turn light attempt explain instruct simul push button oper figur light figur simul complet successfulli agent miss knowledg gener learn failur op achiev explain success agent lack knowledg knowledg situat incomplet knowledg incomplet knowledg op incomplet termin condit unknown impl unknown effect state infer knowledg unknown op map unknown op effect unknown op termin condit unknown situat state situat goal instruct oper goal expect read instruct knowledg incomplet op impl unknown effect figur type miss knowledg incomplet explan light light light light turn push select op goal explan hypothet figur miss knowledg complet explan learn instruct knowledg learn mk miss knowledg complet explan push button affect light multipl piec knowledg explan unknown multipl mk determin knowledg mk miss incomplet explan extrem difficult gener hard credit assign problem agent determin knowledg present led success explan algorithm determin mk explan agent give explain delai explan miss knowledg mk complet explan acquir agent delai complet explan miss knowledg learn agent simpli memor told miss knowledg mk memor recal successfulli learn learn directli agent knowledg incomplet wai easili induc learn agent attempt learn knowledg glean instruct explan base learn involv heurist induc instructor verifi alter agent explain instruct perform op heurist induc set condit op instructor edit set produc op process system complet explan learn mk induc mk complet explan agent make good guess mk miss case heurist induc miss knowledg learn mk explan learn give explain delai explan learn directli complet explan learn mk induc mk complet explan instruct learn mk tabl option explan instruct complet piec mk unknown mk learn instruct ongo dialogu delai explan mk learn good guess mk made learn directli complet explan good heurist guess mk made induc mk complet explan mk learn heurist guess type mk made instruct learn mk tabl condit option explan instruct complet instruct learn miss knowledg mk instructor explain teach agent mk instruct mk explan learn induct guess mk complet explan present instructor verif alter final option open possibl multipl level instruct agent initi instruct perform complet explan heurist induc explan complet instruct learn base explan includ mk provid mk high qualiti piec high qualiti knowledg multipl level instruct lead learn higher qualiti knowledg singl learn lower level support learn higher level mk futur explan exampl chapter demonstr possibl option deal incomplet explan list tabl option depend properti miss knowledg mk involv kei mention mk learn ongo dialogu good heurist guess mk made condit option summar tabl condit heurist type situat point process explan process break option circumst specif chapter theori includ explicit check consist newli learn knowledg ad agent knowledg base kodratoff tecuci point learn consist extent acquir knowledg current knowledg current knowledg deriv knowledg situat explan process involv appli knowledg agent maintain kind standard notion semant consist domain explicit measur consist requir explicit consist situat explan meet requir learn increment agent occur part ongo process add piec knowledg agent long term memori modular local control structur enabl knowledg ad memori independ current knowledg conflict piec oper perform impass reason resolv instruct maintain perform chapter comparison altern approach situat explan compar theori instruct learn develop base altern learn approach major learn approach correl learn induct base correl reason approach constrain meet learn requir tutori result differ similar situat explan requir tabl learn occur quickli make prior requir implicitli explicitli situat strongli constrain theori develop correl learn correl learn involv induc concept correl featur valu multipl exampl correl featur import concept learn correl techniqu includ symbol concept learn cluster method michalski connectionist method reinforc learn techniqu instruct explicitli determin situat instruct includ precursor correl featur situat serv input learn algorithm pure correl method make prior knowledg drawn exampl aid method requir larg number exampl learn instruct prior knowledg expect produc gener learn learn correl method augment abil prior knowledg produc fast learn number research discuss wai gordon towel induct step attempt maxim prior knowledg requir prior knowledg complet prior knowledg includ control causal knowledg select oper instruct agent knowledg bia learn involv explan process requir instruct correl method learn instruct similar situat explan differ remain situat explan attempt learn singl induct verif explan theori correl learn basi make multipl exampl induct multipl exampl emploi approach learn altern emploi reason method schank learn instruct case consist sequenc instruct procedur perform procedur previou case recal alter appli current situat alter process result learn gener form case learn similar thought point continuum kei dimens continuum ffl grain size case method typic work full reason sequenc reach goal full sequenc method work singl step reason singl interact instruct learn individu step explan process knowledg learn step sequenc affect learn remain end result view distribut case schema encod procedur ffl gener storag versu retriev time method typic gener case primarili retriev time case store rote form case retriev similar base alter case case index gener method typic explain gener store gener knowledg deriv theori present view blend approach instruct agent attempt explain instruct explan miss knowledg learn tabl agent memor instruct rote retriev explan time process detail chapter correl instruct agent deal explicitli situat explicitli featur situat indic retriev case alter case situat involv prior appli explan type process meet requir theori end similar situat explan evid al describ approach learn written procedur instruct instruct alter procedur pai produc relat procedur alter past process involv method determin instruct role procedur correl constrain requir end similar situat explan differ remain result differ perform tutor agent empir question chapter present theori learn tutori instruct meet requir complet tutor agent chapter half chapter comput model intellig problem space comput elucid type knowledg comput model half chapter learn situat instruct agent learn gener knowledg instruct theori demonstr describ implement instruct embodi theori chapter describ learn extens procedur situat learn procedur involv learn oper termin condit implicitli situat instruct chapter describ learn remain type handl explicitli situat instruct chapter learn extend procedur chapter present implement instruct agent embodi theori learn tutori instruct chapter implement soar architectur appli simul robot domain includ object control manipul agent engag interact dialogu receiv instruct form natur languag sentenc learn perform task extend knowledg domain meet transfer interact requir learn tutori instruct target previou list tabl learn type knowledg task perform knowledg type learn implicitli explicitli situat support flexibl instructor request task perform agent task perform current situat list tabl enabl exhibit wider breadth learn interact previou learn system implement soar product begin line learn product simul domain appli interfac soar consist line code descript soar statement domain initi chapter discuss learn procedur tutori instruct implicitli situat imper chapter describ learn complet agent prior knowledg learn extend procedur appli unfamiliar situat procedur correspond complex termin learn procedur involv learn select knowledg oper seri implement termin condit oper chapter complet descript describ learn remain type explicitli situat instruct appendix detail agent process extend demonstr full rang learn interact capabl soar built architectur problem solv learn soar appli larg number problem ai cognit scienc basi unifi theori cognit requir gener learn specif case transfer fast learn task instruct transfer maxim prior knowledg transfer increment learn transfer abil learn type knowledg task perform transfer instruct interact flexibl knowledg full flexibl action interact situat implicitli explicitli situat instruct interact tabl transfer interact requir tutori instruct met learn theori categori type knowledg oper chapter type oper termin chapter learn oper preferenti chapter oper effect chapter state infer chapter situat implicitli situat chapter flexibl explicitli hypothet state chapter handl hypothet goal chapter flexibl full flexibl action command chapter content chapter tabl coverag knowledg interact type activ occur appli oper state problem space soar agent make progress problem impass subgoal gener resolv impass major compon soar discuss descript learn learn occur soar result return subgoal learn call produc summar process subgoal led creation result depend type chunk correspond type knowledg shown tabl similar situat chunk impass origin subgoal avoid produc result directli chunk form learn summar induct deduct step chunk lead induct deduct learn chunk occur make learn part ongo activ agent domain primari domain appli simul robot domain shown figur graphic simul domain built run silicon graphic machin techniqu appli limit flight domain soar control flight simul instruct agent figur hero robot arm gripper robot room block size made light control push button gripper grasp small block figur robot domain appli properti singl type locat size color gripper statu robot tabl relat gripper hold block block tabl gripper block gripper block gripper block gripper block figur basic properti relationship robot domain fit larg block block made metal small pick magnet magnet statu toggl gripper close magnet white light bright red button toggl light green button toggl dim agent initi knowledg made set problem space soar problem space implement agent main categori natur languag process origin develop lehman knowledg obtain knowledg task domain task knowledg extend learn instruct agent knowledg learn instruct codifi theori learn tutori instruct agent begin abil interact instructor read instruct agent expand interact natur languag capabl se learn sentenc map oper learn read augment version lehman natur languag theori develop soar learn speed process read sentenc agent abil perceiv world recogn set basic object properti relationship object properti relationship shown figur agent perceiv entir visibl world shift perceptu attent model agent initi task knowledg list tabl includ knowledg set primit move open close move arm relationship object left agent natur languag sentenc map execut oper extern incomplet knowledg effect initi ffl knowledg map simul primit oper execut ffl knowledg hold object close hand small object held move hand hold held object move initi unknown learn appendix ffl knowledg complex oper ffl knowledg control light magnet push button affect light grasp magnet affect statu ffl abil recogn magnet statu ffl knowledg magnet magnet effect metal object ffl abil recogn magnet object ffl knowledg action avoid grasp tabl initi domain knowledg intern project effect oper unknown agent agent hold close hand small object close hand larg object agent knowledg magnet light understand mean turn turn magnet light chang light bright agent magnet attract metal object agent complex oper involv combin primit pick line block agent initi domain theori incomplet number wai learn fill expand knowledg domain deal incorrect domain knowledg begin assum incomplet area futur chapter section describ learn extens procedur appli procedur learn face incomplet underli domain knowledg technic detail implement found instructor input font ital pick red block move yellow tabl move arm red block move move close hand move oper finish figur instruct teach pick block learn procedur section describ abil learn complet procedur instruct explain teach agent pick block set instruct task shown figur procedur form oper pick thing procedur told red agent learn oper execut natur languag oper termin select oper base natur languag agent argument structur oper natur languag map argument structur learn oper involv learn oper agent learn oper argument instanti pick agent acquir oper singl instanti object isnt pick map natur agent learn map natur languag semant structur instanti oper select command futur pick agent learn map semant object singl argument oper templat agent learn perform oper oper perform execut sequenc primit learn implement form select knowledg move proper move termin agent learn recogn oper achiev goal concept oper termin condit includ hold desir arm oper templat natur languag map involv map problem fairli straightforward approach map learn part oper agent assum argument structur natur languag command request unknown oper requir argument structur oper learn templat argument argument structur map argument structur oper templat approach suffici imper sentenc direct fail command complex path constraint tv learn gener oper implement agent solv transfer determin proper scope applic instruct perform oper instruct yellow condit agent move featur determin situat explan techniqu previou chapter solv attempt explain instruct lead success complet oper initi execut instruct agent termin condit make imposs explain instruct lead achiev diagram figur agent learn termin condit oper initi execut complet initi agent explain instruct fall back simpli memor instruct tabl initi learn base weak induct believ instructor learn rote flavor end initi termin condit oper induc agent form explan recal episod goal termin forward intern project base gener implement sequenc oper learn detail learn procedur illustr teach agent pick block agent instruct figur perform task execut execut agent perform exact task requir requir learn tutori instruct agent part oper earlier execut part oper left agent repeat task instruct instruct red languag comprehend produc semant structur resolv red block agent environ semant structur produc correspond indic agent learn oper oper templat gener argument structur directli correspond semant structur argument agent learn map semant structur present similar natur languag request map oper oper select execut agent doesnt implement immedi reach impass instruct instruct tabl comprehend execut turn instruct provid implement oper implicitli instruct appli current situat agent find implement sequenc learn proper level base explain instruct oper lead success execut oper initi goal oper shown figur unknown goal preclud complet explan agent current instruct miss knowledg complet explan instruct includ knowledg step instruct termin condit oper perform oper complet agent option set option deal incomplet explan tabl explain instruct miss knowledg learn agent requir learn implement step perform task futur requir instruct step instruct explain figur instruct teach oper explain goal termin oper learn recal instruct isa isa tabl color yellow id isa isa arm isa block color red id isa isa arm oper finish isa block color red id tabl figur episod case learn side effect comprehend instruct procedur agent resort rote record told situat record process explicit memor occur side effect languag read agent learn set rule encod sentenc semant featur rule resolv refer provid memori past refer simpl version grosz focu space mechan rule record index goal appli place instruct sequenc episod case result correspond sequenc instruct perform illustr figur agent encod red told move yellow drawn singl structur figur encod exist multipl singl semant featur instruct properti episod memori discuss detail chapter issu gener index inform episod case point gener pure agent unabl explain step episod overli conserv approach leav case fulli rote form evid peopl conserv gener memori procedur step carri step pick red agent told oper indic goal oper achiev explicit indic requir agent concept instruct indic oper goal met trigger agent learn termin condit learn termin condit induct concept format problem termin goal oper learn deriv agent current correct concept chosen complet instructor standard concept learn approach instructor expect learn small number exampl learn termin condit oper singl heurist induc set termin condit subset current instructor final set condit heurist induc initi guess oper termin condit current state world compar initi state agent figur final state pick red block command perform oper chang consid part termin condit oper final state case shown figur initi state robot stand hold block gripper air color object type block tabl includ chang simpl heurist form system induct bia learn termin condit reason simpl condit chang doesnt matter pick block robot end tabl unchang condit learn build block color import make initi induct agent present induc set termin condit alter eventu verifi interact occur red shown tabl instructor robot dock tabl import goal pick object instructor add featur goal concept similar exampl appendix instructor verifi goal learn set termin condit oper perform induct learn termin condit ebl theori gener featur current state vanlehn rosenbloom type guess robot dock tabl gripper close gripper hold block gripper block robot tabl guess gripper close gripper hold block gripper block tabl interact instructor learn termin condit oper dash word instructor input simplifi natur languag focu thesi induct learn advantag agent alter induct bia reflect knowledg agent knowledg glean instruct instructor indic featur add alter induct knowledg sourc emploi includ analog oper pick action domain specif process learn termin condit view form explan instruct oper agent explain oper finish termin condit oper termin condit miss knowledg complet explan instruct case agent make good guess mk heurist induc termin condit option deal incomplet explan list tabl agent appli heurist move option instructor alter verifi induct mk execut ffl carri sequenc instruct achiev oper ffl learn oper templat oper ffl learn map natur languag oper ffl learn rote execut sequenc side effect natur languag ffl learn termin condit oper agent learn part perform task instruct implement oper episod perform exact task learn gener pick block goal object sit tabl robot dock gripper statu oper figur gener oper rule learn instruct yellow newli learn gener oper implement agent goal concept full implement sequenc oper knowledg explain instruct implement sequenc lead goal provid underli domain knowledg suffici explain instruct agent learn implement oper gener form transfer rang similar situat instruct explain recal episod memori intern project effect rest path achiev termin condit oper explan crucial featur instruct situat lead success crucial featur combin gener rule instruct oper condit rule learn yellow shown figur rule gener origin instruct includ color critic achiev goal special origin instruct ad fact tabl object pick sit object small small object grasp rule includ fact gripper import grasp block instruct case detail soar chunk mechan produc rule base forward project appendix learn gener rule step instruct agent perform task refer rote case green rule map languag semant oper gener instanti green block argument select perform gener rule fire match current implement oper robot dock proper rule shown figur oper select perform agent perform implement step recogn termin condit met gripper hold green termin gener rule implement task directli condit agent perform task start state implement path react unexpect condit robot steal rote implement initi learn appli start origin initi reactiv step condit state learn gener rule instruct procedur recal explain point execut altern explain instruct execut explan requir observ effect instruct action execut explain state properti lead observ effect close hand block block causal agent track observ deriv observ state end import net effect instruct sequenc form learn oper termin condit learn termin agent form explan execut chain backward termin condit explan effect build explan instruct kind process viabl altern recal explan process disadvantag agent track observ deriv correspond recal strategi agent number option recal form explan instruct sequenc possibl introspect recal agent recal attempt explain full sequenc instruct oper immedi complet oper learn termin condit multipl recal agent recal attempt explain full sequenc instruct oper perform oper start initi state singl recal agent recal attempt explain singl instruct sequenc perform oper start initi state point execut agent recal attempt explain forward project project result path goal recal instruct sequenc continu forward agent explain instruct simpli execut extern world recal strategi implement strategi paramet agent dynam select strategi run recal strategi detail introspect recal introspect recal agent recal explain entir instruct sequenc immedi complet execut oper learn involv intern forward project multipl begin state agent oper suggest state robot stand corner arm hold start agent recal simul instruct eventu reach termin condit oper multipl oper project explain oper implement provid termin condit oper achiev advantag strategi agent learn fulli gener version oper execut agent pick object strategi disadvantag requir agent rememb initi state command perform oper difficult amount inform state larg robot domain instruct multipl multipl state rememb multipl step recal simul requir project entir sequenc instruct time consum introspect requir amount time proport length sequenc instruct agent ongo perform task hand temporarili suspend awkward procedur learn nest larger task agent pressur act quickli tc sn tc state reflect actual oper effect state reflect project oper effect sx sx correct path actual oper intern project path agent incorrect knowledg oper tc state meet termin condit current goal figur multipl step project requir introspect multipl recal strategi result incomplet explan due compound error agent domain knowledg multipl step project suscept compound error agent underli domain knowledg project success oper begin state reflect agent knowledg effect prior oper shown figur knowledg incomplet state move reflect actual effect prior oper lead incomplet success explan reach success earli instruct minor domain knowledg problem knowledg individu result error singl step combin project error singl recal strategi overcom problem multipl step requir multipl execut learn full gener implement multipl recal multipl recal agent wait recal explain full implement sequenc oper perform oper start initi state pick red agent select newli learn recal instruct execut attempt explain introspect multipl recal strategi agent recal project multipl oper strategi requir agent recal initi state project small domain robot minor advantag disadvantag strategi compar introspect strategi requir execut oper learn gener implement singl recal multipl recal singl recal strategi agent wait perform oper attempt recal explain implement instruct agent recal singl instruct intern project time recal oper agent appli gener knowledg rest implement oper agent rest gener path complet recal instruct sequenc intern project termin singl recal oper appli extern world singl recal strategi requir number execut oper equal length instruct sequenc learn gener implement limit recal execut number cycl figur cycl versu execut number learn singl recal strategi execut number figur cycl execut number learn move object left singl recal strategi close gripper move arm open gripper move arm move arm move move tabl move tabl move left figur graphic view flat instruct sequenc singl step singl execut gener singl recal major disadvantag compar lead interest learn ffl learn gener learn start end implement sequenc move begin execut path goal instruct sequenc lead directli goal gener instruct learn instruct intern learn oper lead goal achiev project gener instruct learn pattern continu back entir sequenc full implement learn gener figur show learn result learn curv close approxim power law practic figur show similar curv learn move object left ffl effect hierarch instruct due agent learn procedur quickli step taught hierarch organ flat sequenc figur depict step instruct sequenc teach move block left figur depict hierarch instruct sequenc instruct maximum subsequ break instruct sequenc shorter hierarch organ multipl hierarchi gener execut gener learn step oper execut flat instruct sequenc taught hierarch step execut requir full gener learn number lower hierarchi gener integr higher hierarchi instruct figur grasp implement gener grasp includ gener implement pick sequenc action taught hierarchi subtask subsequ execut gener hierarchi figur irregular result speedup length subsequ small smaller shown figur flat sequenc figur execut initi execut instruct hierarch sequenc hierarch organ addit advantag oper learn futur instruct singl recal strategi overcom problem multipl step project recal project singl instruct time requir time consum introspect suspend agent ongo activ figur illustr compar time pick put grasp close gripper move arm open gripper move arm move arm move move tabl move tabl move left figur graphic view hierarch instruct sequenc oper shown bold flat sequenc hierarch sequenc execut number cycl figur cycl learn trial execut compar flat instruct sequenc hierarch sequenc singl recal singl recal strategi multipl recal strategi execut number figur cycl extern action learn trial learn compar strategi extern action execut singl multipl recal strategi entir recal explan time proport length instruct sequenc singl recal time interleav execut instruct fulli execut singl recal strategi overcom problem compound domain theori begin project instruct current state world extern execut previou instruct begin state project correctli reflect effect previou oper implement sequenc singl multipl recal strategi endpoint continuum strategi involv recal intermedi number instruct extend procedur situat addit unknown instruct agent perform procedur unfamiliar situat agent successfulli perform procedur instruct red shown figur agent red agent primit oper goal concept hand perform oper arm arm precondit perspect agent current knowledg case arm agent perform instruct option agent follow appli weak method analysi reason fairli agent simpli figur reach state arm current state differ significantli state instruct search involv costli goal investig agent instruct reach impass task goal sit tabl robot dock arm lower oper figur oper rule learn instruct extend agent abil move thing situat search agent told arm attempt explain instruct forward intern project agent start project current robot dock tabl red block arm step move arm project implement move arm red block explan move enabl move agent learn oper rule shown figur rule extend agent knowledg oper appli situat agent learn similar rule solv problem search receiv extend instruct agent dock tabl object learn move tabl extend oper situat requir multipl step multipl step recal explain recal strategi previou section newli learn oper requir extens situat agent learn gener implement reason situat oper perform limit explan seri situat actual execut oper learn appendix learn pick agent pick block hold block instructor agent put held block agent pick block agent learn put hold pick notic flexibl afford instructor command oper agent current knowledg tabl instructor track procedur knowledg agent avoid command instruct organ extend task instructor deal incomplet underli domain knowledg gener implement learn chapter depend agent form complet explan instruct prior domain knowledg domain knowledg make explan agent kei effect primit chapter miss piec mk implement sequenc procedur learn result incomplet explan implement sequenc consist multipl pinpoint knowledg miss extrem difficult credit assign problem constrain preclud search knowledg soar strength integr knowledg sourc explan failur detect end project instruct sequenc miss knowledg oper sequenc difficult make heurist guess miss knowledg mk unknown knowledg acquir futur point explan complet mk agent action abandon explan learn knowledg oper figur instruct support explan tabl rule learn appli set heurist instructor alter eventu verifi result knowledg perform illustr experi knowledg secondari oper effect axiom type primit oper remov instruct agent close hand gripper statu longer close hand directli block block held secondari effect knowledg intern project effect oper real agent lack type knowledg knowledg rare secondari effect lack basic knowledg primit primari effect termin condit knowledg agent taught pick red block agent attempt recal explain implement sequenc usual secondari oper effect knowledg miss knowledg close gripper block forward intern project explain instruct sequenc achiev goal oper block pick end agent knowledg inabl project achiev oper termin condit constitut explan agent record learn fact procedur instruct explain agent perform procedur similar initi state agent learn gener implement past instruct recal agent recal explain instruct fail past explain instruct agent heurist induc knowledg instructor alter verifi agent recal command move yellow tabl gener knowledg learn command oper rule shown figur oper rule oper op state achiev goal induc rule agent induc condit op goal simpl heurist type object fill slot kei featur gener singl fill object isa block determin condit emploi simpl ffl object attach op object attach comput shortest path relationship length featur path consid import condit heurist captur intuit op involv relationship object relev goal import heurist oper yellow shown figur figur path red object red yellow destin op yellow path featur block ad infer set condit op ffl termin condit op achiev state op consid import condit figur op yellow red im guess condit goal robot dock tabl block sit tabl tabl interact instructor induc oper rule heurist captur intuit primari effect op encod termin matter achiev op chosen perform move yellow tabl op primari effect robot end dock tabl fact robot initi dock tabl ad infer set condit op heurist induc set condit op result present alter eventu verifi interact case shown tabl heurist identifi reason set instructor simpli verifi result set featur alter oper rule learn exchang shown figur similar rule learn explan appli pick stipul object small identifi relev condit select oper difficult interact condit oper effect situat difficulti face programm program agent task problem avoid domain knowledg aid instructor heurist identifi relev condit domain knowledg insuffici rule oper appli extern world agent achiev impass agent recal instruct red rule instruct induc interact shown tabl instructor add robot dock tabl action instructor overlook action simultan futur execut requir instruct learn prefer goal object sit tabl robot dock oper figur oper rule learn yellow direct domain knowledg insuffici explain instruct im guess condit goal arm block robot yellow tabl im guess condit goal arm block robot dock tabl tabl induc condit oper requir alter process learn rule execut oper occur agent learn gener implement oper implement correct learn appli block small object complex infer gener implement success psycholog research show subject learn procedur instruct degrad domain model process directli learn oper rule agent overcom incomplet domain examin condit oper incomplet explan procedur oper procedur instruct sequenc unknown altern implement agent observ effect oper sequenc perform compar observ effect predict domain knowledg differ notic agent induc knowledg oper effect explan procedur complet learn effect oper observ explor number research shen carbonel sutton learn termin condit oper amount learn observ effect sequenc learn oper effect observ ad variat process altern learn unknown oper effect instruct learn effect oper instruct chapter explan procedur fail miss knowledg effect imposs gener pick put grasp move arm close gripper move arm open gripper move tabl move tabl move arm move arm move arm put move move left figur hierarchi oper learn primit oper shown light learn oper boldfac instructor pinpoint knowledg miss base kind explan failur identifi unknown knowledg difficult explan procedur agent resort directli infer rule instruct chapter learn complet extens procedur appli tutori instruct agent support hierarch point instructor request unknown procedur agent perform current state lead multipl level instruct newli learn oper instruct lead learn oper hierarchi hierarchi oper learn shown figur subset learn appendix learn procedur hierarchi identifi fundament compon children skill acquisit tutori instruct learn hierarchi figur agent learn complet oper achiev precondit oper extens oper work robot hold support flexibl interact hierarchi taught wai oper taught teach higher oper pick teach learn procedur involv induct analyt learn addit learn success explan chapter exampl option deal incomplet explan chapter initi execut agent learn implement sequenc end termin condit oper induc base differ initi final feedback instructor implement sequenc move proper level gener situat agent recal instruct explain forward intern project instruct lead complet oper agent underli domain knowledg insuffici successfulli explain instruct resort strategi directli induc oper knowledg instruct lead high qualiti learn simpl gener learn lower qualiti learn requir met chapter gener learn specif case fast learn task instruct maxim prior knowledg increment learn abil learn type knowledg task perform state infer oper oper preferenti oper effect oper termin instruct flexibl knowledg content full flexibl action command situat flexibl implicitli situat explicitli hypothet state hypothet goal tabl transfer interact requir tutori instruct met descript burden instructor tabl transfer interact requir tutori instruct met point descript chapter complet descript describ explicitli situat coverag outstand knowledg type remain cover tabl chapter complet instruct agent chapter describ coverag remain requir theori tutori instruct shown tabl discuss abil learn state infer oper preferenti knowledg oper handl varieti type explicitli situat instruct demonstr capabl reveal interact support instruct action command agent capabl demonstr primarili seri select exampl demonstr chapter organ instruct agent chapter form instruct scenario instruct build knowledg agent learn earlier exampl exampl exampl primarili involv teach agent electromagnet light domain agent perceiv visibl control magnet effect object assum agent taught procedur push dim grasp techniqu previou chapter end instruct scenario agent learn control turn light prefer statu knowledg effect magnet pick metal object magnet learn hypothet state recal situat instruct appli includ goal higher level oper expect instruct effect achiev goal instruct section explicitli explicitli specifi hypothet state meant appli appli current world state construct hypothet state base semant content explicitli situat instruct straightforward includ state relationship mention object carri consequ hypothet state agent attempt explain learn construct hypothet state begin state intern project learn state infer knowledg state infer knowledg knowledg object properti relationship infer base properti relationship hold knowledg magnet block materi metal statu figur partial hypothet state built condit state infer magnet directli block magnet stuck state object isa magnet statu isa block materi figur state infer rule learn condit instruct form product test state condit produc state properti refer oper product produc result immedi state meet retract result condit longer hold learn state infer rule kind specif grei block gener magnet magnet condit magnet directli block magnet stuck state infer instruct introduc properti relat unknown agent statement extend vocabulari agent repres world relat agent condit instruct agent learn associ featur object gener statement agent learn magnet statu power agent recogn instruct commun state infer lack action mention instruct learn state system begin construct hypothet state object properti mention statement simpl statement exampl object mention verb includ hypothet grei block indefinit refer instruct produc gener object hypothet definit refer produc specif object uniqu current world state condit condit specifi part hypothet state hypothet state construct shown figur creat hypothet agent simpli assert conclud properti relationship instruct hold state simpl agent assert properti verb materi assert consequ magnet assert soar creat chunk creat properti base condit hypothet state state infer rule chunk learn condit instruct shown figur explan process learn state focu work learn procedur knowledg extens goal isa light id statu oper statu figur oper rule learn condit instruct light turn explain instruct infer hold hypothet result gener learn learn oper knowledg hypothet state light turn light trust condit instruct oper set state condit appli hypothet situat hypothet state instruct goal hypothet situat agent top level agent pursu goal agent creat hypothet state condit instruct light start agent attempt explain instruct intern project action turn light turn light project result agent understand light make explan instruct complet failur complet explan miss knowledg instruct involv singl action specif state agent make heurist guess miss knowledg involv action involv knowledg state agent instruct gain knowledg set strategi deal incomplet explan tabl instructor declin give trust instruct agent induc reason turn light success base current knowledg agent featur hypothet state light conserv approach assum featur hypothet state relev state includ light agent assert light happi met assert state light achiev happi complet explan agent learn desir oper rule shown figur rule appli specif definit refer light origin instruct light bright dim light dim light electr bright light electr agent learn turn light learn termin condit simul primari switch light statu state object isa light bright low figur state infer rule learn light goal isa light larg oper figur oper rule learn condit instruct light bright dim procedur learn dim light agent build hypothet state bright project instruct action instructor give instruct explain dim bright light lead happi instruct light agent learn state infer rule previou shown figur rule appli final state light dim told light agent learn similar rule appli initi state bright light trigger part agent prior knowledg happi agent reduc resourc electr happi happi achiev intern complet explan origin agent learn oper rule shown figur rule gener origin instruct due explanatori appli light consum larg amount specif bright light refer instruct learn condit instruct exampl agent pursu goal explicitli situat instruct agent learn perform procedur instruct procedur perform situat current situat abil teach instructor teach agent altern includ situat rare overcom shortcom implicitli situat instruct instruct common tutori ford thompson found condit statement instruct manual commun option student interact agent grasp blue block blue block metal grasp magnet agent taught grasp block metal instructor agent block action requir condit instruct blue block metal grasp similar previou section agent expect learn oper rule grasp magnet condit agent begin determin situat instruct meant appli goal isa block materi isa magnet oper figur oper rule learn instruct block grasp oper learn situat consist current goal blue hypothet state variant current blue block block grasp properti materi metal start hypothet agent attempt forward pick magnet block grasp project agent learn gener oper rule usual case agent miss knowledg complet explan goal concept rest instruct reach goal instruct explain rest instruct agent blue appli block metal normal grasp agent learn close hand grasp grasp metal object hand close magnet knowledg complet grasp metal object explain agent learn miss abandon explan directli induc knowledg learn instruct tabl appli heurist section agent induc oper rule addit condit gener condit instruct includ condit present instructor alter im guess condit goal block metal move yellow tabl move blue block instructor verifi agent learn oper rule shown figur learn agent finish grasp blue continu receiv instruct task agent point learn reject oper section describ learn reject oper type oper preferenti knowledg knowledg reject oper commun neg instruct prohibit action situat goal isa block color isa gripper hold state fail achiev happi figur rule recogn failur learn instruct prohibit action grasp green explan oper isa block color reject oper figur oper reject knowledg learn instruct prohibit action grasp green explan oper learn grasp grasp green block trust green block neg instruct command prohibit appli hypothet situat neg creat hypothet situat prohibit action state green block grasp hypothet goal instruct appli current default top level goal happi goal expect execut prohibit action green expect lead lack happi hypothet agent intern simul action grasp green neg result intern forward project grasp action result fine state agent green block grasp agent understand action prohibit agent deal incomplet explan guess miss knowledg involv state infer previou instructor declin give trust agent simpli assert final state hold green unhappi assert agent learn shown figur recogn unhappi state failur achiev happi meet goal expect complet explan origin neg instruct base agent learn oper reject rule grasp green shown figur instruct complet agent explan neg instruct agent told green block agent learn state infer block color green high rule add high green block agent simul grasp hypothet situat agent touch highli object lead neg result agent conclud final state intern grasp green unhappi learn rule shown figur reach neg result complet explan origin agent learn oper reject rule avoid grasp object shown figur goal isa gripper hold state fail achiev happi figur rule recogn failur learn instruct prohibit action grasp green explanatori instruct block oper reject oper figur oper reject knowledg learn instruct prohibit action grasp green explanatori instruct block complet explan explanatori case agent gener learn case rule case shown figur appli green block agent blue block avoid grasp blue blue block agent learn state infer grasp blue block grasp blue block fail addit learn avoid specif action grasp agent learn recogn state fail reach goal state avoid grasp explicitli mention move green block move close hand bad state open agent consequ suggest action perform realiz close hand green block action lead bad state action rule recogn bad state figur appli recogn bad agent thing select oper primari effect previou oper agent primari effect primit open bad state agent opportun learn oper led bad state usual intern project lead fail state agent learn reject oper futur lead bad perform rule learn shown figur agent avoid close hand close hand directli green close hand fail oper high size isa gripper reject oper figur oper reject knowledg learn agent close hand lead bad state notic effect situat natur learn agent learn avoid oper lead bad state agent perform agent momentarili arriv bad state initi learn state recognit predict agent realiz state gripper hold object extens reason determin oper lead previou learn reject oper time reason agent reason huge number situat oper agent reason situat learn led bad state costli simpli learn current situat theori make predict human learner initi learn recognit bad state learn avoid action led viabl altern avoid bad state reason situat effect action bad state result highli cautiou execut strategi danger situat safer situat agent time pressur perform agent cautiou execut strategi situat knowledg gener domain tempor implement instruct hypothet agent learn state infer oper knowledg state larger oper reject knowledg learn hypothet goal addit hypothet instruct explicitli goal situat intend appli singl explicitli goal form action meant achiev instruct form turn push basic knowledg learn instruct oper knowledg goal achiev deal map creat hypothet situat oper deriv hypothet goal state state hypothet situat current world state expect achiev hypothet goal initi assum agent assum action lead achiev goal white agent assum gener action initi step achiev analysi instruct found fulli instruct express gener fulli achiev action goal statu isa light id statu isa button id color oper figur oper knowledg learn instruct hypothet goal turn push oper learn push button learn oper hypothet goal hypothet situat start point intern forward project explain lead achiev project agent learn oper rule turn push red button assum moment agent push button toggl light statu actual agent learn instruct agent form hypothet situat goal achiev state current expect push red button success reach goal agent intern project push light toggl achiev goal explan instruct oper rule figur learn learn oper effect knowledg actual agent effect push button light statu creat hypothet situat turn push red intern project push lack knowledg effect push light remain project explan incomplet incomplet explan knowledg complet shown figur explan sequenc oper agent explan induc oper rule sequenc section agent figur miss knowledg complet sequenc multipl credit assign problem determin knowledg miss extrem difficult agent face incomplet explan sequenc oper sequenc oper agent condit oper accomplish termin condit hypothet goal credit assign problem straightforward agent make good guess miss knowledg complet explan list option deal incomplet tabl heurist guess oper achiev hypothet effect produc termin condit goal termin condit goal met oper project guess effect oper unknown agent termin condit light statu intern project red light statu agent infer effect red chang statu light infer present instructor effect goal explan hypothet turn push red goal light light light select figur incomplet explan instruct hypothet knowledg mk complet oper learn push button light instructor verifi push button effect turn light effect effect oper condit featur state hold oper execut guess simpl heurist oper naiv causal theori determin infer oper effect heurist section includ featur path object attach oper goal current notic light red button tabl heurist includ goal termin condit met instruct oper includ negat newli infer effect oper question add light button push result present instructor alter push button light light light tabl button tabl button red push button light light light tabl button tabl button red oper project isa light statu isa button color statu figur learn oper effect push red button oper learn push heurist recogn specif button push instructor ad condit button red green button instructor verifi agent learn oper effect rule shown figur rule appli agent intern project push red button learn oper agent extend basic domain knowledg effect agent mental simul push red explain origin turn push red button newli learn oper effect knowledg light goal complet explan enabl agent learn oper rule push red button turn shown figur agent acquir knowledg multipl learn unknown effect oper support learn oper learn oper effect instructor limit map interact capabl infer effect push red button light push button simpli activ switch thrown turn instructor reject infer effect realiz knowledg incomplet learn multipl level system resort directli learn knowledg induc instruct tabl oper rule push button learn oper effect oper effect rule learn previou appli intern project oper conclud light red button button push agent light present agent learn unknown effect effect directli agent learn recogn actual execut recal agent magnet instructor teach agent metal block magnet understand kind agent learn effect move power magnet contact metal object teach agent effect instructor lead agent state shown figur robot hold magnet grei larg metal magnet power instructor grasp grei move arm previou agent form hypothet situat goal grasp grei block start current forward project move arm figur initi state agent learn grasp magnet agent hold magnet oper project isa gripper hold hold statu materi hold figur learn oper effect move hold power magnet metal object expect achiev desir grasp agent project fail grei block grasp agent infer unknown effect move arm grasp complet successfulli method previou effect lower arm gripper hold block lower arm gripper hold block gripper hold block gripper block gripper hold magnet magnet power block metal lower arm gripper hold block gripper hold block gripper block gripper hold magnet magnet block metal agent learn effect move arm rule learn shown figur previou learn rule agent complet explan move succe grasp grei achiev termin condit object grasp held agent learn oper rule move arm grasp metal shown figur agent ahead grasp metal grasp grei block rule figur move learn agent move arm arm state infer rule shown figur appli add fact magnet block agent realiz block goal isa block materi isa gripper hold hold isa magnet statu oper figur oper knowledg learn instruct hypothet goal grasp grei move oper learn grasp object state object isa isa gripper hold isa hold figur state infer rule enabl agent recogn goal achiev grasp metal block success expect grasp arm move termin condit block test condit hold current agent hold grei block agent learn conclud project oper rule figur effect directli perceiv extern world agent learn infer hold block base state condit induc state infer rule infer goal infer gripper hold block instructor verifi infer agent assum goal reach simpli instruct reach infer correct agent state condit infer properti hold instructor gripper hold block gripper hold magnet magnet grei block agent learn state infer shown figur rule agent recogn gripper grei block magnet instruct hypothet learn oper knowledg perceiv infer oper effect final categori learn discuss learn oper comparison knowledg learn oper comparison knowledg oper comparison rule type oper select knowledg express prefer oper oper goal oper oper size isa isa robot isa gripper statu prefer oper figur oper comparison rule learn grasp small metal block type knowledg agent avoid impass ti oper agent learn grasp small object hand teach agent instructor mention block grasp agent begin grasp magnet rule learn shown figur agent grasp block small case action grasp magnet regular action grasp small block move tabl block sit agent knowledg select reach impass result tie resolv agent learn oper comparison knowledg prefer oper oper current agent instructor grasp yellow block possibl move tabl grasp magnet move yellow tabl instructor prefer agent learn oper comparison rule prefer option learn agent recal chosen option lead base assert prefer choic rule result shown figur instructor action option list agent explain instruct usual learn oper rule learn oper comparison rule figur prefer instruct oper possibl altern option equal good choic instructor option agent learn oper comparison rule figur prefer oper rule knowledg soar option random current agent move yellow action step grasp small object move arm rule grasp magnet magnet grasp possibl move block grasp magnet move yellow block agent learn oper comparison rule similar figur pattern continu final step grasp block complet agent grasp small metal oper comparison rule learn appli select prefer method grasp block directli magnet weak agent learn oper comparison knowledg instructor forc prefer step complet simpli method instructor method grab block knowledg step procedur store access separ group method local knowledg organ improv flexibl agent combin step method base current situat higher level group step method global organ reason instruct select method weak agent explan techniqu explain select instructor explain select choic tie choic viabl step achiev goal prefer typic form global action lead goal prefer give agent basi explain action prefer prefer appli requir aggreg inform multipl situat action ad cost altern path current situat goal encod global control knowledg instruct learn techniqu handl instruct control prefer implement theori learn tutori instruct chapter agent architectur problem space comput embodi soar learn agent situat explan meet requir instruct agent target theori chapter requir summar tabl agent straightforward approach map major focu research complet solut interact problem previou handl implicitli type explicitli situat support fulli flexibl interact action command agent meet requir transfer problem extend incomplet knowledg instruct learn agent complet respect instruct knowledg learn type knowledg task perform instruct requir gener learn specif case chapter fast learn task instruct section maxim prior knowledg chapter increment learn chapter abil learn type knowledg task perform chapter state infer section oper section oper reject section comparison section oper effect section oper termin section instruct chapter flexibl knowledg content chapter full flexibl action command chapter chapter situat flexibl chapter implicitli situat chapter explicitli hypothet state section hypothet goal section tabl target requir tutor agent met chapter cognit properti chapter examin theori instruct learn underli cognit perspect behavior properti predict result view potenti cognit model task learn procedur tutori instruct develop strongli influenc soar soar put forward candid unifi theori cognit kei issu examin kind impact unifi theori model develop unifi theori provid posit constraint cognit chapter analyz soar effect develop gener methodolog analyz compar individu creat unifi theori cognit chapter address ffl behavior properti model learn procedur ffl develop unifi theori cognit provid constraint give rise behavior impact soar ffl predict human behavior result properti ffl predict compar human ffl model compar cognit model similar model develop unifi theori view cognit make number testabl predict human agent perform cover full rang interact occur real human tutori learn great amount data detail human learn tutori instruct research focuss effect instruct strategi behavior predict found broadli consist human behavior analysi soar impact properti soar larg influenc properti predict show provid constraint model build methodolog analysi craig miller john laird model procedur learn tutori instruct focu central function examin cognit learn procedur situat interact chapter exhibit stage learn behavior learn procedur initi learn rote episod exhibit low transfer execut result high gener base situat explan instruct agent instruct recal attempt explain instruct lead achiev current goal explan form intern forward project instruct action agent happen project result success goal achiev failur instruct avoid learn gener rule captur kei condit instruct action appli similar process appli agent instruct appli hypothet agent creat hypothet project instruct attempt understand lead achiev agent goal main focu research transfer process learn instruct primari behavior properti examin learn properti work address interact provid larg amount flexibl interact previou chapter interact driven agent lack agent interact poor approxim interact human instructor parti initi varieti kind instruct event studi shown instruct domin earli student initi attempt model pattern interact major behavior properti procedur interact instruct request agent instruct initi episod learn initi learn procedur rote episod situat learn method agent emploi situat method produc explan lead gener learn final gener learn final form learn procedur gener step directli condit featur current situat monoton task knowledg agent receiv task knowledg continu structur limit amount knowledg learn properti greater detail effect soar analyz section examin unifi theori cognit develop theori specif lai groundwork analysi cognit model unifi theori cognit primari problem face build cognit model model behavior data multitud design made build data complet constrain model account data recur theme research prior research allen constraint unifi theori cognit offer design cognit model embodi form posit set mechan capabl support intellig behavior construct model restrict design consist architectur properti constraint produc model base principl global motiv broad rang cognit behavior phenomena model base consist set underli model facilit integr model cover larger rang behavior constraint provid evid task low behavior strongli determin architectur time small number applic architectur primit mechan level minut hour task behavior determin intellig agent knowledg newel ration band agent move approxim pure system learn instruct fall perform domin order minut hour larg agent appli relev knowledg reach goal distanc knowledg level behavior architectur primit evid constrain design model behavior higher kei question address offer design model knowledg level section follow present analysi effect model knowledg level analysi demonstr gener methodolog analyz effect util architectur entail deriv architectur basic mechan properti entail guid develop model knowledg level behavior analysi show behavior properti model mention affect architectur entail soar soar architectur entail architectur entail ramif combin architectur compon defin provid level descript architectur level basic compon exampl architectur entail includ architectur behavior goal interrupt base weak higher entail basic architectur properti determin architectur effect larg behavior entail provid constraint design knowledg level model determin architectur model afford entail prefer newel put wai soar todo task natur involv addit knowledg comput apparatu gener argument import architectur time scale natur architectur tend human entail deriv basic properti basic properti soar newel soar basic problem space repres task soar problem space comput basic comput structur state oper organ problem space product memori knowledg store associ includ search oper applic semant episod knowledg subgoal product problem space stm chunk routin learn monoton learn learn process learn base prior knowledg learn determin perform recognit abil detect lack knowledg larg amount knowledg knowledg relat continu shift recognit serial discret oper goal orient interrupt driven form final task knowledg automat gener situat organ situat learn sequenc factor high specif effort reconstruct recal interact instruct request form episod architectur properti soar architectur entail soar model properti figur entail soar affect model declar structur work memori repres object set attribut valu procedur product produc symbol prefer work memori includ problem substructur object procedur interpret prefer select valu work memori automat subgoal subgoal creat automat inabl make progress problem chunk base learn chunk produc product result creat process subgoal summar result process futur execut relat chunk avoid subgoal entail soar start newel soar pp list soar entail gener base basic properti entail broken learn list intend includ kei entail affect section entail deriv combin basic properti number list soar properti bracket entri list depend shown graphic column figur ffl behavior goal orient soar creat goal proce interrupt driven product match bring bear knowledg current situat process knowledg import action current subgoal base action termin altern action select serial applic oper singl oper select appli time goal context continu shift recognit perform impass chunk learn impass avoid futur chunk implement recognit perform simpli recogn situat act requir ffl knowledg knowledg relat problem oper indefinit larg bodi knowledg soar larg amount knowledg structur knowledg individu factor knowledg multipl problem space abil detect lack knowledg impass detect lack knowledg make ffl memori recognit memori product form associ memori knowledg recal retriev cue work memori memori product memori examin instanc test product agent fulli awar access gain work memori retriev cue ffl learn learn determin perform chunk learn directli depend process place subgoal produc result gener chunk depend gener problem solv subgoal learn base prior knowledg learn depend perform depend agent exist learn depend critic agent preexist knowledg learn process chunk process learn alter architectur learn process monoton learn product remov chunk forgotten contrast work machin learn involv forget mechan effect chunk overridden chunk recov incorrect learn learn depend perform chunk form basi learn strategi analog strategi essenti behavior mediat knowledg learn oper segment isa recogn id figur recognit chunk encod episod memori semant featur instruct routin learn chunk part routin perform special process invok learn agent control indirectli agent decid return result soar impact major behavior properti model examin detail model properti affect varieti soar architectur reveal constrain effect develop model soar interact instruct request agent instruct knowledg insuffici reach goal goal orient detect lack knowledg initi episod learn side effect natur languag read instruct agent learn set chunk episod memori instruct memori ffl long term memori episod encod set product soar long term memori instruct sequenc rememb unrealist load short term instruct forgotten ffl recognit effort reconstruct recal episod encod set recognit featur instruct recal make chunk episod recognit rule shown figur rule test segment symbol segment symbol creat time agent begin receiv instruct goal rule recogn isa semant featur instruct recognit basic form memori process impass result recognit learn natur languag chunk recognit condit depend behavior subgoal produc behavior refer depend semant featur instruct recal part instruct agent reconstruct featur recogn rule agent simpli inspect content memori access place recal cue work memori ffl high specif instruct index exact goal appli pick red block exact instruct rememb move yellow tabl specif result learn base perform perform involv refer specif featur goal instruct specif requir avoid refer goal specif ffl factor separ recognit chunk semant featur illustr chunk figur chunk learn resolv futur natur languag requir independ access featur read red read red recov refer color independ access requir set individu featur chunk memori examin agent simpli memor monolith semant structur ffl sequenc instruct sequenc chain index directli situat appli learn perform base perform read instruct produc episod depend situat instruct appli perform actual task situat learn method intern project instruct agent learn gener rule action directli goal reach experienti learn method afford learn base perform impact prior knowledg soar system learn task perform perform task make maxim task domain knowledg case task complet reason directli space condit set condit instruct appli method requir ad addit knowledg soar condit search difficult learn chunk desir chunk process agent simpli ill add chunk memori condit final gener learn situat learn method learn procedur gener form ffl long term memori rule implement procedur encod product ffl organ action procedur encod individu agent learn select achiev recogn achiev ffl situat oper rule directli condit relev featur current situat goal agent learn determin perform perform intern project instruct oper state achiev goal implement displai world state unexpectedli rule oper perform match mismatch ffl gener featur rule requir successfulli reach goal learn determin perform goal achiev prior knowledg knowledg simul basic oper ffl automat learn rule move system recognit perform effort requir recal instruct oper initi rote learn monoton task knowledg structur limit amount task knowledg agent acquir instruct forget learn product overwrit occur knowledg product bring conflict knowledg bear task actual conflict agent knowledg instructor instruct conflict case conflict oper learn resolv conflict demonstr section analyz soar effect figur summar relationship properti entail give rise properti model figur factor effect properti entail model detail answer question impact model figur determin model properti influenc properti entail figur properti influenc properti initi episod learn requir effort reconstruct recal figur number soar entail properti influenc model indic larg amount constraint provid architectur figur effect properti architectur model show architectur properti larg effect effect figur trace effect soar product recognit form larg impact fact soar base effect determin properti model chang architectur chang wai entail provid intermedi level granular compar model unifi theori architectur entail differ figur figur model properti affect differ entail declar memori addit product memori entail fulli store instruct read associ natur soar memori affect form episod learn episod requir reconstruct encod multipl product factor instruct featur base model learn procedur episod declar reconstruct requir search declar factor separ associ methodolog construct figur similar vanlehn analysi assumpt sierra theori procedur learn basic properti vanlehn entail deriv competit argument made model properti base entail vanlehn goal understand depend assumpt theori argu goal understand impact set assumpt unifi result model subgoal product problem space stm chunk routin learn monoton learn learn process learn base prior knowledg learn determin perform recognit abil detect lack knowledg larg amount knowledg knowledg relat continu shift recognit serial discret oper goal orient interrupt driven form final task knowledg automat gener situat organ situat learn sequenc factor high specif effort reconstruct recal interact instruct request form episod architectur properti soar architectur entail soar model properti figur properti entail soar influenc properti initi episod learn requir effort reconstruct recal product problem space stm subgoal chunk routin learn monoton learn learn process learn base prior knowledg learn determin perform recognit abil detect lack knowledg larg amount knowledg knowledg relat continu shift recognit serial discret oper goal orient interrupt driven form final task knowledg automat gener situat organ situat learn sequenc factor high specif effort reconstruct recal interact instruct request form episod architectur properti soar architectur entail soar model properti figur effect soar recognit memori featur retriev declar structur properti found model procedur learn instruct model contrast discuss behavior predict model predict model properti term depend model data structur process order evalu model testabl behavior predict independ model architectur model predict determin behavior properti determin predict base behavior properti step cognit model base unifi theori make number testabl predict predict depend recal strategi recal episod memori past instruct chapter strategi assum ffl initi learn procedur rote episod procedur initi perform situat similar origin situat taught high specif rote memori subject initi difficulti perform procedur start state origin initi state start procedur middl rote memori highli sequenc fashion perform initi slow effort reconstruct requir recal instruct memori factor episod requir featur result complet recal ffl gener learn procedur occur multipl execut procedur amount transfer abil perform procedur situat number maximum transfer level reach learn occur experienti process execut time number execut maximum transfer level reach part procedur recal episod memori requir reconstruct part procedur learn gener appli directli recal process procedur learn gener execut time drop execut time displai power law shown figur procedur taught hierarch learn faster effect chapter faster learn hierarchi consequ procedur broken hierarchi fewer substep learn execut time proport number substep effect learn hierarchi consequ learn situat explan shorter explan requir subtask suscept error prior knowledg ffl number procedur fulli gener perform occur perform rapid subject knowledg action perform retriev directli memori base current situat featur subject exhibit effect method learn method continu effici method gener perform automat recognit subject execut procedur equal start intermedi state path instruct action sequenc step oper index current state sequenc store monolith plan ffl gener learn result situat learn method method involv recal explan appli individu prior domain knowledg knowledg basic oper subject improv transfer subject attempt explan achiev low transfer learn subject successfulli achiev high gener learn improv perform perform time lower gener learn recal recal explan instruct pressur act quickli subject time recal explain entir instruct sequenc time number execut procedur achiev high transfer learn singl recal time encourag introspect subject achiev high transfer learn quickli introspect recal model recal explicitli model subject switch natur learn amount qualiti transfer achiev depend amount qualiti prior domain knowledg subject subject domain knowledg achiev transfer instruct instruct appli situat current situat hypothet difficult subject learn situat instruct situat natur learn process ffl task knowledg monoton learn instruct structur limit amount learn task knowledg forgotten subject unrel learn knowledg recal recal piec knowledg fail proper cue figur show predict behavior properti comparison human perform mention specif data human learn transfer tutori instruct kind data test predict includ detail time data execut carefulli collect transfer data experi control subject prior knowledg detail fit specif data attempt predict properti broadli consist human perform gener human learn effect consist model role effect prior effect abil transfer learn knowledg rest discuss turn situat learn grow recognit situat learn learn result perform particip perform task actual task situat highli effect brown knowledg extent appli correctli situat chi peopl learn appli knowledg situat perform task situat idea underli train comput simul practic pilot perform procedur instruct produc memori effect simpli memor text student prefer instruct perform achiev task instruct carrol student prefer strong apt procedur mention execut pure expositori carrol studi shown train lead student execut actual task effect kind train predict effect situat learn central learn process situat explan situat explan requir agent understand goal form final task knowledg automat gener situat organ situat learn sequenc factor high specif effort reconstruct recal interact instruct request form episod behavior properti behavior predict execut time drop improv perform time improv transfer final perform intermedi point effect advantag hierarch teach transfer initi slow perform start middl procedur perform situat forget knowledg instruct harder learn transfer depend prior domain knowledg final perform fast automat learn rate affect time figur behavior behavior properti state instruct appli learn gener instruct predict advantag hierarch instruct break procedur smaller intermedi goal easier explain hierarch instruct inform intermedi goal shown effect pure linear instruct goal inform student interpret command correctli part map problem model situat learn process instruct appli situat current situat learn explicitli situat instruct creat intern situat simul perform instruct similar model interpret prior knowledg psycholog studi shown subject prior domain knowledg affect abil interpret learn instruct focu interpret map gener learn depend strongli agent prior domain knowledg domain knowledg lack low learn fall back naiv heurist simpli rote learn good match observ human behavior instruct simpl approach map problem model mention complet dixon al gave subject instruct kei action state explicitli part step found reader high amount background knowledg effect implicit form low background knowledg moham test subject nativ scienc instruct set time alarm digit clock speaker scienc background perform nativ speaker scienc background subject prior knowledg made incomplet instruct infer miss low knowledg subject learn prior domain knowledg shown improv student instruct learn transfer group boi throw dart underwat target taught outperform basic mechan task master taught subject procedur oper unknown devic control subject prior instruct devic work domain theori learn procedur term speed accuraci retent procedur churchil young built simpl product base model produc strictli order rule instruct prior devic situat rule prior devic knowledg execut time knowledg learn strongli depend agent prior knowledg chi al protocol subject studi work exampl physic measur subject perform test similar problem found subject perform test problem produc significantli studi exampl involv consciou effort justifi step explic consequ precondit action student form explan individu step explain multipl step poor student process exampl verbatim fashion problem good solver refer exampl target specif inform specif poor exampl extens syntact templat base surfac appli action problem current problem rote exampl work result low transfer vanlehn al present detail model call successfulli reproduc perform individu subject result relev emploi approach learn tutori instruct instruct explain manner instruct base intern project elucid effect problem form instruct tutori predict similar find attempt explain learn degrad rote learn rote learn knowledg appli analog futur problem base surfac poor student studi exampl implement successfulli instruct high gener learn achiev reson chi vanlehn data suggest student singl exampl student provid adequ explan studi result suggest student opportun transfer form mental simul instruct action ampl evid type result learn human subject lander johnson found evid mental practic cognit process motor transfer gener transfer effect found behavior multipl execut time procedur learn power law practic posit transfer learn ineffici procedur exhibit difficult learn effici procedur neg transfer soar class theori explain transfer modern version transfer ident element theori grai shortcom origin formul ident element highli specif rule modern overli specif rule replac gener associ product transfer occur product task appli task product transfer occur dispar task major product task specif result transfer narrow al found simpli chang procedur delet failur transfer consist gener chunk learn procedur depend procedur situat featur theori cognit compar cognit model procedur learn instruct recent model fall major model base model theori recent model procedur learn base anderson model anderson model emploi stage process instruct convert declar form memori declar memori guid task execut weak rule procedur learn rule tune strengthen futur execut declar encod instruct access process procedur applic specif set situat transfer occur ident appli multipl task model appli larg amount aggreg individu human data intend model procedur learn varieti type complex task physic problem instruct task includ declar fact point problem kind inform scope tutori instruct defin thesi make inform perform weak method decid instruct inform guid weak method instruct implicitli explicitli context problem task execut simpli perform action instruct caveat similar theori initi read instruct produc fulli execut task recal instruct inform foster learn gener product encod instruct final learn produc automat behavior directli appli situat transfer learn occur product learn earlier task appli task differ form initi learn initi learn episod highli specif recognit encod instruct exist declar short term memori short read recal past system reconstruct process instruct encod declar access reconstruct process differ sourc power law practic execut knowledg perform task fulli procedur gener power law addit strengthen mechan appli execut make rule appli faster knowledg procedur multipl execut fulli procedur execut power law increment procedur differ emphasi prior knowledg produc gener learn model built theori primarili situat prior domain initi perform task requir appli weak method type theori includ model lewi al lewi al describ built read instruct perform subject part simpl psycholog experi instruct step read fashion read produc declar system learn procedur interpret structur execut task procedur simpl learn demand gener instruct present learn result subject learn oper unknown describ model result instruct experi subject requir memor instruct procedur attempt perform learn condit interact instruct kei result concern drop read time instruct read master interact student typic receiv instruct master subject prior domain knowledg model make prior knowledg learn rule gener heurist appli syntact gener oper theori addit recent research attempt produc theori learn input recent theori instruct learn includ al redmond difficult compar attack instruct task al task alter procedur instruct begin knowledg procedur pai attempt make call procedur system instruct alter pai phone learn procedur process task learn complet procedur extens incomplet procedur instruct task involv alter past domain knowledg incorrectli task involv extend past domain knowledg incomplet redmond learn system learn observ expert action system infer goal action plan recognit learn achiev goal instructor target learn observ action target learn interact support broad rang interact flexibl natur interact goal pursu termin deal infer instructor goal observ interact step skip command unknown agent deal observ action occur skip unknown step model appli instruct similar chapter episod memori form final learn includ situat knowledg individu step procedur system approach induct process fill knowledg chapter examin cognit elucid behavior properti predict cognit model aspect behavior model human perform instruct initi perform match specif human data real cognit make number testabl behavior predict mesh gener cognit effect human procedur learn transfer deriv chapter present analysi develop soar affect propon unifi theori cognit make claim work unifi theori constraint develop specif behavior analysi techniqu chapter repres gener methodolog deriv constraint describ impact vagu analysi factor effect individu properti entail type fine grain analysi power tool discov aspect unifi theori crucial model develop unimport analysi develop unifi theori provid larg amount constraint model design chapter futur work chapter review analyz result achiev theori learn tutori instruct embodi begin examin measur requir complet tutor agent laid chapter summar capabl agent demonstr perform number distinct instruct base situat explan method appli agent agent capabl demonstr extend instruct scenario summar detail appendix discuss chapter present detail analysi limit current theori implement opportun research limit inher tutori instruct limit agent comput model incomplet solut kei instruct map interact transfer problem discuss detail focu discuss futur chapter make specif gener instruct address interrel subset present limit result ultim goal line research produc agent instruct natur human chapter develop set requir complet tutor meant repres goal meet complet requir subset relat interact transfer problem select target research tabl repeat tabl show target requir tutor met meet requir tabl move closer goal complet tutor agent previou learn system requir met includ crucial evalu agent learn type knowledg task perform instruct agent support full flexibl knowledg content instruct command action instructor give command task point agent task perform current situat agent learn implicitli situat type explicitli situat instruct meet displai nineteen distinct instruct capabl capabl list tabl import point work requir gener learn specif case chapter fast learn task instruct section maxim prior knowledg chapter increment learn chapter abil learn type knowledg task perform chapter state infer section oper section oper reject section comparison section oper effect section oper termin section instruct chapter flexibl knowledg content chapter full flexibl action command chapter chapter situat flexibl chapter implicitli situat chapter explicitli hypothet state section hypothet goal section tabl target requir tutor agent met myriad instruct behavior requir nineteen learn singl gener situat explan appli broad rang situat requir learn task tutori instruct requir complet tutor agent perform complet set requir tutor agent shown tabl tabl met partial met eleven criteria fulli achiev area discuss chapter section turn empir evalu present result instruct scenario demonstr capabl empir evalu empir evalu machin learn system address evalu comparison system techniqu evalu perform compar system learn task concept learner perform compar comparison alter version system system compar version kei compon call evalu impact compon system perform method compon ad standard method measur perform systemat gener seri problem techniqu evalu learn method affect singl dimens input concept learner test noisi train data method input learn problem dimens systemat alter instruct capabl learn complet procedur pick sec instruct newli infer knowledg oper termin pick termin condit sec extend procedur appli situat put pick sec hierarch instruct procedur instruct teach grasp pick sec prohibit action grasp red sec explan prohibit action block sec recoveri indirect achiev prohibit state close hand block sec infer simpl statement specif grei block sec infer simpl statement gener magnet sec infer condit condit condit conclud state sec oper perform hypothet goal turn push red sec oper perform hypothet state light bright dim sec oper perform relat situat block metal grasp sec explan oper hypothet state light sec learn perceiv oper effect push button dim light sec learn oper infer recogn effect move metal block hold power magnet sec learn procedur spite incomplet domain theori frame axiom experi sec deal oper learn oper prefer wai grasp small metal block sec deal oper learn choic wai grasp small metal block sec tabl list instruct capabl demonstr problem requir met map map inform show interact flexibl initi instruct flexibl instruct knowledg content partial flexibl action situat flexibl partial explicitli situat multipl utter transfer gener learn specif case situat fast learn procedur taught maxim prior knowledg increment learn abil learn type knowledg task perform knowledg abil deal incorrect knowledg extend incomplet learn instruct coexist learn sourc tabl perform requir complet tutor agent measur perform hard problem hard problem provid evalu perform extrem condit concept learner perform measur difficult dataset method benchmark problem singl kind learn goal show power learn kind metric concept accuraci train evalu method shavlik al extens compar symbol neural concept learn algorithm empir evalu techniqu difficult appli great depth learn tutori instruct reason machin learn effort concentr depth type tutori instruct requir breadth wide rang learn wide rang instruct interact depth measur quantit breadth measur qualit coverag tutori instruct extens studi machin batteri standard system problem evalu techniqu appli address specif evalu comparison evalu techniqu appli tutori instruct system comparison comparison alter perform illustr effect prior knowledg agent chapter prior agent unabl explain resort induct method combin instructor verif induc knowledg amount instruct requir reduc learn qualiti chapter compar effect version agent instruct recal strategi prior knowledg recal difficult alter singl compon agent produc compar perform perform systemat vari input agent instruct alter number wai produc compar learn empir alter chapter length instruct sequenc procedur graph figur execut time instruct procedur vari length instruct drop number execut power law function procedur learn gener form alter instruct teach procedur hierarch subtask flat instruct sequenc base power law predict hierarch instruct learn time advantag flat instruct figur show empir result confirm predict alter instruct input larg number instruct order teach instructor skip step organ procedur arbitrari subtask instruct handl chapter mathemat analysi perform determin rang flexibl abil instructor present appendix find number instruct sequenc teach procedur grow exponenti number primit step procedur perform hard learn tutori instruct extens studi machin difficult problem creat kei evalu criteria learn tutori instruct mention begin chapter combin produc singl scenario test perform scenario present detail appendix summar briefli instruct scenario creat evalu breadth perform requir full rang learn interact capabl scenario demonstr eighteen nineteen instruct capabl tabl includ learn select sentenc teach hierarchi organ shown figur varieti knowledg control light electromagnet begin learn chunk final total product cycl soar agent creat select problem oper cpu time sgi minut extend demonstr varieti instruct singl learn theori appli instruct learn situat capabl oper complex instruct scenario extend agent domain knowledg includ learn type knowledg limit opportun research thesi agent instruct tutori instruct limit work fall major categori limit inher paradigm tutori instruct agent taught limit capabl limit agent instruct incomplet solut problem face instruct map interact transfer problem limit inher tutori instruct tutori instruct defin instruct interact situat power knowledg sourc learn knowledg interact point agent appli situat agent face face instruct content flow inform student control primarili pick put grasp close gripper move arm open gripper move tabl move arm move arm move arm move grasp move arm move move left move left move tabl put figur part hierarchi oper learn extend appendix format sourc exampl includ classroom instruct manual textbook issu type instruct locat extract inform problem hand inform convei problem instruct includ inform gener expositori text instruct convei gener abstract knowledg appli larg number situat gener knowledg knowledg physic class student taught gener equat appli specif wai great varieti situat advantag instruct abil compactli commun abstract knowledg broadli applic anderson point abstract student learn appli specif transform situat knowledg chapter transform occur student solv specif guid knowledg glean instruct complet agent learn tutori form instruct type instruct consid research limit agent addit limit inher tutori agent limit constrain instruct theori learn tutori instruct develop specifi comput model build agent problem space comput comput agent set capabl implement demonstr theori weak comput model specif implement agent examin comput model problem space comput model plai kei role theori tutori learn defin basic comput oper intellig type knowledg agent learn instruct subgoal natur support flexibl interact multipl level instruct learn suit situat instruct inher local control structur make difficult learn task requir global control regim translat seri local result local learn instruct system appli problem requir global control effect build control method system start approach knowledg acquisit tool weak theori type knowledg intellig indic content knowledg content theori knowledg complet space provid finer grain analysi instruct knowledg type analysi provid project cyc goal develop detail knowledg content theori agent implement set basic develop test tutori learn theori limit agent capabl discuss implement capabl agent limit number wai constrain ffl simpl action world agent action definit start defin singl endpoint goal preclud action path constraint room dont walk world action succe slip agent reason fail action ffl serial execut action singl top level goal action execut agent singl top level goal multipl level oper select achiev contrast dynam domain fly multipl goal multipl level granular activ agent instruct feet wing slow climb perform agent unrel action land gear ffl perfect percept agent percept environ told notic featur overlook featur human student told attend featur shown protocol excerpt figur ffl histori agent track past action perform episod instruct state agent learn procedur defin sequenc action set state condit achiev speaker instruct action instructor real runwai fast maneuv plane fly air altitud point climb rate gaug point climb rate gaug speed point gaug chang motion gaug blue brown point horizon mean angl point line horizon figur human instruct instructor direct student perceptu attent taught danc result net chang extern world ffl understand time resourc agent reason amount time perform similar resourc batteri taught perform action time ffl analysi agent instruct determin solut reason techniqu analysi human make extens analysi relat method ad capabl produc realist instruct agent instruct ffl singl agent agent domain preclud instruct teach multipl agent perform task robot carri instruct requir reason agent potenti action enemi block produc definit agent goal work capabl agent develop point provid basic demonstr instruct learn interact capabl addit tutori instruct paradigm agent instruct limit solut kei instruct learn problem transfer incomplet wai section discuss weak point research problem map problem limit map problem problem map languag instruct intern languag agent emploi straightforward approach leav problem map difficult natur languag construct relev section includ refer domain knowledg simpl match process resolv refer real difficult refer problem requir complex method resolv refer requir perceptu search block crack grab block red support kind interact refer instruct give incomplet inform common human instruct dialogu object act incomplet action incomplet handl kind incomplet requir action object order interpret instruct requir reason task webber point interpret squar half form correct cut determin reason produc desir result initi work make domain knowledg languag kind reason interpret instruct addit gener support full rang linguist form commun type knowledg learn agent learn unknown effect told agent learn termin condit oper execut told block pick hold arm make full semant inform creat oper read red block left yellow agent creat make semant inform commun left complet agent glean inform semant unfamiliar command interact problem limit agent shortcom interact problem center requir solv problem complet tutor flexibl initi full flexibl knowledg full situat flexibl tabl provid flexibl instruct partial solut knowledg content situat flexibl complet instruct agent support instruct initi agent instructor instruct initi agent preclud give instruct interrupt dont push complet instruct agent flexibl knowledg content instruct interact agent instructor commun piec knowledg point applic current task context fulfil requir command interact limit type instruct evalu instruct agent fulfil requir gener call notion knowledg complet instruct agent accept instruct commun knowledg point instruct dialogu defin knowledg coher difficult action command lead goal achiev accept defin knowledg coher type knowledg area research work plan dialogu litman allen develop notion complet instruct agent support full situat instruct appli current situat hypothet situat meet requir handl implicitli explicitli situat hypothet situat refer singl instruct human tutor refer hypothet situat multipl instruct situat instruct appli determin instruct receiv human goal action unknown action perform instructor lead student number action built learn effect kind goal advanc instruct achiev transfer problem limit work solv transfer problem produc gener learn tutori instruct tabl transfer problem criteria complet tutor agent achiev criteria met abil deal incorrect coexist instruct learn sourc method fall back explain instruct power recov incorrect knowledg lead invalid explan incorrect extern perform incorrect knowledg part agent initi domain learn faulti instruct chapter agent learn ineffici method perform back learn effici method agent recov learn incorrect method order avoid learn attempt induc instructor verif ad knowledg memori human student appar jump incorrect alter base inform rememb singl version piec inabl recov incorrect knowledg rule learn multipl requir chang singl hypothesi altern explicitli repres multipl version space preclud instruct gener case grasp red grasp safeti sign recoveri incorrect knowledg discuss compon specif futur work transfer problem requir met instruct learn coexist learn knowledg sourc theori implement preclud produc focu work instruct learn knowledg sourc invok instruct instructor point set object prompt learn instruct explicit metaphor invok analog learn solut transfer problem limit aspect implement attempt form explan state infer instruct proven problem simpl state infer learn complex explan improv learn explain instruct switch control panel agent realiz infer depend panel plug initi rote learn instruct recal situat origin instruct gener learn transfer improv ad analog recal heurist induc miss knowledg complet due doug pearson explan simpl complex deeper causal theori abduct lead higher qualiti induct gener instruct agent attempt address limit section instruct agent address set crucial limit current focu provid broad rang flexibl interact power instruct address map problem suffici support capabl agent extend major analysi agent attempt solv problem face analysi simpl search search fail reduc amount instruct agent make interact instructor realist told arm red agent discov search move arm requir instruct step select percept complet percept agent percept attend region agent perceiv area shift attend close object uncov perceptu detail capabl instruct techniqu appli complex domain complet percept intract percept unrealist select percept permit instruct direct perceptu attent crack simpl observ learn agent learn observ effect action simpl learn oper effect instruct explan agent learn direct observ learn reach assur knowledg learn correct support prior knowledg explicitli verifi instructor agent learn infer verif agent verif extrem case requir major chang current simpli mean agent reli complet explan induct tabl instruct verif infer knowledg agent requir abil recov incorrect knowledg work recov incorrect knowledg soar laird broad rang incorrect instruct agent requir research basic recoveri theori techniqu combin produc agent realist pattern interact instructor agent requir solv task mea learn environ observ make induct requir continu verif agent limit percept requir instructor direct requir human student real agent learn follow pattern start incomplet domain theori extend instruct agent start domain theori incomplet incorrect simpli build space reach current knowledg instruct light inform import result coverag crucial subset criteria complet tutor agent kei criteria met includ learn type knowledg task provid fulli flexibl interact support implicitli explicitli situat instruct empir result demonstr agent full rang instruct capabl work machin learn aim depth kind demonstr breadth interact instructor learn varieti type knowledg underli techniqu kind breadth crucial build instruct great varieti instruct varieti knowledg commun limit tutori instruct paradigm limit agent limit solut transfer problem limit kind step produc complet instruct agent specif made produc gener instruct agent combin set extens chapter current intellig system labori program task perform thesi present teach intellig agent perform task tutori instruct tutori instruct power knowledg sourc intellig agent interact provid knowledg expert appli directli situat agent face face type instruct shown highli effect human receiv limit attent artifici intellig machin learn thesi make major contribut studi tutori task analysi tutori learn gener theori learn tutori implement agent embodi demonstr broad rang instruct learn interact capabl analysi task face tutor agent reveal problem agent map interact transfer problem set requir complet solut develop requir defin goal tutori learn indic requir tutor agent provid oper evalu criterion work tutori serv focu research indic part problem suffici address thesi present theori learn tutori instruct theori comput model learn method comput call problem space comput defin learn task type knowledg agent task learn instruct learn call situat specifi agent learn gener knowledg instruct agent determin situat instruct action infer intend appli attempt explain instruct lead goal achiev intern project instruct situat explan process involv prior domain instruct complet explan implement embodi theori tutori learn demonstr perform agent built problem solv learn architectur problem space comput model appli situat explan wide rang instruct demonstr breadth interact learn requir tutori instruct breadth capabl produc gener learn method appli gener special techniqu instruct capabl previou instruct system learn meet number kei requir tutor agent learn type knowledg task perform support flexibl interact action instructor skip step command task learn implicitli explicitli situat instruct potenti basi cognit model learn tutori instruct make specif set behavior predict broadli consist human behavior analysi model reveal affect develop unifi theori factor impact soar properti entail behavior properti model analysi illustr methodolog analyz effect unifi theori develop appendix instruct scenario appendix describ perform larg instruct includ demonstr learn interact capabl tabl includ exampl learn type exampl type interact agent handl exampl bodi thesi includ start agent initi knowledg chapter primit oper move arm relationship object open close dock tabl oper light electromagnet agent taught put object move open agent recal attempt recal gener procedur taught chapter scenario instructor input shown agent shown agent action extern environ boldfac print agent templat natur languag gener focu work amount indent instruct interact instruct indent teach procedur command earlier indent part actual agent input world begin state shown figur instructor begin teach agent properti red magnet white magnet power agent learn state infer section current magnet rule appli conclud magnet statu instructor teach agent procedur pick red block includ agent put demonstr extend procedur hold clearer figur initi world state instruct scenario agent realiz oper gener oper templat natur languag map section instruct grasp red block instruct instructor agent perform procedur agent creat oper instruct grasp block red block metal grasp magnet im guess condit goal block metal instruct action grasp metal block red block instructor agent grasp metal block agent section induc condit action instructor verifi induct rule learn shown figur grasp magnet order grasp metal block instructor continu teach agent grasp red block move yellow tabl move red block dont teach move reach goal move arm red agent begin knowledg move situat arm move red agent arm complet action extend knowledg section told move agent explain instruct intern project realiz move successfulli move red block agent learn gener oper shown figur move arm goal move carri instruct action agent hand red instructor continu teach procedur move arm close hand oper finish section instructor oper agent attempt induc termin condit oper compar current state shown figur initi state induct present instructor alter figur state world grasp red block guess gripper block gripper directli block gripper close gripper hold block robot dock tabl robot yellow tabl guess gripper red block gripper red block guess gripper close gripper hold block reach instructor verifi goal concept gripper close hold agent learn chunk encod recal explain sequenc instruct grasp start intern initi state recal intern project command perform red block grasp agent learn gener oper rule command lead grasp agent finish pick red block command pick red move oper finish agent induc termin instructor alter verifi introspect gener guess gripper block gripper directli block gripper close gripper hold block gripper block robot dock tabl robot yellow tabl gripper red block gripper red block guess gripper close gripper hold block gripper block reach agent hold red learn gener procedur pick block hand empti begin procedur extend appli situat agent hold object pick yellow block dont teach put red block reach goal put red block blue pick yellow intern project effect put red agent realiz action enabl pick yellow learn oper knowledg put object order pick agent taught push button put yellow block push green button move grei tabl move green button move notic move green button agent appli learn earlier move red block move move oper finish guess gripper button gripper button robot tabl reach home instructor teach agent turn light agent turn hypothet goal turn grasp magnet section learn type agent creat hypothet situat goal turn project command action goal achiev agent knowledg effect grasp magnet explain instruct heurist section agent guess grasp magnet turn instructor verifi effect magnet grasp magnet magnet magnet magnet correct teach effect agent complet explan instruct learn grasp magnet goal turn magnet similar exchang occur turn turn push red button effect light push button light light light tabl button tabl correct red button red push button light light light tabl button tabl button red correct teach turn light push red light instructor button push red button button green light instruct teach agent light hypothet state agent explain proper instructor light turn light trust teach instructor declin give agent heurist learn turn light section agent taught control light bright taught procedur dim light push green button green button effect form complet explan learn gener form point light push green button oper finish guess gripper button gripper button light bright gripper green button gripper green button guess light bright introspect fail move dim light push green button oper finish guess gripper button gripper lower light bright gripper green button gripper lower guess light dim introspect fail move agent dim instructor teach light dim explain instructor point dim light requir electr section light bright dim light dim light electr bright light electr teach recogn differ resourc bright dim agent understand light dim test agent point light made bright agent immedi select oper learn select oper dim agent learn gener implement oper agent recal past green explan instruct fail agent induc gener condit push green button heurist section im guess condit goal gripper directli button agent push green light instructor teach agent effect grasp metal block magnet agent taught state grei block metal magnet block magnet power block metal magnet block rule learn instruct shown figur order teach agent grasp block taught magnet block agent learn effect move hold magnet metal block block teach instructor move agent proper shown figur hypothet goal instruct agent induc oper effect move arm awkward teach reveal limit interact capabl command section figur initi state agent learn grasp magnet agent hold magnet grasp magnet move grei block dont teach move yellow tabl reach goal move yellow hand move grei grasp grei move agent situat figur instructor extend agent knowledg move thing includ case agent tabl move told grasp grei move agent creat hypothet situat state current goal grasp grei block attempt explain move achiev explan incomplet agent magnet block agent infer effect move effect lower arm gripper hold block lower arm gripper hold block gripper hold block gripper block gripper hold magnet correct magnet power lower arm gripper hold block gripper hold block gripper block gripper hold magnet magnet correct section interact agent learn rule simul effect move intern project agent learn conclud hold metal block actual execut grasp grei agent expect succe move realiz block magnet attempt infer state infer complet grasp block grasp grei block move arm block stuck infer gripper hold block gripper hold block gripper hold magnet magnet grei block home agent learn recogn block held stuck magnet held rule shown figur instructor give light shut unexpectedli agent respond push red button turn light back move push red light agent learn pick metal block pick small block hand pick small metal block blue conflict instruct resolv conflict capabl section blue block metal pick blue block possibl move yellow tabl grasp magnet move yellow tabl possibl move block grasp magnet move blue block move possibl close hand grasp magnet close hand interact agent learn seri oper comparison rule prefer correct sequenc oper grasp small metal block hand exchang illustr learn prohibit section instructor teach agent grasp green block agent understand instructor green block agent learn grasp grasp green block green block teach grasp green block grasp block wont work agent learn avoid state grasp object led state told agent grasp object realiz recov learn avoid action led bad state avoid close hand object open hand move green block move close hand bad state open gener agent learn test pick object green block blue block pick blue block blue grasp blue block grasp block agent realiz complet abandon round hierarchi oper agent instructor teach line row agent taught place block left white red block yellow block move red block left white block pick red block move blue tabl move arm left white block put red block oper finish guess move block left reach goal agent learn move block left block start tabl oper rule learn pick block move left depend tabl move yellow block left red block agent told pick block extend left procedur situat move yellow block left red block dont teach pick yellow block reach goal pick yellow block place left red illustr problem situat learn agent learn current learn execut altern process consid situat learn time oper finish guess reach goal blue white block purpl block final command primit action perform final state shown figur summari result begin product learn procedur scenario agent learn final total product run soar includ applic cpu time sgi minut tabl number exampl instruct capabl includ scenario eighteen nineteen instruct capabl learn oper left instruct classifi wai linguist form shown tabl instruct classifi term interact properti includ instruct explicitli situat implicitli piec infer knowledg classif tabl involv learn type knowledg tabl amount learn type procedur built hierarch shown figur tabl finer grain view learn place classifi individu chunk learn tabl show number chunk type domain episod memori natur languag type note number chunk directli correspond amount type knowledg multipl chunk encod view singl piec knowledg largest categori chunk episod memori factor instruct episod figur final state agent scenario instruct capabl number learn complet procedur instruct newli infer knowledg oper termin extend procedur appli situat hierarch instruct procedur instruct prohibit action explan prohibit action recoveri indirect achiev prohibit state infer simpl statement specif infer simpl statement gener infer condit oper perform hypothet goal oper perform relat situat oper perform hypothet state explan oper hypothet state learn perceiv oper effect learn oper infer recogn effect learn procedur spite incomplet domain theori deal oper learn oper prefer deal oper learn choic tabl instruct capabl demonstr extend form number imper command grei simpl statement magnet condit light turn turn push red singl word tabl count linguist form instruct extend categori number implicitli situat instruct explicitli situat hypothet state simpl statement condit infer condit action prohibit action hypothet goal verif instruct tabl classif interact properti instruct extend type number state infer oper oper reject oper comparison oper effect oper termin condit total tabl type knowledg learn extend chunk type number learn domain oper templat knowledg nl map oper termin condit neg oper state infer oper effect oper comparison oper reject episod memori knowledg natur languag verif assort bookkeep side effect tabl type chunk learn extend featur natur languag refer store separ chapter appendix mathemat analysi instruct sequenc interact requir tutori instruct abil accept command commun knowledg relev task point kind flexibl command action task perform teach instructor primit oper make procedur execut order form larger futur oper make assumpt agent abil reach futur state instruct support kind instruct mean instructor skip step command subtask miss step command subtask agent appendix address question flexibl kind interact instructor variabl instruct procedur sequenc physic oper carri perform sequenc instruct produc sequenc physic larg number instruct sequenc lead agent path goal map instruct sequenc execut sequenc number instruct sequenc execut sequenc deriv mathemat carefulli defin limit problem simplifi instruct sequenc problem analyz appendix overli approxim actual instruct result qualit provid lower bound number instruct sequenc gener case analysi show number legal instruct sequenc produc sequenc physic oper grow quickli number physic oper disregard abstract found physic instruct sequenc number abstract instruct add exponenti factor result kind flexibl requir agent learn tutori instruct previou instruct agent larg avoid problem learn variabl instruct learn procedur sequenc instruct homer requir instruct canon execut order robot teach pendant flexibl procedur instruct taught chang tire desir sequenc physic oper task taught number wai teacher begin jack correspond singl primit student teacher jack frame assum infer oper instruct sequenc start actual physic oper remov oper abstract remov bolt doesnt correspond singl physic instructor assum plan teach jack car illustr reason instructor teach task simpli indic exact sequenc primit oper carri instructor instruct applic futur assum student reach futur state current state instructor assumpt instruct requir give direct offic end turn assum hall instruct told doorwai told execut doorwai instructor abstract oper primit oper student occur instructor simpli oper student instructor teach student hierarchi oper task formal problem definit situat agent instruct reach goal goal reach set instructor guid system goal indic oper perform problem limit case instruct directli correspond singl primit oper oper directli perform precondit instructor system reach state chosen oper perform simplifi version problem formal call oper world state oper precondit applic state transform state problem state start state problem simplifi wai agent state follow linear sequenc uniqu transform oper real oper state transform varieti wai real agent oper chang portion oper applic gener relev portion possibl analysi problem state preclud higher level direct implement directli transform implement sequenc lower level oper consid understand type oper assum chang tire oper instruct thing precondit jack car hold implement remov bolt oper implement correspond achiev constraint problem analysi proce assum system instruct carri oper precondit creat subgoal reach state precondit met instructor figur legal instruct sequenc reach state instruct system achiev continu instruct reach goal agent state instruct perform oper system creat subgoal reach state instructor subgoal achiev perform instruct constrain appli recent subgoal form analysi instruct sequenc sequenc oper sequenc reach obei constraint mention instructor requir instruct complet current subgoal instruct goal mean oper instruct oper lower indic instruct complet reach instruct sequenc prohibit oper complet select chosen defin number instruct sequenc lead goal initi state achiev instruct sequenc empti reach sequenc goal forward backward order instruct instruct system state execut subgoal form reach instruct subgoal appli correspond robot told reach forward backward order note case execut order oper goal situat complex instructor initi oper achiev initi instruct system move state left problem reach analog problem reach start instruct sequenc complet initi instruct subgoal form reach wai select leav problem reach analog reach wai initi instruct leav problem reach wai set legal sequenc shown figur pattern continu higher goal denot number sequenc state state clear goal legal instruct sequenc figur legal instruct sequenc reach state sequenc sequenc sequenc set legal sequenc shown figur shown pattern continu higher number goal recurr relat produc sequenc mathemat number number count interest set binari tree number grid path cartesian coordin system stai diagon line point close form number ad hierarchi instruct correspond directli primit analysi shown short sequenc primit oper instruct larg number instruct sequenc possibl instruct hierarchi set primit instruct correspond multipl basic action hierarchi set primit oper fulli agent instructor hierarchi domain order idea larg number hierarchi hierarch structur sequenc primit oper line block hierarchi goal line block shown figur total number hierarchi sequenc action correspond total number partial tree produc leav tree partial instructor instruct action base includ oper number total tree leav grow exponenti easi lower bound dale penn state mathemat depart identifi recurr relat line block pick block move block move close gripper move left put move open gripper line block grab block move block move close gripper move left put move open gripper move move figur instruct hierarchi boldfac box primit number order instruct point simpli instructor larg number hierarch structur agent learn instruct learn difficult learn analysi present base simplifi version point procedur taught great number wai simplif reduc number instruct sequenc limit form state result view lower bound real instruct number legal instruct sequenc procedur greater consid equal larg number instruct sequenc amount flexibl instructor instructor skip step hierarch structur procedur subtask taught procedur larg number wai appendix chunk intern project produc gener rule appendix describ detail intern forward project instruct oper result learn gener knowledg oper describ learn gener rule move tabl pick shown figur instruct pick block learn procedur instruct chapter chunk gener rule creat soar learn appli success forward project instruct chunk form learn dejong organ differ standard ebl method relationship chunk standard ebl notion train exampl goal concept detail laird rosenbloom learn occur result return subgoal resolv impass goal chunk process build rule creat result subgoal base directli condit initi situat impass occur similar situat occur rule fire produc subgoal result avoid impass altogeth prototyp case diagram figur circl letter properti test rule arrow repres rule vertic dot line boundari subgoal impass occur soar situat properti impass resolv result subgoal creat intermedi result creat subgoal goal object sit tabl robot dock gripper statu oper figur gener oper rule learn instruct yellow newli learn figur process lead chunk chunk oper creat chunk produc directli initi situat avoid process subgoal chunk built chunk begin determin condit initi situat led creation result result chunk process creation move back rule appli subgoal reach condit initi situat test case figur start move back initi properti led rs chunk creat rule form variabl rule made gener convert identifi rule variabl constant valu directli test identifi final result variabl form rule chunk forward project process appli complex situat learn gener chunk process chunk learn situat explan instruct yellow forward intern project shown figur larg move repres impass lead bottom repres resolut impass return result agent begin state select oper pick red perform impass agent select begin carri result agent attempt recal past recal yellow immedi return oper agent attempt evalu select oper verifi success current situat detail soar variabl rule recal success learn robot dock figur intern project instruct lead learn gener rule directli knowledg indic impass result subgoal rightmost column figur intern forward project recal oper carri order verifi success current situat top rightmost column show start state forward project duplic pictur current set properti start agent project effect oper execut sequenc start recal oper project move top bottom figur arrow repres piec oper effect knowledg agent appli move state oper effect rule depend properti state oper project state project reproduc properti initi state figur show properti project depend properti shown underlin ital properti hold initi test rule project forward project final execut step arm oper select oper knowledg termin test termin condit shown declar forward project success goal project successfulli reach success evalu resolv impass eval oper success agent oper resolv initi impass soar learn occur result return subgoal resolv impass result return success evalu project resolv initi impass chunk learn chunk perform learn oper rule figur primari target instruct chunk back success rule fire intern project evalu end reach condit initi state condit found shown underlin ital condit initi state copi pictur state start project state top rightmost test project produc success evalu addit state test project produc gather condit rule variabl produc result chunk shown bottom figur identifi thing specif block tabl variabl specif constant variabl result rule move tabl pick success forward project identif kei condit move tabl success action extran color block includ chunk success project depend bibliographi condit elizabeth page cambridg univ jame allen raymond perrault analyz intent utter artifici richard carpent read instruct thirteenth annual confer cognit scienc page august richard roland routin behavior intern joint confer artifici page richard roland carpent instruct usag technic report comput scienc brandei juli john anderson architectur cognit harvard john anderson skill compil problem solut psycholog john skill acquisit train principl appli human page john wilei son alan iri analysi design tool artifici intellig william birmingham georg knowledg acquisit tool explicit method knowledg engin william birmingham daniel siewiorek autom knowledg acquisit comput hardwar synthesi system knowledg benjamin bloom sigma search method group instruct effect tutor educ susan david model acquir procedur text handbook read volum ii susan jane model procedur acquisit written instruct phd dept rj brachman introduct brachman research natur languag page newman situat cognit cultur learn educ jaim carbonel gil learn intern workshop machin page jaim mitchel overview machin learn machin artifici intellig approach morgan john carrol minimalist train chandrasekaran gener task highlevel build block expert system design ieee david chapman action phd massachusett institut artifici intellig april chi vanlehn content physic journal learn glaser student studi exampl learn solv problem cognit elizabeth churchil richard young model devic knowledg soar luc steel barbara artifici intellig simul page heurist classif artifici davi interact transfer acquisit infer rule artifici gerald dejong raymond moonei altern view machin dietterich learn knowledg level machin webber plan recognit understand instruct intern confer artifici intellig plan page colleg white interpret natur languag instruct cole juli understand natur languag case annual meet juli role explicit action statement understand written direct journal memori peter dixon plan written direct complex task journal verbal learn verbal peter dixon process organiz compon step inform written direct journal memori mark drummond situat control rule intern confer principl knowledg morgan kaufmann thoma survei program perspect comput catherin miller talk analysi logo instruct tan tool intern journal lander effect mental practic motor skill learn journal sport fike nilsson approach applic theorem prove problem solv artifici nilsson learn execut gener robot plan artifici file syntax recal instruct realist situat british journal fisher knowledg acquisit increment conceptu cluster machin nichola thoma dietterich studi method induct learn machin transfer menu system chi confer human factor comput system ford sandra thompson condit studi english elizabeth page cambridg univ integr natur languag comput model kluwer academ phd yale depart comput allen ginsberg theori prior seventh nation confer artif page laird learn search control guidanc tenth intern joint confer artifici page august diana gordon subramanian multistrategi learn scheme assimil advic agent intern workshop multistrategi harper wayn grai judith transfer cognit skill transfer contemporari research page academ grosz focu dialogu understand phd barbara grosz descript natur languag dialogu element workshop comput aspect linguist structur page cambridg gruber autom knowledg acquisit strateg knowledg machin guha lenat report ai norman haa gari learn acquir knowledg inform manag machin artifici intellig approach morgan john condit topic rj hall learn fail explain nation confer artifici page august steven hank practic tempor project eighth nation confer artifici aaai press frederick philip david advic knowledg iter view skill acquisit john cognit skill page lawrenc erlbaum john holland escap possibl learn algorithm appli parallel system machin artifici intellig volum ii morgan scott huffman john laird dimens complex learn interact instruct jon cooper intellig robot space spie volum novemb scott huffman john laird learn procedur interact instruct fike nation confer artifici page video present scott huffman john laird learn procedur interact natur languag instruct machin tenth intern scott huffman john laird acquir procedur tutori instruct knowledg acquisit system scott craig john laird learn capabl unifi theori cognit fifteenth annual confer cognit scienc page scott dougla john laird correct imperfect domain analysi susan alan foundat knowledg cognit model complex learn kluwer technic report number michigan depart electr engin comput novemb scott huffman problem space symbol level descript artifici intellig condit mental model elizabeth condit cambridg univ johnson function imageri movement quarterli journal jone effect neg qualifi instruct journal verbal learn verbal relat special train intellig educ marcel patricia carpent verbal instruct situat david cognit instruct lawrenc erlbaum norman badler semant analysi action verb base physic primit annual confer cognit scienc page natur languag control anim task perform physic domain phd univ dept comput inform june henri kautz jame allen gener plan recognit nation confer artifici page david susan role mental model learn oper devic cognit david susan acquisit procedur analysi transfer train journal memori walter text cognit yve kodratoff tecuci interact system weak theori field tenth intern joint confer artifici page august yve kodratoff tecuci techniqu design learn intern journal expert elli cognit factor learn retent procedur task technic report navi personnel research develop san john laird paul rosenbloom integr learn soar extern environ eighth nation confer artifici page aaai press john allen paul rosenbloom architectur gener intellig artifici john eric christoph michael learn system soar nasa confer space john michael eric christoph correct extend domain knowledg guidanc seventh intern confer machin john bate erik robert doorenbo soar user version john laird subgoal phd comput scienc john laird recoveri incorrect knowledg soar nation confer artifici page august jean etienn situat legitim particip cambridg univ richard allen newel natur languag spring technic report school comput carnegi mellon march allen thad richard lewi role languag comput inquiri concept human mind lawrenc erlbaum richard allen thad soar theori instruct reason task annual confer cognit scienc august lewi learn gener procedur cognit richard lewi theori human sentenc phd carnegi mellon school comput forthcom robert lindsai inferenti memori basi machin understand natur languag feigenbaum comput page instruct strategi train principl appli human page john wilei son dian litman jame allen plan recognit model subdialogu cognit dian litman jame allen process plan intent page mit mechan problem solv psycholog william mann sandra thompson rhetor structur function theori text organ marcu mcdermott knowledg acquisit languag system artifici shaul markovitch paul scott role forget learn intern confer machin ann charl martin jame firbi gener natur languag expect reactiv execut system thirteenth annual confer cognit scienc page august mccarthi advic semant inform page mit mcdermott preliminari step taxonomi method autom knowledg acquisit knowledg base page kluwer michalski robert stepp learn conceptu cluster machin learn artifici intellig approach palo georg miller philip languag percept cambridg univ craig miller model concept acquisit context unifi theori cognit phd dept comput scienc electr steven jaim craig daniel oren gil perspect artifici tom unifi view machin sridhar loui learn system vlsi design yve kodratoff machin artifici intellig vol iii morgan tom mitchel gener search artifici moham factor affect success read technic instruct read foreign raymond moonei learn plan schemata learn plan recognit cognit david mechan transform task oper procedur phd depart comput april learn machin transform advic heurist search procedur machin artifici intellig approach morgan jack make advic oper nation confer artifici page musen autom support build extend expert model machin allen newel herbert simon human problem solv prentic englewood allen john paul erik formul problem space comput model anniversari school comput carnegi mellon septemb allen newel plai question natur project comment paper symposium visual inform process academ allen newel problem solv problem space fundament categori attent perform viii erlbaum allen newel knowledg level ai allen newel unifi theori cognit harvard dirk ourston raymond moonei chang approach theori refin nation confer artifici page role dialogu provid scaffold instruct educ michael pazzani comput theori learn causal relationship cognit michael pazzani learn predict integr theori learn journal learn dougla scott mark john randolph jone symbol solut intellig control ieee robot autonom press porter kibler goal method learn heurist machin holt concept learn heurist classif domain artifici quinlan induct tree machin michael redmond learn observ understand expert problem solv phd georgia institut paul rosenbloom jan knowledg level induct chunk nation confer artifici paul rosenbloom john laird map gener soar nation confer artifici page august paul rosenbloom allen newel chunk goal gener model practic machin artifici intellig volum ii morgan paul john allen newel chunk skill knowledg work model human page academ editor soar research integr intellig mit rumelhart editor parallel distribut explor microstructur cognit mit michael instruct product retrospect analysi machin artifici intellig page morgan marco learn forget tenth intern confer machin page bob wielinga situat intern joint confer artifici page roger schank david leak creativ learn explain artifici roger schank conceptu inform process american alberto maria learn system mechan assembl ieee confer artifici intellig page raymond geoffrei towel symbol neural learn comparison machin shen herbert simon rule creation rule learn explor intern joint confer artifici page herbert simon john understand complex task instruct david cognit instruct lawrenc erlbaum herbert simon artifici intellig system understand intern joint confer artifici page mark john anderson transfer cognit skill harvard smith goodman understand written role explanatori schema cognit sutton learn world model connectionist network seventh annual confer cognit scienc page richard sutton learn predict method tempor differ machin leonard lexic semant structur lexic form timothi languag typolog syntact descript cambridg univ educ psycholog thrun mitchel integr induct neural network learn learn intern joint confer artifici page refin approxim domain theori neural network nation confer artifici page vanlehn jone learn physic learn correct analog search control intern machin learn kowalski learn model effect annual confer cognit scienc page kurt randolph chi model effect journal learn kurt vanlehn learn lesson artifici vanlehn mind origin procedur misconcept mit richard situat appli symbol theori interact task annual confer cognit scienc steven vere timothi bickmor basic agent comput jame social interact higher psycholog clarif applic theori human david wilkin knowledg base refin improv incomplet incorrect domain theori kodratoff machin artifici intellig volum page morgan ya wilk semant natur languag infer artifici terri winograd understand natur languag academ david jerom ross role tutor problem solv journal child psycholog patricia wright wilcox make studi condit imper process visibl languag yost allen newel problem space approach expert system specif intern joint confer artifici page yost acquir knowledg soar ieee
HCI/144 4 short titl fundamenta informatica io press qualit spatial reason overview cohn school comput leed unit kingdom abstract paper overview major qualit spatial reason techniqu survei main aspect qualit knowledg includ ontolog orient shape qualit spatial reason includ reason spatial chang final discuss theoret result futur work paper version qualit spatial ontolog text slightli di erent format fi format cohn overview introduct qualit reason concern captur everydai knowledg physic myriad equat engin scientist explain complex physic phenomenon creat quantit model princip goal qualit reason make explicit reason comput make explain behaviour physic system qualit manner intract unavail quantit model essenc qualit reason wai repres continu properti world discret system symbol quantiz quantiz equal state idea relev distinct made quantiz relev kind reason perform result set qualit valu term quantiti indistinguish valu identi ed class natur order partial quantiti form simpl ectiv infer exploit transit order qualit arithmet algebra produc ambigu answer research qualit reason literatur devot overcom detriment ect search space result ambigu import aspect work tradit qualit reason worth note standard assumpt chang continu simpl consequ quantiti pass intermedi valu frequent quantiti space variabl transit rst notion exploit work qualit spatial reason qualit spatial reason spatial dai interact physic case driven qualit abstract complet priori quantit knowledg qr hold develop theori reason space justi es interest studi spatial concept cognit point view provok birth note qualit reason infer made absenc complet probabilist fuzzi techniqu reli arbitrarili assign probabl membership di erenti quantiti sucient evid case indistinguish relat relat import characterist perceptu seri small combin form percept chang indistinguish relat exiv lead paradox percept place theori indistinguish theori percept present wai avoid paradox word theori context set formal axiom properti relat collect natur scientist empir testabl explan observ regular cohn overview qualit spatial reason ai gi space adequ repres singl scalar quantiti natur space qr earli naiv physic manifesto neglect partial attribut conjectur pure qualit success reason physic system success develop pure qualit reason spatial kinemat mechan conjectur fact imposs pure qualit spatial reason mechan forbu al correctli identifi transit valu kei featur qualit quantiti space doubt exploit higher dimens conclud space higher dimens spatial reason weaker number challeng provid calculi machin repres reason spatial entiti resort tradit quantit techniqu preval comput graphic comput vision commun amount research coupl year weaken conjectur qualit spatial address di erent aspect space includ size distanc put forward rich exploit transit demonstr composit tabl tabl allen interv tempor logic built paper overview major qualit spatial reason techniqu section mention applic qualit spatial reason section survei main aspect qualit spatial knowledg includ ontolog orient shape section discuss qualit spatial reason includ reason spatial chang paper conclud present theoret result futur work paper version applic qualit spatial reason research motiv wide varieti applic area includ geograph inform system robot high level spatial proposit semant natur engin reason physic system visual languag syntax semant numer applic area includ qualit recognit notion biologi domain space gi major problem interact gigabyt inform store vector raster cientli support intuit orient interact user abstract mass numer data queri qualit gener gi built concept naiv geographi naiv geographi emploi qualit cohn overview reason combin provis queri robot navig ultim requir numer speci ed direct robot move hierarch plan detail delai high level plan achiev shown ectiv robot model environ lead inabl standard robot navig techniqu qualit model space facilit plan approach develop robust qualit method robot map navig spatial environ qualit solut mover problem comput vision visual object recognit higher level includ interpret integr visual inform qualit symbol reason shape object match geograph object techniqu interpret result comput higher level descript scene video input qualit predic ensur scene semant close ident similar descript natur interpret spatial proposit tend ambigu multipl wai natur languag spatial preposit cite di erent mean li motiv qualit spatial nding formal describ preposit engin robot ultim requir fulli metric descript earli stage design reason qualit descript suce eld qualit kinemat larg concern support type activ visual visual program languag kind lack formal speci cation kind expect textual program languag languag make metric bulk predominantli qualit exact length compon diagram pictur unimport import topolog relationship compon li theori qualit spatial reason languag aspect qualit spatial repres space rich histori physic scienc serv locat object quantit framework spatial express tend oper partit domain descript space ad hoc basi emerg qualit spatial reason partit systemat di erent aspect space decid kind spatial entiti admit commit ontolog develop di erent kind wai describ relationship kind spatial size distanc rel orient shape cohn overview ontolog mathemat theori point consid primari primit spatial entiti point extend spatial entiti region de set point minor tradit philosoph error strong tendenc region space primit spatial entiti ontolog shift mean build theori spatial geometr strong reason region ontolog primit interest spatial theori reason physic argu spatial extens physic object lower dimens entiti de ne term region admit time advantag view physic entiti entiti entiti dimens pertin question mix dimens entiti discuss issu found ontolog question natur spatial imagin applic discret nite convex tension model favour approach handl spatial inform digit lower level attempt bridg gap develop qualit spatial theori base discret model space recent investig discret continu decid ontolog primit logic amount decid primit logic symbol admit de constrain set axiom argu set primit mathemat eleg make easier assess consist simplifi interfac symbol system compon fewer primit implement argument result symbol infer complic natur larg rich set concept mean axiom connect di erent wai nal ontolog question model multi approach model space dimens project region dimens reason dimens separ approach object overlap project ax fact overlap domain orthogon align object simon perceiv peopl perceiv individu nite cohn overview topolog topolog fundament aspect space clear topolog form fundament aspect qualit spatial reason topolog make qualit distinct topolog studi extens mathemat abstract relev attempt spatial reason qualit spatial theori uenc mathemat number reason import undesir gener interest qualit spatial reason paid attent mathemat algebra topolog reason form region relat region region relat region relat hold adapt convent mathemat strategi adopt exist approach topolog commun work found philosoph logic commun work built axiomat theori space predominantli topolog region point primit tradit term work clark lead develop call system develop ec dc po figur illustr relat calculu continu transit neighbourhood clark primit notion idea region connect region consist set system interpret slightli chang closur region share point theori present suitabl distanc mean distanc cf ect distinct closur argu relev kind domain concern surprisingli de ne predic function captur interest topolog distinct set jointli exhaust disjoint relat illustr figur set formal semant canon cohn overview model arbitrari ground boolean atom procedur gener actual interpret ensur individu connect principl supplement hold work mention base clark calculu origin interpret fusion oper made rst order error correct contrari argu di erenti closur interior cognit materi object close individu complement open interpret share point framework di erent notion connect literatur analyz present dimens variat closur region connect point connect compon region express toru solid hole doubl loop block minu block solid gap figur distinguish shape taxonomi topolog properti relat de ned singl predic simpl predic de ne predic de ne predic count number time region touch seri set task distinguish solid piec region singl shown restrict set assumpt topolog properti region target region shape depict figur distinguish rang topolog distinct region made shown figur interior connect mean interior region piec easi express properti term rule region exclud region figur boundari simpl curv form point neighbourhood boundari local de ne predic cohn overview rule case figur mean straightforward demonstr de nition intend con figur di erent type con region sourc diculti fact region model axiom assum uniform fact region refer directli boundari region share boundari ec relat entiti di erent tendenc work involv qualit spatial reason spatial entiti consid theori dimens case reason relat system base predic power inch calculu treat point spatial extend entiti special gener notion extent aim improv express calculi avoid counterintuit consequ approach argu standard model space time base segment wrong topolog structur event region boundari illustr modifi model topolog structur address problem repres reason region di er mix variant classic origin work part relat topolog boundari boundari region dimens lead desir intuit pictur strictli linear hierarchi dimens theori introduc notion boundari region explicitli includ topolog altern approach repres reason topolog relat seri paper set point region boundari complement relationship region matrix call task trivial primit introduc section reason region di erent imposs sort structur essenti copi theori simpler matrix featur interior boundari sucient describ relat matrix express set relat de ned note account relationship region space cohn overview account physic realiti space speci assumpt natur turn remain matric relat calculu reason region hole classifi relationship pair relationship hole region region hole di erent calculi relat deriv chang underli assumpt region matrix repres intersect deriv calculu repres reason region extend matrix cell dimens intersect simpli exist relat line point larg number relationship de ned term base gener set ve polymorph binari relat pair spatial entiti cross complex relat form conjoin atom proposit form ve relat argument boundari endpoint oper appli express calculu cbm combin relat relat give total relat mode overlap varieti wai region partial overlap previou work except partial overlap singl relat denot connect singl relat whilst realiz potenti nite varieti partial overlap matrix number connect compon investig matric number greater theoret physic topolog present systemat account subtl relat topolog note whilst sucient theori literatur integr topolog main strategi integr cohn overview gener ad topolog primit al add topolog primit connect spatial entiti part relat altern singl primit connect part main advantag separ theori topolog colloc share part approach topolog primal theori topolog theori base mention de ne eleg singl uni ed coloc impli share part theori lower spatial absolut nal approach topolog introduc domain speci theori addit primit introduc idea restrict quanti cation introduc predic de ned def topolog fulli metric spatial topolog abstract qualit spatial potenti situat inform insuci section explor di erent wai qualit inform repres orient orient relat describ object rel de ned term basic primari refer object frame refer unlik topolog relat spatial entiti orient binari relat orient primari respect refer kind frame manifest displai qualit orient calculi found calculi explicit relat frame refer explicit relat worth mention work earlier work develop calculu base function map tripl point qualit denot collinear orient reason visibl locat qualit navig task shape descript develop calculu reason rel orient pair line segment orient base relat true show number qualit calculi translat system reason system constraint logic exploit disadvantag theori reason np complet nement lead algebra ternari relat cohn overview cyclic order orient atom gener relat algorithm polynomi complet subclass includ atom relat distanc size spatial distanc divid main measur provid kind rel measur tradit qualit reason primarili concern deal linear quantiti qualit algebra transit quantiti space mention earlier distanc size measur interest context order magnitud calculi develop qr commun tradit qr formal kind delta calculu introduc note amount term big speci calli develop qualit spatial reason earliest primit true bodi connect simpl translat rotat shape primit easi de ne notion nearer farther primit simpl size metric region de region larger connect region method determin rel size object reli translat region shape size exploit topolog relationship translat region proper part smaller distanc close relat notion distanc sum distanc point region vari depend orient number calculi base primit combin distanc orient inform straightforward idea combin direct repres segment compass simpl distanc metric slightli sophist idea introduc primit de ne posit point respect direct line segment point approach combin knowledg distanc posit qualit combin orient present liu explicitli de ne semant qualit distanc qualit orient angl formul qualit de ne composit tabl calculu combin type inform suggest comput quantit visual simul anneal interest framework repres distanc complex result calculi present section straightforward rel measur simpli write cohn overview tend includ orient distanc system order sequenc distanc relat set structur relat give addit inform distanc relat relat distanc accept distanc success accept area de ne sequenc structur relat de ne relationship typic structur relat monoton properti greater sum structur relationship order magnitud structur relationship import ning composit tabl homogen distanc system distanc relat structur case heterogen distanc system system fact context ect distanc handl di erent frame distanc system infer di erent frame refer articul rule obviou ect move context qualit distanc term vari distanc behav wai context distanc symmetr domain shortest distanc point straight line lake build shape shape import characterist dicult describ qualit pure topolog theori limit statement made shape interior piec observ constrain shape rigid object topolog constraint relat applic demand ner grain kind inform introduc explicit qualit shape descript introduc kind shape primit whilst retain qualit mathemat commun develop di erent geometri express euclidean project necessarili develop ecient comput reason techniqu qualit approach shape approach work describ boundari object includ classifi sequenc di erent type combin qualit orient absolut distanc combin qualit orient rel distanc inform combin distanc posit calculu section introduc composit tabl distanc measur time journei longer return downhil journei orient distanc primit discuss add pure mention larg point base directli applic describ shape region cohn overview ari segment describ sequenc di erent type curvatur extrema contour techniqu slope project approach describ polygon corner describ qualit direct corner set approach altern construct complex shape region simpler line construct solid start qualit set primit dichotomi drawn primarili describ boundari object compar repres interior arguabl techniqu prefer shape inher concept version medial axi de ning grain region lead modi ed version tradit call angular skeleton shape descript volum compon exempli ed work shape abstract primit bound box convex hull consid brie model whilst techniqu investig extens calculu theori shown interest predic de ned notion convex hull region predic test combin topolog comput topolog relationship shape di erent compon di erenc convex hull distinguish di erent kind concav shape nement techniqu exploit idea shape descript describ convex compon di erenc convex hull shape convex hull power primit fact recent shown system essenti compact planar shape relat transform distinguish constraint languag leav topic shape descript point work describ shape properti compact elong minimum bound rectangl shape order magnitud calculu elong comput ratio side minimum bound rectangl whilst compact compar area shape minimum bound rectangl notion voronoi hull uncertainti granular uncertainti granular featur inform domain knowledg uncertainti vagu indetermin region boundari granular notion gener descript requir case vagu spatial concept distinguish spatial situat object region occupi adequ treatment vagu spatial theori abstract detail gener inform receiv attent ai commun cohn overview inform account vagu region vagu relationship philosoph debat vagu object exist formal theori deal vagu extent glue standard numer techniqu reason uncertainti research extend exist qualit spatial reason techniqu explicitli repres reason uncertain inform extens calculu similar approach approach continu seri paper postul exist crisp region addit crisp region add binari relat region varieti relat de ned term primit extend theori relat origin repres reason ind nite region boundari model region indetermin boundari pair region shown figur repres minimum extens ind nite whilst egg repres maximum extens turn gener relat crisp region natur cluster set egg crisp figur structur region indetermin boundari extens similar calculu ne granular postul cluster group ad hoc techniqu achiev interest extens work show calculu region broad boundari reason region indetermin boundari cover number kind region includ convex hull minimum bound bu er zone raster notion ind nite relat locat deal notion part rough locat spatial object exact locat region space object notion part locat introduc relat part spatial object part spatial region rough locat spatial object part locat spatial object respect set region space form region partit notion rough locat link part spatial object part partit region argu observ measur locat physic realiti yield knowledg rough vagu de ned object locat region special applic model raster undertaken cohn overview partit consist concentr boundari notion rough locat partit consist concentr region coincid notion vagu region introduc calculu repres reason locat rigid object move region present present de ne notion mobil describ subset relat suitabl repres spatial analyz comput complex set work base congruenc worth note similar idea rough set exact relationship explor approach spatial uncertainti work indistinguish relat transit fail gener class develop nonmonoton spatial logic qualit spatial reason work concentr aspect comput paradigm investig includ constraint base reason preval form qualit reason base composit tabl composit infer relat fact form relat fact form involv valid composit infer depend case constant involv logic properti relat case composit pair relat maintain tabl requir techniqu signi canc deal relat inform involv xed set relat set store composit tabl relationship pair relat entri disjunct qualit natur calculu limit set binari simplic composit infer make attract mean ectiv reason composit tabl receiv attent calculi mention paper composit tabl construct time pose challeng reformul rst order logic order intuitionist proposit formula repres constraint situat gener composit tabl shown tabl automat composit tabl necessarili subsum form desir reason interest question composit tabl reason sucient infer origin allen analysi tempor relat call tabl appropri renam tabl relat involv composit relat repres transit individu relat reformul interest true spatial theori spatial implic interpret disjunct sum region approach automat gener composit tabl order modal logic cohn overview ec dc dc ec po dc eq dr dc dr dc dc po eq po dc ec pp dc ec po eq dc dc tabl composit tabl relat mechan theori suggest formal relat algebra suit repres composit reason deserv studi wider applic case composit base reason gener constraint base reason sucient constraint satisfact problem resort theorem kind theorem prove reason spatial chang concern pure static spatial calculi import develop calculi combin space time integr fashion topolog spatial entiti chang dimens abstract granular shift spatial chang chang number topolog compon break fuse blob chang number tunnel drill block chang number interior put lid domain assum chang continu case tradit qualit requir build spatial calculu respect underli continu natur requir common di erent kind spatial chang mention import qualit valu relat neighbour predic hold continu chang predic hold neighbour continu network de ning neighbour call conceptu neighbourhood literatur consequ treatment aspect space orient zimmermann approach cardin direct frank approach qualit distanc integr spatial model view road line entiti wide entiti rang mountain pass delic cargo chang polit move boundari entiti discontinu manner cohn overview term describ structur allen relat conceptu close meet neighbour overlap illustr figur qualit spatial calculi report paper conceptu neighbourhood construct qualit simul common form comput tradit qr literatur qualit conceptu neighbourhood diagram easi build qualit spatial simul simul set ground atom statement describ initi state construct tree futur state branch tree result ambigu qualit calculu continu provid sucient constraint restrict gener state reason set gener domain speci constraint requir addit desir extens analog earlier qr work incorpor proper theori spatial process couch languag work direct eld base theori spatial process heat ow analysi topolog conceptu neighbourhood diagram correspond process rotat region process resist boundari base shape descript languag shape infer sequenc process chang worthi note qualit spatial simul work base system qualit motion larg amount work theori basi work motion qualit framework motion framework work insist concept dynam research default reason metric space motion kei notion understand spatial relat relat form potenti continu remain implicitli assum notion problem conceptu neighbourhood built manual calculu potenti error prone oper relat techniqu arriv automat analysi structur conceptu neighbourhood report goal fundament approach exploit continu underli semant space note lift notion close individu relat entir scene set relat common object gain measur conceptu similar suggest close relat notion topolog predic neighbour respect matric di er fewer entri result neighbourhood graph ident true conceptu neighbourhood continu graph link miss construct simul transit calculu approach cohn overview construct conceptu neighbourhood class relat infer relat domin domin hold interv instantan domin eq domin neighbour relat domin analog equal chang law found tradit qr stricter tempor order event occur qualit simul motiv desir exploit decid modal logic qualit seri express calculi easili repres restrict continu motion approach automat infer continu network muller idea histori enrich theori intend spatial entiti achiev formal theori reason motion present model primit entiti tempor relat de ned express power theori de nition complex motion class express motion verb natur languag properti assum desir part theori motion recov give sound theoret basi qualit motion altern approach explor express power qualit geometri problem repres reason motion rigid bodi con ning environ theoret result work gener spatial remain number theoret question calculi formal semant inventor question simplest semant semant task show set formula consist set entail complex procedur theori weak true formula stronger formula made true theori theori decid properti model theori model model di erent cardin de nition interest properti categor countabl model model user viewpoint question special region base theori ontolog answer standard point base interpret approach base approach signi advantag firstli assum morpholog primit sphere predic congruenc emploi addit topolog primit topolog concept de nabl prove categor direct encod tarski geometri axiom languag cohn overview simplest model altern model involv region nite piec argu region base theori interpret point set theoret fundament result decid widespread applic qualit spatial theori show boolean algebra ad closur oper extern connect relat result undecid system encod arbitrari statement arithmet impli clark calculu relat calculi rst order theori calculi undecid question decid subsystem constraint languag shown decid achiev encod relat set formula intuitionist proport calculu decid calculu languag subsequ shown tractabl fact satisfact problem solvabl time complex class nc constraint languag constraint arbitrari disjunct tractabl maxim tractabl subset constraint languag identi ed shown path consist sucient decid consist case size constraint introduc region reason ectiv polynomi complet classi cation tractabl made turn maxim tractabl subset relat subset set base relat work complex includ complex topolog theori present orient calculu determin polynomi subset base whilst determin sati abil gener algebra np complet similarli show whilst gener consist problem algebra cardin direct np consist relat polynomi set maxim tractabl subset complex analysi morpholog calculu base congruenc interest analysi consid calculu simpler calculi determin number di erent problem instanc relat consist planar realiz tractabl harder problem shown constraint languag intract hard determin set algebra constraint real clark system semant set euclidean space shown complet weak turn contrari clark relat theori fact complet boolean algebra system correct problem clark mention semant shown complet author manner descript logic commun sought line divid decid undecid tractabl intract cohn overview notion connect forc standard model model complet result strong deriv complet topolog theori element nite region primit null boolean function predic test region piec theori rst order requir rule infer view undecid rst order topolog mention rule infer exist model region sum nite connect region result theori complet decid notwithstand attempt deriv complet rst order topolog clear rst order nite topolog complet categor decid final comment issu address literatur issu cognit valid claim made qualit reason akin human empir justi cation except studi made calculu repres topolog relat region line studi investig prefer allen relat spatial case composit tabl entri disjunct fact human prefer model explain reason ecient presenc kind ambigu qualit extend evalu egenhof approach topolog relat paper survei kei idea result space exhaust survei eld knowledg singl spatial languag emerg hope eld develop librari reason devic criteria success applic case spatial qualit quantit knowledg reason qualit quantit reason complementari techniqu research ensur integr develop reliabl wai translat kind formal interfac symbol techniqu develop diagrammat reason commun interest import challeng enforc model lead question good idea model distinct strong weak connect topolog pure spatial appli theori physic object materi substanc region occupi extens theori spatial granular ner ner granular fewer instanc weak connect true limit theori classic topolog model exist research problem includ cohn overview acknowledg rst author gratefulli acknowledg nancial support epsrc grant recent eu support network workshop provid excel forum discuss idea paper contribut commun colleagu gratefulli acknowledg author acknowledg nancial assist refer receiv scholarship unit kingdom refer knowledg tempor commun page nonmonoton nebel advanc arti cial page geometri common semant complet axiomat proc intl joint conf arti cial intellig page approach semant semant preposit mental process natur languag de del de edit del logic incid journal logic page reason proposit torasso principl knowledg reason proc intl conf san morgan step construct absolut complet theori spatial jj lm pereira orlowska proc page logic qualit spatial bulletin interest group pure appli logic page ftp mpg index html composit tabl provid complet tractabl proof procedur relat constraint proc workshop spatial tempor foundat qualit proc european conf ai cohn overview rigid bodi motion qualit theori spatial proc american conf ai notr dame journal formal page theori human imag psycholog page ontolog epistemolog rough mark spatial inform theori cognit comput foundat geograph inform proc lnc page pointless theori space base strong connect aiello doyl principl knowledg proc intl conf morgan page human machin spatial proc intl symposium spatial data franci page structur spatial philosoph page hole super mit de lenzerini express descript robinson voronkov handbook autom elsevi scienc publish descript recognit multiresolut imag vision page calculu individu base notr dame journal formal page notr dame journal formal page di small set formal topolog relationship suitabl end user abel ooi advanc spatial proc intl symposium spatial lnc page topolog spatial strategi queri comput page di comparison method repres topolog inform page di algebra model spatial object undetermin frank proc specialist meet geograph entiti undetermin franci di topolog intern journal approxim cohn overview di global framework qualit shape di posit arti cial page hierarch qualit space base connect frank kuhn spatial inform theoret basi proc lnc page spatial reason nebel advanc arti cial lnai page spatial proc workshop adapt spatial dynam page reason qualit spatial relat stock spatial tempor page comparison structur spatial tempor smith white philosophi cognit scienc proc intl wittgenstein vienna region undetermin proc workshop theori spatial region indetermin smith topolog foundat cognit region indetermin frank proc specialist meet geograph entiti undetermin franci page approach repres spatial aiello shapiro principl knowledg proc intl conf morgan page calculu region base qualit spatial page logic de ned qualit spatial intern journal special issu formal ontolog conceptu analysi knowledg page relat prade proc european conf ai wilei page taxonomi qualit topolog mark spatial inform cognit comput foundat geograph inform proc lnc page complex reason spatial journal cial intellig page cohn overview locat cohn giunchiglia selman principl knowledg proc intl conf morgan page simul base logic formal space proc american conf ai page paradox percept limit levesqu reiter principl knowledg proc intl conf morgan page morgan network topolog relat page de line surfac set journal page de measur rough set arti cial page approach region connect technic school inform softwar voronoi model cultur applic social scienc frank spatial inform theoret basi proc lnc page shape tangenti axi transform shape web www paper grain html formal de nition binari topolog litwin schek intl conf foundat data organ lnc page proc workshop foundat cognit volum report doctor seri cognit process journal visual languag page topolog spatial intern journal geograph inform page topolog spatial relationship line area formal natur languag spatial predic technic report nation centr geograph inform santa gradual topolog theori method reason geograph lnc page cohn overview di relat region intern journal geograph inform page topolog intern journal geograph inform page frank kuhn spatial inform theoret basi proc lnc page relationship region abel ooi int symposium larg spatial lnc restrict intern journal page framework base clp extend chr reason qualit orient posit journal visual languag page qualit spatial reason theori practic applic robot navig frontier ai volum io vagu reprint collect clarendon symbol approach qualit arti cial spatial reason algebra frank kuhn spatial inform theoret basi proc lnc page ag qualit event model automat video imag vision page topolog arti cial page reason space gentner steven mental page process arti cial page kinemat proc intl joint conf ai page spatial reason distanc direct geograph journal visual languag page reason base arti cial page util spatial structur cognit plausibl ecient proc ieee intl conf man page reason document technic texa cohn overview oper qualit spatial frank kuhn spatial inform theoret basi proc lnc page integr logic time proc intl joint conf ai qualit theori frank kuhn spatial inform theoret basi proc lnc page dimens qualit spatial wahlster proc european conf ai john wilei page time stock spatial tempor page journal visual languag page discret mark spatial inform theori cognit comput foundat geograph inform proc lnc page topolog qualit size constraint spatial proc intl conf principl practic constraint program handbook incid elsevi page theori arti cial page diagrammat mit spatial logic describ visual arti cial intellig paper integr natur languag vision process qualit proc intl workshop qualit aaai page languag syntax spatial logic marriott meyer proc workshop theori visual sequenc order type discret comput trend discret comput page ning made smith topolog foundat cognit volum report doctor programm cognit scienc de ning connect torasso principl knowledg proc intl conf morgan cohn overview axiomat approach topolog spatial inform technic report school comput inch proc intl symposium arti cial intellig singl primit de ning topolog properti relat term technic report school comput formal describ topolog spheric technic report school comput connect base approach topolog descript page proc intl joint conf ai morgan page topolog fundamenta page constraint base approach reason journal appli page fulli formal theori describ visual marriott meyer visual languag pp reason descript schubert shapiro principl knowledg proc intl conf morgan page uniform time space mutual constraint comput math ve physic expert system microelectron edinburgh ve physic ontolog hobb moor formal theori ablex publish page de ning motion verb spatial universitat de spatial lectur note arti cial intellig springer di frank kuhn spatial inform theoret basi proc lnc page languag spatial cognit interdisciplinari studi preposit cambridg proc intl joint conf ai page algebra cyclic order proc american conf ai page cohn overview spatial algebra model rel fachbereich complet classi cation tractabl journal arti cial intellig page www cs washington ps spatial reason object shape qualit frank spatial inform theoret basi proc lnc page formal theori spatial principl knowledg proc intl conf page cognit assess topolog spatial result empir spatial inform theoret basi proc lnc page mental model qualit spatial cognit assess allen proc annual conf cognit scienc lawrenc erlbaum page robot explor map strategi base semant spatial journal robot autonom page reliabl semant data integr sort proc conf inform knowledg acm page process grammar arti cial page gener conceptu neighbourhood tempor spatial anger proc workshop spatial tempor cardin journal visual languag page method spatial reason base qualit arti cial page qualit model gradient ow spatial distribut proc intl workshop reason page evalu ning comput model spatial relat spatial inform theoret basi proc lnc page recognit spatial organ proc royal societi seri page nite mark spatial inform theori cognit comput foundat geograph inform proc lnc page cohn overview reason process comput chemic page survei comput model spatial express oliv process spatial qualit model proc american conf ai vol page dune du pour la du de sen phd universit paul qualit theori motion base schubert shapiro principl knowledg proc intl conf morgan page primit space guarino formal ontolog inform proc int conf frontier ai volum io page properti qualit spatial advanc arti cial lnc page tempor maxim tractabl subset allen interv journal associ comput page complet system polygon journal philosoph polygon dame journal formal page magnitud proc american conf ai page model integr qualit spatial dynam reason physic proc american conf ai page spatial reason object applic physic problem ieee conf ai framework dynam structur phd school comput lattic theori space comput mathemat page lehmann semant pergamon page transit challeng autom theorem proc cade model forc falt advanc qualit mit page cohn overview spatial logic base region principl knowledg proc intl conf morgan page metric properti physic levesqu reiter principl knowledg proc intl conf morgan page tractabl fragment region connect proc intl joint conf ai page canon model region connect schubert shapiro principl knowledg proc intl conf morgan page complex qualit spatial maxim tractabl fragment region connect arti cial page histor summari contemporari ieee comput graphic page ho constraint close comput graphic imag page theori qualit spatial reason base order proc american conf ai page semant natur case al semant movement work paper intl page visibl locat qualit singh qualit reason page frank kuhn spatial inform theori theoret basi proc lnc page shape frank proc specialist meet geograph object undetermin franci reason spatial arti cial page studi clarendon concav rectangular ieee transact page analysi guarino poli proc intl workshop formal ontolog conceptu analysi knowledg page essai hahn librari live open chicago la page page cohn overview qualit spatial visual proc intl joint conf ai page algebra structur set frank spatial inform theoret basi proc lnc page tarski geometri chapter clarendon review ai plan hendler tate read morgan san order theori approxim anger al proc workshop spatial tempor page prospect data knowledg page boundari smith white philosophi cognit proc intl wittgenstein de relat spatial phd paul reason stock spatial tempor page algorithm tempor proc american conf ai page region interest postal proc intl conf document analysi recognit de read qualit reason physic morgan san process correct free macmillan pub reason base giunchiglia selman principl knowledg proc int conf page axiomat method cambridg canon model class real spatial abel ooi advanc spatial intl symposium lnc page qualit spatial reason combin orient frank spatial inform theoret basi proc lnc page delta frank kuhn spatial inform theoret basi proc lnc page spatial reason concept motion sloman prospect arti cial io page
ML/145 6 intellig search incomplet defin design space mark nation institut standard md andrew depart comput rutger nj abstract numer optim complex engin design offer rapidli produc design method gener assum object function constraint function defin realist simul tend violat assumpt present techniqu intellig comput gradient presenc patholog show gradient comput method part numer optim system test result system domain conceptu design superson transport found gradient cost design space search order magnitud sequenti quadrat system introduct autom search space candid design attract improv tradit engin design process step autom search requir evalu qualiti candid complex artifact main evalu comput simul optim sequenti quadrat program section fast reliabl appli search space satisfi assumpt gener assum object function constraint function defin realist simul tend violat assumpt optim simul anneal genet deal search space violat tend requir run simul gradient base method seek enhanc method presenc assumpt violat realist simul violat assumpt method tend exit return valu object constraint function call design unevalu point search space approach deal unevalu point simpli assign point bad return optim point optim comput gradient numer forward result gradient wildli inaccur optim attempt make inaccur fail reach optimum present techniqu comput gradient presenc unevalu point techniqu featur set rule comput gradient reason accuraci case presenc unevalu point rule embodi knowledg optim algorithm type patholog tend exist search space defin complex simul result show line search reduc step size find evalu part optim produc optim perform order magnitud cpu obtain gradient relat work work comput deriv multidisciplinari simul work fall categori approach residu govern equat comput deriv approach deriv subcompon solv system linear equat obtain deriv entir system respect design paramet method survei address issu comput gradient presenc patholog unevalu point al present model constraint method replac unevalu point section examin type model knowledg simul reliabl invok program describ algorithm detect assumpt violat problem lead simul discuss autom design system detect result forbu forbu forbu discuss qualit simul check qualiti numer simul strategi deal model failur autom design system discuss number research effort combin ai techniqu numer optim al describ method switch accur accur simul base magnitud gradient al describ wai expert system appli parametr design aeronaut system describ system digit chip design design abstract machin learn estim perform obtain design carri detail level al describ system call domin ii expert system switch strategi numer optim effort directli problem unevalu point address articl simul anneal press al genet algorithm goldberg deal tend slower optim tend requir ten practic simul sa ga offer abil perform optim search space larg number local method number local optima larg argu optim gradient multipl random start number local optima search space includ unevalu point powel powel tong al powel skolnick built modul call part engin system tong seek combin abil genet algorithm handl multipl local optima speed numer optim algorithm genet numer expert system decid switch powel test system realist jet engin design problem address issu unevalu point al combin genet algorithm optim combin ga wai test domain aircraft wing ga search space wing configur optim size wing test domain ga search space configur iter ga optim size member ga search configur space optim size configur method search space select address problem multipl local optima ga potenti find smooth subspac search space start directli address issu unevalu point work numer optim aircraft design includ al al al survei applic genet algorithm design manufactur aeronaut system survei multidisciplinari aerospac design optim found unevalu point realist engin domain aircraft engin reli legaci code simul design code softwar program gener develop peopl base empir data theoret equat engin reluct chang replac legaci faith code due year comparison code physic experi legaci code tend unevalu make difficult autom design system determin priori paramet valu produc patholog determin simul success simul run simul insid optim order rapidli produc design unevalu point ffl undefin point function aircraft shorter wing design takeoff mass undefin ffl unevalu point due limit simul point perfectli good limit evalu fall unevalu bad point design comput number indic bad airplan larg angl attack order plane larg takeoff mass simul model drag result larg angl accur comput takeoff takeoff mass larg point unknown qualiti unevalu simul idea design good bad simul requir solut set equat solut numer root find numer root finder find solut design root solver unabl find solut classifi unevalu point simul legaci bug crash infinit loop design softwar wrapper legaci code detect code crash run longer amount classifi design unevalu point unevalu point distinguish point point repres design violat explicit nonlinear inequ unevalu point object constraint function simul crash rule compon gradient comput method evalu current point produc chang design paramet minu ffi small step size method store point outer point compar middl outer point compar middl basic rule edg forward differ basic rule central differ basic rule central differ basic rule figur flowchart rule determin comput partial deriv point knowledg base ffi compon gradient method comput partial deriv point comput partial deriv point return partial deriv option base set rule list pictur illustr set point rule circl repres evalu repres unevalu point pictur base assumpt optim minim object function basic rule point outer point middl outer point middl central differ formula rule produc accur partial deriv point outer point middl return partial deriv rule prevent optim back vicin optimum basic rule outer point middl comput partial deriv appli forward differ formula evalu point rule produc accur deriv presenc unevalu point produc gradient point unevalu region ffi import deriv comput finit differ press al experi converg studi select ffi compon gradient edg outer point middl return partial deriv current point edg unevalu partial comput forward differ evalu gradient point unevalu region return partial deriv comput gradient point unevalu rule optim trace edg evalu region move ax basic rule outer point return partial deriv rule optim move narrow evalu region move ax basic rule point outer point middl central differ formula point opposit local optimum point maxim bad type point occur optim rule summar flowchart figur rule affect gradient current point point encount line search evalu gradient comput optim line search line search attempt full newton step minim quadrat approxim nonlinear program problem full newton step result point evalu current line search smaller step continu smaller find step size result point evalu current point point current optim algorithm back comput gradient optim evalu point point found risk optim return point simul evalu figur superson transport aircraft design system aircraft design pursu investig domain conceptu design superson transport aircraft smith figur show diagram typic airplan automat design softwar system fly mission shown tabl figur show block diagram autom conceptu design system design system major design associ search space candid associ da evalu qualiti candid design optim attempt find good aircraft conceptu design mission vari major aircraft paramet wing aspect engin numer optim algorithm optim evalu candid design multidisciplinari simul current call simul multidisciplinari code evalu aircraft engin includ altitud durat phase mach ft comment superson passeng tabl mission specif aircraft figur search manag search manag random start point gener random start point gener evalu design constraint evalu design constraint model constraint evalu model constraint evalu evalu object function evalu object function constrain nonlinear numer optim constrain nonlinear numer optim weight aerodynam mission analysi gradient comput associ design associ multidisciplinari aircraft simul figur autom design system block diagram optim goal minim takeoff mass measur merit commonli aircraft industri conceptu design stage takeoff mass sum fuel rough approxim oper cost rough approxim cost build aircraft simul comput takeoff mass aircraft design mission comput mass histor data estim weight aircraft function design paramet passeng capac requir mission comput land mass final sum fuel reserv mass comput takeoff mass numer solv ordinari differenti equat dm dt rate mass aircraft equal rate fuel turn function current mass aircraft current time mission time simul aerodynam model comput current simul model comput fuel consumpt requir gener thrust current drag complet mission simul requir cpu time dec alpha desktop workstat note procedur applic techniqu simul stochast element discuss section search procedur articl focu search space candid design numer optim method vari set continu paramet minim nonlinear object function subject set nonlinear equal inequ constraint numer optim experi articl lawrenc al implement sequenti quadrat program method sequenti quadrat program method solv nonlinear constrain optim problem fit sequenc quadrat program problem solv problem quadrat program method start point violat optim minim maximum constraint violat maxim object multipli minim earlier optim domain optim found obtain result quadrat program problem consist quadrat object function set linear constraint optim continu feasibl point satisfi found main minim object constraint satisfi search space multipl local techniqu call attempt find global optimum random engin box believ reason design system randomli gener start point uniform distribut box find evalu point perform optim point design found optim global optimum model constraint present techniqu call model constraint deal unevalu point al unevalu point design violat model assumpt made design simul approach implement set model constraint function measur model assumpt pass model constraint optim exist design constraint result unevalu point replac greatli improv optim perform case suffici understand limit simul implement model constraint describ limit captur limit model unevalu point handl gradient found gradient model constraint produc greater optim perform design lower cpu model constraint gradient situat feasibl implement model constraint result made gradient result improv optim perform cpu cost probabl design box depend knowledg engin box excess optim process unreason amount time find global optimum box true global optimum miss appar global optimum produc search procedur edg indic box small randomli gener call design meaningless limit simul recal point violat explicit constraint section descript optim handl point design paramet low high engin size wing area ft ft wing aspect ratio taper length effect structur thick chord wing sweep design mach angl wing taper ratio fuel width tabl subset design space explor rule domain hurt perform domain gradient model constraint produc optim perform cpu time obtain design gradient model constraint set rule perform design goal domain gradient method heurist method appli simul arbitrari mathemat prove work reli empir test primari set test design space optim vari aircraft conceptu design paramet continu rang engin size wing area wing aspect ratio taper length effect structur thick chord measur wing wing sweep design mach angl measur wing wing taper ratio tip chord divid wing root fuel width amount space left chose paramet independ chang paramet result chang optim method work variabl independ design engin size wing area ft wing aspect ratio taper length effect structur thick chord wing sweep design mach angl wing taper ratio fuel width object takeoff mass kg tabl design found mission tabl design paramet depend chang variabl result variabl affect object takeoff design paramet independ optim tabl show subset explor design space defin design paramet compar optim ffl plain unevalu point replac standard bad pass gradient comput gradient standard formula ffl strategi handl unevalu point gradient comput method articl ffl model strategi replac unevalu point model constraint strategi al ffl gradient model strategi replac unevalu point gradient handl remain unevalu point system randomli chose point found evalu point point start point design optim find optim aircraft design mission shown tabl requir start point evalu happen start unevalu compon gradient optim termin model point encount ran optim ran disk space unevalu violat underli assumpt simul fail model point encount suggest model constraint captur underli assumpt simul design found mission experi shown tabl diagram aircraft figur perform strategi combin shown graph figur graph show estim cost strategi chanc fraction optimum horizont axi show takeoff mass found divid takeoff mass design believ global optimum method found appar global optimum vertic axi show estim number simul chanc obtain close optimum comput multipli averag cost optim time desir success desir desir probabl fraction global optimum success probabl singl optim fraction global optimum estim fraction optim fraction global data figur strategi combin gradient model constraint order magnitud cpu support model optim fail optimum model optim appar global time long probabl test hypothesi rule perform design repeat experi goal goal design aircraft mission shown tabl tabl show paramet design differ optim design previou mission perform set experi data figur strategi combin gradient model constraint strategi appar global optimum strategi order magnitud consist hypothesi certainti global optimum find global optimum arbitrari nonlinear function undecid perform optim random start larg number converg point call point appar global deriv success probabl singl optim find global success probabl optim find global success probabl optim find global optimum find cost desir desir probabl find global solv desir success desir success final multipli averag cost optim comput necessarili calcul round nearest integ cost close optimum gradient model figur perform strategi optim perform move left appar global cost shown estim number simul chanc fraction optimum altitud durat phase mach ft comment superson passeng tabl mission specif design engin size wing area ft wing aspect ratio taper length effect structur thick chord wing sweep design mach angl wing taper ratio fuel width object takeoff mass kg tabl design found mission rule success start cost opt cost est cost basic rule basic rule edg rule basic rule rule tabl optim perform subset gradient mission rule success start cost opt cost est cost basic rule basic rule edg rule basic rule rule tabl optim perform subset gradient mission cost close optimum gradient model figur perform strategi mission optim perform move left cost shown estim number simul chanc fraction optimum rule list section make search space edg rule rule depend characterist search space test hypothesi rule set depend test util rule aircraft domain model rule list section rule ad individu tabl tabl show result mission subset show number optim point global number simul find evalu start point random number simul estim number simul obtain chanc global optimum ad edg rule lower cost find optimum mission ad rule hurt optim perform slightli domain edg rule intend improv optim perform case unevalu point exist larg unevalu region aircraft design edg rule improv optim perform domain domain unevalu point exist scatter expect edg rule optim expect hurt optim perform slightli domain scatter patch unevalu larg unevalu disabl edg rule scatter patch unevalu point occur simul stochast element missil inlet patch unevalu larg unevalu region found edg rule domain rule search space optimum deriv discontinu optimum domain found optimum properti penalti meter rule appar aircraft hurt perform consist hypothesi good idea includ rule search space properti knew distribut unevalu point aircraft design search space search space toolkit al determin distribut unevalu point search space aircraft design search space extrem difficult visual shape entir valid visual space determin unevalu point occur larg unevalu region describ shape valid path optim space visual tool shape evalu insight gain visual implement addit model constraint captur unevalu point space aircraft design difficult understand properti gradient engin unevalu point distribut search tool visual search simpli produc good optim perform varieti distribut unevalu point domain found gradient result good optim perform design domain domain includ design race al al al design exhaust superson jet al design inlet jet al shukla al shukla al design inlet superson missil al al domain simul simul simul inlet comput fluid dynam code solv hour cpu time singl simul prohibit costli perform extens comparison optim strategi simul preliminari result demonstr gradient domain superson missil inlet design domain design paramet cpu time evalu design dec alpha analysi code call aerodynam model supplement empir data model constraint point encount optim unevalu test util ran optim gradient optim perform shown figur gradient optim closer significantli lower support hypothesi compar optim perform gradient domain superson missil inlet domain report strongli suggest gradient perform optim simul domain inlet cpu time optim gradient knew domain unevalu point confid gradient high decid run optim gradient obtain good optim result domain case inlet publish aerodynam engin literatur shukla al result good test belief futur experi perform global optimum fairli larg local optim method cost close optimum figur perform gradient missil inlet domain optim perform move left cost shown estim number simul chanc fraction optimum sequenti quadrat program give high confid find global optimum start small number random start assum unevalu point handl properli domain properti fail global optim method simul anneal genet algorithm prefer method gradient shown gradient produc optim perform cpu time obtain design optim simul unevalu point perform enhanc ad addit rule preliminari result show ad addit rule point violat model constraint gradient comput greatli improv optim perform domain superson jet engin exhaust design point violat assumpt made author simul fail produc result point violat model constraint tend valu object function gradient accur comput avoid point model constraint simul extrapol tabl data design requir simul model constraint indic result inaccur rule optim comput gradient point requir rule requir rule develop numer optim complex engin design offer rapidli produc design method gener assum object function constraint function defin realist simul tend violat assumpt present techniqu intellig comput gradient presenc patholog show gradient comput method part numer optim system implement test gradient realist design domain result show gradient cost design space search order magnitud acknowledg aircraft design gene invalu assist research member tom keith don smith ron alex nist review manuscript research partial support nasa grant part project support advanc research project agenc depart contract mark support nation research council postdoctor research portion time work articl disclaim approv commerci product nation institut standard technolog intend impli commerci materi identifi report order facilit understand identif impli recommend nation institut standard impli materi equip identifi necessarili refer al applic artifici intellig technolog aeronaut system design aircraft design system oper septemb aiaa paper al current applic genet algorithm aeronaut system sixth annual aerospac applic artif intellig octob al intellig model select hillclimb search design eleventh nation confer artifici page mit ma forbu kenneth forbu brian integr qualit quantit knowledg eighth nation confer artifici page forbu kenneth forbu brian scale larg model tenth nation confer artifici san forbu kenneth forbu brian scale compil fourteenth joint confer artifici page mit press al genet algorithm topolog design aiaa approach optim aerospac conceptu design phd stanford smith andrew don smith comput environ exhaust design journal al andrew doyl song mark simul redesign nasa inlet joint san juli al search space support al andrew mark don smith model knowledg guid design space search js gero artifici intellig design page kluwer academ andrew intellig autom qualiti control comput simul artifici intellig engin analysi manufactur novemb goldberg david goldberg genet algorithm machin learn statist machin learn cognit select nonlinear program algorithm engin design optim advanc design al steve robert peter ian multidisciplinari optim method aircraft preliminari design symposium multidisciplinari analysi septemb aiaa paper lawrenc al user guid version code solv constrain nonlinear optim gener iter satisfi inequ constraint technic report institut system colleg august al simmon domin control iter redesign nation confer artifici page st mit ma powel skolnick powel skolnick genet algorithm engin design optim constraint intern confer genet page univeristi illinoi juli morgan lo ca powel powel hybrid approach engin design optim phd renssela polytechn institut depart comput decemb press al vetterl numer recip cambridg al learn rule iter design tenth ieee confer artifici intellig page san al richter learn reformul numer optim engin design js gero artifici intellig design page kluwer academ mark artifici intellig improv numer optim complex engin design technic report depart comput rutger octob phd thesi shukla al vijai andrew mark donald doyl knight autom redesign nasa inlet numer optim aiaa joint shukla al vijai andrew mark donald doyl knight autom design optim inlet aiaa journal march raphael multidisciplinari aerospac design survei recent develop aiaa aerospac scienc meet januari aiaa paper al structur optim multilevel decomposit aiaa novemb tong al siu david goel integr artifici intellig numer optim techniqu design complex aerospac system aerospac design februari aiaa paper tong tong coupl symbol manipul numer simul complex engin design intern associ mathemat comput simul confer expert system numer purdu west al haa high perform superson missil inlet design autom optim multidisciplinari analysi optim septemb aiaa paper al haa high perform superson missil inlet design autom optim aiaa journal novemb
DB/146 3 copi approach tabl bart demoen sagona report cw april katholiek universiteit leuven depart comput scienc copi approach tabl bart demoen sagona report cw april depart comput kuleuven abstract implement tabl freez wam implement techniqu small execut easi implement top exist prolog system approach implement copi approach tabl cat absolut normal prolog execut introduc exist prolog system orthogon implement cat start xsb ad result show practic program cat slightli outperform give detail account addit made wam implement adopt cat show case cat perform arbitrarili hand present empir evid cat competit faster discuss issu relat memori manag impact schedul strategi copi approach tabl bart demoen sagona depart comput scienc katholiek universiteit leuven belgium abstract implement tabl freez wam implement techniqu small execut easi implement top exist prolog system approach implement copi approach tabl cat absolut normal prolog execut introduc exist prolog system orthogon implement cat start xsb ad result show practic program cat slightli outperform give detail account addit made wam implement adopt cat show case cat perform arbitrarili hand present empir evid cat competit faster discuss issu relat memori manag impact schedul strategi introduct tabl logic program proven wide rang applic area deduct program analysi base abstract recent verif model check practic implement tabl found xsb gener prolog system tabl tabl space xsb organ tabl access mechan substitut factor xsb implement schedul strategi concern aspect control orthogon suspend resum main issu tabl call gener answer call consum answer gener depend gener consum work readili wam implement prolog execut queri small program exemplifi situat tabl subscript denot occurr subgoal gener consum queri answer gener consum answer tabl fill moment consum answer execut state select wam backtrack remov part state answer gener state preserv abstract machin preserv consum state freez backtrack reclaim space stack wam implement mean extra set freez freez regist local trail choic point stack trail record valu consum manag control freez slow execut relat overhead smaller peopl assum emul show paper complet avoid adopt cat freez complic easi put exist prolog fact main reason logic program system gener offer tabl cat save dai tabl ad wam implement orthogon freez consum imagin state abstract machin save separ memori execut fail consum revert save copi feed consum answer good solut copi wam state unnecessari show lead unnecessari recomput execut queri program show tabl state abstract machin moment choic point altern exhaust time gener answer case consum altern repres arbitrari amount comput select copi wam state cat copi select execut state belong consum copi cat requir addit form instruct altern predic choic point tabl subgoal cat differ slightli usual wam choic point visibl execut unlik complic trail cat introduct tabl wam implement perform overhead cat attract approach incorpor tabl lp implement introduct tabl terminolog set section introduc tabl program transform explain cat step step situat complex section addit wam introduc memori manag discuss section discuss worst case behaviour cat remedi section discuss detail cat implement relat cat section compar perform cat context xsb end overview relat futur work assum wam model environ choic point stack separ xsb sicstu prolog combin origin wam assum stack grow higher stack mean lower mean younger tabl basic concept terminolog due space present concept terminolog tabl evalu make paper assum usual terminolog logic program refer reader issu relat slg resolut detail descript due space limit restrict definit program present inform formal treatment notion basic overview tabl tabl program program augment tabl declar tabl predic symbol integ declar ensur queri predic ariti execut tabl evalu slg predic implicitli assum case sld resolut queri predic slightli speak tabl subgoal tabl predic slg resolut tabl subgoal variant ident variabl note orthogon issu design cat tabl subgoal encount evalu queri program persist store global data structur call subgoal tabl tabl check made exist subgoal tabl slg subgoal oper term enter tabl program resolut deriv answer answer set deriv answer record global data structur call answer tabl note correspond gener answer tabl variant exist resolv answer answer tabl call subgoal consum answer fed consum time answer return oper basic concept tabl evalu complet subgoal answer tabl subgoal answer call complet answer deriv slightli oper slg complet oper subgoal determin complet program answer resolut perform subgoal exist depend case subgoal determin complet individu depend account suggest subgoal depend graph dg examin set mutual depend subgoal complet involv strongli connect compon dg independ subgoal depend subgoal subgoal evalu reach fixpoint stop implement tabl exampl introduct tabl implement pure search due fact gener consumpt answer asynchron process mean abstract machin tabl maintain reconstruct execut environ consum consum answer gener consum retain fixpoint complet gener newli deriv answer queu resolv subgoal necessarili correspond current execut environ offer implement featur suspend resum consum implement tabl suspend consum exhaust answer tabl resum answer deriv perform creat consum choic point repres suspend freez stack set freez regist point current fail previou choic point reclaim stack freez regist reset space reclaim freez regist complet gener restor wam regist valu save consum choic address valu save forward trail restor variabl bind path suspend answer return restor consum execut continu forward continu restor comput freez execut state consum retain consumpt answer interact consum answer subgoal determin consum suspend execut environ answer gener consum complet subgoal complet tabl optim freez consum backtrack answer tabl program store fact schedul increment complet schedul strategi determin answer return slg schedul strategi perform xsb implement schedul strategi call batch local evalu base partit subgoal encount evalu schedul compon partit interact influenc complet examin schedul complet definit complet postpon till end evalu reclaim space effect larg program fine increment complet effici perform increment area memori complet stack complet stack restrict choic point stack choic point gener effici track depend subgoal schedul compon complet stack subgoal older gener subgoal subgoal depend subgoal call leader schedul compon subgoal newer exhaust program check complet leader depend subgoal higher stack consum subgoal consum subgoal complet space correspond subgoal compon reclaim leader higher complet stack depend subgoal higher complet execut backtrack previou altern reclaim space main idea implement increment complet batch local schedul answer return oper base limit subgoal compon top complet stack explain call schedul compon leader topmost compon check answer return consum subgoal schedul answer return oper unresolv answer exist consum call fixpoint check independ gener schedul consum perform program resolut check complet schedul consum fail back leader schedul strategi determin fixpoint pure design import mind consum subgoal schedul compon resum execut fail back leader end review section point overhead introduct freez regist incur small overhead place choic point comparison regist choic point freez regist similarli trail alloc environ check bind condit complic normal execut introduct forward trail bind space wam time creat emul overhead order bigger nativ code implement tabl explain transform start point plain wam implement prolog assum reader instanc compil compil tabl predic easili explain sourc sourc transform show principl sourc sourc transform ad advantag show implement add seri predic exist implement defin tabl bodi bodi bodi transform exist variant instal consum cat fail instal gener fail save tabl bodi save tabl bodi save tabl bodi complet check call classifi gener consum explain section function exist variant check tabl gener goal immateri discuss gener complet exist variant subgoal consum current choic point cut prevent consum execut predic replac consum choic action freez cat save consum state exist variant correspond subgoal oper section instal consum instal consum choic data structur wam choic point extra denot track answer consum altern field choic point point instruct return section basic consum answer remov choic point fail cat cat altern freez consum state point remain vagu cat main idea copi consum action consum remov execut altern consum consum answer tabl choic altern belong schedul strategi orthogon cat split action instal consum cat save explanatori instal gener decid invoc predic execut exist choic point updat reflect fact usual wam choic inform pointer tabl answer put pointer pick save tabl bookkeep field relat complet save tabl goal ad goal origin tabl pick inform gener gener choic place tabl put newli produc inform store newli introduc variabl resid environ end answer comput deriv answer answer answer put answer tabl subgoal comput proce argument answer point answer save tabl info save environ complet check tabl complet case gener choic point schedul consum consum schedul consum cat restor save consum action check complet slightli complic gener depend cat situat dealt detail section import understand check execut gener relat item section complet fixpoint check step step introduct cat increment complet section make approxim increment complet schedul compon singl leader run schedul consum subgoal fail back set execut moment consum consum choic point instal choic point figur show gener choic point consum choic point vertic dot choic point denot prolog choic relat execut tabl predic heap shown segment tabl choic point trail segment shown local spaghetti stack pointer point cell older segment cell address valu cell ff fi local stack heap trail figur stack creation consum choic shade part copi figur show inform save frame fix size cat header bookkeep pointer area copi shade part heap local shade area figur copi correspond part heap local stack creat creation consum choic point cat save consum choic justif moment schedul consum prolog choic point gener choic point exhaust redund mean consum choic point happen immedi leader cat copi trail cat copi heap save trail entri point region similarli trail entri point save part local stack save trail entri point older region heap local backtrack undon bind cell ff mean cat save gener current heap local cell older point trail entri younger figur show detail save trail call cat header save cat area book select trail copi copi shade heap copi consum copi shade local stack figur cat area show select trail cat copi consum remov consum choic point stack activ gener failur wam forward execut creat consum cat execut eventu fail back leader exhaust altern leader make consum subgoal lead consum answer leader save cat area schedul restor consum save portion heap local stack copi back origin place save valu trail save consum choic point copi consum choic point start consum answer tabl minor point answer cat updat field consum choic point cat area note choic point trail stack gener smaller moment save consum state figur section refin save consum laid basic understand state consum save copi copi consist part heap local stack consum gener similarli trail choic point cat consum choic point ad increment complet base fix leader previou assum complet subgoal belong schedul compon led singl leader mention section definit valid scheme cat schedul complet postpon till end evalu effici perform increment complet schedul compon small local stack heap trail figur stack consum restor cat copi smaller part subgoal complet free cat area consum earlier execut tabl answer depend answer gener leader form schedul compon mean moment leader subgoal consum schedul fail back gener order state copi stack leader figur show variant figur consum leader shade area copi smaller schema practic assum fix leader schedul compon local stack heap trail figur leader closer copi smaller leader principl previou section save consum state leader gener schedul consum case fix leader work chang practic chang leader queri execut program show tabl fail consum leader maintain depend complet gener answer depend answer moment consum gener longer leader schedul compon leader mean futur restor save state restor time part stack eagerli moment save miss part add cat area altern wait execut backtrack gener cat save increment part stack link cat area advantag wait moment save consum extens cat part stack potenti share copi part clear section increment copi consum state previou section show absenc inform leader schedul possibl extend save state leader differ extra tabl fail consum index refer moment consum copi leader consum happen mean copi leader backtrack gener copi part link consum note part stack copi inform stack part difficult avoid schema copi consum state current leader mechan link part save systemat save consum state cat save closest gener execut fail back consum younger copi inform schedul consum answer leader schedul reach complet occur space cat area freed explain section backtrack gener increment previou gener link consum appli mean doubl copi happen anymor figur rough pictur situat increment save consum final implement perform copi share consum state cat flexibl schedul strategi schedul context figur share cat area consum natur gener schedul consum save state reach manag cat area section cat header area consum state alloc dynam reli librari function interest point free alloc area leader mean consum younger leader discard gener access consum state save leader free easili cat area consum partli restor consum state execut tabl cat area share portion comput portion moment produc answer consum answer time schedul restor made difficult account restor doesnt copi back implement restor consum state stack natur judg perform lack cat major problem main problem cat remedi tabl queri produc answer consum save restor comput produc larg term output argument set consum state larg copi save copi restor consum cat area consum arbitrarili mean save restor consum arbitrarili long suffer freez stack constant time oper cost restor consum relat trail easi construct exampl consum restor arbitrarili cat made perform arbitrarili bad behaviour cat observ program tabl larg term continu mean copi save consum unnecessari gener heap entri unreach continu save mean save consum small garbag garbag collect restrict part heap copi explor detail show similar compact local stack perform cat save time implement relat implement cat xsb implement freez stack mean save consum state mean xsb complic trail set cat prefer heat remov freez relat code replac plain wam warm version implement xsb relat implement increment complet access store mechan tabl ad increment cat copi restor section slightli modifi schedul explain instruct relat tabl answer belong chang exist version implement implement cat form basi comparison cat exist implement henceforth refer mechan implement current similar differ version cat retain increment complet algorithm definit complet postpon space freez stack select complet space subgoal fragment stack requir stack compact complet compon younger gener adopt complet algorithm base approxim subgoal depend algorithm trap subgoal schedul compon arbitrarili postpon complet fact independ subgoal true flexibl memori area requir compact space bad figur read tabl due section separ alloc exist cat plan add exact complet algorithm paper decid compar cat complet algorithm unlik cat reclaim trail choic point stack complet compon reclaim gener choic point exhaust program resolut mean substitut factor variabl optim store choic point stack place surviv backtrack opt heap small technic gener reclaim local schedul implement creat cat area gener leader accord definit local evalu specifi gener behav consum explain section cat flexibl schedul current version perform schedul fail leader manner similar fixpoint check differ schedul cat cat consum schedul consum pass perform evalu cat perform prolog measur cat indistinguish perform artifici tabl benchmark program commun transit closur cycl tree length gener cylind compar cat realist set program applic area tabl proven worth gener logic program abstract interpret measur conduct ultra sparc solari time report space kbyte space number measur maximum stack total max stack max cat area benchmark set domin tabl execut program perform type analysi program abstract execut abstract program tabl evalu tabl termin effici storag analysi benefici perform analysi tabl abstract oper avoid redund except util predic predic tabl benchmark set size tabl space set benchmark program heavili domin tabl oper tabl show time space perform analysi schedul strategi xsb set perform batch local strategi advantag local strategi space consumpt schedul compon tighter cat local schedul perform similarli time slightli except cat perform space wise due high share cat area cat batch schedul slower benchmark benchmark cat reclaim big part heap local stack retain cat area cs cs gabriel pg read tabl time perform cat schedul strategi time space behaviour due approxim complet algorithm benchmark high percentag tabl specif abstract produc answer complet base approxim subgoal subgoal trap approxim schedul compon complet answer deriv consum suspend creat cat complet tabl section extra measur read program shed batch schedul consum save cat area time consum restor consum number local schedul consum save restor kbyte bigger restor due share save space increment section current approxim complet batch cs cs gabriel pg read tabl space perform cat schedul strategi cat perform strongli benchmark set cat competit batch complet base exact subgoal depend section realist mix tabl prolog execut experi tabl select compon realist case abstract interpret benefit cach abstract oper depend redund comput case set benchmark abstract oper implement prolog high percentag total execut time program perform program analysi base complex abstract domain captur share contrari analysi previou analysi base abstract upper bound lub delet local schedul perform order magnitud batch strategi benchmark set issu local schedul make program set tabl compar cat time space cat perform slightli space except read color bid deriv read serial boyer plan cat tabl time perform cat color bid deriv read serial boyer plan cat tabl space perform cat relat work analog implement muse implement tabl cat complic manag stack switch worker analogu suspend consum resum trail structur complic wam bind undon cat avoid complic stack copi portion stack consum case muse worker analog consciou influenc knowledg muse idea cat note overhead copi small compar work perform experi cat confirm copi techniqu similar cat abstract interpret framework order obtain continu program point abstract machin abstract interpret design inspir achiev make copi current state includ continu consum state save increment similar cat implement prolog interpret abstract machin main differ cat cat share save state consum differ cat inherit depend detect dynam approxim depend gener consum make abstract interpret consequ static approxim save state consum descend gener consum share part save state natur awar techniqu provid librari function backtrack increment copi part activ failur achiev chang return address activ analogu cat zone copi delimit invoc tabl compil special chang perform effect compil time similar method cat tame prolog spaghetti stack choic strict stack cat tame doubl spaghetti stack choic gener prolog spaghetti stack copi futur work logic program system benefit introduc tabl logic program system offer possibl complic slow underli implement cat remedi cat simpler add exist system influenc effici underli implement achiev goal tabl gener cat access lp line work clear definit interfac tabl compon gener prolog system form librari function requir give account manag subgoal complet tabl naiv implement save restor code tabl instruct answer complet integr cat memori manag prolog system mean practic stack garbag collect adapt cater save consum principl freez turn reason data reachabl easier cat frozen local memori manag wam base prolog forthcom paper deal detail perform result section show interact cat schedul strategi investig cat perform local work batch evalu implement cat cat separ cleanli underli wam control relat cat good environ experi schedul relat approxim scc variat principl gener exhaust altern schedul consum shown cat true altern implement control cat overhead execut gener logic program system good effect user program emploi tabl count full speed underli prolog machin part comput cat introduc orthogon exist cat make attract exist lp nativ code gener prolog system mercuri incorpor basic speed system corrobor introduc tabl cat implement control compon tabl data structur schedul orthogon issu affect underli implement cat reason reachabl object execut tree easili flexibl schedul strategi empir test show benchmark program slow cat techniqu compar implement xsb local evalu memori consumpt simplic cat kei perform acknowledg author support ku leuven junior scientist fellowship refer warren abstract tutori reconstruct mit ali muse approach prolog intern journal parallel apr chen warren tabl evalu delai gener logic program journal jan sagona program analysi languag xsb springer intern journal softwar tool technolog demoen sagona memori manag prolog tabl technic report cw ku apr submit public warren improv tabl altern schedul strategi journal function logic blueprint abstract machin abstract interpret logic program intern logic program page dec mit press janssen sagona tabl abstract experi abstract equat system tabul page apr compil nondeterminist comput technic report warren effici tabl mechan logic program intern confer logic page june mit press extend version journal logic program sagona swift abstract machin tabl execut stratifi logic program acm transact program languag warren xsb effici deduct engin acm sigmod intern confer manag page acm press warren sri model execut prolog abstract design implement issu symposium logic page san sept ieee comput scienc press warren effici prolog memori manag flexibl control strategi symposium logic page atlant feb ieee comput scienc press
Agents/147 1 research council canada institut inform technolog nation de recherch canada institut de de manag system atm network yang phan juli ieee intern confer network franc juli nrc copyright nation research council canada permiss grant quot short excerpt reproduc figur tabl provid sourc materi fulli acknowledg manag system atm network yang phan nation research council canada abstract report paper develop manag system atm network pm path manag solut requir manag complex atm network aim assist network oper perform oper simplifi procedur automat optimum rout select aim provid effect support fault identif prevent network oper introduct atm commun network plai import role telecommun network wide backbon transmiss access network emerg larg heterogen atm network challeng research develop area network manag manag atm commun network dramat size virtual manag consid import task task consist includ path path upgrad path fault fault fault qo servic manag exist cot softwar compon provid atm switch vendor provid partial support oper perform procedur oper dispar difficulti oper perform automat oper manag assist oper perform automat oper manag complex heterogen atm develop manag system atm network base proactiv framework framework gener framework facilit incorpor technolog develop network manag system develop environ solari platform microsoft peer nt platform pm offer simpl mechan set perman virtual path connect perman virtual channel connect user interfac establish automat manual requir qo paramet throughput delai monitor maintain manag perform traffic data fundament alarm incid associ pm detect problem futur perform correct prevent automat feasibl situat automat action pm notifi network oper detail inform natur locat reason procedur correct prevent develop pm atm network manag tool servic provid network oper effect manag network provid good qualiti improv network perform reduc loss research develop main oper support automat optimum rout select fault identif prevent pm system architectur implement oper manag present paper section discuss system section describ oper section experi final section conclud paper system architectur pm develop base architectur architectur accommod exist manag protocol standard corba underli distribut middlewar vp oper support idl devic applic vp monitor agent fault agent snmp servic agent devic decisionmak devic configur agent perform agent corba bu corba bu commun agent dmi devic figur architectur view tier servic tier data tier kei characterist architectur separ distribut comput environ data compon build maintain applic corba chosen distribut middlewar stabl standard matur product object request broker invok method remot object necessarili locat exact function corba client manag distribut devic explicit knowledg topolog network shown top tier view layer middl tier servic layer bottom tier data layer develop tier implement view tier tier made user interfac applic applic invok method object middl locat locat platform pm view tier user graphic interfac oper access control atm network remot locat browser download applic consist user oper network network element statu support fault knowledg base updat servic tier servic agent main servic agent configur fault perform agent monitor agent perform monitor manag task includ fundament function recommend osi provid servic request view tier applic agent distribut locat design support corba idl commun agent perform oper manag simplifi oper automat optimum path fault identif fault predict automat fault correct prevent data tier tier made object interact manag system pm develop manag atm network equip tier made commun protocol object dmi commun agent perform interact oper devic agent cope request servic agent devic agent viewpoint map protocol data object idl data object deliv servic agent detail map data idl protocol report paper oper manag goal pm assist network oper perform oper simplifi procedur automat path rout provid effect support fault identif prevent describ briefli fault fault prevent oper oper configur princip manag task atm network dispar proprietari manag procedur provid individu atm switch vendor creat environ difficult autom process situat increasingli futur network continu develop intricaci volatil solv boyer al configur intellig mobil agent approach requir atm switch provid environ run mobil agent network exist atm switch provid snmp support remot access distribut agent access atm switch sequenti send request switch request corba client idl data packag servic configur agent determin oper sequenc pack oper scenario pass agent oper agent determin action command perform oper support commun protocol methodolog shown system perform delet creation set path set atm switch atm upgrad rout path negoti paramet exist delet path set atm switch atm network oper pm snmp request snmp request idl request idl switch switch switch figur methodolog oper object provid oper oper goal provid simplifi procedur assist oper perform oper oper worri switch oper locat node connect switch procedur oper hidden system goal assist oper perform oper support automat path rout path select oper determin path rout thousand paramet network topolog reason determin path rout select optim path request path oper detail automat rout select path report paper due space limit fault identif fault identif prevent main manag task pm reduc human error misunderstand process fault approach consid effect approach number achiev appli approach alarm correl alarm correl system reduc amount detect problem viewpoint manag oper make fault identif fault prevent oper make fault correct prevent assist oper effect manag develop system identifi problem make fault correct system implement knowledg base consist pm system gener manag atm specif knowledg shown fig pc po defin fault problem stand path hardwar path softwar path path incid set defin problem fault identif main infer data fault fault fault correct data collect fault disord occur hardwar softwar manag atm network traffic densiti path rout alarm event extern manifest fault alarm event defin atm vendor gener atm equip observ network oper alarm event import data collect alarm event detect problem order effect detect path congest path collect traffic data monitor reason traffic data alarm event lost real time manag system notif collect alarm event manag atm switch traffic data monitor fault detect task fault detect find symptom problem identif collect alarm event traffic data definit fault detect gener incid fundament alarm correl traffic data associ incid open incid set problem descript alarm traffic data analysi incid associ dm collect data traffic data analysi alarm incid incid detect incid associ conflict figur fault identif knowledg isol alarm correl network manag alarm correl aid oper network fault reduc amount alarm reduc amount fundament alarm correl gener incid incid associ fundament mechan alarm correl tempor boolean relat traffic data analysi task traffic data analysi collect traffic data gener incid traffic data analysi detect congest overload problem monitor bandwidth manag bandwidth obtain collect traffic data bandwidth time close base fault ph ps correct decisionmak support automat oper greater bandwidth incid formul attribut time stamp locat assign group equip current statu set congest sever assign open incid incid associ incid associ task incid associ open incid set problem term gener incid alarm correl traffic data analysi system classifi group obtain incid incid set map incid set monitor fault isol incid set open fault confirm problem task fault isol isol problem open incid set incid confirm support mean loop test assumpt monitor problem time fault correct fault correct determin effect reactiv action identifi problem task fault correct strategi problem correct give support inform assist oper fault prevent order prevent fault provid proactiv manag predict futur statu manag atm network dynam network adopt neural network approach predict futur statu histor data current statu reflect dynam chang atm configur data includ neural network train input paramet train design neural network path nn compon predict futur statu monitor path predict fault detect procedur detect futur problem problem proactiv control action prevent problem detail fault prevent refer refer experi test prototyp system evalu effect support capabl fault identif built experi network consist atm network simul small real atm network commun protocol pm atm network simul corba pm real atm network snmp atm network simul gener raw alarm event raw traffic data term standard specif alarm event gener simul network problem traffic data gener term qo paramet manag simul network problem real atm network set fore system switch atm adapt instal sun workstat set sun workstat atm switch hard test effect support capabl fault identif prevent base prototyp manag system atm network incorpor corba technolog pm provid effect support network oper path manag automat rout simplifi oper fault identif proactiv fault predict prevent futur enhanc knowledg base manag focu automat fault correct prevent servic manag refer yang identif prevent manag atm atm june pp gabriel robert mark expert system shell telecommun network alarm ieee network manag control pp gabriel mark ieee novemb pp robert gardner david alarm correl network fault resolut kohonen ieee nov pp expert system fault diagnosi italian telecommun integr network pp edward network diagnost expert system multiplex base gener network diagnost integr network pp elliot expert system diagnosi advanc digit subscrib pp atm network architectur base virtual ieee transact vol pp yu watanab dynam rout scheme intern ieee commun vol pp inter domain symposium integr network pp john bernard toni configur heterogen atm environ intellig mobil st intern workshop mobil agent telecommun oct pp
ML/148 6 effici boost algorithm combin prefer yoav freund lab raj iyer mit laboratori comput scienc robert schapir lab yoram singer lab abstract problem combin prefer combin result search engin work describ effici algorithm combin multipl prefer give formal framework problem describ analyz boost algorithm combin prefer call describ effici implement algorithm restrict case discuss experi carri assess perform algorithm combin www search queri domain compar perform individu search strategi experi task make movi recommend present result compar regress algorithm introduct call problem seek recommend movi enjoi system alic rank movi system examin rank movi provid viewer inform return alic list recommend movi recommend system user prefer similar alic combin recommend import properti problem relev inform combin repres rel prefer absolut rate rank movi express assign movi numer ignor absolut valu score concentr rel order distinct import combin rank user complet rang score express ident prefer combin rank model problem problem introduc analyz effici algorithm call combin multipl research conduct visit lab support nsf graduat fellowship ing algorithm base freund schapir adaboost algorithm recent successor develop schapir singer similar boost work combin rank instanc weakli correl target rank attempt approxim show combin weak rank singl highli accur prove bound qualiti final rank term qualiti weak rank movi simpl weak rank partit movi prefer prefer user rank list movi partit prefer movi list partit data advantag depend rel order defin rank absolut rate appar combin perform give theoret analysi qualiti rank produc analyz complex show implement effici discuss improv effici natur case report result test approach problem metasearch problem goal combin rank www search strategi search strategi oper input perform simpl transform queri ad search direct search token send search engin outcom strategi list url answer queri goal combin strategi work set queri problem problem exist larg publicli dataset rate movi peopl compar regress algorithm studi applic evalu measur wide rang applic combin problem receiv attent commun method combin rank tend base method techniqu rank view score problem combin rank reduc numer search set paramet minim dispar combin score feedback user approach work combin system match user prefer view score mean express prefer schapir singer framework manipul combin multipl rank order directli minim number disagr rank construct prefer graph problem reduc combinatori optim problem turn approxim combin rank describ effici algorithm relat problem algorithm present paper similar framework intract problem batch set time find good combin approach complement algorithm constitut viabl approach problem combin multipl experi work practic formal model rank problem describ formal model studi rank set call domain instanc space element call instanc movi instanc learn algorithm model accept input set rank featur fn intend provid base level inform rank task learner job learn rank express term rank similar ordinari featur convent learn set movi rank featur correspond singl viewer past rate movi rank featur function form set consist real addit element oe rank defin incompar real number instanc interpret rank higher oe unrank movi rank simpli numer rate provid movi oe movi rate final input learn algorithm feedback function function encod rel rank inform subset instanc learner approxim produc rank unseen instanc movi feedback consist movi prefer provid current system attempt recommend assum feedback form interpret repres correctli rank larg posit valu rank neg valu prefer consist assum assum transit feedback function movi defin movi prefer movi current opposit movi equal rate gener assum support finit xf denot set feedback instanc occur support xf fx size support learner accept set feedback function fm combin singl function simpli ad greater import weight sum requir learner output rank instanc repres form function similar interpret rank rank higher movi correspond complet order movi ti goal learner produc rank includ observ train movi find rank movi accur predict rank includ movi viewer learn learn system perform unseen data depend number instanc cover train complex rank produc learner method evalu rank discuss section boost algorithm section attempt minim measur call rank loss initi distribut ffl train weak learner distribut ffl weak hypothesi ffl ff ffl exp ff normal factor output final ff figur algorithm boost algorithm rank task describ approach rank problem base machin learn method call freund schapir adaboost algorithm successor develop schapir singer boost method produc highli accur predict rule combin rule moder accur current seek learn algorithm produc function induc order approxim rel order encod feedback function formal neg entri carri addit set posit constant chosen specif rang assum summat pair crucial pair receiv weight boost algorithm design find small weight number pr defin predic hold call quantiti eq rank loss denot algorithm call boost algorithm pseudocod shown figur boost oper round assum access separ procedur call weak learner call produc weak hypothesi maintain distribut pass round weak learner distribut encod rel import weak learner instanc rank weak form provid rank inform manner weak learner experi base rank detail section boost algorithm weak updat distribut shown figur crucial pair rank higher assum moment paramet ff rule effect weight correct rank weight tend concentr pair rel rank hardest determin actual set ff discuss shortli final combin hypothesi weight sum weak prove bound rank loss theorem guidanc ff design weak learner discuss note theorem concern perform train data standard classif loss separ test set theoret bound assumpt theori theorem assum notat figur rank loss unravel updat exp note real rank loss respect initi distribut exp prove theorem note gener requir space time round ff criteria weak learner minim rank round ff construct weak manner minim exp ff method achiev end sketch fix drop subscript clear context time denot initi weak hypothesi shown view function uniqu minimum found numer simpl binari search trivial detail omit method minim applic special case rang minim analyt abbrevi ff simpl verifi minim set ff ln yield weak rang restrict attempt find minim set ff weak rang method base approxim note ff real ff approxim ff ff hand side eq minim ff ln plug eq yield approxim minim weak rang attempt maxim jrj defin eq set ff eq method experi effici implement bipartit feedback describ effici implement feedback special form feedback function bipartit exist disjoint subset rank instanc instanc disjoint subset jx ae ffl train weak learner distribut defin eq ffl weak hypothesi ffl ff ffl exp exp ff exp output final ff figur effici version bipartit feedback pair pair feedback document task common field inform retriev set document judg relev goal find rank document tend rank relev document irrelev document feedback function encod prefer bipartit implement naiv section space requir jx show improv jx jx note xf main idea maintain set weight distribut maintain condit crucial pair pseudocod implement shown figur eq prove induct detail omit lack space note space requir comput jx jx except call weak learner weak learner maxim jrj eq pass weight weak comput linear time omit defin figur rewrit weight comput linear time comput sum equat case pass weight weak learner case full distribut size jx jx weak rank section algorithm requir access weak learner produc weak describ effici implement weak learner rank simplest obviou weak learner find weak hypothesi equal rank featur unrank instanc ae def oe def main problem weak learner depend critic actual valu defin rank reli inform provid learn algorithm form gener applic method featur provid order instanc score inform method issu combin rank featur score semant score assign url search focu section experi weak order inform provid rank ignor specif score inform weak form def oe rand def weak hypothesi deriv rank featur compar score instanc threshold instanc left unrank weak hypothesi assign default score def remaind show threshold default score fix drop subscript simplifi notat rang weak bound method section guid search weak hypothesi recal weak learner seek weak hypothesi maxim jrj eq candid weak comput directli time rank threshold defin rang xf default score jrj maxim time describ time space effici algorithm maxim jrj requir time case bipartit boost algorithm section time begin rewrit defin potenti note depend current distribut weak learner precomput potenti begin boost round time space feedback compar eq defin section comput faster time address problem find good threshold default def scan candid rank featur evalu jrj eq choic def defin eq def fix rank featur oeg set feedback instanc rank jx threshold ff defin behavior feedback instanc straightforwardli comput term eq threshold set time jx simpli scan method chose focu method slightli simpler experi method futur plan top top top top top top avg ml domain domain singl queri tabl comparison combin hypothesi individu search templat list threshold valu maintain partial sum obviou evalu jrj assign def simpli evalu linear number unrank instanc prefer oper depend number rank instanc applic inform rank featur rank small fraction instanc note definit impli hand side equat comput jx time rank total time requir evalu jrj candid weak linear number instanc rank featur evalu report experi rank problem simplifi web metasearch goal build search strategi find homepag research task problem make movi recommend user base prefer previou user divid data train data test ran algorithm train evalu output hypothesi test data detail task present experi learn combin result web search problem exhibit facet requir gener approach approach learn combin similar score applic similar score web search engin unavail order test data schapir singer goal simul problem build search engin test pick fairli narrow class homepag research retriev homepag chose test case partli feedback readili web obtain list identifi affili similar list identifi geograph locat refer entri list pair base queri goal learn strategi base gener rank url includ correct homepag close top schapir singer construct seri search templat domain templat specifi queri method convert base queri altavista queri call expand queri templat form mean altavista search word person word appli base queri research templat expand expand queri total search templat ml domain univ domain search templat retriev top thirti rank document list correct base queri discard experi ml base queri search templat return correct univ domain base queri instruct rank problem map framework instanc pair form base queri url return search templat queri rank featur construct search templat assign jth url list base queri rank rank base set oe construct separ feedback function base queri rank correct homepag url entri set feedback function combin feedback function sum section map rank problem immedi appli map impli weak hypothesi defin search templat rank featur threshold base queri url weak hypothesi output rank threshold list url return expand queri search templat appli html disagr nn regress coverag disagr nn regress coverag disagr nn regress coverag disagr nn regress coverag figur perform algorithm respect featur set size base queri final hypothesi weight sum weak test base queri form expand queri send search engin obtain list url evalu pair return obtain predict rank url divid data train test set creat partit base queri train test learn algorithm access test data train paramet evalu search templat access set url return top document search interpret rank url return document set paramet def default weak section order determin ran partit data produc graph averag train error due space train error reach round number boost round experi evalu perform individu search templat comparison combin hypothesi output measur number queri correct document top rank valu compar perform combin hypothesi search templat result ml univ domain shown tabl column give number base queri correct homepag retriev rank bold figur give maximum search templat test data note search templat determin base perform test access train data ml data combin hypothesi close track perform expert interest singl templat valu univ data singl templat valu combin hypothesi perform templat outperform queri heurist univ domain place templat comput approxim averag rank correct homepag averag base queri test set correct url rank high artifici assign rank document unrank rank rank limit maximum rank output gener fact maximum rank assign singl search templat column tabl averag rank tabl illustr robust combin hypothesi ml domain outperform templat measur top differ expert top differ univ combin hypothesi competit templat except trail expert domain includ good reason complic movi recommend test task introduct publicli data provid digit equip corpor ran recommend servic eighteen month march septemb collect user prefer data user assign movi score set data user enter total numer rate movi map problem framework section select subset user serv rank user defin order set movi view set paramet def weak learner adapt feedback function defin section movi rate singl target user half movi view select target user feedback function half view movi test averag result run target user ran round disagr regress nn coverag disagr regress nn coverag disagr regress nn coverag disagr regress nn coverag figur perform algorithm featur densiti compar perform data set regress algorithm algorithm regress regress algorithm similar hill regress algorithm emploi assumpt prefer target user alic linear combin prefer user row vector compon score alic assign movi unrank matrix score user subset movi alic rank user rank movi rank decid default rank movi user repres row set score user unrank movi user averag score movi linear regress find vector minimum length minim jj wc standard numer techniqu packag predict rate movi nearest neighbor target user alic movi algorithm find user bob prefer similar alic bob prefer make recommend alic find rank featur movi order similar target user encod feedback function measur similar rank loss respect initi distribut construct nn view singl weak hypothesi output round threshold problem algorithm user select rank movi order target user fix modifi nn associ featur default rank def assign unrank movi search nn def calcul minim rank loss def case user rank movi target nn set def averag rank movi rank rank target order evalu compar error measur assum learn system produc function order instanc usual rank higher compar order order test repres formal function give definit measur defin total order instanc ti occur order definit extend assum ti broken randomli expect omit lack measur rang score disagr disagr fraction distinct pair instanc respect construct feedback rank loss minimum rank instanc score rescal rang coverag maximum rank instanc score rescal rang coverag prot equal uniqu instanc number instanc rank strictli higher predict instanc score rescal rang describ result ran seri examin perform algorithm vari number densiti featur movi rank densiti feedback experi number featur rank select disjoint random set user divid subset respect size ae ae ae serv featur set train half target user movi test user calcul measur averag test user ran algorithm disjoint random split data featur feedback averag shown figur clear winner perform measur perform regress nn perform algorithm improv number disagr regress nn coverag disagr regress nn coverag disagr regress nn coverag disagr regress nn coverag figur perform algorithm feedback densiti featur nn respect directli regress error rate slightli algorithm prot regress algorithm difficulti coverag number featur explor effect featur feedback number movi rank user partit set featur bin densiti bin maximum number movi rank singl user data set select random set featur bin evalu disjoint random set feedback user vari ran algorithm random calcul averag error measur averag result shown figur point averag densiti featur singl averag densiti featur densiti rang rel perform algorithm figur denser featur obtain lower error improv nn dramat regress perform featur densiti vari feedback densiti featur densiti random set featur ran random averag result figur feedback densiti nn improv respect disagr regress perform algorithm larger feedback set movi algorithm poor coverag graph perform rank task approach order base rel comparison perform regress treat movi score absolut numer valu improv nearestneighbor algorithm combin multipl featur form accur predict rule refer brian richard belew automat combin multipl rank retriev system annual intern acm sigir confer research develop inform peter bartlett sampl complex pattern classif neural size weight import size network ieee transact inform rich tom mitchel futur learn medic risk evalu advanc neural inform process system page william robert yoram singer learn order thing advanc neural inform process system effici inform gather internet annual symposium foundat comput yoav freund robert schapir gener learn applic boost journal comput system august david haussler theoret gener pac model neural net learn applic inform larri mark georg furna recommend evalu choic virtual commun comput confer page paul peter john riedl open architectur collabor filter netnew comput support cooper gerard salton automat text analysi retriev inform comput gerard salton michael mcgill introduct modern inform retriev robert yoav peter wee sun lee boost explan effect vote method annal robert schapir yoram singer improv boost algorithm predict eleventh annual confer comput learn shardanand patti mae social inform algorithm autom human factor comput system confer vapnik estim depend base empir data
DB/149 3 trace gener data transform abstract data wareh system integr inform oper data sourc central repositori enabl analysi mine integr inform integr sourc data typic undergo seri vari simpl algebra oper aggreg complex procedur wareh data lineag problem trace data item back origin sourc item deriv formal defin lineag trace problem presenc gener data present algorithm lineag trace environ trace procedur advantag structur properti transform work absenc inform result basi lineag trace tool gener wareh guid design data enabl effici lineag trace introduct data wareh system integr inform oper data sourc central repositori enabl analysi mine integr inform data analysi inform investig inform deriv sourc trace data item back sourc data item deriv term data lineag problem enabl lineag trace data wareh environ benefit includ data analysi data author view effici outlin previou work studi data lineag problem consid data defin relat materi view view sql relat algebra relat work simpler relat view view real product data data import sourc gener summar sequenc graph commerci wareh system provid tool creat work support nation scienc foundat grant permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb cui jennif widom comput scienc stanford manag transform part transform vari simpl algebra oper aggreg complex procedur code paper problem lineag trace data creat gener transform longer luxuri fix set oper algebra properti offer relat problem difficult previou work lineag trace transform graph real etl process storag requir runtim overhead lineag trace import develop approach lineag trace gener transform advantag structur properti transform trace facil absenc inform trace algorithm appli singl linear sequenc arbitrari acycl transform graph present optim effect reduc storag runtim overhead case larg transform graph result basi data analysi debug analyst trace back sourc data produc data item interest result guid design data enabl effici lineag trace main contribut work section defin data transform formal identifi set relev transform properti defin data lineag gener transform exhibit cover transform properti transform properti easili transform encompass larg major transform real data section develop lineag trace algorithm singl transform algorithm advantag transform properti suggest index improv trace perform section full version paper develop gener algorithm lineag trace sequenc graph transform algorithm includ method combin transform reduc trace includ number transform trace number intermedi result store recomput lineag trace implement prototyp lineag trace system base full version paper present initi perform result exampl paper relat data approach result appli data object gener version paper reduc origin full version reader interest complet treatment topic direct read full version version omit detail discuss nondeterminist index lineag trace transform multipl input output trace arbitrari transform perform avenu futur proof theorem relat work bodi work data transform includ aspect transform data focu data integr paper consid lineag trace address relat problem transform previou work data lineag lineag annot provid lineag inform transform involv produc data item sourc attribut deriv attribut lineag retriev actual set sourc data item deriv data item case lineag inform support lineag trace techniqu extend work paper techniqu lineag similar spirit annot techniqu worth note approach improv lineag trace slow load approach desir applic gener framework comput data lineag transform set paper defin trace data lineag transform base weak transform defin lineag trace transform graph proce trace path transform time definit trace data lineag base gener transform algorithm combin transform sequenc graph improv trace perform algorithm provid categori price valid appl comput soni comput soni comput soni comput canon electron soni comput figur sourc data set product date aaa bbb ccc ccc bbb figur sourc data set order erat lineag trace procedur automat class relat approach handl data creat gener transform statist approach reconstruct base data summari data presenc constraint approach estim lineag inform ensur accuraci consid etl set defin concept contributor order enabl effici resumpt interrupt load similar definit contributor definit data captur aspect lineag paper gener class transform consid run present small run design illustr problem techniqu paper data retail store data deriv sourc product tabl attribut valid specifi time period price effect order tabl attribut specifi list order product product id quantiti sampl content small sourc tabl shown figur analyst build tabl list comput product sale jump quarter sale averag sale quarter tabl defin data figur show content tabl assum valid simpl typic treatment time order date aaa ccc bbb transform graph input order product direct acycl graph split input order product list multipl singl order product quantiti output schema filter product comput categori product categori price valid soni comput soni comput figur lineag effect perform relat join output occur period drop attribut output schema comput quarterli sale product group output comput total sale product previou pivot result output tabl schema quarterli sale comput output averag sale product quarter output schema averag sale select product sale greater averag quarter perform final project output schema note transform express standard relat simpl lineag data figur tabl tupl indic sale comput jump averag quarter quarter analyst relev detail inform trace lineag tupl inspect origin input data item produc techniqu develop sourc data figur analyst present lineag result figur transform data lineag formal gener data transform data briefli motiv transform properti lineag trace order product figur transform deriv transform data set set data complex duplic set effect duplic lineag trace address detail transform procedur data set input produc data set output transform singl data set input produc singl output set extend result transform multipl input set output set input data set applic result output set denot instanc transform composit transform appli obtain appli obtain call compon transform composit oper transform repres composit tn transform sequenc transform defin composit transform atom assum transform stabl determinist transform stabl produc spuriou output transform determinist produc output set input set transform stabl determinist unstabl transform append fix data item set item output input transform transform random sampl input set practic requir transform stabl requir determinist discuss determinist assumpt drop data lineag gener case transform inspect entir input data set produc item output data case relationship input output data data item output set deriv small subset input data item entir input data set figur transform instanc mation instanc output item call actual set input data item contribut deriv lineag denot lineag set output data item union lineag item detail definit data lineag type transform section work transform import trace data input data item particip deriv output item transform instanc figur lineag output item depend illustr transform filter input item neg relat lineag output item includ input item group input data item base valu comput sum valu multipli relat α perform group lineag output item includ input item comput refer back transform earlier exampl section call transform standard relat oper defin retriev exact data lineag output data item techniqu introduc lineag output item defin entir input set realiti transform lie standard relat structur properti identifi trace data lineag transform properti easili transform infer transform definit relat possibl behavior focu properti exploit lineag trace trace transform properti kind properti provid algorithm trace data lineag properti transform transform class base map input data item output dispatch aggreg figur transform class item schema map output attribut relat input attribut transform accompani trace procedur case lineag trace transform exhibit determin lineag trace base properti hierarchi transform class defin transform give formal definit data lineag lineag trace procedur subclass effici trace procedur inform studi shown transform real data composit section larg major fall effici subclass dispatch transform dispatch input data item produc output data item figur illustr input item produc output item input item produc output item input item produc output item lineag output item dispatch defin simpl trace lineag set output item dispatch procedur appli input data item time return item produc item note trace procedur set output item paramet singl output gener trace lineag transform sequenc graph trace transform section input order produc output order output item base sampl data figur assum input set readili case input set unavail unnecessari consid trace lineag procedur obtain transform section section similarli trace data lineag trace requir complet scan input data input item call transform overhead startup discuss index improv perform trace introduc common subclass lineag trace trivial filter dispatch filter input item produc lineag output data item item input trace procedur filter simpli return trace item set lineag call transform scan input data advantag case section transform section lineag output item item input set exampl filter section aggreg transform aggreg complet exist uniqu disjoint partit call input ik lineag ik transform complet input data item contribut output data figur illustr lineag output item input item lineag output item lineag output item transform section aggreg input partit lineag output item transform section aggreg note transform aggreg dispatch section address overlap properti affect lineag trace section trace lineag output subset aggreg procedur subset input return uniqu subset produc rest input set produc rest output examin subset size find subset examin superset reduc work significantli call time worst prohibit introduc procedur ik ik return figur trace proc aggreg common subclass aggreg appli effici trace procedur aggreg aggreg input data item belong input item input set aggreg determin partit input item belong base valu input item aggreg transform cluster input data point base coordin output aggreg item cluster specifi point distanc belong cluster item belong cluster depend exist item trace figur aggreg procedur scan input data set creat partit linearli aggreg check partit find produc item reduc number transform call worst improv aggreg input item output item uniqu kei relat denot item aggreg input set input partit output subset ik produc singl output item kei kei theorem aggreg free aggreg relat retain group attribut trace lineag aggreg procedur scan input data set return input item produc output item kei item reduc number transform call call oper singl input data item improv perform discuss transform atom transform call transform dispatch provid lineag trace procedur subset input item produc output item illustr figur entir input data set lineag output trace procedur transform simpli return entir input true transform sort input data item attach serial number output item sort posit input data set sort output lineag output data item entir input set note case output serial deriv input data item schema map schema inform etl data wareh system requir transform programm provid schema inform discuss schema inform improv lineag trace dispatch aggreg schema inform improv lineag trace transform specif combin transform base schema inform schema specif input schema input kei output schema output kei specif includ schema defin definit transform input schema output schema list input output attribut ia denot attribut valu similarli ob function tupl attribut valu tupl attribut valu forward schema map partit input set im base equal partit output set base equal ik ob input item partit ik iff backward schema ping partit input set im base equal partit output set base equal ik ident simpli write write definit formal accur captur intuit notion schema map input attribut produc output transform exhibit schema inform transform section input schema output schema schema theorem transform dispatch instanc output item lineag lineag definit transform class section forward schema map backward schema map ia base theorem trace lineag dispatch narrow lineag output data item subset input data set base schema map retriev exact lineag subset algorithm section aggreg backward schema map trace lineag output item find input subset ia subset find lineag multipl schema map intersect improv trace effici narrow techniqu previou paragraph schema map satisfi addit obtain transform properti permit effici trace procedur definit map transform input schema input kei output schema output kei forward complet forward schema map output backward backward schema map input backward backward schema map input schema inform map transform section transform backward backward forward theorem filter backward backward backward backward dispatch forward map aggreg theorem transform instanc output item lineag base transform class defin section forward schema map backward schema map backward schema map theorem simpl trace procedur transform schema map properti definit procedur perform lineag trace forward theorem trace procedur section algorithm scan input item appli transform appli function attribut item effect comput work fact bit cheaper similar approach backward effici section reason perform lineag trace backward effici scan input data set make transform call discuss index speed provid trace procedur lineag trace procedur provid specif transform trace procedur tp requir access properti trace transform input procedur call access dispatch trace filter return aggreg aggr aggr return forward backward backward input tp input tp figur summari transform properti input data return lineag trace procedur requir access return lineag relat ident situat provid transform trace procedur definit transform invert exist transform call theorem transform aggreg instanc lineag theorem lineag trace invert transform aggreg invert transform dispatch lineag illustr accuraci effici provid trace procedur transform gener experi effect perform lineag trace make assumpt remaind paper properti summari hierarchi figur summar transform properti cover previou section tabl specifi trace procedur applic number transform call number input data item access procedur omit transform applic provid trace procedur requir input discuss transform satisfi properti properti trace procedur return accur lineag requir access input data figur specifi hierarchi determin properti specif transform solid arrow properti mean restrict aggreg aggr aggr dispatch forward backward trace proc input backward trace proc input filter figur transform properti hierarchi properti addit properti backward filter forward backward forward filter backward forward filter forward figur properti transform satisfi properti satisfi properti section restrict trace procedur effici number transform number input input data requir type accur lineag separ branch dash arrow properti hierarchi mean strictli restrict yield trace procedur effici measur make reason assumpt provid trace procedur requir input effici trace procedur requir input effici deriv total order properti shown number figur lower properti lineag trace set properti transform lowest trace data lineag figur list properti transform section section properti satisfi transform note list restrict properti branch hierarchi case trace effici differ repres solid dash arrow case issu discuss section figur lineag trace sequenc trace lineag singl transform input set output lineag trace sequenc transform multipl input output set arbitrari acycl transform graph cover data lineag transform sequenc simpl sequenc figur figur input data set output data item lineag lineag lineag figur item item item lineag definit gener arbitrarili long transform sequenc associ composit transform sequenc ik intermedi result output input correct approach store intermedi result addit initi input load trace lineag backward transform time approach ineffici due larg number trace procedur call iter transform due high storag cost intermedi result longer effici trace realist transform sequenc practic cost prohibit transform sequenc end trace lineag entir input transform follow sequenc reliev problem combin adjac transform sequenc lineag trace input set lineag trace discuss section intermedi result discard strategi transform sequenc tn normal section combin transform benefici determin intermedi result save lineag base properti remain transform data load transform intermedi result save trace lineag output data item normal transform sequenc iter trace procedur begin section transform sequenc normal discuss section combin transform sequenc lineag trace benefici combin transform tk replac transform singl transform elimin intermedi result ik trace combin transform step decid combin pair transform combin transform lineag step determin properti combin transform base properti compon transform function return combin transform set properti base theoret combin adjac transform fact entir sequenc larg combin transform desir properti compon lead effici accur lineag trace combin transform benefici transform determin combin transform sequenc difficult combinatori determin accur benefici combin requir detail cost model account transform cost appli cost store intermedi estim workload data size trace develop cost model scope paper suggest greedi algorithm normal shown figur algorithm repeatedli find benefici combin transform pair combin continu benefici combin found combin consid benefici reduc trace cost improv retain trace accuraci determin benefici combin transform base sole properti heurist combin transform combin degrad accuraci lineag determin step procedur combin transform composit significantli lineag higher trace cost lead accur result divid properti figur group properti group properti group properti group properti group properti effici accuraci trace procedur fairli differ significantli group group transform denot group properti belong lower group lineag benefici combin transform base figur call find pair adjac transform combin sequenc return index procedur return combin benefici benefici combin combin leav fewest transform compar candid associ vector number transform belong group equal length sequenc vector highest index differ impli fewer transform combin lead lowest vector result sequenc finish combin transform sequenc transform lineag end trace lineag entir input earliest transform follow final step combin transform follow elimin unnecessari trace storag cost procedur complex transform sequenc length greedi algorithm heurist estim benefit combin approach effect improv trace perform shown sequenc transform section figur show sequenc properti transform initi vector greedi normal combin properti properti properti turn combin reduc vector combin obtain combin result combin result transform properti reduc combin obtain combin transform result stop point final normal sequenc shown note presenc schema map index transform improv trace effici point move group factor account process procedur replac tk transform lowest index replac tn tj procedur return figur normal transform sequenc figur filter figur normal figur normal remind develop complet set techniqu data lineag trace data load graph gener transform techniqu present version interest reader strongli encourag investig full version complet treatment refer tool data translat integr ieee data engin march bernstein support data transform microsoft repositori ieee data engin march sb gc wong data transform system biolog data sourc proc intern confer larg data page septemb chaudhuri dayal overview data wareh olap technolog sigmod march kt claypool ea rundenstein flexibl approach ieee data engin march cui lineag trace data phd comput scienc stanford cui widom practic lineag trace data proc sixteenth intern confer data page san februari cui widom lineag trace gener data transform technic stanford januari jl wiener trace lineag view data wareh environ acm transact june olap server hv recov inform summari data proc intern confer larg data page august lm rj mt pm el wimmer transform heterogen data integr ieee data engin march ward manag deriv data scientif dbm proc intern confer larg data page august informix format data transform tool sourc queri document proc workshop web inform data page novemb wj jl effici resumpt interrupt load proc acm sigmod intern confer manag page subramanian languag relat system proc intern confer larg data page septemb lomet editor special issu materi view data ieee data engin bulletin june microsoft sql data transform servic olap data analysi report tool data transform softwar raman hellerstein potter interact framework data clean technic uc rosenth scior propag integr inform interrel proc work confer integr intern control inform page novemb rosenth scior class kei comput sigmod march technolog nc shu automat data transform restructur proc intern confer data page lo februari squir data extract transform data proc acm sigmod intern confer manag page stonebrak implement integr constraint view queri modif proc acm sigmod intern confer manag page stonebrak support data lineag visual environ proc thirteenth intern confer data page april
ML/150 6 estim depend structur hidden variabl marina michael jordan center biolog comput learn massachusett institut technolog carleton st ma abstract paper introduc probabl mixtur tree account dynam chang depend relationship present famili effici algorithm em minimum span tree algorithm find ml map mixtur tree varieti includ dirichlet mdl prior introduct fundament featur good model abil uncov exploit independ data present commonli neural net belief depend structur encod model vari depend actual valu variabl current case depend structur condit valu variabl abound world bitmap handwritten digit depend pattern depend vari digit imagin medic record bodi weight data patient bodi weight function ag height healthi depend condit patient suffer athlet model repres data condit depend tree mixtur includ soft counterpart mixtur expert tree repres pattern suit repres depend mixtur flexibl rest paper special case call mixtur span tree domain observ variabl relat depend depend cycl repres graphic tree structur depend vari instanc index set structur structur variabl observ obtain mixtur framework graphic probabl tree distribut enjoi properti make attract model flexibl intuit sampl comput likelihood linear simpl effici algorithm margin condit exist fit tree distribut effici tree captur simpl interact variabl prove insuffici complex distribut mixtur tree enjoi comput advantag tree approxim space distribut fit domain depend pattern tree possibl hidden variabl instanti rich histori mixtur model densiti estim classifi task mixtur model extens statist neural network literatur relev present work mixtur distribut case continu variabl overlap space mixtur tree recent work mixtur factori subclass tree distribut work fit tree distribut framework pioneer chow liu extend pearl mixtur tree observ structur variabl geiger work present effici algorithm learn mixtur tree model unknown hidden structur variabl section introduc section develop basic algorithm estim data ml framework section discuss introduct prior mixtur tree model present realist factor prior map estim comput modifi version basic algorithm properti model verifi simul section section conclud paper mixtur tree model section introduc mixtur tree model notat paper denot set variabl interest graphic model variabl view vertex graph denot number valu variabl xa assign variabl subset simplifi notat xv denot tree graphic famili probabl distribut satisfi common set independ relationship encod tree topolog edg tree show direct absenc edg variabl signifi condit variabl call graph cycl tree denot edg set probabl distribut conform tree distribut factor uv deg deg denot number edg incid node factor uv margin distribut uv distribut call tree tree span node call span tree graph theori definit correspond forest connect compon forest call tree term condit probabl jx form obtain arbitrari root connect compon substitut tv start root repres parent direct tree empti set root connect compon direct tree advantag independ paramet total number free paramet defin mixtur tree distribut form graphic model mixtur tree view unobserv choic variabl mg probabl condit distribut visibl variabl tree tree structur paramet note structur mixtur tree properli belief result ow belief network perspect basic ml fit mixtur tree section show mixtur tree fit observ dataset maximum likelihood paradigm em algorithm observ denot fx valu structur variabl fz ng usual em procedur expect step consist estim posterior probabl tree gener datapoint fl expect complet maxim step algorithm jx log fl fl maxim valu paramet obtain distribut maxim express neg log problem solv shown give descript procedur comput mutual inform pair variabl target distribut uv uv log uv pu optim tree structur found maximum span tree algorithm uv weight edg tree margin uv figur basic ml fit mixtur tree fx initi model procedur weight fit maximum weight span tree iter converg comput fl comput margin uv comput mutual inform uv call uv gener uv uv equal margin uv target distribut comput intermedi step comput mutual inform uv target distribut repres posterior sampl distribut note tree fit encompass problem fit mixtur tree sampl distribut local optimum reach algorithm summar figur procedur base import assumpt made explicit paramet independ distribut multinomi free paramet independ paramet mixtur constrain tree share construct bayesian network achiev suffici replac weight step uv run mst algorithm obtain common structur tree obtain basic algorithm connect section give reason wai obtain disconnect tree structur miss variabl handl elegantli tree number miss variabl margin time bound grow exponenti size largest connect subset miss variabl observ unknown structur variabl interest special case situat structur variabl fact observ variabl small subset dont discov build mixtur condit observ compar build standard mixtur model compar mutual inform structur variabl identifi candid map mixtur tree previou section shown fit ml mixtur span tree set observ em algorithm extend procedur broader problem find maximum posteriori probabl mixtur tree dataset nonuniform prior search mixtur tree maxim log log log factor prior present maxim problem differ ml problem solv previou section addit term log approach em point iter maxim log log easi ad term influenc proce successfulli maxim rh usual em applic enabl fact obtain separ set equat paramet mixtur compon prior tree paramet satisfi decomposit form class prior agreement paramet independ assumpt includ conjug prior multinomi distribut dirichlet prior dirichlet prior tree repres tabl fictiti margin probabl uv pair variabl sampl size strength prior straightforward maxim probabl replac margin uv step uv uv uv dirichlet prior impli knowledg detail prior inform model impli number mixtur compon inform margin relat variabl introduc form tabl fictiti margin sampl size creat fictiti dataset size augment true train set train proce ordinari ml model fit mdl descript prior inform prior attempt balanc number paramet estim amount data introduc penalti model complex mixtur tree proce differ maintain drop paramet independ describ method reduc number paramet independ edg prune prior control number compon introduc prior compar model posterior obtain penal number paramet compon notic ad link tree contribut uv paramet wrt factor distribut uniform penalti uv introduc prior exp uv maxim express mixtur compon mixtur index drop argmax uv fi uv argmax uv achiev choic uv suffic replac weight step uv modifi mst procedur posit weight edg prior factor prior smooth method model class span tree suffici larg introduc bia small effect number paramet discuss techniqu appli tree direct reader consult vast exist literatur relat smooth cluster discret probabl estim inform subject ffl penal entropi structur variabl introduc penalti term result system equat uniqu maximum admiss domain ffl smooth margin comput margin dataset total uv replac margin uv uv uv total uv ff note edg prune reintroduc normal constant tabl perform algorithm glass dataset mst mixtur span mf mixtur factori distribut algorithm classif algorithm classif perform perform mst fi mf mst fi mf mst fi mf mst fi mf mst fi flexibl mst fi mst fi method variat thereof discuss effect give small probabl weight unseen instanc draw compon closer reduc effect method effect practic ff function uv empir result test model algorithm abil retriev depend structur classifi densiti estim sampl datapoint mixtur tree variabl vertic paramet gener model initi point algorithm pick random result retriev origin tree algorithm fail retriev correctli tree trial bad result account sampl tree wasnt recov recov miss algorithm fit ident tree gener tree highest differ log likelihood sampl gener tree approxim tree bit correctli recov approxim mixtur higher log likelihood sampl set gener distribut investig perform mixtur tree glass classif task uci repositori data set instanc continu valu vector class variabl valu continu variabl discret uniform bin test mixtur valu variabl smooth margin valu fi edg prune smooth margin coeffici ff proport margin count uv margin uv edg prune uniform penalti uv comparison mixtur factori distribut size seventh pick randomli test rest train replic comparison result obtain cite set size tabl show select result obtain smooth margin prove bad result shown effect edg prune classif test basic algorithm densiti estim run subset binari vector handwritten digit measur compress rate dataset imag singl digit vector repres randomli pair digit imag valid test set exemplar data train condit algorithm compar mixtur fit basic algorithm show perform result tabl result mixtur tree absolut winner compress simpl digit model pair digit suggest model mixtur factor perform good compress digit data unabl discov independ doubl digit set step introduc edg prune tabl compress rate singl digit doubl digit dataset mst mixtur span mf mixtur factori distribut algorithm digit pair base rate mf field machin fulli visibl net mst paper shown model exploit depend structur condit valu data liter belief mixtur tree plai variabl topolog spirit tree suffer exponenti comput demand plagu infer structur find wider class belief net algorithm present linear quadrat jv loss model power mixtur singl tree possibl prune mixtur tree plai role mean automat select variabl relev task import prior construct model problem underestim issu good prior class mixtur tree model comput burden involv prior account present paper offer partial answer present broad class prior effici handl framework algorithm shown class includ import prior mdl prior dirichlet prior acknowledg morri share enthusiasm tree role experi refer chow liu approxim discret probabl distribut depend tree transact inform rubin maximum likelihood incomplet data em algorithm journal royal statist dayan algorithm produc good densiti neural inform process number page mit geiger learn algorithm bayesian condit tree confer uncertainti page morgan kaufmann chicker learn bayesian combin knowledg statist data machin construct bayesian finit mixtur model em algorithm technic report univeristi depart comput structur probabilist depend stochast languag model comput speech pearl probabilist reason intellig network plausibl infer morgan kaufman san
Agents/151 1 augment commerc agent intellig system laboratori swedish institut comput scienc box sweden internet evolv inform space market space potenti electron auction commerci servic creat great problem major problem difficulti find relev offer problem cope multitud style user interfac marketplac problem autom routin task environ present solut problem market agent support user custom commerci site find match negoti close deal infrastructur open decentr particip agent act interest owner interact symmetr particip plai role market paper present integr sic web person assist agent user interact servic handl routin task servic adapt interest provid mechan initi highli manner softwar worldwid electron person assist introduct internet evolv inform space market space thousand electron auction commerci servic larg number type commerc site simpl advanc shopbot start search telescop inform store sell telescop vista hit good deal shopper find store sell proce compar manual lot work good offer miss due sheer exhaust problem search engin necessarili cover part shopbot made lot easier find compar offer catalog regular end result small number player control choic search choic evalu negoti mechan market strongli conflict notion free market particip particip complet control interact companion paper previou work introduc framework market sic particip market support agent infrastructur open web enabl autom shopbot particip agent act interest owner singl site control market site serv central role indic search role open particip perform particip trivial switch interact symmetr particip plai role market describ agent integr web sic smoothli combin web autom person assist agent user interact servic handl routin task servic adapt interest provid mechan initi highli manner remaind paper organ section briefli summar sic discuss relat work section present basic integr agent web section describ basic function person assist section present usag scenario section discuss implement issu section offer final background relat work sic sic market infrastructur intend complement form commun core inform describ user interact defin basic vocabulari negoti settl deal agent infrastructur html http web summari provid make exposit inform model base structur document repres contract set contract call interest element contract url refer type definit element type arrang inherit hierarchi languag interest offer abil give altern gener inherit give rang valu custom design market interest format encod interest descript framework map gener serv languag interact model asynchron messag commun speech act base market interact languag manner kqml fipa acl share common lisp base serial syntax compar similar set messag type small reject singl interest argument send messag type declin mean make legal bind requir support digit signatur authent mechan sic softwar platform agent environ softwar platform agent develop sicstu sic sicstu consist librari implement basic agent standard internet format agent os process default messag transfer messag receiv asynchron socket agent address case url type map stand market agent protocol agent messag http manner analog agent commun agent send receiv http make web client server individu web address agent default gener html intern perform automat relat approach shopbot program servic autom shop web servic jango part excit simpl interfac search bui number oper tool autom creation interfac web base simplifi task inform interact standard sic creation shopbot simpl task attent domain specif servic person servic base collabor filter techniqu fly mechan automat share base open profil standard mechan commun interest similar inform serv profil automat commun user person servic sic user inform specif provid incent inform anthoni patti mit media develop market call kasbah user assign task bui sell good perform negoti fulli automat system intend serv gener market infrastructur offer distribut gener inform interact model stanford michigan digit librari project emploi architectur system kqml influenc hierarch view system priori subdivid number compon sic attempt provid minimum glue enabl autom market particip special compon number platform build distribut commerc applic integr web ambiti eco system project aim develop architectur framework compat major internet commerc platform interact agent common busi languag insuffici inform make comparison framework present strong similar notion integr web client server object augment manner analog agent sic user screen person assist netscap commun honest car store radio fulli compat kind www figur integr user servic agent web integr user servic agent web figur illustr basic integr user servic agent web user interact servic usual web window user person assist agent augment interact interact agent servic user interact person assist dedic window section user visit servic assist detect presenc agent web page section establish connect agent servic queri assist assist initi servic specif interest enabl servic person displai offer relev current interest base notion explicitli provid user servic input respect agent format base structur document tediou creat interest form integr web enabl servic essenti part provid wai enter interest includ interact design car car creat gener interest select cd record catalog descript interest assist main goal enabl high autom internet market user deleg task handler agent handl task good offer match sell good auction user notifi event email messag cellular interest bui car settl deal car sold messag address broker directori auction pa pa figur type inform person assist agent person assist person assist inform handl autom commerc owner inform interest inform owner settl messag receiv inform store person assist figur interest interest owner market particip interest kei knowledg person assist enabl search particip match negoti price interest repres structur base templat share agent market ensur agent interest public privat public interest agent profil inform settl deal inform deal assist settl guid repres owner messag messag agent market assist agent user messag agent offer market particip messag assist inform red car sell address link agent user interact inform correspond mail address book bookmark behavior assist current rang handler handler assist handler interest number broker attempt find good offer bid process sell good act auction auction format user give interest interact run inspect result complet scenario section present coupl simpl scenario illustr person assist agent infrastructur scenario illustr person assist search bui product assum alex internet servic provid suppli person assist electron commerc alex decid bui cd mode surf servic provid start person assist contract buyer cd titl figur alex describ interest person assist alex describ interest contract buyer describ cd search pick cd templat enter inform field figur interest store public pa alex find sell cd surf directori servic pa immedi detect directori servic inform alex search directori servic gener web page summari deal interest alex time send inform directli pa dealer interest sell cd alex care pa find deal bui pa investig summari receiv directori servic start negoti seller order find deal final gener small summari offer alex find cd store offer price surf store pa inform cd interest store produc person web page full pictur music clip alex decid store reliabl examin offer final decid store choic pa settl deal pa settl deal seller addit inform address deliv cd scenario alex manual investig merchant offer told pa find bui cd automat case pa directori servic negoti automat settl deal price scenario illustr merchant autom servic sell cd assum small busi sell cd receiv larg shipment sell cd quickli contact pa statist view sale describ interest sell cd substanti lower price normal instruct pa sell pa start cd directori servic directori servic parti interest bui inform found parti cd pa wait interest parti contact cd sale figur person assist statist view time agent contact pa match interest pa investig receiv find interest match repli match interest agent initi negoti pa time price cd sold cd interest pa mark interest satisfi contact directori servic inform interest longer valid success report gener email implement develop prototyp agent system implement person assist consist core gui core agent agent system handl function implement java interfac user pa focu pa implement java netscap navig call user access pa small javascript program open navig window specif load pa gui applet applet immedi open connect pa connect open long gui run commun user pa pa gui pa gui control navig window window open javascript navig window access make load web page commerc site agent support add piec javascript code web page code open window pa gui window refer back window refer window return refer call public method pa gui applet inform servic agent navig window access content window figur show person assist browser window access directori servic code give inform broker agent locat pa broker contact pa gui var attribut function user person assist surf commerc site assist receiv address commerc agent method simpl implement problem netscap continu support kind interact navig window secur user pa gui run access agenten site window open pa gui control open window window solut problem problem solv servic provid give refer activ window inform pa gui agent web page sign applet give pa gui higher access browser web page contact pa inspect navig window check page load write client softwar window control browser altern proxi scan web page agent inform access altern attract requir softwar instal client comput discuss complement web market infrastructur greatli improv effici internet commerc market adopt solut remain problem benefit benefit larg group user creat market moder size group book market technolog ad benefit appeal group user grow larg interest target commerci incent adopt put pressur automat price comparison shop attract lead sustain growth eventu complet adopt question nich complement web fill web similar gener distribut object framework essenti softwar act behalf interact gener strong regard perform trust softwar carri routin predict review complet restrict distribut object framework acknowledg research present fund swedish transport commun research carri collabor research ab refer sic market infrastructur sic technic report swedish institut comput februari agent mediat electron trade workshop intern confer autonom inform interact usenix workshop electron commerc usenix al internet softwar platform base sicstu prolog present logic program san anthoni chavez patti mae agent marketplac bui sell good practic applic anthoni robert patti mae experi creat agent marketplac practic applic jai tenenbaum eco framework internet commerc white paper resourc descript framework yanni labrou tim finin kqml specif umbc technic report fipa acl foundat intellig physic agent agent commun languag stanford digit librari project michigan digit librari project jango shopbot excit edi kif net firefli netscap op
HCI/152 4 task analysi groupwar usabl evalu david carl gutwin depart comput saskatchewan campu canada abstract techniqu inspect usabl groupwar applic recent techniqu focu mechan collabor work context system offer time cost save requir actual user prototyp techniqu ad inform task work context improv qualiti inspect result introduc method group task add context discount groupwar evalu techniqu method specif collabor scenario task mechan level coupl task variabl task execut describ type task analysi inspect techniqu base cognit walkthrough groupwar task mechan groupwar walkthrough introduct groupwar consid difficult compar softwar group social organiz structur highli variabl user group contextu factor address earli groupwar difficult evalu success absenc user work context ethnograph evalu techniqu commonli util evalu techniqu fit easili earli stage groupwar develop cost requir prototyp recent interest develop form usabl inspect method groupwar applic perspect basic mechan collabor techniqu requir real user function prototyp techniqu attempt address situat cultur organiz aspect group work workplac address characterist collabor address order creat usabl groupwar applic gutwin greenberg present characterist set mechan includ explicit implicit protect recent studi mechan collabor carri usabl inspect groupwar applic find pure mechan view catch usabl valuabl discount techniqu maintain actual task carri system evalu awar group member tend carri work knowledg chang set assumpt evalu address context discount groupwar develop task analysi model group work add valuabl task inform inspect techniqu task model framework analyz contextu inform prepar carri inspect walkthrough unlik tradit task analysi task model add explicit collabor process mechan level coupl task variabl task execut outlin mechan present task model discuss analyz group work close discuss group task descript obtain analysi evalu methodolog cognit walkthrough mechan collabor recent groupwar inspect methodolog base claim groupwar usabl problem strongli ti social organiz insuffici support basic activ collabor mechan collabor repres action interact group member carri order share task action part teamwork work work part work carri major activ cover mechan collabor explicit commun group member provid inform gestur commun cornerston collabor implicit commun peopl pick inform implicitli produc inform artifact inform movement action coordin action peopl organ action share workspac conflict share resourc tool requir turn task requir action happen order plan type plan activ carri share divid reserv area workspac futur plot action simul workspac monitor peopl gener track situat collabor requir explicit monitor assist group member provid assist opportunist situat make easi person explicitli request protect danger group work alter work inappropri peopl ey artifact action protect work task analysi method mechan collabor lowest level task descript mechan vehicl group work carri group task analysi addit peopl task lead varieti differ task execut perform compar task main assumpt underli analysi task descript includ varieti coupl style interact consid valid wai carri task descript altern action group task execut variabl individu descript strictli linear import altern path task descript rigor analyz includ mechan collabor essenti carri task commun monitor practic identifi correct sequenc action complet task groupwar system due high variabl group work due interdepend action begin discuss task analysi model outlin difficulti inher group task present task model discuss compon final discuss task model analyz contextu inform real world work set difficulti group task difficult captur complex collabor task descript groupwar support standard task analysi methodolog orient captur clear teamwork captur repres task descript common group task idea plan make highli interact linear sequenc difficult complex bring question assumpt user initi goal enter system linear sequenc identifi reach goal user start clear goal decid action react action user goal action user action share plan context decid action variabl group task execut differ level coupl carri group task coupl refer level interact group member carri rang group interact user interact frequent user tend switch mode regularli carri group task mode user decid time unpredict linear task descript overlook mode task model order address difficulti inher group develop task model facilit analysi group work scenario task model sequenti order major mean organ task hierarch structur hierarch structur accommod uncertainti group task execut reason rang method carri task repres analysi possibl examin evalu step analysi necessarili accomplish task task compon carri case execut altern sequenc major compon task model individu collabor action shown hierarch turn descript activ relat achiev specif outcom scenario high level activ user group set circumst basic compon explicitli state scenario activ descript describ occur scenario occur individu individu work task collabor work task carri mechan collabor common wai perform collabor subtask scenario task scenario commonli evalu tool user test discount usabl engin scenario descript formal work user perform softwar scenario typic multipl task contextu inform user circumst task commonli carri scenario consist activ user specif descript knowledg user outcom intend group goal set circumst scenario carri task task build block explicitli state scenario activ descript task statement describ occur event occur subtask task analyz finer granular divid subtask task carri group task accomplish level coupl group member task analyz term individu subtask collabor subtask task realist accomplish singl level coupl task requir tightli coupl collabor individu subtask includ viabl altern method accomplish task mechan collabor provid framework collabor subtask teamwork aspect work easili overlook task translat groupwar applic gestur commun import part complet easili overlook verbal commun mechan collabor provid approach captur aspect collabor subtask specif action mechan collabor provid complet pictur task execut includ addit specif task model collabor subtask carri set action collabor subtask identifi object explicit commun common action accomplish verbal commun point action suffici accomplish identif action present list reason altern task model section describ task model analyz contextu inform discuss scenario task analysi conduct scenario work activ carri target user scenario activ target user commonli perform real activ carri groupwar system scenario activ descript observ target user perform work activ activ descript record descript activ requir achiev group goal addit activ scenario descript desir outcom group descript group descript circumst scenario commonli perform compon provid import contextu inform walkthrough conduct import captur inform type user perform includ knowledg inform evalu attempt ascertain user approach system common circumst surround scenario provid import insight evalu inform physic locat group member scenario wide distribut time interact synchron asynchron prove valuabl evalu assess usabl support scenario goal descript provid insight motiv group member provid import metric evalu system scenario activ descript analyz extract action approach determin absolut sequenc task occur identifi activ support order cover reason rang possibl task extract scenario individu task typic descript explicitli state scenario task state task descript broken subtask task potenti subtask subtask describ task accomplish order accur record level coupl subtask carri coupl interact tightli coupl interact type coupl record assess walkthrough subtask sequenti list altern method accomplish task collabor subtask requir special analysi process collabor subtask correspond mechan record subtask mechan carri collabor action carri accomplish subtask action list set altern explor walkthrough task descript present part task descript deriv car shop scenario group goal identifi car set user coupl share notion featur car task descript base circumst user automobil explor individu collabor show task scenario identifi car closer task explor car subtask individu explor subtask monitor person action observ gaze direct task ii identifi car closer group inspect subtask explicitli interest action point finger gaze action verbal indic refer gestur action verbal indic base car featur action combin posit verbal indic subtask implicitli interest action action interest subtask monitor person action observ gaze direct task iii figur partial task descript car scenario mechan shown task descript evalu group task descript add task context varieti groupwar inspect techniqu methodolog advantag task inform cognit walkthrough begun develop methodolog call groupwar adapt cognit walkthrough evalu groupwar applic cognit walkthrough commonli util usabl inspect techniqu singl user softwar develop develop design evalu softwar earli stage design common user task goal groupwar walkthrough methodolog substant modif cognit walkthrough made accommod multipl user uncertainti group task group work metric task descript task analysi model form basi carri groupwar evalu step task analysi result explor support action prototyp applic strict sequenti execut step breadth featur test import cover wide rang potenti collabor situat instanc level coupl support explor viabl altern carri task evalu give altern action support lack affect usabl system introduc method group task work motiv incorpor contextu inform form groupwar evalu task model mechan level variabl collabor task perform task model present hierarch structur analyz task scenario scenario inform partit individu collabor action discuss model extract contextu inform work set descript method contextu varieti inspect techniqu includ groupwar methodolog base cognit walkthrough futur work area involv flesh groupwar walkthrough techniqu test analysi evalu method real groupwar design situat acknowledg gratefulli acknowledg support nation institut standard technolog natur scienc engin research council canada refer heurist evalu groupwar base mechan collabor proc ifip comput interact prentic hall adapt local framework heurist evalu groupwar australian confer comput human interact groupwar social challeng develop commun acm groupwar cooper problem prospect art human comput interfac ed mechan develop low cost usabl evalu method share workspac ieee perform englewood prentic hall usabl academ press wj learn organiz issu groupwar implement cscw review groupwar evalu ieee groupwar ad context groupwar usabl evalu prepar cognit method evalu user interfac intern journal handbook usabl conduct effect test john wilei comparison observ inspect method evalu groupwar group al plan situat problem commun cambridg
HCI/153 4 universit de centr universitair dinformatiqu group vision februari technic report vision open framework distribut multimedia retriev hen wolfgang david mcg squir thierri pun comput vision group comput scienc geneva rue du ch geneva switzerland work support swiss nation foundat scienti research abstract articl describ framework distribut multimedia retriev permit connect compliant user interfac varieti multimedia retriev engin open commun media retriev markup choic imag featur set queri algorithm permit multipl user queri system adapt queri paradigm adapt problem queri queri annot user interact implement level wai relev feedback implement posit neg imag qbe queri method approach search imag give overview entir collect success nement addit queri long term line learn implement featur prefer user domain user learn automat present multimedia retriev system core framework search engin techniqu adapt tradit inform retriev retriev multimedia bene ting year ir research textual visual featur treat facilit true multimedia retriev protocol applic make search engin design benchmark test queri search engin compar result motiv fact imag retriev commun lack benchmark exist text retriev motiv multimedia retriev system aim retriev document base similar queri document document element search paradigm di erent convent reli exact match speci ed eld queri term standard queri languag idea queri taxonomi imag retriev present sql ful ll role convent queri languag facilit system compon interfac benchmark tool share web version local instal version lead duplic reduc system usabl user learn interfac search engin solut problem interfac block ort creat common benchmark cbir exist textual inform retriev measur benchmark develop exist treat ibm qbic de ne similar global local color textur text start point blobworld user select weight imag segment construct queri research devot develop imag featur discov mean combin weight produc result user inform system exploit techniqu insight obtain year ir fact appli adapt multimedia document inspir present research direct combin element modular modul ad chang base eld applic distribut framework compon present multimedia retriev markup languag result collabor group geneva circu group lausann cooper research group rst aim separ user interfac queri engin structur standard send queri cooper research group featur base xml parser multi paradigm er featur queri choic featur algorithm properti sheet paramet privat tag special featur system easili speci ed sql detail found server interfac figur commun protocol user interfac permit user connect varieti dispar queri engin illustr figur reduc develop time learn time facilit comparison queri engin descript commun commun structur remot procedur client connect send stai connect server server break connect server shut connect send messag answer request current speci cation support request capabl descript select data collect classi ed queri request collect queri select con gurat queri classi ed queri permit con gurat meta queri run formul qbe transmiss user interact data visual inform process enhanc retriev imag retriev consult system xml import reason xml commun framework corba basi implement rst xml larg commun framework corba er common format log le simpl common format user data make easier research group share type data common free imag collect system form power tool collect share cbir user interact data reason xml basi larg number free xml tool parser tool evalu le xml format xml main descript languag kind meta data internet content descriptor ensur long term support speci cation grace degrad grace degrad kei success independ extens basic principl summar server client recogn xml element attribut encount text complet ignor extens design standard inform remain gener user principl provid guidelin independ extens avoid con ict di er extens plan maintain promot central registr document extens facilit translat user log extend exampl log server server listen port messag tcp socket client request basic properti wait answer code server inform client capabl similar simpl client request list collect descript wai queri client open session con gure user meta queri client request algorithm request answer send list algorithm handshak mechan interact client program meta queri agent automat obtain inform describ server similar simpl client open close session con gure algorithm chosen user enabl server learn queri processor interfac con gurat client request properti sheet descript server vari algorithm di erent relev paramet gurabl featur speed er weight function varieti method level prune paramet irrelev search engin properti interfac adapt speci paramet speci es interfac turn data xml send back server short interfac con featur speci es displai element user enter attribut caption featur valu user enter integ attribut mechan complex properti send xml text multipl element queri formul queri step depend queri paradigm er interfac search engin includ design extens paradigm basic qbe queri consist list imag relev level assign user user mark imag posit imag neg queri imag refer url server return retriev result list imag url queri group transact formul log complex queri appli system process singl queri varieti version system import case preserv log knowledg queri logic relat usag initi idea protocol inter oper separ interfac actual queri er potenti applic open interfac server inform evalu inform form meta search engin benchmark benchmark cbir common benchmark cbir commun exist ten year ir commun process develop benchmark suit base benchmark perform evalu automat manual ort base develop exibl benchmark test suit relev judgment account compar system system evalu method recal normal averag rank imag retriev figur relev judgment cluster imag manual classi cation judgment number user experi shown user judgment di er strongli make import judgment compar system perform benchmark test search engin relev judgement perform measur figur benchmark time system paramet usabl system depend strongli system er method speed evalu evalu mean meta search engin meta search engin er possibl automat rout queri search engin applic user nding optim search engin search applic gener combin solut queri engin meta search engin wide accept common queri languag greatli simplifi develop search engin compon freeli research group develop client applic written java portabl er queri multipl posit neg queri multipl collect algorithm scatter plot result aspect similar basket imag figur java interfac search engin search techniqu system inspir ir larg number simpl featur contrast cbir system store imag list discret featur featur consid present present imag result data structur treat text document sequenc word word present present text featur weight similar featur weight scheme text retriev weight scheme equat present featur imag featur map featur imag store invert le data conjunct featur weight scheme make integr text complet textual featur treat visual multimedia document natur system weight algorithm featur relev ij log cf imag score kq kj featur relev tf term frequenc featur queri result cf collect frequenc queri input result number featur relev queri imag equat base fact featur frequent collect distinguish imag featur frequent imag describ imag imag featur present version emploi local global color textur featur extract frequenc statist imag collect intent make system featur approxim present human vision system featur read user add text imag facilit retriev imag search annot interact feedback strategi choic interact feedback includ relev feedback er user possibl mark imag posit neg exampl neg feedback problem mechan avoid problem inspir contrast classic relev imag attack problem nding good imag start point qbe search imag browser user nding target present sequenc overview success ned learn user interact overview present user chosen maxim expect inform gain techniqu rst emploi evalu pichunt present extens modi cation pichunt scheme give user possibl chang mind queri process incorpor framework long term learn usag log le system permit long term learn learn techniqu account imag mark queri step imag mark posit associ common featur higher weight featur common imag mark posit neg queri step contrari lower weight learn techniqu emploi domain basi account goal di er user user group open multimedia framework section describ framework exchang part system framework close system retriev multimedia document open platform compon exchang easili fast chang system integr research group neighbor disciplin research group work project part de ned program interfac make framework develop cooper circu group collabor mirror group twent separ interfac search engin achiev circu basi part system replac expand easili main system figur graphic framework easi adapt system diver requir domain consum replac compon project algorithm multimedia collect characterist featur section result research made freeli interfac conjunct parser public multimedia inform retriev reduc inform overload interfac algorithm featur textur annot color figur complet framework system domain research concentr aspect problem interest work continu develop freeli queri set benchmark suit distribut conjunct benchmark make rst comparison larg number exchang collect packag includ simpl command add imag collect queri engin chosen featur extract automat invert le gener featur result ad collect queri engin interfac imag displai collect chosen moment di erent collect imag incorpor system system er possibl includ collect multimedia item web extend concept imag search exchang featur di erent set featur system combin featur select queri featur set di erent absolut work domain multi modal data medic imag di erent featur set face imag photograph collect imag collect interfac con gure displai featur group moment er text local global color featur local global textur featur base gabor wavelet investig featur group special imag trademark plan exchang algorithm weight scheme incorpor system weight scheme comparison weight scheme cbir found di erent domain vari weight vari access function er exampl weight scheme classic document frequenc equat weight binari term independ distribut comput corba distribut actual comput number comput network queri collect queri featur group queri machin depend comput power figur server corba client figur distribut comput corba balanc comput load import system intens user paper describ open framework multimedia retriev er easi adapt system diver area applic develop retriev system freeli exchang proven interfac user chose compar retriev engin common commun protocol greatli facilit comparison common rst step benchmark suit multimedia retriev engin demonstr feasibl techniqu adapt ir shown ectiv textual visual featur natur common lead easi integr true multimedia retriev framework easi exchang part system adapt system scenario multimedia data manag adapt domain medic imag trademark recognit underwai evalu distribut system complement separ interfac search engin distribut actual comput machin internet local network acknowledg work support swiss nation foundat scienti research refer altavista imag search engin web annot depart comput scienc web chang engin imag symposium electron multimedia process applic storag retriev imag video san malik imag queri ieee confer comput vision pattern recognit san puerto june ieee comput societi li queri taxonomi multimedia al symposium video data yianilo target test pichunt bayesian multimedia retriev system advanc digit librari page librari queri imag video qbic system ieee septemb sur mage web zhang inform base user relev feedback imag retriev al symposium video data mpeg requir group context object atlant doc intern octob pun long term learn imag retriev technic report comput vision comput rue februari pun strategi posit neg relev feedback imag retriev technic report comput vision comput rue jan pun perform evalu imag overview technic report comput vision comput rue dec pun ecient access method imag retriev invert le al symposium video data de pun extens standard multimedia queri benchmark draft technic report comput vision comput rue octob pun hunt move extens bayesian method multimedia al symposium video data editor multimedia storag archiv system iv volum spie septemb symposium video data qbic tm ibm queri imag content web rocchio relev feedback inform retriev smart retriev experi automat document page prentic englewood cli salton bucklei term weight approach automat text retriev technic report depart comput cornel york novemb salton bucklei term weight approach automat text retriev inform process relev feedback term weight scheme imag retriev intern confer visual inform system number lectur note comput page june queri imag inspir text invert weight relev feedback scandinavian confer imag analysi page june squir pun comparison human machin assess imag similar organ imag scandinavian confer imag analysi page june pattern recognit societi finland overview seventh text retriev confer seventh text retriev page novemb
DB/154 3 select estim spatial swarup acharya poosala sridhar ramaswami inform scienc research center bell lucent technolog mountain murrai usa abstract select estim queri import problem relat system examin select estim context geograph inform manag spatial data polygon focu point rang queri rectangular data techniqu base spatial binari space partit notion spatial skew techniqu carefulli partit input rectangl subset approxim partit accur present detail studi compar techniqu sampl parametr techniqu evalu synthet tiger dataset base identifi base partit call consist accur select estim spatial queri partit construct occupi accur select estim broad rang spatial queri introduct geograph inform system gener enorm interest commerci research commun decad typic store manag spatial data surfac refer spatial commerci system manag spatial data includ informix lead vendor work author bell lab current affili suit palo alto ca acm sigmod june offer kind support spatial data process provid support focu effici manipul research relat modul spatial system requir accur estim queri result size estim varieti wai queri optim queri result size estim determin effici execut queri estim system give user feedback run time queri queri execut impract run entir queri comput result commerci system form statist approxim underli data estim result size base statist varieti techniqu literatur comput estim queri result size relat common base parametr techniqu model data standard mathemat prove popular system comput space order hundr byte requir input distribut advanc work partit input small number subset call approxim bucket model distribut tupl queri result estim obtain process queri bucket approxim problem select estim spatial data relat select construct distribut approxim histogram small amount space estim problem studi extens literatur previou work approxim distribut singl numer attribut studi data concentr approxim frequenc point space techniqu aim data highli skew frequenc perform frequenc domain uniform domain placement point skew spatial select estim differ import aspect tradit select individu spatial entiti differ shape distribut frequenc input domain vari dramat spatial valu spread space correspond fact spatial entiti cover problem approxim spatial data requir techniqu accur approxim domain distribut context point difficult problem select estim faloutso address problem spatial select estim concentr point data motiv studi problem select estim point rang select predic spatial data concentr rectangular data import problem customari spatial system approxim spatial object minimum bound perform queri process mbr object larg cumbersom ineffici manipul concentr primarili rectangular data techniqu applic point linear data contribut ffl present group techniqu approxim spatial data addit analogu techniqu relat techniqu base spatial index select estim techniqu base notion spatial densiti spatial skew featur data captur underli input data distribut manner accur techniqu select estim ffl provid detail studi compar techniqu synthet dataset result show techniqu call outperform techniqu entir data queri spectra techniqu effici low memori requir larg dataset size studi show straightforward applic techniqu effect spatial domain ffl identifi seemingli fact spatial select data fine level detail result poor perform answer larg observ develop techniqu call progress spatial refin improv rest paper organ section formal problem descript section offer discuss solut problem present basic techniqu spatial select estim section present sophist techniqu spatial select estim section present result extens seri experi synthet data identifi clear winner suggest improv present section problem formul formal defin specif class select estim problem address paper develop notat describ spatial data relat attribut domain set rectangl distribut set rectangl fr compon rectangl corner assum integ real domain denot area minimum bound rectangl input rectangl avg avg denot averag width height rectangl denot sum area rectangl ta rang queri predic rectangl note definit point queri set qx qx result size jqj number rectangl input intersect queri rectangl select queri fraction comput exact select queri requir scan input dataset index find number input rectangl intersect queri option context queri requir disk access involv amount process forc summar approxim input data repres compactli approxim estim select defin problem select estim rectangular data estim jqj arbitrari rang queri input distribut problem focu paper techniqu approxim spatial data examin techniqu approxim spatial data main focu broad class techniqu approxim data small amount typic tabular form present simpl techniqu analog tradit uniform distribut assumpt made relat uniform assumpt spatial data simplest techniqu approxim spatial data assum input rectangl ident width distribut uniformli input space formula estim result size point rang queri assumpt point point return number rectangl overlap point appli uniform assumpt calcul averag number rectangl hit point queri input mbr averag point queri mbr easili shown averag obtain ratio total area input rectangl area input mbr ta rang rang natur uniform assumpt rectangl ident width height uniformli distribut input mbr number rectangl queri intersect calcul defin qx avg extend left side queri averag width subject constraint left side cross left input boundari defin qx similarli extend area qx number rectangl intersect estim note simpli area queri extend inaccur assum rectangl center lie queri area intersect queri account input rectangl center queri area intersect queri skew placement input rectangl input space skew size input rectangl applic uniform assumpt result highli inaccur select estim high placement skew size skew problem mitig input rectangl smaller subset bucket appli uniform assumpt subset individu result skew subset clear make uniform assumpt subset incur substanti error make uniform assumpt entir input focu develop accur group techniqu spatial data approxim spatial data group issu address develop techniqu approxim spatial criteria group rectangl bucket techniqu result set bucket estim result size solv observ bucket problem select estim reduc solv select estim individu bucket bucket appli uniform assumpt formula develop section individu bucket primari issu develop group base criterion group rectangl bucket identifi class fundament group appli approxim spatial data ffl equi goal partit input space result bucket ident equal area equal number rectangl ffl index partit produc spatial index structur ffl binari space partit notion spatial skew placement skew domin size skew dataset term group partit interchang dimens dimens figur dataset section group rectangl bucket neg effect make uniform assumpt minim present techniqu identifi advantag drawback present fundament approach spatial data goal partit input space properti ident result partit studi criteria analog histogram relat data approxim goal group creat bucket mbr area approach minim maximum area bucket larg bucket potenti incur higher error group attempt minim worst case error construct partit start singl bucket consist mbr input rectangl mbr bucket split longer dimens equal halv rectangl group halv base center lie mbr calcul bucket longest dimens choic chosen bucket split process repeat desir number bucket obtain recalcul mbr ensur bucket produc approxim input data distribut simpli mbr input region equal size lot empti space mbr input goal creat bucket number rectangl bucket larg number rectangl potenti incur larg error true group attempt bound worst case error algorithm obtain group similar algorithm dimens highest project rectangl count chosen split project rectangl count dimens bucket number distinct center rectangl bucket project dimens partit illustr dataset depict figur call set detail section part experi note set rectangl corner center figur depict group group bucket ident bucket distribut bucket area index base group popular index structur spatial data build index insert algorithm minim sum bound box intern node stand reason partit produc summar input data mbr intern effect give construct spatial partit idea index obtain summari inform dataset examin research effici member famili data structur partit result dataset figur note partit drastic techniqu disadvantag group scheme scheme suffer fundament disadvantag disadvantag broadli classifi base affect accuraci comput cost kei drawback scheme produc bucket placement size skew deriv famou structur india call corner dimens figur partit dimens figur partit dimens figur partit group skew distribut input rectangl produc bucket group attack skew produc bucket region lot rectangl region benefici wast bucket insert algorithm essenti make local creat result final bucket produc fairli skew recent minim number disk read perform data distribut account expect produc partit conduc select estim disadvantag group scheme requir input data memori modifi make pass input techniqu requir index data fit make pass input data naiv algorithm construct base repeat insert log insert item sophist algorithm log disk block motiv defici develop class techniqu directli address skew comput effici describ techniqu section advanc spatial group techniqu techniqu address skew problem focu reduc placement size skew bucket make uniform assumpt uniform accur estim formal notion defin spatial densiti point space number rectangl point uniform distribut assumpt essenti replac spatial densiti bucket singl equal clear accur approxim group rectangl point bucket similar spatial densiti similar notion histogram literatur defin metric captur notion group error definit group bucket fi number point bucket statist varianc spatial densiti point group bucket entir group weight sum fi clear partit small highli accur approxim data build optim minim amount difficult problem provabl simpl instanc techniqu reduc complex construct good partit restrict binari space partit partit region find vertic horizont line divid input region partit algorithm construct dynam program complex requir input memori larg gi data make problem find good compact approxim input data place origin order build group memori varianc set number fn equal averag dimens dimens spatial densiti figur spatial densiti greedi approach reduc complex comput make local optim achiev linear time complex partit rest focu problem reduc effect input size develop algorithm construct good base point approach reduc input size divid input mbr evenli uniform grid rectangular region grid region spatial number input rectangl intersect grid region spatial densiti input construct algorithm grid size chosen grid region spatial densiti easili fit memori note spatial densiti obtain easili singl sweep input data illustr concept approxim dataset figur grid figur depict spatial densiti region correct granular grid rectangular region present tradeoff fine grid captur detail underli distribut approxim fine grid impli higher process memori cost examin issu empir section show fine grid detriment construct good partit partit techniqu construct binari space partit techniqu uniform grid region spatial densiti input algorithm partit grid bucket minim group call result partit partit construct algorithm partit repeatedli partit set region minim step partit exist region result partit algorithm algorithm comput aggreg densiti input rectangl distribut uniform grid rectangl spatial densiti start singl bucket consist region bucket current bucket comput spatial skew bucket split point dimens produc maximum reduct pick bucket split lead greatest reduct split bucket assign region bucket bucket endwhil assign rectangl input bucket mbr center rectangl reduc comput complex step greedi approach base split margin frequenc distribut dimens full input distribut figur illustr preprocess spatial input highlight iter algorithm partit data set figur partit desir featur construct algorithm minim partit significantli skew algorithm construct algorithm requir entir data distribut fit main advantag address issu skew comput time disadvantag group techniqu consid section result studi perform techniqu estim spatial select result rectangl region margin densiti spatial densiti region varianc dim varianc dim dimens bucket boundari figur illustr dimens dimens figur partit dataset present section base extens studi synthet spatial data section organ describ dataset queri model perform evalu techniqu explor champion greater detail studi tradeoff compar ffl averag rel ratio error estim actual size queri result averag set queri estim answer actual answer queri averag rel error queri set jr ffl preprocess time construct algorithm techniqu preprocess build data gener bucket process spatial queri dataset studi perform techniqu real life synthet dataset dataset wide spatial tiger sequoia dataset due space present result nj road dataset road data state jersei line segment comput bound box line segment spatial input result data set full paper metric undefin queri queri set produc output case encount dataset synthet dataset systemat gener synthet dataset vari placement size skew sparsiti control adjust dataset size rel total input area size skew model gener width height zipf distribut placement skew model zipf distribut present result introduc section rectangl ident height width unit distribut space rectangl concentr corner creat area vari level spatial densiti queri set queri set consist larg number rectangl ly mbr input center rectangl chosen randomli set center input rectangl averag width queri rectangl paramet vari width input bound vari queri area input mbr size desir averag queri rectangl gener achiev set height width rectangl uniformli distribut rang techniqu studi addit studi techniqu includ sampl parametr techniqu due faloutso experi appli sampl collect sampl input rectangl comput select queri sampl scale result appropri obtain estim queri select size sampl input size number sampl rectangl satisfi predic estim result size techniqu refer sampl graph parametr techniqu point data paper show spatial data fractal fractal dimens select point set power law correl fractal dimens expon extend techniqu rectangl data centroid rectangl repres addit uniform assumpt entir singl bucket approxim call uniform techniqu space alloc kei paramet influenc cost perform techniqu number bucket approxim queri processor alloc hundr byte statist attribut translat alloc bucket space overhead techniqu time number bucket word bound box bucket averag densiti averag width averag height rectangl bucket sampl techniqu requir half store bound box sampl rectangl term space rectangl sampl techniqu correspond bucket techniqu liber give sampl fair amount sampl compar space techniqu time rectangl complic build partit difficulti control number bucket produc address problem tweak branch factor produc close number desir ensur alloc quota order fair result compar perform techniqu spatial select estim studi perform techniqu respect queri size number bucket vari paramet entir set valu remain paramet fix default valu number region construct algorithm set experi impact queri size experi studi perform techniqu queri size figur show rel error function queri size bucket approxim nj road dataset result dataset qualit similar chop graph scale error sampl techniqu gener observ graph rel error queri size error estim bucket partli queri bucket store exact number rectangl belong bucket fall queri rectangl contribut error bucket fulli cover bigger fewer bucket contribut error techniqu show accuraci move graph fractal techniqu close effect techniqu dataset studi averag rel error nj road dataset consist close queri size techniqu develop point examin rectangl data rest show perform fractal techniqu perform competit number uniform poor nj road uniform error rang high rang error observ data set show spatial data inher skew captur trivial singl bucket approxim rest show perform uniform techniqu graph show sampl perform poorli result born case studi make implicit assumpt rectangl chosen sampl repres spatial distribut size rectangl neighborhood make local uniform case spatial data number show approxim spatial data distribut requir averag rel error queri size sampl figur perform queri bucket sophist partit techniqu account implicit featur data techniqu similar error valu slightli clear techniqu winner huge margin improv averag rel error closest competitor case recal techniqu aim creat bucket varianc densiti bucket explicitli account spatial skew data error bucket partial cover queri significantli lower techniqu compar techniqu skew account experi impact bucket size studi impact number bucket perform techniqu figur plot averag rel error number bucket nj road dataset left graph figur plot valu queri size space approxim reduc error techniqu error entir rang studi perform noteworthi bucket bucket pose greatest difficulti approxim techniqu perform scenario good standpoint queri queri processor typic small number bucket space constraint techniqu approxim input greater detail lower effect skew turn diminish perform differ techniqu perform slightli perform case consist entir space studi number rtree slightli pessimist point difficult control number bucket produc techniqu gener fewer bucket alloc quota sampl ineffect space base conclud techniqu choic approxim spatial distribut ideal techniqu spatial select estim highlight sec unlik low memori requir explor techniqu greater detail factor affect perform experi sensit region studi influenc number region uniform grid approxim underli input space perform techniqu point section inher cost versu accuraci correct granular grid analyz tradeoff quantit figur plot averag rel error versu number input region techniqu graph nj road dataset number bucket set graph show line queri size figur move number region size region drop correspondingli impli underli input distribut captur accur graph number region error point flatten flatten due natur data variat densiti big improv perform left side graph data extrem space fine captur addit featur data graph show number region captur origin input creat region necessarili run time overhead correl input data queri number region estim correct number bucket sampl averag rel error number bucket sampl small queri larg queri figur perform number bucket number region queri size averag rel error number region queri size nj road dataset synthet dataset figur error region bucket number region error interest problem explor part futur work studi problem space synthet produc result figur show problem space figur synthet dataset number perform small queri improv expect unlik set error larg queri larg number region approxim synthet number region span skew corner area highli vari spatial densiti forc construct algorithm alloc bucket compact area order reduc skew turn impli bucket larg interior area skew net result group perform poorli larg queri frequent span uniform interior area alloc bucket small improv perform small improv perform larg queri area includ wholli larg queri region effect larg queri provid solut call progress refin address problem progress refin clear discuss previou section larg number region benefit small queri smaller number region larg queri handl case progress refin region implement progress refin start construct algorithm small number region equal interv refin region split region ident region newli creat region replac origin region properti bucket construct algorithm margin recalcul region rest algorithm continu number refin import paramet examin empir section perform refin final grid size region number bucket requir refin region factor start grid consist region run till produc bucket refin number region produc bring total number upto refin region produc region produc bring total number bucket progress refin qualit effect data observ bucket alloc cover skew middl area care larg queri larg number region highlight high skew corner alloc remaind bucket area care small queri progress refin alloc bucket uniformli entir space select alloc bucket region requir experi impact progress refin quantit studi accuraci improv produc progress refin figur plot error data point figur region number refin shown number larg queri horizont line figur show minimum error achiev larg queri figur high clear refin error drop error drop absolut minim level achiev pick correct region close note error start refin refin leav bucket end approxim skew error queri data interest open question determin optim number refin region detail sensit studi progress refin scope paper part futur work found number refin vari number refin figur impact progress refin time partit input size input size techniqu fi fi fi fi uniform tabl time comput partit depend queri size input data experi construct time construct time techniqu tabl show time input size bucket count time measur sparc machin memori number bucket minor effect construct time significantli time data size mention benefit recal requir entir dataset fit memori techniqu select estim critic compon queri process popular spatial work provid accur effici techniqu spatial select estim spatial data differ significantli relat data relat techniqu simpli perform domain techniqu spatial select estim techniqu base spatial binari space notion spatial skew base extens analysi techniqu adapt show sampl parametr techniqu work relat world work spatial data base partit call outperform techniqu broad rang queri workload dataset partit construct effici ad advantag low memori requir construct result show spatial select estim solv accur effici larg spatial author steve code comput fractal dimens obtain mathematica program comput fractal dimens christo faloutso web site gratefulli acknowledg refer random sampl tree confer larg morgan kaufman pub alto august paul aoki gener gener search tree technic report june swarup sridhar ramaswami select estim spatial technic bell full version paper understand method rev workstat faloutso estim select spatial queri correl fractal dimens intern confer larg data seeger effici robust access method point rectangl proc sigmod intl conf manag chen roussopoulo adapt select estim queri feedback proc acm sigmod page david dewitt vldb comput scienc depart west dayton street wi erol daniel size project relat satisfi function depend proc int conf larg sept spatial constraint dbpl guttman dynam index structur spatial search proc conf manag page stoke estim number distinct valu attribut proc int conf larg page corp effici arrai partit proc intl automata program optim queri relat phd case western reserv sept schneider practic select estim adapt sampl proc acm sigmod page corp torsten rectangular partit applic intern confer poosala yanni ioannidi select estim attribut independ assumpt proc int conf larg august yanni peter eugen shekita improv histogram select estim rang predic proc acm sigmod page june poosala estim techniqu phd univ gregori charl connel accur estim number tupl satisfi condit proc acm sigmod page mm dd ra tg price path select relat manag acm sigmod intern confer manag page june samet applic spatial data comput imag gi addison samet design spatial data structur addison michael jim jeff sequoia storag benchmark sigmod record special interest group manag june faloutso dynam index object proc ieee intern conf larg file technic document technic bureau yanni theodoridi timo selli model predict perform fifteenth acm symposium principl june montag extens datablad architectur proc sigmod intl conf manag zipf human behaviour principl effort
AI/155 2 multimod approach term extract rhetor structur theori tagger formal concept analysi peter eklund order school inform griffith drive gold coast mail center australia technisch germani paper report knowledg extract rhetor structur theori formal concept analysi research multimod text tagger identifi kei term free term index filter free aim content multipl text sourc singl knowledg base aim extract semant content text deriv sourc merg singl coher knowledg base rst autom identif marker multipl text deal singl subject matter marcu shown rst mark natur languag text marcu store inform rhetor shown identif marker prototyp text autom adapt marcu algorithm approach work draw recent result natur languag progress field object research motiv analysi text gener translat formal knowledg consolid singl knowledg corpu interest analysi corpu determin reliabl inform obtain multipl agenc visual navig knowledg involv retriev text document typic proposit knowledg express monad relat shown repres binari relat knowledg scheme conceptu structur encod decod concept lattic show set formal context power context famili repres knowledg base cg algorithm transform cg implement natur languag text build tree marcu algorithm tree transform consolid tree structur cg knowledg base construct challeng problem singl cg begin end rst queri graph start point ad result queri rst solut identifi cg head algorithm queri graph gener cg knowledg base rst aim identifi part sentenc number satellit gener assumpt underli marcu algorithm build tree unrestrict text elementari unit overlap complex rhetor relat hold relat rhetor relat abstract structur text binari mean consist pair illustr idea text deriv marcu gener posit exampl neg exampl import prevent algorithm learn concept gener cover posit specif exclud neg exampl mark concess relat satellit nucleu elabor satellit nucleu convent relat repres predic form relat form nucleu nucleu correct ae rhetor constraint associ singl tree marcu algorithm autom gener tree theori concept format deriv lattic order theori engin ai term learn techniqu context tripl set subset equal cartesian product element object attribut object attribut defin fm fg set attribut common object set object process attribut formal concept pair context st set formal concept denot concept write import theoret result turn impli complet call concept lattic concept lattic structur meet join combin element definit concept lattic concept object concept meet join concept lattic express relationship attribut lattic repres relationship object attribut attribut capabl express relationship make lattic power algebra structur concept lattic focu visual metaphor navig knowledg base term extract text basi work inform filter text navig show cg defin abstract conceptu graph structur finit set map consid finit direct vertic edg defin jej finit set map impli je je element understood abstract relat relat hold text unit equal nuclei relat hold nucleu writer abstract conceptu graph relat formal context introduc power context famili kn kk ck abstract conceptu graph power context ck jej realiz abstract conceptu graph defin map ae power set impli pair call realiz cg concept graph import question obtain concept graph suggest transform concept graph construct rule form basi implement report note desir gener construct yield concept graph interest concept graph easili deriv transform rule hypothesi analysi origin sourc text provid graph knowledg base construct implement algorithm creat queri object fit vertex queri collect cg vertic object attribut obviou approach iter relat queri vertic relat queri extent relat object obtain extent relat cg object vertex satisfi queri object collect relat specif vertex good structur store inform formal context satisfi object extent bottom element lattic summari step present research text determin set marker set elementari textual unit set relat element constraint satisfact procedur determin tree assign weight tree determin maxim weight convert tree singl formal context famili identifi nuclei tree nucleu construct concept graph maxim join concept graph compat rhetor relat formal context famili result step illustr marker tag marcu algorithm text artifici intellig book deal version space algorithm input power context famili content sourc singl algebra structur structur creat singl cg knowledg base construct algorithm reli identifi tree marcu algorithm refer lattic conceptu cluster system applic retriev machin cole eklund applic formal concept analysi inform retriev hierarch structur thesauru intern confer conceptu lectur note comput page south wale cole eklund text medic discharg summari formal concept analysi australian document comput lectur note comput page south wale deal larg context formal context case studi medic text intern symposium knowledg storag effici page ubc bernd applic conceptu graph technic lehmann approach formal concept analysi intern confer conceptu number lectur note comput page springer verlag sa thompson wc rhetor structur function theori text daniel marcu build rhetor structur tree thirteenth nation confer artifici intellig page daniel marcu rhetor natur languag text fifteenth intern joint confer artifici intellig page daniel marcu rhetor summar gener natur languag text phd depart comput chri conceptu belief phd depart comput version url sowa conceptu structur inform process mind machin sowa conceptu graph summari conceptu current theori chapter page elli restructur lattic approach base hierarchi concept order page line diagram hierarch concept system intern conceptu graph formal concept analysi intern confer conceptu number lectur note comput page springer verlag decomposit concept lattic concept lattic conceptu knowledg system semant network artifici intellig pergamon comp math
HCI/156 4 individu technolog issu groupwar calendar system abstract design deploi groupwar difficult groupwar evalu design approach singl focu studi groupwar calendar system highlight synthesi multipl perspect fulli understand adopt challeng system face replac exist calendar impact calendar habit turn influenc technolog adopt electron calendar potenti easili share contextu inform publicli comput creat opportun peer judgment time alloc concern privaci regul situat support coordin make infer schedul technolog social environ context affect constraint afford technolog environ import wai horizon everydai affect natur tempor coordin expect meet schedul practic keyword groupwar calendar meet schedul introduct groupwar offer challeng design intend support coordin multipl groupwar singl user conson norm practic environ groupwar applic frequent develop base design test design perspect acm chi depart comput scienc boulder campu box usa fewer yield technolog usabl practic field interact reaction posit impact qualiti softwar todai problem groupwar design continu design techniqu approach difficulti address technolog evalu lab field comput support cooper work broaden design perspect address social organiz context technolog examin work institut incent control product system aspect social organ import factor impact groupwar unexpect wai design expand includ train issu effort identifi understand broad perspect introduc turn observ groupwar design implic account technolog constraint individu varianc difficult perspect limit vari isol inform groupwar design ethnograph studi groupwar calendar synthesi perspect yield holist understand groupwar technolog inform design strategi multipl perspect groupwar calendar system highlight converg perspect simpl complex execut convent paper calendar support peopl person custom wai arrow replac convent requir simultan person social research conduct author inform comput scienc irvin coordin dual function groupwar calendar introduc challeng opportun interperson commun publicli displai implic individu user function system busi broadli effort make meet schedul indirectli affect fundament issu inform share tempor coordin critic social environ technolog interperson commun individu user environ evalu design groupwar calendar system calendar evolut technolog figur converg perspect groupwar calendar system groupwar calendar specif featur system calendar share network individu user calendar access gc user gc applic entiti confer room equip resourc collabor support simpl share view send special meet invit gc primari site research gc open wai calendar inform user default model reveal block free busi time default model reveal inform user network default model late make earliest groupwar technolog emerg cite illustr discuss impli simplic trivial gener groupwar complex collabor support system limit exist calendar research ubiqu convent calendar artifact steadi electron calendar empir research conduct convent calendar electron calendar technolog kellei earli empir work convent calendar artifact inform design calendar subsequ studi electron calendar primarili individu payn point challeng dual natur network calendar studi electron calendar featur design al address impact featur calendar share sf address social impact calendar commun devic grudin subsequ point import adopt issu meet schedul focu observ subsequ work grudin identifi set factor contribut widespread adopt focu impact calendar function examin interact person social trial found insuffici made calendar maintain calendar worthwhil studi sun microsystem intern develop gc ñ ñ gc match rapid corpor growth hundr todai compani sun unusu reason gc wide long durat highest inform share compar commerci content calendar readabl default intern network custom chang access user maintain default data collect combin ethnograph techniqu includ interview multipl member workgroup select organ total observ includ video record work environ calendar collect case subject paper sampl collect document includ orient train intern web page calendar usabl report survei administ email distribut rate survei question inform qualit interview data collect earli phase studi survei assess gc determin broadli find interview appli compani qualit quantit data set highli consist demand activ calendar schedul underpin design metaphor physic world assist design good heurist develop fall short superfici assumpt easili artifact calendar calendar form function format locat calendar function afford result kellei found uniqu publish calendar format station weekli format afford function inform format includ appoint finer granular minut unit refer calendar intend track compar addit space record inform calendar devot blank page render locat calendar artifact signal access hallwai project planner intend commun import event deadlin workgroup invit encourag read social sanction limit content authorship desk organ natur access social sanction deem quickli organ find whereabout owner wai peopl interact calendar extend activ meet schedul call rang activ calendar emploi calendar tempor orient calendar orient time refer determin year orient event time relev relationship calendar rel current figur number dai left summer holidai prepar upcom meet schedul schedul complex task balanc constraint prioriti schedul appoint involv manag compet mean appoint juggl move schedul task appoint typic made requir met track schedul activ advanc record event happen typic refer medic spend habit exampl thing track remind calendar assist remind user futur event user includ inform aid recur list ñ inform exist fact remind opportunist ñ schedul remind deadlin occur dai payn event ñ remind person relat task suit note calendar artifact record note meet product intent associ point time retriev futur retriev recal tempor associ inform assist retriev recal inform record calendar retriev opportunist subject calendar locat spell lost phone number record reconcil calendar design afford discuss technolog adopt restrict aggreg user broad view social organ adopt ultim accomplish user time major hurdl gc reconcili individu calendar demand afford calendar support heavi calendar reconcili import calendar work habit extend discret appoint electron calendar poor substitut find wai reloc supplement inform meet busi contact part particip gc risk heavi calendar user competit calendar artifact attract benefit gc kind calendar peopl attempt emploi multipl calendar artifact approach mainten multipl artifact rare calendar artifact lose battl infrequ errat calendar requir adopt make calendar mainten simpl attract user habit paper calendar appeal electron calendar potenti hold great appeal calendar work calendar cyclic monthli yearli base comput autom suit task abil perform singl entri weekli staff attract automat remind form dialogu gener entri repeatedli cite sun survei subject cite import cm featur recur appoint set autom remind repres long make calendar appeal user peopl infrequ user appoint user check calendar frequent enter greatli reduc opportunist remind appoint social coordin reason particip user make tradeoff person calendar support interperson commun groupwar calendar system creat opportun social coordin introduc opportun challeng notion person privaci control inform configur calendar manag special characterist calendar system impact interperson primari issu inform disclosur mechan meet schedul closer examin function calendar reveal addit coordin challeng opportun artifact tempor clock system make time tangibl natur artifici boundari ñ year system artifact paper electron calendar time system manipul exchang meet hour allot time splice event make calendar peer judgment infer open calendar system inform time creat opportun peer judgment time alloc open calendar system creat opportun calendar coordin colleagu make infer qualiti time alloc make infer workload number appoint natur appoint issu address depth paper interperson boundari manag unpack privaci privaci regul central adopt open model gc privaci broad serv subtl mean disclosur control respect domain network primari privaci concern issu privaci concern organ matter content privaci concern person privaci inform consid total consid person privat appoint good social sensit inform implic person privat calendar owner frequent cite intern job interview includ entri calendar make colleagu compani secur inform proprietari reveal busi strategi appoint privaci concern person privaci time concern judgment made alloc time control access open calendar relinquish control schedul specif concern relinquish control access repres schedul manag privaci wai manag calendar privaci particip open calendar system sun involv combin techniqu util technic mechan strateg inform access set global calendar local user restrict explicitli privaci set option includ displai appoint privaci set explicitli control interperson boundari entri techniqu appoint left readabl protect privaci calendar owner inadvert control access make entri restrict audienc understand mean list suffici remind calendar owner pick child signal group member appoint colleagu intend return shortli entri busi appoint omiss user simpli omit appoint network calendar record memor control sensit interperson boundari unambigu delimit person inform space schedul schedul work time calendar peopl particip gc impart feel control time time protect fake appoint work minim possibl attend meet practic emploi judici expect cooper groupwar system cap excess block work invest make calendar accur act proxi calendar reciproc reciproc plai critic role gc peopl strongli influenc calendar open reinforc time calendar access set ñ restrict restrict ñ colleagu similar access configur calendar open larg part base secur calendar restrict close calendar challeng norm perceiv reciproc trust offer calendar open give pocket user social network develop norm realiz group handl calendar differ norm open suggest group local norm calendar meet arrang tout applic drastic improv effici meet schedul cm sun part meet schedul survei respond report calendar meet arrang cm meet respond report read calendar locat colleagu addit survei qualit data share calendar serv varieti function meet sun imagin free busi time design sun view calendar content detail view time open meet arrang assess qualiti free time calendar examin immedi free hour give indic colleagu time meet requir meet held requir travel traffic big deadlin preclud meet frequent make kind determin hope reduc interrupt negoti gc function distribut inform peopl organ synchron work inform access distribut calendar inform review locat assess avail provid supplement includ contact inform specif meet verif calendar confirm meet agreement inform retriev calendar resourc find inform locat meet calendar organiz learn open act repositori great deal infer organ simpli read calendar synchron synchron aspect work calendar typic work home upcom deadlin meet signal offic action deadlin schedul adopt put schedul interdepend schedul made explicit open util support coordin evolut user support import part busi activ ñ meet ñ potenti support coordin meet technolog constraint affect larg scale viabil technolog depend reason conson organiz cultur theori describ process technolog behavior build theori social process interact human actor structur featur structur featur includ norm ñ intang compon organ employ structur properti human agent product work structur continu legitim exist human agent emploi technolog structur properti organ creat chang human human accomplish describ dualiti technolog develop environ earli design develop social design choic understood reson calendar commerci develop intern earli institut properti sun provid high freedom technolog develop individu oper code develop function earli calendar program develop set direct calendar share open calendar model ñ calendar read access ñ consist earli cultur compani growth put demand creat organ technolog commerci calendar manag appropri product system compani commerci time busi oper impact earli design choic open calendar environ surviv level sustain compani rapidli grew peopl sun environ fewer technolog obstacl overcom industri longer small unix shop decad ago sun todai larg corpor product function requir varieti job previou unix experi survei data user maintain default access leav calendar readabl sun practic explain user passiv custom default set ñ long establish hci research ñ process technolog similar result studi gc user maintain access default set ñ default displai avail model gc compani work major user maintain default social impact evolv design condit chang environ put restrict technolog direct impact technolog design fourth access set ñ set execut system command appoint time enter calendar ñ remov compani grew heterogen respect job execut set risk comput secur ñ virtu busi sun ñ risk compani secur design engin limit rang privaci access set incarn cm met user full rang control specif control retain abil technolog control access import featur gradual ad time zone compat import sun expand distribut technolog specif ñ administr assist ñ found technolog conduct awar calendar manag spread compani mechan structur iter design featur structur user invok calendar read featur everydai languag direct ñ presenc schedul system institut momentum serv room reserv function scope calendar manag converg perspect examin situat gc address demand calendar technolog interperson commun coordin medium coevolut technolog organiz environ final examin situat gc requir interact perspect final converg perspect reveal sanction affect gc interperson technolog infrastructur regul combin condit result primarili interact calendar highli public configur institut tempor coordin sun enjoi tempor possess good deal control work time work ethic stress person qualiti complet compar attent work perform expect vari arriv depart work convent busi schedul vari daili attend person appoint work dai flexibl schedul make requir coordin colleagu workplac convent busi hour convent busi peopl reliabl predict colleagu greater concurr work hour opportun interact colleagu flexibl window time dai week colleagu narrow calendar manag plai import role support tempor coordin commun enabl peopl plan interact reduc depend chanc interact cm substitut elabor tradit offic board board exist demand tempor coordin propel support peer pressur deliveri return great deal tempor convei avail sourc peer pressur individu calendar calendar colleagu expect refer calendar reduc interrupt calendar owner reciproc peer pressur sustain gc technolog constraint affect social interact technolog constraint indirectli regul privaci enabl widespread practic readabl calendar sun technolog infrastructur support cm limit easi calendar access earli design suit smaller sun scale requir user calendar ñ calendar web page connect remot calendar convent design influenc earli environ reason design legaci continu make open calendar viabl face rapid corpor growth earli sun mere fraction hostnam easili rememb usernam workstat user equal uniqu machin hostnam locat calendar compani inform locat requir extra step obstacl addit step repeatedli note inform requir work reduc interact addit privaci regul condit indirectli control privaci highli open calendar environ technolog note restrict calendar calendar reciproc mean colleagu share calendar social anonym control access peopl read peopl compani retriev calendar address turn read calendar privaci breakdown expect addit treatment issu calendar interact calendar world readabl support group interact open calendar group membership boundari vigil mainten access list groupwar design implic design individu support good fit work practic bring relief individu user demand support applic expect integr fundament aspect work groupwar technolog pai attent function physic analogu perform adopt appeal appeal import adopt satisfi individu user sustain long critic mass user achiev groupwar benefit commenc potenti tradeoff exist maxim individu support privaci regul groupwar system support person greater chanc open threaten imagin calendar manag ñ support calendar work ñ close model paper open widespread build seemingli small design featur largest impact groupwar function access set default ñ possibl accid design ñ constrain rang behavior gc combin user passiv intern develop default set rare chang groupwar featur lower central norm practic groupwar establish featur support meet invit gc natur determin inform share establish compar compani sun user prefer read detail calendar make inform invit compani system send meet invit colleagu detail calendar adapt groupwar groupwar design adapt overlook import design affect fundament model collabor default set compani acquir groupwar impact default make configur initi softwar develop oblig mackai softwar manufactur impact deliv set default valu version softwar ship unlik featur fix subsequ affect individu pattern softwar develop make compani modifi default set suit condit seemingli trivial applic modifi summari calendar manag grown quiet import part busi oper sun network applic sun cm sit fundament substrat social organ ñ addit support meet cm support tempor coordin gener earli design configur access set default maximum share calendar inform benefit open system environ enjoi tempor cm fill commun whereabout avail stimul peer pressur adopt groupwar calendar system role calendar artifact work integr understand place order kind technolog depend time function inform made public calendar cm conceiv system distribut user modifi exist calendar practic suit electron medium user modifi calendar practic calendar suit public forum ñ potenti thing idiosyncrat person calendar behavior technic mechan emploi individu user delin privaci boundari environ calendar open compani network featur custom social environ calendar reciproc social afford technolog influenc peopl handl calendar person artifact social space condit conceptu constrain space calendar access viabl larg scale cm role organ user depend function distribut inform system support coordin subtl peer institut pressur calendar open support benefit creat environ protect liber interpret privaci acknowledg jonathan john mark tom ellen ken ashlei support contribut work don john harri mike ellen isaac rick assist sun microsystem kent sullivan marshal microsoft provid invalu assist microsoft survei roi wayn jonathan grudin deserv special paper work part fund nsf grant nsf graduat fellowship refer visual calendar schedul group meet acm sf social psycholog factor influenc design offic commun system acm sf strategi encourag success adopt offic commun system acm transact offic inform system put innov adopt strategi multimedia commun system commun acm user interfac person calendar program vassili human factor interact proc nyu symposium user interfac cscw applic problem design evalu organiz interfac acm groupwar discret proc european cscw schmidt kluwer academ jf person implic journal occup electron calendar assess user current technolog acm transact offic inform system user customiz phenomenon sloan school manag mit cscw applic problem adopt interdepend work tool acm jn sg group schedul tool journal collabor histori interact technolog interact dualiti rethink concept technolog organ organ scienc calendar challeng groupwar technolog info comput univ irvin sj understand calendar human comput interact social psycholog privaci american journal sociolog hidden schedul calendar social life univ chicago press
IR/157 5 relat learn proposit inform extract case studi dan roth yih depart comput scienc illinoi abstract paper develop paradigm relat learn learn relat inform proposit mean paradigm suggest tradeoff tradit approach problem ilp approach result enjoi advantag paradigm flexibl proposit includ probabilist evalu approach import task inform extract show outperform exist method order magnitud effici introduct relat learn problem learn structur concept definit structur exampl relat model describ problem domain exampl learner term object object relat simpl proposit varieti ai problem natur languag understand relat visual interpret collect object relat hold fundament problem learn definit relat concept interest term relat exampl includ problem identifi noun phrase sentenc term inform detect face imag defin polici map state goal action plan situat case natur repres learn concept proposit lose inher domain structur gener recent realiz renew interest studi relat learn induct logic program activ subfield machin learn address relat learn natur approach appli task research support nsf grant onr muri award ilp method induct relat structur unbound data theoret practic render unrestrict ilp method imposs studi ilp suggest rule sever restrict learn problem intract success heurist learn ilp practic difficulti brittl ineffici ilp system research develop problem ilp system escap problem search control ineffici larg scale domain nlp paper develop paradigm relat learn gener effici proposit learn relat paradigm fresh restrict ilp system make order work practic suggest altern enjoi advantag tradit approach paradigm flexibl proposit includ probabilist maintain advantag ilp approach effici improv express robust center paradigm knowledg languag effici repres evalu rich relat structur proposit learn proposit algorithm result relat concept descript outcom paper evalu paradigm domain inform extract nlp task extract specif type relev item unrestrict text relat learn method appeal learn domain target concept inform domain relat develop system base learn compon system make featur effici learn algorithm suitabl natur paradigm show standard learn algorithm naiv work comparison show approach outperform system order magnitud effici proposit relat section present knowledg languag subset order logic collect structur defin element domain relat languag restrict order languag repres knowledg respect domain restrict appli limit formula languag collect formula evalu effici instanc defin primit formula limit scope quantifi gener formula defin induct term primit formula restrict depend relat structur domain emphasi local respect relat structur repres graph domain element languag encod order relat structur proposit support learn includ gener proposit algorithm probabilist algorithm element languag approach extend previou relat construct ilp khardon technic relat rest section present main construct languag omit standard definit concentr uniqu characterist gener detail vocabulari consist predic connect definit primit formula defin term variabl constant term atom formula atom variabl atom formula atom formula primit formula primit notic primit formula scope quantifi uniqu predic occur atom formula call atom formula proposit quantifi atom quantifi proposit inform semant quantifi connect usual move extend languag discuss domain notion instanc definit languag defin domain consist structur element hv gi collect type element set partial order partial order acycl graph set edg constant assign element assign map fragment fig form domain consist word pm phrase pm consist link list solid line dash gener figur fragment articl complex tree sentenc notion type classifi element languag properti predic type domain type distinguish set main set object set attribut defin type predic type predic argument element argument element type predic describ properti element written semant hold predic type element argument predic defin element type node graph edg element repres object world nlp applic sentenc document predic type describ properti element spell syntact tag phrase graph describ relat object word subject verb gener collect current interpret construct singl definit instanc list set domain element truth valu instanti predic instanc formula uniqu truth defin induct truth valu predic semant connect primit formula scope quantifi uniqu predic occur atom properti clear extend languag maintain properti proposit formula time evalu truth atom evalu time evalu simpli evalu atom separ version subsumpt formula proposit instanc boolean function variabl evalu time evalu time sum formula argument relat gener function definit gener formula oper structur introduc mechan gener express formula respect structur restrict formula gener definit formula map instanc truth activ truth true denot set instanc instanc space formula relat instanc fragment illustr activ relat relat activ write explicitli formula domain infinit domain problem domain inact relat vastli activ relat definit collect relat relat gener function map map set element satisfi thought defin larg space formula instanc concret formula collect gener thought rang relat imposs list formula number predic advanc formula kind instanc time activ relat gener order defin collect formula defin famili output defin formula defin induct relat calculu alphabet calculu consist basic call sensor set connect connect alphabet sensor vari domain domain sensor encod basic inform extract instanc uniform incorpor extern knowledg sourc aid extract inform instanc definit sensor relat gener function map instanc set atom formula evalu instanc sensor output atom formula rang activ sensor commonli nlp word sensor word output activ relat length sensor phrase output activ relat output semant class word tag output tag word word len sensor deriv inform directli raw sensor extern inform sourc wordnet tag sensor tagger mechan relat calculu defin oper mention focu mechan bind mechan defin quantifi formula definit set element domain instanc gener formula rang activ due element denot wai defin focu set explicitli structur focu set free variabl fol relat calculu induct gener appli connect quantifi exist standard connect defin output formula type defin def detail describ import type oper relat calculu structur oper oper exploit structur properti domain express order defin gener interact effici evalu due graph structur structur colloc respect defin definit colloc restrict conjunct oper evalu chain length chain formula gener colloc gener fv oper mean formula output activ formula form rang rang conjunct produc formula appli respect graph repres linear structur colloc simpli gener formula correspond ngram fragment john extract bigram similarli colloc defin colloc oper respect chain restrict conjunct oper evalu chain differ formula gener chain subset element gener notic primit formula singl predic structur properti restrict effici evalu structur oper defin constrain formula evalu object incur cost enlarg scope free variabl enlarg scope requir structur model effici evalu prop addit cost find chain graph comparison ilp method proposit learn relat featur paradigm relat learn ilp method induct relat structur unbound data structur express match proposit theoret practic render unrestrict ilp method imposs studi ilp suggest rule sever learn problem intract cohen success heurist learn ilp program de made algorithm restrict order facilit ilp practic difficulti brittl ineffici ilp system approach offer tradeoff suggest common restrict made current ilp system paradigm domin tradit ilp approach case altern offer provid address relat larg scale domain nlp address kei issu develop understand suitabl kei differ tradit ilp approach structur search space gener part search procedur attempt find good bind ilp program search gener front data driven ground free variabl learn algorithm find search control method ilp method analog express give order featur kei cite advantag ilp method abil incorpor background knowledg incorpor flexibl notion sensor sensor treat inform readili extern inform learn concept uniform basic build block ilp present sec predic element repres ground term similar work structur oper avoid problem approach relat featur gener provid uniform domain learn algorithm appli algorithm easi straightforward straightforward probabilist model natur gener relat probabilist framework turn ilp method suffer brittl ineffici research develop problem ilp system time complex problem ilp proposit learn typic lot effici due fact gener larg number relat featur adopt specif learn shown sec discuss direct express issu mention context linear threshold function concept relat featur extract advoc ilp method suggest rich express power fol advantag problem nlp strong intract practic system appli restrict depth number predic sever restrict learn concept small construct colloc gener relat featur conjunct predic similar output ilp program ilp program repres disjunct linear threshold function relat featur express learn smaller program illustr assum seminar fragment repres speaker speaker dr fname ilp rule extract speaker word target phrase target phrase word charact target phrase relat featur space element rule conjunct featur collect form disjunct featur space learn effici linear threshold element mention learn linear threshold element exist featur effici algorithm suitabl learn number potenti featur activ small fraction relev target concept case studi inform extract inform extract natur languag process task process unrestrict text attempt extract specif type item text form shallow text process attract attent recent grow intellig process huge amount inform form text document learn method earlier aid part system soderland argu convincingli craven relat method order learn directli extract desir item document reason target concept requir relat sourc document learn requir induct structur exampl fol previou work demonstr success ilp method domain ideal domain studi relat learn paradigm problem descript task defin locat specif fragment articl predefin slot templat articl document consist sequenc token data experi set seminar announc cmu goal extract type fragment articl describ start time end time locat seminar speaker system pick fragment slot fragment repres correct predict wrong predict case articl doesnt slot extract relat featur basic strategi solut learn classifi discrimin specif desir fragment gener exampl type fragment identifi candid fragment document fragment fragment annot fragment small number desir inform candid defin featur consist activ featur extract fragment repres token posit token data set origin collect newsgroup annot dayn articl document defin extract featur left window target window window size domain form region type element word element phrase element target specif word element free border phrase element free defin relat featur rel section provid exampl experi architectur exampl task accomplish learn stage slightli snow classifi specif tailor larg scale learn task snow learn architectur learn network linear target repres linear function common featur space snow successfulli varieti task natur languag visual process roth snow built featur effici learn winnow ideal learn approach complement discuss snow classifi predict mechan activ valu target reli directli activ comput sigmoid function linear sum normal activ shown distribut function reli heavili robust architectur stage reduc amount candid fragment small pick fragment preserv fragment learn classifi theoret justif architectur present companion paper architectur express classif system elimin neg exampl significantli reduc number irrelev import issu small data set common properti task neg exampl extrem posit exampl repres legitim seminar announc data fragment repres legitim slot stage attempt filter neg exampl elimin posit exampl view classifi design achiev high classifi stage aim high filter consist learn fragment filter meet singl featur fragment doesnt featur activ posit exampl gener fragment confid threshold system loc speaker prec rec prec rec prec rec prec rec rapier srv whisk tabl result seminar announc task criterion turn exist featur activ posit exampl length fragment satisfi satisfi fragment word hold speaker fragment criterion implement reli robust confid problem find threshold minimum activ valu posit exampl train data threshold type exampl lower activ valu filter stage differ crude filter target word len phrase element left loc extract posit word window fragment surviv filter stage classifi snow slot addit collect appli enhanc candid accur classif remain fragment annot posit neg exampl train classifi remain fragment evalu learn classifi determin fill desir slot stage classifi type fragment exampl run classifi ad stage locat set structur conjunct word directli left target word tag window rel structur conjunct word left tag tag window made classifi fragment classifi type classifi decid fragment type chosen base activ classifi slot locat speaker tabl filter effici result experi methodolog evalu metric system previou work system rapier srv whisk test data set data randomli split set equal train test report result averag run perform quantifi term percentag correct predict recal percentag slot identifi report pr result shown row tabl result system test task condit except result valid document randomli select train set system inform sourc word document system tag srv predic captur po inform extent version rapier semant system sensor result incorpor inform addit experi proposit naiv algorithm nb set featur gener relat paradigm result good qualiti classifi import issu experi proposit algorithm exhibit fact relat paradigm gener simpl mind algorithm competit top paradigm exploit relat natur data compar ilp method outperform exist system slot note output system make similar type relat featur collect conjunct rule repres linear function difficult isol contribut architectur qualiti result incorpor learn architectur indic flexibl approach advantag learn proposit mean tabl insight show averag perform filter stage column show ratio train test exampl pass filter column list ratio posit exampl test set filter fragment reach stage articl fragment repres classifi pick correct relat method back fashion clear varieti ai problem fundament learn repres relat concept term relat inform extract task extract relev item unrestrict text task paper suggest paradigm relat learn learn relat inform proposit mean argu paradigm tradeoff tradit approach problem ilp approach result enjoi advantag suggest paradigm flexibl proposit algorithm includ probabilist approach address natur gener problem relat probabilist import problem studi lot recent paradigm exemplifi import task inform extract base develop approach learn shown outperform exist method order magnitud effici work open direct work relat learn knowledg practic effici solut nlp problem refer califf moonei relat learn rule inform extract nation confer artifici roth snow learn architectur technic report uiuc cs cohen page polynomi learnabl induct logic method result gener page cohen logic neg result journal artifici intellig craven slatteri relat learn statist predic model hypertext machin tag progol intern workshop induct logic page czech springer lnai freitag machin learn inform extract inform domain machin gold roth winnow base approach spell correct machin valiant relat learn nlp linear threshold element proc intern joint confer artifici page dzeroski induct logic program learnabl sigart grobelnik learn definit relat machin learn volum page springer verlag littleston learn quickli irrelev attribut algorithm machin lloyd foundat logic raymond moonei induct logic program natur languag process volum page de muggleton de raedt induct logic theori method journal logic quinlan learn logic definit relat machin riloff automat construct dictionari inform extract task nation confer artifici page ahuja learn recogn object roth learn resolv natur languag unifi approach nation confer artifici page soderland lehnert trainabl modul inform extract journal artifici intellig soderland learn inform extract rule free text machin
ML/158 6 direct factor mdp dale schuurman depart comput scienc waterloo abstract present simpl approach comput polici factor markov process optim function approxim compact linear form method base solv singl linear program approxim linear optim function appli ecient constraint gener procedur obtain iter solut method tackl linear program direct linear program approach yield signi reduct comput time approxim method reduc hour qualiti solut produc linear program approxim error approxim class speed advantag larger approxim class achiev similar error reason time introduct markov process form foundat control uncertain stochast environ reinforc learn standard method linear program produc optim control polici mdp express explicit function state transit model repres tabular manner explicitli state space render approach impract toi problem real goal achiev solut method scale size state size state space exponenti basic solut method scale exploit structur mdp model structur reward function state transit exploit structur approxim optim function credibl attempt gener exploit type structur surprisingli dicult formul optim method handl larg state descript simultan produc function polici small approxim error bound tightli paper investig simpl approach determin approxim optim polici base simpl direct linear program approach speci idea approxim optim function formul singl linear program exploit structur mdp function approxim solv linear program ecient preliminari mdp nite state action space goal maxim nite horizon discount reward state repres vector length simplic assum state variabl xn total number state assum small nite set action fa mdp de ned state transit model speci es probabl state current state action reward function speci es reward obtain action state discount factor problem determin optim control polici achiev maximum expect futur discount reward state understand standard solut method de ne auxiliari concept polici function ir denot expect futur discount reward achiev polici state turn sati es xed point relationship current state expect valu futur backup oper oper arbitrari function state space import backup oper de ned respect xed action function ir denot expect futur discount reward achiev action state polici satisfi arbitrari function greedi polici respect de ned arg max denot optim polici denot relationship max de ne arg max de fundament method calcul formul polici start arbitrari polici iter return start arbitrari function iter kf return linear calcul arg min subject return method shown produc optim polici mdp di erent wai approach share fundament limit scale feasibl size state descript approach work explicit polici function exponenti exploit structur scale larg state space exploit substanti structur mdp adopt form approxim optim function polici speci structur assumpt paper factor mdp linear function approxim assumpt sucient permit ecient polici optim larg mdp assumpt approxim solut obtain problem involv state quickli factor mdp spirit de ne factor mdp repres compactli addit reward function factor state transit model speci assum reward function basi function de ned small set variabl assum state transit model repres set dynam bayesian network state dbn de ne compact transit model direct bipartit graph connect state variabl consecut time step denot parent successor variabl dbn action ecient optim assum parent set small number state variabl previou time step probabl successor state predecessor state action product jx main bene factor larg mdp encod function jx depend small number repres small tabl ecient combin determin point factor mdp yield feasibl method determin optim polici main problem optim function gener compact optim obtain exact solut requir return explicit turn factor mdp interact linear function approxim linear approxim central tenet scale approxim optim function calcul numer scheme investig approxim optim function polici compact hierarch decomposit tree diagram gener linear function neural network product expert simplest gener linear form investig function form xed set basi denot variabl basi depend combin linear function factor mdp opportun feasibl approxim rst main bene combin linear factor mdp result appli backup oper linear function result compact function speci calli de ne rewrit jx press fact factor mdp expect futur compon approxim depend current state variabl direct parent variabl mdp connect variabl set larger abil repres function compact linear form immedi feasibl implement greedi polici arg max de nition ecient determin turn permit feasibl form approxim easili implement main problem factor form xed polici necessarili compact form depend state variabl jx product term depend state variabl introduc addit assumpt special action mdp action factor transit model di er small number state variabl greedi polici compact form repres formul feasibl version approxim approxim polici start default polici iter arg min max approxim start arbitrari iter arg min max kf part iter algorithm determin arg min max involv solv linear program subject fw linear program problemat involv exponenti number constraint central achiev show system constraint encod system constraint compact form idea construct realiz search max min linear function compact basi conduct organ organ search encod equal constraint system construct approxim solut mdp state variabl gener hour approxim polici iter main observ solv linear program conduct approxim iter simpler ecient approxim linear program approach directli approxim linear program rst idea simpli observ factor mdp linear approxim immedi directli solv linear program approxim optim min subject restrict linear form xed basi yield linear program basi weight shown factor turn approxim iter ectiv iter fact diverg theori linear program feasibl size formul result outlin easi show minim object encod compon easili precomput assign small set variabl basi function exponenti constraint structur form specif repres simpl basi techniqu encod constraint system enforc state space action implement approach test test problem problem direct network comput system xn system system spontan probabl probabl immedi machin network machin reward state simpli sum system bonu reward system consid network architectur shown figur transit probabl discount factor rst basi function consid indic variabl constant basi function report result network architectur shown figur approxim linear program method label alp compar approxim polici iter strategi api speci probabl estim number api graph present comparison meant indic gener run time method problem probabl valu signi cantli ect implement implement base solv linear program preliminari result support hypothesi direct linear program ecient approxim polici iter problem type advantag linear program approach simpler program involv solv lp direct lp approach requir mdp special default action function directli extract arg max easili discuss note solv linear program ecient iter gener constraint factor mdp linear approxim ecient search maxim violat constraint linear ectiv gener linear program solv ecient formul speci procedur exploit feasibl search techniqu minim linear function discuss ecient gener small set critic iter grown nal solut identi ed start con comput arg min con con fx ak solv min subject con min hj qk server time alp constraint alp ub bellman rmax server time alp constraint alp ub bellman rmax figur result procedur main bottleneck previou method gener solv linear program small number constraint activ solut violat ad violat constraint proce figur show produc approxim solut alp tini fraction time extrem case produc approxim solut method hour problem reason speedup explain result show number constraint gener method investig requir fulli outlin robust constraint gener method greedi constraint gener scheme produc feasibl number constraint potenti bene ts conserv gener constraint clear main drawback direct linear program approach approxim polici iter alp incur larger approxim error api bound approxim error turn api alp return linear approxim true function cientli calcul bound approxim error number estim graph exact probabl comput simul report assert exact comparison perturb probabl ect perform method repres comparison gener perform algorithm problem exploit structur result assert max max case upper bound turn bound quantiti feasibl max max min min max upper bound error optim function calcul perform ecient search max figur show measur error max ub factor larger linear program approach approxim polici iter basi api inher advantag limit exhaust basi approach converg optim indic comput cost requir achiev similar bound approxim repeat experi larger basi set includ indic pair connect variabl result model report figur show bound approxim error reduc predict cost comput time run time appreci smaller polici iter method linear program er comput advantag polici iter context wide held inferior solut strategi explicitli repres mdp refer bertseka dynam program optim volum athena scienti bertseka tsitsikli program athena scienti goldszmidt stochast dynam program factor arti cial intellig boyan tempor di erenc learn dietterich hierarch reinforc learn maxq function decomposit parr project factor mdp ijcai koller parr comput factor function polici structur mdp koller parr polici iter factor mdp martin larg scale linear integ optim markov discret dynam program hinton free energi repres multiag reinforc learn task boutili approxim polici construct diagram van roi learn function approxim complex process phd william baird tight perform bound greedi polici base imperfect function technic
AI/159 2 ieee aug control hybrid expert system jim ioanni school engin dept comput engin greec comput technolog po box greec abstract present architectur intellig tutor system teach high school teacher technolog offer unit cover user knowledg level characterist tailor present educ materi ai techniqu model make pedagog achiev expert system hybrid knowledg formal integr symbol rule neurocomput introduct intellig tutor system extrem popular year shown effect perform motiv emerg www system present architectur teach technolog high school teacher output research project aim develop method tool deal person knowledg background skill figur depict basic architectur consist domain structur domain educ user model record inform pedagog encompass knowledg pedagog user interfac base expert system aim control teach process expert system emploi hybrid knowledg call elabor system kei aspect figur architectur domain knowledg domain knowledg knowledg subject taught actual teach materi consist knowledg concept unit knowledg concept refer basic piec knowledg domain concept link concept link denot prerequisit concept concept network form repres pedagog structur domain taught unit constitut teach materi present system user web page unit number knowledg concept user requir prerequisit concept order grasp knowledg unit unit present copyright ieee comput societi reserv system variant page present facilit select order domain knowledg includ unit base gener attribut main attribut unit level pedagog type multimedia requir internet user model compon user model compon record inform user vital system oper model system user mechan creat model user model consist type person data interact knowledg concept student characterist student characterist knowledg concept directli affect teach interact paramet indirectli interact paramet form basi user model constitut inform record interact system repres thing type number unit type amount answer student characterist includ item multimedia type prefer present domain knowledg learn abil internet student characterist repres stereotyp model mean user assign predefin class base acquir student characterist discern directli obtain infer directli obtain characterist obtain valu directli user valu infer infer system base interact paramet knowledg concept base classif deriv valu infer characterist user model updat teach process knowledg domain repres combin stereotyp overlai model stereotyp denot domain knowledg level overlai model base concept learn unit concept denot user knowledg level concept pedagog model pedagog model repres teach process knowledg infrastructur order tailor present teach materi inform user model shown figur pedagog model consist main concept evalu modul task concept construct lesson plan select order concept base user knowledg user domain knowledg concept level difficulti link connect concept plan construct concept select order unit suitabl present student characterist user model unit account evalu modul evalu user perform updat user model assign knowledg valu concept base interact paramet updat infer student characterist base classif user model compon user gain accept knowledg level concept belong initi lesson plan creat expert system expert system knowledg formal base type hybrid rule integr symbol rule neurocomput attract featur improv perform symbol rule simultan retain natur modular contrast hybrid approach construct empir data symbol rule individu train lm algorithm case insepar train special techniqu pedagog model user model compon construct infer mechan base backward chain strategi refer kobsa vassileva adapt hypertext kluwer academ improv perform symbol intern journal artifici intellig world pp modular hybrid knowledg base expert intern flair aaai pp acknowledg work support greek framework research project
IR/160 5 paper featur select web applic roc inflect power set prune fran eric steve lawrenc lee gile nec research institut independ nj usa fran nec research institut independ princeton nj usa inform retriev data mine featur select web applic roc inflect power set prune fran eric steve lawrenc lee gile nec research institut independ nj usa abstract basic problem inform process select featur ensur event accur repres classif simultan minim storag process irrelev margin import featur address featur select procedur perform search featur power set find smallest subset meet perform requir major restrict exist procedur typic explicitli implicitli assum fix oper make limit statist structur featur power set present method combin design procedur finit direct set structur receiv oper curv featur determin maxim size featur subset rank problem search restrict smaller result reduct comput complex optim receiv oper curv end user select oper point cost function optim algorithm produc natur method boolean minim featur combin describ data oper point describ data common featur threshold tfidf data show result perform automat boolean queri modif gener distribut nich meta search engin introduct basic problem inform process select featur ensur event accur repres classif simultan minim number irrelev margin import featur select smallest size featur meet perform requir reduc storag requir comput requir ensur good gener final classifi featur select problem acut oper point end user unknown meta search load bandwidth requir result desir oper point queri secondari sourc store index massiv quantiti web risk exact cost risk function end user advanc paper address featur select problem classif applic discret featur set object select parsimoni subset featur meet rang futur classif perform requir contrast featur select procedur explicitli implicitli specif oper point optim complet receiv oper curv receiv oper curv curv minim complet classif perform subset featur curv complet summar optim tradeoff independ dimens featur space roc classifi featur subset yield maxim recal level roc depend statist data roc curv captur ratio probabl true probabl occur dynam environ web flexibl redesign classifi optim featur select requir comput roc subset rank subset perform size optim featur set depend oper minim cover set select index number practic difficulti ideal approach size featur power set exponenti number prevent exhaust featur subset modest size optim effici procedur calcul roc singl subset densiti long design procedur comput roc data finit comput roc subset larg set class densiti element combin make featur select remark challeng problem exist featur select procedur problem complet roc implicitli assum oper point approach classif rate singl scalar metric proxi perform subset excel approach sophist notion markov implement metric entropi estim assumpt result significantli inferior perform oper point cost function lack flexibl adjust oper environ classif perform complet summar scalar obviou problem result incomplet understand perform exist induct procedur small data set research focu strategi guid search featur power assum perform subset reliabl cross valid control subtl crucial point order compar featur induct algorithm classifi structur subset optim exhaust induct approach exist featur select algorithm satisfi properti arbitrarili larg featur subset addit method differ exist approach due extens exploit statist properti induct algorithm finit data kei result analysi suffici data exist classif perform classifi obtain high probabl find optim classifi featur subset arbitrarili small featur subset size subset select procedur reliabl estim optim perform featur rank number featur limit approach dynam estim critic subset size dynam prune featur power reduc problem polynomi search problem paper arrang section formal featur select classifi design summar major statist result work start section defin filter structur form partial featur subset receiv oper curv show np design analysi combin roc filter structur defin method prune featur power set illustr perform algorithm synthet statist advantag classifi perform algorithm classifi structur manipul yield boolean minim featur combin describ data oper point describ data common featur threshold tfidf data section appli approach select featur repres confer call paper construct simpl classifi queri modif search engin subset classifi design section summar design recent result describ perform method appli finit data assum fx assum featur featur threshold tfidf valu obtain document analysi carri straightforward manner assum valu finit alphabet assum input space class condit probabl fx fx featur subset consist obtain set input fx sampl denot bit string length adopt convent denot vector symbol vector element subscript frequent associ bit string integ featur subset classifi function assign element binari sequenc space form region class distinct classif rule separ class rule yield probabl alarm detect defin fx fx set ao oper point defin binari map featur set refer achiev oper set note switch output classifi oper point line connect oper point classifi produc oper point convex hull achiev oper set implement receiv oper curv set oper point yield maxim detect rate alarm rate roc effici summar inher difficulti separ class subset subset classifi ly roc refer roc support classifi exhaust classifi subset practic imposs trivial small case induct procedur requir find roc support classifi design procedur solut problem effici obtain roc support classifi class probabl infinit data method provabl effici method obtain roc theori string rank likelihood ratio function fx fx roc support classifi provabl found order alarm perform success assign string order likelihood ratio true class region roc support classifi make discuss concret provid simpl simpl test subset true densiti function roc support classifi develop np design shown achiev detect rate alarm rate classifi classifi document relev featur featur featur design approach search problem find classifi function maxim reduc search space dimens search space dimens enorm reduct complex exhaust gener induct procedur author reliabl provid roc class densiti class condit distribut unknown statist estim finit label data set set class condit densiti sampl space classif problem gener sampl element yield valu assum class distribut independ finit data set drawn independ class condit sampl yield success symbol class assum class data label correctli data comput class condit histogram densiti estim likelihood ratio estim finit roc calcul appli np procedur rank histogram bin bin bit likelihood ratio estim map set classifi procedur yield estim roc support classifi complet discuss propag error occur design procedur found major trend import binari independ set sampl true true detect perform bound region sampl estim detect rate assum sampl classifi posterior distribut estim alarm rate similarli local true underli alarm import result classifi bound locat true oper point estim oper point arbitrari confid pure function number data sampl evalu bound independ featur subset size local probabl posterior probabl occur interv set oper point obtain estim detect alarm rate classifi produc np design procedur defin curv curv estim perform curv result impli accur reflect perform set classifi suffici number data point irrespect number featur result consist gener theori gener theori method palo hill climb ensur rank classifi account error estim variat method address problem ensur optim classifi set found issu discuss set classifi produc np design depend order sort likelihood estim featur set size sort order corrupt sampl suboptim classifi found statist sort error depend exact form underli distribut gener trend exist intuit explain densiti estim likelihood ratio estim depend histogram bin count mass distribut remain concentr bin featur dimens bin count likelihood ratio sort error classifi produc optim featur irrelev perfect random effect amount data spread bin bin small bin count high probabl sort error true perform order true probabl mass found bin bin estim densiti distinguish sampl uniform class densiti sort equal case sort effect perform random assign true perform classifi return np design approach curv featur subset size point improv discrimin offer addit featur defeat error sort true perform classifi approach curv number featur train data set evalu perform procedur yield roc estim call naiv estim perform curv result increasingli optimist perform estim intuit number bin ultim sampl obtain true class occupi individu bin np design procedur label bin class yield perfect discrimin train set statist effect combin yield effect illustr graphic figur number featur fix data true perform curv approach perform perform classifi accur simpli probabl find optim classifi search neglig naiv estim perform curv diverg estim perform increasingli optimist featur subset size point exist critic size rigor studi design induct procedur mechan search set exist estim roc possibl error scale properti cost comput present author expect threshold effect induct algorithm rank classifi singl oper point evalu true backward select procedur common assumpt irrelev featur easili detect depend commonli recogn requir induct algorithm return reliabl estim perform singl classifi subtl crucial point induct algorithm provid classifi structur rank subset remov remov optim exhaust classifi space pf pd roc figur classifi yield detect alarm rate determin roc curv estim perform curv summar estim perform set classifi produc np procedur finit data locat highli accur set classifi produc np procedur gener suboptim number featur bin label increasingli assign randomli approach curv naiv estim oper perform curv train data estim true perform classifi memor train data approach perfect perform complet satisfi requir arbitrarili larg featur subset induct method exist featur select method meet requir lesser requir consist rank amount data np procedur filter structur roc curv section show partial order defin featur order conjunct statist analysi prune featur subset space note roc curv subset subset optim depend desir oper point perform featur subset select base roc number optim rang power set order featur subset order call uniform prefer establish roc curv denot pf pd pd pf pf roc curv featur subset li roc curv featur subset properti defin filter structur set power set featur present subset worst optim bayesian fusion procedur subset roc uniformli prefer convex hull correspond sampl classifi structur properti trend shown figur defin forward featur select procedur automat estim size maxim featur subset rank procedur shown graphic figur compar set size convex hull compar roc estim obtain statist improv featur subset remov high roc curv subset accur lie inferior convex hull obtain subset individu formal establish absolut order featur power set order sort featur set subset size order dictionari order featur indic subset point reflect fraction total number subset search reach basic algorithm shown tabl algorithm order featur subset curv calcul store start singl element subset pf pd figur illustr select roc support classifi featur subset curv curv combin sampl yield roc curv convex hull curv featur subset prune search current subset randomli split separ subset compar convex hull smaller featur subset averag li statist buffer distanc convex set remov constant standard deviat beta distribut detect perform estim set size reach fraction addit test remov subset classif perform significantli obtain subset obtain test remov random label assign stage improv rate converg end run synthet test case illustr perform algorithm simpl introduc section add irrelev featur class addit featur uniformli white variabl problem perform classifi gener roc curv subset equal roc subset expect algorithm rapidli prune search space set element extra featur irrelev classif implement algorithm dataset sampl class sampl class assum total ten featur dataset class split initi execut calcul store randomli select subset calcul convex hull calcul dp tabl algorithm forward filter featur power set roc estim sampl sampl estim perform classifi test data cross valid exhaust featur subset subset calcul subset averag train set bia classifi detect defin averag vertic distanc calcul figur show valu scatter plot function fraction power set approxim mode shown figur support content gener diverg number featur result suggest addit approach prune power monitor prune subset averag bia exce threshold approach extrem reliabl practic bear investig suffici analyt result rigor defin threshold standard statist test properti beta distribut determin valid threshold algorithm tabl figur bia defin averag distanc function fraction featur space result individu subset curv show approxim mode region separ dash vertic bar correspond featur subset number element figur show fraction power set function current search posit subset consid full np procedur perform set prune due fall significantli convex hull subset due high accuraci random effect featur detect element subset consid due small size includ larg number larger major part power set rapidli prune procedur subset featur yield addit return ad featur chang critic filter exhaust figur curv show fraction featur power set direct calcul filter structur function fraction featur power set np estim perform curv label diagon correspond exhaust search figur show cumul fraction power set full np design function current search set power set curv show approxim featur subset larger subset elimin term actual processor result obtain number comput estim roc subset scale exponenti size subset complex implement major comput effort involv perform design subset featur due sort likelihood ratio histogram bin calcul classifi label convex approxim linear length histogram cost np design order log constant featur subset integ current technolog integ oper exhaust perform featur subset approxim featur hour comput prune subspac significantli depend critic subset size np design procedur break subset length small rel total number featur rough estim calcul filter exhaust figur curv show cumul fraction power set full np design function fraction featur power set curv label diagon referenc standard exhaust search region separ vertic bar correspond featur subset number element complex comput roc exhaust search subset size prune featur power set subset size comput problem chang admittedli polynomi problem critic subset size correspond limit approxim featur reduct repres improv size approxim practic size consid modest larg number featur prune approach combin heurist partit featur subset manag prune approach perform approach discuss note scope exist extend exist backward approach exploit fact featur subset critic limit search statist reliabl fashion queri modif text classif queri modif context build categori specif interfac user queri automat augment search term oper effect restrict queri result relev categori queri modif techniqu valuabl custom exist integr multipl distribut occur build categori specif meta search engin meta search engin forward queri larg number secondari search collat rank result central present user ad queri modif forward user queri secondari search fewer irrelev result return meta search reduc bandwidth consumpt comput load meta engin site advantag search servic inquiru inquiru download web page queri return meta search engin framework import predict recal alarm rate impli queri modifi search engin inform alloc server predict qualiti expect quantiti result produc search order result user queri modif fact search engin support boolean search queri modif gener conjoin user queri disjunct conjunct modifi gener featur bit string fx document featur featur extract procedur introduc part paper offer simpl eleg method comput suitabl boolean queri modif note binari express true class region roc support classifi encod modifi desir boolean form classifi subset featur correspond queri modif consist involv featur condit queri probabl retriev document desir categori maxim recal rate accuraci modifi concret assum class statist densiti simpl problem introduc section modifi recal expect posit retriev true class region classifi express modifi yield set document featur label data queri modifi extract featur select procedur obtain subset close convex hull construct number search engin modifi boolean express proprietari algorithm improv retriev rank point result curv correspond queri modif queri modif request nich search queri modif closest desir oper point practic queri modifi major area investig explor detail major problem secondari search engin limit oper queri length address problem framework applic procedur approxim simplifi modif appli boolean logic express simplifi minim lengthi express form hard problem queri modif gener categori defin track user onlin approach roc support classifi queri modifi number term queri equal rank classifi boolean featur subset classifi lower valu fewer shorter length group classifi group gener convex hull oper point search engin requir queri shortest modifi closest requir oper point group submit approach yield highli discriminatori queri modifi low low bottom left corner find short modifi high higher modifi relat binari encod class region negat yield modifi suit true class modifi correspond classifi oper upper corner roc system inquiru page correspond url return underli search engin download analyz improv rank user system stage approach short queri modifi provid pool candid complex classifi appli central oper point intermedi valu retain part benefit queri modifi queri modifi call paper section illustr construct set queri modif detect confer announc site detect problem larg number page similar featur site high discrimin perform achiev account joint statist featur note announc venu call paper call paper page main confer page coincid combin manual automat total page relat confer retriev web page manual classifi posit class page set secondari servic restrict search text featur structur inform consid indic text featur occur titl page dictionari construct document number document class phrase record phrase class phrase rank ratio number time phrase true number time class paper submit accept readi date paper paper comput scienc fax inform interest tabl tabl phrase creat top rank queri modifi front modifi phrase denot phrase occur bodi text top featur select featur calcul extract queri modifi classifi featur shown tabl figur show perform roc prune algorithm dataset larg data algorithm estim optim classifi subset featur reliabl perform curv suggest classif perform obtain model interact fewer featur subset calcul queri modifi disjunct term separ queri modifi group number featur modifi group convex hull oper point calcul result queri modifi convex hull perform shown figur symbol queri modifi modifi convex hull algorithm account statist variat beta function decid point includ pf pd tabl select queri modifi figur convex hull oper point achiev queri group number featur queri modif filter exhaust figur forward prune featur set featur problem vertic axi show fraction power set subset function posit search posit fraction search space note logarithm scale due larg dimens space shown tabl queri modifi simplifi boolean order histogram modifi larg number negat element relev featur counter intuit negat term requir problem due similar true class build modifi perspect role neg modifi result view term modifi describ subclust relev document tenth modifi modifi written term make cut captur document term view correct assign describ secondari cluster relev criterion class featur statist valid featur select intens problem requir summar perform classifi element featur power set introduc method reduc problem exponenti polynomi flexibl select final oper point approach integr number result fact pearson design procedur yield classifi increasingli random bin label featur subset size random result shift true perform diagon direct set relationship satisfi element featur power roc curv detect design procedur break restrict statist valid subset small comput cost small algorithm method perform statist valid reduct discret space make explicit data distribut roc curv offer protect uncertainti class probabl singl set classifi monoton perform produc easili chang vari singl scalar paramet approach text repres discret alphabet threshold tfidf difficult accur model class probabl illustr extract queri modifi meta search algorithm present exhaust subset critic size limit approach directli construct classifi group featur size thirti incorpor compon approach sophist search approach sampl power size featur subset process exist approach turn benefit significantli restrict search space result estim critic size limit exist induct approach construct backward select note care elimin featur rank perform procedur statist warrant refer effect gloss discoveri proc acm recal gloss estim intern confer parallel distribut inform system septemb stanford protocol internet retriev digit librari metasearch engin support user inform proc cikm pp featur subset select machin eleventh intern blum relev featur exampl machin artifici pp koller optim featur proc intern confer machin pp morgan caruana attribut proc intern confer machin pp morgan irrelev ninth nation confer artifici pp langlei tree abstract work note workshop aaai van detect estim modul vol wilei duda pattern recognit scene analysi john wilei isbn classif featur select finit data juli preprint probabilist artifici vol subset select search probabilist proc aaai fall symposium isbn lawrenc page analysi improv web ieee internet vol pp servic lawrenc neci meta search seventh intern world wide web pp elsevi servic automat queri proc sattler gener extract queri data web proc pp boolean bell syst tech vol pp logic minim algorithm vlsi minim
Agents/161 1 emerg cooper larg scale system shehori robot forb pa usa krau dept math comput bar institut advanc comput colleg md usa dept math bar israel abstract cooper autonom agent discuss dai commun year paper cooper negoti distribut plan coalit format provid varieti approach algorithm solut situat cooper case cooper system examin paper present framework cooper environ low complex approach system deal model model ma inherit physic evolut comput system similar evolut physic system enabl implement provid detail algorithm singl agent system model algorithm distribut problem solver agent benefit system complex specif case prove optim analysi assess algorithm perform behavior properti model physic system task alloc preprint submit elsevi scienc march introduct system develop recent year address varieti comput problem highli distribut natur larg bodi research find number simul implement system agent simul implement consist dozen agent research realiz order provid solut ma scale hundr thousand agent involv execut highli dynam chang larg number task attempt made scalabl theoret model develop applic investig problem larg scale ma due studi paper address concentr investig facet issu task alloc execut cooper ma case cooper autonom agent alloc task provid model dynam alloc ma support theoret provid simul dynam agent system suggest mechan consist thousand agent task largest simul task alloc execut open ma model solut problem address basi futur solut larger class problem domain ma design satisfi execut task goal dynam system multipl agent goal multipl ma provid mechan alloc method dai requir coordin commun larg direct rapid materi base work support nsf grant lab contract armi research lab contract preliminari result research cooper ma frequent refer distribut problem solver agent system dp agent system cooper agent attempt common outcom system varieti algorithm dp system present agent connect commun network negoti process establish cooper complex comput base commun agent complex complex cooper method ma number agent resolv appli method classic mechan model ma adopt method physicist studi interact multipl particl method construct coordin algorithm cooper algorithm singl agent enabl coordin negoti limit commun differ particl comput system show approach enabl coordin execut larg ma physic view restrict physic model express tileworld model discuss section unlik task alloc method multipl consist inher interleav plan execut state model prove work successfulli system consist agent comput complex prohibit scale model base market simul limit agent present theoret justif abil model scale support claim simul result consist thousand agent task result show comput commun task agent size system grow note physic model easili appli problem physic natur demonstr appli model problem domain illustr possibl prove paper concern classic mechan requir continu progress agent simpler continu requir assum task agent commun agent number commun oper total network overwhelm system consist thousand agent note weak commit algorithm interleav plan requir inconsist plan start scratch model goal continu term suffic perform model simul present paper case continu model inadequ discuss futur work simpl model appli system agent block hole size planar surfac similar tileworld hole block fill block hole agent resourc system block hole block singl agent cooper assumpt notat describ system deal set agent set goal possibl dynam locat displac vector vector dm distanc defin agent goal displac vector locat domain goal physic compon displac vector necessarili physic distanc refer distanc virtual denot virtual assum agent deal abil perceiv virtual displac perceiv properti adjac agent goal sensor integr agent assum agent type resourc agent uncertain individu assumpt agent progress inform properti agent goal assum agent perform capabl measur standard measur enabl quantif agent task execut assum scale method repres displac agent evalu mutual distanc goal agent space assumpt virtual distanc physic factor model present assum achiev progress goal partial satisfi remain part complet point time detail exampl present section view number incorrect letter misspel word distanc correct form interpret sensor extend paper inform recept devic physic notat background present review concept notat physic start list gener mathemat notat vector physic properti direct magnitud vector denot physic analysi consist deriv function respect time order denot order denot gradient oper denot oper cartesian denot unit vector direct coordin continu list physic concept displac particl denot refer vector coordin particl denot rate chang denot rate chang veloc kinet energi particl repres potenti repres potenti spatial function call field potenti refer specif shape potenti forc deriv potenti particl mass denot displac denot displac vector momentum denot forc act denot classic mechan formal method calcul evolut displac momentum particl initi displac momentum particl displac momentum time deriv solut equat motion equat order differenti equat boundari condit arbitrari exact solut equat initi displac momentum particl particl equat motion notat concept present introductori physic natur motion particl depend field potenti move depend type potenti solut exact easili deriv model emploi type potenti function reli solut physic predict behavior agent follow model simul section perform support valid model adapt physic dai dai physic identifi environ locat particl model model properti match particl properti properti select state matter identifi state matter model autom particl properti system develop mathemat formul adjust agent system predict describ physic system properti evolut valid algorithm select state matter analysi complex theoret properti algorithm analysi physic particl system behavior fig step appli model distribut dp problem domain state larg set agent goal agent capabl advanc satisfi goal model consist particl repres agent goal develop distribut cooper mechan autom agent physic model commun agent satisfi goal liquid system agent dynam particl goal static particl agent capabl particl mass agent locat space locat particl goal satisfact algorithm goal alloc formal method calcul evolut displac fig match physic model compon autom agent environ step appli physic model dai match particl agent goal properti figur step identifi state matter model ensembl agent goal mathemat formul describ predict properti evolut particl state serv basi develop algorithm agent behavior modif model provid algorithm autom agent rest paper elabor issu gener idea model entiti ma model particl agent goal model dynam particl static properti particl mass displac momentum vector potenti kinet energi abstract properti model agent goal figur agent capabl repres mass potenti model particl mass static particl repres size goal model displac particl physic space model displac agent model dynam particl model static particl model properti particl properti adjust order provid agent effici algorithm modif detail paper model model present entail treat goal obstacl particl agent initi state equat motion note agent equat motion necessarili entail real physic repres progress fulfil goal potenti field agent act repres obstacl agent environ subject potenti agent solv equat motion progress solut goal cooper avoid conflict agent note cooper emerg properti model state matter pa order construct potenti field repres multiag examin properti physic state locat physic state consist potenti adapt lead agent benefici goal alloc satisfact solid state particl bound strongli initi prevent evolut system appli dynam goal satisfact agent prevent ga interact particl weak system lack intens interact mean cooper conflict rare occur interest issu futur present interest case cooper conflict agent liquid state li state solid liquid evolv rapidli unlik ga liquid interact particl liquid model prefer model ma main liquid liquid mutual potenti pair particl potenti potenti proport distanc particl potenti diminish slowli respect entail interact particl type interact mean particl system consid calcul interact evolut state note interact occur ga particl rate interact extrem smaller rate liquid potenti potenti result electr charg fig typic singl particl system typic describ potenti particl distanc ij particl lj ij ij ij coeffici scale potenti shape curv function figur potenti call potenti function entail potenti vanish short distanc due high power present short distanc impli interact particl system limit short distanc particl interact particl limit consid calcul evolut state particl properti make model ma deal commun agent comput interact complex note impli inform access agent environ incomplet match physic properti agent goal physic particl mass result particl subject field potenti momentum kinet energi momentum express kinet energi express mv product mass pa agent capabl satisfi commun requir agent consid larg larg system overwhelm agent goal repres potenti energi particl model particl greater potenti energi model agent satisfi larger difficult goal mean greater mass dynam particl model properti remain constant greater potenti entail larger capabl agent mass fix particl model goal repres size goal obstacl mean order satisfi greater model static particl greater addit effort part agent displac vector particl model displac agent space physic goal necessarili physic abstract space queri domain repres goal agent fulfil answer queri direct displac agent repres logic proxim inform store inform store inform answer queri virtual distanc domain calcul keyword scale note model space difficult requir adjust virtual displac calcul distanc goal obstacl distanc calcul potenti momentum vector particl repres physic veloc calcul kinet energi pa veloc dynam particl model repres rate movement satisfact goal part goal section system agent block hole planar surfac present system block hole block singl agent hole system model repres size hole repres mass greater mass entail greater due physic natur particl surround greater mass experi stronger attract properti natur attract hole proport size hole agent system proxim scale found inform retriev model repres hole fix agent free move agent mass magnitud repres differ abil block hole virtual motion physic motion particl mutual attract agent agent calcul attract move result calcul physic motion agent result pa resembl continu perform calcul repeatedli high frequenc agent calcul subject surround goal agent potenti affect virtual distanc neighbor entiti due larg size system model particl limit effect interact surround particl model agent limit inform particl local reaction potenti field neighbor affect potenti rang interact model particl effect complex calcul model agent perform denot radiu interact particl radiu determin sensor integr determin design agent assum random distribut particl rang system necessarili comput complex model agent experi grow linearli respect size area includ rang interact linearli respect disadvantag increment result increment number agent goal interact rang advantag increment rang interact effici due sharp reduct magnitud potenti function short distanc center magnitud deriv forc small interact neglig diminish simul perform physicist shown interact result simul theoret thermodynam common cut rang complex analyz detail section interact cut potenti function diminish maxim model strategi illustr cutoff physic bring potenti function particl formul maxim absolut function calcul set deriv result distanc potenti function max substitut max potenti deriv maxim absolut simpl calcul show reduct maxim distanc cutoff reduct cutoff distanc significantli particl investig distanc adopt ma reaction particl field potenti yield chang coordin energi chang state particl result influenc potenti rv act deriv agent calcul effect potenti field solv set differenti equat result move state describ detail formal protocol section real motion case abstract move state mean updat state paramet state repres vector boolean valu illustr section state chang mean chang boolean valu equat agent solv virtual motion goal equat motion particl subject potenti field solv equat approxim numer integr tabl simplifi calcul provid result practic qualiti accur result numer respect iter frequent explain perform small dt differenti numer integr set size dt size time differenti dt depend properti system deal depend due effect dt number iter perform agent reach goal small dt result accur numer chang displac model particl agent iter small impli reduct size dt number iter agent reach goal time procedur larg dt reduc accuraci numer reduc number iter reach goal larg dt dt grow progress goal greater lead situat singl dt lead larg singl translat move agent goal move behavior contradict continu physic properti success model defici larg dt small dt conclud dt lie dt chosen subject properti specif system unit measur reli experi gather physic simul typic particl model pass distanc ten dt requir impli averag veloc particl initi directli affect dt relat dt initi averag distanc agent goal enabl preliminari set prove simul result physic dt serv differenti numer integr repres real particl pa dt serv time unit time step agent calcul paramet progress calcul dt system dt particl relat determin properti model determin dt comput time time consid origin calcul physic properti dt case agent satisfi goal perform calcul dt case agent perform goal calcul separ dynam physic system model comput system lead particl system consist static dynam type type dynam denot type dynam static denot repres interact agent interact prevent situat agent physic word abstract achiev mutual particl model agent result agent negoti agent perform specif goal emerg model case model agent larg capabl reason necess case agent reach prefer perform agent perform goal agent wast effort particl model agent small capabl neglig small agent cooper satisfi dynam particl model agent potenti consist domin compon includ proport mass mass particl model capabl agent greater mass model particl model greater capabl model agent lead stronger order satisfi requir strong potenti dynam particl model agent modifi classic lj potenti modif prohibit similar model interact model pursu direct agent collid attempt consum resourc perform interf possibl reduc effect prohibit task execut agent damag prevent abstract case overlap locat agent model note account case agent perform goal equal shown section speak small larg respect size goal agent move note molecular dynam modif appli complet omit part potenti includ model multipli compon potenti function factor pdf result magnitud compon requir practic set magnitud pdf chang compon order magnitud respect attract compon potenti modif lj potenti affect interact dynam static particl order maintain magnitud attract attract compon lj potenti static particl multipli pdf repres interact agent goal interact static particl model goal attract dynam particl model order lead physic motion dynam particl static particl attract static particl gradual continu process specif point particl start model requir point agent decid action reach order satisfi decid artifici point adopt physic notion typic radiu typic radiu particl distanc center point forc deriv potenti equal rv denot typic radiu simpl calcul deriv potenti function yield oe occur dynam particl vicin static particl vicin mean distanc typic radii arbitrarili decid distanc point start denot point circl sphere radiu abstract interpret logic distanc case inform classifi reach mean agent close inform answer refer multipl topic relev queri hole physic entiti definit size accur boundari model hole modif prohibit good approxim physic behavior simul perform support valid model common choic md consist specif point model hole begin model hole boundari hole interact hole agent start agent physic arriv hole model arriv dynam particl model agent distanc center static particl model hole dynam particl reach static reach distanc occur extrem case type entail conserv kinet energi move model repres case resourc agent type entail loss kinet energi dynam model case expend resourc varieti combin found adjust case agent system discuss combin simpl time process behavior agent import issu model behavior particl behavior agent agent reach goal complet partial satisfi model requir reduct magnitud goal size goal model mass model mass particl reduc requir reduct mass particl model agent case deplet resourc reduct mass physic properti introduc reduct pa model deterior implicit advantag expect physic evolut system lose valid order avoid modif model part long affect gener evolut system model consist scheme tempor partit evolut system mean evolut system partit time tempor segment physic evolut system depend segment partit reduct requir conserv correct relat agent goal system agent resourc attract goal strongli fulli replenish agent note time segment dt calcul chang coordin particl typic time segment longer dt time time segment treat separ system connect system establish initi final state initi state particl system modifi final state previou system detail method perform present section time consumpt hindranc natur physic model implic model system model process requir model physic instantan model adjust physic time time adjust implicit properti physic behavior model goal kind hindranc particl model particl enter region hindranc emerg potenti consist central part central part gradual relax particl reach particl stop time requir relax time model time issu relat mass particl agent abil satisfi goal greater mass model greater goal case fix greater capabl case dynam particl kinet energi dynam particl grow closer attract veloc final magnitud depend size attract initi distanc result dynam particl mass reach distanc equal center veloc due initi distanc particl time model physic properti disadvantag model mean model agent initi perform goal faster clariti assum agent abil perform goal amount time assum time longer time assumpt relax small modif algorithm modif perform type dynam particl reach static complet equal time dynam particl start move static particl distanc assum dynam particl initi insid rang mass collid particl modif natur physic system explain similar case mass reduct note option part algorithm present section ad avoid addit simpl present model agent goal particl common physicist repres particl graphic shape potenti function figur potenti function minimum call reason notion addit particl notion graphic illustr illustr give idea attract reject potenti function particl consist domain attract reject particl attract reject formal repres deriv potenti function posit forc repres attract neg forc repres reject lowest point graph point forc forc grow neg move center central part posit move center potenti curv asymptot horizont magnitud attract forc diminish final vanish order illustr reject attract potenti reader marbl put physic clear part move marbl center part reject center clear forc strong weak agent attract case model case cooper agent reject case model occas cooper benefici agent jointli perform task requir capabl case attract model domin compon potenti function cooper benefici reject appli note distinct benefici cooper requir type potenti scale term function requir case attract model reject model time consumpt goal section figur observ typic figur repres limit rang strong attract reject part potenti attract attract small attract model region bring small benefit attract part potenti potenti magnitud potenti diminish short distanc origin simul perform physicist proven interact cut reason distanc discuss section cutoff minor effect dynam system particl describ likelihood cooper potenti function type fit properti agent benefit cooper function space variabl variabl resourc simplic continu function repres limit case agent resourc method case case method adopt approach analyz system comput agent method resourc independ method analysi function requir independ resourc fr requir linear combin protocol singl agent physic properti model proce protocol model agent act agent goal model goal model fix displac agent model dynam order evolut system agent inform gather observ neighbor agent goal previou state agent construct local field potenti solv equat motion result equat motion enabl agent decid step exact detail algorithm discuss issu multipl resourc capabl section singl agent loop perform process condit resourc complet goal interact rang observ process advanc time counter dt locat agent goal rang predefin interact distanc denot distanc neighbour entiti ij calcul mutual potenti equat respect agent goal rang sum potenti lj ij calcul gradient sum deriv forc section equat previou state solv equat motion section equat result equat motion pair move state correspond displac move calcul kinet energi section potenti equat coordin due shift distanc center particl model goal greater return step enter region strong reach goal start process process reach agent satisfi part order algorithm agent requir high probabl goal perform greater number agent task system bring probabl close agent move perform calcul capabl note part algorithm aim adjust agent behavior physic model directli contribut move model goal physic properti entiti involv process perform goal mass particl model smaller mass particl model subtract case deplet reduc similar return step note calcul algorithm perform physic properti result physic model properti agent goal transform physic physic properti transform present section iter method lead gradual reduct number size goal lead complet goal time process consum excess discuss problem section converg system final state goal benefici satisfi unsatisfi goal proven scale converg due evolut goal satisfi gradual suggest section section mass static particl model goal diminish impli repres goal rate result phenomenon gradual decai process mean system type goal closer full time satisfi rest goal logarithm time complet goal rate gradual slower order solv emploi scale method method amplifi attract system order slow due physic properti mass particl directli affect magnitud attract scale mass entiti system chang physic properti logarithm decai relax physic system includ chang physic behavior result similar physic system necessarili unabl predict evolut method instanc preserv consist physic result distribut size system disabl inform tempor chang quantiti goal satisfi synchron mass reduct perform initi inform agent system rule reason simplic low comput prefer rule rule subject properti calcul prior implement clarifi instanc present scale number iter denot number perform multipli mass goal factor result multipl treatment mass particl model goal mass goal scale number time perform scale method show valid step process perform interrupt similar physic process problem chang occur step due event analog physic behavior view evolv system set system fs evolutionari step state time immedi ith final state immedi initi state interest similar physic gap similar physic local minima dynam physic system converg local minima reach point minimum reach stabl point energi minim case phenomenon partial mass modifi due partial modif independ mass particl model agent modifi satisfact goal agent satisfi goal question problem exist model refer result common singl particl captur point due specif configur forc affect specif point larg particl particl captur local minima probabl system energet system deal highli satisfi goal gradual lose energi reach state resourc deplet happen goal satisfi discuss conclud singl agent small number reach local minima agent system avoid local risk satisfi goal problem local minima lesser import case percept support result simul conduct goal perform time import properti model abil provid execut vast major task system bound time period properti stem averag veloc particl model prove section length trajectori particl model bound time relat length trajectori veloc bound mean expect time execut task vast major bound complex complex model provid result main factor factor time reach singl goal singl agent singl number complet includ time agent spend actual ratio subject suffici resourc capabl ber goal number agent system major effect complex factor analyz begin analysi section discuss time consumpt singl virtual motion agent section analyz time consumpt process prove converg solut section incorpor effect perform process analysi present section time consumpt singl time agent consum calcul progress equal number dt multipli time calcul order express present concept notat formul relationship number agent goal rang mutual interact depend densiti distribut agent goal domain system depend averag distanc agent total quantiti denot number agent number goal total area densiti averag virtual distanc agent goal express function time vari time analysi omit notat state basic relat conclud formal present relat averag distanc densiti agent goal note analysi construct increment step reader interest detail analysi skip directli section notion area reason restrict case note high system reduc comput complex denot relat convert modif affect complex late express time consumpt singl agent depend densiti system averag number agent goal rang interact nr nr int time calcul mutual potenti deriv potenti int time integr forc veloc yield veloc displac time calcul translat previou displac itr number dt iter deriv integr calcul chang state agent explain section complex reduc complex depend size system number agent complex calcul small constant interest properti model relationship number dt slowli respect number agent stai shown case size averag number agent goal rang interact correspondingli linearli number iter respect growth reduct itr result reduct averag distanc agent depend physic physic narrow normal distribut mean veloc close averag assum veloc chang due chang number agent system reason equat reduct distanc entail linear reduct number complet passag observ physic conclud increment number agent goal lead reduct number reach goal merg note altern iter mean equat increment hold size system fix situat necessarili hold number agent size system simultan case examin densiti distribut agent system area densiti defin equat case stai chang equat leav unchang leav unchang fact chang impli itr remain deriv const import properti model system preserv densiti grow result comput complex depend size system gener virtual motion import issu analysi assess algorithm comput complex converg solut complex singl algorithm calcul complet assess prove algorithm converg solut calcul complex reach solut section account section assum worst goal reach agent part goal satisfi number satisfi goal agent complet small fragment assum size depend number agent number number complet singl goal number time segment complet goal averag case agent work simultan itr number timestep dt reach goal case reduct bound optim number satisfi goal reason reduct itr agent reach agent averag move progress goal move remain distanc case reduct hold necessarili distanc magnitud averag major assumpt averag assumpt constant reduct origin depend number place assumpt reduct depend number place assumpt averag reduc fraction origin improv order complex worst factor complex smaller assumpt requir distanc size previou assumpt distanc arbitrari integ time progress goal linear respect averag time diminish manner averag subject total distanc process sum proport case assumpt sum equat constant upper bound equal depend result sum converg algorithm solut expect complex gener procedur case equat complex worst case averag case case equat complex worst case averag case result yield constant time equat number case complex reduc equat hold equat hold result order resolv bring case complex deal system system observ ensembl act independ parallel time consum singl system complet activ equal time ensembl system arbitrarili partit smaller larg fit algorithm hold claim partit provid descript interact entiti interact resolv partial overlap adjac overlap rang repres region interact entiti adjac common interact region larg interact small minor effect respect system rang interact size system find difficulti perform partit satisfi size requir overlap region reject claim comput time examin perform algorithm respect optim alloc alloc depend properti system partit problem deal case discuss effect time perform algorithm discuss expand analysi section consid comput complet partit problem subject size size time consum time consum goal simplest case goal size agent agent satisfi goal effort time consumpt optim alloc agent perform shown section examin examin base trajectori particl model implic case time neglig small discuss result section hold fact time neglig vast effect complex algorithm current agent complet goal minor complex remain ae main factor number goal agent perform time consumpt agent proof result straight forward pa algorithm alloc agent goal capabl probabl agent capabl match goal requir capabl order resolv case agent possess capabl satisfi goal case reject concept pa model prevent alloc agent agent alloc goal agent complet perform goal goal hindranc occur averag alloc ratio goal optim alloc goal size case case goal agent complet satisfact goal encount occur goal satisfi encount goal diminish goal system remain size case deal case agent goal varieti size alloc lead partial goal yield reduct size goal affect alloc denot size goal size agent averag goal size denot averag agent size denot section averag number goal agent express averag insuffici analysi goal agent size averag amount alloc depend distanc agent agent similar capabl affect alloc approach respect consid averag depend size number goal agent agent case entail neglig small time impli order complex modifi averag size goal agent affect factor complex time consum number goal perform agent factor influenc complex import factor total agent pass order reach goal fulfil perform system agent alloc task minim virtual trajectori system complet perform goal agent complet goal optim alloc seek minim maxim trajectori check case algorithm reach result close provid method measur proxim pa model alloc closer entiti alloc distant entiti prefer alloc greater entiti alloc smaller entiti size linear effect distanc polynomi effect algorithm give prioriti alloc closer entiti respect entiti rang interact view alloc problem assess complex algorithm specif set tsp problem find tour node graph edg tour visit node minim total cost similar problem properti find trajectori node minim cost problem agent seek trajectori minim length similar differ tsp case detail differ result tsp algorithm inappropri complex inquir algorithm select trajectori minim cost compar complex model descript discuss tsp found tsp differ number agent dealt singl deal multipl multipl avoid conflict occas agent prefer longer path order avoid conflict agent perform agent capabl approach task tsp approxim algorithm mean assess qualiti trajectori result algorithm find tsp refer polynomi approxim algorithm prove reach solut cost greater optim cost achiev case cost function satisfi triangl inequ node satisfi case cost distanc euclidean geometri impli triangl inequ hold pa model consist distanc particl particl progress view salesman trajectori assess result algorithm comparison result approxim tsp provid algorithm impli dynam particl reach closest static particl view greedi algorithm shortest distanc chosen probabl ffi probabl depend ratio number agent number goal ratio area reason ffi physic model dynam particl experi strongest forc closest static particl move directli particl happen ae dynam particl tend reach static dynam particl move static particl probabl reach closest static particl close ffi case ffi small deal abstract defin abstract distanc appropri conform triangl inequ case distanc measur number prove order reject dynam particl move static particl greedi tsp approxim algorithm shortest distanc chosen probabl prove ffi probabl introduc small chang result trajectori algorithm depend number size model static particl model dynam particl collid iter process modifi number agent approach process averag denot averag agent size worst case relat specif agent denot size agent worst case low goal perform perform analysi ffi result trajectori algorithm optim tsp trajectori note properti affect size system summar case order time consumpt number goal agent multipli note larg number case ffi explain case big ffi impli small influenc time account previou case present analysi qualiti trajectori result pa model analysi hold current case result time consumpt complex previou case multipli remain order influenc qualiti algorithm base greedi minim span tree algorithm detail proof found algorithm textbook greedi choic similar physic behavior direct maxim forc appli reason behavior total note number goal agent number goal trajectori omit case ae ae time consumpt greater ignor time agent sum consum satisfact goal agent sum depend goal depend size agent size goal exampl illustr method algorithm present exampl recal problem provid detail adjust pa model problem present transport system show pa model implement cooper system illustr applic model ma abstract task robot planar surfac hole spread arbitrari order hole size robot design fill hole move hole fill robot quantiti fill robot member system aim fill hole fill volum unit cubic robot reach hole fill reach robot move veloc algorithm conveni assum veloc robot order magnitud assumpt assumpt robot perceiv neighbourhood violat fast robot move veloc close agent detect move time consum move time fig particl scale unit particl volum mm mass diamet hole sensor effect rang movement veloc movement veloc averag path time sec averag path time sec dt sec dt sec ill hole depend distanc limit ill express move distanc veloc fill rate depend size hole amount fill robot hold fill rate depend fill capabl robot simpler assum robot differ quantiti fill possess denot fill rate time fill hole volum hole robot amount hole ill hole fit model problem present fit properti figur note tabl properti left column paramet dt determin design fit pa model ma design limit effect rang sensor agent part inform gather sensor limit requir pa model section observ averag robot veloc particl veloc order due larg differ mass particl smaller volum hole fill stuff unit differ affect match physic model robot implement emploi calcul respect singl particl assum mass unit volum unit robot case repres mass unit physic model modif requir chang behavior linear scale multipl deriv result constant mean multipl zoom case radii relat hole dimens volum hole diamet hole dia hole impli mass particl diamet satisfi mass relat necessarili match system pa mass particl chosen satisfi relat observ tabl requir radiu interact ten time greater radiu particl robot sensor perceiv inform distanc ten time greater hole radiu problemat robot ignor distant entiti simpl surplu inform make calcul elucid solut requir comput consid respect case design decid greater ratio chang correspondingli order implement system pa design match present robot perceiv properti hole robot rang process inform process includ transform unit particl calcul requir pa result calcul pa transform robot advanc result procedur repeat robot dt requir model transform dt suffici time reason sensor processor perform percept requir calcul appli pa model transport ma pa model successfulli implement freight transport system system discuss context case carrier control comput coordin mechan system larg commun agent common benefit system act algorithm improv system perform improv stem avoid intens comput schedul problem bottleneck central mechan order enabl adjust pa algorithm transport system adjust fig particl carrier freight particl carrier dynam particl freight static particl volum particl mass carrier locat dynam particl locat freight locat static particl locat system freight transport consist carrier carrier capabl unit volum locat task carrier fulfil task deal freight move locat locat task origin final locat volum adjust model freight system present figur task model static particl agent dynam requir pa model volum model particl locat particl locat featur agent system case commun system system broadcast inform task execut locat agent task fail handl abil system commun system exist transport driver report locat task execut driver suppli transport servic deterior section complet accur inform assum agent expect transmit inform locat transmiss receiv subset agent target subset agent receiv inaccur messag receiv messag examin effect messag transmit simul section structur citi regul prevent movement shortest path assum gener algorithm simul transport distanc locat calcul shortest drive direct movement calcul agent process algorithm road direct road smallest angel select movement select physic behavior environ justifi limit regul speed limit limit veloc part physic veloc distribut valu limit low elimin minor effect behavior simul show detail adjust enabl implement pa transport case summar expand distinguish level adjust conceptu level practic level conceptu level consist recept inform task model entranc particl effect radiu interact note transport case inform gather receptor affect distanc carrier freight impli excess inform handl inform filter refer relev task advanc freight model movement dynam particl static particl execut task model static model dynam model agent receiv transmit central coordin inform plan alloc task notat refer direct vector addit conceptu present practic level perform match properti figur properti left column tabl typic paramet specif transport system deal dt transport determin design fit pa model ma radiu interact transport domain observ averag carrier veloc ten time greater particl veloc addit larg differ result dt significantli dt particl system fig particl scale unit particl volum mass deliveri distanc inform rang movement veloc movement veloc averag reach time sec averag path time sec averag deliveri time sec time sec dt sec dt sec note magnitud dt requir conform ratio time physic model impli agent perform calcul requir pa model move locat agent report locat enabl agent inform locat calcul requir agent report locat requir imposs report perform human agent electron track compon instal agent devic broadcast locat identif provid inform high frequenc low cost report system maintain stabl behavior continu satisfi goal qualiti calcul deterior time period typic iter calcul present detail section simul set speed comput process reason result goal perform explain section inform discuss differ mass particl volum carrier freight type adjust similar adjust similarli justifi avoid redund refer reader section adjust comput agent pa algorithm coordin action order perform task benefit system low comput commun simul demonstr applic abstract task base pa model appli ma execut task provid guidelin applic pa architectur retsina retsina ma consist type agent inform task agent interfac agent agent capabl perform task capac limit size task amount resourc execut agent agent advanc find specif type inform agent agent retsina implement singl capabl task capabl agent form team demand execut task note agent retsina ma limit view rest agent societi view includ agent task relev capabl task confin view similar model limit interact rang pa model agent retsina satisfi goal interleav plan execut process gradual goal task subtask task consist execut code task execut schedul execut execut plan mechan implement extens task network model htn network depict consist connect type edg reduct link edg describ goal prohibit complex agent futur task subtask tree link edg repres propag propag task complet propag outcom task outcom provis execut task bui stock find price perform transact requir propag success outcom complet successfulli outcom provis htn multipl provis outcom task execut reduc provis set result outcom task set htn properti retsina agent demonstr pa model coordin task alloc execut provis outcom link reduct link task hierarch task network main idea model agent gradual alloc partial execut task lowlevel task specif capabl true set task execut agent task requir capabl capac execut gradual advanc perform action satisfi number agent task note prohibit case agent simultan work set true task agent capabl excess prohibit simultan work task direct interact emerg agent capabl adapt explain reject partial execut task execut practic retsina framework measur numer express distanc agent task defin abstract space provis space space consist provis retsina provis repres boolean displac task repres vector provis provis specif task set agent capabl suffici capac attempt gradual alloc perform provis vector pa provis approach task set provis note provis task set agent partial execut task distanc simpli distanc provis vector pa pa defin addit distanc measur pa qp refer set true normal distanc requir find distanc ignor task process set provis distanc pa closer pa agent complet alloc pa express point agent execut task run note pa indic advanc task agent alloc task agent close task advantag engag task execut continu advanc task approach select date implement introduc addit definit distanc provid interpret mass retsina framework requir mass repres capabl task magnitud capac capabl case capabl task support pa model current form extens model handl case suggest section multipl capabl possibl model physic charg mass electr approach partial support classic mechan extent quantum scope paper mechan present discuss alloc agent agent task case agent work task provis true fig agent task retsina particl agent task particl agent locat dynam boolean vector dynam locat task static boolean vector static locat capabl capac particl mass rang interact set relev action execut threshold relev provis set true task perform rate provis set true time particl veloc execut part subtask provis outcom task lowlevel task pa model requir comput potenti function equat motion plan task alloc execut appli comput base mass distanc express result comput displac vector provis space agent decid provis handl set advanc displac result agent gradual alloc task mean provis enabl advanc achiev util manipul provis vector task possibl relev repres note physic movement part pa model agent closer move interpret movement appli provis space reset provis set provis result limit memori agent requir maintain relev provis store extern manner oper system handl multipl appli pa agent relev task agent provis boolean vector retsina task entiti task possess specif agent agent necessarili agent order relev agent add matchmak task provis vector agent interest contact monitor updat state member team dynam form retsina execut task pa model prohibit provid explicit updat team respect task agent support retsina provid agent task requir pa implement pa model retsina present tabl note model present pa implement retsina adjust perform implement intend direct futur research extens model pa concentr limit rang ma extend wider rang reli physic properti demonstr extens system singl type capabl system inform system inform multipl type task capabl model present restrict case task capabl singl type necessarili discuss capabl agent perform task requir task perform agent origin mass particl restrict particl model capabl extend model refer cluster cluster particl type particl model distinct capabl cluster model agent task analyz system superposit consist type particl model type capabl compound system analyz thermodynam statist mechan provid method analysi model appli case singl capabl virtual motion agent result forc deriv potenti function model particl extend case forc calcul space deriv virtual motion calcul respect superposit forc cluster particl team format lead model agent capabl case partial goal satisfact fit requir capabl satisfact specif model goal satisfact inform assum inform gather adjac entiti result agent noisi natur inform gather sensor mean inform assum model examin valid model behaviour subject studi approach field thermodynam statist mechan thermodynam behaviour particl behaviour smaller simul system case bound system stabl introduc random low level perturb system significantli affect behaviour discuss page thermodynam paramet system vari significantli conclud ma expect restrict stabil evid simul perform signal ratio strictli bound system lose stabil loss stabil occur resembl thermodynam phase transit happen ratio significantli larg db reli physic conclud ma maintain stabil small noisi inform extend mean sensor inform recept devic system bound thermodynam properti system number energi bound stabil hold unbound bound result small perturb chaotic ratio signal common method measur qualiti system inform signal present ratio consid threshold simul examin model show applic real transport case present section perform set simul demonstr effect task alloc execut dynam ma consist thousand agent task problem domain simul perform simul freight deliveri metropolitan problem environ commonli solv dispatch center deliveri request address plan alloc deliveri task deliv agent method face bottleneck ineffici dynam chang set agent task present demonstr pa model overcom limit fig fragment citi map larg metropolitan snapshot part network depict figur figur squar repres task circl repres messeng simul messeng randomli citi map repres graph boundari citi meter lattic includ vertic locat meter edg exist neighbor vertic vertex repres junction edg repres road junction design map vertex edg eman neighbor vertic realist map edg miss obtain map probabl determin exist edg result disconnect occur case largest cluster select repres citi design note similar approach ma map lattic cluster gener perform probabl includ edg lattic pa typic potenti particl potenti adapt model specif transport applic experi potenti sum deriv power ij check effect modifi potenti function experi final concentr ij ln ij fir ij ij sought potenti function similar shape physic properti consist attract compon diminish short short shorter impli interact particl simul system similar origin pa perform type simul vari number task agent homogen agent reliabl intens lattic map distribut agent task citi map simul consist iter freight dynam random locat map messeng follow algorithm perform task reach freight deliv destin simul perform agent task homogen similar capabl capac start simpler handl predict examin case agent task realist homogen mass particl set heterogen case mass set randomli distribut examin lattic start full lattic move lattic map differ perform concentr lattic map test highli disconnect repres class problem solut search space significantli tradit optim mechan exploit pa learn effect commun perform experi case messag pass arriv probabl smaller addit paramet simul simul messeng paramet valu fl ff fi equat meter simul examin number agent agent disappear averag number case constant homogen consid set agent task quantiti simul set number agent initi number task number agent initi number task homogen set addit task arriv rate task hour quantiti agent set studi effect number messeng ratio system perform set experi heterogen case set aim studi effect experi heterogen case simul run length calcul averag simul omit result hour system reach stabl stabl omiss prevent averag affect initi condit main result simul summar graph fig number messeng move freight function number messeng system agent perform task concurr figur ratio number messeng system number agent simultan involv movement task present term free messeng quantiti number messeng move freight search messeng perform task graph observ number messeng involv linearli number simultan move task result result reduct time requir task execut figur term freight quantiti figur number freight fig number freight wait deliveri sharpli number agent system wait messeng deliv observ number drop sharpli quantiti messeng critic point transit occur messeng task mean significantli lower number freight simultan wait deliv ratio messeng task quantiti system ratio bring perform respect number freight wait fig time agent reach task number densiti agent system figur present time successfulli deliv freight reach freight observ graph time measur fig averag time freight wait deliveri sharpli function number agent system quantiti messeng averag time requir messeng reach freight result messeng freight behavior mutual averag messeng time reach freight disadvantag densiti bad significantli reduc number freight simultan wait deliv shown figur averag wait time freight figur freight averag wait time freight successfulli deliv destin wait handl messeng present sharp reduct wait time observ observ phase transit similar phase transit case freight quantiti support observ worth ratio ratio simul figur present averag freight fulfil time freight initi arriv destin time subsum wait time add execut time steep previou improv perform reach messeng import notic messeng initi task execut time citi size deal speed limit desir fulfil time figur present result simul probabl messag fig averag time task alloc execut number agent system fig averag time task alloc execut accuraci messag recept recept vari simul perform homogen heterogen ensembl agent task simul probabl agent receiv inform neighbor task inform transmit number agent set simul initi number task paramet previou simul report mass heterogen case initi mass task set uniform mass agent set randomli capac agent smaller size deliv part task time freight fulfil time heterogen case time freight arriv destin figur conclud freight fulfil time linearli probabl messag arriv messag fulfil time case messeng messag figur case messeng result commun limit effect time requir task perform similar observ appli measur perform heterogen commun fig averag time task perform case agent task distribut center citi execut time significantli compar distribut hour fig averag time task perform case agent task randomli set similar normal distribut case previou graph present result simul task agent randomli distribut citi map figur task perform time measur function simul time hour present result case distribut uneven agent task locat normal distribut center distribut function center citi map standard deviat distribut mean task agent concentr area citi observ improv averag task fulfil time averag distanc messeng freight expect local concentr agent task result turn reduc perform local densiti case pa applic distribut result figur compar figur result simul set random normal figur variabl mass implement fig temperatur calibr metric system function simul time show moder stabl graph demonstr case agent task randomli distribut variabl mass similar result reach case ad temperatur monitor control mechan temperatur paramet measur statist base veloc particl low temperatur result system converg local high temperatur result turn ineffici task alloc perform mechan provid period comput temperatur slightli correct correct perform comput chang requir averag veloc reach distribut common activ concentr center desir ad subtract veloc agent found paramet adequ correct temperatur experi moder figur task conclud local reach scarc result present myriad addit experi conclud pa model appli larg scale agent system solv real problem number agent system amount comput agent larger system requir comput time number agent hold number task benefici extent improv perform observ phenomenon result redund popul agent system result observ similar densiti lattic map low probabl commun channel pa applic distribut mass locat particl agent relat work larg bodi dai research studi coordin agent distribut problem solv pgp gpgp lesser studi partial global plan approach coordin implement distribut vehicl monitor testb network vehicl monitor node node planner plan increment node commun detail commun organ modifi local plan requir due incom messag increment plan restrict commun pgp model similar model task domain testb pgp includ traffic monitor perform agent gener tent map vehicl movement area transport framework requir transport task attach agent plan perform simul transport system significantli major simul perform lesser colleagu environ includ agent case agent maxim number agent test reason problem geograph distribut problem integr problem close relat agent dynam environ agent freedom move physic problem scale lesser al consid problem scale develop method reduc commun reach global consist solut gpgp model extend pgp idea agent exchang partial global inform multipl level abstract separ schedul algorithm gpgp coordin plan coordin algorithm transport problem discuss dai research mention agent dealt discuss case cooper agent differ size problem domain sandholm solut albeit dozen carrier work behalf hundr deliveri problem solv small magnitud schedul problem larg transport framework deal dispatch center agent dozen carrier move freight possibl share task task alloc perform dispatch center carrier fischer al assum dispatch center solut dispatch center truck autonom agent agent cooper compani dispatch competit agent deliveri start dispatch inform deliveri forward truck agent center model task forward present note fischer al assum dynam admit carri experi respect static differ system small size system simul dispatch truck agent distribut problem solv larg scale problem size express number variabl present yokoo present algorithm distribut constraint satisfact present approach significantli permit algorithm appli dynam task alloc execut agent algorithm extens prove work cientli larg scale problem boolean algorithm undesir abandon partial solut prove inconsist result exponenti complex worst case averag case amount comput size problem solv model averag complex larg system constant start partial solut evolv frequent reach state complet inconsist constraint limit solut provid implement domain note algorithm concentr constraint approach discuss task alloc approach present provid solut constraint satisfact albeit necessarili solv yokoo tileworld model testb plan task alloc execut system util physic method model significantli richer tileworld model tileworld grid model provid basic physic system unlimit direct move level abstract model express tileworld model distinguish procedur path plan perform model inher properti interleav plan execut tileworld prove work successfulli system dozen task task comput complex disabl scale thousand task agent system size physic base simul prove pollack ur suggest filter strategi mean coordin agent conduct experi strategi improv perform agent coordin achiev explicit negoti work suggest suggest method model environ base model suggest detail algorithm singl agent act effici environ provid explicit analysi qualiti respect commun comput algorithm condit support theoret present simul result ephrati model requir kinni georgeff explicitli reduc emploi simplifi tileworld tion amount requir commun model significantli smaller filter method ephrati model agent commun small subset agent agent commun agent lesser agent satisfi dozen goal import system hundr thousand agent address solut emerg behavior comput agent discuss studi perform recent year glanc huberman discuss issu borrow method statist thermodynam order studi evolut social cooper context social methodolog studi aggreg behavior individu face social choic appli result theoret physic studi behavior system individu unlik theoret physic specif studi group properti studi properti individu agent develop algorithm behavior agent group member main concern research collect concentr person discuss collect behavior result behavior paper glanc huberman present detail physic formal dynam collect action system individu work main issu physic behavior singl agent physic order analyz exist system develop algorithm base physic reli physic behavior particl predict behavior agent algorithm develop shoham tennenholtz present result simul perform order perceiv emerg convent system concern design system converg common social law discuss emerg discuss emerg law cooper occur determin social law emerg cooper system cooper pursuit problem wide problem multiag coordin cooper problem predat agent issu explicitli address conclud inform agent varieti comput scienc gener solv model avoid descript studi find similar case attempt cooper hunt move prei uniqu necess coordin predat dynam chang goal locat ishida korf state algorithm comput entir solut fail provid answer due dynam problem search algorithm overcom limit describ problem connect graph set agent graph uniqu state complex algorithm mt number state multipl agent larg complex prohibit feasibl solut base suggest agent involv solut number agent number trail reach solut reduc learn mechan high algorithm solv multiag pursuit problem complex problem consist thousand agent larg scale problem space research aim larg scale found inadequ small system note work explicitli discuss case goal chang locat dynam approach describ group behavior present matar paper definit set basic interact simplif analysi group behavior matar approach differ discuss descript synthesi group provid explicit set basic interact concentr natur basic interact adopt physic interact particl model interact agent goal due rapid improv microprocessor real environ simpl microscop autonom robot result paper simpl emerg cooper method agent defin number specif class desir mobil behavior militari scenario provid list topic consid design present result simul perform illustr behavior system research differ concentr specif class restrict model specif class motion prove valid method perform reli theoret physic encapsul physic margin modif requir adjust model case move goal prove valid research potenti field mean plan approach close relat potenti function differ problem techniqu solv problem differ main object plan optim path robot navig initi locat destin main object solv task alloc problem aspect environ discuss potenti thousand type plan research involv potenti function discuss singl robot case case robot case number robot consid small ma discuss case research address plan potenti field concept emploi case behavior group format robot set specif strategi robot act strategi find robot follow leader predefin geometr pattern model agent strategi base physic concept research potenti field problem type potenti function potenti function emploi artifici expect result potenti function potenti field gradient emploi physic potenti function result behavior agent act respect function potenti function particl fluid result model singl agent algorithm reach perform goal larg commun agent potenti function enabl predict bulk properti ma attract potenti field emploi lead robot shape potenti field overview found entiti model type potenti physic model chang dynam due fulfil goal expenditur resourc lead dynam altern potenti field result dynam updat agent behavior dynam potenti field refer chang locat robot chang specif function model specif entiti import differ compar restrict model physic trajectori model abstract motion case emploi concept analysi method select base model physic system properti model select artifici choic poss good properti polynomi complex trajectori research artifici potenti function discuss case singl robot small number robot navig locat goal approach discuss case agent case specif agent specif goal case cooper goal satisfact aim research discuss issu alloc agent goal wide discuss dai research model contract net protocol negoti base task bid contract task alloc net consist dynam altern worker manag exchang inform goal perform subgoal process design base exist perform system check simul perform system predict physic properti effici formal calcul compar optim result model present minim transmit inform enabl concept abstract motion explain section note singl robot trajectori model meant multipl agent task alloc note minim refer number recipi inform necessarili amount inform transmit system effici studi plan ma present wellman approach econom serv theoret basi plan mechan mechan competit appli construct program emploi mean construct analysi distribut plan system wellman perform simul deriv system equilibrium show model reach result deviat optim result discuss system appli analyt model design distribut plan mechan approach predict result behavior system constitu agent base behavior physic system wellman perform simul includ agent view compar small perform simul number agent major differ type system model wellman model model design dp agent outcom system design analysi agent system difficulti hard solv solut polynomi complex paper aspect problem address provid method task alloc execut class cooper ma present approach result low complex part singl agent order result model behavior requir perform numer explicit calcul model present algorithm enabl singl agent act model consist method agent alloc goal order satisfi goal match emerg result behavior agent agent strongli attract goal satisfi fit limit case agent fit requir model definit provid reach properti mutual reject algorithm provid lead converg comput complex low small amount method lead optim reach optim alloc requir complet inform agent goal system larg class exponenti approach present advantag common dai algorithm check valid formal proof model reli theoret result physic predict evolut model evolv manner physic system local enabl deriv global behavior assur low comput complex model approach model emerg cooper activ properti prove hold simul system properti system analyz concept statist mechan employ concept enabl deriv bulk properti system properti compon leav analysi futur work refer optim cooper knowledg sourc technic report boe ai strategi cooper distribut problem solv page chen coordin control group mobil robot proc ieee intern confer robot page handbook mathemat numer method lesser multistag negoti distribut plan bond read analysi bulk properti statist mechan method found introductori demonstr method measur stabil system term temperatur distribut artifici page morgan kaufmann san castelfranchi limit level type interact demazeau decentr ai page elsevi scienc rivest introduct algorithm mit keith decker victor lesser gener partial global plan algorithm intern journal intellig cooper inform keith decker victor lesser design famili coordin algorithm victor intern confer page san mit press longer version umass donald xavier provabl good approxim algorithm optim robot decoupl dynam bound reif motion plan journal novemb lesser predict coordin problem solver dynam domain seventh nation confer artifici page st august coordin distribut problem solver kluwer academ lesser negoti task decomposit alloc partial global plan gasser distribut artifici volum page vr corkil coher cooper commun problem solver ieee transact edmund victor lesser partial global coordin framework distribut hypothesi format ieee transact septemb issu distribut sensor ur deriv coordin filter strategi page erol hierarch task network analysi implement phd pischel model cooper transport schedul proc page san fischer muller model cooper transport schedul van de veld lectur note artifici intellig agent break page command control system unman gile parallel scalabl approach molecular dynam technic report machin glanc huberman organiz sustain cooper proc glanc huberman cooper journal mathemat util commun coordin intellig agent proc page ishida korf move target search chang goal ieee transact pattern analysi machin june katz principl statist mechan freeman ketchpel form coalit face uncertain reward proc page khatib obstacl avoid manipul mobil robot intern journal robot artifici potenti obstacl avoid approach proc ieee intern confer robot page kinni georgeff commit effect situat agent twelfth intern joint confer artifici page august molecular dynam flow move contact line physic review krau function time cooper negoti proc page landau mechan pergamon latomb robot motion plan academ editor travel salesman problem john wilei vr lesser retrospect view distribut problem solv ieee transact matar kin group behavior proc cognit scienc societi page mullen wellman simpl comput market network inform servic proc intern confer multiag page ono reinforc modular approach proc page pollack ringuett introduc evalu agent architectur proc page molecular dynam simul vector parallel comput comput physic reif fundament statist thermal physic book lewi analysi heurist travel salesman problem siam journal rosenschein ration cooper intellig agent phd stanford salton mcgill introduct modern inform retriev book sandholm implement contract net protocol base margin cost calcul proc page washington sandholm lesser coalit bound agent artifici shehori fluid flow simul molecular dynam msc bar shehori krau cooper commun proc page shehori krau method task alloc agent coalit format artifici krau transport proc shoham tennenholtz emerg convent initi result observ proc page smith contract net commun control distribut problem solver ieee transact williamson design behavior inform agent page lo zeng distribut intellig agent ieee expert system stationari state molecular dynam ii newton law physic review wang navig strategi multipl autonom robot move format journal robot warren global path plan artifici potenti field proc ieee intern confer robot page wellman earli lesson paradigm distribut resourc alloc wellman program environ applic distribut flow problem journal artifici intellig yokoo search solv constraint satisfact problem proc page kuwabara distribut constraint satisfact formal distribut problem solv twelfth intern confer distribut comput page yuill gener deform statist match problem neural
DB/162 3 exploit schema knowledg integr heterogen sourc bergamaschi castano de di montanari vincini modena milano dsi modena dsi milano contact bergamaschi abstract inform share multipl heterogen sourc challeng issu rang ontolog area intellig approach inform integr account semant conflict lack common share ontolog goal provid integr access inform user pose singl queri receiv singl unifi answer approach integr conceptu schema sourc adopt common standard data model descript logic cluster techniqu exploit descript logic obtain gener common thesauru solv semant heterogen deriv common cluster techniqu build global unifi view data queri process intellig inform semant heterogen introduct continu quest provid uniform access distribut problem integr inform heterogen sourc relev main problem face integr inform distribut sourc relat structur implement heterogen differ hardwar data model data lack common lead semant heterogen semant heterogen occur emploi repres inform model construct repres piec inform sourc approach recent literatur extract integr research partial fund basi di date evolut murst project convent structur data account semant heterogen data integr architectur base mediat knowledg data multipl sourc combin provid global view underli data fundament approach emerg structur semant project approach project structur tsimmi manag multipl inform project develop stanford tsimmi approach mediat develop ffl data descript languag sourc convent oo model data item descript strong type ffl semant knowledg effect encod msl specif rule integr mediat level recal fundament argument favor structur approach tsimmi target ffl gener oem msl make structur approach good candid integr wide heterogen inform tradit data client awar schema order pose tsimmi structur inform discov queri convent oo languag break defin object class type irregular object hand major drawback approach lose notion extens ffl integr involv larg amount object optim access develop research base concept mention ffl queri mediat execut project semant approach approach ffl conceptu ffl semant inform encod ffl common data model basi describ sharabl inform ffl partial total schema unif perform introduc fundament argument favor approach base convent oo data schema queri consist schema support semant knowledg encod permit effici extract schema natur convent oo model aggreg gener primit organ adopt type set semant schema make check consist instanc respect relev effort devot develop oo corba object exchang heterogen model odl languag schema oql languag queri object orient argu argument favor structur approach satisfi semant approach weak class descript notion ffl adopt open world semant typic descript logic approach class descript data object class share common minim addit properti semant approach integr heterogen inform approach semant conceptu schema involv sourc common data model languag adopt describ sharabl inform odl defin subset odl descript logic descript languag constraint kernel languag support system inform integr momi base schema perform extract analysi process unif process extract analysi process devot construct common thesauru terminolog relationship base odl schema descript format cluster mean cluster odl class describ similar inform schema unif process build integr global schema analyz sourc integr odl class cluster issu queri process optim knowledg global schema briefli wrt aspect relat knowledg develop call momi environ multipl inform implement approach descript logic hierarch cluster techniqu origin contribut approach enhanc integr process descript logic interact thesauru deriv explicit terminolog relationship odl schema descript infer relationship explicit optim queri global schema descript logic cluster techniqu autom identif odl class sourc schema semant relat constitut cluster candid unifi uniqu class global schema inform integr knowledg intens avail autom support valuabl case larg scale frequent number inform sourc global inform system paper organ section introduc odl languag outlin approach schema integr run paper section describ construct common thesauru terminolog relationship section illustr techniqu analysi odl schema section illustr cluster process formul group class affin section describ unif process build global schema section show effect global schema wrt queri process optim section discuss previou work section give conclud remark momi approach inform integr section describ architectur momi system phase approach intellig schema integr momi architectur odl languag fig architectur momi system shown respect consid power system tsimmi architectur sourc li translat translat structur data sourc common odl languag similar wrapper perform translat queri oql languag local request execut singl sourc wrapper mediat softwar modul refin odl schema receiv wrapper mediat gener oql queri start queri request formul respect global schema mediat modul obtain coupl semant base descript logic extract analysi schema analyz minim odl interfac momi system automat gener mediat high level descript inform process reli semant high level languag mediat descript gener cluster gener obtain languag extens rule structur part languag declar descript schemata map languag interpret descript logic open world semant tool queri optim consist check mediat tool comput class affin build global schema basi queri manag gener autom translat global user queri local queri engin odl interfac wrapper attribut class student wrapper relat attribut wrapper file system attribut file global schema builder queri manag mediat momi artemi figur architectur momi system order easili commun sourc descript wrapper mediat introduc data descript call odl recommend object data model standard odl close odl support requir intellig inform integr system odl sourc independ languag mediat manag system common deal sourc relat main extens wrt odl capabl express kind express declar integr constraint intra inter map rule sourc odl express terminolog relationship intra inter sourc wrapper task translat data descript languag sourc odl add inform sourc type wrapper provid descript subset sourc sourc integr access mediat fs sn set schema heterogen sourc integr odl sourc schema collect fc mi class ji set ji hn ji ji attribut ji defin hn domain show odl class show relat object syntax languag illustr appendix interfac interfac student sourc relat sourc object extent extent student refer relat file support languag kei attribut integ year attribut string attribut attribut string attribut string attribut string attribut integ overview approach momi approach intellig schema integr articul gener common thesauru object step construct common thesauru terminolog relationship schema class belong sourc odl schema terminolog relationship deriv analyz structur context class descript logic techniqu affin analysi odl class terminolog relationship thesauru evalu level affin class intra inter sourc concept affin introduc formal kind relationship occur class integr point view affin class establish mean affin coeffici base class attribut cluster odl class class affin sourc group cluster hierarch cluster techniqu goal identifi class integr describ semant relat inform gener mediat global schema unif affin cluster lead construct global schema mediat class defin repres cluster class union attribut global schema analyz sourc class deriv basi pose queri sourc gener global schemata map exploit phase integr process section mediat global schema exploit user pose queri inform global schema queri manag modul momi queri reformul semant optim discuss section run fig present remaind paper sourc sourc relat inform staff student research school section room professor research depart section sourc research school comput scienc sourc cs tax posit sourc figur sourc schema store relat school member inform year faculti student enrol store sourc comput scienc inform peopl belong comput scienc depart cs locat inform similar store data professor give possibl retriev professor part logic special depart class locat maintain address respect year sourc tax posit deriv offic consist file store inform student tax fee complet sourc descript appendix gener common thesauru goal phase construct thesauru terminolog relationship describ common knowledg odl class attribut describ sourc schema call common thesauru kind terminolog relationship common ffl syn defin term consid interchang consid mean syn relationship syn ffl bt defin term gener mean bt relationship hc person bt bt relationship symmetr opposit bt nt bt nt ffl rt posit defin term gener context relationship rt discov terminolog relationship encod odl schema enforc interact design lead definit common thesauru start odl sourc schema shown fig articul autom extract relationship odl exploit capabl semant rich schema rt automat discov translat odl infer relationship class gener rt relationship aggreg rt relationship extract sourc schema repres aggreg class attribut relat sourc rt relationship extract repres foreign kei interact design suppli addit terminolog relationship extract previou step terminolog relationship interact suppli synonym knowledg gener valid emploi valid terminolog relationship involv attribut thesauru valid base compat domain attribut valid invalid terminolog relationship distinguish hn hn attribut check execut attribut relationship ffl hn syn relationship mark valid special ffl hn bt relationship mark valid ffl hn nt relationship mark valid infer start valid explicit relationship obtain previou set terminolog relationship infer thesauru explicit infer relationship constitut common thesauru analyz sourc schema fig repres input output step thesauru construct refer list relationship infer explicit shown fig graphic common thesauru report fig thick arrow repres thin arrow repres rt dash arrow repres infer solid repres relationship sake relationship class report fig extract valid common thesauru extract valid infer infer relationship relationship relationship relat figur gener process common thesauru explicit relationship infer relationship hc person bt hc person bt research hc person bt hc person bt school member bt rt staff bt staff rt syn rt bt rt rt rt rt rt staff rt hc person bt staff rt rt rt student bt rt figur relationship affin analysi odl class integr odl schema sourc global techniqu identifi class describ semant relat inform sourc schema compar odl class mean affin coeffici determin level semant relationship class compar odl class respect affin attribut structur affin order evalu level semant relationship global affin evalu affin coeffici reli terminolog relationship store common thesauru affin evalu common thesauru associ network term node correspond term label edg node terminolog relationship term affin connect path thesauru comput quantit measur affin strength oe assign type terminolog relationship oe syn oe oe rt notat oe ij denot strength terminolog relationship term thesauru oe syn oe bt oe nt oe rt level affin term depend length type relationship involv affin function definit affin function term return measur strength relationship involv shortest path defin thesauru depart locat room professor student section figur common thesauru oe oe oe notat denot shortest path length thesauru pair affin term path exist term coincid remain longer path defin lower affin term thesauru path higher strength involv greater affin consid term common thesauru illustr fig path exist school member school member nt cs person bt student definit term denot affin function return greater equal defin threshold ff ff ff conclud student student affin coeffici give definit affin coeffici structur affin global affin coeffici odl class belong sourc affin coeffici measur class affin respect structur affin consid class attribut coeffici defin definit affin affin coeffici class denot measur affin thesauru student school member class school definit affin structur affin coeffici class denot measur affin attribut comput gj jcj notat stand posit result set valid attribut pair structur affin coeffici evalu dice refin control factor return affin rang proport number attribut affin consid class term realiz domain check terminolog relationship attribut thesauru check terminolog valid section ratio posit check number attribut greater number attribut affin consid greater number posit control higher structur affin coeffici class absenc attribut affin consid attribut defin class affin sourc schema fig class student class student definit affin global affin coeffici class denot measur affin comput weight sum structur affin coeffici sa weight sa sa sa introduc assess relev coeffici comput global affin procedur hierarch cluster class analyz comput global affin coeffici place class cluster repeat select pair ch ck current cluster highest affin coeffici max form cluster combin ch ck updat delet row column ch ck defin row column cluster rank greater end procedur figur hierarch cluster procedur weight analyst differ stress impact coeffici evalu global affin consid type equal relev affin set sa global affin terminolog affin coeffici class mean class describ similar concept structur affin evalu coeffici equal return structur affin coeffici global affin coeffici student school member comput school cluster odl class analyz high number class compar affin evalu identifi class affin consid emploi hierarch cluster classifi class group level form tree hierarch cluster procedur fig exploit matrix rank total number odl class analyz entri matrix repres affin coeffici class cluster iter start place class cluster cluster greatest merg updat merg oper delet row column merg insert row column newli defin cluster newli defin cluster remain cluster maximum valu merg cluster remain cluster matrix procedur termin cluster left produc output affin tree fig show affin tree result appli cluster procedur set class room section cl cl cl cl locat cl student professor depart figur affin tree gener mediat global schema section present process lead definit mediat global mediat view data store local sourc start affin tree produc cluster global class global class repres class cluster class provid unifi view class gener global class interact design cl cluster affin tree global schema builder compon momi associ global class set global union attribut class belong cl attribut affin unifi uniqu global attribut global class attribut unif process perform automat concern attribut ffl attribut affin due syn relationship term select assign global attribut global class ffl attribut affin due bt nt broader term select assign global attribut global class output attribut unif process cl fig set global cl dept student tax section faculti addit inform provid complet global class definit momi design interact suppli inform global class tool set candid global exploit terminolog relationship defin common thesauru class cl base design decid suitabl global class design decid assign person global class defin cl map global attribut global class attribut class cl global attribut obtain attribut class cl design type correspond set global attribut provid ffl specifi global attribut correspond union attribut class cl global attribut person correspond attribut school member cl correspond design state valu attribut consid school member involv ffl specifi global attribut correspond attribut class cl default valu assign global attribut correspond class cl default verifi global attribut evalu class design global attribut rank person evalu research inform store attribut research staff set default rank respect research staff attribut global class global class global class odl inform attribut map default valu repres form syntax odl appendix odl specif global class person shown fig addit map rule inform map attribut attribut cluster valu defin cluster class global attribut map rule specifi attribut consid class cluster cl correspond defin class staff dot notat sourc class belong map rule defin global attribut rank rank instanc staff member map tabl maintain defin global store inform map rule map tabl global class extract cluster cl cl fig shown fig global schema mediat global class defin cluster affin tree global class defin check mutual consist attribut express relationship check defin relationship global class attribut correspond exist class belong cluster global class global class defin class referenc relationship defin global class interfac person research school cs person student kei attribut string map rule comput comput comput tax attribut string rank map rule staff member figur global class specif odl queri reformul describ exploit inform global schema global process user submit queri global momi queri produc set subqueri singl inform sourc semant approach process consist main ffl semant ffl queri plan formul semant optim momi mediat oper queri exploit semant optim techniqu support order reduc queri access plan cost queri replac incorpor restrict present origin queri logic impli queri global schema transform base logic infer content knowledg integr constraint mediat global share class belong cluster professor workplac research budget greater select rank domain exist relationship research fund applic state workplac budget greater person rank work faculti research staff dept code null school member null faculti cs person null null scienc professor rank belong scienc student rank null scienc student null faculti workplac area nr budget depart dept dept area null budget descript sector nr fund figur person workplac map tabl belong scientif area odl defin constraint rule global rule foral mediat execut semant input queri appli rule result queri select rank semant perform order add predic process make queri plan formul heavier queri translat interest singl sourc queri process overhead lighter case secondari index ad predic exist involv sourc queri optim algorithm includ present polynomi experi show overhead optim small compar queri process cost set queri perform queri optim gave averag reduct execut time queri plan formul mediat produc optim set subqueri local inform sourc formul inform map tabl global mediat express optim queri term local schema order obtain local mediat check translat predic check algorithm fig determin local queri gener start cluster global class queri user check algorithm cluster cl class begin class ch cl boolean factor global attribut boolean correspond null ch local queri gener ch default ch boolean factor differ default local queri gener ch end procedur figur check algorithm refer step check algorithm exclud school cs student student element step school member deriv queri sourc select lastnam select depart professor integr constraint provid local perform semant queri optim local queri send queri sourc rule provid comput scienc rule foral nr rule optim local queri give select professor transform index nr attribut queri optim knowledg kind knowledg queri optim knowledg type defin term mutual relationship class instanc ext set instanc class cl properti class level class denot ext ext ext class denot ae ext ext ae ext overlap class overlap denot ext ext ext ae ext disjoint class disjoint denot ext ext ext refer design state school member ae ext student class cluster cl mediat exploit knowledg queri process phase minim data access requir user student attend queri select rank faculti queri reformul step determin local queri sourc relat school member student class exploit introduc properti mediat student instanc class store queri consid select queri sourc relat work effort spent problem access inform distribut multipl sourc commun tradit commun import work integr distribut inform sourc tsimmi project garlic project sim project tsimmi project pattern match techniqu match user queri predefin queri store queri model repres object retriev local sourc sim garlic attempt defin global support user queri predefin subset garlic approach build complex wrapper architectur describ local sourc oo languag extens add support path nest collect definit garlic complex object manual unifi local sourc class sim project explor descript logic describ inform sourc approach requir construct gener domain model encompass relev part relat local model gener domain model queri submit optim queri plan comput ai plan techniqu loom knowledg research concentr specif issu relat identif resolut semant inconsist schema exploit definit correspond schema element approach reli terminolog analysi schema element summari schema model provid support identifi semant similar entiti exist abstract descript data sourc entiti semant relat map concept taxonomi main consist defin techniqu base fuzzi logic deriv terminolog relationship schema element approach attribut domain schema element integr constraint sourc schema properli express unifi knowledg element sourc system illustr develop provid support design establish attribut correspond problem data element analysi find candid attribut correspond exploit textual similar data element definit schema inform data statist describ data element valu result appli tool air forc environ discuss approach resolut semant heterogen approach feder notion feder schema futur work present intellig approach schema integr heterogen inform sourc semant approach base compon cluster gener modul minim odl interfac modul gener global schema mediat process odl languag basic function relat thesauru construct cluster implement develop unif function framework architectur present section futur research work devot deeper studi queri process optim develop queri manag function properti relev perform inform integr process view queri process investig impact topic cluster studi order enhanc classif process semant featur refer cy integr data multipl inform intern journal intellig cooper inform system vol pp knoblock process sim inform advanc plan austin aaai menlo yj al integr distribut heterogen proc intl ieee data lo descript logic base tool schema valid semant queri optim object orient proc int conf data april tool semant queri optim proc confer italian associ artifici intellig rome bergamaschi sartori queri optim subsumpt proc int workshop flexibl system pp bergamaschi inform highli heterogen sourc textual cooper inform intern cia lectur note comput februari bergamaschi valid complex object schemata support multipl appli intern journal artifici neural network complex problem solv bergamaschi taxonom reason conceptu acm transact septemb approach extract inform heterogen sourc textual krdb august jm feder relat approach int journal intellig cooper inform rj dl mcguin la structur data model page mw ar resolut semant heterogen acm transact june fernandez ad structur unstructur proc int conf januari pp languag report work group held april de dictionari design proc int conf data april de mg schema techniqu accept public acm transact de giacomo model reason proc int confer deduct lm pm wf aw jh william el multimedia inform garlic ibm almaden research san ca cattel object morgan garcia tsimmi integr heterogen inform ipsj ps combin approach heterogen ifip data semant dayal definit gener integr proc ieee workshop dbm cluster educ book social scienc research ej structur resembl sigmod decemb associ nv academ tsimmi approach data model hammer approach resolv semant heterogen feder heterogen intl journal intellig cooper inform resolv schemat heterogen distribut parallel modern object kim acm ay jj heterogen inform sourc sourc proc vldb mumbai se vldb larg data deal semant proc int conf larg septemb exchang inform data engin mt scrap wrap wrapper architectur legaci data proc int conf larg mp pg methodolog integr heterogen ieee tran knowledg data decemb intellig access heterogen krdb august implement semant queri ieee tran knowl data septemb al inform organ semistructur proc vldb ap sheth jp system manag autonom acm comput vol septemb siegel scior method automat rule deriv support semant queri acm transact vo num dec aa vv common object request architectur technic object request broker task draft decemb architectur futur inform ieee vol wiederhold artifici intellig journal intellig inform special intellig integr vol number june wa wood jg fw publish special issu comput mathemat volum number odl descript languag bnf descript odl descript languag includ syntax fragment differ origin odl refer remaind interfac properti speci namei properti kei speci sourc namei relat object file namei speci extent speci hf kei speci foreign kei hf kei attribut namei arrai rule rule map rule attr namei hand hor hand attr namei hand hand attr namei attr namei hand hor attr namei hor hor attr namei attr namei hor attr namei namei attr namei attr namei syn bt nt rt rule prei prei bodi bodi bodi bodi bodi bodi bodi namei const valuei namei const valuei namei namei namei bodi exist namei bodi const type namei namei foral odl sourc descript interfac interfac sourc relat sourc relat extent extent kei lastnam kei lastnam attribut string attribut string attribut string attribut string attribut string attribut string attribut integ attribut string attribut integ attribut integ interfac depart interfac section sourc relat sourc relat extent depart extent section kei kei attribut string attribut integ attribut string attribut integ attribut integ attribut string attribut integ attribut integ interfac room sourc relat extent room kei attribut integ attribut integ attribut string interfac interfac professor sourc object sourc object extent extent professor kei attribut string attribut string attribut attribut string interfac student interfac sourc object sourc object extent student extent attribut integ kei descript attribut attribut string attribut string attribut locat attribut integ attribut integ attribut string interfac locat interfac sourc object sourc object extent locat extent kei kei attribut string attribut string attribut string attribut professor attribut string attribut integ interfac sourc file extent kei attribut string attribut integ attribut string attribut integ
DB/163 3 improv perform physic analysi bitmap indic kurt dirk wolfgang cern european organ nuclear research switzerland institut comput scienc busi informat austria institut appli comput scienc austria abstract bitmap indic popular data structur access data data support system analyt process main strength provid good perform characterist complex adhoc queri combin multipl index dimens queri research work area finit attribut cardin addit complex design bitmap indic high cardin techniqu appli paper discuss design implement bitmap indic physic potenti search space consist hundr independ dimens singl queri typic cover dimens search space context evalu bitmap encod equal encod rang encod method number bit slice bitmap attribut central paramet paper present result optim number bit slice indic attribut distribut queri select discuss applic dss olap type problem gener introduct big challeng cern european organ nuclear research manag larg amount intern confer expert system applic dexa septemb data complex object result experi particl speed light collid call event measur time interv experi petabyt data written year physicist world life span decad physic analysi task base sequenti scan preselect event queri small select case usag proper index data structur process order magnitud literatur access method varieti indic rang spatial data access method variant data access method indic transact major analysi similar dw applic data access method highli complex queri queri call partial rang queri small subset search space access access method show perform characterist full rang queri partial rang queri bitmap process complex adhoc queri environ basic idea bitmap index store vector bit distinct attribut attribut valu bit map record bit set record fulfil properti focu respect record equal red studi kind bitmap encod techniqu discret valu addit complex design implement bitmap indic valu techniqu appli paper make contribut research bitmap appli bitmap indic high perform physic experi give proof concept tradit physic analysi improv bitmap indic show techniqu data distribut introduc partit equal variant equal encod bitmap indic case crucial point choic correct number bin highli depend number index number dimens search space employ analysi top object manag system contrast bitmap indic implement top mass storag present implement top provid extens perform analysi featur bitmap indic loss directli appli environ dw studi impact data valu discuss impact partit rang variant rang encod bitmap indic cover research commun paper proce section give survei relat work outlin approach section discuss analysi implement top odbm detail evalu index present section elabor optim bin appli result data distribut common analysi section discuss impact rang encod final conclud work section survei discuss relat work detail discuss design bitmap indic base encod scheme present space time complex equal rang encod interv encod bitmap indic evalu equal encod regard fundament method consist bitmap cardin attribut index type index optim exact match queri form queri op op show perform characterist rang encod bitmap indic consist bitmap vector interv encod consist bitmap vector optim rang queri op op op method present work address discret attribut valu data contigu finit techniqu appli tabl depict encod techniqu set attribut valu terminolog valu tabl refer project index method call bit slice indic major problem simpl bitmap handl larg cardin solv indic bitmap vector repres rang distinct entir rang partit equal space bucket case approach indic requir addit queri process time examin detail record match bucket detail analysi solut problem addit tabl project index equal encod overhead retriev data disk match attribut left open issu tabl project index rang encod interv encod encod techniqu base binari encod attribut repres binari form bitmap storag overhead high cardin attribut compar equal encod rang encod optim solut evalu queri exist static dynam queri continu rang select rang discret rang select queri form present static queri question optim design bitmap algorithm base logic reduct dynam queri answer question encod bitmap indic work present work base hybrid approach equal encod top mass storag system bitmap queri provid quick estim size request data answer problem central paramet design optim number bucket bit bitmap indic typic queri profil physicist retriev data regard partial rang queri cover dimens search space subset dimens data retriev data skew prototyp implement creat bitmap index data million event independ attribut regard index tabl length width assum order store chang similar hybrid approach equal encod call partit equal encod short equal encod properti attribut partit attribut energi bin rang electron bit slice assign mean event fall bin step perform rang queri form op op op queri rang interpret term bin easili comput bin scan answer queri bin repres rang distinct edg bin call partial cover queri condit order correct event candid fetch event data disk check attribut queri condit refer check make index highli bound larg number candid candid slice slice cover queri call hit slice case event repres slice hit addit check typic rang queri candid slice hit slice depict fig hit slice candid slice queri rang rang fig queri partit equal encod implement basi implement distribut object manag system high high avail applic scalabl engin event data implement separ feder turn highest level abstract access physic distribut point view system logic unit main architectur aspect depict fig bitmap index feder event fig architectur overview top object directli access object identifi track event data physic event store object directli access oid step check candid slice side fig maintain addit check event posit simpli refer oid list posit fetch event disk check attribut queri condit justif approach carri benchmark pentium ii linux red hat implement top version rest paper experi oper event optim bin complex number bit slice regard paramet kind bitmap index detail discuss behaviour number bin number index attribut vital understand knowledg kind investig special data dw applic gener main motiv similar implement present bin chosen analysi justif elabor optim number bin queri index attribut extend analysi attribut case physic analysi simplic base analysi uniformli distribut data insight perform index domain select optim bin highli depend number cover rang queri gener speak conclud higher search cover higher number bin optim queri perform graph queri dimens perform bin candid check queri constraint event fetch disk number number candid candid slice lower spent fetch event disk reduc time larger number bit slice scan perform boolean oper optim number bin found point found higher queri slight optimum move higher number due higher number candid candid slice higher number bin bin number candid dimens number slowli number dimens bin dimens number bin time dimens number bin dimens number bin time dimens number bin fig optim bin queri dimens distribut physic data studi behaviour event data uniform motiv implement appli typic data distribut found section demonstr advantag index data structur analysi convent method great major physic data gauss exponenti distribut driven physic studi behaviour gauss distribut paramet exponenti distribut paramet number bin set number dimens cover queri result fig bin bin fig variabl select gauss exponenti distribut figur schemat view underli data distribut horizont bar domain select queri percentag bar refer select candid object time execut queri figur queri time highli depend select candid object domain select perform highest highli skew data event follow exponenti point poor perform rang queri reduc neg worst case dynam bin adopt distribut event data case access pattern physic analysi rang queri event current implement proof approach experi cern partit rang encod rang queri common kind queri rang encod perform equal encod contrast base techniqu discret attribut valu problem candid hit slice appli method contigu valu method consid refer approach partit rang encod short rang encod main advantag equal encod worst case bit slice scan rang queri dimens select equal encod bit slice scan studi behaviour equal encod problem candid easili conclud observ impact rang encod worst case bit slice scan rang queri dimens impli candid slice hit slice perform characterist rang queri equal encod rang encod variabl object index attribut studi perform characterist uniformli distribut data fig queri time equal encod select higher number hit slice queri time rang encod constant select hit slice select eq rang fig partit equal encod partit rang encod fact bit slice scan freedom extend number bin theoret maximum cardin attribut deal contigu finit cardin space complex end constraint disk space show behaviour rang encod correspond partial scan event data perform characterist highli depend characterist underli disk page select read rate linear speedup page select smaller turn common rang queri analysi perform studi data point main studi concentr discret attribut valu main bottleneck shown check candid slice due addit fetch event data disk addit design implement top commerci object manag bitmap encod techniqu data distribut analysi partit equal encod uniformli distribut data solv number bin optim queri perform optimum regard high number candid event data low number candid higher number bin queri rang studi partit rang encod discuss complet behaviour attribut infinit cardin true show perform rang encod outperform equal encod number case equal encod design data high freedom number bin indirectli number perform entir index restrict capac storag space refer break sigmod acm sigmod intern confer manag june usa ye bitmap index design sigmod acm sigmod intern confer manag june usa ye bitmap encod scheme select sigmod acm sigmod intern confer manag june usa gener solut sigmod record special interest group manag data june access comput survei septemb dynam index structur spatial proc acm int conf manag automat reclust object larg high energi idea uk informix index support data program februari improv queri perform variant acm sigmod intern confer manag usa lm index queri coordin tertiari storag intern confer scientif statist juli ap encod bitmap index data fourteenth intern confer data februari usa queri optim select sigmod acm sigmod intern confer manag june usa ps bitmap index attribut technic ibm watson research
ML/164 6 cognit issu facial inform multidisciplinari vol automat facial express artifici intellig cognit scienc intersect christin dian depart inform system interv research corpor south florida page mill road fl palo ca motiv recent incent research interact studi mental physic world comput develop approach method predict properti interact support design interfac perform fundament shift interact shift interact architectur main motiv principl comput adapt peopl vice versa face center natur desir find face center interact technic progress artifici intellig area research evolv develop appli machin learn techniqu peopl interact comput field comput vision open possibl place center place interact comput vision interest solv work isol develop sophist algorithm recogn interpret facial inform necessarili solv vision problem research interact necessarili awar recent progress comput brought possibl facial inform comput interfac closer question facial inform motiv foster ongo research artifici intellig cognit scienc paper attempt bring result question disciplin cognit scienc explor potenti build comput interfac understand respond rich inform convei human face inform convei comput user visual input user comput made keyboard point devic user motor channel recent emerg multimod interfac everydai tool restor balanc physiolog impact rich activ find involv recent progress primit context feasibl design environ comput natur feel reintroduc modern comput tool multimod auditori possibl account cognit emot design comput interfac open theori tight interfac affect cognit comput support human user kind task issu affect comput relat influenc necessarili begin emerg plenti evid neurosci psycholog import emot intellig human perform task ration adapt unpredict environ newest kind comput aim adapt prefer intellig interfac customiz interfac respond appropri affect phenomena find opportun understand build multimod tool awar assist psychologist develop test theori human complex system research group work construct comput system capabl recogn respond cognit affect state user involv perform task activ present discuss aim develop automat facial express term signal emot present relev find facial express cognit scienc psycholog understood research interact artifici intellig give overview hci applic involv autom facial express survei latest progress area reach approach comput describ design facial express recogn give background knowledg motiv understand facial express architectur multimod intellig interfac capabl recogn adapt comput affect state discuss current interdisciplinari issu research question address progress area comput facial express recognit facial express facial displai darwin central research interest face correl movement face emot state advoc homogen share convict emot central explain facial movement rosenberg ecolog deriv account evolut signal treat facial displai express social signal intent mean social context recent facial express consid emot contrari view sole emot ekman davidson emot express emot emot view posit basic kind facial action innat facial action read ongo displai facial express emot learn instrument facial action connot emot reflect everydai social smile polit everydai facial express observ interact emot cultur convent emot view small set fundament emot reflex differenti natur trigger stimuli accompani prototyp facial displai basic emot identifi refer linguist label friesen happi recent count express variat prototyp emot express explain reflect elicit blend fundament effect convent relat emot basic emot label group consist collect express question slight moder emot blend singl facial express show express friesen discret linguist label consid artifici studi facial express emot label associ vari cultur work studi found refer emot label cultur determin word languag languag word mean english word anger absenc emot term emot match entir world facial express emot facial emot necessarili identifi mean english emot sad term embodi concept behavior ecolog signal intent facial express consid modal face independ channel convei signal interest note human face capabl set express constitut symbol consid main categori signal face identifi syntact stress lower eyebrow word question mark speaker illustr idea convei interact express ey facial express corner mouth pull listen comment utter understand level head nod eyebrow level understand lower eyebrow lack confid agreement express express longer durat eyebrow commun signal introduc speech dialogu comput interfac takeuchi behavior ecolog view fundament emot fundament express view treat facial displai intern emot output affect program facial displai consid evolv fashion specif select pressur necessarili view fact signal serv social motiv impli innat social cognit mediat adult displai displai dozen displai relationship context interact feel actual form displai depend commun person trait context territori access retriev facial displai mean specifi context issu serv social motiv context motiv relat rang emot social motiv displai serv issu optim improv cultur genet fit facial depend intent behavior context interact brain emot activ regul newest result neurosci plastic human facial action recent consid emot activ regul facial action muscl movement express gener emot physiolog result relat voluntari smile region brain activ davidson suggest voluntarili gener physiolog chang occur spontan posit affect voluntari facial action gener level subject experi emot autonom nervou system activ al theori hold facial gestur regulatori restor function system head view theori postul facial action produc brain blood temperatur consequ consequ produc varieti reason subject obtain temperatur facilit inhibit synthesi movement facial muscl phonet utter pattern result person experi excit similarli temperatur person feel depress person chang temperatur subject effect brain temperatur achiev breath pattern facial explain techniqu influenc techniqu capabl alter brain temperatur reli variat facial vocal plastic human brain number hci applic spread numer imagin comput applic break perceiv suggest facial breath postur move comfort state measur facial signal exist method measur facial movement requir train fourteen review commonli fac max compar explain briefli facial action code system friesen wide anatom base system measur visibl facial movement fac describ facial activ term muscl brow correspond correspond fac fac free theoret bia mean facial behavior analysi group muscl underli facial movement defin au account facial au account gaze direct head orient train coder identifi specif au present observ durat intens record score facial express consist list au produc fac defin group underli express emot face fac build autom analysi facial action al explain outperform human task classifi upper facial action maxim discrimin affect code system theori base measur visibl face categor facial compon base theori area face involv emot unit formul term relev specif emot score facial movement relat contrari categor movement group muscl fac techniqu measur electr activ attach electrod surfac face measur activ visibl al social signal point research human percept measur facial express plagu inconsist stimuli measur larg list basic express emot deriv larg point possibl constrain result particip shown facial imag sequenc term list emot term particip scale present list emot displai present facial imag procedur particip term list emot rate scale addit particip type emot term displai facial intens rate final particip respond freeli facial imag term choic describ rate express found express studi carefulli examin singl set stimuli measur al result studi show evid method bia identifi basic express except found case fear displai ambigu constrain procedur final controversi issu facial express perceiv human vari continu underli belong qualit discret categori model extrem emot fall edg encod orthogon bipolar dimens pleasur emot fall center consequ account linear transit express accompani characterist identif transit happi face angri face pass neutral face transit express ly opposit point emot space pass neutral transit express involv enter region emot emot space abrupt account predict consequ identif physic transform facial express chang facial express artifici comput facial imag comput vision research size facial categor studi emot color speech perceiv direct reflect continu physic properti mage young studi found phenomenon linear physic stimulu perceptu occur categori boundari easier detect result influenc comput vision research cottrel method rate percept facial express studi found facial express transit perceiv continu categor al opposit emot space transit happi face angri pass neutral face issu highli relev ai research comput vision system aim automat facial express interpret implement test comparison system perform human expert evalu comput system perform lead mislead claim comput recognit facial express carri perform test requir psychologist cognit ai comput vision research psychologist cognit scientist strongli benefit progress comput vision facial express recognit time process carri requir hour measur minut facial express al mean natur facial express percept recognit inher interdisciplinari articl attempt bridg gap disciplin section comput vision research made find psycholog cognit scienc automat facial express recognit applic interact applic relev facial express expect ten year price digit camera drop make visual awar research artifici intellig system interest develop comput environ exist number applic hci make automat facial express recognit main motiv principl applic give abil comput adapt natur abil vice versa relev express interpret vari depend chosen type applic explain facial express consid express commun signal express emot emot activ list type applic hope motiv research facial express interpret discuss psycholog issu wai view facial express question applic user interest work express frustrat monitor learn process program coach assist learner program languag lisp adapt detail explan suggest base level current strongli benefit adapt feedback level emot intens distanc instructor experi distanc learn report grasp level understand distant student teach reli feedback face pace repeat portion lectur face express move point face chang express understand confid inform instructor feedback facial express recogn oper record video distant learner invalu tool possibl gener averag global level understand class simpli displai teacher welcom instructor gaug level understand remot student automobil driver car manufactur compani work ad sensor exterior car improv control option sensor perceiv wall stop slow engin avoid accid sensor ad insid car monitor alert level driver inform car equip send nice cold water issu visual vocal warn sensor perceiv issu wise messag engin stop stress similar situat monitor air plane pilot worker potenti highli stress indic panic distress sourc concern monitor facial express recogn act stress detector similar lie detector assist detect li import note accuraci issu case lie indic reveal truth ly al subtl differ express found form smile peopl portrai peopl enjoi smile lip accompani muscular activ conceal neg emot muscl orbit ey show activ al current progress comput vision domain feasibl train system identifi detect select facial action high accuraci lie detector base psycholog result mention find applic current technolog lie detect system oper court polic truth crucial import ethic issu applic address facial data mass appeal obviou digit comput longer view machin main machin attend wai peopl commun peopl excit post camera top person comput displai face love exchang email indic shift comput commun technic speak amount inform transfer back exce reason bandwidth good time commun decod actual imag collect digit interpret express send entir commun result happi option involv anim chosen avatar displai arrai store express avatar receiv end anim base result interpret current express sender anim inform term intend express pleasant real solv bandwidth problem send larg data file inform facial express resolv misunderstand observ commun exchang facial express unavail user person type field grow benefit identifi person question facial express reveal relat person type interest studi access type inform enabl person interfac match person prefer individu prefer work peopl work peopl person person type encod comput agent digit assist prefer user assist interact visibl softwar product test data piec softwar consid simpli collect interrupt user fill questionnair product satisfi practic disrupt workflow subject involv type questionnair automat facial express recognit provid analyz data product satisfact record facial express statist data time user show content specif stage interact infer drawn data softwar interrupt person interact softwar collect data entertain comput obviou realm applic benefit autom facial express recognit field entertain comput game game player intrigu respond state entertain oblivi health famili work close psychologist social system assist detect emot import gener inform record facial action pattern chang treatment depress frequent displai sad indic patient depress facial displai show happi indic patient peopl dissoci emot express emot experi softwar product capabl monitor dissoci activ lead benefici inform emot regul commun facial express consid feel understand feel awar feel assist determin express style facial express express express substitut express emot experienc peopl awar express style mate obviou reason time facial express provid facial imag interpret commun exchang trainer system enabl peopl awar possibl learn possibl adjust express disambigu express peopl commun ubiquit number facial express relev hci explod number comput applic time blackboard comput power imagin bedroom wall perceiv moment fall time turn lamp older peopl report opportun move turn switch preciou moment sleep wake state awar applic import issu error correct advantag applic make research effort worthwhil review approach automat facial express recognit lot research field face gestur recognit outstand result led creation intern confer dedic specif face gestur intern confer automat face gestur recognit major accomplish field rang track segment recogn face project research past centuri facial action signal strategi enabl recognit memori receiv attent compar question face recognit comput vision research human face concentr issu identif person recognit face categor face ag recent approach studi import facial express system train face recognit facial express al number applic involv face identif set bank facial express orient face pictur multipl unpredict automat facial express recognit interest illustr numer applic deriv expect assist automat facial identif process recent grow interest field comput vision specif recogn facial express number system dealt issu relev facial express recognit technic approach imag motion black yacoob davi darrel pentland essa pentland anatom model water essa pentland neural eigenfac holon cottrel cottrel rumelhart hybrid system al bartlett al give overview latest progress separ major technic approach connectionist neural network approach approach facial express recognit approach process facial inform iyengar typic assum face face repres term area featur term moment invari paramet extract full facial view face store locat memori model carri find individu featur measur statist paramet describ featur extract descriptor approach effici select featur featur select easi task type model limit match target face face present mean model perform face imag survei comput approach facial process iyengar number attempt made recogn facial express system pursu machin interpret facial express term signal emot expert machin interpret identifi basic sad friesen model adopt line earlier facial affect score techniqu friesen tomkin anatom fac friesen convert face geometri static facial action format classifi express match typic muscl movement facial action found basic express output system form emot label strength studi measur perform model compar human expert facial express recognit result suggest interpret achiev gener consist colleg student formal instruct emot signal model anatom model face water interpret facial express pentland limit approach accuraci result depend valid anatom model face build determinist model human face motion challeng rang differ exist individu face rel approach analyz motion extract dynam muscl action sequenc optic flow method estim motion vector arrai point call flow field repres arrai arrow flow indic direct magnitud displac imag locat earli experi facial action form featur vector categor disgust nineteen test data identifi correctli system guid psycholog find davi base analysi optic flow field comput imag sequenc human combin face recogn express construct level facial action optic flow input comput high intens gradient point primari featur face system made limit assumpt head undergo rigid motion displai facial express recogn facial express sequenc imag head motion difficult problem due occurr rigid motion problem address model rigid motion collect parametr model yacoob imag motion ey model imag flow model paramet correspond facial express gener imag sequenc sequenc includ express basic express friesen total express express fear sad found difficult elicit compar subject move head avoid profil view system achiev success recognit rate depend emot recogn disgust rank clear recognit rate arriv system result compar express elicit system result human subject rate input imag sequenc point earlier address carefulli light procedur measur facial action connectionist approach facial express recognit connectionist model network simpl interconnect process unit oper parallel term neural network refer approach process unit network function metaphor neuron human bodi unit receiv input sum calcul output send unit unit connect learn acquir result modif strength connect akin synapt interconnect higher weight stronger higher neuron neighbor neuron activ learn knowledg retain strength connect neural network learn pattern object recognit cluster specif target provid target input desir target network learn success modifi strength connect direct reduc error output neural network offer potenti face process notori deal potenti conflict data power explicit priori knowledg data categor human face variat motion individu abil learn neural network appli learn acquir gener newli encount data accur approxim unknown system base spare set noisi data tempor neural specif design deal tempor expand applic domain facial inform multimedia process gener hwang connectionist neural network model face process typic oper directli face form pixel intens contrast approach face survei connectionist model face process al categor neural network linear implement princip compon task includ recognit categor face sex nonlinear network compress network princip compon analysi find set compon dimens account differ data set pca facial imag eigenfac pentland holon cottrel ghost face set templat similar facial imag compon imag measur princip compon eigenvector extract matrix set facial imag treat vector eigenvector repres set assum model refer defin gener posteriori statist basi flexibl advantag facial imag made major face race minor face eigenvector repres featur inform discrimin face learn algorithm neural network back propag william rumelhart backpropag network contrast linear associ network input unit directli connect output includ layer nonlinear hidden unit input output unit algorithm involv propag forward flow activ gener input layer output layer hidden hidden unit comput weight sum input transform activ function logist backpropag differ actual output desir target backpropag layer weight connect unit adjust order minim error network output desir target holon eigenfac input backpropag network perform emot gender recognit test facial network found human subject distant emot earlier scheme facial imag singl neural network classifi facial express compar cottrel ey mouth project ey mouth area eigenvector obtain random imag patch system perform accuraci gener imag note connectionist model advantag preserv relationship featur high sensit variat light head size pictur cottrel problem justifi larg amount work preprocess imag normal size posit perform automat algorithm locat face imag rescal pentland region featur track implement algorithm rang data develop davi similar algorithm intens imag develop involv learn correl facial featur motion pattern human emot al hierarchi network approach base emot decomposit hierarch complex recogn facial express divid layer decomposit layer identifi express occur network level separ network train network express emot multipl subject layer identifi motion facial featur left emot network broken special facial featur layer recov motion sensit direct motion specif facial featur specif emot individu network train recogn smile express test abil perform successfulli familiar success rate test abil perform successfulli sequenc unfamiliar success rate test abil reject sequenc express emot network tune success rate neural backpropag built recogn facial express express rumelhart common autom process recogn extrem express network design figur inspir notion area face capabl independ muscular root lower face includ nose chin express shown area face shown upper part face forehead smile shown lower face ey muscl discuss includ pose full face neutral full face smile pictur design approach test scalabl imag network includ layer input layer hidden unit layer output unit input unit pixel intens arrai crop imag output unit express express express rang hidden layer connect portion face output unit order simul face percept connect model local pattern recognit algorithm refer recogn express label provid order input mask binari valu emot recogn basic neutral binari output valu turn express remain turn output includ level express facial imag express face head express measur lid chin express face forehead mouth chin figur network design target output hidden layer order test portion built deal portion face rumelhart design procedur test network gener imag train test network gener train person express test network gener peopl result retent gener suggest zoom area face express interpret offer result process full face similar result arriv studi cottrel express express recent result found neural network cottrel model categor percept facial express al network model consist neural network train backpropag learn input princip compon patch randomli select face imag result show close correl human studi network except studi compar approach problem automat detect al hybrid system develop combin holist spatial princip compon measur local imag motion flow field estim hybrid system shown classifi upper facial action accuraci system perform human highli train expert facial express recognit recent result neural network approach appli autom facial express recognit show lot progress made concept earli neural classifi smile frown recent attempt suggest facial express recognit comput approach feasibl facial express emot explain automat facial express interpret integr larger system recogn affect multipl modal overview multimod affect process interact interfac affect cognit relev hci field interact recent wit adapt customiz interfac cognit user extract repres student user find inform hypermedia tailor inform present user tasso comput interfac adapt specif suitabl teach give user feedback user predict user futur behavior action occur research hci ai benefit learn strong interfac affect cognit affect state plai import role aspect activ find involv exclud task perform front comput awar user receiv piec inform provid valuabl user simpli user track action observ cue emot advantag result recent emot consid process mention identifi phenomena interact affect expect studi manipul build intellig interfac acknowledg organ memori recal event mood learn occur comput learn environ aim elicit affect state experienc record learn process order reduc cognit overload percept select happi neg emot make user influenc affect read text experienc neg valenc emot state lead interpret read text posit state comput interfac awar current emot state tailor textual inform maxim understand intend mean text goal patient damag frontal lobe commun system unabl result complet set unabl decid action perform normal emot intertwin goal gener emot influenti priorit activ level import determin valu cognit style peopl posit experi diverg neg tend sequenti process experi option strateg time constraint quick action fear neurolog shortcut pathwai decid action prefer optim slower peopl person prefer model type user model person al refin affect profil focu emot restrict rang cue util fewer cue attend tucker motiv emot intens optim point user model provid qualit quantit feedback student reflect feedback receiv includ affect feedback state experienc user record task interest point directli relat inform convei face posit consequ posit posit consequ neg emot signal action place order maintain chang kind situat interact environ facial express neg emot state feel frustrat overwhelm observ face comput user level categor familiar object prefer object user model aim discov prefer acknowledg make knowledg peopl prefer object shown object prefer facial smile express content import inform exchang bodi languag voic facial express reveal emot content facial displai connect aspect peopl recept inform learn depend visual feedback feedback perform subject recept feedback imag face give feedback face feed back emot intellig learnabl peopl learn recogn facial express accuraci train strong interfac affect cognit versatil comput agent hand attempt enabl comput tool acknowledg affect phenomena remain blind desir emot complex attempt recogn import acknowledg compon pattern human complex parallel process mechan mcclelland mcclelland rumelhart reli simultan mix sensori impress store scenario recogn pattern facial inform recognit except parallel comput system success recogn affect facial inform combin pattern receiv modal give review compon affect phenomena relev background affect thought interfac cognit affect happen princip level intern mental affect influenc inform affect subject experi intertwin cognit process interact affect cognit typic studi focuss associ structur repres type element consid affect cognit repres multipl includ motor system observ case affect mood emot eventu result cognit easili identifi motor smile frown embarrass tap pound shoulder repres organ activ involv problem peopl found answer scratch head stroke bite lip suggest cognit affect repres motor system build tool observ measur motor expect build rich reveal affect cognit enrich interact tool illustr figur emot elicit combin biolog actual gener basic emot state includ autonom muscular activ depend number gate exist conflict emot state compet muscular cognit consciou unconsci suppress emot gener autonom nervou system subject experi marku recent view plastic brain includ mechan consid result emot facial activ breath sourc architectur affect process interact architectur system input mental physiolog compon emot illustr figur compon identifi collect observ user receiv sensor auditori system intend receiv input linguist tool form linguist term emot describ subject experi emot visual sensori input kinesthet touch cognit input auditori hear affect output system form synthesi emot concept sensori observ synthesi constitut descript user current includ suggest action chang state discuss section system design extend provid multimod feedback user depend current state exampl adjust chang interfac agent voic slow pace tutor select facial express anim agent express motor subject experi affect express vocal facial motor subject experi affect auditori visual kinesthet linguist affect percept prosodi recogn facial express recogn haptic cue gener natur languag processor affect recognit figur hci recent progress ai domain machin speech haptic make integr techniqu build intellig interfac reflect import emot human intellig main sensori system machin percept visual kinesthet auditori natur languag process process affect percept facial express pentland essa pentland yacoob feedback affect predict davi water lam davi davi cottrel vocal emot prosodi analysi essa advanc wearabl comput capabl categor signal blood pressur spoken written natur languag ortoni percept understood term measur observ behavior motor system correspond high probabl emot experienc subject interpret measur percept contextu possibl multimod inform treat separ architectur affect gener product cognit gener combin cognit sensori gener gener order enabl comput system level understand user emot state gener state comput system similar properti function human consid step build understand affect express vocal prosodi express believ agent semant descript comput script speech dialog facial displai takeuchi agent adapt interfac appropri adjust output voic depend recogn user state person user agent forthcom articl gener comput state observ state effort work affect comput environ affect interpret measur integr interpret contextu inform model multimod integr integr acoust visual inform offer improv research area multimod integr huang multimod integr highli relev affect recognit natur emot emot close relat cognit facial express gener emot physiolog facial express emot interpret carri carefulli human percept visual emot cue perform brain mechan compar percept auditori emot cue visual modal facial cue mediat differ visual cue comput percept benefit differenti subsystem multimod integr perform studi import healthi human emot compon comput implement recognit capabl gener capabl result exhibit differ perform emot construct subsum heterogen group wai emot human level human percept emot cue implement circuitri product emot distinct true comput percept product desir system function seek interfac recogn express affect state attract improv commun comput user involv build interfac render comput primari mean achiev charact care adapt induc emot desir current record rememb user state chang pace tutor session base monitor user cognit emot state similar manner coach adjust feedback depend level guid user avoid cognit emot path block human reli process perceiv make subject wai analyz recogn cue subject experi formal automat manner implicitli adapt interfac multimod devic vocal provid adapt feedback user desir give comput agent awar emot state user feel infer drawn motiv impli takeuchi motiv agent initi action search retriev agent compet level compet level evalu updat term accuraci predict made observ user explicitli chang aspect agent interfac depend user option peopl prefer direct manipul user remain control interfac directli alter aspect recent interfac agent assist reduc inform overload mae broader ai affect simul gener lead develop comput model emot order test emot theori provid artifici environ explor natur develop emot learn naiv predict behavior build user improv ai control plan algorithm time pressur signal intens artifici motiv develop intellig softwar agent robot motiv state agent commit ongo activ base valenc current state slow wast energi reevalu continu multidisciplinari issu research question address current question address interdisciplinari real progress achiev automat facial express recognit find benefici interact psycholog research separ issu question intend cognit hci ai research interest facial express recognit cognit scienc psycholog issu individu indic exist differ term durat facial express individu variat express emot occur event question psycholog artifici differ consist emot situat time psychologist answer benefit ai research comput vision automat pattern recognit except result recogn pattern manner case speech recognit expect case facial express answer question provid valuabl cue begin address contextu situat easier includ situat stimuli elicit express emot interact emot facial question facial activ part emot experi interest environ aim recogn affect state import circumst kind peopl physiolog relev emot subject experi evid visibl express facial activ facial displai facial displai affect reflect emot signal intent respond appropri controversi assumpt peopl relat comput social actor nass suggest import comput tool recogn respond appropri signal intent person trait question benefit interact research find person mood facial marker infer drawn occurr facial express emot depress reveal frequent express patient portrai constant face person trait hold specif set favor enabl interfac agent adapt interfac person user volit evid neurosci neural pathwai volit facial express activ import question hci differ express occur spontan occur voluntari al involv muscl movement pull lip corner activ muscl orbit ey differenti smile reason accuraci prove valuabl hci psychologist collect data focuss comput vision algorithm ey area digit reach accuraci type posit emot relief distinct form posit emot share impli specif distinct posit emot infer behavior contextu cue facial inform smile issu highli relev build interfac agent capabl recogn affect phenomena question distinct form smile import interfac agent smile kind artifici intellig comput vision issu previou section point recent progress field automat facial express demonstr place facial inform commun question answer realiti strong gener feret facial imag face recognit specif facial express recognit enabl research compar system compar human perform hci ai research merg effort share result process necessit express recogn integr visual track captur facial imag segment facial express good pointer emot studi confirm exist distinct neurolog system human deal volit spontan express abil convei emot proce separ track spontan involuntari experi express emot result mind speak automat recognit facial recogn express volit spontan hair style recognit unfamiliar face render recognit difficult hancock automat hair face facial remov crop imag reduc introduc hair style person facial express complic exist micro extrem rapid fraction typic miss observ micro express reveal emot person conceal macro typic rare automat recognit concern princip macro express express declin seri consecut pictur frame train test order recogn entir express import note system point perform human facial express recognit process issu perform bring develop method compar automat human perform system valid compar output judgement human expert recogn human feasibl work express user frequent state experienc interact environ peopl typic experi pattern state varieti emot state experi everydai life limit number state frequent identifi regular pattern involv similar manner mae suggest identif enabl facial express recognit analyz express context occur integr static imag recognit motion recognit real time recognit facial express reli good face difficult vision problem good interpret facial express tune user context cultur integr modal doubl check predict similar stork interact ethic issu issu address panel affect emot user interfac intern confer intellig interfac al includ suggest comment discuss panel discuss anthropomorph interfac human comput interfac make interfac easier make interfac mention effort introduc commun signal speech dialogu interfac takeuchi aim system improv humancomput dialogu introduc behavior dialogu system benefit intend reduc stress experienc user lower complex understand system statu point studi human face interfac necessarili give expect result goal hci synthet face give comput human establish interfac specif attent gender person type ag group address question face began studi al effect receiv neg evalu imag oneself comput screen receiv receiv lead higher evalu percept valid neg feedback addit question express face portrai context applic face answer peopl emot social commun research invit join interact research set studi answer facet question perspect role emot interact cognit discuss earlier current anticip answer question expand current interact emerg inhabit multipl devic complex web futur ubiquit comput add context answer question effort establish relat involv question peopl thought emot comput experi feel emot interact comput emot anxieti novic comput perceiv peopl experi fear disgust comput technolog major experi emot time interact comput technolog order document case video student interact comput tutor record analyz term facial express draw statist effect interact kiosk equip facial express recogn determin user emot differ person context studi term affect interact peopl feel scrutini machin monitor interpret emot person type matter peopl remain experi express emot comput technolog case comput issu feel machin vanish peopl experi express emot interact comput scrutini potenti concern emot inform privaci kind medic record privaci question matter technolog interpret interpret emot state potenti manipul assist user daili enhanc emot awar emploi technolog deal affect inform potenti enhanc qualiti life discuss applic section technolog facial express recognit improv commun teach peopl awar facial express facial express emot substitut emot experienc found girl interact comput game found enjoi enter secret interact softwar charact exhibit strong social emot skill user control share privat notion scrutini vanish issu remain individu user valu capabl technolog awar emot state peopl feel manipul machin peopl feel manipul machin capabl feel manipul unnatur increasingli numer machin interact studi norman book thing make smart move orient life point view technolog serv vice human technolog import inform technolog continu affect increasingli aspect life exist potenti risk find natur abil feel express emot due prolong exposur comput interfac awar mention respond rich affect social world odd peopl todai exist comput interfac feel neg manipul orient life technolog peopl peopl toler machin greater number varieti role fill import challeng user interfac design user perspect order acquir design develop skill understand predict user experi order guid design appropri design acknowledg social factor differ social context person type matter polit receiv context studi reev polit expect comput technolog nass realiz strong interact affect memori retriev mean task involv work set consid level cognit link affect emot phenomena explor rang lead intellig agent interfac capabl affect affect enhanc user satisfact subtli respond current state reev nass result impli nass peopl recept comput media peopl interpret comput social design interfac adapt type user appeal technolog product state frustrat threshold level frustrat toler reflect lack feel lack societ level enabl comput system recogn respond emot apolog understand allevi impact experi undesir flow function design danger creat affect charact creator care import believ speaker deriv congruenc signal commun channel messag perceiv congruent channel facial bodi vocal inton convei messag believ comput avatar endow commun capabl multipl potenti believ conceiv similar manner human believ trust fool design conceiv applic crucial danger creat comput interfac good believ affect capabl possibl expect remain capabl system comput express manner understand user start human intellig expect set system behavior human interfac system enhanc function improv user disappoint system design remain user intellig system interact natur manner system perform relat interfac perform system poor perform facial express depend lead major recognit rate good import enhanc commun tremend ad affect modal sourc plain textual commun creator affect interfac care similar manner creator highli function unawar interfac comput user sane satisfi role emot cognit process discuss architectur system acknowledg interfac affect cognit provid multimod intellig feedback point issu involv automat facial express recognit interdisciplinari perspect cognit scienc hope discuss motiv research individu interdisciplinari perspect refer ms facial express comput imag role emot believ commun acm essai bodi motion commun pennsylvania press facial express rigid facial intern workshop automat face gestur ieee facial express imag sequenc local parametr model imag intern journal comput vision ieee winter american psychologist introduct softwar bradshaw softwar agent aaai dimens cognit comput aspect face recognit theori spontan symbol implic facial present meet intern pittsburgh simpl student model make student sixth intern confer af jt lg principl inferenti element cambridg gener affect journal american voic societi develop emot kt intern review studi volum de applic lawrenc erlbaum associ facial displai research languag social interact determin facial journal nonverb behavior gender recognit touretzki advanc neural inform process volum san morgan kaufmann descart error book gestur analysi interpol ieee transact pattern analysi machin intellig express emot man anim murrai chicago biologi studi affect davidson natur fundament question oxford mechan journal consult clinic psycholog artifici bat sonar neural network complex pattern recogn face speed move biolog cybernet comput cognit emot method abstract annual volum measur facial ekman handbook method nonverb behavior research cambridg express psycholog scienc express american psychologist smile region brain psycholog scienc natur fundament question oxford press emot express brain physiolog journal person social psycholog guid recogn emot facial englewood prentic hall facial journal psycholog nonverb behavior journal person social psycholog affect score valid final report nsf plan workshop facial express understand face basic appli studi spontan express facial action code system oxford press emot commun human comput rudimentari model affect cognit bulletin cognit societi facial ieee workshop articul interpret recognit facial ieee pattern analysi machin intellig recognit handbook percept facial cognit ma neural network model micro phd dept stanford ma face featur intern joint confer neural aj human facial evolutionari view san academ press guid import breath rate index breath connect plenum emot cambridg press comput theori design emot cognit emot analysi speaker affect workshop perceptu user emot intellig book dissoci emot express emot person person social psycholog bulletin comparison unit visual measur facial behavior research instrument comput affect emot user intern confer intellig user interfac acm seamless interfac intern confer human factor comput system acm ce maxim discrimin facial movement code system unpublish manuscript instruct resourc user sixth intern confer springer wien interpret design expert system interpret facial express term signal cognit scienc comput user frustrat phd mit media art scienc network intellig multimedia ieee mechan emot emot current opinion neurobiolog nervou system differ psycholog scienc facial action gener autonom nervou system relationship emot function approach semant cognit emot assess user prefer jameson al sixth intern confer springer intellig comput script emot sixth scandinavian confer artifici intellig io press frontier artifici intellig user model workshop person emot express recognit neural intern florida artifici intellig research symposium confer menlo aaai mcclelland parallel distribut process explor microstructur cognit volum psycholog biolog model mit press design autonom agent mit press reduc work inform commun acm facial express optic ieic transact issu comput vision neural network environ adapt work note aaai spring symposium seri intellig environ technic report menlo aaai simul emot synthet review human vocal journal acoust societi america dialogu facial multimod annual meet associ comput face comparison interact face intern confer human factor comput system acm thing make defend human attribut ag machin good product person comput mit press cognit scienc face imag classifi advanc neural inform process system mit simpl neural network model categor percept facial twenti annual cognit confer cognit scienc person maker activ jameson al sixth intern confer springer experi divid commun cognit affect comput mit press media equat cambridg press facial review neurolog psycholog mechan produc facial psycholog bulletin mechan underli face process tempor cortic visual process facial imag oxford express recognit motion radial basi function network ieee transact neural network rj intern error rumelhart mcclelland parallel distribut process explor microstructur cognit volum foundat mit de parallel distribut process explor microstructur cognit volum foundat mit press model journal person social psycholog recognit emot facial review psycholog bulletin pa recognit analysi human face facial pattern recognit teach agent commun acm multimod ieee manipul interfac agent debat iui chi interact recognit system affect intern confer signal process lo ieee comput societi boden philosophi artifici intellig oxford tj face recognit verif elli ma jeev aspect face process overview imag featur sensori integr pattern recognit intern confer automat face gestur recognit lo ieee comput societi synthesi facial imag sequenc physic anatom ieee transact pattern analysi machin intellig journal cognit neurosci model face pattern recognit human face intern confer human factor comput system acm la son son social emot cognit scienc bring design softwar design den year comput interact work paper design project human face compon rang ieee confer comput vision pattern recognit facial express twelfth intern confer pattern volum face show intern workshop automat face gestur express test categori account emot cognit american psychologist facial implic theori psycholog review express temperatur van van de essai emot theori lawrenc hard cognit behavior cambridg colleg busi creation pm chang save pm save colleg busi total edit minut print pm complet print number number number
IR/165 5 logic structur detect heterogen document class leon marco aiello marcel wor intellig sensori inform univ netherland institut languag univ netherland abstract present fulli implement system base gener document knowledg detect logic structur document gener layout inform assum focu detect read order system integr compon base comput arti cial natur languag process techniqu promin featur framework abil handl document heterogen collect system evalu standard collect document measur qualiti read order detect result compon system present discuss detail perform system document collect document logic structur read order natur languag spatial reason introduct goal document analysi automat process scan document convert digit process digit inform process consist layout analysi document understand layout analysi constitu document imag page identi ed classi ed text imag object font textual geometr spatial relat extract inform captur layout structur document understand layout structur classi es item logic item detect relat read inform captur logic structur document analysi system develop make speci priori document knowledg system literatur implement commerci softwar successfulli handl simpl document layout structur advanc treatment color complex analysi heterogen class document de nite challeng task open question paper answer question document data set larg collect document detect logic structur focu read order detect fundament part logic structur read order sequenc textual document object user read document hand detect read order scan document layout structur introduc compon full advantag layout inform rst compon base formal method spatial set document rule decid read order formal correct spatial point view compon base natur languag process consid text present textual document object identifi syntact plausibl read order author system detect logic structur scan text develop domain speci system develop asada process scienti paper layout logic structur domain knowledg deriv classi cation rule main shortcom system adapt class document exchang inform layout logic appli iter improv layout logic detect previou system document fall speci class step gener made al distinct categori knowledg identi speci class document gener independ class document pitfal reduc gener document system applic color document overlap present process attempt automat gener rule detect logic structur gener class document system learn train set rule convert layout logic structur li ng document understand system learn abil direct weight graph repres layout gener class document consid tree li ng geometr inform extract logic structur content kei role priori document knowledg detect read order textual element document achiev textual content element turn impli natur languag process framework extract logic structur layout structur make content document preliminari result present extend framework wai provid vertic assum anymor logic object classi cation priori ectiv spatial reason natur languag process techniqu remaind paper organ section describ adopt layout logic structur document section present architectur describ compon result evalu discuss section document document imag analysi process document author process similar document model requir document class document model repres complex document structur encod relat document object model exibl suitabl broad class document document set layout logic li layout structur document set layout document object set geometr relat document ho current implement layout structur categori layout imag graphic deal gener exibl list featur xed set bound box document object featur consid font size ratio de ned ratio font size current document common font size entir aspect ratio de ned width divid height document area ratio de ned ratio object area page content size de ned number font style valu hold singl relat list relat spatial relat consid document object adjac product allen relat document equal adjac relat determin base voronoi diagram logic de ned analog layout structur set logic document object set logic relat ho layout logic structur assum bound box textual document object system extract logic structur shown figur rst modul bottom assign layout document object logic creat set logic object process detail section type read order extract present section read order type combin set admiss read order spatial reason modul shown set reduc natur languag process modul section rg og set og ol rl comput relat figur system architectur layout detect granular text block geometr featur content classifi layout document object determin read order focu text document object outcom system imag figur input imag result document object classi cation depict admiss read order detect spatial reason compon shown nlp compon remov read order give output correct document object classi cation broad class document limit number logic document object type common text document logic bodi caption page number studi ground select ve featur de ned section discrimin logic type present express adjac relat featur distanc closest figur distanc adjac current text document object closest gure document object neighbor gure neighbor list distanc maximum featur set present discrimin type font size ratio discrimin titl bodi aspect ratio di erenti titl caption bodi area ratio discrimin page number bodi content size separ page titl caption bodi font style separ titl caption bodi text distanc closest figur discrimin titl caption featur discrimin reliabl select figur font size ratio featur shown bodi caption page number document object document object repres index figur process document imag actual featur axi bodi text time equal titl larger expect except due error font inform due peculiar speci document caption valu font size ratio featur time equal closer except due document style caption written larger page pictur caption except rule produc overlap valu make select dicult uniqu featur space classi cation figur font size ratio featur bodi caption page number document object read order detect present compon detect read order scan document assum layout structur focu extract uniqu read order spatial reason document object bound box document object consid logic analysi natur resort formal method base rectangl allen van benthem independ calculu time interv identifi basic relat calculu prove success cite work ai recent extens dimens calculu rectangl idea rectangl model set rectangl set allen relat rectangl document ax order layout slightli adapt origin rectangl model boundari rectangl size de ned scale scan document prompt rewrit allen relat account thick boundari preserv fundament properti relat interv jointli exhaust disjoint true end point coincid start point allen origin work true di erenc end point start point smaller identi ed boundari rectangl rectangl model thick boundari spatial reason consist geometr inform layout build rectangl model document encod set document rule constraint document rectangl rectangl model ecient constraint satisfact solver check consist document rule instanti textual document object illustr kind document rule gener basic fact textual compon read top left written constraint rectangl model meet meet overlap overlap textual document object formal properti rectangl order rule consid irrelev check consist instanti rule rectangl model decid complex polynomi bound rule constraint set admiss relat forc read order prefer horizont direct vertic asada work section introduc layout structur ho rectangl model subset spatial reason build element ternari relat ord interpret document object belong logic structur immedi read document object logic structur spatial admiss read order ord logic structur ord textual object consist read order relat ord check rectangl model point underscor intend unconstrain variabl read order sequenc object ord document object rst argument ord tripl ord tripl refer figur note set pair relat ord independ form direct graph document object edg graph interpret node read node condit de nition total strict order node graph nal output spatial reason modul set spatial admiss read order set pass compon check linguist admiss natur languag process number case singl read order appli spatial reason complex layout harder identifi uniqu correct read order appli spatial reason rel posit text block respect consid content text textual inform consid mean decid potenti read order correct fulli understand content document current state art natur languag process current result shallow nlp tool tagger contribut resolut read order ambigu tagger assign dt word punctuat sign current statist tagger base tree assign correct tag word word program context program noun context program import skill tagger reli statist inform tag feasibl inevit statist model fail situat incorrect tag assign word misclassi cation accuraci impact evalu read order sequenc permut rst read order admiss spatial reason decid read order focu transit object respect read order consecut object read comput transit score de ned object tag word end rst word begin object identi ed refer tag object rst refer word restrict sequenc length due data expect train corpora small assign reliabl frequenc occur sequenc transit score pair comput start start end hyphen end hyphen jt rst case distinct implement simpl heurist deal sentenc boundari hyphen transit score case comput maximum likelihood tag sequenc remain situat jt comput divid number occurr tag sequenc train corpu number trigram occurr comput analog reader refer man textbook introduct statist natur languag model decid read order document page textual object transit score comput product transit score consecut text comput score rank di erent read order experi consid read order highest score experi evalu appli method english document imag document ii magazin scienti articl journal present result modul give gener evalu system current identifi independ textual gener order object total compar gener total read order set independ read permut independ read order de ne total read order correct ident permut document object classi cation document data set color imag scan imag resolut dataset ground truth layout logic structur page document object bodi page number titl figur exampl heterogen document data set evalu featur base classi consid ground truth de ned error rate fn gt fp gt gt repres ground fn number document object class detect fp number wrongli classi ed current type complement ground truth gt de ned number document object minu current type classi er consid quadrat classi er tabl compar result classi cation quadrat classi er ldc type gt bodi caption titl total total number half class select train set rest test set compar result present tabl averag error made classi cation block comput averag item matrix quadrat classi er classi cation tabl matrix classi er promin mistak made caption titl bodi text titl caption tabl matrix quadrat classi er present tabl bodi caption titl bodi caption titl method select train test small data averag error made classi quadrat classi averag matrix present tabl tabl matrix quadrat classi method bodi caption titl bodi caption titl error made due overlap featur valu variat document style dicult exampl figur figur object imag size aspect ratio make similar titl page larg imag text font size ratio featur comput correctli read order detect appli spatial reason natur languag compon detect read order subset english document dataset provid result compon separ standard ectiv measur inform evalu spatial reason nlp system spatial reason set spatial admiss read order compar ground de ne correct read order analog nlp compon read order compar ground truth number ground truth de ne independ read order subset textual object page di erent articl independ text block inform author exempli ed figur compon return total read read correct ident permut independ read order de ned ground truth refer set permut ground truth set correct read order spatial reason compon de ned li correct read spatial admiss read spatial admiss read order uncertainti spatial reason compon evalu nlp compon bit set admiss read order identi ed singl read order read order maxim transit score spatial admiss read order evalu nlp de ned statist read order incorrect spatial reason present result appli gener rule section rectangl boundari current thick boundari speci set spatial rule set rule constraint spatial admiss read order forc document idea document organ vertic horizont accept subset object read tabl result appli spatial reason compon detect read order relev avg size document document object read order avg diculti trivial easi medium hard averag median tabl result appli spatial reason document english data set summar depend number relev document object di erent subset document consid higher number document harder task analyz document hand row sort ascend order diculti rst number document shown number relev document text present number read order number relev document object displai number comput factori number document object number identi ed spatial admiss read order output spatial shown fth evalu perform spatial reason averag document class consid row column tabl intuit statement diculti process document class row summar result collect give averag valu median median signi current context distribut read order extrem skew natur languag process result document english document document partial disambigu spatial reason compon retain spatial admiss read order nlp compon appli document tabl result nlp compon document avg document spatial admiss read order mention tabl discard evalu nlp read order correct appli nlp compon read order chang fact remain document show averag mean approxim page statist read correct situat read order due ocr error text block start word recogn ocr softwar tagger assign wrong tag word comput transit score base result score deviat score correct tag gener evalu system give evalu rst explain combin compon evalu identi cation singl read rst case account situat spatial reason compon uniqu identifi correct read order case account situat spatial admiss read order identi ed statist read correct case account situat compon exclud correct read order tabl present averag identifi uniqu read order english document tabl result system document avg present result encourag clear improv previou due speci constraint thick boundari rectangl nlp compon bene ted recogn hyphen implement languag model comput transit score method base gener document knowledg detect logic structur document gener layout inform assum layout simpli geometr font featur textual identifi logic structur reason accuraci main contribut present approach li gener virtual assum document handl system current implement work english techniqu present appli languag restrict english nlp compon moment tagger english consid tagger number languag system applic languag spatial rule emploi spatial reason compon gener appli document prepar common knowledg proce remark gener framework move document di erent rule prompt rewrit spatial reason redesign document analysi framework set achiev gener kei problem address futur investig deal independ read order fundament reason document text independ read strict sequenti order newspap promin scienti document frame tabl exampl sort item di erent natur constrain uniqu total read order pictur surround text relat time word block text partial strict total repres logic structur document nal output system extract logic structur scan document independ interest vertic integr present framework move imag process scan natur languag pass constraint satisfact techniqu formal method integr spatial natur languag inform innov document analysi understand made rst integr distinguish titl quotat block text form column resort layout appli spatial reason constraint textual content document object distinguish titl citat natur languag process disambigu spatial admiss read great assign type individu document set step inform integr document analysi understand acknowledg leon support den technolog project marco aiello support part italian nation research council grant support physic scienc council nancial support netherland organ scienti research project refer compon complet text read ieee pp structur analysi document imag base emerg pp level knowledg approach understand document pp optic scan pp document label rule extract recur pp li document classi cation extract system learn pp linguist spatial inform document multimedia inform pp knowledg tempor commun acm pp survei fundament geometr data acm comput survei pp year document imag analysi ieee tran pattern analysi machin intellig pp type style base imag pp pattern ieee transact pami pp van logic vol del model reason tempor intern confer principl knowledg reason pp morgan constraint logic program tag intern confer method languag man foundat statist natur languag mit document ii collect document modern inform addison lexic distribut linguist data intern confer document analysi recognit
IR/166 5 comput scienc technic report inform gather agent queri web search engin daniel adel comput scienc colorado state fort technic report comput scienc depart colorado state fort research support part contract nsf research initi award inform gather agent queri web search engin daniel adel comput scienc colorado state fort abstract inform gather agent attract attent late attract intellig assist navig world wide web larg acut inform agent provid easili access environ idea area integr develop inform gather agent call savvysearch intellig search multipl search engin web savvysearch track exist search engin manag resourc usag submit queri search engin implement adapt simpl idea machin inform retriev plan test issu search engin select knowledg acquir improv user find high qualiti result return earli limit parallel provid current result autom acquisit lead good select perform restrict resourc order parallel search produc satisfi user research support part contract nsf research initi award inform gather web find specif site inform inform connect site world wide web difficult tool search lyco match user queri web resourc interest program act directori index allevi navig difficulti push problem back navig search languag user interfac area search tool limit document abil find relev document corpu suggest search engin attempt index entir web lead repeat effort user specif inform queri search engin find relev document address problem navig search develop metasearch call direct queri search engin judg agent balanc expect resourc consumpt expect benefit submit queri multipl search engin agent maintain integr knowledg current past function search engin internet applic savvysearch design provid framework investig merit easili extens search engin modular design expedit replac compon describ architectur implement savvysearch simpl idea machin inform retriev plan test issu search engin select knowledg acquir improv user find high qualiti result return earli limit parallel provid approach inform gather inform retriev research popular year spring symposium inform gather includ larg number paper agent agent web inform agent design web search specif inform faq file newsgroup heterogen sourc agent refer domain depend util complex logic semant domain model describ distribut agent aid locat price product intern predic logic relat product descript inform domain output inform sourc input common techniqu system system divid function exploit parallel gracefulli deal immin failur wide distribut process concern applic model goal treat inform gather task larger requir complex solut search web find web resourc trivial task naiv approach start home page follow link intuit lead direct resourc roughli analog wander countri side hope find address road lack map webwatch project address problem assist user link start gener subject web page machin learn page link find relat inform webwatch learn predict link interest user passiv user link offer suggest world wide doubt encount myriad search yahoo web crawler power search engin aid process search web search result displai form web document consist list link deem relev search queri search engin search subset million web document search engin return desir refer web crawler search larg automat retriev index url refer occurr queri search manual creat index high level web document yahoo result typic cost return fraction quantiti web crawler return avail search engin lead discoveri problem inform corpu document target discoveri corpu document reach queri match set document set search engin gloss project suggest solut discoveri problem construct integr index number document word includ queri submit relev select anticip produc relev result disadvantag gloss search engin cooper suppli index inform add prohibit amount administr complex number solut involv similar differ assumpt made avail search engin unavail inform accumul increment learn data actual user queri result return search engin search web parallel natur problem place search addit level abstract call varieti tool simpli list pointer search index user awar inconveni search enter submit queri repeatedli user interpret heterogen result nativ format search engin shortcom motiv true savvysearch system metacrawl metacrawl distribut user queri parallel search engin knowledg base full text result retriev web rank convent inform retriev techniqu ad benefit retriev document abil appli sophist queri languag metacrawl success prune irrelev result standard rank import issu parallel specif send conceiv hand select hundr issu includ deal evalu facilit extens savvysearch goal savvysearch assist internet user find relev inform submit queri multipl search engin oper perform presenc minim resourc consumpt maxim search qualiti resourc limit make impract send queri search engin program consid poor citizen web user serv small set result relat search engin wait privileg search savvysearch access web engin produc subject user inconveni retri wait search engin select base inform dynam natur characterist search engin chang time index updat algorithm improv associ search engin chang qualiti modul frequent averag time server faster night slower earli inform gather web view simpl plan problem goal find site satisfi specif criteria action queri search engin search plan constrain resourc time alloc queri internet resourc consum plan gather inform specif queri consist sequenc parallel queri search engin user decid intermedi point resourc desir figur show result interfac design plan bach suit queri consist set term express inform desir select queri oper insert term opt simplifi queri languag maintain simplic interfac expedit connect search engin queri savvysearch construct sequenc parallel execut step user view result step decid execut step follow link current result subsect describ plan creat learn earlier design user exert control search engin select resolv knowledg savvysearch simpli inform gather plan start execut requir user select architectur view tool architectur type search engin interfac interfac agent http commun search agent commun user interfac agent facilit incorpor varieti search interfac agent design accommod target search engin user interfac failur mode savvysearch reli knowledg current condit figur user interfac version show present result queri displai agent result queri feedback agent www knowledg user interfac dispatch agent agent lyco ftp search agent interfac agent figur multipl agent architectur process queri ship queri search engin core knowledg track effect search engin respond previou queri word queri entri entri summar previou perform search engin queri word higher valu repres queri word acquisit support knowledg section dispatch agent dispatch agent queri inform knowledg base rank set interfac agent determin initi group queri submit list search knowledg search engin network dispatch agent produc search engin respect fit queri impact network condit resourc reason includ balanc network resourc consumpt qualiti inform obtain properti specif search term introduc ancillari queri gener natur inform sought dispatch agent version savvysearch creat search plan step search engin rank respect queri current network condit predict perform rank highest term lyco web crawler yahoo bach suit undefin search engin total tabl data number search engin search comput search engin rank predict return result combin queri score current data expect wait time number result ffl queri score determin feedback weight search engin queri term pair weight divid total feedback respect search engin weight search engin ad comput initi search engin score queri score search engin queri string ffl entri singl queri term search engin sum feedback weight search engin tabl show simplifi entri term sum data search engin queri score comput score queri bach suit search engin lyco ad score eb ffl score fine tune ad recent perform inform search engin recent queri search engin comput averag number hit averag time perform inform search engin combin fraction denomin multipli arbitrari constant make perform data order magnitud smaller score data desir effect rank search engin util data rank search engin data extern observ search engin characterist comput combin determin rank search engin queri concurr calcul reduc resourc demand savvysearch period high network machin demand concurr proport estim queri cost submit search engin queri fewer search engin queri concurr comput cost expect network local cpu queri discrimin contribut concurr sum ad figur rel traffic dai ffl expect network load estim current traffic difficult estim base traffic node queri unit past time dai expect network load comput static log file produc web server figur typic load time dai period low network load high contribut vice versa ffl local cpu load comput current system output unix command map interv interv import incorpor type load net local cpu load fluctuat constantli good indic network activ ffl discrimin address search effort find satisfactori measur specif gener queri term larg amount bach tabl queri repres area search engin suspect fewer search engin queri term current knowledg search engin area inadequ topic area cover search search place find relev document discrimin calcul divid total number refer count term sum row tabl number refer frequent referenc term sum domin term averag queri interfac agent interfac agent translat queri form specif search submit retriev result search engin interfac capabl system requir queri term join boolean oper system implement option search form build interfac agent search engin queri agent design gracefulli respond except condit error unexpect result result forward displai agent standard intern format interfac agent maintain addit inform includ dynam qualiti target search engin averag resourc constraint limit number retri event failur interfac agent emploi basic failur cope abil retri queri event remot failur displai agent displai agent organ result interfac agent displai easili interpret manner user address time versu organ result displai agent simpl top default search engin displai order arriv result collect process search result displai order suggest search engin interleav avoid requir wait result search engin begin displai part resourc reason creat iter process user decid search wait deem inappropri wait result rank function base variabl score target search engin local qualiti measur search engin queri conceiv retriev full text referenc document perform addit convent inform retriev appeal approach wait time prioriti implement effect metacrawl system acquir support knowledg support knowledg includ static dynam knowledg cost success queri measur cost base network local cpu expect qualiti inform collect statist typic usag server period dai profil cpu usag knowledg queri success construct passiv accumul user feedback store number search engin number term entri measur effect specif search combin structur extens classic inform retriev context map keyword document effect valu determin log queri acquir earlier version system heurist user link weight matrix adjust increment word valu queri term search produc relev result increment search feedback queri length entri word bach tabl document return lyco queri word bach deem relev user result link select link produc web constantli updat normal held constant experi reflect chang inform design system involv ultim test user util measur util varieti unsolicit user number link queri explicitli request user feedback test underli techniqu improv user util gener savvysearch great success april form previou design receiv dozen favor comment daili steadili averag queri dai stress determin aspect design work view current design continu improv base learn experi intend learn work experi build web inform gather agent savvysearch agent notabl metacrawl significantli avoid comparison learn system design expect inform quantiti result directli resourc inform qualiti result care resourc queri search aspect current design contribut resourc resourc calcul select search engin plan size directli proport current resourc plan sequenc depend critic search engin select process ran seri experi determin characterist current design affect qualiti inform displai user measur qualiti number link queri report user satisfact reliabl measur track interest user follow requir addit effort user suscept user bia user give posit feedback nice neg encourag improv user collect data learn pilot experi complet trust direct feedback internet commun expect user unwil time provid direct user provid noisi feedback stuf appar random found internet commun directli make heavili weight aspect system earlier scheme weight system base user ei skeptic determin system success report feedback summari primari qualiti measur analysi answer question ffl plan order plan step order higher qualiti result return earli ffl select strategi qualiti depend search engin includ plan current approach user find earli process execut plan sequenc select strategi fault address collect data variant approach basic design section approach basic design step execut select displai gener step approach basic design search engin randomli select replac step approach basic design plan step execut select randomli search engin select randomli plan figur approach immedi execut step displai result search approach immedi execut step select random displai approach construct search plan search engin randomli order immedi execut approach construct search plan search engin randomli order immedi execut step select random version vari select search engin plan order approach target control address empir question parallel base load conduct experi ad link primari savvysearch page common search user find version particip ran variant time collect data queri interfac ident user told search plan construct expect step displai left data collect queri number step step link execut search engin queri user express satisfact queri answer separ neg plan length plan step request visit tabl approach raw survei data perform measur blank cell data summar data qualiti measur separ plan length plan step plan length requir queri search engin current level plan length plan step search engin search engin plan step step sequenc execut receiv request result user link user link plan step approach link step approach link step approach link step approach receiv answer user found result satisfact approach approach approach approach number tabl show raw data count approach summari basic approach exhibit highest qualiti perform measur present user result expect lower qualiti solut satisfactori plan order test question analyz qualiti result depend plan step execut analyz separ data approach plan length approach plan ran tabl test qualiti depend variabl plan step independ expect qualiti depend plan step approach simpli select composit step randomli plan length approach plan length approach found statist effect plan step qualiti approach plan found effect plan step posit lowest except approach plan length step includ search plan length parallel forc emphasi search engin case data declin link due posit guess effect assum order good close content step select strategi address question involv compar approach number factor involv plan step analyz data compar pair approach hold constant plan step length compar approach approach approach approach method determin plan step execut reduc amount select common plan length plan length pair approach plan construct tabl row column number queri column link qualiti significantli higher approach approach step higher step differ statist approach qualiti significantli higher step step higher significantli tool paper set implement previou version reli sole term queri select search engin submit queri fix number search engin current focu improv search engin select evalu role user process design run experi test complex acquisit techniqu newer scheme incorpor posit neg feedback amort term effect number term queri longer queri receiv weight scheme adapt inform retriev techniqu standard paradigm search corpu search set searcher corpu unknown investig categori simpl mechan user disambigu word mean user role search process mode internet inform acquisit search specif interest inform user mode result greater number search model satisfi result fewer sourc mode approach evalu level interact parallel search sophist result present style interact search versu term satisfactorili assess effect reduc parallel user satisfact current data averag user execut plan step experi gaug exact effect reduc parallel produc result formul experi address effect current resourc reason satisfi search vast web space architectur base simpl applic machin inform retriev plan studi expedit integr techniqu indic worth plan framework paradigm give user control architectur facilit extens mitig domain depend intend enhanc current design sophist techniqu expect search engin engin continu import resourc human user inform gather agent refer robert dayn thorsten tom mitchel learn world wide web craig knoblock alon work note aaai spring symposium seri inform gather heterogen palo marko balabanov yoav shoham learn inform retriev experi autom web craig knoblock alon work note aaai spring symposium seri inform gather heterogen palo mic peter michael schwartz scalabl internet resourc research problem approach august william cross search page david eichmann ethic web agent electron world wide web confer mosaic richard robert adam pratt inform broker craig knoblock alon work note aaai spring symposium seri inform gather heterogen palo david jerri yang yahoo home page lui hector anthoni recal gloss estim discoveri intern confer parallel distribut inform system kristian robin charl steve approach knowledg navig craig knoblock alon work note aaai spring symposium seri inform gather heterogen palo craig knoblock alon editor work note aaai spring symposium seri inform gather heterogen palo craig knoblock integr plan execut inform gather work note aaai spring symposium seri inform gather heterogen palo koster configur unifi search engin henri lieberman agent assist web fourteenth intern joint confer artifici page august steve research servic michael mauldin catalog internet michael mauldin john web agent relat research center machin translat present august august tim victor lesser cooper inform distribut problem solv approach technic brian pinkerton web crawler home page erik selberg oren etzioni metacrawl www search engin erik selberg oren etzioni search comparison metacrawl intern world wide web decemb zilberstein anytim comput approach inform gather work note aaai spring symposium seri inform gather heterogen palo
IR/167 5 client side learner chen meng depart comput texa pan american west tx usa abstract paper report research build intellig web engin predomin featur contrast lack adapt learn featur exist metasearch equip practic effici learn algorithm capabl user search desir document feedback queri popular search engin perform document learn client side architectur perform discuss introduct world wide web evolv grow web interfac human user vast inform gold mine part peopl daili life design implement practic effect web search tool challeng task call innov method strategi field includ machin learn direct build intellig engin top exist search engin prove practic effect user search desir inform peopl exist popular search engin process commerci interest process unavoid repres higher level inform food chain interest discuss etzioni impact engin search engin number popular success engin dogpil infer find metacrawl common properti engin engin singl unifi interfac user enter queri user start search process enter send queri collect search engin parallel retriev top match relev document engin metacrawl sort retriev document singl list infer find cluster retriev document search engin customiz featur user custom list paramet enhanc filter rank perform author exist engin support adapt learn user feedback engin classifi shallow engin deep metasearch engin shallow engin simpli echo search result search engin sort effort limit deep engin search result search engin start search adapt learn user feedback boost enhanc search perform relev accuraci search engin method adapt learn process engin point engin lightweight requir larg larg amount memori intellig process search result return search engin recent research web commun raghavan chakrabarti al short list hit return search engin start set great effort appli machin learn web search relat scientif articl locat user profil gile gile crawl mccallum step build intellig deep engin queri popular search engin perform document learn client side predomin featur contrast lack adapt learn featur exist equip learn algorithm capabl user search desir document feedback design learn algorithm tailor version case web search learn disjunct relev surprisingli small mistak bound independ index attribut successfulli part learn compon project al web search learn investig fowler chen al intellig web search model adapt learn process learn littleston search engin act learner user teacher user send queri engin queri search index return list url rank rank function user engin relev engin feedback improv search return refin list url learn process end engin find desir document user conceptu queri enter user understood logic express collect document user list url return engin interpret approxim collect desir document realiz case web search user gener patienc coupl dozen interact search wait dozen minut engin return search result realiz web document index attribut extrem high huge vocabulari keyword index realiti web machin learn algorithm applic web search rocchio relev popular queri format method inform retriev rocchio salton essenc adapt learn process exampl prove zhu typic similar measur cosin dice jaccard learn algorithm relev feedback linear lower bound boolean vector space discret vector space lower bound relev algorithm similar measur lower bound hold arbitrari initi queri arbitrari threshold updat coeffici step learn process lower bound impli contrast success theori rocchio relev feedback algorithm good choic web search vector space model yang salton repres document introduc tailor version exploit natur web search contrast fact set initi weight set initi weight promot process set initi weight simpl motiv focu attent propag influenc relev irrelev document adjust search space approach realist exist effect document rank mechan coupl learn process discuss section algorithm tailor maintain weight wn attribut att att maintain real threshold weight ff promot demot factor classifi document vector xn satisfi irrelev user document contradict classif make mistak denot weight current updat user respond document contradict current updat weight ffl document judg user relev vector xn set ffl document judg user irrelev vector xn set ff denot total number distinct index attribut relev document judg user learn process mistak bound obtain formal proof interfac web dispatch user figur architectur found chen al learn collect document repres disjunct relev attribut boolean make ff ln ff ff mistak architectur work program code architectur shown figur run ultra sun workstat requir larg larg amount memori search process creat thread destroi thread search process end size easili convert port run environ platform design scale popular search expand featur ad predomin featur compar exist fact learn user feedback client side learn algorithm prove surprisingli small mistak bound chen al compon web browser client side interfac shown figur user enter number url select popular search engin perform initi search enter queri click search button start invok parser queri inform feedback inform interfac dispatch decid current task initi search process learn process initi search dispatch call formul queri fit specif format target search send formul queri number url relat metasearch list relev document search engin call receiv collat index index attribut set index attribut automat extract retriev document receiv document construct point final present top bottom collat list retriev document user judg relev document set format present top bottom document shown figur document url radio button user document relev url clickabl view actual document user make judgment accur user click radio button select relev irrelev click feedback button submit feedback click button view document enter queri start search process current task learn process user relev dispatch send relev feedback inform learn search process shown figur perform march queri word desir web document relat texa pan select search engin northern light interact relev irrelev document judg user relat web document initi match document move top posit figur interfac rithm relev irrelev document judg user posit neg exampl promot demot weight individu document promot demot judg document finish updat call document present top bottom user step learn document rank queri simul realiti user model teacher learn littleston learn algorithm document rank queri simul wn weight vector rank function independ defin rank function web document vector xn fl fi remain constant document learn process strategi defin pagerank page addit tune paramet individu document promot demot document judg user feedback learn process motiv individu document promot demot statu document clear judg closer top rank support weight sum closer bottom fi fl fl fi updat similar fashion updat rank function rank document classifi return top relev document bottom irrelev user top bottom document repres approxim hypothesi made user examin short list feel satisfactori result end search process find document list relev feedback user interest top rank tune altern select bottom document randomli select document classifi irrelev learn algorithm perform actual perform impress made public interest reader access url end paper check perform conduct formal perform evalu report statist full version paper point search satisfactori result achiev interact document judg relev feedback document averag collect attribut automat extract retriev document index attribut collect popular engin compar popular success dogpil infer find metacrawl dogpil queri search engin direct dogpil open collect featur engin februari figur initi queri result dogpil web infoseek real yahoo headlin perform parallel queri search user custom search specif engin cluster list hit return search servic adapt learn featur user feedback infer find queri search perform parallel queri search user custom search sort cluster list hit return search servic adapt learn featur user feedback metacrawl queri search perform parallel queri search user custom search specif engin collat sort list hit return search servic normal confid score sum score rank adapt learn featur user feedback queri search northern support parallel queri user favorit search servic import featur adapt learn abil user feedback conclud remark author deep ultim goal engin servic retriev list hit collect search engin servic start search adapt learn user feedback boost enhanc search perform accuraci search servic engin point deep engin lightweight requir larg larg amount memori step achiev goal deep implement winter break academ year power effici learn algorithm equip function document index adapt learn user feedback search desir document initi stage improv enhanc aspect improv thread manag current version easi crash thread compet limit memori resourc url infer northern figur refin result interact exampl refer queri concept learn machin learn modern inform retriev autonom web agent automat retriev identif interest public intern confer autonom acm press system automat person track scientif literatur web fourth acm confer digit acm press anatomi hypertextu web search engin seventh world wide web confer automat resourc compil analyz hyperlink structur text seventh world wide web linear lower bound learn relev feedback submit februari adapt featur learn document learn web search submit learn web search submit februari search web queri knowledg inform system lower bound relev feedback discret vector space submit march queri complex web search februari infer web commun link topolog ninth acm confer hypertext hypermedia jj relev feedback inform retriev smart retriev system experi automat document englewood authorit sourc hyperlink environ journal acm index retriev scientif literatur eighth acm intern confer inform knowledg manag learn quickli irrelev attribut algorithm machin learn reinforc learn spider web effici sixteenth intern confer machin learn vector space model automat index comm acm automat text retriev inform comput search comparison metacrawl fourth world wide web confer metacrawl architectur resourc aggreg web ieee expert
ML/168 6 fourth intern confer automat face gestur recognit abstract face small surveil imageri wide field view typic larg distanc camera scene task face resolut enhanc techniqu gener numer resolut enhanc algorithm limit fact make assumpt scene algorithm learn prior spatial distribut imag gradient frontal imag face proce show prior incorpor resolut enhanc algorithm yield fold improv resolut time addit pixel introduct approach resolut enhanc make weak assumpt common assumpt imag markov random field assumpt aid resolut gener assumpt applic imag class imag human face small subset develop algorithm specif human face outperform gener algorithm figur illustr gaussian pyramid fairli high resolut imag face figur includ similar pyramid lower resolut imag pyramid start higher level resolut level match resolut enhanc pose predict lowest level gaussian pyramid algorithm learn resolut enhanc frontal imag face pyramid base algorithm learn prior deriv high resolut imag function spatial locat inform higher level pyramid prior incorpor function demonstr algorithm learn enhanc resolut fact face show face simon baker kanad robot carnegi mellon pa usa high resolut pyramid low resolut pyramid outperform cubic interpol algorithm wide margin algorithm enhanc imag face bare detect factor direct give pixel freeman recent learn framework applic imag interpol appli algorithm gener imag obtain good result algorithm close relat illumin normal algorithm respect show illumin normal frontal imag gener object algorithm call resolut enhanc algorithm major advantag approach multipl imag video tradit resolut enhanc algorithm human face face paramet model estim predict high resolut version face algorithm work imag small pixel activ model base locat point face imag triangul element model essenti point approach similar techniqu algorithm schultz hardi al textur synthesi algorithm de bonet viola bergen applic enhanc theori algorithm gaussian pyramid start level imag set imag chosen ¢ fix size oper combin smooth step step detail oper vari author author found perform algorithm larg independ choic chose pixel averag ¥ ¥ definit consist imag format integr pixel pyramid comput definit illustr figur term gaussian resolut enhanc algorithm function lower resolut imag creat gaussian pyramid start higher level imag time smaller start level illustr figur resolut enhanc consist ¢ ¥ estim assum low resolut imag captur camera perturb addit iid gaussian ¢ low resolut pixel weight sum high resolut pixel addit relat pixel function low resolut pixel weight high resolut pixel overlap tion equat express equat implicit express unknown high resolut imag term low resolut imag ¢ equat solv directli unknown high resolut imag ¢ ¥ unknown equat common approach situat solv maximum posteriori solut law maximum posteriori estim high resolut ¢ ¥ imag law estim problem ¢ ¢ constant ¢ logarithm function monoton ¢ ¢ ¥ ¥ term express probabl low resolut imag high resolut imag depend ¢ distribut assum iid £ covari ¢ ¥ £ ¥ constant depend £ equat ¥ discuss prior term schultz hardi al markov random field prior algorithm prior predict train sampl collect high resolut train imag human face comput gaussian pyramid comput ¢ ¥ laplacian pyramid horizont deriv gaussian horizont vertic £ £ £ ¥ vertic £ ¥ £ deriv gaussian pyramid detail form pyramid featur £ £ low resolut imag time smaller train comput gaussian pyramid level ¢ upward illustr figur comput featur pyramid level lower level featur pyramid describ algorithm predict piec notat pixel level parent level defin parent structur tor pixel level algorithm predict denot predict gradient prior predict algorithm pixel high resolut imag predict creat space find ¥ copi distanc function £ weight norm found perform larg independ eventu gave deriv compon half weight laplacian valu reduc weight factor pyramid level algorithm similar random textur synthesi algorithm de bonet viola differ determinist valu parent structur vector randomli sampl set valu differ spatial variant pixel algorithm pixel train sampl horizont vertic deriv high resolut imag ¥ extract equat deriv equal valu parametr express deriv term unknown pixel high resolut imag assum error predict actual deriv iid gaussian covari £ ¥ £ £ £ constant depend £ note function ¢ legitim reason gradient prior predict algorithm divid set imag collect base made step subclass denot determin subclass class express ¥ simplifi function equat express unknown high resolut imag deriv linear unknown pixel ¢ ¥ equat form weight squar problem unknown high resolut imag pixel high number unknown number pixel high resolut imag directli solv linear system size prove problemat gradient descent algorithm standard diagon approxim hessian determin larg step size error function algorithm converg singl global minimum result experi conduct subset feret data set consist imag individu women imag align approach assum part face roughli part imag align perform hand mark locat center ey lower tip nose point defin affin warp warp imag canon pixel imag imag pixel averag give methodolog test algorithm process time test set imag individu entir train set test set select random train set ad synthet variat imag train set translat pixel input imag rm error pixel cubic percent number train sampl rel error compar cubic face imag random imag miscellan imag number train sampl rel error compar cubic addit sd addit sd addit sd addit sd number train sampl perform train sampl perform type imag robust time small amount step enhanc perform algorithm vital note due lack space result section illustr subset initi case enhanc pixel imag give pixel imag set experi design show algorithm learn enhanc resolut vari number train sampl graph result figur averag pixel error plot number train sampl curv face cubic algorithm algorithm perform cubic incorpor knowledg type imag import point note perform algorithm improv number train sampl result figur averag imag test set idea variat result test plot figur percentag time algorithm cubic train percentag drop train algorithm perform cubic time justif algorithm perform frontal face figur present result worst perform imag imag test set rm qualit variat perform imag note imag column higher resolut input high resolut detail cubic result column figur present similar result imag face comparison type plot rel rm pixel error compar cubic plot absolut rm pixel error plot curv rel rm pixel error random miscellan imag imag consist imag outdoor find algorithm improv face random imag miscellan imag set algorithm investig robust perform presenc addit intens result present figur ran experi figur appli algorithm ad gaussian standard deviat imag standard deviat result figur plot rel rm pixel error absolut plot curv standard deviat grei level result show standard tion perform unaffect standard deviat perform drop quickli algorithm robust type toler bit degrad perform imag similar figur valid result present result multipl pixel imag tradit manner assum video face multipl slightli translat imag simul feret randomli translat origin feret imag multipl time amount form input section algorithm term singl imag extend multipl slightli translat imag straightforward multipl copi equat input imag equat modifi slightli rel translat imag formul stai essenti result includ figur input consist input cubic origin input cubic origin version pixel imag leftmost translat random amount input align standard parametr motion algorithm multipl imag algorithm appli result column huge improv cubic interpol schultz algorithm note high resolut featur eyebrow lip evid input standard test enhanc qualiti unlik result mark differ input output discuss present algorithm predict gradient prior shown incorpor prior resolut enhanc algorithm shown algorithm huge improv exist interpol algorithm small number pixel imag human face fuse singl pixel imag close resembl origin face factor contribut high perform algorithm time demonstr algorithm improv face recognit perform leav task futur mention coupl point inform ad resolut enhanc face recognit algorithm develop work low resolut output algorithm util algorithm make develop low resolut face recognit algorithm easier research worri addit complic introduc low resolut imag algorithm human shown figur person confid shown pixel imag great deal common resolut enhanc recognit approach work form recognit discret recognit made step gradient predict algorithm determin train sampl input low resolut local featur detector resolut enhanc depend featur detect al relat face recognit algorithm enhanc person recogn low resolut imag enhanc person major differ extrem recognit made result imag feret data set show approach real surveil algorithm data captur surveil camera build automat system implement face pose featur local algorithm learn algorithm heart approach input cubic schultz input cubic schultz nearest neighbor algorithm learn algorithm perform systemat comparison techniqu explor featur space equat interest question featur acknowledg research paper support dod grant harri shum point work freeman matthew point work edward face group cmu comment suggest refer baker kanad face technic report robot carnegi mellon septemb hierarch motion estim page fast filter transform imag process comput graphic imag laplacian pyramid compact imag code ieee transact de bonet multiresolut sampl procedur analysi synthesi textur imag graph page de bonet viola statist model natur imag advanc neural inform coot learn identifi track face imag sequenc page freeman learn vision seventh armstrong joint map registr imag estim sequenc imag ieee transact imag bergen base textur siggraph page rizvi feret evalu methodolog algorithm cvpr page flanneri numer recip cambridg quotient class base recognit synthesi vari illumin cvpr page schultz approach imag improv definit ieee transact imag schultz extract frame video sequenc ieee transact imag digit imag warp ieee comput societi lo
ML/169 6 view classi er system tim depart comput scienc bristol bristol england abstract work suggest wai michigan genet reinforc argu suitabl tradit system suitabl xc dissoci genet algorithm polici determin xc type michigan classi er system contrast pittsburgh system learn classi er learn classi er system extent discuss issu domin intern workshop learn classi er system report workshop robert smith lc set algorithm detail de ne solv class problem wai lc set conceptu detail de ne direct develop method de ning issu lc necessarili conceptu central problem address workshop discuss clarifi de conceptu conceptu issu remain concern classi er system seri short essai titl learn classi er recent public conceptu issu address classi er system evolutionari system system classi er system incorpor evolutionari reinforc learn algorithm hybrid natur inappropri attempt cast strictli aim work con ict view relationship rel import classi er system quot suggest tim holland discuss learn subsystem rst classi er clear genet algorithm primari learn system credit assign system process form simpl seri store memori inform consequ action process complex learn process novelti ofth model perform simpl learn process process memori quot view con ned earli work classi er quot learn classi er system applic genet algorithm machin classi er system literatur contrast role ga lc thought techniqu group classi er system ga stori group pair ultim goal classi er group quot role compon discov classi mean classi er thing situat correctli connect condit action discoveri compon search speci axi classi er maxim gener quot meant suggest opinion issu classi er system worthi examin section di erenc classi er system genet algorithm brie di erent type classi er system di erent view consid view classi er system unawar opinion natur classi er system rst began work concern unsur di erenc genet algorithm classi er system lc combin product view classi er system rule discoveri system credit assign system reason rule discoveri system typic genet lc addit compon decid credit assign system call tness function genet algorithm credit assign lc complex exampl function ga kind tness function left product system real di erenc lc ga product system conceptu straightforward task simpli appli rule classi er system appli ga kind problem wrap ga machineri product system special kind tness interfac ga form oper cover lc essenti ga view consist holland classi er system machin learn system classi er system view classi er system essenti ga extrem view exist addit classi er system rule discoveri mechan trigger chain bridg corpor linkag system ga compon rule discoveri import lc oper heavili case ga consid oper classi er system classi er system essenti ga contradict recent work lc altern rule discoveri system justi cation insist ga evolutionari algorithm altern suggest time ago recent work genet program genet algorithm signi amount recent work system evolutionari algorithm accept system classi er system work system deal broader concept ga wrap discuss trend li scope work link classi er system mainstream rl trend break view classi er system system detail account di erenc defer work tim seek link classi er system mainstream reinforc learn rl made great introduct classi er clear classi er system rl address issu address rl gain integr classi er system mainstream rl bridg classi er system mainstream rl consensu discuss leav contradictori view classi er system call lc essenti applic ga problem lc kind rl system ga interest issu credit assign view place di erent emphasi di erent issu relat primari place greater import credit assign exist altern view beg import classi er system solv problem evolutionari solv rl system aim work exist altern literatur aim clarifi justifi lc signi argu di er fundament holland extent close resembl mainstream rl system tabular neural basic understand distinct ga rl view lc unclear review rl algorithm imposs reader interest subject encourag consult requir read appli lc rl problem futur lc research sequenti heavili ground import issu address lc research address rl evolutionari approach bene understand approach classi er system major type classi er system hybrid literatur classi er system ga oper chromosom complet solut set xc origin studi lc strongli integr lc literatur integr mainstream rl await view classi er system common lc chromosom partial solut hybrid michigan system exist di erenc michigan pittsburgh system di erent approach section di erenc account di culti classi er system work michigan relat pittsburgh system highlight make matter concret michigan classi er xc introduc wilson popular classi er system primari distinguish featur base tness rule accuraci predict reward contrast tradit tness rule depend magnitud reward receiv di erenc number consequ version xc minim made order make system function classi er capabl task gener similar zc li fact algorithm similar di erent capac combin trait attribut di erenc capac mechan easili estim classi er system major process requir estim action select rule discoveri xc base estim reward di er calcul strength predict rule adapt classi er system task updat pj pj pj predict rule learn rate payo environ updat appli set rule match current input advoc action call action set xc di er predict illustr gure explain section full speci cation xc order estim action current consult rule match current input advoc action strength action de ned tim action select action select reward rule strength xc reward rule strength rule discoveri rule accuraci rule discoveri fig xc reward weight rule action select rule discoveri arrow ow inform ai pc ai set match rule advoc action number copi rule popul strength action ai total strength rule advoc signi ai empti action ai select calcul strength action great number method select random select explor mode determinist greedi select exploit mode select xc calcul action complic initi calcul rule tness seri updat updat predict error rule action calcul accuraci view classi er system accuraci constant control toler predict error rule consid equal accur accuraci rate accuraci expon constant control rate declin accuraci accuraci rule calcul rel accuraci updat rule tness fj rel fj fj xc updat treat strength rule predict reward maintain estim error rule predict accuraci score calcul base error error accuraci criterion threshold rule fulli accur accuraci accuraci drop quickli accuraci valu action set convert rel accuraci nalli rule tness fj updat rel accuraci xc tness relat error reward error select xc weight predict match rule tness order obtain system predict action ai ai fc pc action select method valu xc xc rule form complet map space tness rule depend magnitud reward region neglect simpli gener high pressur rule popul drive cover entir space fc tim tend action highli reward action state repres form partial action advoc repres action tend repres subset action occur simpli tness rule proport magnitud reward receiv di erenc action complet map illustr gure show multiplex function repres set centr partial complet map fig truth tabl action map complet map polici thing section outlin view classi er lc essenti applic ga problem lc kind rl kind evolutionari compon view view depend classi er system question view section suggest answer classi er system reinforc learn goal rl return rl agent optim polici import featur classi er system point tabular capac exploit regular primari task lc face nding good polici nding return notion reward polici map state optim polici return view classi er system address question lc overlook issu nding express rule rule condit concern rule discoveri system xc main compon rule discoveri system system ga ga credit assign system provid give higher tness gener condit ignor focu learn polici broad approach evolut rl approach classi er system xc turn determin polici rst rule popul determin ga evolv ga determin polici super cial fact appli reason xc oper detail polici map state action rule popul uniqu polici con ict rule state match rule classi er system polici deriv polici tabular tabular system maintain set rule function set rule repres repres con ict action gener tabular deriv polici time system select action consult function current appli action select method function constantli polici point explicitli repres gener deriv polici classi er system select action base match rule equat action select tabular system base function descript lc oper tabular case di erenc recal section maintain partial map action state function map state estim tim estim select action valu estim advoc match tabular action repres select signi presenc absenc rule determin ga determin action ga uenc action select xc determin polici xc con gure select action method select action match rule advoc strong tendenc complet map mean action repres rule signi canc xc ga uenc action select prevent action select action elig tabular point action select method system behaviour chosen method di er system form oper versu complet complex system classi er sort interact compon easili occur case stewart intend action select oper complet map wilson intend result decoupl ga action ga polici determin ga detach action select highli signi issu determin polici relev issu ga shortli approach determin polici distinguish wai determin polici rst evolv evalu complet case polici complet determin evolutionari algorithm approach pittsburgh lc approach deriv tabular case polici complet determin process approach function store rule popul li rst polici deriv incomplet function partial map signi polici deriv depend action turn depend rule ga maintain popul polici xc empti popul result temporarili partial ga cover uenc action select view classi er system determin combin evolut addit rule discoveri note ga xc uenc polici extent function state rule direct ga uenc polici section relat learn subsystem primari task learn classi er emphasi role nalli answer question classi er system subsystem classi er system rule discoveri credit assign di erent classi er system oper di erent principl xc similar reli obtain combin evolut pittsburgh classi er system reli ga address issu figur di erenc approach xc pitt lc polici ql ql ga ga ga ga ga fig method algorithm emploi system nding polici import ga approach place di erent emphasi role ga signi directli ect polici emphasi role ga part tradit classi er system case doubt emphasi role show xc reduc tabular disabl quotat start work consist import ga aircraft lc interest case default polici appli absenc match rule tim view deriv polici sole tabular pittsburgh reli ga polici learn extrem li ga contribut determin polici convei point view classi er system solv problem hold classi er system solv problem hold solv tabular attempt made make view concret goal classi er system oper achiev goal consid xc twin di er determin ga uenc polici suggest lc xc shown xc proper tabular di erenc xc di er greatli classi er twin acknowledg grate stewart wilson barri discuss robert smith comment refer larri bull genet classi er system banzhaf al page editor genet evolutionari comput confer morgan barri xc perform popul structur environ phd queen improv perform genet algorithm classi er system john intern confer genet algorithm applic page juli lawrenc erlbaum associ martin david wolfgang challeng hard problem solut technic report illinoi octob view classi er system martin wolfgang anticipatori classi er system wu page martin david wolfgang predict anticipatori classi er system intern workshop learn classi er system joint workshop ppsn martin stewart wilson algorithm descript xc luca wolfgang stewart advanc learn classi er number page henri brown iii robert smith learn classi er industri applic genet page crc giordana filippo concept induct evolutionari david goldberg genet algorithm machin learn john grefenstett credit assign rule discoveri system base genet algorithm machin john holland adapt rosen progress theoret biologi john holland properti bucket john intern confer genet algorithm page juli lawrenc erlbaum associ john marco marco david stephani rick robert luca wolfgang stewart wilson learn classi er al page john holland cognit system base adapt algorithm waterman infer system academ reprint evolutionari comput record david fogel ieee ishibuchi linguist rule extract base machin learn darrel david lee ian genet evolutionari comput confer page morgan tim comparison strength fit learn classi er system phd school comput luca extend classi er condit part messi code banzhaf al page luca wolfgang stewart editor learn classi er system foundat volum lnai rick bucket long sequenc classi er intern confer genet algorithm page lawrenc erlbaum rick emerg coupl sequenc classi er er page tim david editor intern confer genet algorithm georg mason june morgan kaufmann robert smith report intern workshop learn classi er system nasa johnson space oct robert smith deriv learn classi er system thoma david zbigniew handbook evolutionari page institut physic publish oxford robert fighter aircraft case di erent lc goal techniqu al page smith learn system base genet adapt algorithm phd smith flexibl learn problem solv heurist adapt search intern joint confer cial page smith adapt learn system expert principl case page chapman wolfgang learn classi er system cognit mechan anticipatori behavior detail version european workshop cognit page wolfgang classi er system phd fachbereich wolfgang applic anticipatori classi er system european confer page wolfgang anticipatori classi er system annual genet program page morgan wolfgang latent learn khepera robot anticipatori classi er system wu page wolfgang introduct anticipatori classi er system al page wolfgang martin latent learn robot anticipatori classi er system al page wolfgang martin ho goldberg cognit capabl anticipatori classi er system meyer anim animat sixth intern confer simul adapt page technic report illinoi genet algorithm laboratori richard sutton andrew barto reinforc introduct mit andi larri bull corpor classi er system intern confer parallel problem solv natur ppsn volum lectur note comput page springer patrick tuft evolut cluster scheme classi er bucket phd thesi view classi er system patrick tuft dynam classi genet program classi er system siegel work note aaai symposium genet page aaai stewart wilson level classi er system evolutionari stewart wilson classi er fit base accuraci evolutionari stewart wilson person commun barri tim june stewart wilson david goldberg critic review classi er system er page editor genet evolutionari comput confer workshop
Agents/170 1 trust relationship mobil agent system kim tan luc depart electron comput scienc southampton southampton uk abstract notion trust present import compon secur infrastructur mobil agent trust model tackl aspect protect mobil agent hostil platform de ne trust relationship present trust deriv algorithm infer relationship exist model util practic system provid introduct mobil agent technolog identi ed paradigm exibl structur distribut comput network internet main concern wider accept mobil applic area issu secur farmer al earli discuss secur problem requir uniqu mobil type secur goal achiev recent overview mobil agent secur compar discuss current techniqu address found divid mobil agent secur broad area host secur host platform malici code secur mobil agent malici host discuss techniqu address code secur issu suggest manner current techniqu implement scale secur infrastructur encompass larg number highli mobil agent identifi trust import compon secur develop secur framework mobil agent system incorpor simpl trust model model motiv similiar manner distribut authent handl public kei code secur handl secur infrastructur mobil agent exist work trust relationship context public kei infrastructur background de ne trust relationship speci mobil agent system show trust relationship deriv exist model present algorithm formal approach main contribut paper identifi trust import compon secur infrastructur handl code secur framework incorpor notion trust deleg code secur adapt exist trust model public kei certi cate system conjunct secur framework overview paper sect discuss current code secur techniqu suggest incorpor trust develop trust model secur framework analog trust public kei infrastructur sect trust relationship model detail sect sect describ trust deriv algorithm sect intuit discuss model deploi mobil agent system sect conclud paper summari identi es avenu futur work mobil code secur techniqu host secur research area number viabl techniqu develop includ mechan sandbox secur java program languag softwar fault isol proof carri code type safe languag code secur aspect promin recent secur problem uniqu mobil code solut area crucial determin futur viabil mobil agent applic scenario distribut code secur techniqu includ code obfusc encrypt function hardwar execut trace reader refer overview classi cation code secur techniqu execut techniqu emploi construct secur involv detect unauthor modi cation agent faith record agent behavior execut host platform techniqu requir host platform involv creat retain log trace oper perform agent resid return mobil agent owner suspect mobil agent correctli request host platform submit individu trace contrast simul execut origin mobil agent inform detect deviat execut agent techniqu attempt safeguard mobil agent secur aspect provid simpl classi cation secur aspect techniqu seek protect execut integr refer correct transform current state mobil agent accord semant mobil agent code accomplish ensur correct portion code execut order ect requir transform integr state code mobil agent protect invalid manipul visibl permit part state code made visibl host platform part sensit inform resourc provis import provis system resourc constraint resourc secur polici host mobil agent order execut successfulli code secur techniqu address secur attempt address singl aspect conceiv found de cient aspect closer scrutini view futur secur infrastructur address code secur issu incorpor combin ubiquit solut requir mechan select techniqu combin techniqu depend execut environ target applic discuss hardwar yee suggest trust negat requir hardwar instal execut environ permiss run mobil agent environ pure softwar base code secur agent amount trust environ hardwar instal environ behaviour reput unknown code secur execut requir activ behalf agent platform deploi mobil agent verifi execut trace submit back host platform execut deploi platform entiti capabl perform veri quickli overwhelm number mobil agent veri cation requir order system deploi platform deleg veri cation activ entiti system notion trust entiti requir deploi platform deleg activ manner subtl point consid action host platform detect act illeg manipul portion mobil agent code state violat state literatur describ code secur techniqu detect assumpt uniform action exibl desir situat acquir addit econom interest bene ts result constant interact trust readili untrust platform discov trust platform violat agent immedi bar agent visit platform case untrust permit possibl code secur techniqu appli trust basi decid suitabl action deal violat agent event exibl advantag situat larg number agent involv develop evolut complex trust relationship particip entiti incorpor notion trust secur framework develop trust model metric express natur ow trust result interact entiti model metric permit quantit comparison di erent framework provid guidelin futur develop identifi point make sound argument notion trust part secur framework address mobil agent code secur basi decid code secur techniqu combin techniqu deploi environ permit scalabl system emploi code secur techniqu deleg speci secur exibl decid action undertak develop trust model metric express trust dynam agent framework bene ts incorpor trust trust model distribut system gener mobil agent system identi ed code secur incorpor notion implicit manner awar work develop trust model explicitli context mobil agent system de ning trust relationship system demonstr simpl secur framework mobil agent system develop adapt trust model distribut authent system public kei infrastructur framework code secur mobil agent system public kei infrastructur essenti system mainten activ complet life cycl certi kei element distribut authent servic main issu servic ensur public kei correctli ident entiti privat portion pki system involv trust parti term certi cate author verifi bind certi cate larg scale singl ca incap handl bind activ ca immedi identifi certi cate requir certi cate veri ed turn ca familiar ect creat certi cation path ca verifi certi cate ca root user acquaint certi cation path ect propag trust di erent ca user system begin develop secur framework mobil agent system base trust model claim model de mobil agent system guidelin model develop code secur techniqu classi ed literatur survei detect state prevent mechan encrypt prevent mechan seek prevent manipul agent code complic assum simplist trust entiti trust maxim measur undertaken prevent secur breach detect easili seek detect violat agent violat natur sever violat determin di erent level trustworthi platform concern base select combin code secur techniqu addit detect appli host line origin motiv trust code secur framework emploi execut trace core code secur techniqu framework describ techniqu develop date critic relat perform scalabl concern detect mechan forward integr state execut trace er import advantag detect tamper part agent speci case mechan improv execut trace requir introduct addit entiti undertak veri cation process execut trace behalf deploi platform mention previou entiti assum role trust role ca pki refer trust parti veri cation server task associ public kei correctli ident secur requir entiti commenc util essenti deleg entiti ca veri cation server function intermediari agent owner platform platform mobil agent initi launch host platform task verifi correct execut mobil agent host platform deleg agent owner platform veri cation server veri cation server deleg execut veri cation activ veri cation server analog manner ca verifi certi cate ca pki trust gener establish speci unconstrain notion gener simpli state entiti trust entiti accur trust respect activ context trust pki gener respect bind activ activ includ secur kei pair event ca kei gener emploi classi cation secur aspect de ned sect context establish trust util execut trace main activ execut integr integr trust model mobil agent semin paper discuss idea trust relationship distribut authent system type trust relationship introduc paper direct trust recommend trust direct trust analog trust obtain ca entiti gener public kei pair ca directli verifi ident entiti issu certi cate bind ident entiti public kei recommend trust analog trust obtain entiti receiv certi cate ca issu entiti determin directli public kei certi cate bound correctli ident trust ca perform activ trust deriv algorithm present gener deriv trust relationship exist set direct trust recommend trust relationship exist system achiev ne grain trust introduc idea partit complet mobil agent state code compon mobil agent complex piec code reusabl compon distribut parti code produc select appli di ent code secur techniqu di erent state code establish trust relationship di erent context respect di erent code state compon emploi execut trace appli select di erent code state compon trust belief relationship mobil agent system de ning trust belief relationship rst de ne state space encompass relev entiti op agent owner veri cation hp host sc secur assum mobil agent system combin prede ned set code state compon made parti code produc agent owner platform platform mobil agent launch agent migrat itinerari host platform termin return respect agent owner platform execut trace mobil agent perform set cation server distribut system trust belief relationship entiti system establish respect type class correspond classi cation secur aspect mention earlier hp fig basic trust belief relationship describ basic trust belief relationship di erent type entiti system agent owner platform veri cation rst repres trust veri cation host undertak transform state compon speci ed correctli respect secur object constraint context relationship applic give type trust relationship term execut trust trust relationship initi establish veri cation server successfulli valid execut trace submit host platform execut trace pertain mobil agent compon undertaken veri cation server test reliabl host platform question relationship repres trust agent owner host undertak transform compon speci ed correctli respect secur object veri cation server entiti system possess function ascertain execut type relationship establish directli agent owner platform deriv exist trust demonstr trust relationship refer agent owner trust veri cation undertak correct veri cation transform state compon speci ed respect secur object trust relationship analog idea recommend recommend trust give term veri cation trust veri cation trust establish directli agent owner platform decid deleg task verifi correct execut mobil agent veri cation server relationship agent owner platform suppli veri cation server inform resourc copi mobil agent launch agent undertak veri cation successfulli trust relationship interpret veri cation trust veri cation undertak veri cation correct transform state speci ed respect secur object result veri cation server deleg verifi host platform veri cation server relationship establish directli trust except express trust basi explicit action result undertaken entiti involv relationship sect elabor relationship initi establish evolv period time requir type relationship express assumpt belief entiti entiti system agent owner reason knowledg acquir extern host platform capabl execut correctli respect capabl directli verifi accuraci belief veri cation server possess function verifi execut trace host belief express form belief relationship idea belief relationship equal valid includ order simplifi trust deriv algorithm develop section import note trust belief relationship symmetr system necessarili impli introduc idea trust origin host platform host platform termin point execut trust extend model encompass issu host secur host trust agent owner platform dispatch malici agent address explor combin basic trust belief relationship produc trust belief relationship present trust deriv algorithm demonstr approach deriv trust relationship di erent wai trust belief relationship form exist illustr figur trust intersect compon constraint set deriv deriv relationship context compon common relationship deriv trust deriv involv belief relationship deriv trust relationship exist belief relationship agent owner platform host platform veri cation server concern relationship context compon common initi relationship belief relationship note includ idea infer trust belief relationship exist belief relationship start point due fact trust behaviour transit deleg veri cation activ case trust trust belief context exist belief relationship alter independ agent owner platform depend result trust relationship deriv deriv trust superset agent owner platform expand constraint current belief relationship host platform ensur time trust relationship deriv exist wider constraint achiev veri cation path import note exact sequenc exist relationship combin provid context trust relationship obtain achiev idea veri cation path introduc veri cation path refer sequenc entiti cation agent owner platform deriv trust exist relationship form infer relationship form deriv trust exist relationship form infer relationship form deriv trust exist relationship form exist belief relationship form infer trust relationship form deriv trust exist relationship form exist belief relationship form infer trust relationship form fig deriv trust relationship host involv deriv trust relationship trust relationship statement combin obtain trust relationship veri cation path stage involv entiti sequenc subsequ combin obtain trust relationship veri cation path sequenc involv entiti deriv trust relationship involv expand veri cation path similiar manner idea veri cation path algorithm develop trust deriv algorithm detail trust deriv algorithm extend present incorpor idea belief process deriv trust relationship algorithm demonstr deriv explain systemat appli system initi set trust relationship goal algorithm gener initi set trust relationship set tupl describ trust relationship exist agent owner system host platform system algorithm work element hs hs set tupl consist host set state hs empti algorithm append element execut termin tupl hs repres host agent owner platform establish deriv trust relationship form set tupl repres step veri cation path constitu compon tupl veri cation entiti veri cation trust sequenc seq repres sequenc veri cation path set compon sc repres compon trust applic veri cation path express seq entiti append sequenc seq veri cation path initi tupl correspond initi trust relationship form sc current agent owner platform algorithm appli trust deriv algorithm system consist set host veri cation compon se singl agent owner ve fv fh se fs signatur hs hs seq seq sc hv bs set initi trust belief relationship hs fg hv hv sc ig current agent owner platform algorithm appli veri cation server trust relationship sc bs boolean select hv seq sc hk bs hk bs begin hh hs hk sm sc true hs hs fs sm sc gi end end sn bs sn sq bs sn seq hv sn seq sn sq sc gi end hv seq sc fig trust deriv algorithm assum system initi trust belief relationship fs fs fs fs fs fs hq hp belief trust proce appli algorithm determin trust relationship deriv host platform system start initi trust relationship origin agent owner platform hv hv hs fg rst pass fs hv hv hs fg pass hv hs fs pass hs fs fourth pass fg hs fs form trust relationship form fs deploi framework discuss intuit framework deploi mobil agent system commun host veri cation server agent owner platform trust relationship establish agent owner platform particip commun establish trust relationship veri cation server short interact select veri cation agent owner platform determin host platform server question trust relationship agent owner platform initi ascertain reliabl veri cation server mobil agent launch host execut trace submit back agent owner platform veri cation server result report back veri cation server check consist valid trace agent owner platform agent owner platform sati establish trust relationship veri cation server respect speci execut trust deriv algorithm obtain trust relationship host platform potenti itinerari futur mobil agent launch event agent owner platform suppli prede ned inform agent agent capabl dynam decid itinerari veri cation server join commun establish trust relationship exist veri cation server similar manner host platform presenc registri servic test reliabl host mobil agent veri cation server express interest establish trust relationship kei evolut trust relationship framework veri cation execut trace submit host platform veri cation server trust relationship initi establish remain static long trace check valid moment veri cation server detect invalid natur current trust relationship end host platform alter rang altern sever exist trust sever trust relationship degrad exist reduc number compon valid return analog introduc start sect veri cation server roughli ca note ca trust maintain integr bind certi cate certi cate emploi integr suspect due suspect kei certi typic implement period public mechan certi cate list access entiti valid certi cate veri cation trust maintain integr mobil agent alter trust relationship end platform violat integr detect inform relationship chang propag veri cation server agent owner platform establish trust relationship server detect violat turn result chang trust relationship server platform trust inform crl di erenc trust inform propag publish agent owner platform event recept trust inform trigger execut trust deriv algorithm order recalcul trust relationship exist host platform actual map detect violat execut trace subsequ chang ect trust relationship function secur polici administ local global administ discuss polici implic trust dynam system scope remain import work accomplish studi ect trust model mobil agent secur framework paper incorpor trust model part secur framework mobil agent argu notion trust aid exibl scalabl exist code secur techniqu suggest manner trust emploi wide scale secur infrastructur mobil agent parallel distribut authent system public kei infrastructur base simpl secur framework mobil agent system resembl structur public kei infrastructur draw exist work trust relationship de ne trust relationship mobil agent system demonstr trust relationship deriv exist present algorithm formal approach materi develop repres initi work requir construct complet trust model mobil agent system model permit detail insight complex interact involv trust mobil agent system futur work direct involv formal de nition trust relationship explicit neg trust speci mobil agent investig execut trace exist code secur modi ed ectiv structur framework refer adam understand public kei infrastructur standard macmillan technic chess secur issu mobil code system mobil agent number lnc swarup secur mobil agent authent state european symposium research comput number lnc swarup secur mobil issu requir comput special issu advanc research applic network octob gong java secur architectur technic sun march mae agent mediat electron commerc electron hohl time limit blackbox protect mobil agent malici host mobil agent number lnc jansen countermeasur mobil agent secur comput special issu advanc research applic network novemb karnik secur mobil agent system phd depart comput scienc authent distribut system theori practic acm transact comput novemb lang oshima good reason mobil agent commun lee safe kernel extens check symposium oper system design implement octob secur issu relat mobil code system comput juli sander tschudin protect mobil agent malici host mobil agent number lnc mobil agent secur issu direct intern confer intellig servic april swarup trust bene model mechan secur internet program secur issu mobil distribut number lnc vigna cryptograph trace mobil agent mobil agent number lnc smith languag issu mobil program secur mobil agent number lnc graham ecient fault isol acm symposium oper system page decemb introduc trust parti mobil agent paradigm secur internet program secur issu mobil distribut number lnc beth trust relationship secur distribut authent perspect ieee symposium research secur page yee mobil agent secur internet program secur issu mobil distribut number lnc
Agents/171 1 improv scalabl system phillip turner nichola jen multimedia group depart electron comput southampton unit kingdom abstract demand design develop construct larger system system hundr thousand autonom agent open dynam number agent system time uctuat signi cantli cope twin issu scalabl variabl multiag system determin organiz structur system adapt chang structur environ evalu hypothesi implement multiag system appli domain autom trade preliminari result support rst part hypothesi adapt make system cope larg number agent introduct design build system design ensur agent collect provid facil prescrib user system consist larg number current design methodolog unabl ensur provis methodolog inher practic theori base studi directli concern scalabl mass mass open system internet corpor requir larg number present design problem dynam agent number design larg mass prove imposs redesign upgrad softwar demand evolv current state art challeng mass larg magnitud speed agent popul variabl confound design tackl problem mass determin organiz structur system adapt chang structur environ major ma work deal system agent peer structur hundr thousand agent requir ma design increasingli metaphor human social econom organ deal larg number structur system human organ oper enforc avenu commun control individu order group achiev goal rough organiz mass acquaint topolog perform function de ning constrain interact topolog fulli relationship slave deem suitabl tempt mirror human organiz structur role achiev goal mass dispar organiz theori practic human agent emphasi mass achiev goal goal individu human achiev goal prime focu emerg behavior mass organiz abil dynam construct forc limit structur organiz theori practic primari focu paper present ma adapt structur popul size suggest li method creation mass deal variabl number diculti build mass build sucient manag small size relianc scale toler scale requir size work advanc state art wai present empir evid support case dynam organiz structur implement method agent dynam chang organiz structur evid support proposit mass xed organiz structur scalabl adapt popul size discuss xed versu exibl form context human organ theori ma oper di erent popul size deal dynam popul scalabl disambigu scalabl term di erent mean comput facet concern refer relationship collect comput resourc agent popul size order system compar scalabl measur determin case measur process requir agent roughli equat number machin instruct incur achiev goal metric compar method space limit prevent report hypothesi agent avoid pitfal de ning absolut requir ma term concentr reduct growth comput resourc demand whilst maintain util de nition scalabl ma de ne abil ma oper comput resourc avail limit achiev requir minimum level util user target rang popul size higher scale toler impli larger popul size successfulli dealt remaind paper structur section introduc applic develop investig issu scalabl section present data obtain ma organiz form section discuss organiz adapt section cover relat research section present initi discuss futur work trade agent scenario electron commerc natur domain test scalabl involv larg number onlin busi constitut highli dynam term interact term membership scenario involv agent encapsul basic autom product locat supplier agent queri process order placement goal goal commod present custom agent probabl distribut speci period speci cs request includ commod identi requir deadlin gener request achiev probabl distribut request paramet custom agent capabl dynam build prefer supplier commod gener basi propag inform supplier prefer custom make form group make collect bulk form maintain model supplier ware price contrast custom supplier limit term dynam charact market de ned term product sell price charg product rang vari supplier abil model gener custom commod er custom discount bulk deal monitor request receiv analyz time reaction data start sell request commod drop price slightli improv number sale item probabl distribut refer paragraph uniform poisson result present gener uniform probabl distribut queri gener queri paramet type agent scenario implement comput storag resourc bound behavior interact agent ect hardwar absolut rel comput memori requir space agent process intern model messag receiv process occur commun agent agent reach state messag exchang agent resum process messag deliv step refer system tick repetit continu oper note tick constitut xed amount repres passag time agent oper manner mean varianc behavior ultim ma order agent execut receiv transmit elimin advantag agent receiv inform advantag ma faster act agent gain unfair advantag found method oper reproduc ma behavior scheme ful ll subtl requir aim develop agent primari concern goal priorit issu gener dealt achiev desir properti ma whilst reduc resourc experi seek determin goal achiev level resourc bound predict minim resourc requir attain level goal achiev import properti ma maintain agent util user agent undertak action ensur user met search supplier cheaper deal locat accept custom bulk manner minim total comput resourc ma agent implement interpret rule mental act base guard ring rule call action handler prolog predic perform measur speci metric compar scalabl number tick commun total number agent sum number logic infer requir agent ratio number custom agent supplier agent ten minimum number supplier agent ad goal receiv user total simul user goal remain xed ratio number agent introduc ma throughput comparison organiz form agent interact section present organiz form ma trade scenario form distinguish constraint agent interact share form group action combat ineci examin form rstly show di erent organiz form place di erent resourc requir determin relationship resourc requir form number constitu agent form supplier form intermediari custom form fig acquaint topolog form rst organ form gure custom agent reason commun supplier vice custom unawar custom supplier unawar supplier agent form share number logic infer equat measur number machin instruct agent execut fact total number pass prolog call redo port undertak behavior form repres trade scenario multipl intellig exhibit properti expect ma agent organiz form forc agent respect form gure custom awar custom custom agent form group relev custom share task commonli undertaken share inform product avail supplier format group supplier similarli enabl form fulli connect mesh repres standard fulli connect peer ma form ident except intermediari agent undertak collect task present central format catalogu model dissemin form repres facilit intermediari function agent number task util user su er extra agent introduc number agent tick total logic infer fig logic infer versu number tick versu number agent form ma resourc requir form figur show relationship number amount process resourc requir split separ stage agent model requir higher amount process resourc achiev goal locat commod servic undertak model format complet custom model supplier ecient achiev goal eventu initi extra resourc requir whilst form model lessen cientli agent assum stabl resourc requir refer rst model stage converg phase refer converg agent requir resourc maintain accuraci model user chang bui habit supplier alter product rang gure converg phase end converg phase approxim tick model maintain aim prevent agent propag incorrect inform agent wast time approach inappropri acquaint group format organiz custom supplier agent group function invari satisfi goal larg common form model bui acquaint topolog limit share inform bene view system level perspect posit massiv amount replic data redund comput agent experi discoveri bene clear share inform ecienc resourc requir form full acquaint resourc requir form figur show situat agent detect interact agent share inform common goal comparison previou graph quantit qualit di erent addit resourc requir growth factor agent shape di er higher level logic infer requir ect fact agent model reason graph paper smooth show gener form speci smooth compound window run maximum window run averag clarifi relationship shape individu ma show select valu surfac number tick total logic infer fig logic infer versu tick versu number agent form ma model form group oper joint activ costli behavior compar act model custom supplier number deliveri cycl reach converg phase reduc approxim tick versu tick form agent share task inform manifest shape resourc requir converg phase roughli asymptot relationship remain order complex bene ts agent deriv lost overhead agent test perform task speci scenario compar ma complex resourc agent resid gener ma applic scenario illustr import point easili overlook order inform limit di erenc form form great equat captur maximum total resourc requir converg converg rang agent popul tabl implement minor di erenc crucial comput resourc avail form function perfectli form system inform form ensur higher tempor equat numer deriv reproduc maxima measur tabl growth function organiz form max converg phase form form max converg phase form form accuraci reason scalabl studi mass base practic observ measur resourc requir form number agent tick total logic infer fig logic infer versu tick versu number agent form ma figur show resourc requir agent ma common task central task illustr irregular shape resourc pro common goal custom updat supplier commod avail price custom obtain piec inform supplier result bui fail bui inform forward custom agent judg relev inform simpl determin custom inform relev retain statist number time custom attempt form collect group updat form behavior imposs form custom maintain model reason piec inform nalli send messag custom agent undertak deleg model reason singl agent requir lower model intermediari maintain model number messag remain agent send messag maximum collect total agent send messag intermediari agent send maximum result total bene central task lower total model process custom agent spend time goal cost central inform updat arriv tick ect fact phase boundari occur approxim tick compar form collect central deleg result lower resourc latenc inform share task form higher converg time form number tick requir reach converg remain lower form higher form total resourc agent lower form higher form achiev adapt organ gross rel form studi date shown tabl base natur select whichev form pertin environ domain inform model stabl longer period time reach converg form lowest impact user agent select form initi converg quickli revert demand form form shown constrain interact intuit form inappropri share goal agent select individu form individu share goal theori track exist agent transient membership base detect infrequ form model supplier commod avail demand fast form chosen unlik form point converg occur form function number agent readili form gure tabl rel comparison organiz form attribut list tick rel load converg agent form low high mid form high low high form mid mid low distinguish basic form set foundat creat adapt mass de nition accept perform speci ed design maximum resourc individu agent minima model agent begin chang organ meet demand order agent dynam chang organiz form augment extra abil remov knowledg exist acquaint global speci task data abil creat intermediari destroi abil transfer model inform deleg task agent chang organ form repercuss necessarili collect choic sucient number creat intermediari agent distribut method trigger trigger relat util measur rel resourc requir task tick paramet agent oper trigger rel dictat domain characterist applic scenario achiev low cost commod higher rank reduc process resourc requir work group ten custom agent model assum agent model user commod prefer chang rapidli agent resourc model updat agent bene tted spent logic infer past tick util result model time period agent note task low payo increment counter ect fact similar util agent talli util repres inform acquaint agent distinguish desir reorgan acquaint agent updat model agent receipt agent updat privat social counter trigger activ function decid join group undertak counter trigger signal social privat trigger reach activ agent transmit messag acquaint receipt similar action reach point trigger updat continu sucient number agent pass threshold cascad updat occur agent enter group task reorgan agent minimum trigger group form agent action base identi ed problem current organiz form identi problem custom separ includ model error high approach supplier commod model low coverag broadcast request supplier incur high amount resourc track request result model resourc model acquaint payo low action agent central commit share common end commit share common option move agent form move agent form option form choic form adopt base identi ed problem trigger rel advantag disadvantag form previou current form central task agent vote select intermediari agent agent randomli chosen creat intermediari intermediari deleg agent action agent extract rule relev task prolog send intermediari receipt messag proce agent send relev data intermediari intermediari respond con receipt rule data intermediari check agent rule veri es agent deleg task stop perform success signal proce agent group intermediari receiv data remov guard process relev rule send messag agent inform remov relev rule replac repres commit undertak task addit rule agent forward runtim data intermediari rule intermediari receiv send back part packag rule agent send addit includ agent rule relev task end commit share task rule share task queri agent belief retriev agent commit forward inform rule modi ed remov commit fact belief structur enter commit share task end commit ad resourc requir form figur show resourc requir agent util organiz adapt compar form qualit di erenc form initi requir resourc form form requir resourc form tick total logic infer form form form form fig total logic infer form form form form show gradual declin resourc usag uniqu featur undergo major reach stabl resourc level show sign converg reason form show smooth form individu agent util form agent ident graph summat agent emploi form task necessarili irregular perturb graph appar lack evid converg show emerg featur form period form isomorph regard graph resourc requir number linearli scale form properti distanc perturb maxima vari mean accur project resourc requir curv higher number agent imposs form gure show form suitabl amalgam form term resourc requir maximum resourc requir fall form fall form agent form constitut system ma form present suggest form scalabl form maxima remain form converg phase maxima relat research public deal scalabl system gain order place work context broadli partit ma scalabl research categori formal scalabl resourc distribut protocol creation scalabl protocol tool predic perform design evalu clari cation scalabl issu scalabl architectur applic resid inform retriev algorithm techniqu scalabl chang ma environ view paper relev categori research deal dynam structur problem solver protocol emploi techniqu indirectli affect agent mass alter agent environ resid framework dynam organiz approach adapt product scalabl creation destruct intermediari extra process capabl indirectli base ishida al introduc organ agent organiz load heavi light mechan composit decomposit occur runtim ect oper explicitli includ scheme organ agent approach di er lightli load agent automat extra task maintain minim util agent ectiv exist composit agent reduct total system load occur decentr delimit social group place larg load member al refer dynam reorgan central ma hierarch graph servic swap altern decomposit decomposit retain altern perform origin scenario present agent form compound servic combin exist facil agent reform explicit previou state retain main thrust argument problem scalabl manag chang rel amount process time resourc aspect oper agent amount time manipul knowledg con gurat agent repres search space agent abil perform drop accept level move search space rst move search space random agent perform hill climb achiev local optima paramet central agent construct pictur search space inform local agent local agent provid fragment central agent inform prevent agent settl local maxima solut central agent direct agent search fragment search search space smooth hill climb search method agent central monitor agent domain approach present gener monitor perman central constitut prevent scalabl term holon notion abstract resourc abstract resourc roughli compound servic holon collect agent consid group singl partial limit autonomi full extent framework mechan adapt microscop macroscop natur test applic repres form popul size paramount direct comparison suspect framework ne tune small scale coarser comparison note approach requir abil chang acquaint topolog group commit intern oper combin work summar approach successfulli emploi achiev organiz adapt altern compound abstract resourc decentr common goal alter acquaint nalli rel process power agent intern process method combin addit agent access knowledg perform bene greatli form reason model dynam organ futur work agent build maintain organiz structur requir decid task individu acquaint bene mean awar intern infer question goal system entail agent creat deleg task modifi oper uenc organiz algorithm sketch show organiz exibl advantag larg scale system higher scale greater test requir domain applic limit scenario implement market dynam stabl cope uctuat user demand remain complet analysi ux popul secondari import omiss ect trigger level similar metric agent decid group format valu set major ect bene determin valu remain matter relax synchron method oper agent execut undertaken mass asynchron answer question constitut futur work note creat algorithm scalabl ma algorithm scalabl refer framework dynam reorgan ninth european confer arti cial intellig foundat systemat process organ structur design journal inform optim scienc evolut system annual intern confer autonom agent formal model system dynam organ intern confer system de fair scalabl multiag system intern journal intellig engin system matchmak british telecom technolog journal brokerag inform economi inet annual internet societi japan organiz view distribut system ieee transact cybernet design complex organ publish scalabl societi de saarland de adapt anticip manag crisi john wilei dai document mind project chapter distribut ai volum pitman publish organiz approach adapt product system eighth nation confer arti cial intellig matchmak inform agent fourteenth intern joint confer arti cial intellig de scalabl perform system british telecom technolog journal scalabl fourth annual intern confer autonom agent scalabl agent locat mechan lectur note arti cial intellig agent vi simpl agent languag interpret ninth nation confer arti cial intellig
HCI/172 4 method appli intellig user interfac develop nguyen todai world properli design user interfac crucial inform system popul user imposs design inform system equal user interfac user postul construct adopt interfac account experi popul build user profil mean consensu method intellig user user consensu method introduct interact system nowadai start comput situat interact kind system tv set dvd player digit satellit bank teller machin automat sell machin difficult reason user dont system user acquaint interfac european countri system languag user doesnt user interfac plai import role todai inform system call gener access system kind system million hand user dozen system dai reason qualiti user interfac abil adapt user critic factor function todai era competit system solut accept user popul chanc surviv gener access system suppli interfac system interact function kei direct graphic manipul design system interfac design easi effici disadvantag system design gener wrong assumpt exist singl suitabl user design awar potenti user system experi close function user interact habit deriv prior experi rememb user prefer interfac interfac dont function limit statement ag inform popul potenti public access interact system user differenti bank teller spend hour dai plai comput game sail internet visit dozen site depart inform technolog ul poland teller comput system system success depend function interact user success interfac mean system owner client cost human personnel work counter system support error made system user method make system user solut field hci comput interact style user ai natur languag ir user profil multimedia inform system concurr media percept multidisciplinari approach problem interfac agent emerg gener agent paradigm result work commerci applic form person assist implement support internet search engin offic applic ms offic hci work method develop method concentr statist center interfac adopt averag user todai system intellig method enabl comport interact potenti user paper model profil determin user interfac base consensu theori present assum internet base inform system access popul heterogen user aim develop automat user interfac conveni user model kind interfac agent theori field interfac agent number public access system grow exampl system todai autom system lower longer work hour space occupi tradit human system autom system gener effect human great barrier success public problem human comput interact show plenti exampl autom system fail occas user interfac gener reason public access system tend equip uniqu interfac gener wrong great differ user popul user differ educ differ result great problem uniqu interfac public access system success easi differ crucial applic solut mention interfac problem lie adapt user interfac state interfac agent theori appli solv problem interfac agent public access system improv work potenti base interact experi user system interfac agent approach mae defin interfac agent agent act kind intellig assist user respect comput applic case adapt interfac singl set simpl process run task implement interfac interfac agent user assign user model compar activ popul user offer assist account prior user interact system method specif applic environ believ interfac agent meet autonomi collabor interfac agent collabor user research add requir defin abil perform restrict condit implement solut interfac agent bayesian belief network microsoft offic offic assist bayesian belief network repres relationship weight express affect interest aspect belief network infer reason network probabl inher situat interfac agent predict properli user intent work accur user inaccur reason import differ user user behavior time predict user intent model user behavior defin metric reactiv autonomi util function adapt interfac architectur dynam popul user locat distribut system commun user agent collect inform form user profil profil consist user experi fact consult commit data classifi applic sort distant enabl construct adopt interfac user user profil popul user environ highli user experi differ aspect time user interact interfac form interfac conveni user form interfac profil observ process evalu interact mean type usabl decid interfac user user select interfac profil user profil resembl find consensu calcul interfac profil rise final interfac construct major problem idea outlin concret form user interfac profil usabl function user internet base system recent system interact enter addit inform usabl function usabl function base time complet commit error rapid chang consult number user request case final interfac profil specifi interfac assum adopt system interfac construct dynam user process highli potenti interfac attribut simpl color background color button form icon complex paramet set font interfac templat theme microsoft style button anim gener architectur determin user profil shown figur find popul user classifi mean user profil class util function mean consensu base techniqu interfac profil determin ri user classif consensu base profil determin consensu base profil determin consensu base profil determin gener architectur profil determin section theoret aspect user profil determin mean consensu method present limit length problem user classif address paper determin user profil consensu work author defin gener consensu system solv conflict distribut system paper system determin consensu concret system site profil serv class user consensu system defin finit set consensu finit set function finit set relat carrier set order logic relat system model distribut interfac system notion carrier attribut interfac set interfac class set user set attribut describ interfac profil user servic function assign profil number repres credibl function user belong class rare dealt interfac agent determin final profil class particip profil agent credibl profil smaller profil agent present consensu determin profil interpret tupl relat profil opinion agent profil serv client class tupl word util function profil tupl belong relat profil mean agent user class profil servic word util function profil logic formula repres condit satisfi tupl belong relat consensu situat defin profil set call basi relationship consensu subject element consensu basi profil posit profil uncertain element profil neg element interpret element relat profil profil notic relat profil type relat profil profil element interpret uncertainti interfac agent tupl belong relat profil mean agent foundat profil profil user class consensu profil situat defin definit consensu situat call relat satisfi tupl belong satisfi logic formula postul pr pr pr ra ra pr ra postul state attribut tupl posit element consensu basi qualifi common attribut combin occur consensu postul treat similar neg uncertain element consensu basi postul tupl posit element consensu basi qualifi attribut attribut consensu postul state base nonempti common part consensu sum base combin valu attribut postul requir occurr combin consensu postul treat characterist properti consensu function determin space consensu function region denot notic region present properti region theorem theorem show import properti consensu function satisfi exist present particip credibl agent determin profil theorem theorem defin distanc function δ tupl belong situat consensu function min min satisfi depend distanc function δ tupl defin δ ai ai function distanc function element set notic structur set homogen defin function prove function function δ metric algorithm consensu determin work structur element set function present algorithm case element set interv number structur popular repres uncertain incomplet inform refer paramet user profil distanc function real number interv defin algorithm determin consensu interv assum credibl equal relat consist real number interv consensu tp min tp begin begin goto end begin set repetit lower valu upper valu sort set greatest integ greater set integ set integ tp xk tp creat end present build adopt user prior work hci domain statist goal build automat interfac user class build interfac call averag user occas inform system task situat model improv interfac qualiti work concret task situat account human emot variat interact process refer mamdani virtual person servic charact artifici heart intellig user interfac orlean la usa pp brown sm explicit requir metric interfac agent user model interfac agent user model correct autonom minneapoli shipman adapt medic inform deliveri combin task situat model intellig user interfac orlean la usa pp ai mainstream insid microsoft research ieee intellig pp william user environ experi adapt agent technolog work vol pp newman lam interact system design nguyen consensu method determin expert inform distribut system lectur note artifici intellig vol pp interact nguyen consensu base adapt user interfac access system st intern confer access comput interact usa interact multimedia inform plan digit media network perspect digit world tamper pp wooldridg jen intellig theori practic knowledg engin review pp
HCI/173 4 wearabl spatial conferenc space billinghurst α β β β α human interfac technolog laboratori β advanc percept unit washington bt laboratori box heath wa usa unit kingdom abstract wearabl comput provid constant access comput commun resourc paper describ comput power wearabl provid spatial graphic audio cue aid commun result wearabl augment realiti commun space audio enabl avatar remot collabor surround user user natur head motion attend remot commun freeli awar side move commun space conferenc space support dozen simultan user inform user studi suggest wearabl commun space offer amount inform access natur interfac introduct broad trend emerg interact portabl comput commun facil remain open question comput aid mobil commun wearabl comput recent gener portabl machin worn provid constant access comput commun resourc wearabl comput defin comput subsum person space control wearer oper interact access wearabl typic belt back pack head mount displai wireless commun hardwar input devic chord keyboard configur demonstr number real world applic includ aircraft mainten navig assist vehicl mechan applic wearabl dramat improv user halv task time case vehicl inspect target applic area user benefit expert assist network enabl wearabl comput commun devic enabl remot expert collabor wearabl user situat presenc remot expert found significantli improv task perform find head mount camera displai interact effici remot collabor object manipul task current collabor wearabl applic involv connect local remot user problem interest wearabl comput support collabor multipl remot peopl explor visual audio enhanc aid collabor commun space creat remot user repres wearabl comput issu increasingli import telephon incorpor comput power portabl comput telephon kei issu commun confer phone call effect prior work field teleconferenc comput support collabor work address question background research role audio visual cue teleconferenc produc mix result experi conduct compar audio audio commun condit sellen summar report main effect collabor perform due collabor technolog mediat type technolog mediat peopl gener prefer audio perform task effect audio video case perform collabor natur vari task interact cognit problem solv task visual cue import task requir negoti video transmit cue overestim video show commun avail view share workspac user attempt commun video conferenc environ gestur recogn gestur base fact speech critic medium teleconferenc experi thought audio suitabl creat share commun space pure audio system high qualiti audio conferenc multipl particip flip switch month trial al found audio suffici usabl commun space major problem user easili space user visual cue determin interact user increasingli difficult discrimin speaker higher incid speaker overlap interrupt problem typic audio space suggest audio small group usabl peopl present shortcom overcom visual spatial cue bodi languag cue combin show attent interest simpl version cue replic desktop video conferenc enhanc desktop conferenc tool includ visual confer tabl alongsid share document text chat facil confer tabl includ icon peopl confer simpl microphon activ interest infer absenc spatial cue video conferenc system mean user find difficult peopl pai attent hold side establish ey contact video conferenc system attempt provid spatial cue hydra system multipl small posit local user user easili attend individu particip turn face monitor side support system wall projector transmiss screen creat remot particip seat real tabl user make ey contact conduct parallel prototyp support spatial video conferenc ey contact common disadvantag system user control remot camera posit viewpoint spatial relationship particip unlik collabor technic problem overcom system scale support larg group particip virtual realiti provid altern medium group peopl share commun space british telecom demonstr virtual conferenc user repres life virtual avatar virtual room user freeli move space set viewpoint spatial relationship collabor virtual environ spatial visual audio cue combin natur wai aid commun effect show peopl easili monitor spatial audio stream select interest simpl virtual avatar spatial audio model enabl user discrimin multipl speaker spatial interact valuabl govern interact larg group enabl crowd peopl inhabit virtual environ interact imposs tradit video audio conferenc wearabl commun space result previou section suggest ideal wearabl commun space high qualiti audio commun visual collabor underli spatial metaphor import aspect creat collabor commun interfac visual audio present inform current wearabl comput head mount displai stereo headphon displai inform present combin inform fix user viewpoint chang user viewpoint orient posit inform fix rel user bodi posit vari user viewpoint chang posit requir user viewpoint orient track inform fix real world locat vari user viewpoint orient posit requir user viewpoint posit orient track bodi world stabil inform displai attract number reason inform space overcom resolut limit head mount displai work user wear head mount displai seat rotat chair track head orient user experi inform surround effect million pixel inform present enabl annot real world context depend visual audio creat inform enrich environ intuit real world task current wearabl inform displai work chosen begin simplest form orient give user impress surround virtual cylind visual auditori inform figur contrast tradit head stabil wearabl interfac figur head stabil inform displai figur freedom displai head mount displai navig cylindr portion inform space field view wai rest space rotat inform space track head orient space requir addit hardwar map switch voic input direct angl requir simpl freedom tracker minim hardwar requir make cylindr spatial inform displai attract cylindr displai natur head bodi motion vertic make difficult user disori previou paper found user locat inform rapidli type inform displai tradit wearabl inform space sawhnei schmandt demonstr spatial audio improv access audio inform wearabl user simultan audio stream displai configur wearabl conferenc space creat remot collabor virtual avatar distribut user avatar live video stream speak audio stream spatial real time emit avatar figur spatial conferenc space user turn face collabor talk awar place user move space enabl viewpoint spatial relationship collabor space support dozen simultan similar current collabor virtual environ displai user real world enabl remot collabor real world task remot user wearabl comput head mount displai interact desktop workstat wearabl conferenc space face remot user crucial factor establish equal relationship remot collabor technic requir conferenc space place year remaind paper describ prototyp develop featur implement research initi collabor singl wearabl comput user desktop pc user situat encount wearabl user field request remot expert aim develop wearabl interfac support medium size meet manner natur intuit hardwar wearabl comput custom built pc base comput ram run window figur show user wear displai comput figur wearabl hardwar hand held wireless radio trackbal button primari input devic displai pair virtual convert displai remov left virtual head mount displai occlud resolut pixel field view magnetomet freedom orient tracker wireless lan give internet access feet base station wearabl compat sound board headmount microphon desktop pc standard pentium class machin internet connect sound capabl wearabl interfac wearabl comput graphic hardwar limit wireless bandwidth interfac simpl conferenc space run full screen applic initi blank remot user connect user join conferenc space repres block pixel textur map static pictur user determin posit orient avatar move environ resolut imag crude suffici identifi speaker importantli spatial relationship wearabl user hope futur wearabl comput cpu power wireless bandwidth suffici support real time video textur map wearabl user head track simpli turn face speaker interest user navig roll trackbal forward backward viewpoint move forward backward direct virtual imag real user roll trackbal move virtual space navig space user constrain chang viewpoint horizont navig method head match type motion face face walk join join group bodi orient group radar displai show locat user conferenc enabl user find easili figur show wearabl interfac wearabl perspect interfac develop librari suit wearabl interfac support spatial internet telephoni user connect conferenc space audio broadcast user space spatial distanc direct speaker listen user face move closer speaker speaker volum due sound speaker constrain remain plane listen audio simplifi audio cull audio stream speaker closest listen broadcast spatial significantli reduc cpu load conferenc space custom develop telephoni librari incorpor microsoft direct sound librari figur view wearabl conferenc space desktop interfac user desktop workstat interact conferenc space similar interfac wearabl case applic run window applic desktop user navig space movement rotat head posit left button held translat user backward forward space map avatar orient movement mean desktop interfac intuit wearabl interfac user desktop machin wear headmount microphon talk conferenc space listen stereo headphon wearabl desktop user awar spatial relationship particip particip turn talk desktop user avatar turn face person talk distribut softwar architectur wearabl desktop interfac base custom librari collabor virtual environ develop british telecom wearabl desktop client applic run multicast group creat enabl client commun multicast socket multicast protocol effici mechan broadcast data multipl network node shown scale larg commun conferenc space rout multicast shown figur transform data repres posit orient messag data audio data user connect commun space assign uniqu identif user move id posit orient inform broadcast transform multicast group transform data flow rate user receiv client group updat relev posit orient transform inform audio stream relev receiv posit figur distribut softwar architectur similarli user speech digit broadcast audio multicast group receiv client sender ip address identifi avatar audio belong posit orient audio spatial real time audio implement util direct sound technolog captur audio broadcast audio multicast group receiv client comput buffer plai back direct sound order audio oper full duplex mode captur rate bit result data rate connect multicast group user connect disconnect affect user conferenc space initi user experi develop wearabl conferenc space set explor spatial visual audio cue compar tradit portabl commun audio collabor mobil phone process conduct user trial evalu spatial audio visual affect commun collabor preliminari inform trial found user easili discrimin simultan speaker audio stream audio expect effect notic number simultan particip particip prefer visual collabor hear speech poor qualiti visual enabl connect spatial relationship speaker cue commonli commun gaze modul bodi motion radar displai find collabor bare visibl user found continu real world task talk collabor conferenc space move conferenc space trackbal collabor block critic portion user field view interfac easi intuit head track wearabl easier desktop interfac user connect conferenc space spatial multipl audio stream put sever load slow graphic head track make difficult wearabl user confer peopl simultan problem reduc faster cpu hardwar support graphic wearabl comput sever spatial cull audio stream overcom select stream singl spatial remov audio altogeth present prototyp wearabl commun space spatial visual audio cue enhanc commun remot group peopl interfac show comput commun facil coupl wearabl platform preliminari result found user prefer audio visual cue spatial audio make easi user discrimin speaker suggest applic wearabl comput provid altern tradit commun devic conduct formal user studi confirm result evalu effect spatial cue commun pattern futur plan investig presenc spatial video enhanc commun incorpor live video textur map enabl user remot collabor speak user send view improv collabor task wearabl commun space support numer collabor applic particip sit desk mobil share virtual environ facilit commun group peopl ad potenti textual audio inform specif trait import augment commun space user form effect cognit map associ annot inform physic object surround demonstr system commun space locat rel user abil explicitli posit object commun space rel real world locat excit rang applic user view avatar confer particip overlaid attach physic notic board repres power vision conferenc remot video conferenc particip separ window screen spread posit space user prefer acknowledg colleagu british telecom hit lab insight product nick dyer produc render figur anonym review comment refer smart wearabl comput person vol march wearabl result system design guidelin interact juli sydnei australia tour prototyp mobil augment realiti system explor urban environ intern symposium wearabl octob lo ieee pp design wearabl comput chi georgia march empir studi collabor wearabl comput chi confer denver pp collabor perform physic effect outcom commun cscw nov cambridg acm press spatial workspac share view video support system remot collabor chi human factor comput pp remot effect mediat talk technolog human comput vol pp comparison mediat commun psycholog vol pp interact human commun scientif american vol rethink video technolog interperson theori design implic academ press disembodi commun video multimedia environ chi human factor comput acm pp role vision mediat commun ed erlbaum pp field studi media space cscw nov cambridg acm press desktop futur multimedia conferenc bt technolog vol octob pp speech pattern chi york pp spatial cue improv videoconferenc chi york pp videoconferenc virtual social design cscw octob pp teleconferenc system capabl multipl person ey contact half mirror camera common point extend line gaze ieee transact circuit system video vol august virtual conferenc bt technolog vol octob pp spatial model interact virtual environ european confer comput support cooper work septemb auditori scene perceptu organ sound mit exploit simultan listen chi confer denver york pp support casual meet network cscw nov cambridg acm pp crowd collabor virtual environ chi georgia march hundr million pixel displai ieee vrai seattl septemb ieee lo pp world comput augment interact real world environ user interfac softwar technolog novemb pp evalu wearabl inform space ieee vrai march ieee comput societi lo ca design spatial audio nomad environ intern confer auditori displai novemb human comput survei nonverb behavior system workshop perceptu user interfac oct ieee comput societi lo interact multimedia internet exploit realiti multicast network architectur virtual environ ieee vrai confer ieee comput societi lo march pp
Agents/174 1 softwar fault tree approach requir analysi detect system gui mark vasant le lutz depart comput scienc hall iowa state iowa abstract softwar fault tree requir identif analysi detect system divid fault develop model stage softwar fault tree approach support requir evolut identifi increment develop distribut id id develop collect mobil agent correl system network activ analysi softwar fault tree minimum cut set identifi softwar requir deriv requir includ activ monitor fund part depart fund part jet california institut contract nasa fund part nasa code softwar program center permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee symposium requir engin inform secur indiana usa copyright acm agent characterist agent id agent feasibl detect countermeasur softwar exampl demonstr softwar fault tree approach develop id introduct softwar fault tree analysi method identifi document combin softwar event event root occur root node assist requir process describ wai system reach unsaf state safeti requir system deriv softwar fault indirectli directli share model work assist determin verifi requir detect system root node strictli safeti violat system secur polici result disclosur data integr modif avail safeti failur expect occur safeti secur failur repres potenti catastroph loss occur varieti wai softwar fault tree model combin sequenc event occur understand captur domain knowledg accur defin requir detect system difficult question feasibl detect id stage id softwar detect assur id softwar detect address requir analysi goal build system root node build id root node occur undetect investig formal underpin detect system term describ identifi characterist provabl detect base observ characterist exist detect system tend built select set data sourc develop classif system identifi set select data broader approach begin analysi support develop theoret model detect answer question data sensor extent assur report accur primari contribut work analyz domain softwar fault tree order determin requir id model stage structur support discoveri reason requir support requir evolut fault tree updat essenti featur secur applic increment develop id progress path root node root node block softwar inspect minimum cut set guidanc softwar monitor id requir path coverag metric provid verif id requir correct rest paper organ section background id section describ fault tree model section elabor specif exampl experi requir determin id section discuss result term requir identif requir verif section conclud remark background softwar fault tree analysi softwar fault tree analysi model backward search begin hazard root node trace back parallel serial combin event due space reader refer descript fault tree softwar nation engin lab draw edit fault tree cut set set basic event occurr system fail cut set call minimum cut set reduc system fail minimum cut fault tree minimum set success event satisfi root minimum cut fault tree describ scenario case attack successfulli exploit secur flaw achiev goal system al binari diagram altern solut fault tree combinatori solut current size fault tree manag tradit solut model detect system model techniqu id model detect system detect detect system dynam build graph model commun activ network graph depend rule identifi suspici pattern model adapt detect repres signatur direct acycl graph unlik model graph amen aggreg detect id custom languag variant color petri net detect fault tree model draw varieti sourc standard current network publicli standard ip network publish internet engin task forc request comment standard implement network protocol freeli softwar public review secur issu numer research hacker activ discov publish secur vulner public forum includ mail list web site jansen discuss role mobil agent effect detect fault gener consid fault similar problem buffer exist softwar system directli sourc code bodi vulner inform input develop sampl fault tree discuss reason fault tree success vari greatli attempt analyz complet difficult monolith fault tree attempt describ attack tree divid systemat manner reason approach divid stage attack achiev intermedi goal develop fault tree model stage analysi separ vulner data extract attack relai stage root node turn approach attack analyz gate fault tree shown input true gate input true current context virtual network user login seri relat tempor context gate fault tree shown gener assum child event occur order al discuss ambigu accept fault sampl fault tree repres subset concern administr distribut network path tree describ complet discuss activ attack attack includ event distribut system organ control major attack activ passiv attack attack leav trace organ distribut system exampl passiv attack password dn zone transfer secondari dn server space figur includ paper figur tempor phase examin onlin gui helmer phd dissert reconnaiss reconnaiss phase identifi potenti target organ network network target includ host unix intellig modem servic offer system user system inform attack identifi number reconnaiss event vulner identif vulner identif close relat reconnaiss attack search vulner lead penetr attack sequenti scan port version remot control servic vulner attack port scan activ easi detect slowli vulner identif identifi number vulner identif event penetr penetr occur attack obtain unauthor access system penetr method includ exploit network server daemon vulner authent buffer authent obtain tcp session figur repres sampl fault tree penetr stage control attack gain suffici privileg system continu stage attack obtain privileg system administr gain suffici control system penetr effect suffici privileg step mechan trace control phase includ exploit buffer overflow privileg local exploit race condit temporari file exploit weak permiss critic file crack password administr account involv instal modif system attack discov step recov attack enter system system bootstrap code modifi system execut program restor backup instal media typic techniqu includ instal remov trace system disabl detect system phase identifi instal match set modifi system file collect program attack hide activ includ program data extract modif data extract modif data extract modif attack gather inform configur oper system covert channel move discov data system attack base attack relai system fulli attack relai attack launch affili host expand number host attack control system simpli particip distribut attack attack relai repres basic fault flood distribut denial servic attack form attack relai includ autom manual mean experi fault tree relationship develop fault tree actual examin section multipl path stage model portion fault tree figur describ ftp bounc select analysi ftp bounc attack interest involv step place attack success ftp site exec ftp site exec attack daemon buffer overflow exploit log daemon user anonym daemon request email address enter password attack send malici shell code password prompt site exec command attack send site exec command charact buffer overflow data obtain password reconnaiss stage intrud discov anonym ftp server host method node reconnaiss intrud discov avail ftp server method node reconnaiss tree stage intrud identifi vulner path vulner identif intrud time make connect ftp server verifi version number report server vulner ftp site exec attack ftp vulner expand node vulner identif figur show penetr fault tree scenario continu scenario shown detail path fault tree figur intrud connect ftp give user enter malici shell code password intrud issu site exec command substitut charact sequenc attempt overflow charact buffer process stack data overflow code provid intrud execut root privileg success ftp site exec attack attack attack move stage assum success penetr result privileg control phase intrud instal linux version replac number program implement hide attack activ describ file system result instal linux version data extract intrud instal run password user password telnet ftp session lan final stage shown path attack fault intrud instal run distribut denial servic intrud system execut attack network site deriv id requir softwar fault tree involv identifi softwar requir mobil agent softwar task detect ftp site exec examin tree show penetr path ftp site exec feasibl detect penetr softwar detect system monitor pass command ftp session data repres valid sequenc printabl charact invalid sequenc printabl ter minimum cut event analysi monitor implement lead requir detect system ftp bounc ftp bounc attack transfer data network port attack access exploit problem send data remot shell server trust ftp host ftp server attack discov ftp server host run trust ftp attack upload file ftp issu ftp port command direct ftp server send download port target issu ftp command content file port command open connect ftp server port daemon target target trust ftp daemon accept content file user input execut command step base ftp bounc attack show tree fit entir reconnaiss stage intrud discov ftp server host target method node reconnaiss tree intrud discov avail ftp server server method node reconnaiss tree discuss vulner identif intrud time make connect ftp server verifi version number report server vulner ftp bounc attack path intrud directori ftp server upload intrud access ftp server intrud search directori larg number ftp vulner expand node vulner identif tree intrud assum target host trust ftp server intrud access target host read file consid vulner identif tree continu penetr intrud upload shell command file ftp server issu ftp server file target servic fig show requir ftp command structur enforc order event ftp stream success ftp bounc attack mount privileg account target attack attack move stage stage omit reason space path point ident deriv id requir analysi ftp bounc attack show order detect softwar requir id monitor command ftp monitor correl output monitor determin ftp bounc attack attempt attack success analysi monitor implement yield requir detect system countermeasur ftp bounc attack step detail part scenario fit minimum cut fault tree inspect minimum cut lead point appli countermeasur countermeasur detect system typic includ alert system manag simpli log termin network connect disabl user account examin minimum cut penetr tree ftp bounc attack inform consid cost appli countermeasur node cost includ complex softwar requir effect legitim user system lowest cost countermeasur kill tcp connect made ftp server countermeasur node prohibit prevent legitim ftp late termin ftp bounc discuss result softwar fault tree explor suffici combin event lead exploit vulner develop fault tree enabl varieti discoveri verif activ summar briefli refer reader previou section exampl requir identif analysi fault tree document properti analysi properti domain understand document captur domain understand frequent difficult secur arena softwar fault tree provid format document properti system network expert determin requir minimum cut model sequenc softwar requir recogn identif leaf event fault tree illustr compon distribut system monitor detect analysi fault tree condit countermeasur successfulli appli detect system interven success fault detect analysi refer abil system detect problem system oper determin characterist monitor essenti part requir analysi id exist event discern effect site distribut system event includ zone secondari server passiv password mark event appropri fault tree analysi difficult give hint wai prevent occur requir evolut increment develop softwar fault tree support detect system develop mainten activ priorit requir addit histor inform likelihood sever leaf node address assist priorit requir base sever likelihood inform fault alert prioriti encod detect system attack reconnaiss vulner identif low sever high likelihood low alert prioriti attack penetr control high sever high alert prioriti attack attack integr fault tree inform encourag fault attack depend set stanc diagram fault addit fault tree incorpor inform attack guid modif detect requir design detect attack verif confid establish softwar fault primarili expert design detect trace softwar fault tree determin complet correct base test strategi al test design implement id describ relat defin class set select repres minimum cut test scenario posit neg exampl execut determin accur match event scenario form set repres test case class interpret fault tree directli unlik fault tree formal semant formal approach desir applic fault tree develop maintain system support personnel expert formal specif primarili support personnel knowledg system vulner fault tree intend captur understand descript larger id system order fault tree work requir phase larger effort provid formal framework build id id mobil agent distribut system collect audit classifi correl inform mobil detect fault tree drive requir mobil agent detect system fault tree color petri net serv design specif mobil agent id interact simul addit verif design satisfi requir block relev fault code id mobil agent gener test minimum cut fault tree prototyp exist phase mobil agent work partial autom code gener interest aspect requir phase work requir specif fault tree interpret specif combin event detect id requir sequenc fault tree detect leaf event describ compon distribut system monitor mobil agent softwar separ requir specif document develop fault tree extend addit inform specif system prior map inform trust member distribut system member context event involv tempor order event adjac interven follow specif interv addit id yield detect specif set event mark fault tree superset set event specif network constrain addit knowledg inform constraint summari futur work softwar fault tree analysi model support requir identif analysi id present support exampl illustr fault tree stage sampl fault tree stage stage examin softwar requir detect attack deriv examin tree minimum cut set guid countermeasur requir analysi enabl structur analysi support requir evolut ad increment develop id begun formal develop softwar fault tree drive develop detect design softwar fault tree model provid indirect requir descript design id result design model color petri net implement mobil agent model assist verif process provid scenario id requir detect refer cert coordin center ftp bounc dec cert coordin center input valid problem juli de analyz safeti requir system ieee softwar del fault detect analysi requir valid fault toler system ieee intern system engin symposium ieee comput pp project distribut denial servic attack tool oct distribut denial servic attack tool dec flood distribut denial servic attack tool oct distribut denial servic attack tool safeti analysi softwar requir ieee transact softwar engin intellig system detect countermeasur phd iowa state dec softwar fault tree color petri net base implement detect system submit acm transact inform system intellig agent detect ieee inform technolog confer sept pp nation engin laboratori system analysi program integr reliabl evalu mobil agent detect annual canadian inform technolog secur symposium june detect comput phd purdu west aug pattern match model detect nation comput secur confer oct pp system safeti comput specif adapt strategi ieee comput secur foundat workshop june pp requir analysi forward backward search annal softwar engin combin solut techniqu dynam fault tree analysi comput system ieee intern system engin symposium ieee comput pp methodolog test detect system ieee transact softwar engin assur principl practic engin technolog manag seri coordin attack juli graph base detect system larg network nation inform system secur confer pp penetr login cgi penetr penetr phase penetr phase access shell exist tcp login session modifi configur file login login author method user input vulner common gatewai interfac send spoof tcp segment connect sniff tcp sequenc number exist net daemon buffer overflow vulner exploit cgi script instal older web server daemon vulner cgi vulner cgi perl present cgi figur penetr fault tree net daemon buffer overflow vulner exploit net daemon buffer overflow vulner exploit mail transfer agent daemon buffer overflow berkelei line printer daemon buffer overflow bind daemon buffer overflow buffer overflow vulner nf mount daemon buffer overflow nf statu daemon buffer overflow mail daemon buffer overflow site exec site exec figur penetr fault network daemon login nf modifi configur file login modifi configur file login result exploit vulner login insecur servic trust net daemon buffer overflow vulner exploit modifi insecur nf creat user file enabl addit servic remov exist servic modifi modifi start vulner daemon modifi user file modifi modifi enabl enabl pop enabl enabl trivial file transfer protocol enabl remot shell servic enabl remot login servic figur penetr fault gain access modifi login login login author method login author method login weak password obtain password trust host fail login success login login obtain password network data obtain password user ftp bounc spoof trust host connect ftp connect establish authent ftp command ftp session command tcp connect port ftp host port target host guess tcp initi sequenc number guess tcp initi sequenc number ftp session port success ftp command make tcp connect discov sequenc number pat ftp session port command direct target port ftp connect establish authent ftp command send data target port upload input ftp server download file port target spoof dn tcp isn connect login password ftp store file ftp transfer connect ftp transfer spoof trust host dn tabl tcp session spoof ing connect login password figur penetr fault gain access authent method
DB/175 3 constraint joachim torsten poll fb dortmund septemb abstract normal form relat de ned mean semant contraint constraint sound complet exist constraint implic problem comput aid design relat data model theori lack normal partli classi cation semant constraint sound complet exist work present class semant constraint data model show constraint sound complet prepar ground normal form data model subsequ comput aid design introduct theori design relat data model identi es number properti good schema properti lead normal form schema exclud undesir properti design theori objectori data model lack clear syntact semant constraint function depend plai relat data model vital syntact number properti al show function depend deploi guid decomposit call pivot decomposit produc schema function depend special form lift restrict path function depend extens function depend data model order work path function depend infer exist path function depend produc introduct pivot introduc kind semant natur depend relat data model constraint impact logic implic path function captur infer rule close gap introduc infer rule work combin class constraint path function depend class constraint plai due interplai signatur declar class schema constraint demonstr mean constraint path function depend ensur decomposit remain design task model scenario modern phone belong standard equip end month charg accru telecommun cost assum oc domain faculti member charg cost phone identi ed phone number bill school faculti member work school group depart handl depart allot stock phone prefer pre rst attempt conceiv schema depict fig arrow denot attribut declar class type attribut class arrow denot class subclass class class superclass class phone attribut declar class sch ph person school faculti phone depart dep fac figur simpl schema class model relationship entiti mention call class relationship class restrict object attribut de ned restrict data store mention text path function depend restrict faculti member work path function depend semant path function depend ensur object class attribut introduct attribut sch case path function depend justi ed length remain restrict nalli path function depend path function depend ensur object exist combin attribut object class simul tupl rst attempt complet reason captur relationship faculti member charg cost cater record phone subsequ bill schema serv start point design step present form schema di erent mean pivot outcom decomposit schema depict fig school phone faculti ph depart dep sch fac person figur pivot schema introduc subclass receiv attribut sch dep class chang semant constraint ect appli schema attribut sch dep occur path function replac fragment path function depend schema path function depend demand object class attribut deliv infer rule simpl pre augment deriv path function depend path function depend introduct trivial hold schema due infer rule simpl attribut reason discard path function depend altogeth drop path function depend simplifi obtain set semant remain unchang chang reduc chang introduc semant constraint secur object class referenc object class attribut fac insert obtain object class faculti member school phone alloc state permiss origin schema path function depend extens function depend relat data lack correspond case natur similar depend relat data model separ notion relat attribut data model combin singl notion class constraint oper attribut translat concept constraint relat data work relat attribut combin simpli relat data model extend facil access tupl identi er make similar observ class ensur object class member class class constraint brought game combin constraint strict type section introduc simpl data base data model retain exibl er incorpor extens relat data clear notion schema instanc schema encompass semant concentr class constraint path function introduc sect class semant develop infer show sound complet proof complet initi base extens complet proof path function depend construct suce due presenc satisfi constraint gener problem decid data model logic implic remain open problem posit solv path function depend data model work eld design call high syntax semant underli data desir nding syntact involv invent construct class semant constraint vast number data great de ne data model plai data model predic logic relat data model data base kifer al facilit access present descript materi basic notat meant denot class method work constant set variabl set mean call molecular formula construct sequel assert form form state class repres subclass class repres object repres element extens class repres allevi awkward result speak repres paper convent speak mean class clear context addit object molecul form method method express scalar data express scalar signatur express intuit mean data express invok method call object yield signatur express understood declar signatur attribut class case type attribut result type formula built simpler formula mean logic connect quanti er simplest formula molecular formula construct de ned construct ground data model present detail normal connect data express signatur express miss gener introduc connect axiom sect restrict model obei type declar signatur express detail model immateri ensu discuss set ground denot set ground molecul denot subset herbrand base close logic entail formula formula logic consequ classic logic symbol free bound occurr variabl formula de ned classic sentenc formula free occurr variabl schema instanc data model describ actual data compon give data structur restrict data data group compon call result regard schema consist data structur descript semant constraint data model class identi ed applic hierarchi attribut constant time definit schema form std nite set set class set attribut set ground class form class set ground object molecul consist scalar signatur declar signatur class attribut ariti data model set semant constraint restrict set instanc set class attribut class schema form hierarchi set class assert class declar attribut signatur mean set object molecul signatur express due semant inherit signatur declar inherit subclass set sentenc semant restrict data store schema data clear separ notion class attribut give class attribut introduc distinct ensur class occur method object posit vice versa class attribut technic set constant set trivial object nonetheless set set constant add schema semant constraint denot addit syntact di erent thing semant di erent axiom attribut return attribut declar object fact ensur axiom connect signatur express data express ensur presenc axiom definit set ax axiom consist set set axiom singleton set axiom nn set axiom wt class hierarchi impli set semant consid class data model violat axiom featur demand class hierarchi acycl work schema hold interest set attribut declar class attribut declar class definit schema set fa attribut class denot attribut call proper attribut class hold class de nition logic entail impli knowledg class hierarchi signatur declar proof note logic entail assert signatur atom decid nite set assert signatur atom part data model stabl subject frequent data object popul class attribut valu aspect separ object assert class popul scalar data atom attribut de nition definit extens schema form pp job set set ground object pp popul set ground object molecul scalar data ob de nition attribut valu object permit de ne class introduct signatur bind extens constant obviat deduct knowledg intern structur clear separ domain class complet extens schema deduc extens case ground molecul semant constraint definit extens schema complet extens schema compl std pp ob complet smallest union std pp ob instanc extens schema obei semant constraint schema object de nition member class instanc complet satisfi axiom definit extens schema extens call instanc schema compl axiom ax semant constraint due limit determin set object instanc sole mean set pp object assert determin class object element instanc sucient class hierarchi class popul definit extens schema set object extens denot fo pp cl object set class object element cl fc pp semant constraint sentenc fact chang section introduc class semant constraint semant constraint relat data model number class semant constraint function join depend depend commonli deepli investig class semant constraint miss data model root data model program account defect exibl express arbitrari semant constraint program languag lead burden applic programm speci cation implement semant constraint leav manag system principl integr independ violat di erent approach de ning class semant class constraint path function depend class depend subordin part complet infer rule constraint path function depend semant constraint class constraint class constraint demand object class member class definit class constraint class schema form class constraint formula class constraint symbol denot set class constraint formula set semant constraint sort semant constraint plai introduc connect transform pivot constraint ensur origin schema transform schema constraint demand object class referenc object class attribut definit constraint class schema form attribut class constraint formula constraint set constraint formula class set semant constraint denot symbol denot set constraint formula set semant constraint blur clear distinct syntax semant write pivot schema exam constraint ensur instanc element class attribut attribut fac object class symbol denot set class constraint constraint formula schema give infer rule class constraint constraint introduc path function path function depend uenc deriv class constraint constraint semant constraint rst rule incarn transit natur class constraint rule captur impact class class subclass element subclass element superclass class hierarchi depend sole underli rule introduc depend infer mechan underli schema rule embodi interplai constraint signatur declar presenc class constraint ect introduct class constraint orthogon class hierarchi rule class constraint rule deal infer constraint rst rule restrict rang grant relax domain constraint definit rule cic class constraint constraint schema constraint deriv set written member set result applic infer rule class subclass deriv signatur rang domain de nition bring logic entail bear extract knowledg class hierarchi signatur mind extract algorithm decid demonstr infer rule work mean serv run work convei intuit technic involv complet proof infer rule class constraint path function depend er interpret real world class attribut alik base includ point constraint class constraint plai path function depend consid point add introduc semant constraint schema consist compon cl fe jg rg hr fe sg sc fe gg schema depict fig interest constraint schema figur schema run constraint deep impact behaviour instanc rang class result class attribut declar class subclass result class exist signatur declar object class referenc object class attribut due constraint object class element class satisfi axiom behaviour captur infer rule signatur instanc schema fo semant constraint cl fgg cl ff fg cl fhg cl fjg cl fig cl fe figur instanc schema run instanc depict fig semant constraint schema exhibit infer rule class constraint constraint work give infer rule fig set class constraint figur applic infer rule deriv set sc semant constraint schema fe fg set constraint deriv set sc semant constraint semant constraint schema fe gg instanc sati es semant constraint due correct infer show theor deriv constraint closur set class constraint constraint schema set class constraint constraint deriv set class constraint constraint definit cic closur set written set class constraint constraint schema prepar de ne path function concept path simpli de ning introduc gener notion extens complet proof basic idea underli complet proof construct counterexampl sati es semant constraint declar schema satisfi semant constraint deriv semant constraint prove construct counterexampl base knowledg deriv semant notion logic impli construct counterexampl iter begin core partli sati es semant constraint constraint path function satisfi constraint encount object construct process violat remedi violat constraint schema object class referenc object class attribut case cure violat introduc object class refer object attribut iter construct process track posit newli insert object rel call root accomplish track rememb attribut follow reach newli insert object root attribut graph span instanc follow edg simpl path follow permiss wai divid complet proof smaller piec semant constraint folder class rst concept base principl folder class speci es class object class element semant constraint class hierarchi definit de ne folder class folder fd dg folder class schema exam folder ff fg core counterexampl proper instanc determin class root object member class membership object includ initi instanc due axiom iter instanc due ed constraint task emploi describ instanc instanc label object constitut node label class object member direct edg node label signi es sourc object hold target object attribut extens captur follow edg forward direct object object direct object object string attribut separ dot dot forward signifi backward rst de nition arbitrari arbitrarili string attribut definit set arbitrari arb schema consist nite sequenc minu separ attribut ident descript denot id arb ng length length set arbitrari arb arb schema consist arbitrari occur schema exam arbitrari schema semant constraint set arbitrari arbitrari set arbitrari describ wai instanc underli schema arbitrari interest form exclud mean concaten arbitrari definit arbitrari arb arbitrari schema written de ned give exampl concaten arbitrari arbitrari exam concaten associ lemma lemma arbitrari arb arbitrari schema concaten arbitrari proof proof lemma includ technic subtleti obviou object describ start object instanc instanc minim set object object exist demand semant constraint semant constraint form direct acycl graph intend determin compulsori class membership object reach wai de nition start shortest consid longer descript distinguish prolong exist attribut forward direct simultan de ne domain rang set class describ start point object element domain class class domain set class end node member definit set wf arb schema smallest set wf rand folder wf domain class attribut wf fe rand fh folder rand wf domain class class rand wf fe rand rand fh folder rand class write denot wf start class semant constraint set denot set start class speak sequel mention arbitrari exam arbitrari dom cl fe ran folder ff fg base calcul domain rang begin show rst determin domain rang domain class de nition case forward deriv class dom rang ran folder ff fg set attribut class inequ dom dom fa dom ff ran ran fc folder ran hr sg fe dom ran dom ff ran fhg exhibit de nition dom ran sc hold domain dom fhg semant constraint rang ran fe concaten applic class rang obtain independ form lemma wf schema exist class rand schema wf rand rand proof proof induct length describ wai start object interest end node definit instanc schema cl fog fo ob fo ob applic object extens exam yield result fo fo fo fo path function depend attribut relat data model path function depend introduc function depend relat data model function depend de ned relat path function depend declar class emploi lieu simpl attribut side path function depend state object class depend deliv ident result left side object side semant constraint motiv exam path function depend fact depart allot stock phone prefer pre object class phone faculti member charg telecommun cost work depart path function depend chosen start class path function depend declar appli object respect obtain de ned result bear mind set start class enlarg class constraint constraint class constraint start class start class definit function path function depend class schema form ng de ne instanc sati es path function construct formula facilit task term arb shorthand form term shorthand form path function depend path function depend formula fp set path function depend denot semant constraint de nition de ned left side path function depend sequenc de nition set left side limit set semant constraint schema class constraint path function schema consist compon std simpli call set class constraint path function depend set constraint remaind work extend schema exam path function depend refer schema exam understand path function depend includ interest set path function depend depend attribut declar class superclass attribut due class constraint hold instanc schema case class constraint infer rule path function depend make problem implic amen algorithm treatment infer rule class constraint path function depend turn class constraint constraint ect implic path function round impact class constraint constraint start declar path function constraint potenti enlarg set class fact prove theor infer rule complet path function depend ad set semant constraint supplement infer rule captur implic class constraint path function depend present ve infer rule path function depend adapt data model rst rule path function depend captur exiv path function depend rule extend side path function depend set rule path function semant constraint depend show path function depend transit rule exist similar attribut relat function depend rule simpl attribut simpl pre augment counterpart relat data model rule simpl attribut object uniqu determin attribut valu rst rule act local class simpl pre augment includ class path function depend deriv class class reachabl class attribut path function depend result prolong origin path function depend declar class deriv class infer rule simpl pre simpl pre augment simpl pre reduct thalheim reduct simpl pre reduct telescop deriv path function depend provid common pre constraint deriv common pre attribut rule path function depend bring class constraint plai path function depend declar class hold subclass class term subclass denot real subclass class deriv class constraint infer rule notat denot deriv class constraint constraint infer rule produc path function depend con ict notat rule definit rule oc path function depend schema path function depend deriv set written member set result applic infer rule path function depend class set set nite subset deriv class nite subset denot union path function depend simpl class attribut deriv simpl pre class attribut semant constraint rand simpl pre class path function depend class deriv figur exhibit applic infer rule semant constraint schema exam rememb includ path function depend exam semant constraint figur applic infer rule section class constraint path function deriv set constraint schema mean infer rule interest path function depend deriv set constraint schema relat data model determin set attribut relat scheme function determin set attribut relat scheme determin set start class function determin set start class complet infer rule definit oc closur set written set constraint schema set written set path function depend schema closur set class written set infer rule instanc satisfi semant constraint satisfi deriv constraint theorem infer rule infer rule set constraint schema constraint schema instanc schema sati es constraint proof show correct infer rule straightforward complet infer rule show complet infer rule de nite harder central idea show complet contraposit show constraint sati ed instanc constraint deriv constraint exhibit constraint deriv constraint exist instanc schema satisfi constraint facilit complet proof part prove complet infer rule complet infer rule independ infer rule path function depend make decomposit feasibl embark complet point infer rule complet class constraint fact exploit lemma infer rule class constraint schema set class constraint schema fc deriv class constraint set schema proof conduct proof assum hold show exist extens fc complet infer rule construct extens arbitrari schema satisfi axiom ax set class constraint class constraint extens consist object object element class deriv object element class object object attribut declar class deriv object attribut object element class dg fo gj fo sketch extens outlin fig cl cl figur sketch extens proof lem extens sati es axiom axiom object satisfi set class constraint de nition extens instanc schema hypothesi due infer rule mean compl hold proof theori object element class extens instanc schema fc complet infer rule construct extens schema extens instanc schema instanc schema constraint deriv set constraint schema idea start rst extens sati es set ax axiom amend extens satisfi semant constraint schema invari extens satisfi constraint complet infer rule case complet proof infer rule call prototyp instanc case infer rule construct schema constraint form object class case start point mention construct extens satisfi rst set ax axiom appli insight consist object mean axiom sati ed introduc valu attribut object attribut valu object turn signatur declar object introduc attribut valu satisfi axiom process introduc object avoid con ict uniqu axiom iter axiom sati ed outcom iter form tree object letter stem fact repres unfold schema graph start class declar signatur schema declar tree nite nite extens instanc schema track posit object rel adorn object edg reach object set root satisfi constraint amend constraint sati ed constraint exist object element class referenc object class attribut remedi insert object make object element class stipul object attribut object discov care make ensur set ax axiom sati ed insert singl object insert root prune cut branch start attribut violat attribut call prune track insert object mean time edg direct emploi place reach root simultan insert object violat constraint call oper invari extens sati es set ax sati es set ax axiom iter process introduc object produc extens sati es constraint deriv constraint schema complet infer rule order posit prove nal outcom construct process sole base knowledg deriv deduc satisfi class constraint deriv set constraint follow di erent ensur deriv class constraint sati ed outset begin root initi ensur root element class requir set constraint treat class membership insert object iter process iter process alter class membership object satisfi class constraint deriv set constraint iter process gener output sati es set ax axiom set constraint schema constraint prove complet infer rule extens obtain appli oper iter special extens object carri object rel posit stand special relationship object neighbourhood relationship object determin sole root object relationship combin notion extens label definit instanc schema set set class constraint constraint schema instanc instanc label base set object properti cl wf object ob call object root instanc set root denot de nition de ned due lem de nition rang reli de nition folder turn reli deriv class constraint schema schema lai foundat satisfi axiom deriv class chang initi class membership step properti extens label ensur class membership correctli properti ensur arbitrarili chosen complet infer rule instanc label schema set fhg set class constraint constraint sketch fig schema exam object root instanc label cl fe cl ffg cl fgg cl fgg cl fhg cl fjg cl fig cl fhg figur sketch instanc label paramet exam prove infer rule complet restrict declar constraint restrict oper transform extens sati es path function depend violat path function depend schema compon instanc fig instanc sati es path function depend appli oper extens result complet infer rule extens satisfi path function depend object object attribut attribut requir path function depend object introduc remedi violat constraint cl feg cl fcg cl feg extens satisfi path function depend cl feg cl feg cl fcg cl fc cg cl fg chang extens violat path function depend figur reason restrict constraint cure violat path function tamper class membership object introduc tempt make object member class good result extens sati es semant constraint origin extens chang class membership rippl ect object axiom signatur atom object member class di erent solut stipul object attribut object rippl ect class membership object case object object class due axiom signatur atom drastic precaut simpli situat demand constraint schema attribut proper attribut class complet infer rule definit set constraint schema set constraint proper set constraint constraint attribut proper attribut class lemma show restrict set constraint schema proper set situat mention violat path function occur object referenc object attribut violat constraint introduc object referenc object attribut object violat constraint form rst place lemma instanc schema set proper constraint schema ob cl cl proof constraint deriv infer rule constraint exist deriv set constraint attribut proper attribut class axiom exist signatur atom cover cl fact attribut proper attribut class class subclass class deriv impli due correct infer rule cl sequel deal proper set constraint explicitli show complet infer exploit properti extens properti extens label path lemma instanc schema label base set class set class constraint constraint schema cl exist object fo proof show induct length fog def form fo induct assumpt instanc label base set cl wf complet infer rule exist class exist class lem due induct assumpt mean cl instanc label base set hold signatur atom demand due uniqu axiom axiom exist object ob lead fo impli properti consequ lemma present corollari corollari instanc schema label base set class set class constraint constraint schema object class cl cl prototyp counterexampl complet proof extens label aim satisfi axiom deriv class constraint similar de ned stand case singl class set class kind tree possess adorn label base fcg empti set constraint construct idea start object root make root element class deriv set class set introduc object attribut valu root due axiom attribut valu made element class axiom set constraint iter process introduc attribut valu newli insert object perform start class set inform insert adorn object lead insert object adorn prove properti object complet infer rule definit extens pp job schema label base set class set class constraint constraint schema construct step constant add pp add addit label assign step add ob schema set fhg set class constraint constraint outlin fig schema exam cl fhg cl fjg cl fig cl fhg figur outlin exam show extens de ned instanc check complet sati es axiom constant object violat uniqu axiom issu addit attribut valu base axiom violat satisfact set issu point lemma prove state complet infer rule lemma schema base set class set class constraint constraint schema instanc schema label base set proof show instanc schema show axiom sati ed present observ object set class object element syntact determin due def lem cl wf sound complet proof theori reveal wai introduc equal explicitli state scalar rst possibl rule de nition schema simpli lack possibl possibl schema acycl class hierarchi object introduc object de nition mean attribut class cl exist class de nition exist object ob ob exist class class class element cl cl cover cl class class due exist mean cl gener satisfi constraint modifi ad object constraint violat object refer object complet infer rule gave rise violat attribut addit object violat sucient axiom call addit object violat constraint prune branch start attribut violat constraint object led violat object prolong adjust rel posit object context definit set set class constraint constraint schema wf constant extens schema label base set construct step wf arb constant add add addit label assign step add ob step add object label object ad background call object root exam construct schema set fhg set class constraint notic object violat constraint violat insert object make object attribut object object member class axiom requir attribut object de attribut declar class insert object shown fig paramet pass construct root insert root argument absolut posit determin set object violat constraint object refer root case object violat constraint attribut case introduc mean constant occur mean constant occur element extens construct complet infer rule cl fe cl ffg cl fgg cl fgg figur exam definit instanc schema label base set class set class constraint constraint schema set ed object violat class attribut cl cl ob set exam set class constraint constraint schema exam exam inform vector paramet construct object construct step ensur violat constraint sati ed object violat introduc object refer object creat insert root insert object definit instanc schema label base set class set class constraint constraint schema extens schema label base set de ned complet infer rule object introduc occur instanc de nition de nition instanc underli schema label initi extens output oper input enabl output instanc label show lem back exam appli oper set class constraint constraint schema exam vector element set add depict fig extens label shown fig result cl fe cl ffg cl fgg cl fgg cl fhg cl fjg cl fig cl fhg figur oper appli fig lemma produc instanc schema label base set class set class constraint constraint schema instanc schema label base set complet infer rule proof instanc proven line argument proof lem satisfact axiom axiom prune attribut axiom sati prune attribut receiv object violat constraint satisfact axiom prune attribut remain shown root introduc set class object attribut cl class de nition lem cl def folder exist class cl infer rule domain signatur cl satisfact axiom condit def sati instanc label root prune attribut root sati es condit de nition condit corollari draw connect lem oper corollari instanc schema set proper constraint schema ob set instanc label violat constraint set violat appli oper violat iter applic oper nal outcom instanc underli schema label sati es set constraint lemma schema label base set class set class constraint constraint schema instanc schema label base set complet infer rule proof lem instanc schema label base set provid instanc schema label base set instanc schema label base set remain show extens sati es set constraint due def lem deriv class constraint sati ed extens object gener constraint violat sati ed iter continu iter class object cl cl cor gener produc object oper retain invari due cor path function depend set trivial sati ed final readi prove complet infer rule class constraint path function depend proof conduct contraposit assum deriv constraint set construct instanc schema extens instanc schema instanc schema fvg theorem infer rule class constraint constraint schema deriv set constraint schema exist instanc schema instanc schema proof constraint form built set fcg object frg due lem instanc schema lem instanc schema label base set fcg remain show extens satisfi constraint prove contradict extens satisfi constraint class constraint constraint assum extens sati es constraint complet infer rule constraint form root member class cl due def fact construct class fact object equat cl folder hold contradict assumpt deriv cl folder constraint form exist object ob construct satisfi constraint object introduc rst applic oper mean exist vector class cl constraint folder constraint sati ed attribut declar class hold case impli deriv constraint set contradict complet infer rule infer rule complet class constraint path function give outlin prove complet infer rule constraint basic idea show complet contraposit show path function depend instanc schema instanc schema path function depend deriv set construct instanc schema satisfi path function depend depend deriv set construct counterexampl exploit idea core counterexampl armstrong construct similar proof relat data tupl closur set attribut case object class object root member class root valu closur root violat path function depend merg remov closur insert miss attribut valu object node remov attribut valu object intact carri remov object call sati es path function depend schema path function depend form prototyp counterexampl complet infer rule root head object closur limb grown satisfact class constraint reach carefulli class membership object face problem satisfi constraint simpli appli oper outcom satisfi deriv path function depend merg object insert di erent newli insert object object satisfi path function object reachabl object remain unchang call oper rst perform oper merg merg oper appli oper merg lead violat iter process nal outcom counterexampl instanc schema satisfi path function depend outcom iter similar initi reach object object start root call properti reach object appli object exist object reachabl root appli rst object root properti call properti exploit begin de nition properti instanc label invari transform merg definit instanc schema label base set class set instanc object exist root wf fog instanc properti appli object result show prove object instanc label reachabl root object lemma instanc schema label base set class set class constraint constraint schema object root class cl proof show induct length mean complet infer rule mean form distinguish case structur exist ob induct hypothesi end form def exist ob induct hypothesi end form assum end lemma instanc schema label base set class set root class cl proof show induct length trivial form induct hypothesi case investig case structur assum lem ob exist root fo instanc fo di erent assum fig fo contradict exist fig ob contradict scalar mean complet infer rule figur situat case write root instanc fog mention extens obtain construct counterexampl whichev root assum vista point featur captur properti properti invari transform merg definit instanc schema label base set class set instanc instanc root object wf root exist object wf fo prototyp counterexampl tree remov object creat link insert object miss attribut valu definit schema path function depend schema extens pp job schema label base set fcg construct step construct hpp job hpp job schema label base set fcg denot singl element complet infer rule step remov pp ob step pp pp pp ob ob ob step pp due step ob add wf ob built schema exam path function depend closur set remov object insert object attribut object path function depend element closur remov object object reachabl object construct schema sati es set ax axiom lemma schema path function depend schema instanc schema proof construct instanc schema lem replac object object lead violat axiom axiom construct ensur object remov element closur set corollari schema path function depend schema object wf wf prototyp counterexampl potenti sati es deriv path function depend path function depend construct lemma path function depend schema deriv set schema path function depend instanc schema std instanc schema complet infer rule cl fhg cl fjg cl fig cl fhg cl fhg cl fjg cl fig cl fhg cl fhg cl fjg cl fig cl fhg cl fig cl fhg figur construct exam complet infer rule proof instanc schema lem object insert construct loss assum insert exist object wf fo object introduc remov node edg addit miss link mar similar argument hold properti introduct object construct execut set start class object reachabl root object reachabl root object root de nition proof path function object cl cl kg cor exist root exist root root cl extens rand deriv simpl pre augment kg cor kg mean wp ng fk fk mean sati ed proof satisfi nx cor complet infer rule prototyp deal satisfact constraint basic idea insert object violat constraint insert entail gener violat path function cure remov object insert ad miss link determin set object reachabl root set mean identifi root set path lead object path set lead object remov path element set set calcul set nite start di erent class definit instanc schema label base set class set transform merg de ned outcom step arbitrari root de ne share figur set share def share fu wf wf object root newli insert reachabl wf reachabl wf de ne fp cl complet infer rule cl appli step remov object fug incid edg remain object class cl attribut due rst step ob remain object add wf design extens satisfi deriv path function depend input oper merg set construct determin object set root newli insert job appli set root yield object member set object reachabl root exam violat constraint insert extens violat path function depend deriv set constraint schema remedi violat remov object stipul object attribut object remov object oper merg leav object origin instanc untouch lemma instanc schema label base set set instanc schema construct process merg object object proof show root newli insert root extens def wf fr fig illustr result shown subsequ reason assum share de nition wf fvg exist wf distinct pre due de nition pre class cl complet infer rule fhg fjg fig fhg fgg fgg og ffg oe fe fig fgg fgg xg xh fhg xf ffg fe xe appli oper fhg fjg fig fhg oe fe fig xh fhg fe xe fgg fgg og ffg merg object figur appli oper merg fig complet infer rule wf wf figur object touch oper merg set root ad class class cl hold path function depend inherit due simpl pre entail ft sg wf violat path function wf wf wf fp contradict fact instanc form prototyp sati es deriv path function depend path function depend construct oper merg treat properti invari lemma path function depend schema instanc schema label base set fcg instanc instanc schema std instanc schema extens merg extens merg instanc std extens merg instanc proof show rst extens merg lem instanc object exist root wf fog complet infer rule object ad construct merg object introduc access object object exist root wf fog root end due cor impli wf fo wf fo object remov node edg addit miss link impair extens merg line argument prove properti proof construct process merg lead violat ax path function depend contradict pm path function depend deriv distinct object violat path function depend mg impli cor object newli insert instanc std lem object violat object newli ad distinct distinct uniqu situat depict fig root involv constraint gave rise introduct root constraint deriv proper constraint lem gave rise introduct root constraint gave rise introduct root mg extens constraint proper cl ran hold class cl exist uniqu cl fog fo consequ violat pm complet infer rule figur situat proof lem class deriv iter applic simpl pre augment merg distinct root wf fug wf fu loss gener root chosen construct merg share remov rst step construct merg contradict exist set path function depend hold assum de nition qp remov rst step construct merg step construct equal contradict path function depend violat violat proof lem construct process touch set object pair object violat violat merg show complet infer rule contraposit assum deriv path function depend set constraint schema construct instanc schema satisfi depend theorem infer rule path function depend schema exist instanc schema instanc schema proof schema path function depend proven lem instanc schema std instanc schema lem oper merg leav properti untouch merg instanc schema std satisfi path function depend due def lem deriv class constraint sati ed extens merg object gener constraint violat sati ed iter continu iter extens extens schema satisfi path function depend present class constraint path function depend prove sound complet minor restrict constraint lai foundat algorithm treatment implic class constraint path function depend decid implic open problem class constraint path function solv path function depend semant data model result work put comput design achiev de ning desir properti schema mean class constraint path function depend de ning transform produc schema desir properti refer refer joachim schema design achiev challeng intern confer inform system manag number lectur note comput page springerverlag joachim ralf torsten poll transform entityrelationship schema schema advanc inform moscow workshop page joachim ralf torsten sagiv decomposit relationship pivot bernhard intern confer conceptu number lectur note comput page joachim torsten poll decomposit class path function depend constraint thalheim foundat inform knowledg base volum lectur note comput page joachim torsten poll decomposit schema submit codd extend relat model captur mean acm transact decemb codd relat model version publish minoru ito grant implic problem function constraint support complex object journal comput system michael georg jame wu logic foundat objectori languag journal torsten poll repres relationship phd fb reiter equal domain closur journal refer bernhard thalheim foundat model annal mathemat arti cial grant theori function depend data model won deduct page elsevi scienc publish grant reason function depend gener semant data model acm transact march
Agents/176 1 bargain deadlin tuoma sandholm februari bargain deadlin tuoma sandholm depart comput scienc washington campu box brook drive st mo depart econom bristol woodland road bristol england februari abstract paper analyz autom distribut negoti agent firm deadlin privat inform agent make accept offer order continu time show sequenti equilibrium outcom agent wait point agent hold pure mix strategi materi base work support nation scienc foundat career award grant grant base work support epsrc award gr ration agent nontrivi split offer signal weak bargain power recipi accept offer offer offer offer oppon deadlin effect complet overrid time discount risk agent payoff chang discount factor risk attitud implic design negoti agent discuss present effect protocol implement equilibrium outcom domin strategi introduct multiag system autom negoti agent increasingli import due technolog push applic pull negoti market mechan auction competit pressur side agent reduc undesir strateg effect market mechan difficulti small number agent limit strateg preval negoti set softwar agent ubiquit schedul agent negoti meet time behalf applic agent negoti final price scenario agent repres depart bargain detail servic provid jointli negoti gener involv integr distribut bargain integr bargain agent search pareto effici deal deal exist make agent make integr bargain process make joint cake larg evalu pareto effici deal difficult combinatori complex set autom negoti agent hold arena due comput speed distribut focu agent negoti split surplu provid divid cake continuum split agent exchang call split agent nonneg benefit deal individu agent accept deal deal split gain optim contract individu ration model gener loss surplu provid contract normal agent payoff occur contract made normal distribut bargain studi process paper design softwar agent optim negoti user behalf distribut bargain design multiag system construct interact protocol determin legal action agent point time violat protocol made technic disallow bidder submit multipl bid illeg action penal regular legal system maxim global protocol design carefulli account agent action maxim util global good protocol provid incent agent protocol give agent action point negoti agent particip protocol design provid incent particip return question section famou model strateg bargain infinit horizon altern offer game uniqu solut agent split attract autom model weak infinit horizon assumpt realist result chang distribut number negoti round drawn finit support predict model specif exponenti time discount assumpt dollar infinit linear time fix bargain cost round result chang dramat mover surplu depend ratio fix cost agent assumpt perfect inform limit design agent negoti protocol agent privat inform altern offer model lead multipl includ true type reveal long length delai depend number type model blueprint design agent protocol question qualit outcom tool game theori mechan design studi type bargain inspir applic autom negoti game theori mechan design theori suitabl softwar agent human agent design act ration determin ration strategi complex comput agent suffer emot bound ration comput agent systemat human agent face firm deadlin bargain appeal assumpt practic perspect user easili understand deadlin trivial commun softwar agent agent deadlin privat disadvantag make offer except demand inform long stand good chanc bigger portion surplu offer offer offer offer oppon model real world autom replac tempor assumpt altern offer fix underli rubinstein protocol agent make accept offer continu time result time discret model resembl war game agent compet object game exhibit multipl equilibria object common symmetr equilibrium agent immedi symmetr equilibrium agent rate depend object studi gener class war game perfect inform studi case incomplet object game introduc biolog context appli industri econom model differ war agent split dollar expect enlarg set equilibria equilibrium outcom intuit turn show equilibrium outcom agreement delai deadlin agent entir surplu show exist sequenti equilibrium agent split time agent deadlin receiv surplu show exist equilibria agent split time posit neg result strong respect sequenti ration agent assum intuit equilibria agent updat belief agent motiv chang strategi point game agent chang strategi result robust wai exist mix strategi equilibrium agent rate deadlin contrast usual equilibrium analysi war game result hold agent discount time addit deadlin agent risk split deadlin risk agent safe gener offer prefer continu riski rest paper organ section describ formal model bargain deadlin section present main result equilibria section extend mix strategi section present result time discount agent risk attitud section describ entail insight design autom negoti agent section discuss implic design interact protocol section conclud model bargain deadlin bargain type agent deadlin type agent deadlin type privat agent type type drawn distribut independ drawn distribut common knowledg loss gener scale time axi histori list unaccept offer time action time describ threshold offer accept agent offer agent outstand assum agent improv offer time offer offer earlier agent belief updat rule agent strategi game pure strategi agent determinist map histori defin offer agent accept make function offer agent made mix strategi agent probabl mixtur pure agent throw dice front pure strategi agent split payoff agreement time agent payoff agent agreement place deadlin assum agent strictli prefer hand surplu miss deadlin payoff defin wai smith defin payoff term aspir accept threshold turn suffici result paper express payoff term tradit state term prefer final agreement agent payoff give surplu agent standard solut concept model ration agent plai equilibrium sequenti equilibrium equilibrium inform inform agent updat belief base strategi observ histori rule sequenti equilibrium refin equilibrium place requir agent act ration probabl inform set intuit agent threat credibl sequenti equilibrium equilibrium exist sequenc consist belief fulli belief attach posit probabl inform converg pure strategi equilibria turn plai game ration agent proposit exist sequenti equilibrium agent latest deadlin receiv surplu earlier deadlin proof demand time accept offer time reject offer updat belief put weight posterior distribut valu interv time reject offer updat belief prior posterior simpli equal prior prior add point updat rule result hold assumpt addit set equilibria agent miss deadlin probabl show belief ffl assign probabl ffl posterior probabl ffl rest support ffl fulli mix strategi pair converg belief gener fulli mix strategi pair converg belief easi action sequenti ration equilibrium path agent demand full surplu agreement achiev deadlin agent deadlin receiv surplu equilibrium equilibrium begin time onward stage game agent move wait agent properti proof main result state plai game ration prove imposs result sequenti equilibrium prove stronger claim equilibrium weaker definit equilibrium sequenti equilibrium exist pedagog reason present result pure strategi gener mix strategi section theorem exist pure strategi equilibrium agent split proof exist type pure strategi equilibrium agent split time loss agent receiv write ffl denot agent belief time denot agent belief time denot cumul distribut cumul distribut agent accept expect receiv move wait game expect payoff wait game simpli agent subject probabl agent accept ffl agent high rewritten agent accept offer give expect payoff larg wait equal subject probabl win wait game case agent win wait game probabl split occur equilibrium case occur agent fact updat belief agent deadlin base updat agent accept ffl agent high rewritten agent accept expect payoff larg wait equal subject probabl win wait game case agent win wait game probabl split occur case occur agent fact updat belief agent deadlin ffl base updat agent accept ffl process belief updat accept threshold reset continu altern agent round type elimin satisfi process continu unlimit number upper bound approach equilibrium exist contradict mix strategi equilibria strengthen imposs result show hold mix strategi ration plai game random differ set war game mix strategi plai import typic uniqu symmetr equilibrium concess rate mix strategi theorem exist mix strategi equilibrium agent split posit probabl proof exist type mix strategi equilibrium posit probabl agreement exist point posit probabl agreement analyz equilibrium time recal fi proof agent accept agreement share accept threshold threshold depend type analyz mix strategi threshold depend random randomli chosen time probabl densiti function agent accept agreement offer share agent offer threshold chosen time probabl densiti function loss assum posit probabl agreement made rang impli posit probabl smallest support infimum assumpt posit probabl agreement mean ffl ffl strategi support give agent payoff wait game mean wait strategi support give agent payoff wait game case agent win wait game probabl split occur equilibrium case occur agent fact updat belief agent base updat support includ ffl agent high written strategi support give agent payoff wait equal subject probabl win wait game case agent win wait game probabl split occur case occur agent fact updat belief agent ffl base updat rule high valu agent wait process belief updat accept threshold reset continu altern agent round type elimin satisfi process continu unlimit number upper bound approach equilibrium exist contradict incorpor discount time discount standard model set good due inflat due previou section assum agent discount time show result robust case agent discount time addit firm deadlin ffi discount factor agent ffi discount factor agent util agent agreement receiv share time ffi denot ffi ffi bargain game ffi ffi common knowledg prove previou result hold larg rang paramet ffi ffi bargain power agent chang discount contrast result bargain game deadlin effect complet suppress discount effect crisp result import design autom negoti motiv studi model proposit ffi ffi ffi ffi exist sequenti equilibrium ffi ffi agent latest deadlin receiv surplu earlier deadlin proof equilibrium strategi proof sequenti equilibrium ident proof proposit differ threshold longer ffi posterior defin ffi theorem ffi ffi exist equilibrium ffi ffi pure mix agent split proof prove case pure strategi equilibrium extens mix strategi equilibrium ident theorem proof variant proof theorem notat exist type pure strategi equilibrium agent split total surplu time proport time loss agent receiv write ffl agent accept expect receiv move wait game expect payoff wait game agent subject probabl multipli discount win agent accept ffi ffi ffi divid side ffi ffl ffi ffi ffi ff ffi agent updat belief agent deadlin equat differ ffi assumpt ffi ffi base updat agent accept ffi ffi ffi divid side ffi updat rule type agent ffi belief updat agent yield ffi ffi ffi base updat agent accept ffi ffi ffi divid ffi updat rule ffi process belief updat accept threshold reset continu altern agent round type elimin satisfi process continu unlimit number upper bound approach equilibrium exist contradict annual interest rate discount factor ffi year condit theorem agent discount factor ffi unit time deadlin drawn shorter year deadlin bargain situat shorter deadlin theorem show ration strategi effect deadlin suppress discount factor commonli true autom negoti fast negoti oper make level strateg negoti robust risk attitud gener result agent necessarili risk neutral bargain game equilibrium split surplu depend agent risk attitud show happen set risk agent gener prefer smaller safe share riski option wait game expect win high probabl show effect theorem present domin concess consist risk agent risk attitud captur util loss gener agent proposit exist sequenti equilibrium agent latest deadlin receiv surplu earlier deadlin proof equilibrium strategi proof sequenti equilibrium ident proof proposit differ threshold longer definit state main result case risk attitud definit maximum risk agent ae max show imposs result appli larg rang risk attitud theorem ae ae exist equilibrium agent split proof prove case pure strategi equilibrium extens mix strategi ident theorem notat theorem exist type pure strategi equilibrium agent split time loss agent receiv write ffl agent accept expect receiv move wait game expect payoff wait game agent subject probabl agent accept ae agent updat belief agent deadlin equat differ ae ae base updat agent accept ae updat rule type agent ae belief updat agent yield ae ae ae ae base updat agent accept ae updat rule ae process belief updat accept threshold reset continu altern agent round type elimin satisfi process continu unlimit number upper bound approach equilibrium exist contradict design bargain agent motiv studi bargain deadlin stem desir construct softwar agent optim negoti behalf real world parti repres put experienc poor human negoti equal save human negoti effort deadlin wide advoc autom electron commerc captur time prefer user deleg find airlin flight user hour complet user easili understand simpl deadlin agent result show distribut bargain set agent ration agent make accept offer ration softwar agent receiv offer mean parti exploit argument proof appli ration softwar agent accept matter good exploit agent oppon model model parti game theori give prescript ration silent exploit classic motiv autom negoti agent negoti faster distribut bargain set agent argument hold ration softwar agent deadlin reach implement perspect suggest daemon trigger deadlin agent comput deadlin result suggest user stronger bargain posit input time prefer agent term time discount function discount facilit softwar agent vendor provid user interfac agent easi specif time discount function input deadlin design bargain protocol mechan domin equilibrium deadlin bargain game agent report protocol assign dollar agent highest place time earlier report deadlin domin strategi mechan report agent probabl win reduc report agent probabl case miss deadlin report domin strategi mechan effici wai minim equilibria base refin nash sequenti agent strategi depend requir specul specul agent ad domin strategi mechan agent strategi optim matter agent wast time intract easier program agent execut domin strategi agent domin strategi mechan robust irrat agent action affect behav mechan minim agent send messag mechan pareto effici time agreement delai origin bargain game mechan result agreement pareto protocol forc split front protocol effici respect discuss good solut problem imposs result agent applic protocol agent type protocol select problem assum type distribut assum simplic present crucial agent deadlin particip protocol expect bargain set agent deadlin agent deadlin particip agent deadlin agent particip argument reli split select problem affect protocol implement nash equilibrium outcom autom agent suggest facilit increasingli effici negoti set bargain set individu ration pareto effici difficult construct due combinatori number deal comput complex evalu deal comput speed autom agent significantli enhanc negoti addit effici stem fact comput agent negoti larg number agent quickli virtual negoti overhead paper show negoti optim deal bargain set identifi distribut profit agent power stem abil wait show bargain sequenti equilibrium agent wait deadlin reach line human experi ad deadlin introduc delai reach agreement show deadlin effect complet suppress time discount effect imposs interim agreement appli type risk attitud agent result show deadlin bargain set trivial design optim simpli wait reach deadlin parti user give agent time discount function deadlin deadlin put agent weak bargain posit discuss mechan present effect protocol implement outcom bargain game domin strategi equilibrium refer sequenti bargain incomplet inform review econom studi competit patent race european econom review model bargain incomplet inform model bargain cambridg press war discret time technic state stoni brook war continu time complet inform intern econom review multiag negoti time constraint artifici intellig reput imperfect inform journal econom theori theori oxford press bargain market academ strong evolutionari equilibrium war journal theoret biologi rule design convent autom negoti comput mit press deadlin effect evid american econom review perfect equilibrium bargain model econometrica bargain model incomplet inform time prefer econometrica coalit bound agent artifici intellig special issu econom principl multiag system earli version intern joint confer artifici page implement contract net protocol base margin cost calcul nation confer artifici intellig theori game evolut anim conflict journal theoret biologi
DB/177 3 flatten object algebra provid perform peter wilschut ffi martin kersten ffi twent ae netherland amsterdam sj netherland abstract algebra transform optim techniqu method choic relat queri appli oodbm difficult due complex queri languag paper demonstr problem simplifi map complex storag model flat binari model implement kernel present gener map scheme flatten data model studi case straightforward model show flatten enabl implement queri algebra limit set simpl oper requir primit queri execut strategi perform evalu show approach yield excel result introduct relat technolog grown industri attent research commun shift effici support object system applic rich model facil offer object system model applic specif data relat dbm typic translat sql queri relat subsequ optim effici physic algebra program algebra optim proven power tool process research commun idea implement object queri languag lot research complex area translat languag algebra area optim number algebra object data model implement algebra difficult due combin larg number oper complex storag model effici implement algebra report larg kei idea work implement simpl flat binari model support complex object requir transform object queri languag binari tabl approach impli maintain perman map object data model physic model contribut paper show map limit number execut primit primit achiev good perform flatten object algebra concept map complex object data model physic data model bring back benefit data hard sought oodbm physic layer provid implement fulli binari relat model algebra section introduc formal map data model flat binari world monet process illustr object algebra design intermedi languag object calculu oql execut attempt explor oodbm formal standard queri algebra standard object deriv concept elabor algebra provid perform practic result work paper system translat queri monet script translat monet backend execut complex oo queri high perform demonstr perform pose complex volumin oo queri benchmark exist benchmark measur navig perform oo queri part benchmark trivial benchmark complex term join aggreg complex oo benchmark popul chose benchmark queri consist complex combin aggreg relat support run scale factor size numer dbm olap system vendor publish result slightli adapt fit context schema reformul nest schema figur groupbi sql promin present neatli map oo concept nest aggreg focu queri queri part updat queri sql vertic fragment cornerston monet compli benchmark implement rule intend present result benchmark queri gb serv illustr perform system compar perform figur implement provid reader context outlin paper organ remaind paper section describ featur monet kernel section discuss object data map binari monet data model attent paid formal foundat map section describ monet execut algebra translat section outlin implement techniqu execut algebra section analyz experi result section summar conclud paper monet monet extens parallel kernel develop uva cwi monet achiev success data mine support gi data oo design monet base trend hardwar main memori hundr megabyt custom cpu perform mip magnet storag bigger mean io increasingli barrier process standard pc hardwar multipl share memori parallel present softwar evolut oper system function make part oper system function access custom applic promin research prototyp commerci system silicon graphic irix sun solari increasingli provid hook memori process manag dutch cwi cooper research studi object technolog context geograph applic result area report incorpor datatyp gi data multimedia type audio led steep data volum tupl grow percentag io queri access small standard data type design system process hardwar trend work concentr find data storag method role io bear idea appli design main memori queri execut monet primit oper work assumpt fit buffer monet algebra oper direct access tabl data main memori monet make gradual transit io domin process achiev transpar memori map file monet avoid introduc code improv replac oper system facil manag give advic lower level buffer manag strategi job hardwar featur control algebra part queri addit advantag base complet knowledg storag model monet implement binari relat data data store binari associ tabl figur structur data narrow tabl fragment reduc chunk size fit memori save lot io monet access attribut queri extens monet system extens algebra command oper ad base type ad adt extens mechan similar postgr gral augment collect standard tempor data extens complet set common gi type written search ad monet base type index effici standard index monet extens mechan ad index parallel monet support parallel parallel iter parallel block execut parallel protocol primit preserv effici dynam optim queri engin perform dynam optim simplifi work queri robust environ queri optim decid primit execut monet decid altern implement effici moment data model object orient type system concept base type structur primit class definit defin structur map physic storag dbm object orient model typic rich hierarchi structur class primit concept arrai intern structur base type hand access access oper base type effici implement program support insid queri engin special search grow consensu oo research collect base type search extens design choic implement entiti atom structur exampl data entiti typic model base type line polygon spatial imag sound data multimedia applic logic data model data model similar structur object data model accept atom type monet base type monet extend atom automat base type extens base type combin orthogon structur primit tupl formal section form collect set type object instanc figur show model schema illustr structur object type defin tupl type denot set type fg class part string string string string integ string float class custom string string string float nation string order class nation string region region class supplier string string string float nation part float suppli class order char float instant string string string class item part order integ char char float float float instant instant instant string string class region string string comment figur data model monet physic binari model monet store data binari associ tabl figur show design bat structur left column bat refer column tail due design bat view normal form mirror head tail column swap mirror descriptor normal descriptor offset byte martin peter mirror tail head binari unit martin peter heap heap tail heap bat descriptor figur binari associ tabl memori layout bat heap heap atom call binari unit ensur storag data atom variabl size string polygon head tail extra heap integ persist search instanc hash tabl store separ head tail flatten object data model implement data model map structur primit physic implement map logic physic model map data enabl dbm physic logic extra optim possibl queri execut case full vertic decomposit store structur data bat combin bat store valu structur function bat form structur set supplier object tupl set figur map supplier tabl bat figur show decomposit supplier class bat bat supplier valu attribut supplier object bat store attribut valu oid head attribut valu tail supplier signatur bat supplier oid exist call extent bat attribut suppli bat supplier suppli map supplier oid attribut valu suppli set store bat structur express describ supplier object bat structur type system reflect structur function structur express form rigor framework implement algebra essenti formal semant structur function tupl formal semant map defin map structur defin tupl valu set valu identifi set set pair identifi id uniqu id id duplic valu occur identifi set identifi set concept synchron set identifi set synchron pair pair identifi correspond vice versa defin semant structur function ffl bat type repres identifi set ffl bat oid type refer object class repres identifi object set oid ffl sn mutual synchron identifi structur function sn defin hv ij ffl object structur function ident tupl structur function id tupl gener object identifi ffl bat id set structur function defin set fv id id id serv index set element match denot empti set valu ffl bat structur function defin fv optim previou store case set element simpl base type object structur function identifi set operand result identifi gener complex structur data relationship structur data model structur function map impli data type express repres set bat composit structur function remaind paper symbol denot composit structur function queri execut aim support declar object queri languag iql preparatori translat declar object queri languag object studi extens implement idea develop section describ queri design intermedi languag context paper sourc languag monet interpret languag target languag queri algebra queri algebra standard object algebra oper aggreg oper access attribut tupl support oper atom type method invoc object descript similar algebra found version queri displai flavor algebra queri analyz qualiti work clerk combin select item sold return flag indic back defect comput revenu lost return sum loss year group loss year nest result queri project set tupl monet execut algebra monet interfac languag consist basic set collect control structur oper materi result chang operand mil command inform semant cd cg ab cd cd cg ab ab lg ab uniqu bd ab cd cd bd uniqu xy xy xg sa figur bat primit execut oo queri primit suffici execut major construct monet bat algebra primit fix semant expect column paramet mirror command flip head tail oper free cost semijoin oper heavili vertic partit fragment section elabor effici implement note equal join project join order oper close binari model uniqu produc result remov duplic operand oper valu aggreg oper bat part omit group group oper introduc oid uniqu occur valu bat column uniqu function return oid uniqu oper implement sql groupbi nest group attribut unari version group multipl binari group invoc till attribut process illustr figur group occur object interest year group oper assign kei result bat method invoc multiplex constructor bulk applic algebra oper tail valu bat multipl bat paramet case algebra oper appli combin tail valu natur join head valu oper vector comput invoc method figur express vector success oper aggreg constructor bulk aggreg defin aggreg function map set version fy group head bat calcul form set tail valu aggreg result execut nest aggreg iter call function nest collect set tupl group oper semijoin similar join group join select join select semijoin semijoin semijoin semijoin uniqu uniqu join join mirror multiplex oper aggreg oper mil comput phase mil select phase structur function figur queri mil tree mil transform idea algebra implement translat queri structur operand structur queri result figur illustr queri express structur express translat mil program operand bat gener result turn operand structur express repres result implement assum execut structur data store bat xn structur function sx sx xn implement oper consist result bat ym structur function ym xn structur function data structur data function structur function structur structur binari tabl binari tabl physic mil algebra logic algebra figur queri execut translat mil oper mil structur function formal prove correct implement mil detail discuss issu scope paper correct implement implement grai path figur yield result oper transform rule translat oper mil program structur function gener implement consist straightforward term rewrit show simplic transform rule select syntax select evalu set boolean oper element semant select express transform rule select select oper oper translat operand syntact correct select express form set index identifi set translat select predic operand select predic boolean function translat transform rule bat id qualifi valu set gener semijoin oper attribut structur attribut occur supplier class benchmark assum set part equal queri express queri select attribut suppli transform rule select attribut ident rule select singl set operand section interpret identifi set set transform express result correct identifi set reduc set valu benefici effect store nest set flatten execut repeat select nest work select flatten similar effici translat made nest intersect monet implement section describ aspect monet implement heavili implement properti manag monet kernel gener multipl implement algebra oper semijoin assum join column bat order variant knowledg join column equal return copi left operand bat philosophi monet algebra command addit dynam optim step execut depend state state choic algorithm made monet track properti perman intermedi bat focu bat properti maintain kernel column exampl head column store ascend order head column bat duplic element bat correspond posit common case head column bat ident properti activ guard kernel updat switch mil command propag rule propag properti paramet result semijoin propag kei properti head tail left operand propag order inform head tail result olap queri found typic consist ffl select interest subset ffl comput express aggreg attribut select object place call trend observ queri figur main algorithm sort tabl binari search select tend work sequenti access pattern support os virtual memori pager select prefer attribut bat order attribut order binari search select comput aggreg select semijoin bat made select observ multipl semijoin semijoin select oid attribut bat lead conflict requir sort requir sort oid attribut role select queri solut explor store attribut order favor access valu oid join attribut path opposit oid valu tackl fulli vector tabl vector oid vector attribut store oid order easili repres monet unari bat note map object gave unari vector extent bat section discuss sync kernel properti section monet ensur vector correspond posit origin bat sort refer mean monet search extens dub achiev fulli vector storag extent bat supplement invert list index attribut bat unari bat contradict bat type void column peter martin amsterdam ed ed amsterdam vector martin sort project sort element extent correspond vector bat sync posit peter peter martin martin peter extent vector project object set post pre ed amsterdam figur creation project sort semijoin presenc operand lead join presenc influenc execut strategi oper import oper context instrument phase olap queri introduc displai pseudo procedur begin oid int int idx lookup foral bat fi od fi bat foral int po return end left operand bat extent read displai simpl arrai time operand lookup perform element extent extent lookup implement effici binari search arrai index save lookup arrai subsequ semijoin lookup effort insert phase walk lookup fetch match head tail valu extent vector io cost model monet benefit full vertic fragment narrow face extra semijoin recombin fragment section result perform small perform cost monet approach compar relat approach semijoin pose perform problem main focu io bound situat assum cold memori map access page fault interest expect number disk page retriev virtual memori page select select project attribut tabl tabl row byte uniform byte width rel sx rel rel expect number disk block fetch relat strategi tabl store decomposit compon io cost discov tupl particip select effici case assum implement arrai record number tupl page inv compon model retriev multipl number page probabl row page select number row page rel dv sx bat express cost monet approach compon repres select bat data bat sort fact invert list attribut compon formula repres semijoin request attribut valu lookup extent perform semijoin count semijoin factor number page bat bat number valu page dv select figur io cost select relat approach figur displai project cost paramet deriv item tabl fat line show model relat storag case thin line show monet case valu show monet semijoin strategi gener effici relat low valu crossov point experi program gener ascii file load monet bulk load hour util correctli set properti sync gener bat creat project tail column tabl sort oid cheap creat make project tail column attribut bat creat extent half hour order effici execut select join attribut reorder tabl tail valu addit hour occupi data gb base version queri fed translat time execut sequenc monet backend figur show absolut perform result provid includ stat number page select main tabl million total size intermedi maximum memori consumpt queri execut hardwar hardwar platform sun run solari machin intern seagat disk ms access root file system swap store data number benchmark offici ibm obtain mz pc run window nt configur scsi xp disk ms access platform total memori note ibm time power hardwar monet total max item page qx fault comment bill aggreg tabl na cheapest part supplier region find valuabl order prioriti custom satisfact revenu local supplier benefit discount ship good nation part market share chang region line part profit year nation custom problemat part na stock nation cheap ship affect critic order loss due return order clerk market chang campaign date identifi top supplier load ascii import creation geometr queri hour rate figur result analysi side monet queri io cost model show monet rel disadvantag low select valu small result obtain effect lag perform queri queri size queri select million line item algebra buffer manag start save intermedi result disk make room main memori test run explicit buffer manag system excess swap show viabil approach includ os buffer manag algebra alter queri transform note monet polici materi intermedi result disadvantag detail perform trace discuss monet perform figur show execut result simplifi version translat mil mil statement ms fault order item return year class index year price discount factor loss loss figur detail monet execut result queri start select order order clerk effici binari search result store oper page fault return order join item line item order implement line semijoin semijoin item sort attach select element cheap join sort oid line group class year order determin note multiplex oper extract year set date semijoin previou blaze trail extent cost cost fetch valu repeat line multiplex oper follow execut monet kernel bat sync stem semijoin match small relat sync result queri bat structur function activ properti monet kernel enabl successfulli effici implement winner tpcd queri reduc cost multipl semijoin half due intellig semijoin monet avoid punish full vertic reap benefit io thin tabl futur research larg scale experi report demonstr progress kei area modern manag experi demonstr convincingli dbm kernel base binari associ strong bia exploit algorithm scale accommod support benchmark map binari relat platform transform rule achiev prove correct result mark progress develop extens applic wide varieti applic scenario interfac integr work object languag bind method invoc algebra context structur buffer manag oper omit full mil script monet web page benefit run repeat cost line includ research goal monet includ scale kernel technolog exploit parallel experi project implement extend gener heterogen parallel mil program refer abiteboul ident queri languag build system stori delobel san naughton sigmod confer manag perform support oo british nation confer quak geograph edbt franc carei object decad intern confer larg data septemb object morgan kaufmann san languag intern algebra sigmod confer manag june cluet gener framework optim intern confer manag san june copeland decomposit storag intern confer manag queri fegara algebra physic oodb workshop program evalu calculu algebra british nation confer extens relat system geometr fifteenth intern confer larg data aug spatial data rose vldb journal kersten perspect data proc knowledg discoveri data model workshop program algebra ogi oregon graduat institut scienc de join queri twentieth intern confer larg data sept de queri effici set edbt franc row implement ieee transact knowledg data engin benchmark transact process perform evalu sigmod confer manag san
AI/178 2 implement model anim behavior robot system khale ali ronald arkin mobil robot laboratori colleg comput georgia institut technolog usa abstract formal model anim sensorimotor behavior provid effect method gener robot intellig paper describ model prai implement robot equip color vision system model implement base develop studi implement incorpor wide rang includ obstacl prei predat behavior introduct ecolog robot refer incorpor aspect relationship robot maintain environ control system mean develop control system exploit model behavior develop research conduct model neural control base anim model incorpor interact studi robot commun work undertaken artifici life arena work conduct simul primit robot implement paper expand earlier simul studi report report result obtain implement model prai behavior robot equip vision system work model gener anim scientist hope result robot commun term provid path gener intellig behavior serv basi feedback refin anim model approach prai behavior schema theori power express mean describ robot schema distribut concurr charg enact intern behavior goal intent agent extern stimuli output process combin host wai arbitr behavior fusion research focuss etholog model behavior prai creatur figur encompass wide rang behavior rang activ implement subset behavior includ simpl locomot incorpor obstacl prei acquisit predat avoid behavior agent search hospit case low brush bush young tree older current model incorpor motiv variabl affect select motiv behavior predat avoid prei acquisit mate figur prai behavior variabl model simpli section intend extend incorpor factor climat cycl factor simplifi depict figur serv basi implement paper deriv model prai behavior develop model make weak commit mechan inhibit fig arbitr prei predat mate architectur strategi arbitr winner motiv obstacl output behavior encod form repres forward motion percentag maximum forward repres turn motion percentag maximum turn speed neg percentag repres turn implement version vision stimuli set motiv behavior obstacl avoid trigger whisker robot implement model prai behavior implement robot miguel miguel herm ii robot manufactur robot color camera mount feed live video newton research lab vision system miguel whisker mount front serv contact infrar proxim sensor contact sensor portion model correspond shown left side figur implement vision processor respond system respond color green object repres purpl object repres orang object tall wide repres orang object repres prei figur show algorithm run vision processor robot maintain intern variabl repres robot valu variabl hunger level fear hunger action select detect prei detect predat detect mate detect hide place architectur arbitr run vision board run robot architectur detect obstacl action figur model implement miguel incorpor aspect arbitr architectur suppress interact modul base model prai behavior develop ps prei prei acquisit ps pred predat avoid ps mate mate pair ps mo move object ps figur model prai behavior develop linearli hunger rate robot contact prei robot consid eaten mate relev variabl reset contact determin posit prei mate blob imag captur camera front robot object consid contact bottom object blob lower percent imag fear level remain predat visibl fear variabl set predetermin high predat longer fear level reset incorpor complex includ habitu remain futur work behavior produc direct move robot largest visibl base input perceptu schema behavior output direct move robot largest mate largest base input perceptu schema behavior output stop command schema predat visibl output output behavior discret direct command forward forward stop valu intern variabl visibl stimuli action select modul select action send robot processor motiv variabl greatest current chosen stimulu prei hunger output behavior robot stimulu process repeat motiv variabl greatest stimulu visibl motiv output behavior robot action select mechan send command robot predetermin hierarchi action chosen depend directli motiv variabl visibl stimuli moment time current valu motiv variabl fear visibl action select modul send output behavior robot hunger variabl greatest prei visibl motiv variabl mate visibl output behavior variabl greatest motiv visibl stimuli remain part shown side figur architectur level part model run processor herm ii level contribut determin behavior robot agent output behavior overrid output behavior output behavior replac output behavior predefin amount time lowest level behavior behavior direct robot move forward search stimuli stimulu visibl action select modul left side figur produc output output translat direct stop command spin speed command robot builtin walk behavior understand command subsum output behavior stimulu visibl action select modul continu produc output repeatedli subsum output behavior robot back step turn side obstacl detect contact whisker behavior gener suppress output lower behavior model shown figur implement increment behavior creat behavior ad prei track behavior develop work predat mate track track behavior ad increment set fear hunger hunger increment hunger fast predat fear set fear high level fear reset fear predat visibl check mate prei close eat mate reset mate prei hunger reset hunger eat behavior produc direct stop base input perceptu schema blob output forward blob output blob output forward blob output blob imag output predat output output output pass robot stimulu motiv variabl greatest output direct behavior stimulu motiv variabl greatest output direct behavior stimulu motiv variabl greatest output direct behavior output direct figur algorithm architectur run vision processor robot result test perform implement miguel wander respond color box repres execut level predat miguel prei mate visibl miguel prei move hunger faster miguel eaten long hunger level static level fear set predat visibl predat prei robot move prei predat sight true robot mate long time descript execut shown figur robot mate view miguel remain green box repres predat view pictur predat remov miguel began walk prei pictur fourth miguel closer head repres orang box foreground contact prei whisker behavior robot back shown sixth pictur put prei mate view hunger level reset contact miguel turn mate seventh move contact shown pictur mate predat view miguel run tether pictur robot vision comput perform miguel behavior advanc increment execut sequenc depict figur show miguel behavior earlier stage develop time execut figur miguel prei track behavior figur show miguel orang repres move figur show miguel run respond prei predat environ part sequenc shown figur miguel repres orang move repres green introduc robot field view miguel stop remain predat remov miguel resum movement prei trial conduct miguel predat prei robot stop left view long hunger level greater fear level robot start move prei test conduct predat similar result stimulu robot move forward robot contact obstacl back turn walk forward respond present view environ robot retain previou locat stimuli robot abandon prei mate acquir robot move prei contact back move prei visibl anymor robot abandon attempt acquir prei summari present partial implement etholog model prai robot incorpor visual guid motiv behavior prei predat avoid integr obstacl avoid behavior result earlier demonstr simul shown field effort demonstr feasibl import model biolog commun robot show activ lead interest robot perform hope result futur research biolog commun lead iter refin model present acknowledg research support nation scienc foundat grant author francisco involv project figur sequenc pictur depict miguel action execut sequenc proce left miguel stationari box repres predat pictur predat miguel move orang box repres prei contact move purpl box repres mate detail execut sequenc text figur sequenc pictur show miguel prei move sequenc proce left prei repres orang box video monitor show broadcast result miguel visual process note bottom photograph region size miguel approach prei object figur sequenc show miguel prei react predat sequenc proce left pictur miguel move prei move prei repres orang box predat alongsid prei miguel view tall green box repres predat miguel stop sixth miguel remain predat remov miguel robot resum move prei refer handbook brain theori neural ed mit pp mobil robot intern journal robot vol august pp neural function schema implic result robot biolog neural network ed mckenna pp approach intellig model ed rc world intellig adapt experi comput academ robust layer control system mobil ieee journal robot vol pp theori common languag studi coordin robot ed plenum pp schema theoret approach studi behavior prai proc workshop neural architectur distribut schema assemblag neural octob coloni architectur artifici technic report mit ai august artifici mit artifici life autonom softwar agent home proc autonom agent marina del formal model comput ieee tran robot vol june pp dynam action proc eleventh intern joint conf artifici intellig pp rat model robot spatial proc int conf simul adapt pp
DB/179 3 intern confer conceptu model novemb vol pp real deduct languag mengchi liu min guo depart comput regina canada abstract rol strongli type deduct languag integr import featur deduct structur objectori languag describ extens rol call import featur rol incorpor import behavior featur method encapsul real deduct objectori languag support object complex class multipl structur behavior inherit overrid block introduct past number deduct languag iql datalog meth rock roll rol structur objectori import behavior featur method encapsul common gemston iri objectstor properli support rol support encapsul method datalog meth datalog method defin rule encapsul method perform deduct updat signatur defin semant indirectli translat method rule datalog rule method support signatur defin semant involv method perform updat encapsul inherit deduct languag structur behavior simpli provid kind incompat declar languag deduct imper languag data definit complex task queri languag coral augment express access attribut invok rule mengchi liu min guo imper program languag augment type construct rock roll offer imper program languag rock languag roll unlik rock roll base singl underli data model offer incompat languag suffer mismatch lack semant gener method perform deduct updat encapsul method discuss inform spirit datalog fact rule action predic ldl specif object encapsul proper syntax semant framework defin transact model structur aspect transact logic model behavior aspect method updat support encapsul reason clear separ notion schema instanc describ extens rol call import featur rol incorpor import behavior featur method encapsul real deduct languag support object complex class multipl structur behavior inherit overrid block paper organ section schema class definit section discuss class hierarchi multipl inherit overrid block section describ object creation section discuss queri updat section conclud paper schema schema set class definit class describ structur behavior set object structur part class set attribut definit default valu behavior part class set method defin rule describ attribut definit default class definit class languag center object object share common structur behavior properti classifi class class denot collect specifi attribut oper applic object object collect denot class instanc class kind class oid functor class set class exampl real deduct languag class oid class part functor class set class note support subrang integ real string collect class denot fix collect oid functor class denot user collect set class denot depend collect compon class denot support class object denot object instanc attribut definit attribut applic instanc class defin class gender parent declar attribut parent partial map oid class person class string set class bob instanc person specifi bob attribut wrt attribut definit longer map attribut valu object unknown attribut partial map default valu common softwar system provid default system oracl user give default valu deduct languag datalog support default valu syntax similar default valu gender attribut gender default valu attribut valu overrid default valu support partial complet set term provid attribut valu attribut phd phd mengchi liu min guo partial set phd faculti member partial partial addit faculti member give fulli complet overrid default complet set phd faculti phd faculti attribut overrid default method object queri manipul method method rule attach specif class appli object class method signatur implement signatur method specifi class attach class argument method class result return signatur declar method ancestor class result return unari method marri return valu note attribut definit differ method signatur method implement rule form object express exampl method implement ancestor marri class hci hp hai hai delet delet insert insert specifi calcul person ag birth year specifi find person children partial set term hci rule specifi find person ancestor parent rule specifi marri coupl divorc specifi person note rule updat command insert delet rule encapsul class definit explicitli variabl rule rule simplifi rule variabl real deduct languag hci hai parent hai parent hp delet delet insert insert reserv variabl variabl begin object express omit rule method overload program languag support method overload method method signatur class method method children method unari hci hci class definit base class attribut default method signatur implement encapsul inform class definit class person discuss declar insert command insert gender note creat class insert command creat complet class class hierarchi inherit organ class class hierarchi builtin class object top bottom direct definit advantag multipl structur behavior inherit subclass inherit attribut default method direct superclass introduc addit attribut default method instanc subclass instanc superclass mengchi liu min guo class isa person salari salari delet salari insert salari subclass person inherit attribut default method person attribut definit default method instanc instanc person direct subclass omit object class definit class person defin wai person isa person inherit overrid block subclass overrid block attribut default method inherit superclass class patient alcohol isa patient patient treat physician smith default physician smith physician time class definit ad class definit alcohol patient treat psychologist psychologist physician subclass alcohol introduc definit attribut overrid attribut definit default inherit patient show overrid default valu overrid attribut definit student isa gender insert delet subclass student inherit attribut default valu method person attribut default valu gender overrid inherit method drop real deduct languag show block attribut method inherit superclass bachelor isa class block inherit attribut method signatur person bachelor support method method class argument block attribut definit default valu bound term inherit subclass inherit attribut definit inherit default attribut class attribut definit overridden default block multipl inherit support multipl inherit subclass direct subclass superclass inherit conflict happen class student room isa student subclass student inherit attribut method student conflict attribut room wai conflict resolut prioriti default prioriti overrid inherit path select explicit renam prioriti order superclass class definit superclass attribut definit default valu method signatur directli defin found class list inherit continu previou automat inherit attribut room student inherit default room student superclass method inherit subclass method overload overrid support inherit conflict resolv overrid mengchi liu min guo continu previou class inherit attribut definit default room student chang order repeat definit student overrid inherit isa student room room approach break connect attribut room student attribut room attribut definit default room student reflect altern inherit path select subclass inherit attribut default method superclass prioriti overrid meet demand discuss earlier solv user inherit path overrid prioriti keyword continu previou student method incom signatur implement inherit attribut room method incom student class class isa student note class inherit attribut definit default room student method incom overload method inherit definit explicit renam altern avoid conflict renam conflict attribut method inherit continu work student student previou altern disallow possibl explicit renam isa student room attribut student inherit conflict object creation user creat object assign attribut valu insert command unlik oid object real deduct languag creat user system direct instanc class uniqu object creation insert person tom insert tom insert person pam command creat oid object tom direct instanc person tom instanc oper fail assign attribut tom attribut assign check respect class definit respect class assign object command creat oid object pam assign attribut set object direct class attribut valu person tom person pam ann jim salari bob parent salari student sam parent pat parent salari joe parent liz parent queri queri queri command kind queri schema queri object queri describ exampl previou section schema queri schema queri retriev inform class schema queri roughli classifi class attribut definit default method queri class queri kind queri queri class subclass relationship queri isa object queri isa object queri isa queri isa isa person queri direct subclass class object subclass user defin class direct superclass answer student mengchi liu min guo subclass person answer attribut definit queri kind queri retriev directli defin inherit attribut definit class queri person queri person queri bachelor queri person queri class person attribut anonym variabl answer base class definit attribut definit person class bachelor attribut answer inherit block class attribut defin person default queri support default attribut valu queri default queri person queri queri person queri isa person queri class person default attribut answer base class definit class default attribut answer student base class definit default attribut class person default attribut direct subclass person method queri method queri queri method signatur method implement method queri queri method signatur queri method implement method queri person queri person queri person queri student method signatur queri class result method ag return method signatur queri method person class result real deduct languag method implement queri implement method ag person enrol student object queri object queri retriev inform object manipul object method invoc object queri roughli classifi object class object attribut method invoc object class queri kind queri class inform object queri person bob queri bob queri bob queri queri class person direct class oid bob answer base section direct class bob answer direct class bob instanc answer person class direct instanc class object attribut queri kind queri attribut valu object queri tom queri jim queri person queri queri birth year tom answer birth year jim jim default return result direct instanc person person birth year gener queri object attribut valu method invoc method perform deduct updat invok object queri queri liz queri liz queri liz queri ann queri invok ag method liz invok ancestor method liz check jim element result invok method return liz invok marri method ann sam marri mengchi liu min guo updat elementari updat insert complex updat command form updat command treat transact succe fail effect updat command defin manipul classifi schema updat object updat schema updat user delet modifi class definit schema updat section shown insert command class definit exampl show delet modifi class delet delet delet delet student command delet directli defin attribut person fail instanc attribut similar block delet class student delet method signatur implement enrol student delet class student fail class instanc subclass class definit object updat oid object uniqu creat destroi modifi attribut valu chang time time method invoc object updat insert delet command creat destroi object assign delet attribut valu combin insert delet modifi attribut valu section shown insert command creat object assign attribut valu exampl object delet bob delet bob delet bob delet pat insert pat command delet attribut bob delet default oper fail default delet object updat delet pam bob parent set parent set complet set attribut oper complet set command delet bob direct class attribut valu pat salari real deduct languag combin queri updat command complex updat complex updat queri delet queri delet insert command fire make salari year real deduct languag extens structur deduct languag rol unlik support import featur expect languag partial implement top rol prototyp internet web page system run sgi workstat compat machin implement complet languag progress version semant method updat encapsul investig work gener semant refer abiteboul pc kanellaki object ident queri languag primit acm sigmod intern confer manag page method rule acm sigmod intern confer manag page design implement rock deduct system inform bertino logic program languag intern confer extend page aj bonner kifer transact logic program intern confer logic page mit press stein gemston object manag system commun zicari integr objectori data model program paradigm acm sigmod intern confer manag page mengchi liu min guo editor object morgan deux al system commun topor declar procedur semant deduct system journal intellig inform shan manag system acm tran offic inform hm jamil implement abstract object inherit datalog neg intern confer larg data page morgan kaufmann kifer deduct object data quest integr intern confer deduct page lnc wu logic foundat languag journal kifer wu logic program complex object comput system won kim introduct mit objectstor system commun liu deduct object base languag inform liu overview object languag journal intellig inform liu incorpor method encapsul deduct languag intern confer expert system applic august lnc maier logic object technic report oregon graduat moss naqvi shalom tsur logic languag data knowledg base comput scienc seshadri implement coral deduct system acm sigmod intern confer manag page overview commerci manag sigmod sudarshan ad logic languag intern confer larg data page morgan kaufmann
ML/180 6 solut integr visual forc control von christian technic comput faculti germani abstract paper model task uncalibr camera forc control present shown control problem forc control problem sensorimotor control fuse input sensor control type combin solv assembl problem introduct gener fuzzi rule descript system larg number input variabl suffer problem realworld applic difficult identifi input paramet reduc number input variabl minimum gener solut build fuzzi model interest theoret extend rang applic fuzzi control complex intellig control problem research work robot control face problem larg number input variabl import guid robot motion assembl skill insert screw part import demand manipul skill cooper robot sensor inform sourc robot recent year visual feedback integr great interest convent techniqu exploit common space achiev fuse model environ achiev describ sensor observ work paper partli fund forschungsgemeinschaft project sfb term uncertain geometri probabilist fusion method vision intern strain gaug gather inform contact forc act hand grasp forc vision feedback combin call vision forc resolv common approach explicit model sensor properti order combin inform work present integr visual inform uncalibr camera data obtain cooper arm explicit model emploi adapt scheme learn robot motion perform complex figur setup assembl parallel screw special case transform control affin visual servo appli task shape imag contour input control recent year idea uncalibr camera visual guidanc found interest requir initi subsequ perform cmac neural network tackl problem input repres joint posit imag paramet desir output control signal robot joint learn posit base visual inform introduc imag data set compress princip compon analysi obtain input space parametr eigenspac describ object object locat posit problem transform find minimum distanc point manifold eigenspac work map multipli imag direct report exist solut multivari problem main method solv problem input dimens reduct input select hierarchi input select method find import input variabl larg set input variabl combinatori possibl figur locat robot park posit fuzzi model consid approxim test input result output view import build exact model problem method loss inform number combin test hierarch structur assum input inform classifi gener approach realiz group problem descript experi setup problem scenario fig screw screw nut cooper origin collabor project aim assembl aggreg wooden toi construct set manipul instal upsid grasp requir assembl compon assembl tabl robot equip forc sensor gripper mount small camera mount gripper manipul host comput sun ultrasparc gener screw fixtur devic uncertainti type uncertainti figur inconveni screw grasp appli significantli improv grasp comparison deviat screw rotat axi gripper slippag part hand due effect result screw grasp jaw gripper easili slip screw process uncertainti screw process concret screw centric rotat axi screw match axi gripper screw obliqu fig control sensor screw oper fail uncertainti discuss motion result forc case normal orient direct stabl success constant forc approach direct exert unlik forc torqu give reliabl inform orient screw supplementari approach monitor scene extern camera correct orient contact made screw nut figur typic imag extern camera viewpoint side fig show sequenc typic view scene emploi method fuse visual inform camera order deal uncertainti grasp extract automat featur combin inform uncertainti model basic principl control forc control effici realiz fuzzi control earlier work type control featur distinguish standard fuzzi basi function emploi linguist term input variabl order basi output continu control output defin set fuzzi singleton number control vertic equal number rule optim valu iter found learn adapt procedur weight adjust memori neural network problem learn convent fuzzi control paramet adjust fuzzi simpl modif control vertic chang control surfac squar error select qualiti partial differenti respect control vertex convex function error cost function approxim proport error control descent show stabl asymptot behaviour show advantag learn control approach robot control learn activ control motion measur forc simpl design learn process converg output smooth function order higher control perform dimens reduct dimens input space small input variabl directli cover fuzzi set item rule human readabl interpret describ special instanc gener situat imag camera regard sensor imag larg build rule base sensor imag observ local complet situat interest subspac found inform determin action valu project eigenspac techniqu deal multivari problem statist princip compon analysi shown techniqu suitabl reduc dimens input space gener control problem append deal uncertainti merg small local part camera imag project result imag eigenspac fig figur clip imag camera camera result merg imag denot ev comput eigenvector form orthogon basi repres origin individu sensor pattern assum eigenvector ev ev sort eigenvalu descend order eigenspac reduc dimens form eigenvector ev defin ith dimens eigenspac project input vector xm eigenvector ev call ith princip xm complet project repres ev project sampl data sequenc form manifold eigenspac project view layer neural connect layer left part fig fuzzi control ev ev ev input vector eigenspac project output vector figur structur fuzzi control base eigenspac project partit eigenvector largest eigenvalu finest resolut project eigenvector largest varianc eigenvector ev ev sort descend order ev eigenvector eigenvector ev cover fewer linguist implement sampl train data input data desir output valu record desir typic input data gener outlin orient screw robot move ideal posit orient screw move orient deviat ideal orient record screw time data scatter calcul eigenvector input data step input data energi imag option averag imag subtract input variabl stack vector covari matrix input vector calcul eigenvector eigenvalu calcul imag project eigenspac train fuzzi control control train procedur select eigenvector largest eigenvalu denot ev ev select order basi function eigenvector determin knot basi function partit eigenvector project imag select eigenvector control vertic output learn control vertic project valu imag gradient descent method result termin modifi knot import determin paramet fuzzi set eigenvector fuzzi control distinguish situat eigenvector memori requir fuzzi set manag similarli import correct partit partit fuzzi control insuffici numer result fig show sort eigenvalu fig result control surfac eigenvector vision control learn train shift screw learn control test addit imag fig show eigenvector detect orient screw greatest eigenvector figur sort eigenvalu cover dimens membership function comparison tabl show squar error maximum error largest worst case error test imag worst case defin correct wrong direct experi show merg imag control output figur control surfac eigenvalu input control output duce control separ control camera direct squar error squar error max error worst case error camera camera fuse imag tabl squar maximum error worst case error angl maximum error significantli smaller case imag worst case error high control merg imag contrast worst case error significantli smaller successfulli correct fig show requir correct step orient except step requir correct orient combin approach procedur result robust rapid techniqu determin orient correct screw angl direct angl direct number correct step figur requir correct step orient screw shown problem visual guid solv control shown model sensor fusion forc control implement approach robot system kind train build onlin forc control learn vision system advantag approach merg view imag project input space reduc inform control maintain limit number transform input partit model suffici obtain determin robot orient correct solv problem statist indic provid suitabl solut describ inform imag lot uncertainti vector eigenspac directli map control output base model make comput design control simpl ident low high control forc vision control type fuzzi control train straightforward manner modif control vertic result local chang control surfac approach complex program knowledg vision shown approach realiz effici robot assembl skill base sensorimotor coordin refer integr forc sensor grasp proc ieee conf multisensor fusion integr intellig page chiu select input variabl fuzzi model journal intellig fuzzi clark yuill data fusion sensori inform process system kluwer academ affin visual framework rel posit robot ieee intern confer robot page nelson evalu uncalibr visual servo manipul proc ieee int conf robot page soft comput prentic zhang instruct cooper assembl robot situat dialogu natur languag ieee intern confer robot fusion hierarchi fuzzi logic control design ieee intern confer fuzzi multisensor fusion comput nato asi page miller applic neural network control robot vision ieee transact man track visual ieee intern confer robot page nelson forc vision resolv assimil dispar sensori feedback transact robot hugh dur whyte coordin control robot system kluwer academ uncalibr coordin redund camera system proc jang manipul journal robot allen uncalibr visual servo ieee intern confer robot page zhang construct fuzzi control model principl applic intern journal intellig fuzzi control acquir assembl skill ieee intern confer robot
IR/181 5 user interfac social awar world wide web olivi inform system laboratori japan mark inform system laboratori japan ichikawa inform system laboratori japan abstract argu social awar world wide describ user interfac base metaphor window bridg electron physic space present system aim make activ percept physic make hear peopl visit web site system advantag seamless continu network connect offer handheld pda introduct describ evolut world wide huge quantiti inform grow fast pace mention fundament aspect qualit quantit natur www chang year distribut document static page manual creat access peopl augment integr collect servic dynam inform gener machin evolv social peopl conceptu access visit school place organ number individu small part virtual world establish web acquir territori problem difficult natur peopl awar happen digit territori goal techniqu captur activ occur web site make percept physic world web ubiquit web user connect network sporad gener front comput chang kind devic consum market keyword audio user social world wide web categori includ fix screen wall mount categori includ mobil person digit assist palmtop smart mobil peopl increasingli benefit continu seamless network connect opportun kind applic good recent success instant messag tool refer icq user monitor statu peer send messag substitut kind applic make peer reachabl time comput network thought global nervou connect perman provid path varieti maintain constant awar physic social environ challeng issu applic design find wai notifi user overload distract current task address issu paper present user interfac base metaphor window bridg digit physic environ describ illustr applic user interfac remain section introduc notion awar context www comput support cooper work review number relat system discuss idea creat window bridg digit physic world describ user interfac design aim illustr implement system system peopl maintain awar activ occur web plai sound page access peopl discuss experi review major benefit current limit futur work mention final awar www wai relat www cscw web design support collabor distribut work team provid mechan inform share discuss www offer rang featur make attract platform build collabor system exampl cscw system web implement platform recent work distribut author version protocol web support collabor work www build cscw interest find cscw research appli benefit develop web technolog interest notion extens studi literatur awar kei featur success collabor gener support web import find benefit offer awar facil web solut notion awar gener categori identifi includ workspac awar group awar awar dourish gener definit understand activ context lack awar contribut make remot collabor difficult peopl share physic multitud cue maintain awar effort easi guess person busi engag peopl physic cue judg peer present system media space address captur form activ place make percept remot locat continu video link offic give impress peopl room share common space number awar system www implement platform porthol web page displai snapshot locat workspac web find group member idea privaci issu kind system discuss web carri inform reflect activ occur real world relat www awar web space social activ place peopl sell bui answer awar activ wai problem idea workspac awar appli web activ group peopl engag collabor process browser access document servic web person particip interest control browser guid place exampl collabor browser kobayashi al benefit collabor web provid custom support bank applic figur user interfac virtual open web space good idea make web user awar user peopl access page semant relat visit site provid resourc java visitor talk develop valuabl experi solut problem author interest question find seamless natur wai make peopl engag real world activ read newspap talk awar activ occur territori difficult demand inform publish idea happen web site collect tool permit analyz log gener http server tool gener target system administr perform secur major web author requir user activ access statist complement applic wai monitor web activ enter hear enter home internet dangl string tangibl user interfac ishii attempt creat sort interfac inform space physic world open window bridg physic electron space work paper close relat categori system exampl brown call calm technolog defin technolog engag center peripheri fact move back offic window calm technolog maintain awar natur peopl walk notic light offic give cue maintain gener context social environ user interfac describ base creat window bridg electron space physic window interest featur briefli mention window connect point space window connect offic space outer space virtual window connect home page live room window offer simpl filter amount inform transit space larg number signal transit space block ensur low disturb space inhabit window origin commun area peopl space approach talk virtual window peopl approach vicin talk network idea exploit system montag idea group awar tool discuss awar mix realiti environ interest studi window metaphor peopl understand happen web site main object awar web activ user motiv maintain qualiti site peopl visit site reason make motiv activ relat inform site peopl interest work reason foster interact web site publish visitor publish made awar visitor start commun process person chat java applet introduc model mix realiti web space smoothli connect physic world peopl made awar web visitor sensori sound connect point electron physic dimens call consist physic devic network connect compon model web collect sensor captur activ physic space person engag real world activ monitor activ occur web space web space consist portion site thought onlin territori owner space person stai awar visitor explor web space standard browser modifi normal behavior accommod system sensor detect form activ comput world sensor agent detect http request handl server event appropri notifi physic space consist surround peopl engag activ space necessarili directli interact comput time part comput physic space connect run softwar receiv notif web sensor physic artifact produc sensori percept nearbi peopl imagin basic scenario visit web site browser activ track number notifi carri owner site devic produc sound percept physic world user visit web space prototyp system implement prototyp base model consist palmtop comput infrar wireless network connect mobil user stai smoothli connect system figur describ architectur system consist standard http server host web space standard http visitor explor web space sensor detect http request server sensor implement cgi script trigger document access script retriev http ip address target url http referr encapsul inform udp datagram broadcast set host host run special server call http access monitor listen specif udp port wait datagram http sensor wait subscript request issu parti maintain list author subscrib http request notifi site visitor subscrib http access monitor daemon subscript notifi http request http browser broadcast event host messag subscrib send subscript http access monitor daemon receiv notif http request user defin sound sound featur defin number match http request attribut sound featur request notifi loud long http request notifi attribut match rule sound plai interact main window user interfac illustr figur slider bottom user open close window determin amount sound produc window wide access notifi sound slightli access evalu import notifi sound produc featur depend user find audio interfac case task requir high level http request content http sensor map rule sound librari http server html document sound figur system overview site owner web document document retriev concentr peopl present neighborhood order custom user creation sound librari definit map rule figur show dialog defin sound consist collect audio file high natur special effect long import neutral rule defin map http request attribut sound featur dialog shown figur rule consist condit condit specifi request attribut client ip http oper start charact string rule specifi featur candid sound http request rule evalu condit met chosen sound match featur select randomli plai commun descript system consid situat visitor site awar window physic world inform happen electron world mention interest featur window creat commun area figur defin sound librari figur defin rule map http request attribut sound featur system support mechan java applet chat window part user interfac engin integr short messag spoken user special page site java applet figur access visitor icon figur commun java applet apertur angl owner idea avail person disturb text field enter short note whisper heard render window wide open visitor perform remot action result sound plai final special dialog user chat visitor featur support scenario visit web site find interest inform access applet remot shout depend respond person chat window evalu futur work proper user studi evalu effect prototyp web site describ set experi report observ experi set author gain understand activ occur web space space consist distinct web public softwar relat structur graph framework research project user interest monitor site involv project user person inform research project descript public target futur employ offer onlin resum final person includ photo collect site small gener moder stabl interest user notifi document access import recogn kind document access easi visitor locat site person site document import user easili identifi request document resum integr prototyp real web environ custom fairli easi minut instal http sensor basic insert line html document templat modifi file user build small sound librari defin map explain previou section rule visit site notifi high pitch sound visit person site notifi low pitch sound access resum notifi loud find system user awar happen web space requir attent user user hear impress close feel log analysi tool emot effect user major benefit system motiv gain user hear visitor convinc worth make effort maintain qualiti site peopl inform work encourag user feel motiv pursu effort share achiev web interest turn design reveal success audio advantag sound notifi event requir effort user engag activ involv read perceiv notif sound featur distinguish kind http request work natur user interpret featur infer natur request filter slider open wireless network connect displai open virtual territori close window case peopl approach user vicin start talk system architectur instal custom effort experi issu address futur work lost audio interfac system capabl notifi event synchron user happen happen time period user short access occur time notifi activ occur combin address issu handheld wearabl system implement palmtop comput wireless connect user handheld devic bulki wireless network extend user leav desk short connect cyberspac wearabl devic kind slider open close speaker figur tent sketch wearabl system figur sketch wearabl multipl audio notif work question peopl common physic space sound devic close difficult user distinguish messag system address issu user defin person sound librari good idea provid wai person sound make futur work direct improv refin current system augment user interfac media imag address issu lost messag difficulti present aggreg inform plan defin number graphic widget symbol repres captur activ imagin tree grow time page access address issu flexibl definit map rule explain previou target url http request approach suitabl small problem larg defin map rule tediou process plan integr system framework design foster creation util metadata describ structur web site metadata gener describ manipul high level region site defin rule event research region high pitch deal url goal conduct rang user studi verifi system interest question studi impact tool behavior web publish understand import maintain site qualiti web argu support social awar world wide present user interfac base metaphor window bridg physic electron space system permit gain understand happen web site hear visitor access document experi system reveal major benefit approach motiv maintain qualiti site share achiev web hope verifi observ test system larger number user author support govern scholarship author fellowship japan societi promot scienc refer brown share proc acm world wide web enabl technolog case support cooper special issu cscw vol kluwer academ press harrison media bring peopl comput commun vol page challeng perspect cooper work ercim workshop cscw sankt awar coordin share proc acm press develop complex inform commun vol page lee experi develop collabor applic world wide web acm www browser real time acm confer human factor comput companion gutwin greenberg design design tradeoff power workspac proc acm ercim workshop cscw sankt hudson smith techniqu address fundament privaci disrupt tradeoff awar support proc acm tangibl seamless interfac chi acm kobayashi collabor custom servic synchron web browser proc acm ichikawa metadata framework extract web site proc intern confer multimedia comput ieee comput societi virtual visit system base proc acm protocol user awar world wide proc acm abstract presenc support mutual chi acm scott wolf collabor world wide joint european network tang provid distribut proc acm support social awar design proc acm bring synchron groupwar world wide european confer comput support cooper work sept academ publish support develop synchron collabor tool web ercim workshop cscw sankt brown design calm version juli zhao evalu imag filter base techniqu media space proc acm icq home
HCI/182 4 marc alexa morph node johann darmstadt discuss potenti limit morph inspir construct morph node interpol vertex attribut geometri node candid deliveri anim compact form review web possibl interpol geometri review lead simpl extens recommend discuss optim issu morph node cr categori subject descriptor methodolog standard graphic applic addit keyword virtual vrml introduct anim shape involv chang vertex attribut time morph repres time interpol shape extend concept base shape morph produc blend object order repres anim search suitabl set base shape shape anim produc blend base shape geometr anim individu motion object jump walk run car drive case travel object find rigid transform rigid transform easi repres make number base shape smaller admit case rigid transform hard anim small number base shape practic exampl concept explain find base shape slightli technic morph implement convex combin vertex attribut easili extend concept shape base shape span affin space element space repres darmstadt depart comput interact graphic system project area graphic comput graphic depart visual wolfgang müller comput graphic darmstadt vector vn element construct convex combin vertex attribut element weight vector understand base shape element space linear space power method form linear algebra princip compon analysi space vertex attribut anim find eigenvector largest eigenvalu eigenvector good candid base shape formal method find base shape idea morph shape gener anim anim repres base geometri weight vector space number base shape order magnitud smaller number result compact anim reason scheme suit applic transmiss base shape anim transfer rate virtual network geometri chang geometri decoupl manipul touch context stream applic adapt geometri local displai capabl chang anim illustr gener idea mention benefit facial express facial anim comput graphic center interact graphic system design runtim system facial anim develop system runtim system control anim user interfac agent target improv agent mean person commun man machin comput children access comput servic facial anim support speech output allevi commun problem redund code user interfac agent act element user autonom perform base intellig mobil agent user interfac agent central point organiz commun thread manag consolid user stai focuss import correspond extens standard ui metaphor desktop metaphor user interfac agent repres visual metaphor anim face bodi element main focu design commun visual limit fulli anim talk head includ detail figur imag facial anim hand visual rich head facial posit characterist movement head hand express system statu task mean simplifi author user interfac behavior control action simpl compact morph central paradigm gener express anim user interfac agent runtim system select number facial base express pose suppli term geometri textur shape defin affin space user interfac express pose express gener morph shape attribut express pose express weight vector dialog sequenc repres timelin keyfram weight vector big advantag approach possibl exchang user interfac chang anim shape textur user interfac agent base shape textur anim directli applic object stream express gestur realiz effici keyfram weight vector transmit framework flexibl good suit applic design implement standard graphic system vrml browser evid perform standard morph compon system suffici low end medium size graphic workstat deeper made clear due limit flexibl optim mean node chapter introduc concept gain perform morph graphic engin base advanc version morph node figur show imag anim morph node concept morph base shape tool model anim oper perform kind oper simpl basic task morph node accomplish interpol vertex attribut number shape number base shape defin ent vertex consist color textur inform vector mean comput shape ba flexibl interpol shape color attribut color base shape make interpol color user fix set color blend independ color set base shape true normal upcom section optim interpol linearli linear interpol normal solut respect gener concept morph node exclud attribut gener linear interpol interpol mean techniqu wrap vertex attribut interpol linearli number subset vertex attribut interpol fix valu attribut interpol suppli attribut plai back anim addit construct interpol kei frame vector time linearli spline space requir singl kei frame afford kei frame linear interpol subsect review current api regard state requir extens ba ai ai applic interfac plai back geometr anim techniqu mention introduct accomplish task playback anim workstat base shape includ textur set keyfram time stamp weight vector examin offer plai back anim commun version vrml present larg static scene descript file format lack anim interact lead iso standard main goal origin creat specif anim rich support geometr morph limit design concentr simpl linear keyfram anim support linear interpol vertex posit valu shape blend shape support handl vertex posit vertex attribut color textur coordin handl unusu chang textur coordin color vertex base keyfram anim directli support normal comput vertex contrast import time consum technic provid comput normal face vertex interpol set valu output vector normal node geometr node defin normal normal field system automat gener set determin normal smooth share vertic base shape includ normal fastest simplest normal unchang vertex posit visual accept posit minim addit interpol rotat posit defin standard interpol rigid bodi anim combin swim keyfram descript desir effect extend anim capabl lead offici accept web consortium work group creat standard humanoid natur languag process natur languag interact anim work group involv anim work item directli relat work present paper api graphic java scene graph architectur shape repres node geometri node geometri arrai includ color textur coordin shape control wai depend geometri applic materi descript defin node morph node accept geometri number vertic combin attribut object morph actual geometri alter call method order interpol kei offer interpol extend time stamp kei frame account offer basic tool playback anim base shape weight vector limit design hinder context base shape attribut attribut interpol predefin vertex attribut interpol give user flexibl set color geometri shape interpol case hand nice interpol materi facial anim shape vertex vertex color chang base shape float tripl interpol call normal interpol user section normal interpol opportun set interpol float interpol normal result normal interpol result time perform repres newest multimedia standard mpeg famili support standard video encod scheme base effici frame encod motion languag compon scene element scene structur base specif extens relat anim artifici face bodi anim render anim face express face defin facial definit paramet download model configur baselin face model instal specif face model begin session inform anim facial anim paramet anim model face anim tabl perform function map incom featur control point face mesh face interpol techniqu interpol express base weight ration polynomi function invok condit evalu face interpol graph function complex link interpol miss stream termin face anim highli effici code anim paramet drive unlimit rang face model model norm standard call bodi develop mpeg concert humanoid anim work group vrml tive achiev consist convent control bodi model establish bodi standard version design fabric work integr anim decod scene descript directli mirror technolog proven face anim bodi definit paramet bodi anim paramet exist facial bodi anim element repres interest technolog context anim user interfac user interfac agent standard control face anim major achiev context technolog system support concept base lead similar problem state motiv paper solut provid section applic context standard activ area anim system exchang format goal repres extens graphic specif make structur express mean current state develop make interpol function morph extens vrml provid mean implement concept morph node suitabl support anim elabor model techniqu extens exist standard extens extend node order accomplish idea morph node handl interpol gener vector interpol linearli coordin set interpol linearli normal normal set give specif detail node kei node design addit interpol scene defin interv gener aim node abil interpol set vector size node send result field matrix number valu field size vector number scalar valu field integ multipl number keyfram field integ multipl defin implicit size vector number element event output input slot node node linearli interpol set valu unlik interpol kei frame blend number shape number coordin integ multipl number keyfram field integ multipl defin coordin slot node blend set normal vector set field output set normal vector fit exist concept follow directli section addit api defin wai attribut suppli set fix suppli interpol attribut java gener accur time mechan support synchron playback geometr anim main goal build technolog base lightweight core specif consid larg complex implement base set includ element predecessor includ core specif gener approach shape anim substitut interpol lose function perform optim issu gener concept implement morph node simpl naiv approach result complex number base number vertic base number attribut interpol decid attribut interpol crucial normal difficult simpl linear interpol yield correct result discuss wai handl normal upcom fix normal interpol normal gener normal figur comparison normal upper row show state dolphin anim fix set normal normal middl row show state linearli interpol normal normal normal lower row gener form geometri frame tion base shape differ attribut system exploit fact interpol linear interpol normal correct note normal necessarili normal linear shade fail normal vector interpol result linear interpol expect interpol quaternion correct direct interpol normal lead normal linearli interpol geometri reason wai treat set normal normal set normal bn interpol normal linearli normal interpol quaternion space comput normal geometri interpol option unaccept sight produc surprisingli good result current facial anim system demonstr siggraph normal interpol normal neutral face figur compar anim swim dolphin correct normal normal interpol movi download recalcul normal number case consid linear interpol recalcul quaternion interpol produc correct normal interpol shape linear comparison remain approach tabl note time heavili influenc task anim engin accomplish dolphin vertic vertic fix interpol gener sec sec sec sec sec sec tabl time render frame anim normal calcul strategi elabor approach comput geometri normal updat normal updat geometri gener slightli incorrect normal demonstr provid high frame rate respect geometri touch equal attribut anim part attribut chang facial anim easili color set chang base shape vertex coordin region chang chang normal region chang illustr facial anim figur anim node figur color code move vertic grei vertic depict static red color reflect higher veloc system color code vertic depend veloc standard grai vertic fix red vertic move note small number vertic turn red anim gener subset vertex attribut base shape system iter attribut base shape identifi similar attribut result inform vertic attribut interpol simpl trick exploit inform vertic shape differ vertic loop interpol iter vertic touch fix vertic weight vertic extend concept subsect individu base vertic chang subset base shape weight base shape subset recalcul vertic basic problem exploit fact base shape interpol small subset vertic solut reorder vertic condit describ sequenc case loop vertic includ exclud set vertic depend weight respect base shape instanc dismiss oper block weight set paper analyz applic morph techniqu graphic system current shape morph method base interpol node perform interpol complet geometri base shape recalcul object attribut normal color anew system lack perform morph appli applic morph node enhanc flexibl support morph object give enhanc control morph process morph calcul attribut lead addit visual effect avoid number test object time prove perform enhanc upto recommend morph node ongo specif process acknowledg ulrik comput graphic center provid user interfac agent model fundament express valuabl comment support work bibliographi alexa müller morph system vrml applic descript virtual realiti model languag version august humanoid anim work group intern standard iso intern standard iso javasoft java tm compress acm symposium interact mae model adapt autonom artifici life vol mit anim synthet face comput anim consortium
DB/183 3 natur languag gener meet knowledg discoveri jacqu robin de universidad feder de brazil departamento de universidad feder par brazil abstract present system gener natur languag hypertext summari insight result knowledg discoveri process discuss synergi technolog underli natur languag gener knowledg discoveri highlight advantag natur languag hypertext summar medium kdd show gain chart tabl term express versatil interpret maker highlight kdd olap data implement kei task autom natur languag data summari scalabl human written heurist rule approach previou system introduct discuss synergi multidisciplinari research knowledg discoveri natur languag gener carri discuss present summari system natur languag hypertext gener summar insight result kdd process link web page develop part analysi textual report insight knowledg aim construct easili extend knowledg discoveri support environ seamlessli integr data data autom deduct natur languag gener goal project progress process user orient combin kdd support servic principl underli ongo develop coupl architectur base servic encapsul softwar compon integr data mine result analyt mine altern relianc autom induct deduct discov insight relianc kdd process explicit declar knowledg objectori extens tractabl subset logic reusabl specif kdd goal strategi declar queri manipul languag encompass servic process systemat servic plug reserv develop scratch innov servic principl shift emphasi project tradit research area machin statist advanc softwar softwar knowledg manag user interfac hope uniqu emphasi research make conceptu technolog contribut complement project kdd nlg featur automat gener natur languag result report nlg system reli data mine olap summar medium kdd natur languag hypertext present advantag chart tabl includ express versatil interpret maker nlg applic includ natur languag interfac expert onlin intellig tutor machin translat summar text practic impact summar data prototyp data text summari gener develop domain includ stock market weather forecast comput secur demograph telecommun equip plan busi web usag data mine olap implement kei task content determin scalabl sharp contrast heurist rule approach previou rest start present input output architectur detail perform natur languag gener hypertext summari conclud discuss intrigu synergi nlg kdd kdd limit current work prototyp futur work overcom natur languag hypertext summari gener input output current version summar singl type mine outlier aggreg valu analyt space repres olap input shown fig call input tabl content matrix line matrix correspond essenti show deviat compound slice intersect aggreg level outlier definit content matrix coordin cell analyt measur medium aggreg slice intersect cell fig outlier miner singl cell conceptu hierarchi level deep place dimens task gener hypertext analyz summar context matrix maker note context matrix half input specifi hypertext constrain declar languag strategi summar inform content matrix syntax organ specif languag inspir aggreg oper queri fig maker mine outlier group order gener hypertext summari tailor output natur languag interfac current data analysi olap oper rank pivot tabular interfac front page hypertext gener summar content matrix fig strategi fig fig page access hyperlink front page shown fig page follow simpl structur front page hypertext gener summar content matrix fig time strategi fig fig main differ strategi dimens measur consid group prioriti aggreg valu introductori devic list cell share dimens sale variat sign dimens group order criteria version version version reli dimens except product group order content version prioriti except product creat order insid except base version except order criteria insid group version differ introduc cell list size aggreg count system architectur implement shown fig adopt pipelin gener architectur compon encapsul main nlg content content content lexic content syntact content realiz content determin involv select content unit linguist explicitli convei output text content organ involv group content unit express paragraph sentenc text order result group subgroup creat coher textual structur clear logic themat progress content organ involv continu content unit order process level phrase insid sentenc gener process result leav content unit select content determin themat tree structur syntact tree output sentenc lexic content realiz involv semant content bear lexic item syntact categori linguist express content unit tree access lexicon result order list lexic themat tree syntact content realiz consist map lexic themat tree grammat complet correct syntact linear output sentenc involv syntact syntact function word morpholog inflect content bear word order word insid enforc grammar rule natur languag architectur differ wai previou mention section content determin data mine compon includ hypertext plan compon partit select content unit web page output call remain compon standard pipelin gener web pick content unit serv anchor hyperlink page gener innov perform content organ level entir hypertext page final sentenc page techniqu granular review techniqu turn subsect assum content determin perform extern data mine compon type perform lexic method larg base carri syntact realiz method integr aspect detail perform task hypertext document organ content organ hypertext document level involv main distribut input content unit page anchor bear hyperlink page context task consist assign cell content matrix hypertext page current implement fix strategi assign assign front page measur mine result column content matrix front page content delimit bold frame content matrix fig assign line content matrix page fix strategi measur serv anchor hyperlink front page page explain outlier coher hypertext requir content unit redundantli convei end hyperlink content unit outlier assign front page repeat page dedic outlier instanc repetit commun goal goal instanc introduc reader basic inform outlier goal page instanc reader identifi refer outlier unambigu introduc complementari inform mean cell content matrix hyperlink illustr strategi check cell content matrix fig item sentenc fig page fig access anchor web page organ carri web page level content organ process shuffl row column insid input content satisfi group order goal input strategi version content organ start move except column leftmost sort row order valu column satisfi line strategi point product column leftmost line strategi satisfi product alphabet row row group share except column final organ step consist valu sale variat row row share valu except product column result final content matrix final matrix strategi sentenc organ content aggreg organ content unit insid sentenc shuffl content matrix adjac cell common order maxim content factor minim content repetit complex sentenc consid shift refin web page organ shift factor alter page organ exclud result text compli user input strategi sentenc organ process start content matrix recur repeat valu shift leftmost posit unprocess row group sort valu shift adjac cell share merg factor version content matrix fig result shuffl merg process fig factor content prescrib strategi fig shuffl place time row group note row base oper underli web page organ implement relat languag data cell base oper underli sentenc organ implement languag data structur observ left cell factor matrix fig left phrase result natur languag output fig analyt dimens measur mine result mean cell product place time sale variat sign sale variat except product place time birch beer nation nov low nation aug low birch beer nation jun low birch beer nation sep central aug low diet soda east aug diet soda east sep diet soda east jul diet soda south jul low diet soda west aug low colorado sep colorado jul wisconsin jul low fig input outlier aggreg valu mine retail olap count fig grammar olap content determin olap model outlier definit threshold annot cell pool hypertext plan content matrix organ strategi factor matrix hypertext planner sentenc organ sentenc plan rule tree lexic lexic rule lexic themat tree syntact realiz grammar rule natur languag web page hypertext summari fig architectur measur measur except dim dim product measur fig strategi atyp sale variat month occur birch beer nation septemb diet soda eastern region juli august level colorado fall juli august septemb diet soda eastern fall septemb octob notabl atyp birch beer sale june juli novemb fall juli august central region dive wisconsin august diet soda sale southern region juli opposit region variat august east nation sale august septemb make variat unusu context year click fig page hypertext output gener content matrix fig strategi fig diet soda sale eastern region juli august atyp due combin cross rest juli august averag variat product rest averag monthli eastern sale product rest product eastern sale variat juli august fig page hyperlink output front page fig count group dim product measur measur except dim measur measur fig strategi except product line strike birch beer nation sep oct remain cluster birch beer sale account mild nation jun jul nov sale account medium jul aug aug mild wisconsin jul aug central region aug diet soda account east juli east sep south jul aug east aug west aug sale account mild nation fall aug sep fig page hypertext output gener content matrix fig strategi fig mine result analyt dimens measur cell except product place time sale variat sign sale variat birch beer nation sep high diet soda east jul colorado jul sep medium diet soda east sep nation birch beer jun nov wisconsin jul central aug south jul east aug diet soda west aug low nation aug fig restructur context matrix appli strategi fig input matrix fig dimens mine result dim measur dimens cell product except sale sign sale variat amplitud place time birch beer high nation sep nation jun birch beer low nov colorado jul medium sep wisconsin jul low central aug high east jul medium east sep south jul east aug diet soda low west aug low nation aug fig restructur context matrix appli strategi fig input matrix fig mine result analyt dimens measur cell except product place time sale variat sign sale variat valu birch beer nation sep high diet soda east jul jul colorado sep medium diet soda east sep jun birch beer nation nov wisconsin jul central aug jul south east diet soda aug west low nation aug fig factor matrix result appli sentenc level organ content matrix fig discuss synergi kdd nlg data summar contribut research present paper root nlg kdd kdd nlg reli nlg user interfac layer summar data mine discoveri data intuit wai tradit approach reli sole chart kdd reli data mine olap data model perform content determin organ scalabl portabl tradit approach base heurist deduct ai plan intrigu synergi kdd illustr limit context preliminari implement gener type data mine underli model nlg uniqu featur fulfil challeng result summar publish kdd uniqu featur fulfil equal challeng content determin organ nlg applic start raw data input elabor view subsect nlg improv natur languag advantag chart graphic summar insight discov olap data mine textual remain familiar report format execut base intuit mathemat naiv natur languag convei analysi arbitrari dimens fact express natur languag promot sale juli august constitut strong involv market sale variat sale variat space except tabl color graphic lose clariti fourth dimens natur languag convei singl strike fact isol context make strike sale peak valu sale month plot report creat visual contrast graphic convei notion maximum monthli valu interest natur languag freeli mix quantit content causal subject content intuit convei graphic tabl kdd improv nlg reli gener oper data mine perform content determin organ nlg bring task carri highli previou gener perform content determin reli fix set heurist rule prevent code applic approach suffer sever limit prevent gener report interest content underli scale analyt context high multipl granular account histor evolut data complex context requir combinatori number summari content determin heurist select fact class thought ahead rule base fact make interest report olap data mine technolog emerg tackl variabl granular search histor data space high data automat hitherto regular singular relat work type relat work relev research present paper user interfac kdd vast area space cover contribut kdd interfac li natur languag hypertext medium discuss advantag natur languag tabl graphic section type relev relat work cite introduct kei contribut compar system gener hypertext linear text hypertext output present advantag avoid summar cut input content uniqu output output gear reader interest potenti hypertext summari cut simpli convei gener crucial content front leav special interest detail page anchor link numer reader interest follow navig pattern insid uniqu hypertext end access materi read custom summari advantag avoid text figur chart graphic anchor insid hierarch hypertext structur hierarch structur make hypertext output adequ organ natur languag summari report hierarchi built analyt dimens olap kei contribut compar previou reli perform content determin approach fulli data driven base threshold content unit semant compar content unit attribut valu analyt context olap previou comput aggreg valu content unit insid fix semant specif underli applic domain make content determin approach goal driven previou comput aggreg valu procedur gener tool design scale larg data set complex intern structur limit current implement futur work main limit current implement gener report singl type mine outlier type mine knowledg classif associ tempor trend seri ad versatil user interfac research determin easili shuffl techniqu content organ outlier extend organ vari content unit potenti high order composit limit rigid hypertext organ strategi current prototyp flexibl organ custom textual summari web page sentenc extend hypertext document level limit hypertext gener empir evalu data analyst maker intend perform evalu experi direct futur fourth limit relianc content determin organ turn task case lexic subtask lexicon newli recent layer lexicon design api larg applic independ linguist resourc limit total amount knowledg hand code anew port domain paper present natur languag hypertext gener summar outlier mine discoveri olap improv content determin organ approach previou applic domain variabl granular insight search high data automat discoveri tailor output text organ declar analyt perspect input data improv chart tabl base result summar publish facil exist clear express analysi arbitrari abil pinpoint strike mine fact express versatil convei fact subject judgment show synergi nlg kdd kdd nlg data refer data relat data xml morgan natur languag natur languag ta associ pour le automatiqu de franc rj process knowledg discoveri advanc knowledg discoveri data fayyad aaai content determin text interrel process concept realiz system pp build natur languag gener system cambridg kr float constraint lexic choic comput overview syntact realiz compon intern workshop natur languag gener uk gener hypertext summari data mine discoveri phd de universidad feder de brazil data concept techniqu gener extend bilingu statist report integr reusabl lexicon natur languag intern confer natur languag gener israel tool gener weather forecast text american meteorolog societi ai confer arizona natur languag report natur languag gener system dd hand softwar evolut text gener applic workshop research commerci make nlp technolog work juli advanc automat text summar mit gener natur languag summari inform process gener summari work flow diagram intern confer natur languag process industri applic canada robin mckeown empir design evalu model summari gener artifici sarawagi agraw megiddo explor olap data cube intern confer extend technolog integr induct deduct reason data mine advanc knowledg discoveri data fayyad ed aaai translat techniqu machin translat artifici intellig www
Agents/184 1 combin modal logic bennett school comput uk dixon michael fisher centr agent research manchest metropolitan uk enrico franconi ian horrock depart comput uk de rijk institut languag netherland introduct combin logic model rapidli expand inspir concern modular join kind inform interest real world system composit descript requir mainten reason task appeal plausibl forward claim understand method core bodi question result emerg import class combin begin understand core theori behav appli class paper combin modal identifi lead edg research carri combin system wide varieti applic interact occur separ modal dimens begin review modal logic document develop panel session uk autom reason held part aisb symposium edinburgh author michael fisher chair panel edit document kluwer academ publish print netherland modal motiv past decad percept comput comput program chang time dramat consequ reach societi rise person comput began view comput extens offic desk comput program replac tradit offic tool fill cabinet word advent electron inform ag view comput program turn ubiquit digit assist digit digit agent due vast extent scatter natur inform landscap todai averag comput user learn navig inform landscap tradit tool digit agent reason time suffici free inform suffici number servic access manipul comput program direct human comput user person digit agent substanti impact economi impact research comput note comput hardwar design gener base von neumann architectur comput program comput techniqu result comput scienc research impact digit agent current develop modal logic combin modal logic good candid formal theori execut digit agent modal logic model digit agent human user digit agent understand belief goal user digit agent cooper order achiev goal modal logic perfectli suit formal set obstacl proposit modal proposit logic insuffici complex real world situat languag monoton logic suffici situat knowledg world incomplet knowledg default hold reli probabilist logic formal digit agent combin modal logic repres agent system rapidli grow area industri complex distribut compon intellig ration agent system design applic higher level abstract order reason number theori ration agenc bdi linder framework framework repres combin modal logic addit agent basic agenc ration logic form basi formal method lead agent theori formal method gener share similar logic properti logic inform repres agent belief dynam dynam motiv repres agent intent goal aspect typic repres inform modal logic belief knowledg dynam tempor dynam motiv modal logic intent desir predomin approach relev combin moor combin proposit dynam logic modal logic knowledg bdi framework linear branch tempor modal logic belief desir intent halpern al fagin linear tempor logic combin logic framework linder van der hoek proposit dynam modal logic belief assum combin modal logic plai import part model digit obviou step question verifi requir properti agent formal method dynam complex practic situat current research activ agent theori centr develop simpler combin logic express properti complex simpler work area involv develop simpler logic basi agent spatial logic tradit modal logic repres interact proposit attitud recent work investig spatial inform combin modal logic bennett topolog interpret modal interior combin modal order encod larg class topolog relat descript logic origin success combin modal logic develop express descript logic de giacomo descript logic found practic reason schemata queri descript logic shown correspond directli combin modal combin applic schema queri reason ontolog engin applic baker context descript logic combin role prove enabl common conceptu data model formal entityrelationship captur empir tractabl implement success combin modal logic descript logic framework motiv attempt add tempor dimens knowledg languag typic applic tempor extend descript logic action plan artifici intellig artal reason conceptu model tempor tempor descript logic obtain combin descript logic standard logic wolter variant hs proposit tempor logic combin modal logic number real potenti import rememb gener technic problem occur section problem combin logic special logic limit express make put logic express power properti logic axiomat complet transfer problem enjoi properti combin transfer problem belong main mathemat question logician concern area combin logic transfer failur rule absenc interact compon absenc interact mean compon languag share boolean atom symbol interact section properti transfer restrict case includ finit model suitabl restrict class model complex complex upper bound posit proof area base kei divid conquer hide unpack split problem deleg compon work insid compon logic view inform relat compon logic alien inform dont unpack hidden inform reduc problem relev compon logic kei intuit continu work presenc interact modal languag modal oper logic satisfi problem satisfi problem combin languag interact principl undecid reason method combin modal logic potenti care combin logic applic area discuss section notion proof import agent proof examin properti theori comput theori formal proof import develop verif techniqu develop proof techniqu combin logic wide varieti reason system individu modal natur combin work actual reason exist tool compon logic put obtain tool combin tool procedur kei motiv underli field put proof procedur logic uniform mean satisfi comput gener model clear proof procedur logic logic proof procedur notion proof goal special condit calculi combin case modal approach theorem map compon logic common background logic success instanc combin logic problem whatsoev put de dont good understand proce experi network stage plug tool design engin system section work involv develop proof techniqu combin logic tableaux base reason reason method modal logic present procedur approach suit implement proof procedur interact modal explicit presenc model algorithm system repres interact modal tableaux system advantag direct intuit obviou relationship kripk structur underli algorithm easi design simplic algorithm facilit implement develop rang system descript combin tempor logic modal logic resolut base reason altern approach reason combin modal logic direct resolut techniqu long term perform system work area extend resolut method develop tempor logic fisher combin logic consid clausal resolut method centr round main translat simpl normal form renam complex subformula reduct core set classic resolut formula occur moment resolut set formula make true constraint ensur point futur extend method tempor logic combin modal logic translat normal tempor formula separ modal formula reason tempor modal compon carri separ inform transfer compon classic proposit logic import direct resolut method modal logic includ approach work prefix resolut translat base reason translat formal languag problem class fundament principl comput scienc compil program languag implement translat formal languag formal languag case logic translat approach base idea possibl theorem prover logic infer logic carri translat formula minim requir translat translat preserv satisfi comput polynomi time case modal straightforward translat relat base kripk semant modal logic compil singl program number altern translat map modal logic subclass order logic satisfi mention minim requir includ function translat na del function translat translat advantag translat approach includ enabl varieti proposit theorem prover translat approach access reliabl gener method modal theorem prove procedur obtain suitabl instanti paramet exist theorem prove framework function translat demonstr relat translat consid gener guidelin paramet enforc termin hard part prove termin common approach order refin resolut ensur termin order refin natur provid procedur wide rang solvabl fragment uller interest altern select refin select refin close relat commonli refin theorem prover shown select refin split polynomi simul proof search standard tableaux calculi modal logic altern base fact function translat translat modal formula subclass class number ground instanc obtain formula class finit proposit procedur test satisfi set ground number equat method base algebra interpret modal constraint satisfact techniqu develop share broad similar reason method interact combin modal decid support interact modal dimens case combin modal logic interact exploit full power combin interact handl interact typic involv commut modal pair satisfi schema appar simpl schema surprisingli hard incorpor modal reason algorithm shown logic pair section discuss decid issu approach consid section cope interact descript logic context descript interact kind role inher essenti part work express descript logic basic descript logic syntact variant normal logic proposit dynam logic express descript logic obtain ad role specif properti transit function interact modal combin logic interest case implic introduc axiom schema basic descript logic combin import encod modal descript logic interact approach lead practic reason system complex descript logic context tempor descript interact tempor nontempor modal bad abil defin global role invari time make logic undecid identifi special combin basic descript logic tempor compon decid tempor logic knowledg interact tempor logic modal logic knowledg halpern halpern halpern notion perfect uniqu initi state synchroni defin basic tempor logic knowledg restrict notion hold halpern al complex valid problem logic linear tempor logic common knowledg complex valid problem higher interact combin interact lead undecid resolut system synchroni perfect recal synchroni learn ad extra resolut rule case axiom tempor axiom modal logic modal oper addit interact axiom halpern mean inform agent moment hold moment agent hold system perfect number timelin agent consid stai time axiom synchroni learn axiom interest interact applic area interact effect dynam logic mean inform agent action result agent action result agent highlight desir framework der hoek similar synchroni perfect recal axiom note translat view translat interact logic combin modal logic tradit axiom schemata provid extens basic modal logic modal logic accommod axiom schemata translat approach find satisfi preserv combin basic modal logic modal oper simpl interact modal logic axiom schema relat translat approach predic symbol access relat axiom schema formula formula interact cover exist decid result subclass logic modal logic formula belong skolem class uller class case translat approach termin procedur combin interact modal logic addit effort obtain gener boundari decid combin interact modal logic result impli modal logic satisfi access relat modal logic axiom schema combin logic undecid gener framework previou section intend highlight potenti framework base combin modal logic point provid framework accompani tool problem approach problem shortcom provid workabl solut research direct proce number combin modal logic assess appropri combin modal logic suitabl foundat framework decid make practic verifi execut agent assess necessarili requir avail implement theorem prover combin modal logic develop suitabl calculu section prove possibl termin comai logic final implement calculu accompani requir data heurist techniqu theorem prover bear mind make effort number combin modal find gener approach interest gener principl gener framework combin modal logic approach standard method modal logic level give account combin modal logic kripk tarski style semant easili combin modal system algebra semant gener support equat kripk semant develop tableau method correspond semant approach provid perspect detail correspond proof theori modal logic origin develop term axiom schemata approach appli equal combin modal system axiomat present mean axiom readili understand proof carri simpli substitut formula axiom schemata appli modu ponen rule rule provid practic infer system present suit develop infer pure analyt tradit approach framework specif design handl combin modal logic exampl framework fibr translat approach approach approach involv extend normal form develop repres tempor logic modal tempor tempor logic modal logic formula basic approach rule separ deal proof rule relev logic make inform pass part fisher approach interest recent combin translat approach combin tempor logic modal tempor aspect remain modal translat classic logic tool combin modal logic prospect practic tool reason combin modal logic incorpor answer instanc combin modal descript power effici system exist good exampl fact dlp implement effort support reason method section clausal resolut base approach resolut base theorem prover tempor logic modal logic base develop extend work strategi effici proof rule develop tempor logic order deal interact combin modal logic function practic vehicl face issu complex complex result count favour feasibl combin modal reason shown simpl combin modal simpl interact axiom yield undecid posit number exampl express fragment procedur viabil reason combin modal logic depend combin modal interact axiom obviou reduc complex logic languag restrict syntax call layer layer modal logic layer modal logic special kind combin modal logic restrict nest order modal languag typic layer restrict requir tempor modal lie scope spatial modal repres spatial tempor constraint vari space spatial relat common natur kind constraint common express power restrict formal expect restrict combin modal formal layer reduc express power extent lose hybrid section strictli layer account nice comput capabl repres wide rang topolog relat case languag restrict tempor oper lie scope spatial oper result intuit natur languag spatial make statement form overlap form part time satisfi properti decid problem result relat result show undecid combin modal logic immin interact logic attract featur modal logic lost case import argument effort invest develop theorem prover modal logic provid straightforward procedur translat approach ensur termin refin resolut concentr research identifi combin interact modal logic abandon simpl expect combin modal logic interest applic acknowledg deal undecid combin modal modal logic make advantag compar logic logic task note translat approach partli diminish import question develop theorem prover concern refin resolut ensur termin translat modal formula sound complet calculi full logic translat approach fall back full logic feel combin modal logic work descript practic formal meant retain decid essenti kei aspect research area extens express power retain decid work agent research attempt interact lead undecid decid import assess interact relev applic studi procedur interact kei strategi structur separ reason task develop heurist strategi guid proof essenti decid decid fragment complex high includ interact summari idea combin logic offer object justifi logic combin systemat establish bodi result techniqu grow bodi work explor comput autom comput scienc overli critic reaction order receiv attent wider commun research interest knowledg capabl combin modal logic superior formal direct demonstr applic survei express comput properti potenti applic larg class combin modal logic ai system design refer de rijk spatial reason imag retriev intern workshop descript logic page link op de de rijk prefix resolut method modal descript logic intern confer autom deduct artal franconi tempor descript logic reason action plan journal artifici intellig artal franconi repres robot domain tempor descript logic journal artifici intellig engin analysi manufactur artal franconi tempor model descript logic intern confer conceptu model artal franconi tempor descript logic handbook time tempor reason artifici mit press modal theorem equat viewpoint journal logic theori resolut research report ur robinson handbook autom reason steven transpar access multipl bioinformat inform overview sixth intern confer intellig system molecular gabbai fibr semant tableaux proc pp bennett modal logic qualit spatial reason bulletin interest group pure appli logic url html bennett logic autom reason spatial relationship phd school comput abstract postscript de rijk modal logic fisher resolut method ctl tempor logic journal theoret artifici intellig de lenzerini decid queri constraint seventeenth acm sigact sigmod sigart symposium principl system page de rosati descript logic framework inform integr intern confer principl knowledg reason page morgan chella modal logic introduct cambridg de giacomo tableaux algorithm proposit dynam logic thirteenth intern confer autom deduct number lectur note artifici page dixon fisher clausal resolut logic interact time knowledg wooldridg resolut tempor logic knowledg journal logic dixon search strategi resolut tempor logic thirteenth intern confer autom deduct volum lectur note artifici page dixon tempor resolut search algorithm annal mathemat artifici dixon remov irrelev inform tempor resolut proof journal theoret artifici na del quantifi modal logic unif theori technic report lsi paul resolut procedur robinson handbook autom finger gabbai ad tempor dimens logic system journal fisher develop clausal resolut tempor centr agent research depart comput manchest metropolitan dixon clausal tempor resolut acm transact comput fisher resolut method tempor logic twelfth intern joint confer artifici intellig page august morgan kaufman fisher normal form tempor logic applic execut journal logic juli fisher implement system direct execut intern joint confer artifici intellig morgan fisher program delib agent intern joint confer artifici intellig morgan vardi reason knowledg mit gabbai fibr oxford logic guid oxford schmidt procedur extens advanc modal logic guard fragment transit relat annual ieee symposium logic comput scienc ieee comput societi halpern vardi complex reason knowledg extend abstract annual acm symposium theori page halpern vardi reason knowledg time asynchron system twentieth annual acm symposium theori page halpern vardi complex reason knowledg synchron system technic report rj ibm almaden research san april halpern vardi complex reason knowledg time lower bound journal comput system van der vardi complet axiomat reason knowledg halpern shoham proposit modal logic time interv journal acm complex transfer modal logic ieee symposium logic comput scienc ieee comput societi horrock fact system de autom reason analyt tableaux relat intern confer number lectur note artifici page horrock express descript fact principl knowledg sixth intern confer page morgan kaufmann san june horrock fact intern descript logic workshop horrock sattler descript logic transit role role hierarchi journal logic fisher normal form proof combin modal tempor logic intern workshop frontier combin system schmidt issu decid descript logic framework resolut intern workshop theorem prove lnai springer schmidt resolut test modal satisfi build model sat special issu journal autom procedur subclass logic phd universit de schmidt class revisit intern confer autom deduct lnai page schmidt relat resolut tableaux proof system descript logic intern joint confer artifici intellig page morgan de rijk hybrid logic linguist infer prepar highwai danger zone journal logic wolter simul transfer result modal logic studia van van der hoek ch meyer motiv agent intellig agent ii system resolut part proposit logic lectur note comput moor formal theori knowledg action read plan calculu tempor logic phd universit de ohlbach translat method modal logic journal logic de rijk gabbai encod logic classic logic robinson handbook autom elsevi scienc ohlbach schmidt function translat frame properti modal logic journal logic dlp system descript de collect paper intern descript logic workshop page rao georgeff model agent proc morgan rao procedur proposit logic workshop agent page august solomon grail concept model languag medic terminolog artifici intellig renz nebel complex qualit spatial maxim tractabl fragment region connect calculu sattler concept languag extend kind transit role deutsch ur number lectur note artifici page springer schmidt modal translat resolut phd universit de schmidt decid resolut proposit modal logic journal autom schild combin terminolog logic logic confer artifici intellig van benthem modal correspond theori phd mathematisch amsterdam van der van jj ch meyer integr modal approach ration agent technic report depart comput de ch wolter zakharyaschev tempor descript logic fisher proof method tempor logic knowledg belief journal appli wooldridg jen intellig theori practic knowledg engin
IR/185 5 experi guid web server select maria catherin ann ellen comput scienc usa comput scienc christian brother usa colleg georgia usa abstract examin commun paradigm improv client perform access replic multimedia object support dynam select server group server provid content select client experi improv perform kei issu method maintain perform inform server select explor past perform experi predict futur perform conduct work context custom web prefetch applic call examin varieti algorithm select server past perform find averag weight averag algorithm closest optim perform addit work implic network behavior applic gener network traffic automat techniqu present applic reduc network server potenti improv perform interact applic result reach perform obtain interact applic web server past experi introduct client request multimedia object includ server world wide web experi larg variat import perform transfer bandwidth access delai variat differ network network server capabl server util inform found singl client choic toler perform server deliv inform replic client potenti improv perform make care select server paper present approach improv client perform access replic multimedia commun paradigm term denot paradigm refer servic provid group server refer group server provid forecast weather seattl client issu request group architectur resolv pick server return ident server client resolv inform perform server group inform predict server provid perform current request previou work defin architectur examin hybrid method maintain perform inform resolv explor altern method maintain server past experi techniqu inform obtain time access server predict futur perform includ past experi metric mainten evalu method suitabl past experi attract perform inform obtain normal inform addit overhead work support part nsf career award reu supplement nsf career award examin past experi context custom web prefetch applic call prefetch object web user interest applic user group user explicit web locat keyword search page relev user interest prefetch web page includ imag store user local file system user avoid network delai access prefetch object local disk storag specif collect data chang fairli quickli time exampl includ stock weather forecast traffic report prefetch inform period return web server obtain updat inform period access server server ideal opportun experi guid select paper present perform evalu resolv algorithm applic server group algorithm pick server server shortest network rout server averag server initi shortest access server smallest move weight recent histori weigh heavili distant past find averag move weight averag algorithm perform close optim server shortest initi access time perform true gener server network load invalid initi measur predictor server period revisit server updat access time measur predict desir server perform import applic import applic automat gener network traffic behav wai select server quickli provid reduc network server load earlier work client improv perform client select server balanc load network path server behavior reduc burden interact client result studi reach perform obtain interact applic remaind paper organ section explain describ outlin section describ server select algorithm studi present perform group server relat work discuss section mention direct futur work section conclud section applic provid background paradigm architectur describ custom applic base interest explain applic architectur overview origin defin ip network layer servic stateless effort deliveri datagram prefer serv ip address identifi group host host group sender satisfi interact host sender request interact send datagram ip address group destin address field datagram rout router host identifi address work adopt gener view commun paradigm analog broadcast multicast commun paradigm refer servic provid group server origin view provid servic definit examin provis servic ip ip address import metric maintain network layer limit motiv approach support hing ip support make domain uniqu identifi collect ip constitut group function servic map ip address import featur requir modif network layer oper design center resolv perform ip address map client interact resolv basic cycl illustr figur client gener resolv process queri repli kei featur system presenc metric perform data server perform data select server base perform criteria filter resolv client provid mechan appli criteria select server applic client domain specif client filter ip address server filter group metric info queri resolv filter figur resolut cycl custom web prefetch applic prefetch multimedia object world wide web user interest store prefetch web imag frame user local file system user avoid network delai access prefetch object local disk storag prefetch applic research effort reduc network delai addit prefetch page specif user explicitli server provid data exampl potenti server includ provid stock weather intern note assum server group exact user function return similar data satisfi user amount data network rout network load vari server group vari time server defin group collect server domain case servic map host domain alia obtain ip address case requir addit dn server lookup interest variat scheme user express prefer base web page return polici inform metric inform select server identifi web page prefetch applic retriev web page store user local file system fetch web page identifi multimedia object imag identifi hyperlink web page applic prefetch multimedia object hyperlink store page continu retriev store object reach depth user characterist applic lead framework specif wai collect perform inform server handl applic prefetch request perform data resolv resolv client maintain perform inform basi share perform inform proxim client anticip differ user prefer place limit share provid interfac user defin modifi set server make group past experi motiv observ user make server select past perform find server avoid server time past experi method attract collect perform data free server network modif requir collect past experi data free piggyback request data request issu user method applic frequent return group fetch inform gather experi data past experi server select contrast previou architectur hybrid method maintain server metric perform present perform result experi perform experi set server provid todai leo weather forecast citi seattl tabl inform server group tabl includ geograph locat server number network hop rout path client georgia tech determin rout path chang data repres snapshot path length point time default entri count figur show domain involv network rout path server seattl weather path includ multipl hop domain figur overlap network server support servic provid graph network topolog group show overlap network path evalu server select configur applic visit server regularli collect perform inform inform determin perform applic select method tabl show perform statist total data server time byte measur begin client send request socket end client receiv byte request data server time byte repres total time transfer page document interv begin client initi server connect end byte file receiv time byte includ extra process time fetch frame page hyperlink measur throughput period data includ connect setup process overhead interv data transfer correspond fetch page frame hyperlink throughput calcul total data transfer divid sum transfer transfer interv time send request socket receiv byte data statist tabl collect period dai februari applic ran sgi origin fast ethernet network connect server visit approxim server locat hop time time count byte byte throughput leo canada usa redwood usa usa usa usa santa usa usa redwood usa usa usa todai histori australia usa santa usa usa usa usa finland seattl weather santa usa usa usa usa tabl server group figur network topolog seattl weather group minut applic collect server measur fail measur gap hour tabl server measur select algorithm present detail select algorithm experi evalu algorithm metric discuss time time byte throughput repres perform measur throughput server measur server label denot number server group measur past behavior histor valu algorithm select server ffl server perform group min ffl move weight server smallest move weight averag server comput ff constant algorithm weigh recent measur heavili calcul averag perform ff paramet weight recent valu ffl visit server server minimum time maximum group time min ffl hop server smallest hop count client machin measur collect note snapshot inform accur rout path chang length ffl round select server round robin fashion server chosen data retriev mod server ffl includ choic choic made choic determin base collect data server minimum averag algorithm make static server select minimum algorithm visit server start execut make perman choic server averag algorithm server averag initi choic base measur server server choic rare averag algorithm perform minimum averag algorithm improv period revisit server updat perform measur server select base time byte algorithm hop ct opt avg min rr averag varianc maximum minimum figur time byte group algorithm abbrevi hop weight averag paramet ff ff round robin bar algorithm repres maximum minimum time measur made algorithm algorithm hop ct opt avg min rr averag varianc maximum minimum figur time byte group measur round robin algorithm scale graph includ averag varianc maximum throughput algorithm hop ct opt avg max rr averag varianc maximum minimum figur throughput group number domin varianc valu visibl graph algorithm hop ct opt avg max rr figur show averag throughput group perform result present measur perform resolv algorithm measur section gather period dai server visit approxim time interv approxim minut applic ran sun workstat solari oper system gap measur correspond applic fail restart group hop count present tabl except web page chang slight path collect data server regular perform complet set measur perform result includ measur made algorithm execut discard measur valu atyp avoid skew result unusu long access time reflect server temporarili unavail result present discard top bottom ten percent perform measur calcul valu evalu metric figur show perform resolv algorithm group time time throughput metric graph show maximum minimum server perform throughput varianc domin figur show throughput valu server easier time byte throughput algorithm includ measur complet data transfer time byte measur time client receiv byte data time byte metric result good predict perform select server base averag algorithm move weight averag algorithm ff paramet produc perform close avoid larg maximum valu maintain low varianc metric consist time byte metric exhibit larg maximum valu varianc round robin throughput metric exhibit larg varianc metric sensit variat network server load make difficult predict server perform futur transfer remaind time byte metric make predict resolv algorithm evalu algorithm compar perform algorithm optim perform calcul optim perform visit server time interv complet knowledg pick server current transfer optim algorithm gener server network traffic basi evalu perform practic algorithm practic altern optim scheme reli past experi includ round robin hop count round robin simpli switch server visit server equal number time hop count static algorithm select server base sole network rout distanc server figur show time byte perform todai leo seattl weather server group figur show gener poor perform round robin hop count algorithm round robin algorithm altern experienc mix worst high varianc server network round robin scheme perform poorli respect optim hop count algorithm closest server necessarili good nearbi server network path server highli result poor perform result consist observ algorithm reli past averag algorithm perform fairli group averag algorithm maintain run averag server recent valu equal weight older algorithm server group lowest time byte averag algorithm perform close optim gener small varianc maximum valu higher optim algorithm case suggest averag algorithm make poor server choic rare varianc show effect time byte algorithm hop ct opt avg min rr averag varianc maximum minimum figur time byte todai histori group algorithm hop ct opt avg min rr averag varianc maximum minimum figur time byte leo group algorithm hop ct opt avg min rr averag varianc maximum minimum figur time byte seattl weather group time byte alpha algorithm avg opt averag varianc figur evalu ff paramet move weight averag server averag optim algorithm includ comparison show perform rang small ff valu choic ff valu larg small hurt perform alpha algorithm avg opt averag varianc figur evalu ff paramet move weight averag leo server averag optim algorithm includ comparison appropri small valu move weight averag algorithm perform averag algorithm perform move weight averag algorithm sensit choic ff paramet algorithm assign greater weight recent server measur calcul weight averag decai recent measur reflect server network expect algorithm perform averag assign equal weight server measur illustr effect chang ff paramet figur show time byte perform result leo group perform move weight averag algorithm varieti ff paramet graph includ perform averag optim algorithm graph show rang small ff paramet perform optim ff paramet larg small hurt appar place emphasi recent perform valu compar longer experi import question futur work develop scheme ff paramet group figur show time byte perform ff ff rang optim valu graph optim ff weight averag algorithm ff paramet perform averag algorithm leo perform weight averag algorithm averag algorithm minimum algorithm perform group studi visit server singl perform measur make static select server receiv futur request group select algorithm produc perform close optim figur server network load occur period initi measur longer good predictor server perform approach revisit server period updat minimum perform valu experi revisit server group found perform perform optim period revisit server relat work server resourc find problem subject investig decad relev work recent paper address server select measur client carter consid select base primarili characterist path lead server acknowledg desir server load inform guid server work address issu limit experi recent paper incorpor server load select work monitor time request client time select server satisfi subsequ request data collect driven client request algorithm probabilist weight base averag time measur algorithm compar favor select closest server limit set experi work al monitor time request measur select server time measur time goal minim time work select probabilist algorithm similar approach refresh algorithm refresh algorithm combin data client request probe access server recent measur reach expir time algorithm compar algorithm studi probabilist refresh algorithm compar favor altern limit set experi paper suffer lack justif client make repeat close space server experi collect data optim fresh result observ practic applic access data justif frequent request server experi request space time occur wider varieti perform metric interest user servic locat work group ietf develop protocol facilit discoveri select network servic emphasi architectur perform studi futur work short extend work evalu perform scheme multipl client access direct request past work multipl client client improv perform client select server balanc load network path server longer plan investig share inform user close geograph proxim user express prefer server data format input resolv algorithm present perform result algorithm past experi select server group algorithm pick server server shortest network rout server averag server initi shortest access server smallest weight recent histori weigh heavili distant past evalu algorithm prefetch applic prefetch inform period found multipl server examin perform potenti import user access multimedia inform found time byte metric easiest predict avoid larg maximum valu maintain low meet goal good predict perform metric time byte metric exhibit larg maximum valu varianc throughput metric exhibit larg varianc metric sensit time byte variat server network load make difficult predict server perform futur transfer time byte found averag move weight averag algorithm consist produc averag perform close optim move weight averag studi sensit ff found perform rang small ff paramet ff harm perform weigh recent perform heavili heavili minimum algorithm gave close optim perform server network load invalid initi measur basi server perform predict period revisit server obtain updat perform measur desir comparison includ algorithm due heavi network server burden requir collect data practic altern collect past hop count round robin perform significantli algorithm past perform select server group refer layer infocom server select techniqu improv time replic infocom rfc novemb latenc bandwidth problem www inform common crovella server select ieee workshop architectur implement high perform commun subsystem august algorithm replic web workshop internet server perform carter select dynam path infocom carter server select bandwidth probe tech rep comput scienc boston web server tech rep depart comput york locat rfc june
Agents/186 1 system monitor student navig instruct web site claudia comput scienc american pari pari franc abstract grow commun level educ materi form document case creat web paper explor issu relat design softwar system aid teacher monitor student site proactiv student navig site connect function import topic current applic technolog educ discuss firstli definit set criteria evalu appropri hypertext technolog vi à vi classic support materi textbook issu util accept proactiv user interfac interfac agent person assist agent multi agent system capabl monitor student navig instruct web site introduc basi discuss topic system gener set indic evalu made hypertext multimedia tool indic cognit support proactiv user interfac tutor multi agent world wide autonom interfac digit xml introduct research paper year experi teach introductori level classroom provid major lectur note student hypertext format type materi advantag student review subject cover class conform distinct reason style follow link hypertext compar classic sequenti textbook teach student heterogen case american pari monitor student coverag materi pathwai follow hypertext document time consum address start research design system capabl monitor student navig hypertext materi system intend full advantag high level interact made electron media classic textbook concept base system basi relat exist concept introduc page web student whilst record activ perform inform concept relat increment suppli author web site paper describ design respond requir effici monitor instruct web site system overview system includ professor agent tutor agent student professor agent interfac human instructor perform main manag materi interrog tutor agent find student subject cover perform benchmark updat student inform tutor agent skill consid acquir student tutor agent maintain student descript part part static suppli student part dynam gener tutor agent level qualiti coverag term topic examin student successfulli complet attempt tutor agent student descript main respond professor agent request student statu determin suggest path materi part student descript student specif tutor agent suggest futur activ interfac system student dynam build hypertext page present student tutor indic suggest tutor agent interact poll order exchang inform fruit pathwai perform benchmark easi hard topic seldom inform student inform human instructor strength weak structur focu relat work main focu research exploit structur annot multimedia featur work concentr integr web base present technic tool internet softbot uniform interfac internet resourc facil system concentr combin graphic sound order support multimedia distanc learn environ project intellig agent implement virtual research laboratori integr physic distribut hardwar softwar resourc design system present import aspect autonomi anthropomorph system natur agent compon specif object achiev repres user system autonomi displai abil perform action explicit request user possibl asynchron respect user activ tutor agent queri whilst user surf anthropomorph due choic present result tutor reason present set dynam modifi navig menu choic suppli anthropomorph interfac complet anthropomorph featur charact motiv system design respond main hand aim facilit monitor activ instruct web site hand support activ proactiv suggest path site relat link goal reflect import issu current applic technolog educ human firstli definit set criteria evalu appropri hypertext technolog vi à vi classic support materi textbook issu util accept proactiv user interfac interfac agent person assist agent versu classic materi materi present form media materi present classic book fashion answer distinct made mean inform destroi earlier free kind constraint case media mean present inform integr move imag order evalu advantag technolog present characterist exploit evid util gain observ student advantag facil system aim monitor indic student visit site surf deviat main suggest path inform made student student access complementari suggest link indic instructor gener inform coverag student user interfac accept briefli introduc system aim provid proactiv user interfac capabl support student navig instruct web site classic user call direct manipul interfac respond specif request user act explicit interfac object system base proactiv interfac interfac gener base notion indirect manag user explicitli action autonom initi activ plai proactiv role note proactiv interfac integr classic direct manag mean user initi request direct manipul interfac respond extend perform activ respond request web tutor basi inform collect activ suggest path site inform student relev materi student awar order plai activ tutor agent autonom action user materi relat user queri tutor agent defin success tutor agent manag inform user order tailor action specif user surf tutor agent learn user tutor agent interfac agent defin autonom interfac agent defin live debat ongo interfac main question interfac agent significantli reduc workload cognit support interfac agent present inform tool user fashion effici resourc stimul autonomi accept user accept agent autonom user reassur level control privaci point interfac agent user anthropomorph associ anthropomorph characterist interfac agent compar studi indic report student follow tutor suggest relev suggest type evalu deviat predefin path web site suggest page connect link current page relev evalu note suggest absolut legal term tutor reason fact agent produc suggest essenti base structur inform collect surf histori prefer deviat predefin path gain knowledg tutor agent modifi reason strategi order adapt student data collect user reaction strategi strategi evalu verifi interfac agent aspect discuss section cognit support level interfac agent give user resourc inform present access stimul user effici tutor agent achiev goal suggest student relev materi tailor level specif previou surf histori present type materi extern print uniform fashion cognit support indic measur student access materi explicitli requir suggest suggest note issu autonomi accept critic system paper agent act behalf user simpli gener suggest relev aspect commun user obtain system reserv small area bottom window commun user issu privaci open studi time featur foreseen system address topic regular updat student data record system login student summari record data directli edit inform anthropomorph design interfac chosen interfac suggest human characterist user explicitli present charact obtain simpli give textual motiv suggest fail topic boolean choic type interfac made effort balanc conflict requir hand demonstr anthropomorph interfac suit tutor system motiv student make feel comfort system presenc explicit charact agent characterist dynam system environ knowledg level reason main object design maintain maximum flexibl term type materi provid human instructor aim site system minim effort system design work limit html document provid identifi knowledg suggest activ case system html code build simpl graph describ link page page format present student tutor monitor advic simpl graph human instructor provid inform pathwai node exampl identifi concept develop page concept relat concept number level concept consid acquir inform provid tutor agent give advic student ideal site develop start definit fundament concept relat concept present web page site exist increment annot ad list hypertext materi environ system work web highli dynam dynam environ present work possibl inconsist inform imposs relat object environ record previou visit site inconsist descript updat meantim teacher base static relat object environ object relat chang life system approach successfulli appli manag highli dynam environ knowledg level reason approach exist part system reason environ worri lower level detail tutor agent assess concept cover concern concept present student present hand present relev assess exposit concept suit student physic displai web page requir implement level detail creat level descript environ reason level manag dynam transpar layer knowledg level reason typic delib agent system adapt user guid student instruct materi matter specif topic gener experi knowledg base interfac agent make type domain knowledg structur web knowledg user human instructor form inform success suggest basic human tutor tailor specif tutor agent system mimic mechan modifi strategi guid suggest user strategi knowledg tutor agent updat reason mechan basi observ user direct user input request human instructor strategi chang materi rate type present suit student type altern materi state descript inform rel materi conceptu layer highest call concept defin xml vocabulari specifi deriv gener specif relat requir concept present lower level resourc materi relat comput network concept local area network deriv gener concept specif concept token ring relat wide area network present element concept descript creat direct connect concept level descript present descript present site page resourc onlin present layer descript defin xml vocabulari present element sourc type locat site node extern entri librari present introduct full present complex target comput scienc commun present concept singl page site includ present element lowest site repres structur graph format vocabulari xml compliant markup languag base structur graph captur web site state descript section suppli gener inform student specif interest section call modifi run time system updat student dynam student descript annot partial copi descript surf histori annot recapitul coverag concept successfulli indic earlier paper deviat standard access extern option sound video futur work avail tool enabl easi effici creation grow commun teacher experi document support classroom time effort develop system burden monitor guid student digit evalu effect type materi paper major issu requir involv develop system relev inform gather order evalu materi defin problem relat accept system relat flexibl requir order teacher continu updat design interfac suitabl specif implement base intend continu project complet implement initi trial possibl fall semest open issu press relat annot digit materi integr site refer al lifelik comput persona project softwar agent aaai mit press media kill world press review june design agent peopl softwar agent aaai mit press interfac commun juli agent orient softwar handbook agent technolog bradshaw editor press user person art interfac design interfac metaphor softwar agent aaai mit press autonom interfac acm confer interfac march structur graph xml metadata describ web site comput network isdn system agent reduc work inform commun acm experi learn person commun acm direct manipul digit alfr knowledg artifici intellig peopl interact softwar agent aaai mit press virtual train laboratori intellig int journal continu engin learn softwar knowledg engin review cambridg wl pedagog agent intern confer autonom pp direct step program ieee comput direct manipul versu path softwar agent aaai mit press multimedia asynchron network educ multimedia dynam sequenc anim pedagog nation confer artifici intellig aaai
IR/187 5 theori term weight base exploratori data analysi warren comput scienc depart amherst abstract techniqu exploratori data analysi studi weight evid occurr queri term support hypothesi document relev inform relationship document frequenc weight evid investig correl document frequenc normal collect size mutual inform relev term occurr uncov correl found robust varieti queri set document collect base theoret explan efficaci document frequenc term weight develop differ style content theori put theori predict idf low high frequenc result improv retriev perform alter idf formul test trec queri set retriev result corrobor predict improv retriev perform argu exploratori data analysi valuabl tool research goal develop explanatori theori inform retriev introduct spark jone demonstr document frequenc effect weight queri term formul document frequenc plai kei role inform retriev research paper theori document frequenc effect develop approach drawn differ theori put emploi techniqu exploratori data analysi weight evid favor relev offer queri term occurr studi result explanatori theori document deriv observ statist regular extens retriev data work report phase larger research project goal develop retriev formula compon formula direct interpret term measur statist characterist identifi retriev object support care observ studi empir permiss make copi part work person classroom grant fee provid copi made distribut profit commerci copyright titl public date notic copi permiss copi post server redistribut requir prior specif permiss fee australia fl acm yield retriev perform current state art retriev system goal work primarili product improv retriev techniqu princip object retriev procedur deriv explanatori theoret model support hard empir evid phase studi center relat frequenc term occur collect abil discrimin relev document document frequenc analyz independ term frequenc document fact factor construct effect term weight review concept weight evid exploratori data analysi context articl pertain research report continu review research specif relat util document frequenc weight queri term emphasi combin match initi croft work al term present empir studi retriev data analysi data lead mutual inform term occurr relev natur measur queri term qualiti conclud measur correl document frequenc deriv theoret explan support idf weight theori theori conjunct empir predict modif idf formula produc improv perform section present experi corrobor predict return research summar section compar contrast work present weight evid weight evid good formal defin weight favor provid log concept import probabl good elucid natur desiderata formal notion weight includ properti state weight favor hypothesi provid piec evid equal weight provid piec weight provid piec condit observ calcul subspac start good show constant weight evid form eq directli log log final belief hypothesi relev equal initi belief weight evid present attract scale weight accumul entir rang weight evid inform retriev robertson jone term weight discuss section motiv desir determin relev condit term occurr pattern document eq view differ weight evid favor relev provid occurr term focu statist infer base logist regress probabl event interest transform exploratori data analysi defin exploratori data analysi state data analysi advanc adher principl skeptic data summari enlighten characterist phenomenon investig open unanticip pattern uncov pattern event outcom analysi emphasi exploratori data analysi make graphic displai data human mind uncov pattern visual input list tabl number depend sole reduct larg quantiti data summari statist messag data embodi set method primarili john tukei techniqu data smooth variabl studi present articl relat work sparck convincingli demonstr weight queri term significantli improv retriev perform compar unweight coordin match rank weight formula approxim wsj log document frequenc term number document term number document entir collect probabilist explan letter journal robertson point view function probabl term sum weight interpret probabl mutual occurr multipl queri term provid theoret argument wsj robertson sparck jone present binari independ model term weight log probabl term occur relev document probabl document model depend avail relev feedback estim condit probabl base appli probabilist approach robertson sparck croft harper work formul log log goal develop probabilist justifi weight formula retriev set absenc prior relev feedback make inform relev document assum queri term equal probabl occur relev term occur document estim proport document term entir collect combin match log deriv determin term occur relev document compon essenti high frequenc term robertson walker recent anew combin match point weight probabl term occur relev document probabl term occur collect assum neg valu high frequenc term anomali modifi assumpt equal probabl occurr rel favor assumpt probabl start point reach term document examin greater detail assumpt lead combin match weight modif robertson walker origin notat author discuss section replac notat paper hope facilit comparison includ approach present term seri paper salton report theoret empir work rank formula base call term earlier term defin term defin log quantiti yield weight robertson sparck jone form adopt amount differ term model assum linear function chang slope function chosen base assumpt user pick term properti obtain random perfect sustain solid theoret argument probabl occurr condit relev perfect random term function document frequenc regress regress strategi assum model appli statist techniqu fit model data fox multipl regress analysi deriv equat predict probabl document judg relev queri yu linear regress determin paramet set binari model fuhr bucklei error criterion determin coeffici polynomi weight function pair descriptor variabl group berkelei conduct extens research logist regress logist regress gener consid natur approach estim probabl rang assum probabl correspond regress account logist regress normal assumpt statist infer techniqu standard regress analysi inappropri dichotom variabl return discuss benefit appli exploratori data analysi select potenti statist model regress techniqu appli weight approach work term weight center probabl relev prior term salton experi discrimin term measur import term distinguish document collect inform theoret earli inform theori deriv weight base ratio wong yao develop term weight theori base entropi term distribut collect show idf weight easili deriv special case gener weight scheme restrict attent term weight base probabl relev trec data analysi section present retrospect analysi inform retriev data analysi undertaken specif gain insight relationship document frequenc queri term expect term evid favor relev studi involv data queri text retriev confer press document trec volum data point correspond queri term queri term concept field trec topic uncov underli statist set qualiti queri term minimum data analyz bin data plan queri term plot problem immedi present rare term count variabl function log count translat infinit problem add small count instanc estim ad count choic larg arbitrari slightli choic constant give pictur data low frequenc end object infer approach inadequ varianc variabl interest rel effect hope uncov left figur plot log term finit order confront data point group bin bin convert singl averag count calcul result plot bin size found plot bin left figur shown figur focu bin plot plot displai alongsid order reader feel raw data point count repres version plot data lead croft harper formul eq data analysi begin compon correl document frequenc hope compar document set differ prefer plot data term absolut document frequenc plot df figur function figur function figur histogram log figur function log figur function log figur log function log probabl term occur document chosen randomli collect occurr document respect figur approxim return analyz detail occurr relev document interest figur show plot function scatter plot document frequenc probabl term probabl term occur relev document small plot reason question assumpt equal probabl term occurr relev basi eq put question assumpt made assumpt start point linear contradict evid provid figur return discuss point section glanc graph suggest variabl histogram shown left figur confirm distribut document frequenc highli skew type logarithm transform found benefici step variabl log log practic typic document frequenc queri differ log log neglig develop gener log prefer scale due symmetr treatment probabl histogram figur show distribut variabl log interest log log motiv knowledg statist indic term function log figur plot show continu document frequenc smaller fact obscur bunch point origin plot rel transform independ directli make hard phenomenon interest condit probabl occurr higher high frequenc term high frequenc term gener great occur relev document obviou high frequenc term compar low frequenc term interest term occur relev document compar found arbitrari document collect figur show plot ratio function log observ clear ratio aid intuit logarithm paper logarithm base document frequenc plot evid queri term relev document collect relev document correl document frequenc appar exponenti natur correl call logarithm investig log ratio figur log ratio plot logarithm odd occurr collect ffl roughli linear log log ffl stronger linear relationship appar document frequenc log ffl appar flatten growth high low frequenc number comment order clear pattern emerg difficult attribut chanc regular corrobor inspect data collect includ trec volum author relationship report inform retriev literatur appar flatten curv extrem support theoret note assum probabl relev entir collect approxim thousand log conclud growth log ratio observ log log sustain small document frequenc reason assum growth begin taper log approach log argument similar high frequenc end safe assum queri high frequenc queri relev document arbitrari document collect greater logarithm greater conclud log expect posit document rate descent taper point reach approach asymptot log odd occurr term occur reason entertain hypothesi level observ rightmost point figur observ plot collect level occur higher flatten suggest point question attribut chanc happen ap averag probabl relev queri note log log log connect inform theori refer mutual measur variabl depend inform retriev comput linguist import measur inform event provid occurr measur inform relev provid occurr queri term adopt object worthi attent measur term ir research main focu analysi mutual inform idf show gener relationship observ log df explain document frequenc expect produc good retriev perform term weight interest paper model weight evid favor relev provid occurr queri term occurr queri term posit evid absenc neg evid assign nonzero score term score denot measur evid favor relev term occur document absent base formal definit weight evid mutual difficult show express log log log log argu log log log reduc eq approxim log assumpt form base data lead understand idf weight made effort maintain level rigor argument attempt speak term greater goal explain base idf form expect perform conclud idf optim term make attempt estim optim figur similar plot collect lead expect valu approxim rang vast major queri term mind quantiti order magnitud consid neglig goal show roughli approxim log log assum small probabl occurr fairli larg rel probabl order magnitud shown log close log larg rel conclud log log reason requir knowledg relationship small probabl occurr greater data expect typic valu expect half log expect log conclud problemat queri term probabl occurr queri term sort rare queri term scarciti collect impli term weight major impact retriev perform deriv combin match weight formula depend approxim low frequenc queri argument depend heavili rel arbitrarili small fraction log log knowledg behavior support rigor maintain absenc big log big data show frequent log compon deriv weight approach idf formul factor perform close achiev small percentag queri term document log fall rapidli document frequenc ap bin data point effect ignor contribut log overwhelm effect import eq log queri term occur relev document collect present document random document entir collect found greater log compon minim effect idf approxim question abil infer data document frequenc order roughli linear respect log log casual inspect figur reason linear approxim plot log function log intercept close constant remain irrelev rank conclud idf idf log log produc good retriev perform improv idf shown accept empir assumpt queri term quantiti approxim assum roughli linear log show tradit idf formul perform argu section theoret empir give reason assum flatten end practic spectrum document frequenc assum form function map log involv flatten map exhibit similar shape accept hypothesi plot figur repres gener behavior queri term type queri collect expect improv retriev perform term weight formula account observ flatten test compar retriev perform version inqueri ir system task trec trec queri form word titl descript stopword duplic baselin system pure idf term weight idf log test system flatten version idf weight valu rate log log maintain constant term altern regress fit curv data figur logist regress deriv function log log valu data plan approach prematur stage research feel curv fit import interact account problem depend exist queri term queri term weight evid provid term condit term occur term greater gener accept interdepend queri term notic impact effect term weight made attempt model influenc term determin function estim test gener weight term low frequenc extrem approxim term high frequenc extrem result test summar tabl test version outperform baselin system term averag queri substanti test system outperform baselin system major queri queri set column number queri test system perform baselin column label result sign test queri set probabl test version outperform baselin queri system equal outperform column label analog probabl wilcoxon account size differ averag queri improv found level recal trec recal level trec recal level trec discuss shown strong empir support conclud function log roughli slope order magnitud explain document frequenc found term weight previou probabilist explan start plausibl priori assumpt probabl queri term occur relev document test idf log run test perform differ outperform test set avg prec baselin test diff sign wilcoxon trec trec trec trec trec trec tabl linear version idf review earlier effort light result report central combin match model croft harper assumpt constant term absenc pertin prior knowledg reason essenti applic laplacian insuffici avail larg number formul systemat judg volumin document pertin inform access inspect data suppli suffici reason assign unequ probabl base term document frequenc probabl suggest data vari wide rang log eq rang approxim treat constant vari half rang log stai virtual term studi log presum approxim log priori put theoret foundat combin match model question adjust combin match formula grow linearli intuit appeal time resolv anomali combin match model data confirm rise monoton greater portion document frequenc rang data posit assum lowest frequenc term small find restrict valu figur show fairli high frequenc term expect half relev document term model closest valid empir data shape curv predict model closest approxim plot shown figur function term model deriv assumpt queri term document frequenc linear combin queri term randomli chosen queri term document frequenc reason assumpt absenc pertin contradict data model result consid priori reason conceptu involv insight larg forc earlier research due hard avail extens retriev data invalu asset extend research seek appli statist techniqu regress analysi ir task research empir flavor data paramet estim member famili function chosen priori famili member select typic relationship interest model polynomi event linear function variabl exploratori analysi part initi research acquaint data order determin reason famili function base regress techniqu mention work report repres step extens research agenda major object lie ahead includ analysi model ffl effect queri term depend total weight evid explain section account systemat overestim ffl term frequenc sourc ffl document length sourc ffl distinct sourc evid class phrase simpl capit word lower case queri term term origin user queri optimist investig prove fruit acknowledg materi base work support part nation scienc librari congress depart commerc cooper agreement number support part unit state patent trademark offic advanc research project arpa order number issu contract number find recommend express materi author necessarili reflect sponsor refer hard inqueri retriev system confer expert system page kenneth william patrick donald statist lexic analysi uri lexic exploit resourc build page lawrenc erlbaum associ probabilist retriev base stage logist regress nichola peter mark annual intern confer research develop inform page june wm full text retriev base probabilist equat coeffici fit logist regress text confer page march nist special public croft harper probabilist model document retriev relev inform journal decemb croft xu stem word form fourth annual symposium document analysi inform page la april robert transmiss statist theori commun mit fuhr optimum polynomi retriev function base probabl rank principl acm transact inform norbert fuhr chri bucklei probabilist document index relev feedback data acm transact inform infer probabl relev method logist regress bruce croft van annual intern confer research develop inform page juli good probabl weigh evid charl good weight survei bayesian statist page donna harman overview text retriev confer text retriev confer page februari nist special public donna harman overview text retriev confer text confer page md novemb nist special public harper van rijsbergen evalu feedback document retriev data journal septemb frederick brian exploratori data analysi sage robertson term specif journal letter sparck jone robertson sparck jone relev weight search term journal american societi inform robertson walker relev weight relev inform nichola peter annual intern confer research develop inform page juli yu automat index term discrimin term measur inform process yu measur term import automat index journal american societi inform gerard salton michael mcgill introduct modern inform retriev statist interpret term specif applic retriev journal john tukei exploratori data analysi publish van rijsbergen inform retriev wong yao measur term specif journal american societi inform salton term weight inform retriev term model journal januari clement yu learn scheme inform retriev yve intern confer research develop inform page june
HCI/188 4 guid audio augment realiti system kent thad starner colleg comput atlant drive georgia institut technolog usa abstract paper present applic low lightweight augment realiti infrastructur system simpl wearabl comput rf base locat system plai digit sound user locat current state infrastructur implement game genr player move real world trigger action virtual game world present issu involv creat augment realiti game show locat infrastructur generaliz audio augment realiti keyword augment wearabl introduct paper present lightweight infrastructur augment realiti simpl wearabl comput tradit augment realiti system overlai graphic user system emploi audio creat posit infrastructur radio frequenc transmiss easi approxim locat comput overhead system creat complex tradit augment realiti system ar game develop prototyp infrastructur explor uniqu issu involv creat engag augment realiti audio environ present system person audio environ infrastructur creat audio ar describ prototyp applic describ user experi final present issu involv creat sound ar show infrastructur gener augment realiti system vari level user interact relat work guid voic explor design space previou audio augment realiti bederson describ relat nonlinear sound playback system trigger locat infrar beacon sound present provid detail real life artifact user observ system extend concept util state inform wearabl devic plai sound situat locat nomad radio util sound inform user incom messag event permit user control audio level audio aura explor displai ambient inform system provid hint inform content ambient sound burden user deflect user attent current task unnecessarili present inform guid voic explicitli engag user audio environ sound effect ambient audio exploit player locat histori plai contextu sound lightweight wearabl comput requir minim explicit user input augment realiti infrastructur augment realiti system consist posit system wearabl devic plai contextu sound user system carri simpl wearabl comput receiv locat inform transmitt environ transmitt send uniqu id limit rang creat small cell wearabl cell id infer locat current locat conjunct list visit locat order visit plai contextu sound augment realiti figur left insid wearabl devic show diamond rio tm rf pic microcontrol batteri close unit rf transmitt attach batteri user carri simpl wearabl comput track user locat control playback sound wearabl consist mpeg layer diamond rio tm digit audio microchip pic rf receiv pic decod inform rf receiv locat inform control includ select correct track start stop devic time pic track user posit time updat user state augment realiti inform select plai sound store player locat beacon consist pic rf transmitt beacon transmit uniqu id approxim rang transmitt limit creat small cell diamet feet larg depend antenna configur beacon low power beacon approxim year batteri eventu hope power beacon avoid batteri altogeth plan deploi beacon econom infrastructur gener gather locat inform varieti wearabl devic beacon system greatli reduc complex gather posit user augment realiti techniqu vision magnet track devic typic requir comput cover smaller rang beacon system creat infrar requir line limit area cover beacon flood entir area cell size room rf elimin problem creat small cell largest problem rf beacon technic standpoint error found player gener lot plai perform function transmiss beacon sourc error system design transmitt space bound area overlap complet locat coverag minim type beacon transmitt time singl byte uniqu id error detect correct techniqu design system send data order typic doubl amount data add extra byte error detect inform case techniqu greatli amount data correspondingli chanc transmiss system found simpl heurist wait updat posit id receiv suffici block error deploi system gener id space gener error scheme option game demonstr lightweight infrastructur decid implement augment realiti game game easi prototyp chang rule game adapt develop infrastructur game engag user player attent ar experi devic implement augment realiti set chose guid voic mediev world player wander wizard sound set present player explor environ pass dragon meet friend foe gather object game plai similar tradit game dragon tm player charact quest player directli interact comput graphic wearabl observ player action function game master game input player walk real world environ narr stori depend path player wearabl track player state check acquir object specif locat rich environ creat locat serv multipl plai role situat environ tradit comput game graphic advantag guid voic game plai move avatar comput world player physic move real world space aid player game plai peopl plai game simultan physic space creat real life social aspect game unlik pc base video guid voic bring peopl geograph locat game extend easili capit enhanc social interact natur game advantag player imagin draw game present render dragon player interact idea dragon sound element game design aid imagin process game plai plai guid voic user put headphon wearabl player enter game simpli area rf beacon set comput game beacon creat locat augment realiti beacon player pass enter space trigger sound clip game narrat clip explain player game plai player told embark quest rescu friend kidnap wizard narrat explain player explor mediev landscap encount friend foe travel world find virtual item battl enemi elf friend narrat explain plai user simpli walk visit site rf beacon mark real world small prop hint encount site player enter site wearabl receiv uniqu id beacon locat updat intern posit inform current game locat inform rule game select plai sound clip turn updat game state player start game item walk beacon mark stuf hear narr sound clip encount rat pick inventori player walk beacon repres knight narr sound clip plai player procur rat narr plai player knight steal player continu quest successfulli defeat enemi won item vital complet total quest player procur rat narr plai knight defeat player narrat explain player start quest instanc player find beacon repres friend virtual unlock door procur magic site state diagram show beacon present guid voic game space space logic control sound clip plai game state effect player rang beacon win path set rang path consist visit beacon visit beacon interact problem exist current implement guid voic result rang rf transmitt site transmitt wide rang compar small prop locat boundari transmitt appar user clear user rang trigger sound site result user inadvert enter site intend avoid fix problem modifi transmitt smaller rang site enter user beacon prop requir develop radio transmitt commerci solut result richer game plai incorpor time system game state updat player enter space sound plai immedi game redesign player inform enter space player leav stai trigger system updat game state plai sound locat figur state diagram guid voic box repres beacon environ text sound plai state augment realiti updat player enter site dragon hear heavi breath dragon cave player remain rang beacon wake dragon end fight player quickli locat narr stop player avoid encount dragon sound design challeng overcom sound design game goal sound design address kei issu creat narr audio space involv answer creat sound environ sound simpli record drawn sound effect match listen mental model sound import game lack visual cue sound effect match player mental matter recogn creation sound import set game world seldom sound tap cultur condit player make narr clear design challeng lai fact game nonlinear narr weaken artist control due fact user control narr flow special care content design stori element consist path game player action weav small narr element form larger stori addit potenti obstacl audio design game plai noisi environ player navig time plai game sound clear speech sound event ambient sound narrat feel game clear frustrat element ffl ambient ambient sound locat give player impress set echo water wind anim sound forest set ambient sound loud heard player overwhelm sound effect narrat fade slightli charact speak ffl sound sound effect present sound event rang knight ride dragon blow sound effect includ speech charact game world speech effect modifi reflect acoust set match player mental model ffl guid voic narrat reinforc element stem effect narrat game experi frustrat explain event obviou sound effect player di narrat inform player object overcom foe time plai narrat make clear player action kill enemi pick object import narrat voic distinct charact game narrat speech subject acoust set consist locat make narrat charact gener infrastructur prototyp locat infrastructur configur wai facilit form interact user environ control placement transmitt devic record beacon level privaci achiev sound determin user locat wearabl environ record inform state wearabl record presenc transmitt id order receiv mount transmitt player multipl player interact augment realiti state environ environ record id transmitt pass nearbi beacon respond differ individu user configur user share virtual world beacon network permit complex rich interact system audio directli trigger current locat system guid voic type transmitt wearabl user share physic augment realiti complet separ place transmitt wearabl user interact virtual world link person augment realiti addit infrastructur extend guid voic locat requir player cooper item type infrastructur environ track guid voic extend locat memori visit time user player action locat destroi player visit encount battl infrastructur link augment realiti user extend abil cooper compet user locat inform provid posit infrastructur pose privaci concern user augment realiti current guid voic configur environ transmit id locat inform local wearabl mount transmitt wearabl system user augment realiti track proxim user locat wearabl longer privat peopl physic present time place receiv user locat configur environ track user posit record inform pose greatest privaci concern peopl potenti queri environ user locat great deal effort make environ secur trust configur transmitt wearabl user select reveal infrastructur exposur add desir function select correct type infrastructur support augment realiti weigh concern privaci user locat ad function achiev creat low lightweight solut audio augment realiti prototyp game util demonstr infrastructur sampl applic requir special attent construct sound environ found layer audio sound effect import creat augment realiti game system implement game infrastructur creat configur support applic rang simpl reactiv audio tour guid rich system complex interact user environ acknowledg creation great sound broadband institut support refer sound novemb audio augment prototyp autom tour guid chi design auditori icon novemb design audio chi april sawhnei nomad scaleabl contextu notif wearabl audio messag chi starner kirsch locust swarm iswc octob
ML/189 6 rule induct approach model region pronunci variat host steven gilli walter daeleman cnt languag technolog group abstract paper describ rule induct techniqu automat extract phonem knowledg rule pair pronunci extract knowledg adapt speech process system region variant languag case appli approach northern dutch flemish variant dutch spoken part base pronunci northern dutch compar rule induct learn evalu extract knowledg quantit qualit relev conclud classi rule induct transform rule learn easili interpret introduct central compon speech process system pronunci lexicon de ning relationship spell pronunci word region variant languag di er pronunci speaker region speech input output system adapt pronunci lexicon region variant region pronunci di erenc systemat model rule design expert investig research partial fund project project tion process speci rule induct techniqu method proven languag engin extract linguist knowledg sampl corpu manual encod linguist inform prove extrem power method overcom linguist knowledg acquisit bottleneck di erent approach learn neural network connectionist approach learn van den approach yield compar result work daeleman van den bosch comparison made van linguist knowledg base approach approach pattern gener phonem di erenc dutch flemish techniqu aim extract regular implicitli data corpora repres northern dutch southern dutch variant northern dutch flemish frequenc inform corpu institut dutch syntact lexic inform word disc encod word pronunci list word form flemish pronunci word abstract lexic concret pronunci word form speech highli formal speech speech intermedi set phonolog rewrit rule deduc concret speech style abstract phonolog form initi phonolog transcript obtain convert correct hand encod scheme mean identi cation entri refer serv basi list word form word relev entri entri word form frequenc higher eld includ list frequenc word select explan method search overlap di erenc region variant dutch section quantit analysi result section discuss di erenc start set transform rule learn learn rule compar product rule produc present overview di erenc nal conclud remark rule induct start point assumpt di erenc phonem transcript flemish dutch highli repres set rule rule provid linguist insight overlap discrep variant adapt pronunci dutch automat flemish vice versa regular di erenc corpora make rule option make learn method linguist knowledg learn automat experi made rule induct error driven learn process transform rule learn compar corpu annot initi state annot correctli annot call order list transform rule learn order impli applic earlier rule make rule appli work schabe structur fail undergo rule consequ earlier rule rule appli output initi state annot order bring output closer rule consist transform iter learn investig rule mistak correct applic rule rule greatest error reduct retain figur show learn process appli comparison function task learn transform translat dutch pronunci flemish corpora serv input rule learn process result order list transform rule ect systemat di erenc rule read trigger phonem graphem graphem transform rule learn transform rule phonem phonem figur architectur learn process make commerci version gener classi er form tree tree classifi case start root tree move tree leaf node encount tree hard tree convert set product intellig user rule form side conjunct test side class note implement feed bleed ect rule due con ict resolut strategi ensur case rule appli experi made context phonem focu predict class case side rule top rule number train case cover rule number case belong class predict rule estim accuraci rule divid prior probabl predict class lift class present data align requir van den graphem phonem phonem spell word di er length phonem symbol align graphem written word form case phonem transcript shorter null phonem ll gap result step prepar consist extens set compound phonem graphem map word phonem repres problem solv de ning phonem symbol correspond phonem dataset consist entri omiss doubl transcript rst transcript word phonem repres word phonem transcript longer compound phonem corpu consist word form phonem disc phonem encod scheme disc phonem includ phonem creat phonem symbol occur divid corpu train consist data test part overlap word level phonem level observ test set dutch flemish conson highli overlap word con vowel tabl initi overlap en quantit analysi rst test rule induct techniqu learn adapt northern dutch pronunci flemish train number exampl learn systemat di erenc northern dutch flemish complet train set learn transform rule threshold error speci mean learn stop error reduct li threshold due larg amount train threshold chosen reduc train time result rule gure number transform rule plot accuraci variant number transform rule phonem word figur descript accuraci word phonem level relat number transform rule figur show rst rule lead perform word level high applic rule accuraci origin train set serv train set train data tree model product rule model built train case tree gave rise rule product rule appli origin test set experi order make type task compar transform base approach classi approach output class predict phonem ident phonem di er tabl overview overlap applic rule induct techniqu comparison result show evalu test rule learn higher error train half data word initi overlap applic transform rule phonem initi overlap slightli lower error rate vowel word con vowel brill tabl overlap en applic transform rule product rule case di learn brill rule predict di erenc word level di erenc phonem level rule reliabl dutch flemish qualit analysi concern linguist qualiti rule extract gain insight import di erenc pronunci qualit analysi rule perform rule list compar list present exampl vowel start point rst rule learn compar reduc error rate transform rule present relationship dutch import di extract corpora formul set easili understand rule product hand describ overlap phonem make hard clear overview regular di erenc variant dutch fact categori describ overlap discov chang default addit speci rule describ default condit prevent rule ring incorrectli conson di erenc conson level concern altern voic conson word dutch voic flemish word pronounc dutch flemish tabl matrix voic conson test corpu tabl show altern altern subject rst transform case word begin posit top ten product rule reduc error import rule describ rule lift qg class rule lift gg class import phenomenon word form subsequ transform rule make chang top rst part chang transform rule describ omiss phonem case graphem combin nr trigger environ prev ts surround ts ts tabl transform rule frequent di erenc conson level vowel di erenc vowel level dutch flemish concern vowel vowel en altern illustr show correspond vowel frequent differ flemish tabl matrix show flemish vowel dutch vowel compound phonem introduc ipa transform rule transit vowel vowel trigger environ word transcrib nr trigger environ graph ij cur graph graph tabl import transform rule di erenc dutch flemish vowel closer ten import product rule show ten rule describ transit vowel vowel rule lift transform rule learn highli overlap tabl rule concern phonem follow omit top ten rule describ phenomenon nr trigger environ prev au tabl transform rule lack presenc describ di erenc northern dutch flemish vowel make linguist linguist work de tendenc voic conson level vowel import di erenc northern dutch flemish discrep found transcript made flemish dutch subject dutch transcript experi gilli error analysi systemat phonem di erenc flemish number di erenc applic transform word make correct transit rule lead account rule undon rule schabe word transcript transcrib transform rule graphem learn result correct cancel back graphem lead origin su er similar consequ rule correctli classifi concern remain error applic rule make rule induct techniqu extract di erenc corpora lead base error manual analysi show explan remain error twofold rst reason rule frequent case rule induc basi sucient big frequenc ect lead rule frequent phonem phonem combin phonem consist transcrib exampl loan loan sound error rule case matrix vowel tabl tendenc vowel flemish lead number transform rule rule describ tendenc closer investig error commit show error concern wrong vowel error commit phonem incorrect transit transit vowel erron diculti altern voic conson account error phonem level convert order perform task closer comparison made error made made systemat di erenc error found explain higher accuraci conclud remark rule induct techniqu learn adapt pronunci region studi linguist aspect variat quantit qualit analysi phonem differ discov techniqu train order studi relationship pronunci rule induct learn studi accuraci note applic transform rule learn di erenc word level di erenc phonem level cover rule percentag higher correspond accuraci predict pronunci flemish word dutch pronunci phonem level qualit analysi rst ten rule produc suggest extract valuabl rule describ import linguist di erenc dutch flemish conson vowel level product numer dicult interpret result learn approach understand classi learn approach problem refer phonolog dutch clarendon press brill learn natur languag case studi part speech tag comput daeleman van den bosch van progress speech page springer verlag van den tree compress classi cation lazi learn algorithm cial intellig special issu lazi de van de volum paper linguist tg dietterich machin learn current direct ai gilli phonem qualit quantit aspect paper present intern workshop design annot speech tilburg vj van morpholog parser vj van analysi synthesi strateg research gener de jr quinlan program machin learn san morgan kaufmann publish schabe determinist tag transduc comput tj sejnowski cs rosenberg parallel network learn pronounc english text complex
AI/190 2 bring robot psycholog social intellig theori implement dautenhahn depart cybernet uk aud billard depart artifici intellig uk abstract discuss robot experi framework base theori psycholog introduct piaget theori cognit develop strongli influenc approach artifici intellig agent research theori challeng recent experi confirm belief essenti role social interact teach scaffold mechan import child order reach higher level compet control base current skill concept taught directli social child experi share understand develop child interact partner viewpoint languag product cognit develop mental believ sole primari function languag commun peer languag develop context social intellig robot term social intellig agent order biolog artifici agent show element social interact behavior introduc research direct stress role social interact dynam bootstrap develop social cognit research robot base assumpt order studi cognit develop robot approach social interact context scaffold develop cognit richer function work social intellig robot show correspond approach children cognit commun sake intern confer autonom agent commun studi robot languag primari step investig agent commun skill learn social context investig learn teach experi learner imit strategi liter guid teacher environ relat experi idea didact teach teacher robot experi symbol commun learner point view treat perceptu input intern learner learn basi learner activ piaget centr learn process symbol learnt describ situat form basi produc sequenc sentenc share understand learner robot languag result repeat social learner agent mean associ memori order reproduc word similar context learner teacher share understand develop group agent section briefli hint robot experi implement base theoret argument robot experi teach languag carri number experi autonom mobil robot taught synthet languag consist lexicon combin word form english robot learn behaviour capabl provid connectionist model dynam recurr associ memori architectur learn regular time seri learn associ result multipl associ robot state space experi involv robot group robot document implement control imit arm head movement human instructor imit taught perform label danc pattern taught synthet lexicon combin word describ interact teacher engag interact synchron coordin movement human environ plai crucial role develop children social skill interact dynam infant caretak central step develop social requir coordin extern intern state engag situat state dancer group danc movement state tempor coordin danc group sum danc emerg pattern individu dancer part synchron movement group describ experi base concept tempor coordin feedback signal reinforc learn interact studi tempor coordin human mobil robot depend reaction feedback movement repertoir simpl associ matrix train turn human robot learner experi robot slave react passiv human movement human quickli realiz robot movement correl movement robot oper passiv toi sensit long human interact adapt speed movement robot cooper human paid attent robot movement made robot slow final robot oper start initi movement final perform human gave longest attent robot adapt human react human movement cooper human learnt quickli give feedback order robot move depend human prefer robot end perform movement behaviour robot final typic human interact present paper experi social intellig robot base strict assumpt social li heart cognit develop develop autonom softwar agent taught lesson social foner mud robot julia breazeal work idea work social compet robot bear show bring robot show sophist cognit draw pictur robot human societi refer billard dautenhahn experi social ground commun autonom agent accept public adapt behaviour special issu simul model social experi commun imit learn commun doll robot technic report centr polici manchest metropolitan aud billard dynam recurr associ memori architectur learn tempor correl event autonom mobil agent adapt behavior januari aud billard connectionist model robot experi ground commun imit autonom robot phd depart artifici dautenhahn imit step robot social isol gaussier proc percept action page ieee comput societi dautenhahn artifici social intellig autonom robot robot autonom dautenhahn phenomenolog dimens social understand cybernet dautenhahn art design social intellig fiction human loop appli artifici intellig vol dautenhahn embodi interact social intellig agent nehaniv comput analog springer lectur note artifici breazeal motiv system regul interact leonard foner entertain sociolog case studi lewi proc intern confer autonom marina del februari page make case histor explan cybernet
IR/191 5 rout document style mosh dept mathemat comput scienc israel abstract research autom text categor determin topic text topic gener main characterist inform characterist inform retriev paper problem text categor style search automat determin page promot written nativ english speaker learn determin style document dual determin document featur captur style document independ topic defin featur document frequenc set function word tripl machin learn techniqu classifi document test method collect download newspap magazin articl introduct research autom text categor concern categor topic gener main characterist inform inform web topic creat differenti text deal singl topic paper problem text categor style search automat determin page promot written nativ english speaker automat filter electron junk mail user categor topic categor style fundament similar problem case determin proper categori document base analyz featur document problem orthogon document featur captur style document independ topic roughli categor style requir isol stylist featur document task difficult problem isol featur keyword suffici techniqu retriev web document base style significantli sophist techniqu problem identifi stylist featur document consid literatur literari primarili attribut classic work disput authorship survei recent work carri area virtual earli work authorship attribut problem attempt isol individu stylist featur larg invari passag vari author author type discrimin includ sentenc length vocabulari rich frequenc select word complic measur import attempt combin inform obtain featur semin work wallac featur frequenc set select function word featur prove success applic convincingli shown featur consist effect wide rang authorship attribut problem hope find small set discrimin prove effect gener problem categor style modern text categor method overcom problem literari work larg set candid featur data target drive select featur problem demonstr combin modern comput linguist technolog machin learn techniqu advantag categor algorithm textual style step document term larg class stylist featur paper type lexic lexic featur simpli frequenc function function word authorship attribut research work wallac frequenc word driven content expect remain invari author topic expect invari class similar document word frequent promot word frequent word todai frequent item list function previou studi fewer addit function set featur directli encod inform syntact structur text syntact structur expect reveal simpl word argu work al idea document class favor syntact construct previou work syntact featur base autom input text point requir method captur underli syntact structur effici reliabl fashion paper adopt simpl robust tag word text brill tagger brown featur po trigram trigram larg encod syntact small manag frequent trigram present indic possibl syntact style featur trigram percent document corpu note exclud featur prove determin passag written arthur perfectli reason check frequenc larger pictur featur decept set york time document middl east set daili articl presid correctli categor time articl clinton time daili learn featur set text passag repres total number featur set appli machin learn algorithm determin categori document ripper member famili learn successfulli text classif problem ripper bia small conjunct rule text categor learn algorithm consid interest altern ripper algorithm winnow learn linear separ experi methodolog test method text collect ny time nation stori month januari ny time editori editori articl month januari data obtain nexu comparison fw po time editori time daili time time editori daili time editori daili tabl result valid experi data set featur set ny daili nation stori month januari magazin articl domest issu juli end januari document word chosen number document categori slightli chosen newspap articl cover cover roughli topic collect test distinguish collect select document transform featur vector divid train test set cross valid experi run featur fw frequenc function po frequenc po function word trigram frequenc result tabl summar accuraci result cross valid experi featur set nexu select nation stori daili chose articl page paper page reserv nation care review rule produc ripper add insight mean result rule distinguish time stori daili stori function word default number rule reflect number document rule error rate test document pictur emerg small number signatur featur mark document belong collect difficulti document signatur featur signatur featur turn word todai signatur featur time word yesterdai signatur featur daili stori time stori daili stori word todai hold stori interest signatur featur po tripl signatur tripl magazin tripl newspap articl present verb newspap past verb signatur tripl time mr schedul stop presid wednesdai midwest lend energet support reflect fact time complex sentenc structur result tabl simpli reflect signatur featur stori easili distinguish sourc respect easili distinguish distinct syntax classif task consid difficult isol featur work reliabl class document class method discuss paper introduc problem text categor problem subsum problem authorship attribut broad rang applic inform encount attempt effect navig web work requir learn algorithm ripper successfulli text categor winnow lewi naiv class featur function word po trigram method test wider varieti categor problem refer van cave syntact annot enhanc authorship attribut literari linguist bailei authorship attribut set advanc literari linguist research eric brill simpl part speech tagger proc acl confer appli natur languag process cohen singer method text categor sigir cohen fast effect rule induct twelfth intern confer machin lake taho roth learn text categor confer empir method natur languag process rhode island goldberg approach learn text recognit ieee intern confer tool artifici dc authorship attribut comput lang learn filter net twelfth intern confer machin lake taho papka train algorithm linear text classifi sigir proc int confer research develop inform littleston learn quickli irrelev featur algorithm machin oak authorship statist handbook natur languag process forthcom stylist elsevi wallac appli bayesian classic case paper springer sentenc length statist characterist style prose statist studi literari vocabulari cambridg press
ML/192 6 annal boost explan effect vote method robert schapir lab park room florham nj usa yoav freund lab park room florham nj usa peter bartlett dept system engin nation act australia wee sun lee school electr engin colleg australian defenc forc academi canberra act australia abstract recur phenomena observ experi boost test error gener classifi size observ train error reach show phenomenon relat distribut margin train exampl respect gener vote classif margin simpli differ number correct vote vote receiv incorrect label show techniqu analysi vapnik support vector classifi neural network small weight appli vote method relat margin distribut test error show theoret boost effect margin train exampl compar explan base decomposit introduct paper method improv perform learn call predict algorithm classif method algorithm oper set instanc produc call classif rule hypothesi goal learn algorithm find classifi low gener predict low misclassif rate separ test set recent grow interest learn algorithm achiev high accuraci vote predict classifi research report improv perform vote method learn algorithm cart neural network refer classifi combin vote base classifi final vote classifi combin classifi exampl effect result experi dataset dataset appendix breiman bag method top learn algorithm similar cart time random subsampl combin comput tree simpl vote top left figur shown train test error curv upper combin classifi function number tree combin test error dataset test error bag tree improv error rate figur horizont grid freund schapir adaboost algorithm method similar bag rerun base learn algorithm time combin comput tree vote subsampl train tree chosen manner concentr exampl section result experi shown top figur note boost drive test error similar improv test error demonstr benchmark problem figur error curv reveal remark observ drucker cort quinlan breiman classifi expect gener error eventu degrad curv reveal test error method tree combin combin classifi involv million complex classifi low error boost tree train special subsampl train set appar paradox reveal error curv adaboost tree train error combin classifi drop test error continu drop round round combin tree simpler combin perform equal train set larger complex combin classifi perform test result experi contradict occam fundament principl theori machin learn principl state order achiev good test classifi simpl classifi chosen restrict space classifi space cardin measur complex infinit vc dimens close relat number paramet defin classifi theori differ train error test error complex classifi analysi boost appli carri freund schapir method baum haussler analysi predict test error eventu number base classifi combin predict incorrect case experi point quinlan breiman appar contradict stark boost experi test error continu train error reach breiman definit bia varianc argu vote method work primarili reduc varianc learn algorithm explan bag bag effect varianc larg train error combin classifi reach adaboost continu obtain base classifi train base learn algorithm subsampl data combin classifi continu train error reach section detail bag boost error classifi cumul distribut margin figur error curv margin distribut graph bag boost letter dataset learn curv shown directli margin distribut graph figur show train test error curv upper combin classifi function number classifi combin horizont line test error rate base classifi test error final combin classifi margin distribut graph show cumul distribut margin train instanc solid explan incomplet section larg varianc base classifi requir boost effect boost varianc reduc gener error reason simpli vote base complex predict argu section complex combin classifi greater base classifi result present altern theoret analysi vote ecoc approach base similar result present bartlett context prove upper bound gener error vote method term measur perform combin classifi train set bound depend number train exampl base depend explicitli number base classifi bag boost figur comparison versu bag boost set benchmark problem report freund schapir point scatter plot show test error rate compet algorithm singl benchmark point test error rate error rate bag boost error rate averag multipl run give practic quantit bound give qualit explan shape observ learn analysi understand algorithm fail possibl lead design effect vote method kei idea analysi order analyz gener train number incorrect classif train set account confid classif measur classif confid prove improv measur confid train set improv upper bound gener error combin classifi predict result vote weight set base classifi weight assign base classifi normal sum fix attent refer sum weight base classifi predict label weight label defin classif margin differ weight assign correct label maxim weight assign singl incorrect label easi margin number rang classifi correctli margin posit larg posit margin interpret correct classif distribut margin set train exampl visual plot fraction exampl margin function refer graph margin distribut graph bottom figur show margin distribut graph correspond experi main observ boost bag tend margin exampl converg margin distribut exampl larg margin boost aggress effect exampl initi margin small train error remain unchang round margin distribut graph significantli iter exampl margin larger round exampl margin detail show good correl reduct fraction train exampl small margin improv test error idea maxim margin improv gener error classifi suggest studi vapnik led work cort classifi boser guyon optim margin classifi section discuss relat work vapnik greater detail al gave bound gener error classifi term bartlett relat techniqu give similar bound neural network small weight consequ bartlett result bound gener error vote classifi term fraction train exampl small margin section similar simpler approach give slightli bound give main intuit proof idea bring back occam indirect recal classifi correctli margin posit classifi larg margin posit small weight major vote chang label exampl larg margin classif error origin major vote perturb major vote similar small set weight major rule fix ahead call perturb weight classifi major vote find nearbi rule approxim set approxim set error approxim rule train set similar gener error similar origin gener error origin rule small back occam razor argument argu classif rule argu rule close simpl rule boost good find classifi larg margin concentr exampl margin small forc base learn algorithm gener good classif exampl process continu train error reach explain continu drop test error section show power effect boost margin empir observ fact result provabl properti algorithm prove upper bound number train exampl margin term train error individu base classifi bound impli number train exampl small margin drop exponenti fast number base classifi section give exampl margin distribut graph base learn algorithm combin method section discuss relat work decomposit section compar work vapnik optim margin section briefli discuss similar result learn convex combin function loss measur classif error gener error function margin distribut prove achiev larg margin train set result improv bound gener error bound depend number classifi combin vote approach similar al bartlett proof simpler direct slightli weaker version theorem special case bartlett main result give proof special case label appendix examin case larger finit set label denot space base classifi space tree size base classifi map instanc space assum exampl gener independ random fix unknown distribut train set list pair chosen denot probabl event chosen denot probabl respect uniformli random train set clear abbrevi pd ed denot expect similar manner defin convex hull set map gener weight averag classifi fi fi fi fi fi understood finit nonzero major vote rule wrong predict margin case simpli main result state high gener error major vote classifi bound term number train exampl margin threshold addit term depend number train measur threshold close theorem appli case base classifi space set tree size set featur bound depend log roughli descript length classifi mean toler larg classifi class class tree continu theorem bound term dimens note theorem appli major vote comput theorem appli vote includ finit support requir proof suffici applic major vote finit number base classifi recal defin famili function jy defin largest number exist xd cardin largest subset space set restrict function function finit space theorem distribut sampl exampl chosen independ random assum space ffi probabl ffi random choic train set weight averag function satisfi bound pd log log sake proof defin cn set unweight averag element cn fi fi fi fi fi multipl time sum set plai role approxim set proof major vote classifi distribut defin coeffici element independ random distribut gener element cn construct map distribut cn function cn distribut select hn independ random coeffici defin goal upper bound gener error cn separ probabl pd pd hold event equat hold cn expect hand side respect distribut pd pd pd bound term equat start term fix probabl insid expect respect random choic clear probabl insid expect equal probabl averag random draw distribut larger expect bound yield upper bound term union bound probabl choic exist cn pd ffl je exponenti term bound hold singl choic term upper bound number choic fact form function cn valu form note jc set ffl expect respect probabl ffi ffl choic distribut finish argument relat fraction train set fraction quantiti measur equat bound express insid expect bound equat ffi probabl failur ffi ffi combin equat probabl ffi pd ln ffi statement theorem set ln discuss bound quantit predict made theorem hard show ffi held fix bound equat choic theorem converg pd ln ln ln ffi probabl term side equat pretti good approxim term side equat demonstr figur equat figur bound start size train set ten thousand section actual perform adaboost predict bound asymptot hold size train bound give section infinit space looser import challeng open problem prove tighter bound bound size train set figur plot term bound equat approxim term equat horizont axi denot number train exampl logarithm vertic axi denot bound plot ffi pair close line correspond count pair upper lower valu practic fact bound give suggest exist criteria theorem predict perform vote classifi breiman grove schuurman experi maxim minim smallest margin achiev train set advantag criterion maxim minim margin effici set base classifi linear program experi alter combin classifi gener adaboost maxim minim margin gener error experi report gener error margin instanc call number instanc small bound experi contradict highlight incomplet theori refin infinit space theorem distribut sampl exampl chosen independ random space ffi assum probabl ffi random choic train set weight averag function satisfi bound pd log proof theorem uniform converg refin vapnik chervonenki result due class subset space defin max jsj mg lemma class subset sampl exampl chosen independ random distribut jp ffl lemma bound probabl deviat empir true probabl event famili theorem proof proce theorem upper bound term union lemma defin cn xm lemma state em impli cn gj em dn cn function distinct valu dn appli lemma bound probabl insid expect term set ffl dn ln em ln ffi expect respect probabl ffi hold proof theorem probabl ffi pd dn ln em ln ffi set complet proof sketch gener approach proof gener approach appli class function approxim cn proof theorem central approach refer approxim class cover class train set size posit real number function class respect exist ffl denot train set size size smallest respect standard techniqu yield theorem proof essenti ident theorem bartlett theorem class function defin instanc space distribut sampl exampl chosen independ random ffl probabl random choic train set exist function pd ffl theorem prove construct cover probabilist argument proof theorem element cn randomli sampl function result lead slight improv log main result bartlett bound gener error neural network real output term size network weight margin distribut effect boost margin distribut give theoret evid freund schapir adaboost algorithm suit task maxim number train exampl larg margin briefli review algorithm adopt notat previou restrict attent binari case boost work sequenti rerun base learn time distribut train exampl round distribut comput train set indic mg goal base learn algorithm find classifi small error ffl distribut adaboost initi uniform updat multipl ff ff ffl normal factor chosen sum comput ff ff ffl ffl ff ffl ffl final combin classifi weight major vote base ff ff note round adaboost place weight exampl ff smallest quantiti margin combin classifi comput point freund schapir prove train error rate base classifi bound ffl fl fl train error combin classifi exponenti fast number base classifi combin train error equal fraction train exampl simpl matter extend proof show condit ffl fraction train exampl exponenti fast number base classifi boost theorem base learn call gener classifi weight train error ffl ffl ffl ffl note ff ff exp ff ff exp ff ff exp ff exp ff exp ff boost bag ecoc letter error classifi cumul distribut margin error classifi cumul distribut margin vehicl error classifi cumul distribut margin figur error curv margin distribut graph vote method boost base learn algorithm result vehicl dataset caption figur explan boost bag ecoc letter error classifi cumul distribut margin error classifi cumul distribut margin vehicl error classifi cumul distribut margin figur error curv margin distribut graph vote method boost base learn algorithm result vehicl dataset caption figur explan equal definit note plug valu ff theorem understand assum moment ffl fl fl predict random predict correct half time condit ffl fl small posit fl mean predict base classifi slightli random guess simplifi upper bound equat shown express insid smaller probabl exponenti fast ffl function possibl converg suffici slow bound theorem condit slow open problem theorem appli binari classif freund schapir give extens treatment multiclass case section result extend prove analog theorem margin distribut gener case margin distribut graph describ experi conduct produc seri error curv margin distribut graph varieti dataset learn method dataset benchmark dataset call descript appendix note learn problem multiclass vote method addit bag variant dietterich bakiri method output code view vote method approach design handl multiclass problem learn algorithm work bag base learn algorithm design rerun repeatedli unlik bag exampl reweight resampl label assign modifi creat label data induc simpl map set class base learn algorithm train relabel gener base classifi sequenc bit assign individu label view test classifi label code word closest ham distanc sequenc predict gener base classifi interpret led dietterich bakiri idea code word strong properti carefulli construct simpli random output code highli similar properti show fl advanc exponenti probabl achiev slightli boost dont achiev improv nontrivi lower bound ffl priori ecoc combin rule view vote base classifi instanc predict singl bit interpret bit singl vote label map round combin hypothesi predict label receiv vote ecoc vote measur margin boost bag note multiclass learn problem version boost section handl data freund schapir describ straightforward adapt algorithm multiclass case problem algorithm requir accuraci base classifi exce requir minim hope random guess achiev accuraci multiclass problem label accuraci harder achiev accuraci rate fairli power base problem accuraci requir difficult power base learn algorithm unabl gener classifi small train error freund schapir provid solut problem modifi form base classifi refin goal base learner predict singl class base classifi set label charact recognit base classifi predict singl label base classifi evalu measur penal base classifi fail includ correct label predict plausibl label incorrect label includ plausibl set combin singl label occur frequent plausibl label set chosen base classifi give weight base exact form control boost base learn algorithm design handl form loss measur base learn algorithm base learn simpl algorithm find tree algorithm version boost freund schapir result figur show error curv margin distribut graph vote method base learn algorithm note figur correspond singl run algorithm explain learn curv figur show train error test error curv horizont grid line error rate base classifi run error rate combin classifi iter note log scale figur margin distribut graph shown iter bare solid interest learn algorithm tend produc margin distribut graph roughli charact boost aggress margin suffer reduct margin exampl larg margin figur observ maxim margin final classifi bound contrast margin distribut graph iter bag kong dietterich definit breiman definit error error error error boost bag boost bag boost bag boost bag boost bag boost bag waveform bia var error bia var error bia var error bia var error kong bia dietterich var error tabl result experi boost bag synthet dataset appendix dataset learn estim varianc gener error report set definit bia varianc appendix base learn algorithm version boost bag problem class column label dash base learn algorithm run half exampl margin graph ecoc resembl shape boost tend lower margin note boost bag eventu achiev perfect perfect accuraci train set gener error boost explan evid margin distribut graph fewer train exampl margin close born mind combin complex tree number vari greatli combin method margin distribut graph necessarili predict method gener error complex base explicitli theorem boost achiev train error smaller base unabl achiev larg margin consist theorem base classifi higher train error low margin affect gener error complex smaller full tree relat theori main explan improv achiev vote classifi base separ expect error classifi bia term varianc term detail definit differ author author attempt captur bia term measur persist error learn error remain infinit number independ train classifi varianc term measur error due fluctuat part gener singl classifi idea averag classifi reduc varianc term reduc expect error discuss strength weak theori explan perform vote boost decomposit classif origin analysi quadrat regress averag independ train regress function expect error encourag fact nice reflect separ expect quadrat error bia varianc nonneg averag varianc term chang bia term natur hope beauti analysi carri quadrat regress classif observ friedman major vote classif rule result expect classif error simpl observ suggest inher difficult imposs find decomposit classif natur satisfi quadrat regress case difficulti reflect myriad definit bia varianc discuss remaind follow definit kong dietterich refer breiman definit appendix bag varianc reduct notion varianc understand bag effect learn algorithm larg varianc ideal varianc definit amount error effect bag larg number base classifi ideal situat bootstrap sampl bag faithfulli approxim independ sampl assumpt fail hold bag perform varianc domin error base learn algorithm happen data distribut simpl contriv data gener distribut label chosen uniformli random instanc chosen pick bit equal probabl probabl coordin independ noisi version base learn algorithm gener classifi equal singl coordin predictor respect train set clear coordin probabl chosen classifi random train aggreg predictor independ train sampl unweight major vote coordin optim predictor case bia learn algorithm predict error major rule roughli varianc strongli domin expect error rate favor bag close error optim predictor train set gener error achiev bag iter result averag reason poor perform random coordin slightli correl bag pick coordin behavior bag expect behavior independ train set achiev test error boost varianc reduct breiman argu boost primarili procedur evid observ effect boost algorithm empir high varianc error algorithm due reduct error primarili due reduct varianc experi show boost highli effect learn algorithm error domin bia varianc ran boost bag artifici dataset breiman artifici problem studi kong dietterich previou train set size problem base learn test algorithm section estim varianc averag error algorithm rerun time evalu test set exampl definit kong dietterich recent breiman appendix multiclass freund schapir test version bag boost version result summar tabl boost reduc varianc boost error algorithm varianc kong dietterich breiman definit check statist breiman test boost base learn linear discrimin analysi attribut ineffect boost case lda experi fairli stabl algorithm suggest stabil suffici predict boost failur theori suggest case boost fail theorem theorem state boost perform poorli insuffici train data rel base train error base classifi ffl theorem larg quickli incomplet boost succe situat theori hope tighter bound exist theori theori rigor analysi vote method gener appli base learn algorithm iid sourc label instanc hand bound accur predictor perform algorithm practic practic situat structur data base learn algorithm account assumpt gener theori origin goal boost reduc error learn algorithm tend larg bia averag complex challeng common intuit major vote base classifi gener error result classifi lower averag gener error base classifi vote method classif rule intuit base analysi regress previou section follow bayesian point view integr classif posterior singl classifi feel comfort point analysi paper adaboost gener major vote gener error averag gener error base classifi point suggest make introduct major vote classifi complex singl classifi irrelev misl describ base learn algorithm combin gener major vote base classifi train error time gener error improv case vote result case intuit break analysi develop paper correct answer classifi predict singl point input space vice versa point dislik replac function input space ball suffici small radiu make predict class function add constant function train sampl size easili construct set function class major vote function correct associ delta function train delta function correct train opposit denot number posit neg add copi function predict copi function predict verifi sum function posit posit exampl train neg neg exampl construct combin classifi fit train set fit train set good fact easili fit rule train set impli dont expect rule good independ drawn point train set complex averag rule rel size make note complex result averag delta rule simpl class function found singl delta function constant fit larg sampl high expect rule correct randomli drawn exampl boost perform shown theorem boost slowli find combin type train error bad gener error analysi show classif correct tini margin size expect gener error good high space input space figur maxim margin classif method raw data point element space posit neg exampl linearli separ raw input map point high space fix nonlinear transform high class linearli separ vector ff chosen maxim minim margin circl instanc support vapnik show ff written linear combin support vector relat vapnik maxim margin classifi margin classifi predict gener error studi vapnik work boser guyon cort optim margin classifi start overview optim margin classifi main idea method nonlinear classifi low space treat linear classifi high space classifi label instanc classifi linear classifi repres instanc vector set ff classif ff typic data consist instanc map vapnik introduc method kernel effici calcul predict linear classifi high space easi find linear classifi separ data perfectli perfect linear poor gener abil order overcom prescript suggest vapnik find classifi maxim minim margin train sampl consist pair form instanc label assum fix nonlinear map instanc typic maxim margin classifi defin vector ff maxim min euclidean norm vector ff graphic sketch maxim margin method figur analysi vapnik assum vector ball radiu euclidean distanc fix vector loss assum vapnik show vc dimens linear classifi upper bound result impli bound gener error term expect minim margin test point depend dimens space data map expect minim margin al techniqu theori learn function give bound gener error term margin train exampl al gave relat result arbitrari real class relat equat argument minimum equat view coeffici fff coordin vector ff predict fh coordin vector rewrit equat ff jff norm ff fact compon rang word max norm bound max jh view connect maxim margin classifi boost clear method aim find linear combin high space larg margin instanc sampl norm defin margin case goal margin classifi aim maxim minim margin boost aim minim exponenti weight exampl function margin interpret differ boost suit case map map high space coordin similar maxim optim margin method suitabl case euclidean norm case orthonorm transform space relat optim margin method quadrat program boost algorithm method approxim linear program boost support vector machin aim find linear classifi high space support vector machin method kernel perform comput high space boost reli base learn algorithm explor high space coordin time vapnik gave altern analysi optim margin base number support number exampl defin final classifi analysi prefer analysi depend size margin train exampl support vector previou work suggest boost method select small number exampl train set investig relev type bound appli boost problem interest open research direct loss function describ briefli relat work loss function loss quadrat jone shown function convex hull class function approxim convex combin element accuraci iter ad member minim residu error exist convex combin bartlett williamson extend result show procedur converg approxim convex hull target function convex hull bartlett williamson studi gener error procedur learn result analog present show gener error bound term sum absolut valu output weight member normal output valu interv term number compon convex combin similar work iter convex approxim space present al similar iter scheme combin function studi log loss extens boost solv regress problem suggest freund freund schapir extens test practic drucker experi extens boost regress report encourag result open problem method paper upper bound gener error vote classifi base simpl statist measur train data statist function empir distribut margin bound explain experi quantit predict greatli pessimist challeng bound divid question give bound function empir margin bound function approach understand behavior adaboost find function train set predict gener error dataset encount practic approach give satisfact mathemat yield good result practic acknowledg leo breiman email exchang challeng harder problem contribut dataset anonym review critic refer andrew approxim bound superposit sigmoid function ieee transact inform peter bartlett sampl complex pattern classif neural size weight import size network ieee transact inform eric bauer empir comparison vote classif variant unpublish eric baum david haussler size net valid neural bernhard isabel vladimir vapnik train algorithm optim margin classifi annual acm workshop comput learn page leo breiman bag predictor machin leo breiman predict game arc classifi technic report statist california leo breiman arc classifi annal leo jerom richard charl stone classif regress tree wadsworth intern cort vladimir vapnik network machin septemb luc bound uniform deviat empir measur journal multivari thoma dietterich comparison method construct ensembl random unpublish thoma dietterich bakiri solv multiclass learn problem output code journal artifici intellig januari rate convex approxim space construct harri drucker improv boost techniqu machin fourteenth intern page harri drucker cort boost tree advanc neural inform process system page yoav freund boost weak learn algorithm major inform yoav freund robert schapir experi boost algorithm machin thirteenth intern page yoav freund robert schapir game predict boost ninth annual confer comput learn page yoav freund robert schapir gener learn applic boost journal comput system august yoav freund robert schapir adapt game plai multipl weight game econom jerom friedman electron adam grove dale schuurman boost maxim margin learn ensembl fifteenth nation confer artifici lee jone simpl lemma greedi approxim hilbert space converg rate project pursuit regress neural network train annal ron kohavi david wolpert bia varianc decomposit loss function machin thirteenth intern page bae kong thoma dietterich output code correct bia varianc twelfth intern confer machin page wee sun peter robert williamson effici agnost learn neural network bound ieee transact inform wee sun peter robert williamson import convex learn squar loss ieee transact inform richard maclin david opitz empir evalu bag boost fourteenth nation confer artifici page merz murphi uci repositori machin learn quinlan thirteenth nation confer artifici page ross quinlan program machin learn morgan densiti famili set journal combinatori theori seri robert schapir strength weak learnabl machin robert schapir output code boost multiclass learn problem machin fourteenth intern page robert schapir yoram singer improv boost algorithm predict eleventh annual confer comput learn holger bengio train method adapt boost neural network charact recognit advanc neural inform process system john peter robert martin anthoni framework structur risk ninth annual confer comput learn page john peter robert martin anthoni structur risk hierarchi technic report robert tibshirani varianc predict error classif rule technic novemb vapnik ya chervonenki uniform converg rel frequenc event probabl theori probabl vladimir vapnik natur statist learn theori gener error multiclass problem describ theorem extend multiclass problem defin kg output space formal view base classifi map interpret predict plausibl label gener form classifi cover form base classifi paper simpl tree comput singl label predict label combin method boost dietterich bakiri method base classifi vote set plausibl label label defin convex hull fi fi fi fi fi classifi predict label input max ti broken defin margin function max wrong predict gener theorem theorem distribut sampl exampl chosen independ random assum space ffi probabl ffi random choic train set function satisfi bound pd log finit infinit bound hold assum pd log proof close theorem describ differ case finit defin cn fi fi fi fi fi proof theorem approxim function cn distribut pd pd bound term hand side fix achiev maximum equat bound equat follow proof theorem replac deriv analog equat proof theorem probabl ffi pd ke ln ffi set ln result infinit follow essenti modif argument proof theorem appli lemma deriv upper bound cn xm appli lemma set km impli cn gj dn xm cn gj dn dn obtain bound pd ke dn ln em ln ffi set complet proof descript dataset briefli describ dataset experi exampl train test class featur vehicl letter tabl benchmark problem experi dataset section conduct experi dataset call repositori california irvin basic characterist dataset tabl letter dataset test set vehicl randomli select half data held test set featur continu dataset miss valu letter benchmark letter imag recognit task dataset creat david document provid object identifi larg number rectangular pixel displai capit letter english alphabet charact imag base font letter font randomli distort produc file uniqu stimuli stimulu convert primit numer attribut moment edg scale fit rang integ valu dataset statlog version satellit imag dataset consist valu pixel neighborhood satellit classif central pixel neighborhood aim predict valu origin gener scanner imag data nasa australian center remot research center remot sampl gener small section row origin data binari valu convert present ascii form srinivasan classif pixel perform basi actual site visit ms karen work professor john richard neighborhood split test train set alistair vehicl classifi silhouett type set featur extract silhouett vehicl view angl dataset ture institut featur combin scale independ featur util classic moment base measur scale skew ax heurist measur rectangular compact model vehicl doubl decker imag acquir camera model vehicl fix angl class class class class class class class figur classif problem defin kong dietterich region synthet dataset section experi synthet gener data breiman quot ffl data class drawn multivari normal distribut unit covari matrix class class ffl data class drawn equal probabl unit multivari normal unit multivari normal class drawn unit multivari normal ffl data class multivari normal covari matrix time ident class unit covari matrix waveform data data breiman al program gener data uci repositori dataset kong dietterich classif problem class defin region shown figur definit bia varianc classif sake includ definit bia varianc classif task experi set definit due kong dietterich due breiman assum infinit suppli independ train set size sampl drawn iid fix distribut kg number class denot classifi gener base learn algorithm sampl denot ca classif rule result run base learn algorithm infinit number independ train set plural vote result classifi final denot optim predict rule distribut predict classifi instanc denot expect error classifi denot definit kong dietterich bia varianc breiman defin partit sampl space set set consist ca set complement set definit bia varianc bia varianc plural vote output class receiv largest number break ti uniformli random plural vote equal major vote
AI/193 2 mine constrain associ rule predict heart carlo edward omiecinski de cesar jose david cook elizabeth garcia colleg comput radiolog depart departamento de georgia institut universidad de santiago technolog hospit abstract work describ experi discov associ rule medic data predict heart focu aspect map medic data transact format suitabl mine associ rule identifi constraint base aspect introduc improv algorithm discov constrain associ rule present section explain interest discov rule introduct data mine activ research area popular approach data mine discov associ rule associ rule gener censu data medic data gener analyz classifi rare associ rule survei techniqu found work analyz idea discov constrain associ rule medic record includ time imag data work base long time joint research effort georgia tech discov knowledg medic data predict heart associ rule preliminari result justifi medic point view neural network predict imag base stress imag explor idea constrain associ rule binari data report preliminari find data mine perspect import featur associ rule grant lm nation librari medicin combinatori natur discov pattern subset attribut pattern discov algorithm constrain associ redund irrelev describ trivial knowledg goal find rule medic minimum support confid research project discov rule main valid rule expert system aid heart discov rule relat patient data heart enrich expert system knowledg base moment rule expert system discov valid group domain detail essenti product rule system tempor uncertainti reason discoveri knowledg result associ rule mine repres potenti power innov valid acquir knowledg enhanc knowledg base method capabl infer medic knowledg vast arrai data includ imag data repres highli clinic data patient symptom result clinic method paper provid effici knowledg acquisit techniqu classic approach paper provid gener framework understand approach underli research problem face data rich high miss domain work isol problem greatest interest data mine commun contribut paper outlin main contribut justif associ rule medic domain explain mine medic data associ rule interest hard problem present problem abstract manner work appli domain introduc simpl map algorithm transform medic record binari format suitabl mine constrain associ rule identifi import constraint make associ rule medic domain algorithm discov constrain associ rule low support high confid identifi open problem requir research outlin rest paper section state definit associ rule describ medic data small motiv associ rule medic field explain kind rule sought section address problem map medic data binari attribut treat main difficulti encount associ introduc constraint custom type algorithm result medic data set section section articl direct futur research data map interest rule associ rule standard definit associ rule ft set transact set fi transact set associ rule implic form ae call call consequ rule set consequ call itemset itemset measur statist call support itemset ae fraction transact support rule defin rule measur strength call confid defin ratio standard problem mine associ rule gener rule support confid greater equal prespecifi minimum support minimum confid threshold literatur review literatur associ rule extens introduct semin paper work share similar author algorithm incorpor constraint includ exclud item associ gener focu type item constrain hierarchi associ includ item approach limit hierarchi exclud item mine medic rule work address constrain problem gener approach base succinct constraint queri orient deal rule rule size noisi data bayardo al show support confid fundament metric gener descript medic data medic data set mine describ profil patient treat heart medic inform put file record record correspond relev inform patient profil person inform smoke habit relev inform measur patient heart blood pressur inform preexist exist store diagnost made clinician technician includ time attribut involv medic histori date complex set measur estim region healthi region qualiti number summar patient heart effort stress relax condit imag inform region store boolean data tabl show medic field paper attribut give usual abbrevi medic data type type medic inform complet descript attribut classifi type medic inform attribut correspond measur specif region attribut correspond risk factor attribut correspond heart measur goal relat measur risk factor dt mi descript ag ag patient lm left main anterior desc left art al sa si il li la ap sex gender diabet hist smoke smoke habit previou prior stroke prior surgeri level tabl attribut measur imag data repres local blood distribut heart muscl field commonli select data mine experi field includ field store percentag heart specif heart field store measur rang closer sever defect closer absenc defect field heart region altern approach explain data mine techniqu inadequ solv problem tree produc rule classifi record data set minim classif error approach assum target variabl indic class record belong case categor variabl indic patient healthi sick patient classifi simpl sick argu class indic make run analysi effort mandatori cover case patient combin drawback automat split numer variabl medic commun standard cutoff understand numer variabl cutoff wide accept blood high male split point chosen tree standard result interpret difficult cluster potenti techniqu case global understand data set adequ produc rule relat subset variabl constrain version cluster project data aspect deserv research mine constrain associ rule section introduc import contribut analyz problem map inform categor numer attribut valu item identifi constraint attribut item interest associ rule map attribut medic data record transform transact format suitabl discov associ rule note time imag attribut make problem simpler attribut uniformli treat categor numer numer attribut natur order valu categor attribut exist order fr ng relat tupl valu categor numer domain data set size ft set transact subset result map process item identifi consecut integ start map algorithm discret medic data record transform numer categor valu binari data map process divid phase phase map tabl construct base user requir phase attribut valu tupl map item base tupl transact suitabl associ rule mine categor attribut categor map item negat desir categor attribut negat map item domain expert specifi cutoff point numer attribut produc interv interv map item negat desir addit item creat negat interv gener negat significantli potenti number associ attribut basi care map tabl construct phase straightforward constrain associ rule summari main difficulti face discov interest associ rule medic data problem solut gener form constraint problem abstract manner associ size associ rule involv item hard interpret potenti gener high number rule slow interact process user default threshold associ size approach exhaust find rule threshold domain produc huge amount rule biggest size discov associ practic bottleneck algorithm perform case produc rule render result useless reason limit size rule st ae rule interest simpler higher support ae rule higher confid lower support item restrict consequ place rememb rule definit item rule consequ rule note interest rule matter item associ frequent itemset associ rule item prune uninterest rule useless combin item support prune uninterest associ confid prune uninterest rule rule high confid forbidden item consequ item constrain specif part rule associ uninterest combin item case combin trivial high support data set item associ fi interest associ st ae interest item group domain expert discard uninterest associ group item relev matter item assum small group identifi automat run straight associ rule algorithm previou knowledg low support shown support perform bottleneck associ rule desir run algorithm low support avoid repeat run support interest rule involv low minimum support level high support algorithm prune rule work high data lot rule involv item high support problem identifi quantit associ basic high number combin partit interv idea algorithm maximum support threshold import constraint base difficulti outlin introduc improv extend item field indic constraint fi set item mine obtain map process attribut fc set consequ constraint attribut note constraint attribut item constraint item consequ defin function ac make refer constraint fg set group constraint attribut posit integ constrain belong group group constrain defin function group attribut belong group group number induc partit attribut induc partit attribut attribut belong group attribut constrain belong group note group attribut group attribut constrain fi item simplifi notat lemma itemset downward closur properti constraint straightforward prove properti defin set lemma constraint prune associ rule gener phase assum rule respect ac constraint discard support rule comput lemma frequent itemset assum prune associ number itemset size powerset item lemma valid rule item constrain discard rule powerset union element invalid union element invalid count case state bound lemma prune associ base constraint lemma state algorithm advantag constraint phase lemma state number prune associ big maxim frequent itemset larg case produc speedup make comput interact lemma idea number discard rule algorithm mine constrain associ rule algorithm base wellknown algorithm basic notat definit section maximum number item rule xm frequent itemset obtain phase requir minimum support mine associ refer transact number fix prune base constraint minimum confid vari run run map algorithm ffl construct map tabl ffl tupl rn map attribut valu ap item base produc transact tn constrain associ rule algorithm ffl phase gener candid make pass tn comput support extend frequent item belong frequent fi candid check support candid make pass transact frequent itemset stop phase ffl phase xk valid rule evalu section present import associ rule discov algorithm experi run sun comput algorithm implement languag medic data set experi base real data set obtain hospit data set consist patient attribut select import medic attribut mine list tabl attribut includ measur region heart heart vessel attribut relat high risk factor heart measur quantifi deviat heart region region normal heart normal valu region mean deviat comput numer attribut refer vessel measur set program paramet automat map attribut item lm number repres percentag vessel narrow split rang partit cutoff point borderlin mean patient consid healthi common cutoff cardiolog commun lm partit cutoff point branch lm defect larger heart region cutoff valu set lower heart region partit rang cutoff point partit cutoff point valu correspond medic set clinician interest rule involv healthi sick patient attribut chosen negat miss valu assign item rule gener gener interest rule involv patient rule refer patient reliabl confid minimum support fix note fact lowest support discard rule transact minimum confid set maximum support set past attempt associ rule constraint result useless number rule involv medic variabl approach work mine associ rule minimum support confid filter unwant rule practic made constraint requir ingredi perform point view practic standpoint note requir low support mine associ refer transact explain constraint set associ rule find set constraint mean definit repres experi shown refer tabl understand attribut mean constraint associ rule mine program set main constrain consequ attribut constrain word medic field consequ rule region heart constrain group smoke constrain group constrain group group constrain rememb combin item group consid interest medic associ rule goal experi relat measur risk factor vessel valid improv actual diagnosi rule expert system rule confirm valid medic rule potenti enrich expert system knowledg base analysi interest result main measur quantifi qualiti medic sensit specif sensit refer probabl correctli identifi patient specif probabl correctli identifi healthi individu measur reli gold measur high accuraci person sick ideal measur involv medic procedur patient context paper gold standard case clinician read gener data mine algorithm produc total medic sort answer medic question address issu examin time reduc number rule found point result easili interpret clinician step step reduc total number rule achiev remov rule medic knowledg rule quantifi consid establish fact interest investig fall scope present research requir filter combin specif valu variabl combin rule extens associ rule algorithm filter combin extend combin specif valu step reduc number left examin achiev rule subdivid categori exampl categori relat ag relat smoke habit predict cad imag data rule highest support confid select repres result categori rule analyz domain expert paragraph discuss interest rule discov rule classifi express risk factor heart express exist risk factor heart import observ rule involv attribut negat attribut rang rule predict heart case medic field includ expert system mine associ rule rule potenti improv expert system incid patient lower rule high compar rule state lower chanc note chanc patient borderlin case fourth rule interest involv consequ basic person young smoke risk heart low complex rule relat heart rule adult femal patient diabet heart ag ag ag ag ag rule predict heart rule relat risk factor heart heart detect tomographi tomographi correspond studi involv insert tube inject substanc measur region rule patient basic element risk factor rule refer older patient local defect specif heart region rule patient defect previou surgeri high probabl heart number patient rule condit hold probabl high rule relat inform smoke level rule outstand confirm medic knowledg high risk heart high accuraci basic person high level defect person heart condit aspect impact risk heart rule state high level ag determin factor rule confid rule high support high relat specif defect heart region chanc conclud observ medic knowledg higher chanc rule involv confirm fact higher support confid ap ag ap la ag il ag ag ag sa sa ag ap ag sa ag sa articl present experi mine associ rule medic data predict heart explain motiv valid associ rule medic data associ rule combinatori natur inform medic record introduc simpl map algorithm transform medic record transact format present improv algorithm mine constrain associ rule medic data record time imag attribut map algorithm uniformli treat attribut numer categor numer attribut split interv negat attribut basi avoid number associ map tabl construct base tabl attribut valu map item algorithm mine associ rule import constraint reduc number rule speed mine process constraint exclud combin attribut elimin trivial useless associ attribut constrain consequ medic rule rule constrain includ maximum number item make simpler gener maximum support constraint elimin trivial rule constraint mine medic record minimum support involv transact section discuss import associ rule predict absenc presenc heart summari issu futur research examin problem miss inform close identifi constraint group compar discov associ rule classif rule obtain tree algorithm plan process data cluster algorithm explain rule low confid find high confid rule subset medic record assess impact perform constraint refer rakesh tomasz swami mine associ rule set item larg acm sigmod page rakesh agraw ramakrishnan srikant fast algorithm mine associ rule larg vldb roberto bayardo rakesh agraw mine interest rule acm kdd roberto rakesh rule mine ieee icd david carlo edward russel cesar de data mine larg improv diagnost make journal nuclear david cesar de carlo edward garcia valid expert system rule confid data mine comput cardiolog de garcia analyz predict imag neural network approach proc visual richard duda peter hart pattern classif scene page john wilei rakesh expert system interpret fayyad data mine knowledg discoveri mit raymond jiawei han exploratori mine prune optim constrain associ rule acm sigmod carlo paul fast cluster sql em algorithm acm sigmod page carlo edward omiecinski discov associ rule base imag content ieee advanc digit librari confer page carlo cesar de discov interest associ rule medic data acm sigmod workshop research issu data mine knowledg discoveri page ramakrishnan srikant rakesh agraw mine gener associ rule vldb ramakrishnan srikant rakesh agraw mine quantit associ rule larg relat tabl acm sigmod ramakrishnan rakesh agraw mine associ rule item constraint acm kdd
IR/194 5 world wide web meta search engin automat queri rout algorithm submit member dr hu dr kai chang dr david partial fulfil requir master comput scienc softwar engin tabl content introduct literatur review overview convent search techniqu convent queri rout system manual queri rout servic autom queri rout system base centroid autom queri rout system centroid system structur system overview oper topic identif search engin select index major task perform queri cluster search engin rank major technolog project topic identif algorithm exampl search engin select index algorithm exampl major technolog project queri cluster queri algorithm cluster algorithm exampl queri document cluster search engin rank algorithm exampl result system interfac experi futur work refer list figur figur system architectur figur program languag method project figur cgi connect web client server figur term collect method figur queri result figur http address extract html page figur figur inform obtain download back link sourc figur figur list distinct word set document figur figur term collect identif algorithm figur topic word select search engin figur comparison analysi webpag theme inspector system figur connect web interfac figur jdbc architectur figur titl search format attribut select special search engin figur topic word special search engin figur queri procedur figur search result queri figur rate result document figur figur rate result figur rate result figur result queri algorithm figur result search engin rank algorithm figur web system interfac figur rout result queri figur sharewar figur figur search result sharewar search figur figur rout result queri figur rout result queri figur rout result queri introduct search internet easi common task perform web task difficult continu growth amount inform post world wide web enorm amount lack structur make search relev inform difficult procedur tradit web search engin return user queri result displai long list document process data classif cluster variat search effici integr result search engin queri import difficult techniqu dramat improv web search technolog search alta vista wide tool find inform www search engin subject low low coverag manual gener directori provid web growth search engin altavista cover larger fraction automat index mechan search result difficult singl search engin offer high coverag high problem exacerb growth web size number naiv user web typic issu singl word queri search engin recent growth number varieti special search suggest approach search search engin search engin return refer search engin reason special engin authorit inform search engin index web html access special search engin reflect effort individu enthusiast commit provid updat inform narrow focu smaller ambigu linguist obstacl search amelior system approach search process metasearch search engin case search obtain result relev user queri user queri system find addit inform user queri user area queri term search facilit explor topic system maintain small decid engin deal user queri relat chosen topic system incorpor advantag search engin mention address issu find search engin queri overcom major disadvantag tradit search uniform treatment queri result significantli minim human effort search procedur techniqu present topic identif queri techniqu engin support set user narrow queri specif search suggest engin inform subject system obtain inform make intellig agent autonom learn web report prototyp metasearch engin autom queri rout mechan divid major descript exist search overview detail analysi algorithm implement system interfac result obtain system literatur review great lot search facil repres www chapter overview exist search analysi strength weak overview convent search techniqu web search servic implement method search strategi search technolog improv significantli search engin search speed emerg search engin categor basic genuin search engin directori differ list compil search hotbot creat list automat search engin crawl web gather user search creat directori yahoo depend human list similar web author submit short descript site editor write descript site review search match descript submit disadvantag system directori full dead access limit number web constantli maintain updat search engin slow reli heavili seed mention uniform treatment search result directori search engin result hundr thousand search complet irrelev user queri includ set search keyword web document descript problem make search common term word search extrem ineffici discourag user search approach search engin fit work enorm size dynam world wide web project aim search process perspect thought small idea bring structur search result investig long time search engin directori date search capabl order provid user effici search mechan section discuss convent queri rout system successfulli implement demonstr effici convent queri rout system convent queri rout system classifi group kind serv make search result accur user find relev inform time effort queri rout system metasearch engin depend exist search engin perform manual queri rout servic queri rout servic recent web requir aspect queri rout perform manual user search broker provid categor list special search servic basic requir user engin list provid keyword search interfac find desir search term accept keyword limit abstract categori user requir make connect specif queri relev categori approach work user mind term mean specif area search engin narrow user direct queri wrong search chanc relev search result special search engin address queri autom queri rout system base centroid system perform autom queri rout techniqu wide kind system gener typic consist complet list term decid relev user queri compar queri centroid cori system gloss base explicitli gener centroid start standard architectur protocol distribut inform retriev centroid provid inform sourc advantag techniqu handl wide varieti search keyword larg number term obtain techniqu appli search engin provid web restrict access intern autom queri rout system centroid autom queri rout system gener centroid system strict limit accept search keyword queri rout discov reli short wai explain content servic provid discov oper search keyword short text discov user refin queri select search effort inadequ handl wide varieti search keyword rout queri thirteen predefin categori search engin post sampl queri categori search engin examin engin categori check relev return document dictionari determin categori user queri relev dictionari creat newsgroup term categor recreat categori result accept limit type queri except system classifi group jeev perform autom rout queri limit set web site user jeev proprietari commerci intern rout abil scale system structur system metasearch engin oren etzioni specif system articl rout web search describ outlin system provid data comparison analysi method system overview main system provid user effici effect web inform input user queri set user inform output user receiv expand queri origin queri user suggest topic specif search relev inform locat mechan involv address queri rout resolv ambigu user queri broad word relat program narrow point user search explor topic level success system metasearch engin tier involv collect requir inform search engin rout system expand rout user queri subset select search engin schema system shown figur figur system architectur task concentr white block lightweight onlin tool shown grai worth point task perform period similar techniqu rank part autom queri rout algorithm differ amount inform process implement program languag dbm figur show compon system program languag figur program languag method project shown document download web interfac provid user written recogn web browser due colleg engin network implement task perform architectur schemat illustr figur type architectur build web base prototyp access comput depart engin figur cgi connect web client server main problem design natur server make system slower program resid comput system compon start task end task oper task system perform topic identif inform search creation inform gather oper retriev relev term engin criteria identifi search engin simpli oper popul perman inform obtain previou task worth mention perform task line enorm amount time requir averag hour run ad search engin fulli time procedur hour worst case topic identif main oper identifi group term describ search engin algorithm explain section comparison analysi method approach idea exploit web page attract research attent recent incorpor search engin recent work analyz link structur web suggest hyperlink page repres relev import kei point research identif search engin topic method collect term relev search engin topic intern collect limit web page small number abstract term repres topic search obtain method topic identif collect term relev search engin exist static web document method search engin page provid queri interfac call page front front page term explain topic search engin term front page frequenc regist search engin select index method web page link point search engin front page call page good explan search engin method find multipl page target search engin extract page term line link store extract term document frequenc search engin select index sampl method sampl method obtain part search engin gener kind incomplet centroid submit train queri search engin store search engin select index term return document frequenc term similar method xu due natur sourc term term collect method abstract gener term specif proper noun obtain sampl method success collect specif term method implement detail chapter search engin select index search engin select index store rank term normal frequenc relev search engin call search engin select topic term set topic term topic search engin defin ij ij max highest frequenc observ index figur show exampl term obtain method abstract gener term topic term comput secur search engin hotel search engin search topic term normal frequenc topic term normal frequenc secur bug unix exploit attack password mail hotel travel airlin reserv restaur map book flight figur term collect method major task perform major task project receiv user expand origin identifi relev send expand user queri search displai result main characterist task perform lightweight highli system give user queri reason time queri queri mechan transform origin queri expand queri ad word suggest user subject area search queri mechan provid user set formul specif narrow queri queri mechan user altern inexperienc user import benefit queri process implement system abil automat obtain term relev queri web system identifi topic cover great varieti queri maintain massiv dictionari term wide rang field cluster cluster process group similar relat term cluster perform part queri process kei requir document cluster coher cluster algorithm group similar document document multipl confin singl cluster algorithm gener overlap cluster effici user determin glanc content cluster interest system provid accur cluster descript cluster system introduc substanti delai displai result suggest addit requir algorithm cluster algorithm cluster hundr thousand snippet time download origin document system produc high qualiti cluster access snippet return search engin search engin rank final oper system rank search engin procedur determin search engin relev result expand user queri system perform calcul good search engin queri compar term obtain queri term store search engin select index good metric relev search engin queri major technolog project task perform system provid essenti inform system accuraci function metasearch engin depend sole accuraci topic identif algorithm result search engin select index detail algorithm provid topic identif algorithm search engin select index topic identif method appli identif search engin topic method method complex time consum shown excel result algorithm algorithm work web page link search engin front page page queri interfac search identifi term line link search engin occur extract rank result obtain step current list normal store frequenc back link obtain send queri search engin insert actual url search engin interest problem number search result return googl exce due limit time process number web document easiest solut limit number url result show web number distinct term frequenc threshold significantli drop justifi reduc number top queri result leav small margin assur accuraci rank result import step web document download make term search engin url paragraph hyperlink elimin possibl irrelev term highli commerci search approach work simpli link banner context situat requir special attent good topic futur research perl facil retriev web content light weight process method fetch web document word process perl problem mention earlier problem occur rank problem problem natur languag english word occur frequent word carri mean combin word make languag smooth act glue bind frequent time word word highest frequenc web document elimin presenc word subtract set predefin stop word set distinct extract page term improv perform algorithm stop word remov list term obtain back link calcul rank perform exampl illustr algorithm give short show work reduc size document calcul rank search engin base back link page small number back link page demonstr step googl obtain http address web page link download googl search result page result page shown figur html format edit save space googl onlin guid privaci logo onlin guid privaci resourc updat privaci organ neumann home intern comput scienc laboratori peter activ academ background peopl internet peopl internet organ found octob octob inform amend bear arm check homepag onlin guid privaci resourc onlin guid privaci resourc html version updat februari html version text version figur queri result http shown bold figur extract download html page result shown figur ml figur http address extract html page figur step download web page http address step step algorithm produc larg amount result step extract paragraph text document obtain step hyperlink result step shown figur privaci forum moder digest privaci partial sponsor acm privaci back issu lauren weinstein relat effort support part acm comput public lauren weinstein moder privaci forum digest provid servic deepli concern privaci issu subscrib request inform check privaci forum peter chairman acm comput comput public creator moder internet risk forum lauren member creator moder internet forum comput improb hit web technolog www server open public access internet privaci forum digest inform archiv materi interest privaci issu film film public broadcast cabl tv industri info found tv movi learn histori comput comput histori associ california visit crew nobel host popul page journal annal improb privaci forum moder digest privaci partial sponsor acm back issu privaci lauren weinstein figur inform obtain download back link sourc figur step remov html tag punctuat mark step identifi list distinct word set document shown figur step remov stop word list word obtain step result procedur shown figur weinstein figur list distinct word set document figur step count number time word list distinct word shown figur occur normal frequenc word figur show result topic identif algorithm top ten word topic term frequenc normal frequenc privaci forum acm issu lauren moder digest histori public figur term collect identif algorithm back link obviou special search engin special privaci issu figur show word search engin includ studi root address term high frequenc server softwar browser game pdf figur topic word select search engin os scienc usa solut peopl figur topic word select search engin justifi ran root address similar webpag theme inspector implement phd softwar system backlink provid search engin studi keyword paragraph backlink includ descript figur show clear pictur similar differ system webpag term http search engin cach system cach theme inspector collect system collect theme inspector common term figur comparison analysi webpag theme inspector system column search engin address enter googl topic identif webpag theme inspector star search engin address term pick prototyp system theme inspector column show link explor system fourth column show term identifi sixth column number common term column ratio number common term number term pick system numer reason ratio similar term vari differ list differ index rank method search engin obtain back link result prove system make interest comparison search engin select index search engin select index store rank term normal frequenc inform provid topic identif algorithm algorithm store characterist search engin perman storag medium affect modifi import question term extract page store obviou limit topic reason number order reason size project approach element sort normal frequenc element sort list element frequenc includ implement oracl system tabl creat sql statement creat tabl perman storag inform order insert inform statement insert insert valu creat popul access search relev inform inform retriev place establish connect web interfac conceptu chain shown figur figur connect web interfac connect dbm web establish cgi jdbc architectur java connect illustr figur figur jdbc architectur exampl inform search engin save tabl reduc space complex tabl inform http search format tabl creat sql creat tabl prob titl figur show actual entri select search engin studi http address titl search format media search engin movi movi star search excit travel state depart servic affair indiana comput scienc figur titl search format attribut select special search engin tabl provid essenti inform search engin import part search automat search individu search engin express record substitut queri word delimit search search engin provid indiana queri result interfac html tag tabl http topic word normal frequenc search engin http address tabl correspond http address tabl tabl creat sql creat tabl rate tabl popul automat result topic identif algorithm obtain figur illustr tabl entri special search engin topic word normal frequenc privaci comput risk system softwar secur problem system technolog forum issu comput report problem time phone power peopl figur topic word special search engin improv effici save view combin inform tabl creat view hold data sql statement creat tabl combin select rate view requir addit disk space soft link exist queri static tabl order retriev inform special search engin popul consist data final proce task major technolog project algorithm perform system algorithm queri cluster search engin rank algorithm task categor lightweight highli optim oper run web oper download inform attempt retain high relev result queri cluster import queri cluster work expand origin queri provid altern order user explor topic cluster algorithm part queri algorithm algorithm explain detail illustr cluster algorithm combin illustr queri algorithm function cooper import benefit queri process abil automat obtain term relev queri web system identifi topic kind queri maintain massiv dictionari term cover wide rang field assum user queri consist queri smaller number relev topic identifi base assumpt mention import step rout process expand user queri queri algorithm outlin mechan involv queri shown figur document set relev user queri search keyword send gener search engin count search keyword term document set wh wl set term exce threshold set wh consid relev queri part queri result pick topic term wt wl formul queri qt combin wt qt wt cluster term formul queri combin document set dt send qt independ gener search engin count dt set high term wh wh step queri result figur queri procedur queri process consist search relev term run algorithm set web document retriev send user queri user queri search engin procedur fairli relev term web dynam mention system special dictionari queri exist web document search relev term user queri submit search engin time time pair term suspect relev queri web sourc relev term make system dynam reflect topic popular present time base evalu term relev mutual relev term evalu basi origin search keyword document make queri rout algorithm follow link provid search explor titl return page short descript found search result download full size step run time enorm import count term origin queri count time term simpli queri step algorithm primari sourc relev user queri term web document metasearch metacrawl search engin directori retriev result search top posit affect result rank techniqu difficult determin term relev result singl document search gener search engin low occurr term send combin origin queri search engin perform evalu automat queri refin call implement mechan count term origin recogn similar word form import step accur algorithm algorithm mention target merg plural form noun singular form simpl past verb simpl present form verb present document accomplish approach pick term belong list distinct term prepar rate check term remain list term start length length remov list rate process combin number treat term precaut make system step algorithm shown figur search engin metacrawl googl cluster algorithm shown figur part queri process place step cluster addit relev term simpl method reduc total comput time cluster algorithm system gener cluster mutual algorithm pick term highest document set obtain step queri algorithm figur set document pick highest term set document set document set document term highest document tempt accept rest document exclud step cluster experi show bring unrel make search step queri algorithm imposs term cluster term step figur cluster wh wh cluster relat system merg elimin duplic merg cluster topic term merg cluster common term merg iter process closest cluster determin merg document obtain step join list term count place process merg repeat intersect cluster reach threshold case smaller cluster merg bigger defin main topic larg cluster check overlap merg join document set obtain step merg process reduc complex perform cluster determin work approach merg continu cluster time dt retriev benefici program iter algorithm complex substitut algorithm linear complex stabil experi show qualiti cluster major disadvantag method cluster irrelev tightli bound successfulli detect emploi kind heurist algorithm handl case reason amount time exampl queri document cluster queri algorithm complex illustr oper greatli aid understand outlin algorithm schemat repres figur origin queri expand queri algorithm exampl simplifi illustr assum initi queri step search engin document result origin queri step perl fetch result document queri queri string construct perl web document result assign html document html tag remov result shown figur ten result pair network world class web host pair network offer complet web develop full cgi privileg true virtual python python fly circu tv show video secur onlin great price associ affili python homepag python includ spam shop click internet keyword directli python web site python softwar activ null boa python specif snake famili find averag color potenti danger lyco python fly circu biographi biographi seventh grade python fly circu greatest sketch comedi group argument pet film python compar languag link comparison involv python python languag websit home page extens program languag combin clariti juan python script cgi cgi script python im share web web author calendar maintain site hope python includ resourc person web page interest owner pet python snake figur search result queri step count kei word term stop word remov frequenc term calcul origin queri singl frequenc count number document distinct term present document ident term count form word merg point result process shown figur word rate includ topic term rate languag pet circu fly cgi snake figur rate result document figur step set term wh wl chosen base number cooccurr belong wh term wl step wt pick wl term step supplement queri qt qt qt qt step cluster step term highest pick case word document figur assign set document document belong set rate result figur show word higher topic term rate languag cgi snake figur rate result rate rest document place result shown figur topic term rate cgi snake figur rate result rate result cluster formul step supplement queri step step step differ document set dt obtain send qt independ gener search engin step repeat step step larger set document obtain step conclud step queri major topic identifi independ set rate pass final oper system rank search engin figur show result queri algorithm term obtain system internet maintain kind expand origin queri depend dynam result chang system queri result origin queri cluster cluster cluster python program pet cd music price video organ food chemistri garden food recip shop classic car part sale show train model travel colleg sport footbal game figur result queri algorithm search engin rank rank search engin system decid search engin queri rout algorithm queri algorithm search engin select index provid input data search engin rank algorithm specif introduc search engin system relev inform user good search engin set queri term calcul number count queri process frequenc term search engin select index import rememb topic term term calcul good tempor supplement tabl creat rank result cluster provid queri mechan tabl identifi cluster set term frequenc term inform search engin store conveni perform calcul good sql select group address order good combin view hold inform special search engin tabl tempor inform cluster good system gener rank list search engin select cluster queri rout result exampl calcul good straightforward procedur figur show result oper origin queri expand queri search engin titl good movi movi star search world travel search engin travel directori local tourism guid python media search engin indiana comput scienc sharewar python program latest price media search engin appl site map python python languag indiana comput scienc sharewar linux linux softwar technolog ibm search technolog secur websit linux train excit travel sharewar technolog linux fast secur websit ibm search technolog java bean javabean indiana comput scienc ibm search sharewar java bean technolog excit travel sharewar java bean java bean softwar technolog figur result search engin rank algorithm experi show result search engin lower threshold mention cluster produc good rudimentari inform defin result chapter show system interfac result system interfac system simpl keyword search web interfac figur interfac input field user queri button initi process search number search keyword vari experi show system perform word queri figur web system interfac queri submit result page short delai vari depend internet connect stabil exce result page queri shown figur figur rout result queri independ topic provid user engin correspond suggest topic search engin list search search link return user search result search engin expand queri link user interfac user submit queri figur show result explor search link figur origin expand figur sharewar figur figur search result sharewar search figur experi experi shown figur illustr queri rout result origin queri term relat queri topic search engin expand queri rout belong comput justifi accuraci queri rout algorithm case topic due small good factor figur rout result queri experi origin queri result queri rout result shown figur topic identifi topic term reflect avail inform web relat origin broad queri illustr perform queri algorithm colleg footbal team rout result queri system includ special search engin educ sport problem occur implement system cover select easili solv ad search engin figur rout result queri interest result shown figur origin queri queri rout relat search engin cluster illustr behavior system initi queri specif provid mechan detect merg similar cluster prevent kind behavior figur rout result queri futur work industri web search continu grow rapidli grow www queri rout algorithm make search easier provid sort guidanc inexperienc user user internet gener project achiev retriev relev term directli internet engin small expand user queri user retriev relev ad word origin queri narrow search make select result easier effici result show system pick cluster relev origin queri time select relev search engin expand queri time section describ featur task ad system make result shown satisfactori prove system real life situat disadvantag system deterior relat special search engin averag http hard code system make system function track futur featur ad topic specif search engin autom featur valuabl addit system refer alta jp wb distribut collect infer pp lagoz protocol internet search discoveri acm transact wang intellig fusion distribut search journal vol manber search usenix symposium internet technolog randal schwartz tom oreilli nov resourc discoveri system base content intern world wide web comput network isdn oren rout web search intern world wide web webpag theme phd softwar index overview world wide web search world cybernet juli xu retriev distribut annual intern acm sigir confer research develop inform pp zamir dynam cluster interfac web search eighth intern world wide web comput network isdn zamir document feasibl intern acm sigir confer research develop inform retriev pp
ML/195 6 optim global minim method suitabl neural network comput nichola toru poland de scienc de de de la loui franc abstract neural network train procedur method frequent find suboptim solut trap local minima optim neural structur global minim method appli network cost function strong influenc aspect network perform recent genet algorithm frequent combin neural method select architectur avoid drawback local minim method global minim method suitabl rare context paper survei global includ aspect genet algorithm content introduct mont carlo improv simul anneal variant adapt simul anneal reactiv tabu search algorithm method polish scientif grant french partial support comment neural comput survei http neural comput survei hybrid optim method smooth algorithm branch bound method method genet algorithm overview genet method support method collabor method hybrid method process genet search network encod scheme fit function particl swarm optim optim network architectur global minim cost function remark global optim method final remark comparison result introduct soft comput method compet tradit pattern recognit statist method applic neural network predetermin perceptron fix find optim set paramet requir solut optim problem problem gener chanc find solut learn techniqu start minim neural network learn solut connect local minima error function satisfactori practic optim neural architectur global minim method appli neural network cost function case improv dramat qualiti network measur perform global minim method suitabl minim neural cost function optim neural architectur inform method scatter mathemat literatur access easili hope survei stimul research direct global minim solut local minima problem simplest wide method base momentum term ad discuss good book neural network momentum lead global optimum neural comput survei avoid poor local solut rare method find optim base good gradient optim initi procedur bring adapt paramet vicin global minimum random initi small weight commonli neural suffici optim paramet larg recent long seri comput experi observ repeat random initi time lead faster converg sophist version gradient method gradient learn procedur bad initi valu weight stuck local minima good strategi abandon train slow significantli start random weight strategi good initi global minim method solv optim problem direct approach find optim network structur guess good select structur minim genet algorithm simul anneal gener network architectur estim qualiti genet previou network strategi base assumpt spell qualiti measur error train valid smooth function topolog adapt paramet network ad neuron delet retrain dramat effect qualiti network qualiti function chaotic minim method ultim fail find global optimum perform neural architectur evalu strategi creat network higher qualiti postul human expert interest check assumpt smooth network space theoret simul problem awar systemat studi target topic caveat order solv problem capabl backpropag algorithm error minim procedur drawback network architectur select mathemat model chosen classif border conform simpl logic rule easili repres hyperplan repres accur sum soft sigmoid function mlp network slope sigmoid function improv border point lead problem learn volum input space sigmoid chang rapidli gradient rapidli shrink limit sigmoid function gradient techniqu backpropag make transit result dataset chang learn rule network architectur improv accuraci neural solut global minim procedur drawback optim slope adapt paramet run numer instabl good dataset optim mlp give error logic rule reduc case provid test research neural network concentr network architectur learn select neural transfer function strong impact complex perform neural model select minim procedur lead great improv qualiti network neural comput survei speed converg learn algorithm global minim replac backpropag algorithm good overview local minim algorithm neural network find solut hard problem compact neural network method combin local gradient approach global explor search found good solut benchmark problem hidden neuron previou smallest mlp cascad correl algorithm problem neuron train process sensit initi condit illustr chanc find good local minimum larg network greater small error surfac small network extrem rug method easier obtain good result larger network small global minim smaller network global method improv qualiti logic rule extract neural network global optim method appli neural network method buri literatur physic chemic optim problem virtual unknown neural network expert problem unconstrain global minim state vector initi paramet includ data adapt structur function evalu qualiti vector dataset train valid input vector desir target gener sequenc vector paramet global minimum function found simplest strategi gener paramet base mont carlo context neural network commonli global minim network architectur optim method base genet algorithm applic genet algorithm optim neural network minim cost function advanc applic gm method deserv long section survei popular genet method prevent global minim method subsequ section start simplest mont simul reactiv tabu method base determinist dynam explor search smooth branch bound interv method final section global minim method issu relat optim neural architectur short comparison result gm method mont carlo improv simplest mont carlo approach vector paramet randomli gener chang singl paramet group paramet optim neural network structur chang involv ad delet connect neuron connect learn gradient learn connect mc optim architectur global optim solut found genet algorithm fast number network gener train select crossvalid test method sophist genet algorithm simpler implement neural comput survei altern procedur separ set architectur discontinu paramet continu network paramet weight optim mont carlo approach case select architectur slower search global minimum cost function random gener paramet suffici long explor paramet number paramet larg comput time prohibit mc method paramet select randomli drawn probabl distribut constraint favor small network easili implement improv quantiz weight mc short train network select mc interest improv mont carlo procedur context interact method gener applic error assum sum singl spin interact interact term ensembl energi function defin spin energi minimum search energi probabl distribut defin paramet select landscap energi landscap proport total local minima place applic spin glass problem travel salesman problem show superior approach mont carlo difficult optim problem context neural system amount batch train procedur procedur paramet adjust present batch learn chang end epoch data present probabl distribut select number exampl consid simultan defin paramet shape larg posit small larg neg larg chosen optim procedur requir select elementari chang dp network paramet chang perform error function ek ek randomli select subset train data network method conjunct method chang adapt genet algorithm simul anneal focu error includ contribut configur train data vector method context neural network neural comput survei simul anneal variant optim method introduc vecchi inspir anneal process crystal reach lowest perfect crystal cool suffici slowli process hard practic good crystal show global minim process difficult natur problem high temperatur atom configur reach higher energi state overcom energi barrier avoid tension due defect simul anneal found numer applic branch scienc technolog essenc add simpl mont carlo procedur import sampl boltzmann distribut select paramet evolv vector adapt paramet initi minim error function type function sa describ probabl distribut probabl accept set paramet current depend chang error schedul chang paramet time step temperatur determin scale fluctuat time step boltzmann anneal schedul frequent statist mechan root method defin proof show probabl approach slower global minimum found procedur distribut gaussian form frequent dp vector defin chang paramet previou popular anneal call fast base cauchi defin assign higher probabl larger paramet save temperatur frequent reduc constant lead exponenti schedul global minimum found variant sa call sq simul high temperatur larg initi stage minim sampl avoid time wast short sampl run fast anneal schedul recommend determin good initi temperatur local minima shift linear search techniqu significantli reduc cost calcul anneal popular approxim stochast deriv error function quadrat variabl method easili appli network minim energi work quadrat error function clear mlp feedforward network neural comput survei adapt simul anneal adapt simul anneal call fast simul probabl distribut paramet paramet finit rang determin physic paramet belong random variabl time step gener uniformli distribut sector specif temperatur paramet anneal schedul defin term free type function accept probabl effect asa free paramet tune specif problem mechan build publicli asa softwar includ base sensit cost function paramet paramet idea significantli improv qualiti sa result base rescal error function target target origin error landscap initi target larg error landscap escap local minima modif trivial test travel salesman problem rescal sa significantli outperform origin sa method optim neural connect simul standard procedur sa popular neural network research work interest paper network adapt paramet discret boltzmann machin harmoni network base simul anneal approach sa gibb sampl techniqu bayesian approach neural network studi field anneal found superior minim techniqu neural network context simul anneal solv optim problem inher vector quantiz method featur weight lvq network select optim refer lvq vector optim probabilist network recurr neural network exhibit chaotic behavior sa combin approach optim problem sa found superior techniqu worthwhil make experi asa appli neural network neural comput survei special form simul anneal algorithm result approach good due global algorithm base simpl idea competit backpropag weight chang constant amount probabl defin sigmoid weight chang error chang comput previou iter anneal temperatur chang epoch consist sum error previou larg probabl close weight randomli chang larg chang energi detect weight error temperatur reduc iter weight updat simultan assumpt made structur error measur minim transfer gradient algorithm feedforward recurr neurobiolog plausibl algorithm plausibl time dynam rang initi number step epoch problem standard quadrat measur error cost function target output valu log function smoother quadrat error function network hidden layer sigmoid transfer function minimum amaz comparison standard quadrat cost function improv variabl fast slow weight fast slow anneal schedul easili connect global minim genet algorithm disadvantag algorithm weight updat satur larg posit neg valu prune small weight enabl featur select defin condit penalti function articl algorithm test problem good learn solv larg pariti solv standard machin learn monk problem accuraci approach network result noisi data report reactiv tabu search reactiv tabu search base simpl idea search start random point elementari move cycl avoid neural comput survei trajectori search discourag system visit region context neural network valu adapt paramet finit neighborhood defin chang oper error function defin finit set point oper lowest select error ti broken random recent move prohibit avoid tabu method region visit avoid possibl restrict subset move randomli sampl select tabu put valu limit number time step larg avoid cycl small avoid search reactiv tabu search optim prohibit period adjust local structur problem requir rememb point trajectori count time point encount rt algorithm present set initi paramet initi point check check time repeat length short avoid repeat time start escap constant number iter greater move averag repetit constant factor save comput select move move prohibit store point hash reduc rememb escap start diversifi sequenc random step cyclic chaotic area dynam defin probabl visit distant point higher random walk applic neural network weight map binari string grai concaten proper choic select elementari import success method binari string weak elementari step correspond small chang weight chang costli decod evalu weight chang time long string bit obtain code recommend bit weight bit gave result compar full bit give good deriv sigmoid replac function maxim gener function minim error valid train minim tabu search good result larg number combinatori optim problem discrimin interest event high energi physic result obtain weight weight gener level reach standard mlp reach author includ weight valu featur select result show larg network import explor search space find valu weight neural comput survei algorithm recent global optim method neural network trajectori base explor solut locat region local search locat minima trajectori global search stage defin differenti plai role trace function gener function compon local minima attract compon walk local minima simplest case practic algorithm function trace function assur space final partit space region explor detail make fine search algorithm function dimens integ paramet differenti equat solv origin form standard od comput packag discret form differ note od solut slightli discret equat faster simul method test train hidden unit time start weight hard problem mlp network slope sigmoid unusu larg find solut hidden unit requir total week sun workstat time discret version time faster didnt find absolut minimum determinist advantag stochast version find deep minima bound region paramet space method linear squar simplex interest global minim method base recent present gupta al result applic neural network interest layer weight estim downhil simplex weight estim linear squar approach hidden train input output error function neural comput survei jk total number paramet network estim output weight invert sigmoid ln ln activ output unit give expect result actual activ error function written jn minim optim restrict weight layer weight set solv linear equat result squar problem approach test function approxim problem dataset compar backpropag adapt learn rate conjug gradient time time longer procedur result significantli method global optim similar stochast type cluster method cluster defin set point basin minimum descent method converg singl linkag method evalu function set sampl find appli local minim creat cluster ad point minimum initi sampl point fall cluster local optim minimum critic distanc cluster closest point point form cluster space partit basin local minima gradient dynam attractor sampl set continu expand finit sampl insid cluster minima eventu found multi level singl linkag local optim appli initi sampl point closer critic distanc method appli neural network neural comput survei hybrid optim method al hybrid algorithm global minim neural network conjug gradient method line search find local minimum error smaller threshold method switch global mode escap local minimum error suffici larg local minim turn random optim method wet method converg global minimum step select initi weight vector assum weight bound number maximum number normal distribut gener random vector dimens weight vector element bound method appli problem good number iter larg slightli improv liang al combin rosario algorithm local minim conjug gradient blind equal achiev significantli result standard method global wet minim drawback context neural network train gaussian distribut area local minimum high result strongli depend choic varianc distribut comput arbitrari paramet experi neural network show good solut obtain arbitrari start previou valu weight improv search variant hybrid method present hybrid optim method call base random line search combin scale conjug gradient method algorithm select random initi weight vector current point random line weight space minim error line move point error lower current point algorithm converg global minimum probabilist applic neural network local minimum found method start weight rang random line gener origin rl algorithm gener current effect search techniqu call sophist strategi creat statist model estim posit global minimum quadrat approxim find final length line scale factor proport stochast gaussian compon uniformli neural comput survei randomli select line gener short cost global strategi part method small compar cost local search main paramet user chang rang weight experi small depend preprocess input method implement simul comparison method result pariti problem problem show superior determinist hybrid method call tang comparison method problem initi success identifi problem interest minima lie renorm random line vector gaussian compon drop random line drawn point opposit origin version work find global minima random line result preliminari method show great hu al introduc hybrid random search scheme search base interest probabl densiti function gener random search vector random search vector gener ln ln qm random valu uniformli distribut interv qm control asymmetri search posit neg direct control rang random search random search algorithm converg heurist choic qm paramet system observ recent ration result improv local search random search perform diversifi search sequenc start escap local minimum smooth algorithm algorithm develop search minima potenti energi function idea transform minim function simpler smaller number local minima function smooth shallow minima leav deep ad deriv function function lead combin inflect point deriv inflect maxima minima grow seri function defin trace hessian matrix ad origin function deform effect grow infin lim neural comput survei easi exponenti oper flatten high frequenc compon function eigenvalu dimens larger higher fourier compon small oper preserv polynomi act lead diverg seri function fulfil finit easier equat appli exponenti oper function initi condit deform function simpl find remain minima gradient method perform transform obtain posit minima origin surfac minimum back gradient procedur initi point found kdt dt procedur appli problem physic chemistri context neural system deepest minima found minima trace back optim set paramet found direct applic exponenti oper requir abil systemat comput deriv feasibl equat solv special error function polynomi factor multipli exponenti case neural network minim method physic chemistri worth investig branch bound method method provid lower bound object function similar discret minim method combinatori ai search histori branch bound method advantag method requir inform function minim combin heurist techniqu explor search space method error surfac complet find local minima saddl point global applic method requir exponenti amount work find global practic problem case branch bound method work finit domain constant problem domain call root problem procedur calcul lower upper bound defin bound match current problem minimum domain partit smaller subdomain bound check graph search node defin expand find local minimum subdomain prune tree remov node lower bound local minimum found crucial point abil comput bound clear appli method rigor neural optim probabilist simul anneal estim neural comput survei method method inform minim function comput cone excit possibl conjunct branch bound method interv arithmet gain popular implement mathematica extens fortran interv method global optim faster point method singl real number repres interv basic oper defin interv fix point theorem combin newton method check solut interv exist evalu comput newton oper uniqu solut exist newton oper interv iter algorithm consist select box global minimum search list box empti true discard smaller toler put suffici smaller put list split box piec put list box list local global optima algorithm modifi hansen ad techniqu elimin portion box method formul recent effici partit scheme base interv arithmet rectangular partit constrain damp newton method real local provis stai interv local method algorithm spend time local minima newton method requir calcul interv hessian similarli usual hessian neural network applic process identifi box surround region error function box convex find largest box problem box saddl point treat prohibit area avoid list box algorithm box undetermin finish reduc smallest size list convex error function convex algorithm complex detail global interv minim method neural network applic difficult applic interv arithmet deal problem miss valu classif regress report local minim techniqu author neural comput survei genet algorithm great popular genet algorithm neural network optim stem biolog inspir method practic applic matter method biolog inspir mutat candid good local minima correspond random step mont carlo principl crossov enhanc probabl leav local minima contrast simul anneal gm method genet approach global converg carefulli compar result obtain genet algorithm global optim techniqu priori clear perform case neural problem success genet algorithm depend care analysi natur problem hand requir tediou genet rule major domain applic genet algorithm search larg space good solut optim hard problem genet algorithm inspir adapt learn capabl natur speci compar ga perfectli capabl explor discontinu space solut common global minim minimum background knowledg inform ga techniqu explor space paramet guid fit enabl solut popul evolv singl solut order explain principl ga problem optim space solut initi popul famili chromosom describ element popul evalu term adapt capac fit function measur capac chromosom solv problem main task fit function guid search promot good chromosom bad good chromosom select candid genet oper epoch genet oper finish popul process continu genet search run infinit control evolut condit termin defin level satisfact fit maxim number measur homogen solut termin process defin sophist criteria measur converg popul accept solut state ga robust optim method larg extent applic scope ga applic restrict problem encod set solut chromosom fit function defin fit function measur chromosom capac solv problem assign chromosom higher valu fit function fittest chromosom promot evolut evolut process improv qualiti popul optim solut found decad grow interest evolutionari approach neural network design subject slowli enter textbook neural network search space network structur type neural network obviou random search exhaust search practic complex domain imag voic robot signal process forecast neural comput survei type network model mlp network good perform effici learn qualiti gener strongli relat neural network topolog number organ connect effect network learn capac gener network architectur influenc network perform qualiti train converg train phase capac gener central issu neural network research question find optim mlp architectur frequent naiv approach network architectur arbitrarili design network train time depend result train neuron connect manual insert network train learn capac modifi network observ process repeat larg number experi requir find good solut poor comparison optim intuit approach accept genet algorithm find solut evolv popul encod candid solut problem case neural assign fit evalu solv problem process select network base fit function evalu genet algorithm capabl solv difficult optim problem genet base integr evolut learn combin connectionist method genet search techniqu evolv neural network appli number research project level integr connectionist genet varieti approach divid class class form approach genet algorithm train select relev input featur class emploi genet algorithm train neural network involv optim weight neural network predefin topolog class approach genet algorithm select neural network topolog fourth class combin previou method approach consid hybrid method novelti network perform aspect term network simplif achiev reduc network topolog elimin irrelev redund variabl problem find accept network train gener qualiti number neuron number input variabl fewer genet manipul network architectur neural network perform smaller set carefulli chosen paramet improv perform neural network model reduc comput cost overview genet method imposs review contribut vast field evolutionari comput genet larg biographi evolutionari design neural architectur found internet discuss mlp optim method method elabor literatur construct neural model modifi network topolog learn neural comput survei process call network network advantag comparison classic architectur design ad hoc perform comput time reduc ad neuron requir memori requir lower divid method main method grow prune network connect remov method variabl topolog method grow network method complex network topolog start learn process simpl insert neuron connect requir contrari prune method complex topolog start network larg simplifi method variabl topolog combin grow prune network learn phase method consid pure fix size network determin user learn process start turn unit consid variant algorithm method modifi network architectur end train phase call domain applic method reduc simpl problem involv boolean easili find simpl good neural network short time lot research network optim genet algorithm method group support collabor method hybrid method support method genet algorithm neural network vice neural network optim genet algorithm exampl genet algorithm assist neural network develop resolv vehicl rout problem problem consist minim distanc travel assign stop point servic order design hybrid system genet algorithm find set good paramet heurist search stop construct effici set heurist design select tour paramet find minimum tour encod chromosom determin heurist neural network gener initi popul type search implement genet algorithm neural network assist genet algorithm ga support neural network research select input data transform featur select network learn rule analyz neural network data kelli davi ga find rotat data vector scale factor improv perform neural classifi approach data reduct frequent data reduct improv network perform reduc comput time chang neural comput survei lippmann ga reduc volum data algorithm creat input data set origin featur gener raw data polynomi function al ga cluster subtask complex task neural network learn paper appli neural network complex problem involv combinatori optim ga frequent appli featur select train mlp kohonen network vector quantiz algorithm articl modif paramet learn ga determin learn coeffici momentum train mlp network speed converg improv comparison valu guha appli ga modifi learn coeffici depend number epoch caruana eshelman adapt learn momentum connect weight chalmer encod learn rule chang rule observ network perform previou epoch ga initi radial basi network train cellular neural network neural network analysi opitz shavlik ga explain behavior neural network defin function link network input output collabor method idea network optim genet algorithm train process popular ga determin weight connect quadrat error function fit function time consum heurist reduc comput time global minim method appli neural network minim error function natur combin ga neural network genet search techniqu find optim network topolog search requir genotyp defin function map genotyp phenotyp protocol establish link phenotyp environ relat problem hand method train capabl verifi qualiti network measur fit obtain method gener genotyp set genet hybrid method method ga modifi weight neural network connect consid effici base gradient backpropag applic ga initi adapt determin learn coeffici momentum neural comput survei applic neural backpropag recurr ga offer solut replac gradient learn algorithm encourag result obtain ga applic optim mlp network topolog optim rbf network paramet structur kohonen network specif map function encod network string requir optim number method encod mlp network chromosom method import problem defin fit function aspect hybrid optim system discuss describ process genet search optim neural network gener level process genet search process genet search divid main genet evalu replac aim phase build initi gener neural network domain background knowledg import construct procedur ensur sampl search space begin search start repres chosen search space domain priori knowledg user insert network optim solut initi popul initi popul network creat assign probabl reproduct gener network select oper creat genet call mate pool select network chosen reproduct carri probabl directli proport qualiti select strategi refer statist sampl techniqu interest techniqu stochast sampl simpl theoret sound network mate network produc appli genet oper oper crossov mutat crossov oper mixtur gene inherit creat preserv properti network success crossov appli systemat mutat oper provok jump insid search space modifi randomli select gene network popul prevent ga converg local minimum mutat creat evolut probabl small system larg number oper design evalu oper fit neural network popul measur oper step chromosom lead construct network consist comput fit function result attribut compar network gener select genet manipul process replac oper select neural network popul popul creat similar algorithm select strategi genet replac treat select oper system varieti strategi creat popul neural comput survei implement import aspect genet evolut neural network encod scheme fit detail network encod scheme evolut gener network decod chromosom repres neural train final network encod back chromosom train neural network connect qualiti chromosom cin chromosom cin learn test network network decod encod figur network encod inform encod chromosom common practic store network encod initi connect transfer learn paramet encod bigger search space encod paramet size solut space equal paramet slow converg genet process excess doubt qualiti insert paramet irrelev ideal network code scheme number requir fulfil good encod scheme scheme imposs control evolut process detail discuss requir found introduc problem common method encod mlp network encod scheme consist map network structur binari connect matrix cell matrix determin connect neuron exist hidden output neuron receiv connect neuron complet network structur repres list neuron incom connect direct encod scheme number advantag easi implement manipul larg number genet oper includ gener oper crossov oper drawback method result long code larg network main goal encod scheme repres neural network popul collect chromosom approach genet neural network direct encod scheme interest method exist author encod neural comput survei chromosom output input figur direct encod scheme scheme base grammar rule kitano develop method found rewrit rule fig illustr approach mlp network encod matrix connect creat appli rewrit rule neuron connect matrix size fig addit element matrix fill matrix replac symbol rule matrix symbol replac higher order symbol process end singl symbol connect matrix rewrit rule treat gene chromosom repres network structur rewrit chromosom matrix connect output input figur encod network rewrit rule neural comput survei sophist version method provid network encod scheme base network decomposit call encod subgraph neural network output attach connect connect output input network chromosom figur network encod semant point repres defin set network input includ part comput oper carri network partial function semant interact gene featur make manipul network structur crossov oper easi type syntact interact gene design genet interact gene interact gene possess common element architectur size chromosom code network proport number adjac connect output neuron indirect encod scheme base cluster method method encod neural network design achiev object effici simplic encod scheme import larg number genet oper manipul smallest syntact function element network architectur encod scheme applic wide varieti genet oper ensur network coher easili maintain fit function encod scheme definit fit function crucial import genet evolut function charg guid genet search process assign score neural network fit function incorpor criteria evalu network qualiti system criteria complex network topolog number network input network minim number train error valid neural comput survei simpl term number neuron learn rapidli factor import larg data file manipul popul fit network comput linear combin criterion normal weight import problem limit highest valu criteria user defin accept limit perform level network complex fit function network weight sum network qualiti qualiti network complex complex af qualiti complex network evalu carri network popul complet evalu valu qualiti complex renorm normal criteria heterogen domain formula qualiti complex ik nk weight assign user evalu criteria ik measur network qualiti train effici calcul speed train error introduc measur defin threshold train error reach time train process complex compon fit function measur topolog complex neural network term number number connect number input featur criterion maxim accept number input defin user constraint maximum number hidden layer maximum number neuron layer comput total network complex indic comput chromosom criterion comput indic input network chromosom comput total network complex neural comput survei complex formula valu rel appli indic global limit difficult estim priori case defin limit set prefer appli global normal categori optim criteria complex perform categori repres compon fit function compon fit function calcul turn weight appli fit formula lead problem result compon fit function network poor qualiti fit low network high complex good qualiti word poor network good chanc select reproduct avoid problem threshold qualiti complex defin network qualiti complex lower threshold strong penalti factor appli fit function neutral effect set critic threshold qualiti complex complex qualiti penalti appli qualiti qualiti complex complex pr pr pr pr condit penalti penalti defin addit coeffici network qualiti weight fit natur penal network low qualiti difficult defin accept network complex consequ harder estim threshold complex qualiti penalti complex lower poor qualiti comput fit function codomain interv obtain codomain transform perform network repres capac solv problem sort perform evalu function appli base train gener domain relat measur system user select perform measur complex network topolog measur account cost basic oper requir propag result input output neuron framework backpropag algorithm number neuron connect contribut calcul complex term fit function neural comput survei approach present implement prototyp evolutionari base neural system eco genet search optim neural network present section optim network topolog perform featur select problem doubt genet algorithm effici solv problem network optim static aspect network architectur dynam prefer method minim cost function perform method optim fit function genet algorithm method global minim primarili find solut train problem particl swarm optim particl swarm optim inspir evolutionari comput artifici genet algorithm swarm popul interact call flow space adapt simpli dx optim object function collabor search process particl chromosom vector space adapt initi randomli random veloc posit particl fit calcul inform current paramet valu achiev particl store paramet result swarm result individu particl influenc trajectori evolv particl ad current posit particl veloc id id id id id adapt random number inertia similar momentum standard backpropag algorithm inertia chang explor global plai similar role temperatur simul anneal simpl updat equat mix influenc global solut local solut trajectori swarm particl local version model replac vector paramet local topograph neighborhood perform method proof converg preliminari comparison genet method standard backpropag method show faster capabl find solut qualiti swarm solut case mlp train result larg optim individu slope sigmoid function algorithm simpl implement extend line adapt simul anneal optim network architectur global minim cost function find optim neural architectur special case gener optim problem genet connectionist method primarili optim neural architectur global optim method find neural comput survei optim principl start model suffici complex good global method minim error function optim network found practic strategi work larg train set costli comput point view small medium dataset strategi regular term ad error function quadrat weight decai standard quadrat error measur complex regular minimum descript optim brain damag optim brain surgeon procedur select neural model suitabl data survei network prune method quadrat weight decai term correspond assumpt gaussian distribut sum absolut valu squar lead laplacian regular weight decai term adapt paramet summat run weight network creat complex regular neuron small network output lead good gener bayesian approach neural comput automat adjust complex data success approach base bayesian techniqu estim likelihood model likelihood combin model final predict approach requir optim trial result frequent good regular theori simpl reason regular mlp network improv gener avoid overfit data base normal input vector arbitrari weight vector rang sigmoid argument li interv sigmoid maximum curvatur smaller weight norm network oper linear regim regular method forc weight small network approxim train data smooth altern frequent connect genet smaller architectur classif model regular smooth error function landscap optim solut hard find gradient requir larg network smaller network larg weight experi method show neural comput survei suffici recent form assum weight distribut distribut enforc penalti term lead larg number elimin irrelev term vanish weight equal similarli weight prune techniqu case backpropag algorithm term lead addit chang dw scale rel import auxiliari condit form error function independ paramet control enforc interpret function bayesian point view straightforward defin prior knowledg probabl distribut weight model network train classif task give crisp logic priori condit probabl prior knowledg problem insert directli network defin initi condit modifi view incom data network train start larg valu regular paramet train error initi larg mlp irrelev connect optim paramet found start penalti function encourag connect small final approach includ partial optim architectur global minim method lead optim architectur global minimum error function experi real world dataset initi method optim neural architectur good initi network structur adapt paramet bring neural model close global minimum make local minim techniqu suffici find optimum solut recent initi method base cluster statist discrimin analysi method work singl hidden layer paramet initi cluster simpli provid paramet add random number initi neural comput survei set structur network primari import mention small network small number paramet hard find global optim set weight gradient method good initi gradient method fast compar global minim method proper start point altern global minim method present easili extend architectur hidden layer suffici number hidden neuron account paramet layer set hidden layer treat output node layer pass inform short minim architectur complex extra connect small random output network pass final output extra hidden layer initi prototyp complex architectur initi network similar network global optim architectur paramet local optim network interest altern global minim weight arbitrarili larg norm weight simpli slope sigmoid result network small result optim initi compar obtain optim global minim techniqu remark global optim method combin global optim method text method worth neural network context lot work area understand weak strong point method applic book global optim descript method potenti optim architectur error function neural network hybrid method worth develop modif exist method neural network list formal point view genet algorithm defin specif prescript make adapt combin extens mont carlo approach select contribut error function randomli select train vector nearest neighbor modif mont carlo procedur sa scheme interest possibl combin simul anneal genet call ga speed sa case parallel recombin simul anneal goldberg parallel anneal procedur sa run creat singl initi gradient descent search valu found fix number function evalu list local minima found gradient procedur avoid repetit neural comput survei sa ga combin begin bit weight larg size flip bit sign singl bit weight possibl experi suffici good result anneal resolut paramet minima algorithm combin approach numer gradient techniqu ga sa optim neural optim final remark comparison result survei includ global optim method mathemat literatur suitabl optim neural system cut success approxim success partit method gener appli concav minim clear appli method context neural omit global optim method context neural good result challeng test problem global optim algorithm test problem number local minima grow exponenti larg rosen compar sa genet algorithm function local minima optim problem differ significantli work problem work problem experi method context neural system hard prefer compar minim method method optim network architectur seri benchmark neural system simpl benchmark observ scale properti algorithm problem size pariti problem grow number solv effici specif architectur evolv noisi xor output rest input network evolv simplest xor structur redund input noisi xor problem linearli depend input depend input introduc test hypercub classif problem test scale properti classifi systemat comparison method comparison asa ga suit test problem commonli test genet approach case asa outperform ga comparison made program michalewicz set asa perform compar asa simul anneal approach show superior approach asa paramet ga paramet conclud asa method tabu search appli problem neural comput survei interest method optim includ dynam hill climb give similar converg simul approach ga compar gradient method rare effici algorithm real problem blend problem outperform slightli backpropag momentum adapt learn rate result compar number minim method applic problem comparison simul anneal adapt genet algorithm michalewicz multipl random initi point gradient truncat newton method cascad correl construct neural algorithm random initi result obtain hour comput sun ss workstat hidden adapt paramet case algorithm achiev correct result test close approach conclud applic asa problem asa improv standard simul anneal achiev hidden neuron test result cascad correl correct answer unit test hidden compar achiev genet algorithm achiev worst unabl find good solut nettalk dataset uci repositori number hidden achiev good result test fall case comparison scatter literatur conclud genet frequent combin neural solut global minim problem optim neural architectur experi method variant global minim applic global minim techniqu neural system undoubtedli import futur hope survei motiv activ research topic refer neural network pattern recognit clarendon neural foundat introduct artifici neural system west publish st bd pattern recognit neural network cambridg neural network systemat introduct mh fundament artifici neural network mit initi optim confer neural network pp oct initi adapt paramet densiti pp neural comput survei statist method construct neural network intern congress neural inform pp oct minim distanc neural method world congress comput pp guess outperform long time lag algorithm technic note genet cd jr mp optim simul cj pm uci repositori machin learn comparison optim backpropag proc european symposium artifici neural pp extract logic rule backpropag network neural process letter neural transfer appli mathemat comput pm pardalo handbook global jd global optim optim train neural net transact neural van der minim method train network neural bw global optim neural network ieee se learn advanc neural inform process vol morgan pp hybrid minim method logic rule extract journal advanc comput optim rug gener mont carlo physic review simul practic versu math comput adapt simul anneal lesson control neural comput survei fast simul mathemat comput model rescal simul anneal world congress comput pp teach neural network simul anneal complex system dh ge tj learn algorithm boltzmann cognit jl mcclelland de explor parallel distribut comput model cognit percept mit ma rm bayesian learn neural network lectur note statist vol jr neural network optim perform studi graph bisect complex yuill statist physic algorithm converg neural wang vector quantiz algorithm base simul anneal proc int symp imag process neural vol simul anneal featur weight classif learn vector quantiz proc scandinavian confer imag lvq combin simul anneal optim design refer neural optim decomposit probabilist network simul anneal statist chaotic simul anneal neural network model transient neural genet algorithm fast simul comparison journal mathemat comput kp kp learn algorithm feedforward recurr neural neural thrun monk problem perform comparison learn algorithm carnegi mellon technic report neural comput survei extract logic rule train data backpropag network onlin workshop soft pp aug constrain backpropag featur select extract logic rule polish confer theori applic artifici pp poland reactiv tabu orsa journal comput reactiv heurist acm journal paper approach multipl minima train neural net reactiv tabu transact neural hv hsu superior train artifici neural network proc intern confer neural pp kan gt stochast approach global american journal mathemat manag approach find global minimum error function neural neural ma hybrid algorithm find global minimum error function neural network neural network zhou approach global minimum applic blind proc intern confer neural pp ra rosario rapid perceptron train proc intern confer neural pp hybrid algorithm find global minimum mlp error technic report global optim applic learn artifici neural pp amsterdam approach global optim applic neural proc intern joint confer neural pp baltimor inform method implement method simul found neural comput survei tang gj determinist global optim train neural random search method neural network train journal advanc comput modifi converg theorem random optim method inform ha problem conform analysi molecul deform potenti energi equat method journal physic cyclic comput simul journal american chemic model side chain applic local enhanc sampl simul anneal method find minimum energi journal chemic ka ha field theori tool conform optim test journal physic ph artifici addison rj van improv unconstrain global optim phd thesi appli global optim interv york tanaka architectur neural network interv weight applic fuzzi regress analysi fuzzi set system proc sixth intern conf genet algorithm morgan de genet algorithm optim machin rf reev steel artifici neural net genet springer proc intern confer artifici neural network genet le de phd neural comput survei de ge hinton rj learn intern error propag parallel distribut process mit vol dm build neural db lj fogel vm evolv neural biolog cybernet genet search optim neural conf neural network pp oct applic genet algorithm construct topolog intern confer artifici neural network genet pp review evolutionari neural intern journal intellig jw boer biolog metaphor design modular artifici neural network master depart comput scienc theoret psycholog leiden dj evolut experi genet connectionist model summer morgan pp sa genet synthesi neural intern confer genet morgan pp evolut neural rf cr reev uc steel artifici neural net genet pp genet evolut topolog weight distribut neural ieee transact neural gg pm todd su design neural network genet schaffer proc intern confer genet algorithm morgan pp dj neural network weight select genet intellig hybrid genet algorithm topolog optim neural tu dj whitlei combin genet algorithm neural survei state proc conf combin genet algorithm neural pp neural comput survei evolutionari optim structur neural network map proc intern confer artifici neural network genet springer steel artifici neural net genet algorithm intern dj ra caruana genet search exploit emerg behavior neural emerg north pp fz de brown wn fast genet select featur neural network transact neural gw game cd applic genet algorithm optim select paramet valu neural network attitud control iee colloquium high accuraci platform control pp digest dl learn algorithm train neural network electron sriniva lm learn neural network weight genet algorithm improv intern joint confer neural vol pp genet algorithm neural optim connect parallel zhang neural network teach genet discoveri intern joint confer neural pp mlp optim topolog genet rf cr reev nc intern confer artifici neural net genet pp rk nn evolv genet algorithm connectionist cg jd farmer artifici life redwood evolutionari algorithm design artifici neural conf neural network pp genet algorithm optim topolog determin back propag neural intern confer artifici neural network genet pp neural comput survei jr koza jp genet gener weight architectur neural proc intern joint confer neural sg lo hybrid connectionist symbol inform manual technic loui de msc thesi comput loui de msc thesi comput loui genet optim neural technic loui bibliographi evolutionari design neural genet gener neural proc intern joint confer neural vol pp determinist perceptron topolog reduct strategi neural phd loui compar bibliographi neural intern confer artifici neural springer pp dynam node creation backpropag technic institut cognit jp studi growth algorithm feedforward neural intern journal neural pp back propag algorithm reduct hidden unit converg artifici intern joint confer neural edward pp algorithm vari number hidden neural honavar network unit learn perceiv gener reweight connectionist model summer morgan pp neural comput survei method construct train feedforward neural neural mc lattic rbf altern construct advanc neural inform process vol natur algorithm optim hidden advanc neural inform process vol morgan pp ne improv perform genet algorithm autom discoveri seventh intern confer machin morgan ne pl integr adapt machin learn system rout schedul expert system pp tune neural network genet ai june jd kelli hybrid genet algorithm neighbor classif fourth intern confer genet morgan pp ej chang rp genet algorithm improv pattern classif advanc neural inform vol morgan genet task cluster modular neural network proc int workshop neural network pp ro genet algorithm select input neural proc combin genet algorithm neural sa bill radial basi function network configur genet neural network rbf intern confer artifici neural network genet algorithm pp genet train cellular neural neural network opitz genet refin topolog neural intern symposium integr knowledg neural pp vw db fogel lj altern neural network train ieee pp june neural comput survei pj gm saunder jb evolutionari algorithm construct recurr neural transact neural yao lin evolutionari system evolv artifici neural transact neural determin optim structur map genet algorithm proc scandinavian confer imag pp limit perceptron network step genet neural parallel design neural network genet algorithm graph gener complex gruau genet synthesi modular neural genet intern morgan je reduc bia ineffici select algorithm proc intern confer genet lo morgan pp dr overview genet part part research topic comparison select scheme evolutionari technic eth neural network synthesi cellular encod genet phd ecol normal eco research loui prune algorithm ieee transact neural network structur learn neural network dj practic bayesian framework backpropag neural comput bayesian classif theori result um advanc knowledg discoveri data pp mit press de note boltzmann tournament select genet algorithm simul complex system global springer neural comput survei scale properti neural classifi confer neural network pp octob jh holland genet algorithm outperform hill advanc neural inform process morgan kaufmann vol stochast hillclimb baselin method evalu genet algorithm advanc neural inform process mit vol kennedi rc particl swarm proc ieee intern conf neural vol pp rc particl swarm proc intern conf neural network pp linear neighborhood evolut proc annual conf evolutionari san world scientif
ML/196 6 techniqu base algorithm alexi oscar au ming depart electr electron hong kong scienc clear water hong kong abstract paper describ highli effici approach base motion estim techniqu techniqu benefit motion vector properti base advanc predict diamond search predict motion vector field adapt search techniqu motion addit motion classif phase depend motion addit spatial tempor inform consid improv perform extens simul demonstr efficaci compar standard techniqu line doubl line averag algorithm motion standard video video signal tempor interpol vertic frame horizont tempor frame introduct figur illustr progress scan versu interlac scan video interlac scan essenti part tv video code scheme year order address conflict resolut frame basic split consist index line field consist odd index line odd field field sampl time instant essenti doubl tempor sampl rate time total number pixel unchang interlac scan introduc visual artifact flicker make displai print singl frame displai interlac video vertic frame top field horizont tempor telephon fax frame bottom field progress monitor reason import convert interlac progress time provid improv vertic resolut vertic direct interpol scheme present order solv problem idea techniqu essenti reconstruct miss line displai frame techniqu includ spatial method motion adapt techniqu approach motion spatial method simplest fastest implement tend introduc artifact deterior imag qualiti rapidli line doubl line averag popular displai interlac video person comput motion techniqu shown yield result significantli reli robust reliabl motion comparison introduc excess comput complex recent highli effici motion estim algorithm base algorithm significantli reduc achiev similar qualiti brute forc full search algorithm predict motion vector field adapt search techniqu reli predictor motion estim motion vector adjac block top current median motion previou frame colloc motion vector addit fuzzi logic techniqu adapt pattern search enabl algorithm perform good fs algorithm term achiev motion field close true motion frame import case motion techniqu suggest algorithm excel choic figur motion field frame base algorithm paper present advanc motion techniqu unlik previou present techniqu gener miss field motion approach motion classif process introduc motion area satisfi addit spatial tempor perform result significantli improv perform versu simpl motion techniqu approach benefit smooth motion vector field algorithm demonstr techniqu perform motion estim algorithm section briefli give advantag algorithm properti discuss motion approach improv qualiti predict field section describ motion depend classif introduc addit step process final section extens simul result present demonstr excel perform scheme algorithm motion discuss previou base algorithm achiev smoother motion vector closer true predict motion vector compar includ fs observ tabl entropi differ current motion vector versu close relat motion vector spatial tempor adjac block understand adjac block highli tend similar motion vector suggest closer true motion field algorithm smaller entropi versu set predict predictor includ motion vector spatial adjac block top current motion motion vector colloc block previou frame predictor constitut predictor set import perform algorithm tabl algorithm significantli lower entropi compar algorithm combin figur claim give reliabl close true motion vector field experi select predict motion vector field adapt search techniqu algorithm essenti consid special case algorithm algorithm advanc predict diamond search select similar perform note recent accept recommend motion estim optim model superior speed qualiti versu algorithm import practic implement specif sequenc motion vector estim immedi motion vector repeat entir motion estim process full search algorithm sequenc median set median set stefan bu tabl motion vector entropi versu predictor perform field motion block size field interest current previou frame gener motion field time interv interest make estim motion field time interv achiev simpli divid motion vector motion techniqu gener miss field line miss field interleav origin field time interv case odd order gener progress frame motion estim field improv perform field frame mv mv insert field mv field frame figur simpl mv interpol method predict miss field question method perform motion assum perform motion estim field frame versu frame assum block posit motion vector easiest method construct miss accur assum block posit insid miss field motion vector equal time point frame figur assum block motion time equal time point frame reconstruct averag block similar frame advantag rel standard motion architectur accur method block posit posit shown figur track block estim block found insid miss field frame techniqu logic accur case gener block averag method evid pixel insert frame gener pixel leav empti gap insid insert field frame averag pixel blank pixel predict previou discuss motion method method accur complic field frame insert field field frame figur track motion interpol block miss field combin method reconstruct miss field frame select method special case motion techniqu perform normal motion predict miss field accur higher qualiti method motion shown simul benefit significantli smooth motion field gener base work motion estim algorithm algorithm benefit requir comput desir practic system perform addit motion estim smaller refin motion motion techniqu discuss case algorithm prefer motion classif motion techniqu previou section case achiev good improv perform addit spatial tempor inform interleav perform block base motion estim algorithm handl specif type scale inform reduc undesir artifact result process problem motion techniqu refer fact exist correspond vector cover uncov background newli object figur motion classif white frame filter addit classifi type motion pixel insid miss depend classif addit spatial tempor filter initi classifi pixel stationari depend motion vector experi note enlarg area favor oper benefit entir process pixel stationari oper retain store origin estim spatial median consid current interleav pixel adjac pixel origin preexist field predict interleav field line current pixel origin field line figur median filter interleav pixel weight tempor median filter perform interleav line base field frame oper basic result tempor filter pixel pixel insid field previou futur frame weight tempor median filter perform final observ notic perform estim depend motion happen horizont consid case perform addit spatial averag filter filter reduc elimin artifact due faulti predict pixel filter benefit current interleav pixel distort valu motion estim process assist classif pixel stationari block distort larger threshold block consid procedur filter adapt chang line averag preserv accur line edg vertic filter depend complex system featur disabl entir process figur motion estim motion motion classif field interleav spatial tempor median filter spatial low pass filter figur process paper simul perform extens simul determin efficaci method experi select interlac flower garden algorithm motion estim algorithm sequenc search area origin interlac frame sequenc figur visual qualiti frame good visual artifact insid reconstruct frame subject qualiti evalu consid perform addit experi artifici interlac sequenc select progress sequenc tabl miss america sequenc convert interlac drop field odd odd field frame odd frame interleav creat interlac frame sequenc convert sequenc field format procedur basic compar reconstruct frame origin refer accur evalu perform algorithm select block size motion process smaller perform predict accur accuraci motion motion perform base interpol motion half quarter pixel accuraci benefit estim significantli field motion estim process perform experi full search algorithm set experi algorithm techniqu compar versu line doubl line averag techniqu perform method normal motion motion motion motion classif filter result case tabl frame result sequenc figur fs sequenc frame tabl tenni stefan miss america tabl comparison approach versu line doubl line averag obviou tabl algorithm yield worst perform motion classif evid perform expect notic perform good appar stefan sequenc notic artifact evid gener sequenc observ frame result figur specif frame significantli lower algorithm claim perform significantli compar normal motion techniqu motion classif filter perform artifact reduc significantli significantli case tabl sequenc higher algorithm stefan complic higher frame result suggest perform scheme reliabl robust classif filter process addit observ perform fs classif sequenc tabl miss fs higher initi sequenc motion vector classifi nonstationari filter mean classifi stationari block classifi perform improv point point fs implement commonli standard system straightforward implement consid point equal expect fs block classifi filter perform paper highli effici techniqu present method base motion approach motion perform term subject qualiti suggest techniqu superior commonli line doubl line averag techniqu approach work motion vector gener motion estim evalu perform base result suggest regular motion field gener algorithm significantli complex make good choic practic system acknowledg work fund grant hong kong govern refer drawback interlac progress scan race microsoft corp comput hardwar broadcast technolog white algorithm interlac progress scan base direct correl ic ieee transact consum vol interpol techniqu scan rate ieee transact circuit system video vol pp effici edg line averag interpol algorithm visual commun imag process vol pp wang adapt interpol interlac video ee intern confer signal process interlac progress seventh european signal process switzerland motion estim interpol interlac video ieee transact imag vol pp method interlac video presenc domin ieee transact circuit system video motion vector field adapt search techniqu enhanc block base motion visual commun imag process san motion estim predict motion vector field adapt search techniqu report core experi fast motion estim advanc diamond search model version incorpor visual commun imag process vol pp figur frame algorithm figur frame tabl tenni algorithm figur frame stefan algorithm figur frame algorithm figur frame miss america algorithm figur stefan sequenc figur flower garden sequenc figur bu sequenc
HCI/197 4 annual progress report white paper rauterberg abstract plan research infrastructur pivot interact research decad articl present concept outlin research programm serv facil futur plan motiv vision futur develop interact intellig environ introduct document white paper major research initi eindhoven technolog paper explain concept relat industri scientif sketch research programm lab spark imagin reader includ set plausibl scenario articl dissemin plan idea attract interest ventur depart relat industri view platform collabor research project serv develop test ground technolog describ concept build temporari period refer resid function normal home requir live storag kitchen equip resid normal practic particip experi environ attract pleasant live stai resid experi rang technolog stai lab research investig technolog situat term thing instal technolog home compar provid cost save enabl observ imposs requir realism relat question laboratori experi subject particip hour control provid result transfer context daili true respect ubiquit comput technolog paper ipo annual progress report support equip extend usabl laboratori mean instal infrastructur camera record user activ video equip edit annot video log servic equip equip infrastructur home network high bandwidth connect telecommun servic observ life privaci set live lab tradit laboratori address detail design experi contrari tradit resid control awar observ activ requir design observ equip mix subject interest methodolog research problem relat import issu ensur realism daili life care daili habit resid unnecessarili disturb resid encourag bring music person concept live lab orthogon type technolog test confin establish technolog concept applic domain nutrit secur comput game children restrict desktop comput integr home technolog relat call integr vari rang electron insul paint materi main object demonstr provid futur serv proof concept technolog integr aim valid live lab clear limit current technolog obsolet year brussel subsum year construct contrari type aim articul integr concept futur restrict aim provid platform experi emerg futur technolog technolog studi reflect vision futur scope research programm remain open addit result research partnership focu concept ubiquit comput comput part life blend physic object surround home discuss applic domain header technolog partial turn develop resourc industri particip futur suffici fund develop type infrastructur ipo annual progress report vision comput term introduc abowd mynatt special area ubiquit comput comput inform unstructur activ typic activ clear start term effici perform central research topic comput includ develop form perceptu user interfac research technolog peopl respect daili home activ develop hardwar softwar infrastructur adapt techniqu design evalu emerg interact paradigm relat project smart live lab develop world review earliest influenti georgia tech live lab futur comput environ group georgia tech run combin live lab programm investig smart offic classroom technolog futur wearabl comput earli group approxim perman staff graduat studi partnership human technolog comput interest note group comput scienc human comput collabor project depart georgia electr centr school commun cultur construct awar home abowd complet serv live laboratori ubiquit comput home life intent produc environ inform whereabout activ involv parallel technolog research programm studi technolog smart floor support elderli occup awar home share research aim group georgia aspect focuss technolog intend pursu observ studi moment start dr tong live laboratori dr tong live laboratori vancouv open research facil simul home studi design product older adult ipo annual progress report person disabl infrastructur support remot observ observ audienc featur flexibl wall configur support test kitchen height locat applianc configur chang determin arrang sensit older similar major differ lab intend prolong stai adapt colorado colorado set resid predict occup return home determin start heat comfort temperatur reach time occup arriv detect statist pattern water hot water seldom middl dai water shut time infer occup activ occup engag control light pattern intens anticip room enter turn light room occupi project advanc concept demonstr report experi assess resid perceiv accept adapt behaviour concern test machin learn aspect technolog live tomorrow noteworthi demonstr built call tomorrow exhibit centr awar demonstr concept act fund industri innov attent paid serv actual user introduc technolog demonstr feasibl concept address real user turn domin interact form support microsoft window style perform contrast vision technolog artefact disappear background part life interact environ comput observ particip event occur mit system support concept perceptu interfac camera microphon varieti comput speech gestur recognit system peopl interact natur project combin complex comput ipo annual progress report vision techniqu demonstr impress arrai integr room shed light address complex softwar engin problem home microsoft built notabl demonstr campu washington home suggest form interact microsoft orient perceptu project project focuss softwar technolog creat smart home softwar comput machin concept home page similar activ interpret adapt compon discuss section open issu microsoft research identifi resid determin system interpret react action central research question pursu scenario section aspir provid idea type experi conduct locat insid ipo build campu separ hope scenario build imag activ scenario written ital comment follow normal print scenario list order technic start technolog move concept gradual element awar home address rang technic research issu elli visit sundai afternoon elli work european commiss brussel compani father athen sundai afternoon spend tv switch read sundai paper make elli connect virtual visit system sit couch project clear pictur similar qualiti tv imag half live room similar imag children wander visibl area chat bit thing phone start read paper read piec paper elli annoi absorb paper elli answer talk friend question friend end line chat bit decid end iron kid watch bore analysi elli cinema nice ipo annual progress report emphasi scenario find wai assess engin affect benefit real visit advanc video conferenc techniqu specif interest distinguish inform commun give sensori emot benefit visit joann medicin find find paper explain point palmtop list medicin bought expir find inform doctor meal medicin sit palmtop browser tv programm fact modifi displai record collect scenario focuss locat sensit access util input technolog integr ubiquit comput environ step stone activ comput interact design perspect tale start understand thing stori mother read mother invent plai dress doll parti sung song cook drag doll hair start redo thing yesterdai tabl hear descript fashion accessori mother put cover kitchen towel hear mother doll close song plai cd happi live room yesterdai tast scenario show affect benefit accru manner disrupt activ target children user design issu case control system recreat daughter identifi intim experi recreat involv research interest field interact basic technolog involv essenti record plai back achiev seamless integr simpl control system interest technic design challeng burst bubbl subscrib comput game target ag month daughter start project wall window friend mirror imag surround bubbl mirror imag burst bubbl pig drop sing bubbl start game time small forget ipo annual progress report plai real doll rock imag fade concentr game scenario requir interpret predict user activ adapt behaviour system simpli switch interact gestur children interpret complex imag process involv scenario demonstr advantag deliv ubiquit comput interact seamlessli integr activ plai move sit front machin bart bui groceri bart live busi write travel guid elderli travel enjoi household stuff eat conveni food monitor bui habit read bar code item nutrit advic notic regular permiss place order item bui regularli local groceri shop list thing list base shop histori bart activ interpret awar stop current assum diminish challeng scenario make recommend life subject point scenario demonstr adapt behaviour receiv feedback feed activ interpret household awar home involv numer adapt system adapt learn behaviour john learn read john learn read school good read sentenc word troubl mean sentenc parent plai treasur hunt put part stori gift place john read direct open parent hope john motiv mean read scenario focuss educ activ demonstr se educ activ support augment realiti system system test provid small famili activ interpret activ home advantag applic live switch quickli obtain idea success accept system joann rearrang furnitur joann rid comput tabl pc tower decid make put closer window camera automat point ipo annual progress report creat pick circl imag check paper time sit direct light aim book gaze drift window stai posit gradual light scenario focuss person ubiquit comput environ point easi rearrang furnitur focu comput interpret user activ reli form input reconfigur resid major research issu research group address moment configur intellig environ challeng research problem address awar home realiti furnish research programm mention simpli platform framework carri research project section sketch research topic investig home inform system research project concern access inform handheld devic gener concept applianc portabl bound singl room internet access conveni activ perform special tablet launch product year servic provid portabl devic enhanc benefit locat awar human activ relat studi watch opposit plan investig develop locat sensit run devic commun wirelessli servic provid inform relat nearest physic object awar manual wash machin programm close opposit local shop access manipul mobil sharabl persist prototyp devic comput type servic pose softwar architectur challeng seamless integr requir innov domain establish methodolog knowledg suitabl design servic factual knowledg technolog servic support activ interpret inform entertain automat control home enhanc rich model context hold inform obtain interpret interpret ipo annual progress report grate inform heterogen extens arrai context comput vision posit pressur activ interpret build model resid activ present relev inform control air call emerg servic explain import construct model user control temperatur room desir set put user insid system make appar close system open control variabl user chang thermostat user resort bring desir effect problem system provid rich activ model power combin system unstabl unpredict human control variabl valu monitor content eat habit resid appar system provid advic guest home adapt system context model construct system made suffici rich actuat behaviour system test experi sophist adapt home environ ach control base observ model pattern live inhabit main technic challeng develop extens softwar integr technolog servic activ interpret pose special requir air qualiti manipul directli control simpli window intellig control system account whereabout activ resid resid direct measur air qualiti insid interact design point user feel control system observ manag creat mental model reactiv behaviour system control system effect topic larg relat research focuss technic problem surround adapt reactiv behaviour system interact style ubiqu plethora devic ubiquit comput bring result workload complex interact user requir necessit develop interact style pleasur simpl resid pursu normal activ provid time servic term understood turk robertson import prototyp simpl graspabl interfac pen input support simpl messag function household member scenario previou section illustr user implicitli interact home system monitor requir extra explicit interact perform function ipo annual progress report toi game provid excel test case develop natur interfac serv applic locat activ interact style develop serv case studi relat ipo research design techniqu children user servic affect import benefit expect futur technolog develop high commun provid test ground high bandwidth outlin scenario visit previou section elicit ergonom technic recommend design servic concern emot benefit attain usag part actual life resid emot benefit encapsul concept affect slant concept william assess subject explor satisfact experienc virtual extent compar satisfact experienc physic visit research concern engin affect support notion resid commun close famili friend envisag natur imag interact investig altern contribut satisfi emot resid conclud research note list snapshot intent moment write report organ idea list descript basi research collabor materi scientif relev focu research comput consist develop comput interact emerg technolog enabl concept ubiquit comput disappear comput comput technolog artefact part requir develop area natur interact style natur mean interact support common familiar form human express leverag implicit action world turk goal host experi interact develop model adapt context interact function technolog artefact adapt context time eventu construct manipul adequ ipo annual progress report model user activ abstract intellig environ metaphor intellig butler guess serv total recommend improv urg posit action full rang interact style intellig environ identifi appropri accept person context assess identifi technolog target popul segment technolog develop address evalu integr part life field research identifi technolog field test design concept essenti aspect research base design servic concept engin address peopl adapt design techniqu current design techniqu origin develop desktop collect user requir techniqu usabl context dai comput special target segment popul peopl address industri relev larg longer scienc technolog feasibl fact creat market electron applianc network infrastructur creat opportun domest mobil telecommun servic quot coen size market technolog room ubiqu room servic provid link develop comput interact servic type servic repres larger volum busi devic support larg corpor philip ibm build futur jini home compani includ microsoft provid softwar solut home network compani special secur system build version indoor posit system emerg posit system technolog earlier novelti reach earli adopt type technolog reach level matur requir obtain experi accept user averag technolog repres quantum leap number devic activ support user test realist set valuabl ingredi make technolog usabl address press societi ipo annual progress report plan infrastructur provid platform futur technolog plan partnership develop requir test research concept product manner concept orthogon technolog test infrastructur assess usabl intellig environ research redefin notion usabl emerg paradigm interact research provid methodolog guidanc design test intellig produc multimod interact capit implicit interact user methodolog knowledg valid applic practic implement test scenario bodi learn test emerg concept usabl research programm focuss core infrastructur concept accru methodolog knowledg conduct round clock observ peopl home develop interact design knowledg intellig environ acknowledg prof don contribut shape idea comment earlier draft paper special peter correct refer van editori effort refer ed te live futur comput environ group georgia institut technolog turner chi extend confer human factor comput april acm press dg ambient concept usabl unpublish present intern symposium eindhoven septemb dg part configur equip individu life style ipo manuscript jl room ieee intellig system te awar live laboratori ubiquit comput research na konomi cooper integr organ springer ipo annual progress report web tablet integr home chi confer confer human factor comput april acm press mc intellig environ adapt ieee intellig system da comput mit press rj gd smart mechan natur user identif track turner chi extend confer human factor comput april acm press social psycholog telecommun john wilei perceptu user interfac commun mm explor intuit interact style home inform applianc chi extend abstract confer human factor comput march april acm press comput centuri scientif design posit system find thing peopl indoor ieee
ML/198 6 continu state space control nonlinear system continu state space control nonlinear system ter van de van doctor de universiteit van op van de rector prof dr ten van door colleg te de der universiteit op februari te door ten hagen te prof dr ir dr ir bja prof dr hb prof dr prof dr jn dr ma der en informatica work part project control nonlinear system neural carri graduat school advanc school comput imag copyright stephan hg ten hagen reserv content introduct control design state feedback control unknown system reinforc learn problem statement overview thesi reinforc learn discret determinist optim control task problem solut stochast optim task markov process model base solut reinforc learn solut advanc topic summari rl continu state space continu state space learn continu domain summari discuss introduct unknown system linear quadrat regul system identif perform measur overview vi content influenc explor estim reformul system identif approach approach explor characterist simul experi setup explor characterist discuss nonlinear system introduct nonlinear nonlinear system nonlinear approach summari extend approach si nonlinear system extens estim quadrat explor characterist extend simul experi nonlinear system nonlinear system experi nonzero averag experi averag experi real nonlinear system introduct experi discuss neural introduct neural nonlinear neural deriv feedback function discuss train network simul experi nonlinear system introduct procedur perform global feedback function content vii train larger train set experi real nonlinear system discuss futur work futur work extend futur work neural futur work gener squar estim squar solut si estim mobil robot robot model robot notat symbol notat symbol bibliographi summari acknowledg viii content chapter introduct everydai life control system ride chang temperatur room drive citi destin activ common influenc physic properti system basi measur control system figur show configur control task system repres physic system chang temperatur room system properti system chang form paramet system height room paramet properti system constant form state system temperatur state system state depend current state paramet system control influenc state influenc state call control action appli time control action chang state system state disturb paramet control action control figur control configur chapter introduct desir mean switch disturb figur chang system state chang control control action chosen reduc disturb temperatur room drop window switch appli action design algorithm comput control action state algorithm call control base measur control decid switch design desir behavior system control base desir behavior inform control design design procedur design procedur recip construct control design check design specif met approach obtain control design control architectur control learn control system order architectur incorpor mechan interact system store gain experi base experi control infer control task action natur resembl learn control machin learn subfield artifici intellig infer mechan studi ml point view infer mechan control architectur call reinforc learn control architectur receiv scalar call action appli system consequ action state action appli thesi focu kind consequ action state action combin state consequ select chapter formal control task give overview control design approach present problem show solv give short descript rl final present problem statement give overview remaind thesi control control system control design task control engin control theori mathemat framework control design task formul framework real physic system abstract call model order find model influenc control action state chang function describ state chang call state transit thesi time discret system state control repres vector ir nx control action vector ir nu vector ir nv state transit model system repres time step form function map ir ir nx repres state transit paramet system includ vector repres extern disturb influenc state transit model form abstract approxim necessarili complet account consequ dynam system design control regard stochast variabl note model repres markov process mean state depend past state action thesi assum model reason assumpt higher order markov process repres markov process combin past state influenc state transit state model describ chang state issu reflect model measur real system state measur sensor measur made control system measur form extra output system account model extra function map measur includ model assum state valu measur directli control model assum state control assum control present state leav state feedback control mean control form function map state control design control matter find function call feedback design state feedback control goal design find control system mean desir behavior system control main design optim design method base optim control optim criterion criterion continu time system model repres chang state chapter introduct scalar evalu state valu control action evalu repres task find feedback lead lowest cost stabil design method base stabil prevent system instabl state instabl system grow bound potenti damag real system main design principl optim base design aim stabil base design aim prevent worst behavior note principl exclud instabl system cost optim base design stabil system control stabil control perform optim control criterion design principl feedback comput explain conveni introduc import class linear system model linear system repres linear function control action ax matric proper dimens repres paramet linear system stabil base design method quantif stabil select paramet feedback feedback ir repres linear feedback make describ state transit base close loop appli dx repres paramet close loop state futur comput multipli matric easi eigenvalu give indic stabil larger system unstabl smaller system stabl closer eigenvalu faster state approach includ disturb state transit eigenvalu determin time step time step neglect optim base design method evalu criterion chosen desir behavior system criterion repres cost state appli control action system dynam futur consequ action cost simplic ignor control account make optim trivial method find linear quadrat regul case system linear cost quadrat function state control action shown optim control action linear function state total futur cost state form quadrat function state paramet function found solv algebra equat optim linear function system quadrat function model base predict control model futur system predict give indic futur cost system linear cost quadrat function optim control sequenc finit horizon comput action sequenc appli system time step procedur make method linear system constraint optim method comput optim action time step dynam program state action space quantifi dynam program start finit point optim control sequenc comput backward model system dynam program chapter introduc reinforc learn chapter linear quadrat regul linear system introduc simplifi explan control design method understood appli linear system main reason model linear system mathemat conveni properti system defin system linear control design approach nonlinear system develop overview method altern approach formal nonlinear system properti linear system describ properti nonlinear system properti global state valu hold unknown system control design method appli model system gener entir system model specif valu paramet system identif method develop approxim model system base measur chapter introduct measur gener appli control action system control action chosen excit system case properti state transit function estim data set measur control action possibl identifi model linear model system assum linear function describ state transit paramet model estim identif method linear system understood paramet estim linear squar estim method local model global model build smaller local model local model valid restrict part state space contribut output global model restrict gain schedul output global model comput base local model state determin local model local weight local model contribut output global model contribut output local model depend weight weight depend state local model linear combin linear model nonlinear function approxim global model altern approach fuzzi reason determin local model case overlap membership combin local model comput control action system membership function hard determin case adapt membership train data system nonlinear model system nonlinear linear deviat model system larg mean paramet nonlinear model found function class system gener function approxim neural network paramet model found learn method train network mean quadrat error real state model minim model system found design control call indirect adapt control appli system vari time model form simplifi local descript system identif find paramet model model tune paramet control reinforc learn adapt control base estim model system design specif estim directli measur call direct adapt control case possibl tune regul tune regul directli estim paramet requir adjust feedback base state refer signal model modif case nonlinear system approxim chang current model model make control easier feed forward network model kinemat robot feedback nonlinear feedback function adapt nonlinear system reinforc learn reinforc learn machin learn point view collect algorithm optim control task initi present method improv interact dynam system establish regard heurist kind dynam program object find function map state system control optim perform criterion compar polici repres feedback function feedback function optim interact evalu system regard rl form adapt optim control interact state transit result scalar reinforc perform criterion optim expect sum reinforc criterion maxim reinforc repres reward minim repres cost function repres expect sum futur reinforc state rl optim perform estim function function approxim tempor learn learn rule approxim state updat base approxim state reinforc receiv state transit futur perform present state select state action model system requir action highest probabl bring system state select model model free rl chapter introduct techniqu develop rl idea sum futur reinforc approxim function state action function call state action combin select action present state model free optim optim perform interact system direct adapt control scheme approxim made visit state action state approxim action reli action state determinist map state gener data approxim action interact depend exist depend random process process refer explor explor import determin search optim polici search search space larg proven rl converg optim solut proof reli perfect backup visit state appli action converg optim solut discret number state action converg proof reli discret state action space rl appli system continu state action space rl obtain control manufactur process process chip fabric thermostat control obtain control satellit posit found rl chemic plant reactor rl control system approach applic primarili base theoret understand close loop perform approach problem statement reinforc learn approach successfulli appli control design approach find control previou section gave exampl approach perform simul system case result control control real system advantag reinforc learn approach requir inform system gener estim perform approach appli advantag exploit perfect model system requir success result suggest rl find good control reason rl approach appli simul directli real system reason rl learn slow overview thesi process interact system repeat time durat time step real system system slow process chemic plant learn long time simul durat time step time simul time step learn time faster comput speed learn process problem rl appli real system algorithm base heurist impli outcom complet understood real system import hold instabl damag system mean rl algorithm appli directli real system advantag exploit goal thesi make reinforc learn applic control design approach real system mean deriv method deal continu state space problem reinforc learn approach base system discret state action space configur control real system continu state valu input continu action output deal nonlinear system requir high disturb system excit system involv ad random compon control action real system minim amount excit requir requir data data obtain control mean sampl time system determin long gener data point larg sampl time mean gener lot data long time system wai interpret result mean indic qualiti result control test real system chang set achiev result method properti method deriv properti overview thesi thesi rl start introduct rl chapter theoret result rl address configur discret state action configur explain basic idea rl describ rl method continu state space chapter introduct system control refin problem statement direct investig chapter linear quadrat regul framework optim control task introduc approach obtain feedback framework compar result indirect approach estim paramet system deriv feedback introduc explor characterist reveal influenc amount explor result feedback method base prove result feedback amount explor chapter investig consequ appli nonlinear system shortcom introduc extend solut result linear feedback addit constant approach approach chapter test nonlinear system simul real system chapter introduc neural approach neural network control deriv obtain linear nonlinear feedback function suggest futur work chapter chapter reinforc learn previou chapter reinforc learn chapter give introduct rl explain basic rl concept understand remaind thesi complet overview rl theoret result rl appli system discret state action space start introduct base system describ optim control task determinist system present systemat procedur comput optim polici introduc markov process describ classic solut approach model system rl optim base interact system describ import rl tempor learn rl system previou system continu state action space rl method continu state action space task chang problem discret state action problem quantiz state action space origin discret algorithm modifi algorithm deal gener function approxim oper continu domain focu conclud discuss refin problem statement discret determinist optim control task introduc basic optim control task restrict determinist discret system problem discret determinist optim control task consist denot discret state action make clear distinct continu state action chapter chapter reinforc learn finit set state ns indic label state system set action na set action depend action state dynam system state transit system current state system state denot state time step time index element set state time step determinist system state transit map present state action state reinforc receiv reinforc time step depend gener depend state transit action place time step criterion criterion desir behavior describ reinforc time step combin give scalar indic perform sum reinforc minim depend reinforc interpret cost reward criterion base averag reinforc state transit action state result state polici function map state action state polici determinist entir futur sequenc state action determin criterion solv optim task criterion minim cost goal state polici futur comput total cost goal state state call function state final time step goal state reach optim task find optim polici valu state minim note optim function optim polici uniqu number discret state function regard vector ir ns element vector state call denot optim solut stochast optim task solut comput optim function determin optim polici systemat procedur comput optim function start goal state state reach goal store minim cost state store action lead minim form optim polici polici optim polici step goal state state reach goal state step state select action receiv cost store state minim store check state store goal state reach step state lower store chang store action optim polici step goal state procedur repeat state reach goal state optim action store optim polici underli idea procedur optim relat min state reach time step repres cost receiv time step action appli state action state left hand side comput action determin minim minim store procedur call dynam program gener form call bellman equat defin optim action action minim success state cost receiv time step illustr bellman equat find algorithm deriv optim action stochast optim task solut determinist optim control task straightforward restrict class optim control task gener class optim task markov process framework introduc rl describ model base solut markov process mdp consist element determinist optim control task state transit reinforc longer determinist chapter reinforc learn state transit process transit probabl state state action ss pr probabl form model system determinist system special case valu ss process markov process state transit independ past properti express function function current state function mdp defin similar account stochast state transit expect subscript polici action futur select polici state transit final time step goal state vari lot state transit lead state mean state transit number time step reach goal state infinit consequ sum expect varianc underli probabl densiti function high discount factor introduc weigh futur reinforc reduc varianc make function easier approxim gener definit function stochast system note reason includ discount factor situat reinforc goal state situat reduc polici eventu reach goal state equal good discount factor make state closer goal state higher valu optim polici reach goal state smallest number step model base solut describ solut method base comput function model system probabl probabl estim interact system model system longer comput function stochast optim task function comput solv stochast optim control task solut method backward induct final time step futur stochast optim gener form bellman equat ss ss ss matrix state transit probabl action optim polici vector ss repres expect reinforc assign state transit optim action ss main state weigh probabl occurr optim polici polici expect sum futur reinforc minim defin matrix state transit probabl polici row present state column state defin vector expect reinforc state written compact compact notat bellman equat dp requir state transit nonzero probabl account make comput method polici iter bellman equat condit hold optim function base equat iter method develop comput optim polici polici iter consist basic step step polici polici function comput step polici improv step polici comput comput greedi polici determin polici state action chosen result state lowest polici evalu iter algorithm base action polici evalu expect iter calcul transit probabl ss expect reinforc ss polici iter step evalu start initi valu state updat ss ss polici evalu step note polici evalu step complet appli state chapter reinforc learn similar polici evalu regard comput function backward expect reinforc finit time step initi make expect cost final state transit discount cost final state futur cost state transit iter vn equal correct function found practic problem polici evalu unknown infinit fortun greedi polici function chang polici evalu stop polici improv greedi polici greedi polici argmin ss ss greedi polici hand side greedi polici comput evalu step number evalu step longer polici improv polici number polici optim polici found final number polici iter step iter polici iter dp polici iter optim action polici evalu action current polici dp action optim consid combin method call iter iter step approach polici iter step combin replac ss ss greedi polici vm account state polici chang immedi greedi polici condit polici iter proven converg optim polici note dp iter optim action assum optim true begin approxim function correct action iter optim reinforc learn solut model base solut method model system comput optim polici system model main reinforc learn solut reinforc learn solut method interact system optim polici enabl interact stochast optim task initi polici system start initi state interact final time step process repeat time tempor learn polici data obtain interact system evalu polici function updat present state actual state receiv reinforc expect reinforc ss suggest updat base state transit probabl function updat state simultan state interact system repeat time restart experi goal state reach state receiv reinforc hand side valu repeat experi comput averag valu updat function result updat interact repeat infinit time drawback approach hand side state store increment combin hand side exist approxim lead updat learn rate correct approxim learn rate learn rate index rewritten chang proport current state receiv cost state call tempor updat call tempor learn explor problem approxim function base visit state state comput state spite repeat equal prevent addit random trial process refer chapter reinforc learn explor explor function excit system chapter explor mean action action polici strategi explor distinct made direct undirect explor case undirect action random select base predefin scheme undirect explor inform system account experi gather previou interact popular undirect explor strategi polici probabl action greedi polici probabl action paramet amount explor initi action polici improv step polici explor improv polici result fewer number interact system requir explor converg faster optim polici action lead state lower reach action polici consequ state action probabl improv polici visit state find shortcut explor function polici approxim model system comput greedi polici requir ss ss model free rl method ss ss introduc call base idea estim state action combin bellman equat ss ss valid state optim action comput hand side action ss ss state action action futur optim defin ss ss optim optim action bellman equat action min state optim action argmin stochast optim task impli optim comput optim polici polici defin tempor learn approxim tempor updat present state state updat present combin combin requir futur action polici mean action current action action explor tempor updat greedi polici determin similar argmin repres polici iter step process eventu optim polici found note origin base iter converg system repres mdp state estim converg tempor learn proven combin estim converg proven converg requir learn rate entir state action space explor learn rate hold condit requir make updat eventu converg fix solut condit requir make state space explor faster state visit updat function small requir explor theori state visit infinit chapter reinforc learn advanc topic benefit rl rl obviou reason rl model system model obtain interact system estim probabl probabl estim clear number probabl estim grow fast model state transit probabl comput complex evalu step quadrat number state linear number action converg rate iter depend number state na maximum number polici improv step requir gener unknown polici evalu step requir reinforc learn method benefici state space larg updat made state transit place estim valu primarili base state transit occur high probabl state transit low probabl occur larg influenc estim function worst case state visit worst case rl averag find optim solut faster problem larg number state speed rl algorithm requir averag comput classic run system obtain data solut speed learn gener time tempor updat current state receiv reinforc state transit state updat base state transit repres sum futur updat previou state reinforc receiv updat written chang case tempor past state account updat base sum previou tempor call learn weigh previou updat updat stochast optim task repres elig trace present state elig updat state elig updat updat elig updat correspond enhanc truncat tempor updat postpon data result learn enhanc fast onlin model model requir rl model speed learn model estim simultan rl algorithm complet model estim state transit probabl trajectori store previou run model gener simul experi similar approach updat estim function base real system base simul system approach model determin state estim valu updat priorit sweep prioriti queue maintain state state past updat base present state transit summari introduc reinforc learn markov process discret state action space goal optim map state control call polici discret state expect sum futur reinforc store state separ valu comput model system rl valu estim base interact system estim valu success state reinforc receiv state transit tempor learn base observ estim present state updat estim state receiv reinforc good approxim state visit addit random trial call includ interact system interact process repeat time restart system valu estim correctli polici determin action select highest probabl bring system desir state comput model system approach expect sum futur reinforc chapter reinforc learn estim state action combin estim correctli action select base estim valu rl continu state space continu state space rl approach previou section base estim state combin number state action finit rl approach system discret state action space rl algorithm find control system continu state action space system chapter state ir nx control action ir nu mean directli appli algorithm system give approach appli rl optim control system state space quantiz obviou solut continu state space discret quantiz state space form state state part state space group form discret state continu state space invert pendulum partit finit number discret state advantag method standard rl algorithm continu state space system markov discret system longer markov mean converg proof appli standard rl algorithm longer valid solut found suboptim due quantiz set polici reduc optim polici continu state space problem set case optim solut found discret system perform badli continu system choic quantiz influenc algorithm develop adapt quantiz method base neighbor organ map method triangular state space base data improv divid conquer algorithm larg state split advantag adapt quantiz method result optim polici fix quantiz method larg state split probabl smaller state smaller consequ estim valu state reliabl rl continu state space system actor critic figur configur function approxim function approxim repres function function approxim repres function rl context function approxim configur shown figur function approxim repres polici call actor repres function call critic critic input state action form function qlearn function approxim critic gener function comput action approxim minim hard analyt function minimum numer approxim architectur gradient critic comput updat actor function approxim neural network approach successfulli demonstr result program plai world champion level note appli system finit number state neural network gener state applic mention section base function approxim feed forward neural network cmac radial basi function combin stabil control exampl rl function approxim fail exampl setup modifi make work proof converg function approxim exist approxim linear weight appli mdp system continu state space proof gener function approxim gener recip make function approxim success requir note critic state input chapter reinforc learn hand tune set experi proof converg continu space problem exist linear quadrat regular task gener function approxim approxim specif task learn continu domain network repres function approxim describ train critic function repres input approxim repres state approxim repres state approxim repres paramet network train critic method train critic base tempor updat introduc section extens updat function approxim updat base gradient respect paramet function approxim lead updat learn rate weight factor past updat sequenc past updat elig trace make updat depend trajectori speed train network train fastest depend problem found empir repeat train minim quadrat tempor error learn method function approxim base minim sum squar error target network output similar tempor express error minim note term introduc learn rule function approxim discret case section rl continu state space standard steepest decent method mean train critic minim quadrat tempor error repres critic weight discount factor error complet function approxim output point input steepest decent updat rule base learn rate small converg suboptim solut solut optim due possibl converg local minimum residu algorithm tempor method regard residu bellman bellman equat hold error advantag steepest descent bellman residu made converg matter make learn rate small remain risk end local minimum learn converg slowli compar updat rule disadvantag converg function approxim base observ residu algorithm main idea combin learn minim bellman residu train actor function approxim repres polici feedback function repres weight actor discret case polici greedi respect function chosen critic approxim function paramet actor chosen greedi respect critic critic repres function form mean valu actor deriv directli critic actor network repres continu steepest decent approach adapt weight depend critic repres chapter reinforc learn backpropag respect critic control action input gradient respect action comput chang action influenc output critic critic regard error function output actor chang updat weight actor perform note input network output network repres actor backpropag base tempor critic determin tempor actor updat tempor case critic actor train base tempor backpropag base tempor improv recent approach gain interest solut method problem domain actor repres probabl distribut action drawn result determinist polici drawback approach learn slowli gener idea actor critic approach formal heurist dynam program describ famili approach base backpropag actor critic configur action depend regard tempor learn altern approach approxim gradient critic updat actor extend gener framework critic gradient train simultan main drawback approach complic implement algorithm trivial summari section show wai appli rl algorithm obtain feedback function system continu state action space solut approach base discret state space origin rl algorithm appli solut function approxim estim case approxim repres feedback repres express singl input discuss discuss rl control refin problem statement rl control rl solv optim control task mean optim control task formul rl problem system identif requir system excit order estim paramet system rl algorithm requir explor order estim paramet function rl adapt control paramet estim tune paramet control stabil plai import role control rl set feasibl action assum advanc state transit model actual valu mdp framework state transit probabl influenc paramet estim interest control system continu state action main approach state space quantiz result feedback function defin base local estim result feedback function easi consequ feedback control continu time system function approxim approach suit understand result feedback result feedback function determin actor main problem approach reli train hard train hard result improv function approxim approach close requir present section approach appli linear quadrat regular task problem appli nonlinear system approach good start point investig chapter reinforc learn chapter introduct chapter present theoret framework enabl analyz rl problem domain continu state action space theoret analysi proof converg rl appli problem found show converg correct function linear quadrat regular weight carefulli chosen function approxim adjust minim tempor error base idea converg proven rl includ polici iter base approach introduc solv task base squar estim quadrat approach model linear system appli system unknown data gener converg optim linear feedback proven practic applic result limit absenc analysi scalar show introduc bia make proof converg longer hold interest rl real practic problem domain continu state action space mean includ analysi interest rl approach perform compar altern solut method solv task unknown system indirect data estim paramet system estim paramet comput optim feedback compar result import replac rl batch linear squar estim advantag initi paramet result solut depend data solut method result solut method optim data gener feedback comput converg explor requir find chapter solut mean random action appli system practic control task indic minim amount explor mean analysi show perform solut method depend amount explor gener data section linear quadrat regular task linear system assum unknown present solut method give overview compar perform method section focu influenc explor comparison show determin amount explor requir converg show amount explor solut method confirm result section discuss section unknown system section describ task show obtain optim feedback present direct indirect solut method situat paramet system unknown defin perform measur give overview comparison solut method linear quadrat regul linear quadrat regul system linear direct cost quadrat linear time invari discret time system ax ir nx ir nu control action ir nx system time step element system assum distribut white matrix ir ir paramet system direct cost quadrat function state control action time sx ru ir ir design choic object find map state control action nx ir nu minim total cost finit approach fast case control close loop stabl total cost infinit close loop unstabl includ discount factor unknown system total cost finit unstabl system discount factor finit impli system stabl optim control action linear function ir uniqu symmetr posit definit solut discret algebra equat solut exist perfect knowledg equat solv restrict practic applic practic perfect knowledg system identif indirect adapt control paramet system refer system identif approach method solv problem unknown estim base measur gener control system lx exist feedback ir nu repres excit main unknown properti random process ad control action element chosen distribut white method present chapter knowledg control system time step result set bl repres close loop set form data set depend paramet initi state sequenc estim paramet rewrit identif identif control system identif stress main reinforc learn method note control form optim chapter total data set si si si si hold si squar estim si si si si si si estim paramet deriv si solut feedback si comput feedback si result approxim si approach reinforc learn method solv task unknown mean cost regard reinforc explain chapter main idea rl approxim futur cost find feedback minim cost solut dare express futur cost function state optim feedback ir nx ir feedback minim requir knowledg estim paramet requir knowledg system obtain feedback feedback deriv repres futur cost function state action ir ir function approxim base measur function estim paramet min hold shown xx xu ux uu optim task comput futur cost intract approxim futur cost unknown system vector concaten state optim control action matrix paramet optim show optim task quadrat function state action comput optim control action system model arg min comput state optim feedback function quadrat function symmetr posit definit matrix function easili minim set deriv control action ux uu result uu ux uu ux ux uu result ident optim function repres futur cost function measur gener feedback symmetr posit definit uu ux feedback minim optim feedback lower futur cost estim paramet form polici evalu step comput form polici improv step mean approach base polici iter good procedur repeat gener measur paramet estim sequenc valu form contract optim solut mean verifi correct polici improv step converg optim solut induct updat rule base repeatedli restart system gener data run updat learn rate make imposs compar result si approach chang algorithm singl data set learn rate paramet estim paramet system paragraph data set scalar reinforc direct cost feedback optim optim greedi polici chapter chapter comput paramet estim base data gener feedback function estim write definit lx note definit impli data gener stabil feedback case feedback function defin sum futur reinforc bound correct valu exist estim lx equat replac approxim left hand side tempor function hand side paramet paramet estim reduc distanc td formul squar estim note definit slightli write lx note matrix depend time step ql ql ql ql ql ql ql ql ql note si approach paramet system weight design matric made conceptu make practic situat scalar indic perform instanc energi consumpt system comput direct cost fair comparison defin function stack upper triangl element matrix vector unknown system estim symmetr deriv appli matrix result feedback ql approach comput approxim variant appli refer linear quadrat regul approach main requir restart system time gener data correct estim prior knowledg function class chosen fit task gener task global correct hold approach approach approach learn step entir data set main reason make compar result si approach analysi outcom easier estim perform perform measur method measur optim feedback result si ql comparison scalar perform measur requir feedback perform wai measur run system result feedback comput total cost perform approach compar specif setup result real compar result optim simul knowledg optim feedback comput norm good perform measur feedback similar futur cost result unstabl close loop result stabl close loop mean measur show result feedback approach optim show result lower total cost dare knowledg comput solut dare futur cost start cost approxim feedback express matrix compar matric result perform indic depend initi state td approach appli mdp result feedback approach chapter defin perform measur base dare sensit set experi function total cost start state symmetr matrix clear matrix exist close loop eigenvalu unit total cost comput rel perform quotient unit matrix rp bound minim maxim eigenvalu min min max max note min max min measur rp min max matter comparison measur gener measur note min max depend feedback matric defin problem practic situat max choic repres worst case rp respect chapter call feedback feedback overview schemat overview figur summar section setup left show system paramet feedback explor gener measur comput si approach shown top approach bottom comput optim feedback shown middl figur show explicit implicitli includ estim si ql si approach step estim optim perform independ step estim optim perform figur show addit inform requir deriv ql question mark figur comparison si section relat comparison amount left figur influenc explor si result comparison optim estim setup si ql lsi figur overview box paramet symbol arrow requir inform comput result influenc explor section investig influenc explor rel perform comparison start reformul method estim make express estim error linear squar estim influenc explor investig method explor characterist introduc describ influenc explor perform result feedback estim reformul approach previou base linear squar estim equat written solut depend matric addit paramet influenc result fair comparison import properti practic poor numer perform decomposit method exist overcom numer problem import implement investig influenc explor matrix main problem make hard explor influenc estim chapter upper triangular squar matrix matrix written implement matrix make hard solut depend explor influenc solut rearrang definit appendix make project matric project matrix repres column defin depend column multipli column result part linear combin column contribut outcom appendix show matric solv matrix row obtain start row column linear combin column singular situat result singular theoret analysi explor numer perform system identif approach rewrit estim si approach show result feedback depend estim express estim error show depend explor final show consequ estim error result feedback perform refer matric symbol rest chapter ignor absenc sum term row defin dummi equal scalar faster element vector influenc explor estim show influenc matrix si split part depend part depend si xl control action split feedback part explor explor si appendix show column si si nx explor approach faster make infinit low explor term domin outcom linear depend low explor uncontrol appendix show column si nx multipli larg low amount explor obtain result feedback si feedback comput feedback solv uniqu solut larg due explor case hand side small make assum larg feedback comput estim si bl replac bl outcom chapter low si amount explor larg low result si bl mean outcom approxim feedback gener high si high amount explor system si neglect squar estim solv dare comput feedback approxim optim feedback outcom conclud explor rel perform chang abund explor rel perform approach determin minim amount explor requir obtain outcom estim error defin si written si xd eb si express error estim eb si si si estim error si eb si nx si nx influenc explor estim error depend explor system si estim written sum correct estim error express result feedback depend explor system correct valu depend si minim explor express hold si focu amount explor system estim error express error depend configur indic level magnitud error make constant depend note assumpt rude approxim expect time interv size assumpt level magnitud expect proport cross correl fix time vari lot depend sequenc mean constant depend sequenc hold constant includ incorpor depend initi state give approxim expect estim error proport note maximum gener slightli error explor requir prevent singular comput squar estim neglect make larg maximum neglect minim amount explor explor estim correct rule amount explor larger amount system chapter approach analog si determin depend estim error explor system show consequ estim error result feedback perform estim show influenc matrix ql rearrang linear depend column ql write lx xx xu ux uu xx ux xu xx uu ux row ql element arrang redefin ql ql xx ux uu xx ux uu xx ux uu xx ux uu correspond xx ux uu rearrang vector xx ux uu vector xx xx vector ux ux element vector uu uu element feedback matrix xx xx feedback ux ux defin matrix row matrix row ux xx uu ux find express xx ux uu implement analysi function stack column vector note ux xu order element symmetr ux xu reason calcul feedback make ux xu influenc explor feedback comput solv ux uu ql uu ux uu ux obtain rearrang vector ux uu si approach feedback directli investig ux uu estim solut ql xx ux uu xx ux uu ql estim uu uu uu ql uu ee ee ql uu ee multipl matric equat similar explor ee singular estim ux similar form ql ux uu uu linear relat uu ux resembl xl defin close loop si ql ee uu ux ux uu rearrang ux uu written ql uu uu uu result outcom low ql amount explor low uu larger term outcom approxim feedback gener matrix uu symmetr chapter high ql high ql neglect perfect estim solv approxim outcom conclud explor rel perform chang high amount explor estim correct result rel perform correspond estim error find minim explor adapt express estim error si approach valu approach error estim uu ee ql ee estim ql ee uu level magnitud error remain rearrang uu minim explor approxim minim amount start assumpt ee ts assum ee ee definit assum ee ql assum level magnitud expect error uu error correspond free situat situat explor prevent singular comput squar estim maximum express depend constant constant imposs idea size thing conclud influenc explor amount explor requir approach larger amount explor requir si explor characterist main contribut chapter compar perform si approach influenc amount explor perform summar result section defin explor characterist expect perform function amount explor perform measur rel perform introduc section give descript similar solut method outcom method depend si uu estim view sum correct result estim error explor system estim error base influenc explor estim distinguish type outcom level explor type explor result outcom ii error amount explor feedback estim error domin outcom result feedback approxim feedback gener rel perform improv iii sequenc depend amount estim error domin outcom high neglect result feedback partli base estim error partli correct outcom depend realiz explor sequenc system sequenc rel perform bound due error iv correct explor estim error neglect si approach result system paramet estim correctli result paramet estim correctli explor characterist si approach sketch figur stress shown type outcom amount explor quadrat estim ql requir explor prevent singular mean line figur start higher valu figur chapter ii error outcom iii sequenc depend maximum maximum valu outcom lower bound rel perform iv correct si approach rel perform approach explor level feedback approach rel perform depend feedback gener data rel perform approach polici improv step figur result polici improv step start main explor characterist figur amount explor outcom occur clear type iv si approach approxim approach outcom approach depend si approach dash line figur lower bound rel perform due dash line continu solid bold rel perform optim feedback ii iii iv si explor characterist arrow characterist approach optim feedback explor ii iv iii explor characterist figur explor characterist figur show function data gener feedback feedback symbol line approxim feedback optim dash line lower bound rel perform due error grei area outcom rel perform lower bound simul experi feedback amount explor give improv feedback improv amount explor figur show approach due explor approach common optim feedback explor requir improv avoid outcom iii simul experi simul experi verifi result present previou section show explor characterist setup system direct cost unit matrix system number paramet estim approach equal measur estim measur gener close loop stabl solut dare optim feedback rel perform min max explor characterist comput explor characterist simul experi valu make paramet realiz explor system seed random gener vari figur show min max si approach realiz explor interv type outcom figur chapter min max realiz max realiz figur simul result dot vertic line system level dash line result si approach solid line result approach shown figur ii valu min max figur valu iii realiz result rp method iv rp approach result figur focu type iii iv outcom figur outcom type iv clear figur show max max outcom shown realiz iii realiz max max realiz max max hold approach realiz shown figur line max high impli high approach iv rp approach equal close si approach max closer amount explor max approach amount explor approach max discuss discuss chapter continu investig rl context order make realist includ system analysi proof converg valid explor chapter show system determin amount explor hard threshold level amount explor requir threshold result feedback result unstabl close loop amount explor avoid si approach altern method deal bia result system idea add bia optim solut approach reduc probabl unstabl close loop type iii avoid type iii outcom safer reduc amount explor find feedback gener data optim solut result amount explor reduc feedback comput singular squar estim present explor prevent numer problem squar estim amount explor case determin machin comput compar result indirect approach observ perform approach function amount explor similar main threshold level amount explor requir lower mean circumst converg indirect approach addit experi ident data set data set chang feedback gave improv visual inspect data reveal explor approach eigenvalu neg quadrat posit definit explor si approach indic influenc feedback higher amount explor threshold level feedback determin probabl unstabl close loop situat interest explor feedback determin polici iter step requir start good perform feedback step requir analysi base estim magnitud estim error error depend number time step contribut number time step perform indirect approach result present conserv larg number time step chapter requir improv perform base experi amount time step requir coupl time number paramet estim shown fair comparison approach optim feedback unknown linear system system identif approach estim optim perform separ approach optim implicitli includ estim comparison fair approach paramet chosen perform due approach explor result optim feedback gener data chang feedback impli feedback optim result consequ system introduc bia estim bia domin estim outcom explor larg result feedback initi result perform unpredict close loop stabl perform close loop unstabl result avoid import explor approach optim feedback continu state space problem reinforc learn approach work good bad condit hold good outcom altern approach base system identif perform recommend approach linear quadrat regular task chapter nonlinear system introduct chapter studi applic linear approxim nonlinear system show approach design control nonlinear system base local linear approxim rewrit nonlinear system linear system nonlinear correct studi nonlinear correct estim si approach chapter show approach estim paramet wrong function correct local part state space smooth nonlinear correct assum constant situat introduc extend approach approach paramet estim gener quadrat paramet estim result feedback function longer origin approach suit local part state space nonlinear function extens shown experi nonlinear system choic system vari nonlinear choic initi state show extend approach compar approach size nonlinear correct experi perform simul real system nonlinear nonlinear system chapter system repres order vector equat class time discret markov system system chapter nonlinear system function map map present control action state assum smooth continu gradient bound class system class linear system import class due mathemat analyz system behavior tractabl control design strategi make verifi control design specif met control design strategi base linear system illustr linear system simplifi control task object state fix state chang equal mean exist constant control action ax hold state unchang control action bu call set point show solut state uniqu determin control action import note exist solut complet determin paramet linear system exist control action result design control system feedback control chapter show linear system linear behavior close loop express paramet close loop close loop stabl system end origin close loop system end origin gener nonlinear function case solut solut mean valu valu impli correct control action verifi exact state control action hold equilibrium state feedback function equilibrium state solut eq eq eq multipl solut exist solut system approach equilibrium consequ stabil system depend part state space part state space close loop part unstabl clear make design control complic linear case matter nonlinear make close loop nonlinear case includ defin part state space close loop stabl conclud main linear nonlinear system linear system properti global valid paramet linear system depend state nonlinear properti local valid paramet depend state nonlinear approach give short overview method obtain feedback function nonlinear system show method reli techniqu deriv linear system fix set point set defin set point constant control action practic nonlinear system state equal due state system longer set state chang gener function chang bring system back set point make system back set feedback ad input feedback state set point task feedback control input design linear feedback local linear nonlinear function made set point map nonlinear system continu system assum local linear set point rewritten set point subtract side express state control action note assum map replac order taylor set map deriv chosen map replac matric form linear system chapter nonlinear system linear system linear feedback care linear system valid set point properti global valid gain schedul fix set point approach feedback valid set point feedback function valid larger part state multipl linear model mean local linear model comput set point explain chapter form global nonlinear feedback combin local linear model approach form global feedback control action determin local linear model valid current state gain schedul implement gain schedul partit state space comput partit local linear model respect center partit linear model comput local linear feedback fix set point approach local linear feedback result equilibrium state center partit feedback chang state system part state space local model determin control action feedback linear case chang nonlinear system global linear system call feedback linear object chang nonlinear system linear system choic restrict class nonlinear system map nonlinear system written map dimens linear system paramet control input control action comput ax repres control action appli nonlinear system transform nonlinear system linear ax ax result linear control action determin convent linear techniqu choic paramet linear system made simplifi design control linear system nonlinear clear approach restrict class nonlinear system exist case scalar state action clear condit exist gener situat exist verifi detail inform approach exist found physic system comput physic approxim gener function approxim case longer global properti reli qualiti approxim continu time condit qualiti approxim feedback linear condit system excit state space explor linear matrix inequ linear matrix inequ techniqu analyz nonlinear system proof stabil techniqu base idea nonlinear system set linear system state transit nonlinear system linear system defin gener state repres paramet depend current state control action linear system state transit lead stabil nonlinear valu consid paramet matric form set linear system matric set nonlinear system stabl state transit nonlinear system exist stabl linear system state transit set consist infinit number linear make imposs prove stabil linear system solut polytop paramet space linear system polytop select complet set linear system edg polytop stabl linear system polytop stabl approach norm bound stabl linear system paramet select linear system consid paramet extra feedback state transit linear system ax bu vector repres extra feedback simplic assum chapter nonlinear system proven norm valu nonlinear system stabl provid opportun stabil nonlinear stabil base control design techniqu set feasibl feedback control design approach select feedback set drawback approach set feasibl feedback depend choic polytop case unfortun choic good feedback reject worst case set feasibl feedback empti summari approach obtain feedback function nonlinear system feedback base local linear approxim nonlinear feedback approach assum map unknown local linear system approxim si approach chapter approach chapter deriv linear system interest obtain local linear approxim optim feedback function extend approach section show si approach chapter limit appli nonlinear system case estim base data gener small part state space show extend overcom result solut small part state space si nonlinear system si approach deriv linear system order perform appli nonlinear write ax bu ax bu ax bu describ linear system paramet extra addit nonlinear correct function equat strongli resembl norm bound case map si approach obtain feedback base gener train set assum train set gener small local part state linear system special case extend approach simplifi replac nonlinear function averag train set ax vector fix constant appli si result estim linear ax bu linear system correct present impli estim averag averag estim linear system good approxim result feedback si approxim optim feedback part space train set gener order consequ result result linear feedback function lx appli feedback function lx control equilibrium state eq longer origin equilibrium state eq show equilibrium state depend approach deriv linear system equilibrium state origin trajectori equilibrium state optim equilibrium state direct cost appli optim trajectori equilibrium equilibrium state equilibrium state trajectori equilibrium state feedback function lx freedom extens linear feedback freedom approxim nonlinear optim feedback assum optim linear feedback function shown figur local linear approxim lx good figur show addit extra constant feedback function local linear approxim feedback function equilibrium state eq feedback chosen trajectori equilibrium state select optim equilibrium state strictli speak repres nonlinear system global valid view linear system repres system depend chapter nonlinear system lx lx figur local linear approxim optim nonlinear feedback function solid line region approxim feedback lx local linear approxim good approxim nonlinear function approxim lx origin match nonlinear function close interpret constant fix set point approach optim extend approach result feedback function consequ choic quadrat feedback previou chapter form gener quadrat function gener quadrat function includ term vector constant quadrat function repres optim paramet greedi feedback found deriv set result uu xu result feedback compar uu ux show optim trajectori equilibrium state constant uu ad feedback function constant determin optim equilibrium state note scalar includ estim estim quadrat estim method quadrat slightli paramet estim previou chapter estim base explor characterist extend tempor similar approach lx consequ repres lx express estim linear squar estim estim includ estim obtain result lex absenc constant influenc outcom estim actual function estim function call extend approach function gener quadrat function anymor gener influenc reason constant complet repres cost receiv optim optim base avoid cost cost receiv influenc result feedback function explor characterist extend estim show paramet paramet estim result previou chapter suggest correct estim depend amount explor gener depend clariti indic omit note discount factor constant influenc outcom chapter nonlinear system train set explor characterist introduc section present overview qualiti outcom function explor investig result extend approach question extra paramet estim estim influenc estim question relev estim simultan estim extend approach includ extra paramet written similar linear equat hold xx ux uu xx ux uu repres repres extra paramet estim similar estim error row written estim uu ux chang ee ee uu uu uu ux main extra estim error depend estim error explor compar si influenc neglect ql previou chapter includ mean expect estim error replac consequ low larg extra larg amount explor requir minimum includ area explor simul extend characterist simul experi show reliabl extend approach show correct paramet estim system model ax lx explor characterist extend constant time step experi compar result standard approach experi correct found paramet estim experi estim posit estim final experi arbitrari set point set point determin direct cost paramet set previou depend experi experi perform time number time step experi correct requir knowledg correct experi equal addit requir initi initi estim figur show low valu chang larger correct obtain experi extens improv experi requir extend appli train set nonzero influenc estim nonzero influenc amount explor figur show optim feedback comput low valu equal scale similar experi happen amount explor depend figur show improv extend approach requir explor high valu make total cost extend approach lower total cost standard approach experi set point set point introduc section desir equilibrium state learn set point mean optim stationari behavior system extens motiv inabl deal simultan optim transient stationari behavior system experi extend chang cost chapter nonlinear system ru prefer equilibrium point figur show total cost clear cost reduct larger extend approach scale experi larger show explor requir result obtain state valu shown function time figur valu standard approach valu extend approach valu bring equilibrium state closer note equilibrium state equal cost assign control action simul experi shown correct found shown case result feedback ql lex outcom extend approach requir explor obtain result final experi show extend approach learn set point experi function experi function figur result simul experi ii solid line result extend dash line result standard approach amount system dot line simul experi nonlinear system total cost function state valu function time result figur result simul experi iii solid line result extend dash line result standard approach simul experi nonlinear system nonlinear system constant previou section show extend approach perform standard approach constant nonlinear smooth small part state space vari averag extend approach perform verifi experi nonlinear compar perform extend approach si standard approach chapter nonlinear system mobil robot nonlinear system mobil robot system descript robot found appendix model appendix describ robot posit orient world chang orient depend chang posit depend orient suggest nonlinear orient chang posit introduc nonlinear task robot follow straight line defin world state distanc line orient respect chapter nonlinear system line robot task implement figur top view robot left figur illustr gener task figur show implement line follow posit figur robot neg shown figur state meter radian express state transit robot sampl time trajectori robot describ part circl radiu control speed rotat speed gave speed fix meter control action rotat speed loss gener world line follow simul setup shown figur quadrat direct minim distanc line steer import reason give small posit assign cost line wrong direct simul experi nonlinear system compar result start experi give indic correct feedback show vari compar result approach test perform describ test result task find linear feedback appli si approach approach extend approach find extra term train set result feedback si standard approach lx extend approach extra term lx determin correct feedback robot turn mean correct robot turn mean correct state steer neg posit model describ smooth nonlinear function function symmetr origin state optim feedback function origin local linear approxim optim feedback function robot close small extend approach result larg valu optim feedback move robot direct line impli longer nonlinear chang longer form good local linear approxim optim feedback function extend approach provid approxim larg result order compar result criterion rel perform previou chapter optim solut total cost fix time interv criterion result feedback obtain base train gener start state test feedback start robot state time interv number time step gener train set short time interv made test feedback local part space train set gener chapter nonlinear system experi nonzero averag experi nonzero averag part state space larg condit extend approach perform si standard approach set sampl time number time step robot drive approxim gaussian explor higher level explor make imposs similar set real toler rotat real robot limit initi feedback feedback make robot move line hand small prior knowledg includ initi orient explor determin local part state space train set gener robot drive approxim speed meter robot approxim meter initi distanc line result neg worst case robot stop posit averag train sampl obtain part state space knew extend result mean averag si standard approach perform extend approach gener train set standard extend approach result feedback approach test start robot initi state test comput total cost tabl result feedback total cost test run shown standard extend tabl result experi nonzero averag simul experi nonlinear system result expect valu approach si approach total cost si approach highest extend approach lowest total cost figur trajectori shown show initi feedback explor make robot move slowli line trajectori show gener train primarili depend explor initi feedback trajectori test run result feedback trajectori si approach line figur move left robot rotat larg valu end trajectori small robot longer rotat axi trajectori standard approach resembl initi feedback reason robot rotat orient remain higher contribut control action extend approach approxim turn faster direct line explain lower total cost nonzero suggest averag extend approach deal outperform approach explo data si standard extend figur trajectori world line trajectori initi feedback line explor ad gener train set line trajectori test run chapter nonlinear system experi averag previou experi shown larg extend approach perform case nonzero averag line averag si standard approach correct extend approach estim correct result suggest extend approach perform slightli train set gener line experi perform approach depend size averag previou experi initi distanc determin averag vari initi distanc step estim result base train gener random explor reason gener train explor sequenc standard extend appli train set result feedback reliabl outcom approach result feedback function depend train set result feedback good train set good chapter show case amount explor explor estim quadrat posit definit case estim matrix posit eigenvalu train set nonlinear system gaussian white amount explor higher amount system turn train set explor problem contribut feedback function control action small train set gener close line trajectori determin explor situat hard evalu feedback estim correct neg correct approach reject result neg eigenvalu extend approach estim reliabl depend eigenvalu figur small chang optim feedback function lead larg chang mean small train set lead larg estim compar result situat wrong remov extend approach reject result valu contribut motion robot si approach criterion reliabl result train set figur show fraction run approach standard approach percent extend approach percentag neg simul experi nonlinear system standard extend fraction train set si standard extend function figur result initi eigenvalu percent result train set extend approach sensit train set result feedback function reject test figur averag total cost initi approach figur plot error bar total figur omit maxim standard deviat extend approach figur show total cost part direct cost si standard approach robot line face direct total cost extend approach small valu si approach lowest standard approach high valu situat extend approach lowest total cost si approach highest observ preliminari experi conclud train set gener close averag si standard approach perform averag larger total cost si approach higher approach extend approach lowest cost expect chapter nonlinear system experi real nonlinear system introduct experi real robot simul result appli real system state deriv odometri mean robot track posit world measur speed wheel translat import simul time step constant state inform directli obtain commun protocol process board robot durat commun vari introduc discret time step state influenc durat time step size control action appli bound high valu engin robot gener train set action toler safeti introduc action min max interv appli replac closest action bound train set consequ high valu explor longer gaussian robot finit part dynam system includ model simul mean trajectori time step circl consequ robot respond quickli fast vari control action explor amount explor contribut movement robot lower amount explor ad control action wheel spin wheel spin robot move rotat wheel real posit robot wheel rotat robot real odometri base measur speed wheel faster wheel spin similar control action lead state transit experi gener amount data set simul experi vari initi step gener data sequenc explor total gener data set explor sequenc data set gener shown figur experi real nonlinear system gener train explor sequenc si standard extend averag total cost function initi figur experi real robot figur averag total cost test method remov train set approach result figur show averag approach perform extend approach higher total cost simul experi compar figur figur perform approach practic simul si approach perform practic simul figur explor total cost function initi si approach sequenc total cost high total cost result feedback function wrong made robot move line sequenc total cost low low total cost mislead situat feedback found si approach high lead rotat figur action bound prevent robot rotat action appli robot altern min max time step robot close line start line case low total cost action si approach find optim linear chapter nonlinear system action result feedback approach min max figur explor sequenc total cost function initi extend approach notic plot standard approach similar explor sequenc cost low cost higher perform depend sequenc explor sequenc total cost low sequenc si approach extend approach exploit action bound extend approach optim local linear feedback function real nonlinear system simul experi reject train set result neg eigenvalu consid experi real robot standard approach train set result posit definit extend approach total cost feedback case feedback perform robot reliabl feedback made robot rotat faster direct line feedback due robot stop rotat fast robot face wrong direct rotat back feedback turn slower line impli reliabl indic base eigenvalu real robot si function explor sequenc extend function explor sequenc figur perform si extend discuss experi shown si approach optim local linear feedback correctli find wrong feedback find feedback control action limit action bound perform standard extend approach similar simul experi conclud correctli optim local linear feedback discuss start chapter present number method control nonlinear system method base local linear approxim system interest find feedback local optim show standard approach present chapter lead optim linear introduc extend approach approach estim paramet global quadrat function data estim paramet gener quadrat function consequ feedback function extra constant introduc result feedback longer restrict linear function origin test extend approach nonlinear system simul real nonlinear system compar si standard approach chapter result explor restrict part state sampl time extend approach perform mean feedback function base local linear extend approach standard optim feedback function origin multipl linear model construct global nonlinear feedback function form local weight feedback function local linear feedback partit state space nonlinear system result gain schedul chapter case result local linear feedback function obtain standard approach standard local linear model base train set posit partit respect origin mean model complet local consequ linear feedback partit origin smaller feedback origin consequ linear model origin optim impli form nonlinear feedback base local linear extend approach extend approach estim set point linear model chapter nonlinear system control design techniqu nonlinear system base local linear approxim studi obtain local linear approxim nonlinear feedback function nonlinear system regard linear system addit nonlinear correct local part state space averag correct si standard approach chapter approxim wrong function introduc extend result linear feedback addit constant experi nonlinear system shown addit constant extend approach perform chapter neural introduct approach deriv linear system quadrat cost approach appli nonlinear system cost result feedback linear consequ restrict quadrat quadrat motiv possibl linear squar estim obtain paramet paramet linear feedback follow directli paramet system quadrat situat gener feed forward approxim feedback obtain find state control action minim feedback function show feedback function continu function explain desir continu feedback function order continu feedback network repres feedback function configur section drawback network train network depend make train hard choic discontinu feedback network chapter method network continu feedback function idea combin carefulli chosen network call neural feedback deriv simul real experi base nonlinear system chapter appli neural method compar result gain schedul base extend approach result nonlinear feedback function global valid local part state larger part state space chapter neural neural nonlinear quadrat gener approxim feed forward neural network describ function activ function unit output hidden layer row matrix weight vector hidden unit vector weight output unit bia network output vector weight network repres input network repres obtain typic function figur drawn scalar state control weight network pick randomli clear smooth continu function feedback determin greedi feedback comput minimum state figur top view shown line indic similar plot greedi feedback function shown comput minim greedi feedback network comput greedi action involv find nonlinear function gener trivial task smooth figur greedi feedback function figur continu function linear tanh figur network hidden unit neural nonlinear arbitrari greedi feedback figur form feed forward network top view line indic bold line greedi feedback problem real applic system discontinu high influenc control behavior system unpredict drawback overcom introduc dynam output element static feedback low pass remov discontinu feedback function control action base current state previou control action approach solut drawback approach remov drawback approach chapter function approxim introduc repres feedback function continu function drawback overcom train actor base critic drawback remov main configur shown figur feedback deriv configur actor train base critic configur implic feedback repres network network configur major problem configur train network mean train paramet initi set select network hard determin set train network set influenc interpret result hard chapter neural actor network critic network system system figur configur dash arrow train actor base critic implic arrow feedback function directli approach greedi feedback comput set deriv control action quadrat implic linear feedback paramet feedback function express function paramet properti neural method properti neural method feedback function express weight neural network requir method discontinu feedback function neural neural base standard chapter feed forward network repres standard approach base step squar estim appli train result estim paramet quadrat deriv estim final linear feedback comput base deriv neural feedback comput analogu approach quadrat repres linear multipl quadrat combin state action estim paramet introduc make linear squar estim estim similar approach call neural base measur section written repres paramet quadrat vector state control action regard multipl vector write quadrat linear function requir input vector quadrat function input linear function input input quadrat combin element vector valu view layer feedforward network linear transfer function input extend write similar linear function exist valu equal note weight number weight higher number paramet stai close origin activ function resembl linear function neural introduc deal quadrat network linear transfer function repres nonlinear transfer function output hidden unit hyperbol tangent origin deriv small valu resembl unit linear transfer function weight hidden unit longer quadrat function deriv feedback function valu obtain case standard paramet immedi neural weight paramet estim base train deriv weight paramet obtain comput deriv function input mean paramet comput function depend feedback function gener nonlinear function omit superscript chapter neural show depend valu depend state control action comput paramet deriv comput comput neural tanh repres weight input unit number hidden unit rearrang comput control action comput linear multipl state nonlinear feedback function problem control action comput order solv problem split linear tanh nonlinear part correspond comput hidden unit linear result feedback function deriv network linear part nonlinear introduc hyperbol tangent transfer function linear feedback obtain network ignor hyperbol tangent function defin lead vector analog rearrang form quadrat function paramet deriv linear feedback feedback comput control action lx control action control obtain vector vector repres quadrat combin state control action obtain nonlinear feedback uu ux linear feedback function result feedback function nonlinear comput feedback function figur result feedback function shown figur strictli estim consist previou chapter indic hat neural linear nonlinear greedi figur nonlinear feedback feed forward network form figur figur show result linear feedback nonlinear feedback function comparison greedi feedback figur plot discuss interpret result feedback case larg hidden unit tanh small contribut hidden unit small case hidden unit small hyperbol tangent contribut hidden unit comput linear feedback interpret feedback function local weight combin linear feedback function hidden unit lead linear feedback function state determin feedback function state contribut total feedback comput hidden unit weight equal result linear feedback function global longer depend state neural approach appli result feedback depend state weight hidden unit feedback function linear linear feedback result ql appli data set standard paramet quadrat estim approxim small part train set larg influenc estim paramet case train sampl obtain part state space deviat lot quadrat function approxim influenc point hidden unit approxim true part state space base chapter neural averag linear feedback form hidden contribut train sampl result linear feedback smaller mean true linear feedback deriv network reliabl result standard approach linear feedback deriv network hold nonlinear depend weight linear feedback base state state contribut hidden unit feedback comput occur weight hidden unit larg mean import prevent weight larg incorpor form regular learn rule scale reinforc approxim smoother easiest make number hidden unit weight larg train network weight network found train network method section method minim quadrat tempor error discount factor train base minim criterion network start random initi weight increment updat iter step squar estim global minimum error consequ weight network squar estim solut case singular train network fail find global minimum error network approxim written network initi weight select weight hidden unit chosen feedback function deriv initi network linear true weight chang feedback remain linear true weight hidden unit larger result feedback linear prevent result feedback simpler linear feedback discount factor simul experi nonlinear system estim paramet quadrat function train network import singular low explor feedback comput standard approach neural approach start initi network network paramet mean singular low explor singular happen weight hidden unit larg result low explor train network tempor minim global minimum found result improv feedback function explor result feedback gener train set feedback deriv network feedback gener train set train set result feedback network initi improv high explor explor explor contribut tempor differ error minim tempor error lead improv feedback function explor make tempor error higher mean train set insu lower error train set explor train set network initi small weight eventu result similar feedback function simul experi nonlinear system chapter mobil robot experi approach system test neural approach main chapter result feedback function global valid mean test feedback function larger part state space order compar result nonlinear gain schedul base extend approach introduct system ident chapter set approach compar result approach train set mean train set gener linear feedback chapter neural gain schedul gain schedul approach partit state space separ partit partit local linear feedback obtain extend estim train set select consist train sampl partit mean make partit train sampl obtain local feedback gener train set start system initi state chapter observ feedback found train set gener initi impli feedback valu divid state space partit neg middl posit result feedback function consist local linear function border partit function feedback function continu make continu function smooth border partit local linear feedback comparison neural approach neural neural train set gain schedul combin train set train set train minim quadrat tempor error result depend initi train network ten initi weight network lowest quadrat tempor error prevent fit split train set set train test result feedback base train set gain schedul approach made hidden unit chose set number hidden prevent fit number weight close number paramet gain schedul approach initi output valu initi weight hidden random simul experi nonlinear system figur trajectori gener train set weight small initi result feedback linear nonlinear train procedur experi point major experi chapter train set gener start system initi sequenc explor train set shown figur train set combin form train set obtain global gain schedul neural figur control action function state chapter neural nonlinear feedback function result feedback function train set figur shown figur figur gain schedul result shown feedback function consist local linear case linear feedback similar feedback boundari partit clear figur result feedback base neural qlearn shown linear feedback smooth nonlinear correct feedback function test start robot initi figur trajectori shown gain schedul result trajectori start show jump cross boundari partit state space jump trajectori move similar trajectori partit line figur result trajectori neural shown clear jump trajectori notic larg initi distanc robot initi move faster line consequ nonlinear correct main experi chapter global nonlinear feedback mean test initi perform feedback function chapter initi test local linear feedback gain schedul neural figur trajectori simul experi nonlinear system perform global feedback function simul experi compar perform approach experi perform preliminari experi initi neural network train initi weight network lowest tempor error reach test test perform run robot time step drive approxim minut reason long test period robot visit larg part state space figur plot total cost function initi feedback approach valu result total cost neural approach symmetr quadrat input network lower feedback gain schedul approach result gain schedul approach robot approach line drive small distanc parallel explain total cost higher neural approach figur averag total cost approach experi note plot averag vari gain schedul approach perform badli averag result good shown figur bad min gain schedul neural perform gain schedul neural gain schedul neural averag perform gain schedul neural figur perform global feedback function chapter neural bad result consequ bad local feedback middl partit local feedback line make robot move outer total cost high case linear feedback outer partit make robot move middl partit consequ robot stuck boundari partit reason bad perform gain schedul result feedback function extend approach complet determin train set chapter show result feedback function good gain schedul state space partit partit train set lead good function partit make partit good perform neural approach complet train set perform averag train larger train set previou experi show gain schedul perform good improv result make partit train set good experi result gain schedul improv larger train set partit train set previou experi combin larg train set appli gain schedul neural approach larger train set figur result nonlinear feedback gain schedul middl partit show closer correct delta alpha gain schedul delta alpha neural figur control action function state larger train set simul experi nonlinear system jg tabl total cost feedback function base larg train set neg posit partit discuss section figur result nonlinear feedback neural feedback steeper compar feedback figur test result feedback function start robot initi state tabl show result total cost approach total cost gs lower averag figur show train set huge impact perform gain schedul total cost neural approach lower gain schedul perform figur good base smaller train train set huge impact trajectori test run shown figur figur figur outer partit robot rotat direct line step arriv state control action robot move straight ahead enter middl partit middl partit robot slowli approach line linear function middl partit figur steep reason middl feedback contribut control estim quadrat impli total cost higher neural feedback middl partit trajectori neural approach figur show robot move faster line trajectori figur feedback figur steeper figur trajectori gain schedul feedback base larg train set chapter neural figur trajectori neural feedback base larg train set experi real nonlinear system experi real explor sequenc gave result approach chapter result feedback function shown figur figur clear local linear feedback neg initi wrong explor sequenc result train set posit initi result feedback partit complet determin train solv gener train set partit figur result neural approach linear smooth nonlinear correct control action larg observ chapter si linear feedback deriv network larg part state space control action reduc nonlinear correct state control action action bound real action appli space limit test minut result total cost shown tabl result total cost gain schedul approach symmetr cost high correspond partit local linear feedback wrong result neural approach show perform initi order understand result tabl plot trajectori jg tabl total cost real nonlinear system experi real nonlinear system gain schedul delta alpha neural figur control action function state real nonlinear system neg partit robot move wrong direct partit local feedback wrong partit robot move line parallel line follow follow line consequ local feedback middl partit trajectori start close line approach line trajectori line start rotat fast line time step action higher safeti robot rotat maximum speed action safeti limit robot start line high linear feedback network make robot move line close line linear feedback result control action larg line due nonlinear correct size action reduc figur correct state valu part train set part state space control action larg experi shown gain schedul approach depend train set local linear feedback part state space feedback function found neural approach result feedback function linear part state space part state space train set correct control action deviat linear feedback result feedback function neural smooth unlik feedback function gain schedul approach discontinu chapter neural trajectori gain schedul trajectori neural figur trajectori real nonlinear system discuss chapter method appli gener network approxim result result feedback nonlinear show approach obtain feedback approxim function feedback directli advantag network network train make approach conveni import feedback function directli approxim similar greedi polici obtain select greedi action state advantag approach result feedback function smooth mean sudden jump gain schedul jump greedi action directli comput function approxim problem jump behavior system unpredict presenc jump neural gain schedul approach neural approach deriv global nonlinear feedback function set linear feedback function gain schedul local linear feedback determin control essenti partit feedback function good result poor perform solv gener data feedback function neural approach local weight combin linear feedback function result depend correct linear feedback function mean poor perform gain schedul train base complet train result good feedback function smaller train set gain schedul approach wai feedback feed forward network method base idea direct relat feedback method obtain linear feedback linear feedback comput nonlinear feedback function result global linear function local nonlinear correct chapter neural chapter futur work object research thesi give answer question reinforc learn method viabl method obtain control system continu state action space rl appli system finit number discret state action real system continu state action algorithm discret state action space appli directli applic rl control real system rl control design method applic train perform mean system characterist rl optim control base interact knowledg system train perform simul potenti rl fulli exploit main reason appli rl directli optim control system reason real control task reliabl control rl algorithm control continu state space task base heurist discret rl method mean close loop perform rl appli real system understood stabil learn explain hesit appli algorithm directli real system reason rl train slowli simul time requir obtain larg train set depend comput speed comput state transit faster actual sampl time real system real time requir obtain larg train set determin system speed algorithm requir train thesi rl method investig applic real system continu state action space issu mention converg presenc system learn small train set develop linear system quadrat extend local approxim nonlinear system neural find nonlinear chapter futur work feedback nonlinear system framework control theori linear quadrat regular task optim control task system linear direct cost quadrat function state action object minim total futur cost paramet system optim feedback function obtain solv discret algebra equat solut comput optim linear feedback paramet linear system system identif estim paramet estim paramet system comput optim feedback shown task solv origin algorithm adapt deal continu state action space linear system call approach proven result linear feedback eventu converg optim feedback explor result appli practic system investig influenc system perform result linear feedback aim determin amount explor requir improv compar tradit si approach fair comparison batch squar estim unlik squar approach result depend train set show influenc system perform introduc explor type outcom distinguish si approach amount explor feedback comput ii result feedback gener train set iii result feedback depend sequenc system explor iv paramet system approach correct feedback improv type iv outcom explor requir deriv si approach requir explor system deriv approach requir explor si approach extend futur work sum posit definit quadrat function correct posit definit quadrat function verifi eigenvalu matrix repres paramet neg eigenvalu paramet estim correctli case type ii iii outcom neg eigenvalu impli explor gener train set experi found neg eigenvalu estim posit definit explor order eigenvalu reliabl proven explor result posit definit approach requir explor si approach real system ad disturb control action enhanc practic applic requir amount explor reduc simpl variant action feedback comput tempor includ explor action time step includ explor time step explor ad control action experi shown approach requir amount explor si approach introduc bia make perform high amount explor result verifi theoret extend develop linear system nonlinear system control design approach nonlinear system base local linear approxim nonlinear system obtain local linear approxim optim feedback function investig consequ nonlinear write model nonlinear system linear system nonlinear correct linear feedback si approach feedback function approxim optim feedback function addit includ feedback function local approxim optim feedback function case averag nonlinear correct larg region interest obtain paramet gener quadrat estim show paramet estim origin standard approach call approach extend approach experi simul real nonlinear system confirm extend approach result local chapter futur work optim feedback function conclud extend approach appli nonlinear feedback function base multipl local linear approxim futur work thesi batch mean learn start complet train set make fair comparison method rl learn method squar approach task approach function approxim linear paramet function approxim condit converg learn approach compar squar approach investig neural function approxim rl approach configur function call critic approxim function call actor approxim feedback function approxim approxim actor train base critic make train procedur tediou outcom hard analyz approach combin neural network approxim case actor linear feedback function directli paramet function approxim train call approach neural obtain nonlinear feedback function nonlinear system neural linear feedback determin deriv respect input network give paramet estim approach paramet depend state control directli deriv nonlinear feedback function ignor tangent hyperbol activ function hidden unit obtain global valid linear feedback function linear feedback function comput control action determin nonlinear feedback function result nonlinear feedback function regard local weight hidden unit result local linear feedback state determin weight local linear function experi perform simul real nonlinear goal experi obtain global nonlinear feedback function compar neural gain schedul gain schedul perform make local partit state space local approxim extend gener approach experi shown neural approach requir train data gain schedul approach neural suit real system futur work neural approach base polici iter origin approach base iter feedback function directli approxim appli iter combin onlin learn approach neural iter polici iter investig weight hidden unit larg learn exist approach regular assign cost size weight consequ modif learn neural unknown result nonlinear feedback function longer perform mean research determin regular appli gener reinforc learn optim control real system continu state action space exploit benefit reinforc learn approach base feedback function directli approxim repres function paramet estim train set system paramet quadrat estim approach case knowledg gener neural approach appli give global valid linear feedback function local nonlinear correct chapter futur work appendix squar estim matric found zm column column row upper triangular matrix matric found result written project matric column column matrix project matric defin project matrix matrix squar solut main solv comput upper found backward substitut element appendix squar estim element element written valu fill find express row row written sum result express product row squar solut result si estim start row row comput si estim solut start row shown si si remov part linear depend previou column si row express si nx nu si nx express matric matric find estim feedback xl write feedback nx write si nx si nx nx si nx appendix squar estim defin si nx repres estim close loop appendix mobil robot robot robot experi nomad super scout figur mobil robot wheel drive geometr center drive motor wheel independ width robot cm maximum speed robot processor board low level process includ send control command drive track posit orient robot mean odometri softwar run board equip pentium ii processor figur nomad super scout ii appendix mobil robot model robot mobil robot freedom defin robot posit world robot orient speed left wheel control action make robot move geometr center robot control action speed rotat speed speed rotat speed width robot chang posit orient notic chang orient independ chang posit depend orient note simplifi model account integr fix sampl time interv discret time state transit hold orient chang sin appendix notat symbol notat convent properti variabl variabl accent result iter bold vector hat result estim tild dummi variabl star optim solut bar error deviat real desir subscript indic time element form method appli multipl subscript separ comma column matrix row matrix oper matric matrix indic indic appli method si system identif ql standard extend nq neural gs gain schedul appendix notat symbol symbol chapter continu state vector continu control action vector continu element gaussian white dimens state space dimens control action space time step state transit function state feedback function paramet matric linear system paramet linear state feedback paramet close loop linear system chapter discret state discret action reinforc polici function number time step probabl matrix expect expect reinforc discount factor iter indic learn rate elig trace input function approxim weight function approxim error function chapter standard deviat system paramet quadrat direct cost total cost solut discret algebra equat explor standard deviat explor symbol matric form squar estim paramet estim linear squar estim paramet quadrat subscript concaten state vector control vector rel perform project matrix si approach constant matrix quadrat valu contribut approach linear feedback constant approach ee quadrat combin action explor chapter nonlinear correct set point action system set point eq equilibrium state eq action equilibrium state addit constant feedback function extra paramet extend posit orient coordin robot world distanc line orient respect line chapter weight network activ function unit quadrat combin state control input network neural appendix notat symbol bibliographi pe cj harri reinforc learn approach optim control intern confer neural cg synthesi reinforc neural pi control appli simul heat coil journal artifici intellig kj adapt control cg sa aw moor local weight learn ai cg sa aw moor local weight learn control ai baird residu reinforc learn function approxim machin twelfth intern baird ag moor gradient descent gener reinforc learn advanc neural inform process system ag sj sp singh learn act dynam program artifici ag rs cw anderson adapt element solv learn control problem ieee transact bellman dynam program princeton dp bertseka dynam determinist stochast model dp bertseka jn tsitsikli program athena bibliographi ja boyan tempor learn machin sixteenth intern confer ja boyan aw moor gener reinforc safe approxim function advanc neural inform process system el balakrishnan linear matrix inequ system control theori sj bradtk reinforc learn appli linear quadrat regul advanc neural inform process sj bradtk increment dynam program adapt optim control phd sj bradtk ag barto linear algorithm tempor learn machin sj ag barto adapt linear quadrat control polici iter technic report sj ag barto adapt linear quadrat control polici iter american control pr kumar adapt linear quadrat gaussian approach revisit siam journal control hf chen guo identif stochast adapt control truncat tempor implement reinforc learn journal artifici dayan converg gener machin dayan tj sejnowski converg probabl machin ph dv dc ii neurocontrol altern system nonuniform nonlinear friction ieee transact neural cn pac adapt control linear system tenth annual confer comput learn gj gordon stabl function approxim dynam program machin twelfth intern bibliographi ten hagen bja gener learn joint confer inform volum ten hagen bja short introduct reinforc learn proc conf machin ten hagen bja reactiv critic proc conf machin ten hagen bja linear quadrat regul reinforc learn proc conf machin ten hagen bja feedforward neural network intern confer artifici neural network ten hagen bja reinforc learn realist manufactur process confer autom learn carnegi mellon ten bja mobil robot control proc confer artifici kj pj neural network control survei nonlinear control introduct mi sp singh converg stochast iter dynam program algorithm technic report mit comput cognit mi sp singh converg stochast iter dynam program algorithm neural lp ml aw moor reinforc survei journal artifici intellig kobayashi analysi algorithm elig reinforc learn imperfect function intern confer machin mv robust constrain model predict control linear matrix inequ bibliographi bja van dam adapt state space reinforc learn navig intern confer intellig robot system reinforc learn distribut local model synthesi phd linkop lj lin tm mitchel memori approach reinforc learn domain technic report school comput carnegi mellon system user prentic miller rj william applic artifici neural chapter tempor chemic process control applic tm mitchel machin learn mcgraw ag moor cg atkeson priorit reinforc learn data real time machin converg reinforc learn algorithm continu case base finit method intern joint confer artifici method local triangul refin continu reinforc learn problem european confer machin studi reinforc learn continu case mean solut machin learn ks narendra parthasarathi identif control dynam system neural network ieee transact neural van der nonlinear dynam control system peng william increment machin dv dc ii adapt critic design ieee transact neural ml markov discret stochast dynam program sj overview industri model predict control technolog symposium seri bibliographi applic sequenti reinforc learn control dynam system ieee intern confer neural concept facil neural reinforc learn control architectur technic process control neural comput applic bja aj neurocontrol reinforc learn journal automat special issu sp singh rs sutton reinforc learn replac elig trace machin learn py nonlinear model system unifi overview pp van der bja robot coordin neural network technic report dept comp da da white neural network base process optim control conf da da white handbook intellig neural adapt chapter appli optim control manufactur van nostrand sridhar averag reward reinforc empir result machin learn special issu reinforc rs sutton learn predict method tempor machin rs sutton integr architectur plan react work note aaai spring symposium integr intellig architectur sigart bulletin rs sutton gener reinforc exampl code advanc neural inform process system rs sutton ag barto reinforc introduct mit bibliographi rs sp mansour polici gradient method reinforc learn function approxim advanc neural inform process system takagi sugeno fuzzi identif system applic model control ieee transact man tesauro practic issu tempor learn advanc neural inform process system tesauro tempor learn commun sb thrun role explor learn control handbook intellig neural fuzzi adapt van nostrand jn tsitsikli van roi analysi learn function approxim ieee transact automat direct control method class nonlinear system neural network technic report cambridg van roi learn function approxim complex process phd watkin learn delai reward phd watkin dayan technic learn machin pj consist appli simpl reinforc learn problem neural pj approxim dynam program control neural model white handbook intellig adapt approach van nostrand ma jh fast onlin machin william simpl statist algorithm connectionist reinforc learn machin kj pj review advanc neural adapt control system technic report esprit iii project summari summari topic thesi reinforc learn control real system rl control optim base scalar evalu call reinforc system discret state action solid theoret base converg optim control proven real system continu state control action consequ appli rl clear enhanc applic rl understand requir problem rl appli real continu control task longer close loop remain stabl learn process make danger obtain random process call includ train problem rl algorithm train slowli mean slow process applic rl time consum system linear cost quadrat function state control linear quadrat regular appli lead optim linear feedback function system identif case system unknown task solv rl approach system explicitli cost function call method find optim feedback explor express perform result feedback function amount explor base deriv improv perform requir explor amount system deriv approach requir explor si approach practic system nonlinear nonlinear feedback function requir exist techniqu nonlinear system base local linear approxim linear feedback si approach give good local linear approxim nonlinear feedback function extend approach extend approach estim paramet result linear feedback constant experi nonlinear system show extend approach local approxim optim nonlinear feedback function nonlinear function approxim approxim show combin approach feedforward neural network approxim nonlinear feedback function directli determin approxim comput linear feedback nonlinear correct determin result global nonlinear feedback function experi shown approach requir train data approach base partit state partit approxim linear feedback reinforc learn method find control real system unknown linear system approach appli neural approach system nonlinear van van reinforc learn van rl de op basi van die reinforc met discret en er solid basi en de kan de continu en de consequenti van van rl minder om de van rl te meer dat rl op continu dat meer om te dat om te random ander dat rl dat van rl en de door van de en kan linear quadrat de feedback kan al de kan met rl de method om de feedback te om te de van de feedback al van de en de op basi dat van de dat er meer dan er rui dat de method meer dan de si de feedback op de feedback van de en de si om te van de feedback om de te de extend meer paramet en feedback constant experi met dat de extend van de feedback om de te dat om te met van de de feedback kan direct de door feedback te kan global de dat minder dan op van de feedback reinforc learn kan al van kan de method de neural kan acknowledg acknowledg peopl fran ben fran clariti feedback give hope thesi eventu finish ben remain nice spite bit annoi project member bart wam ton van den control theoret aspect thesi user group member project contribut thesi indic import reliabl practic applic control approach work chapter walter explain make thing easier work real robot lucki entertain room mate van dam loud dev improv angri bicycl helmet joke stop favorit oper system colleagu enjoi spend time origin greek leo van roland ba tim made lunch student provid distract year ten provid opportun work thesi mother
Agents/199 1 softwar engin multiag system juli florida analysi design multiag system hybrid coordin media scott deloach depart comput inform kansa state nichol ks abstract advanc softwar engin impact identif interact coordin central focu multiag system design realiz multiag organ distinct individu agent popul system evolut power hybrid coordin combin coordin capabl model implement rule govern organ independ individu agent system paper investig combin power hybrid coordin capabl concept organiz rule tradit approach design multiag system introduct recent advanc softwar engin impact approach build multiag system identif interact coordin central focu multiag system lead initi focu agent orient methodolog cool mase messag recent advanc coordin hybrid coordin media combin data center control center perform advanc form coordin previou approach advanc impact softwar engin realiz organ multiag system distinct individu agent popul system individu agent plai role constitut organ organ consist organiz structur organiz rule defin requir instanti oper organ constraint agent behavior interact separ organiz agent individu enforc organiz rule hybrid coordin model organiz rule media agent advanc fairli initi suggest incorpor concept current multiag system methodolog put modifi gaia methodolog incorpor notion social law coordin media high level provid concret guidanc exist analysi entiti interact exchang data share data determin data access control coordin entiti entiti interact port protocol govern coordin system design abstract advanc coordin model organiz concept goal paper provid detail direct integr advanc coordin model organiz rule exist multiag methodolog current analysi design model investig integr exist abstract organiz rule advanc coordin model advanc coordin model implement result design extend exist multiag analysi design approach addit concept import step advantag advanc coordin model tempt simpli throw concept resist urg reason approach wide understood provid easili understand metaphor commun approach shown verifi give design measur system coher full power hybrid coordin media solid engin approach lead multiag system design coher focu model capabl multiag system engin methodolog rich detail model languag analysi design multiag system section discuss current state art hybrid coordin media provid taxonomi reactiv capabl multiag system section demonstr advanc coordin model organiz rule affect mase analysi design phase analyz analysi phase add notion organiz rule exist analysi show map analysi includ organiz enhanc design show task map reaction hybrid coordin media end discuss result section hybrid coordin media discuss hybrid coordin media focu advanc form coordin separ organiz agent hybrid coordin model defin term tupl share repositori tupl shown figur agent read write tupl perform coordin simpl power implement simpl messag pass complex coordin pattern broadcast multiag agent involv respond messag tupl space advanc method includ agent listen offer system inform agent inform interest agent hybrid coordin model includ coordin process reaction simpli function tupl match predefin perform action tupl space action inform agent specif type tupl tupl perform process base extract modifi coordin media plai part determin tupl exampl hybrid coordin media includ mar tucson lime hybrid media advantag typic control driven model includ locat notifi agent data separ applic specif role organ specif simplifi implement organiz secur rule provid central repositori hybrid coordin framework work distribut manner multiag system agent agent agent tupl space figur reactiv tupl space environ taxonomi reaction type hybrid coordin media reaction base includ implement social implement secur control restrict selfish modifi data enforc social norm convent section describ taxonomi reaction type multiag system base taxonomi reaction model analysi design role central analysi design clear reaction plai type role system begin categor reaction base plai explicit implicit role system figur show taxonomi base reaction explicit role role exist system role fulfil goal interact system role typic implement agent type reaction implement explicit reactiv task social task reactiv task work behalf agent monitor environ tupl space notifi agent specif chang occur type explicit role social task coordin group agent achiev task assign singl agent reactiv task reaction monitor item sale auction tupl tupl space match reactiv task notifi agent back monitor agent typic creat reaction expect notifi specif occur interest social task illustr reaction assign carri auction multiag system agent place item sale place tupl tupl space reaction execut collect bid bidder select notifi seller win lose bidder result reaction explicit role implicit role reactiv task social task monitor enforc figur taxonomi reactiv task type role taxonomi implicit role implicit role role task lie main multiag system typic goal role system role model implicit role ensur complianc secur organiz mean monitor system oper discov type implicit monitor enforc task task reaction commun directli agent system reactiv social task provid direct function natur flow system correct action reaction monitor negoti agent system violat rule state seller resourc attempt sell reaction determin seller attempt violat notifi seller buyer interrupt negoti process monitor task directli interven negoti process monitor task track state system time inform user problem system oper debug machin learn enforc task task monitor environ correct directli interven agent mode includ modifi disconnect access commun termin agent enforc task reaction monitor environ agent attempt sell resourc directli deal seller simpli delet item enforc organiz rule model reactiv behavior section show artifact gener analysi phase mase enhanc organiz gener design advantag capabl hybrid coordin media discuss mase analysi design implement subsect confer manag defin confer manag system open multiag system support manag size intern confer requir coordin individu group distinct phase system final paper collect submiss author notifi paper receipt paper submiss number deadlin submiss program review paper contact review number review review accept reject paper made author notifi produc final version paper accept final copi collect print confer manag system consist organ member chang stage process agent imagin agent coerc displai opportunist behavior benefit owner detriment behavior includ review paper unfair alloc work analysi phase base definit expect explicit role reactiv task social role defin analysi phase case definit explicit role perform part system role analysi phase role model requir analysi phase agent orient methodolog gaia messag soda role identifi analysi phase reactiv social task implement reaction alloc role reaction made design phase figur show mase role model depict relationship role confer manag system box denot role direct arrow repres commun protocol arrow point initi respond notic refer pc chair pc member problem abstract role plai typic posit assign review collect make final provid flexibl design phase system start author submit paper paper collect provid copi review request deadlin past person portion entir set paper group review role provid abstract paper partit paper assign person find review paper assign paper review request actual paper prepar submit review collector review maker determin paper accept notifi author assign make assign retriev abstract review paper collector review submit review review retriev paper receiv paper maker author figur role model confer manag system confer manag system identifi explicit role stop simpli identifi identifi task role perform detail version confer manag system role model shown figur extend role model ad task attach role perform singl definit straightforward document concurr task diagram includ paper db review role complex requir multipl task paper db role collect distribut abstract collect paper task accept paper ensur format meet elig requir abstract task extract abstract submit paper send distribut paper task simpli distribut accept paper review request assign review partit paper review paper make assign retriev abstract negoti paper review collector retriev paper distrib paper collect review review submit review collect paper review paper receiv paper maker select paper author figur expand mase role model main analysi phase identif role identifi requir ti explicitli role captur organiz rule correspond implicit system role organiz rule identifi confer paper review system shown oper defin tabl rule state review paper cardin rule review review paper rule limit selfish agent behavior ensur paper author review collect review paper rule describ system oper rule state paper eventu review rule requir paper receiv review submit rule requir review paper accept reject analysi organiz rule integr design design phase point design decid monitor enforc rule rule assign agent design implement enforc task part environ tabl tempor oper ϕ ϕ true ϕ ϕ true ϕ ϕ eventu true ϕ φ ϕ true φ true design phase analysi show develop number design reaction goal show option base advoc approach necessarili instanc initi step design phase defin agent role identifi analysi end product agent class depict system organ defin agent class agent class templat type agent system analog object class agent class defin term role plai particip agent class box denot agent type role plai list direct arrow repres agent type design tradit tradit multiag design advoc result design shown figur small confer role combin agent system pc chair agent plai maker role pc member agent plai assign review role author agent db interfac author collector maker assign review retriev abstract retriev paper db make assign submit review receiv paper author author figur tradit design tradit multiag design separ agent task social desir open multiag system ensur enforc organiz interleav rule individu agent place ensur review complet accept reject paper made pc chair agent forc reli presenc desir approach design explicit role advoc place monitor enforc organiz rule organ creat design reaction collector shown figur task part organ implement reaction hybrid coordin media point hybrid coordin media requir advantag design approach effici requir addit design implement tradit messag orient techniqu approach agent handl task assign hybrid coordin media reaction advantag separ social task organiz rule agent remain assign distribut collect collect review task easili support confer manag organiz rule inform collect task easili share tupl space common distribut paper task enforc rule author review simpli check review paper author collect review task monitor rule review receiv eventu submit send warn review submit time fashion role enforc rule paper receiv review review accept review paper rule review chair make send review design approach organiz rule updat necessarili affect individu agent design retriev abstract decisionmak assign commun environ make assign review paper retriev paper review review review submit review figur design explicit reaction author author receiv paper design implicit role design assign explicit role role model environ shown figur implicit role monitor enforc organiz rule figur task num monitor monitor monitor enforc organiz rule dash line reaction denot reaction monitor execut tupl start tupl space case reaction simpli monitor tupl displai log inform interest monitor task simpli monitor log made requir number access tupl share monitor num review reaction commun environ monitor num review collector maker retriev abstract assign make assign review paper monitor submit review review review retriev paper db monitor review author author receiv paper figur design reaction monitor shown figur assum reaction receiv messag agent pass messag intend recipi figur shown receiv event initi transit start state messag monitor reaction valid pass messag intend recipi simpli log messag pass valid figur monitor reaction basic design shown figur enforc reaction reaction differ enforc reaction provid correct directli indirectli offend agent figur show reaction intercept notic messag author correct number review send pc chair messag state invalid forward notic messag author reaction requir agent handl commun origin viewpoint pc modifi work reaction pc side handl messag environ figur modifi accept send origin notic strength base design approach trace exact sequenc messag system automat verifi reaction consist unwant side effect deadlock valid figur monitor reaction wait wait figur implement impli reactiv task ideal implement hybrid coordin media reaction tupl match predefin reaction invok applic specif criteria reaction notifi agent reactiv task belong specif agent place reaction environ social task easili defin reaction hybrid coordin media social task perform auction good case social reaction control individu part organ start system auction reaction wait tupl sell agent environ tupl includ type auction criteria select minimum accept price multipl reaction environ implement type auction social task control introduct agent system agent put tupl tupl organiz reaction verifi properti agent join system view task intercept messag forward implement tradit hybrid tupl space coordin media reaction execut tupl repres messag tupl space reaction check tupl extract valid commun back initi agent place tupl tupl space monitor task implement reaction defin organ interact simpli save inform glean state tupl space data store displai monitor task monitor specif type tupl specif tupl implement enforc reaction similar reaction place tupl tupl space mean commun reaction simpli modifi tupl space enforc rule design author requir submit paper pdf enforc rule enforc reaction automat convert pdf format reaction simpli extract paper tupl replac pdf version result goal paper initi approach integr organiz rule advanc coordin model softwar engin model accomplish extend mase model notat includ organiz rule abil explicitli model environ base task interact agent simpli monitor identifi type task advantag capabl provid advanc coordin reactiv social monitor enforc task list task provid concept model organiz rule extens mase model good addit construct model advanc coordin techniqu origin intend analysi design close multiag incorpor organiz rule make mase analysi design open system organiz rule design agent enter system rule part system approach requir relianc specif coordin design longer depend agent incorpor organiz rule agent ensur observ organ rule enforc task implement advanc coordin media provid organ mechan agent monitor complianc organiz rule protocol refer fox languag describ coordin multi agent system intern confer pp aaa june extend cooper overhear ninth intern confer cooper inform system sept implement agent auction mar technic report coordin model languag softwar acm comput survei pp multiag system coordin viewpoint intellig agent vi agent intern workshop orlando lnai ch multiag system intern journal softwar engin knowledg volum june sa automat verif multiag eleventh annual midwest artifici intellig cognit scienc pp aaai april methodolog engin system softwar agent initi methodolog juli project pietro gc middlewar physic logic mobil intern confer distribut comput system april pp tupl space tupl centr scienc comput program elsevi scienc novemb societi infrastructur analysi design system orient softwar intern workshop limerick june paper lnc observ coordin ontolog formal framework acm symposium appli comput la vega march gaia methodolog analysi design journal autonom agent system volum wooldridg mj softwar engin internet applic coordin internet chapter march mj rule abstract analysi design system intern journal softwar engin knowledg engin volum number june page
Agents/200 1 probabilist game hespanha electr univ southern california jin kim electr eng comp scienc univ california berkelei shankar sastri electr eng comp scienc univ california berkelei abstract paper develop probabilist framework game polici control swarm autonom agent pursuit evad instant time polici direct locat maxim probabl find evad time instant shown mild polici evad found finit time expect time find evad finit simul includ illustr result introduct paper address problem control swarm autonom agent pursuit evad effect develop probabilist framework game involv multipl agent problem nondeterminist motion devic surround requir probabilist model assum pursuit start priori probabilist map region probabilist framework game avoid conserv determinist approach game numer situat typic exampl search rescu local part search captur case evad activ avoid detect search captur case motion approxim random search rescu problem call game natur determinist game finit graph studi region pursuit place abstract finit collect node motion evad repres edg research support offic naval research connect node evad occupi node question studi context game graph comput search number graph meant smallest number captur singl evad finit evad decid move turn determin smaller constant game graph limit motion evad region pursuit place abstract finit capabl restrict singl node occupi question continu space finit number map node graph game result finit graph origin game plai al method decomposit base principl evad captur present algorithm build finit graph abstract game polygon environ environ literatur game assum region pursuit place finit graph continu region unknown priori phase pursuit systemat map learn time consum simpl environ side obstacl parallel coordin axi map learn complic fact sensor acquir data map built accur algorithm maximum likelihood estim map region noisi observ obtain mobil robot approach differ literatur combin explor pursuit singl problem probabilist framework avoid proc conf dec ness inher assumpt motion evad probabilist framework natur account fact sensor inform inaccur priori map terrain remain paper organ probabilist game formal section perform measur pursuit polici section shown pursuit polici properti find evad finit time probabl expect time finit section specif persist polici simpl game inaccur observ obstacl simul result shown section pursuit game section conclud remark direct futur research reader refer proof result present denot relev probabl space set event relat famili subset form probabl measur set event write condit probabl bold face symbol denot random variabl pursuit polici simplic assum space time quantiz region pursuit place regard finit collect cell event place set discret time event includ motion collect sensor data simplic notat equal space event time time denot set measur time assum random variabl valu measur space time execut control action affect capabl time control action function measur time regard random variabl valu control action space time denot sequenc measur set denot set finit sequenc element denot jaj length sequenc time pursuit polici function map measur time control action execut time regard pursuit polici random variabl studi perform specif function pursuit condit probabl measur event shorten abbrevi goal paper develop pursuit polici success defer detail descript natur control action devic specif pursuit polici sensor gener probabl evad found evad found time locat cell posterior probabl evad measur exce threshold found time instant probabl evad found denot time instant evad found finit time set regard random variabl valu denot distribut show denot condit probabl find evad time found probabl finit equal tf expect good measur perform pursuit polici depend specif pursuit polici difficult minim pursuit polici section concentr pursuit polici upper bound expect time abstract comput model proc conf dec sensor motion evad detail discuss specif game defer section evad found time complet determin measur comput condit probabl find evad time found function condit probabl find evad time measur denot ae set sequenc measur length evad found evad found time pure function measur expand function map sequenc jy measur condit probabl find evad time measur jy jy equat comput probabl function effect encod inform relev game model sensor motion evad persist pursuit polici specif pursuit polici persist ffl clear monoton respect persist pursuit polici ffl conclud probabl finit equal expect monoton respect equat lemma pursuit polici ffl ffl lemma persist pursuit polici ffl ffl pursuit polici persist defin persist averag integ ffl condit probabl find evad set consecut time instant start found greater equal ffl call period persist extens lemma prove lemma persist averag pursuit polici period ffl ffl lemma show persist probabl find evad finit time equal expect time find finit lemma give simpl bound expect time evad found make persist polici attract turn hard design polici persist section describ game case note suffici condit direct consequ complex involv found persist averag game partial observ obstacl game consid find singl evad denot posit evad fx posit evad move quantiti time random variabl valu cell fix obstacl evad move cell posit obstacl repres function cell obstacl function call obstacl map random variabl assum independ game start priori obstacl priori obstacl map function pm map probabl cell proc conf dec pm probabl assum independ pursuit polici time control action fu consist list desir posit time occupi element control action space fv np capabl determin current posit region obstacl evad sensor read inaccur nonzero probabl report exist nearbi cell assum inform report exist evad cell occupi accur game evad found time locat cell condit probabl evad measur equal result section probabilist model sensor motion evad assum comput condit probabl evad cell time measur jy assum probabl independ pursuit polici specif pursuit polici jy amount model motion evad estim shown function effici comput motion evad markov model sequenc jy comput determinist function measur denot measur function interpret game greedi polici unconstrain motion start assum fast move cell cell singl time step motion unconstrain greedi pursuit polici unconstrain motion polici instant time move posit maxim posterior probabl find evad time measur arg max np np show pursuit polici persist effect arbitrari sequenc jy measur evad found data exist evad cell assum find evad time evad cell occupi condit probabl gu find evad time measur gu gu evad conclud gu np gu fv gu gu conclud gu np fact obtain gu np ffl fact set sum largest larger equal time sum conclud persist lemma state theorem greedi pursuit polici unconstrain motion persist gu gu np gu np upper bound gu provid theorem independ specif model motion evad evad move markov model section bound gu independ probabl ae evad move present cell distinct view measur constitut advantag simpler polici markov proc conf dec tempt polici defin fix polici evad ae extrem case ae probabl find evad finit time smaller greedi polici constrain motion motion constrain singl time move cell close present posit time posit cell fv denot subset consist list cell move time cell empti list cell reachabl singl time step pursuit polici call admiss sequenc measur reachabl singl time step posit measur motion singl time step assum motion constrain suffici larg time cell obstacl form connect connect defin term motion motion greedi polici similar defin section yield persist pursuit polici happen probabl exist evad cell move constrain hope design pursuit polici persist averag assumpt posit constant fl sequenc measur evad list posit measur pursuit polici denot sequenc consist element assumpt basic demand singl time condit probabl evad cell measur decai amount reach case probabl evad decai evad conclud measur data obstacl probabl assumpt hold sensor model theorem exist admiss pursuit polici persist averag period denot number obstacl maximum number step travel cell proof theorem found specif admiss pursuit polici refer section describ specif game partial observ obstacl greedi pursuit polici develop section appli game pursuit place rectangular grid squar cell number distinct cell adjac share side corner sequel denot ae set cell adjac cell element motion constrain remain cell move cell adjac present posit mean time posit cell fv subset consist list cell move time cell np fv assum markov model motion evad model complet determin scalar paramet ae repres probabl evad move present posit adjac cell obstacl capabl determin current posit cell adjac occupi measur consist tripl denot measur posit ae set cell evad ae set cell obstacl detect game denot power set set subset assum reflect accur measur assum detect evad perfect cell adjac sensor model evad detect function paramet probabl detect evad cell adjac current probabl proc conf dec detect call probabl posit probabl neg probabl nonzero reflect fact sensor perfect simplic assum sensor obstacl detect perfect cell adjac obstacl reader refer detail descript comput posterior probabl evad cell time measur time jy game type section constrain motion admit pursuit polici exist theorem figur show simul game ae pm figur repres light evad repres light obstacl detect repres dark asterisk background color cell encod light color low probabl dark color high probabl imag high valu evad due posit sensor figur pursuit constrain greedi polici paper probabilist framework game avoid conserv inher determinist assumpt motion evad probabilist framework natur account fact sensor inform inaccur priori map terrain show greedi polici control swarm autonom agent pursuit evad polici evad found finit time expect time find evad finit current research involv design pursuit polici optim minim expect time find evad maxim probabl find evad finit time interv appli result present game evad activ avoid detect refer parson graph theori applic pp papadimitri complex search graph journal jan search graph journal apr suzuki search mobil intrud polygon region siam oct motwani find unpredict target workspac obstacl proc ieee int conf robot autom case curv environ submit ieee int conf robot papadimitri learn unknown environ case journal mar fox probabilist approach concurr map local mobil robot machin learn autonom robot sastri probabilist game technic dept electr eng comp california mar kumar stochast identif adapt control proc conf dec
HCI/201 4 collabor agent lieberman van media massachusett institut ma usa receiv june accept june abstract web todai desktop activ form watch group famili friend collabor web comput provid assist group find mutual interest experi build agent assist group peopl suggest materi common interest built extens singl user web agent letizia featur automat detect presenc autom dynam displai user profil explan recommend elsevi scienc bv reserv user profil collabor web perform collabor famili home busi meet estim averag number peopl watch session servic indic norm except person control remot keyboard present passiv session consid success interest present account collabor form group peopl search specif explor unexplor territori combin link person view person react serv form commun particip particip learn learn content web page web assist intellig agent track user infer interest observ user autonom item satisfi interest extens experi letizia perform reconnaiss web page letizia proactiv fetch link page page match user profil learn watch user choic letizia present recommend window continu displai recommend interest extend channel surf metaphor situat person watch person remot agent cast role repres interest requir negoti disrupt job agent link reachabl current satisfi interest particip call result system agent meet groupwar part grow trend enhanc mainten function digit commun field comput support cooper cscw forum studi softwar group person work focu cscw make share desktop applic commun technolog video conferenc role comput plai interact commun record system front matter elsevi scienc bv reserv author tool activ particip commun process factor contribut interest expand role comput commun activ web led digit commun onlin unlik small corpor workgroup target previou work digit commun form web chat usenet forum spatial member familiar factor exist opportun comput plai role form discov common interest maintain focu group cscw interact commun long stuck interact metaphor gener skeptic introduct techniqu artifici field expand investig share gener limit synchron asynchron coupl session user grow trend interfac softwar proactiv assist interact softwar recognit drive interest agent research grow complex comput environ begin simpl interfac agent softwar techniqu artifici intellig machin knowledg emploi heurist statist techniqu agent cast role make suggest user definit action agent servic singl user deal interest singl user interest agent idea appli concept member digit commun face problem determin member commun interest find materi common interest agent plai role suppli suggest base automat analysi particip interest web good domain investig commun increasingli place commun current tool cscw ai research address interest aspect collabor problem unlik situat studi specif work goal challeng address situat user desir complet unconstrain highli target specif search engin user hate questionnair easili interest evolv agent plai role serendipit interest happen coincid interest aspect problem convent view notion inform retriev find page fit search engin goal make time spent singl user agent web letizia address issu singl interest principl extend multipl user experi prototyp experi prototyp system set occas media lab digit life consortium meet octob idea experi autom system surf behalf common interest set user physic present singl screen environ origin intend user present deploi singl crt monitor goal user walk presenc automat explicit action part screen continu show select web page agent determin common interest explan choic presenc user presenc user detect activ badg worn particip prepar media lab learn epistemolog lieberman al system fig screen displai group badg experi track flow short phrase commun person person group electron badg commun user transmit infrar link rang transmiss good meter line sight mount displai screen interest profil user ident user front screen index set user order construct interest profil group heurist determin user interest present user explicit interest questionnair advanc determin interest profil run web crawler scan search page crawl start home page home page organ person page perform tfidf frequenc time document keyword frequenc analysi extract term approxim common techniqu web search engin crawler oper time limit typic scan page user user profil essenti set similar user profil techniqu agent letizia compil user interest user walk agent typic time begin process determin user interest user expect result contrast start precomput profil found contrast singl patienc wait system learn group import system demonstr capabl make good choic quickli web access fast interest profil comput fly current index precomput user profil agent work extra comput time oper continu deepen search interleav search page recommend user user profil store system start crawl web page dynam comput good approxim time allot interest result experi concern number term store user profil small number term retain tfidf comput typic justifi result inform retriev show retain larg number term document improv indic content document jack number term accept result reason good indic share term common term larger number term chanc larger intersect interest collabor select recommend page left half displai browser page recommend list current user lieberman al system fig search graph link web page fig meme tag kiosk configur user walk walk restart common case media lab home proce scan initi filter user profil kind perform term local global reconnaiss call search engin altavista term user profil present result page link web human thought page page short distanc current page constitut good approxim semant neighborhood current page stark contrast set page retriev search engin connect inform whatsoev show page semant neighborhood current page show good match profil current set user page search match profil user chosen displai user compar page consid page show user page significantli page recommend typic rate minut minut buffer recommend fix creat smoother flow recommend user simpl linear combin profil recommend page score combin profil possibl recommend polici comput score particip recommend score strong interest part particip discourag low interest part particip profil influenc particip domin group period time particip input suitabl mean interact input particip oper passiv channel mode stage interact input particip simplest form input select link displai page link select result ad page select user profil closest analog add page profil count select joint credit equal multipl point credit person point weaker credit part particip configur system run independ browser particip control input profil browser sync recommend displai base common profil independ configur run complet independ copi particip possibl result interest mode run profil essenti person agent give idea person found interest contrast person give specif web site kind examin web site person page expert car market car manufactur site profil friend expert kind car kind share deserv explor visual recommend process earlier web agent letizia show recommend detail explan recommend made provid visual explain agent made choic lieberman al system fig recommend profil section present common section individu user user top common term led select paper note pictur glean home page displai top term profil term common particip highlight result conduct control particip react favor initi experi particip expect common exact interest match small group group consist repres larg number larg cliqu knew rare page media common aspect serv attract attent differ group group agent serv function work enhanc collabor peopl knew remain relat work project multipl user collabor coupl user interfac browser asynchron record playback histori augment audio videoconferenc textual chat particip ariadn recent featur lotu exampl approach collabor filter techniqu similar firefli recommend web page chosen user tast web page match explicit rate page agent kind autonom oper found kind agent perform autonom explor increment servic singl user good webwatch letizia exampl agent assist singl user found share goal differ approach web search engin queri base keyword recommend singl page common profil extract user web page navig web import compon machin vision identifi user acknowledg support research provid part grant media laboratori digit life futur british sponsor mit media lab refer agent web intern joint confer artifici intellig august autonom interfac acm confer comput human interact cooper book morgan san bradshaw softwar agent mit huhn read softwar agent morgan san meme tag commun move confer acm confer comput support cooper work novemb collabor visual search electron librari visual inform research confer ml web browser acm confer comput human interfac confer autom collabor ms massachusett institut media art septemb recommend evalu choic virtual commun acm confer comput human interact group asynchron web world wide fourth world wide web decemb tour guid world wide intern joint confer artifici intellig august awar support commun comput support lectur note comput collabor world wide eighth joint european network lieberman al system
DB/202 3 typecheck xml transform milo tel aviv dan suciu washington victor vianu uc san diego abstract studi typecheck problem xml xml transform program dtd input xml check result program conform speci ed output dtd model xml transform devic call pebbl express queri join xml queri languag type model regular tree robust extens dtd main result paper typecheck transduc decid typecheck perform broad rang xml transform includ fragment xslt introduct queri languag data complex data transform left applic xml data exchang standard emerg applic requir data wrap shift focu data transform typic scenario provid mediat integr view construct data sourc languag express xml transform xml data complex structur exibl type element nest arbitrari depth tag creat structur xml document constrain document type de nition xml document speci es dtd conform dtd call valid bene ts inform provid work support part scienc foundat grant number author support part nation scienc foundat grant number dtd numer analog deriv schema inform relat queri process importantli context dtd valid data exchang typic user commun common dtd produc xml document valid respect speci ed dtd issu static dynam typecheck valid runtim xml document perform valid parser publicli obviou drawback error detect runtim paper studi static typecheck problem call typecheck consist verifi compil time xml document result speci ed transform sati es output dtd dtd restrict input document input typecheck typecheck xml transform requir queri analysi techniqu studi formal typecheck problem complic fact xml transform languag notion dtd constantli evolv speci gener accept xml transform languag transform languag exist includ xslt languag result restrict queri languag semistructur data tree unql languag de ned motiv system languag de ne incompar class priori clear de ne singl queri languag subsum provid broad framework studi typecheck problem gener accept notion schema xml dtd wide accept part exist xml variat extens dtd consid xml commun recent ort unifi extens singl framework call address diculti de ne abstract gener model xml transform languag call tree express transform label tree pebbl input move subject stack disciplin highest number pebbl tree move tradit regular tree transduc correspond case pebbl move transform express join data valu fragment express transduc result typecheck paper appli remain relev languag evolv notion tree transduc main contribut work role studi interest robust model tree transform transform de ned transduc ptime data complex made practic transduc correspond directli simpl function written access input output tree restrict api api input tree consist pointer node tree pointer read test current node advanc pointer child child parent current node stack disciplin requir reset move pointer move pointer api output tree write output node call function parallel construct node children function inherit current function posit child output node act type formal adopt regular tree languag regular tree languag set tree accept regular tree automaton rank case unrank easi dtd de ne set valid xml document view label form regular tree languag extens dtd de ne regular tree languag decoupl element tag easili dtd decoupl de ne regular tree languag note regular tree languag captur semant kei foreign explicitli describ unord result carri schema typecheck problem studi paper type tree transduc verifi main result paper typecheck decid understand rst close relat type infer type infer problem transduc input type construct type describ imag input satisfi type infer solv typecheck check conform input satisfi rst infer check regular tree languag discuss type infer simpl xml imag regular tree languag smallest regular tree languag failur type infer transform languag interest li core transduc denot set output input mation admit type infer transduc output type set tree regular tree languag infer refer problem nding type infer problem solut main result impli immedi typecheck algorithm technic develop lead solut type infer problem main de ne acceptor variant call tree show transduc type set ft recogn prove automaton recogn regular tree languag limit limit typecheck method rst appli transform express join data valu xml queri languag mention express join condit form variabl bound atom valu input xml data xml domain valu nite transduc de ned tree label nite alphabet tag captur data valu extend data model tree intern node label nite alphabet leav label nite domain data valu pebbl transduc test unari predic data valu predic typecheck techniqu work extend transduc perform join data valu includ predic typecheck undecid case type check techniqu appli queri join data valu brie describ section simpl idea appli techniqu import class queri data leav full treatment futur work clarifi languag frequent join node oid search pattern input join form bound node condit express typecheck work queri case xslt interest earli version express data join express power tree transform strictli transduc recent addit languag includ data join construct made blur distinct regular tree languag speci cation regular tree automaton straightforward reduct nite sati abil problem logic express transduc tree transform analysi express power full languag postpon languag settl limit complex typecheck algorithm show lower bound main sourc complex number pebbl transduc discuss restrict case practic interest complex typecheck pebbl transduc relat work practic xml languag perform type check type xqueri idea infer gener output type check type speci ed output type check regular tree languag practic algorithm speci calli design xml typecheck show paper gener output type case type infer return fail typecheck correct program limit type infer appeal practic easi implement extend varieti languag kind tree transduc bottomup transduc simul transduc move restrict open problem transduc simul transduc transduc type infer transduc express transform express transduc transduc gener formal consid literatur aho ullman introduc automata devic singl head move start root set tree languag accept automata includ set regular tree long stand open problem strict question transduc simul transduc reduc open problem explain problem note case analog automata express regular languag al extend automata marbl prove machin captur regular tree languag unlik marbl nite input head restrict stai marbl automata acceptor version captur regular tree branch di erent extens automata form string automata restrict form consid harel prove lower bound gap succinct express automata address lower bound transduc note empti problem automata lower bound queri automata neven work rst monad order logic studi queri languag xml queri automata di er signi cantli xml input tree return set node tree contrast transduc return output tree transform languag abstract xml studi connect extend transduc establish static analysi problem rule shown rang transduc close intersect gener dtd ned tree regular previou work studi type infer select type input xml document xml pattern problem type variabl bind motiv declar queri languag separ variabl bind step xml construct type infer studi bind step restrict problem typecheck entir xml work type infer xml solv restrict class transform gener type infer admit solut discuss section paper organ section background includ regular tree regular tree automata section introduc illustr show ptime data complex result typecheck transduc present section extens discuss section section background tree begin basic de nition unrank tree assum xed nite alphabet unrank tree tree node label prede ned bound number children node tree order children node form list node repres denot set unrank tree tree subexpress occurr type call node set node denot root node node forest symbol def children def abbrevi leaf node path express string result evalu path express tree set node de ned def def ftg def regular path express regular express result evalu regular path express tree def regular path express xml queri languag queri input tree rank tree rank tree complet binari tree alphabet partit rank tree tree node label leaf node label children denot set rank tree denot set rank tree def alphabet de ned def def denot leaf symbol symbol intern node omit index clear write encod unrank tree complet binari tree alphabet def symbol de ne def def fg encod encod ned encod encod def def encod def encod encod def figur map node node easi translat path regular path preserv semant map chosen figur encod unrank tree binari tree binari encod make translat path express translat path express fg symbol omit formal de give exampl translat regular express evalu encod binari tree encod version origin xml markup paper simplifi assumpt xml syntax unrank tree symbol alphabet correspond xml tag unrank tree fig written xml xml tag tag text call element queri languag xml formal express transform care languag initi de ned graph data model restrict languag tree formal transform unord rank tree order shown lorel cope unql struql xslt design order model describ queri languag mention featur present pattern match pattern tree set regular express pattern regular express input tree match pattern tree node satisfi case regular pattern unrank tree translat pattern rank tree observ justi es choic rank tree identifi xml document unrank tree simplifi assumpt ignor aspect data valu attribut refer limit applic result paper full xml comment limit fix set tag xml tag de ned unrank tree nite alphabet limit focu type de ned dtd set set xml tag xed ts framework data valu xml element content arbitrari text restrict nite alphabet text text text accur model xml leav label element nite data queri express join data valu explain typecheck techniqu paper fail extend limit applic queri join data valu xml attribut xml attribut repres special kind node unrank interest typecheck dtd datatyp attribut attribut nite contrast datatyp element text typecheck techniqu paper easili extend deal data type techniqu refer xml limit form attribut type idref deal refer attribut constraint type dtd present dtd tree automata type system unrank rank explain model dtd xml de ne document type de nition valid dtd extend grammar xml document unrank tree repres valid respect dtd deriv tree grammar dtd denot set unrank tree repres valid xml instanc xml document repres tree fig valid wrt tree automata tree automaton devic accept reject rank tree binari alphabet de nition adapt de nition tree automaton qf nite set initi qf nal write tree automaton start state head root node input label symbol automaton state continu comput left child state child state thought spawn comput rst start left child child branch spawn stop reach leaf input tree accept branch stop accept state denot set tree accept set form note automaton exhibit kind extend side product regular express termin pair multipl transit left comput comput accept lead form altern automaton refer literatur tree automaton tree automata start leav work automata determinist automata strictli weaker discuss dtd tree automata relationship tree automata dtd describ set valid xml unrank tree recal unrank tree uniqu rank binari tree dtd straightforward construct tree automaton tree automata strictli stronger dtd simpl tree unrank alphabet dg set ftg rst di er set singleton set regular natur extens dtd decoupl tag call special turn tree automata term type regular tree languag speci cation tree rank unrank tree queri type unrank tree encod binari remaind paper alphabet assum partit result carri unrank tree encod tree automata silent transit technic reason gener automata tree automaton silent transit addit transit transit move state chang head current node de ne semant formal tree con gurat denot set con gurat relat de ned transit applic de ne children silent transit applic de ne qf xs de ne de ne closur impli impli ww ww transit exiv closur tree accept initi con gurat automata silent de nition accept coincid inform automaton qf silent transit exist automaton silent transit denot transit transit exiv closur de ne consist transit form qf def qf silent transit tree transform transduc model tree transform gener classic tree turn extens tree automata tree transduc transduc pebbl mark node tree transit determin current node current pebbl node pebbl order number machin place pebbl move remov order limit power transduc typecheck pebbl restrict stack pebbl tree order remov pebbl present tree move pebbl tree pebbl pebbl move long pebbl tree stack disciplin essenti result paper transduc work comput start place pebbl root pebbl pebbl call current node sit current node current pebbl serv head machin machin decid transit base symbol current pebbl current denot vector current kind move output transit move transit current pebbl move current node direct edg move speci ed direct transit appli current pebbl state pebbl root current current pebbl remov tree pebbl current pebbl move transit machin enter speci ed transit move move test current node child pair move enter state move enter state ect move pebbl parent check case enter state left case enter state output transit emit output node symbol move input head kind output transit binari output machin spawn comput branch comput left child branch inherit posit pebbl move pebbl independ output node output leaf branch comput halt global machin start singl comput branch output node construct top fragment output comput branch continu comput remain output entir comput termin comput branch termin de ne transduc de nition tree transduc rank input output alphabet nite set state partit state pebbl denot element initi state nite set transit observ simul move conveni gener nondeterminist transform de ne binari relat give formal de nition transform tree con gurat tripl set con gurat transduc input tree initi con gurat def initi state partial comput transduc input captur tree node label repres output gener leav label repres branch comput transduc de ne rewrit call describ step intuit obtain appli transit step branch comput de ned term simpler rewrit mean obtain transit de ne rst recal set transit transduc transit transit appli condit nalli de ne separ move transit output transit move transit appli de ne condit left child left child similarli node output transit appli de ne output transit appli de ne de ne congruenc closur transit closur transform de ned tree transduc de ned def ft initi con gurat transduc de ne binari relat relationship transduc tree transduc consid term recal de nition transduc de nition tree transduc set initi transit symbol transit tree machin construct transit part output tree describ comput inform input tree transduc start root state gener node label state transit form intern output tree tree repres fragment transduc output fragment leav label element form leav replac output tree transduc spawn comput branch comput tree replac leaf leaf label branch start left child state leaf label branch start child state leaf reach input transit form transduc output halt comput branch comput halt branch current output tree de ned output nite input tree easi transduc express transduc relationship transduc work de open relat open problem automata automaton transduc output transit accept state automaton start pebbl walk tree enter accept accept tree automata section branch tree languag accept automaton regular theorem open problem automata express regular tree languag transduc attempt simul run start node guess state end output symbol branch comput children problem ignor entir output produc termin state comput guess check guess correct test check regular branch output restrict behavior automaton transduc simul transduc automata express regular tree languag transduc simul transduc automata branch express regular open xml transform languag transduc transform unrank tree nite alphabet express exist xml queri languag fragment express transduc note extend queri join data requir nite alphabet lieu illustr power transduc mean exampl transduc simpli copi input tree output show move pebbl node node start state stop state tree enter state assum root prepar move move long move left move tree exhaust frg illustr transduc express pattern match argu section pattern essenti common denomin exist xml queri languag recal pattern tree label regular express illustr ve regular express match pattern input pebbl number node transduc lexicograph node input ve pebbl advanc previou sixth pebbl check ve condit form rst condit involv root node denot check locat rst node sixth pebbl preorder tree move tree reach check regular express illustr pattern ve regular express match pattern input pebbl number node transduc lexicograph node input ve pebbl advanc previou sixth pebbl check ve path root match rst regular ancestor path match ancestor path match condit involv node check ancestor path match regular transduc sixth pebbl search tree move sixth pebbl tree reach check regular express illustr size output tree exponenti larger input tree transduc map tree figur complex tree rotat leaf node label order children output tree read de ned fq consist transduc perform complex rotat input tree assum symbol symbol symbol transduc rst node label declar root fig illustr transduc proce rst place pebbl leaf label enter state transit omit show transit assum start state leaf label subscript state left reach current subscript left symbol root root produc addit node left produc addit node left left left left illustr transduc string string encod binari complex express role typecheck transduc independ interest express tree transform show data complex ptime case determinist transduc mean exist ptime algorithm input tree note gener output size exponenti algorithm produc encod dag case transduc care ptime data complex mean produc nite set output ft proposit xed transduc input tree set regular tree construct ptime size tree automaton accept languag sequel tree transduc input tree recal set output tree construct tree automaton silent accept languag silent transit form mean automaton chang state advanc head underli symbol transit automaton express power def fq fq set con gurat symbol denot uniqu nal initi con gurat de ne product recal rewrit gurat output symbol tree node de ne consist rewrit rewrit rewrit rst silent regular transit automaton con comput ptime size easi check accept tree prove accept tree start set gurat de ne sequenc gurat leaf node label element label notic node sequenc sequenc tree de ne def notic initi wn wn rewrit determin rewrit proven analyz case determin rewrit detail prove accept accept de exist wn de ne obtain remov root node node label initi wn remov easi check proposit ectiv answer question problem construct determinist transduc tree answer ptime size serv dag encod result comput time polynomi size answer ptime size automaton ft correspond tree gener regular tree amort ptime cost size input output easili proposit theorem transduc express ptime transform transform involv cardin check input tree linear tree label express transduc exact express power remain open typecheck transduc present type transform readi present solut typecheck problem rst recal typecheck type infer connect typecheck type infer recal type tree automaton denot def de nition tree transduc typecheck respect input type output type problem verifi typecheck respect type call typecheck problem type infer problem close relat typecheck pebbl transduc input type type infer problem type note solut type infer problem immedi yield solut typecheck problem verifi typecheck respect input output rst infer check fact regular tree languag decid illustr type infer simpl type transform construct input dtd root input xml document occurr xml abbrevi queri bind variabl bind emit output element queri output occurr queri map input output set result dtd describ regular languag practic settl dtd approxim result de nite fact approxim tree languag regular set tree set ftg regular approxim xslt assum dtd input xml document previou queri write copi entir repeat time map input output ba ba ba set dtd failur type upper approxim output result correct transform reject typecheck stronger type system express set form power type system test undecid approach pursu target type call special consist extend dtd children node languag shown type infer perform simpl select queri side typecheck test limit class languag regular languag decid queri complex construct remain open extend stronger type failur type infer type infer turn return queri assum output dtd requir number bs easi dtd describ input document map output document number bs type infer problem transduc output type construct type ft type call type solut type infer problem immedi yield solut typecheck typecheck respect input output rst comput type check establish main result theorem transduc input type output type typecheck respect remaind section dedic solv type infer establish theorem step de ne acceptor variant call step show transduc type complement ft recogn step prove automaton recogn regular tree languag develop step step automaton work similarli produc function simpli accept reject input de nition tree automaton transduc set transit move transit transduc output transit replac transit analog transit tree automata transit stop current comput branch accept transit spawn independ state input head move de ne formal set tree accept con gurat denot set con initi con gurat partial comput automaton tree word denot con gurat reach di erent branch de ne similar transduc transit contribut move transit de ne transduc transit appli de ne transit appli de ne de ne closur tree accept tree languag accept consist tree accept step type infer achiev automata proposit transduc type exist pebbl automaton ft bar denot complement set notic ft ft obtain automaton describ type consum tree order produc automaton accept complement regular set de ne transit recal move output move branch transit move transit state move transit output transit state output transit branch transit conclud proof show tree intuit simul parallel comput output formal proof requir resort de nition detail intric start exist wn sequenc gurat initi gurat construct tree rewrit hold construct sequenc gurat rewrit hold prove claim exist show construct induct con gurat refer node appar construct construct vn notic node present reli tight connect replac gurat obtain sequenc gurat leav replac gurat leaf node obtain sequenc gurat de ne def initi def initi de nition construct case type rewrit case rewrit gener move transit de ne def obtain replac label case rewrit gener transit obtain con gurat obtain replac leaf label output symbol transit notat de nition case rewrit gener transit recal notat de nition obtain replac leaf node label label introduc leaf node label obtain replac con gurat check case sketch direct vm construct wn prove rst deriv rst appli construct case denot set node occur con gurat set disjoint cover set impli node de ne order node visit xm fx set node label element set form disjoint cover element de ne order node order introduc rewrit con assum order xm expand rewrit jn requir align construct gurat gurat denot gurat gurat leav number de ne proof fact straightforward case analysi step show cornerston approach type technic interest theorem tree automata accept regular tree languag automata simul classic topdown tree automata singl regular tree languag accept automaton harder prove show construct tree automaton formula st tree accept formula de ne regular tree languag theorem classic result tree de ne regular tree languag assum tree structur tree repres structur set denot fact left child hold node label simpl descend relat node de ned succ succ hold descend xs descend smallest set close succ succ note quanti cation tree intern node label leav label easi automaton accept tree evalu view boolean circuit formula de ning set tree obtain tree leav de ning set node evalu unari relat succ succ succ reduc simul problem automaton altern graph access altern graph graph graph node partit problem consist decid node access de ned access successor access successor access set access node de ned automaton tree construct graph con gurat set consist uniqu node pair con gurat share set edg kind rst edg form con gurat pair con gurat edg form directli de nition tree initi con gurat access graph remain show express problem diculti li fact node tupl node input structur con gurat repres depend tree encod pair repres set eq longer unari circumv reli special properti node connect tupl posit stack disciplin pebbl pebbl quantifi di erent portion graph construct formula reli outlin construct denot state fq fq fq fq nk nk show rst case singl illustr encod state con gurat encod transit case con gurat assimil pair formula de ning accept di erent unari relat state sentenc state close transit semant state initi con gurat root state access graph hold accept tree formula direct transit edg transit includ illustr succ sw hold accept suce notic similar eq eq observ formula gener graph formula instanti notic successor quanti er extend equat case arbitrari de ne predic state sn sn close transit formula equat replac predic assum pebbl posit free variabl free variabl sn predic consid move ect pebbl partit transit set transit form move transit inspect previou pebbl write write formula move branch transit similar transit pick place transit determin conjunct note resembl equat act initi state pebbl note resembl equat act termin state pebbl complet proof translat result formula size exponenti replic quanti er depth variabl order variabl note stack disciplin pebbl essenti construct proof algorithm result typecheck techniqu transduc lower state note lower bound hold stringent assumpt theorem typecheck problem determinist transduc xed input output type reduct empti problem gener regular express alphabet xed input type encod string binari tree fg easili gener regular express construct ptime determinist automaton branch accept empti empti construct determinist transduc input output reject accept xed output type de ning singleton typecheck ect corollari empti problem determinist automata branch number pebbl pebbl transduc main sourc complex typecheck procedur unexpect note case automata pebbl restrict extrem automata pebbl larger tower exponenti height automata pebbl conveni complex usual problem expect harder proport extens main limit typecheck approach high complex lack data valu dealt restrict special interest transform express usual xml queri languag full treatment scope mention initi result indic limit overcom signi practic case complex typecheck discuss typecheck transduc typecheck full gener prohibit approach restrict case practic interest typecheck reduc empti automata pebbl pebbl power typecheck select queri join queri extract list bind variabl occur tree pattern section reduc empti automaton exponenti state total complex interest special case consist queri tree pattern construct answer restrict group variabl time automaton pebbl exponenti output type dtd group variabl automaton data valu model xml assum nite alphabet data valu addit tree type regular tree languag data valu treat distinguish leaf symbol transduc extend kind transit section comparison predic data valu enter state unari comparison data output transit copi data input tree output tree includ select join data express extend transduc kind transit ect typecheck handl unari predic appli techniqu machin replac nite set data valu constant comparison predic render typecheck undecid reduct nite sati abil problem equal predic evalu formula standard encod structur label tree data valu typecheck techniqu paper extend import class queri data join queri equal test perform independ truth assign equal test consist typecheck actual equal test replac nondeterminist guess truth risk inconsist guess queri express languag implement manner assum relat schema consist relat kei dept join person dept join typic queri export relat xml view extend transduc implement perform independ comparison outermost loop iter step iter person check stop loop equal found iter dept stop equal found comparison independ previou outcom consist previou comparison notic implement join independ properti simul transduc input replac predic output state choic nondeterminist choic correspond run data appli typecheck techniqu paper develop robust framework typecheck xml transform transduc abstract express exist xml transform languag subset xslt regular tree languag captur current dtd extens framework typecheck remain relev xml standard evolv futur work address complex treatment data context restrict class xml transform restrict accept lead ecient typecheck algorithm transduc provid good framework suggest preliminari result direct acknowledg nil comment thoma point connect automata gener regular yield lower bound theorem refer abiteboul vianu regular path queri constraint acm symposium principl page aho ullman translat context free grammar inform thompson xml schema part beeri milo schema integr translat structur data intern confer page beeri algebra semistructur data xml june neven formal model express fragment xslt comput logic cl volum lectur note arti cial page malhotra xml schema part wood regular tree languag suciu queri languag optim techniqu unstructur data acmsigmod intern confer manag page altern journal clark xml path languag clark xsl transform speci clark makoto relax ng speci mediat data intern confer manag page suciu queri languag xml intern world wide web confer page trip tree acta wadler xqueri formal suciu catch boat experi manag system intern confer manag page tan trade relat xml page widom tsimmi integr heterogen inform sourc journal intellig inform march harel complex result automata logic page limit parallel comput theori oxford pierc xml process languag page pierc regular express type xml page vianu view de nition dtd infer xml workshop semistructur data nonstandard data januari neven structur document transform base xsl proc eighth intl workshop program mchugh widom queri optim xml page septemb milo suciu type infer queri semistructur data acm symposium principl page neven queri automata symposium principl page widom object exchang heterogen inform sourc ieee intern confer data page march papakonstantin enhanc semistructur data mediat document type de nition intl conf data papakonstantin vianu dtd infer view xml data page robi design rozenberg handbook formal languag springer person complex problem automata theori logic phd massachusett institut thoma automata nite object formal model volum handbook theoret comput chapter page
AI/203 2 biolog inspir system autonom rover terri john rose intellig system depart comput scienc south sc author review extrem read manuscript suggest greatli improv readabl author dr paul jet laboratori support nasa summer faculti fellowship program summer work support part aro grant onr grant abstract complex mission planetari surfac autonom rover system complic mass comput storag restrict system address recent develop system call inspir system autonom rover planetari mission involv multipl lightweight surfac rover capabl cooper planetari surfac retriev oper multipl cach recoveri mission mar system emploi autonom navig control surfac retriev action select mechan base modifi form free flow hierarchi paper primarili describ navig subsystem inspir recent studi london taxi driver indic region brain activ path plan landmark identif report result studi simul navig planetari environ robot neural network introduct recent success mar pathfind mission demonstr limit set scienc task accomplish remot small lightweight rover sophist analysi procedur perform terrestri laboratori due mass fragil sampl equip entail return martian planetari surfac sampl earth mission plan nasa sampl return rover retriev cach long rang scienc rover pass sampl orbit return earth current prototyp develop jet design specif mass power requir typic mass li ten maximum power fast movement sustain hour recharg batteri primari modal includ stereo camera pair cm field goal camera mount manipul arm field intern gyro plan sun sensor give global posit inform current prototyp shown figur manipul arm complet joint top rover remov power share comput relat compon drive activ memori capac limit megabyt processor low power requir hard disk size access strictli limit essenti due heat dissip limit constrain type algorithm navig planetari surfac complic natur planetari environ preclud robot plan system environ tend drastic wide temperatur obstacl highli irregular shape intern modul rover control system commun state inform integr navig straightforward reactiv approach long rang navig uncertain harsh drain batteri reserv short time mission rover prototyp option navig obstacl ride ground clearanc high pure obstacl avoid tend put stress rover turn involv differenti forc robust control system combin possibl conflict behavior order maxim mission goal cach retriev brook develop subsumpt control architectur order address problem unstructur terrestri environ seemingli complex behavior hierarchi augment finit state machin gener recent work parker extend approach includ fault toler characterist collect heterogen robot notabl subsumpt architectur lose intern state inform due inhibit subsumpt oper lack abil combin conflict behavior due strategi control inflex highli uncertain environ number neural network approach robot motion control neural dynam hallam oper condit reinforc learn van backpropag system potenti capabl meet demand planetari test domain effort provid set capabl suitabl autonom planetari paper present control system call inspir system autonom rover figur built previou work wolf pack hunt behavior retriev spin satellit local rover oper stereo sensor acceleromet level hybrid combin wavelet signal neural network base fuzzi featur map algorithm action select hierarch network rosenblatt previou work demonstr network flexibl framework sensor process type control explicitli program behavior map origin subsumpt architectur brook abil adapt cue hierarchi action select govern binari inhibit mechan studi hundr mission simul martian environ cooper rover demonstr mission success rate retriev wide separ cach awar studi simul mission similar complex section describ model navig discuss neural network approach robot navig control organ includ navig portion system detail section mention map system landmark refer action intern rover state cach topolog featur cliff result experi simul multipl cach retriev mission final summari section model navig number model navig base theori role plai spatial map format navig develop biolog mobil robot visual map local system system object learn recognit system learn visual landmark learn landmark entail gener aspect categori landmark landmark learn view landmark direct space system recogn landmark view direct learn panoram view captur inform visibl record place defin locat visibl aspect landmark view okeef describ model rat function fire rate map place cell treat approxim radial basi function spatial environ phase fire individu place cell indic rel posit rat respect spatial locat place cell code place cell locat front rat fire late theta cycl hz eeg theta place cell code locat rat fire earli theta cycl simul model assum search space cm bound wall place cell fire strongli modul direct visual cue evenli distribut distinguish issu movement remov individu cue address view function navig path integr view support abil rat navig complet dark suggest capabl fairli accur dead reckon al suggest model data perform path integr anim posit space landmark serv addit correct cumul error path integr comput model crawl develop touretzki embodi theori navig account behavior neurophysiolog data model combin visual head motor activ give estim current locat path integr place cell map dead reckon coordin perceiv locat landmark blum abbott model map space creat rat mechan potenti place cell sequenti fire place cell explor result pattern potenti model affect subsequ place cell fire suggest locat rat express ensembl activ activ place cell rat navig move current posit locat strongest place cell activ suggest code locat shift forward specif path anim occur anim path effect evolv navig extend rang evalu idea comput simul morri maze subsequ abbott present model navig map learn tempor asymmetr potenti depress interact place cell model capabl handl multipl map goal accomplish introduct modul recept field goal locat network place cell simultan encod map goal interest aspect approach modul goal learn result map interpol learn goal locat provid path goal recent model navig harri appli marr theori function contrast navig suggest addit function compon entail navig locat model egocentr spatial map locat continu updat data idea posit space absenc sensori cue abil deduc home vector absenc specif sensori cue observ simul model reli cue act memori store snapshot egocentr map head direct cell select egocentr map rotat match snapshot address issu direct requir direct fire pattern place cell model evalu mobil robot intern environ balakrishnan al describ model spatial learn navig mobil robot repres space metric framework environ repres distinct place center place label metric inform deriv path integr repres goal coordin system make navig directli goal find vector differ current posit locat goal model combin posit inform sensori input determin current locat path integr sensori cue local robot space approach kalman tool analyz model fusion uncertain sensori data neural network robot control tradit approach rover navig follow strategi requir long time delai movement larg comput resourc techniqu successfulli appli cross countri navig cmu ambler project jpl robbi project recent nomad desert chile vehicl project weigh requir power mass power requir long rang rover mission preclud strategi concern address subsequ studi undertaken jpl reactiv method miller system previou section neural network approach robot navig incorpor action select mechan behavior network portion system figur behavior network fed layer read associ gate circuit grossberg act associ recogn object action emot network base competit emot state emot network influenc read circuit intern drive input batteri strength sensori modal system al associ perform learn map wheel veloc displac coupl direct rotat effector control model learn map desir target wheel veloc provid movement goal satisfact advantag system uncertain environ li error correct properti exhibit robot perform stabl perturb sensori wheel characterist radiu weight connect map oper condit model extend system includ obstacl avoid system gener wheel veloc navig gener fictiti target trigger detect obstacl avoid trigger process model base oper condit model grossberg grossberg model cell short term memori model recurr competit field stimul sensori input cell driven input stm drive cell connect angular veloc map robust obstacl avoid exhibit system due learn tempor connect angular veloc pattern vector field approach tani requir knowledg goal locat order construct map sensori input maneuv output train requir interpret sensori local minimum potenti profil deriv rang sensor effect obstacl avoid conserv steer equat minim possibl due finit size mobil robot experi demonstr knowledg tempor pattern sensori input elimin potenti ambigu state space correl matrix approach al chain recal learn map util shift stimulu pattern techniqu base current pattern sum pattern learn matrix recent studi london taxi driver support landmark inform spatial map path plan activ area brain system organ complic natur multipl cach recoveri task multipl rover involv system organ level design level system figur hybrid mix neural network approach level perform wavelet transform rover stereo imag level input process imag action gener navig level action select mechan network model rosenblatt exampl extern input includ intern temperatur rel time sun sensor commun rover learn landmark oper network gener membership valu class visual input system coupl onboard rover compon acceleromet dead reckon egocentr map environ built index navig base statement step past big oak doesnt big oak local oak tree human troubl distinguish navig real environ accur movi set environ oper train system planetari environ mar costli potenti danger offer solut level system closest structur gabor filter visual input fed cluster featur extract action gener level lack specif action select mechan system notabl differ system replac level system singl wavelet transform preprocess level order elimin larg storag space coverag problem frequenc space gabor wavelet rosenblatt action successfulli field autonom land vehicl studi includ unidirect tempor penalti action ordinari addit multipl process input node type recent shown optim multipl object make produc action maxim global object function includ action addit process input node combin conflict behavior maximum motion effici figur rover move south avoid obstacl action gener node activ high neg strength repres larg shade circl north direct combin approach goal small posit result motion cach perceiv west place cach gener access detail map case landmark due uncertainti accuraci local triangul field trial current gener lightweight surviv rover jet laboratori great amount slippag drive wheel terrain preclud pure techniqu navig obstacl avoid point recent address baumgartn extend kalman filter analysi stage visual cue environ refin dead reckon posit estim system accur local rover laboratori cm singl camera seri defin refer pattern addit work problem bekei extend kalman filter analysi improv order magnitud sun sensor input asm combin inform sun sensor stereo camera scout rover extract visual cue coupl perform kinemat adjust output serv behavior base index map shown figur high level detail maintain obstacl goal rover simul mission scout retriev navig system scout rover locat cach obstacl encount path inform gener asm level obstacl avoid scout retriev rover cach augment knowledg terrain process requir effect includ obstacl cach locat stereo camera terrain offer possibl rover obstacl avoid biolog system anchor point navig spatial extend environ recent demonstr studi london taxi driver activ rout landmark identif medial cortex activ indic landmark identif import portion egocentr sequenti aspect rout plan task navig waypoint direct line involv sequenti refer landmark primari motiv map built navig develop landmark identif subsystem base gener behavior wavelet encod visual input stress landmark encod action meant tradit statu subsystem similar approach matar studi behavior chain path indoor environ output local index crude map terrain meter obtain camera rover land index process shown figur navig low resolut map extrem danger rover size order centimet cm resolut local correspond frequenc move full speed crude map metric map terrain bit label grid point indic terrain charact measur due uniqu land mechan acquisit type visual map futur nasa mission plan includ convent land scenario link landmark point encod odometri rough dead reckon analysi connect path wheel slippag effect make data inform compress achiev store detail uninterest portion path area order squar detail occup grid approach moravec elf moravec feasibl due storag limit rover simul studi cover area local resolut cm requir grid place full megabyt singl byte grid point extens access hard disk requir map lead intern temperatur problem rover encod local detail surfac relev includ rel height action immedi prior encount obstacl travel acceleromet state encod surfac detail sweep area cach byte obstacl twelv byte cach inform store obstacl goal vision preprocess level algorithm imag gener stereo camera wavelet decomposit inform orient featur imag wavelet decomposit inform local frequenc content repres visual import featur compactli transform commonli imag process previou work wavelet process imag shown util sensor fusion morpholog imag process motion analysi face process imag enhanc textur process wavelet transform perform stereo vector form multiresolut inform highest level wavelet horizont vertic detail channel vector length element input output action turn turn pick direct turn map approach similar pomerleau cmu road system system specif featur edg road identifi encod raw stereo visual inform attempt label individu featur object desir action input pattern train present sampl label output node correspond gener action weight subsequ run approach successfulli kinemat studi robot arm network train set wavelet process imag simul type terrain martian surfac recent mission stereo pair train navig shown figur total hundr stereo pair train epoch converg compar backpropag typic hundr thousand epoch converg recal train imag advantag action gener level li membership valu gener output node sum valu normal rel size membership valu rank action set stereo imag shown figur train set shown system train set imag cach partial hidden rock hand side field view rank membership valu highest action turn left goal rest membership distribut state obstacl avoid behavior system invok due highest membership system goal close move movement obstacl automat rover turn field view vector wavelet coeffici loom obstacl larg avoid behavior veloc rover select asm depend slower turn approach goal terrain number factor visual sensori input influenc navig rover includ health rover batteri power time homogen terrain rover approach highli uneven portion terrain late control made halt wait morn order recharg batteri light visual action select presenc conflict behavior rosenblatt evid type behavior natur found offer corn human hand fear human coupl desir corn lead neck due antagonist muscl direct graph action stimulu node combin predetermin rule rule includ complic mean combin find cach system shown figur action node drawn stimulu node characterist direct bin combin rule addit small fill rectangl multipl small fill rule plain rectangular node max ij ff ij ff min ij fi ij fi activ ij ij posit neg prefer node node number prefer node ff fi constant sophist combin rule develop proper transfer goal motiv behavior lower level scout rover simul find cach penalti node ad prevent total mission failur event imposs approach scenario occur simul run shown figur lead circl behavior cach rover batteri exhaust introduc tempor penalti figur inhibit action inordin amount time complet tempor penalti deriv assign power time current action multipl combin rule action activ declin time type node similar impati paramet parker tempor discount factor sutton barto tempor penalti node likelihood satisfi mission goal maxim number cach return larg motiv input find cach node mediat multipl combin intern stimuli night good health night stimuli deriv sun sensor equal sunset good health stimuli product batteri level scale triangular function intern temperatur rover triangular function start peak drop stimuli feed move action output node directli deriv output node design biolog constraint consequ environ set model previou section autonom navig model planetari rover priori expect oper open space remot system luxuri learn navig learn map environ bump obstacl rover avoid damag cost due rover repair facil qualifi technician remot planet prior knowledg exact goal posit environ due uncertainti navig mention previou section comput power constraint place limit map learn sensori input system detail section oper acceleromet data vertic orient addit ordinari visual visual inform field view qualit total center direct integr obstacl avoid behavior rout plan strategi compon design obstacl landmark map detail inform rel import retriev rover follow scout clearanc rover navig obstacl built train loom differenti small obstacl driven larger requir system review context obstacl avoid activ map environ obstacl featur navig system inform landmark recognit oper environ constraint system preclud oper open environ model burgess al al blum abbott abbott balakrishnan al simul environ lack publish data show perform model control open environ make difficult draw object potenti perform arbitrari open environ difficult evalu case model burgess al blum abbott abbott explicit made boundari close environ simul approach simul rat wall effect redirect focu explor interior environ fact touretzki harri test simul environ interpret system capabl oper environ burgess al state consequ sensori input cell model emploi goal locat insid convex hull set cue order navig success pose problem arbitrari open environ case model al connect place cell model fix descript model address obstacl avoid navig environ requir abil avoid obstacl map environ static model burgess al blum abbott abbott address obstacl avoid simul rat wall obstacl unreason simul unaccept case navig system actual rover goal forc address obstacl avoid crawl model touretzki space author portion model implement mobil robot environ describ comput simul split landmark arrai task model train environ deposit simul anim success random spot place unit recruit learn environ respect randomli chosen visibl landmark train termin random spot visit requir recruit addit place unit consequ train procedur issu obstacl avoid present result open model preclud experi assum random site select train model harri evalu model actual mobil environ irregular shape room experi reduc similar featur observ robot sonar sensor room larg robot detect wall locat explor strategi simpl wall strategi boundari environ plai import role result present limit architectur preclud extens model address open environ explor strategi predic environ studi interfac figur displai output relev mission includ current intern temperatur batteri level studi current stereo view current top action martian time total accru mission time path rover point studi mission shown white line displai mission control strategi ffl rover lander stage site ffl scout rover head cach send back path inform major obstacl path length singl retriev rover follow behavior matar addit wavelet compress imag select view augment map cach site broadcast retriev rover scout rover arriv safeguard mission object event retriev rover doesnt make cach site ffl scout rover start potenti cach site broadcast compress version path retriev rover dispatch intersect path scout ffl retriev rover broadcast messag indic success acquisit cach return lander stage site robot impati behavior invok wait retriev rover dont receiv messag predetermin period time ffl cach rover attempt return lander stage site control strategi code run ran trial subset inform return mar pathfind mission figur area encompass km km grid decomposit resolut cm detail map level number detail map vari map gener obstacl cach trial start posit placement cach random area assum cach placement site meter radiu rover deploi simul scout retriev rover bandwidth commun channel rover modem instal current prototyp jet laboratori top speed rover set consist order simul wheel set loss climb rock terrain batteri lifetim set week rover timestep size simul fix sec rover forc sleep night hour infrar sensor navig night danger total mission success defin return cach land site mission success rate hundr simul mission mission total cach recov due death scout rover fall steep inclin path mission shown figur white line path cach posit mark white circl tempor penalti effect rover navig mission figur cach fill unabl acquir due total surround terrain unclear scenario occur actual cach supposedli put place rover question rover area planetari surfac place evalu optim path mission complex due obstacl avoid option complic complet path plan analysi give inform scout rover local cach mission time constraint minim amount structur damag addit path length trace explor behavior find cach asm figur motiv random search direct current nasa plan call beacon guidanc system initi meter approach visual guidanc cach meter paper introduc hybrid system planetari rover navig control call neural network coupl behavior base control coordin multipl rover navig subsequ retriev multipl cach total thousand cach successfulli retriev hundr simul mission result map share rover effect studi area retriev oper major failur due expir batteri lifetim rover averag complet time hundr mission dai extend navig algorithm includ search strategi order minim chanc loss power lead mission failur investig underwai determin length optim vector wavelet coeffici order reduc process time anticip field studi jet laboratori test navig portion system real terrain evalu incorpor fault toler level network maintain reduc mission capabl event intern sensor failur partial structur damag rover refer mobil robot visual map neurocomput architectur emul place learn neural spatial learn local comput model implic mobil robot technic report iowa state ia visual adapt behavior condit mobil robot neural autonom mobil robot ieee transact automat model spatial map format rat neural robust layer control system mobil robot ieee journal robot oper condit robot van der neural system robot academ san ca neural network model redund motor tool journal cognit model function neural map navig ieee journal robot fractal signatur analysi automat target recognit optic yamaguchi neural network model spatial associ recal map neural behavior control robot explor planetari surfac ieee transact robot path plan execut monitor planetari rover iyengar elf autonom mobil control plan architectur ieee comput societi press vector associ realtim learn control movement trajectori neural neural dynam approach control van der neural system robot academ san ca model oper condit adapt obstacl avoid technic boston ma neural network control wheel mobil hardwar implement ieee tran cybernet learn navig map potenti modul place cell comput dynam oper condit journal theoret studi mind neural principl motor control ma neural dynam modul secondari reinforc appli neural dynam condit oppon process neural network natur intellig mit ma dynam net robot control van der neural system robot academ san ca autonom robot van der neural system robot academ san ca local enhanc compress imag journal mathemat imag distribut multisensor integr cooper multirobot system proc spie symposium sensor fusion network volum page pa data neural network implement data fusion robot machin intellig academ fl sensor fusion dynam environ proc spie symposium sensor fusion volum page ma biolog motiv sensori fusion system automat target recognit neural hybrid multirobot system complex oper proc spie symposium sensor fusion distribut robot page ma autonom system complex planetari retriev oper proc spie symposium sensor fusion decentr control autonom robot page pa parallel featur map pattern recognit intern journal gener reprint fuzzi model pattern ieee pp wavelet base sensor fusion proc spie symposium sensor fusion volum page ma morpholog imag analysi wavelet proc spie intern symposium page fl wavelet analysi fuse sequenc proc spie symposium sensor fusion page ma hybrid featur map system face process journal biolog system movement autonom vehicl reinforc learn ecai page york wilei van neural vehicl van der neural system robot academ san ca imag gabor wavelet ieee tran foundat etholog berlin recal rout activ taxi driver signal edg ieee tran integr robot ieee transact robot distribut approach behavior control proc spie sensor fusion volum page ma exampl group behavior technic brandei ma stereo vision planetari model implement intern comput reduc softwar mass behavior control proc spie conf cooper intellig robot space volum page ma reactiv navig rough result proc tenth nation conf page san ca high resolut map wide angl sonar ieee confer robot page washington dc heterogen cooper technic report ma behavior coordin make proc spie symposium sensor fusion decentr control autonom robot page pa effici train artifici neural network autonom navig neural adapt local navig activ vision mit ma memori navig model support marr theori function altern subsumpt mobil robot control proc joint conf neural page dc extend kalman filter frequent local infrequ global sensor data fusion proc spie symposium sensor fusion decentr control autonom robot page pa path integr poster present annual societi neurosci san ca present annual societi rover planetari explor proc aiaa comput aerospac page kinemat analysi articul figur fuzzi featur map intellig engin system artifici neural volum page asm press local unstructur deal error ieee transact robot learn predict method tempor differ machin tani learn navig mobil robot neural landmark arrai cognit map current trend swedish confer erlbaum hierarchi action select journal adapt desert planetari analog field experi proc intern sympo artifici intellig autom japan neural network control mobil robot nonstationari environ neural list figur prototyp planetari robot lab nasa jet laboratori ca multilevel system organ cach retriev oper planetari environ coeffici wavelet detail channel gener action asm perform combin oper action final navig combin conflict behavior pure obstacl avoid action gener lead ineffici motion cach shade circl neg rel size circl strength index local map local map obtain obstacl goal order magnitud spatial resolut global map sampl stereo imag pair train navig gener action beneath pair sampl stereo pair gener martian digit elev map membership valu return ambigu input system train stereo gener action turn left avoid obstacl find cach system connect shown notat symbol text detail discuss interfac studi area displai left rel stereo view rover displai upper import mission paramet intern temperatur batteri level shown dynam slider km studi zone studi grayscal rel highest elev chang studi area meter path scout rover multipl cach retriev mission cach posit mark circl rover start posit mark cross fill circl mission miss cach grayscal rel elev figur prototyp planetari robot lab nasa jet laboratori ca wavelet transform action gener extern input action select stereo imag figur multilevel system organ cach retriev oper planetari environ coeffici wavelet detail channel gener action asm perform combin oper action final navig goal clear clear block avoid obstacl approach goal action figur combin conflict behavior pure obstacl avoid action gener lead ineffici motion cach shade circl neg rel size circl strength low resolut global map high resolut local map index node figur index local map local map obtain obstacl goal order magnitud spatial resolut global map forward left turn turn back goal figur sampl stereo imag pair train navig gener action beneath pair sampl stereo pair gener martian digit elev map goal backup straight left figur membership valu return ambigu input system train stereo gener action turn left avoid obstacl move action good health explor explor cach arriv cach cach reach stop ne se sw nw obstacl rand dir cach night find cach approach cach figur find cach system connect shown notat symbol text detail discuss zoom stereo view total mission time batteri level time dai current action left turn cach temperatur figur interfac studi area displai left rel stereo view rover displai upper import mission paramet intern temperatur batteri level shown dynam slider km km figur km studi zone studi grayscal rel highest elev chang studi area meter mission mission mission mission figur path scout rover multipl cach retriev mission cach posit mark circl rover start posit mark cross fill circl mission miss cach grayscal rel elev
HCI/204 4 learn interfac agenc bielefeld faculti technolog ag system germani abstract paper describ learn approach adapt user prefer realiz interfac agenc negoti agent contractor manag negoti pursu goal dynam user adapt learn indirect user adjust intern credit vector assign contractor gain maxim credit respect user current current situat circumst realiz user adapt achiev accumul explicit user model distribut user model introduct interfac agent comput program enhanc interact mediat relationship technic system user provid assist user act behalf autom action commun form translat qualit input human user command interpret applic system assist user perform interfac agent knowledg user applic promin approach build learn interfac agent automat acquir knowledg task prefer user appli machin learn techniqu singl person interfac agent custom individu user acquir explicit user data acquir data build explicit user model found critiqu respect privaci person inform pursu approach interfac agenc consist multipl custom user prefer build distribut model user learn indirect user feedback determin agent prefer individu user actual situat dynam activ singl agent realiz learn process multipl agent role contractor agent role manag negoti pursu common goal dynam user adapt paper structur start distinguish approach relat work field user adapt learn interfac agent proce learn techniqu term learn categori form learn basic idea focu realiz agent role contractor agent role manag learn techniqu integr interact system illustr adapt user prefer spatial refer frame relat work realiz automat adapt vari prefer user solut produc applic comput system knowledg user applic domain convent approach field artifici intellig humancomput interact commonli base model user inform user adapt user requir acquir user model demand larg amount work applic design user case static case automat disadvantag occur method knowledg user explicit knowledg fact found critiqu respect privaci person inform interfac agent consid metaphor indirect manag interact command direct manipul realiz learn interfac agent user solv problem unix oper system approach user adapt base endow interfac agent huge amount background knowledg user applic similiar method disadvantag huge amount fix knowledg acquir elabor approach learn interfac agent reli automat knowledg task prefer user appli machin learn techniqu techniqu learn learn learn learn agent build learn interfac agent electron mail handl inform filter tree realiz learn person assist meet schedul built teach agent support user write lisp program watch user action product system blackboard mechan main differ present singl person interfac agent custom individu user acquir user data problem person inform user consist number learn techniqu focu aspect user adapt agent collabor agent learn curv handl situat respect integr learn facil studi research agent system learn agent abil task load switch broadcast task announc direct task assign realiz learn system lem learn determin suitabl robot task execut reason negoti similiar inform previou negoti messag extract contrast work limit aspect optim commun overhead learn achiev user adapt build explicit user model innov approach learn method describ learn method approach term learn categori form learn emphasi learn strategi learn feedback learn categori adapt user prefer build explicit user model reli design system consist numer subag realiz function type join agent type slightli intern function correspond class user prefer respect function type agent realiz special prefer prefer class exchang inform negoti learn organ agent activ correspond actual prefer current user situat mean learn aim dynam adapt respect prefer prefer individu user session approach learn requir presenc multipl agent negoti pursu common goal dynam user adapt form learn agenc learn goal user adapt offer solut user observ user implicit posit explicit neg feedback implicit posit feedback user instruct instruct declin previou explicit neg feedback user correct solut offer interfac agenc feedback provid user act critic interpret encod interfac agenc form credit valu credit store local agent correspond agent strength discret interact step user instruct evalu respect number solv interfac agenc number commun cooper process carri agent adapt emerg consecut feedback user achiev cooper agent learn strategi classifi form learn discoveri agent captur knowledg interact process agent make gener solut basi observ result perspect feedback agenc method regard reinforc learn agenc learn action feedback learn negoti execut task result bid scheme agent role contractor agent role manag task manag agent send task announc contractor agent respect task idl contractor gener bid send manag manag evalu incom bid select contractor task execut extend standard negoti basi standard integr step negoti achiev user adjust credit correspond user feedback actual situat paramet assign agent elig task maxim credit correspond interact process step realiz agent instanc interfac agenc step realiz agent contractor role extract store relev inform incom negoti actual situat result adjust includ current credit bid step realiz agent manag compar incom bid evalu credit negoti alloc task reject bid contractor figur illustr negoti process case contractor manag manag contractor interfac agenc task announc task announc task alloc bid reject contractor fig detail negoti contractor gener bid task bid potenti contractor reject adapt user prefer achiev set negoti function execut local manag contractor result distribut agent system function realiz step mention concaten function manag number contractor case manag negoti function interact step defin neg manag contractor contractor function contractor realiz adjust credit base data extract current negoti messag basi manag function manag realiz assign success contractor schemat view negoti function shown figur abstract point activ prefer agent rise distribut user model acquisit explicit user model avoid adjust terminolog earlier public consist data data data data data data data data manag contractor contractor fig function scheme learn approach mechan tool achiev extens standard negoti process begin section contractor manag store knowledg negoti process knowledg adjust credit assign contractor bid includ user feedback credit actual situat requir learn strategi prototyp version adapt simpl heurist modif credit assign system adapt chang prefer user disadvantag prototyp system credit simpli repres scalar valu inform histori potenti success contractor adapt method handl number contractor manag current situat paramet account adjust credit flexibl version elabor respect manag contractor function basic requir interfac agenc organ user prefer actual situat paramet call achiev ongo adapt negoti simpl credit simpl select process contractor suitabl gener heurist defin concern adjust credit assign agent requir credit repres strength contractor intellig assign contractor current situat paramet constrain adjust credit model influenc situat circumst user prefer contractor store credit relationship distinguish manag neg direct activ contractor undesir solut prefer handl assign domin contractor number contractor number manag realiz reduc commun task alloc contractor directli contractor success session conflict fact contractor equal success contractor resolv aspect concern contractor aspect concern manag aspect pertain function agent entir system role contractor role manag situat time agent perform function execut function part commun cooper intern function realiz kind global inform agent describ detail heurist defin contractor manag function agent contractor adapt user contractor learn function realiz adjust credit base data extract negoti messag manag learn function realiz assign contractor contractor function perform extract store relev inform incom negoti comput actual situat result adjust credit includ bid credit basic idea decid inform relev adapt task captur motiv task assign compani appli contractor consid success high number task contractor high number task perform high number task successfulli perform contractor realiz idea demand contractor acquir knowledg negoti step repres knowledg kind vector track ongo session kind vector defin data vector repres acquir messag data determin number negoti process contractor store data vector type refer negoti techniqu announc direct task content repres kind feedback user posit neg vector credit credit repres agent strength discret negoti step includ number mention interact step credit vector contractor defin task number task contractor task number task perform task number task successfulli perform contractor sit repres conform current situat prefer embodi contractor conf result combin vector compon special repres confid contractor task successfulli contractor cooper manag contractor successfulli perform task alloc manag unsuccess perform task alloc contractor store credit vector manag manipul vector depend current manag comput situat paramet natur user prefer depend situat circumst result variat prefer applic scenario section orient refer object user view relev situat paramet handl situat current situat realiz user adapt achiev integr comput situat paramet data vector data sa comput contractor sa involv drop indic sa formula hold true adjust credit mean current situat influenc adjust credit posit situat conform user prefer contractor realiz analyz situat integr result adapt set independ featur fn featur opt situat confirm featur optim respect prefer agent realiz current determin featur negoti step kind featur number featur defin local agent consid part local knowledg featur vari equal model function type optim featur valu vari member realiz prefer basic requir model prefer class current situat measur comput weight sum featur jf opt weight determin import featur measur situat result equat measur deviat current situat situat prefer confirm optim compon sit credit vector measur conform current situat prefer embodi negoti step sit comput sit calcul contractor gener bid task announc begin session inform current situat confirm prefer make predict respect adapt effici describ sit integr adjust credit adjust credit kind inform repres situat influenc user prefer measur credit vector explain credit compon confid comput valu vector compon comput basi inform store data vector acquir interact step task updat rule contractor sa task increment task post sa task directli alloc contractor remain task announc task alloc task determin similar bit restrict increment contractor perform remain task alloc number task successfulli perform increment task successfulli perform contractor user feedback remain task alloc confid confid refer trust contractor task successfulli comput compon sit compon credit vector conf updat result combin confid contractor execut post task successfulli influenc perform respect previou task announc contractor contractor domin session situat conform speak factor describ factor influenc constrain select user prefer reflect user satisfact offer interact situat depend perform contractor result user feedback contractor involv previou task perform negoti step comput mean perform high contractor perform previou task perform low solut contractor offer correct perform high low contractor perform previou task perform contractor determin contractor test carri check number successfulli perform task relat number perform task greater threshold number perform task relat number announc task greater threshold domin base result domin predic negoti step influenc factor base credit compon sit test sit conform perform check sit greater threshold result test comput negoti step ae sit threshold fl updat correspond contractor perform perform posit threshold threshold ff comput negoti step ae ff min determin remain manipul contractor lower domin lower situat conform consid success futur interact perform task posit comparison execut task neg result confid negoti step determin ae definit contractor low perform result receiv neg feedback minim confid confid comput weight sum influenc factor combin factor effici assess contractor similiar trust select agent collabor credit vector addit compon detail discrimin contractor conflict case sole reli contractor evalu defin credit requir section satisfi concern agent contractor credit conf repres kind strength captur inform stabl current situat integr adjust relationship direct activ contractor neg feedback adapt prefer prepar definit conf agent manag base contractor manag function agent perform step achiev adapt user announc pool incom bid task assign contractor base result comparison bid announc task user instruct requir solut number agent system unit number negoti process carri agent solv manag agent involv suppli manag manag gener task announc task execut gener inform includ send task task announc user feedback current instruct neg user feedback includ explicitli posit feedback current weight fix includ implicitli neg feedback append neg instruct front task descript left case posit feedback question remain agent credit assign problem problem agent system decid action agent contribut perform chang easili made user prefer consid independ mean user instruct concern special involv easili determin credit approach handl prefer depend assign credit blame contribut offer solut regard agent decid fact led contribut action activ special agent contribut reli credit includ bid mean kind problem solv adjust intern credit valu correspond negoti process current feedback includ task announc problem solv agent manag problem solv agent contractor execut task announc task requir number commun cooper process reduc interact manag alloc task directli contractor execut task successfulli period contract manag acquir knowledg contractor collabor success failur session inform captur histori vector ffi task repres number task alloc success store task perform posit recipi refer specif contractor consid ffi correspond threshold bid evalu test manag decid contractor perform task successfulli period contract posit case alloc task contractor directli similiar idea present learn algorithm reduc commun overhead index sa indic special drop cf footnot pool bid task manag wait bid contractor collabor incom bid preprocess extract credit includ factor relev comparison pool result intern credit data structur factor mention step result test success contractor bid session similiar agent contractor perform test comput manag perform test determin contractor strength check number successfulli perform task relat number perform task greater threshold perform threshold histori vector perform ffi updat search entri histori vector entri valu ffi ffi min ffi ffi min ffi max ffi pool bid constrain disjunct condit termin wait process manag wait incom bid maxim time interv reach member contract bid manag determin contractor activ send task announc condit manag start compar bid bid stop current negoti process comparison bid determin contractor work successfulli manag compar bid bid basi credit inform extract pool previou step procedur execut bid pool manag start comparison entir set bid reduc search space step step special contractor left match contractor remain set contractor chosen criteria assign contractor main class rule class rule concern comparison confid includ rule remov bid conf minim result set bid empti rule rule determin maxim conf greater rule rule rule bid conf evalu confid conf contractor activ neg feedback occur bid minim confid remov maxim confid manag reli contractor proce evalu criterion consid evalu situat conform perform rule rule bid sit greater ffi result set bid rule satisfi sit greater manag alloc task contractor credit confid low prefer base situat circumst model class rule aim model prefer concentr domin contractor reach rule bid relat task task relat task task greater ffi result set bid result set bid rule rule rule contractor prefer work averag session manag discrimin situat contractor contractor satisfi condit condit make differ poor contractor rule distinguish contractor order determin rule regard conflict resolut rule rule determin bid maxim ambigu bid sit rule bid differ task task result set bid rule rule distinguish contractor credit valu account conflict prefer situat conform maxim manag contractor minim number neg feedback session determin poor manag perform rule handl conflict case defin rule direct activ contractor neg handl assign success contractor number discrimin conflict case realiz task alloc contractor directli reduc commun overhead requir state section satisfi complet applic adapt method paper implement multiag interfac system interact carri project user instruct system verbal gestur input qualit instruct translat interfac agenc intern command interpret graphic system virtual offic room manipul user enhanc interact realiz anthropomorph visual scene respond carri user instruct fig snapshot scene interfac agenc reconstruct user number task solv distribut multiag interfac system entir interfac agenc consist set commun cooper realiz function figur space agenc determin spatial color agenc scene hamilton agenc determin action color graphic system augment graphic db space virtual camera bookkeep hamilton control verbal gestur input input data structur control mechan coordin object hierarchi geometr scene descript refer parser gestur listen speech listen type listen observ fig architectur multiag interfac system anthropomorph figur agent commun cooper variat negoti protocol agent role contractor manag user interact system qualit verbal gestur instruct mean resolv unambigu solut practic experi system shown variat user prefer exist respect solut agenc prove reason testb integr adapt facil built agent type slightli intern function user prefer join requir learn approach section satisfi learn adapt method paper implement test varieti primarili case user prefer spatial refer frame semant spatial instruct depend perspect interpret user point view point view object promin front experi system shown due individu differ fig solut instruct hamilton move left perspect spatial refer frame prefer situat figur solut offer system user instruct hamilton left user prefer spatial refer frame depend orient object actual situat basi refer hamilton move direct basi refer hamilton move direct refer frame prefer depend prefer current user situat implement instanc hamilton equip learn framework user instruct anthropomorph contractor comput situat adjust gener bid includ credit situat featur concern orient hamilton distanc hamilton user agent interfac coordin act manag implement space contractor comput spatial transform basi refer basi refer addit situat featur mention space agenc featur analyz charact refer object possibl underli object orient underli object test adapt method case user prefer color sensat implement color agent offer drastic smoother color transform situat featur pertain light scene integr system experi shown approach realiz adapt user prefer effect satisfactorili respect requir state section fuller carri basi artifici goal discuss paper present learn approach user adapt realiz interfac agenc interfac agenc consist repres prefer class consist agent prefer agent base negoti process agent role contractor manag agent acquir knowledg situat captur intern credit vector agent acquir knowledg collabor contractor success failur session learn indirect user feedback ongo contractor manag compet meet user prefer extend negoti intuit mechan achiev user main result gener framework adapt user prefer easili integr base system intern function realiz kind global inform agent system knowledg user express activ agent entir interfac agenc user adapt achiev distribut user accumul explicit user model main work topic concentr evalu learn strategi order carri replic defin artifici user compar result offer interfac agenc predefin expect artifici user evalu includ detail evalu contractor manag function optim refer dn intellig interfac agent jw sw intellig user interfac acm negoti metaphor distribut problem solv ah read distribut artifici intellig morgan ml learn multiag system phd thesi depart electr comput south anthropomorph agent spatial languag publish vision user person view art humancomput interfac design collabor interfac agent nation confer artifici intellig cambridg mit interfac metaphor charact art interfac design interfac agenc interact virtual environ adapt learn system intellig interfac virtual environ artifici intellig report agent reduc work inform overload commun acm learn interfac agent eleventh nation confer artifici intellig aaai mit mf user model adapt comput survei recent develop artifici intellig review experi learn person assist commun acm da peopl interact agent commun acm learn reduc commun cost task negoti multipl autonom mobil robot adapt learn system view spatial preposit ai magazin teach agent learn commun acm interact graphic design situat agent graphic robot virtual interfac agent und agenc poster contribut intern confer autonom adapt learn remark bibliographi adapt learn system
DB/205 3 logic program creat integr check partial evalu michael danni de integr constraint specif deduct induct abduct logic program verifi integr constraint updat major effici bottleneck method develop speedup task incur overhead paper solut problem partial evalu integr check updat pattern idea lot integr check perform updat pattern concret updat order achiev write integr check logic program incorpor knowledg integr constraint violat prior updat partial evalu transact partial evalu techniqu present earlier automat obtain effici updat execut faster integr check procedur literatur introduct gener context partial evalu receiv attent function program refer logic program concern approach strongli differ function focu lot contribut logic address correspond de dept comput katholiek journal logic program fl elsevi scienc avenu ny receiv attent major work concern direct target remov overhead context pure logic partial evalu refer partial term partial evalu reserv treatment program firm theoret foundat partial deduct establish lloyd program object input manipul detail account found applic extend program program analysi transform theoret integr constraint deduct induct abduct logic program ensur contradictori data introduc monitor coher practic check integr deduct updat allevi special integr simplif method advantag fact consist prior verifi constraint possibl affect inform refin method turn effici motiv contribut line motiv work motiv particip project brought european research area deduct logic program frequent issu discuss partner area potenti deriv highli integr check deduct partial evalu refin integr check implement respect updat pattern respect static part idea applic suit partial evalu select techniqu perform integr check static compon potenti updat pattern occur actual content store relat rule defin deriv relat store intent static due possibl divid applic larger potenti gain speedup static part respect number pattern relat dynam part extrem flexibl gener notabl except remaind paper talk deduct discuss result remain valid induct abduct logic program integr constraint date procedur kind updat pattern kind partial knowledg consid bry manthei argu applic fact chang rule rule updat integr constraint respect dynam respect dynam requir applic implement integr check stuck adapt implement strategi depend applic hand idea base partial evalu implement part paper provid practic line motiv grown previou attempt promot partial deduct broader commun softwar develop research matur technolog automat softwar partial deduct frequent appli techniqu logic program report successfulli applic literatur contrast work partial evalu function imper area rai trace scientif comput simul model publish motiv work report success applic partial experi illustr significantli improv gener integr check techniqu literatur work conduct ffl select effici integr check method sonenberg present section refer ffl observ method amen program reason discuss section section main reason function method produc instanti version integr check metainterpret function accomplish ground implement featur solut put high demand cope effici current incap effect ffl introduc simplifi integr check produc instanti check method effici absenc produc easili implement call ground lift resolut hope expect loss effici result produc instanti version check automat regain expect turn complet justifi ffl enhanc result integr check method refin involv increment check section enhanc loss interpret respect section result techniqu effici section ffl appli develop previou work integr checker respect updat pattern result show integr check extens faster effici implement method contribut work level lowest ffl program develop integr check perform significantli gener integr check method applic area shown work ffl introduc enhanc integr check method start consist increment check behaviour result method gener competit higher main contribut engin area function long gener accept effect program requir input program bind time logic perceiv fulli automat main lesson learn work reengin input program crucial success ffl algorithm style integr unclear code amen ffl benefici degrad effici view argument ffl introduc overhead case aim prune search space detect irrelev execut ffl redund fail comput detect ffl produc instanti version produc ffl specif context experi prefer fulli ground annot automat unfold difficult final note reengin perform case reengin integr fact clarifi contribut paper introduc increment solv achiev obviou discuss engin experi downgrad result choic make checker updat pattern earlier version articl deduct integr check assum reader familiar standard notion logic program introduct logic program found convent repres logic variabl letter predic functor repres letter lead success goal liter select deriv step section present essenti background deduct integr check present method integr implement definit formula form head bodi head atom bodi conjunct liter deduct set fact empti integr constraint form bodi rule fact integr constraint gener rule constraint reduc format transform constraint format refer inconsist indic conveni violat integr iff deriv view inconsist exist discuss instanc found note requir deduct notion integr base answer irrespect underli languag ensur flounder point integr constraint plai crucial role logic program base research area fair receiv attent context deduct address topic constraint semant queri system support fulli automat recoveri integr violat effici constraint check updat topic focu paper semin provid treatment effici integr constraint check updat deduct reason forward explicit addit comput indirectli implicit potenti updat addit implicit addit fact instanc deriv depend instanc provabl propag potenti updat program hit addit time updat endang integr uncov evalu bodi affect integr constraint check provabl propag potenti line definit tripl db db mutual disjoint deduct ffi goal iff ffi db db fgg similarli ffi ffi db db fgg db remov updat db ad updat db db repres state updat db db repres state updat mgu repres idempot relev mgu obtain renam unifi exist mgu fail oper mgu interest properti mgu fail iff common instanc proof definit updat db db defin set posit potenti updat set neg potenti updat induct po fa bodi db neg fa bodi db po bodi db bodi po mgu bodi db bodi neg mgu neg bodi db bodi neg mgu bodi db bodi po mgu po neg set comput fixpoint iter db db rule db variabl occur updat db db independ fact db falseg simplifi integr line topor sonenberg method essenti boil evalu bodi time fact insert po check test instanc remain evalu separ constraint check phase main differ exposit calcul step note definit test atom deriv updat call phantom deriv updat call idl similar remark made atom simplifi integr check featur updat propag method decker perform phantom test comput induc updat potenti updat solut weak strong point overview work offer clear exposit main issu updat emerg decad research found compar effici major strategi rang exampl recent contribut found concentr potenti updat advantag access entir updat propag definit refer fact db liter bodi lot larg number lead good effici experi restrict method base sole definit rule integr constraint chang fact base definit simplif method detail definit set obtain specif instanc goal detect proof tree goal potenti affect updat definit updat goal ln mgu posit liter mgu ng mgu posit liter approach yield iter step influenc atom independ atom po neg mgu ng potenti ad iff potenti delet iff note trivial iff liter roughli calcul bodi bodi integr constraint evalu simplifi constraint obtain set simplifi integr check simplifi constraint effici integr constraint remaind present integr check substitut slightli differ method advantag implement manner amen deriv present updat definit db db updat ffi goal deriv step ffi call increment iff resolv posit liter db select ground neg liter potenti delet ffi increment iff increment deriv step treatment neg liter definit optim fact potenti delet deriv exist state prior updat optim due implement current approach lemma goal updat exist increment potenti ad proof db db ffi increment defin ffi increment obtain stop increment deriv step ffi sequenc goal ffi prove induct length ffi potenti ad base mean deriv step increment posit liter neg liter select insid case goal resolv db definit po definit obtain case definit exist mgu case potenti ad induct potenti ad induct appli induct hypothesi increment consist step ffi sequenc goal deduc potenti ad ln liter neg liter select deriv step potenti liter occur unchang posit liter select deriv step resolv db case exist case gener goal potenti ad case exist posit definit mgu oe definit element gener instanc common instanc mgu exist conclud potenti ad proof ident case neg liter definit ffi sequenc goal ffi ffi relev iff potenti ad ffi increment ffi lead refut deriv concept defin relev refut theorem form basi method perform integr check theorem integr db db provid formal definit notion correct exist literatur discuss remaind proof fresh occur note case mgu insid definit technic detail overlook instanc unifi gener updat goal iff relev refut proof relev refut trivial relev refut deriv valid db db contradict lemma infer deriv conform definit relev integr constraint deduct violat search relev refut order check integr constraint updat observ deriv extend relev method illustr goal figur annot set substitut lead relev prune similarli deriv descend goal db relev prune deriv lead increment relev potenti ad figur method refin method simplifi integr constraint topmost level affect bodi integr test integr constraint prune branch aspect import present section method remov integr constraint instanti possibl gener integr constraint singl improv reduc number match fact aspect vital practic improv effici integr check definit relev deriv instanti intermedi goal mean prune refin method practic larger absenc instanti simpl implement method amen effect partial evalu turn miss instanti perform partial evalu prune place partial result overhead due extra prune complex result section confirm integr check updat procedur integr check implement manipul updat object level express major benefit approach li flexibl propag simplif strategi incorpor partial evalu integr check updat pattern concret updat db implement method previou section find refut manner outlin figur updat pattern db db obtain updat effici check essenti concret procedur basic check consist similar manner simplif evalu process deriv figur lead prune time similarli deriv descend goal db prune time updat procedur longer calcul concret updat lead high effici gain integr check method present previou updat procedur long rule integr constraint chang db db concret updat instanc updat pattern updat procedur remain valid result overhead evalu integr constraint easili adapt definit instanti goal theorem valid explicitli address compil aspect approach limit import respect techniqu terminolog gener apparatu provid partial deduct main concern show inconsist indic integr constraint relev effici good idea section present integr check base theorem act object level express repres deduct present discuss issu repres object level express insid mix logic basic approach repres object level atom approach term object level call repres object level variabl variabl approach term repres object level atom call ground repres object level variabl ground term figur exampl ground paper denot ground term object level ground figur ground ground advantag treat pure declar applic requir semant problem solv extent main advantag underli unif ground explicit unif algorithm requir induc differ speed reach order magnitud pose subtl problem current consensu logic program commun merit actual choic depend applic detail discuss refer reader extend version combin approach exemplifi gallagh ground present oper point metainterpret lift ground resolut altern declar view discuss call approach mix object level goal form object program ground form techniqu versatil ground repres object level program remain effici demonstr gallagh experi partial evalu complet remov overhead ground perform similar feat full ground explicit unif harder accomplish attempt mix ignor semant problem simpli implement reason chosen ffl disadvantag difficult partial knowledg partial evalu atom instanc head fact ad deduct form unknown constant ground knowledg express write variabl longer repres constant stand term ffl caveat object program store explicitli object program perform figur illustr possibl note copi figur incorrectli fail queri applic mean copi approach unduli complic task time lead effici bottleneck impli repres updat cumbersom basic encod updat explicitli make dynam imposs option applic mix similar techniqu partial evalu hill gallagh provid recent account style write repres atom requir partial evalu support ensur instanc inform provid properli term figur object program make figur lift ground call make ground term queri make succe comput answer similar variabl fresh variabl actual vari code predic present figur simpl base found figur code variat predic make call make lift ground term declar type argument make repres ground term instanc note contrast origin present execut execut make obtain comput answer ground ground make ground ground figur interpret ground goal make infinit number comput observ figur written time assum declar prolog behav declar argument make ground increment potenti resolv increment resolv db db db figur skeleton integr checker theorem extend interpret figur integr check base theorem stop resolv goal potenti perform increment resolut step earlier deriv skeleton figur implement idea full prolog code found appendix argument ground updat db db predic resolv perform increment resolut step definit resolv perform predic potenti test goal potenti ad updat base definit integr check consist call increment solv db db queri succe integr violat updat implement integr check section studi implement predic potenti discuss full implement method amen rule definit basi potenti method directli transform simpl logic program calcul element make abstract write po db db db db db db db db db db db db db implement termin hierarch easi partial evalu lead predic possibl ident subsum solut context mix predic instanti express instanc add potenti db db db db goal instanti execut mean ensur backtrack lot useless instanti collect solut perform subsumpt test gener declar ground avoid section mix primit collect subsumpt hard partial evalu effect partial evalu knowledg accomplish comput answer goal call subsum exist comput answer instanc program written tabl logic program languag xsb tabl logic program determin unfold termin exploit altern approach topic research extend theorem major problem rule db db db db db naiv implement succe time queri potenti queri potenti comput answer note solut mean flounder useless instanti queri appli includ instanti goal integr checker ffl simpl implement subsumpt perform lot redund check ineffici ffl perform subsumpt turn lead ffl ground problem term effici ffl featur difficult partial evalu result exist techniqu end section speedup achiev exist partial evalu full implement integr check method reli ineffici amen effect current techniqu progress made context fulli subsumpt test requir perform loop check insid integr checker integr checker amen effect current techniqu unclear implement full method code effect amen context hierarch integr check solv problem wrap call potenti succe empti comput answer goal succe fail solv problem duplic subsum solut succe empti comput answer backtrack instanti made disadvantag verifi instanti perform gener cut search space instanti perform program primit declar implement prolog semant simpl translat pose problem instanc full blown cut suggest okeef carri takeuchi furukawa current speed penalti ground emploi reason choic section present subset full call discuss includ addit semant difficulti handl simpl manipul partial evalu definit defin syntax partit predic symbol disjoint set bi predic symbol cl predic symbol normal atom atom construct predic symbol cl similarli atom construct predic symbol bi normal atom express form conjunct express form head bodi head normal atom bodi conjunct behav construct prolog inform prolog defin test succe local cut execut execut proce part cut map construct local behaviour sensit sequenc comput answer mean comput rule search rule fix order give clear mean prolog comput rule lexic search rule deriv convent call deriv illustr point program program prolog comput search queri fail program succe chang order comput answer predic impli partial evalu ensur preserv sequenc comput answer instanc partial deduct framework preserv comput answer sequenc semant remain simpl straightforward denot semant style associ denot program possibl infinit sequenc comput answer substitut option element end finit denot loop exampl set denot construct simpli defin order preserv sequenc comput address problem relat bind unfold atom instanti atom left head context chang program behaviour bind chang order solut lead incorrect transform program obtain unfold atom chang sequenc comput answer program program sequenc comput answer problem bind solv wai partial evalu literatur overlook contribut context transform pure logic preserv order handl techniqu method strictli enforc prolog select rule select leftmost instanc suffici simpli ensur termin partial evalu process cope extend concept deriv addit resolut step step remov atom goal hide bind gener residu code discuss unfold insid handl straightforward manner big contrast program full blown cut reason full cut effect subsequ defin predic scope cut alter effect treatment cut requir involv techniqu cut insid local affect reachabl mean easier handl partial evalu illustr unfold program pose problem lead correct unfold atom program written cut lead incorrect program longer consequ program program fail fail unfold program fail fail fail exact detail unfold found share analysi produc effici program remov useless bind useless test occur predic output argument insid improv li gener multipl predic call vari inform argument partial evalu situat partial deduct pure logic program system sp sage recent partial evalu full prolog aspect partial evalu system includ techniqu sketch section implement origin grew section appli system obtain updat procedur present aspect relev applic safe bind end section point disadvantag verifi instanti perform lot instanti perform partial evalu prune safe bind instanc updat procedur figur present section gener updat db db updat procedur test directli origin figur test fact match prune irrelev branch instanti perform partial evalu fact reason extrem high speedup figur present result section part integr check perform part perform partial evalu obtain unfold prune irrelev branch case improv updat procedur perform safe bind previou bind gener unsaf context safe pure declar program perform ordinari partial circumst bind affect correct program illustr safe benefit effici part updat procedur increment solv test comput answer ground substitut rang restrict predic case bind increment solv test gener sequenc comput answer origin effici lot fact increment solv call instanti effici call parent succe child entir parent relat partial evalu phase perform conserv safe common altern addit choic point gener context larg optim bind produc increment solv test increment solv test gener updat procedur effici result section improv control unfold partial evalu part unfold made ffl annot annot program ffl perform unfold guid annot ffl perform gener partial deduct remov useless perform safe simplifi residu gener residu program annot phase automat perform hand posit knowledg user control unfold automat unfold satisfactori issu topic lot contribut fulli gener problem solv context hierarch hand annot fulli satisfactori unfold achiev proper annot kind updat pattern invest time annot metainterpret appendix high benefit consecut applic phase deriv updat procedur fulli exemplifi prototyp experi result comparison show result illustr improv method sonenberg topor rule figur form part db db db independ fact db marri marri marri falseg falseg method gener simplifi integr refin annot provid user atom fulli evalu argument ground argument free evalu simplif integr constraint optim fact match exist evalu simplifi integr constraint lead incomplet depict figur subsequ evalu goal potenti ad deriv lead goal increment theorem deriv prune lead success fact consist updat increment solv appendix improv evalu marri marri marri marri marri figur part db figur partial evalu increment solv useless branch prune time gener updat procedur pattern db db obtain updat procedur present figur updat procedur satisfactori optim improv add inform predic disjoint applic requir current method explain seemingli redund test figur check fact marri benchmark present section increment solv increment solv fail fail true figur updat procedur ad show method handl updat simplifi integr constraint obtain interest effici obtain updat procedur immedi method run gener updat fulli concret updat gener updat db db independ fact db marri marri marri falseg falseg method gener simplifi integr figur slightli sugar simplifi version result updat procedur problem find time directli produc sugar simplifi version benchmark execut version method integr check method handl pattern form repres unknown constant variabl repres updat pattern constant simplest lead incorrect run gener updat deduc integr constraint violat updat integr constraint remain unchang mean updat procedur obtain techniqu gener slightli faster fulli integr constraint updat procedur run tabl slower updat procedur figur obtain process approach obtain updat procedur practic order approach method adapt distinguish variabl unknown input stem updat pattern approach base partial evalu comparison partial evalu perform experi goal experi compar annot base partial evalu techniqu present section exist automat partial evalu full prolog give impress potenti approach subsect extens studi complic elabor show benefit compar method time benchmark express obtain call predic prolog incorpor time garbag set updat fact consist fact fact rule part present figur note realist fact part simul prolog fact extract tupl time prolog test execut sun sparc classic run solari integr check method naiv figur fact consist updat simpli find refut increment solv perform integr section skeleton found figur full code appendix updat procedur obtain partial evalu system section base perform fulli publicli prototyp time solv updat procedur obtain time safe bind section disabl updat procedur obtain automat partial evalu version default paramet experi updat procedur obtain automat partial evalu present result procedur slightli convert prolog transform cut paramet default default slow experi present consist gener updat procedur updat db db unknown partial evalu time result partial evalu obtain figur time tabl row figur absolut rel time requir check integr fact row figur fact solv fact fact tabl result db db time tabl tabl includ time integr constrain time run note solv perform method interleav execut explain section time requir gener updat procedur updat pattern includ fact updat procedur rule integr constraint chang time obtain updat procedur current implement slow displai trace inform ground reduc time partial evalu order magnitud current time invest partial evalu pai quickli larger experi gener updat procedur updat db db unknown partial evalu time updat pattern offer opportun previou speedup figur satisfactori result tabl solv fact fact tabl result db db speedup obtain system encourag updat procedur execut order magnitud faster intellig increment integr checker order magnitud faster solv speedup made grow figur larger note solv figur yield speedup reach order magnitud updat procedur obtain system perform time faster obtain fulli automat system show combin restrict attent full pai note safe bind section benefici effect effici updat procedur studi perform elabor studi updat procedur gener compar effici techniqu perform relat hierarch end sophist complic transact rule integr constraint db found appendix benchmark subsect addit integr check method implement method code found appendix implement assert retract store potenti updat solut ran slower shown appendix store potenti updat list elabor updat pattern result tabl updat updat procedur found tabl descript concret instanc updat measur effici method column tabl integr constraint violat concret updat concret row absolut time updat row rel time wrt tabl divid size case updat procedur previou time simplifi run integr concret includ time gener updat procedur includ justifi section run concret updat updat pattern updat ic solv fact fg fact fg tabl result db db benchmark updat procedur gener perform extrem tabl detect updat violat integr constraint speedup speedup tabl rang speedup encourag lead conjectur approach present paper practic lead big effici improv larger time actual evalu simplifi constraint simplif rel differ diminish grow fact tabl run time faster exampl test evalu mechan slower system effect size benchmark figur futur updat ic solv fact fg fact fg tabl result db db updat ic solv fact fg fact fg tabl result db civil db work examin current techniqu experi carri differ remain measur heap consumpt time heap space small experi updat pattern success speedup order futur direct discuss present idea obtain updat procedur deduct principl write integr check partial evalu updat pattern goal obtain updat procedur perform integr check effici gener integr check method gain insight issu ground versu notabl argu updat ic solv fact fg fg fact fg fg tabl result db db object program repres ground goal lift resolut approach advantag flexibl ground repres knowledg object program case deduct effici resolut mix suit partial evalu full ground argu exist integr check method amen current techniqu paper present integr check method context hierarch implement mix suit partial evalu effici implement make verifi construct verifi construct test encount check integr influenc updat case integr checker stop deriv goal verifi primit implement construct present extens pure call incorpor present languag drawn techniqu present partial evalu prototyp base gener updat procedur fulli automat prototyp conduct extens result encourag speedup reach order magnitud integr checker set integr constraint set rule high speedup due fact partial evalu perform part integr check compar updat procedur implement approach sonenberg topor result show big perform reach order obtain restrict attent hierarch updat ic solv fact fg fg fact fg fg fact fact fact tabl result db db long term object move point section obviou made argu result compar altern approach integr check deduct compar relat relat complex view deduct method competit simpler altern map relat full unfold perform relat integr check creat extens redund multipl check fulli unfold integr constraint simpl figur note unfold insid negat tricki lucki negat rule defin full unfold simpl fulli unfold integr constraint numer updat db db unifi updat liter bodi integr note duplic result simplifi integr check effici updat procedur figur lot execut complic entir conjunct make situat price pai rid rule captur common comput avoid repeat solv problem atom context hierarch comparison respect altern approach argu time consid carefulli evalu approach note integr check frequenc updat integr perform significantli higher static part difficult evalu real effici depend ratio ratio suffici time relev updat perform make accept fast execut typic perform requir effici devot attent effici make prototyp work increment adapt updat procedur rule integr constraint chang exampl present updat procedur rule integr constraint chang fact approach base partial evalu system order obtain effici updat procedur compil shown proper care write partial evalu capabl automat gener highli updat procedur hierarch negat futur direct futur appli techniqu paper flexibl static dynam part concept fact chang rule integr constraint level practic appli method paper abduct induct logic program conjectur solver sldnfa procedur greatli benefit term gener integr check procedur abduc predic investig partial evalu deriv integr check obtain integr check simpl solv figur assumpt integr constraint satisfi updat hand instanc form constraint framework constrain partial develop effect constrain partial deduct obtain updat procedur perform project updat procedur compil perform project acknowledg michael support esprit ii applic abstract danni de senior research associ nation fund scientif research bern marten version paper insight comment topic paper huge pile refer integr check introduc author subject bart demoen share write effici prolog program john gallagh point error earlier version paper fruit discuss partial evalu integr check grate discuss extrem comment hendrik decker interest discuss topic paper held stefan member ii project particip dagstuhl seminar mean final anonym remark clarifi paper refer andersen partial evalu automat compil gener intern confer compil lnc page andersen analysi tame pointer symposium partial evalu program page acm press apt introduct logic program van handbook theoret comput chapter page prove termin prolog semant approach journal logic partial deduct updat definit logic program journal logic januari loop check partial deduct journal logic transform left termin reorder problem logic program synthesi transform lnc page septemb bower repres godel object program godel technic report novemb bower fast declar apt logic page mit de marten gener criterion avoid infinit unfold partial deduct gener manthei uniform approach constraint satisfact constraint satisfi deduct intern confer extend page bry manthei tutori deduct logic program summer marten integr verif knowledg base logic program russian confer logic lnc page partial evalu improv cut logic north american page mit decker integr check deduct ultim method australasian januari decker compar integr check method deduct ieee confer data tour partial evalu system applic languag acm sigplan symposium partial evalu program page acm tutori note partial evalu ing acm symposium principl program languag south januari acm press da william path find method constraint check deduct data knowledg de marten herbrand semant untyp vanilla lnc page decker integr enforc deduct intern confer expert page south publish decker person commun januari decker procedur integr check deduct van page mit june deneck de abduct procedur normal abduct program intern joint confer symposium logic lau journal logic project bit fujita furukawa partial evalu increment compil gener partial evalu comput process approach gallagh system logic program technic report novemb gallagh tutori logic program acm sigplan symposium partial evalu program page acm gallagh bruynoogh deriv algorithm program gener analysi appli mathemat algorithm ifip confer system model czech chapman hall partial evalu logic program languag godel phd depart comput januari ground logic program languag godel logic program synthesi transform workshop page hill gallagh logic program technic report school comput publish handbook logic artifici intellig logic vol oxford scienc oxford press hill lloyd godel program languag mit partial evalu automat program gener prentic jone develop oper denot semant prolog intern symposium logic page atlant ieee comput societi press effici gener effici gener extens prolog dagstuhl seminar partial lnc page extend version technic report cw ku leuven ko substitut refut revisit logic eighth intern page mit specif abstract prolog machin applic partial evalu phd linkop linkop studi scienc technolog dissert introduct partial deduct lnc page effici comput differ consecut state deduct intern page sterl control unfold special interpret gener lee ling improv integr constraint check stratifi deduct lee ling improv integr constraint check stratifi deduct vldb mumbai partial evalu prolog master depart ku partial evalu logic program synthesi transform logic lnc page june prototyp partial evalu system obtain integr check prototyp depart ku septemb obtain partial deduct system librari benchmark obtain advanc techniqu logic program phd ku access michael de constrain partial deduct preserv characterist tree gener comput de creat integr check partial evalu acm sigplan symposium partial evalu program page la june acm press de logic program specif intern symposium program logic program lnc page septemb extend version technic report cw ku leuven marten obtain updat procedur partial deduct ground joint workshop deduct logic program abduct deduct knowledg base nr page june marten partial deduct ground applic integr check intern logic program page decemb mit press extend version technic report cw ku leuven de control partial deduct normal logic program acm transact program languag system sagona preserv termin tabl logic program unfold intern workshop logic program synthesi transform juli lloyd foundat logic program lloyd partial evalu logic program journal logic topor integr check stratifi journal logic lloyd topor make prolog express journal logic lloyd topor basi deduct system journal logic marten finit unfold revisit subterm technic report depart ku marten semant control partial deduct logic program phd ku februari marten de semant definit apt logic page mit marten de untyp problem journal logic marten de automat finit unfold measur journal logic august de sound complet partial deduct unfold base measur theoret comput applic partial evalu master partial evalu prolog lau logic program synthesi transform page neumann simpl transform metalevel interpret compil implement logic program russian confer logic lnc page nilsson program prolog okeef treatment cut prolog tool symposium logic page owen issu partial evalu logic june page mit partial deduct system technic report unfold rule full prolog lau logic program synthesi transform workshop onlin partial deduct larg program acm sigplan symposium partial evalu program page acm semant preserv transform rule prolog acm symposium partial evalu semant base program sigplan vol page yale prolog octob sadri kowalski approach integr foundat deduct logic chapter page morgan kaufmann lo automat partial evalu full prolog phd swedish institut comput march automat partial evalu full prolog gener method integr constraint check deduct data knowledg languag equal theori logic program technic report onlin partial evalu dagstuhl seminar partial lnc page sterl beer metainterpret expert system construct journal logic sterl shapiro art prolog mit takeuchi furukawa partial evalu prolog program applic meta program inform process page wallac compil integr check updat procedur mylopoulo automat onlin partial evalu confer function program languag comput lnc page harvard appendix full prolog code perform increment integr check base theorem order make experi fact prolog clausal updat fact relev integr check phase occur retract primit make assumpt fact rule instanc predic defin rule present fact vice versa fail increment ic checker db db db db db fail fail true determin liter potenti ad verifi liter potenti ad make bind fail fail true db db db db db db simul deduct fact lookup appendix code implement method topor sonenberg integr check deduct propag updat lloyd al method dynam main predic rule part updat ad fact po set atom potenti affect updat head sophist part adapt complic transform rule format transform requir
ML/206 6 universitat ulm fur informatik correspond neural fold architectur tree automata andrea universitat ulm nr mai citat andrea correspond neural fold architectur tree automata nr faculti comput correspond neural fold architectur tree automata andrea depart neural inform process germani abstract fold architectur adequ train algorithm special recurr neural network model design solv induct infer task structur domain gener architectur proven approxim map root label order tree real vector space articl explor formal correspond automata theori order comput power instanc gener fold architectur main result prove simpl instanc fold architectur comput power class determinist tree automata shown architectur constraint number type activ function transfer function influenc capabl proof carri construct manner detail analysi space complex construct scheme provid deriv bound principl node complex fold architectur implement tree automata threshold transfer function tree languag empir investig identifi belong class pattern languag show fold architectur capabl recogn interest subclass defin pattern constrain variabl occur nonlinear pattern languag turn capabl tree automata relationship pattern tree automata fold architectur give view interpret empir result lead formul conjectur adequaci classic automata framework full comput power fold architectur construct scheme present effect inject prior knowledg form tree automata implicitli form grammar pattern fold architectur sigmoid transfer function readi induct refin data train algorithm backpropag structur briefli discuss fold architectur gener knowledg framework keyword theori neural recurr comput tree node pattern knowledg inject content introduct motiv preview preliminari tree automata fold architectur learn task static view process dynam approxim capabl singl neuron boolean function connect connect correspond fa fold part fold part connect layer connect implement arbitrari state transit approach connect comput power fa threshold case relat word languag bound node complex fa implement upper bound direct lower bound pattern languag adequaci automata framework pattern languag languag boundari induc occurr constraint variabl setup result implic conjectur full comput power fa remark combin symbol neural learn framework ii robust inject fa relat work refer iii introduct motiv classic neural network model feedforward network successfulli appli static classif recognit task model interest domain inher dynam speech plant control time seri predict grow interest dynam recurr neural network model capabl model nonlinear dynam limit process sequenc continu discret valu input select topic found gori al gile al applic area molecular languag document geometr reason symbol comput requir deal structur object graph term inspir recent fold architectur provid adequ train algorithm backpropag design solv induct learn task structur object gener architectur proven approxim map label root order tree real vector space hammer applic perspect emerg comput chemistri al pattern recognit al search control theorem prove schulz al knowledg principl capabl architectur fa view gener class recurr neural network model includ network past year work comput power rnn link concept theori formal languag automata kremer gile frasconi al al minski plausibl access attempt lift result concept rnn fa articl explor formal correspond fa class tree automata natur gener focu comput power capabl instanc variat gener architectur note issu question learnabl prerequisit main result prove simpl instanc fold architectur comput power class determinist tree automata proof develop construct manner analyz compar space complex construct scheme construct scheme effect inject prior knowledg form tree automata form fa gener framework introduc shavlik briefli address topic discuss node complex fold architectur implement tree number neuron requir tree automaton fa bound case rnn threshold transfer function horn hush lift fa past bunch empir investig learnabl artifici gener term classif task conduct fa learn procedur schulz al task intuit consid hard fa solv fairli high gener accuraci identifi term set experi belong class pattern languag relationship pattern tree automata fa interpret result make fa candid interest induct infer task pattern recognit applic lead conjectur full comput power fa sigmoid transfer articl observ concept result case recurr neural automata sequenc process successfulli lift tree process appli explor relationship fold architectur tree automata preview paper organ fix basic terminolog requir investig give introduct concept tree automata gener fold architectur section static point view fa roughli feedforward network compon fold part transform part fold part comput combin input sequenc prior network state yield state map network state output kind activ function transfer function homogen usag result approxim capabl fa briefli review show upper bound result sampl complex strictli speak recurr neural network easili appli fold architectur basic tool appli proof construct develop section kei idea state transit function tree automata rewritten boolean formula show boolean function simul singl neuron activ function case sigmoid transfer function discret scheme appli output neuron constraint discret fact composit boolean function lead satisfi set linear inequ weight threshold main result correspond fa deriv section explor influenc architectur constraint proof carri construct manner construct schema complet detail analysi space complex import result fold architectur equip fold unit transform activ function sigmoid transfer function suffic simul determinist tree automata transform part previou proposit hold layer fa consist transform part unit layer recruit serv output simul fa constitut layer connect layer connect implement arbitrari tree automata state transit function techniqu appli transform implement fa connect fold part output neuron requir transform part shown fa equip sigmoid transfer function comput power case threshold function machin model term comput result field tree automata illustr interest relationship fold architectur class word languag discuss node complex fa implement number neuron requir fa section case threshold function fact borrow field circuit complex theori linear threshold circuit lift result context rnn fa upper bound fold deriv estim lower bound work section reconsid induct infer task artifici gener term languag empir investig learnabl gener capabl fa learn procedur identifi term set belong class pattern languag fa proven possess capabl class linear pattern languag pattern languag class regular tree languag correspond empir result show induct infer task pattern languag solv fa high gener accuraci formul conjectur full comput power fa discuss support argument section close critic view adequaci formal framework comput power fa briefli discuss fa view dynam system perspect fa adequ train knowledg framework subject section proof construct develop section effect inject prior knowledg form tree automata form grammar defin fa readi induct refin inject scheme show robust weight perturb small level output neuron section attempt fit work exist research landscap result concept develop articl fruitfulli lift context recurr neural network model proof techniqu implement fa essenti inspir exist system combin symbol tree learn train feedforward neural network conclud articl summari abstract discuss open question futur direct reflect consequ practic applic fold architectur pattern recognit task preliminari order elimin ambigu facilit detail discuss introduc fix basic concept terminolog paper formal neural network architectur consid design oper term special kind structur domain definit rank rank function finit set variabl set term induct defin symbol hold set symbol rank call pair alphabet rank function denot rank symbol mark subscript term call ground term fix context usag abbrevi term call subterm iff subterm term write proper subterm iff term call subterm term view root label order extern node label variabl constant intern node label function symbol equal ariti label frontier tree defin sequenc extern node built order posit term repres sequenc posit describ path argument posit root outermost root tj denot subterm root posit tree occur iff posit tj substitut map fl extend fl term match term substitut fl function root succ usual mean map node tree label max maximum rank subset synonym call tree term languag forest comput power neural network model constrain type transfer function type function interest binari threshold oe ir oe ir classic sigmoid oe ir oe ir gener sigmoid oe ir lim oe lim oe oe continu ir note oe special case oe oe approxim arbitrarili oe lim construct oe configur conveni index element set assum arbitrari priori fix total order element set function comput index fa tree automata concept tree automata tree appli field comput scienc compil construct gener wilhelm maurer syntact pattern recognit comput comput logic game theori view straight forward gener automata hopcroft ullman inform state transit decid charact read input tupl prior state prior state case finit state type tree automata wai introduc consult common al interest finit tree automata essenti follow formal definit tree finit tree automata rank rank function finit set set final state fffi set relat type ffi set function type ffi speak determinist finit tree automata oper tree acceptor leaf node label input tree assign initi state belong ffi examin path root node successor sequenc state assign successor node label figur input tree process assign state denot squar bracket element domain map ffi imag state map assign process continu imposs assign state node root reach tree accept automaton iff root assign final state observ transit function necessarili defin domain order present formal specif recognit oper introduc undefin state defin ffi tree transit function extend function ffi ffi ffi tree languag recogn set tree accept ft fg serv explan counterexampl section tree fpg fffi ffi ffi ffi figur show automaton accept input tree assign state denot squar bracket accept languag set binari tree number node label act node tree assign state depend pariti henceforth reason simplic maximum rank signatur definit arbitrari transform automaton canon introduc void state fq extend maximum rank ffi ffi extend ffi ffi ffi ffi ffi remark class determinist nondeterminist tree automata recognit power recogniz class languag ident tree automaton process tree start root leav call tree automaton nondeterminist version tree automaton power determinist weaker defin proper recogniz languag case automata type type tree automaton correspond kind tree grammar altern describ recognit power regular tree grammar belong nondeterminist nondeterminist tree automata recogn languag class call regular tree languag restrict maximum rank tree automata reduc finit state automata hopcroft ullman import concept result field tree automata explor correspond neural network introduc demand context section fold architectur neural fold architectur learn procedur design induct infer map structur object real vector space exampl section explain type learn task solv fa present layout gener architectur process approxim gener capabl fa briefli discuss learn task induct learn task intend solv fa defin tupl unknown function type ir domain root label order tree rank alphabet section larg finit set exampl partial describ learn task infer approxim good wrt error unknown function base finit set special case function restrict fc descript induct classif task class label object infer classifi high high probabl correctli classifi randomli select instanc principl idea design neural network architectur solv combin compon encod element suitabl connectionist distribut real vector compon comput task distribut static view gener fold architectur layer static view special scale feedforward network figur layer constitut fold layer layer number transform number unit output layer maximum rank defin maximum rank domain number hidden layer number neuron layer fold transform part predefin dimens layer layer number input layer constitut block unit block equal size architectur neuron type output layer comput output previou oe comput activ neuron oe transfer function popular instanc classic sigmoid function oe oe section oe specifi denot connect layer matrix form individu layer possibl connect call instanc fa fold part transform part unit layer recruit output unit function order comput activ neuron ir denot input bia compon ir weight connect order lead neuron multipl combin input neuron neuron index special case layer yield nm weight connect remark fa view gener type recurr neural network tempor sequenc process gile al set layer fold part layer transform part connect fa instanti simpl recurr network elman configur recurr architectur describ fa notat number unit hidden layer fold transform part compon relev proposit fill anonym underscor charact output input fold part transform part implicit recurr figur gener fold architectur process dynam explicit feedback connect fa recurr process complet driven inher structur object map tree domain rank alphabet maximum rank induc set fix encod function ir map label numer code nil ir special encod empti tree inform spoken fold part tree distribut ir achiev set comput label code root node input layer propag fold part process start leav label code time code empti end tree map transform part yield map input tree defin dynam fold architectur formal fold part view function ir ir transform part function ir ir arbitrari tree ft map ir defin nil nil vector concaten oper final map ir comput fold architectur defin ffi definit map rang transfer function ir potenti rang layer transform part replac layer neuron extend addit carri ident transfer function layer comput affin map ffi function comput origin part transform layer remark transform part fa simpli recruit unit layer defin extract compon result vector deliv map network state defin output layer layer number note model state transit depend current node input tree autonom state transit modu equat essenti differ recurr model model investig arbitrari number autonom state transit input sequenc complet fed output network comput learn procedur develop solv fa common error measur weight space wrt train data map fa good approxim wrt error minim principl suitabl numer optim procedur minim task simpl train algorithm call backpropag structur develop publish refin work detail chapter articl concentr comput capabl fold architectur suffic exist effect learn method detail mathemat applic evalu fa refer schulz al schmitt dynam express equat realiz compat static view fold architectur comput output time node input tree process map constitut fa special map shape tree remain invari frasconi al note process tree fa make differ tree label discret set encod ir directli drawn ir approxim capabl appli fa approxim devic class function approxim assumpt effect learn method hammer proven fa approxim function type ir briefli recal result transfer function oe gener sigmoid oe section constrain exist point oe time continu differenti environ oe ir arbitrari function properti model comput call process probabl measur denot class function implement gener fa equip neuron oe transfer function theorem exist function hold hammer proof construct requir layer unit layer fold part feedforward network transform part maximum rank dimens layer chosen theorem hold radial basi function transfer function threshold function oe approxim accomplish number unit exponenti maximum depth tree finit domain aspect gener capabl learn devic neural network theoret investig sampl complex amount train data achiev level gener accuraci sampl complex close relat regard measur set function case neural defin set function implement architectur exact relationship sampl complex applic concept neural network survei recent work field reader refer anthoni show upper bound fa trivial deriv directli appli result macintyr feedforward extens theorem fold architectur connect constrain discret interpret implement function type classic sigmoid transfer function oe number weight fa size input term receiv fa proof upper virtual unfold section equat fa input tree size recurr architectur simul feedforward network unit resp number unit fold resp transform part origin number programm paramet fold resp transform part macintyr theorem upper bound feedforward architectur assum claim remark deriv upper bound rnn instanti class transfer function result fa similar demonstr proof theorem hammer explor recurr neural network model framework pac learn give lower bound fa singl neuron boolean function smallest build block fa singl unit section util fact transit function rewritten proposit conveni explor comput capabl singl neuron investig boolean function simul type singl neuron result develop enabl establish construct proof proposit correspond fa present connect lemma singl neuron provid connect classic sigmoid transfer function oe simul boolean boolean boolean function ff fi fi nk fi exist fi order simul boolean function neuron equip transfer function continu rang special discret scheme appli idea borrow kubat proof oe continu rang interpret output neuron output neuron high low boolean valu correspond ln due monoton symmetri oe output high activ neuron low neuron receiv input neuron connect ident weight behav boolean iff constraint constraint state neuron high input neuron high low input neuron high low turn constraint equat simul boolean condit constraint postul neuron give high output input neuron high input neuron low neuron input neuron minim low assum neuron receiv input neuron weight connect ff neuron ident weight connect fi boolean function ff fi fi nk simul constraint ff fi ff fi fi ff fi fi fi ff fi fi fi constraint postul neuron high ff set high fi high low neuron low ff set low tune maxim permiss inequ express condit neuron low ff set tune maxim fi liter low constraint ff fi ff fi ff fi turn condit equat comput ff fi condit condit yield ff ff lead ff fi observ proof design obtain tool possess power prove lemma paramet boolean function constrain discret valu set lemma construct permit appli develop discret scheme input output valu comput singl rise lemma lemma logic circuit boolean gate lemma simul network neuron connect transfer function oe proof substitut logic gate neuron maximum found circuit discret variabl set threshold weight recip proof construct lemma result neural network simul logic circuit lemma lemma gener lemma lemma lemma hold substitut oe gener sigmoid function oe proof due asymptot behavior oe exist oe oe appli discret interpret scheme construct prove lemma lemma lemma lemma hold oe substitut threshold function oe proof rang oe boolean function directli implement discret ir arbitrari constant appli gener construct proof lemma set obei constraint satisfi boolean function ff fi fi nk requir ff fi fi ff fi solut ff fi connect section fa configur activ function lemma show enabl simul complex lemma boolean function singl neuron lemma singl neuron equip classic sigmoid transfer function oe activ function fi fi input simul boolean function fi fi fi proof appli discret scheme prove lemma conjunct equat carri number liter weight assum ident neuron simul boolean function constraint constraint express minim activ neuron result high output turn constraint equat order fulfil discret paramet chosen substitut tangent remark lemma hold gener transfer function oe threshold function oe boolean function equat subsum unit connect larger boolean circuit argument appli prove lemma case activ correspond fa intuit tight correspond fa machin process tree leav root comput state output layer fa interpret combin sequenc prior state symbol read input equat equat relat rnn intens studi year kremer gile frasconi al al minski observ gener concept section show result relationship transfer appli explor correspond fa approxim theorem hammer give hint comput power fa relationship theorem fa provid connect classic sigmoid transfer function oe approxim wrt finit set input tree arbitrarili proof view acceptor function theorem section function approxim arbitrarili gener fa construct proof requir layer unit fold part network transform part maximum rank found result support conjectur fa power defin set tree priori limit theorem practic implement concret fa ident behavior show fa power investig relationship fa guid architectur constraint gener fold architectur develop section freedom explor architectur constraint number layer fold transform type activ transfer function influenc relationship construct proof proof posit proposit carri construct manner tool develop section appli give construct scheme implement specif fold architectur analysi complex practic section interest complex altern develop space complex number state size alphabet maximum rank number final state nf jf number explicitli transit nr demand combin state input symbol explicitli transit complex specif neural implement measur number neuron call node complex count input number weight construct conveni discrimin number weight neural network architectur total number weight layer assum fold part begin investig prove architectur oe layer fold unit transform part activ function gener sigmoid transfer function oe suffic simul theorem fa connect gener transfer function simul layer fold part unit transform part proof arbitrari fa tree node successor assign state definit rewrit condit state transit proposit assign state iff ffi map architectur oe construct figur code function label symbol map unit vector compon low lemma proof layer fold part consist jqj unit correspond state ffi put unit layer receiv connect unit label block unit block input layer unit connect unit layer lemma unit layer tune act logic unit layer act logic ariti ffi equat obviou fold part implement state transit function final add singl output unit transform part fa act jf logic receiv input unit layer empti tree state code case transit function partial defin miss connect full connect insert weight undefin state definit equat repres clear equat equat tree map fa high output iff accept tabl summar result space complex analysi fold architectur demonstr proof construct theorem figur figur layout fold architectur layer fold layer transform part simul neuron denot act boolean function fill group semant similar neuron box solid line arrow exemplifi connect insert transit ffi ffi nr neuron nr weight weight nf nr nf tabl complex implement theorem proof construct small modif proof construct theorem show transform part fa superflu elimin output unit transform part connect lead extend layer unit act logic design output network connect unit unit layer belong transit lead final state ffi ffi obviou unit high iff accept tree complex construct tabl differ margin proof theorem describ number transit lead final ffi ffi gj corollari fa connect gener transfer function simul layer fold part transform part requir nr neuron nr weight nr weight nr nr tabl complex implement corollari fold part question layer fold part fa suffic simul answer depend arbitrari state transit function type activ function fa connect condit state transit formul equat immedi identifi boolean function type present equat observ util simul fa activ function layer fold part theorem fa connect gener transfer function simul layer fold part transform part proof arbitrari maximum rank appli construct scheme present proof theorem corollari neuron lemma connect implement equat architectur jqj oe figur symbol encod unit vector fold part consist layer carri jqj state jqj neuron output network transform part state disjunct conjunct express equat model neuron receiv connect order unit input layer condit transit lead final state implement design output neuron manner maximum found network circuit lemma appli neuron activ function order discret paramet set weight connect lemma line argument work proof theorem obviou fa construct yield simul tabl summar resourc consumpt proof construct develop sign insid column complex aspect chang output unit figur sketch layout fold architectur constitut layer fold transform part neuron connect order simul neuron denot connect order fill asterisk link circl sign group semant similar neuron box output neuron mark manner solid line exemplifi implement transit condit lead state repres neuron implement test final state condit dash line lead output unit transit explicitli denot number automaton transit lead final state nr neuron weight weight nr nf nf tabl complex implement proof construct theorem remark space complex implement superior case present corollari time complex recogn tree size fa pictur fold architectur connect requir multipl oper contrast nw multipl oper architectur connect order nw number weight found architectur layer connect implement arbitrari state transit fa layer fold part transform suffic simul arbitrari connect provid question fa connect comput power idea investig automata state transit function fold part consist layer theorem layer fold part fa connect threshold transfer function oe comput arbitrari state transit function statement easili proven appli result relationship rnn proof determinist finit state automata special state comput combin symbol alphabet previou maximum rank al prove singl layer connect threshold transfer function comput arbitrari finit state transit function turn situat chang power transfer function theorem theorem hold monoton gener sigmoid transfer function proof provid explicit state transit function comput singl layer fa connect loss gener resp output layer repres resp pariti state assum input symbol code order comput state transit correctli constraint satisfi threshold integr weight matrix suppli addit input unit constant input denot column correspond label left input block fold part comput linear combin input pass result monoton sigmoid function strip transfer function oe combin condit condit equat lead oe oe oe oe contradict assumpt distinguish state fa consist fold part connect monoton sigmoid transfer function comput arbitrari state transit function remark proof altern formul fact xor function separ neural network consist layer connect approach connect theorem theorem give pessimist view comput power fa connect layer fold part minski al observ finit state automaton implement recurr neural network layer exist ident function behavior realiz argument appli tree automata fold architectur theorem fa layer fold part unit transform part provid gener sigmoid transfer function implement proof techniqu al state automaton plai role singl state origin idea inform direct transit histori step state descript arbitrari fa defin ai ffi ffi rg ig hq fg fffi ffi hq hq special state hq introduc captur fill maximum rank definit construct assur ident function behavior origin tree node successor assign state definit follow scheme proof theorem reformul state transit proposit assign state hq ai iff hq map construct figur encod label symbol map unit vector layer fold part consist jq unit repres state unit correspond state determin term disjunct condit true lemma lemma appli directli translat boolean condit weight connect fa unit repres hq ai receiv connect unit label block block unit repres special state hq state scheme figur empti tree state hq code final add singl output unit transform part fa act jf logic receiv input unit transform layer weight tune lemma lemma discret paramet chosen appli circuit lemma state complet borrow proof construct theorem equat tree map fa high output iff accept jq nr complex fa construct express complex origin tabl number transit lead final ffi ffi gj nr neuron nr weight km km weight text lemma tabl complex implement techniqu theorem case count number weight row tabl requir detail explan equat lead formula number figur sketch layout fa simul layer fold part output unit transform part neuron denot act boolean function fill condit group semant similar neuron box solid line arrow exemplifi connect insert automaton transit function maximum rank dash line case transit rank special state insid weight number case state transit explicit specif nr ffi ffi number connect receiv output neuron connect requir label block input state nr state count special exact number weight implement disjunct condit depend concret distribut transit state number weight case valid upper bound lemma number weight appli implement techniqu construct theorem case transit deriv proof symbol maximum rank state input symbol maximum rank transit distribut target state partit size state denot total number occurr state symbol left side transit ffi rg equat rewritten nr km result upper bound number weight affect includ number valid fill definit maximum rank assum transform part superflu analog fold part construct corollari theorem neg result theorem fa monoton gener sigmoid transfer layer fold part transform part achiev power proof show imposs add special state neuron fold layer comput arbitrari output function tree present automaton state present tree pariti loss assum neuron fold part output vector repres differ transit ffi node assum predecessor state ident neuron case behavior function xor insepar oe proof theorem impli neuron comput desir output function transform modu tree process section chang special output unit ad layer connect unit input layer repres final state automaton tree complet process fold part output layer fed back block input layer input set output network comput output unit high iff tree accept corollari fa monoton gener sigmoid transfer layer fold part transform part achiev power step delai output comput comput power fa threshold case relat word languag previou section simpl instanc fa proven simul arbitrari result show usag threshold transfer function fa limit comput power theorem finit rank alphabet fa threshold transfer function oe output unit oper tree simul fa model finit number state finit number state transit proof simul fffi ffi result state mk state transit fa nondeterminist counterpart nondeterminist tree remark end section term comput power threshold transfer function moder constraint architectur shown previou construct proof present simul fa appli discret sigmoid transfer function cast boolean full potenti power explor fa sigmoid transfer function layer fold layer transform part enabl realiz machin infinit state arbitrari state transit open question fa equip sigmoid transfer function strictli power section describ interest relationship word languag fa conveni introduc function extract word frontier tree definit yield tree defin induct yield tree languag languag lg languag tree recogn theorem fa equip sigmoid transfer function word languag proof result subclass languag inform proof fact deriv tree recogniz yield tree languag languag theorem altern theorem theorem proven fa definit theorem give impress fa threshold transfer function capabl repres devic recogn syntax word practic recogn word bound node complex fa implement section gave construct scheme implement fa constraint econom network implement obtain fa layer fold part term node interest question node complex principl reduc layer fold part estim minim number neuron requir accomplish static fa interpret linear threshold circuit instanti threshold function oe transfer function neuron connect identifi threshold work node complex neural network appli result circuit complex linear threshold circuit alon al horn hush siu al show result easili lift context fa interest deriv upper lower bound node complex fa arbitrari implement line argument essenti borrow investig node complex rnn implement carri horn hush upper bound upper bound node complex deriv ltc fold part enabl implement arbitrari boolean function arbitrari state transit function lemma recal bound node complex ltc implement boolean function lemma arbitrari boolean function form oe implement ltc layer node complex log extens result siu al horn hush fold architectur transform part consist layer output unit theorem alphabet size maximum rank implement dlog node complex iq nm log log log nm proof alphabet size maximum rank implement fa fold part perform map form oe dlog dlog upper bound origin problem reduc node complex boolean function log log log log log lemma obtain ltc node complex log log nm log log log log nm log log discrimin accept automaton state implement transform part node complex lemma perform map type oe dlog assum node complex affect demonstr corollari transform part ad unit layer act design output unit network modif fold part comput boolean function type oe dlog dlog corollari implement architectur type dlog result slight node complex nm log log log log nm direct lower bound upper bound result expect reduc resourc consumpt layer econom state input encod contrast encod appli construct minimum number neuron requir implement arbitrari naiv lead state effect encod dlog neuron follow shown alon al horn hush deriv lower bound node complex rnn implement smallest number state implement fa fewer neuron number diverg log implicitli logarithm base definit fewer state number built fa neuron deriv good upper bound lower bound comput lower bound lemma number alphabet size maximum rank built fa neuron bound xz dlog ne dlog proof horn hush fold part fa constitut lower triangular network network node node layer receiv input node previou layer input feedforward network view special weight set fold part fa interpret function oe dlog ne dlog total number boolean function input output bound maximum number function node multipli maximum number logic function comput number logic function defin vertic unit hypercub implement singl threshold neuron input bound number input layer number input node equat node comput logic function maximum number function node maximum number input network output determin input maximum number input node higher layer receiv greater equat hold justifi total number output node output state variabl remain chosen output state variabl requir yield choic order output maximum number logic function upper bound logarithm side inequ log log ln log log ln simplif summat elimin neg mind side lead log log ln ln assum exist constant cz log lead upper bound xz order find lower bound render meant definit diverg iff exist input tree ffi iff ffi nr nf jf transit function ffi comput number transit function appeal approxim number nf obviou pair diverg estim lower bound node complex fa implement analog rnn case hush calcul alon al base sophist construct automata simultan state transit output gener depend input actual simpli transfer case lemma proof due hammer rough estim number diverg lemma diverg alphabet size maximum rank state proof fa alphabet fq set fq set final state assum defin ffi ffi tree form map automaton ffi tree term ffi map ffi ft fq implement choic ffi diverg tree automata exist readi combin present result statement lower bound node complex fa implement theorem alphabet size maximum rank implement architectur dlog node complex nm log log proof combin lemma equat lemma xz log cy substitut dlog ne dlog remark lemma rough estim number diverg conjectur lower bound node complex fa implement improv number layer fold part fa result node complex section theorem siu al conjectur constraint automaton transit function cover space boolean function greedi encod label construct corollari node complex competit result theorem open question upper bound improv restrict number layer fold sigmoid transfer function lead reduct node complex hypothesi support observ boolean function size implement network reduc logarithm factor continu threshold gate al pattern languag adequaci automata framework fa comput power fa built neuron threshold transfer function situat sigmoid transfer theorem fa comput power strictli power comput power adequ classic formal languag bunch empir investig learnabl artifici gener tree languag induct grammat infer task posit neg carri fa learn procedur schmitt schulz al task intuit estim hard fa solv fairli high gener accuraci section identifi tree languag experi belong class pattern languag show fa capabl recogn interest subclass defin pattern constrain linear nonlinear pattern languag turn power fa perform surprisingli grammat infer task pattern languag phenomenon give evid full comput power fa sigmoid transfer function strictli stronger formul conjectur adequaci formal automata framework comput power fa experi carri fa serv illustr question pattern languag languag boundari induc occurr constraint variabl pattern languag induct infer pattern languag formal concept comput scienc arikawa recent gain grow attent due applic potenti comput biologi al special interest tree term languag induc tree pattern definit rank alphabet finit set variabl term synonym call pattern pattern linear variabl occur defin tree languag pattern occurr condit definit occurr pattern pattern occurr languag induc defin ft exist posit substitut oe tj languag call linear pattern occurr languag defin pattern linear lemma class proper subset class languag recogniz linear pattern tree automata appli compil construct field automat gener pattern match devic rewrit rule describ code optim strategi wilhelm maurer proof wilhelm maurer present simpl construct scheme tree automaton built linear pattern variabl replac variabl variabl match result defin nondeterminist tree automaton ft fffi ffi ng tree transit sequenc transit lead final state match subset construct techniqu appli transform automaton determinist languag recogniz class ol tree pattern capabl induc tree languag oe arbitrari substitut lead contradict pattern languag capabl class linear condit drop lemma class ol recogn proof pattern variabl occur exist map term final state iff due behavior term substitut occurr occurr variabl term gener belong pattern languag map final state map lead obviou contradict fxg set variabl fg rank alphabet defin pattern match belong pattern languag enrich arbitrari boolean combin pattern occurr condit definit occurr finit set pattern boolean combin pattern languag induc defin denot class languag induc arbitrari finit pattern set boolean combin linear fragment defin proper subclass pattern set pattern linear rank set variabl boolean pattern combin theorem class proper subset class languag recogniz fa proof lemma theorem altern theorem theorem show proper subset class languag recogniz turn subset class languag recogniz fa close union intersect line argument proof lemma tree recogn captur boolean occurr condit finit set pattern note result present valid pattern languag defin instanti occurr condit definit case pattern match term root instanc iff oe analog defin languag class instanti special case occurr root impli subset relat languag defin match ae ae ae ae pattern boolean combin ol il ol il tree languag figur venn diagram illustr relat pattern languag size area reflect cardin set subject visual impress ol il constitut frame ol connect lemma rank alphabet consist symbol rank rank greater denot trivial set intersect relat pattern languag class languag class languag correspond machin summar figur il ol ae ae ae ol ae ae ae ae ae il ae ae ol il ol il proof class ol incompar pattern instanti condit gener occurr condit pattern vice versa boolean condit constitut finit set pattern situat due possibl gener logic tautolog trivial set ti class tree theorem pattern languag belong lemma ae ae ol ae ae definit due fact gener match condit boolean combin finit set linear pattern theorem impli ae argument hold instanc condit consequ definit languag class counterpart obtain instanc condit cover languag experi explor learnabl capabl fa schmitt learn task organ induct infer task angluin smith term definit grammat induct grammat infer process learn system attempt identifi finit potenti infinit set call tree base finit set exampl chosen languag complement theorem show fa sigmoid transfer function repres class fa repres pattern languag proven regular tree languag learnabl prerequisit draw empir result task direct introduc languag illustr task accomplish fa setup tabl report characterist term set gener accomplish task fa languag column specifi complex constrain term maximum depth maximum number node set independ term randomli uniform drawn space cardin column subsequ label specif averag depth averag size term data set shown column column give classif perform naiv achiev class label distribut set posit neg exampl posit neg term depth size term space largest class tabl characterist gener term data set symbol bg code map architectur oe stand oe classic sigmoid transfer function tanh ir size layer vari train procedur backpropag structur algorithm form steepest augment automat learn rate adapt weight decai scheme similar train process carri batch modu updat present term train count stop epoch result report obtain stratifi kohavi random distribut weight initi fold yield distinct experi languag architectur train test data set higher term complex order estim gener perform weak recognit criterion term count correctli classifi absolut differ membership output network result tabl show train perform row denot gener accuraci test set characterist tabl obtain fold architectur number unit max max max max train train tabl gener capabl learn task architectur size languag standard deviat maximum recognit perform recognit singl experi list recognit rate larger architectur test term set grow term complex layer size observ larg standard deviat strong sensit network weight initi fa achiev fairli good recognit rate close exist experi train perfect recognit languag squar error close valu report consist test set epoch train test partit effect detect case except larger term complex test set recognit rate perform consist case experi yield rate test set contrast perform observ result remark observ origin fact train sampl remind compar number programm paramet learn system fa consid count programm paramet conjectur consist theoret result sampl complex fa section exact match sampl complex context neural network learn theorem upper bound number weight size input evid plausibl conjectur perform fa case implic conjectur full comput power fa experi simpl task shown previou section regard illustr basic procedur theoret present paper empir result gather appli fa task pattern languag schmitt motiv formul conjectur comput power fa guid theoret research empir investig conjectur state collect evid argument plausibl conjectur fa equip sigmoid transfer function strictli power tree languag fa infinit arithmet empir result show fa perform surprisingli gener accuraci task pattern languag languag regard support proof illustr section experi languag test accuraci finit number tree finit size question case word rnn sigmoid transfer function strictli power answer posit al show simpl rnn implement recogn languag infinit arithmet assum solut analyt deriv analysi dynam state space network comment conjectur rnn architectur view fold architectur type oe bg rank alphabet patholog tree languag class easili proven appli pump lemma regular tree fa recogn paramet input output al origin languag initi state rnn chosen encod empti tree nil process mode fa direct leav root rnn fa simul stack ture machin build fa capabl recogn tree languag conjectur automata classic formal languag theori adequ tool analyz understand behavior comput power analog devic fa exhibit potenti infinit state threshold case exact fa empir experi appli fa sigmoid transfer function learn procedur task tree pattern languag consist show languag belong class term converg speed absolut gener learn remark end result learn process yield implement fa construct scheme present section fa instanc train recogn pattern languag behav recogn mean languag class identifi class classic formal automata framework comput power fa thing difficult node tree domain label vector ir case formal languag framework serv discret approxim complet continu phenomenon sigmoid case automata framework explor principl capabl fa membership tree languag class indic problem solv fa high accuraci automata view benefit inject directli fa proof construct theorem hypothesi space explicitli constrain automata train process section recurr neural network view dynam system perspect casei al elman demonstr simpl recurr network architectur train perform languag predict task discov phenomenon perfectli explain dynam regim interact state space network tune paramet recurr network accomplish languag predict task show dynam network control region state space correspond symbol predict linearli separ al discuss conjectur analyt deriv rnn recogn languag util network state dynam control present symbol trigger increment symbol decrement oper recurr neural network term defin linear point set discret time point constrain strict partial linear appli dynam system point view fa deal time ontolog reconsid adapt descript process dynam fa section equat state system time comput function ir ir constitut fold part extern input case code symbol time output system time determin function ir ir transform part state system depend sequenc prior state contrari rnn concept fa dynam defin order branch past figur concept figur sketch ontolog discret time concept time exhibit dynam rnn branch past induc fa dynam time point denot black arrow illustr relat left time point dynam system point view fruit adequ formal automata analyz behavior architectur fa order appli tool concept dynam system theori question lift dynam remark explicitli address clear question learnabl tree languag harder answer question formul adequ definit problem classic concept comput learn theori learn limit posit neg exampl approxim correct identif model fit continu optim process carri train converg criterion qualiti final solut optim algorithm stuck local absenc local minima converg global minimum trivial case al model select question scale fold architectur number neuron dimens partial answer constraint fa section achiev comput power give rough factor assum priori knowledg class languag present languag learn advanc good heurist estim number neuron requir gile case regular altern rid model select problem construct learn algorithm lead increment growth network current solv problem accur show techniqu extend network model fa special care gile al conserv comput power empir result sketch pictur schmitt task languag solv fa learn fairli high gener accuraci conjectur concept learn capabl fa instanc concept approxim tree bound restrict mean remark combin symbol neural learn previou section fa learn induct acquir automata behavior posit neg exampl languag side solv induct grammat infer task tree languag resp tree automata collect refer found metaphor appli case hypothesi space spread automata instanc languag class mean clever navig space order find hypothesi consist train data approach merit disadvantag framework gener framework identifi order combin strength symbol neural learn roughli outlin constitut inject refin extract symbol knowledg prior applic domain human expert acquir learn ideal notion knowledg necessarili minim perfect solut rough approxim thereof step transform neural network possibl addit freedom ad network architectur network prepar trainabl neural train procedur train data approxim solut ideal train network repres solut initi problem accept network object extract symbol languag prior knowledg spite principl problem framework discuss shavlik research successfulli appli idea empir demonstr combin symbol neural approach yield accuraci individu towel shavlik instanti framework method transform symbol knowledg form proposit horn human expert special feedforward network subsequ train knowledg extract algorithm produc call rule kubat fruitfulli combin symbol tree learn approach refin acquir knowledg network standard neural train procedur similar strategi appli context regular rnn gile frasconi al special measur ensur automaton behavior structur preserv refin neural train shown condit chanc extract state space inform network casei robust inject fa gener combin framework principl applic context fa prior knowledg expert form implicitli form regular tree grammar transform minim induc symbol machin learn approach directli inject fa sigmoid transfer function assum infinit arithmet instanc fa fold appli construct scheme establish section proof construct theorem theorem theorem refin framework sketch section preprocess step carri shavlik kubat connect scheme success layer extend weight regular connect requir construct irregular connect connect weight set slightli perturb small random valu provid suitabl initi subsequ refin numer train algorithm practic implement digit parallel reli finit number arithmet oper investig fa construct scheme section adapt cope irregular connect base noisi neuron model definit neuron output neuron index number activ function classic sigmoid function oe bia output neuron connect regular irregular connect weight ij ae random variabl arbitrari ir output comput oe ij ae repres output activ corrupt ae start neuron basic build block fa lemma show simul boolean gate section singl sigmoid neuron noisi environ definit accomplish restrict amount output weight tune toler priori amount weight ae activ lemma singl neuron provid connect classic sigmoid transfer function oe simul boolean boolean obei addit regular boolean irregular incom connect weight bia perturb activ neuron corrupt ae toler output restrict discret paramet appli map continu output boolean proof appli discret scheme proof lemma oe continu rang interpret output neuron output neuron high ae low ae boolean valu correspond ae ln due monoton symmetri oe output high activ neuron low neuron receiv input neuron connect ident weight perturb irregular connect weight arbitrarili distribut behav boolean iff constraint turn constraint equat solut polynomi order constrain simul boolean condit result solut polynomi order constrain boolean regular irregular connect level ae implement robust calcul proof lemma singl neuron basic build block implement fold architectur theorem fa connect classic sigmoid transfer function oe simul layer fold part unit transform part implement robust model definit level output neuron bound discret paramet proof build plan proof theorem maximum discret paramet ae ir interv insert connect layer fulli connect initi regular link weight threshold set proof lemma lemma inject robust arbitrarili distribut ae activ output neuron remark maass show model slightli definit recurr neural network mild output neuron recogn subclass regular languag demonstr theorem construct inject tune toler small level output neuron proof construct theorem scheme inject arbitrari fa addit irregular link random perturb weight prepar neural network refin phase standard train algorithm appli refin extract phase concept method borrow exist knowledg instanti framework rnn gile frasconi al extract knowledg special measur regular techniqu al explicitli constrain weight space feasibl region al prevent dynam system leav automata hypothesi space retrain section conjectur extract successfulli train recurr network accomplish discret explor state space gile frasconi al avoid combinatori explor process tree domain case good idea navig state space train resp test data small fraction tree domain relat work correspond special recurr neural network architectur tree automata shown layer equip gener neuron threshold transfer function proven power simul determinist tree automaton explicitli referenc approach al explicitli identifi neuron boolean gate construct scheme develop case threshold function case sigmoid transfer function approxim threshold function sigmoid argument suppli gener neuron network special case fold fa layer fold transform part mention result special case theorem proof construct verif substitut sigmoid neuron threshold gate neuron lemma discret scheme lemma proof exact simul fa sigmoid transfer function shown section construct extend inject scheme robust small amount weight output readi subsequ refin recip simul boolean function singl neuron transfer function partial kubat extend adapt section abstract techniqu neuron simul boolean function primit build block complex network architectur found similar context frasconi al towel shavlik investig driven observ fold architectur limit ariti class network sequenc process gile al theorem proof techniqu present section directli lift excel framework develop kremer correspond recurr network architectur formal languag instanc fa correspond tree automata insight recurr network obtain special fa fix ariti proof construct theorem scheme inject recurr network contrari techniqu al network construct requir moder resourc term number neuron weight section consumpt make attract practic applic theorem proof node complex fa implement directli transfer work horn hush set maximum ariti cardin automaton alphabet yield upper bound result recurr network transfer function proof techniqu lower bound due alon al lift construct lower bound number diverg machin case research comput power recurr neural network model found literatur demonstr power process recurr neural network satur linear transfer function construct proof priori fix number neuron provid proof ture case sigmoid transfer function assum process ture hold fa attempt repres learn exampl languag recurr neuron network model da al zeng al studi recurr architectur augment extern stack intern signal control stack oper implicitli includ learn task input repres sequenc fa directli oper structur object structur express repres extern memori storag prior state requir oper train fa section elman train simpl recurr neural network accomplish predict task underli mechan explain dynam system point view idea idea show exampl languag border repres simpl recurr architectur phenomena observ context fa argument empir result present section result report give strong evid languag regular tree languag class repres fa fa effect effici train behav conjectur support comput model relat recurr neural network recent emerg moor present class iter function system case linear map strictli power determinist automata class dynam automata metric member constrain classic automata applic framework shavlik combin symbol neural learn fa essenti inspir work kubat combin tree induct neural learn tree classic machin learn interpret boolean transform disjunct normal form directli transfer feedforward network architectur boolean gate simul sigmoid neuron refin freedom ad weight slightli perturb paper strategi develop robust scheme inject fa section theorem research methodolog point view concept result field sequenc process recurr neural network model fruitfulli transfer structur process fold architectur prove success lift cascad recurr network neural tree structur process frasconi al gave probabilist framework adapt process structur show hidden markov model tempor sequenc process lift fit framework work explor obviou correspond neural fold architectur tree automata investig guid observ model oper comput state combin sequenc prior state symbol read input class recurr neural network model view special case fa constrain maximum rank figur overview import machin model formal languag class mutual relat consid articl correspond regular word languag turn strict subclass class languag relat hopcroft ullman tree automata regular tree languag straight forward gener reg relat determinist tree automata comput power variant counterpart rnn possess comput power relat kremer gile al minski close triangl relat prove fa comput power instanc gener architectur investig tabl activ function layer requir fold part transform part activ function order maximum rank tree simul layer fold part case threshold transfer function relat reduc investig node complex implement fold architectur threshold transfer function upper bound depend number layer fold part tabl lower bound deriv term set extract applic field learn search control function symbol deduct system experi test capabl fa schmitt identifi belong class tree pattern languag pattern occurr languag term pattern rnn reg fa ol figur visual basic relat machin model languag class solid line label number facilit referenc result machin strictli power express denot correspond machin recogniz languag usual strict subset relat interest open question usag sigmoid transfer function assum rnn fa term pattern languag iff pattern occur subterm linear pattern languag defin pattern variabl occur relat express pattern languag enhanc finit boolean combin occurr constraint relat linear pattern languag shown pattern languag chain relat fa capabl linear pattern languag relat proven strict al construct rnn capabl recogn languag infinit arithmet oper languag patholog languag recogniz trivial fa relat strict tree languag empir result show induct infer task pattern languag solv fa high gener accuraci count support conjectur interest open question relationship fa pattern languag ol describ comput power gener architectur analog comput potenti infinit state dynam system point view blair pollack casei moor find answer theoret result present empir result artifici data dlog arbitrari nm iq nm log log log nm log log tabl bound node complex fa activ function threshold transfer oe implement layer fold part complex measur number state size alphabet maximum rank fa neuron weight weight tabl comparison tree automata inject scheme term space complex fold architectur differenti type activ function number layer requir fold transform part resourc consumpt inject number automata state size alphabet maximum rank measur number neuron number weight requir fold architectur case complet specif nm automata transit shown sixth column count number connect weight full connect assum column give practic hint applic fa induct infer task fa train algorithm candid scenario object adequ repres root label order size fix train data structur concept captur order solv task unknown concept belong regular tree languag repres fa design altern layout give minimum term layer fold transform instanc construct proof give effect knowledg inject scheme tabl made robust weight perturb toler small level output neuron boolean combin pattern occurr languag formal describ knowledg partial pattern recognit domain fa practic advantag framework evalu solid experi correspond establish fold architectur tree automata show connectionist model capabl perform oper properti postul school cognit scienc adequ model describ cognit task carri human brain fodor van gelder sharkei fa biolog realiti acknowledg research partial support german research commun grant pa paolo christoph marco barbara stefan marco gunther alessandro ah chung excit fruit discuss topic report refer ak effici simul finit automata neural net journal april algebra framework repres finit state machin recurr neural network neural dana angluin carl smith induct theori method acm comput septemb martin anthoni probabilist analysi learn artifici neural pac model variant neural comput takeshi machin discoveri amino acid sequenc tree regular pattern gener anna maria quantit relationship cascad correl ieee intern joint confer neural alan blair jordan pollack analysi dynam recogn neural stefan die und der master fur universitat german mike casei dynam applic recurr neural network finit state machin extract neural hubert max deni sophi marc tree automata techniqu applic ongo book laboratoir dinformatiqu de cl gz sun prior knowledg learn languag stephen jose jack cowan lee advanc neural inform process volum page morgan san john tree acceptor applic scienc comput octob jl elman find structur time cognit jerri fodor cognit critic analysi jq logo recognit neural network iapr workshop graphic recognit page soda recurr neural network prior knowledg sequenc constrain nondeterminist approach paolo marco marco giovanni soda finit state automata recurr radial basi function network machin paolo marco alessandro gener framework adapt process data structur technic report degli studi di dipartimento di sistemi april paolo marco alessandro effici classif data structur neural network fifteenth intern joint confer artifici intellig ferenc magnu tree automata ferenc magnu tree languag rozenberg handbook formal volum page cl gz hh yc mw construct learn recurr neural limit recurr cascad correl simpl solut ieee transact neural cl gm rj editor special issu dynam recurr neural volum ieee transact neural network gold languag identif limit inform christoph connectionist approach learn heurist autom deduct system phd technic faculti comput submit christoph andrea learn distribut backpropag structur ieee intern confer neural network page ac rl editor special issu recurr neural network sequenc volum neurocomput june mw cl st chen singl layer recurr neural network ieee transact neural barbara hammer approxim map structur object fold architectur technic report universitat fachbereich barbara hammer learn data intract technic report universitat fachbereich barbara hammer note number diverg tree april person commun barbara hammer volker neural network approxim map structur object intern confer comput intellig neurosci research triangl march steffen lehmann design case studi dynam activ landscap recurr network gerhard advanc artifici lectur note comput scienc page springer hopcroft jd ullman introduct automata comput bill horn don hush node complex neural network neural bill horn don hush bound complex recurr neural network implement finit state machin neural kubat initi neural network mean tree marek macintyr polynomi bound vc dimens sigmoid gener neural network journal comput system februari joe dynam sigmoid neural network inform timo induct infer regular string tree languag phd comput research report ron kohavi studi bootstrap accuraci estim model select intern joint confer artifici intellig page pascal dimens recurr neural network european confer comput learn volum lectur note comput scienc chapter john explor comput capabl recurr neural network phd ohio state stefan charl kremer comput power recurr network ieee transact neural stefan charl kremer theori grammat induct connectionist paradigm phd depart comput andrea christoph induct learn symbol domain recurr neural network gunther steffen advanc artifici lectur note comput scienc page springer circuit threshold element soviet physic wolfgang maass dimens neural net technic report seri institut theoret comput technisch universit wolfgang maass analog neural net gaussian common distribut recogn arbitrari regular languag submit laurent structur method pattern recognit north oxford minski finit infinit chapter englewood christoph moor dynam languag recognit analog comput theoret comput threshold logic applic sharkei systemat gener composit connectionist neural network artifici page thomson comput cw cl gile construct determinist automata recurr neural network journal cw cl gile extract rule recurr neural network neural jordan pollack induct dynam recogn machin martin learn perceptron backpropag adapt learn techniqu intl journal comput standard special issu artifici neural network robert pattern structur neural approach john wilei thorsten schmitt evalu neural fold architectur learn task logic term chemic structur master technic faculti comput thorsten schmitt christoph relat chemic structur applic neural fold architectur intern stephan andrea christoph experi applic fold architectur network guid theorem prove dd proc flair page florida ai research shavlik combin symbol neural learn machin takeshi arikawa pattern infer klau jantk steffen algorithm learn volum lectur note artifici intellig page lee gile complex languag recognit neural network comput power neural net journal comput system thoma tradeoff neural comput ieee transact decemb thoma discret neural comput theoret foundat inform system scienc seri prentic alessandro neural network classif structur workshop note workshop neural network structur page alessandro comput power recurr neural network structur neural april mark peter recurr network perform predict task technic report seri februari magnu tree languag problem pattern recognit theori intern confer fundament comput volum lectur note comput scienc page whitnei metric relat analog submit peter fix point discret time recurr stabil bifurc technic report peter bill lee finit state machin recurr neural network automata dynam system approach je tempor dynam pattern special progress neural network ablex publish peter learn extract initi automata modular neural network model neural towel shavlik extract refin rule knowledg base neural network machin lesli valiant theori learnabl commun novemb tim van gelder connectionist variat classic theme cognit janet jeff elman learn count case studi dynam activ landscap recurr network seventeenth annual confer cognit scienc reinhard wilhelm dieter maurer compil chapter pattern match page zheng rodnei smyth discret recurr neural network grammat infer ieee transact neural march
DB/207 3 comput herbrand model robert technisch universitat wien institut fur fur system abstract feasibl model formula interest field autom model autom deduct repres herbrand model symbol repres true ground atom model mechan repres set candid model interest express algorithm issu avail ground atom test evalu give survei recent work topic focu tree automata suitabl devic model devic notat logic show evalu describ improv algorithm evalu avoid explicit determin automaton sketch benefit practic situat introduct import feasibl model logic formula wide acknowledg recent interest topic field model subfield autom theorem prove attempt design algorithm find model satisfi logic formula model formula counterexampl model substanti find reason failur proof refut field comput scienc share interest feasibl model autom deduct guid proof search semant model deduct logic consid worthwhil investig mechan repres interpret logic formula symbol aim accompani ongo work field theoret point view make restrict herbrand model skolem formula justifi practic viewpoint util intuit requir herbrand model domain interpret function symbol fix intuit exist herbrand model satisfi formula describ herbrand model fix signatur find method potenti infinit set true ground set work support austrian scienc foundat grant term reveal interest aspect lead investig properti term syntact properti set call symbol model model requir algorithm ground atom test answer question ground atom true check repres evalu true evolv autom model build develop independ formal languag automata candid model algorithm formal model wide investig focu tree automata algorithm section give survei recent work survei model mechan studi repres herbrand model briefli promin regular tree automata tree automata enjoi lot desir properti close boolean basic problem ground atom test test evalu section correspond finit model yield clear semant model tree automata theorem note tree automata compact finit situat model definit properti close world prefer explicit finit model natur relat automaton finit model tree automata logic program set term produc grammar minim herbrand model logic program atom atom finit set arbitrari atom repres herbrand model definit ground atom true iff instanc atom evalu algorithm atom investig test evalu atom close union negat linear exist model build algorithm output atom set class algorithm outcom atom linear linear atom strictli express tree automata arbitrari atom incompar tree automata repres model formula finit finit model repres ground atom ground equat consist finit ground atom finit ground equat repres requir term model variabl occur atom brand model defin ground atom true iff rewritten ground atom equat express shown tree canon ground rewrit system build equat system rewritten determinist term grammar essenti congruenc class normal occur subterm system trap symbol nontermin correspond domain member finit idea develop earlier show finit ground instanc evalu algorithm correspond naiv method section note inher addit fp fp fp fp fp fp obtain join equat constraint model build perform constrain pair ordinari formula equat term solv transform suitabl normal form solv ground atom test model set constrain atom check evalu transform constraint solv problem solv constraint gener complex constraint context easier constrain atom set express infinit express finit constrain atom incompar tree automata equat regular constraint constraint enhanc atom regular languag regular languag destroi solvabl repres model set constrain strictli power tree automata price complex algorithm calculu model construct actual search model remain difficult automata constraint equat constraint directli tree automaton restrict applic product equat posit produc term undecid gener constrain tree exist restrict admiss constraint decid strong connect exist sort theori investig suitabl model avail algorithm broadli investig term schemat recurr term offer power repres infinit set term control number term set fp repres term schemat design extend notion singl term autom theorem prove util exist unif atom check evalu base close boolean oper altern decid indetermin choic product typic regular tree automata capabl repres infinit finit incompar tree automata solut found interpret free term algebra signatur evalu algorithm regular tree automata introduct problem statement rest articl focu regular tree automata true ground atom set herbrand interpret denot grammar fix signatur hd denot set term signatur herbrand grammar set constant symbol function symbol symbol set predic symbol signatur nontermin set addit nontermin symbol set product omit notat start symbol write index languag denot languag deriv start symbol restrict flat term grammar grammar product form constant form function symbol ariti nontermin note lose subset hd gener flat term grammar result simpli defin herbrand interpret state ground atom interpret true iff call herbrand interpret regular interpret regular iff defin grammar recal flat term grammar translat determinist fact regular tree languag close intersect complement enabl show theorem regular model skolem monad formula arbitrari function finit model finit model regular model corollari finit model skolem formula arbitrari function set true ground atom languag tree formula finit model iff regular find detail proof basic algorithm complex tree automata satisfi requir model atom test syntax check respect term solv linear time wrt length atom polynomi time wrt length grammar check shown didact reason formula monad predic symbol function symbol arbitrari note loss formula translat tn function symbol predic model trivial translat origin formula commonli call regular tree grammar obviou identif string tree page notat regular tree automata gener arbitrari grammar languag gener gener term model kind model function symbol combin qn nontermin exist product grammar recal exponenti nontermin determinist grammar decid knowledg tree automata theori problem finit model yield evalu procedur enabl construct finit model evalu instanc call unsatisfi method exponenti grammar nontermin finit domain member expect gener avoid exponenti theorem problem evalu regular interpret flat term assum nontermin grammar due proof theorem base construct regular tree compar theorem page finit model domain size construct effect assum variabl check combin finit domain element evalu true intersect problem regular tree languag gener tree term grammar theorem page detail proof found renam nontermin grammar share nontermin assum start symbol union iff true model languag intersect problem reduc evalu regular model worth note exptim hard hold determinist tree automata determinist tree automata algorithm evalu avoid explicit determin construct finit model grammar advantag grammar produc languag grammar produc found union possibl renam size sum determinist grammar product grammar size multipli build grammar fp obviou grammar fp clever evalu algorithm grammar imposs determin section rewrit languag evalu set directli grammar present method util connect syntact properti interpret truth formula rewrit truth boolean express languag problem lip express pn regular tree languag lq true depend grammar translat set resolut refin decid grammar share nontermin union grammar defin union termin nontermin symbol rule determin mean product function symbol nontermin true wrt regular interpret iff boolean express yield true truth valu lip herbrand interpret fp interpret fp rest assum evalu interpret grammar rule correspond fact rewrit rule left obtain evalu true iff hd enhanc grammar rule hd check lq note length boolean express exponenti larger length input procedur decid lip true wrt grammar rule grammar expand lip boolean express lip call lip write exp nl refer express rang lip nl continu grammar previou expand lq fag fag lq true lq split languag grammar languag step step downward term detail note exponenti long size exponenti lip evalu idea yield obviou evalu lip expand appli algorithm lip find truth calcul result truth boolean express stop term depth note read lip true term term depth denot iff true term term depth lemma lip number nontermin jp nj true suffic maxim depth exist term term depth standard mean construct determinist complet grammar grammar nontermin subset transform lip pn lq express pn denot complement lq wrt hd true iff languag deriv nontermin empti regular languag defin flat term grammar nontermin empti iff doesnt term term depth corollari page lemma induct hypothesi observ read evalu procedur induct term prove lip true prove true easili denot languag consist term member lp argument constant term depth evalu part concern constant prove lip induct hypothesi attach induct procedur run resembl lip proven induct lip trivial induct hypothesi set consid proven induct hypothesi set attach lip strictli grow lip criterion termin algorithm continu write la lb check la lb induct check lq evalu lq fag fag lq fl lq true true true true procedur termin base induct hypothesi criteria present algorithm lip possibl exponenti lip evalu exponenti depth doubl exponenti call question incorpor idea algorithm exptim evalu lip depth obviou enhanc procedur work set lip evalu lip set lip collect lip evalu calcul truth valu lip result term depth argument termin induct hypothesi argument lip call level correspond branch tree induct induct hypothesi set wrong common induct throw rest lose induct algorithm termin depth bound build procedur eval idea negat exp lip lip stop final add set lip prove set question lip bodi eval subset set lip suffic step lip set stabl set lip exp vector function vector truth valu lip sequenc exp doesnt truth jlj step reach stabl set term procedur mean jlj depth step suffici correct procedur eval work pair consist lip set induct hypothesi lip procedur input set set yield set lip fl lg ae denot result eval truth lip wrt ae proc eval set pair lip induct hypothesi lip lp lq trivial subsum lip lp lq write set lip write lip occur part improv idea gener detect trace dont exhibit return true lip split exp exp exp return return true occur lg ni join induct hypothesi set lip set ae eval return exp nl fi end call eval find true correct argument mention termin strictli counter eval call input data structur exce exponenti eval exptim combin rewrit boolean express lip sketch section evalu algorithm regular interpret final note unmodifi algorithm capabl evalu set continu grammar check lq rememb lq lq call eval lq nontermin bodi lq lq fl lq set stabl call eval lq fl lq immedi return true check true benefit algorithm significantli outperform naiv method practic situat import benefit grammar union grammar lip part grammar evalu part grammar absent continu assum evalu grammar nontermin symbol algorithm behav lip call level naiv method deal magnitud note prior check grammar algorithm visit part grammar benefit situat grammar strictli part coupl benefit grammar evalu spawn fewer lip possibl occur induct make find enabl prove lip induct hypothesi argument stabl input detect observ presenc grammar nontermin occur term make induct hypothesi found close lip proof path final observ lip algorithm termin quickli exp check futur work survei mechan repres term set capabl repres true ground atom set herbrand model algorithm complex basic model problem atom close investig tree automata model show evalu problem present enhanc evalu algorithm avoid explicit determin automaton indetermin outperform simpl method determin automaton situat futur plan attempt carri approach tree automata constraint develop evalu algorithm model refer method build model automat experi extens alan intern confer autom page june springer lnai sophi equal constraint direct subterm tree automata proc annual symposium theoret aspect comput volum page springer max encompass properti automata constraint proc volum page june max automata reduct properti solv accept public hubert comon equat formula membership constraint inform august tree automata techniqu applic preliminari version kong finit infinit sequenc term kaplan intern workshop condit type rewrit volum page june springer comon equat problem journal symbol comon unif term integ expon mathemat system procedur model build techniqu comput scienc logic int workshop page springer verlag lnc method simultan search refut model equat constraint solv journal symbol june model build resolut comput scienc logic page san springer verlag lnc autom model build logic procedur model build equat logic hermann unif infinit set term schemat primal grammar theoret comput april gottlob problem herbrand interpret unpublish gottlob compact knowledg ar model tree automata de knuth parenthesi languag inform compar comput herbrand model comput logic proof kurt godel volum page springer comput herbrand model grammar dv comput scienc intern volum page springer context free term set regular applic logic technic report tu grammar finit domain evalu maria ulrich int workshop theorem prove report seri page johann linz ma jk editor autom deduct intern confer autom volum juli capabl model build constraint solv term integ expon journal symbol techniqu pour la construct de ou en deduct automatiqu phd institut nation polytechniqu de tree automata autom model build fundamenta algorithm atom herbrand model present algorithm atom herbrand model technic report technisch universitat unif infinit set term applic logic program autom st volum lectur note comput scienc art finder domain note guid technic report nation autom reason resolut decid solvabl class build finit model baltic comput page springer lnc simultan rigid phd comput scienc uppsala improv lower bound elementari theori tree page unif sort theori decid page sort unif tree automata ph autom basi volum chapter
DB/208 3 vol integr spatial inform imag analysi make ten michael hahn institut swiss feder institut faculti survei stuttgart appli work group ic kei imag data data abstract photogrammetri remot proven effici spatial data collect wai interact map digit workstat perform skill excel qualiti geometr data worldwid acquisit larg number nation gi support lot product effort devot task field imag evid algorithm scene interpret reconstruct topograph reli singl data function effici research direct success larg sensor data rang data laser sar aerial imag achiev robust perform imag analysi gi layer topograph consid virtual sensor data geometr inform explicitli semant imag analysi aim supplement miss extract dimens expect import updat exist gi paper intend give overview topic relat term refer ic wg imag analysi refer activ ca member activ group recapitul develop field previou congress overview scientif activ field fragment heterogen field clear overview develop underli unifi theori miss concentr topic activ gi data model support imag analysi match imag featur gi object chang detect imag analysi techniqu extract height inform topic import compon integr algorithm partial result object recognit reconstruct data focu sensor data conjunct gi analysi data aim aspect imag analysi reconstruct identif paper present research activ method approach problem face priori knowledg exploit imag analysi underlin prerequisit inform fusion conceptu aspect develop introduct explan term imag analysi word relat integr remot gi mention definit work group term mean compon put compon lead result result achiev integr definit integr similar definit fusion work fusion understand restrict integr gi broad repres digit integr imag analysi gi gi provid imag analysi algorithm priori restrict search space constraint imag analysi process method gi data raster data buffer corridor mathemat vol imag retriev case imag analysi gi fulli gi inform guid imag extract complet accur turn updat gi case challeng interest author involv work group imag analysi establish fact show import topic scientif commun term refer wg gi data model support imag match imag featur gi object chang detect reconcili object model imag analysi investig develop techniqu multisensor data imag analysi techniqu extract height inform integr imag analysi techniqu gi analysi spatial treatment scale tempor differ gi imag deriv data includ tor increasingli attract attent integr algorithm partial result object recognit reconstruct major activ wg member primarili topic topic treat extens paper overview comparison method pohl hill al focu paper topic concentr aerial sensor identif reconstruct topograph object autom method result overview survei questionnair wg member collect inform research interest refer receiv inform append search author present work similar relat topic perform addit wg inform wg found special interest group wg wg automat absolut orient inform data fusion ieee remot societi show develop continu fragment heterogen field applic clear overview develop underli unifi theori miss expect interest peopl involv product high major applic address fusion spectral data improv visual interpret militari reconnaiss pohl fusion optic imag sar hybrid product deriv automat imag segment object extract gener citi model janssen de al huang koch integr imag map data gi forest inform gi automat train area select verif result agricultur normal imag gi updat topograph themat map newton aa de walter updat manual step autom nation map perform vol detect automat imag orient relat topic automat registr imag map model grow eli di registr imag previou relat chang context militari mueller imag analysi automat interpret map imag analysi data imag retriev queri match map vector dataset term combin road vector dataset good geometri poor geometri rich attribut imag analysi extend exist spatial zhang combin cue object recognit reconstruct sensor form dsm deriv imageri laser morpholog differenti geometr slope aspect baumgartn hahn applic increasingli approach rare long list encount respect data inform differ lack procedur interpret qualiti control fuse imag fusion mix pixel problem distort spectral properti fusion techniqu avoid level data qualiti geometr accuraci themat detail larg differ fusion data chang detect differ data spatial spectral resolut width angular view data map gi data level data abstract model object imag analysi limit number gener gener model weak broad data object object class road data structur object lack accuraci indic compon fuse data acquir analyst algorithm fuse inform intellig abrupt human permit algorithm roof ridg probabl updat accumul process data differ spatial build europ differ develop time build differ architectur system process requir commerci system support tool limit gap research practic typic matur scientif gi data model imag analysi gi data gener object model gener provid inform tempor target object inform relat target gi inform imag analysi provis initi approxim unknown paramet reduct search space probabl success vol provis clue target object base inform relat target exist inform road network detect build qualiti control serv classif automat select train automat assign detect inform class themat class provid cue inform stage object recognit find build extract blob dsm exclud wrong detect exclud region imposs target build road water surfac data support hypothesi gener infer roof type base build outlin gi inform fourth start inform integr imag analysi gi lead full autom human interact import point interact occur interact prevent guidanc correct case occur begin end approach depend qualiti effici process result interact prevent approach prefer human defin framework solut analysi definit strategi select build block knowledg process method interact block definit process flow exampl approach incorpor priori knowledg object extract build al brenner road van al de al de grow zhang gener object urban scene site hwang janssen al al chellappa al al sti huang jensen koch al al zhang walter walter grow kunz al al priori knowledg registr determin exterior orient imag pedersen prerequisit inform fusion fuse integr prerequisit compon respect spatial refer area coordin spectral correct due terrain sensor resolut number bit spatial prerequisit overview method method append increasingli direct sensor data integr gp depend applic level respect aspect imag fusion high resolut sar imageri incompat integr object cue imag feasibl desir appli tempor object extract multipl data object object properti vari map updat chang detect applic requir opposit note perform respect relat imag mathemat relat transform abstract level prerequisit direct comparison compar road road inform imag clear object definit practic depend definit made data produc vari depend applic countri terrain inform bridg consid part germani switzerland project eth zurich updat road network definit road vol necessarili middl line stripe includ line dedic bicycl corridor widen road intersect addit lane turn left gener includ definit road width case metadata qualiti indic inform data gener data deliv small size high import weak data manag lack system qualiti indic decid combin weigh compon inform global measur map singl rm error classif accuraci percentag class individu class area success accuraci indic data unit node class object classif map theori tool evalu fusion multipl partial result remark complet accuraci data combin differ gi data expect abstract differ data begin road intersect imageri vector inform road detect imag chip intersect similar imageri easier detect imag process deep knowledg advantag disadvantag order select applic imag analysi compon architectur assum gener descript scene aim scene consist object object attribut word treat term structur denot combin featur object combin edg segment lead structur combin build structur attribut object tempor describ raw measur measur refer system grid cell provid inform limit properti explicitli high concentr light imageri indic urban area relat object featur exist model appropri exploit priori inform exist form rule soft model roof knowledg priori inform encod constraint relat featur object scene assumpt rang sensor imag terrain illumin reflect model import compon imag analysi system knowledg model system architectur control blackboard strategi solv problem critic answer knowledg process unit process flow partial result human interact model data fusion theori approach model imag analysi system architectur good bit gonzalez major approach bayesian approach mathemat kalman robust belief theori frame vol system mckeown product system al blackboard system fuzzi logic possibl theori semant net koch grow common approach system semant bayesian net possibl theori fuzzi logic increasingli semant flexibl extend complet model grow nice includ extens analysi critic express network specif applic theoret conceptu suitabl implement commerci system product practic independ approach system provid limit intellig respect object recognit compar human major difficulti transfer knowledg comput encod human process highli nonlinear singl indic lead chang opinion radic vote option small weight point comput lack abil base hard number logic combin inform solv lack learn capabl comput weak final opinion lack memori comput process individu task comput start accumul knowledg year develop imag analysi connect relat data knowledg base total integr imag analysi gi provid benefit data storag manag system integr gi compon import point major model period inform increasingli weakli integr imag analysi aerial satellit imageri qualiti indic reliabl qualiti indic partial result provid local redund data fusion mention process exploit complementar data correct statement data combin provid redund improv accuraci reliabl account lack algorithm intellig mention reliabl lack reliabl result crucial hinder effici autom procedur extens test publish refer limit care tune algorithm paramet order good result dataset cooper industri provid framework object comparison method feedback possibl improv strategi input data system architectur strategi account object type case architectur control imag analysi system flexibl adjust qualiti algorithm qualiti individu process algorithm edg match import factor achiev high qualiti make differ chosen select input data preprocess aspect make huge differ perform develop sophist algorithm poor input data cost lot bring suitabl permit easier detect target object discrimin lead improv simpler process algorithm fact number sensor exploit vol direct criteria data select serv separ target provis data complementar correl data model account import data structur mention system activ continu memori accumul knowledg data store manag data structur provid commerci system data structur includ heterogen multivari data attribut support flexibl data includ tempor model paradigm method object build data structur qualiti control final result feedback qualiti control natur essenti analysi size occur occur result deriv statist data extract object accumul futur similar process establish prior probabl object characterist photogrammetri remot acknowledg disciplin gi data collect true opposit direct gi data gain import imag analysi photogrammetri remot led exchang employ algorithm field algorithm complementari fusion algorithm gener inform fusion begin inform multisensor imag map knowledg integr gi gi plai role gener model analysi tool decid futur develop experi gain base current data integr system develop tailor specif success manag fact inform sensor underlin import develop tool practic system integr fusion combin input data knowledg sourc expect process outcom simpl addit result separ text titl make refer forest map combin laser gi data proc int rem sen conf pp data fusion robot machin intellig academ intellig retriev digit imag larg geospati vol part pp interact extens map data mono imag vol part pp autom reconstruct integr cue object space vol part pp semant context road extract semant model acquisit topograph inform imag pp road model base cartograph aerial imag interpret semant model acquisit topograph inform imag pp classif complex rural area statist approach pp vol monitor aerial imag proc darpa workshop imag pp data object recognit vol part pp bayesian applic inform aggreg imag data mine vol part pp de interpret aerial imag updat road map phd delft univ faculti netherland vol pp integr satellit gi data larg scale sampl base forest inventori classic sampl base approach expert meet data fusion techniqu univ dept rs pp bayesian infer royal statist soc seri vol pp autom procedur integr satellit imag map data chang project vol part pp automat registr imag map polygon featur vol part pp extract polygon featur satellit imag automat project automat extract object aerial space imag ep pp autom procedur multisensor registr satellit imag vol part pp exterior orient automat approach base fit analyt landmark model journal photogrammetri remot pp possibl theori plenum york autom veget map digit pp updat cartograph model spot imag interpret proc vol pp autom reconstruct topograph object aerial imag vector map inform vol proc di imag registr proc vol pp approach automat interpret topograph map vol part pp integr high resolut imageri data urban analysi applic vol part la pp multiresolut analysi wavelet transform merg spot imag data pp tool overlai digit imageri vol part pp knowledg base interpret multisensor remot imag vol part pp knowledg base approach automat imag registr intern confer imag process santa octob brenner urban gi laser map data vol part pp brenner extract build tree urban environ rem pp automat classif urban environ color aerial imageri vol part pp vol scene label strategi terrain featur extract data vol part pp comput vision system interpret scene comput vision ar hanson em academ york analysi imag structur color attribut similar relat phd report institut eth zurich ad mason project current statu futur work vol part pp integr vector data satellit imageri vol part pp local correl approach fusion remot data spatial resolut applic vol part pp automat orient aerial imag mean exist height data vol part pp automat orient aerial imag inform offici public pp strategi method fusion digit elev model optic sar data vol part pp approach autom build remot imag analysi gi data pp model registr valid automat extract object aerial space pp detect identifi topograph object imag laser data vol part pp van der integr topograph data remot classif pp automat ground point extract satellit scene workshop produc automat detect road data base satellit imageri vol part pp knowledg base interpret aerial imag map digit landscap model partial interpret semant model acquisit topograph inform imag pp investig synergi effect satellit imageri digit topograph integr knowledg process vol part pp wirefram model ground control point automat exterior orient vol part pp spatial constrain build extract edg find model fit vol part pp build detect fuse dem digit map vol part pp system knowledg base remot data proc int rem sen conf pp cooper aerial imag map interpret urban scene automat extract object aerial space pp rule base interpret aerial imageri ieee pp vol automat knowledg acquisit aerial imag interpret proc vol pp morgan multisensor object recognit model proc vol pp markov random field graph uncertainti manag symbol data fusion urban scene interpret proc vol pp automat match model imageri automat extract object aerial space pp structur analysi complex aerial photograph plenum york approach autom identif forest forest chang remot imag vol part pp reliabl reconstruct build digit map vol proc knowledg base interpret hybrid system imag analysi vol part germani autom exterior orient imageri map data proc vol pp gener target templat digit map automat orient aerial photograph proc joint pp automat updat isra nation gi phase ii vol part pp snow cover monitor swiss alp vol part pp semiautomat street object vol part pp zur auf der basi von week hobbi pp geometr aspect multisensor imag fusion topograph map updat humid itc netherland tool method fusion imag spatial resolut vol part pp oper applic imag fusion vol part pp road extract satellit imag vector refer data vol part pp structur approach aerial imag understand automat extract object aerial space imag ep pp interpret phd deutsch semant model extract object aerial imag automat extract object aerial space pp colour aerial imag segment bayesian homogen predic map knowledg vol part pp multisensor remot data vol part pp autom approach train data select integr gi remot environ monitor tempor vol part pp vol automat registr spot imag map proc ieee conf imag vol pp automat digit terrain gener aerial imag map vol part pp descript urban area map aerial imag automat extract object aerial space imag ep pp approach extract area automat extract made object aerial space imag ep pp definit featur imag registr gi data vol part pp mathemat theori evid princeton univ jersei fusion satellit imag gi data classif proc scandinavian confer imag classif remot fusion tm sar imag ieee transact remot pp markov random field model classif satellit imageri ieee transact remot pp adapt fusion raster data appli filter techniqu vol part pp structur analysi aerial imag journal photogrammetri remot pp semant model object product net automat extract object aerial space imag pp build reconstruct view context knowledg vol part pp automat reconstruct roof map elev data vol part pp scene reconstruct research automat system automat extract object aerial space imag ep pp context control comput vision algorithm automat extract object aerial space pp reconstruct object aerial imag gi vol part pp knowledg base road extract multisensor imageri vol part pp knowledg base interpret remot imag semant net pp van delin road structur satellit imageri techniqu pp autom imag basi linear featur recognit subsequ data fusion proc conf fusion earth ecol de mine de sophia pp de updat road map contextu reason automat extract made object aerial space imag ep pp definit term refer data fusion vol part pp vol fusion satellit imag spatial assess qualiti result imag pp automat classif remot data gi vol part pp autom gi data collect updat week pp automat verif gi data high resolut data vol part pp fuzzi set applic john wilei york zhang imag analysi edg extract road reconstruct proc juli vol proc detect urban develop multisensor satellit data map vol part pp techniqu merg imag reveal spectral variat proc pp
IR/209 5 quest queri special collect web martin christian johann wolfgang frankfurt depart comput scienc germani abstract ensur access special fast evolv web environ requir flexibl techniqu orient queri adopt meta search techniqu hinder enorm heterogen resourc paper introduc quest system queri special collect web focu quest unifi search field collect relat search concept identifi relev collect user strategi core introduc describ field fill automat compon final prototyp quest demonstr integr techniqu architectur introduct enorm growth web improv web technolog strong trend put content web dynam page fact larg number document store content emit dynam creat page obviou site offer custom content demand part web creat dynam refer hidden web web nich inform high qualiti make resourc effici necess futur digit librari offer singl search interfac start page addit fulltext content rare provid difficult gather inform page automat standard search engin crawler altavista spider dont find inform creat index web resourc rank inadequ compani lyco big hub direct search offer catalogu special collect web classifi manual hierarchi topic lyco big hub direct search conveni access collect connect singl search appli common meta search techniqu singl search interfac provid multipl heterogen search engin meta search system send user queri search combin result present integr user implement meta search engin hinder enorm heterogen underli collect differ search qualiti size criteria sketch consid futur meta search engin heterogen practic integr larg number collect concern search search field collect map unifi search concept map preserv semant search field instanc internet movi search field refer call involv creation call individu portrai select broadcast queri underli collect result larg time high demand net resourc queri rout select collect describ identifi collect strongli depend qualiti inform collect inform properti collect gather store scheme power combin characterist collect simpl enhanc accept improv access heterogen inform sourc activ area research academ system mediat approach ariadn tsimmi inform manifold popular exampl commerci meta search engin metacrawl section address offer practic solut section prove feasibl introduc architectur meta search engin special heterogen collect unifi search concept search interfac special offer individu search option facilit access document addit collect permit specif search concept limit search concept typic exampl search concept import requir imdb metacrawl design meta search engin special web collect preserv abil search individu search concept meta search engin interfac handl syntact semant concept achiev map individu concept unifi concept scheme semant search concept differ obviou concept organ hierarch simplest case hierarch taxonomi appli model reli assumpt concept fulli concept concept fulli figur present excerpt taxonomi search concept special collect top gener concept gener concept deriv taxonomi identifi subconcept search concept concept support underli queri meta search engin thing locat abstract content keyword titl tangibl person charact creator actor author fig concept taxonomi queri queri imdb map map obviou simplif instanc creator person institut group person test shown concept taxonomi suffici task queri web collect spite chosen tool specif complex relat concept case decid descript formal logic princip object structur term describ individu object domain suit futur exist applic descript logic present retriev task support domain knowledg implement descript logic concept assign atom concept evalu classic specif object relat higher complex select queri rout gener meta search engin broadcast queri underli strategi accept special collect concern inform store collect tightli coupl specif knowledg domain appli yield great number useless request collect exclud queri rout select inform demand user express select algorithm model textual document probabilist framework select present difficult guess automat knowledg domain queri term user tend submit queri consist singl term requir evalu knowledg provid thesauri ontolog strategi appli statist analysi term larg number document comput associ weight indic themat correl gap scarc collect hand uncontrol bridg comput associ weight collect obtain weight evalu term frequenc frequenc gener gener search engin altavista contrast frequenc term frequenc document gener search engin updat frequent consist larger amount term largest thesauru queri rout system call present perform queri improv select relev special search engin addit queri term obtain dynam number document web analyz term frequent method collect store number descript term term obtain exploit publicli data exist categor scheme fulltext underli ingo hyperlink titl collect stopword instanc search collect document popular term engel histori associ term comput search total number web page index altavista septemb million determin number web page term page determin number web page term term examin formula multipli document frequenc term condit probabl term term provid citat collect col set col fd dn descript comput col respect col sum singl associ col experi prove practic perform experi queri twelv special histor document epoch ancient egypt till world war collect queri histor charact queri collect rank number result produc refer rank correct rank correct rank compar comput associ weight judg relev collect show rank rank number result note associ rank list creat queri collect reduc network examin correct collect top element rank produc col function number collect queri produc result diagram figur queri consid separ graph merg graph result obtain queri produc result collect queri produc singl collect rank posit consid correct collect found queri correct collect identifi queri queri produc result collect good result obtain result queri result blur collect produc largest number result rank posit diagram figur match match fig match rank rank queri import collect number result rank top specif assign special collect instanc queri easili collect occurr web refer german promin concept presenc web suffici evalu specif queri refer produc result collect themat complet analyz web determin domin concept underli collect concern instanc strongest web term refer countri metadata descript process select collect strongli depend qualiti metadata collect dublin core rudimentari special dublin core element dont suffici collect metadata descript special web collect extens integr addit inform data includ inform qualit judgement collect exampl kind metadata number access time hyperlink reput frequenc actual total number document access collect judg simpli measur number hyperlink point resourc search engin appli retriev strategi extract interpret data metadata descript individu develop frankfurt core metadata descript special collect fc addit element dublin core field qualit total number document access collect number hyperlink point collect number extern access month date latest actual collect field sourc descript term obtain list common collect assign exist list common term fulltext underli hyperlink point collect list queri term call hold search field support collect search interfac map gener search concept provid develop tool collect data individu collect write obtain inform exploit publicli inform web exploit collect field individu strategi inform gather appli comput associ weight previou chapter base data function col extend collect total number document store field qualiti metadata mention automat gener present metadata element close relat dublin record characterist resourc strategi gener characterist term www automat present architectur quest section introduc architectur quest meta search engin special collect web realiz prototyp chair access design integr specif unifi search concept taxonomi select queri rout previou chapter integr collect repres metadata descript inform queri support search descript contributor inform collect automat metadata collector examin web publicli access data collect server collect collect collect http cach mediat wrapper wrapper wrapper fig architectur quest system work user submit queri term user specif search concept search concept gener concept assum queri submit primari task prepar initi search request underli collect mediat contact associ server associ server return rank list associ show judg relev underli collect queri term judg perform basi term associ queri term characterist term function col section characterist term store metadata descript collect reduc net determin inform cach step mediat determin concept queri prepar queri collect rank highest select collect search concept queri gener support collect search interfac metadata descript search concept support specif collect map search concept concept taxonomi concept taxonomi manag taxonomi server taxonomi server decid concept subsum collect integr meta search engin wrapper encapsul properti translat queri individu send underli result result final return list result result consist url retriev document short snippet distinct mediat wrapper simplifi integr collect system collect wrapper util api mediat collect rank produc associ server creat integr result list higher collect rank higher document retriev specif collect rank paper quest system queri special collect web present focu quest unifi search field collect relat search concept identifi relev collect user queri strategi feasibl prove experi core introduc describ enhanc dublin core addit field qualit inform field primarili fill automat prototyp quest demonstr integr techniqu architectur futur extend exist concept taxonomi search concept build solid domain knowledg search concept facilit integr collect simultan restrict develop strategi automat metadata gener collect descript improv process queri rout area research extend method boolean queri metadata inform work support part project refer resourc descript framework schema system construct mediat internet sourc acm sigmod confer manag reduc classic knowledg theori meet realiti principl knowledg reason intern page method automat control vocabulari journal american societi inform widom tsimmi approach data model languag intern workshop gener inform technolog hofmann probabilist latent semant index acm sigir confer research develop inform powel french callan effect effici automat select technic report depart comput lu callan croft search distribut collect infer network annual sigir saracev real life inform studi user queri web sigir forum special interest group inform volum number page automat rdf metadata gener resourc discoveri intern www gravano effect gloss discoveri problem acm sigmod ordil queri heterogen inform sourc sourc descript vldb neumann inform retriev intern confer inform technolog knowledg resourc discoveri distribut digit librari digit librari advanc method digit state mendelzon page comput web page reput intern www modern inform retriev acm press queri rout web search architectur experi intern www wolf dublin core metadata resourc discoveri rfc dl dl descript logic digit librari intern workshop descript
ML/210 6 machin kluwer academ boston manufactur netherland technic note naiv regress frank leonard trigg geoffrei geo ian witten depart comput zealand david aha abstract naiv learn scheme perform classi cation signi cantli accur sophist method probabl estim produc assign maximum probabl correct class suggest good perform restrict situat output categor interest perform domain predict predict sensit inaccur probabl estim paper show appli naiv methodolog numer predict task model probabl distribut target kernel densiti compar linear local weight linear method produc tree linear regress function leav exhibit arti cial dataset naiv method dataset uniformli local weight linear regress model tree comparison linear regress depend error measur naiv perform show standard naiv appli regress problem discret target perform similarli badli present empir evid isol naiv independ assumpt poor perform regress set result simplist statist assumpt naiv make restrict regress classi cation naiv model linear local weight regress introduct naiv reli assumpt rare valid practic learn attribut deriv predict independ predict assumpt type sh predict length weight individu sh weight depend greatli vice versa shown classi cation problem predict independ assumpt restrict expect practic classi cation naiv produc signi cantli lower error rate sophist learn learn univari tree frank al naiv perform independ assumpt ow good perform loss function classi cation function de ne error number incorrect predict unlik loss squar kei properti penal inaccur probabl long greatest probabl assign correct class mount evid naiv classi cation perform remain fact depend produc incorrect probabl estim question successfulli appli predict loss function paper investig applic naiv problem predict categor numer naiv assign probabl target rang result distribut singl predict categor optim predict loss mode underli distribut numer problem optim predict depend loss function statist sensit underli distribut chang underli distribut small amount numer naiv sensit inaccur probabl estim classi cation paper explain exhibit arti cial dataset method choic summar perform set practic learn problem turn remark accuraci naiv classi cation standard benchmark dataset translat context regress naiv classi cation investig extens algorithm origin eld pattern recognit kasif al relat learn discuss limit surprisingli high comparison sophist learn frequent note clark iba domingo pazzani perform comparison naiv algorithm tree rule induct standard benchmark found superior learn scheme dataset substanti attribut depend research improv naiv delet redund attribut john extend incorpor simpl depend geiger domingo pazzani review approach conclud attempt build success relax independ assumpt mix naiv regress naiv appli relat problem time seri predict kononenko approach speci discret numer target approach appli standard naiv classi cation discret data sum mean weight class probabl assign naiv kononenko naiv perform compar method time seri predict slightli paper show perform relat context regress extens evalu naiv regress publish literatur machin pattern statist paper organ section describ method appli naiv directli regress discret target section exhibit arti cial dataset independ assumpt show naiv perform method local weight linear regress model tree section turn practic dataset compar predict perform naiv linear local weight linear model tree section investig method perform compar standard naiv case classi case regress section present result experi investig independ assumpt uenc perform naiv regress section discuss result draw naiv regress address problem predict numer target consist attribut xm attribut case treat real case set unord valu probabl densiti function target exampl minim expect predict error estim data naiv achiev appli theorem assum independ attribut xm target theorem state likelihood probabl densiti function target prior pdf target exampl naiv make kei assumpt attribut independ target equat written frank al jy jy jy jy jy jy estim pdf individu pdf jy estim separ reduct make learn problem easier amount data obtain accur estim jy estim reliabl question harm independ assumpt valid learn problem empir result present section shed light issu section discuss jy estim set train exampl jy case case attribut case nomin handl numer attribut rst discuss estim jy numer attribut assum normal determin train data jy pdf involv numer variabl jy condit probabl jy estim comput approxim joint probabl estim pdf model mixtur model chosen kernel densiti estim hx attribut target train kernel hx kernel width includ calcul shown estim converg true pdf kernel function obei smooth properti kernel width chosen appropri common choic gaussian kernel experi kernel width hx chosen di erenc estim pdf true pdf minim measur di erenc expect estim obtain log hx naiv regress hx set hx chosen minim estim grid search grid width paramet set search found di erenc result nh term comput estim jy jy numer attribut handl nomin attribut case jy estim nomin attribut set unord valu estim jy transform problem estim pdf numer variabl nomin prior probabl nomin attribut transform ect appli jy yjx yjx estim easili counterpart kernel densiti estim yjx nk sum exampl attribut type estim john langlei estim densiti numer attribut naiv categor predict estim obtain simpli comput proport exampl attribut procedur estim minim grid search grid width term comput estim jy jy nomin attribut estim prior procedur estim prior di erenc includ exampl attribut exampl kernel width chosen procedur frank al predict optim predict respect posterior probabl je depend loss function loss squar error absolut error predict minim expect loss easi show expect squar error dy minim expect se estim se quantiti obtain set equal space grid point domain minimum maximum train max number grid point note stop evalu point left neglig set attribut jy neglig valu exclud comput se sum denomin approxim integr denomin equat expect absolut error achiev set ae ae optimum predict ae median estim ae obtain nding smallest set ae estim ae grid point naiv regress experi arti cial dataset naiv excel altern sophist method categor learn section exhibit arti cial dataset case regress set compar naiv method numer local weight linear model tree local weight linear regress combin learn linear regress moor perform linear regress unweight perform weight linear weight train instanc distanc test instanc hand perform local linear regress give train instanc higher weight close test instanc mean linear regress test make method make highli enabl approxim target function di erent wai implement weight scheme local weight linear regress moor common emploi weight train instanc triangular kernel center test set kernel width distanc test instanc kth nearest neighbour determin root squar error train ten valu rang number train instanc perform linear implement elimin redund attribut attribut smallest contribut predict decid stop delet inform criterion emploi nomin attribut valu convert binari attribut algorithm wang witten miss valu global replac mode nomin numer train data linear regress perform method predictor model tree counterpart tree regress task structur di emploi linear regress function leaf node make predict experi model tree induc quinlan interest fact gener produc accur predict tree learner appli categor predict task miss valu global replac model tree built method perform linear regress treat nomin attribut naiv assum attribut valu statist independ target term regress problem interpret attribut function target frank al figur spiral dataset naiv fare dataset sati es independ investig question arti cial data speci construct dataset describ diminish spiral dimens spiral randomli gener data depict figur featur gener target denot distribut unit varianc function attribut function evalu naiv predict di erent train set size figur show result learn learn curv model tree model tree perform domain smooth point curv gener random train dataset evalu result model independ gener exampl shown figur error bar con denc interv figur show naiv perform signi cantli spiral slightli demonstr naiv prefer method regress independ assumpt sati situat occur practic attribut read sensor measur target di erent wai measur distanc object ultrason wave infrar radiat hand measur sensor independ distanc naiv regress root squar error number exampl naiv figur learn curv spiral dataset experi practic dataset section compar naiv regress linear regress local weight linear regress practic benchmark dataset speed kernel width set distanc furthest found give compar result gener result present loss function discuss section root squar error absolut error dataset select criterion larg dataset time complex naiv regress local weight regress dataset properti list tabl sort size twenti repositori remain ve collect dataset arti cial dataset set classi cation problem regress class treat integ variabl result rel root squar error tabl summar rel root squar error method investig measur root squar error normal root squar error sampl express percentag sampl comput train data method perform rel root squar error percent frank al tabl dataset experi dataset instanc miss numer nomin valu attribut attribut bolt pollut sleep cloud fruit servo cpu hungarian cleveland meta sensori strike root squar error result naiv gener predict se equat gure tabl averag ten standard deviat ten shown fold scheme result mark show signi improv result naiv show signi degrad speak result cantli di di erenc statist signi level pair pair data point consist estim obtain run learn scheme compar naiv regress tabl rel root squar standard deviat dataset naiv lr bolt pollut sleep cloud fruit servo cpu hungarian cleveland meta sensori strike tabl result pair rel root squar error number method column signi cantli outperform method row naiv lr naiv lr tabl summar di erent method compar entri number dataset method column signi cantli accur method row frank al observ tabl linear regress outperform naiv eighteen dataset rst naiv outperform linear regress rst domin outperform naiv signi cantli mention hungarian classi cation problem regress problem nding outperform naiv twenti signi cantli remain gure tabl method choic dataset root squar error minim linear regress compar naiv linear regress advantag produc output result absolut error compar method respect absolut error discuss section naiv predict median ae equat perform predict se estim pdf sucient close true pdf experi observ perform signi cantli median fteen signi cantli toler inaccur estim occur depend result present median tabl summar rel absolut error method absolut error divid absolut error sampl tabl summar result signi canc test compar rel root squar error tabl show slightli di erent pictur naiv perform linear signi cantli accur thirteen signi cantli accur thirteen linear regress function deriv minim root squar error train ts extrem valu dataset close absolut error insensit extrem deviat predict true impli naiv extrem valu reason job rest data situat naiv naiv score ten signi nineteen previou outperform naiv wide perform signi cantli dataset signi cantli ve ve hungarian cleveland dataset repres classi cation problem regress problem gure tabl show superior perform restrict root naiv regress tabl rel absolut standard deviat dataset naiv lr bolt pollut sleep cloud fruit servo cpu hungarian cleveland meta sensori strike tabl result pair rel absolut error number method column signi cantli outperform method row naiv lr naiv lr squar outperform method respect absolut error frank al comparison standard naiv remain possibl disappoint perform naiv regress numer benchmark dataset due fundament aw methodolog deriv naiv model test compar standard naiv classi cation appli set benchmark classi cation numer dataset section appli naiv regress classi cation appli naiv classi cation regress problem exist standard procedur solv problem rst discuss point proce investig point classi cation problem standard techniqu transform classi cation problem class regress problem dataset number instanc class set depend instanc class naiv model train regress dataset speci output model constitut approxim probabl instanc belong class model minim squar error probabl predict equat test instanc unknown class process naiv result approxim probabl belong class class naiv model highest chosen predict class tabl show error rate uci dataset keogh repres classi cation problem error rate estim ten run naiv ran tree learner default paramet set standard naiv procedur classi cation dataset implement naiv classi cation discret numer attribut fayyad irani ignor miss emploi laplac estim avoid count result tabl show perform signi cantli naiv regress ve signi cantli eleven compar naiv classi cation perform signi cantli result show naiv regress appli classi cation problem perform slightli standard approach naiv classi cation naiv regress tabl percentag correct classi standard deviat dataset instanc class naiv naiv regress classi cation anneal audiolog australian auto glass hepat iri labor sonar soybean vote zoo regress problem turn comparison naiv regress standard naiv classi cation set benchmark regress problem section order appli naiv classi cation transform classi cation problem strategi appli kononenko discret target set appli naiv classi cation discret data interv valu weight class probabl output naiv model kononenko ad hoc method discret target implement discret perform train number interv minimum root squar error tabl show naiv regress discret approach perform respect rel root squar error perform signi cantli naiv regress signi cantli compar naiv classi cation perform signi cantli frank al tabl rel root squar standard deviat dataset naiv naiv regress classi cation bolt pollut sleep cloud fruit servo cpu hungarian cleveland meta sensori strike result nding previou section suggest fundament aw methodolog support conjectur imposs appli naiv successfulli standard regress problem classi cation task isol independ assumpt order test independ assumpt main reason poor perform naiv design experi isol uenc result creat version model tree induc assum attribut contribut independ predict speci gener consist attribut build model tree naiv regress tree base predict attribut assum attribut contribut independ nal predict equat weight averag individu model predict naiv approach unweight averag predict perform combin tree dramat improv weight predict perform train ad attribut strongli detriment ect obtain result weight rel root squar error speci predict model tree attribut tree root rel squar error train nal predict call predict method independ sophist weight scheme produc result interest rel perform independ compar scheme sucient goal provid evid claim independ assumpt naiv regress reason compar high predict error compar di erenc perform independ di erenc perform naiv regress predict evid independ assumpt di erenc independ exploit attribut depend gener predict figur show di erenc rel root squar error combin section ten run estim error point correspond twenti dataset tabl includ dataset tabl learn scheme involv greater rel root squar error fruit case obviou implement learn algorithm ts prevent implement issu obfusc ect independ assumpt figur show result linear regress datapoint correl coecient data assum perform differ correl statist signi provid strong evid linear relationship independ assumpt larg perform di erenc naiv regress frank al figur compar di erenc rel root squar error naiv practic dataset method greater rel root squar error paper shown naiv appli regress problem model distribut target kernel densiti estim discuss previou work suggest remark perform naiv standard classi cation problem translat regress context result con rm hypothesi set standard naiv perform compar linear regress respect absolut error respect squar uniformli local weight linear regress model tree algorithm case implement method crude techniqu deal miss valu show standard naiv appli regress problem discret target perform similarli badli conjunct result isol independ assumpt naiv poor nding lead conclud naiv appli regress problem independ assumpt hold acknowledg anonym review comment greatli improv paper data set origin appendix dw appli logist john wilei york naiv regress data origin medic institut yugoslavia provid data dataset origin hungarian institut william matthia robert va medic long beach cleveland clinic foundat note case symmetr bimod posit mode sensit small distribut chang posit fortun classi cation true distribut similarli choic relev true error rate crude techniqu deal miss valu impact drawn paper arti cial dataset section miss valu dataset obtain author request fruit dataset journal statist educ data archiv dataset repositori dataset dataset collect massachusett amherst remain dataset uci repositori keogh dataset found repositori holt glass dataset class combin class dataset attribut delet attribut class delet identi er attribut dataset refer inform theori extens maximum likelihood principl intern symposium inform theori local weight learn arti cial intellig uci repositori machin learn depart inform comput scienc estim crucial task machin learn european confer arti cial intellig london induct algorithm machin optim simpl bayesian classi er loss machin pattern classi cation scene analysi wilei discret attribut classi cation learn intern joint confer arti cial intellig morgan san ca model tree classi cation machin frank al data mine knowledg bayesian network classi er machin learn incomplet data em approach advanc neural inform process system san morgan kaufmann simpl classi cation rule perform commonli dataset machin wrapper featur subset select arti cial estim continu distribut bayesian classi er confer uncertainti arti cial intellig morgan san ca probabilist framework reason arti cial numer predict learn encod length select progress inform system singapor bayesian classi er european work session learn berlin person commun induct bayesian classi er european confer machin learn berlin analysi bayesian classi er nation confer arti cial intellig san aaai menlo ca induct select bayesian classi er confer uncertainti arti cial intellig morgan san ca theori point estim wilei search depend bayesian classi er learn arti cial intellig statist learn continu class australian joint confer arti cial intellig world scienti singapor program machin learn san morgan kaufmann learn limit depend bayesian classi er intern confer knowledg discoveri data mine aaai menlo ca densiti estim statist data analysi chapman hall smooth method statist tting tree classi er kernel densiti estim intern confer machin learn taho morgan san ca depart carnegi mellon induct model tree predict continu class poster paper european confer machin learn faculti informat pragu final
AI/211 2 agent implement jini abstract kei problem recent year divid theoret work system practic complement larg develop path implement framework design aim narrow gap reli extens formal agent framework implement recent advanc java technolog jini connect technolog enabl creation commun support develop system introduct network environ highli interdepend face inform servic increasingli hard manag system provid solut problem consequ dynam social commun cooper effect model problem domain interact agent agent paradigm experi widespread issu resolv urgent agent develop methodolog agent framework enabl develop implement system effect quickli develop system provid experi aid answer question paper describ effort address provid implement framework develop system recent advanc java technolog work address divid luck formal agent framework base implement describ implement platform ronald michael luck depart comput scienc warwick uk jini connect creation commun aim develop concentr definit agent entiti standard effort care issu behaviour control commun interact entiti paper begin briefli review luck formal agent framework base understand aim implement design principl underli technolog discuss subsequ section detail object agent instanti explain present cover work possibl open system technolog commun autonom agent achiev formal agent framework notion agent larg extent vagu inher varieti interpret altern definit present exclud approach attempt ground work agent concept move forward tackl import luck describ formal framework delin notion agent reject altern form hierarchi agent autonom agent entiti set simpli describ featur world object entiti set action object perform effect state environ agent object set goal defin set desir attribut autonom agent agent gener goal drive motiv thought prefer desir autonom agent lead produc goal satisfi desir clear distinct made notion agent autonom agent agenthood ascrib entiti world act order satisfi goal agent autonom simpl framework refin accommod sophist agent introduc addit definit neutral object object world agent server agent agent world autonom neutral object give rise server agent adopt goal goal pursu goal longer server agent revert back neutral object characterist framework focu paper explain framework implement real set api discuss agent framework leav reader explor previou work order make abstract notion person agent motiv connect save provid find train ticket visit london gener goal includ list travel agent provid ticket achiev locat object environ capabl provid list pa engag object instanti server agent goal provid requir inform action object requir accomplish multicast announc request activ travel agent regist receiv pa attempt contact travel agent form commun languag acquir requir inform number call satisfi motiv cheap ticket pa report result wait instruct illustr kei point import defin entiti necessarili exhibit tradit standard agent regard agent task goal interact entiti form direct engag object cooper autonom agent discuss motiv requir drive autonomi agent innat drive forc defin behaviour gener goal autonom agent motiv time prefer goal download inform local process agent implement design principl state aim provid agent implement environ base agent framework implement agent framework environ serv infrastructur respect domain agent develop theoret place base principl theoret guid design principl structur gener develop technolog jini xml enabl framework gain evolut aid understand develop opt provid ground model easili chang adapt model understand agent paradigm solut agent implement separ agent order construct agent type java agent system argu kinni al object orient program languag provid direct solut agent featur inherit modular make easier manag increasingli complex system complex agent behaviour mean power oo directli map agent design accept path agent model languag found oo techniqu java choic rang extra qualiti jini java host featur make suitabl construct import make java ideal platform recent jini connect technolog jini intend resolv problem network administr provid interfac compon network join leav network time collect entiti call jini entiti feder repres servic provid servic consum strength jini system li fact abstract level network protocol devic driver introduc notion servic servic storag camera importantli softwar compon servic join jini feder bring set attribut describ figur agent hierarchi attribut examin human softwar agent determin suitabl achiev desir goal potenti servic user servic suitabl agent potenti user negoti agreement servic provis place system featur make dynam notion jini servic period join feder end servic renew abandon feder charg proport period requir join difficult appeal aspect jini technolog relev system servic join feder direct access jvm servic mediat jvm actual compon control enabl develop easili implement jini wrapper legaci softwar devic support jvm immedi obviou idea connect system jini reliev develop wheel time identifi bradshaw al system badli push agent develop forward object agent creation introduc main design move show piec fit illustr cycl creation neutral object autonom agent subsequ manipul neutral object autonom agent basic structur entiti relationship translat hierarch framework separ perman temporari entiti figur autonom agent function shown figur extend defin behaviour function agent extend wrap longer requir wrap neutral object entiti framework attribut capabl attribut defin xml file distinct made static dynam attribut chang capabl similarli xml file java class dynam load neutral jvm agent design access librari capabl automat attach agent agent function desir neutral object locat agent engag directli agent instanti server agent server agent temporari agent adopt goal goal ascrib engag illustr figur neutral object engag action request agent simpli transfer goal queue goal neutral object execut wait turn higher prioriti agent engag demand attent request agent negoti target altern agreement meet discuss natur server detail exact mechan user interact neutral examin princip execut engag jvm case entir neutral object implement publish jini commun download engag link neutral jvm figur execut engag jvm call newli engag server agent neutral execut local behaviour servic repres requir extens agent engag neutral network administr agent requir modul control devic execut place jvm shown figur sophist approach neutral object publish proxi rmi stub remain neutral jvm engag agent behaviour previou case instanti server agent wrap neutral object call commun origin engag neutral remot jvm instanc neutral object serv channel inform interfac remot distribut comput power execut place client server call smart proxi neutral object publish implement interfac process engag jvm engag neutral remot jvm implement instanc profit distribut process case engag agent perform local process power inform obtain remot call neutral object current implement execut place remot case simpli aim focu distribut rmi stub care marshal paramet pass neutral object send network rmi skeleton paramet make call local result pass stub return result client made call import implic inform serializ transfer network control remot devic agent act autonom agent gener goal intern adopt goal neutral object goal ascrib server agent agent attempt form plan satisfi activ goal plan flexibl plan gener repositori plan suitabl plan achiev current bdi architectur autonom agent give mean system abil gener driven motiv motiv agent goal plan complet defin behaviour instanti autonom xml file requir goal plan set goal plan goal base plan base agent base autonom agent goal offer greatest motiv lead attempt select execut plan involv agent capabl engag agent goal attempt achiev longer autonom agent modifi motiv goal goal base agent interact discuss creation instanti compon agent consid autonom agent interact autonom agent make cooper autonom agent join jini commun discov discov enter negoti sort servic negoti requir base commun infrastructur enabl commun requir interact rang commun xml messag robust behaviour messag router framework layer abstract underli commun method tie framework commun figur illustr issu discuss section show function autonom access order gain inform engag neutral object act interfac transfer goal instanti server agent make contact agent public figur agent system snapshot commun interfac implement autonom commun download implement commun interfac issu address partli due space partli due partli tackl context scope extend work address issu issu payment servic render form kei concern broader accept system develop jini case briefli touch discuss join jini role make system dynam automat clean servic renew servic grant mechan consum resourc payment amount servic discuss enter phase agent research develop focu excit inspir mundan fundament issu consolid underli technolog effort includ integr exist technolog applic agent solut linkag agent theori augment technolog facil develop issu begin address implement ment paper develop result practic concern support develop system construct underli technolog increasingli widespread larg applic access work engag directli broader develop commun work underpin concern principl fact implement sophist foundat formal agent framework strong theoret facilit satisfi audienc earli suggest avenu explor effect valuabl progress refer wollrath jini specif bradshaw agent mass ieee intellig luck develop applic formal agent framework ieee intern confer formal engin page ieee rao methodolog model techniqu system bdi agent van de veld agent break seventh european workshop model autonom agent lnai page luck definit system knowledg engin luck formal framework agenc autonomi intern confer page aaai press mit luck engag cooper motiv agent model australian dai lectur note artifici page springer luck motiv behaviour goal adopt languag applic fourth australian dai lectur note artifici page springer rao bdi agent speak logic comput languag van de veld agent break seventh european workshop model autonom agent lnai page
DB/212 3 rewrit conjunct queri view descript logic existenti restrict francoi rousset cnr build orsai franc introduct rewrit queri view receiv attent relev field queri data inform integr data answer queri restrict extens set predefin queri inform integr context typic rewrit queri view answer queri user inform integr system pose queri directli sourc data store set virtual relat design provid uniform homogen access domain interest content sourc view domain problem reformul user queri queri refer directli relev sourc problem rewrit queri view instanc rewrit problem consid vari depend languag describ queri view rewrit problem extens studi concern pure relat set queri view express conjunct queri relat atom recent extens dl consid studi instanc problem rewrit queri view queri view conjunct queri dl express deal problem rewrit conjunct queri express conjunct queri built set view set distinguish express rewrit algorithm present implement answer user queri inform integr system rewrit problem consid concept express dl tbox express dl author comput minim concept dl modulo extend work studi problem rewrit conjunct queri dl express conjunct queri set view set distinguish dl dl existenti al rewrit problem conjunct queri express dl set view express comput repres set rewrit queri conjunct queri repres set set rewrit maxim queri present algorithm comput repres set rewrit queri full version paper show adapt deal negat atom concept queri order obtain rewrit algorithm al show obtain finit set repres rewrit queri import rewrit conjunct queri view effici effect answer conjunct queri pose larg regular abox abox regular extens fix small number concept role number answer conjunct queri abox import issu crucial solv effect export dl real applic deal huge amount data problem answer boolean conjunct queri abox studi theoret point view set express dl dlr algorithm provid lead effici comput answer set queri approach advoc answer conjunct queri pose regular extens concept role cr cr rewrit queri view cr cr evalu rewrit relat queri pose standard relat approach advantag comput answer set queri polynomi size data complet comput depend kind rewrit maxim view complet paper organ section formal defin rewrit problem provid sound complet rewrit algorithm section exhibit counterexampl show obtain finit set repres rewrit preliminari exampl view queri rewrit problem paper built concept descript al final concept descript built atom concept constructor conjunct uc restrict existenti restrict addit al primit negat restrict atom add number restrict obtain rest concept descript put normal obtain exhaust appli normal rule preserv uf note size normal form comput normal rule exponenti size origin concept import role plai form defin induct notion chain decomposit wrt chain import algorithm definit chain defin induct chain depth iff decomposit depth wrt chain chain depth iff exist ch chain depth decomposit depth wrt chain ua decomposit wrt chain semant empti dual oper build concept express list role appli concept inject depth role chain definit sequenc quantifi sequenc role sequenc ffl ffl composit decomposit conjunct concept conjunct concept definit concept obtain conjunct set concept set concept fd ffl conjunct concept subset ffl partit conjunct queri concept role conjunct queri call atom concept atom role variabl call distinguish variabl repres variabl queri user interest instanc queri variabl distinguish call existenti variabl existenti quantifi constrain distinguish variabl answer queri pose set ground fact db set tupl db queri entail answer db includ answer distinguish variabl existenti variabl answer instanc tupl distinguish variabl flight depend airlin flight stop american flight stop european citi variabl variabl successor queri exist role atom queri bind variabl queri graph node variabl edg variabl successor subqueri tree structur graph tree appli algorithm order normal replac exhaust conjunct relat variabl queri singl normal concept form conjunct replac subqueri tree structur singl descript support consist iter replac conjunct conjunct form existenti variabl predecessor singl final replac distinguish variabl conjunct underli idea comput bring fore implicit knowledg conjunct normal concept descript captur queri knowledg concept descript rewritten independ result normal queri norm note existenti variabl anymor norm existenti variabl variabl bind prevent replac conjunct existenti restrict role airlin problem rewrit queri view finit set fv definit view view definit role concept descript al role concept call call view atom set view fv light view express access extens role concept view concept instanc flight stop american citi capit hilton hotel locat european citi normal set view split uc normal view obtain set normal norm fv note normal set normal set view definit view obtain conjunct conjunct view atom denot conjunct obtain replac view definit rewrit problem formal definit normal queri existenti variabl set normal view conjunct view atom rewrit iff definit entail continu subqueri queri trivial rewrit norm rewrit norm entail comput rewrit rewrit algorithm input normal queri normal set view return output set conjunct view atom repres set rewrit view core procedur algorithm comput rewrit atom base set rewrit obtain build conjunct rewrit note exist result rewrit queri consist view atom rewrit procedur figur illustr complex case rewrit chain depth ch decomposit depth wrt ch fag arrai quantifi obtain obtain theorem state correct complet atom rewrit algorithm figur theorem conjunct normal normal set view result fq vn output return rewrit rewrit includ renam existenti atleast rewrit return procedur result fv st vg note result fv st cg result fresh result result vg fresh variabl result result chain ch depth number occur ch decomposit depth wrt arrai quantifi line kc column pc equal result result existenti variabl case conjunct concept collect fr mg role view maxim depth concept express view result result fresh variabl return result figur rewrit algorithm proof corollari state correct complet queri rewrit algorithm corollari normal element rewrit rewrit includ renam existenti atleast rewrit return extend version paper show adapt rewrit algorithm order al concept descript account queri view definit cope atom negat ad normal modifi rewrit procedur order rewrit queri rewrit queri rewrit queri show al verifi rewrit consist achiev suffic check normal definit produc end paper exhibit counterexampl show obtain finit set repres rewrit set view fv queri rewrit variabl view atom entail successor successor view atom state line reason continu queri hold point infer requir chain infer involv arbitrari number view length chain depend queri view easi check rewrit exist finit set conjunct view atom repres rewrit refer franz ralf ralf rewrit concept terminolog alon rousset rewrit queri view descript logic diego giusepp de giacomo maurizio lenzerini answer queri view descript logic diego giusepp de maurizio lenzerini mosh vardi queri process constraint satisfact francoi rousset languag algorithm inform system intern journal cooper inform system francoi rousset rewrit conjunct queri view descript logic existenti restrict technic report alon levi answer queri survei rousset backward reason abox queri answer
ML/213 6 appli parallel improv genet design optim brian davison depart comput scienc state jersei nj usa novemb introduct abund power workstat make parallel obviou enhanc optim includ genet algorithm initi modif made algorithm design optim carefulli analyz potenti impact qualiti parallel potenti improv ga perform altern model comput parallel reduc total chang model comput real chang number simul call make solut achiev effect parallel investig summer center comput design object straightforward parallel implement task analyz perform gener effect parallel object ffl perform studi determin optim processor util exist parallel interfac ffl determin maximum speedup exist interfac ffl investig qualiti result chang number solut evalu parallel ffl investig qualiti result chang order solut vari ffl examin altern parallel includ island model time goal achiev result goal result perform architectur facilit parallel multipl machin examin master process run master slave figur optim perform master evalu perform slave speedup factor number processor parallel interfac figur close linear speedup suffici larg task run evalu optim shown evalu approxim minut number slave system simul evalu potenti design figur simul spread machin close linear time evalu solut suffici larg figur domain conceptu aircraft small evalu run multipl evalu task processor reduc time complet figur extern overhead creat job leav client processor idl authent possibl retriev data run multipl processor work task wait evalu task small overhead result parallel suffici matter processor perform origin sequenti task simpl implement parallel effect design iter exist member popul replac individu base replac strategi figur note ga gener entir popul replac amen parallel order fit parallel modifi individu creat simul time pipelin individu design mean creation individu affect individu creat step ago number process process requir full child util figur multipl task save approxim achiev similar save found larger task task shown popul newborn mutat crossov select replac figur steadi state model genet singl individu creat insert popul repeat process popul newborn mutat crossov select replac newborn mutat crossov figur creat multipl individu evalu parallel back popul figur back individu order origin design complet evalu faster result heterogen process extern investig modifi pipelin length vari random order optim experi standard benchmark domain comparison run iter pipelin size attempt pipelin model achiev optim solut remain pipelin version close exce perform pipelin size respect class found figur experi make assumpt pipelin simul effect order parallel evalu result collect randomli select posit pipelin uniform probabl insert back popul experi found case figur random version perform slightli averag random pipelin size perform slightli pipelin size averag similar averag version depend experi popul size ran iter pipelin size consid potenti fraction popul size pipelin size degrad perform domain start notic iter figur optim run benchmark pipelin size random select iter figur optim run benchmark pipelin size random select iter figur optim run benchmark pipelin size random select iter figur optim run benchmark pipelin size random select experi perform limit provid evid modif parallel significantli alter abil find optim solut expect cpu current parallel degrad qualiti clear domain evalu time suffici high warrant parallel overhead exist parallel low effect genet algorithm perform evalu refer dasgupta zbigniew editor evolutionari algorithm engin applic david goldberg genet algorithm machin learn khale genet algorithm continu design optim phd depart comput rutger technic report khale haym hirsh learn select design optim artifici intellig engin analysi khale haym andrew genet algorithm continu design space search artifici intellig
ML/214 6 algorithm mobil robot local frank wolfram burgard dieter fox sebastian thrun comput scienc carnegi mellon pittsburgh pa institut comput scienc bonn abstract navig reliabl indoor mobil robot includ abil global local robot track robot posit locat vision long provid solut lack effici solut unmodifi environ exist approach requir modif environ function work unmodifi environ address problem global local paper present local method base algorithm bayesian filter method densiti show algorithm track posit camera platform track object scene global local camera visual map environ base present robot local method solut difficult open problem mobil robot commun evid viabil show global local track result context state art robot applic introduct oper mobil robot mobil robot process determin track locat mobil robot rel receiv attent past year accur local kei prerequisit success navig global model topolog cad model demonstr recent survei local method feng number exist approach cox note sensori inform locat robot environ fundament problem provid mobil robot autonom current state art local laser rang finder sonar sensor modal number problem tend easili highli dynam laser sonar beam block peopl limit expect provid accur local larg open landmark observ system tend vision long provid solut effici solut unmodifi environ lack approach review requir artifici landmark reflect visual pattern easi black rectangl white dot approach natur landmark track posit global local robot present approach local base robust capabl global local robot idea visual map obtain local robot simpl scalar bright measur sensor input inform sensor highli kalman filter approach applic algorithm introduc vision commun deal type measur uncertainti belong gener class mont carlo invent seventi recent independ statist comput vision literatur algorithm set random sampl particl repres propag arbitrari probabl densiti time properti make ideal suit applic result local call mont carlo local draw show algorithm track posit camera platform track object scene show addit provid robust algorithm global local visual map environ base present robot local method solut difficult open problem robot commun evid viabil show global local track result context state art robot applic mobil robot function interact robot nation museum american histori week interact km success result unmodifi highli dynam environ approach remaind paper discuss gener problem robot section made explicit section discuss simpl sensor give rise complex likelihood densiti section provid taxonomi algorithm base deal type densiti section show algorithm eleg solut basi local method section show global local track result museum testb applic robot local robot interest estim state robot current knowledg initi state measur current time work state vector posit orient robot estim problem instanc bayesian filter interest construct posterior densiti current state condit measur bayesian probabl densiti function repres knowledg possess state estim current posit estim mode maximum posteriori map densiti unimod global local densiti calcul singl posit estim local robot comput densiti predict phase phase motion model predict current posit robot form predict pdf motion account assum current state depend previou state control input motion model condit densiti predict densiti obtain dx updat phase phase measur model incorpor inform sensor obtain posterior pdf assum measur independ earlier measur measur model term likelihood term express likelihood state observ posterior densiti obtain updat process repeat time knowledg initi state assum form densiti case global densiti uniform densiti posit track initi posit covari gaussian center transit global local track automat pdf evolv span state space peak local explain basic idea approach show rise complex likelihood densiti motiv algorithm kalman filter base approach basic idea approach gener imag mosaic ceil environ robot oper local robot ceil mosaic shown fig figur show larg portion deep floor ceil museum american histori dc mosaic gener imag global align figur likelihood densiti posit bright measur valu high robot light intermedi low light figur ceil mosaic area shown deep wide estim textur ceil align imag align variant algorithm lu milio laser rang finder scan detail scope current run simpl scalar measur local robot work entir idea simpl sensor integr high frequenc requir comput memori import properti enabl low cost robot bright small ceil patch directli robot measur testb measur camera point extract small window pixel center imag gaussian filter standard deviat pixel creat singl scalar measur blur essenti filter frequenc compon repres finit resolut likelihood densiti simpl sensor model gener complex explain power probabilist reason illustr likelihood densiti shown fig robot border light clear densiti resembl remot gaussian power densiti requir provid kalman filter exist tale densiti solut robot local problem obtain solv depend repres densiti obtain algorithm vastli kalman filter motion measur model gaussian initi state densiti remain gaussian time evalu close yield classic kalman filter base techniqu proven robust accur track robot posit covari matrix suffic describ entir effici algorithm clear basic assumpt gaussian densiti violat likelihood densiti typic complex discuss topolog markov local overcom approach increasingli richer scheme repres move restrict gaussian densiti assumpt inher kalman filter method roughli distinguish type discret resent state space markov local corridor navig state space organ topolog structur environ applic interest posit environ simpl topolog larg open accur placement robot markov local deal multimod densiti fine discret interest part state basi approxim densiti constant function idea form basi markov local approach method type suffer disadvantag comput overhead priori commit size state space resolut repres state fix comput requir effect accuraci measur process valuabl inform state discard method repres densiti set sampl randomli drawn form topic section mont carlo local present local method base algorithm propag posterior densiti time local estim posit camera platform object scene abil repres arbitrari densiti enabl perform global local modif method repres densiti set random sampl particl drawn essenti dualiti sampl densiti gener sampl approxim reconstruct histogram kernel base densiti estim techniqu goal comput timestep set sampl drawn eleg algorithm accomplish algorithm altern bootstrap filter filter method gener particl overview discuss properti found analog formal filter problem outlin section algorithm proce predict phase phase start set particl comput previou appli motion model particl sampl densiti particl draw sampl set obtain approxim random sampl predict densiti prime incorpor sensor measur time updat phase phase account measur weight sampl weight likelihood obtain resampl weight draw sampl resampl select higher probabl sampl high likelihood set obtain approxim random sampl algorithm perform resampl process effici time updat step repeat initi start time random sampl prior graphic fig probabl densiti particl set iter algorithm text detail iter algorithm illustr figur figur panel top row show exact panel show densiti panel start fig initi uncertainti iter fig repres ambigu iter fig global local iter figur robot museum ceil camera cloud particl repres uncertainti robot posit robot fairli orient unknown panel show belief state told robot move meter robot circl meter radiu previou locat panel show observ half meter top panel show likelihood bottom panel illustr sampl weight likelihood panel show effect resampl weight form start point iter good explan mechan underli algorithm entir procedur reweight subsequ resampl sampl posterior call sampl resampl access introduct found result approach robot prototyp robot shown fig summer function week interact robot nation museum american histori interact thousand km dataset work consist log odometri measur collect oper environ upward point build perform bright side fig time stamp test conduct global local kei advantag base approach abil repres probabl distribut abil precondit local mobil robot knowledg start locat global local capabl illustr fig fig algorithm initi draw sampl uniform probabl densiti save obstacl iter sampl scatter tend concentr area high bright shown fig possibl shown fig sampl actual tempor sequenc bright measur note earli stage abil fig estim path odometri fig correct path vision repres ambigu probabl distribut vital success posit estim iter local peak shown fig robot uniqu determin posit note sampl shown resampl sampl fact low probabl posit track track posit robot robot move high speed record data move speed museum time run visitor robot remot control user connect world wide web illustr fig show occup grid map museum estim trajectori odometri track robot posit initi true posit top map due accumul odometri robot lost meter path estim track global posit time appreci fig path shown path gener run algorithm plot sampl time result estim path obtain end cm correct black dot figur fewer sampl posit track global issu futur research adapt number sampl appropri noisi natur estim posit occur probabl peak plot displai altern mode posterior probabl densiti futur work shown type algorithm perform global local local mobil robot abil mont carlo method deal arbitrari likelihood densiti crucial properti order deal highli ambigu sensor abil repres multimod posterior densiti global local initi uniform prior distribut global local peak time base result mont carlo local approach shown address fundament open problem mobil robot commun order support shown result context challeng robot applic method global local local track robot highli dynam unmodifi robot travel high speed result paper obtain singl bright measur ceil directli robot posit investig futur develop opposit build robot sensori omit wheel encod provid odometri measur shift burden develop power paradigm probabilist reason clear integr complex measur provid inform iter result faster global local accur track shown futur hope investig possibl depth refer borenstein robot system phd feng navig mobil system techniqu theorem digit nonlinear filter journal astronaut ab cremer integr global posit estim posit track mobil dynam markov local approach intl conf intellig robot system schmidt estim absolut posit mobil robot posit probabl grid proc fourteenth nation confer artifici intellig page improv particl filter problem technic depart ij cox experi guidanc navig autonom robot vehicl ieee transact robot frank sebastian chuck thorp mosaic larg number wide distort bayesian approach technic comput scienc carnegi mellon sequenti method bayesian filter technic report depart realworld issu navig spie confer mobil robot volum thrun activ markov local mobil robot robot autonom ab cremer posit estim mobil robot dynam environ aaai fifteenth nation confer artifici nj dj smith approach bayesian state estim iee comparison scan match approach indoor environ euromicro workshop advanc mobil robot ieee comput societi rasmussen predict landmark featur mobil robot navig ieee conf robot autom page je mont carlo techniqu predict filter stochast process isard blake contour track stochast propag condit densiti eur conf comput vision page isard blake condit densiti propag visual track intern journal comput lp ar ja kurien act discret bayesian model navig intern confer intellig robot king autonom mobil robot navig system spie confer mobil volum mont carlo filter smoother state space model journal comput graphic rp editor mobil case studi success robot mit press kortenkamp topolog map mobil robot combin sonar vision twelfth nation confer artifici page jj leonard hf direct sonar mobil robot navig kluwer lu milio global consist rang scan align environ map technic depart comput york april matar distribut model mobil robot navig master artifici intellig stochast estim volum academ robot ai summer pitt filter auxiliari particl filter technic depart imperi octob db rubin algorithm simul posterior distribut bayesian volum page oxford schiel crowlei comparison posit estim techniqu occup grid ieee conf robot autom volum page simmon koenig probabilist robot navig partial observ environ proc intern joint confer artifici smith ae gelfand bayesian statist perspect american thrun bayesian landmark learn mobil robot local machin
Agents/215 1 intellig agent framework vrml world introduct depart comput dimitri greec technolog rapidli emerg begin state autonom hardwar softwar system perform task dynam chang mean intellig agent observ maintain intern make perform task plan kei issu intellig agent architectur plan mean achiev goal definit action plan system view behavior agent cycl intellig agent versatil adapt system perform behavior effort achiev multipl goal uncertain intellig technolog present applic start smart client softwar robot applic area virtual realiti develop intellig applic virtual realiti model abandon static model style version move dynam model techniqu extern program languag java virtual realiti technolog capabl perform complex behavior recent attempt made role underli semant vr model relat behaviour architectur attempt approach integr virtual realiti artifici intellig theoret point view remark attempt put intellig internet intellig interact system implement java applet time integr virtual realiti technolog intellig agent architectur experi gain area tempor reason system tempor plan system vrml program motiv area develop intellig agent decid act virtual environ chapter present intellig agent architectur consist logic logic virtual chapter structur section present architectur system section introduc architectur logic discuss categori knowledg repres agent reason capabl explain virtual realiti manag unit commun logic agent execut command post section discuss implement issu section present toi world conclud remark summar main characterist framework architectur intellig agent intellig agent framework consist main layer logic agent layer virtual world layer modul view layer conceptu level implement process run machin system virtual world modul client side logic agent server side permit develop network base machin independ applic logic agent composit modul consist logic knowledg base support logic core commun virtual world modul composit consist static virtual dynam virtual object virtual virtual realiti manag commun logic core agent reason capabl reason support number knowledg base store type knowledg static dynam domain knowledg spatial knowledg virtual virtual world repres structur knowledg fact abstract maintain import inform logic core reason current world situat goal set abstract action immedi execut virtual layer knowledg base dynam virtual object avatar logic core commun unit agent commun unit virtual realiti manag unit figur virtual intellig agent architectur modul serv twofold bottom level care process commun logic agent virtual world modul top level care inform transfer logic core modul abstract move receiv send abstract action arriv virtual realiti manag unit specifi detail receiv action specif valu orient posit specifi orient path successfulli move send command virtual realiti world browser browser execut command alter virtual environ appropri perform unit notifi logic core action successfulli execut logic core updat intern extern state agent virtual gather addit inform decid step satisfi goal structur function logic core virtual space abstract virtual space logic part agent partial implement bdi intellig agent architectur heart logic part act manipul intern extern state agent produc action agent result logic core maintain knowledg base describ agent behaviour logic virtual world observ observ advanc function real situat requir sensor imag understand situat virtual realiti requir understand virtual realiti implement subset vr browser goal approach experi virtual agent defin virtual world preprocessor produc vr file process vr browser world descript knowledg complet descript virtual world term logic assert wd part knowledg observ defin function gather basic element wd observ posit observ defin term spatial access relat assert wd reason wd result acquir entiti observ attribut virtual realiti knowledg part knowledg function transfer knowledg world agent agent stand middl room observ tabl comput chair hallwai lead room case vr updat element agent move virtual world vr updat inform abstract spatial descript plan action knowledg agent maintain knowledg dynam time maintain static knowledg behaviour abil form action belief agent express expect current state world chang action set infer architectur limit singl agent action object complet belief partial knowledg multi agent includ assumpt knowledg agent belief subject erron agent track action perform architectur histori decid base past action goal intent desir abstract notion specifi prefer futur world state action consist subset desir agent pursu goal select goal commit process call format intent import pragmat implement intent structur intent larger plan defin intent plan adopt virtual agent architectur part mental structur agent basic desir agent satisfi top level goal explor virtual world agent virtual world enter explor learn time select suffici knowledg satisfi goal start explor goal satisfi lack prohibit agent satisfi rest goal top level goal defin action execut achiev assumpt hold action execut top goal partial prerequisit goal provid term kind higher level assumpt express abstract tempor descript mean top goal prioriti top level intent commit top level current activ plan mechan produc plan achiev goal plan intermedi goal intent defin action execut action part behaviour abil mention time action select virtual modul execut virtual act plan decid function manipul state agent part loop middl check inform present act step loop function function check action agent lead achiev remov goal top goal list figur sketch decid algorithm produc plan base partial knowledg agent execut virtual act visit unexplor place virtual world acquir piec inform time inform current plan order check suitabl achiev data enabl virtual intellig agent capabl adjust dynam world function work valid exist plan check inform collect act affect previou plan plan start process consist step goal current goal process involv estim goal feasibl current point time case goal estim concern select goal effici pursu check involv estim goal plan figur plan mechan agent commit action plan send command virtual realiti modul act action abil virtual act function transform world base manipul effect action carri determin action feasibl make function mention function place design implement properti world difficulti appli action model disabl agent notic role access relat mention alik refer inform world reach sensor easili model kind sensor disabl reduc access function virtual realiti manag unit receiv command perform action call action virtual act execut virtual world virtual act chang posit orient object delet replac object paramet defin move implement issu system client side server side program gatewai prolog reason determin action agent subsequ action command java applet java applet host vrml world agent exist avatar commun process place standard stream socket arrang care run applic multipl machin socket decoupl logic compon vr commun multipl agent architectur client side architectur consist vrml gui java applet act intermedi medium server vrml world commun vrml java achiev eai author eai act interfac number function vrml browser java perform order affect interact interpret chang attribut vrml world geometri time command java applet send verifi messag server send string process end logic server send signal stop data transmiss maze intellig agent find maze discov virtual repres direct vrml world order maze consist connect hallwai room object lock agent order exit maze sequenc action find blue unlock blue find red unlock red lock exit initi scene consist maze press lock kei instantli load button set agent motion start quest exit travel room agent perceiv object interact action correct sequenc find room red pick unlock blue agent store inform collect environ knowledg base gain knowledg order accomplish task find lock exit action chang environ pick automat longer exist virtual protocol applic commenc server permiss transmit data client declar readi receiv data move action paramet object move destin server decid object move destin delet action paramet object delet server decid object delet agent find correct kei unlock end messag server client declar end data transmiss figur maze agent order chang java calcul avatar orient target posit start thread rotat avatar reach expect orient move constant speed target room delet action implement remov vrml node repres object node load press button inlin command vrml figur virtual repres find blue kei futur work aim chapter present intellig agent architectur combin reason effect gui network extens order bring kind applic closer made vrml realiti model futur plan intend put agent complex vrml interact addit object expect extend reason abil agent virtual realiti metaphor direct plan develop protocol enabl agent commun exchang inform knowledg order accomplish task industri academ societi grow demand groupwar video remot remot peopl train simpl document exchang support intellig system intellig virtual agent provid servic applic acknowledg work partial fund greek gener research technolog project contract refer artifici vol theori knowledg engin vol editor agent agent architectur volum lectur note artifici design intellig layer volum lectur note artifici editor agent agent architectur volum lectur note artifici behavior intellig editor agent theoret practic volum lectur note artifici aaai press mit programm intellig commun march intern vrml thought behavior vr draft august action virtual workshop nonmonoton action omicini logic program technolog intern workshop logic program tool internet juli sr develop internet prolog applic java front inform process intern confer workshop expert system tjoa plan intern journal expert research
ML/216 6 polici iter ronald parr depart comput scienc duke north carolina decemb shorter version technic report accept neural inform process natur synthet polici iter ronald parr depart comput scienc duke nc abstract approach reinforc learn combin squar function approxim polici iter method complet polici motiv squar tempor differ learn algorithm effici sampl experi compar pure tempor differ algorithm ideal predict straightforward applic control problem approxim learn strongli influenc visit distribut state polici iter address issu result method data collect sourc test includ bicycl simul learn guid bicycl goal effici observ small number complet random trial introduct linear squar function approxim offer advantag context reinforc learn abil gener power black box method neural easi implement behavior fairli analysi standpoint debug featur engin standpoint linear method easi insight failur occur enthusiasm approach inspir squar tempor differ learn algorithm algorithm make effici data converg faster convent tempor differ learn method initi appeal attempt evalu step polici iter combin problemat koller parr present combin style function approxim polici iter oscil bad polici mdp state behavior explain fact linear approxim method comput approxim weight state visit frequenc polici evalu problem difficulti state function learn polici improv model process paper introduc squar polici iter extend benefit control problem introduc algorithm learn squar approxim permit action select polici improv model introduc result form approxim polici iter algorithm algorithm combin polici search effici polici iter data effici complet polici data collect reason sampl distribut evalu method includ simul bicycl control problem learn guid bicycl goal observ small number complet random trial recent work sutton precup address question learn function polici stochast polici directli address question polici gener markov process assum underli control problem markov process mdp defin finit set finit set markovian transit model repres probabl state state action reward function repres reward obtain action state end state simplic defin ir result easili extend gener case assum mdp infinit horizon futur reward discount exponenti discount factor fl polici result gener case stationari determinist polici mdp map action agent state function defin combin state action discount total reward action state polici exact pair found solv linear system bellman fl vector size stochast matrix size expect reward matrix system vector size stochast matrix size describ probabl transit pair pair exist optim maxim discount return state polici iter method discov polici iter sequenc monoton improv polici iter consist phase determin comput valu polici solv system polici improv defin polici arg max step repeat converg optim surprisingli small number step approxim function polici iter reli solut system linear equat find valu current polici impract larg state action space case approxim parametr function approxim form approxim polici iter address problem find set paramet maxim accuraci approxim common class approxim call linear valu approxim linear weight combin basi function oe set weight linear system system paramet form jsj jaj solv system yield solut minim bellman result function necessarili fix point applic bellman equat subsequ orthogon project note approach mean estim state function model interest set weight yield fix point function function invari step determin orthogon project space span basi function function temp result step iter temp orthogon project temp space span column column proj temp proj equal origin proj temp note standard fix point approxim method linear function except problem formul term valu state valu solut exist finit valu fl learn function previou section assum model underli mdp practic model function paramet learn sampl data sampl data tupl mean state action reward result state data collect actual episod queri gener model mdp extrem experi agent mdp desir set weight found solut aw matrix vector unknown determin priori approxim sampl recal form jsj jaj jsj jaj jsj jaj jsj jaj set fs sampl distribut ae sampl js construct approxim version approxim thought sampl row ae condit sampl term summat row sampl distribut summat govern underli dynam process sampl directli mdp approxim fl uniformli distribut sampl pair state action approxim consist approxim true markov properti ensur solut converg true solut suffici larg gener ae comput weight minim ae weight distanc project step state implicitli assign weight project minim weight sum squar error respect ae ae stationari distribut give high weight frequent visit low weight infrequ visit state easi approxim deriv set sampl combin addit yield approxim correspond combin set sampl fl fl fl fl fl fl observ lead increment updat rule assum initi fix sampl contribut approxim updat call algorithm figur due similar unlik comput function expect data markov chain featur algorithm set sampl comput valu polici long offer action choic set polici determin ad sampl singl sampl matter polici evalu note set project weight straightforward reweight sampl ad notic store requir space independ size state action space sampl incur cost updat matric time cost solv system find weight singular decomposit robust full rank matrix algorithm algorithm appli markov chain state transit influenc dynam origin mdp polici evalu includ special action extend resembl close case sampl set consist complet episod gener polici evalu requir question set sampl data number basi function oe basi function fl discount factor polici function sought matrix vector return figur algorithm bia due sampl prevent reusabl sampl properti context polici iter gain faster converg result applic case infinit continu state action space modif state action reflect basi function linear approxim result function cover entir space set continu basi function model mdp benefit comput summat row fl practic set state fairli small pair domin term summat comput result approxim gener model mdp gener sampl uniformli distribut pair state action polici iter algorithm mean learn approxim fix polici integr approxim polici iter algorithm candid determin step kei insight achiev polici improv step explicitli repres polici sort model recal polici improv polici pick action maxim comput function model determin improv inform implicitli weight arg max arg max improv polici repres implicitli finit set paramet determin demand state shown close loop simpli requir perform maxim construct matrix polici larg continu action explicit maxim impract sort global nonlinear optim requir requir determin optim action depend exact form function close form solut possibl possibl deriv comput approxim data sourc sampl singl set sampl entir addit sampl trajectori iter polici iter algorithm summar figur approxim polici iter converg approxim polici iter variant typic analyz term function approxim error action select error requir approxim polici polici function remov sourc error direct comput linear function data number basi function oe basi function fl discount factor ffl stop criterion initi initi set possibl empti repeat updat leav unchang jj return return figur algorithm includ store data evalu make problem minim function approxim error manag result initi test problemat mdp consist chain state action action succe probabl opposit effect probabl reward vector defin discount factor set clear optim polici koller parr show start polici combin style function approxim polici iter oscil suboptim polici approxim repres state function linear combin basi figur appli problemat mdp state horizont axi valu vertic axi approxim shown solid exact valu connect dash line valu action mark ffi action state number appli problem basi function repeat find optim polici iter sampl collect act randomli step figur show iter train set sampl optim polici found point weight approxim equal notic approxim captur qualit structur quantit error fairli big state visit distribut train set uniform prevent bia approxim test variant chain state reward scheme class problem practic instruct compar approxim learn true underli understand algorithm work figur show run chain dynam reward boundari optim polici case left state state converg optim polici iter train set sampl collect singl episod step polynomi approxim function give block basi function total basi function initi polici iter left state gradual discov optim iter temporarili fail good approxim improv polici figur show fail discov optim polici reward state due symmetri optim polici state left state polynomi action train set sampl singl converg iter suboptim polici resembl optim polici extent failur explain inabl polynomi approxim captur structur underli function figur show radial basi function approxim approxim mean spread uniformli state space constant term result total basi function train easili converg optim polici iter call determin approxim function set data solv fix point bellman equat discuss section direct solut minim bellman error potenti viabl altern modifi version updat equat ji figur appli chain state function polici evalu iter approxim shown solid line exact dot line improv polici iter shade action light shade top row improv polici result approxim bottom row improv polici exact function figur appli chain polynomi approxim function polici evalu iter exact valu shown dot line curv action shown dash line improv polici iter shade action light shade figur appli chain radial basi function approxim function polici evalu iter exact valu shown dot line curv action shown dash line improv polici iter shade action light shade comparison modifi version appli problem train figur figur show result polynomi radial basi function approxim case approxim function true function case exhibit oscillatori behavior polynomi iter bounc back polici optim radial basi function iter proce trap cycl iter altern polici optim polici clear fix point solut work pure solut conjectur fix point solut preserv function extent fit absolut valu improv polici approxim function improv polici exact polici iter guid direct point experi method suggest fix point solut choic practic test invert pendulum task balanc pendulum unknown length mass upright posit move cart attach state space problem continu consist vertic angl angular veloc pendulum dynam system state equat variabl paramet ffl angl ffl angular veloc ffl graviti constant ffl mass pendulum ffl mass cart figur modifi appli chain polynomi approxim figur modifi appli chain radial basi function approxim ffl length pendulum ffl forc ffl constant action space discret consist posit forc neg forc action action actual input system gaussian term varianc standard deviat simul step set control input rate begin time constant time step control agent receiv reward long angl pendulum exce absolut angl greater signal end episod penalti discount factor process set set basi function total basi approxim function basi function includ constant term radial basi function arrang grid state space state block basi function action jj jj jj jj jj jj jj jj point grid oe train sampl collect start random state close equilibrium state angular pure random polici averag length episod contribut sampl find polici number train episod grow figur show perform learn control function number train episod episod run maximum minut continu balanc return excel polici case hundr train episod failur result distribut number train episod averag balanc time step number train episod figur invert pendulum percentag success averag balanc time step averag run train set size sampl fade number sampl grow bicycl balanc problem goal learn balanc ride bicycl target posit locat km start locat bicycl orient angl ffi goal state descript vector angl vertic angl angl bicycl goal action torqu appli displac rider ae action restrict ae give total action system uniformli distribut term ad displac compon action dynam bicycl base model time step simul set function fix action approxim linear combin basi result similar full requir train data note state variabl complet block basi function repeat give total basi function weight train data collect initi bicycl random state equilibrium posit run small episod step pure random polici appli train set size averag perform shown figur data set run polici iter obtain converg iter success polici reach goal approxim km optim perform show annot set trajectori demonstr perform improv multipl step polici iter figur number design influenc perform bicycl rider problem typic shape reward distanc goal net chang distanc goal found full random sampl point occur bicycl enter recoveri imposs complic learn effort sampl part decid cut trajectori step creat addit problem termin reward signal failur approxim addit shape proport net chang squar vertic angl roughli approxim fall end truncat trajectori discount yield robust perform admit slight amount shape adjust paramet requir obtain good result problem verifi elimin learn problem experi discount case simpli project reward function column space basi function problem tweak act maxim project reward suffici obtain good perform run produc crash trial number train episod iter iter iter iter iter iter start posit goal figur bicycl percentag final polici reach averag run train set sampl run base train trial run converg iter note iter similar polici true iter weight ninth differ eighth indic converg futur work issu interest question investig distribut sampl train set impact perform algorithm issu fact approxim favor pair sampl frequent pair sampl infrequ plan densiti estim techniqu reweight sampl achiev desir set project weight distribut sampl problem initi batch sampl repres set import state visit note problem form reinforc learn method agent reach goal state random walk learn occur develop gener framework sampl collect view problem acquir sampl activ learn problem encompass determin sampl region state space sampl requir result report construct linear architectur repeat block basi function depend essenti separ weight action impract big action space construct set basi function depend state action set weight action choic basi function fundament problem explor polynomi radial basi option exist answer question domainspecif choic work domain constrain factor success reli good choic basi bad choic report learn place train sampl collect onlin version maintain window recent experi train point slowli chang environ issu explor includ domain altern project function manipul train model approxim architectur discuss present approxim polici iter algorithm call inspir algorithm algorithm store repositori sampl sampl gener dynam trajectori perform action select approxim polici iter function model contrast approach approxim polici requir sort approxim polici function natur compar algorithm memori base method recent flourish polici search comparison memori base approach method make stronger function approxim sampl implicitli construct approxim model oper function space sampl directli function project step note matrix view form compress model compel column orthonorm proper transit function reconstruct directli make interpret model base method area futur research comparison direct polici search offer strength polici iter polici search method typic make larg number small step polici updat polici function polici iter gener result small number larg step directli polici space result demonstr potenti method achiev good perform bicycl task small number randomli gener sampl multipl step polici iter achiev level perform linear function architectur requir transpar linear architectur made relev issu salient case approach direct approach function approxim data make algorithm intuit easi choic reinforc learn task futur plan investig applic method system densiti estim control project weight function approxim acknowledg make bicycl simul littman discuss author foundat greec partial support refer baxter reinforc learn pomdp direct gradient ascent proc intern conf machin page morgan san bertseka tsitsikli program athena justin boyan tempor differ learn bratko machin sixteenth intern page morgan san bradtk barto linear algorithm tempor differ learn machin koller parr polici iter factor mdp sixteenth confer uncertainti artifici intellig morgan tsitsikli algorithm nip advanc neural inform process system confer mit ng jordan polici search method larg mdp pomdp sixteenth confer uncertainti artifici intellig morgan koller polici search densiti estim advanc neural inform process system confer mit andrew stuart russel polici invari reward theori applic reward shape proc intern conf machin page morgan san sen reinforc learn machin precup sutton tempor differ learn function approxim eighteenth intern confer machin june learn drive bicycl reinforc learn shape fifteenth intern confer machin juli morgan kaufmann gener polynomi approxim markovian process journal mathemat analysi mansour polici gradient method reinforc learn function approxim advanc neural inform process system mit press tanaka griffin approach fuzzi control nonlinear stabil design issu ieee transact fuzzi
DB/217 3 basi benchmark approach spatial index structur christoph papadopoulo yanni manolopoulo philipp rigaux data engin lab lab dept aristotl univ rue st martin greec pari cedex franc abstract paper describ design basi prototyp implement basi stand benchmark approach spatial index structur prototyp system aim perform evalu spatial access method queri process data queri workload basi base modular simpl storag queri set algorithm techniqu facilit benchmark main object basi provid benchmark environ spatial access method relat queri evalu compar studi spatial access method case common framework extend support fundament featur spatiotempor data manag access method spatial access spatiotempor data perform evalu introduct spatial data manag activ area research past ten year major compon research effort continu concern design effici spatial data index method reduc queri time spatial queri process report literatur aim enhanc indic specif queri handl capabl work support european union tmr program contract number protocol spatial data index specif redesign support region queri spatial join queri direct establish robust cost model specif indic queri process function estim cost process spatial queri spatial data manag spatiotempor expect index method index behav differ buffer strategi queri profil compar perform tester care declar clear winner method independ lack gener framework extens compar studi perform compar studi lack spatial benchmark yardstick spatial index method implement perform evalu solut construct integr benchmark develop execut benchmark approach spatial index structur platform facilit increment integr multipl index queri data set benchmark run type benchmark support design test index method queri process algorithm relat work divid benchmark gener index support recent benchmark platform longer histori test rel perform research industri commun sought standard benchmark system earli benchmark dbm includ wisconsin measur number transact produc rate system transact process perform council publish number benchmark specif applic domain olap support system emerg object data base number benchmark annot bibliographi type benchmark differ type support basi attempt test entir system basi support research work modul complet index queri processor relat system includ environ visual tool index structur gist project produc gener softwar packag gener tree index structur base paradigm system similar scope basi includ la cart benchmark environ test spatial queri process algorithm basi gener object test index structur benchmark environ test algorithm tempor queri process rest paper organ section list discuss requir benchmark environ section illustr architectur basi section discuss issu spatial spatiotempor data manag benchmark explain section section conclud paper requir benchmark environ gener requir benchmark environ aid user set analyz result benchmark process specif provid rich varieti data set data object integr index integr queri process facilit analysi benchmark provid visual method view data index benchmark result discuss topic detail dataset fundament requir benchmark data benchmark environ provid benchmark design data applic domain natur data benchmark run greatli influenc result spatial applic index structur specif design point data index structur outperform previou set index data repres object line region benchmark environ provid varieti data accommod aspect benchmark part data data current larg scale public artifici data provid index structur environ number index structur provid part platform implement variant ad user perform experi comparison involv design issu exist structur requir detail knowledg intern implement practic point mean structur share common design essenti data point window lower platform provid build block creat structur minim effort save tediou task program memori manag strong integr structur platform impli design made gener implement advantag exist function queri process environ number queri process algorithm accumul environ penalti implement effort techniqu algorithm integr benefit research extend platform ambit current work provid open queri processor set commonli oper extern sort simultan integr exist oper algorithm requir import limit benchmark work comparison isol structur permit build arbitrarili complex algorithm oper extract librari illustr approach exampl imagin compar result consist record sort result consist record id address record perform comparison algorithm complet fetch record sort set record context spatiotempor readi mix structur algorithm tempor spatiotempor data design benchmark environ merg techniqu issu clean eleg set permit accur report result basi queri execut model gener encompass relat spatial data make easi integr method analysi benchmark result benchmark intend show consumpt system disk function data set size environ benchmark produc statist cover variabl benchmark varieti resourc provid statist perform individu index search time convent benchmark result plot graph resourc vari paramet graph show index progress outperform size data set investig justifi claim rel perform increasingli import explain reason differ perform factor inferior index eventu requir doubl number disk author consid question form result analysi basi design support compar perform spatial index larg number queri main differ method group object minimum bound rectangl group minimum bound circl found outperform structur author investig differ benchmark data calcul averag volum diamet bound shape leaf node structur diamet rectangl diagon produc graph volum data size diamet data size graph show averag volum rectangl smaller circl averag diamet rectangl larger put group point small volum region group small diamet region queri benchmark queri short diamet queri small superior work consid ad hoc data mine process benchmark result benchmark environ support analysi simpl convent perform graph visual visual requir data index result data user data set benchmark run benchmark artifici data difficult verifi data tool give visual space distribut data aid user greatli benefit view structur tree fanout analyz result clear visual present complex result kei factor understand accept set requir influenc design basi system emphasi target requir consid fundament fulfil consid futur work section explain system attempt satisfi fundament requir illustr architectur describ intern compon basi architectur section describ fundament compon basi architectur outlin architectur depict fig platform implement run top unix window nt platform organ modul storag manag cach sam toolkit set commonli sam access defin design pattern support easi develop final queri processor librari algorithm design gener framework iter binari file modul flush fetch buf pool buf pool write read queri processor sam toolkit index support iter support iter sam join join sort grid file storag manag extern data sourc figur basi architectur modul defin level design easi custom extens depend queri process level easili design add add spatial oper algorithm queri processor decid implement queri process modul top buffer manag modul storag manag storag manag essenti charg manag set binari file store dataset sequenti collect sam sam index refer record index data file record identifi binari file divid page size chosen creation page view arrai provid structur page point page structur header arrai record page format easi access record rank interfac format page safer invalid oper access limit prevent inform put page object class defin minim behavior expect essenti content locat storag manag predefin list includ atom type class hold address class repres class easili extend type record built tupl object record main object basi deal queri execut essenti tree oper consum produc record basi dynam type object type deliv type object demand object dynam instanti record buffer manag handl buffer data file index assign buffer buffer pool handl indic flexibl assign memori part queri execut plan buffer pool cach lru fifo replac polici page pin memori pin page flush algorithm requir page access uniformli access page interfac provid buffer manag sam toolkit main type file handl storag data file sequenti collect format page store record type record data file access sequenti address iter sam structur collect index entri record type kei record address kei geometr mbr implement sam grid pack rtree fig show built dataset connecticut state str pack figur variant leaf basi queri processor import design choic platform evalu queri execut plan gener queri optim algebra view queri languag queri transform repres binari tree captur order sequenc physic algebra oper execut leav repres data file intern node repres algebra oper edg repres dataflow oper exampl algebra oper includ data access spatial spatial common framework queri process iter function node iter pipelin execut multipl minim system resourc requir intermedi data consum gener record produc consum iter iter record intermedi result oper store pipelin oper specif iter call block sort iter open prepar input sourc alloc system run iter step algorithm produc record close end iter relax resourc design offer major join sort sort figur queri execut plan simpl creation iter fairli easi extend basi ad provid defin conveni interfac close provid support integr basi iter librari trivial illustr featur exampl spatial join queri assum exist spatial index simpl relat scan tupl iter execut window queri index kei record id final record id access iter observ basi dynam construct type type record index simpl type infer type record manipul includ intermedi automat type manag import featur facilit specif assum join algorithm construct structur match exist index suffic save replac queri execut sequenc close root denot retriev involv propag oper tree basi collect statist page fault perform paramet execut platform basic modul sort iter flow comparison perform extern introduc sort iter fig sort data flow output join compon access page issu random read lead access page queri execut model permit construct extend librari defin physic algebra queri evalu modular design support type infer iter develop easi integr compon conveni framework experi enrich platform tempor group spatiotempor structur algorithm spatial spatiotempor data handl access method perform vari modifi characterist data highli cluster data degrad perform uniformli distribut data basi project support fundament type ffl data sequoia ffl synthet obei distribut point data captur characterist data applic manipul chang data properti synthet data support tabl summar import properti synthet data properti descript data type line polygon popul object gener distribut fractal number dimens address space coverag object cover point address space tabl import properti synthet data set gener requir make gener data artifici simpl uniformli distribut random placement rectangl statist properti gener data iter job open oper appendix short descript control user user control distribut object space size shape object data gener meet requir data gener control fundament larg number data set gener data port basi intern part dataset enabl gener benchmark base synthet realist data set user satisfi data set gener port basi perform evalu report base data set gener gener spatial spatiotempor index structur build support underli data set basi support space support space consid applic requir data manipul dimens spatiotempor index mechan evalu exploit straightforward solut index multimedia dimens time basi support index instanti pass input paramet filenam spatiotempor data construct index spatial attribut data util index time interv overlap implement easili perform modif implement figur primit data type support primit data type defin enabl index queri process fig fundament data type support line segment point trajectori point trajectori view collect consecut posit space main type support spatiotempor benchmark move point move point gener instanti number point trajectori trajectori correspond collect record user predefin type gener rotat mbr gener inherit class ad member variabl rotat instanti object class definit implement enabl arbitrari number dimens strict type check spatial spatiotempor data type integr method enabl process intersect method invok rectangl point trajectori determin intersect invok test point rectangl imposs includ method method defin inherit base class major benchmark perform research effort focu spatial data work perform evalu spatiotempor access specif focu case move point move point object point trajectori challeng index trajectori effici support spatiotempor queri issu index separ index entri creat object posit index creat consecut trajectori posit group index creat index occupi space index critic updat number move object larg fact index hold posit elimin search trajectori queri inform maintain index evid strategi suit queri type interest issu investig type index side effect index move point treat time dimens index ffl mbr continu grow larger data chang posit time slot ffl mbr enlarg critic perform due overlap node ffl index grow independ mobil object studi issu respect import system paramet size mobil number move size buffer complex queri execut plan conclud remark futur work basi prototyp system aim perform evalu spatial access method spatial queri common framework previou section discuss fundament issu design implement basi system proce extens improv core basi design implement plan deliv public basi feedback research work spatial spatiotempor target studi perform spatiotempor access basi benchmark platform recal spatiotempor access method lack perform evalu method aim provid flexibl queri evalu incorpor dynam plan integr modul mean friendli user interfac acknowledg author grate prof michel scholl comment suggest improv paper appendix fundament class basi set class import illustr tabl short descript appendix iter give appendix descript iter iter open prepar input sourc alloc system run iter step algorithm produc record close end iter relax resourc illustr trivial iter sequenti access data file implement open open data set cursor begin read file page address return current record father node set cursor close close file tabl summar iter studi class descript abstract simpl storag manag implement buffer manag manag number buffer pool manag number basi abstract file abstract base class object serial disk abstract record creation record attribut type page abstract object inherit abstract base class spatial access method abstract base class index manag file dataset inherit implement inherit implement inherit implement access method record part index abstract rectangl abstract point abstract line segment abstract trajectori collect line segment inform perform method disk construct queri execut plan tabl fundament class basi open close open retriev close file advanc open call close input open read close file sort open input process merg step fill buffer tmp file buffer sort flush run merg step left close input open input pair close input put record buffer read record sort record read record buffer sort record id execut prepar open pair close input init path page pin sort page requir sort pin open close input build seed tree input close left input init str open close input build str close left init sam open pair close input sort sort entri slice match leaf sort leaf sort slice tabl descript iter refer measur transact process process optim spatial technic report maryland colleg dewitt systemat vldb kriegel effici robust method point acm sigmod atlant kriegel process spatial join rtree acm sigmod washington adapt schedul larg queri cikm annot bibliographi benchmark object acm sigmod tempor group queri tempor object cikm bentlei algorithm find match logarithm expect acm transact mathemat introduct spatial vldb spatial join la intern confer scientif statist dynam index structur spatial acm sigmod evalu techniqu larg acm comput naughton search tree vldb spatial access point vldb kamel pack cikm kamel improv vldb kline time integr septemb index structur nearest neighbor acm sigmod simpl effici algorithm ieee icd integr queri visual explor larg acm sigmod spatial inform academ lo cv design implement seed effici method spatial ieee transact knowledg data alloc strategi complex support cikm rigaux perform evalu spatial join process intern confer larg spatial kellei neighbor acm sigmod san sequoia storag benchmark acm sigmod washington roussopoulo dynam index vldb bureau washington transact process perform council tpc tpc benchmark version decemb transact process perform council tpc tpc benchmark june acm transact han improv index structur spatiotempor symposium spatial data handl
HCI/218 4 perceptu comput perceptu comput comput vision diploma thesi june bernt schiel prof schiel institut scientif comput eth abstract futur success ubiquit comput depend big part applic adapt environ act thesi set goal explor perceptu comput ubiquit comput vision thesi address task present literatur survei term context definit present set applic ubiquit comput research commun classifi comparison classifi applic applic envisag platform result find applic reactiv gener wider rang context inform applic comparison conduct explor differ exist applic envisag deriv percept task determin close locat prove promin task describ wide rang sensor foundat explor perceptu comput laid step percept properti singl sensor analyz integr techniqu multipl sensor explor idea solv percept task present promin task determin proxim explor greater detail proxim hierarchi classifi physic paramet determin semant proxim measur hand categor distinguish dynam environ static hand dynam attach object static state experi shown semant proxim inform obtain varieti sensor acknowledg project fund part commiss european union contract swiss feder offic educ scienc author member group contribut moral support express appreci oliv frank develop albert weiss design electr circuit thoma von tip prof bernt schiel advic guidanc period thesi content introduct vision task outlin chapter overview literatur survei applic context definit model applic applic summari percept sensor overview technolog requir sensor percept task percept taxonomi singl sensor percept collect percept sensor process model sensor integr architectur issu sensor integr solv percept task summari model recogn proxim hierarchi proxim hierarchi experi hardwar experi experi summari summari futur work problem descript sensor vi circuit diagram microphon amplifi photo resistor motion detector bibliographi chapter introduct comput power commun bandwidth electron devic steadili grow devic smaller cheaper time parallel develop field sensor research make fast progress develop power smarter sensor actuat combin field lead highli distribut sensor system commun wirelessli technolog basic build block vision ubiquit comput comput integr everydai live notic sensor technolog ubiquit comput applic awar situat context surround thesi part ubiquit comput project vision project detail section project project conduct european disappear comput initi belong ist societi program fund european commiss swiss govern project commenc earli endur half year joint effort offic karlsruh technic research center finland interact institut göteborg distribut system group swiss feder institut technolog perceptu comput comput vision group swiss feder institut technolog vision attach small comput devic everydai enabl interconnect inform artefact comput devic cheap smart label contrast smart label perceiv environ commun wirelessli behavior customiz specif applic design devic enabl applic devic call big coin make everydai object importantli enabl object dynam collect object emerg collect behavior integr number sensor devic enabl object perceiv environ enabl object share knowledg surround close object understand context enabl toi access state give basi interact chapter introduct view nerv end everydai thing connect sort comput platform serv platform applianc artefact applic point todai bar code smart label push boundari real virtual world track real world object give access situat relationship object involv enabl interest applic work thesi prior work hardwar develop prototyp parallel effort made technolog platform base microcontrol bluetooth commun modul platform base pic microcontrol conjunct commun rf monolith hardwar architectur distinguish core board sensor board core board consist microcontrol commun sensor board consist set sensor possibl simpl microcontrol simpl preprocess accomplish design enabl product sensor interchang architectur figur base microcontrol kb programm flash memori kb bluetooth modul commun devic task outlin main object diploma thesi explor perceptu comput techniqu devic concept collect awar great import dynam combin sensor coordin make environ situat origin problem descript attach appendix chapter overview figur devic integr pic mhz mhz commun board sensor interfac board power suppli cell question inform distribut sensor address answer question overview exist sensor techniqu acquir combin sensor evalu specif applic chapter overview chapter start present literatur overview research definit term context present compar survei applic project field ubiquit comput wireless sensor network idea applic present compar applic found literatur survei comparison conduct basi adapt research conduct abowd al find applic reactiv gener wider rang context inform chapter overview todai sensor technolog show main field sensor research concern sensor mem technolog big portion research investig develop smart sensor sensor categor percept facilit discuss percept method percept deriv applic chapter present percept task discuss end chapter percept concept explain section singl sensor percept collect percept chapter present concept proxim close relat percept taxonomi section demonstr simpl experi detect class proxim devic light acceleromet movement detector system chapter introduct final chapter draw summar thesi outlook interest futur work chapter literatur survei applic chapter overview recent work field ubiquit comput applic section introduct term quot popular definit concept model context part survei current context awar applic natur limit applic analyz comment idea special applic literatur overview percept techniqu includ chapter cover chapter context import applic context rapidli handheld ubiquit comput promin exampl environ react adjust context environ section give short overview current research project defin term describ approach model context definit past term context defin conceptu wai defin context exampl context defin ident nearbi peopl object definit detail includ time temperatur defin context exampl give definit find piec inform context includ clear resolv defin simpli give synonym word context context refer definit definit extrem difficult appli practic definit context dei abowd context inform situat entiti entiti object consid relev interact user includ user applic chapter literatur survei applic definit classifi formal definit synonym term indirectli defin context novelti definit situat entiti act context previou definit entiti user applic definit term singl collect applic design filter import context inform abowd al defin categori context activ time answer question abowd al call categori primari context type act indic secondari context ident person find address telephon number case multipl piec primari context deriv secondari context inform locat date forecast provid desir weather previou definit applic applic inform context adapt context inform abowd definit includ applic repres context user adapt behavior specif gener definit system context provid relev inform servic relev depend task chang includ applic repres context adapt classifi monitor applic fact import section describ applic model section present concept model context idea context model dimens activ activ describ task user engag gener behavior environ describ surround user includ physic social current locat weather condit activ environ stand statu devic dimens context research idea context combin explor context set hold phone hand phone phone tabl walk devic stationari usag car bu train clear context set combin phone lead meaningless walk devic phone tabl design context set lead determin sensor result context set combin structur approach model context present context model hierarch manner abstract concept concret physic featur top level separ human factor widest physic environ made human factor divid social environ user task categori physic environ divid infrastructur applic locat split hierarch condit categori divid valu featur determin actual context addit context hierarchi usag histori inform part context inform idea relat present dei abowd identifi type primari context time activ context type answer question act indic sourc contextu inform ident acquir context person phone number email address type inform classifi secondari context show piec primari context index inform space find set secondari context case piec primari context extract secondari context inform find weather forecast forecast model context context inform servic consist entiti state entiti person artefact locat state artefact state chang model context type artefact model gener state close built make model bit artefact repres node relationship repres edg percept taxonomi present section wai model repres context inform compar model present percept taxonomi address task describ context sensor model applic point view respect complementari approach applic chapter give overview current applic field ubiquit comput main reason conduct survei find specif context recognit task perceptu comput idea applic describ set applic categor wai discuss analog differ cyberguid guidebook import practic place locat interest categor hotel restaur thing book tourist locat inform cyberguid applic address problem ad locat awar simpl form orient inform context awar give depend locat respond queri star hotel build built cyberguid implement version indoor outdoor sensor pack esp project concern monitor physic condit human extrem situat accomplish sensor pack varieti comput power short rang radio commun sensor pack expedit sport event monitor physic condit experi monitor coral chapter literatur survei applic context awar telephoni initi call mobil phone user awar situat person user context partner advanc call describ simpl setup context inform receiv set call caller decid base place leav messag cancel call work augment everydai object context awar basi research cup infrar commun multipl sensor detect hot user drink cup set cup close set applic decid meet cup mark room occupi situat found wrist watch warn user drink hot autom machin start finish cold ambient research ambient transmit activ workplac user feel person room fact transmit sound creat move cup type keyboard parctab parctab devic similar todai pda includ infrar commun locat awar system develop experi ubiquit comput offic environ applic implement demonstr present inform room user user find nearest resourc attach unix directori room post note enter file shown locat person carri parctab tool work observ anim field note weather locat happen autom tool pda augment locat inform concentr actual note time locat smart dust goal smart dust project develop autonom commun devic smaller cubic integr mem main processor commun devic promin applic area smart dust sensor network includ applic battlefield transport applic idea virtual glue smart dust acceleromet person person type move finger product qualiti monitor inventori control area work applic numer applic interest mention applic manner cover big part field ubiquit comput applic wai categor applic describ appli wai categor applic context inform classifi actual type context inform classif applic type methodolog divid applic class class summar applic share goal present context depend inform servic user class applic execut servic automat contextu condit met class summar applic tag inform form context context inform show classif applic wider basi applic compar includ section present inform servic cyberguid sensor pack snap smart dust ambient context awar telephoni activ badg olivetti automat execut servic tag inform context tool note class clear pure monitor applic fit present inform directli arguabl true chang behavior depend context section classifi categori frequent usag monitor applic view analyz data interest applic resid class applic easiest form applic chapter literatur survei applic activ ident locat time cyberguid sensor pack context awar telephoni ambient parctab tool smart dust tabl applic classif context type classif applic context type classifi analyz type context inform acquir make appli context type section locat time tabl depict classif applic context type evid locat close activ user activ user difficult percept task goal activ restrict applic task restrict defin set activ evid type context broken finer specif categori locat context type subdivid absolut locat inform rel locat kind devic type context inform cover spectrum context inform applic humid light difficult classifi context type possibl classifi condit state turn type locat inform applic previou section type applic section present idea applic imposs concept evolv applic vision applic state larg number deploi everydai object object move form famili alik object resid environ frequent chang inher context awar access context idea vision small number concern everydai object idea inspir wai decid describ vision restrict prohibit idea survei warn hospit heard accid hospit happen medicin mix correct medicin wrong nice prevent patient applic give warn medicin deliv patient treatment give warn medicin close close patient mean medic resourc delic monitor qualiti check constantli blood suppli warm sunlight scenario problem tag medicin possibl tag packet medicin question medicin unpack deliv patient cloth matcher smart cloth learn time worn rememb cloth combin tie shirt match chose pair match bag notic pack bag make forget thing adapt behavior specif user learn habit custom awar good good smart control price tax calcul finer granular good long higher price road tax product market chang cost depend condit big suppli left price bad price collect monitor construct site build owner construct manag great advantag construct visit site stage build process set tool wai tool tag find job progress determin part work concept tag tool price estim specif job build compani provid mainten tool logist inventori control field logist inventori control applic possibl good record condit inform onlin qualiti monitor optim recogn danger situat advanc prevent happen chemic store detect close give warn call multitud exampl kind good make sort food event food experienc high level regist thing parcel surveil transport rout event time chapter literatur survei applic ing insur chemic industri sort surveil applic retail give estim long part part moment long destin reason delai easier estim time span deliveri automat bicycl alarm system automat bicycl alarm lock easi implement bicycl owner owner bike move wai bike trigger alarm feel movement game smart build block build block perceiv plai find player fun listen children make shout cry distinguish flash beep attract attent lead children game toi learn wai plai give suggest wai children plai check mechan part ski measur strain endur life time secur critic applic chang part sell hand danger warn submit extrem situat special applic special technolog sector secur applic main danger credit card electron cash withdraw system possibl card secur type applic import industri consum secur carri credit card work close credit card integr user carri time perform task identif authent gener concept reappear enabl object belong good cloth matcher applic cloth learn time cloth belong bag applic similar aspect opposit object found hospit warn applic inventori control danger chemic store abstract enabl everydai object augment capabl learn usag pattern abil notic usual concept simpl form usag pattern interest analyz usag pattern everydai action perform chronolog order lead applic applic fit vision automat bike alarm machin part surveil focu everydai object standard problem special machin part surveil domain specif solut optim exact kind applic summari contrari vision develop gener applic platform interest model type applic find competit compar applic idea previou section categor section categor divid applic class summar applic simpli present context depend inform servic user categori summar applic execut servic automat context categori applic includ tag context inform retriev present inform servic hospit survei construct site monitor logist inventori control check mechan part automat execut servic hospit warn logist inventori control game smart build block automat bicycl alarm cloth belong bad bag awar good secur applic tag inform context remark made applic resid categori categori center vision concern everydai object lot interest applic found place categori servic execut automat warn type applic add obtain compar applic chapter applic reactiv wider rang context inform remain find applic technolog difficult task hard type applic success futur summari section chapter dealt definit term context contextawar literatur survei conduct find wide rang definit varieti concept repres model context overview context awar applic project field ubiquit comput wireless sensor network context definit abowd chapter literatur survei applic al found applic classifi categori categori divid applic type context inform result classif show type context inform locat inform present idea applic classifi manner main differ applic found literatur abil react unforeseen event reactiv possibl react restrict react give chang intern state calcul awar commun world power commun enabl form react devic chapter percept task deriv set applic overview percept method chapter percept chapter explor field percept context section groundwork percept laid give overview sensor work principl set interest percept task applic previou chapter reader overview percept taxonomi classifi physic paramet class lai groundwork methodolog sensor percept present part percept divid section singl sensor percept collect percept section classifi discuss sensor amount data produc featur deriv singl sensor list compar collect percept section present model sensor process discuss algorithm wai integr sensor data list conclud chapter present idea solv deriv percept task sensor section give short overview exist type sensor short explan sensor work set sensor compar requir project final present research sensor field overview sensor devic physic variabl environ physic variabl paramet system exampl physic variabl pressur light physic variabl measur electr variabl output signal electr natur sensor physic function aspect physic aspect sensor describ sensor made form thermomet chip function aspect sensor describ sensor abstract read thermomet classifi sensor compar work sensor activ sensor work emit energi form detect interpret return energi passiv sensor simpli detect environ emit energi sensor energi activ sensor exampl activ sensor radar laser rang finder imag chapter percept sensor temperatur sensor passiv sensor import characterist sensor measur resolut abil reproduc measur smart sensor sensor system sensor function measur physic variabl output signal process simplifi sensor applic simpl transform domain extract featur thermomet built output hot technolog import wide rang kind sensor introduc basic type sensor function sensor organ physic paramet measur magnet sensor measur earth magnet field compass detect metal artifici magnet field applic magnet sensor industri environ posit detect revolut count frequent task magnet sensor function wai common effect metal chang resist depend weak magnet field pass direct build magnet sensor semiconductor resist strong magnet induct appli phenomenon hall effect occur charg carrier move materi experi deflect appli magnet field sensor work effect common technolog compass applic acceleromet measur forc graviti forc graviti unit measur gravit constant equal acceleromet measur measur measur sensor measur direct simultan acceleromet semiconductor basic physic simpl mass spring system mass fix spring measur movement mass capacitor mass plai role plate capacitor sensor move mass move characterist capacitor figur show acceleromet light sensor lot consum electron infrar industri applic measur posit part light sensor made normal sensor camera flash light activ sensor figur mem acceleromet analog devic sensor wide spread lightweight sensit damag drawback special applic imag sensor wide rang applic surveil consum electron toi sensor resolut price rang main compet technolog ccd coupl cmo technolog imag sensor main drawback high price product creat special factori process produc cmo imag sensor produc standard product process make ram bring cost sensor exist machineri main drawback cmo imag sensor signal ratio ccd sensor mean imag qualiti good smart imag sensor develop simpl imag process sensor sensor includ edg extract motion detect motion extract task deleg extern processor call signal microphon convert acoust energi electr signal technolog microphon work differ qualiti product cost common microphon consist capacitor made fix metal plate materi perman polar creat charg insid capacitor sound wave move capacit devic control output signal temperatur sensor wide rang technolog simplest resistor sensit temperatur modern temperatur sensor produc integr circuit high linear compar simpl temperatur sensit resistor produc cheapli sensor includ convert fingerprint sensor made cmo imag sensor special temperatur sensit cmo devic applic devic requir identifi laptop handheld devic chip card figur imag microphon capsul infrar movement detector apex angl infrar sensor commonli made sensit infrar rang electromagnet wave applic remot night vision distanc motion sensor side visibl spectrum radiat radiat emit sun fire radiat reach sun call chapter percept portion radiat absorb reach earth emit type fire type radiat special sensor exist commonli made pressur sensor industri applic measur ga liquid pressur air pressur measur common applic pressur sensor work bit microphon membran direct contact measur substanc membran act side capacitor movement membran measur resist induct technolog measur pressur work effect materi polar crystal pressur appli mechan deform result electr charg humid sensor made capacitor incorpor absorb lose coeffici capacit devic lot distanc measur sensor setup depend applic laser infrar technolog distanc measur rang centimet forc measur sensor sort applic electron passeng detect car seat industri applic imagin interest technolog forc resistor consist resist materi contact interlac resist materi forc appli smaller resist contact forc measur sensor built mention effect lot wai build forc devic mention sensor lot special wide rang chemic sensor detect kind fluid smoke detector common sensor smoke detector work chamber devic measur disturb light sourc type sensor wind sensor measur speed direct ga motion sensor industri applic fulfil optim specif environ measur flow insid pipe research sensor develop sort industri robust reliabl sensor make sensor smaller cheaper ongo goal field system develop rapidli past year favor technolog provid featur mem technolog integr mechan system system sensor produc cheaper smaller practic field classic sensor context mem technolog task sensor solv mem good introduct overview mem technolog steadili goal sensor research li integr function sensor signal condit addit function sensor smart sensor extend addit edg movement detect imag sensor voic recognit algorithm microphon featur imag sensor percept task requir sensor effort design hardwar section full hardwar design scope requir obstruct detail design constraint natur power import constraint mobil devic sensor power great import devic run low voltag possibl produc higher cost power sensor suppli voltag volt found prefer output format sensor vari simpl sensor vari output voltag current signal classifi analog sensor kind output signal convert digit signal todai microcontrol integr signal vari strong amplifi modern sensor offer digit output format common serial bu format common protocol microcontrol implement specif easi interfac digit sensor protocol implement hardwar implement softwar sampl reproduc characterist sensor characterist import sensor applic sensor greater direct direct sensor direct point attach everydai difficult sensor direct complet vision cheap cost sensor low sensor small avail sensor small number prohibit problem cmo imag sensor hard appendix set sensor list technic detail percept task explor percept mechan inevit idea perceiv chapter motiv number percept task deriv applic chapter give applic higher prioriti realiz task greater import applic applic cyberguid main context inform simpli locat user focu user attent interest find taxi step determin sort inform find orient user context awar telephoni applic open wide spectrum percept task user place call partner activ engag activ give travel bu plain chapter percept privaci aspect plai promin role decid context determin transmit partner implement project percept mechan user set context manual decid inform post world notic meet check collect cup meet tabl applic notic user start drink alarm hot react hot sort percept task close link fact cup enabl applic tool applic implement locat awar context inform applic design specif accommod multitud percept task hospit applic percept task determin piec medicin packet close prepar person close ly trai medicin tabl cloth matcher applic enabl cloth determin person dress cloth dress form proxim object bag object learn belong applic enabl object learn usag pattern learn usag pattern percept task consist multitud smaller percept task appli order mention applic detect proxim main compon learn usag pattern construct site monitor applic pose set percept task goal determin job work enabl tool filter percept task job list analyz percept task natur game smart build block goal detect amount fun children plai block problem address analyz reaction children show experi make happi applic simpli monitor environ subject awar check mechan applic notion proxim enabl object fulfil list varieti percept task summar locat user orient user close room indoor peopl close pass ly carri move percept taxonomi environ object static light ambient dynam motion light light acoust door tabl percept taxonomi dress notic pack bag notic train percept task list word close subdivid room interest find sort voic speak telephon peopl peopl shout argument end chapter present idea solv percept task varieti sensor percept taxonomi comprehend varieti sensor classifi physic paramet measur percept taxonomi physic paramet appli environ specif classifi physic paramet static dynam tabl depict categor static condit physic condit percept class chang slowli describ environ widest dynam condit includ movement light conclud peopl close physic condit directli object subdivid dynam static static condit refer altitud tilt object dynam object condit classifi object wind light relat directli induc object movement make hard differenti condit condit relat object situat wind sensor object imposs object induc wind natur wind environ show type sensor resid multitud percept class percept class feel work type sensor singl sensor percept start discuss percept techniqu focu singl sensor percept discuss characterist sensor section discuss featur extract type sensor chapter percept classifi percept compar amount output data produc time period imag sensor produc huge amount output data compar temperatur sensor interest compar characterist high amount data mean algorithm extract inform high comput cost remind fact low comput power devic tremend import altern comput intens algorithm devic transmit data stream server devic comput power trade comput power commun bandwidth clear section collect percept issu relev tabl sensor amount data produc list sensor produc biggest amount data imag acceleromet fingerprint sensor experi hardwar platform shown amount data produc microphon manag captur imag simpl imag sensor save offlin main research field singl sensor percept concentr sensor produc big amount data lot research field auditori context recognit good overview audio signal classif present field comput vision wide develop research singl sensor percept interest classifi direct temperatur air pressur sensor humid total undirect sensor imag sensor infrar motion detector simpl light sensor inher direct advantag undirect sensor output directli compar sensor direct hard compar output sensor orient section method complementari sensor give orient inform output direct sensor compar fourth column tabl list featur extract respect sensor interest note sensor output greater amount data deliv featur directli link greater comput cost magnetomet measur magnet field orient inform obtain monitor orient inform time movement detect note accuraci magnetomet degrad sensor close metal lamp post hand environ featur deriv acceleromet read dynam static natur hand movement pattern vibrat measur hand tilt acceleromet deriv angl gravit forc simpl light sensor photo determin ambient light level detect fluoresc light filter correct frequenc bia distinguish indoor outdoor situat imag sensor kind featur extract amount comput power basic algorithm includ edg motion extract imag differ advanc imag sensor featur built special type discuss detail collect percept sensor data direct featur magnetomet low movement acceleromet medium partial movement vibrat light low frequenc imag high microphon high partial level temperatur low level fingerprint high ident detector medium movement proxim detector low distanc air pressur low altitud humid low level forc low level chemic low concentr smoke detector low level wind low speed tabl percept singl sensor microphon wide varieti featur lot featur extract algorithm high comput cost featur includ speaker classif auditori environ level detect fingerprint sensor special sensor user place finger directli sensor identifi fact sensor activ user make attract applic humid air pressur simpli repres physic sensor produc lot output data interest featur extract collect percept reason collect percept techniqu reliabl improv fault toler practic reason collect percept open possibl perceiv situat comprehend singl sensor setup substanti higher cost section discuss basic sensor process model demonstr concept appli distribut sensor network give overview semant method sensor integr outlin algorithm discuss architectur issu sensor integr design distribut sensor network attach great import characterist wireless commun discuss give idea solv percept task section sensor process model sensor process basic task context recognit figur show simpl sensor process model main task integr analysi acquir data step process perform chapter percept form collect data detect abil commun resourc process newli acquir form featur extract cue calcul transform sensor data inform cue includ varianc deriv case appli scale transform raw sensor data cue extens research indoor navig techniqu process calcul cue data cook step calcul cue integr data set sourc step call data fusion integr process depend type relat sensor data discuss type relat sensor data depth section fourth step sensor process model deal analysi integr data outcom process sort process call make analysi process acquisit process integr analysi physic variabl data scale data integr data figur sensor process model sensor process system make step model process step requir type sensor process step depend applic requir evid singl sensor system integr process sensor process system organ hierarchi subsystem central sensor distribut task comput sensor data transmit central unit step address depend sensor architectur requir huge amount commun bandwidth distribut process step reduc amount data commun imag data evalu smart sensor section digit signal processor cue movement extract situat make distribut part integr analysi process case influenc subset independ global pictur show level sensor process model distribut model repeat part collect percept sensor integr step sensor process model concern integr data multipl sensor section classif type sensor data relationship data number algorithm sensor integr illustr arriv good integr data numer issu solv difficult compar interrel inform type sensor task sensor data import problem address relat locat sensor posit place perceiv event notic event close orient direct reliabl sensor inform gener problem reliabl multipl sensor multipl sensor introduc contradict compar data multipl sensor synchron time great import time synchron wireless network research field section discuss detail issu commun wireless network subject disturb sensor break run sensor task chang rapidli data fusion techniqu wireless distribut sensor network issu account relat type sensor data determin sort sensor integr present categori sensor integr method competit integr term competit integr process combin redund data data acquir replic theori ident practic subject statist variat sensor read provid faulti inform complementari integr integr partial overlap inform sensor complet inform speak complementari integr partial inform origin type sensor orient wai field type sensor provid complementari inform physic phenomena type integr faulti data lead wrong cooper integr term cooper integr close complementari integr main differ partial sensor inform overlap cooper type data faulti sensor read lead wrong global pictur case independ integr total unrel inform integr call independ integr result simpli extra data field type independ inform tempor integr class describ integr sensor data sampl point time result time sequenc sensor data spatial integr sensor posit spatial independ data accumul locat sensor spatial movement person reach separ integr techniqu unnatur fusion task requir combin techniqu worthwhil studi method categori classif adopt chapter percept algorithm multisensor process special algorithm step sensor process model chapter touch methodolog resid level sensor process model algorithm work level data acquisit level data integr evid big number algorithm featur extract cue calcul fourth step cover wide field analysi categori directli deriv sensor process algorithm distribut inform sensor type algorithm resid layer depend layer carri distribut fashion direct algorithm data centric paradigm rout sensor inform network algorithm resid acquisit level sensor process make inher distribut direct manipul acquisit level switch sensor algorithm call master node set sensor node set form optim criteria depend applic object master node sensor switch applic master node describ local algorithm elect extrem sensor form widest baselin sensor network demonstr applic locat extern object triangul integr level approach field statist data analysi bayesian infer method combin data multipl sensor calcul probabl event occur sensor classifi integr analysi categori chapter make bayesian infer combin data microphon light sensor architectur issu sensor integr network topolog factor influenc design multisensor data acquisit system firstli import distinguish type network static network topolog dynam network discuss make wai build logic topolog time interv synchron architectur issu distribut sensor network decid clock model technolog yield synchron distribut system estrin work method time synchron wireless sensor network synchron method design goal minim power consumpt mind node interest timestamp inform clock immedi order synchron calcul correct time data record collect percept power consumpt mention paragraph power consumpt wireless devic major issu design kind algorithm architectur devic built sleep save power figur show hierarch model sensor node wireless commun capabl includ main process unit commun modul setup includ dedic digit signal process unit power consumpt order mention preprocessor energi commun unit energi consumpt type sensor vari lot energi save mode cpu commun modul total switch sensor preprocessor work sensor measur interest chang preprocessor wake main process unit cpu decid inform valuabl node activ commun modul import note work architectur applic requir constantli data measur contin tradeoff commun bandwidth comput power clear sensor preprocessor central process unit power consumpt figur abstract setup wireless devic solv percept task commun modul section present idea solv percept task pose section idea show sensor collect arriv end type sensor dispar sensor chapter describ experi conduct solv percept task describ idea solv percept task conclud abstract concept won idea proxim reason section task find close great import sensor find factor close devic main concept find devic encount synchron event experi light hear auditori event problem sensor gener mislead data close light sensor upsid chapter percept measur light problem exist direct sensor minim problem direct sensor combin sensor give inform orient devic task magnetomet sensor consid pair equal type encount synchron event substanti harder fact dynam network dispar sensor imagin combin dispar sensor combin sensor notic event environ movement detector light sensor person walk past devic creat person walk light switch switch combin light sound interest implic light sensor microphon notic event door close chang light level door close time differ event find close devic evid light room event person walk room measur slightli time movement detector posit differ case sensor posit opposit end hallwai chapter present proxim model base percept taxonomi section order theoret approach solv percept task differenti indoor outdoor task differenti indoor outdoor import multitud applic address wai detect indoor offic build filter compon light fluoresc light detect detect indoor measur weather wind speed build paramet constant outdoor vari substanti measur compar weather bulletin match type exist indoor outdoor technic problem gp work sensor differenti form transport task notic group transport import applic awar good logist inventori control applic gener argu transport vehicl attach transport vehicl tag vital transport acceleromet microphon differenti transport train acceleromet detect typic movement truck stop start high valu takeoff land microphon detect typic sound author found normal light bulb summari percept task percept task section realiz singl sensor percept exampl find orient find sort find peopl close task enabl cloth perceiv combin temperatur cloth adapt temperatur human bodi notic pack light sensor concept proxim object pack abstract percept concept concept fit class cooper section direct sensor import direct sensor orient direct orient inform sensor cooper manner qualiti read direct sensor concept percept task detect proxim spatial integr detect move object concept locat devic path move object proxim devic determin error probabl make assumpt move object movement detector assumpt person move speed realist discuss exampl observ difficult combin dispar perceiv event event perceiv kind sensor chang physic paramet time light level chang door close event notic light sensor microphon sort percept mechan inher inform event impact physic paramet environ summari present percept techniqu gave overview actual sensor technolog differenti activ passiv sensor explain concept smart sensor shortli illustr wide rang sensor work show main field sensor research miniatur mem technolog develop smart sensor sensor discuss conclud specif requir low power low small size section percept task deriv object resolv applic point view section applic show find close import task give reader feel type percept taxonomi percept taxonomi classifi physic paramet class sensor assign categori percept taxonomi section dealt percept mechan analyz sensor capabl identifi direct sensor difficult sensor produc greater amount data interest featur extract chapter percept section concern percept section dedic collect percept sensor process model subdivid percept process step basi model distribut process resid level continu discuss descript integr integr sensor data discuss architectur issu sensor role adhoc wireless network synchron power chapter conclud idea solv percept task pose section chapter model recogn proxim hierarchi chapter present concept proxim directli relat percept taxonomi discuss section show standard locat awar techniqu good demand experi demonstr proxim detect varieti sensor appli simpl sensor integr techniqu task determin close found applic discuss platform section track medicin hospit page medicin close patient incompat medicin prepar find object ly trai medicin smart cloth bag applic reli concept proxim cloth worn learn counterpart match bag applic everydai object learn belong learn inventori logist applic proxim inform opposit import thing danger exist law storag transport defin close type chemic store situat combin multipl object chemic danger chemic room approach task find close object standard locat techniqu determin posit object compar gp absolut locat techniqu requir larg amount infrastructur practic wai determin proxim rel locat techniqu method measur distanc object present method measur signal order determin physic proxim address similar issu time flight distinct acoust signal drawback physic base rel locat system give form semant proxim inform devic close wall solut base classifi close logic close section present methodolog captur form semant proxim chapter model recogn proxim hierarchi proxim hierarchi proxim hierarchi describ section stand direct relat percept taxonomi present section class physic paramet percept taxonomi import proxim estim static state summar correspond level basic concept semant proxim level weak proxim measur room similar physic close level proxim devic detect similar simultan dynam environ person talk move vicin devic sound movement detect correl decid devic physic room highest level semant proxim devic attach object move simultan measur correl dynam devic simultan movement detect static condit devic tilt improv proxim estim experi section proxim hierarchi glanc devic room total temperatur read ly sun close light automat object close photo sensor cover upsid sound correl wrap exampl show mislead master larger set type sensor larger set sensor complementari sensor accur proxim estim obtain experi evalu concept proxim estim multipl sensor conduct set experi experi show audio signal determin proxim devic experi proxim detect movement detector experi complementari inform sensor proxim estim hardwar experi conduct connect sensor pair directli workstat avoid problem synchron bandwidth restrict context distribut wireless devic experi conduct photo sensit resistor microphon simpl amplifi circuit photo resistor connect convert microcontrol microcontrol introduc section exact connect develop kit section appendix microphon oper simpl amplifi circuit higher qualiti data output amplifi directli connect line workstat amplifi circuit section appendix experi acceleromet analog devic simpl infrar motion detector acceleromet part experi evalu board connect directli serial port workstat motion detector connect convert manner photo sensor appendix section setup comput devic workstat sensor fashion connect microphon convert microcontrol potenti problem sampl rate speed khz problem li store data analysi transmit compar microphon sourc experi main goal experi find close audio signal microphon proxim estim gain compar audio signal determin hear sound time qualiti microphon read difficult determin proxim microphon data light sensor detect situat wrap manner experi conduct record length result data sequenc approxim minut measur ly tabl measur pack box experi measur room measur fourth case separ room box desir sensor integr algorithm auditori environ experi consist standard offic peopl type keyboard door open close light switch time time follow theoret approach model state box goal find proxim estim correl valu audio signal theoret term probabl measur correl formul bayesian infer term extend £ ¢ law total written normal extend ¢ written deriv probabl inform light sensor probabl evalu time accumul probabl time chapter model recogn proxim hierarchi number occurr probabl box correl box stretch correl valu figur histogram audio correl valu match gaussian distribut determin probabl correl situat analyz correl valu calcul correl valu audio signal plot histogram depict figur class easili distinguish figur show gaussian gener respect histogram natur correl valu distribut stretch produc valu distribut give probabl valu correl box box box measur fourth situat distribut case box chang qualiti correl experi probabl wrap time box light bia light bia time figur figur show bia calcul photo sensor plot time repres probabl wrap figur show probabl proxim plot time span green curv bia light sensor blue curv figur plot probabl time seri experi blue curv calcul bayesian infer knowledg box £ £ green curv calcul knowledg light sensor box figur show probabl box deriv directli light sensor time seri probabl gener light sensor data calcul differ valu light sensor probabl calcul green curv green blue curv figur section classifi high probabl case insid box probabl high curv bia light sensor slight effect substanti probabl high case bia light sensor strengthen classif idea qualiti audio data accomplish chapter model recogn proxim hierarchi subsampl origin audio data frequenc rate recalcul probabl function figur show plot calcul sampl rate plot built figur probabl valu plot time period experi green curv bia light sensor blue figur left show probabl function calcul probabl timestep discuss refer figur calcul histori inform plot side calcul type histori inform interest effect impact light bia lot stronger correl valu high note histori inform strength probabl valu sampl rate figur probabl valu distinguish situat situat histori inform probabl valu locat distinguish situat limit process capabl memori resourc find balanc amount histori inform sampl rate analyz experi respect percept present section note categori dynam environ determin proxim devic make check static state environ light attribut state directli determin proxim object determin situat wrap ly upsid light fashion prior inform situat occur experi histori histori figur figur show probabl proxim plot time plot gener subsampl origin audio data seri figur left probabl calcul time step histori figur form histori inform figur green plot light bia blue plot interest note effect light bia larger correl valu high note histori inform strengthen probabl function seri figur side chapter model recogn proxim hierarchi experi goal experi detect proxim monitor factor dynam environ infrar motion detector easi detect move person warm move object drawback test sensor report activ move warm scope movement detector imposs decid sensor move chang environ ad acceleromet verifi move acceleromet give inform orient detect tilt orient alik movement detector detect similar movement time probabl higher close due natur acceleromet give inform vertic orient movement sensor acceleromet read devic devic tilt opposit direct experi conduct fashion sequenc record period sequenc result data stream minut sensor set configur orient class sequenc result data class sequenc captur data record person move environ gener distinct movement pattern record stationari environ interest filter easili probabl orient orient orient orient correl valu figur gaussian distribut test situat magnet determin horizont orient devic experi probabl orient time orient orient time orient acceleromet bia acceleromet bia orient figur figur show bia calcul acceleromet plot time measur orient movement detector figur show probabl proxim plot time span green curv bia acceleromet blue curv state model previou £ defin state orient ¢ £ ¢ £ import note acceleromet read suggest movement detector point horizont direct bayesian infer determin probabl correl valu movement £ ¢ differ experi orient devic bia situat box probabl correl extend ¢ chapter model recogn proxim hierarchi normal result ¢ ¢ ¢ calcul correl valu perform experi found histogram distinct experi figur interest note distribut correl high artefact hard fourth distribut higher varianc intuit orient devic plai role case interest find artefact reappear repetit experi figur show plot probabl orient time seri experi devic orient devic posit angl angl probabl function depict angl close devic total direct figur show probabl bayesian infer formula previou experi blue curv show probabl calcul orient green curv orient bia probabl configur promin higher green blue curv fluctuat configur due fact movement orient point addit orient bia green strengthen probabl configur configur bia orient green curv drop blue expect case measur differ probabl valu calcul orient bia compar experi experi similar experi dynam environ main inform sourc correl complementari inform sensor measur static state object experi inform gain light sensor orient inform section draw experi section draw relev proxim hierarchi present experi give short outlook continu work concept proxim hierarchi introduc determin level semant proxim devic intuit approach classifi physic paramet environ base percept taxonomi section requir inform easi acquir dedic sensor drawback proxim hierarchi larg sensor point movement close detect sensor summari pair equal type sensor compar context futur investig aspect proxim hierarchi dispar sensor present experi demonstr aspect proxim hierarchi provid estim proxim wireless sensor devic set sensor experi dynam environ main inform sourc correl context static condit object bia strengthen main correl valu correl valu experi good extra bia high relev natur extend experi static environ condit compar context conduct experi longer time period integr techniqu longer experi valuabl accumul inform longer time period improv proxim estim memori consumpt comput cost requir probabl function correl audio signal basic oper reason order calcul microcontrol memori consumpt depend length amount histori inform accumul problem prohibit implement method devic includ synchron multipl low bandwidth sampl rate uncertainti network futur experi smaller sampl rate find minimum amount data requir determin good proxim estim interest conduct experi prototyp address problem extent experi calcul correl cue featur data directli raw data simpl featur found tremend amount commun bandwidth save summari chapter argu concept semant proxim relev applic show common locat detect absolut suppli suffici inform determin semant proxim proxim close relat percept taxonomi introduc section hierarchi proxim devic model semant term proxim hierarchi classifi physic directli measur exist intuit categori comparison equal categori potenti environ result proxim inform level experi show sensor acquir relev inform determin aspect proxim hierarchi show type suppli complementari combin strengthen proxim estim experi provid concept proxim estim similar techniqu prototyp chapter model recogn proxim hierarchi chapter summari futur work thesi concern explor perceptu comput comput devic size integr comput commun percept environ report start literatur survei topic context contextawar defin keyword term rest work determin percept task analyz applic found ubiquit comput commun compar applic envisag short comparison found applic wider rang context inform percept task gain applic studi broad natur task applic determin close devic task discuss detail main chapter report commenc basic inform sensor work sensor classifi percept distinguish sensor physic paramet hand dynam static state environ hand dynam static state object attach continu main chapter split firstli percept base singl sensor collect percept section singl sensor percept discuss featur extract sensor section collect percept varieti multipl sensor integr techniqu chapter proxim directli build percept multipl sensor determin semant proxim experi total sensor prove aspect proxim hierarchi determin show aspect proxim hierarchi conduct experi drawback proxim hierarchi build strongli pair equal type sensor compar context remain analyz proxim hierarchi appli dispar sensor depend number sensor deploi region type issu minor import mount minim set cheap sensor case task address futur proxim sensor integr techniqu level proxim hierarchi inform level combin challeng task experi interest commit compar dynam object attach acceleromet classifi object object move direct shop bag carri chapter summari futur work move characterist wireless sensor network pose multitud problem affect percept mechan long sensor configur remain moment sensor move rang join configur algorithm type network dynam adapt natur work reliabl kind properti gener type sensor futur experi configur larg number sensor pose interest scalabl problem enabl methodolog possibl interest result address problem bandwidth rich audio video intellig featur extract algorithm task correl audio inform extract featur raw data interest research field explor techniqu sensor larger number bayesian give insight possibl combin sensor inform experi conduct complementari sensor integr section integr schema multitud experi type integr techniqu combin imagin research algorithm level sensor process direct local algorithm section page lead idea percept techniqu gener identifi percept semant proxim solv varieti approach appendix problem descript page origin problem hand begin depict appendix problem descript appendix sensor page overview sensor technic detail magnet sensor small choic web list kind includ technic specif big problem emerg search cmo imag avail big firm mitsubishi toshiba interest support project directli requir big number imag sensor possibl hand bui product sensor remov search light discov wide varieti type sensit wavelength special applic price microphon vari cheap depend qualiti intend similar scale price exist temperatur sensor reason technolog simpl cheap resistor chang resist depend temperatur sensor digit rang featur sensor sensor special task list short uva sensor sensor fire detect smoke sensor color sensor ultrason sensor posit estim air motion sensor rain sensor vehicl wind appendix sensor manufactur type descript power usag power suppli cost sampl rate output format featur qualiti mitsubishi analog edg edg random camera cess mitsubishi digit mitsubishi digit edg tion estim agil color digit window size ning motorola color pixel address em marin color digit variabl resolut color digit pixel toshiba color digit analog random access cmo imag sensor ¢ ¢ ¤ manufactur type descript power usag power suppli cost output format avail rang analog devic axi piec analog free sampl motorola axi axi analog high sensit analog axi analog digit evalu board ¢ ¢ ¤ ¢ acceleromet manufactur type descript power usag power suppli cost output format avail size sensit axi piec analog axi piec analog axi piec analog axi piec analog corpor analog philip axi piec analog conrad magnet sensor ccd video camera manufactur type descript power usag power suppli cost output format qualiti analog color analog pixel light sensor manufactur type descript power usag power suppli cost output format avail advanc diod photo diod analog texa instrument light voltag sensor analog conrad microphon manufactur type descript power usag power suppli cost avail micro miniatur microphon conrad appendix sensor manufactur type descript power usag power suppli cost output format motorola analog analog seri analog pressur sensor manufactur type descript power usag power suppli cost output format avail qualiti fingertip capacit evalu kit cmo sensor digit finger slide sensor fingerprint sensor manufactur type descript power usag power suppli cost output format avail qualiti dalla semiconductor digit conrad analog devic ad convert chip analog devic analog resist analog nation semiconductor analog conrad ¤ digit output step temperatur sensor sensor passiv infrar motion detector manufactur type descript power usag power suppli cost output format avail rang seri analog analog autom control analog modul analog conrad sensor manufactur type descript power usag power suppli cost output format avail qualiti humid analog humid humid temperatur digit evalu kit £ rel ¢ £ ¢ air qualiti carbon motorola smoke detector analog sharp radar distanc measur digit conrad analog conrad rang iee forc size label appendix sensor appendix circuit diagram microphon amplifi wai connect microphon comput sound card higher qualiti connect differ connect audio signal microphon socket amplifi intern signal directli built amplifi sound card high connect experi simpl microphon capsul spheric audio characterist frequenc rang microphon integr output signal strong integr circuit amplifi built simpl amplifi unit amplifi unit connect microphon directli socket microphon input signal volum power line figur microphon amplifi circuit philip integr circuit amplifi figur show circuit diagram amplifi unit suppli voltag volt part standard compon special characterist adjust volum control input line amplifi sensit microphon resistor valu appendix circuit diagram deriv simpl experi photo resistor evalu sensor data decid connect convert connect serial port workstat simpl wai connect simpl photo resistor hardwar develop team microcontrol make photo resistor setup standard compon resist resist voltag divid form result voltag measur convert microcontrol suppli voltag volt photo resistor figur circuit diagram connect photo resistor convert experi temperatur sensit resistor connect manner easiest cheapest wai measur temperatur electron motion detector setup experi motion detector analog photo resistor movement detector connect connect serial port workstat infrar movement detector shelf compon sensit rang meter open angl movement induc chang output voltag measur microcontrol suppli voltag circuit diagram figur show voltag divid creat refer voltag motion detector refer voltag basi output signal motion detector depend move output signal rang setup photo sensor motion detector detector figur circuit diagram connect detector convert appendix circuit diagram bibliographi context awar sensor pack smart dust analog devic acceleromet june microphon detector philip audio amplifi ic gregori christoph jason sue rob mike pinkerton mobil tour guid acm wireless page gregori robert jason wearabl ubiquit comput technic georgia institut telephoni mobil wireless distribut sensor network patient monitor care proc ieee confer inform technolog applic page novemb schmidt experi design everydai michael beigl gellersen ambient workshop chang bibliographi tm bernard visual sensor process abil di human machin inform chapter page plenum brown framework creat applic palo page januari estrin low cost outdoor local small devic technic report southern april maher posit mobil network annual hawaii intern confer system gellersen architectur fusion mobil environ intern confer inform pentland recogn context wearabl baselin system technic report mit media march pentland auditori context awar wearabl dei gregori abowd understand context technic report georgia institut june jeremi deborah estrin time synchron wireless sensor network technic report deborah ramesh john kumar centuri scalabl coordin sensor network mobil comput page randi frank understand smart sensor artech michael albrecht schmidt situat comput david gerhard audio signal classif phd simon fraser develop acoust technic report southern april andrew gold neal lesh indoor navig set wearabl sensor technic report merl mitsubishi electr research juli seth cot dust richard philip jame situat comput technic report hewlett packard laboratori april bibliographi estrin direct scalabl robust commun paradigm sensor network mobil comput ss min advanc distribut sensor technolog prentic kristof van laerhoven adapt context free der und und lectur note für und jason ad gener contextu capabl wearabl comput intern symposium wearabl page octob ieee comput societi onlin daniel gregori abowd context aid develop applic technic georgia institut sawhnei situat awar sound june bill norman roi comput applic ieee workshop mobil comput system santa schmidt beigl context environ technolog adapt mobil user albrecht kristof van walter van de veld advanc interact context page roi andi veronica jon gibbon activ badg locat system technic report cambridg roi bill norman rich karin david john mark weiser parctab ubiquit comput experi technic
DB/219 3 toronto xml engin alberto mendelzon georg mihaila patricia depart comput scienc toronto ibm tj watson research center present toronto xml engin repositori xml data support real virtual xml document real document store file map relat object depend indic defin storag method virtual document remot defin arbitrari weboql defin queri document regist system system catalog metadata queri process optim queri rang catalog multipl queri languag support paper describ architectur main present index storag includ discuss queri process strategi project start recent activ develop introduct xml origin design structur web document turn eleg textual semistructur data blur notion data document enabl join effort web manag commun xml relat project academia data model queri languag tool open sourc standard effort xml standard repres inform web activ field current size growth tendenc effici index queri process xml document paramount import paper introduc repositori xml data metadata storag unit document modifi eventu remov system document typic store data set relat metadata includ standard metadata interest store schemata document system schema defin document assum document type system maintain catalog entri document type regist system support heterogen data storag index multipl xml queri languag virtual metadata defin queri remot data sourc document system data integr data sourc correspond xml document refer document simpli xml content work support nation scienc engin research council bell ibm centr advanc studi document manag catalog manag queri processor relat storag engin remaind document organ section present notion document kei aspect effici storag xml document architectur main compon present section section briefli discuss automat main goal project section present execut inform data intens applic section draw document xml repres textual document data catalog document categori differ characterist index queri xml book element string vari length word titl sentenc typic queri involv search word occur context inform retriev requir index typic queri retriev larg sequenti portion document chapter book expect entri structur involv data type typic queri case access fragment data aggreg yield small result set determin lowest price tradit dbm index techniqu adequ document crucial determin storag index strategi document fuzzi measur determin close document extrem spectrum document low similar textual store index document type expect determin threshold decid storag index approach document regular structur document low regular architectur document access engin object storag engin file system storag engin figur architectur virtual document engin architectur depict figur modul visibl user document manag queri processor user remov document repositori modul determin storag index strategi incom document core system document access mediat request modul actual data access engin describ compon catalog manag modul primarili maintain metadata document regist system intend store typic metadata schemata document schema formal xml initi intend support xml schema prefer detail inform structur properti improv index queri process system note structur queri answer access catalog provid document regist system schema catalog xml document queri user function catalog manag includ maintain statist document version control mechan import problem repres manag multipl version xml document intend extend modul schema integr reason schemata repositori modul depend heavili catalog perform function reason defin set system languag support goal project identifi set system queri effici implement storag index current storag method xml document fall broad dbm map nativ storag engin file suit textual fast sequenti access dbm map document high nativ storag engin start flourish perform depend document differ method reli singl storag optim type document flexibl storag document briefli describ storag engin support relat storag engin map content document relat tradit rdbm index modul support gener map insensit structur document document schema structur depend map store relat storag intend storag mechan xml content gener data access odbc enabl provid object storag engin defin map store dom tree xml document open sourc persist storag engin java support store xml document index mechan provid java languag hash storag strategi document text system index queri file intend hybrid storag section discuss type xml text data customari document exhibit characterist categori hybrid document catalog data book annot comment editor found onlin goal project perform storag engin wrt type xml document section hybrid document view join data compon set textual compon data compon data book textual compon singl comment book join attribut uniqu element data compon isbn system gener index data sourc join effici reason document type regist document origin repres virtual document physic storag design hidden user differenti document type catalog index mechan index mechan inspir dataguid access support relat design fast access element xml tree forward backward navig consist separ path effici evalu regular path effici locat node document satisfi criteria flexibl queri process interest featur unlik total size index linear respect size document preliminari experi result current index built dom memori actual refer document work elimin depend dom structur provid persist indic effici nativ storag method xml content queri process queri processor primarili provid interfac issu user queri document repositori modul process system queri section xml queri languag integr xpath xslt note data storag mechan data access pattern adopt algebra approach queri process optim hide heterogen reduc complex queri processor data storag engin support simplifi addit storag engin intend xml algebra virtual document design deal transpar real virtual document distinguish kind virtual remot user unabl care queri rang document regist catalog remot document arbitrari weboql view languag support note user distinguish real virtual document optim queri access remot document process depend access pattern remot data sourc effici view materi mainten import issu automat document previou kei aspect index queri document goal project establish algorithm comput measur weight averag factor includ characterist document usag note uniqu constraint express dtd xml schema specif book book sequenti isbn titl titl price currenc string real review review random isbn comment type string paragraph figur templat definit xml document typic queri mix account similar document similar system plan investig schema map techniqu infer similar point worth mention realist classif xml document section discuss textual data common xml repres java code uml instanc expect higher frequenc element class case storag strategi discuss yield optim perform properli xml document extrem relev task gener synthet xml content gener synthet xml content base templat templat consist xml schema specif annot probabl occurr characterist element document goal gener larg collect document evalu index queri process mechan total control structur benchmark document requir case motiv design necess gener larg collect document share structur valu element document figur show fragment templat defin xml repres book catalog book review order join make isbn valu review entri catalog accomplish isbn valu shown referenc actual xml isbn element declar uniqu list note book review written chosen reflect fact book popular review review written reader valu element gener templat currenc motiv applic strateg busi analyst track trend relev organ strateg object accomplish monitor stori report evid object remain encount obstacl execut inform portal prototyp intend support type knowledg work handl stori design manag thousand document multipl link support complex search oper involv metadata search document index index respect semant model system support onlin updat order address requir document intern store xml document document manag compon build relat dbm process port compon good test bed engin major issu address queri larg collect xml document implement xml queri handl queri input thousand document queri requir rang complex xml queri simpl accommod emploi xml queri languag task complex queri lightweight xml queri implement simpl paper introduc heterogen repositori xml content data integr discuss present hybrid storag scheme main goal project understand characterist document affect storag queri process expect defin wai xml defin guidelin storag design effici nativ storag understand factor affect perform storag approach number method store queri xml file schema independ map edg tabl schema depend map hybrid map store nativ storag mechan lore xylem differ heterogen data storag support multipl queri data integr characterist document criterion determin store index unlik queri processor persist storag indic queri optim data note store offer hybrid reli singl storag engin rdbm xylem intend xml data web deal crawl refresh irrelev context recent project activ develop defin probabl distribut item list method refer serg peter dan suciu data web morgan vincent sophi dan queri xml document xylem acm sigir workshop xml inform juli alberto mendelzon restructur web fourteenth intern confer data page februari jame editor xsl transform version novemb jame steve editor xml path languag novemb gordon charl christoph robert good retriev system annual intern acm sigir confer research develop inform page ca august dublin core metadata initi mari dan store semistructur data store acm sigmod intern confer manag page pa june daniel robert structur inform retriev acm sigir workshop xml inform juli peter mari michael philip editor xml queri algebra work decemb daniela donald store queri xml data ieee data engin bulletin roi jennif widom enabl queri formul optim semistructur intern confer larg data page august ibm xml extend administr program guido moerkott advanc queri process object base access support relat intern confer larg page august serg jennif widom integr structur semistructur data intern workshop program septemb weslei chu compar analysi xml schema languag sigmod septemb jason serg roi dallan jennif widom manag system semistructur data sigmod septemb open sourc java odbm index scheme xml data master depart comput toronto januari sahuguet queri xml millennium septemb chun david jeffrei naughton relat queri xml limit opportun intern confer larg data page septemb
AI/220 2 subsumpt architectur amir ii comput scienc depart stanford ca abstract describ ai architectur base brook subsumpt architectur axiomat di erent layer control logic independ theorem prover deriv layer output input implement subsumpt lower layer higher layer circumscript make assumpt lower nonmonoton retract higher layer draw give formal semant approach describ layer design task robot control experi empir show feasibl fulli express fol theorem prover robot control architectur introduct rodnei brook provid decomposit problem robot control layer level function form introduc idea complex layer depend reactiv uenc behavior result architectur simultan servic potenti con ict goal reactiv give goal realiz architectur lack make implement reason make semant unclear hardwar complex layer introduc scale problem reli hardwar speci architectur speci calli orient robot control applic intellig agent problem extend similar architectur complex task goal agent necessarili physic discuss gener term practic ai architectur develop line paper describ architectur model spirit brook subsumpt architectur reli logic framework wider applic extend manner subsumpt architectur includ set logic layer brook architectur layer suppli separ theorem system layer oper concurr nonmonoton reason model connect theori layer make nonmonoton made layer perform independ perform support reactiv demonstr architectur model layer task robot bottom brook rst layer show empir layer greatest reactiv fast result show theorem prover intellig agent sacri reactiv remaind paper organ give introduct brook system behavior describ lsa give formal semant approach circumscript describ robot control system implement architectur conclud discuss implement comparison relat work descript futur direct subsumpt decomposit brook subsumpt architectur brook show advantag system parallel task behavior level compet standard function decomposit typic function decomposit resembl sequenc sensor percept model plan task recognit motor brook domain avoid object wander explor build map monitor identifi object plan action reason object behavior denot level compet potenti bene ts approach includ concurr increment construct test turn forward avoid wander collid sonar head turn object halt encod robot head forc robot robot speed layer layer figur layer brook subsumpt architectur robot control system di erent layer complet independ decomposit wander explor depend robot abil avoid object system servic multipl goal depend goal layer con ict case goal overrid subsumpt architectur mechan compet layer observ state lower inhibit output overrid adjust behavior task lower layer exiv halt object dead default design disallow tamper task brook implement control system layer rst level compet wander rst layer shown figur brie avoid layer endow robot obstacl avoid capabl move direct avoid obstacl forc stop immin wander layer robot move occupi explor layer robot primit behavior period locat distanc head robot idl explor layer inhibit wander layer robot remain track destin wander explor layer overrid default head comput avoid avoid layer ensur robot refer reader detail behavior decomposit rst import idea borrow brook architectur domain behavior line sequenti function line subsumpt architectur sequenc fol theori repres layer axiomat layer layer output state depend input axiom sensor higher layer output prove theorem determin run separ theorem prover layer output lower layer robot ector axiomat layer smaller cycl run theorem prover compound lead higher perform advantag possibl achiev reactiv behavior brook lower layer control basic behavior trust autonom wait result higher layer assum respond situat layer typic simpler default cycl time comput output shorter complex layer subsumpt principl layer fulli independ adopt view decomposit coupl approach repres subsumpt subsumpt architectur import natur paradigm intellig agent robot control layer lsa commun underneath hierarchi layer overrid input classic logic theori inconsist formal theori lower layer con layer fact higher layer assert relev lower con lower layer give assumpt accommod higher layer number techniqu develop logic commun nonmonoton techniqu belief chosen approach equal interest logic subsumpt section describ detail implement principl discuss basic machineri distinguish part logic theori bodi sensori input output bodi layer invari theori layer latch accept input replac begin cycl accumul output set goal sentenc prove layer theori process loop layer proce collect pertin sensor data assert form logic axiom assert input theori theorem prover layer attempt prove layer goal reach transmit relev layer case layer robot manipul figur illustr process bodi input sensor output latch bodi sensor output latch input figur detail layer subsumpt logic mccarthi circumscript rst major nonmonoton reason tool mccarthi circumscript formula theori paramet relat function sequenc minim element hold vari order smaller theori circumscript block vari minim conclud block world mention origin theori circumscript distinct assum default layer give semant system layer big logic system implement idea layer make default input adjust layer assumpt form assumpt minim predic layer input languag gener shown circumscript gelfond layer theori layer set predic assert cwa subsumpt achiev layer parallel circumscript polici formula substitut simpl mechan determin minim discuss issu section semant lsa ignor time di erenc theorem prover di erent layer entir system layer logic give system simpl semant layer theori layer cwa fol goal formula layer formula prove translat layer input call system layer layer theori write mechan entail deriv ab ab relat symbol show de nition layer model layer theori model circumscript layer ab semant assum interest set result layer symbol theori di erent symbol layer layer fol languag includ constant function symbol sentenc translat replac term theorem valid semant system transfer goal layer theorem assum layer theori formula languag sequenc sentenc st layer layer lsa obei assum transfer singl instanti goal pair layer case layer prove disjunct goal ne lsa support nement size disjunct quanti cation lsa assum skolem section omit proof lack mention reli craig interpol theorem fol lemma lemma layer ab ab formula neg st layer layer layer result ad layer layer ab ab assum set layer consist circumscript smooth prefer relat model minim minim model prefer theorem assum st layer posit layer translat layer layer model brook system brie describ logic theori control system implement robot oper build rst layer correspond roughli rst layer brook system list select axiom theori refer reader full version paper complet system assum architectur control cylindr robot sonar sensor perimet wheel control motion assum determin current locat orient layer layer assert form axiom schema dist physic sonar translat map record distanc direct discov object layer subsumpt latch dir number dist dir dir dir layer check detect object ly directli front halt robot min dir dir dir robot refer point straight front sonar number sonar number layer execut function comput combin exert robot detect object forc direct forc strength head angl robot forc head robot command move speed proport strength slow move farther object head angl direct mod head speed forc cycl layer appli cwa symbol object distanc direct input languag theorem prover prove speed angl instanti proof result translat actuat command layer layer support simpl movement goal close resembl explor layer brook system wander layer pair coordin speci ed input layer robot current make simpl calcul quadrant surround robot goal posit assert exist push quadrant object fx object quad object push obj dist layer theorem prover attempt prove introduc layer input latch success avoid capabl layer ectiv push robot object direct deviat direct path physic object vicin layer plan layer perform translat logic locat cartesian coordin reason situat calculu mccarthi elev coordin respect xed coordin system domain input layer current locat data robot output layer plan landmark prove inter lm inter situat calculu theori includ elev locat robot locat explicitli state frame domain depth plan simpl layer plan layer perform robot motion plan situat calculu uent robot deeper reason perform reason time input layer current locat robot goal implement issu implement theori theorem prover sun sparc run prolog underli interpret technolog theorem theorem prover theori made necessarili quanti produc set horn make sound uni cation avoid proof produc prolog infer algorithm sound complet subject system batteri experi simul build environ figur summar result scenario vari plan path locat oor creat plan requir plan plan path locat di erent oor experi robot orient obstacl posit robot vicin measur number infer step time prove goal layer critic achiev result averag turn action forward action requir space includ figur data case layer work fairli long plan involv scenario depth proof reli speed layer safeti avoid capabl ensur robot fall cli plan avoid cli edg attribut speed achiev optim semant attach layer predic embodi function return forc vector call prolog oper collect object exist proof comput sum forc contribut object cwa achiev limit proof longer speci ed constant settl constant appli cach proof proof improv perform layer signi cantli approxim divid plan layer execut elev domain layer avoid proof occur princip action number frame axiom robot elev separ prevent complex uni cation relat work compar approach agent architectur robot control lsa full fol theorem prover control loop rst architectur built theorem prover suitabl realiz complex task describ process implement theori algorithm prove abduct semant baral de ne control modul form agent relat famili action languag gelfond giunchiglia provid check modul correct respect action theori ar provid algorithm creat agent action theori levesqu giacomo work golog project planner golog program robot execut golog list averag standard deviat layer perform independ robot orient sonar read layer layer layer layer time infer time infer time infer time infer sd sd sd sd figur proof time infer step measur lsa experi di erent oor elev oor plan standard program logic give semant golog program situat calculu mccarthi work fol theorem prover control robot system shown theorem prover robot control emploi layer architectur demonstr architectur versatil theorem prover realiz complex individu theori simpl theorem prove ground give formal semant base circumscript system implement layer simul comput instal system mobil futur work plan includ ad layer creat map layer reason updat explicit belief world work incorpor vision sensori capabl implement concurr work rst step goal creat gener ai architectur support reactiv acknowledg mark stickel sourc prolog provid answer inquiri research support arpa grant nation physic scienc consortium fellowship refer baral baral sc tran relat theori action reactiv control electron tran arti cial review rodnei brook robust layer control system mobil robot ieee robot march gelfond gelfond lifschitz repres action chang logic program logic gelfond przymusinski relationship circumscript negat failur arti cial februari giacomo de execut monitor robot program proc page giunchiglia gn lifschitz repres indeterminaci cation arti cial levesqu hj scherl logic program languag dynam domain logic mccarthi mccarthi pj philosoph problem standpoint arti cial intellig machin volum page john mccarthi applic circumscript formal common knowledg arti cial minski societi mind simon nilsson robot technic report sri nj nilsson arti cial synthesi robot common informat situat proc page la stein architectur principl cognit robot cybernet septemb stickel prolog technolog theorem implement extend prolog compil autom stickel prolog technolog theorem exposit implement prolog theoret comput
IR/221 5 open framework practic test recommend system researchindex dan depart comput scienc engin mn usa steve david pennock nec research independ nj abstract autom recommend person product recommend ecommerc web increasingli valuabl servic onlin retail catalog web log major obstacl evalu recommend algorithm lack testb task attempt fill creat framework build recommend system huge onlin digit librari comput scienc research research commun evalu recommend system easili quickli researchindex wai ideal evalu recommend hybrid recommend combin inform filter collabor filter techniqu document wealth content inform full collabor inform permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb hong linkag inform citat structur framework support realist evalu metric assess user resort offlin metric predict accuraci end user util sheer scale researchindex document thousand user access forc algorithm design make tradeoff accuraci present tradeoff build hybrid recommend call algorithm similar inform select set document collabor inform rank document perform compar recommend researchindex collabor recommend social inform digit librari introduct number product web access unstructur web grow find desir inform increasingli difficult recommend system tackl inform overload opinion group peopl identifi inform individu group find methodolog complement tradit format filter techniqu analyz content document work applic recommend system realm ecommerc recommend product web recommend system simpl bought men women venu bought space system user post comment custom read comment bui system make person recommend base book user bought explicit rate book scale enter amazon recommend pure collabor filter system comput recommend base rate ignor product attribut cf system complet domain independ cf system fail data recommend recommend user sophist recommend system combin user rate descript inform reason throw trash content inform overcom sparsiti problem refer problem impedi progress recommend system research lack standard framework evalu compet algorithm set argu researchindex serv excel testb recommend hybrid algorithm combin collabor content inform develop recommend framework evalu quickli evalu recommend document researchindex compet system evalu actual user behavior rate download measur predict accuraci translat user satisfact potenti stimul research recommend system merg content collabor system make tradeoff accuraci eleg speed memori system recommend mean recommend depend current user action hope stimul research area contempl start ball provid skeleton system develop hybrid call method combin content collabor inform context make recommend document researchindex millisecond present preliminari result show compar baselin system recommend provid researchindex relat work histori cf term collabor filter introduc tapestri broader denot todai tapestri document structur entiti model user creat structur unlik todai email filter user ignor mail subject sender address end user add document creat queri oper annot approach user great control flexibl filter drawback user manual creat filter tapestri suit small group peopl tapestri queri form mark requir peopl opinion requir commun mark doesnt mind autom collabor filter address drawback model recommend user assign rate item system rate find user similar opinion make recommend grouplen approach filter usenet system approach recommend item music movi web page joke cf algorithm origin algorithm similar metric comput user rate user explicitli enter rate valu scale user rate usenet articl scale common similar metric includ pearson correl squar differ vector similar system set neighbor similar user comput predict system neighbor highli correl user similar score threshold comput predict rate item user base neighbor rate item system sort item predict rate present user order pearson correl work quick make domin algorithm deploi system todai research machin learn suggest recommend problem cast classic problem classif appli number machin learn includ induct learn cluster neural network bayesian network recent approach tend emploi probabilist model person diagnosi assum user report rate error form neighborhood comput probabl user type user system probabilist cluster assum user fall fix number type expect maxim estim probabl user person type base rate cf algorithm base machin learn techniqu perform slightli origin correl method method advantag comput user model make fast predict cost build model paid point pennock al explor axiomat justif theoret limit appli cf algorithm hybrid combin content cf origin motiv collabor filter complement tradit approach field inform retriev approach content item make filter difficult movi content person tast domin notion relev make recommend rate independ content gener techniqu domain wast throw content inform inform recommend system overcom startup problem interact data extrem user item system research hybrid system combin collabor inform model develop sarwar al good al inject inform collabor filter environ agent act user recommend system rate item enter system agent rule base amount quot text usenet post genr determin introduc similar judgment recommend system class system inform collabor inform separ claypool al develop onlin newspap combin result separ cf system merg result assign weight perform user researchindex separ collabor inform combin result simpli present recommend result separ user decid recommend work approach combin notion collabor similar system prefer build user model recommend fab basu al found deriv artifici featur merg collabor train ripper learn system outperform collabor recommend pazzani data syskil webert system explor demograph inform make recommend al extend hofmann probabilist model creat model relat user prefer document set implicit topic standard testb evalu recommend system situ standard dataset movi rate exist test pure cf algorithm case hybrid recommend paper explor hybrid system dataset make hard compar standard machin learn dataset collabor research typic cf dataset content case research supplement inform internet movi compar common offlin algorithm recommend system set algorithm offlin evalu criteria predict reflect true user sentiment section describ framework implement recommend system context researchindex describ resourc develop argu metric unlik typic accuraci evalu recommend base impact user behavior autonom citat index system index larg fraction comput scienc literatur web system locat download automat extract inform citat comput form similar includ citat link sentenc view view similar user perform keyword search citat navig document similar measur comput system figur show typic document detail page researchindex document detail page show user metainform wai download document page displai number link gener recommend similar metric mention researchindex excel testb investig hybrid recommend number reason domain research paper object work relat tast work suggest collabor similar valuabl researchindex make easi observ user automat assign user id user creat user id recommend system develop instal local copi researchindex mirror actual rich api access enorm amount content inform document researchindex activ recommend system develop ensur algorithm scale system demand quick time servic thousand request hundr thousand user item researchindex provid recommend task research evalu algorithm system researchindex terminolog basic entiti researchindex citat group user peopl robot make queri access document citat researchindex gener user id store cooki mention user carri ident machin creat explicit account document actual research paper download process document assign document id document found multipl locat wind multipl document researchindex attempt unifi citat actual text citat extract document citat receiv uniqu citat id citat group relat individu citat cite citat group receiv group id researchindex store cite document cite document distinct researchindex call user action event happen user interact document issu queri kind event interest recommend system develop shown tabl note notion import interest event recommend system develop infer event signifi user prefer implicit explicit user effect item implicit rate plai import role ecommerc burden user explicit rate researchindex provid user give rate user give explicit rate compar number event user gener main recommend system commun researchindex recommend framework daemon run researchindex site recommend receiv user event request recommend form document document system gener issu recommend request requir recommend respond millisecond figur show architectur addit provid standard major goal construct minim amount work recommend system develop order implement test work system skeleton client perl manag connect researchindex call hook method receiv user event recommend request develop implement system extract data forward system skeleton client handl catch user event occur recommend offlin addit skeleton develop start complet recommend written call translat figur typic document detail page researchindex includ wai download recommend document pursu recommend gener number recommend built recommend framework event paramet user visit document detail page relat doc info download user download document rate user assign explicit rate rate user view document page user search document queri string queri tabl sampl user action researchindex action involv user interact document citat figur overview architectur recommend engin writer write engin make shade compon researchindex event maintain rate rememb state comput recommend millisecond variant person diagnosi algorithm pennock al order develop research contact researchindex access option sourc data research develop test local instanc researchindex research run recommend research chang client point actual researchindex live recommend run long network latenc comput time requir make recommend deadlin researchindex research make arrang run recommend researchindex machin metric measur user behavior unlik prior research recommend metric focu retrospect predict accuraci static dataset metric reli user behav view recommend metric borrow ecommerc notion metric match user experi user follow recommend link document detail document download defin user view detail download recommend document short number action recommend metric give recommend credit suggest good user found path back short accuraci stori prefer metric measur user respond recommend predict accuraci metric absolut error absolut error absolut differ user rate item system predict user mae averag error set rate accuraci metric place retrospect analysi static situat accuraci stori actual accuraci achiev algorithm poorli user rate consist quest accuraci user predict order guid make analysi static dataset ignor fact recommend system support classif system research model recommend affect user behavior make effect difficult imposs model static dataset discuss object metric detail user rate depend son time item user hill al user set movi rate week found pearson correl rate statist fairli strong inconsist cloud small accuraci improv report literatur fact user rate system infer rate user behavior featur user rate lend cast quest predict accuraci open question user notic differ mae mae hersh found user perform task baselin text search engin search engin absolut predict accuraci recommend system support user make pursu item import system comput exact score user give item confid score strongli system believ recommend import system make recommend give user addit inform system recommend famou research paper recommend user import item system recommend user make item reason measur impact recommend user behavior mae measur impact recommend system user behavior suggest set recommend user set choic user made al note user rate item system present mean recommend system influenc item user consum influenc actual rate user give system recommend import case captur evalu recommend accuraci metric static dataset static dataset valuabl tool evalu recommend algorithm static dataset make conveni experi dataset weed unsuit algorithm effect onlin suggest rashid al provid fix unchang static dataset research compar predict accuraci algorithm easili live data stream virtu static dataset accuraci simpli retrospect accuraci fail stori recommend system algorithm researchindex captur raw log user recommend document recommend creat static dataset predict accuraci metric recommend show usabl built hybrid make freeli develop mention matrix variant person diagnosi algorithm make predict chose pd fast work offlin algorithm shown accur standard correl method researchindex data programm dai implement algorithm week achiev perform good meet speed requir researchindex describ strategi exploit content collabor requir make recommend fast deploi recommend strategi build hybrid recommend custom electron store ecommerc site request inform portabl cd player site place person recommend page inform site cf recommend find custom item suggest good recommend item system believ custom rate highest recommend address bought bought list knowledg user person recommend call recommend user view inform goto consid paper recommend balanc knowledg user notion user interest origin grouplen recommend treat usenet group separ set item user view recip recommend joke microsoft cf recommend context draw recommend item implicit context fact peopl tend similar type item dan scienc fiction recommend tend match fan recommend scienc fiction attempt recommend serendipit usual scope user interest approach problemat recommend researchindex comput recommend item present problem scale research typic area mean document highest predict score field user interest approach similar inform researchindex glean extract citat document order restrict item recommend consid citat link similar measur form direct graph document node similar relationship edg search document user select candid set document pd algorithm gener predict document conduct lotteri document select recommend user neighbor found rate system fall back averag rate document document similar inform system set recommend document randomli approach nice properti researchindex gener content similar easi fast access inform separ dont find combin weigh dispar notion similar content select set plausibl document collabor inform rank reason model peopl make elimin wrong altern approach fit notion relev adopt ir commun trec inform retriev relev assum document relev relev topic comparison simplifi notion vari person vari person situat recommend start binari notion cf includ person notion relev order produc recommend reason amount make discuss similar graph short recommend small subset document researchindex reduc number document consid recommend document document rate user seldom recommend eat memori trade space speed obviou case maintain rate memori locat potenti neighbor user rate item system cach inform user begin session updat minut user larg number potenti cach consid potenti neighbor specif document rang neighbor document number potenti neighbor document rang narrow predict algorithm fewer potenti neighbor predict gain speed cost memori make user user interact document store system user action explor researchindex pertain document view citat made document recommend document citat point user sourc download actual document baselin result field recommend test includ random recommend version present preliminari measur qualiti recommend produc compar result recommend built researchindex recommend researchindex number sentenc recommend document section ident text current document cite document cite current document activ document make similar citat algorithm similar bibliograph user document current document document cite current document document found web page current document field recommend earlier hold weight recommend document select document recommend similar assign random score document user receiv recommend researchindex document detail page researchindex recommend suggest order recommend rel order page user interfac permut order recommend difficult user slot page multipl recommend framework issu request recommend system order recommend suggest document recommend displai recommend page advantag recommend earlier page fix order limit abil make comparison recommend researchindex recommend recommend posit page show recommend comparison recommend reason metric metric measur user accept recommend distinguish user document detail user download document measur user immedi link document detail page suggest recommend measur user download recommend document immedi click document similar give credit recommend document recommend user access ten action user back recommend result tabl show perform prototyp recommend develop perform researchindex recommend data repres dai worth user activ researchindex present raw number recommend made recommend percentag total recommend user metric produc rank order recommend recommend place middl outperform researchindex recommend user lag cite activ note percentag add action user recommend link discuss sentenc overlap cite recommend rest reason recommend produc document relat current document recent sentenc overlap research find recent paper describ piec research cite locat paper build current research find newer paper relat research interest recommend displai document detail page show import step framework account placement order recommend recommend base recommend outperform show person add random select nearbi document similar turn lend support belief hybrid system perform outperform occur document receiv high score base similar recommend rec sentenc overlap cite activ bibliographi user view site tabl perform hybrid recommend researchindex percentag repres user link download document recommend recommend user visit document time receiv recommend give opportun recommend document domin perform sentenc overlap cite perform wai improv easi fix detect robot exclud neighbor googl web crawler turn good neighbor conduc accuraci improv abandon poor similar measur build graph similar inform provid site recommend measur serendip collect paper site draw research user discov interest research area consid search researchindex involv find paper relev current project confer deadlin tomorrow serendipit discoveri consid advantag collabor filter system recommend advantag scratch surfac content ir techniqu document text comput similar cluster document inform includ similar graph lead relev document researchindex recommend discov interest document similar inform encod citat interest text similar measur correl similar measur advanc state art recommend attempt combin collabor similar inform open standard tool rapid develop evalu recommend system metric evalu recommend system affect user absolut accuraci metric domin work past develop prototyp hybrid exploit collabor similar measur similar limit popul document recommend collabor inform order great flexibl correspond problem recommend item user context prototyp version make good recommend compar good potenti improv futur work paper begin futur involv research interest recommend system particip project research develop system evalu invit discuss metric judg recommend system hope researchindex standard testb explor issu collabor filter hybrid recommend includ recommend implicit rate email author refer balabanov collabor recommend commun acm recommend social inform recommend nation confer artifici intellig juli aaai pp learn collabor inform filter intern confer machin learn morgan san pp discov relev scientif literatur web ieee intellig system empir analysi predict algorithm collabor filter confer uncertainti artifici intellig juli cooper morgan pp combin collabor filter onlin newspap acm sigir workshop recommend system learn tree rule featur thirteenth nation confer artifici intellig eighth innov applic artifici intellig confer aug aaai press mit pp collabor filter weav inform tapestri commun acm constant time collabor filter algorithm inform retriev combin collabor filter person agent recommend nation confer artifici intellig juli pp recommend evalu choic virtual commun acm confer human factor comput system pp latent class model collabor filter intern joint confer artifici intellig juli aug morgan kaufmann pp digit librari autonom citat index comput collabor learn recommend system eighteenth intern confer machin learn morgan kaufmann pp collabor filter data set framework demograph filter artifici intellig review social choic theori recommend analysi axiomat foundat collabor filter seventeenth nation confer artifici intellig pp collabor filter person hybrid memori approach confer uncertainti artifici intellig june juli morgan kaufmann pp probabilist model unifi collabor recommend environ confer uncertainti artifici intellig august pp learn user prefer recommend system intern confer intellig user interfac pp open architectur collabor filter netnew acm confer cooper work pp filter agent improv predict qualiti grouplen research collabor filter system acm confer cooper work pp method metric recommend annual intern acm sigir confer research develop inform retriev social inform algorithm autom acm confer human factor comput system pp batch user evalu give result annual intern acm sigir confer research develop inform retriev septemb pp cluster method collabor filter aaai workshop recommend system overview ninth text retriev confer nist special ninth text retriev pp
Agents/222 1 url perform analysi mobil agent filter data stream wireless network david kotz jiang robert grai georg cybenko ronald peterson dartmouth colleg comput scienc technic report abstract wireless network ideal environ mobil mobil move link resid wire closer resourc data transform move wireless run wire gatewai goal reduc bandwidth demand paper examin tradeo face decid mobil agent support ltere numer wireless client lter inform larg data stream arriv wire network develop analyt model paramet experi explor model implic introduct mobil agent program migrat host host network time place unlik code execut state move unlik process mobil agent move typic written languag tend independ oper system hardwar architectur agent programm typic structur applic agent migrat desir interact occur local network singl mobil agent migrat sequenti host agent spawn child agent migrat independ programm option programm tradit distribut move code move data code move code agent state smaller data move applic vulner network disconnect agent interact resourc survei potenti mobil characterist make technolog appeal wireless tend low bandwidth low reliabl user mobil comput devic launch mobil jump wireless connect wire internet safe roam author dartmouth nh research support darpa contract dod muri program contract kotz al perform analysi mobil agent site host mobil interact local resourc resourc remot site host mobil agent complet return send messag wireless network agent case avoid transmiss unnecessari requir transmiss agent code client server total bandwidth consumpt code transmiss depend agent size arriv rate reason agent code size arriv save data transmiss larger code transmiss client code server approach client advanc environ client code possibl disappear short scenario discuss mobil agent give exibl move ltere code point move code situat scenario initi import part futur work paper analyz potenti perform bene ts typic applic scenario scenario sucient gener ect militari applic eld unit monitor inform sourc weather data intellig commerci applic consum monitor stock report stori scenario numer inform push steadi stream weather stock trac plane sourc di erent data rate frequenc numer inform comput connect wireless network channel assum inform stream gather gatewai transmit data wireless channel consum model singl larg system expect server larg multiprocessor larg internet server todai model singl wireless result easili extens multipl separ region overlap region pictur shown figur server internet inform sourc data stream client wireless channel figur scenario analyz consum interest di erent necessarili subset data consum interest inform ltere set item stream travel monitor weather stock weather care locat ect travel todai rst step requir requir comput relat size data stream model consum interest set run consum singl comput client compar approach solv system plan kind agent code transfer rst time agent visit machin kotz al perform analysi mobil agent server combin broadcast data stream wireless channel client receiv task client machin lter stream obtain desir data task client machin send mobil agent server agent lter data stream send relev data messag task client perform metric compar bandwidth requir comput requir directli compar usag evalu capac server network mobil agent approach trade server comput save network bandwidth client valuabl tradeo import client weight power requir low list de ne paramet analysi deriv basic interpret signi canc section describ experi obtain valu kei paramet section result experi explor perform space model describ relat work section summar section model data arriv system figur imagin time interv chunk data accumul incom network bu chunk process chunk transmit wireless chunk process client data arriv averag rate bit averag chunk size td bit server client client client inform data stream wireless network internet figur scenario view pipelin pipelin stage complet process data chunk averag ts tw tc analysi work futur explor queue model understand dynam properti bu er requir kotz al perform analysi mobil agent server receiv chunk server process server send chunk client process time figur pipelin time diagram letter repres data chunk time chunk process chunk transmit server chunk process chunk receiv server kotz al perform analysi mobil agent paramet de ne paramet easi refer input data stream speed time interv size data chunk arriv time period wireless channel total physic bandwidth commun overhead factor broadcast ectiv bandwidth broadcast commun overhead factor agent ectiv bandwidth agent messag bandwidth server wire internet receiv data stream number client index client machin number task client machin index task total number arriv rate agent upload client server averag agent size ij fraction total data task client process process data ij fraction data process task client produc ij ij ij comput complex task client averag comput ij ij ij ij conveni shorthand init averag number oper agent start perform client machin perform ecienc softwar platform client machin perform server machin perform ecienc softwar platform server note raw bandwidth wireless bandwidth fulli applic commun assum broadcast protocol achiev bandwidth messag protocol achiev bandwidth section discuss measur compar approach tradit fair expect tradit system compil code client compil system interpret code server system support interpret languag java client server di erent hardwar di erent system client run fraction full speed server run fraction full speed expect expect comput valu hint gure valu comput result paramet time transmiss internet server ts time process server tw time transmiss wireless network tc time process client agent case broadcast agent case broadcast agent case broadcast case expect depend df ij assum agent access server cycl kotz al perform analysi mobil agent comput constraint mention stage pipelin complet time ts tw tc concern altern portion system span wireless speci calli model internet portion assum internet sucient fast deliv data stream ts broadcast server simpli merg data stream arriv internet step case agent data ltere server server time combin ltere cost time spent initi newli arriv ij ij ij init expect comput complex ij simplifi obtain bound number client task assum ij ij ij ij init rc init wireless tw broadcast case chunk data recal td agent agent lter data send subset data item wireless messag back task client agent ij df ij ij bit chunk total time transfer agent messag df ij ij averag de ne ij ij agent mdf kotz al perform analysi mobil agent simpl wireless channel carri agent client adjust bandwidth occupi trac direct recal agent size jump server rate activ add rk bit bit total trac updat equat mdf lead bound number agent rk df approach requir wireless comput bandwidth amount data transmit expand account protocol divid time mdf rk rk note inequ inequ broadcast broadcast exce limit provid inequ broadcast imposs approach number agent limit speci ed note broadcast case wireless bandwidth scale input stream agent case wireless bandwidth scale number agent relev data expect data ltere agent agent approach scale system larg ow rate moder client popul tc process lter data assum client addit power time consumpt data assum client sucient process power launch agent rate broadcast data ltere client design slowest max ij ij ij client host write simpli agent case data ltere kotz al perform analysi mobil agent tabl summari constraint deriv earlier comparison wireless channel limit comparison stage broadcast agent ts neglig rc init tw ba rk df ba rk tc neglig commentari result summar tabl agent approach ts constraint wireless network number size agent ltere ratio low realist agent remain server long agent instal rare small assumpt simpli es equat readabl tabl tabl simpli ed assum tc chang limit comparison stage broadcast agent ts tw ba df ba notic broadcast case scale nite number add task client add data input stream requir client processor faster client ij ij ij ij ij ij rang requir client processor requir lot server processor processor scale input data number number task client init easier scale server xed facil speed individu client server live comfort machin room client eld machin bu er pipelin model applic primarili concern throughput time latenc long pipelin stabl steadi compon capac system work calcul base approach real data ow uctuat time bu er stage pipelin hold data stage produc data faster stage process complet channel full case impact bandwidth assum channel kotz al perform analysi mobil agent analysi full queu model analyz distribut bu er size stage distribut paramet leav analysi futur work latenc concern applic client concern latenc shame data delai reach client approach lead time reach server time reach client ow speci data item process transmit wireless process client share resourc data item share server wireless network client agent requir cpu time share server server divid time task complet comput time server divid time averag task complet half time similar analysi made wireless network assum share server latenc la lb ignor arriv agent assum client la mdf lb dicult compar speci paramet valu latenc analysi speci data rate server wireless network client data ow time interv compon process data latenc sucient small latenc suce applic approach latenc data ow rate remain reduc latenc make balanc improv compon improv easier agent easier upgrad server thousand client experi obtain paramet measur model construct small test environ consist linux linux workstat wireless network laptop serv wireless client machin laptop ran rout serv gatewai mbp wireless network mbp wire network server cluster linux workstat treat machin singl logic ectiv measur describ platform shown figur measur system client run fraction full speed server run fraction full speed directli measur singl host speed run compil program compar java obtain divid obtain wrote simpl applic edg port java ran sampl averag java program recal diculti measur discuss mhz mip metric perform kotz al perform analysi mobil agent client wireless channel server cluster switch wire ethernet gatewai figur server cluster send data wireless gatewai machin wireless network detail platform follow gatewai solo intel pentium run linux intel pentium run linux va linux model pentium ii run linux wire gatewai connect mbp mbp mbp server cluster wireless mbp lucent wavelan pc card con gure mbp msec program msec includ comput portion time read write imag model applic data stream disk number give faster java measur raw bandwidth wavelan wireless network mbp obtain measur transmiss speed sampl applic transmit data divid mbp comput broadcast wrote simpl pair broadcast data block byte wireless receiv transmiss complet impli sec bp bp broadcast larg chunk data ecient comput agent wrote simpl agent program visit send document agent complet send messag ectiv bandwidth comput total amount data transmit divid time requir transmit includ time sleep ect model agent di erent host server number agent host reach highest total bandwidth found run separ host server reach mbp speci bp bp constant equat obtain result kotz al perform analysi mobil agent measur init host server support comput addit process time requir lter agent agent exit agent averag model comput overhead agent start exit init wrote trivial agent arrang server host rapidli submit agent server host pair conclud overhead init msec number oper measur base cpu experi max cpu result paramet equat react speci condit dicult actual measur ratio algorithm repres sort ltere time execut oper client laptop measur msec comput repres time ltere data arriv equat task arbitrari number client client machin reserv power consum data run close task ignor equat machin experi interest deriv equat term rel power server quantiti sec figur show total number agent support power server grow rel power client msec sampl task possibl plot show ratio reach larg ratio occur server larg parallel comput client simpl devic figur show constraint agent case graph plot constraint tabl vari actual constraint minimum curv lower server kotz al perform analysi mobil agent rel server msec sec msec sec msec sec figur number agent ectiv server power grow rel client power show repres di erent msec repres sampl applic kotz al perform analysi mobil agent input data comput limit bandwidth ff bandwidth ff bandwidth ff figur maximum number agent constraint tabl proport text comput tighter higher wireless network bandwidth limit earlier measur msec program run kb imag applic vari illustr graph assum comput linear imagin behav msec sec mbp figur similar result vari previou graph assum section measur init msec section measur msec xed comput constraint equat rc init msec msec msec actual constraint minimum curv lower server comput tighter higher wireless network bandwidth limit kotz al perform analysi mobil agent agent comput limit bandwidth ff bandwidth ff bandwidth ff figur maximum number agent constraint tabl vari init msec point trac induc jump agent consum bandwidth leav agent transmit data chunk size highli result graph bandwidth requir agent approach broadcast paramet figur vari ltere big impact bandwidth requir agent approach low ltere agent approach bandwidth broadcast approach figur examin case broadcast approach work note bandwidth requir broadcast approach graph slightli bigger relat work perform model comput network distribut applic approach result equat similar previou distribut system similar model work speci calli system develop gener model compar perform remot procedur call perform migrat agent deriv equat total number byte transfer heard test peak kotz al perform analysi mobil agent filter ratio ff raw channel bandwidth broadcast approach bandwidth input bandwidth broadcast agent agent agent figur bandwidth requir agent broadcast approach kotz al perform analysi mobil agent filter ratio ff raw channel bandwidth broadcast approach bandwidth input bandwidth broadcast agent agent agent figur bandwidth requir agent broadcast approach di erenc previou graph mbp broadcast approach unchang kotz al perform analysi mobil agent total complet time task equat includ paramet expect result size agent irrelev inform agent lter data carri futur byte equat similar bandwidth time equat directli applic interest server incom data total complet time park examin signal applic insid telecommun compar approach approach start queu model hierarch signal produc equat expect load network node mobil stationari case equat similar equat deriv constraint agent server machin handl fuggetta vigna identifi main design paradigm exploit code remot code mobil agent context poll manag inform pool network analyz paradigm tradit paradigm develop analyt model compar amount trac total trac manag network model similar bandwidth model al petri net compar paradigm kei paramet model transit probabl tradit client agent redo client agent perform oper continu task compar time task complet paradigm work model suit gener model directli applic involv continu ltere incom data retriev task petri analysi techniqu scenario addit mathemat rang simul work system recent simul work includ consid mobil agent search oper remot le system standard substr search unix grep examin mobil agent messag deliveri wireless network recent work includ compar di erent strategi access web compar rpc approach access document simul valid model valid essenti part futur work broadcast scenario data broadcast agent scenario agent send copi ltere data client data techniqu domain obtain approach summari futur work inspect equat show small ltere ratio small number scheme slower cheaper client analysi reinforc import engin challeng reduc overhead comput commun develop perform analysi predict real understand variabl input data ow bu er di erent type typic wide type kotz al perform analysi mobil agent cpu time support network averag expect number accept address broadcast case assum miss care miss retransmiss case ignor client process consum end applic applic scenario wide applic type worth analyz scenario mobil agent move hierarchi gatewai machin interest mobil agent dynam cooper cach support mobil comput wireless network acknowledg input daniela je suri refer krishna paul evalu perform mobil messag commun mobil host larg ad hoc wireless network acm intern workshop analysi simul wireless mobil page august acm press david colin aaron kershenbaum mobil good jan vitek christian mobil object programm number lectur note comput page gian pietro giovanni vigna understand code mobil ieee transact softwar robert georg david daniela ru mobil motiv state art je rei handbook agent technolog draft technic report depart comput dartmouth colleg imielinski wireless issu solut tomasz imielinski henri mobil chapter page kluwer academ king comput commun system perform model prentic park stationari mobil user agent futur mobil telecommun network intern workshop mobil agent volum lectur note comput septemb gian pietro picco formal exploit code mobil phd dipartimento di automatica politecnico di analyt comparison remot mobil agent paradigm intern symposium agent system applic intern symposium mobil agent ieee comput societi octob kotz al perform analysi mobil agent georg mario andrea mobil agent platform qualit quantit assess intern symposium agent system applic intern symposium mobil agent page palm octob ieee comput societi press john gibson ect mobil agent le servic intern symposium agent system applic intern symposium mobil agent page palm octob ieee comput societi press marku marku perform model mobil agent system intern confer parallel distribut process techniqu applic volum page la june
DB/223 3 latent semant probabilist analysi christo papadimitri prabhakar raghavan tamaki novemb abstract latent semant index inform retriev techniqu base spectral analysi empir success rigor predict explan prove lsi succe captur underli semant corpu achiev improv retriev perform techniqu random project speed lsi complement theorem encourag result argu result view gener theoret basi spectral method wider class applic collabor filter comput scienc ca ibm almaden research harri san ca comput scienc japan depart ma introduct field inform retriev consid scope theori theori deal queri predic inform retriev concept depend intric wai intent user natur corpu theori built basi volum appli research instanc sigmod method manag text survei inform includ discuss techniqu focu theoret point classic text subject inform field inform retriev evolv direct bring closer inform retriev system increasingli built relat flat text index file import chang dramat scope inform advent global concept theori start find fertil ground record number inform retriev paper sigmod techniqu emploi inform retriev mathemat plausibl amen analyt treatment present paper attempt treat rigor latent semant index introduc inform retriev system increasingli built relat system flat text index advent web enabl power applic collabor filter target person tackl techniqu inspir part inform retriev section ir lsi complex inform retriev illustr nasti classic problem synonymi document refer queri polysemi document internet queri deal similar ideal repres document term convent underli concept refer term hidden structur fix map stake high theori lightli pass field term depend critic corpu term correl embodi latent semant index inform retriev method attempt captur hidden structur techniqu linear algebra briefli section detail vector repres document project space obtain singular decomposit matrix space span eigenvector correspond largest eigenvalu strike correl term queri project process space result great save storag queri time empir evid report improv inform retriev repeatedli report lsi regard recal standard collect queri convent address problem polysemi synonymi literatur mathemat theori predict improv perform interest mathemat fact due young theorem cite explan improv perform lsi retain rel posit document vector provid explan lsi deterior perform convent fail justifi observ improv recal paper attempt mathemat techniqu rigor explain empir observ improv perform lsi lsi exploit reveal statist properti start rigor probabilist model corpu mathemat model corpora section model topic probabl distribut term document probabl distribut convex combin small number topic includ framework style model stochast matrix modifi term distribut corpu collect document obtain repeatedli draw sampl document section briefli discuss altern probabilist motiv part applic collabor corpu determin condit lsi result enhanc retriev prove theorem state essenti corpu collect meaningfulli correl lsi perform problem defin term close correspond intuit theorem prove section prove result gener point direct show special case style document singl term partit topic topic distribut high probabl low probabl project subspac dimens equal number discov topic high probabl section show project matrix complet random high probabl properti akin enjoi lsi suggest random project yield interest improv perform lsi precomput origin great comput save great loss accuraci random project altern justif sampl lsi report lsi experi literatur suggest lsi entir randomli select term document document evid accuraci sampl result suggest elabor approach random rigor prove accur lsi background corpu collect document document collect term term document repres vector axi repres term ith coordin vector repres function number time ith term occur document repres vector candid function choic affect result matrix rank row repres term column repres document singular valu eigenvalu aa oe oe oe necessarili singular decomposit express product matric oe matrix column matrix lsi work omit largest singular valu dimens space allud inform descript page small enabl fast larg adequ captur structur corpu compar oe matrix rank approxim row repres document column vector project space span column vector call space lsi space good theorem idea subscript denot theorem matric rank minim ka ck lsi preserv extent rel distanc retriev matrix project space remain improv retriev capabl probabilist corpu model formal model ir probabl plai major role instanc survei comparison approach bodi work formul inform retriev problem learn concept relat document queri corpu correl plai central role focu probabilist properti corpu lsi exploit bring structur fare collect strongli correl produc random set unrel document order studi depend perform lsi statist properti start probabilist model corpu state basic probabilist paper term topic probabl distribut topic uniform distribut concentr term talk subject topic favor term rare mention critic model account correl term topic document topic term term structur document heavili affect authorship style model style ju ju stochast matrix matrix nonneg entri row sum equal denot style modifi frequenc term style map seldom treatment make assumpt valid influenc independ underli topic corpu model quadrupl set set probabl distribut denot set convex combin topic set convex combin style set posit integ integ repres length corpu model probabl distribut topic combin favor combin relat style document length number term occurr document gener corpu model sampl process convex combin topic convex combin style posit integ sampl distribut term sampl time form time distribut corpu size collect document gener repeat sampl process time analysi lsi lsi bring semant relat deal effect problem present theoret evid result assum corpu model simpl structur show lsi discov structur handl synonymi result indic kind result hope present work lead elabor lsi prove work realist assumpt formal largest singular valu matrix remain singular subspac span singular vector preserv small perturb ad lemma matrix rank singular decomposit oe oe coe suffici larg constant arbitrari matrix ffl suffici small posit constant decomposit matric consist column orthonorm matrix matrix proof reli theorem stewart perturb symmetr matrix corpu model call pure document involv singl topic call ffl set term topic mutual disjoint total probabl assign term ffl call primari set term topic assumpt corpu model pure strong elimin address futur investig assumpt corpu small ffl document preprocess elimin pure corpu model jt denot number topic document gener fact gener singl topic document belong topic corpu gener document denot vector assign lsi perform lsi corpu instanc pair document belong topic belong topic lsi corpu small assign orthogon vector document topic parallel vector document singl lsi good job classifi document appli corpu theorem state larg corpu number document greater number gener restrict corpu model nice properti high probabl theorem corpu model topic probabl topic assign term suffici small constant corpu document gener lsi probabl proof denot subset gener corpu consist document belong topic main assum ffl document consist term primari set term topic matrix repres corpu consist block row correspond term column correspond document entir matrix entri row column block focu block denot largest largest eigenvalu matrix essenti adjac matrix random bipartit standard theori spectra probabl jc give formal justif show quantiti captur conduct high conduct undirect graph min random document pick topic show conduct jtj jt jt number term topic graph induc adjac matrix subset vertic assum jsj jsj probabl term probabl independ simpl applic bound lower bound weight cut jsj jt high probabl applic bound desir bound conduct sampl size jcj suffici maximum term probabl suffici small impli size primari set term topic suffici largest eigenvalu high probabl sampl enjoi properti denot eigenvector eigenvalu space coordin index term extens full term obtain pad entri term corpu span mutual orthogon vector vector repres document project project scalar multipl orthogon ffl matrix written consist block matrix small ffl high observ analysi case ffl invari subspac largest eigenvalu ideal space repres document topic hope small perturb prevent lsi identifi small error appli lemma denot space lsi identifi corpu model impli perturb matrix differ matrix small perturb project vector repres document yield vector domin eigenvector lsi document direct belong topic orthogon belong topic quantit analysi show lsi high probabl experi theorem asymptot result claim probabl approach size paramet phenomenon observ corpora modest experi gener document term corpu model term topic topic assign disjoint set term primari set probabl distribut topic probabl densiti equal distribut term primari remain equal distribut term corpu model measur angl function angl pair document origin space rank lsi space typic similar result obtain repeat trial call pair document document gener topic min max averag std min max averag std origin space lsi space angl measur radian angl pair dramat reduc lsi space minimum angl indic pair close averag standard deviat show pair extrem rare result experi similar spirit experi report singular decomposit synonymi end section discuss synonymi context lsi simpl model term ident gener appli pair term term small occurr probabl autocorrel matrix aa row column term ident small eigenvalu pair smallest eigenvalu aa eigenvector vector term differ term intuit version lsi weak eigenvector correspond semant differ synonym term expect method claim bring hidden semant corpu lsi random project result johnson state point vector space project random subspac suitabl high distanc point approxim preserv random project reduc dimens document bring semant relat document lsi hand achiev comput time bottleneck natur suggest appli random project initi corpu small high smaller close term distanc origin corpu appli rank lsi random number singular valu section establish approach final close directli appli lsi view result random project fast approxim eigenspac matrix state lemma lemma unit random subspac random variabl denot squar length project ffl log le infer high euclidean distanc approxim maintain project random subspac log ffl lemma high probabl project scale factor fv satisfi kv kv kv similarli product preserv project vector satisfi length product matrix gener corpu model random matrix row project space matrix random project oe svd lemma ffl arbitrari posit constant log ffl suffici larg constant oe proof lemma appendix corollari corollari jj rank approxim origin matrix main result section proof theorem jja jj jja jj measur jja jj origin matrix recov direct lsi theorem matrix obtain random project lsi recov matrix obtain direct lsi comput save achiev matrix time comput lsi entri column averag number term time comput random project dimens time comput lsi total time obtain ffl approxim log ffl run time method asymptot log compar work reaction unexpect empir phenomenon understand term mathemat model rigor prove substanti partial success prove mere indic expect true posit properti lsi theorem prove specif technic issu pursu theorem extend model document belong term occurr lsi address polysemi spectral techniqu slightli kind evid handl synonymi theori ideal post facto justif method explan posit point wai exploit improv section random project techniqu speed lsi possibl altern attempt direct ibm almaden recent appli random project lsi encourag initi result import role theori unifi gener spectral techniqu confin strict context inform retriev spectral analysi similar model web shown succe identifi topic substanti recal web search law servic log patent clear spectral techniqu theoret analysi prove kei methodolog domain current data mine spectral techniqu discov correl relat collabor filter subscrib prefer row column gener term consum viewer compon system conclud section descript corpu model document node weight edg captur conceptu proxim document distanc matrix deriv fact coincid aa topic defin implicitli subgraph high conduct concept connect context prove assumpt similar spectral analysi graph identifi topic model omit theorem corpu consist disjoint subgraph high join edg total weight bound ffl fraction distanc lsi discov subgraph refer obrien linear algebra intellig inform retriev siam user guid april brewer invit raghavan rajagopalan inform network spectral ibm almaden research dm spectra academ tk gw ra harshman index latent semant analysi journal societi inform st gw tk deerwest latent semant analysi improv inform retriev confer human factor st dumai improv retriev inform extern sourc behavior research instrument fagin combin fuzzi inform multipl sourc proc pp faloutso oard survei inform retriev filter method technic maryland comput scienc colleg md lemma spheric comb theori fuhr model inform comput pp jm kleinberg raghavan nonlinear dynam system mine categor submit golub handbook matrix comput linear algebra golub van loan matrix comput john hopkin hoeffd probabl inequ sum bound random journal american statist associ sourc hyperlink proc symposium discret ibm research report rj johnson extens map hilbert math sinclair approxim perman siam comp pp raghavan inform retriev survei acm symposium discret van rijsbergen inform retriev london salton mcgill introduct modern inform retriev turtl croft comparison text retriev comput pp jh wilkinson algebra eigenvalu problem oxford london proof lemma version lemma specif valu constant facilit proof lemma matrix rank singular decomposit oe oe oe oe oe arbitrari matrix ffl decomposit matric consist column orthonorm matrix matrix proof lemma reli theorem stewart perturb symmetr matrix theorem symmetr matric orthogon matrix invari subspac partit matric bq eq bq eq ffi min max ke ke min smallest eigenvalu max largest eigenvalu ke ffi exist real matrix ffi ke column form orthonorm basi subspac invari proof lemma appli theorem aa matrix theorem write column consist remain column bu diagon bq diagon matrix eq block ij theorem appli bound ke simpli bound aa af fa ff ffl ke ij eigenvalu oe oe oe oe oe oe ffi min max ke ke ffi ke ffi assumpt theorem satisfi exist matrix satisfi ffi ke form orthonorm basi subspac invari invari subspac correspond largest singular valu column vector eigenvector span invari subspac span column vector orthonorm matrix kq kq claim lemma proof theorem lemma matrix orthonorm column matrix kw uk ffl vector ku uk ku vk ku wk arbitrari vector ku kv kw kw ii proof lemma eigenvalu written max express eigenvector eigenvector reduc bv oe ju rj sum bv oe orthogon unit oe max bv oe proof theorem oe oe iii orthonorm set jja jj ab ab ab jja jj jja jj oe jja jj jja jj jja jj jja jj jja jj jja jj jj show iv lemma larg log ffl high jr high corollari jj ffl ffl jja jj jj substitut jja jj jja jj jj jja jj jja jj
Agents/224 1 program languag intern concurr logic agent dahl juli abstract paper describ work creat logic program languag languag design implement agent behaviour concurr intern architectur paper suggest architectur improv exampl part architectur implement comment agent orient program paradigm metaphor concurr event base approach process commun process initi introduc explicit state logic program declar approach object state demonstr part object orient implement suggest agent architectur program formal suit logic base machin learn behaviour interact paper briefli outlin scope learn improv exist agent behaviour introduct motiv work view develop artifici intellig endeavour engin process evolut learn scratch progress made understand fail make import provid tool support intellig flexibl contribut develop softwar engin tool present paper section present program syntax oper declar semant express implement complex agent architectur behaviour simpl order hide machin learn research depart comput merchant ventur woodland bristol unit kingdom program control programm order suitabl formal logic base machin learn section paper present behaviour base agent architectur easier understand manipul exist agent architectur make easier manipul agent implement complex theori behaviour section paper present briefli framework logic base machin learn techniqu guid process develop increasingli complex theori behaviour program languag deal declar program commun develop program languag implicit explicit process commun explicit approach built limit model commun synchron point point commun doesnt concept send receiv messag reli messag unif method inform exchang process model chosen simplic suffici describ agent domain problem consid syntax reserv predic handl correspond close monad type tempor sequenc constraint function haskel ffl predic refer commun event event match descript argument place store event evalu process impli event id argument unif liter messag argument process ffl predic refer commun event restrict event place event constraint record respect evalu ffl event identifi format uniqu id argument uniqu identifi assign success evalu argument atom process involv commun special process reserv commun user input user initi concurr evalu ffl messag argument event unifi messag result ground order event evalu succe declar semant demand variabl instanti involv implicit process commun oper semant pure oper semant predic process semant reserv predic complex semant order commun process process record influenc result event event histori record event process successfulli evalu order evalu ws record event suspend await process record activ constraint futur event constraint ad liter evalu unsatisfi constraint record satisfi constraint remov wc record event await satisfact constraint constrain event record evalu conjunct part delai constraint satisfi record extern process request event process evalu evalu event liter check liter unifi previou event evalu succe check constraint event event ad wc event intern immedi succe ad intern event event process process argument process identifi event requir extern process check event request extern process process identifi process request event process event record ws execut process continu closest disjunct current goal wait disjunct process regist point found interrupt process attempt unifi messag process messag process unif fail result evalu event evalu succe event evalu event assign uniqu identifi ad process request remov constraint evalu event constrain event remov event wc ad current goal question current goal add add event halt front left part evalu tree prioriti evalu interrupt process found success ground unif messag rest conjunct successfulli evalu event ad front current goal event remov ws evalu evalu liter call sequenc check event event identifi unifi event identifi constraint event found satisfi evalu succe event match constrain event match found constrain evalu fail event match constrain event match found constrain evalu succe event found match event record constraint evalu succe constraint left evalu evalu fail declar semant program set horn evalu initi queri declar semant make program impli found abduc reserv liter deduc abduc constraint form partial order set abduc event declar semant state abduc partial order subset tempor order te abduct time event liter plain order event place respect order abduc constraint formal express ffl te respect declar oper semant sound complet incomplet result commit restrict set tempor order result arrang abduct event liter correspond input output concurr agent architectur indic evolutionari inspir design method base build complex behaviour small addit concurr set simpler behaviour design agent robust complex behaviour behaviour base approach root subsumpt architectur success control basic robot turn creat lot problem system develop merg flow data flow control metaphor shoham coin term agent orient program present tradit cycl deal mental modal commit intent work repres modal shift focu agent research commun concurr process intern process agent year brook architectur lack concurr explicit mental properti brook suggest fulli concurr subsumpt architectur subsumpt architectur gave rise behaviour base approach ai hierarch structur architectur support research biologi architectur greatli improv build strength subsumpt concurr inspir evolut brook critic brought agent research back question concurr aop metaphor tradit view concurr program commun behaviour base view concurr program interact behaviour architectur agent architectur successfulli appli robot control simul edmund architectur architectur build edmund import differ architectur set concurr drive consist number concurr compet compet consist compet fix action pattern fix action pattern sequenc bottom level atom action drive prioriti overrid overridden drive prioriti drive regist trigger concurr run process creat data bottom level sensor trigger drive drive initi compet activ compet fix action pattern initi fix action pattern execut uninterrupt main differ edmund architectur drive run concurr forc arbitr desir action drive order respect fix action pattern avoid conflict action architectur introduc arbitr modul common interfac actuat modul introduc structur agent step strict concurr demand subsumpt architectur reason introduc behaviour base tradit introduc altern network inhibit excit channel actuat addit evid part serv similar anim behaviour base solut give function architectur section show exampl implement agent solv simpl problem present artifici life creator contest place european confer artifici food race task control agent simul version khepera robot agent compet agent navig random environ find found agent posit correctli receiv energi time agent energi rate agent long feed agent aliv winner agent simul infrar distanc sensor simul pixel colour camera sensor world maze number number landmark build map rememb posit wander feed agent design solv problem feed wander wander drive agent move feed drive overrid observ solut figur wander move turn forward stop forward stop approach feed move turn receiv wait figur wander feed solut architectur natur implement object implement run concurr top sensor direct present feed wander direct feed drive initi approach receiv prioriti approach compet send agent feed placement signal agent close receiv compet overrid approach compet posit agent correctli receiv food wander drive initi turn move wander direct turn compet turn agent wander direct move compet overrid turn compet make agent move forward simplifi solut simplifi describ behaviour base problem solv architectur implement architectur exampl provid section meant give idea code reserv predic solv problem process commun initi object state event histori indirectli repres object state exemplifi arbitr modul implement object fix action pattern request arbitr modul finish uninterrupt enter state accept event process send messag pure prolog handl object consid reason fail merger lp oop paradigm make implement aspect oop declar logic languag code check messag receiv messag receiv test arbitr modul find state time event intern event creat tempor refer point current state concurr evalu concurr spawn process drive spawn compet pass ident regist trigger reserv process ident process initi case messag hold process initi queri event succe manag initi process evalu queri code feed drive spawn compet hungri shut full hunger logic base learn logic base machin learn techniqu advantag ml techniqu improv exist agent capabl agent system ml techniqu method present learnt theori numer case reinforc learn matric real case artifici neural network format intellig human programm result difficult agent incorpor learnt theori necess agent develop increasingli complex behaviour cycl learn incorpor introduct learnt behaviour exist behaviour facilit languag agent implement languag express theori learn behaviour case incorpor autom creat languag support role prime motiv design languag aim work develop logic base learn method integr agent architectur develop learn model close evolutionari biologi behaviour base paradigm learn method built small modif addit exist behaviour languag clean intuit approach program concurr logic program lack express power design solut complex problem food race present section languag develop implement independ experi place simul written prolog expect languag matur implement process forc solut question easili overlook simplifi simul refer bryson agent architectur object orient design intellig agent fourth intern workshop agent languag lnai page springer brook intellig reason ijcai page morgan dahl declar languag program adapt agent technic report depart comput bristol august view action select devic eighth intern confer artifici neural gregori parallel logic program languag implement intern seri logic program gregori declar approach concurr program intern symposium program program lloyd interact concurr declar program languag depart comput intern delta distribut backtrack extens event intern confer logic volum lectur note comput page shoham program ai wadler monad function program advanc function volum page
IR/225 5 imag current direct open issu yong rui thoma huang dept ec beckman institut illinoi il chang dept ee media technolog center columbia ny abstract paper survei technic achiev research area imag imag area activ past year survei includ paper cover research aspect imag featur system fundament base imag retriev base technolog demand open research issu identi futur research direct suggest introduct recent year rapid size digit imag collect militari civilian equip gener imag huge amount inform access make inform organ ecient search retriev imag retriev activ research area thrust major research manag comput vision research commun studi imag retriev di erent imag retriev trace back late popular framework imag retriev rst annot imag text work rst author support part cse colleg work author support part arl cooper agreement work author support part nation scienc foundat career award stimul award industri sponsor columbia advent project manag system perform imag retriev repres approach survei topic data queri made research direct exist major size imag collect larg hundr vast amount labor requir manual imag annot result rich content imag subject human percept imag di erent peopl perceiv di erent percept subject annot mismatch retriev process earli emerg imag diculti face manual annot approach acut overcom imag retriev manual annot imag index visual techniqu research direct develop imag retriev research built advanc research direct contribut comput vision commun special issu lead journal dedic topic approach establish gener framework imag retriev perspect open research issu solv retriev system put practic imag feel survei achiev past year potenti research direct lead compel applic excel survei imag retriev paradigm exist paper devot ort primarili imag retriev paradigm fundament base imag visual featur retriev system design remaind paper organ section review visual featur match techniqu facilit fast search imag ectiv index techniqu explor section evalu includ dimens reduct index commerci research system distinct characterist section base current situat demand futur research direct suggest approach present section section conclud remark featur extract featur extract basi imag retriev broad featur includ featur visual featur exist rich literatur featur extract dbm inform retriev research ne techniqu visual featur extract visual featur featur classi ed gener featur featur includ textur shape featur applic depend human face nger print featur cover pattern recognit literatur involv domain knowledg space cover paper remain section concentr gener featur applic percept exist singl present featur exist multipl featur di erent perspect color color featur wide visual featur imag retriev robust background complic independ imag size orient repres studi color percept color space found imag color histogram commonli color featur denot joint probabl intens color channel swain ballard histogram similar measur color histogram account similar similar ident niblack al introduc metric compar histogram color histogram sensit cumul color histogram research result demonstr advantag approach convent color histogram approach color color featur appli imag includ color moment color set overcom quantiz ect color color moment approach mathemat foundat approach color distribut moment inform concentr rst moment central moment extract color featur weight euclidean distanc calcul color similar facilit fast search imag smith chang color set approxim color histogram rst transform color space perceptu uniform quantiz transform color space bin color set de ned select color quantiz color space color set featur vector binari search tree construct fast search relationship color set convent color histogram discuss textur textur refer visual pattern properti homogen result presenc singl color intens innat properti virtual includ import inform structur arrang surfac relationship surround environ import recognit comput exist rich research result past decad imag retriev research achiev ad earli haralick al cooccurr matrix textur featur approach explor grai level spatial depend textur rst construct matrix base orient distanc imag pixel extract statist matrix textur research line enhanc version studi statist origin found defer moment entropi biggest discriminatori power motiv psycholog studi human visual percept tamura al explor textur di erent angl develop comput approxim visual textur properti found import psycholog studi visual textur properti rough major distinct tamura textur matrix textur properti tamura visual textur properti cooccurr matrix characterist make tamura textur attract imag provid friendli user interfac qbic system mar system improv textur earli wavelet transform introduc theoret framework research began studi wavelet transform textur smith chang statist extract wavelet textur approach achiev accuraci brodatz textur imag explor wavelet transform chang kuo improv classi cation accuraci wavelet transform combin techniqu achiev perform gross al wavelet kl kohonen perform textur analysi al kundu al combin wavelet transform matrix advantag statist base transform base textur analysi exist review paper area earli review compar textur classi cation perform fourier power grai level statist statist grai level di erenc test method set terrain sampl conclud fourier method perform poorli compar dube compar evalu type textur markov random field ltere fractal base test textur test synthet gaussian markov random natur paint found matrix perform test set recent paper ma manjunath evalu textur imag annot wavelet transform includ orthogon wavelet wavelet gabor wavelet transform found gabor transform test match human vision studi result shape imag depend requir shape invari sati es satisfi focu shape transform invari shape divid outer boundari shape entir shape region success repres categori fourier descriptor moment invari main idea fourier descriptor fourier transform boundari shape featur earli work found account digit imag rui al modi ed fourier descriptor robust invari geometr transform main idea moment invari invari shape featur hu identi ed moment base improv version emerg base discret version green yang fast method comput moment binari imag motiv fact invari found extens experi kapur al develop algorithm systemat gener search geometri invari realiz research happen invari imag gross develop approach preserv qualit di erenti geometri object imag digit framework algebra curv invari repres complex object clutter scene part patch polynomi tting repres local geometr geometr invari object match recognit recent work shape match includ finit element method turn function wavelet descriptor ne sti ness describ point object connect point eigenvector sti ness matrix call mode span featur space shape rst map space similar comput base eigenvalu similar line fourier arkin al develop turn function base method compar convex concav polygon kuo wavelet transform describ object shape embrac desir properti multiresolut spatial local shape match attract research attent al rst match compar collect shape fragment cost proport linear area speed match hierarch match algorithm match di erent ne recent review paper shape li ma show geometr moment method fourier descriptor relat simpl linear transform al compar perform boundari base fourier unl fourier region base zernik combin invari fourier moment invari unl fourier experi show combin outperform simpl addit shape method develop shape wallac present techniqu normal fourier descriptor retain shape ecient advantag interpol properti fourier descriptor result ecient shape wallac mitchel hybrid local shape analysi algorithm shape set algebra moment invari repres shape greatli reduc comput requir shape match color layout global color featur simpl calcul provid reason discrimin power imag give posit imag collect larg research result suggest color layout color featur spatial solut imag retriev extend global color featur local natur approach divid imag extract color featur variat approach base color layout approach entir imag split structur tree branch histogram describ color content conceptu base approach provid accur local color inform sophist approach segment imag region salient color featur color set store posit color set featur region support queri advantag approach accuraci disadvantag gener dicult problem reliabl imag segment achiev good color layout color tupl histogram approach rst construct code book combin quantiz color hue encount local region imag histogram base quantiz hue construct local color featur extract rst color moment ve prede ned partial overlap fuzzi region usag overlap region made approach insensit small region transform pass al classi ed pixel color coher base part larg region wide scatter pixel distinguish cluster pixel improv local color featur huang al color base color layout rst construct color cooccurr matrix similar measur result show approach robust convent color histogram approach term retriev accuraci line color layout layout textur visual featur construct facilit advanc imag retriev segment segment import imag retriev shape featur layout featur depend good segment subsect describ exist segment techniqu comput vision imag retriev al research morpholog oper base approach imag segment test approach type includ optic astronom infrar ocean approach ectiv deal scienti imag perform evalu complex natur scene imag hansen exploit individu strength analysi relax label fast algorithm exist rst subdivid imag basin relax label ne updat classi cation basin initi obtain advantag relax label robust li al fuzzi entropi base segment approach approach base fact local entropi maxima correspond uncertainti region imag approach ectiv imag histogram clear peak vallei segment techniqu base delaunai edg flow found mention algorithm automat major advantag type segment algorithm extract boundari larg number imag occupi user time ort unconstrain automat segment reliabl algorithm segment case object obtain desir imag human assist han boundari extract combin manual input user imag edg gener comput al develop improv method activ contour base user algorithm rst greedi procedur provid fast initi converg outlin ned dynam program rui al segment algorithm base cluster group space user de ne attractor algorithm group region object comment worth mention segment requir segment accuraci di erent shape featur layout featur accur segment highli desir segment suce summari visual featur comput vision applic imag retriev applic visual exist multipl model human percept featur di erent perspect featur imag retriev applic depend develop imag content descript organ featur featur invok place assist retriev research ort place mpeg start work item call formal multimedia content descript interfac standard set descriptor describ type multimedia inform descript content fast ecient search inform user high index make imag retriev scalabl larg size imag ecient index techniqu explor main challeng explor imag high featur vector order similar measur euclidean measur ectiv simul human percept visual similar histogram support solv approach rst perform dimens reduct index capabl support similar measur dimens reduct dimens featur vector imag retriev dimens lower util index bene cial rst perform dimens reduct approach transform cluster variat face variat inform princip compon analysi studi research perform dimens reduct ng approach carri dimens faloutso lin fast approxim perform dimens reduct result research show real data set featur reduc dimens signi degrad retriev qualiti chandrasekaran al develop singular decomposit updat algorithm ecient numer stabl perform imag retriev system dynam system imag continu ad imag dynam updat index structur algorithm tool addit cluster power tool perform dimens reduct cluster techniqu disciplin pattern recognit speech analysi inform retriev cluster similar object perform recognit group type cluster call cluster cluster reduc featur space experi show simpl ectiv approach thing worth point blind dimens reduct inform lost reduct dimens avoid blind dimens cation stage di erent fisher discrimin analysi provid guidanc index techniqu identifi dimens featur select index algorithm index reduc high featur vector major research commun contribut comput pattern recognit exist popular index techniqu includ bucket prioriti tree variant addit cluster neural wide pattern index techniqu histori index techniqu trace back middl cell tree rst introduc perform satisfactori push urgent demand spatial index gi cad guttman index structur base variant develop selli al tree green variant beckman kriegel dynam tree scalabl dimens higher good review comparison index techniqu imag retriev found research goal white jain provid gener domain independ index algorithm motiv tree tree found provid loss dynam natur ng strategi imag retriev dimens evalu exist index custom select index approach dimens reduct characterist data select good exist index dimens compon rank varianc dynam rang dimens fairli high test data found gave perform tree index techniqu design tradit queri queri rang similar queri imag explor characterist requir index structur imag retriev techniqu explor develop tree adapt approach ned tree structur elimin ineci tree node similar queri approach concentr identifi improv index techniqu scalabl high featur vector imag retriev natur featur vector imag similar deepli explor similar measur imag retriev histogram techniqu solv cluster neural net al increment cluster techniqu dynam inform retriev techniqu dynam capabl handl high potenti deal similar measur rui chakrabarti al extend techniqu direct support similar measur faster accur search strategi zhang zhong selforgan map neural net tool construct tree index structur imag retriev advantag som learn dynam cluster natur potenti support arbitrari similar measur result brodatz textur collect demonstr som index techniqu imag retriev system earli imag retriev activ research area imag retriev commerci built imag retriev system support option random search search sketch search text keyword navig custom imag categori provis rich set search option systemat studi involv actual user practic applic explor tradeo di erent option mention select repres system highlight distinct characterist qbic qbic stand queri imag rst commerci imag retriev system system framework techniqu profound ect imag retriev system qbic support queri base sketch draw select color textur color featur qbic averag transform element color histogram textur featur improv version tamura textur combin contrast shape featur consist shape major axi orient set algebra moment invari qbic system account high featur index index rst perform dimens reduct index structur keyword search combin similar search qbic demo virag virag imag search engin develop virag similar virag support visual queri base composit structur boundari virag step qbic support arbitrari combin atom queri user adjust weight atom featur emphasi je rei al open framework imag manag classi ed visual featur gener domain speci cancer cell usefulli ad open structur depend domain requir gupta jain queri languag framework demo virag imag retriev engin develop excalibur technolog corp earli emphasi neural net imag retriev recent search engin color aspect ratio queri featur support combin featur user adjust weight featur demo page photobook photobook set interact tool search imag develop mit media lab photobook consist face featur extract user queri base featur recent version picard al includ human imag annot retriev loop motiv base observ singl featur model imag domain human percept subject approach incorpor human factor result show approach ectiv interact imag annot visualseek webseek visualseek visual featur search engin webseek web orient search develop columbia main research featur spatial relationship queri imag region visual featur extract compress domain visual featur system color set wavelet transform base textur featur speed retriev develop binari tree base index algorithm visualseek support queri base visual featur spatial relationship enabl user submit queri color region top blue green region bottom webseek web orient search engin consist main imag collect subject classi cation index brow retriev modul support queri base keyword visual content demo netra netra prototyp imag retriev system develop ucsb alexandria digit librari project netra shape spatial locat inform segment imag region search retriev similar region main research featur netra system gabor lter base textur analysi neural net base imag thesauru construct edg ow base region segment onlin demo mar mar analysi retriev develop illinoi champaign mar di er system research scope techniqu interdisciplinari research ort involv multipl research comput manag system inform retriev research featur mar integr dbm ir match rank integr index retriev retriev algorithm advantag underlin index integr comput human main focu mar nding singl featur organ visual featur retriev architectur dynam adapt applic di erent user mar formal relev feedback architectur imag retriev integr techniqu level includ queri vector nement automat match tool select automat featur adapt demo system art museum develop earliest imag retriev system edg featur visual featur retriev blobworld develop transform raw pixel data small set local coher region color textur space system user view intern submit imag queri enabl user imag return modifi queri distinct featur built princeton combin similar search subject search imag retriev system found futur research direct advanc made research includ visual featur system open research issu solv current imag retriev practic human loop fundament di erenc comput vision pattern recognit system imag retriev system human part system explor synergi human comput research trend ect evolut imag retriev earli literatur autom approach lead comput vision techniqu recent research emphasi qbic team interact region segment base observ di erent textur advantag di erent mit team move photobook webseek system dynam featur vector recomput base user feedback ucsb team incorpor learn textur analysi mar team formal relev feedback architectur imag human comput interact improv retriev perform relev feedback base approach includ pichunt concept visual featur human tend concept everydai life current comput vision techniqu automat extract imag lowlevel featur constrain human face nger link low level featur high level concept nger gener featur direct link concept narrow semant process process achiev combin neural genet cluster learn tool power intellig queri interfac perform task user easili provid evalu current retriev result comput relev feedback techniqu mar tool web orient world wide web dai thousand ad web organ retriev unlimit search engin highli desir solut exist inform fact alta frequent visit web site search engin imag good work place technic breakthrough make imag search engin compar counterpart major technic barrier li link lowlevel visual featur index system todai desir mean base preliminari observ subject match popular oper search option partli reason commerci imag retriev system web typic custom subject categori organ imag collect di erent imag retriev system focu di erent section user content index featur subject taxonomi di concern recent ort standard start address issu research system imag investig framework integr access distribut imag librari high index web huge collect imag exist research prototyp system handl hundr thousand sequenti scan imag degrad system perform exist system explor index aspect imag retriev imag collect larger retriev speed bottl neck progress made section ectiv high index techniqu urgent explor perform evalu criterion standard testb techniqu push forward domain evalu criterion snr data recal inform retriev good metric lead techniqu correct direct bad mislead research ort imag retriev system measur perform base imag evalu perform term borrow retriev criteria measur system perform satisfactori major reason diculti de ning good evalu criterion percept subject imag content subject imag percept prevent de ning object evalu criteria evalu system perform guid research ort correct direct equal import task establish larg scale testb imag good balanc textur video mpeg commun develop balanc test video sequenc inform standard testb exist imag retriev commun recent start collect test data testb larg scale test scalabl balanc imag content test imag featur ectiv system perform human percept imag content ultim end user imag retriev system studi human percept imag content level crucial topic close relat topic section topic gain attent recent aim explor human perceiv imag content integr imag retriev system earli research conduct independ mit team nec team uiuc team interest team team initi studi relev feedback imag retriev realiz diculti interpret human percept subject imag natur resort relev feedback human percept recent studi human percept aspect human percept al conduct experi studi import semant memori previou rel absolut judgment imag pichunt underli imag retriev system result show perform achiev semant memori rel similar judgment combin semant visual cue achiev result feel reason visual cue case due limit test dataset size dataset big system util addit inform visual cue conjectur match result group al conduct seri experi analyz human percept imag content visual featur captur semant mean correl lot semant result encourag develop imag featur metric achiev semant retriev integr disciplin media commun literatur comput vision commun literatur titl articl commun system keyword comput vision system imag larg le thousand imag fundament unit data address author research ort ongo build true imag system complet stage success imag system requir interdisciplinari research ort integr manag comput research tradit inform retriev area part tradit inform retriev area research focu document retriev model techniqu adapt imag retriev success exampl research ort includ adapt boolean retriev model imag retriev util relev feedback imag retriev observ integr great potenti improv index classi cation imag gener domain research shown result textual visual featur automat index imag sophist techniqu imag classi cation high level textual cue low level visual cue bear fruit conclud remark past current technic achiev visual featur system design review open research issu identi ed futur research direct suggest previou success imag retriev system requir seamless integr multipl research commun ort progress individu research commun system architectur equal import integr system shown figur annot featur visual featur text imag collect index user queri interfac retriev engin queri process figur imag retriev system architectur system architectur imag collect raw imag visual displai di erent stage imag di erent imag resolut imag good choic imag process compress research commun contribut visual featur store visual featur extract imag techniqu section inform support imag retriev comput vision imag understand research commun contribut text annot keyword descript imag clear imag retriev commun imag retriev replac complementari compon imag retriev integr result satisfactori retriev perform research progress ir dbm main thrust discuss achiev fast retriev speed make retriev system scalabl imag ectiv index modul part system modul push forward comput pattern recognit research commun retriev engin modul includ queri interfac submodul queri process submodul commun user friendli queri interfac interfac collect inform user displai back retriev result user research progress user psycholog user interfac improv interfac design queri user process di erent wai queri process submodul manipul user queri process procedur techniqu advanc manag commun major characterist system architectur demonstr discuss interact natur human comput user arrow integr multipl inform human comput lead success imag retriev system refer applic document oct context object oct demo page draft requir oct acm proc int conf multimedia el adapt ltere index imag proc spie storag retriev imag video jame allan relev feedback data proc mitchel ecient comput metric compar polygon shape ieee tran patt recog mach march vassili michael charl distinguish photograph graphic world wide web proc ieee workshop access imag video je rei charl bradlei rich ramesh shu virag imag search open framework imag manag proc spie storag retriev imag video feb parametr correspond techniqu imag match proc int joint conf arti cial ecient robust access method point rectangl proc acm ana chang meta search engin imag proc spie storag retriev imag video san demo hierarch parametr edg match algorithm ieee tran patt recog mach chri bucklei gerard salton optim relev feedback weight proc jame bruce stephen hard inqueri retriev system proc int conf expert system sept serg malik imag queri proc ieee workshop access imag video conjunct ieee cvpr zhang eigenspac updat algorithm imag analysi comput imag chang fu relat system imag technic report purdu chang fu ieee tran softwar nov robert content creation search media applic educ ieee sept benitez visual inform retriev larg distribut onlin repositori commun special issu visual inform dec chang hsu imag inform ieee tran knowledg data oct chang pictori system ieee comput nov donald timothi intellig imag system ieee tran softwar chang imag video retriev proc symposium multimedia commun video chang techniqu index manipul proc ieee int conf imag chang john smith extract signal featur visual queri proc spie symposium visual commun signal john zhong find larg archiv lib feb chang jai kuo textur analysi classi cation wavelet transform ieee tran imag octob mose chandra toma rajeev motwani increment cluster dynam inform retriev proc annual acm symposium theori page cheng approach imag retriev base compress data multimedia system phd york tat chin ooi fast imag retriev proc ieee conf multimedia comput gene jai kuo wavelet descriptor planar theori applic ieee tran imag januari david copper lei invari recognit complex object base patch part lectur note comput scienc object comput vision thoma yianilo optim interact strategi bayesian relev feedback proc ieee conf comput vi patt yianilo bayesian relev feedback imag retriev intl conf pattern recognit yianilo target test pichunt bayesian multimedia retriev system advanc digit librari washington cross jain markov random eld textur model ieee tran patt recog mach dirk wayn ron interact improv approach activ contour proc spie storag retriev imag video jame dow retriev multimedia imag proc spie storag retriev imag video richard duda peter hart pattern classi cation scene chapter page john wilei york equitz wayn niblack retriev imag textur algorithm qbic system technic report rj comput ibm research ronald fagin edward wimmer incorpor user prefer multimedia queri proc int conf barber ecient ectiv queri imag content ibm research christo faloutso lin fast algorithm visual tradit multimedia dataset proc page wayn jonathan byron monika jim ha deni david peter queri imag video qbic system ieee comput septemb charl michael vassili imag search engin world wide web technic report comput scienc imag segment direct region proc ieee int conf imag hc imag system content captur fast imag index abil proc ieee int conf imag herbert textur descriptor base matric comput imag dian green implement perform analysi spatial data access proc acm imag textur analysi wavelet space proc ieee int conf imag gudivada raghavan special issu imag retriev system ieee comput sept gupta ramesh jain visual inform retriev commun simon ramesh jain search inform visual media commun dec guttman dynam index structur spatial search proc acm michael hansen william relax label imag segment proc ieee int conf imag robert textur featur imag classi cation ieee tran kato queri visual proc int conf extend march hu visual pattern recognit moment invari comput method imag analysi lo ieee comput imag index color proc ieee conf comput vi patt thoma multimedia analysi retriev system project proc annual clinic librari applic data process digit imag access ieee proc ieee int conf imag proc ieee proc int conf multimedia comput system ieee proc ieee conf comput vi patt recog method de ning similar imag basi color inform technic report ibm tokyo research novemb jain workshop nsf workshop visual inform manag system proc spie storag retriev imag video petkov workshop visual inform manag system june comput invari elimin method proc ieee int conf imag kundu chen textur classi cation decomposit comput imag septemb andrew jian fan textur classi cation wavelet packet signatur ieee tran patt recog mach deni ron wayn jim petkov index complex queri imag proc ieee int conf imag cooper fast bayesian recognit complex object base mutual algebra invari proc ieee int conf imag michael kim webcrawl sketch technic comput scienc leiden li song de ma relat region contour proc ieee int conf patt harri fuzzi logic approach imag segment proc ieee int conf imag fang liu picard featur imag model retriev ieee tran patt recog mach juli tan ecient imag retriev color content proc int conf applic segment imag type open close proc ieee int conf imag ma manjunath comparison wavelet transform featur textur imag annot proc ieee int conf imag ma manjunath pattern thesauru larg aerial photograph technic report univ california santa ma manjunath textur featur learn similar proc ieee conf comput vi patt page ma manjunath edg framework boundari detect imag segment proc ieee conf comput vi patt ma manjunath toolbox navig larg imag proc ieee int conf imag manjunath ma imag index textur dictionari proc spie confer imag storag archiv volum manjunath ma textur featur retriev imag data technic report univ california santa manjunath ma textur featur retriev imag data ieee tran patt recog mach nov davidson chart appli photograph summer mike yong thoma huang multimedia analysi retriev system proc int workshop inform retriev yong michael thoma huang support queri imag mar proc ieee int conf multimedia comput wing lee shape measur content base imag comparison inform process minka picard interact learn proc ieee conf comput vi patt makoto mathemat transform color data color data proc spie visual commun imag volum page murthi zhang multimedia resourc integr search system web webnet world confer oct special section retriev acm multimedia raymond ng evalu index structur imag transform princip compon analysi proc spie storag retriev imag video al qbic queri imag content textur shape proc spie storag retriev imag video feb philipp richard dube perform evalu class textur featur patt exibl imag retriev system combin scene keyword proc ieee conf multimedia comput michael yong thoma huang support similar queri mar proc acm conf thoma ti thoma yianilo studi perform imag retriev system proc conf human vision electron imag greg justin miller compar imag color coher vector proc acm conf pentland picard special issu digit librari ieee tran patt recog mach manipul imag int comput pentland descript natur scene ieee tran patt recog mach fu shape discrimin fourier descriptor ieee tran sy picard societi model video imag librari tech mit media picard comput learn subject proc acm comput dec picard digit meet place vision proc asian conf comp dec picard minka vision textur annot acm multimedia rosalind picard visual thesauru springer verlag workshop rosalind thoma martin model user subject imag librari proc ieee int conf imag sept lawrenc rabin juang fundament speech chapter prentic englewood cli rick john imag retriev colour tupl histogram proc spie storag retriev imag video thoma john charl edward perceptu imag similar experi proc conf human vision electron imag yong thoma huang dynam cluster optim retriev high multimedia yong thoma mehrotra imag retriev relev feedback mar proc ieee int conf imag yong thoma mehrotra mar applic juli yong thoma michael ortega automat match tool select relev feedback mar proc int conf visual inform yong thoma michael ortega relev feedback architectur multimedia inform retriev system proc ieee workshop access imag video conjunct ieee cvpr yong thoma michael mehrotra relev power tool interact imag retriev ieee tran circ sy video sept yong alfr thoma huang autom shape segment group space proc ieee int conf imag yong alfr thoma huang modi ed fourier descriptor shape practic approach proc intern workshop imag multi media gerard salton chri bucklei approach automat text retriev inform process gerard salton michael mcgill introduct modern inform retriev book han extract boundari imag proc spie storag retriev imag video flickner retriev imag comparison comput method human perceptu judgment proc spie storag retriev imag video bruce schatz chen build digit librari ieee comput stan leonid marco la imag browser world wide web proc ieee workshop access imag video faloutso dynam index object proc shaw comput perfect retriev perform inform process alfr thoma huang segment road scene color textur classi cation proc ieee int conf imag nov smith chang intellig multimedia inform edit mark mayburi queri color region visualseek visual queri smith chang local color textur extract spatial queri proc ieee int conf imag smith chang visual search web content ieee multimedia summer john smith chang transform featur textur classi cation discrimin larg imag proc ieee int conf imag john smith chang singl color extract imag queri proc ieee int conf imag john smith chang tool techniqu color imag retriev proc storag retriev imag video john smith chang autom binari textur featur set imag retriev proc ieee int conf signal john smith chang autom binari textur featur set imag retriev proc ieee int conf signal john smith chang tool techniqu color imag retriev proc spie storag retriev imag video john smith chang fulli autom imag queri system proc acm multimedia john smith chang enhanc imag search engin visual inform environ ieee multimedia signal process june john smith chang imag video search engin web proc spie storag retriev imag video john smith chang classi cation imag featur relat text proc europ san aug spie proc spie storag retriev imag video automat index retriev caption imag ieee comput sept marku alexand color index weak spatial constraint proc spie storag retriev imag video marku marku similar color imag proc spie storag retriev imag video michael swain dana ballard color index int comput michael swain interact index imag proc spie storag retriev imag video volum daniel swet john weng ecient imag retriev automat featur select proc ieee int conf imag retriev ecienc index tree adapt proc ieee workshop access imag video conjunct ieee cvpr takashi textur featur visual percept ieee tran tamura imag survei patt gabriel recognit posit rigid object algebra moment invari proc spie vol geometr method comput tom charl person maximum likelihood approach textur classi cation wavelet transform proc ieee int conf imag wallac owen mitchel shape analysi local shape descriptor ieee tran patt recog mach wallac paul ecient aircraft recognit algorithm normal fourier descriptor comput imag wang chang imag search appl columbia technic report jia raj acharya color cluster techniqu imag retriev imag proc ieee conf multimedia comput weibel miller imag descript summari imag metadata internet septemb ohio lib jan joan charl rosen eld compar studi textur measur terrain classi cation ieee tran white jain algorithm strategi similar retriev tr san white jain similar algorithm perform proc spie storag retriev imag video gao retriev engin multimedia inform system acm multimedia yang fritz fast comput invari geometr method give correct result proc ieee int conf imag hong yu wayn wolf algorithm imag retriev proc ieee int conf imag fourier descriptor plane close curv ieee tran zhang di zhong scheme visual featur base imag retriev proc spie storag retriev imag video
ML/226 6 increment induct wu william hw lo school comput scienc softwar monash road vic australia pacif rim intern confer artifici novemb abstract paper describ increment induct link exist induct algorithm learn increment noisi data make data gener reduct gener learn set rule refin previou set rule achiev oper call set exampl set deriv set exampl describ behaviour rule set rule extract behavior rule control previou rule order improv predict accuraci result show achiev improv exist algorithm experi term rule accuraci introduct exist machin learn algorithm gener distinguish categori algorithm process train exampl increment algorithm handl train exampl set static repositori set chang span learn set learn problem deal chang popul process exampl exist increment algorithm tediou process set larg exampl result learn revert stage state fisher increment learn predict result depend order data present paper design increment learn divid initi train set subset approxim equal run exist induct algorithm subset obtain set process remain data subset time incorpor induct result previou induct accumul discov rule data subset layer produc final integr output repres origin data accur noisi data origin data set partit diminish induct small data effect induct effici exist algorithm paper experi rule induct system case perform induct algorithm term rule complex predict accuraci increment induct increment induct appli learn data rule reduct rule gener process gener reduct work sequenti increment order learn refin rule increment data handl subset sequenti process sequenti increment case huge amount order avoid exponenti algorithm outlin initi data set partit number data subset approxim equal size random shuffl set rule learn subset exampl gener algorithm assumpt make gener algorithm produc solut learn problem approxim rule rule set refin data subset step perform transit learn refin previou set rule transit perform oper call deriv set behavior exampl examin behavior rule set step data subset behavior gener extract expect correct defect inconsist previou rule sequenc rule set gradual built success applic process accur complex rule sequenti handl subset exampl data partit data partit affect qualiti inform data subset turn affect perform induct main design aim origin data set evenli distribut exampl class partit process design shuffl exampl train set randomli put exampl class separ group count number exampl class group ratio number class randomli select exampl class group ratio put subset process perform time number paramet adjust ratio class group integ subset class group exampl class group exampl form insert remain exampl randomli exist subset gener gener compress initi inform involv observ train exampl identifi essenti featur common posit exampl train formul concept definit base common featur gener process view search space concept definit correct definit concept learn space concept definit heart gener problem li util train assumpt knowledg constrain search discrimin gener elimin adapt discrimin descript specifi express logic disjunct distinguish class fix number class minim discrimin descript shortest express minimum number distinguish object class object class descript minimum inform suffici identifi class fix number class discrimin descript convert gener rule gener rule transform descript gener descript tautolog impli initi descript gener rule falsiti mean event falsifi falsifi gener descript immedi observ law gener elimin gener elimin li concept star methodolog main origin logic prune base notion constraint gener descriptor discrimin drop simultan constraint subset discrimin maxim constraint minim set search maxim find integ set intersect constraint rule defin conjunct condit prove maxim discrimin gener discrimin exist element belong attribut discrimin condit discrimin search achiev graph exponenti respect number constraint subset intersect maxim gener elimin reduc size exponenti explor preliminari prune predic calculu reduct discrimin rule obtain appli predic calculu gener gener rule list formula repres condit statement repres complement system commut law associ law commut law distribut distribut morgan morgan law combin condit rule symbol resolut order gener condit rule reduct denot descript space learn set rule express number rule rule fire rule descript satisfi rule definit denot oper defin reduc descriptor ae fire rule transform descript class chang definit learn set rule set reduc learn denot ab gener ab class inform reduc learn set ab describ behaviour exampl express boolean initi gener carri reduc learn set produc refin set rule refin set rule appli subset origin train exampl obtain learn set number exampl reduc learn set ab gener number exampl initi learn set reduc learn set inform order enabl gener number exampl data subset refin previou rule learn gener reduc learn set ab refin rule set previou rule good predict inform implicitli reduc learn set ab fire exampl descriptor ab class exampl rule class correl ab descriptor class rule good predict accuraci discov gener process good rule carri argument ensur irrelev rule rule reduc descriptor irrelev respect ab gener detect drop irrelev rule learn ab previou irrelev rule person person train exampl number attribut number class miss valu misclassif level low low high low test exampl rule accuraci rule rule accuraci rule tabl summari experi gener discov link descriptor class reduc learn set ab exampl rule trigger trigger rule gener ab gener solv conflict previou rule experi set experi compar predict accuraci rule induct program experi tabl summari data set experi result copi california irvin machin learn repositori aha level select consist standard compon creat collect origin train set test set order exampl move set ran time train accuraci list tabl averag result test set perform accuraci differ statist conclud carefulli select number achiev improv term rule accuraci layer rule set test set accuraci tabl result experi experi experi check chang accuraci rule gener layer induct data set experi tabl show figur visual illustr result graph figur obviou accuraci induc rule test data number layer highest induct lowest reason train exampl gener subset train layer gener initi rule set layer rule accuraci test set layer question optim number layer train base experi carri depend size level train set size train set larg exampl exist layer learn deeper rule refin larg number layer small data gain inform gener approxim rule success turn affect complet consist final gener rule curv figur find test set accuraci significantli layer layer improv number layer approxim rule gener layer success refin learn layer rule consist fig rule accuraci induct layer experi final achiev optim level longer redund success learn stop optim rule final rule case layer accur final rule induct learn accur rule increment manner handl subset train exampl sequenti compar handl train exampl exist increment learn sequenti increment size data subset control data partit induct induct suit noisi data partit effect data subset experi carri paper quantifi gain improv rule accuraci achiev induct design handl larg noisi data set data found improv induct rule accuraci inform qualiti data set critic factor determin number layer number train number attribut domain attribut contribut factor appli data set futur work involv appli induct extend experi larger data set compar increment learn method learn learn increment case case treat case chunk partial match rule refer learn complex structur descript exampl comput graphic imag process element machin learn morgan kaufmann elementari set theori hong kong press theori methodolog induct learn artifici intellig knowledg repair evolut versu revolut intern machin learn rutger aha pm dw uci repositori machin learn data repositori depart inform comput ca program machin learn morgan kaufmann increment learn explan pattern indic seventh intern confer machin morgan kaufmann fisher case studi increment concept induct nation confer artif pp morgan kaufmann discrimin gener logic program knowledg organ machin learn knowledg acquisit ablex
AI/227 2 super logic program stefan urgen teodor przymusinski informatik universit institut ur rheinau koblenz super logic program stefan brass jurgen dix teodor przymusinski school inform pa usa dept comput germani dept comput ca usa abstract recent extens research reason logic program demonstr logic program suffici express formal import problem provid import test bed formal standard logic program suffer import limit unabl handl disjunct inform type negat interest research effort recent problem find suitabl extens logic program paradigm argu order demonstr class program justifi call extens logic program show syntax resembl syntax logic program appli significantli broader class program semant constitut intuit natur extens semant normal logic program semant close relat formal exist simpl procedur mechan comput paper specif class logic program call super logic program show class super logic program satisfi suffici flexibl extens modif provid descript prolog implement interpret super program kei logic knowledg semant logic program deduct preprint submit elsevi preprint june introduct relationship logic program knowledg formal briefli summar formal knowledg form default defin explicit negat oper implicitli present form default main differ logic program classic logic presenc default logic program simplest extens classic monoton logic recent extens research reason logic program made contribut understand relat exist logic program formal eventu discoveri deeper underli principl reason establish logic program repres simpl suffici express formal import problem provid fertil test ground formal shown number paper translat origin repres logic logic program advantag translat includ simplic natur knowledg mean logic program exist effici queri answer mechan logic program standard logic program suffer import limit unabl handl disjunct inform natur program applic disjunct statement situat reason case obviou exampl ffl approxim ag ffl legal judg freedom law uniqu ffl end fault diagnosi part machin faulti long possibl extend abstract paper intern confer principl knowledg reason doyl shapiro pp partial support nation scienc foundat grant ffl biolog parent blood group child blood group ffl natur languag possibl ambigu repres natur multipl intend ffl reason concurr exact sequenc oper multipl model ffl conflict multipl inform assum disjunct inherit formal promot disjunct reason express natur permit direct translat disjunct statement natur languag inform specif attent devot issu area knowledg default logic great deal difficulti handl disjunct knowledg attempt made literatur correct problem similar comment appli autoepistem logic interest research effort recent problem find suitabl extens logic program paradigm class normal logic program ensur proper treatment disjunct inform problem find suitabl semant disjunct program deduct prove complex case program order demonstr class program justifi call extens logic program argu ffl syntax program resembl syntax logic program appli significantli broader class includ class disjunct logic program class logic program strong negat ffl semant program constitut intuit natur extens semant normal logic ffl exist simpl procedur mechan suffic mention recent workshop extens logic program specif devot subject book minker al detail account extens research effort area comput semant ffl class program semant special case gener formal link formal paper specif class extend logic program call super logic program argu class satisfi suffici flexibl extens modif provid descript prolog implement interpret class ftp www standard logic program disjunct extend fragment classic call horn logic super logic augment express power true disjunct provid power formal simplest extens full classic logic addit express power disjunct logic program significantli simplifi translat inform specif logic program facilit logic program languag knowledg infer engin reason class super logic program close relat formal super logic program constitut special case express formal call autoepistem logic knowledg introduc earlier logic isomorph includ formal moor autoepistem logic mccarthi circumscript semant super program link formal demonstr spite super logic program admit natur simpl queri answer mechan easili implement test discuss exist implement paper needless problem find suitabl infer capabl model human observ mechan principl due inher problem comput answer posit disjunct effici restrict specif subclass program queri effici approxim method broader class program major research implement problem artifici intellig paper organ section recal definit basic properti knowledg simpl highli express class theori introduc earlier przymusinski section establish power semant knowledg foundat remain result obtain paper section introduc class super logic program special subclass class knowledg base establish basic properti super program section describ import syntact semant due restrict natur super significantli simpler applic arbitrari knowledg base section briefli describ implement interpret base establish semant conclud final remark section sake proof appendix restrict attent proposit program proposit instanti semant restrict limit gener obtain result knowledg base defin notion knowledg base super logic defin section special knowledg base fix proposit languag standard connect proposit letter true denot set proposit extend languag proposit modal languag augment modal oper call default negat oper formula form arbitrari formula call default negat atom default atom consid atom formula extend proposit modal languag formula origin languag call object proposit theori modal languag call nonmonoton knowledg base definit knowledg base knowledg base arbitrari theori proposit languag set arbitrari bm object atom arbitrari formula affirm knowledg base theori satisfi condit ration knowledg base theori satisfi condit affirm knowledg base theori satisfi condit object atom head ration knowledg base theori default atom head observ arbitrarili deep level nest default negat languag assum simpl axiom schemata infer rule describ arguabl obviou properti default consist distribut formula invari infer formula consist axiom state assum default true axiom state default negat distribut respect disjunct invari infer rule state formula default negat mean depend specif form formula formula true refer remark discuss assum distribut axiom interpret map fnot simpli treat formula proposit notion model carri proposit logic formula proposit consequ iff interpret repres model set liter show truth valu object default atom relev definit formula knowledg base denot smallest set formula languag instanc axiom close proposit consequ invari rule formula deriv knowledg base belong denot fact knowledg base consist belief theori notion knowledg base defin complet notion belief theori autoepistem logic origin defin przymusinski belief theori defin proposit languag augment belief oper default negat oper order translat knowledg base belief theori replac give default negat intend mean order translat belief theori knowledg base replac bf give belief atom bf intend mean assum true bf reader interest detail consult section appendix recal definit belief theori establish knowledg base belief theori notion notion knowledg base suit introduct class super logic program paper languag nonmonoton knowledg base sake major result paper restat languag belief theori logic proposit immedi hold proposit knowledg base formula statement formula default negat true statement formula hold default assum formula hold default recal formula intuit read assum true infer rule formula deriv true default intend mean default negat knowledg base equip semant intuit mean provid mean default negat atom intend mean default atom base principl predic minim hold minim entail hold minim model order make intend mean defin minim model knowledg base definit model model smaller model default atom fewer object fp pg ae fp ff ff minim model knowledg base model properti smaller model formula true minim model write min minim entail minim model obtain assign arbitrari truth valu default atom minim object atom reader familiar mean circumscript knowledg base object atom minim default atom min simpl knowledg base car broken prove minim entail min order find minim model assign arbitrari truth default atom minim object atom car run easili minim model valu remain belief atom irrelev fnot car broken deduc min car min static moor autoepistem intend mean default negat atom knowledg base enforc defin suitabl definit knowledg base knowledg base call static knowledg base satisfi cn fnot min rang formula static coincid obtain ad default negat formula minim model close result consequ oper cn remark state languag belief definit min fg formula static min formula default static negat minim entail definit static formal enforc intend mean default atom previou subsect hold default atom forc fa ag consist static hold min ration knowledg default atom occur true ration fact default explicitli assert implicitli infer virtu minim entail underli formula theorem default negat static ration knowledg base formula iff min remark difficult prove ration formula iff explain assum distribut axiom fact assum default drink drive time necessarili conclud assum default dont drink assum default dont drive time express languag belief section belief disjunct formula necessarili impli belief bf belief bg direct easili axiom specif distribut axiom conjunct case simpli ad list axiom turn knowledg base static iter definit fix point monoton default closur cn fnot min arbitrari knowledg base rang formula theorem static knowledg base static fix point monoton default closur oper static construct ff defin ordin number ff fi ff successor ordin ff def cn fnot ff min rang formula fi limit ordin defin fi ff sequenc ft ff monoton uniqu fix point ordin result establish static complet knowledg base theorem static static knowledg base coincid smallest theori satisfi cn min proof static satisfi condit condit oper monoton theori conclud ff ordin ff conclud observ static formula true static constitut call static complet knowledg base strictli speak oper monoton lattic theori form cn fnot lemma definit complet static static knowledg call static complet describ static semant knowledg base predic complet semant logic program complet determin clark complet static semant knowledg base fulli determin static complet easi verifi knowledg base consist static complet consist static turn static complet affirm knowledg introduc definit consist theorem static complet static complet affirm knowledg base consist time discuss exampl explicitli describ static ignor nest default list element skip member simpl discuss car broken establish minim entail static complet broken static complet deriv broken run coincid perfect model semant stratifi program slightli complex knowledg base broken ix order iter comput static complet easili check min ix cn fnot min ix broken cn fnot min proposit conclud broken min cn fnot min infer run static complet assert car consid fix broken run condit result semant coincid perfect model semant stratifi program remark theorem fix point fact reach iter default negat oper static complet clark complet easi knowledg base finit construct static complet static stop countabl step power result obtain section show static complet finit knowledg base fact obtain mean singl iter default closur oper result elimin multipl iter comput static complet replac definit static complet explicit definit clarifi notion static complet finit foundat remain result obtain paper close relat result establish interest intrigu relationship static complet clark complet finit knowledg base show static complet knowledg base coincid cn fnot set formula deriv knowledg base formula fnot result appli call residu show finit knowledg base transform finit residu knowledg base minim model clark complet easili result reduc reason static semant underli modal logic hand autom theorem proof power result base idea ad knowledg base set formula ensur model default negat oper fact minim task accomplish suitabl gener clark complet work restrict class knowledg object residu introduc investig class logic program give slightli gener definit definit knowledg base residu knowledg base arbitrari knowledg base object set arbitrari object atom arbitrari formula object atom consid singl object atom describ natur extens notion clark complet clark complet initi introduc class normal logic program gener disjunct program posit studi extend class residu knowledg base goal ensur object atom true rule bodi true head liter definit clark finit residu knowledg base object atom falsiti atom defin extend clark complet atom atom head clark complet knowledg base union complet object atom languag falsiti atom interest result show residu knowledg model clark complet minim model clark complet describ minim model semant residu knowledg base proposit finit residu knowledg base interpret languag minim model model clark complet proof appendix worth point weak origin version clark complet fact appli residu arbitrari normal program clark origin complet enforc minim model made complet axiom useless problem origin definit clark complet distinguish logic negat default negat clark complet inconsist rule present remark interest note repres disjunct program replac fact obtain stabl model fact comput stabl semant disjunct program definit clark appli class residu knowledg turn finit knowledg base transform finit residu knowledg base set minim model coincid proposit finit knowledg base transform finit residu knowledg base call interpret languag minim model minim model proof appendix elementari partial suffici obtain residu program detail definit transform reader refer describ briefli remov rule atom head bodi rule trivial satisfi useless transform call defin object atom rule rule head applic rule result knowledg base obtain delet rule br ad knowledg base rule give simpl tradit notat knowledg base requir form unfold bodi liter obtain residu program easili procedur repres form consequ proposit obtain import theorem finit knowledg base clark complet describ minim model semant theorem finit knowledg base interpret languag minim model model clark complet denot set fnot augment knowledg base ensur formula belong clark complet assum true default lemma lemma arbitrari finit knowledg base cn formula minim model proof appendix readi state fundament result obtain section theorem complet clark static complet finit knowledg base defin cn proof appendix result state static complet obtain augment set ensur formula belong clark complet assum true default establish interest intrigu relationship static complet clark complet finit knowledg base reduc reason static semant comput static complet easili accomplish comput clark complet underli modal logic hand autom theorem remark state languag result state static complet obtain augment belief bf formula belong clark complet consequ proof result immedi obtain fundament theorem obtain power result state static complet arbitrari finit knowledg base obtain singl iter default closur oper theorem static static complet finit knowledg base obtain singl iter default closur oper cn fnot min theorem state static complet obtain augment negat default formula minim model theori elimin multipl iter comput static complet replac definit static complet explicit definit addit theorem fourth static complet present paper needless exist point definit static complet significantli simplifi notion underli theori foundat remain result obtain paper remark state languag result min fg state static complet obtain augment belief bf formula minim entail theori knowledg base broken ix note min ix ix cn fnot min impli broken proposit belong static complet broken lemma broken belong complet easi verifi min broken run formula broken run belong clark complet min broken broken written form broken broken distribut axiom da broken appli formula proposit conjunct broken belong run conclud static semant deriv broken run observ reason util iter default closur slightli complex iter perform remark work close relat paper author defin circumscript semant disjunct program nest default introduc concept minim model entail fix default atom defin semant singl step applic circumscript ad strong negat knowledg base point addit default nonmonoton reason requir type negat similar classic negat satisfi law exclud middl strong negat easili ad knowledg ffl extend origin object languag ad object proposit symbol call strong negat result obtain object languag extend modal languag ffl ad strong negat strong negat atom true ensur intend mean opposit proposit describ properti proposit describ properti strong negat axiom state person qualifi qualifi addit strong negat simpli result knowledg result state appli knowledg strong negat super logic program introduc class super logic briefli call super subclass class knowledg base power class includ proposit disjunct logic program extend logic program strong tion section definit logic super logic program knowledg base consist infinit arbitrari posit object formula observ formula written finit conjunct disjunct replac finit set head disjunct atom posit conjunct bm object atom oper obei distribut law disjunct default atom replac conjunct default atom conjunct object atom establish fact proposit super logic program defin set infinit bm object atom conjunct object atom program call affirm class proposit theori syntact significantli broader class normal logic program broader class program refer disjunct logic program ffl rule addit strong negat shown section assum strong negat axiom program rule ffl form atom conjunct atom prove reason default assumpt interpret state assum default man human repres strong negat formula repres disjunct conjunct atom class super program significantli gener class knowledg base nest default negat consist ration knowledg base static complet super program admit simpler feasibl comput relev part involv arbitrarili deepli nest default inher infinit finit program section provid power static complet super program implement interpret super program discuss gener properti super program give simpl class super program number properti super program ration knowledg theorem immedi formula static semant super program deriv minim entail theorem super logic program static complet formula min result summar basic properti super program consequ proposit result establish theorem properti super ffl affirm super program consist static complet appli disjunct logic program ffl normal logic static semant coincid semant correspond consist static normal program partial stabl model stabl model correspond consist static satisfi axiom object atom ffl posit disjunct logic static semant coincid minim model semant simpl happi disappoint usual interpret disjunct conclud visit australia europ expect answer queri posit answer queri neg expect posit answer queri happi neg answer queri disappoint observ queri intuit mean assum default dont visit europ queri assum default dont visit europ dont visit turn static semant produc intend mean discuss happi belong static complet easi check hold minim model program true complet prove hold complet minim model belong complet infer proposit hold minim entail impli disappoint belong complet static semant disjunct stabl semant section briefli relat static semant super program disjunct stabl popular semant earlier disjunct program addit inform discuss involv semant disjunct logic program relationship static reader refer state theorem static semant extend stabl semant program stabl model normal program special case static full power stabl semant captur mean static restrict normal stabl semant suffer import drawback compar static semant import drawback fact stabl semant defin natur intuit program illustr work sleep tire angri paid rule describ obviou natur mutual relationship proposit work provid suffici inform determin individu truth falsiti statu proposit work proposit paid consid true negat lead static program impli paid angri program rule mutual relat work sleep work true immedi conclud sleep tire belief paid angri remain unchang worth prolog return answer fit extens clark semant easi stabl appli normal program contradictori undefin unabl establish fact truth predic paid angri inform mutual relationship exist predic work sleep compar behavior semant broader class point class super program strictli broader class disjunct logic program compar semant broader class necessarili limit discuss class disjunct logic program illustr fact stabl semant contradictori simpl natur normal logic program state theorem static semant normal program partial stabl semant partial stabl semant stabl semant provid mean program contradictori standard stabl semant case disjunct situat static semant consist disjunct shown previou nice easi produc simpl intuit disjunct program disjunct stabl semant disjunct partial stabl semant inconsist illustr suffic add previou simpl disjunct work sleep work sleep result disjunct program defin static semant predic work sleep hold true stabl partial stabl semant program contradictori addit fact stabl semant contradictori simpl natur suffer number structur problem stabl semant answer queri depend call graph queri composit highli desir properti softwar engin kr static semant nice structur properti fix point static complet due proposit languag super logic program restrict subset proposit logic set fnot conjunct object atom languag nest default negat default negat appli conjunct object atom note treat essenti set invari infer rule truth differ sequenc multipl atom conjunct order answer queri super program formula restrict languag belong static complet comput restrict static complet languag nice lot feasibl comput restrict comput full involv arbitrarili deepli nest default negat inher infinit finit program import result posit solut problem form simplifi syntact fix point static complet section provid solut form static complet theorem restrict static complet finit super program languag construct defin natur number defin cn fnot em min rang conjunct object atom cn denot standard proposit consequ oper special case empti conjunct identifi true sequenc fp monoton uniqu fix point natur number restrict static complet languag proof appendix theorem repres simplif origin static complet theorem modal consequ oper definit standard proposit consequ oper cn rang set deepli formula languag involv conjunct object atom simplif greatli enhanc implement static semant finit program due restrict languag longer expect fix point reach theorem static complet complement theorem provid static complet finit super program model static complet restrict narrow languag result directli prototyp implement queri answer interpret static semant briefli section definit obj set proposit valuat object atom set proposit valuat default atom fnot interpret case call interpret languag valuat reduc interpret write obj obj obj order call interpret complet languag valuat full interpret full interpret call restrict obj languag reduct interpret obj assign truth valu atom occur super model relat interpret super program defin call obj minim model super program object interpret obj satisfi fp obj pg ae fp obj pg obj model complet compat notion full interpret goal section reduct full model static complet finit super program interpret default find object part reduct easi idea comput interpret close relat kripk structur modal detail appendix world kripk structur mark object formula true world iff true world due consist world world static semant ensur world world mark minim object model set minim object interpret default atom section mention sequenc sibl iff subset object interpret world iff obj obj minim object model depend interpret default atom minim model object part default restrict default minim object model result formal definit interpret default super program obj yield minim object model interpret default atom obj obj obj minim model obj call iff obj obj oper obj yield interpret default minim object model obj obj obj model oper composit note addit constraint definit extend model trivial satisfi affirm program head liter rule readi state main result section theorem finit super oper monoton lattic subset order iter begin set interpret default bottom element fix point consist default part full model reduc interpret obj reduct full model iff obj proof appendix logic program step suffic default atom occur influenc object atom sake start set valuat default atom conjunct default atom default interpret extend minim reduc model list tabl note model number equal model number true show true true true true true true true true true true true true true true true true true true true true true true true true true true true true true interpret minim model interpret true minim possibl minim valuat object part minim true true true note object model minim model base interpret default atom interpret input applic minim object interpret immedi default interpret translat truth falsiti combin minim object part conjunct true true element set minim model true true true true true true mean model number remain current knowledg default object part true true valuat default atom fix point true true true true reduc model static consist reduc interpret includ default part model comput reduct full interpret easi definit defin kripk structur extend reduc interpret full model static complet observ full model static reconstruct obtain repres class reduct easili verifi program fp pg infinit full model implement implement interpret static semant class super program base explain detail prototyp implement work larg number default imposs construct explicitli set valuat number object atom suffic default atom occur explicitli default atom influenc minim model extend valuat occur default atom consist valuat default atom reduc number default atom occur program evalu simpl case directli deriv disjunct fact delet rule disappoint bodi true special case transform delet rule elimin default atom step algorithm comput residu program appli reduct oper defin transform preserv minim significantli reduc number default atom default atom remain input program stratifi appli definit section liter point worth mention order comput minim model extens clark complet interpret default atom occur residu evalu rule set posit disjunct comput complet treat model gener algorithm algorithm gener minim model instanc algorithm effici algorithm integr framework ineffici subset requir definit order check interpret default atom select maxim interest construct set consist obj default obj obj immedi destroi requir properti check wether construct check default atom obj obj program output fix point minim reduc default part wait queri queri super program answer basi minim model conclud section recal main contribut work present articl point relat work final discuss result point specif problem expect techniqu matter part paper prove power static semant finit knowledg base belief main fundament result show static complet knowledg base fact obtain mean singl iter default closur oper result elimin multipl iter comput static complet replac definit static complet explicit definit close relat establish interest intrigu relationship static complet clark complet knowledg base belief clark complet easili effect reduc reason static semant underli modal logic clarifi notion static complet finit knowledg power provid foundat remain result obtain paper part introduc class subclass class knowledg base show class program properli extend class disjunct logic logic program strong negat arbitrari proposit theori demonstr semant super program constitut intuit natur extens semant normal logic program restrict normal logic coincid natur correspond class partial stabl model normal program establish addit static semant finit syntact turn lead procedur mechan comput due restrict natur super import significantli simpler applic arbitrari knowledg base basi implement interpret ftp www note comput mechan due inher problem comput answer posit disjunct effici restrict specif subclass program queri research produc effici approxim method class knowledg class super constitut special case express nonmonoton formal call autoepistem logic knowledg introduc earlier isomorph includ formal moor autoepistem logic mccarthi circumscript semant super program link formal semant framework super program suffici flexibl extens modif theorem assum addit axiom produc stabl semant semant ad distribut axiom conjunct obtain semant extend disjunct stationari semant logic program introduc modif extens includ variat notion minim model result interpret disjunct present current technic limit finit proposit easili extend disjunct datalog program variabl rule posit bodi liter relat work attempt gener syntax logic program due lloyd topor arbitrari formula bodi import order map queri view definit logic program rule head rule singl atom semant differenti atom occur head negat occur semant invari logic transform lloyd topor clark complet defin mean default static semant extend semant treat quantifi formula knowledg normal transform lloyd topor work semant mean lloyd topor wf clark special case static semant formula form addit project similar project disjunct logic program theoret vienna call dlv knowledg offer advanc kr formal kernel extend disjunct logic program true negat integr repres complex knowledg base problem highli declar fashion modular evalu techniqu linguist extens deal quantit inform lifschitz al introduc nest express bodi rule approach larger class formula bodi restrict semant answer restrict semant nest rule rule head author show captur full level polynomi hierarchi term express power success approach gener logic program languag higher order logic extens orthogon treatment negat context arbitrari proposit formula illustr introduct express disjunct inform extend normal logic program disjunct program ad express full level polynomi hierarchi posit recent research shown problem formul natur transform disjunct program solut origin problem correspond minim model disjunct program project demonstr diagnosi setup logic descript system observ transform disjunct program interpret disjunct logic program comput minim diagnosi view updat problem deduct relat transform problem comput minim model disjunct program import applic disjunct techniqu area glue heterogen provid singl unifi view user expand world wide web million million data thousand format thrown user tool put inform interest shown disjunct logic program mediat import tool creat power queri languag access web problem analyz rule set calcul bank fee credit institut sell stock share custom charg account fee depend custom type paramet formul set rule natur languag problem translat rule set formal languag analyz properti rule set calcul fee busi fee straightforward translat proposit logic theorem prover work turn disjunct logic program solv problem satisfi disjunct version stabl semant cautiou version disjunct semant recent shown formal suitabl restrict framework sublanguag coincid semant brass dix mention end subsect inconsist stabl modular call composit static semant properti method queri optim base depend graph queri appli reduc comput intend stabl make static semant preprocess mean infer engin design disjunct stabl semant util result analog case high perform stabl model engin call due fact comput wf process significantli reduc program properti explain set atom properti hold disjunct case wf replac instanc static semant static semant sound comput stabl model link framework tableau base procedur effici standpoint run polynomi refer inform acknowledg author express deep appreci lui moniz pereira jose alfer comment author greatli indebt anonym review detail insight comment refer jose lui teodor przymusinski negat reason logic program journal autom jose julio alfer moniz pereira logic program semant kind negat logic joint intern confer page novemb mit press jose julio alfer moniz editor reason logic lnai springer aravindan peter baumgartn ration effici algorithm view delet jan logic intern page mit jurgen ilkka niemela research project disjunct logic program ai peter peter ulrich wolfgang nejdl semant guid theorem prove diagnosi applic martha intern joint confer artifici intellig page stefan brass jurgen dix gener approach comput disjunct semant nonmonoton extens logic lnai page stefan brass jurgen dix disjunct stabl semant partial evalu journal logic abstract stabl semant partial evalu intern page lnc stefan brass jurgen dix disjunct wellfound confluent calculi iter gcwa journal autom abstract confluenc iter gcwa logic artifici jelia page lnc stefan brass jurgen dix semant disjunct logic program base partial evalu journal logic accept abstract disjunct semant base partial intern logic program page mit stefan jurgen ilkka teodor przymusinski comparison static disjunct semant implement principl knowledg sixth intern confer page san morgan tr koblenz stefan brass udo queri evalu partial order default stefano katsumi shalom deduct int number page springer gerhard brewka jurgen dix knowledg extend logic program gabbai handbook philosoph volum chapter reidel bry composit semant logic program deduct joint intern confer symposium logic page septemb mit press bry minim model gener posit unit tableaux workshop theorem prove analyt tableaux relat page bry logic program formal applic proc eighth acm symposium principl system page bry negat logic formal construct logic dimitri inform system artifici integr page springer francesco nicola rullo strong weak constraint disjunct datalog intern confer logic program reason page juli mello modular logic program journal logic keith clark negat failur gallair logic page editor logic program knowledg springer jurgen dix semant normal logic ii weak properti fundamenta jurgen dix semant logic intuit formal properti overview andr fuhrmann han action inform essai logic philosophi artifici page jurgen lui teodor editor nonmonoton extens logic lnai springer verlag workshop eleventh intern logic program santa june jurgen lui teodor editor nonmonoton extens logic lnai springer verlag workshop intern logic program septemb dung fixpoint approach declar semant logic program el ra north american confer usa mit octob dung natur semant logic program negat el ra confer foundat softwar technolog theoret comput springer roi peter editor extens logic lnai springer thoma eiter georg gottlob complex aspect semant disjunct proc twelfth acm symposium principl system page thoma eiter georg gottlob von thoma georg mannila ad disjunct datalog proc thirteenth acm symposium principl system page thoma nicola gerald francesco scarcello deduct system nonmonoton reason jurgen ulrich intern confer logic program nonmonoton reason number lectur note ai springer thoma nicola gerald francesco scarcello kr system progress comparison benchmark sixth intern confer principl knowledg reason forthcom gelfond lifschitz compil circumscript theori logic program workshop juli page gelfond lifschitz stabl model semant logic program kowalski logic program page associ logic mit press gelfond lifschitz logic program classic negat seventh intern logic program page associ logic mit press truszczynski disjunct default intern confer principl knowledg page morgan michael teodor przymusinski relationship circumscript negat failur artifici scarcello disjunct datalog nest rule logic program knowledg lnai joshua dale miller logic program fragment intuitionist linear logic journal inform turner nest express logic program dix kr page tr jr semant issu connect incomplet inform acm transact john lloyd rodnei topor make prolog express journal logic john lloyd rodnei topor basi deduct system journal logic john lloyd rodnei topor basi deduct system ii journal logic jorg jack rajasekar foundat disjunct logic program marek truszczynski nonmonoton contextdepend reason john mccarthi form nonmonoton reason artifici jack minker indefinit close world assumpt confer autom page springer jack minker overview nonmonoton reason logic program journal logic special jack minker logic year retrospect pedreschi carlo intern workshop logic lnc page dale miller horn journal associ comput machineri ilkka niemela tableau calculu minim model reason workshop theorem prove analyt tableaux relat page lnai ilkka niemela simon effici implement wellfound stabl model semant joint intern confer symposium logic page septemb mit press pool logic framework default reason artifici przymusinski knowledg framework base autoepistem logic minim belief twelfth nation confer artifici august page lo confer american associ artifici morgan kaufmann teodor przymusinski semant normal disjunct logic unifi framework workshop extens logic program eleventh intern logic program santa june page teodor przymusinski semant coincid stabl semant fundamenta teodor przymusinski static semant normal disjunct logic program annal mathemat artifici special issu disjunct program teodor przymusinski autoepistem logic knowledg belief artifici sakama seki partial deduct disjunct logic declar approach logic program synthesi transform meta program lnc page springer schafer gerd open world theorem prover logic program fourth intern lnai page june springer frieder stolzenburg bernd thoma rule set calcul bank fee theorem prover constraint intern confer practic applic constraint page practic applic compani frieder stolzenburg bernd thoma rule set calcul bank fee theorem prover wolfgang peter autom deduct basi applic kluwer academ composit semant normal open logic program joint intern confer symposium logic page septemb mit press bernd thoma intellig web queri logic program dix st workshop infer system nation german ai confer ki germani tr august allen van kenneth john schlipf semant gener logic program journal preliminari abstract seventh acm symposium principl march pp yuan autoepistem circumscript logic program journal autom knowledg base belief theori notion knowledg base defin paper notion belief theori autoepistem logic origin defin przymusinski belief theori defin proposit languag augment belief oper default negat oper order translat knowledg base belief theori replac order translat belief theori knowledg base replac bf simpli view shorthand vice bf view shorthand definit knowledg addit axiom deriv rule logic obviou logic recal definit belief theori formal establish logic fix proposit languag standard connect proposit letter true extend languag proposit modal languag augment modal oper call belief oper atom formula form bf arbitrari formula call belief atom formula origin languag call object proposit theori modal languag call belief theori assum simpl axiom schemata necessit infer rule describ arguabl obviou properti belief consist normal formula necessit infer formula bf axiom state falsiti believ axiom state formula impli formula true true necessit infer rule state formula proven true believ true definit deriv belief belief theori denot smallest set formula languag theori instanc axiom close standard proposit consequ necessit rule formula deriv theori logic belong denot fact belief theori consist theori consist presenc axiom axiom axiom bf state formula reader familiar modal logic clear normal modal logic modal satisfi consist dead axiom order translat knowledg base belief theori replac give default negat intend mean axiom rule consist distribut formula bf bg invari infer formula bf bg consist axiom state true believ believ axiom state belief distribut respect conjunct invari infer rule state formula belief formula mean bf depend specif form formula order show notion knowledg base notion belief theori suffic show axiom necessit rule axiom infer rule proposit base belief axiom necessit rule axiom infer rule theori languag instanc axiom close standard proposit consequ necessit rule instanc axiom close standard proposit consequ infer rule proof theori instanc axiom close standard proposit consequ necessit rule true belong necessit rule axiom hold show axiom hold show formula bf bg belong necessit rule normal axiom infer bf bg bf bg show axiom hold suffic prove formula bf bg belong necessit rule normal axiom infer bf appli normal axiom conclud bf show bf bg demonstr infer rule hold belong belong normal axiom immedi bf bg theori instanc axiom close standard proposit consequ infer rule axiom hold belong rule belong axiom conclud bf bg belong prove belong normal axiom hold remain show close necessit belong true rule formula bf belong impli bf belong order translat belief theori knowledg base replac bf give belief atom bf mean assum true proof theorem section proof proposit model complet axiom atom satisfi direct satisfi model assum direct satisfi complet model direct satisfi rule true true interpret differ model minim minim model satisfi rule direct complet axiom violat assum smaller model minim object atom complet axiom contraposit proven opposit minim model model satisfi complet axiom smaller hand side true conclud proof proposit prove finit knowledg base transform finit residu knowledg base call interpret minim model minim model show knowledg base transform residu knowledg base appli detail definit transform reader refer describ briefli remov atom head bodi transform call defin object atom rule rule head applic rule result knowledg base obtain delet rule ad knowledg base rule easi applic combin tautolog remov object atom bodi introduc bodi mean finit number transform lead knowledg base bs bodi appli procedur object atom knowledg base produc residu knowledg base order prove proposit suffic establish lemma lemma knowledg base result applic delet tautolog minim model delet tautolog chang set set minim model appli rule object rule rule head ffl rule result applic logic consequ rule model model ffl minim model show model necessarili rule violat rule mean minim model interpret equal model object atom occur negat rule mean rule rule atom exclud multipl occurr infer rule violat contradict show set minim model ffl minim model part model smaller minim model part proof model contradict assum minim model ffl minim model model smaller model model lead contradict proof lemma prove lemma minim model special knowledg base lemma knowledg base set formula default atom minim model minim model satisfi proof ffl minim model model smaller model differ interpret default model model contradict assum minim ffl minim model satisfi model model exist smaller model contradict minim rule aa rr unfold rule tautolog violat continu proof lemma lemma arbitrari finit knowledg base cn formula minim model subset consist default negat axiom instanc axiom formula forc deriv rule model coincid model requir closur logic consequ chang set model lemma minim model minim model satisfi hold minim model proposit minim model coincid model hold model proposit consequ compact proposit finit subset ff ff tautolog proposit necessit proposit closur classic conclud proof theorem cn show cn fnot min ffl theorem min min hand side ffl min theorem proposit tautolog proposit proposit lemma conclud mean prove fix point default closur oper static conclud fix point coincid static complet kripk model static prove prove theorem easili construct model static kripk structur lemma proof theorem interest super program reduc section arbitrari belief theori full model order briefli repeat definit kripk structur axiom entail normal suffic normal kripk definit kripk structur tripl consist ffl nonempti set element call ffl relat world world ffl map assign world valuat obj object atom definit formula valid formula world kripk structur defin ffl object atom ffl negat ffl disjunct proposit connect ffl default negat atom kripk structur world proposit interpret valuat simpli make object belief atom true iff proposit connect defin kripk structur standard proposit theorem structur yield static arbitrari belief theori kripk structur satisfi ffl ffl interpret model ffl interpret minim model minim model ff fg static proof ffl consist part show requir ffl distribut show formula distribut axiom hold simpli appli ffl invari infer hold hold ffl closur proposit formula proposit consequ mean formula valid world close proposit mean proposit connect defin standard case ffl min minim model show show condit minim model model smaller model minim model satisfi theorem simpl construct model static interpret model static subset static corollari kripk structur satisfi condit theorem interpret model static knowledg base broken ix construct kripk model world valuat obj world run add world valuat obj ff world world minim model show static semant impli impli ix negat cleanli separ classic negat theori fp logic program claim section static program infinit model kripk structur gener oe set world visibl relat world world true world world world true kripk model construct section oe note world default atom interpret world make incom edg final present kripk structur yield infinit oe oe oe oe oe explain world yield interpret trick world world true world identifi number nest belief world formula true world world world rise full model explain theorem corollari theori fp infinit full model proof prove reduc model obj extend full model static proof base kripk structur mention section definit kripk super program call kripk structur defin kripk greatest fixpoint ffl set world reduc interpret obj interest satisfi ffl iff minim model ffl valuat reduc interpret obj object part obj denot full interpret satisfi default atom true world reduc interpret obj assign truth atom kripk structur assign truth construct truth valu lemma obj proof ffl hold world satisfi ffl fixpoint definit default atom true intersect true negat obj obj qm obj definit obj minim model world valuat obj lemma reduc interpret full interpret model static proof show condit theorem ffl show world obj world definit subset obj satisfi obj definit obj minim model hold ffl reduc interpret satisfi program lemma atom occur model ffl reduc interpret minim model full interpret minim model smaller model reduct smaller model lemma order conclud default theorem conclud formula true world static model static static model lemma proof simpl appli axiom fm fm invari infer rule appli side distribut impli insert precondit requir formula lemma full model static obj reduct proof show induct default part model static complet set default interpret assum show applic obj default atom obj show properti requir definit show obj obj impli empti conjunct logic true consist obj hand side trivial true direct trivial construct show default atom obj obj default atom true finit object proposit occur formula violat lemma show formula follow formula static semant requir min minim model violat satisfi case mean minim model induct default part object part obj obj obj requir element theorem directli lemma lemma theorem finit super oper monoton lattic subset order iter begin set interpret default bottom element fix point consist default part full model reduc interpret obj reduct full model iff obj proof monoton work set mean minim object object model obj base default interpret obj construct subset part mean full model belief part direct lemma direct lemma fact default interpret extend reduc model obj make object atom true obj part requir reduc interpret obj full model reduct obj direct lemma direct trivial lemma remark note finit proof lemma infinit construct yield model static necessarili yield reduc model differ fq ing fr ing construct exclud interpret make true plausibl exclud question research proof fixpoint prove theorem show formula default interpret remain applic monoton sequenc lemma proof proposit consequ oper cn monoton influenc minim suffic show sequenc fnot em min monoton proof induct case trivial larger induct hypothesi formula default atom lemma yield minim model subset minim model min impli min small problem principl infinit default negat requir program finit default default interpret assign truth valu exclud definit super program default interpret call regular wrt iff ffl fp fq ffl occur lemma regular proof ffl interpret satisfi fp fq ffl minim model satisfi occur lemma lemma set formula form obj proof proof induct case model ffl show violat formula em mean definit object model obj obj obj definit default interpret obj minim model induct hypothesi lemma conclud minim model mean min em model critic formula empti conjunct syntact introduc model precondit imposs em ffl lemma induct hypothesi show applic obj obj show obj obj impli obj obj belief atom true satisfi condit order make set conjunct proposit occur requir proposit show formula em contradict obj minim model show satisfi induct hypothesi obj obj formula trivial satisfi minim model mean obj valid impli valid consid construct assum element violat obj lemma proof show induct impli statement close consequ trivial min theorem definit cn differ addit formula default atom proposit consequ induct lemma minim model minim model min min mean lemma em complet proof theorem fixpoint reach finit number lemma finit number default negat iter ensur suffic finit number implic em set monoton reduc interpret obj lemma proven theorem impli reduct full model static impli direct lemma set close proposit close proposit reduc interpret imposs model model remark finit proof strongli conjectur infinit construct yield model static complet give hint theorem hold infinit program question topic futur research research report stefan urgen teodor przymusinski super logic program urgen dix logic program paradigm stefan urgen burkhard ulrich zukowski comput model manfr kamp greql ein ur da peter urgen angelika manfr andrea winter und formal grundlagen peter da org thoma marx workflow model wfmc dieter obel schedul criteria ag constraint process hard system ulrich furbach disjunct logic program horn program control program andrea schmid solut count infin problem distanc vector rout ulrich michael frieder stolzenburg proof debug peter sch model elimin simplif applic softwar verif bernt andrea peter urgen ebert program system urgen jorg lobo logic program nonmonoton reason kurt carlo jan technischen anwendungen manfr kamp manag softwar repositori program tool gener approach peter baumgartn hyper tableaux gener jen agent architectur model ma social scienc marcel softwar global illumin research marcel de urgen bernt andrea cycl step jose urgen mauricio osorio confluent rewrit system logic program semant lutz note nondeterminist comput stephan system model lutz mauric finit test tube predict peter baumgartn der der ag jen thoma marx angelika franzk object orient system angelika franzk recommend improv urgen lui moniz teodor przymusinski logic program knowledg ilp lutz uniform approach interleav semant petri net ulrich furbach workshop model base autom reason urgen frieder stolzenburg framework incorpor reason constraint logic program carlo thoma marx petri net tool andrea winter doctor consortium advanc inform system june urgen roger omt metamodel stefan urgen teodor przymusinski super logic program urgen mauricio osorio semant suitabl aggreg peter baumgartn ration effici algorithm view delet wolfgang dieter obel integr fix prioriti static schedul maintain extern consist urgen alexand oper semant visual notat thoma marx april der urgen manfr andrea winter gener system support understand heterogen softwar roger urgen ebert booch metamodel urgen lui teodor przymusinski logic program reason angelika franzk gral refer manual ulrich furbach view autom reason artifici intellig urgen ilkka niemel research project disjunct logic program wolfgang albrecht ur oder kurt lautenbach action logic correct prove frieder stephan ulrich martin constraint logic program comput linguist kurt ridder die linear algebra der ein peter ulrich furbach refin restart model elimin peter peter fr ulrich wolfgang nejdl tableaux diagnosi applic urgen roger uh case lutz algebra petri net semant lu minim model gener base tableaux frieder stolzenburg flexibl system constraint disjunct logic program ilkka niemel workshop integr nonmonoton autom reason system urgen lui moniz teodor przymusinski extens logic implement applic workshop aravindan disjunct logic program system base protein theorem prover urgen gerhard brewka knowledg logic program lutz applic composit petri net semant peter ulrich furbach calculi disjunct logic program klau physic base volum render object graph base model implement angelika franzk queri graph structur ql aravindan abduct framework negat disjunct logic program peter ulrich ilkka niemel hyper tableaux ilkka niemel simon effici implement stabl model semant ilkka niemel implement circumscript tableau method ilkka niemel tableau calculu minim model reason stefan urgen teodor przymusinski implement static semant disjunct program urgen manfr andrea winter gener support understand heterogen softwar stefan urgen ilkka niemel teodor przymusinski comparison static semant ebert altern ur und bad dix furbach mit negat und composit petri net semant engel specif object life cycl definit marek reduc disjunct semant sch stolzenburg und lutz abstract fair semant volker workshop frieder bernd thoma rule set calcul bank fee theorem prover constraint frieder stolzenburg complex logic program set stefan urgen dix confluent calculu thoma marx petri net base method applic design gener kurt ridder complet techniqu mean fix point algorithm christian thoma stephan integr integr constraint schema christoph andrea model timeout protocol design urgen vossen gener correct environ br disjunct posit refin model elimin applic subsumpt delet implement restart model elimin theori model elimin top lutz jen volker rainer mit dem color structur code ein lutz class fulli abstract semant workshop theorem prove analyt tableaux relat method poster session short paper stolzenburg model logic program comput answer
ML/228 6 aaai fall flexibl comput intellig opportun nov ma support flexibl reason approach depart comput scienc ontario abstract paper present reason system address flexibl reason flexibl retriev relev similar assess theori exemplifi advantag evalu system compar perform perform version machin learn algorithm domain introduct flexibl comput situat resourc scarc system make proce comput order make tradeoff qualiti answer resourc answer queri produc time limit useless famili problem motiv design anytim algorithm boddi frisch haddawi algorithm base scarc uncertain resourc algorithm util haddawi hank wellman doyl anytim algorithm produc correct answer solut improv comput intermedi result usabl partial solut horvitz approach gener partial result comput util partial result repres transform final result dimens util reason uncertainti research support inform technolog research centr ontario author indebt mylopoulo comment suggest resourc weight util approach defin optim function optim variabl reason option action weight action highest util pursu reason reason system reli concept similar problem similar solut face system retriev similar case store case base adapt fit problem hand case input output feedback evalu reason involv process accept problem descript case solut client part retriev relev case case base problem similar adapt retriev case fit problem hand produc solut input problem evalu solut feedback reason similar case adapt solut import task measur case close retriev highli relev case similar criteria solv current problem retriev fewer retriev case result poor solut accur solut minim concern resourc shapiro time resourc limit comput kinemat task robot glasgow system accur result time constraint paper present prototyp reason call flexibl retriev case flexibl support aspect ffl variabl accuraci final solut function resourc ffl changeabl retriev retriev relev case irrelev retriev relev case ffl queri specif retriev case queri complet retriev similar case addit exact match ffl automat queri modif featur support varieti domain task task requir chang time individu user prefer retriev system scale case acquir system reason system relev measur retriev assum case repres structur object relat al object relat set attribut vn fa attribut complex case type ffl sourc case sourc case case case solut ffl input case input refer problem case describ problem full subset attribut fill valu case fc finit set case search space sourc case inform individu attribut properti attribut group categori al case categori categori membership base attribut properti group ascrib constraint group attribut process retriev relev case constraint satisfact process al deploi telo al languag treat object attribut uniformli diminish problem discuss earlier lower impact irrelev attribut system perform ortega categori improv system perform glasgow shapiro glasgow knowledg discoveri techniqu organ case attribut categori al main goal retriev case highli relev user request case relev request treat retriev compon system base case system locat case similar problem descript retriev tradit inform retriev system system assum user search assum problem partial develop descript task system find exact similar case theori relev case relev situat determin context similar glasgow chang chang relev measur flexibl relev case request measur approach common definit relev system relev defin individu attribut defin context set relev retriev context view interpret subset attribut consid relev context form attribut target case similar determin close valu attribut close depend attribut distribut task defin finit set attribut constraint attribut cv cv cv attribut constraint cv specifi set valu attribut context specifi import attribut attribut context varieti rang complet ignor valu consist valu valu flexibl context specif summar ffl ignor attribut similar ffl attribut similar assess null constraint attribut ffl attribut similar assess specif constraint vagu defin attribut list interpret target case similar sourc case case match case satisfi constraint defin relev context case satisfi context denot pair cv exist pair cv iff cv cv satisfi exist case case base satisfi theori constraint attribut categori cardin constraint constraint attribut valu instanc specifi attribut sourc case match attribut interpret target case rang requir attribut sourc case fall rang defin context domain attribut sourc case instanc attribut context cardin constraint number attribut requir match similarli match exact specifi attribut categori sourc case interpret target case match determin attribut categori requir attribut match context note exact schema constraint schema integr sheth analog infer ortoni match strategi support requir attribut attribut match match select attribut match constraint attribut context control consid partial case satisfi constraint context attribut match valu target sourc consid similar relev respect context control retriev easi context modif notion context subsum tradit nearestneighbor templat match cbr system partial descript case submit queri system locat case similar descript approach initi queri context subsequ control modif user state criteria defin context handl criteria match context relax restrict context permit easi implement retriev reformul al iter contextu similar case problem queri retriev reformul motiv support effici iter obviou advantag explicit context definit easi context main scenario defin user domain knowledg context start point context user specifi task solv system select context knowledg discoveri algorithm locat relev attribut attribut valu user form context retriev inform approach suitabl novic user user submit ad hoc review result iter modifi resubmit queri approach suit case base context modifi relax restrict constraint relax perform search space attribut constraint reduct expand search space implement enlarg set case consid attribut constraint reduct achiev relax restrict number relev attribut sourc case match target expand set attribut categori prioriti decid attribut give prefer categori lower prioriti prioriti explicitli assign categori assum import categori prioriti defin knowledg discoveri algorithm user point relax techniqu advantag return answer specif queri return relat answer automat user submit altern queri restrict techniqu work control amount return manag level user search relax restrict context mechan user user prefer mean cardin relax constraint valu expand set valu relax constraint numer easili domain knowledg form concept hierarchi util relax numer symbol attribut gener hierarchi constraint relax instanc domain automat search space algorithm find class search select merg leav start retriev retriev chang metric relev assess base context relax user system similar relax context iter restrict retriev success fewer case restrict context mean make specif restrict function restrict criteria return modifi context cardin restrict depend criteria categori highest prioriti restrict restrict yield expect result qualiti return case improv quantiti cardin highest prioriti categori restrict time restrict context pair cv exist pair cv cv cv iff cv cv cv cv restrict relax iff cv cv cv cv perform evalu discuss method evalu retriev system intend softwar repositori main object evalu test task abil solv medic domain suggest hormon therapi shapiro al robot domain predict rise time solv kinemat task glasgow charact recognit domain recogn scan capit letter glasgow softwar engin domain support retriev softwar artifact evalu concentr scalabl evalu increment context modif algorithm case base glasgow glasgow advantag knowledg discoveri compon explain evalu al context criteria affect time spent search solut qualiti tune reason process meet requir medic domain shapiro al accur suggest hormon therapi posit impact pregnanc cost minim amount hormon patient treatment suggest accuraci import optim optim function minim cost treatment preserv high pregnanc optim variabl includ number dai hormon administ depend patient characterist diagnosi previou treatment patient current treatment decid continu treatment base probabl success belief success smaller threshold patient warn lower usual probabl success treatment robot domain glasgow time resourc limit approxim solut provid time greater util accur solut deliv late fast techniqu produc solut approxim kinemat task robot comput solut problem main object solut time constraint retriev inform repositori work similarli pursu retriev retriev relev cost irrelev case includ retriev desir irrelev case cost miss relev case inform retriev system retriev strategi predefin chang strategi user chang strategi flexibl user expert retriev strategi start increment retriev step retriev relev step reduc number irrelev case approach posit impact retriev fewer constraint simpl problem larg number retriev case solv step retriev step introduc constraint perform substanti smaller number case evalu show util specif applic applic level flexibl support queri manipul transform similar support flexibl relev retriev automat context support flexibl context modif control answer glasgow shapiro glasgow control quantiti qualiti retriev case shapiro tune applic specif user terminolog norm ration introduc medic applic system type infer consist axiom theori cost infer robot applic implement type ii cost reason consid flexibl system requir strategi continu refin partial result time support context base obtain result system match number retriev relev case control improv retriev preserv perfect recal flexibl system enhanc incorpor knowledg discoveri algorithm find optim knowledg point result effici comput import weight attribut dynam turn retriev strategi approach predefin retriev case retriev dynam chang domain specif applic configur individu task easili flexibl aspect trade accuraci comput process time resourc present retriev part reason system principl applic kind repositori item repres structur object relat system build block flexibl retriev system refer toler irrelev attribut ning algorithm intern journal man machin studi modular reason uncertainti uncertainti artifici intellig analysi plan proc softwar inform system automat softwar design aaai press formal basi analog reason proc intern confer principl knowledg reason anytim deduct probabilist logic artifici intellig restrict queri relax user constraint proc intern confer intellig cooper inform relat stat soc aaai fall symposium seri relev menlo aaai press util function deadlin goal principl knowledg proc intern util action uncertainti uncertainti artifici proc seventh san kaufmann reason vari uncertain resourc constraint proc appli reason control robot robot system workshop classif retriev ieee intern confer tool artifici intellig reason approach learn control intern confer data knowledg system manufactur engin comput model reason st confer american societi reproduct medicin reason predict knowledg mine ai medicin special issu cbr medicin perform analysi increment algorithm cbr system submit retriev relev inform intellig retriev advisori tool acm confer societi futur comput retriev tool softwar repositori workshop ai softwar break induct learn reason canadian ai workshop induct schema correspond object semant proxim technic report depart comput rutger constraint satisfact problem domain intern journal artifici intellig tool reason san morgan kaufmann repres knowledg inform system acm transact inform system inform dna promot sequenc domain theori journal artifici intellig research research note analog retriev constraint satisfact artifici intellig similar analog reason cambridg press modular util plan proc intern confer artifici intellig plan
DB/229 3 index move point agarw lar arg jeff erickson submit acm symposium principl system novemb abstract index scheme store set point move linear queri form answer rectangl real report point lie insid time present data structur constant disk block answer queri report point lie insid time interv point insert trajectori point present gener approach improv queri time queri arriv chronolog data structur evolv time obtain tradeoff queri time number time data structur updat point move describ index scheme number requir answer queri depend monoton differ current time develop index scheme answer approxim queri effici center geometr depart comput duke box nc support part nation scienc foundat grant armi research offic muri grant sloan nation scienc foundat award match fund xerox grant scienc foundat center geometr depart comput duke box nc larg support part nation scienc foundat grant depart comput il support part nation scienc foundat grant armi research offic muri grant index move point introduct effici index scheme support rang search variant central larg system relat system rang search commonli oper rang search problem crucial support languag constraint queri languag class hierarchi spatial geograph inform system rang search plai pivot larg number extern data structur answer queri develop refer store process continu move data wide rang includ digit transport mobil commun system exist assum data constant explicitli suitabl queri continu move object continu updat queri output obsolet approach repres posit move object function posit explicit chang system updat function veloc object recent work extend capabl exist system handl focu develop effici index scheme store set move rang queri locat futur answer quickli queri point lie insid queri rectangl minut problem statement fp set point time denot posit time assum point move line fix speed valu chang time assum object updat valu system notifi valu chang denot set time word current time interest answer queri rectangl time report point lie insid time report point rectangl time valu report point lie insid time report applic queri point oe time report nearest neighbor oe time main interest minim number disk block store point number disk access answer rang problem standard extern memori model model assum disk access transmit contigu block unit data singl oper effici data structur measur term amount disk space unit disk number requir answer rang queri interest solut output queri bound express term number point term number point report queri note minimum number disk block store point ffi nearest neighbor point oe point index move point report output point refer bound introduc notat previou result detail summari earli work tempor found survei paper salzberg tsotra earli work concentr data activ develop data model queri languag support continu move object sistla wolfson develop tempor queri languag call futur tempor logic support proxim queri move object al data model call move object move object refin model extend incorpor import includ uncertainti motion commun cost model found number practic method access search move object worst queri output kollio al effici index base partit tree store set point move fix speed disk answer queri type arbitrarili small constant insert delet point present scheme disk block answer queri type assum speed point practic data structur point move worst case answer queri kollio al practic data structur answer queri move point bound queri time prove comput geometri earlier work move point bound number geometr structur convex delaunai point move semin al introduc notion kinet data structur work lead interest result relat move includ result kinet space partit tree main idea kinet framework point move configur kinet updat perform data structur event occur point move combinatori structur structur chang discret time event updat data structur continu contrast fastest move object determin updat time step entir data kinet data structur base natur interpret term underli structur work kinet data structur intern memori comput model result paper main result index move point plane approach approach time axi solv problem base work kinet data point index scheme evolv time modifi kinet event point equal data structur necessarili updat effici index scheme provabl perform bound answer rang queri point move section describ gener index scheme section present partit tree base index scheme disk block answer queri type arbitrarili small constant point insert delet data structur chang trajectori index move point dual primal figur dualiti transform dimens balanc partit size point call index scheme index scheme answer queri type point report index scheme handl form uncertainti veloc locat affect asymptot perform partit tree scheme time cost queri high section show index evolv answer queri provid queri arriv chronolog order achiev kinet store snapshot move point time extern rang tree structur log log disk block show combin kinet rang tree partit tree obtain trade queri time number event data structur updat paramet nb preprocess data structur size log log block queri answer trajectori point event queri futur critic futur index scheme fast time queri futur time queri section index scheme log log disk answer queri type number requir monoton function queri time exce point trajectori uniformli queri number kinet event time interv describ index scheme answer queri paramet ffi construct index base partit disk block queri point oe time return nearest neighbor ffi point insert delet ffi geometr preliminari dualiti dualiti popular power techniqu geometr map point line dualiti dual point line dual line point oe denot dual object set object foe oe essenti properti dualiti point line dual line dual point figur dual strip oe vertic line segment oe point li oe dual line intersect oe extern partit tree partit tree commonli intern memori data structur geometr rang search index scheme base partit origin index move point extend extern memori set briefli summar emphasi slightli improv perform set point partit set pair disjoint subset triangl point note point lie belong figur size denot number pair partit balanc subset point cross number partit maximum number triangl cross singl line lemma state fast partit construct mention smaller lack omit proof lemma set point posit integ construct balanc partit size cross number high probabl construct partit tree node partit tree subset point simplex root js dn node construct root leaf store point singl block intern node constant comput balanc partit rv rv small cross construct partit tree subset store vertic pointer root ith child block store node chosen leaf node point total number node tree total size partit tree appli lemma build entir partit set node total construct time log answer queri find point insid queri strip oe order visit top fashion node report point lie insid oe test triangl li complet ignor li complet insid report point ith oe cross visit ith child note point oe report shown queri arbitrarili small constant make extern partit tree dynam partial rebuild techniqu overmar data structur construct log amort cost updat oper bound index scheme kollio al obtain result rang search improv updat perform theorem set linearli move point paramet preprocess index size block queri answer data structur construct log point insert delet amort cost time oblivi index describ index scheme answer queri point index scheme gener data breviti describ case set point point trace line queri line intersect rectangl plane parallel map line point partit tree answer queri index move point partit tree observ line intersect project intersect appli dualiti transform move point induc static point dual dual subset denot point dual dual queri rectangl induc queri strip oe oe result queri set point oe oe construct data structur figur rectangl queri move point interv queri move point build primari partit tree point node attach secondari partit tree point attach secondari tree node depth multipl ffi log ffi constant determin size singl secondari tree total size secondari tree construct time log insert delet point amort algorithm answer queri partit tree queri strip oe oe search primari partit tree point oe find triangl li complet insid oe perform complet search search level secondari structur node secondari tree report point oe earlier secondari queri requir number point report descend node visit perform ffi log ffi log secondari queri total number answer count report log solut recurr make arbitrarili small ffi appropri theorem set linearli move point paramet preprocess extern partit tree size block queri answer data structur construct log point insert delet amort cost oper remark gener construct number dimens build level partit tree preprocess queri updat time multilevel partit tree constant factor addit dimens point distribut uniformli rectangular simplifi construct regular squar grid partit detail full paper extern partit tree handl form uncertainti veloc locat point queri perform queri type rectangl time interv return point ly report line intersect box line intersect intersect face report line report face line intersect face attach secondari partit tree node result data structur requir log space asymptot queri bound structur index move point theorem set linearli move point paramet preprocess extern partit tree size block queri answer data structur construct log point insert delet amort cost oper chronolog queri discuss improv queri bound present previou section data structur evolv queri current time approach extend handl queri futur time long arriv chronolog order kinet rang tree structur base extern rang tree develop give overview extern rang tree section discuss kinet section extern rang tree extern rang tree present structur primari structur tree point similar log tree height log log point store secondari structur node path root leaf store secondari structur linear structur log log block secondari structur extern version prioriti search answer rang report point ly rectangl form basic structur extern prioriti search tree node auxiliari structur point linear support queri updat breviti discuss structur full descript structur prove lemma set point preprocess log log disk rang queri answer point amort auxiliari data structur set point order order structur answer rang queri consist block store constant number catalog block block catalog block store block point condit block construct creat block ib lower endpoint point ib ib sweep horizont line start track number point ly sweep line sweep line reach point consecut block point ly line block form lower endpoint point lie line upper endpoint set longer track sweep sweep continu manner line reach point block creat shown structur construct answer queri catalog block load main memori block includ sweep line intersect interv load main memori index move point level kinet rang tree partit tree figur answer queri dot line initi block solid block block sweep line block left solid block load answer block consecut block contribut point output schemat view tradeoff data structur relev point report shown queri refer figur structur easili made dynam global rebuild updat log extra queri result modifi reflect updat requir extra block run full structur rebuilt lemma set point store linear size index rang queri answer updat perform amort kinet rang tree discuss extern rang tree modifi work move point rang queri current time answer quickli explain modif structur answer queri point detail full paper recal endpoint block defin point call signatur case move defin time interv block chang continu time point ly continu satisfi condit reach time content block chang discret valu time call instanc time instanc equal event order handl event maintain extra disk block point leav block delet add full reconstruct entir data structur amort cost event point track time leav store time instanc prioriti call event track event updat data structur updat prioriti queue event queue updat event modifi scheme chang trajectori point omit detail answer queri time simpli load catalog block calcul block time load block intersect interv time intersect time report point lie queri rectangl queri procedur report point similar evolv primari secondari structur extern rang tree event defin time instanc point equal event calcul effici store global prioriti queue event comput data structur updat event detail full paper index move point theorem set linearli move point preprocess kinet rang tree size log log block queri answer data structur updat amort event trajectori point chang total number event perform queri effici spend total log time evolv data structur combin kinet rang tree extern partit tree sketch figur obtain tradeoff cost answer queri total number event omit detail state main result theorem set linearli move point paramet bn preprocess index size log log block queri answer trajectori point data structur updat amort event remark kinet rang tree work bound point move complex provid quickli determin point intersect horizont vertic line index partit tree advantag answer queri cost answer queri high kinet rang tree answer queri handl queri chronolog order present index scheme combin advantag answer queri order number answer queri small queri time close current time describ answer queri futur past extend approach arbitrari queri time answer queri observ previou combinatori structur kinet rang tree chang point equal updat data structur sequenc event time event version event valid time interv log current time maintain version maintain past version futur version note futur version tent thai built anticip futur event base current trajectori point trajectori point futur version structur chang store store idea persist data structur call data structur data structur recal level primari secondari structur variant store version adapt standard techniqu lack space discuss modif tailor techniqu focu auxiliari structur store node secondari answer rang queri set point recal order handl inet maintain extra disk block point ad block perform reconstruct version discard maintain multipl version modifi structur updat queri procedur discard version declar inact maintain multipl version version associ birth death time time construct time index move point inact version activ point insert time store pair updat block delet time store time stamp maintain version total space disk block report point lie rectangl time find version activ time maintain multipl version primari secondari structur kinet rang found simpli queri section report point updat block insert report point delet total rj store death time version auxiliari structur global prioriti queue current time greater delet version auxiliari structur death time lie interv maintain log version event perform updat oper turn impli perform log updat oper auxiliari total size data structur log log spend amort event updat chang trajectori point updat version auxiliari structur store store auxiliari log updat data structur practic small omit conclud theorem set linearli move point preprocess index scheme size log log block queri answer provid log event current time spend amort updat data structur event point store place updat trajectori log significantli simpler data structur develop set point case appli idea obtain full theorem set linearli move point preprocess index scheme size block queri answer provid event current time spend amort updat data structur event point store place updat trajectori log answer queri combin partit tree interim persist index obtain index queri cost function jt describ index scheme similar approach work set point move fix veloc convert set line denot set pont dual line construct partit tree section node subset point set input point construct interim persist index theorem attach auxiliari structur maintain time interv valid total size result structur log disk block reduc size data structur block idea section event defin time instanc point store structur collid event data structur updat point lie interv answer start section node report point js ij index move point figur regular center differ euclidean dp wedg qa nearest neighbor function visit children section maximum number answer independ close current queri procedur visit level partit tree switch secondari structur difficult bound queri time assum distribut trajectori point event occur short time assum point trajectori uniformli distribut point uniformli distribut unit simplifi partit tree prove theorem set linearli move point preprocess data structur size block cost monoton function jt point trajectori uniformli queri expect number event approxim search section briefli sketch index scheme answer queri ffi regular circumscrib radiu center origin vertex figur point defin ag check easi calcul show triangul triangl connect vertex origin min suffic describ index scheme comput nearest neighbor queri point distanc function fix triangl point wedg form rai eman direct ov ov figur nearest neighbor point oe function point nearest oe direct normal figur modifi partit tree section queri point oe queri time nearest neighbor direct normal comput omit conclud theorem set linearli move point paramet ffi preprocess index scheme size block time nearest neighbor queri answer ffi index scheme construct log point insert delet amort cost log defin metric dp convex polygon origin central dp necessarili equal dp dp metric refer effici search linear proc annu acm sympo principl pp agarw geometr rang search tech report depart comput duke guiba kinet binari space partit triangl proc sympo discret track index optim rang search proc annu acm sympo principl arg optim dynam interv manag extern proc ieee symp foundat comp pp data structur mobil data eighth annual symposium discret page asymptot optim vldb battl paradigm time proc intl sympo command control research chomicki geometr framework spatiotempor proc intl workshop time dd make data structur journal comput system erwig develop queri dexa abstract discret model spatiotempor data acm gi access comput index data model constraint journal comput system index mobil proc annu acm sympo principl nearest neighbor queri mobil spatiotempor complex queri evalu indefinit tempor constraint theoret comput scienc koubaraki tractabl queri answer indefinit constraint basic result applic queri spatiotempor effici partit discret comput nievergelt spatial data concept design algorithm foundat gi van lectur note comput scienc mh design dynam data lnc ramaswami oodb index class academ ramaswami path techniqu optim extern proc annu acm sympo principl salzberg vj comparison access method tempor technic applic spatial data comput imag addison sequenc geometr cambridg sistla tempor condit integr constraint activ proc sigmod intl conf manag model queri move proc intl conf data dynam attribut index comput journal gener spatiotempor proc sympo spatial data pj rm effici access ieee tran knowledg data cost model posit move proc intl conf data track mobil unit real proc intern confer updat queri track mobil distribut parallel move object proc sigmod intl conf manag move object issu proc sympo spatial
Agents/230 1 method optim optim de jong octob abstract method method act layer simultan exampl method found system learn bia method evolut hybrid optim multipl result give formal de nition method discuss relationship free lunch show thing optim optim method approxim introduct variant method comput scienc arti cial intellig fluid layer layer behavior evalu improv lower assum continu scale layer evalu improv theoret properti scale scale rang special model machin learn section model method correspond state algorithm solv speci problem subsequ step iter close solut produc step basi de nition optim optim section suggest solid methodolog comput form search optim optim de nition method method simpli de ned function comput function oper variabl problem instanc atom layer nest constitut di erent layer method system method agent multiag system ident control layer top hierarchi control layer divid cpu time establish commun channel case true higher layer control collect intellig interest approach fact classi ed approach collect intellig idea break global world util local agent agent reinforc learn optim privat util global scale improv world util reinforc learn agent oper lower layer coin make coin method classi er system classi er system classic method top layer form administr layer cooper instanc bucket hierarchi genet program gp program oper lower evolv higher layer evolutionari program contract net protocol multiag system design contract net protocol agent place bid handl subproblem idea bid regul distribut task specialist metalearn learn optim everydai behavior structur credit assign cooper multiag system framework agent di erent special blackboard system blackboard agent di erent special cooper solv problem idea system open agent add result method exibl versatil spawn agent spawn chapter techniqu agent ma creat agent gener copi move agent section de ned detect anomali collect evid nal judgment model method learn bia tune learn method model bia bia nice save research work bia tune refer optim bia method run bene cial add bia tune mechan simpl model tting algorithm model build method simpler build model simpler hard model algorithm neural network classic model neural network activ hidden layer partial layer neural network ensembl neural network ensembl set neural network instanti weight region term refer set neural output combin averag model stack model top rst deliv input close idea hybrid neural network hybrid neural network instanc algorithm process data case time seri lter neighbor recurr neural network classi cation run classi cation vector method form input back propag neural network model algorithm di erent part classi er di erent boost boost classi cation techniqu classi repeatedli method weak classi er occur control code evalu invok weak classi er depend result previou call classi cation algorithm di erent improv perform idea classi er provid train exampl vice versa result method repres classi cation method suitabl learn method nice goal ai design method paramet method tune implement tune optim autom layer algorithm tune concentr averag case worst case comput cost evolut strategi evolut strategi code paramet mutat oper gene hope ideal set evolv explor exploit agent uncertain environ explor surviv exploit behavior time exploit behavior interrupt uenc higher layer remind agent stai curiou creativ oppon arti cial intellig argu agent system built arti cial intellig research design exce function term evolut coin system evolv comput mean evalu explor implement featur concept structur built de normal behavior higher behavior evalu improv behavior ection central featur label intellig system hybrid method hybrid neural network exampl hybrid method collect method principl combin hybrid method hybrid evolutionari algorithm evolutionari algorithm combin local step altern idea ea local search heurist improv search hypothesi check hybrid ea ham distanc heurist larger ea approach hybrid ea altern method structur credit assign ea approach candid solut iter improv altern step method optim depend result achiev layer exploit perform characterist method optim perform result pool interest approach optim problem di erent algorithm excel di erent result pool mean method solv problem answer combin answer instanc approach algorithm converg local optimum half global optimum case run algorithm time probabl global optimum found approach sacri ce speed algorithm improv success rate educ restart possibl educ restart algorithm solv problem time algorithm run longer expect wise restart method portfolio interest analysi perform method calcul optim combin method weight combin balanc risk gain parallel stock portfolio call method portfolio bayesian realloc resourc partli build calcul optim method chang bayesian case control method layer method multipl problem class problem comput scienc np complet np complet problem instanc problem translat polynomi time instanc possibl translat problem instanc problem class solv problem class good heurist ort eld optim reinterpret search heurist fast subclass problem albeit problem class rest assum problem solv np complet problem model model model formal layer method step sequenti comput program featur central concept featur atom composit problem instanc de ned bit bitstr atom featur composit featur de ned composit atom featur branch featur branch featur yield featur yield featur branch featur yield featur yield featur problem solv nite larg featur model repres featur nite data structur separ question branch featur decid invok featur altern solut execut sequenti comput rst oper gather inform determin calcul process continu rst oper formal branch featur larger featur formal entir model free lunch optim optim theorem state method optim subclass problem method optim subclass method rst determin subclass instanc method method nite set problem nite amount resourc combin tree larger highest layer branch concern problem size optim optim problem class match subclass problem method bia subclass problem identifi subclass problem instanc higher layer method appli method lower layer de ning recogn subclass problem match subclass problem requir languag de ning subclass implement de ning recogn recogn instanc subclass recogn layer method invok problem de ned function set logic solv instanc problem correspond solv sat subclass problem de ned function type chose de nition syntax algorithm problem translat seamless extens algorithm suitabl subclass instanc problem knowledg form method abund comput scienc arti cial intellig optim optim de ned np complet problem comput scienc optim determin refer franklin schedul data broadcast confer comput commun san ho schwefel survei evolut strategi proc int conf genet algorithm morgan heurist cardin constrain portfolio optim technic manag imperi london jame eld calculi induct physica special issu proc int seminar complex complex dynam arti cial randal davi reid smith negoti metaphor distribut problem solv arti cial de jong adapt sampl similar learn evolv master thesi leiden jerom robert tibshirani addit logist statist view anonym download diana gordon mari evalu select machin learn machin rg palmer introduct theori neural comput dougla escher bach john holland escap possibl learn algorithm appli parallel page bernardo hogg economist approach hard comput problem matthia editor intellig inform inform discoveri manag internet lee stolfo data mine approach detect person commun gabriel improv handwritten charact mixtur expert master degli studi di fundament limit search evolutionari comput perspect van comput scienc todai recent trend volum lectur note comput page lee boost explan ectiv vote method machin intern gener method increment multiag chapter page scienti publ reid smith contract net commun control distribut problem solver ieee transact decemb unknown david wolpert william free lunch theorem search santa fe park march david wolpert william free lunch theorem optim ieee transact evolutionari april david wolpert tumer introduct collect intellig technic report david jeremi frank collect intellig rout internet trac advanc neural inform process volum mit david kevin tumer gener principl system autonom agent
DB/231 3 trigger process eric chri lan mohan lloyd park albert cise florida fl abstract current trigger system extrem limit scalabl paper develop scalabl trigger system scalabl larg number trigger achiev trigger cach main memori select predic index base uniqu express format call express signatur kei observ larg number trigger constant valu trigger tupl ad special relat creat express signatur hold constant tabl augment index index structur serv predic index design present number type concurr achiev includ token rule concurr introduct trigger featur commerci product popular applic develop integr constraint oper perform uniformli applic effect trigger hamper fact current trigger system commerci product scale numer product trigger type updat event delet tabl advanc commerci trigger system effect limit hundr trigger tabl applic design effect larg number trigger singl feasibl advent research support advanc research project ncr informix corpor internet world wide web make import support larg number trigger web interfac user interact creat trigger internet type architectur lead larg number trigger creat singl paper present strategi develop highli scalabl trigger system concept introduc implement system develop call consist extens modul dbm datablad informix data simpli call informix addit program approach implement scalabl trigger system asynchron trigger process sophist predic index give good time process larg number potenti trigger scalabl concept outlin paper trigger system insid dbm server kei concept exploit develop scalabl trigger system larg number trigger case format trigger ident structur constant substitut base trigger system identifi uniqu express group predic trigger condit class base signatur number distinct express signatur fairli small main memori data structur creat discuss command languag turn discuss larg number trigger handl effect express signatur class select predic index techniqu command languag command syntax support notion connect local informix remot gener data sourc program connect descript inform host type system run user password singl connect design default connect multipl data sourc defin singl connect data sourc correspond essenti trigger defin creat trigger action trigger ad specif trigger set belong default trigger set present trigger condit group similar sql trigger condit involv aggreg tempor function multipl data sourc referenc trigger defin base emp tabl connect rule set salari fred salari creat trigger emp emp set rule illustr command sql statement run notat rule action refer updat data case access data valu current updat valu match trigger condit substitut trigger action macro substitut trigger action evalu procedur bind rule condit rule action sophist rule condit involv schema part import defin data sourc rule schema ad neighborhood salesperson iri repres notifi creat trigger insert salesperson repres event command refer tabl event command rule action special command rule action commun world system architectur architectur made datablad live insid data correspond local remot tabl data sourc local tabl standard informix trigger creat automat captur updat tabl trigger tabl updat event informix captur updat transmit insert data sourc app data sourc app data sourc trigger host informix data option updat queue tabl updat queue share memori driver datablad consol client app client app figur architectur trigger processor updat descriptor tabl remot data data sourc applic transmit updat descriptor data sourc api client creat drop regist receiv event notif trigger instanc driver period invok special function trigger condit test action execut special applic program user directli interact system creat drop start shut gener architectur system illustr figur librari write client applic data sourc program librari defin client applic program interfac data sourc api consol program applic program client api function connect issu regist data sourc program written data sourc api updat receiv updat captur trigger data sourc program consum call figur data sourc program trigger place updat descriptor tabl act queue work current implement plan updat deliv queue futur deliv updat safeti persist updat queu lost trigger process current system asynchron simpl informix trigger captur process trigger synchron plan add featur implement base data model current implement support float data type support userdefin type ad trigger condit test algorithm discrimin network call treat network variat treat network trigger condit test plan implement optim type discrimin network call network paper primarili effici scalabl select condit test rule action execut result applic rete network trigger condit test result adapt trigger system gener trigger condit structur trigger condit gener structur refer data sourc event condit emp insert constant figur express signatur syntax tree data sourc refer list trigger express combin tupl data sourc evalu true canon form translat conjunct normal form conjunct refer possibl data sourc group conjunct set data sourc refer group conjunct refer data logic conjunct select predic refer data conjunct join predic refer trivial predic refer data call predic predic constant gener paper larg number trigger creat predic trigger distinct constant valu examin handl select join predic scalabl larg number trigger achiev scalabl predic index express signatur treat event condit separ condit conveni event condit condit logic select condit appli updat descriptor submit system tupl variabl defin correspond usag data sourc trigger gener form select predic kn predic refer tupl variabl atom express boolean possibl oper singl constant assum data sourc data sourc id data sourc correspond singl tabl remot local singl stream tupl messag applic program express signatur gener select join predic express tripl consist data sourc oper code gener express tupl variabl trigger event event implicitli insert updat tupl variabl format gener express ij constant substitut placehold symbol entir express number left constant number origin substitut placehold constant ij express signatur practic select predic singl trigger insert emp gener express express signatur syntax tree placehold leaf node repres locat constant signatur trigger condit repres shown figur insert emp constant earlier signatur express signatur defin class instanti express constant valu express class defin express express match express signatur express signatur repres logic structur schema part trigger condit assert real applic trigger system larg number trigger small number uniqu express signatur observ hundr data sourc predic index predic index root thousand base feasibl set data structur main memori repres distinct express signatur trigger trigger signatur tabl creat store inform link express signatur tabl list index cach inform store standard tabl index queri sql queri perform trigger condit test elabor implement issu process trigger definit creat trigger statement number step perform updat trigger system catalog main memori data trigger make readi run primari tabl form trigger catalog field trigger trigger set enabl elig fire match updat field data structur call trigger cach maintain main memori complet descript set recent access includ trigger id express signatur list figur predic index structur refer data sourc relev syntax tree network skeleton trigger current main memori thousand trigger descript load trigger cach simultan trigger descript byte realist alloc trigger trigger descript load simultan main memori data structur call predic index maintain diagram predic index shown figur predic index updat descriptor identifi predic match express signatur conjunct predic singl conjunct identifi select index directli token match remain conjunct predic locat test token remain token complet match predic detail techniqu root predic index link set data sourc predic index hash tabl data sourc id data sourc predic index express signatur list entri uniqu express signatur trigger predic data sourc express signatur constant constant tabl ordinari tabl row express occur trigger match express signatur trigger express signatur detect ad tabl trigger system field uniqu id signatur field identifi data sourc signatur defin field text field descript signatur defin field express signatur encount trigger creation broken index portion null format constant tabl express signatur distinct constant index portion identif number express signatur field uniqu id select predic uniqu id number trigger identifi network node trigger pass token match alpha node constant found index portion descript part null entir predic index tabl signatur index part predic form tabl cluster index composit kei predic type signatur base oper index constant field futur develop wai index oper constant type put cluster index constant attribut trigger relev updat descriptor match set constant valu retriev quickli random notic normal form elimin perform join queri inform repres tabl refer back definit defin remain string give constant tabl express number distinct constant express describ set constant organ structur effici trigger condit test issu constant set organ cover fulli paper data structur step process creat trigger statement trigger valid legal convert conjunct normal form group conjunct distinct set tupl variabl refer section base analysi previou form trigger condit graph undirect graph node tupl edg join predic identifi node refer select predic repres cnf express edg refer cnf express join condit edg group conjunct refer tupl variabl tupl variabl attach special list queri graph handl special case rare occur ignor simplifi discuss build network rule select predic alpha node check signatur compar signatur signatur express signatur list data sourc predic defin figur predic signatur add signatur predic list updat catalog tabl signatur constant placehold creat constant tabl express signatur predic constant add row constant tabl express signatur predic altern organ strategi express class express signatur constant express class belong trigger number small larg optim perform wide rang size class express express altern index strategi data structur low overhead size class small includ index size class larg wai consid organ predic express main memori list main memori index tabl index tabl strategi implement make feasibl process larg number trigger predic express signatur data sourc predic index constant set uniqu predic index root constant mandatori scalabl trigger system strategi requir order make common case thousand trigger fast cost model illustr tradeoff present strategi implement strategi construct common elimin select predic import perform enhanc reduc total time determin select predic match token common elimin achiev normal predic index structur figur show expand view predic index figur constant set express signatur element constant tupl constant occur select predic match signatur constant link set id number trigger select predic rule creat trigger ra express signatur list express signatur constant set signatur entri set id number implement constant set set fulli normal shown figur set store main memori list index normal data structur built data retriev constant tabl express signatur set id trigger set figur expand view normal predic index structur process updat descriptor predic index recal updat descriptor consist data sourc oper tupl pair token system pass root predic locat data sourc predic index express signatur data sourc predic specif type predic test data structur lightweight index express signatur predic test data structur express signatur search find match current token match constant set constant element element addit select predic element set addit predic test token found match complet select predic express belong trigger pin trigger cach pin oper analog pin oper tradit buffer check trigger bring trigger catalog pin oper ensur network syntax tree trigger trigger ensur treat network main token pass node network identifi field express match token process join tempor condit perform present trigger condit trigger action execut concurr token process action execut import scalabl concurr process smp concurr task execut parallel singl concurr give throughput time make scarc cpu resourc multipl task elig task number kind concurr trigger system exploit improv multipl token process parallel select predic index join network constant set uniqu top part predic express signatur list multipl select condit test singl token concurr rule action multipl rule action fire process time set data valu alpha beta memori node network process queri run parallel ideal trigger system capit type concurr current implement support token level concurr plan support type concurr futur version system futur version make task queue share memori store incom intern gener work explicit task queue maintain spawn nativ oper system thread process carri task due process architectur informix concurr process illustr figur make driver process defin number real cpu fraction cpu devot concurr process rang administr set paramet default defin driver process call function time unit driver call back immedi execut work left default equal determin left futur work set id trigger constant figur illustr partit constant set set facilit concurr process execut time invoc threshold work left task task task queue execut yield processor informix task informix routin task queue empti return return driver program wait time unit call return driver program immedi call default threshold millisecond task switch overhead driver program informix process avoid long routin execut long execut insid avoid result higher probabl fault deadlock run memori execut time insid short avoid problem excess lost work rollback occur trigger process task process token rule match run rule action process token set condit process token run set rule action trigger token task type task type gener condit potenti action structur predic index partit advanc multipl predic process parallel benefici partit predic advanc rule condit action rule creat trigger event larg speedup obtain partit set trigger set equal size result predic index substructur illustr figur set refer trigger refer partit round robin subset approxim equal size multipl subset process parallel achiev speedup trigger applic design trigger system paper design highli scalabl programm creat larg number trigger approach trigger extrem regular creat singl trigger tabl data referenc custom behavior discuss detail longer version paper relat work larg bodi work activ focuss predic index scalabl repres work includ postgr rule starburst rule dip od activ system follow model straightforward test condit applic trigger updat event occur cost linear number trigger relev event predic index cost trigger high check condit involv run queri work hanson johnson index rang predic interv data structur approach scale larg number rule larg amount main memori work rete treat algorithm effici implement ai product system relat work present implicit assumpt ai rule system architectur number rule small fit main memori addit work ai commun parallel process product rule system fulli address issu scale larg number rule issu relat parallel rule process product system survei gupta al cite type parallel includ data parallel overlap type concurr outlin section work hellerstein perform select join queri process relat issu perform select join network network proper placement select predic network improv trigger system scalabl develop postgr predic index data index record tag physic marker rule appli predic solv index result placement marker scheme advantag system determin rule appli primarili detect marker data index record queri updat process algorithm extend minor wai accomplish disadvantag scheme complic implement storag index structur record insert exist record larg number marker disturb predic disturb marker test phenomenon occur simpl predic form index attribut research system address issu execut trigger relat develop discrimin network structur approach run queri test rule condit updat occur type approach limit scalabl due potenti larg number queri gener rule work consist process constraint trigger sql relat lead recent enhanc standard focu work trigger constraint semant implicit assumpt constraint trigger process scale larg number trigger constraint specul work assumpt predic index paper potenti dip system set special relat call cond relat condit element rule cond relat queri updat perform test select join condit rule select predic test process queri tabl effici compar favor sort predic index predic index perform number common case dip capabl util parallel queri processor test rule featur common system paper system address issu execut larg expert system work memori relat rule system scalabl contribut system improv repres inform node treat network focuss product work present paper orient handl larg number trigger oper conjunct work directli compar set work prior research effort trigger system expert system tool focu scalabl multipl dimens includ capac accommod larg number handl high rate data effici fire larg number trigger simultan achiev scalabl care select predic index support type concurr paper describ architectur build scalabl trigger system date architectur implement informix datablad consol driver data sourc program architectur present advanc product gener earlier research result predic index improv limit scalabl architectur implement dbm support abil execut sql statement insid routin variat architectur made work extern commun standard interfac topic futur research includ develop wai handl tempor trigger process scalabl larg number trigger tempor condit process effici potenti futur research topic involv wai support scalabl trigger process trigger condit involv aggreg potenti research topic develop techniqu make implement structur organ constant set illustr figur work effect oper data type result paper addit research outlin make highli extens trigger process realiti refer product system ieee transact knowledg data juli tempor trigger process activ phd univ david daniel support rule acm sigmod pp pirahesh nelson trigger declar constraint sql vldb pp hugh guid sql addison jame relat product product languag relat intern confer expert pp april jame control interpret relat product confer manag pp june fast algorithm object pattern match artifici vol pp insid microsoft charl forgi allen speed implement acm transact comput vol pp eric kim predic match algorithm rule confer manag pp atlant june eric design implement ariel activ rule ieee transact knowledg data vol pp februari eric predic index activ interv skip inform vol pp eric jb asynchron trigger processor extens relat florida cise dept tech report decemb eric trigger condit test ariel florida cise dept tech report novemb eric ic flexibl event notif vldb vol pp eric trigger process florida cise juli techniqu queri acm transact system dynam data predic placement activ discrimin phd cise univ august mohan predic index ms cise univ dec denni architectur activ data base manag acm sigmod confer manag pp daniel match algorithm ai product aaai august pp cc lin larg product system dbm concept acm sigmod confer selli analysi rule index implement expert intern benjamin pp larri row michael implement ieee transact knowledg data vol pp activ morgan
Agents/232 1 model holon manufactur system fuzzi control stephan flake christian geiger georg wolfgang mueller volker germani abstract system technolog emerg interest specif implement complex system articl introduc agent develop system seamlessli combin bdi desir approach fipa agent commun languag standard integr specif fuzzi control behavior agent defin strategi basic correspond extend guard horn prioriti present concept introduc comput integr manufactur specif fuzzi control manufactur station context holon manufactur system introduct system technolog distribut comput area emerg interest domain complex system design paradigm real enhanc objectori paradigm object percept respect environ larg number commerci agent manag system develop exampl mecca support facil implement mobil secur agent dedic specif applic travel assist gener field system identifi major diverg agent theori industri applic hand work formal advanc logic captur essenti properti agent time depend behavior inconsist state develop formal specif techniqu appli formal captur system report nwana coupl concept recent multiag system research reinvent wheel larg amount relev class literatur publish tradit soft parallel softwar engin directli appli principl system exist number success implement dedic tackl problem flight manufactur resourc inform retriev larg follow approach build system scratch due complex develop code implement system lack underli sound theori recent work base rao georgeff bdi architectur successfulli bridg gap industri theori provid formal agent specif languag implement system base cross fertil sound combin formal descript implement framework develop agentspeak system literatur distinguish micro macro view micro view consid local behavior individu agent environ interact investig macro view articl present system base bdi architectur extent hierarch rule specul deep integr fuzzi control specif languag defin system mean local meta knowledg focu investig micro model execut agent strategi strategi defin rule complex test evalu strategi prioriti defin extend guard horn fuzzi control integr definit local belief present approach mean realist holon manufactur system investig interact autonom robot vehicl move part manufactur station chosen ideal applic scenario combin behavior fuzzi strategi exist work demonstr applic fuzzi technolog linear fuzzi fuzzi rule area remaind paper introduc basic principl holon manufactur system give specif basic behavior main compon integr fuzzi control outlin basic concept system sketch definit fuzzi control mean specif languag paper close overview implement short summari holon manufactur section introduc holon manufactur system outlin system fuzzi control specif basi holon manufactur specifi holon manufactur system introduc im initi tc hm base notion holon denot build block system complex product line hierarch holon cooper line basic rule achiev goal object singl holon understood autonom build block consist inform process physic part holon system structur base principl form network holon hm set station transport system virtual model figur manufactur station transform wash im manufactur intern research develop program develop gener manufactur process technolog compani research institut particip figur screenshot hm simul tional input output station primari system input output complet transport system consist set transport ht autonom vehicl move part station ht idl receiv request deliveri station send distanc current posit move notif accept part output move destin move park posit return step station input output buffer incom outgo part locat part output station broadcast request deliveri receiv distanc idl specif time period return step ht repli comput ht receiv distanc valu reliabl factor notifi ht accept notifi reject distanc comput sum subpath ht call station reliabl factor cumul continu comput estim arriv time real arriv time implement comput step mean fuzzi control tabl tabl defin accept deliveri function distanc reliabl ht nr low medium high medium high high close medium medium high reachabl low medium high low low high loss gener presum destin part easili retriev part system combin bdi agent micro view fipa acl macro view valid agent base design principl consid approach system seamlessli combin theori practic select rao base micro level specif exist concept domain concurr logic program fuzzi logic implement system librari framework current implement part agent architectur mecca agent manag frame work combin intern fuzzi librari gener select messag messag read control event input action output intent belief strategi control gener figur micro view agent specif behavior agent formal base guard horn extend concept event action deriv bdi desir approach agent individu control behavior intern state current set intent figur belief agent local world model basic compar fact logic program intent partial instanti strategi execut agent agent continu observ environ base observ perform action send messag modifi belief behavior agent basic defin strategi strategi compar logic program agent strategi formal defin extend guard horn form predic bodi defin prioriti head strategi describ event agent perceiv order execut plan guard belief desir intent element consist number predic messag process sequenti parallel prioriti applic strategi base type guard strategi distinguish guard simpl strategi consid reactiv goal element strategi guard strategi delib evalu guard requir specul comput evalu strategi order reduc goal level context test requir commun strategi commun action guard multipl strategi appli event reactiv strategi higher prioriti delib strategi commun strategi lowest prioriti agent applic strategi agent suspend execut strategi resum suspend special oper suspend resum figur execut cycl oper semant agent mean abstract interpret figur interpret manag execut agent activ interpret loop oper agent interpret control function control event plan intent select modifi system easili tailor oper semant applic interpret start select incom event set relev plan process select event identifi precondit relev plan check fact store agent belief extract set applic plan precondit satisfi applic plan set pursu strategi select plan instanti intent concept agent investig plan parallel instanti interpret select intent execut start top element execut result direct gener instanti interpret advanc process event definit agent implement mean specif languag focu interest specif fact plan defin line pattern fact achiev delib fact simpli associ list data valu identifi plan basic definit guard horn addit definit bodi list failur defin elabor evalu bodi fail individu plan element bodi failur specif control structur wait definit messag subgoal support fuzzi control extend syntax fact definit section control definit keyword fuzzi control definit cover specif input output fuzzi rule fuzzi set descript sketch definit fuzzi control holon transport system introduc previou subsect fuzzi control control input variabl crisp data fuzzi set defin function map crisp fuzzi data appli rule definit rule directli correspond tabl previou subsect defin hm station fuzzi control fuzzi control invok station agent identifi crisp valu crisp valu rule fuzzifi return assign variabl accept station call crisp valu ht ht highest accept final notifi accept deliveri implement micro level view implement java jdk integr modul librari compil written program execut interpret agent integr mecca framework mecca agent system implement fipa acl commun standard integr agent read write specif commun adaptor intern messag transport channel mecca system agent commun fipa compliant agent mecca framework shown figur summari outlook introduc model valid environ complex system design combin bdi agent approach fipa acl standard seamlessli integr specif invoc fuzzi control system figur architectur introduc holon manufactur system address futur concept field complex cim system holon manufactur system base principl network compon ideal applic serv applic fuzzi technolog articl preliminari result experi applic work present start point futur investig field futur work focu complet implement applic field manufactur system comput graphic acknowledg work articl fund von der christoph fhg ipa cooper simul holon transport system refer steiner mecca system refer manual fipa specif part agent commun languag fipa foundat intellig physic applic concurr fuzzi prolog field flexibl manufactur system proc practic applic weber concurr object orient model fuzzi strategi proc ieee confer fuzzi geiger rapid prototyp interact anim phd paderborn septemb support system variabl rout manufactur system fuzzi set java mobil agent ieee internet vol juli jm huber jam mobil agent architectur intern confer autonom ndumu perspect softwar agent research knowledg engin cambridg mp georgeff model ration agent tech report australian artifici intellig februari rao bdi agent speak logic comput languag european workshop model autonom agent shapiro concurr prolog report ieee shapiro famili concurr logic program languag acm holon manufactur system test case holon manufactur system lake februari zimmermann fuzzi set theori applic kluwer academ
ML/233 6 robust entropi estim strategi base edg weight random graph alfr hero olivi michel dept ann usa ecol normal franc abstract paper treat problem robust entropi estim random sampl unknown distribut estim entropi fraction order insensit high varianc contamin minim span tree greedi algorithm approxim problem comput span tree gener potenti function partit method ravi basi approach asymptot theorem establish log length weight greedi approxim strongli consist estim entropi quantit robust estim outlier establish method uenc function structur uenc function natur extens data pattern entropi random graph spatial mutual inform introduct hero michel asymptot behavior gener class minim graph set random point ir shown lead consist estim entropi underli distribut paper overview result emphasi motiv simul result present hero michel applic entropi estim weight function minim graph sati es properti redmond includ graph travel salesman steiner minim span minim match problem concentr minim span tree due comput advantag entropi estim applic assum set xn fx xn point ir fix denot subset xn element subset distinct subset xn span tree connect acycl graph xn de ned set edg fe connect point path graph lead back point edg weight expon minim span tree span tree minim total edg weight jej graph mst vlsi circuit layout network sampl pattern nonparametr regress test random mst construct time polynomi minim span tree problem subset point set edg connect point result tree minimum total weight problem competit bid network rout contract combinatori optim problem planar problem shown ravi ravi polynomi time greedi approxim algorithm planar approxim ratio hero michel gave polynomi time approxim algorithm gener problem approxim ratio author correspond hero proc san juli shown hero set point xn random sampl continu densiti robust strongli consist estim entropi densiti log ir order entropi determin edg weight function dimens entropi estim interest pattern process complex model identi test applic invari translat invert transform desir discrimin applic vector quantiz entropi relat asymptot quantiz distort factor bennett integr applic entropi estim estim expon imag registr mutual inform match stop criteria regress classi cation gener entropi estim problem paper overview approach entropi estim draw heavili result establish hero michel start illustr mst relat entropi estim cluster analysi context numer exampl exampl point mst introduc robust altern length curv discrimin select number outlier reject describ greedi algorithm approxim detail discuss asymptot theorem result proven hero michel final uenc function establish quantit robust greedi outlier draw analog estim problem entropi estim minim graph motiv mst figur show motiv minim span tree entropi discrimin di erent distribut column figur correspond di erent distribut unit squar left column correspond uniform densiti column correspond triangular densiti maximum point top row figur present result singl experi gener random sampl uniform triangular middl row present mst realiz construct minim sum edg length jej tree note experi length mst uniform sampl larger concentr triangular sampl length mst distribut shown bottom row figur comput basi larg number repeat independ experi type illustr rst row con denc interv note larg length curv sublinear rate rate constant depend underli distribut random sampl left panel figur show direct comparison length curv plot simultan function panel show length curv normal transform evid triangular distribut normal transform length mst converg di erent constant level asymptot uniform distribut signi cantli larger triangular distribut remark hero di erenc asymptot equal di erenc entropi order respect distribut cation mst previou section illustr mst consist estim entropi illustr sensit mst outlier contamin introduc cation underli densiti mixtur hero proc san juli uniform distribut mst mst length function uniform distribut triangular distribut mst mst length function triangular distribut mst length figur triangular uniform sampl studi hero proc san juli number figur mst log mst weight function number sampl uniform triangular studi interpret densiti interest contamin distribut figur left panel show realiz densiti form ce normal kxk magnitud squar constant contour densiti circl maximum contour circl radiu center contour call densiti panel figur realiz shown contamin sampl uniform densiti correspond sever case equat bottom row figur show mst case notic mst left panel captur shape length reliabl entropi mst panel uenc addit uniform mst length function robust outlier solut lack robust present bank context regress author cation obtain prune largest edg mst reconnect remain isol result tree typic optim tree pass remain point di erent cation base optim point mst shown provabl converg properti quantit robust establish figur illustr applic experi shown figur mst evid form gure number point elimin hero proc san juli sampl densiti add sampl uniform figur toru densiti addit uniform mst hero proc san juli reject number outlier contamin densiti case outlier complet recov mst signal distribut number reject point begin elimin point desir distribut kei practic cation algorithm accur detect correct number point reject outlier reject outlier reject outlier reject outlier reject figur mst toru densiti addit uniform natur detect criterion construct basi length curv plot function number point reject figur curv plot shown left uniform densiti observ curv linearli give theori section establish case uniform densiti figur curv plot base contamin sampl densiti note curv separ linear segment break approxim reliabl detect length curv reliabl implement robust entropi estim hero proc san juli tree length function figur curv uniform densiti appar linear mst length function figur curv densiti addit uniform knee vicin hero proc san juli greedi algorithm ir greedi algorithm approxim implement posit integ speci user speci es uniform partit cell resolut algorithm smallest subset partit element smallest subset algorithm select point subset minim stage requir nding minim graph reduc set typic slightli larger suitabl perform polynomi time smallest subset mention stage algorithm uniqu figur show smallest case point figur sampl point mixtur densiti uniform densiti bivari gaussian densiti diagon covari smallest subset union cross cell shown case similarli ravi small subset greedi fq cell rank order number equal arrang lexicograph select subset speci ed stage greedi subset select algorithm bg end termin algorithm minim subset nc def point prove variant theorem hero michel proport point hero proc san juli figur smallest subset point mixtur sampl shown fig theorem fix bound variat denot total variat total edg weight graph construct greedi algorithm sati es lim nc minimum volum set form resolut partit element constant comput knowledg signi canc theorem detail hero michel moment simpli draw reader attent relat theorem entropi estim note niti theorem impli nc lim inf inf class set set de ne condit densiti indic function entropi order de ned log hero proc san juli call condit entropi subset minim ja inf de ne function nc def log nc log main theorem assumpt theorem strongli consist estim minimum condit entropi ja order import implic theorem function desir asymptot properti entropi estim includ vanish varianc condit entropi mixtur approxim equal entropi small entropi estim robust outlier constant comput rel entropi signal classi cation problem ed maximum toler approxim error upper bound total variat underli pdf theorem manipul give select rule requir partit resolut argu basi theorem hero michel estim entropi lower order converg faster estim higher order influenc function entropi estim uenc function long studi quantit robust estim outlier contamin densiti function provid quantit measur outlier sensit estim unbound uenc curv impli ect outlier estim sever robust trim estim reject observ exce sampl bound uenc curv outlin result hero michel establish uenc function entropi estim bound pn empir distribut function sampl xn fx xn pn def arbitrari set statist tn converg uenc function uenc curv sampl de ned lim concentr distribut center ir small interpret perturb distribut result exchang sn sampl distribut sn sampl hero proc san juli concentr distribut probe asymptot sensit estim tn local perturb uenc function weight function comput hero michel identifi tn nc invok theorem assert tn converg integr manipul obtain form uenc function normal weight function tn ic ja function fx entropi set probabl note reject proport greater set ic bound illustr figur ic plot function ir case bivari gaussian distribut case gure left uenc function minim graph span point gure minim graph span point note uenc function bound graph unbound graph span point suggest greedi minim graph natur extens rank order statist method trim complement comment friedman mst natur gener rank order statist test smirnov ic mst ic alpha figur mst uenc curv bivari gaussian densiti plane acknowledg research support part afosr grant hero proc san juli refer tree short proc annual symposium discret pp contribut theori robust estim phd univ california hero theori greedi approxim minim random tech rep commun signal process laboratori dept univ ann arbor mi june redmond theorem rate converg euclidean ann appli pp jain random minim span tree applic network oper pp connect network bell syst tech pp friedman gener smirnov annal statist pp rel neighborhood graph nite planar pattern recognit pp method detect describ gestalt ieee tran comput pp minim span tree nonparametr regress structur comput scienc statist symposium pp ho man test random base minim span pattern recognit letter pp bound acad pp nonparametr estim entropi absolut continu ieee tran inform theori pp estim entropi function multivari ann inst statist math pp peter estim ann inst statist math pp optim block ieee tran inform theori pp asymptot distribut vector ieee tran inform theori pp march theori chao strang rev mod phy pp fractal measur chaotic evolut order pp viola maxim mutual proc int conf comput vol pp chamber statist model paci test normal base sampl royal statist ser pp hero estim point process intens featur span proc ieee symposium inform juli tree short siam journal discret math pp robust
DB/234 3 java corba implement internet queensland technolog gpo box qld australia jame cook gpo box qld australia abstract describ architectur call dynam coupl web access base content interest implement corba orb commun corba iiop protocol combin technolog offer compel middlewar infrastructur implement applic addit discuss core concept implement discuss experi healthcar applic introduct growth internet web dramat data share web brought wave user servic provid internet huge quantiti heterogen inform servic home onlin digit product al result web accept de facto support domain life data provid web html mail unstructur text structur relat wide recogn emerg applic electron web site web site data corpor inevit store organ individu world reli larg number heterogen inform sourc ftp web search conduct everydai busi inform sourc deploi wide area environ highli dynam formal control inform type applic develop knowledg avail inform sourc frequent encount issu larg cooper web research partli support australian research council larg grant number work author postdoctor fellow queensland technolog user queri effici larg highli intric amount heterogen inform sourc web user gener novic expect experi deal knowledg queri languag requir user track inform format queri languag grow number dynam sourc unreason challeng provid board transpar user access manipul data irrespect distinguish kei issu ffl locat inform sourc web inform space larg dynam top exist web tool give support logic organ data effect data web enorm complex ffl understand terminolog pattern inform sourc user educ inform interest dynam eventu establish link inform interest ffl queri sourc relev inform item relev inform sourc user access integr data inform sourc architectur develop address problem scalabl languag support aim achiev scalabl increment discoveri format inform sourc inform space organ cluster inform sourc cluster relat topic proxim relationship cluster inform sourc establish share high level individu site join leav cluster discret prototyp implement latest distribut object corba distribut comput connect gatewai access nativ inform sourc paper describ design implement concept describ practic experi special emphasi java technolog implement internet section overview briefli approach queri languag kei middlewar technolog implement detail section experi healthcar domain report section overview current implement section relat work discuss section provid conclud remark section design user find inform sourc manner user specifi queri term relev inform languag queri local metadata repositori hold relev local cluster assum user system user particip cluster inform sourc requir system prompt user select interest lead local metadata repositori fail resolv user inform cluster local repositori send queri remot metadata repositori interact process system support educ user inform space assum inform sourc offer requir user describ inform sourc number assist make support understand inform context semant user queri select inform sourc briefli describ approach queri languag detail found al al fundament concept center approach bridg accommod system consist larg number scale approach correspond coalit servic link coalit mean strongli coupl servic link mean connect user increment dynam educ inform space approach enabl introduct layer surround local dbm layer inform local dbmss relationship rest internet web interchang special languag call construct inform space explor coalit coalit special singl common topic domain specif inform term interact coalit underli provid abstract specif domain abstract intend user coalit descript specif domain coalit dynam base common area interest singl atom unit particip coalit medic worker union share descript inform type medic worker union figur node chang coalit coalit compon exist coalit chang advantag fact develop specif implicit organ principl servic link servic link simplifi share inform share low overhead amount share servic link involv minimum inform exchang servic link low overhead altern inform share coalit servic link medic medic insur agreement coalit figur coalit medic minim descript inform type medic coalit medic insur servic consist type type involv servic coalit exchang inform type involv servic servic involv servic coalit servic coalit involv provid gener descript inform share servic involv provid gener descript inform share altern servic coalit gener descript inform share coalit coalit servic medic inform domain figur show fourteen govern royal brisban worker centr medic benefit fund australia rmit medic queensland cancer australian amp privat invest princ charl group coalit medic servic link amp coalit research coalit princ charl ambul qld cancer medic worker union coalit fund rmit state govern fund medic insur coalit coalit medic worker union figur coalit servic link medic world locat set fit user queri requir detail inform content system particip attach objectori store inform servic link set export type inform repres class schema mean coalit repres class class descript particip type inform attribut describ type inform provid detail type inform descript includ inform data oper queri descript inform type includ gener structur behavior view type common part view repres class attach royal brisban hospit inform relat coalit servic link royal brisban hospit member coalit research store inform coalit inform coalit servic link coalit store inform servic link state govern fund medic insur store access inform royal brisban hospit includ export interfac internet address interfac consist set type export oper textual descript type royal brisban hospit repres oracl date default patient patient date date date descript doctor begin complet student date date administr decid make public inform document file multimedia data program plai product access inform includ wrapper access data set export type assum administr decid relat relat research medic royal brisban hospit inform sourc royal brisban hospit inform type document locat wrapper interfac document royal brisban hospit type present access web java applet plai video wrapper access data oracl queri export interfac type research patient type defin type attribut string attribut int function string int date function denot access routin return descript patient sick date routin written oracl interfac case attribut denot class attribut function denot class method access routin user locat investig export interfac fetch attribut function access languag design queri web organ manag evolut architectur syntax specif languag provid construct educ user space find target hold requir type connect perform remot queri inform graphic handl identifi inform sourc manipul ffl search inform ffl search inform type provid ffl search inform type provid structur inform host ffl queri remot order show salient featur medic inform domain repres figur assum research research centr interest gather inform health queensland order prepar survei interest inform treatment research research queri medic research conduct hospit start investig submit find coalit inform medic order resolv start coalit research member check hold inform system found local coalit research deal type inform point entri provid coalit connect coalit user interest specif inform research conduct submit refin queri displai subclass class research user decid queri displai class continu refin process assum user decid queri royal brisban hospit subclass class research user knowledg construct displai document inform queri achiev goal displai document instanc royal brisban hospit class user interest queri user queri displai interfac export displai access inform instanc royal brisban royal brisban hospit locat export type attribut string attribut string attribut int date function real function return budget research project interest budget research project aid function function translat sql select assum research interest queri system medic insur queri submit system find coalit inform medic check coalit research member coalit research fail answer queri coalit servic link relat local check local coalit awar coalit servic link deal inform type system found royal brisban hospit member local member coalit medic servic link coalit insur deal request inform type user decid investig coalit relev inform middlewar technolog section present architectur support framework architectur adopt approach provid servic interconnect larg number autonom heterogen base corba java technolog briefli overview technolog implement distribut applic internet corba larg scale network system support data access commun standard effort architectur heterogen distribut system produc matur infrastructur technolog address issu import standard emerg omg corba harkei corba infrastructur mechan deal platform transpar locat implement commun softwar compon distribut object environ idl definit languag separ implement interfac corba servic corba idl describ oper attribut object interfac understood rest system corba object interfac defin idl map function resourc network applic interfac specif corba client discov type object ad system chang system issu corba orb address corba corba harkei specifi gener protocol set messag format data commun orb common data data exchang format omg idl data type flat network messag object refer creation common object refer orb specif object refer design work top commun protocol internet protocol specif network iiop object distribut commun corba compliant orb support iiop provid gatewai java languag gain popular write internet applic java java platform independ objectori program languag main featur make java ubiquit notion applet user interfac provid java applet user download user interfac web server browser user interfac enabl distribut heterogen platform overhead code administr run regard distribut java technolog java remot method invoc java java connect java nativ interfac relev technolog provid object access servic main reason make java technolog choic context data share jdbc api set java gener interfac sql interfac relat sql java applic dbm vendor provid java interfac bind java corba java corba technolog converg provid complementari type servic corba concern commun object implement platform network java implement object addit java rmi object talk java rmi object rmi design orb languag tool bridg java corba provid wai java applic access compon written languag host varieti comput platform point corba java java applic access corba object part jdk iiop complaint orb java applet download user machin commun system compon corba java offer portabl infrastructur applet load execut machin internet commun corba servic runtim configur addit jdbc access sql relat java applic java corba offer complementari function develop deploi distribut applic clear technolog greater flexibl power technolog robust distribut architectur creat java program java applet provid user corba integr technolog note type middlewar technolog roger technolog approach activex harkei develop applic recogn approach adequ sophist remot server capabl data share requir approach offer advantag dbm dbm connect orb shown java browser queri processor user interfac level iiop state fund brisban royal rmit qld cancer fund charl princ ambul orb amp corba object granular sourc level msql msql objectstor objectstor objectstor jdbc jdbc jdbc method invoc oracl oracl oracl oracl java local broker msql worker union jdbc jdbc figur implement note corba iiop http run network internet backbon corba realiti desktop access internet interfac activex minim cost architectur compon group layer interact queri internet interfac figur section introduc layer interact layer basic compon queri commun data layer subsect focu descript function implement compon prototyp queri layer queri layer user access servic browser queri processor user interfac store educ user inform locat inform sourc send queri remot displai result browser user inform graphic text queri user class instanc user follow link object class focu detail filter restrict set object queri layer commun layer data layer layer browser queri processor corba orb orb orb orb iiop iiop internet server server inform sourc interfac figur layer queri receiv queri coordin execut return result browser queri mit browser preprocess check syntax queri processor algorithm determin step queri resolut time queri browser instanti execut plan initi queri queri processor interact commun layer dispatch queri result return back queri processor commun layer commun layer commun layer manag interact compon mediat request queri processor server queri processor interact server server network accomplish task commun layer locat set server perform task respond queri processor task inform server inform data store server layer layer consist set server store inform servic design respond queri inform space locat sourc typic schema repres coalit servic link deal specif type inform consist lattic class class repres set answer queri special type inform repres coalit type consist servic link coalit member hand servic link coalit consist turn subclass describ servic link servic link coalit data layer data layer inform sourc interfac current version support relat object orient inform sourc interfac access specif server involv deliv request commun layer retriev result provid possibl inform sourc interfac locat site inform sourc interfac reli gatewai protocol inform sourc overview implement complet implement scalabl portabl architectur architectur implement latest object web includ connect gatewai access nativ prototyp develop corba orb iiop java orb connect encapsul corba server object implement jdbc bridg connect relat corba server object corba object implement java java server commun corba server object implement server method invoc commun corba server object implement java server user interfac implement java applet commun corba object current implement system base solari jdk includ jdbc access relat corba java objectstor connect connect relat connect corba oracl connect msql connect figur corba server object jdbc commun relat method invoc commun interfac corba server objectstor support commun interfac java corba server corba object commun iiop figur healthcar applic order illustr viabil architectur show queri global inform system healthcar applic healthcar applic provid relev context tool applic support queri healthcar relat servic enabl larg number heterogen autonom healthcar provid commun fourteen state govern royal brisban worker centr rmit medic queensland cancer australian princ charl hospit figur accompani implement manag point user queri system level displai meta inform data level actual inform store user applic start pose queri specif area healthcar domain queri figur displai document plai coalit inform medic submit system find coalit medic research provid inform medic research user coalit user displai member research coalit click research coalit submit queri instanc class user view result lower half left hand side window figur user click user click royal brisban hospit format document displai hand side window figur note user type queri document instanc royal brisban hospit class displai result user decid read document click html button figur displai content html file document royal brisban hospit user system queri metadata assum locat understand content royal brisban hospit user decid queri actual data queri actual data queri directli nativ queri languag underli queri map queri underli assum user medic student hospit student type export royal brisban underli support user sql statement medic requir inform definit queri queri submit execut click fetch button figur show result queri relat work larg bodi relev literatur inform integr close relat elmagarmid www inform retriev system al inform broker system investig static approach share data small number compon elmagarmid involv find solut data heterogen facet autonomi solut reli central administr document semant develop translat hide differ queri languag structur approach offer solut heterogen problem global schema al scheme provid site autonomi complex construct global schema larg number heterogen system mind project investig corba implement approach al approach offer solut autonomi expect user semant locat system elmagarmid assumpt reason environ www inform retriev inform retriev emphasi build index scheme effici access inform hint resourc al issu inform space terminolog semant support user request address harvest al inform gather present interest model find resourc network comput system research conduct system point issu simplifi approach figur html document displai address issu inform discoveri web commun idea provid uniform declar interfac data share web languag www recent emerg shmueli websql al araneu al languag tend abstract unstructur collect web document graphic organ page repres node graph fix set singl combin textual retriev structur queri support techniqu base inform retriev system result focu relat topic www inform broker inform system investig solut data share context larg dynam inform space compon structur relat html unstructur text sourc exist system unstructur data interest capabl mediat translat system lack facil inform user educ inform sourc locat remaind briefli overview import project tsimmi project al data call object exchang model integr heterogen inform sourc includ unstructur semistructur data tsimmi primarili gener wrapper mediat integr access underli inform sourc process queri issu inform inform space terminolog problem tackl disco project extens oql common data model queri languag support unavail inform sourc transpar addit inform sourc issu inform space terminolog problem tackl disco project al extend disco provid protocol architectur locat data sourc translat inform manifold system uniform access collect heterogen inform sourc www queri system describ content capabl inform sourc domain model common global knowledg base describ browsabl inform space includ vocabulari content inform sourc capabl queri argu difficult creat maintain common ontolog varieti characterist underli web repositori infosleuth project al present approach inform retriev process dynam environ integr agent domain inform broker handl data servic inform network system architectur deal scalabl inform provid facil user educ inform space organ infosleuth support domain relationship consid experi project shown combin jdbc offer middlewar infrastructur implement data share architectur corba combin repositori support dynam locat integr inform sourc maintain autonomi java system deploi dynam web user sophist interfac jdbc simpl api relat java applic vendor recent announc java figur queri result client relat product provid jdbc odbc driver refer weav athen interconnect heterogen inform kluwer academ publish build inform intern journal customiz discoveri access technic boulder ed objectori solut advanc prentic englewood cliff jersei semant integr inform open dynam acm intern confer manag data java applet corba distribut ieee internet comput retriev world wide ieee internet comput inform broker heterogen digit phd state jersei queri system world wide pp queri heterogen inform sourc sourc int vldb bombai model queri evalu global inform intellig inform system queri world wide parallel distribut inform system pp equal time data internet intern confer extend technolog spain scalabl architectur autonom heterogen intern confer larg data base switzerland program java john wilei queri optim data engin object exchang heterogen inform intern confer data engin scale heterogen design int confer distribut comput system
Agents/235 1 entropi guid agent find depend path pattern network abstract telecommun network owner oper half centuri awar potenti loss revenu major trunk depend high cost implement effect common depend scheme protect capac redund network grow number applic depend connect specif requir bandwidth delai start internet effort base commun servic paper adopt protect scheme incorpor part rout system applic internet infrastructur capac redund longer requir distribut stochast path find algorithm base cross entropi method combinatori present earli result mont carlo simul algorithm capabl find pair independ primari backup path satisfi specif bandwidth constraint optim cross entropi mobil swarm network manag introduct telecommun network owner oper half centuri awar potenti loss revenu reput trunk damag larg number subscrib disconnect longer period time depend high cost implement build physic redund network topolog simpl effect scheme protect redund primari link independ backup link stand readi failur occur dai design decad oper provid effort commun servic loss connect user applic found level qo recent grow number applic depend connect specif otto depart telemat norwegian scienc technolog ment bandwidth delai start internet base commun servic trend call idea solut domain path fine network paper adopt protect scheme incorpor part rout system high level depend achiev redund network find path network gener consid hard problem case travel hamiltonian longest find optim pattern primari backup path set sourc destin node delai link independ requir satisfi similar proven problem forbidden connect respect problem classif code paper introduc distribut stochast algorithm capabl find optim pattern primari backup path agent algorithm behaviour compar navig behaviour algorithm inherit mathemat foundat cross entropi method combinatori section ii describ problem hand detail section iii introduc cross entropi method section iv describ foundat behaviour agent section continu implement detail section vi present result mont carlo simul final section vii conclud futur work motiv ii problem descript common strategi improv depend system introduc redund system compon redund impli duplic compon primari set backup set exist primari compon activ fault peer backup compon configur oper wai modular redund impli backup compon run parallel duplic link network transport copi inform synchron standbi redund impli activ backup compon primari network dimens spare capac backup link rerout traffic primari link fail modular redund commonli implement link level commun network fast fault recoveri import redund link low prioriti traffic configur backup link standbi redund common higher level commun transport level state countri back bone network protect ring high prioriti traffic transport direct ring free rerout opposit direct link failur occur low prioriti traffic capac opposit direct link ring oper virtual path atm network appli construct pattern primari backup path mesh network contrari ring implement capac redund due ring pattern mesh network implement link failur protect primari path requir capac redund simpli select primari path share backup path select primari path low probabl fail simultan atm typic run back bone network path pattern configur network oper algorithm network plan develop produc optim configur long network paramet node algorithm network oper overview control appli algorithm internet protocol common protocol backbon end user network enabl label switch path establish vp enabl configur path pattern path end user optim pattern configur provid end user tailor qo effort servic provid standard todai find optim pattern configur hard number primari path vari constantli user establish connect central control unit total overview exit algorithm appli section introduc algorithm find path pattern algorithm produc optim pattern potenti handl dynam produc pattern primari path establish path pattern mesh commun network repres direct graph set link edg set node vertic pair abbrevi repres link node node gener abbrevi manner rest capac link provid connect sourc node destin node specif set link implicit path rank set connect set rank primari path definit higher rank backup paper rank level path set set subset combin power path pattern subset primari backup path connect present describ wai set connect establish path path pair tional time final requir capac connect object function path pattern problem formul find path pattern sum link overload valid combin return oper primari backup path subject ing primari path assign capac requir link primari backup path connect disjoint iii cross entropi method algorithm paper base publish algorithm found cross entropi method combinatori focu search optim hamiltonian travel algorithm find optim path addit cost function algorithm transit probabl matrix gener sampl path matrix probabl transit specif node neighbour node event find optim path random walk revisit base matrix rare event theori appli find path rubinstein design algorithm import sampl multipl iter alter transit matrix amplifi probabl markov chain produc optim hamiltonian path cross entropi appli ensur optim alter matrix speed process perform function weight path qualiti high qualiti path greater influenc alter matrix algorithm step iter initi transit matrix uniformli ¤ gener path calcul minimum boltzmann temperatur ¤ perform function return qualiti path raw cost path delai telecommun search focu paramet solut result amplif high qualiti path minimum averag path qualiti current batch ¤ path step gener transit matrix solv ¤ transit probabl node iter solut shown ensur optim shift probabl respect perform function cross entropi repeat step path found iv agent behaviour distribut implement cross entropi method replac autoregress counterpart singl path found step immedi perform probabl matrix gener algorithm view distribut search system search agent evalu path found calcul reach destin node immedi start backtrack path sourc updat relev probabl transit matrix appli search system great similar ant coloni explor ing environ search food markov chain transit matrix compar pheromon trail built ant search food step compar ant forward search path food sourc ant qualiti path found step repres adjust pheromon level trail return nest remain paper interchang call compon execut step distribut algorithm mobil agent agent algorithm directli inspir ant forag analog exist al pioneer lack mathemat foundat algorithm problem solv inspir ant swarm creatur gener agent algorithm paper adopt fundament implement cost function approach primari path path dealt separ speci agent fundament idea speci accord criteria section backup agent search path disjoint primari path backup agent overlap mari path search disjoint path agent agent repres load addit incur overload addit cost function path establish link cost repres desir link sider path criteria section agent involv build path agent speci rank synonym compon explain requir capac connect path intend carri question requir capac compet path summat includ path speci rank link probabl agent link departur link node agent visit left node probabl agent visit node forward search weight requir capac compet path agent encourag avoid link overload gener weight capac backup path connect return approxim probabl common link failur ur primari path return weight requir capac compet path agent encourag avoid link probabl common link overload occur primari path constant turn agent discourag follow link primari path enforc constraint primari path connect constant return agent discourag follow link alien primari path constant empir meant probabl backup path rout link alien primari path rout link primari avoid violat constraint constant return requir capac connect repres summat appli output cost ensur link cost paramet regul smooth transit area overload overload fig candid path run overload link cost close return link lot spare capac return high cost expect link summari cost path agent high level pheromon high probabl transit agent potenti compet resourc link path η fig cost shape result plot show implement verifi perform path algorithm simul implement base activ network enabl version simul open sourc simul packag capabl simul realist scenario extens make conveni implement simul scenario multipl mobil agent solv problem explor network topolog implement agent behaviour fairli straight forward agent algorithm roughli perform step sourc clear node visit fetch vector form probabl common link failur speci primari path alien primari record visit current node current node destin fetch temperatur destin node db calcul temperatur base accumul path cost store temperatur updat total visit node store node db fetch total clear vector probabl common failur backtrack hop sourc node updat transit matrix ii accumul approxim common link failur abil speci rank fetch relev node db calcul store vector iii updat divid fig network topolog node link link duplex capac total visit current node node total node visit destin store sourc node store vector common link failur probabl node db goto step build probabl tabl base transit matrix speci rank avoid revisit select node visit probabl tabl calcul cost node db link node relev fetch node db vector carri agent accumul path cost move node goto step minimum agent requir path search search converg path found agent chain high valu transit matrix intens track vi simul result figur show topolog network chose test scenario link topolog duplex capac algorithm paramet valu appli simul empir test scenario connect node test network pattern independ primari path backup path expect establish pattern network resourc path node node primari path oper tabl result simul primari path overload ¢ link sim path disjoint ¢ link sim singl link failur handl backup path overload averag link overload due mal backup path loss link failur backup path suboptim sim maximum ¢ link share path backup tabl show result simul test scenario pattern primari path establish link constraint section satisfi simul pattern establish path pair common constraint satisfi simul simul backup path pattern establish handl singl link failur link network overload good candid object function found remain simul averag standard deviat specif singl link failur overload situat due suboptim pattern backup path overload situat occur greater loss traffic experienc path pattern backup path suboptim consid good candid object function vii common improv depend commun network configur pair independ primari backup path backup path meant carri primari traffic primari path fail internet dai level depend provid end user tool enabl path configur paper present distribut algorithm capabl find good path pattern mesh network subject link capac constraint algorithm suitabl control desir algorithm base publish algorithm inherit foundat work cross entropi advanc link cost function introduc algorithm cost function path conflict link overload traffic loss primari path free fault link failur occur simul result algorithm manag establish close optim path pattern paramet tune test requir futur work includ test algorithm larger realist network environ dynam traffic investig perform rout system ad hoc network refer otto cross entropi method mobil path find network intern workshop mobil agent telecommun applic springer august di caro marco dorigo distribut stigmerget control commun network journal artifici intellig dec project network simul ns label switch architectur januari eric marco dorigo gui theraulaz swarm natur artif system oxford packet rout genet program mobil agent septemb activ architectur ieee commun larri peterson bruce davi comput network system approach morgan special network atm ieee commun septemb optim spare capac faster restor mesh network journal network system jun garei johnson comput guid theori marco dorigo di caro ant algorithm discret optim artifici navarro varela mc sinclair ant coloni rout wavelength alloc congress evolutionari comput washington juli white pagurek franz connect manag adapt mobil agent intern confer parallel distribut process techniqu applic jon rfc internet protocol septemb load balanc telecommun network adapt rubinstein method combinatori continu optim methodolog comput appli harm wong resourc manag vp atm network ieee
Agents/236 1 control mobil antonio rebecca montanari cesar stefanelli dip di informatica sistemistica depart comput dip di ingegneria università di bologna imperi colleg università di vial itali uk itali abstract mobil softwar compon interest solut web servic applic internet global infrastructur mobil network network infrastructur support form code mobil make dynam reconfigur bind code fragment locat execut work facilit specif enforc mobil behaviour softwar compon tradit approach emb migrat strategi compon design time suit dynam network scenario mobil compon enhanc possibl adapt mobil behaviour evolv applic environ condit react unforeseen event reach paper adopt polici base system abstract specif migrat strategi compon code approach permit chang mobil behaviour compon compon code experienc dynam flexibl approach framework obtain integr manag system mobil agent environ migrat adapt mobil reconfigur introduct mobil softwar compon chang distribut applic deploi mobil attract attent internet commun field mobil network area final goal mobil user access web servic area mobil peculiar devic frequent move network reconfigur oper properli mobil softwar compon address dynam place applic requir environ state challeng express adapt mobil behaviour face adapt mobil behaviour compon essenti environ user mobil reason assum fix logic physic network node avail static migrat control viabl lack flexibl migrat strategi scratch chang applic requir environ programm inform design priori assumpt hold compon execut address dynam flexibl mobil specif enforc open research issu regard comput dynam flexibl migrat challeng enabl mobil applic programm reloc compon set environ node base environ state applic total execut fault load balanc complex task call intellig system automat comput adapt migrat strategi approach exploit ai reactiv plan method sequenc action achiev goal unpredict dynam environ case ai planner find sequenc site reloc migrat expect time complet applic task produc adapt migrat strategi underli program framework handl migrat develop mechan enforc migrat strategi mobil behaviour impact compon implement tradit approach hardwir set migrat rule compon code requir compon reengin address evolut applic requir environ state develop mobil applic benefit term flexibl dynam adopt program paradigm assum explicit separ mobil specif code research mobil softwar architectur begin opportun separ paper investig approach programm mobil behaviour term declar highlevel polici decoupl applic logic dynam modif compon mobil behaviour requir chang polici control enforc migrat deleg underli polici transpar applic code polici support charg preserv consist compon reloc feasibl polici control mobil approach demonstr integr ponder polici languag mobil agent ponder languag defin control agent mobil strategi program framework offer servic support mobil agent applic polici control mobil system support form mobil exhibit rigid control scheme primari limit deriv fact rule govern entiti mobil compon design time approach applic adapt evolv condit mobil roam user possibl discontinu interconnect sourc rigid deriv assumpt unit part compon move remot evalu code demand model provid code mobil agent paradigm agent code move state applic benefit scheme finer grain mobil control overcom work rule compon migrat mean polici separ compon code polici set rule govern behaviour system polici describ mobil behaviour compon mobil benefit research carri field manag distribut system main advantag polici adopt flexibl dynam control chang mobil behaviour compon clean separ mobil polici code compon permit dynam introduc migrat strategi impact compon implement approach mobil provid clear polici model mobil polici express repres enforc model determin map polici specif implement polici mobil polici mobil compon polici separ enforc model integr consist coher manner polici control mobil type decid model mobil term polici trigger event occurr concept polici gener field manag distribut system handl autom manag configur secur task case polici migrat action perform specif event occur event defin gener state system uniformli model applic environ condit exampl case complet applic task compon execut context cpu memori bandwidth occup polici requir underli support servic detect notif event exploit polici facilit develop mobil compon capabl adapt system evolut event provid indic migrat action place execut flow compon offer integr solut reduc difficulti introduc dynam mobil behaviour compon polici languag requir express mobil polici mobil environ requir design express polici languag solut facilit specif mobil behaviour compon provid time feasibl effect implement model polici definit languag mobil satisfi requir primari adopt declar polici separ specif migrat strategi enforc mobil compon migrat strategi term declar rule polici enforc infrastructur notif event compon charg forc migrat action advantag deriv exploit declar polici languag simplic polici analysi potenti conflict inconsist polici definit languag permit express basic element involv mobil specif entiti charg trigger mobil polici entiti target polici target polici subject mobil compon current execut environ mobil compon autonom decid case host execut environ forc instanc improv load balanc regard polici polici languag permit programm desir unit mobil approach unit mobil mobil part code data depend applic environ condit polici languag design model event relev trigger migrat set mobil action perform event locat mobil compon move defin condit check actual activ mobil action condit act constraint applic mobil polici depend dynam state resourc compon access polici languag mobil assum implement platform map exist underli platform open issu mobil interest open issu enforc mobil polici migrat compon preserv consist polici infrastructur design enforc mobil polici applic logic compon consist state polici infrastructur check compon engag transact transact polici event reaction perform atom resourc compon bound consist updat similar issu emerg field dynam chang manag distribut applic sourc inconsist deriv conflict inevit larg system specif happen polici oblig refrain polici subject perform migrat action polici target runtim polici conflict event trigger set polici conflict action paramount issu mobil detect resolv conflict research carri field polici conflict offer valuabl solut ma framework studi appli approach mobil context ma system exploit polici languag govern agent behaviour ma system call program framework rich set servic develop secur ma applic agent control polici express ponder languag ponder declar languag support express specif type manag polici distribut system structur techniqu polici cater complex polici administr larg inform system focu subset ponder oblig polici permit mobil agent adapt mobil behaviour dynam ponder oblig polici mobil ponder oblig polici defin action polici subject perform target object specif event occur introduc simpl illustr ponder oblig polici tabl polici state buyer agent oblig system compon migrat call current node overload migrat action trigger cpu usag buyer agent forc move perform reachabl polici differ buyer agent decid migrat case agent subject target polici subject target ponder explicitli target note trigger event specif keyword includ event excess cpu simpli defin event paramet event express combin basic event complex model sequenc event multipl action follow keyword polici oblig languag concurr oper action execut sequenti parallel mean action object follow action object ponder oblig includ programm set condit polici consid reachabl node condit explicit polici specif act constraint applic polici ponder constraint express term true polici appli inst oblig subject system target inst oblig subject tabl ponder oblig polici agent simpl mobil shop agent show advantag result approach mobil agent dispatch order bui flight ticket conveni price initi list site visit dynam modifi run time agent visit list site report back owner collect offer figur show altern program methodolog applic scenario tradit approach adopt develop ma logic rule mobil behaviour static agent code develop time figur report code fragment agent call implement java passiv object class extend abstract agent class defin basic method control agent life migrat figur show action agent migrat method destin site task execut site arriv interleav sequenti predefin order action agent achiev applic goal maintain date travel plan encapsul itinerari object assum agent migrat list node complet task node overload agent constantli check cpu load statu approach applic logic chang agent execut agent code agent mobil evolv environ abstract model mean ponder oblig polici figur report agent code execut intermedi node case agent class extend abstract class agent method react event occurr mobil polici figur show agent migrat strategi express term ponder oblig polici ponder oblig polici includ set action chang migrat strategi manag agent travel plan action trigger occurr event deriv statu agent servic air travel agenc site induc agent migrat list site event occurr event occur complet agent method activ migrat current travel agenc twentieth visit site forc agent back visit twenti node introduc oblig agent move success node itinerari current host site overload ponder oblig polici provid fine grain control unit mobil forc migrat core agent instanc save bandwidth case link agent class download demand program mobil mobil public class extend public abstract class extend agent execut mailbox int public class extend itinerari void string list offer void agent check cpu load support local comput list number visit node subject target subject subject target node list figur comparison tradit agent polici vari agent lifetim due chang user prefer case user command disabl polici substitut underli polici manag support transpar polici requir propag agent impact agent code implement simplic clear polici approach mobil permit manag complex migrat strategi chang enforc dynam final worth assert extend polici infrastructur automat transpar lifecycl manag ponder polici specif polici distribut enforc final goal provid polici support configur form servic mobil agent context influenc wai mobil polici deploi polici support set servic event propag event dispatch agent special messag agent react event occurr mobil polici preserv agent state consist compon mobil requir softwar engin techniqu support adapt code reloc strategi manag mobil behaviour run time impact compon implement approach mobil permit express mobil behaviour compon separ applic logic abil dynam chang migrat strategi chang function integr ponder languag framework show feasibl approach acknowledg research support italian ministri scienc technolog research project framework infrastructur qo web multimedia servic heterogen bologna fund select research integr infrastructur support secur refer code ieee transact softwar agent middlewar mobil ieee jp mobil ad hoc ieee knowledg phd univ agent distribut inform intellig inform middlewar physic logic proc ieee layout distribut applic proc acm ponder polici specif proc polici workshop springer secur open mobil agent program proc ieee classif manag polici polici specif polici proc chapman driven manag distribut journal network system plenum framework softwar acm transact softwar engin support distribut ieee evolv philosoph dynam chang ieee transact softwar al distribut system ieee transact softwar logic program approach conflict resolut polici proc morgan kaufmann secur polici mobil agent microprocessor
IR/237 5 user behavior analysi locat awar search engin katsumi takahashi institut industri tokyo tokyo japan abstract rapid growth internet access mobil user put import locat specif inform web uniqu web servic call mobil info search ntt laboratori gather inform provid locat awar search facil perform associ rule mine sequenc pattern mine access log accumul mi site order insight behavior mobil user spatial inform web detail web log mine process rule deriv report paper introduct emerg internet tout emerg user internet free locat restrict rapid growth internet access mobil user chang percept mobil user wide rang mobil car navig system definit mobil internet user peopl fix place mainstream internet concern locat inform place servic reach nearbi abund page web kind address form locat inform search engin call mobil info search ntt laboratori collect spatial inform portal access target varieti mobil devic laboratori tokyo japan ntt inform share platform laboratori tokyo japan support posit acquir mean report mine process access log mi access log web site record user request web server access log page visit kind cgi request access extent user modifi web site satisfi user provid site chang layout page placement link perkowitz etzioni concept adapt web site dynam optim structur web page base user access analysi web log understand characterist web user major topic web mine data mine techniqu appli web log predict futur user behavior deriv market applic provid limit person base access log analysi pioneer achiev success mobil user affect inform shop adapt content locat visitor base manual defin rule studi effect focu mine behavior user regard locat uniqu featur mi mine knowledg mi access log usag mine uniqu site give interest insight behavior mobil devic user target site associ rule mine sequenti pattern mine techniqu examin addit locat hierarchi method select interest rule mobil info search locat zip el nearest station search shop inform keyword type map train rout train timet hotel newspap weather report tv guid index page mobil info search mobil info mobil info search research project conduct ntt laboratori goal provid locat awar inform internet filter practic mi emploi mediat architectur user inform mi mediat resourc onlin internet meta search static file locat orient search site public url averag search perform site daili snapshot site shown figur page shown english servic primari mi cgi paramet locat inform search map submit map yellow page submit shop train time tabl submit station station train rout submit rail station hotel guid submit hotel nearest station weather report submit weather address region local newspap submit newspap address region local tv guid submit tv address region tabl resourc internet user locat acquisit user input locat nearest postal number user person handi geo posit user locat automat obtain ph servic launch japan juli unlik convent cellular telephon ph small base station base station serv cell area hundr meter diamet form grid cell base station build street cross locat acquir ph exact locat user posit nearest base station user input locat map softwar softwar search train rout schedul travel navig mi function mi main function locat orient meta search local inform web inform store backbon contrast static access cgi program www server mi simpl interfac local inform servic search interfac convert locat inform pick suitabl wrapper request servic resourc provid shown tabl search search spatial search search document close locat transact user repeat tabl locat acquisit method word mean search emploi collect static document internet search engin provid search spatial search displai document order distanc locat written document user locat institut industri scienc tokyo locat user locat search return home page word address ii vicin mine mi access log deriv rule report statist mi process associ rule mine sequenti rule mine result site statist tabl user manual input posit user automat locat acquisit devic perform search simpli number transact divid user distribut search type shown tabl map account half search search yellow page user repeat rate lower discuss problem search transact user repeat map shop rail hotel weather newspap tv tabl search type preprocess analyz user search access log record server januari access log consist imag search cooki page relat search log remov remov log default locat examin log trial access repres actual mobil user behavior final access mine cooki identifi uniqu user typic threshold session identif session end session view time page longer minut session uniqu user access log format search log consist cgi paramet locat inform locat acquisit method resourc type resourc search map rail station tv condit search shop summari paramet tabl latitud nl longitud el paramet set manual automat comput zip station paramet automat posit acquisit gp fetch latitud longitud cgi mi convert postal code nearest station type web search cgi primari paramet begin submit list primari paramet tabl cgi paramet depend primari paramet paramet shop shop web keyword empti search yellow primari paramet submit shop search servic paramet elimin process log paramet usag nl latitud el longitud address station zip postal code locat acquisit method keyword search keyword shop cond search categori submit resourc type search shop web resourc yellow page map web resourc map rail web resourc train rout station web resourc train time tabl tv web resourc tv guid tabl cgi paramet window figur access log treat paramet item transact data retail sale gener item describ time access access search log shown figur taxonomi locat place follow kind part town part introduc taxonomi ad item part cgi paramet address entri cgi paramet entri add item ancestor citi level level mean mean citi introduct hierarchi find relat log log id user id item submit map tabl access log relat rule specif locat wider area cover locat case locat search condit distribut peopl peopl interest popul obtain rule support low upper hierarchi level search count separ item support higher support locat hierarchi level expect rule suffici support hierarchi add comput burden mine prose number item significantli emploi optim gener associ rule mine taxonomi effect prune candid itemset gener transform transact tabl access log transform transact tabl readi mine part transact tabl correspond log entri figur shown tabl associ rule mine agraw suggest problem find associ rule larg associ rule mine find custom bui bui transact larg retail organ call confid rule import paramet support defin percentag itemset entir transact confid measur divid good restaur peopl gasolin stand night address peopl search restaur peopl search hotel saturdai peopl search hotel station tabl result mi log mine search condit frequent search restaur start address fridai frequent search depart store stand start address gasolin stand sundai search hotel station peopl osaka start search conveni store zip number peopl hokkaido search conveni store address tabl result mi log mine time locat acquisit method show result tabl common paramet confid user percentag user rule measur lift found measur select rule method set minimum confid higher support rule lower remov item low contribut confid rule rule confid item remov confid contribut prefer rule item find check weather decid plan check weather shop close time tabl result sequenti pattern mine deriv associ rule improv web site identifi rule access pattern user access web site rule place tokyo electron user search station restaur unexpect prefetch inform restaur station reduc access provid link kind user make navig easier offer proper banner learn user behavior hint busi chanc rule shortcom restaur area search result show locat affect search condit rule tabl show peopl largest problem find gasolin stand night rest rule show peopl modest middl restaur hotel station weekend result tabl show addit time locat acquisit method affect search condit rule hotel search nearest station extens railwai rule show peopl hokkaido comfort find conveni store address sequenti rule mine problem mine sequenti pattern larg custom transact introduc agraw transact order transact time sequenti pattern order list itemset custom bui bui show sequenti pattern interest tabl pattern behavior user plan shop deriv pattern part user check weather forecast shop servic call addit inform vicin search final confirm exact locat map discuss summari report result mine web access log portal site mobil user call mobil info search techniqu associ rule mine sequenti pattern mine size access log mi compar techniqu figur behavior mi mobil kind servic affect locat number mobil user automat locat acquisit devic small rule deriv closer examin behavior ordinari user found spatial inform highli valuabl deriv user mobil user rule show item locat inform address station confid rule significantli current implement search list page vicin user locat search automat adjust rang vicin number page case user overwhelm user shop area cluster search result content user obtain desir inform improv present search result expect improv low repeat rate search perform cluster base inform address futur work acknowledg peopl ntt dr goto provid log file mi discuss refer swami associ rule set item larg proc acm sigmod confer manag srikant algorithm mine associ proc vldb june srikant sequenti proc int conf data march agraw gener associ proc vldb septemb agraw sequenti gener perform proc int conf extend march internet market intellig onlin analyt web usag sigmod record prepar mine world wide web journal knowledg inform system etzioni adapt web conceptu framework case proc katsumi orient integr internet inform mobil info design digit march english version dayal user access pattern dynam hypertext link proc
ML/238 6 bayesian learn mechan imag retriev andrew lippman mit media ma abstract introduc bayesian framework imag retriev reli gener model featur base mixtur gener imag jointli model color textur shown perform broad spectrum imag expand bayesian framework direct show formul cbir problem bayesian infer lead natur criteria evalu local imag similar requir imag segment practic implement retriev system user provid imag queri queri significantli ambigu queri base entir imag lead improv retriev present bayesian learn algorithm reli belief propag integr feedback provid user retriev session combin local similar algorithm lead power paradigm user interact result show improv frequenc converg relev imag achiev learn retriev process bayesian imag local global bayesian relev gener mixtur introduct due larg amount imageri access manag problem cbir recent attract interest vision imag process commun unlik tradit vision assumpt content imag analyz context cbir impli space valid imag restrict gener natur typic imag understand problem complex cbir system access feedback user exploit simplifi task find desir imag fundament problem address design imag design learn mechan facilit interact problem solv isol select make learn difficult impact poor imag difficulti learn problem visibl cbir system reli holist metric imag forc rel entir imag cbir system suggest imag user rate imag satisfi goal search imag object visual rate difficult ineffici user rate imag concept concept occupi field remain fill complet unrel imag cbir system order figur concept interest interact paradigm user explicitli select region imag relev region level feedback requir sophist imag problem obviou difficult implement author correspond hard segment arbitrari imag segment lead combinatori number similar evalu perform paper argu formul view problem bayesian infer reli probabilist imag show formul natur lead support interact learn segment prior work import local queri relev feedback recogn system develop satisfi requir local queri common solut handl local queri reli imag segment perform retriev individu evalu similar queri region region extract imag approach suffer fundament segment combinatori number similar evalu perform difficulti automat imag retriev system reli determin imag region theoret imag segment enabl practic uncommon segment algorithm break singl object region unifi object make similar close autom segment shape tend crude clear segment advantag queri sophist segment harm context report improv replac sophist segment algorithm belongi al simpler variat clear except observ applic manual imageri econom incent clear portion imag relev queri pose retriev system applic domain medic concern lesion diagnost gener imageri manual process rare specif object interest user segment author adopt simplifi view reli arbitrari imag partit obtain local inform solv problem segment complex notic degrad perform fact clear point segment work arbitrari imag address combinatori match imag segment order overcom mechan literatur simplest make individu region larg featur compact imag repres simpl featur vector individu region manag dimens approach limit local queri object visual concept fall singl imag featur express fine region hard invari imag transform deal region larg spatial support altern view worri compact simpli deal retriev level tradit index minka picard cluster individu imag region organ step significantli reduc queri time queri region match cluster repres cluster index tool major standard problem cluster determin number good function decid cluster fact entir imag includ delet altern al smith reli index mechan deriv text idea dimens featur space creat indic search standard perform retriev main problem approach high space requir imag index save vanish grow problem acut imag region summari downsid approach base index deal region index problem order magnitud complex index open question simpler case base hurdl reli gener model featur probabilist similar solut avoid problem requir segment imag order support queri segment inform requir imag region make queri provid user index complex gener model probabl compact independ number element region make region small singl pixel size choic local neighborhood good tradeoff abil model local imag user includ region arbitrari size shape queri unlik discuss gener model automat support infer facilit design relev feedback mechan relev feedback context relev local queri interest user explicitli greatli facilit learn task retriev system face queri imag figur entir user combin object paint flower white room light paint queri ambigu user select relev region ambigu significantli reduc figur queri imag multipl interpret design relev feedback algorithm difficult retriev system base holist imag similar learner perform figur set visual imag properti concept user interest figur good match figur step accomplish observ singl iter interact user retriev system occur assum clear avoid learn system reli local feedback concentr easier solut realiz solut present problem relev feedback intim relat imag preclud local similar system combin learn local restrict imag patch dimens featur similar criteria conduc learn se requir cluster mechan discuss gener fit natur bayesian formul retriev problem integr solut local queri learn basic idea point retriev system integr inform current queri previou queri retriev imag satisfi entir interact bayesian retriev base system belief adequaci imag integr simpli consist belief propag law probabl belief automat outcom similar evalu previou interact summar small set prior belief propag effici point view comput storag term learn approach closest system reli bayesian relev feedback major differ reli support local queri approach requir explicit model user action reliabl model difficult gener defin set action user imag retriev estim probabl action user observ rule probabl imag target due difficulti system reli simplifi assumpt heurist estim action probabl problem estim obtain function imag similar hard valid user system encount clear function deriv action set complic support simpl interfac context local queri action set account segment queri defin priori problem elimin infer drawn directli observ imag region select user reli gener model featur establish heurist function relat similar imag target belief imag target gener similar function belief retriev bayesian infer standard interact paradigm cbir user system system retriev imag visual similar exampl problem natur formul statist classif space entri design retriev system consist find map kg set class identifi retriev oper set goal retriev minim probabl retriev error probabl user retriev system set featur vector drawn class system return imag class problem formul optim map classifi arg max arg max fp likelihood featur imag featur class prior probabl class absenc prior inform class suit uninform prior optim maximum likelihood criteria arg max singl featur vector collect independ queri fx xn arg max log jy theoret bayesian retriev distinguish properti practic relev featur equat subset queri retriev criteria valid queri due probabilist criteria basi design retriev system account belief propag bayesian relev feedback design bayesian relev feedback start singl queri sequenc queri fx time stamp minimum probabl error retriev criteria equat simpl applic optim map arg max arg max fp jy arg max fp jy compar equat equat clear term simpli prior belief abil imag class explain queri unlik straightforward applic bayesian static prior determin arbitrarili select prior densiti learn previou interact user retriev system summar inform interact relev made futur equat simpl intuit mechan integr inform time state system belief user interest time simpli prior belief iter data provid user time updat turn prior iter prior belief continu updat observ interact user retriev system comput standpoint procedur effici quantiti comput time step likelihood data queri notic equat comput absenc learn point view storag requir effici higher entir interact histori reduc number imag class interest fact number enabl optim respect entir interact logarithm solv equat written arg max log jy log limit belief propag larg side data provid user posterior probabl tend remain constant avoid penal older term decai factor ff arg max ff log jy ff log ff monoton sequenc ff ff arg max fff log jy log rewrit equat arg max jy log solut constrain maxim imag class explain current constraint explain previou interact scalar lagrang multipli weigh import ff infinit ff evalu section report experi perform evalu accuraci bayesian retriev queri improv retriev perform achiev relev feedback normal scenario difficult ground truth retriev oper tediou process imag reli control set ground truth experi report section base wide brodatz textur columbia object brodatz imag repres total imag split small imag larger remain call group queri retriev columbia imag repres view rotat object step includ imag object queri imag angl separ retriev figur tile imag deriv brodatz columbia synthet imag creat retriev randomli select imag time make tile figur show exampl tile call set tile repres set imag consist singl object visual concept composit visual preval real applic singl illustr ambigu local similar consequ local queri imag distinct class test brodatz columbia demonstr perform depend significantli natur individu result present hold gener imageri consequ bayesian formul retriev care select imag featur featur reli mixtur model introduc shown provid good model local term textur color model reli discret cosin transform local imag neighborhood imag featur gaussian mixtur featur queri order test effici bayesian retriev mixtur start set experi involv brodatz columbia retriev experi base dct window slide increment pixel mixtur gaussian brodatz columbia subspac consid retriev comparison evalu perform techniqu textur retriev combin featur deriv simultan textur model mahalanobi distanc histogram intersect method recal recal figur curv brodatz columbia curv obtain shown mean featur vector queri imag includ queri figur present curv approach obtain mixtur bayesian retriev seri experi conduct vari number featur vector queri total number vari block select start center outward spiral fashion major observ drawn figur global similar metric portion featur vector queri imag combin achiev perform outperform retriev approach specif domain brodatz confirm handl color provid support argument larg spectrum small subset queri featur achiev retriev perform ident case queri total featur extract imag cover show type bayesian retriev robust miss data handl local queri easili discuss interest case imag retriev multipl visual tile goal imag queri textur find imag tile queri imag notic vector small percentag total number block extract queri imag overlap block global global figur curv brodatz tile columbia tile mean featur vector queri imag includ queri curv obtain retriev base global similar shown figur present curv situat retriev perform number queri vector show perform base global imag tile textur object interest featur vector consid retriev oper figur show retriev base local queri significantli base global small sampl textur object interest queri vector cover area total number featur extract suffici achiev perform similar result confirm argument bayesian retriev lead effect queri imageri multipl visual figur exampl retriev base global local similar user imag yellow onion number top retriev imag flag indic retriev error overwhelm superior local global queri understood figur present result local global queri object global similar high likelihood retriev system return tile object common queri tile satisfactori typic user interest object visual gener retriev system queri select region user reduc ambigu queri enabl significantli higher retriev learn evalu perform learn algorithm reli tile goal determin reach desir target imag start weakli relat provid posit feedback retriev system simul interact real user cbir system iter iter consist select queri retriev examin top retriev imag find exampl iter small user lot posit find queri order perform test automat fashion reli strategi select feedback exampl end top imag return retriev common target imag select queri block queri posit textur object depict present target retriev perform block region includ block reduc comput complex averag result run learn process perform run randomli select target imag initi queri imag common target converg converg figur function learn factor ff converg rate averag number iter converg diverg curv correspond valu number imag examin end iter top brodatz tile bottom columbia tile perform learn algorithm evalu wai consid percentag run converg number iter requir converg prevent learner enter imag algorithm diverg wai strong diverg occur time imag top queri common target real user tend feel retriev system abort search weak diverg occur top imag troublesom situat user simpli imag exampl figur present plot converg rate number iter converg function decai factor ff number match tile case learn typic rate converg high larger gain occur converg rate learn low converg rate high learn chang significantli select ff crucial achiev rate converg close rate converg affect number match user select queri larger number faster law diminish return converg rate quickli level larg valu interest result cost larg user lot imag screen order find suitabl queri assumpt user imag screen return retriev system learn lead visibl converg improv term number converg occur fast number iter diverg easi detect retriev system number iter prefer start queri initi insist current finish present exampl relev feedback process columbia tile figur depict search target imag consist plastic white blue plastic cup pictur left depict iter retriev process search start imag blue imag object return retriev high object return due chanc object target imag case imag white figur iter relev feedback target imag shown top left queri imag immedi queri base singl featur vector neighborhood center share queri target imag number retriev imag number object share target imag queri return match desir object object similar local consist smooth surfac similar imag object tend return set imag smaller entir likelihood target imag top match higher show imag row retriev work object progress fast notic illustr learn abil retriev find queri includ object object target challeng situat depict figur target consist plastic clai white initi queri imag clai cup object made wood columbia surfac properti visual similar clai retriev oper left significantli top match correct make relev feedback difficult fundament previou object target top match target object share imag object queri point illustr figur feedback process carri iter target object queri top match left object part imag clai cup figur iter relev feedback target imag shown top left queri imag immedi queri base singl featur vector neighborhood center share queri target imag number retriev imag number object share target option base queri newli found target object absenc result match instanc queri object previou iter object confound illustr bottom role learn favor imag object imag return queri base tape includ clai cup visual similar object addit tape enabl queri base target object previou chanc success turn return imag target refer petkov automat semiautomat method imag annot retriev qbic storag retriev imag video page san california malik imag segment em applic imag retriev intern confer comput page bertseka nonlinear program athena learn featur relev similar metric imag workshop access imag video page santa california yianilo bayesian relev feedback imag retriev int conf pattern lugosi probabilist theori pattern recognit percentil blob imag similar workshop access imag video page santa california mao jain textur classif segment multiresolut simultan autoregress model pattern minka picard interact learn technic report mit media defin imag content multipl workshop access imag video page fort colorado pearl probabilist reason intellig network plausibl infer morgan retriev imag intern confer comput india yong mehrotra relev power tool interact imag retriev ieee tran circuit system video septemb flexibl montag retriev imag data spie storag retriev imag video san california local versu global featur imag retriev workshop access imag video page santa california smith chang fulli autom imag queri system acm page boston smith li decod imag semant composit region templat workshop access imag video page santa california color index weak spatial constraint spie storag retriev imag video volum page san california swain ballard color index intern journal comput vol la sclaroff imag digest relev feedback imag rover www search engin visual san california lippman mixtur model effici probabilist index retriev spie multimedia storag archiv system lippman probabilist insight result proc ieee workshop access imag video fort
DB/239 3 august prevent worth pound formal veri cation consist evolut claypool elk rundenstein comput scienc technic report seri worcest polytechn institut comput scienc depart institut massachusett prevent worth pound formal veri cation consist evolut claypool elk rundenstein depart comput scienc worcest polytechn institut ma abstract consist import properti preserv time oodb system applic code directli access alter data structur consequ applic code potenti violat integr term invari data ed applic referenti integr object common form consist manag todai encod constraint system level foreign trigger base level user perform transact rollback discoveri violat constraint program alter structur object extens schema evolut add astronom cost schema evolut formal veri cation schema evolut program altern solut tradit rollback solut consist manag part work introduc notion extens schema evolut demonstr speci ed familiar oql demonstr practic theorem prover formal veri cation schema evolut program theorem prover tool set initi inform axiom invari basic schema evolut primit writer extens schema evolut program suppli contract program written oql correct program highlight main featur veri cation process complet end result approach ecient consist manag framework limit overhead user exibl safe add schema evolut transform system assum complet correct schema consist contract work support part grant nsf grant nsf cise instrument grant nsf grant dr rundenstein industri ibm ibm partnership award ibm corpor fellowship graduat student special team speci gordon sam pat obrien object design softwar contribut provid custom patch system api develop tool introduct consist speci cation manag approach advanc persist languag aid make distinct applic transpar oodb system applic code directli access alter data structur consequ applic code potenti violat integr term invari data model ed applic referenti integr object requir applic programm awar invari constraint ensur code violat applic programm saddl manual verifi applic tediou handl amount test code write time consum test program verifi fact consist state execut applic code support exist form ned set consist de referenti integr program languag kind consist de nition assert except handl mechan languag domain constraint subset type constraint collect type relat system er control constraint speci cation user mechan trigger rdb appli constraint sati ed end entir transact roll back activ system provid power capabl constraint speci cation form rule semant constraint manag enforc research eca rule implement consist manag semant consist manag fairli di erent reactiv control veri cation consist manag techniqu base support consist manag adequ type applic manag strategi schema evolut program larg schema evolut program hour due detect erron condit hour attract viabl option prefer success execut evolut program address paper veri cation schema evolut program prior execut veri cation program reli knowledg start program code system desir nal state veri cation essenti describ start nal state program describ implicitli part actual program code statement subclass implicitli start state system condit statement actual code schema evolut oper behavior implicitli nal state system state requir infer program code gener dicult ineci possibl intract depend program languag chang chang underli object forc code chang order properli add adjust exist constraint constraint common approach ort process occur extens user write complex schema evolut program approach scale ensur program turn consist applic programm constraint evolut program appli veri cation extens schema evolut facil address problem paper present call user declar describ constraint evolut program appli expect outcom program adopt notion contract program languag ei el appli assur consist extens schema evolut user arbitrarili complex schema evolut transform basic schema evolut primit underli oodb oql oql queri languag capabl invok program method languag bind notion contract languag show oql sucient express contract assur consist oodb er ad bene oql standard languag familiar develop er writer formal speci cation contract kei featur practic veri cation approach paper present formal veri cation mechan theorem prove verifi correct schema evolut program term consist constraint constraint prior execut complimentari approach current techniqu consist manag transact highli program schema appli theorem prover verifi program ecient compar potenti cost transact paper demonstr practic approach present proof concept show veri cation schema evolut transform written oql reduc learn complex tool formal languag make approach feasibl develop theorem prover tool user input schema transform oql contract order overview paper rest paper organ section review framework section present paper section present approach section describ contract integr advantag section describ realiz kei featur theorem prover support veri cation schema evolut program section demonstr veri cation process section present relat section give summari work futur direct review framework section present overview extens schema evolut motiv work schema evolut support todai provid xed set simpl schema evolut oper cover user make object schema address limit user custom semant transform exibl manner approach base hypothesi complex schema evolut transform sequenc basic evolut basic primit atom oper xed semant provid underli oodb system ectiv combin primit perform arbitrari transform object complex reli standard queri oql demonstr languag appli data sucient accomplish schema exist technolog system layer top exist system transform exibl user de ne di erent semant type schema transform figur transform di erent class di erent schema address introduc notion templat framework templat fact meta knowledg access oodb system dictionari odmg addit templat encapsul set paramet make transform gener templat figur instanti actual schema element result transform shown figur implement call develop worcest polytechn institut base odmg standard odmg object odmg schema repositori de oql system implement java transact provid safeti net violat undetect veri cation process add requir attribut person class object person class defin select person updat object obj delet address attribut figur inlin transform express oql evolut primit begin templat inlin element select defin select metaclass attribut add classnam attr extent defin select obj attr end templat oql variabl templat variabl user figur inlin templat object design persist storag engin java system demonstr public domain shortli run evolut program consist manag requir speci cation constraint check ensur violat basic schema evolut primit appli class leaf sucient constraint delet class speci ed schema depict figur longer sucient stipul schema refer class figur delet leaf class address schema figur valid evolut oper constraint speci ed equat dangl refer consist system violat structur integr referenti integr system equat list constraint check prior delet class obj art oodb system refer primit system satisfi class consid delet leaf class shown inconsist veri cation section introduc approach address problem constraint transact context schema evolut program address figur schema refer address person teacher depart figur schema show refer person address student ess figur sampl schema refer inherit user declar describ constraint evolut program appli behavior user formal veri cation mechan theorem prove verifi correct schema evolut program explicit declar constraint speci cation equat observ ect refer attribut schema evolut primit actual function program chang section program simpli delet class condit constraint class delet chang consist violat occur refer program class refer class class delet elev constraint hold true success execut program actual program code la softwar contract ei el softwar contract classi ed categori constraint sati ed prior execut program describ state system execut program code part integr notion contract templat schema evolut irrespect languag written encapsul packag templat system captur schema evolut program program schema evolut primit templat explicitli detail present equat irrespect constraint part implement code primit user describ complex schema evolut program inlin templat figur advantag contract contract gener make program easier understand abstract actual code explicit declar program contract achiev higher level speci templat contract provid faster updat oodb system underli object model model support relationship simpli add addit declar constraint exist schema evolut primit templat updat system code mechan formal veri cation put work detect erron condit prior execut schema evolut program avoid cost case failur user verifi initi state system nal expect state determin correct function program consist manag veri cation fulli exploit potenti bene ts step approach util verifi correct templat templat appli system sati es templat correct templat veri ed execut produc state system speci ed aid ensur consist oodb system presenc ed schema state system user speci cation state system violat invari approach veri cation extens test wide industri approach feasibl test case formal approach veri cation base formal veri cation theorem prove techniqu demonstr practic techniqu applic space theorem prover veri cation process appli templat runtim execut theorem set state system sati ed prior execut set nal state system execut templat program achiev advantag formal veri cation consist manag tool kei advantag formal veri cation prevent problem consist occur patch fact recov case schema evolut potenti perform win strategi big advantag templat resourc larg softwar commun veri cation correct templat librari contract templat contract bring advantag mechan easier reason tool aid formal veri cation program state extend templat includ notion contract seamless integr investig oql constraint speci cation languag found adequ er advantag stai languag standard queri languag familiar work manag system user dont learn languag program written advantag simplic oql compar formal speci cation languag contract divid categori precondit prior code repres state execut code code contract templat term prior code templat logic express separ actual oql statement repres templat bodi mean keyword requir express oql statement figur show constraint primit express equat hold true actual schema evolut program execut contract templat behavior primit declar set contract bodi actual schema chang code end templat keyword describ exact made schema evolut program extend veri cation process veri valid schema chang speci ed accomplish set figur show primit class delet system ensur fact occur check condit shown figur delet expect schema class class refer function shown tabl exist exist schema evolut program figur evolut program schema evolut program figur evolut program relationship class declar de ne constraint sati ed prior execut speci ed schema chang behavior chang declar er combin templat bring dimens extens mechan describ contract evolut program wrapper figur show inlin templat figur condit appli result schema applic describ semant user templat valid figur state inlin transform refer attribut exist classnam exist end templat exist classnam exist exist begin templat inlin bodi inlin templat figur inlin templat contract theorem prover templat introduct note section contract provid mechan declar describ constraint behavior order contract ectiv basi constraint mechan perform check ei el support contract check part languag compil approach limit languag account invari invari object model maintain work appli theorem prover mechan valid correct schema evolut program contract templat prove correct program requir knowledg initi state nal state reach set function appli reach target state addit constraint inform axiom environ object form tangenti part function maintain time repetit applic function nal state system applic previou function regard initi state nal state program veri ed correct theorem prove approach veri cation formal model speci cation rule infer axiom knowledg environ model condit speci initi state system nal target state reach rule infer function reason valid path initi nal state system tabl show compon correspond context environ sketch compon problem domain show viabil theorem prover templat tabl theorem prover compon compon model comput object system function speci cation contract rule infer schema evolut primit tabl theorem prover compon environ model comput templat model comput formal describ environ theorem prover appli framework base odmg object model theorem prover provid formal de nition odmg object invari function system dictionari function tabl model comput part setup theorem prover system gener contract system modi ed chang environ object model di erent theorem prover di erent languag assum languag theorem prover object model tabl descript compon object model schema ti de ned de nition schema set disjoint term descript set class system set type system map relationship set relat system obj set object system object pair oid map order set type set method signatur tabl compon object model map type class set method signatur nite set relat map order pair type treatment formal descript object model found system function tabl describ helper function part system de nition theorem behavior function de ned languag term descript set direct supertyp type set direct subtyp type super set direct indirect supertyp type set direct indirect subtyp type set path refer type count path refer type set path type count path number object refer object number object refer object tabl notat axiomat schema invari object model tabl present invari odmg object model speci cation templat theorem prover requir speci cation initi state system nal state veri ed condit de ned section ful ll requir provid initi state valid expect nal state met theorem prover expect input express formal languag contract convert languag theorem axiom descript root closur super root leaf nativ set nativ properti type inherit set inherit properti type distinct uniqu total total invari tabl invari model case languag found base extens studi templat oql contract easili express notat figur repres speci cation evolut program figur figur inlin templat figur notat part develop translat tool automat translat oql contract languag elev burden write contract mathemat languag user begin templat cx rx cx figur primit templat contract begin templat inlin bodi inlin templat figur inlin templat contract rule infer rule infer oper move system state code segment system initi speci cation nal speci cation bodi actual schema evolut function oql rule infer system step schema evolut inlin templat shown figur rule infer rule appli time state system rst restrict set oql veri cation discuss section figur repres initi state system sati ed prior code check class classnam refer attribut exist meaningless proce veri cation initi proce appli rst evolut chang part wrap individu chang primit program templat speci contract figur contract templat evolut primit program initi state system meet speci ed repres nal state sn indic behavior chang primit figur appendix speci cation function subsequ evolut state sn initi state precondit match tabl repres schema evolut oper rule infer system appendix speci cation evolut primit program evolut primit descript add class schema delet class schema add inherit edg delet inherit edg add attribut type default class delet attribut class add unari relationship class class default delet unari relationship class promot speci ed unari relationship binari relationship demot speci ed binari relationship unari relationship tabl taxonomi basic schema evolut primit attribut inherit hierarchi addit primit evolut oql statement translat repetit applic loop bodi result cumul ect state system result applic primit count number element set nal state system cumul result appli primit formal veri cation applic inlin templat illustr work theorem prover step step veri cation templat inlin templat figur show theorem prover appli domain veri cation schema evolut transform autom process comput model rule infer appendix setup part tool user input speci cation contract templat code oql theorem prover prove correct inlin transform shown figur rst prove theorem ty prove correct inlin transform fourth theorem speci es properti evolut program inlin transform schema evolut precondit contract speci cation figur hold add equat desir postcondit expect appli theorem program appli argument satisfi precondit equat program result satisfi postcondit equat assum precondit equat hold function add attribut class function add subclass assum precondit equat hold equat show alter state system execut function equat desir postcondit speci ed equat figur line show loop copi attribut class class end repetit applic desir state postcondit equat theorem function correct theorem repetit execut function di erent argument result cumul ect postcondit equat sati ed base assum class attribut reduc statement simpl theorem equat hold equat hold induct assum theorem hold true class attribut ad class equat sati ed applic repeat figur conveni person address class class refer refer attribut rx class cs prove equat hold class attribut postcondit hold class attribut ad class add attribut class theorem sati es equat equat hold true combin addit attribut base equat schema evolut function give initi state precondit equat sati ed function execut nal state system equat theorem function appli argument satisfi precondit function result satisfi postcondit proof manner similar theorem schema evolut function precondit hold function equat desir postcondit applic function equat theorem function appli argument satisfi precondit equat function result satisfi postcondit equat proof similar manner previou inlin transform verifi correct inlin chain result theorem equat execut inlin transform result nal state speci ed equat inlin templat figur inlin templat figur theorem theorem sati ed order speci inlin transform sati es postcondit equat proof combin postcondit equat theorem prove techniqu shown templat verifi correct templat point sati theorem sati veri cation process abort templat permit execut relat work basic schema evolut goal schema evolut research schema evolut mechan chang schema underli object conform modi ed schema rst taxonomi primit schema evolut oper de ned al de ned consist correct primit context system current commerci oodb gemston objectstor essenti handl similar set xed evolut base respect object model recent advent advanc applic led support complex schema evolut oper investig issu complex oper introduc compound type softwar type object instanc framework present exibl transform mean templat system provid form constraint speci cation manag invari formal veri cation mechan formal veri cation power mechan provid proof correct program larg bodi work make mechan call theorem prover work formal softwar semant prove theorem code algorithm work appli formal veri cation techniqu maintain consist schema evolut work consist manag support odbm support provid program languag term consist de nition assert except handl mechan languag java ada relat system er addit support form trigger support constraint sati ed end entir transact roll back activ system provid rule mechan detect occurr event respond action research eca rule implement consist manag semant consist manag fairli di erent reactiv control consist manag activ requir part comput constraint enforc failur satisfi constraint invalid activ failur complet activ eca necessarili invalid activ implement semant manual desir research consist manag softwar process languag al develop consist manag system speci cation consist condit inconsist toler user consist manag system accept fact inconsist happen rectifi problem fact approach problem attempt prevent problem occur mean veri cation mechan approach combin approach provid safeti net describ veri cation process extens schema evolut system transform program measur assur consist oodb system practic feasibl approach shown veri cation program front cost veri consist manag situat schema evolut program extrem execut prevent ectiv ecient mechan compar transact demonstr consist manag veri cation program schema transform program veri cation techniqu appli di erent type program util consist assur gener system refer andrew harri combin languag advanc develop environ read page vianu foundat publish gener constraint except handler intern workshop page pj km md tn pj introduct formal method page ns ge kaiser scale develop environ intern journal softwar engin knowledg engin page bancilhon kim transit sigmod volum decemb korth semant implement schema evolut page pe black axiomat semant veri cation secur web server phd young februari william gemston data manag system page acm advanc primit chang schema object confer advanc inform system page al object odmg morgan kaufmann kt ea rundenstein oql odmg implement schema evolut framework centr advanc studi page novemb kt ea rundenstein schema evolut flexibl framework int conf inform knowledg page novemb kt claypool ea rundenstein prevent worth pound formal veri cation consist evolut technic report worcest polytechn juli elmasri navath fundament system benjamin publish zicari implement lazi updat object system proc intl conf larg page gordon tf introduct theorem prove environ higher order wallac formal recoveri system system technic report technic report oodbm featur checklist rev decemb ge kaiser iz process evolut environ schafer bs model compound type encount schema evolut technic report comput scienc kb extens type rule commun meyer appli ieee maier stein develop implement system read page obrien make java object persist java object design objectstor user dml objectstor unix system object design decemb object white schema evolut februari jm shankar prototyp veri cation system lectur note arti cial page rs softwar approach mcgraw hill stein class modi cation gemston dbm page ea kt de gener facil demo session page sm lj languag softwar process program acm transact softwar clark consist manag complex applic intern confer softwar page object technolog user manual object technolog refer version novemb novemb sl dj dewitt algebra support complex object ident inherit page taxonomi schema evolut oper present templat primit speci ed tabl figur primit templat contract figur primit templat contract figur primit templat contract figur primit templat contract figur primit templat contract figur primit templat contract figur primit templat contract figur primit templat contract figur primit templat contract figur primit templat contract
Agents/240 1 specif heterogen agent architectur simon maurizio martelli mascardi zini disi universita di genova itali povo itali abstract softwar applic incorpor agent heterogen architectur order agent optim perform task simpl intellig agent system heterogen agent architectur specif base agent model abstract exist agent architectur paper describ featur present exampl outlin oper semant argu ad specif prototyp environ enhanc flexibl usabl introduct intellig agent system increasingli acknowledg model techniqu engin complex distribut softwar applic softwar develop concern realiz softwar applic model ma approach adopt develop agent applic implement final applic specif describ servic agent agent human describ event agent describ abstract agent intern provid agent procedur suppli servic respond stimuli environ prototyp final applic develop addit specif environ evolut due agent specif commun media agent proof specif specif properti formal inform test system behaviour mean work prototyp perform phase leav architectur agent implicit profit abstract intern organ structur singl agent applic develop burden model detail specif phase clearer modular servic agent complex gener involv manag heterogen inform kind behaviour account develop identifi agent applic incorpor agent heterogen architectur order agent optim perform task good approach provid applic develop predefin librari architectur architectur librari verifi test emploi process concern agent build softwar system includ main featur agent declar natur logic program make suitabl interact develop test macro agent applic logic program languag agent ma proper level abstract provid work prototyp semant formal verifi properti fundament safeti critic applic develop industri programm implement languag visual basic specif languag uml formal logic languag suitabl formal verif system properti make harder logic program group comput scienc depart genova work develop specif prototyp environ ma caselp applic specif environ base logic macro develop method agent tool languag support develop step methodolog formal abstract specif ma execut linear logic program languag hhf construct concurr hhf successfulli adopt specif languag level requir profound knowledg linear logic syntax semant languag difficult adopt initi idea design caselp creat environ accommod specif implement languag legaci softwar ma prototyp built rang techniqu integr common framework paper attempt bridg gap mention user habit tool rapid prototyp present system specif agent architectur configur ma closer widespread exist specif implement languag logic languag basic featur make suitabl agent architectur specif incorpor heterogen agent ma oper semant base concept defin abstract interpret languag anim specif caselp framework consid step defin languag make easier anim incorpor tradit specif languag caselp possibl formal verifi ma specif hhf featur obtain implement hhf formal map hhf construct studi make possibl valuabl import characterist present agent model agent model support abstract exist architectur facilit develop architectur specif model adopt develop agent integr specif caselp facilit hierarchi abstract level construct ma level abstract support modular flexibl system base concept abstract concret agent class agent instanc model heterogen agent servic architectur social abil abil agent interact surround environ consist perceiv event place environ perform action modifi explicit model environ primit agent modifi construct model messag exchang agent section expand concept outlin section describ comput model agent hierarchi abstract level section show main featur specif agent architectur ma agent architectur section outlin oper semant section compar approach conclud paper identifi futur research possibl agent model structur ma model ma agent simpl abstract encompass exist architectur agent model languag comput point program engin state includ data chang execut agent state bdi agent goal intent program inform chang execut agent program bdi agent determin plan engin control execut agent typic bdi engin perceiv identifi set plan manag perceiv event current select plan ad select plan intent select intent execut instruct select drop success goal engin program belong abstract engin program data program oper behaviour agent determin applic agent program agent state mean agent engin architectur agent compon compon engin oper content agent compon express architectur depend object languag engin interpret paper commit object languag specif languag heterogen ma ensur modular flexibl definit agent architectur introduc abstract level illustr fig abstract architectur abstract architectur defin compon architectur basic structur engin provid guidelin realiz present engin necessarili give implement detail concret architectur concret architectur defin start abstract compon assign type chosen languag engin implement agent class class defin instanti compon concret architectur program agent domain specif depend domain independ specif arch abstract concret concret arch arch agent class agent class instanc agent instanc agent fig abstract hierarchi agent instanc start exist initi architectur compon state identifi agent instanc definit abstract level abstract architectur defin data structur engin organ agent intern activ detail data structur implement intent select bdi architectur irrelev detail level abstract architectur give rise concret architectur level abstract make data structur architectur compon detail function agent concret concret architectur emploi agent work applic domain domain depend behaviour pattern defin agent program class level ma requir instanc agent class work start initi state captur hierarchi defin agent instanc level state compon fill intern agent abil perceiv surround environ interact agent system environ model collect fact repres physic environ featur relev applic domain agent directli perceiv modifi interact agent robot perform action turn engin consequ action temperatur pollut realist robot consequ directli modifi environ emploi task evalu relev consequ primit agent updat environ commun agent interact agent mean data structur sage retriev primit commun syntax exampl primit instruct statement primit instruct manag inform architectur deliv receiv perceiv event gener event modifi perform action basic instruct variabl declar procedur determinist choic loop concaten determinist choic concurr execut instruct oper agent intern compon put del stand express mode extract delet element depend compon type compon assum head tail valu instruct messag exchang block repres sender block recept execut agent program block agent send messag execut messag retriev instruct percept gener event ma environ put remov insert delet event environ reserv oper execut percept oper perform agent system agent execut action primit effect primit send messag content agent evalu consequ perform environ modifi mean put remov primit abstract architectur compon class plan agent belief goal intent procedur definit engin procedur engin decl select trigger select true perceiv plan plan upgrad intent exec drop endwhil fig bdi abstract architectur abstract architectur definit defin abstract declar engin engin procedur architectur intent plan definit abstract bdi architectur depict figur keyword class mean plan compon instanti definit agent data repres program agent keyword agent suggest belief goal compon intent compon inform repres agent state engin consist loop continu execut sequenc defin procedur call global variabl declar includ engin bodi bodi procedur partial abstract architectur mean implement detail defin procedur complet defin concret architectur left complet undefin perceiv defin upgrad intent partial depict figur procedur bodi declar local variabl begin procedur empti select select put intent defin abstract architectur level symbol procedur call mean argument pass refer upgrad intent decl empti select select put intent skip fig partial defin procedur concret architectur definit definit concret compon assign global variabl definit partial procedur complet illustr implement concret bdi bdi bdi obtain defin abstract bdi architectur bdi concret architectur bdi plan compon assign type belief compon type goal compon type set intent compon type queue extern event event gener environ messag agent system agent implement architectur reactiv social abil architectur bdi plan belief compon goal compon intent compon stack perceiv event gener environ architectur origin strongli reactiv agent abil receiv messag concret perceiv event collect global variabl event type queue implement bdi concret architectur depict figur bdi event perceiv environ mean procedur global variabl event updat insert perceiv event messag sender receiv parallel percept receiv messag put event queue bdi event place environ perceiv insert event queue definit agent class instanc concret architectur defin ma instanti class agent environ env eth initi final instanc agent creat due space constraint detail aspect languag type reason assign bdi compon chosen demonstr languag flexibl architectur compon plan belief goal intent queue init global var procedur perceiv decl event belief event fig definit concret architectur oper semant oper semant specif tree repres transit tupl ma configur full account semant found account ma configur form env agt env eth repres state ma environ state ma repres state agent env agt state environ env set pair fact string repres relev fact ma environ string repres current observ fact eth set tripl string term sender instanti sender receiv instanti agent string model broadcast commun messag deliv receiv agent state agent pair env cmp inform architectur compon content execut environ agent engin env coher mean assign execut due presenc agent execut environ ma environ env context clarifi mean term architectur compon plan belief goal intent stack init global var procedur perceiv decl event fig definit concret architectur ma class agent init comp comp init env event init eth creat agent init comp comp fig ma definit schema ronment imper languag env function associ valu variabl local execut environ procedur identifi relat ma defin transit ma configur action affect ma relat env agt defin environ agent configur form env agt action directli modifi ma agt defin agent configur set agent ma concept formal env agt env agt env agt eth env env agt ma eth env agt agt eth env agt ma eth env agt obtain substitut give overview languag semant describ govern execut agent execut similar defin semant put event remov event relat agt defin env cmp env cmp eth env cmp agt env cmp eth function return instruct agent execut relat defin agent configur depend agent perform instruct instruct give definit basic construct event percept exp env relat exp evalu express current execut environ agent function env return domain function env env obtain env function associ effect percept instruct modifi agent state creat associ variabl argument perceiv perceiv fact messag deliveri exp exp env cmp env cmp eth effect send insert tripl messag recept exp eth appli receiv messag agent string effect rec associ content receiv messag variabl argument rec remov read messag receiv messag remov agent system read rule block recept instruct differ block recept semant recept exist appli desir messag present case effect rec creat associ variabl argument rec string semant block recept undefin messag present forc agent block execut action execut act exp act eth env act semant exec instruct send messag action perform achiev modifi comparison section compar approach specif heterogen agent architectur hindrik treur de giacomo al van al compar respect capabl architectur compli model agent present section term program engin fisher present specif agent concurr specif languag base tempor logic architectur model encompass kind perform group behaviour set tempor logic rule futur state agent comput obtain start present state exampl present specif social behaviour composit type behaviour kind layer architectur approach highli suitabl repres agent program express tempor logic approach give explicit agent state engin implicitli maintain interpret concurr execut concurr metatem specif hindrik al follow approach focu specif agent engin object level languag give agent program assum agent comput express program languag base concept goal rule defin imper meta languag describ care receiv broadcast messag read messag remov recipi read engin cycl includ rule goal execut argu glass box approach defin agent engin make intern function engin visibl ma approach develop directli program control agent intern activ approach hindrik develop agent engin natur constrain agent state belief agent program rule agent architectur design term approach gener fit agent applic desir research studi composit ma complex task develop method system structur desir specif base notion composit architectur compon hierarch relat approach flexibl support definit heterogen architectur architectur compon agent state agent program kind compon syntact semant point view flow inform compon specif commun link engin govern execut flow insid agent compon desir framework provid explicit support defin agent architectur term program successfulli adopt develop librari heterogen architectur rang reactiv proactiv reflect bdi congolog specifi agent behaviour base action agent execut languag adopt situat languag order repres dynam domain congolog includ facil priorit execut concurr interrupt execut condit deal exogen action featur make adopt languag implement reactiv agent ascript mental attitud agent easili achiev adapt world model knowledg situat calculu commun capabl model framework congolog mean describ declar procedur knowledg agent capabl rang reactiv ration level engin program agent architectur defin program languag concept paradigm adapt gener light commun agent agent class tupl system describ languag oper agent class emploi repres process inform set question templat agent class repres interfac class denot program statement procedur declar creation agent class start execut statement constitut initi inform store agent class similar agent model resembl architectur correspond agent program agent state languag statement atom oper updat inform store nondeterminist choic parallel oper semant languag term transit rule similar architectur design suitabl compon agent program order agent state program encompass great varieti architectur provid high flexibl primit architectur design build engin argu approach solut softwar develop ma develop main characterist architectur expert burden implement detail architectur control give great deal freedom architectur obtain librari includ architectur data structur control flow ma develop find architectur fit librari realiz ma involv choic agent heterogen agent optim provid servic simpl heterogen agent term compon form agent state engin implement mechan control agent intern activ specif subsequ implement librari architectur ma develop ad specif prototyp environ enhanc flexibl usabl specif languag formal integr caselp anim caselp work prototyp specif languag develop agent implement program languag translat specif java program present investig acknowledg author contribut improv present anonym comment research carri zini universita di itali refer di sistemi logica linear master disi universita di italian zini system develop softwar engin proc intern workshop practic aspect declar languag number lectur note comput scienc dunin treur formal specif multiag case proc intern confer multi agent system san delzanno martelli proof comput linear logic theoret comput scienc fisher repres abstract agent architectur singh mueller intellig agent number lectur note artifici intellig de levesqu concurr program languag base situat calculu artifici girard linear logic theoret comput de van der meyer control structur agent languag singh mueller intellig agent number lectur note artifici intellig wooldridg roadmap agent research develop autonom agent di sistemi master disi universita di italian zini flexibl languag heterogen agent zini softwar prototyp nwana proc intern confer exhibit practic applic intellig agent technolog zini specif simul system caselp proc muller agent thing singh mueller intellig agent number lectur note artifici intellig rao georgeff bdi theori practic proc intern confer multi agent system san van de van der meyer concept commun castelfranchi intellig agent lectur note artifici intellig volum wooldridg softwar engin iee proc softwar
Agents/241 1 multiag learn variabl learn rate michael manuela veloso comput scienc carnegi mellon pa abstract learn act multiag environ difficult problem normal definit optim polici longer appli optim polici moment depend polici agent creat situat learn move target previou learn algorithm shortcom depend approach converg polici optim specif oppon converg articl examin learn problem framework stochast game number previou learn algorithm show fail criteria contribut reinforc learn techniqu variabl learn rate overcom shortcom introduc wolf learn vari learn rate examin techniqu prove converg restrict class iter matrix game present empir result varieti gener stochast situat demonstr wide applic method kei multiag reinforc game theori introduct research multiag system includ investig algorithm provid function select multipl agent coexist environ multiag system increasingli relev artifici softwar robot agent email preprint submit artifici intellig preval robot disast mitig autom inform agent exampl challeng multiag domain autom trend robust algorithm coordin multipl effect respond extern agent multiag domain requir determin action agent domain machin learn power tool find success action greatli simplifi task behavior agent learn agent discov exploit dynam environ adapt unforeseen difficulti task benefit learn studi extens problem stationari environ multiag learn import select action place presenc agent multiag domain agent forc interact agent independ convent interest approach agent learn adapt agent behavior assum agent abil adapt face difficult learn problem move target optim action chang agent adapt extern adapt agent violat basic stationari assumpt tradit techniqu behavior learn techniqu consid address multiag learn problem multiag learn strong connect game player select action maxim payoff presenc payoff maxim player effort contribut approach multiag learn successfulli demonstr algorithm learn polici specif assumpt overview algorithm provid parallel game theori multiag learn analysi previou algorithm lead introduc desir properti multiag learn ration converg note previou algorithm offer properti contribut learn variabl learn rate introduc concept provid specif principl adjust learn wolf stand learn successfulli develop appli wolf principl learn approach novelti wolf face challeng determin learn algorithm ration converg introduc properti multiag learn algorithm show ration properti contribut theoret proof converg wolf gradient ascent restrict class iter matrix game show empir result converg ration extend wolf algorithm compar perform varieti game situat learn algorithm articl organ section describ stochast game framework descript multiag learn problem examin previou techniqu crucial shortcom section describ variabl learn rate techniqu wolf principl analyz theoret restrict class prove overcom shortcom previou algorithm section describ practic algorithm extend techniqu gener class stochast game section show result demonstr applic effect algorithm introduc stochast game learn section give overview stochast game framework introduc desir properti multiag learn ration converg examin previou learn algorithm specif compar respect properti stochast game framework present formal definit stochast game examin relat model begin examin markov process multipl state framework examin matrix game singl state framework introduc stochast game merg mdp matrix game due background game theori term agent player interchang markov process markov process set set transit function reward function jr transit function defin probabl distribut state function current state agent action reward function defin reward receiv select action state solv mdp consist find map state action maxim discount futur reward discount factor mdp focu reinforc learn work crucial result form basi work exist stationari determinist polici optim polici target rl algorithm matrix game matrix game strateg game tupl number set action player joint action space ri player payoff function ir player select action set receiv payoff depend player action call matrix ri function written matric matrix game player find strategi maxim payoff pure strategi select action determinist mix strategi select action probabl distribut action strategi player denot ai probabl distribut set action player pure strategi distribut assign action probabl notat refer possibl strategi player exclud player matrix game shown tabl tabl show matric simpl game call match penni game player select head tail choic player dollar player player dollar player matric repres payoff player row column action head tail tabl show game game player select action winner determin paper beat beat rock beat dollar loser tabl show coordin game action player receiv payoff select player prefer action prefer unlik difficult defin mean matrix game strategi evalu player strategi illustr match penni game player plai player optim strategi match penni tabl coordin game matrix game game sum game plai player plai player ls optim strategi plai tail optim pure strategi independ oppon mix strategi optim exist set solut call definit function player set strategi optim plai joint strategi major advanc driven develop matrix game game theori notion equilibrium nash equilibrium definit nash equilibrium collect strategi player chang strategi player continu follow equilibrium strategi make notion equilibrium compel matrix game nash type matrix game matrix game usefulli classifi structur payoff function common class game pure collabor pure competit game pure collabor game team agent payoff action interest agent interest agent pure competit payoff function neg game tabl tabl exampl game pure competit game call game payoff function sum constant includ pure collabor call game tabl game appeal featur game uniqu nash equilibrium equilibrium found solut simpl linear program find equilibria game requir difficult quadrat program solut stochast game present stochast game combin mdp matrix game stochast game tupl number set set action player joint action space transit function ri reward function ith agent ir similar mdp framework multipl player select action state reward depend joint action player import notic player separ reward function interest determin action player environ learn possibl map state probabl distribut action goal find polici maxim player discount futur reward discount factor proven game fink exist equilibria solut stochast game matrix game stochast game natur extens mdp multipl agent extens matrix game multipl state state stochast game view matrix game payoff player joint action state determin plai matrix game receiv player transit state matrix determin joint action stochast game mdp matrix game subset framework connect mdp stochast game player stochast game plai possibl problem remain agent revert back mdp fix agent multipl equal payoff interchang equilibrium solut linear make transit depend remain player action type stochast game classif matrix game stochast game pure collabor team agent reward function pure competit game player reward neg matrix stochast game uniqu nash find equilibrium longer trivial present exist proof iter algorithm examin varieti techniqu properti section present properti desir multiag learn algorithm examin previou algorithm achiev properti properti formal idea learner learn learner converg defin properti formal properti converg stationari polici learn algorithm converg polici player polici fairli basic properti requir learner learn plai polici player plai stationari case polici exist observ player plai stationari stochast game simpli mdp properti requir algorithm find optim polici mdp properti learner necessarili converg ari polici properti condit agent algorithm class learn algorithm converg properti requir class player learn algorithm class encompass learner polici converg refer converg respect player stationari converg respect ration player focu converg case player learn player polici crucial difficult step converg gener class player ignor possibl make naiv assumpt player inferior ident algorithm relationship equilibria properti explicitli relat notion strong relationship player ration learn algorithm polici converg equilibrium ration player converg stationari converg ration true result polici equilibrium player plai equilibria fix point ration learn algorithm player learn algorithm ration converg player converg nash equilibrium converg properti previou equilibrium previou algorithm stochast game studi year number algorithm game algorithm game theori commun reinforc learn commun algorithm differ assumpt control exert rithm strike similar algorithm consist mdp solv mechan form tempor matrix game solv mechan linear tabl summar number algorithm game theori reinforc categor compon examin close specif algorithm reinforc learn commun addit present examin light properti present section algorithm commonli appli learn algorithm multiag system applic singl agent learn algorithm complet ignor agent examin specif multiag learn oppon model algorithm select repres learn includ tabl strict stochast game algorithm make attempt address agent matrix game solv compon matrix game solver mdp solver stochast game solver mg mdp stochast game solver game theori reinforc learn lp lp lp qp fp van der wal fictiti plai hu wellman program fictiti plai tempor differenc tabl summari algorithm solv stochast game algorithm matrix game solv compon mdp solv compon algorithm assum transit reward function algorithm receiv observ transit reward function techniqu section basic approach learn stochast game algorithm hu wellman extens game requir restrict assumpt order converg examin algorithm articl similar properti learn algorithm specif design find optim polici mdp spite origin intent wide multiag success theoret merit player plai stationari stochast game learn plai optim player ration plai stochast polici prevent converg reason converg nash equilibrium game equilibria mix equilibria match penni section possibl converg learn techniqu capabl initi set learn rate current state find matrix game select action ai distribut explor observ reward state tabl player oper comput matrix expect payoff player player plai nash equilibrium plai stochast polici techniqu address issu partial observ function approxim problem solv show learner capabl plai stochast converg section littman examin stochast game framework multiag reinforc learn extend tradit algorithm stochast game algorithm shown tabl notion function extend maintain joint backup oper comput state replac max oper comput expect payoff player player plai uniqu nash equilibrium interest note basic reinforc learn origin algorithm stochast game algorithm game theoret concept equilibria order estim state updat state transit state algorithm learn player part nash equilibrium strategi requir player execut action infinit complet explor state true initi state select action ai observ agent action reward state max ai tabl oppon model player agent converg part nash method learn equilibrium solut algorithm converg hand algorithm ration oppon plai plai paper small probabl find equilibrium solut random action paper situat oppon model final algorithm examin oppon model learner algorithm shown tabl idea learn explicit model assum plai ing stationari polici estim player select joint action base past plai player plai optim estim distribut veloso investig algorithm game clau boutili examin fulli collabor matrix game algorithm essenti fictiti plai reinforc learn context fictiti plai game theori algorithm proven find equilibria type game fictiti plai algorithm player select action iter receiv highest total payoff plai past fictiti plai proven converg nash equilibrium game iter domin solvabl game iter remov domin action action payoff lower strategi oppon leav singl action set action game player empir distribut action plai converg game nash actual strategi plai behavior oppon model algorithm result formal proof oppon model ration eventu player estim oppon polici converg true polici find polici estim eventu converg polici oppon true polici learn converg reason plai pure converg game mix equilibria discuss learner learner converg converg actual oppon ration ration converg properti encompass desir learn interest simultan achiev properti difficult rest articl techniqu ration converg learn algorithm idea variabl learn rate ration learn algorithm make converg section theoret analysi variabl learn rate restrict class iter matrix game section develop techniqu gener stochast game learner show empir result algorithm theoret analysi section begin examin gradient ascent techniqu learn simpl repeat matrix game theoret analysi observ algorithm fail converg follow introduc concept variabl learn prove gradient ascent converg gradient ascent mansour examin dynam gradient ascent iter matrix game repres problem player select action set determin reward payoff player row player select action column player select action row player receiv payoff column player receiv payoff strategi probabl distribut repres singl strategi row correspond probabl player select action probabl player select action strategi column player joint strategi point constrain unit squar pair strategi write expect payoff row column player receiv expect aa player effect chang strategi expect payoff comput partial deriv expect payoff respect gradient ascent algorithm player adjust strategi iter expect payoff mean player move strategi direct current gradient step strategi kth player gradient ascent strategi gradient move strategi valid probabl space unit gradient project back probabl space occur boundari probabl space question expect happen player gradient ascent updat strategi notic algorithm ration properti defin section fix player strategi player gradient eventu forc player converg optim pure strategi hand algorithm shown fact algorithm plai mix strategi singh gradient ascent examin ic learner case step size call algorithm gradient ascent observ algorithm appropri step size properti section briefli outlin analysi analysi main mansour theorem theorem player follow gradient ascent strategi converg hash equilibrium averag payoff time converg limit expect payoff hash equilibrium proof theorem proce examin dynam dynam system dynam defin differenti defin multipl matrix term valu classifi dynam system base properti dynam system invert qualit form dynam depend pure real pure imaginari eigenvalu result pure real pure imaginari eigenvalu qualit form case shown figur analysi examin case geometr import basic form unconstrain dynam dynam project gradient unit squar requir posit unit squar rel dynam shown figur crucial aspect analysi point constrain show correspond nash equilibria discuss lemma unconstrain exist point call center denot point found mathemat set equat notic center insid unit squar invert point gradient unconstrain invert real imaginari ue eigenvalu fig qualit form dynam dynam constrain gradient boundari unit squar project unit addit point gradient exist converg point gradient theorem excit result converg result ration multiag learn algorithm notion weak player polici converg plai gradient ascent expect payoff converg moment time expect payoff player arbitrarili poor make difficult evalu potenti disastr appli tempor differenc multipl state stochast assum expect payoff past predict expect payoff futur section examin method address converg problem prove method stronger notion player converg nash equilibrium variabl learn rate introduc concept studi impact variabl learn rate gradient ascent algorithm present step direct gradient constant vari chang updat rule idea averag payoff converg mean period arbitrarili low payoff period past futur arbitrarili high payoff kth iter algorithm step size direct gradient notic restrict requir strictli posit bound step size specif method vari learn rate contribut wolf learn principl essenc method learn quickli win intuit learner adapt quickli poorli expect cautiou player chang polici heart algorithm determin player win lose analysi section player select nash equilibrium compar expect payoff payoff receiv plai select equilibrium strategi equilibrium strategi select row equilibrium strategi select column player notic requir made player equilibrium strategi pair nash min win ma lose min win max lose variabl learn rate case step size call algorithm section show wolf adjust interest effect converg algorithm analysi prove result theorem iter player follow algorithm max gi converg nash equilibrium notic standard notion converg strictli stronger true basic proof theorem follow close proof theorem singh colleagu examin case dynam learner write differenti equat defin system step call multipl matrix entri depend learn rate time time qualit form dynam determin matrix summar gener pure real pure imaginari eigenvalu thing note case depend lemma stronger lemma invert defin section invert pure imaginari eigenvalu pure imaginari eigenvalu pure real eigenvalu pure real eigenvalu proof trivial uu exact condit invert pure eigenvalu lemma true satisfi case gener variabl learn rate section follow examin case separ proof case proce ident proof fact proof reli learn rate adjust final final case forc deviat argument due fact variabl learn rate gener chang direct gradient sign partial proof converg depend sign argument case present abbrevi proof converg illustr variabl learn rate affect argument recommend analysi examin includ diagram remain shown show case converg nash equilibrium make liber crucial lemma proof lemma impli algorithm converg strategi converg nash equilibrium lemma nash equilibrium proof proof show algorithm converg project gradient strategi pair nash equilibrium notic algorithm converg project gradient true project gradient point nash equilibrium examin individu case invert case dynam strategi pair qualit form shown figur lemma learn rate ment lead strategi pair converg point boundari nash equilibrium proof notic invert loss assum gradient column player constant column player converg gradient posit row player gradient constant converg depend sign gradient joint strategi converg lemma nash equilibrium real eigenvalu case dynam strategi pair qualit form shown figur lemma real learn rate ment lead strategi pair converg point hash equilibrium proof loss assum dynam show figur case center insid unit squar notic strategi pair quadrant gradient strategi pair region eventu converg corner unit squar strategi quadrant converg corner strategi pair quadrant gradient strategi eventu exit enter quadrant possibl hit center center gradient converg enter quadrant weve shown converg corner strategi converg lemma point nash equilibrium case center unit squar boundari unit squar shown converg similar discuss imaginari eigenvalu case dynam strategi pair qualit form shown figur case broken depend unit squar relat center center insid unit squar case argument lemma imaginari eigenvalu insid unit learn rate adjust lead strategi pair converg point boundari hash equilibrium proof case unit squar li singl quadrant case direct gradient constant quadrant strategi converg corner corner quadrant case unit squar neighbor quadrant case li quadrant gradient point strategi eventu hit boundari point quadrant gradient point downward case converg bottom corner similarli show converg pair quadrant final case center boundari unit squar case point boundari project gradient similar argument strategi converg boundari point diagram explan case strategi pair lemma converg nash equilibrium center insid unit squar final point dynam qualit differ show converg proof identifi area strategi space player show trajectori ellipt spiral center lemma section implicitli assum imaginari eigenvalu center insid unit squar begin lemma consid dynam fix learn rate lemma learn remain trajectori strategi pair ellipt orbit ax proof result dynam system theori mention imaginari eigenvalu critic lemma identifi area strategi space player constant learn rate notic correspond area player lemma player player strategi move center proof notic imaginari eigenvalu center unit game singl nash center player select equilibrium strategi wolf principl row player player current expect payoff larger expect payoff plai select equilibrium written write left hand side equat simplifi substitut center equilibrium notic posit factor sign true player greater smaller center player win strategi move center shown column player corollari learn rate constant combin lemma find trajectori ellipt orbit piec correspond quadrant defin center prove converg limit number start strategi pair lemma prove converg initi strategi pair lemma initi strategi strategi pair converg center mean ellipt trajectori point defin player learn rate li unit squar proof loss gener assum shown figur max initi strategi fix learn rate trajectori form fig trajectori learn rate imaginari eigenvalu center insid unit squar center ratio equal trajectori ellipt trajectori quadrant shown graphic figur trajectori travel quadrant lemma observ row player column player min ratio ax cross quadrant point quadrant row player column player ratio ax rl cross quadrant point continu return axi trajectori began strategi pair point orbit center distanc center factor trajectori converg center reason ident suffici close initi strategi ax lemma imaginari eigenvalu insid unit lead strategi pair converg hash equilibrium proof proof extens lemma largest player learn rate fit unit squar touch boundari unit squar boundari quadrant initi strategi pair strategi pair follow ellipt orbit move unit squar boundari eventu hit boundari quadrant point insid largest defin player learn rate appli lemma trajectori converg center initi strategi pair trajectori converg nash equilibrium lemma combin prove theorem summari wolf principl strengthen converg result player strategi expect payoff converg nash equilibrium strategi payoff matrix game contribut base algorithm provabl ration converg restrict class iter matrix game result gener corollari corollari iter player follow algorithm min strategi converg nash equilibrium rmi min max max versu converg hash equilibrium proof proof ident theorem deviat imaginari eigenvalu case center insid unit squar case proof lemma amend argument trajectori revolut center posit mx trajectori converg center remaind proof ident theorem return examin wolf section examin situat empir complex domain discuss final point made result present justif wolf principl learn relat problem present short discuss determin player knowledg algorithm requir requir relax practic algorithm section theoret result wolf principl unfound heurist studi form notabl adversari evolutionari game theori adjust dynam scale individu growth rate success popul popul composit chang quickli popul perform poorli form modif weight major algorithm expert make portion weight loss redistribut expert algorithm place larg weight mistaken expert algorithm larger portion weight redistribut algorithm adapt defin wolf principl adjust learn rate learn faster slowli win place great deal emphasi determin player win descript consid win player win prefer current strategi plai equilibrium strategi player current strategi choic determin player win payoff larger game equilibrium equilibrium multipl final tion mathemat correspond interest note game mix strategi equilibria rule ident necessarili case situat bring light differ method exist game point strategi space player receiv lower expect payoff equilibrium lower expect payoff equilibrium strategi player player poorli strategi plai player point gradient move strategi rule determin player move equilibrium discourag converg requir gradient ascent algorithm wolf gradient ascent make strict requir knowledg player basic gradient ascent requir player payoff matrix rr actual distribut action player plai requir payoff matrix game rr strategi nash equilibrium rule learn tion select player player distribut action wolf gradient ascent proce add requir nash equilibrium extra comput payoff make algorithm address algorithm determin win lose equilibrium payoff section algorithm remov knowledg constraint give empir result gener stochast matrix game practic algorithm present gener algorithm wolf principl vari learn rate begin describ simpl ration polici converg algorithm similar gradient requir knowledg describ vari learn rate approxim notion win section algorithm examin number empir exampl matrix game stochast game polici present simpl ration learn algorithm capabl plai mix strategi simpl extens shown tabl perform space mix polici maintain normal addit algorithm maintain current mix polici polici improv probabl select highest valu action learn rate notic algorithm step polici move greedi polici execut highest valu action probabl ration converg optim polici player plai stationari strategi proof proof valu converg suitabl explor polici converg polici algorithm articl assum explor polici suitabl learn rate state select action mix strategi suitabl explor observ reward state updat constrain legal probabl argmax tabl polici algorithm player greedi converg converg fact ration plai mix doesnt show converg show exampl converg failur section wolf polici introduc modif naiv polici algorithm encourag desir converg properti sacrif ration properti algorithm variabl learn learn principl requir polici shown tabl wolf principl aid converg give time player adapt player strategi player adapt quickli player strategi harm algorithm requir learn paramet paramet updat polici depend agent determin win lose determin compar onlin learn learn rate tabl tabl updat estim averag va updat constrain legal probabl argmax tabl wolf climb algorithm player current expect greater current expect averag polici current expect lower agent larger learn rate averag polici intend place unknown equilibrium polici averag greedi polici fact approxim drive mechan fictiti plai introduc learn determin win lose averag polici approxim equilibrium polici wolf polici speed learn alter converg section show exampl techniqu converg polici number varieti stochast game result show result appli polici wolf polici hillclimb number game domain includ matrix game show algorithm work demonstr empir theoret result section predict algorithm appli stochast game grid world domain hu wellman soccer game introduc littman examin final matrix game involv player briefli perform wolf experi set experi involv train player learn algorithm converg converg nash section matrix game experi stochast game result aggress case learn rate factor number time state exact proport vari domain learn rate set fine tune practic set learn rate decai ident set learn rate learn rate decai requir amount care set learn dont larger step learn rate updat valu result show polici correspond singl train run algorithm show prototyp trajectori time train run perform similar trajectori shown articl match penni algorithm appli matrix tabl nash equilibrium mix polici consist execut action equal probabl larg number trial small ratio learn rate order illustr algorithm learn converg figur show result appli polici wolf polici match penni game quickli begin oscil equilibrium amplitud wolf oscil anc converg obviou game result figur show trajectori player strategi polici space million step polici circl equilibrium polici hint wolf polici nice spiral equilibrium behavior ident theoret proven behavior iter fig result match penni matrix polici player probabl distribut learn player polici similar examin hu domain shown figur agent start corner reach goal squar opposit wall player compass action case determinist player attempt move move fail make game interest forc player initi start posit north action move player north probabl optim path agent move squar move move north player move action fail nash equilibria game involv player move move north player coordin action wolf polici successfulli converg equilibria figur show trajectori player strategi initi player player wolf polici fig result matrix trajectori er polici learn million iter state learn step player converg equilibrium player move east player move north initi state evid wolf polici case unmodifi learn equilibrium game multipl equilibria sl player fig game dash wall repres action uncertain result show trajectori player polici initi state learn soccer final domain compar larg soccer game introduc littman demonstr figur show initi state player possess ball goal player carri ball goal opposit side field action compass direct move player select action simultan execut random add action player attempt move squar occupi stationari player possess move fail unlik grid world nash equilibrium game requir mix polici fact minist polici learn learner defeat setup resembl littman comparison report result player train million step player polici fix challeng train player determin learn polici perform idea close wolf fig soccer game result show percentag game won specif train oppon million step train closer percentag closer learn polici equilibrium error bar shown rel order perform statist player equilibrium perform lose half game challeng unlik gener oscil target solut point time close equilibrium short time order account train continu step evalu step worst perform polici consid polici learn run figur show percentag game won player plai challeng repres train result repres wolf polici train repres polici repres wolf polici train train million perform polici averag fifti ing run standard deviat shown line bar rel order perform statist perform tabl match penni game player select head tail payoff player shown player select select select left tabl amount train continu improv train exact effect adjust larger smaller learn rate show success wolf simpli due chang learn chang learn rate time encourag converg match penni previou domain involv player examin wolf multipl player matrix match penni player head tail player receiv payoff action match player similarli player reward match player player reward select action player tabl show complet set payoff player game singl nash equilibrium player random equal action figur show result player domain result shown learn rate notic larg ratio wolf converg equilibrium lower ratio converg domain examin ratio learn rate import wolf due fact extra time player strategi chang propag extra player affect player interest strategi interest wolf converg sophist smooth fictiti fail converg game result directli compar due decai learn rate exponenti decai quickli note train proven converg equilibrium win half game versu challeng result show wolf move closer equilibrium train player player player nash player player player nash fig result match penni game line correspond player strategi time notic converg properti depend learn rate ratio result previou experi examin player algorithm corollari theoret evid wolf learn learner section present result examin empir matrix game experi examin wolf situat situat corollari examin learn unmodifi figur show trajectori player corollari predict proof gave intuit converg rate depend ratio learn rate player converg nash converg slower wolf learner figur analysi predict player player fig result versu polici trajectori player prototyp run million iter soccer littman soccer game figur complex game examin wolf converg domain oppon oppon unmodifi polici oppon oppon converg ration plai nash equilibrium setup section train perform million result polici frozen challeng train find polici worst case perform closer polici win half game closer polici equilibrium figur show result show percentag game won challeng measur distanc equilibrium polici result shown million step train train unmodifi import observ learn polici compar close equilibrium result shown train move polici closer equilibrium give evid converg lo fig soccer game result show percentag game won specif train oppon oppon million step train closer percentag closer learn polici equilibrium notic ad improv train includ comparison result prove converg situat result give evid variabl learn rate wolf principl encourag converg ration learn algorithm shown varieti domain effect converg wild learn agent learn algorithm multiag learn power techniqu build multiag system framework stochast game provid model learn problem difficulti attempt learn essenti move target previou techniqu adequ address plai necessarili converg contribut concept learn variabl learn rate shown overcom shortcom contribut wolf principl defin vari learn rate alter learn rate wolf ration algorithm made converg proven restrict class iter matrix modifi gradient ascent wolf learn rate modifi gener ration learner present wolf modif polici ration stochast game learn algorithm demonstr algorithm empir number stochast game refer dynam princeton ra dynam program markov mit lp reinforc journal artifici intellig research rs reinforc mit mj game mit game academ jf equilibrium point reprint game quadrat journal mathemat analysi cation ls stochast reprint equilibrium stochast journal scienc hiroshima seri stochast game finit state action cwi competit markov springer analysi stochast game theori reinforc technic report scienc carnegi mellon markov game framework ment eleventh intern confer machin morgan pp mp multiag reinforc theoret framework fifteenth intern confer machin morgan san pp iter method solv annal mathemat reprint adversari reinforc tech carnegi mellon unpublish reinforc learn oper multiag fifteenth nation confer artifici aaai menlo converg problem multiag ment seventeenth intern confer machin morgan stanford pp learn delai phd king uk reinforc independ cooper tenth intern confer machin pp learn coordin share reinforc learn algorithm partial observ markov advanc neural inform process system gradient descent gener reinforc advanc neural inform process system mit nash converg gradient dynam sixteenth confer uncertainti artifici morgan pp differenti foundat hill evolutionari game mit learn metric task system tenth annual confer comput learn converg machin learn learn dynam multiag phd electr engin comput ann mi theori learn mit ration converg learn stochast seventeenth intern joint confer artifici variabl learn rate converg gradient eighteenth intern confer machin william kuhn classic game princeton
HCI/242 4 smart plai card ubiquit comput game kai depart comput scienc eth zurich switzerland abstract recent technolog advanc turn part everydai environ smart environ paper present plai ubiquit comput game augment classic card game contrast develop game abil technolog present requir applic make support softwar infrastructur ubiquit comput ubiquit radio tag introduct recent technolog advanc turn part everydai environ smart augment physic environ function destroi usual main challeng ubiquit comput smart environ provid reason advantag peopl violat social legal rule societi life area game respect ubiquit due entertain natur social interact user explor innov hardwar appar fluid design hope contrast develop game abil opposit approach augment classic game technolog function user plai classic card game usual social interact equip small inform applianc size plai displai game relat inform hint plai explor applic ubiquit design implement smart plai card applic gave insight requir softwar infrastructur build ubiquit comput applic remaind paper present prototyp smart plai card requir applic make support softwar infrastructur smart plai section give overview smart plai card prototyp develop game detail present rule game motiv chose game classic game game bid player fix partnership standard card pack card dealt player card color game start player dealer lai card game continu player plai card trick follow suit card trick won highest highest card suit led winner trick lead trick team trick won win game chose prototyp implement reason rfid system detect card tabl reliabl detect limit number tag time card tabl time implement rich set featur inform score determin cheat hint beginn prototyp descript hardwar setup prototyp consist philip radio frequenc identif system connect desktop pc standard card card equip uniqu rfid tag form rfid system bridg physic virtual world tag hold uniqu identifi card attach rfid system consist mount underneath reader devic antenna connect reader devic power antenna order gener electromagnet field tag power electromagnet induct reader devic implement transceiv commun tag pc connect reader serial connect run rfid driver softwar earli pc run smart plai card applic displai user interfac pc replac small pc run rfid driver pda dedic inform fig smart plai card game situat applianc run smart plai card applic commun pc wireless short rang radio figur show screen shot smart plai card prototyp game situat prototyp implement java game start deal card tabl time player card deal round card deal applic displai color middl cross figur note smart plai card applic card player smart plai card applic player lai card figur player plai card automat displai user interfac player follow suit cheat alarm displai figur player correct mistak complet winner trick determin trick count upper corner user interfac figur winner trick wait plai card complet game count win team upper corner user interfac figur idea futur version prototyp provid plai hint beginn simplest version assess player move displai happi sad elabor version point game situat player make suggest interest augment plai card virtual counterpart point virtual counter part essenti virtual plai give card kind person seri game counter part rememb trick card involv assess trick plai card counterpart player dont join ac diamond charm club past experi support enabl player link person thing characterist card plai hint map relationship person peopl improv plai relationship peopl thing common human import area improv support player learn rememb rule game rule game simpl game huge set complic rule support applic action current game situat user experi due earli version prototyp conduct broad studi gain experi user demonstr prototyp technic peopl demonstr start plai game explain technic set reaction great obviou action displai technic link physic game plai spectat plai system rule quickli learn plai game exploit cheat turn teach player rule trial error fashion player forc system plai game unusu forc player card tabl deal round card section peopl similar problem delai section remov card tabl displai reflect player lot observ led peopl basic idea ubiquit comput special set make artifact smart visibl chang peopl expect find exact behavior artifact smart version subtl behavior artifact lot hand introduc function smart artifact long conflict classic behavior artifact lesson learn demonstr peopl creativ function system unforeseen wai cheat alarm intend player learn rule game note statement section perform real user survei wait elabor featur rule provid real advantag smart plai card classic game fig detect rang larg antenna arrai small antenna technic issu mention philip rfid system antenna size detect rang antenna sphere diamet length antenna depict left hand side figur reason area tabl card player care card hand detect rang prefer larg flat detect achiev arrai smaller antenna shown hand side figur experi show overlap field multipl reader problem tag locat overlap region detect reader advantag arrai antenna potenti abil detect tag time compar singl case tag equal distribut detect area antenna arrai easi solut hardwar point challeng softwar combin detect result multipl antenna discuss issu section problem place tag top rfid system longer detect tag experi prototyp system show care place card tabl solut problem place tag randomli card depict figur imposs place card tabl tag card tag infrastructur support implement game prototyp scratch softwar quickli clear develop complex task show applic develop support softwar infrastructur handl task section point task event base program adequ approach realiz smart plai card ubiquit comput applic base detect event physic environ plai card put tabl remov point fig singl tag randomli multipl tag plai card order support distribut applic smart plai card pda connect rfid reader wireless short rang radio infrastructur support ad hoc network distribut deliveri event event gener entiti rfid event consum entiti smart plai card applic run player leav tabl short time pda stop infrastructur provid support intermitt pda show happen return tabl natur handl presenc absenc plai card base program model gener entri exit event card rfid reader period scan tag return list id detect tag scan list convert entri exit event simpl task complic fact typic rfid reader detect present tag effect due enabl reader distinguish detect multipl tag time chang physic list detect tag constantli chang scan handl infrastructur provid mean composit event enabl programm remov leav event enter event card small amount avoid gener entri exit event complic introduct arrai antenna point section remov duplic detect card rfid composit event filter problem determin leav event gener reader happen enter event card gener reader solv infrastructur provid mean physic time synchron discuss time synchron suffici solv due event arriv tempor order case enter event receiv reader applic decid earlier leav event card gener case enter leav event delet avoid flicker wait long suffici due unbound delai result temporari disconnect pda solut support tempor deliveri order event infrastructur earlier enter deliv leav applic infrastructur support composit event detect order detect game complet round game card tabl task complic fact player chang mind back card put replac card card detect event distribut servic support ad hoc intermitt tempor deliveri order system composit event detect detect languag provid simpl accomplish task point section work infrastructur ubiquit comput applic support requir point develop composit event handl system capabl handl complex task discuss system cover public relat work document ubiquit comput game project technolog driven game design abil technolog exampl includ locat proxim game game system explor aspect wearabl comput augment realiti game driven approach augment transform exist game abil approach smart plai card genr ping tabl equip ball locat overhead project system focu put distribut comput softwar infrastructur develop ubiquit comput ubiquit comput game present interest challeng infrastructur point section warp system infrastructur develop network focu distribut comput issu aim provid infrastructur wearabl address requir point section outlook present ubiquit comput game plai augment classic card game smart environ provid function score winner cheat plai hint retain feel social interact classic game discuss technic issu relat detect card rfid point requir support softwar infrastructur research focu function smart game environ studi approach gener card game classic game major topic research develop softwar infrastructur ubiquit comput game ubiquit comput applic gener acknowledg point suitabl game smart plai philip figur implement prototyp system refer game philip system ljungstrand physic world game board ifip confer interact juli wolf achiev scalabl express event notif servic nineteenth annual acm symposium principl distribut juli design interfac cooper plai acm confer human factor comput system vogt step infrastructur smart thing ubiquit comput octob distribut softwar architectur wearabl comput intern symposium wearabl comput june sloman gem event monitor languag distribut system distribut system engin februari time synchron ad hoc network acm symposium mobil ad hoc network comput long octob pair creat compel collabor augment realiti game intellig user interfac januari segal support transpar inform deliveri mobil comput ieee intern symposium cluster comput grid harrison physic virtual world electron tag acm confer human factor comput system weiser comput centuri scientif page septemb
DB/243 3 queri optim semistructur data path constraint determinist data model peter buneman pennsylvania fan scott weinstein pennsylvania abstract path constraint studi semistructur data model root direct graph proven optim path queri graph implic problem natur path constraint undecid variant graph call determinist data model recent data repres graph determinist edg edg eman node graph distinct label determinist graph model web site paper investig path constraint determinist data model demonstr applic path constraint queri optim class path constraint languag introduc extens denot includ wildcard path gener denot repres path regular express implic problem constraint languag studi context determinist data model show contrast undecid result implic finit implic problem decid finit implic problem decid implic problem undecid introduct semistructur data model root direct graph refer graph model semistructur data model data found graph edg eman node graph distinct label model web page node stand html document edg repres link html label document work partli support armi research offic nsf grant support part support nsf grant reason assum html label uniqu identifi target document liter achiev includ url resourc target document edg label yield determinist graph manag system popular biologist graph repres determinist data ident model determinist graph includ ident edg label export ident directli observ ident kei relat manag system support export ident oem model export object ident captur data model semistructur data variant sm refer determinist data model dm data repres direct graph import featur dm compon uniqu identifi path number queri languag develop semistructur data studi semistructur data gener design queri languag xml markup languag document queri term navig path optim path structur inform data path constraint path constraint capabl express natur integr constraint fundament part semant depend relationship tradit structur semant inform schema unlik structur semistructur data path constraint convei semant data approach queri semistructur data path constraint studi ad structur type system xml data advoc integr constraint express path constraint path constraint queri import reason emp manag manag dept emp dept emp figur semistructur dm settl question constraint constraint follow constraint necessarili satisfi context finit instanc constraint implic refer finit implic tradit logic infinit finit instanc constraint implic call unrestrict implic simpli implic graph model sm shown implic problem natur integr constraint undecid implic problem simpl constraint languag studi finit implic problem complet studi connect semistructur sm constraint result show connect simpl investig path constraint determinist data model dm demonstr applic path constraint semant specif queri studi implic problem path constraint show contrast undecid result implic finit implic problem decid finit context dm finit set infer rule sound complet implic finit implic algorithm test constraint implic time length constraint demonstr determin condit dm simplifi analysi path constraint implic introduc investig gener denot defin includ wildcard path express denot repres path regular express show context dm implic finit implic problem decid implic finit implic problem undecid context dm undecid result show determin condit dm reduc analysi path constraint implic trivial problem rest paper organ section illustr path constraint queri optim section review definit constraint introduc extens section studi implic finit implic problem determinist data model section identifi open problem direct work algorithm test implic finit implic constraint appendix demonstr applic path figur collect inform depart semistructur data repres determinist data model figur edg eman root node label emp dept connect node emp edg eman emp label id connect vertic repres node edg eman edg label manag connect edg label connect node outgo edg connect edg label vertic repres depart edg connect observ figur determinist path constraint typic path constraint figur emp emp constant denot root variabl rang match edg label path graph sequenc edg express logic formula hold graph ff sequenc edg label vertex emp manag express logic hold figur path formula natur gener includ wildcard path constraint describ relat oe state node reach root emp reachabl emp assert manag occur oe state node reach emp reachabl emp constraint oe state connect manag reachabl constraint path constraint languag studi paper gener repres path regular express gener denot constraint manag manag manag kleen star constraint describ relationship manag manag assert reachabl manag reachabl path assert reachabl reachabl manag edg subclass investig graph model sm semistructur data path constraint wildcard kleen star determinist data constraint express path equal emp manag emp dept emp emp observ path constraint wildcard kleen closur semant specif path constraint path constraint describ type inform data objectori oe assert manag oe shown reachabl manag preliminari type system determinist data type path defin mean path constraint step unifi notion type notion schema queri optim path constraint illustr path constraint queri repres figur find id depart write queri lorel syntax select path constraint queri rewritten select easili verifi find connect smith manag edg path write queri lorel select denot wildcard mean occurr manag constraint oe oe rewrit find select verifi path effici requir sequenc manag edg mention show verifi constraint necessarili hold oe oe hold impli oe oe show impli oe oe manag emp relat work gener determinist data edg label number oper obtain manipul structur annot structur data track process piec data simplifi discuss gener model path constraint studi constraint form regular express repres path constraint investig graph model sm semistructur data decid implic problem form constraint establish context sm path constraint introduc studi sm shown simpl syntax implic finit implic problem undecid context sm detail proof undecid result found interact constraint type system investig paper consid determinist data model path constraint languag studi paper applic integr constraint queri optim studi develop equat theori queri rewrit form constraint connect semistructur sm constraint studi constrain class type sm gener free type constraint type express path constraint vice versa shown constraint implic problem decid ptime context sm undecid type system ad constraint implic problem undecid context sm decid ptime type system natur analog work path constraint depend theori develop relat path constraint set view gener depend depend proven semant specif queri optim relat path constraint import varieti rang semistructur data mention path constraint consid paper express class depend studi relat includ depend present depend theori result establish path constraint implic paper find applic field view vertic graph state label edg determinist graph consid fact kripk model studi determinist proposit dynam logic power languag reason program determinist graph view featur structur studi featur logic mention featur logic modal path constraint express descript logic reason concept express assert similar path constraint work constraint semistructur data mean descript logic express descript logic context reg qualifi existenti qualifi number construct form regular express role role transit closur role ident reg correspond proposit dynam logic grade modal remark path constraint express reg determinist graph path constraint give abstract semistructur dm term present path constraint determinist data model graph model sm repres root direct graph abstract sm logic structur relat signatur oe constant denot root finit set binari relat symbol denot edg label determinist data model dm repres root direct graph determinist edg relat edg label node exist edg label line abstract sm repres dm satisfi determin structur call determinist structur determinist structur jgj set node root set binari relat relat symbol path constraint languag review definit constraint introduc present notion path path sequenc edg label path defin ae ffl ae ffl empti denot path concaten path defin simplest form path express present gener form path express shortli section path ae prefix exist ae fl exampl path section emp manag dept emp path express logic formula free variabl denot tail head node path write ae paramet clear context treat path logic borrow standard notion model logic determinist path formula node jgj denot hold path ae length path defin ae ffl ae ae emp straightforward induct length verifi determinist graph properti lemma determinist structur path ae node node lemma show dm compon uniqu identifi path path constraint introduc defin term path formula definit path constraint express forward form backward form fl path formula path ff call prefix denot path fi fl denot section constraint forward constraint assert vertex reach root path ff vertex reach path reachabl path fl backward constraint state reach ff reach reachabl fl proper subclass introduc studi definit word constraint express form fi fl path formula word constraint forward constraint prefix empti path ffl shown constraint express word constraint gener constraint describ implic finit implic constraint context determinist data model assum standard notion model logic determinist structur constraint denot satisfi model finit set constraint denot satisfi model oe oe fg finit subset denot impli context dm determinist structur denot finit impli finit determinist structur context dm implic problem problem finit subset fg finit implic problem problem determin context graph model sm structur consid implic problem necessarili determinist shown sm implic finit implic problem undecid theorem context sm implic problem finit implic problem complet show undecid result longer hold context dm path constraint languag gener syntax path express includ union oper ffl defin path express regular express kleen closur refer express regular express regular express ae path ae denot ae regular languag gener treat regular express logic formula free variabl determinist structur satisfi denot exist path ae node jgj note regular express ffl regular languag gener regular express finit ffl recal wildcard symbol match edg label express regular express finit set binari relat symbol signatur kn defin regular kn section path express repres regular emp manag emp regular defin definit constraint oe express forward backward regular denot path constraint oe oe oe section determinist structur satisfi constraint oe denot condit ffl oe forward exist path ff fi exist path fl ffl oe backward exist path ff fi exist fl implic finit implic problem formal section properli corollari immedi theorem corollari context sm implic finit implic problem undecid show undecid result break context dm path constraint languag gener syntax path express includ kleen closur ffl defin path express gener regular express recal wildcard symbol express regular express section path express repres regular manag manag emp manag regular express ae path section ae denot ae regular languag gener treat logic formula defin notion determinist structur regular defin definit constraint express forward backward regular denot section section determinist structur constraint defin notion formal implic finit implic problem oe oe question instanc implic problem section implic proof queri proper subset corollari corollari context sm implic finit implic problem undecid show undecid result hold context dm path constraint implic studi implic problem determinist data model dm show theorem context dm implic finit implic problem finit decid proposit context dm implic finit implic problem decid theorem context dm implic finit implic problem undecid contrast theorem corollari theorem proposit show context dm implic problem decid demonstr determin condit dm simplifi reason path constraint theorem show determin condit trivial problem path constraint implic decid prove theorem step present finit axiomat constraint implic context dm give finit set infer rule sound complet implic finit implic constraint show context dm algorithm test implic finit implic constraint finit axiomat desir develop finit set infer rule path constraint infer rule gener symbol proof studi essenti properti constraint exist finit set infer rule stronger properti exist algorithm test implic present finit axiomat studi basic properti constraint context dm lemma hold context sm dm lemma hold context dm sm proof requir lemma omit proof lemma due lack encourag reader consult lemma forward constraint word ff determinist structur iff word constraint definit lemma backward constraint word ff fi determinist structur iff lemma finit subset fg iff iff definit base lemma extend includ constraint existenti form ae constraint existenti form enabl assert exist path point abil import web link characterist set infer note infer rule sound dm lemma ffl ffl ffl fi ffl ffl ffl ffl ffl ff ffl ff ffl ff fi ffl ff fi fg finit subset ic denot provabl theorem show context dm finit axiomat theorem context dm finit subset fg iff ic iff ic proof lemma show ic sound verifi induct length proof suffic show finit determinist structur ic claim case ic space limit includ lengthi definit interest reader consult corollari theorem context dm implic finit implic problem coincid decid shown finit axiomat proof similar theorem theorem context dm finit subset fg iff ic iff ic existenti iff ic iff ic context sm shown rule transit sound complet word constraint implic context dm rule longer complet illustr ff path word oe lemma verifi oe implic deriv rule context dm rule sound complet word constraint implic iw set consist rule show proof similar theorem theorem context dm finit set fg word iff iw iff iw algorithm base theorem show proposit exist algorithm finit subset path comput finit determinist structur time length ff fi structur node jgj path iff ic iff ic algorithm properti proposit appendix algorithm construct structur step construct correspond applic infer rule algorithm low complex lemma constraint algorithm includ proof proposit due lack space interest reader detail proof theorem algorithm test implic finit implic constraint context dm decid prove proposit establish decid implic finit implic problem suffic give finit model argument suffic show claim fg finit subset oe determinist structur finit determinist structur oe claim implic finit implic problem coincid decid show assum determinist structur satisfi oe recal constraint form ffl forward form ffl backward regular definit forward backward ae mean path regular languag gener regular express ae stand path ae prefix path oe set edg label path defin ffl jh fa ae ffl ffl jh iff oe easi verifi oe properti lemma size jh cardin finit regular languag gener regular express finit prove claim note oe determin oe undecid prove theorem establish undecid implic finit implic problem reduct word problem monoid give review word problem monoid word problem monoid finit alphabet free monoid gener equat pair string fi ff fi test equat denot monoid homomorph word problem monoid problem result theorem word problem monoid word problem finit monoid undecid reduct word problem present encod word problem monoid term implic problem context dm finit alphabet finit set equat loss assum set binari relat symbol signatur oe section assum fk fi ff fi note symbol binari relat symbol ff repres denot ff denot concaten oper path string regular express defin encod term subset includ fi ff test ff fi arbitrari string encod test equat note encod forward constraint simpli path complex regular definit lemma show encod reduct word problem monoid lemma theorem theorem immedi lemma context dm iff iff proof give proof sketch proof similar simpler ow space omit detail lengthi encourag interest reader consult exist finit monoid homomorph show exist finit determinist structur defin relat ae iff string ae ae class ae respect distinct node defin structur jgj ae root binari relat popul iff ae verifi finit determinist structur properti proof ffl empti path ffl languag gener regular express finit determinist structur defin finit monoid homomorph defin relat ae iff ae denot class ae respect defin ae oper ffi ffi ident id ae verifi finit properti ae ae languag gener regular express ae languag gener investig path constraint determinist data model dm path constraint languag studi graph model sm semistructur data literatur demonstr constraint languag queri optim studi implic problem constraint languag context dm shown contrast undecid result establish sm implic finit implic problem decid context dm implic problem decid finit result show determin condit dm simplifi analysi path constraint implic shown implic finit implic problem remain undecid context dm show determin condit trivial problem path constraint implic number import question open gener determinist data model semistructur edg label structur type system path constraint natur question decid undecid result establish hold question intrigu type consid shown ad type data case simplifi reason path case make harder defin richer data model semistructur replac set edg label set logic possess decid satisfi problem question decid result paper path constraint reason data path constraint reason path kind automat tool develop achiev acknowledg victor vianu comment discuss refer abiteboul proc intl conf theori vianu foundat lorel queri languag semistructur digit librari abiteboul vianu path queri proc acm symp principl system beeri vardi system tupl equal gener siam malhotra content descript note markup languag recommend buneman tutori proc acm symp principl system suciu queri languag optim techniqu unstructur proc acm sigmod intl conf manag tan determinist model proc workshop queri process semistructur data data format weinstein constraint semistructur structur proc acm symp principl system weinstein path type proc acm symp principl system weinstein constraint semistructur comput system sci weinstein constraint determinist technic report depart comput inform de lenzerini knowledg semistructur proc nation conf artifici intellig de nardi express descript logic robinson handbook autom reason suciu queri languag note mathemat introduct logic academ note harel gabbai handbook philosoph logic extens classic logic reidel publ lassila swick descript framework model syntax specif work draft de rose note maler de rose link languag work draft milo world wide digit librari tannen equat chase proc intl conf theori round van benthem ter handbook logic languag durbin definit data base technic report mrc laboratori molecular vardi wolper techniqu modal logic comput system sci appendix algorithm test implic finit implic constraint shown tabl procedur merg algorithm tabl algorithm finit subset path fi structur proposit oe set edg label ff fi path constraint rule oe ffl jgj ae ff distinct ffl ffl oe popul iff ae repeat ae jgj ae ae rule rule jgj ae add jgj distinct node add oe edg label jgj ae ae jgj ae ae rule rule jgj add jgj distinct node add oe edg label jgj ae output tabl algorithm test constraint implic dm procedur oe jgj delet oe edg label add oe edg label oe jgj delet oe edg label add oe edg label jgj jgj jgj tabl procedur merg
ML/244 6 compar evolutionari program evolutionari pattern search drug dock applic william hart sandia nation laboratori appli mathemat depart po box ms nm abstract evolutionari program evolutionari pattern search algorithm gener class evolutionari method optim continu domain rel perform method evalu standard global optim test result suggest robustli converg solut ep paper evalu rel perform ep flexibl bind dock softwar compar perform method suit dock test problem result confirm ep compar suggest robust complex problem introduct evolutionari program evolutionari pattern search algorithm class evolutionari algorithm specif develop solv problem form min class ea includ mechan control step length mutat oper ep emploi mechan dynam adapt step length search indirect feedback evolutionari search guid select step length emploi explicit control mechan step length paramet statist prior success previou mutat step point popul distinguish converg theori weakli converg stationari point probabl converg theori ea ensur converg nonconvex function strong evid step length control robust termin rule develop robustli termin stationari point recent evalu rel perform ep test suit standard global optim problem result confirm ep perform global search initi search domain suggest frequent converg solut ep run point termin search paper rel perform ep molecular dock comput method molecular dock valuabl tool drug discoveri physic detail model fix receptor site flexibl dock receptor emploi rapid method energi evalu interact energi tabl conform search successfulli appli varieti applic simul anneal search method evolutionari algorithm incorpor appli standard test problem ea consist perform simul anneal molecular dock problem solv challeng global optim ea perform global search rang orient conform paramet flexibl form ea genet algorithm hybrid ea local search hybrid ea appli local search iter refin point al morri al show local refin significantli improv perform ea genet algorithm studi adapt modifi mutat oper step length ea adapt step length gener outperform ea result provid complet justif ea hybrid paper appli standard formul ep formul recommend hart hunter standard test case result confirm ep compar suggest robust complex problem result highlight ep abil dynam rescal search direct import search capabl miss formul compar result perform hybrid ea hart al note hybrid ea perform applic dock small flexibl substrat molecul larg rigid macromolecul protein candid dock specif posit orient protein small molecul approxim physic model comput energi candid heurist search minim energi method make singl dock configur lower energi expect configur consist result physic interact molecul predict configur energi function global minimum physic configur heurist search oper configur small assum loss fix posit protein small molecul posit orient global orient express thought vector give axi angl rotat axi small molecul intern rotat bond shape flexibl candid dock consist coordin give posit small compon quaternion orient small angl rotat bond dock potenti empir free energi potenti energi potenti term morri al potenti account forc weak van der attract forc standard potenti van der potenti bond term measur unfavor entropi bind due restrict conform measur proport number sp bond term measur adapt al work grid formul account intern energi flexibl small molecul intern rotat calcul energi contribut sum pair atom small molecul sum ad total energi evalu penal conform small molecul energet unfavor independ interact macromolecul save time comput energi interact potenti grid comput atom type optim begin interact energi comput point grid calcul total energi energi contribut atom obtain interpol posit grid specif atom base valu nearest point grid calcul energi due interact small molecul make grid comput grid energi evalu requir knowledg posit atom posit obtain requir structur small locat intern rotat bond small molecul tend chemic determin structur freedom repres rotat chemic composit partial charg requir calcul interact partial charg comput structur molecular model softwar test candid small molecul singl target obtain structur protein make import comput tool initi stage drug design background evolutionari program evolutionari program standard paradigm appli evolutionari method continu optim problem ep similar evolutionari strategi respect ea gener reli recombin perform global search search domain mutat typic perform ad distribut random variabl dimens standard deviat normal deviat modifi mechan mechan view separ encod mutat standard deviat search paramet figur show canon ep distribut variabl standard deviat vector distribut random variabl standard deviat oe function select select individu previou popul creat perform addit function form popul newli gener point previou popul code updat oe fogel nelson confirm gener prefer addit updat ep updat constant stop rule ep typic reli measur rate improv popul statist evalu popul converg singl point evolutionari pattern search algorithm figur show class simpl share common featur standard ea ep es analysi defin requir converg shown continu differenti function sequenc solut fx properti lim inf gradient converg stationari point local experi direct search method suggest successfulli appli wide rang global optim problem previou empir evalu perform optim search domain provid converg mild condit select function ensur point popul nonzero chanc select gener point newli gener point current popul includ subsequ popul crossov function restrict gener point fx fx yn consist standard crossov oper call uniformli gener integ step control greater equal differ ea ep figur step length paramet control explicitli singl step length ep separ step length paramet dimens step length paramet expand improv step gener mutat step current point step length contract mutat step current point fit current point converg theori requir set mutat offset form posit basi search domain posit span set vector fa cone fa set fa posit independ posit combin posit basi posit initi step length vector foe oe select initi popul fx arg repeat oe oe oe arg stop criterion satisfi figur canon ep es independ set posit span posit basi vector vector figur illustr set mutat offset figur depict coordin mutat offset set offset coord fe mutat step parallel coordin ax coord mutat form maxim posit basi figur depict set mutat offset form minim posit basi mutat offset defin vector centroid regular simplex corner set mutat offset consist ax separ angl regular simplex triangl dimens regular simplex mutat offset deriv method defin comparison method recommend preliminari experi standard global optim test problem regular simplex mutat offset step length crossov crossov oper appli popul ep popul size mutat oper appli ea linear rank select standard competit select mechan ep dock problem rang normal search rescal figur illustr set mutat coordin mutat offset regular simplex mutat offset dimens rang initi step length set setup ep step length paramet correspond step length select initi vector oe expect distanc mutat approxim equal set oe hart hunter termin mutat step length fell threshold stochast natur step length updat fs form posit basi select initi popul fx arg repeat arg st exp factor lb figur simpl multinomi mutat simpli bound oe valu step length make comparison ep fair ep shrink step length step length ep termin million function evalu enabl comparison previou work experi test suit dock problem experi test case consist macromolecul small substrat molecul salient featur test case summar tabl test case select test aspect energi function trial random seed number angl import featur test case determin search space experi consist tripl cartesian angl search space rang coordin defin cube long dimens paramet lie angl li point initi popul paramet gener randomli rang paramet bound creat initi popul evolutionari search constrain region quadrat penalti term penal atom lie coordin search domain renorm paramet form unit angular coordin renorm lie result figur show rel rank final dock energi ep number number complex shorthand dimens acid tabl summari test problem conveni method summar data provid visual indic spread skew data dark bar show rang quarter data quarter data quartil white line insid dark bar repres median whisker top bottom spread data time rang quartil test trial hybrid ea show distribut rank test case present final result million function evalu consid perform ep median number function evalu requir result substanti final ep suggest ep converg final solut quickli crossov gener consist previou result median number function evalu tabl crossov found long termin crossov rate tabl median number function evalu crossov rate ep strict advantag perform distinct perform test case test case ep test case differ smallest angl realiz plausibl explan rel perform ep rescal search coordin posit problem sensit coordin posit problem angl paramet refin reduc energet penalti poor choic coordin posit evalu cluster inform experi solut cluster rang coordin posit solut experi forc ep coordin posit lie rang roughli correspond fix coordin posit global rang valu ep virtual ident perform constrain experi case method found solut result support suggest limit inabl rescal search search direct discuss result provid valid util applic ep experi compar perform comparison ep recommend robust ep ep ep ep ep ep rank final solut figur rel rank final dock potenti complex problem evalu gradient final point termin dock potenti differenti care analysi evalu point found local optim experi account initi step length ep remain number import factor evalu ep mechan select individu gener point differ substanti impact perform complet comparison scope work compar perform evolutionari strategi rule adapt global step length paramet rule similar adapt mechan compar method provid insight converg properti ess tabl compar perform ep hybrid ea hart al clear hybrid ea find result ea case confirm local search hybrid ea critic part simpli local search perform local step length adapt acknowledg art david chri belew discuss drug dock keith hunter discuss kumar ep code work work perform sandia nation laboratori sandia multiprogram laboratori oper sandia martin unit state depart energi contract refer fogel evolutionari comput ieee goldberg genet algorithm machin learn addisonweslei publish olson olson autom dock substrat simul anneal function hybrid ea ep minimum minimum minimum minimum tabl final energi ep hybrid ea report hart al hart gener stationari point converg theori evolutionari algorithm proc intl conf genet algorithm page san morgan kaufmann hart stationari point converg theori evolutionari algorithm belew foundat genet algorithm page san morgan kaufmann hart applic evolutionari pattern search algorithm proc evolutionari program page springer hart converg analysi unconstrain bound constrain evolutionari pattern search algorithm hart hunter perform analysi evolutionari pattern search gener mutat step proc conf evolutionari morri improv evolutionari hybrid flexibl dock proc intl conf optim comput chemistri molecular martinez direct search method molecular conform problem journal comput olson autom dock genet algorithm empir bind free energi function comp olson distribut autom dock flexibl parallel applic belew comparison global local search method drug dock proc intl conf genet algorithm page san morgan kaufmann nelson comparison method evolutionari algorithm schwefel evolut optimum seek john wilei sequenti applic simplex design evolutionari oper nov sander
ML/245 6 transact vol june make popul inform evolutionari artifici neural network xin senior yong student ieee paper concern simultan evolut artifici neural network architectur weight current practic evolv ann gener final result paper approach form final result combin individu gener order make inform popul approach popul ensembl combin method integr work integr ann modul evolutionari learn make popul inform linear combin method investig paper illustr idea data set show algorithm produc integr system outperform individu result confirm popul inform singl individu evolutionari learn exploit inform improv gener learn system index evolutionari artifici neural evolutionari modul learn introduct evolutionari artifici neural network refer special class artifici neural network evolut fundament form adapt addit learn evolut introduc level evolv learn paramet rule studi wide recent year provid automat method design approach studi evolut learn framework paper concern evolut architectur weight evolutionari algorithm evolv architectur weight studi evolv effect effici issu gener final result evolutionari process overlook final result individu gener gener attempt made exploit popul inform practic treat evolutionari learn evolutionari manuscript receiv februari work support part australian research council small grant scheme author comput intellig school comput south australian defenc forc act australia publish item identifi ieee practic argu paper differ learn optim exploit evolutionari comput learn optim paper show popul inform singl individu popul inform improv gener learn system paper linearli combin individu gener form final integr system idea combin modul studi ann field statist attempt made evolutionari learn popul inform form final system carri studi problem demonstr effect approach automat ann design tool base evolutionari program evolv popul perform individu evolv compar integr system linearli combin individu gener integr linear combin weight found algorithm pp outperform individu term gener problem test reason linear combin paper simplic find combin show import popul inform advantag combin improv result expect nonlinear combin method rest paper organ section ii discuss differ evolutionari learn optim opportun exploit differ learn section iii describ evolutionari ann design individu gener final output result real world problem present section section iv combin method studi find combin demonstr effect approach simpl method section conclud summari paper futur research direct ii evolutionari learn optim learn formul optim problem machin learn field backpropag train feedforward train ieee transact vol june process call learn process bp wide learn algorithm bp essenc optim algorithm minim error function squar learn problem typic optim problem numer analysi improv ann learn algorithm improv optim algorithm conjug gradient method learn optim learn system minim error function ann minimum error necessarili gener gener error function measur gener accur imposs practic theori criteria minimum descript length inform criteria minimum messag length criteria defin error function hope minim function maxim gener error function lead gener learn error function bp advanc learn algorithm optim algorithm optim error function natur problem unchang similar situat occur machin learn function defin algorithm minim function error function correspond true gener problem face induct learn method practic good empir function correspond true gener formul learn optim situat justifi evolutionari learn learn method peopl evolutionari algorithm maxim fit function minim error face problem maxim fit function maxim gener evolutionari algorithm optim learn algorithm tradit opportun improv evolutionari learn maximum fit gener evolutionari individu maximum fit popul individu popul inform improv gener learn system benefici make popul singl individu popul inform singl individu combin individu gener form integr system expect produc result paper confirm true conduct set comput studi iii evolutionari design system automat system base evolutionari program design feedforward main structur system shown fig recombin oper simul evolut order avoid permut compet problem reli mutat select scheme evolv architectur connect weight simultan order reduc fit evalu previou studi evolut ann architectur separ evolut connect weight approach introduc fit evalu aim evalu ann architectur ann train weight eventu evalu fit architectur affect random initi weight train train algorithm map genotyp phenotyp common method reduc evalu phenotyp fit fit method gener replac strategi gener similar ga continu ep individu replac offspr gener advantag replac demonstr comput studi mutat type mutat hybrid node connect connect node addit appli time section explain select mutat hybrid train consist modifi bp simul anneal modifi bp adapt learn rate individu popul sa reduc risk stuck bad local optimum distinct featur hybrid train partial train individu converg train fix amount time gener fix amount paramet user motiv partial train comput effici fit evalu train individu converg gener close behavior link parent offspr hybrid train attempt architectur mutat larger behavior architectur mutat partial train phase gener start architectur chang weight adjust yao popul inform evolutionari artifici neural network fig main structur dramat chang behavior partial train phase plai import role maintain closer behavior link parent offspr point train plai role local search ep conduct global search fit evalu base local optimum individu find start state individu poor due architectur mutat node delet total node select uniformli random delet architectur mutat uniformli random connect delet addit nonuniform probabl distribut decid connect delet add base import connect node addit achiev split exist node introduc random node obtain split exist node connect exist node weight node weight vector exist node weight vector mutat paramet fix random node connect node method greatli maintain behavior link parent offspr reduc blind random node improv gener explicit complex term fit function penal larg due difficulti balanc coeffici accuraci complex attempt aic razor balanc term encourag small order mutat order attempt mutat hybrid node connect connect node addit delet attempt addit delet offspr worst individu current addit appli order impli small network prefer job studi benchmark problem shown effect method valid set improv gener evolv train individu train evalu valid set fit valu calcul base train set simul individu gener train modifi bp combin train valid set valid set ieee transact vol june stop train select individu output studi appli problem data set obtain uci machin learn repositori australian credit card data set problem assess applic credit card base number attribut exampl total output class attribut includ numer valu discret valu diabet data set problem exampl class class attribut data set difficult classifi binar form attribut highli indic type diabet correspond medic condit diabet heart data set predict presenc absenc heart result medic test carri patient data set extract larger set data set origin exampl miss class valu discard leav retain case leav final total presenc absenc heart reduct number class origin data set heart valid set experi fit evalu step train individu minimum error rate chosen final result individu minimum error rate combin train set final result tie individu minimum error combin train set final result final individu test unseen test set data set randomli partit train test set size train test set partit previou suggest benchmark input attribut rescal linear function output attribut problem encod output class method output highest activ design class paramet experi set popul size maximum number gener initi number hidden node mean number hidden node initi individu gener random initi connect densiti tabl size problem result averag run max standard maximum mean probabl connect node constraint feedforward violat initi learn rate number mutat hidden node mean node number mutat connect mean number mutat connect paramet select modest search found sensit paramet tabl ii show result problem run error rate tabl refer percentag wrong classif produc comparison error rate obtain method result competit size measur number hidden node small execut phase hardwar implement tabl iii compar result produc bp network term averag test error rate network size iv popul discuss section previou implement ep optim algorithm minim error rate valid set individu chosen final output rest popul discard individu minimum error rate valid set minimum error rate unseen test set rest popul inform improv gener order integr inform individu treat individu modul linearli combin call combin system ensembl reason linear combin simplic find combin show import popul inform advantag combin yao popul inform evolutionari artifici neural network tabl ii accuraci problem result averag run max maximum tabl iii comparison bp network term averag test error rate network size result expect nonlinear combin method major vote simplest linear combin method major vote output number output ensembl output lowest error rate select ensembl output ensembl case popul individu gener particip vote treat equal result major vote problem tabl iv major vote method outperform singl individu problem major vote differ individu perform individu heart problem treat individu popul equal tabl iv accuraci ensembl form major vote result averag run tabl valu compar individu ensembl form major vote valu calcul base run individu equal import perform poorli due mutat previou gener greatest advantag major vote simplic requir virtual extra comput cost tabl show result compar individu ensembl form major vote level ensembl individu australian credit card diabet problem heart problem linear combin differ individu involv extra comput cost fit inform comput weight individu rank gener weight combin ensembl output sort error rate popul output weight ieee transact vol june tabl vi accuraci ensembl form linear combin method result averag run tabl vii valu compar individu ensembl form linear combin valu calcul base run scale factor set australian credit diabet heart number select modest preliminari experi ensembl output result linear combin method tabl vi result produc ensembl good produc individu tabl vii show result compar individu ensembl form linear combin ensembl individu australian credit card diabet problem level outperform individu heart problem statist linear combin rl algorithm algorithm learn linear combin weight linear rl algorithm pp find weight minim number train exampl desir output summat output ensembl righthand side omit discuss sake minim error respect weight yield equat express matrix form uniqu solut exist correl matrix weight vector found invert multipli method train requir multipl matric rl algorithm pp method determin weight implement rl run perform initi yao popul inform evolutionari artifici neural network fig major step evolut ensembl structur tabl viii accuraci ensembl form rl algorithm result averag run weight initi weight gener random unit matrix result run chosen output rl algorithm result ensembl form rl algorithm tabl viii clear ensembl perform individu problem result combin method produc ensembl rl algorithm recommend algorithm perform linear combin algorithm tabl ix show result compar individu ensembl form rl algorithm ensembl individu level australian credit card diabet level heart problem tabl ix valu compar individu ensembl form rl algorithm valu calcul base run subset popul ensembl previou combin individu gener ensembl interest investig reduc size ensembl test error rate investig provid hint individu gener inform shed light import popul evolutionari learn space subset larg popul size impract exhaust search find optim subset genet algorithm search subset weight subset determin rl algorithm section ga popul size maximum number gener crossov rate mutat rate length paramet chosen implement elit ga major step ga summar fig result ensembl form subset gener tabl ga search subset problem tabl xi size subset evolv clear size reduc averag tabl xii show valu compar accuraci individu ensembl ensembl individu australian credit card diabet problem level individu heart problem level result small number gener experi larg number produc search ieee transact vol june tabl accuraci ensembl form optim subset gener result averag run tabl xi ensembl size found ga result averag run tabl xii valu compar individu ensembl form subset gener valu calcul base run time ga run gener heart problem averag test error rate run improv reveal ensembl individu level heart problem paper show learn optim practic learn problem formul optim evolutionari learn exploit differ make inform popul paper show popul inform individu inform effect improv gener learn system paper introduc evolutionari ann design individu gener final output describ method combin individu gener ensembl result benchmark problem show ensembl gener abil individu spite good result obtain individu method investig paper linear combin involv extra comput cost combin method make fit inform readili comput weight achiev good result method fit evolutionari learn due simplic effect combin method base rl algorithm requir comput produc good result comput time primari linear nonlinear method paper natur evolv modular modul individu popul special made evolut modular evolut modular encourag evolutionari expect improv result encourag modular speciat techniqu fit share automat form speci popul speci specialist deal part complex problem treat modul final system modul evolv specif integr system learn evolv modular system test idea successfulli system step implement acknowledg author grate anonym construct greatli improv paper refer yao structur evolutionari artifici neural proc ieee int conf evolutionari comput pp linear combin neural phd school ind purdu west dec regress averag method varianc reduct extens gener convex measur phd dept brown artifici neural int neural vol pp artifici neural encyclopedia comput scienc kent ed marcel vol pp yao popul inform evolutionari artifici neural network genet algorithm neural survei state proc int workshop combin genet algorithm neural network whitlei ed lo ieee comput soc pp yao evolutionari system evolv artifici neural ieee tran neural vol pp design artifici neural network appl math publish learn algorithm learn architectur weight neural chin adv vol pp adapt filter equal intern error parallel distribut explor microstructur vol rumelhart ed mit pp hush neural ieee signal process vol pp jan learn neural network conjug gradient int neural vol pp scale conjug gradient algorithm fast neural vol pp mathemat theori complex vol pp shortest data vol pp statist model ieee tran appl vol pp wallac tech rep dept comput monash aug artifici intellig simul evolut evolutionari philosophi machin intellig ieee genet algorithm connectionist tech rep comput sci eng dept univ san feb algorithm permut comparison recombin oper neural net structur proc int workshop combin genet algorithm neural network whitlei lo ieee comput soc pp evolutionari algorithm construct recurr neural ieee tran neural vol pp empir studi genet oper genet vol pp yao preliminari studi design artifici neural network proc ieee singapor int conf intellig control june pp studi reproduct gener steadi state genet foundat genet ed san morgan pp fogel evolutionari analysi cybern vol pp model select neural vol pp develop multilevel neural neural vol pp inform criterion optim neural network ieee tran neural vol pp zhang optim neural network genet algorithm complex vol pp set neural network benchmark problem benchmark tech rep für universität sept machin neural statist classif elli algorithm gener radial basi function net classif neural vol pp baldi linear neural ieee tran neural vol pp genet algorithm machin learn dilemma fit share scale proc ieee int conf evolutionari comput pp nich method fit share implicit share parallel problem solv natur vol lectur note comput scienc pp modular proc ieee int conf evolutionari comput pp xin yao receiv scienc technolog china msc north china institut comput technolog phd senior lectur school comput south australian defenc forc academi australia held postdoctor fellowship australian nation scientif industri research organ join publish number paper field evolutionari comput neural network dr yao program ieee ieee ak program chair eighth australian joint confer ai confer simul evolut learn program member intern confer associ editor ieee transact evolutionari member ieee technic evolutionari comput yong liu born receiv msc scienc comput mathemat pursu phd school comput south australian defenc forc australia lectur visit fellow south wale publish number paper intern journal book genet algorithm scienc research interest includ neural evolutionari parallel optim
Agents/246 1 intern journal softwar engin knowledg engin vol world scienti publish compani rule abstract analysi design system franco zambonelli dipartimento di scienz di modena reggio emilia itali nichola jen dept electron comput southampton southampton unit kingdom michael wooldridg dept comput liverpool liverpool unit kingdom receiv accept system natur view comput abstract er set metaphor model exploit analysi design system concept role model increasingli design multiag system full pictur paper introduc addit concept pattern discuss complet speci cation comput focu concept rule introduc base tempor formal drive de nition structur identi cation pattern paper sketch guidelin methodolog system base expand set abstract softwar comput introduct autonom agent system rapidli emerg power paradigm design develop complex softwar system case softwar engin success rule widespread mass requir model methodolog support develop engin system repeat fashion attempt develop methodolog work tune speci system agent architectur lack gener de ned extens exist methodolog exploit abstract unsuit model system compar attempt de ne complet gener speci calli tailor analysi design mass methodolog gaia gaia view process design system construct comput system view number autonom interact entiti societi agent plai speci role number methodolog suggest de ning structur ma term role model model identi es role agent plai ma interact protocol di erent role involv adopt role model main abstract mean mention methodolog suit mass agent inher cooper system close deal gener case system agent oper open addit abstract pattern plai primari role analysi design mass rule express global requir proper instanti execut ma structur de ne speci class control regim agent role conform order ma work ecient speci ed requir pattern express ned ubiquit structur system system manner similar catalogu pattern wide exploit design system paper predominantli notion rule correct identi cation rule analysi phase fundament import rule strongli uenc design phase structur decid exploit speci pattern explor concept rule detail introduc base tempor logic speci cation tempor logic chosen suit express requir relat structur system evolut ectiv exploit support design de nition structur identi cation pattern speak abstract lead ma design paper section introduc basic concept underli agent introduc applic exampl case studi paper exemplifi concept express section introduc addit abstract methodolog appli open motiv adopt section detail concept rule show ectiv express tempor logic section brie sketch abstract exploit context methodolog analysi design mass section discuss relat work area section wooldridg conclud outlin open issu futur research direct system agent softwar entiti exhibit autonom proactiv behaviour activ subject global ow control initi reactiv environ situat characterist make agent entiti deleg accomplish task behalf user person digit simpl major agent exist context softwar global behaviour deriv interact constitu agent agent exhibit social interact cooper achiev common object achiev individu object distinguish main class multipl agent distribut problem solv system compon agent explicitli design cooper achiev open system necessarili share common dynam leav enter system agent agent benevol trust interact dynam arriv unknown agent possibl behaviour interact metaphor design parallel distribut distribut object reli architectur deriv decomposit function data requir system achiev de nition autonom proactiv behaviour constitu agent suggest applic design draw inspir behaviour structur human agent assign speci role ned task context agent accomplish autonom control interact longer express mean agent accomplish role interact identi ed de nition role posit agent perspect make design system complex easier manag tradit metaphor concurr system agent separ locu charg accomplish role fulli agent typic emb function accomplish system compon reduc point design process lead cleaner separ design dimens nal advantag relat fact mass intend support control mass adopt support work ow manag team control activ internet auction ma design reduc conceptu distanc softwar system system support simpli es develop system rule agent agent agent org org agent organ interact protocol interact medium environ figur system system perspect lead gener ma depict gure simpler system view singl complex modular encapsul principl suggest split system di erent complex system view interact natur agent part multipl agent plai role role agent expect cooper agent respect role agent simpli de ned term speci task agent accomplish context notion role agent ned posit set expect behaviour accomplish role agent typic interact order exchang knowledg coordin activ concept interact strictli relat agent role role requir form interact fact plai role ned posit commit interact protocol agent interact speci protocol requir presenc interact medium agent tradit network typic enforc interact infrastructur possibl enforc di erent interact model share dataspac enforc interact model gener ma environ agent interact order accomplish role interact occur sensor mechan enabl agent ect select portion environ portion environ agent ect determin agent speci current statu exemplar system illustr argument wooldridg sampl problem act run exampl paper manufactur class distribut problem system control manufactur process speci process paint pack metal hardwar control system deleg multipl agent devot control ned portion manufactur process assembl section paint agent control speci tool control system control speci condit assur correct process speci calli manufactur pipelin item transform augment pipelin metal item di erent agent devot control di erent stage pipelin agent devot control paint devot control heat treatment control cool agent interact indirectli environ form interact protocol role agent charg ensur speci portion pipelin work properli maintain constant temperatur cool system cool item agent ect portion environ repres stage pipelin charg agent interact achiev proper global function pipelin uniform ux item global ux item exce confer open system system support manag intern confer set run confer process involv individu group submiss author inform paper receiv assign submiss number submiss deadlin program handl review typic contact potenti review number paper review decid accept reject submiss author noti ed case produc version paper publish collect nal version print confer manag problem natur lead concept system number di erent phase process ma view made agent person involv process pc pc role plai agent ect plai person confer requir agent interact directli environ paper review form agent directli behaviour uenc opportunist behaviour emerg applic author attempt review paper pc member deal fewer paper natur environ ma internet due natur confer interact agent extern ma occur review decid exploit person agent interact agent rule abstract role model describ role constitut comput term term interact protocol pattern role model establish posit role role model consid sole abstract base entir develop process design process de ne complet role model number step perform analysi phase identifi expect work design phase de ne kind ts requir identi ed analysi phase determin compon part design necessit introduct rule structur pattern rule analysi phase aim collect speci cation requir build ma identifi basic skill requir basic interact requir exploit skill design phase decid identi ed skill interact fulli de ne role interact protocol plai system complet role model de ned analysi phase necessit prematur commit speci form analysi phase identifi outlin role model constraint actual de respect implement comput respect number identi cation spread horizont role protocol identi ed preliminari role express relat constraint role protocol case human social convent de ne set implicit rule moder interact member clerk contradict ignor command compani speci convent constraint di erent role plai clerk role requir member manag sta global constraint express term individu role individu interact protocol identi cation import correct develop system account design de ning system captur type inform concept rule explicit identi cation rule import context open system arriv possibl enforc intern coher dynam environ identi cation global rule system design explicitli de agent enter posit behaviour consid legitim express prevent rule drive design de nition speci structur enforc rule facilit wooldridg prevent undesir behaviour part unknown agent manufactur pipelin di erent stage maintain speed ow item pipelin requir express term global replic requir role confer manag number rule drive proper implement notabl agent prevent plai role author review paper pc member charg collect review paper constraint easili express term properti singl role protocol repres global rule structur role model describ role posit role model implicitli de ne topolog interact pattern control regim activ de ne structur role model describ term charg assign work load balanc activ implicitli de ne structur base hierarch topolog load partit control regim exemplar structur includ collect hierarchi model term role model conceptu wrong role model de ne structur design design role model deriv structur explicitli chosen structur view abstract de nition system structur deriv speci cation collect analysi relat simplic applic theori methodolog start analysi phase attempt de ne complet role model implicitli set structur de nition structur design choic anticip analysi phase start structur pretend advanc commit priori structur prevent subsequ structur ma directli driven counterpart system ma autom automat impli softwar system mimic real counterpart ma adopt di erent choic reason real world structur analysi phase highlight chang work mere presenc softwar introduc real ect ecienc issu driven human adopt structur necessarili appli agent rule de respect rule start ned structur make dicult rule respect enforc natur choic structur follow identi cation rule manufactur pipelin natur choic structur stage pipelin directli interact neighbour refer figur stage control agent agent directli interact neighbour close mimic structur pipelin choic necessarili natur pipelin control case problem requir global coordin agent solv due high coordin cost system design adopt di erent sketch figur global coordin agent introduc charg control mediat interact agent lead hierarch confer manag structur gener deriv structur confer decid adopt case confer vari structur year depend size confer attitud small confer reli sole pc member review pc chair act global work pc member figur larg confer involv extern review requir pc chair partit paper pc pc member charg seek number review assign partit structur hierarchi base work partit control regim highest level pc global coordin control regim pc member level figur analysi phase commit system speci design ma dicult adapt year chang confer dimens di erent edit structur analysi phase simpli describ system abstract speci design produc design confer structur pattern numer potenti term topolog interact control regim small subset structur time rare peculiar structur adopt speci unusu set signi opportun broadli methodolog encourag ned compon architectur work design develop technolog potenti pattern composit interact system term extent sampl wooldridg stage stage stage stage figur pipelin stage stage stage stage rc figur hierarch case softwar design reli build applic singl piec softwar architectur turn area envisag similar respect wide structur avail catalogu design mass presenc de nition catalogu design guid catalogu choic pattern ma pattern properli structur explicitli identi ed design phase manufactur pipelin agent express pattern applic wide exploit architectur pattern tradit softwar system hierarch pipelin structur catalogu pattern design reli de ne system structur confer manag structur rule paper paper paper paper review review review review environ pc member pc member pc member pc member pc chair review collect figur confer small pc chair assign review directli pc member confer di erent size tend adopt fairli singl expect methodolog make explicit pattern applic design worth mention attempt catalogu agent pattern exist work abstract speci methodolog ma analysi design encourag facilit pattern make dicult rule preliminari role protocol captur basic interact pattern ma independ structur characterist system captur preliminari analysi phase rule rule plai kei role analysi correct identi cation model drive strongli uenc subsequ design choic suitabl structur rule express relationship constraint role drive identi cation structur rule consid live safeti properti properti system enabl concept live safeti properti exploit level analysi concurr level analysi system novelti rule abstract introduc analog concept level formal express properti easili extend wooldridg paper paper paper paper review review review review environ pc chair pc member pc member pc member pc member paper review review review review review collect figur confer larg pc chair partit paper pc member charg nding assign paper collect review express rule remaind introduc formal notat base tempor logic express rule applic formal analysi ma avail suitabl formal express organiz rule check inconsist analysi verifi ma design respect analysi speci cation detail scope paper rule tempor logic shown inform exampl introduc subsect relat constraint di erent live safeti express rule instantan refer moment relat role protocol period time tempor formal explicitli introduc notion tempor logic suit express rule prove fact tempor logic adopt express safeti live properti level present clarifi choic give inform exampl kind relationship constraint express express constraint agent plai role agent simultan plai role rule formula interpret true eventu true true true true true true true true tabl tempor connect agent plai role plai role constraint relat cardin role agent plai role agent plai role constraint relat tempor dynam agent plai role eventu plai role agent plai role agent plai role agent plai role plai forev similar constraint appli express protocol execut order express subset tempor logic exposit proof theori tempor logic scope paper concentr give inform introduct logic basic idea extend classic logic introduc collect tempor tabl connect mean sati ed sati ed mean sati ed sati ed futur mean sati ed sati ed futur mean sati ed sati ed futur sati ed binari connect similar possibl argument sati ed mean mean eventu time true di erent kind tempor make pioneer colleagu verifi properti reactiv system wooldridg illustr tempor mean true agent mean gaia mean friend mean nal tempor model underpin logic base model time consist linear discret sequenc state oper make true state sequenc order express rule rst order tempor make predic function special mean rst rst term stand agent term stand role predic mean agent denot plai role denot make function singl argument role return number agent plai role abbrevi term stand role argument paramet suppli role de nition illustr simpl notat express return agent simultan plai role agent plai role plai role agent plai role agent plai role agent plai role eventu plai role notic live properti state good rule agent plai role agent plai role agent plai role plai forev notic safeti properti state bad rule speci cation clarifi introduc refer pipelin confer manag exampl manufactur manufactur inconsist ict avoid requir agent plai role control stage pipelin condit rule express denot role control stage pipelin major agent plai role stage control correctli process item ow block pipelin impli ow item stage pipelin safeti condit global estim request ow item stage identi ed analysi ow stage control stage control detect actual ow item pipelin longer chang condit stage control agent simpli chang local ow item ow item chang chang pipelin stage discov unabl immedi initi protocol request chang global ow express rule relat execut make binari term denot role term denot express role initi particip execut protocol fact stage initi protocol request chang ow express wooldridg similar express addit rule state stage initi stage eventu involv complimentari consid live safeti condit express fact stage chang ow involv stage protocol express ow import note rule commit design speci structur simpli state structur pipelin work correctli fact stage initi stage eventu involv automat impli stage initi protocol involv impli global control charg involv stage protocol rule leav choic simpli state global coordin role design decid introduc global control charg handl problem protocol relat ux stage directli involv stage protocol manufactur pipelin global constraint oper requir speci rule speci ed confer state subsect rule prevent control opportunist behaviour power rule appar appli confer manag con ict uenc complex relationship role role protocol confer review process paper review review simpl basic rule relat cardin number time role express review singl review receiv paper review multipl time express state agent plai role review paper plai role subsequ safeti properti rule confer manag directli human condit implicitli assum review process automat manag explicit de nition rule rule analysi phase correct implement opportunist agent interest review paper time agent person assist review strongli uenc explicit de nition rule make design tune prevent break rule speci condit review ensur review process fair possibl behaviour control express fact agent review author similar condit appli pc member pc pc chair pc member charg collect review avoid pc member select review collect review paper review rule relat execut protocol review receiv paper review eventu send review paper make predic introduc manufactur express rule live properti relat correct execut protocol safeti review submit review receiv paper review program chair collect review list accept ensur sucient number review submit review receiv paper chair initi case manufactur confer identifi speci rule fact rule identi ed express make assumpt actual structur methodolog introduc de ned abstract design open agent step fashion design process produc order sequenc identi set indic interrelationship show exploit model abstract develop ma figur sketch process extens gaia detail outlin central role plai introduc abstract wooldridg statement analysi phase requir rule preliminari role model preliminari interact model role model interact model agent model servic model structur catalogu pattern design phase figur model methodolog give outlin process detail exposit scope paper work deal activ requir endeavour neutral respect eventu solut technolog start analysi phase phase task collect speci cation design comput start includ identi cation goal expect global basic skill requir basic interact requir exploit skill preliminari role interact rule respect enforc global behaviour output analysi phase consist basic preliminari role preliminari interact set rule role model deriv list basic skill role identi ed commit speci structur assum gaia role de ned term function role express term safeti live permiss set activ role carri agent interact protocol role interact preliminari interact model captur protocol preliminari role assum model structur gaia protocol de ned term textual descript natur initi start respond initi input rule role initi enact output suppli protocol respond process textual descript process protocol initi perform preliminari role interact model ned expand subsequ design phase nal analysi model captur global rule discuss section design phase build output analysi phase produc complet speci cation ma design de nition topolog control regim involv ma respect enforc rule complet preliminari role interact base adopt aspect analysi adopt speci structur insert role protocol separ exploit pattern design structur design nal interact model de nition agent model identi es agent type make agent instanc instanti type agent type thought set agent role fact correspond role agent type case design packag number close relat role agent type conveni de nition servic model identi es main servic requir agent role servic simpli coher block activ agent engag servic perform document properti speci identifi postcondit view output design phase speci cation pick tradit method object orient implement framework map gener design model implement architectur dealt work relat work tradit analysi design poorli suit mass fundament mismatch abstract provid ort attempt simpli extend methodolog ma inevit fall short tradit composit method softwar architectur limit applic de nition mass de ned interact model static compar dynam interact model agent model interact system compon clash perspect mass wooldridg number model techniqu develop methodolog recent year attempt exploit idea ma comput system model techniqu de ne simpli collect role role system group simpli collect role toolkit approach de ned simpli set role interact protocol occur role approach incorpor notion rule structur reason limit rang agent system deal attempt de ne complet clear methodolog develop agent system gaia start metaphor de ne complet methodolog develop system clean separ analysi design phase su er limit incomplet abstract object gaia analysi phase de ne fulli elabor role deriv system speci accur descript protocol role involv implicitli assum structur priori case role analysi phase fail identifi global rule gaia unsuit model open system control behaviour similar shortcom ect methodolog mase methodolog clean guidelin develop base ned process process drive develop analysi implement design process fail identifi abstract role model di erent work area coordin model languag explicitli address problem de ning global rule behaviour interact agent ensembl interact occur speci intern behaviour program implement speci polici govern agent interact recent coordin model abstract de ne methodolog analysi design open agent system achiev coordin media exploit conceptu physic repositori rule similar approach driven implement system auction forc agent act accord rule auction enact social system dynam associ agent auction control agent act coordin charg mediat interact make agent respect auction convent futur work paper discuss number issu relat analysi design system speci consid view develop multiag system process construct comput concept role model import research area eld system paper introduc pattern neglect current rule methodolog softwar fundament import plai central role methodolog aim broad appeal introduc motiv concept rule show formal base tempor logic suit sketch gener guidelin methodolog analysi design system center abstract work detail complet introduc coupl tempor logic formal rule suitabl formal express provid suitabl notat express expect output analysi design phase expect standard rapidli adapt softwar engin develop identifi guidelin assist design identi cation suitabl structur system analyt case studi experi support choic expect signi formal experi number di erent research area research area requir engin relat concept rule worthi investig provid guidelin formal identi cation rule research result manag scienc wide studi structur human common expect plai signi role guid choic structur design phase refer odel agent formal multiag softwar system booch analysi design addison read fmt bm nr treur model system composit formal framework journal cooper inform system pattern bussmann program control task intern confer system page ieee cs june zambonelli programm coordin architectur mobil agent ieee internet ciancarini coordin model languag softwar integr acm comput june zambonelli multiag system coordin viewpoint intellig agent vi volum page springer wooldridg demazeau rocha costa popul organ open multiag system nation symposium parallel distribut ai ferber gutknecht analysi design organ system intern confer multiag system ieee cs june fox organiz view distribut system ieee transact januari vlissid design pattern addison read gelernt carriero coordin languag signi canc commun februari huhn program intern workshop softwar volum lnc springer survei methodolog rao jp intellig agent iv lnai jen intern joint confer arti cial intellig page nr jen softwar engin arti cial volum page kendal role model agent system implement intern symposium agent system applic ieee cs octob kendal agent softwar engin role model intern workshop softwar volum lnc springer kinni georg methodolog model techniqu system bdi agent workshop model autonom agent lnai page lind issu softwar engin intern workshop softwar volum lnc springer malon crowston interdisciplinari studi coordin acm comput march manna pnueli tempor logic reactiv concurr system springer manna pnueli tempor veri cation reactiv system safeti springer structur synthesi research prentic englewood cli nixon repres nonfunct approach ieee transact softwar june noriega metaphor phd universitat de barcelona van dyke bock repres agent interact protocol uml omg document decemb omicini societi infrastructur analysi design system intern workshop rule softwar volum lnc springer omicini zambonelli coordin internet applic develop journal autonom agent agent system develop base agent pattern intern confer softwar page jd thompson organ action multiag system engin intern journal softwar engin knowledg wooldridg jen intellig theori practic knowledg engin kinni gaia methodolog analysi design journal autonom agent mj wooldridg softwar engin iee softwar februari wooldridg softwar engin internet applic coordin internet technolog applic springer
HCI/247 4 approach construct digit librari laboratori interact cooper technolog universidad de la john center informat missouri garden po box st mo usa abstract paper describ approach construct digit consist larg data repositori relat servic term author plant morpholog descript enter data digit librari editor agent run concurr editor suggest potenti morpholog descript base similar document exist librari benefit deriv introduct includ reduc potenti error data parallel save time regularli spent visual check parallel manual edit data digit introduct construct vast data repositori support activ digit librari pose problem enorm dimens problem import digit exist data format media introduct data constantli gener librari hold complet autonom emerg comput scienc area gasser wooldridg al approach address number problem paper report develop environ facilit task enter data digit librari project undertaken context digit support research activ conduct studi specif geograph act inform center scientist gener public interest prototyp term advantag distinct characterist digit librari data collect publish process provid user agent activ particip construct data repositori emploi style entiti perform task behalf user paper organ provid descript digit librari context project specif problem found construct briefli discuss notion user agent task agent categori classifi present conceptu design prototyp implement final section discuss project accomplish ongo futur work context digit librari import plant life planet plant speci disappear todai faster rate scientist studi tradit mean collect share inform inform commun technolog support activ field biolog foster incept digit librari distribut virtual space data repositori varieti servic offer librari patron facilit extens exist knowledg plant figur sampl morpholog descript famili illustr north america china specif instanc digit construct missouri garden tradit print inventori describ plant speci occur geograph area electron digit repres effort make access wider audienc scientist advantag advanc area comput user autom inform retriev techniqu fulli electron research expect produc continu refin digit librari authorit scientif inform speci plant north america north mexico al digit librari consist larg collect document varieti media includ text map illustr figur offer wide rang servic patron librari global network main scientif data prepar enter specialist work place north america foc similar aim produc digit librari data speci plant china compon repositori primari entiti maintain digit librari relev work taxonom distribut treatment taxonom kei hierarch indic aid identifi base inspect characterist kei exist taxonom level distribut map graphic depict exact geograph area speci illustr artist render typic taxonom group figur treatment heart provid detail morpholog descript plant speci lower level treatment refer public document plant endang speci discuss classif scientif morpholog descript consist seri descriptor refer intermedi abstract group number plant characterist figur show morpholog descript digit librari link data inform resourc provid mean util greatli enhanc basi academ collabor scholarli work construct process make valid scientif data digit librari entail complex process huge volum inform handl complex interact involv public process requir care activ plan coordin expect complet year research collect studi plant directli examin review previou relat work produc submit treatment editori case project editori consist plant distribut unit state canada project activ coordin organiz center distinct review process scientif content stylist carri submit manuscript plant structur characterist make treatment morpholog descript organ larg spreadsheet editor detect miss inconsist data import user parallel ensur treatment taxonom valu set order visual check manuscript parallel correct manual timeconsum task treatment author review benefit softwar environ activ cooper construct data repositori work present paper aim assist author task build morpholog make portion treatment typic process gener treatment taxonom kei regard consist interleav phase author write treatment individu instanc taxonom level number treatment author taxonom summar characterist taxonom group identifi higher taxonom level treatment ad lower taxonom level includ characterist taxonom kei characterist make taxonom group distinct level newli ad treatment result taxonom kei vice versa tradit includ characterist higher level kei lower level treatment result repetit task author review user agent servic user digit librari access agent deleg task perform fashion approach present agent digit librari servic introduc al gener notion agent consid highli abstract multipl area comput scienc motiv format research commun studi potenti agent wide rang applic concentr develop user agent refer interfac categori agent directli perceiv end user softwar entiti autonom carri deleg mission categori programm agent network refer abstract necessarili access end discuss taxonomi agent present user agent deleg basi style interact expect supplement exist interfac paradigm base primarili direct manipul navig context larg dynam inform space digit agent plai import role reduc complex inform overload face end user softwar agent programm agent network agent user agent inform agent task agent synthet agent group agent person agent figur gener agent taxonomi context subclass user agent identifi inform agent user deal inform space typic unorgan highli dynam number inform agent prototyp develop www al shoham task agent user perform individu group task agent run concurr user watch user activ offer autom action exampl person task agent includ document al repres exampl group task agent synthet agent creat engag environ user introduc lifelik charact comput interfac implement entertain exploratori learn exampl synthet agent found agent present assist individu author construct plant treatment integr digit librari consid person task agent figur summar forego discuss show context person task agent gener agent taxonomi treatment gener discuss creat edit treatment amount portion process build digit librari treatment author engag highli repetit task integr plant data includ morpholog descript review editor deal multipl data format discov implicit structur characterist order ensur treatment complet parallel section describ treatment gener facil aim reduc problem treatment gener expedit entir process librari construct author treatment edit tool agent digit librari schema dbm suggest treatment data agent suggest figur digit librari context conceptu design figur conceptu diagram show main context design oper compon digit librari relat shown diagram descript initi found repositori depict consist manag system common schema top seri servic implement introduct end figur author select taxonom level agent user set tool remot enter treatment data directli data repositori start process task agent attent author enter plant characterist suffici similar treatment exist agent volunt structur characterist user modifi valu treatment edit tool treatment edit tool set includ treatment editor automat incorpor characterist taxonom kei morpholog descript treatment base compil list structur editor facilit task enter valu commonli occur characterist editor user easili add characterist valu review effici check morpholog descript consist mechan measur enforc parallel implement author enter treatment data directli make standard list characterist time spent reformat extract data manuscript save potenti inconsist reduc accomplish provid author great flexibl gener dynam complet list structur characterist editor function independ enhanc work parallel task agent agent morpholog similar fundament defin taxonom plant group plant speci share number characterist valu characterist present plant group valu agent process advantag fact produc suggest author structur characterist includ treatment construct editor author enter morpholog descript agent compar current descript exist treatment librari base similar agent determin exist treatment retriev librari author basi morpholog descript gener user instruct characterist suggest exist treatment figur agent suggest morpholog descript incorpor treatment author add remov save type time ensur consist mechan exist measur similar document suggest base vector space techniqu discuss salton mcgill morpholog descript exist treatment repres posit characterist store weight characterist enter author regard queri vector angl form exist treatment vector measur smaller similar descript orthogon vector impli complet morpholog angl impli ident descript rang similar measur adjust author agent interact proce success suggest produc prototyp work prototyp develop context north america digit librari major function previou section implement characterist valu enter html form invok program cgi protocol access data implement sql queri api provid illustra dbm maintain repositori agent interfac implement javascript figur illustr sampl session enter morpholog author select taxonom level treatment gener taxonom level characterist valu taxonom kei incorpor morpholog descript progress repres record author choic start build queri vector initi set characterist characterist ad similar treatment found librari figur agent smile potenti morpholog descript author opt view suggest morpholog descript ad data current treatment characterist valu ad remov author ongo futur work user interfac paradigm interact task agent contribut reduc burden repetit task carri construct digit librari design prototyp implement demonstr potenti benefit treatment deleg repetit task reduc dynam gener plant charact parallel develop close cooper staff project undergo seri user test real treatment gener situat initi qualit evalu posit user feedback refin system design implement expect import featur implement similar measur current fix angl threshold determin exist treatment consid futur work includ adapt deploi construct china digit librari similar project acknowledg work support part grant andrew mellon foundat nation scienc foundat author gratefulli acknowledg contribut project staff organiz center refer learn world wide web inform gather distribut paper aaai spring symposium knoblock ed aaai menlo role emot believ agent commun acm collabor recommend commun acm make intellig digit librari methodolog intellig intern symposium illustra user guid illustra inform calif agent amplifi commun inform gather distribut paper aaai spring symposium knoblock ed aaai menlo visual agent perform graphic softwar paper aaai spring symposium aaai menlo intern confer system aaai mit menlo calif agent assist web ai applic knowledg navig paper aaai fall symposium ed aaai menlo artifici life meet lifelik autonom agent commun acm ture enter prize competit twelfth nation confer artifici intellig aaai menlo introduct modern inform retriev ny taxonomi agent tech rep laboratori interact cooper technolog depart comput system universidad de la agent servic phd dissert depart comput texa colleg august introduc agent servic provid digit librari acm intern confer digit librari pp agent servic user digit librari journal network comput softwar complet pattern construct user interfac artifici intellig research north america digit case studi publish journal network comput teach agent learn commun acm intellig agent ii ny
DB/248 3 ectiv tempor aggreg tree jong soo kim kang ho kim depart comput korea advanc institut scienc abstract tempor introduc concept time underli provid facil user store retriev data aggreg tempor tempor aggreg extens convent aggreg domain rang aggreg includ time concept tempor aggreg import tree structur tempor call aggreg process method base show time complex method exist method time complex method shown lower bound problem perform compar experi show perform advantag method practic introduct convent system store recent snapshot real tempor system maintain data appli area tempor properti underli data trend analysi forecast support version control earli research tdb conceptu tempor data model recent work tdb consid implement issu index queri process storag structur studi research tempor extens standard queri languag ort introduc tempor aspect perform recent work design implement tempor oper plai import part aggreg function import compon essenti statist task support applic tempor aggreg approach solut special tree structur built jong soo kim al tupl ltere tempor aggreg result quali ed tupl comput construct tree structur construct tree aggreg comput tree occur frequent di erent queri gener di erent quali ed tupl cient tree construct aggreg comput techniqu essenti improv queri time approach tempor aggreg aggreg aggreg tree drawback aggreg tree sever skew time interv tupl sort order situat occur frequent tupl store order time valu space requir aggreg tree aggreg anew balanc tree structur cient tempor aggreg process techniqu time complex method log lower bound problem exist method perform experi method practic remaind paper organ describ preliminari knowledg section section structur tree construct aggreg comput techniqu explain detail perform method evalu section conclud summari work section preliminari tempor aggreg major concept time valid time transact time valid time denot time interv fact valid realiti transact repres time interv fact exist assum tempor aggreg perform singl time valid time transact time assum tempor data repres tupl timestamp manner standard queri languag relat data support basic aggreg function max aggreg function classi ed di erent comput aggreg select aggreg comput aggreg obtain accumul comput tupl select aggreg obtain select repres valu tupl avg comput aggreg min max select aggreg function concept ned time interpret dbm lectur note comput scienc tdb tupl valid transact time domain rang aggreg tupl extend includ time partit time interv partit interv di erent aggreg tempor aggreg valu comput interv maxim continu interv wehav aggreg valu call constant interv process group tupl constant interv comput aggreg valu call tempor group tempor aggreg denot oper partit constant interv perform tempor group constant interv figur show tempor aggreg max count constant interv max count tempor aggreg perform approach simpl step iter comparison time interv tupl obtain constant construct adjust aggreg valu exist di culti simpl solut step constant interv tupl figur construct tupl time interv process compar tupl construct constant interv order obtain constant interv tupl worst tupl compar previou mean time complex denot number tupl previou work tempor aggreg simpl extend epstein convent aggreg techniqu extend exist aggreg method constant interv determin read tupl aggreg valu constant interv comput read tupl read relat entireti overhead approach problem compar tupl aggreg valu overlap constant interv max start end count start end fig tempor max count jong soo kim al initi state insert insert insert fig construct aggreg tree count binari call aggreg tree cient partit constant interv comput aggreg valu comput tempor aggreg base aggreg tree consist tree construct aggreg comput tree node aggreg tree time time interv child node partit parent interv interv sibl node union parent interv leaf node aggreg time interv repres constant part aggreg constant interv real aggreg constant interv comput aggreg tree aggreg leaf node comput valu node path root leaf node figur illustr construct aggreg tree count node start time end time circl denot number data item node time interv figur count constant interv summat valu root leaf tupl insert aggreg child node gener partit time interv leaf node partial overlap insert interv number child node gener singl insert space overhead neglig aggreg tree skew time interv uniformli distribut worst aggreg tree link time complex denot total number tupl aggreg tree di erent queri di erent condit queri produc di erent set quali ed tupl di erent set tupl gener di erent constant interv aggreg valu cienci tree construct import tempor aggreg techniqu tree structur tempor present aggreg process mechan kei left child child fig tree node structur lectur note comput scienc salari start time end time richard karen nathan nathan fig relat contrari aggreg store inform start end time tupl partit time interv tupl type node tree node node addit link list tree time plai role comput pointer link select aggreg figur show structur tree node note gure denot figur illustr construct comput aggreg relat figur select tree gure start end time kei valu insert time interv tupl node set amount chang aggreg valu time kei valu node gure insert tree balanc techniqu select addit link list length time interv tupl start time kei select figur show structur node select aggreg insert insert insert insert fig construct comput aggreg jong soo kim al left child kei length length child fig node select aggreg select explain insert time interv time interv insert start time kei length interv aggreg store note select aggreg figur illustr construct select aggreg relat ect comput select aggreg elimin order reduc process time figur tupl insert insert tupl exist remov max aggreg formal descript construct algorithm figur aggreg comput tree comput aggreg select aggreg mechan implement singl algorithm comput aggreg simpl visit ascend order time visit node repres amount chang insert insert insert insert fig construct select aggreg assum tupl repres start time time interv end time time interv attribut lectur note comput scienc qualifi tupl insert kei tt insert kei insert step process target aggreg comput skip step denot insert step insert length field set field set fig construct algorithm aggreg time comput aggreg constant interv obtain accumul visit node sum oper process tree figur visit result aggreg sum time time time time select aggreg process tree select aggreg base consid problem problem maximum valu interv valu interv solut problem list pair int denot interv constant maximum max problem ident select aggreg max oper case min oper chang sign valu techniqu solv problem appli directli select aggreg max min figur show instanc problem solut outlin build problem construct inform length aggreg posit neg number mix easi correct outlin construct encod scheme problem solv simpl algorithm fashion balanc binari approach appli instanc problem solut instanc fig problem jong soo kim al di culti max oper process tree figur visit list merg produc result merg nal result tempor max produc perform compar perform tempor aggreg method base base aggreg tree perform aggreg method shown exist method compar method aggreg method provid result evalu analysi worst case time space complex complex describ time complex method aggreg investig lower bound time complex problem order rule item gener result tempor aggreg de ned desir analyt applic tempor aggreg result provid time order tempor aggreg return result time order target complex analysi tempor aggreg tupl lower bound log convert arbitrari sequenc time interv sort form theorem formal basi proposit theorem lower bound time complex tempor aggreg number tupl log show sort problem transform tempor aggreg problem time problem de ned sort distinct natur number previou inform input number tempor comput tempor aggreg sum tempor data item bound time complex transform lectur note comput scienc fig instanc correspond instanc lower bound log instanc ai distinct natur gener instanc ai ai denot time attribut tupl start time end time time interv denot attribut ti easi transform instanc instanc figur instanc step comput tempor aggreg max result tempor aggreg figur fact result sort mention transform instanc agg instanc assum tempor aggreg max comput log mean solv log contradict easi tempor aggreg sum avg comput log argument max oper lower bound log tempor aggreg process perform tree construct phase aggreg comput phase phase di erent aggreg queri queri produc start end val ti ei ti ti ei ti ti ei ti ti ei ti result start end val fig result tempor aggreg max jong soo kim al di erent set quali ed tupl di erent tupl set gener di erent tree phase consid worst case time complex follow denot number tupl qualifi aggreg aggreg tree binari tree balanc mechan skew worst time complex tree construct balanc time complex tree construct log comput select aggreg process aggreg tree comput select aggreg comput aggreg tree construct comput aggreg process time complex select aggreg process tree node tree problem solv solut sibl node merg order build parent node construct result select aggreg consid process solv problem manner partit set time interv con ne target comparison time interv partit worst case time complex log select aggreg comput aggreg tree total time complex tree construct phase summari result shown tabl space requir aggreg tree aggreg singl tupl insert split node split produc node aggreg tree approxim node worst case start end time tupl tabl time complex tempor aggreg tree comput total complex construct aggreg tree comput aggreg aggreg tree log log tree select total complex construct aggreg tree select aggreg aggreg tree log log log number node aggreg tree number tupl fig number node tree lectur note comput scienc amount memori aggreg tree number tupl fig amount memori tree construct produc tupl insert attach start time kei maximum result node worst case space requir aggreg tree worst case result conduct experi measur amount memori number memori access perform tempor aggreg method detail experi synthet set tupl tempor relat tree aggreg tree data set construct total time rang set denot time rang year hour minimum time unit start end time tupl randomli gener assum start end time valu uniformli distribut tree number node amount measur assum size time attribut tree pointer byte balanc balanc element byte tree perform tempor aggreg comput aggreg select aggreg tree repeat experi twelv time reliabl result result present averag ten valu except maximum minimum valu figur figur show number node amount memori aggreg tree figur number node half node aggreg tree amount requir half requir aggreg tree shown figur jong soo kim al number memori access aggreg tree number tupl fig number memori access comput aggreg process number memori access aggreg tree number tupl fig number memori access select aggreg process comput aggreg aggreg tree worst case time aggreg comput phase node visit speci order tree figur show number memori access comput aggreg process includ tree construct phase aggreg comput phase shown figur notic method base requir number memori access method base aggreg tree comput aggreg result explain fact construct time construct aggreg node aggreg tree figur show number memori access select aggreg process select time complex aggreg comput phase log larger aggreg tree perform method aggreg method shown gure result fact time complex domin tree construct phase tupl start number memori access select aggreg length larger perform deterior minim elimin meaningless element type aggreg tree construct phase assum process tempor aggreg max tree construct gener greater equal exist aggreg import oper tempor essenti statist task support applic lectur note comput scienc aggreg di er convent aggreg underli tupl tempor domain rang aggreg extend includ time comput tempor aggreg approach solut exist method tempor aggreg high time complex space requir tree structur call tempor aggreg aggreg comput method tree number node exist aggreg tree store tempor inform basi start end time tupl partit interv aggreg tree case aggreg tree result analysi worst case time complex shown tempor aggreg method base outperform exist method refer tempor model report aalborg ectiv data cluster bitempor proc intern workshop tempor reason cient evalu natur join proc icd implement histor aggreg master thesi wayn state nov tempor queri languag kluwer academ publish bohlen ad valid time comput tempor aggreg proc icd cli consensu glossari tempor concept acm sigmod record vol unifi tempor data model conceptu model inform vol techniqu process aggreg relat system technic report comput scienc depart california berkelei data structur algorithm publish introduct creativ approach publish compani
HCI/249 4 busi suitabl principl workflow model ap ahm ter ha proper pn depart comput scienc faculti inform technolog queensland queensland technolog qld gpo box brisban qld australia australia conceptu busi analysi abstract incorpor aspect coordin workflow implement inform system requir sound busi process semant success conceptu model techniqu depend larg adequaci express formal foundat equal import busi busi suitabl focu busi suitabl workflow model commonli encount class busi insur bank loan land gener assess conduct integr techniqu paradigm structur process behaviour process model model insight busi suitabl broader perspect techniqu gain specif busi suitabl diagnosi busi intuit semant busi servic busi process nuanc busi suitabl principl elicit detail understand develop workflow model techniqu insight workflow specif languag workflow open distribut architectur gain introduct workflow recent emerg comput support cooper work system workflow system survei part work support busi unit queensland govern depart public work administr servic advanc inform system implement model incorpor aspect collabor coordin busi process tradit implement applic partit discret unit oper procedur describ human action busi process combin deliv busi servic endow busi process execut workflow permit greater fit iss workflow level tradit enabl program bind access set file newer applic develop exist applic reflect reengin busi process crucial specif implement conceptu level orient analysi domain essenc aspect implement fact problem inadequaci detect greater correct concept progress workflow manag coalit set term refer defin suffici notion process state focu gear workflow manag system specif languag emphasi part busi process execut parallel sound requir process updat retriev explicitli captur conceptu techniqu model aspect busi domain integr integr specif result number paradigm discern workflow theori synthesi busi deploi requir engin method design method tool workflow model compon backtrack counterpart field conceptu model fairli applic intuit develop model involv inform formal transit workflow transit greater align requir workflow model cognit busi process cognit qualif fundament model concept attribut busi busi process semant semant techniqu workflow express commun adequ techniqu absenc uncertainti exist effect conceptu model techniqu busi busi gener prescript busi process cognit fact desir refer detail paper address uncertainti basic set requir conceptu model techniqu fulfil order effect requir base conceptu model principl properli cater develop workflow specif problemat accord techniqu focu essenti detail focal aspect busi model workflow specif languag deflect dictat qualiti hundr percent techniqu provid suffici express power full fact express workflow specif languag exce partial remaind address implement level problem softwar engin disjoint analysi preclud sound understand lead prematur implement conceptu model commun valid set stakehold mechan requir effect effect graphic present mechan facilit formal foundat requir prevent interpret ambigu enabl formal reason recent survei workflow technolog cite problem model process methodolog explicitli support specif mean workflow lack formal semant formal constitut formal foundat final issu type domain consid unrealist techniqu suitabl problem domain mean close connect model concept requir domain busi process domain busi suitabl techniqu type type busi process attent drawn type busi process exhibit execut path process insur bank loan land natur rare undertaken strict oper procedur multipl interact client extern typic fulfil servic request closer connect workflow system consid type busi process cscw notion busi workflow workflow system assum constructivist notabl advoc concept develop number integr conceptu model techniqu assess requir attent turn determin common problem busi formul number principl result principl principl describ model backtrack element scenario valid principl identifi busi distinct busi process busi workflow cognit servic inform hide principl requir busi process undertaken busi servic request insul motiv explicit treatment busi servic conceptu model cognit suffici principl requir concept involv workflow model enact simultan present model simultan absent assess techniqu combin structur behaviour aspect human comput interact tempor aspect execut resili principl identifi oper error handl cater conceptu incorpor recoveri manag focu transact workflow gener except handl improv insight assess develop workflow model claim separ busi busi process busi lead effect open distribut environ servic involv workflow paper section techniqu characterist paradigm structur process behaviour process model model assess section problem busi suitabl principl defin section paper conclud assess integr conceptu model techniqu insight capabl techniqu support sound busi process workflow specif sought assess integr conceptu model techniqu conduct gener conceptu model requir section express formal busi suitabl techniqu drawn paradigm ffl structur process model ffl model ffl behaviour process model ffl model approach assess reflect motiv kei area observ includ integr integr structur mechan adapt concept featur busi level integr strategi reflect cognit depend techniqu partial model understand busi domain process model techniqu process respect data control flow data integr data model dual object model techniqu object state respect process involv state process model integr structur relat definit concept partial model concept bound singl logic definit partial model separ concept integr basic consist permit stronger express power formal foundat greater flexibl techniqu select depend analysi specif busi process situat underscor prefer assess structur process model structur process structur analysi widespread provid process analysi softwar design map preval number extens incorpor data model techniqu process model higher level identifi data repositori lead data integr strategi data flow diagram structur popular arguabl popular structur process model techniqu direct graph node repres extern process data edg repres data flow node process provid data flow lowest process detail structur english specif specif data flow store data dictionari figur illustr integr process data model librari domain data model base entiti relationship model techniqu data dictionari process specif omit model process loan request borrow extern send loan request item loan loan issu item item pass borrow loan item return return issu item data store item loan borrow make request order process order detail store item detail store item order publish suppli order item item updat data dictionari integr erm achiev syntact correspond correspond requir data store entiti alphabet figur integr structur clear integr correspond exist relationship aggreg data flow data store relationship type absenc formal semant omiss wide observ techniqu make detail correspond difficult care directli data store unnatur aggreg entiti type result methodolog implic delai erm model suffici detail drawn joint methodolog mutual influenti decomposit erm process specif data dictionari element maintain consist erm express power structur english restrict basic level publish item request item item borrow order order item loan detail return loan order level detail item borrow order publish loan er diagram data dictionari process specif request loan loan loan item order figur process data model integr librari domain structur analysi integr busi rule includ express object lifecycl implicit process specif process depend determin manner sole system design strength li simpl gener concept decomposit effect earli phase analysi broader context system scope understood larg partit extern permit horizont view valid classic process model appli domain includ process text process busi methodolog recommend model process structur essenti determin simplic gener busi suitabl relationship process structur arbitrari basic aspect busi process model procedur style express process specif imper declar lower level prescrib problem cite model approach recent analysi design stem object provid closer realiti prone chang process static object includ dynam properti implement method class object convent advoc princip integr conceptu model object structur model techniqu data model erm base model base object behaviour model techniqu base formal finit state machin petri net object behaviour model describ higher model context requir domain object interact process model integr techniqu includ paradigm differ regard incompat case scenario develop preserv context popular object model techniqu incorpor integr strategi accommod process behaviour perspect object model function model dynam model includ figur illustr model integr librari domain object attribut list middl portion object class diagram method list lower portion object type dynam model dynam model partial order behaviour state node state defin predic orthogon object type structur edg repres state transit state transit embodi event trigger action condit satisfi result action chang state figur event order request trigger action creat order creat order object previou state order borrow satisfi larg class busi rule captur state transit paradigm languag adopt activ context conceptu specif defin esprit project textual case check denot condit predic esprit acronym european strateg program research inform technolog publish object model borrow order loan check creat order loan return item dynam model creat check loan return item call titl type loan date due date type subscrib date call titl type loan date due date call titl type loan date due date order item order return item order request order loan request arriv borrow check item figur object dynam model integr librari domain omt moment figur illustr complic object lifecycl interest featur primari import integr domain object behaviour model pivot understand broader context domain pseudo code includ altern iter improv express power eca languag conceptu specif techniqu omit detail specif convolut graphic aspect model return figur illustr integr function object model librari domain integr rule requir function model leaf process correspond object class method straightforward singl leaf process involv object type princip object type refer omt identifi target data data store actor extern entiti target identifi determin relationship object type object type target invok request object type relat object type correspond figur integr structur pai balanc account custom gener account close account creat account open make deposit make deposit creat deposit good stand account add amount gener gener account close withdraw deposit make account submit withdraw submit close account account amount pai reduc balanc amount return reduc balanc bounc fee gener gener account amount balanc reject withdraw reduc balanc amount pai amount gener account account id custom id gener make deposit figur object lifecycl account bank domain classic omt simpl gener set concept type domain busi suitabl gain dynam model object basi function model address process control deriv collect set dynam model claim occurr techniqu gener present ambigu analysi process structur detail combin cognit model resolv difficult design function model insight aggreg complex object dynam function model provid collect insight method identif lack formal semant function express power restrict effect gain evid formal semant found referenc techniqu object model function model publish loan order creat borrow check check borrow check item loan item return item borrow request item item loan return borrow request creat order statu order creat item publish request detail order request request loan loan borrow loan loan item statu order item detail order item return item creat check loan return item call titl type loan date due date type subscrib date call titl type loan date due date call titl type loan date due date figur function object model integr librari domain omt behaviour process model enhanc suitabl result behaviour aspect process model identifi section integr techniqu petri net model pioneer behaviour process model level process model decomposit behaviour aspect includ process parallel collabor aspect process model problem starvat determin prior implement classic petri adapt process behaviour specif limit formal interpret practic petri net net colour petri net overcom problem provis declar net express formal languag predic logic function program languag incorpor formal semant lead execut process tool formal demonstr integr model combin construct singl make petri net difficult comprehend strategi maintain lose express power behaviour network model transfer behaviour aspect higher level abstract lowest level higher lowest process transform er schema specif replac tradit structur english level model integr figur illustr erm integr librari check borrow process bid loan request item borrow check request statu borrow loan borrow reject request loan request process model data model period reject request loan request behaviour model figur process behaviour model integr librari domain specifi conjunct loan request borrow statu requir check borrow disjunct loan request reject request produc data flow messag carrier erm object type input case loan connect place turn connect transit individu set instanc erm entiti type link place data flow introduc model execut repres elementari entiti data flow instanc operand rule rule check note declar rule specif petri net compar imper approach structur english firstli loan request reject request borrow item regist loan pre post request reject ensur loan request accept negat specif provid variabl function date introduc compar structur techniqu improv process specif improv express power basi formal foundat process postcondit rang busi rule compar object lifecycl object lifecycl implicit relat class busi rule implicitli hydra behaviour aspect defin process task structur level decomposit data model psm orm decomposit object type object type integr appli level decomposit conceptu specif express detail process specif constraint figur illustr task structur check borrow psm schema contrast model process model strike omiss concern simplifi process model sequenc provid express power petri net base approach translat petri net task structur complic task structur figur task predic outgo posit arc borrow loan item date borrow requir date period item express formul attach schema schema defin highest level task visibl decomposit buffer variabl defin temporari storag task process schema type attach buffer process model check borrow reject loan request date item loan data model borrow period figur task structur check borrow psm schema posit outcom result termin execut return control call task neg outcom result reject loan request execut recal send messag reject request data flow hydra explicit data flow note express warrant introduct date function addit oper domain sensit chief hydra express power formal assess techniqu formal semant task structur process algebra high behaviour process model clear major drawback busi suitabl result discuss problem gener lack data flow data store construct uncertainti effect busi level model displac essenti natur conceptu conceptu model orient busi aspect shift gener suitabl classic busi domain lack standard strategi vari significantli earlier attempt focuss provid aspect process conceptu model busi concept actor cooper process petri net captur semant busi process earlier attempt offic model base complet popular object concept result adapt techniqu pure approach offic model concept esprit project object type defin busi resourc data busi role defin permiss state constraint busi model context conceptu model provid typic busi plan describ oper strateg structur qualit descript critic success market competit qualiti manag qualifi busi servic provid process structur design carri busi occupi significantli size document busi model abstract describ concept busi actor actor role resourc integr execut specif framework busi model strateg level busi problem solv busi servic carri oper concept exist activ materi actor resourc anchor unit task undertaken actor possibl actor consist partial order elementari action action undertaken actor possibl actor action appli object figur illustr part busi model librari domain figur describ action process item activ loan task undertaken librarian actor task model base semant action action trigger precondit input resourc state busi rule postcondit resourc move requir state result creat loan composit action accept reject loan rule languag augment action specif express hydra complex loan busi model effect develop featur decomposit process structur number view project busi process conceptu structur process action inform system broader inform system narrow view motiv level adopt integr object type select refin level action chosen result commun member ifip wg task group bodi commiss creat framework inform system concept loan borrow item creat loan item set loan loan item set loan return item item set item set loan order repair action task item activ figur oper busi model librari defin behaviour aspect object type defin event trigger state transit perform retriev event process base eca languag categori object type defin domain object type normal object refin busi inform object type view object type aggreg domain object type interact point point deriv action involv human view object type trigger event domain object classifi applic transact user object type simul trigger event view object type busi number view process event structur process analysi design demonstr busi level applic design map area difficulti domain object type busi model map conceptu model view user object type busi model map extern model relat busi model exist process structur restrict suitabl techniqu busi domain basic treatment interact extern environ interact client understood intern execut task task form context action trigger includ extern model level provid abstract process class refer spawn work base theori adopt recent commun model techniqu demo method pattern perform actor deriv interact structur commun unit essenti transact request busi result action essenti final fact state result action actor initi termin executor actor termin initi execut essenti actor gener plan involv commun inform action actor order fulfil essenti action interact structur appli extern transact initi executor extern actor intern transact initi executor intern actor busi interfac transact initi extern actor executor intern actor commun model develop build transact type interact structur includ detail data behaviour model develop definit execut commun rule perform carri actor behaviour specif appli actor object type advantag demo li basi busi process redesign mechan method applic li busi process execut path infrequ highli fluctuat difficult document oper procedur domain cscw benefit demo term essenti qualifi process possibl support class busi process address overhead remain uncertain impact detail design level limit summari find assess structur process model model structur process model structur process model techniqu provid process analysi data flow store provid integr data model techniqu simpl gener set concept featur decomposit applic type domain higher level model easi comprehend adapt busi domain definit aspect process structur model basic aspect busi process model indic insuffici busi suitabl lowest level focu detail process integr restrict express power procedur style forc imper approach specif behaviour process model process execut depend consid process sequenc implicit modul design map major lack formal ambigu inaccuraci process model model techniqu object structur behaviour object cite motiv occur object type domain integr advoc easili object lifecycl defin object type domain object interact case busi higher level context user case model requir extens necessit formal evid formal semant found survei techniqu resolut difficult design complex object aggreg method classif higher level model intuit gener inhibit busi larg class busi rule object lifecycl conceptu specif languag requir augment eca specif behaviour process model behaviour aspect process model fundament concern execut depend control flow includ parallel process featur greater semant busi process captur graphic oper petri net develop behaviour process model techniqu model valid execut state process model approach process class busi rule impact graphic process model clutter basic specif strategi allevi includ conceptu specif languag detail specif formal petri net formal formal semant defin algebra system process provid altern mechan definit formal semant model techniqu conceptu model defin busi suitabl achiev align concept process structur provis process requir qualiti express formal foundat inherit classic techniqu techniqu cater diverg set busi necessarili complet set busi construct techniqu busi model integr specif model refin busi model formal semant model relat close busi model structur depend model busi model violat principl techniqu focu commun synthesi actor lead essenti insight busi process redesign busi suitabl principl diagnosi busi suitabl workflow model present recal section attent confin busi process amen strict oper procedur busi servic busi process essenti compon busi process highli requir care model distinct discuss common problem elicit busi suitabl allevi list principl ffl ffl scenario valid ffl servic inform hide ffl cognit suffici ffl execut resili problem relat relationship busi model conceptu model adapt classic techniqu construct leav room arbitrari relationship incorpor busi model lead situat process structur prescrib essenti structur conceptu model hierarch busi model violat principl lead inflex design observ task action map directli object method design specif legitim situat modul design composit possibl drawn multipl point abstract reflect busi level busi task exist task composit serv design avoid principl principl techniqu emb concept conceptu directli element principl prescrib busi model state model concept backtrack element form depend model busi model replac busi model permit model consist requir consist preclud mechan network decomposit busi task composit permit process design scenario valid problem stem observ techniqu partial valid model valid concern ensur conceptu model model busi domain valid partial support evid valid mechan partial draw concept unifi cognit suitabl techniqu import factor model evid survei integr strategi offer advantag classic techniqu observ trigger sourc extern event trace execut path model techniqu result process execut sequenc determin implicitli structur process model explicitli behaviour process model valid execut path advanc behaviour process model construct process sequenc appli object interact high object state sequenc accord object appli object interact low clear process structur commun provid focal unit busi process common theme model valid notion event discret point event trigger actor execut busi inform possibl invok process environ busi result initi event defin motiv execut path final event final event signifi termin repres recognit process proce execut path refer scenario model valid principl principl scenario valid techniqu provid explicit notion scenario model valid principl exclud form model valid constraint data model requir form support techniqu point scenario systemat mean execut path lead part conceptu valid follow scenario provid effect complet check partial model check issu scenario obviou choic notion busi drawn perspect busi transact concern exchang servic busi transact fundament unit determin busi transact cost requir understand process undertaken simpl involv low small set event busi process complex involv tempor larg set event busi typic involv multipl choic busi servic busi transact scenario arbitrari term tend interchang research distinct lead prefer busi transact busi servic client requir busi transact scenario result concept busi transact artefact unifi concept workflow design implement busi transact workflow state understood class busi transact involv execut exclud scope paper servic inform hide problem li relationship busi process busi servic event trigger process execut ultim intent number event relat intent busi intent denot busi servic classic model explicit servic concept exist busi servic dealt arbitrari fashion process model techniqu servic qualifi event descript directli trigger process exampl similarli event directli trigger method object type figur techniqu adapt classic treatment busi servic arbitrari busi servic relat busi process trigger relat directli busi process common problem approach direct trigger process context trigger point view environ part actual busi process trigger busi servic request formul request request issu busi servic result intern mechan determin action implic process actual request affect paragraph reflect inform hide principl modul design requir intern aspect modul insul modul appli techniqu treatment busi servic servic concept explicitli support coordin execut number process insul servic request gener principl principl servic inform hide techniqu formul servic request independ actual process cognit suffici fourth problem fairli gener diagnosi address miss construct techniqu yield collect suffici cognit busi process busi transact model fundament area varianc discuss process model cognit process model techniqu observ incorpor essenti structur behaviour pragmat theoret diagnosi present base compar differ assess techniqu advantag model cognit level abstract process model view deriv process structur data flow set attribut valu identifi data store object state identifi repositori data ground appar process behaviour combin structur process decomposit notion data store structur process behaviour altogeth omit process sequenc defin part softwar design map structur behaviour aspect process model serv distinctli aspect analysi data store transform structur aspect lead understand data busi process data store redesign common pattern data flow process type process depend number data store data transform function data reloc process parallel behaviour lead understand process depend problem starvat identifi execut path process strategi defin combin simultan requir busi process reengin requir suffici captur understand busi transact semant hci area cognit insuffici hci human comput issu appar point hci requir dialogu determin design classic evid discuss process object model hci determin part system design applic typic encapsul determin intuit conceptu model remark lead backtrack specif difficult busi model case actor type deriv hci point commun dialogu hci system design includ understood tempor aspect treatment tempor aspect partial impact time busi domain structur analysi symbol introduc time trigger end week featur time trigger incorpor event specif languag object extend concern express power express time function variabl discuss hydra precondit survei techniqu deal time demonstr incorpor time action dynam constraint object type specif clear incorpor tempor aspect relat specif process precondit time import motiv event schedul requir qualifi process depend number process requir execut time simultan time durat process execut repeatedli time period condit satisfi interest note formal specif languag specif languag process algebra petri net base approach address tempor aspect process specif tradit domain system tempor evid busi domain law matter schedul design avail requir document request durat prior court hear principl cognit suffici techniqu provid suffici cognit model fundament busi process execut assumpt elimin execut resili problem relat error handl conceptu level conceptu constraint process defin error free state specif verifi elimin erron specif oper error occur control librari exist item categori oper borrow miss enrol confirm requir time initi student system crash exampl oper error result process failur sound busi transact semant requir oper error handl evid assess techniqu explicit express power deal error exampl techniqu error handl process defin scan problemat object state error handl process fire result object transit problemat state treatment failur recent subject workflow implement specif tradit transact model recent acid properti isol extend workflow execut semant tradit transact bind set oper atom unit execut requir failur transact commit execut success requir concurr execut transact effect execut order workflow complex structur tradit unaccept failur task result rollback entir workflow applic transact model typic relax survei acid failur atom defin task involv possibl execut possibl task execut commit task commit updat data object task transact updat logic undo updat provid notif updat invalid task fail lack explicit support oper error handl indic tradit develop approach prefer treatment implement level amount detail check deadlock error code updat determin retri oper error handl inher part busi transact semant aspect relat cognit suffici normal execut oper error handl relat execut resili semant repeatedli partial aspect distort understand busi transact semant support model execut larg number mean execut resili valid conceptu level disjoint oper error handl present separ layer preserv model gener cognit model execut consid critic principl principl execut resili techniqu support handl oper resili execut conceptu model result support address workflow execut resili execut resili oper happen gener problem conceptu model techniqu haven proven invalu earli critic phase analysi design navig analysi implement specif essenti insight aspect busi techniqu demonstr express formal foundat busi suitabl absenc theori meant techniqu technic effect newer insight obtain practic function platform expand make difficult assess adequaci techniqu support sound busi domain focu paper busi suitabl workflow model class busi process natur amen strict oper procedur approach gener capabl techniqu characterist paradigm assess gener requir extent workflow scale busi suitabl busi process busi servic busi process combin provid insight opinion busi suitabl principl formul gener assess find gener assess classic process object offer gener concept featur applic type domain differ cognit depend integr strategi data flow transform process control depend describ flow busi process data object state transit event impact busi process object lifecycl deal object number techniqu incorpor form express power conspicu assess techniqu tend weak petri net base tend weak clutter adequ formal formal notabl absent techniqu ambigu applic turn make imposs prove properti model absenc correct check workflow specif section strike model adapt combin classic techniqu context busi incorpor busi incorpor busi model essenti busi model concept busi process actor actor unit resourc integr specif environ tool requir engin method approach adopt decomposit process structur automat applic design map demonstr compar classic techniqu recent techniqu abstract process structur human basi understand busi process form detail aspect workflow interact extent applic class busi process consid clear busi suitabl principl detail diagnosi busi suitabl led identif principl ffl hierarch decomposit busi model model result violat principl essenti structur model prescrib hierarch decomposit process distinct process provid techniqu abstract hierarch decomposit replac principl simpli requir link direct element busi level impact level ffl inher busi process execut sequenc occur time durat intent scenario import provid domain semant model support scenario absent classic present process structur techniqu explicit support defin scenario valid principl notion busi qualifi busi servic busi process scenario trigger busi servic subsequ includ busi process busi servic result satisfact constitut busi essenti scenario concept ffl relat techniqu directli potenti lead knowledg process requir formul servic request violat inform hide principl allevi servic inform hide principl defin servic request complet insul subsequ trigger put servic coordin process execut ffl gener omiss identifi restrict cognit busi transact model support structur data behaviour control aspect process final partial support tempor aspect consid process support erron assumpt result cognit suffici principl defin ensur fundament assumpt elimin ffl oper error occur control techniqu express power support type oper error handl handl oper failur consid crucial workflow explicit support provid techniqu context busi process semant lost model valid execut bypass oper error execut resili principl defin ensur oper error conceptu model execut resili address execut resili ultim busi suitabl principl address import salient aspect conceptu model focuss diagnosi aspect busi class busi intend implement model base workflow concept aspect busi domain requir busi process conceptu level diagnosi impart relev tradit implement model describ prescrib seek posit work effect develop major benefit li assess attent drawn gener area defici encount overcom clear enhanc techniqu requir simultan conceptu model requir larg number contribut advoc synthet analyt approach develop techniqu benefit li insight gain workflow involv global access collabor applic servic clear separ busi busi process busi transact improv conceptu model reach implic workflow specif languag descript languag open distribut architectur futur work deal develop kernel concept featur workflow model line principl refer ai wm pott goal decomposit scenario analysi busi process reengin sixth intern confer advanc inform system volum lectur note comput page june de inform system develop explor idea practic comput april ja real time process algebra formal aspect ja softwar process model busi reengin inform system develop decentr organ ifip work august chapman hall sb navath conceptu design approach benjamin redwood houghton booch design applic benjamin redwood bot environ support problem solv phd delft inform system model phd fp brook jr silver essenc accid softwar engin ieee april benyon tool kit system analyst comput pd van der weid semant data flow diagram intern confer manag chakravarthi make dbm design implement evalu prototyp intern confer extend technolog april pn ha proper gener model conceptu model technic report accept public data knowledg depart comput juli electron analysi davi softwar analysi specif englewood dur bot dynam model organ simul rl hg intern work confer dynam model inform page elsevi scienc publish structur analysi system specif englewood busi model busi redesign intern confer system page august van ahm ter support tool integr dialogu specif norman van fourth intern workshop page decemb ieee comput scienc press gb davi mh olson manag inform conceptu structur develop de antonelli pernici specif refin level data knowledg april de antonelli model event applic design vldb page august conceptu model applic extend er model data knowledg dw rb sn oo system isnt ieee juli ed editor framework inform system concept report ifip wg task group august structur analysi develop compat acm ada flore jj speak offic support issu challeng welsh support cooper work process survei system issu technic report depart comput june net petri central model advanc petri net part volum lectur note comput page sheth overview workflow process model workflow autom infrastructur distribut parallel april grai editor transact concept techniqu morgan san jj van editor concept terminolog conceptu schema inform base publ nr structur system tool techniqu ist dougla st theori commun reason ration volum boston beacon hammer dont harvard busi april jan lee methodolog construct predic transit net specif softwar practic august ahm ter er task structur semant process algebra softwar engin januari ahm ter inform model data intens domain phd ahm ter ha van der weid formal definit conceptu languag descript manipul inform model inform octob km van lj execut specif distribut inform system ed inform system page je hopcroft jd ullman introduct automata languag comput ahm ter van der weid express conceptu data model data knowledg februari deriv complex structur object type busi process model intern confer entityrelationship lectur note comput page unit decemb van oo softwar case driven approach jensen colour petri high level languag system design analysi advanc petri net volum lectur note comput page editor modern object kung behaviour network model conceptu inform model inform nilsson inform system develop systemat approach englewood loucopoulo model process design design intern journal cooper inform januari integr rule base tempor reason effect inform system journal inform februari kind softwar novemb vj strategi architectur ibm system jl method system design journal appli system tw ig hg van aa inform system framework understand al taxonomi model concept inform lf object flow formal framework describ dynam destruct interact complex object elmasri intern confer entiti relationship page jl peterson petri net theori model system englewood gj integr object execut specif framework busi analysi inform system design phd model design englewood richter petri net tw hg aa inform system design compar page petri introduct monograph theoret comput scienc rodden survei cscw system interact richter offic model integr inform resourc advanc petri volum lectur note comput page jr searl speech essai philosophi languag cambridg integr methodolog function process design design inform structur analysi design compat acm ada synthesi design product structur analysi softwar engin page sc el jone simpl complet heurist transform data flow diagram booch style diagram acm ada march ch kung structur behaviour model realiti tb steel jr semant page sj system model world data ci loucopoulo time dimens conceptu model inform pac integr inform system design approach base concept petri net phd eindhoven aa gj model integr inform plan tool fourth intern confer advanc inform system volum lectur note comput page unit dg white process technolog support cooper prospect design issu cscw introduct case page unit modern structur analysi englewood salient featur execut specif languag environ ieee transact softwar
HCI/250 4 scalabl infrastructur semant web servic mario michael stefan decker wolfgang nejdl stanford abstract semant web servic combin semant web web servic aim provid mean automat discov semant web servic network carri search perman reconfigur network ideal infrastructur deploi network semant web servic provid network evolv unorgan manner suffer scalabl limit number node creat network overload push search time unaccept limit address problem determinist shape graph topolog effici broadcast provid effici topolog construct mainten algorithm crucial symmetr requir central server super node network show scheme made effici global ontolog determin organ peer graph effici search introduct semant web servic combin semant web research effort web servic world web servic technolog make semant web servic semant web technolog make servic descript tool ontolog describ semant web servic order autom discoveri composit servic current web servic infrastructur focu central approach servic descript store central repositori queri order discov servic central system introduc singl point network vulner malici attack make leav germani leav germani full semant web servic capabl central system scale gracefulli larg number servic difficulti sever evolv trend ubiquit comput devic entiti servic servic network extrem dynam due constantli arriv depart servic provid present approach enhanc capabl semant web servic dynam search capabl network address major problem face deploi network scale larg number peer search time network load estim complet success rate search network current network ineffici broadcast mechan search techniqu arriv effici infrastructur organ peer network graph structur base hypercub topolog describ paper show global ontolog partit network topolog concept cluster queri enabl network answer queri consist logic combin ontolog concept semant web servic ontolog describ infrastructur prove fit larg dynam servic network section describ graph topolog suitabl effici broadcast search section present distribut algorithm capabl maintain graph structur elabor algorithm detail section extend infrastructur describ ontolog partit network deal relat work section conclud section hypercub topolog scale network larg number peer maintain properti low network diamet requir control evolut network topolog peer join departur organ peer network hypercub topolog organ peer hypercub graph figur depict hypercub base topolog studi area multiprocessor machin assumpt complet hypercub graph consist node defin fact node essenti number dimens span cube figur cube network defin shortest path distant node term node structur node incorpor promin posit crucial load balanc node sourc broadcast root span tree load share equal topolog redund connect minimum number node remov order partit equal node network easili partit bring highli connect node network denial servic hypercub topolog vulner attack hypercub base chosen adjust network diamet node figur hypercub topolog note point construct algorithm section work node number equal complet number peer network describ topolog graph state definit deal hypercub binari base breviti extens base edg graph node dub node node neighbor dimens figur node node node dub neighbor dimens edg graph node node extend neighbor term neighbor link denot sequenc follow complet hypercub graph reach node node vice versa neighbor link set lead node node link graph order step path link set carri edg label start maximum neighbor dimens node term node network maintain set determin locat graph set neighbor link set ω set node address neighbor identifi link set reach send messag address addr broadcast search algorithm base defin broadcast scheme set node strictli forward node receiv messag messag requir reach node topolog node reach forward step node origin broadcast satisfi crucial requir algorithm work node invok broadcast send broadcast messag tag dimens messag node receiv messag restrict forward messag link higher dimens refer serial notat network graph figur link depict copi link figur notat arriv full node send broadcast node node receiv messag link tag dimens forward messag node receiv messag dimens link forward node forward node relai messag node characterist path length scheme calcul log log log broadcast restrict broadcast messag forward dimens dimens build maintain hypercub graph outlin distribut algorithm node build hypercub topolog major challeng network maintain network crucial node network accept integr node network join leav network consum reason amount messag transmiss limit traffic transport network join node regist node protocol beat messag number node join remov topolog construct mainten algorithm formal descript algorithm proof complet found walk peer join peer leav elabor basic idea construct mainten algorithm construct mainten algorithm base notion node evolv hypercub graph posit hypercub idea hypercub topolog biggest complet hypercub graph implicitli present current topolog set particip node arriv complet hypercub topolog unfold remov node jump cover posit cover node left prepar give posit node join complet hypercub topolog implicitli broadcast search algorithm chang peer receiv broadcast messag figur network topolog construct start peer activ step peer contact node join network peer integr peer neighbor peer establish link tag neighbor set peer integr join peer neighbor neighbor dimens order lower neighbor dimens step peer contact peer assum contact peer join network neighbor dimens peer maintain peer peer open dimens depict figur peer integr control node complet integr peer provid peer link end integr peer neighbor link connect exist neighbor order carri complet broadcast peer provid peer peer peer peer select peer peer peer temporari peer peer peer neighbor neighbor dimens peer cover posit act occupi posit depict thin copi peer figur mark link peer temporari tag link set link set denot path peer posit link set origin aim peer peer cover posit path visibl figur temporari link set construct rule step peer join network compar peer contact peer join network case peer contact peer peer gener rule integr peer neighbor dimens peer peer cover temporari posit peer maintain peer pass link posit peer due construct rule edg label temporari link peer determin link peer link pass peer peer establish link tag link set peer depict figur case peer contact peer peer decid integr peer carri integr peer cover posit occupi peer integr control forward peer peer peer note peer network reach node forward control hop prove peer carri integr arriv figur case peer contact peer peer integr peer neighbor dimens open dimens hypercub lead hypercub peer maintain link hypercub long run network burst join peer structur balanc long run inform posit structur spread join peer contact network peer posit inher balanc graph initi balanc peer integr peer select random posit hypercub rout section perform posit encount walk integr posit compar join scenario explor specif join scheme breviti step figur network topolog construct ii step peer arriv contact peer network cross threshold hypercub dimens accommod dimens open peer integr peer neighbor dimens peer neighbor dimens peer peer peer peer link provid neighbor peer peer act temporari peer peer act temporari peer link set peer figur figur show exist peer network bold style posit cover thin style note posit cover peer determin temporari connect peer edg label figur demonstr basic peer posit hypercub structur chosen cover mean peer highest neighbor dimens posit cover complic case peer cover peer cover power set neighbor dimens refer find detail peer ad dimens graph mean multipl exist peer integr link neighbor dimens tag exist link link peer exist link step peer contact integr newli arriv peer peer lack peer integr posit peer rid link peer move peer peer final link stai peer maintain link peer peer temporari link peer lack final found peer figur network topolog construct iii step assum peer suddenli leav network mainten oblig carri peer remov decid exist peer chosen posit peer leav posit origin posit graph node cover multipl posit find successor posit graph peer peer establish temporari link neighbor peer peer figur show distribut cover figur depict link structur network state step peer contact peer decid integr posit cover peer peer forward integr control peer step temporari link peer origin belong posit peer restor pass peer peer integr peer arriv figur note step join peer contact peer network graph structur peer maintain temporari link step peer contact peer lead peer integr peer figur depict state posit complet hypercub graph dimens held activ peer cover posit hypercub figur network topolog construct iv peer join network work turn protocol deal simultan node join departur implement protocol infrastructur step integr peer peer push link arriv complet hypercub topolog link failur link failur network lead departur send depart messag topolog recov head back normal state hypercub recov sudden node loss procedur base axiom found detail node closest vanish node term metric call graph hop distanc dimens order comput distanc posit contact vanish neighbor neighbor node carri node departur routin behalf vanish node procedur chang messag complex section complex assum balanc graph algorithm yield complex term messag order join leav network hold node graph neighbor dimens note number node graph arriv complex algorithm optim explain detail section exact edg label temporari link store reconstruct miss neighbor dimens peer peer leav network integr hypercub dimens open integr addit peer happen step inform broadcast peer network propag node commun issu remov integr peer network reach larg number node scale small number node long place section higher neighbor dimens ad construct process remov peer network neighbor dimens inform broadcast network local infer peer observ set neighbor link set maintain altern topolog construct algorithm section capabl build graph belong special class graph construct topolog construct hypercub found hypercub belong class star graph star graph exhibit properti asymptot superior hypercub scale larger number node network diamet star graph hypercub network scale million node broadcast carri optim manner figur star graph rout empow network featur good scalabl search time case semant web applic semant web addit knowledg improv network inform servic peer provid categor belong gener concept concept turn organ ontolog defin relationship exist concept describ role ontolog plai domain semant web servic improv search properti network build hypercub graph show organ network queri logic combin ontolog concept search restrict peer support combin ontolog semant web servic ontolog share formal conceptu state popular definit semant ontolog assign commonli semant interpret concept semant web servic ontolog augment servic ontolog domain ontolog servic ontolog concept stand basic type retail deliveri servic figur domain ontolog concept specif domain web servic type locat domain car classifi brand type car figur car retail web servic describ combin concept servic ontolog concept car domain assumpt servic descript regard exhaust vocabulari provid ontolog semant web research effort spawn result design distribut negoti ontolog creat servic domain domain semant web servic network organ servic network issu queri peer potenti answer queri queri broadcast peer bui interest truck broadcast introduc concept cluster hypercub network topolog section peer ident similar interest servic group concept cluster turn assign specif logic combin ontolog concept describ peer belong cluster deliveri web servic bui retail sell truck motor vehicl passeng vehicl figur servic ontolog domain ontolog concept cluster organ hypercub topolog enabl rout specif concept cluster topolog concept cluster hypercub star graph peer hypercub topolog carri address concaten set concept coordin set storag coordin concept coordin coordin address concept cluster hypercub set structur concept chosen build hypercub section structur concept ontolog describ web servic particip servic domain ontolog select structur concept repres singl ontolog coordin binari concept cluster address reflect support peer address concept cluster respect structur concept network organ concept concept cluster peer offer deliveri servic address ontolog coordin vector storag coordin concept cluster peer addit address space accommod multipl peer concept cluster storag coordin denot locat peer specif concept cluster select storag topolog concept cluster form hypercub intern topolog base star graph graph topolog star graph concept cluster expect scale larg number node section concaten concept storag coordin form logic address peer rout broadcast queri network work rout queri propag concept cluster peer queri aim broadcast carri concept optim forward queri peer cluster involv rout van concept coordin system restrict broadcast concept storag coordin system queri answer queri minim queri issu peer undergo logic minim identifi logic structur structur concept point concept structur concept denot group concept cluster essenti care support structur structur concept support forc queri forward respect concept concept cluster point singl direct neighbor network topolog figur depict concept hypercub network organ structur concept ontolog figur queri consist peer servic combin retail deliveri servic analysi distinct resembl distinct group concept cluster network copi queri messag deliv enabl carri broadcast group ham distanc group overlap adjac figur depict concept hypercub creat concept structur concept node network repres concept cluster node repres concept cluster peer motor vehicl queri group concept highlight figur figur concept hypercub topolog rout concept cluster concept cluster span queri inform carri intern broadcast peer copi broadcast messag deliv concept cluster address queri queri span group concept accomplish carri restrict broadcast concept coordin system figur depict broadcast step execut order inform concept cluster address queri broadcast algorithm modifi algorithm section concept cluster group set dimens exist concept broadcast carri dimens branch addit dimens peer belong adjac peer belong order start broadcast messag reach peer concept cluster group achiev rout queri peer closest peer group rout hypercub binari address binari address carri correct address bit rout step forward shortest path node figur rout concept coordin broadcast concept cluster inform concept cluster broadcast queri messag member peer broadcast carri storag coordin restrict peer belong broadcast concept cluster optim broadcast scheme section exist star permit storag topolog concept cluster peer feedback queri messag arriv peer react messag contact queri order establish busi relationship topolog construct peer join topolog contact peer network peer reveal capabl term concept global integr concept cluster match descript peer describ concept structur concept integr specif concept cluster peer support concept integr concept cluster consist peer support concept structur concept figur determin concept cluster peer join messag rout peer rout contact peer integr peer concept cluster algorithm section select concept servic domain ontolog structur address space concept hypercub concept combin common address structur concept chosen empir expect partit network concept cluster balanc manner desir defin algorithm capabl dynam construct concept algorithm dynam good structur concept base current concept distribut network investig problem relat work make network scalabl recent receiv attent distribut hash tabl approach chord aim enforc determinist content distribut rout point queri similar term messag complex join depart approach specif perform optim network load broadcast requir hash detail logic combin ontolog concept construct effici provid mean cluster peer similar capabl build semant servic web infrastructur central approach autom composit verif semant web servic address build servic descript framework present topolog effici cluster peer network featur effici broadcast search algorithm messag overhead logarithm network resili node failur super peer central server requir set global ontolog categor peer provid servic effici rout broadcast queri organ peer manner enhanc semant web servic technolog flexibl dynam network ensur scalabl larg number node refer model symmetr interconnect network ieee transact vol april crespo rout indic system proc confer distribut comput juli websit ho optimum broadcast person commun hypercub ieee transact vol sept martin al semant markup web servic white build low diamet network proc annual ieee sympo foundat comput nejdl al network infrastructur base rdf hawaii karp shenker scalabl network proc acm august tc semant web servic ieee intellig system special issu semant web nejdl shape network technic stanford june rout algorithm open question proc intern workshop march al scalabl lookup servic internet applic proc acm august project innov collabor white technic white paper uschold method applic knowledg engin
AI/251 2 mobil robot approach rang data world navig plan william armstrong brant depart comput alberta edmonton abstract abstract mobil design built test approach stereo world data map reinforc learn navig plan singl camera captur depth inform advantag camera movement main thrust approach replac depend grid point space techniqu linear function techniqu scale complex environ mobil map reinforc learn acknowledg research support defenc research establish grate scientif author dr simon barton guidanc travel support natur scienc engin research council canada kyle palmer design multithread softwar architectur thoma ron design calibr softwar gratefulli acknowledg mobil robot approach rang data world navig plan abstract abstract mobil design built test approach stereo world data map reinforc learn navig plan singl camera captur depth inform advantag camera movement main thrust approach replac depend grid point space techniqu linear function techniqu scale complex environ mobil map reinforc learn introduct prototyp mobil built demonstr stereo depth captur paradigm world reinforc learn navig plan object design vision system capabl acquir model unknown environ suffici navig sonar sensor accur moravec laser rang finder highli calibr stereo system applic robot creat model includ mine likelihood damag robot intellig children toi manifest behavior similar live pet shown figur consist mobil base video camera mount direct percept unit commun extern comput tether link pentium pro comput imag process data fusion dual pentium ii comput reinforc learn navig plan project major research suggest investig parametr altern approach world model map suggest investig approach fuse rang base linear explor reinforc navig reinforc learn accomplish linear regress present initi implement techniqu report result achiev section describ hardwar softwar architectur vision part project subsequ section discuss idea occup rang data fusion map extract reinforc learn techniqu featur world model figur plan discuss summari result conclud paper robot architectur design navig unknown environ navig determin point horizont ffl observ block ffl observ ffl goal locat goal robot requir continu goal watch determin move move suggest softwar architectur call architectur robot repeat cycl drive architectur consist main modul modul vision execut imag process vision task robot scan environ calcul depth featur locat obtain modul captur imag meteor video card control accomplish commun initi custom object dcom permit control remot comput develop imag librari augment imag code modul consist vision understand path plan vision depth data fuse occup model world built polygon area navig extract model list obstacl point explor point deriv polygon list ad previou list locat perform path plan path planner comput suggest direct robot move path planner implement separ piec softwar permit function simul mode test reinforc learn path planner commun vision understand submodul driver modul file synchron messag provid commun overhead aid debug send motion command robot perform consist check output planner limit distanc move move base vision data commun robot motion base control object dcom remot parallel develop user network modul activ cycl robot navig cycl repeat robot close goal microsoft visual mfc softwar develop softwar run microsoft describ compon detail singl camera stereo meteor video card imag librari imag grab process gener sequenc colour imag preprocess averag filter produc pixel imag depth acquisit lower resolut imag camera mount arm cm long shown figur observ part world floor height top robot depth acquisit order acquir depth inform environ singl procedur pixel high intens deriv vertic direct select featur make depth acquisit world model featur imag featur track grab camera move vertic match obtain match error calcul vector obtain window size featur build world model discard filter approxim half featur final distanc remain featur calcul minim distanc point rai argmin normal unit vector move frame camera determin posit featur frame rotat matrix translat vector camera describ motion frame move depth acquisit focal length camera calcul advanc vanish point techniqu minut fifteen pan posit camera observ environ construct depth map confid depth data warp video imag vari intens uniform surfac concern distort result imperfect track match depth valu major uncertainti depth estim limit resolut camera analysi match quantiz error order build sensor model data fusion sensor model assign level confid call data regist sensor evid obtain match error eq appli evid ae constant defin robust track approach resembl produc evid rang fuse rang data disregard margin featur al jen murrai make select featur observ middl evid high achiev adjust angl pan rotat techniqu depth calcul incorrectli approxim featur error elimin data fusion goal sought check imag frame exist pattern store memori mil function oper effici occup world model recent research produc fundament paradigm world model mobil metric geometr topolog research approach origin develop build recent extend build model world al occup function occ map point world interv higher valu point occupi approach superior approach simplic repres maintain world model current involv grid point store major bottleneck grid occup requir huge amount memori restrict main obstacl build occup world model requir updat million voxel rai view order build model room reduc amount repres occup function rule updat occup state grid bayesian rule rule execut independ opinion pool rule al rule jen murrai amount time updat state grid piec rang data requir updat grid voxel rai view occup model world ineffici navig difficult deal arrai search path navig research suggest parametr model place grid model altern repres occup function linear function defin space repres evid occup evid empti function drop point inform surfac object extract model fix level model desir properti storag process scale size complex environ grow parametr formul build occup function regress problem set sampl point valu occup occ find approxim underli function input domain regress tool adapt logic network thoma realiz function variabl tree maxima minima appli linear function variabl techniqu techniqu fit linear surfac sampl data result fit call produc linear continu function variabl figur linear piec function split piec error sampl activ piec exce level elimin prespecifi architectur depth tree number linear function leav determin limit train predefin number iter sampl data predefin error error root squar error squar approach suscept extra care rid outlier imag process stage learn algorithm modifi improv outlier reject build sensor model rang data evid valu regist rang occup inform point rai view inform sensor assign point evid occ point occupi figur show typic sensor model point close observ featur environ valu evid occ close valu close express sensor model train data grid base function defin sensor model shown figur built assign occup valu grid cell ly rai view approach function effici repres linear piec figur order achiev gener incorpor train data small number sampl point deriv regist point sensor regist point distanc confid occ train set point creat shown figur evid occ account error depth evid lower occ correspond occup valu rai sampl point approxim function linear surfac min max min min max linear function kei figur approxim function linear surfac center robot evid equal order deal absenc knowledg occupi occup function postprocess valu threshold set discontinu fashion step omit world model map extract chang coordin monoton condit introduc coordin system pan angl ff height rel level centr distanc centr figur make assumpt creat occup function environ singl robot locat assum occup function strongli monoton coeffici linear function partial deriv linear function coeffici restrict minimum node combin piec produc continu entir function strongli monoton put upper lower bound chang occup respect pan angl height correspond assumpt larg depth featur occur defin pan angl height error acquisit suggest gradual appar deriv polygon robot navig prefer monoton spheric coordin system world coordin system assumpt advantag local priori knowledg reduc amount train data occ rai view occ figur monoton chang coordin function occ obtain function occ map build effici approxim vertic wall horizont surfac final suit shape robot field determin depth accuraci extract map navig occup model world construct tree minima maxima linear function determin polygon safe robot navig occup function area occup level occ threshold consid unoccupi navig order find step invert occup function return distanc safe move function pan height occup theoret due strong monoton condit learn occup function criterion occup set upper bound occup invert function occup input comput robot move direct encount occup produc tree base occup function effici invert construct origin maximum node replac minimum minimum node maximum origin weight normal weight output variabl multipli constant output variabl simplic speed major advantag robot navig comput navig polygon occup written occ occup fix occ appli valu height find longest distanc robot move convert horizont distanc illustr figur result comput set polygon obtain height centr robot current posit upper lower bound train weight pan height distanc linear finit set height valu point robot height collid point environ occup shape robot final step calcul polygon local map area navig consist shrink polygon size robot intersect area ensur bodi robot straight line point insid intersect polygon polygon boundari robot suscept error result absenc depth data error depth estim led distanc peripheri polygon robot distanc polygon point lie circl radiu occup environ circl obstacl explor point point navig polygon lie insid bound circl repres obstacl obstacl point defin evenli space angl angular sector obstacl occur point neg reinforc valu robot hit obstacl point navig polygon peripheri meter circl repres point knowledg environ data collect collect explor point defin evenli space angl sector navig polygon li circl densiti explor point chosen adequ find channel robot observ current robot posit explor point posit reinforc encourag robot move explor point reinforc learn reinforc learn occur system past action satisfactori inform determin futur action recent book barto introduct reinforc learn model system state time action enter state receiv reinforc model state reinforc determinist function current state action polici specifi action state polici develop account reinforc receiv result action time receiv subsequ action polici polici determin action reinforc sequenc futur action measur present futur reinforc discount reinforc defin fl action fl refer function simpli function polici optim polici produc greatest discount reinforc system achiev futur action start state bellman equat max state result appli action state appli reinforc learn navig similar work murrai thrun thrun state system posit robot reinforc result action determin state close goal close point requir close obstacl situat give rise posit close obstacl lead neg reinforc solv bellman equat rise function repres potenti robot attract explor point repel obstacl learn approxim grow tree act linear function train algorithm adapt weight linear function split linear piec error piec tree grow input gener linear piec form function found search branch lesser input chosen node minimum node branch greater input chosen node maximum node train adapt weight linear piec refin procedur join linear piec quadrat split linear piec occup function map box space real function linear piec space polyhedra function reinforc learn coordin robot perform reinforc function learn comput train valu valu express bellman equat defin target function state left control polici train complet arg max result action speedup comput achiev linear function approxim linear piec influenc comput input point evalu exact set piec evalu intract good heurist solut make approach reinforc learn candid applic demonstr learn complic balanc armstrong li balanc move horizont plane reinforc learn navig function give local reward defin sum reward arriv state deriv obstacl explor point locat obstacl point reward function neighborhood obstacl graph shape cone centr obstacl point cone radii idea give gentl robot close obstacl point contribut obstacl reward function ob ob jj type fix apex type rate chang distanc paramet determin height shape cone recal function explor point reward exp exp jj constant goal point similar reward goal goal sum contribut obstacl point explor point goal planner reward step solv bellman equat state randomli chosen area open navig robot fix number action appli state direct motion real direct sampl sampl maximum function repres train estim state access finit number applic action gave rise function approxim state optim polici properti make suitabl approxim function discuss fix number evalu determin train solv bellman develop algorithm comput maximum infinit number base idea made number piec finit reinforc robot direct move obtain maxim gradient function result test area surround wall cover cloth provid featur figur show gui run vision comput robot cycl finish gui consist window window displai depth inform acquir robot scan project floor robot grab cloth distanc calcul frame window show occup model world point occup higher shown project floor circular data due uniform sampl coordin system window show navig polygon extract occup function figur user interfac cut circl radiu fourth window log displai inform number featur number epoch train number linear surfac build occup function gui show current state system voltag current robot power suppli robot navig collect summari result observ ffl move camera prove good acquir rang data robot build local model afford flexibl ffl occup describ world tree maxima minima act linear function variabl show valid altern cumbersom arrai grid state ffl result fuse data fit techniqu depend set adhoc main number linear piec simpl gener shape environ permit extract inform navig ffl extract local navig map prove effici fast easi function ffl reinforc learn fast bellman equat robot posit system accept environ navig videotap prepar show success oper robot scan featur defin depth scan locat reinforc learn path plan system comput suggest motion acknowledg research support refer techniqu reinforc learn control ieee conf man ieee cat adapt logic network handbook neural section iop publish oxford isbn reinforc learn appli simul balanc proc int symp neural sept dynam program princeton press histogram map mobil robot obstacl avoid ieee journal robot vol pp stereo vision base map navig mobil robot proc ieee intern confer robot robust regress outlier detect york geometr comput machin vision oxford press neural function approxim reinforc learn handbook neural comput section robot evid grid carnegi mellon robot institut technic report plan mobil robot uncertainti int robot vol pp robot spatial percept stereoscop vision evid grid evidenti approach probabilist reason uncertainti robot intern pp probabilist model dynam environ proc ieee int conf robot page nm reinforc learn introduct mit integr topolog map mobil robot navig nation confer artifici pp approach learn mobil robot navig robot autonom learn map indoor mobil robot navig ai journal mobil robot explor continu local ieee intern confer robot belgium
Agents/252 1 page gener collabor negoti jennif sandra carberri depart comput inform scienc delawar de usa abstract collabor plan agent autonom inevit conflict belief plan process case conflict relev task agent engag collabor negoti attempt squar discrep belief paper present comput strategi detect conflict belief engag collabor negoti resolv conflict warrant resolut model capabl select effect aspect address pursuit conflict resolut case multipl conflict select evid justifi modif captur negoti process cycl model successfulli handl negoti subdialogu introduct collabor consult consult execut agent collabor develop plan achiev execut agent domain goal agent inevit conflict belief plan process collabor agent attempt squar conflict engag collabor negoti determin constitut share plan action share belief collabor negoti differ negoti argument attitud collabor agent act benefit agent materi base work support nation scienc foundat grant group face collabor agent automat reject belief evalu belief evid provid adopt belief evid convinc evalu agent maintain origin attempt provid suffici justif convinc agent adopt belief belief relev task hand paper present model engag collabor negoti resolv conflict agent belief domain knowledg model detect conflict belief initi negoti subdialogu conflict relev current select effect aspect address pursuit conflict resolut multipl conflict select evid justifi system modif user captur negoti process cycl enabl system handl negoti subdialogu relat work research studi analysi gener argument agent engag argument dialogu sole interest win argument exhibit behavior collabor agent sidner formul artifici languag model collabor work descript gener strategi agent involv collabor interact webber joshi note import cooper system provid support identifi strategi system adopt justifi criteria strategi select walker method determin includ option warrant justifi claim base factor commun infer cost memori retriev model determin includ redund model determin justif claim convinc select evid system privat belief support claim al logan introduc idea util belief mechan predict set evid suffici chang user exist belief gener inform retriev dialogu librari domain argu librari dialogu case negoti extend initi belief conflict page analysi consult dialogu sri show domain conflict resolut extend singl exchang conflict emploi model collabor captur extend negoti repres structur system deal singl model select focu pursuit conflict resolut multipl conflict provid process select multipl piec evid featur collabor negoti collabor negoti occur conflict agent develop share plan collabor plan collabor agent driven goal plan satisfi interest agent maxim interest result distinct featur collabor collabor agent insist win chang belief agent present convinc justif belief differenti collabor negoti argument agent involv collabor negoti open honest present inform present inform mislead strateg hold back inform agent distinguish collabor negoti negoti labor negoti collabor agent interest notion share plan belief order decid belief agreement agent involv argument negoti agent belief find weak point oppon belief attack win argument earlier built sidner sequenc develop model captur collabor plan process cycl action model view collabor plan agent set action belief incorpor share plan agent evalu determin accept agent set modif origin modif evalu conflict modif bs result process research case multipl conflict agent identifi part unaccept address select evid support modif paper extend work incorpor modif process strategi determin aspect agent address pursuit conflict mean select evid justifi modif gener collabor negoti order captur agent intent convei model collabor negoti util enhanc version dialogu model repres current statu interact enhanc dialogu model domain level consist domain plan construct user level action perform construct domain belief level consist mutual belief pursu plan process order level commun action initi achiev mutual belief paper evalu modif detail strategi engag collabor negoti evalu belief system maintain set belief domain user belief belief strength repres agent confid hold belief model strength belief explicit record factor affect certainti hypothesi logan base semant utter convei level agent convei stereotyp belief level dialogu model consist mutual belief agent action agent belief support evid set belief repres belief belief repres child node intend support repres parent root node belief tree contribut action affect domain plan develop set newli system decid accept initi negoti dialogu resolv conflict evalu belief start leaf node belief tree accept piec evid affect accept parent belief intend support process continu belief evalu conflict resolut strategi invok belief accept collabor agent belief relev domain plan irrelev evid belief determin accept belief evidenti evalu construct evid set system evid support attack bel evid accept system user support bel piec evid belief bel evidenti relationship bel walker weakest link assumpt strength evid weaker strength belief strength evidenti relationship evalu emploi simplifi version gallier belief mechan logan compar strength evid support attack bel strength set evid strongli outweigh accept reject bel easili made differ strength exce detail model determin accept belief rank support belief level level dr smith teach ai dr smith sabbat year figur belief level evalu insuffici inform determin adopt bel initi subdialogu share inform user knowledg user origin user convinc support belief negat held system adopt belief resolv conflict negoti illustr evalu dr smith teach ai semest dr smith teach ai sabbat year figur show belief level dialogu model captur utter belief evalu process start belief leaf node belief system gather evid pertain includ warrant belief dr smith postpon sabbat warrant belief dr smith postpon sabbat support belief sabbat year strong belief dr smith visitor ibm year warrant belief dr smith visitor ibm strength belief classifi base belief year support belief sabbat year dr smith express desir spend sabbat belief mechan invok determin system belief base system evid user statement belief constitut warrant piec evid belief belief constitut strong piec evid system accept system believ sabbat impli faculti member teach evidenti relationship accept system accept system prior belief contrari express utter evid provid user implic accept modifi unaccept collabor plan principl suggest provid evid detect discrep belief agent detect relev notifi agent conflict initi negoti subdialogu resolv fail collabor agent captur attempt resolv conflict action goal modifi form potenti accept agent appli belief belief evidenti relationship accept figur show actual modif applic condit action invok believ node accept believ belief repres collabor actual modif perform node accept conflict resolv captur recip templat perform action applic condit perform bodi applic condit condit satisfi order action reason agent achiev unsatisfi precondit decomposit appl special appl figur recip applic condit precondit attempt satisfi precondit system post mutual belief achiev belief node lead system adopt action chang initi collabor negoti subdialogu select focu modif multipl conflict system user user system identifi aspect focu pursuit conflict resolut case select special system determin paramet node instanti goal modif process resolv agent conflict unaccept belief system provid evid belief address unaccept evid user elimin user justif collabor agent expect engag effect effici system address unaccept belief predict quickli resolv conflict unaccept process select focu modif involv identifi candid foci tree belief select subdialogu consid interrupt walker walker initi negoti truth piec inform utter classifi interrupt includ negoti gener modifi clarif subdialogu contend part evalu process focu candid foci tree heurist resolv conflict candid foci tree piec evid belief tree chang user view unaccept belief root node belief identifi perform search belief tree node belief evidenti relationship parent examin belief relationship accept search current branch system accept irrelev accept user support belief piec evid includ candid foci tree system continu search evid belief tree support unaccept belief evidenti relationship candid foci tree system select focu modif base likelihood choic chang user belief belief figur show algorithm select process unaccept belief belief support annot bel focu modif set belief bel predict system evid bel determin attack bel support evid elimin user reason hold attack bel evalu effect attack evid system determin successfulli refut piec evid system believ suffici evid convinc user piec evid effect attack evid support algorithm appli evid support bel accept system algorithm annot unaccept belief evidenti relationship support bel focu modif bel system evid bel bel focu belief select address order chang user belief bel nil system predict insuffici evid chang user belief bel base inform obtain step decid attack evid support bel prefer address unaccept system belief user evid pertain bel system evid bel bel leaf node candid foci bel return return select focu bel children candid foci bel accept bel bel bel accept bel bel bel bel attack evid bel attack bel bel bel unaccept user evid bel bel focu check address bel unaccept evid suffici bel user unaccept evid system refut reject bel bel focu check address bel suffici bel system evid bel user reject bel check address bel unaccept evid suffici bel bel focu bel nil figur select focu modif mckeown rule suggest continu newli introduc topic prefer return previou topic algorithm consid attack user support bel suffici convinc bel gather evid user direct support bel accept system system predict successfulli refut bel focu algorithm user chang mind belief predict affect user belief bel user predict accept bel algorithm invok select minimum subset unaccept belief focu modif union focu belief minimum subset attack evid bel suffici convinc user algorithm check directli attack bel accomplish goal provid evid directli bel predict focu modif bel directli attack bel predict algorithm consid effect attack bel unaccept evid combin previou predict process combin evid predict system suffici evid chang user view focu modif bel nil notic step algorithm invok make belief mechan discuss section predict user accept unaccept bel base system knowledg user belief evid present result set user belief modifi order chang user belief unaccept belief negat belief post system mutual belief achiev order perform modifi action select justif claim studi commun social psycholog shown evid improv messag reynold research quantiti evid optim amount evid consist effect grice maxim quantiti specifi contribut inform requir import collabor agent select suffici evid justifi intend mutual belief convinc user system select justif identifi belief collabor agent reject strong evid agent suffici inform determin accept initi subdialogu share inform agent reevalu research determin focu modif reject belief nil collabor dialogu walker shown import redund effici leav includ futur work support bel appli filter heurist system determin justif bel predict inform user bel suffici convinc bel justif present justif predict system construct justif chain support bel piec evid directli support system predict user accept evid justif user predict accept piec evid system augment evid present user post evid mutual belief select proposit serv justif result process return chain belief justif support bel set belief form justif chain system select set belief chain present predict convinc user bel system construct singleton set justif chain select set justif predict convinc user bel singl justif chain predict suffici chang user set construct combin singl justif select process repeat produc set candid justif heurist appli select heurist prefer evid system confid evid produc attitud chang evid form system justifi belief high confid user accept heurist prefer evid studi shown evid unknown hearer heurist base grice maxim quantiti prefer justif chain fewest belief evalu dialogu model figur invok belief accept select focu system identifi candid foci tree invok algorithm belief root node candid foci tree candid foci tree ident belief tree figur belief evid reject evalu process focu modif evidenti relationship appli algorithm invok determin focu modifi child belief figur system piec evid warrant piec evid strong piec evid evid predict suffici chang user belief focu modif special invok focu modif order satisfi precondit post mutual belief achiev user warrant belief semant form utter system predict inform user intend mutual belief suffici chang select justif piec evid support present earlier system predict piec evid combin mutual belief suffici chang user filter heurist appli heurist system select evid system confid system establish mutual belief attempt satisfi precondit system invok inform action gener dr smith sabbat year postpon sabbat user accept system satisfi precondit conflict perform made origin belief user justif system believ evidenti relationship complet infer held stereotyp user system result negoti subdialogu paper present comput strategi engag collabor negoti squar conflict agent belief model captur featur specif collabor negoti support effect effici dialogu identifi focu modif base predict success resolv conflict belief heurist motiv research social psycholog select set evid justifi modif belief captur collabor negoti cycl evalu modif process appli captur negoti subdialogu acknowledg discuss candi stephani kathi develop work comment anonym review prepar final version paper refer jame allen structur train project darpa speech natur languag workshop lawrenc rod ai model argument nation confer artifici page julia brian steven karen sparck jone belief unifi framework agent interact ninth biennial confer societi studi artifici intellig simul page jennif sandra carberri model gener collabor dialogu twelfth nation confer artifici page jennif sandra carberri gener subdialogu consult intern joint confer artifici intellig jennif model gener collabor consult dialogu phd delawar forthcom paul cohen heurist reason artifici intellig approach pitman publish compani robin cohen analyz structur argument comput columbia transcript transcript deriv made columbia ny provid kathleen mckeown julia gallier autonom belief commun belief cambridg press paul grice logic peter cole jerri syntax semant speech page academ york barbara grosz candac sidner plan intent chapter page mit press dale refin cognit model involv group score western journal speech joshi mutual belief system nv mutual chapter page academ press lynn lambert sandra carberri model dialogu annual meet associ comput page brian steven julia karen sparck jone belief dialogu manag inform retriev technic report comput laboratori joseph jame effect qualiti evid attitud chang sourc credibl southern speech commun mark mayburi commun act gener natur languag argument nation confer artifici page kathleen mckeown text gener strategi focu constraint gener natur languag text cambridg press donald morlei subject messag theori commun richard john effect involv argument quantiti central rout journal person social martha pollack model plan infer distinguish belief actor observ annual meet associ comput page alex argu plan altern intern confer comput page rachel model inform debat intern joint confer artifici page john empir studi effect statu fifti year research human commun rodnei reynold michael belief evid commun chapter page sage public candac sidner negoti collabor artifici languag cooper heterogen intellig page candac sidner artifici languag collabor negoti twelfth nation confer artifici page sri transcript transcript deriv made sri menlo ca prepar direct patti price katia sycara plan agent plan intern joint confer artifici page marilyn walker steve whittak mix initi investig segment annual meet associ comput page marilyn walker redund collabor dialogu intern confer comput page marilyn walker test collabor strategi intern confer comput linguist webber joshi initi natur languag data base justifi page steve whittak phil cue control dialogu annual meet associ comput page robert jr inform novelti role impress format journal social michael martha pollack principl plan sixteenth annual meet cognit scienc
DB/253 3 secur basi data secur abstract access permiss data manag separ world polici consequ slow wast administr work present treat export tabl part distribut main result control deriv product extend sql grant creat mechan provid sound infer theori deriv permiss tabl materi make system easier administ applic robust permiss construct suitabl view filter data parti introduct rosenth mitr corpor usa kei challeng data secur manag entir system coher sourc export store tabl view defin permiss satisfi restrict data updat quickli local concern evolv system demand extens administr peopl technic skill understand deriv busi skill balanc secur versu access critic problem automat coordin access sourc copyright paper belong author permiss copi fee part materi grant provid copi made distribut direct commerci advantag intern workshop design manag data june edward scior boston colleg mitr usa infer access local autonomi problem address system date dba manual access trust sourc appropri goal paper provid theori permit autom infer permiss minim learn curv administr amount softwar vendor implement separ theori requir vendor implement major administr learn execut task theori natur extens standard sql system redund deriv data capabl adapt gener mechan view exploit technolog gener queri overview result theori extend sql wai split notion permiss access inform access physic tabl inform permiss result consist appli replica deriv system physic permiss consist salari inform payrol clerk cost inform analyst run queri physic permiss effect separ concern set permiss evolv independ consist mean unambigu statement tabl tupl support polici condit base data scior invalid isol natur semant extens power infer mechan user execut queri user permiss tabl mention extend sql user execut queri user permiss depend comput wit extens reli queri rewrit capabl system determin system level rewrit capabl exploit rewrit vendor afford provid dare hope result practic attract vendor construct broaden creation view mutual suspici organ sourc reduc risk export view filter sensit data view creat grant user grant author mention tabl motiv defin extens view person trust grant permiss implement approach improv exist system wai meet goal notabl previou fewer mechan provid greater flexibl model author pass system support multipl layer data requir construct model aid system automat infer read privileg view provid rule determin queri data cube author grant onward provid normal view infer model view defin tabl layer view system boundari scope limit secur entail issu address industri progress design modul secur issu deriv partial solut broad rang requir deriv data facil complement modul handl issu queri role separ infer attack offload problem manag user set manag modul previou model includ authent author model recent industri trend tend pull capabl middlewar credenti control research read focu oper read remark similar infer theori work scope paper basic definit permiss subject abstract repres subject grant permiss grant explicitli ancestor group role hierarchi subject uniqu valid system explicit grant individu rare home object call belong sourc relat olap cube individu materi virtual refer tabl export sourc sourc tabl set oper sql paper focu oper read subject grant read permiss tabl access grant permiss grant read permiss subject mode permiss inform discuss section treat tabl view tabl export sourc view defin sql includ function write defin queri input queri object mention show denot queri black box opaqu code assum input set inform physic permiss mode permiss specifi inform permiss physic permiss subject access tabl inform physic permiss tabl paper address permiss exist partit physic system permit physic address scior permiss inform access oper op concern access physic inform polici appli span sourc system tabl unaffect creation redund copi interfac polici tabl unaffect creat mirror tabl extract site medic system inform polici assert subject assert role role assert correspond inform refer copi inform physic permiss author execut strategi singl physic resourc materi inform permiss physic permiss local autonomi physic resourc owner limit user paid corpor suspect physic permiss typic administ give user physic access tabl platform administ term finer granular exclud group role defin dbm vision secur administr giant distribut span platform manag impli permiss revok extend paramet distinguish difficult technic polit extend dbm capabl cope notifi grant revok deriv permiss suspect progress faster secur manag part system manag commun relev dbm permiss replic metadata replic deriv system grant ordinari sql permiss dbm creat inform physic permiss metadata manag metadata manag determin deriv permiss sql permiss grant deriv tabl subject sion grant revok permiss recomput challeng implement semant effici reliabl distribut heterogen dbmss altern implement human administr permiss infer permiss explicit grant directli author inform tabl deriv infer addit permiss section present theori determin impli permiss effect schema permiss infer understand easi autom earlier paper reli infer justif requir argument section simpler infer rule implement aid deriv track wit theori wit subject permiss execut queri queri express term tabl user explicit permiss tabl queri output tupl permiss impli exist queri permiss grant explicitli queri call wit impli permiss infer mechan permiss physic inform permiss interpret impli permiss depend mode impli inform permiss mean inform subject care inform permiss explicit materi view comput base tabl impli physic permiss assert exist comput physic permiss scior materi subject physic access subject queri tabl wit queri queri rewrit techniqu definit impli permiss requir system find wit queri theori queri matur numer research heavili exploit queri optim explor detail distract secur creat deriv data secur modul explor benefit exploit rewrit strategi larger set motiv exampl discuss issu involv queri rewrit view view substitut replac mention view queri definit infer subject permiss sourc permiss view view simpli altern interfac data current sql standard requir view user obtain explicit grant view semant queri user queri view sourc data underli irrelev queri result queri processor routin exploit integr constraint relat algebra rewrit queri simpler form join typic queri user permiss tabl join kei tabl referenti integr queri access field tabl perform join subject issu queri permiss tabl rewrit term subject access inform view permiss base tabl queri mention base tabl mention view system infer subject issu queri permiss execut model requir queri algorithm paper elabor push rewrit accept incomplet rewrit dbm vendor histor metadata manag low prioriti queri rewrit improv metadata access spend substanti sum exploit extend emploi materi spend monei pursuit perform gain queri hook queri process modul benchmark justifi permiss current system perform implement simpl view substitut strategi improv strategi power system minor goal complet set imposs due incomplet declar constraint oper rewrit gener rewrit problem undecid complet set give suboptim health care expert deserv permiss patient administ wit theori specifi inform permiss automat infer declar tabl section examin consequ benefit administr mode administr standard sql infer view privileg view defin view defin receiv intersect privileg input tabl view defin explicitli permiss view model infer inform permiss normal semant appli sourc administr tabl underli administ permiss grant combin mode rich secur model tightli coupl feder facil appli deriv data secur model data entiti object data aspect group manag neg permiss requir sort feder administr delet supplement permiss infer sourc featur area determin author check scior paper motiv complex deter major commerci implement area model fewer construct simul mode local autonomi addit mode sourc administr make read updat permiss infer view resembl infer includ infer privileg view defin base view statist receiv addit permiss underli sourc model dba physic permiss advanc receiv previou administr possess inform permiss possess sourc automat grant addit inform permiss mode joint approv permiss tabl achiev model grant physic permiss select mode grant inform model handl sourc administr grant export tabl deriv olap permiss rule wit theori work guid proper access permiss olap cube hierarch dimens sourc declar subject permiss view defin level dimens queri permiss wit deriv view permit level permiss access data finer granular filter data roll contrast system queri replac queri queri user access lead bad prefer suggest user queri suffici access comput local permiss queri issu test permiss refer issu sourc mean system popul permiss tabl theori wit determin subject entitl access tabl set subject author access set user wit found section show comput set basic idea set user author execut queri intersect user set input user set view determin union individu user set queri found system comput queri structur direct graph subexpress comput permiss tabl graph permiss predecessor graph bottom cycl deriv tabl horizont vertic develop algorithm handl gener case similar order larger constant factor gener case handl translat datalog view evalu permiss deriv draw part multipl organ draw inform hospit current sql organ grant administr read permiss export data defin administ tabl view combin inform person enjoi hospit offic negoti approach exploit view combin inform make sensit sourc stipul export data comput view sql maxim rewrit rewrit term sourc copi sourc permiss comput tabl definit uninterest grant select scior syntax administr input tabl grant select subject access view model requir trust comput view make inform trust site filter effect illustr requir skill softwar exampl give exampl comput view achiev view total larg set support studi provid cost data hospit cube dimens state entri hospit data hidden total defin view comput hospit grant read tabl elabor tabl detail hospit provid permiss detail inform inform comput hospit york citi feel suffici anonym includ defin total citi deriv hospit trust cost inform grant access raw cost data hospit trust softwar comput discard raw input trust hospit spoof reveal inform wai enabl individu hospit result detect intersect tabl track peopl enter countri intern flight peopl polic procedur examin row confidenti lost hospit state fill cost tabl entri oper effect reveal true cost tabl decid enter person fit descript person sought author access view defin select border author access arrest polic searcher travel give repres read author entir tabl give read access head agent airport intersect child parent hospit patient parent tabl surgeri valid patient surgeri record research studi surgeri creat view select surgeri current access tabl order creat view administr tabl give permiss tabl view illustr benefit automat infer research user access patient surgeri period run report applic execut view regul enact forbid access view defin select patient current report applic fail queri queri execut view detail semant permiss subject access view access input permiss mean permiss inform clearanc view valu contribut physic scior execut queri physic access comput straightforwardli extend wit semant section permiss impli permiss exist queri view object ti mention permiss explicitli permiss explicitli vi queri call wit impli permiss definit model exampl section consequ definit user receiv permiss input view permiss user access view trust grant underli tabl user view administr abil grant access permiss oper studi exampl requir complex multipl wit coordin extra complex permiss mode make practic develop futur paper summari futur work contribut greatest strength approach architectur locat compat relat technolog strongest result discoveri simpl concept separ physic theori permiss deriv data turn messi problem address technic complic obtain theori infer permiss explicitli assert built replac exist relat technolog approach determin permiss export tabl justifi grant user access tabl mechan view defin base tabl theori wit individu user underpin effici determin permiss grant store tabl sourc permiss infer complet automat effici infer process feasibl grant custom secur infer rule handl olap oper algebra rewrit rule provid queri optim show local autonomi preserv physic sacrif infer inform permiss capabl research subsum permiss enabl addit collabor mutual suspici organ open problem section describ open problem administr access permiss describ pragmat theoret biggest pragmat issu creation tool base user experi observ html environ manag metadata layer system identifi hole theori lack resourc grad student creat test real tool tool explor semant emb system manag environ coordin permiss relev dbm pragmat issu produc queri rewrit queri oper constraint construct dbmss compon infer big monei invest queri optim kei partli technic partli queri processor export rewrit function queri processor increasingli rewrit queri exploit materi view modif avoid explor multipl wit input set join avoid prune scior infer capabl oper describ sql express sql oper coalesc view tend product microsoft repositori identifi input object sourc user negoti permiss term role understand infer limit role group manag difficult task hope rapid progress driven task workflow model knowledg data deriv defin role understand benefit implement featur user view filter cycl view kind rewrit effect give user addit justifi theoret problem remain open effici algorithm infer permiss calculu access comput advanc permiss grant seek attach limit permiss onward grant limit predic deserv ad infer theori extend theori feder ordinari handl permiss updat oper research support permiss request origin top view infer permiss infer defin topdown updat view convent view multipl wai meet intent gener altern guid autom tool facil provid benefit administ distribut view minim complex dbm build replac sql facil contend data access modul deserv implement todai distribut rdbmss short distinguish physic inform grant access base rewrit easi implement sophist rewrit emploi predefin view elimin costli implement messag builder queri make queri rewrit facil rewrit invalu infer access permiss costli implement metadata refer repositori version open inform inform system de di author specif enforc feder journal comput vol pp de di mg autom deriv global author journal comput vol pp approach build secur secur submit public metadata administr deriv ifip work confer seattl grant revok ifip workshop august principl vol comput scienc rockvil instruct pennsylvania data scior
DB/254 3 achiev consist mobil local depart comput scienc mexico tech nm usa pano chrysanthi depart comput scienc pittsburgh pa usa abstract great potenti tradit transact support mobil comput environ ow inher limit mobil augment techniqu manag system approach focu challeng assur data consist approach local reformul global constraint enhanc autonomi mobil host show approach unifi techniqu maintain replic data method enforc polynomi inequ discuss local implement flexibl infrastructur transact process mobil environ introduct advanc number user mobil comput refer machin mobil host continu user discov excit develop wireless technolog potenti empow access remot inform user mh abil queri updat public privat corpor typic execut atom transact assur data consist reliabl spite concurr updat system failur transact support extend mobil user mobil comput robust stationari prone physic suffer limit batteri reduc storag author grate nsf support grant anonym review thought comment suggest wireless connect fix network disconnect terrain enclosur mh power commun subsystem save batteri life commun mh fail continu process argu make transact process challeng task basic problem mobil comput share data item fix satisfi integr constraint ensur correct share distribut span mobil comput local transact execut mobil access verifi hold end transact verif impli queri involv host longer invit problem distribut network distribut concurr control synchron remot data commit protocol minor matter accommod distribut dbm major problem mobil addit connect mobil ow unbound unpredict delai transact run mobil stationari unaccept extend transact manag data consist mainten cover disconnect mobil oper challeng address approach mh share global constraint aim give local constraint restrict origin tradeoff enhanc autonomi brought local reflect local transact remain unaccept delai discuss avoid process call reformul distribut constraint local constraint adjust dynam kind constraint base equal inequ local framework number dispar techniqu concurr control replic data base equal method demarc protocol linear inequ enabl hitherto unknown extens quadrat inequ conceptu framework local blend synergist architectur flexibl infrastructur transact process mobil oper environ cach data item mh continu execut transact disconnect stationari incorpor modifi data back stationari server reconnect occur cach data form encapsul object data state inform object call compact result local simpli fill compon compact enabl commit local transact practic system develop local approach assur realiz mobil environ rest paper structur present run introduc explain techniqu outlin local handl mobil comput common truck industri truck comput satellit radio link commun corpor bill gather data vehicl transmit fund directli driver truck compani accept contract move manufactur good sourc destin subcontract privat truck driver truck truck compani sourc pick final destin deliv truck arriv truck driver ship paper specif quantiti part pick pertin inform basi driver sourc good check meet attribut diamet toler motiv perform qualiti control avoid return unsatisfactori good process return costli term time monei truck mobil comput measur varianc metric accept good reject spot ad load truck merg sourc varianc merg collect toler constant capit load driver record date obtain signatur receiv parti label step bill ramif transact support consist mainten deliveri inform final mobil comput incorpor compani shortli disconnect postpon bill process assum qualiti control attribut uniformli distribut sourc truck observ mean varianc truck handl quantiti fraction good handl restrict lead constraint linear quadrat polynomi inequ variabl list tabl truck driver measur attempt verifi constraint access measur truck ow truck perform measur verif incur unpredict delai manifest inform made perman compani truck permit travel replic mobil comput quantiti materi truck replic comput quantiti chang mobil comput kr kr tabl pickup constraint good space compani consult truck deliv extra good truck made awar chang ad complex fact chang quantiti affect constraint truck disconnect chang process hold truck pickup process highlight salient featur flexibl infrastructur transact process mobil environ assum gener mobil comput environ network consist stationari mobil host special stationari host call mobil support station equip wireless commun capabl enabl mobil host connect fix network mh connect network specif mss complet disconnect goal process transact mh resort commun stationari server conveni absolut requir semant transact achiev replic cach data replic data form encapsul object call compact compact broadli satisfi request cach enhanc oblig method set state inform time consist rule unlik mobil compact activ object invok control transact manag compact support stationari mh compact manag act shield server mobil environ mobil manag commun flow compact common method oblig data state inform method consist rule figur compact object manag server compact agent mh mh send updat messag disconnect immedi reli mobil manag pursu updat behalf store acknowledg mobil compact agent negoti mobil manag act transact manag transact execut mh handl disconnect manag storag mh compact obtain server request mh fill immin anticip data request server compact manag creat compact data inform requir correct usag compact repres agreement server mh server deleg control data mh honor specif condit set server compact record compact store transmit mh request mh tailor increment transmiss transmit compact avoid mh mh receiv record compact registri compact agent track locat statu activ compact mobil host server compact redistribut resourc mh longer compact return server delet local compact registri compact store compact common interfac compact agent manag compact list compact registri perform updat submit transact run applic execut mh basic set method manag compact retriev inform compact state data cach free outstand transact perform oper compact behalf transact execut store current state compact make oper transact perman compact ultim server abandon transact modif compact compact mobil environ local transact paramet local elabor notion local assum data distribut node constraint local involv node distribut rule cn distribut constraint variabl quantifi conform rule horn denot left side rule suffici condit sc enforc enforc local constraint node distribut involv node variabl rule constant enforc local assur simultan enforc impli sc suffici local updat violat satisfi sc modifi sc accommod updat sc sc chang sc sc typic involv constraint achiev increment order synchron data distribut transact avoid sc increment changeabl sc sequenc constraint wn sc sequenc increment differ conjunct replac chang sc sc refer increment updat return truck observ violat reduc chang distribut transact truck increment updat sequenc sc sc note impli origin constraint origin constraint maintain order constraint truck truck result intermedi state satisfi substitut distribut constraint local constraint node dynam adjust increment updat remark cover properti node autonomi enhanc local transact node satisfi local constraint global constraint check unpredict delai avoid node chang local constraint constraint data satisfi satisfi truck increment updat sc node time possibl prescrib sequenc distribut transact commit protocol distribut concurr control make node follow sequenc correctli care simultan conflict desir constraint chang trivial algorithm ensur correct behavior condit result local compact ideal approach local constraint result data mh directli map compact hand mh constraint enforc analyz split tempor interv check infer data data encod tempor rang oblig expir current statu rw ro base data chang defin undefin defin nr data restrict encod consist rule illustr handl dynam replic state earlier data replic semant captur framework local increment updat shortag dwell techniqu logic item replica mh replica defin denot predic data item defin condit integr replica state condit part state time replica defin state defin replica note replica part constraint replica updat site data item share request time interv access free read item long order modifi obtain permiss give read access give permiss writer commun final server subsequ forward request global commit local updat special role server global constraint current share data valid durat mh local find suffici condit sc cn valid time increment updat follow mh initi request obtain creat replica current durat request permiss modifi replica durat overlap subsequ revert access durat final replica local constraint sequenc initi constraint time mh data satisfi constraint modifi mh permiss mh make request compact manag server mh permiss current chang constraint give permiss mh constraint modifi mh defin mh request standard mh write access chang mode constraint final set constraint mh modifi request mh mh constraint receiv request ks write transmit safe commit period server revert readonli mode durat server contact fail transmit final optim server request expir grant small durat extens transmit final global commit local commit updat manifest give replic data semant data item manifest truck chang quantiti materi load truck sequenc mh outlin effect compact readonli figur data base local increment rest assur compact manifest data fill requir stipul truck simpli maintain local constraint step satisfi global constraint compact addit method common tabl list constraint compact entri current statu function descript method commit cs nr ro rw ro updat stale current statu made nr oblig consist rule empti data undefin read result request manag server read state compact shown figur data defin current statu made ro time rang translat deadlin enter oblig field consist rule field left empti invoc modifi result request write access data defin current statu made rw commit local commit commit check transact updat local rw server global commit call made server notifi lead constraint revert current statu stale indic data current case data commun defin effect disconnect mobil environ disconnect delai acquir reader deadlin pass disconnect headach seeker writer unabl commun final write interv pass hold writer server substitut miss proce violat global constraint writer transact commit local global commit constraint violat possibl server assign default null writer deadlin pass attempt made write final mh obtain commun store expir deadlin mh write mh told notifi redo transact quantiti good target write request truck recal involv fraction coeffici polynomi constraint pickup server truck modifi chang accept truck pick good truck disconnect write commit global forc make pickup constraint satisfi origin truck write truck read wait read truck expir server truck make stale current truck fail contact server give read wait handl polynomi inequ discuss applic local distribut polynomi inequ constraint make geometr method pickup gener inequ constraint linear inequ variabl quadrat inequ variabl method demarc protocol shown linear inequ handl effici handl quadrat inequ product term convert linear illustr local increment updat approach constraint section establish approach care linear inequ basic manner demarc protocol ow constraint reformul extend linear quadrat form common geometr constraint xn repres real defin domain space cartesian coordin coordin geometr interpret datum xn satisfi point xn space find rn rang rn xn hand side left hand side suffici condit sc conjunct establish local beg question found left hand side defin rectangular subset local find maintain rectangl closer subset find mh charg maintain data rang project rectangl axi increment updat chang rectangl make intermedi rectangl geometr approach reduc rectangl manag present algorithm involv discuss exampl illustr method simpl linear resid mh correspond half plane line figur rule local lh rule suffici condit sc open rectangl ab insid half plane current data repres rectangl ab half plane local transact mh attempt greater violat local constraint global constraint correct rectangl chang ab mh bound mh bound note chang accept rectangl extend correct half plane constraint form descript appli figur manag linear inequ figur manag interior illustr geometr approach work quadrat constraint distribut constraint form indic region bound conic section parallel line analysi find interior find rectangl side parallel coordin insid interior repres rectangular subset seek figur show rectangl diagon ab project ax give local constraint local transact mh attempt chang greater local bound effect attempt move rectangl ab insid mh comput rectangl diagon cd project ax project local constraint restrict bound properti shrink rectangl qr inform mh bound enlarg rectangl cd rw figur compact varianc appli involv variabl rectangl project rectangl ax give independ bound variabl figur show compact truck oblig current entri consist bound bound intersect obtain constraint variabl machin base approxim revert dimens base accept common bound varianc constant reduc form base variabl appli verbatim excit advanc wireless technolog semiconductor thrown open possibl extend tradit manag function mobil comput environ examin problem maintain data consist execut transact mobil environ framework local framework base reformul global constraint conjunct local suffici condit enhanc autonomi mobil host mobil enjoi greater avoid unbound delai constraint limit data replic disconnect clear approach unifi techniqu maintain replic data method enforc polynomi inequ discuss approach implement flexibl infrastructur transact process mobil environ method map result local paramet compact basic unit data replic refer barbara demarc techniqu maintain linear arithmet constraint distribut system proc intl conf extend page recoveri perform atom commit protocol distribut system kumar recoveri manag system prentic chrysanthi transact process mobil comput environ proc ieee workshop advanc parallel distribut page global consist constraint consid harm proc intl workshop page grai effici toler mechan distribut file cach consist proc acm symposium oper system page maguir protocol mobil internetwork proc acm sigcomm symp architectur page satyanarayanan disconnect oper coda file system acm transact comput lloyd foundat logic program optim distribut integr constraint proc intl symp system advanc page yuan local class distribut geometr approach journal comput inform yuan local global geometr approach proc intl conf comput oneil transact method acm transact dynam adjust local constraint proc intl conf expert system pitoura data manag mobil comput kluwer academ ramamritham chrysanthi taxonomi correct criteria applic journal analyt geometri calculu chrysanthi manag mobil transact proc acm annual symposium appli page chrysanthi support mobil access person chrysanthi transact process proc acm annual symposium appli page
DB/255 3 march perform schema evolut sequenc claypool elk rundenstein comput scienc technic report seri worcest polytechn institut comput scienc depart institut massachusett optim perform schema evolut sequenc elk rundenstein depart comput scienc worcest polytechn institut ma abstract schema transform preval problem address accomplish migrat legaci system newer oodb gener structur web page data integr system nativ data model schema transform typic sequenc schema evolut oper execut sequenc possibl requir hour dai effect make unavail unaccept time span research defer execut approach schema evolut effort improv avail knowledg effort provid direct optim strategi sequenc heurist iter elimin cancel schema evolut primit merg modif primit perform effici transform pass addit show correct optim initi input optim output schema evolut sequenc produc final schema data state provid proof algorithm optim establish confluenc properti problem search show iter applic heurist termin converg uniqu minim sequenc valid feasibl optim approach implement optim chop top persist storag engin object server develop object design conduct studi demonstr perform gain achiev optim techniqu previou solut schema defer model schema optim work support part nsf grant industri ibm ibm partnership award informix softwar contribut special team gordon sam pat obrien object design softwar contribut provid custom patch system api develop tool introduct background schema evolut difficult schema complex applic worst applic requir typic chang time document extent schema evolut develop initi health manag system hospit number relat number relat schema chang period studi studi attribut report applic rang project real estat inventori account govern administr skill trade program studi reveal schema inevit task develop project project oper system todai support form schema evolut state art oodb evolut offer seamless chang manag provid transpar schema applic sourc file repres schema system objectstor user directli edit applic sourc leav oodb system handl propag schema system provid graphic user interfac user schema graphic system propag schema system deal advanc schema merg sequenc schema evolut primit system deal appli singl schema chang sequenc schema underli schema evolut remain process term system resourc consumpt unavail singl simpl schema evolut primit appli small object report minut current technolog specif schema sequenc perform system evolut cost larg possibl escal dai entir sequenc focu work provid improv execut sequenc schema evolut oper research defer execut schema evolut effort improv avail knowledg effort provid optim strategi sequenc prior execut approach orthogon exist defer execut strategi fact appli defer execut strategi chop approach motiv schema evolut oper modifi class definit object extent modifi class time perform schema modif schema evolut primit compar time modifi object zicari al time perform object transform larg determin time fetch flush page memori result zicari al optim call exploit principl schema evolut execut integr ffl minim number schema evolut oper sequenc cancel elimin redund schema evolut oper ffl optim execut merg schema evolut oper extent amort cost schema evolut schema zicari al comput time page memori neglig compar page fetch page flush time phone address student schema state phone address schema state ag add attribut class delet attribut class add class attribut list delet class input optim figur sampl sequenc schema evolut oper optim schema evolut sequenc figur schema state state net structur chang schema addit attribut ag class remov class student schema reduc sequenc oper optim sequenc oper achiev net structur chang perform observ oper merg add attribut oper elimin oper delet attribut redund entir class delet oper cancel direct oper reduc perform affect final state schema present gener strategi reduct sequenc schema evolut oper prior actual execut work base taxonomi schema evolut oper develop odmg object model easili appli object model address open issu ffl schema evolut optim function ffl control strategi appli local optim ffl algorithm complex heurist optim ffl cost model assess minim reduc schema evolut ffl global minimum contribut work make ffl formal analysi core properti schema evolut oper lead formal basi chop optim ffl chop optim chop optim strategi base includ local heurist optim function reduc sequenc schema evolut oper ffl proof correct prove optim sequenc chop optim appli schema result ident schema produc applic origin sequenc ffl confluenc theorem prove order applic chop optim function final optim output sequenc uniqu minim ffl chop implement prototyp develop chop optim base odmg standard proof feasibl ffl valid confirm optim strategi result averag perform save overhead optim algorithm neglig outlook rest paper organ section present relat work section present taxonomi schema evolut primit base analysi section formal schema evolut oper formal foundat optim section present actual optim function section describ combin form chop strategi section present evalu conclud section relat work current commerci oodb gemston objectstor provid schema evolut set schema evolut primit mechan global work schema evolut area optim decid modifi address concern effici avail defer execut strategi system maintain histori schema evolut oper class migrat object access user high avail amort cost object transform queri lookup optim appli sequenc schema evolut perform defer mechan deterior set queri object grow larger primarili optim updat complement defer mechan offer time save queri set object number schema evolut oper appli grow larger recent research begun focu issu support complex schema evolut oper studi design set complex oper compound type merg aspect discov transform sequenc map schema previou work provid framework user defin arbitrarili complex schema basic set evolut primit oql approach complex schema evolut transform base combin basic set schema evolut oper potenti benefit chop optim strategi schema evolut structur behavior inconsist zicari al navath al explor effect schema evolut method defin al softwar perspect term code transform schema evolut occur ozsu al develop model uniform semant behavior object explor behavior consist mention work focu correct individu schema evolut work problem optim sequenc schema evolut oper work import issu provid support exist applic depend applic chang share schema requir research address issu view version optim schema evolut execut sequenc oper system requir rippl possibl schema model remain background taxonomi schema evolut primit chop approach base object model present odmg standard odmg object model encompass commonli object model standard featur object portabl applic prototyp due space restrict discuss odmg object model reader refer odmg standard includ standard primit evolut design taxonomi schema evolut primit odmg object model borrow schema evolut primit data model taxonomi tabl complet set schema evolut primit subsum type schema chang taxonomi essenti set schema evolut primit updat schema object uniqu term descript capac effect add class schema augment delet class schema reduc renam class preserv add inherit edg augment delet inherit edg reduc add attribut type default class augment delet attribut class reduc renam attribut class preserv tabl taxonomi schema evolut primit schema evolut oper gener categor capac ad capac delet chang capac chang class schema evolut primit capac type shown column tabl formal foundat schema evolut sequenc analysi establish foundat optim principl develop formal schema evolut impact interact schema properti schema evolut oper paramet oper properti properti schema evolut oper defin basic relationship pair schema evolut oper tabl ffl oper irrespect paramet appli primit ffl effect oper cancel effect oper add attribut delet attribut ffl function function achiev part function effect achiev part function tabl show schema evolut oper odmg model relat oper properti oper relat independ exampl optim suffici categor schema evolut refer super super super super super super super super tabl classif oper properti schema evolut taxonomi tabl super oper base function import class oper perform context properti relationship schema element analysi present extend categor relationship exist schema element state odmg standard schema repositori assum schema repositori oodb system extract inform requir establish relationship odmg standard element schema repositori scope describ scope element properti class describ scope class relat relationship class inherit class class person class inherit class person odmg standard defin notion object base ident object extend notion element class scope ident ag ag introduc relationship class properti element element initi element map target element seri modif class class staff class translat class staff seri schema evolut primit summari distinguish kind relationship element schema ffl scope schema element ffl inherit schema element type class ffl ident class properti base uniqu scope ffl deriv schema element element seri modif relationship schema evolut oper sequenc present properti evolut oper schema element paramet combin formul basic condit optim function notat distinguish attribut clariti element relat properti regard relationship schema evolut oper schema evolut primit oper modifi schema element provid context combin oper properti context properti defin section develop criteria optim function appli schema evolut primit oper properti hold context properti scope show relat oper condit make elig effect cancel execut oper context properti suffici condit optim properti order schema evolut oper sequenc scenario suffici identifi paramet oper order satisfi establish ffl ffl scope ffl suffici cancel order order relev inform order paramet oper cancel oper identifi properti ffl order paramet ffl order paramet condit optim account rel posit oper sequenc da oper cancel state produc execut cancel sequenc case produc origin sequenc execut delet attribut object aa add attribut initi default object cancel sequenc preserv origin attribut valu attribut identifi properti oper relat ffl properti sequenc evolut oper oper prior oper specif oper depend properti depend schema evolut oper sequenc condit optim account depend oper exist oper sequenc oper fall categori cancel oper relat properti paramet scope optim cancel presenc produc schema state schema state produc origin sequenc lead depend criterion ffl depend properti schema element paramet oper consid optim refer oper oper sequenc chop optim function optim function definit optim function function context schema evolut oper sequenc oper pair schema evolut oper index posit index posit produc output oper sequenc index posit oper index posit set oper schema evolut primit tabl complex evolut oper defin section remaind assum optim awar sequenc belong respect index posit sequenc requir chop optim reduc number schema evolut oper sequenc final schema produc optim sequenc consist produc unoptim sequenc input schema optim function observ properti oper schema evolut oper consist schema preserv invari defin underli object model import properti optim function output preserv schema consist preserv invari defin object model definit optim function invari preserv invari preserv input sequenc produc output sequenc invari output sequenc includ complex oper broken schema evolut primit import properti optim function optim sequenc produc schema schema produc unoptim sequenc appli input schema definit state instanc schema denot ident schema content object identifi object relat symmetr instanc schema relat impli equal schema extend sequenc schema evolut oper definit sequenc schema evolut denot instanc produc applic sequenc input schema lemma properti sequenc schema evolut oper denot reflex transit prove transit symmetr order prove relat reflex sequenc schema evolut appli input schema produc output schema definit relat reflex symmetr assum sequenc schema evolut definit definit sequenc appli input schema produc schema schema produc definit hold definit relat symmetr transit assum sequenc schema evolut show hold definit transit properti relat definit definit state optim function preserv input optim function output produc optim function properti optim function kei properti defin correct criteria optim function optim function lemma lemma optim preserv output function output function appli input sequenc proof proof transit properti shown lemma definit transit lemma preserv discuss section order schema evolut oper respect sequenc relev applic optim function rel order oper sequenc defin respect index sequenc denot definit optim function preserv pair oper op op op op input output sequenc maintain rel order oper assum op op exist output sequenc base extend definit refin definit optim function definit optim function chop function defin definit definit preserv definit preserv definit chop defin optim elimin cancel op op replac complex oper op op index posit op merg optim function state section time perform schema evolut oper larg determin page fetch page flush time chop approach amort page fetch flush cost oper collect transform set object perform simultan collect schema evolut oper class affect set perform object transform oper page fetch flush call complex oper denot op op complex op op oper pair op term pair definit merg optim function input pair schema evolut primit produc output complex oper input oper complex op rel order complex oper op maintain output oper op input oper ffl context properti relat context paramet scope relat scope context context relat context context scope ffl depend properti hold input oper merg condit satisfi pair oper complex oper pair sequenc figur merg oper oper relat properti context paramet oper schema attribut ag ad class depend properti hold oper index posit oper complex oper schema evolut oper optim function appli primit schema evolut oper insid complex oper merg optim function appli insid complex oper lead infinit elimin optim function case optim merg merg execut make prior execut redund oper optim merg complet elimin reduc transform cost oper definit elimin optim function defin definit input pair schema evolut primit produc output input oper merg oper reli underli oodb system separ schema evolut oper schema chang schema repositori level object transform level ffl oper properti ffl context properti scope context paramet ffl depend properti hold sequenc figur oper elimin oper meet requir elimin cancel optim function scenario optim merg elimin schema evolut oper add attribut remov attribut cancel optim input schema evolut oper produc output empti oper definit cancel optim function definit input pair schema evolut primit produc output empti assum input oper ffl oper properti relat ffl context properti scope ffl properti oper ffl properti ffl depend properti hold sequenc figur oper cancel optim function properti optim function previou section present optim elimin cancel note condit merg optim function appli superset condit elimin cancel appli merg appli pair oper elimin cancel appli optim offer reduct pair schema evolut oper merg offer cancel offer optim function offer reduct desir show merg cancel elimin applic prevent applic cancel elimin iter applic function lemma order applic optim function merg cancel pair schema evolut oper directli appli cancel vice op op appli merg elimin pair schema evolut oper directli appli elimin vice op op condit cancel elimin appli mutual show fi op fi op fi op fi op assum cancel elimin success oper fi op merg cancel statement fi op fi op op definit merg optim function cancel function appli merg complex oper op fi op fi op fi op similarli merg elimin fi op fi op op definit merg optim function elimin function appli merg complex oper op fi op op fi op fi op op oper depend optim function import criteria success applic optim function depend properti section refer schema element paramet oper op op consid optim oper oper sequenc order pair oper select effect depend sequenc oper op op op pair op op immedi success optim pair requir remov depend oper op possibl appli optim function pair oper appli respect optim function pair op pair concern optim possibl op op appli optim function pair op reduc depend op optim pair op goal achiev maximum optim state lemma order select pair schema evolut oper sequenc optim function appli prevent achiev maximum optim proof proof induct base case base case input sequenc schema evolut oper op op op op fi op fi op evalu case case basi state lemma hold pair combin oper op op op assum pair op op op op consid depend pair op rest proof notat op denot pair op denot pair cancel op denot pair op elimin oper op ffl case op op depend op select order note case op exist optim longer denot pair op oper op case select order op op op op op op op op op op op op op case select order op op op op op op op op case select order pair schema evolut oper appli optim function shown irrelev ffl case op op op note op perform depend op remov order select optim case select order op op op op op op op op op op op op op op op op op op case select order op op op op op op op op op op op op op select order pair schema evolut oper optim result final sequenc ffl case select order op op op note op perform depend op remov order select optim case select order op op op op op op op op op op op op op op op op lemma op op op case select order op op op op op op op op op op op op op op select order pair optim irrelev final optim sequenc lemma appli merg cancel assur final result lemma ffl case op op similar case stipul order select pair irrelev case ffl case op op op pair op optim depend op remov primari order select case select order op op op op op op op op op op op op case select order op op op op op op op op op op op op op op select order pair optim irrelev final optim sequenc case order select pair oper optim prevent achiev final optim sequenc induct hypothesi assum input sequenc select order irrelev lemma sequenc oper final optim sequenc matter order appli optim function induct step input sequenc op fi op fi op prove select order irrelev lemma hold oper achiev final optim sequenc case ffl case op optim oper case order select pair irrelev base induct hypothesi subsequ element final sequenc obtain select order irrelev lemma hold ffl case op form pair oper op op largest index case case depend oper op op op op sequenc op optim optim pair op optim eventu immateri order select induct hypothesi subsequ left op length optim left subsequ op optim op independ select order irrelev properti hold case case depend oper op op op op sequenc op optim op op order pair pick simplist reduc base case op op base select order irrelev lemma hold order pair schema evolut oper select sequenc oper irrelev term obtain final optim sequenc chop optim strategi assum chop optim algorithm iter appli class optim function elimin cancel introduc section algorithm termin minim solut found introduc criteria minim optim heurist algorithm definit sequenc min minim pair schema evolut oper sequenc satisfi condit set optim function elimin optim function appli successfulli defin chop algorithm strategi continu appli optim function appli minim sequenc reach definit seri optim function cancel appli successfulli pair oper sequenc term function order lemma order output sequenc produc function order input sequenc proof proof induct definit function order combin success applic optim elimin function order fi fi fm base case base case output sequenc produc applic optim function function order optim function definit output sequenc produc individu optim function input sequenc schema evolut oper function order optim function induct hypothesi assum function order preserv properti optim fi fi fi fi output sequenc produc applic optim function function order induct function order optim fi fi fi fi statement optim function appli result function order fk fk produc applic optim definit fk induct hypothesi transit fk impli sequenc produc function order input sequenc definit function function order defin complet function order applic input sequenc yield minim sequenc min optim function reduc number oper sequenc compound complex oper undo effect maxim length complet function order length input sequenc potenti vast number complet function search space order select optim function order exponenti sequenc length number complet function order order select optim function order complet function order input sequenc tree applic optim function repres child node depth branch tree indic cost schema evolut heurist optim complet function order potenti base depth branch heurist base select number oper final output sequenc problem heurist select criteria cost search space import result work address limit find complet function order conform confluenc properti defin term rewrit system complet function order converg uniqu minim sequenc theorem input schema evolut complet function order produc minim result sequenc proof proof contradict fn fn complet function order appli input sequenc produc minim sequenc transit relat turn impli definit schema produc sequenc sn input output sequenc definit primit schema evolut oper complex oper op fi op fi op schema evolut oper complex oper denot length number oper sequenc worst case assum optim minim sequenc optim complet function produc minim result sequenc input case complet input sequenc reduc complet function order transit lemma produc net effect applic null optim assum oper extend result sequenc produc function averag case averag optim sequenc produc complet function order ffl produc definit output sequenc essenti schema evolut primit lemma assur schema evolut oper pair optim optim independ order pair select lemma assur final outcom irrelev intermedi sequenc sequenc length lemma sequenc permut ffl lemma scenario number oper sequenc optim function essenti set schema evolut assum schema evolut oper exist sequenc exist ae extra oper independ act part schema optim optim function minim function produc schema produc violat sequenc extra oper redund combin effect impli cancel elimin optim function appli sequenc impli sequenc optim contradict basic sequenc minim ffl argument hold order addit sequenc produc complet function order sequenc theorem reduc complex problem find optim output sequenc exponenti polynomi base simpl heurist discuss hard chosen output sequenc term execut perform output sequenc longer function order find optim minim sequenc chop optim simpli function order final output sequenc global minim chop implement chop requir implement chop assum featur provid underli oodb system list requir ffl persist chop requir oodb capabl store data object persist retriev featur essenti provid exist oodb system ffl build chop layer oodb requir oodb architectur modular facilit ffl modular schema evolut manag crucial requir chop effect schema evolut manag provid separ updat updat essenti merg optim hing capabl perform updat time updat chop hold back updat updat merg complex oper perform capabl control time updat se oper perform import requir oodb satisfi oodb provid capabl featur end expect featur easili provid api chop architectur figur gener architectur chop system layer top layer user interfac suppli user input form sequenc schema evolut oper middl layer correspond chop optim present bottom layer repres system compon expect underli oodb system provid implement platform pro run window nt underli oodb system pro persist storag engin written java run process java applic applet java client storag layer provid interfac store retriev persist object chop layer system layer object storag system user interfac applic layer chop manag chop executor chop optim schema evolut manag schema repositori schema updat manag object updat manag user input analysi execut schema evolut oper complex oper transform object chop control figur system architectur chop implement chop tool user input chop system sequenc schema evolut oper chop manag manag sequenc schema evolut access pair schema evolut oper input optim manag correct placement output schema evolut oper sequenc chop manag invok chop control incorpor control strategi control execut optim function sequenc chop control state default place output schema evolut oper index posit input oper index input oper set empti oper chop manag termin optim gener termin determin optim function appli successfulli pair schema evolut oper sequenc chop control invok optim function pass pair oper paramet invok function chop optim correctli appli optim function select chop control pair schema evolut oper encapsul notion complex schema evolut oper built chop executor control execut complex oper invok correct primit schema evolut manag oodb system compon schema evolut manag interfac execut set schema evolut primit section interact schema repositori built top pro detail actual implement found schema repositori inform class placement class hierarchi migrat object exist class definit chang class updat consist schema chang enhanc schema evolut manag separ process separ api schema updat object updat distinguish schema updat manag object updat manag perform updat class appli affect object valid conduct experi evalu potenti perform gain chop optim valid confluenc properti complet function order setup implement layer persist storag engin work base odmg object model built schema repositori dynam schema evolut facil odmg object model implement detail input chop system sequenc schema evolut oper set defin section result control strategi pick pair oper input sequenc base linear sequenc payrol schema shown figur basi build input sequenc schema evolut oper schema popul object class due lack avail benchmark typic sequenc schema evolut input sequenc randomli gener sequenc experi conduct pentium ram run linux baselin experi oper establish baselin experi perform test measur unoptim schema evolut process time test test measur time schema evolut process vari number attribut class test measur time requir schema evolut process number object class vari number object schema evolut oper constant figur show experi result add attribut oper extent size object figur show experi number object constant notic number attribut curv show time requir slightli slope result confirm number object minim effect gener trend attribut time variat slight deviat linear natur slope due system factor page occur size object grow test number attribut refer class constant figur measur cost perform schema evolut oper vari number object observ curv linear accord expect observ mail student professor instructor address grant faculti figur schema experi payrol schema literatur schema evolut process time class linearli number object affect schema chang schema evolut process time sequenc proport number object schema time se oper linearli number attribut refer class larger potenti larger save optim unoptim sequenc kei experi show strategi provid perform direct comparison perform optim unoptim sequenc limit sampl schema class attribut figur show optim unoptim se process time sequenc fix length input sequenc se optim sequenc se oper figur show curv se oper sequenc oper optim sequenc reduc singl complex oper schema evolut oper graph incorpor cost number attribut object figur se process time number attribut number attribut object figur se process time number attribut number object attribut figur se process time number object chop algorithm overhead origin sequenc number object optim sequenc figur sequenc execut time optim sequenc algorithm overhead sampl schema number object time ms origin sequenc optim sequenc figur sequenc execut time optim sequenc algorithm overhead sampl schema perform gain order estim perform gain chop measur execut time optim versu unoptim input sequenc set random input sequenc run chop produc respect minim sequenc encount sequenc reduc length length reduct figur show schema evolut process time output sequenc initi input length execut time sequenc uniform ratio number oper output sequenc optim length repres case sequenc optim length repres worst case chart figur show detail view worst case condit figur chop algorithm overhead time chop optim overhead neglig worst case condit loss term overhead case chop reduc input sequenc potenti perform save number object output length output length output length output length output length number class se input length figur sequenc time algorithm overhead input sequenc length sampl schema number object time ms output length overhead output length overhead output length overhead output length overhead class se input length figur worst case sequenc time algorithm overhead input sequenc length sampl schema averag optim perform gain achiev chop proport input sequenc schema evolut oper reduc length optim sequenc ratio initi sequenc versu reduc sequenc length figur show bar chart depict optim obtain randomli gener sequenc length number class schema vari graph depict distribut optim respect number schema evolut oper output sequenc length sequenc length equal number class schema evolut oper averag optim schema evolut oper spread larg number number class larger length sequenc schema evolut optim term reduct averag good observ averag optim diverg number class schema number schema evolut oper sequenc summari summari result present repres set experi detail experi refer found ffl se process time sequenc proport number object schema time se oper number attribut refer class larger potenti larger save ffl schema evolut process time linearli proport length evolut oper larger save ffl optim algorithm overhead neglig compar cost perform schema evolut oper optim offer solut system handl sequenc schema ffl optim number oper sequenc depend type major improv output sequenc length number sequenc class se input length figur number class sequenc length output sequenc length number sequenc output sequenc length distribut class sequenc length figur number class sequenc length ffl test object remov singl schema evolut oper class result time save ms time save directli proport number attribut extent size class offer huge save todai larger larger applic present optim strategi schema evolut sequenc chop minim schema evolut sequenc iter elimin cancel schema evolut primit hand merg modif primit hand import result work proof correct chop proof termin iter applic converg uniqu minim sequenc version system system implement present demo perform experi prototyp system demonstr perform gain achiev optim strategi random sequenc averag optim achiev chop optim initi develop oodb schema evolut analysi optim suggest paper appli domain data wareh optim schema report inform sourc complex transform queri schema evolut oper acknowledg author student system research group wpi interact feedback research grate prof georg review feedback jing subramanian input implement schema evolut support refer vianu foundat publish bertino view mechan int confer extend page march pl wl maintain behavior consist schema evolut intern symposium object technolog advanc page korth semant implement schema evolut page william gemston data manag system page acm advanc primit chang schema object confer advanc inform system page cattel al object odmg morgan kaufmann kt ea rundenstein oql odmg implement schema evolut framework centr advanc studi page novemb kt ea rundenstein schema evolut flexibl framework int conf inform knowledg page novemb zicari design integr consist checker object system page zicari correct lazi updat object system proc intl workshop persist object zicari implement lazi updat object system proc intl conf larg page rt zicari advanc system morgan termin confluenc properti disjoint condit rewrit system comput system system technic report technic report oodbm featur checklist rev decemb schema version system int confer system advanc applic page bs model compound type encount schema evolut technic report comput scienc march measur stabil data model european journal inform meyer appli ieee ma behavior schema evolut system int confer extend technolog page optim schema evolut oper sequenc master worcest polytechn june obrien make java object persist java object design objectstor user dml objectstor unix system object design decemb mt uniform behavior manag ea kt de gener facil demo session ea ra schema objectori inform ra rundenstein transpar schema evolut system base objectori view technolog ieee transact knowledg data septemb quantifi schema evolut inform softwar januari zdonik manag chang type proc page object technolog user manual object technolog refer version novemb novemb zicari primit schema updat comput standard page
IR/256 5 web mine survei raymond depart comput scienc katholiek universiteit leuven belgium hendrik blockeel depart comput scienc katholiek universiteit leuven belgium abstract huge amount inform world wide web fertil area data mine research web mine research cross road research research inform machin learn natur languag process lot compar research ort di erent point view survei research area web point regard usag term web mine suggest web mine categori situat research respect categori explor connect web mine categori relat agent paradigm focu learn applic recent work criteria conclud paper research issu keyword data inform inform extract introduct world wide web popular interact medium dissemin inform todai web dynam multimedia tempor issu due inform face inform overload inform user problem interact find relev peopl search servic speci inform web user search servic input simpl keyword queri queri list page rank base similar queri todai search tool problem rst problem low due irrelev search result result diculti nding relev inform problem low due inabl index inform web result diculti nding inform relev search engin problem creat knowledg inform problem regard problem problem process problem process presum collect web data extract potenti knowledg mine recent research util web knowledg base make person problem type present peopl di er content present prefer interact web inform provid encount achiev goal learn consum individu problem speci calli deal problem custom insid mass custom inform intend consum person individu problem relat ectiv web site design problem relat web mine techniqu solv inform overload problem directli indirectli claim web mine techniqu tool solv problem techniqu work di erent research inform retriev natur languag process web document direct approach applic web mine techniqu directli address problem newsgroup agent classi es relev user indirect approach web mine techniqu part bigger applic address problem web mine techniqu creat index term web search servic web mine research converg research area research ai research commun machin learn nlp paper attempt put research structur machin learn point view method research survei necessarili machin learn explor copyright acm juli volum issu page dynam research undoubtedli omiss coverag paper structur section give overview web describ usag term web provid classi relat classi cation agent paradigm section describ research repres rang research respect categori section discuss relat work nalli conclud section web mine overview web mine data mine techniqu automat discov extract inform web document servic area research huge todai partli due interest research tremend growth inform sourc web recent interest phenomenon partli creat constitut web mine compar research area similar etzioni suggest web mine resourc task retriev intend web document inform select automat select speci inform retriev web resourc automat discov gener pattern individu web site multipl site valid interpret mine pattern resourc nding process retriev data onlin text sourc web electron electron text content html document obtain remov html manual select web resourc includ text sourc origin access web access onlin text made research text inform select step kind transform process origin data retriev ir process transform kind mention remov stop aim obtain desir nding phrase train transform relat rst order logic step machin learn data mine techniqu typic gener note human plai import role inform knowledg discoveri process web web interact medium import valid interpret step interact knowledg discoveri import automat knowledg discoveri exclud knowledg discoveri manual human section process web mine refer process discov potenti unknown inform knowledg web data implicitli cover standard process knowledg discoveri simpli view web mine extens kdd appli web data kdd point inform knowledg term interchang close relationship data machin learn advanc data analysi discuss web mine research machin learn techniqu mine intrigu word good metaphor describ knowledg discoveri process peopl eld web mine ir web mine inform discoveri web ir web mine inform retriev claim resourc document discoveri web instanc web mine associ web mine intellig ir ir automat retriev relev document time retriev ir primari goal index text search document collect nowadai research ir includ document classi cation user data task consid instanc web mine web document classi cation index view web mine part ir process note index task data mine techniqu web mine inform extract goal transform collect ir inform readili digest analyz aim extract relev fact document ir aim select relev document interest structur ir view text document bag unord word gener work ner granular level ir document di erenc blur interest ir extract context vagu form inform full text ir system provid featur build system manual feasibl scalabl dynam medium web content due natur system focu speci web site extract machin learn data mine techniqu learn extract pattern rule web document automat web mine part process view relationship web mine exist result process form structur compress summari sigkdd explor copyright acm juli volum issu page origin text document view kind stage web mine step ir process data mine techniqu perform similar improv index part ir process argu instanc text web mine summari compress form document form inform exist advoc view web mine improv web mine part basic type unstructur text data di erenc system unstructur document structur document task unstructur natur languag text tradit typic basic slightli deeper linguist perform data mine classic tradit root nlp studi long time advanc research project agenc creat eld evalu separ arpa sponsor messag understand confer tipster project muc tipster competit environ seek improv ir technolog classic reli linguist syntact semant analysi classic call core languag technolog popular structur system extract inform semistructur document structur research di erent classic util html tag simpl syntact delimit insid data structur approach linguist constraint term wrapper induct structur system built manual knowledg engin exampl structur system web built automat machin learn techniqu algorithm build system manual longer exampl system built machin learn data mine learn extract rule annot corpora explan categori point interest reader survei paper classic issu unstructur text refer structur refer web mine machin learn appli web web mine learn web machin learn techniqu appli web applic machin learn appli web instanc web mine machin learn techniqu spider web ecient speci topic plan path method web mine machin learn method exampl proprietari algorithm mine hub author dataguid web schema discoveri close relationship research area machin learn techniqu support web mine appli process web mine recent research show appli machin learn techniqu improv text classi cation process compar tradit ir techniqu web mine intersect applic machin learn web web mine categori section give overview categori detail explan respect section similar al borg leven categor web mine area interest base part web web content web structur web usag mine web content mine describ discoveri inform web consist web content encompass broad rang data internet consist di erent type servic data sourc ftp usenet data port access web mention year growth amount govern inform tremend exist digit librari access web compani transform busi servic electron consequ compani resid legaci system port made access web custom access compani directli web base interfac consequ transform exist web applic user access applic web interfac applic system migrat web type applic emerg web environ web content data hidden index data gener dynam result queri resid dbmss privat web kind type data web content consist type data metadata hyperlink recent research mine multi type data term multimedia data mine multimedia data mine instanc web content mine line research receiv attent research text hypertext content web content data consist unstructur data free data html structur data data tabl gener html page web content data unstructur text data research appli data mine techniqu unstructur text term knowledg discoveri text text data mine text mine text mine instanc web content mine discuss text mine sigkdd explor copyright acm juli volum issu page section di erenti research web content mine di erent point ir db view goal web content mine ir view assist improv inform nding ltere inform user base infer solicit user pro goal web content mine db view model data web integr sophist queri keyword base search perform viewpoint discuss section web structur mine discov model underli link structur web model base topolog hyperlink descript link model categor web page gener inform similar relationship di erent web site web structur mine discov author site subject overview site subject point author web usag mine make data gener web surfer session behavior web content structur mine util real primari data web usag mine mine secondari data deriv interact user interact web web usag data includ data web server access proxi server browser user pro registr user session user bookmark click data result interact tabl overview web mine categori explan subsequ distinct categori web content mine util text link pro le infer input user user pro le user model applic person assist true web structur mine inform link addit link structur infer link document request user session log gener server categori point view scope work respect local scope span individu web site global scope span entir web scope web content mine ir view web structur mine global scope web content mine db view web usag mine local web mine task isol combin web content structur mine web document link chakrabarti al web content term document link neighborhood web structur link classifi web page joachim al web content usag build softwar tour agent assist user web site web mine agent paradigm web mine view implement tabl associ categori web mine agent paradigm lter content mine lter structur mine collabor lter usag mine lter usag mine hybrid lter combin categori agent paradigm web mine close relationship softwar agent intellig agent agent perform data mine task achiev goal al softwar user interfac distribut mobil agent softwar agent relev data mine task user interfac agent distribut agent user interfac agent maxim product current user interact system adapt behavior issu person abound user interfac agent classi ed web mine agent categori inform retriev inform ltere person assist agent distribut agent technolog concern problem solv group agent relev agent categori distribut agent knowledg discoveri data mine frequent approach develop intellig agent user retriev relev inform web collabor approach system search item match base analysi content user prefer collabor system user similar interest give recommend system analyz user pro le session transact assum user rate item user similar interest rate item high approach usag data view light categor method web content mine categor collabor approach web usag mine collabor approach combin web content similar view relat web mine categori exist softwar agent commun delgado classi es user interfac agent underli inform ltere technolog reput base collabor hybrid lter event base system track event infer sur ng habit peopl web exampl event save url bookmark click link make associ categori web mine categori tabl show associ web content mine section list research respect categori separ tabl note list mean complet explan method survei scope paper interest sigkdd explor copyright acm juli volum issu page tabl web mine categori web mine web content mine web structur mine web usag mine ir view db view view data unstructur semi structur link structur interact semi structur web site db main data text document hypertext document link structur server log hypertext document browser log bag graph graph relat tabl phrase relat graph concept ontolog relat method tfidf variant proprietari algorithm proprietari algorithm machin learn machin learn ilp statist statist associ rule associ rule applic categori categor find frequent substructur categor site manag cluster web site schema discoveri cluster market find extract rule user model find pattern text user model reader consult book mitchel respect paper explan method intend give tast varieti applic inform retriev view inform retriev view unstructur document tabl summar research unstructur document unstructur document free text stori research tabl bag word repres unstructur document bag word vector singl word found train corpu featur ignor sequenc word occur base statist singl word isol featur boolean word occur occur frequenc base word variat featur select includ remov infrequ stop word featur reduc appli featur select inform mutual cross odd ratio preprocess includ latent semant index seek transform origin document vector lower space analyz correl structur term document collect similar document share term stem reduc word morpholog root word stem common root word featur variat reduc featur set gener ectiv di erent domain text categor task doubt featur inform word posit document sequenc length morpholog phrase quick brown fox run document concept categori term interest hypernym term relationship dog hypernym entiti peopl email url relat tabl rst order languag express proposit logic instanc bag word featur frequenc speci relat relationship di erent word left word di erent type studi show clear advantag domain text categor task scott matwin compar di erent phrase found signi di erenc perform di erent tabl commonli process minim step explan step section text compress techniqu text classi cation task applic rang text classi cation event detect nding extract pattern nding interest pattern text document event detect track problem broader initi call topic detect track line research relat research inform retriev ltere tdt initi investig state art nding event stream stori broadcast recent usag term text mine subject controversi controversi awar usag term mean word knowledg discoveri text term text mine kdt rst feldman dagan suggest structur text document mean inform text appli sigkdd explor copyright acm juli volum issu page tabl ir view web content mine unstructur document author document process method applic al bag word word posit episod rule find keyword discov grammat rule colloc billsu pazzani bag word tfidf text classi cation cohen relat proposit rule base system text classi cation induct logic program al bag word tfidf text categor phrase tree naiv net support vector machin feldman dagan concept categori rel entropi find pattern concept distribut textual data al term associ rule find pattern term textual data al phrase posit naiv extract text document freitag mccallum bag word hidden markov model learn extract model hofmann bag word statist method hierarch cluster al bag word ngram map text document cluster al relat induct logic program text categor learn extract rule al bag word ngram hierarch cluster text classi cation hierarch cluster tree statist analysi moonei bag word tree predict relationship al bag word maximum entropi text classi cation scott matwin bag word rule base system text classi cation phrase hypernym synonym soderland rule learn learn extract rule al bag word boost tree text categor al bag word neural network text categor logist regress al entiti text compress entiti classi er al bag word phrase cluster algorithm event detect track neighbor tree sigkdd explor copyright acm juli volum issu page nlp techniqu step perform kind kdt reason mine document provid ectiv exploit result term text mine describ di erent applic text categor text cluster empir comput linguist task exploratori data analysi nding pattern text nding sequenti pattern text associ discoveri paper survei mention applic text controversi applic inform retriev view document tabl process work survei work survei tabl richer compar work survei tabl due addit structur inform hypertext document work survei util html structur insid document util hyperlink structur document document method common data mine method applic rang hypertext classi cation categor learn relat web learn extract pattern nding pattern data view mention techniqu web relat problem manag queri inform web mention class task relat model queri inform extract web site construct restructur rst task relat web content mine work insid scope web content mine due absenc machin learn data mine techniqu process basic db view infer structur web site transform web site inform manag queri web mention db view web content mine model data web integr sophist queri keyword base search perform achiev nding schema web build web web knowledg base virtual research area deal data data view refer data structur rigid schema tabl db view di er ir view tabl tabl db view object exchang model repres data label graph data oem view object vertic label edg object identi ed object identi er complex form set object denot set pair process survei process typic start manual select web site web content mine search internet speci resourc partli due applic db view di erent ir view classi cation process typic wrapper parser hypertext document applic survei task schema extract discoveri build dataguid roughli schema dataguid kind structur summari data practic applic comput summari approxim applic deal task nding global schema deal task nding frequent substructur data applic deal task creat layer obtain gener lower layer special queri languag web mine extract knowledg web document queri perspect data mine work queri languag data web work al al insid scope web content mine due di erent db method data mine di erent ilp method oper relat graphic data di erenc partli due inappropri exist data mine oper oper relat graphic data proprietari algorithm schema discoveri construct modi ed version associ upgrad rst order logic version associ rule mine multimedia data note discuss issu mine multimedia data web multimedia data major focu research techniqu multimedia ir extract multimedia data mine infanc uthurusami shapiro al mitchel assert work unifi framework problem learn multimedia data challeng fayyad al describ mine imag sky object satellit al describ mine imag identifi small volcano venu recent work applic web data wareh applic medic ir system mine multimedia data web de nition short survei multimedia data refer web structur mine view web content mine interest structur web document web structur mine interest structur hyperlink web explor copyright acm juli volum issu page tabl ir view web content mine document author document process method applic al relat ontolog modi ed naiv hypertext classi cation induct logic program learn web page relat learn extract rule al meta inform classi cation algorithm hierarch graphic classi cation cluster bag word hyperlink inform rule learn hypertext classi cation al bag word hyperlink inform tfidf hypertext predict reinforc learn al bag word posit rule learn learn extract rule shavlik local bag relat neural network reinforc learn hypertext classi cation al concept entiti modi ed associ rule find pattern semistructur text classi cation algorithm soderland entiti rule learn learn extract rule tabl web content mine view author document process method applic goldman widom oem proprietari algorithm find dataguid semistructur data grumbach mecca string relat proprietari algorithm find schema semistructur data al oem proprietari algorithm find type hierarchi semistructur data toivonen oem upgrad associ rule find data wang liu oem modi ed associ rule find frequent substructur data zaian han relat induct multilevel sigkdd explor copyright acm juli volum issu page document line research inspir studi social network citat analysi social network analysi discov speci type page base incom outgo link web structur mine util hyperlink structur web appli social network analysi model underli link structur web research kautz al util network analysi peopl model network ai research entiti data found close proxim public web page hyperlink home citat exchang inform individu found organ chart research classi ed combin web structur content mine algorithm model web topolog hit pagerank improv hit ad content inform link structur outlier ltere model appli method calcul qualiti rank relev web page exampl clever system googl applic model includ web page categor discov micro commun web applic web structur mine context web discuss al includ measur complet web site measur frequenc local link resid measur replic web document web identifi mirror site discov natur hierarchi hyperlink web site domain studi ow inform ect design web site web usag mine web usag mine techniqu predict user behavior user interact web mention mine data categori secondari data web result interact data rang wide gener classifi usag data resid web proxi server server web usag mine process classi ed commonli approach rst approach map usag data web server relat tabl adapt data mine techniqu perform approach log data directli util special techniqu true typic data mine issu data qualiti import typic problem distinguish uniqu server presenc cach proxi server detail comparison method web usag data refer typic data mine method mine usag data data desir form modi cation typic data mine method composit associ rule extens tradit sequenc discoveri algorithm hypertext probabilist grammar web usag data repres graph web usag mine background domain knowledg navig web site concept syntact constraint applic web usag mine classi ed main learn user pro le user model adapt interfac exampl learn user navig pattern exampl web user interest techniqu learn inform user model possibl combin web content mine inform provid interest techniqu improv ectiv inform web site adapt web site design user behavior satisfi goal site interest learn user navig pattern learn knowledg applic person web site system site modi busi usag intent give complet survei web usag mine research interest reader consult overview paper al spiliopoul masand spiliopoul robert coolei phd thesi mine user pattern overview paper langlei mine user pro le relat work etzioni rst coin term web mine etzioni start make hypothesi inform web sucient structur outlin subtask web mine paper describ web mine process work survei data mine web rst paper notic web mine research web mine taxonomi restrict web content web usag survei web usag mine divid web content mine agent base approach approach similar divid ir approach agent approach classifi web mine categori similar categori compar paper point usag term web identi es addit web mine perspect web mine categori web mine categori suggest model mine web log discuss research issu web mine context web project carbonel al give overview workshop learn text web relat web content ir usag mine give outlin research direct area mladen survei research text learn relat intellig agent compar frequent approach develop intellig collabor content base web content sigkdd explor copyright acm juli volum issu page ir usag mine survei research machin learn appli text broader similar discuss section ir view web content mine unstructur document carbonel al review emerg research collabor ir machin learn commun special issu machin learn journal fertil research area commun al review data mine techniqu algorithm web mine speci calli account hyperlink inform chakrabarti survei data mine hypertext paper survei statist techniqu web content continuum social network analysi techniqu web structur mine levi weld wrote survei special issu arti cial intellig intellig internet system describ broader domain web mine overview paper special issu arti cial intellig review data mine internet mention similar categori web mine view web content mine relat work found recent special issu magazin yang pedersen edit special issu intellig inform retriev pant edit special issu search internet paper survei research area web mine point regard usag term web mine suggest web mine categori situat research respect categori explor connect web mine categori relat agent paradigm focu learn applic recent work criteria web present challeng tradit data mine algorithm work data tradit data mine algorithm extend algorithm work web data interest direct web content mine recent interest inform integr form web knowledg base web form mediat area research commun machin learn met recent inform integr concern integr chang focu popular web true research thought mediat wrapper inform integr area inform integr research question scale number web site wrapper build maintain global topic detect track research area ir machin learn commun tempor issu data interest learn algorithm model aspect accur research issu area web content mine discuss interest fact graph structur occur web mine research opportun machin learn algorithm work advantag structur web acknowledg johann mauric bruynoogh read draft comment luc dehasp interest discuss raymond support project katholiek universiteit leuven hendrik blockeel fellow fund scienti research refer abiteboul queri data afrati theori icdt intern januari volum lectur note comput page wiener lorel queri languag semistructur data int digit verkamo appli data mine techniqu descript phrase extract digit document collect advanc digit librari santa april verkamo find text phrase combin sequenc frequent set discoveri intern joint confer arti cial intellig workshop text techniqu page yang topic detect track pilot final report darpa broadcast transcript understand event detect track annual intern acm sigir confer research develop inform retriev august page melbourn appelt israel introduct inform extract technolog intern joint confer arti cial intellig arocena mendelzon restructur web theori practic object sigkdd explor copyright acm juli volum issu page atzeni mecca cut past sixteenth acm symposium principl page acm modern inform retriev longman publish balabanov shoham collabor recommend commun hugh navig pattern discoveri internet data workshop web usag analysi user pro august san bharat improv algorithm topic distil hyperlink environ annual intern acm sigir confer research develop inform retriev august page melbourn billsu pazzani hybrid user model stori classi cation seventh intern confer user model borg leven mine associ rule hypertext fourth intern confer knowledg discoveri data mine august york borg leven data mine user navig pattern workshop web usag analysi user pro august san page brin page anatomi hypertextu web search engin seventh intern world wide web buneman semistructur data sixteenth acm symposium principl page acm suciu queri languag optim techniqu unstructur data jagadish acm sigmod intern confer manag june page acm yang report workshop learn text web workshop learn text cohen special issu machin learn inform retriev introduct machin cardi empir method inform extract ai chakrabarti data mine tutori survei acm sigkdd tomkin mine link structur world wide web ieee indyk enhanc hypertext categor hyperlink haa sigmod acm sigmod intern confer manag june page acm widom tsimmi integr heterogen inform sourc meet inform process societi page cohen learn classifi english text ilp method advanc induct logic program de io cohen practic observ integr web inform acm sigmod workshop web page cohen learn sixteenth intern confer machin learn page srivastava web inform pattern discoveri world wide web ieee intern confer tool arti cial intellig srivastava data prepar mine world wide web pattern knowledg inform coolei web usag discoveri applic interest pattern web data phd dept comput cowi lehnert inform extract commun slatteri learn extract symbol knowledg world wide web fifteenth nation confer arti cial page sigkdd explor copyright acm juli volum issu page inform discoveri internet ieee intellig harshman index latent semant analysi journal american societi inform dehasp de raedt mine associ rule multipl relat intern workshop induct logic volum lectur note comput page czech springer delgado inform filter recommend system internet phd dept intellig comput nagoya institut march sahami induct learn algorithm text categor acm intern confer inform knowledg page washington unit intellig agent approach work note workshop learn text page etzioni world wide gold mine commun autom analysi catalog sky survei advanc knowledg discoveri data page aaai smyth data mine knowledg overview advanc knowledg discoveri data page aaai smyth knowledg discoveri data unifi framework int confer knowledg discoveri data page feldman dagan knowledg discoveri textual intern confer knowledg discoveri data mine page zamir text mine term level principl data mine knowledg european volum lectur note comput page rousset workshop intellig inform integr ai suciu queri languag manag system sigmod pant search internet guest editor introduct ieee internet mendelzon techniqu survei sigmod extract intern joint confer arti cial intellig page freitag inform extract applic gener learn approach fifteenth confer arti cial intellig page freitag mccallum inform extract hmm shrinkag workshop machin learn inform exploit structur inform text classi cation www advanc intellig data intern page shim data mine present futur workshop web inform data page goldman widom enabl queri formul optim semistructur intern confer larg data august page morgan goldman widom approxim dataguid workshop queri process semistructur data data evan softwar review technic report technic report triniti grumbach mecca search lost schema theori icdt intern page extract semistructur inform web workshop manag semistructur page sigkdd explor copyright acm juli volum issu page hauptmann integr larg video audio ieee intellig hearst text data mine annual meet associ comput hofmann learn topic hierarchi text data intern joint confer arti cial intellig page hong weiss advanc predict model gener data mine technic report report ibm research kohonen websom map document collect proc workshop map page medic data mine research cancer inform system arti cial intellig hsu dung gener transduc data extract web inform mitchel tour guid world wide web intern joint confer arti cial intellig page learn text categor inform extract ilp workshop learn languag wang discov associ structur semistructur object ieee transact knowledg data sta ord distribut data mine agent base architectur knowledg discoveri data page aaai shah hidden web ai baker multimedia imag morgan kaufmann kleinberg authorit sourc hyperlink environ proc symposium discret page knowledg discoveri de nition proc advanc arti cial intellig machin learn applic tomkin trawl web emerg eighth world wide web confer kushmerick glean web ieee intellig doorenbo wrapper induct inform extract intern joint confer arti cial intellig page subramanian declar languag queri restructur web intern workshop research issu data ride page langlei user model adapt interfac seventh intern confer user page lawrenc gile access inform web milo queri world wide web fourth intern confer parallel distribut inform page srikant discov trend text proc int conf knowledg discoveri data mine page levi weld intellig internet system arti cial lim research issu web data mine data wareh knowledg intern page mae agent reduc work inform overload commun masand spiliopoul workshop web usag analysi user pro ling sigkdd seymor machin learn approach build search engin intern joint confer arti cial intellig page mitchel machin learn mcgraw mitchel machin learn data mine commun mladen relat intellig agent ieee intellig sigkdd explor copyright acm juli volum issu page mladen grobelnik featur select unbalanc class distribut intern confer machin learn page muslea extract pattern inform extract survei workshop machin learn inform knoblock wrapper induct inform sourc confer automat learn discoveri moonei ua mutual bene cial integr data mine inform extract seventeenth nation confer arti cial intellig motwani infer structur semistructur data sigmod motwani extract schema semistructur data haa sigmod acm sigmod intern confer manag june page acm la mccallum maximum entropi text classi cation intern joint confer arti cial intellig workshop machin learn inform page mine usag data web site aaai spring symposium adapt user editor inform multidisciplinari approach emerg inform volum lectur note comput scienc intern summer editor inform intern summer overview issu develop industri data mine knowledg discoveri applic int confer knowledg discoveri data page text mine knowledg extract unstructur textual data proc confer intern feder classi cation societi roma page rauber merkl automat label selforgan make reveal secret proc paci asia conf knowledg discoveri data mine renni mccallum reinforc learn spider web ecient intern confer machin learn word make big di erenc text classi cation annual intern acm sigir confer research develop inform retriev juli issu sigir page acm salton mcgill introduct modern inform retriev mcgraw scott matwin featur engin text classi cation intern confer machin learn aoki robust system architectur mine semistructur data int confer knowledg discoveri data page perona model subject uncertainti imag annot advanc knowledg discoveri data page soderland learn inform extract rule free text machin spiliopoul data mine web principl data mine knowledg european page tan web usag discoveri applic usag pattern web data sigkdd subrahmanian principl multimedia system morgan kaufmann tan text state art challeng proc paci asia conf knowledg discoveri data mine workshop knowledg discoveri advanc page toivonen knowledg discoveri data workshop knowledg discoveri advanc page uthurusami data mine knowledg current challeng futur direct advanc knowledg discoveri data page sigkdd explor copyright acm juli volum issu page data mine internet arti cial intellig van rijsbergen inform retriev wang liu schema discoveri semistructur data intern confer knowledg discoveri data mine page maxim perform ieee intellig weigend neural network approach topic spot symposium document analysi inform retriev page wilk inform extract core languag volum lectur note comput chapter pazienza inform page text frontier lossless compress data compress confer page liu learn approach detect track event ieee intellig yang pedersen guest editor intellig inform retriev ieee intellig han queri worldwid web resourc knowledg proc acm workshop web inform data manag page chiang system prototyp multimedia data mine proc acm sigmod intl conf manag page sigkdd explor copyright acm juli volum issu page
IR/257 5 librari resourc basi collabor work robert wilenski depart eec uc berkelei ca abstract creation digit document resourc greatli facilit inform access dissemin suggest resourc enhanc work provid substrat support collabor work focu form number creativ document manipul record share widespread digit document dissemin requir technolog web client server result infrastructur inform wide share individu administr boundari achiev ubiquit avail annot requir provid support spontan collabor administr boundari prior agreement annot technolog spontan collabor challeng develop document call mean address challeng document document distribut data program call layer document function implement model highli accommod volum document format form function model effect wide class annot document administr provis implement model develop behavior support common digit document number annot familiar relat implement analog capabl geograph data capabl benefici impact inform life process research scholar dissemin knowledg digit distribut geograph inform system introduct comput technolog made impact peopl work document appar area document access dissemin technolog potenti enhanc aspect work inform form document impact anticip area felt deepli paper potenti area wai digit collect document enabl collabor describ ongo effort undertaken part uc berkelei digit librari project fact number wai softwar servic develop focu distinct document call technolog enabl facilit spontan collabor spontan abil user collabor undertak substanti mutual administr commit spontan collabor widespread form suggest current work area profound impact inform life process research scholar dissemin knowledg spontan collabor collabor encompass larg number work system ongo research effort restrict area digit support collabor long recogn goal effort provid includ collabor author version featur document infrastructur lotu email support collabor volum web system research effort gener collabor infrastructur individu group made substanti oper document restrict administr domain approach inhibit collabor individu administr share infrastructur common document addit administr highli evolv system provid facil gener limit wai system typic provid featur appli document format format support featur provid gener difficult featur system design extens import support spontan collabor individu domain style requir featur ubiquit prototyp spontan collabor annot number creativ document manipul record share annot interest mode document fall author annot annot share annot import document collabor scholarli public begin author send draft document close colleagu journal submiss process involv comment share paper annot pass back author articl pass colleagu addit annot attent offer comment critic annot kind wide document type work practic studi inform found inform worker map typic found annot evid digit annot capabl widespread area paper medium prefer digit requir good annot mechan difficult consid vantag point spontan collabor suggest adequ annot facil support place annot locat document refer studi show individu note write observ separ sheet paper text editor mark document excerpt newsgroup provid annot separ qualifi document presum live mark copi document qualifi copi chang independ origin volum support type annot highli express import type oper granular extens import individu group tend develop style highli vari form annot occur annot coher facil wide varieti annot includ work annot essenti format independ assum annot control document format document annot support document assum document subsequ annot viewer necessarili share platform annot document remot server requir annot permiss store annot registr administr infrastructur encount document comment wide varieti type annot find rang note attach finegrain correct typograph mark document varieti save result server open origin document annot place note suffic make copi qualifi situ annot undesir effect track make type annot document html scan page imag form add element coher seek facilit work practic provid digit mean user annot document addit provid usual high easier digit support entail addit function media analogu digit annot dynam enabl genr annot approach annot encount violat condit stipul condit met proper document gener form present describ model describ support vision spontan collabor form situ annot section relat compar characterist work describ approach volum document highli highli highli extens document platform idea creat document architectur accommod document format idea document manipul exist system evolv support function format redesign implement divorc function document function implement appli multipl format multipl applic document set layer denot content document function accomplish infrastructur provid mean coher behavior bridg document format implement gener document provid user interfac implement capabl distribut arbitrari extens aspect document fundament runtim oper open extens protocol protocol encompass gener aspect document life cycl present form document manipul behavior layer behavior method insert place build method creat intern data structur repres inform format format result paint render document user event await input input hand method implement suggest function behavior work contribut method overrid protocol omit descript specif structur simpli note aspect document process open extens arbitrarili power document format awar behavior provid understand format layer bridg format intern structur system provid method overrid protocol build intern handl special case format call behavior handl format media note media behavior privileg statu architectur document open compliant repres tree intern node tree repres document leav repres encapsul type data interfac behavior creat leaf understand format media adapt encapsul media type properli construct enabl behavior media adapt oper medium special accommod appli oper media type volum persist form document document hub document xml document referenc layer behavior singl conceptu document restor protocol read hub fetch behavior place method begin protocol save write hub document individu detail descript document architectur found implement run platform legaci document examin applic spontan illustr architectur examin applic improv function scan imag document scan imag resist data type challeng applic document model figur show standard web browser displai scan document imag uc berkelei digit librari project server surround html movement manipul exploit document content readili web browser se volum figur scan page imag insid web browser figur show result click button figur label access document document java applet implement argument hub document hub document describ layer behavior document case scan hub document specifi layer imag output ocr infer text document posit inform word imag behavior hub document includ standard number behavior specif document page volum figur scan imag page document text data select search widget show search term word imag begin string highlight imag user avail function select menu provid behavior interact region document behavior regist interest figur show data background text highlight reflect statu text select portion imag text process text highlight region window select past applic user chosen entri menu action call view search dialog shown text enter widget found highlight imag function select search familiar conjunct document format readili realiz scan imag straightforward provid fact specif scan imag exploit imag ocr layer achiev volum capabl illustr infrastructur behavior search specif scan work data type behavior add arbitrari form addit function includ document figur includ behavior tabl layer click row header tabl imag imag sort content column figur show page tabl region tabl sort click column label figur illustr behavior tabl region highlight imag tabl proper blue header sort click header note highlight compon match search term preserv imag manipul distribut annot return issu spontan prototyp situ annot support document type support distribut construct document includ behavior manipul associ data layer wai layer behavior instanc effect kind base volum call behavior instanc annot annot base document creat live annot behavior instanc creat resid develop number behavior annot find conveni divid behavior behavior make span media geometr region document structur document tree span span behavior instanc extend point document continu point span implement behavior instanc start end point document tree span behavior gener behavior span type behavior creat influenc handl user save restor span persist storag figur show document type span document scan page optic charact recognit layer set support previou section type span illustr hyperlink present document span underscor magenta user interfac properti expect move cursor link cursor reveal destin bottom page click link access resourc refer volum figur imag document span span shown includ hyperlink highlight span current select search result shown menu pull reveal entri creat anchor blink text span current select span chosen form span span page meant resembl yellow marker pen result search displai span mark red box current select gold implement span class span implement mark figur behavior creat span left hand extend word span simpli comment specifi replac text mark extend word recommend replac text note span illustr power featur layout control span effect chang height imag manag behavior document accommod paint document volum ocr render column visibl chang render warn displai effect user menu entri toggl back present document figur span scan imag advantag span sort annot unlik simpl span anchor document annot coher addit document manipul figur show document layout control addit line space page imag space behavior made note span stai text annot achiev simpl bit imag overlai easi accomplish content overlai longer align base manipul span made posit correctli presenc chang underli base document span annot content bit structur object exampl behavior support span easili accommod framework volum figur scan imag extra span remain coher type annot interest base document readili subject manipul figur base layer darpa home page web html document ad number note acronym chang back suggest replac span set bold span militari illustr number point demonstr distribut hub document annot resid web site uc berkelei refer actual darpa home page base document load dynam hub document annot correctli portion base refer demonstr support html framework support html achiev simpli write media adapt document format volum behavior oper document scan imag html explicitli illustr mark oper document behavior shown highlight oper format html hyperlink implement turn underli html markup hyperlink figur mark html document magenta font attach line make comment replac word set span militari annot support function move cursor span click carri action click boldfac span current produc result shown figur document demonstr robust refer note page begin phrase miss text darpa sourc page time hub document open creat doubt due error author text present annot doubt remov darpa home page chang time hub document creat annot align perfectli design text robust refer discuss section volum execut mark illustr separ document structur media type span refer leav document tree tree essenti document creat scan imag case tree creat structur ocr tree html document leav tree scan imag refer imag leav tree html string text easi harder easi behavior implement correspond set graphic properti behavior execut implement transform specif media type requir amount margin believ function valuabl implement behavior framework figur html page execut replac set bold span note layout document automat increment recomput reflect text characterist span refer structur document class affect geometr region modifi content displai paramet receiv event volum figur illustr instanc kind left enlarg imag underneath page len insid imag text replac result ocr render font ocr softwar estim origin text lower portion screen len len overlap corner len effect reveal ocr process symbol figur geometr len show composit overlap region show note magnifi len html document note hyperlink addit annot implement note document make behavior figur show html annot note content includ hyperlink locat reader click link transport comment structur structur behavior hook repres function applic structur portion document action happen area structur behavior opportun modifi result structur behavior invest increment knowledg document leverag exist structur structur behavior invest increment recal user select word document imag past ocr structur imput past text directli suit input figur select includ bibliograph entri incorpor entri start past ocr text edit creat behavior automat perform volum function behavior automat identifi affect region user relev structur includ highlight screen region bibliograph structur semant descript field page affect automat insert volum figur structur behavior show page imag behavior associ bibliograph entri semant content entri select complet span automat highlight label red select transform entri menu select ignor incomplet bibliographi content bibliograph entri gener bibtex format place show result menu prior past result select applic user select format text past evidenc figur transform text past applic format text comput ad addit output format requir code format statement similar select implement fix set output format time structur annot annot point view abil select bibliograph altern simpli document featur altern ad origin lend annot qualiti tabl sort behavior previou section view annot structur inform addit sourc document alter structur tabl top linear modifi detail structur give user interact type annot combin structur span annot robust refer document distribut control author norm case virtual annot behavior exampl shown forc assum owner annot content chang requir strict coher violat spirit spontan collabor seek facilit annot appli asynchron assum refer annot attach section insert annot appli achiev provid mean place document robust presenc asynchron layer gener redund descript document place place refer includ structur volum posit tree excerpt underli larg make string uniqu uniqu identifi document restor time base document layer depend seri increment permiss strategi resolv refer locat referenc structur posit correspond excerpt heurist emploi find locat correspond refer note abil gener robust place refer part architectur se servic packag view includ behavior author includ behavior author satisfi author free includ variant altogeth behavior adequ resolv refer email notic author individu manual behavior includ addit check correct describ show align longer packag infrastructur servic suspect behavior writer gener find import reader bear mind properti robust refer annot behavior part applic model facilit provid media type document discuss view explicit document assum document essenti object power interest structur work interest explor data type product view tempor spatial extent geograph inform interest data spatial extent geograph data fit nice thought layer materi align base common geograph refer layer map aerial set vector point geograph locat dam state street san francisco bai area behavior provid manipul pan zoom geograph collect relat vector denot street locat imag provid photograph area annot ad layer data comment data layer place typic includ offset interpret plain text make node word larger sake offset design node offset design place term frame volum experi idea geograph data type built separ call gi viewer inform system gi viewer java applet reason develop separ code attempt support geograph data thought gener idea made agnost singl architectur textual geograph data wai data type manipul share type readili issu specif gi data manipul address integr function document architectur decid pursu develop gi viewer parallel document put futur explor integr singl architectur gi collect data set behavior fix applic applic issu queri data make annot layer turn displai cover layer bleed cover layer gi viewer support number geograph data includ vector imag detail elabor unlik gi viewer design readili extend user behavior load dynam geograph author specifi larg number distinct layer northern includ spot water shed veget document meant applic plan figur show gi viewer displai document left layer highlight layer render center turn user relief layer contribut larg grai elev coast layer contribut larg color region indent layer show layer label river contribut imag light blue box approxim outlin russian river region layer list underneath entri data region figur layer turn small color region render insid russian river bound box note layer render textur elev layer major north coast russian river veget layer behavior user pan zoom imag user grab center imag click drag portion layer small imag upper show center view area red mesh imag bound data move pan grab drag mesh user zoom specif zoom user issu queri make comput layer turn tour recommend volum geograph annot sampl document creat annot annot simpl geograph layer mark text list annot bai area includ document pan bai zoom turn layer label result action show figur figur gi viewer show set layer northern california middl canva show appar altitud portion layer highlight left behavior user issu queri small upper show middl canva red mesh entir extent layer small label rectangl figur layer show posit uc berkelei stanford rectangl mean move cursor region click result pan zoom layer turn figur show result click hyperlink layer displai figur turn layer turn show photograph uc berkelei show geograph hyperlink annot link produc configur shown figur figur layer north campu turn layer turn layer show locat build volum convent hyperlink page describ build layer street citi berkelei turn overlaid top photograph zoom red mesh upper hand canva visibl small figur bai annot layer turn red mesh upper hand canva lower pan zoom previou figur volum figur result geograph hyperlink uc berkelei campu note addit chang pan previou layer turn layer turn show digit uc berkelei annot distribut spatial annot gi viewer layer annot function layer data type vector format support gi viewer data format consist text option behavior illustr form geograph convent hyperlink type behavior queri issu remot servic includ happen resid server support spontan user creat spatial store separ data sourc situ annot data support spontan collabor geograph provid gi viewer behavior author annot geograph abil save state layer creat figur show top portion gi clip previou figur geograph document photograph layer bai simplifi present figur show label vector layer sort volum layer process ad layer layer list layer rectangl hyperlink figur geograph hyperlink layer previou geograph hyperlink switch convent hyperlink home page turn layer street berkelei overlaid top high altitud photo addit author user remov exist arriv desir collect layer user save current set layer refer similar hub document data behavior document save html document applet call gi suppli applet layer refer layer configur viewer time save hub annot layer resid applet substanti layer refer layer refer applet call result html page effect distribut annot geograph open gi viewer configur time show origin data layer annot made subsequ user add annot remov previou volum figur annot ad document high resolut photograph bai area turn layer build landmark ad visibl imag gi viewer process ad line annot collabor librari resourc exampl annot document varieti format import technolog annot document special servic provid annot document exampl privileg user network user technolog annot document support type user simpli end store hub document individu write permiss access hub document annot subject document reason idea scholarli inform significantli enhanc review edit portion scholarli inform cycl review make comment share result parti editor make typeset comment author execut volum continu annot process document offici post run commentari similar collabor highli function commentari extens gi viewer annot collabor primari data deriv work spontan collabor theme mean user enter form collabor prior administr coordin parti mechan find annot hub document manag larg collect annot document focu current research relat work great deal prior work area document geograph inform collabor work drawn research ol view document multipl document interpret separ softwar compon effect dimens straightforward introduc behavior oper multipl readili ol number exist system support kind annot includ annot facil lotu requir make annot attach document support individu group make comment document common word process format support includ macintosh hot web type annot html web os document render displai postscript oper graphic nice properti document annot annot model requir system readili support extens annot xml link languag provid mean mark link span document document link xml link convent xml concept introduc languag motiv aspect design document locat languag deal document accommod annot knowledg exampl system mind fact great deal effort build document follow strategi exist pursu strategi cost bridg exist applic format model reproduc desir piec exchang greater function volum knowledg system focu server side annot support support form complement function describ view requir server support impedi realiz spontan troubl provid annot support requir view power form annot requir deep control situ annot affect form annot constraint document requir access client capabl subject readi altern system tend present annot separ situ futur work intend broaden test document architectur support varieti data test real situat shown multipl document format incorpor framework make claim format independ forc develop media adapt handl varieti common document notabl xml format pdf shown appli similar idea geograph plan investig function accommod framework proper geograph data imag data tempor video give behavior tempor annot portion effect anim sort work remain provid annot behavior behavior shown capac edit annot creat interest handl larg number annot provid annot annot extens handl issu investig feel support spontan collabor digit librari resourc fundament chang inform creat feel import technolog challeng crucial spontan collabor gener doubt mode collabor support mode collabor realiz full digit media offer commun student acknowledg member uc berkelei digit librari project contribut idea paper gari kang made direct contribut carl lyon steven rosenberg laboratori valuabl suggest work gi viewer written subsequ enhanc jeff volum refer eric ken william toni magic interfac siggraph page august steven david make hypermedia user guid kluwer academ heath david open model hypermedia dynam link frank halasz reflect issu gener hypermedia system commun associ comput juli page catherin marshal paper book digit librari acm confer digit librari pp juli catherin marshal ecolog hypertext annot june david levi catherin marshal assumpt underli digit librari commun april ian smith knowledg hypermedia annot system hypertext novemb page sellen comparison read paper document chi march thoma digit document system uc berkelei phd thesi ucb comput scienc technic report decemb thoma robert wilenski induc structur behavior onlin digit document hawaii intern confer system januari thoma robert wilenski architectur applic acm intern confer digit march page volum martin christian terri winograd share commun world wide web april sellen richard harper paper analyt resourc design technolog chi march henri thompson david hyperlink semant markup document sgml europ volum
HCI/258 4 virtual multimod scientif visual tool abstract recent approach provid user natur method interact virtual environ applic shown mode input benefici intuit commun medium human comput applic mode hand gestur speech logic user typic environ virtual world limit access tradit input devic keyboard describ prototyp scientif visual visual fluid flow dataset multimod interfac combin voic input user visual interact dataset natur manner discuss interact result inform user evalu present multimod virtual scientif speech recognit introduct multimod interact benefit tradit unimod metaphor wimp point combin speech interact augment number wai user interact natur interact occur combin speech hand movement applic achiev understand intend action provid multipl input stream speech input provid perfect recognit accuraci joseph jr brown site nsf scienc technolog center comput graphic scientif visual po box ri usa combin speech input figur user interact dataset visual flow field space shuttl user simultan manipul streamlin left hand shuttl hand view data stereo advantag simplifi interfac perspect perspect interfac simpler modal account interact user interact sole speech rememb complic speech vocabulari complic gestur vocabulari combin mode complementari set interact remain singl respect vocabulari cognit load combin modal reduc recognit time interact speed individu recognit system work time make interfac simpler implement term algorithm complex order provid robust interfac speech input hand develop implement complex nition routin requir optim provid fast interact combin modal split work simpler implement modal compon base advantag multimod interact tradit unimod develop prototyp applic visual interact flow dataset figur multimod scientif visual tool base virtual realiti intuit environ explor scientif idea initi develop virtual displai devic combin speech input postur gestur main object build natur intuit interfac scientif visual explor multimod input combin complementar input modal complement combin issu singl command instanti virtual user make point gestur speak speech gestur complement gestur inform place object speech command inform type object place concurr input modal concurr issu command overlap time user navig gestur virtual environ voic command question object environ concurr enabl user issu command reflect real world task talk phone make dinner special modal special specif task natur task user creat place object virtual environ make gestur determin locat number voic command place object larg voic command achiev specif object placement task transfer input modal transfer inform receiv inform inform complet task exampl transfer multimod interact speech modal receiv inform hand gestur speech activ organ remaind paper organ manner section describ previou work relat multimod interfac discuss applic function discuss result inform user evalu section provid area futur work previou work context speech multimod interfac integr modal trace back develop system point hand postur voic command edit simpl primit squar circl larg screen bolt extend earlier work multimod interfac hand gestur speech manipul develop system incorpor speech hand gestur creat base system menu driven advantag hand input multimod work hand gestur speech found amount work virtual realiti scientif visual interact paradigm applic unimod natur combin virtual vr interfac visual system virtual scientif visual applic multimod input system combin voic wand input limit natur interfac user typic interact hand combin voic input glove user interact hand shown benefici interact develop system explor data virtual environ led develop multimod user interfac call cubic cubic interfac audibl compon rang user interfac problem cubic address visual domain unclear cubic tool specif problem move orthogon slice plane creat visual tool arguabl natur perform speech gestur interfac applic function interact user abil pick delet small set visual tool explor flow field dataset abil chang viewpoint virtual manipul make pictur record playback anim middl finger hand set speech command requir perform interact applic speech input compon vocabulari voic command subsect describ compon interfac detail includ tool creation record navig dataset manipul tool creation manipul visual figur explor fluid flow dataset order creat user simpli extend arm displai devic tool shown figur hand greatest distanc track transmitt hand object attach put simpli extend arm instanti attach hand move dataset type interfac present natur instanti tool metaphor util complementar transfer multimod input style user simpli applic object show object figur visual tool made made number streamlin visual tool similarli drop figur user extend hand displai streamlin user move tool locat utter command object equal user manipul dataset visual tool fix user pick fix object simpli hold hand utter command tool visual tool delet hand hold hand applic remov tool command user chang number streamlin attach size paramet made digit input slider analog compon simpli consist type button abil determin rel posit entiti invok button press glove make effect digit input slider conduct cloth patch attach fingertip extend back finger user make connect slide fingertip back tracker attach hand determin user slide finger back direct move wrist wrist paramet visual tool number streamlin attach left index index finger slider size left index middl finger slider fix applic streamlin ad remov depend direct slider size factor note valu chang dynam base user prefer speech command place question determin paramet chang issu resolv hold hand stationari intend object interest hand move slider manipul tool modifi hand number streamlin attach left hand user hold left hand fix slide index finger back left index wrist add streamlin left hand record playback abil save portion visual session import part visual techniqu understand scientif data scientist back reexamin interest visual show colleagu collabor mechan save retriev visual snapshot scene simpli applic view retriev save command mechan record plai back interact anim command background color screen turn shown figur indic applic record mode user make anim finish record view anim user issu command background color turn shown figur indic mode chang record playback tool benefit user back previou collabor set show colleagu import visual discov figur user record mode red background figur user watch record anim green background user hand occupi interact dataset issu command speech manipul tool hand dataset user free hand make gestur press button start record solv problem advantag concurr multimod input combin style speak direct manipul navig user navig virtual environ interact tool base navig techniqu user pull virtual world thumb middl finger hand grab point space translat constrain movement made user invok techniqu hand virtual walk ve user thumb middl finger hand simultan result abil translat virtual world motion techniqu thought distinct compon figur scale view region move hand closer farther fix line rotat world make motion hand opposit direct hand stationari make motion stationari hand translat virtual world move hand simultan distanc hand constant oper combin compon user perform translat motion move specif locat face direct method navig virtual scale rotat translat figur basic compon navig techniqu box repres hand line style repres motion compon isol combin view region rotat translat motion note hand time translat ronment hand palett hand act palett left index finger instanti interact user touch left index finger middl world rotat center dataset navig tool quickli rotat dataset dataset manipul task dataset specif rotat perform thumb index finger hand user touch thumb index translat rotat dataset simpli move rotat hand manipul freedom perform rotat translat dataset user touch thumb index finger left hand dataset rotat translat perform base initi angl hand axi hand angl approxim tracker attach back hand approxim parallel dataset rotat perform dataset translat note touch thumb index finger hand simultan analog navig techniqu previou scale omit user prototyp tion life number observ applic user found applic compel term interact virtual environ interact major user found interfac easi idea metaphor creat select visual tool metaphor improv object creation select techniqu menu techniqu requir user object choic order select navig layer menu creat object metaphor faster method creat select visual tool user activ select virtual user simpl voic command properli posit show applic hand place object user found digit slider number streamlin attach size simpl effect manipul paramet major user found record playback capabl import part applic virtual environ user vr found displai extrem compel visual standpoint user enjoi stereo displai physic touch virtual object good indic stereo effect work user provid number suggest construct critic improv applic number user visual tool addit provid number peopl applic provid form text output show exact valu flow field base user input tool user thought make applic robust particl trace import suggest scale respect interact flow field user scale movement visual tool fine grain manipul perform user close dataset import comment found applic visual uncertain scientist understand data easier effici question plagu virtual scientif visual system question difficult answer definit area futur work major problem peopl comment speech recognit goal effect natur speech interfac mechan function current technolog nent isol environ environ user system speech recognit work problem posit recognit collabor demonstr speech recognit due recogn word erron oper speech recognit problem made applic main reason problem occur applic distinguish user speak peopl environ current state conclud user effect interact applic level commun mimic human intermediari form interfac requir user collabor demonstr set ad voic command interfac trigger speech recognit engin command start applic listen voic command stop applic ignor voic command voic activ command interfac work mechan requir make applic usabl futur work prototyp amount futur work remain order make system robust base comment user plan introduc visual tool includ output user valu specif quantiti plan add scale control mechan movement visual tool base size proxim dataset plan investig incorpor mechan applic close commun make addit import area futur work determin benefit conduct formal user evalu goal formal evalu determin scientist understand inform present tradit desktop applic present virtual multimod scientif visual tool ing fluid flow dataset provid user multimod interfac combin voic advantag commun skill lifetim acquir user interact applic hand issu relev command speech explor multimod combin style transfer context scientif visual applic studi goal continu find wai multimod interact virtual scientif visual scientist research product effici work acknowledg special steve bryson provid space shuttl dataset timothi rowlei van dam work support part nsf graphic visual advanc network sun microsystem refer van dam user interfac commun bryson virtual realiti scientif visual commun extens interact visual framework virtual virtual realiti annual intern martin theoret framework softwar tool multimod interfac intellig multimod multimedia interf ac john aaai jr speech input virtual environ brown depart comput decemb bolt put voic gestur graphic interfac acm bolt gestur natur dialog annual acm symposium user interfac softwar interact techniqu hand track speech recognit multimedia interfac roger publish evalu multimod interfac spoken languag point gestur interior design system intern confer spoken languag edmond expert surgic intellig virtual environ multimod input medicin meet virtual realiti thorisson integr simultan input hand gestur intellig multimedia mark paul virtual interact coupl model ieee comput graphic scientist report visual applic cave virtual realiti ieee symposium research frontier virtual song norman virtual realiti environ explor data ieee symposium research frontier virtual interact time visual system virtual realiti paradigm visual scientif buxton myer studi input chi explor data virtual environ ieee visual interfac object manipul virtual environ virtual tm video discoveri zeleznik base select virtual environ acm symposium user interfac softwar
HCI/259 4 input devic andrew john cheng multimedia commun faculti engin appli scienc memori st canada abstract show imag hand video camera attach wrist process yield finger movement inform discret movement finger rest posit translat small set base symbol interpret input wearabl provid control introduct investig camera wearabl comput applic shown figur attach view front hand finger typic conceal wearer connect remaind system figur camera posit expect background condit foreseen applic includ kei frame record store sequenc gestur keystrok dial hand scan activ vision task combin input static head camera dynam wrist camera main interest develop virtual input devic chord charact input track finger movement gestur track interpret finger motion wide rang illumin condit background encount user move hand user tap finger handi tabl top simpli move finger freeli recogn motion convert effici system input make user interact wearabl comput headmount displai obviou exist input devic chord visibl distract input subtl distract system mode user hand instantli free basic system oper process wearabl comput dedic interpret movement finger determin user attempt commun process determin finger predefin posit commun begin point movement finger combin finger start posit correspond individu symbol symbol direct subsequ symbol aggreg form user send rudimentari command regular text system emploi receiv continu rang input valu hand control mechan type virtual devic scroll bar focu paper methodolog identifi set gener requir input devic initi establish simpl syntax commun finger gestur syntax drove detail design test report gener requir input devic covert system oper high reliabl wide varieti environ background illumin remain unconstrain wearabl comput user found virtual environ expect hold frozen front background system work present arbitrari move background input devic accept user input slight delai system capabl immedi respond rapid chain gestur input fail input devic system easili usabl gestur wearabl comput simpl comfort gestur conjunct robust impli latitud term camera posit system resili camera posit orient unrealist expect camera stai perfectli rigid stabl covert oper requir born larg desir util system social context finger movement system input symbol fairli subtl simpl base alphabet gestur deriv combin finger finger state movement rest posit figur illustr alphabet figur space gestur posit static gestur posit shown constitut gestur defin gestur dynam chang rest posit gestur back rest posit note rest posit finger actual gestur finger lift hand rest flat surfac tap interpret gestur alphabet high dexter close physic proxim finger finger tend parallel camera mount wrist system design small set gestur system oper system state machin sequenc step simplifi descript normal system user initi finger track turn wrist input user place hand clear view camera audibl tone notifi user current hand posit unsuit user begin gestur system return idl camera input design kei featur expect condit exploit system hand bottom imag area due complex distribut skin color color space find select common yield good segment hand imag assumpt frequent sourc imag underpin approach discuss featur exploit parallel natur finger vantag point bent approxim parallel sourc imag suggest convert sourc imag averag finger angl motiv assumpt provid basi design map color coordin pixel incom video stream color quantiz color histogram find point maximum densiti histogram treat candid skin color learn skin color previou frame compar candid prototyp increment updat current skin candid rate prototyp control set shade illumin movement singl transient prototyp jump consequ sudden differ segment finger finger mask move finger method divid imag skin pixel linear color segment algorithm develop specif skin find applic segment imag filter figur illustr result segment process figur imag segment return origin imag attempt determin direct finger point parallel assumpt singl direct find singl line close parallel finger sourc imag obtain thin contour imag origin bitmap sequenc bin creat bin correspond rang angl contour point angl rang bin largest bin found averag contour point averag desir angl inertia requir quantiti order stabil process simpl process robust fast angl finger reduc sourc imag compact desir segment imag transform histogram point histogram number pixel segment imag count sum slant column segment imag parallel finger angl line histogram smooth figur illustr histogram construct imag figur smooth imag histogram histogram analyz determin height locat peak peak ideal correspond singl finger order combat temporari period poor imag poor horizont point histogram assign finger correct number peak present horizont point move increment posit number peak histogram correct horizont point stai stationari vicin peak case move increment peak point horizont point correspond slant column transform segment imag imag histogram column parallel line roughli bisect finger origin imag line extend top imag slant column line extend point fingertip encount point determin threshold number imag pixel found short line pixel call line perpendicular extend line fix center bottom line figur show point fingertip figur line encount fingertip quantiti produc process simpli length extend line top imag point encount fingertip track quantiti time gener set histogram histogram correspond singl finger stabil process histogram continu smooth invert peak vallei peak histogram determin finger move significantli rest posit point move describ input symbol note introduc small delai find peak histogram delai time peak histogram gestur movement move finger peak slightli phase result present numer result trial system attempt varieti environ environ shown ideal plain background care posit orient finger environ emploi arbitrari background constrain finger posit state result environ posit stabil camera finger orient angl histogram peak reliabl environ gestur attempt figur tabl system tabl tabul result set set correct time wrong gestur gestur miss nonexist gestur ideal ideal averag case gestur system interpret gestur result set singl trial system paramet adjust test shown averag delai actual complet gestur time system gestur occur approxim averag rate process approxim frame pentium ii mhz pc ram vista digit camera discuss result singl user make gestur perform system decod continu natur demonstr reliabl underli imag process algorithm show correct oper reliabl achiev user care background camera case arbitrari move context design system exhibit error occur portion background misclassifi skin area displai frequent altern spuriou gestur detect error color misclassif illustr persist difficulti discrimin finger arbitrari background method determin skin color adapt cluster robust disambigu background attempt fix problem attach red illumin camera point hand mutual illumin hand white surfac tabl result area match skin color frame rate system high high delai time make interact usag difficult delai incur combin process lag window time alloc wait peak movement finger involv gestur improv accuraci detect cost delai partial solut delai achiev elimin gestur alphabet paper kind input devic wearabl comput design gear varieti environ system complet adapt requir prior train term skin color expect background condit adapt kei strength design system robust abil oper reliabl advantag gain equip system notion color defin skin color color defin background step develop develop sophist input languag design partial error correct prototyp system prove potenti input devic free user bond tactil interfac afford benefit system wearabl extend input control refer interpret hand gestur ieee transact pattern analysi machin juli vol ieee comput lo pp skin color intern confer automat face gestur octob pp robust skin identif video intern confer automat face gestur octob pp
ML/260 6 research note longer version ec tr purdu prune tree misclassif cost jeffrei bradford kunz ron kohavi cliff brunk brodlei school electr engin data mine visual purdu silicon west mountain ca abstract describ studi prune method tree classifi goal minim loss error addit common method error cart prune studi extens prune loss prune variant base laplac correct perform empir comparison method evalu respect loss found appli laplac correct estim probabl distribut leav benefici prune method unlik error perform prune led result par method term evalu criteria main advantag prune reduct tree factor ten method domin domain prune mechan loss matric prune tree tree wide symbol model techniqu classif task machin learn common approach construct tree classifi grow full tree prune back prune desir tree grown overfit data infer structur justifi train set conflict train set error fulli built tree true error larger combat overfit tree prune back goal identifi tree lowest error rate unobserv break ti favor smaller tree olshen stone quinlan prune method introduc includ reduc error pessimist penalti mdl prune prune algorithm develop minim expect error rate assum classif error unit cost object paper studi prune minim aim studi prune algorithm goal minim loss practic applic loss matrix classif error prune perform respect loss matrix prune loss minim lead prune behavior prune error minim investig behavior prune algorithm addit common method error prune al prune studi extens prune loss prune variant base laplac correct cestnik perform empir comparison method evalu respect loss matric found prune mechan loss matric found adjust probabl distribut leav laplac correct benefici method prune algorithm evalu criteria prune algorithm perform replac singl leaf node estim error leaf replac lower crux problem find honest estim error al defin overli optimist tree built minim error place error rate train provid suitabl estim replac fewer error train set commonli prune algorithm error minim prune cart prune al attempt extend prune prune case extens prune base confid interv extend easili naiv idea comput confid interv probabl comput loss base upper bound interv class yield distribut add result made variant normal perform decid prune method prune method introduc similar motiv prune laplac correct method probabl uniform distribut node probabl assign class cestnik laplac correct make distribut leav uniform extrem comput expect loss loss matrix expect loss sum expect loss leav algorithm cart penal estim error base size error estim assign error factor ff time size effici search algorithm comput distinct ff valu chang tree size paramet chosen minim error holdout sampl optim ff entir train set grow tree prune optim holdout hold back train set estim ff paramet cost complex prune extend natur loss matric estim error estim loss loss penal size tree time ff factor comparison prune algorithm goal design experi understand prune method work tree classifi evalu loss loss matrix basic tree grow algorithm implement dougherti call tree induct algorithm similar algorithm grow tree standard methodolog attribut evalu criterion stop node fewer instanc tree prune prune prune probabl estim frequenc count prune probabl estim laplac correct probabl estim laplac correct lp prune probabl estim laplac correct prune base loss probabl estim laplac correct leav tree label class minim expect loss base probabl estim leaf initi laplac correct outperform frequenc count variant exclud basic method prune method run laplac correct ten dataset chosen uci repositori murphi adult classif base censu bureau breast cancer german pima road satellit vehicl decid dataset make evalu easier hard satisfi resort convert problem problem preval class goal class dataset unknown avoid factor remov instanc unknown valu file standard error estim loss small import loss matric standard deviat estim larg decid requir instanc train leav remain instanc test test laplac correct estim probabl leav lead lower loss frequenc count loss matrix prune lead lower loss prune base error dataset train data test repeat process time compar perform prune algorithm loss set loss misclassifi frequent class simul scenario frequent class import class experi loss similar shown result displai graph show averag loss ten file bar scale averag rel loss scale rel loss comput ratio loss prune method baselin method ratio averag ten dataset creat summari graph case loss ratio indic perform averag loss averag rel loss loss matric shown figur observ prune frequenc count perform worst prune perform loss matrix compar loss matrix perform surprisingli loss prune slightli inferior prune loss matrix tree size radic averag tree size loss matrix prune confirm observ oat jensen error minim averag loss loss ratio absolut rel lp averag loss loss ratio absolut rel lp fig averag absolut rel loss algorithm loss matrix matrix hypothesi laplac correct estim probabl leav outperform frequenc count confirm confirm np prune method run frequenc count perform suggest loss matric tree size prune laplac correct result differ error prune consist shown prune base loss matric perform prune base error frequenc count method result frequenc observ reduc prune brodlei utgoff laplac correct prune loss matric perform prune differ loss matrix prune appli laplac correct improv perform averag case laplac correct lead higher distribut mse frequenc count distribut mse similar laplac correct algorithm main differ prune algorithm tree size averag tree size step induc concentr stage view good step studi studi grow techniqu brunk extend prune loss introduc method loss prune method loss matrix ti prune laplac correct loss matrix studi reveal laplac correct leav extrem benefici aid prune method found dataset prune reduc lead smaller tree prune effect reduc tree size significantli loss singl prune algorithm domin dataset term fix prune algorithm loss matric long version paper brunk brodlei show roc curv includ prune method major fact differ loss algorithm loss matrix tree prune conclud suffic induc singl probabl tree loss matric refer prune tree misclassif cost classif regress wadsworth intern group estim crucial task machin ninth european confer artifici pp classif linear machin ieee transact pattern analysi machin intellig estim essai modern bayesian mit press data mine machin learn librari artifici ieee comput societi pp uci repositori machin learn effect train set size tree fourteenth intern morgan pp reduc misclassif eleventh intern morgan kaufmann program machin morgan san california
Agents/261 1 compil fast state captur mobil agent christian michael inform comput ca usa abstract restor state mobil agent main problem implement mobil agent system present implement part messeng repres unrestrict pointer abil perform fulli transpar state captur write code programm choic type function function fulli gener unrestrict invok migrat command messeng function migrat pointer restrict special type dynam arrai structur local program call stack agent made transpar migrat introduct restor state mobil agent main problem implement mobil agent system easi captur transport state agent transport program counter stack difficult reason return address pointer store stack machin depend translat memori address destin machin system leav programm restor agent state refer techniqu mobil agent introduc stack save dynam time migrat command occur achiev ad special except handl code save local variabl data structur heap migrat except invok code store complet stack data structur special code insid method assur method call inform data structur stack complet restor state migrat complet stack move heap migrat restor object migrat slow compar messag pass paper approach state captur mobil agent main idea differenti type function messeng function function fulli arbitrarili involv unrestrict pointer invok migrat command function invok messeng main function script treat block return script level migrat place messeng function includ number migrat statement nest invok regular function free pointer permit dynam memori manag insid messeng special type dynam arrai structur provid compil repres local program call stack agent captur restor transpar migrat overview messeng messeng system support develop distribut applic structur collect autonom call messeng messeng thread repres messeng control capabl move node underli network issu migrat command messeng navig autonom network carri messeng system implement collect daemon instanti workstat particip distribut comput daemon connect network daemon task continu receiv messeng arriv daemon execut messeng consist program call script correspond function convent program consist type comput function migrat statement comput statement includ standard assign control statement involv arbitrari variabl constant pointer function call permit dynam load invoc arbitrari precompil function written unrestrict permit invoc messeng function migrat statement endow messeng permit move network import migrat statement hop transpar captur state messeng current machin restor destin machin main contribut paper mechan permit migrat statement invok script level messeng arbitrarili nest messeng system distinguish kind messeng variabl local messeng automat carri messeng travel network node variabl local node share messeng resid node basic kind variabl separ state messeng state node state messeng pointer script level insid messeng function lack free messeng system support special variabl call dynam arrai behav regular arrai arrai size arbitrarili chang runtim command dynam arrai enabl messeng alloc dynam memori script level messeng function similar function unlik memori acquir memori manag dynam arrai transfer messeng individu autonom object denot mix case system denot small capit messeng static variabl start int char doubl figur gener memori structur variabl declar save state current version messeng fulli compil compil code machin code comparison interpret version improv execut speed factor aim achiev high migrat speed special compil techniqu develop main idea full state messeng memori call messeng control block block inform transport easili machin state mobil agent consist valu local messeng program function call stack handl node messeng compil transform part satisfi requir explain remaind section transform messeng variabl state captur restor variabl easiest task messeng compil put scalar arrai fix size memori block gener declar messeng variabl member struct figur displai transform simpl code difficult implement dynam arrai put struct messeng control space grow shrink end arrai size chang messeng compil achiev ad empti charact arrai end struct charact arrai messeng privat heap messeng dynam arrai compil alloc extra memori accommod arrai total size normal size size dynam arrai store messeng heap bottom portion heap integ variabl dynam arrai store offset arrai figur illustr structur messeng heap arrai offset valu compil transform refer dynam arrai shown figur transform achiev goal store messeng variabl block access dynam arrai slightli slower access regular arrai offset calcul chang size dynam arrai dynam dynam arrai arrai offset offset variabl static heap mess figur ad dynam variabl messeng code code int set realloc copi offset figur transform dynam arrai access time consum alloc memori heap made state captur slower memori manag transform program counter program counter store insid messeng control block migrat store pointer machin depend messeng compil solv problem break code smaller function block state save occur end function block execut easili continu block execut block implement arrai function messeng execut invok function block order execut order determin runtim function block return index function block execut call store insid messeng control block unlik regular program index machin depend messeng capabl resum execut correctli hop machin figur illustr principl sequenc instruct sequenc show fragment messeng sourc code migrat command compil separ code hop result function block figur figur displai result function block perform function block store index function block shown gener rule messeng compil transform messeng code code ffl function block start begin messeng code ffl function block start migrat statement ffl function block continu start point condit branch branch termin migrat statement encount variabl static heap void void figur divid code function block control flow graph arbitrari path migrat path migrat statement gener control flow graph includ path complet path migrat statement figur show simpl nest branch figur show control flow graph appli compil gener function block control flow graph figur includ complet migrat statement path includ hop requir state captur statement path function block set index function block execut function block start hop execut continu destin node includ function block shown figur transform continu function block finit number migrat termin code loop transform similar manner techniqu discuss transform stack previou section show program counter made machin independ transform code migrat statement separ function block migrat statement restrict script level case earlier state captur includ call stack empti top level kind restrict cumbersom mean program span tree network written iter loop function elimin introduc messeng migrat statement nest support function requir addit transform explain section introduct dynam arrai messeng open opportun captur restor call stack migrat basic idea store inform system stack special dynam arrai call printf hop printf hop printf small medium stai figur nest code control flow graph hop hop printf printf printf figur gener function block messeng stack system stack remain relev inform call sequenc messeng maintain messeng stack store inform messeng stack requir call return transform jump simpl jump machin function block function call return treat special statement function variabl set function block call function index function block call statement store return index messeng stack paramet call function store call function access paramet messeng stack local variabl return statement messeng pop top element messeng stack set variabl execut return higher call continu execut function block void void void void void void figur handl code function variabl static heap variabl static heap variabl static heap stack messeng figur state function call hop statement end function earlier function call figur show function main function call function migrat statement occur figur displai state messeng control block execut main function start function block call termin function block end return index store messeng stack messeng continu function block function migrat statement separ function block figur show state hop execut variabl set return index remain messeng stack execut continu function block end function block variabl load pop messeng stack ensur execut continu function block perform comput transform assur system stack empti point migrat function block execut linear sequenc function block call loop messeng daemon function block call function block directli daemon call block transform similar compil code basic risc doesnt call stack present approach captur state messeng automat transpar time messeng migrat machin flexibl restrict script level messeng function programm special dynam arrai space manag memori manag chang size dynam arrai present experi approach reduc memori manag overhead avoid frequent arrai size extend messeng stack dynam arrai gener space shrink stack dynam arrai gener messeng remain machin messeng move part messeng control block data arrai entri messeng stack move net maintain profil size dynam arrai proactiv guess size messeng hop machin alloc reduc subsequ realloc space machin determin maximum stack height optim subject futur research refer lf distribut comput autonom object ieee aug transpar migrat mobil agent intern confer mobil lectur note comput sept lf merchant distribut coordin messeng scienc comput special issu coordin applic editor ma intern confer mobil lectur note comput sept vitek editor intl workshop mobil object lectur note comput scienc juli implement autonom agent system master dept inform comput fukuda automat state captur comput messeng intern confer mobil lectur note comput sept
HCI/262 4 gestur multimod control earth visual environ david william thad larri hodg colleg gvu georgia institut ga usa abstract grow bodi research show advantag multimod interfac includ user freedom paper investig design interfac integr speech hand gestur interfac addit properti oper rel user user motion stand distanc comput displai paper describ implement multimod interfac earth visual present navig interfac challeng due larg magnitud scale extend space characterist multimod interfac recogniz accuraci learnabl condit implement show multimod interfac effect real environ set paramet design interfac introduct multimod interact multipl class modal interact user earli integr speech recognit point gestur speech rich channel commun rich channel commun gestur complement speech number ad descript multimod interfac craft speech gestur greater express conveni multimod interfac experi error compar unimod compon interfac partli due freedom mean express larg repertoir express user select adapt mode express satisfi prefer minim error noisi user reli gestur pen input user disabl speech cold accent emploi gestur pen input multimod interfac experi mutual disambigu recoveri error contextu inform mode system correctli intent multimod system good match visual virtual realiti gestur spatial refer descript speech rich command queri interact track hand gestur navig interact virtual environ involv unwieldi tether devic glove glove cumbersom measur hand orient postur unwieldi share led work vision base track devic wearabl mobil track similar input devic desktop surfac oper user stand distanc displai move user hand occupi part time worthwhil figur orbit view figur surfac view understand qualiti limit multimod speech gestur interfac compar perform interfac paper discuss paramet multimod navig interfac describ previou relev work discuss implement multimod navig interfac speech gestur earth visual environ environ rich set interact mode navig evalu interfac characterist learn gestur system navig task perform environ chosen system multimod interfac broad set navig task earth terrain visual navig magnitud scale user travel orbit perspect entir person view build model resolut imag surfac navig page high resolut data occur real time interact rate navig extend space figur system process complex due larg magnitud scale cite concern includ freedom manag virtual good stereo imageri maintain navig method work spatial scale present address concern navig constraint aid vari scale interfac design complic voic gestur recognit engin run machin high error rate address issu collect integr time stamp packet network recogn relat work work differ gestur recognit project gestur recognit system emploi tether tracker emploi multimod interfac speech recognit multimod scientif visual tool scientif visual environ emploi speech gestur track glove extend scale requir modifi navig techniqu system visual structur virtual realiti battlefield visual provid multimod speech gestur interact fix camera system bodi mount user mobil enhanc quickset map applic pen speech interfac adapt figur gestur pendant dragon battlefield visual tool multimod interfac base speech hand speech pen stroke quickset speech stroke dragon pen stroke gestur requir refer displai surfac bodi mount user interact distanc displai implement multimod interfac varieti displai includ desktop window ibm virtual workbench power sgi figur show interfac gestur recogn gestur pendant speech utter recogn ibm speech gestur integr late fusion output singl mode recogn earli fusion singl recogn extract integr featur interact channel figur diagram system voic gestur recognit voic recognit perform ibm speech utter applic transfer command network sampl voic command list tabl gestur pendant black video camera worn chest bare human skin reflect infrar skin arrai infrar emit illumin hand gestur field view foot distanc field view inch inch infrar filter len prevent light sourc interf segment hand limit rang prevent object feet camera gestur pendant interact unconstrain surfac mode navig walk continu movement move move move discret movement jump jump jump direct turn pitch speed stop tabl sampl recogn speech command tether wire gestur respect bodi propriocept qualiti interact enhanc user innat relat movement bodi part respect mine al qualiti develop interact tool track environ propriocept qualiti gestur permit user gestur innat understand amount direct hand movement gestur hand grasp manipul user attend task head video imag segment blob base preset threshold blob conform train motion gestur recogn recogn gestur list tabl softwar extract coordin centroid hand act pointer timestamp packet describ recogn gestur network integr softwar command integr execut integr gestur speech utter perform semant chronolog templat match process recognit process queri process common synchron gestur speech packet order time templat flexibl specif command languag varieti synonym vertic finger move pan left vertic finger move pan left finger move zoom left finger move zoom finger move pan finger move pan open stop tabl recogn gestur command voic gestur work complementari command voic paramet gestur voic gestur command work motion control gestur insert object voic navig command design user effect navig scale pan gain factor direct function vari squar altitud user navig closer pan control rotat independ special gain factor scale integr altitud scale factor adjust maintain distanc rel user navig mode orbit walk fly mode orbit mode present person point view walk user constrain ground altitud fly mode present flight applic result evalu perform effect multimod gestur group user emploi gestur interfac laptop displai environ collect quantit observ inform user perform specif task interview ascertain opinion observ multimod experi simpl voic command initi hand centroid track control rate movement metric gener criteria suggest evalu navig task gestur interfac concentr subset criteria gestur recogniz accur quickli system recogn gestur respond effici task complet proxim desir target abil novic user techniqu cognit load techniqu point view user physic simul sick preliminari navig task user familiar multimod interfac perform navig task subject interfac user train speech system read stori set command interfac recognit error correct user familiar command system familiar pronunci process minut user shown posit hand gestur gestur pendant hand gestur recogn requir user specif train user experi interfac minut learn user verbal specif task user began orbit posit move zoom grand canyon user zoom move east georgia atlanta travel fly mode georgia tech switch walk park front tech tower main administr navig activ requir fine adjust user goal user emploi multimod command task recogniz voic recognit lag factor perform user user repeat command hand centroid track perform aid direct visual feedback hand motion turn movement immedi speed slow base hand continu process studi type includ virtual environ task requir system hand track fell rang figur workbench mobil interfac voic recognit slower affect action requir user posit directli build multimod interfac hand track action futur version concentr area improv constrain spoken word vocabulari grammar make recognit faster accur accuraci gestur interfac perform navig task averag time task complet minut standard deviat minut user gave spoken command task interfac minut time task complet multimod interfac affect error delai voic command recognit accuraci navig task good error occur adjust detail movement affect delai error voic recognit user strategi speak command ahead time delai hand gestur slow stop movement prepar voic command comfort user rememb voic gestur command felt easier learn keystrok command import qualiti voic command command map mode command work user command mode fail conclud command exist command altitud fly tilt view downward walk mode command map action command gestur map finger movement rate motion rate motion propriocept natur hand gestur made interact easier rememb fast visual feedback inform user start move opposit direct user desir gestur requir reposit hand gestur address code segment track finger tip user move hand field view cursor indic hand posit address problem user note discomfort due fatigu hold hand front pendant gestur pendant effect indoor effect outdoor broad spectrum intens overwhelm gestur infrar illumin develop gestur pendant visibl laser structur light field view visibl illumin imag hand set gestur significantli larger multimod interfac prove easi learn effect navig task requir includ fine navig extend space user plan execut command reach target initi sight cognit load user successfulli complet task conduct seri formal evalu user studi begun examin cognit load preliminari result show clear benefit multimod interfac interfac acknowledg work support grant dod muri program administ aro nsf larg scientif softwar data visual program daniel rob provid invalu technic assist refer gestur fuzzi logic fraunhof institut comput graphic report control object virtual tabl comput interact digit vol czech republ ra bolt gestur graphic acm comput pp bowman techniqu common task virtual phd georgia institut technolog bryson virtual graph pr multimod interact distribut acm intern multimedia pp pr rosenblum interact ieee comput graphic pp softwar architectur battlefield visual virtual ieee virtual ieee comput pp walker cyberglov input acm pp jj jr virtual base multimod scientif visual iast intern confer comput graphic pp integr global gi visual simul report mr fp ch object exploit propriocept siggraph pp sl resolut multimod intern confer spoken languag vol pp sl oviatt disambigu recognit error multimod acm confer human factor comput system pp sl pr user interfac multimod speech gestur system research human comput vol pp vi ga ts huang multimod interfac control virtual american associ artifici intellig spring symposium intellig environ input pose gestur hand applic ieee virtual pp ts vi humphrei interfac visual comput environ molecular intern confer pattern recognit pp gestur infrar comput vision system home autom control medic intern symposium wearabl ieee comput pp hodg person navig terrain stereoscop ieee virtual ieee comput pp effect variat system user perform virtual human vol pp
DB/263 3 decid fragment tempor logic ian frank michael zakharyaschev depart imperi colleg queen london institut fur universitat leipzig institut appli russian academi scienc squar russia juli abstract introduc fragment tempor call formula begin tempor oper free variabl show satisfi problem formula linear time structur reduc satisfi problem fragment classic logic reduct singl number decid fragment tempor logic logic sort intend tempor reason standard time finit extend result mention tempor logic finit domain prove decid decid monad logic intend flow explicit analysi structur natur number composit method build model piec finit step introduct tempor logic found numer applic comput rang tradit field program specif verif tempor distribut system recent knowledg reason true proposit tempor logic mainstream theoret studi disciplin restrict proposit survei monograph chapter devot tempor logic reason clear axiomat tempor logic present axiomat logic class linear flow seri incomplet theorem start unpublish result scott show tempor logic comput scienc contrast classic earli undecid result ture church stimul research led rich profound theori concern classifi fragment logic decid attempt convert result tempor logic classif problem extrem weak express power tempor formula requir prove undecid left hope decid fragment locat proposit tempor logic found theorem main aim paper defin investig kind tempor languag express proposit hand rise decid fragment tempor logic roughli fragment obtain restrict pure classic part languag arbitrari decid fragment restrict tempor part languag formula subformula begin tempor oper free variabl condit classic decid result select suitabl part leav room interact quantifi tempor oper talk object intend domain full power select fragment tempor oper describ develop time object simul behaviour ture machin bulk paper devot show condit result decid tempor fragment flow time obtain instanc tempor guard decid flow time hq finit domain obtain result develop techniqu appli prove decid proposit modal includ tempor epistem logic close tempor descript logic knowledg result paper applic cs theoret studi tempor logic hope discoveri natur decid fragment tempor logic stimul research field confin satisfi tempor formula equal function interpret model constant domain strictli linear flow hq interest model arbitrari domain finit domain decid fragment construct finit domain set formula satisfi arbitrari tempor model properli set formula satisfi model finit domain decid result mention hold tempor logic finit domain result appli languag sort special intend talk time predic tempor access quantif point time logic mean express tempor properti oper common altern reason time logic approach proposit case yield monad logic interpret strict linear predic case lead call sort refer point time domain relat investig intens context tempor proposit languag express power class flow tempor proposit languag express turn formula express interest class flow time remain open literatur tempor natur fragment express complet show natur formula quantifi appli formula free tempor variabl approxim dual violat formula fragment turn express complet fragment translat decid result fragment carri fragment give decid proof fragment reli repres tempor model satisfi formula form import featur size domain finit bound term algorithm express exist satisfi formula monad logic rabin decid make reduc satisfi problem formula model base hq linear tempor structur satisfi problem fragment classic logic complex algorithm suppli reduct construct algorithm perform flow investig structur satisfi obtain explicit elementari algorithm provid oracl capabl decid satisfi problem classic formula mention modifi algorithm check satisfi model finit domain algorithm cover flow time adapt proof decid proposit tempor logic paper organ section defin syntax semant tempor logic prove monad fragment undecid introduc fragment formula section introduc section give procedur monad logic section give section modifi form finit domain section describ case section prove express complet obtain criteria singl number decid fragment tempor includ fragment guard fragment show applic tempor epistem descript logic section list open problem acknowledg grate robin stimul comment suggest work author partial support uk epsrc grant work author partial support uk epsrc visit fellowship grant russian foundat basic research tempor logic denot tempor languag construct standard ffl predic symbol fix ffl individu variabl ffl individu constant ffl boolean ffl quantifi individu variabl ffl tempor oper set predic symbol assum proposit denot assum suffici suppli unari predic infinit set var individu variabl classic languag result omit formula standard fl interpret tempor model form strict linear order repres flow domain function associ moment time transit state moment predic ariti proposit variabl predic simpli proposit constant element requir simplifi omit superscript write clear context assign function var simpli model assign defin induct usual ffl iff true write ffl iff ffl iff ffl iff assign differ ffl iff interv fu ffl iff ffl iff ffl iff ffl iff ffl iff ffl fl iff exist successor class strict linear tempor logic denot set valid ii assign tl fin stand set valid model base linear order finit domain tl fin write tl fin similar notat hq remark paper model constant domain satisfi model expand domain reduc satisfi model constant domain undecid fragment theorem limit hope find decid fragment tempor logic fragment formula distinct individu mo denot monad fragment set formula unari predic proposit theorem set mo proof show reduc recurr tile problem satisfi problem monad recal tile squar fix orient colour edg recurr tile problem formul finit set tile tile determin tile occur infinit row problem find exist function ffl ffl ffl set fn infinit set ft tile associ unari predic requir unari formula defin tempor formula mo conjunct fl show satisfi model base frame iff recurr tile defin recurr tile put fm select infinit set iff clear satisfi ii satisfi satisfi model infinit ascend successor conjunct find set fn infinit bi chain element iff defin function straightforward check recurr tile class mention formul theorem theorem class tempor class strict linear order mo tl fin proof reduc undecid problem satisfact problem monad model finit ture determin stop start empti tape determinist ture machin state space initi state halt state tape alphabet stand transit function ffi configur repres infinit word form mark left side save belong repres activ cell current state start repres construct monad satisfi model finit domain frame iff stop reach halt start idea codifi configur element behaviour time ff associ unari predic ff sentenc ff fi mean object belong set ff ff mark object repres activ cell configur predecessor unari defin transit configur simul mean ff fi fl ff fi fl ff ff formula defin unari predic intend mean fix moment time machin reach configur remain ensur exist sequenc repres halt configur save start empti tape conjunct formula fl ensur moment time satisfi successor hard check satisfi model finit domain frame iff stop start empti tape proof clear satisfi world model base linear order finit repres halt configur observ object maxim chain chain exist finit view repres start configur empti tape definit reach halt configur start empti tape set mo tl fin undecid complement set monad hard satisfi monad arbitrari model base domain fix reduc satisfi proposit tempor formula decid formula note undecid proof tempor formula form free variabl fragment formula sort definit denot set subformula form free variabl formula call formula quantif tempor context free variabl assum formula set denot closur negat set subformula formula free denot set subformula formula con set constant loss identifi finit finit distinguish finit set formula conjunct formula formula free variabl reserv unari predic sentenc fix proposit variabl call surrog formula denot formula result replac subformula form scope occurr surrog occurr tempor oper call set codifi model imagin find satisfi separ tempor pure part attent pretend friend deal assum friend obtain realiz set subset structur exist build complet stock satisfi task fit structur tempor model satisfi care formula form reli good friendship formula concern aim section show modulo tempor model codifi structur call view model state disjoint domain bound number element domain element satisfi set subformula correspond element state establish special function call run variabl occur put definit type subset ffl iff ffl iff type type constant pair ci call index type denot simpli finit type state model assign set type realiz state set type hold constant motiv definit definit set type con ci set index type ft ci con pair ht con call state candid state candid repres state tempor model singl requir definit definit state set type realiz state candid ht con condit ffl ft ffl con ff state candid finit realiz exist finit realiz denot number distinct realiz state candid clear lemma state candid ht con realiz iff ff con satisfi proof immedi definit lemma realiz state candid ht con realiz form set fa cardin proof classic model languag countabl equal posit defin central notion linear order definit state function map associ realiz state candid ht con definit state function ht con run function set tw ffl tw ffl iff ffl iff definit state function set run pair ri call condit ffl function defin ci con run ffl tw exist run case state candid call satisfi tw remark note set run exist base state function iff set run interest satisfi tempor formula arbitrari model form simplifi denot deal satisfi model finit ri finit theorem satisfi model base iff satisfi proof satisfi model ii defin ht con tw ft con ci easi function run set run ri satisfi note finit finit satisfi cardin cardin run put type ae tw lemma exist domain realiz hr ii show induct assign iff basi case induct step induct hypothesi obviou induct iff iff iff iff iff formula consid analog requir monad theori quickli deduc decid result translat monad logic statement satisfi exist auxiliari formula introduc unari predic variabl type defin type ae denot conjunct formula defin run set realiz state candid unari predic variabl defin monad sentenc oe con con ae con con con con con linear oe iff exist subset partit state function defin remark line state constant con defin run code line express condit definit conjunct line satisfi oe iff satisfi note construct oe appli fact decid monad logic obtain decid result fragment theorem algorithm capabl state candid realiz class flow class finit strict linear class strict linear class linear order satisfi problem problem fragment decid proof sentenc oe construct effect theorem satisfi model base iff satisfi iff oe statement result case similar case hq decid problem oe rabin theorem decid satisfi model base finit linear order iff oe true finit linear order theorem statement decid standard translat logic section appli downward model flow time iff model countabl flow time theorem hold iff satisfi countabl order formula monad monad predic variabl occur defin relativ atom sentenc linear order iff intend interpret domain countabl strict linear order hq sentenc linear order defin oe involv satisfi countabl iff hq oe rabin statement decid complet proof theorem remark similar result scatter order hq obtain combin method similar encod establish decid fragment tl fin theorem theorem place theorem prove theorem applic theorem found section satisfi hn arbitrari model translat monad logic section reduc satisfi problem sentenc decid problem high comput complex monad logic section demonstr prove decid fragment linear tempor make plain structur yield elementari provid determin realiz state candid elementari simplic logic languag tempor oper easi add requir idea show satisfi convert satisfi base period state period bound length section idea obtain satisfi criterion model finit domain fix notat sequenc state function run sequenc denot head tail denot concaten sequenc jsj denot length infinit subsequ state function understood state function defin lemma ri ff fr proof suffic observ run run run ri vice versa ff definit subsequ ri qi call qi ri ff formul lemma ri lemma jf occur sequenc infinit time proof occur infinit maxim number appli lemma delet head repeat yield satisfi requir properti definit sequenc realiz state candid form ht con sequenc element formula occur realiz step lemma form ht con jf occur infinit form jf run realiz formula form jf step con run realiz formula form jf proof run minim assum view lemma run construct run realiz step formula form assum realiz step lemma delet repeat interv select run realiz step analyz distinct formula form obtain run realiz formula step manner type time delet realiz run formula step jt requir satisfi compli definit pair type call suitabl iff lemma finit sequenc realiz state candid length ht con condit pair formula form realiz step sequenc pair adjac element pair adjac element con suitabl formula form realiz sequenc step proof show run arbitrarili condit construct sequenc pair adjac element suitabl accord condit continu sequenc order realiz formula form continu realiz result sequenc run construct sequenc pair adjac element suitabl run sequenc realiz obtain run observ sequenc run con consequ lemma immedi obtain theorem satisfi iff sequenc realiz state candid satisfi condit lemma state candid distinct jf jf proof theorem lemma satisfi iff true form lemma remain observ satisfi condit lemma finit sequenc state candid effect check satisfi condit lemma miss thing make criterion theorem effect algorithm detect state candid realiz modulo obtain algorithm decid extend develop techniqu obtain similar satisfi criterion model finit domain note satisfi hn finit domain begin observ formula behav differ model arbitrari finit domain put theorem mo tl fin proof start dai dog mo readili check satisfi model ii model finit domain interpret model linear flow time domain jdj jw tl fin aim section prove analogu theorem theorem algorithm capabl state candid finit realiz satisfi problem model finit problem fragment tl fin decid end modifi theorem show satisfi model finit domain iff base state function theorem finit realiz state candid finit set run idea strengthen condit lemma sequenc realiz formula form infinit run form ht number finit remain technic ensur type li run solv kind sequenc type ht realiz ff make run result run form fix ff type claim version lemma lemma finit realiz state candid ht con sequenc hn realiz jd proof distinct finit realiz state candid finit realiz maxf fi fi fi fi fi fi kg definit ri linear order finitari finit realiz state candid finit prove finit analogu theorem hold linear flow time theorem satisfi model finit domain iff satisfi finitari ri proof implic establish proof theorem satisfi finitari ri number suppli lemma defin domain model construct lemma exist domain realiz hr ii proof theorem show satisfi ri defin relat iff denot class gener defin relat iff ffl ffl lemma number distinct class exce proof fix defin function oe oe ae iff oe oe remain observ number function finit analogu lemma prove similarli lemma lemma lemma ri finit hf qi finit jf jf prove finit version lemma delet techniqu lemma ri ff fr proof immedi definit lemma hf ri form ht con jf infinit ri ff finit jf run realiz formula form jf step con run realiz formula form jf jf proof run exist assum view lemma run obtain ri run realiz infinit formula assum realiz step lemma delet interv construct ri run realiz infinit note analyz distinct formula form obtain ri finit run realiz step class infinit manner type time delet arriv ri finit infinit formula form realiz step compli posit prove finit analogu lemma lemma finit sequenc realiz state candid length ht con condit sequenc type pair pair sequenc formula form realiz step pair adjac type sequenc pair suitabl pair adjac element con pair formula form realiz step finit set run ri proof defin finit set run sequenc type satisfi condit condit formul lemma finit sequenc type sequenc type sequenc type consist infinit word form sequenc type sequenc type ffl pair suitabl ffl readili check word run ri needless finit put lemma theorem satisfi model finit domain iff sequenc finit realiz state candid satisfi condit lemma state candid distinct jf jf criterion theorem reduc satisfi problem model finit domain finit satisfi problem form ff immedi satisfi hr finit domain present method reduc decid fragment classic decid problem finit flow time real decid problem finit domain arbitrari defin class flow hq reduc corollari case arbitrari domain remain prove theorem theorem algorithm capabl state candid finit realiz decid sentenc satisfi model flow time finit tl fin decid proof occupi section method base chapter idea proof theorem decid finitari sentenc flow time consist finit set run run moment time give finit realiz state candid finit realiz state candid instantan descript run show describ run longer interv rang interv decid descript run algorithm decid complex simpler part decid satisfi lemma show descript run built finit step instantan descript realiz state lemma combin idea serv prove theorem theorem lemma decid flow time class flow time reduc theorem corollari algorithm sentenc state candid finit realiz decid satisfi model finit domain flow hq class finit linear class linear order proof prove part introduc proposit variabl defin abbrevi abbrevi state bound unbound accumul point model flow time interpret isomorph defin relativ tempor connect induct usual ff ff atom similar easili model flow time finit domain iff model flow time finit domain prove part part corollari prove similar reduct part downward theorem theorem express complet part model flow time endpoint defin iff model hq detail left interest reader altern proof theorem begin proof theorem definit describ run interv simplifi frequent identifi structur write linear order denot languag immateri signatur unari predic linear order subset definit set oe form quantifi depth logic finit note model set type recal jt linear order defin fw underli order iff denot definit oe oe left endpoint oe oe endpoint oe oe oe linear order hw write underli order order lexicograph ii hw ji iff iff ii write underli order write simpli argument theorem show notat linear order oe write oe uniqu oe oe oe write oe oe charact describ run interv charact definit charact pair con set con con function finit charact charact con left endpoint oe left endpoint charact con ffl oe ffl oe set oe oe type ffl ft oe oe con ci ff finit realiz state candid combin simpler charact complex notion linear order set class relat class order induc order obviou inform definit linear con hs con charact write con con oe oe oe oe oe oe oe write endpoint left endpoint left endpoint condit oe oe oe oe ig condit convex subset ffl left ffl singleton subset iff oe oe ffl oe oe oe oe oei set fk oe oe ig condit decid legal perfect charact defin charact reachabl finit applic definit definit denot smallest set charact charact linear charact legal defin charact descript run definit charact con perfect oe ffl oe ffl oe ffl oe oe oe interv linear order domain convex subset order induc notat identifi subset linear order note isomorph interv repres standard notat fz yg charact describ run interv potenti finitari make definit tripl linear order isomorph interv state function ht con finit realiz state candid finit set function satisfi ffl map defin ci con ffl tw definit ri con charact write ffl con ffl rg main lemma lemma perfect ri ri finitari legal exist finitari legal perfect charact oracl determin state candid finit decid exist legal perfect charact algorithm uniform theorem part lemma show model flow time finit domain iff exist perfect legal charact part algorithm decid sentenc state candid finit decid charact exist theorem lemma proof lemma straightforward con perfect ri run ri finitari oe oe satisfi oe satisfi oe isomorph interv proof lemma prove part lemma call show legal charact definit suffic prove hold linear charact con charact definit oe oe oe type order domain defin finit realiz state ft oe oe con ci ff oe defin oe oe oe observ oe oe definit oe oe iff oe iff oe oe oe oe oe oe oe oe oe isomorph interv fr oe oe sgi evid induct linear order con hs con hw charact defin ri show ri show isomorph interv order assumpt show endpoint left clear interv left isomorph interv case similar endpoint element left endpoint definit case definit function defin write function defin lemma proof write definit defin state function write ht con definit divid case part definit case arrang con check con con definit lemma obtain con con oe case definit defin check ri defin fr sg finit ffl ffl tw seek hw ii oe oe oe oe oe lemma satisfi oe oe ffl prove check oe oe condit definit oe oe oe oe oe assum defin fr jrj jr finit ffl con ffl tw find hw pick defin ffl oe form oe oe oe equal oe oe clear definit similar case involv case definit part observ definit oe oe oe oe pick oe oe note definit charact set fi empti relat partit js sequenc simpl impli note finit simpl sequenc fr oe oe sg simpl ffl observ con ffl lemma oe oe rg ffl ji tw requir pick definit oe oe oe fk oe oe ig relat satisfi condit oe oe write similarli defin oe oe denot set defin similarli ji ji oe pick biject charact oe pick fjg oe sequenc simpl set fk analog properti hold argument theorem show oe remark part argument fail obviou analogu densiti condit definit case necessarili case conjectur argument half appli arbitrari domain proof lemma argument similar ri finitari satisfi interv write fre note write charact clear perfect show legal lemma linear order interv interv proof definit check con hs con con con part conclud con con part definit follow easili fact rg definit interv good legal lemma interv good proof domain claim con oe form oe oe oe type finitari ft oe oe con ci ff ci finit realiz state candid lemma assum condit lemma good good proof suffic prove interv endpoint left endpoint assum case similar left endpoint lemma conclud lemma assum condit lemma good good proof case case handl lemma write ij interv lemma induct ij good finit ramsei theorem infinit ij constant minim lemma suffic prove ix good assum ij constant assum ramsei ij show disjoint convex subset union endpoint left lemma left endpoint con hs con usual ffl lemma con con con ffl oe oe oe oe ig true definit assum conclud good definit defin binari relat iff convex subset convex subset good lemma relat interv proof transit proof assum check depend clear assum convex subset good situat lemma good case similar requir clear definit convex lemma subinterv good proof depend endpoint result trivial assum endpoint endpoint sequenc order type unbound good situat lemma conclud good cover case lemma lemma close interv proof upper bound show interv lemma show good lemma show good greatest lower bound close aim show singl assum element lemma show order hr open interv finit set fh ni ig cardin open interv sequenc oe ni charact fe ni empti definit isomorph endpoint lemma condit hold lemma left underli order left endpoint jej iff part definit hold fe good lemma lemma show subinterv good interv good fe xg subinterv good fz defin similarli lemma good lemma contradict singl legal complet proof proof lemma assum oracl state candid finit realiz show decid exist legal perfect charact procedur uniform method reduc problem satisfi existenti monad sentenc theorem problem decid reduct quick avoid semant method convolut obtain decid easi tediou give direct algorithm recal logic finit easili construct finit set quantifi depth close singl negat sentenc logic sentenc negat subset charact pair con denot power con con note object lemma oe con con con decid oe charact proof oe iff sentenc sentenc oe true linear order decid monad theori linear order decid oe charact decid suffic show decid charact legal perfect decid inspect charact perfect part lemma con con decid con charact proof simpli check charact oe check inspect definit oe set oe oeg type check oracl ft oe oe con ci ff finit realiz state candid charact iff check succe lemma set charact charact decid exist linear order charact proof refer definit decid charact left endpoint notat formula variabl defin relativ usual renam variabl occur set ff atom ff ff ff ff ff ff ff variabl harmless renam variabl note oe satisfi countabl countabl linear order emb unari oe true interpret symbol fpg case definit introduc unari predic oe oe oe oe oe iff conjunct sentenc true oe oe result decid definit boolean combin decid decid finit possibl unari predic conjunct sentenc xp model iff interpret disjoint unbound order type formula oe oe oe oe oe iff conjunct sentenc true oe statement charact check effect con con con oe oe oe oe ig decid make copi signatur object renam symbol assum consist symbol order write ls result replac relat symbol unari predic set con charact write hs con usual introduc unari predic ffl ffl ffl iff class includ occur ffl copi add sentenc con lc con lc ffl oe copi oe add sentenc oe oe oe oe ffl oei oe introduc unari predic oe add oe tripl form oe fix oe oe hard check conjunct sentenc true iff ig provis definit met decid definit decid charact legal build set lemma check charact linear order lemma put increment repeat termin check determin complet proof lemma theorem applic appli condit decid criteria obtain order singl number decid fragment tempor logic begin discuss major altern approach tempor logic tempor logic logic domain time languag logic base ffl infinit set individu variabl set constant domain ffl infinit set individu variabl tempor ffl binari predic symbol sort ffl predic symbol sort domain formula defin ffl tempor variabl ffl predic symbol sort tempor domain tempor domain ffl tempor domain formula interpret tempor model usual form flow time strict linear domain function associ moment time predic ariti ariti assign function associ tempor variabl moment time associ domain variabl element truth relat defin induct ffl iff ffl iff ha ffl iff assign differ ffl iff assign differ standard boolean clear tempor oper express express interest class flow time turn express complet natur fragment definit consist subformula form free tempor variabl predic symbol predic symbol defin translat fix tempor variabl ft ft ft ft tempor variabl note mean translat explain definit ii assign assign ai bi write ai lemma ai bi moment time wi iff proof easi induct definit class flow express complet free tempor exist formula model base flow time theorem class flow time class ff finit linear express complet express complet proof kamp theorem chapter proposit tempor logic express complet monad logic formula monad logic free variabl unari predic fix proposit tempor formula structur base flow time valuat vi wi iff free tempor variabl express translat tempor model base flow time prove subformula free tempor express proof induct case atom put put case induct exist express express case list subformula form occurr scope domain quantifi form free tempor variabl induct exist express replac occurr scope predic symbol monad logic denot result monad firstord formula proposit formula replac proposit variabl result formula express complet induct express prove claim theorem prove observ remark result express flow time hq class finit linear flow theorem class flow denot set true model base frame ts fin set true model base frame finit domain set defin proof theorem construct effect consequ lemma theorem obtain corollari fragment fragment decid fragment tl fin fragment ts fin decid fragment remind reader languag variabl sublanguag formula domain variabl denot class flow time mention formul theorem class finit strict linear class strict linear order rang class finit strict linear rang theorem fragment tl fin ts fin decid proof ff state candid formula individu variabl satisfi problem formula decid variabl fragment finit model finit satisfi decid remain criteria theorem corollari set set domain corollari fragment tl fin ts fin decid remark worth note set formula correspond proposit languag tempor oper modal oper defin translat fix individu variabl recal product proposit tempor logic determin class linear order set formula valid frame form hw vi hw iff relat defin vi hw iff inform product modal refer reader easi formula belong iff valid tempor model base linear order valid denot proposit tempor logic determin observ logic coincid logic agent doesnt doesnt time decid logic determin class frame form hn finit consid literatur proposit version tl fin logic proof similar theorem correspond assumpt finit run system monad fragment interest fragment set mo monad tempor formula fragment mo consist involv predic symbol sort domain shown section fragment mo mo tl fin undecid case languag mo mo mo mo formula ff state candid mo monad monad fragment logic decid finit model properti theorem fragment mo tl fin mo mo ts fin mo decid guard fragment natur gener guard formula definit denot gf smallest set ffl atom formula gf ffl gf ffl tupl gf free variabl occur occur gf set gf call guard fragment tempor languag write gf guard fragment gf languag note unlik guard fragment gf classic decid tempor guard fragment interpret time structur turn theorem gf proof proof similar theorem simpli write requir formula set tile ft binari predic unari defin conjunct fl belong gf readili satisfi iff recurr tile defin guard fragment atom formula close boolean connect tempor quantif tupl free domain variabl occur gf gf theorem fragment gf tl fin gf ts fin decid proof theorem corollari result theorem establish show gf decid state candid realiz evid proof theorem gf express complet result theorem corollari gf ht con state candid lemma decid realiz suffic show decid ff con model formula gf ff transform guard sentenc unari predic observ gf relativ logic atom gf boolean case guard atom definit guard formula con logic gf classic model ff model iff model logic result gf decid finit model decid ff requir tempor descript logic notion paper gener introduc prove decid satisfi problem tempor descript logic descript logic de giacomo lenzerini extend model base time structur satisfi problem hq arbitrari strict linear order left open paper techniqu section show problem decid theorem algorithm capabl decid formula satisfi ffl ffl ffl hq ffl finit linear ffl arbitrari strict linear order qualifi number restrict count finit model finit model reason decid satisfi problem decid model finit domain inform connect descript logic modal open question end paper problem work result extend flow time arbitrari countabl logic theorem result extend tempor logic logic flow histor necess ctl comput complex satisfi arbitrari formula flow time consid oracl determin state candid natur decid fragment refer abadi power tempor proof proc symp logic comput page june van den bussch tempor connect versu explicit timestamp tempor queri languag clifford recent advanc tempor page van den bussch tempor versu logic queri tempor acm symposium principl page complet problem verif program program scheme mathemat foundat comput scienc lectur note comput scienc van benthem modal languag bound fragment predic logic journal philosoph artal franconi comput account descript logic time action fourth confer principl knowledg page morgan kaufman artal franconi tempor descript logic van handbook time tempor reason artifici intellig mit baader hj ohlbach terminolog knowledg languag journal appli yu gurevich classic problem perspect mathemat logic jr method restrict order arithmet methodolog philosophi intern page stanford burgess gurevich problem linear tempor logic notr dame journal formal chomicki tempor queri survei gabbai tempor intern page lectur note art chomicki feasibl check tempor integr constraint journal comput system emerson tempor modal logic van handbook theoret comput page vardi reason knowledg mit reynold tempor logic part clarendon finger tempor logic part ii clarendon gabbai product modal logic part journal quantif modal logic dm gabbai handbook philosoph volum page kluwer academ de giacomo lenzerini tbox abox reason express descript logic confer principl knowledg page morgan kaufman restrain power guard journal symbol gurevich elementari properti order group algebra english version tran amer math soc gurevich expand theori order group annal mathemat harel effect transform infinit applic high fair journal hodg model volum mathemat applic cambridg kamp logic theori linear order phd lo kamp formal properti leonard elementari theori linear order fundamenta im math manna pnueli tempor logic reactiv concurr specif manna pnueli tempor verif reactiv safeti merz decid incomplet result tempor logic linear time journal appli languag variabl fur mathematisch logik und grundlagen der pnueli applic tempor logic specif verif reactiv survei current trend current trend lectur note comput page mo rabin decid order theori automata infinit tree transact american mathemat mo rabin decid theori handbook mathemat page ramsei problem formal logic proc london math reynold tempor linear time studia rosenstein linear order academ schild combin terminolog logic logic confer artifici page scott method valid sentenc variabl journal symbol tempor aspect logic procedur definit inform stirl modal tempor logic gabbai handbook logic comput volum page clarendon semant consequ relat tempor logic journal theoret comput incomplet tempor logic journal theoret comput wolter zakharyaschev tempor descript logic combin kluwer academ wolter zakharyaschev decid fragment modal logic submit
IR/264 5 text select longer queri wu clement yu meng liu depart illinoi il depart illinoi il depart suni ny school abstract metasearch engin system support uni ed access multipl local search engin main challeng build metasearch engin solv select ecient accur determin small number potenti local search engin invok user queri search repres approxim content creat advanc enabl select repres integr singl repres make select process scalabl integr repres high scalabl found ectiv short ectiv longer queri signi cantli lower internet queri initi submit user short queri found search ectiv achiev addit term ad initi queri queri relev feedback result queri longer initi queri method construct repres decid select longer queri result compar perform method previou method metasearch resourc distribut text introduct search engin creat facilit nding desir inform web search engin text de ned set document search search engin search engin interchang index document creat advanc term repres content word combin content index identifi document term quickli search engin support vector space queri queri repres set term boolean consid paper user queri boolean oper major search engin googl attempt index entir web provid search capabl web page central search engin su er number limit index tini fraction page web due reason robot lack link point site document index document access search engin major search engin higher percentag index inform time consum refresh content search engin peopl doubt scalabl central search engin technolog search entir web ten thousand local search engin focu document con ned domain document organ speci subject area cora search engin comput scienc research paper medic world search search engin medic inform organ instal search engin everydai recent survei combin coverag web search engin hundr time larger singl search engin reason search engin special document collect index web robot emploi search engin approach provid search capabl larger portion web singl search engin combin search engin metasearch engin approach metasearch engin system support uni ed access multipl local search engin maintain index web page sophist metasearch engin maintain characterist inform underli local search engin order provid servic metasearch engin receiv user rst pass queri local search collect result local search engin addit potenti search coverag advantag metasearch engin search engin easier index data date local search engin cover small portion web run metasearch engin requir smaller invest hardwar comparison run larg gener search engin googl challeng implement ectiv ecient metasearch engin main select problem user local search engin document queri object perform select improv ecienc send queri potenti search engin network trac cost search useless reduc order perform select repres store metasearch engin content collect fusion problem retriev document select merg document object list document ahead heterogen multipl search engin make dicult achiev good fusion good metasearch engin retriev ectiv close document singl minim access cost approach perform select collect fusion method framework develop rank optim base similar similar document local section inform linkag web page ect relev document queri type inform successfulli retriev relev document shown linkag inform incorpor repres yield accur select restrict repres handl similar document main contribut paper type repres type repres di erent metasearch engin repres kei featur rst permit accur estim similar similar document respect user queri section similar similar document respect user queri rank optim queri nding similar document posit integ featur repres captur relationship queri term depend relationship multipl queri term document captur featur special estim similar similar document queri term result method substanti accur exist method longer queri contribut paper consist provid type repres retriev document high ectiv maintain high captur essenti noun phrase complet automat exist noun phrase identi cation system requir substanti manual labor creat tag corpu internet numer collect special vocabulari essenti oper carri automat rest paper organ section relat work review compar section review framework perform select collect fusion similar similar document section present techniqu base framework result present section conclud paper section relat work larg number research paper issu relat metasearch engin distribut collect publish approach rank queri base measur ggloss sum document similar higher threshold cori net probabl relev document due term queri sum document frequenc queri term weight cue valid varianc document frequenc queri term similar queri descript approach expect number document similar higher threshold rank method heurist design produc optim order base optim criteria measur rank similar similar document shown rank descend order similar similar document sucient condit rank optim retriev similar document posit integ sucient condit rank optim consid queri structur data select method consid queri structur data unstructur text data consid collect exist approach weight alloc retriev retriev document higher rank score cori adjust local similar document merg retriev document approach heurist aim retriev potenti document queri determin document retriev local approach tight local similar threshold local base global similar threshold approach aim retriev potenti document select minim retriev useless document problem type approach local similar function search engin similar function proprietari inquiru metasearch engin real global similar document merg retriev document advantag high qualiti merg achiev disadvantag document fetch metasearch engin enabl comput global similar collect fusion approach util estim optim order determin document retriev real global similar merg retriev document select collect fusion framework paper base previou work framework rst rank local optim sucient condit mention algorithm determin search document search return metasearch engin global similar return document merg return document framework review section kei step framework estim similar similar document queri base global similar function develop method estim method work exponenti comput complex number term queri method linear complex method separ repres queri compar repres order rank suitabl metasearch engin ten thousand local search engin method emploi integr repres small constant number rank queri method term storag requir comput ecienc common problem method suitabl handl short queri internet queri term averag due high comput complex due estim inaccuraci longer queri internet queri initi submit user short queri previou method adequ found search ectiv achiev addit term ad initi queri queri method construct repres decid select longer queri inform construct repres paper drastic di erent earlier includ major di erenc techniqu intend captur depend word document depend limit noun phrase spite problem dicult conquer approach emploi probabilist parser identifi exempli ed extrem varieti vocabulari accuraci su er signi cantli word special domain satisfi ordinari syntax rule approach base kei hypothesi respect term import characterist captur depend term term lie singl document maximum normal weight de ned term depend term captur document vector perform result show semant phrase captur method method highli scalabl yield high retriev ectiv theoret framework provid achiev optim result distribut environ recent result report show number document retriev compar number good retriev ectiv perform deterior substanti internet user interest nding small number good document queri method show good result environ section theori complet di erent result demonstr retriev document distribut environ essenti ectiv data site result depend exist train collect similar coverag subject matter term collect search internet environ data highli unclear train collect fact construct collect storag penalti high order accommod heterogen shown properli cluster retriev document distribut environ essenti ectiv central environ internet clear feasibl cluster larg collect perform dynam techniqu requir cluster document review work metasearch engin distribut inform retriev area framework select collect fusion queri paper simpli set word submit user transform vector term weight term essenti content word dimens vector number distinct term term compon queri vector term weight weight term depend number occurr term queri total number occurr term term frequenc weight weight term depend number document term rel total number document weight term base inform call document frequenc weight document similarli transform vector weight similar queri document measur dot product respect vector dot product divid product length vector normal similar similar function normal cosin function document frequenc weight term comput base global df term number document term comput similar global similar note overlap local sum local df term local approxim global df term overlap local sampl techniqu extend estim global df term number time term global df weight queri vector document term frequenc weight normal weight jdj length base cosin similar global similar queri document jq jdj jdj jdj review framework select collect fusion framework rst introduc user interest retriev similar document queri dn posit integ framework summar de nition optim cient condit rank optim algorithm integr select collect fusion base rank de nition set optim rank order dn respect queri posit integ exist similar document similar document order optim similar document queri sucient examin rst note order depend queri assum similar document queri distinct set similar document queri uniqu assumpt remov easili proposit dn optim rank order dn respect queri dn global similar similar document queri global similar similar document queri rank order queri base optim order dn develop perform select collect fusion algorithm sketch rst select select search engin return actual global similar similar document metasearch engin comput denot min valu search engin return metasearch engin document global similar greater equal min sim note document search engin return metasearch engin document return search sort descend order similar rst document return user optim order select process repeat total document return user note collect fusion base actual global similar document shown rank algorithm retriev desir document order appli framework problem solv gure obtain local document global similar queri greater equal threshold min sim iter note local search engin retriev document base local similar function term statist result local similar document di erent global similar document problem address discuss paper proposit ord search obtain global similar similar document estim requir similar method estim requir similar relat work section method design handl short queri estim accuraci signi cantli number term queri method rank method select base framework section kei step estim global similar similar document queri present type repres capabl handl longer queri estim similar similar document exist approach present result section term local maximum normal weight averag normal weight de ned document weight term normal weight jdj norm maximum normal weight document max jdj simpli averag normal weight document includ document term global document frequenc weight user queri queri vector global similar similar document respect estim max compar formula formula intuit estim similar document maximum normal weight queri term yield rst half express brace queri document averag normal yield half maximum similar document maximum normal weight queri term normal queri jq yield equal drop jq present impact rel similar valu similar document di erent chang reason formula inaccur explain queri term set term formula maximum normal weight term averag normal weight term averag normal weight term order magnitud smaller maximum normal averag comput document includ term document maximum normal weight term document term actual weight lot higher averag normal weight averag normal weight lead estim similar document term actual weight smaller averag normal weight result estim similar formula queri inaccuraci toler maximum normal weight larger weight queri problem averag normal weight term approxim weight term document sucient accur integr repres averag normal weight lead signi loss retriev ectiv short queri observ document similar queri estim similar document similar document queri base repres denot set term term set document maximum normal weight document practic singl document assum document denot document unrel restrict relationship term term phrase compon phrase occur word term occurr word occurr remov form reduc document repres de ned distinct term repres term reduc document maximum normal weight term base similar similar document estim queri term term document identi ed repres similar comput similar similar document estim largest similar max note comput formula accur reduc vector origin document vector formula consid document maximum normal weight queri term document maximum normal weight queri term similar queri higher produc formula similar produc formula wont result formula accur section larg number document exponenti function number distinct term reduc vector compon amount space repres jtj number term amount storag space approxim assum jtj term million internet number grow rapidli essenti total storag space independ number achiev storag comput idea integr repres emploi separ repres singl integr repres construct metasearch engin design search search engin queri small sucient user relev search engin select internet user examin small number document sucient reduc document vector di erent largest maximum normal weight identi er repres speci term reduc document maximum normal weight document reduc document largest maximum normal weight term integr repres term set pair format integr identi er pair arrang descend order maximum normal weight term global document frequenc weight term integr repres idea integr repres store reduc document maximum normal weight import potenti queri reduc document maximum normal weight term discard evalu queri integr estim similar similar document id term appli formula restrict occur term queri queri estim comput independ number method highli scalabl term comput respect number integr repres scalabl term storag requir rough bound number distinct number metasearch engin total number distinct term exce small constant number piec inform reduc document vector identi store repres set term hash tabl id assum term occupi byte term id occupi id occupi global document frequenc weight occupi reduc document vector compon compon repres term id weight total size integr repres byte byte store term id global idf reduc document byte store compon reduc document vector occupi byte hash tabl give correspond term id occupi byte found experi averag approxim size hash tabl total storag space repres clear bound number distinct term million term scalabl approach good store small constant number piec inform term term number piec inform store term constant factor number integr repres approach highli scalabl comput storag select method ectiv desir document small number select method section conduct experi evalu ectiv method base rigor measur proposit show queri constitut internet queri local select integr repres similar document respect queri proposit number document desir equal number document store integr repres queri similar document queri local store document queri term note weight multipl term queri result report result experi obtain ve trec collect creat nist institut standard technolog ve collect cr record fr regist ft time fbi foreign broadcast inform lat select articl lo angel collect partit size rang document document total document gb slightli million distinct term test queri experi queri rst trec confer typic trec queri consist part descript topic part queri experi queri term averag length queri slightli averag length real internet queri perform measur method search similar document set rst measur ectiv retriev measur ect ecienc retriev percentag correctli identi ed ratio number document retriev similar document percentag denot cor iden doc percentag sum similar similar document ratio sum similar retriev document sum similar similar document percentag denot sim doc user interest retriev similar document similar retriev system retriev similar document similar similar document measur cor iden percentag similar document retriev measur sim percentag measur measur cor iden doc search ort ratio number search algorithm number similar document ratio denot db ort ratio higher lower document search ort ratio number document receiv metasearch engin measur transmiss cost ratio denot doc ort set measur report paper averag queri set real term result previou integr repres approach integr repres approach tabl comparison previou repres retriev similar document tabl cor iden doc sim doc db ort doc ort tabl result previou integr repres approach cor iden doc sim doc db ort doc ort tabl result integr repres approach observ made tabl integr repres higher retriev ectiv longer queri mention averag trec queri close time longer typic internet percentag correctli identi ed document rang previou integr repres gure repres previou approach give optim perform queri previou percentag correctli identi ed document drastic queri longer queri slightli half similar document retriev previou approach percentag slowli tabl queri gure rang approach retriev similar queri term number term queri previou repres repres tabl comparison previou integr repres cor iden doc result select document retriev method repres achiev higher perform longer queri previou approach experi conduct determin percentag noun phrase captur integr repres mention trec collect topic queri queri adjac term manual examin form noun phrase noun phrase noun determin phrase reduc document vector integr repres found percentag phrase captur integr repres shown tabl rst implic document perform term identifi noun phrase restrict document maximum normal weight term term close proxim term maximum normal weight formula appli integr repres estim similar similar document potenti inaccuraci repres captur miss percentag captur repres repres addit phrase tabl captur noun phrase inaccuraci due phrase captur phrase reduc document phrase highest maximum normal weight term repres provid partial remedi provid process identifi addit term occur adjac locat queri term maximum normal weight denot document maximum normal weight denot document dm max high fact higher consid phrase maximum normal weight top maximum normal weight id maximum normal weight achiev store integr repres consist top reduc document vector individu id top maximum normal weight phrase construct id cor iden doc sim doc db ort doc ort tabl integr repres addit noun phrase integr experi repeat found percentag noun phrase queri captur repres row tabl note phrase captur automat techniqu necessarili accuraci retriev similar document tabl type ecienc access vari tabl order retriev similar addit access percentag addit document access vari tabl measur sim doc essenti optim retriev achiev tabl conclud remark accur estim similar similar document queri critic order rank optim previou solut design estim desir similar short queri type repres suitabl handl longer queri inform construct type repres drastic di erent approach main di erenc repres captur depend word document produc accur estim longer queri result trec collect approach yield high retriev ectiv maintain high scalabl ect approach noun phrase captur repres automat techniqu applic type includ collect special vocabulari astronomi comput scienc work support part nsf refer baumgarten probabilist model distribut inform retriev acm baumgarten probabilist solut select fusion problem distribut inform acm sigir bergman deep surfac hidden juli broder techniqu measur rel size overlap public web search engin www april page anatomi hypertextu web search engin network du automat discoveri languag model text acm croft search distribut collect infer network acm cardi pierc prune treebank grammar base noun phrase cation proc annual meet acl pp associ comput church stochast part program noun phrase parser unrestrict text proc confer appli natur languag associ comput experi select search engin metasearch acm juli pp gauch adapt agent inform gather distribut inform sourc aaai symposium intellig agent cyberspac gener gloss broker hierarchi merg rank heterogen internet sourc thistlewait method inform server select acm transact inform januari saracev real life inform studi user queri web acm sigir srivastava inform manifold aaai spring symposium inform gather distribut heterogen kirsch futur internet infoseek experi search internet acm sigir pp kleinberg authorit sourc hyperlink environ symposium discret kwok chan improv retriev short acm lee gile search world wide web april lee gile neci meta search engin seventh intern world wide web lee gile access inform web juli de pedersen phrase recognit queri queri liu queri rout digit librari system ieee intern confer data rish statist method estim text ieee tkde meng discov repres search engin technic search broker usenix symposium internet technolog rish determin text search internet rish estim search engin liu detect heterogen multipl text environ liu build ectiv ecient metasearch engin acm comput survei resourc discoveri digit librari work group salton introduct modern inform retriev etzioni metacrawl architectur resourc aggreg web ieee etzioni queri rout web search architectur experi collect fusion problem li ectiv metasearch engin tenth world wide web confer hong callan ectiv retriev distribut collect acm sigir pp xu croft languag model distribut acm rish methodolog retriev text document multipl ieee transact knowledg data engin meng principl queri process advanc applic morgan kaufmann san rish ecient ectiv metasearch larg number text liu ecient ectiv metasearch text incorpor linkag document acm sigmod lee server rank distribut text resourc system internet dasfaa
ML/265 6 machin seventh intern pp june increment learn explan pattern indic ram colleg comput georgia institut technolog georgia abstract paper describ reason improv understand incomplet understood domain applic problem domain recent work ai dealt issu past explan store reason memori understand situat process assum past explan understood provid good futur situat assumpt learn situat encount domain understood complet reason assum reason gap knowledg base reason reason fill gap inform reorgan explan gradual evolv understand domain present stori understand program retriev past explan situat build explan understand stori terror system refin understand domain fill gap elabor learn indic explan type increment learn system improv explanatori knowledg domain increment fashion learn xp learn reason learn program deal issu past experi case plan learn situat problem descript remind case retriev result process case give planner adapt result case specif situat appli adapt result situat intent reason avoid effort involv explan plan simpli result previou case process assum past case understood provid good futur case determin perform system situat assumpt learn case encount domain understood complet reason assum reason gap knowledg repres case past case guid process situat addit past case understand reason learn case improv understand domain import problem address reason suit machin learn approach learn occur increment gap fill experi paper describ stori understand system retriev past explan situat build explan understand situat encount newspap stori terror system learn increment fill gap retriev explan understand situat newli learn inform depend kind system fill piec knowledg result explan fill gap exist elabor exist explan explan detail deal reorgan knowledg memori reason situat piec knowledg appli type learn leav system closer complet understand domain type learn result set gap system realiz learn turn drive system learn learn increment process type reason learn modifi piec inform experi paper present theori increment learn stori understand explan pattern discuss learn describ learn depend learn knowledg put problem build motiv explan understand stori understand construct explan rule connect typic goal plan peopl ineffici complic motiv causal chain step long understand explan stereotyp situat explan repres standard pattern observ call explan pattern understand situat explan pattern appli xp avoid detail analysi situat scratch xp abstract repres gener base understand experi paradigmat case similar situat futur situat repres xp goal goal goal satisfi goal goal valu goal threaten violat perform action satisfi action neg effect violat learn explan pattern stereotyp xp form work learn focuss problem learn gener causal structur underli situat mitchel detail xp found difficult determin correct level gener stori provid inform prove explan correct understand content compet jump mean real world learn system deal problem incomplet incorrect domain knowledg system memori past experi case correct explan question attach repres understood verifi understand read remind past explan attempt appli explan understand case gradual refin indic learn understand learn rang applic xp xp memori recal relev situat xp learn increment process theori involv reason learn process program stori understand program learn terror read newspap stori terrorist incid middl east schank read stori bomb attempt understand construct causal motiv explan event stori case memori base xp explain past situat improv explanatori knowledg domain process increment modif xp read bomb stori york april boi recruit car april captur isra hour car bomb mission blow isra armi headquart strike account singl stori episod provid case interpret deal aspect stori explan anomali set explanatori case famili background spent free time ride plai kill recruit mission read build hypothesi tree repres anomali perform action result altern construct appli xp situat question verifi answer religi bomb religion religi final explan built stori involv applic stereotyp system learn variant xp base manner adapt fit stori learn indic xp kind learn import reason system start learn indic explan pattern xp learn scratch appli exist xp xp index memori appropri futur situat xp index memori retriev situat applic imposs practic applic condit possibl doesnt result show gener hard addit gener applic understand learn featur suggest possibl relev xp complet determin applic xp situat classic situat rich cheat understand process build hypothesi tree irrelev paper detail found wife monei threat exposur read rich suddenli began withdraw larg sum monei bank expect possibl read stori theoret explan point xp stereotyp situat peopl memori understand learn stereotyp categori serv indic motiv explan type induct categori format gener process constrain featur select gener causal relev explan index index motiv xp memori typic context xp encount charact stereotyp repres typic categori peopl xp applic learn context charact stereotyp repres type person expect involv explan discuss learn indic learn situat indic learn context stereotyp xp situat indic xp futur main issu context gener index situat index neg side effect issu isnt correct util discuss possibl actor ordinarili neg side effect xp theori replac gener reason form specif reason stereotyp situat effici gener read expect read stori bomb attack read stori kill fail high school theoret explan index xp bomb gener goal violat goal central explan situat index variant read stori isa scene situat index gener xp xp xp figur learn situat indic xp upward line repres isa downward dot line repres scene heavi line repres situat point xp built situat index copi stereotyp situat gener logic descript situat explan index copi explan retriev xp indic reason copi origin xp modifi discuss learn stereotyp indic main constraint theori stereotyp learn kind stereotyp learn retriev explan provid kind discrimin index xp memori volit explan concern goal plan belief learn algorithm produc typic collect plan predict featur element collect call charact understand situat learn stori situat index xp necessarili xp appli xp ordinarili mind situat type charact stereotyp serv motiv categori charact import index xp memori learn stereotyp repres typic index xp stereotyp built explan gener featur charact involv answer boi boi bomb explan build stereotyp typic typic typic typic ag ag religion gender male nation index stereotyp index situat index label mark featur true stereotyp featur definit stereotyp label question mark featur incomplet refer unknown goal fill inform repres goal unknown label mark featur true stori causal relev explan featur retain recognit learn assum explan possibl learn explan futur determin featur explanatori implement stereotyp index explan memori read stereotyp retriev explan read stori bomb mission stereotyp built gener causal constraint includ ultim refut causal constraint deriv success explan unsuccess religi learn success explan motiv aspect explan retain goal order belief charact stori causal implic explan reli goal order sacrif stereotyp charact goal valu stereotyp specifi charact goal perform terrorist part explan infer goal actor page build stereotyp infer goal actor preserv life actor perform terrorist mission actor avoid infer goal actor avoid import goal actor preserv life goal ad stereotyp built typic typic learn fail explan learn program learn posit exampl appli techniqu learn neg exampl refut infer featur present newli built stereotyp featur led hypothesi confirm person religi religi depend refut kind person bomb religi featur record newli built stereotyp build stereotyp fail boi religion infer belief actor religion result belief ad stereotyp infer logic correct religi read stori religi bomb mind mean index basi stereotyp situat index stereotyp index index isa scene figur learn stereotyp indic xp upward line repres isa downward dot line repres scene heavi line repres indic xp built stereotyp index repres typic reason learn fail explan work explan specifi person goal perform action rule explan result goal theori deal issu multipl success research area modifi exist explan pattern associ question xp read stori religi xp bomb memori read hand explan stori explicitli mention stori understood explan bomb found understood stori didnt boi question read miss point stori question correspond gap explan structur built understand process question answer stori xp appli futur stori understand elabor modifi achiev understand causal repres xp increment refin xp answer question addit understand answer question order improv knowledg domain question focu understand learn question answer jerusalem young girl drove car group isra guard attack kill guard driver identifi girl terrorist organ threaten harm famili carri bomb mission prepar die order protect famili stori retriev appli stori question pend explan instanti question replac node repres part explan newli ad turn question elabor xp shown question seek reason unusu higher prioriti domain domain outcom isa result isa isa isa state relat actor isa goal isa object agent member goal isa state isa figur associ question xp xp repres situat agent perform action outcom unknown state avoid unknown goal repres actor depict empti repres gap program knowledg xp elabor fill gap question answer domain domain outcom isa result isa isa isa state relat actor isa isa object agent member goal isa state isa goal figur elabor xp increment learn chang portion depict newli repres answer question index point figur elabor xp appli bomb node actor protect famili reflect deeper understand scenario shown figur question explan unusu question answer futur elabor xp similar manner evolv understand bomb scenario process question answer explan pattern construct explan situat appli stereotyp packag causal similar situat encount earlier xp abstract case paradigmat exampl stereotyp situat paper present theori xp learn increment modif exist learn techniqu constrain modif process modif involv adapt elabor learn indic xp type knowledg essenti reason system theori implement learn terror read newspap stori unusu terrorist incid middl east refer dejong moonei altern view machin michalski induct learn structur evalu criteria compar review select methodolog artifici doyl truth mainten system artifici dietterich studi method induct learn machin novemb gupta failur recoveri sixth nation confer artifici page juli editor reason workshop morgan editor workshop reason morgan clearwat unifi view machin moonei dejong learn schemata natur languag process ninth intern joint confer artifici page lo august floor planner learn failur tenth intern joint confer artifici page august ram question understand answer sixth annual nation confer artifici page juli morgan kaufman lo ca ram integr theori stori memori learn phd yale depart comput research report schank ram approach natur languag understand journal societi artifici schank explan understand mechan creativ lawrenc erlbaum learn gener robot assembl task phd illinoi januari technic report wilenski understand stori phd yale depart comput
ML/266 6 knowledg recurr neural dynam fuzzi system christian lee gile kk depart comput south africa nec research nj colleg md abstract system combin artifici neural network fuzzi logic increasingli popular system extend applic requir context applic model form automata prove determinist automata map recurr neural network sigmoid discrimin function interconnect topolog program network weight base paper synthesi method map fuzzi automata recurr neural network suitabl implement encod gener encod synthesi method requir undergo transform prior map recurr network neuron slightli enrich function order accommod fuzzi state occupi fuzzi membership valu rang fuzzi state occupi time enrich neuron function fuzzi paramet directli repres paramet neural network paper prove stabil fuzzi dynam construct neural network finit valu network weight simul give empir valid proof contrast stochast automata exist ambigu automaton current state automaton state time choic successor state determin probabl distribut discuss relat probabl instanc introduct interest hybrid system applic hybrid model emerg definit hybrid system hybrid system combin artifici neural network fuzzi system fuzzi logic mathemat foundat approxim fuzzi logic proven success varieti applic paramet adapt fuzzi system clear physic mean facilit choic initi valu inform incorpor fuzzi system systemat artifici neural network simul small scale inform process mechan found biolog system base cooper neuron perform simpl abil learn exampl artifici neural network valuabl comput tool task pattern forecast fuzzi automata automaton long histori fundament discuss present systemat machin synthesi method potenti design tool model varieti system begin exploit system major current state system depend past state current knowledg system current state vagu uncertain proof properti ai machin learn structur import number reason user model theoret perform justif accept capabl repres view foundat problem learn exampl network repres difficulti learn stabl encod knowledg mean model give correct answer independ system long lead robust independ extract knowledg train neural method potenti appli incorpor refin priori fuzzi knowledg recurr neural network comput capabl recurr neural network power rnn capabl model learn state process automata make rnn tool model learn dynam problem control signal process abbrevi denot fuzzi automaton remaind paper varieti implement digit system knowledg proof implement sigmoid activ rnn converg correct prespecifi membership proof base previou work map determinist automata recurr neural network report contrast set state occupi vari point fuzzif state gener reduc size dynam system model access direct interpret control theori point fuzzi automata shown model fuzzi dynam recurr neural network system identif comput capabl make recurr neural network tool model refin learn system current state depend previou state input lot interest extract automata recurr neural network varieti neural network implement shown fuzzi automata map recurr neural network weight crisp state encod requir transform determinist automaton comput membership function applic restrict class final state transform fuzzi automaton determinist acceptor gener size automaton network size fuzzi transit membership origin undergo modif transform origin suitabl implement recurr neural network direct correspond system network paramet obscur natur fuzzi descript system model exist crisp recurr network encod question recurr network train comput fuzzi membership repres state intern base theoret abil repres form determinist acceptor recent work report address question augment network linear output layer comput fuzzi string membership suggest author chose assign fuzzi string membership occur train set individu output neuron transform fuzzi infer problem binari infer problem multipl class approach lessen burden improv accuraci robust string membership comput multipl train network comput fuzzi string membership ident train network behav author empir verifi inform extract recurr network train fuzzi string develop crisp intern repres form determinist acceptor theoret analysi correctli predict knowledg train network present method encod fuzzi state object encod algorithm encod recurr direct fuzzi membership individu transit paramet recurr achiev fuzzi make minim underli architectur encod crisp recurr network requir intern state state transit stabl indefinit period time demonstr stabil analysi neural encod carri gener analysi stabl neural capabl repres view foundat problem learn exampl network repres learn vlsi recurr neural network directli implement approach applic conjunct recurr network vlsi method appli incorpor priori knowledg recurr neural network knowledg refin remaind paper organ fuzzi automata introduc section fuzzi state transit recurr network discuss section map fuzzi automata recurr network requir transform elimin ambigu fuzzi transit membership lead singl transform algorithm present section recurr network architectur repres section stabil encod deriv section discuss simul result section summari result direct futur research section conclud paper reason includ main result laid foundat paper overlap figur fuzzi fuzzi automaton shown weight state transit state automaton start state transit state input symbol weight repres direct arc label note transit state input symbol fuzzi fuzzi automata give formal definit illustr definit definit fuzzi finit state automaton fa fq set automaton fuzzi start state finit output ffi fuzzi transit output map weight ijk defin state simultan state certainti output map depend natur applic goal construct fuzzi state stabil ignor output map remaind concern languag defin input alphabet shown figur fuzzi state preliminari current fuzzi state collect state fq occupi fuzzi membership fuzzi state requir knowledg start state consist set state occupi vari membership shown restrict class initi state singl crisp state class definit distinct class irrelev context paper input neuron ijk weight recurr neuron figur recurr network architectur determinist recurr state neuron connect implement stabl dynam recurr neuron dedic network output neuron neuron output classifi string member regular membership state fq occupi requir dictat current fuzzi state recurr neural network method encod recurr neural network gener method encod briefli discuss encod algorithm encod algorithm make algorithm encod determinist automata encod recurr neural network sigmoid discrimin function updat current state ff ijk bia hidden recurr state neuron ijk denot input neuron symbol indic run state input product directli correspond state transit architectur illustr figur encod recurr neural network sigmoid discrimin function construct network accept regular languag desir dynam encod network program small subset weight valu lead orthonorm intern state suffici figur neuron discrimin function fuzzi neuron receiv input collect signal weight strength fuzzi transit membership comput function sigmoid discrimin function repres state variabl output rang larg valu magnitud weight construct network equal equat govern dynam construct network special form input neuron demonstr stabil intern state independ string length construct recurr state neuron oper satur region suffici larg valu intern state remain indefinit stabl appli tool techniqu prove stabil intern fuzzi state recurr neural network recurr state neuron variabl output rang extend function recurr state neuron order repres fuzzi state illustr figur main differ neuron discrimin function neuron receiv input weight strength signal repres collect input transit weight ijk ijk denot tripl ijk ijk state collect make current fuzzi network state consist definit gener form sigmoid discrimin function repres ijk ijk ijk ijk compar discrimin function encod weight program network state transit strengthen factor ijk ijk rang function squash interv ijk shift origin set ijk reduc function sigmoid discrimin function encod function import invari properti simplifi lemma obtain scale uniformli factor properti stabil analysi intern state similar analysi stabil intern state carri program fuzzi state transit state fuzzi state transit ijk fq assign recurr state neuron state neuron state basic idea activ recurr state neuron repres certainti ijk state transit ijk carri ijk reach time program weight ijk ijk ijk set ijk larg posit ensur arbitrarili close ijk set larg neg output arbitrarili close techniqu program state transit recurr network encod partial prior knowledg rule refin automata transform preliminari encod algorithm leav open possibl ambigu encod recurr network state transit ijk successor state reach input symbol assum member set current state state occupi fuzzi state transit ijk requir recurr state neuron dynam rang ijk state transit requir state neuron asymptot approach ijk ambigu output rang neuron definit ambigu occur state exist state ijk ijk call ambigu ambigu occur state transform algorithm ambigu resolv test path identifi state ambigu occur endeavor resolv ambigu transform state transform give defin concept definit process string oe oe oe oe read symbol oe make simultan weight state transit fuzzi transit map ijk set distinct weight ijk fuzzi transit map time call activ weight set note activ weight set chang symbol oe process defin mean qn ffi qn properti exist state ak ijk ak ijk list list list list fq visit ak visit visit fq end class fq visit ak ik visit visit class class fq visit ak ik visit visit creat state qx class ak ijk qx chang transit ak ak impli end end end end end end figur algorithm transform definit alphabet call activ weight set time ident string prove theorem transform unambigu make resolut ambigu feasibl number state algorithm transform shown figur prove discuss transform shown figur state input alphabet state start state footnot shown figur special case fuzzi transit object transform algorithm resolv ambigu state jr ij ij fuzzi omit reason simplic algorithm initi variabl notic ambigu exist input symbol state state transit exist state transit state set variabl visit fq definit ambigu exist resolv ambigu introduc state set longer lead state introduc state transit lead state target state fqg state fq set iter outer loop result shown figur figur show iter state state left incom transit valu ident state transit ambigu input symbol leav state transit creat state state transit suffic creat state set state successor state input symbol set exist ambigu algorithm termin properti transform algorithm shown algorithm transform ambigu show algorithm correctli transform show demonstr algorithm termin figur transit weight ambigu resolv sequenc origin exist ambigu ambigu transit state state input symbol remov ad state ambigu transit state state input symbol remov ad state ambigu transit state state input symbol remov ad state ambigu transit state transit fuzzi membership state remov ad state ijk ijk figur resolut transit ambigu state state input symbol resolv ad state adjust transit shown input prove properti transform lemma resolut ambigu result ambigu situat illustr figur state ambigu state input symbol ijk ijk ambigu resolv creat state arbitrarili state transit set remov ambigu state introduc state transit observ conclud ambigu creat state resolut ambigu state observ order state visit order state transit ambigu resolv determin final figur chosen chang transit state transit result transform share common invari lemma number state constant order state visit state transit ambigu resolv lemma claim hold observ resolv ambigu consist creat state set state fq ijk ijk ij resolv ambigu state introduc ambigu lemma number newli creat state depend number state ambigu definit definit state maximum number state ijk fq fix maximum symbol maximum maximum definit state maximum number state ijk fix ijk maximum symbol maximum maximum give upper bound number state lemma state input transform state arbitrari state incom transit input symbol resolut ambigu state requir transit lead state case fuzzi transit membership state creat ambigu state input state creat result tabl show size randomli gener input alphabet maximum upper bound size transform averag standard deviat actual size transform experi random gener connect state state input symbol observ averag actual size transform depend maximum linear lemma corollari transform algorithm termin size set list algorithm monoton iter outer loop termin list loop termin finit size upper limit size averag size standard deviat tabl scale transform result show size due transform ambigu function size maximum randomli gener averag comput transform averag size transform linear number state set size set monoton iter algorithm termin return proof theorem proven appli transform algorithm result ambigu exist easi transform origin fuzzi transit membership algorithm leav unchang order transit execut complet proof theorem transform algorithm remov ambigu incom transit minor adjust neural encod state ijk weight set implicit neural encod order consist regard neuron variabl output set ijk network architectur architectur repres shown figur layer connect recurr neuron implement finit state dynam neuron state transit modul dynam output rang ijk ijk rule weight state transit ijk notic neuron connect pair ijk ij assum transform unambigu prior network construct weight ijk program section recurr state neuron receiv input output rang ijk comput output equat network stabil analysi preliminari order demonstr encod algorithm achiev stabil intern state indefinit period understand dynam signal construct recurr neural network defin stabil intern state input neuron recurr state neuron figur network architectur architectur repres differ recurr state neuron variabl output resolut ambigu sparser interconnect dedic output neuron definit fuzzi encod state transit weight ijk recurr neural network call stabl state neuron set current state output greater ijk ijk dynam rang recurr state remain recurr neuron low output signal ijk input sequenc definit exist upper bound oe ijk low signal lower bound ijk oe ijk high signal network repres stabl encod ideal valu low high signal ijk detail analysi network state reveal demonstr stabil intern suffici worst neuron correspond current fuzzi automaton state receiv residu low input neuron connect ident neuron neuron output low high time step receiv input neuron neuron correspond current fuzzi automaton inhibit case neuron undergo state chang ijk receiv princip input neuron addit input serv strengthen high signal case neuron receiv princip input neuron repres worst case figur fix point sigmoid discrimin shown graph function function intersect function show exist locat fix point fix point fix point fix point fix point fix point analysi sigmoid discrimin function summar proof result demonstr stabil neural detail proof found order low signal remain give tight upper bound low signal remain valid arbitrari number time lemma low signal bound fix point function repres fix point discrimin function variabl output rang denot maximum number neuron contribut neuron input reason write oe implicit understand locat fix point depend choic lemma easili proven induct easi function iter equat graph function shown figur valu paramet obviou locat fix point depend valu show section condit exist fix point independ paramet function desir lemma function fix point oe lemma exist fix point oe oe oe lemma fix point oe oe oe lim oe oe oe oe oe oe lemma proven defin lyapunov function show minima oe oe basic idea network stabil analysi show neuron output exce fall fix point oe oe fix point oe oe valid upper lower bound low high converg fix point monoton corollari establish monoton converg fix corollari denot finit sequenc comput success iter function oe oe stabl fix point quantifi fix point low high fix point oe oe bound low high larger larger chosen order exist fix point chosen suffici converg uniqu fix point oe lemma express quantit condit exist fix lemma function fix point oe oe oe chosen satisfi equat fix point function satisfi equat paramet find minimum fix point figur contour plot contour plot show valu fix chosen line parallel intersect surfac satisfi point fix point coordin euclidean space locu point satisfi relat equat curv surfac interest number point line parallel intersect surfac fix point equat solv explicitli function solv give intersect line parallel hx contour function show relationship fix find point contour tangent parallel transit occur solut solv obtain condit lemma locat fix point function depend gener fix point function quantifi high signal construct lemma high signal bound fix point function notic recurr relat coupl make difficult imposs find function iter valu bound sequenc defin function decoupl lemma denot fix point function lim defin function properti suffici condit exist stabl fix point function defin equat lemma iter function stabl fix point function stabl fix point lemma corollari construct network high signal remain stabl sequenc converg fix point decoupl iter function iter function introduc iter function appli techniqu find condit exist fix point case function iter gener sequenc defin iter comput paramet repeat origin argument place find condit fix point figur invari fix contour plot illustr exist locat fix point function shown locat fix point depend condit exist stabl fix point independ scale graph illustr invari properti lemma function fix point chosen satisfi equat collect fuzzi transit membership ijk involv algorithm construct fuzzi determin condit lemma hold true rule weight ijk corollari establish invari properti function corollari minima depend independ valu inf inf term scale function introduc scale factor ffl set ffl ffl equat ffl ffl ffl ffl ffl ffl ffl fix valu ident fix valu local minima valu independ relev corollari test condit valu order exist fix point graph figur illustr invari properti sigmoid discrimin function proce prove stabil low high stabil fuzzi construct recurr neural network network stabil exist stabl fix point discrimin function condit network stabil establish condit fix point upper lower bound stabl low high defin deriv condit network conveni appli result lemma fix point sigmoid discrimin function corollari fix point discrimin function invari fix point oe properti lemma invari scale properti appli point function includ fix point condit separ valu occur redefin stabil recurr network construct term fix definit encod state recurr neural network call stabl low signal high signal greater state neuron simplifi output neuron fix upper limit input neuron contribut residu input note definit stricter gave definit order low signal remain condit inequ satisfi stabl high inequ satisfi neuron time test valu ijk simplifi set inequ lemma min max denot minimum fuzzi transit membership ijk inequ satisfi transit weight ijk inequ satisfi fix point corollari min ijk max inequ violat violat min ijk max rewrit inequ max min max solv inequ obtain condit construct recurr network implement condit express theorem unambigu state input denot maximum number transit state input symbol min max denot minimum transit weight ijk recurr neural network state input neuron construct intern state remain stabl max min min max construct network weight alphabet alphabet maximum min max condit theorem reduc found stabl encod consist crisp state simul order valid construct fuzzi encod randomli gener state execut transform input alphabet randomli assign weight rang transit increment maximum test stabil fuzzi intern state randomli gener string length time output signal recurr state neuron ideal output signal recurr state neuron correspond state occupi input symbol ijk histogram differ ideal observ signal state neuron select valu weight strength state neuron test string shown figur error valu observ number discrep desir frequenc absolut neuron output error frequenc absolut neuron output error frequenc absolut neuron output error frequenc absolut neuron output error frequenc absolut neuron output error frequenc absolut neuron output error frequenc absolut neuron output error figur stabil state histogram show absolut neuron output error network neuron implement randomli gener read randomli gener string length valu weight strength error comput time actual desir output state neuron distribut neuron output signal error weight strength actual neuron output shown valu chang observ valu chang observ compar histogram exist neuron output error suggest intern highli unstabl intern state stabl discontinu chang explain observ exist critic number stabl fix point discontinu figur transit larg output error small error recurr state neuron explain observ recurr state neuron receiv number residu neuron receiv residu input input symbol time step low signal neuron strengthen strong low signal impli strong high signal lemma shown determinist encod fuzzi automata recurr neural network transform determinist acceptor assign string membership determinist network classif string state crisp correspond network paramet fuzzi transit membership network lost transform demonstr analyt empir encod recurr network transform determinist acceptor construct network directli repres state desir fuzzi requir slightli function sigmoid discrimin function requir discrimin accommod variabl output transform larger number state found empir automaton size roughli proport automaton alphabet map recurr correspond network paramet remain physic properti unknown nonlinear system deriv train network model system analysi tool method demonstr stabil crisp intern carri gener show stabil intern argu engin point natur function repres fuzzi state membership triangular trapezoid membership function design fuzzi sigmoid discrimin function map recurr neural network function interest investig map recurr neural network discrimin compar encod algorithm method train recurr neural network fuzzi state exampl behav variabl output rang treat variabl paramet updat rule similar network weight deriv inform extract train network topic futur research interest compar train knowledg network discrimin function fix variabl output discrimin function variabl neuron output rang open door method extract symbol knowledg recurr neural network acknowledg acknowledg discuss comput bg horn research refer fine tune fuzzi logic control ieee transact neural vol pp logic neural ieee tran neural vol special issu grammar infer neural tech depart comput scienc artifici applic fuzzi logic gener vol pp integr symbol neural connect vol special issu dynam applic recurr neural network finit state machin neural vol pp adapt recurr neural tool effici implement qualit model dynam system vol pp logic control roll moment flexibl wing ieee control system vol pp state automata simpl recurr recurr neural vol pp fuzzi transact system vol duboi fuzzi set theori vol mathemat scienc pp academ structur cognit vol pp base tool analog ieee transact design integr vol finit state automata recurr radial basi function machin vol pp gain logic intern journal gener vol pp recurr neural theori ieee transact neural vol special issu extract finit state automata recurr neural neural vol gile insert refin symbol rule dynam driven recurr neural connect vol pp analysi fuzzi logic finit state machin proc ieee conf fuzzi vol pp implement fuzzi logic finit state pp uncertainti fuzzi logic tech rep tm hybrid advanc connectionist neural comput theori barnden ablex hybrid expert system proc fourteenth intern joint conf artifici vol pp honavar artifici intellig neural step principl integr san academ khan fuzzi logic neural advanc fuzzi neural genet algorithm lectur note springer van fuzzi control warm water vol pp network identif fuzzi dynam applic identif vehicl highwai tech dept electron comput technic properti gradient recurr neural ieee transact circuit neural network identif dynam ieee transact neural vol pp logic control fuzzi logic ieee transact vol pp maclin neural network improv refin algorithm protein machin vol pp analog vlsi neural system specif finit state european design autom pp determinist automata recurr neural journal vol pp rule recurr neural neural vol pp recurr neural ieee transact knowledg data vol pp encod larg automata recurr neural network sigmoid neural vol pp automata determinist encod recurr neural ieee transact fuzzi vol pp fuzzi logic control traffic ieee transact vol pp induct dynam machin vol pp inform vol pp neural inform process vlsi kluwer academ comput power neural journal comput system vol pp comput power recurr neural network neural vol hybrid approach model neural vol pp fuzzi probabl ks fuzzi finit state machin implement base neural fuzzi intern confer fuzzi vol pp languag recurr neural vol yang machin expert system fuzzi logic journal materi engin vol languag relat human machin tech rep electron research inform vol pp finit state machin recurr neural vol pp
ML/267 6 explicit teamwork model learn extend abstract ali randal hill gal milind tamb inform scienc institut comput scienc depart southern california marina del ca usa introduct robocup research initi establish synthet robot soccer testb pursu research challeng artifici intellig robot extend abstract teamwork multiag research challeng highlight robocup address challeng discuss explicit model explicit team plan goal discuss applic agent learn robocup vehicl research investig robocup isi team synthet successfulli particip simul leagu win place prize tournament posit briefli overview isi agent architectur investig issu teamwork learn kei issu team investig agent analysi teamwork relat issu isi architectur isi agent consist make handl time critic function ti percept action develop commun input receiv robocup simul suffici higher level rapidli comput recommend direct turn group rule comput direct intellig shoot ball oppon goal section comput plan intercept ball consist turn dash action make respect recommend rest higher implement soar integr ai reach commun send relev inform simul soar architectur involv dynam execut oper hierarchi oper begin execut oper select remain activ explicitli termin execut abstract oper lead oper select hierarch oper ensu oper soar similar reactiv plan architectur teamwork kei aspect approach teamwork explicit team activ explicit team oper team team oper explicitli express team joint unlik regular express agent activ individu oper appli agent privat state agent privat team oper appli agent team state team state agent model team mutual belief team mutual believ strategi isi agent maintain state particip team member maintain copi team state particip share memori team member kei aspect teamwork isi approach coordin commun teamwork model uncertainti dynam environ maintain coher team member provid capabl highli flexibl coordin commun explicit model teamwork recent approach enhanc teamwork teamwork model provid agent capabl principl reason teamwork provid teamwork flexibl teamwork model enabl code investig model teamwork steam model team member commit teamwork fashion enabl team member autonom reason coordin improv teamwork flexibl due steam demonstr reusabl domain steam formal joint intent basic build influenc sharedplan includ kei enhanc reflect constraint domain joint intent theori requir agent attain mutual belief establish termin joint mutual belief attain steam reason select method attain mutual belief reli explicit commun robocup attain mutual belief reli typic steam oper team oper execut defend servic player execut team oper posit properli field awar ball posit player limit cone reposit unawar approach ball teamwork benefici player ball declar team oper irrelev teammat focu defend goal coordin manner team oper player goali ball move suffici alert team mate player execut attempt posit close goal agent coordin goal issu issu brought forward due applic teamwork model robocup robocup highli reason principl teamwork teamwork model ineffici improv plan compil teamwork typic case reason teamwork speed achiev machin learn method form teamwork model retain unusu case requir principl teamwork reason offer teamwork model teamwork model enforc rigid coher constraint requir mutual belief attain straightforward attain mutual belief robocup shout rang rang limit player necessarili heard end field tradeoff level coher team perform plan investig suggest modif teamwork model extend capabl agent deal potenti inconsist belief agent discov inform relev team reason select method attain mutual belief inform agent commun belief recipi commun accept acquir belief examin inconsist belief recipi exist belief problem robocup defend ball close defend establish joint intent approach time player inform defend stand ball ball inconsist occur joint goal recur process form end joint team stuck point address approach agent model belief agent order detect inconsist decid negoti kei idea approach negoti factor robocup case agent decid argu teammat temporari inconsist detect agent receiv messag compar belief belief convei messag convei belief conflict explicitli agent exist agent belief infer rule figur relev belief messag sender sender recipi belief detect inconsist account belief support direct sensori evid plausibl default decid negoti agent method select approach address inconsist agent choic belief work argument teammat accept argument sender option expend effort detect clash belief negoti resolut negoti lead agreement sender observ altern persuad sender accept recipi belief cost util vari lot robocup case cost larg amount resourc importantli time pressur soccer competit situat chang greatli ball roll agent set possibl benefit significantli lead low expect util negoti specif player involv stick belief turn observ bother argu resolv disagr skill learn inspir previou work machin learn techniqu improv individu player skill intercept ball layer isi architectur simplifi problem skill learn isi design provid recommend kick arriv specif specif kick individu kick direct clear learn independ action learn appli select intellig direct shoot ball attempt score goal select plan intercept incom ball score goal critic soccer skill initi approach determin good direct kick base heurist center corner fail drastic heurist foil fact small variat configur player oppon goal small variat posit dramat effect shoot direct address decid reli offlin learn shoot rule human expert creat set shoot select optim shoot direct situat learn system train shoot scenario learn part express power express game situat handl miss attribut larg number train case train case angl visibl player system train roughli train label expert center kick direct result game situat tree select shoot direct result tree provid set shoot rule learn rule select shoot direct successfulli typic select learn shoot direct player close goal contrast offlin learn shoot begun explor onlin learn intercept plan initi isi player simpl routin determin plan intercept ball experi result intercept plan work fine plai fail result depend extern factor network frequenc perceptu updat soccer server style plai team unlik real soccer isi player intercept skill adapt differ extern factor address explor player adapt intercept actual plai condit adapt intercept inher risk opportun intercept inappropri adapt consequ import adapt smoothli assess risk feasibl adapt start explor simpl adapt approach current approach search space plan evalu success failur driven tier adopt conserv approach distinct search distinct input instanc ball move player treat separ ball move player intercept assign input failur meet expect result intercept plan input condit histori similar failur drive evalu context model failur failur due block player treat differ failur due improp turn angl work preliminari fulli evalu test ideal condit reliabl perceptu method exhibit consist rapid converg simpl turn dash plan good manual deriv plan addit extens evalu vari enhanc learn input condit influenc similar input condit evalu aspect evalu isi mention isi successfulli particip win prize simul leagu team particip isi won game compon goal kei aspect evalu measur contribut explicit teamwork model isi steam contribut term improv teamwork perform reduc develop time measur perform improv due experi set commun cost steam isi agent commun number messag commun isi agent commun messag portion teamwork model isi effect set commun cost essenti effect teamwork model set commun isi plai game fix oppon team roughli capabl low commun isi won game score goal goal score high commun isi won game plai score goal score result illustr steam teamwork model make contribut perform provid gener teamwork reduc develop time commun jointli initi termin team oper current implement dozen coordin plan relat work term work isi team investig teamwork model guid agent commun coordin teamwork research investig teamwork robocup explicit team plan reli commun coordin typic exampl includ investig teamwork robocup implicit emerg coordin typic applic learn isi agent similar investig learn robocup agent luke genet program build agent learn basic individu skill coordin stone present relat agent learn tree enabl select recipi pass term relat work teamwork model remain distinguish aspect teamwork isi steam teamwork model implement gener model teamwork model includ jen joint framework joint intent rich sidner sharedplan oper complex domain steam significantli differ focu arguabl set teamwork capabl domain team complex team organiz practic emphasi commun cost detail summari discuss teamwork import research issu system vehicl research implement team soccer plai successfulli particip simul leagu soccer tournament principl approach develop guid research opportun robocup risk principl isi won place team particip simul leagu tournament kei issu remain open futur work kei issu improv applic model recognit team unabl fulfil role team activ team member role fail team member team model appli recogn oppon behavior counter intellig acknowledg research support part nsf grant bill paul rosenbloom aren support robocup activ paper refer agent adapt adversari plan robocup pr architectur robot world cup soccer game confer team royal knight robot world cup soccer game confer cohen levesqu teamwork firbi investig reactiv plan complex domain nation confer artifici intellig grosz krau collabor plan complex group action artifici jen control cooper problem solv industri system joint intent artifici nune act nation confer artifici intellig menlo aaai hendler soccer softbot team coordin genet program robot world cup soccer game confer learn cooper action multiag case studi pass plai soccer aaai spring symposium coevolut learn march unifi view machin newel unifi theori cognit harvard univ quinlan program machin learn morgan san rich sidner agent collabor peopl intern confer autonom agent preliminari analysi soar architectur basi gener intellig artifici stone veloso collabor adversari case studi robot soccer aaai spring symposium coevolut learn march stone veloso tree confid factor multiag control robot world cup soccer game confer tamb teamwork dynam environ intern confer system decemb tamb agent architectur practic teamwork nation confer artifici intellig august tamb flexibl teamwork journal artifici intellig research matsumoto endo cooper team plai robot world cup soccer game confer articl process macro packag llnc style
ML/268 6 theme speech signal process implement local classif system rolf paulo engel fernando mora torr michel robert dept de da postal santa cruz rs inst de informática postal rs fac de informática av rs montpelli ii rue ada montpelli cedex franc abstract pattern local classif cpu time intens implement lower perform custom implement custom implement hardwar higher cost softwar implement present altern repres good perform cost paper present initi system deal object local analyz perform implement work system local classif shape reconfigur devic signal processor flexibl platform system softwar hardwar part implement prototyp platform introduct vision long fascin research broad rang neural comput engin vision defin process recognit object deal imag understand artifici neural network model human vision system biolog larg number simpl process execut model analog biolog neuron natur neuron provid comput architectur radic comput wide massiv parallel system paper imag process prototyp system base platform aim integr digit signal processor programm devic system featur extract classif task task emploi find classifi shape input imag shape traffic landmark car dsp processor sequenti process requir float point arithmet programm devic parallel bit level oper partit improv perform system compar pure dsp reduc time market cost compar implement system repres good perform cost system implement platform board fpga modul dsp core modul st memori modul bit paper organ section present background object local describ implement perform system section describ system detail task accomplish section present preliminari result hardwar implement final present futur work background describ system deal object local classif relev work publish literatur present object posit complet implement softwar hardwar implement connect host present report result real time process work assum fix distanc vehicl imag sensor restrict proport rule order detect desir pattern vehicl system mix softwar part run hardwar part run fpga system applic work ann system implement result poor perform sec local similar work present aim object local implement softwar work includ object object develop portabl system imag light weight low power consumpt perform real time process obtain implement parallel oper fpga implement full execut requir task shape local classif system implement dedic imag process complet connect ci circuit imag order includ imag acquisit task learn phase implement flexibl system system task shape local classif figur present main task execut system input imag preprocess task featur extract task classif task output result figur system gener vision preprocess task accomplish local process find literatur method geometr shape textur analysi fuzzi logic local featur global featur desir shape approxim domin point detect mathemat morpholog work global featur desir shape method task obtain global featur desir shape segment line extract process method line extract imag comparison perform work relat canni method present result cpu time consum process altern present method suit hardwar implement algorithm perform line extract segment gradient direct pixel sourc imag system implement method depict figur sequenc independ task gaussian filter maximum direct edg detector local figur preprocess task implement hardwar segment process start appli gaussian filter input imag filter act smooth function input imag work window equat describ filter constraint appli implement hardwar weight grai grai width height window pixel direct window pixel posit neg slope step appli threshold imag pixel window result imag edg origin direct figur illustr step figur present origin figur imag gaussian figur imag pixel direct figur imag edg obtain figur figur segment process segment process figur local line algorithm detect exist dimens angl insid imag obtain exact local line approach vertic local convolut mask appli imag obtain vertic local process calcul straight angl imag convolut mask work straight angl vertic valu method imag acquisit process introduc make difficult find straight angl techniqu method line local approach method easili implement good perform good segment process local algorithm algorithm task figur output algorithm initi final angl length line input imag figur illustr imag obtain algorithm figur line obtain local algorithm task system featur extract select featur extract method import factor achiev high recognit perform larg number featur extract method report literatur newcom field face featur extract method work angl correct map averag column calcul averag valu appli classif process featur extract methodolog replac techniqu defin set function invari rotat differ input pattern main disadvantag techniqu function repres complet set descriptor practic applic set invari adequ distinguish input pattern mlp artifici neural network learn accomplish classif task method correct error backpropag algorithm implement analysi result hardwar prototyp environ environ gener prototyp platform hardwar part system essenti board organ femal support matrix connect virtual integr microcontrol board flex modul modul core st memori block fpga clock mhz mhz figur show prototyp system block diagram present figur correspond hardwar implement system diagram show part implement fpga part implement dsp fpga part develop interfac adm core line core neural core system organ final throughput system pipelin stage buffer insert gaussian filter direct comput buffer imag line requir direct comput start gaussian filter process line edg detect direct comput buffer imag line edg detect window edg detect write result fpga extern memori local read send process line dsp dsp process task shape extract featur extract futur implement shape extract hardwar featur extract huge amount mathemat oper execut work present method featur extract featur valu classif block implement hardwar ann accomplish system classif ann implement hardwar assur great output perform due parallel oper complet system consum logic element logic time tool fix maximum oper frequenc fpga devic devic obtain imag size bottleneck adm core clock system throughput fpga faster apex oper frequenc easili process figur prototyp system implement comparison implement make comparison emploi cost function measur perform tabl number clock repres real fpga devic classif block implement dsp processor standard microprocessor tabl present compar result neuron propag activ function simul execut dsp dsp reserv data memori bit data memori bit program memori bit line algorithm rectangl extract moment invari calcul imag fpga intern ram bit adm core interfac gaussian filter direct calcul edg direct extract weight tabl show result obtain activ function simul execut tabl tangent function tabl show result obtain gaussian filter simul execut point valu interfac core data neural core state machin neuron loader fpga data decod delai wr control block line core state machin fpga intern ram end line verif figur architectur tabl result compar propag neuron descript fpga weight dsp weight implement descript fpga tabl tabl dsp tabl result compar activ function dsp ni tanh function implement descript fpga valu valu dsp tabl result compar gaussian filter dsp implement dsp memori memori modul board bit schemat pentium program compil pentium program compil pentium program compil paper discuss implement complet system shape local classif present preliminari result classif gaussian filter implement programm devic platform classif block perform time dsp cycl divid fpga greater dsp gaussian filter block perform time dsp cycl divid fpga greater dsp number cycl system faster dsp parallel oper execut hardwar block expect perform apex maximum oper frequenc complet system implement present algorithm solv problem fast suitabl hardwar present small error compar softwar implement shape consid system featur process work futur prototyp platform imag process develop algorithm insert rich environ implement custom imag process system refer corpor pm classif system rectangular shape xiii symposium integr circuit system design septemb present dm object detect smart intern confer comput vision vol ng gs partial object neural intern journal pattern recognit artifici vol pp fw partial occlud object orthogon complex ar model intern journal pattern recognit artifici vol pp gl recognit track remot video ieee tran circuit system video vol pp octob david recognit local proc intern confer william locat object hausdorff intern journal comput vision vol pp aw danger label neural pattern recognit vol pp comput time de universitat de barcelona pp landmark vol pp de rede de instituto de informática pp shell algorithm imag fuzzi rectangular ieee transact fuzzi vol pp novemb david recognit local proc intern confer vision sept fan automatiqu de algorithm de scienc techniqu de fw partial occlud object orthogon complex ar model intern journal pattern recognit artifici vol pp gl recognit track remot video ieee tran circuit system video vol oct edg comput vision imag vol pp jr imag process comput john wilei york edg algorithm vlsi vol pp imag corner detect curvatur scale ieee transact pattern analysi machin vol pp dec dm corner orient imag vision vol pp encod arbitrari geometr ir tran electron vol pp al jame graphic principl edit neural network imag van nostrand pm fg de um ambient para de rede iv de rede juli mk pattern recognit moment ir transact inform theori extract method charact recognit pattern vol pp
DB/269 3 inform system vol pp copyright elsevi scienc reserv print great britain meta model approach workflow manag system support except handl kw chiu li depart comput scienc clear water hong kong depart comput citi hong tat chee hong kong februari final form march abstract workflow manag system facilit definit structur decomposit busi process assist manag execut monitor activ current built tradit relat system objectori system store definit run time data workflow wfm requir advanc model function support adapt except handl articl describ advanc approach enabl technolog object activ support integr solid basi flexibl wfm involv dynam match migrat workflow except handl copyright elsevi scienc kei workflow except workflow evolut introduct applic domain includ offic support involv complex interact human technic facilit dai dai busi process pattern busi process routin total call type inform support streamlin support applic domain workflow manag system form post support system assist monitor busi activ streamlin improv routin busi document reflect busi process describ wfm effect flexibl coordin human activ exist routin offic model busi process workflow execut set problem solv agent term activ workflow interchang problem solv agent human abil execut finit set task applic domain activ typic eventu unit level call task task handl singl execut activ driven event event except manag wfm control resolut wfm schedul select execut task match task approach main criterion set capabl token chosen match requir task token embodi capabl execut function procedur role repres set correspond plai set hold set extra capabl john lead recommend richard kw chiu al small plai role addit hold extra capabl outcom altern workflow special case unanticip except occur frequent execut busi process wfm provid except mechan realloc resourc object amend current workflow ad altern frequent occurr similar except incorpor workflow expect except workflow evolut avoid unnecessari except elimin ad enhanc oper environ order support wfm emploi major earlier built top tradit technolog relat fall short facilit offer flexibl handl dynam requir advanc featur activ capabl flexibl system facilit develop versatil wfm featur advoc meta model approach handler defin depict figur workflow templat defin actual workflow instanti specif applic gener requisit workflow templat declar specif requisit workflow request request custom rule instanti section capabl token defin combin form captur requir task class section except handler correspond condit defin except handler form specif bound workflow versatil except handl section integr environ framework develop advanc featur system extend patch exist insid integr environ separ layer advanc featur wfm object model discuss articl integr environ enhanc model capabl oodbm model suitabl environ develop versatil wfm effect manag human resourc common fail execut task agent wrong agent assign human resourc major cost organ effect manag human resourc kei success wfm organ discuss articl emploi approach coordin agent approach match task agent relat work advanc approach comput aid softwar engin case area standpoint effect benefici adopt meta model techniqu wfm develop notabl advanc develop past year emploi approach approach address except handl wfm meta model approach wfm support except handl capabl token except handler metaclass level class level instanc level workflow class workflow instanc role object requir capabl match bind bind fig closest system adopt oo util rule role role associ model capabl match agent task support handl except kumar describ framework execut model except handl rule wfm provid organ model address varieti except condit support activ decomposit capabl match facilit workflow definit execut wide object rule model techniqu suggest simpl basic measur handl except systemat analysi classif except handl approach address adequ oasi model organ network node model organ structur organiz knowledg structur system composit task oasi class object concept assign task individu flexibl transact model workflow except handl avoid system replic cluster workflow server extens handl disconnect agent addit techniqu relev handl except manag manual task comput system handl disconnect agent find candid task execut volunt execut capabl effect fair impair flexibl transact support workflow except handl offer preliminari classif except made extens taxonomi except categori section contract activ control execut organ model activ specif contract net protocol commun node distribut node engag discuss resembl contract negoti task assign work focu transact aspect lower level issu implement relat system activ capabl model workflow straightforward design essenc convert tradit relat model system weakli support action requir advanc oodbm dynam schema modif requir workflow workflow system address except problem concentr extend transact model system advoc extens approach except kw chiu al organ contribut articl object contribut articl approach taxonomi type except handl approach augment solut except handl base workflow effect model manag base capabl token demonstr feasibl effect support except handl rest articl organ section present challeng develop wfm section present taxonomi type except handl special emphasi except handl workflow evolut section detail approach emploi section describ framework support except handl conclud articl plan research section issu function wfm requir function wfm conceptu model wfm address support essenti aspect organ resourc model describ constitu organ model includ perman organ unit composit depart temporari unit project team physic facil hardwar problem solv agent human system activ execut model captur dynam aspect state organ proce model activ complex activ final atom task execut model requir activ coordin actual task execut data exchang match make model captur polici select execut except model captur dynam handl except includ approach workflow evolut function point wfm includ featur model problem solv agent state knowledg activ specif manag dynam coordin interact task execut collabor capabl base match effect effici handl except requir set versatil wfm heterogen object type data object procedur oper declar rule flexibl abstract model object level abstract object role capabl flexibl dynam composit perman temporari organ workflow flexibl dynam bind bind bind rule entiti event data relativ model interact meta model approach wfm support except handl enabl technolog wfm facilit develop wfm accommod number enabl technolog tabl illustr compon enabl technolog aspect oodb model process complex object relationship instrument build advanc wfm composit hierarchi isa hierarchi captur semant tradit relat definit enabl easier understand evolut larg number tabl oo paradigm enabl flexibl pass form data agent task oodb conveni gener persist storag requir record role role essenti virtual similar ordinari object creat delet role player exist object class role enabl object dynam author captur method knowledg specif individu role role extend capabl role repres hierarchi detail section rule capabl rule enabl automat execut except handl rule process declar knowledg organ agent select except handl flexibl object schema facilit except handl modif rule workflow requir model technolog organ resourc activ execut match make except object orient unit resourc hierarchi activ composit method provid task rule event object role rule organ rule execut declar cost polici eca except handler flexibl object schema updat dynam bind rule role schema workflow evolut tabl enabl technolog relev wfm model overview except handl wfm except failur basic featur address effect establish framework except handl motiv classifi except except extern workflow except expect unexpect classifi except handler except handl failur repeat replac except handler procedur declar kw chiu al taxonomi except except sourc dimens classifi sourc extern except extern compon particip wfm oper softwar machin oper extern organ intern mechan compon wfm workflow except relat workflow manag issu unabl find resourc requir execut miss deadlin outcom finish distinguish workflow except except relat activ due resourc except occur workflow instanc articl focu except except type dimens classifi knowledg wfm occurr expect except anticip plan explicit except suppli workflow user exampl situat list emerg unexpect except contrari requir human unanticip administr rule inform solut wfm wfm provid suggest human expert plan select altern overcom unexpect failur activ human expert save except resolut case amend exist activ definit except expect handl automat occur taxonomi except handler except handl mode dimens repres difficulti handl except respect knowledg effort requir trivial except extern basic handl transpar relev system compon wfm occurr automat wfm attempt handl except option messag target automat find explicit except handler appli resolut except target agent request action cooper human expert inform except request provid instruct approv wfm carri subsequ except handl task manual human expert request except handl progress activ put hold expert fix problem failur except handl wfm human except activ initi task automat handl attempt except handler wfm request human cooper manual handl carri fail activ fail complet ensur proper human wfm user overrid except handl mode import task activ wfm except type expect hire worker construct work fail meet manual handl critic task dollar wfm inform top manag suggest manual meta model approach wfm support except handl criteria user criteria task assist automat except option task success affect step transact success parent activ critic task select execut repeat altern solut determin human failur parent activ repeat task select execut altern altern wfm altern path reason due set overhead product line process replac task wfm redo task free choic agent wfm altern path work problemat task except handler type user criteria task assist automat except procedur extra branch activ decomposit except handl procedur handler specif context handl specif outcom declar eca rule resolut action event condit resolut except handl resolut point level resolut manual automat except level resolut maintain execut behavior level resolut modifi execut behavior level resolut evolv workflow discuss level level resolut select user manual unexpect level discuss aim avoid except subsequ automat except handl detail resolut techniqu support resolut maintain execut behavior updat data object chang activ constraint budget simplest fundament solut handl basic workflow except inadequ avail activ constraint violat user understand detail specif task except order make resolut includ chang capabl resourc requir task instanc except case suitabl adequ manag decid temporarili relax requir task wfm automat manag select capabl carri task job pc workstat junior senior full job manag decid capabl requir failur task due inadequ experi capabl job complic chosen programm fail finish manag request senior programm redo job chang constraint activ activ global constraint deadlin budget constraint total number kw chiu al project carri singl constraint reflect prefer absolut critic requir manag judg prefer relax constraint failur activ mean loss work altern amend capabl process train accumul upgrad capabl time organ decid train lan administr set manag web site hire addit staff incomplet specif capabl requir amend except occur event art design assist major colleagu art skill call volunt capabl ad volunt ad resourc carri task occupi manag organ short type shortag programm simpl solut hire programm capabl ad suitabl natur solut organ set maintain web site hire web administr ad speed task hire programm meet deadlin factor acquir addit resourc similar handl inadequ resolut modifi execut behavior manag manual altern addit step workflow instanc flow resolv except requir deeper understand semant affect workflow affect except handl resolut wait hold progress activ wait event resum execut occur requir unavail inadequ resourc task urgent afford wait manag wait fail task altern solut environ chang favor task wait price raw materi back normal repeat current task correspond manual execut criterion manag altern altern resourc repeat fail task repeat task altern reduc cost prepar set work switch assign task complic task requir expert capabl engag simpler task requir capabl expert swap assign task perform complic task requir capabl simpler task program team john program prolog tom john engag project tom free project prolog programm tom replac john project john contribut project figur intuit illustr desir dynam assign swap fig dynam switch assign task tom john programm meta model approach wfm support except handl exist altern branch execut requir resourc execut manag feasibl altern branch loss work result higher cost satisfactori result hire administr set maintain web feasibl accomplish task pass job extern servic compani suitabl compani found set web page web administr hire higher cost incur task fail due wrong initi judgement feasibl due environ repeat correct solut attempt execut path skip current task correspond manual execut criterion manag decid skip task step workflow execut option task affect progress activ abort situat task fail feasibl sever shortag resourc budget manag abort execut seek solut higher level activ extrem case activ project abort abort project stop loss abort task manag decid abort import task resourc urgent import workflow evolut convent approach except handl case case radic approach kind workflow modif workflow definit work progress except avoid handl automat occur repeatedli reflect accumul experi knowledg lead solut note issu correct modifi workflow ensur describ categori workflow evolut relev except handl schema evolut schema evolut support underli oodbm exampl includ chang capabl resourc requir task temporarili chang capabl resourc requir experi manag decid perman chang schema level avoid except kind consid form migrat experi declar knowledg manag decid chang requir reason speed chang capabl token role hierarchi due incomplet specif unanticip requir composit link isa link miss initi specif result failur find suitabl failur manag deduc kind capabl crucial success task capabl definit ad task requir detail possess discov chang organiz structur manag type control encount except shortag resourc elimin redund structur combin small project team result effici resourc kw chiu al patch workflow definit avoid except understand problem occurr user discov actual reason except except avoid occur overhead except handl branch workflow typic modif chang transit extra check ad execut workflow avoid shortag prolog programm condit check prolog programm ad transit task prolog program project elimin problemat branch ad branch procedur total remov avoid altern reliabl incur higher altern ad reliabl altern downgrad serv extern servic manag decid hire programm contract small softwar develop job extra prepar work extra prepar work improv work environ elimin condit lead except sever data loss due comput viru system deliv client includ viru check softwar explicit procedur except handler experi gather manual handl explicit procedur except handler perform automat except handl unexpect except expect system versatil procedur handler procedur except handler main task procedur handler similar prepar work execut except condit vehicl deliv hire vehicl action chang assign abort task requir suitabl condit guid execut pattern includ execut behavior skip repeat current exist branch abort current discuss section action stabil subsequ except follow action human requir addit action failur activ addit procedur requir execut file sourc code program delet hard programm load back backup tape continu work declar eca rule except handl situat directli indirectli except unrel except declar eca rule gener action enhanc model power wfm significantli except handl eca rule handl violat global constraint repres special eca except relat violat global constraint handl specif workflow context postpon ad summar rule except handl criteria ad abort eca desir parallel action relat except log meta model approach wfm support except handl eca rule high level cover dimens except associ action class task occur context context except except handler individu task activ associ class action task except relat associ action event gener hard disk report inform system manag resolut resolut includ drastic amend structur task minim modif restart resum point due encapsul properti composit hierarchi activ task data object simpl solut easili support chang effect manual automat except handler schema workflow evolut proce human except handl order support dynam except handl emploi appli enabl technolog summar section organ resourc model main compon organ resourc model wfm includ organ composit hierarchi specifi object hierarchi specifi record attribut method hierarchi specifi record capabl role posit object possess token deriv theori determin capabl chanc find suitabl task object hierarchi object hierarchi inherit mechan captur structur behavior semant agent set gener comput provid class librari multipl inherit hierarchi hierarchi model reason capabl token composit set simpl composit token inherit capabl simpl token higher level inherit hierarchi omit elabor aspect detail relev part found kw chiu al hierarchi token person machin comput agent softwar hardwar john write program instal system programm cs graduat teach teach prolog junior programm instal system peter role hierarchi metaclass class object fig class highli complex token correspond capabl role form unifi shown figur token role symbol attribut method inherit semant capabl role captur combin role token form complex role user approach specif process perspect approach perspect task requir posit acquir capabl plai token directli includ plai due job function posit educ knowledg background project includ plai capabl token repres extra skill illustr definit john figur role end role isa nobl role attribut end role token isa root class token plai set method method attribut declar user end fig sampl declar token note specif role capabl programm gener expect perform system junior programm instal system softwar attribut figur requir record token role specif role inherit ancestor meta model approach wfm support except handl token deriv theori token deriv theori develop addit simpl inherit maxim chanc find capabl agent altern agent task obtain due inherit simpler token attribut figur present algorithm comput inherit deriv token debugg composit deriv link prolog prolog fig token program base conclud john plai role programm write program debug program direct denot attribut figur hold program figur conclud capabl teach deriv fluent teach program record programm fluent conclud relationship fluent deriv approach similar deriv approach datalog deriv stop addit token deriv link rule reflect addit john teach conclud inherit hierarchi figur token deriv conclud john token token type combin inherit link deriv link token role form unifi token deriv network improv reason capabl role maxim chanc find capabl agent task algorithm deriv token illustr figur algorithm figur method comput set token union hierarchi role exclud attribut individu compon result process method similar function datalog carri deriv token link kw chiu al method deriv token deriv inherit hierarchi foreach end method comput token deriv inherit hierarchi foreach return end method begin foreach foreach begin end end end fig token deriv algorithm match make model essenti execut find possess token requir task capabl decid match polici match make select task polici find find match worst match match polici cost accomplish task cost function task paramet repres basic design incorpor factor user resourc util method found cost foreach satisfi begin role token role found cost end end end fig match task meta model approach wfm support except handl method foreach order fc begin begin return end return found end fig algorithm partial match method found cost foreach satisfi begin found cost end end end fig match deriv token task method task begin begin fail match begin null task end end foreach sa return end fig algorithm find set carri activ basic algorithm match make illustr figur find satisfi task requir type task meet requir multipl cooper work develop partial match algorithm shown figur minim cost case heurist improv partial match sort candid select comput token deriv algorithm conduct match procedur token base inherit hierarchi fail note kw chiu al modif chang depict figur modifi programm debug requir token explain section senior programm john token match execut deriv includ main algorithm find set carri activ present figur result denot union constitut task activ execut model activ execut model provid unifi approach activ execut except handl consist activ execut model explain subsect activ activ composit hierarchi specifi record activ constitut task level task atom activ activ made task call complex activ activ decomposit activ decomposit store made part activ user easili complic activ base exist illustr workflow requisit procedur begin procur payment arrang receiv check good end receiv check good wait till payment due request cod credit begin product inform fill pr form budget check pr approv end begin match po invoic check fund payment author prepar end request payment arrang payment arrang supplier found task activ transit fig workflow requisit procedur match input event output event node specifi arc decomposit graph coordin decomposit verifi incomplet specif type arc support hierarch composit import encapsul detail activ task definit refin activ repres meta model approach wfm support except handl elementari task easi mainten activ definit except handler scope except nest transact model execut local failur limit loss work captur except task execut workflow templat defin actual workflow instanti specif applic gener requisit workflow templat declar specif requisit workflow custom rule instanti class end class task isa activ set constrain method end class activ isa activ class activ class multipl instanc specif activ class set activ set activ parent composit hierarchi set set set set paramet execut instanc set method end fig specif activ task design activ object shown figur serv root class class definit wfm easi mainten object featur support advanc store attribut class object class attribut object class decomposit activ object inherit definit attribut object class class attribut activ instanc creat arrang execut time activ class treat activ activ paramet valu set actual execut execut model concentr central control coordin execut model center activ executor wfm activ executor initi select match maker carri assign task task complet activ executor monitor task execut statu enforc deadlin task return except condit respond deadlin time activ executor arrang except manag handl activ consist multipl task schedul kw chiu al execut data tempor depend extern input express mean uniform framework data clock extern abstract event primit combin sequenc event defin composit event begin prepar execut task repeat begin accept accept start work event deadlin met end accept except end activ call foreach begin start activ call execut composit activ execut begin end begin free task foreach begin start end end fig meta eca rule execut manag support contemporari figur illustr event driven activ execut model descript oper execut manag explain activ modul gener eca rule automat coordin execut workflow store user extern applic trigger start work activ composit activ executor process continu downward composit hierarchi meta model approach wfm support except handl leaf task reach activ executor invok match maker select task initi task select acknowledg reject assign repli event finish assign task repli activ executor activ executor carri step result pass back failur time system except event invok except manag except handl framework organ resourc model match make model rule base procedur base oodb role mechan except model activ execut model resourc organ rule activ composit execut cost polici except handler event rule wfm fig map wfm develop wfm call aim support function featur mention built integr advanc object orient model environ system develop enhanc model capabl oodbm model adequ deal data knowledg manag requir advanc inform manag serv effect basic layer provid import featur section build wfm patch extend exist oodb insid integr approach shield wfm detail rich set model featur construct build wfm approach facilit mainten evolut softwar engin point illustr support center approach comput execut plan start execut approach handl dynam resourc onlin modif workflow except flexibl manner kw chiu al architectur architectur illustr lower part figur seamless integr rule oodbm procedur base role extens oo model emploi accommod dynam natur object state captur applic semant knowledg level role act bridg gap semant knowledg base procedur base bind dynam support advanc eca rule provid wfm except manag log manag match maker activ executor activ except model activ execut model match make model organ resourc model workspac interfac oodb procedur base rule base role mechan role token hierarchi hierarchi class procedur pool upper layer facil role mechan base level fig workflow manag system prototyp built integr oodbm product infer engin wfm implement top rel architectur function aspect result depict upper part figur meta model approach wfm support except handl activ expert oodbm unifi enabl technolog object role event specif rule constraint specif process activ facilit decomposit activ task user knowledg relat data activ task user interfac organiz manag data object instanc capabl token specif maintain token role deriv support activ executor coordin execut gener event log manag track task execut state result match maker select execut task activ select criteria except manag handl except fail task altern resolv wfm determin maintain forward progress except handler scope conceptu except handler extra branch kind except handl procedur handler specif task context handl specif outcom arc label supplier found workflow templat requisit procedur figur repres procedur handler except handler correspond condit defin except handler form specif instanc bound workflow versatil except handl activ scope except handler appli bodi target activ task declar specif rule instanc bound specif class instanc kind except handler delet modifi activ definit time except occurr workflow adequ support dynam schema evolut capabl except search handler current task progress global activ stop explicit special except handler overrid default except handler declar except handler except notifi personnel manag recruit activ global except handler specifi pc failur report depart failur pc personnel depart except recruit activ trigger rule inform personnel manag depart user task personnel offic personnel manag improv except handler except handl due wfm expert activ fail trigger except parent activ process propag composit hierarchi handl approach local reduc loss work human requir except handl semiautomat pattern repeat task scope composit lowest level prioriti specif overrid higher level kw chiu al except handler except common except handler vital effici wfm mechan except handler follow procedur except arc peer task level insid parent lead except handler share declar except handler requir except type activ composit hierarchi explain previou declar except object instanc scope repeat bind bind except event object except class arrang hierarchi except handler handl except except handler handl extend event composit gener except handler applic except handler except manag begin human manag notifi user execut except handler notif requir manual cooper manual handler dispatch abort automat handl except handler found resolv find resolv except handler user request automat handl notif requir handler resolv except handler except handler end fig except manag activ decomposit modul rewrit eca rule procedur definit except event trigger invok except manag except manag control act except handl mode discuss section relev notifi automat handl mode figur depict control flow except manag note human human manag invok activ execut user request automat resolut manual chosen handler human call except handler human abort parent determin failur occur parent continu note except sourc import except treat event meta model approach wfm support except handl support except handl section type except describ handl handl expect workflow except gener except reject task assign candid wfm find capabl execut task busi requir resourc wfm wait altern execut path specif workflow administr user anticip input except handler wfm handl workflow except support lot except handl resolut relat assign base capabl amend capabl chang capabl requir task instanc import proport intern except due failur find execut task support advanc analysi capabl term multipl inherit deriv network section chanc find suitabl automat avoid find altern repeat task except automat switch assign advanc capabl process featur vital success resolut scheme note number tradit wfm oasi readili support emploi notion capabl match assign task support criteria pattern fail task altern task execut resolv decid correct altern altern execut branch automat pattern task wfm support featur handl expect extern except kind expect extern except declar eca handler action except handl system level compon particip oper network recoveri techniqu handl failur except handl silent extern agent awar notifi event action log audit handl extern system compon event inform explicit except handler workflow administr execut convent approach unexpect except unexpect treatment workflow extern except similar unexpect human manag except manag assist user provid list resolut evalu recent resolut user refer scenario user determin action kw chiu al tabl summar suggest resolut except case situat point view situat suggest resolut find skip postpon chang requir amend capabl abort task switch add resourc skip postpon chang resourc requir add abort task resourc meet deadlin postpon add expedit activ execut activ constraint violat chang constraint chang relev data object task fail skip postpon repeat altern branch chang resourc requir activ fail abort current altern branch execut adequ support varieti convent except resolut studi section manual automat resolut abort current task except handl unifi manner higher level root activ activ composit automat manual support radic solut base workflow evolut discuss workflow evolut unexpect except requir facil support workflow evolut section convent except handl human manag submodul accept updat workflow facil support spectrum relat workflow evolut user suggest resolut persist enter schema evolut updat workflow enter eca rule workflow evolut requir modif workflow definit ad eca rule system work advanc schema evolut capabl requir base relat support schema evolut sever restrict workflow evolut resolut due support dynam schema evolut readili except resolut base schema evolut section note resolut base schema evolut reduc addit except occur advanc eca rule support greatli facil rule flexibl associ rule target task event activ workflow evolut modif class side effect affect activ confin time workflow activ execut affect activ execut unaffect encapsul behav black box activ higher level workflow manag system fairli regard main type gener inform system perceiv workflow technolog requir support complex data model flexibl dynam modifi workflow specif case except handl current state art system assist scope articl meta model approach wfm support except handl framework enabl technolog meet function requir support workflow technolog adequ articl address shortcom present approach wfm base integr environ call approach embodi framework highest level defin gener templat model type middl level defin type facil constitut bottom level instanti specif type actual wfm instanc meta model approach isol issu level promot adapt reusabl base improv develop wfm adapt chang requir result system support effect model manag rich taxonomi type except handl augment solut except handl base workflow evolut provid support flexibl advanc includ versatil match onlin modif workflow instanc dynam except handl construct prototyp system research work carri cost model effect alloc altern except issu cascad nest except handl mainten previou case human futur refer automat except methodolog handl except enhanc prototyp system except handl featur workflow evolut support acknowledg research fund refer al failur handl larg scale workflow manag system ibm research report al workflow manag system mobil disconnect client distribut parallel pernici workflow evolut intern pp lectur note comput germani sb tanaka support cooper problem solv intern journal intellig cooper inform chiu li versatil bridg mechan user interfac expert oodbm technic report comput scienc hong kong scienc technolog chan li flexibl event model top common data knowledg storag manag workshop inform technolog system texa chan li extens approach reactiv process advanc object model environ intern confer expert system applic li develop workflow manag system integr model environ intern confer engin knowledg engin san knowledg system usa li except handl workflow evolut taxonomi resolut techniqu adapt workflow chiu li perspect integr manag rule object intern journal inform workflow activ model pp toronto kw chiu al custom transact model mechan programm support reliabl workflow autom ieee transact knowledg data hung activ specif decomposit activ manag system phil comput scienc hong kong scienc technolog corpor workflow manag base role ieee bulletin technic data yeung hung framework activ manag system coopi pp toronto framework dynam rout oper integr control workflow manag system hawaii intern confer system ieee comput societi press li lochovski approach integr data knowledg manag gener inform system intern workshop gener inform technolog pp israel institut israel li lochovski extend object behaviour support knowledg semant symposium advanc technolog pp nara institut scienc japan li lochovski advanc support facil cscw system journal organiz comput electron li lochovski advanc object model environ ieee transact knowledg data object repositori comput scienc inform technic report marten cc woo integr toolkit develop autonom applic decentr environ journal organiz ablex publish nato asi workflow manag system mt seth springer verlag reuter contract mechan build workflow manag system ieee bulletin technic data engin workflow manag coalit member glossari workflow manag coalit version
HCI/270 4 side spontan inform discoveri exchang system david campu de beaulieu renn franc ecol de mine rue alfr nant franc freder wei renn campu de beaulieu renn franc paul campu de beaulieu renn franc michel campu de beaulieu renn franc abstract develop wireless commun enabl rise network applic system web nowadai wireless pda observ develop ubiquit comput base work aim user context part paramet applic context notion includ user social activ part emerg technolog enabl short rang direct wireless commun defin proxim aim studi design kind extend web spontan proxim web interact introduct develop hardwar architectur enabl proxim wireless bluetooth direct inform exchang neighbour node pda pda nowadai store person inform assum user declar inform freeli envisag direct exchang inform mobil pda meet commun person digit assist applic kind network extens web proxim web peopl spontan collect proxim inform store neighbour pda due user mobil volatil aspect applic problem handl classic web architectur architectur adapt constraint proxim web paper section describ object constraint account highlight mechan achiev goal section present unsolv problem remain work briefli remind studi relat work section conclud motiv aim enabl spontan exchang inform mobil pda simplic sake encount pda mechan easili extend manag meet pda focu work adapt web interact mobil spontan environ proxim web confer carri pda equip wireless commun facil assum store inform interest pda confer set web page extract project web site proxim web system collect interest inform common research pda carri peopl met confer spontan aspect system mean user disturb defin topic interest proxim request perform support web main problem ffl user profil order perform automat relev user topic interest discov system build user profil resort extern instruct make local store document good achiev goal ffl index public inform pda automat public document order enabl effici retriev encount provid themat index store document good speed exchang ffl spontan discoveri relev inform relev remot inform retriev defin encount mechan perform select document exchang profil address deal constraint inher mobil comput environ compar pda suffer lack storag energi resourc manag total distribut architectur server store access inform fact impli pda act server client respect remot commun capabl direct base temporari link unconstrain mobil fix infrastructur tradit web order meet object spite design mechan detail section design proxim web manag process spontan inform resort web model document label keyword order allevi spell keyword match method reli close keyword match mechan mechan difficult adapt environ algorithm provid servic adapt poor resourc applianc limit commun time order enabl search process run keyword chosen user label document common ontolog user common classif topic assumpt realist case system dissoci reli symmetr interact web model encount mobil node find remot inform match profil profil deduc public node discov common interest behalf user task typic perform effici cooper scheme independ process focu studi interact design symmetr mechan base main compon deal pda public set public web page manag extract user profil order perform automat relev request build themat index store web page order quickli satisfi request pda receiv compon distribut search inform discoveri pda inform provid manag subsect devot descript compon manag public pda set document user declar freeli access assum document repres automat profil user issu address themat index document store reach adapt data mine techniqu appli techniqu user public discov main interest order build set relev request execut futur encount design profil index structur public store document gather singl structur user request index public describ present crisp crisp wine wine wine wine product wine wine wine crisp crisp wine transact figur data mine index structur gener data mine method data mine present data mine discov hidden depend object huge basket market frequent supermarket record product bought custom data mine discov product bought market basket inform exploit promot offer introduc definit set product call support number record minimum support itemset consid frequent defin user tradit data mine algorithm pass enabl discov frequent frequent find frequent frequent set achiev scan set frequent shown wine crisp ham tabl tabl show made supermarket line correspond equal begin search frequent count frequent discov frequent set frequent combin element frequent frequent set frequent proce discov frequent support index scheme main applic data mine discoveri frequent itemset techniqu appli extract frequent set keyword store document achiev set public web page pda store document correspond record keyword describ view item record profil user adapt data mine algorithm order suppli tree structur frequent keyword figur frequent set keyword structur built algorithm good user main interest structur classifi document frequent keyword figur document index node set keyword describ node includ set keyword document structur provid method exploit user profil themat index public document recal describ algorithm discoveri algorithm initi repeat sublist index sublist end tree structur obtain product label edg structur label level node obtain frequent level node repres frequent label keyword complet parent itemset frequent obtain combin frequent level node potenti parent elect higher support event support alphabet order node reach edg label uniqu keyword transact index structur transact index node repres transact index memori manag control size index structur smaller greater number frequent itemset threshold limit number frequent itemset size profil user adapt size profil pda capabl paramet carefulli manag due impact inform discoveri reduc accuraci user reduc set interest inform automat found encount distribut search engin spontan inform discoveri process reli index structur discoveri gradual perform comput success intersect remot profil present algorithm discoveri algorithm passiv entiti root sublist repeat index sublist end basic protocol mutual inform discoveri improv make relev concept basic inform discoveri protocol encount mobil entiti discov remot index structur document relev user profil consid relev spontan download achiev protocol progress intersect user profil encount mobil mutual inform discoveri protocol initi order perform discoveri effici entiti begin elect initi exchang assum initi step send set keyword describ level profil receiv perform intersect level profil remot answer descend node calcul intersect comput intersect base bs answer process repeat comput intersect empti transmit document index success comput intersect care transfer mechan algorithm initi algorithm passiv entiti figur present commun gener process mutual interest inform discoveri entiti initi send keyword level profil comput intersect receiv inform local profil return node comput intersect ham messag exchang entiti profil ham wine ham ham ham entiti bs profil ham crisp crisp wine transfer object node transfer object node intersect transfer object node intersect intersect figur common interest discoveri mechan start transfer web page index node return set keyword set keyword leaf set keyword ham mean belong intersect base bs comput level intersect task perform select function algorithm keyword belong intersect receiv messag empti set set consid comput intersect level node crisp keyword notifi send empti set keyword node return equal node receiv ham keyword node local send leaf set receiv leaf set keyword profil part index tree process repeat empti intersect calcul relev document transfer protocol improv protocol present limit exchang document belong strict profil intersect mean web page transmit common keyword match profil limit part profil match complet remot profil remot profil deeper local highli document index deeper remain node relev local profil basic document exchang address limit achiev introduc relev calcul profil web search engin request index comput relev base ratio common keyword document index profil adapt techniqu constraint mobil pda appli directli profil structur index relev threshold distinguish interest document principl protocol subsect inform discoveri protocol protocol roughli scheme basic differ relev concept discoveri protocol associ node index structur relev measur relev respect remot profil node relev relev greater equal remot user relev threshold relev node obtain comput quotient ffl number match keyword order reach equal ffl length shortest path root pass assum relev root differ intersect set comput calcul intersect level set relev node strict messag exchang ham ham wine crisp crisp entiti profil ham ham ham ham wine entiti bs profil relev threshold relev threshold transfer object node relev calcul transfer object node relev calcul relev calcul relev calcul transfer object node relev calcul relev calcul transfer object node transfer object node transfer object node figur common interest discoveri mechan tion remot profil global scheme protocol initi entiti commun entiti exchang relev threshold user previou initi entiti send profil level keyword order enabl remot pda calcul relev entiti associ keyword remain number keyword shortest branch part profil entiti comput set appli node belong remot profil local explor node order achiev transmit node belong intersect relev greater threshold local explor long relev greater threshold keyword node belong intersect relev smaller threshold longer explor ramif remot profil total match local document index deeper transmit transmit web page index node relev greater user threshold figur present inform discoveri mechan exchang initi step exchang user interest threshold entiti local distinguish interest document send level keyword keyword node messag length path closest leaf order enabl comput relev valu receiv build set relev node calcul relev level node explor belong strict tree intersect obtain node relev greater user threshold node store set document index relev node transfer repli result set obtain keyword set leaf set ham base bs singl set profil level keyword put set relev ham node belong strict set ham deduc receiv messag descend node keyword local explor keyword ham level consid relev calcul document node repli obtain comput empti set keyword ham leaf set ham receiv comput set profil level base calcul comput set interest keyword found ham crisp belong profil relev greater local explor search enabl discoveri relev node level document transfer index node overview architectur develop prototyp architectur pda infrar commun facil prototyp main modul storag modul divid part manag storag public document present index public document store spontan download document resourc pda design recent download document insid manag modul implement data mine mechan section api permit remov find index document data mine base tree discov common part tree structur inform discoveri modul implement algorithm section object discoveri common part remot profil local interact commun modul send receiv discoveri messag relev document question inform index modul order perform intersect set commun modul ensur interfac infrar commun card futur work briefli present aspect system object research plan enabl user constraint document spontan download small cach user settl document maximum size constraint type download document kind document attach web page user interest download read spontan aspect exchang problem repetit encount person meet time confer assum updat set public encount lead exchang data typic case resourc wast mechan small download document unknown requir notic prototyp suffer problem infrar commun requir commun node line sight commun happen spontan aspect studi plan test work bluetooth commun facil simpli achiev rewrit part commun modul relat work research led ad hoc network area domain consid set independ mobil node equip wireless commun facil work differ object aim node commun provid rout scheme direct commun neighbour node differ research ad hoc network area focu rout protocol deal applic ubiquit comput aim enabl applic access contextu inform locat order adapt deliv servic current situat parctab project peopl commun infrar network posit track store server proxim devic automat select parctab ubiquit work base fix infrastructur fix network access unlik studi total mobil system ubiquit project associ web presenc peopl place web architectur spontan provid peopl access web page relat place locat work close distinguish point prototyp complet architectur reli server provid peopl ubiquit access web page address issu spontan relev inform discoveri user treat studi system aim physic direct exchang user profil profil notion includ set person inform phone address list interest deal distribut architectur spontan manag automat user profil design kind applic extend web paradigm domain direct proxim commun assum part inform store pda freeli aim enabl spontan exchang relev web page mobil user order achiev design algorithm automat provid user profil public index public document protocol enabl spontan interest inform discoveri approach awar current limit work base common ontolog user assumpt restrict system confin commun work part larger si inform project aspect proxim interact commun issu consid refer agraw srikant fast algorithm mine associ rule intl confer larg wei paradigm mobil comput system inform societi technolog confer creat web place intern symposium handheld ubiquit comput page chen kotz survei mobil comput research technic report taxonomi rout protocol mobil ad hoc network technic report swedish institut comput grossman frieder inform algorithm heurist kluwer allen goal architectur mobil comput commun thompson close support mobil collabor interchang user profil intern symposium handheld ubiquit comput page parctab mobil comput system technic report xerox palo alto research wei predict scheme proxim interact intern workshop smart applianc wearabl comput page
IR/271 5 engin imag ana chang depart electr engin media technolog center columbia ny abstract search engin power resourc find inform rapidli expand world wide web find desir search engin learn time consum integr search tool enabl user access inform world transpar effici manner system call engin recent emerg visual inform retriev search engin web lead effici problem paper describ evalu engin find imag web base visual inform metaseek design intellig select interfac multipl imag search engin rank perform class user queri user feedback integr rank refin compar metaseek base line version past perform search engin recommend target search engin futur queri visual color textur perform world wide web introduct growth world wide web motiv develop search engin assist unmanag task navig web satisfi user inform newspap movi music type search engin found specialti search engin search engin index content entir world wide fail dissemin desir data inform specialti search engin focuss appli gener topic experienc user internet begin queri specialti search engin obtain desir continu queri gener search engin special engin fail yield inform search engin replac problem find inform internet problem search engin design search web specif inform time consum ineffici task expert user situat motiv recent research develop integr search engin engin serv common automat link user multipl competit search engin accept request queri plan select target search engin metasearch engin track past perform search engin select target search engin futur queri approach section present overview major design text digit imag video integr part human commun creat captur digit imageri trig recent develop visual inform retriev system web author inform system provid method retriev digit imag exampl visual sketch order queri visual visual featur combin text relat inform user find vir system problem effici effect retriev inform interest develop prototyp meta imag search investig issu involv effici queri distribut visual inform sourc adopt principl web resourc effici metaseek select target engin desir result weigh search tool success failur similar queri condit implement metasearch engin section section describ evalu measur comparison result metaseek prototyp base line randomli select search engin send queri interest issu examin metaseek reliabl select rank remot search engin type queri import technic aspect heterogen remot search engin technic approach enhanc section close conclud remark open issu futur research relat research engin serv common link user multipl search engin transpar manner work engin includ basic depict figur dispatch compon select target search engin queri queri interfac compon translat queri compat script target search engin displai interfac compon merg queri result search remov duplic displai user uniform format present time wealth engin www grow approach overview effort gloss project estim potenti queri construct integr index target number document word includ main drawback approach requir search engin cooper suppli index number administr complex prohibit harvest system design built internet research task forc research group resourc discoveri harvest consist gather collect index inform broker flexibl interfac inform intend scalabl form infrastructur build distribut index access web inform wide area inform server divid indic multipl level toplevel index search queri forward select metacrawl servic develop washington integr set gener web search engin queri metacrawl dispatch queri search retriev html sourc return appli analysi clean unavail link irrelev document metacrawl obtain high cost network util savvysearch tool emploi approach select relev engin base term user previou experi queri success failur track enhanc select qualiti savvysearch select resourc individu user queri balanc resourc consumpt expect result qualiti queri relev search engin find suggest approach effect make search engin select potenti larg amount knowledg requir make question effici system figur basic compon engin autom web metasearch system basic dispatch queri search engin target present return document user uniform manner manual queri dispatch search engin web tool meta search intern essenti page full form send queri number search engin select process user type queri separ form queri submiss search engin activ result nativ format whichev search engin produc system web engin support manual automat queri dispatch automat queri analyz incom categor automat pick search engin queri base priori knowledg repres suitabl search engin categori confid factor merg search result list return remov duplic broken link present final list user perform compar individu search engin meta demonstr abil retriev relev inform present fewer duplic page client displai interfac result merger format convert meta search engin queri dispatch perform monitor queri interfac queri interfac queri interfac search engin search engin search engin metaseek metaseek integr search serv common link user multipl imag search engin includ main compon shown figur queri interfac compon accept search queri user translat specif queri interfac target search engin dispatch compon decid search engin queri displai compon merg result rank displai metaseek evalu perform queri method search engin futur queri base user feedback queri submit metaseek underli system implement run hp platform metaseek socket program open port send queri individu target search engin download result http command remot search engin similar manner web browser netscap mosaic content base imag queri retriev imag base visual content system visual featur structur textur describ imag method base amount color imag color amount describ entir color content imag describ color amount local region imag method separ combin calcul similar measur imag queri search engin method support altern combin algorithm calcul similar measur distanc queri interfac compon metaseek support target search qbic virag current version user interfac random imag retriev remot search engin user select method queri color textur method select individu combin popular search techniqu imag search engin search base keyword kind search search engin queri document imag imag search base visual content return rank list imag highest similar queri imag visual sketch search match imag subject natur narrow search scope metaseek search base url keyword text search engin support option queri dispatch compon metaseek make search engin queri compon explain detail subsect user maximum wait time prevent queri system stall target search engin unreach figur show user interfac metaseek search engin queri dispatch compon metaseek queri search engin support method queri select user color high past perform score perform score calcul time queri made base user feedback calcul perform score explain section metaseek track perform score search engin respect queri imag perform score index select target search engin queri metaseek store visual featur vector queri imag case queri imag user issu set queri similar featur vector queri queri imag perform score select search engin queri approach basic find queri exampl past rout select remot search past queri figur queri interfac metaseek queri made url address metaseek search imag find search option base previou queri imag search option queri method specif search engin queri visualseek search engin base textur consid search option imag found search option decid previou queri similar imag similar imag select compar local calcul featur vector color textur tamura algorithm comput textur featur vector featur vector calcul color histogram algorithm distanc featur vector calcul euclidean distanc featur vector ad futur queri note featur vector perform monitor search engin recommend framework gener accommod featur vector monitor perform search option imag includ complet url address imag locat local remot site local calcul featur vector color textur list perform score search option descend integ correspond score integ sign correspond indic search option indic correspond search option shown tabl index option qbic textur qbic color percentag qbic color layout visualseek color percentag visualseek color layout visualseek textur virag color virag composit virag textur tabl metaseek index indic sort base score score na mean specif queri option index search engin make queri search engin support search base url address imag queri imag select imag score queri option relat search engin set na displai compon result retriev individu search merg displai user result rank order closest farthest match metaseek perform addit rank return imag queri imag perform score result imag return queri option interleav displai user perform score determin order displai imag number imag interleav group queri result imag return queri option perform score metaseek continu displai imag queri option score imag queri option score return imag displai user metaseek clean remov duplic specif merg algorithm meant replac rank algorithm remot search engin cope heterogen algorithm search engin unlik consist distanc metric text search visual search engin algorithm metric order evalu similar return imag queri common set featur comput return imag compar queri input costli network imag download order featur vector comput select merg method ignor actual distanc imag lower similar measur input queri displai imag higher similar perform monitor dispatch compon engin determin queri method remot search engin execut mention made base perform metric calcul past queri target engin support method queri perform metric sign integ posit number good perform neg number correspond poor perform perform metric queri imag modifi time user send queri visit imag increment perform metric search engin return visit imag imag select perform score remain unchang user dislik turn decrement perform metric search engin modif shown tabl event score visit visit tabl assign valu perform metric mention metaseek remov duplic imag return search option search engin click button imag metaseek perform score search option return imag duplic displai user experi evalu version metaseek develop primari object investig recommend search engin incom queri queri submit system queri search option provid desir result inform perform set experi conduct evalu perform reliabl select rank remot search engin user queri experi intend provid quantit measur perform goal find imag user search quickli small number queri made user experi involv note number queri desir imag set imag found size perform grow time experi note fraction return imag search engin user size perform grow collect data compar metaseek base line engin metaseek prototyp includ advanc featur mention section base line engin past perform search engin select target search engin incom randomli select set search option queri system distinguish past queri past perform score metaseek track perform result number queri made user find imag expect size grow system accumul knowledg perform number queri expect chang randomli number imag user expect grow number dislik imag expect perform grow time perform result number chang randomli expect follow pattern result experi shown graph figur figur metaseek base line engin data perform experi durat recommend base past perform score made amount improv metaseek number queri made user till desir imag found knowledg system random variat observ case base line engin statist experi show special pattern improv metaseek system limit durat experi knowledg accumul longer period experi continu conduct experi establish larger knowledg base figur number queri till imag found metaseek base line system number number queri base line system figur trend metaseek prototyp figur trend base line prototyp number queri select dislik number queri select dislik open issu text search engin web motiv recent research engin grow wealth vir system develop prototyp meta imag search explor issu involv queri visual inform system sourc goal investig techniqu enhanc distribut vir rank perform individu system metaseek perform score recommend remot search engin queri method send queri perform score construct accumul success failur past queri queri submit relev queri method search engin select weigh perform record predict produc relev result metaseek receiv queri encount system match content order obtain list similar past queri averag perform metaseek recommend suitabl search engin metaseek updat perform rank user feedback experi perform meta imag search system greatli improv implement intellig integr search engin improv involv speed desir imag found user satisfi result futur version altern approach relat queri past cluster past queri class share similar visual featur perform score averag cluster past queri queri classifi closest perform record recommend remot search engin user interven select process provid search overrid recommend engin perform score accumul past queri limit recent period transient statu accumul short period desir period interv depend characterist network internet user prefer plan investig techniqu merg result retriev individu search engin implement merg method ignor actual distanc suitabl imag displai similar inform user feedback refin result imag displai user metaseek engin improv ad capabl support custom search qbic visualseek user custom search visual sketch queri input custom search system support color percentag color layout user manual amount color custom search requir addit user interfac program support metaseek metaseek imag retriev enter possibl search engin perform record keyword search goal investig effici techniqu enhanc user distribut vir system refer daniel adel select search engin acm transact inform john beigi ana inform retriev larg distribut commun wayn jonathan qian byron monika jim deni david peter imag video qbic ieee comput pp rc jain imag search open framework imag symposium electron scienc technolog retriev imag video feb smith fulli autom imag queri acm multimedia nov lui hector anthoni effect gloss text discoveri mic peter michael duan wessel customiz discoveri access technic kahl inform system corpor wide area inform vol pp nov erik selberg oren search comparison intern world wide web dec center kansa engin tamura mori featur visual ieee tran vol
ML/272 6 acquisit place knowledg learn pat langlei institut studi learn palo ca karl pfleger knowledg system comput scienc dept stanford ca abstract paper defin task place learn describ approach problem framework repres distinct place evid probabilist descript occup place recognit reli augment registr process correct translat learn mechan similar involv simpl storag infer evid grid studi physic simul robot suggest approach improv place recognit handl sensor benefit improv qualiti store scale environ distinct place previou research studi evid grid place combin power method machin learn evalu method abil place evid robot learn primari pat affili robot comput scienc stanford ca acquisit place knowledg page introduct basic concept physic agent exist knowledg environ aid achiev goal import type knowledg concern spatial arrang agent surround research acquisit spatial knowledg occupi import role field robot work topic seldom made contact concept methodolog machin learn approach area incorpor idea disciplin begin definit concept task central spatial reason physic situat world definit posit agent coordin space posit correspond ground give actual locat agent establish coordin system defin relat concept agent assum agent field make notion unnecessari physic agent typic direct access knowledg indirect inform definit sensor read descript environ agent posit filter sensor inform sensor read imperfect wai incomplet describ characterist local noisi sensor read posit produc result time agent find inform make infer suggest natur task physic definit local involv determin posit agent environ set sensor read navig posit posit note agent begin carri task achiev local basic focu attent situat human care exact posit space abstract spatial region suggest definit place contigu set posit space robot research paid attent notion central role human spatial reason suggest deserv closer concept defin perform task analog local definit place recognit involv determin place agent resid set sensor read page acquisit place knowledg place recognit task tractabl transform problem numer predict involv discret classif carri local context turn easier global local navig place simpler navig posit relianc place posit introduc descript memori agent map sensor read place attempt enter descript desir autom suggest final definit place learn involv induct sensor read place set train agent accur recogn place posit note task formul make minim demand give agent inform actual posit agent collect sensor teacher label read instanc place formul assum train agent decid place touch briefli place learn section focu version paper page present approach deal knowledg place describ formal store place knowledg evid grid examin method place recognit oper simpl learn process acquir refin knowledg place present test review relat work spatial learn discuss direct futur work import differ approach earlier robot work spatial knowledg li incorpor idea machin learn view place recognit classif task view place learn concept induct task suggest learn method preval machin learn evalu techniqu task place recognit place learn introduc difficulti present machin learn presenc sensor approach problem design issu mind acquisit place knowledg definit examin approach learn place knowledg address acquisit manner repres knowledg place perform element advantag spatial knowledg base acquisit place knowledg page figur simul offic environ number distinct place evid grid robot research explor varieti formal repres spatial knowledg approach reli geometr primit describ edg surfac obstacl environ set line approxim wall offic furnitur schiel crowlei note difficult sensor noisi common scheme involv divid environ rectangular grid mutual distinct posit space cell occupi open approach suit navig task structur environ cell posit agent grid scheme design handl uncertainti posit unknown agent learn structur environ altern framework evid grid moravec data structur specif design deal uncertainti cell probabl occupi tangibl object block agent path move cell probabl rang cell cell middl cell inform wall insid adopt framework current paper figur show posit agent room larger offic similar structur actual area stanford figur depict evid grid construct simul sensor read posit top left room lower page acquisit place knowledg figur evid grid gener simul sonar read top left room figur lower left room figur left room orient note open region agent view low probabl occupi edg obstacl wall view high probabl area obstacl probabl agent sensor provid inform agent construct complet evid grid move environ collect sensor read viewpoint previou work evid grid repres singl room short period potenti handl spatial knowledg longer time span agent store knowledg entir build citi larg evid grid scheme impract due difficulti inher integr inform distant region singl map tractabl approach repres spatial involv storag separ evid grid distinct place grid encod room build knowledg augment geometr relat support navig address aspect retent place descript memori common storag case librari work reason store item repres altern situat agent find suggest infer recognit place natur evid examin place recognit assum agent store place place evid grid place approach place recognit reli process common reason agent construct temporari evid grid current posit set sensor read involv transform sensor read probabl acquisit place knowledg page occup cell moravec blackwel assum sensor model specifi map result temporari evid base sensor region vicin agent agent repeat process number case incorpor result temporari grid bayesian updat scheme describ updat process reader find detail elf moravec blackwel agent match evid grid grid store place librari evalu function comparison process measur match grid probabl rth row column analog probabl comput similar store grid instanti function provid satisfi cell treat similar confid dissimilar confid opposit gener uncertain moravec blackwel implement compon grid similar express log vari perfect neg infin worst reflect suggest scheme give low match score similar grid cell confid opposit direct decid altern felt measur sensit situat disagr cell high elimin problem predict measur metric assum store temporari grid coordin system plausibl assum presenc accur compass determin rel differ translat requir form registr coerc temporari evid grid coordin system store place system carri exhaust search oper modifi posit grid row evalu altern metric defin system select translat highest result regist grid local translat grid overlap metric cell summat creat bia store grid share cell temporari activ punish store grid partial overlap page acquisit place knowledg agent respect grid compass extend approach correct small offset rotat agent compar match score regist grid select competitor strategi place select evid grid estim posit place descript adjac evid grid cover overlap scheme potenti misclassifi place base central cell altern strategi agent associ distinct place cell store predict cell nearest estim posit issu problem studi current system reli simpler classif strategi note approach common method reason evid grid place librari correspond store grid map test case make predict match function correspond similar metric determin test case store case final classif step similar nearest neighbor simplest techniqu fact evid grid probabilist comput set sensor differ prototyp abstract case unusu intrigu differ concern registr process system incorpor adapt occur case adapt place evalu process learn place knowledg approach learn place knowledg store evid grid increment agent encount environ sequenti concern task effect explor unknown assum agent led time observ place led commit place librari method place natur assum learn scheme posit agent construct evid grid method system simpli add grid place place place multipl evid produc sensor read approach place learn sound simpli store descript recognit perfect view ignor central featur task uncertainti place typic region occlud standard robot sensor sonar notori produc sensor evid repeat posit acquisit place knowledg page result space attribut cell evid grid langlei sage shown learn rate method drastic slow presenc irrelev attribut typic room larg open plausibl cell describ area make place learn difficult adequaci approach remain open question answer experi studi place learn section formul place learn task term similar describ induct problem method develop machin learn evalu robust framework section present number system test primari measur perform recognit accuraci place test set evid grid differ train set set experi design evalu abil approach reli physic robot nomad sonar ring simul machin physic environ suit offic common area stanford simul environ ideal layout similar depict earlier figur physic nomad ensur realism simul gave control devic paramet actual robot gener train test case place physic simul robot collect read sonar ring construct initi evid rotat move robot collect sonar read updat evid repeat process time simul gener grid distinct give total evid grid physic produc grid place process give total grid nomad simul incorpor number paramet affect qualiti sonar inform error paramet control random variat distanc return sonar critic control angl incid specular reflect control angular width sonar signal set error estim error encount physic left paramet default produc field view sensor specular reflect angl incid surfac condit simul ran learn system time random partit evid grid train test place correspond lower lower middl upper left room figur area left tabl figur page acquisit place knowledg number train case recognit accuraci simul environ physic environ number train case error estim posit simul environ physic environ figur learn curv confid interv place learn system physic nomad robot simul robot similar offic recognit accuraci perform measur error estim posit randomli order storag train case physic partit grid train case test averag run condit improv place recognit experi kibler langlei divid factor affect learner behavior broad involv characterist environ involv featur learner basic characterist number train case accuraci place recognit improv agent encount posit literatur report actual explicitli test expect figur show learn give confid physic nomad robot train test grid base sonar singl posit success orient increment system abil recogn place gradual observ store train case shape curv suggest learn task multipl case place achiev accuraci curv level addit case improv recognit close inspect infer structur reveal regist evid grid place similar grid posit place inher sonar sensor object occlud portion place posit tabl show actual physic robot train case note error involv misclassif place place mislabel classifi acquisit place knowledg page tabl matric probabl label place experi row correct place column show predict place train physic robot simul robot figur show analog learn curv simul robot gener shape curv similar physic rate learn higher tabl show averag matrix condit learner train case error perform compon gener assign correct place test case interest method abil recogn abil identifi posit robot place measur absolut differ actual robot posit test case estim posit comput registr process figur show learn curv physic similar result simul measur error quantiti start high gradual experi behavior simul environ gener mimic physic system fare sensor case qualiti amount sensor constitut interest factor expect affect asymptot rate place number train case reach accuraci level hope probabilist natur evid grid approach degrad gracefulli amount sensor figur show evid grid construct simul sonar signal collect posit orient lower left room figur grid set simul error paramet sensor grid set paramet produc result evid grid similar notic suggest basic infer method robust sensor effect infer artifact grid updat gener effect sensor creat boundari edg object page acquisit place knowledg figur evid grid gener simul sonar read lower left room figur sensor set relianc evid grid suggest natur noisi data store case base multipl sensor attempt improv qualiti case alter signal gener place descript base sensor read affect sensor predict interact independ specif affect learn rate asymptot accuraci test nomad simul produc level sensor error paramet set attempt vari qualiti store case strategi base evid grid train test sonar read collect singl posit produc orient gener result figur base grid produc repeat strategi nearbi posit room figur show learn curv result level figur present analog result strategi result set fell omit sake scheme fare simpler curv diverg predict rate learn method higher sensor present introduct sensor affect alter learn rate sophist reduc asymptot recognit accuraci simpler gener superior strategi evid grid base sonar read prefer scheme robust respect requir initi strategi acquisit place knowledg page number train case recognit accuraci sensor sensor number train case recognit accuraci sensor sensor figur learn curv place learn system level sensor evid grid base read posit read nearbi posit explor method sonar read initi rotat increment move fix amount read repeat process complet total read result evid grid base entir reduc chanc reduc effect sensor figur present learn curv strategi simul level behavior ident grid base half sonar signal sensor significantli degrad strategi accuraci remain method base evid grid number distinct posit place result base number read desir effect sophist sampl read intellig produc result effect similar metric section similar metric assign evid grid store grid match metric sum cell grid function measur similar individu cell contrast implement valu implement moravec blackwel rang neg infin present intuit argument prefer question measur behav practic ultim empir figur present result similar train test case place base simul sonar read posit learn curv set run error set paramet remain unchang page acquisit place knowledg number train case recognit accuraci sensor sensor number train case recognit accuraci mb metric lp metric figur learn curv level sensor evid grid base read equal interv line posit learn curv similar metric metric version function similar earlier paper curv moravec blackwel metric reveal learn slower reach accuraci train compar measur result impli approach viabl show similar measur make substanti differ place metric perform altern number distinct place environ distinct make desir learn method scale number place obtain preliminari result line examin algorithm behavior subset place environ figur show learn curv result case base simul sonar read posit report accuraci averag run subset randomli select train case test case carri carri run report confid interv accuraci averag averag number place speed examin rate note figur show learn curv cross level percent accuraci crossov point produc scale curv figur map number distinct place number train case reach accuraci level curv linear analog scale curv linear result suggest approach fix number train case independ total number place encourag method scale domain involv place ultim test predict larger environ acquisit place knowledg page number train case recognit accuraci place place place place place number distinct place learn train case accuraci straight line posit posit figur learn curv number distinct base sonar read posit scale curv number train case achiev accuraci function number place summari result report number experi design evalu approach acquisit knowledg place adopt method common research machin state explicit run experi design test vari independ variabl observ effect perform measur experi reveal number encourag behavior approach place learn gener improv recognit accuraci observ train similar result occur physic simul robot learn rate slow presenc sensor mitig effect qualiti infer evid grid rate learn slow number expect multiclass learn situat found similar metric perform significantli metric literatur exist factor influenc behavior method includ resolut evid grid distinct place learn distinguish reserv issu futur current experi suffici show approach relat work learn spatial knowledg research acquisit spatial knowledg area work ow strong intellectu debt elf moravec blackwel develop evid grid framework basic perform system directli emploi techniqu develop research research framework construct singl global collect evid grid distinct place approach acquir spatial page acquisit place knowledg involv induct train instanc improv perform test work place learn fit easili paradigm thrun reinforc learn improv sensor interpret goal construct global map mahadevan describ method form gener express evid aim learn place action model research evid grid formal studi place learn beer describ system repres place term mean varianc direct sensor infer grid occup place descript includ featur robot posit estim dead reckon connect recent visit place place recognit involv pass attribut gaussian function select competitor highest sum learn consist updat mean varianc recogn creat place exist match ad predict connect place beer relianc gaussian distanc metric make method similar differ instanc raw sensor natur learn process similar approach repres spatial knowledg system describ place call mean varianc sonar read gaussian metric determin match current sensor signal learn mechan includ creation updat place reinforc process design improv estim robot locat techniqu lead learner add place remov exist action reduc error locat estim kuiper byun nx system oper direct sensori store place distinct term optim measur nx defin central point hallwai corner symmetr equidist addit inform angl distanc obstacl system describ connect distinct term similar characterist nx encount local optimum compar sensor read place store descript locat metric topolog system classifi place nx creat place base ls descript store edg connect place matar describ similar detail place creation methodolog work similar approach gatewai door connect system repres locat grid structur evalu behavior term recognit accuraci scheme descript gatewai type beer system incorpor evid grid construct global map map correct error dead reckon place recognit acquisit place knowledg page recogn candid place creat actual train compar number recognit includ combin evid sonar visual sensor approach similar work spatial reason framework posit storag distinct descript direct sensori read infer summari space form evid grid consist connect sequenc line segment area describ perform element descript place recognit learn involv simpl storag infer place suggest method conclud remark studi place learn reveal insight work remain extens replac current learn method system identifi distinct place reli tutor inform plan emploi techniqu similar beer adapt oper evid grid direct sensor descript agent move regularli stop construct evid merg previou place descript match high grid basi place discontinu passag door past obstacl identifi distinguish place method place includ discuss construct topolog map connect place import direct extend approach expect store rough estim direct movement place successor suffici navig task execut navig agent regist locat enter place expect place rough translat greatli simplifi registr process store recent visit place evid grid reduc recognit error domain perceptu similar place futur hope develop method detect distinct featur evid grid simplifi place recognit process featur configur grid cell larg differ occur wall door recognit mechan presenc featur cue retriev candid place learn process featur index place memori learn featur plai role nelson qualit distinguish place simpl approach detect configur grid cell draw recent method featur select learn langlei estim accuraci obtain cross valid direct search space featur combin page acquisit place knowledg present framework learn knowledg place evid grid plai central role approach draw earlier work updat probabilist diverg previou scheme store set local grid case retriev match place recognit studi adapt machin learn literatur approach improv recognit accuraci sensor degrad learn improv qualiti store case offset effect experi reveal method scale number power similar metric match process system factor remain basic approach suggest natur extens acknowledg ow han moravec make evid grid softwar brian integr code nomad interfac alan schultz brian made barbara nil nilsson provid access nomad robot research support part grant number offic naval research institut studi learn acquisit place knowledg page refer occup grid mobil robot percept navig ieee comput machin learn scienc european work session learn topolog map mobil robot combin sonar vision twelfth nation confer artifici intellig aaai press eighth nation confer artifici intellig st mn oblivi tree abstract case work note workshop reason aaai press scale domain irrelev featur greiner comput learn theori natur learn system mit press qualit path plan sixth nation confer artifici intellig aaai press learn navig report siemen corpor learn system depart enhanc transfer reinforc learn build stochast model robot action ninth intern confer machin learn morgan kaufmann behavior synergi explicit integr sigart learn sensor model evid grid robot institut research review carnegi mellon comparison posit estim techniqu occup grid robot autonom system explor model build mobil robot domain ieee intern confer neural network san ieee explor spatial learn dynam environ report depart comput engin case western reserv comput theori cognit map artifici
HCI/273 4 hierarch present term clair mark beaulieu depart inform sheffield western uk present candid term fulli explor interact queri exist system offer iq facil list form present paper examin hierarch present term automat gener set retriev gener specif cascad menu evalu effect user test carri compar hierarch form convent list form show user hierarchi complet task time fewer term list relat initi queri term select term investig keyword inform interact queri concept hierarchi introduct interest provid onlin inform internet inform retriev system enabl user access heterogen resourc meet inform mean interact user ir system achiev search interest complex potenti benefit interact queri gener wide interest make ir system adapt automat queri user prefer gener earli form interact relev feedback user judg relev retriev document indic inform interest system harman examin interact approach present list candid term user user select term interest list add initi queri interact approach standard present iq adopt research techniqu rank candid term permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee sac spain copyright acm studi user interfac consid import aspect iq beaulieu evalu interfac design base ir system design graphic user interfac compar experi highlight import close relationship system function interfac design support queri belkin show give user control term ad queri retriev effect user satisfact studi compar potenti retriev perform iq simul experienc naiv user research address aspect interact user ir system context iq attent paid effect present candid term design discuss form list present motiv explor effect present term resembl studi search result exist ir system includ search engin web present search result list document titl addit inform size short summari user spend time scan list locat relev reluct examin document rank search result aim user locat document interest rank number techniqu develop area hearst suggest give user overview mean navig state overview user direct gener navig detail type overview hierarchi document subject directori exemplifi topic concept hierarch manner type navig ideal iq examin effect present term comparison made hierarch list term previou argu exist ir system paid attent present term form present domin list anticip hierarch present provid user overview candid altern form manual construct thesauri mesh spec integr system assist queri formul resourc inevit limit rang vocabulari necessarili applic domain techniqu meet aim introduc sanderson croft subsumpt hierarchi design term manner similar exist manual construct subject hierarchi yahoo unlik base techniqu measur similar term sanderson croft inform identifi term subsum term subsum document occur subset document occur frequent term gener subsumpt hierarchi term manner techniqu origin introduc mean automat gener concept hierarchi set retriev appli iq valuabl descript subsumpt section describ user test examin effect present term result discuss user test user test carri examin effect deriv method present candid term hierarch present convent list present compar particip total subject recruit user test major subject student depart inform rest member consist femal male ag subject rang averag topic topic user test trec test collect sixth text retriev confer subsumpt hierarchi creat topic relev document retriev topic remov decid remov topic produc small concept hierarchi topic gener hierarchi level term remov total topic remain experi system inqueri ir system studi candid term extract top document retriev queri compil term titl topic subsumpt final cascad menu list gener ident set term includ menu list order alphabet consid arbitrari order present term candid term topic term select test subject present appendix procedur subject explan reason experi subject told tool attempt gener summari retriev document process queri term extract document retriev shown screen indic retriev document set subject invit scenario submit queri retriev system respond show set term ad queri order improv search result task select term deem expand queri subject demonstr work system train queri topic descript illustr procedur train carri actual task topic order save menu list topic gener advanc user test subject altern assign control group group present interfac menu menu control group present list list complet task select term ad initi queri search expand queri descript user test found result discuss section describ result user test base standard recal number term time complet link type analysi term recal graph plot top retriev document retriev expand queri menu measur recal base trec relev assess graph show queri retriev document higher lower recal figur graph expand queri produc higher higher recal point graph show queri expand menu constantli perform slightli list statist found tabl show top ten twenti retriev document queri retriev relev document level shown expand queri expand queri menu higher list level tabl ten twenti expand residu list menu list menu residu sixth column tabl calcul set document retriev expand queri remov relev document initi queri retriev top lower rank document promot simul perform expand queri user identifi relev document initi search result top reveal extent relev document retriev expand queri data show expand queri relev document retriev top differ list menu term standard retriev effect shown number term time complet task standard retriev effect shown previou section standard method fulli adequ evalu line research present section present data effici complet task number term select subject time complet task shown tabl effect term select task frequent carri iq tabl effici task list menu select term time complet task subject menu group complet task term fewer list group significantli shorten time complet task perform figur statist user percept order gain indic abil interfac provid overview retriev subject group explor felt idea content retriev document subject menu group state idea content significantli higher list group felt explor list gave idea content subject menu group argu hierarchi gave idea find decent answer queri support approach provid adequ document retriev queri subsumpt hierarchi link type semant topic relat initi queri term term interest iq aspect search behaviour relat link type test base defin wordnet addit conceptu relat contextu conceptu relat term defin broadli relat term exist thesauru relat tooth type relat defin wordnet context queri tabl link type initi queri term term select menu group relat portion hyponym hypernym coordin sister synonym conceptu relat total tabl show link type initi queri term term select menu group reveal half term select subject term conceptu relat initi queri term synonym largest portion relat total select term aspect initi queri term similar portion found parent relat initi queri term result echo find experi select term consid type relat idea user similar tendenc found test reason tendenc clear specul term user descript inform complex relat initi queri thesauru highlight advantag subsumpt hierarchi mean hierarch present candid manual construct thesauru limit rang relat paper examin effect hierarch present candid term comparison convent list form differ term user hierarch present group complet task significantli shorter time user list present group conclud present term effect structur present improv select term suggest attent present term made research iq acknowledg tim postprocess data work carri part fund librari inform commiss council archiv author necessarili reflect sponsor refer lu recent experi inqueri fourth text retriev confer page nist beaulieu experi interfac support queri journal hard inqueri retriev system intern confer expert system page chen dumai bring order automat categor search result chi confer human factor comput page hagu acm queri interact concept hierarchi depart inform queri annual review inform system interact queri evalu relev feedback environ journal american societi inform greenberg optim queri process method semant encod structur thesauri terminolog journal american societi inform scienc harman interact queri annual intern acm sigir confer research develop inform page acm hearst user interfac visual modern inform page acm hearst pederson cluster retriev result annual intern acm sigir confer research develop inform page acm belkin case studi interact inform retriev behavior effect confer human factor comput system page acm van rijsbergen potenti actual effect interact queri annual intern acm sigir confer research develop inform page acm miller lexic english commun interact inform retriev base facet classif view intern studi confer classif colleg london frei concept base queri annual intern acm sigir confer research develop inform page acm beaulieu laboratori experi particip trec programm journal salton bucklei improv retriev perform relev feedback journal american societi inform sanderson croft deriv concept hierarchi text annual intern acm sigir confer research develop inform page acm chen interact term suggest user digit subject thesauri list inform retriev acm intern confer digit page acm visual search compar evalu interfac annual intern acm sigir confer research develop inform page acm sparck jone statist interpret term specif applic retriev journal harman overview sixth text retriev confer nist special public sixth text retriev confer page nist zamir etzioni dynam cluster interfac web search result eighth intern world wide web confer elsevi scienc appendix sampl user interfac
AI/274 2 seamless guidanc person agent virtual space base user interact real world mase atr media integr commun research laboratori abstract paper describ person agent guid visitor virtual space visitor real world guidanc real world increasingli import research demand advent small power palmtop pda digit obtain inform object real world base context current locat visit real world extend guidanc virtual environ context virtual environ real seamless guidanc visitor concentr attent understand actual element paper report experi seamless guidanc person agent virtual ancient villag context present open exhibit research laboratori introduct notion vision futur museum agent expert museum share huge amount knowledg expert asynchron commun tradit museum provid exhibit wide varieti interest exhibit visitor interest give understand visitor import issu project person museum mediat agent mediat agent creat exhibit tailor visitor mediat museum curat visitor involv mediat agent reconstruct logic relationship displai consid knowledg visitor interest person exhibit produc mediat agent virtual logic exhibit person guid agent person exhibit select item interest visitor entir origin exhibit give relev inform ow recent develop small power develop person guid agent pda digit cyberguid guidanc system pda main tour guid system provid inform tourist depend user locat ubiquit guidanc system guidanc system guid user real world base context real world studi guidanc virtual environ agent agent guid user virtual environ base context virtual environ real world virtual environ complementari seamless bridg world point import person guid agent guid user virtual environ base context real world vice versa note retriev inform user past experi give user suitabl inform user futur experi approach system report experi seamless guidanc person present open exhibit research laboratori poster present demonstr real virtual environ system develop testb project archaeolog simul system user walk ancient villag reconstruct comput graphic base actual data relev inform villag base user virtual posit user oper function bodi movement visitor open observ demonstr person guid run palmtop inform demonstr suggest visit person guid agent seamless manner visitor demonstr word visitor awar world visit invok person agent move real world virtual world vice versa person guid agent attent visitor explicit indic visitor seamless guidanc visitor devot attent primari understand content exhibit rest paper organ section overview person agent navig visitor virtual space seamless manner section describ recent experi open exhibit research laboratori seamless guidanc emploi person agent discuss futur direct research section section conclud paper overview vista system interact simul tool handl archaeolog data design museum research visitor extend incorpor interfac refer larg project screen cyberspac present user walk physic step retriev inform object displai scene point vista consist modul manag histor simul web browser document store html viewer vista www browser html refer document event handler pfinder screen viewer model data simul figur block diagram vista manag user store relief model locat build model basic data input modifi transit edit window simul modul user walk ancient villag render comput graphic viewer provid scene aspect freeli set simul year simul visual modul implement open inventor librari web browser connect main object object select show relev html document part fig show intern structur vista screen output interfac gestur interfac input addit origin keyboard interfac vista camera instal top screen captur imag user stand front screen imag program detect gestur posit user extract imag user captur imag user feet recogn action posit user gestur recogn process interpret command walk virtual villag displai chang select build major interact walk virtual space point object virtual space refer record user part bodi independ interact base delin principl form plausibl approach interact design stand posit control hand gestur control point tabl list gestur command figur depict user left hand select object main show virtual villag user walk relat inform shown top window top left window displai bird ey view ancient villag indic user tabl list gestur command gestur command stand neutral posit stop step forward move forward step backward move backward step rotat step left rotat left hand select build hand lower viewpoint person guid agent held exhibit research laboratori atr research laboratori dai aim provid visitor seamless guidanc person agent virtual space consist visitor context interact exhibit real world poster present demonstr distribut room virtual space virtual reconstruct villag access system form part exhibit typic scenario seamless guidanc demonstr visitor equip portabl comput person guid agent instal registr desk visitor visit poster present demonstr demonstr site sensor determin visitor enter area person guid agent automat virtual villag person guid agent start guid visitor depend interact long spent access real world visitor obtain inform virtual villag object portabl comput carri sensor detect visitor locat strateg enabl system distinguish system watch demonstr person agent consid visitor list realiz function open inform displai big screen figur view audienc visitor figur snapshot figur interact guid agent visitor tour guid exhibit system aim provid tour guid visitor carri portabl comput guid agent exhibit museum trade open research system consist main piec activ badg system olivetti track visitor thirti portabl comput provid visitor interfac agent server machin control manag plan part agent comput visitor receiv portabl comput person guid agent exchang detail includ compani initi interest registr desk visitor select cartoon charact guid agent portabl comput repres agent push idl suggest idl state agent guid visitor guid agent track visitor locat interest order recommend exhibit visit agent visitor inform exhibit physic map semant map guidanc type base user context visitor enter arena anim charact repres visitor agent ancient villag gener comput graphic displai big screen achiev sensor activ badg system posit big screen detect visitor enter area agent server id store badg worn visitor server activ badg system agent server send inform system socket interfac extract id visitor agent activ level inform navig type determin activ level agent anim charact villag start guid visitor navig type agent initi navig agent suggest navig visitor quit walk virtual person agent disappear virtual space note guid agent interact anim gestur intern idl activ level measur activ user interact demonstr real world person guid agent determin kind guidanc suitabl user decid activ observ type long user spent demonstr user portabl comput request relat inform content exhibit semant relat archaeolog content user interest tabl relat activ level guidanc provid agent activ level guidanc categori agent initi short navig agent initi long navig agent suggest short navig agent suggest long navig user initi navig capabl track user interest semant map demonstr reason oblig categor user model actual museum exploit featur acquir user interest base measur activ level user allot grade map activ level form guidanc shown tabl initi mean person guid agent control user follow agent show inform combin object villag automat displai user gestur suggest mean person guid agent suggest user follow agent proce interv wait user catch agent freedom object show relat inform left user agent suggest user request inform relat object anim gestur initi mean person guid agent user freeli walk villag gather inform user highli activ view exhibit real world expect virtual inform space agent differ navig navig relat length walk detail factor decid activ level time visitor person guid agent awar time guidanc long object detail inform sort long includ guid user tempor simul short discuss observ visitor convinc seamless guidanc person agent success visitor express slight respond warm person agent virtual villag develop person agent visit lead demonstr follow agent initi agent suggest navig neg agent initi guidanc game studi histori visitor demonstr read instruct gestur command begin familiar control focu attent agent guidanc content gave comment easi comment support experi evalu interfac visitor guidanc provid person agent infant stage work improv person guid person guid agent implement partial asynchron hierarch architectur full drastic improv autonom aspect agent collabor mediat agent initi navig agent suggest navig includ object base curat worthwhil guidanc similar convent guid main object project creat commun curat visitor person guid agent plan visitor interest account curat viewpoint mediat agent creat person exhibit visitor merg curat vast knowledg visitor interest collabor person guid agent mediat agent produc person exhibit guidanc current inform visual form visitor forc inform text imag screen smooth person guid agent visitor understand anim gestur agent walk agent object recommend guid agent give inform visitor concentr walk virtual villag examin seamless guidanc provid person agent virtual space base user interact real world report experi seamless guidanc system design futur museum open exhibit convinc visitor accept guidanc person agent kind interact person agent chang guidanc depend previou interact notion activ level introduc captur visitor interact real world discuss pro con system futur direct research collabor mediat agent acknowledg author mr dr member atr media integr commun research laboratori research opportun advic refer agent interfac anim interfac agent workshop intern joint confer intellig pp doyl intellig guid virtual anim interfac make pp mobil aaai spring ishii seamless interfac bit human factor comput system chi confer pp commun multimedia commun distribut process system pp lam intim comput support human intern symposium gener human support augment realiti environ knowledg intern confer virtual system multimedia pp interact visual tool archaeolog comput applic quantit method archaeolog confer design evalu gestur interfac virtual applic explor cyberspac museum exhibit mediat prototyp mobil chi confer pp interfac virtual workshop perceptu user pp nagao spoken languag interact real world intern joint confer intellig vol pp rickel lewi anim pedagog agent procedur train virtual anim interfac make pp track human intern confer automat face gestur pp
DB/275 3 merg potenti inconsist item structur text anthoni hunter depart comput scienc colleg london street london april abstract structur text gener concept implicit varieti approach handl inform item structur text number grammat simpl phrase semant label phrase item structur text nest larger item structur text semant label structur text meant stereotyp item structur text instanc stereotyp situat inform potenti structur text includ tag text text relat output inform extract system form instanti templat formal concept structur focu identifi inconsist logic item structur text present framework merg logic theori emploi merg inconsist item structur text problem merg report weather report merg structur knowledg inconsist manag techniqu introduct item structur text data structur number grammat simpl phrase semant label phrase set semant label structur text meant stereotyp item structur text instanc stereotyp situat semant regard structur text abstract item text report corpor acquisit repres item structur text semant label includ date semant label semant item structur text intend semant coher phrase structur text simpl proper number unit word phrase prescrib lexicon prescrib lexicon delin type convei item structur text materi potenti structur text includ item text structur xml output inform extract system templat notion structur text overlap data review whilst structur text develop techniqu reason focu inconsist item structur text affect wai merg simpl weather report london tomorrow rain inconsist dont inconsist formal concept structur identifi inconsist item structur text assum word phrase suffici simpl restrict requir natur languag process repres word phrase constant symbol semant label relat symbol present framework merg logic theori emploi merg inconsist item structur text problem merg weather report structur text draw exist techniqu merg inconsist inform logic review exist techniqu argu applic depend axiom requir defin item structur text merg merg system structur text incorpor domain knowledg merg axiom input merg system set item structur output singl item structur text consist domain knowledg conclud paper compar approach logic approach merg inform formal structur text section formal notion structur text skeleton notion abstract structur set item structur text explain translat item structur set liter structur text adopt basic definit easi view adapt idea varieti field relat languag system definit word string phrase string word text entri phrase null semant label phrase assum set semant label set text entri disjoint exampl word includ phrase includ april warm sunni definit oe semant text hoe atom featur exampl atom featur sunni definit complex featur defin hoe atom hoe complex oe semant label oe oe complex hoe oe oe oei complex featur item structur text complex featur complex featur april cold sunni assum order item oe oe complex featur hoe oe oe oei import assum hname john hname john definit hoe oe oe oei complex featur function defin oe oe foe oe ng complex featur ff complex featur fi iff ff complex featur tree semant label node text entri leav definit hoe oe oe oei complex featur semant label oe parent complex featur oe oe element oe oe offspr oe definit hoe oe oe oei complex featur function root defin oe oe oe custom fax number custom fax number figur fax semant skeleton note sibl fax number left fax number fax number definit complex hoe oe oe oei hoe oei structur iff oe oe structur atom featur hoe ffi hoe structur assum complex featur classifi structur report complex featur minimum structur regard structur report atom featur weather report assum gener condit classifi item structur text structur report definit structur uniqu refer label requir definit set structur refer individu member refer label skeleton order compar item structur text basi notion skeleton definit skeleton tree defin set node node semant set arc repres pair set sibl neighbour repres pair node iff sibl left definit rel posit sibl import skeleton sibl skeleton left form skeleton left figur skeleton essenti complex featur text skeleton form item remov text entri custom address custom ag address number street citi figur assum skeleton hold definit skeleton denot appli complex featur return skeleton set node set semant label defin hoe oei hoe oei ng jg skeleton function defin extract tree structur discuss section assum extra constraint skeleton hoe oei occur left item structur hname john repres figur definit skeleton preorder skeleton iff skeleton set arc subset arc sibl node left left figur definit complex featur skeleton instanti defin partial instanti full instanti instanti denot refer definit structur report structur iff definit structur report skeleton instanti assum uniqu refer label assum node uniqu refer label definit assum occurr semant label structur report uniqu refer label notion node skeleton semant label structur report interchang repres structur report logic formula repres structur report logic adopt classic logic logic assum usual languag classic logic usual symbol quantif usual symbol logic connect repres classic logic consequ relat logic inconsist repres structur report set classic logic formula har tree structur implicit item structur text semant label node text entri leav definit hoe oe oe oei structur report repres logic formula call oe root item assum semant label complex featur refer label definit semant label occur complex occurr refer label set formula form complex featur obtain exhaust appli semant label complex refer label parent refer label formula semant label atom refer label parent text entri atom formula root tree atom semant refer label formula root tree atom semant refer label text formula definit rule binari relat defin path root semant rule text entri rule refer label rule text entri structur report atom featur item structur text refer label report hname namei hname namei auction obtain set formula definit refer label definit formul denot defin structur report denot set formula obtain exhaust applic definit set structur report structur report refer label uniqu assum equal axiom uniqu section show logic structur report identifi inconsist subsequ show merg structur report merg axiom inconsist structur report find inconsist structur logic obtain definit definit set posit liter structur obtain inconsist structur set structur reason domain knowledg inconsist structur text defin respect domain knowledg definit domain denot set classic firstord formula add constraint languag section choic axiom domain knowledg depend applic explain definit exampl kind formula includ set clarifi type inconsist inconsist inconsist structur report domain inconsist inconsist individu structur report domain knowledg inconsist view special case inconsist item inconsist view gener erron assum item focu attent inconsist simplest form inconsist pair atom featur structur atom featur oei item atom featur item oe semant inequ suggest inconsist domain illustr text entri semant label suggest illustr structur report suni atom featur atom featur topic report london august structur report atom featur parisi atom featur topic report august captur describ semant label todai citi add axiom domain knowledg formal condit conflict text entri definit coher binari predic languag domain knowledg constraint behaviour assum axiom includ domain knowledg assum variabl rang text entri definit languag domain label conjunct denot function symbol denot conjunct refer label refer refer label domain knowledg includ axiom commut idempot function symbol definit label denot defin structur report set refer label set structur report fr assum axiom ad domain knowledg pair structur report semant label ff text inconsist adopt assumpt mean classic model set structur text text entri definit conflict monad predic languag axiom domain assum variabl rang conjunct refer label assum domain knowledg identifi inconsist text entri sensit semant label weather condit ensur structur report refer label topic illustr inconsist structur problem conflict weather report suni suni suni report repres set refer label refer label report definit structur report refer label refer label conflict respect semant label ff iff impli order determin pair structur report repres formula axiom reason axiom identifi text entri includ synonym text entri axiom text entri semant label axiom assum axiom date domain knowledg jan atom featur jan jan ident term infer axiom focuss inconsist pair atom featur inconsist complex featur complex featur oe oe ffi item complex featur oe oe ffi item foe oe ng foe oe ng semant inequ inconsist featur complex featur hname peter hname peter high castl assum form axiom assum integr constraint individu inconsist address complex featur pair item exampl involv inconsist pair item inconsist involv item weather report atom featur weather atom featur weather atom featur weather sunni straightforward add axiom domain knowledg forc inconsist report determin structur report inconsist respect domain wai merg set structur report subject section merg structur report present framework merg set structur report merg singl structur report call merg report conflict form merg report strategi base explain fulli subsequ combin atom featur oe oe atom featur set structur semant merg text entri oe oe text entri atom featur merg report set formula set infer predic set item topic merg structur report structur closur merg figur figur summar merg framework merg function set structur report return structur report form merg defin merg defin indirectli term closur structur set structur report return set formula closur set formula return infer predic infer domain knowledg merg axiom structur set infer predic form structur report union complex featur oe oe complex featur set structur oe oe semant label union put merg report select atom complex featur occur set structur reject rest select atom complex featur involv sourc content adopt merg axiom set structur report infer obtain appli merg axiom infer merg form structur report restrict merg structur report ng semant label definit set merg denot set classic formula add constraint languag section choic axiom set depend applic assum merg axiom languag introduc domain knowledg explain definit exampl kind formula includ set merg axiom definit merg denot pair set domain knowledg set merg axiom definit closur denot closur defin domain set merg ng set structur classic logic consequ relat closur formula closur infer predic definit set structur report topic merg function merg return structur report merg structur set infer predic form structur report defin structur formal definit explain select give exampl merg axiom combin atom featur aim combin atom featur form atom featur text entri disjunct conjunct coher definit languag merg system languag domain knowledg merg function symbol denot conjunct text function symbol denot disjunct text entri domain knowledg includ axiom commut idempot function symbol set merg axiom combin return merg axiom infer desir includ lexic rule merg axiom sun infer infer predic union complex featur necessarili combin complex featur combin atom featur union complex featur occur set structur report merg handl includ complex featur merg featur structur report report report nov nov report report south north temp temp region region weather weather union region report complex featur merg give merg report report south temp region report north temp region weather assum merg set structur report oe complex featur oe complex featur union oe merg check parent oe semant label captur definit properti definit ng set structur report oe oe foe oe merg axiom union complex featur incorpor condit check complex featur combin report gener combin section defin notion extend form combin axiom interest merg report topic report miss definit ng set structur report skeleton ng iff minim skeleton order definit set item iff item structur weather report suni suni suni left report denot report denot pair structur report report repres set refer label refer label handl add axiom merg axiom structur report set set liter node skeleton occur formula neg liter predic symbol semant label argument refer label node defin formal definit structur text set miss node respect denot form partial instanti oe node instanti refer label oe definit ng set set ad merg axiom set merg axiom combin item ad merg axiom return infer formal form close world assumpt form merg predic case miss inform select atom featur aim select form atom featur text entri choic text entri depend prefer origin item repres prefer order relat definit select order semant label ff relat ff set text entri ff languag merg axiom give illustr select order weather report tv channel rank reliabl order reliabl axiomat assum merg axiom includ formula sourc select sourc sourc sourc sourc sourc give illustr select order refer label pair weather report citi sourc made dai prefer recent weather report add set formula merg sourc sourc date assum set axiom implicitli merg fd date earlier date aggreg prefer illustr extend merg axiom exampl extra axiom aggreg prefer recent report reliabl tv station recent report reliabl tv station sourc date sourc date return merg axiom merg prefer order atom featur assum order structur adopt order level atom featur format merg structur report merg obtain set infer predic construct structur report incorpor inform infer predic form item structur text origin set item structur text requir coupl subsidiari definit definit rewrit rule formula xn ff fi posit liter predic symbol merg rewrit rule formula infer predic rewrit text entri simplifi text entri replac text entri synonym instanti modu merg predic rewrit infer predic merg axiom exampl rewrit rule definit closur merg function set structur report closur xn rewrit rule merg axiom ground rewrit rule form oe prefer oe closur continu closur prefer prefer infer filter prefer predic form merg structur report definit structur denot defin closur set infer predic hoe oe oe oei structur report form logic formula closur refer label refer label refer label merg report refer root merg report structur report obtain exhaust appli closur semant text refer label parent merg refer label merg report closur semant refer label semant label merg refer label parent merg refer label merg report closur liter closur prefer semant refer label parent merg text entri merg report explain rule rule identifi semant label includ merg report root identifi refer label rule identifi branch includ merg report result union complex rule identifi prefer text entri includ structur function process formul function defin hold continu form merg item structur text structur function infer predic suni continu form merg item structur text structur function infer predic suni suni bigger provid definit notat merg system illustr definit bigger definit languag merg system languag domain knowledg merg rang denot function symbol denot rang valu text entri text entri illustr merg bigger problem conflict weather report parisi parisi set add axiom merg axiom exampl assum fact ad merg axiom adopt logic fuzzi statement hold approach necessit commit statement assum gener rule knowledg depend merg system user adopt knowledg extend set merg axiom set infer merg parisi introduc rang function function axiom introduc languag merg system depend applic area merg system approach merg base axiom mean merg function depend formula depend applic make gener comment desir behaviour merg function applic definit associ properti defin set structur report merg merg function merg merg merg merg merg merg merg relat reflex associ properti definit hold assum set merg axiom axiom form semant label extrem merg function properti definit hold set merg axiom inconsist extrem merg function reflex fail set merg axiom empti set properti hold merg function includ transit left logic properti definit transit properti hold merg condit set structur report merg merg impli merg definit left logic properti hold merg condit set structur report impli merg merg properti hold merg function includ properti definit monoton properti hold merg condit set structur report definit democrat properti defin ng set structur report merg merg function ff complex featur ff complex featur merg ng ff complex featur item ff merg report definit properti defin set structur report merg merg function oe merg oe merg function adher properti merg defin merg axiom merg reflex similarli merg defin union merg axiom exampl merg reflex axiom hold merg function obtain adapt axiom social choic theori review comparison relat techniqu examin problem merg item structur text structur report view logic conceptu inconsist structur report domain knowledg merg structur consid kind merg explicit set merg axiom question relationship relat techniqu fusion review inform fusion overview techniqu fusion logic formal oper merg inform topic number area data knowledg engin research briefli review belief merg logic inferenc inconsist inform belief theori belief theori assum belief repres logic oper belief light adher ration logic postul initi postul belief makinson seri develop belief theori includ iter belief relat belief updat review belief theori belief theori offer interest intuit abstract constraint number problem regard applic focu assumpt result updat set belief formula ff result set belief includ ff central tenet belief counter merg structur report concret merg adher belief postul perez merg belief base semant interpret set formula updat approach gener merg respect integr constraint maintain updat approach extend belief call arbitr schaerf form merg restrict merg forc result disjunct origin inform prefer abstract belief incorpor prioriti includ order theori present priorit approach aim origin belief adopt sophist view refin belief order theori formula prefer contradict aspect contradict preserv adopt inferenti weaker formula avoid contradict prefer formula merg undertaken arbitrarili larg partial order formula priorit belief oper defin term select model satisfi belief nearest exist belief measur iter belief prefer item kei critic approach assumpt sourc partial order context realist practic merg techniqu addit techniqu perez discuss previou baral al offer approach combin priorit theori approach assum linear order set set formula techniqu merg merg version prefer set combin prefer set maxim subset consist techniqu iter result previou cycl prefer prefer set process repeat set consid version prefer set combin prefer set maxim subset consist techniqu iter result previou cycl prefer prefer set process repeat set consid kei critic approach assumpt sourc order context realist practic logic inferenc inconsist inform focuss merg reject item inconsist close relat approach reason maxim consist subset problem reason maxim consist subset amelior assum inform prioriti formula exampl kind reason includ kei critic approach assumpt sourc partial order context review logic inferenc inconsist inform focuss approach close relat merg number logic inferenc inconsist inform review summari inadequaci exist techniqu regard merg simplist merg structur report incorpor detail issu applic domain problem summar prefer order sourc prefer order order merg item structur prefer sourc level atom featur updat belief approach assum latest updat acquir inform good case merg item structur text separ domain knowledg approach incorpor special role domain knowledg approach domain knowledg equat integr constraint weak merg base meet oper form merg unnecessari loss inform restrict domain viabl acquir suffici merg rule give intellig merg inform lost net draw analysi requir sophist approach merg inform paper hope exampl merg weather report paper motiv viewpoint address knowledg advoc sophist approach merg issu obtain manag knowledg seemingli simpl exampl merg call substanti knowledg engin effort number research area offer resourc techniqu har solut comput linguist lot inform reason structur text lexic knowledg larg lexic resourc wordnet kind machin readabl dictionari thesauri address part richer formal lexic semant call increasingli import area comput linguist system develop robust knowledg gener knowledg subject research reason commun largest cyc aim axiomat broad rang knowledg intellig system number knowledg engin project produc tool formal applic area commonkad induct logic program number techniqu machin learn text mine applic develop focuss structur text applic induct logic program approach gener logic theori exampl practic merg system involv challeng integr technolog resourc construct manag knowledg discuss structur text gener concept implicit approach handl textual inform includ tag text text relat output inform extract system structur text natur view logic item structur text repres formula classic logic mean consist check inferenc undertaken structur text domain knowledg vast amount inform potenti form structur analysi alert base paraconsist reason reason valuabl technolog lexic world knowledg reason semant label answer queri whilst structur text close relat xml idea leav formal comparison futur work xml relat technolog state flux briefli notion relev paper approach wrapper offer practic level defin heterogen inform merg problem conflict sourc approach term formal merg inconsist inform refer abiteboul queri data intern confer page abiteboul view xml acm confer principl system makinson logic theori partial meet contract function journal symbol arpa messag understand seventh confer morgan tan xml queri languag queri languag workshop prade argument infer uncertain inconsist knowledg base confer uncertainti artifici page morgan prade logic approach reason inconsist stratifi knowledg base symbol quantit approach reason volum lectur note comput page subrahmanian combin consist theori comput brewka prefer extend logic framework default reason eleventh intern confer artifici intellig page buneman semistructur data acm symposium principl hunter inform fusion overview symbol quantit approach uncertainti lectur note comput page cowi lehnert inform extract commun cohen inform system reason structur collect text autonom manag prefer assumpt base reason inform process manag uncertainti knowledg base system volum lectur note comput scienc pearl logic iter belief artifici duboi editor handbook reson uncertainti manag volum hunter argument reason classic inconsist inform data knowledg gardenfor knowledg flux mit gabbai methodolog iter theori chang practic volum lectur note comput scienc gabbai structur belief practic approach priorit base qualit quantit practic volum lectur note comput scienc grishman inform extract techniqu challeng inform extract yerneni wrapper tsimmi system acm hunter intellig text handl default logic ieee confer tool artifici intellig page ieee comput societi hunter default logic lexic knowledg qualit quantit practic volum lectur note comput page hunter paraconsist logic gabbai ph handbook reason uncertainti manag volum page hunter reason lexic knowledg technic depart comput colleg hunter ramif analysi causal map data knowledg hunter reason inconsist structur text knowledg engin kelli social choic introduct mendelzon differ updat principl knowledg intern confer page morgan perez logic merg sixth intern confer principl knowledg reason page morgan perez merg integr constraint qualit quantit approach reason volum lectur note comput scienc lehmann belief joint intern confer artifici intellig page lenat invest knowledg infrastructur commun schaerf arbitr merg ieee transact knowledg data miller lexic english commun infer inconsist inform theori de editor intern workshop infer comput semant institut languag muggleton induct logic program academ gener lexicon mit ryan repres default sentenc reduc prioriti principl knowledg intern confer morgan sahuguet build wrapper legaci web intern confer larg schreiber al knowledg engin manag mit guthri electr mean mit
Agents/276 1 internet comput distribut review programm coordin architectur mobil agent giacomo letizia franco zambonelli dipartimento di scienz università di modena reggio emilia modena itali author abstract mobil agent repres technolog develop internet applic mobil comput entiti introduc peculiar problem wrt coordin applic compon paper outlin advantag coordin show programm coordin model base reactiv tupl space provid desir featur internet applic base mobil agent paper present design implement mar coordin architectur mobil agent mar defin tupl program react specif action access made mobil agent exampl context www inform retriev applic show effect mar approach mobil reactiv tupl java introduct tradit distribut applic design set process static assign execut environ cooper fashion mobil agent promot applic made entiti capabl chang execut environ transfer execut current interest mobil agent broadli justifi advantag presenc internet mobil agent dramat save move local resourc requir transfer possibl larg amount mobil agent carri code manag remot resourc remot avail specif lead flexibl applic mobil agent requir continu network interact entiti move site connect interact network consequ mobil agent suit mobil comput system system program environ support develop distribut applic base mobil agent issu face make mobil agent technolog wide secur effici execut program languag coordin model mobil agent fundament activ coordin agent agent resourc execut environ agent mobil open internet scenario impli problem occur tradit distribut system paper argu coordin model adapt suit wide heterogen network lead simpl applic design paper show flexibl safeti stem definit programm coordin effect interact event program meet specif execut environ applic agent motiv design implement mar agent reactiv coordin base definit tupl agent exploit coordin applic agent access local resourc unlik raw tupl mar tupl space local administr agent react specif action access made agent characterist specif state coordin polici defin secur agent execut shown exampl appli case studi applic coordin model mobil agent applic nomad agent coordin activ agent resourc execut environ applic made mobil cooper perform task exchang data mobil agent roam remot internet site access resourc servic alloc coordin model extens studi context tradit distribut environ mobil open internet environ introduc peculiar problem coupl versu uncoupl coordin model system aglet exploit coordin model typic paradigm remot object java specif api put involv entiti direct impli spatial coupl tempor coupl agent explicitli commun partner synchron activ lead drawback mobil agent applic mobil agent commun directli wide local mean complex highli inform trace protocol repeat interact agent requir stabl network make commun highli depend network reliabl possibl lead failur unpredict delai mobil agent applic dynam agent make difficult adopt spatial coupl model requir identif commun partner presenc agent move direct coordin effect exploit rule access local resourc execut interact local server coordin introduc telescript implement ara system solv spatial coupl problem make agent interact context abstract meet point explicitli partner involv agent open meet point agent join explicitli commun synchron meet local constrain avoid problem relat unpredict delai meet place execut environ local agent particip meet abstract role local servic execut environ major drawback meet model enforc strict tempor coupl interact bound place time mine properti autonomi dynam agent schedul posit easili properti make risk miss interact high exploit coordin make interact occur share data space local execut environ includ ambit model mobil comput mobil agent system blackboard common repositori store retriev medium access local publish data servic agent commun leav messag blackboard receiv read blackboard enforc tempor uncoupl suit mobil scenario posit schedul agent easili trace blackboard model provid secur execut environ fulli monitor interact occur local blackboard agent common messag identifi commun exchang data blackboard file ambit url interact spatial uncoupl coordin model exploit recent context interact internet extend blackboard model introduc associ mechan share data inform organ tupl retriev associ mechan associ blackboard tupl inherit advantag term secur tempor enforc spatial tupl access content requir mutual knowledg agent coordin suit mobil agent wide dynam complet updat knowledg execut environ applic agent difficult imposs acquir agent requir match mechan deal dynam worthwhil integr mechan directli coordin simplifi agent program reduc applic complex programm tupl space potenti benefit term spatial tempor basic linda coordin model lack flexibl control interact environ interact bound match mechan provid tupl suitabl kind interact complex interact protocol difficult realiz control exploit linda interact model linda provid simpl solut servic provid site problem solv introduct programm tupl space model programm stem capabl defin specif comput activ trigger reaction specif access event tupl space impli capabl decid type access event trigger activ tupl stateless associ linda mechan programm reactiv tupl space provid advantag mobil agent applic site administr program reaction monitor access event local resourc implement specif secur polici execut order achiev control defend integr environ malici agent reaction implement dynam tupl space tupl static store data structur dynam produc demand point reaction enabl simpl mechan access servic attempt read specif tupl agent trigger execut local servic produc requir tupl result reaction adapt effect interact specif characterist execut environ gener emb intellig tupl space advantag provid give applic capabl defin coordin agent carri code reaction implement specif coordin instal tupl space site visit capabl requir face peculiar secur issu possibl applic defin coordin rule form reaction tupl space achiev sharp separ concern algorithm coordin issu agent charg embodi algorithm solv reaction repres coordin rule reduc agent complex simplifi global applic design drawback programm tupl space irrat program lead distort applic make user lose control execut applic agent administr site interest alter applic semant interest exploit programm administ tupl space enrich avail data resourc protect tupl space program constrain confin effect applic influenc agent belong applic mar coordin architectur mar agent reactiv develop start implement portabl programm coordin architectur mobil agent mar architectur implement java agent system design complement function agent bound specif mobil agent system slight extens current test mar architectur made multipl independ tupl node access agent local execut node figur requir integr mar mobil agent system make agent server charg accept execut incom agent node figur suppli agent refer local mar tupl space figur agent node access local tupl space set primit figur mar tupl space react access differenti program tupl space meet specif figur mar tupl space exploit commun agent associ retriev primit data item refer execut environ resourc local tupl space resourc agent directli access problem dynam bind local refer mobil entiti limit mar refer local tupl space network node tupl space tupl space agent server mar interfac reaction internet figur mar architectur repres mobil mar design complianc javaspac good candid de facto standard tupl space interfac java mar tupl java object instanc variabl repres tupl field tupl class implement entri requir tupl manag easiest deriv tupl class class defin basic tupl properti implement entri instanc specif tupl field field tupl refer object repres primit data type object java field tupl defin null mar tupl space realiz java instanc space implement mar extens javaspac interfac access tupl oper put suppli retriev tupl basi templat tupl suppli paramet pattern match work read oper extract match tupl retriev match tupl extract match tupl space paramet transact oper belong timeout paramet specifi time wait oper return null match tupl mean return mean wait indefinit paramet write oper set lifetim written tupl oper present javaspac interfac ad mar interfac avoid agent forc perform read retriev risk retriev tupl time problem tupl space due select tupl multipl match public interfac mar extend javaspac method interfac inherit javaspac transact long put tupl space entri transact long read match tupl space entri transact long extract match tupl space method ad mar present javaspac interfac vector transact long read match tupl vector transact long extract match tupl figur mar interfac templat tupl suppli oper defin null valu tupl match templat tupl defin valu equal tupl object mar element tupl match rule account presenc class object templat tupl tupl match instanc class extend linda model permit match tupl provid belong class defin field repres primit type field defin field equal serial form mention java object assum serial form instanc variabl equal includ null correspond null tupl obtain actual field object access java object file local file system repres tupl type string date file templat tupl match tupl templat tupl match tupl reactiv model provid limit form specif oper dynam evalu tupl due unclear semant eval lack suitabl model control comput perform tupl implement rule eval form reactiv discard eval recogn tupl space reactiv defin flexibl control architectur associ programm reaction event tupl tupl space access perform agent mar reaction state object method reaction access tupl space chang influenc effect oper perform agent associ reaction access event repres store tupl space tupl form mean reaction method object trigger agent ident invok oper op tupl match put extract tupl tupl space mean instal reaction event tupl space case associ reaction access event match tupl space associ reaction instanc read tupl type content agent ident tupl space associ mechan similar tupl space mechan activ access level tupl detect presenc reaction execut tupl match access trigger execut agent ident invok input oper op read suppli templat tupl mar execut step figur issu pattern match mechan tupl space identifi tupl match execut tupl space provid tupl match step templat match found mar trigger execut reaction reaction method receiv tupl op expect return tupl result match mar invok oper op proce normal semant tn tupl space tupl space agent id trigger reaction match tupl templat execut reaction figur mar activ execut singl match match reaction reaction execut multipl match reaction reaction reaction reaction execut multipl match reaction reaction reaction reaction reaction reaction result tupl agent figur case multipl multipl reaction multipl match multipl reaction multipl match reaction satisfi match mechan step reaction execut pipelin figur instal order order reaction execut pipelin influenc final mar rule case invok tupl multipl match produc step reaction trigger step multipl match produc step pipelin match reaction match tupl figur match produc step singl pipelin reaction reaction pipelin produc multipl result rest pipelin replic result tupl figur case write mar start directli step tupl paramet write oper reaction access tupl space perform kind oper oper tupl space perform reaction issu avoid endless exploit tupl space repositori reaction state addit state reaction object store part state behavior reaction depend actual content tupl space past access event reaction avail result match mechan issu templat input oper invok reaction influenc effect oper return invok agent tupl result normal mechan characterist mar reactiv model lead great applic section substanti distinguish notifi mechan javaspac introduc reactiv tupl notifi mechan simpli signal extern object insert tupl tupl space access event monitor write give possibl control influenc effect tupl space activ possibl trigger notifi object space independ intern activ secur model secur import issu context mobil agent applic secur concern protect tupl space unauthor malici access mar assum mobil agent system system agent identif authent agent execut node main secur mechan provid mar associ access control list tupl acl defin system administr decid oper tupl author start acl mar integr secur polici base role agent ident map case mar role de facto ident agent translat ident role simplifi manag acl lead uncoupl agent system mar role gener defin tupl writer manag agent reader role read tupl insert tupl extract store tupl agent writer role read tupl store tupl extract tupl store agent ident agent manag typic local full write extract tupl full access level tupl enabl dynam instal reaction role defin give deni access specif class tupl agent instal reaction regard limit set access event administr site defin proper role author polici extern applic extern agent influenc instal reaction activ agent specif applic mar mobil agent applic applic area www inform retriev show mar capabl lead simpler flexibl applic design coordin model applic exploit mobil agent reach remot internet site local access html page analyz extract requir inform transfer page network searcher agent remot site analyz local www page back url page specif keyword speed applic shape tree concurr searcher agent searcher agent site find html link possibl interest page clone clone follow continu search work site environ coordin make agent access retriev inform coordin avoid duplic work perform clone occur common case html page searcher agent searcher agent user site searcher agent link link html link html html link clone searcher agent link link clone searcher agent figur agent arriv site access local html page creat agent link return user site environ coordin reli direct access local resourc execut environ base local request provid servic retriev data html page specif server provid servic applic www server configur provid index url site agent forc explicitli navig page page root html page retriev html page code mobil make agent carri code servic instal site visit introduc secur issu requir except case execut servic site fail solut forc agent adopt point request servic requir adopt blackboard tupl space html page site access requir presenc peculiar servic natur style class extend root class tupl hierarchi tupl field public string pathnam file repres tupl public string repres file type public date date updat file public file file object access content file constructor tupl order paramet defin tupl field order public string date file pathnam extens figur class tupl repres file tupl space case local execut environ provid access html page tupl make gener file extens modif refer file object access content file instanc class shown figur repres tupl creation templat tupl vector read match tupl return vector tupl match tupl found agent return user termin match tupl tupl repres file search keyword file store file privat vector return user search remot link send clone remot site user site figur code searcher agent agent html page obtain refer access tupl suitabl fragment java code agent applic shown figur searcher agent invok oper provid templat tupl extens field defin oper return match tupl repres html document vector match agent access file search keyword interest content agent search remot link file clone follow link back home note case agent select access html file agent forc read blackboard select html file program algorithm file extens basic scheme environ coordin made flexibl secur exploit mar influenc agent code site store html page file extens administr exploit reactiv enabl access html file agent request standard forc chang local filenam duplic tupl forc agent explicitli deal kind heterogen instal reaction transform request file tupl extens request tupl extens field implement shown figur specif request tupl class implement reactiv public entri oper ident match occur site htm file modifi extens requir file return figur reaction class badli program malici agent categori agent fit distinguish host perform oper tupl system administr decid agent read content match tupl delet instal reaction transpar transform disrupt perform foreign agent oper implement class figur includ record bad attempt system instal write tupl space administr combin reaction insert tupl introduc reaction make tupl space react pipelin oper request reaction execut tupl return reaction figur javaspac achiev behavior reaction notifi mechan captur input event modifi effect class implement reactiv public entri entri oper ident paramet refer local tupl space refer match tupl oper type ident assign agent perform oper match produc check identifi agent perform oper return tupl delet space administr full log access return fe tupl return extract return match produc coordin figur reaction class case coordin avoid duplic work site adopt direct coordin model forc odd design solut case studi agent dynam creat autonom agent applic agent agent agent visit site exist integr special directori server applic design directori alloc user home track site visit remot access applic agent site visit updat list site visit solut complic applic design requir make effici reliabl case distribut solut sketch requir introduct entiti applic agent explor creat forc resid creation site notifi ad hoc open incom agent previou visit meet agent open basic act share inform coordin model base share dataspac case blackboard tupl space coordin simpli realiz peculiar design solut case searcher agent arriv site check local tupl space written agent applic form agent obtain site visit charg put marker tupl tupl space realiz searcher agent assign role permit write tupl tupl writer role make node risk overwhelm tupl left agent care delet space face administr decid exploit mar reactiv instal reaction overrid write oper perform agent write tupl tupl space disregard lifetim possibl writer agent paramet implement lifetim class shown figur write oper perform agent writer write tupl space class lifetim implement reactiv long public constructor public entri entri oper ident return figur lifetim reaction class class implement reactiv privat date date visit public constructor visit reaction instal date visit automat set constructor public entri entri oper ident match document modifi visit set time visit return return tupl repres updat page return tupl return figur reaction class sophist avoid duplic work site achiev agent instal reaction access event perform agent applic relat tupl applic agent instal state reaction simpli avoid retriev duplic account updat html page agent access tupl space retriev refer html reaction check match tupl file modifi visit agent applic file tupl return agent implement reaction class shown figur instal write tupl space perform evalu perform measur evalu time requir access mar tupl space evalu overhead introduc mar reactiv model figur show time aglet run sun ultra perform read oper local mar tupl space return match complet deactiv activ passiv tupl space tupl space activ reaction instal reaction issu reaction instal activ number reaction make read oper issu reaction reaction issu reaction instal access time mar tupl space logarithm number tupl store tupl space ms test due larger amount inform dealt match process compar access time tupl space match mechan overhead introduc mar reactiv model independ global number tupl overhead introduc activ tupl space reaction grow slightli number reaction instal case reaction instal tupl space number overestim normal situat tupl trigger overhead introduc measur overhead introduc reactiv specif mar implement appli tupl space implement extend programm ms total tupl local rmi read reaction issu reaction instal read reaction issu reaction instal read reaction issu reaction instal read reaction issu reaction instal read passiv tupl space figur overhead introduc reaction case reaction start tupl interact mechan possibl exploit java mobil advantag interact clearer local rmi averag time read mar case remot rmi sun ultra sparcstat connect ethernet cost aglet messag system make cost ms time migrat aglet agent kb easi calcul agent dozen interact resourc site carri cheaper migrat agent site interact local interact remot relat work main featur discuss exist exploit tupl space context internet applic architectur interact web applic exploit coordin tupl space mobil fix agent store associ retriev object agent creat privat tupl space interact privat affect host execut environ reactiv identifi limit raw linda model defin special charg access space chang influenc coordin activ applic agent potenti agent term monitor interact event tune effect space project ibm defin interact space inform repositori network mobil applic aim defin coordin space aim provid power standard interfac access larg amount inform organ space recogn limit basic linda model integr peculiar form enabl behavior ad tupl space behavior ad term admiss oper tupl space complex program effect basic linda mar make space usabl open internet requir applic agent awar oper tupl space dynam acquir knowledg import characterist distinguish mar system concern agent refer tupl space agent hold singl refer implicitli bound tupl space local execut environ space agent refer multipl tupl local tupl space access fashion make difficult manag agent code explicitli manag tupl space refer make agent execut control interact occur transpar locat agent tupl space tucson model develop context affili research face problem make agent refer tupl space internet enforc regard tupl space tucson resembl mar full program capabl tupl space tucson defin programm logic tupl space tupl reaction express term untyp logic term characterist tucson complement mar make suit develop applic base intellig inform charg access manag larg heterogen inform sourc mole system defin coordin model worth mention context mole meet occur agent access messag unlik telescript ara mole meet enforc tempor uncoupl permit asynchron notif messag agent program order integr specif polici manag messag exchang characterist lead uncoupl programm coordin mar mole enforc coordin contrast requir definit work progress coordin possibl enrich capabl program behavior tupl suit mobil agent applic lead simpl flexibl applic design mar defin gener portabl coordin facilit design develop internet applic base java mobil agent present extend mar integr framework comput support cooper work integr lead gener framework execut interact web applic base mobil agent solv open secur problem foreign applic agent program tupl space mar confin effect avoid spam endless intens reaction clear garbag collect mechan defin avoid site overwhelm reaction instal applic agent longer gener open problem mobil agent technolog peculiar problem mar reactiv model acknowledg author anonym suggest work support italian della ricerca framework project methodolog tool high perform system distribut refer coordin model ieee vol pp april ieee vol pp august concept mobil agent world wide web vol pp model internet applic base mobil ieee foundat softwar scienc comput lectur note comput verlag pp applic refer ieee transact softwar vol pp agent interact heterogen st intern workshop mobil lectur note comput pp april code ieee transact softwar vol pp languag commun vol pp februari issu program ieee vol pp java mobil ieee internet vol pp juli august target mobil ieee internet vol pp juli august deploi mobil agent read august coordin model mobil journal internet vol pp agent remot zyda mobil explan bradshaw softwar aaai menlo park pp select url mobil agent coordin ambit ara dagent gener magic ibm aglet javaspac mar mole space tucson
IR/277 5 content search retriev ad hoc francisco nguyen cs rutger technic report depart comput rutger nj april abstract problem content search retriev commun comput potenti power model inform share ad hoc group user low cost entri natur model resourc scale commun size commun grow locat inform distribut larg number peer problemat present distribut content search retriev algorithm address problem algorithm base document rank model instanti rank rule naiv applic requir peer commun collect invert index entir commun costli term bandwidth storag show approxim compact summari peer local invert index make show rule adapt index provid heurist adapt determin set peer contact show algorithm track perform document distribut commun algorithm preserv main flavor retriev close set document queri introduct problem content search retriev commun comput member commun contribut work support part nsf grant resourc commun establish direct connect member access commun resourc carri commun activ comput potenti power model inform share ad hoc group user low cost entri explicit model resourc scale commun user interact form commun individu join bring resourc commun grow natur system scale larg size member join commun measur commun group student set commun connect user share data number open problem potenti comput realiz content search retriev open problem exist commun emploi central directori server flood algorithm object locat viabl framework content search retriev central server present singl point failur limit scalabl flood techniqu theori arbitrari content search typic limit number perform flood provid limit power locat relev inform queri flood portion commun inform guid techniqu reli heavi replic popular item success search recent work studi scale commun put effici reliabl distribut method object locat remain object locat effort intend support file natur model acquir amount storag rapidli inform manag difficult tradit file system hierarch space success internet search engin strong evid content search retriev intuit paradigm user leverag manag access larg volum inform anecdot ber individu research group googl hierarch namespac individu depend googl reloc page daili group grow size explod size cost small group share larg amount data motiv explor content search retriev engin similar inform access paradigm internet search engin present distribut rank algorithm content search retriev specif context infrastructur build task develop applic framework ad hoc set user easili set inform share ti requir support central server support search retriev inform spread dynam commun possibl run set heterogen devic basic idea commun member creat invert index document summar index compact summari commun member queri retriev match inform collect inform store commun provid overview discuss advantag underli approach section problem focu perform content search retriev index summari adopt vector space rank algorithm suggest salton al success rank algorithm vector space rank document queri abstractli repres dimens distinct word ponent vector repres import word refer weight document queri comput relev document queri function angl activ work extend gener framework build inform share vector popular method assign term weight vector space rank model basic idea combin term frequenc document term show document collect fact term frequent document import describ term document collect differenti document queri naiv applic requir peer commun access invert index entir commun order comput similar queri document provid costli term bandwidth storag show approxim compact summari peer invert call result algorithm present specif context gener applic framework maintain approxim inform global index peer make show rule adapt rank peer order likelihood rank retriev ment absenc complet global provid heurist adapt determin set peer contact benchmark collect smart trec show algorithm match accuraci compact summari individu invert index collect invert index entir commun inform algorithm preserv main flavor return close set document queri trade bandwidth good search perform match search perform defin perform metric section contact peer entir invert index peer averag run assum user sort larg number retriev document find number peer contact direct heurist tune address content search retriev algorithm arent commun share file music inform share commun imagin compani form commun share text document repositori scientif legal imagin sport leagu commun share larg collect player team inform statist research group inform share commun benefit central approach share larg repositori research document approach satisfi reason elabor partial address decentr control scheme data text data movi review effect content search retriev overview support search retriev inform spread dynam commun agent possibl run set heterogen devic section briefli discuss relev featur detail provid context rest paper figur summar compon basic data block xml snippet snippet extract term possibl link extern file share xml user publish document index document store copi local data store share user publish xml snippet pointer file possibl addit descript file index xml snippet extern file type store xml snippet local data store file bloom filter summar index peer bloom filter arrai bit repres set set word peer invert index filter comput obtain indic member typic hash set bit index make structur provid xml tag plan extend make structur futur commun dynam set peer connect network internet peer local store xml document share commun peer gossip algorithm maintain directori activ peer set bloom filter summar content local store bloom element member comput indic check bit peer comput bloom commun gossip rithm combin al algorithm demer al algorithm algorithm maintain directori peer peer queri commun content queri bloom filter collect peer document word car test car bloom filter result bloom filter peer pl contact pl document word note peer document bloom filter give posit set peer peer pl document word bloom filter give neg approach bloom filter number collect bloom filter low peer effici approxim invert index entir commun implement rank algorithm depend global costli current tem bloom filter effici summari minim requir bandwidth storag node appendix show total data index summar niti content peer independ accuraci storag peer combin filter peer save contact set peer queri hit combin filter abil independ trade accuraci storag peer run devic gossip inform maintain peer extrem resist attack main disadvantag approach rapidli chang inform spread necessarili spread time minim spike commun bandwidth address peer implement inform brokerag servic consist hash publish locat inform index servic support time locat exchang inform subset peer involv entir commun similar approach al discuss featur impact work present paper shown easili scale commun size thousand gossip rate propag bloom filter term commun peer spread inform requir averag peer commun connect low bandwidth reduc gossip reduc gossip rate requir minut bloom requir averag bandwidth valid simul commun peer cluster pc connect ethernet lan inform dynam duce gossip rate time distribut content search retriev main problem address paper search retriev document relev queri pose member commun collect text problem retriev subset relev queri studi extens success techniqu address problem vector space rank model decid adapt techniqu briefli provid background vector space base document present heurist adapt techniqu environ vector space rank vector space rank document queri abstractli repres dimens distinct term space dimens distinct term compon vector repres import word refer weight document queri rank relev document queri measur similar queri vector candid document vector similar vector gener measur cosin angl comput idi repres weight term queri weight term document observ mean term mean term denomin equat drop simplic popular method assign term weight call rule basic idea combin term frequenc document term show document collect fact term frequent document import describ term document collect differenti document queri collect paper publish oper system find term oper system document differenti relev document exist literatur includ wai implement rule adopt system equat suggest witten al number document number time term number time term document simpli drop normal denomin equat long document erron rank higher short document higher term weight higher term customari substitut simpler normal tor idi term document result similar measur idi collect current search engin implement rank algorithm construct invert index collect index associ list document weight term posit term inform document frequenc statist ad index speed queri process engin invert index quickli determin subset document term queri comput vector equat engin rank document similar queri present result user index search recal member commun distribut summari invert index bloom invert index rule directli challeng adapt algorithm inform peer adapt algorithm work break relev rank problem rank peer likelihood peer document relev decid number peer contact rank document peer node rank problem appli idea rank peer introduc measur call peer frequenc term comput number peer commun number peer document term lar idea metric term present index peer differenti peer queri note conveni comput bloom filter collect number bloom number hit term bloom filter definit relev measur rank simpli weight sum term queri peer weight term differenti peer set term repres bloom filter peer result relev peer queri scheme peer term queri highest rank peer subset term rank power term differenti peer potenti relev document select problem commun grow feasibl desir contact larg subset peer queri establish relev order peer decid contact address assum user specifi upper limit number document return queri simpl solut select problem contact peer order relev retriev ment section obviou approach lead terribl perform measur percentag relev document return reason poor perform peer return document return document highli relev queri stop immedi retriev larg subset retriev document relev queri illustr problem assum candid peer user accept document peer store highli rank document trace queri document number word collect size cacm med tabl characterist collect evalu search retriev capabl document low rank contact collect rank return user highli rank stop search relat document contact node return highli rank document low relev address introduc heurist adapt determin stop point relev order contact top bottom maintain relev order document idi stop contact peer document return sequenc peer fail contribut top rank document idea initi set document contact node chanc provid document contribut top high result number document collect section function size commun linear function commun size rang commun node document evalu search heurist turn assess perform adapt stop heurist implement measur perform accept recal defin relev doc present user total relev doc collect relev doc present user total doc present user queri post user captur fraction relev document search retriev identifi present user irrelev materi user find relev materi retriev relev document singl irrelev obtain recal current rank scheme achiev perform assess number benchmark collect human manual determin set document relev queri current algorithm provid tradeoff order find relev user amount irrelev materi assess perform compar achiev recal origin algorithm match confid search retriev capabl accuraci gossip bloom filter entir invert index addit recal examin averag number peer contact queri contact peer minim resourc usag queri studi number peer contact function number document user view size commun textual content compar link analysi googl web search engin collect queri tipster topic descript scienc technolog inform retriev system document identifi type inform retriev system relev document identifi inform retriev identifi compani person market identifi characterist system relev document identifi inform retriev identifi compani person market identifi characterist system inform retriev system queri med effect drug bone man specif effect bone sampl queri med collect note keyword section environ collect document queri human relev measur tabl present main characterist collect collect bucklei evalu smart collect small fragment text summari small size tract trec collect includ full press publish tabl show queri med collect measur recal built simul distribut document set virtual peer run evalu search retriev algorithm compar assum optimist implement peer commun full invert index word count run rank equat comput top rank document contact exact peer requir retriev document simul trace stop word remov stem elimin frequent word word root studi perform distribut document peer motiv studi uniform distribut document set peer present worst case distribut search retriev algorithm document relev queri spread larg number peer distribut search algorithm find peer contact motiv studi distribut measur current commun al found user commun share file rest studi commun repres futur commun base student access network creat commun share data user figur number file share user rutger network user sort amount file share softwar packag call direct connect resembl irc chat channel direct connect hub maintain list onlin user robot crawl user directori structur inform file share maintain hub queri user studi observ data distribut similar found al found user provid major file commun figur show number file share user observ global snapshot commun fit data distribut theoret extract paramet drive partit collect simul commun note smart commun node tion commun node account enc size search retriev evalu search retriev assum post user paramet maximum number document accept answer queri figur plot averag recal provid queri function med show result med collect smart collect save space result med collect refer reader web result tion make observ adapt stop track perform close perform slightli larger ks med ident recal larg slightli outperform perform differ interest outperform correct find lower rank document determin relev highli rank document return adapt stop heurist critic perform simpli stop retriev document recal shown curv recal improv high larg ks recal med figur plot perform singl commun peer med peer figur plot recal commun size studi scalabl show result collect small accommod wide rang commun size show perform variant stop function number function make observ recal remain constant commun size order peer fact adapt stop heurist function commun size critic adapt stop heurist account vari recal degrad commun size grow relev document spread peer commun size stop widen search contact peer number peer contact understand effect adapt stop present figur number node contact variant lower bound number node contact comput lower sort node number relev document document request document request document request document request figur averag recal med collect distribut peer averag recal collect distribut peer idf ad adapt stop heurist distribut document ad adapt stop heurist uniform distribut document stop immedi document retriev number node figur number relev document retriev function commun size variabl adapt stop heurist constant stop heurist function commun size plot obtain distribut ment collect store global knowledg human plot lowest number node relev document note lower bound number peer contact base provid human relev measur rank make observ adapt stop heurist critic recal node contact match contact peer larg ks inform assum contact peer dont highli rank document simpli stop retriev potenti relev document growth number peer contact contact peer lower bound relev judgment explain recal algorithm shown earlier med start contact significantli peer document request figur number peer contact request number document med collect distribut peer collect distribut peer idf ad adapt stop heurist ad adapt stop heurist stop immedi document retriev minimum number node contact retriev document relev judgment plot distribut document ad uniform distribut id recal improv rel outperform slightli med essenti equal impli equat strongli depend relationship linear work refin stop heurist reduc number peer contact larg degrad perform work harder uniform distribut relev spread commun actual observ distribut shape paramet work favor distribut search retriev engin note result uniform distribut compar studi studi uniform distribut distribut chang recal number peer contact adapt stop heurist work distribut relev document widen search document spread contract search document concentr studi effect make adapt stop heurist function commun figur plot number node contact commun size collect adapt stop heurist adapt commun size adapt commun size import maintain constant recal lo ad variabl ad constant number node figur number peer contact function commun size constant variabl adapt stop heurist constant stop heurist function commun size plot obtain distribut document collect niti size figur show adapt commun stop heurist throttl number peer contact quickli commun number node contact drop result lower recal shown overlap tabl amount overlap document return amount result result obtain med collect retriev similar document conclud studi search retriev algorithm modifi rule find set document tabl averag intersect set relev document return return queri med collect show intersect low recal high intersect approach observ low intersect close indic find essenti set relev document confid adapt chang essenti idea rank relat work current applic napster support document search retriev system tremend search limit system reli heavi replic lar item success commun built limit share music video file goal power user locat inform commun tightli collect scientif legal inventori differ led design implement content search retriev present paper st exist recent research effort seek provid global hash tabl share member commun framework tapestri chord techniqu spread pair commun rout queri member data store distribut hash structur creat invert effici approach time cost contact node order publish singl kei share document content publish uniqu word time linear document size publish kei bloom filter contact node inform gossip bandwidth framework infrastructur implement rank rank algorithm adapt relat cori gloss address problem select rank fusion distribut collect recent studi french al show scale node base rank reli similar collect statist gloss document node term local weight term node cori case amount inform rank node significantli smaller global invert index gloss space global index paradigm gloss cori similar server hierarchi user decid peer contact empow peer work autonom distribut bloom filter wide answer queri presenc network node failur order accommod peer scarc minim inform share mainten cost propag term frequenc toler posit commun data characterist effici data trade space posit appendix show peer store total inform share final search mechan client rout queri data sourc similar select implement model peer provid content give sketch queri answer hub client find node suitabl question unlik peer rank result search contact relev node queri comput potenti power model inform share ad hoc commun user user leverag exist desktop comput requir special server resourc adapt scale commun size member contribut addit resourc join commun commun grow locat inform distribut larg number peer problemat present rank algorithm content search retriev thesi search small set relev term locat ral locat document demonstr success web search engin search retriev algorithm successfulli locat inform user search present unrel inform chose adapt document rank instanti rank rule naiv applic requir peer commun access invert index entir commun costli term bandwidth storag show approxim compact summari bloom peer invert index make show rule adapt index provid heurist adapt determin set peer contact shown algorithm track perform document distribut commun algorithm preserv main flavor return set document queri good search retriev algorithm make easier commun share larg amount inform refer bloom hash code error commun brin page anatomi hypertextu web search engin comput network isdn bucklei implement smart inform retriev system technic report cornel jp croft search tribut collect infer network annual intern acm sigir confer research develop inform page hong distribut anonym inform storag retriev system workshop design issu anonym page fm nguyen infrastructur support inform share technic report depart comput rutger nov terri epidem algorithm replic mainten sixth annual acm symposium principl distribut page direct connect mou compar perform select algorithm research develop inform page dk jr semant file system acm symposium oper system effect gloss text discoveri problem acm sigmod page resourc discoveri distribut network symposium principl distribut page harman overview trec confer annual cm sigir confer research develop inform dr consist hash random distribut cach protocol reliev hot spot world wide web acm symposium theori page zhao architectur persist storag acm napster napster editor har power disrupt technolog oreilli inform share altern ieee shenker scalabl content address network acm sigcomm se robertson jone relev weight search term journal american societi inform volum page druschel distribut object locat rout system intern confer distribut system platform yang vector space model inform retriev journal american societi inform volum page gribbl studi file share system multimedia comput network balakrishnan scalabl lookup servic internet applic acm sigcomm distribut search tribut network sun bell manag compress index document imag morgan san yang effici search network intern confer distribut comput system juli joseph infrastructur locat rout technic report appendix memori usag present estim amount memori member track commun content note memori usag depend bloom filter size number peer commun calcul chosen bloom filter store peer set term posit spread collect commun peer receiv averag term scenario filter store singl peer mean commun summar memori node exchang filter compress bandwidth requir singl node gather remain filter tabl show result obtain commun size calcul present peer memori collect size amount memori node store bloom filter summar commun
ML/278 6 project rotat appli stereo head andrea horaud inria avenu de franc abstract consist weakli calibr stereo rig mount mechan call kinemat camera calibr requir lie group project space pure rotat origin formal model geometri system alik formula minim project rotat introduc base practic part numer optim techniqu accur estim project rotat point procedur recov suffici geometri oper system experi valid evalu approach real imag data show weak imag home head introduct sensor comput vision pan tilt stereo head sensor camera pair mount pan tilt mechan activ sensor prove number applic includ track move visual control crucial stereo head move control consist close loop camera observ action pan tilt motor close loop impli model activ stereo head includ pure geometr model camera pair configur direct kinemat model mechan camera mount project model exist camera mechan classic model euclidean transform project inform recov weakli calibr stereo camera pair convert euclidean inform paper introduc approach mathemat framework repres geometri mechan project space concept project displac project transform rigid introduc show repres pan tilt stereo head case project rotat pure rotat motion consid section project rotat project formula describ interest properti reveal lie group structur project rotat section address problem estim project rotat practic introduc linear method estim transform imag observ section describ experi includ complet stereo feedforward predict object track home experi final section direct futur work notat boldfac type bold ital type type roman type angl vector column row vector written coeffici index usual equal scale denot preliminari calibr stereo rig model camera rigidli link point euclidean space project point left project imag plane solut project constraint yield euclidean reconstruct rel euclidean camera frame jk weakli calibr stereo rig model pair camera epipolar geometri estim point correspond project matric project reconstruct solv rel project camera frame defin thought stereo rig stereo rig intern geometri constant link upgrad project reconstruct euclidean encapsul geometri stereo left paramet plane infin calcul amount calibr system rig undergo rigid motion convinc write fl pe algebra similar displac group form group refer project displac class project rotat model motion system rel project frame stereo head mechan consist pan joint angl serial link tilt joint angl oe chain defin oe reset oe oe weakli calibr stereo camera rigidli mount standard camera frame project frame rigidli move camera euclidean project coordin static point frame function joint inerti frame correspondingli defin coincid defin point relat attach move frame posit figur stereo kinemat model transform project reconstruct function joint angl link method method model mechan geometri rel inerti frame mean displac repres revolut pan tilt joint joint rel move frame reflect order revolut multipli forward kinemat switch euclidean project coordin substitut obtain correspond motion system pe pe manag write equat obtain pure project model system camera free euclidean frame respect metric measur call forward kinemat directli write product element class project rotat hr section model pan tilt revolut system exponenti calcul forward kinemat explicit function joint angl assum tangent oper pan tilt motion amount weak calibr mechan calcul singl pan tilt motion accur optim theori project rotat show assumpt laid section class subgroup project displac model project kinemat revolut joint subgroup turn cite definit project rotat act correspond pure rotat tr act transform algebra similar scale fl fl pe tr normal project rotat hr det fl angl obei tr hr jordan normal form pure rotat eigenvalu pair sin doubl real jordan matrix rotat block sin sin order jordan matrix jr jr sin sin hr jr canon permut block arrang rigid rotat decomposit ambigu ambigu commut cr jr cr complet famili jordan decomposit hr jr proposit project rotat project transform conjug pure rotat describ transform hr sin hr refer formula project equal solut matrix exponenti hr exp hr refer form project uniqu eq hr denot row column rememb ffi ij hr sin sin sin introduc rank matrix hr show hr induct hr substitut prove part part shown collect odd power exponenti seri hr hr substitut power seri sin uniqu squar ca ambigu propag hr commut matric ca ja prove hr part hr lie group properti group hr fix manifold hr tangent oper small group element vicin ident lim hr lim sin hr hr note scale ambigu limit defin fix famili straightforward hr form lie group isomorph hr linear lie algebra exponenti map lie algebra lie group map group algebra directli calcul rotat axi calcul hr sin easili verifi thought matrix logarithm log hr estim project rotat show accur estim tangent oper hr observ project rotat hr joint angl imag goal weakli mechan pan tilt motion observ stereo head object function instanc project pan rotat hr respect angl stereo head move oper pan joint interest point match imag project reconstruct transform backproject total error sequenc minim vector local minim hr min exp exp error measur suitabl chosen imag euclidean distanc pixel extract backproject point vector gener stand set match point reconstruct minim definit project rotat introduc paramet plane infin pure rotat tr singl plane infin fulli defin subset intern paramet calibr respect constraint order paramet suitabl vector express hr depend vector paramet initi famili solut introduc squar order resolv fix set constraint ensur domin element diagon good numer condit form good initi suffici monitor minim paramet elimin bilinear constraint hr depend vector paramet initi jordan decomposit initi guess tangent oper hr calcul rank svd yield guess polar decomposit hr left eigenvector eigenvalu recombin matrix order obtain form experi stereo head consist baselin mount robot revolut ax robot repres mechan repeat encod read joint angl differ real imag data show small model mountain tilt distanc respect extract harri track match refin accuraci interpol accuraci theoret error track notic drift point featur correl concaten sequenti calibr calibr separ step time step time driven imag sequenc show mountain move imag horizont pan vertic tilt path length subset step interest point establish calibr system mean estim approach section result evalu step point calibr order elimin reconstruct step transform estim model backproject imag evalu backproject extract point differ euclidean distanc imag result show estim accur tabl predict predict mountain observ gener posit calibr trajectori joint move pair establish weak calibr predict point imag pair joint angl reconstruct imag pair figur calibr imag show mountain model point trajectori pan tilt miss step calibr mark backproject mark actual extract point predict point evalu extract point result show predict error tabl practic applic predict trajectori avoid target home home stereo imag singl reconstruct point defin home posit kinemat unknown configur head current imag refer left left figur calibr histogram calibr error distribut estim histogram imag distanc left imag show equal error distribut accord assum addit gaussian ment move head home amount solv kinemat map constraint error object function minim paramet result evalu measur home imag result present figur show singl point suffici home head figur predict differ distanc predict extract point tabl imag error calibr column left show result calibr experi row give valu standard deviat error measur valu pixel figur visual home singl error trial practic applic visual reset system visual measur visual target track mechan summari present origin approach model geometri mechan rel weakli calibr mount top contrast exist method stereo method avoid difficult metric calibr prove highli accur real imag data calibr build fulli oper system surveil target track applic mathemat formal model kinemat chain project rotat sound complet extend directli robot arm futur work concentr approach calibr control gener robot visual servo approach refer robot manipul product exponenti formula proc int page der volum bg stuttgart horaud solut euclidean calibr stereo rig proc volum page horaud presenc critic motion proc faugera project euclidean reconstruct proc ieee conf page san june faugera comput geometr viewpoint mit hartlei euclidean reconstruct uncalibr view applic invari comput page springer berlin hartlei defenc algorithm proc page june ieee comput societi press cipolla uncalibr stereo coordin imag vision march horaud euclidean reconstruct motion stereo rig proc page ieee comput societi januari horn johnson matrix analysi cambridg nelson model manipul robot hand proc volum page april canon geometri multipl project view comput vision imag septemb mccarthi introduct theoret kinemat mit fundament manipul calibr john wilei horaud project translat affin stereo calibr proc ieee conf page ieee comput societi june geometr method robot reid metric calibr stereo rig proc ieee workshop visual page june
Agents/279 1 cooper mobil agent dynam network rout nelson minar kramer patti mae mit media cambridg ma usa introduct contemporari comput network singl network consist kind processor commun channel network inher capabl scatter system system design methodolog embrac acknowledg complex method approach requir network administ util full potenti research mit media laboratori build system mobil softwar agent manag complex network chapter describ strategi collect cooper mobil agent solv rout problem network inform network continu complex import devic connect comput desktop comput cellular web server box smoke detector connect network topolog necessarili dynam devic move place maintain intermitt chang relationship network peer fly network flexibl devic commun varieti wai varieti substrat physic link widespread includ cellular analog modem problem configur dynam heterogen network difficult level research domain face hard problem packet servic infrastructur secur convent central approach network manag unabl serv mutabl collect comput rout tabl convent network gener central manner paper present contrast peer peer network rout task perform decentr distribut fashion mobil softwar agent cooper accumul distribut connect inform agent determin system topolog explor store inform node network agent store inform deriv rout network studi algorithm simul popul mobil agent manag network nelson patti mae manag network popul mobil agent import decentr complex network requir decentr manag structur aggreg control inher central system make difficult network scale upward size central manag tool restrict import node special node perform bottleneck requir serv number client failur control node node commun pose difficulti particip central manag network similar design central architectur readili adapt network usag difficult design scale central network resid small number special devic network capabl limit rang behavior devic behavior adjust chang circumst structur packet imposs fundament incompat central design framework inher distribut network cellular telephon system serv good node network servic requir topolog connect local relationship node highli fluid current cellular network ignor complex commun manag static grid monolith server contemporari cellular system highli central interest dynam cellular system revolv behavior individu overhead system concentr cell tower exterior phone cellular system offer limit rang remain scale coverag area devic make poor bandwidth suggest model network decentr approach manag network central infrastructur manag popul mobil softwar agent maintain rout inform dynam network approach push intellig central control node network emb intellig adapt softwar framework mobil agent mobil agent build distribut softwar system tradit distribut system built stationari program pass data back network mobil program move node comput attend data mobil agent work defin import agent encapsul thread execut bundl code data agent run independ programmat preserv state move network node defin agent move easili network underli infrastructur primit agent call move neighbor node agent small size cost host transport agent design minim simpl agent serv build block complex aggreg behavior agent cooper agent order perform complex dynam task agent read write share block memori facil coordin agent execut node leav inform subsequ visitor agent identifi resourc specif node find simul present node differenti neighbor agent make heterogen node access kind inform absolut locat deriv global posit system receiv agent leverag flexibl system mobil agent build block design network architectur flexibl wai fundament distribut natur collect architectur scale upward size gracefulli agent popul chang usag context model accommod system interact mediat multipl network manag strategi coexist network size mobil agent serv simpl distribut build block construct function design system small number simpl agent interact agent pattern interact agent remain stabl block kind ad develop design heurist applic mobil agent system goal research specif rule thumb hypothesi system emerg research explicit local interact make network system easier understand reduc elimin perform bottleneck common point failur individu agent model simpl interact restrict local nelson patti mae manipul share memori simplic build block make easi conceptu system larg number agent work network node analysi scalabl main focu experi present observ system design local commun model stabl design framework worth note common organ larg network system partit hierarchi smaller approach thought structur commun larg number overlap sphere discret partit usag model difficult design convent network adjust chang usag pattern short time scale evolv circumst long mobil agent base system reconfigur situat human behavior increment alter vari size composit agent ad agent dynam reinforc weak balanc prioriti human manag adjust agent adapt chang circumst agent dy spawn copi situat dictat specif set agent deleg monitor aspect alter mix agent drastic patch secur hole roll featur accomplish flush system flood popul agent popul network agent dedic maintain rout connect inform special distinct agent special regard usag pattern network manag agent enact econom incent encourag traffic pattern specif agent dedic maintain amount bandwidth special agent work manag requir specif area network part lan great deal video traffic deploi agent construct maintain high bandwidth connect agent adapt network infrastructur chang time cost gatewai reduc handl traffic time peak popul weight rout agent connect inform explicitli construct connect agent special behalf specif user individu pretti good idea commun carri collect agent optim negoti creat person connect network manag exampl manag model integr elegantli system built mobil agent appli simpl econom metric agent movement inform exchang enabl commun decentr framework kind commun restrict account accur agent tool make finit resourc rout optim traffic network metaphor pheromon social insect chapter flexibl mobil agent architectur multipl model messag agent rout inform manag owner messag bill owner manag ecolog cognit tool system design worth separ pure technic advantag system built mobil agent cognit leverag mobil agent metaphor provid design programm attribut notabl extrem flexibl architectur stand advanc system capabl attribut argument system design system design network find abstract wai import mobil discret piec code function power tool write program network comput mobil agent approach thought metaphor extens objectori engin design network system compon softwar tool develop complex desktop applic mobil agent encapsul data unfold thread execut small packag encapsul system design creat build block network build block find wai system behavior embrac network usag pattern user nelson patti mae relat work mobil agent activ excit research contemporari tool java make mobil agent system simpl implement number gener argument exist mobil agent approach potenti research perform enhanc resourc interest possibl mobil agent architectur lie adapt natur inher flexibl work appli mobil agent system infrastructur place umbrella activ network work close relat activ network share concern dynam characterist network system desir explor possibl movabl bit code network context simpl messag agent behav activ comput resourc success node find rout thread research mobil agent situat telecommun network manag connect load balanc work earli paper suggest mobil agent strategi dynam telecommun network work design inspir ant behavior extend idea marker network environ mean indirect commun mobil potenti disadvantag design network mobil softwar agent note short list blueprint futur research set insurmount obstacl effici comput cycl network bandwidth preciou messag rout consum comput resourc packet manag infrastructur agent consum share bandwidth difficult justifi newer approach costli contemporari engin approach difficulti deal dynam network appar network increasingli complex heterogen larg determin architectur deal broad rang demand mobil agent approach offer rich set tool design time great flexibl situ lifetim stack deck favor implement maintain face difficult task engin dynam network network effici set tradeoff finit resourc comput time fallen price rapidli connect time common trade cpu cycl bandwidth compress data send network decompress receipt architectur packet rout current network widespread moment cheapli silicon continu benefit messag agent outweigh diminish rel cost mobil manag infrastructur agent good job maintain dynam connect wireless system prove effici central system wast amount bandwidth order provid level servic infrastructur agent thought harvest simpli consum secur move bit execut code comput comput number question secur concern build secur work understand secur network mobil agent present broad class secur protect host protect agent protect agent problem protect host agent attract attent research standard cryptograph techniqu code combin model secur present java suffici design execut environ protect comput host problem mobil agent secur protect agent host enjoi attent activ involv research protect agent extend exist host secur model grow bodi research protect agent host execut encrypt code constitut open area progress made scenario avoid secur problem carefulli delin trust terrain network worth note fundament difficulti face inform secur inher spread open network advantag access network gener outweigh deal question protect malici attack matter kind system design provabl concern approach build network behavior collect cooper agent difficult model result difficult reason determinist call import contemporari softwar product life typic build system unpredict note extrem difficult reason realworld network matter network comput nelson patti mae irreduc particip network potenti patholog imposs reason provabl behavior system mobil agent framework develop aid reason robust addit impedi analysi remaind chapter present result obtain simul mobil agent popul peer peer network result support content mobil agent manag network provid analysi solut import network manag maintain connect rout map model experi defin simpl model dynam wireless network implement simul studi model model motiv realworld wireless network design media consist larg number node scatter build node vari great deal respect comput capabl usag wearabl sensor attach desktop simpli provid inform peer share characterist order reduc power consumpt maxim singl channel limit commun mean messag intend recipi vicin requir multipl hop reach destin simul describ simplifi compar hardwar implement network model realist provid guidanc design real experi gener applic dynam decentr network chapter extend previou set experi mobil agent popul perform report model present complex present earlier expect directli appli lesson set experi construct real rf network node result present deriv simul peer peer network chose scenario consist relat work colleagu media lab node system conceiv transceiv distribut space simul total network diamet roughli node cooper peer peer fashion rout packet network averag packet system requir multipl hop travel sourc resid mobil agent move network order effect gather data system individu node move slowli simul random radio link form break node move rang network topolog dynam physic link easili detect node neighbor node system simpl rout tabl node list rout inform node tabl store node send packet rout packet arbitrari messag lookup current node move neighbor repeat import note rout tabl updat node node complet reli mobil agent updat tabl chose network densiti match estim capabl rf found futur person accessori part home wireless network network size chosen larg feasibl data node experi perform configur movement path node snapshot node placement typic time present figur figur snapshot simul network nelson patti mae agent system node run program simpli host agent provid place store rout inform mobil agent embodi move node node updat rout inform rout agent explor updat node visit learn travel rout agent discov edg network rout agent histori agent land node inform histori updat rout tabl host rout write rout agent node tabl agent memori histori inform baselin entri agent carri histori size histori window import longer higher overhead move agent experi investig tradeoff histori size system perform system reli cooper behavior popul agent popul size import rout higher overhead agent popul dont commun directli algorithm present dont read inform node rout tabl write make base person histori case random system perform depend behavior individu rout agent blind subject cooper treat previou paper describ system return work futur experi model implement discret base simul step simul time agent thing agent neighbor node make agent move learn edg travel updat rout tabl node recent knowledg network test algorithm agent move algorithm agent simpli move randomli chosen reachabl node opportun agent base comparison direct algorithm test agent preferenti visit adjac node visit longest ago doesnt rememb agent histori avoid backtrack perform task effici repeat work measur simul system consist line java code implement discret event graphic simul object network node mobil agent repeatedli run simul paramet measur system perform agent algorithm vari histori popul size measur system perform averag connect network converg behavior number calcul design node special node wireless node wire larger local lan internet link measur connect count fraction node system valid rout gatewai measur reason aggreg connect model node access world run iter time step paramet simul converg behavior time measur perform averag fraction connect node time report maximum minimum connect observ time period order convei idea stabil system factor random initi placement report number averag set run paramet set experi conduct initi node placement node movement summari result print detail descript analysi perform system time question investig connect network chang singl simul examin baselin system oldest node agent histori length measur connect node time step time seri figur show heavi line averag time seri grei line randomli select set individu run reader system start initi condit knowledg network quickli gain connect agent move collect inform small time result major chang graph agent quickli work rise connect time end simul time connect fluctuat network agent adjust rout tabl defin converg point measur time time seri connect flatten run connect time calcul roughli characterist perform system consist nelson patti mae simul time connect connect system time oldest node histori size individu run averag run figur histori size averag connect remain time perform interv system repres time seri data gener run start quickli climb characterist remain end run rest chapter report simpli final connect maximum minimum connect valu regist converg result experi demonstr basic popul agent maintain reason rate connect simul network popul maintain connect rate reason stabil system converg fluctuat connect larg swing analysi agent algorithm paramet basic framework analyz behavior system explor effect choic system paramet perform alter main variabl number histori size type rout agent oldest vari histori window size connect connect histori size popul size agent point averag connect interv maximum minimum connect popul size connect connect popul size histori size hop oldest node agent random agent figur result baselin agent histori size result present figur agent type appar result effect agent type perform system graph paramet oldest node agent perform random agent oldest node agent search network effect minim interest random agent agent expect baselin agent histori size averag connect agent system averag connect random agent gain perform random agent prefer network situat random algorithm reduc comput load node system load import depend varieti quickli network topolog underneath agent algorithm make care choic visit rel random choic link node longer agent believ histori size paramet studi effect agent histori size system perform read histori graph figur left type algorithm histori agent longer provid data node case oldest node oper effici perform improv diminish histori size grow bigger agent longer memori point memori date redund multipl agent larger histori size high nelson patti mae time connect oldest node vari histori time connect oldest node vari popul time connect random vari histori time connect random vari popul figur spread maximum minimum connect ad memori agent make system perform effect stabil movement node explain characterist long agent memori inform remain valid time step system recov larg topolog popul size effect popul size system perform histori found agent result larger popul mean agent rout histori gain ad agent declin popul size agent begin duplic work agent narrow spread maximum minimum agent lend stabil network distribut workload network reduc time inform rout propag outward summari basic system analysi view data present time seri graph figur graph repres effect chang variabl histori size popul hold popul size histori fix time seri data confirm summari present larger popul agent larger memori perform oldest node agent random agent seri experi confirm basic expect model analysi overhead agent establish basi determin optimum paramet kind remain overhead analysi result present valid basic bit agent memori expect real attribut cost agent memori agent overhead network support rout agent popul analysi account agent overhead measur system perform order overhead characterist agent make rough estim cost transmit agent node bit time stamp bit hop count bit node agent rememb bit data histori tabl cost agent histori size estim cost send agent roughli bit bit cover digit signatur agent bit data agent owner agent bookkeep data size agent code factor homogen system cach agent code open system agent agent code size import estim overhead system defin equat import note valu constraint arbitrari gener form overhead measur simpl linear function domin product number agent histori size overhead calcul compar system equal overhead overhead entir popul agent histori paramet set produc system agent histori size overhead system agent histori size fix overhead cost optim tradeoff number agent histori figur show perform system oldest node agent vari set constant overhead graph show system agent histori size optim argu specif depend paramet chose world result suggest perform similar algorithm characterist system nelson patti mae popul size histori size fraction node rout gatewai averag connect oldest node agent vari histori size popul size constant overhead interv repres max min point averag figur result show kind system strike balanc larg number agent agent carri larg amount data put agent system unaccept perform bit give individu agent shorter memori impli rout dynam decentr approach great individu autonom agent effect solut smart agent futur work chapter present approach manag servic dynam network network chosen consist larg number node system poorli serv central architectur attempt show popul cooper softwar agent build maintain rout tabl tabl remain accur topolog network time gener framework design manag network framework base idea ecolog mobil agent live insid serv servic infrastructur approach inher decentr manag network inher decentr borrow languag electr system softwar result design theori aesthet conceptu significantli flexibl work part broader research program develop infrastructur heterogen network begin understand possibl implic system built mobil code work remain import provis secur safeti tool model method analysi resourc system overhead protocol strength framework network devic seri experi studi design specialti agent manag rout task number paramet held constant system present speed node densiti size assumpt link reliabl incorpor variabl complex realism give pictur demand network possibl mobil code approach process build implement rf network model order appli lesson learn test safe confin simul nelson patti mae bibliographi softwar agent control telecommun network bt technolog vol april chapter book mario al code mobil decentr flexibl network manag intern workshop mobil april mole bonabeau al telecommun network agent santa fe institut public submit intellig agent telecommun applic di agent adapt rout hawaii intern confer januari al good mobil object programm volum lectur note comput scienc comput system approach isbn al distribut comput faulti process journal acm al system cooper manag intern confer exhibit practic applic intellig agent page london resourc alloc rout telecommun network intellig agent telecommun applic mobil code distribut system phd comput june perform cooper process physica al mobil agent map network hungarian confer agent base comput java secur isbn mobil design principl practic wireless commun seri isbn wireless network master mit media rule encount isbn al load balanc telecommun network adapt agent commun network social insect paradigm chapter book somer agent network manag intern confer exhibit practic applic intellig agent page london negoti distribut artifici volum isbn al survei activ network research ieee commun januari mobil agent malici host mobil agent secur note comput isbn mobil agent softwar agent isbn
DB/280 3 optim techniqu queri method joseph hellerstein uc berkelei manag system knowledg user defin data method type flexibl produc attend handl wai manag system effici paper studi techniqu optim queri method focu tradit queri optim choic join method select handl rule rule appli select arbitrari order join assumpt select time user system emb complex method select select amount queri optim model enhanc carefulli defin queri cost framework incorpor select cost estim select algorithm call predic prove produc optim plan queri method describ implement predic migrat discuss practic issu affect earlier assumpt compar predic migrat varieti simpler optim demonstr predic migrat gener solut date altern techniqu present constrain workload categori subject process gener queri method addit kei word predic predic placement preliminari version work intern confer manag work fund part nation scienc foundat graduat fellowship recommend express public author necessarili reflect view nation scienc foundat work fund nsf grant preliminari articl accept acm transact system definit version product acm version author current eec comput scienc soda hall acm copyright copyright associ comput permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit direct commerci advantag copi show notic page initi screen displai full citat copyright compon work acm honor abstract credit permit copi post redistribut compon work requir prior specif permiss fee permiss request public acm ny fax jm hellerstein open major theme research year introduct extens manag system relat dbmss begun simpl data type function util queri dbmss begun offer queri declar access object method access imper applic dbmss develop unifi supposedli distinct approach data manag inform kim origin research area enabl system languag design make dbm support extens data type method research explor problem make function effici paper address basic effici problem extens system explor techniqu effici effect optim declar queri method queri natur modern extens design support declar queri type method note method natur complex data larg object encod complex inform order effici process queri techniqu handl method gi illustr issu process queri satellit imag data present sequoia benchmark geograph inform system al queri retriev digit imag select imag time period observ show level veget select raster method read megabyt raster imag data visual data count percentag pixel characterist veget characterist comput pixel standard techniqu remot method thousand instruct oper comput clear queri run faster select appli minim number call tradit optim order select optim techniqu queri method appli select addit logic ad optim ensur select appli judici order select order correctli order select suffici solv gener optim problem place predic queri execut plan join raster tabl tabl note select note clifford optim plan queri appli select perform join raster note call consid benefici earli select lower complex join consid trivial check cost evalu select predic outweigh benefit gain select join case predic wrong techniqu postpon select comput join raster note gener clear join select interleav optim execut clear migrat select effect join order method plan explor queri optim problem theoret point experi produc implement illustra dbm benefit subqueri import note method exist dbmss current relat industri sql ansi long support predic method subqueri predic subqueri predic form express oper queri evalu predic requir execut arbitrari queri scan result match oper arbitrarili depend complex size subqueri subqueri predic convert join subject tradit optim execut sophist sql rewrit system al seshadri al seshadri al convert subqueri join forc comput subqueri order evalu predic treat method work present paper applic major todai product support sql subqueri intellig place subqueri predic queri plan jm hellerstein outlin chapter present theoret underpin predic algorithm optim place predic queri plan chapter discuss simpler altern predic perform queri illustra demonstr situat techniqu work chapter discuss relat work research literatur conclud remark direct futur research chapter environ experi paper examin behavior algorithm analysi experi experi present paper run commerci dbm illustra develop version illustra similar publicli version illustra run default except set produc trace queri plan execut time machin sun sparcstat processor megabyt run suno seagat scsi disk hold binari illustra store ident seagat scsi illustra log store seagat scsi disk megabyt swap space alloc seagat scsi disk due restrict illustra inform perform number present paper rel graph scale lowest data point commerci system typic agreement prohibit perform number unusu vendor permit public perform result rel al scale result paper affect drawn base rel perform approach theoret basi gener clear join select interleav optim execut clear migrat select effect join order method plan section describ prove correct predic migrat produc optim queri plan queri predic predic migrat queri optim addit cost factor polynomi number oper queri plan compar favor exponenti join scheme standard queri easili circumv optim queri predic predic found techniqu section invok queri gain execut speed offset extra optim time implement predic migrat integr illustra standard system optim al modest overhead optim optim techniqu queri method predic migrat reduc execut time practic queri order magnitud illustr optim estim develop enhanc tradit model analyz queri plan cost involv modif usual metric select relat oper preliminari discuss model prove critic analysi relat queri languag sql arbitrari boolean express constant rang variabl queri break maxim set al refer boolean factor distinct satisfi result tupl queri term refer boolean factor queri join predic refer multipl select predic refer singl tabl select tradit queri optim comput select join select predic estim typic estim base default valu statist store dbm al recent work suggest sampl techniqu al hou al haa al accur select estim difficult problem queri gener interest recent year faloutso kamel ioannidi poosala poosala al poosala ioannidi select estim method control flag creat function command inform paper make standard assumpt queri optim estim accur predic independ select differenti cost method extens system arbitrari method introduc select join predic method written gener program languag queri sql section discuss handl queri languag method subqueri section method written gener languag difficult correctli estim cost predic initi illustra includ syntax repeat applic collect perform statist techniqu make estim method behavior al jm hellerstein flag descript cpu execut time argument size cpu execut time byte argument byte pct percentag argument byte method access tabl method paramet illustra give user control optim estim cost select userdefin method introduc method user write method compil issu illustra sql creat function regist method system captur optim creat function statement accept number special summar tabl cost evalu predic singl tupl illustra comput ad cost method predic express illustra predic tupl defin cost method constant tupl variabl comput argument byte expect size argument access cost cost retriev data comput method note method reflect cost evalu method singl cost evalu tupl relat metric natur method natur predic relat input predic cost typic express function cardin input cost predic thought differenti cost predic relat process time result cardin input relat deriv cost predic respect cardin input differenti cost queri languag method sql varieti subqueri predic form express oper queri predic requir comput arbitrari sql queri evalu simpl uncorrel subqueri refer queri block higher nest correl subqueri refer tupl variabl higher nest level cost check uncorrel subqueri select cost comput materi subqueri cost scan subqueri result tupl differenti cost uncorrel subqueri cost initi materi uncorrel subqueri paid subqueri locat ignor overhead comput materi cost optim techniqu queri method correl subqueri recomput tupl check subqueri differenti cost correl subqueri ignor scan repres separ cost illustra method written essenti correl subqueri cost estim present queri languag method form simpl model issu set cost subqueri cost subqueri predic lower transform subqueri predic al stop materi scan subqueri predic resolv incorpor scheme scope includ framework section requir care estim differenti subqueri cost estim join subsequ treat join select uniformli order optim balanc cost benefit order measur join tupl join estim differenti cost join respect input join algorithm outer relat relat cost function jrj jsj number tupl comput differenti cost join respect outer relat differenti cost join respect relat section partial differenti constant join cost join tupl input typic defin independ cardin input select join respect input tradit select estim al comput select join relat expect number tupl output number tupl cartesian product input jo sj jo select join respect deriv tradit size output join rel size jo jsj select respect deriv similarli jo jrj note queri multipl join predic set relat execut plan predic process call primari join predic merg hash index join primari join predic implicit process join predic applic process join select refer secondari join predic secondari join predic essenti select treat predic reorder pull higher join select predic secondari join predic remain primari join secondari join predic imposs evalu join index essenti cartesian product jm hellerstein optim plan queri predic task correctli optim queri predic exceedingli complex tradit queri optim search plan space exponenti number relat multipli plan space number permut select predic make tradit plan techniqu prohibit section prove reassur result queri select predic optim interleav base simpl sort algorithm result previou enhanc tradit join plan techniqu interleav predic plan appropri interleav time polynomi number oper plan optim predic order tabl access begin discuss simpl case queri singl tabl queri arbitrari number select complic boolean function tabl rang possibl subqueri method task order predic minim appli tupl relat scan access path queri index predic match index satisfi scan appli predic essenti indic retriev tupl qualifi repres subsequ predic pn subscript predic repres place order predic appli tupl base tabl repres predic select assum independ distinct cost appli predic output scan tupl pn lemma demonstr cost minim simpl sort predic analog fault detect problem address sidnei sidnei lemma cost appli select predic set tupl minim appli predic ascend order metric rank select differenti cost predic join consid primari join pull join predic consid essenti join method pull plan index tabl method valu tabl attribut stein lynch stonebrak scan predic method satisfi scan invok method predic consid method optim techniqu queri method plan select scan scan raster raster select select select rank rank rank rank plan fig execut plan queri plan optim time execut time cpu cpu plan sec sec min sec min sec plan sec sec min sec min sec tabl perform plan singl tabl predic optim order simpli sort rank swap posit predic equal rank effect cost sequenc effect reorder return introduct ran queri illustra gener plan figur gener plan figur expect lemma plan higher cost correctli order rank optim execut time measur illustr tabl correctli order select improv queri execut time order simpl queri predic relat predic place select join previou establish optim order select explor issu order select join eventu appli optim plan produc typic queri model fix join minim plan cost constraint chang order join section develop algorithm optim place select secondari join predic join plan section show effici integr algorithm tradit optim plan chosen space join join select placement definit thrust section handl join predic order scheme handl select particip order base rank definit plan tree tree leav scan intern node join select tupl produc scan node flow jm hellerstein upward edg plan tree optim scheme constrain plan tree scan child join method requir limit definit stream plan tree path leaf node root figur illustr plan plan stream outlin framework singl join node simpli number input treat ident fashion input join definit section comput differenti cost join select rank join stream estim requir assumpt join cost select revisit section assum cost select estim accur analysi prove assum node distinct rank make prove swap node equal rank effect cost plan lemma swap posit node effect cost plan tree achiev uniqu order rank assign uniqu id number node tree order node pair introduc id make simplifi assumpt rank uniqu move select plan push select locat select evalu notion captur definit plan stream semant incorrect predic stream refer attribut predic input semant correct plan tree semant incorrect semant incorrect semant correct tree render semant incorrect push secondari join predic primari pull select input stream push join input stream care rule possibl subsequ identifi plan tree locat select secondari join predic formal definit plan tree set biject stream stream stream join node order common subexpress disallow plan dag gener graph optim techniqu queri method predic migrat optim plan tree optim stream approach optim plan tree treat stream sort node stream base rank sort stream gener plan tree simpl sort select tabl order node stream constrain wai reorder join handl separ predic migrat ensur stream remain semant correct constraint preclud option simpli order stream ascend predic constrain predic find optim order predic stream subject constraint sidnei sidnei shown find optim order singl stream kind constraint fairli simpli analysi base kei set plan node group job job modul defin subset node element constraint relationship respect node optim order job modul form subset optim order entir stream job modul fp constrain optim order directli predic sidnei principl develop algorithm parallel log algorithm optim arbitrarili constrain stream algorithm repeatedli isol job modul optim job modul result order job modul find total order stream version algorithm subroutin optim predic migrat optim plan push predic repeatedli appli algorithm parallel chain sidnei stream progress made predic migrat algorithm figur provid explan algorithm constraint plan tree gener version sidnei algorithm parallel chain simplifi function predic migrat push predic typic automat system optim rest predic migrat made nest loop outer loop ensur algorithm termin progress made stream optim loop cycl stream plan appli simpl version sidnei algorithm parallel chain jm hellerstein optim locat select queri plan tree push predic stream progress sidnei algorithm join node top node constrain follow constrain node form job modul node constrain follow stream job modul discard constraint introduc sidnei parallel chain algorithm chain modul form chain node form group modul arent sort group sort node modul group result order reflect optim modul introduc constraint preserv result find adjac group constrain merg initi node chain group adjac group arent order ascend group form group ab fig predic migrat algorithm optim techniqu queri method seri parallel routin stream top repeatedli find modul stream optim call parallel chain order node modul optim parallel chain find optim order introduc constraint maintain order chain node seri parallel parallel chain subroutin convert top chain lowest join node stream handl parallel result stream chain node possibl set unconstrain select bottom entir stream job parallel chain call optim stream singl order version parallel chain algorithm expect input set node partit node constrain form node unconstrain rel node entir set note stream top seri parallel correct input parallel chain parallel chain routin find group node chain constrain order suboptim descend shown sidnei sidnei optim order node node consid group find group routin identifi group node group modul sort rank group result total order modul preserv chain introduc extra constraint extra constraint discard entir stream complet order predic migrat leav tree stream order algorithm parallel chain interest reader refer sidnei justif algorithm parallel chain optim order stream predic proof optim predic migrat algorithm produc semant correct tree stream optim order subject constraint proce prove predic migrat algorithm termin polynomi result tree stream repres optim choic predic locat entir plan tree lemma join node ad select secondari join predic stream rank js group lemma join select secondari join predic plan predic migrat algorithm place subsequ place note modul seri parallel construct stream node constrain respect node element primari join predic constrain select secondari join predic unconstrain respect parallel chain pass valid job modul jm hellerstein predic migrat join select outer rank rank predic migrat scan raster select scan author clifford note rank outer rank select scan raster select scan author clifford note rank join rank unoptim plan stream fig plan predic migrat corollari lemma modifi parallel chain sort simpli pull select secondari join group potenti lower number comparison routin optim implement illustra theorem plan tree predic migrat algorithm termin polynomi produc semant tree stream predic migrat algorithm correctli order stream polynomi number step remain show result tree fact optim show semant correct tree stream semant correct tree stream minimum cost output predic migrat algorithm semant correct tree minimum cost semant correct tree theorem plan tree uniqu semant plan tree stream semant correct tree minimum cost revisit theorem demonstr predic migrat algorithm produc desir interleav predic simpl illustr efficaci predic back introduct figur illustr plan gener queri illustra run predic migrat perform measur plan tabl clear failur pull select join perform degrad factor order magnitud detail studi place select join section optim techniqu queri method queri plan optim time execut time cpu cpu pred sec sec min sec min sec pred sec sec min sec min sec tabl perform plan preserv opportun prune previou section present predic migrat algorithm optim place select secondari join predic plan tree appli join plan predic migrat algorithm gener plan queri tradit queri plan prune plan space plan al prune affect basic exponenti natur join plan significantli lower amount space time requir optim queri join prune system optim dynam program build optim plan fashion plan subexpress queri plan prune suboptim cost prune integr predic migrat illustr queri join perform select relat algebra express tradit predic oe tradit queri optim plan oe discard optim plan subexpress assum select predic extrem high pull join plan queri join method tradit optim save oe possibl final tree optim plan subexpress oe problem subexpress dynam program algorithm form part optim predic migrat prune dynam program discard part optim plan entir queri case prune subexpress plan prune chang predic migrat prune place subexpress predic lemma isol situat prune lemma select secondari join predic rank greater rank join plan optim complet tree highest join subexpress lemma predic happen join predic subexpress higher rank jm hellerstein join predic pull top subexpress predic prune usual return subexpress join select oe assum oe higher rank join method prune minim cost oe resid optim plan tree full subplan join save techniqu base observ lemma section predic migrat effici integr system optim addit note choic optim join algorithm independ size placement select input join sort join conclud merg join size input implement heurist prune happen select pull join practic previou section demonstr predic migrat produc provabl optim assumpt theoret cost model section bring theori address import assumpt underli theori simpl heurist work predic migrat gener constrain predic migrat effici integr standard optim requir modif exist optim goal section guid queri optim develop practic optim solut queri implement perform complex suit applic domain refer describ experi implement predic migrat algorithm simpler heurist illustra compar perform approach class attempt highlight simplest solut work class tabl quick refer applic limit line field rough estim total number line code illustra system optim support algorithm note code share save al optim techniqu queri method algorithm work line comment queri queri singl tabl join oodbmss queri free select cost domin select queri preprocessor join predic migrat minor estim problem predic enlarg migrat queri system plan space exhaust queri complex tabl summari algorithm predic code entri form superset code entri analyz optim effect section analyz effect varieti strategi predic placement predic migrat produc optim plan compar varieti altern strategi theoret optim easier optim heurist develop methodolog carri comparison tricki queri optim section discuss choic analyz optim effect describ motiv chosen evalu approach difficulti optim evalu analyz effect optim problemat undertak optim plan enorm search search space plan vari perform order magnitud optim base select cost estim erron ioannidi poosala exhaust optim compar plan cost select estim inaccur commun queri optim avoid worst queri plan gener pick good queri plan al lohman lohman swami iyer remain open debat definit previou statement situat optim suboptim queri construct make error arbitrarili detriment queri definit pioneer design queri accur author scheme path select al jm hellerstein ad leav intellig analyz practic efficaci inher rough techniqu infinit space approach problem literatur basic queri oper optim cost select model compar actual perform techniqu studi distribut dbm lohman lohman effect isol inaccuraci optim cost model random data set queri optim techniqu gener compet plan approach studi gupta kang stonebrak give rough optim larg space workload influenti person defin standard repres workload strategi compar workload exampl benchmark includ wisconsin benchmark al ap al benchmark base model workload standard benchmark typic system implement solut import detail indic reorder join wisconsin intellig handl complex subqueri optim execut strategi poorli evalu optim benchmark typic rel perform good bad strategi import optim access al worth note binari benchmark proven extrem commerci arena justifi optim research case altern benchmark run queri logic make optim strategi work fail binari outlook similar wisconsin benchmark reflect optim claim workload reflect typic scenario practic form empir algorithm provid insight algorithm quantit comparison analysi identifi optim strategi highlight scheme succe fail avoid issu identifi present inform predict behavior strategi workload extens manag system deploi consensu definit workload method result decid defin method optim techniqu queri method tabl pg tabl pg tabl benchmark test cost select estim techniqu predic focu work optim strategi estim left futur discuss section reject idea random reason feel defin random distribut queri reflect method provid insight reason optim strategi fail goal understand optim strategi chose algorithm analysi benchmark experi section section present empir algorithm analysi predic migrat altern illustr scenario approach work fail order pick simplest queri develop illustr tradeoff choic predic placement approach predic migrat fail simpl queri indic difficulti predic support random perform sql queri run illustra demonstr strength limit algorithm schema queri base random benchmark hong stonebrak stonebrak cardin scale factor tupl byte user data tabl number ascend order prove import analysi attribut start letter attribut indic defin number attribut approxim number time repeat attribut column duplic time physic characterist relat tabl entir indic megabyt size enorm modern good deal larger virtual memori buffer pool queri refer method number method describ cost method term random method time invoc time queri touch tupl method perform jm hellerstein queri select execut time plan predic migrat fig queri execut time queri count time method multipli number method ad total measur run time queri measur perform queri method reason amount comparison good plan suboptim plan prohibit predic placement queri optim section analyz algorithm handl predic easili integr system queri optim begin assumpt predic initi low plan typic default exist system version tradit select add code order select enhanc heurist optim plan queri singl tabl cost invok select predic tupl estim system metadata select select predic similarli select relat order ascend order rank section order optim intuit make lower select earlier appli filter tupl cheaper earlier appli benefit reap low cost crucial step optim queri select order select rank repres minimum gestur system make optim provid benefit queri multipl select current dbmss typic queri collect join system support produc poor shown figur remain algorithm order intuit appli select intuit select optim select chang oodbm vendor plan support oql queri includ facil join optim techniqu queri method queri select execut time plan predic migrat fig queri execut time queri select mention explicitli point remain section focu algorithm order select respect join select cost pull top subplan system system algorithm subplan prune result remov predic gener optim plan modifi past predic top plan repres extrem eager pull minimum complex term implement run intellig place predic join system estim select order add exist add simpl facil collect cost inform routin sort select code pull select plan tree algorithm simpl effect solut system predic neglig cheap extrem costli join number relat difficult quantifi draw line extrem optim placement predic depend cost cost select join select join cost depend size content relat issu accept techniqu main memori manag system system store small amount data complex oper perform produc poor plan join select greater problem avoid method naughton queri queri minor chang suboptim plan recal tabl reflect rel cardin case jm hellerstein queri select execut time plan predic migrat fig queri execut time queri valu join select pull costli select number call cost join algorithm pick join method queri incorrectli place costli predic join unusu graph figur bar point experi highlight fact error made method requir random join typic cost case extra work perform join queri compar time comput costli select lesson danger join predic safer cheap oper make figur perform problem predic gener heurist gener effect remain attempt find happi medium heurist work subroutin system time join construct input examin select input unlik pull select make select base rank cost select join calcul outer gener join select stream higher rank join pull join select outer stream higher rank join outer rank pull lemma pull select join select pull join optim plan tree algorithm substanti difficult implement algorithm addit comput cost select optim techniqu queri method queri select outer rank costli rank outer rank fig join plan queri costli rank rank fig join plan queri execut time plan predic migrat fig queri execut time queri join fact base hope heurist prove ineffect case plan tree queri figur outer rank greater rank costli pull select outer rank pull select pair node constrain order rank ascend stream plan pull group join node time fail scenario corollari lemma easi show optim algorithm queri join select singl stream made optim queri join relat optim stream treat select join primari join view join select group similar techniqu optim stream fail illustr figur form group join pull select plan figur join order select pull top join order chosen good result poor perform shown figur plan join order figur costli select pull top jm hellerstein queri select execut time plan predic migrat bar extend fig queri execut time queri predic migrat detail predic migrat algorithm present section predic migrat augment possibl primari join node plan tree rank join node node plan rank rank shown treat group pull select group rank select higher rank group rank pull pair predic migrat algorithm form group attempt predic migrat integr system algorithm start run system chang made find predic decid pull join plan mark subexpress unprun subsequ construct plan larger mark subexpress unprun unprun subplan system algorithm modifi save subplan save plan unprun subexpress assur multipl primari join group maxim opportun pull predic group end system set plan includ cheapest plan plan interest unprun plan plan pass predic migrat optim place predic plan reevalu cost modifi cheapest plan chosen execut note predic migrat requir minim modif exist system invok prune modifi save unprun final plan predic optim techniqu queri method migrat run remain plan minim exist optim extrem import practic commerci implementor modifi experi queri work modif run upset custom grai predic migrat effect optim handl queri predic safe implement predic migrat system newli support plan chang result implement drawback predic migrat unprun plan worst subexpress plan predic pull subexpress mark unprun scenario system algorithm exhaust space join prune subplan prefer earlier approach ldl al section difficulti practic payoff invest optim time appar figur note predic migrat algorithm correctli optim queri theori implement issu algorithm previou section implement illustra dbm section discuss implement issu experi illustra dbm base publicli postgr system illustra extend postgr significantli support extend version sql bring postgr prototyp code industri grade perform reliabl full predic migrat algorithm origin implement author effort month work month add month implement predic migrat algorithm refin upgrad code illustra prove write initi postgr illustra sql significantli complex languag modest made code handl subqueri featur note cost estim optim adjust conform requir section origin cost estim gener join order evalu join cost predic cost model mix cost model discourag affect global optim plan approach practic preserv behavior optim queri predic queri plan chosen time long optim illustr bar plan truncat graph poor perform happen pull costli select costli join predic result costli join predic evalu tupl cartesian product extrem bad plan requir effort cach execut time discuss naughton avoid call costli select multipl time input jm hellerstein effort requir tune code robust commerci product month spent illustra version predic month spent upgrad optim code illustra involv extend handl sql make code faster remov bug sort system failur remain time spent fix subtl optim bug debug queri optim difficult optim bug necessarili produc crash wrong simpli produc suboptim plan difficult ensur produc plan run comparison varieti subtl optim bug cost select estim difficult uncov origin cost model predic present stonebrak inaccur practic bug run queri optim compar estim cost actual run time result plan predic supposedli superior optim produc queri plan simpl meant bug optim lesson learn compar benchmark absolut crucial debug queri optim valid cost model note fairli recent varieti commerci product produc poor plan simpl queri benchmark complex queri benchmark critic debug tool dbm develop easili compar predic migrat implement ensur predic migrat heurist comparison bug fix found predic migrat produc plan gener fast faster practic produc simpler heurist differenti cost model standard predic migrat algorithm present section work differenti join cost constant section examin cost model fit standard join algorithm commonli relat join predic select repres select jsj number tupl pass join similarli repres select jrj section review accuraci estim practic cost select predic differenti store system metadata constant differenti cost join predic input assum cost model relat join cost form term form proce demonstr strict cost model suffici robust cover usual join algorithm recal treat tradit simpl predic similarli optim techniqu queri method ignor cpu cost join term cost merg hash join al fit criterion join index cost tupl outer relat cost probe index cost tupl relat essenti scan tupl relat qualifi filter cost join index relat fit criterion issu join index cost number block scan relat note number block scan relat constant irrespect select relat tupl outer relat scan disk block select pull relat join fit cost constant predic equat written accur model differenti cost typic join method tupl input cost model evalu merg found accur estim perform varieti commerci system al influenc perform result estim result perform experi influenc estim select illustra estim select join tabl jrj rough jrj defin depend select jrj rang cardin minim output elig select appli calcul jrj fly base number select time comput select join predic pull potenti underestim select join result rank join possibl result select rough select estim chosen result perform decid estim result prefer estim result heurist base exist method cach naughton long method pull select join incorrectli number time select method number duplic input valu select potenti predic migrat ignor save merg join due buffer slightli cost merg join predic placement assum plan tree true system includ illustra bushi tree join bushi sort hash relat materi jm hellerstein earlier ldl approach al section observ predic migrat approach pull input rank join input rank join outer input input complet produc accur outer occur ldl approach unlik illustra exhibit constrain select input select outer input pull select input pull treat input outer result select estim select input ldl approach pull predic input circumst relat work optim method predic migrat stonebrak issu predic optim context postgr store question pose stonebrak directli address paper predic migrat present stonebrak predic migrat algorithm present ident section earli paper includ cost model inaccur model queri model select join ident respect input paper present correct cost model section paper extend previou work correct discuss cost model proof optim pseudocod predic measur version illustra enhanc method cach techniqu ldl approach approach optim queri predic pioneer ldl logic system al extens relat system al al refer ldl approach illustr select boolean method optim techniqu queri method fig queri plan select fig queri select model join assum optim plan queri pictur figur directli scan ldl treat join virtual relat infinit cardin queri transform select join cost cost appli method ldl approach appli tradit optim plan rewritten queri integr system optim ldl number join system rs complex exponenti number join zaniolo krishnamurthi al approach optim join order system optim algorithm plan plan tree model optim plan tree figur plan tree figur select treat bushi plan tree figur ldl approach forc pull select relat order tree ldl approach err make defici ldl approach overcom number wai system optim modifi explor space bushi complex ldl approach modif optim handl bushi tree al al successfulli integr ldl approach exhaust mechan requir time exponenti number select relat work ibaraki zaniolo al swami iyer iyer jm hellerstein develop refin queri optim scheme built notion rank scheme rank reorder join select techniqu possibl select reorder node singl path queri plan tree scheme complet method queri extens appli plan queri optim system project face issu predic placement earli sql languag notion form select emphasi optim work find optim join order publish work place predic queri plan system simpl heurist place subqueri plan subqueri evalu postpon simpl predic evalu issu balanc select cost final implement subqueri order difficult subqueri appli system consid pull subqueri predic lowest elig posit haa orthogon issu relat predic placement problem rewrit predic effici form shim chen al semant optim focu rewrit predic term cheaper predic semant rewrit techniqu call al suggest rewrit sql queri copi predic move copi queri block author conjectur techniqu benefici queri predic relat idea occur method follow refer tupl tupl typic techniqu method rewrit submit queri tradit join optim idea similar queri rewrit facil starburst al heurist rewrit declar optim convert declar queri execut plan import note issu orthogon problem predic placement queri rewritten cheaper predic optim queri plan al al al address problem plan disjunct queri work easili integr tradit optim system illustra boolean factor boolean operand order metric mixtur path express method select emp red express rewritten function notat select emp typic convert join select kid possibl variat handl duplic note method argument path express secondari join optim techniqu queri method predic migrat ldl eager eager fig eager algorithm easili shown optim order disjunct analysi similar proof lemma section method queri predic method cach import queri execut techniqu minim cost queri detail studi method cach techniqu present naughton present relat work area assum cost cach neglig tupl assumpt algorithm present naughton summari paper present techniqu effici optim queri util core featur extens method type present predic migrat prove produc optim plan implement predic migrat simpler predic placement techniqu studi effect solut compar implement complex develop optim solut techniqu depend workload invest code predic migrat difficult implement provid significantli result solut extens dbm rough remain select estim forc opt risk select justifi show leav select low plan danger pull high algorithm consid form spectrum eager shown figur lesson research implement effort paper provid numer lesson clear queri optim research requir combin theoret insight implement test origin cost model predic migrat fundament reader review earli work detect error implement experi gain insight implement critic queri queri optim research implement jm hellerstein idea demonstr complex queri benchmark requir drive research industri workabl solut remain challeng queri optim implement effect predic placement scheme prove manag present origin algorithm highlight complex issu implement queri optim import lesson learn implement predic migrat illustra queri optim requir great deal test trust practic mean commerci optim subject complex queri queri optim research invest time implement test idea practic limit publish algorithm predic placement suggest algorithm suffer choic predic pull side join depend influenc choic predic pull side join interdepend separ stream queri tree suggest fundament intract predic avoid sort found exist literatur open question paper leav number interest question open satisfi understand ramif weaken assumpt predic migrat cost model rough estim requir polynomialtim predic placement weaken assumpt develop effici question cast term combin ldl approach method al join optim krishnamurthi al optim algorithm handl select point section techniqu fail handl bushi join tree isomorph question algorithm extend handl bushi tree polynomi time recent work moerkott show answer question gener neg predic migrat significantli affect asymptot cost exponenti queri notic memori util algorithm prevent prune extens work deeper investig techniqu prune predic migrat work predic placement concentr tradit queri block handl optim interest extend work difficult sort queri predic migrat appli queri common predic transfer queri duplic queri block al question requir effort gener optim techniqu queri method techniqu optim queri predic suggest implement ad larg amount code exist system work paper implement provid benefit piec ad sketch plausibl upgrad path exist extens step select order rank typic optim estim requir estim select sort select heurist implement requir code pull select bit tricki requir handl project column note necessarili effect safer heurist method expect heurist modifi includ code comput differenti cost join leav method low danger correctli optim difficult met implement cheaper plan preprocessor full implement predic step direct predic migrat complex difficult implement requir implement predic migrat code mark subplan unprun execut improv cach scheme hybrid cach naughton method requir modif cost model optim acknowledg special due jeff naughton mike stonebrak assist work due staff illustra inform wei michael mike jeff kevin brown provid input surajit david jame jim laura eugen gui raghu praveen seshadri refer benchmark systemat approach proc intern confer larg data base oct jm hellerstein vi analyt model neural network queri cost evalu proc intern workshop gener inform technolog system statu report oodbm benchmark effort proc confer program applic oct pp object morgan san ca queri optim presenc foreign function proc intern confer larg data base aug pp decomposit approach optim queri includ adt function inform process letter open architectur ldl proc intern confer larg data base aug pp nest unifi approach process queri nest quantifi proc intern confer larg data base sept pp queri optim heterogen dbm proc intern confer larg data base aug pp uniform analysi concept fractal dimens proc acm symposium principl system pp person correspond ed benchmark transact process system person correspond estim number distinct valu attribut proc intern confer larg data base sept practic predic placement proc intern confer manag data pp queri execut techniqu cach method proc intern confer manag data june pp predic optim queri predic proc intern confer manag data pp optim parallel queri execut plan distribut parallel intern journal statist estim relat algebra express proc acm symposium principl system march pp optim nest comput join acm transact system illustra inform illustra user illustra server illustra inform propag error size join result proc intern confer manag data june pp optim techniqu queri method balanc histogram optim practic queri result size estim proc intern confer manag data pp random algorithm optim larg join queri proc intern confer manag data pp iso ansi languag sql optim disjunct queri predic proc intern confer manag data pp futur proc intern confer larg data base aug pp optim queri proc intern confer larg data base aug pp optim logic base languag knowledg data intens applic proc intern confer extend data base technolog advanc technolog edbt lectur note comput volum march queri optim predic proc intern confer larg data base sept pp effici sampl strategi relat oper theoret comput scienc person correspond optim nest queri distribut relat proc intern confer larg data base aug pp person correspond extend index applic textual proc intern confer larg data base pp optim valid perform evalu distribut queri proc intern confer larg data base aug pp optim valid perform evalu local queri proc intern confer manag data pp index dbm dittrich dayal proc workshop system sept pp sequenc constraint mathemat oper research present intern high perform transact workshop data base search problem inform system coin iv plenum press featur proc acmsigmod intern confer manag data pp queri rewrit optim starburst proc intern confer jm hellerstein manag data june pp estim distribut applic load balanc proc intern confer larg data base sept select estim rang predic histogram proc intern confer manag data june benchmark standard transact process perform council complex gener optim plan cross product proc acm symposium principl system pp access path select relat manag system proc intern confer manag data june pp optim algebra implement proc intern confer manag data june pp complex queri decorrel proc ieee intern confer data engin feb join process system larg main memori acm transact system optim product naval logist bypass join disjunct queri proc intern confer larg data base sept manag persist object store proc intern confer manag data june pp sequoia storag benchmark proc intern confer manag data pp postgr manag system commun acm optim larg join queri proc acmsigmod intern confer manag data june pp polynomi time algorithm optim join queri research report rj ibm almaden research center ap compar relat benchmark proc ieee spring decomposit strategi queri process acm transact system optim queri includ adt function proc intern symposium system advanc applic april pp appendix proof optim techniqu queri method lemma cost appli select predic set tupl minim appli predic ascend order metric rank select differenti cost proof result date back earli work oper research review context complet assum contrari order pn predic predic cost appli predic tupl pk pk pn swap cost pk pn subtract factor ts pk pk pk recal pk pk simpl algebra account fact inequ reduc pk pk pk show term equat definit select demonstr order contradict lemma swap posit node effect cost plan tree proof note swap node plan tree affect cost node adjac interchang properti sidnei node equal oper input cardin order joint cost te swap result cost te ts rank matter simpl algebra demonstr cost plan tree independ order node lemma join node ad select secondari join predic stream rank js group proof assum initi group jp point repres group node constrain respect member affect rank group jm hellerstein constrain member constrain semant select secondari join predic constrain node predic migrat algorithm eventu call parallel chain modul node constrain follow pull modul order ascend rank group modul part js group node form group higher rank node form group lower occur parallel chain pull predic easi show constrain ad subgroup subgroup rank top total group includ evid lower rank lower rank complet group rank js group chang lemma join select secondari join predic plan predic migrat algorithm place subsequ place proof assum time predic migrat algorithm push select secondari join predic back join happen rank group higher rank js group time lemma pull node rank js group time node push rank js group push contradict theorem plan tree predic migrat algorithm termin polynomi produc semant tree stream proof lemma predic migrat algorithm move predic upward stream pass loop predic migrat make minim pull singl predic singl join stream predic pull top height tree predic migrat algorithm visit stream hk number select secondari join predic tree tree number relat referenc time predic migrat algorithm visit stream height perform sidnei log algorithm stream predic migrat algorithm termin log step number height number relat referenc queri bound number oper plan tree trivial upper bound predic migrat algorithm optim techniqu queri method log note conserv present demonstr predic migrat algorithm polynomi complex gener predic migrat algorithm perform greater effici number step log predic migrat algorithm stream subject constraint join order semant correct theorem plan tree uniqu semant plan tree stream semant correct tree minimum cost proof theorem demonstr tree exist semant tree stream predic migrat algorithm prove tree proce induct number join node tree argument lemma assum group distinct group disambigu id node group base base case join node simpli scan node seri uniqu order shown lemma induct tree join node uniqu semant tree stream semant plan join node stream show tree prove uniqu properti theorem illustr figur refer join node refer join scan outer input stream denot set select secondari join predic join node ro call predic set mobil join predic refer attribut input join mobil predic move join affect semant plan tree establish ident proof analog plan tree set ro predic made union ro predic refer attribut group cost select modifi includ cost select analog tree union ro predic refer modifi cost select clear tree node assum induct hypothesi ident differ occur set predic tree jm hellerstein fig semant plan tree stream ro ro predic travel downward singl ro show shown ident assum loss gener assum recal tree impli mobil predic lower rank rank mobil predic mobil predic proper superset proce show predic demonstr ident complet uniqu portion proof assum stream distinct predic pull lowest predic oe assum loss gener ro stream higher rank stream optim techniqu queri method mobil lower rank group directli higher rank stream rank greater rank group lemma ad node group lower group rank higher rank rank higher higher rank contradict earlier assumpt ident begin uniqu tree stream easi tree tree minimum cost assum semant tree minimum cost stream order stream group adjac group swap violat constraint swap order group affect cost node total cost made lower swap contradict assumpt minimum cost semant correct tree stream minimum cost complet proof lemma select secondari join predic rank greater rank join plan optim complet tree highest join subexpress proof recal full plan tree group node rank equal rank join node select secondari join predic higher rank join node
DB/281 3 vldb journal process kossmann vldb journal universität für edit shmueli receiv februari accept septemb abstract refer kei concept system investig altern techniqu implement refer make queri evalu function join give overview perform evalu techniqu simpl function join describ special techniqu attract support queri requir order result present paper result appli plain relat index join frequent found relat execut function join kei object identifi logic oid physic oid queri process pointer join function join join introduct background motiv refer kei concept system object natur repres order object object refer custom object set refer object natur user initi queri involv function join call user request custom order good user interest price order excerpt work confer public work partial support german research council contract ke refer implement store referenc object identifi referenc object object identifi implement wai refer gener extern legaci gener intern system techniqu depend kind refer applic order implement function join show refer occur part special techniqu requir deal case choic method impact oper carri queri point present techniqu applic system system relat work paper give overview perform analysi techniqu work function join carri shekita carei work partial incorpor starburst extend deal parallel system previou studi altern wai implement refer develop special techniqu function join presenc attribut special techniqu support queri aspect give complet overview fill open hole address previou work concentr ad hoc function join assum special join path indic join indic work path process fig physic oid fig map techniqu hash tabl direct map indic report recent paper describ join algorithm base join indic algorithm store join result file merg obtain actual join result algorithm achiev perform gain situat join materi situat join result process tupl disk algorithm pipelin tupl line work cover detail object assembl object assembl influenc order object read disk retriev remot server distribut system order reduc cost object assembl specif design assembl complex object hierarch object assembl work function join focu work concentr execut function join ignor queri optim issu queri optim techniqu aim find evalu order chain function join present overview paper remaind paper organ sect investig altern wai implement object identifi section describ algorithm perform function join refer attribut section describ analog algorithm perform function join refer attribut section present class techniqu attract support queri requir order result section present result perform analysi compar altern techniqu detail cost model section conclud paper implement object identifi embark detail altern present wai repres implement object identifi system kind oid found physic oid logic oid physic oid encod storag logic oid storag locat independ logic oid implement wai describ physic oid logic oid wai implement logic discuss altern approach physic oid physic oid storag locat object time object creat central storag locat typic defin segment identifi file page identifi block slot posit find object page distribut physic oid address server object creat addit storag physic oid uniqu system work correctli object delet object refer object physic oid object delet process fig split leaf page object creat storag locat object origin store trap object referenc longer physic oid object differ uniqu field exodu achiev maintain counter data object creat page current counter part oid work physic oid physic oid refer system simpli decod storag locat referenc object part physic oid special precaut object migrat page migrat object grow result updat oper object forward storag locat object establish place object origin store object migrat forward updat storag locat object read physic oid shown fig figur show object referenc oid store origin object referenc oid migrat forward object establish exampl commerci system make physic oid objectstor object illustra logic oid logic oid storag locat logic oid locat independ find object logic map structur map logic oid address object entri map structur updat similar forward updat object migrat physic oid kind map structur hash direct map tabl map structur shown fig denot logic oid number pair denot address object page slot number segment number illustr describ map structur describ map structur partit map logic oid natur map logic oid object address implement commerci addit implement effort requir effect logic oid oid specif tune implement logic oid gener insert ascend order insert pattern worst case standard textbook split occur storag space shown fig split implement demonstr fig move half entri node entri move similar optim insert ascend order incorpor context tempor exampl system support logic oid gemston shore map logic oid hash tabl altern hash tabl map logic oid varieti hash techniqu overview import tune factor kind hash tabl hash function map good hash function easili found oid gener ascend simpl mod hash function work exampl system hash tabl map logic oid direct map hash tabl find address object compar oid approach describ call direct map work encod address handl oid handl work forward physic oid handl object address object handl updat differ system emploi logic oid direct map system reli physic oid system direct map alloc handl object time object system physic oid alloc forward object migrat handl organ extens handl segment segment number handl handl page fix amount slot handl handl address object uniqu field detect dangl refer refer delet object system emploi physic oid logic oid address handl handl segment handl page slot uniqu field process free space bitmap handl segment object segment logic oid page page page page page creation site page number slot number uniqu fig handl handl segment figur show logic oid refer handl refer object figur show free space bitmap maintain handl segment bitmap find empti slot handl segment object creat fig bitmap bit set slot handl segment bitmap organ granular handl compress bitmap bit set object rare delet commerci system support logic oid direct map direct map coupl research variant direct map system partit map structur larg good idea map inform singl map structur direct show previou subsect map inform partit multipl handl segment partit hash tabl popular approach establish separ hash tabl handl class object system map structur establish object approach oid map carri step class encod hash hash tabl hash tabl probe address number class typic hash tabl hash tabl main memori note kind partit map inform carri implicitli relat relat primari indic natur construct tabl individu global index kei tupl tabl number disk request read object linear direct physic oid hash map log tabl size map structur object linear hash direct map mb mb mb mb logic oid probabl posit pointer probabl posit pointer late idea gener logic oid address object found oid ppp object found address logic part oid find object direct ppp updat approach hybrid logic physic oid inherit advantag disadvantag physic logic discuss approach concentr underli physic logic oid disadvantag ppp ppp requir larg oid tend larg ppp discuss briefli summar tradeoff physic oid approach effect logic oid retriev perform physic object read disk singl request object migrat request object migrat logic oid direct object read disk request shown read object singl request applic relev handl page effect cach main memori log height read disk worst case shown request suffici cach larg relev part resid hash tabl linear hash experi show object retriev disk request request hash tabl lookup access independ size cach tabl summar result size map structur tabl show size map structur logic oid independ number object map structur smallest direct map process largest hash tabl hash prefix lie determin space overhead system emploi physic oid object space overhead object overhead correspond space occupi forward forward fragment data page store handl nice pack handl page direct map size oid oid repres refer size oid strongli impact size entir physic oid byte byte page number uniqu byte segment number slot number logic oid byte long direct map hash tabl byte implement logic oid system gener system logic oid hash oid byte order encod class object oid note concurr control recoveri map structur easier implement faster direct map tree hash tabl observ made hash tabl requir hash work size hash tabl hash show poor perform size hash tabl exce anticip size size hash tabl handl segment conclud physic oid logic oid direct map implicitli made assumpt oid gener system applic requir extern defin oid extern defin oid integr legaci system physic oid logic oid direct map support extern defin oid hash tabl viabl continu option implement oid describ techniqu implement function join section function join refer turn descript altern wai implement function join call refer attribut present involv queri function join present altern depend oid implement schema queri describ algorithm schema schema consist tabl object store tabl refer object store tabl creat type data creat tabl creat type attr data creat tabl queri discuss refer object store tabl order retriev attr attribut match object store tabl queri involv function join defin select attr simpli ignor handl data includ schema perform analysi includ bulki attribut model realist size object naïv approach naïv approach execut queri scan tabl follow refer individu approach correspond tradit approach appli independ kind oid map techniqu direct figur illustr naïv approach system logic oid direct map function join execut queri ignor fact field oid carri queri regular join method hash join approach effect queri good queri optim perform select ss attr ss approach work kind oid independ map techniqu object store tabl oid consid fulli field object restrict refer object referenc object store tabl approach shown fig hash join method execut join process map fig naïv function join direct map fig function join oid attr rs attr special techniqu physic oid rs attr sect naïv approach function join show poor perform naïv approach excess random disk join exploit address inform oid map structur describ approach system emploi physic oid describ techniqu pioneer shekita carei presenc describ techniqu extend deal forward end evalu idea techniqu sort object tabl ascend order page number physic oid store field sort match object read disk sequenti process shown fig bold type figur repres forward note sort page swap tabl evalu idea techniqu object object referenc oid attr object singl partit fit main memori queri result obtain join hash partit object chunk join partit object chunk figur illustr process altern rang partit object hash rang partit attract object referenc object singl partit object fit main memori partit size rang partit support statist partit fit deal forward wai handl occurr forward evalu function join base sort partit approach immedi chase accept penalti addit page fault page thrash approach effici forward immedi chase forward collect initi algorithm evalu process separ pass avoid random sort partit forward end neg collect forward requir addit disk addit buffer process oid attr fig function join physic oid base sort ê ö ö ö ö ö ö ö ö ê ê ë ë fig join physic oid base partit hm map hs fig function join logic oid base partit fig naïv pointer chase map oid attr rs attr ö ë ö ö ö oid attr rs rs attr process techniqu logic oid show work presenc logic oid kei observ carri function join presenc logic oid repres queri join join execut techniqu physic oid previou implement join map structur map appli sort respect restrict depend map techniqu hash sort directli probe hash tabl ascend order make probe hash tabl order unord advantag sort appli hash function map structur valu order find page number bucket hash sort partit page number directli sort sort read leav sequenti rang partit effect sort physic oid complex intern structur make difficult predict rang predic hash partit make map direct map hash partit natur appli direct logic oid interpret physic oid handl object figur illustr function join directli map logic oid carri direct map implement rang partit join carri rang partit compar physic logic price logic oid addit join map tabl posit system logic oid worri forward process studi detail sect function join nest refer set turn discuss techniqu presenc refer attribut refer present tabl assum creat fly special oper binari group oper γ extend previou section describ altern techniqu exploit nest refer assum nest refer set cluster system awar map fig evalu base schema queri subsequ discuss chang schema sect includ refer attribut creat type creat type data attr data creat tabl creat tabl queri discuss select rr select rr ss attr group nest refer set maintain restor evalu queri lefthand element nest set aggreg queri element nest set output sum price queri mention intuit pattern left queri naïv algorithm algorithm scan refer store nest set individu logic map structur probe obtain address referenc object combin size map exce memori algorithm perform poorli execut involv great deal random disk note queri side standard sql nest queri return set tupl ordbm product support oql queri express slightli process flatten algorithm flatten algorithm work step flatten attribut obtain refer attribut function join algorithm base sort partit method initi group mean sort hash oper process shown logic oid fig approach implement function join method join map figur show evalu partit map algorithm logic oid naïv algorithm suffer lack result random flatten algorithm incur high cost restor group end question algorithm design achiev local maintain group algorithm algorithm retain group flatten tupl arbitrari number function join achiev interleav partit merg order retain group intermedi partit step captur notat describ basic algorithm appli evalu unari function join logic oid intermedi longer chain evalu sect algorithm join join map replac logic oid physic counterpart result join evalu join adapt hash join algorithm probe input join logic oid replac physic counterpart call rm phase unlik origin hash join probe input explicitli partit build map fault buffer rang partit appli load explicitli buffer partit step map involv addit disk requir success step algorithm visual flatten partit join map obtain rm partit rm rm partit join merg simplifi assum partit level requir algorithm work algorithm flatten object partit appli map logic physic partit result initi partit perform join final merg partit restor group flat tupl belong object partit function hm hm partit map chunk map logic oid partit number hs partit chunk map address object partit number map partit partit mn sk partit function appli map logic oid store nest set physic counterpart rm appli map algorithm perform step flatten nest partit flat denot rn object gener flat tupl insert tupl partit hm hm attribut data replic suffici includ flat tupl leav end sect partit written disk partit initi empti partit denot gener scan ri element replac logic oid physic counterpart obtain ith partit mi map insert tupl partit note oid map perform step concern partit mi prefetch fault buffer complet step partit disk scan partit simultan merg singl tupl stream merg restor group flat tupl merg gener tupl stream tupl function join perform object locat relev retriev insert tupl partit rm object referenc step belong partit sj fault process µ hm map hs fig partit ê ö ö ê ö ö ö ö ö ê ö ö ö ö ö fig ö ö ö ö ö ö ö ö ö ö oid attr rm ë ë ë ë buffer partit ensur entir sj fit memori complet step partit rm disk scan partit rm simultan flat tupl nest group tupl algorithm exemplifi fig function hm hs fig algorithm write disk gener partit probe input applic gener partit appli partit obtain join intermedi partit subsequ merg partit partit kei idea algorithm group flatten tupl preserv partit step partit function hm hs observ immedi distribut object partit appli map destroi group retain partit essenti partit gener perform highlight fig group rs ö ö ö ö ö ö ö ö ö ö ö ö algorithm induc basic flatten algorithm sect cpu cost merg algorithm lower basic flatten algorithm involv flat tupl object sequenti order partit algorithm room optim base retain group applic algorithm sect physic oid function join algorithm applic system emploi physic oid logic oid simpl case function join variant plan consist singl partit singl merg interleav oper appli algorithm queri longer path express addit type attribut referenc queri path express process fig disk write algorithm fig algorithm pm pm map µ pm pm µ logic oid physic oid fig plan queri path express select queri sum base price product order evalu plan logic oid physic oid outlin fig plan unnest intermedi stage retain group object interleav oper compar differ higher number function join map logic oid assum separ map structur map plan base physic oid draw profit interleav step base logic group object retain success function join final group oper carri plan fine point algorithm fine point design algorithm address obtain order algorithm requir order object merg iter compar object partit tupl fig determin order store origin order kei addit sequenc number insert step merg step note flatten tupl object assign sequenc number project attribut attribut request sever inflat amount data written time partit file reduc measur replic attribut flatten unnecessari ri attribut written algorithm retain order attribut project merg final result contrast join standard flatten attribut fact result order attribut simpli handl addit input stream merg oper scan high select bulki attribut qualifi object save temporari segment initi scan final merg procedur illustr fig bypass bulki attribut function join save term volum intermedi result write buf oper denot disk icon subsequ read disk merg earli aggreg aggreg request result set addit aggreg fold appli subgroup belong object written rm process fig bypass bulki attribut function join process result storag save rm final intermedi aggreg result combin easili achiev aggreg constitut commut monoid oper satisfi associ ident inform maintain enabl earli aggreg buffer alloc algorithm consist consecut store intermedi result disk simplifi buffer memori queri alloc current phase phase easili deriv fig delimit set partit store disk phase initi process end set partit map dereferenc final merg phase major amount memori alloc cach map small amount alloc input output buffer partit algorithm modest memori phase requir costli toler small size algorithm easili degrad main memori scarc comparison size function join appli algorithm wider rang queri necessarili nest refer set queri optim requir order result occur support system exploit physic order kei idea optim queri order result observ appli order object extens preserv order intermedi partit partit gener interleav oper constitut valid run respect origin sort exploit idea context pure relat model design hash join algorithm order optim support queri requir sort flexibl group cube concentr invari algorithm function join order simplifi present switch back schema present sect algorithm equal applic queri nest refer set queri sect addit order select attr order assum order requir queri cluster index illustr fig evalu queri retain initi order ascend intermedi partit rm rm rm rm constitut run respect sort criterion order restor final merg oper note naïv evalu algorithm fig evalu algorithm fig origin order requir final costli sort oper result rs assum physic order cluster evalu queri shown fig logic oid fig physic oid function join applic arbitrarili long chain nest refer set sort ahead argu techniqu effici cluster index gener desir order fly initi partit step avoid addit cost process merg buf buf partit buf partit map buf buf partit logic oid physic oid fig evalu show perform perform presenc absenc cluster sort free trick combin initi partit step plan sort run sort run probe input partit run individu partit run process join assum time bigger main memori perform function join partit hash function hm load chunk ri memori sort attribut partit ri partit appli hm refer attribut partit constitut valid run sort attribut partit singl linear iter run ri write partit sequenti disk finish combin partit constitut valid sort run store disk evalu function join partit run merg obtain partit algorithm work join algorithm algorithm illustr fig earli sort plan appli longer chain queri previou appli presenc nest refer set trace object extens pattern oper appli denot combin sort partit figur illustr combin phase algorithm chunk relat load sort vector maintain pointer object vector individu object move sort linearli scan vector determin partit object belong chain object belong partit index object partit addit field separ call partit order head tail sort fig partit complet chain head tail partit anchor object written sequenti partit partit head partit anchor time sort order partit written singl temporari file insert marker partit avoid overhead alloc multipl temporari file note fig gener partit run fig respect cheaper partit complet memori chunk sort individu partit assum record fit memori sort partit memori chunk log abstract opposit partit memori chunk sort partit requir oper memori manag variant complex sort vector unknown size alloc implement variant perform experi shown differ run time margin investig configur sort ahead function join benefici evalu join result size nest set refer concret queri comput order valu sort order date sum product price assumpt physic order evalu plan fig show earli sort plan logic oid fig show analog plan physic oid perform analysi present result perform experi studi altern techniqu describ includ prototyp implement detail cost model accur model behavior techniqu standard system present result function function result demonstr benefit techniqu process hm map fig fig sort fly hm hm environ cost model hs hs map hs hs merg merg oid attr design cost model strongli influenc structur modern queri engin implement iter model mean cost estim calcul basi cost model cpu oper assumpt base cost model extens deal attribut algorithm due space discuss individu formula cost formula model disk mean differenti transfer time grasp differ sequenti random influenc transfer block size model cpu includ oper major influenc cpu buffer manag iter call space limit describ cost formula iter implement algorithm shown fig present formula direct map rang partit refer map prefetch read set main memori formula appli oid attr attr attr attr tabl paramet describ hardwar rs attr rs attr ts averag seek time ms tl averag latenc time ms tt transfer time page ms time initi oper ms time execut hash function ms time add integ ms time test hash tabl ms time copi byte ms time compar oid ms formula order obtain perform result cost model paramet model cpu cost tabl note constant cpu cost includ instruct relat involv pointer singl cpu instruct cost model variabl describ characterist tabl analysi cost algorithm similar access pattern phase describ pattern list process tabl variabl cost model formula pr number page tabl rm cardin tabl averag size object buffer size number partit averag number element nest refer set fig sort partit phase algorithm pattern show cost assum occur number addit seek calcul separ ad cost algorithm model disk disk disk avoid effect investig algorithm decid neglect assum constant seek time merg buf buf partit merg buf partit map logic oid physic oid merg buf buf partit fig sort fly process read disk denot number page read oper merg oper buffer page input partit cost read rm analog read merg oper prm tl prm tt initi read cost comput ts pr pr tt scan oper read set partit ri pr ts pr tt number partit gener partit oper join formula replac map write disk variabl buffer size cost write oper partit iter partit analog partit comput pr tl pr tt cach iter appli rm produc smaller cost write prm ts prm tt analysi cpu cost action consum cpu time list cost formula iter perform action copi element cost formula copi element set main small denot size element set rm rm action perform iter write temporari set partit cach oper work area sort hash compar element merg iter compar sequenc number attach element detect stem element initi input set cost oper join oper read map process variabl denot number partit merg partit merg iter order element tournament perform comparison element comput hash function join attribut input partit iter call hash perform aggreg element add integ element nest test buffer join iter merg algorithm buffer read map join attribut set join iter buffer page assum lookup access hash tabl cost comput prototyp implement perform experi carri cost model valid cost model feel algorithm real carri experi system carri great deal experi carri experi prototyp system experi textbook system integr algorithm experi system carri sun station run solari disk store softwar disk temporari file order avoid side effect due file system made direct disk carri bypass cach file system displai result tupl suppress queri order studi sheer perform algorithm buffer cach segment configur individu queri plan estim detail cost model test test queri state base simpl tabl exampl object tabl cardin cost object cardin data map object type page page size access naïv object naïv object sort object sort object naïv object part object part object sort object part object memori fig join direct map refer object cardin tabl shown tabl set investig function join refer fix object attribut call sect set investig function join nest refer vari object nest refer set call sect benchmark queri exampl paper set studi queri sect set studi techniqu nest refer queri sect set demonstr benefit queri sect differ function join carri nest refer set attr retriev function join refer attribut figur show run time strategi attribut logic oid direct hash size main memori vari mb mb strategi evalu function join fig mean map join carri partit process cost access naïv object naïv object sort object sort object naïv object sort object memori fig join map cost access naïv object naïv object naïv object part object part object part object memori fig join hash tabl map sort emploi join short form sort partit crucial techniqu carri function join logic oid direct hash tabl refer approach viabl function join carri main memori direct map join cost naïv object access sort object access partit object access memori fig join physic oid cost part part object direct map part object phy forward part object phy forward part object phy forward part object phy forward memori fig logic oid versu physic oid time naïv part sort prototyp cost model fig run time mb avg direct ri memori mb ab hash map join carri memori mb case map structur larger figur show perform physic oid absenc forward observ partit sort crucial order achiev accept time partit slightli sort figur show time evalu physic oid presenc forward observ perform physic oid small memori size figur show run time queri doubl partit strategi logic oid direct strategi logic oid physic oid outperform logic oid absenc forward perform logic oid mb memori map join carri perform logic oid object migrat forward process join nest refer set turn attent evalu function join nest refer set describ cost measur obtain prototyp system investig broader rang configur cost model result prototyp implement benchmark perform prototyp system buffer cach segment configur optim estim individu queri plan total amount memori queri exce mb time direct map emploi resolv logic oid recal concentr queri sect present queri sect observ similar effect restrict size buffer pool mb order run queri altern algorithm present sect figur overview run time algorithm predict cost model shown limit buffer size compar run time naïv perform gap order absolut run time naïv algorithm amount algorithm requir min algorithm significantli outperform flatten approach flatten plan suffer flatten plan suffer high cpu cost sort small run file due restrict amount memori flatten plan join complet build input memori perform hash aggreg end small deviat cost model figur run time observ prototyp implement due fact cost model constant hard calibr measur total run time queri cost model estim slightli higher observ run time run time hash join implement slightli higher predict cost model oper hash join implement effici assum cost model vari memori size figur show run time cost algorithm vari memori size naïv plan show plot due run time mb mb buffer plan naïv map sort physic address access requir flatten group plan sort map lookup join cost access naïv object naïv object sort object naïv object part object hash join memori fig cost model result cost naïv object hash join build hash join build select object fig select mb memori involv flatten compar sort flatten tupl map lookup pai map smaller mb plan rang small memori configur merg variant suffer high cpu cost sort plan cost naïv object naïv object sort object naïv object part object hash join refer object fig vari cardin mb direct process cost naïv map map naïv map map naïv map map naïv map map memori fig inflat oid map vari memori size flatten plan partit map lookup join yield significantli perform flatten plan small memori size perform advantag partit sort small memori size due larg number run file gener sort hash join plan involv flatten perform costli compar winner omit partit step show poor perform small memori size mb plan run partit map access coincid impress result curv algorithm toler small memori size algorithm degrad vari select fig percentag object part function join vari studi variant benchmark queri select predic filter tupl small number page map hit page referenc expect point naïv algorithm high select run time refer overhead induc algorithm naïv algorithm quickli degrad number refer map plot hash join build input variant full select small number due fix cost hash join hash aggreg naïv plan cost memori hash join fig pointer direct map entri cost direct map map hash tabl map memori fig comparison oid map algorithm vari set cardin previou number element set constantli figur show run time algorithm set size algorithm scale run time explod flatten variant behav poorli naïv plan suffer enorm amount random calcul run time roughli flatten plan suffer larg temporari file inflat oid map assum distinct map object perfectli cluster analyz behavior algorithm cluster oid occur global oid map small fraction select oid map entri inflat insert entri uniformli distribut page map process cost naïv object hash join phy oid naïv object phy oid sort object phy oid part object phy oid pm object memori fig physic oid logic oid direct map cost log oid sort object access partit object access pm object access fig effect forward forward million entri queri run standard object element amount memori legend fig size map smallest symbol denot configur fig map optim cluster larger plan show slight run time inevit cost direct map direct map direct map memori fig function join higher number access larger map map page fetch disk number partit partit step adapt partit map cach memori cope larger map induc enorm number page fault long map fit memori figur compar algorithm hash join extrem scenario attribut refer averag map inflat million entri obsolet number object remain favor hash join map hash join draw profit larger amount memori larger scale project serv build input hash join memori larg memori configur join oper algorithm load page entireti memori extent approxim mb fit addit memori avoid partit step flatten written disk partit compar oid map techniqu figur compar oid map techniqu discuss sect combin algorithm hash tabl map show perform step step occur memori mb mb scan merg oper reach optim amount memori step occur algorithm omit partit phase oid map structur complet cach memori total size smaller hash point reach smaller memori size curv gener due higher cpu cost tree lookup direct map approach cheapest partit step omit memori size mb due compact map compact storag map reduc total number call cpu overhead singl map lookup cheaper direct map map techniqu logic oid comparison physic oid assess algorithm logic oid turn physic oid perform function join physic oid compar function join logic oid physic oid simplifi extra due prefix compress special split procedur sect entri page hash tabl process map lookup oper omit algorithm physic oid partit oid naïv object hash join independ kind oid fig includ plan logic oid realiz direct map naïv plan show rang run time partit plan similar hash queri perform significantli pm plan perform slightli plan logic oid addit cost map lookup low level mb pm plan cheaper physic oid advantag incur sever perform penalti presenc forward experi shown fig studi instanc vari object migrat rang figur show plan fairli robust forward high cost level forward object multipl hit forward object plan plan alloc addit page load forward object sect plan alloc buffer partit forward approach partit pm behav similarli line retain advantag plan logic oid shown low level forward refer logic oid superior physic oid function join figur show perform run queri return result order attribut evalu pp queri evalu plan flatten nest perform function join map sort result plan combin partit sort perform function join algorithm final merg gener desir order result queri evalu plan requir extent cluster perform automat deliv tupl desir order plan requir configur cluster index sort attribut requir evalu plan slower convent evalu plan perform function join sort result factor longer plan differ plan pronounc mind plan reli exist physic convent plan requir summari paper overview assess altern techniqu function join implement techniqu logic oid contrast physic oid realiz altern evalu techniqu refer attribut relationship typic repres nest set refer separ relat pure relat model queri nest refer set requir retain implicit group set refer algorithm base success partit merg develop algorithm retain group partit restor group merg oper algorithm adapt algorithm evalu exploit exist order object extent sort evalu plan prove effect optim join cardin larger sort cardin case evalu function join nest refer set enhanc function join plan reduc size intermedi result techniqu bypass larg attribut sort relat join process earli aggreg applic queri quantit assess base detail cost model prototyp implement prove algorithm appli group preserv order preserv superior tradit method experi demonstr penalti logic oid system low compar physic logic oid significantli physic small percentag object migrat acknowledg anonym suggest improv paper stefan point perform enhanc sequenc refer kemper evalu function join nest refer set objectori proc conf larg data base august pp process bertino kim index techniqu queri nest object ieee tran knowl data eng bayer mccreight em organ mainten larg order indic acta informatica high perform configur storag manag proc ieee conf data march pp brown rosenberg persist object implement techniqu shaw zdonik implement persist object principl practic morgan san pp cluet delobel gener framework optim queri proc acm sigmod conf manag june san pp carei dewitt franklin hall naughton solomon tan tsatalo white shore persist applic proc acm sigmod conf manag pp carei dewitt richardson shekita object file manag exodu extens system proc conf larg data base august pp kemper kossmann hash sort free technic report germani cluet moerkott classif optim nest queri object base technic report rwth germani ubiquit acm comput carei shekita lindsai increment join attach starburst proc conf larg data base august pp dewitt lieuwen mehta parallel join techniqu orient proc int ieee conf parallel distribut inform januari san pp du hc dynam hash scheme acm comput kossmann perform evalu oid map techniqu proc conf larg data base septemb pp kemper kossmann find data neighborhood proc conf larg data base august pp gardarin tang select path express process algorithm proc conf larg data base septemb pp scholl mh queri evalu calculu algebra coincid proc british nation confer juli pp grai reuter transact concept techniqu morgan san calif implement gener access path structur relat system acm tran syst haa carei livni shukla seek truth ad hoc join cost vldb harri ramamohanarao join algorithm cost revisit vldb zdonik segment memori system acm tran inf syst system technic summari system metro mn copeland gp object ident proc acm conf orient program system languag novemb pp keller graef maier effici assembl complex object proc acm sigmod conf manag pp kemper moerkott access support object base proc acm sigmod conf manag april atlant pp litwin linear tool file tabl address proc conf larg data base octob pp lamb landi orenstein objectstor system commun acm server concept manual oracl redwood calif li ross ka fast join join indic vldb maier graef shapiro daniel keller issu distribut object assembl dayal valduriez distribut object manag workshop distribut object morgan san pp maier stein develop implement dbm wegner research direct program mit pp technolog technic overview system versail franc object technic version june patel carei accur model hybrid hash join algorithm proc acm santa pp aper ra de join queri oodb proc conf larg data base septemb pp shekita carei perform evalu join proc acm sigmod conf manag atlant pp segev optim tempor relat proc conf larg data base pp stonebrak great wave morgan san calif valduriez join indic acm tran syst object technolog octob william memori architectur shaw zdonik implement persist object principl practic morgan san pp xie han join index hierarchi support effici navig orient proc conf larg data base septemb pp
AI/282 2 manag robot autonomi interact motiv visual commun michaud vu depart electr comput engin universit de ext abstract autonom mobil robot oper everydai life condit face huge varieti situat interact agent robot flexibl robust method manag goal adapt control mechan face world commun order inform world paper describ approach base gener architectur intern variabl call manag goal autonom robot variabl basi commun visual commun system experi pioneer equip visual signal present introduct design autonom mobil robot oper unmodifi environ specif engin challeng problem dynam unpredict condit occur constantli everydai robot inhabit market place real life set face appropri robot goal recharg clean forag manag situat experienc time criteria robot oper everydai set requir abil interact human type possibl commun intent inform modul respond parallel sensori inform priorit arbitr mechan shown provid robust perform robot oper complex dynam environ challeng design behavior make robot deal flexibl environ robot mechan make stabl world reason abstract level goal intent hybrid delib robot architectur design successfulli valid bonasso murphi show system benefit abstract knowledg basic principl make coupl behavior reconfigur behavior reason knowledg preserv fundament principl emerg robot cope adequ experienc real world research activ motiv goal develop mechan architectur methodolog ensur robust control account understand natur world intent focu mechan manag goal serv basi commun mechan base intern variabl call monitor special condit influenc goal extern behavior influenc motiv inform world sourc inform obtain commun request messag agent chose experi visual signal devic understand advantag limit commun method open complementari standard commun media radio visual percept interlocutor mean agent share motiv establish context inform commun paper organ section describ architectur section present detail mechan implement motiv section describ properti visual commun system section present experi illustr motiv commun section discuss approach futur research issu section summar relat section conclud paper architectur methodolog base intent select behavior architectur design primari object develop gener framework combin properti preserv underli principl shown figur abstract level built top behavior connect sensori inform action behavior agent skill respond situat encount environ behavior run parallel result command combin arbitr mechan motor schema fuzzi logic michaud al gener control action agent modul cognit extern situat motiv sensat command final select intern paramet behavior exploit recommend level behavior level motiv level behavior activ figur gener framework architectur base repertoir modul architectur chang select behavior reconfigur agent goal situat encount world novelti architectur methodolog compar method behavior coordin recommend level modul behavior recommend monitor condit chosen modul condit monitor effect agent extern situat modul evalu sensori inform affect behavior select modul select behavior base motiv possibl correl perceiv event recommend call exploit acquir knowledg environ plan prepar behavior knowledg influenc perceiv condit motiv intent agent kind knowledg incorpor modul topolog map environ al model dynam nonstationari environ matar michaud matar cognit recommend influenc inform behavior intern paramet reconfigur specif behavior link modul recommend activ inhibit behavior desir measur undesir measur behavior measur make prevent conflict recommend occur parallel independ evalu recommend modul rule recommend modul actual activ behavior determin final select modul base measur level architectur motiv level made motiv modul motiv modul monitor agent goal coordin proper work modul word chosen refer prompt agent act method manag motiv emot mae implement modul motiv influenc environ intent agent behavior recommend knowledg world cognit observ effect behavior influenc relat link call behavior refer behavior behavior activ activ behavior particip control exploit control agent react sensat control rule activ behavior exploit command affect action agent observ exploit behavior time serv abstract interact environ matar michaud matar motiv affect behavior activ influenc directli final select modul procedur modul design agent capabl princip modul link experi report paper outlin depict bold figur subsumpt architectur behavior level simpl rule deriv behavior recommend extern situat modul final select modul activ behavior desir boolean valu desir undesir mechan commun implement motiv modul cognit present section mechan motiv work motiv system ferber shown good balanc plan reactiv achiev intern variabl activ inhibit factor similar approach variabl call motiv motiv goal agent activ level motiv modul architectur affect behavior agent motiv energi level map function determin activ level energi level activ level motiv rang energi level influenc sensori exploit behavior activ commun inform decod cognit cycl time cyclic energi level comput equat em repres influenc weight affect motiv motiv monitor simultan critic condit goal care map energi level activ level direct em effect determin activ conflict manag inhibitori influenc motiv modul mechan requir care assign weight avoid creat oscil loop ensur agent suffici time work accomplish goal indirect map determin activ level motiv base energi level set motiv method experi consist set motiv set highest energi activ motiv remain activ energi level drop visual commun motiv commun defin intent exchang inform brought product percept sign drawn share system convent norvig act transmit inform call explicit commun arkin explicit commun agent issu request command make acquir inform world agent goal concern commun influenc inform commun affect commun handl nondetermin norvig request command inform commun accur balch arkin commun significantli improv perform inform environ complex commun strategi offer benefit simpl motiv current state goal rich simpl abstract establish share mean commun social behavior agent motiv commun influenc inform commun issu involv commun medium radio link electron media sort norvig mobil robot commun characterist taxonomi present milio wilk electron commun method consid high commun requir posit high commun rang mobil robot oper everydai set interact agent natur wai commun involv special modif environ visual commun physic agent equip vision system visual signal devic possibl experi technolog progress camera technolog special vision number mobil robot capabl detect edg color region visual signal devic simpli consist color light robot turn code protocol visual commun import low small influenc commun strategi simpl arkin limit amount commun constraint messag made rich abstract inform motiv amount data transmit low bandwidth consid advantag robot requir process fact agent close establish context commun commun complet descript agent perceiv addit inform commun experienc interlocutor ffl visual commun robot posit agent involv commun posit signal detect field view electron devic gp radio triangul requir engin establish rel posit agent environ ffl compar color system robust light condit environ daylight condit illumin sourc easili identifi obstruct field view signal devic radio difficult monitor ffl visual commun discrimin object agent color identifi occur object color present environ discrimin ident agent limit number specif color combin color detect vision system visual signal code protocol distinguish agent object ident agent commun discrimin individu oper environ ffl languag human easili interpret commun robot commun robot signal devic flash light interpret listen code gener behavior recommend vision signal signal devic code dictionari influenc factor motiv behavior level cognit modul activ level motiv rotat figur commun behavior subsystem cognit modul figur show visual commun implement architectur framework cognit modul manag commun behavior commun listen behavior posit robot front interlocutor track visual signal perceiv translat sequenc visual signal code made small repres long repres silenc sec signal start maximum sec detect start end code transmit signal behavior turn gener make signal devic amount time code transmit cognit modul agent program implement encod messag commun protocol norvig agent decid commun motiv base activ encod motiv dictionari transmit code signal devic activ signal behavior give listen decod messag perceiv determin affect agent influenc motiv cognit modul decid agent listen recommend activ listen behavior protocol oper mode summar state diagram repres figur commun request signal intent commun messag transmit turn signal devic sec sec cognit modul set desir signal behavior code sec commun acknowledg listen perceiv decod recogn intent acknowledg transmit back signal decod signal cognit modul set desir listen behavior acknowledg transmit set desir signal behavior give code transmit messag commun signal recogn acknowledg listen perceiv signal decod listen cognit modul code transmit signal behavior listen decod interpret code determin influenc motiv listen stop listen code recogn signal perceiv listen decid stop commun send code signal desir measur signal listen behavior set signal listen termin commun commun signal intent listen listen code messag commun commun request incorrect code intent code perceiv signal incorrect code code signal commun signal listen intent messag commun signal code incorrect code intent code incorrect code code silenc end perceiv signal listen figur state diagram commun protocol experi experi perform real world interfac pioneer mobil robot shown figur equip fast track vision system regular gripper visual signal devic vision system channel train recogn specif color process vision system evalu posit area blob detect channel robot input robot program mar agenc reactiv languag program multipl concurr process behavior figur pioneer robot equip visual signal devic camera robot move forag pink block bring specif locat identifi twelv behavior addit commun behavior shown figur accomplish forward make robot move make robot explor environ make turn random valu random follow move orang move green make robot follow wall side grasp grasp object search track pink drop drop object avoid avoid obstacl detect rest stop robot backup move stall make small turn robot stuck motiv goal robot gripper collid object object move monitor condit robot move emerg behavior avoid exploit long period time sign difficult oper condit environ al map function motiv behavior handl situat recommend modul base activ level motiv preset threshold goal repres manag indirect map method section goal priorit time factor influenc motiv summar binari condit factor experi report weight condit relat excitatori inhibitori sign relat factor weight influenc energi level motiv experi valid approach motiv weight set arbitrarili uniformli small influenc evalu continu period time affect motiv high requir asynchron event receiv request interlocutor factor motiv energi level activ motiv eventu motiv activ ffl wander activ motiv request commun interlocutor exploit avoid behavior robot sign robot interf move difficulti environ activ motiv wander ffl forag activ motiv wander pink block home region robot forag request commun interlocutor improv forag time exploit forag behavior indic robot block home region activ motiv forag ffl activ motiv forag detect object sonar request commun interlocutor exploit behavior activ activ motiv ffl activ motiv detect object follow robot request commun interlocutor exploit follow behavior object move activ motiv command issu directli fulli forag set energi level activ motiv motiv highest energi level energi level motiv process sec figur human interlocutor commun pioneer robot flash light time robot commun valid approach robot commun human interlocutor equip flash shown figur flash light signal pink circl inch diamet cylind made black paper surround flash light limit signal robot perceiv signal flash light distanc feet feet darker maximum angl listen signal limit field view maximum angl orient flash light robot detect perform limit feet illumin condit vision system difficulti detect color test implement robust time variat short long signal human interlocutor commun flash light type commun act robot commun state interlocutor robot behav goal state commun high activ level distress signifi robot altern difficult situat order robot commun code state distress commun back motiv short period time chang behavior select inform commun interlocutor protocol section commun robot code motiv descript factor influenc goal energi distress energi wander energi forag energi energi figur energi level motiv time commun robot accomplish goal period situat experienc robot frequent detect eventu remain activ time proport abil robot wall request commun interlocutor effect goal depend energi level motiv figur show energi level motiv experi initi motiv activ commun occur interlocutor commun code forag energi level motiv energi level reach robot continu goal continu longer human interlocutor commun request sec sec robot detect result energi level energi level wander excitatori effect activ energi level drop forag highest energi reflect prefer user request earlier interlocutor commun request robot finish forag interlocutor activ motiv sec prefer request made effect earlier situat experi continu request made wander select goal note robot encount difficulti energi level distress interlocutor block robot energi level distress robot behavior back situat reach robot commun motiv hope receiv figur show result obtain experi similar condit activ motiv robot receiv request forag request energi level drop favor receiv excitatori influenc previou activ request made sec sec motiv activ sec request made motiv activ sec note request made interlocutor carri influenc influenc condit request made priorit goal request wander energi level forag good posit motiv activ futur energi distress energi wander energi forag energi energi figur energi level motiv time discuss result present paper demonstr motiv visual signal devic method robot autonom decid base situat experienc commun inform agent awar experi requir valid approach complex simpl experi insight visual signal devic commun reveal restrict rang interest commun robot commun easi understand commun detail relat goal commun level abstract visual signal contribut believ autonomi robot found reward commun robot locat oper environ work constitut step research issu ffl studi dynam motiv issu kind influenc weight occurr conflict manag histori past influenc plan goal agent experienc commun agent establish time agent accomplish current accomplish goal fulfil goal ffl visual commun robot benefit advantag present section social behavior commun protocol commun ident complet code protocol reason mechan commun inform chang influenc motiv depend ident signal current motiv valid ffl establish perform measur robot accomplish multipl goal oper open environ perform evalu long period give time robot accomplish influenc goal affect behavior work aspect understand requir design autonom robot interact open unconstrain occur everydai life set relat work motiv variabl autonom agent ferber gener group behavior parker compar mae breazeal add energi level map function determin activ level motiv mechan manag conflict group motiv close approach influenc concept psycholog associ behavior behavior activ modul base activ level behavior exploit behavior influenc motiv visual wang present messag protocol displai devic robot perceiv nearbi robot valid model decentr mechan consid natur interact autonom robot del simul learn architectur cooper light signal behavior balch arkin discuss conic mirror camera marker light enabl robot discrimin attractor obstacl result physic robot report simul effect constraint limit field light posit interpret time dynam environ adequ commun process work make investig feasibl implement approach actual robot paper describ approach base gener architectur intern variabl call manag goal autonom robot motiv basi commun visual commun nice complement wai commun approach enabl robot reconfigur behavior face environ inform commun artifici human constitut step achiev goal design robot oper everydai life condit futur work involv approach gener social behavior multipl robot exploit advantag visual signal devic find methodolog combin visual commun commun understand relationship interact adapt acknowledg research support natur scienc engin research council canada author robot comment refer mit press reactiv multiag robot autonom robot motiv system regul aaai robust layer control system mobil ieee journal robot autom artifici intellig multipl agenc reactiv technic robot action select autonom agent hierarch distribut reactiv plan conf autonom pp taxonomi swarm intl conf intellig robot system san pp artifici intellig mobil mit press situat agent autonom theori form biologi engin mit bradford pp approach adapt robot behavior dynam conf autonom pp histori mobil robot special issu learn autonom machin learn robot control architectur combin motiv situat autonom intl conf simul adapt mit pp del signal behavior special cooper adapt behavior design journal advanc robot ed artifici intellig modern fuzzi logic autonom robot soft comput base commun distribut robot ieee intl conf robot pp
DB/283 3 approxim queri translat heterogen inform sourc kevin cc chang electr engin depart hector comput scienc depart stanford abstract paper present mechan approxim translat boolean queri constraint heterogen inform sourc achiev translat challeng sourc support constraint formul constraint translat queri translat approxim unlik gener framework adopt customiz metric translat combin recal result show queri translat handl interdepend queri conjunct disjunct identifi essenti requir rule system user encod map atom semant unit algorithm translat complex queri rewrit term semant unit show practic algorithm gener approxim translat respect close metric choic present case studi show techniqu appli practic introduct enabl mediat system integr heterogen inform sourc data search capabl mediat present unifi context uniform inform translat origin user queri unifi context target sourc nativ execut translat problem critic materi base work support nation scienc foundat grant nsf ii permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb wide rang dispar sourc click internet achiev translat challeng sourc constraint formul constraint translat paper present framework find perfect map gener account differ attribut data format mediat integr onlin shop site video base case studi section mediat present unifi view user find item actor translat constraint mediat find perfect map translat sourc case perfect map simpli exist sourc eb translat scheme focu map return potenti answer unwant answer mediat map search return vh dvd item superset map eb true return entir sourc unaccept good approxim favor eb approxim match harrison eb requir miss answer harrison harrison user map true return huge number dvd vh item map simpli vh textual descript map return lot data miss vh item mention vh altern map attract view queri boolean express constraint select form op join form op discuss stress approach gener handl join constraint constraint constitut queri transform constraint understood target sourc constraint map attribut map score valu convert score grade oper transform refer detail gener model problem common mediat architectur studi queri translat earlier work implement realiz approxim translat critic applic earlier work map exact result recov superset case approxim practic strictli correct concurr system strict serializ result undesir low case studi scenario inform estim translat reli approxim mediat applic close criteria map essenti translat system flexibl support wide rang close metric paper present approxim translat found virtual reason metric framework support criteria customiz criteria quantifi expect occur analog fashion convent ir paramet recal quantifi execut singl queri result show flexibl cope interdepend queri conjunct disjunct critic note queri map simpli matter translat constraint separ interrel constraint form handl discoveri previou studi show queri disjunct translat significantli simplifi translat process approxim translat interrel depend close illustr continu movi search user vh dvd format queri denot closest map close queri mediat adopt gener translat mediat separ map disjunct translat assum mediat concern larg result illustr map mediat close approxim translat map good vh dvd titl close metric translat separ lead suboptim disjunct queri translat reli human defin constraint translat basic semant unit rule translat pattern rule composit kind queri constitut paper answer identifi essenti requir translat rule system base challeng translat arbitrari queri boolean express constraint handl approach present algorithm origin queri semant translat rule note lead closest map run translat rule semant unit translat queri nv queri express appli rule obtain solut optim translat answer question paper make main contribut approxim queri gener defin notion translat close framework adopt close metric applic present algorithm systemat find translat respect close metric algorithm find uniqu practic case semant unit develop fundament theorem separ queri safe decomposit result critic develop algorithm attempt approxim queri translat studi estim recal paramet show reason formula exist estim briefli discuss relat work section start section defin close criteria combin recal section studi basic assumpt composit monoton result composit separ section present framework algorithm section conclud case studi show approach appli practic note due space leav detail import result support directli formal proof extend report relat work inform integr activ research area focu constraint map problem uniqu integr system dealt sourc inform manifold tsimmi infomast garlic disco effort gener queri plan observ grammar restrict nativ queri conjunct disallow work complement effort address semant map analog translat vocabulari nativ output semant map constraint vocabulari understood target input capabl map analyz refer addit detail distinguish focu constraint map problem integr effort approach appli common mediat architectur work data translat schema integr main focu relat effort unifi data mismatch domain transform data unifi queri perform complementari goal map queri nativ domain data resid approach suit autonom sourc larg volum found web econom feasibl transform note constraint map problem data queri capabl map section translat error consid tradit schema data translat work approxim critic queri map virtual translat effort stress notion approxim studi queri work aim reduc process cost approxim refer studi approxim fixpoint datalog approxim predic filter research explor approxim queri answer reduc time refer develop framework repres approxim support queri explor queri relax figur venn diagram queri map mate answer defin translat metric base paramet recal classic notion commonli quantifi notabl inform retriev measur ir effect section approxim translat discuss paper motiv previou work section earlier model map significantli simplifi translat accommod gener close metric paper specif explor notion deal map virtual reason close metric queri account recal goal queri map find closest translat origin fulli express target quantifi close map approxim origin queri close criterion return normal close higher rate closer approxim framework wide varieti close function discuss intuit import map closest map respect close criterion map ti broken denot closest map approxim erron introduc compar origin queri figur illustr error venn diagram result set queri map quantifi ultim defin metric measur proport map result jq jm denot size result set queri jx paramet captur compon approxim error figur reduc number recal measur proport correct result retriev jq jqj dual recal captur higher recal correspond fewer note paramet normal jan feb mar apr jun jul aug sep oct nov dec month term correspond term jan feb mar apr jun map figur map term constraint constraint translat calendar system time origin context term target figur show correspond origin context year consist term constraint repres feb target divid year match jan feb illustr map queri figur note cover cover jan jun addit incur eq recal eq estim cover month month equal subset figur dual superset subset map impli perfect high cost lower map perfect perfect recal similarli comput note incur quantifi translat reason metric account compet goal recal defin close criterion function recal applic focu requir recal threshold denot import class close function threshold defin undefin map close similarli recal close invalid map assum repres relev map highest close wrt similarli defin undefin class repres intuit import close metric stress special instanc typic adopt queri applic requir perfect recal subsum goal find map highest subsum queri refer minim subsum map tight upper envelop design retriev minim superset applic requir map return implement close criterion perfect unlik goal find maxim subsum map tight lower envelop refer close criteria determin map closest show calendar applic wrt obtain undefin adopt addit intuit reason criteria function defin adopt averag arithmet averag error measur harmon correspond convent measur inform retriev stress gener framework assum metric requir close criterion map paramet map recal captur reason close metric sampl function satisfi monoton support framework discuss due space queri composit section address fundament answer build approxim queri translat machineri question composit monoton translat queri comput translat independ translat depend fact eventu intersect question gener find translat queri separ translat compon composit monoton queri composit qn oper assumpt reduc search space translat assumpt queri composit qn closest map respect close criterion map mn assumpt search focu build map map search translat affect term assumpt decomposit good studi issu section map decomposit close formal verifi assumpt proof gener hold case assumpt individu lead assumpt valid closest map construct separ compon composit algorithm assumpt harmless stress rare except remain good map composit separ translat queri composit qn handl subqueri separ case obtain map simpli translat compon individu turn separ depend close metric chosen result disjunct separ figur closest map requir perfect recal dual conjunct separ requir perfect due space refer refer formal result simpli illustr queri calendar system compar disjunct conjunct separ figur show closest map show determin turn disjunct verifi obtain opposit conjunct figur disjunct metric conjunct disjunct separ gener framework flexibl approxim metric cope potenti insepar type discuss framework algorithm section present framework algorithm approxim translat section defin translat rule system codifi map basic semant unit base algorithm rewrit origin queri semant unit construct closest map rewrit respect composit separ ensur map section present algorithm semant translat rule queri translat base human resolv semant heterogen section identifi essenti requir rule system codifi human illustr rule base mechan design earlier specif map adapt emit emit emit emit emit emit emit emit emit emit figur map specif med respect mechan handl semant unit complex gener approxim translat stress contribut rule system integr gener queri map scheme rule system simpl note algorithm work rule mechan satisfi sound complet requir framework adopt sophist rule support queri pattern conjunct arbitrari number simpl system suit queri translat demonstr case studi section figur show map specif med consist rule translat queri search media item video real scenario section discuss assum rule defin closest map respect match queri illustr section typic rule queri figur show estim map stress algorithm requir numer valu comput map quantifi actual close output estim base rule techniqu illustr rule translat media format origin context expect format disc vh dvd target accept media type video format constraint atom rule defin map access vh dvd vh account eq close map simpli keyword desc textual descript vh descript mention hand vh item closest map respect relev map rule simpli match format constraint left side defin respect side notic queri pair format map perfectli type construct perfect map queri form semant unit rule defin translat left match disjunct pattern satisfi condit pair format match side find type function emit note assum condit function implement extern program languag implement discuss assum origin queri med run figur queri vh dvd titl tom hank tom note omit oper notat map begin match rule find subqueri construct illustr match med rule med find subqueri med match pattern rule med match complex queri perform match normal dnf normal chosen cnf conjunct normal form choic affect structur section write med dnf compar dnf pattern rule note dnf form dn write stress similarli med figur framework rule specifi dnf pattern form dm rule pattern determin rule pattern match subqueri med pattern repres check vd tc med match queri dnf rule match rule output vd vd tc tc match map figur queri med match respect med ent queri note simpl simpler complex match part pattern match bound constant simpler similarli match simpler match subqueri vd figur med match repeat process rule find match figur match med dnf figur summar match rule output estim figur algorithm paramet valu comput enabl queri assum essenti requir semant rule requir rule defin closest map match queri respect refer sound requir rule gener sound determin sourc statist perform sampl estim recal map highest simpli make intuit practic close function explicitli requir defin map section discuss requir rule semant refer complet enforc rule suppli semant unit queri closest map construct subqueri semant unit queri map manual defin rule note individu constraint semant med describ unit semant unit composit queri separ result show queri composit insepar form depend disjunct separ formal semant unit rule interrel expect semant unit conjunct section close metric disjunct conjunct semant unit complex queri case unit complex simpl disjunct conjunct med algorithm gener handl complex unit stress sound complet requir enabl analog approach origin queri match semant unit simpli fire rule comput denot rule output match sound requir ensur match rule match complet requir semant unit construct semant unit subqueri med match subqueri shown figur semant unit build block construct med construct complex map main challeng discuss algorithm base algorithm section present core algorithm queri translat framework base rule system algorithm construct map queri semant unit construct complex essenti rewrit semant unit queri med construct map unit tc vd figur med tc vd denot rule output match rewrit med boolean function tc vd tc vd rewrit logic med refer rewrit break queri semant unit base decomposit simpli construct med tc vd exist decomposit tc med queri map find safe composit med tc vd dnf normal med rule match med safe disjunct map construct safe conjunct med tcd med tc vd tc figur algorithm figur illustr algorithm queri med respect rule med separ optim map construct straightforwardli simpli separ deal semant unit rule note safe decomposit shown result determin med obtain med tc vd separ composit appli rule unit construct map form med tc vd main challeng map queri find safe decomposit result theorem show practic exist safe decomposit queri algorithm find uniqu decomposit construct closest map queri map rule output closest map respect close metric defin refer figur formul safe decomposit step step final step construct illustr translat med med defin map figur summar show input output step algorithm essenti base boolean normal form systemat rewrit queri safe decomposit figur start normal input queri dnf step final formul safe decomposit cnf semant step note structur dual algorithm start cnf conclud dnf summar work step normal med step perform rule match section discuss result match unit figur rewrit med safe decomposit cnf simpl tree root conjunct leaf disjunct ensur cnf rewrit step form separ conjunct safe similarli step form separ disjunct safe leav step rewrit med conjunct form figur med step rewrit result conjunct separ disjunct semant conjunct tc vd illustr formul safe decomposit tc vd algorithm simpli construct med discuss explain step algorithm function rewrit input queri conjunct separ determin conjunct develop suffici condit safeti impli separ due space leav refer safeti formal simpli stress conjunct step formul satisfi formal safeti condit separ eventu form safe decomposit med semant unit figur form safe decomposit conjunct note med unit written conjunct explicit leav queri med figur show rewrit unit vd omit subexpress redund contribut rewritten med goal formul conjunct root queri rewrit step simpli distribut outer disjunct conjunct standard boolean omit obtain conjunct form med conjunct show conjunct safe step determin conjunct readi step algorithm rewrit test written sum unit essenti safe disjunct step refer figur unit vd write sum vd similarli shown result conjunct written call simpler conjunct queri wx match unit wx algorithm base queri map ffl arbitrari queri origin context ffl constraint map specif target system wrt close criterion closest map wrt dnf ffl convert dnf pm simpl conjunct constraint rule ffl match output fire rule semant unit ffl find match mu wrt note ij safe rewrit safe conjunct ffl conjunct form safe disjunct safe ffl ck rewrit ck xm ck match ij ck found omit redund st cover subset term ffl ck safe term match unit map ffl comput fire rule relev match ffl mu output construct map function pm rewrit queri dnf safe conjunct cnf conjunct rewrit dnf disjunct match found ffl rewrit ij ij disjunct dnf step ij ij simpl ij simpler st ij omit ij simpler cnf standard boolean algebra convert conjunct form ffl rewrit cnf term ij st xm denot ij formul omit redund cnf st ffl oe store formul conjunct ffl xm formul fm ij cg found st ij cg safe disjunct step rewrit perform rewrit ffl return rewritten safe figur algorithm approxim queri translat wx yz rewrit conjunct written simpli conjunct call rewrit conjunct written process eventu termin produc separ deriv strictli simpler subqueri illustr termin simplest form disjunct atom constraint trivial sum unit refer refer formal proof conjunct formul separ form safe conjunct step algorithm focu disjunct step illustr continu step rewrit conjunct safe disjunct discuss result disjunct satisfi formal safeti condit refer step ensur written sum vd remov redund term vd vd obtain vd rewrit tc show disjunct turn semant unit disjunct formul safe separ rare interlock safe decomposit exist step form safe disjunct major result disjunct decomposit safe construct safe algorithm gener illustr base optim map semant unit sound respect constraint depend unit preserv optim queri optim map result show vast major semant unit queri uniqu safe decomposit algorithm find uniqu decomposit construct closest map refer refer proof theorem safe queri map specif wrt close criterion interlock semant unit match exist uniqu safe decomposit wrt algorithm find safe decomposit output interlock safe decomposit exist theorem state queri involv interlock safe decomposit note found unsaf decomposit complet requir section assert construct decomposit semant formal defin interlock illustr definit set semant unit exist mn dnf dnf ij ij overlap strictli simpler ij strictli complex simpler mn cnf cnf ij ij ij queri xy match semant unit xy note unit interlock exist involv conjunct xy disjunct show interlock definit xy condit term satisfi respect term similarli term respect term term strictli complex subexpress satisfi cnf cnf cnf condit hold safe decomposit theorem interlock rewrit semant separ disjunct xy conjunct remain xy break depend safe fail safeti condit break xy unsaf safeti condit interlock case rare practic intuit note interlock occur unit xy interlock happen constraint particip conjunct unit xy disjunct unit interlock form unit semant unit repres interdepend complex interlock practic case studi real map system section observ instanc interlock safe decomposit algorithm construct address except case simpli requir interlock queri xy defin rule find unsaf estim close select note estim paramet close construct show estim techniqu due space limit conclud analyz run time algorithm step step subroutin perform dnf cnf gener exponenti number queri constraint boolean satisfi problem studi practic algorithm literatur queri practic normal effici step algorithm effici run linear time input queri rule input dnf step dq nq number disjunct dnf dr nr dnf queri pattern rule number rule input size step time algorithm match pair constraint factor pair queri rule disjunct factor rule factor step run cq number cnf conjunct upper bound step number match found step step simpli time practic case studi verifi framework make explor sourc web studi gener framework specif map system demonstr map rule repres scenario concret understand practic issu number rule typic approxim essenti practic case target bn emit emit emit emit emit emit emit target socrat emit emit emit true target eb emit emit emit emit emit emit true figur rule map amazon sourc studi base similar scenario onlin demonstr translat server section mediat build mediat integr onlin sourc amazon bn onlin eb comparison shop socrat librari onlin publicli scenario assum mediat integr sourc adopt amazon queri context translat sourc demonstr constraint map amazon socrat target compar constraint vocabulari support constraint specif queri interfac amazon defin map rule figur rule rule rule eb section rule map match semant unit respect close assum practic requir explicitli close discuss section rule map constraint attribut format amazon context format bn context note defin map focu cluster attribut context cluster fng amazon correspond amazon distinguish author separ ln fn translat map note true trivial trivial map rule effect remov match unit translat queri observ case studi show framework present easili appli practic number map rule observ constraint depend exist cluster attribut fng typic simpl rule describ composit number atom constraint pattern origin context note rule queri pattern instanti start share found true studi map rule sourc share common observ instanc interlock unit section note semant unit essenti correspond conjunct ln fn versu author similarli month year versu disjunct format versu type observ attribut involv type interlock simpli occur algorithm gener uniqu map practic case framework formal support notion close function explicitli requir defin map rule semant intuit map compet choic explicitli comput close metric map defin implicit metric correspond mind stress theorem algorithm preserv optim respect close metric map rule conform explicitli implicitli case studi show gener notion approxim paper specif essenti framework observ twenti rule figur perfect ratio approxim gener framework deal type superset subset hybrid map approxim translat techniqu present paper practic studi addit scenario present case found observ hold paper present framework algorithm approxim queri translat framework robust virtual reason close metric combin recal intuit present result separ safeti queri composit cover full detail result critic develop algorithm attempt approxim queri translat algorithm gener uniqu practic case semant unit algorithm gener closest comput actual term recal paramet algorithm explicitli paramet comput essenti oper case desir estim map complement translat develop simpl formula cover present approach specif translat queri gener support broader heterogen problem framework appli map data queri ontolog studi model data conjunct queri appli algorithm data translat implement approxim queri translat mechan paper stanford digit librari project implement onlin translat server demonstr backend translat server program defin specif map demonstr translat scenario onlin media search simplifi version present section server refer wiederhold mediat architectur futur inform system ieee mar ullman inform integr logic view proc jan chang mind queri map heterogen inform sourc proc acm sigmod page june acm york chang mind queri map heterogen inform sourc technic report stanford access chang approxim queri translat heterogen inform sourc technic report stanford access hull manag semant heterogen theoret perspect proc acm page hearst trend inform integr ieee intellig sept ordil queri heterogen inform sourc sourc descript proc vldb page ordil algorithm inform agent proc nation conf artifici aug ullman mediat system base declar specif proc intl conf data ullman queri translat scheme rapid implement wrapper proc intl conf deduct page dec berlin duschka queri plan optim inform integr phd stanford dec duschka inform integr system proc acm sigmod acm york yang optim queri data sourc proc vldb page aug roth schwarz dont scrap wrap wrapper architectur legaci data sourc proc vldb page aug valduriez deal discrep wrapper function tech report yerneni capabl sensit queri process internet sourc proc intl conf data mar ullman answer queri templat bind pattern proc acm page san ullman answer queri limit extern queri processor proc acm page june resolv approach perform relat oper mismatch domain ieee tran knowledg data rosenth semant valu facilit heterogen inform system tran june wong data transform system biolog data sourc proc vldb milo correspond translat heterogen data proc mediat data proc acm sigmod conf chang conjunct constraint map data translat proc acm intl conf digit page june chaudhuri find envelop datalog predic proc acm chaudhuri kolaiti datalog proc acm chekuri filter approxim predic proc vldb page york vldb calif ooi answer proc intl conf data page poosala fast approxim queri answer precomput statist proc intl conf data page acm york carei kossmann sql proc acm sigmod carei kossmann reduc brake distanc sql queri engin proc vldb page york vldb calif watter semant complex object approxim answer journal comput system aug design implement proc acm sigmod page acm york rijsbergen inform edit salton automat text process ullman design analysi comput algorithm logic design principl prentic
HCI/284 4 virtual displai devic henk muller cliff randel eric harri februari abstract process consist arrang processor batteri insid devic applic includ interact virtual game introduct cube displai side arrang screen user object posit direct sensor insid user interact analog turn show anim lion simultan viewpoint project lion lion stai orient rel physic project updat object gener output group peopl share view virtual world difficult achiev flat prototyp devic prototyp develop wearabl comput ad singl board acceleromet detect roll electron compass detect wireless network short rang radio detect wearabl comput proxim power soni batteri pack quarter screen squar screen readili angl screen view complet expect futur screen technolog view angl extens envisag includ audio touch sensit displai experi softwar written run linux platform origin conceiv learn toi young children quickli potenti displai devic boundari physic virtual world interact virtual world object depend hold presenc cube devic interact virtual world user displai object virtual user move physic world make virtual world cat brought close physic behaviour anim virtual world chang bind object virtual space chang base user similar function wearabl len tele presenc tele video displai project person involv side project singl imag arrang view peopl angl inher suitabl share output devic inform side game larg varieti game develop cube emul develop variant bit make applic user put model model cover snow applic detect motion move abil carri virtual object physic world give rise applic foreseen expect provid platform initi serendipit event refer randel muller context awar acceleromet data fourth intern symposium wearabl octob randel muller posit base wearabl output devic technic report mar
IR/285 5 automat text classif label european law institut public intern law vienna research center comput law universit austria andrea michael institut softwar technolog vienna technolog austria abstract huge text archiv retriev system legal inform achiev wellknown structur legal commentari content classi cation text analysi remain high prioriti research topic joint som learn techniqu neural network achiev similar high compress rate cation analysi manual legal index produc map legal text corpora cluster relat document unit automat select descriptor extens test text corpora european case law shown feasibl approach cation label prove legal research grow hierarch map repres interest gener specialti legal text corpora segment document part improv qualiti label challeng chang tf vector modi ed vector account thesauri ontolog learn properti legal text corpora introduct larger amount legal document wai organ document provid comfort mean access gain import convent inform retriev system ful ll requir lawyer citizen access legal leav inform crisi law unsolv classic inform search requir user inform term complex queri result larg list document retriev present list sort relev criterion structur user accustom leav locat permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee st mi copyright acm relev document de cienci address numer research project introduc inform document organ approach automat detect topic similar structur document collect map popular neural network cluster document method shown legal applic peculiar legal domain address legal languag specialti consid classi cation summar statist characterist import word di erent text corpora articl repeat import messag relev term occurr lengthi argument point view select vector remain tricki length document requir segment structur part weight term challeng special word phrase treat attent statist evid classi cation distort document cover di erent topic longer speci section base structur document organ larg structur type document identifi wai provid content legal document de cienci relat applic som automat access legal inform system note size result larg big document collect hundr thousand articl prefer smaller map repres dedic section archiv problem mere size result hierarch structur topic locat map deriv turn disori larger collect user de nite hierarch structur document success layer detail view relev subset document topic hierarchi exist collect program capabl automat detect topic hierarchi adapt architectur system user requir addit inform topic cluster order orient result map automat extract label describ topic cluster branch hierarchi legal document step automat assign automat set content identi er document automat summar art abstract kei content nal step ambiti research agenda task aim joint research som project focu project move word disambigu semiautomat text analysi automat index summar proven feasibl classi cation label legal text corpora som paper present extend architectur organ legal document aid user nding inform legal document repositori som develop grow hierarch map exibl dynam architectur capabl adapt size hierarch layout data collect document collect repres tree interconnect individu describ part archiv detail longer repres document singl split segment multipl placement document topic branch di erent topic touch label topic section extract techniqu provid descript topic cluster guid user desir document remaind paper structur start review relat work section section provid introduct featur extract content review architectur train process selforgan map section present grow hierarch map architectur detail section techniqu extract descript keyword type map section detail present result obtain corpu document section section summar lesson learn point futur step address challeng identi ed current system relat work knowledg main task legal informat sucient bibliograph access legal document easi search huge digit librari heavili reli master terminolog neglect eld classi index summar show solut problem lawyer highli develop index instrument hand commentari citat autom task huge legal inform system main challeng research legal knowledg high qualiti commentari pose challeng automat semiautomat approach er moment limit compress facet pictur vector remain ecient statist ecient solut found legal document set tf idf weight scheme inform state art content successfulli shown project term extract modul recogn case citat fact phrase lead structur document pro le pro le transform weight vector search relat document problem approach develop project document repres featur vector form cn mo repres term extract full text repres meta rule document concept recogn match list appli heurist rule linguist templat found rule word rule facilit probabilist meta rule repres concept de ned combin rule occur document section document result weight vector give import linguist templat meta rule evalu result knowledg base thesauri rule develop knowledg reason start point infer net import case search similar document smile factor found techniqu machin learn develop linguist found project automat abstract result applic automat index due problem knowledg acquisit learn provid import guidanc limit automat index requir legal ontolog improv ontolog law fascin approach concept document organ neural speci calli map popular neural organ document content result access larg document collect legal document pose addit challeng automat organ document detail approach work legal document collect map provid conveni access legal document collect user similar document locat neighbor region map featur extract document order classi cation document obtain content common word frequenc count base full text index list word present document collect creat span featur space document repres handcraft stop word list speci frequent statist measur serv automat experi remov word document collect word contribut content word weight standard tf idf term frequenc time document weight scheme weight scheme assign high valu word consid import content analyz legal domain document highli consist peculiar term vocabulari observ legal document highli structur good segment classi cation part document give document european court justic consist titl eventu submit short content reason present reason rule court reason number paragraph order classi cation structur document split section treat independ piec inform classi cation process document assign multipl section result topic hierarchi structur inform overrul classi cation map map basic form cluster analysi produc map input data output space preserv topolog relationship input data item faithfulli model consist set arrang topolog common choic grid unit assign weight vector dimens input initi setup model prior weight vector lled random valu learn unit highest activ winner respect randomli select input pattern adapt exhibit higher activ level futur present speci input pattern activ level unit base euclidean distanc input pattern unit weight vector unit show lowest euclidean distanc weight vector present input vector select winner select winner written express arg min adapt place learn iter perform gradual reduct di erenc respect compon input vector weight vector amount adapt guid learn rate gradual time natur adapt strength ensur larg adapt step begin learn process weight vector tune random initi actual requir input space smaller adapt step end learn process enabl input space extens standard competit unit gradual neighborhood winner pragmat learn step map set unit winner tune present input pattern enabl spatial arrang input pattern alik input map region close grid output unit train process map result topolog order input pattern refer map neural network model perform spatial smooth version mean cluster neighborhood unit winner implicitli mean ci account term output unit unit winner current learn iter assign scalar rang determin amount adapt ensur nearbi unit adapt strongli unit farther winner gaussian de ne express jjr jj denot distanc unit output repres vector point locat unit grid ci exp jjr jj common practic begin learn process select larg cover wide area output space spatial width reduc gradual learn process end learn process winner adapt reduct mean paramet express strategi enabl format larg cluster begin input discrimin end learn process combin principl map write learn rule express note make discret time notat denot current learn iter part express repres learn ci repres output space input space figur som architectur train process repres present input denot weight vector assign unit ci graphic map architectur learn process provid figur gure output space consist squar depict circl input vector randomli chosen map grid output unit step learn winner show highest activ select winner unit depict black unit gure weight vector move current input vector movement symbol input space figur consequ unit produc higher activ respect input pattern learn unit weight nearer input pattern term input space adapt perform neighbor unit subject adapt depict shade unit gure shade unit correspond amount adapt spatial width unit close vicin winner adapt strongli depict darker shade gure map som proven suitabl tool detect structur data organ output shortcom mention includ inabl captur inher hierarch structur data size map determin advanc proper insight characterist data distribut drawback address separ ed architectur som increment grid grow grow grid architectur hierarch featur map approach provid architectur fulli adapt characterist input data overcom limit adapt architectur develop grow hierarch map layer layer layer layer figur evolv structur som ect hierarch structur input data dynam ts architectur structur data hierarch structur multipl layer consist independ grow map start similar grow grid grow size order repres collect data speci level detail improv granular data unit analyz repres data speci minimum level granular unit input data map expand form small grow som subsequ respect data repres detail map grow size speci ed improv qualiti data reach unit repres homogen set requir subsequ layer result fulli adapt hierarch structur inher alloc space inhomogen area input space graphic figur map layer consist unit rough organ main cluster input data independ map layer er detail view data input data map subset map unit upper layer unit layer map expand map provid sucient granular input data note map di erent size structur reliev burden prede ning structur architectur layer serv complet data set control growth process initi setup prior train process layer consist unit creat unit weight vector initi averag input vector quantiz error comput quantiz error unit deviat weight vector input vector map unit calcul euclidean distanc weight vector nc input vector element set input vector map unit nc km nc jc denot cardin set speci quantiz error singl unit layer comput detail express ni number input vector input data set ni ni regard measur dissimilar input data plai vital role growth process neural section train growth process map beneath layer map grow som creat size initi unit rst layer map train standard som train procedur section xed number train iter unit analyz high show unit input space repres accur unit qualiti input space unit highest select denot error unit row column unit insert error unit dissimilar neighbor weight vector unit initi averag neighbor growth process map subset vector input data map unit weight vector unit error unit determin unit maximum quantiz arg max nc km nc jc select error dissimilar neighbor determin compar weight vector neighbor unit weight vector error unit complet row column unit insert weight vector unit initi mean respect neighbor growth process continu map quantiz refer capit reach fraction unit upper unit constitut layer map rst layer map map comput unit quantiz error express subset map unit data nu nu ju gener stop criterion train singl map de ned quantiz error unit upper layer smaller paramet chosen longer train larger result map case rst layer map stop criterion train process paramet serv control paramet nal size map de ning map repres inform map unit base greater detail reflect hierarch structur train map unit check unit ned map layer mean unit repres set input vector map layer creat threshold determin paramet de ne data granular met unit express constitut global stop criterion train process de ning minimum qualiti data requir unit fraction dissimilar input data unit satisfi criterion requir unit fail meet stop criterion speci ed express small map layer stop criterion express hold true requir unlik stop criterion horizont growth map determin upper layer criterion base sole layer unit map input vector train newli ad map map unit expand map continu grow procedur detail previou subsect process repeat subsequ layer criterion express met unit lowest layer paramet de ne minimum qualiti unit lowest layer branch qualiti data ll minimum criterion part input automat provid requir number unit respect area transit layer number input vector train map subset vector map respect unit input vector shorten transit layer due input vector featur data expect ident input vector map speci unit featur omit train respect lower layer result increasingli smaller vector reduc train time describ cluster techniqu priori knowledg obtain inform cluster boundari provid number cluster boundari analysi method som reveal inform relev singl attribut cluster classi cation process approach determin vector element featur input relev map input vector speci unit basic determin contribut element vector euclidean distanc input vector winner weight form basi som train process method built som weight vector element resembl input vector element input signal map unit extent input signal map neighbor unit vector element set input vector map unit describ unit denomin common featur data signal unit major input signal map unit exhibit highli similar input vector weight vector highli similar select weight vector vector element input signal map unit serv descriptor unit calcul quantiz error vector comput unit accumul distanc weight vector element input signal map unit unit weight vector element set input pattern map unit sum distanc vector element vector weight vector yield quantiz error vector unit jc quantiz error individu featur serv guid relev class label select weight vector element exhibit quantiz error close result list attribut share input signal respect unit describ characterist data unit attribut serv candid label region map data mine applic base rank provid quantiz error decid select set label exhibit quantiz error vector threshold label simpli set label unit select label standard data mine text mine arena face restrict due high vector space characterist tf idf document featur high number input vector element larg number term present group document term yield quantiz error chosen label unit result label unit attribut present data respect unit data analysi absenc attribut distinct de nite goal text mine applic describ present featur cluster describ cluster featur present data determin vector element weight vector exhibit input signal map speci unit high weight vector indic import achiev de ne threshold order select attribut low quantiz exhibit weight vector thought indic minimum import attribut respect tf idf select label experi text test environ approach text collect import document european case law german french html format reason easier test german text collect document document includ di erent html format document permiss oc public european commun test feasibl cation label legal text corpora som extens experi text corpora document languag shown improv binari weight vector requir due legal document test segment split document independ split size split document result court cost disposit succe segment ground number paragraph due insuci inconsist paragraph html sourc structur part segment part byte part smaller byte discard except disposit end document segment document number sux indic part letter part segment repres document vector length word prior applic stem techniqu automat remov word document term weight tf idf weight scheme experi shown ne classi cation usabl insuci label compar label manual produc list relev word describ cluster awar method evalu larger document collect commerci exploit exist challeng improv vector legal content qualit evalu standard ir evalu method recal unsuit exploratori data chosen delphi method lawyer review comput scientist assess qualiti label exampl map label describ qualit evalu focu exist potenti futur challeng topic organ som di erent form map map map grow hierarch map evolv structur layer start map grew size unit rst layer due space present part full map give select exampl cluster label origin test translat descriptor english reason conveni flat som due experi gain previou experi som testb feasibl segment document classi cation produc result label case broad unit word word good descript content show advantag segment solut part document locat neighbor unit orient som dicult due size map map figur show interest concentr similar document segment upper left unit document segment cost disposit lower left corner head court unit upper corner repres ne cluster countri describ part case close similar unit found descript case good chosen label good case legal act notat refer unit row column start upper left corner figur flat middl lower part map figur map hierarchi special refer airport descript part case illustr descript unit case label travel organ activ word state miss list automat select fact case travel agent properli unit concern restrict transfer land ownership part document access land properti transfer act case classi ed unit relat special except access grow hierarch som deal ectiv techniqu gener specialti legal classi cation classi cation label grow hierarch som show improv compar research circl map result hierarchi depict figur grown size unit overview document collect upper left corner case distinctli figur layer map di erent term content section document appli form separ branch structur origin upper corner map branch repres topic area organ similar sexual discrimin case locat upper left area competit locat lower section branch case locat lower left corner map figur overview document descript document map unit repres detail level subsequ layer som grew size unit topic section identi ed provid tabl topolog organ facet discrimin cost judici procedur locat upper left area left side map neighbor freedom except regul mention locat lower left corner interest topic cluster relat discrimin studi incom tax topic branch cluster content similarli pick exampl closer qualiti automat select label content descript rst unit coordin denot coordin pair refer unit layer map manual assign topic map automat assign label provid unit discrimin ground sexual orient travel mother unit evid apparatu properli standard cost judici secur cost judici procedur secur cost judici procedur secur cost judici procedur crimin secur cost judici procedur secur cost judici procedur secur cost judici procedur secur cost judici procedur studi fee studi fee job public incom tax remain remain reciproc freedom nation remain remain freedom airport transit passiv freedom languag freedom person freedom nation freedom countri languag freedom person freedom nation free freedom ii free movement public secur resid free movement public secur direct direct legal remedi direct legal remedi tabl layer map unit layer reli noti drive uenc obtain unit transposit ec regul monetari busi polici unit import countri unit free movement worker free moser diploma facet case evid lack meta descriptor cover subject illustr meta descriptor discrimin ground sexual orient miss context exampl show good pictur disput issu show short descript issu prefer overview import public secur except free movement worker legal text make label legal document dicult task import word phrase long argu unit review legal legal act privileg complain month tax legal tax ad ad tax turnov main topic review legal legal act properli label descriptor give hint issu case due crucial keyword mention time di erent situat convent import topic frequent stress ect strong neighbor cluster neg ect qualiti label weaker topic cluster classi cation remain correct strong unit neighborhood document chang vector unit learn procedur unit applic rule public work contract telecommun wine sea tabl wine select label describ topic unit appropri label properli describ neighbor unit document unit document unit deal high sea strong neighbor cluster overrul label weaker cluster unit procedur context predomin label unit land ownership transfer act html addit payment health scope legal social secur nation social meta descript document addit user provid meta descript document meta tag unit part document found chosen case foreign minor languag court applic ec unit meta discrimin secur cost judici procedur freedom receiv languag languag issu part court case applic ec law unit meta bind forc ec transit custom transit transit agreement transit applic ec law ec custom direct applic law exampl meta descript document work overview note label addit inform futur work summar establish import step research segment open door sophist analysi legal segment exist strong di erenc ordinari languag legal languag case statist analysi import word long argument map deal problem account featur space lawyer highli train text analyz expect higher qualiti present tool legal research improv label qualiti segment success improv xml structur provid qualiti number paragraph court paragraph articl chang tradit binari tf idf vector modi ed vector account descriptor legal thesauri import part document chang tf idf order higher import legal term word occur reason court major advantag screen huge document collect problem show connect document detect manual research main problem remain develop knowledg base rule long step cf develop formal er high potenti improv manual develop ontolog requir high resourc focu simpl ontolog project acknowledg research support der research project oc public european commun provid document collect valuabl evalu work acknowledg refer miikkulainen increment grid encod structur featur map proc ieee intl confer neural network volum page san ashlei ad knowledg learn algorithm index legal case proc intl conf arti cial intellig law page daniel rissland find legal relev passag case opinion proc intl conf arti cial intellig law page rauber grow hierarch map proc intl joint confer neural network volum page juli ieee comput societi grow grid network constant neighborhood rang adapt strength neural process hahn mani challeng automat summar ieee novemb kohonen format topolog correct featur map biolog kohonen map massiv document collect ieee transact neural legal knowledg deriv legal proc intl conf arti cial intellig law page delphi techniqu applic merkl rauber altern wai cluster visual map workshop map page helsinki technolog merkl rauber document classi cation neural network crestani soft comput inform page physica merkl explor legal text corpora hierarch neural guid tour public intern law proc intl conf arti cial intellig law page acm miikkulainen script recognit hierarch featur map connect automat index abstract document text kluwer academ rauber label map intern joint confer neural network juli rauber merkl digit librari system abiteboul european confer research advanc technolog digit librari lnc page springer merkl text classi cation label document cluster map journal austrian societi arti cial intellig octob riplei pattern recognit neural network cambridg salton automat text retriev inform comput legal knowledg number law electron commerc kluwer law merkl learn techniqu legal document analysi proc intl conf arti cial intellig law page acm merkl remark vector legal document dexa workshop workshop legal inform system page ieee comput societi press de und datenverarbeitung crisi arti cial intellig legal legal text manag system ai neural network visual classi cation inform classi cation method studi classi data knowledg page model approach legal knowledg engin io visser editor intern workshop legal ontolog automat text classi cation label european law andrea rauber michael institut public intern vienna research center comput institut softwar vienna intern confer ai law st mi
DB/286 3 concurr control recoveri transact process manag alonso institut inform system swiss feder institut technolog switzerland schek acm symposium principl system june abstract unifi theori concurr control recoveri integr atom isol common avoid shortcom result treat orthogon problem theori appli tradit model semant rich oper extend unifi theori appli gener process arbitrari partial order sequenc transact invoc extend unifi goal provid flexibl handl concurr process parallel unlik origin unifi account activ process fact process structur requir transact properti gener tradit acid transact provid correct criterion transact process identifi kei point flexibl structur transact process impli differ tradit transact introduct convent concurr control recoveri understood problem case transact group entiti higher level transact process initi work studi atom joint flexibl transact singl process analyz concurr control recoveri practic show concurr control recoveri relat problem solv order produc feasibl solut present attempt develop theoret framework reason concurr part work fund swiss nation scienc foundat project wise base internet swiss prioriti programm commun control recoveri transact process challeng face design singl correct criterion account concurr control recoveri cope ad structur found process unlik tradit process introduc flow control basic semant element correct criteria process order constraint oper altern constraint plai role determin process execut interleav process integr invoc applic atom properti strong requir model contract crew process step contribut paper clarifi problem concurr control recoveri transact process make unreason assumpt environ start correct singl process base flexibl transact correct criterion concurr execut process gener adapt unifi unifi theori concurr control recoveri transact process extend applic model contrast approach varieti transact model paper singl model cover requir applic area transact process manag discuss realist environ idea implement transact process import applic electron commerc virtual workflow manag process support special coordin tool expect result paper practic relev varieti applic paper organ section present sampl applic scenario transact process section develop correct criterion transact process discuss impact concurr control recoveri section conclud paper motiv comput integr manufactur environ good transact process coordin subsystem bot product dbm bot dbm document bot bot bot bot bot bot bot busi softwar sap cad system test norm dbm program repositori transfer stock test construct process product process transact subsystem system read check stock human resourc write cad construct technic document cad document program conflict produc process transact schedul figur concurr execut construct process product process cim scenario ple shown figur process control develop product product product follow techniqu aim custom product deliv develop product manufactur strongli ti construct process develop step design part final test subsequ technic document encompass cad product data manag system test technic document repositori product process includ manufactur step order materi product floor includ schedul product process encompass busi program repositori product dbm activ transact process servic invoc underli subsystem bill materi product gener construct process input requir product depend process exist extend notion atom show transact process provid gener notion atom tradit transact construct process figur failur detect test activ desir undo previou work includ long run design activ undo entri document cad draw facilit document altern execut technic document part test activ possibl execut altern case failur gener semant atom lead flexibl notion atom transact process reflect practic industri partner recent conclud research project concurr addit prerequisit consist interact process construct process product process execut parallel depict figur parallel import practic dramat reduc time market product depict figur activ system conflict concurr control order activ suffici recoveri depend exist product activ execut test termin successfulli test entri construct process read product process invalid activ product process product part lead sever inconsist valid construct part exist transact subsystem transact process schedul coordin transact process top transact subsystem ensur correct case failur assum subsystem function atom servic abil commit servic support phase commit protocol applic provid provid wrap applic system transact coordin agent paper concentr transact process manag top possibl subsystem problem wrap system transact coordin agent import scope paper aspect problem discuss concurr control recoveri transact process transact process execut transact process schedul top subsystem support execut local transact shown figur deriv correct criterion reason correct concurr control recoveri transact process singl framework process model subsystem limit set transact servic invok process set servic provid subsystem invoc activ return valu provid activ transact underli definit atom termin commit abort activ differ term termin pivot flex transact model case servic provid underli activ successfulli termin finit number pivot activ termin activ defin formal notion activ sequenc denot sequenti execut activ definit oe sequenc activ sequenc oe activ sequenc ff return valu ff concaten activ sequenc ff oe activ sequenc ff special case activ sequenc oe consist activ activ definit activ activ exist activ sequenc oe activ call activ order formal defin invoc activ label invoc activ definit activ exist termin abort termin commit invoc commit ensur activ fail definit activ fail invoc termin abort exist commit properti activ commit note flex transact model pivot activ activ activ process arbitrari collect activ arbitrari subsystem process adopt refin idea flex transact model definit tripl set partial order partial order defin establish altern execut path activ order activ directli notat process assum uniqu activ denot superscript index denot properti subscript indic denot process id uniqu id activ process activ process id commit process denot abort properti activ omit specif semant order process tempor mean execut commit prefer order defin pair connector start activ establish order connector evalu order constraint fail execut activ execut extens flex transact order constraint deriv respect execut altern altern execut path semant prefer order flex transact model note acycl avoid indetermin associ defin total order figur process prefer order context transact process activ order give schedul option execut altern case failur sake follow gener flex transact model process depict figur order depict solid prefer order dot line execut fail fail depict figur valid execut exist fail fail fail standard execut figur execut process singl transact process defin flex structur basic flex structur consist set activ pivot activ set activ pivot activ complet flex structur altern consist activ exist shown flex structur exist execut path execut correctli path leav effect process flex structur call process termin flex transact termin properti transact process gener semant tradit acid transact ensur eventu valid execut effect process termin notat activ process termin call activ activ backward recoveri perform success appli fail abort perform commit termin forward recoveri process termin state rec sequenc activ execut recoveri process state rec backward recoveri path sequenc activ lead activ termin process forward recoveri path set activ process execut recoveri forward call complet denot note case state consist state consist activ backward recoveri element basic flex structur multipl local activ exist activ failur activ lead execut altern prefer order abort process rec consid altern lowest prioriti consist activ safe termin abort process rec consid backward order altern execut path complet process import notion defin complet process schedul process depict figur process termin flex structur pivot activ activ success termin rec complet consist fa execut correctli success termin rec activ termin complet evalu fa process schedul correct notion conflict activ defin return valu activ definit activ commut activ sequenc ff return valu concaten activ sequenc ff ident return valu activ sequenc ff activ conflict commut commut activ perfect mean activ conflict ff fi combin fi assum ff fi commut combin fi structur process termin inform conflict process schedul defin definit process schedul tripl ps set subset activ process ps fa partial order activ order note process schedul legal execut process ps respect prefer order definit process schedul classic definit schedul implicitli includ inform properti activ pivot state process rec includ altern execut process conflict conflict conflict conflict conflict conflict figur serializ concurr execut process complet process schedul process termin commit necessarili activ consid influenc notion serializ process schedul serializ conflict serial execut process serializ process schedul cyclic depend depict figur execut parallel pair activ commut dash order process schedul order respect process schedul time evalu set process set activ fa order process schedul serializ cyclic depend process execut depict figur time process schedul serializ cyclic depend exist order evalu complet process schedul serializ transact process reason correct concurr control order reason correct recoveri failur process schedul make activ explicit appli unifi theori concurr control recoveri transact process replac abort activ process activ complet replac abort activ lead notion complet process schedul order correct activ process assum treat jointli group abort oper note abort process rec execut activ activ path abort process lead crucial differ compar standard undo procedur recoveri reflect notion complet process schedul contrast expand schedul tradit unifi theori addit compar initi schedul process schedul complet depict figur replac activ process consid commit regular activ complet process schedul process schedul recoveri path recoveri path activ backward crash activ forward figur complet process schedul activ backward recoveri path forward recoveri path activ process complet process schedul process schedul defin definit process schedul process schedul complet process schedul tripl ps set process ps ps ps set activ deriv process ps abort activ activ process treat abort ad pn end pn activ process abort process ps activ complet abort activ chang complet reduct figur complet process schedul reduc process schedul process schedul partial determin complet process commit activ complet process commit follow origin activ group abort pn pair conflict activ complet order pn activ aq complet process pq pn ps conflict true aq aq conflict activ complet complet true present process schedul complet process schedul ps depict figur complet process schedul time process group abort ad set activ consist activ activ fa complet fa complet order union complet process schedul depict figur cyclic depend complet process schedul serializ unifi theori process tradit unifi reduc criterion correct concurr control recoveri complet process schedul make activ explicit idea reduct complet process schedul elimin activ activ form activ sequenc elimin activ abort process consecut activ commut conflict definit process schedul reduc complet process schedul ps transform serial process schedul ps appli transform rule finit commut activ commut activ aq aq order replac order activ activ remov activ commit activ remov process schedul complet process schedul appli reduct consecut activ remov accord rule reduc process schedul shown figur serializ order depend process process process schedul red process schedul time depict figur complet pair conflict activ order applic reduct rule lead serial process schedul process schedul red conflict conflict figur execut process red prefix dynam schedul accord tradit unifi criterion restrict lead prefix process schedul consid definit process schedul prefix reduc process schedul depict figur prefix time process rec process rec complet execut activ activ forward recoveri path execut schedul conflict cycl elimin reduct rule reduc complet process schedul depict figur complet figur complet process schedul note strongli influenc fact activ exist recoveri classic undo procedur recoveri prefix reduc complet respect activ activ remov lead reduc schedul consist reduct prefix classic pred transact process termin order activ execut crucial section process schedul depict figur shown prefix reduc process schedul pred schedul benefit activ semant commit activ process activ longer consid commit cyclic conflict complet process schedul activ shown process schedul process depict figur activ conflict cycl activ time process process conflict exist activ activ forward recoveri path execut depict figur correct respect concurr control recoveri conflict figur correct interleav process exploit activ discuss pred complet process schedul previou introduc formal defin respect transact process termin properti goal reason correct concurr control prove process schedul pred fact serializ deal state process determin recoveri adopt notion structur transact process lead notion definit process schedul pair conflict activ succe activ note tradit case activ exist definit order theorem process schedul serializ proof theorem appendix order element conflict process execut crucial determin case recoveri forward formal gener depend lemma process schedul pred conflict activ process activ succe commit activ proof lemma appendix schedul pair conflict activ execut rec process rec lead contradict lemma violat pred criterion lemma commit activ defer respect subsystem process commit conflict activ exist activ commit cyclic depend longer commit activ perform atom exploit phase commit protocol order ensur activ commit analyz pred execut activ complet process schedul lemma restrict execut activ activ order origin activ lemma process schedul pred conflict activ activ complet process schedul order activ proof lemma appendix activ recoveri addit restrict activ state rec activ state rec consid lemma process schedul conflict activ activ execut complet proof lemma appendix back initi cim present section formal criterion classifi execut depict figur incorrect pred criterion hold order product activ defer commit construct process unlik tradit unifi theori consid abort transact expand activ schedul complet process schedul built exist pair conflict process undo oper conflict activ transact tradit conflict transact exist conflict process introduc unlik tradit unifi complet process schedul consid reason correct process schedul transact process criterion order introduc order reason correct concurr control recoveri schedul expand schedul activ complet process criterion reli inform schedul exist transact process arbitrari conflict introduc activ abort process consid reason correct concurr control recoveri transact complet process schedul consid evalu pred criterion parallel conflict activ process model sequenti execut activ unrestrict parallel definit process consid tempor order conflict activ order weak order composit system theori appli respect hierarch schedul type encount execut transact process top transact subsystem output process schedul input lower schedul transact subsystem reflect case fork schedul strong order enforc sequenti activ invok previou weak order activ mean activ execut parallel long effect execut strong order differenti strong weak order made process conflict activ process pair conflict activ weakli order composit transact model subsystem weak order execut conflict activ parallel order ensur weak subsystem provid protocol support commit order serializ commit order deriv weak order conflict activ weak order support weak order strong conflict activ execut respect strong order activ lead special treatment activ execut parallel activ execut subsystem local transact termin abort oper local transact correspond activ run parallel respect weak due failur lead except lead altern restart complianc weak order transact integr composit system idea process model process schedul detail paper framework jointli reason correct concurr control recoveri transact process order ensur gener notion atom flexibl handl failur altern execut correct interleav parallel process unlik approach address part cover atom isol simultan concurr control recoveri schedul process theori composit account interact hierarch schedul execut transact process parallel treat weak conflict order provid correct criterion transact process base notion complet process schedul shown due structur transact correct criterion appli execut activ complet reason process recoveri complex tradit case appli complet process schedul consid identifi import prerequisit pred schedul respect due fact activ atom singl activ complianc defer commit activ atom commit exploit phase commit protocol provid subsystem framework establish paper cover applic workflow process support provis infrastructur electron virtual cim scenario present section complet transpar user wise project eth zurich implement process schedul transact process manag protocol base correct criterion present paper complement correct check singl process respect termin properti wise system idea complet effort provid execut transact process base futur work expand framework establish paper identifi transact execut subprocess reason decoupl execut subprocess refer dogac correct workflow presenc concurr gener inform technolog system confer june schek correct parallel composit system acm symposium principl system busi busi intern workshop research issu data engin inform technolog virtual march schek transact fork join composit system intern confer theori januari alonso process transact distribut applic high perform transact process workshop septemb el weikum unifi concurr control recoveri transact inform pa goodman model concurr nest transact system journal associ comput april goodman concurr control recoveri system rusinkiewicz transact model vldb page editor transact model advanc applic morgan specif manag extend transact programm transact environ intern confer data engin page februari sheth overview workflow process model workflow autom infrastructur distribut parallel jajodia editor advanc transact model architectur kluwer academ ramamritham failur handl coordin execut concurr workflow intern confer data engin page februari support busi transact partial backward recoveri workflow manag system technik und page korth transact model system intern confer distribut comput system page june cim coordin intern confer data knowledg contract chapter kluwer academ schek concurr control recoveri transact process technic depart comput swiss feder institut technolog coordin bring function applic system european concurr engin confer april ye unifi theori concurr control recoveri acm symposium principl system page june schek unifi concurr control recoveri transact semant rich oper theoret comput reuter contract chapter morgan kaufmann ensur relax atom flexibl transact system acm sigmod page appendix proof theorem assum process schedul serializ conflict cycl exist form commit project cycl exist complet process schedul reduc pred assum process schedul occur case activ denot activ case prefix exclud complet activ forward recoveri path conflict activ process activ conflict lead pred case prefix exclud prefix consid case contradict assumpt pred case complet process schedul complet activ forward recoveri path conflict activ process activ conflict activ lead pred case prefix exclud execut complet process schedul lead conflict cycl elimin longer contradict initi assumpt pred activ complet exist introduc cyclic conflict elimin contradict initi assumpt proof lemma assum process schedul pred pair conflict activ exist process activ assum activ execut termin activ execut conflict order lead conflict cycl cycl elimin activ introduc conflict cycl complet process schedul activ process schedul red pred lead contradict initi assumpt differenti assum activ activ consid complet process schedul process conflict cycl red pred lead contradict initi assumpt assum activ activ process process activ activ exist complet assum conflict order complet process schedul lead cyclic conflict elimin involv activ red pred contradict initi assumpt proof lemma assum process schedul pred assum complet process schedul activ execut order conflict activ lead conflict cycl elimin reduct rule red pred lead contradict initi assumpt proof lemma process schedul pred assum conflict activ activ order complet process schedul commut assum activ conflict activ conflict cycl exist elimin reduct rule lead red pred contradict initi assumpt
Agents/287 1 support conflict resolut cooper design system mark klein advanc research lab japan abstract complex artifact design cooper group area interact expert inevit involv conflict paper present implement comput base studi human cooper support resolut conflict model base central insight gener conflict resolut exist separ design instanti context conflict specif advic resolv conflict conflict resolut consist taxonomi design conflict class addit gener advic suitabl resolv conflict class abstract natur conflict resolut make applic wide varieti design domain paper describ conflict resolut model exampl oper implement cooper design system local area network design design agent model extend support learn collabor human design agent discuss author reach rout box st paul nc usa conflict resolut cooper design design increasingli cooper endeavor carri multipl agent kind design car requir expert design safeti mean ship potenti develop tool underli theori support cooper design grow impli evolut critic compon model cooper design theori conflict design agent resolv agent notion kind design design agent part shape maxim prefer shape simplifi oper produc part agent give incompat specif design agent neg critiqu specif assert conflict occur cooper multipl sourc cooper conflict occur exist approach conflict resolut system suffer fundament limit conflict resolut repres reason express inferenti formal work present implement comput base studi human group problem support conflict resolut cooper design formal repres conflict resolut applic wide varieti design domain instanti context interact produc suggest resolv conflict model initi realiz context sole design extend support learn collabor human discuss paper develop theori conflict resolut extrem ambiti task current work import subset competit competit conflict situat parti sole benefit mind interest achiev global optim situat solut ad person benefit cooper parti unit goal achiev global optim requir sacrif person benefit interest global benefit conflict situat wide differ conflict resolut strategi model orient cooper conflict cooper design share goal produc product exist domain level control level conflict concern conflict recommend actual form conflict concern conflict recommend direct design process creat design conflict resolut control level good theori control individu agent prematur develop theori resolv control level conflict multipl agent remaind paper organ exist work conflict resolut critic avoid import limit exist present exampl oper cooper design system implement detect resolv conflict present model extend support learn human collabor discuss paper conclud discuss import lesson learn consid avenu futur research contribut limit exist research work conflict resolut ai relat field social scienc larg bodi work devot analyz human conflict resolut behavior work highlight import conflict group prescript conflict resolut facilit work issu specif psycholog human gener natur conflict resolut addit work support human conflict resolut includ research group consensu build group support work competit conflict limit structur interact group appli conflict resolut resolv conflict conflict resolut expect resid human particip find work comput model encod conflict resolut turn ai relat field concurr engin relev literatur group categori extent conflict resolut repres reason explicitli formal robust kind conflict system type requir potenti conflict virtu exhaust discuss develop conflict resolut knowledg util domain expert implicit individu conflict resolut made develop approach number disadvantag chang add exist design agent approach make unrealist assumpt human design agent cooper design system make assert conflict made agent conflict disadvantag conflict resolut approach avoid conflict assert design agent system resolv kind conflict resolut compon exampl includ approach backtrack constraint relax piec specif conflict resolut advic approach har conflict resolut restrict formal repres gener conflict work class closest provid conflict resolut statu includ implement system hacker bargain system constitut theori conflict resolut conflict resolut knowledg applic cooper conflict situat attempt made express heurist inappropri deduct knowledg commit made conflict resolut strategi repres reason commit made idiosyncrat domain limit extens approach account issu distribut context share commun work conflict resolut evolv make explicit support cooper problem solv implement system achiev goal develop conflict resolut model work involv design implement cooper design system statu conflict resolut theori underli work base insight deriv studi human cooper design solar home design local area network design section meant notion conflict resolut separ kind problem solv implement comput model make effect kind wide cr crucial oper model appli conflict distinct kind problem solv fundament tenet underli work gener conflict resolut treat separ categori problem solv effect understand mean analog treatment control knowledg system earli system shell provid structur express fact simpl syntact criteria decid rule run set potenti applic rule domainspecif control compil rule rule complic precondit action express control domain control combin knowledg base system control earli combin system figur treatment control system knowledg base simpl bodi domain control produc complic combin bodi precursor origin form knowledg base longer make explicit distinct present origin difficult domain expert understand modifi system make express domain control kind succinct form addit control repres explicitli make easier reason decid kind control scheme understand control choic made repres reason control statu accord domain control statu result flexibl gener system argument made conflict resolut system mix bodi domain conflict resolut singl knowledg result sort problem result mix domain control current combin system combin knowledg base domain conflict resolut domain domain system conflict resolut figur treatment cr system give cr distinct statu captur succinctli gener conflict resolut bodi design repres form anticip potenti conflict lead flexibl gener system aim work view attempt evolut system distinct handl distinct form knowledg convent program languag distinguish data procedur tradit expert system treat control distinctli work attempt step tradit expert system treat conflict resolut separ give statu acquir repres conflict resolut natur conflict peopl accumul experi larg collect specif resolv conflict wai satisfi parti involv jan mark cook dinner jan add hot mark prefer decid cook meal jan add portion chanc cook meal bob mike design home mike larg window front aesthet effect bob concern window lead excess cool cost decid add window provid shade high summer sun jeff arthur design local area network client arthur suggest simpl design involv singl lan trunk interconnect workstat server site jeff concern singl failur point trunk entir site function decid add repeat trunk prevent propag failur lan trunk segment conflict resolut instanc thought instanc conflict resolut plan achiev agent goal conflict find altern achiev goal conflict agent plan achiev goal excess summer window concern provid block sun propag unwant entiti share resourc conduit concern add filter conduit reduc elimin propag entiti cr strategi view consist precondit match class advic resolv conflict class strategi instanti wide varieti conflict strategi specif class problem involv entiti pass conduit kind current cooper design system successfulli resolv local area network design conflict specif cr strategi organ notion conflict taxonomi class conflict form taxonomi includ gener class conflict specif class bottom cr strategi view consist pointer conflict class advic resolv conflict subsum cr strategi precondit give classs defin characterist piec advic class cr strategi organ conflict taxonomi fragment unwant propag entiti add filter unwant propag sunlight window add window conflict plan goal pick plan goal strategi strategi strategi figur fragment conflict taxonomi cr exhibit applic effici tradeoff cr strategi high taxonomi appli wide rang lower narrow coverag gener strategi instanti apt result satisfactori conflict resolut specif strategi narrow lead satisfactori solut sooner strategi appli wide varieti conflict includ repres strategi strategi suppli constraint kind filter situat strategi instanti number filter window shade excess satisfactori resolut produc strategi appli smaller rang conflict specif suggest kind devic reduc number possibl consid effici strategi cr heurist natur deal interact intern consist mutual inconsist domain theori design agent strategi effect make hypothesi conflict address piec respond appropri advic fail addit set cr cr includ control knowledg determin potenti larg set applic cr strategi conflict cr strategi kind proven specif class problem domain comput model section describ comput model har conflict resolut cr function distinct design agent cooper design system view made design compon updat critiqu conflict resolut compon resolv design agent conflict design agent produc incompat specif design agent specif produc conflict resolut design design agent conflict resolut design design agent conflict resolut design design agent conflict resolut design design agent design descript commit critiqu commit critiqu commit critiqu commit critiqu figur compon cooper design system conflict resolut compon design agent compon replic design agent avoid limit design agent autonomi maintain singl distinguish conflict resolut agent cr compon agent detect conflict lead conflict resolut process function combin design conflict resolut compon singl design agent due clean interfac entiti cr compon find resolut conflict framework inconsist design state manifest design conflict detect mechan manner unsatisfi constraint design conflict map goal resolv set altern specif cr plan achiev goal resolv conflict specif cr plan action action languag conflict manifest inconsist design state conflict detect conflict class instanti advic collect advic gener advic execut cr plan map conflict class pick cr plan cr plan queri queri languag figur oper conflict resolut compon work conflict conflict class subsum conflict identifi gener piec advic class templat instanti context conflict specif conflict resolut plan cr compon identifi relev cr advic gener instanti question agent queri languag plan accumul instanti process sort cr find succe top plan action plan describ suggest design design agent action languag critic point process conflict class applic conflict advic class advic instanti specif cr plan chosen cr plan plan point consid paragraph find conflict class conflict class taxonomi abstract defin characterist term design commit underli conflict reason commit precondit class includ conflict involv critiqu compon critiqu kind resourc critiqu concern unwant propag entiti precondit plan class includ conflict support plan support untri altern plan precondit express set primit question type constitut queri languag cr compon design agent produc specif abstract question design agent cooper lan design system lan trunk kind resourc conduit cr compon abstract design entiti design agent recogn current implement isa hierarchi find conflict class conflict involv determin conflict class precondit satisfi conflict hand difficult determin conflict complet model design agent involv conflict defin characterist conflict class weaker set condit plan class trigger conflict due pick wrong plan set altern determin plan altern prohibit conflict classs precondit simpli check goal untri altern plan collect cr conflict class abstract piec advic resolv conflict class conflict resolut advic applic conflict found simpli collect piec advic conflict class match conflict set instanti cr piec instanti specif cr plan suitabl current conflict cr advic includ number fill valu order execut cr compon question design queri provid valu slot imagin conflict match plan conflict class advic instanti find goal support conflict untri plan goal advic instanti cr plan untri plan goal advic instanti plan select conflict resolut set candid cr plan resolv conflict cr compon determin final result design design expert evalu design altern cr compon heurist suggest cr plan succe exampl heurist includ specif plan knowledg close suit plan make smallest avoid undesir cr plan conflict resolut plan suggest made design agent statement action languag kind care commit base model version model modifi goal design featur constraint chang pick plan untri plan pick goal add detail patch ad design action languag proven adequ describ conflict resolut strategi consid work cr plan conflict resolut heurist conflict resolut plan cr plan work produc conflict result resolv initi conflict cr suggest row complet resolv conflict conflict result suggest cr compon treat conflict due design agent action situat cr compon find involv question queri give conflict resolut suggest action languag cr compon singl uniform mechan deal type conflict conflict resolut process clancei heurist classif model model view classif heurist match abstract data describ problem abstract solut solut refin abstract solut specif data data abstract abstract solut gener advic specif solut abstract search conflict class hierarchi direct map refin abstract solut conflict class instanti advic design agent cr plan heurist match heurist match design express abstract vocabulari figur conflict resolut heurist classif data design support conflict abstract perform design agent answer abstract queri languag question heurist match step perform search conflict class taxonomi manner success discrimin gener specif conflict class map heurist match step map gener piec refin specif suggest solut conflict heurist guid refin produc suggest work applic conflict resolut gener cr wide gener complet order evalu distinguish abstract type problem solv conflict classif figur cooper problem solv routin design meta plan formal resourc manag conflict resolut cooper schedul mainten cooper diagnosi load bear figur type problem solv problem solv type arrang direct acycl graph type lower graph special parent type type abstract vocabulari term describ object characterist class conflict conflict resolut strategi current cr compon implement conflict resolut type problem solv shade figur cooper problem solv problem solv multipl agent work solv agent possibl shallow model inform choic commit abstract vocabulari includ cr strategi type agent shallow model produc conflict design agent shallow formal agent formal produc commit abstract vocabulari includ conflict involv relax relax routin design agent work configur connect compon abstract vocabulari includ conflict unabl find exist compon compon set relax design relax constraint match compon framework design state map goal theme goal trigger plan creat subgoal execut design action post constraint design state scheme reason state design state design reason includ make control choic resolv conflict resourc manag design agent design system manag resourc abstract vocabulari includ conflict due unwant propag entiti add filter entiti conflict resolut problem solv resolut conflict found abstract vocabulari includ cr compon handl secondari conflict result action conflict cr run cr strategi origin conflict taxonomi specif class domain domain cover type lan oil design fit type real world domain fall type design produc conflict match class type complet conflict class taxonomi analyz type type basi abstract vocabulari cp type complet cr type verifi complet type difficult confirm establish cr gener problem solv type assur conflict system encount gener strategi deal provid specif cr domain type cooper diagnosi routin design load bear requir knowledg conflict resolut action implement system cooper design creat design lan area consist set design agent includ design cr compon agent role design includ refin design critiqu exist design design perspect design agent cooper refin critiqu abstract compon descript store central blackboard constraint propag mechan detect conflict unsatisfi constraint compon featur design agent implement expert system current incarn system knowledg lan vendor expand econom lan technolog agent exist lan technolog combin work system detail specif remaind agent offer constraint specif critiqu emerg design perspect cr compon includ conflict class taxonomi total conflict class rm exampl successfulli run implement typic run pair exampl conflict resolut perform system design lan system refin lan design descript trunk carri data traffic step hardwar agent determin physic topolog trunk agent prefer trunk media search compon physic topolog support prefer vendor agent prefer protocol thin media hardwar find exist lan technolog satisfi return unsatisfi constraint recogn conflict conflict detect machineri hardwar agent conflict case vendor agent set design hardwar agent creat viabl design hardwar agent cr compon find cr plan potenti resolv conflict begin class conflict taxonomi subsum class taxonomi defin condit design agent unabl find compon compon satisfi set constraint constraint note conflict classs precondit express set queri languag question cr compon question design agent check cr class precondit agent typic provid inform trace result dialogu item ital font repres abstract vocabulari item cr item bold repres valu return design cr compon design compon fact support nil isa rule creat isa media protocol result cr compon find conflict class subsum learn ident compon search plan involv conflict exhaust entir conflict class subsum conflict class identifi step collect gener advic class piec advic gener piec advic class input constraint search plan compon retriev compon piec gener advic instanti specif fill execut process place cr compon design compon chang ethernet chang input constraint return viabl physic cr compon instanti gener advic cr express action languag cr modifi ethernet rerun cr modifi modifi rerun cr compon decid cr plan execut base heurist simpler cr cr chosen imagin chang request rerun chang input topolog successfulli select refin hardwar agent bu termin refin repres simplest bu topolog refin filter simpl design prefer default hardwar agent critiqu reliabl agent agent prefer reliabl lan trunk failur occur failur propag trunk low reliabl assess conflict goal maintain high detect conflict reliabl agent reliabl agent cr compon activ cr compon find conflict class subsum resourc conduit suffer propag unwant advic filter unwant entiti resourc dialogu design agent case proce cr compon design compon fact support isa resourc conduit fact support high isa unwant featur propag filter suitabl stop reliabl high reliabl low exchang verifi conflict class subsum inform instanti advic produc cr cr add cr gener goal add ethernet repeat lan trunk trunk refin pair trunk segment ethernet repeat reliabl agent phase design termin successfulli model conflict resolut work synergist interact gener conflict resolut design gener advic identifi instanti interact plan suitabl specif conflict domain labour compact corpu cr appli wide varieti design conflict wide varieti design domain support human collabor goal research build comput system support collabor human support individu group earli collabor support approach limit fact comput system unabl statement made human limit role comput commun channel provid effect collabor support system understand potenti learn action interact particip function requir model task involv cooper design research begun work produc model support tool aspect cooper design process task work produc comput model conflict resolut compon collabor integr model singl agent design descript research strategi studi human conflict develop test result cr model simpler context sole design agent expand model collabor support system includ human design activ involv stage outlin approach human design primit underli design model describ critiqu commit primit defin interfac human design collabor support system primit creat goal refin constrain design achiev design featur add compon exist constrain design featur instanti compon refin compon connect compon interfac commit resourc compon interact human design mediat person interfac human user activ trace design state graph interact agent mark klein constraint protocol state agent jeff goal constrain protocol agent arthur constrain protocol compon state design displai state oper creat constrain goal creat achiev goal constrain explain figur interfac human design expert human design design assist network assist design inspect current design includ action design agent histori design state content design state design updat current design statu techniqu agent constraint featur compon agent work assert constraint agent assert constraint select oper menu activ click design featur interest compon displai interact pane prompt agent constraint incompat assert earlier agent assist updat share design model base design propag consequ detect conflict constraint manag mechan conflict conflict resolut compon attempt identifi subsum conflict class instanti gener advic specif suggest conflict languag dialogu agent involv conflict human design agent treat uniformli assist propag constraint protocol detect case unsatisfi constraint set protocol constraint appli portion design propag wide conflict relat design featur involv portion design activ trace design state graph interact agent mark klein constraint protocol relax constraint protocol agent jeff goal constrain protocol agent arthur constrain protocol conflict detect featur protocol compon state compon state agent mark klein constrain protocol design displai state figur conflict resolut compon action conflict resolut compon mark klein assist activ engag dialogu design agent involv conflict classifi select instanti conflict resolut advic execut cr compon eventu suggest agent relax design constraint conflict resolut compon act design agent effect direct dialogu multipl agent collabor support system ideal improv technolog progress quickli turn static system obsolet note number context learn group activ effect pursu particip process learn exampl occur integr knowledg acquisit perform learn human expert resolv conflict resolut suppli collabor support learn design made human expert reduc number conflict queri human expert respond learn design routin design task human explor kind knowledg acquisit system mole model problem solv task provid guidanc knowledg acquisit process defici knowledg base static dynam analysi knowledg acquisit action challeng approach identifi knowledg acquisit strategi task hand conflict resolut essenti heurist classif problem address knowledg acquisit strategi identifi cr uniqu make acquisit simpl instanti exist task fundament distribut cr exampl conflict resolut gener absenc consist complet theori resolut learn inappropri acquir cr structur type appar role numer weight select cr domainindepend heurist acquir identifi strategi suitabl autom acquisit cr knowledg group engag test efficaci paper present approach support conflict resolut cooper design avoid limit previou work area previou work support conflict resolut approach backtrack class formal repres reason cr result deficit conflict resolut abil approach static analysi consid static attribut knowledg dynam analysi consid behaviour result knowledg base hacker conflict resolut attempt encod deduct strategi work base complet understand problem approach encount difficulti cr natur heurist exist hewitt suffer make commit realiz system embodi detail comput model conflict resolut collect conflict resolut system explicitli aim kind distribut problem solv context involv cooper design conflict resolut model incorpor previou work conflict resolut cooper design techniqu system hacker vt embodi cr strategi conflict resolut taxonomi main contribut work cr strategi framework select execut strategi cooper design context work led number insight conflict resolut cooper gener cr gener conflict resolut repres import categori knowledg cooper distinct domain collect bodi number domain cr comput model har develop model incorpor cooper design system cr cr larg heurist abil deal fail cr suggest critic cr cr acquir readili human expert experi collect led number insight process structur effect possibl autom cr complet techniqu evalu improv complet bodi conflict resolut uncov work appli successfulli design agent model face work focu conflict resolut cooper design reveal challeng design agent includ provid design agent greater abil repres richer design greater abil chang design produc respond queri suggest conflict resolut compon meet challeng singl agent maintain rich design make design easier conflict resolut repres larg unexplor import step provid effect support cooper design current research expand model support collabor human design learn cr process interfac human design implement evalu preliminari result suggest interfac effect support conflict resolut human particip constantli engag evalu enhanc current bodi conflict resolut direct plan pursu includ extend approach design domain design tempor explor analog learn enhanc coverag effect exist conflict class acknowledg invalu assist prof ab stephen lu stepp dr advanc research lab gratefulli acknowledg refer evolut basic book consist expert system tech report centr mathemat comput juli dc failur handl design expert butterworth interact conflict resolut support system situat proc annual hawaii intern confer system scienc pp particip system cooper work distribut artifici intellig pp wj classif problem solv aaai pp ch gs structur lawrenc erlbaum associ dd vr control coordin distribut problem solv network pp jc make antagonist constraint planner artifici intellig pp design comput intern survei program perspect acm comput survei pp knowledg acquisit tool intern journal studi pp interact support system consensu process fuzzi logic linguist elsevi scienc vol pp taxonomi conflict resolut strategi annual confer develop human resourc negoti agreement give ms sf isi system factori schedul expert system bargain goal pp tr method acquir strateg knowledg knowledg acquisit pp prototyp distribut execut commun support system twentieth hawaii intern confer system scienc pp offic open system acm transact offic inform system pp electron technic altern social intellig knowledg acquisit tool pp shell interview system pp conflict resolut cooper phd decemb conflict resolut cooper design intern journal artifici intellig engin pp comput model conflict resolut cooper design system intern work confer cooper knowledg base octob mg knowledg acquisit intern journal studi pp vr negoti resolv conflict design expert tech report dept comput inform august progress aid mechan design symposium integr intellig decemb effect graphic problem solv aid small group make proc hawaii intern confer system scienc pp experi build usabl meet support softwar groupwar technolog august da adapt develop comput support cooper work april expert elev design artifici intellig magazin pp expert system shell negoti support tech report februari design human system cambridg busi check expert knowledg base consist complet proc pp interact graphic teleconferenc ieee comput dg negoti academ pre extract advic conflict intern joint confer artifici intellig pp conferenc system ieee comput intellig project manag system artifici intellig magazin rg cooper distribut problem solv ieee intern confer cybernet societi pp mj plan constraint part artifici intellig pp gj comput model skill tech report phd thesi ai electr design problem ai research august pp gj gl constraint languag express descript artifici intellig pp eh approach verifi complet consist expert system aaai argument labour mediat intern joint confer artifici intellig pp distribut planner air fleet control seventh intern joint confer artifici intellig pp consensu knowledg acquisit tech report inform technolog mit school april plan
AI/288 2 world champion team manuela peter han comput scienc depart carnegi mellon pa februari abstract robot soccer challeng research domain involv multipl agent collabor adversari environ achiev specif object describ team small robot agent develop enter competit design built robot vision develop implement algorithm strateg collabor robot uncertain dynam environ robot organ hold specif pursu goal game demonstr collabor behavior multipl occas present overview vision process algorithm successfulli track multipl move object predict trajectori paper focuss agent behavior rang individu behavior strateg team behavior cmunit won competit japan introduct problem solv complex domain involv multipl dynam learn feedback previou experi robot soccer complex task multipl agent collabor adversari environ achiev specif object robot soccer offer challeng research domain investig larg spectrum issu relev develop complet autonom agent natur domain necessit coupl quick behav make behavior make process rang simpl reactiv move directli arbitrarili complex reason procedur account action perceiv strategi teammat oppon innov techniqu abound advantag robot soccer enabl direct comparison match competit pursu research robot soccer domain robocup initi includ simul leagu robot leagu research extens simul develop learn techniqu team strategi simul team strategi directli incorpor robot system appli machin learn techniqu acquir hard tune boundari behavior real robot paper describ architectur robot soccer team combin robust intellig control repres challeng successfulli meet work paper fulli implement robocup team won competit japan team score total thirteen goal suffer figur show pictur robot agent specif contribut robot team ffl demonstr complet integr cognit team multipl robot agent ffl set robust behavior individu agent agent equip skill enabl effect perform individu collabor action ffl reliabl percept filter vision process algorithm track multipl move predict object inevit sharp trajectori occur ffl multiag strateg reason collabor robot achiev flexibl approach task space agent assign flexibl team structur agent organ homogen agent flexibl switch role altern plan collabor pass teammat shoot goal control metric evalu figur robot team compet hardwar descript percept multipl agent robot leagu setup view complet autonom framework physic video camera plai field connect central interfac client mind robot player figur sketch architectur transmit interfac client modul client modul client modul client modul client modul raw vision data action code action code object posit figur cmunit architectur global percept distribut reaction complet system fulli autonom consist challeng process cycl global vision algorithm perceiv dynam environ process give posit robot ball inform control distribut agent algorithm agent evalu world state strateg knowledg decid action motion command control radio commun command broadcast directli individu agent robot identif binari code detect command intend robot complet system fulli implement fit vision system robot small interest quickli move strateg multiag research opt global vision system part research investig develop team robot capabl local percept part challeng develop approach individu robot autonomi consist combin sourc local target broadcast commun fact percept achiev video camera complet field offer opportun global view world state setup simplifi share inform multipl present challeng reliabl process movement multipl move agent agent oppon team section focuss present vision process algorithm accuraci make major contribut success team detect vision requir robot soccer examin research robot soccer research investig vision processor due reactiv soccer robot framework requir high percept process cycl time due rich visual dedic processor dsp vision system successfulli surprisingli consist transfer camera process slow processor detect mechan simpl robocup rule defin color object field major cue object detect robocup rule green color field white mark side specifi yellow blue color circular area top color team singl color patch robot provid orient inform ad addit color patch top robot ball orang golf ball differenti color straightforward manner set detect patch unord detect color patch top robot match distanc constant distanc pink orient match patch distanc patch mark robot captur posit orient inher vision system detect current system magnitud spuriou detect frame system attempt elimin detect method color patch size match robot discard techniqu filter ad distanc match mechan briefli detect elimin data associ data associ address problem retain robot identif subsequ frame obviou approach differenti number robot detect number color simpl find robustli distinguish color assign share green orang white field blue yellow team color inevit variat light condit area field make detect associ mechan fulli base separ color fit robot color top attempt made differenti color data associ approach solv problem retain robot identif subsequ frame robot color marker greedi algorithm retain associ base spatial locat robot consecut associ maintain search minimum distanc current robot posit match closest posit previou account size robot estim veloc algorithm robust noisi theori find optim correct match practic detect associ approach highli reliabl track predict set robot soccer abil detect locat object field real soccer essenti robot predict futur locat ball extend kalman filter filter suitabl detect ball locat noisi ekf estim possibl system goal filter estim state system state denot vector set equat describ behavior predict state system function repres behavior extern input system gaussian random variabl covari matrix captur system discrep physic system denot time system model observ observ vector observ measur gaussian random variabl covari matrix captur observ process ekf involv iter updat propag current estim system state error covari comput iter updat current observ refin current estim recomput covari propag state covari system time step calcul system equat process iter altern updat propag step care adjust filter paramet model achiev success track predict ball sharp bounc occur figur show screen shot field gener vision process modul ball predict trajectori shown white line teammat displai repres oppon circl figur show trajectori teammat robot vision process approach work perfectli game detect track move object oppon predict movement ball provid ekf agent behavior goalkeep ahead time predict defend posit goal suffer due predict ball posit multiag strategi control achiev multiag strategi combin accur individu collabor behavior agent reason persist reactiv behavior develop aim reach team object figur field view vision process modul behavior order successfulli agent requir robust basic skill skill includ abil place abil direct ball abil intercept move ball skill execut avoid obstacl wall robot robot hardwar includ motor robot turn front back robot absolut term navig robot effici switch direct turn robot accur direct ball target approach ball direct ball predict vision robot aim point side target posit robot equip method ffl ball move ball target ffl ball wait ball cross path intercept move ball target ball collect robot consid line target posit ball current predict depend ball move robot plan path point line ball hit ball end face target posit robot target figur illustr behavior ball intercept behavior robot consid line target posit determin ball path intersect line robot posit line point intersect time ball arriv robot ball line line intermedi target final ball target line line ball robot final ball target point intercept predict target intermedi figur behavior enabl team collabor ball collect pass ball intercept robot ball handl routin base ball eventu cross path point robot intercept goal robot ball intercept ball collect ball aim ball predict locat fix time futur eventu posit place intercept ball target multiag behavior behavior effect singl robot robot simultan chase ball shoot chao result order achiev coordin multiag organ robot flexibl team structur team defin set posit behavior robot dynam map posit robot equip knowledg requir plai posit format posit area field robot move default situat activ mode determin robot move ball robot ball shoot pass teammat pass evalu function multiag behavior origin develop simul transfer code pass evalu function redefin flexibl team activ mode posit defin flexibl region player attempt move ball robot plai posit remain side field oppon goal ball posit classifi base locat region behavior specif term posit consid potenti time robot plai posit field robot knowledg plai posit robot posit fly robot switch posit robot chase ball region robot robot continu chase robot move posit vacat posit player collect commonli format collect posit consist attack format consist defend attack evalu collabor opportun main featur robot abil collabor pass ball activ robot evalu function account teammat oppon posit determin pass ball shoot part format posit set posit consid pass defend pass forward forward pass backward midfield defend posit occupi robot evalu pass posit evalu shot evalu robot comput line segment ball receiv shoot ball figur case line segment consid pass shot product relev robot pass shoot multipli valu factor determin rel proxim activ robot potenti receiv goal robot pass shot maximum line segment comput algorithm shown tabl correspond figur reflect easili oppon intercept pass subsequ shot closer oppon line farther chanc intercept ball line line line oppon ball robot teammat figur pass evalu base posit oppon oppon ffl comput distanc distanc ls end ball kick robot figur ffl defin constant oppon farther consid discount distanc consid larger figur oppon goal evalu actual distanc ball reason distanc oppon time block extra distanc longer ffl return tabl algorithm evalu collabor opportun goalkeep goalkeep robot special hardwar special softwar switch posit activ robot goalkeep physic frame distinct robot long rule block goal goalkeep role prevent ball enter goal stai parallel close aim directli ball coordin field simpli stai ball ball past goalkeep robot fast ball defeat behavior goalkeep continu monitor ball trajectori case move ball predict destin point ahead time move predict ball posit crucial illustr figur goalkeep robot account predict veloc direct ball select move ball fast slow ball figur goalkeep discuss successfulli demonstr feasibl effect team multiag robot system major challeng integr rang percept strateg multiag reason cmunit fulli implement multiag system loop close implement interest strateg includ agent collabor evalu altern action gener difficult accumul scientif result test team robot extend run prohibit batteri limit difficulti robot oper concurr resourc build singl team spare offer restrict evalu cmunit base result effect game plai includ anecdot evid multiag capabl robot soccer team robot team plai game robot team nara institut scienc technolog pari franc spain result game tabl oppon score girona total tabl score cmunit game small robot leagu won game score thirteen goal score cmunit goalkeep attack situat franc refin goalkeep goal present section observ goalkeep error match spectat notic team behavior section robot switch posit success pass impress goal tournament result pass robot pass pass shot ball goal robot behavior visual appeal entertain spectat peopl attain appreci difficulti task control singl robot joystick program develop peopl children found difficult maneuv singl robot direct ball open goal peopl impress facil robot defend awar issu open research develop systemat identifi address team version enhanc robot behavior machin learn techniqu acknowledg develop build robot research sponsor part advanc research project agenc rome air forc materiel agreement number part depart offic naval research contract number view document author interpret necessarili repres offici polici express air depart offic naval research unit state govern refer minoru alexi maja peter hiroaki kitano robocup physic agent appli artifici minoru hosoda behavior acquisit real robot reinforc learn machin han manuela veloso reactiv visual control multipl robot agent intern confer robot kalman result linear filter predict theori journal basic page march hiroaki itsuki minoru hitoshi osawa challeng problem ai ai spring hiroaki milind peter manuela hitoshi itsuki minoru asada robocup synthet agent challeng fifteenth intern joint confer artifici page san morgan kaufmann maja matar design understand adapt group behavior adapt decemb michael alan rod stewart control robot testb ieee intern confer page randi bill carl ann wright dynam object captur fast vision track ai spring ali sheila build integr mobil robot soccer competit intern confer robot peter stone manuela veloso simul team hiroaki robot world cup soccer game confer springer press peter stone manuela veloso layer approach learn client behavior robocup soccer server appli artifici press peter stone manuela veloso task dynam role commun strateg teamwork submit artifici peter stone manuela veloso tree confid factor multiag control hiroaki robot world cup soccer game confer springer press manuela peter team hiroaki robot world cup soccer game confer springer
IR/289 5 comput iceberg queri effici min narayanan hector rajeev jeffrei ullman depart comput ca paper number abstract applic comput aggreg function attribut set find aggreg valu threshold call queri iceberg queri number result small tip rel larg amount input data iceberg queri common includ data market basket analysi data cluster copi detect effici algorithm evalu iceberg queri memori significantli fewer pass compar current techniqu sort hash present case studi gigabyt web data illustr save obtain algorithm introduct paper develop effici execut strategi import class queri call iceberg queri iceberg queri perform aggreg function attribut set elimin aggreg valu threshold prototyp iceberg queri paper base relat threshold select group appli iceberg queri relat tabl result tupl call iceberg queri relat number uniqu target valu typic huge number frequent occur small tip data mine queri fundament iceberg queri market analyst execut market basket queri larg data store custom sale transact queri identifi user bui find item pair bought custom set minimum number transact requir support item queri oper larg phone rest joe fred salli salli bob tom tabl relat solv iceberg queri effici import problem park al claim time execut queri domin cost produc interest associ rule concentr execut iceberg queri effici compact data structur discuss exampl iceberg queri section simplest answer iceberg queri maintain arrai counter main counter uniqu target answer queri singl pass data applic relat time larger memori irrelev attribut project earli approach answer iceberg queri sort pass aggreg select target threshold memori small rel size sort pass data disk produc sort number tupl fit memori log merg pass produc final sort run pass read write entir relat valu target encount similar problem popular techniqu earli aggreg hash base aggreg assum materi case larg explicitli materi disk market basket input data set transact record record describ collect item bought correspond multipl record interest pair item frequent bought custom bought item cg tupl repres associ pair item averag number item custom bui custom record gener tupl initi data custom transact small materi feasibl due quadrat size initi input situat analyst find popular item tripl quadrupl execut iceberg queri virtual relat explicitli materi tradit techniqu base input data store run hundr gigabyt sort hash requir primari contribut paper identifi iceberg queri fundament data mine discuss applic iceberg complex queri iceberg queri todai process techniqu scale larg data crucial develop techniqu varieti algorithm iceberg queri process algorithm build block techniqu sampl multipl hash combin extend improv perform reduc memori requir techniqu avoid sort hash structur identifi threshold target case show perform iceberg comput materi iceberg algorithm produc target valu threshold report target report threshold algorithm error toler applic extend techniqu effici correct error evalu algorithm approach applic real queri result show algorithm effici handl larger iceberg problem current techniqu case studi serv illustr tradeoff involv strategi depend system resourc size disk main rest paper structur section discuss exampl iceberg illustr kind iceberg queri section present simpl algorithm execut iceberg queri section hybrid algorithm combin advantag simpl wai section orthogon techniqu optim hybrid strategi section evalu techniqu case gigabyt data size requir gigabyt storag section extens conclud section direct futur research iceberg queri illustr exampl execut iceberg queri effici tradit techniqu sort hash lead high queri time inordin larg disk requir queri benchmark style relat attribut kei part price number unit sold area part sold queri comput kei popular item item revenu region exce million dollar creat view select group region easi appli current techniqu sort relat perform time queri larg case item small revenu minimum criteria select item revenu million sort approach item satisfi queri intuit tradit techniqu sort hash solut output perform amount work irrespect small queri output threshold execut queri faster perform aggreg appli threshold queri engin altavista cluster web document base document goal cluster develop web crawler identifi document replic document java manual faq engin break web document set hash integ sequenc sentenc maintain relat tupl hd document signatur identifi document pair copi share signatur common queri creat view select chunk chunk group doc dec prototyp sort execut sort signatur signatur tupl hd rank frequenc heavi light figur graphic view terminolog document contigu pair form hd hd explicitli materi relat form hd indic share signatur common sort tupl document pair contigu sequenti scan count number document pair occur time document pair signatur common process explicitli materi sort threshold materi relat larg storag requir small input size relat grew final answer queri megabyt worth document iceberg queri inform retriev problem ir system comput stop set frequent occur word optim queri process build invert indic iceberg queri ir system comput set frequent user construct queri pair occur collect document user enter word system suggest word add queri distinguish comput word involv iceberg pair word studi applic detail illustr iceberg queri occur commonli execut carefulli queri time temporari storag requir output sensit techniqu threshold present algorithm section context materi relat pair assum execut simpl iceberg queri group singl target set target discuss algorithm easili extend multipl target set start establish terminolog order list target frequent target highest jv frequenc total number tupl frequent target special case equal figur show typic frequenc curv leftmost horizont axi repres rank frequent target prototyp iceberg queri select target valu frequenc higher threshold defin answer queri set fv call valu heavi defin remain light valu algorithm describ answer prototyp iceberg easili adapt iceberg queri algorithm comput set potenti heavi member case algorithm report posit valu report algorithm gener neg target algorithm form error error elimin elimin scan explicitli count frequenc target target occur time output final answer call procedur effici target held byte target count effici count deterior jf time run origin iceberg queri elimin neg fact bad origin problem regain neg effici high skew case tupl target valu small set obtain partial set heavi target tupl target valu scan elimin tupl valu iceberg queri run remain small set tupl sort obtain heavi valu miss present simpl algorithm comput basic block rule instanc high skew rule small fraction target account tupl target account sophist algorithm algorithm simpl counter bitmap effici count assum number element structur smaller jv structur fit main memori section evalu memori requir carefulli algorithm sampl procedur wide adopt practic estim size queri result perform onlin aggreg good discuss sampl techniqu effici obtain simpl algorithm iceberg queri basic idea random sampl size count distinct target scale exce target part candid algorithm simpl implement effici run algorithm remov error effici discuss show remov error hybrid algorithm section count bucket element techniqu queri size comput number distinct target relat mine associ rule applic simplest form count arrai counter hash function map target valu log bit log algorithm work initi entri perform linear scan tupl target increment counter complet hash scan comput bitmap arrai bitmap scan arrai set bitmap bucket comput bitmap smaller maintain inform requir phase bitmap reclaim memori alloc comput perform scan scan target bitmap add final remov execut note approach scan simpl algorithm comput larg time larg light target hash heavi bucket bucket heavi heavi light element combin count threshold hybrid techniqu present approach combin sampl count approach present earlier approach sampl data identifi candid heavi principl remov manag reduc number target fall heavi bucket lead fewer light target posit refer approach hybrid class algorithm algorithm comput small sampl data sampl techniqu discuss section select frequent target sampl add target execut hash scan increment counter target perform scan ad target remov posit execut approach figur case heavi target light target identifi sampl phase potenti maintain explicitli memori count bucket intuit algorithm sampl good identifi good find heavi target select place target high probabl heavi target identifi advanc hash avoid push account lead fewer heavi fewer posit disadvantag split valuabl main memori sampl bucket count maintain explicit target count heavi item pair target data byte store item pair progress start count heavi item heavi item problem implement hard good valu varieti data set problem incur overhead check target exist hash scan algorithm algorithm explicitli maintain list potenti heavi target main memori sampl phase identifi potenti heavi bucket perform sampl scan target chosen sampl increment hash function sampl bucket mark bucket potenti heavi bucket alloc figur altern hybrid techniqu combin sampl auxiliari bucket main memori refer bucket primari maintain reset counter arrai perform hash scan data target increment bucket mark potenti heavi bucket appli hash function increment auxiliari bucket show procedur figur sampl bucket dot identifi potenti alloc auxiliari bucket subsequ target qg fall heavi auxiliari bucket note explicitli store target auxiliari bucket continu maintain counter idea algorithm similar concept extens indic commonli indic grow bucket ad auxiliari bucket dynam differ case extens indic entir kei store bucket dynam add auxiliari bucket effici recal afford store target explicitli main maintain counter reason perform auxiliari bucket potenti heavi bucket notic store sampl set explicitli size target larg problem split amount main memori primari auxiliari bucket decid split memori structur simpl problem empir determin good split dataset cost auxiliari bucket hash function emploi avoid hash fewer bit residu bit target auxiliari bucket discuss import detail implement scheme figur maintain pointer auxiliari bucket maintain byte pointer number potenti heavi bucket high alloc auxiliari bucket bucket contigu main memori start base address store offset auxiliari bucket comput auxiliari bucket potenti heavi bucket locat algorithm techniqu memori effici multilevel algorithm sampl phase identifi potenti heavi bucket alloc auxiliari bucket potenti heavi bucket alloc common pool auxiliari bucket perform hash scan data target increment bucket mark potenti heavi bucket appli hash function increment present procedur figur mark common arrai dot line note target qg remap auxiliari hash function uniformli distribut target common pool auxiliari bucket easi chanc heavi target fall bucket target longer due present case fall bucket base full version paper main intuit share common pool auxiliari bucket potenti heavi bucket heavi target fall bucket heavi target illustr characterist heavi target local auxiliari structur expect fewer amount memori share disadvantag determin split memori primari bucket auxiliari bucket determin empir optim hybrid algorithm hybrid algorithm suffer light valu fall bucket heavi light valu sampl strategi outlin section allevi problem extent heavi target identifi sampl lead light valu fall heavi bucket hybrid avoid problem improv hybrid techniqu multipl set primari auxiliari reduc number posit significantli analyz idea subsect base number pass requir data describ techniqu context simpl techniqu applic algorithm techniqu present continu perform sampl scan identifi potenti heavi store count target hash count explicitli phase phase continu execut remov step common repeat step discuss singl scan multipl hash function illustr hash function map target valu log bit log memori alloc divid part count bitmap arrai bitmap bitmap execut sampl phase identifi potenti heavi store pass input data tupl increment final set bitmap similarli bitmap dealloc pass data tupl add bitmap bitmap set easili gener procedur hash function mention assum fit main memori discuss model memori usag section interest amount main memori larger hash tabl hash tabl smaller reduc number number posit natur point discuss appendix good multipl scan multipl hash function multipl hash function hash scan suffer number posit due smaller hash idea multipl hash scan sampl execut hash scan hash function store bitmap arrai disk perform hash scan hash function store bitmap arrai disk perform hash bitmap bitmap hash scan hash scan figur compar versu leav bitmap memori retriev bitmap arrai disk execut add bitmap improv share bitmap perform hash scan independ previou bitmap inform previou scan assum hash bitmap previou hash scan retain memori optim work st hash target increment bitmap illustr reduc number case frequenc pair ha hb hc hd target occur ten tupl occur tupl map target set target shown figur similarli map target bucket figur show count arrai bitmap hash scan execut similarli comput bitmap hash scan candid select scan dg part target fall heavi bucket hash function execut figur hash scan remain scan comput bitmap hash scan inform bitmap increment count algorithm hash scan increment occurr increment occur light bitmap increment hash longer part candid set fact target chosen dg chosen variant variant memori bitmap maintain bitmap hash scan perform st hash maintain prior bitmap conjectur latest bitmap hash scan fewer fewer bit set bitmap prune power term prune light valu cost lower memori usag denot algorithm extend hybrid algorithm section briefli describ variat scheme present earlier scan final algorithm extens section perform hash final count scan posit elimin case size expect scan execut add counter element add target heavi bucket check target increment add counter initi final count time target target count exce threshold final answer parallel hash scan parallel hash scan multipl process time hash scan drop time sequenti time singl scan optim bitmap previou iter sum mention section extend techniqu iceberg queri queri section perform queri perform hash scan relat comput increment counter price end hash compress arrai bitmap definit bucket heavi greater equal threshold million perform subsequ hash scan final produc total revenu exce threshold case studi larg number techniqu present wai data valu retain potenti memori difficult draw concret applic scenario chose distinct applic scenario design experi answer scheme perform vari amount memori report perform term number posit total time scheme produc remov posit scheme perform vari report jf total time scheme perform data input data skew distribut call skew scheme affect present discuss alloc memori experi experi varieti wai split memori sampl set size case base primari auxiliari bucket found approach work data alloc algorithm base small sampl scan alloc memori set discuss applic alloc auxiliari alloc aux percent remain memori step auxiliari bucket algorithm execut discov amount alloc memori insuffici auxiliari bucket greedili select bucket highest counter assign auxiliari area remain potenti heavi assign limit auxiliari treat primari bucket hash scan alloc primari bucket alloc balanc memori primari bucket bitmap case memori primari bucket bitmap chosen analysi found aux good valu split memori reclaim memori alloc primari bucket alloc store final fit main stream tupl execut sort algorithm implement enhanc earli aggreg integr count sort merg effici execut discuss execut reader interpret result section absolut illustr perform trend sun run suno mb ram gb local disk space case market basket queri market basket queri find commonli occur word pair web document crawl store stanford webcrawl averag length document word data comput relat document identifi docid word identifi relat integ docid note remov entri stop word relat recal iceberg queri execut pair word occur document materi requir gb store requir temporari storag perform aggreg discuss techniqu section avoid explicitli materi techniqu gener execut iceberg materi tupl refer document contigu produc read document time entri sort simpli scan produc hw pair occur document explicitli store stream tupl directli algorithm execut iceberg queri execut iceberg queri increment tupl hw produc notic appli similar optim sort hybrid hash base tupl materi explicitli store hash tabl hybrid discuss repres scheme specif valu illustr involv studi perform scheme greater full version paper present result optim evalu found sampl work practic data number candid pair memori alloc figur jf memori vari total run time memori alloc figur total time memori vari figur show jf number candid vari amount memori alloc jf drop memori expect perform term smallest jf amount memori multipl pass data memori prune number posit significantli perform poorli initi amount main memori differ drop larger memori memori perform counterpart figur total time answer iceberg queri amount memori vari perform steadili memori produc posit multistag perform badli memori mb perform number posit small count main scan data cpu time comput fewer hash function algorithm figur studi jf number vari threshold vari tend smallest jf perform multipl pass data multipl hash function prune figur total time answer iceberg queri perform perform fewer scan comput fewer hash function work applic data number candid pair threshold figur jf threshold vari total run time threshold figur total time threshold vari rank frequenc figur curv chunk result size percentag threshold figur result size threshold case comput sensit scheme skew data ir discuss section ir system comput set stop word effici ir system comput syntact unit text occur frequent identifi popular improv phrase search index chunk occur frequent web document index implement ir system reduc storag requir set document obtain stanford crawler defin chunk base slide window word chunk document sequenc word corpu comput relat hd document hash version chunk experi comput tabl relat relat comput stop word ir graph illustr natur specif algorithm figur curv chunk smaller construct fewer number distinct target larger data skew number distinct target occur million time target occur million time size relat gigabyt remov stop word relat figur show percentag uniqu term threshold figur number heavi target tip drop significantli figur studi number hash scan number hash bucket affect error due lack present result context number previou bitmap cach vertic axi figur percentag posit fp fp number percentag posit drop dramat instanc percentag drop interest note number posit drop data skew number hash scan attribut fewer heavi target data fewer light target fall bucket heavi due heavi hash scan fewer light target fall heavi bucket hash scan experi quantifi impact provid guidelin select number hash scan size analog behavior observ scheme case queri figur present total time execut queri section techniqu amount memori execut queri relat case data avoid sampl figur perform amount memori progress inferior memori small valu memori behavior figur perform fp figur perform compar due compet fewer bitmap alloc memori primari bucket amount prune light target discuss earlier small valu perform factor domin larger valu extra space alloc addit bitmap leav memori primari bucket factor domin perform small bitmap prune light discuss earlier small size memori leav suffici main memori primari bucket size gb assum disk execut sequenti scan rate read write notic execut written read sort execut iceberg easi sort base execut requir disk space materi sort longer scheme summari base case studi experi report due lack space inform combin scheme hybrid hybrid rare perform tend circumst expect data distribut skew distribut target constitut small set expect data time size memori figur perform algorithm queri incur overhead valu expect data distribut sampl scan gener recommend larg valu recommend multipl hash appli multipl hash function hash discuss full version paper relat work martin al simpl form count estim number distinct element multiset park al count context mine associ rule approach singl hash function tend posit extend techniqu hybrid perform studi techniqu case studi approach paper studi effici execut techniqu iceberg import class queri widespread applic data inform retriev copi detect algorithm comput effici convent scheme evalu algorithm case studi approach real observ save algorithm suit provid suit depend data factor provid empir select scheme alloc memori data structur refer agraw srikant fast algorithm mine associ rule larg intern confer larg page septemb dewitt duplic record elimin larg data file acm transact system silverstein market gener associ rule correl acm sigmod page jd tsur dynam itemset count implic rule basket data acm sigmod page brin page googl search web crawler broder resembl document technic digit system research center tech sc manass syntact cluster web sixth intern world wide web april ullman improv algorithm mine associ rule technic stanford technic octob jd ullman comput iceberg queri technic stanford technic februari gn martin probabilist count algorithm applic journal comput system concret mathemat publish pj jf swami select cost estim join base random sampl journal comput system june jm pj hj wang onlin aggreg acm sigmod intern confer manag data june jordan calculu finit differ random sampl phd uc april js ms ps yu effect hash base algorithm mine associ rule acm sigmod page salton bucklei approach automat text retriev inform process shivakumar copi detect mechan digit document intern confer theori practic digit librari june shivakumar build scalabl accur copi detect mechan acm confer digit librari march shivakumar comput replica document web workshop march transact process council jd ullman principl system comput scienc bt hm taylor probabilist count algorithm db applic acm transact gk zipf human behavior principl effort analyz distribut hash item item weight item weight memori size partit equal hash hash tabl total cell goal determin optim choic point view prune item weight recal item prune hash tabl certifi weight hash cell properti total weight item hash item hash cell certifi prune problem hash function prune maximum number prune expect worst case function analysi fairli difficult theoret ignor assum item weight follow pleasant distribut perform analysi basi assumpt assum item chosen independ probabl distribut reason assum weight bound analysi gener easili continu unbound distribut make assumpt hash function assumpt assum hash perform independ complet random hash function part assumpt hash tabl hash function assign item cell hash tabl independ uniformli random modifi analysi hash function practic definit denot event item prune hash tabl cell total weight denot event item prune hash definit note independ assumpt estim function note expect number item prune np note probabl item map cell item probabl total weight cell denot obtain remain obtain express depend distribut weight assum item weight follow simplest form constant chosen ensur clear ln distribut higher power complic express obtain ad insight stick simpl form zipf law deriv close form express prove fairli tricki simpl case recal probabl gener function random variabl defin gx simpl zipf gx express deriv page note assum weight drawn rang deriv made reason approxim gener function extend summat interest probabl sum independ random variabl simpl zipf distribut sum random variabl distribut sum random variabl simpl zipf distribut obtain probabl gener function power gx ln express deriv page notat denot stirl number kind probabl easili sum coeffici obtain express deriv page bound probabl element prune plug estim stirl number obtain desir probabl goal determin optimum choic maxim prune probabl formula stirl plot curv maximum li complet analysi simplifi assumpt assum cell jth element map uniqu cell hash expect number fairli good approxim summat express domin term asymptot approxim stirl number valid small held constant infin due jordan state fl euler constant assumpt asymptot obtain ln ln estim effect vari prune obtain multipl hash tabl valu determin optim choic
IR/290 5 assess softwar librari similar relationship technic report amir david dept comput scienc engin box wa usa abstract compar contrast set softwar librari relat activ select librari candid port applic librari current state art assess librari reli qualit method develop manual inspect read examin consid subject inform reduc cost assess larg collect autom tool develop examin individu librari term tool develop directli compar librari exist user manual integr knowledg learn librari autom develop directli compar contrast librari requir match similar compon class librari relationship inherit tradit compon retriev problem compon return match user queri find compon relationship similar librari show kind match keyword softwar inform retriev introduct compar contrast set softwar librari relat activ select librari candid port applic librari librari select difficult give advic framework budget adequ support framework expect evalu select framework framework current state art select librari candid reli qualit assess form inform tip select framework complet analysi develop manual inspect read examin consid subject inform reduc cost assess larg collect autom tool develop examin individu librari term tool develop directli compar librari exist user manual integr knowledg learn librari autom develop directli compar contrast librari requir match similar compon class librari relationship inherit tradit compon retriev problem compon return match user queri user queri se find compon relationship similar librari show kind match present match match similar match match method match compon librari similar match method convent inform retriev techniqu similar compon retriev tool base index paper concern compon class function simplifi discuss appli class function avoid mind match class class function match class function paper organ section discuss relat work section describ compon relationship extract sourc section present match techniqu section show similar match method section present result section discuss tool base techniqu assess librari section summar conclud number open question relat work mention tool develop directli compar librari exist tool develop manual integr knowledg learn librari problem find similar compon librari tradit compon retriev problem compon return match user queri partial true point compon retriev user compon perform function exact compon exist compar compon librari develop librari expert domain chosen standard terminolog compon fundament domain make match compon librari initi preprocess strip librari section match import concept repres compon complet librari compon retriev techniqu index facet formal specif interest autom techniqu requir domain analysi formal specif exclud facet formal specif discuss index method simpli text librari compon index standard inform retriev techniqu manual domain analysi requir research observ method work librari includ extens document unix man page reli regular text rel word frequenc lexic affin suggest combin librari document structur inform extract sourc inherit relationship restrict kind librari compar decid reli compon document regular defin similar measur make heavi structur inform extens manner describ similar measur section inform extract describ compon relationship extract librari sourc code extract process languag depend aspect approach tool handl compon mention compon class function extract type sourc union extract function member class class member variabl function member variabl function argument pointer instanc relationship extract relationship compon occur inherit class associ extract relationship sourc match librari comput similar measur similar match inherit composit common techniqu objectori librari class inherit composit class class class member variabl member variabl express acquaint relationship object librari inherit composit express captur similar view inherit composit form likelihood relationship match direct relationship indirect case doesnt directli inherit widget librari inherit librari practic observ composit syntact construct distinguish weaker acquaint relationship languag develop member variabl real instanc pointer refer instanc composit pointer refer instanc languag class composit find code class member alloc instanc invoc invoc relationship call function direct relationship indirect indirect invoc problemat function indirectli invok invok invok case sequenc call end invok call avoid simpli indirectli invok sequenc direct invoc call sequenc occur depend logic associ class member function class member function function class relationship wai languag notion class member function recal make distinct member variabl member function variabl declar structur structur common practic develop associ function structur suppli pointer instanc structur paramet function type infer associ function structur oper match compon librari serv similar librari find compon librari due convent word compon separ combin develop prefix compon distinct librari prefix prevent clash librari applic code show standard compon show match class function librari base standard standard basic step standard identifi word remov word word append form word start letter identifi word step standard compon split sequenc word infer word boundari underscor case infer word boundari underscor identifi word case chang involv transit lower case letter upper case letter signal start word sequenc letter end underscor constitut singl word jx window separ sequenc letter lower case split word includ letter word start letter subsequ letter separ sequenc word jx separ good develop separ word compon clear concept written versu librari variat step attempt break individu word string english word dictionari lookup word string broken word case separ string word shorter word begin make tabl common avoid problem match abbrevi word librari independ includ domain depend requir domain abbrevi break word string string broken sequenc remov word mention develop prefix compon distinct librari prefix prevent clash librari applic code true languag space manag earli version remov librari prefix import miss match prefix librari prefix word identifi librari prefix simpli prefix occur frequent prefix contribut meaningfulli occur techniqu ident class function separ independ perform step yield sequenc word compon librari remov maxim prefix letter occur time prefix compon librari find yield good number compon librari procedur remov prefix prefix librari remov standard prefix suffix remain word compon includ standard function prefix standard class suffic remov suffix word sequenc languag develop write code style function member class class function widget show function defin show member widget class standard practic suppli pointer widget structur paramet widget show function remov class match librari written languag practic requir standard class check type paramet function function remov class function match librari match compon standard librari observ standard process map librari class map jx librari function map address simpli make compon part compon standard member member class famili member function famili match compon famili librari rememb member famili develop class function famili set librari inspect member famili librari defin relationship famili section relationship famili hold relationship hold member famili class belong class class member function relationship famili past function famili simplifi exposit remaind simpli similar match case similar class function librari match match techniqu section describ complementari similar account class function relat comment assum standard techniqu section carri mention simpli defin similar measur close compon relat idea section borrow heavili field inform retriev similar measur rank document return queri order relev queri view compon document comput similar compon librari compon associ compon set term extract automat sourc code term weight denot weight term compon compon defin similar weight similar cosin coeffici express divid compon dont term yield remaind section show extract term determin weight compon librari independ librari extract term term compon extract sourc inform class function relat comment expand common put word base stop list filter word tend distinguish compon includ word commonli terminolog compon word good indic compon compon match entireti extract term similar match associ function class provid inform class class function provid inform function extract term compon discuss associ give inform inher compon class inherit overrid member function ancestor inherit hierarchi expect inform provid inher class member defin present ancestor make similar observ deleg deleg make composit power inherit class call member function function instanc variabl analog class defer request parent inher inher function inher class ancestor defin call member function cs instanc variabl extract term class inher function comment extract term compon comment includ comment describ comment function implement comment begin compon immedi follow declar interven newlin omit comment buri definit compon includ comment includ comment function function class inher ignor comment class comput weight term extract sourc code show comput weight term compon standard practic defin weight product document frequenc frequenc mention reli term frequenc case short frequenc reli structur inform suppli weight defin weight product document document frequenc document frequenc term librari occur frequent good discrimin weigh heavili yield inform greater weight denot total number compon denot number compon term definit log weight weight term compon comput sum direct contribut dc term compon indirect contribut ic obtain close relat compon calcul dc recal term class extract sourc inher function relat comment term sourc denot weight sourc inher term compon direct contribut dc term ts weight compon dc defin ae bk term sourc constant indic import sourc minimum number word term sourc term weigh heavili obtain dialog obtain find yield good result class function match valu experi section shown comput direct contribut dc weight indirect contribut ic consid term close relat compon librari class graph node consist class librari edg denot inherit composit relationship length shortest path indirect contribut ic class class ic dc domain librari languag class function gui java thread sim tabl librari experi set class reachabl exclud function match similarli graph edg call function result perform experi determin match similar match techniqu work practic compar librari graphic user interfac graphic comparison librari approach compar librari tabl show class function famili count match tabl show result match class present mix quantit qualit comparison show number match list match clear match good identifi fundament class function librari compar gui match identifi class dialog function cut past match miss fundament domain concept thread import concept concept thread task match comparison similar match regard similar match tabl show result similar match class present domain librari match class match gui jx thread semaphor sim thread queue tabl result class match domain librari match function match gui jx thread wait sim tabl result function match similar match compon question serv essenti librari share import exclud match compon case handl match similar match written compon compon rank match similar measur defin section show similar match rank top observ match class serv similar note import domain concept identifi similar notabl match includ qt observ match class share match repres role manag separ machin context thread includ program separ match includ qt crystal function similar match yield match qt qt jx denot member function librari overrid render widget type notabl match includ crystal function match function perform similar share role case condit variabl thread tool approach support tool built assess java librari set tool automat perform similar match section illustr assess domain librari class similar match gui jx thread sim tabl result class similar match rank match shown domain librari function similar match gui jx thread simul tabl result function similar match rank match shown demonstr tool gui qt jx librari compar section refer figur remaind section match gener class function show class function relationship share librari shown figur result similar match includ complementari inform view class repres class shade rectangl function rectangl associ relationship class function black bidirect arrow relationship inherit repres unidirect arrow direct dark light shade direct indirect class view class class primarili concern class relationship set class view class match librari class match librari class view show import function concept domain diagram includ import class printer kei function class scroll widget fundament relationship class fact button scrollbar directli inherit widget black slider inherit widget indirect manner grai relationship shown includ direct widget rect painter indirect window rect function view function call primarili concern function invoc relationship function view includ function match set librari function match librari function view identifi role plai class librari role class view function view figur class function view qt jx librari plai class clear class view widget plai role function function view find role role plai plai plai window role plai qt jx observ function librari font directli call indirectli call window function show code defer request parent class deleg call instanc variabl link sourc view link sourc critic part system view compon relationship match provid start point explor sourc code collect librari click compon class function member famili librari access sourc code mention present result similar match view user click similar match famili member sourc click painter easili compar draw primit member support librari qt jx support qt support curv click similar match tabl user compar contrast edit capabl class famili found qt member class famili found jx explor sourc identifi easi creat widget librari simpli inspect sourc code class button scrollbar directli inherit widget qt jx click button class explor sourc notic librari implicit invoc provid coupl object improv maintain investig show qt connect member signal member receiv jx connect object object member futur work tool support develop directli compar contrast librari kei part approach involv match similar class function relationship present match match similar match match techniqu match similar match import identifi similar compon found perform comparison librari domain found similar match yield complementari inform demonstr show approach appli practic discuss class function view link compon sourc librari shown assess gui qt tool futur plan conduct extens user test approach practic match compon relationship softwar system complet wai paper assess collect librari describ develop softwar librari identifi compon relationship relev applic interest wai match compon softwar system relat activ acknowledg michael ernst valuabl feedback research refer design recoveri mainten jark retriev reusabl softwar compon intern workshop softwar page croft harper probabilist model document retriev relev inform frake editor inform data structur algorithm prentic frake softwar inform retriev hawaii intern confer system page frake pole empir studi method reusabl softwar compon ieee transact softwar vlissid design element reusabl softwar helm maarek integr inform retriev domain specif approach retriev class librari page webb method analyz properti softwar architectur intern confer softwar page kazman carrier view extract view fusion architectur understand intern confer softwar kaiser inform retriev approach automat construct softwar librari ieee transact softwar illustr librari approach ieee intern confer autom softwar sullivan softwar bridg gap sourc model acm sigsoft symposium foundat softwar page freeman classifi softwar reusabl ieee salton yang specif term valu automat index manag objectori framework van rijsbergen inform retriev chase manipul recov softwar architectur view intern confer softwar page
HCI/291 4 ad hoc sensor empir studi elain kristof van laerhoven martin abstract research classifi recogn complex concept direct focu increasingli distribut larg amount sensor amount sensor data obstruct tradit algorithm central sensor data direct central locat process spread process sensor data network distribut algorithm harder inspect evalu sensor board wireless commun explor approach achiev emerg distribut percept environ realtim cluster experi simul platform valid comput unit limit resourc wireless sensor distribut decentr percept introduct obviou distribut inspir great extent biolog highli redund sensor form duplic touch distribut network aim investig impact distribut sheer number sensor modul percept environ move task applic prove concept learn distinguish complex captur sensor improv qualiti quantiti distribut benefit approach mention earli sensor fusion literatur brook iyengar redund sensor lead robust system faulti sensor effect distribut sensor higher chanc captur relev aspect spatial cost produc sensor modul perform recognit concurr comput depart lancast lancast unit kingdom consid sensor smaller requir concentr paper cluster data origin numer fix set concurr oper environ prime requir cluster decentr implement hardwar platform base microcontrol limit memori output distribut sensor network distribut storag typic environ research interact techniqu ubiquit comput gradual move object monitor environ hardwar sensor research refer al sensor approach context awar attract attent research domain al lim hardwar platform platform experi paper collect section describ characterist order provid insight illustr limit unit embodi sensor commun interconnect core sensor modul pic microcontrol clock offer byte data memori bit memori figur arrang sensor librari modul easi access sensor valu serial line connector connect sensor modul pc interfac commun modul commun modul base rf stack wireless maximum rate current implement rf stack support broadcast pin commun sensor modul interfac offer read write access field strength access ip applic data packet figur modul combin make sensor modul light pressur sensor wireless commun modul board measur mm kohonen map neuron function exist abstract level brain laboratori rat learn locat brain cell cortex respond locat kohonen map similar unit recruit topolog task depend sensori input commonli classifi neural specif competit unit compet specif task unit prototyp vector wi refer codebook vector weight local storag kind input vector introduc system initi prototyp vector dimens equal input start vector random small compon input enter improv updat α winner wi call learn rate situat neighbourhood function rang depend distanc current som unit winner winner unit prototyp vector closest current input vector euclidean winner arg min ¢ neighbourhood function implement gaussian winner nb η winner nb nb paramet indic width radiu neighbour win unit updat prototyp vector significantli map unit appli map suffici amount input data present result topograph similar data map unit region neighbour unit activ similar input data figur show unit recruit state environ colour unit state declar winner figur map show region win unit state environ implement kohonen som implement base central method elabor implement platform simul distribut implement kohonen organ map produc algorithm variat tradit central unit som embodi record prototyp vector resembl kind input experienc note creat stress vector easili fit memori topolog fix defin physic distanc unit sourc code data file download input unit similar read state environ tradit som input unit unit result network resembl research grow som som unit tend commun unit network consist packet encapsul inform complet phase read sensor unit compar valu intern store randomli prototyp vector calcul euclidean distanc vector packet creat broadcast network element list tabl timestamp provid elimin outdat packag receiv packet unit identifi winner search minimum error calcul close winner physic prototyp vector updat shown updat rule unit id packet timestamp error distanc prototyp tabl packet descript kohonen map implement output network win consist selforgan provid iter introduc network chang rapidli discuss experi simul platform discuss section result present produc dataset data actual sensor execut simul platform design close hardwar unit evalu impact vari learn rate neighbourhood radiu whilst set sensor data dataset visual time seri plot figur note sensor data similar unit physic close intens light instanc legend higher unit posit directli underneath light sourc acceleromet data bit board posit fashion read acceleromet reflect posit notic temperatur chang slightli sound tend vari lot pressur sensor unit synchron data observ sampl figur dataset sensor valu unit state environ light talk peopl nearbi light remain light turn talk peopl nearbi light remain turn heat success implement kohonen depend heavili choic learn rate neighbourhood radiu paramet concentr import number unit larg evalu impact chang neighbourhood radiu error winner figur error win unit id time high learn rate unit store prototyp overwritten current input error winner figur error win unit id time normal learn rate unit special unit special context introduc long claim unit figur show behaviour som learn rate high learn unit easili overwrit prototyp vector kind input vector problem machin learn relat result smaller learn rate preserv prototyp fluctuat sensor data recruit unit context sound level vari result experi show selforgan place similar sensor data map sensor unit topograph similar data cluster region environ popul sensor unit aim appli artifici life principl domain context cluster eventu context classif discoveri provid flexibl robust constantli chang environ sensor board simpl har collect intellig aim produc system individu sensor board network sensor board learn special recogn state environ context experi demonstr cluster incom sensor data distribut sensor modul limit process capabl acknowledg express gratitud colleagu sponsor inform system technolog framework european commiss refer context awar wearabl ubiquit comput intern symposium wearabl comput ieee press sensor fusion mit press highli redund robot analog distribut learn nato advanc research workshop highli redund robot itali fusion prentic hall competit learn method artifici intellig technolog adapt pattern classif parallel develop code neural featur detector biolog cybernet mobil network smart intern confer mobil comput network august map heidelberg distribut servic inform dissemin sensor network system adapt journal franklin elsevi scienc project home page
ML/292 6 larg dataset arbitrari metric space venkatesh raghu ramakrishnan johann gehrk comput scienc allison powel jame french depart comput abstract cluster partit collect object group call similar object fall group similar object defin distanc function satisfi triangl distanc function collect object describ distanc space distanc oper data object comput distanc scalabl algorithm literatur assum special type distanc vector vector oper object present scalabl algorithm design cluster larg dataset distanc space algorithm bubbl scalabl cluster algorithm data distanc space algorithm improv bubbl reduc number call distanc algorithm make singl scan produc high cluster qualiti detail studi algorithm term scalabl qualiti cluster show result appli algorithm dataset introduct data cluster import data mine problem goal cluster partit collect object call object fall group similar object captur distanc function problem cluster larg dataset distanc space oper data object comput distanc function satisfi triangl inequ object author support grant ibm corpor support ibm corpor fellowship support nasa work support part darpa contract coordin space repres vector vector vector addit subtract form cluster reduc time space requir cluster problem oper distanc space make problem harder distanc function distanc space domin resourc requir domain string distanc string edit distanc comput edit distanc string length requir comparison charact comput euclidean distanc vector coordin space requir oper algorithm literatur paid attent issu cluster algorithm data distanc space abstract essenti featur birch cluster algorithm birch framework scalabl cluster algorithm instanti birch result scalabl cluster algorithm distanc bubbl fm remaind paper organ section discuss relat work cluster initi approach section present birch framework increment cluster algorithm section instanti framework data distanc space result algorithm bubbl section evalu perform bubbl synthet dataset discuss applic distanc space refer arbitrari metric space term distanc space distanc comput object call space coordin space vector oper centroid differ vector edit distanc string number simpl edit oper requir transform string dataset section conclud section assum reader familiar definit standard metric lp norm centroid set point coordin space full paper relat work initi approach discuss relat work import issu cluster data distanc space cluster data coordin space data cluster extens studi statist machin learn pattern recognit literatur algorithm assum data fit main typic run time size dataset scale larg cluster receiv attent import data mine problem method effici earlier algorithm assum object fit main result sensit input order techniqu improv abil deal dataset focuss relev part techniqu depend index vector coordin space notion cluster discov cluster arbitrari shape reli speed scalabl nearest neighbor search cluster data distanc space birch design cluster larg dataset vector limit amount main memori algorithm reli heavili vector defin coordin space cure hierarch cluster algorithm discov cluster arbitrari shape reli vector oper cluster data distanc space import issu cluster data distanc space versu data coordin space concept centroid defin distanc function potenti discuss section natur cluster applic place requir tough met algorithm cluster algorithm reli vector calcul repres cluster improv comput time algorithm cluster data distanc space approach map object coordin space preserv distanc pair object cluster result vector scale techniqu transform input md method set sin distanc function integ output set imag vector coordin space call imag imag vector distanc object equal distanc respect imag vector md algorithm scale larg dataset reason assum object fit main memori md algorithm literatur comput distanc pair input object step complex lin al develop scalabl md method call preserv distanc approxim imag space requir fix number scan data approach cluster data distanc space map object coordin space cluster result vector scalabl cluster algorithm data coordin space call approach option empir evalu section experi show qualiti cluster obtain good applic cluster singl algorithm serv requir obtain summar larg amount data shown effect make complex data analysi feasibl approach develop algorithm return domainspecif cluster method analyz subclust output algorithm birch present birch framework gener notion cluster featur build block birch algorithm birch famili object read sequenti insert increment evolv cluster repres gener cluster featur object read insert closest potenti requir examin exist cf birch organ cluster call cf search cluster requir time logarithm number cluster linear scan remaind abstractli state compon birch framework instanti compon gener concret cluster algorithm gener cluster featur cluster algorithm cluster detect data naiv object cluster cluster correspond region set object treat collect summar call summar cluster gener cluster featur entir dataset fit main examin object simultan comput cf cluster increment evolv cluster cf object scan sequenti set cluster updat assimil object object insert cluster long insert deterior cluster concept explain cf updat reflect insert object cluster main cf meet requir increment updat object insert cluster suffici comput distanc qualiti metric cluster cf effici reason occupi space naiv calcul measur cf faster calcul involv object cluster cf describ structur function cf tree structur similar number node cf bound number node cf tree classifi leaf node posit tree node entri form pointer child cf cf set object summar root child leaf node form leaf entri cf cluster cluster leaf level satisfi threshold requir control tight qualiti cf direct object cluster closest function entri leaf entri cf entri exist object leaf leaf entri repres dynam evolv cluster object node downward entri select direct child node closest entri similar identifi region zoom examin downward continu till reach leaf node reach leaf node insert cluster closest threshold requir violat due insert form cluster space split leaf node entri set leaf entri divid group group consist entri entri leaf node creat parent node path root split omit detail insert object cf similar birch data exist cluster updat cluster form number node cf tree data scan complet due format cluster reduc space occupi cf tree reduc number cluster maintain reduct number cluster achiev merg close cluster form bigger cluster birch merg cluster threshold leaf cluster tree leaf cluster tree insert cf object leaf cluster treat collect smaller cf built leaf entri insert data scan resum point interrupt note cf insert algorithm requir distanc measur node entri select closest entri level insert insert singl leaf birch framework requir distanc measur instanti cf cf cf increment distanc threshold requir compon birch instanti deriv concret cluster algorithm bubbl instanti birch data distanc space result algorithm call ble recal cf leaf node differ function increment maintain inform output direct object leaf cluster section describ inform cf increment leaf level cf leaf level summari statist leaf level cluster discov return inform number object central locat object radiu distanc support creation object oper set assign actual object cluster cluster center defin set object gener centroid distanc space introduc object respect set object concept imag space set object distanc space imag space set object coordin space imag vector object distanc imag vector distanc object remaind denot distanc space domain object distanc function definit set object distanc space object defin def pn defin object definit set object distanc space rk function call transform jjx jj euclidean distanc rk call rk imag space object call imag vector def exist transform lemma lemma set object distanc space exist posit integ function transform object distanc distribut set object cluster center defin object minim averag dissimilar object pn minimum motiv heurist expect similar heurist work map vector euclidean space map lemma show transform object imag vector closest centroid set imag vector gener centroid distanc space gener gener definit radiu distanc cluster distanc space lemma set object distanc space transform centroid definit set object distanc space defin def qp definit defin distanc metric cluster featur cluster consist object defin distanc def averag distanc def bubbl distanc metric leaf level threshold requir object insert explain increment mainten cf describ increment mainten cf leaf level cf set object concern section denot set object increment mainten number object cluster trivial concentr increment mainten recal cluster object minimum long object main maintain increment insert updat valu object select object minimum strategi requir object main viabl option larg dataset exact mainten develop heurist strategi work practic significantli reduc main memori requir classifi insert cluster type type motiv heurist type insert type insert insert singl object cluster object object dataset type insert read data make common type insert type ii insert insert cluster object type ii insert occur cf rebuilt section type make transform coordin imag vector centroid set imag lemma approxim addit heurist motiv observ observ insert object cluster assum subset ci main memori rk transform rk pn centroid nx nx nx nr approxim significantli reduc main memori requir observ leaf cluster cf object insert distanc metric leaf cluster threshold requir cf implic observ long set object consist object distanc due insert updat consist object assum object dataset fit main retriev object disk repeat retriev object fortun observ larg set object set close observ motiv heurist mainten long jcj small constant object main memori comput jcj larg invok observ maintain subset size object lowest valu closest highest replac op experi confirm heurist work practic type ii cluster merg transform imag vector object centroid radii centroid li line join exact locat line depend valu threshold requir distanc bound shown assumpt motiv heurist mainten type ii insert close threshold criterion satisfi impli close expect cluster nonoverlap distinct cluster cf due lack prior inform assum object uniformli distribut merg cluster valu close type ii insert expect correspond peripheri cluster maintain object peripheri cluster cf farthest object valu respect cluster maintain object leaf cluster call repres object call number store repres object enabl approxim increment mainten increment mainten radiu similar detail full paper maintain inform cf leaf cluster number object repres valu repres radiu cluster statist increment cluster evolv cf level instanti cluster featur level birch framework describ increment mainten sampl object birch function cf entri guid object prospect cluster entri node nl summar distribut cluster root algorithm cf repres set call object sampl object union sampl object entri sampl object nl describ procedur select sampl object child node nl entri denot set sampl object collect union sampl object entri nl number sampl object collect node upper bound constant call sampl size number ni ss tribut nj tion child node repres distribut sampl object repres defin distanc measur newli insert object cluster leaf sampl object randomli pick leaf cluster randomli pick sampl object updat sampl object cf evolv gradual object insert accuraci summari distribut captur sampl object entri depend recent sampl object gather period updat updat affect currenc sampl time updat sampl object incur cost strike balanc cost updat sampl object currenc split nl redistribut entri node updat sampl parent creat sampl entri reflect distribut children node updat sampl object entri nl children split distanc measur level object insert cf distanc defin ensur entri sampl object child select sampl object li repres ith leaf entri leaf node distanc li defin distanc instanti distanc measur complet instanti birch deriv bubbl omit cost analysi bubbl similar birch insert object bubbl comput distanc sampl object node downward path root leaf node distanc function edit distanc address issu algorithm improv bubbl reduc number invoc give overview describ overview set distanc function integ quickli time linear comput vector imag euclidean imag space distanc imag vector close distanc object transform ax defin line join object object call pivot object space defin ax imag space number call made map object paramet set import featur fast increment map abil lin al detail object project coordin ax comput vector call distanc object measur euclidean distanc imag vector descript differ bubbl usag sampl object node set sampl object node imag space imag space measur distanc incom object cf cf entri function guid children approxim imag space suffici describ construct imag space usag detail node nl map coordin space call imag nl return vector object centroid imag vector centroid cluster repres defin distanc metric distanc preserv transform map sampl object vector centroid set imag vector cf consist maintain imag vector pivot object return pivot object defin ax imag space construct object increment map defin distanc euclidean distanc def distanc entri defin measur distanc nl distanc bubbl altern leaf level leaf level cf reason leaf level approxim imag space construct accur reflect rel distanc inaccuraci erron insert object cluster deterior cluster qualiti similar error level entri redirect wrong leaf node form cluster impact error mainten cost cf cluster sever maintain accur insert reconstruct leaf node overhead repeatedli invok offset gain due measur distanc imag paramet imag node sampl object node map independ imag space problem find imag space studi set imag node techniqu find imag incorpor easili map algorithm experi bubbl dataset show result sensit small deviat valu number sampl size found number work dataset includ studi section sampl size depend branch factor bf cf observ bf work practic perform evalu evalu bubbl fm synthet dataset studi show ble scalabl high qualiti cluster algorithm dataset evalu methodolog compar dataset point distribut cluster cluster center uniformli distribut cluster center distribut sine wave dataset visual observ cluster produc bubbl gener dataset agraw al box divid cell halv rang dimens cluster center randomli cell chosen randomli number cluster dataset point distribut uniformli radiu randomli pick dataset point cluster denot dataset consist vector exploit oper specif coordin treat vector dataset object distanc object return euclidean distanc function describ evalu methodolog return bubbl cluster hierarch cluster algorithm obtain requir number cluster minim effect hierarch cluster final amount memori alloc algorithm adjust number return bubbl close actual number cluster actual number cluster synthet dataset final cluster form merg final cluster centroid merg paramet sampl size branch factor number fix found result good cluster qualiti imag set equal data dataset scan qualiti result birch shown independ input order bubbl instanti birch framework abstract present result time associ object cluster repres object closest introduc notat describ evalu metric actual cluster dataset set cluster discov bubbl ai centroid cluster ai ci ci denot number point cluster statist pattern recognit commun evalu cluster qualiti speed distort pk cluster tight cluster qualiti cj jj averag distanc actual centroid cluster ai cj closest ai number call time algorithm cost algorithm extrapol perform distanc function comparison option map space birch cluster result vector cluster obtain bubbl shown figur centroid cluster obtain birch shown figur distort valu qualiti cluster obtain bubbl option dataset bubbl tabl comparison option qualiti cluster dataset place result proper mention averag distanc centroid cluster ai actual point dataset closest ai qualiti tabl observ cq valu close algorithm cq actual comput distort distort bubbl tabl cluster qualiti time bubbl birch figur bubbl figur figur birch time time multipl multipl time time time figur time figur figur time minimum distort valu match observ point cluster scalabl studi scalabl characterist respect number point fix number cluster vari number data point figur plot time valu ble number point make observ algorithm scale linearli number expect bubbl consist outperform due overhead distanc function space origin space euclidean distanc constant differ run time suggest overhead due remain constant number point differ constant overhead due incur node cf tree split distribut cluster captur node split smaller valu overhead due remain number point differ valu studi scalabl respect number vari number cluster number point constant result shown figur plot time versu number cluster linear data clean applic bibliograph convent record bibliograph item author affili problem user familiar set convent expect usual form retriev relev inform entir collect search part integr creation joint author file class string maintain class assign canon form process reconcil variant string form ultim requir domain knowledg inevit human significantli speed achiev rough cluster metric edit distanc group close relat entri initi cluster act repres string earli aggreg act step aggress strategi stage risk erron separ close relat string error made placement repres move locat small reduct data size cost subsequ detail analysi involv domain expert appli edit distanc techniqu obtain versu number cluster full paper exampl detail full paper cluster appli problem view applic form data clean larg number close relat string differ transposit charact singl cluster preparatori detail domain specif analysi involv domain expert compar cluster approach rel edit distanc result achiev high qualiti time dataset string determin behavior tabl show result dataset string misplac wrong cluster exact set count number misplac string note faster red time spent phase string dataset cluster paramet fm set toler misclassif error toler low return larger number cluster red misclassif lower toler return lower number cluster higher misclassif error algorithm misplac time cluster string red tabl result dataset studi problem cluster larg dataset arbitrari metric space main contribut paper introduc birch framework fast scalabl increment algorithm instanti bubbl cluster data distanc space introduc concept imag space gener definit summari statist radiu distanc space show reduc number call distanc function deterior cluster qualiti tian zhang birch code base christo faloutso david lin provid code refer raghavan automat subspac cluster high data data mine author review librari resourc technic seeger effici robust access method point rectangl scale cluster algorithm larg zezula effici access method similar search metric space dube jain cluster methodolog exploratori data advanc comput academ pattern classif scene analysi xu algorithm discov cluster larg spatial xu interfac cluster larg spatial xu focuss techniqu effici class proc intl sym larg spatial faloutso lin fast algorithm datamin visual tradit multimedia fisher knowledg acquisit increment conceptu cluster machin fisher iter optim simplif hierarch cluster technic depart comput tn applic approxim word match inform retriev autom construct author file digit case studi peter european conf research advanc technolog digit volum lectur note comput page french cluster larg dataset arbitrari metric space technic shim effici cluster algorithm larg kaufmann find group data introduct cluster analysi wilei seri probabl mathemat kruskal scale sage survei recent hierarch cluster algorithm comput ng han effici effect cluster method spatial data mine shepard analysi scale unknown ii page theori method wong hybrid cluster method identifi cluster amer stat young applic lawrenc erlbaum livni effici data cluster method larg
DB/293 3 manipul interpol data easier thought stephan grumbach philipp rigaux luc inria inria abstract data defin interpol frequent found applic involv geograph move spatiotempor data data lead potenti infinit collect elev point definit base associ collect sampl interpol function naiv manipul data direct access sampl interpol function lead cumbersom inaccur queri desir hide sampl interpol function logic manipul perform automat model data infinit relat map elev yield infinit ternari manipul standard relat queri languag mention interpol definit clear separ logic physic level ensur accuraci simplic data manipul show evalu includ comput sampl collect interpol function effici algorithm oper physic level permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb introduct extens technolog handl spatial applic complex problem relat model data difficulti pertain logic queri reason complex queri process context spatial effort decad devot data recent emerg involv instanc mobil digit elev model requir data space higher constitut challeng spatial model mobil object dem constitut excel exampl specif type spatial data defin interpol interpol data store explicitli comput store data appli interpol function trajectori object posit depend time commonli repres sampl point time posit full trajectori recov point linear interpol dem point earth variabl typic height sea level repres finit set point elev interpol base triangul locat applic requir manipul interpol traffic intellig mobil earth scienc meteorolog applic track motion aircraft area typic queri aircraft aircraft region altitud aircraft respect ground sea queri address simultan kind inform exist queri page languag sql complet inadequ main contribut paper design data model interpol base infinit relat manipul standard relat meet classic requir logic abstract independ physic queri reason complex queri evalu import aspect model queri exampl express evalu algorithm reli simpl geometr primit main aim paper demonstr desir give access sampl interpol function user data manipul show lead cumbersom instanc sampl inaccur produc wrong output due wrong interpol clear separ logic physic sampl interpol satisfi suggest extend relat data model abstract infinit point extens store explicitli comput interpol framework offer sound model interpol data abstract interpol formal classic depend base domain space time move kei interpol function depend kei interpol variabl relat queri languag queri defin simpl interfac worri complex data structur geometr algorithm simpl data format introduc repres abstract relat physic level fundament issu effici queri evalu complex oper geometr object dramat dimens dimens reason practic interpol data arbitrari potenti problem manipul object interpol data constitut specif type object trajectori view dem space dimens base domain interpol interpol attribut view object space intuit techniqu evalu queri geometr algorithm oper dimens dimens contribut identifi class queri evalu interpol data base dimens effici geometr algorithm show manipul effici complex data higher standard techniqu relat relat work interpol data studi literatur area data integr extern interpol procedur sql introduc addit sampl review approach section work aim integr uniform data model kind interpol data area dem comput geometri geograph inform system dem repres natur phenomena continu variabl recent manag mobil object receiv attent instanc european chorochrono project object present reli concept dynam attribut encapsul motion inform mobil object domino implement test capabl altern approach mobil object geometr object data type oper extend tradit approach ad type handl object area constraint work address model data relev research concern index mobil object uncertainti spatiotempor inform investig function commerci system manipul interpol data system provid spatial type relat model space separ entiti interest phenomena continu variabl geograph refer data support data point sampl triangul tin figur triangul irregular network relat commerci exist modul dedic manag dem softwar specif set combin elev data classic map user awar physic order appli proper oper product simpler creat script call spatial oper provid core high level queri languag present paper simpl logic model hide end user intern data oper appli evalu queri data model integr natur mobil object spatial constitut innov approach model applic remaind paper organ section present gener issu relat model interpol data demonstr logic level describ gener relat framework algorithm section practic motiv restrict model extens work present interpol data model approach model interpol impact queri express interpol data digit elev model defin continu function denot denot result function common dem elev height sea model relev attribut dem gener base finit collect sampl valu obtain interpol wai defin depend sampl polici interest obtain triangul irregular tin tin base triangular partit space assumpt distribut posit vertic triangl elev record infer point linear interpol vertic triangl figur categori exampl origin spatiotempor applic phenomena depend time trajectori move object share fundament common properti previou trajectori tripl function time denot altitud finit support set posit posit time approxim interpol nearest posit data repres ffl finit collect sampl ffl interpol function manipul data priori easi reconstruct input data importantli gener output interpol integr extern interpol procedur sql languag syntax sql extend aggreg nest queri interpol data logic model user manag interpol tin plane defin equat assum tin repres relat elev collect triplet interpol function syntax lead queri page sampl point initi sampl sampl middl point figur erron sampl interpol function select elev method entri step queri correspond oper step user specifi output collect point elev requir entri defin start step distanc consecut gener point bound defin set point segment step interpol function appli input sampl order elev point output sampl method specifi interpol function explicit specif interpol mechan queri syntax technic problem import dichotomi sampl interpol user associ interpol function sampl store result consist sampl interpol function distinct manipul sampl interpol function contradict proper semant data result integr compon lead erron result comput cross section tin sampl point usual linear interpol function origin data shown figur figur sampl defin user return point input function obtain flat line ignor mountain figur illustr bad choic output middl point obtain result repres actual data consid extrem exampl illustr wrong specif sampl interpol result import loss inform output sampl prefer leav user forget sql execut gener infinit sampl point specif sampl choic interpol function made data acquisit phase impact data store show relat system complet handl sampl prefer prevent user care correct specif consequ system perform task gener output sampl support correct build result exploit properli interpol input manag systemat maintain strong integr element constitut semant interpol sampl interpol function abstract model show data model achiev respect principl abstract data model consist simpli classic relat model infinit relat finit relat give formal definit real number schema finit set relat symbol ariti instanc interpret relat symbol relat ariti queri map instanc relat abstract dem model infinit ternari attribut tupl uniqu trajectori model infinit attribut uniqu case infinit relat satisfi function depend import depend section standard relat queri languag queri infinit relat algebra sql assum elev relat infinit set ternari tupl queri page discuss simpli express select elev note collect sampl interpol function visibl hidden insid data present numer advantag ffl correct answer queri correct user inaccur wrong interpol function ffl standard queri usual oper clear mean worri sampl interpol ffl safeti answer queri infinit fact repres interpol finit collect sampl consid section ffl uniform relat dealt finit interpol present exampl express combin type relat schema relev relat finit interpol queri pure declar schema relat ffl map ground occup locat kei ffl trajectori altitud respect sea level time kei ffl height sea level kei give altitud locat aircraft time select show trajectori aircraft altitud ground select tin show forest select ty tin map tx mx ty forest show part trajectori aircraft higher select lt map mx lx ly sea queri simpl intern machineri function design queri involv view data infinit relat offer good logic interfac user evalu system translat automat queri oper physic storag infinit relat encod finit effect manipul aspect data model data format support interpol relat data format distinguish level data abstract present aim essenti featur relat paradigm physic level support finit interpol special algorithm finit compact encod inform pertain interpol sampl interpol function tin ft partit plane finit triangl insid triangl elev comput linear interpol height vertic point linear function depend boolean predic return true iff point belong tin symbol repres collect ft trajectori move object repres similar posit object record finit time point lead page finit time interv speed object assum constant interv coordin posit time defin index interv respect speed axi object interv trajectori symbol repres collect ft raj predic true iff time interv linear function interpol relat kei fk interpol attribut fh interpol global dimens space variabl fk definit finit descript reli partit fc cell set linear function defin cell repres collect element hc hq denot block relat raj admit queri evalu section devot evalu relat queri interpol relat main characterist comput relat oper data reli geometr comput appli convex cell interpol propag attribut interpol function shown principl verifi classic oper interpol intersect differ window point queri requir algorithm data interpol dimens suggest set interpol object defin subclass full power geometr comput global dimens oper tin mention easili express relat queri abstract relat oper easili find evalu strategi optim design gener strategi queri evalu geometr oper space fact ensur reason evalu complex queri closur requir impli work consist interpol relat interpol dimens bound time complex manipul object dimens algorithm simpl implement end requir kei distinct relat requir queri closur mean queri deliv interpol relat order achiev restrict relat queri consid concentr conjunct queri avoid negat requir kei output relat kei input relat call queri fundament comput aim preserv function identifi kei queri evalu process studi evalu conjunct queri map interpol interpol interpol base input schema typic evalu queri reduc oper kei easi propag interpol attribut proper linear interpol function algorithm reli small set primit oper cell geometr part queri evalu reduc primit list primit proj project cell variabl comput cell intersect linear function convex cell comput interv min imag dimens primit enjoi low time complex found system handl spatial suffic scan vertic convex polygon comput proj rang intersect convex set dimens easi simpl algorithm comput intersect convex polygon algorithm exploit interpol form data order organ evalu combin primit page cell function cell function figur evalu oe ff illustr intuit exampl base simpl schema height describ trajectori usual variabl relat altitud sea kei relat relat attribut interpol respect kei select illustr select effici substitut techniqu queri select oe ff comput part tin defin ff ff ff oper priori involv object block repres hc cell block linear function interpol select point object repres achiev point substitut equat defin object set point satisfi ff ff ff convex object select perform iter set block perform step oper return interpol function remain intersect comput kei attribut inter primit depict figur block consist cell space defin cylind hyperplan function select suffic evalu oper cell instanc select oe ff defin object restrict initi convex polygon yield cut function denot oe oper illustr simpl substitut base interpol reduc oper select primit appli cell join examin techniqu involv queri featur join project start join process substitut techniqu similar previou queri give valu aircraft ground altitud output kei select tini algebra express raj oe select evalu oe queri involv join deliv pair block raj hc hd page triangl space time interv drop term plai role queri anymor join oper creat associ join evalu perform gener substitut replac variabl interpol definit obtain structur comput result join block format hd note interpol function remain unchang simpli exploit function depend perform substitut develop involv applic substitut mechan queri comput ground level trajectori aircraft obtain profil curvatur altitud ground point polylin queri select tin tini algebra express queri similar previou final kei rewrit intermedi structur associ block depend function order kei previou intermedi structur inform pertain interv min max function function put form rewrit system min max assum case occur linear function distinct function assum linearli independ min max describ segment seg space order correct result join data format suffic comput final remov term complet project explain gener comput requir join oper note join involv interpol relat reduc join involv interpol variabl proper function kei join comput base intermedi structur fn cell linear function variabl function defin associ denot subset point imag intersect subset point imag point figur comput suffici evalu join point relationship map qualifi join semant assum map function function rewritten ae defin linear applic remain replac yield cell set easili obtain comput comput comput case function link dimens defin case connect associ space space reduc function comput reli rang comput min obtain figur page kei space kei space map proj proj kei space kei space map singl function figur evalu join denot oper input cell distinct set construct set techniqu consist simpl manipul linear algebra comput imag cell system linear primit rang proj join algorithm simpl nest loop evalu step gener base evalu queri present exampl focu comput join raj algorithm oper cell set function fg link order evalu comput yield segment defin min max replac obtain comput correct valu interpol function unchang result project remov remov result exampl directli relat geometr complex queri interpol dimens relat involv queri intersect trajectori instanc requir comput oper time interv suffic opportun restrict prevent creation extend set geometr primit union differ order evalu queri investig model innov applic involv instanc mobil object digit elev map goal develop effici queri base standard techniqu demonstr logic model separ physic level prove collect sampl interpol function belong physic hidden result queri languag special primit contribut paper show approach simpl formal data relat data format compact support evalu relat queri strike aspect model abil express sql queri geometr data geometr skill challeng issu context complex queri strongli depend dimens crucial properti queri languag data independ complex queri evalu dimens space interpol object manipul cost depend essenti dimens global dimens set algorithm queri evalu present approach offer great potenti optim standard relat queri languag reli exist techniqu page physic data independ leav full control system definit sampl collect case index collect sampl current set assum kei dimens restrict motiv complex reason object dimens effici manipul implement oper simpl straightforward gener idea kei higher dimens evalu perform oper dimens acknowledg grate robert wallac provid illustr figur indebt michel scholl victor vianu comment earlier draft paper refer chomicki revesz geometr framework object proc intl workshop time rh vazirgianni data approach model queri move object editor understand method rh schneider data model data structur move object proc acm sigmod symp manag au cs na tk research network spatiotempor system sigmod goodman joseph handbook discret comput geometri crc spatiotempor data handl constraint proc intl symp geograph inform revesz constraint queri languag journal comput system shorter version vj tsotra index mobil object proc acm symp principl page koubaraki complex queri evalu indefinit tempor constraint theoret comput bruce introduct concept addison optim evalu queri includ interpol procedur proc acm sigmod symp manag pfoser cs jensen captur uncertainti proc intl conf larg spatial page lopez index posit continu move object proc acm sigmod symp manag sharma experi extens oracl technic white dao model queri move object proc ieee intl conf data engin page nascimento gener spatiotempor dataset intl conf larg spatial van digit elev model tin algorithm algorithm foundat geograph inform number page springer chamberlain move object track proc acm sigmod symp manag page worboi comput perspect taylor page
HCI/294 4 electron tourist issu experi keith nigel keith christo distribut multimedia research group depart comput lancast uk abstract describ experi develop evalu intellig electron tourist guid guid system built overcom limit tradit inform navig tool citi visitor tour inher inflex fix start time fix durat constrain satisfi interest major specif interest individu period requir involv expert field develop instal system visitor lancast system combin mobil comput technolog wireless infrastructur present citi visitor inform tailor person context paper present evalu qualiti experi system keyword mobil adapt user interfac evalu introduct rapidli evolv field mobil comput massiv potenti provid dynam multimedia inform peopl move predict year time larg proport web carri mobil devic restrict mobil devic task greatli underestim potenti area research concern explor wai mobil devic provid sophist servic comput applic contextu displai medium user order provid tailor function paper describ issu experi gain develop evalu prototyp tourist guid guid system integr person comput wireless contextawar adapt hypermedia order support inform navig visitor citi lancast guid util wireless commun infrastructur order broadcast dynam inform posit inform portabl guid unit run custom paper main part develop requir support inform navig citi visitor design custom applic meet requir evalu guid qualiti experi guid requir gener approach gather initi set requir guid seri interview member staff lancast tourist inform centr dai spent tic observ inform visitor identifi requir flexibl kei requir guid provid suffici flexibl enabl visitor learn citi visitor prefer follow guid tour explor guidebook street map system capabl act intellig tour guid richli featur guidebook depend import system enabl visitor control pace interact system visitor interrupt tour order break desir visitor feel overli pressur system leav attract prematur inform requir inform present visitor tailor context class context person piec person context histori architectur exampl person context current locat refresh prefer exampl context time open time attract creat tour guid person context creat suitabl tailor tour context present inform citi visitor inform present suitabl ag technic background visitor prefer read languag context adapt present inform depend inform visitor visitor make return visit landmark inform present reflect welcom visitor back term coher describ notion tailor present inform base user support dynam inform studi found requir support dynam inform inform made visitor context deem hypothet scenario visitor tour citi express interest lancast castl start castl close public situat session court session finish earli visitor notifi castl open public support interact servic studi tourist activ lancast reveal number visitor make repeat visit singl dai case member staff specif question make servic offer commonli book accommod order allevi visitor walk back tic question system requir support form electron messag servic system enabl visitor make accommod book return tic develop guid guid system base distribut dynam inform model dissemin guid unit wireless commun infrastructur select guid unit consid wide rang includ tablet pc final select grayscal version fujitsu illustr figur figur guid unit measur weigh base pentium processor batteri life approxim hour wireless network readabl direct sunlight wireless commun infrastructur wireless commun infrastructur broadcast locat dynam inform mobil guid unit shown figur figur guid commun infrastructur citi number wavelan conform ieee standard cell share bandwidth support guid server fact wavelan cell larg diamet depend layout mean guid server support potenti larg number guid unit decid form broadcast base approach data dissemin transfer inform portabl unit obtain posit inform current portabl guid unit obtain posit inform receiv locat messag transmit strateg posit base station adopt approach base differenti global posit system techniqu reason approach requir addit hardwar built area suffici number satellit obtain accur posit approach result lower resolut posit inform guid inform model guid system requir form inform model order repres type geograph inform hypertext inform activ compon react event exist model inadequ repres inform type design built inform model figur guid inform model inform model manag requir repres geograph inform includ special navig point object conjunct locat object determin rout sourc destin locat locat object castl object state repres open hypertext link relat inform guid unit local cach part inform model oper disconnect network period disconnect cach inform model stale result date inform present visitor applic user interfac design user interfac guid base modifi browser metaphor made basi grow accept web familiar browser metaphor tool interact hope posit transfer common web browser make system easi easi learn user previou web experi ascertain extent basic metaphor task support addit function requir guid investig extent differ inconsist standard prove user order guid visitor enter person interest prefer read languag enter detail present screen shown figur figur welcom visitor guid order system approach visitor attempt give guid friendli person base observ novic user find interact system approach perceiv polit friendli person visitor flexibl explor retriev inform citi prefer method requir visitor touch button order perform inform retriev navig citi map creat tour citi commun visitor tic send text messag book accommod visitor simpli head explor citi resort facil provid guid requir wai visitor request navig citi map creat follow tour citi subsect inform retriev touch info button enabl visitor guid inform visitor present choic obtain inform shown figur figur choic access inform option lead present inform base current locat option order visitor queri guid queri person local knowledg area option visitor shown thumbnail type pictur thing nearbi textual descript link option visitor request inform connect current locat earlier version guid system support option constrain search inform specif piec inform believ interest visitor locat achiev provid limit collect hypertext link page seri initi trial reveal method enabl user access inform unsuit visitor frustrat system provid hypertext link access specif inform gener experi aspect guid system taught design kind system care decid constrain inform provid system base context navig map guid system support visitor navig citi enabl view overview map lancast map local area earli stage project discuss system present map appar suffici provid succinct direct earli trial system clear portion visitor view map point visit creat tour citi touch button visitor select attract visit citi tour visitor present attract problem visitor attract necessarili special town guid categori special attract creat tailor tour system account open close time request attract time visit avoid open time queue distanc attract aesthet rout tour visitor request guid navig attract click show instruct button import note recommend order tour chang dynam occur visitor stai locat longer anticip attract announc close earli system regularli calcul current order visit remain attract current time constraint visitor attract recommend guid overrid recommend select attract destin system choic order prevent system behav overli manner reason visitor delai current tour direct nearest provid flexibl involv interfac complex part prove difficult visitor evalu system visitor present direct inform figur present navig inform illustr visitor present succinct detail direct locat tour visitor shown inform current gatewai hypertext link visitor find inform provid awar disconnect oper current guid system commun result situat mobil guid unit network connect fact guid unit cach larg part inform model local enabl function remain period disconnect disconnect oper affect aspect guid function locat messag access interact ticket recept dynam inform kei concern system unpredict visitor period disconnect affect trust system allevi user interfac guid design encourag user form suitabl mental model function system static depend wireless connect achiev provid user level enabl affect connect system decid incorpor metaphor guid user interfac provid visitor feedback current state connect encourag associ function suitabl consid connect feedback provid mobil phone user mobil phone feedback current connect form user receiv bar connect expect limit inabl send receiv call addit user interfac visitor awar state locat updat achiev text messag box state current locat whilst feedback recept locat inform fact user interfac base direct manipul paradigm impli button activ chose icon facil unavail due disconnect consid disabl messag icon oper disconnect chose modifi messag dialogu box state messag oper resum chose approach enabl visitor messag commun coverag facil common mobil evalu expert walkthrough approach reason evalu guid system expert walkthrough provid crude pass evalu usabl prior visitor background span design comput support test full rang guid function period approxim hour expert protocol system interview critic system find expert walkthrough reveal number problem system button layout consist browser fix prototyp field trial anim feedback signifi page download includ prototyp field trial inform button size order encourag user feel encompass adjust made field trial prototyp system learn walk pace visitor adjust tour time appropri present list nearbi adapt attract visit move list visitor notion inform view topic remain unseen difficult select hypertext link touch sensit screen partial remedi font size exist back forward button button request view previou navig instruct appar semant overlap partial solv back forward button tour hypertext link time constraint meant suggest improv made prototyp field trial evalu constrain factor mobil unit limit process power restrict screen size evalu field trial main object evalu stage project valid refin initi set requir set peopl prepar accept tourist guid measur qualiti visitor experi perform time access inform approach evalu guid prototyp field trial subject number constraint felt acut awar fact leisur time tourist visitor system long felt perform predefin seri task method evalu base direct visitor encourag protocol audio record maintain log interact system order gather record number link interview perform order obtain subject opinion system felt approach suitabl main object evalu shadow user observ part interfac problem interview enabl follow problem encount trial enabl tailor durat interview match time constraint visitor find period approxim week peopl volunt system breakdown peopl term gender experi web shown tabl ag profil number male femal web experi tabl profil visitor involv evalu valid requir major visitor appreci flexibl provid abil system tour map guidebook visitor thought system choic express desir system easier visitor express opinion navig inform retriev mechan provid system reassur addit visitor abil receiv dynam menu worthwhil featur provis access interact book mix visitor visitor speak book accommod meant visitor form confirm book place suggest phone call back mobil phone confirm tic subject opinion inform present visitor appreci idea follow link receiv greater level detail relat inform topic visitor express concern miss inform topic express expert user friendli interfac featur microsoft visitor made neg comment friendli person vast major visitor state enjoi guid explor citi person frustrat system inform attract vast major visitor prepar trust inform present includ navig instruct visitor inclin trust system provid reliabl tic number visitor suggest level trust vari appar accuraci inform present subject opinion guid unit reason major visitor basic happi dimens weight portabl guid unit state prefer smaller size devic prefer devic interest result base visitor profil visitor ag profil revel technolog visit approxim link minut ag profil necessarili visitor ag group learn suggest eager explor inform vast major visitor previou web experi felt comfort system follow tour retriev inform navig hypertext link minut train session visitor accept awar inform larg major visitor awar guid unit util wireless commun similar mobil phone bar connect shown interfac reduc function reason major visitor appreci system knew locat area receiv locat updat relat work earliest work develop tourist guid cyberguid extend version system develop wireless connect order enabl visitor demonstr dai observ locat visitor close relat work area intellig electron tourist guid conduct part hip physic project work present tailor museum visitor carri project inform base profil futur work futur intend investig potenti benefit supplement exist infrastructur latest wireless commun bluetooth hope extend guid servic build investig potenti develop addit interact servic extend commun infrastructur place intend assess potenti perform highli comput calcul remot number issu perform remot comput mobil interact affect interact investig futur direct guid util grow accept connect person comput wap phone enabl visitor download softwar devic bluetooth order enabl access inform servic avenu explor potenti make profil persist interest visitor shown interest castl previou citi visit store profil tailor present inform futur visit discuss paper develop evalu prototyp system provid citi visitor inform evalu found surprisingli high level accept wide rang user visitor flexibl provid system illustr enabl visitor level function requir visitor guid unit base form factor input devic input devic enabl system support oper number implic system guid popular form agent requir enter dynam inform system accuraci inform tic request addit council fund order emploi member staff act role implic potenti effect system guid local busi model interest discov critic mass number visitor local busi guid import avenu market product work design interact system base mobil comput system interact system affect design user interfac interact guid larg govern design strateg placement cell order provid area locat resolut network connect experi evalu present inform taught design care decid inform requir user base current context restrict inform access inform attract current visitor frustrat queri system thing visibl distanc import potenti advantag disadvantag borrow modifi familiar metaphor scenario modifi browser metaphor guid semant overlap standard back forward button button request view previou navig instruct leisur industri grow accept technolog person technolog member mobil person suggest member public prepar make technolog tangibl benefit system guid accept public larg show clear benefit tradit facil guidebook base initi member public benefit acknowledg work carri part epsrc fund guid project cooper lancast citi council project receiv support hp bristol lucent technolog refer locat awar mobil interact usabl fourth intern confer hypermedia interact museum method techniqu adapt user model interact support collabor workshop handheld acm confer comput support cooper acm role connect support sensit lectur note comput scienc dynam versu static hypermedia museum evalu intellig label artifici intellig educ confer juli cach dissemin tourist inform guid ieee workshop mobil comput system applic place stai softwar architectur mobil user workshop interact mobil devic august fujitsu technic page evalu adapt navig workshop social navig inform space march acm input devic mobil inform acm atkeson cg rapid prototyp mobil cyberguid case acm intern confer mobil comput acm press mellish explor galleri intellig fourth intern confer hypermedia interact museum septemb ubiquit extend access mobil master gvu technic report media peopl treat media real peopl cambridg adam comput workshop mobil comput system applic
AI/295 2 reason concret domain lutz rwth theoret comput scienc germani abstract descript logic formal reason conceptu knowledg abstract level concret domain integr descript logic reason reason concret object time spatial region import combin build wide accept complex reason concret domain formal analyz effici algorithm develop paper close gap provid tight bound complex reason concret domain present optim algorithm introduct descript logic knowledg reason formal deal conceptu knowledg abstract logic level varieti essenti integr abstract knowledg knowledg concret natur exampl includ kind numer data tempor spatial inform import applic area found depend integr reason concret knowledg mechan engin reason aggreg tempor spatial reason descript logic system classic kri provid interfac attach extern reason facil deal concret inform complex combin reason abstract concret knowledg formal analyz provabl optim algorithm develop recent effici implement express descript logic fact concentr logic reason pspace import reason system fail integr concret knowledg complex result effici algorithm baader extend descript logic concret theoret approach integr reason abstract concret knowledg basi descript logic defin descript logic concret domain extend oper featur agreement featur disagr lead logic combin logic algorithm decid concept satisfi abox consist problem logic complex reason formal analyz reason involv satisfi check concret complex combin formal depend complex reason concret domain algorithm prove polynomi space impli reason provid reason concret domain algorithm optim obtain complex result carri descript logic algorithm techniqu introduc paper vital effici implement simpl illustr express concept man man primit wife featur singl valu concret predic concept describ set men boss coincid wife higher wife person knowledg concret type man knowledg abstract natur coincid wife boss featur agreement oper express syntax defin section descript logic descript logic introduc start formal specif recal definit concret domain definit concret domain pair set call set predic ariti predic concret domain call admiss iff set predic close negat satisfi problem finit conjunct predic decid basi concret syntax concept defin definit disjoint set featur composit featur call featur chain element concept role predic ariti featur express simpl featur featur chain length featur chain abbrevi set theoret semant definit interpret consist set abstract interpret function set disjoint interpret function map concept subset role subset featur partial function written featur defin composit partial function symbol defin definit interpret function extend complex concept fa fa fa fa fa notion role synonym role interpret model concept iff concept satisfi iff exist model concept subsum concept iff interpret subsumpt reduc satisfi iff concept unsatisfi note featur agreement featur disagr oper object object agreement disagr concret object express concret domain includ equal predic agreement disagr concret abstract domain express approach chosen global agreement disagr consid oper introduc assert formal definit od oa disjoint set object element od call concret object element oa call abstract object defin definit element oa element od express assert finit set assert axiom call abox interpret concept languag extend assert languag map object oa element object od element uniqu assumpt hold distinct object interpret satisfi assert axiom iff iff iff iff iff interpret model abox iff satisfi assert axiom abox consist iff model satisfi introduc definit reduc abox consist concept satisfi iff abox fa cg consist algorithm decid consist abox present algorithm complet tableau frequent decid concept satisfi abox consist descript logic complet algorithm work abox set complet rule strategi appli rule assert axiom abox algorithm start initi abox consist decid satisfi concept abox fa cg consid algorithm repeatedli appli complet rule ad make knowledg implicit abox explicit algorithm succe construct abox complet complet rule obviou model model complet algorithm decid satisfi concept execut polynomi space algorithm decid consist featur agreement abox algorithm exponenti space worst case due fact algorithm collect axiom form domain obtain rule conjoin big conjunct final test satisfi wrt concret domain size conjunct exponenti size obtain polynomi space algorithm decid consist concret domain satisfi test broken independ polynomi size complet algorithm decid consist abox develop algorithm decid satisfi concept algorithm reduc abox consist concept satisfi construct number abox similar reduct found give formal descript complet algorithm complet rule defin defin rule succinct function succ chain introduc abox object oa featur chain succ denot object found start object succ denot special object part abox object oa call fresh object oa object od featur chain function chain defin chain oa distinct fresh set complet rule formul note complet rule rt outcom rule applic definit complet rule replac abox nondeterminist abox abox fork featur iff axiom axiom oa od fork elimin replac occurr resp assum fork elimin part rule proviso newli gener object replac older vice versa denot predic ariti featur object oa xn object od ru conjunct rule fa dg fa dg rt disjunct rule fa dg fa cg fa dg exist restrict rule oa cg cg oa fresh rule obtain replac restrict rule oa fb cg rule obtain replac predic exist restrict rule creat xn od xn xn pg od distinct fresh cn xn agreement rule creat oa oa fresh disagr rule creat oa oa distinct fresh rule applic gener object call gener rule applic call applic rule gener applic rule gener fork elimin place formal notion contradictori complet abox introduc definit convent definit abox call contradictori clash trigger applic clash trigger applic abox call primit fa featur domain domain agreement abox complet rule applic call complet abox call concret domain satisfi iff exist map od true defin procedur clash return inconsist form pg sati return inconsist foral object oa dg fb return inconsist return inconsist return consist defin procedur rule set applic return figur sat algorithm readi defin complet algorithm sat decid satisfi concept sat abox fa cg negat normal negat front concept exhaust appli rewrit rule push negat give rule constructor featur agreement featur refer rule set concept convert concept linear time comment applic nondeterminist complet rule order applic nondeterminist rule rt yield outcom possibl chosen run complet algorithm mean algorithm nondeterminist algorithm algorithm return posit result make nondeterminist posit result obtain satisfi algorithm make auxiliari function inform function appli abox complet rule appli arbitrari axiom match rs return descend obtain rule applic function sati argument concret domain set concret domain axiom return conjunct axiom satisfi wrt sat algorithm figur base defin algorithm decid abox consist algorithm found figur formal correct proof algorithm omit sake breviti found defin procedur elimin fork definit form xn pg clash return inconsist sati return inconsist foral object oa return inconsist return inconsist return consist defin procedur rule set applic return figur algorithm inform discuss emploi strategi sat algorithm perform search role successor introduc smolka logic polynomi fragment model total size model exponenti trace algorithm expand axiom belong singl make call role successor object feasibl case singl object consid check concret domain satisfi central idea overcom problem expand axiom singl object object connect featur function cluster chunk concret domain axiom collect chunk separ check satisfi import note role insid predic concret domain axiom involv object cluster connect similar strategi emploi reduc abox consist satisfi perform preprocess initi abox construct reduct concept role successor object result abox complex algorithm analyz complex reason space formal notion size abox introduc definit size concept defin induct concept role featur featur chain jj jj jj jj jj jj jj size axiom form size abox sum size axiom analysi space lemmata lemma input function construct abox jja jj upper bound size consequ gener axiom axiom jj jj point proven rule consid appli complet import observ appli axiom true axiom rule axiom featur object make simplifi assumpt rule axiom appli axiom form axiom result high estim number gener axiom low prove point show axiom jj jj axiom gener axiom gener axiom form complet rule recal simplif made remain axiom form properti question prove induct structur induct concept trivial verifi axiom gener induct make case distinct form form applic ru rule gener axiom induct axiom axiom gener case remain oper analog simplifi assumpt case special treatment lemma input depth sat bound jja jj role depth concept maximum nest depth exist restrict role depth abox maximum role depth concept occur consequ input abox call role depth argument abox strictli depth space requir sat settl proposit input sat execut space polynomi jja provid hold function sati analyz maximum size argument pass sat call argument sat abox axiom singl object obviou axiom object distinct number bound jja jj size axiom jja jj maximum size argument call jja jj argument abox extend axiom combin argument size result lemma find maximum size abox construct call jja jj jja jj lemma sat execut jja jj jja jj space result complet analysi sat algorithm algorithm perform preprocess input abox repeatedli call sat space requir investig proposit proposit start input execut space polynomi provid hold function sati proven sat execut polynomi space hold sati remain shown abox size polynomi give sketch full version object call proof reli fact preprocess function ident function preprocess appli rule upper bound number applic perform preprocess appli axiom object case preprocess appli axiom form gener object mean number applic bound lemma shown jja jj order result obtain determin formal complex reason concret domain theorem provid satisfi test concret domain problem consist abox satisfi subsumpt concept satisfi subsumpt concept consist abox satisfi test complex class pspace problem hard alc proper subset satisfi problem alc decid consist abox remain shown pspace case concret domain satisfi test proposit fact pspace true satisfi subsumpt reduc abox cf section hold alc proper subset logic turn proper subset exampl concret domain satisfi test pspace futur work present optim algorithm decid concept satisfi abox consist problem logic contrast exist algorithm execut polynomi space provid hold concret domain satisfi test base proven reason problem rule applic strategi algorithm vital effici implement descript logic concret domain interest result context case satisfi wrt tbox problem futur combin concret domain express logic reason logic candid reduct tempor descript logic order obtain complex result acknowledg ulrik sattler franz baader enlighten discuss comment work paper support data european esprit iv long term research project refer baader scheme integr concret domain concept languag john mylopoulo rai proc page august baader extens concept languag mechan engin applic proc volum page verlag baader hollund knowledg infer system sigart special issu implement knowledg reason system baader sattler descript logic concret domain aggreg henri proc august john wilei rj dl resnick structur data model object proc acm page descript logic concret domain predic journal logic hollund nutt subsumpt algorithm concept languag dfki research report german research center artifici hollund algorithm foundat terminolog knowledg system phd universitat de horrock express descript fact ag lk sc proc page publ san lutz complex reason concret domain theoret comput rwth lutz complex terminolog reason theoret comput rwth sattler concept languag extend kind transit role deutsch ur volum lectur note artifici nondeterminist determinist tape complex journal comput system smolka attribut concept descript complement artifici
DB/296 3 concurr share storag richard mellon pa palo ca abstract share storag arrai enabl thousand storag devic share directli access end host switch filesystem highli reliabl storag host perform access task manag task reconstruct data fail task translat multipl phase devic concurr host task span multipl share devic access overlap rang potenti lead inconsist redund code data read end host highli scalabl concurr control recoveri protocol requir coordin storag manag access task express task acid transact ensur proper concurr control approach high perform result replic work exploit knowledg storag level task identifi task storag control approach task basic call base storag transact correct requir serializ parent task show atom requir recoveri special semant task establish serializ core concurr control distribut protocol exploit technolog trend properti hide latenc common case show protocol tradit central altern percent slower ideal protocol motiv tradit raid central compon coordin access ag system includ multipl storag shown figur singl compon storag storag receiv read write request coordin applic singl share disk addit perform storag access behalf storag control perform function migrat storag devic balanc load util newli ad devic chang stripe redund scheme match workload major limit subsystem limit scalabl due share control data pass typic server raid raid control devic emerg storag arrai enhanc scalabl elimin share control enabl direct host access potenti thousand storag devic switch network storag server network app app server system storag server area network sc app app devic network storag parallel app app storag control control figur illustr convent storag system host request serial singl storag share storag arrai share storag devic directli access implicitli transform host softwar parallel storag control host act storag control behalf applic run achiev scalabl storag access bandwidth share storag arrai shown figur lack central point affect coordin data stripe devic store singl logic oper initi applic involv send request devic proper concurr control provis interleav host inconsist data corrupt redund code consist occur applic process run host particip concurr control protocol storag system transpar relationship data store host cluster shown timelin figur host write separ block happen raid updat pariti block host pariti block comput pariti host write data independ block overwrit pariti block reflect updat final state pariti unit cumul xor data block subsequ failur data devic lead reconstruct reflect data written devic race occur concurr host concurr access manag oper migrat reconstruct scalabl storag access manag crucial storag marketplac current storag manag oper manual system assum central implement assum simpl redund scheme paramount import storag system throughput avail practic lead employ plethora manag contribut annual storag manag cost time cost storag address challeng build scalabl distribut storag manag system enabl high concurr access manag task ensur correct task storag control perform break task set basic call basic storag transact show correct requir ensur serializ compon parent task present distribut concurr control protocol exploit technolog trend devic function properti provid serializ high percent perform ideal protocol protocol perform concurr control work correct show limit form requir present recoveri protocol exploit knowledg oper semant achiev level atom low overhead data host devic devic devic host ta tb rest paper organ section describ detail kind task carri storag layer storag section show task show serializ ensur correct parent task section present distribut concurr control protocol special compar perform central variant protocol discuss recoveri protocol section conclud paper section figur sketch raid small write data pariti read data comput pariti timelin show concurr small write concurr control provis data unit devic devic pariti unit xor host updat devic host updat devic updat read version host write pariti overwrit pariti leav pariti inconsist host involv concurr control awar storag level associ introduc raid level pariti anticip race storag manag task perform storag control distribut storag manag storag control perform access task storag manag task storag manag task includ migrat storag balanc load util devic adapt ag access pattern reconstruct data fail devic data avail paramount import grow number access task perform parallel manag task overhead control currenc task minim maxim applic throughput storag subsystem raid review raid basic describ system model detail raid background larg collect storag commonli emploi redund code transpar applic simpl common devic failur toler invok higher level failur disast recoveri mechan raid level redund code comput group data block store separ pariti devic system toler singl devic failur recov data fail devic data block group redund code block pariti protect set data unit call pariti unit set data unit pariti unit call pariti stripe focu rest paper raid level case studi evalu architectur system descript figur show kind system concern share storag system multipl disk connect scalabl network fabric devic store uniqu block act independ host act storag control applic control tion implement softwar oper system devic driver deleg network card host perform divid access task manag task access task read write manag task reconstruct migrat migrat oper task map request physic block singl devic depend stripe redund storag devic break form comput comput pariti refer devic request part task sibl task address virtual volum block virtual object map physic block rang physic storag devic virtual object stripe object redund scheme object access stripe map cach storag control enabl carri access task control perform access task behalf applic run manag function chang content stripe coher stripe cach ensur obtain storag control acquir copi map virtual manag storag distinguish manag virtual serv map object control coher cach map valid expir callback receiv callback notifi host storag migrat instanc storag control perform access task virtual manag virtual object decid reconstruct virtual object map manag invalid held storag control storag access manag access storag manag task perform storag control reconstruct denot bold font task invok shown figur denot ital font map phase denot bold font stripe map raid virtual object map block devic redund scheme raid stripe unit size stripe map specifi read write virtual case desir properti read figur mode raid level stripe shown simplic block bi resid devic invok write invok read arrow direct devic repres arrow origin devic repres oper repres xor host write oper mode handl depend number unit updat updat mechan design properti write pariti unit hold cumul xor data unit case data unit stripe pariti comput host xor data unit data pariti block written parallel half data unit stripe invok half data unit stripe prior content data unit updat read data written produc map bit posit toggl pariti unit appli pariti unit read gener write result back pariti unit concurr control preserv data consist share devic access multipl host solut express access manag task transact acid isol properti standard transact implement lock ensur isol atom task approach highli requir unnecessari perform space overhead specif task gener system design full priori knowledg semant optim specif oper log ensur atom migrat block origin locat locat data origin locat locat complet applic file system provid mechan level atom face kind transact failur system failur volatil memori media failur atom granular transact file system typic span storag task mechan built requir limit atom semant provid disk provid atom granular write appli acid transact storag access manag task result replic accept argu provid limit form atom notion specif mean isol desir execut serial execut singl activ time show provid simplifi higher level ensur consist redund code preserv updat atom argu desir atom write virtual object desir redund code consist replica properti ensur event host power restart higher level applic resubmit turn invok write write assum redund code correct start note properti requir full applic process data write process time effect visibl redund code copi pariti durabl data written complet switch back older data storag manag base potenti reconstruct migrat task time access proce concurr crucial storag system abil difficult manag task chang physic map object migrat block reconstruct devic complic fact larg number host activ write object approach treat object reconstruct migrat degrad mode access mode access task reconstruct migrat mode manag mode manag access task enabl high concurr access manag task manag requir invok access task awar physic map reconstruct task perform reconstruct mode migrat task perform migrat mode figur illustr mode transit virtual object mode degrad mode mode access task carri manag interest perform migrat reconstruct switch object access mode manag mode figur mode virtual object start mode devic store part object object switch degrad mode manag object decid start reconstruct data store fail devic replac object switch reconstruct mode manag interest migrat object switch migrat mode data copi locat copi object switch back mode object switch stripe map access object chang manag issu callback storag control invalid cach map storag control map specifi locat access method shown devic failur occur degrad result data loss proper mode alloc fresh space storag devic data migrat reconstruct manag task object transit back access mode discuss mode detail mode task carri invok task perform invok figur depend data stripe updat manag task perform mode oper clear inspect applic singl leav pariti consist serializ execut serv pariti consist reconstruct replac devic alloc data rebuilt devic failur alloc degrad migrat devic failur migrat degrad mode degrad task carri depend fail disk read task perform stripe mode degrad fail figur invok degrad mode invok fail disk updat data unit updat data comput pariti pariti unit essenti reflect data updat fail devic fail devic invok fail devic stripe invok degrad mode depend fail disk written figur depict exampl degrad mode manag task mode degrad clear appli time result consist updat read ensur serializ transact suffici ensur correct reconstruct mode reconstruct task ongo parallel reconstruct task figur depict mode object disk declar replac object task carri depend fail disk read read ignor replac object altogeth task updat pariti degrad arrai addit updat replac object write updat read latest data written fail devic reflect pariti block achiev task illustr figur reconstruct task ongo parallel access read surviv data pariti block comput content fail data block write replac disk multipl concurr rang execut parallel reconstruct task replac disk reflect data fail disk pariti consist data stripe figur invok reconstruct mode figur show stripe block block resid fail devic block alloc replac block invok task fail devic access invok task fail devic updat fail devic invok write replac block invok reconstruct task reconstruct data fail devic write replac block mode begin reconstruct straightforward serializ suffici ensur consist data correct reconstruct present intuit proof virtual object disk degrad arrai figur ignor replac disk easi serial applic updat fail result consist pariti correct read note simpli addit write replac devic data reflect pariti degrad arrai replac devic updat degrad arrai stripe read block degrad arrai write data replac disk serial ongo unnecessarili recomput rewrit data block replac disk synch degrad arrai migrat mode simplifi assum virtual object shown figur stripe map virtual object specifi physic physic block sourc physic block target devic object migrat task updat physic locat invok point target physic block empti written sourc physic block task invok read read physic block locat read access target physic block empti copi migrat stripe mode migrat read copi figur invok migrat mode virtual object sourc map physic block destin map block goal copi sourc block target locat task invok write sourc destin locat migrat task invok copi copi block sourc destin locat task ongo parallel copi easili gener redund write perform sourc target block entir concurr control base storag transact goal rest paper arriv protocol ensur serializ ensur satisfactori recoveri failur approach introduc low overhead transpar protocol storag control exploit simpl devic support avoid chang applic written singl control storag system connect network enabl thousand storag devic host cluster share desir protocol scale larg size protocol free deadlock function requir storag devic simpl devic manufactur independ complex system implement organ fragil present concurr control protocol recoveri protocol section present central protocol emploi server lock callback optim distribut lock timestamp order show optim protocol benefit special properti technolog trend evalu perform rel ideal perform perform concurr control baselin simul paramet system size raid level stripe width data stripe unit devic host workload random time distribut varianc host access address uniformli access size uniformli vari stripe unit servic time disk servic time random distribut posit varianc ms network bandwidth random overhead server messag servic time microsecond tabl baselin simul paramet host data stripe devic raid level devic pariti group host access size mode figur sampl data point run evalu environ implement protocol full detail simul system simul cluster system consist host disk connect network tabl show baselin paramet experi protocol simul vice time link storag devic deriv simpl distribut base observ behavior server commun scsi disk fast switch local area network host clock drift practic millisecond compar perform protocol varieti gener workload condit baselin workload repres kind share characterist oltp workload cluster applic file load dynam balanc host server cluster result limit local random access baselin system appli moder high load storag devic yield sustain util report perform protocol mode repres gener perform central lock protocol approach achiev order lock wide practic lock variant wide practic lock lock background lock share data item enforc serial order tion lock prefer solut resourc limit overhead lock acquisit low concurr achiev lock program disciplin lock acquir lock lock suscept processor hold lock long reduc concurr deadlock prevent detect resolut scheme emploi conjunct lock storag common lock implement server lock callback lock server lock central lock server lock storag block rang execut host acquir case share case lock set target rang send lock messag lock server host latenc total throughput issu request devic request host send unlock messag lock server lock unlock messag protocol trivial serializ lock acquir singl latenc minim deadlock avoid lock server queue lock request outstand lock block request rang conflict lock return host server lock introduc potenti bottleneck server delai issu request request round trip messag lock server callback lock popular variant server lock delai unlock effect cach lock hope host gener access futur avoid send lock messag server host request lock lock server conflict lock cach server host hold conflict lock callback relinquish cach lock server grant lock owner common optim callback lock lock automat expir period callback messag reduc tation period server lock callback protocol central lock perform figur highlight scalabl limit server lock protocol plot latenc protocol total offer throughput vari number content latenc server lock callback protocol figur scale server callback lock line repres protocol central lock scheme bottleneck deliv half maximum achiev throughput appli load number activ host system start host baselin workload correspond fourth point graph graph show effect content baselin latenc fraction disk target host access graph show high callback lock benefit sever lock callback lock reduc latenc half moder high content workload baselin workload read share lock cach multipl host content vari disk protocol bottleneck deliv full throughput system attain col perform concurr control work consist occur cpu bottleneck handl network messag process lock unlock request messag send callback lock reduc lock server load lock latenc lock commonli host multipl time host request conflict lock host request lock privat data act lock server expir lock call back conflict induc number messag simpl server lock lock acquisit latenc read lock share larg number host call back figur figur show baselin callback lock reduc latenc rel simpl lock larger protocol benefit workload domin read concurr cach read lock host write benefit workload share independ access share pariti block limit potenti benefit local parallel lock server scalabl bottleneck central lock protocol avoid distribut lock work multipl parallel lock server summari baselin perform server lock callback lock lock timestamp order latenc throughput averag number messag delai peak throughput figur summari perform protocol baselin configur host devic tabl show host averag number messag fraction oper delai protocol distribut protocol lock timestamp approxim ideal perform protocol perform distribut protocol reflect overwrit optim discuss section begin begin begin lr lr lr wu wu wu lock partit multipl lock server static dynam host directli send parallel lock request server deadlock host attempt acquir lock manag multipl independ server avoid lock acquir time specif impli lock request lock server request previou repli latenc lock hold time substanti deadlock detect request lock request servic lock server neg return host time host acquir retri acquir lock begin parallel lock server singl lock server bottleneck benefit cost messag longer latenc induc longer lock hold window time potenti conflict compar unload singl lock server result higher probabl conflict present special implement scheme section wu wu wu lock lr lr lr end end end read requir number parallel lock server opportun storag devic investig lock server devic lock reduc cost scalabl serializ storag arrai elimin dedic lock server latenc total number messag exploit natur lock messag request devic serv lock block store enhanc scalabl balanc lock load devic parallel lock server simpl lock faster lock server built transport protocol symmetr multiprocessor machin simpli maximum attain throughput elimin scalabl limit figur implement lock optim node repres messag exchang devic node includ lock node includ unlock repres stand edg repres control depend node repres synchron point host block oper restart begin fail lock oper fail devic time grant lock amount messag latenc lock phase ad bundl lock write request messag elimin messag request shown figur lock acquisit reduc separ unlock phase requir phase latenc hidden applic data receiv lock acquir phase lock request phase unlock messag total hide latenc messag cost lock requir host issu lock acquir order recoveri issu restart lock acquisit phase requir undo write data written parallel lock suffici elimin callback lock write latenc overhead lock overhead unlock singl phase read observ singl phase write benefit lock cach complex durabl devic state callback lock pragmat avoid callback lock lock effect central lock shown summari tabl figur baselin achiev latenc larger peak throughput equal maximum lock messag central lock shown summari tabl figur perform vulner high content due suscept deadlock configur critic overlook disadvantag scheme suffer timeout normal code path figur graph behavior protocol induc limit fraction storag address host host access activ disk disk queue start grow lock hold time occur deadlock recoveri common note deadlock order larg number request queu block request unlock effect deadlock involv multipl request multipl restart ensur progress result messag load network wast devic resourc excess messag request process timestamp order timestamp order protocol attract mechan distribut concurr control storag devic place overhead read suscept deadlock timestamp order background timestamp order protocol select priori order execut form timestamp enforc order implement verifi transact execut read write access optimist variant delai check commit time simplest timestamp order transact tag uniqu timestamp time start order verifi read write timestamp storag tag fraction op delai content server lock callback lock lock timestamp order figur perform protocol high content host conflict activ portion lock suffer disk queue latenc grow due restart handl return put request return commit block pair rt correspond largest timestamp transact read wrote read transact timestamp block accept immedi reject write accept access parent transact abort restart larger timestamp handl return put request figur basic timestamp show action logic storag receipt read write request opt repres timestamp transact make request repres smallest timestamp queu read block repres smallest timestamp queu write remov servic queue result read servic read process remov servic result write request elig servic read flag storag inspect queue write servic write flag set queu read inspect servic inspect request servic possibl lead comput valu order avoid cascad abort transact rippl abort read read block written activ transact activ transact updat submit storag declar intent write updat data storag accept activ transact write issu submit write updat made visibl reader transact issu case discard block request unblock timestamp order shown figur timestamp order timestamp order work host determin total order transact provid inform order form request devic maintain tag queue outlin enforc order request tag explicit order process deadlock occur schedul serializ request reject parent transact abort retri higher timestamp handl put request write restart begin rp rp rp gener devic perform local write request pass check abort due fail check devic simpl structur split write protocol phase write phase ensur host devic issu avoid complex undo disk write cluster host share clock timestamp gener host sampl local append uniqu identifi bit clock restart begin begin end end end write singl phase write singl phase read emploi optim reason complex protocol read data pariti data comput updat data pariti execut start local gener send read request data pariti tag request bundl request request devic receiv request perform timestamp check read accept request check accept request queu outstand lower data return host rt updat host receiv request data accept comput pariti send data pariti write request tag opt devic accept updat discard request possibl request queue inspect read request complet normal task induc read arriv write progress rare figur composit host oper optim timestamp order protocol request denot node denot request node repres synchron barrier host block oper restart begin fail read reject devic pass timestamp check request read read write minim amount messag singl phase write requir round messag request issu latenc discuss optim basic timestamp order protocol lend effici implement optim implement result reflect effect total throughput server lock callback lock timestamp order protocol minim buffer overhead protocol present induc high buffer overhead storag devic high overwrit concurr read activ overlap rang ag devic accept multipl write receiv write buffer appli order satisfi intermedi read approach appli write arriv modern disk drive limit memori unnecessari read reject reader theoret protocol persist stream write advantag write process storag devic exploit abil stream data high data rate disk surfac avoid timestamp access protocol requir pair rt disk block read disk oper written disk oper naiv implement store timestamp nearbi data result extra disk access read block updat extra disk access write block read previou doubl number disk access consist goal clock synchron messag deliveri latenc devic accept request timestamp smaller current time timestamp inform older discard time minu devic messag oper read fraction server lock callback lock timestamp order protocol figur scalabl timestamp order compar lock variant effect workload composit messag overhead protocol timestamp order close protocol messag overhead fraction write perform amount messag rang workload ing power simpli wait time clock synchron accept record initi synchron time reject request earlier timestamp timestamp volatil record activ synchron clock concurr control effici timestamp manag suggest thor manag system perform timestamp order addit highli illustr figur advantag timestamp order smallest amount messag compar protocol messag overhead optim elimin messag overhead behavior attempt access conflict delai directli indirectli suffer abort retri probabl delai depend level content fix workload concurr control protocol factor network reorder result delai behavior protocol shown figur fraction delai highest back lock largest window vulner conflict hold tribut protocol callback lock server lock exploit request avoid latenc commun lock server start shorten window vulner conflict potenti sensit messag arriv skew skew deadlock restart reject retri timestamp order sibl request servic order devic investig effect messag skew delai latenc behavior conduct experi vari reorder perform network measur effect delai latenc messag latenc model uniformli distribut random variabl window extend ws millisecond larger window size impli highli variabl messag latenc lead higher probabl messag arriv figur graph latenc fraction delai ws timestamp order lock sensit messag end effect host latenc notic fraction op delai high messag variabl fact plagu central lock variant perform messag recoveri base storag transact share storag arrai ensur updat atom event power failur manag identifi fail complet data process ensur data address updat atom enforc ensur data storag filesystem robust applic disk failur messag latenc window server lock callback lock timestamp order simplest case disk failur disk progress abort continu depend began write natur abort write involv lock cancel write begin write write fail disk treat disk fail fail virtual object enter degrad mode manag alloc replac resourc manag initi invok restor lost data latenc messag latenc window server lock callback lock timestamp order protocol figur effect variabl network messag latenc fraction oper delai retri latenc protocol messag latenc vari uniformli maximum window size graph plot latenc fraction oper delai versu size variabl window size note plot log scale host power failur host power complex approach incomplet harder small fraction rang recoveri approach avoid identifi fail altogeth declar data suspect failur prohibit tradit techniqu detect transact start complet log addit delai induc log log messag action work log record compact descript type target rang block server callback requir lock grant server persist failur log lock acquisit lock lock server achiev durabl record log power fail replic machin failur lock timestamp oper write ahead log devic lock cope power failur synchron disk write lock disk simpl recoveri identifi access virtual object manag object enter object recoveri mode ensur updat mode suspect rang updat iti effect recomput pariti block stripe data block devic recomput pariti block degrad reconstruct mode data disk fail access ensur data pariti block stripe updat atom log invok task mode atom block updat atom enforc case write block storag control begin write phase atom ensur send block manag virtual object write phase begin manag write block log stabl storag enforc atom reinstat block log case failur invok reconstruct task atom recoveri perform simpli write replac object updat degrad arrai migrat mode migrat invok access task migrat task invok recoveri carri mode case copi invok migrat recoveri simpli enact issu copi share storag arrai enabl thousand storag devic share directli access end host switch network concurr host task lead inconsist redund code data read end host approach ing scalabl distribut storag manag system enabl high concurr access manag task ensur correct approach break storag access ment task perform storag control oper correct requir ensur serializ compon parent task present distribut protocol exploit technolog trend properti provid serializ high percent perform ideal protocol protocol distribut concurr control work endpoint access origin devic store data avoid bottleneck show atom requir present recoveri protocol exploit knowledg oper semant reduc recoveri overhead substanti refer liskov optimist concurr control synchron sigmod intern confer manag commun comput mcgraw bernstein base algorithm concurr control distribut intern confer larg octob highli network file usenix winter pp boden local area ieee feb share page server acm structur approach redund disk arrai sept lori notion consist predic lock commun vol novemb pp gibson storag acm octob sullivan workshop model specif san octob lock consist share ibm research septemb grai reuter transact concept techniqu morgan san acm comput vol pp algorithm failur recoveri redund disk journal distribut parallel vol pp juli reliabl system area ieee feb perform distribut file acm transact comput vol pp februari kung optimist method concurr acm transact vol june objectstor vol octob lee distribut virtual seventh octob storag comput technolog jan time specif report rfc juli transact recoveri method support lock partial rollback acm transact vol pp concurr journal vol octob pp case redund arrai proc acm june seagat perform demand hp hierarch storag acm transact comput vol februari
IR/297 5 collabor learn recommend system wee sun lee depart comput nation singapor abstract recommend system rate user item movi music predict user prefer item rate predict rate user learn user prefer function featur item combin method pose problem collabor learn prefer function multipl user recommend system studi mixtur model task theoret experi movi rate model design overcom common problem recommend system includ user recur startup rate problem scale problem introduct growth internet result person inform filter system recommend system system design predict user prefer featur item rate user recommend system deal problem list user make accur system learn user prefer rate user make system show quick user lose patienc stop system recur startup item ad regularli recommend system system reli sole user prefer make predict make accur predict item problem sever system receiv item onlin articl recommend system rate recommend number rate obtain small compar number rate predict effect gener small number exampl import problem sever startup phase system number user small scale recommend system implement central web site larg number user predict made real time predict potenti request time comput complex algorithm scale number user item system system rate user call collabor filter system common method perform collabor filter method collabor filter algorithm algorithm nearest neighbour predict rate item base rate user similar activ user method suffer scale problem nearest neighbour method memori base collabor filter algorithm suffer recur startup problem predict made rate made user item reduc effect recur startup problem featur content item predict predict item depend pure rate affect fact user item learn prefer function user quickli advantag inform obtain rate similar user system pure content base system suffer badli user problem drawback pure content base method state art method captur subject qualiti affect rate domain movi music prefer function encod effect content rate similar user pose recommend system problem collabor learn individu prefer function user system studi finit mixtur model task onlin learn framework describ theoret analysi understand effect type mixtur model describ experi onlin approxim expect maxim algorithm movi data set result show collabor learn outperform individu learn learn function reduc effect user problem find learn prefer function encod effect content rate similar user perform learn function content perform learn function rate similar user movi featur improv perform condit recur startup algorithm scale constant time make predict updat model rate receiv number user item system relat work earli work collabor filter memori base algorithm similar user measur correl coeffici user empir comparison collabor filter algorithm shown memori base correl coeffici algorithm perform collabor filter pose classif problem neural network train classif rate problem handl singular decomposit recommend pose classif shown appropri chosen content featur improv perform compar pure collabor filter approach underli philosophi design bayesian mix effect model content collabor featur experi show mix result effect model machin approach learn share paramet investig context learn multipl relat task gener philosophi approach relat hierarch bayesian model statist model cluster user item hofmann handl rate problem show paper method handl user recur startup problem collabor filter method provabl perform bound investig goldman algorithm attract perform bound modif order practic scalabl approach concentr order item studi axiomat foundat collabor filter describ advantag collabor learn individu learn framework analysi section theoret mixtur model section onlin approxim algorithm learn mixtur model section result section preliminari term collabor learn describ situat rate user similar activ user util learn paramet activ user prefer function featur learn prefer function user includ describ content item encod rate similar user featur content collabor learn reduc collabor filter case featur consist descript rate similar user learn function user problem case content featur similar featur content featur recur startup problem similar featur captur subject qualiti item captur content featur accuraci system predict onlin learn model onlin learn algorithm make sequenc predict time algorithm access label item time make suffer loss due differ predict actual label encount time framework reason studi effect algorithm situat user queri predict rate item framework studi effect algorithm intend recommend item problem recommend item complex item chosen recommend affect system learn user recommend problem paper finit mixtur model describ mixtur model theoret properti show model bound loss ideal algorithm bound describ paramet model affect problem provid guid design model overcom problem finit discret valu paramet model analysi fine model approxim model continu paramet algorithm deriv bound impract model analysi illustr properti model class properti provid guid select model experi experi section show behaviour practic algorithm continu paramet qualit similar theoret analysi assum user belong class user user class prefer function output prefer function corrupt linear function featur set featur consist indic function bia encod averag rate class indic function output member set observ rate class ai ga ai weight linear function bia movi rate set consist movi categori drama anim singleton set consist movi encod group opinion user class movi interpret function bia code averag movi rate categori movi correct correct group opinion movi interpret correct function learn data assum finit set model sequenc rate algorithm predict sequenc number squar loss absolut loss jr rj measur perform algorithm access make predict time call onlin algorithm opt opt sum loss optim model class squar loss absolut loss algorithm base strategi shown achiev bound theorem assum finit set model sequenc rate exist onlin algorithm achiev opt log log ln depend paramet algorithm absolut loss perform model effect bound number model strategi assum weight discret level finit set model fw wl set discret valu defin class model wg corollari assum system user class class user predict model exist onlin algorithm achiev opt log log log log ln depend paramet algorithm absolut loss proof theorem count number model order prove bound wai assign user class jdj wai assign function class class consist element state system appli theorem bound loss bound separ compon compon log bound loss class user belong call classif loss compon log bound share cost estim paramet function call paramet estim loss user prefer function learn independ loss bound appli theorem consist paramet estim loss depend log number class smaller number user total classif estim loss smaller collabor learn perform function class perform function person individu user call differ perform approxim loss approxim loss made smaller number class collabor learn mixtur model estim classif loss hand approxim loss hand made vari number class effect number class user problem small classif loss grow logarithm concern recur startup problem rate problem bound paramet estim loss grow linearli indic function movi includ featur paramet estim cost larg depend log data case startup stage perform poor result larg paramet estim cost mixtur model item cluster studi case item featur collabor show recur startup problem mitig item featur user class item class result mn pair class pair assign predictor set element corollari assum system class user class class pair predict system exist onlin algorithm achiev opt log log log log log log ln depend paramet algorithm absolut loss proof proof corollari count number configur system wai assign user wai assign item class mn wai assign valu class pair mn state system possibl appli theorem bound mn system suffer data problem number item averag cost item depend approxim log indic effect recur startup estim loss small practic onlin algorithm theoret analysi suggest model class deal problem recommend system algorithm analysi impract deriv practic algorithm model class show section algorithm retain properti theoret analysi onlin gradient descent algorithm linear function case learn individu collabor featur item case indic function movi redund includ learn rate chosen kxk squar norm input recommend collabor learn mixtur onlin approxim expect maxim algorithm base widrow hoff algorithm describ em algorithm motiv onlin approxim em probabilist model error linear function assum error gaussian distribut unknown varianc class vector unknown paramet system unknown paramet unknown varianc probabl distribut vector paramet defin distribut observ vector likelihood function function aim maximum likelihood method find maxim em algorithm maximum likelihood problem treat problem incomplet data introduc sequenc unobserv data vector indic variabl compon iu user belong class iu equal complet data sequenc ut xg correspond user time complet data likelihood function iter em algorithm defin calcul expect respect paramet maxim likelihood paramet shown respect iter em algorithm necessarili converg global minima complet data likelihood function written iu ai ga log function find iter minim function iu ai iu expect iu iter current paramet valu posterior probabl user belong class assum user equal belong probabl calcul iu iu normal constant onlin approxim algorithm time consist step minim iu approxim iu initi updat iu iu iu ju ju weight bia updat gradient step iu wa widrow hoff algorithm attempt approxim maximum likelihood varianc estim iu iu approxim onlin algorithm pure collabor filter case varianc item deriv similar manner case user item cluster difficult effici algorithm calcul condit expect unobserv data batch case heurist onlin approxim algorithm updat condit expect user class assum condit expect item class correct vice versa detail omit found experi data data set obtain dec system research center run movi recommend servic month data set user enter total numer rate movi rate set lowest score highest movi categor art comedi movi belong categori number user made rate faster exponenti measur averag predict error system put significantli emphasi perform system user made rate relev aspect data set choic movi rate control user recommend system movi receiv rate user rate movi strong opinion initi leav averag movi rate setup perform measur absolut loss intuit easier understand squar loss experi algorithm data set rate sort time rate obtain predict made item sort list rate shown algorithm rate measur absolut predict error jr actual rate predict rate predictor detail avg ab error avg ab error averag movi rate linear function movi featur train individu linear function movi featur collab train class linear function featur collab train class movi indic user cluster movi user class user item cluster movi user item class correl algorithm user predictor tabl averag absolut predict averag rate rate predict onlin manner confid interv respect random initi assum averag valu drawn normal distribut unknown varianc rate updat state algorithm process repeat item chose sort rate time entri order simul system work order peopl rate movi run experi entir data set million rate algorithm run quickli compar perform algorithm memori base correl coeffici algorithm predict averag movi rate averag movi rate simpl predictor order claim person person algorithm outperform averag movi rate predict correl algorithm introduc resnick al good predict perform detail implement order make experi feasibl entir data limit user predictor user user system mixtur model algorithm requir random initi initi weight randomli calcul initi initi pure collabor mixtur model similar measur averag random initi order paramet stabil averag movi rate predictor rate system algorithm updat paramet rate perform experi class user case user item user item user item user item group user item group correl coeffici user predictor due lack report set give result algorithm entir data set tabl result column averag absolut error data tabl learn linear function movi featur collabor significantli outperform learn algorithm outperform averag movi rate predictor restrict learn featur linear predict averag movi rate outperform person predict pure collabor filter cluster user outperform averag movi rate predictor ad indic function linear function learn collabor util featur group prefer improv perform compar pure collabor filter cluster user item perform cluster user expect approxim error model cluster user item larger approxim error cluster user item cluster free averag collabor filter algorithm outperform correl algorithm experi column averag absolut error rate tabl algorithm perform poorer averag movi rate predictor algorithm cluster user movi due data problem smaller paramet estim averag absolut error nth rate averag absolut error user nth rate featur user collab featur collab featur avg nth rate averag absolut error user nth rate featur user collab user collab corr avg averag absolut error nth rate averag absolut error movi nth rate featur user collab user collab corr avg nth rate averag absolut error movi nth rate user item cluster user collab corr avg figur top figur show averag absolut error user nth rate bottom figur show averag absolut error movi nth receiv rate label averag movi rate linear predictor featur train linear predictor featur train user linear predictor featur movi indic function train correl coeffici algorithm item algorithm user item cluster algorithm cluster user movi perform effect situat figur plot averag absolut error user nth rate averag user made rate indic averag predict accuraci user made rate figur collabor learn linear function featur significantli outperform learn function perform predictor predict figur compar algorithm collabor learn movi featur collabor user opinion algorithm user opinion show featur improv user opinion show perform correl coeffici algorithm correl coeffici algorithm requir number rate user good perform tabl suffer larg loss compar cluster algorithm larg number user make rate figur practic system perform rate receiv figur plot averag absolut error movi nth receiv rate algorithm combin movi featur collabor opinion work movi receiv rate indic suffer badli recur startup condit compar algorithm algorithm cluster user movi learn quickli recur startup condit inform movi featur due low paramet estim loss discuss theoret result directli appli algorithm result qualit similar collabor learn smaller user loss compar learn predict theoret cluster user movi deal rate problem recur startup problem poorer approxim error predict theori feel theoret guid search effect model recommend system good scale onlin updat rate receiv mixtur model fix number updat constant time predict constant time perform algorithm util movi featur group prefer minut run entir data set sun ultra workstat time complex updat predict algorithm number cluster number movi featur movi indic algorithm cluster user item user cluster item approxim hour run entir data set workstat time complex updat predict number user cluster number item cluster perform algorithm requir small amount memori algorithm find global optim predictor interest direct futur work includ method perform recommend good predict recommend difficult item system recommend affect inform system user item system recommend item user order gain inform user item pose problem learn recommend system collabor learn improv perform obtain result joint learn paramet share function user show theoret benefit exist mixtur model ideal algorithm analysi suggest method design mixtur model overcom common problem recommend system insight design practic algorithm work experi movi acknowledg author anonym review comment improv paper mong li lee phil long suggest research support nation singapor academ research fund grant data set provid digit equip corpor refer recommend social inform recommend nation confer artifici intellig wi learn intern int conf comput learn theori learn collabor inform filter fifteenth intern confer machin learn morgan kaufman empir analysi predict algorithm collabor filter annu confer uncertainti artifici intellig quadrat loss bound predict linear function gradient descent ieee tran neural learn order thing journal artifici intellig bayesian model recommend system workshop recommend algorithm evalu maximum likelihood incomplet data em algorithm journal royal statist societi bayesian data analysi chapman hall learn binari relat total order siam sequenti predict individu sequenc gener loss function ieee tran inform latent class model collabor filter intern joint confer artifici intellig onlin cluster collabor filter report school nation singapor learn binari relat cluster proc annu confer comput learn theori acm ny social choic theori recommend analysi axiomat foundat collabor filter seventeenth nation confer artifici intellig open architectur collabor filter netnew acm confer comput support cooper work recommend system commun cluster method collabor filter workshop recommend system fifteenth nation confer artifici intellig
AI/298 2 dynam servic matchmak agent open inform environ katia matthia seth robot carnegi mellon usa lu comput scienc ca introduct amount servic deploi softwar agent famou offspr world wide exponenti internet open inform commun link agent disappear unpredict autom search select relev servic agent essenti human user agent distinguish gener agent categori servic servic middl agent servic provid provid type find perform domain specif problem solv request agent provid agent perform servic agent locat call middl matchmak process find provid request middl gener provid agent capabl middl middl agent store request middl agent provid desir middl agent match request store return subset store process glanc complic fact local inform sourc provid request cyberspac heterogen incap understand research sponsor part offic naval research grant darpa grant rise common languag describ capabl request softwar agent conveni effici mechan determin structur semant match descript languag mean method reconcil potenti semant heterogen inform obviou qualiti effici matchmak internet briefli present agent capabl descript discuss matchmak process paper conclud comparison relat work implement power matchmak incorpor retsina infrastructur framework agent capabl descript languag obviou describ agent capabl common languag servic matchmak broker agent place main desir featur languag ffl express languag express repres data mean program code agent capabl abstract implement level ffl infer infer descript written languag support reason comparison descript effici ffl descript easi read easi write user languag support domain common ontolog agent capabl exist languag program descript knowledg kif descript rdf satisfi agent capabl descript call request knowledg enabl request match agent capabl specif frame slot structur context context specif type declar variabl type input declar input variabl output declar output variabl constraint input variabl constraint output variabl ontolog descript word textual descript specif frame slot type mean ffl context specif local domain agent ffl option definit data type specif ffl input variabl declar specif addit usual type concept attach disambigu type concept defin concept descript slot ffl logic constraint variabl declar part constraint horn plan standard compliant prolog program describ constraint function capabl ffl option descript mean word specif descript reli concept local domain ontolog attach concept word slot mean concept ontolog descript word concept includ slot matchmak ffl textual descript mean specif request agent capabl mean input output type context part specif attach textual comment local domain ontolog mention offer option applic domain knowledg request local ontolog describ mean word specif ontolog defin simpl keyword sophist summari dictionari complex terminolog written concept unifi model languag knowledg interchang format kif implement matchmak process assum local ontolog defin concept languag itl conceptu knowledg applic defin set concept role term concept term definit concept conjunct logic constraint object instanc set terminolog definit form terminolog canon definit concept reli basic vocabulari word defin semant assum boundari main benefit provid local ontolog written concept languag user detail request matchmak agent make autom infer addit semant descript match improv qualiti match process matchmak determin relationship semant descript written concept itl comput respect concept subsumpt relat concept subsum concept extens subset logic constraint defin term concept logic impli gener concept assum subsumpt relat concept identifi real world semant relat util map primit compon occur concept definit base synonym relat matchmak comput subsumpt relat concept includ receiv regist provid agent yield subsumpt hierarchi concept varieti local domain ontolog extens partial global ontolog matchmak addit type relat present section ontolog necessarili union local domain ontolog dynam built matchmak process regist provid agent user request matchmak ontolog includ concept describ mean word specif request simpl specif specif interpret specif role depend agent send matchmak wrapper languag perform specif wrap send agent messag messag content treat request simpl request express decid itl tractabl subsumpt correct incomplet discuss loss semant due map multipl ontolog refer similar common domain namespac xml semant tag web page content air combat mission domain request agent capabl appli matchmak process applic domain air combat mission specif request request find agent capabl give inform deploi air combat mission launch time interv provid agent domain capabl provid inform special kind air combat mission agent domain ontolog written itl context type date input date output mission sd ed mission capabl provid inform deploi air combat mission launch time interv context type date input date output start end mt capabl provid inform deploi air combat mission launch time interv ffi matchmak process matchmak process adopt method area inform ai softwar engin comput syntact semant similar agent capabl descript method effici term perform dynam matchmak internet match engin matchmak agent context profil similar signatur constraint match comput cost filter order user select combin filter demand effici major user select context profil filter convent briefli describ filter context filter match specif context deal restrict match space domain specif suppli list keyword meant describ semant domain servic compar specif assum context domain suffici long distanc root consid word exce subsumpt relat attach concept pair similar word distanc concept exce threshold word distanc comput model word significantli consid domain specif current implement wall street journal corpu million word pair comput word distanc comput concept distanc discuss section specif pass context filter suffici similar context similar word pair concept subsum concept profil filter context match specif profil filter compar specif variant tfidf document techniqu specif treat document determin similar document base frequenc relev word document finit set document case comput similar exce threshold document pass profil filter profil specif similar similar filter profil filter limit structur descript mean differenti input output declar specif profil comparison reli semant word filter recogn word pair closer distanc pair comput similar reli combin distanc valu calcul pair input output input output constraint distanc valu comput term distanc concept word occur respect specif section valu comput time store matchmak similar specif comput averag sum similar comput pair declar constraint specif pass similar filter similar signatur constraint filter similar filter semant individu word descript mean logic constraint specif account matchmak process signatur constraint filter filter design work semant match softwar engin area signatur match check signatur input output declar match perform set subtyp infer rule concept subsumpt test softwar compon descript semant plugin match compon descript signatur set input constraint logic impli set output constraint logic impli logic implic constraint comput polynomi subsumpt check horn match specif valuabl select constrain input paramet consid return equal greater number specif output paramet plug request comput distanc concept identif relat concept subsumpt promot deeper semant understand weve restrict express concept languag itl order boost express addit associ concept weight associ network semant network direct edg concept node type edg concept denot binari edg label numer weight fuzzi weight strength belief real world semant vari partial global ontolog matchmak dynam built implement associ network creat matchmak comput concept subsumpt hierarchi addit associ extract wordnet assum terminolog subsumpt relat concept partial global ontolog matchmak identifi real world semant relat distanc concept comput strength shortest path basi triangular norm perform reason matchmak deal dynam resolv ambigu due potenti gener polysemi relat work deal semant heterogen autonom inform sourc exist solut inform system area year base model global provid common ontolog domain ontolog sourc select focu inform retriev techniqu relev assess altern solut adapt process reveal semant interdepend heterogen data object scope main problem dynam matchmak internet deal tradeoff perform qualiti match complex reason restrict semant match request reason time unlik approach matchmak broker multiag system present matchmak process offer flexibl approach satisfi requir deal global integr heterogen sourc descript term compar descript function capabl constrain action provid servic combin techniqu softwar engin descript logic area perform filter effici matchmak agent perform complex queri activ broker agent mediat agent develop protocol distribut matchmak multipl matchmak agent implement implement languag matchmak process java figur show user interfac matchmak agent visual matchmak user interfac trace path result set request matchmak filter filter configur select checkbox beneath desir filter disabl filter darken bypass result set pass filter filter outlin number filter increment consid number output arrow increment successfulli pass filter push button arrow reveal result set filter servic matchmak heterogen softwar agent internet dynam effici obviou qualiti effici matchmak internet defin implement languag call agent matchmak process judici balanc languag express effici match matchmak process perform syntact semant addit specif concept concept languag match process context profil similar signatur match constraint match partial match result util combin filter select filter appli control user request appli matchmak process applic domain system inform agent air combat mission domain applic domain investig refer knoblock hsu queri process sim inform mediat austin tate advanc plan aaai williamson internet proc page august ej knowledg base integr heterogen ifip confer semant fellbaum electron lexic mit kqml agent commun languag proc intern confer inform knowledg manag acm tsimmi approach data model languag proc workshop mr duschka inform integr system acm sigmod softwar compon search journal system pp role java exploit heterogen inform proc java develop april shehori sycara formal treatment distribut matchmak intern confer autonom agent cheng specif match softwar foundat acm sigsoft symposium softwar acm softwar engin aug semant heterogen global inform role metadata context ontolog mp papazogl cooper inform trend academ kif knowledg interchang resolv schemat heterogen system intl journal distribut parallel vol fuzzi concept network proc ieee intern conf fuzzi kqml matchmak proc intl conf inform knowledg manag pp danzig boolean similar measur resourc discoveri ieee transact knowledg data de raedt induct logic theori method journal logic vol fowler overview activ inform gather infosleuth intern confer autonom submit framework scalabl agent architectur cooper heterogen knowledg sourc klusch intellig inform chapter till introduct formal specif intern seri comput scienc resourc descript framework schema specif adapt statist languag model phd carnegi mellon wong vector space model automat index commun kashyap approach queri process global inform system base ontolog proc intl conf cooper inform system ieee comput soc manag multipl inform sourc relationship vocabulari heterogen loss inform proc attribut concept descript complement klusch heterogen softwar agent internet carnegi mellon pa technic report zeng distribut intellig agent ieee pp decemb express capabl descript languag queri rewrit algorithm express flexibl action reason capabl intellig agent cooper xml extens markup languag world wide web consortium work novemb wing specif match softwar compon carnegi mellon pa technic report
IR/299 5 scale person web search jennif widom stanford abstract recent web search techniqu augment tradit text match global notion base linkag structur googl pagerank algorithm refin global notion import special creat person view import score set page comput store person view advanc comput person view queri comput view requir iter comput web graph present techniqu base encod person view partial vector partial vector share multipl person comput storag cost scale number view approach enabl increment construct person view partial vector practic queri time present effici dynam program algorithm comput partial algorithm construct person view partial result demonstr effect scalabl techniqu introduct motiv gener web search perform predominantli text queri search engin enorm size text select limit number queri result manag size pagerank algorithm implement googl exploit linkag structur web comput global score influenc rank search result encompass notion import user basic pagerank algorithm modifi creat redefin import user prefer user bookmark set prefer work support nation scienc foundat grant queri result import respect bookmark page rank higher person pagerank shown util size web make practic realiz extrem difficult review intuit pagerank algorithm extens person fundament motiv underli pagerank notion import page import page page import import referenc page import page numer formal notion model introduc imagin random surfer time step surfer page time step random time expect percentag surfer page converg limit independ distribut start point limit pagerank import score reflect number peopl expect time pagerank score reflect import prefer page user set prefer page start dai account prefer page random surfer model introduc probabl surfer jump back random page probabl probabl continu hyperlink limit distribut surfer model favor page page page repres distribut person pagerank vector person set person view import page web rank user queri result global import distribut length number page web comput naiv iter requir multipl scan web graph make imposs carri onlin user queri prefer larg comput store offlin present method encod share vector practic comput store comput quickli queri time approach restrict prefer set subset set hub page select import person expect set page high pagerank page directori open directori page import applic size thought person present algorithm unlik previou work scale size techniqu introduc yield approxim broader set level person arbitrari prefer set main contribut paper base result encod partial enabl scalabl comput divid precomput time queri time custom fashion resourc applic requir main linear theorem repres linear combin basi yield natur construct share compon hub theorem basi vector encod partial vector hub enabl basi vector construct common compon decomposit theorem establish linear relationship basi exploit minim redund comput algorithm comput basi special algorithm comput partial vector hub algorithm construct partial vector hub skeleton result real web data demonstr effect scalabl techniqu section introduc notat paper formal person pagerank mathemat section present basi step encod share compon full encod present section section discuss comput partial quantiti result present section relat work discuss section section summar contribut paper preliminari denot web set web page direct edg qi iff page link page page denot set individu denot individu denot analog page number refer page number interchang vector denot entri compon typeset vector boldfac scalar normal font vector paper nonneg entri thought distribut arrow magnitud vector defin written jvj vector magnitud vector repres list nonzero measur size number nonzero entri gener prefer set discuss section prefer vector denot amount prefer page user person bookmark page uniformli jp formal person pagerank score equat matrix web graph ij page link page ij simplic assum page enforc ad page result score adjust account effect appendix person pagerank equat written cu constant discuss section typic experi shown small effect practic solut equat distribut random surfer model discuss section step surfer teleport page probabl move random theorem markov solut jvj exist uniqu solut person pagerank vector prefer vector uniform distribut vector solut global pagerank vector prefer page reader tabl page list terminolog extens section basi vector present step encod share compon motiv encod simpl observ linear formal theorem theorem prefer vector constant linear theorem solut linear combin prefer vector linear combin proof appendix xn unit vector entri basi vector distribut random surfer model surfer teleport back page probabl thought repres page view entri js import view note global pagerank vector rn averag page view arbitrari person vector written weight sum unit vector constant linear express linear combin basi vector correspond distribut aperiod markov chain transform person vector solut vector linear recal section prefer set prefer restrict subset set hub page basi hub vector hub comput prefer set size prefer vector nonzero comput ad hub vector weight hub vector comput naiv comput comput requir multipl scan web comput time storag grow linearli number hub vector jh enabl scalabl comput construct hub vector share compon decomposit basi vector section repres linear combin jh hub vector rp base hub page construct quickli set precomput hub comput store hub vector impract comput larg number hub vector partial vector hub compon hub vector construct quickli queri time hub vector partial vector hub skeleton save comput time storag due share compon hub vector depend resourc applic hub vector construct offlin thought gener comput partial vector hub page essenti encod part hub vector rp uniqu compon share hub vector comput store redundantli complement partial vector hub succinctli captur interrelationship hub vector partial vector assembl form hub section mathemat tool formal decomposit present formal relationship hub relat person pagerank score repres note mathemat comput strategi paper present specif context web gener result applic scenario involv stochast pagerank term descript section hub set subset web page prefer set set page person paper subset prefer vector prefer set weight person pagerank vector import distribut induc prefer vector basi vector prefer vector singl nonzero entri hub vector rp basi vector hub page partial vector hub skeleton construct hub vector hub skeleton partial vector construct hub vector web skeleton extens hub skeleton includ page partial quantiti partial vector web skeleton intermedi result maintain iter comput tabl summari term web concept base distanc introduc defin summat tour start end possibl touch multipl time tour hw length number edg term interpret probabl travel defin tour summat note measur distanc higher node suggest notat proven appendix pagerank score view measur distanc nonempti set page defin restrict consid tour pass page equat page occur endpoint written notat remind pass page note length set hub hub page discuss web skeleton section definit differ slightli concept distanc tour visit multipl time note gener distanc form partial vector defin equat influenc path pass page separ set section true page strategi advantag properti precomput store partial vector full hub vector partial vector cheaper comput store full hub assum repres list nonzero entri size partial vector jh make approach scalabl ad back queri time comput full hub vector comput store explicitli section show encod comput store effici hub skeleton briefli review section repres linear combin hub vector construct quickli queri time precomput hub small subset encod hub vector section show full hub vector rp comput store partial vector intuit account path pass page distribut comput store differ vector effici topic section vector express term partial vector theorem recal section xh theorem rh term hub theorem roughli distanc page page distanc time distanc correct path hub term deal special case appendix quantiti rh side partial vector discuss section comput hg hub page hub vector rp construct partial vector hub rp rh immedi hub theorem set size jh smaller full hub vector nonzero entri contribut entri sum greater small valu omit minim loss set fr hg form hub give interrelationship partial vector intuit view encod construct suggest hub equat shown figur partial vector includ depict triangl label tip triangl thought repres path start repres distribut import score comput base discuss section triangl show comput partial vector hub page part hub skeleton depict tree hub vector visual hub vector construct logic assembl partial vector weight hub shown bottom discuss summari hub vector build block prefer vector base hub page hub vector hub skeleton partial vector figur intuit view construct hub vector partial vector hub skeleton partial hub build block hub vector partial vector hub skeleton build block construct materi hub vector intermedi step note prefer vector base multipl hub construct partial vector directli result save versu construct hub partial vector share multipl hub vector choic made assumpt set hub page choic hub page impact depend locat hub page graph structur size partial vector smaller page higher page averag close page term size partial vector relat hub page page hub theorem intuit page gener import person case intend hub page high benefici includ page improv perform ran experi confirm size partial vector smaller page hub random page web skeleton techniqu construct hub vector extend enabl approxim person arbitrari prefer vector necessarili base person page hub equat construct partial comput discuss section cost comput store order magnitud rp approxim captur person inform hub set thought page open captur inform broad topic rp explor util web skeleton fr area futur work comput section present construct hub vector partial vector hub skeleton fr hg discuss web skeleton fr comput partial quantiti naiv iter scale poorli number hub page present scalabl algorithm comput quantiti effici dynam program leverag interrelationship show construct partial vector hub skeleton queri time algorithm properti stop time resourc current comput resum resourc permit begin section present theorem underli algorithm present connect pagerank shown appendix section present base comput gener basi vector algorithm section meant foundat algorithm section comput partial quantiti section discuss construct partial vector hub skeleton decomposit theorem recal random surfer model section instanti prefer vector xp page ps view surfer teleport page probabl probabl random fraction surfer step teleport behavior strikingli similar model instanti prefer vector surfer teleport directli equal probabl similar formal theorem theorem rp decomposit theorem basi vector rp averag basi vector factor cx proof appendix decomposit theorem ps view web averag view extra import page import ps view page import view ps intuit yield formal person pagerank basi vector defin vector satisfi decomposit theorem decomposit theorem identifi relationship basi comput basi vector rp relat subproblem dynam program inher relationship comput basi vector comput rest solv subproblem presenc cycl graph make approach ineffect approach subproblem comput vector comput decomposit theorem combin comput greater approach advantag fix process stop time current answer algorithm comput basi vector present algorithm gener context comput full basi vector algorithm present primarili develop algorithm comput partial present section algorithm iter comput maintain set intermedi result rp iter build solut success approxim simultan comput error compon vector basi vector maintain invari dk rp error begin xp approxim initi error store ek dk repres implement list nonzero entri algorithm common intermedi differ decomposit theorem refin intermedi result success iter import note algorithm present section deriv section comput vector arbitrari approxim desir vari depend applic focu algorithm effici scalabl number hub vector comput basic dynam program algorithm basic dynam program basi vector page comput iter vector comput ps previou decomposit theorem iter deriv ek proof algorithm correct appendix error shown reduc factor iter note ek valu correct comput dk omit implement comput partial quantiti section size ek grow number limit size number page reachabl intermedi score ek larger main implement read disk written disk iter data iter data previou iter delet specif detail implement discuss section select algorithm select algorithm essenti version naiv algorithm readili modifi comput partial section deriv error page decomposit theorem comput result ek subset error reduc factor basic dynam program algorithm select subset page error scheme limit number delai growth size intermedi result reduc error section comput hub vector correct select proven appendix repeat squar algorithm repeat squar algorithm similar select extend step equat comput essenti result equat dk assum set comput hub skeleton section correct equat proven appendix shown repeat squar reduc error faster basic dynam program select algorithm error squar equat reduc altern scheme section note algorithm present comput set basi differ requir comput vector comput rp basic dynam program algorithm requir vector comput repeat squar requir result ek comput select comput independ comput partial quantiti section present iter algorithm comput full basi vector arbitrari present modif algorithm comput partial partial vector hub skeleton fr hg comput effici part entir web web skeleton fr partial quantiti comput time greater size hub vector partial vector partial vector comput simpl special select algorithm hub page tour pass hub page consid choic ce converg intermedi result ek comput proof present appendix algorithm make clear page hub page improv page expect reach page sooner random stop sooner result shorter partial vector hub skeleton hub skeleton subset complet web skeleton comput techniqu present section comput faster interest entir web higher desir hub skeleton comput entir web skeleton special repeat squar algorithm comput hub intermedi result comput partial vector ek comput algorithm section error appli repeat squar algorithm result success iter shown appendix iter repeat total error je bound vari comput arbitrari notic intermedi result ek updat score dk entri comput interest hub score simpli drop entri intermedi result run time storag depend size length entir hub vector restrict intermedi result fit main defer comput hub skeleton queri time web skeleton comput entir web modifi basic dynam program algorithm comput hub score save time memori usag restrict comput elimin entri intermedi result similar techniqu comput hub skeleton justif modif hub score affect hub score previou modifi algorithm equal basic algorithm jh order magnitud size intermedi result reduc significantli construct prefer vector construct directli partial vector hub skeleton hub equat singl hub vector special algorithm outlin prefer comput hub skeleton construct ru term partial assum precomput term repres simpl subtract repres full construct suffic part hub skeleton comput hub highest scheme discuss section result improv increment time small subset time accumul result experi perform experi real web data stanford crawl web million page iter comput pagerank unaffect leaf page remov graph ad back comput remov leaf graph consist million page web graph intermedi result ek larg fit main partit base present divid comput portion carri memori set page partit arbitrari set equal size web repres partit chunk edg qi intermedi result repres list page includ set intermedi result partit chunk tripl lk algorithm comput partial singl column memori part result comput success read individu block graph intermedi result iter requir linear scan intermedi result web repeat web graph explicitli comput partial vector comput hub vector partial vector size select algorithm discuss section found hub approach effect page random page experi rang top top page highest pagerank constant set evalu perform scalabl strategi independ implement focu size result comput linear size result number trial perform limit comput result jh figur plot averag size hub vector partial vector size number nonzero comput iter select comput hub vector basic dynam program algorithm note plot jh logarithm scale experi run cpu machin gigabyt memori jh comput full vector partial vector unabl comput hub vector jh due time averag vector size expect vari significantli jh hub vector figur reduct size techniqu jh suggest techniqu scale jh number hub averag vector size partial vector full hub vector figur averag vector size number hub comput hub skeleton comput hub skeleton jh run select algorithm iter run repeat squar algorithm iter chosen top entri scheme averag size hub skeleton entri iter repeat squar algorithm cost depend jh constant respect partial vector comput construct hub vector partial vector measur construct hub vector partial vector hub skeleton note practic construct directli partial discuss section perform construct depend heavili user prefer vector hub vector comput measur perform benefit partial vector approach suggest section hub vector construct partial vector vari queri time applic perform demand entir set construct highest jh figur plot averag size time requir construct full hub vector partial vector memori versu jh result averag hub vector note averag construct vector size construct vector size construct time figur construct time size hub skeleton portion logarithm scale recal section partial vector hub vector construct comput limit error valu figur roughli error smaller full hub vector comput section error size vector indic interest number page nonzero entri distribut vector full hub vector section page nonzero entri page link page averag figur hub vector million nonzero entri construct partial vector relat work person pagerank enabl person web search suggest modif global pagerank comput notion import comput pagerank score address naiv algorithm person pagerank score enabl web search precomput hub vector broad categori open directori bia import vector weight select text queri experi conclud person pagerank score improv web number hub vector limit due comput address work scale number hub page person direct applic work techniqu comput present iter comput similar spirit pagerank appli queri time subgraph consist page match text queri person base web page linkag structur web address hit number page subgraph hit smaller paper comput scratch queri time make hit approach difficult scale algorithm import score improv global version import present restrict comput subgraph deriv text match base web page unlik suggest import score precomput offlin text enorm number possibl make approach difficult scale concept graph enabl partial comput solut problem context search work deal search scale smaller web system aspect pagerank comput address strategi implement algorithm adopt present concept paper base concept distanc introduc present intuit model similar measur graph structur summari address problem scale person web start identifi linear relationship person pagerank vector express linear combin basi vector person vector arbitrari prefer set drawn hub set construct quickli set precomput basi hub hub laid mathemat foundat construct hub vector effici relat person pagerank score intuit notion distanc arbitrari direct graph notion distanc identifi interrelationship basi vector present method encod hub vector partial vector hub skeleton redund minim partial vector hub page repres part ps hub vector uniqu skeleton specifi partial vector assembl full vector present algorithm comput basi show modifi comput partial vector hub skeleton effici ran experi real web data show effect approach result show strategi result resourc reduct full scale jh person acknowledg author discuss extens implement refer roi narayanan hector proxim search intern confer larg august effici comput pagerank technic stanford pagerank eleventh intern world wide web jun andrea hector repositori web page ninth intern world wide web jennif widom measur similar eighth acm sigkdd intern confer knowledg discoveri data juli jon kleinberg authorit sourc hyperlink environ ninth annual symposium discret san januari rajeev motwani prabhakar raghavan random algorithm cambridg unit lawrenc sergei rajeev terri winograd pagerank citat bring order web technic stanford matthew richardson pedro domingo intellig probabilist combin link content inform pagerank advanc neural inform process system decemb appendix linear theorem theorem prefer vector constant cu cu cu cu decomposit theorem theorem ro cx rewrit equat form prefer vector defin deriv matrix cu matrix ij requir jvj write equat loss deriv matrix deriv matric equat cx jv show case uniqu cx ca ident cu cu cu cu ca ca ca cu ax cx relat person pagerank relationship person pagerank score theorem theorem write decomposit theorem scalar form page set form fix set form proof similar shown equat uniqu show satisfi equat path reach tour start end step correspond tour deriv append edg begin biject length length probabl travel split sum step tour write oz oz correspond hold extra tour correspond tour start length tour length tour case loop factor yield insight fair pagerank score global pagerank page uniform sum pagerank page page intuit page averag page distanc measur note summat tour touch multipl time effect page influenc pagerank factor simpli chang page pagerank link page path logic creat page pagerank factor link page quantifi definit tour touch written summat independ qs distanc loop factor elimin result score page low pagerank hub theorem theorem cx cx proof idea separ tour occurr page rest tour denot begin occurr page pass qi short set page pass written partit summat jt tour except tour special case group tour end rewrit canon biject tour tour pass except tour write tour replac previou equat account length set tour pass set tour minu set tour pass account tour equat written vector form hub theorem proof idea separ tour occurr page rest tour denot begin occurr page pass qi partit summat jt tour except tour special case group tour begin rewrit canon biject tour tour pass except tour write tour replac previou equat account set tour pass set tour minu set tour pass account tour equat written vector form hub theorem basic dynam program algorithm prove correct basic dynam program show sequenc fe converg impli converg je proof induct case claim true show cx cx ro cx step justifi decomposit theorem show je je je select algorithm proof basic dynam program show arbitrari induct show term cancel similarli decomposit show term cancel jd error iter choic maxim page maxf ensur error case top page highest repeat squar algorithm verifi correct repeat squar show arbitrari proof select error top page highest error squar je equat je repeat squar reduc error faster decai factor basic dynam program select comput partial vector show hold set page endpoint page pass set page begin case page expand iter tour tour pass tour qi induct equat hold equat differ induct differ written restrict tour show equat contribut expand expand induct replac summat show equal set tour step correspond tour length deriv append edg hq qi end biject length length probabl travel split summat rewrit show show equat equat complet proof equat show converg converg comput hub skeleton denot result iter repeat intermedi result left select correspond error initi hub bound step select expand page equat error hub page iter repeat bound error compar previou iter geometr seri bound total error je iter bound
IR/300 5 princip manifold alex smola robert williamson sebastian bernhard gmd germani depart australian nation australia abstract set learn view quantiz problem minim expect quantiz error subject restrict tool regular theori risk minim set set close relat princip curv gener topograph map explor connect algorithm find princip manifold regular varieti wai result demonstr feasibl approach deriv uniform converg bound bound learn rate algorithm give good bound cover number obtain optim learn rate order type regular sampl size α arbitrari posit constant introduct problem learn defin learn explicit cost function exist compar train data make assumpt respect question goal reliabl featur set shown lead kernel princip compon analysi option properti repres data mean lead descript model data possibl crude model underli probabl princip curv gener topograph map linear gaussian simpl vector quantiz exampl thereof studi type model present paper problem learn formal quantiz function work support part grant arc dfg ja adam comment discuss fischer hu simon lnai pp berlin heidelberg regular princip manifold techniqu regular theori lead natur gener higher criteria princip curv algorithm length constraint overview background princip curv result demonstr feasibl approach part quantiz function approach give uniform converg bound deriv bound function analyt tool respect metric give bound rate converg arbitrari posit α number exampl specif kernel improv rate approach regular oper implicitli result weaker bound suggest reason penultim section paper quantiz error function denot vector space dataset drawn iid underli probabl distribut index set class map map describ basic properti seek quantiz error min minim µ gener unknown replac µ empir densiti analyz empir quantiz error min problem learn cast form find minim practic exampl defin set function minimum denot varianc data minim quantiz function determin analyt argmin argmin xi alex smola al sampl law larg number minim converg minim uniform converg defin fi fi set function min denot canon distort error vector quantiz practic algorithm find set vector minim prove converg properti discret quantiz map manifold lower input space pca view defin set line segment minim min yield line parallel direct largest varianc base properti current hasti stuetzl carri idea linear function curv denot princip class continu valu continu function minim min compact set minim defin gener ill pose problem recent converg properti state al modifi origin order prove bound show result estim defin impli restrict polygon line fix number knot fix length practic al constraint angl polygon curv actual length constraint achiev sampl complex rate train time uniform converg length constraint regular princip manifold smooth constraint estim curv regular oper greater freedom choic regular lead faster regular oper framework extend situat provid theoret insight princip manifold algorithm invari regular step show class admiss oper restrict scalar provid basic assumpt scale behavior permut symmetri proposit invari regular homogen quadrat invari irreduc orthogon ρ group satisfi scalar form oper proof directli quadrat oper written posit final polar equat hold virtu lemma scalar oper loss assum scalar consequ exist regular oper satisfi invari condit useless oper presenc suffici strong invari assumpt proposit canon permut group finit vector space group orthogon transform enforc scalar oper immedi fact group irreduc construct scalar oper regular quantiz function variant minim empir quantiz function lead algorithm amen implement alex smola al uniform converg bound obtain class smooth curv induc approach regular version empir quantiz function λ λ scalar regular oper penal function exampl section sake find princip util scalar regular oper simpli mean curv surfac transform rotat penal equal result connect regular oper kernel suitabl kernel match regular oper final assum constant function regular chosen node afford term comput regular term written remain find algorithm minim achiev coordin descent assum data center drop term greatli simplifi notat algorithm minim minim regular quantiz function kernel solv xi λ min achiev iter fashion analog em algorithm oper iter minim respect project correspond expect step repeat regular quantiz function significantli argmin regular princip manifold fix term turn equal paramet fix adapt fix differenti respect yield λ α matrix ism slight matrix term algorithm converg minimum remain find good start valu initi center set sampl xi coeffici approxim point direct princip compon matrix analog initi gener topograph map eq min λ α solut λ α matrix matrix correspondingli deriv algorithm ad similar precursor literatur princip curv length constraint show choic minim exampl regular differenti integr squar curv constant speed leav empir quantiz error regular term minim construct depend minim constant constant interv equal squar length curv optim solut show minim empir quantiz error regular minim empir quantiz error fix regular term λ adjust algorithm find optim curv length algorithm reason slightli incorrect complet number node basic properti provid number kernel suffici high alex smola al experi chose gaussian rbf kernel correspond regular penal order deriv simultan show kernel correspond oper defin σ dx laplacian gradient oper mean smooth function curv curvatur properti chang slowli detail regular oper connect basic algorithm bayesian observ minim similar quantiti differ choic chosen ident point zi regular gaussian prior type word bishop al regular final gener xi natur gener model set note unlik sec number node kernel critic paramet due fact coupl singl center basi function regular oper algorithm gaussian process context data interpret creat homogen process map final period kernel model circular structur experi order show basic idea algorithm ran toi experi figur case gaussian rbf discuss section gener data set dimens appli algorithm prior knowledg origin dimens data set latent variabl space size paramet set width basi obtain reason result found suitabl choic regular factor λ match origin distribut achiev number width basi function effect influenc basic characterist small regular princip manifold fig upper imag gener dataset ad distribut dot line result manifold gener approach solid line paramet rang left valu regular paramet λ width number basi function constant lower imag gener dataset sampl distribut depict left imag dot sampl remain imag show manifold yield approach paramet space λ width number basi function constant figur show converg properti algorithm observ regular quantiz error regular term quantiz error term free vari show algorithm find minimum uniform converg bound proce analysi rate converg algorithm avoid technic moment distribut assum exist ball radiu al show assumpt manifold ball ur radiu quantiz error larger order deriv uniform converg bound introduc norm denot euclidean norm dimens metric induc norm usual fashion metric ρ set alex smola al fig regular empir quantiz regular quantiz error number iter ɛ cover number denot depend smallest number radiu union result similar style bound obtain slightli independ technic condit proposit bound princip denot class continu function µ distribut drawn iid pr emp ɛ proof definit empir quantiz function sum iid random variabl bound due fact ball radiu appli inequ obtain pr emp η properti norm valu bound ε ε cover cover loss function induc exist fi ɛ rm ε ε pr η pr emp η ε substitut union bound desir result result assess qualiti empir found manifold order obtain rate converg result connect expect regular princip manifold quantiz error princip manifold emp minim rm emp manifold minim quantiz error proposit converg optim definit proposit definit emp pr ɛ proof proof similar proposit emp ε emp ε max fi emp appli union bound chang η ε η prove claim provid number uniform converg bound bound suitabl cover entropi number detail briefli review exist term bound cover number metric al essenti show log ε polygon curv sphere ur radiu distanc measur defin minimum distanc curv function analyt tool obtain gener replac obtain bound expect quantiz error properti regular oper denot set bound linear oper norm space nth entropi number set rel metric entropi number oper defin alex smola al note defin compact bound entropi number parametr curv satisfi constraint λ view imag unit ball oper kei tool bound relev entropi number factor result lemma stephani deal vector valu function handi view gener linear dim oper featur product regular oper section practic expand term kernel function shown repres map reproduc kernel hilbert space call featur dot product techniqu give uniform converg state term eigenvalu proposit map introduc mercer kernel eigenvalu ck constant diagon map map ball finit radiu ra center origin evalu oper plai crucial role deal entir class function singl defin technic argument replac worri simpli coeffici id id regular princip manifold construct vice actual theorem defin scale oper ad multi output case time tensor product ad ad theorem princip curv mercer φ map featur λ defin ad entropi number satisfi proof point factor argument properti word exploit reli proposit price deal vector valu function degeneraci eigenvalu ad scale factor singl output situat theorem eigenvalu scale oper immedi obtain corollari corollari number vector valu mercer defin ad λ λ note affect account implicitli decai eigenvalu alex smola al integr oper induc due oper norm scale oper due slower decai properti scale factor ai techniqu led bound entropi number appli sketch similar result case princip dim exponenti polynomi decai eigenvalu kernel proposit mercer kernel ln ɛ proof seri bound aj γ τ posit number φ find upper replac comput dj obtain φ ln φ yield claim rate converg τ prove theorem kernel proposit appli gaussian harmon detail issu final invert obtain bound ɛ ln λ similar result obtain case polynomi decai eigenvalu mercer kernel ln proposit mercer kernel β α rate converg theoret interest princip manifold learn al show result princip curv exact constant obtain sole asymptot rate regular princip manifold contraint regular show util power regular α obtain bound form polynomi rate decai eigenvalu rate exponenti rate decai arbitrari posit learn rate proposit rate princip fix learn rate princip manifold lower bound α arbitrari posit emp emp eigenvalu decai exponenti learn rate α bound case polynomi decai eigenvalu rate α emp α emp proof clever trick difficulti bound approxim error proposit pr ɛ ɛ um ɛ step inequ deriv substitut set ɛ exploit yield emp ln ln bound α suitabl larg desir result polynomi decai eigenvalu obtain proposit suffici larg constant ln α substitut yield emp α α ε α minimum obtain ɛ α ɛ α α order prove theorem alex smola al interestingli result slightli weaker result case length correspond differenti polynomi eigenvalu decai order α rate α al obtain due optim bound entropi number induc result state term metric fulli understood weak detract fact rate stronger algorithm util regular sum framework learn draw techniqu minim risk function learn yield algorithm suitabl deal princip manifold term kernel function treatment regular oper made easier decoupl algorithm part find suitabl part class manifold desir properti algorithm crucial depend number node sampl size depend bound princip manifold depend underli distribut µ mild perform capac control effect calcul shown regular princip manifold feasibl perform learn proof larg rest connect function analysi entropi number fact give good bound learn rate refer lugosi minimax distort redund empir quantiz design ieee transact inform cm william gener topograph map neural carl stephani approxim oper cambridg nonlinear princip compon analysi group theori applic physic problem addison reprint ny hasti stuetzl princip curv journal american statist regular princip manifold learn design princip curv ieee transact pattern analysi machin müller nonlinear compon analysi kernel eigenvalu problem neural aj müller connect regular oper support vector kernel neural solut problem vapnik estim depend base empir data william predict gaussian linear regress linear predict learn infer graphic rc aj gener perform regular network support vector machin entropi number compact oper royal hollowai yuill motion coher theori intern confer comput page decemb ieee comput societi press
ML/301 6 integr learn cognit machin learn natur languag clair cardi depart comput scienc cornel ny run integr cbl cognit march integr learn cognit machin learn natur languag abstract paper show psycholog constraint human inform process effect guid featur set select learn linguist knowledg input baselin case natur languag learn algorithm select relev cognit task automat modifi weight featur appropri appli cognit bia approach featur set select natur languag learn problem show perform learn algorithm improv significantli relev cognit incorpor baselin instanc argu cognit bia approach offer possibl learn natur simplifi process instanc design obviat separ instanc linguist knowledg acquisit task approach offer mechan explicitli combin frequenc inform techniqu prefer emploi tradit linguist approach natur languag process integr learn cognit machin learn natur languag introduct recent statist machin learn techniqu shown significantli reduc effort build natur languag process offer automat mean acquir robust solut host lexic structur disambigu problem learn algorithm successfulli natur languag learn task learn natur languag system process text retriev store case describ similar text handl past approach appli languag acquisit includ stress acquisit al daeleman lexic tag partial tag daeleman al disambigu lee semant class tag noun phrase chunk al daeleman al preposit phrase attach al method emploi nlp task yu text categor lehnert concept extract machin learn success learn algorithm depend critic describ train test instanc task design instanc featur set select pose problem current statist machin learn approach natur languag understand instanc probabilist model typic requir linguist task featur set select import learn learn algorithm refer literatur reason waltz learn al reason schank kolodn lazi learn al solv problem creat case base previou episod classic learn case encod context problem occur set solut problem term class problem similar case retriev case base class present solut problem simplest case retriev oper algorithm count number overlap featur test case train case retriev case highest score implement clear perform degrad irrelev featur popul instanc featur import learn automat determin featur weight difficult learn problem previou work learn natur languag emploi varieti method handl featur set select problem similar measur case retriev algorithm perform featur select featur weight ng lee similar measur deriv stanfil waltz metric assign weight featur weight creat metric base differ distribut featur valu class valu daeleman al introduc global featur weight scheme shown good perform number natur languag learn task calcul inform gain featur weight match featur case retriev featur weight scheme global deriv singl weight vector task retriev case base relat explor similar idea autom featur select featur weight learn algorithm emploi featur weight whatsoev featur select instanc assum equal import simmon yu riloff lehnert paper approach problem featur set select learn linguist knowledg algorithm reli research psycholog psycholinguist discov examin numer psycholog constraint human inform process examin cognit ffl subject item mention sentenc shown special import bia gener focu attent bia ffl peopl consist show bia tempor recenc inform sentenc interpret ffl restrict short term memori limit affect number languag skill section describ detail show psycholog constraint effect guid featur set select learn linguist knowledg input baselin instanc natur languag learn algorithm select combin cognit modifi instanc modif directli indirectli chang featur set describ instanc direct made chang delet indirect modifi weight featur appli cognit bia approach featur set select natur languag learn task rel pronoun predict gener semant specif semant part speech unknown word find accuraci learn algorithm improv significantli relev cognit incorpor baselin instanc cognit bia approach featur set select offer possibl learn natur ffl natur mechan combin frequenc inform techniqu prefer emploi tradit linguist knowledg approach natur languag process ffl cognit bia approach featur set select simplifi shorten process design instanc individu natur languag learn task system develop safe includ featur knowledg sourc baselin instanc irrelev featur discard automat remain featur weight appropri ffl cognit bia approach featur set select underli instanc linguist knowledg acquisit task remaind paper organ section introduc main natur languag learn rel pronoun disambigu section summar psycholinguist studi effect select cognit process languag process describ basic learn algorithm empir studi present detail cognit bia approach featur set rel pronoun disambigu task run describ baselin instanc rel pronoun disambigu task section section show baselin modifi automat cognit focu short term memori evalu effect bia rel pronoun resolut section evalu relat algorithm cognit bia select evalu entir approach lexic tag task section conclud discuss gener implic cognit bia approach featur set select connect exist work machin learn nlp reader refer relat paper discuss set experi implic machin nlp perspect rel pronoun resolut section introduc natur languag learn rel pronoun vehicl describ cognit bia approach featur set select goal learn algorithm disambigu sentenc toni boi won award didnt won award learn algorithm locat phrase repres descript context occur system recogn boi refer boi learn algorithm determin explicit rel pronoun find rel pronoun import task natur languag understand system inform extract task learn algorithm al typic fill semant role underli function structur current subsequ semant interpret sentenc includ fact boi object includ fact boi implicit actor boi won award rel pronoun occur frequent sentenc text collect focu specif learn disambigu heurist frequent rel pronoun inform extract occur ten sentenc higher frequenc document relev inform extract task find rel pronoun simpl factor make ffl head noun rel pronoun consist syntact constitu posit exampl tabl boi boi direct object subject head phrase immedi case show case head distant rel pronoun ffl conjoin noun phrase conjunct phrase ffl semant valid refer entiti sponsor entir phrase ge ffl appar sentenc analyz distinguish instanc true rel pronoun ffl disambigu rel pronoun depend inform man woman depend number verb locat implicit fill equal difficult discuss cardi lehnert solut problem consist work present ffl ambigu sentenc depend surround context ffl locat requir assimil syntact semant knowledg syntact structur sentenc ident noun phrase preposit posit case toni boi won award boi gave book red hair toni dinner men detroit sold comput spoke woman black shirt green hat corner room interview id provid id provid support watch talk woman man danc talk woman man danc woman philadelphia plai soccer sister gift children attend parti tabl tabl show learn system learn locat descript show cognit process prefer affect human languag process effect learn algorithm section describ briefli examin psycholinguist studi effect languag process rel pronoun cognit languag process sentenc process research psycholinguist studi languag construct troublesom peopl depend fodor garden path sentenc steedman repres class difficult linguist phenomena languag task select studi paper constitut exampl understand rel requir resolv rel pronoun distant rel pronoun rel fill lexic sourc garden path sentenc reader word boat float river problem initi syntact peopl tend interpret verb past participl hope psycholinguist studi peopl handl difficult uncov gener properti languag processor properti emerg studi simpler structur past year properti languag processor emerg shown affect peopl linguist interpret languag principl associ assum absenc phrase attach partial syntact analysi rightmost point principl minim attach fodor state peopl prefer attach phrase minim complex analysi themat role inform inform verb defin particip action shown provid strong constraint sentenc uncov depend al found verb subcategor transit effect influenc structur attach prefer syntact structur consist properti verb al nicol al languag process properti identifi lexic disambigu task found mean ambigu word initi activ word encount found except properti show context limit activ mean krueger rel frequenc compet lexic structur interpret affect plausibl al paper cognit properti languag subject recenc short term memori semant syntact prime gener properti list potenti affect languag processor abil interpret varieti linguist construct recenc bia process peopl consist show bia recent inform gibson nicol kimbal mitchel fodor investig import recenc find rel pronoun found english prefer recent noun phrase sentenc rel pronoun ambigu sentenc journalist interview daughter peopl assum refer daughter shown recenc bia interact process prefer gibson pearlmutt describ earlier studi al examin rc rel syntact attach rel verb number head comput model build destroi fire np refer noun prep refer preposit comput model build destroi fire comput model build destroi fire shown ital result subject find attach easiest explan order independ prefer factor strong recenc bia prefer predic proxim principl gibson prefer attach structur closer predic potenti subject subject access number studi note special import item mention subject sentenc al al al techniqu show access actor sentenc remain high end sentenc target word briefli flash comput screen point aural present sentenc subject decid visual present word real word press button faster word semant relat target word control attribut prime target al find strong reactiv effect actor mention sentenc actor agent verb reactiv test end sentenc distanc actor greatest view subject access bia gener focu attent bia vision learn object view highli access object learn aural loud sound highli access restrict memori limit psycholog studi determin peopl rememb minu item time restrict short term memori capac note cognit process constraint affect languag process skill syntact believ construct applic access store entireti memori assum comput involv syntact analysi place demand work memori parser pursu singl analysi time carpent studi relationship work memori capac languag process estim subject work memori capac read span test measur subject abil find refer pronoun vari distanc find work memori capac accur predict differ observ subject larger work memori capac identifi pronoun refer longer read span test determin length longest sequenc sentenc subject rememb final word distanc find work memori capac correl subject abil integr semant inform sentenc king show differ work memori capac differ read time class rel reader low work memori capac show poorer rel object gap high capac spite spend time read critic portion test sentenc studi pragmat cue provid context improv perform type reader exist interact short term memori limit attent subject access semant sentenc remain activ long distanc languag learn human success limit inform process capac children ignor linguist data receiv comput languag learn system elman build short term memori directli architectur system semant syntact prime semant prime cognit effect inform peopl tend respond quickli word semant relat entiti involv interpret process detect semant prime effect primari mean support interpret task al includ number studi mention al nicol method detect semant prime effect provid window work semant interpret indic time entiti sentenc incorpor mean sentenc refer syntact bia bia meant combin singl bia syntact effect repres languag processor prefer structur consist syntact properti nearbi sentenc subcategor gender note exist nlp system reli heavili cognit incorpor heurist constraint level linguist analysi learn approach implicitli make cognit natur languag learn context window select case tradit nlp difficult determin rel import individu specif languag understand problem difficult complex bia interact algorithm linguist knowledg sourc made system chang increasingli difficult modifi maintain nlp system encod process linguist knowledg monolith data structur approach make explicit cognit separ linguist knowledg implement cognit process prefer section show cognit incorpor automat approach natur languag process show multipl combin present method learn rel strength bia natur languag task learn algorithm emploi simpl neighbor learn algorithm goal train phase collect set case describ ambigu resolut episod problem text analysi case set encod context ambigu occur case annot class describ ambigu resolv current class syntact categori current semant featur class semant class current structur attach class inform posit prefer attach point case base resolv ambigu sentenc test case describ context ambigu encount case retriev algorithm compar problem case store case find similar train class inform resolv current ambigu emploi weight case retriev algorithm compar test case base calcul jn wn yn denot test case wn weight ith featur xn featur test yn train function return equal return case highest score ti singl case return class test case retriev case vote class rel pronoun resolut baselin instanc section describ baselin instanc rel pronoun resolut problem consid explicitli encod cognit examin subsequ section assum learn algorithm larger nlp system process input sentenc gener train test case import ramif case includ pair linguist construct knowledg sourc nlp system larger nlp system circu inform extract system lehnert al lehnert al lehnert al inform extract system input set unrestrict text text respect prespecifi topic domain find inform domain encod inform templat suitabl popul sundheim al cardi baselin instanc rel pronoun circu gener instanc occurr train test text train instanc list pair encod context found train instanc annot singl class describ posit correct detail baselin instanc depend nlp system gener case case encod state system point rel pronoun disambigu kei featur sentenc analysi model influenc case includ ffl circu recogn phrase find sentenc ffl recogn major constitu direct object ffl make structur attach handl conjunct perform preposit phrase attach ffl circu semant featur describ noun adject lexicon tag tag organ noun tag attack ffl circu track recent recogn linguist punctuat mark baselin instanc includ inform element context phrase train test case pair describ phrase case figur phrase man constitu featur denot syntact class posit phrase encount parser featur parser recogn man subject exist subject declar preposit phrase subject sem featur phrase semant classif system lexicon sem featur subject man specifi locat phrase preposit includ prep featur denot preposit featur phrase punctuat mark mark featur includ denot mark featur comma phrase featur instanc denot syntact type linguist entiti immedi sampl featur comma comma phrase featur man figur baselin instanc man conjunct phrase construct label separ sentenc figur direct object conjunct instanc recogn direct object noun phrase direct object verb phrase semant featur sem featur verb train instanc annot class inform list constitu attribut repres posit current sentenc figur man phrase noun phrase inform extract system eleven semant pro quantiti subset featur specif terror inform extract domain train instanc extract set requir text domain phrase featur figur baselin instanc repres class conjunct constitu repres list constitu attribut element conjunct sentenc figur refer conjunct encod apposit predic nomin construct result set semant part class inform sentenc sponsor combin phrase ge apposit predic nomin exact match option consid correct note train instanc gener automat unrestrict text side effect sentenc analysi correct human supervisor rel pronoun data set rel pronoun data set instanc exampl text terror corpu corpu develop conjunct fourth messag understand confer muc perform evalu inform extract system collect newswir radio tv text sentenc text upper case document vari length paragraph page averag sentenc length corpu averag length articl sentenc baselin weight classifi set note rel pronoun system retriev predict case direct object test case sentenc select retriev case list option apposit predic nomin option list constitu overlap current perform learn algorithm rel pronoun resolut depend difficulti linguist task characterist data set instanc featur repres phrase case uniqu class distinct valu data set instanc instanc data set algorithm hope baselin instanc data set creat automat inform extract error experi made pass data set correct small number obviou semant class disambigu error data set instanc instanc set pair involv predic nomin situat option subject object instanc object armi leader threaten peopl type conflict problem system intersect final pair ambigu instanc repres actual punish investig undoubtedli show refer direct instanc differenti includ addit lexic featur distinguish type pronoun remov conflict difficulti rel pronoun disambigu task depend addit factor complex distanc rel level potenti ambigu determin data instanc involv conjunct apposit complex harder learn algorithm locat maximum distanc averag distanc phrase impli recent phrase work case involv syntact ambigu construct respect rel pronoun resolut sentenc exhibit daughter walk man detroit head noun constitu constitu case conjunct learn algorithm semant class inform punctuat correctli handl case evalu baselin instanc result learn algorithm baselin case shown tabl row show accuraci algorithm cross valid remain row show perform addit baselin system system implement default rule rel pronoun disambigu heurist recent constitu resort complet constitu expect system specif human perform result recent human default rule show case problem legitim semant featur human requir complic semant featur combin rule recent human proper perform recent constitu default rule note default rule locat tabl result baselin default heurist baselin instanc recent constitu recent human recent human proper heurist fourth baselin system tabl emploi set heurist rel pronoun resolut develop circu perform evalu heurist consist approxim rule rule access syntact semant inform encod baselin instanc origin base approxim instanc rel pronoun muc terror modifi period handl encount test full inform extract system final row tabl show perform weight neighbor algorithm deriv featur weight base inform gain featur train data note gener approach appli successfulli number natur languag learn problem includ semant class preposit phrase attach daeleman al straightforward composit exist approach tree featur select cardi goal step prune irrelev featur cbl algorithm ignor assign remain featur weight base featur inform gain measur train case van den bosch daeleman daeleman al intent weight featur rel import data set appli algorithm rel pronoun data normal instanc respect entir featur fill nil miss featur tabl approach work poorli rel pronoun task result tabl baselin system perform default rule heurist mcnemar test baselin recent constitu default heurist indistinguish term statist variat significantli outperform featur weight method work poorli larg number class inform gain bia rel pronoun normal instanc miss valu accuraci baselin recent constitu default rule behavior qualit baselin perform markedli default rule immedi rel perform markedli default rule complex subject detect rel pronoun incorpor cognit modifi baselin case cognit measur effect learn algorithm abil predict rel pronoun modif instanc occur direct chang remov attribut rel pronoun featur indirect modifi featur weight vector result cross valid averag statement statist confid level mc test incorpor subject access bia incorpor subject access bia baselin case weight featur subject rel pronoun weight subject featur function fix subject weight test classifi accuraci statist base frequenc underli averag accuraci mc test account rel perform individu instanc test set classifi accuraci exhibit differ perform mc test misclassifi subset instanc dietterich descript mc test subject weight divid evenli featur subject possibl ad origin weight subject featur tabl result subject access bia baselin subject wt subject wt subject wt subject wt tabl show effect rel pronoun resolut subject weight result incorpor subject access bia improv rel pronoun disambigu compar baselin dip perform statist test mc test differ baselin weight higher subject weight provid improv perform result baselin produc circu encod subject access bia explicitli recogn subject major constitu sentenc label noun phrase origin encod bia adequ addit modif baselin requir subject access bia posit effect subject access bia affect small number featur case subject featur subject identifi rel pronoun subject access bia plai role analysi error baselin perform slightli major type incorpor recenc bia translat recenc bia train test instanc wai featur renam posit constitu rel part subject relabel noun phrase verb unambigu denot presenc subject establish label constitu label natur parser baselin instanc figur show effect label leftmost rightmost column figur origin baselin recenc assum attribut label preposit phrase posit left origin phrase label respect direct object receiv attribut recenc noun phrase posit order yield featur set instanc modifi uniform encod context rel pronoun messag congress congress point view rel pronoun sentenc similar refer case label assign recent constitu sentenc congress attribut assign class instanc constitu baselin label recent constitu instanc attribut baselin sentenc label congress figur incorpor recenc bia label approach incorpor recenc increment origin weight featur function proxim tabl creat weight featur element closest rel pronoun receiv weight ten valu test subsequ weight featur reach implement recenc weight depict recenc weight column tabl note mark featur phrase obtain weight depend featur recogn parser process identifi semant class final punctuat mark conjunct phrase recenc weight ad origin featur weight produc final weight vector nlp system gener make implement recenc weight assign weight featur singl phrase altern work recenc weight scheme nlp system rel pronoun data set result experi recenc separ combin form tabl incorpor recenc weight maximum weight phrase attribut baselin recenc constitu weight weight recenc weight congress shown tabl combin label recenc weight system relabel attribut instanc label initi weight vector recenc weight procedur tabl show recenc weight label effect predict appli perform run statist combin improv perform significantli respect baselin instanc recenc weight mc test differ respect label combin recenc bia perform recenc effect strong rel pronoun resolut individu implement recenc bia complement local context provid label critic find recenc weight lack local addit emphasi constitu closest rel pronoun tabl result recenc bia boldfac entri respect baselin recenc weight baselin recenc heurist label weight broad instanc space recenc label reexamin origin data set characterist appli bia section data set encod baselin case exhibit uniqu incorpor recenc number reduc concret instanc direct object baselin recenc bia relabel depend distanc rel pronoun number instanc instanc data set similarli reduc spite reduct data set number instanc type remain uniqu baselin analysi test combin recenc bia correct baselin true time combin recenc markedli baselin recogn rel pronoun combin recenc perform baselin distanc rel half differ involv distanc phrase rel pronoun instanc combin recenc correct baselin list denot phrase select varga presidenti candid democrat win question baselin rival recenc awar rid baselin learn kill recenc democrat recenc america baselin put baselin spanish resid recenc el leav countri jose maria martinez roberto recenc italian rossi recenc stai incorpor restrict memori bia clear baselin instanc rel pronoun task make short term memori learn algorithm featur case retriev short term memori explicitli state short term memori limit vari depend cognit task depend size type rememb short term memori bia state featur discard rigor appli restrict memori bia baselin repres memori limit set test learn algorithm select featur highest randomli case set weight remain featur effect prune select featur instanc baselin featur weight restrict memori bia discard relev featur discard irrelev expect bia posit impact perform combin cognit provid addit featur relev inform tabl result restrict memori bia baselin memori limit memori limit memori limit memori limit result restrict memori bia shown tabl random compon rm result averag separ clear tabl bia degrad abil system predict rel pronoun drop perform statist test show differ perform respect result random featur select restrict memori bia appli isol effect restrict memori bia depend number featur test case memori limit algorithm base comput featur test case featur set normal respect featur occur train set rel pronoun data averag number featur instanc maximum number featur instanc number test case featur memori restrict memori bia limit perform approach baselin smaller memori limit tend perform poorli respect baselin instanc featur discuss result tabl summari variat bia implement baselin system tabl show cognit bia implement improv accuraci rel pronoun predict baselin perform begin appli recenc weight label statist subject access memori boost perform isol combin implement recenc bia recenc weight label featur obtain produc perform gain respect baselin case combin implement restrict memori bia select featur phrase modifi weight individu featur entir altern implement difficult combin significantli outperform heurist section present evalu automat method select combin cognit expect perform bia appli baselin instanc tabl individu cognit bia summari boldfac entri statist respect baselin heurist cognit bia baselin system paramet correct baselin system default rule heurist baselin singl subject access subject restrict memori memori recenc recenc max combin bia recenc recenc max implement section present evalu basic implement cognit design inform extract implement fairli gener applic wide select nlp tabl summar assumpt paramet bia implement redefin bia implement match characterist nlp system gener train test case bia cognit bia approach featur set select appli varieti natur languag learn task user bia appli paramet invoc learn modif baselin instanc select cognit bia perform complet automat tabl cognit bia modif bia assumpt paramet focu attent constitu object focu weight increment recenc attribut function map origin attribut recenc attribut recenc attribut origin instanc maximum recenc weight order recenc wrt fix point restrict memori size memori cognit bia select section show spite result human languag cognit appli isol found gain perform rel pronoun resolut task achiev appli cognit bia instanc implement recenc bia instanti accuraci learn algorithm surpass baselin heurist experi cognit bia interact plai import role select appli learn task combin recenc perform spite small gain produc recenc weight isol interact occur bia combin ad subject access bia combin recenc perform result vari depend weight subject perform respect combin recenc subject weight statist perform subject weight similarli mix result occur simultan appli restrict memori subject access vari memori limit subject weight set clear select combin cognit achiev perform natur languag learn task difficult problem exacerb fact comput model extrem impoverish model human languag featur vector encod inform sourc human linguist point bia implement necessarili simplifi respect cognit peopl cognit prefer import human linguist task improv perform learn discard present autom method cognit bia select greedi bia select exhaust bia select make assumpt independ individu cognit approach reflect potenti tradeoff qualiti select bia combin comput time requir make select bia select algorithm high greedi exhaust bia select method emploi nest cross valid suggest schaffer outlin figur cross valid select outer cross valid standard evalu methodolog primari differ greedi exhaust bia select algorithm li method instanti highlight step gener algorithm step effect determin structur bia space order search subsect follow describ evalu bia select approach divid data partit call partit test partit remain data train data divid train data partit call partit select data call remain data train set learn data appli cognit bia combin paramet learn data turn test select data ii cognit bia combin averag accuraci select data partit iii select cognit bia combin highest accuraci appli select train data test test partit return averag accuraci test partit figur cross valid algorithm cognit bia select algorithm greedi exhaust bia select algorithm differ method instanti step boldfac greedi bia select greedi bia select algorithm oper incorpor remain individu accuraci select data improv remain constant greedi approach bia select iter step ad bia iter bia combin iter determin step set initi includ individu varieti paramet recenc weight max wt recenc weight max wt combin recenc max wt combin recenc max wt subject access wt subject access wt restrict memori limit restrict memori limit bia set appli learn data test select data bia highest accuraci ad set select remain appli learn combin select bia pair set select procedur continu accuraci select data altern variat newli select bia remov set max wt bia recenc delet round bia select exhaust bia select exhaust bia select algorithm oper simpli test combin paramet set exhaust approach bia select instanti boldfac step gener bia select algorithm ffl initi set cognit paramet creat combin thereof ffl bia combin appli bia combin learn data test select data comparison greedi bia exhaust bia select make assumpt cognit bia method term comput time test cognit paramet set greedi bia select test set combin exhaust requir test nm combin merg bia greedi exhaust bia select algorithm requir systemat procedur merg produc individu accomplish incorpor bia relabel attribut incorpor modifi featur weight ad weight vector bia origin weight vector recenc subject incorpor discard featur restrict memori combin bia creat user specifi list appli problem paramet result rel pronoun disambigu section report result greedi exhaust bia select rel pronoun data set greedi bia select tabl show result appli greedi bia select algorithm rel pronoun disambigu task level cross valid partit tabl accuraci list select number partit combin select fairli uniform select cognit partit combin recenc bia select restrict memori bia select memori limit rang subject access bia select partit subject weight case accuraci creat greedi bia select significantli outperform baselin case default individu cognit significantli outperform combin recenc level tabl greedi bia select result tabl show select number cross valid partit bia select accuraci refer correct select number partit rec combo wt rm rec combo wt rm subj rec combo wt rm rec combo wt rm subj rec combo wt rm subj recenc max wt rec combo max wt subj wt rm limit exhaust bia select tabl show result appli exhaust bia select algorithm rel pronoun task fairli uniform select cognit select exhaust bia select combin recenc maximum weight restrict memori bia small memori limit subject access bia small subject weight accuraci creat exhaust bia select greedi bia exhaust bia select perform significantli baselin case default individu combin recenc level note compar accuraci cross violat train set size assumpt test differ cross valid result baselin singl bia experi test test differ perform compar greedi select algorithm tabl exhaust bia select result tabl show select number cross valid partit bia select accuraci refer correct select number partit rec combo rm subj rec combo rm subj rec combo rm subj recenc max wt rec combo max wt subj wt rm limit discuss summari result tabl summar result appli cognit bia approach featur set select rel pronoun task result divid categori baselin result individu bia result incorpor addit bia select algorithm tabl show perform learn algorithm steadili relev ad baselin note earlier statist gain recenc bia appli isol merg recenc gain perform respect baselin incorpor subject access restrict memori greedi exhaust bia select addit improv cognit bia incorpor result learn system perform significantli heurist closer result reveal perform incorpor subject access restrict memori combin recenc monoton version miss instanc combin recenc deep respect offic recenc field fight dai perform markedli combin recenc rel pronoun fairli long averag number featur case averag number featur case entir data set tabl bia select summari result boldfac respect baselin default heurist improv respect combin recenc baselin default rule baselin heurist individu bia recenc combin recenc recenc combin greedi bia select rec wt rm limit subj wt exhaust bia select rec wt rm limit subj wt restrict memori bia prune featur distant constitu learn algorithm concentr recent phrase case retriev syntact ambigu rel pronoun construct differ version combin recenc exampl govern publicli show recenc women prison statement da isra train middl group british recenc gave lesson student recommend person carri abduct select victim politician member recenc distinguish exampl show syntact difficult case semant difficult hard person provid consist inform presenc collect mass noun read rel order disambigu rel pronoun current case includ featur phrase rel make difficult handl type ambigu section show greedi exhaust search conjunct cross valid automat bia select experi greedi bia select adequ interact cognit suffici limit exhaust bia select perform slightli small gain perform greedi select worth run time lexic tag task section show cognit bia approach featur set select significantli improv perform learn rel pronoun disambigu heurist goal section demonstr gener approach appli method addit natur languag learn expand set cognit extens serv test robust cognit bia select algorithm handl unknown word natur languag learn task address problem encount nlp system reach unknown word context unknown word nlp system predict word part speech gener specif semant class task lexic tag task word unknown word nlp system receiv input sentenc inform extract gener concern children kill terrorist kill gener learn algorithm infer context part speech noun modifi learn algorithm entiti case secondari semant offic lexic tag data set simul disambigu unknown assum content word train unknown inform surround word sentenc lexic tag data set case rel pronoun data instanc creat automat circu parser repres context nlp system encount unknown word randomli select sentenc muc busi joint ventur corpu shown figur case featur twenti describ local context test word part speech semant class inform extract concept actual lexic item word window center unknown word data part speech concept type correspond entri semant class hierarchi defin joint ventur domain hierarchi experi gener semant featur specif semant featur case includ morpholog inform unknown word remain featur encod semant featur inform extract concept major syntact constitu direct recent recogn time unknown word encount case rel pronoun case reflect syntact semant inform circu process text note specif handl unknown treat predict task independ featur lexic tag task similar rel pronoun resolut main differ encod richer descript individu lexic item close proxim unknown word rel pronoun concentr differ reason current task lexic task structur attach featur lexic tag data set repres neighbor token neighbor recenc bia effect discard irrelev featur nlp system includ featur phrase recogn rel pronoun reli learn algorithm discard irrelev featur circu distinguish lexic structur attach modifi system includ addit featur result preprocess step inflat perform baselin case discard restrict memori bia natur languag learn respond readili number cognit good test bia select recogn relev problem hand incorpor semant syntact prime implement addit lexic tag semant syntact prime semant prime weight semant featur baselin implement encourag case retriev algorithm match semant ignor problem determin entiti semant featur relev current point process reli cognit implement syntact prime weight featur primarili syntact issu result lexic tag task experi investig recenc subject restrict semant syntact prime lexic tag task label bia applic data featur effect label respect unknown word appli recenc weight bia assum phrase featur toyota motor corp set direct joint ventur firm figur baselin instanc motor corp set joint ventur firm electr corp featur word window recent constitu featur assum recenc term unknown word featur featur token immedi unknown word featur token immedi unknown word featur token unknown word featur token unknown word experi emploi cross valid effect individu result lexic tag task cognit isol summar tabl tabl show result paramet set bia tabl show perform default heurist algorithm baselin case includ cognit default heurist select frequent occur class heurist perform weight random select base class frequenc unlik rel pronoun data baselin perform significantli default heurist approach work tag significantli outperform baselin rel pronoun recenc bia perform baselin system case data set spite fact baselin recent item cognit bia boost perform syntact predict significantli perform data set effect lexic tag task expect semant bia posit effect semant tag task term inform part speech import semant tag semant featur true gener semant class predict slightli lesser specif semant class predict direct relationship part speech semant class part semant class hierarchi correspond part speech individu bia result linguist point recenc weight correspond give preferenti statu featur lexic item closest unknown word consist success lexic tag approach hidden markov model classifi token base inform immedi token nlp problem chosen cross gener semant specif semant tabl incorpor individu cognit lexic tag task boldfac entri respect baselin perform shown cognit bia default rule test part speech gener semant specif semant class class default heurist default heurist baselin recenc weight semant prime syntact prime subject access restrict memori recenc max wt semant wt syntact wt subject wt restrict limit combin cognit tabl show result combin bia lexic tag task exhaust greedi bia select algorithm run full nest cross valid exhaust bia select larger data set fairli larg number paramet set approxim dai data set plan test set yield limit number paramet set chose limit number partit cross valid select paramet set singl test partit figur result tabl obtain outer partit partit result bia combin includ random compon restrict memori averag run tabl combin cognit lexic tag task boldfac entri respect baselin task baselin result greedi select exhaust select tabl show bia select algorithm provid perform respect baselin combin significantli improv perform recenc bia tabl show greedi bia select algorithm recenc recenc bia select lexic tag case partit semant tag task featur neighbor word critic lexic tag task restrict memori bia select semant tag task effect bia discard featur major constitu sentenc featur semant tag task gener semant tag prefer smaller context recenc bia addit weight primarili featur window center unknown word maximum recenc weight weight repres morpholog unknown word featur detail predict requir specif semant requir extend recenc weight context maximum weight tabl summari greedi bia select result learn show select number partit bia combin select natur languag task select number partit bia recenc weight max wt bia restrict memori limit bia recenc weight max wt bia bia recenc weight max wt bia recenc max wt semant wt syntact wt subject wt restrict limit analysi exhaust bia select result show similar recenc bia plai promin select recenc weight focu window gener semant class select recenc weight affect entir context specif semant class restrict memori bia select slightli higher memori limit chosen greedi algorithm major differ bia select exhaust approach includ greedi approach restrict memori bia select gener semant class tag fold select greedi algorithm syntact bia select tag fold rare select greedi algorithm syntact semant select fold gener semant class select fold specif semant tag result linguist knowledg sourc bia recenc bia import bia lexic tag task find greedi bia select algorithm select exhaust bia select algorithm discuss relat work natur languag learn tackl natur languag learn task rel pronoun resolut predict gener specif semant featur unknown word relat work task number empir method appli pronoun resolut resolut exist work rel pronoun resolut techniqu pronoun resolut gener oper applic set filter vari depend type pronoun goal avoid manual knowledg base construct altogeth heurist tune underli linguist knowledg sourc domain natur languag applic chang learn heurist pronoun resolut system develop avoid difficulti approach import natur languag understand task learn approach noun phrase resolut aon bennett mccarthi lehnert recast problem classif number standard induct learn algorithm phrase context learn algorithm classifi phrase respect refer object train set consist instanc pair refer train exampl correspond phrase exampl correspond phrase refer object exist machin learn approach resolut typic tree induct algorithm induct learn compon bennett mccarthi lehnert separ mechan decid phrase select learn algorithm refer method noun phrase resolut design primarili inform extract mccarthi resolv system aon bennett system oper text describ busi joint ventur focu involv organ approach learn heurist rel pronoun resolut requir test pair rel pronoun potenti noun phrase select refer step examin context rel pronoun gener problem broader task rel pronoun unclear approach rel pronoun resolut present successfulli extend gener task assumpt fairli local context suffici anaphora resolut quickli violat gener resolut work assign directli grow bodi work tag work present focu learn lexic inform unknown word gener consid difficult task learn algorithm evalu standard tag shown perform statist method daeleman al recent work semant featur acquisit charniak focu learn static semant lexicon dynam tag word incom text view slightli work semant class tag type disambigu task address empir number research yarowski bruce wieb disambigu disambigu occurr small set polysem word larg corpu work differ primari wai focu disambigu respect semant class hierarchi defin respect nlp task evalu small set evalu system abil assign semant featur word input text approach disambigu success lee test cognit bia approach featur set select lexic disambigu task structur disambigu task conjunct singl nlp system determin gener approach natur languag futur work includ appli method present addit natur languag learn problem varieti nlp system exploit exist result psycholinguist inform learn algorithm long hope comput model inform design psycholinguist experi approach model effect cognit process prefer cognit bia interact languag process task comput model increasingli aid select sentenc human studi present languag process studi featur select featur weight cbl featur select featur weight critic success learn research address problem previou work make cognit guid process algorithm approach visual global method comput singl weight vector case extrem local method comput weight vector pair train test case local scheme featur weight vari instanc featur featur method work featur vari import instanc space goldston local weight method learn differ metric stanfil waltz earli machin learn algorithm assign weight featur aha goldston associ weight vector train case combin global local comput featur weight greater similar test case train greater emphasi train case weight global weight algorithm featur relev vari train instanc rc algorithm domingo algorithm cluster method perform featur select assign continu featur weight learn system implement local featur weight scheme weight vari class level class distribut weight cardi comput weight vector class set train case statist properti subset data al featur import assign high weight featur highli correl class aha classifi calcul weight vector class al attempt learn featur weight cycl train instanc adjust valu weight strengthen featur valu match instanc weaken valu match instanc class method comput weight al produc similar metric test case recent investig featur weight base inform gain improv perform minor class instanc natur languag learn task present hasti tibshirani friedman comput metric reli discrimin analysi atkeson al creat similar metric test paradigm classif paradigm note cognit bia approach featur select featur weight creat similar metric global similar metric depend data set rel pronoun method comput similar measur base test select appli test case gener weight featur test case true lexic tag task data case number type attribut result similar metric deriv cognit bia approach global featur select weight case retriev test examin local similar metric base knowledg al skalak approach background knowledg form gener cognit process limit guid featur set select featur weight fisher cobweb system similar method introduc cobweb conceptu cluster system psycholog specif similar metric guid concept format creat multivari classif tree train case termin base predict store case system probabilist weight sort test effect assign weight path tree appli similar metric test case earlier work implement partial autom version cognit bia approach cobweb obtain similar result report global featur weight method comput weight base inform gain prove varieti natur languag process task daeleman al obtain excel result broad rang problem inform gain featur featur weight relat tree discard irrelev featur instanc idea simpli present train case input tree induct algorithm featur prune tree part case learn featur discard combin algorithm creat algorithm appli natur languag learn task earlier section drawback inform gain techniqu method work poorli data set inform gain discrimin featur encount problem complex featur interact exist adequ reflect inform gain comput situat case expand encod state inform increasingli sophist nlp system work poorli rel pronoun data set reason requir case case includ featur train set case larg number correspond constitu sentenc case deriv avenu futur work combin featur select method approach present advantag gener techniqu appli modif learn problem encod learn framework approach task cognit make languag process task port approach nlp system requir cognit reflect characterist success cognit bia featur weight algorithm abil bia select algorithm bia combin learn task comput complex task forc trade potenti loss accuraci speed evalu bia combin small number cross valid partit nest cross valid larger effect test full cross valid scheme execut note size data set studi limit effect futur work includ evalu cognit bia approach larger data set bia select previou work address role machin learn algorithm recent interest autom method evalu select survei articl gordon view bia select search space learn work cognit process limit type prior knowledg guid select bia learn algorithm cognit set primit defin space induct approach bia select greedi exhaust search conjunct cross valid procedur order search bia space search cross valid successfulli varieti problem machin learn greedi search appli problem featur set select caruana freitag john al skalak xu al forward select featur begin select individu featur instanc set subsequ featur select perform degrad backward select begin instanc subsequ featur select remov process continu perform degrad advantag featur select algorithm cognit bia approach add remov featur time feasibl task larg featur set advantag approach search occur featur smaller bia space major problem cognit bia select exhaust bia data set size number approach feasibl import line investig develop method identifi cognit bia interact priori bia combin test effect incorpor standard approach shortcut process lee provid substanti train time cross valid extens statist machin learn standard techniqu model select paramet set schaffer cross valid select sequenc increasingli prune tree cross valid emploi successfulli featur set select moor lee work differ previou work search cross valid bia select featur set select bia direct featur set select featur weight summari paper present techniqu featur set select learn linguist knowledg approach emploi cognit process prefer mechan guid featur set select appli method natur languag learn task explor effect cognit subject short term memori semant syntact prime shown cognit automat explicitli incorpor instanc natur languag learn task introduc algorithm cognit bia select algorithm combin cross valid greedi exhaust search select relev paramet set natur languag learn case reflect select cognit bia bia combin significantli outperform baselin case default heurist data set experi rel pronoun disambigu learn algorithm improv addit relev cognit incorpor instanc lexic tag select improv baselin spite fact number irrelev featur discard baselin preprocess step found greedi bia select work data set spite algorithm limit abil handl bia interact evid set compat cognit select learn task evalu cognit bia combin cognit bia approach featur set select offer possibl learn natur languag simplifi process design instanc individu natur languag learn task system develop safe includ baselin instanc featur knowledg sourc long obviat separ instanc linguist knowledg acquisit task cognit bia approach learn natur languag offer mechan explicitli combin frequenc inform techniqu linguist bia inform emploi tradit linguist approach natur languag process creat comput model cognit offer linguist psycholinguist insight rel import exist cognit linguist individu natur languag process phenomena acknowledg work support part nsf grant refer aha goldston concept learn flexibl weight fourteenth annual confer cognit scienc page indiana lawrenc erlbaum associ albert learn algorithm machin aon william bennett evalu autom manual acquisit anaphora resolut strategi annual meet page associ comput linguist approach learn shallow natur languag pattern annual meet acl page associ comput linguist schaal local weight learn artifici intellig van den bosch daeleman method sixth confer page utrecht research report bruce wieb disambigu model annual meet page silverstein domain knowledg influenc similar judgement reason page morgan kaufmann cardi cognit bia approach featur set select machin learn cardi improv minor class predict featur weight doug fourteenth intern confer machin page morgan san ca cardi lehnert cognit plausibl approach understand complic syntax ninth nation confer artifici page ca aaai press mit press cardi cognit guid featur set select fourteenth annual confer cognit scienc page indiana lawrenc erlbaum associ work note aaai workshop constrain learn prior san ca cardi approach knowledg acquisit sentenc analysi eleventh nation confer artifici page dc aaai press mit press cardi tree improv learn tenth intern confer machin page ma morgan kaufmann cardi knowledg acquisit conceptu sentenc analysi phd ma technic report cardi machin learn system natur languag gener framework stefan ellen gabriel statist approach learn natur languag lectur note artifici intellig page springer cardi empir method inform extract ai advantag mention spanish bulletin caruana freitag greedi attribut select cohen eleventh intern confer machin page rutger nj morgan kaufmann lewi evalu messag understand analysi messag confer comput lexic expect sentenc journal verbal learn verbal steedman led garden context psycholog syntax processor natur languag theoret page cambridg press waltz trade mip memori knowledg engin commun mitchel differ restrict late closur strategi spanish van den tree compress classif lazi learn algorithm artifici intellig van den zavrel forget except harm languag learn machin gilli acquisit approach comput gilli part speech tagger gener eva fourth workshop larg page acl carpent individu differ work memori read journal verbal learn verbal carpent individu differ integr inform sentenc journal domingo featur select lazi learner artifici intellig elman find structur time cognit fisher knowledg acquisit increment conceptu cluster machin fodor empti categori sentenc process languag cognit fodor model comprehend syntact strategi indiana linguist special routin human sentenc process mechan gb flore process page lawrenc erlbaum nj friedman flexibl metric nearest neighbor classif unpublish manuscript access sentenc advantag mention journal memori build access clausal advantag mention versu advantag recenc journal memori gibson pearlmutt analysi constraint attach clifton perspect sentenc page nj lawrenc erlbaum associ attach evid english spanish sixth annual sentenc process ma abstract sentenc process confer full manuscript journal gibson recenc prefer effect twelfth annual confer cognit scienc massachusett institut ma lawrenc erlbaum associ gibson comput theori human linguist memori limit process breakdown phd carnegi mellon gordon evalu select machin learn machin hasti tibshirani discrimin adapt nearest neighbor classif unpublish manuscript cardi examin local vari weight nearest neighbor algorithm leak reason research intern confer lectur note artifici page brown ri pfleger irrelev featur subset select problem cohen eleventh intern confer machin page rutger nj morgan kaufmann probabilist inform extract cardi confer empir method natur languag page associ comput linguist kimbal principl surfac structur natur languag king individu differ syntact role work memori journal memori kolodn reason morgan san ca algorithm anaphora resolut comput lehnert sundheim perform evalu text analysi technolog ai william descript circu system messag understand confer page san ca morgan kaufmann soderland descript circu system fourth messag understand confer page san ca morgan kaufmann goldman descript circu system messag understand confer page san ca morgan kaufmann lehnert sentenc exploit world barnden advanc connectionist neural comput page ablex nj syntact ambigu resolut lexic ambigu resolut clifton perspect sentenc page lawrenc erlbaum nj mccarthi lehnert tree resolut fourteenth intern confer artifici page miller magic number minu limit capac process inform psycholog moor lee effici algorithm minim cross valid error cohen eleventh intern confer machin page rutger nj morgan kaufmann messag understand confer morgan san ca fourth messag understand confer morgan san ca messag understand confer morgan san ca newport matur constraint languag learn cognit ng lee integr multipl knowledg sourc disambigu word approach annual meet page associ comput linguist nicol process sentenc phd massachusett institut ma quinlan learn effici classif procedur applic chess end game machin artifici intellig approach morgan san ca quinlan program machin learn morgan san ca riesbeck schank insid reason nj riloff lehnert inform extract basi text classif acm transact inform riloff approach build semant lexicon cardi confer empir method natur languag page associ comput linguist charniak statist semant lexicon construct annual meet acl page associ comput linguist schaffer avoid bia machin simmon yu acquisit grammar english comput simpson krueger select access mean sentenc context journal memori skalak repres case knowledg sourc appli local similar metric fourteenth annual confer cognit scienc page indiana lawrenc erlbaum associ skalak prototyp featur select sampl random mutat hill climb algorithm cohen eleventh intern confer machin page rutger nj morgan kaufmann stanfil waltz reason commun assign sentenc process languag structur process palo ca lexic access sentenc context effect journal verbal learn verbal dietterich approxim statist test compar classif learn algorithm neural carlson lexic structur depend journal psycholinguist role themat structur interpret languag cognit mohri review empir evalu method class lazi learn algorithm artifici intellig chang strategi featur select ninth intern confer pattern page ieee comput societi press yarowski disambigu statist model categori train larg corpora resolv pp attach ambigu learn workshop comput languag learn associ comput linguist
IR/302 5 fl kluwer academ boston manufactur netherland studi approach hypertext categor yime yang se slatteri rayid ghani school comput carnegi mellon pa technolog lab il abstract hypertext pose research challeng text classif html categori label distribut link meta data extract relat web site provid rich inform classifi hypertext document appropri repres inform automat learn statist pattern solv hypertext classif problem open question paper seek principl approach provid answer defin hypertext regular hold applic presenc significantli influenc optim design classifi hypertext dataset learn algorithm nearest order induct examin regular compar altern wai exploit result suggest naiv link treat word link neighborhood page local harm link neighborhood highli true classifi suffici robust discrimin inform word noisi evid result extract meta data relat web site extrem improv classif accuraci rel perform classifi test insight strength limit solv classif problem involv noisi web page hypertext machin web mine introduct size web expand good autom hypertext classif techniqu appar web billion page connect make task locat specif inform web increasingli difficult recent user studi show user prefer navig directori provid categor view retriev document enabl find relev inform shorter time common categori hierarchi navig support major web portal demonstr practic util hypertext categor autom hypertext classif pose research challeng rich inform hypertext document connect document html categori distribut link meta data extract relat web site provid rich inform hypertext tradit text classif research recent begun explor issu exploit rich hypertext inform autom classif chakrabarti al studi citat classif ibm patent citat document consid categori defin topic hierarchi similar experi small set web page page real hyperlink conduct categori label link neighbor test document reinforc categori obtain error compar baselin perform local text document test naiv link treat word link document local approach error rate system baselin perform al report similar observ collect onlin korean encyclopedia articl categori link neighbor test document reinforc classif obtain improv section baselin perform local text treat word link neighborhood document local word perform classifi link decid subset link document base cosin similar link document link low similar score filter process yield improv naiv link set web page webkb corpu studi anchor text word anchor text web page predict class target page point link repres target page anchor word link point headlin structur section link classif accuraci system improv compar baselin perform system local word target page slatteri webkb studi altern learn order induct learner exploit relat structur web hub author style exploit hyperlink topolog found combin algorithm perform joachim report studi webkb support vector machin kernel function kernel repres document base local kernel repres give evid combin kernel lead perform classif problem experi suggest kernel make categori label link neighborhood document compar local word document work summar initi insight exploit inform hypertext document autom question remain unansw anchor word improv classif accuraci furnkranz experi webkb link word perform chakrabarti experi ibm anchor word subset link happen furnkranz expand subset full set link chakrabarti al select subset specif html full differ data contribut report perform algorithm experi influenc result directli compar true result webkb corpu subset document categori answer question clear order draw gener hypertext systemat experi analysi potenti reason observ perform varianc step begin hypertext regular report systemat examin cross product data collect classif algorithm hypertext data provid direct data analysi support empir result classifi hypertext regular test lead generaliz observ methodolog experi present paper explor structur hypertext relat hypertext classif scope result present necessarili confin classif problem section hope analysi futur research hypertext classif provid idea type regular present hypertext corpora construct classifi advantag regular exploit pattern hypertext understand kind regular expect section present list simplest kind hypertext regular search expect content document classifi primari sourc inform list meant explor inform hypertext classif problem succinct definit regular tabl tabl definit regular classifi document class regular definit document neighbor class document exhibit pattern encyclopedia document neighbor class document class document neighbor class document share class preclassifi singl document point document class meta data relev text extract sourc extern web intern visibl document hypertext regular import awar hypertext corpora classif task place inform class label document document case document inform label case hurt classif perform hypertext classif extra inform improv perform classifi content document encyclopedia regular simplest regular hope find document class label link document class label expect find approxim regular corpu encyclopedia encyclopedia corpu encyclopedia articl gener refer articl topic similar regular neighbor document topic common articl current event link articl background event import realiz topic link document correspond class classif problem previou work found learn classifi home concept neighbor assign page found assign page part learn task label data variant regular relax requir neighbor document share topic case document neighbor document class share topic faculti home page link page describ research interest find classif previou work type regular partial regular type regular difficult exploit requir search subset neighbor document unseen topic common preclassifi regular encyclopedia regular topic neighbor regular hyperlink structur regular preval web consist singl document hyperlink document share topic leaf page topic hierarchi perfect regular topic page link correspond class classif call preclassifi effect creator document full hyperlink preclassifi document class meta data regular classif task practic commerci meta data extern sourc web exploit form addit featur exampl type meta data includ movi review movi onlin discuss board topic classif task stock market predict competit meta data implicitli present web document form text meta tag alt titl tag visibl view web page extract rich predict featur build classifi combin hyperlink textual inform hypertext classif approach depend regular hold hypertext classif task classifi design consid classifi search hypertext regular dataset examin consist hyperlink regular expect benefit hyperlink standard text classifi text document classifi perform baselin compar classifi hyperlink account test exist hyperlink regular substanti fraction hypertext classif task hyperlink regular exploit perform hope standard text classifi learner hyperlink regular led end perform simpl text classifi encyclopedia regular encyclopedia regular hold data augment text document text neighbor produc classif result word present document chakrabarti al appli approach patent found classif perform suggest patent structur regular regular augment document treat addit word separ vocabulari classif simpl prefix word link document tag chakrabarti al approach patent found perform suggest patent structur partial identifi link page topic similar page faculti home page section achiev comput similar document link document class cluster contrast previou approach standard text classif approach requir elabor algorithm algorithm foil algorithm section craven al appli foil webkb corpu found improv classif indic corpu kind regular base filter link neighbor al util regular preclassifi regular classif scheme corpu hyperlink text document find page hypertext properti search page repres page page link link page correl class reason learn algorithm recogn predict featur make classif success svm kernel function hyperlink joachim al illustr exploit regular paper show altern approach regular nb foil algorithm meta data regular extern sourc inform meta collect possibl inform extract techniqu featur relat classifi approach outlin extract featur similar fashion ident relat document text relat document wai inform sourc web entiti classifi meta data resourc avail qualiti resourc depend classif task cohen experi automat locat extract featur classif task meta titl tag inform html tag page technic meta data intern extern page tag field treat differ part sourc classif learn algorithm experi exist naiv knn foil naiv knn evalu text classif benchmark collect offer strong baselin comparison foil relat learner shown hypertext classif notat descript naiv set train document set train document class number train document number occurr number occurr document naiv naiv simpl effect text classif algorithm naiv defin underli gener model assum classifi class select class prior probabl gener creat word document draw multinomi distribut word specif class model assum word document gener independ class naiv form maximum posteriori estim probabl term label train data calcul frequenc term document class supplement laplac smooth avoid jv calcul prior probabl class frequenc document label train set classif time estim paramet appli rule word independ calcul posterior probabl class label test document probabl class arg max neighbor classif effect approach broad rang pattern recognit text classif problem contrast algorithm naiv explicit train phase test knn train document test document make classif document knn convent vector space repres document vector term distanc document measur cosin angl vector comput weight vector document convent scheme defin log log arbitrari test document knn classifi assign relev score candid categori set nearest neighbor document sort score candid obtain rank list categori test threshold rank obtain binari categori threshold assign document advantag disadvantag threshold strategi simplest strategi assign categori document flexibl recal threshold score section foil quinlan foil greedi cover algorithm learn horn induc begin empti tail search add liter cover neg instanc evalu function guid search measur foil text classif exploit word order hyperlink inform foil unari relat word word link relat hyperlink page foil distinguish inform word foil power recogn predict link page link common practic appli featur select document train reduc comput cost possibl improv effect relat hypertext straightforward word relat assign link page classifi home page search regular experi present document frequenc featur select foil experi paper run algorithm binari class problem test system comput score class pick match rule highest confid score learn binari classifi confid score base accuraci rule process result list score categori test threshold classif knn section simplest approach combin output foil elabor strategi dataset test approach hypertext dataset reflect properti hypertext classif task varieti problem gener regular previou section found hypertext classif problem classif compani web classif task web page hoover corpora compani web page assembl hoover onlin web resourc detail inform larg number compani reliabl sourc corpor inform ghani al obtain list url compani web custom crawler extract inform compani web site crawler visit compani web site search web page site breadth examin web page categori categori student faculti project staff categori categori logarithm scale figur categori distribut problem set categori hoover classif scheme class defin industri sector oil sport comput softwar fine grain classif scheme consist class categori label web page construct synthet page compani concaten page crawl compani ignor link page compani task dataset classif classif due granular categori applic figur show categori distribut problem previou work dataset extract meta data web site hoover provid inform compani competitor author construct kind wrapper simpl string matcher statist inform extract extract addit inform relationship compani web page compani mention web compani locat state countri result report experi competitor inform space limit result corpora consist synthet page vocabulari uniqu word remov stop word link compani link competitor compani classifi categori classif scheme dataset corpu webkb project cmu dataset assembl train intellig web crawler popul knowledg base fact extract directli web site comput scienc depart dataset consist page vocabulari uniqu word remov stop word link page corpu link figur show categori distribut figur show categori distribut problem compar page manual label depart depart class experi instanc popul class class assign document belong defin class interest empir valid conduct experi aim test perform algorithm section web page base discuss section note problem regular defin method perform interpret regular exist evid method suit make effect experi examin regular discuss section test knn foil web page dataset hypertext regular consid page word page link word add word link page applic tag word add word link page distinguish prefix tag word repres web page individu binari relat link applic nb link repres web page web page link ignor word web page knn html titl data html titl web page knn html meta data text found meta tag web page knn addit explor hoover competitor data competitor identifi compani repres compani origin web page result experi averag dataset split subset test data run remain subset train data run split train test set run classifi result tabl figur summar main perform classifi measur convent recal ratio number categori correctli assign system test document actual number relev pair test tabl result classifi result dataset shown bold nb knn foil nb knn foil nb knn foil page link word tag word html titl html meta link competitor tabl result classifi result dataset shown bold nb knn foil nb knn foil nb knn foil page link word tag word html titl html meta link competitor ratio number correctli assign categori total number assign categori measur defin balanc recal equal weight score comput individu averag categori global measur averag perform averag call altern count categori joint pool comput global valu global pool score tend domin perform system common score tend domin perform rare categori skew categori distribut provid type evalu score clearer pictur type dataset studi recal equal report score measur interchang valu discuss issu found text categor result report optim vocabulari size algorithm effect featur select categor perform classifi analyz section figur perform classifi gener observ made result experi perform classifi depend characterist inform encod document capabl classifi identifi regular document classifi perform hyperlink inform link tag word link compar page hoover knn nb suffer perform hyperlink inform foil perform significantli affect inform hyperlink document specif hypertext page page result difficulti task problem class prove difficult hoover nb knn roughli equal foil perform competit hoover dataset big contrast foil perform perform hoover dataset suggest foil robust stabl nb knn convent text categor foil tendenc overfit train design learn logic program interest foil classifi perform degrad dataset tag word page nb knn suffer hoover dataset due highli noisi hyperlink link word knn naiv result link word condit hoover set show perform suffer badli compar baselin clear dataset exhibit regular close dataset reveal hoover page link link link pair page belong categori mean hyperlink classifi perfect categori label link show improv perform classifi total page classifi dump word link document document link add tremend amount document perform knn nb link word suffer significantli hoover dataset design leverag relat inform gain improv tag word page page link link page link pair page belong categori mean perfect hyperlink classifi improv perform total page higher hoover dataset classifi improv result link word tag word page indic hyperlink dataset inform classifi potenti problem algorithm al exploit encyclopedia regular calcul likelihood document belong class multipli class probabl word web fraction neighbor class appli method hoover dataset result poor perform web page link neighbor class multipli low probabl likelihood score base page word result probabl categori candid document tag word tag word experi examin impact regular unlik previou result report chakrabarti al tag word neighbor separ affect find document result perform degrad baselin problem perform improv baselin problem interest observ tag word link word yield sever perform degrad nb knn hoover perform classifi explan tag link word featur select procedur remov irrelev link word leav learner data support hypothesi shown figur classifi weight link word differ word make classif note classifi handl perform good baselin ignor link inform suggest featur select method term weight scheme nb knn problem handl overcom train data foil result tag word partial regular slight improv result baselin foil small degrad contrast sever perform degrad nb indic small partial regular exist foil capabl exploit relat link link experi examin impact regular result show work surprisingli consist observ joachim al svm version worst choic hoover dataset figur show clear contrast regular hold strongli strong hoover dataset identifi link web page inform word link page classif provid inform hoover classif task meta data regular meta data report result competitor data treat competitor inform hyperlink meta data categori label link page class case preclassifi competitor find sharp boost perform encyclopedia word competitor word hyperlink neighbor yield equal perform boost report previou includ result competitor tabl figur competitor inform examin classifi hoover web includ local text page linkag page detail analysi reveal pair competitor share class higher hyperlink pair share class point note competitor hypertext smaller vocabulari size word competitor make effici train test classifi base competitor type meta includ text html meta titl field web result show inform classif task predict competitor page classifi hoover good link tag word dataset kind meta inform addit web page improv classif perform web page shown experi report previou perform analysi respect featur select recal result discuss optim vocabulari size featur select report perform classifi affect choic vocabulari size web page figur compar perform curv knn foil dataset space omit curv result similar nb perform curv page link word tag curv link word method treat word link page tag word definit find observ perform variat cross product classifi larger report featur select convent text perform curv classifi peak vocabulari shape curv show larger report knn observ exhibit stabl perform larg vocabulari size convent text perform degrad vocabulari size dataset highli noisi natur web page make featur select import perform optim hypertext classifi inconsist shape curv nb suggest potenti difficulti obtain stabl optim perform method highli noisi heterogen hypertext collect foil exhibit smaller perform varianc respect larger perform differ dataset switch measur measur addit evalu classifi singl point examin potenti make flexibl recal import classifi produc depend type applic address comparison deeper understand strength weak method hypertext classif figur show curv knn foil curv compar classifi present curv averag score classifi optim hoover tag word choic foil page choic knn nb tag word choic classifi curv gener threshold rank score candid categori test candid categori order rank test higher relev consid candid categori score order move threshold candid comput recal valu interpol result plot featur knn nb foil classifi page featur knn nb foil classifi page featur knn nb classifi link word featur knn nb classifi link word featur knn nb foil classifi tag word featur knn nb foil classifi tag word figur perform classifi respect featur select recal knn nb foil line knn foil recal knn nb foil line knn foil recal knn nb foil line knn foil recal knn nb foil line knn foil recal knn nb foil line knn foil recal knn nb foil line knn foil figur perform line shown graph recal equal valu typic optim interest observ graph ffl knn nb flexibl recal extrem evalu ffl foil curv exhibit larg perform varianc dataset curv competit knn measur difficulti result hoover task improv prune strategi rule foil invent richer score scheme potenti solut kind requir futur investig worth mention skew distribut perform largest class domin perform classifi system suffici sensit rare categori ffl perform curv classifi suggest intrigu potenti combin classifi classif system robust method similar question convent text categor hypertext mine solv hypertext categor requir futur research observ tabl averag run time cpu minut algorithm page link word tag word nb knn foil nb knn nb knn foil tabl show run time time cpu minut train experi link competitor classifi fast omit time page link word tag comput intens due larg vocabulari size tabl show time naiv experi run faster knn foil longer knn naiv conclud remark rich inform typic hypertext corpora make classif task significantli tradit text classif present examin address open question effect hypertext inform examin cross product explicitli defin hypertext regular altern multipl establish hypertext dataset differ classif algorithm systemat approach enabl explicitli analyz potenti reason observ perform varianc hypertext lead generaliz major find ffl identif hypertext regular data select hypertext domain crucial optim design classif system observ link inform word link word target word competitor inform altern explor hoover dataset observ suggest preclassifi regular strongli influenc learnabl problem problem exhibit meta data web page ffl choic hypertext problem crucial seldom obviou ad link word local improv classif accuraci dataset opposit effect perform nb knn hoover dataset consist report result chakrabarti al al link tag word equal inform classifi phenomenon observ experi hoover dataset extens experi domain show draw gener hypertext classif examin multipl dataset mislead ffl meta data web page web site extrem improv classif shown hoover classif task suggest import examin avail meta data real exploit inform extract techniqu autom acquisit meta data recogn html field hypertext page field jointli make classif improv classif evid experi ffl knn extend document combin link word meta data naiv show simpl effect wai exploit hypertext regular simplic algorithm scale larg featur strong perform hypertext dataset make suitabl choic gener baselin compar studi ffl algorithm autom discoveri relev part hypertext neighborhood edg naiv approach treat link link page distinct power discov relat gave mix result indic discoveri problem noisi natur link invit futur investig improv algorithm algorithm kind ffl understand result rel perform classifi special dataset categori distribut extrem skew investig tradeoff import order observ perform classifi specif region interest issu essenti hypertext applic high result extrem import scope result present necessarili confin hope analysi futur research hypertext classif defin explicit type regular present hypertext present systemat approach examin provid idea construct classifi advantag acknowledg author bryan improv evalu tool appli output thoma editori assist studi found part nation scienc foundat grant number note thorsten joachim provid intuit regular refer soumen byron piotr indyk enhanc hypertext categor hyperlink laura haa acm sigmod intern confer manag page june acm press chen st dumai bring order automat categor search result human factor comput william cohen learn classifi english text ilp method de advanc induct logic program io william cohen automat extract featur concept learn web seventeenth intern confer machin june william cohen yoram singer learn method text categor sigir annual intern acm sigir confer research develop inform slatteri learn construct knowledg base world wide web artifici mark sean kamal nigam learn web mine tenth european confer machin april dasarathi nearest neighbor nn pattern classif techniqu comput scienc seri ieee comput societi la dayn freitag multistrategi learn inform extract fifteenth intern confer machin page san morgan kaufmann johann furnkranz exploit structur inform text classif www david michael symposium intellig data number lectur note comput page springer de rayid rosi kamal sean slatteri data mine symbol knowledg extract web workshop text mine sixth acm sigkdd intern confer knowledg discoveri data rayid sean yime yang hypertext categor hyperlink pattern meta data eighteenth intern confer machin composit hypertext categor intern confer machin learn san morgan kaufmann thorsten joachim text categor support vector learn relev featur european confer machin learn page springer jon kleinberg authorit sourc hyperlink environ annual discret david lewi naiv independ assumpt inform retriev andrew mccallum kamal nigam comparison event model naiv text classif workshop learn text tech rep aaai press sung lee practic hypertext categor method link increment class inform twenti acm sigir page juli sung lee practic hypertext categor method link increment class inform twenti acm sigir page juli quinlan learn logic definit relat machin salton bucklei improv retriev perform relev feedback journal american societi inform slatteri craven combin statist relat method learn hypertext domain intern confer induct logic sean slatteri hypertext classif phd carnegi mellon sean slatteri tom mitchel discov test set regular relat domain seventeenth intern confer machin june cj van rijsbergen inform retriev yang expert effect effici learn human text categor retriev ann int acm sigir confer research develop inform retriev page yang evalu statist approach text categor journal inform yang jp pedersen compar studi featur select text categor jr fourteenth intern confer machin learn page morgan yime thoma thoma pierc combin multipl learn strategi effect cross valid seventeenth intern confer machin learn page
IR/303 5 analyz model web queri refin lau eric horvitz depart comput scienc usa theori adapt microsoft usa abstract discuss construct probabilist model center tempor pattern queri refin deriv larg corpu web search queri extract server log record popular internet search servic frame model task term pursu understand probabilist relationship tempor pattern inform class queri refin construct bayesian network predict search focu progress queri time review methodolog abstract tag user queri present kei statist queri queri inform describ user model captur dynam queri refin introduct evolut world wide web provid rich opportun gather analyz anonym log data gener user interact servic search engin lyco provid search servic crawl index larg portion web typic user enter string word search engin input field receiv html page list web document match user queri list includ hundr document web search engin rank list present result small group user follow return request addit refin resubmit queri review work develop model user search behavior log data motiv enhanc inform retriev develop model abil user inform goal describ probabilist model infer probabl distribut user goal data server log elucid probabilist relationship user goal tempor pattern queri refin activ contrast work maglio barrett studi user complet web interact search servic distinct work silverstein al report statist larg corpu unprocess log mine corpu provid inform refin goal queri describ initi data set methodolog transform data user behavior richer semant review set definit abstract queri class queri refin inform goal present kei statist corpu describ construct bayesian network model captur depend variabl interest server log corpu analyz data set deriv server log gener excit internet search engin server log data made research excit server log captur unspecifi portion queri excit search engin hour time period septemb entri initi log file record singl time queri global uniqu identifi uniqu identifi client search servic total size data set repres approxim million queri extract portion repres queri unprocess log data pie pie trac paul fan club column guid column show time queri made format remaind line user queri enrich semant server data server data limit show user interact excit search engin inform provid user select link offer search engin navig content search engin limit abil assess ultim success failur user find seek inform goal queri action infer inspect queri tag server log hand extend data set human interpret search action inform goal user assign queri refin class initi phase hand partit queri class repres search action infer refin strategi queri sequenc abstract search action set mutual refin refin class queri repres user intent rel prior queri refin class queri topic search user scope dataset queri topic previou seek gener inform previou queri queri topic previou seek specif inform previou queri queri topic view gener reformul prior queri queri topic search earlier user interrupt search topic request addit request set result queri search servic duplic queri data person request set result detail spencer blank log entri queri entri user click search button queri queri explain spencer remov blank queri origin set refin class includ interrupt found small proport queri sequenc user distinct goal interleav queri topic span studi introduc interrupt refin class captur type behavior annot note opportun autom assign refin class request addit result log duplic previou queri gener special identifi queri contract addit term boolean connect complet autom tag refin class opportun recogn subset refin manner assign inform goal phase annot data set classif queri term guess user goal creat broad ontolog fifteen inform goal support infer user review hit return excit queri carefulli examin queri made user implement editori tool assign inform goal editor access web page recommend version excit servic queri data set ontolog inform goal user includ current health product recreat adult scienc career scientif refer unabl classifi queri categori label queri unclassifi unclassifi queri includ queri queri nonexist web site short queri inform content queri difficult classifi small amount context editor unfamiliar queri topic review sequenc queri reveal natur queri queri classifi note cd session editor infer model number searcher product percent queri gen spec reform inter add blank refin class averag queri length gen spec reform inter add blank refin class figur distribut user queri behavior queri analyz fraction queri left axi graph averag queri length refin class queri length addit result refer activ queri result request mean harvest moon video furnitur septemb album music artist neil natur food ted hugh classifi harvest moon refer difficulti encount assign inform goal prospect fulli autom code process kei statist present fundament statist deriv data set explor tempor trend construct bayesian network user model user made averag queri standard deviat averag length queri word user averag distinct inform goal dai perform queri goal distribut queri length refin class graph figur displai probabl distribut queri queri refin class found action queri request addit inform user refin search reformul small number peopl interleav search topic interrupt class figur show breakdown queri length condit class queri refin special queri tend word type evidenc fact peopl tend add word queri order narrow scope search reformul queri tend longer initi queri result highlight opportun har queri length indic refin class queri percent queri curr ev peopl weather health busi adult categori career ref queri length curr ev peopl weather health busi adult career ref categori figur distribut inform goal tag data set relationship queri length inform goal queri distribut queri length inform goal analyz distribut inform goal tag corpu found largest categori product describ queri largest categori adult content cover queri smallest categori occupi percent queri explor influenc inform categori queri length compar averag queri length longest queri educ word current event shortest queri unclassifi categori shorter queri inform harder classifi inform goal tempor dynam queri behavior captur snapshot potenti complex process formul iter refin queri review work gener tag log data probe tempor pattern queri behavior interv refin action pursu understand relationship time process result search natur refin action approach examin pair adjac queri individu assign pair bucket repres time interv predefin discret rang shortest interv largest greater comput condit probabl queri refin class result analysi displai graph figur time probabl refin class sum probabl refin class reformul gener special addit result interrupt time queri figur relationship interv refin class discov distinct relationship time interv separ adjac queri action refin class success queri probabl queri issu interv grow probabl interv greater minut probabl request addit result previou queri greater approxim minut remain stabl interv greater minut probabl user special previou queri rise maximum hold steadi probabl begin diminish interv grow minut probabl gener small fraction probabl probabl grow interv peak minut interv diminish probabl reformul grow interv peak minut begin diminish dynam probabl altern action repres common behavior pattern larger amount time interact excit servic queri point user region internet provid desir inform path relev inform construct probabilist user model interest user web search behavior uncertainti led pursu construct gener probabilist depend model multipl observ includ time subsequ pattern queri length user prior probabl inform goal construct bayesian network model model data drawn tag excit log bayesian network direct acycl graph resent joint probabl distribut set random variabl horvitz pearl node bayesian network repres random variabl arc repres probabilist depend pair variabl user model applic benefit bayesian charniak goldman bayesian network plan horvitz barri jameson appli support util direct displai al horvitz al jameson user goal albrecht al model action game set bayesian network interv adjac action construct model model user search behavior consid probabilist relationship interv refin class adjac queri displai bayesian network figur relationship variabl user search repres adjac search time repres search repres action search servic arc repres assumpt current search action time interv influenc probabl distribut search action evidenc arc user search action time possibl current search action directli influenc delai interact servic state variabl model displai adjac node construct depend gener initi data set condit probabl tabl probabl state condit combin state node parent direct graph complet bayesian network har infer probabl distribut state variabl explicit set state variabl probabl comput state displai length bar adjac node repres network variabl figur displai infer probabl distribut time interv search action situat input inform queri perform explicit set variabl user search action state queri state probabl state probabl maximum likelihood delai action search servic minut action highest likelihood request addit result figur highlight abil make infer probabl action current queri delai action occur action occur minut queri input probabl infer action maximum likelihood action queri request addit page result extend user model inform goal extend introduc section introduc addit context form infer inform goal user interest predict power figur model repres depend user prior interv state variabl list probabl state captur length adjac bar probabl distribut search action time interv show implic set variabl user search action displai infer probabl search action case user queri perform search action minut includ context user goal feasibl infer inform goal search action interv inform portrai figur condit variabl model introduc section variabl search deriv condit probabl model tag data set figur consid specif case special earlier queri occur delai user action search servic set initi queri time interv state infer probabl distribut state variabl infer probabl distribut search action show explor addit result action addit special queri occur half likelihood trail gener reformul queri infer goal show special action impli user search diminish place figur show probabl distribut result singl gener action inform goal search product search action occur special result common pattern gener quickli gener result match result figur bayesian network condit adjac search action interv inform goal user probabilist implic special action probabilist implic perform gener opportun leverag model search dynam impress power bayesian network model identifi inform goal user time natur search action extrem limit observ activ model reveal inform distribut inform goal user gener simpli time queri knowledg statu user current queri time search action gener peak distribut type refin occur abil probabilist model predict user activ simpl observ time highlight opportun enhanc user search experi futur search servic leverag model assist user form queri search servic calcul probabl search action base length delai note search user perform action search servic conclud user desir reformul queri suggest altern queri synonym origin invok larger system target reformul queri feasibl detect adjac refin autom manner inform interv user inform goal probabilist user model mention section identifi refin class queri examin differ previou queri abil identifi user goal detect queri refin exploit varieti wai enhanc search user provid perspect inform goal entertain infer case displai figur arm search servic highlight link web page infer har search servic perform target review larg data set log inform captur interact user internet search servic ontolog creat classifi queri action inform review kei statist user web search activ explor pattern queri refin time review trend construct bayesian network demonstr power probabilist user model captur relationship dynam user search activ present illustr exampl bayesian network infer probabl user time delai user inform base partial evid statu search ongo work gener model complex tempor pattern activ explor varieti wai infer leverag enhanc search experi user pursuit specif inform larg unstructur corpora refer bayesian model plan recognit larg domain sixth intern confer user model bayesian model plan recognit artifici intellig onlin student model coach problem solv bayesian network sixth intern confer user model displai inform make eleventh confer uncertainti artifici san morgan kaufmann theori expert system artifici intellig intern journal approxim special issu uncertainti artifici intellig lumier bayesian user model infer goal softwar user fourteenth confer uncertainti artifici morgan kaufmann publish numer uncertainti manag user student overview system issu user model interact build model agent support web searcher user sixth intern springer wien york probabilist reason intellig network plausibl infer san morgan kaufmann publish analysi larg altavista queri log technic report digit system research palo ca person commun email correspond eric horvitz excit
ML/304 6 journal artifici intellig research submit publish plan synchron agent domain rune jensen manuela veloso comput scienc carnegi mellon pa usa abstract recent model check search techniqu shown effici applic plan plan approach order binari diagram encod plan domain finit automaton appli fast algorithm model check search solut effect scale provid plan complex plan domain interest address complex domain present plan framework domain introduc plan domain descript domain languag contribut explicit definit control agent uncontrol environ agent describ syntax semant show build effici descript plan system plan algorithm includ develop strong strong cyclic plan algorithm introduc optimist plan algorithm relax optim gener plausibl plan domain strong strong cyclic solut exist present empir result appli domain rang determinist environ action complex environ action shown rich effici plan system introduct classic plan involv automat gener action state space achiev specif goal state algorithm develop address search action algorithm classifi search space planner veloso planner research trend develop encod plan problem order adopt effici algorithm research lead develop plan survei weld class plan algorithm includ encod constrain stand planner stand agent domain languag ai access foundat morgan kaufmann publish reserv jensen veloso search encod plan problem satisfi problem fast model satisfact algorithm find solut planner mbp introduc encod plan domain finit automaton repres order binari diagram contrast previou mbp effect extend domain produc plan robust solut due scalabl underli model check search shown effici planner main research object develop plan system suitabl plan environ veloso stone plan origin develop appeal type environ plan set rule aim cover multipl situat environ plan execut interleav select action plan observ result effect world plan resembl outcom reinforc learn model captur uncertainti world plan precursor plan prior build assumpt model execut environ lead sound complet plan approach plan critic due potenti exponenti growth plan size number proposit defin domain state import contribut mbp repres plan worst grow exponenti number domain compact boolean case domain regular structur plan approach plan mbp specifi plan domain action descript languag ar translat limit plan problem finit state space transit relat automaton encod effici search techniqu develop model check mbp includ algorithm plan strong plan algorithm gener plan achiev goal outcom action strong solut algorithm fail strong cyclic plan algorithm return strong gener plan loop achiev cyclic execut eventu termin strong cyclic solut strong cyclic plan algorithm fail articl present plan multiag gener term precursor origin dean al contrast recurr approach replan recov execut failur plan plan includ plan algorithm approach design planner similar approach develop mbp main contribut effici encod front end domain descript agent domain resembl previou plan languag action descript languag ar mbp power action descript perform arithmet oper numer domain variabl domain synchron agent model introduc concurr action base decomposit domain introduc separ explicit environ model defin set uncontrol agent action part gener plan carefulli design effici contribut partit transit relat model check scale empir experi suggest case includ develop algorithm plan introduc plan algorithm relax optim gener plausibl plan domain strong strong cyclic solut exist articl organ section discuss previou approach plan domain section overview encod skip reader familiar subject section introduc show encod plan formal describ syntax semant descript languag term discuss properti languag base argu design choic section present domain descript section describ algorithm plan introduc optimist plan algorithm section present empir result plan rang determinist experi domain introduc power plant soccer plan problem section draw discuss direct futur work relat work recurr approach perform plan interleav parallel execut wide robot domain georgeff wilkin group planner suitabl recurr plan action selector base heurist search bonet algorithm smirnov gener suboptim plan domain search execut iter search base heurist goal distanc function provid specif problem asp algorithm similar approach defin heurist function action jensen veloso contrast asp assum robust action perturb action plan action chosen recurr approach incomplet act incomplet plan make goal unachiev precursor approach perform make prior execut gener complet plan effect action account reli complet model world uncertainti precursor approach includ condit blyth probabilist dean plan cimatti partial condit planner handl nondetermin construct condit plan account situat execut time determin part plan execut perform action includ plan test condit probabilist planner maxim probabl goal condit action probabilist effect drummond repres plan set situat control rule map situat action plan algorithm begin ad scr probabl execut path achiev goal continu ad scr probabl path end complet plan path account plan differ condit probabilist plan action state domain condit probabilist plan requir world access order execut plan plan introduc tree repres plan recent approach includ al cimatti al al repres plan set situat control rule algorithm increment add scr final plan similar drummond goal formula tempor logic hold valid sequenc action reinforc learn regard plan rl goal repres reward function markov process model domain precursor version mdp assum control polici maxim expect reward found prior execut polici repres explicitli tabl implicitli function neural rl probabilist domain complex domain planner expect planner handl domain larger state space rl rl produc polici higher qualiti plan gener planner recurr rl learn world model execut requir complet world model prior execut theori infinit execut exampl converg optim plan previou approach cimatti al explicit plan gener plan exponenti size plan number proposit defin domain state argu ginsberg compact implicit plan obtain necessarili grow exponenti regularli structur domain shown cimatti al domain enabl applic effici search algorithm model check capabl handl larg state space introduct order binari diagram canon boolean function linear order argument direct acycl graph termin node label set variabl node outgo edg function variabl node proposit variabl boolean function repres graph order path graph respect order variabl repres function shown figur assign argument determin path start root node iter high variabl low variabl true label reach termin node figur repres function high low edg drawn solid dot graph reduc distinct node variabl low high successor variabl node ident low high successor major effici boolean function number node smaller number truth assign variabl number node grow exponenti number commonli encount function reason oper boolean oper function low complex bound product node count jensen veloso figur reduct node variabl equal low high successor convert singl node node redund test variabl elimin disadvantag size repres function depend order variabl find optim variabl order conp problem illustr figur good heurist order locat relat variabl figur figur show effect variabl order express grow linearli number variabl exponenti growth illustr place relat variabl order good heurist successfulli appli model check model check behavior system model finit state automaton transit relat repres desir properti check manipul analyz state space system plan similar approach solv plan problem plan domain shown figur domain state assign boolean state variabl input denot action domain defin boolean variabl repres transit relat shown figur definit assign true iff action transit current state state note repres turn depend figur plan domain repres shown state defin boolean state variabl action input boolean variabl symbol transit relat shown set state action pair execut action lead goal symbol shown obtain transit relat restrict state assum state goal state kei gener plan achiev find state action pair reach execut set label figur find constrain true reduc shown figur result repres state current state variabl notat current state variabl chosen quot notat common notat model check jensen veloso logic perform oper obtain repres discuss properti base inform definit languag domain encod describ formal syntax semant domain descript consist definit state descript system environ specif initi goal condit set state variabl assign defin state space domain agent descript set action agent chang state world perform action assum execut synchron fix equal durat agent perform result action tupl joint action system agent model behavior agent control environ agent model uncontrol world valid domain descript requir system environ agent constrain disjoint set variabl action set state precondit effect formula intuit action constrain valu state variabl state access variabl execut order action precondit formula satisfi current state effect action defin effect formula satisfi state condit effect express refer current state state variabl part set constrain variabl action state variabl constrain action joint action maintain initi goal condit formula satisfi initi state final action restrict constrain variabl specif nondeterminist select environ action simpl domain descript shown figur domain describ plan problem domain domain state numer posit po rang proposit robot work robot system agent action action condit effect oper robot work true block posit block posit unchang babi environ agent action agent perform action joint action initi robot work assum robot assum hold block posit task lift posit variabl robot work made babi babi action constrain robot work effect express work plan variabl po bool robot work system robot robot work po po po po robot work po po po po environ babi work true work work initi po robot work goal po figur domain descript work robot work true current effect express robot work true state robot work current state action model aspect environ control robot case effect robot work robot work stai reflect robot spontan fix hit action environ repres domain shown figur calcul state po action show numer variabl updat arithmet express current state variabl updat express po oper demonstr advantag explicit refer current state state variabl effect express restrict enforc structur separ current state state express oper ad support complex condit effect effici natur repres set nest oper explicit constrain state variabl enabl determinist effect action constrain variabl assign state satisfi effect formula turn clear intuit action valu constrain variabl state jensen veloso true po figur domain figur proposit numer state robot work po joint action drawn solid dash state mark initi goal state compar action descript languag ar prior languag plan cimatti introduc explicit environ numer state variabl shown model domain model ar appendix concurr action assum synchron execut fix equal durat gener partial overlap action action durat requir complex tempor plan curri lever joint action resembl set action perform time step contrast model domain import issu address introduc concurr action effect simultan execut action common destruct effect action requir singl resourc action inconsist effect po po action perform concurr inconsist constrain overlap set state variabl condit due fact state knowledg express monoton logic repres inconsist knowledg condit address problem share resourc agent drink glass water condit defin interf agent simultan empti effect glass empti action consist condit action interf perform concurr current version avoid destruct effect includ wai repres construct effect simultan act agent construct effect illustr baral gelfond agent spill bowl lift lift hand kind effect repres plan explicitli state effect compound action similar approach support syntax descript ffl sv finit set state variabl finit set proposit finit set numer ffl nonempti set system agent ffl finit set environ agent ffl act set action descript set state variabl constrain precondit state formula set effect formula set form act ae sv form set form defin ffl agt act function map agent action action belong satisfi act ff agt ff ff ffl initi condit ffl goal condit valid domain requir action system agent independ action environ set constrain variabl action set formula form construct alphabet ffl finit set current state state sv ffl natur number ffl arithmet oper mod ffl relat oper ffl boolean oper jensen veloso ffl special symbol true comma set arithmet express construct numer state variabl arithmet express natur number arithmet express arithmet express arithmet arithmet express set formula form gener true formula proposit state variabl formula arithmet express relat formula usual mean oper usual prioriti associ oper lowest prioriti ae form subset formula refer current state variabl formula call state formula semant symbol alphabet formula usual mean oper abbrevi numer state variabl finit rang formal semant domain descript term definit finit automaton ffi set set input ffi state function construct express state function transit relat denot set boolean valu falseg characterist function set defin defin transit relat set tripl characterist function ffi set state equal set variabl assign input set joint action system agent repres characterist function set plan set fa jsj jsj jsj denot number element defin transit relat transit relat joint action system environ agent existenti quantif make action environ agent exist joint action environ agent combin joint action make true transit relat conjunct relat action current state state denot precondit formula effect formula defin defin constraint current state state joint action ensur action inconsist effect perform reduc pair action joint action inconsist effect state condit avoid concurr action frame relat ensur unconstrain variabl maintain denot set constrain variabl action nc ensur concurr action constrain overlap set variabl state condit avoid concurr denot set descript build repres transit relat domain descript defin set boolean variabl repres current state joint action input state section build transit relat joint action system environ agent input reduc transit relat joint action system agent input joint action input repres assum action identifi number perform agent ff defin action jensen veloso agent number express binari set boolean variabl ff repres action equal proposit state variabl repres singl boolean numer state variabl repres binari set boolean variabl jej jsj denot set boolean variabl repres joint action environ system agent denot kth boolean variabl repres state variabl sv current state boolean variabl order input variabl interleav boolean variabl current state state oe oe jej oe oe oe jsj oe oe oe oe oe oe vn oe vn oe oe mn vn oe mn vn number boolean variabl repres state variabl equal construct similar construct section repres logic express built standard arithmet express repres list defin binari number singl relat arithmet relat build defin constraint joint refer valu boolean variabl repres action function map agent ff boolean variabl repres action identifi action denot precondit effect formula action ff agt note logic oper denot oper repres frame relat similar ff agt set constrain variabl action express current state boolean variabl repres equal express evalu true repres true action constraint ff ff plan ff ff ff final repres transit relat conjunct action variabl environ agent existenti jej partit transit relat algorithm gener plan consist backward search state satisfi goal condit state satisfi initi condit empir studi model check shown complex oper kind algorithm find set visit state definit set state set state fs nonempti note state belong part assum set visit state repres express state variabl iter gener express state variabl monolith transit relat denot current state state denot substitut current state variabl state variabl set express consist state input pair state belong input transit state input repres plan domain set action plan domain element pair gener plan plan algorithm present section set pair refer pair associ state action perform state repres transit relat set visit state effici comput obtain perform existenti quantif state variabl earli calcul transit relat split conjunct partit modifi jensen veloso refer refer variabl refer variabl shown al comput time calcul convex function number partit reason number partit reduc total complex introduc larger number oper higher reduct complex oper logic express relat carefulli chosen consist conjunct subexpress refer small subset state variabl sort subexpress conjunct partit optim size satisfi requir plan algorithm describ prior algorithm plan discuss kind domain suitabl present algorithm call optimist plan suitabl domain cover prior algorithm plan algorithm discuss base iter calcul iter correspond parallel backward search start goal state end initi state includ set visit state figur main differ algorithm defin init goal figur illustr parallel backward search plan comput strong weak cimatti al introduc kind call strong weak strong defin definit set state strong set state fs ffi state belong strong set state exist action transit lead plan shown figur dot arrow figur denot state transit singl action set state gs shown state transit gs strong gs solid label transit state lead gs weak equal ordinari defin definit figur strong weak shown dash weak dash transit satisfi strong definit gs figur strong weak calcul solid denot strong dash denot weak action assum exist domain transit state belong weak strong drawn dash set goal state mark strong strong cyclic plan strong strong cyclic plan union rule found calcul cover set initi state defin section strong plan consid strong sequenc strong start set goal state set initi state strong plan succe return plan consist union rule calcul strong fail figur depict strong found weak found calcul strong plan succe set initi state cover set goal state gs strong plan complet respect strong solut strong plan exist plan problem strong plan algorithm return return jensen veloso solut exist strong plan optim due search strong plan fewest number step worst case return strong cyclic plan relax version strong consid weak strong cyclic plan find strong exist unabl find strong algorithm add weak prune remov state transit lead set visit state remain state ad add strong add weak repeat prune process figur shown sequenc calcul comput strong cyclic plan algorithm algorithm prefer strong ad strong strong exist weak prune state transit lead set visit state strong cyclic algorithm weak outgo mean sequenc weak termin algorithm return strong set initi state ad cover set initi state algorithm continu strong prune weak found case algorithm set visit state cover set initi state case algorithm strong cyclic plan progress goal strong part weak cycl occur ensur plan length assum transit lead weak part eventu algorithm complet respect strong strong solut exist strength limit strong strong cyclic plan import reason studi plan plan algorithm provid rule complet handl environ plan exist paint agent execut plan avoid paint corner reach strong plan strong cyclic plan algorithm contribut provid complet base algorithm plan domain avoid domain section depict figur plan repres set rule goal reach finit infinit number relev action lead interest gener plan system bad good state fail state assum action execut bring system bad state good environ action make system stai bad state chang fail state figur strong strong cyclic solut plan state reach initi state domain power studi section bad state good state fail state figur abstract descript system state limit strong strong cyclic plan inher algorithm domain illustr figur domain consist state action gs figur domain domain action solid dash illustr loss short plan length prefer strong solut gs initi goal strong cyclic algorithm return strong plan plan length strong cyclic plan exist prefer length cyclic solut higher probabl infinit length strong cyclic plan prefer return strong strong cyclic plan exist plan length ad dash action make solid action domain figur strong cyclic plan return strong cyclic plan interest plan goal achiev optimist plan analysi previou section show domain plan problem fulli relax algorithm includ plan return solut includ avoid introduc algorithm similar strong plan algorithm add ordinari iter properti rule lead ad call algorithm optimist jensen veloso gs figur domain domain action solid dash illustr loss short plan length prefer strong cyclic solut gs initi goal plan algorithm shown figur function return set rule visit state remov state includ set visit return set state prune rule includ optimist plan algorithm optimist plan algorithm incomplet respect strong procedur goal return optimist plan return figur optimist plan algorithm necessarili return strong exist optimist plan exist effect plan action lead strong plan effect plan action lead goal optimist plan substitut strong strong cyclic plan algorithm domain strong strong cyclic plan found goal achiev highest prioriti optimist plan choic domain goal achiev shortest plan includ plan domain section problem optimist solut make robot lift block posit block robot work reason goal achiev worthwhil plan domain strong strong cyclic optimist worst worst worst tabl plan length strong cyclic optimist plan domain figur mean solut exist plan length reach construct optimist plan kind domain altern plan similar optimist plan gener domain shown figur bad optimist plan associ action bring system good state step continu long environ system bad state strategi prevent environ bring system optimist solut domain shown figur optimist plan return plan domain plan shortest length compar strong cyclic solut cost domain plan infinit cost domain reach result strong optimist plan domain summar tabl empir result input descript specif plan algorithm descript convert set repres partit transit relat section set plan algorithm gener plan output plan sequenti plan depend plan algorithm plan repres defin domain state set joint action system agent execut synchron order achiev goal implement plan algorithm strong plan strong cyclic plan optimist plan classic determinist plan descript accept current implement includ logic oper arithmet oper implement remain oper straightforward part current work jensen veloso determinist plan view special case plan optimist plan algorithm backward search classic determinist plan strong strong cyclic algorithm algorithm behav similarli determinist featur determinist algorithm sequenti plan gener plan initi state iter ad action plan goal state reach determinist plan algorithm implement verifi perform compar classic planner intent develop fast classic plan algorithm di al main interest plan plan system implement packag manipul plan dynam variabl reorder facil packag find order variabl subsect present result obtain plan system domain rang determinist environ action complex environ action experi carri mhz pentium pc gbyte ram run red hat linux detail descript experi includ complet descript domain found jensen domain test perform domain solv mbp present power plant domain show result soccer domain domain test mbp domain solv mbp transport domain domain consist set locat set action fly move locat action drive action truck fuel fog cimatti defin domain exampl test mbp strong strong cyclic plan ran strong strong cyclic plan exampl solv similar result obtain mbp gener version hunter prei domain beam walk domain test mbp gener hunter prei domain detail make implement domain comparison problem beam walk domain agent walk end beam fall agent walk back end beam finit state machin domain shown figur edg denot outcom walk action agent walk action plan move step beam make fall locat beam true po figur beam walk domain encod beam walk domain proposit state variabl true agent beam numer state variabl po denot posit agent beam ground initi state goal state implement gener program descript beam walk domain produc domain posit domain state exploit partit transit relat monolith perform mbp shown figur discount mbp run slower perform mbp similar domain domain exploit partit expect solv larger problem mbp monolith comparison mbp research agenda power plant domain remain experi domain show plan result domain environ model featur power plant domain demonstr domain environ model exemplifi optimist plan consist heat turbin valv domain shown figur power plant domain control unit agent control action perform simultan environ consist singl agent time fail number heat exchang turbin ensur fail unit remain fail fail heat exchang leak water intern extern water loop close block action energi product reactor control fit demand reactor produc energi unit transport energi reactor plant heat exchang turbin work plant fail reactor pentium ii mbyte ram gener result mbp jensen veloso number beam locat mbp figur plan time mbp beam walk domain mbp data extract loss accuraci state space power plant divid disjoint bad fail state good goal power plant satisfi safeti activ requir safeti requir ensur energi transport fail unit shut energi transport plant heat exchang block fail turbin stop fail activ requir state energi product equal demand valv work turbin plan power product equal demand turbin valv open turbin bad plant satisfi safeti activ requir fail fail state heat exchang turbin fail plan task gener plan bad state good state end fail state assum unit fail obviou joint action environ fail number unit section bad state result joint action loop back bad state plant end fail state figur reason strong strong cyclic solut exist figur power plant domain reactor surround heat exchang heat exchang produc high pressur steam electr gener turbin fail heat exchang close block action bi fail turbin ti stop action si carri energi product reactor control fit demand turbin ti close valv vi variabl captur work statu unit optimist solut simpli ignor joint action loop back bad state lead fail state find solut problem calcul optimist plan assum unit fail execut joint action lead directli bad state good state optimist plan optim control shortest plan good jensen veloso state strategi exist avoid loop back bad state end fail state size state space power plant domain optimist solut gener node joint action extract plan bad state fail energi demand energi energi product unit extract time set joint action includ singl joint action chang true set soccer domain soccer domain demonstr domain elabor environ model power plant domain consist team player move grid world pass ball time step player move major direct pass ball team player task gener plan team appli score goal team possess ball simpl descript soccer domain model team possess ball system agent move pass ball independ player possess ball pass team player oppon team model set environ agent move major direct action handl ball goal plan player ball front oppon goal oppon goal area imposs gener strong plan cover initi state instanc initi state oppon locat goal area strong solut strong plan cover initi state defin state game plan score goal matter oppon player implement gener soccer domain field size number agent graph figur show plan time strong plan algorithm soccer domain locat player team plan time grow exponenti number player state space number joint action grow exponenti number agent investig complex introduc joint action construct version soccer domain singl system environ agent ran graph figur show dramat comput time obviou agent comput reduc number larger number state reach iter version power plant domain determinist found plan time power plant graph figur agent ad measur time extract action gener plan version player soccer domain joint action achiev goal shown figur extract plan plan number player power plant figur plan time gener strong plan soccer domain player team experi player singl system environ agent experi power plant graph show plan time determinist version power plant domain system agent figur plan execut sequenc state show hypothet attack base plan state attack extract nonempti set joint action plan joint action attack enter goal area ball time step matter oppon player determinist domain number experi carri determinist domain order verifi perform illustr gener plan versu jensen veloso plan compar run time result obtain competit domain result competit planner show plan determinist domain gener classic sequenti larg number classic sequenti plan plan competit domain plan system blackbox stan compet domain studi blackbox base stan planner heurist search approach base preprocess domain planner run mhz pentium pc mbyte ram equip linux gripper domain gripper domain consist room robot left gripper number ball move robot task move ball room room robot initi room state variabl encod domain posit robot posit ball posit robot posit ball left gripper problem number plan step optim plan grow linearli problem number problem number ball grow problem result experi shown tabl result planner competit graphic plan time tabl shown figur gener plan due parallel search algorithm depict figur avoid exponenti growth plan time competit planner partit transit relat planner capabl gener optim plan problem domain transit relat descript divid basic number ball discuss section optim number partit necessarili largest number partit result tabl partit consist conjunct basic partit compar monolith transit relat result obtain partit transit relat significantli larger problem memori usag problem partit transit relat limit mbyte problem monolith transit relat movi domain movi domain task movi set counter successfulli ran offici entri competit exact record machin disagr clock frequenc drew chair mhz long believ mhz stan perform mhz pentium competit plan problem part mono stan blackbox tabl gripper domain result column planner show plan time millisecond plan length part mono show plan time partit monolith transit partit transit relat column show number partit mean planner mbyte memori termin return solut result execut mbyte shown subgoal movi counter set problem movi domain differ number object type food number object linearli problem problem descript movi domain repres type food numer state variabl rang equal number object type food tabl show plan time competit planner movi domain problem experi remain experi default partit transit relat problem planner find optim solut competit planner low comput planner show comput time size state space encod logist domain logist domain consist airplan packag truck move locat citi airplan move airport locat citi task move packag specif locat problem differ number airplan truck logist domain problem problem solv planner competit tabl descript jensen veloso problem number part mono stan blackbox figur plan time competit planner gripper domain problem part mono show plan time partit monolith transit logist domain numer state variabl repres locat truck airplan treat special locat state space small problem fail solv problem domain succe gener transit relat fail finish calcul studi logist domain recent determinist plan logist domain hard plain size grow fast address develop abstract techniqu determinist plan problem solv abstract transit transit correspond set serializ action step abstract plan serial ordinari transit system solv complex competit logist problem obstacl domain obstacl domain construct demonstr gener plan consist grid world obstacl robot agent posit obstacl defin goal posit robot upper corner task robot move posit grid goal posit initi locat obstacl plan posit obstacl initi state specif initi state sequenti plan gener plan sequenti plan plan note plan problem stan blackbox tabl movi domain result tabl show run time millisecond planner mean planner mbyte memori termin return solut planner gener optim plan length mbyte problem domain plan obstacl includ plan obstacl locat note plan cover initi obstacl goal obstacl block robot plan obstacl domain obstacl gener node sequenti plan extract plan specif posit obstacl figur show extract time sequenti plan number step plan repres plan extract fast grow linearli plan length set action state plan extract comput conjunct section oper upper bound complex plan jensen veloso problem stan blackbox tabl logist domain result planner column show run time millisecond plan length mean planner mbyte memori termin return solut number plan step figur time extract sequenti plan plan obstacl domain obstacl obstacl domain comput fast execut robot meet low reaction time constraint futur work articl present plan plan domain express domain descript develop effici semant analyz previou plan algorithm plan deepen understand plan algorithm optimist plan algorithm find solut domain strong strong cyclic solut exist result obtain good perform compar fastest classic planner todai plan research drawn attent number open question address futur encod plan problem scale compar encod mbp mbp encod support partit transit encod properti monolith make choic system equal perform monolith beam walk give advantag domain partit transit relat defin interest question investig kind plan domain suitabl plan logist domain turn hard recent studi domain abstract techniqu solv logist problem competit current definit power extend enabl model construct effect section experi compar domain investig complex concurr action prodigi shown domain knowledg plan system order scale problem show search tree forward chain planner effici prune state goal formula tempor logic sequenc action lead goal goal includ knowledg domain tower block world built bottom similar approach reduc complex plan techniqu test tempor formula develop model check futur challeng includ introduc abstract plan defin special plan algorithm domain algorithm number agent solv acknowledg special paolo marco member irst group introduc mbp reward discuss plan model check randal edmund henrik lar advic issu formal anonym review comment greatli improv present articl work carri author visit carnegi mellon technic denmark research sponsor part advanc research project agenc air forc research laboratori agreement number view author interpret necessarili repres offici polici jensen veloso express advanc research project agenc air forc research laboratori govern appendix includ ar famili theorem domain descript ar exist domain descript semant ffi denot definit semant defin giunchiglia al domain descript semant equal construct domain fluent encod numer state variabl action element alphabet action input set constrain state variabl equal set state variabl precondit express defin set state outgo transit input effect condit conjunct condit effect condit effect state outgo transit input condit effect state characterist express characterist express set state ffi refer tempor logic control search forward chain planner direct ai pp iso press reason effect concurr action journal logic optim cooper knowledg sourc empir investig tech rep boe advanc technolog boe comput servic fast plan plan graph analysi artifici plan uncertainti dynam domain phd comput scienc carnegi mellon analog replai effici condit plan nation confer artifici intellig pp aaai press robust fast action select mechan plan nation confer artifici intellig pp aaai press algorithm boolean function manipul ieee transact plan symbol model check partit transit relat intern confer larg scale pp plan model procedur ar european confer plan lectur note artifici pp springerverlag automat gener plan domain nation confer artifici intellig pp aaai press strong plan domain model check intern confer artifici intellig plan system pp aaai press model check mit press automat verif concurr system tempor logic specif acm transact program languag open plan architectur artifici plan time constraint stochast domain artifici di plan model check determinist preliminari report intern confer artifici system applic pp situat control rule intern confer principl knowledg reason pp morgan kaufmann anytim synthet maxim probabl goal satisfact confer artifici pp aaai press approach plan incomplet inform intern confer principl knowledg reason approach applic theorem prove problem solv artifici jensen veloso integr plan react heterogen asynchron architectur control mobil robot nation confer artifici intellig pp aaai press repres action chang logic program journal logic reactiv reason plan nation confer artifici intellig pp morgan kaufmann bad idea ai repres indeterminaci ramif artifici action languag base causal preliminari report nation confer artifici intellig pp aaai press execut learn robot agent intern confer artifici intellig plan system pp aaai press admiss heurist optim plan intern confer artifici intellig plan system pp aaai press plan domain master technic depart autom abstract techniqu plan forthcom plan control rule reactiv agent artifici push proposit logic stochast search nation confer artifici intellig vol pp aaai press unifi plan intern joint confer artifici intellig vol pp morgan kaufmann extend plan graph adl subset european confer plan pp plan search domain intern joint confer artifici intellig pp morgan kaufmann plan architectur parallel action constraint lectur note artifici pp binari diagram packag tech rep institut inform technic denmark plan parallel action artifici domain independ planner compil knowledg engin acquisit bridg theori practic aaai technic report ai plan system competit artifici intellig magazin symbol model check kluwer academ publ partial order planner adl intern confer principl knowledg pp morgan kaufmann condit nonlinear plan intern confer artifici intellig plan system pp morgan kaufmann effici bdd algorithm fsm synthesi verif intern workshop logic synthesi plan reactiv robot unpredict environ intern joint confer artifici intellig pp morgan kaufmann effici explor thirteenth nation confer artifici intellig pp aaai press collabor adversari case studi robot soccer intern journal studi reinforc introduct mit press jensen veloso integr plan prodigi architectur journal theoret artifici plan learn analog reason monitor plan dynam environ intern confer artifici intellig plan system pp aaai press recent advanc ai plan artifici intellig plan react uncertain dynam environ journal theoret artifici
Agents/305 1 analisi de la antonio moreno departamento de sistema universidad de pau abstract el de lo su de kripk dan una para la logica agent son si lo de como del real una de en est se como se la de una forma el de lo est analisi primer paso la de la logica de de de del la logica de de son para de formal el el agent el para logica es el de lo est se en la idea de exist de en lo el agent en el agent en hai de son compat con el en el el agent del actual se representa con una el de con su lo ser el actual de con la en la de kripk est de lo el agent una es en todo lo el agent del actual ha su sin agent son ffl la son en todo lo ffl la de su si agent son en todo lo compat con el lo en todo el hai en son est el el agent ha de ser de su en el es ni de agent son ni de agent una de le ser ha han ya sea de forma sin de el de est es la de propon una una en est se como una de lo como se la de con analisi de la como la del agent se con es de lo en la logica el de de el modal de la formula de se formula una de modal el de lo de la logica el es el de lo han como del real en el si se la la se de la la de la forma habitu en est se el analisi al de solo agent logica ma se modal para agent el paso logica de en el se la formula de de de lo el son de la son en el de son en una es para se como de formula de sin de ser ni ni ha de la se como el agent como real ser una le al algo ha con lo ma imagin ser con de lo el analisi de la se propon en el de est lo de la logica el vision de lo ha en el una idea el sean sin hai de son como se lo de escher son de est de ver hai ma en la de la logica la de de es es como russel ma con su de lo la da shoham en el agent en el del agent de su el de la vista en el campo de la base de se una trivial de lo en ser el global de del agent se es de de de est como se en de ha han en el de en lo la logica se de la la ser formula ser en en en en con la de se lo de la logica el la es la de ya el agent de su ni ni en el de est se propon una forma de analisi de la del el de en el el agent se la de su en el como de su de su con el analisi de la la del analisi de la del agent se propon son ffl una dimens lo en la como de lo del ffl una dimens le al agent en el real le la de forma logica el de perri en la de se todo lo del del sin en la se son la ver la de en est solo se da una vision gener de la part logica se la entr la part logica la analisi de la en el analisi el agent su de de la actual el para el de lo con se el de formula defin da ffl formula en el modal bf boe ffl wg ffl formula formula de el modal pf oe ffl bf bf pf son el de formula defin de una como en se va la de kripk para la logica modal el agent una formula oe en oe en la lo con la de en la la de entr lo el de es constant est sean para la de la en el en el analisi si se va ser lo del agent como la de de el agent en su la es la se en en el analisi el agent una de de al ir su una de la de de lo la de la de de entr la de la del agent en el como de su de la de la del agent en el analisi se con se la del agent en el como se ha de formula de est se en bf pf como se ha bf pf el bf el agent la de la de kripk ffl bf es el el agent en en la de asi en la el con todo lo de la ff son de el agent una variant del de lo para el analisi de la el la del agent en formula el bf se ver de vista ffl como una de la del agent en ffl como una de todo la de ff en se la la representa la de la formula de su de la formula de la el agent la en el analisi con el de lo con una en su el oe en su el oe en la en la el en la oe en la tre formula ya lo se con es la de se de la se den lo se de solo de en el el solo una el de de la forma en el anterior se en la son lo tra la de la representa todo de el todo de la ff la de ff ffl ff de ff ffl ff de ff ffl ff de ff ffl ff de ff ni ni como se ver en la representa la de ff representa ff representa ff la de ff en en el de lo de la formula como en el de lo el agent todo de una formula su en la en el de est ya han de lo se la lo se del con lo se el de al en la part superior de la con el de la formula ha el la del han de ser lo de la ff ser solo una de lo de la ff en el se de de se representa con una una central en la part la formula en la formula en el interior la en en la la central en lo en se el en el es la formula en la en la ya es se en con la formula oeg en la el analisi de una formula en el de lo representa la de una de el de con la al el de la son la formula en la en el la de la de una ya formula en todo lo de la ff era una ant en todo lo de la ff de la el de la se en la el analisi con lo el agent la formula en de la forma ant el en la como en el de la de el de una de ma el de la de la de ff ffl ff de ff ffl ff de ff ffl ff de ff ffl ff de ff ni ni el representa la de ff representa ff representa ff tre de la la de como se en la lo al de la de en la del ya la de hai formula la de lo de la tre ya ya hai en lo lo est el final del analisi el agent en est control del el analisi se el de lo con como se ha en la anterior de de analisi tre de la formula en se una se permit la de si el agent en ya se de en la logica el ideal sin se una se del del la de son la ffl es una natur de al agent la de de se si una formula su le permit en su tre de el agent la tre de forma el analisi la de lo para dar ma una de la duda la ffl la de la del es una forma de el de formula ser el agent el de lo ya est depend del de del se forma de el es el de de el de est es la de la de la de la de agent en el como de su de su con el para se defin analisi de la con logica en est se ha la permit al agent su est analisi se el de lo de forma la de tre representa de la de la de correspond una de la del en el se la para en la logica el se la de en lo se la de del para al agent la de duda para el de la el agent en el analisi el del con el de de hintikka el el de con del el la el si una es para con son la en hintikka permit el de del en lo en es una de una formula en el una nombr en el de una subformula de una formula del el analisi en est al agent su la lo del analisi la idea de la entr lo analisi es le al agent para lo en el analisi si el el el agent su para refer mit logic logic journal philosoph logic pp framework logic explicit comput intellig pp cambridg awar limit proc ninth pp mit mose guid complet complex modal logic knowledg artifici intellig pp cornel world journal philosoph logic pp knowledg paradigm epistem ed pp logic pp interrog model inquiri gener theori argument commun vol pp etern golden basic book deduct model morgan san semant analysi modal logic normal modal proposit fur mathematisch logik und grundlagen mathematik pp reason knowledg artifici intellig pp logic implicit explicit pp pp belief fourth intern colloquium cognit kind model journal philosoph vol pp logic artifici intellig mathemat theori pp lifschitz academ springer reason ed pp epistem logic logic ed pp rs ff figur del sp sp sp figur analisi de ff rs sp ff ff ff ff sp sp sp sp figur de lo sp sp sp sp figur analisi de ff sp ff sp ff sp sp sp rs sp ff sp sp ff ff ff ff ff figur de lo
ML/306 6 comparison learn approach object recognit clutter background fourth asian confer comput vision januari danni peter comput vision activ percept laboratori dept numer analysi comput scienc royal institut technolog sweden abstract applic support vector machin object compar learn system develop columbia simpl imag match system nearest neighbor classifi set compar correct recognit rate segment object imag coil show perform simpl system compar elabor system set reduc number view train differ perform observ set realist task object recognit clutter background obtain perform system compar recent background train scheme appli major perform differ observ faster implement confirm stabl perform drop varieti comparison system drop perform lower object support vector learn introduct recent theoret framework comput learn statist learn base power learn algorithm call support vector machin theoret algorithm shown perform number hard pattern recognit task handwritten digit recognit algorithm demonstr good result object recognit task revisit object recognit svm reevalu result obtain compar learn approach order measur difficulti recognit task compar result simpl imag match algorithm nearest neighbor classifi order ass qualiti obtain compar result standard recognit system nayar columbia note system good eigenspac approach object recognit set experi perform set experi origin imag coil imag librari segment imag object investig recognit aspect aspect robust system number train view reduc note report train view object resp question difficulti learn task system perform compar simpl imag match perform experi raw order measur influenc input elementari versu aspect scale properti system perform total number object discrimin set experi make recognit task realist imag object segment object recognit clutter background test system varieti clutter test train scheme introduc earlier deal irrelev dimens input execut time comparison made system geometr construct fast implement svm recognit system support vector machin learn design system predefin system architectur system ad hoc control manual complex approxim function learn algorithm svm approach algorithm control complex system automat statist learn theori framework algorithm main author show learn system gener abil bound complex turn express dimens system svm minim system order minim gener principl call structur risk minim concret support vector machin work case pattern recognit minim implement search optim separ data vapnik prove maxim distanc closest point maxim effect minim refer literatur full train data found constrain order solv classic method lagrang multipli find saddl point lagrang multipli effici find saddl point dual formul dual solut quadrat program problem written linear combin defin support determin support vector correspond mention closest point linear svm gener svm map input featur space dimens search space comput map explicitli formul scalar product calcul input scalar product replac kernel realiz map implicitli separ function written input space sgn note kernel classifi data featur requir comput input space avoid note assum data separ method extend data found separ applic pattern recognit system obtain combin svm scheme construct machin number machin train classifi class class order classifi test competit machin perform analog tenni winner compet winner singl winner remain final winner determin class test data imag match recognit system system simpli store train imag order determin class test class store train imag smallest distanc test imag search classif method literatur refer nearest neighbor classifi refer system columbia recognit system system nayar columbia principl compon analysi step train order reduc data assum consecut train imag belong rotat quadrat spline fit data construct eigenspac object recogn search object spline closest imag recogn nearest neighbor classif summar columbia system consist pca spline refer note system capabl estim posit manifold exploit pose estim research system research construct addit system order analyz contribut compon columbia system spline research svm oper imag project construct eigenspac perform research svm oper sampl point obtain spline interpol perform note system differ system exchang nearest neighbor classifi obtain svm dataset coil imag librari columbia pictur dai object fig view consist color imag imag obtain place object turntabl view view consecut clip background rectangular bound box noisi background illumin normal figur object coil imag librari view train set case view object present experi perform raw object order estim influenc cue addit elementari creat refer describ detail imag call origin color imag pixel account individu input vector dimens averag color imag calcul averag valu fed system vector origin imag imag reduc grei result vector fed system system made softwar librari develop nayar columbia project eigenvector quadrat spline sampl point svm set earlier linear svm dimens input space higher number train exampl singl machin low input vector train svm kernel case gave result experi imag clutter background set repeat object recognit experi nayar vari number view present train number train view object vari note train view object report experi view plot perform contribut correct recognit rate remain view view system system perform surprisingli equal fig includ show perform case view object train result confirm result obtain columbia case lower system case perfect result case task easi view differ perform observ train view imag perform system system perform train view object system deterior slightli sharper system scale behavior behavior number object plot fig case view object present train note system perform linear number object discrimin good scale behavior predict system perform absolut perform similarli remark differ system pronounc svm report good perform primit case robust result obtain research system show result system experi imag clutter background set test system imag object clutter background report experi system train train imag previou experi train system system pair imag background fig method number train view object correct recognit rate unseen view shape color number train view object columbia shape color number train view object svm shape color figur perform behavior number train view object columbia system left system test input test result view present train plot set total object number object discrimin correct recognit rate unseen view shape color number object discrimin columbia shape color number object discrimin svm shape color figur perform behavior number object discrimin columbia system left result plot difficult set view object present train recent call train procedur train set train set doubl improv insensit learn system linear separ respect irrelev input dimens irrelev dimens recognit task background pixel system train refer note bw train method appli columbia system spline interpol system straightforwardli interpol distant bw pair point figur bw train train black white background view object imag background origin background imag coil imag librari part bound box background real noisi rest background consist uniform background test class clutter background background consist random object coil librari background object randomli scale upper part simul approxim effect perspect background background background background origin background background background background pure black background background background background pure white background background uniform background consist background pixel consist random pure rgb magenta exampl shown fig result set report result limit object train view object perform express correct classif unseen view object gener clutter background result plot fig note perform drop chang system figur exampl gener class clutter background test system left system bw stabl high perform varieti background achiev perform drop bw train give effect grei columbia svm figur perform class system bw train method system bw train method bad perform system bw train easili understood chang background destruct cue give train gener background bw train method cue learn system background linear separ maxim margin svm provid good train scheme system react favor bw fact expect bw train method origin formul learn system linear separ function observ detail system note perform class background train background black class give bad perform understood background distanc black white background risk observ detail error made opposit scene class system scene similar object make discrimin difficult background lead kind similar error incur time complex order compar execut speed previou experi clock sun workstat ultrasparc processor tabl time run complet program includ file time approxim train time svm long scale power number train imag order speedup svm svm train algorithm call geometr construct algorithm svm solv quadrat search svm simpler geometr fashion algorithm find optim solut faster scale number train exampl detail algorithm publish forthcom public test time system consid feasibl scale requir test time compon function number train imag compon function number test imag system scale linearli time number train imag sampl independ number object discrimin svm hand independ number train chosen scale time log number object class demonstr recognit segment object coil imag librari easi problem view present obtain perform simpl imag match system case view object present classif error emerg error ad domain knowledg system approach nayar columbia assum spline model rotat hand optim support vector machin approach advantag approach depend paramet compar columbia svm train time min min min min min test time imag ms tabl approxim execut time train test experi ii geometr construct algorithm svm test time bracket svm geometr implement columbia approach paramet model svm approach gener invari simpli chang train set learn algorithm incorpor knowledg invari case unseg object clutter system unstabl svm system train black white background train method remain stabl perform stai varieti system drop perform level note bw train scheme feasibl real set photograph object black background consecut white background faster system object recognit segment similar perform research note influenc pca assumpt spline perform svm approach problem confirm svm good constructor optim classifi predict statist learn theori columbia system start nearest neighbor classifi classifi lead inconsist learn process statist learn theori augment domain knowledg improv cost domain knowledg design improv system fix deterior invari dataset result obtain tend choic gener domain classifi care train method approach object recognit problem acknowledg mari research fellow support train mobil research grant european commiss support royal institut technolog refer object recognit algorithm realist proc int conf artifici neural network train algorithm optim margin ann workshop comput learn pittsburgh machin learn learn algorithm handwritten digit recognit proc int conf artifici neural network deal eigenspac proc comput vision pattern recognit learn recognit object int journal comput vision object recognit rep proc arpa imag understand san februari object imag librari rep dept comp columbia vector machin object ieee tran pattern analysi machin intellig linear support vector applic object recognit clutter proc workshop support vector machin int joint conf artifici intellig august report construct simpl fast svm learn forthcom report vector machin refer royal hollowai turk pentland eigenfac journal cognit neurosci statist learn seri adapt learn system signal commun john wilei
ML/307 6 system exploit case base reason techniqu deal problem retriev episod distribut set agent gestalt good case deriv summat paper deal issu involv learn exploit learn knowledg multiag system introduct case base reason attract attent recent paradigm wide varieti applic discuss issu pertain cooper retriev composit case distribut agent system system group intellig agent work set common global goal separ individu goal interact agent individu capabl achiev global goal goal interact lead coordin set agent due partial view problemsolv agent access part commun bandwidth limit heterogen limit view agent state agent commun negoti agent resolv uncertainti partial imperfect view global extent make posit contribut ongo problem solv process distribut reason system agent partial view result local result case term global measur rise agent cooper access case base retriev assembl good composit case lesser lander distribut learn nagendra prasad center strateg technolog research andersen consult road il discuss concept domain countri share border number agent transport load sourc border agent carri load destin sourc countri destin countri agent plan rout includ common sourc destin agent reli local case base path plan rout agent reach agreement common agent load agent rest paper organ section discuss distribut case base section introduc effici retriev algorithm distribut case base section present earli result conclud discuss implic mechan futur work final section distribut case base episod situat singl physic locat distribut set agent distribut case base system perform rote learn store success agent store local case give rise distribut case base agent set agent acquir independ experi particip team agent engin design case base give episod collect case agent design flexibl particip number agent system scenario envisag futur exist case base spread commun network queri satisfi case base composit case deriv case base mark mark redmond deal distribut case singl agent system case divid snippet snippet index global goal entir case local context snippet case kind elabor engin form index case piec global local problem solv context feasibl cbr system agent partial view global problem solv context intern context case piec case base individu agent built knowledg kind problem solv system particip veloso carbonel carbonel multipl case guid adapt process deriv plan case cover subset goal plan achiev goal discuss due dynam exchang inform resolv conflict explicit part work pu pu constraint satisfact techniqu adapt case featur deriv featur past case constraint adapt case chang featur valu satisfi unlik work present system singl agent system distribut constraint optim techniqu assembl case piec distribut multipl constraint optim paper adapt decid case put coher issu uniqu import import issu note fact true case individu agent deriv past combin case assembl episod system discuss import implic case integr requir episod complet repres distribut episod compon integr mutual consist retriev distribut case base introduc learn system call agent local case base contribut local case case case composit set compat local agent system agent set constraint repres requir present problem instanc context local case agent particip case constraint defin local variabl repres featur deriv partial case local case credibl cost measur repres case agent deliveri path sourc destin local case constraint local path match path measur local path distanc retriev distribut case base cast distribut constraint optim problem case compat local constraint particip agent case term credibl local case consist constraint knowledg agent gener requir context local usefulli particip search optim case central approach distribut system opportunist oa search algorithm retriev optim case distribut case base oa distribut version search modif merg partial search addit expand proof optim solut search straightforward extens search algorithm found agent execut algorithm shown figur agent execut retriev local satisfi constraint local featur retriev local valid set agent assembl case global accept satisfi constraint agent case term credibl agent case common find minimum distanc agent perform distribut search space partial case accomplish initi agent announc worst credibl local case set local valid case credibl measur form heurist estim credibl partial case sum credibl compon local case partial case sum worst credibl agent contribut compon partial case admiss estim estim credibl partial case singl iter loop oa agent announc credibl case agent collect partial case distribut merg partial case merg process agent involv check case compon partial case satisfi constraint agent featur partial case constraint violat merg succe search termin solut unlik search proce partial case expand extent credibl measur lower complet case found optim assembl case note oa complet distribut perform function distribut manner learn discuss distribut learn context domain introduc agent distribut planner distribut planner plan algorithm work agent find path sourc destin checkpoint agent search optim composit path oa algorithm distribut planner work agent retriev path past sourc destin close present sourc destin agent modifi local case connect gap present local case agent search optim composit path oa algorithm loop forev push append endif end loop figur opportunist algorithm learn system straightforward time planner local case optim path store respect agent planner invok agent find similar past case experi transport domain implement grid world experi grid countri occupi grid obstacl countri oa algorithm implement gener distribut constraint optim search mechan integr transport domain train instanc ran system system test instanc figur show result run system test instanc preliminari natur reveal effect system averag path length unit planner produc path averag length cpu time produc path averag planner margin optim plan boost effici find path grid experi small larger grid expect produc dramat result futur work contribut work fold identifi uniqu aspect reason system studi line make vast arrai tool develop deal monolith case bear system oa algorithm independ local path gener integr local path agent plan mechan form local path agent case agent search oa algorithm gener effici distribut search mechan deal procedur declar express constraint prasad number intuit learn deriv process work system prasad valid statist studi primari focu futur refer break case reason st janet morgan kaufmann san ca susan distribut search heterogen reusabl phd massachusett victor retrospect view distribut problem ieee man cybernet nagendra victor lesser susan reason retriev distribut case journal visual commun imag special issu digit nagendra learn distribut case forthcom tech center strateg technolog andersen il pearl pu lisa formal case adapt design intern confer artifici intellig design distribut case facilit multipl eighth nation confer artifici veloso jaim deriv analog autom case machin learn sum distanc time run number figur time path plan run path cost run number distribut search figur path cost plan instanc search appendix integr integr case snippet distribut multipl agent perform retriev composit distribut case piec distribut domain integr essenti case multiag system distribut case reason multipl agent jointli perform distribut search control agent cbr reason work peer agent form good case cbr cycl retriev adapt case agent agent cooper search case assembl addit integr empir evalu prioriti futur evalu task domain
DB/308 3 option lock integr oper transform distribut group editor sun school comput inform technolog griffith qld australia abstract lock standard techniqu tradit distribut comput system ensur data integr prohibit concurr conflict updat share data object oper transform innov techniqu invent groupwar research consist mainten group editor examin explor complementari role lock oper transform consist mainten option lock scheme integr oper transform maintain gener consist collabor environ integr option lock oper transform techniqu fulli highli capabl avoid lock overhead common case collabor edit oper consist group distribut comput introduct group editor group user view edit document time geograph site connect commun network oper transform innov techniqu invent consist mainten group editor lock standard techniqu tradit distribut comput system ensur data integr prohibit concurr conflict updat share data object lock appli group editor consist mainten common misconcept lock oper regard compet techniqu resolv type inconsist problem research consist mainten led realiz lock oper transform complementari techniqu capabl resolv inconsist problem proc acm symposium principl distribut examin explor complementari role lock oper integr lock transform techniqu consist mainten group editor rest paper organ section complementari role lock oper transform resolv inconsist problem examin option lock scheme section iii problem solut relat consist lock discuss section iv algorithm implement consist lock discuss section integr lock transform scheme compar altern lock scheme section vi paper conclud summari major contribut paper futur work ii complementari role lock oper transform examin complementari role lock oper transform maintain type consist context group text gener concern oper execut achiev origin result ident final concern data integr share document maintain respect specif applic context illustr inconsist scenario group edit session shown graph fig cooper site edit oper oper gener site oper gener site assum share document replic local storag cooper site oper execut local propag remot site execut arriv arrow graph repres propag oper local site remot site vertic line graph repres activ perform site site execut site site site time fig scenario group edit session assum initi document site text document edit oper illustr text document model sequenc refer end document primit edit insert string posit delet charact start posit gener inconsist problem gener inconsist problem oper transform approach resolv review role oper transform resolv inconsist problem explain lock resolv diverg oper arriv execut site result diverg final result shown fig oper scenario execut site site site oper commut case text final edit result ident cooper site diverg problem resolv oper ensur execut order properli transform oper produc ident result diverg independ edit oper refer data lock resolv problem granular lock prohibit concurr system illustr point scenario fig site initi lock region cover charact mean site delet charact insert charact site initi lock region cover charact insert charact posit region lock site delet charact posit region lock site insert charact posit region lock site document execut execut step site site execut document delet charact posit document arriv insert posit final document site execut document insert posit document gener final document site arriv execut document insert posit document insert posit final document clear occur step execut edit oper execut lock region prevent diverg happen final document state site causal violat cooper site gener broadcast oper oper arriv execut order natur order shown fig oper gener execut site edit effect share document user site time gener depend arriv site execut result undefin oper refer nonexist context creat user site observ effect observ report causal solv select delai execut oper enforc causal order execut base state vector timestamp causal violat relat order oper execut oper refer data lock resolv causal violat intent violat due concurr gener actual effect oper time execut origin intend effect oper time gener shown fig oper gener knowledg independ vice versa site execut document state chang execut subsequ execut refer incorrect posit document result edit effect defin edit effect achiev appli document state gener scenario oper execut site independ oper arriv delet charact posit origin delet effect violat origin intent oper execut final document state site serial protocol ensur site execut oper order ident ident result inconsist intent explain lock intent violat result prevent serial lock resolv intent violat problem point intent violat inconsist problem natur diverg problem essenti differ diverg intent violat resolv serial fix serial protocol oper execut origin form solut intent violat oper adjust oper paramet impact execut independ oper document execut transform oper preserv intent chang effect independ oper appli transform algorithm scenario transform independ oper site execut site result final document preserv intent oper ident document state site site delai lock unabl solv gener inconsist problem solut problem oper transform reader refer consist model properti oper transform approach support model inconsist problem gener inconsist inconsist resolv oper transform problem resolv lock share document preserv oper text english grammar error underlin text preserv assum user observ error correct user issu oper insert start posit user issu concurr oper insert end posit edit system oper transform techniqu ensur properti execut independ oper text preserv oper gener consist point result correct site document content intend effect oper achiev result incorrect context english grammar oper transform ensur plain string proper string make correct english sentenc inconsist gener automat resolv user addit control mechan user provid lock facil enforc mutual specif region english user obtain lock statement modifi final text preserv oper preserv oper appar ensur consist term english user time updat text lock resolv inconsist problem prevent concurr conflict oper perform region clear oper transform lock plai complementari role consist mainten group text oper transform achiev gener lock maintain data integr enforc mutual specif text region recognit complementari role motiv work integr lock oper transform maintain gener consist lock scheme integr oper transform techniqu iii option lock scheme exist lock scheme group editor classifi pessimist user permit edit region request lock optimist user permit edit region wait request lock lock request user continu edit region block lock request final user continu edit user wait lock undon repair inconsist concurr edit due optimist lock regard suit environ commun latenc high conflict rare exist lock scheme thing lock compulsori lock request explicitli updat region contrast exist lock lock scheme paper option user updat region necessarili request lock lock user updat lock region lock cover region multipl user edit common case collabor edit request lock avoid lock overhead inconsist provid properti preserv oper transform techniqu multipl user edit region document consist region requir mutual user lock updat user intrud unlock region updat user notifi conflict adjust action properli place lock repair inconsist manual undo facil option lock scheme reason approach intellig human user interact conflict human user capabl adjust action repair temporari inconsist conflict occur major advantag option lock scheme avoid lock overhead common case collabor edit option lock made highli shown section exist lock lock region option lock user interact interfac explicitli select region gener lock charact start posit unlock user interact interfac explicitli gener unlock charact start posit term lock oper lock unlock oper iv problem solut achiev consist lock major problem solut achiev consist lock group text editor discuss shown gener inconsist occur edit occur lock addit problem lock oper mix concurr sequenti edit oper illustr lock inconsist assum properti preserv edit oper mean oper transform techniqu lock assum execut immedi gener local site arriv remot site execut origin form diverg resolv share lock multipl lock oper gener concurr execut order final lock statu document site ident diverg problem occur concurr lock oper overlap region scenario fig lock region begin posit cover charact initi lock region begin posit cover charact brace text region repres lock region label identifi site length start posit region site execut result failur region lock lock issu user site execut result failur region lock lock issu user execut lock statu document site lock diverg problem resolv tradit base total order relat concurr overlap lock oper lock oper total execut successfulli kind scheme exist lock system group editor problem scheme user block distribut total order protocol decid lock oper success achiev good lock converg scheme base notion share concurr lock oper overlap share lock overlap region user hold share lock updat region share lock scheme concurr lock oper execut implement highli section appli share lock scheme previou execut document lock statu site mean site site permit updat site permit updat point share lock group editor share lock system process hold share lock read write lock data group human user share lock updat lock data share mode reason proper group editor lock intellig human user process mutual involv decid competit issu lock oper region gain updat conflict expect occur frequent collabor interact argu user provid facilit resolv lock oper user appli region unlock lock share lock belong user user conflict forc accept solut total share lock regard intermedi lock mode option lock option user updat unlock share group user updat region share lock singl user user updat lock region causal violat resolv timestamp lock oper execut causal edit problem occur scenario fig site execut document state arriv lock charact posit problem symptom natur causal violat problem edit resolv causal preserv scheme base state vector solut timestamp lock oper state vector execut lock oper satisfi condit edit oper properli suspend arriv execut site note timestamp preserv causal lock edit preserv intent lock discuss subsect intent violat resolv lock oper transform lock oper gener concurr edit actual effect lock oper time execut intend effect time gener scenario fig intend lock region begin posit cover charact insert charact posit begin delet charact posit site execut document arriv execut origin form document lock statu violat intent lock region cover gener delet charact posit fail charact lock site problem symptom natur problem edit resolv oper transform techniqu solut appli transform lock oper execut remot site lock oper transform concurr edit oper execut result document lock preserv intent point complic involv edit oper transform exist lock oper transform gener transform control algorithm invent control edit directli control lock oper transform addit transform function lock oper defin discuss section concurr overlap mix oper handl inconsist addit problem due mixtur concurr lock edit lock lock oper overlap region concurr edit oper effect system maintain concurr overlap lock edit scenario fig insert posit fall lock region cover execut document content lock scheme deal situat treat lock oper privileg edit oper prohibit execut concurr overlap edit oper prohibit execut site undon site edit oper fail due region overlap concurr lock oper altern scheme treat concurr lock edit oper equal accommod effect lock region expand shrink accommod effect concurr edit oper execut lock region expand cover charact insert document content lock statu advantag scheme implement oper transform techniqu addit undo scheme requir scheme scheme chosen accommod effect concurr overlap lock edit share lock scheme chosen accommod concurr overlap lock oper dynam lock region adjust lock oper region chang dynam due execut subsequ edit oper insert delet oper perform lock lock region expand shrink insert delet oper perform left side lock lock region shift left lock region adjust scheme adjust exist lock region execut edit oper current document lock statu gh wx user lock region document user site issu edit oper insert string posit region lock user execut edit lock region site expand cover lock region site shift lock region site remain shown gh wx lock region adjust execut oper region overlap exist lock region belong user exist lock region merg split region current document lock statu wx user site issu oper lock region start posit cover charact lock region oper overlap exist lock region user execut lock overlap region merg bigger lock statu document wx user site issu oper unlock subregion exist lock region belong user execut unlock big lock region split smaller lock statu document abcd wx note dynam lock region adjust lock system lock region repres start posit length adjust lock region respect edit oper essenti transform lock oper edit oper scheme system realiz function lock oper discuss section algorithm implement consist lock discuss implement consist lock base solut previou section data structur implement oper site maintain histori buffer track execut edit oper kei data structur site state vector track number execut oper site support option sv extend tract number execut lock oper execut lock oper sv element increment sv timestamp local oper propag remot site data structur call lock tabl introduc track execut lock oper site entri lt repres lock region belong singl user entri lt repres current lock statu document note share lock region express explicitli impli overlap region multipl entri belong user lock oper execut site oper finish manipul lt success execut lock oper add entri merg entri belong user bigger updat entri belong user case lock share lock success execut unlock oper remov entri split entri lt oper permiss check enforc lock lock edit oper pass permiss check execut permiss check reli inform save lt oper gener pass permiss defin algorithm permiss check oper local scan lt find fragment rang cover lock region user uf list uncov fragment uf permit execut scan lt check fragment uf overlap lock region user exist fragment permit execut permit execut case occur user lock lock region case occur user unlock region partial lock case occur user mistakenli lock region user permiss check oper execut immedi permiss check algorithm local local oper execut good oper arriv remot suspend execut transform edit oper hb invok transform function defin section control user lock region share user user order gain lock region algorithm defin transform oper execut remot oper valid execut share lock scheme section scheme handl concurr overlap mix oper section notifi user potenti conflict concurr remot oper check current entri lt overlap algorithm check similar algorithm differ remot oper permit execut remot oper detect overlap lock region user case algorithm lock region concurr lock oper remot oper pass permiss test local user involv notifi concurr overlap lock oper transform lock oper transform execut edit remot lock oper transform execut edit oper control algorithm edit oper lock oper lt transform newli execut edit control lock region adjust algorithm type transform function type transform function defin transform text edit oper transform function transform oper oper impact effect includ transform function transform impact effect exclud goto algorithm control transform lock appli transform lock oper edit oper hb defin transform function lock edit oper execut lock oper save hb chang content transform edit oper lock oper defin function transform lock oper edit oper transform strategi lock unlock oper essenti discuss lock oper transform function applic unlock oper basic transform strategi goto algorithm ensur pair input oper defin document gener strategi appli transform compar paramet determin relat oper assum execut find lock region document adjust paramet make comparison result impact assum execut facilit descript transform notat posit paramet oper length oper length string insert number charact delet number charact lock transform lock insert defin appli transform lock oper insert oper function return refer posit lock region cover execut impact paramet adjust made refer posit left lock region cover execut shift lock region posit paramet increment case insert posit fall lock region cover length paramet increment transform lock delet defin appli transform lock oper delet oper function return refer posit lock region cover execut impact paramet adjust made refer posit left lock region cover execut shift lock region left posit paramet decrement lock region overlap delet region case execut remov overlap region lock region special case lock region complet cover delet region length lock region reduc note reduc lock region length remov lock lt owner lock insert string lock extend lock region lock gener directli user interfac user protect string insert posit document vi comparison relat work varieti lock scheme maintain consist group text lock scheme lock scheme lock scheme lock scheme sophist lock scheme multipl granular compat mode lock exist system compulsori lock believ resolv gener inconsist problem group text editor discov lock unabl resolv gener inconsist problem gener inconsist problem resolv oper transform techniqu lock made option scheme oper transform ensur gener consist lock avoid conflict compar exist optimist lock scheme group option lock scheme regard step higher exist optimist lock scheme optimist user edit region obtain lock grant option lock scheme optimist user edit region request lock lock request grant conflict inconsist due conflict repair request lock region major advantag option lock scheme incur lock overhead common case collabor edit lock oper transform option lock scheme made highli research discov lock support oper transform ensur gener consist document lock statu extend oper transform techniqu resolv gener inconsist problem lock oper gener inconsist problem lock oper address exist lock scheme cost incorpor option lock scheme group editor minim addit data structur maintain lock statu document oper perform lt local algorithm special synchron messag maintain consist lt site edit lock oper transform execut basic oper transform infrastructur edit oper directli applic lock oper transform addit transform function defin transform lock oper vii examin complementari role lock oper transform consist option lock scheme maintain extend oper transform techniqu ensur gener consist edit lock oper group text editor integr lock transform techniqu uniqu maintain gener consist option lock scheme fulli highli capabl avoid lock overhead common case collabor edit option lock scheme incorpor reduc distribut unconstrain cooper system mean prototyp investig user issu relat option includ lock region select user user notifi failur conflict lock oper document lock statu present user work formal specif verif scheme algorithm present paper consist mainten fundament issu area distribut comput research group editor drawn inspir tradit distribut comput techniqu invent techniqu oper option address special issu collabor comput environ gener applic techniqu area distribut comput groupwar excit direct futur explor acknowledg author andi assist implement reduc system work report paper partial support arc research small grant larg grant refer concurr control recoveri rm iter design collabor write proc acm confer human factor comput pp april elli control groupwar proc acm sigmod confer manag issu cacm jan greenberg time groupwar distribut concurr control effect proc acm confer comput support cooper pp nov design toolkit support multipl group journal usenix vol pp spring lj gm share electron technic report concurr control framework collabor proc acm confer comput support cooper pp nov fine grain concurr proc acm confer organiz comput lock ensembl concurr graphic proc acm confer comput support cooper pp nov collabor proc acm confer user interfac system pp nov prakash framework undo action collabor acm transact captur causal distribut ieee feb approach concurr control undo group proc acm confer comput support cooper pp nov cooper edit acm transact march sun transform group proc acm confer cooper nov
HCI/309 4 metaphor comput support cooper learn distribut group gmd german nation research center inform technolog martin gmd german nation research center inform technolog jennif gmd german nation research center inform technolog gmd german nation research center inform technolog ralf steinmetz gmd german nation research center inform technolog discuss integr design comput support cooper learn environ common problem cscl achiev social orient group coordin construct share knowledg base respect guid metaphor link usabl requir appropri metaphor resolv virtual room support social learn protocol guid interact aim knowledg learn net repres social share knowledg metaphor virtual room origin work virtual space human comput learn protocol relat speech act learn net base model knowledg prototyp system implement virtual room metaphor present argu integr metaphor cognit sound achiev introduct imagin compani custom servic satisfact train distribut budget constraint meet compani recent establish connect individu provid multimedia includ conferenc facil train session place learn share experi problem comput expert engag provid connect comput network start learn exchang initi dialogu discuss veer transact cost domin issu learn environ tailor distribut particip inexperienc act coordin group guid metaphor design cooper learn discuss basic concept highlight featur prototyp construct cooper learn theori implement directli metaphor serv bridg gap theori design provid intuit access system user gener learn theori relev combin metaphor relat specif problem comput support cooper problem orient deal issu social role group coordin control goal direct interact multipl knowledg dynam repres access social share understand content domain present call open cooper distribut learn base metaphor virtual room support social metaphor learn protocol systemat coordin cooper learn metaphor learn net repres social share knowledg elabor discuss integr concept gener cooper learn environ metaphor virtual room defin cooper learn person commun motiv cooper respect common goal knowledg acquisit focu distribut learner switch synchron asynchron cooper problem particip metaphor speak virtual room provid easi understand analogu room real peopl situat room awar receiv inform share common view inform type room room boundari commun method commun deliv move room mean join learn adopt role deal content roseman virtual room base prototyp call vital teach develop implement vital member famili groupwar dolphin haak hol meet develop cooper author chip haak scope haak collabor work vital util virtual room central metaphor orient particip enter system call possess privat room consist document share function commun document manipul browser depict room particip log role locat room distinguish group room discuss auditorium room creat gener virtual room metaphor implement system roseman author virtual room mediat seamless transit style individu synchron asynchron enter virtual room automat constitut synchron session person room time particip invit share synchron mean move room room room independ hypermedia document learner asynchron work borrow document attach leav messag discuss cognit point virtual room support gener spatial social relat mental base notion spatial easili process human mind virtual room provid analogu everydai experi workplac map complex relat familiar spatial structur overcom difficulti structur hierarchi complex hypertext structur figur virtual world virtual auditorium vital prototyp metaphor learn protocol proper commun orient prerequisit effici cooper suffici empir studi show addit structur guidanc benefici learn real world peopl set schema script abelson coordin action prototyp learn activ script comput mechan guid learn provid appli theori speech act support group interact cooper learn process speech act utter perform action question understood speech act typic cooper learn action sequenc interact interact model collabor state set rule rule specifi role permit perform valid action result state transit haak learn collabor protocol adapt learn context focu cooper learn protocol typic episod cooper learn mutual explain script roughli person declar explan person explain issu person case explan case script end explan carri inform effort environ restrict miss social inform script profit systemat support effici instanti reinhard picard structur learn protocol effici natur technic role floor control carri free cognit factor occur natur commun detriment statu sex differ rhetor minim sketch explan protocol diagram state protocol start person problem enter state ignor transit lead state termin state request explan person transit state declar satisfi state revert back finish protocol satisfi state state activ automat link default node state altern depend type transit initi end transit higher level state activ problem unresolv normal finish ignor discuss unabl problem request explan satisfi explain respond queri understand interrupt question interrupt unsatisfi figur learn protocol explan implement protocol consist guid interact system user user initi simpli push button special templat control pass depend person adopt role explan process state defin specif function involv particip learn protocol forc option tool learn process basic gener protocol commun floor provid elementari individu learn protocol cooper learn protocol set mutual explan reciproc teach provis cooper learn protocol serv guidanc actual learn serv mean learn learn cooper workplac increasingli import work learn team repeat execut cooper protocol creat behavior script transfer collabor situat metaphor learn net common assumpt cognit scienc declar knowledg repres metaphor direct graph cognit type net repres structur pattern connect concept net educ set convei knowledg aim repres essenti structur social share knowledg dynam construct cooper learn process knowledg repres level enter intern creat extern import level call document space content domain map call learn net document concret inform learn net present evolv knowledg coher level social construct learn net serv provid conceptu skeleton tailor learn relat semant relat learn context goal topic case topic case definit figur concept relat learn net learn goal gener central node achiev topic topic problem understand special case present exampl treatment serv concept behavior topic introduc definit addit link learn net document node refer specif provid detail inform relat node learner orient gain share understand domain learn net dive document space link learn net evolv dynam construct provid view share knowledg group subject perman modif respect type knowledg net depict declar procedur knowledg obtain indirectli refer specif document instanti simul skill train program net cooper cooper refer start point initi learn protocol integr architectur metaphor integr featur architectur person room hypermedia document learn protocol learn net provid modifi activ refer access inhabit activ construct figur architectur particip inhabit virtual room specif function commun document manipul room librari hypermedia document particip creat prepar learn materi present auditorium learn protocol provid room activ inhabit demand support cooper learn process reciproc explan carri protocol support gener mainten common learn net learn net repres conceptu skeleton content learn construct cooper yield overview share knowledg function activ protocol click topic explan protocol activ expert automat learn net serv basi protocol select group exampl gener definit node net link specif document hypermedia text graphic node easili access summari metaphor individu serv flexibl structur learn metaphor complement creat efficaci cooper learn environ virtual room structur learn protocol structur learn share learn net structur common knowledg compon person inhabit virtual room creat hypermedia document commun implement vital elementari protocol realiz virtual room evalu recent seminar set preliminari result high accept benefici effect cooper situat aim full implement architectur futur variant learn protocol net scheme empir test major problem solv set concept relat learn strictli construct net control kind protocol user defin protocol learn net refer cooper learn individu knowledg acquisit resnick learn instruct essai honor robert glaser erlbaum pr common notat knowledg cognit learn hypertext room metaphor transit groupwar research report depart comput canada reinhard kooper lernen cooper comput base collabor structur techniqu acquir structur knowledg erlbaum imag mind harvard press haak isp intern confer concurr engin research metaphor virtual room cooper learn environ clear konomi cooper build integr organ architectur springer abelson understand erlbaum art practic learn organ idea argument travel activ space associ comput haak hol integr meet support local remot desktop environ associ comput chapel haak flexibl support busi extend cooper hypermedia process support inform softwar technolog group discuss effect make group organiz behavior human process perspect design cooper work associ comput acknowledg author daniel valuabl comment earlier draft paper
DB/310 3 algebra compress framework queri result chen praveen seshadri cornel abstract applic emerg environ requir sql queri result intermedi result ship client analysi present client low bandwidth connect sever memori restrict compress result queri effici transfer access paper explor varieti techniqu address issu present framework repres form primit compress oper present optim algorithm valid compress plan optim plan factor influenc choic includ statist semant inform queri result queri adapt demonstr techniqu averag result greater compress standard tool introduct applic architectur server run queri store data queri result ship hierarchi transform resid desktop palmtop comput appli compress result sql queri olap queri result move client readi visual client download queri result slow connect wireless network mobil comput client download larg queri result offlin emerg class palmtop storag memori sever constrain palmpilot iii ram applic data data client hold effici transfer memori queri result compress recent research demonstr function sql queri requir partial result ship server client slightli motiv underli research semant cach expect result queri cach client paper motiv abil compress queri result enhanc function perform applic summari contribut data compress appli index structur work compress techniqu queri evalu activ typic restrict intern system exist research data compress compress algorithm specif data type text issu make appli compress gener compress method work larg chunk data applic access data small piec dbm maintain type requir combin compress method singl method choic combin obviou compress decompress cpu intens import client research make analyz sql queri demonstr semant statist comput queri process queri underli tabl identifi compress opportun present algebra framework repres compress entir queri result combin method defin primit compress compress plan sequenc compress oper demonstr implement compress plan result significantli greater averag compress ratio standard compress method appli compress plan modifi version queri benchmark report result compress ratio present decompress experi handheld devic show lightweight plan inform queri result improv perform choic compress plan requir analog queri optim present exhaust algorithm compress plan good faster heurist algorithm summari relat work number research consid compress method text multimedia data method roughli divid statist dictionari method statist method includ huffman encod arithmet encod dictionari method includ survei compress method found relat work compress develop algorithm applic exist techniqu storag layer discuss page level offset encod index numer data tupl differenti algorithm present attribut level arithmet present research dealt compress scientif statist commerci iq compress techniqu similar compress method storag layer research investig effect compress perform system discuss benefit data compress long queri process perform benchmark compress present research complementari work focu compress queri result leav dbm research directli address topic relat research area mobil work cach data replic data manag transact process focu compress queri result ship handheld devic compress method data compress method intend leverag data compress compress method normal group normal compress method store tabl normal elimin data redund queri involv foreign kei result unnorm assum tabl primari kei foreign kei function depend assum run queri select distinct valu tupl result store valu time distinct store reduc redund normal result ab ac valu store time simpl normal techniqu problem valu attribut valu store join result data sort lh function effici normal algorithm partit tabl equal partit store match valu physic normal tabl redund occupi fewer figur show procedur compress decompress sort normal figur applic normal method group compress method function util similar compress techniqu data sort group duplic attribut valu record match valu tupl tupl tupl compress decompress attribut queri result group method appli sort attribut cost standard compress method present list standard method paper method detail algorithm explan found list specif system implement finit number compress work assum finit list descript differenti encod comput differ adjac valu column offset encod encod offset base null suppress omit lead byte numer valu lead end space string adapt dictionari encod fix dictionari encod data adapt dictionari encod huffman assign fewer bit repres frequent charact arithmet encod repres string interv probabl charact tabl standard compress method compress method appli compress techniqu compress result queri drawback entir data set decompress order access individu record defeat compress case palmtop semant statist knowledg queri tabl consist type data reason singl compress method ideal tabl face issu multipl compress method consist effici discuss consist issu section valid compress effici issu section good compress plan rest motiv work demonstr inform effect accomplish high compress ratio queri result sourc inform compress system acquir inform result queri semant queri statist comput queri optim techniqu histogram sampl maintain inform statist semant inform catalog select sum revenu order group order revenu revenu illustr semant statist inform select phone revenu order date ship date year revenu part deliv month order date includ revenu rang underli mb scale benchmark inform individu entir relat individu rang rang encod offset lower bound rang determin rang valu statist comput queri optim queri process rang offset encod appli limit rang valu revenu larger smaller schema revenu digit point ascii form revenu requir bit numer charact ascii format condit encod month valu dai valu byte assum queri result obtain statist inform queri process make simplifi estim queri optim decid compress strategi queri process approach valid number distinct dictionari compress inform maintain catalog attribut index queri optim comput similar estim attribut intermedi result charact distribut inform string encod method queri optim catalog semant constraint catalog hold charact digit huffman encod encod charact bit inform constrain differ month compress bit month differ bit dai function function depend attribut opportun normal fd inform catalog attribut trivial fd fd opportun normal compress level entir order tupl produc depend group compress natur suggest order defin physic order provid inform normal group compress method data sort fd normal field perform improv motiv rest present quantit effect queri result compress compress result sql queri combin method discuss form suitabl appendix plan plan individu tupl attribut valu decompress plan extend plan appli column relat gain addit entir relat decompress access tupl attribut plan differ plan normal method section lead lower level compress compar plan file level requir entir relat decompress present compress ratio result size divid compress result compress decompress throughput result size compress decompress experi run machin mhz processor mb ram strategi plan plan plan compress ratio compress throughput decompress throughput tabl comparison compress compress decompress throughput plan achiev higher compress ratio lower compress cost plan client decompress tupl attribut decompress file compress ratio high inform queri result compress decompress throughput lower overhead involv combin multipl decompress method plan show care decompress achiev compress ratio plan show normal plai import role compress method queri result view queri result compress context system assum pc client commun server kb modem access queri result combin decompress transmiss time assum simpli add time comput cost compress requir requir plan requir plan requir time queri result compress present algebra framework repres composit compress strategi relat produc result queri execut framework compress relat call compress granul set compress defin output cg singl input cg compress plan form sequenc oper semant algebra compress plan view uncompress relat result set tupl assum tupl uniqu tupl identifi rang attribut valu uniqu identifi jth attribut tupl identifi tupl compress granul set cg set compress repres attribut uncompress relat assum granul granul identifi refer access refer granul compress set attribut granul map set granul granul identifi attribut granul term meta inform data type compress decompress method appli granul gener individu attribut addit inform decompress method figur show cg left attribut output appli normal compress fd field field granul granul identifi granul compress data integ data decompress method addit inform fd field field figur compress cg normal fd field field base defin granular cg definit granular binari relat attribut valu granul tupl attribut iff attribut regular cg definit cg arbitrari expect data column compress homogen manner defin regular cg cg granular partit relat vertic partit defin disjoint set column attribut field set belong granul group horizont partit defin disjoint set row divid granul group individu granul figur granul field regular granul group ident definit regular granular field predic tupl attribut iff true repres vertic partit defin horizont partit granular group figur form rest discuss assum granular regular granul granul group cg share data type compress common store granul store group group group input cg output cg field tupl granul group group compress group repres compress schema compress schema hold inform field granular group field common data type granul field sequenc compress oper execut field decompress method sequenc compress oper notion compress field compress schema cg figur normal normal null definit partial order regular granular granular iff partial order correspond intuit notion coarser theorem attribut granul granul coarser cg proof straightforward omit reason space compress algebra definit compress algebra express defin cg unari algebra oper appli singl algebra express result compress algebra express cg express valid oper compat input cg defin section compress algebra oper compress oper defin map input cg output cg properti oper reason granul granul scope partit input granul data partit input granul collect repres output granul output cg granular defin complet term input cg granular granul scope figur granul scope normal oper refer partit input granul defin granul scope output refer scope defin set input granul compress partit output output granul figur refer scope includ granul directli comput compress output granul granul check condit input granul defin granul scope refer granul compress defin procedur gener compress output granul base input granul granul refer granul refer consist compress function compress exist inform deriv refer function expect input data type gener output output data type specif output type figur compress method normal oper data type input fd field field decompress compress method specif ident base oper output cg easili defin term input defin output granular base granul scope granular field compress oper unchang compress updat data type field compress oper output data type compress add oper tail oper sequenc compress field type check algebra express compress schema cg algebra gener valid express appli oper cg constraint input data type compress method data type input granul granul minim access access part attribut decompress assum decompress granul compress granul scope includ input granul theorem granul scope coarser granular input granul refer granul includ plan execut intend treat compress algebra express compress plan direct actual compress queri result provid oper semant plan execut result queri plan execut cg gener serial execut plan execut produc result consid plan sequenc oper due space focu compress phase compress plan decompress phase dual compress phase refrain term strong analog serial execut serial execut execut oper initi queri result relat trivial cg oper execut gener output act input oper pipelin serial execut reduc storag intermedi pipelin execut oper plan pipelin oper process chunk input granul time chunk call pipelin unit output oper access input granul parallel execut order oper plan exchang figur plan produc offset encod normal normal offset encod input granul oper intersect input refer granul exist partial order similar conflict concurr control compress plan sequenc total order oper consist partial order total order oper consist partial order compress plan partial order inform parallel execut plan partit oper layer layer consist oper partial order oper higher layer edg lower layer replac oper layer parallel oper parallel oper execut oper layer simultan combin output back singl cg figur oper layer execut parallel section demonstr effect compress plan semant statist inform compar tradit compress method compar plan optim network transmiss minim data size run decompress code handheld devic explor realist decompress cost compress plan manual construct deriv intuit plan guid choic heurist optim algorithm compress code implement top cornel predat ordbm server run pentium ii mhz processor mb ram layer layer parallel oper parallel oper plan optim network transmiss set queri realist larg result size accomplish adapt queri benchmark justifi choic queri benchmark characterist wide rang support applic queri includ group make result size small mention environ aggreg analysi perform local client server adapt queri remov group aggreg data benchmark data type decim charact charact distribut string field field easi compress goal set experi minim compress size queri result assum compress oper granul refer scope manual optim plan similar normal group method method appli field level compress method offset huffman encod appli field oper appli field combin achiev greater compress oper refer scope appli field expect similar valu field field size mb averag result size mb tupl byte field averag figur show result adapt queri queri statist semant inform improv compress ratio plan averag compress ratio tabl tabl show achiev averag compress ratio plan achiev figur compress ratio plan result adapt tpcd queri axi queri axi compress ratio averag cr higher figur show rel improv cr plan cr eleven cr improv improv queri improv compress ratio queri improv result field addit plan outperform queri queri larg string valu gener base uniform distribut achiev compress form substanti proport data figur show compress decompress cost plan tabl show averag compress throughput price pai higher compress achiev avg compress throughput avg decompress throughput plan tabl ratio ratio figur compress ratio improv plan axi queri axi compress ratio figur comparison compress decompress throughput plan vertic axi throughput plan decompress handheld devic contrast assumpt previou handheld client devic run experi run window ce mip processor mb ram persist data storag mb program queri result size make larg store compress assum client random access feasibl decompress entir result initi step store result compress form decompress data access window ce default compress persist storag kb page compress plan meet explor redund window ce compress method explor handheld devic slow processor limit batteri power compar behavior plan present section plan present section exclud normal plan plan decompress plan inform queri result plan plan empti default compress plan page level tabl show storag usag persist program time randomli access tupl result averag tupl size byte plan plan plan plan storag mb mb mb mb access time tabl plan improv storag usag explor redund window ce method plan plan space window ce compress method knowledg queri consid window ce compress method access time empti plan lightweight method decompress plan plan space access time result show lightweight plan explor knowledg queri result improv perform handheld devic compress plan optim gener valid compress plan minim overhead maxim benefit compress input optim algorithm includ network cpu inform queri client resourc client access pattern present exhaust ineffici discuss cost estim present polynomi heurist algorithm base intuit deriv result algorithm simpl construct plan add oper exist plan oper algorithm start empti plan repeatedli plan ad oper exist stop plan gener evalu cost plan return minim cost plan algorithm exhaust halt number granul scope refer scope limit total number plan finit finit number valid oper combin granul scope refer includ oper algorithm plan round stop plan gener simpl set oper partial order plan plan consid algorithm effici check valid sequenc compress oper field oper compress field combin oper valid sequenc number combin lower bound total search space assum lower bound cost estim cost plan equal compress overhead minu compress benefit compress overhead compress cost decompress cost compress benefit defin save network transfer save client side storag formula fit goal optim minim transit cost minim client side cost weight compress decompress cost compress cost oper includ cpu cost cost cpu cost depend cpu compress input data size cost includ cost read input write save plan pipelin unit held memori compress method requir extra cost compress data normal requir sort input pai extra cost serial execut compress cost equal sum cost oper plan execut cost equal sum cost parallel consist cost simultan execut oper layer overhead combin output decompress cost depend compress plan client access pattern result client decompress queri result section decompress cost cost decompress result comput ad cost individu oper client store result compress form random access unit decompress cost equal cost decompress granul access unit time client sequenti access assum client cach decompress unit cost reduc cost decompress granul attribut access compress benefit compress benefit includ save network transmiss storag save transmiss transmiss cost uncompress result compress result transmiss cost equal function result depend network properti save storag depend random access decompress requir save save uncompress result size compress result size uncompress size granul access time extra program memori decompress comput compress result size base compress uncompress result inform averag attribut size number attribut detail specif method omit reason space make accur estim algorithm order reduc search deriv heurist experi section appli method inform queri result gener method inform valid uncompress data gener method enhanc compress explor redund captur semant statist inform explor repetit byte group normal explor repetit attribut valu local optim oper inform queri result compress overhead benefit plan sum overhead benefit individu field combin plan optim field low cost global plan gener compress prefer oper granul scope refer scope oper granul refer scope similar column column client appli decompress random access granul scope close granular reduc unnecessari decompress cost pipelin compress server granul scope finer pipelin unit access input granul unit gener prefer coarser refer scope inform collect enhanc compress heurist algorithm method inform queri result appli algorithm valid combin oper compress field inform queri result minim cost plan field combin plan global oper individu plan partial order combin plan includ union partial order individu plan partial order oper plan plan type check gener method field method base inform field compress charact distribut arithmet huffman encod choic method favor granul scope refer scope heurist granul scope coarser granular output cg global plan gener step add chosen oper global plan gener step accept oper reduc cost result plan final plan compress cg figur client handheld devic decompress result demand random access client download result slow network care result size compress method offset requir plan pipelin unit bigger page field normal offset offset encod offset encod assum offset minim plan field offset encod minim plan field global plan plan offset encod offset encod offset encod normal field inform client random access granular field refer scope granul scope field field client granul scope finer page level heurist refer scope file level heurist client oper reject shown refer scope small expect work final plan plan similar plan section client oper accept refer scope improv compress shown final plan similar plan section assum number field valid combin oper inform queri cost step cost step algorithm cost plan gener similar plan experi futur work paper address issu compress queri result make present framework model compress strategi framework model compress plan sequenc compress oper similar spirit relat queri plan describ semant statist inform queri compress result present experi queri adapt benchmark show handcraft compress plan achiev improv compress ratio standard compress present experi handheld devic act client demonstr import lightweight compress plan environ present heurist optim algorithm queri plan varieti requir heurist algorithm reflect intuit handcraft plan open research problem identifi explor experi shown potenti benefit compress plan base framework deriv intuit handcraft plan heurist plan optim algorithm fulli implement test compress plan optim optim algorithm evalu significantli broad cost formula tune ad featur extens predat system interest idea blur boundari queri process compress process perform compress oper perform queri compress improv acknowledg work cornel jaguar project fund part ibm faculti develop award microsoft research grant praveen contract rome air forc lab grant nation scienc foundat refer murrai order preserv compress proc ieee conf data page data compress scientif statist ieee tran softwar eng octob ti cach strategi mobil larg journal decemb ubiquit acm comput cormack data compress system dec bori antonio hong va cach manag mobil design evalu icd shaul michael divesh michael semant data cach replac vldb margaret vijai locat depend data manag mobil ninth intern workshop expert system ravi le toggl transact manag techniqu mobil acm cikm intern confer inform knowledg novemb shoshani techniqu larg statist data base page code method text string search compress inform graef option physic septemb shaft compress relat index proc ieee conf data graef shapiro data compress perform proc symp appli kansa april andrea access mobil environ expert system intern septemb huffman method construct code proc peter sequenti sampl procedur queri size estim prasad data replic mobil comput iyer data compress support proc conf larg page sept nick kenneth torsten optim histogram qualiti vldb lynch applic data compress larg bibliographi data base vldb susan pano program view mobil client ninth intern workshop expert system august complex finit sequenc ieee transact inform algorithm sequenti data compress ieee transact inform tobia praveen seshadri queri extens accept cv compress techniqu larg statist ieee tran knowledg data yanni peter eugen improv histogram select estim rang predic object model seamless transit heterogen mobil environ ninth intern workshop expert system adapt transact consist mobil environ ninth intern workshop expert system roth van horn compress acm sigmod seshadri perform enhanc tool advanc data manag intern confer manag data india david data complet refer sever guid compress inform leonard graef data adt perform portland state iq white paper html transact process perform council tpc tpc benchmark standard specif transact process perform council hartmut multipl mobil agent distribut transact ifci intern confer cooper inform august wagner index design ibm system ta welch high perform data compress comm acm june till donald guido moerkott implement perform compress neal arithmet code data compress commun june appendix compress plan method field normal offset encod null suppress string attribut string attribut dictionari dictionari bit encod charact includ byte encod month dai byte encod differ encod ascii form float revenu
HCI/311 4 track cyclic human motion dept comput scienc stanford ca black dept comput scienc brown box ri royal institut technolog sweden abstract hasti dept statist stanford ca present method learn track human motion video estim statist model typic activ larg set period human motion data segment data automat princip compon cycl comput algorithm account miss inform enforc smooth transit cycl learn tempor model prior probabl distribut human motion framework track human subject complex monocular video sequenc recov motion introduct model track human motion video import problem vari video sport interact human bodi approxim collect articul limb motion thought collect describ joint angl evolv time kei challeng model joint angl involv suitabl tempor primit case repetit human motion motion sequenc natur sequenc present set tool carri segment automat ratio data align refer domain procedur princip compon individu cycl refer domain statist model technic di culti includ miss inform motion necess enforc smooth transit di erent cycl deal develop iter method function princip compon analysi learn tempor model prior probabl distribut human motion bayesian framework track detail track framework brie summar speci posterior distribut unknown motion paramet repres discret set sampl propag time particl ltere prior distribut base pca improv cienci particl lter constrain sampl region paramet space result algorithm track human subject monocular video sequenc recov motion pose complex unknown background previou work model human motion recognit activ hidden markov model linear dynam vector quantiz summari relat approach typic provid approxim underli motion explicit tempor curv joint motion deriv biometr studi learn data previou work princip compon analysi motion motion curv activ typic align paper detail autom method segment data individu align activ di erent model statist variat deal miss enforc smooth transit deriv probabilist model suitabl bayesian interpret focu cyclic motion simpl import class human activ bayesian method track human motion suggest prior inform obtain function pca prove ectiv determin human bodi posit learn train data provid commerci motion captur system describ evolut angl period frame refer result multivari notat denot angl measur ti denot length sequenc index individu angl motion sequenc train set note miss observ occur frequent bodi marker occlud motion captur set ft posit valid data sequenc align period motion repetit constitut natur unit statist model identi ed train data prior build model avoid manual segment present align procedur segment data automat separ estim sum figur ratio repres set angl function candid period length align walk sequenc length rel set paramet sequenc cycl length comput search maxim variat data explain measur signal intens figur individu ratio subset angl accumul ratio function rang note peak valu optim cycl length note ratio white seri rst row approxim warrant approach estim set align multipl motion sequenc common domain speci shift motion sequenc minim deviat common prototyp model analog exhaust search optim set combin suggest iter initi set valu step de ne refer signal ra step minim deviat respect align data refer signal period constrain regress spline ensur smooth transit boundari cycl set sequenc minim predict error respect refer signal contrast exhaust oper requir pn comparison solut rst iter construct improv refer signal current set signal turn improv set estim repeat obtain iter optim algorithm termin improv fall threshold step predict algorithm converg monoton figur show walk align procedur cycl obtain origin sequenc domain dont provid formal de nition function pca align procedur segment train data collect call comput princip compon major sourc variat data algorithm ki cycl length mark miss valu end set time seri ki ti index set seri comput function estim domain resampl data refer imput miss observ stack obtain sequenc ki mt design matrix comput slice comput fourier coe cient rst coe cient store comput singular decomposit reconstruct rank approxim appli fourier transform add obtain imput miss valu valu evalu jjx jj perform improv goto step algorithm address di culti individu motion sequenc align figur sampl di erent frequenc refer domain due di erent align paramet problem accommod step resampl comput function estim continu time step miss data design matrix mean simpli singular decomposit obtain princip compon iter approxim scheme altern svd step data imput step updat design matrix distanc ensur estim princip compon produc smooth motion recombin sequenc speci approxim individu cycl period rst deriv match left endpoint achiev translat cycl fourier domain truncat coe cient comput svd fourier domain step reconstruct design matrix approxim step reconstruct valu improv estim miss data repeat step improv estim iter process continu perform improv fall threshold algorithm gener imput design princip compon bayesian track goal calcul posterior probabl distribut human pose sequenc imag high bodi model make calcul demand learn model constrain bodi motion valid walk motion svd formul prior distribut bayesian track random vector rel joint angl time motion time interpret realiz written form qx vk fourier column rearrang rearrang vector column coe cient map absolut time rel cycl posit denot speed motion bodi posit ct repres global translat rotat problem calcul posterior distribut imag time due markovian structur underli posterior distribut tj likelihood observ imag paramet posterior probabl previou instant tempor prior probabl distribut encod paramet chang time element bayesian approach summar detail reader refer gener imag model function imag textur time model map surfac model camera model model project textur back imag gener model imag time view map imag time imag time denot gaussian distribut standard deviat depend view angl limb respect camera limb view obliqu tempor prior tempor tj model paramet describ bodi con gurat expect vari time individu compon assum follow random walk gaussian increment likelihood model gener model compar imag time imag speci comput likelihood term separ limb avoid numer integr imag gener ns pixel locat stochast denot ith sampl limb obtain measur nx approxim likelihood term occlud constant probabl angl limb princip axi imag plane isa function narrow view limb occlud filter typic track posterior distribut due nonlinear function particl lter infer posterior repres weight set state propag time particl experi detail algorithm found experi illustr method walk person clutter scene figur motion recov monocular sequenc motion frame visual posterior distribut displai project model expect ns model ns pi pi likelihood sampl paramet initi manual gaussian prior time learn model gener subject sequenc part train set autom method learn period human motion train data statist method detect length period segment optim align cycl present pca method build statist motion curv cope miss data enforc smooth begin end motion cycl learn prior probabl distribut bayesian track framework track monocular imag sequenc figur track person sampl upper frame project expect model con gurat overlaid lower expect con gurat frame perform particl ltere techniqu result shown clutter imag sequenc acknowledg gleicher gener provid data fleet discuss human motion bayesian estim portion work support xerox corpor gratefulli acknowledg support refer bobick davi action rehg multipl hypothesi approach gure track pp isard blake contour track stochast propag condit densiti pp freeman bayesian estim human motion imag sequenc tech report mitsubishi electr research learn track human motion function ieee workshop human analysi sm cr dyer ne invari detect period motion pp fleet stochast track human gure imag motion dublin ireland yacoob black model recognit activ tempor surfac tibshirani miss data gene express work depart stanford
HCI/312 4 zoom improv imag comb comput scienc depart interact lab maryland colleg md describ imag retriev system built base zoomabl user interfac discuss result analysi control experi perform aspect system experi result statist differ interact number imag style browser browser system perform perform system imag browser test experi includ thumb simpl landscap photo zoomabl imag browser base keyword control imag retriev comput zoomabl user interfac introduct past emerg faster declin cost popular digit onlin archiv present amount store graphic inform abil store manipul imag import imag incorpor electron document digit imag store electron encod futur retriev grow sophist wai retriev imag advanc tool grown rapidli potenti user submit acm digit librari hcil technic report benjamin bederson comput scienc depart interact lab maryland colleg md vast user individu move multimedia system graphic inform system bridg gap differ ag person pictur worth thousand good interfac offer support user paper focu aspect interfac concept world dictionari basic definit term examin casual adult cloth favorit depart store children sweet local candi shop vendor depart store owner realiz capit sale order maxim made easi understand peopl select displai manner suit target user imag browser librarian shelv book make easier patron imag browser displai imag distract user main task perform user imag includ experi made forget reason sought imag begin imag screen real estat import zoom make screen space scroll describ experi give practic guidelin futur imag browser order basi understand context system offer imag retriev system applic return imag descript inform inform form keyword natur languag imag browser applic user select imag multipl imag browser displai multipl imag time reduc resolut support inspect origin full resolut version imag return set imag obtain imag retriev queri displai imag browser refin search user case result queri yield imag user unfortun queri system ignor give result queri form list make hard imposs user select test featur browser decid contribut imag browser commun make browser zoomabl imag browser design search tightli coupl imag locat area repres result queri pose search section search term queri result view begin studi evalu sixteen imag browser compar contrast featur commerci sharewar product discov popular techniqu imag browser target softwar packag design collect imag imag browser deviat typic grid thumbnail approach chose commerci browser experi good commerci imag browser grid thumbnail easi support access imag packag corel mosaic corel corpor corpor access kodak compani jai imag manag design incorpor pictur publish incorpor imag ax pro digit art scienc phillip crew acd system unlimit bob montgomeri corpor portfolio corpor softwar powerpoint microsoft corpor tabl list system analyz system design zoomabl imag browser design system integr imag imag retriev queri formul search area user option perform simpl advanc search simpl user option enter word phrase queri perform advanc user form queri combin word phrase boolean connect interfac search area written search procedur written queri formul complet imag satisfi queri imag return section result queri lower section pan zoom individu imag imag section built gener engin write zoomabl user interfac offer uniqu advantag system user control tradeoff number imag displai resolut imag ten imag present section user ten zoom view imag enlarg ey higher resolut fewer imag true user zoom lower greater number imag user perform zoom imag full resolut locat place scene user perform success histori interfac maintain record previou queri displai snapshot imag return queri case user forget search term retriev set move cursor group imag inquir search term bottom histori section user group imag simpli click point histori section depict set imag user refer histori order return previou search reevalu refin histori section written pan zoom search queri histori figur zoomabl imag browser pan zoom individu imag entir view search implement standard boolean combin boolean retriev system term permit queri extract thesauru thesauru defin control vocabulari term thesauru creat term index imag index term organ taxonomi present user thesauru term index imag term describ content imag zoomabl user interfac zoomabl user interfac visual techniqu access spatial organ inform user zoom pan view inform fit singl screen advantag uniqu capabl offer preliminari user chang viewpoint magnif imag subject comment pan zoom easi thought world benefit system aspect chose perform control experi interest user differ environ imag browser evalu belong compani collabor system written vrml add dimens imag hope user view imag real world environ easier time descript browser chosen imag browser compar figur program user view thumbnail imag left side hierarchi folder current hard drive side user pan horizont scroll bar thumbnail click depict imag brought window enabl user zoom entir view select imag requir separ window potenti number imag current directori window figur imag browser experi system evalu simpl landscap simpl landscap imag scene view thumbnail imag scene imag face move scene arrow click specif thumbnail area larger version imag separ window user request higher enabl examin imag scene figur simpl landscap vrml imag browser creat corpor fourth final browser studi draw familiar metaphor organ store card case entir scene rotat upper lower click sphere scene automat spin thumbnail face viewer spin previou user select separ window figur vrml imag browser metaphor previou studi system review number studi similar perform studi imag browser interfac affect user abil zoom imag true find browser scale number imag studi zoom browser download hypertext markup languag document world wide web split thumbnail page user navig click link text load document histori view document remain visibl user overview achiev displai page zoom browser zoom browser scale number imag displai inform displai page longer research built inform access applic inform displai thumbnail grid user complain content thumbnail author introduc intermedi page size user detail view imag concept zoom imag browser group test gener navig effect www companion work side web browser serv histori aid build hierarchi page visit user page displai thumbnail imag serv link repres page user permit view entir graphic histori zoom focu part histori subject navig web zoomabl web companion task fewer page retriev time significantli reduc show concept effect navig serv web companion design stand imag browser idea design develop zoomabl imag browser presum contextu displai imag provid substanti support relev studi group student maryland main focu studi optim tradeoff imag size number imag displai found number imag reduc size result reduc task complet time test maximum imag conclud test larger imag determin optim number imag view simultan experi perform user studi assess system adopt hypothesi statist differ time user locat target browser user number incorrect select made browser user studi result statist depend discuss equip simpl landscap program zoomabl imag browser run linux subject evalu machin avoid switch oper system machin care elimin window manag task avoid differ oper system comput system mhz pentium pc monitor system run window nt resolut system ran linux resolut machin compar window nt machin megabyt ram linux machin megabyt ram system perform zoomabl browser requir wrote program autom record question task present subject stimuli subject set imag locat target imag function specif system work time user enabl complet task find imag pictur figur figur imag subject experi train begin particip educ imag browser gener subject clear understand assign perform subject complet imag browser time limit subject inform proce task felt comfort system goal train verifi subject understood navig techniqu browser familiar program autom question train administ subject perform time repeat previou techniqu train secondari browser subject simpli sheet instruct begin task browser read continu experi readi method primari design experi block design subject match task browser independ variabl browser zoomabl imag simpl number imag order independ variabl random conduct experi simultan experi method test particip randomli assign browser primari browser experi user instruct imag set test user initi request imag return browser assign signifi found correct imag select time imag record user repeat process imag imag set correctli select imag set small task measur recal subject instruct find imag send friend time record task give subject exploratori time observ browser time constraint subject present imag test recal subject instruct select imag set recal imag evalu primari browser questionnair give feedback felt address experi suggest improv system debrief segment test primari began test design requir particip system test particip evalu secondari browser random order addit browser present random particip evalu imag set test user evalu primari browser set imag evalu simpl landscap imag imag order evalu imag system imag set sixteen depend variabl analyz experi perform time measur set imag primari browser time complet task calcul time subject initi request question complet task select target imag number incorrect select measur imag set primari browser secondari browser incorrect select subject instruct continu search correct imag found correct select eventu made time percentag correctli recal measur imag set primari browser calcul place total number correctli recal number possibl lastli measur subject satisfact rate browser calcul question questionnair user interact satisfact develop maryland question specif relat imag question base qui format scale subject particip involv student colleg park background includ comput scienc electr engin graphic design librari inform servic approxim subject femal subject male ag record rang feel uncomfort ag data particip ag subject report expert world wide web averag user hour week user report person comput averag hour week subject paid particip experi result observ statist interact effect browser number imag view browser perform time prove faster browser imag significantli faster simpl landscap significantli faster figur effect consid equal time number imag sl figur perform time browser imag set statist interact effect browser number imag user satisfact figur highest user satisfact significantli faster simpl landscap significantli prefer user satisfact figur user satisfact rate browser order effect relat user satisfact primari browser differ browser test subject prefer set imag user number imag imag sl sl imag browser figur user satisfact rate primari browser averag imag set subject recal imag higher accuraci compar maximum number imag figur task type figur averag percentag imag correctli recal larg number incorrect select made simpl landscap made number incorrect select figur total number incorrect select made analysi number imag number imag sl sl result experi show zoomabl imag browser tradit grid thumbnail work perform time user satisfact user made fewer incorrect select statement note browser fairli perform time recal small imag set maximum number prefer fastest perform time peculiar observ made roughli half subject zoom imag fact gave train perform time improv imag screen adjust view chose decid maxim browser screen give user maximum space introduc confound variabl system screen space browser due setup design control perform time system fast browser recal test user substanti amount scroll imag account differ recal compar conceiv move scroll bar distract task unabl rememb imag store memori incorrect select select consid incorrect user select imag target incorrect select user continu correct imag select incorrect select accumul simpl landscap browser due movement scene user select imag spin time result select unwant imag incorrect select low observ relat number imag number incorrect select browser direct correl number imag number incorrect select explan offer gather observ subject imag screen user zoom stai zoom imag qualit result gather qualit result user perform experi subject popular comment user chang speed rotat zoomabl imag repeatedli receiv comment suggest abil group imag cluster content receiv request ad vertic scroll access imag page disappear explor window imag set select sought featur subject ad simpl landscap overview user global view place visit landscap present relat entir plane subject repeatedli state lost left search task experi subject explicitli express desir search target imag current studi show preliminari unansw question optim number imag displai screen resolut point user feel zoom current fourth imag set user zoom order content imag smaller window reason unansw experi practic guidelin design imag system design approach zoomabl imag browser grid thumbnail concern number incorrect select user make number imag displai browser import result interact effect browser number imag mean design decid imag browser larg small imag set browser fine small number tradit approach zoomabl imag browser work larg number imag acknowledg john ed marek input support work give special dixon origin implement test user particip experi member hcil umd comment accommod spirit john jone analysi data acknowledg member jim hollan jon meyer zoomabl imag browser gener larg fund darpa grate studi fund corpor refer zoom graphic interfac explor altern interfac acm bacon zoomabl graphic sketchpad explor altern interfac journal visual languag comput pictur imag pp imag inform system prospect inform retriev april pp imag april pp area imag base imag retriev septemb ring web studi acm confer hypertext acm pp lar context visual flip zoom zoom acm chi confer human factor comput system extend larg imag colleg decemb inform storag wilei comput john wilei kodak photo photo cd applic tcl tk taxonomi guidelin ieee vol pp inform framework inform retriev uist novemb pp store find inform paper document electron file chi la imag browser world wide boston technic report march design user strategi effect comput interact assess paper version qui annual human factor confer pp taxonomi graphic adjunct pp icon browser imag intl confer imag analysi process septemb pp
ML/313 6 learn strategi knowledg increment manuela veloso daniel borrajo depart comput scienc de informatica carnegi mellon universidad de madrid pa del spain abstract modern industri process requir advanc comput tool adapt user requir task solv strategi learn consist autom acquisit pattern action solv task current intellig strategi learn system acquir oper knowledg improv effici problem solver strategi learn tool provid achiev solut criteria present learn integr plan acquir control knowledg guid prodigi effici produc plan learn plan explain correct refin learn strategi knowledg make increment correct experi introduct technolog advanc appli problem requir tool chang autom plan problem comput system gener plan achiev set plan achiev effici optim respect qualiti measur learn strategi knowledg step applic todai comput technolog real world task current strategi learn system eagerli explain correctli problem solv choic singl episod static analysi domain definit reli heavili complet axiomat domain theori provid support gener explan episod futur situat requir explan effort gener accept realworld applic incomplet subject dynam present increment induct strategi learn system acquir control knowledg guid base level nonlinear planner effici achiev optim solut complex problem paper describ strategi learn tool context main characterist contribut integr gener problem ffl definit problem solv plan make process choic point altern identifi ffl problem solv search episod space altern identifi learn opportun success fail choic made ffl learn strategi rule success choic explain situat success expect occur explan process limit predefin templat ffl increment gener learn knowledg experi merg learn rule similar success refin situat appli incorrectli paper divid section section introduc underli problem solver identifi choic point learn opportun reader familiar prodigi plan stand heurist acquisit method learn search tree tem skip section loss provid illustr learn plan qualiti familiar reader find section describ architectur present gener control rule increment refin section show empir result elabor logist transport learn rule make prodigi solv effici qualiti complex plan problem goal hundr liter initi state section relat work strategi learn approach discuss extend strategi learn method appli nonlinear plan final section draw work plan control qualiti integr plan learn architectur prodigi current nonlinear problem solver analysi backward chain search procedur reason multipl goal multipl altern oper relev goal input basic problem solver algorithm domain consist set oper task object problem term initi configur set goal control knowledg prodigi plan algorithm interleav plan simul plan appli oper found relev goal intern world state tabl show abstract view prodigi plan algorithm plan reason shown tabl involv goal select set pend goal subgoal oper achiev goal bind order instanti chosen oper appli oper precondit satisfi continu subgoal unachiev goal default choic direct explicit control knowledg prodigi varieti power heurist difficult costli determin gener successor previou linear prodigi nonlinear complet termin goal statement satisfi current state comput set pend goal set applic oper goal pend satisfi current oper select plan achiev goal oper applic precondit satisfi state goal select oper ffl expand goal set relev instanti oper achiev goal ffl oper ffl step oper select directli ffl appli ffl step tabl skeleton plan algorithm choic point heurist succe fail learn automat acquir control knowledg overrid default behavior search heurist drive planner effici solut note learn domainindepend search strategi produc desir result common planner show simpl control knowledg plan solut qualiti domain domain packag deliv locat citi packag carri citi truck citi airplan post offic airport domain consist set oper load unload packag carrier move carrier locat plan situat post offic airport goal problem bring optim solut problem sequenc notic optim plan correspond uniqu gener learn procedur reason depend network plan step logist knowledg domain descript move carrier unload unload airplan packag current citi load packag carrier inform observ goal relat qualiti solut approach consist learn knowledg guid problem solver optim solut approach chang captur issu qualiti solut descript domain open research option explor figur show control rule learn search tree produc prodigi solv problem control rule consist specifi condit rule identifi made rule figur identifi set bind instanti oper shown figur note procedur select oper plan achiev goal locat airplan bound locat airplan prodigi bind variabl oper goal move airplan goal move packag rule establish airplan reach final airport depart airport object locat airplan pick object avoid extra trip simplic instanc problem variabl rule rule repres variabl specif packag select bind figur control rule creat oper back pick object return destin rule embodi complex system learn satisf problem solv episod goal learn rule shown figur select bind figur control rule select fly directli airplan current locat destin rule produc unoptim solut problem introduc rule unoptim prodigi rule solv problem introduc prodigi produc unoptim solut airplan fly fly pick return destin happen problem domain requir control rule learn prodigi find optim solut effici architectur input task set train qualiti measur output set control rule main induct refin modul modul gener control rule prodigi search tree rule induct modul solv problem gener rule analyz posit exampl refin modul replac rule specif find situat learn rule lead wrong gradual learn refin control rule converg set correct control rule individu figur show modul connect prodigi st st search tree gener prodigi plan set control set control rule learn bound explan set rule induc induct modul domain st st st st train problem bound explan modul prodigi induct modul refin modul learn control knowledg qualiti measur figur high level architectur tabl outlin algorithm train search find posit exampl opportun learn control rule gener rule induc gener rule neg exampl found applic control refin gener specif rule bound explan modul learn control rule import made empir evid converg current research effort formal studi converg learn mechan refer set learn control rule st refer search tree problem solv qualiti measur initi empti set train problem st result solv rule st result solv current set rule st st st st return tabl descript learn algorithm search solut extract inform justifi search space explan procedur consist label credit gener control label tree search tree start leaf node assign kind label node node correspond correct solut node dead end search planner expand node lead solut credit assign credit assign process select import branch learn occur concurr label view branch learn opportun lead solut differ default made domainindepend heurist special call control assign credit paramet system learn path lead optim solut problem set learn path solut gener control rule choic access inform current state search plan goal goal planner work applic erat inform gener modul creat applic control rule relev featur current state select goal regress learn kind select control prodigi section gener target concept decid appli oper subgoal unachiev select unachiev select oper achiev specif select bind oper achiev goal gener set rule target rule conjunct set predic learn rule target set rule view disjunct conjunct rule rule replac specif constant inherit consid plan situat variabl type distinct constant replac differ rule variabl match distinct constant heurist relax process induct gener learn rule induct gener rule gener bound explan method notic address induct learn gener learn rule analyz exampl situat rule applic method gener aspect learn subgoal interact type hierarchi learn rule shown figur rule planner find achiev move fly empti airplan achiev plan prodigi decid move carrier load carrier move back pick result plan rule includ packag place prodigi solv problem select goal figur rule learn appli initi learn rule shown figur select goal figur rule learn figur figur induct modul gener rule present figur result appli induct relax subgoal remov refin goal requir union find common find common gener type hierarchi prodigi common ancestor type airport select goal figur rule induc rule shown figur refin gener induc goal regress gener rule rule refin main issu detect neg refin learn knowledg neg situat control rule result led failur expect solut neg recov refin wrong rule goal larger set predic cover posit neg exampl kind rule kind recov method bound rule refin ad liter set featur present rule learn induc rule gener test gener rule cover neg step back refin rule induc rule refin ad predic set differ gener rule induc rule empir result carri experi result report section logist transport domain mention train randomli gener problem citi packag gener control rule randomli gener test problem complex tabl show result test vari number goal problem maximum number packag notic problem goal complex term find good optim involv solut step experi compar prodigi rule learn prodigi cpu run time limit vari number goal problem formula time bound result show number unsolv problem prodigi learn rule compar solut account problem solv configur tabl show larg number solut gener rule qualiti gener rule show learn rule drive planner find solut qualiti addit support research goal underli learn algorithm run time significantli find empir learn rule time spent solv problem degrad util problem develop effici method organ match learn control rule organ essenti part learn process relat work speedup learn system appli problem solver linear appli prolog logic program problem solver problem solver linear problem solver problem solver incomplet incap find optim solut remov linear deal nonlinear problem solver kind problem solver address real world complex problem learn system appli nonlinear problem solv approach includ improv problem solv perform larg learn improv solut qualiti recent pursu research includ differ perez work reli induct refin posit exampl gener approach differ knowledg learn control learner combin kind learn control effect achiev solut term knowledg control major control knowledg integr domain learn modifi test set unsolv problem solv configur solut solut length node explor number number goal problem rule rule rule rule rule rule rule rule total tabl empir result increasingli complex problem logist domain exist control knowledg separ domain knowledg explicitli learn procedur control knowledg separ domain prodigi transpar incorpor problem solv knowledg extend learn method linear plan algorithm direct ffl extend work linear problem solv requir address problem multipl goal choic nonlinear problem solv previou multipl oper bind choic identifi extens previou extens languag describ learn control definit learn qualiti solut ffl reduc explan effort achiev gener partial explan branch made search solut induct learn techniqu requir insur correct deduc control rule learn rule converg correct system analyz exampl induct learn elimin extra domain domain axiom ebl ffl increment refin control rule system improv qualiti learn rule analyz exampl rule gener modul specif system capabl test control rule exampl modifi produc correct rule gener discuss learn captur action pattern success problem solver learn knowledg enabl problem solver find solut problem effici good qualiti user defin criteria build kind strategi learn tool exist problem order appli applic dynam chang environ refer daniel borrajo manuela veloso bound explan induct refin acquir control knowledg intern workshop knowledg compil speedup page june daniel borrajo manuela veloso increment learn control knowledg nonlinear problem solv european confer machin page springer april jaim jim oren robert dan craig steven scott manuela wang manual tutori technic report carnegi mellon june robert doorenbo manuela veloso knowledg organ util problem intern workshop edg compil speedup page june oren etzioni acquir knowledg static analysi artifici oren etzioni steven minton ebl produc critiqu prodigi approach ninth intern confer machin page kambhampati kedar explan base gener partial order plan ninth nation confer artifici page john paul allen newel chunk anatomi gener learn mechan machin pat langlei learn effect search heurist ninth intern joint confer artifici page zukerman learn search control rule induct approach machin learn page steven minton learn effect search control approach kluwer academ tom paul learn acquir refin heurist machin artifici intellig page tioga palo perez jaim carbonel control knowledg improv plan qualiti intern confer ai plan perez oren etzioni role train problem ebl sleeman ninth intern confer machin page morgan san ross quinlan learn logic definit relat machin david denni kibler learn episod optim machin learn confer page san morgan kaufmann peter manuela jim blyth heurist intern confer ai plan page june prasad tadep lazi solut intract theori problem eleventh intern joint confer artifici page san morgan kaufmann manuela veloso jim blyth examin causal link commit plan intern confer ai plan page june manuela veloso flexibl strategi analog replai problem solv episod twelfth nation confer artifici august aaai press zell moonei combin foil logic program thirteenth intern joint confer artifici
Agents/314 1 social bdi framework pietro timothi nichola jen dept electron queen mari westfield london uk abstract present conceptu model social natur agent impact individu mental state role social relationship provid abstract develop notion social mental shape introduct architectur delib agent base physic symbol system assumpt agent maintain reason intern world architectur individu social aspect agent situat system main reason limit mental attitud intern agent model relat agent proposit paper extend bdi model order investig problem social natur agent impact individu mental state address mental state influenc social context relationship mental state interact conceptu mechan enabl relationship remaind paper section inform introduc notion social mental shape section notion section introduc number kei type social exchang social mental shape mental state bdi agent view constitut intern motiv mental attitud tradit imag threaten account social natur agent claim adopt attitud driven social role social relationship term social context refer pattern interrel role role conceiv system prescrib mental system prescrib behaviour role provid agent inform goal attitud drive behaviour role reason problem submit world scientif inform achiev react number wai social relationship drive behaviour influenc mental state author mental state chang agent power guid behaviour disposit agent influenc adopt attitud simpli intend contribut welfar trust agent influenc acquaint adopt mental attitud strength confid agent agent influenc adopt mental attitud process argument role relationship offer mental attitud agent adopt complement chang individu mental state suggest view agent kind associ engag iter seri social action interact aim complet mental state complex interplai agent social context turn process role social relationship complement augment bare individu mental attitud call complet process social mental shape social mental shape section introduc formal framework explor process social mental shape detail work broadli logic model introduc cavedon sonenberg extend framework direct role provid agent goal intent mental attitud provid role social relationship start assum set denot individu agent agent typic requir perform make achiev mental attitud analysi base fairli standard bdi framework mental attitud notion repres mean agent mental attitud att φ belief desir goal belief set includ belief world belief mental attitud agent belief set incomplet desir primari motiv action agent submit world scientif conflict desir goal consist subset set desir goal conceiv candid move goal believ agent achiev intent repres goal commit achiev role social relationship languag quantif relationship relationship set role agent rn denot individu role introduc predic agent assert agent role set social relationship type relationship type repres relationship pair set relationship instanti relationship type agent aj social write role social mental shape express influenc role mental social relationship introduc modal oper φ iff att φ mean role adopt attitud att φ social mental shape rule assert role influenc agent mental state respect mental attitud adopt social cognit relationship present formal framework show mental state influenc social relationship agent kind social mental shape captur aj iff φ agent social relationship agent believ mental attitud simpli reason submit world scientif mental state adopt influenc situat social relationship defin concept social cognit relationship agent aj social cognit relationship social agent adopt mental attitud simpli believ hold attitud agent aj social cognit social cognit structur φ rn φ rn defin social cognit notion social context social structur social context set interrel role definit subset social relationship social context iff weakli connect social structur set relat agent relat instanti relat role social context definit social structur ag set agent set social rn rel st set binari rel weakli rj set social relationship ag label agent ag role rel label arc rel social relationship type social structur cognit social structur agent connect social cognit relat definit social structur social cognit structur iff rel set binari social cognit rel st form social cognit relationship illustr power flexibl concept social mental examin number fundament form social cognit relationship imit imit form social mental shape ground desir long ai social relationship aj believ aj desir submit world scientif ai adopt desir imit φ rn bel de φ φ adopt call adopt form social mental shape refer goal φ rn φ agent adopt goal believ agent goal agent complet mental state extend includ goal form social mental shape ground intent agent intend achiev state world simpli believ agent intend φ rn bel φ φ exploit case agent easili lean inform possess agent job agent extend mental state includ belief mental extens base belief agent belief refer form social mental shape exploit φ rn bel φ φ futur work paper describ preliminari investig impact social mental bdi framework notion social mental shape captur impact role social relationship mental state futur work involv investig social mental shape attent paid social mental shape develop time intend address problem inconsist social adopt attitud intern motiv refer cavedon sonenberg social role prefer goal intern confer page rao georgeff model agent bdi architectur fike proc intern confer principl knowledg reason page april morgan kaufmann submit world scientif
DB/315 3 aggreg linguist knowledg jame shaw dept comput scienc columbia ny usa abstract combin multipl singl text gener system express amount inform fewer word produc great varieti complex construct describ oper gener complex sentenc semant type oper portabl reusabl base gener resourc lexicon grammar introduct express express convei amount tion fewer word complex sentenc gener combin simpl sentenc multipl refer recur entiti remov combin sentenc patient illustr common occurr repeat entiti ship compani tupl convei transform multipl proposit term interchang proposit refer piec inform correspond simpl sentenc multipl shipment locat possibl dai gener sentenc tupl potenti redund refer locat date relat observ recur entiti input valid type execut trace expert system casper aggreg sentenc sentenc planner gener sentenc aggreg happen linguist inferenti user domain common reason reduc number concept convei oper implement content planner combin consult lexic resourc text applic inferenti oper extens sentenc hit kick impli mari defin set inferenti oper unrestrict text inferenti oper domain telephon work plan descript reusabl direct effort aggreg oper level rhetor combin base rhetor relationship contrast condit advantag inform futur aggreg work linguist lexic syntact inform combin concentr type ii il il patient past medic histori statu post tube left statu post recurr question neurolog ep approxim high exert past quit year figur sentenc maximum number proposit corpu linguist aggreg describ relat depend element domin element oper transform modifi attach modifi domin aggreg oper combin construct equal coordin casper separ magic abstract gener intens gener text magic automat gener multimedia describ statu patient undergo bypass surgeri exist inform infrastructur oper room columbia medic center mckeown gener english summari base trace interact plan engin tm document placement cost facil rout telephon network section present corpu analysi identifi complex target output magic section describ semant casper detail oper present section oper section section describ relat work corpu analysi conduct corpu analysi studi style type aggreg corpu consist sentenc discharg summari patient medic domain sentenc describ patient demograph medic condit pertin patient care intens care unit step find proposit combin sentenc proposit defin piec inform physician convei sentenc toth intens care unit sentenc patient year femal admit heart patient patient year patient admit heart small corpu sentenc word obtain proposit manual maximum proposit singl sentenc shown figur proposit sentenc summari sentenc sentenc discharg doctor prefer preposit phrase rel insert medic condit sentenc occurr pp rel studi reveal physician produc complex sentenc coordin construct popular aggreg adject present past participl rel rare aggreg oper result long distanc depend constitu syntact analysi peopl prefer linguist devic simpler word phrase de encount sentenc corpu formul doctor edit discharg summari summari similar speech doctor prefer flexibl linguist produc sentenc concept noun adject form noun form longer word shorter adject form corpu adject pp medic condit medic condit adject speaker noun form group medic condit inform attach noun adject noun medic condit modifi diabet extens end organ flexibl noun explain popular usag adject analysi show high level aggreg typic domain judg number pp comparison rel aggreg simpler syntact constitu prefer doctor gener summari examin inform front gener sentenc gener text convei inform magic gener text advantag linguist opportun semant casper influenc grammar semant structur provid role event state mod slot pred store verb concept ing concept themat gave red book mari option slot mod store modifi pred multipl includ time insid argument mod slot store inform adject pp oper magic demonstr oper work surfac form proposit content planner shown figur addit content planner focu casper pick domin proposit focu entiti entiti focu earli provid proposit la transform patient semant pred proposit chang addit swap proposit repres similarli shown figur concept denot entiti attribut store depend lexic properti attribut proposit le figur realiz patient patient la lb lc id le ig figur semant patient doctor patient jone patient gender femal patient ag year patient patient diabet patient doctor patient undergo figur input proposit jone year diabet femal patient doctor smith undergo aggreg proposit share entiti common oper transform modifi goal gener casper prefer transform proposit adject participl il rel prefer syntact simpl express complex de plan incorpor constraint corpu determin aggreg oper appli order transform proposit proposit satisfi precondit slot proposit transform patient ag requir proposit map permit lexicon proposit le transform adject attach proposit la result year diabet femal interest thing note pred domin proposit transform modifi attach slot domin proposit sequenti order modifi determin stage goal casper produc semant set proposit express result gener modul express casper ahead make detail lexic effici reason exact lexic syntact includ order made lexic patient proposit transform adject adject form lexicon proposit transform pp gener preposit pred proposit concept map noun phrase appli pp oper year diabet femal patient casper ontolog identifi medic disord group medic condit map noun realiz year femal patient diabet figur pair instal ms offic john mondai list figur patient doctor transform pp modifi shown figur transform pp phenomenon hold relationship similar proposit transform rel long share common entiti proposit lg satisfi precondit previou oper combin present participl present participl simpler shorter result oper semant year diabet femal patient smith undergo similar long effici import issu gener long complex sentenc search space grow exponenti respect length case casper gener complex sentenc effici delai difficult detail lexic absolut sentenc plan casper ahead lexicon merg proposit satisfi requir lexic constraint prevent lexic combin incompat determin sentenc boundari carri detail lexic casper cut search space lexic drastic gener system implement detail lexic made proposit aggreg costli lexic proposit correct proposit strategi gener impress complex complex half hour detail lexic inform make sentenc boundari trade optim aggreg effici lexicon access casper prune search space drastic delai detail lexic concept involv desir sentenc effici issu gener address elhadad oper imaginari human resourc report system technic support team illustr algorithm shown figur approach combin proposit coordin construct adjac proposit slot distinct element proposit conjoin slot distinct element sentenc result proposit distinct element instal mari peter il alic instal excel john bob remov john alic instal powerpoint john remov access john alic john alic instal powerpoint john remov access john bob remov john mondai mondai mondai figur sampl input proposit surfac form mondai mondai mondai tuesdai figur proposit surfac form stage reduct conjoin proposit distinct element slot combin conjoin proposit delet rule section ensur result sentenc correct ellipsi proposit distinct pred finish work home proposit delet due limit describ algorithm casper produc sentenc coordin detail discuss relev linguist divid algorithm stage place sentenc planner stage place lexic stage group proposit order similar satisfi pragmat contextu constraint stage determin recur element order proposit combin stage creat sentenc boundari combin reach predetermin threshold stage determin recur element redund delet detail stage section group order proposit coordin delet recur entiti surfac proposit entiti sequenti sequenti order proposit coordin affect length output text step casper sequenti proposit maximum number adjac recur entiti produc text proposit figur semant identifi slot similar calcul number distinct element slot proposit gener casper prefer group proposit result slot proposit figur pred occur string symbol delet surfac concept exist semant figur simplifi instal excel mondai outlook algorithm proposit sort element slot oper determin mondai smaller alphabet start slot highest algorithm proposit base element slot tion order sort process put similar proposit adjac shown figur identifi recur element current algorithm combin proposit stage casper concern slot distinct valu slot multipl adjac proposit slot distinct proposit proposit replac proposit slot conjoin distinct element slot proposit combin semant structur repres instal excel powerpoint john proposit distinct slot slot previou proposit approach combin proposit previou linguist analysi remov recur entiti immedi base transform current system gener conjoin proposit lexic conjoin lexic prevent realiz compon gener string redund element coordin produc linguist describ gap figur show result combin proposit result instal excel mondai outlook reader notic pred proposit mark recur process delet subsequ recur element surfac level explain section determin sentenc boundari combin proposit result proposit exce paramet complex algorithm combin proposit result proposit coordin base limit number proposit conjoin coordin normal case higher threshold render sentenc difficult comprehend special case slot proposit ii ii ii ii ii ii ii ii determin limit advantag parallel proposit combin procedur make coordin structur difficult understand sentenc long understand conjoin long list proposit produc understand sentenc plai tenni drove school won lotteri constraint produc easili understand complex sentenc lot inform delet redund element stage handl ellipsi previou adjac element occur proposit mark actual delet made casper lack inform import surfac sequenti order demonstr sentenc alic instal excel remov lotu element delet forward subsequ occurr ident constitu element realiz end element delet backward occurr ident constitu instal excel remov lotu slot realiz front medial recur element slot delet forward realiz front middl element slot delet forward slot realiz end posit recur element slot delet extend extens appli conjoin demonstr algorithm result easili alic instal excel powerpoint remov word john bob remov john process replac sentenc pronoun relat work construct paper receiv lot attent linguist gener literatur aggreg topic aggreg integr part text erat term impli gener improv case system prefer term optim describ phenomenon aggreg appropri fewer word convei amount inform earlier aggreg implement strateg compon logic deriv combin remov easili infer made lexic inform newer huang sentenc planner make level strateg tactic compon except de research tion transform rel manner de heurist carri combin base rst specif identifi rhetor relat correspond oper incorpor rhetor aggreg futur robin work oper similar describ work earlier section sentenc coordin construct express lot inform text gener system implement gener coordin sion huang system handl simpl coordin tain conjoin syntact object handl ellipsi casper casper systemat find press proposit proposit aggreg oper work local handl complex case possibl inform sentenc receiv attent research simpli ignor possibl input sentenc planner exce describ combin lexic inform oper produc sentenc coordin lexicon aggreg process express perform task sentenc delimit lexic system gener complex sentenc effici oper futur gener system develop expect acknowledg author kathleen mckeown valuabl advic encourag work support darpa contract columbia center advanc technolog high perform comput healthcar york state scienc technolog nsf grant refer dynam improv approach gener proc page japan collect account linguist philosophi system gener multimedia patient statu proc annual fall page dc gener refer construct descript domain object process mit ma aggreg natur languag gener proc european workshop natur languag itali float constraint lexic choic comput hallidai introduct function grammar edward edit il ii ii integr view text plan aspect autom natur languag lectur note artifici page berlin autom gener structur relat artifici special issu nlp proof verbal applic nlg proc page japan semant structur mit ma formal tem grammat mental grammat chapter mit press analysi design methodolog autom document gener vol page kluwer academ ma comput author result prospect technic report usc inform scienc marina del ca descript construct text structur technic report usc inform scienc marina del ca linguist logic chicago press factor contribut effici natur languag gener natur languag result artifici psycholog nato asi seri page boston practic issu gener proc acl confer appli natur languag page stuttgart languag gener multimedia healthcar proc acl conf page implic natur languag gener natur languag gener artifici intellig comput page kluwer academ boston grammar english languag longman london gener natur languag summari provid histor background phd columbia de de messag text gener current research natur languag page academ york aggreg text proc cl page coordin ellipsi text gener proc cole annual meet acl coordin reduct phd indiana sentenc planner proc intern natur languag gener page uk
AI/316 2 hybrid heurist optim design artifici neural network abraham school comput inform technolog monash churchil australia design architectur correct paramet learn algorithm tediou task model optim artifici neural network faster gener perform paper explain hybrid algorithm integr genet algorithm simul anneal heurist procedur appli optim design ann paper concern understand current theoret develop evolutionari artifici neural network ga hybrid heurist procedur combin produc optim ann regard gener framework adapt system chang connect architectur learn rule environ human artifici neural simul genet evolutionari artifici neural network genet anneal introduct convent design ann requir user number distribut layer interconnect method automat construct ann reduct network complex determin number hidden topolog optim algorithm prune cascad correl limit interest evolutionari search procedur design ann architectur grow recent year evolv optim architectur elimin tediou trial error work manual find optim network ga gener optim procedur increasingli appli independ spectrum problem area long time theoret investig sa ga develop hybrid algorithm emploi good properti perform ga sa situat ga outperform sa vice versa ga design ergod cover space maxim effici prime benefit ga paral capabl contrast sa larg sequenti move optim state sampl accept permit identif current local minima test paramet chosen genet algorithm ga mimic biolog evolut work ga adapt comput techniqu transform set individu mathemat object fix length charact binari fit popul oper pattern principl reproduct surviv fittest natur occur genet oper produc good solut solut combin trait parent individu produc superior children procedur written differ popul time random variat select oper simul anneal sa global optim algorithm statist deliv optim solut gener function simul anneal algorithm repres ln ln temperatur dimens time gener probabl repres ki dz dz dz ki straightforward prove anneal schedul oi global obtain constant paramet suffici larg constant satisfi eq gener function eq adopt genet anneal algorithm hybrid random search techniqu fuse sa ga methodolog effici algorithm hybrid algorithm inherit converg properti sa paral capabl ga genotyp assign energi initi equal energi random bit string assign energi mutant exce threshold parent spawn mutant reject genotyp consid energi genotyp equal energi mutant accept replac energi bank track energi liber success mutant mutant pass threshold differ threshold mutant energi ad eb temporari storag quantum energi threshold reset equal energi accept mutant move member popul member subject random entir popul chang threshold rate directli proport amount energi accumul eb member design choic rate anneal result repeat cycl collect energi success mutant redistribut threshold energi popul member equal algorithm bp gradient descent techniqu minim error criteria batch mode variant descent base gradient total train set ij ij ij learn rate momentum good choic paramet requir train success speed ann empir research shown bp algorithm stuck local minimum random initi weight bp gener detect global featur input prolong train network start recogn individu pair settl weight gener describ map train set framework optim design ann optim design ann achiev adapt evolut connect architectur learn rule progress time scale figur illustr gener interact mechan architectur ann evolv highest level slowest time scale evolut learn rule proce faster time scale environ decid architectur learn evolut connect weight proce faster time scale environ decid learn rule architectur hierarchi architectur learn rule reli prior knowledg prior knowledg learn rule architectur implement learn rule higher level fig interact search mechan design optim ann global search connect weight shortcom bp algorithm overcom train process consid global search optim connect weight architectur learn rule ann fix search process connect weight repres binari string length real number directli network encod concaten connect weight network chromosom heurist order concaten put connect weight node figur illustr binari connect weight weight repres bit real number weight ann proper genet oper chosen depend fig genotyp binari weight global search connect weight hybrid heurist formul gener initi popul weight vector initi energi configur begin cool loop energi bank set randomli mutat weight vector comput energi result mutant weight vector configur restor energi differ increment energi bank replac configur success mutant end cool loop begin loop comput increment eb eb add comput increment threshold weight vector end loop step continu anneal process optimum weight vector found minimum error check network achiev requir error rate requir error rate skip step restor weight switch back propag algorithm weight end algorithm consid gener sensit initi condit perform algorithm approach directli depend problem previou research shown worthwhil incorpor search final stage global search enhanc fine tune local search avoid global search trap local minima global search optim architectur evolutionari architectur adapt achiev construct destruct algorithm construct algorithm start simpl architectur add complex network entir network learn task destruct algorithm start larg architectur remov node interconnect ann longer perform task remov undon figur demonstr typic neural network architectur directli encod genotyp repres assum node transfer function fix architectur decid optim requir node transfer function tangent formul global search run faster time scale search architectur scalabl issu direct code scheme genotyp string larg ann size comput time evolut minim size genotyp string improv priori knowledg architectur effici indirect code scheme neighbor layer fulli connect architectur code simpli number layer node blueprint popular indirect code scheme assum architectur consist segment area segment area defin set spatial arrang connect high level code scheme graph gener system symbiot adapt marker base genet code cellular encod fractal rug techniqu global search transfer function connect ann hybrid algorithm formul gener initi popul architectur vector initi ith energi configur depend code schemata vector repres architectur node transfer function algorithm replac weight vector architectur vector step continu anneal process optimum architectur vector found end fig direct code genotyp neural network architectur global search learn rule neural network fulli optim learn rule adapt dynam architectur problem decid learn rate momentum consid attempt learn rule basic learn rule gener function ij dw weight local variabl qs real coeffici determin global search algorithm equat valu qs determin learn rule deriv equat assum rule applic node network weight updat depend activ connect weight node genotyp encod coeffici global search learn rule hybrid algorithm formul gener initi popul initi energi configur algorithm replac weight vector vector step continu anneal process optim obtain end note bp algorithm adapt learn rate momentum compar similar situat paper investig tool adapt optimum design ann present optim design ann achiev global search process compar pure genet evolutionari algorithm theoret converg incorpor algorithm fine tune optim ann design real success model system directli depend genotyp connect architectur learn rule global search procedur comput continu deliv global search larg ann easili feasibl refer evolv artifici neural theoret comparison evolutionari algorithm simul annual confer evolutionari program mit press method construct train feed forward neural neural jp learn feed forward layer tile journal physic vol pp genet algorithm fast simul anneal mathemat comput pp simul anneal intern journal comput jm grow layer introduc intern joint confer neural vol pp cascad correl learn advanc neural inform process pp ig design modular artifici neural ha comput scienc pp automat determin optim network topolog base inform theori ieee euromicro confer comparison optim backpropag european symposium artifici neural pp construct algorithm binari neural oil spot ieee transact neural pp db lj altern neural network train ieee volum pp oa neural network train mean cooper evolutionari nuclear instrument method physic volum pp fast reinforc learn eugen technic report depart comput texa austin design neural network genet algorithm graph gener complex volum pp kv genet dr pp sw aj prune neural network modern stochast optim neural comput vol pp genet encod neural network evolv european confer artifici genet synthesi modular neural forrest genet proc intern morgan kaufman rf fractal configur neural neural vol pp tg kh fast learn method neural network evolutionari adapt learn vol pp
ML/317 6 automat discrimin languag base prosodi fred felix istituto di studi ch switzerland februari technic report abstract develop method automat identif languag motiv applic intend theoret question variat similar evalu potenti util prosod amplitud envelop languag discrimin task discrimin neural network successfulli attend tempor inform rang variabl found discrimin reflect tradit inton rhythmic languag class method emploi empir determin prosod similar languag die von zur die zum einer al der variat und die und die modul der der problem mit der die ein da ist die zu bei der al und die die auf der basi von inton und die die der correspond address introduct develop method automat identif languag motiv applic intend environ requir system maxim complet languag model candid languag utter assign candid model confid accept input system perform reflect appropri underli languag model method appli free presupposit underli unit structur candid addit virtu provid evid variat similar research languag identif benefit greatli recent avail larg corpora note oregon graduat institut telephon speech corpu linguist data consortium record telephon speaker respond nativ languag seri prompt design elicit speech continuum specif lexic item unconstrain includ approxim speaker languag group publish result base make comparison system feasibl lid system typic make independ sourc inform extract raw speech signal import sourc inform lid spectrum repres cepstral identifi phone hidden markov model inform assess likelihood observ acoust realiz probabl observ segment distribut combin reason prosod inform potenti discrimin languag prosodi gener refer heterogen set speech featur ti individu segment perceptu element prosodi includ inton rhythm signal fashion physic variabl carri inform thought primarili fundament frequenc rel durat segment modul amplitud envelop phonolog distinct prosod level linguist structur recogn languag subject theori prosod structur lid system sought exploit prosod inform direct studi util prosod featur summar hutchin discrimin pair mandarin spanish sampl ogi ts corpu attempt individu featur featur pair featur includ pitch contour pitch differ syllabl amplitud modul amplitud contour syllabl differ maximum amplitud syllabl low frequenc fft amplitud envelop syllabl rate durat featur comput discrimin ratio function base histogram featur featur pair featur prove combin featur featur perform yield result chanc case author note linguist specif languag make predict prosod featur discrimin ogi zue includ durat inform independ sourc evalu combin segment inform durat prove contribut perform segment model result provid assess role variabl gross separ zhou tanaka construct parametr descript contour extract utter perform discrimin analysi data conclud languag discrimin basi test discrimin function independ data perform studi hold durat inform prove hutchin examin remain carrier prosod amplitud envelop modul perceptu correl inform term caveat remain larg ignor role plai envelop modul author conclud amplitud featur poor lid pessimist stem part difficulti deriv featur envelop unlik larg bodi linguist theori inton tone hint linguist phonolog theori speech rhythm achiev success date crude taxonomi recogn languag repeatedli fail find empir support acoust measur credibl model emerg replac evid strong rhythmic constraint speech product present port confin task beat identifi onset energi signal start stress syllabl beat found lie point repetit cycl consist simpl rhythmic interpret complex obtain suggest featur present amplitud envelop modul discrimin languag approach contrast hutchin comput featur speech signal advanc present variabl time seri recurr neural network network emploi demonstr success symbol problem requir learn local inform time seri neural network requir system discov aspect input signal relev discrimin task approach contrast method network process speech input statist analysi input perform oper train network multipl network process signal power system goal evalu potenti util prosod variabl full lid end present result provid lower bound discriminatori power network goal interpret success failur network provid similar metric prosod variabl languag empir handl difficult task establish languag typolog base inton rhythm gener method data subset ogi telephon speech specif design support languag identif research restrict attent languag mandarin german languag hutchin select includ languag lexic stress pitch accent includ consid prosod system similar test expect maxim prosod similar languag ogi corpu record acquir commerci telephon line speaker automat gener seri prompt prompt elicit lexic constrain dai unconstrain home complet unconstrain speech caller train speech yield record speaker languag speaker provid select record made hz resolut preprocess trace obtain pitch track smooth pitch estim ms frame deem estim downsampl hz slide rectangular smooth simpl point rectangular window rescal lie rang refer input amplitud envelop comput filter speech butterworth filter center hz bandwidth hz effect remov leav inform result scott suggest amplitud variat frequenc rang import perceiv rhythm speech filter speech rectifi absolut valu sampl smooth butterworth filter hz downsampl rescal manner paramet input call network input consist time seri real figur illustr input speech file ca sec provid cambridg engin calcul correl coeffici mean standard deviat tabl time figur network input english sound file solid line modul amplitud dash line chang languag correl std dev tabl correl preprocess network input experi attempt discrimin languag base sever impoverish input raw data natur speech rang dialect languag segment inform preserv expect optim evalu effect hitherto sourc inform network architectur recurr neural hidden unit receiv input extern hidden unit possibl output output function weight net input state network time depend present previou state network state view short term long term memori instanti weight unit standard train back propag time recurr learn propag error back time order properli credit network weight point model suffer limit magnitud error signal decai exponenti blow lead histori account make difficult imposs network learn solv problem requir storag inform long time lag attempt counter simpli sampl input time lose opportun attend fine tempor structur result abil attend inform distribut rang time scale attempt overcom limit long memori present hidden unit convent recurr neural network replac memori memori illustr figur heart cell simpl linear unit singl connect weight set absenc connect serv preserv cell current state moment addit cell receiv input input unit cell gate cell maintain inform long period decid inform appli inform li input output gate input cell pass squash function typic logist scale lie result multipli output input gate unit input gate suffici activ signal enter cell emerg cell output gate activ intern cell state maintain linear activ rang cell output squash typic rang gate convent unit sigmoid activ function rang receiv input network input unit cell gate input gate decid cell store output gate decid inform effect salient event rememb arbitrarili long period time equip memori network effect attend event multipl time scale network train truncat version full detail provid author present result seri experi effect solv problem involv tempor depend demonstr method successfulli solv problem inform store time lag excess thousand time establish recurr neural network typic fail input gate gate output input cell cell figur singl memori block block cell gate unit cell input squash gate input gate pass linear unit center unit activ cell state absenc cell state preserv connect cell output comput squash cell state gate output gate time interv time step bridg present work applic complex data network paramet fix base pilot experi network train discrimin english mandarin subset data emploi experi report experi report network input memori block singl singl output activ network discrimin task weight provid input gate output cell gate output weight origin gate output unit provid implement addit input unit constant provid gate output cell weight detail randomli initi start trial uniform distribut rang gate memori block neg gate ensur activ gate close start learn occur direct connect input output learn progress memori block begin contribut network comput approach gener goal network train ensur separ hidden unit element attempt solv separ part problem network train network network train speech file languag speech data input hz resolut target provid entir sequenc weight updat made sequenc network state reset sequenc sequenc judg classifi correctli averag output input correct side end train epoch speech network perform evalu valid set independ half languag learn carri valid train continu epoch learn rate order sequenc present random start epoch weight store perform valid set final network evalu consist present set speech file gener perform independ train valid set random guess lead averag correct experi discrimin base combin trial run random weight initi trial perform valid set test train epoch perform improv result weight store perform test set examin figur illustr perform improv train show number misclassifi sequenc set perform valid set monoton test case perform set improv previou perform test set optim perform typic reach train epoch tabl present standard deviat percentag sequenc correctli classifi test set weight gave perform valid set confid interv proport correctli classifi sequenc comput tabl percentag trial chanc perform lai confid interv evid network success discrimin typolog distinct pair german spanish perform group languag spanish easili distinguish english rhythmic differ assert experi discrimin base order assess independ contribut discrimin network train input featur discrimin network train maximum epoch architectur number epoch error valid set test set number epoch error figur perform valid test set train progress data network train discrimin english mandarin chanc perform learn paramet experi optim train point determin perform valid set perform score independ test set tabl percent correct tabl figur provid confid interv proport correctli classifi sequenc comput train tabl give percentag trial chanc perform lai confid interv perform discrimin task good model perform comparison involv languag mandarin reliabl show improv slight improv discrimin experi base primarili ger spa man ger spa man english german spanish tabl standard deviat percentag correctli classifi sequenc test set chanc perform percent trial chanc perform lai confid interv correct ci chanc ger spa man ger spa man english german spanish tabl averag percent correct sequenc correctli classifi test set input chanc percent trial chanc perform lai confid interv proport sequenc correctli classifi network longer simultan learn ignor irrelev simplifi task mandarin correctli discrimin fall chanc level base confid interv chanc perform discrimin base perform languag remain confid interv includ chanc point note improv shown discrimin spanish english input poorer perform shown task attribut harder task learn correct ci chanc ge sp ja ma ge sp ja ma english german spanish tabl averag percent correct sequenc correctli classifi test set input chanc percent trial chanc perform lai confid interv proport sequenc correctli classifi discrimin base simultan learn ignor appar irrelev input task show similar improv case present appar rhythmic differ languag appar english german distinguish mandarin spanish distinguish trial discrimin remain languag base clear spanish fairli english applic train network continu speech experi demonstr network capabl discrimin pair languag chanc base order assess potenti util network part complet lid estim optim perform achiev process speech onlin turn attent optim exploit network train experi born mind attempt optim architectur algorithm systemat fashion result obtain serv lower bound perform expect train network ogi ts includ speech file sec subject chose read arbitrari prose passag speak ad lib present speech file discrimin task network train experi network reach syllabl speech network train speech sampl longer appli record time network output threshold neutral network reset neutral evalu end record network speech file threshold network languag equal choic individu network arriv solut improv system perform individu speech file emploi requir major vote fall languag speech file elicit major system undecid simpl choic requir trade certainti larg major mean high chanc correct number speech sampl provid firm result present speech file network train experi set weight gave result verif set independ set consid evalu perform percentag dec speech file system corr correct file made select major size requir obtain result obtain combin network experi file report dec corr meet criteria german spanish mandarin dec corr dec corr dec corr english fail german fail spanish tabl percentag file made dec percentag file correctli identifi corr size major vote requir network threshold establish specif network network train experi test telephon speech entri note minimum perform level provid case reach discuss experi present demonstr discrimin typolog distinct languag level significantli chanc base inform provid local chang smooth amplitud envelop discrimin achiev explicit featur network discov relev properti input variabl train agreement hutchin find prosod find discrimin perform highli depend languag specif result obtain task involv typolog distinct languag unlik find amplitud envelop modul compar discrimin languag pair network emploi suggest prosod discrimin exploit lid convent sourc inform segment ident sequenc expect util prosodi lid system depend part independ inform system modul system incorpor limit amount amplitud envelop repres lower cepstral current system exploit tempor structur sourc reason dynam inform exploit network essenti independ statist inform current model error rate hybrid system lower system network train oper train network improv perform combin train experi improv expect optim network train regim input preprocess result present serv establish lower bound potenti util prosod variabl restrict case languag discrimin perform network discrimin pair languag base featur network learn extract automat input variabl encourag rel success comparison accord current estim similar differ languag emploi experi found serv distinguish group correspond neatli tradit class effect discrimin spanish prove ineffect separ success inton phonolog mandarin differ pitch accent mandarin emploi lexic tone extrapol directli knowledg phonolog system avail discrimin featur speech signal exploit network work progress extend current experi languag ogi ts languag extent languag cluster class base inton rhythmic consid distribut prosod properti acknowledg cambridg engin depart provid pitch tracker program work fund grant refer prosodi languag cognit rhythmic coordin english studi phd indiana technic report indiana cognit scienc program rhythmic constraint english stress time fourth intern confer spoken languag page alfr delawar rhythmic constraint stress time english journal journal automat languag identif approach european confer speech commun page automat languag identif journal acoust societi diploma technisch universitat munchen long memori neural spoken languag discrimin speech fundament frequenc intern confer spoken languag volum page japan spontan speech languag identif knowledg linguist intern confer spoken languag page japan techniqu trim fat network relev assess advanc neural inform process system page san morgan kaufmann ogi telephon speech corpu intern confer spoken languag process canada tone structur linguist inquiri monograph mit ma acoust analysi phd colleg london speech rhythm english experi speech cycl phd indiana prosod cue automat languag identif intern confer spoken languag volum page pa languag identif phonem recognit languag model intern confer signal page
ML/318 6 class imag retriev distanc david jacob yoram nec research institut inst comp scienc inst comp scienc independ hebrew hebrew nj usa israel israel abstract kei problem vision understand set label imag classifi imag classif system model human robust imag match make similar judgment triangl inequ exist pattern recognit techniqu applic note method appli natur wide class similar function kei find method good repres class accur show exist techniqu find class repres deal dataspac focu develop techniqu solv show distanc imag good measur imag repres space vector correl distanc imag imag show boundari point captur structur class euclidean space suggest atyp point import describ class demonstr import idea learn gener experi improv perform synthet real imag paper base imag retriev base ieee intern confer comput januari learn jacob vision research hebrew partial support darpa arl contract research dw sabbat nec research institut introduct avail larg imag make classifi imag queri identifi class object scene build class imag approach problem domin comput pattern recognit cognit scienc parametr compact gener attempt captur essenti class prototyp list essenti set geometr surfac delin set imag belong encod neural net exampl store compar directli imag work approach assum imag thought vector compar similar euclidean distanc valid assumpt number recent approach comput vision compar imag measur similar fact obei triangl inequ occur triangl inequ difficult enforc complex match algorithm statist robust research psycholog suggest human similar judgment metric question extent exist work classif appli complex model comput vision cognit model problem illustr fig show boundari distanc comparison metric manhattan euclidean distanc distanc turn applic string collabor filter custom match store retriev imag data base fig show output algorithm judg similar silhouett object seri label pictur common object fig identifi silhouett base similar review discuss typic lead distanc figur voronoi diagram point left manhattan distanc min distanc point jy min distanc jy min distanc illustr behavior median distanc higher dimens region plane closer point shown dark closer light grai paper make contribut problem show exist classif method encount difficulti appli similar function show approach modifi rang similar includ commonli make minimalist assumpt imag set comparison algorithm input raw imag return similar choic class classif base nearest neighbor approach nearest neighbor classif repres imag select class imag classifi nearest neighbor repres exist method select repres member class repres nearbi imag chosen close show techniqu space show prefer pick imag imag similar distanc imag demonstr analyt condit strategi show effect rest paper organ section discuss distanc method choic exist work classif handl case section describ approach organ imag section describ concret compar algorithm simul real data section discuss possibl relax assumpt paper build parametr learn algorithm suit specif distanc challeng distanc distanc import work motiv work imag similar suggest practic psycholog valid measur similar note author phrase impli rank order distanc standard mathemat distanc pair metric triangl interest space condit fail failur symmetri scope present paper distanc function robust outlier extrem noisi data typic violat triangl inequ group function famili imag comparison method match subset imag ignor dissimilar huttenloch perform recognit motion track compar point set hausdorff distanc fix fraction point distanc minim dissimilar part method robust imag point call method median distanc distanc vector repres defin jx jg oper return order differ vector relat robust identifi outlier weigh lead distanc suggest robust imag match distanc vector defin jx euclidean manhattan distanc distanc shown fig affect extrem differ euclidean robust outlier figur graph properli cost function rise quickli extrem valu domin total cost reason distanc imag distanc output complex obviou ensur triangl inequ hold jain al perform charact recognit imag comparison deform templat match scheme yield distanc symmetr obei triangl inequ relat elast match method wide wai lead metric distanc show contradict exist forc method obei triangl inequ goal desir deform templat match figur judgement visual similar imag violat triangl inequ interest imag comparison method model human vision desir applic work psycholog suggest human similar judgment tverski al show seri studi human similar judgment violat metric judgment symmetr korea similar red china similar north triangl inequ rare hold follow triangl similar russia impli similar figur visual analog observ find similar person person observ determin dissimilar person great dissimilar shape violat triangl inequ occur compar imag focu portion pai attent region great dissimilar comput vision system attempt faithfulli reflect human judgment similar apt imag distanc function discuss exist method suitabl deal distanc paper specif focu problem classif space import distanc work classif consid case train dataset consist point euclidean norm linear discrimin analysi neural network hyperplan found separ label point point set method minim linear span base method radial basi function pca method discuss section approach requir modif appli classif space note contrast good deal work learn applic space earli stress import brand cluster base space cluster method base graph partit physic model suitabl cluster work directli address issu cluster classif data paper assum comput distanc imag map imag vector vector space simpli construct parametr descript linear separ exemplar base method face repres class element train set attempt construct object space nearest neighbor method classifi item belong class item train set closest comput nearest neighbor space brute forc comput distanc test imag element train set shown improv nearest neighbor method repres object distanc appli support vector machin result vector approach result impract space time requir store requir explicit comput distanc time complex high similar function comput vision requir comput techniqu speed nearest neighbor classif method build tree structur reli point ly euclidean metric space heurist approach time space complex nearest neighbor classif algorithm metric space potenti applic space algorithm select subset origin train class small correctli classifi remaind train discard hart iter algorithm initi repres continu add element train set correctli classifi repres remain train element correctli classifi krishna algorithm explicitli attempt add repres set point nearest boundari fukunaga iter attempt optim measur distanc repres set approxim distanc full train set dasarathi explicitli search smallest repres set correctli classifi train set discuss algorithm show experi section dasarathi note element ad repres element class correctli classifi closer repres element element class greedi algorithm repres set augment step train element correct classif largest number element correctli classifi basic step subsequ step refin repres practic found import algorithm explicitli reli distanc obei triangl inequ discuss section problem appli exist algorithm discuss basic wai resolv problem approach goal develop method select subset train classifi imag nearest neighbor subset goal find subset train set minim error classif repres subset train data nearest distanc data item approxim nearest distanc train set repres set maintain gener function dataset basic distanc design understand imag good substitut answer question distinguish approach previou work nearest neighbor metric space begin answer question implicit previou work denot arbitrari element train denot imag classifi denot distanc metric triangl inequ distanc bound differ imag substitut provid inform relationship observ inform distanc datapoint decid presenc train set make superflu imag similar distanc unseen defin redund imag probabl small arbitrari imag section make gener point independ measur redund imag section specif function form measur idea requir outlook previou algorithm exist method focu repres point boundari class boundari point import retain repres metric space influenc boundari class region class main intuit import retain atyp exampl train set boundari point imag imag dissimilar imag chosen repres class atyp point import retain repres point repres big effect boundari space domain illustr point simpl domain vector domain min distanc min distanc good robust goal demonstr idea appli median distanc higher dimens relev geometr structur voronoi plane region point nearest neighbor fig show distanc produc complex voronoi diagram metric distanc fig illustr complex structur class distanc figur voronoi diagram set point squar distanc function left manhattan median distanc region point closer class cross shown region closer class squar shown white fig show simpl illustr potenti distanc imag measur interchang repres class top show voronoi median cluster point point plane label cluster nearest neighbor consist point upper shown black close median euclidean distanc upper shown black separ distanc median point divid bottom class class figur cluster label point voronoi diagram median distanc voronoi diagram result repres class chosen repres import pick repres bottom group top group illustr bottom figur show voronoi diagram produc repres bottom figur show voronoi diagram result choic produc voronoi diagram faith true exist algorithm handl situat element correctli classifi point prefer regard nearest class judg boundari point cluster split distinct directli reflect distanc distanc boundari cluster detect subgroup cluster natur redund element small distanc element notic differ import classifi imag boundari similar repres subset domain distanc lead boundari cluster median extent imag similar distanc imag good predictor interchang class distanc boundari point plai weaker role determin import part boundari space metric space result illustr clear extend higher dimens correl distanc decid imag substitut class primarili interest similar distanc imag interest estim redund imag probabl small arbitrari imag compar method estim distanc correl distanc train set section show euclidean distanc classif imag distanc excel indic imag substitut section show robust distanc median vector correl reliabl estim redund similar fail euclidean distanc predict redund appendix show euclidean proxim point impli larg redund denot train point euclidean space assum denot test denot distanc appendix show distribut test data probabl greater jd jd describ form densiti provid approxim imag proxim predict fool special distribut test case fool train sampl odd distribut test reli specif estim correl distanc predict reli disadvantag disadvantag similar distanc train set noisi train set atyp lead inaccur predict long test set sampl symmetr distribut distanc point perfectli predict similar matter sampl train set advantag redund euclidean space train test set learn bia train predict perform test set distanc predict redund case median distanc show imag pair separ smaller distanc necessarili redund higher show median unlik euclidean distanc imag monoton relat similar imag describ condit hold median distanc coordin differ small amount ffl half coordin ident rest larg amount oe median distanc median distanc median closer farther point distanc differ ffl point similar distanc case similar coordin determin median special configur oe point remain coordin special case point oe jd jd small tini fraction test point show distanc point fact arbitrarili poor predictor futur distanc similar closest pair point pair similar distanc point median distanc vector correl good predictor futur distanc similar imag test set distribut imag train set small part data space sampl long sampl includ point share half coordin fewer half distanc vector redund distinguish spite fact distribut train set distribut test set distanc vector correl predict futur distanc complet area dataspac discuss shown euclidean distanc past distanc redund distanc excel indic imag substitut robust pictur complet case obtain reliabl result past distanc redund comparison algorithm draw insight produc concret method repres class nearest neighbor classif describ algorithm section describ seri simul compar algorithm condit section describ comparison algorithm real data set class silhouett descript algorithm compar random select boundari repres atyp select correl appli idea discuss class space algorithm select repres set exampl size describ word cover denot class imag cover repres correct classif random class comput randomli exampl algorithm select class perform simplest algorithm boundari class comput comput approxim minim cover size greedi algorithm size add boundari point furthest algorithm detail appendix part algorithm resembl iter dasarathi algorithm subsequ iter found significantli affect result captur essenc algorithm class implement ignor import differ address issu comput differ relev atyp class comput comput approxim minim cover size greedi algorithm size add atyp point necessarili furthest algorithm detail appendix algorithm test class boundari fail captur import class point repres set includ class select base import comput observ space distanc datapoint argu comparison distanc point measur datapoint implement test idea compar datapoint simpli measur vector distanc correl datapoint distanc vector vector distanc train point vector distanc train measur correl datapoint statist correl coeffici futur investig measur oe oe denot oe oe denot standard deviat explor wai correl datapoint version significantli effici previou requir comput correl datapoint version requir comput correl datapoint class version perform roughli test simul real version prefer subsequ discuss result version version repeat atyp select algorithm distanc datapoint correl version class comput greedi point maxim vx combin measur distanc cover correl datapoint defin vx vx maxim correl point nx number point cover algorithm detail appendix note algorithm repres combin nx measur point cover uncov point term atyp point rel chosen point simul compar algorithm simul data repres datapoint chosen vector cluster randomli datapoint studi structur data affect perform simul point class form small cluster data vector space center cluster chosen randomli class member chosen spheric normal distribut spread chosen center point class cluster class member vari wide dimens class center cluster chosen randomli class member chosen spheric normal half coordin arbitrari total center irrelev point class cluster class member vari wide small number dimens fix class center cluster chosen randomli class member chosen normal distribut spread chosen half point chosen spheric normal half point chosen elong ellipt normal distribut case robust distanc case robust method good perform simul distanc euclidean median note middl violat triangl inequ bound constant scale median distanc arbitrarili violat triangl inequ appendix test datapoint randomli chosen uniform distribut test datapoint classifi base repres comput algorithm section test success method base data base chosen give result algorithm attach score percent percentag test datapoint score success simul block repeat block gather statist variabl percent correct standard fig summar repres result simul note test data distribut train set uniformli distribut test estim volum differ voronoi diagram produc complet set repres subset test real data test method real local curv match algorithm curv match algorithm design compar curv return distanc step algorithm automat extract featur point high featur match dynam program effici final distanc median distanc algorithm due noisi select featur final median step test imag set includ imag similar car point view set includ imag cow point includ occlud imag origin imag shown fig contour cow automat shown fig contour car class shown fig imag test contour extract imag shown fig cow obtain viewpoint viewpoint algorithm section comput repres set contour class compar classif test data base classif obtain data result correct fig discuss result fig algorithm perform significantli algorithm distanc euclidean perform similar compar boundari atyp method boundari method perform significantli random select repres median distanc distanc fig repres case data lack structur class entiti close separ median euclidean correl atyp boundari random median euclidean percent correct correl atyp boundari random median euclidean correl atyp boundari random median euclidean percent correct correl atyp boundari random median euclidean correl atyp boundari random median euclidean percent correct correl atyp boundari random figur simul data chosen plot valu percent correct error bar give standard deviat calcul repetit graph give percent correct score algorithm section random boundari atyp base correl plot distanc function data chosen normal distribut data chosen normal half datapoint coordin significantli differ distribut center data chosen concentr normal spheric elong ellipt figur real data test exampl class cow contour exampl class car contour exampl set test contour exampl real imag contour obtain method compar perform make distanc function euclidean random select perform significantli score lower differ worth addit result real data shown fig confirm correl method perform method boundari method slightli random note atyp select algorithm show result comput atyp base perform notic algorithm mention show result comput cover atyp perform approxim algorithm shown summari result simul real data demonstr advantag method exist method classif data dataspac metric space column fig class lack structur method exist method gener good rep rep random boundari atyp correl figur result real graph give percent correct score algorithm section random standard deviat perform boundari atyp base correl number repres chosen algorithm limit perform natur data distanc function priori note random method perform provid criteria point select repres set import hidden advantag principl method random correl method threshold determin point select parametr method consid method nearest neighbor classif natur suit learn distanc function black box parametr method success euclidean space section extens parametr method data distanc start relax assumpt distanc function black specif distanc parametr method typic repres object vector repres class boundari space geometr construct probabl distribut limit number paramet simplest popular parametr method hyperplan separ class consid distanc function black construct object hyperplan simpli wasnt consid distanc defin featur vector robust median fig linear discrimin hyperplan separ inappropri linear discrimin class euclidean space effect class repres prototyp simpl observ linear discrimin perform nearest neighbor classif respect point prototyp exampl repres separ hyperplan perpendicular line connect point locat obviou gener linear discrimin space prototyp exampl nearest neighbor classif network radial basi natur gener seek prototyp instanc class perform nearest neighbor classif distanc function space optim prototyp defin point vector space nearest neighbor classif distanc produc correct classif train set find optim prototyp distanc includ prohibit demand simpler approach repres class gener euclidean centroid point sum squar distanc class member fq minim data vector space correct distanc distanc natur extens repres class point sum distanc class member minim show exact featur repres point element class discuss close relat proof minimum obtain featur determin separ complex median featur obtain total complex featur determin mixtur dimens vector space effici algorithm find element distanc point replac centroid space valu mean desir properti data compress illustr result concret corel larg commerci imag categori distanc function proven effect determin similar imag corel make prototyp desir repres imag vector number describ gener imag color euclidean euclidean comput result found comput percentag imag class closest euclidean distanc prototyp result exist featur distanc euclidean distanc prototyp comput euclidean column centroid comput distanc function comput distanc item cluster prototyp result obtain distanc correct centroid distanc prototyp perform absolut term depend data cluster distanc deriv simpl featur rel perform method reveal advantag prototyp comput distanc minimum separ minimum comput featur separ minimum featur equal featur point import distanc function gener ham vector distanc number featur vector distanc assum experi artifici object investig human categor object recognit agreement prototyp distanc comput definit vector featur common featur comput independ featur feel paper make main contribut reassess relev exist classif techniqu classif argu classif system model human robust match method typic success make similar judgment obei triangl inequ exist pattern recognit techniqu relev appli natur wide class similar function kei appli method set find method good repres accur develop techniqu solv show distanc imag good measur imag repres space suggest correl distanc imag imag show boundari point captur structur class euclidean space suggest atyp point import describ class demonstr import idea greatli improv classif result synthet real imag suggest wai appli parametr techniqu learn problem involv distanc function shown gener idea linear discrimin function space shown classif centroid class determin specif distanc distanc predict redund euclidean space appendix show euclidean proxim point impli similar distanc point denot train point euclidean space assum denot test denot distanc random probabl similar jd jd address question divid space disjoint jd jd jd jd show reason distribut notat definit illustr fig loss gener assum lie plane point defin ij line connect defin ij hyperplan normal ij pass point ij equidist note gener intersect plane common note ij describ set point equidist ij intersect plane line ij gener intersect plane point equidist point equidist li defin coordin system origin simplifi compact subset euclidean consist huge center origin parallel collinear intersect point infin project plane handl manner similar reason explicitli loss assum distanc lie unit circl defin axi line bisect intersect plane coordin loss gener fact closer impli triangl form defin angl triangl angl vertex angl vertic fig hyperplan ij divid space point nearer complement hyperplan divid space region region defin note plane region triangl shape vertex bound line meet circular arc boundari space wedg space defin intersect bound bound note angl intersect angl volum rel volum compact note directli definit closer divid depend closer note law fact note impli impli volum consum half space lower bound rel volum prove volum consist half space sampl space uniform distribut distribut symmetr definit illustr fig moment defin note equidist defin point point circl li smaller portion circl note li angl greater region angl occupi half complet proof case li proof consist show limit volum half space show move volum grow case symmetri space divid evenli defin sign coordin impli symmetr hyperplan normal axi rel volum defin region defin region similarli defin ij show geometr start order hyperplan line intersect plane specif order angl line make give order fig defin pass midpoint normal vector point divid space point closer closer fig perpendicular vector connect perpendicular vector connect lie bound region li complet insid subsequ point region bound ly case show note impli case impli impli shown similar reason show reason assum similar argument show true prove half space test point sampl uniform distribut compact closer probabl larger provid substitut remain true test point sampl distribut spheric symmetr euclidean distribut assign region probabl larger rel volum detail descript algorithm boundari class comput repres set exampl size comput cover ffl set repres exampl empti ffl set exampl incorrectli classifi datapoint comput number point closer point class number point cover find largest denot group point closer class point cover ffl ffl cg size smaller return add boundari size smaller comput ffl distanc nearest datapoint class ffl distanc nearest datapoint repres set ffl find produc largest ffl cg atyp class comput repres set exampl size comput boundari algorithm add atyp size smaller comput ffl distanc nearest datapoint repres set find obtain largest ffl cg select base class comput repres set exampl size ffl set repres exampl empti ffl set exampl incorrectli classifi datapoint comput ffl number point closer point class ffl corr maxim correl point ffl find obtain largest denot group point closer class point cover ffl ffl cg size smaller threshold return bound triangl inequ distanc defin satisfi triangl point denot vector connect denot vector connect jx jx jy show exist triangl inequ jx jx jy concav inequ jx jy jx jy jx jy jy jy jx hold inequ worst equal case assum vector compon odd vector odd compon note smaller larger bound metric work benefit inspir discuss grate liz figur refer similar deform vision robust estim multipl parametr flow comput vision imag understand data analog pott advanc neural inform process fast greedi distanc cluster algorithm discov themat structur larg data mit media lab tr bayesian relev feedback imag int conf consist set identif optim nearest neighbor system ieee transact man imag decomposit ieee conf comp vi pat algorithm find match logarithm expect acm transact mathemat syntact match european confer comput june nearest neighbor rule concept mutual nearest ieee tran inform proxim nip data ieee transact pattern analysi machin comput robot vol publish nearest neighbor ieee tran inform elast model charact data cluster determinist ieee tran pattern analysi machin imag hausdorff ieee transact pattern analysi machin object complex int conf comput handwritten digit deform kim regress method comput int comp vi learn scientif solut inform theoret problem journal mount algorithm learn real macmillan publish ny queri imag script recognit elast ibm journal develop ieee tran pattern analysi machin psycholog object submit structur algorithm nearest neighbor search gener metric proc annual symposium discret handwritten charact recognit person comput ieee transact consum electron figur illustr definit text
AI/319 2 servic distribut inform infrastructur van andrea abeck german research center artifici intellig knowledg manag group po box germani abstract ontolog emerg paradigm support intellig servic distribut inform expert system context design middlewar realiz distribut organiz memori examin question servic provid middlewar compon discuss basic dimens inform fundament impact ontolog share scope inform short discuss techniqu suit find balanc dimens lead role actor om scenario describ role respect oblig actor class relat compet candid defin agent speech standard servic om middlewar ontolog distribut organiz memori knowledg manag wide accept ontolog explicit specif conceptu provid mean facilit access knowledg typic util scenario discuss search inform access inform commun applic ontolog serv form share import km calli deal scenario vision knowledg manag assum acquir store formul organiz memori support vision foster util explicit knowledg om ontolog provid vocabulari inform inform resourc technic support organiz memori base central approach complet inform consid framework figur problem heterogen inform sourc tackl introduct uniform knowledg descript inform item annot knowledg descript base domain ontolog central view distribut inform landscap built central view util inform process retriev mechan proactiv deliv relev inform current process context applic layer project extend central framework distribut om scenario motiv drawback central neglect advantag distribut natur knowledg respect develop imposs obtain global negoti vocabulari om benefit balanc local result global knowledg view higher level central approach cumbersom chang environ ontolog domain ontolog inform ontolog process support inform process retriev content classif meta structur descript applic layer knowledg access knowledg ¢ descript £ sourc layer figur om framework chang due reorgan structur om system typic establish introduc step step term time place manag om cooper integr scalabl framework om technolog support type vertic scalabl describ abil evolutionari growth integr servic order meet addit requir applic level incorpor addit legaci system sourc layer extens chang underli ontolog knowledg descript layer horizont scalabl mean cooper independ introduc om exist separ om depart custom relationship order product inform depart commun mean om horizont integr commun cooper system layer cooper inform gather intellig inform integr exampl horizont om integr knowledg access layer organiz workflow approach facilit integr applic level ¤ type cooper om actual ad hoc configur virtual similar view system consequ examin inform landscap actor inform provid inform consum mediat inform agent strong establish share understand actor remaind paper organ section encourag view dimens inform fundament impact km share scope origin examin om balanc cost benefit make system scalabl maintain role model agent om base section suggest orient analysi natur step gaia methodolog manifest organiz view applic scenario section show role embodi framework distribut organiz memori conclud paper sketch applic show suitabl approach inform om definit identifi import dimens inform analyz interact sketch techniqu cope complex result interact dimens inform km inform system respect explicit design dimens inform level stabil contact person specif concern perman sourc function call knowledg contact person time call contact person assign share inform share group individu publish aim individu note design team develop share understand product develop knowledg inform share larger group group inform highli formal formal busi process model rule expert inform text formal inform meant desir identifi inform high end stabl inform wide share inform organiz formal inform basi power autom servic techniqu develop enabl transit dimens order util optim knowledg manag detail understand interact requir interact likelihood share scope enabl constrain requir facilit stabil formal requir figur share formal inform om describ dimens share scope mutual influenc figur formal reach high level formal requir high special train personnel process formal time ambigu lead high cost charg applic period formal order magnitud longer creation durat stabil domain formal preval extern determin factor formal chosen expect stabil inform deliveri architectur ontolog inform inform structur descript inform item type ontolog creation intend applic domain ontolog content descript princip ontolog ontolog differ stabil vocabulari structur describ inform essenti constitut book expand monoton contrast domain ontolog live topic knowledg acquir respect conceptu ad conceptu longer stabil ontolog resid extrem chang organ time time fix ontolog deep result merger domain ontolog predominantli weak formal concept appli maintain automat support inform ontolog logic languag rich express power detail analysi expect ontolog life cycl power guid achiev optim level formal term cost benefit stabil share dimens tend tradeoff agent share break commit form basi ontolog conceptu share coupl stronger environ enforc shift ontolog larg share scope account negoti process facilit timeconsum high stabil result ontolog desir stabil artifici achiev exclud group agent negoti dictat ontolog result bad accept group poor perform entir system share scope relat share scope formal subtl explicit conceptu mandatori share agent detail understand ontolog commit made common interpret misunderstand applic predetermin formal specif hurdl potenti agent particip share process formal train peopl main user exclud negoti commit accept inform system ontolog highli train design formal languag account train user comprehend implic system proper inform www search engin low larg share whilst power retriev mechan common formal prerequisit inhibit wide scope highli train agent techniqu modul balanc concret inform system design space span monitor analyz util ontolog feedback search monitor outer world provid hint ontolog order organ complex negoti process larg make specif role area role enact human machin agent commun achiev mutual understand gener power discuss negoti servic requir formal transit subject field research classic knowledg engin method tool transit contribut transit basi text document inform document analysi comput linguist methodolog tool support design maintain km ontolog lifecycl element area describ ontolog servic domain ontolog provid framework role actor analysi natur step gaia methodolog design section perform analysi respect actor om order describ actor deal domain ontolog actor oper regularli chang environ react goal object achiev actor knowledg respect relev realm object respect goal abil perceiv manipul environ intern state abil commun actor import knowledg exchang negoti agreement lead distribut task knowledg goal subset compet describ actor read manipul inform grant actor oblig subset compet describ actor expect due commit consequ complex negoti procedur role dimens knowledg level descript newel reflect actor distribut om form accumul oblig basi figur taxonomi role relat actor coordin negoti process creat share understand figur show taxonomi role ontolog actor distribut organiz memori set actor om role respect specif ontolog form ontolog societi distinguish ontolog provid consum ontolog provid attend provis ontolog servic expert answer queri relationship acquisit mainten domain ontolog util domain ontolog order execut specif find knowledg annot group actor typic goal respect ontolog consum interest complet sound ontolog regard specif mainten servic global view claim properti ontolog group ontolog consum distinguish activ passiv user passiv user improv ontolog claim respect ontolog servic associ necessarili contribut ontolog special qualiti requir notifi ontolog partner commit support improv domain ontolog consum provid editor domain partner special import main sourc inform util ontolog final hand tabl summar oblig user group domain ontolog typic ontolog oper briefli sketch compet state tabl actor queri ontolog servic properti domain type concept natur languag descript concept relationship concept concept ontolog copi ontolog valid receiv actor passiv notifi valid ontolog inform hold longer suggest member contribut improv ontolog partner commit activ push ontolog evolut answer answer queri central task ontolog servic actor attend task call ontolog expert editor ontolog answer queri oblig editor modifi retract ontolog proposit qualiti forc follow suggest order obtain high accept ontolog editor suggest editor coordin complex negoti procedur actor conceiv send updat editor oblig respect notifi activ user case appli basic compet join ontolog societi chang role societi applic editor editor grant respect oblig negoti user passiv associ partner user user user expert editor queri receiv updat suggest updat answer queri edit send updat notif appli role grant qualiti tabl oblig ontolog actor grant valid time event user enter ontolog societi editor obtain high qualiti domain ontolog aspect qualiti formal properti sound complet good ratio acquisit cost benefit qualiti frame time interv constraint compet group ontolog compet queri answer queri phase ontolog typic actor settl knowledg access level retriev agent exploit ontolog knowledg achiev higher recal present result inform consum ontolog expert relat concept ontolog compet negoti ontolog updat retriev agent role partner user ontolog societi realiz inform consum inform term defin ontolog retriev agent suggest ontolog editor introduc concept ontolog editor coordin negoti procedur activ ontolog user ontolog actor join leav ontolog societi chang role passiv user order make role actor inform content ontolog oblig affili ontolog societi complex negoti procedur potenti ontolog user editor grant deal domain ontolog actor scenario role ontolog servic editor domain ontolog associ respect ontolog ontolog weakest role straightforward integr extern sever commit oblig made domain ontolog framework introduct argu vertic scalabl horizont scalabl om respect domain ontolog servic requir facil ad domain ontolog om access ontolog servic om ¥ knowledg descript queri suggest updat om local ontolog agent expert oa suggest updat updat notif local ontolog agent partner user ¥ knowledg descript figur sampl framework instanti oa coordin om local domain ontolog agent domain ontolog similar knowledg ontolog initi negoti procedur type ontolog domain ontolog agent distribut domain ontolog agent agent ontolog distribut domain ontolog agent locat om facilit commun task mation integr map easier sourc formal inform typic question subconcept concept answer question om concept structur embrac inher distribut natur knowledg conceptu share actor ontolog societi form respect relev domain addit infrastructur enabl commun ontolog societi imagin group domain domain group negoti domain ontolog manag identifi point contact overlap result common level ontolog map part ontolog term role outlin ontolog oblig ontolog expert ontolog editor associ partner user ontolog vice versa concept ontolog societi find reason share scope portion knowledg common understand figur illustr idea om instanc respect ontolog agent maintain local editor respect local ontolog inform retriev inform extract agent om partner user exploit ontolog knowledg perform servic suggest ontolog updat wrong answer bad perform mismatch formal ontolog evolut real world local ontolog agent decid accept updat suggest chang local agent activ ontolog notifi global ontolog agent notifi order adapt map rule case local ontolog plai role partner user respect global suggest chang global ontolog specif fax cal radic reflect updat structur outlook paper role actor om scenario respect oblig ontolog societi role descript specif definit agent speech standard servic om middlewar project implement middlewar basi agent platform analysi fipa specif show platform good infrastructur realiz concept present strive develop field knowledg distribut inferenc servic account specif requir inform landscap level depend role suitabl approach test applic scenario realm knowledg manag nuclear power engin knowledg typic distribut site oper power public global view obtain knowledg requir process critic procedur transport nuclear materi border state inform infrastructur stakehold knowledg view sphere hand defin zone negoti cooper hand facilit knowledg manag delic environ acknowledg work support german ministri educ iw project framework distribut organiz european commiss project deliveri sensit organiz refer technolog organiz memori ieee intellig van framework distribut organiz memori mileston requir analysi system architectur dfki document dfki march maurer special issu knowledg manag organiz memori int journal inform system frontier develop multi agent system agent framework softwar practic distribut intellig paradigm knowledg manag aaai symposium bring knowledg busi process menlo march domingu edit ontolog web fipa abstract architectur specif fipa ontolog servic specif fox model ai fall gain editor workshop knowledg model manag knowledg scienc apr gruber role common ontolog achiev reusabl knowledg base intern confer principl knowledg page san april morgan kaufmann publish gruber principl design ontolog knowledg share intern journal swartout enabl technolog knowledg share ai newel knowledg level artifici ai knowledg knowledg base ontolog ieee intellig van system share knowledg manag fensel knowledg model european page springer editor workshop ontolog fensel knowledg principl method data knowledg kinni gaia methodolog analysi design journal autonom agent
HCI/320 4 code mobil xml wolfgang £ anthoni finkelstein dept comput scienc colleg london london uk abstract demonstr xml relat technolog code mobil overcom restrict exist approach fix granular mobil enabl complet program individu line code network defin concept increment code mobil abil migrat replac code fragment remot program combin increment mobil achiev unavail flexibl examin applic increment code mobil varieti includ user interfac applic manag mobil thin manag distribut document keyword increment code xml technolog introduct popular java spread technolog contribut grow interest dynam reconfigur distribut system architectur reconfigur achiev code transfer fragment code host potenti mobil rang start simpl data inform transfer exampl actual paramet pass remot procedur call web page return request http protocol level code mobil migrat execut browser load applet class remot server common exampl code mobil java rmi java virtual £ author support dip di scienz università di itali built web offer mobil granular class level telescript obliq java base mobil code languag system mobil agent code data move consid highest level mobil achiev logic context applic domain flexibl approach code mobil achiev java mobil agent gener flexibl requir result low network bandwidth scalabl bandwidth server gsm mobil phone cope download larg amount java byte code server scalabl requir applic thousand client sync task intens distribut multipl processor processor instruct flexibl paper show achiev mobil approach base java demonstr unit mobil agent class level individu statement support increment insert substitut possibl code fragment open applic area code mobil manag applic mobil thin wireless connect person digit assist user interfac construct document manag work build formal foundat code mobil establish paper develop theoret model mobil level singl statement variabl argu potenti code mobil capabl commonli languag code java share vision focu implement mobil standard wide technolog identifi mobil code design concept independ technolog embodi wai technolog extens markup languag exploit achiev code mobil level xml design code interest relat code migrat paper structur section discuss relat notabl altern approach logic code mobil section show xml support definit languag increment code mobil defin xml section argu increment code mobil potenti set applic area user interfac manag applic mobil thin consist manag distribut document give exampl applic approach domain section demonstr implement mobil code system support xml product section evalu approach identifi strength weak section summari work futur work overview xml logic mobil physic mobil concern physic movement mobil phone wearabl comput logic mobil abil transfer data code host network paper logic approach applic inform transit physic mobil section discuss work appli manag applic deploi pda logic mobil encompass data code mobil data mobil common mechan exchang spread inform host distribut network data mobil achiev pass paramet remot procedur object request put oper file transfer protocol introduct internet web hyper text markup languag predomin format data move host internet xml basi gener markup languag internet xml subset standard gener languag unlik html xml sgml user defin set tag structur document markup tag defin document type definit dtd grammar defin syntax document xml document declar refer dtd order enabl gener parser obtain specif grammar advent format transfer data defin dtd standard encod specif notat xml exampl softwar engin applic xml includ dtd defin transfer format uml model xml public document applicationspecif transport protocol distribut system construct report xml transport data distribut heterogen compon trade system system xml document paramet corba object request omg request interfac definit languag xml address seamless interchang xml document complex valu idl data type data code mobil java support object serial class load statu object serial transfer host class load strategi depend applic netscap class loader download applet class web server html java rmi class loader applic download class object remot pass paramet run time class move object migrat host fetch remot server technolog built top simpl mechan sophist mobil code paradigm classifi remot evalu mobil agent remot evalu proactiv ship code remot host execut mobil agent autonom object carri state code proactiv move network system develop support mobil agent agent mobil requir migrat code state agent time move proactiv perform task behalf user increment code mobil xml xml flexibl approach describ data structur show xml describ code xml dtd similar attribut grammar element xml dtd correspond product grammar content element defin side product content declar element sequenc element altern give express power dtd bnf context free grammar markup pcdata includ dtd defin termin symbol element xml dtd attribut attribut store constant static semant symbol tabl static type xml dtd defin abstract syntax program languag refer document time time cdata figur dtd instruct set instanc dtd xml program xml program interpret section discuss interpret construct xml technolog xml program host effect achiev code mobil order demonstr simpl program languag instruct robot languag defin paper subset reason breviti languag set primit switch robot make proce step current chang robot current direct turn object turn program languag includ number control structur repetit condit execut time statement repeat cycl command number time figur show syntax subset program languag defin xml dtd figur show instanc dtd figur system figur xml program final posit initi posit figur action robot instanc xml program instruct turn proce turn left proce step rout shown figur imagin real instruct control host send xml program radio achiev logic code mobil xml unlik java compil xml program transfer sourc code interpret remot host unlik xml confin send unit xml document begin root start symbol grammar enabl individu statement refer code fragment xml program increment complet program arbitrarili increment xml control slow radio avoid program increment send program increment figur show finegrain program increment imagin chang behaviour replac statement increment chang behaviour make turn left determin root symbol increment time full xml program figur languag primit turn implement turn turn left time time system figur xml code increment figur xpointer address increment question insert replac program increment address locat html document achiev defin user control document includ author document sender increment control program assum programm identifi anchor label increment code insert replac solv standard xpointer part xlink specif overcom limit html support navig xml document navig capabl address document compon modifi document xpointer identifi compon exist xml program replac increment back figur show xpointer express determin program statement replac xpointer express start root program select statement type statement select statement fragment program xml xpointer express increment code mobil figur show behaviour differ increment replac statement applic section present idea simpl describ applic domain benefit increment code final posit behavior initi posit figur increment chang behaviour mobil xml includ user interfac manag applic portabl digit flexibl consist check distribut document user interfac engin instal administr system thousand client potenti applic increment code mobil departur control system airlin handl good exampl larg airlin client implement user interfac system deploi thousand distribut globe machin necessarili airlin temporarili rent airport tight control updat softwar airlin frequent updat softwar instal machin accommod deploi java virtual machin system download applic central server java disadvantag requir code substanti size download possibl slow network java code chang user interfac chang limit overcom instal user interfac engin client machin interpret user interfac descript dtd user interfac descript languag markup tag java swing user interfac compon interpret document gener desir user interfac appli approach code mobil descript user interfac central server distribut client host user interfac descript small compar size java byte code full user interfac avoid problem limit overcom user interfac descript xml gener server applic increment mobil appli successfulli context displai window ad replac xml code increment user interfac engin program increment dynam integr origin xml code make window chang applic manag mobil pda interest applic approach code mobil logic mobil meet physic mobil lightweight comput person digit assist start mission critic comput integr comput environ import pda run set applic pda york stock exchang nyse equip trader trade data entri autom transmiss trade data back offic trade settl system applic market evolv rapidli analyst invent product deriv regular basi product trade applic adjust updat support trade deriv machin wire workstat feasibl transfer replac complet code increment approach paper appli approach essenti devic thin client case increment code updat valuabl disconnect pda slow irda radio network connect advantag approach applic develop script languag develop trade applic build interpret languag deploi pda applic program increment ad list updat server pda connect pda physic enter trade room establish connect server check applic pda server increment send applic updat deploi pda definit languag implement interpret sound difficult accomplish support applicationspecif languag refer modal user interfac definit implement interpret simplifi avail xml parser java virtual machin develop palm pilot oper system run gener mobil phone consist manag distribut document describ approach manag consist distribut document assum document repres xml fair offic save document xml visual ag environ xml scheme project repositori case tool export uml diagram consist manag approach base languag express consist rule languag xml program languag instanc collabor diagram class class diagram figur consist rule xml format ur show consist rule express languag rule base dtd uml demand object collabor class class diagram equal type object discuss interpret execut consist rule order check consist xml document result check rule set xlink express link consist document fragment inconsist document fragment indic inconsist approach set rule rule interpret inflex member softwar develop team work set rule central interpret rule creat bottleneck avoid multipl rule interpret machin rule interpret set rule develop check consist document produc local dedic interpret subgroup develop team order check consist document produc team member higher level rule set check consist set rule activ interpret static evolv result chang team structur xml xml doc doc xml doc consist rule xml format consist checker host xml xml doc doc xml doc consist rule xml format consist checker updat consist rule host manag host xml xml doc doc xml doc consist rule xml format consist checker host figur consist manag architectur alloc order accommod set rule activ interpret chang rule ad exist rule delet trigger consist supervisor compon approach increment code mobil pass consist rule rule interpret involv figur show architectur approach workstat group project server run interpret rule consist supervisor manag rule set consist rule activ interpret move rule increment shown xml defin program defin updat code increment fashion section describ util xml technolog order implement interpret applic specif languag interpret implement increment code updat implement approach program languag interpret languag implement show significantli xml notabl xml parser implement document object model simplifi construct interpret explain commun sender receiv achiev distribut object technolog focu implement increment code demonstr xpointer processor support locat increment dom support increment syntax tree modif interpret implement stage interpret program involv import api import parser public void string parser program parser parser read input stream program root tree program document figur translat xml program ast tion syntact correct result interpret produc attribut abstract syntax tree program program written task deleg valid xml parser valid xml parser exist figur show parser interpret code figur xml parser construct tree graphic repres figur stage interpret static semant analysi uniqu identifi correct type express interpret execut code order avoid abstract syntax tree tree visit interpret check violat static semant execut oper node repres oper ast construct xml document standard document object model implement dom oper time time figur abstract syntax tree program import dom api import xml parser class posit direct privat int privat int privat int privat boolean statu public void node figur ast interpret port obtain children queri type obtain valu node attribut figur show excerpt interpret abstract syntax tree execut statement ast node action modifi state variabl case state variabl robot switch current posit direct number item pick interpret perform method initi pass root node ast tree examin type node perform action root call execut child node node type add current direct note implement command requir line code total line java code code mobil order support code xml program remot host read local file system transfer protocol due simplic xml program pass paramet remot invoc object invok implement interpret xml program interpret understand xml program written dtd languag figur show migrat code xml document interpret figur xml program migrat remot interpret remot host order facilit remot commun transmit mobil interpret declar remot shown figur interfac implement interpret enabl control resid host send program interpret host note transfer dtd code assum dtd store local choic deriv observ interpret implement tightli link dtd grammar languag interpret depend grammar languag execut increment code mobil shown interpret pass paramet method figur paramet xpointer express xpointer express empti identifi node abstract syntax tree replac program increment pass paramet execut figur show migrat increment code strategi implement increment code mobil program increment pass paramet construct syntax tree evalu xpointer express replac node address express root node syntax tree increment replac shown figur order implement strategi increment advantag dom program increment construct ast achiev import import dtd public interfac extend remot void string throw figur remot method invoc xpointer direct xml increment xml document interpret figur increment migrat robot site full program parser creat tree root node type root type dtd case root increment node creat evalu xpointer express replac node fulli deleg xpointer processor processor figur show xpointer processor order locat node replac replac code increment shown bottom figur navig parent node replac standard dom oper substitut root node syntax tree increment evalu section discuss advantag current disadvantag approach hint disadvantag overcom demonstr xml relat technolog implement increment code mobil granular fix granular mobil enabl complet program individu line code network combin increment mobil achiev flexibl unavail examin applic increment code mobil user interfac applic manag pda manag distribut document code replac time time time dtd figur result increment code updat ast import dom api import ibm parser import xpointer public void string throw creat xpointer object updat locat pass xpointer interpret xpointer object node doc point throw node node parent node throw replac code figur evalu xpointer express success approach critic depend abil encod program languag xml dtd demonstr dtd suggest achiev scalabl envisag approach write xml version interpret javascript build compil translat javascript xml encod xml interpret wrap exist javascript interpret shown increment achiev replac exist fragment note overli restrict strategi shown appli add delet piec code origin program address insert point identifi fragment xpointer implement abstract syntax insert delet oper dom interfac shown figur method replac fragment code execut program simplif feasibl interfac extend oper perform ad higher level flexibl abil manipul code remot entiti present paper describ combin data code step agent mobil achiev chang dtd languag add encod posit state attribut write xml program posit initi interpret modifi order obtain inform initi initi statu correctli rmi implement migrat xml program complet independ transport long xml encod move code advantag distribut object languag report context transport protocol distribut object technolog add overhead balanc middlewar servic secur choic evalu transport technolog extrem applic scope paper increment updat code robot termin execut applic conveni appli program program execut user interfac applic good feasibl approach problem relat mainten program counter updat oper cycl languag simpl feasibl increment updat code seri issu relat access control code updat parti actual statu program perspect applic orient singl sender full control code updat corba transmit corba secur servic enforc access summari work paper present increment approach code mobil xml languag novelti approach abil send code increment resend complet updat version code java base technolog launch idea object class set paradigm commun feasibl theoret languag analyz code mobil movement granular show java point class unit possibl explor paper shown embodi set applic develop work involv secur increment updat code access authent issu render special tag defin xml java specif code displai formal notat web develop work integr dtd java fragment order updat abil interpret understand construct intend explor approach real project involv industri partner domain mention section collabor industri partner develop flexibl user interfac manag busi analysi applic intend advantag applic investig mobil phone pda applic platform provid explor increment code mobil applic manag acknowledg indebt gp picco detail comment interest suggest earlier draft paper discuss topic acknowledg support european union project refer ibm modal ibm le wood document object model level specif recommend world wide web octob rumbaugh unifi model languag user guid addison extens markup languag recommend world wide web march cardelli languag distribut scope proc acm symp principl program languag cardelli gordon mobil ambient proc foundat softwar scienc comput structur european joint confer theori practic softwar volum springer coordin model system includ mobil agent proc ieee int workshop softwar specif design page manag complex document case studi xml ieee transact knowledg data kernel languag agent interact mobil ieee tran softwar consist manag distribut document xml relat technolog research note colleg dept comput submit public finkelstein markup meet middlewar proc int workshop futur trend distribut south africa ieee comput societi jj calculu mobil agent proc int conf concurr theori volum lnc gp vigna understand code mobil ieee tran softwar rs grai agent transport agent system proc cikm workshop intellig inform dec object manag group xml meta data interchang omg model interchang format technic report ad document connecticut ma octob object manag group request connecticut ma august iso inform process text offic system gener markup languag sgml technic intern standard javasoft java remot method invoc jdk octob zimmerman java mobil agent ieee internet knuth semant languag mathemat system gener magic telescript languag refer gener oct maler xml link languag technic report world wide web march gp roman model code mobil proc european softwar eng conf volum page roman composit program abstract mobil comput ieee tran softwar robot softwar xml contact softwar jw dk gifford remot evalu acm tran program languag oct suzuki yamamoto make uml model exchang internet approach muller proc int workshop uml lectur note comput scienc cf tschudin introduct messeng languag univ moor mobil agent commun
Agents/321 1 abstract analysi design system franco zambonelli dipartimento di scienz università di modena reggio emilia itali nichola jen michael wooldridg ¢ depart electron comput scienc southampton unit kingdom ¢ depart comput liverpool liverpool unit kingdom march abstract architectur system natur view societi individu comput abstract plai central role analysi design system concept agent role role model increasingli design system full pictur paper introduc addit complet specif comput view introduct concept step methodolog system submiss workshop softwar engin franco zambonelli introduct autonom agent system rapidli emerg power paradigm design develop complex softwar system case softwar engin success widespread mass requir model methodolog support develop engin system repeat fashion attempt develop methodolog work tune specif system agent architectur lack defin extens exist methodolog exploit abstract unsuit model system gaia methodolog attempt defin complet gener methodolog specif tailor analysi design mass gaia view process design system construct comput system view multitud autonom interact entiti societi agent plai specif role agentori methodolog suggest defin structur ma term role model model identifi role agent plai ma interact protocol role involv gaia target mass agent cooper system close order deal system involv agent oper open addit abstract pattern plai primari role analysi design mass rule express global requir proper instanti execut ma structur defin specif class control regim conform order ma work effici requir pattern express predefin wide structur system system manner similar catalogu pattern wide exploit design aid applic adopt abstract lead methodolog applic wide spectrum agent system introduct abstract lead ma design paper section introduc basic concept underli agent system section introduc addit abstract extend gaia open system motiv adopt section briefli sketch abstract exploit analysi design mass section discuss relat work area section conclud outlin open issu futur research direct system agent softwar entiti exhibit autonom proactiv activ subject global flow control initi reactiv environ characterist make agent entiti deleg accomplish task behalf user person digit simpl major agent exist context softwar global behaviour deriv interact constitu agent agent exhibit social interact cooper achiev common object interact agent achiev object distinguish main class multipl agent distribut problem solv system compon agent explicitli design cooper achiev open system necessarili share common dynam leav enter system agent agent benevol trust interact dynam arriv unknown agent possibl behaviour interact metaphor design parallel distribut distribut object reli architectur deriv decomposit function data requir system achiev definit autonom proactiv behaviour constitu agent suggest applic design mimick behaviour structur human agent assign specif role system context agent accomplish autonom control interact longer express view mean agent accomplish role interact definit role posit agent perspect make design system complex easier manag tradit metaphor concurr system agent separ locu charg accomplish role fulli agent typic emb function accomplish system compon reduc point design process lead cleaner separ design dimens final advantag relat fact mass intend support control mass adopt support workflow manag team control activ internet auction ma design reduc conceptu distanc softwar system system support simplifi develop system system perspect lead gener ma depict figur simpler system view singl org agent agent agent org £ £ £ £ £ £ £ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ £ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ interact medium interact protocol agent organ environ figur system complex modular encapsul principl suggest split system complex system view interact natur agent part multipl agent plai role role agent expect cooper agent respect role agent simpli defin term specif task agent accomplish context notion role agent posit set expect behaviour accomplish role agent typic interact order exchang knowledg coordin activ concept interag interact strictli relat role agent role requir form interact fact plai role posit commit interact protocol agent interact specif protocol requir presenc commun medium agent tradit network typic enforc interact infrastructur possibl enforc interact model share dataspac enforc interact model gener ma environ agent interact order accomplish role interact occur sensor mechan enabl agent effect select portion environ portion environ agent effect determin specif current statu exemplar system illustr point sampl problem act run exampl paper manufactur ma belong class distribut problem system control manufactur process process paint pack metal hardwar control system deleg multipl agent devot control portion manufactur process assembl section paint agent control specif tool control system control specif condit assur correct process specif manufactur pipelin item pipelin metal item agent devot control stage pipelin agent devot control paint devot control proper cook control cool agent interact indirectli environ form interact protocol role agent charg ensur specif portion pipelin work properli maintain constant temperatur cool system cool item agent effect portion environ repres stage pipelin charg agent interact achiev proper global function pipelin uniform flux item pipelin global flux item exce confer manag open system system support manag intern confer set run confer process involv individu group submiss author submit paper inform paper receiv assign submiss number submiss deadlin program handl review contact potenti review number paper review expect decid submiss author notifi case produc camera readi version paper publish collect camera readi version author print confer manag problem natur lead concept system number phase process ma view made agent person involv process pc pc role plai agent reflect plai person confer requir agent interact directli environ paper review form agent directli behaviour influenc opportunist behaviour emerg applic author attempt review paper pc member deal paper expect deal natur environ ma natur confer agent extern ma occur review decid exploit person agent interact agent reli instanc review agent class explicitli design confer manag system abstract role model describ role constitut comput term term interact protocol establish posit role role model consid sole abstract base entir develop process design process defin role model number step perform analysi phase identifi expect work design phase defin kind fit requir identifi analysi phase determin compon exploit part design requir introduct rule structur pattern rule analysi phase aim collect specif requir build ma identifi basic skill requir basic interact requir exploit skill design phase decid identifi skill interact aim fulli defin role interact protocol plai system defin complet role impli earlier commit specif form analysi phase absenc complet role constraint actual respect implement execut comput respect number identif spread horizont role protocol identifi preliminari role express relat constraint role protocol case human social convent defin set implicit rule moder interact member clerk contradict ignor command compani specif convent constraint role plai clerk assum role impli member manag staff subordin global constraint easili express term individu role individu interact protocol identif import correct develop system account design defin system captur type inform concept rule explicit identif rule import context open agent system arriv possibl enforc intern coher dynam environ identif global rule system design explicitli newli agent enter posit behaviour consid express prevent rule drive design definit specif enforc rule facilit prevent undesir behaviour unknown agent manufactur pipelin stage maintain speed flow item pipelin requir easili express term global replic requir role confer manag number rule drive proper implement notabl agent prevent plai role author review paper pc member charg collect review paper constraint easili express term singl role protocol repres global rule structur role model describ role posit role model implicitli defin topolog interact pattern control regim structur role model describ term charg assign work load balanc defin structur base hierarch topolog load partit control regim exemplar structur includ collect hierarchi model term role model conceptu wrong role model defin structur design design role model deriv structur explicitli chosen structur view abstract design mass definit structur deriv specif collect analysi relat simplic applic theori methodolog start analysi phase attempt defin complet role model implicitli set structur definit structur design choic anticip analysi phase start pretend advanc commit priori prevent subsequ optim structur ma directli driven system ma automat impli softwar system mimic real ma adopt choic reason real world analysi phase highlight chang work mere presenc softwar introduc real reflect effici issu driven human adopt structur necessarili appli agent respect rule start defin structur make difficult rule respect enforc choic follow identif possibl driven manufactur pipelin natur choic structur stage pipelin directli interact neighbour refer figur stage control agent agent directli interact neighbour close mimic structur pipelin choic necessarili due natur pipelin control happen problem requir global coordin agent solv due high coordin cost system design adopt sketch figur introduc global coordin agent rc charg control mediat interact lead hierarch confer manag structur gener deriv structur confer decid adopt case confer vari structur year depend size confer attitud small confer reli sole pc member review process big confer involv extern review involv partit paper pc make pc member charg seek number review assign partit analysi phase commit system specif design ma find difficult adapt year chang analysi phase simpli describ abstract specif design produc design structur relationship obviou mean relationship exist accept stage stage stage stage figur pipelin stage stage stage stage rc figur hierarch ontolog type make concept notion wide accept militari tend academ identifi type relationship frequent occur human control identifi author structur peer identifi statu relationship benevol identifi agent share depend identifi wai agent reli peer identifi agent equal ownership delimit boundari note relationship exist role system set role give intuit type relat give formal definit semant relationship paradigm relationship agent control role control role perform servic demand control role resourc desir control relationship satisfi role control ann control bob control ann control charl ann control bob control ann peer relationship captur notion professor depart professor equal interact normal event statu relationship implic agent interact peer relationship transit benevol classic assumpt made research distribut problem solv put agent benevol agent offer servic note control ann benevol ann inclin bob bob prevent goal satisfi benevol relat reflex symmetr note benevol relat transit benevol benevol benevol benevol relat usa benevol switzerland benevol usa benevol common intern depend relationship exist agent primarili resourc restrict ann control piec bob requir inform satisfi bob depend ann fact subclass depend relat exist agent ann bob mutual depend bob depend ann ann depend ann depend relat reflex symmetr turn ownership idea delimit boundari common ownership agent belong group agent belong agent requir member ownership singleton set ownership relat relat pattern numer potenti term topolog interact control regim small subset structur time rare peculiar structur adopt specif unusu set methodolog encourag compon architectur work design develop technolog improv pattern composit interact system term extent sampl case exampl softwar design reli build applic singl piec softwar architectur area envisag similar respect wide structur avail catalogu design mass presenc definit catalogu design guid catalogu choic pattern ma pattern properli structur explicitli identifi design phase pipelin pipelin agent express pattern applic wide exploit architectur pattern tradit softwar hierarch pipelin structur catalogu pattern design reli defin system structur confer manag structur confer size tend adopt fairli singl expect methodolog make explicit pattern applic design methodolog exploit abstract introduc natur promot methodolog analysi design mass analysi phase task collect specif design comput start includ identif goal expect global basic skill requir basic interact requir skill preliminari role rule respect enforc global behaviour expect output analysi phase ol pr preliminari role system identif basic pp preliminari protocol discov preliminari ol rule worth note analysi phase committ specif structur output express independ specif structur design phase build output analysi phase produc complet specif ma design phase definit topolog control regim involv respect enforc complet preliminari role base adopt separ aspect analysi adopt specif structur insert role protocol exploit pattern basi identifi structur view output design phase specif pick tradit method object orient implement framework relat work tradit analysi design poorli suit mass fundament mismatch abstract provid effort attempt simpli extend methodolog ma inevit fall short tradit composit method softwar architectur limit applic definit mass defin interact model static compar dynam interact model defin agent model interact system compon clash perspect mass number specif methodolog recent year attempt exploit idea ma comput major work suffer blur analysi design phase defin collect role role introduc abstract system group simpli collect role toolkit approach defin simpli set role interact protocol occur role approach incorpor notion rule structur reason limit rang agent system deal gaia methodolog provid clean separ analysi design phase suffer limit incomplet abstract object analysi phase defin fulli elabor role deriv system accur descript protocol role involv implicitli assum structur priori case role analysi phase fail identifi global rule gaia unsuit model open system control behaviour work area coordin model languag explicitli address problem defin global rule rule behaviour interact agent ensembl interact occur specif intern behaviour program implement specif polici govern agent interact work defin methodolog analysi design system system auction forc agent act accord rule auction system dynam associ agent auction agent charg mediat interact make agent respect auction convent preliminari work catalogu agent pattern pattern lack perspect analysi design mass base definit pattern abstract specif methodolog ma analysi design encourag facilit pattern futur work paper number issu relat analysi design system consid view develop system process construct comput concept agent role role model import research area field system paper introduc pattern neglect current methodolog softwar fundament import plai central role methodolog introduc motiv sketch gener guidelin methodolog analysi design system center abstract work detail concept rule provid suitabl notat express expect output analysi design identifi guidelin assist design choic structur possibl support analyt method refer booch analysi design addison read fmt bm nr treur model multiag system composit formal framework journal cooper inform bussmann program control task intern confer system page ieee cs june ciancarini coordin model languag softwar integr acm comput june zambonelli multiag system coordin viewpoint intellig agent vi lnai demazeau ac rocha costa popul organ open system nation symposium parallel distribut ai coordin distribut problem solver ferber gutknecht analysi design organ system intern confer system ieee cs june ms fox organiz view distribut system ieee transact januari vlissid design pattern addison read gelernt carriero coordin languag commun februari survei methodolog rao jp intellig agent iv lnai nr jen intern joint confer artifici intellig ea kendal role model agent system implement intern symposium agent system applic ieee cs octob kinni georgeff methodolog model techniqu system bdi agent workshop model autonom agent lnai page noriega metaphor phd universitat de barcelona van dyke bock repres agent interact protocol uml omg document decemb omicini zambonelli coordin internet applic develop journal autonom agent septemb demazeau social reason mechan base depend network page agent system develop base agent pattern intern confer softwar page wooldridg nr jen intellig theori practic knowledg engin nr kinni gaia methodolog analysi design journal autonom agent
Agents/322 1 dynam reconfigur collabor problem solv marku hannebau gmd plan optim laboratori ralf humboldt berlin comput scienc depart artifici intellig laboratori abstract articl describ research effort cope found control optim todai busi process central control achiev result optim system technic secur restrict appli central control distribut control hand cope restrict entail commun overhead concept agent dynam fluent transit global local busi process control adapt current system structur evalu concept framework patient flow control berlin introduct research distribut artifici intellig gasser divid distribut problem solv multi agent system recent research border dp ma fluent global characterist exist ma time agent dp behav autonom simpli serv higher contractor problem face dp ma vice versa call procedur autonom agent pursu common goal collabor problem solv typic engin task collabor problem solv design distribut major part problem space control singl develop team inform resourc plan decid part problem assign agent global solut central control lead solut social technic secur aspect enforc distribut agent face global problem solv highest qualiti solut common goal due technic secur restrict collabor problem solv obei social aspect diminish problem complex partit entail suboptim solut vast commun overhead design distribut task alloc mechan influenc qualiti effici problem solv procedur tradit approach collabor problem solv design distribut aspect static assign role compet specif agent problem space static distribut fix set agent type approach differ modif reconfigur ma structur measur intern problem solv complex commun system automat adapt current problem structur melt split problem solv task skill step target agent term denot entiti built independ repres piec goal problem solv capabl exchang compon entiti dynam reconfigur fit current situat section present motiv view creat agent micro agent architectur flexibl gener treatment goal skill compon present special architectur fulfil demand view agent macro level involv technic infrastructur commun framework dynam reconfigur ma structur present concept realiz evalu context case studi includ assist agent person larg inform optim system berlin present achiev field conclud discuss relat work prospect futur develop agent dynam reconfigur central find optim solut global problem hard imposs due comput complex partit problem search optim solut collabor manner speed search commun coordin overhead destroi gain parallel interest solv problem solv central solver solv optim partit problem distribut agent assum solv method complet correct agent extern method correct complet agent motiv agent set present small collabor problem solv assum agent freeli reconfigur term assign problem solv knowledg skill assum global problem partit subproblem solut global problem consist set solut consist enforc constraint connect subproblem restrict solut capac constraint figur graphic sampl problem subproblem denot graph constraint denot dash line capac constraint denot solid line agent agent figur simpl constrain problem legal assign subproblem agent shown figur deriv group subproblem connect agent care solut subproblem extern connect subproblem agent denot thick line easili extern constraint commun overhead consist check extern constraint effici intern constraint target dynam reconfigur reduc commun overhead consist check reduc extern consist check step target simpl binari constraint group sophist global constraint defin subproblem typic capac constraint restrict figur intern constraint extern constraint repres fact connect subproblem resourc model introduc singl capac constraint hold capac constraint extend problem graph constraint figur show effect reconfigur step constraint assign special agent check consist connect subproblem capac constraint agent agent agent agent cap cap figur introduc global constraint introduc special agent cope global constraint complex extern consist check reduc number simpl binari constraint number commun ensur capac restrict quadrat number connect subproblem contrari number commun line global constraint linear number connect subproblem intern capac check omit reduc number extern constraint subproblem agent strategi lead special agent global commun effort reduc significantli observ agent consist commun agent agent agent commun agent agent step reconfigur multi agent system figur show result technolog call agent melt agent overtak agent care capac agent capac constraint effect reconfigur reduct extern consist check extern commun line constraint check intern agent agent cap cap figur melt agent combin techniqu assign global constraint special agent melt interrel agent method automat global problem structur find good partit problem approach approach dynam reconfigur melt agent lead situat intern problem complex solv global agent agent resolv situat appli agent split denot techniqu complementari agent melt agent split agent distribut subproblem agent make intern constraint extern main challeng dynam reconfigur adapt agent melt agent split current problem structur case commun agent decid melt reach higher global optim case high intern agent decid split reach comput risk result issu previou subsect assum possess agent technolog agent system dynam reconfigur subsect discuss preliminari design idea realiz properti agent architectur tradit program relat understood control programm procedur paramet call concret condit implement control structur procedur languag situat case autonom agent dynam complex world solv common programm advanc condit call procedur paramet criteria call extend chess programm concret criteria fix procedur control agent program implement flexibl reason process choic procedur architectur found cognit scienc claim design approach flexibl reason process appli artifici intellig research levesqu rao georgeff claim highli suitabl nondeterminist compet local inform bound ration bdi approach agent maintain model call belief true belief action guid desir repres goal intent partial plan achiev chosen goal action rel stabil intent prevent overload reason useless plan quick reaction dynam environ central bdi design desir act emerg belief agent situat heurist desir ration agent select consist goal intent pursu effici task directli correspond consecut phase process put bdi reason mean ration choic desir goal intent approach agent reli assumpt agent defin sum mental categori includ intent skill point mental categori collect mental compon repres distinct piec goal compon exchang georgeff goal consist desir mental compon mental transform mental compound belief desir social skill goal individu skill individu desir social execut intent commit select creat creat updat figur mental bdi compon transform recombin gener reason process transform passiv mental compon agent reason process differ element mental compon collect denot set subproblem assign contempl agent individu desir social desir denot agent goal intent stand individu skill social skill figur show bdi architectur agent specif obei individu implement solv subproblem sensor updat agent current belief belief desir creat assum subproblem state solv pend creat function comput algorithm creat jp cumul util function util consist predic consist set mental select function comput consist subset desir maximum util goal commit function comput algorithm select arg max subset recent intent goal maximum util intent goal goal recent includ set intent due low util inconsist reason ad individu desir chanc select algorithm commit arg max fi ji simpl intent sequenti execut order util intent execut interpret script individu social skill agent give subsect agent mental state agent melt achiev goal goal intent collect algorithm execut order interpret end melt agent empti appli agent desir belief desir inconsist definit skill orthogon inconsist agent split goal intent defin consist agent easili distribut agent consist issu design agent architectur support dynam ma infrastructur design commun cooper protocol ma infrastructur dynam commun termin problem solv call unit agent context close fipa standard agent manag agent manag agent commun languag agent commun languag figur show main space agent exist call workspac cycl arrow independ run thread dash box messag queue agent unit mental compon librari agent unit mental compon librari workspac messag transport system commun agent manag agent figur agent workspac compon librari idea workspac possibl unit agent dynam link mental compon librari intent skill compon compon agent parallel independ workspac host boundari agent simpli initi connect mental compon librari hold dynam domain depend code state encapsul compon refer dynam reassign agent melt agent simpli mean creat agent hold mental compon refer recent agent agent split distribut refer mental compon agent algorithm script extern administr constraint pg ext abstract inform constraint extern administr store set extern constraint ext ext ext ext ext end intern constraint comput local optim function find solut intern ext int int int int opt ext int inform extern constraint static asynchron solut agent invalid ext agent inform constraint administr solut assum problem solv set state optimist react asynchron inform desir monitor ad individu end technic commun cooper protocol support dynam reconfigur case collabor problem constraint subproblem intern uniqu agent extern distribut agent cooper protocol cooper protocol agent implement script individu social skill agent script describ part approach reconfigur awar cooper protocol agent script implement extern request constraint current subproblem solv problem local script shown algorithm realiz monitor mean watch accept agent solut algorithm script extern administr constraint wait messag time event trigger pg ext trigger event select fin case agent send messag retract inform constraint administr unsolv adjust state case end messag case end select case studi assist agent aspect agent exchang skill agent case studi exchang plai import role reason load balanc agent improv system perform skill import local execut faster task time invoc import agent reli remot agent advantag import agent import skill export agent present longer case studi group comput user deal person user tool cope compress format convert file recurr situat user solv rememb solv problem time gener member group rememb step group singl member motiv build assist agent exchang combin knowledg simpli skill assist agent possibl compet assist user solv problem appli combin skill deleg problem assist provid assist assist agent import model question model assist skill rememb knowledg implement tool small program shell decid wrap tool make assist skill describ extra skill descript skill descript inform skill languag descript skill precondit skill procedur descript solv problem combin skill introduc plan data structur plan consist skill plan categor flexibl chang adapt plan case thread plan linear run part distribut assist execut plan deleg problem assist assist comput distribut plan plan assist fill plan gap skill assist respect exchang assist possibl proce skill serv user plan find skill combin solv problem deleg problem assist skill import local applic remot skill invoc choic depend skill environ remot assist appli skill behalf export local assist appli import question depend skill precondit assist local environ case studi java implement languag advantag applic platform independ suffici system test window commun layer rmi underli mechan assist address rmi mean transfer java class object net skill transfer skill descript transfer mechan appoint schedul berlin research humboldt berlin gmd carri case studi cardiolog clinic europ biggest hospit cardiolog clinic consist ward capac altogeth type medic consult diagnost diagnost unit perform diagnost examin dai examin request depart clinic present problem coordin request serv unit spatial organiz distribut unit result distribut distribut control suboptim patient throughput resourc usag patient care pathwai problem tractabl workflow manag optim tradit monolith workflow manag engin scale pure measur workflow instanti ignor problem restrict inform distribut local flexibl architectur control optim request serv workflow diagnosi decid design realiz distribut multi agent run comput cardiolog clinic system call perman activ dynam alloc actor resourc diagnost cope failur emerg case technolog found agent manag commun languag set top microsoft messag queue server dcom implement languag visual visual basic ps relat work work articl relat task share effort ma research distribut constraint satisfact work topic deal load balanc agent work topic static problem problem partit result research direct construct agent interact agent technolog cooper reconfigur cooper protocol base classic contract net protocol distribut problem solver contract problem solver solut subproblem fix interchang bid award multistag negoti lesser extend protocol round negoti agent coordin resourc demand plan execut protocol influenc design cooper protocol present report approach organiz structur distribut problem solv strategi reduc commun organiz structur defin prefer agent cooper societi organiz structur identifi agent interest result agent solv process state design organiz structur complex search problem report work decker lesser lesser structur problem instanc initi work ishida al yokoo prasad al al dynam restructur agent dynam reconfigur differ approach reconfigur social structur level individu structur level agent work yokoo reli product agent architectur entail problem comput rule agent clone williamson shehori al denot reproduct similar agent place remot approach claim subsum mobil agent similar approach develop support load balanc deleg task agent idl compar approach technic side reconfigur concept present articl includ quantit reconfigur qualit reconfigur form agent type project norri norri develop architectur distribut task decomposit manufactur coordin dynam creat cluster agent system organ mediat templat clone mechan creat agent ii norri extend concept account search good bipartit constraint graph design suppli chain manag execut control ii fulli implement approach reconfigur li social level agenc individu agent parunak report result workshop implement manufactur agent workshop identifi risk level futur research topic lead individu agent architectur agent modular decomposit rate problem problem process agent rate concept present articl tackl problem show problem strongli interrel model algorithm model commonli except altern model view problem algorithm overview model algorithm buchanan buchanan author identifi basic element solv central decentr share separ search share memori termin detect agent creat collabor problem solv decentr share search termin detect due fact termin detect import dynam task time luo al present interest classif solv approach distinct approach agent care subset approach agent care subset valu uniqu approach costli comput central csp solv distribut speed agent creat solv problem approach social natur border subproblem buchanan author algorithm solv assum binari base simpl constraint import contribut solv sadeh fox al present distribut constrain heurist search identifi import characterist collabor problem global system goal satisfi constraint minim backtrack comput concurr asynchron variabl limit incomplet inform potenti major rippl effect backtrack design proper level distribut system commun address problem paper focuss combin distribut constraint propag form commun resourc distribut heurist search asynchron author introduct special resourc monitor agent job agent cooper protocol predecessor idea present articl sycara al effect decomposit characterist subject futur research classic refer work yokoo ishida introduc model simpli assign variabl node binari csp graph agent approach main contribut li develop distribut search asynchron backtrack asynchron search earlier version present al ishida reli agent care variabl newer version overcom restrict complex local problem algorithm correct complet coordin form asynchron algorithm establish static dynam order agent determin cooper pattern agent yokoo ishida cover search constraint propag assumpt simpl binari constraint restrict applic set coordin procedur influenc work field hold cooper protocol articl extend yokoo asynchron lesser lesser investig impact problem structur solv process problem gener implement ma simul base simul run draw interdepend structur solvabl provid insight random problem gener simul approach assign constraint agent assign constraint special agent kei featur dynam reconfigur ishida constraint propag techniqu filter algorithm report consist algorithm kleer filter algorithm achiev commun domain process neighbor remov valu domain satisfi constraint consist algorithm appli logic transform rule combin commun constraint inform agent domain form tighter constraint algorithm transmit abstract constraint inform concret domain variabl label inconsist weak algorithm vast amount commun domain constraint simpl data type highli special cach algorithm handl vast amount cooper protocol present logic descript pass constraint agent save commun overhead relat work present mackworth zhang mackworth distribut check abstract constraint propag facil join commun constraint intern constraint present complex result acycl constraint graph distribut algorithm discuss devil distribut version sequenti algorithm assum agent assign variabl simul behavior agent variabl check singl agent author state interest question distribut check find good alloc variabl node favor processor load commun cite investig approxim algorithm problem dynam reconfigur present concern problem realiz algorithm find distribut approach solv solv distribut propag search method facilit exist csp solver solv problem local agent combin result solver earli refer approach introduc notion interfac problem partit variabl node usual constraint arc variabl node belong agent form problem interfac problem variabl node belong interfac problem label independ variabl node solv interfac problem solv independ problem eventu backtrack solv problem disadvantag global instanc find solut interfac problem collect solut independ problem similar strategi defin canon consist special constraint graph connect independ local constraint graph similar common csp solver solv partit problem author assum partit facilit global instanc guid solv process applic intellig agent appli control optim industri transport product process exampl research found sycara burk levi burmeist al detail survei norri contrast research intellig inform system involv human typic domain administr servic result appli agent domain report field telecommun al person meet schedul health care manag focu relat case studi earliest research distribut meet schedul work sen contribut formal studi search facilit host agent meet control search solut sen sen coordin agent protocol main part sen work formal studi strategi bid commit meet schedul investig liu sycara sycara account individu prefer dynam constraint coordin protocol current administr meet dynam constraint tight protocol suit symmetr group good social structur group work liu sycara extend sycara build protocol sycara author primari investig matter privaci inform hide negoti impact effici qualiti test approach small set consist agent negoti meet dai arguabl result easili scale size encount concept present articl classic ai monolith expert plan imag recognit intellig agent appli health care manag successfulli applic technolog found integr heterogen meta languag content descript al similar project singh approach agent model knowledg resourc agent handl transact extend architectur project fox manag medic process system implement prolog facilit reason procedur knowledg al fox present descript call prompt project formal knowledg process appli approach time tabl hospit decker li appli gener partial global plan approach patient schedul li conserv human organ author structur simpl bid protocol coordin resourc request announc investig complex protocol negoti lesser futur work research ma solv problem face project prospect agent vision work group achiev result reason process robocup team humboldt base modular bdi reason wendler burkhard al lead team competit similar modular concept person assist agent dynam skill exchang gmd approach effici cope problem john effort agent conceptu level applic level base recent research distribut product control includ present concept busi process model base petri net team begin realiz hope achiev result end refer problem partit solver coordin distribut constraint satisfact workshop parallel process artifici intellig ed read distribut artifici intellig morgan kaufmann publish practic reason harvard press distribut asynchron schedul intellig schedul morgan kaufmann publish bdi design principl cooper implement intern workshop robocup bdi artifici soccer ai magazin techniqu traffic manufactur progress report agent technolog market springer intent choic commit artifici intellig multistag negoti distribut plan read distribut artifici intellig morgan kaufmann publish de comparison atm csp techniqu eleventh intern joint confer artifici intellig dynam coordin algorithm distribut sensor network eleventh nation confer artifici intellig coordin hospit patient schedul intern confer system clone intellig adapt inform agent methodolog volum lnai springer distribut problem solv plan multiag system modern approach distribut artifici intellig mit press fipa agent commun languag agent commun languag fipa part version fipa agent manag agent manag fipa part version gener technolog clinic support system comput method program simplifi graph problem theoret comput scienc total distribut meet schedul system advanc artifici volum lnai springer distribut approach partial constraint satisfact problem distribut softwar agent applic volum springer method solv practic problem schedul model confer practic applic constraint technolog timet eleventh intern confer applic prolog distribut task plan flexibl manufactur environ distribut softwar agent applic volum lnai springer rapid concurr softwar engin competit situat sixth intern confer concurr engin bdi control environ manufactur system progress report intellig agent inform process manag universitat tzi report bdi control environ manufactur system master zu germani formal workflow model intellig agent workshop agent base system busi context aaai press extend dynam backtrack distribut constraint satisfact problem advanc topic artifici volum springer distribut partial constraint satisfact problem confer constraint process volum springer agent architectur distribut medic care intellig lnai springer approach health care manag appli artifici intern journal manag heterogen transact workflow agent agent technolog market springer organ distribut product system ieee transact knowledg data engin manag busi process intellig agent bc expert system confer specif implement architectur collabor problem solv intern journal intellig cooper inform system reach agreement logic model implement artifici intellig assist agent distribut knowledg workshop inform system emerg constraint satisfact coordin interact workshop model autonom agent world distribut meet schedul sixteenth annual confer cognit scienc societi heurist algorithm task assign distribut system ieee transact comput heurist search distribut constraint satisfact problem research report depart comput glasgow uk hybrid algorithm distribut constraint satisfact problem research report depart comput glasgow uk algorithm dynam constraint satisfact problem research report depart comput glasgow uk comparison approach solv distribut constraint satisfact problem research report depart comput glasgow uk problem structur subproblem share system intern confer system adapt architectur intellig manufactur intern journal product research mediat architectur distribut manufactur journal intellig manufactur distribut algorithm technic report dept univ de belgium workshop report workshop implement manufactur agent explor organiz design case studi distribut data process intern confer system architectur heterogen medic annual american confer inform bdi theori practic intern confer system mit press surrog agent search bia chang flexibl distribut schedul intern confer system formal studi distribut meet schedul group negoti autom distribut meet schedul ieee expert resourc util task perform agent clone intern workshop agent architectur languag hybrid agentori infrastructur model manufactur knowledg acquisit workshop system intellig survei knowledg inform intern journal contract net highlevel commun control distribut problem solver read distribut artifici intellig morgan kaufmann publish solv time tabl transport problem distribut csp techniqu workshop constraint applic model solv distribut constraint satisfact problem confer distribut constrain heurist search ieee transact cybernet distribut control algorithm ai multiag system modern approach distribut artifici intellig mit press understand line draw shadow psycholog comput vision ed multiag system modern approach distribut artifici intellig mit press distribut constraint satisfact algorithm complex local problem intern confer system search algorithm agent multiag system modern approach distribut artifici intellig mit press distribut constraint satisfact formal algorithm ieee transact knowledg data engin parallel distribut algorithm finit constraint satisfact problem parallel distribut
IR/323 5 combin multipl learn strategi effect cross valid yime yang thoma thoma pierc languag technolog institut comput scienc newel simon hall carnegi mellon pa abstract paramet tune difficult valid set exampl class evalu set address open challeng combin classifi perform characterist effect reduc perform varianc averag system includ approach tune combin system valid data obtain smaller perform degrad system evalu data classifi test approach appli rocchio languag model classifi combin event track problem topic detect track class creat constantli repres valid set class difficult obtain time paramet tune earli benchmark tdt corpu evalu tdt benchmark corpu overlap observ reduct track cost weight combin combin system individu method evalu strongli suggest robust approach solut improv perform consist statist classifi standard fail due lack repres valid set introduct fast grow dynam chang inform space real world world wide present challeng machin learn statist classif appli practic problem challeng effect handl evolv class topic detect track applic domain satisfactori answer question impact tdt line research onlin detect track event report stori multipl sourc broadcast newswir statist classif techniqu appli solv tdt includ document cluster event detect text categor event track yang carbonel yamron jin schwartz carbonel focu investig event task onlin identif stori report identifi event event track consid specif form text categor subject constraint tdt domain assum user unwil make exhaust relev judgement provid small number posit exampl defin singl event interest relev judgement user assum unavail system make document stream arriv user interest track event system adher tempor constraint document document evalu train posit exampl identifi user explicitli label subtl import distinct event topic event tdt context occur specif place time specif action contrast topic tradit text categor event local space time crash topic event system tdt domain distinguish part topic event typic short durat small portion corpu event tdt synonym avoid refer tdt event dynam natur event small number posit train exampl event make difficult obtain valid set suffici effect paramet tune standard techniqu tdt benchmark number posit train exampl event scatter larger collect unlabel document addit posit exampl hold back exampl valid strong neg impact perform small number exampl held valid offer suffici statist paramet tune theme event evolv exampl train valid repres stori event valid corpora provid tune paramet system tdt benchmark evalu typic consist stori month start evalu corpu cover period month data retrospect corpora event common evalu benchmark corpora empir result evalu group shown larg perform degrad system tune retrospect corpora evalu benchmark demonstr paramet tune event track system problem effect event classif system consist perform find tune paramet classif system reli avail suffici label exampl class problem explicitli address text categor rest solut set classifi perform characterist improv perform consist system strategi similar wellknown optim portfolio manag strategi stock invest varieti fund histori excel return offset volatil yield return averag long inspir practic combin system inform speech recognit machin learn improv section classif method rocchio rocchio effect method relev judgment queri inform retriev salton appli text classif lewi schapir vector repres class comput similar cosin obtain binari threshold vector document consist weight term document common version term defin log log weight term document term frequenc log invert document frequenc number document train number train document occur vector call prototyp construct set posit train exampl set neg train exampl class variant rocchio consist document queri retriev neg train exampl centroid posit train exampl queri prototyp vector defin jrj jrj fl rn rn score function test document respect class roc paramet rocchio method size local fl weight neg threshold stabl typic tradit text categor tune paramet basi yield result tune global paramet class event event valid set overlap event document paramet tune earli event global valu fl obtain tune retrospect valid corpu rocchio perform sensit choic valu show section neighbor classif classif effect approach broad rang pattern recognit text classif problem yang contrast static centroid train document test document make classif document develop variant knn address potenti problem number posit train exampl extrem small typic situat event track call score function test jp jq ju kp jv kn document mean set posit instanc nearest neighbor train kp consist kp nearest neighbor posit document train kn consist kn nearest neighbor neg document train set binari obtain threshold similar convent version knn weight sum score train document comput class comput averag score sum modif paramet larg permit neg exampl domin time greater differ convent knn zone nearest local test zone posit nearest neighbor kn neg nearest system posit neg exampl score test document system lose discriminatori power small local zone variant knn freedom paramet tune damag extrem case method perform produc result yield recal benefit error curv sensit choic valu kp show section variant yield perform improv origin knn event make knn system offici evalu decemb detail method report separ languag model form languag model appli includ base cluster approach dragon system hidden markov model exponenti lm hierarch lm determinist anneal carnegi mellon wall jin schwartz carbonel studi implement bbn topic spot approach event track addit method rocchio test hypothesi classifi reduc perform varianc combin system event track start doc ge doc end figur state hmm gener document topic method essenti naiv bayesian classifi specif form smooth figur illustr gener process document hidden markov model state correspond class background state word smooth distribut mixtur weight mixtur weight word distribut hmm learn automat train set document expect maxim algorithm chose fix mixtur weight train hmm simplifi version em space limit forc omit detail descript found bbn jin schwartz score function test document respect class defin lm log log result paper interpret result bbn event track system binari obtain threshold score paramet tune method choic threshold result gener combin output score classifi error tend result system perform varianc individu classifi call combin system borg test borg larg number dozen larg number system limit empir valid variant knn languag model care analysi behavior classifi condit combin error curv classifi primari mean analyz error pattern produc valid procedur gener borg run classifi paramet result set score det curv run select run det curv global significantli run local low alarm low miss minim cost weight sum miss defin section run select combin system output select run normal score system comput sum score multipl run test document normal formula origin score standard deviat result set score score find optim threshold borg valid set borg paramet error tdt primari metric evalu system weight combin miss alarm rate error plot normal deviat miss alarm rate threshold swept rang output score gener system miss alarm rate comput tabl tabl true true ffl miss rate ffl alarm rate ffl track cost ff ff recent tdt ff ff fix alarm probabl random perform kn lm rocchio figur classifi track evalu corpu det curv figur det curv dual curv found text categor literatur curv show measur system correct recal threshold swept rang output score gener det curv show trade error measur miss rate alarm rate dual form plot miss score plot normal deviat express percentag normal deviat mean score threshold higher score illustr det curv system score det curv straight system random perform straight line pass point system perform random guess det curv perform curv global perform event report tdt literatur score det curv score obtain comput score event averag score give event equal weight det curv plot miss rate result compar result tdt det curv present result det curv select system combin form borg figur show det curv tune method corpu knn method perform high rocchio perform balanc recal languag model smooth perform entir rang threshold classifi perform differ region det space good candid make borg classifi tdt corpora chose corpu stori cover juli june corpu cover januari june corpora corpora set evalu condit close benchmark evalu make result compar publish result evalu develop research tdt pilot research benchmark evalu corpu tdt research consist roughli half stori randomli sampl reuter half cnn broadcast manual transcrib journal graphic institut twenti event manual identifi memori particip period cover corpu scan exhaust relev judgement made event stori corpu document event averag stori assign label focuss mention mention event event note process result subset exist event label complet relev judgment document event corpu split point posit stori tdt data collect made linguist data consortium offici tdt stori judg train exclud test evalu make result compar result tdt benchmark evalu split point remain stori test fifteen event maximum event track evalu fix make set consist evalu develop larger richer consist document manual identifi event event consist document averag corpu event exhaust relev judgment entir corpu document collect radio program document english version document audio sourc transcrib manual automat speech recognit twenti event select evalu basi event parallel corpu posit instanc english mandarin track system posit train instanc event train data dry run corpu split immedi fourth posit english sourc fourth posit mandarin whichev occur stori split point impli split posit train exampl languag explicitli label empir valid tabl summar evalu result individu classifi borg tune evalu tune evalu tune evalu tune evalu crossvalid condit obtain reduct borg classifi fl condit reduct borg classifi kp kn note differ perform borg individu method evalu condit evalu condit import point small includ mandarin data import corpu make result compar tdt benchmark evalu result tabl classifi evalu corpora system tune aa ffi ab ffi kn rocchio lm borg system tune bb ffi ba ffi kn rocchio lm borg tune test tune test tune test tune test reduct borg individu classifi varianc exhibit borg valid evalu condit tune languag model compar small perform varianc borg evalu singl method larger perform varianc borg tune method exhibit small perform rang valid evalu borg perform varianc languag model show varianc compar borg actual perform classifi condit borg borg singl method evalu figur show det curv method ab borg outperform classifi entir det space suggest score gener individu classifi highli uncorrel individu combin score global improv figur compar det curv method condit ab borg lm smaller perform varianc borg integr good part classifi det space alarm probabl random perform kn rocchio lm figur det curv classifi tune evalu alarm probabl random perform figur borg evalu alarm probabl random perform figur evalu discuss benefit combin multipl system studi field inform perform improv combin system exploit portion multipl scheme term altern wai bartel speech word recognit error typic reduc dynam program algorithm align output multipl major vote linear combin score recogn joint predict text improv effect report combin combin larg number type classifi give weight train exampl boost schapir tdt work closest studi paper report improv event track combin languag includ studi work mention provid relev context motiv import point identifi problem statist text categor explicitli identifi previou insid tdt domain problem paramet tune valid set tune paramet classif system class valid set research tdt implicitli deal problem consequ work tdt shown improv perform combin system individu evalu compar approach classifi combin fix set class kind evalu adequ measur perform varianc lack inadequ insuffici valid effect combin classifi time paramet tune observ phenomena present experi fix set class evalu combin system shown result perform improv borg rocchio valid set aa column class evalu set ab column sort research find report previou studi uniqu contribut insight effect solut newli identifi strong empir evid support effect solut valid set fundament experi previou studi statist text includ conduct tdt domain main limit experi simpl combin give equal weight classifi linear combin evid power approach room improv find wai identifi perform characterist individu analyz properti combin futur leverag rich literatur method combin relat area machin speech improv perform borg theori valid address open challeng text paramet optim classifi repres valid set class effect combin output classifi learn strategi perform characterist improv perform consist class test approach event track problem tdt domain benchmark corpora event set overlap corpora valid compar system combin knn lm classif scheme perform individu classifi obtain reduct weight sum type error result strongli support robust approach power solut problem event categor document world wide web categori space typic fast grow effect train rate categori convent text categor problem studi approach larg number includ support vector neural network refer topic detect track pilot final report darpa broadcast transcript understand workshop san morgan kaufmann automat combin multipl rank retriev system seventeenth annual intern acm sigir confer research develop inform retriev associ comput machineri cmu report detect track darpa broadcast workshop san morgan kaufmann learn method text categor sigir annual intern acm sigir confer research develop inform retriev nearest neighbor nn pattern classif techniqu comput scienc seri la ieee comput societi press system yield reduc word error recogn output vote error reduct ieee workshop automat speech recognit understand ieee signal process societi multistrategi learn inform extract fifteenth intern confer machin learn san morgan kaufmann topic track tv broadcast newswir darpa broadcast workshop san morgan kaufmann relev feedback inform retriev smart retriev experi automat document retriev englewood studi overlap document inform research develop combin classifi text categor nineteenth annual intern acm sigir confer research develop inform retriev associ comput machineri combin multipl evid properti weight scheme eighteenth annual intern acm sigir confer research develop inform retriev associ comput machineri train algorithm linear text classifi sigir annual intern acm sigir confer research develop inform retriev improv retriev perform relev feedback journal american societi inform boost rocchio appli text filter ann int acm sigir confer research develop inform retriev maximum likelihood model topic classif broadcast eurospeech greec topic detect broadcast darpa broadcast workshop san morgan kaufmann maxim perform ieee intellig special issu applic intellig inform van topic track stream darpa broadcast workshop san morgan kaufmann evalu statist approach text categor journal inform improv text categor method event track ann int acm sigir confer research develop inform retriev learn approach detect track event ieee intellig special issu applic intellig inform text categor method ann int acm sigir confer research develop inform retriev
IR/324 5 web metasearch belief aggreg depart comput scienc worcest polytechn institut ma abstract web metasearch requir mechan combin list rate return multipl search engin user queri view analog combin belief probabilist uncertain reason artifici intellig paper describ practic method perform web metasearch base theori belief aggreg consensu rate produc method account item output individu search engin user prefer copyright fl american associ artifici intellig reserv introduct web search engin tool rang simpl search sophist method attempt understand intend mean queri data item work area recent year link structur web understand relationship document al machin learn techniqu appli web search al joachim special agent mine web weld light shed web search perspect work human behavior al relat problem includ intellig recommend scientif paper al creat digit librari effici index retriev scientif document gile review work web search includ gile gile interest web metasearch engin etzioni al dispatch user queri produc order list data item mse combin list singl summari list pass user present paper present approach web metasearch numer relev rate provid part method output featur approach user give subject confid valu emploi confid valu determin rel import accord produc final search summari user receiv output approach base framework set tool systemat construct combin oper belief determin choic metric transform refer frame abstract space present case space space relev combin oper uniformli assign numer relev rate item found poll ultim produc final summari list approach assum return numer rate addit list hit rate assign rank combin perform algorithm combin rank numer rate studi al high flexibl configur properti approach inherit theoret framework framework natur mechan vari sensit result combin oper input system base approach adapt user prefer content paper paper begin discuss approach metasearch base framework combin oper treatment incorpor user prefer preliminari evalu approach provid exampl includ mention section section summar contribut date describ work progress combin oper framework metasearch block diagram gener web metasearch system figur user present queri system user interfac queri pass decid web search engin submit queri poll return hit list combin mechan produc consensu list hit present user focu present paper combin mechan shown figur mechan produc consensu list hit individu list return search engin poll dispatch view process analog combin belief probabilist uncertain reason artifici intellig combin subject probabl similar numer measur sourc inform singl summari measur user web search engin mechan combin dispatch user interfac rate hit list queri figur gener web metasearch engin individu contribut approach web metasearch combin numer relev rate hit produc search engin singl summari rate object basi final order produc metasearch system combin summari rate dimens result order combin output metasearch system axiom combin oper process obtain consensu rate achiev combin oper oper import varieti applic rang system psycholog definit make notion combin oper binari oper mention explicitli definit oper construct simpli binari oper definit function admiss combin oper satisfi commut monoton function boundari valu notic associ requir combin oper sensit order rate desir present context rate list frame transform framework develop systemat gener manipul admiss combin oper framework start singl canon form geometr transform gener multipl combin oper canon form result combin oper express fi fi repres relev valu fi combin oper choic frame transform fi side eq shown combin oper eq admiss def frame transform fi satisfi boundari condit nonlinear scale frame transform combin oper occur natur parametr steep combin oper obtain standard version fi scale mechan extrem mean adjust sensit result combin oper present context seek nonlinear averag relev natur choic scale paramet number poll nonlinear weight averag scale paramet fine tune oper match user rate differ rate scale admiss combin oper give combin oper obtain frame transform framework exampl found frame transform fi function tanh eq obtain simpl express combin tanh tanh tanh pq oper shown interest interpret term probabl evid minkowski geometri nonlinear scale eq gener combin oper eq combin oper carri metasearch oper extend oper operand eq preliminari rate combin queri present excit webcrawl top hit result list shown consensu list comput belief aggreg approach present combin oper frame transform tanh eq default nonlinear scale paramet excit result metasearch metasearch directori metasearch engin metasearch metasearch webcrawl result search engin directori metasearch engin metasearch savvysearch metasearch consensu tanh combin steep metasearch directori metasearch engin metasearch metasearch search engin metasearch savvysearch observ extract result major factor determin consensu rank site number search engin retriev site webcrawl bottom consensu list part site excit top hit note phenomenon depend total number hit consid comput consensu rate top hit top rel posit final list queri present excit list savvysearch top hit rate lead move savvysearch excit top rank site result consensu list sensit number retriev site total number poll rel order site final list depend numer rate attribut site consid final rank top site consist rank trace numer relev rate model user prefer approach address user prefer wai user rel confid web search engin provid confid confid valu system weigh rate output approach fine tune combin mechan consensu valu accur reflect user subject rate produc specif system base approach learn set passiv user feedback base user behavior system confid user confid number reflect user trust result return higher trustworthi user consid type queri approach confid incorpor easili frame transform confid aggreg rate combin fi higher confid valu greater weight produc combin rate eq denomin fraction eq correctli scale result valu adapt user prefer estim user rate view eq nonlinear regress equat confid valu steep paramet paramet adjust differ rate steep revisit consid arbitrarili attribut confid retain default confid result consensu rate rank shown consensu directori metasearch engin metasearch metasearch search engin savvysearch metasearch metasearch compar result previou rate close return expect notic consensu rank top site chang excit rank webcrawl rank demonstr confid valu impact final numer valu rate illustr effect chang confid valu stress approach extract confid valu basi feedback activ user approach web metasearch base theori belief aggreg probabilist reason approach combin oper deriv transform space relev rate produc consensu rate set web search engin poll consensu rate lead consensu list output metasearch system approach includ mechan confid valu confid valu user learn system base observ user behavior method numer rate list return approach open interest possibl interact reason inform retriev techniqu evalu approach refer ration comparison probabl research report center nonlinear carnegi mellon belief combin mean frame transform sixth intern symposium artifici intellig mathemat recommend paper mine web work note workshop learn work note workshop machin learn inform sixteenth intern joint confer artifici intellig machin learn architectur optim web search engin aaai workshop inform aaai technic report mine link structur world wide web ieee comput scalabl agent worldwid web autonom agent special issu internet search technolog ieee internet comput effici boost algorithm combin prefer proc fifteenth int conf machin learn architectur metasearch engin support user inform eighth intern confer inform knowledg manag search world wide web scienc access distribut inform web natur index retriev scientif literatur eighth intern confer inform knowledg manag human perform cluster web preliminari studi fourth intern confer knowledg discoveri data mine aaai press build search engin machin learn techniqu spring symposium search comparison metacrawl proc world wide web confer
HCI/325 4 sound effect interact simul anim kee van den paul pai british columbia real rock virtual rock roll slide interact figur anim sound effect automat ad demonstr accompani video real pebbl pebbl rest simul pebbl thrown sound effect automat gener ball roll back surfac interact object abstract describ algorithm synthesi realist sound effect interact simul anim sound effect produc model dynam simul user interact develop algorithm control user natur wai develop effect techniqu produc high qualiti continu contact sound dynam simul run video rate slow rel audio synthesi accomplish modal model driven contact forc model audio higher graphic frame rate contact forc comput simul custom design demonstr effect complex realist simul cr categori subject graphic realism virtual comput geometri object model physic base model develop model type simul interfac present sound music comput methodolog interfac present user interfac auditori feedback addit kei anim comput physic base physic base sound virtual head mount displai introduct import sound comput graphic interact recogn long time sound interfac gener buxton point sound alarm statu monitor encod messag sound plai similar subtl role anim convei addit quantit inform qualiti sound call folei wide film game industri creation sound effect remain labor intens sound effect ad hand talent sound design system type sound effect due contact interact automat fig show imag present audio accompani video tape desir remedi automat sound effect base physic long histori pioneer work discuss contact sound simpl object bar pioneer hahn gener methodolog produc sound effect anim sound attach trigger event synchron render sound pipelin analog usual imag render pipelin describ synthesi sound version modal synthesi describ discuss relev work earli success decad automat sound synthesi integr part anim interact simul game specul reason model physic interact correspond simpl impact trigger sound work anim bounc object fail captur subtleti continu contact sound produc slide roll inevit accompani interact kind continu contact sound depend physic behavior anim difficult human creat hand benefit automat synthesi physic simul drive sound synthesi wrong tempor spatial origin design visual simul high qualiti audio synthesi occur sampl rate time faster graphic bridg gap surfac properti rough produc forc percept variat captur visual simul rate run detail simul audio rate interest possibl requir extrem small difficult integr approach rigid bodi wide anim spatial physic simul design polyhedr produc annoi auditori artifact due discontinu contact forc method dynam simul contact smooth surfac model singl sound fail account variat sound surfac properti surfac import variat simpl impact integr surfac variat geometr model dynam simul believ associ rough textur associ color materi inform visual effect demonstr part clear valu store textur previou work attempt larg categori sound singl class attempt sound rang contact sound anim cri result poor qualiti underli model suffici constrain sound realist forc user sound simul low term waveform filter graph experienc sound design tool produc good user find extrem difficult factor add fact automat gener sound compet realism subtleti record sound experienc sound design hand construct sound imposs interact simul interact advanc show paper problem list effect make automat synthesi contact sound practic attract anim interact simul show modal synthesi techniqu model interact sound ing continu contact describ dynam simul algorithm comput contact forc suitabl sound develop techniqu produc high resolut nomin contact forc produc dynam simul video demonstr implement system combin util sound map includ variat rough surfac object categori interact sound due incorpor relev physic phenomena constrain sound result sound synchron subtl contact high qualiti work paper potenti final realiz dream automat synthesi interact sound anim interact simul game relat work pioneer work mention number studi deal anim virtual music instrument anim investig cook number synthesi algorithm contact sound introduc includ algorithm sound simul sound effect tightli synchron haptic forc displai autom measur sound synthesi paramet studi room acoust sound graphic environ studi orthogon work present provid algorithm process contact sound paper add addit perceptu cue environ sound locat book refer numer public synthesi music instrument sound music instrument synthesi algorithm paradigm introduc mathew audio synthesi discuss theoret point view synthesi techniqu analyz criteria addit synthesi algorithm base fft synthesi close sound interest number algorithm sound approach decomposit sinusoid residu compon research gener slide roll contact machin role surfac irregular product roll slide contact investig nonlinear vibrat contact studi percept object properti sound overview contribut paper theoret model contact interact close integr dynam extens modal synthesi incorpor multipl simultan continu interact locat realist shift depend contact point implement softwar system call dynam graphic audio model creat interact simul synthet sound remaind paper organ section review modal describ obtain contact locat depend sound modal gain map geometri describ obtain paramet physic object section discuss dynam simul anim simul provid control paramet drive realist audio synthesi section introduc algorithm physic impact slide roll excit modal reson model section describ implement made demonstr effect algorithm present section modal reson model interact solid object make varieti sound depend roll rapidli vari forc contact point deform propag outer surfac vibrat emit sound wave good physic motiv synthesi model solid object modal synthesi model vibrat object bank damp harmon oscil excit extern stimulu modal model consist vector length compon modal vector length compon decai matrix element gain mode locat model locat frequenc damp oscil determin geometri materi properti coupl gain mode relat mode shape depend contact locat object model physic linear partial differenti equat vibrat boundari solut attract featur modal model number mode chang depend comput grace degrad audio qualiti modal reson bank comput effici algorithm model mode modal model paramet obtain principl simpl geometri creat modal model editor realist complex object obtain fit paramet record sound real object point surfac object sampl map point defin context space span gain mode intermedi point interpol scheme audibl artifact form abrupt result surfac sampl set densiti surfac sampl trial error map gain surfac sampl absolut suffici sampl recov sound affect chang spectral content excit customari model bow string oper perform chang gain vector neglig comput cost dynam simul sound audio synthesi techniqu paper incorpor method paramet audio synthesi directli easili comput simul method commonli comput constraint forc period continu contact resolv transient contact occur speed contact surfac slip veloc roll slide readili easili comput rel veloc contact locat observ featur make method desir continu contact audio synthesi contact forc method accur simul roll slide contact prefer smooth surfac model discontinu deal polyhedr approxim lead suffici smooth roll forc develop simul method continu contact suit sound gener reason techniqu rigid bodi defin parametr surfac loop surfac parametr evalu contact evolut method evolv system contact bodi reduc set coordin bodi bodi contact shape contact patch bodi function bodi describ contact configur patch bodi locat contact domain patch angl rotat ψ shown fig assembl column call independ variabl contact coordin denot contact kinemat equat relat rel motion smooth contact bodi chang contact coordin contact equat written φ φ rel spatial linear transform space contact coordin veloc subspac space spatial veloc equat rigid bodi combin deriv contact kinemat equat ψ figur contact coordin defin paramet space locat contact patch angl ψ form ordinari differenti equat solv contact coordin reduc coordin dynam slightli integr easili explicit integr stabil truncat error constraint formul check constraint forc neg object separ bodi evolv freeli observ transient occur close success time switch back reduc coordin sphere tree built polyhedr approxim model detect approxim contact coordin comput minimum distanc report sphere tree coordin appli newton find approxim contact point smooth surfac contact interact newton dynam forc audio forc figur dynam forc audio forc chang time rate reson model excit differ dynam rapidli vari part scale pictur modal model class suffici realist contact sound model reson contact interact simul contact interact time step audio sampl gener higher simul rate graphic model fast simpl stochast model contact action involv random element refer contact forc sampl audio rate distinguish sampl coarser fig simul similar audio high auditori heard excit reson model impact solid bodi larg forc appli short period time detail contact forc depend shape contact area elast properti involv materi import distinguish characterist impact object energi transfer strike contact hard affect durat energi transfer relat directli magnitud forc profil gener model contact forc base hertz model radii curvatur surfac contact consid model creat detail model interact forc bar simpl function qualit correct form impact forc τ total durat contact forc slowli repres gradual contact rise repres elast compress materi experi number forc profil found exact detail shape unimport hard convei durat marbl stone impact event fast singl contact break measur contact sound practic repres singl sampl data show sequenc fast contact separ hard impact micro modal vibrat object simul short burst train domin modal frequenc inform experi show place object studi impact modal reson frequenc sound convinc hit larg reson object small hard object slide slide gener combin effect surfac rough model interact model depend combin surfac properti object contact interact model simpl effect model surfac needl needl surfac track order gener sampl rate gener effect surfac profil spatial resolut maximum contact veloc model applic ensur maximum contact speed surfac profil sampl audio sampl rate homogen surfac easi implement surfac profil rate contact move speed rate repres maximum speed construct mathemat rough model explain obtain order reduct qualiti slowdown resampl linear interpol algorithm spuriou high frequenc compon result discontinu deriv reduc quadrat interpol scheme sophist algorithm filter offer audibl improv practic model rough surfac slide interact depict fig friction figur slide involv multipl contact area volum proport assum acoust energi proport friction power loss effect profil model creat simpl synthet model perceptu dimens contact averag contact forc profil spectral peak spectral peak frequenc move contact veloc provid percept chang pitch speed implement gener fractal power spectrum proport ω β pass reson filter paramet β surfac rough paramet relat fractal dimens empir data show surfac fractal wide rang scale valu report machin surfac length scale cd qualiti audio sampl rate correspond slide speed frequenc reson scale contact veloc produc speed width reson influenc simul random narrow peak sound pitch inform experi suggest fractal dimens correl percept auditori rough obtain fractal dimens record interact contact microphon fit power spectrum fig reson paramet obtain measur surfac structur object resolut mm make autoregress fit covari method plastic figur power spectrum smooth plastic fractal dimens extract linear fit roughli fractal model valid hz roll roll forc produc irregular surfac surfac rel speed contact contact interact reflect differ sound roll understood interact audio concern studi roll sound specif machin sound train wheel suggest roll model percept roll versu slide studi suggest period roll sound plai import role distinguish slide roll sound respect hear smooth ball roll rough reason surfac ball ride constantli collid larg length scale radiu ball larg scale surfac structur smaller small detail roll roll occur front contact area small downward motion ball small drawn time fig suggest roll interact similar interact size effect low frequenc content effect profil plai role suggest similar model addit filter adjust cutoff frequenc captur roll qualiti simpl model convinc roll convinc slide sound analysi record roll sound suggest roll forc coupl stronger mode slide forc linear model independ appli linearli vibrat slow fast contact region immin figur roll veloc vc relat contact region ject longer roll mode object specul surfac move rel stronger contact gener kind feedback mechan lead effect observ consist observ model γ driven gener roll sound pure modal model γ model driven spectrum reson filter driven spectral envelop ρ frequenc damp reson spectral envelop enhanc object reson observ data experi spectral modif obtain roll price extra comput requir filter studi carefulli evalu improv result implement idea present system audio synthesi toolkit develop pure java toolkit consist layer softwar layer object build graph gener layer basic audio process block model layer implement physic model audio process element process audio frame ms sampl sampl sampl basi pentium iii found mode sampl rate good complex cycl spare graphic dynam dynam simul implement java graphic render loop surfac describ boundari object simul sphere tree detect surfac simul run real time simpl exampl shown accompani record simul audio paramet plai back real time sound design higher qualiti graphic render fig show real time interact model bell phantom haptic interfac tap side bell virtual audio bell gener largest mode sound convinc creat detail dynam simul pebbl metal bounc slide modal model creat measur real nice scientif method object select paramet densiti surfac sampl number mode due lack object criteria determin synthet sound perceiv approxim target sound lack perceptu resort user input construct measur greatli advanc state art model record locat equidist radial modal model mode extract contribut set gain vector dimens obtain displai measur frequenc weight averag gain fig figur sound map visual bright map audio bright surfac rough measur contact mike construct audio surfac profil dynam simul set simul shape rock thrown contact occur time simul drive audio synthesi graphic displai simultan fig show dynam variabl drive audio exampl shown accompani demonstr slide roll discuss audio algorithm physic deriv principl physic law physic phenomena gener contact detail dynam interfac slide complex approach interact simul evalu qualiti gener audio compar anim realiti video real versu anim pebbl thrown exist realtim audio synthesi system compar result evalu remain qualit assign audio qualiti metric measur good audio model obstacl prevent construct measur phenomena object fall roll sensit depend initi imposs comput exact trajectori law order compar real sound sound extract perceptu relev statist properti complex sound unsolv import impact figur dynam variabl drive audio singl object drop shown normal slide roll speed contact point wrt impact forc motion shown show object bounc perform motion curv surfac final bottom problem reproduc event singl impact strike obviou metric compar real sound obviou measur squar distanc sampl audio satisfactori correspond percept construct measur requir substanti research audio significantli enhanc power method present collect method automat gener realist contact sound driven physic paramet obtain dynam simul physic motiv sound synthesi algorithm integr simul model paramet sound creat automat enabl user interact simul experi realist auditori feedback expect roll object solid object model modal reson bank realist depend locat interact demonstr rate contact forc excit modal reson model model model present algorithm roll model surfac textur contact interact design specif audio synthesi implement algorithm dynam simul audio synthesi packag written java audio synthesi simul run desktop comput special hardwar algorithm potenti dramat feel realism interact provid audio effect provid import perceptu cue combin high qualiti graphic dynam provid compel realiti sum contribut refer investig role surfac irregular spectrum roll slide contact sound virtual realiti multimedia academ buxton introduct special issu audio human comput buxton introduct audio cue extract mean complex interact volum vol page numer simul time domain model vibrat bar acoust soc wessel graphic user interfac reson model intern comput music ann cook integr physic model synthesi anim intern comput music page cook physic inform sonic model synthesi intern comput music page hong cook synthesi toolkit version proc intern comput music pai audio haptic interfac contact interact annual acm symposium user interfac softwar freed synthesi hundr sinusoid partial desktop comput custom hardwar intern confer signal process applic santa fri auditori correl perceiv hard set record sound event acoust soc acoust model distribut virtual environ proc siggraph acm comput everydai listen auditori icon phd california san auditori icon acm page world ecolog approach auditori event percept ecolog lee integr sound motion virtual environ sound anim virtual siggraph herm synthesi sound produc roll ball intern ipo report center normal vibrat friction harmon load ii rough planar contact transact asm journal auditori percept size veloc roll ball ipo annual progress volum ten criteria evalu synthesi process techniqu comput music johnson contact mechan cambridg hear percept materi contact sound virtual mathew technolog comput music mit morrison framework modal synthesi comput music nayak contact vibrat journal sound cohen haptic render model interact asm dynam system control volum page sound physic base motion siggraph forward dynam algorithm chain contact ieee intern confer robot page van den scan physic interact behavior object comput graphic siggraph confer music sound signal sinusoid residu elementari waveform model ieee workshop grand virtual environ simul advanc project proc int conf auditori palo thoma surfac topographi random process system sound analysi transform synthesi base determinist stochast decomposit phd dept stanford smith physic model digit comput music evalu loop surfac siggraph includ note rom digit signal process primer applic digit audio comput music critic studi applic theori asm journal appli hahn sound render proc graph acm comput thoma rough surfac imperi colleg valid twin predict program roll part ii journal sound model acoust virtual environ uniform theori siggraph van den sound synthesi virtual realiti comput game phd british van den pai synthesi shape depend sound physic model intern confer auditori displai palo van den pai sound physic shape vlsi model music synthesi mathew current direct comput music research mit
ML/326 6 seri discret mathemat theoret comput scienc analysi approxim nearest neighbor search cluster point set david mount abstract nearest neighbor search fundament comput problem set data point real problem preprocess point data queri nearest data point queri point report effici data set primarili interest data structur storag popular class data structur nearest neighbor search variant base hierarch space rectangular cell import question construct data structur choic split determin dimens split plane stage decomposit choic split method influenc effici data structur true data queri point cluster low subspac cluster lead cell high aspect ratio compar optim split method altern split method call attempt balanc goal produc cell bound aspect produc empti cell call method approach addit data train set queri point preprocess emploi simpl greedi algorithm select split plane minim averag amount ambigu choic nearest neighbor train point provid empir analysi compar method optim construct number synthet gener data queri set demonstr cluster data queri algorithm provid improv standard construct approxim nearest neighbor search mathemat subject classif kei word phrase nearest neighbor split empir analysi support nation scienc foundat grant gratefulli acknowledg american mathemat societi david mount introduct nearest neighbor search set data point metric preprocess point queri point data point nearest report quickli nearest neighbor search applic includ knowledg discoveri data mine pattern recognit classif machin learn data compress multimedia document retriev statist choic metric space assum space real distanc measur minkowski lm distanc metric integ point defin root metric euclidean max primari focu data structur store main memori data set limit data structur total space grow linearli popular method base hierarch decomposit space semin work area finkel show space queri time achiev fix space expect case data distribut bound densiti numer variat theme method suffer fact dimens run time space exponenti dimens difficulti obtain algorithm effici worst case respect space queri time suggest altern problem find approxim nearest neighbor set data point queri point point nearest neighbor true nearest neighbor rel error ɛ true nearest neighbor approxim nearest neighbor problem heavili studi recent exampl includ algorithm bern arya mount al clarkson chan kleinberg indyk motwani studi restrict attent data structur size base hierarch spatial larg part simplic widespread popular data structur binari tree base hierarch space split hyperplan orthogon coordin ax section kei issu design choic split hyperplan finkel split method base select plane orthogon median coordin point greatest spread call result tree optim henceforth call result split method standard analysi approxim nearest neighbor search split method common altern shape distribut data point split cell midpoint hyperplan orthogon longest side call midpoint split method number data structur nearest neighbor search base hierarch spatial decomposit yianilo introduc plane split node data call vantag center partit space region bit interest field data structur applic base variant improv perform avoid high overlap approach deal high space reduc maintain number activ dimens data point node share coordin activ dimens deactiv set activ dimens shift paper studi perform split compar split method call split method introduc mount arya ann librari approxim nearest neighbor search method introduc librari order handl highli cluster data set analysi method method design simpl techniqu address flaw standard split method flaw data point highli cluster low standard split method produc highli elong lead slow queri time split method start simpl midpoint split longest side split result data translat split plane direct point hit data point section describ split method analyz properti split call techniqu tree data collect sampl queri call train point algorithm appli greedi heurist build tree attempt minim expect queri time train point model queri process problem elimin data point candid nearest neighbor collect queri model stage nearest neighbor algorithm bipartit call candid vertic correspond union data point queri queri point adjac subset data point nearest neighbor select split plane stage elimin maximum number remain edg candid graph section describ split method greater detail implement split standard split method compar number synthet gener point design model cluster type cluster uncommon applic data set david mount synthet data standard adjust strength cluster result show split method provid improv standard split method data set cluster rest paper organ section present background inform perform nearest neighbor search tree section present split method section describ implement present empir result background section describ perform exact approxim nearest neighbor search bentlei introduc gener binari search tree higher dimens node tree implicitli call cell root node bound data point node implicitli subset data point lie rectangl point ly boundari number point node fall call bucket node point store leaf experi bucket size construct algorithm select split orthogon coordin ax pass cell number split method hyperplan discuss greater detail hyperplan subdivid cell children point subdivid children side hyperplan lie intern node tree split hyperplan index orthogon axi cut bentlei finkel present algorithm find nearest neighbor introduc split call standard split method intern split hyperplan chosen orthogon axi point greatest spread maximum split point chosen median subset data point equal size result tree size height white jain call basic split dimens chosen maximum varianc queri answer simpl algorithm basi algorithm arriv leaf comput distanc queri point data point node smallest distanc save arriv intern determin side hyperplan queri point li queri point necessarili closer cell search visit child return determin cell child closer queri point closest point child visit search return closest point return import observ queri analysi approxim nearest neighbor search leaf distanc queri point nearest neighbor visit algorithm easi matter gener search algorithm answer approxim nearest neighbor queri ɛ denot error bound process intern child visit distanc queri point distanc closest point divid arya al show correct procedur show gener search algorithm comput approxim arya mount number improv basic algorithm call increment distanc calcul techniqu appli minkowski metric addit store split intern node tree store extent cell project orthogon split axi algorithm maintain true euclidean maintain squar distanc algorithm arriv intern maintain squar distanc queri point cell show constant time inform comput squar distanc cell present method call prioriti heap visit leav tree order distanc queri order dictat structur tree improv techniqu nearest neighbor call partial distanc calcul comput distanc queri point data accumul sum squar compon exce squar distanc nearest point distanc comput termin import element approxim nearest neighbor observ arya al import properti data structur approxim nearest neighbor search base spatial decomposit height tree number data point bound aspect leaf cell tree bound aspect mean ratio longest shortest side leaf cell bound constant show approxim nearest neighbor search prioriti perform time data structur size hidden constant factor time grow achiev properti true point distribut highli cluster arya al present complex data structur call balanc satisfi properti extra complex order prove theoret show empir import data set highli cluster subspac interest practic question exist method retain essenti simplic provid practic effici cluster data distribut worst david mount bound aspect ratio suffici condit condit order result appli call pack constraint defin ball radiu locu point distanc point chosen metric pack constraint number larg cell intersect ball bound pack number leaf cell size intersect open ball radiu bound function independ tree cell bound aspect satisfi pack constraint arya show prioriti search run time proport depth tree time number cell maximum side length intersect ball radiu pack constraint number cell depend dimens ɛ main shortcom standard split method result cell unbound aspect gener satisfi pack constraint split method section describ split method consid experi mention implement split addit standard split method describ section split method introduc ann librari approxim nearest neighbor search method motiv remedi defici split standard split method midpoint split method understand data point highli cluster dimens vari greatli fig standard split method repeatedli split dimens data point greatest lead cell high aspect ratio nearest neighbor queri center bound squar visit larg number cell midpoint split method bisect cell longest irrespect point distribut ti longest tie broken favor dimens point highest method produc cell aspect ratio produc leaf cell data point size result tree larg data distribut highli cluster data dimens high method work attempt perform midpoint method data point lie side split plane algorithm act midpoint split trivial split result point lie side split attempt avoid split plane point encount data point fig split perform orthogon ith data point larger split split plane translat ith coordin equal minimum ith analysi approxim nearest neighbor search standard split midpoint split figur standard midpoint split method cluster point set coordin data point point point partit part data point part symmetr rule appli point ith coordin smaller split plane figur split method method result trivial impli result tree size avoid problem larg midpoint split method suscept point partit depth result tree exce base empir height tree rare exce height standard small constant factor gener cell high aspect ratio note sibl fat dimens gener situat left fig cell stack shown rule satisfi pack constraint method implement effort standard split method depth tree necessarili log construct time bound necessarili hold complex algorithm construct tree run log time spite perform highli cluster data set david mount split method base sole data point reason applic data point queri point distribut case common nearest neighbor search iter cluster algorithm depend start condit data point queri point distribut reason preprocess inform expect distribut queri data point provid preprocess phase data point collect sampl queri call train point goal comput data structur assum queri distribut train point idea present train set queri point clarkson nearest neighbor algorithm concept split method set data point train set sampl queri point queri point comput nearest neighbor part preprocess denot nearest neighbor maximum ball center point interior observ exact nearest neighbor search algorithm visit leaf cell overlap denot set leaf cell tree overlap suggest optim point set determin hierarch size total minim analog pack appli nearest neighbor ball train set problem solv optim dynam program polynomi run time unaccept larg number data train point interest simpl greedi basi split method motiv introduc model nearest neighbor search term prune process bipartit graph cell sc denot subset data point ly cell tc denot subset train point nearest neighbor ball intersect defin candid graph bipartit graph vertex set edg set sc tc edg graph reflect possibl data point candid nearest neighbor train point observ cell intersect data candid graph goal minim number leaf node overlap assum leaf node data reason heurist minim number overlap leaf cell minim averag vertic candid graph minim total number edg graph method similar techniqu design linear classifi base impur function idea ambigu graph suggest joe mitchel method solv problem pattern analysi approxim nearest neighbor search method select split hyperplan desir gener tree size subdivid cell orthogon hyperplan cut result partit data point respect denot subset train point nearest neighbor ball intersect notic subset necessarili disjoint assign score hyperplan equal sum number edg ambigu graph intuit small score mean averag ambigu choic nearest neighbor small split method select orthogon hyperplan produc nontrivi partit data point smallest score fig show score standard split method point child cell nearest neighbor ball intersect left child nearest neighbor ball intersect score higher concentr train point side split plane shown lower prefer method tailor structur tree distribut train point score score data point train point neighbor ball figur minimum ambigu split method split comput nearest neighbor train point nearest neighbor ball comput algorithm comput nearest build split method algorithm oper start root tree stage current cell bound box data subset nearest neighbor ball element tc coordin project point sc extrem coordin ball tc orthogon axi sweep set leftmost rightmost data point project score updat constant time point swept select hyperplan minimum score sweep david mount ti smallest criterion select split evenli partit data point improv effici data point coordin minimum maximum coordin nearest neighbor ball separ sort list store link sort point delet sort list delet list time observ node tree construct time sweep sort list select split lowest score creat node constant final comput set tc sc child copi sort make simpl remov element overlap cell denot set cell node result total run time procedur order log time comput nearest neighbor element data set run time nearest neighbor search quantiti major unknown factor construct time final sum equat observ split plane advanc time partit point cell tree order base fact time partit data point cell proport time number point cell observ tree comput nearest neighbor train point standard visit cell nearest neighbor ball intersect includ extra factor comput run time order major factor construct time tree time partit data point tree time comput nearest neighbor train point tree empir result implement split standard split method gener number data point queri point train point set tree structur base basic tree structur ann experi run sparc run solari program compil compil measur number statist includ averag aspect ratio cell queri answer prioriti search group queri comput number statist includ cpu number node visit number number distanc analysi approxim nearest neighbor search ɛ avg error std dev max error figur averag error standard deviat maximum error versu ɛ valu averag run number coordin access plot show number node tree visit search chose paramet close correl cpu time nearest neighbor comput approxim experi fix number data error bound ɛ case queri distribut number train point gener gener appli split method standard method tree construct depend impli tree error bound error bound comput tree nearest neighbor train point comput approxim nearest neighbor ball train point size divid radiu factor size ball search algorithm tree gener number queri point distribut data train point distribut nearest neighbor search perform queri result averag queri ran wide varieti sake show repres case experi data point dimens data queri run data set number train point ɛ experi report point factor true nearest error note observ error smaller comput exact nearest neighbor gaug actual perform actual error commit queri comput averag run fig note averag error commit typic error maximum error comput run queri averag run maximum error error variat order factor observ depend choic search tree point distribut feel applic good error perform run high valu ɛ unreason david mount distribut test distribut experi list distribut design model point set cluster distribut explicitli design model point distribut cluster flat point lie close lower subspac case ellipsoid align case arbitrarili orient coordin chosen uniformli interv distribut number color class standard deviat σ gener point uniform form cluster center point gener gaussian distribut center randomli chosen cluster center standard deviat σ distribut view distribut standard deviat coordin chosen class larg standard deviat small standard deviat distribut number color class addit dmax maximum number fat dimens minimum maximum bound larg standard fat side small standard deviat thin side cluster center chosen distribut color random number dmax indic number fat dimens dimens chosen random fat dimens fat dimens standard deviat coordin chosen uniformli thin dimens standard deviat set point gener process standard deviat distribut result appli random rotat transform point cluster center cluster rotat set rotat rotat uniformli distribut angl rang respect randomli chosen dimens experi involv set number cluster dmax vari low valu ellipsoid high valu distribut standard deviat data queri point distribut set consid data queri point cluster distribut consid distribut fig node visit analysi approxim nearest neighbor search standard epsilon node visit standard node visit standard epsilon epsilon figur number node visit versu ɛ data queri point sampl distribut graph ɛ ɛ ɛ case cluster center note graph share search algorithm perform significantli faster ɛ observ split method perform indic extent exploit fact data point cluster lower subspac rel differ run time notic small valu tend diminish larger valu split method design deal data queri point perform method case small valu cluster averag run time number node visit typic lower standard split lower method standard split method typic perform david mount node visit standard epsilon node visit standard node visit standard epsilon epsilon figur number node visit versu ɛ data queri point sampl distribut differ bit data queri point distribut set consid data point cluster distribut queri point uniform distribut choic motiv situat shown fig standard split method produc cell high aspect ratio data point consid distribut fig graph ɛ ɛ ɛ note graph share unlik previou run time vari greatli run time moder time node visit analysi approxim nearest neighbor search standard epsilon node visit standard node visit standard epsilon epsilon figur number node visit versu ɛ data sampl distribut queri point uniform distribut moder function differ standard split consist perform method smallest valu differ run time standard method larger valu ɛ perform slight edg perform significantli factor time design situat differ data queri distribut due limit heurist limit size train set mind special design produc larg empti cell region cluster fig david mount node visit standard epsilon node visit standard node visit standard epsilon epsilon figur number node visit versu ɛ data sampl distribut queri point uniform distribut construct time result previou section suggest split produc tree answer queri effici varieti point data distribut main drawback amount time build tree standard method built effici time number data height tree standard tree true point distribut point data set dimens tree construct cpu construct time tree bit higher mention time construct tree roughli logarithm proport time comput nearest neighbor train point time number data point train easi tree longer construct tree notic cpu cpu analysi approxim nearest neighbor search cpu cpu uniform uniform figur time construct tree versu comput nearest neighbor offer improv construct time fig present construct time tree combin data train distribut observ construct time greater method cpu construct time significantli faster higher valu ɛ paper present empir analysi split method method design remedi defici standard split respect data distribut highli cluster subspac method shown faster standard split method answer queri data point drawn cluster distribut queri point drawn uniform distribut method perform data david mount queri point drawn cluster distribut method higher construct time easi perform standard split method enhanc perform method suggest realm improv made structur tree data queri distribut high construct nice determin heurist lead faster construct time suggest intrigu possibl search tree structur adapt dynam structur queri time method hope simpl effici comput split perform wider varieti distribut standard split method acknowledg arya discuss perform method refer arya algorithm fast vector proc data compress ieee pp arya approxim nearest neighbor queri fix proc sympo discret pp optim algorithm approxim nearest neighbor journal acm binari search tree associ commun acm approxim queri high inform process lett classif regress bei improv minimum distort encod algorithm vector ieee transact commun index structur proc vldb pp effici robust access method point proc acm sigmod conf manag pp cover nearest neighbor pattern ieee tran inform theori approxim nearest neighbor queri proc annu acm sympo comput pp algorithm approxim proc annu acm sympo comput pp nearest neighbor queri metric proc annu acm sympo theori pp cost weight nearest neighbor algorithm learn symbol machin learn index semant amer soc inform sci analysi approxim nearest neighbor search duda pattern classif scene john wilei nearest neighbor method handbook statist vol algorithm find match logarithm expect acm tran math softwar cluster analysi multivari effici interpret biometr advanc knowledg discoveri data aaai queri imag video qbic ieee comput vector quantiz signal kluwer indyk approxim nearest remov proc annu acm sympo theori jain algorithm cluster prentic englewood algorithm search high proc annu acm sympo theori pp effici search approxim nearest neighbor high proc annu acm sympo theori index structur nearest neighbor proc acm sigmod conf manag pp index structur vldb journal mount librari approxim nearest neighbor annual fall comput method classif analysi multivari proc berkelei symposium math stat vol pp privat commun friend center geometr comput annual workshop comput refin search algorithmica dynam index proc vldb pp white algorithm strategi similar technic report visual comput univ san data structur algorithm nearest neighbor search gener metric proc sympo discret pp depart comput colleg maryland depart comput scienc institut advanc comput colleg maryland
Agents/327 1 support inform framework abstract past year develop momi environ multipl inform system integr data structur data sourc paper agent integr knowledg enrich momi architectur exploit intellig mobil agent featur motiv web internet intranet transform electron inform system singl isol node entri point worldwid network inform exchang busi transact main challeng design infrastructur inform retriev data locat sourc obtain integr view overcom contradict redund past year develop momi environ multipl inform system integr data structur data sourc paper agent integr knowledg enrich momi architectur exploit intellig mobil agent featur momi system momi system environ multipl inform aim integr vincini modena reggio emilia itali data structur data sourc momi system support design integr heterogen sourc schema xml momi design carri integr semant approach intellig descript cluster techniqu extend model repres extract integr odl refer describ sourc perform integr view global virtual view express xml standard xml definit global virtual view permit export momi metadata local mediat interchang xml data file integr project momi inform integr base conceptu inform architectur figur system function element commun corba common data defin describ sourc schema integr defin momi subset standard mediat languag develop work group introduc constructor support semant integr translat metadata descript sourc common translat global queri express queri languag queri express sourc languag export queri result data queri manag modul process integr descript receiv wrapper deriv integr inform sourc qm modul perform queri process optim qm gener queri wrapper start queri pose user global schema qm automat gener translat queri set sourc unifi global answer user momi capabl explicitli introduc kind knowledg integr design suppli domain knowledg common role share ontolog built common thesauru set intra describ knowledg class attribut sourc refer base identif class candid integr subsequ deriv global momi support inform integr creation integr view sourc virtual autom perform valid kind knowledg integr momi combin reason capabl descript logic cluster exploit common ontolog sourc construct lexic knowledg wordnet valid integr knowledg global virtual view express xml open integr system subset user interact corba interact corba object gui user slim slim wordnet wordnet interact interact sim sim valid valid map map tabl tabl tune tune global schema builder global schema metadata metadata repositori repositori wrapper relat relat sourc sourc creat wrapper xml xml sourc sourc integr design design wrapper object object sourc sourc user user applic applic wordnet artemi servic level momi mediat wrapper gener gener sourc sourc data level momi system architectur introduc agent support integr process momi implement base technolog feasibl develop account introduc agent technolog exploit agent improv exist momi featur show function add system architectur shown figur integr system reli gener set remot sourc perform analysi manipul content kind commun distribut task carri mean corba feasibl improv introduc intellig mobil agent order accomplish task effici flexibl environ suitabl develop system jade voyag aglet matchmak exploit agent regard integr search phase queri rewrit phase user interact corba interact agent interact corba object gui user global schema builder global schema metadata metadata repositori repositori wrapper agent agent relat relat sourc sourc softwar agent queri agent creat wrapper agent agent xml xml sourc sourc integr integr design design wrapper agent agent object object sourc sourc user user applic applic reason integr util servic level momi mediat wrapper agent wrapper agent agent gener gener sourc sourc data level figur system architectur search desir sourc set remot sourc integr global view made sourc autonom decid provid system knowledg moment number sourc order enhanc quantiti qualiti data system search potenti interest sourc domain search exploit case intellig mobil agent grai box depict figur show agent framework design agent manag act central facil handl agent life cycl step undertaken search potenti client execut creat coordin set agent visit interest sourc list interest sourc provid system design start search obtain domain search ontolog common thesauru instanti set agent allot address list agent insid agent recogn director plai role explor agent sourc time mobil agent explor visit assign sourc arriv introduc clarifi goal visit negoti avail sourc provid access part content complet agent back commun result search potenti interest sourc point visit sourc director link dynam ad list address assign usual method search process coordin track global state search decid stop result negoti phase step requir satisfi origin data sourc integr director notifi intellig agent wrapper sourc clear sourc identifi phase carri chronolog gener search process step compli sequenti explor sourc wrapper invok success negoti support inform retriev phase appli intellig agent queri rewrit queri manag charg perform queri user pose queri integr global gener automat translat pose global queri involv local sourc wrapper locat sourc site carri result propag system queri heavi queri answer system handl requir number connect commun cost rapidli due amount data transfer order avoid heavi workload system subset assign queri agent queri agent sourc site carri search comput interact wrapper agent smaller amount data propag system benefit queri solv straight queri agent sourc system retriev result delai connect unstabl system perman refer cy integr data multipl inform intern journal intellig cooper inform momi project intern confer larg data septemb page morgan integr structur data sigmod march integr heterogen inform journal data knowledg languag april hull king refer lexic commun roth scrap wrap wrapper architectur legaci data proc int conf larg objectori framework realiz agent klusch servic matchmak agent open inform sigmod march
DB/328 3 relat learn techniqu natur languag inform extract mari elain califf report august artifici intellig laboratori texa austin tx copyright mari elain califf relat learn techniqu natur languag inform extract mari elain ms dissert present faculti graduat school texa austin partial fulfil requir doctor philosophi texa austin august relat learn techniqu natur languag inform extract approv dissert raymond moonei miikkulainen bruce porter benjamin kuiper ellen riloff michael jami acknowledg peopl support contribut research rai guidanc time graduat student work rai continu learn experi point direct grate advic teach member includ bruce ben ellen suggest comment provid includ william robert van de fellow graduat john jame thompson special acknowledg due sue share trial joi graduat student mother ann friendship support support slack left harri distract understood work comput patient understand research support fellowship nation scienc foundat grant mari elain califf texa austin august vi relat learn techniqu natur languag inform extract technic report mari elain phd texa raymond moonei recent growth onlin inform form natur languag document creat greater comput system abil process document simplifi access inform type process task inform type text skim retriev specif type inform text inform extract system exist system gener built hand domain specif make difficult port domain research begun appli machin learn inform extract work involv appli learn piec larger system dissert present rule specif natur languag relat learn learn inform extract rule rapier pair document fill templat indic inform extract learn rule extract filler slot templat system test show abil learn rule task rapier perform compar proposit learn system inform demonstr superior relat learn inform extract task difficulti machin learn develop natur languag process system necess provid annot exampl learn dissert describ attempt reduc number exampl rapier requir emploi form activ learn result show number exampl requir achiev level perform significantli reduc method vii content acknowledg vi abstract vii chapter introduct organ dissert chapter background inform extract symbol relat learn gener algorithm design issu foil progol natur languag process resourc tagger lexicon chapter rapier system rule learn algorithm creation initi compress rule evalu metric comput gener pattern special phase chapter evalu domain task descript data ablat system compar methodolog viii job post result seminar announc result corpor acquisit result discuss sampl learn rule chapter activ learn rapier select sampl incorpor select sampl rapier uncertainti rapier make rapier increment evalu chapter relat work earli machin learn system inform extract learn inform extract structur text recent learn inform extract free text chapter futur work addit test domain enhanc rapier algorithm addit constraint type negat constraint syntax semant extract multipl slot rule recal boost bag experi activ learn open issu inform extract slot filler document relev recogn multipl case frame templat merg issu extens natur languag process task chapter appendix sampl data job seminar announc corpor acquisit ix appendix learn inform extract rule job seminar announc corpor acquisit appendix tag bibliographi chapter introduct growth amount inform network comput form natur languag document varieti search engin exist retriev document answer question inform requir deeper natur languag provid inform extract inform extract task locat specif piec data natur languag focu darpa muc program extract inform store queri standard queri languag natur languag interfac inform extract task focu figur goal extract inform latin american terrorist incid report inform extract system deal type text document difficulti inform extract system difficult gener highli make port domain effici mean develop inform extract system desir recent research comput linguist empir method approach develop effici natur languag process system brill method autom acquisit complex knowledg requir nlp train suitabl annot natur languag treebank sentenc empir nlp method emploi statist techniqu hidden markov model probabilist context free grammar research appli method languag process recent languag research symbol recent system successfulli emploi tree aon transform rule symbol method success empir nlp research recent begun appli learn method construct inform extract system newswir text jan author report minist gener lopez di todai lima consequ terrorist attack lopez armi command gener minist bullet young individu car open park lot commerci center neighborhood san lopez drive car shot time chest minist rush air forc hospit di figur sampl messag latin american terror domain kim symbol statist method gener part larger inform extract system system rapier autom product inform extract learn rule complet inform extract rule produc desir inform piec directli document prior structur symbol learn classifi corpu document pair fill rapier learn pattern make limit syntact semant freeli robust knowledg sourc tagger lexicon rule built pattern unbound give advantag limit fix number word rich requir learn algorithm capabl deal complex rapier emploi relat learn algorithm techniqu induct logic program system techniqu develop work relat logic algorithm incorpor idea ilp consist primarili specif gener search show learn build inform extract relat learn effect learn simpl featur fix context experi rapier perform domain vari difficulti task extract inform job netnew rapier perform achiev recal rapier compar naiv system fix window filler fill templat id templat date jan locat lima san type attack stage execut accomplish instrument id instrument type incid categori individu id young organ id organ confid phy id phy type phy number phy foreign nation phy effect incid phy total number hum lopez hum descript armi command gener lopez hum type govern offici activ lopez hum number lopez hum foreign nation hum effect incid lopez hum total number figur fill templat messag shown figur slot filler includ string found document type valu account order presenc absenc test naiv system job task produc recal result demonstr inform extract relat capabl singl previou context word capabl account order token filler context easier task extract inform seminar rapier perform achiev recal naiv system competit domain rapier perform extract inform corpor acquisit newswir articl syntact knowledg rapier requir successfulli handl type domain semant inform rapier competit learn system inform extract test task difficulti machin learn build system necess provid exampl learn system case learn inform extract requir human perform inform extract task number document significantli labor intens produc inform extract system desir limit number exampl requir possibl experi applic activ specif select limit number exampl requir achiev level perform select sampl method learn system select exampl annot train pool unannot exampl method attempt select exampl order reduc number annot requir experi select sampl job domain show greatli reduc number exampl requir reach level perform achiev full set random exampl research primari goal show relat build practic inform extract system show select sampl effect appli learn inform extract reduc human effort requir annot exampl build system organ dissert rest dissert organ chapter present background knowledg inform relat natur languag process tool rapier system chapter describ rapier present learn algorithm chapter discuss evalu rapier domain present result evalu chapter describ applic activ learn rapier extens requir algorithm activ learn discuss evalu rapier activ learn chapter describ relat work area learn rule inform extract chapter suggest idea futur research chapter review idea result present dissert discuss relev chapter background part chapter discuss inform extract task characterist tradit inform extract system section discuss relat learn design choic involv develop relat rule learn system section describ previou relat rule learn induct logic program includ system directli influenc develop rapier final section chapter briefli describ natur languag process resourc research inform extract inform extract shallow form natur languag understand type document focu arpa messag understand confer situat set text document exist inform easili human comput inform uniform format inform extract system set document templat slot fill inform document inform extract system locat identifi specif piec data document type data extract system identifi string directli case system select set valu filler slot type item consist simpli set term provid consist valu inform present necessarili consist latin american terror domain figur incid data extract wai system fill templat valu case slot fill string directli system annot document directli inform extract varieti domain muc task latin american terror domain mention joint post newsgroup programm nov post servic softwar programm posit softwar programm experienc gener softwar voic mail system experienc program familiar commun control voic prefer experi natur microsystem prefer year experi pc base voic year find senior level person board pick code train present oper system unix futur repli kim anderson fax figur sampl job post newsgroup compani manag inform extract track medic patient record track compani merger research appli inform extract formal text genr rental ad web page hsu domain light deal wealth onlin extract inform text document order creat easili searchabl make wealth text onlin easili access inform extract job post usenet newsgroup creat easili searchabl job part complet nlp system support natur languag queri system work inform extract report dissert part ongo project develop system initi system handl job inform extract task system figur architectur complet system shown figur addit inform extract rule learn system requir queri parser semant lexicon queri queri parser develop system learn parser sentenc pair semant lexicon fill templat softwar programm tn pc unix voic mail nov figur fill templat messag shown figur string directli document slot filler produc thompson system learn lexicon sentenc pair semant inform extract system gener domain specif incorpor special process modul handl issu inform extract system built incorpor learn inform extract nl messag semant lexicon logic queri queri processor queri parser nl queri answer figur complet system architectur symbol relat learn empir work natur languag process emploi statist techniqu wermter section discuss potenti advantag symbol relat learn order accur estim probabl limit statist techniqu base limit bigram trigram word nlp frequent base larger context includ varieti pragmat cue research begun emploi learn techniqu handl larger tree miller aon exemplar method ng maximum entropi model method techniqu requir system develop finit set featur make develop set featur requir engin exclud import contextu inform relat learn method induct structur exampl includ logic predic function unbound data structur list tree induct logic program studi induct rule logic ilp system induc varieti basic prolog program potenti rule base import biolog problem detail comparison ilp induct demonstr advantag relat languag relat text categor gener past english verb recent research demonstr relat learn classifi web page advantag techniqu abil background knowledg symbol rule make easier system develop understand verifi result system edit learn knowledg respect background ilp system prolog definit set predic bodi learn rule system make concept embodi background predic relev concept learn rapier ilp relat learn algorithm learn structur rule algorithm inspir idea ilp system idea design learn unbound section discuss gener design issu develop ilp rule learn system describ ilp system influenc rapier learn includ directli inspir progol gener algorithm design issu design issu rule learn system structur algorithm primari form outer compress cover system compress begin creat initi set highli specif typic iter gener rule replac rule compress rule set posit exampl metric evalu rule greater compress rule set rule learn end rule compress rule set found system compress includ proposit rule learn system resolut ilp system resolut system cover begin set posit exampl rule posit exampl rule cover remov creation futur rule rule learn end posit exampl cover common structur rule learn system exampl includ foil progol claudien raedt system base foil design primari differ effici search search cover system tend seek learn rule exampl cover search compress prefer rule cover remain exampl subsum exist rule cover system end set fairli specif rule case search discov gener rule cover set exampl major design direct search construct individu rule system typic work system creat specif rule gener cover addit posit system start gener typic rule cover posit special attempt uncov neg exampl continu cover posit exampl system pure foil system base pure system progol combin method choic search direct creat tradeoff system find gener rule cover larg number start gener rule special avoid neg exampl system creat rule dont perform unseen data fail gener initi rule suffici fairli small search space background relat search effici branch factor search high wai special bottomup search constrain constant consid construct rule rule base system combin techniqu seek advantag effici section briefli describ foil system directli influenc rapier algorithm initi definit null remain posit exampl remain empti find cover exampl neg exampl remov exampl cover remain add definit figur basic foil cover algorithm foil foil prototyp ilp algorithm cover outer loop learn definit target predic term background predic input consist definit predic tupl constant type input learn definit list membership type denot element includ type defin consist flat list background predic true iff list element rest list provid place function list foil requir neg exampl target suppli directli comput assumpt assumpt produc pair form explicitli provid posit exampl foil learn program time greedi cover algorithm summar shown figur learn member iter loop cover posit exampl element list cover neg learn cover remain exampl constitut correct program member step implement search add develop time evalu liter ad select maxim heurist algorithm initi target predic ariti initi posit tupl neg tupl neg tupl find liter add form train set tupl satisfi tupl form set bind variabl introduc liter satisfi match tupl definit replac figur step foil algorithm maintain set tupl satisfi current includ bind variabl introduc bodi pseudocod figur summar procedur foil consid ad liter variabl predic long type restrict satisfi argument exist variabl bound head previou liter bodi liter evalu base number posit neg tupl prefer liter cover posit neg denot number posit tupl set inform defin log chosen liter number tupl extens number current posit tupl cover search good liter add blow number background predic ariti predic number theori constant larg foil includ addit featur heurist prune space liter method includ negat liter immedi provid gain prevent method ensur induc program termin inform foil found quinlan mention greedi cover algorithm similar foil outer loop individu construct base construct gener specif subsum substitut variabl make liter subset liter turn drop condit figur specif instanc relationship figur figur chang constant variabl subsum prove prove fewer condit gener subsum case renam defin gener subsum easili comput compat liter liter differ variabl ident pair differ structur variabl pair locat figur specif describ concept context famili relationship complex shown figur replac pair replac replac note result parent liter wai match pair parent liter origin liter male worst result oper liter input length femal liter compat liter straightforward simplif result remov redund liter yield figur defin gener construct result gener determin strictli form input potenti background knowledg order background knowledg account produc candid rel posit exampl respect background knowledg idea start assumpt background inform relev determin instanc posit figur result simplifi figur remov redund pair random sampl pair posit exampl fc set pair cover exampl random sampl posit exampl exampl find produc greatest cover exampl exampl figur construct algorithm posit repres ground ground conjunct true ground liter deriv background relat case includ fact exampl simpli exampl repres process serv gener irrelev condit difficulti approach interest background relat give rise infinit number ground fact finit set fact complet describ list indefinit long build initi repres exampl finit subset fact deriv background predic fix number binari resolut figur show construct algorithm ilp algorithm compress outer loop combin element induct techniqu includ mechan predic invent basic compact algorithm figur start specif definit set posit introduc gener make definit compact measur size metric search gener definit carri fashion number gener produc greatest compact theori process repeat determin current theori notion def fe true repeat pair sampl pair def gen fg build hc gen yield compact def subsum compact figur compact algorithm empir subsumpt cover exampl cover addit empir subsum build gen algorithm attempt construct empir subsum def cover neg exampl step construct input cover neg refin attempt made refin mechan add liter deriv background invent predic result pass routin invent predic discrimin posit exampl neg cover progol progol combin search foil progol cover algorithm outer loop proposit rule learner aq individu construct begin select random seed mode declar provid background predic predic progol construct specif random seed call bottom mode declar argument predic argument type variabl bound predic variabl bound predic bottom progol emploi search set liter bottom order find simplest consist gener add definit advantag progol constraint search make fairli type task approach search find simplest consist gener exist liter primari problem system mode declar fact small prevent progol learn correct larg search explod natur languag process resourc issu kind higher level languag inform kind lower level process number inform extract system parser lexicon partial domain develop conjunct inform extract system depend parser lexicon limit system intend learn inform extract rule order easili retarget task system benefit languag process resourc gener varieti domain current type languag process resourc gener appli multipl domain tagger lexicon tagger tagger basic syntact inform sentenc input label word symbol sentenc tag doesnt provid inform doesnt identifi phrase relationship part sentenc tagger typic faster robust full face text commonli found post email lesser extent newswir articl tagger research eric brill tagger train wall street journal corpu tagger tag exclud make fairli specif distinct identifi verb form distinguish possess adverb distinguish preposit appendix list tag exclud punctuat brill tagger accur domain achiev accuraci penn treebank wall street journal corpu accuraci domain significantli advantag trainabl larg amount text exist tagger train scratch absenc method exist tune tagger specif domain brill method incorpor word bigram corpu resourc tagger tagger determin part speech word common part speech modifi includ word reflect actual distribut part speech domain ad frequent word lexicon effect improv tag qualiti rule tagger rule ad hand improv tag qualiti difficult requir good understand tagger wrong fix method tune tagger typic depend size domain lexicon semant provid semant class inform lexicon wordnet lexic word semant hierarchi form hypernym link individu item wordnet synset repres singl share word share word typic synset belong member ten noun synset verb synset part speech map word synset order frequenc synset mention synset wordnet relat link includ hypernym semant hierarchi implement hyponym hypernym link hyponym link point semant subclass hypernym link point semant superclass semant hierarchi link forest singl part speech top hierarchi top hierarchi arbitrari synset part speech necessarili share semant class chapter rapier system rapier learn rule inform extract train exampl consist document pair fill templat figur section describ rapier rule learn algorithm rule rapier rule pattern make limit syntact semant inform extract rule index templat slot consist pattern match text immedi pattern match actual slot pattern match text immedi filler pattern sequenc length case pattern element rapier make type pattern pattern item pattern list pattern item match word symbol document meet item constraint pattern list specifi maximum length match word symbol document limit form kleen match list constraint rapier kind constraint pattern constraint word element tag assign word element semant class word element match constraint disjunct list semant class document item match class fulfil constraint figur show rule show type pattern element constraint rule construct rapier extract transact amount newswir corpor acquisit rule extract phrase bank pattern consist pattern element item constrain match word tag noun proper noun list maximum length constraint filler pattern singl item constrain word po tag label adject pattern singl pattern item semant constraint pattern extract appli rule slot document extract string elimin duplic rule filler price length jj figur rule extract transact amount newswir corpor acquisit part speech tag noun proper part speech tag adject appli multipl slot filler system seldom multipl filler slot filler occur learn algorithm note inspir ilp progol primarili consist specif gener search choic approach made reason reason larg branch factor search find word semant constraint learn system oper natur languag typic mechan handl search larg vocabulari amount text system handl problem limit vocabulari frequent word time train corpu type limit approach reduc constant creation rule rule limit search artifici hard limit constant consid reason select approach decid prefer overli specif rule overli gener inform natur languag process typic high high recal true task build job partial motiv inform found perform keyword search origin give maxim recal extract string directli low approach tend produc specif tend rule choic compress outer loop good fit approach strong tendenc produc rule compress outer loop partial counteract tendenc tendenc search gener rule rapier begin specif definit attempt compact definit replac rule gener rule rapier rule rule slot independ system creat specif definit compact separ slot templat creation initi step slot creation slot rule creat occurr document templat filler pattern rule list pattern word symbol word constraint word symbol tag constraint tag document semant class left unconstrain singl word multipl semant class polysemi languag semant constraint immedi rapier disjunct class lowest level gener case synset word item creat belong semant class choic problemat result constraint gener choic correct semant class word context difficult problem select frequent choic wordnet work issu domain specif frequent mean word context frequent mean word domain question singl domain word multipl mean determin frequent mean word specif domain wrong choic rapier avoid issu altogeth wait creat semant constraint gener implicitli disjunct select specif class item gener word postpon choic semant class multipl item requir fit semant rapier narrow number choic semant class class cover word detail creation semant constraint discuss section creation pattern proce fashion filler pattern pattern list pattern item document token filler pattern consist item document token filler rule cover full inform limit rule occurr filler context compress creat definit rapier attempt compact replac specif rule gener gener rule creat random pair rule find gener rule gener result accept select rule add rule ad rapier remov rule empir cover subset exampl cover rule chapter inspir creat rule gener pair rule rapier differ significantli basic concept select random pair rapier select random pair rule rule select rapier rule cover singl real differ induct logic program essenti rule rapier select rule result earlier gener gener point differ learn differ repeat gener achiev rule gener rule result gener pair exampl attempt gener cover randomli select rapier simpli add rule select gener rule differ stem primarili differ approach algorithm outer level cover fulli gener rule exampl rule cover remov rapier compress approach lead gener loop uniqu aspect rapier learn algorithm creat rule random pair rule straightforward method gener rule find gener gener pattern pattern make filler pattern rule filler pattern problem obviou approach problem comput pattern pattern pattern rule length discuss section gener pattern length individu pattern element shorter pattern gener element longer ahead time element combin produc comput pattern entireti prohibit problem matter comput problem power rule rapier rule unlimit constraint union constraint result disjunct desir gener result simpli remov constraint creat disjunct gener pattern simpli multipl gener constraint pattern element approach rapier pair differ constraint gener creat drop constraint gener union constraint multipl gener pair pattern element greatli comput complex gener pair lengthi pattern tend rapier pure approach combin approach specif rule constrain search accept gener rule singl seed type inform progol rapier pair rule constrain differ make rapier search progol rapier rule gener method oper principl relev inform templat learn specif rule document compress fail fewer time initi empti prioriti queue length randomli select pair rule find set gener filler rule pair pattern creat rule filler empti evalu add loop increment evalu rule add evalu rule add rule produc valid filler rule fail improv iter rule cover percentag spuriou filler add remov empir subsum rule figur rapier algorithm induc inform extract rule extract close filler document rapier begin gener filler pattern creat rule result gener filler pattern empti pattern special rule ad pattern element work outward filler element ad pattern creat gener portion pair rule rule gener work advantag local preclud possibl pattern element fairli distant filler detail special process section figur show rapier basic algorithm prioriti queue length maintain list rule paramet algorithm prioriti rule rapier heurist metric determin qualiti rule section rapier search basic search item pass search differ standard node fulli expand pass iter special algorithm pattern element distanc filler section rule thrown fall end prioriti queue rule evalu metric difficulti design rapier algorithm determin heurist metric evalu rule learn issu measur neg exampl task inform extract larg number neg exampl string extract number larg make explicit neg exampl issu question substr constitut neg string length consid neg string length similar posit exampl slot avoid rapier neg notion implicit neg rapier make assumpt string extract slot string rule extract templat assum spuriou extract neg exampl rule appli document train set filler match filler slot train templat consid posit extract filler consid neg exampl cover rule method determin neg posit exampl cover rule evalu metric rapier simpl search techniqu metric inform gain measur rule improv current rule order pick rule greatest improv rule inher compar rule inform rule equat inform measur rule separ posit neg exampl identifi valid filler spuriou make distinct simpl complex rule problem rule cover number posit neg level complex constraint twenti expect simpler rule gener rule prefer machin learn algorithm encod algorithm stop rule cover neg found prefer simpl complex rule rapier search encod multipl wai gener produc rule wide vari complex step gener evalu metric rule encod bia complex rule evalu metric favor rule cover larger number posit exampl evalu metric fit requir minimum descript length quinlan idea mdl gener minim size descript data develop theori describ mdl metric seek minim size theori correct theori handl exampl correctli handl theori simpli list posit exampl cover correct neg exampl mdl excel choic system rapier principl measur accuraci complex rule cover fit easili compress outer loop cover outer loop primari issu measur size theori correct principl comput minim number bit requir transmit theori correct initi experi mdl method measur size theori correct yield disappoint result recal expect lower expect task adjust perform mdl metric modifi method measur theori length correct altern size metric design reflect specif aspect rule size rule comput simpl heurist pattern item count pattern list count disjunct word constraint count disjunct po tag constraint semant constraint count compress style measur posit cover theori cover neg count fix size valu size altern measur heurist slightli principl left lower expect mdl strong theoret necessarili prefer accur theori shown perform poorli ad penalti altern encod improv perform model select mdl bia prefer correct bia task perform mdl metric give weight complex rule insuffici weight rule accuraci solv problem metric comput accuraci complex term weight appropri influenc evalu put requir desir evalu metric metric inform rule weight size rule divid number posit cover metric rapier inform comput laplac estim probabl size rule comput mdl metric divid bring heurist size estim rang inform rule size influenc overwhelm evalu metric comput al log number correct filler extract rule number spuriou filler rule extract handl rapier coverag spuriou filler primari reason human annot make error omiss rapier reject rule cover larg number posit extract neg prevent learn pattern failur human annot notic singl filler fit pattern extract rapier special end due failur improv rule iter rule extract spuriou rule meet number valid filler extract rule number spuriou filler extract equat ripper prune rule measur set rapier learn small number set intern evalu rule cover spuriou higher default default rapier default note rapier handl involv handl prune handl goal avoid creat rule special data pure gener rule sort prune rapier primarili depend subsequ iter compress algorithm gener rule specif handl mechan accept noisi rule rule evalu cover neg exampl comput gener pattern descript rapier algorithm structur algorithm search pattern left vagu import gener pair filler special special pattern special pattern crucial understand step understand rapier gener pair pattern section describ start describ gener gener pattern final gener pattern constraint gener gener pair word tag constraint straightforward issu involv gener simpli constraint produc prefer disjunct gener option simpli drop constraint empti constraint describ result drop constraint rapier simpli gener constraint constraint simpli origin constraint constraint empti word tag gener constraint empti constraint superset constraint superset reason creat disjunct case disjunct superset gener result drop constraint reject favor disjunct altern gener union constraint empti constraint result gener empti tag constraint gener semant constraint complex reason mention word member semant rapier creat semant constraint initi wait gener singl semant class cover word make semant class gener greater complex semant hierarchi simpli creat disjunct system seek find superclass cover class initi constraint gener semant constraint proce ffl constraint constraint origin constraint ffl constraint empti pattern element empti word constraint word constraint constraint empti constraint element empti word constraint word constraint multipl word result previou gener semant class search semant constraint fail ffl semant constraint empti pattern element word constraint consist singl word word constraint rapier attempt creat semant constraint system search semant hierarchi class cover word word constraint goal find gener class cover mean word mean find synset word hypernym synset closest synset word word semant class synset share synset synset word result semant class word result match semant constraint empti rapier avoid creat semant constraint word constraint ident reason creat semant constraint initi singl word leav choic semant class insuffici constrain prevent creat semant class word constraint rule singl word ffl semant constraint empti pattern element empti semant constraint empti word constraint word constraint multipl gener constraint empti system start semant class semant constraint climb semant hierarchi find semant class cover word element word constraint semant class semant constraint element gener element element man woman nnp nn result gener person person person person figur gener pattern element word form disjunct drop word constraint tag gener total gener element ffl semant constraint system search lowest class semant hierarchi superclass make semant constraint match superclass constraint empti semant rapier make disjunct current implement note implement semant constraint gener close ti wordnet semant hierarchi research code carefulli modular order make process substitut altern sourc semant inform modifi gener method disjunct class easi gener pattern element rule gener gener pair pattern element fairli simpl gener tag semant constraint pattern element comput set rapier comput combin word tag semant constraint creat pattern element combin figur combin origin pattern element pattern element pattern item element pattern list length pattern list maximum length origin pattern list length pattern list case pattern item pattern list pattern gener pattern pattern hit vb vb dt dt ball nn nn result gener vb vb dt dt nn nn vb vb dt dt nn nn figur gener pair pattern equal length semant constraint gener gener pattern gener pair pattern equal length straightforward rapier pair pattern element pattern comput gener pair creat pattern made combin gener pair element order figur show gener pair pattern differ length problem combinatori greater element long element long determin group element gener assum element shorter pattern match element longer element longer pattern match element shorter total wai match element shorter pattern element longer total wai match element pattern figur demonstr problem pattern grow longer differ length grow problem sever order limit problem creat rapier search exact match element pattern make assumpt element pattern match element pattern element pair problem broken match figur pattern differ length line show element group gener segment pattern side match element search match element confin assumpt match element shorter pattern gener element longer pattern shorter element element compar element element element element element match greatli limit number gener comput figur show find exact match element longer pattern match element element leav combin remain pattern element exact match found break pattern segment gener pair segment treat pair pattern pattern segment equal handl pair pattern length pattern uneven length gener special case length pattern shorter pattern element pattern element longer pattern gener set pattern pattern list altern gener constraint pattern element result pattern list match document token element longer length pattern list sum length element longer pattern item natur length figur demonstr case special case shorter pattern singl element similar previou gener singl pattern constraint gener pattern element pattern case length pattern list greater length pattern element shorter pattern sum length element longer pattern length shorter pattern consid case list length greater length longer pattern case figur special case pattern long length number gener rapier simpli creat singl pattern figur wai element pattern figur match gener list constraint length equal longer pattern sum length case primarili slot filler dispar rule make context structur actual slot filler special case rapier creat full set gener rapier creat set gener pattern creat gener element shorter pattern set element longer pattern assumpt mention element shorter pattern correspond element longer pattern element longer pattern correspond element shorter pattern group gener element gener pattern creat combin gener element combin includ element pattern order case pattern element figur gener pattern combin gener element group pattern element figur gener element produc typic gener comput case exact match step remain result pattern segment pair gener gener pattern comput creat combin gener pattern segment pair case depict figur group result find exact match element longer pattern element shorter pattern figur ident element remaind group pattern gener bank nn nn result gener length length nn nn figur gener pattern item match pattern element pattern figur result sixteen gener pattern segment combin middl element pattern gener final pattern segment special phase final piec learn algorithm special call figur function rule special integ element pattern origin rule pair special special work outward order carri special rule maintain inform rule refer base pointer base pattern base rule incorpor current pattern base rule incorpor current rule special function return list rule special ad rule pattern gener pattern pattern bank length nn nnp nn result gener length length figur gener pattern item match pattern element pattern pattern pattern list length result gener length gener portion base rule issu function system simpli consid ad element pattern step miss gener length pattern gener assum rule requir year experi creat phrase year experi requir year experi filler algorithm special result identifi number year experi requir desir iter creat item iter match fourth iter match occurr creat list order special function result ad element result ad element ad element pattern pseudocod figur figur order pattern list creat function gener pair pattern segment pattern gener determin determin origin pair rule current rule incorpor case current rule empti pattern gener element element element element element base rule current rule special portion element incorpor pattern start number element specifi portion consid iter case analog case portion pattern rule creat pattern pattern pattern length length element element gener element element gener element element gener element element empti set concaten creat add return figur rapier algorithm special rule consid algorithm work outward filler entir process creat gener rule base phrase kansa phrase suffici demonstr rule practic longer specif rule creat phrase citi slot job templat filler locat atlanta nnp georgia nnp rule creat pattern pattern pattern length length element element gener element element gener element element gener element element empti set concaten creat add return figur rapier algorithm special rule filler offic kansa nn nnp citi missouri nnp nnp assum semant class citi assum filler gener produc rule empti pattern filler item gener list word word constraint gener disjunct word constraint tag constraint item gener rule tag constraint word belong singl semant class semant remain unconstrain filler produc filler max nnp filler max nnp rule cover spuriou add gener iter algorithm consid pattern item side filler result filler max nnp filler max nnp item produc comma ident unchang produc list place item pattern special produc gener element pattern element pattern continu special altern algorithm move element pattern gener element produc special rule current length length locat offic nn special improv special proce element pattern list pattern item pattern pattern item gener assum lexicon semant class gener state produc semant constraint class tag constraint nnp word constraint disjunct state final rule filler max nnp nnp state chapter evalu develop rapier show machin learn develop inform extract system relat learn suitabl task test rapier inform extract task fairli domain compar rapier perform task learn system naiv learner fix window contextu inform compar rapier relat learn system recent develop research examin type constraint rapier emploi run ablat test domain task descript domain consist set job post usenet newsgroup inform extract task identifi type inform creat searchabl field post date maintain field describ job job languag platform requir year experi slot slot job post total slot task slot task differ difficulti human id post trivial fairli obviou slot locat requir desir year experi posit titl decid programm produc compani recruit fairli easi easi distinguish slot provid inform specif platform includ oper machin area serv cover interest item broad area comput scienc artifici natur languag applic framework subject area world wide web slot requir lot domain specif knowledg difficult determin context unfamiliar term belong slot area slot difficult domain set announc seminar collect dayn freitag carnegi mellon task extract piec start end speaker slot multipl form start slot consid fill correctli long correct string extract domain set reuter newswir articl corpor acquisit collect carnegi mellon inform extract task identifi slot slot identifi entiti acquir full code slot busi locat entiti dollar amount statu acquisit exampl document fill templat domain found appendix data rapier requir full syntact requir segment text token sentenc tagger tag text experi document segment simpl perl script separ word recogn common abbrevi list common abbrevi avoid sentenc break base period break document sentenc punctuat blank line result tag brill tagger train wall street journal corpu tune domain techniqu section initi result rapier tag tune inspect tag result domain bigram word list common word corpu ad lexicon part speech tune hour domain ablat rapier system design semant class part speech tag rule import util kind inform experi present version rapier full system part speech semant class ablat word ablat word tag compar version rapier inform type inform system compar system compar naiv inform extract system develop carnegi mellon classifi word occurr featur filler fix window filler estim probabl segment text base estim probabl word text segment filler slot probabl word window segment left context window slot word window segment context window slot issu type system cope necessarili uniform length system consid multipl text segment begin length shortest filler slot longest filler slot naiv system consid word side potenti context suffici human determin string system proposit natur context suffici system recogn word filler repres structur filler greater probabl string filler word conjunct separ experi naiv show simpl set featur demonstr superior relat learn slot simpl proposit insuffici learn system develop goal similar rapier relat learn system depend syntact analysi differ significantli rapier system srv srv cover algorithm similar foil predic express inform length posit rel posit result featur test token featur languag express abil advantag semant inform inform provid featur experi report srv suppli featur token token singl digit featur describ length featur specif seminar announc domain srv rule accuraci intern provid confid rule system whisk design handl type extract structur text text common web document netnew post free text articl whisk restrict form regular express make semant class inform syntact requir type inform learn algorithm cover rule creation begin select seed whisk creat rule restrict choic term ad rule seed whisk differ srv rapier rule oper wai singl rule extract item slot oper whisk oper typic sentenc similarli size unit limit amount context rule interest featur whisk activ learn whisk design form select sampl confid random select pool instanc class unlabel cover exist support reliabl rule provid miss exist provid instanc cover ensur complet rule base srv whisk relat expect show rapier significantli examin perform show rapier competit recent provid evid relat learn inform extract methodolog experi averag ten trial report result separ test data job train subset train data size order produc learn curv seminar announc corpor acquisit ten split dayn freitag order permit comparison result random split dataset train half data test half test machin learn system measur simpl number exampl correctli classifi type dont fix number exampl simpl accuraci clear mean measur percentag slot filler system find percentag slot filler correct templat found system correct extract extract recal correct extract correct templat recal result complet correct lower system produc spuriou rule overli gener respect lower recal system fail find correct rule specif respect multipl filler filler count separ number describ perform system report experi chapter addit report measur experi muc confer introduc combin recal order provid singl number measur inform extract system comput fi fi weight measur prefer recal tool examin rel perform system report number fi equal order facilit comparison case report percentag slot fill filler predict figur figur report dayn freitag system seminar announc corpor acquisit includ addit recal order comparison made test statist conduct pair experi chapter conduct rapier set default paramet number pair randomli select gener iter compress algorithm width beam beam search number time row attempt creat gener rule fail compress rule slot end number time row special loop iter improv rule beam number posit exampl rule requir cover job post result job post conduct experi version rapier inform suppli naiv inform extract system naiv system baselin indic learn reli word occurr filler fix context default width window system word side preliminari test show word improv perform job post experi system threshold paramet set maxim recal figur show learn curv system figur show recal learn curv recal present figur present learn curv naiv system perform shown fairli competit slot naiv perform poorli multipl filler common note low set naiv system threshold account low recal lower rapier threshold simultan lower significantli lower version rapier result domain relat learn simpler naiv system emploi insuffici produc system result rapier point interest word word po tag train exampl rapier tag naiv figur job post train exampl rapier tag naiv figur recal job post train exampl rapier tag naiv figur job post full system fact bia algorithm fairli specif natur result primarili approach high import task creat job high recal desir correct inform import inform correct point interest learn curv steep rapier algorithm appar effect make maxim small number exampl learn curv flatten bit number exampl due part fact domain includ document similar ad exampl significantli amount inform learn system problem usefulli address activ learn discuss chapter recal exampl perform version obviou word constraint provid power rule inform provid tag semant class present word addit po tag constraint semant class constraint provid gener word constraint simpler easili cover complet class word word class disjunct word order repres addit tag constraint improv perform lower number exampl recal version tag constraint significantli level point train curv exampl word constraint capabl repres concept provid po tag differ word po tag exampl statist wordnet semant class provid perform word po tag result encourag similar score system templat element task similar inform extract suffici construct job learn whisk appli data set singl trial document train remain whisk achiev recal rapier word achiev recal whisk test singl import result rapier worst singl trial exampl gave recal clear whisk perform task possibl restrict context singl sentenc rapier learn rule cross sentenc boundari slot relat learn system perform task naiv system simpli summari accuraci learn system slot difficulti slot vari human difficulti vari comput system tabl show result slot train exampl easiest field comput easiest human system perform id rapier system perform post naiv achiev low locat year requir difficult rapier rapier perform good lower recal compani recruit due difficulti distinguish field unlik rapier perform poorli titl slot slot memor context inconsist slot rapier perform poorli area slot difficulti slot human discuss rapier perform poorli easi naiv achiev reason recal locat slot compani recruit slot extrem poorli due system inabl order token fix context window seminar announc result seminar announc ran experi version report result result report data data split naiv system mention srv dataset consist randomli split approxim half run train test set approxim exampl result system report individu slot figur report measur coverag lower bound recal comput multipli coverag report result whisk result singl train document test remain result base singl overli confid comparison system id titl salari prec rec prec rec prec rec rapier compani recruit state prec rec prec rec prec rec rapier citi countri languag prec rec prec rec prec rec rapier platform applic area prec rec prec rec prec rec rapier req yr exp de yr exp req prec rec prec rec prec rec rapier de post date total prec rec prec rec prec rec rapier tabl result slot job post task system loc prec rec cov prec rec cov prec rec cov rapier srv whisk system speaker prec rec cov rapier srv whisk tabl result seminar announc task system base tabl show result system slot seminar announc task figur recal naiv srv lower bound recal system perform start time end time rapier semant class perform significantli start time system slot content high perform start time end time differ distribut reason differ perform naiv slot differ impact srv rapier perform compar result word version appar perform end time slot cmu system whisk regular express handl field system locat difficult field po tag bit locat typic consist sequenc cardin number proper po tag recogn consist field whisk outperform rapier difficult compar srv perform whisk rapier srv higher recal lower recal system easili determin clear relat system naiv fact build recur data word inform difficult slot extract task speaker slot naiv rapier word perform speaker seldom recur dataset system word occurr inform refer kind orthograph featur srv po provid inform speaker proper noun rapier po tag perform recal dont recal difficult determin system slot system acquir seller prec rec cov prec rec cov prec rec cov rapier srv prec rec cov prec rec cov prec rec cov rapier srv statu prec rec cov prec rec cov prec rec cov rapier srv tabl result corpor acquisit task domain semant class impact rapier perform semant constraint appar posit neg effect util start time semant class discourag system learn contextu rule slot rapier perform achiev task word po tag result support relat learn task show proposit system simpl featur suffici corpor acquisit result seminar announc corpor acquisit ran experi version rapier compar figur report naiv srv figur report individu slot train test perform random split data train test exampl tabl show result system slot task freitag report result slot identifi data figur recal naiv srv lower bound immedi clear task difficult seminar announc system slot extract distinguish full abbrevi extrem difficult rapier part problem distinct full abbrevi compani make difficult rapier learn context field full abbrevi show similar distinguish data seller seller abbrevi affect learn poorli field field entiti acquir perform rapier improv seller slot access po show tag gener system data determin learn system task difficult po tag rapier surprisingli document grammat domain reli visual layout convei inform clear naiv perform srv seller field compar srv rapier problemat data srv acquisit rapier perform lack exact recal figur bia strong bia high srv threshold figur shown intend maxim coverag low higher difficult system perform slot shown relat learn effect naiv system learner handl task suffici order perform rapier requir repres syntact phrase relationship discuss result show relat learn learn rule inform effect proposit system comparison differ relat system due factor system inform extract task system featur system word capabl repres sequenc term rapier srv capabl repres inform length filler rapier segment text repres constrain whisk version rapier make po system experi srv boolean featur provid orthograph system inform case po tag provid similar capit word tag proper number tag cardin featur specif seminar announc domain futur examin effect differ relat learn depend featur due algorithm system fairli easili extens includ featur compar system perform featur set accuraci learn system area inform import perform train test complex relat rapier train time fairli long train time run rapier run irix job word version vari averag minut train exampl averag hour train exampl complex learn problem ad tag train time minut train exampl hour train train time semant ident word tag seminar train time shorter exampl shorter fewer slot learn rule word version train exampl hour averag ad tag averag hour acquisit data fewer slot train job averag train time hour word version hour tag version train time prohibit time involv human construct similar rule consid develop time inform extract system typic measur perform rapier compar naiv system train faster show job domain accuraci speed rapier favor lengthi train time gener problem develop practic test time test time job domain semant wordnet differ due file requir retriev wordnet semant class test time lower seminar announc domain corpor acquisit domain fewer slot corpor acquisit domain semant exampl semant close exampl semant seminar announc domain time suffici short rule practic inform extract system issu interest learn system complex definit complex vari number train exampl estim complex notion size rule chapter measur size rule includ rule creat gener initi initi rule contribut rule base coverag exampl complex rule depend primarili slightli complex small depend type constraint averag rule complex job domain exampl exampl complex seminar announc rule averag complex rule corpor acquisit higher averag complex job domain grow number exampl learn number rule growth straight linear figur train exampl rapier word figur complex function number exampl construct sampl learn rule final interest thing rapier type rule creat common type rule learn kind slot rule simpli memor set rapier learn platform job word document extract platform interest rule line extract languag slot pattern filler pattern consist pattern list length word constraint pattern item seminar announc rule locat slot extract build cardin number rule memor includ context ensur filler extract case rule area slot job domain extract rule reli context filler pattern formal messag id job filler messag length id major rule mix context content filler rule titl job filler seminar announc rule start time reli combin structur filler filler forg cd cd nn corpor acquisit rule extract statu filler tog rule fairli rule slot corpor acquisit filler length tog nnp forg exampl type rule rapier appendix chapter activ learn rapier goal machin learn reduc human time build system human annot train exampl build annot gener easier requir knowledg task rule annot easier build rule ensur annot time spent effect examin learn curv chapter job post domain reveal curv steep level climb slowli part reason phenomenon document train set similar exampl class document exampl class document effect rule time spent person annot exampl wast find wai exampl annot learn activ learn machin learn concern type issu activ learn system influenc exampl construct request type determin set unlabel exampl call select sampl lewi dagan natur languag task inform wealth unannot data issu cost annot data select sampl basic idea select sampl learn begin small pool annot exampl larg pool unannot exampl learner run annot result definit select addit exampl annot select proce sequenti sampl batch sampl sequenti pool unannot exampl examin time label current learn definit accept learn annot label reject select learner updat select batch entir pool exampl label current definit exampl select annot ad pool annot exampl learner updat definit consid pool remain unannot exampl primari method determin exampl sampl sampl learner maintain multipl definit consist current train data multipl element version space categor unlabel exampl select label exampl disagr cohn singl potenti inform exampl accuraci gain label significantli fewer exampl compar random select exampl chosen guid learner correct definit definit ad learn system produc correct definit point system larger select annot probabl proport amount disagr label sampl successfulli natur languag task tag text categor definit definit assign confid measur label confid exampl select annot idea exampl definit confid provid addit exampl confid confirm definit correct strengthen confid demonstr definit correct enabl learn produc definit incorpor select sampl rapier implement select sampl primari design sequenti batch sampl sampl chose batch sampl choic effect elimin unnecessari annot cost examin candid select annot perform faster examin candid turn accept reject batch sampl avoid establish threshold determin system suffici confid handl correctli system select learn confid disagr concern confid disagr priori reason believ work difficult implement context rapier sampl chosen primarili effici sampl requir learn multipl rapier train time chapter uncertainti rapier sampl requir notion confid system label order determin confid label begin notion confid rule rapier notion certainti threshold confid rule treat simpli coverag posit exampl train set penalti coverag neg conf po reason notion confid fairli straightforward shown major error made learn rule made rule cover small number posit exampl trust rule cover larg number posit train exampl distrust cover exampl distrust rule cover neg exampl number posit exampl overwhelm substanti penalti rule cover neg exampl notion confid determin confid label slot case singl rule find confid slot confid rule fill slot confid slot determin reason wai averag confid maximum minimum confid attent confid rule find exampl confirm contradict altern final determin confid slot confid empti slot rule extract slot consid confid slot empti larg percentag time job salari present half seldom compani recruit post dont empti recruit slot necessarili confid label slot absenc slot confid exampl label handl track number time slot train data filler figur confid slot filler found confid slot confid easili found sum confid slot make rapier increment major drawback activ learn rapier train time select small pool exampl iter select exampl time lead select similar iter retrain addit train time begin prohibit make rapier increment fairli straightforward process allevi problem rapier compress approach mean chang increment fairli simpl rapier begin compress creat read add rule compress result increment version rapier begin read exampl creat exampl rule ad read prevent system rule overli rapier evalu rule entir set rule cover neg metric threshold neg coverag section rule remov rule creat posit cover origin rule system creat rule initi develop learn proce chapter increment version rapier reduc learn time minut rule evalu exampl rule evalu percentag learn deal overli gener rule train time significantli reduc compar learn scratch make select sampl realist perform significantli impact train exampl random sampl select sampl figur result select sampl versu random select exampl evalu order evalu util activ learn rapier conduct experi job post domain experi ran train test set chapter rapier achiev result exampl job domain word constraint word constraint conduct activ learn experi word constraint trial began construct exampl experi describ chapter select sampl carri batch size run remain exampl train confid select train increment version rapier construct origin process iter recal measur interv figur show result select sampl process compar learn curv random select chapter order simplifi comparison exampl select sampl consist outperform random select differ curv repres larg reduct number exampl requir achiev level perform averag averag word version random exampl repres save exampl requir select sampl curv select sampl perform achiev random exampl exampl inform data set curv level exampl ad result select sampl method emploi simpl confid measur significantli reduc number exampl annot achiev level perform domain chapter relat work inform extract task work research recent begun appli machin learn task summari work field recent earlier attempt machin learn work context proposit machin learn assum exist prior syntact typic depend process mechan complet task advent world wide web wealth inform research begun develop system goal rapier system focu learn extract rule result directli desir depend prior aspect larger inform extract system earli machin learn system inform extract earliest attempt learn inform extract system autoslog autoslog creat dictionari extract pattern special set gener syntact pattern pattern larger inform extract system includ parser analysi modul autoslog major drawback requir human expert examin pattern produc determin extract pattern dictionari speed construct fulli autom special set gener pattern time doesnt account number correct exampl special number time sampl data pattern trigger incorrectli reason human expert examin valid pattern gener newer potenti pattern statist pattern match relev irrelev document system autoslog reli score pattern base number time templat annot human determin slot extract pattern earlier system human gener pattern select system crystal recent attempt appli machin learn creation inform extract pattern train instanc creat sentenc analyz identifi syntact constitu object tag word semant class crystal requir semant hierarchi domain list concept domain crystal extract pattern syntact consist constraint syntact constitu instanc constraint thing word semant root verb definit instanc extract slot crystal gener initi concept definit seed instanc relax constraint constitu cover addit instanc extract slot gener end neg exampl cover relax constraint system learn inform extract pattern repres rule constrain root verb semant constraint phrase extract gener special rule move semant hierarchi ad disjunct semant class limit inabl place word constraint noun preposit failur place semant constraint noun preposit phrase extract previou reli prior sentenc analysi identifi syntact element relationship learn inform extract pattern function autoslog learn pattern extract multipl singl slot pattern extract rule syntact constraint syntact relationship sentenc element find relationship link element ad element form path extract element extract pattern semant gener learn algorithm seed rule test rule train set primari limit requir sentenc analyz identifi noun make semant assum inform entiti extract system call develop tree learn locat document newer discuss similar system autom part inform extract task context complet inform extract system proposit learn tree learn tree predict token token final token featur tree result preprocess segment perform morpholog analysi lexic lookup tree token made fix number token learn tree identifi start end token tree identifi start end token match algorithm pair start end token identifi actual primari thing distinguish rapier earli system learn extract pattern rapier intend handl inform extract task part larger inform extract system system requir sentenc requir part full inform extract system clean output crystal requir semant hierarchi freeli tagger lexicon output distinguish characterist rapier learn algorithm system crystal gener applic machin learn techniqu creat gener train exampl autoslog set heurist creat gener singl evalu gener train set make perform pattern train data evalu gener base coverag train simpli gener base pick doesnt make train exampl gener process train exampl guid gener algorithm highli domain specif gener special consist move semant hierarchi ad disjunct semant class rapier base gener relat learn specif domain repres prove applic nlp task inform extract discuss section learn inform extract structur text result popular world wide web system automat process web page web page structur learn translat content web page class web page form enabl softwar robot page content relat entri system design task wrapper induct system handl tabular type uniform delimit identifi begin end slot delimit separ tabular inform surround text system learn rule cover miss data field learn wrapper system design wrapper seek improv kushmerick system induc transduc fashion learn algorithm handl miss slot multipl variant order except problem earlier system stalker cover algorithm learn finit automata act wrapper system shown handl web page kushmerick system learn train exampl system success system extract highli structur data lack limit work highli structur data recent learn inform extract free text research begun work learn system goal similar rapier system design work multipl type avoid relianc full syntact analysi make syntact semant inform system present section naiv base classifi goal void relianc syntact analysi domainspecif semant intend stand requir freitag extend work combin naiv classifi grammat induct approach varieti token capit addit actual token featur set emploi srv grammat induct combin naiv system enabl system structur system context srv whisk full section similar system relat learn system design goal rule capabl repres complex includ sequenti relationship handl form syntact semant inform system differ significantli learn algorithm srv whisk cover algorithm primarili rapier compress algorithm primarili compon base result present chapter srv rapier perform strength whisk perform system task test discuss chapter clear differ system attribut algorithm type inform system clear relat learn direct inform extract research strength weak system aid develop effect inform extract system chapter futur work number direct work extend addit test addit domain exist system includ extract web page extract rental ad addit stori domain compani manag number enhanc made rapier algorithm includ extend deal addit constraint type learn pattern relat slot filler work activ learn extend examin option confid measur explor possibl combin confid measur rapier make assumpt leav open issu inform extract address deal distinct relev irrelev document assum case frame problemat assumpt task interest explor applic rapier gener learn algorithm type natur languag problem addit test domain test rapier realist inform extract task shown perform perform compar current learn system data set test rapier perform type document task set web page research project compil cmu test rapier perform html interest sourc inform extract task interest dataset rental ad mention success perform task requir extens learn multipl slot rule test compani manag task provid domain afford opportun compar rapier perform inform extract system enhanc rapier algorithm addit constraint type obviou extens rapier add addit constrain type possibl consid incorpor morpholog inform morpholog function wordnet altern sourc constraint root inflect word surfac form word add complex learn constraint give rise gener issu word tag gener disjunct simpli remov constraint possibl addit rapier add constraint boolean featur token srv number simpl boolean featur easi comput orthograph featur word singl upper rapier extend incorpor long simpl boolean add branch factor concern featur constrain constrain issu disjunct multipl gener negat constraint addit algorithm add negat semant class text match item list constraint constraint found compar correct filler found rule spuriou filler produc produc constraint avoid element spuriou filler constraint match larg percentag spuriou correct filler ad result ad list potenti rule negat constraint soderland suggest possibl ad negat constraint whisk regular express syntax rapier perform inform domain job post seminar corpor acquisit consist standard grammat text inform syntact analysi type domain order incorpor inform creat altern type pattern repres syntact phrase rapier deal syntact unit complic aspect algorithm syntact pattern element includ pattern element make specif rule consist highest level syntact unit provid sentenc analysi refer remaind hierarchi system gener syntact unit special algorithm accommod altern pattern element option ad unit syntact level left current rule special phase man dog origin rule girl left cat special algorithm entir verb preposit final noun phrase final noun branch factor search full necessarili requir provid syntact inform rapier simpler option noun phrase system identifi noun phrase attempt full aspect syntax easili incorpor rapier rule requir order express relationship syntact unit unit label noun phrase function indic verb subject semant attempt learn inform easili obtain freeli natur languag process tool semant inform gener lexicon experi report chapter incorpor gener semant class wordnet improv task consid explor possibl incorpor domain specif semant class includ list comput oper month countri extract begin peopl began evalu system accomplish part inform extract task task consid evalu identifi proper design entiti interest corpor peopl extractor part text rapier simplifi rule learn slot filler recruit compani slot job speaker slot seminar announc seller slot corpor acquisit domain multipl slot rule extens rapier abil learn rule extract filler multipl slot advantag learn rule slot relationship learn singl rule slot focu search good rule learn start time end time seminar announc learn acquir corpor acquisit posit compani manag domain situat multipl filler filler connect rental ad domain whisk test common size price list ad simpli extract number bedroom price connect learn rule extract number bedroom relat price solv problem modifi rapier handl multipl slot extract rule fairli straightforward rule simpli addit pattern context pattern primari issu problemat gener pattern slot filler long gener pair prohibit approach learn connect start unconstrain pattern list break pattern item smaller list ad constraint origin rule pair limit long constraint improv rule qualiti recal develop inform extract necess recal develop rapier develop system high good recal job partial motiv prefer task prefer recal extract filter inform human didnt entir maxim recal cost lower rapier trade recal wai multipl learn random seed recal accept extract accept filler percentag provid limit sort tradeoff possibl approach similar intern method assign confid possibl creation gener threshold determin confid predict requir vari recal notion confid rule chapter select sampl cover initi sort partial match rapier system extract item recal boost bag recent bit work machin learn accuraci classifi boost bag method involv learn multipl definit set vari multipl definit vote classif exampl weight iter definit learn exampl equal weight weight exampl weight exampl misclassifi initi definit weight correctli classifi exampl boost process learn definit newli weight exampl adjust weight final classifi result learn definit weight definit vote function definit accuraci train set definit learn train set size drawn initi set train exampl size train set definit learn typic includ exampl multipl time exclud exampl final classifi result vote break ti arbitrarili bag boost shown effect wai improv classifi perform improv learn inform extract drawback emploi techniqu necess learn multipl rapier train time experi activ learn experi appli activ learn rapier discuss show select sampl usefulli appli learn inform extract interest question explor mention chapter necess select sampl effect choic empir question develop larg determin slot request annot produc disagr sampl chapter problem dealt slot rapier high bia cost slot suffici empti activ learn system mechan deal randomli count match empti slot disagr base percentag time slot fill train data develop differ member rapier easi inher random algorithm simpli random seed prove encourag gener paramet forc greater compress initi open issu inform extract slot filler system learn extract current rapier system extract valu string directli origin document text select set valu slot terror task templat mention chapter type stage execut incid categori instrument categori physic extend algorithm handl extract valu type system straightforward rule modifi includ set case set valu indic string match filler pattern extract case handl gener process modifi slightli account extract interest pair rule gener extract extract string document train data provid system extens actual system portion document creat pattern extract case string simpli occurr string document anchor rule portion document anchor rule rule identifi stage execut terrorist incid anchor phrase mass kidnap point document incid accomplish attempt threaten anchor provid rapier heurist start point work explor possibl find word phrase common document share slot rare document word phrase anchor rule deal issu treat text categor problem learner design handl text categor se adapt rapier problem text categor learner learn categor rule treat slot categori potenti advantag rapier standard text categor approach case inform base abil creat rule anchor document local context bag word document relev issu inform extract rapier deal identifi relev irrelev document experi present document train test relev document job post domain job post document corpor acquisit domain describ acquisit fulli autom system deal relev irrelev relev templat job system categor engin kind job irrelev post rapier system stand address consid altern deal option run document rapier extract rule templat result extract determin document relev templat highest percentag slot document complet irrelev slot fill system learn slot make relev slot highli specif easili fill irrelev document date job offer post inform inform extract netnew post extract filler number year experi requir strong evid messag job distinguish comput job kind job option deal issu distinguish relev irrelev document determin set templat standard inform retriev relev feedback techniqu frake text categor learn system classifi document initi pass document inform extract templat made extend rapier handl document classif task separ slot fix valu primari difficulti issu anchor feasibl person identifi portion document place anchor rule determin classif document idea find phrase distinguish filler valu phrase anchor allevi problem option potenti weak strength empir test requir determin method handl classif issu recogn multipl case frame assum document rapier assum document produc singl fill templat case frame assumpt true train test data experi thesi necessarili case relev document job post singl post describ job rental ad domain mention singl ad describ includ price creat fill multipl templat singl document issu system recogn creat multipl templat recogn slot filler multipl filler extract effect domain rental ad domain job post slot multipl job titl multipl variat job option recogn typic order typic order filler slot typic filler slot document filler slot filler slot filler slot clue multipl templat creat option learn text segment rapier appli altern learn approach domain job post rapier learn rule recogn transit job primari inform job seldom intertwin clear demarc job research learn approach segment text approach depend shift vocabulari due shift move job seminar announc produc chang vocabulari issu deal multipl case frame associ correct filler templat mention domain facilit learn rule extract filler multipl slot domain job simpli divid document section describ separ case appli rule section final issu simplest domain recogn slot singl appli templat creat exampl includ messag post recruit compani job post issu handl simpli learn slot domain document appli case templat merg issu issu inform extract task handl issu rapier avoid address task creat job problem seldom simpli put refer refer version job titl seminar announc situat handl desir start time seminar express item logic perform measur count slot correctli fill version slot consid correctli fill dont penal system extract version version version refer thing extens natur languag process task rapier basic algorithm prove natur languag process task inform extract task learn rule word disambigu task easili map current system templat creat word templat slot word filler case word system learn pattern select word desir content filler rule interest result run rule determin word filler select altern map word disambigu task inform extract task templat consist singl slot fix set valu word interest run experi word disambigu corpora learn system rapier algorithm success task hope find addit natur languag process task algorithm possibl text classif pattern automat anchor slot good text classif requir multipl pattern anchor part text learn singl rule chapter abil extract desir piec inform natur languag text import task grow number potenti applic task requir locat specif data newsgroup messag web page applic amount textual inform inform extract system import method make inform manag manual construct inform extract system labori learn method potenti autom develop process dissert present rule relat learn algorithm learn inform extract rule rapier relat learn construct unbound rule inform extract text fill templat learn pattern emploi limit syntact semant inform identifi potenti slot filler surround context system differ learn system attempt task primarili learn algorithm rapier differ previou learn system inform extract learn rule accomplish task relianc previou syntact analysi intend handl inform extract task part larger inform extract system evalu rapier shown perform realist inform task perform significantli proposit machin learn system inform support hypothesi relat learn proposit learn due structur natur languag comparison recent relat learn system inform extract support hypothesi relat system perform requir determin variat perform primarili due algorithm differ system featur system drawback machin learn build inform extract system necess number annot exampl research method reduc number exampl requir learn inform extract rule experi select sampl rapier shown select sampl significantli reduc amount annot requir develop inform extract system rapier simpl notion confid achiev select exampl perform system built randomli select reduc requir number annot exampl dissert shown current machin learn relat learn combin rule effect accomplish natur languag process task appendix sampl data appendix pair document templat domain experi research templat consist templat list slot slot slot colon separ job exampl document templat job inform extract task document aug fri aug pm fort agent excel opportun work small team compani develop softwar bank manag mean direct excit strong window develop complet develop team window bit expert mfc commerci applic year experi team enthusiast readi learn technolog doe respond immedi ph templat tx austin window mfc aug document softwar tx sep cook fort free agent post major softwar tool vendor locat texa open softwar develop privat casual work environ great lead edg technolog window produc qualiti code easi maintain document perform function compon design commun design team member product author perform unit test coordin problem resolut support tech product manag requir year window develop sdk level code knowledg rdbm hire salari rang depend qualif excel benefit reloc assist paid hire compani green card statu actual work experi strongli prefer repli attach ascii text format refer post number repli posit contract repli john cook cook cook perman placement firm busi special placement inform process nation local basi larg portion busi involv reloc system domest unit state client compani includ user organ proprietari softwar fortun firm year experi histori confidenti servic work career move cost fee paid client compani inform opportun resum templat softwar develop cook texa tx austin window informix oracl rdbm mfc sep seminar announc sampl document pair templat seminar announc domain document daniela cornel fine motion plan dexter manipul pm pm wing auditorium baker hall ri seminar jan pm pm refresh serv pm wing auditorium baker hall daniela cornel fine motion plan dexter manipul meet talk daniela ru schedul appoint call send dexter import featur robot oper intellig independ environ plan dexter manipul view gener motion plan lead intract algorithm develop effici geometr algorithm class part orient problem set cooper agent robot robot mobil fixtur desir robust plan agent accomplish desir present effici exact algorithm polygon object size show extens polyhedra algorithm exploit geometr structur problem task mechan requir implement planar problem context team cooper autonom mobil robot team box polyhedr cross section plan requir describ algorithm robust acquisit geometr model mobil robot error bound demonstr perform video work jim explor noisi sensor typic found mobil build adequ account detail model manipul satisfi model inform request manipul planner templat seminar pm pm wing auditorium baker hall daniela ru document special ai seminar pm ken forbu northwestern give seminar virtual laboratori engin tomorrow abstract post templat seminar pm ken forbu corpor acquisit sampl document pair templat corpor acquisit domain document entertain seek eddi june market presid demand list eddi compani pursu merger nj electron retail file secur exchang demand list made june desir commun eddi compani hold pct stake eddi common acquir share negoti merger tender offer entertain market inform june lehman brother act behalf provid told sec entertain firm involv electron home shop dlr share merger acquisit eddi modifi june includ particip eddi manag entertain market told sec expect meet eddi repres futur entertain market retain lambert advisor invest light june announc eddi chemic bank longer fund dlr credit facil declin price entertain market evalu altern respect eddi stock depend evalu includ action eddi board parti bid entertain market presid hold present stake sell share open privat connect merger tender offer sec entertain market bought current hold eddi common share june dlr dlr total dlr reuter templat acquisit market entertain entertain market em eddi eddi nj electron pursu merger document american travel make acquisit march american travel corp enter agreement isl life insur corpor shell activ oper dlr compani close expect late spring result american travel state reuter templat acquisit american travel corp american travel isl life insur dlr dalla enter agreement appendix learn inform extract rule appendix set learn inform extract rule domain report dissert includ rule creat compress rule cover gener rule rule learn experi chapter rapier word tag format rule present pattern format prolog list pattern element element constraint singl constant prolog list constraint disjunct job learn exampl experi section seminar announc learn experi report section rapier word tag corpor acquisit rule learn exampl experi section rapier word tag appendix tag appendix list tag experi chapter tag mean cc coordin conjunct cd cardin number dt determin existenti fw foreign word preposit subordin conjunct jj adject jjr compar jj ls list item marker md modal nn singular mass nn plural nnp proper singular nnp proper plural predetermin po possess end pp person pronoun possess pronoun rb adverb compar rb rp particl sym symbol uh vb base form past present participl past participl person singular present person singular present wp possess bibliographi evalu autom manual acquisit anaphora resolut strategi annual meet associ comput pp ma text segment exponenti model confer empir method natur languag pp learn tag multilingu text observ confer empir method natur languag pp eighth intern workshop machin part vi learn il bag predictor machin automat grammar induct free approach annual meet associ comput pp ohio learn natur languag case studi tag comput confer empir method natur languag process pa advanc part speech tag twelfth nation confer artifici pp knowledg acquisit sentenc analysi eleventh nation confer artifici pp empir method inform extract ai statist languag learn mit press introduct special issu comput linguist larg corpora comput text categor relat learn twelfth intern confer machin pp san ca morgan kaufman learn rule classifi paper aaai spring symposium machin learn inform pp aaai press fast effect rule induct twelfth intern confer machin learn improv gener activ learn machin sampl train probabilist classifi twelfth intern confer machin pp san ca morgan kaufman darpa fourth darpa messag understand evalu san ca morgan kaufman darpa darpa messag understand evalu san ca morgan kaufman darpa messag understand san ca morgan kaufman de theori clausal discoveri thirteenth intern joint confer artifici pp franc minim manual annot cost train corpora annual meet associ comput linguist santa ca electron lexic mit ma descript umass system messag understand pp inform data structur algorithm prentic hall grammat infer improv inform extract work note workshop automata grammat languag acquisit inform extract applic gener learn approach fifteenth nation confer artifici intellig learn inform extract fifteenth intern confer machin pp learn inform extract annual meet associ comput linguist experi boost algorithm thirteenth intern confer machin pp gener learn applic boost technic bell murrai nj concept learn problem small disjunct eleventh intern joint confer artifici pp wrap semistructur web page transduc confer autom learn discoveri learn inform extract pattern exampl symbol approach learn natur languag pp berlin acquisit linguist pattern inform extract ieee transact knowledg data wrapper induct inform extract fifteenth intern joint confer artifici intellig induct logic techniqu applic elli horwood descript circu system messag understand pp perform evalu technolog ai heterogen uncertainti sampl learn eleventh intern confer machin pp san ca morgan kaufman activ learn text categor fourteenth nation confer artifici pp statist model annual meet associ comput pp ma build larg annot corpu penn treebank comput tree resolut fourteenth intern joint confer artifici pp theori methodolog induct learn artifici subsymbol natur languag integr model memori mit ma introduct lexic ftp fulli statist approach natur languag interfac annual meet associ comput pp santa ca gener search artifici compar experi disambigu word illustr role bia machin learn confer empir method natur languag pp pa induct result learn past english verb journal artifici intellig oracl base approach construct induct tenth intern joint confer artifici pp itali machin invent predic invert resolut intern confer machin pp ann mi effici induct logic program induct logic pp academ york protein secondari structur predict machin learn protein induct logic program academ ny entail progol gener comput wrapper induct inform sourc confer autom learn discoveri integr multipl knowledg sourc disambigu word approach annual meet associ comput pp santa ca approach integr empir learn induct logic pp academ york note induct gener machin intellig elsevi york program machin learn morgan san minimum descript length principl categor theori eleventh intern confer machin pp mdl categor theori twelfth intern confer machin learn thirteenth nation confer artifici pp midterm report european confer machin pp vienna infer tree minimum descript length principl inform learn logic definit relat machin linear observ time statist parser base maximum entropi model confer empir method natur languag pp connectionist approach natur languag process lawrenc erlbaum nj detect subject boundari languag independ stochast approach confer empir method natur languag pp automat construct dictionari inform extract task eleventh nation confer artifici pp automat gener extract pattern untag text thirteenth nation confer artifici pp model shortest data descript workshop learn text wisconsin automat text analysi retriev inform comput queri acm workshop comput learn theori pa learn exploit document relationship case relat learn web confer autom learn discoveri translat colloc bilingu statist approach comput learn inform extract rule free text machin press induc conceptu dictionari fourteenth intern joint confer artifici pp issu induct learn domainspecif text extract rule symbol approach learn natur languag pp berlin theori studi induct artifici acquisit lexicon semant sentenc annual meet associ comput pp ma semant lexicon acquisit learn natur languag interfac sixth workshop larg corpora comput program studi natur languag commun men machin commun associ comput symbol approach learn natur languag process springer berlin studi featur select text categor fourteenth intern confer machin pp combin method induct logic program eleventh intern confer machin pp nj learn queri induct logic program thirteenth nation confer artifici intellig induc logic program explicit neg exampl intern workshop induct logic pp belgium
DB/329 3 languag develop interact web servic clau ander mller ander sandholm michael depart comput scienc denmark abstract program languag compil develop interact web servic goal languag design remov obstacl face current develop web servic order lower cost function reliabl compil translat program standard technolog http authent paper describ major facet languag design techniqu compar design altern web servic technolog introduct program languag develop interact web servic complet specif compil standard technolog http authent aim simpl construct advanc servic concern behavior graphic layout page left tool commit run lowest common denomin special softwar requir browser server servic plain html exploit subset javascript common standard browser languag collect individu languag aspect interact web servic minim syntact contribut languag held skeleton languag feel special main aspect languag underli runtim constitut conceptu foundat model build session sequenti session multipl interact browser ordinari program specif complex concurr control requir figur screen dump type dynam document simpl safe dynam construct html document aspect includ cryptolog input applet interact extern monitor process data languag superfici strong type system automat garbag collect support sophist macro mechan syntax extend easili featur primit core reduc basic macro omit design averag programm casual user requir program skill tool product servic requir detail knowledg web technolog typic kind interact web servic web board forum discuss client repli messag servic develop center web board servic typic hierarch list show messag relat figur show messag list show easili small interact web servic gener small argu remaind easi extend make qualiti web servic section describ aspect languag illustr appendix complet instanc sourc code restrict version shown full found home page runtim system exist varieti technolog construct interact web servic divid fundament tradit typic base cgi perl languag asp server home section describ approach greater exhibit defici motiv approach problem implement desir approach address session model tradit interact web servic number connect script script start request client protocol read cgi access common dynam gener repli termin script form servic script insert link script repli page wide platform write interact web script languag perl combin standard cgi server limit client interact process creat server impact scalabl number client ident process run time overhead start process programm manual care store restor relev state inform time script start end problem remedi script process run sequenc interact larger problem approach inher requir detail knowledg underli librari fact make write maintain complex servic guid languag variant approach base imper program style simpler approach asp servic code web page client request special web server interpret code replac html code result interpret design script build page client design page piec code build dynam part page basic intent approach make easier add dynam static web level abstract improv scalabl issu fundament approach base interpret script languag compil mean typic static check enforc strong type system error occur runtim caught develop reduc develop time improv stabil servic error caught earli classifi languag object model function mean static check consist part servic code gener web page major problem approach programm maintain coher view servic structur produc web page control code html code scatter piec highli unclear interact clear pictur flow servic approach claim superior experi show servic medium structur servic sourc converg obtain approach asp page consist larg chunk servic code gener page conclud program point view languag improv scalabl make easier start write simpl web servic address problem mention languag characterist static check consist concept structur separ servic code html control flow explicit languag design criteria mind inspir base concept session view web servic client set independ client guid session interact control process server session concept illustr figur session structur directli reflect servic code servic written singl program spread number web page servic control flow potenti develop understand servic compil perform analysi consist server code html code repli comput sleep session process submit show page form fill server client start session figur interact web session support deal html topic section separ servic code html code benefit programm web page web page design program main flow interact web servic captur session interact pattern cumbersom programm client section extens session model introduc permit page updat automat client make show set interconnect page client server interact build top cgi level abstract script web page number technic issu address order implement session model standard technolog standard protocol standard support common browser web server problem protocol stateless cgi server maintain inform session ident cgi connect interact belong session mean session state ident model session access common gener make client back previou page histori client browser fill url obsolet page fill resubmit form longer make servic expect receiv servic programm client step back previou fair program explicitli control flow client browser bookmark interrupt session back ad bookmark page gener directli cgi script store url point script gener page select bookmark previou form gener make bookmark function useless worst case hazard problem relev standard server instanc problem inher cgi present languag support session model librari function asp session client assign process run resid session model process commun client standard server overcom lack state dedic runtim system cgi protocol requir process singl client tini transient process call connect cgi server resid session process reminisc connector care thing mention session uniqu file recent page shown client send repli interact directli client cgi written visibl client normal html url url repli page fix durat function solv problem histori bookmark press bring client back web page start natur session temporarili suspend subsequ continu bookmark url session ident fit fundament web store session id browser cooki asp hidden input field approach combin connector method extend featur repli client readi amount temporari repli explain reason delai written file shown client connector page automat reload real page shown client readi explan client impati lose interest assum server connect runtim system illustr figur implement standard function compon figur part concurr control featur section detail system found argu runtim system explain implement scale scenario remedi combin server thread process session result system close dedic web server overhead indirect repli page repetit reload temporari repli argu neglig compar main network server contribut small piec inform temporari repli reload implement real idea base runtim system standard cgi session thread repli control internet client server connector figur runtim system interact session session process repli file benefit client requir log prior access messag list log chang view messag read write set prefer suggest structur simpl sourc code shown figur servic number session kind defin session kind imper code insid session augment construct small illustr power approach clear flow session inform directli reflect structur sourc code make simpl comprehend extend session initi protect naiv attack secur scheme inher underli runtim system primit client send hidden form check connector prevent attack highli vulner eavesdrop servic requir support full cryptograph encrypt authent explain section due repli page session client shown obsolet page browser histori crucial featur explain delai valid login inform client made awar concurr control number session process run interact client access share obviou concurr control larg web servic quickli requir complic control hard implement maintain semaphor primit approach declar languag specif behavior express flexibl significantli compil translat constraint oper servic session show valid login switch case show hierarch messag list case show select messag case show messag case show prefer show page figur sourc code structur runtim enforc conform global servic behavior central control compon run server figur central compon distribut system gener typic web scenario fast machin slow control rare perform servic size primarili aim circumst distribut control constrain execut typic synchron constraint inform sound session occur hasnt occur point kind event event trigger session pass call wait form switch wait case case timeout execut wait statement session wait control grant access event occur permiss grant event consid execut session resum locat code timeout session wait control grant permiss continu wait cancel session resum execut code timeout specif short version wait form servic induc sequenc event job control ensur sequenc fulfil constraint appropri execut session process constraint logic automata constraint written linear tempor logic dialect monad logic string express logic specif safeti properti state bad logic color petri net messag sequenc specif declar succinct logic distinguish construct automata oper regular languag recogn automata defin monad logic string piec session wait critic region wait constraint label label line declar enter leav formula enter event leav event formula ensur mutual session natur constraint formula complex macro languag section programm wrap constraint layer level abstract compil individu constraint formula transform tool minim automaton accept set event sequenc satisfi formula result set automata implicit product automaton conjoin constraint explicit easili singl constraint minim automaton enter leav enter enter event session critic region control compon runtim system figur control automaton number event initi automata queue figur insid runtim control automata start state session process request permiss pass wait session id ad queue design event event enabl transit event lead accept state control automata queue event control make event transit event wake session front queue inform event remov id session queue control illustr figur express regular languag automata gener notion extrem complex safeti requir limit hindranc number session vari time principl arbitrarili session protocol number reader writer access critic region arbitrari number reader region time writer process enforc control rememb current number reader express basic constraint languag overcom limit notion trigger counter introduc trigger event simpl arithmet formula express relat number event kind occur trigger trigger reader enter mean event reader occur time equat number reader enter event occur equal number reader leav event trigger event consid mean programm restrict express trigger formula involv addit subtract event count integ constant implement control automata extend number trigger counter event occur arithmet formula true trigger event occur enabl reader trigger easi formul protocol constraint languag gener constraint languag extend trigger shown formal specif concurr control requir averag programm deal constraint formula typic conveni macro packag section hide inher complex concurr control aspect greater detail concurr control content messag list client prefer share session process access concurr control protocol suitabl safe session simultan read share access requir constraint wrap macro section easi enforc messag list prefer declar protect critic region protect simpli macro reader writer detail hidden layer macro definit full version administr make privileg administr modifi messag list user list concurr access servic regular client deni perform intermedi modif applic concurr control section extens runtim call implement automat updat web page applic concurr write manag servic constraint organ execut task involv client web succinctli express concurr control logic relat web servic requir form persist store share inform individu session achiev file access extern program languag develop web address issu explicitli instanc support wide rang sql vast number sql queri built languag servic larg quantiti inform choic reli data rescu mechan acknowledg plan integr sql futur larg number servic oper data set small medium begin aim simpler lightweight solut solut bridg gap intern extern data access modifi equip small intern capabl store nativ valu extern global variabl access manipul local present programm uniform concept data manipul substanti sql queri section macro abstract mechan cloth solut standard sql queri quantiti persist inform vari greatli servic organ invari complex inform servic typic structur record chosen simpl relat approach incorpor vector languag nativ valu advantag approach compar pointer object structur avoid pointer refer relat error concept tupl parallel role struct complex structur encod relat section tree structur relat reason simplic nest relat inspir solut base tradit sql approach gener oper factor oper cartesian product full relat algebra semant preserv translat exist direct approach oper framework queri fulli integr rest queri program similarli code solut sql simpl address invent mechan strongli type compil determin type compon vector type definit construct schema defin composit subsequ declar vector variabl variabl servic local global local variabl privat run session process privat copi global variabl hand persist share session servic declar prefix modifi global local declar global relat hold post messag relationship type messag defin subsequ declar global relat schema messag int repli string time time global relat messag illustr manipul vector messag select board select macro section extract tupl board repli result tupl sort id vector type dynam document creat web servic tradit web document construct dynam typic statement dynam mechan document client interact major drawback tradit approach lack static safeti perl mean gener determin script produc html readabl client form input field document match expect receiv script printf document construct linear fashion top bottom construct focu part document dynam data readi focu plug part document structur hard separ task dynam construct web document mention section separ task advantag web page design concentr design web page servic logic programm concentr implement servic logic advantag level abstract document valu construct shown client comput flat string written standard output project problem address introduc notion document templat html document gap gap replac simpl content text string number static safeti document construct runtim static safeti gain sacrif flexibl tradit document construct languag guid inspir similar templat mechan simpl valu plug static check provid mechan build document flexibl author static safeti aspect mechan base notion templat templat templat gap replac templat gap dynam mechan call special care analysi check correct creat document type check document reli sound forward analysi track gap input field occur program static check valid html templat mechan make easier programm ensur balanc section describ approach detail found figur plug languag construct languag support dynam construct html document templat section describ syntax provid extens html plug oper combin statement show dynam gener page client read suppli input field valu state run session document templat introduc syntax ad express templat introduc kind pictur funni duck foo bar gap plug html gap plug attribut string html extens pure intern standard document present web client provid static introduc notion document document requir satisfi gap occur document input field occur occurr radio checkbox document good previou document gap foo occurr input field kind remov text kind occurr make document satisfi field part requir plug oper document express document constant html plug oper result plug oper gap replac illustr figur document construct templat build block dynam data plug oper show statement form html document show call send document client browser retriev suppli input field valu explain section call show receiv vn interact document shown client submit receiv valu form field fn assign program variabl illustr simpl plug oper html enter string show color string gap html gap content input field assign variabl static safeti program check found special provid static static document receiv document plug oper document shown input field expect receiv part static document relat runtim error occur static safeti provid introduc complic notion document type type explicitli written infer compil global flow analysi document type distinct gap map field map gap map describ gap present document field map describ input field forward flow analysi associ sound gap field inform document variabl program point base inform determin program type correct properti list fact hold suitabl error messag produc runtim exploit fact document construct runtim due static implement obtain techniqu resembl closur function implement compact share static part perform plug oper low time complex implement detail tupl input field section describ extra intern extens ad document syntax notion tupl input field relat dynam vari size receiv extens consist call tupl section collat input valu document show pizza amount extra pizza roma amount extra denot tupl view singl input field order extens multipl occurr input field document field valu automat transform tupl vector relat schema explain section vector relat present nativ valu support tupl input field nest hold basic valu stress extens pure intern standard html document present web client dynam document central notion dynam document extens sophist dynam document hierarch messag list transform document transform shown simplifi version time inher complex schema messag int string global relat messag html entri html con html string int html entri vector messag board return show schema messag defin relat board schema messag declar idea entri uniqu repli entri subject abstract actual content entri attribut email address contributor build document reflect hierarch structur defin constant templat entri con build entri list gener document initi statement call function view entri argument view function build html entri id templat entri argument id subject repli current entri found sort section ad document loop templat con call made repli includ transit closur repli static safeti analyz handi check document templat exist gap plug oper note possibl separ web design servic logic templat entri sophist respect design complex readabl servic logic code servic talk servic document templat automat extract piec inform page fetch web document templat pattern gap correspond piec extract match construct attempt string document templat part document match complet match part string correspond gap assign list variabl execut html string thing cool string match valu variabl obviou applic search engin extract url inform catalog arbitrari web page gener reach combin match oper cgi oper post easili write web build top exist web servic necessarili form input valid case data enter client text input field requir compli format field instanc expect valid email address enter achiev input valid page program server determin enter data requir form program output page error messag erron input client correct illustr figur repeat input field data wide approach annoi excess network valid data data data data submit resend page resubmit comput enter client server data submit enter comput client server valid data figur input valid requir tediou explicit program solut autom valid move illustr figur overcom mention drawback give detail explan solut illustr exampl mention techniqu appli text pattern match task format valid programm defin format attach input field type text submiss form input server prohibit data enter input field compli attach format client continu session input field data valid place save time result server valid valid benefit perform client enter data error signal make servic conveni format programm standard regular express enhanc ascii charact integ interv conveni servic format express translat minim determinist automata automata run increment client data enter field input field state automaton run data data input field compli format state accept document term valid inspect state input field accept notic automata reminisc techniqu concurr control section malici client bypass valid data doubl check rerun automata data receiv inconsist runtim error issu regular reason regular express specif grammar languag regular express wide text instanc perl due declar program oper requir behalf servic programm make easi simpl modifi decid string languag defin regular express automaton experi show express power regular express common valid valid email requir express regular defer rare implement number technolog consid implement input valid reason section disregard browser specif activex leav javascript java applet candid javascript advantag lightweight java virtual machin requir amount javascript implement current browser stabl java hand catch event control text displai extra event displai control exploit catch kei displai messag show text gui text conform format displai red java text field html text input experienc problem scale font match surround html text due reliabl current implement base javascript lack displai featur imag displai input field attach format imag dynam chang reflect automaton current crash state compil displai verdict automaton text enter languag defin regular light green yellow input prefix closur languag light red input automaton crash state imag redefin accompani text messag browser statu bar automata automat gener compil servic compil file server client fetch demand web thing format file small repeatedli cach browser proxi server typic fetch client updat prefer prompt email choic messag filter format defin subsequ attach input field format digit format number format alpha format word format email html filter messag older dai field email field consist word number dai field number document client submit page continu fill legal valu reason readabl chosen elabor syntax regular express frequent syntax asterisk sign format applic format text parallel regular express perl match mention section test string compli format string languag defin regular featur simpl format string return return function wrap string repli string present default repli text repli messag work progress involv piec string match design part regular express regular express perl similar format applic file scan oper scan file identifi format return file current file posit regular languag defin format advanc file pointer exampl format provid power mechan text make easi perform form input valid intern servic code cryptograph secur cgi servic execut secur client request server sensit inform support authent kind client session interact server parti solut problem conceal sensit inform encrypt establish ident integr digit signatur lack precaut measur attribut complex amount detail involv design adapt protocol servic hand lot servic address compil gener web servic code highlevel uniqu opportun address issu level depend individu gener automat compil implement varieti secur modifi manipul level secur servic produc appli level servic made entir individu call piec document matter plug explain section secur level respect password file verif basic http authent protocol singular server commun client session modifi servic verifi ip number client chang select ip address servic sign document digit sign algorithm secret encrypt document rsa modifi singular rest follow select modifi implement directli http authent advanc modifi sign secret implement ssl mention modifi plan secur technolog incorpor programm longer worri complex secur simpli add modifi program obtain requir level secur advanc secur macro mechan program languag gener mechan programm extend languag construct repres relev concept abstract level typic mechan macro class class languag suit drawback requir paradigm order properli syntact categori benefit class mechan restrict instanc regard mechan typic oper lexic level mean complet independ languag syntax make hard macro build layer advanc abstract macro benefit simpl mechan semant substitut syntax chosen macro mechan limit macro mechan address macro mechan resembl remaind section describ macro mechan show number small applic exampl make evid macro provid simpl valuabl abstract mechan aspect languag macro macro mechan work perform substitut sourc code actual place problem inevit approach care defin macro expand code expect standard macro defin seemingli innoc macro appli result bug hard find macro definit syntax check separ syntax type error error messag gener expand code origin code make hard track error limit possibl build layer macro reason move macro abstract mechan lexic level syntact level oper piec lexic oper construct legal tree order ensur macro nontermin languag grammar macro bodi requir compli macro bodi sequenc arbitrari return type nontermin determin macro invok error issu bodi return type correspond formal paramet macro type nontermin macro requir actual paramet compli paramet type nontermin languag grammar potenti return type paramet type move lexic level syntact level correspond wai move untyp languag type languag ad type error caught earli make easier read understand code illustr macro mechan work exampl macro repeat bool repeat origin definit macro expand program program repeat repeat figur tree show definit construct languag return type nontermin statement express construct defin defin size result argument mention bodi invok macro program depict figur white part written servic programm grei part macro programm benefit compar macro substitut place situat squar longer occur macro definit syntax check appli check argument fit macro expand macro fit place applic defin macro dynam extend ad product grammar macro mechan addit featur arbitrari syntax macro mechan invoc syntax design macro programm flexibl major advantag syntax convei mean macro abstract underli languag transpar extend construct inher part languag give construct control structur condit termin syntax enforc constitut error deviat subsequ invoc order limit current macro begin uniqu restrict loosen lose liber approach arbitrari syntax make import macro sourc code complet unread alpha clash occur instanc construct nest insid variabl bound improperli solut problem perform alpha alpha identifi bodi macro time invok bodi macro close scope identifi clash longer occur error report oper syntax tree token sequenc obtain error macro layer error messag thread back macro error list complet trail macro programm locat correct error program macro pretti print featur macro implement pretti print compil gener pretti printer capabl print code html advantag hypertext mechan html insert jump identifi usag macro invoc keyword specif refer instruct expand macro result output macro mechan design languag independ mechan specif appli program languag involv complex task control concurr creat defin simpl abstract origin exampl exampl show macro mechan term creat abstract concurr control macro section typic programm worri complex logic formula simpli concurr control abstract present macro mechan recal mutual section mutual predic conveni defin macro forbid enter construct fact defin macro macro section exhibit techniqu obtain access critic region wrap wait wait enter leav event programm defin explicitli add requir relat wait statement time access requir macro lift higher level abstract complet hide detail event macro region constraint label macro wait wait oper concaten identifi declar event region programm region region macro subsequ statement identifi oper grant access statement extend concept region similar techniqu creat sophist concurr abstract protocol writer prioriti reader protect global resourc macro build top region macro ensur macro protect macro reader macro writer bodi macro servic programm prepend global variabl declar protect programm obtain read write access variabl statement reader writer usual programm worri logic simpl power construct provid macro macro concurr macro level abstract queri flexibl syntax properti macro exploit make real sql queri sql queri select defin select queri defin macro select factor return abstract detail queri languag factor oper programm sql queri queri sql queri includ standard librari format macro regular express constructor defin email format section occurr regular express part macro defin regular express constructor instanc regular express cryptograph secur macro write macro collect secur requir present organ number macro bric shown defin common bric macro librari special modifi bric macro bric singular exampl macro build layer abstract top sublanguag found home page plan futur languag implement extend number direct show plan idea improv extend runtim model session base runtim model section success captur main flow servic kind kind interact fit elegantli simpl model gener design principl separ main servic code code code easili programm interact program model violat design principl make interact awkward client section exampl power extens runtim model solv problem document cluster servic interact link document shown client independ main servic flow current runtim model servic programm forc mix code deal main servic code inevit tediou program complic maintain client server show cluster figur document cluster figur order separ main servic code runtim model extend explain cluster form servic code construct resembl plug oper section plug document form link show repli file gener document reachabl document client cluster involv session process document cluster illustr figur small complic recal present setup repli file serv ident session fix durat session retain small modif runtim repli file longer retriev directli http server connector process connector receiv id session cgi queri string document return page runtim model inher limit client interact requir time page updat client click messag post servic similar featur lack automat updat annoi client illustr similar problem servic client relat tabl tabl larg desir tabl shown scroll client relev part updat page network program runtim model section main flow servic code quickli clutter code deal tabl violat design principl mention annoi clutter main elegantli solv kind session introduc session initi directli client normal session java applet locat page shown client session normal session perform show client wait normal repli page show applet normal session client server figur session perform return return applet initi applet resembl invoc remot procedur call server inspect modifi global data commun safeti control section wait event occur perform event behavior session servic figur illustr page updat automat client interact simpl wait session belong client event applet page inform simul click send inform requir updat page notic show kind implement express succinctli simpli handl applet fetch part tabl requir updat page exampl illustr notion power eleg techniqu enhanc runtim model significantli java applet program facilit set java stub care paramet marshal automat gener compil servic monitor compil automat gener special session kind privileg client monitor entir servic servic manag inspect modifi global safeti control monitor inform actual state servic log inform statist static html valid section issu dynam document construct consist gap input field static check document type check mechan solv issu document shown client valid html conform dtd highli check static hard challeng creat analysi futur plan investig implement remain issu plan implement support extern issu cryptograph signatur encrypt section implement part implement claim suitabl creation servic involv vast amount data requir confidenti main goal design languag permit construct advanc web servic identifi strong candid main aspect web servic runtim concurr dynam document construct solut macro small intern valid provid valuabl support basic design complet languag extens step gain experi languag present develop experi suggest extens open sourc distribut compil detail document freeli project home page contribut develop acknowledg tom ball provid extens inform experi languag christensen particip implement christian lone valuabl feedback suggest made particip spring appendix sourc code appendix show full sourc code servic divid actual document templat separ programm concentr program web page design requir servic advanc web board servic section home page servic const int view const int read const int repli const int pref const int quit protect global int schema messag int string time protect global relat messag protect global int schema user string int bool protect global relat user format format digit format number format alpha format word format email session int todo int tupl user int tupl messag relat messag tupl messag factor return string return vector string return string string date date date date return login tupl user relat user vector user string tupl user show receiv reader select add user user filter dai writer user relat user return view board html relat messag time int html tupl messag vector messag messag subject mailto retriev children children select html return void time relat messag reader expir expir show msg receiv case todo todo todo todo todo read messag void bool tupl messag relat messag reader messag show subject content mailto receiv todo todo repli messag string return return void bool relat messag tupl messag string repli messag messag reader subject show content send subject writer id tupl id email subject content writer board relat todo prefer tupl user user html email dai show receiv todo return void writer user select user user session code user switch case case case case user exit html login prefer html prefer ident filter filter filter messag older dai displai time view board html messag refresh prefer quit total number html html html read messag html repli back repli messag html enter repli submit cancel html read wrote refer david thoma michael kenneth peter kenneth experi domain specif languag servic usenix confer domain specif santa octob leon atkinson core program prentic clau safeti control interact web servic master depart comput decemb clau ander ander michael runtim system interact web servic comput eighth intern world wide web confer alex al activ server page michael al project homepag cgi program world wide web oreilli nil ander mller version user manual bric note seri depart comput octob ram program languag hypermedia servic intl world wide web kim michael erik schmidt formal relat algebra inform process michael levi web program guid decemb ander mller project homepag ander sandholm michael domain specif languag type dynam document ander sandholm michael distribut safeti control web servic fundament approach softwar lectur note comput lnc page bric technic report daniel roger crew programm syntax macro acm sigplan confer program languag design implement volum page
DB/330 3 implement linear tabl mechan zhou depart comput inform colleg graduat citi york ny usa shen depart comput depart comput alberta canada abstract tabl adopt nonlinear comput state delai call preserv present implement linear tabl mechan kei idea call execut backtrack point variant call call exist linear tabl mechan advantag easi overhead standard prolog cut oper work class tabl program cut oper express condit program weak linear mechan necess comput xpoint found avoid portion call tabl predic implement linear tabl mechan comparison show close speed xsb recomput avoid space xsb program introduct tabl prolog techniqu rid nite loop program redund comput execut prolog program main idea tabl memor answer call answer resolv subsequ variant call tabl found applic includ program deduct theorem model problem solv tabl ad top prolog burden programm achiev satisfactori perform mandatori tabl support abstract machin level xsb prolog system support tabl slg resolut adopt xsb reli mechan tabl call variant tabl call result suspend produc add answer execut consum resum contrast linear sld resolut goal gener extend latest slg resolut mechan complic implement handl cut oper abstract machin adopt state consum preserv freez backtrack reclaim space stack wam chat preserv state copi part separ area copi back execut consum resum tabl call occur scope cut shen al strictli linear tabul call prolog main idea tabl call produc consum answer tabl call consum usual prolog produc answer call variant tabl call occur call steal choic point call turn produc answer remain call call produc consum answer tabl fashion backtrack strictli chronolog call answer exhaust stop answer xpoint reach implement extend abstract machin extens abstract machin straightforward linear modi cation exist instruct data area program tabl ect implement section show section avoid class tabl call call predic deduct transit closur belong class implement mechan chat benchmark suit fast xsb program deduct fast xsb result present section reader assum familiar logic program wam introduct give introduct reader refer formal descript formal proof sound complet de nition sld relat concept predic tabl prolog program divid tabl tabl predic explicitli declar declar predic symbol integ denot ariti call tabl predic call tabl call tabl call resolv call resolv sld tabl call occur rst sld tree call subsequ call variant pioneer call follow pioneer tabl pioneer follow tabl empti resolut tabl prolog program construct sld tree rst fashion sld resolut select call variant call rst answer tabl resolv call exhaust resolv call remain latest call current call steal choic point latest call backtrack similarli prolog backtrack tabl altern answer resolv call exhaust answer simpli fail risk lose answer decid call start rst predic repeat answer xpoint reach illustr behavior exampl resolv queri tabl rst appli call obtain goal subscript ad ect variabl renam figur call follow backtrack point appli result child goal answer call memor tabl resolv call lead empti goal answer ad tabl nish leftmost branch tree shown figur figur sld tree backtrack rst backtrack call node call consum tabl answer resolv deriv goal goal fail backtrack call answer tabl resolv call obtain answer ad tabl goal resolv obtain answer ad tabl goal answer return goal answer backtrack call node remain call answer resolv obtain goal fail immedi consum answer execut call fail produc answer fail backtrack pioneer consum remain previou produc answer illustr necess queri program queri answer lost call steal choic point variant call creat choic point locat left sld tree order solut di er found sld resolut explor queri rewrit subgoal fact resolv subgoal bind turn execut variant choic point rst answer resolv rst answer obtain backtrack answer lead solut note sld resolut answer obtain order issu happen call steal choic point ancestor check relationship variant accept practic branch locat left branch sld tree avoid test xpoint requir tabl predic order answer import extend tabl unlik argument pass stack frame frame predic call frame di erent type predic di erent structur implement introduc data call tabl memor tabl call frame structur tabl instruct encod basic oper tabl call tabl area illustr instruct exampl reader refer appendix complet de nition tabl area pioneer entri subgoal tabl predic symbol argument call pointer frame latest variant call list answer answer ad subgoal tabl hash tabl call kei ar eld point frame latest variant call valu pointer frame cut cut frame discard complet follow ar eld tabl entri call choic point steal execut start begin predic ar eld answer call produc tabl predic execut answer call answer tabl variant store list answer call answer tabl hash order answer preserv check continu set tabl predic execut set true answer ad answer tabl execut tabl check predic frame tabl call frame tabl call slot addit copi argument inform store choic point frame tabl pointer tabl entri call pointer answer consum pioneer pointer frame pioneer tabl call entri ad tabl tabl slot frame made point pioneer slot made point call follow entri subgoal tabl slot made point entri pioneer slot made point frame pioneer rst answer answer tabl dummi answer initi pointer dummi answer instruct newli introduc instruct tabl program cut illustr mean gener code fork call instruct start tabl call ad predic instruct encod choic point frame ar cp program top control choic trail tabl alloc instruct tabl alloc rst instruct tabl predic operand size predic address call instruct copi argument alloc frame call bookkeep oper instruct call creat entri tabl slot frame point tabl ar eld tabl entri point frame backtrack point frame set point instruct call follow entri subgoal tabl slot frame point tabl entri di erent action ar eld tabl entri ar eld mean frame discard cut oper treat call ar eld point current frame ar eld mean answer produc jump call consum answer ar eld point frame frame latest variant execut backtrack point store frame reset backtrack point oper call steal choic point tabl answer tabl answer instruct answer answer uni es origin argument call answer return control continu program turn execut instruct fork instruct reset backtrack point execut backtrack instruct fork pass argument start execut tabl add answer tabl add answer instruct add current answer tabl call answer answer thing tabl return answer caller answer trigger backtrack note situat answer ad tabl consum call tabl check complet mention address execut tabl answer instruct return remain answer tabl check complet instruct determin current predic ar eld tabl entri call discard current frame answer ad tabl round predic start answer ad tabl round set ar eld discard current fail cut cut oper behav strictli sld resolut cut cut discard choic point creat discard choic point cut connect tabl call tabl entri properli updat ar eld tabl entri ar eld tabl entri dangl pointer point frame longer exist handl cut di erent wai depend context cut call treat cut cut standard prolog discard choic point creat tabl tabl predic call cut discard choic point cut relationship tabl call tabl entri reset ar eld entri null introduc call tabl cut encod type mean cut resid tabl predic tabl cut discard choic point creat cut relationship tabl call tabl set backtrack point address call cut tabl answer tabl check complet instruct execut introduc call tabl cut encod type insid mean cut resid tabl predic ar eld subgoal tabl entri variant call treat pioneer tabl alloc cut resid tabl predic tabl call tabl call produc bind cut discard choic point disconnect tabl entri set ar eld entri null relationship cut execut pioneer answer return queri cut resid tabl tabl call left cut set backtrack point address end call follow execut end answer exist follow pioneer fail case consid ar eld tabl entri current call null execut illustr tabl queri reduc steal choic point pioneer execut cut set ar eld tabl entri null execut pioneer origin tabl check complet instruct lose solut cut handl tabl predic call call directli indirectli cut occur cycl call graph handl correctli signi progress cut rule complet tabl prolog system statement path xsb system preserv statu comput path path found optim avoid produc answer open problem decid exact class predic call avoid de ne class predic call unnecessari show optim de nition predic tabl predic call directli indirectli de nition tabl predic call bodi call call predic de nition tabl predic call predic consist possibl bodi theorem unnecessari variant call predic relat de ned join deduct rule evalu rule reach xpoint relat join tupl tupl newli gener tupl ad relat long follow answer answer produc pioneer fail follow safe exhaust answer note requir follow descend sibl variant call tabl compar time ecienc prog tcl sg cs cs gabriel pg read solut lost introduc call tabl end substitut tabl check complet instruct predic instruct rst check parent call pioneer current call behav tabl check complet xpoint reach parent pioneer di tabl end behav tabl check complet note er theorem fulli exploit avoid call call avoid test relationship perform evalu tabl compar time ecienc xsb set program batch schedul strategi tcl version version program comput transit closur graph sg comput relat graph rest program number ratio time xsb comparison workstat small time perform compar xsb program datalog program requir chat averag time slow xsb factor contribut applic predic tabl mechan implement left untouch relat check relat perform sg optim tabl compar stack space ecienc prog tcl sg cs cs gabriel pg read tabl compar tabl space ecienc prog tcl sg cs cs gabriel pg read suit argument tabl call complex term data call adopt xsb faster hash tabl emploi dicult draw consist gure averag fast xsb standard prolog hand trie data structur xsb advanc hash tabl manag tabl area pro ling execut chat program show time spent access tabl area fast data structur tabl call import fast prolog engin program impli potenti improv larg long tabl concern tabl compar amount stack space requir xsb run program chat preserv comput count consum space tabl call copi made control stack produc answer xsb requir stack space program multipl path search tree xsb consum time stack space tabl compar amount requir tabl space tabl space area store subgoal answer variant tabl copi store number answer store independ tabl mechan data structur manag data tabl requir tabl space system show di erenc di erent data structur xsb relat work wide prolog support tabl rst tabl call treat produc subsequ variant call treat consum execut backtrack state consum preserv backtrack scheme wam simplifi implement tabl demoen sagona altern scheme preserv choic point consum relat stack preserv state consum freez stack scheme save part state di erent area scheme simpler overhead execut standard prolog implement complic cut oper left present implement linear tabl mechan linear featur bring class cut handl correctli big step forward xsb tabl call resid scope cut sentenc path vertex path vertex found implement easi implement overhead execut standard prolog program implement overhead standard prolog program overhead reduc signi cantli chat implement achiev disadvantag scheme necess guo gupta tabl scheme combin advantag reorder altern tabl call execut loop loop conclud remark extend prolog narrow gap declar procedur read program urg long tabl perceiv narrow interest prolog implementor compar extens concurr constraint solv primari reason lack tabl mechan mechan simpler implement compar perform xsb program requir slower xsb program requir manipul complex term gap ecient data structur adopt tabl ectiv techniqu invent elimin loop gener variant call acknowledg work start rst author visit alberta summer implement work rst author institut technolog rst author support part onr grant author support part train programm foundat talent ministri educ grate bart demoen sagona kindli share chat benchmark suit refer amateur introduct queri process tabl evalu delai gener logic copi approach approach lnc cg sw extens tabl softwar practic hf ecient tabl dynam altern reorder proc workshop tabul deduct sep foundat logic logic program expert benjamin abstract machin tabl execut strati ed logic acm transact program languag system jh linear tabul resolut base prolog control theori practic logic program ecient access mechan tabl logic logic vol resolut proc lnc abstract prolog instruct technic report sri memo logic paramet pass control stack manag prolog implement acm transact program languag appendix tabl instruct copi argument slot directli origin alloc size ar pioneer add tabl treat ar pioneer steal backtrack point answer bookkeep oper add current answer tabl goto fail answer unifi answer origin argument return control caller ar discard current choic point frame provok backtrack ar child pioneer goto goto
HCI/331 4 septemb src research report kei solv code locat problem optim code tice prof susan graham system research center lytton avenu palo california compaq system research center src charter advanc state art comput system basic appli research support compani busi object interest project span scalabl system distribut internet inform interact mobil src establish digit equip corpor test idea build hardwar softwar prototyp assess util realist set interest system complex evalu sole practic enabl investig properti depth experi short term refin design invalu long term advanc knowledg major advanc inform system includ person distribut internet perform complementari work mathemat charact li establish field theoret comput analysi geometr secur formal specif verif work explor ground motiv problem system research strongli commit commun test idea research develop commun lead improv understand research report seri supplement public journal technic note seri time dissemin recent research find seek user prototyp system common encourag collabor research kei solv code locat problem optim code tice prof susan graham septemb prof susan graham work electr engin comput scienc depart berkelei reach email comput corpor work copi reproduc part commerci permiss copi part payment fee grant educ research provid partial copi includ notic copi permiss system research center compaq comput corpor palo acknowledg author individu contributor applic portion copyright notic republish requir payment fee system research center reserv abstract difficulti overcom process design implement debugg optim code problem face design debugg determin accur map locat sourc program locat optim binari solut problem critic aspect debugg set implement report error locat previou approach debug optim code present techniqu solv locat map problem code locat techniqu complex incomplet identifi kei instruct simpl formal map locat sourc program optim target program paper present concept kei instruct give formal definit kei instruct present algorithm identifi show greatli simplifi locat map approach solv problem relat debug optim code final briefli describ experi implement kei instruct concept present paper fundament profound import field debug optim code worthi care attent articul content introduct syntact versu semant breakpoint atom kei instruct sourc program locat atom identifi kei instruct concern atom semant breakpoint kei instruct set syntact breakpoint implement debugg function solv data locat problem rewrit reorder code transpar detect currenc descript implement implement detail kei instruct delai slot effort involv previou work instruct order algorithm select kei instruct gener algorithm select kei instruct introduct set problem debug optim data problem code locat problem data problem difficulti involv find return variabl user queri problem includ resid data locat currenc problem resid problem variabl current deem temporarili dead overwritten save lost imposs find return user data locat problem determin variabl assum regist address depend current pc currenc problem assum find current actual user base examin origin sourc program differ actual expect valu variabl occur optim chang order independ assign delai prematur execut assign respect sourc present user undu topic concern research year code locat problem map locat sourc program locat optim target program compil optim common increasingli gap sourc program optim target program greater instruct gener sourc statement delet interleav instruct sourc difficult decid target program sourc statement begin end critic debugg optim code map locat sourc program locat target program debugg map implement debugg function requir suspend execut locat sourc program function includ set control step return subroutin map inform report locat execut error past research debug optim code solv data currenc problem code locat problem larg map gener process work currenc problem code locat problem date complex ad incomplet section paper present simpl complet solut code locat base concept kei instruct section give detail problem syntact semant breakpoint illustr difficulti defin kei instruct formal present algorithm identifi section discuss kei instruct relat set breakpoint section discuss kei instruct implement debugg elabor wai kei instruct solv problem debug optim code discuss implement experi kei instruct section section review previou work section present syntact versu semant breakpoint code locat problem illustr instruct optim program breakpoint statement basic scheme set breakpoint optim syntact breakpoint semant breakpoint differ scheme instruct binari breakpoint locat syntact breakpoint locat base syntax origin sourc semant breakpoint locat base instruct gener sourc statement syntact breakpoint basic idea ensur breakpoint statement reach order statement occur origin sourc program optim stop syntact breakpoint superfici statement execut order sourc program syntact breakpoint statement locat code state program breakpoint wildli differ expect base examin sourc semant breakpoint breakpoint statement set instruct gener semant breakpoint semant statement execut order respect origin program pai attent statement execut breakpoint program state approxim expect figur tabl illustr differ syntact sourc code instruct add add add bot addi add top figur optim code sourc syntact semant statement breakpoint breakpoint tabl syntact semant breakpoint code figur breakpoint figur show small piec sourc code figur show instruct gener sourc code optim move statement portion loop sake variabl loop move statement loop set guard alter semant program tabl show instruct set syntact semant breakpoint statement figur statement syntact semant breakpoint happen interest case statement instruct implement statement instruct calcul final leav regist logic place put semant breakpoint statement syntact breakpoint syntact breakpoint statement locat syntact breakpoint occur instruct semant breakpoint statement instruct syntact breakpoint statement difficult place tabl show syntact breakpoint statement instruct instruct import point clear tabl whichev instruct syntact breakpoint statement instruct optim switch order instruct statement syntact breakpoint occur order origin sourc statement set breakpoint statement instruct case syntact breakpoint instruct set syntact breakpoint statement instruct case syntact breakpoint statement instruct breakpoint scheme advantag disadvantag syntact breakpoint statement occur order expect syntact breakpoint statement occur syntact breakpoint syntact breakpoint set statement execut suspend time loop execut time breakpoint statement code statement execut defeat breakpoint set semant code statement breakpoint set execut breakpoint occur order locat base examin sourc user suspend execut time set breakpoint statement semant execut suspend loop enter syntact breakpoint transpar approach debug optim attempt make effect optim transpar user statement execut order origin sourc program semant breakpoint attempt show user effect optim concept present paper reason introduc concept kei focu semant clear illustr kei instruct section describ kei instruct implement syntact breakpoint decid semant problem determin set breakpoint difficult decid statement occur figur tabl statement select semant breakpoint statement trivial statement multipl instruct statement select instruct chose final calcul perform easili chosen instruct gener similar argument made statement complic statement choic difficult address problem present idea kei instruct atom kei instruct start give inform definit kei instruct kei instruct singl instruct gener sourc statement close embodi semant sourc statement definit suggest kei instruct logic locat optim binari set semant breakpoint concept kei instruct zellweg mention similar discuss breakpoint implement mention idea repres instruct close reflect effect statement zellweg elabor idea explor identifi instruct sourc program locat atom discuss map locat sourc program locat target defin meant type program locat target program start instruct sourc program difficult defin commonli definit set breakpoint begin execut statement glanc definit work fairli deal optim target problem ideal sourc locat set breakpoint correspond place sourc interest event definit give definit program languag statement multipl event unoptim program sourc statement reason locat set interest event sourc statement execut interven event statement true program optim optim code event occur sourc statement wide scatter target program deal problem introduc concept atom formal defin introduc terminolog program languag simpl complex simpl statement piec kei complex statement piec kei function kei function function state program sourc sourc variabl control flow program context correspond piec kei function exampl event program state chang repres piec kei assign sourc arrai branch statement function call return gener control flow statement talk map sourc program locat target state cach relev work rest talk state state chang piec sourc code state kei instruct defin complex sourc statement multipl piec state chang sourc statement wrong level discuss sourc program locat introduc term atom sourc piec sourc singl state chang program atom largest piec contigu sourc text piec kei function atom kei instruct target program atom happen occur sourc kei sourc locat tag distinguish order select kei instruct identifi instruct atom logic method sourc posit compil associ target instruct front end compil gener column posit atom intern piec assign sourc posit atom assum compil propag sourc posit inform correctli target instruct sourc posit indic locat atom gener depend sourc instruct multipl sourc posit figur illustr concept atom figur assign increment statement function call statement figur show set statement underneath statement mark atom complex statement posit breakpoint set statement separ initi assign increment assign statement bodi loop updat element arrai increment statement shown function assign error function call statement atom consid atom statement critic record column line sourc posit record compil requir compil accur propag sourc locat inform critic attempt debug optim code atom figur exampl atom statement identifi kei instruct set instruct gener option select kei instruct chosen kei instruct defin definit atom sourc program list instruct optim target program compil gener singl instanc code kei instruct singl instruct state chang program definit assum code duplic cover case optim perform code instruct instanc duplic atom consid separ kei instruct identifi instanc topic detail definit kei instruct atom uniqu instruct state chang word instruct updat sourc variabl chang control flow definit atom instruct remain figur instruct state identifi instruct chang control flow easi instruct chang control flow condit branch instruct direct examin instruct condit branch identifi kei instruct type trivial difficulti attempt identifi instruct updat variabl assum identif process final optim code inform target instruct associ assign kei instruct characterist set instruct unoptim instruct write memori assum instruct updat sourc variabl subset instruct common optim elimin final write variabl variabl local variabl make set simplifi true circumst reli execut order instruct find kei instruct assign statement kei instruct assign sourc variabl instruct write final side assign variabl locat write memori optim instruct calcul final side assign leav regist instruct calcul side calcul variabl branch except kei instruct assumpt kei instruct assign atom instruct set instruct gener assign duplic copi code assign atom occur distinct basic block kei instruct atom basic side actual assign locat requir instruct code case specul execut make identifi kei instruct list instruct gener encount instruct order execut determin execut order condit branch instruct encount kei instruct atom branch instruct kei instruct instruct encount full algorithm approach shown appendix call algorithm instruct order algorithm cur addi load addi addi load addi addi load addi goto figur loop main problem algorithm reli properti kei instruct assign atom instruct turn reli assumpt true optim assign atom duplic target identifi kei instruct copi assign order set breakpoint copi user request breakpoint assign atom problem copi end basic case modifi algorithm examin basic block separ duplic copi assign atom end basic block happen loop addit instruct instruct basic block kei instruct assign easi identifi instruct circumst contribut difficulti identifi kei instruct assign atom optim elimin instruct write variabl locat memori kei instruct instruct calcul final righthand side assign atom number oper occur multipl time calcul reli type instruct identifi kei instruct assign atom variabl sort kei variabl instruct reli posit instruct identifi kei instruct assign atom figur illustr problem statement shown figur atom figur show instruct loop singl basic loop time statement instruct statement instruct case kei instruct statement instruct kei instruct difficult question combin circumst make imposs select kei instruct assign statement pure examin instruct select kei instruct assign statement presenc code duplic carefulli examin semant sourc assign statement instruct requir complic analysi compil perform requir earlier compil sourc gener intern program make advantag compil assum compil correctli assign sourc posit inform instruct front end compil gener intern tag piec intern eventu kei instruct assign atom tag propag identifi kei instruct assign atom kei instruct atom identifi method previou algorithm gener algorithm select kei instruct present appendix concern atom semant breakpoint concern atom locat set breakpoint user identifi atom set multipl breakpoint singl sourc line solut continu standard tradit user request breakpoint begin sourc line correspond begin execut sourc line multipl debugg identifi set breakpoint atom singl breakpoint request result breakpoint multipl sourc locat concern point sourc locat correspond syntact gener instruct exampl open close curli brace keyword statement syntact construct programm statement program fair game locat request breakpoint kei instruct set breakpoint instruct construct logic solut disallow breakpoint construct user attempt set breakpoint automat set breakpoint atom sourc program similar current debugg unoptim code kei instruct section demonstr versatil kei instruct show solv simplifi problem area debug optim code show gener kei instruct explain approach solv problem area debug optim code benefit kei instruct set syntact breakpoint kei instruct set semant breakpoint obviou set syntact breakpoint recal locat syntact breakpoint actual instruct sourc statement end target order statement origin sourc set syntact breakpoint set statement order shift decid statement statement statement kei instruct illustr sourc program consist order optim put instruct instruct target program syntact breakpoint breakpoint situat back figur tabl statement type situat statement stationari statement move past anchor statement set syntact breakpoint anchor statement instruct place breakpoint statement rel breakpoint anchor statement remain question identifi anchor multipl instruct set reason scheme identifi anchor point state control flow statement branch join control flow statement move anchor point simplest syntact semant breakpoint kei instruct set frame refer select anchor point nice syntact breakpoint coincid semant behavior closest expect user semant breakpoint inform obtain kei instruct implement debugg function basic debugg function critic depend good solut code locat set control sourc step call return subroutin statement subroutin call special case control consist remov breakpoint current statement set breakpoint definit step subroutin set breakpoint statement return set breakpoint statement subroutin call caller kei instruct provid natur mechan set semant set breakpoint atom find kei atom set compil identifi kei instruct debugg inform instruct kei instruct pass compil debugg symbol tabl dwarf standard symbol tabl format natur pass inform dwarf line tabl format symbol flag origin intend mark instruct correspond end sourc statement close mean kei flag kei instruct chang violat dwarf specif modifi debugg function kei instruct simpl straightforward kei instruct welldefin map implement function work properli optim program difficult complex solv data locat problem recal data locat main data determin breakpoint user request variabl locat vari execut optim construct variabl rang tabl inform variabl time program execut prior introduct kei inform collect separ variabl pass optim compil perform code collect inform distribut code perform optim implement easi code collect variabl locat inform broken optim writer time optim reorder chang code collect inform place distribut optim bug variabl locat collect code hard find fix advantag kei design implement robust scheme collect variabl locat inform basic idea perform dataflow analysi final optim perform data collect collect complet independ optim perform code collect inform make code easier memori regist regist spill explicit reason perform dataflow analysi critic depend identifi instruct correspond assign variabl explain section imposs determin instruct examin kei instruct tag give inform complet descript solut paper kei instruct rewrit reorder code debug optim code approach debugg user effect optim perform compil kei instruct debugg determin atom sourc program execut wai kei instruct context complex sourc statement rewritten atom statement kei instruct atom wide separ optim target debugg reorder sourc statement atom reflect actual order execut order execut order kei instruct target program transpar detect currenc basic part currenc detect variabl recov kei instruct recov aid detect variabl breakpoint sourc program show assign optim delai assign point past sourc program show assign occur optim move assign occur assign rel sourc program examin kei instruct assign sourc determin order assign occur compar order sourc statement occur assign order turn make difficult variabl scheme recov implement descript implement previou section discuss kei instruct section briefli describ implement kei instruct actual system debug optim code prototyp tool implement kei instruct demonstr practic approach debug optim code version sourc program gener sourc program reflect optim perform origin program compil compil process user debugg optim sourc program commun state execut program origin sourc program user refer order show idea workabl real implement work conjunct silicon graphic aggress optim compil implement top sgi commerci tool implement detail tool collect inform compil optim perform compil gener optim version sourc user examin debug modifi version debugg graphic interfac show user optim sourc gener user navig modifi underli debugg debug function section kei instruct inform symbol tabl modifi variabl lookup function variabl rang tabl implement partial solut resid problem compil identifi kei instruct sourc assign statement modifi front end compil tag piec intermedi eventu kei instruct assign statement kei instruct tag propag appropri phase binari instruct final correspond kei instruct assign statement tag compil algorithm shown appendix identifi kei instruct write tag symbol tabl modifi compil collect variabl rang tabl section write inform symbol tabl chang made compil call optim instruct complet immedi prior write instruct binari file user request breakpoint sourc find kei set singl breakpoint request result multipl breakpoint set optim code duplic note user set breakpoint sourc atom origin design user set breakpoint begin sourc line correspond begin execut statement avoid make massiv continu polici breakpoint sourc line result choic sourc locat system necessarili correspond singl atom tool gener optim allevi problem extent process gener optim sourc split statement rewrit atom statement order move atom freeli optim optim sourc accur reflect order atom execut binari difficult issu approach debug optim relev address kei instruct implement approach debug optim concept kei instruct complet orthogon issu kei instruct provid basic groundwork build solut problem area debug optim code kei instruct delai slot implement step break function interest problem relat kei instruct delai slot optim code kei instruct sourc statement schedul delai slot sourc statement occurr problem attempt set breakpoint statement kei instruct delai slot mip delai slot instruct execut separ branch execut halt delai slot instruct kei instruct breakpoint sourc statement result initi implement breakpoint statement delai slot kei instruct reach skip solut problem make branch instruct kei instruct delai slot statement situat branch instruct kei instruct sourc instruct annot optim sourc locat execut halt branch current sourc posit sourc statement effort involv sgi compil consist roughli line sourc code modifi compil track identifi kei instruct roughli month requir write chang line code month includ time familiar compil sourc make debugg function kei requir chang line code number adapt exist compil debugg identifi kei instruct difficult task difficult compar cost cost implement data unavail part number found zellweg navig involv modifi line compil ad line modifi compil build involv line code absolut number line code ad modifi approach requir bit roughli compar consid number line ad modifi percentag size approach requir smallest amount chang zellweg previou work earliest approach solv code locat problem design zellweg navig debugg zellweg tabl record maintain map sourc optim binari sourc tabl maintain object tabl maintain map compil record updat inform tabl optim sourc tabl map sourc statement begin sequenc instruct gener sourc statement scheme work system optim preserv actual order comput execut path code sink instruct schedul syntact breakpoint solv code locat problem doc statement boundari track attach label instruct intern gener instruct move label move instruct move instruct optim statement label constantli updat debugg build map sourc program optim binari sourc program record sourc program start end posit unit tabl build sourc rang describ object code rang sourc unit step set breakpoint granular sourc unit semant breakpoint implement set breakpoint instruct rang instruct sourc base sourc rang tabl approach accur requir huge amount data bookkeep present indirect solut code locat problem focu solv currenc problem process construct flow graph repres sourc object relationship solut code locat approach incomplet approach suggest closest kei instruct approach dual label set label direct map statement label set breakpoint sourc marker label sourc statement attribut runtim error statement label serv gener kei instruct give definit algorithm identifi initi locat statement describ label updat order correctli maintain optim idea place label optim updat label optim process recent approach present al approach complic sourc statement map set object anchor intercept finish escap point assum statement user request breakpoint anchor point schedul instruct intercept point instruct anchor point gener statement sourc program finish point instruct anchor point gener statement sourc program breakpoint set sourc debugg suspend execut intercept point intercept point interpret interpret code intercept point finish interpret instruct gener statement sourc program interpret reach finish debugg inform user breakpoint reach servic user request escap point reach finish interpret normal execut resum addit work larg bodi work debug optim code present solut code locat problem paper present complet solut code locat problem debug optim code introduc concept atom kei instruct formal definit kei instruct present algorithm identifi shown kei instruct aspect debug optim code addit solv code locat kei instruct simpler solut data locat problem identifi anchor point set syntact transpar solut currenc problem implement demonstr practic concept prove idea present paper incorpor exist compil debugg work atom kei instruct provid fundament base simpl greatli simplifi facilit solut problem area debug optim code worthi care instruct order algorithm select kei instruct sourc program kei kei fi branch fi od od gener algorithm select kei instruct phase statement program statement perform semant check gener intern assign sourc variabl find piec write set flag piec true fi od phase final instruct sourc program assign find instruct flag set mark instruct kei instruct skip atom kei kei fi branch fi od fi od refer variabl interact global regist alloc symbol confer record twentieth annual acm symposium principl program januari pp debug global optim phd publish hansen approach debug optim acm sigplan confer program languag design san ca acm sigplan notic juli pp code instruct ms oregon graduat institut scienc juli note hennessi debug optim transact program languag system april pp optim code acm program languag vol pp optim code phd santa practic approach debug global optim currenc determin optim acm transact program languag vol novemb pp debug optim transact program languag system juli pp chamber optim code dynam acm sigplan confer program languag design san ca acm sigplan notic juli pp optim code intern symposium softwar test august pollock global transact program languag april pp debugg acm sigplan notic april pp debug inform unix intern program languag special interest juli simmon view supercomput debug novemb pp tice robust method gener variabl rang tech report compaq system research palo septemb debug optim phd tech report oct tice approach examin optim acm sigplan workshop program analysi softwar tool acm sigplan notic juli pp note hennessi debug optim transact program languag system januari pp global optim program data flow analysi acm sigplan confer program languag design acm sigplan notic june pp olsen framework debug global optim acm confer program languag design acm sigplan notic pp interact debugg control flow optim program acm softwar engin symposium high level acm sigplan notic august pp level debug optim phd xerox parc tr
DB/332 3 data model data structur move object luca ralf hartmut gute enrico marku schneider abstract support spatial object continu chang posit term move object formal defin data model includ complex evolv spatial structur line network region hole data model collect data type oper plug attribut type dbm data model obtain complet model queri languag concept slice repres tempor develop set unit type spatial data type repres function time show model map concret physic data structur dbm environ introduct wide rang applic deal spatial object posit extent time appli hand object repres map pollut land parcel hand includ physic object move air oil polar flood exampl manag class object tradit task goal research support queri dynam class speak move object previou data type orient approach model queri data idea repres tempor develop spatial entiti data type move point move region valu type function associ instant time point region suitabl oper provid type support queri data type attribut type data implement provid extens packag data suitabl extens dbm environ work partial support chorochrono fund eu train mobil research contract erb dipartimento di ed universita degli studi di informatik marku question type oper level abstract type oper move point defin continu function time polylin space region defin connect subset plane polygon polygon hole essenti differ case defin domain data type term infinit case describ finit type discuss issu depth introduc term abstract model discret model level abstract level respect advantag abstract model clean focu essenti concept detail straightforward implement discret model fix gener complex make choic restrict rang valu abstract model repres move point repres polylin higher order polynomi spline case includ abstract model finit translat directli data structur level model design abstract model data type continu defin discret model abstract model develop main concern design orthogon type gener consist closur consist structur oper relat tempor type semant type oper defin formal paper continu work defin discret data model implement abstract model mean data type abstract model introduc type domain defin term finit defin constraint appli finit describ abstract model region set line set line segment describ valid region discret model specif data structur spatiotempor dbm part paper show discret model map real data structur implement attribut data type dbm paper offer good basi implement object data earlier work gener restrict accommod discret spatial valu worboi model repres entiti spatial tempor complex spatial part set rectangl time tempor part model paper gi studi implement issu effici storag scheme sequenc region snapshot research address dynam applic call object wolfson colleagu manag collect move point plane model describ current expect posit point repres motion vector main issu determin updat motion vector balanc cost updat knowledg posit model describ complet trajectori move address complex spatial structur region chomicki revesz studi framework object collect atom geometr atom object essenti spatial object dimens continu function describ develop spatial object time continu affin map subclass thereof consid establish basic rectangl linear translat scale close set oper polygon linear translat scale close union chorochrono address issu relat move object conceptu model discuss index refer address uncertainti captur move point trajectori constraint approach describ spatial data paper explicitli address exampl model knowledg exist literatur design type discret data model paper earlier work discuss idea basic issu relat data defin discret data model paper structur section abstract model basi design briefli review section defin discret data tempor type section describ data structur discret type algorithm illustr model data structur section section offer review abstract model abstract model offer data type system shown tabl base bool spatial region time instant base time rang rang base spatial tempor move tabl signatur describ abstract type system type system signatur signatur gener sort oper defin set term case sort call kind oper type constructor term gener signatur write signatur give argument result oper data type data type defin signatur mean data constant type bool domain extend special type point point real point finit set point line finit set continu curv plane region finit set disjoint face face connect subset plane interior face hole lie hole face type line region illustr figur type instant offer time domain isomorph real number rang type constructor produc type valu finit set disjoint interv argument domain intim constructor yield type associ time instant argument domain import type constructor move argument type ff base construct type valu function time domain domain ff function partial consist finit number continu compon made function time region valu type abstract model offer larg set oper defin gener oper type type construct move oper includ predic insid set oper aggreg oper numer result size distanc direct oper mechan call tempor oper defin step type uniformli consist made applic tempor type oper applic point region argument return lift applic point case return special oper offer tempor type valu function project domain rang intersect valu set valu domain rang form restrict function time rate chang observ briefli demonstr data type dbm data model attribut type pertain oper queri integr relat model relat plane synonym includ relat schema abstract data type term flight denot attribut valu record locat plane time pose queri introduc signatur oper formul special instanc exampl gener signatur specif found function kind denot capit type constructor ital underlin oper data type written bold face oper signatur trajectori line length line real distanc initi val real project move point plane consist point line oper trajectori comput line part project oper length determin length line distanc move point calcul distanc oper restrict move real time minim real pair move real return oper initi oper val appli pair project compon queri flight longer select id plane airlin queri emploi project space genuin answer aid pair plane flight closer select plane plane queri repres instanc join note distanc oper tempor lift version illustr queri exampl applic scenario multimedia forest fire control found applic demonstr flexibl power queri languag result design develop discret focu defin finit effici domain data type discret model includ oper oper abstract model discret model step develop algorithm implement oper discret scope simpl algorithm section data type overview section defin data type repres valu type abstract model discret type gener repres subset close chosen discret valu abstract type type constructor abstract model direct counterpart discret model move constructor imposs introduc discret level type constructor automat transform type tempor type type system discret model abstract type system intim introduc number type constructor implement move shown tabl base bool spatial region time instant base time rang rang base spatial tempor intim base spatial unit const unit unit map map tabl signatur describ discret type system give overview mean discret type constructor base type bool implement directli term program languag type spatial type point point direct discret type line region linear approxim polylin introduc type instant repres directli term program languag real number rang intim type repres set pair time instant straightforward interest part model tempor type repres paper describ slice basic idea tempor develop fragment call slice develop kind function illustr figur figur slice move real move point slice built type constructor map type describ singl slice call unit type unit type pair time interv simpl function defin time interv defin unit type valu chang trivial constant function provid const type constructor produc unit compon constant argument type repres move bool valu map data structur basic assembl set unit make time interv disjoint obtain correspond abstract discret tempor type shown tabl abstract type discret type tabl correspond abstract discret tempor type tabl omit repres discret chang real valu interest remaind section formal defin data type discret model type defin domain valu term finit algebra point defin sort carrier set type ff denot carrier set ff ff repres abstract carrier set abstract type type ff abstract ff denot carrier set view ff repres ff semant make clear ff meant ff inform descript suffici provid definit form oe denot function section definit type tempor type slice spatial tempor data type defin direct term polyhedra treat definit discret data type base type time type carrier set discret base type type time rest program languag type instant real int int real real string string bool bool instant instant special thing type includ undefin requir abstract model interest continu evolut type instant defin term program languag type real speak defin valu carrier set introduc notat ff ff introduc carrier set element set extend notat ff ff spatial data type defin finit singl point region euclidean space point pair coordin point real real point point semant element point element point assum lexicograph order point point type point simpli set point point point clear point repres abstract domain point definit discret type line region base linear approxim type line essenti finit set line segment plane figur show correspond abstract type figur line abstract model line discret model set line segment line line discret type abstract type set curv plane view planar graph node intersect curv edg piec curv discret line type repres curv polylin assum structur view shape collect line segment collect line segment plane defin valid collect curv planar abstract model figur model line set line segment express polylin view advantag comput project move point plane effici comput polylin graph structur prefer unstructur view seg point vg set line segment line fs ae seg seg predic collinear mean line segment lie infinit line space set line segment line requir overlap segment condit ensur uniqu collinear overlap segment merg singl segment semant line union point segment region discret level essenti collect polygon polygon hole formal definit base notion cycl figur region abstract model region discret model face definit similar rose algebra reconsid definit modifi bit environ extend case section cycl simpl defin cycl fs ae seg jsj fs mod segment intersect interior point end touch end point li interior segment segment meet common end point set end point fp point function point occur defin jf collect segment segment intersect end point occur segment arrang singl cycl disjoint notat hs refer order list face pair consist outer cycl possibl empti set hole cycl face ae cycl form segment cycl cycl cycl interior subset interior edg overlap interior disjoint edg overlap note segment cycl touch segment cycl overlap segment remov overlap part hole cycl merg condit ensur uniqu interpret set segment set face impli face face region basic set disjoint face region ff ae face face face outer cycl outer hole face face touch isol overlap boundari segment semant region cycl repres point plane point boundari face hole area subtract outer cycl result point set close abstract domain area region union area face set interv introduc rang type constructor convert type ff base time type valu finit set interv ff note type ff total order exist rang type repres collect time valu move real set total order interv definit rc rc interv repres end point flag lc rc indic mean interv fu sj lc rc set lc rc defin lc fsg lc rc feg rc interv denot oe semant express restrict open part interv interv lc rc lc rc disjoint adjac defin lc lc rc lc condit import discret domain int finit set interv defin fv condit ensur set interv uniqu minim rang type constructor defin ff base time defin intim type constructor subsect yield type valu consist time instant abstract model instant ff base spatial slice move object subsect introduc formal slice move object slice provid map type constructor repres move object set tempor unit inform tempor unit move data type ff maxim interv time valu instanc ff function tempor unit record evolut type ff time interv ensur mainten constraint evolut set tempor unit repres move object time interv mutual valu distinct requir ensur uniqu minim tempor unit gener concept subsect special data type subsect set concept tempor unit defin pair call tempor unit simpli unit compon call unit compon unit function map type constructor build set unit requir constraint fu map type constructor defin type ff unit ff unit subsect defin type structur introduc type constructor appli unit describ simpl function time defin gener function unit evalu unit function time instant ff type ff unit type ff ff ff suitabl defin set ff function ff ff instant ff omit index ff denot function map discret unit function instant time discret function time function serv express constraint structur unit term constraint structur express semant unit semant definit nontempor serv basi implement oper unit clear subsect instanti unit type tempor unit base type type ff base introduc type constructor const produc tempor unit ff carrier set defin ff recal notat ff refer carrier set ff undefin element empti set unit undefin empti make time interv simpli unit exist note introduc type constructor const explicit defin tempor unit appli type applic valu type chang discret step trivial tempor function unit defin note defin specif unit type automat defin semant unit tempor function abstract model unit type semant partial function instant int cover gener definit semant unit unit type ff instant ff semant defin discret ff semant definit case suffici unit type discret obtain end point time interv incorrect due case slightli extend gener semant definit accommod semant definit suffic defin function case move real introduc unit type function slice move real polynomi higher squar root polynomi motiv choic rich squar root polynomi express distanc function euclidean simplic discret type oper choic implement discret model close lift version distanc implement deriv oper abstract model carrier set type evalu time defin bt bt tempor unit spatial data type subsect special concept unit move instanc spatial data type similar move tempor evolut move spatial object continu smooth approxim wai find balanc rich simplic paper make design base approxim tempor behavior move spatial object linear function linear approxim ensur simpl effici data type manag complex algorithm complex function polynomi higher conceiv basi consid paper due concept slice move spatial object constraint order describ permit behavior type tempor unit end point time interv mark chang descript data requir constraint satisfi respect open interv end point time interv compon move object happen complet reason introduc slice descript move time interv limit descript finit set instant move point point set structur simplest spatial object move singl point start definit spatial unit type introduc set defin line describ unlimit tempor evolut point describ linearli move point evalu time instant carrier set simpli defin pass describ set move point carrier set defin ae jm oe encount time constraint valid open time interv unit unit collect linearli move point intersect open unit interv condit concern unit defin singl time point distinct instant evalu time set point point gener assum distribut set tupl defin set tupl move line introduc unit type line call restrict movement segment time interv segment maintain direct space segment rotat movement admit figur valid constraint deriv balanc figur instanc manipul data type express power rotat segment defin curv surfac space constitut accur approxim sequenc plane surfac carrier set base set move segment restrict overlap instant intern open time interv overlap mean line collinear intersect prepar definit introduc set pair line space repres move carrier set defin ae jm oe line line condit defin constraint open time interv treat case unit defin singl instant note defin due fact distribut set tupl inherit structur condit line valu segment condit requir seg oe oe semant defin gener definit earlier slightli chang cope degeneraci end point unit time anticip move segment point move segment overlap accommod defin separ function start time end time time call qg definit remov pair point return segment segment singl merg overlap segment maxim mean gener semant definit extend instant ff oe lc rc final remark design discret type move line assum instanc discret initi time unit move line constraint segment make discret rotat unit restrict fidel discret member unit leav possibl map endpoint segment long constraint satisfi figur discret continu move line mean instanc shown approach rough approxim figur discret move line intern time possibl addit intern chosen addit discret instant introduc approxim obtain easili limit sequenc discret reach arbitrari repres move region introduc move counterpart data type adopt restrict move rotat segment space admit base definit set pair line space addit constraint ensur unit obtain valid instanc region data type figur show valid show degeneraci occur end point unit figur instanc region move region basic build block concept cycl face introduc definit region carrier set inform set face intersect instant intern time interv formal definit introduc set intend describ move version restrict ff introduc set descript move version restrict ae note definit constraint set semant cycl face directli move region definit carrier set defin ae oe region region end point time interv provid separ function essenti work pair point obtain evalu remov pair proper segment collect overlap segment singl partit line fragment belong set segment segment overlap point order line si fragment count number segment number remov put fragment segment result complet formal lengthi omit data structur discret model develop section offer basi implement data structur fact specif data structur section explain definit translat data structur gener issu consid step requir fact data structur implement data type repres attribut data type data model implement mean valu control dbm memori turn impli consist small number memori block move effici secondari main memori fulfil requir implement data type fix number record arrai repres vari size compon data type alloc requir size pointer express arrai indic extens dbm implement offer specif concept implement attribut data type type repres record compon arrai basic arrai desir field size number automat repres tupl separ list depend size root record repres tupl subsequ design data structur appli concept data type repres record possibl arrai dbm environ store arrai facil offer larg object manag data type section set repres arrai defin uniqu order set domain store element arrai order enforc set valu equal iff arrai make effici comparison data type simpl type section implement repres record consist program languag boolean flag indic defin type point repres similarli record real flag point repres arrai record real repres point point lexicograph order root record number point arrai data structur line region valu design similar line set line segment repres list idea store segment left end point end point call left relev point call domin point support algorithm set segment left perform action insert sweep statu encount left action meet end point segment total order defin lexicograph order extend treat domin point line repres arrai sequenc record repres real flag domin order order mention root record manag arrai auxiliari inform number total length bound region view set line segment addit structur set line segment repres arrai order sequenc line belong link extra field arrai cycl face repres structur arrai cycl record repres cycl pointer cycl pointer cycl face link cycl belong face arrai face face pointer cycl arrai cycl face uniqu order string assum implement fix length arrai charact integ indic refer field arrai defin cycl face detail root record region manag arrai addit inform bound number number total algorithm construct region valu gener comput list call close oper offer region data determin structur face cycl repres set pointer detail strategi found detail interv repres record type repres arrai interv record order interv exist total type repres record unit type distinguish unit repres fix amount call fix size variabl size unit fix size unit variabl size unit fix size unit repres simpli record compon record repres time interv unit record repres quadrupl variabl size introduc arrai technic consist refer arrai indic identifi subrang arrai idea unit map slice share arrai variabl size unit repres record compon time interv record sequel describ compon unit function store sequenc record repres lexicograph order quadrupl unit repres record compon record refer bound cube number point infer unit function store similarli sequenc record repres pair turn quadrupl pair order lexicograph compon quadrupl lexicograph order appli unit repres record compon consist refer bound cube unit function basic set valu addit constraint store record order record extra field link move segment cycl face addit identifi cycl region compon record unit bound cube unit add summari inform compon quadrupl length perimet size type relev paper bound box slice data structur map type constructor organ collect unit data structur unit data structur observ unit data structur record compon repres time compon map data structur illustr figur basic time interv function root record unit figur map data structur unit type arrai unit unit record order time interv unit type map data structur addit arrai arrai mention unit refer arrai provid map data structur main arrai unit addit arrai referenc singl root record map data structur note structur gener form requir attribut data type algorithm section briefli show algorithm order illustr data model data structur defin previou section implement oper move determin region instant time implement insid oper move point move return move boolean describ point insid region algorithm move region repres type idea algorithm perform binari search arrai region unit determin unit argument time instant call evalu move segment region unit time result line segment dimens obtain region return result algorithm move region mr type instant region repres mr instant determin mr time interv exist return return endif end algorithm move region unit ur type instant region function ur instant ur fh return end algorithm function defin section evalu move segment instant time line segment time complex algorithm basic number unit size region return number step unit found binari search unit data structur linear time construct proper region data structur section produc list lexicograph sort result result time complex log note region output displai graphic suffici algorithm work correctli instant intern unit time interv descript problem possibl region valu end point unit time requir complex cleanup find line sketch end section problem avoid spend storag repres unit region end open time correct region singl instant end analog implement oper obtain move data type algorithm fact plug data type algorithm insid argument list repres move move region idea list comput refin partit time axi figur time interv refin insid algorithm perform point region unit valid time interv produc set boolean unit repres point insid region note linearli figur set time interv refin move point singl unit enter leav region region unit time algorithm insid move point mp type move region mr type move boolean type repres mp insid mr mp list order time mr fur list order time mb scan list determin step refin time interv list unit time interv unit respect list overlap refin interv ur exist ub mb endif return mb end insid oper concat set unit essenti merg adjac interv unit singl unit arrai list map data constant time unit mb unit algorithm unit unit ur set move boolean type repres point insid region ur intersect time interv ur intersect time interv remaind algorithm assum intersect interv close bit treat case bound box intersect return determin intersect occur cycl face intersect repres pair time instant action sort intersect result list intersect note action list instant insid instant return return endif leav return return endif endif endif end insid move point line segment move segment order intersect move point altern enter leav move region repres region unit list boolean unit produc altern true case intersect found check start time time interv consid point insid region implement techniqu comput algorithm count segment point algorithm insid requir time number unit call algorithm insid algorithm requir time find number log time sort return boolean unit intersect check insid start time requir time total time call insid log total number total number intersect move point face move largest number intersect occur singl pair unit practic small log domin total run time move point move region suffici bound action determin store triangl face normal vector indic side interior region box run time algorithm illustr nice algorithm binari oper move object gener reduc simpler algorithm pair unit algorithm plug algorithm specif oper pair unit present formal defin discret data model implement data type defin abstract model demonstr discret map data structur realist dbm algorithm data structur paper offer basi implement extens ad suitabl extens architectur data blade informix step design algorithm oper implement data structur build extens packag plan integr system make data blade informix refer ts cheng sk gadia pattern match languag acm confer inform knowledg page novemb chomicki revesz intern symposium larg spatial page chomicki revesz geometr framework spatiotempor object intern workshop tempor reason page rh gute effici handl tupl larg object technic report informatik data knowledg engin rh gute plug plai queri gener dbm develop environ technic report informatik rh vazirgianni abstract discret model data type acm symposium geograph inform page novemb rh vazirgianni data approach model queri move object press rh mh cs na foundat repres queri move object technic report informatik rh implement gener queri processor intl conf expert system page septemb rh de schneider implement rose effici algorithm spatial data type proc intl symposium larg spatial page august system complex spatial queri acm sigmod intern confer manag page rh gute schneider spatial data rose algebra vldb store retriev sequenc polygon intern journal geograph inform dj duan spatiotempor data model tempor analysi geograph data intern journal geograph inform pfoser cs jensen captur uncertainti proc intl symposium spatial page hong hadzilaco logic data model definit model proc intl engin applic manolopoulo specif effici index spatiotempor proc intl confer scientif statist cost model posit move object proc intl confer data page wolfson move object issu solut proc intl confer scientif statist mf worboi unifi model spatial tempor inform comput
HCI/333 4 time seri segment context recognit mobil devic johan mannila tt toivonen nokia research softwar technolog laboratori po box nokia finland abstract recogn context import make mobil devic simpl find user situat devic underli servic provid adapt person user interfac devic infer part context user sensor mobil devic includ sensor paper context recognit segment time seri produc sensor dynam program find segment minim varianc method produc optim slow long sequenc data present analyz random variat algorithm global iter replac approxim optim result fraction time requir dynam program demonstr time seri segment context recognit mobil phone applic introduct human commun typic contextu discuss wai depend time happen lot context inform implicitli everydai life commun awar context cumbersom larg mobil commun situat vari lot inform context mobil phone improv user interfac context inform user font displai larger audio volum adjust higher level context awar studi aspect studi includ work context sensit wearabl comput audio signal paper discuss wai achiev contextawar mobil devic mobil phone mobil devic infer context inform sensor humid figur user tackl import subproblem problem segment context data sequenc intern homogen segment segment found reflect state eventu compact recogn segment templat action user phone predict futur action segment problem special case gener cluster tempor structur data addit restrict speed comput time seri segment problem wide studi disciplin similar problem approxim signal line segment aim compress index volumin signal data comput pattern recognit util reduct techniqu simplifi analyz contour boundari line applic rang phonem recognit problem excel review time seri volum focu minim cost function number cost function sum data segment readili base dynam program optim solut time seri segment problem found time sequenc length segment larg valu algorithm effici greedi algorithm solv segment problem time small constant algorithm provid solut case close optim describ result show qualiti context recognit test scenario definit time seri consist sampl notat defin segment time seri consecut sampl denot concaten sequenc segment segment boundari defin interest obtain segment segment intern homogen order formal associ cost function intern heterogen individu aim minim cost segment make assumpt cost cost cost singl segment function data point number data point cost cost cost sum cost segment cost cost optim opt time seri cost function cost cost minim cost function eq arbitrari function sum varianc compon number dimens cost function segment simpli cost segment length length sequenc defin eq rewrit eq cost vector data vector segment problem address find segment boundari minim cost problem similar simpler eq compar typic error measur standard vector quantiz case cluster limit contigu segment time seri voronoi region algorithm dynam program problem solv optim dynam program basic criteria applic dynam program optim problem restrict optim solut subsequ data optim solut subsequ optim optim condit hold comput complex dynam program order cost segment calcul linear time comput complex dynam program algorithm high larg amount data greedi method advantag simpl fact segment subsequ segment divid set subsequ segment reduct total cost calcul effici subsequ fast greedi heurist segment approach make split hierarch manner method start split optim subsequ assum algorithm segment segment segment split turn optim piec total cost segment calcul split reduc total cost accept segment procedur carri segment method make break point set inflex potenti weak turn process earli optim problem assess dynam procedur heurist place break point iter move break point time rule ensur converg local optimum greedi algorithm move breakpoint time straight local minimum local iter replac simpl greedi procedur place break point select optim neighbor break point begin end time approach similar break point move gradual local optim select initi break point evenli space random initi method select break point random sequenti remov concaten consecut segment meet find optim locat break point concaten locat optim segment break point concaten segment replac break point solut step repeat stop criterion met stop criteria discuss global iter replac reloc break point neighbor locat search sequenc includ local iter replac avoid local minima approach bear distant similar segment split merg core idea split segment larg error merg small error error threshold make optim pair time number segment constant set initi segment sn select break point random sequenti remov concaten consecut segment meet find optim locat break point sequenc segment segment ss find optim comput respect save cost segment cost select split largest save save set break point segment set segment sn step repeat stop criterion met natur stop criterion algorithm total cost admiss move breakpoint stop finit number cost step number point sequenc finit discret limit number iter simpl stop criterion random iter algorithm run time order reduc chanc poor local minima comput complex greedi method linear size input cost segment calcul linear varianc function eq complex order factor depend number break point number locat initi break point perform evalu iter algorithm benchmark algorithm optim solut provid dynam program algorithm refer test algorithm approach local iter replac global iter replac cost function minim varianc algorithm test number artifici data set artifici data set artifici data gener length signal number constant segment fix valu length constant segment gener place transit drawn randomli restrict length segment constant segment randomli gener uniform distribut random prototyp signal kind gener combin number segment length level gaussian iid ad signal rel level ratio varianc signal varianc level prototyp signal combin snr level gener time seri fig show test signal gener ad level prototyp sampl low test signal segment dynam algorithm number segment set priori number segment call simpli data set larger set data gener procedur constant prototyp gener fifti sampl gener ad gaussian iid call data set comparison partit random initi locat break point iter algorithm initi segment iter stop algorithm move break point compar cost segment achiev iter method cost optim solut opt achiev dynam program comparison made rel error measur signal segment err rel opt opt segment level optim segment optim segment figur level ad origin signal constant optim segment rel error test rel error test figur averag rel error segment function length sequenc low high amount show standard deviat local iter replac visibl area left panel measur limit opt present test signal opt greater experi simul data amount segment show rel error partit produc global iter replac percent local iter perform method produc reason partit result problem defin method global iter method suffici accur interest result obtain correct number segment situat typic applic experi artifici data set show consist outperform turn superior perform method explain fact rel error test rel error rel error test figur averag rel error segment function number segment low high amount show standard deviat local iter replac visibl area left panel oper chang made topdown method run time comput requir topdown method local global iter replac linear length dynam program method quadrat constant method behav roughli linearli dynam program order magnitud larger consumpt comput resourc panel fig closer behavior behav similar fashion algorithm fig impress test greedi algorithm behav context recognit real context data collect equip sensor signal log user scenario test subject told perform activ context data data record microphon sensor box attach mobil phone combin hang user neck front chest data log wire laptop user carri raw signal transform call context amount activ action movement walk rel error averag rel error test figur averag rel error segment function number segment artifici sequenc local iter replac visibl area flop comput load optim flop comput load figur averag comput cost float point oper function length sequenc panel show data scale show standard deviat flop comput load optim comput load figur comput cost float point oper function number segment panel show data scale show standard deviat flop averag load test optim flop optim figur averag comput cost float point oper function number segment artifici sequenc show standard deviat note scale logarithm left panel linear dynam program visibl area panel tabl outlin activ user scenario user devic tabl devic put stand start walk walk corridor walk stair walk corridor walk walk walk walk stair walk corridor sit put devic tabl sound pressur illumin condit touch stabil devic orient sidewai antenna antenna displai displai pattern recognit algorithm transform sensor box scope context atom data real context data set consist time seri scenario length time seri vari perform real context data time seri segment segment dynam algorithm result rel error run time confirm observ made artifici data yield small rel error high comput effici qualiti context recognit studi optim real data show stabil locat break point break point occur segment occur time credibl break point examin time seri context atom data optim evalu segment video record test show segment context recognit segment captur import compar real put equip stand walk equip segment correspond practic activ user scenario compar fig break point phase equip equip order break point import real world consist major factor mobil commun studi problem mobil phone task time seri segment outlin dynam program algorithm find optim cost function dynam program rel error averag rel error real context data set flop averag flop real context data set optim figur averag rel error comput cost float point oper function number segment real context data set show standard deviat note scale logarithm panel hard long complex algorithm order amount data cost singl segment comput linear analyz fast greedi method time seri segment iter method test optim segment greedi segment global iter replac method outperform greedi method empir test cost function minim work varianc segment cost function consid cost function calcul linear time respect amount case sampl varianc appli time seri segment sensor data collect sensor box mobil phone time seri segment captur interest user context experi suggest time seri segment simpl varianc base cost function captur essenti phenomena context atom time seri segment present fig optim data cost reflect fact real world evalu analyst analyst work tool visual aid present fig video record test overview data order determin emerg pattern analysi segment adapt length window situat window constant break point occur place preprocess data form context acknowledg author jani comment refer bellman approxim curv line segment dynam program commun bennett determin number zone sequenc optim curv fit linear function ieee transact pentland recogn user context wearabl sensor digest paper fourth intern symposium wearabl page clarkson pentland cluster audio video intern confer signal process volum page mase progress mobil assist aaai spring symposium intellig page time number segment figur optim segment real data vertic line segment horizont grid line present tempor segment show time begin test context atom data optim horizont bar show activ context atom dark mean high activ vertic line number show place break point segment optim iri optim algorithm approxim linear function journal inform pazzani onlin algorithm segment time seri ieee intern confer data laerhoven teach digest paper fourth intern symposium wearabl page lam flynn intim comput support human memori technic report rank xerox research cambridg waveform segment function approxim ieee transact algorithm shape analysi waveform ieee transact pattern analysi machin horowitz segment plane curv ieee transact optim time segment signal model compress ieee intern confer acoust speech signal process volum page de veld advanc interact context hand held ubiquit number lectur note comput page zdonik approxim queri larg data sequenc intern confer data page pentland visual contextu awar wearabl comput intern symposium wearabl digest page wang wang support search time seri approxim intern confer scientif statist page wu linear approxim base statist model ieee transact pattern analysi machin flexibl time segment wavelet packet ieee proc intl symp page
IR/334 5 stabl algorithm link analysi andrew ng comput scienc uc berkelei ca alic zheng comput scienc uc berkelei ca michael jordan cs div dept stat uc berkelei ca abstract kleinberg hit googl pagerank algorithm eigenvector method identifi hyperlink citat inform algorithm give reliabl consist answer analyz expect give stabl rank small perturb linkag pattern extend analysi show insight wai design stabl link analysi method turn motiv perform studi empir citat data web hyperlink data introduct origin bibliometr analysi analysi plai import role modern inform retriev link analysi algorithm successfulli appli web hyperlink data identifi authorit inform academ citat data identifi influenti paper classic ir rank link analysi basi todai internet search engin import featur collect world wide web dynam natur refer miss search engin link analysi provid robust notion authorit natur robust stabl perturb link structur highli unstabl search complet result dai trust user return relev articl set academ stabil mean author write small number paper rare complet chang mind articl commun semin issu stabil receiv attent link analysi princip focu paper popular kleinberg hit algorithm googl pagerank algorithm make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee septemb usa copyright acm base essenti comput princip eigenvector matric relat adjac graph determin understand robust link analysi algorithm involv analysi stabil eigenvector calcul idea matrix perturb theori markov chain formal condit hit pagerank stabl briefli summar result deriv show give insight wai design stabl link analysi algorithm motiv random merg notion hit stabil mechan pagerank subspac principl combin multipl eigenvector hit yield aggreg author score algorithm demonstr empir produc good result academ citat web queri data explor issu result return algorithm lead discuss relationship latent semant index hit begin cora collect citat inform thousand academ paper area comput scienc ran hit pagerank algorithm subset cora consist machin learn examin list paper consid evalu stabil construct perturb version randomli select subset paper cora obtain web chanc retriev paper hope identifi subset citat data result hit shown leftmost column hit author rank obtain analyz full set machin learn rightmost column report rank run perturb substanti variat hit result cora ml algorithm goldberg natur artifici holland program koza behavior class de jong crossov genet intellig fogel survei evolut control paramet grefenstett algorithm select whitlei algorithm data structur michalewicz program automat koza intern predict method sutton studi machin learn samuel element solv issu td tesauro classif scene regress repositori machin learn featur subset induct reason intellig pearl variabl problem shown result pagerank pagerank result cora ml paper algorithm optim goldberg intern natur artifici holland regress reason intellig pearl program koza predict method tempor sutton classif scene likelihood incomplet data repositori machin learn distribut theori neural result discuss detail section state hit unstabl pagerank stabl web queri pagerank displai perturb pattern issu direct attent subtl order understand stabil issu relationship multipl eigenvector invari effect reset probabl stabil import algorithm identifi authorit relev issu plai import role algorithm present section result data algorithm random hit result cora ml paper algorithm goldberg intern reason intellig pearl natur artifici holland regress program classif scene likelihood incomplet data predict method sutton theori neural subspac hit result cora ml paper algorithm goldberg intern rumelhart reason intellig pearl regress natur artifici holland predict method sutton koza likelihood incomplet data classif scene vc repositori machin learn overview hit pagerank collect web page academ paper link hit pagerank algorithm construct matrix captur citat determin author comput princip eigenvector matrix worth note hit typic run hit algorithm hit algorithm posit articl high weight link page high page high hub weight link authorit page set web page retriev search hit algorithm form adjac matrix page link page iter mean page link page obtain lim lim vector renorm unit equat aa iter initi vector power method obtain princip eigenvector matrix mild princip eigenvector aa page hub pagerank algorithm set web page adjac matrix pagerank construct probabl transit matrix renorm row sum imagin random web surfer time step web decid page visit step probabl randomli pick hyperlink current jump page link probabl jump web page pick uniformli random collect typic set process defin markov chain web transit matrix transit matrix uniform transit probabl ij vector pagerank score defin stationari distribut markov chain princip eigenvector transit matrix golub van definit stationari distribut satisfi small collect articl retriev pagerank term entir web algorithm run report result algorithm distinct affect outcom analysi discuss heurist issu simplic bharat improv hit note fundament chang spirit eigenvector calcul underli hit wai treat case page outlink paper util simpl reach web surfer pick page uniformli random mean row row construct entri equal pagerank algorithm util reset distribut arriv leaf node instanti variant algorithm instanti origin algorithm graph reset probabl bush bush bush princip eigenvector princip eigenvector figur jitter scatterplot hyperlink graph asymptot chanc visit page authorit page analysi algorithm begin simpl show small addit collect web page result larg chang eigenvector return collect web page page link link adjac matrix column web princip eigenvector valu figur present jitter scatterplot link web eigenvector portion eigenvector web page happen link figur show eigenvector chang princip eigenvector line small perturb collect larg chang eigenvector phenomenon address algorithm eigenvector determin author stabil hit give fairli hit sensit small perturb hit princip eigenvector determin author turn algorithm stabil small perturb determin defin differ biggest biggest eigenvalu ax eigenvector matrix tild denot perturb quantiti denot perturb version stabil result summar theorem princip eigenvector assum maximum web page bound perturb graph ad delet link perturb princip eigenvector perturb matrix jja jj special number smaller number result larg swing eigenvector replac princip eigenvector lie theorem symmetr matrix exist perturb larg chang princip eigenvector proof theorem hit insensit small perturb small small perturb dramat chang result small perturb princip eigenvector secondari eigenvector swap place phenomenon discuss section stabil pagerank stabil theorem princip eigenvector chang transit matrix pagerank score assum close mean web page high pagerank score measur respect pagerank score perturb pagerank score origin full proof theorem intuit pagerank shortli design hit improv sketch proof theorem remaind section safe skip imagin pagerank random surfer start randomli chosen web hyperlink random random walk step graph chanc web page visit typic step random walk procedur pagerank score page page page link complet page chanc random surfer notic page random walk fraction time user visit perturb fraction time random walk visit page random walk origin typic chanc visit perturb page definit page pagerank score chanc visit perturb page typic time step user step chanc visit perturb page point walk mean chanc random walk origin graph random walk run perturb graph distribut random walk graph differ pagerank exist perturb version denot jj jj jj norm pagerank chanc user mean number step reset geometr distribut simplifi imagin reset occur step score distribut induc walk web graph similar formal version proof coupl markov chain long perturb page small total pagerank chanc visit affect random walk small order note reset probabl length random walk chanc visit perturb page expect pagerank small sensit hypothesi explor experi algorithm random hit discuss suggest natur design base algorithm similar spirit hit find hub stabl small perturb random surfer follow hyperlink forward backward direct surfer start randomli chosen visit web page time step time toss coin bia coin land jump web page chosen uniformli random coin land check odd time step time step odd time randomli chosen current time random current page random surfer altern link forward backward jump page chosen uniformli random process defin random walk web stationari distribut odd time step defin author weight larg odd chosen larg random walk converg stationari distribut step author weight page chanc surfer visit page time step stationari distribut time step defin hub weight quantiti row col vector row normal sum col column normal sum note similar origin hit updat rule straightforward show iter equat converg stationari distribut refer method analog proof stabil pagerank algorithm review previou straightforward establish relat condit random hit insensit small perturb subspac hit improv stabil hit individu eigenvector matrix subspac span eigenvector subspac span eigenvector calcul stationari time stationari number page eigenvector rotat freeli subspac figur eigenvector chang subspac span chang eigenvalu subspac span eigenvector stabl refrain examin individu treat basi subspac obtain author score case weight larger eigenvalu import procedur calcul author monoton function find eigenvector xk aa hub eigenvalu basi vector element element calcul author score squar length project subspac span xk project direct choic back origin hit correspond simpl citat author weight page ij author weight depend subspac span eigenvector method simpl principl automat combin multipl eigenvector singl measur authorit page call method subspac hit subspac stabl individu eigenvector reason expect subspac hit hit case eigenvector stabil requir assumpt theorem continu constant matrix perturb chang vector author score bound jja proof theorem appendix note comput frequent practic eigenvector approxim full set reason correspond drop eigenvector smallest subsequ note kleinberg discuss multipl user interpret individu eigenvector combin eigenvector project singl author score case repeat assum eigenvector chosen orthogon mean yj satisfi deriv bound note uniformli bound deriv entir real theorem hold long deriv bound applic domain experi present result compar random subspac hit academ paper citat data cora web page linkag data built actual queri section stabil section discuss page return web queri experi stabil result experi artifici intellig paper cora result larg replic hit return genet algorithm paper sensit perturb found hit omit ga paper return document semin paper broader ai area pagerank return gener ai paper top rank result stabl perturb hit result cora ai algorithm goldberg natur artifici holland program koza behavior class de jong crossov genet intellig simul survei evolut control paramet grefenstett algorithm select whitlei algorithm data structur michalewicz program automat koza intern predict sutton regress classif scene repositori machin learn featur subset simpl classif rule perform holt reason intellig pearl induct boolean monk thrun program machin quinlan discret conserv law gener schaffer pagerank result cora ai paper regress algorithm goldberg reason intellig pearl intern natur artifici holland classif scene robust layer control system program koza predict method sutton likelihood incomplet data hit unstabl primarili flip genet algorithm paper paper attempt creat slightli favor environ repeat ai paper ga paper hit result subset cora ai paper regress classif scene repositori machin learn intern featur subset select simpl classif rule perform holt program machin quinlan reason intellig pearl induct boolean monk perform thrun tree md quinlan discret relat conserv law gener schaffer featur select likelihood incomplet data predict method sutton theori neural unifi mitchel robust layer control system mobil brook hit result subset cora ai paper predict method sutton intern reason intellig pearl robust layer control system approach applic act dynam element solv architectur sutton unifi issu tempor differ tesauro likelihood incomplet data program implement theori classif scene architectur gener theori neural reason regress repositori machin learn top rank result unstabl pearl book origin rank drop rank trial brook paper jump rank rank trial problem persist eigenvector variabl shown pagerank pagerank result subset cora ai paper regress reason intellig pearl intern classif scene robust layer control system mobil brook likelihood incomplet data predict method sutton repositori machin learn recip distribut implement theori theori neural librari object largest chang document rank drop result stabl hit closer examin hit author weight reveal jump rank small fluctuat author larg pagerank tend remain fairli stabl present result random hit subspac hit stabl subspac hit perform pagerank random hit result subset cora ai paper intern reason intellig pearl regress classif scene likelihood incomplet data robust layer control system mobil recip predict method sutton approach theorem theori neural gibb subspac hit result subset cora ai paper reason intellig pearl regress intern robust layer control system brook classif scene likelihood incomplet data predict method sutton approach theorem unifi vc altern repositori machin learn compar algorithm perform test web queri topic examin actual search engin kleinberg describ method obtain collect web page run hit method perturb web page collect natur exampl queri result shown tabl page origin top delet notic tabl except origin top document origin lower rank discuss section flip phenomenon perturb princip turn princip eigenvector swap place eigenvector hit result queri url pagerank algorithm exhibit tabl present pagerank result queri rank stabl perturb pagerank result queri kleinberg web search engin retriev document form expand ignor defin hit oper perturb arriv randomli delet root set imagin web search engin return page kleinberg procedur result random hit subspac hit list similar cora random hit subspac hit compar perform pagerank random hit result queri subspac hit result queri note rank algorithm stabl cora dataset larg artifact perturb web dataset cora remov paper dataset remov paper cite cite web queri delet root page remov surround link structur footnot type perturb accur model scenario search engin miss form perturb larg compon graph remov perturb obtain result closer cora hit idea flip pattern count number top ten page drop rank drastic trial collect perturb delet larg rise rank rare algorithm larg drop rank total web trial perform queri histogram count figur repres number hit hit pagerank sp sp sp figur count histogram show frequent page origin top fall top hit subspac hit pagerank rand hit tabl expect percentag rank drop top ten page drop rank top page drop rank trial bin pagerank histogram increment call plot figur exclud bin order highlight trial wrong hit pagerank random hit larg number page simultan drop low pagerank random hit drop trial page drop hit number eigenvector hit number trial occur pagerank random hit subspac histogram similar pagerank random hit chang grow faster behav increasingli similarli hit subspac hit weight princip eigenvector note flip histogram fact empir distribut number rank drop trial tabl show effect reset probabl expect percentag page suffer rank drop empir distribut rank drop expect random expect fluctuat slightli hit subspac hit involv expect affect multipl connect compon closer examin web queri result draw attent question page return ignor stabil issu notic algorithm return page number domain tabl present result hit pagerank queri top ten page return hit rank stabl return wider varieti page site tend heavili link author hub score avoid origin design motiv pagerank kleinberg suggest avoid problem web page question varieti crucial lead algorithm behavior multipl linkag graph hit result queri pagerank result queri connect compon graph subset node element connect length path rest graph eigenvalu connect compon largest eigenvalu ac ac adjac matrix graph multipl connect princip eigenvector valu node connect compon formal compon largest eigenvalu share connect compon explain section render eigenvector hit eigenvector repres part graph algorithm reset probabl obtain princip eigenvector concaten possibl result connect compon pagerank random hit return result wider varieti hit concentr ignor link prune kind author propag kleinberg design experi prune link point page multipl link domain account page site result graph connect compon pagerank run entir graph result run separ concaten hit subspac hit pagerank rand hit tabl averag number site top page strength popular cluster subspac hit attempt broaden scope multipl connect compon includ previou discuss assum graph connect compon entir graph hit worri problem empir data web queri experi suggest presenc multipl connect compon graph queri result present section top rank page algorithm researchindex remov trial algorithm return top rank page trial fact top rank page eigenvector hit top rank page origin princip eigenvector hit remov random subspac hit includ page result suffer impact cluster remov tabl list averag number repres top page algorithm note effect reset probabl pagerank averag indic result random hit hit subspac hit affect involv reset lsi hit section interest connect hit latent semant index addit insight result lsi collect document repres matrix ij document lsi comput left singular vector eigenvector aa princip singular denot dimens equal vocabulari measur word js membership inform hope synonym group singular document row project subspac span singular automat includ synonym word lead improv retriev construct citat graph set document node document word document node link word adjac matrix graph appli hit find hub weight link author weight vector hit word author weight singular vector found lsi result node valu similarli jc number web page connect compon origin vector perturb vector offici kill todai member talk govern death mondai negoti year report talk govern member peopl israel critic agenc west london report soviet publish israel british american offic isra kill chairman district meet di peopl isra member fridai capit british bank west began book newspap london condit arab union presid associ death american tabl authorit word ap articl word commonli connect compon linkag graph distinct document topic connect transfer insight experi lsi understand hit carri experi press portion trec volum corpu order obtain word author word stem stop list vocabulari size word averag length word ran entir set top author singular vector randomli remov recalcul author weight result show set authorit word union authorit word topic discuss section linear combin compon occur subcompon roughli equal eigenvalu small linear combin eigenvector unstabl perturb demonstr tabl word origin eigenvector origin word conflict british split eigenvector perturb perturb eigenvector main topic british word israel drop rank perturb eigenvector main topic word british drop rank illustr danger defin individu eigenvector presenc multipl eigenvector linear combin authorit node combin sensit small perturb safer lsi subspac hit summari analyz stabil hit pagerank small perturb document collect base find stabil pagerank stem usag uniform random retain notion influenti articl stabl perturb present subspac motiv observ subspac span eigenvector stabl individu eigenvector algorithm view principl combin multipl hit eigenvector report empir perform explor issu result return set web graph multipl connect compon connect lsi hit discuss refer hill predict expert qualiti rate web document proc annual intl acm sigir page bharat improv algorithm topic distil hyperlink environ proc annual intl acm sigir page brin page anatomi hypertextu search engin seventh intern world wide web fan chung spectral graph theori american mathemat cohn chang probabilist identifi authorit document proc intern confer machin harshman index latent semant analysi journal american societi inform golub van loan matrix comput john hopkin univ kleinberg authorit sourc hyperlink environ proc symposium discret seymor autom internet portal machin learn inform retriev jordan link stabil proc intern joint confer artifici citat analysi review literatur winograd pagerank citat bring order web unpublish latent semant probabilist analysi proc alberto mendelzon page comput web page reput proc stewart sun matrix perturb theori academ proof stabil subspac hit continu function constant matrix singular decomposit obtain defin diagon matrix ii calcul defin author page basi note diagon author score reader easili verifi previou definit column perturb quantiti invari norm jj su su jj jj jj matrix su su su su substitut back equat treat column base basi ek base ek ek note lg lemma ng ng satisfi proof view domain vector defin vector space equat easi show vector fact form orthonorm basi subspac precondit lemma product hh gi project vector subspac longer origin hh gi prove lemma proof theorem jja ak ek defin condit step equat appli lemma conclud jja
IR/335 5 memori hierarchi metaphor academ librari collect stuart abstract research librari collect cornerston academ repres year develop western make written histori wide access low cost comput memori rang physic devic store digit inform undergon formal studi year understood paper draw parallel research collect comput examin hierarch examin implic digit librari introduct paper began attempt compar larg inform manag system comput memori librari interest insight eld digit comput provid function research librari paper start introduc design pattern present design pattern section section discuss implic pattern area digit librari section sketch network implement idea design pattern aim design pattern illustr solut problem document forc lead problem design solut design pattern softwar engin methodolog rst public book pattern languag program confer approach formal design involv document featur design review revisit design pattern document insight softwar system basi tool support paper design hierarch inform illustr structur observ separ place solv problem pattern hierarch inform store stuart larg collect inform store inform larg static access show strong local refer rang storag type rang fast slow cheap price measur unit data strike balanc speed access cost forc appli storag cost entir system minim averag access time read write minim interfac rest system simpl write assum rare compar handl ecient creat hierarchi cach inform user interact smallest store retriev inform slower larger store store hierarchi receiv request store immedi user case topmost pass lower level store unabl satisfi store inform respond inform request answer system hierarchi inform store topmost store store topmost user gure show hierarchi cach inform store hierarch inform store pattern exampl place pattern appli studi hierarch inform store memori hierarchi modern comput cpu main disk cach disk drive form shown user cpu regist cpu cach main memori disk drive disk cach note disk cach necessarili larger main system disk combin disk cach formal hierarch inform store found research librari research document rst person campu librari shown user person collect collect campu librari loan librari cach inform memori system book obtain loan ectiv join local librari collect durat librari loan book user join user person collect except user campu librari librari memori version parallel section memori cpu mip seri separ instruct data cpu recogn instruct data di erent local refer characterist librari number di erent librari user document campu local librari librari relat research user person collect collect loan campu librari librari librari user cpu regist main memori disk drive disk cach data cach instruct hierarch inform store exist close relat proxi topmost store proxi rest hierarch inform store inform forward request topmost store user orient interfac system express wai singleton store answer inform queri implic digit librari digit larg collect textual document index store electron media autom search retriev unlik extant digit librari typic run fulli autonom contact user librarian librarian involv construct librari softwar stock digit collect softwar design criteria serv user inform work describ ted nelson describ hierarchi server cach dont form strict publish user view network local cach present uni ed interfac server commun document owner user document digit librari hierarch inform store monolith except ncstrl cach cach reli local fact request receiv ident recent request local refer hold librari usag joke teacher set assign class time eld bibliometr studi book articl consumpt citat percent publish document cite referenc small number document make vast proport document read refer bibliometr document chang slowli work part eld longer refer element newton discard irrelev work induc nuclear fusion spark brie hot topic cold high turnov hot document world wide web result ash larri invent teleport sudden ux peopl site event lead unexpect ash crowd lead site popular meant site link experienc sudden surg combin tendenc link smaller web mean websit unavail immedi stori post cornerston academ maintain user read embodi american librari associ bill read face copyright challeng hierarchi import legal california requir state nation law intern agreement nation govern sign bern convent strictli obei law knowledg law import librari user librari collect polici couch term ala bill read adher ala code ethic librari intern explicitli aim ow trade secret con inform compani exclud complet textual system develop coin word hypertext develop rich model hypertext system detail current develop digit librari comput scienc technic report open archiv initi librari humor page intern feder librari associ institut book topic class odd teacher assign topic publish support electron librari network distribut le share network recent develop le transfer bought number home user perman connect internet user run program call simultan locat agent internet le user interest download make user le agent wide network includ napster nation drive forc network covert share copyright materi comput network damag rout network good rout librari network illeg activ prevent combat librari sta collect illeg copi materi illeg di erenc mean featur nation implement librari network nation publish content present resourc track document publish user nation facil content publish data encrypt form decrypt user serv data data strongli abstract translat minu librari point view kei di erenc librarian profess network respond absolut librarian profess court action highlight recent napster case tend assert special design data publish system store data user hard drive prevent discov content give user strong data turn illeg copi user commun distribut illeg copi materi user visibl break law tabl outlin kei di erenc similar www posit neg featur librari network featur napster www nation document server read store document commun protocol server discov cross collect search substr queri complex queri multipl depend client implement multipl independ complet implement document text mine server metadata item sophist queri high reliabl individu server syntact link document semant link document singl point failur user network discuss vulner attack dn system resolv textual ip address rout tabl point singl organ small group failur destroi abil network user good featur librari greatli chanc user network end valid portion www searchabl search engin googl quot time magazin decemb republish ny time januari scienti american octob implement gure show network implement explicitli examin document format scope paper squar repres option store origin document document cach local trust network comput origin document cach document untrust link trust link separ level shown dot network server connect network denot aliat inform level build solid denot structur shown server campu server student workstat server rest local subscrib servic network distribut authent user librari server trust network assum manag librarian agent user ala code ethic make clear agent user librari librarian core trust network user privaci gener action restrict student faculti permit campu librari work distinct made network server user particip level network expect major user access network local campu librari connect network encrypt authent connect unknown host authent parti knowledg larg local network lower portion gure campu librari server main access point extern network librari server host local publish document larg cach librari server depart server number user er varieti origin document term book review laboratori server public librari local histori document cluster termin user walk street server small compani publish technic product descript server campu network shown detail omit server publish subscript servic campu network subscrib actual server world origin held server server mirror origin document server server overwhelm major trac server form robust document activ cach network multipl machin librari collect form hierarch structur structur hierarch aspect captur hierarch inform store pattern aspect share featur distribut le share network kei di erenc presenc librari librarian agent enforc inform law copyright network build collect link librari collect satisfi user inform refer bern convent protect literari american librari associ librari bill june american librari associ freedom read american librari associ code ethic american librari june henri editor number lectur note comput scienc septemb dictionari bibliometr vlissid design element reusabl softwar guerraoui strategi pattern reliabl distribut protocol confer pattern languag program septemb michael entertain distribut le august nelson literari machin mind suit mario winter tool richard stern micro walk copyright ieee ian craig salli jo cunningham build public digit librari base retriev digit librari stuart michel de design garbag collector design pattern christin roger fth confer tool object orient languag paci page novemb softwar
ML/336 6 autonom evolut gait soni robot fujita group laboratori soni corpor japan yamamoto abstract trend robot leg robot issu leg robot develop gait typic gait develop manual paper report result autonom evolut dynam gait soni robot fit determin robot digit camera infrar sensor system evolv faster dynam gait manual develop introduct paper present implement autonom evolutionari algorithm develop locomot gait process handl robot onboard comput individu evalu robot sensor implement successfulli evolv pace gait robot pace gait significantli outperform previou gait addit achiev desir goal automat develop gait result show ea real robot evolv behavior method automat creat locomot control directli applic robot set standard definit interfac entertain robot architectur featur style flexibl flexibl user reconfigur robot current implement compon build gregori visit brandei trademark soni corpor robot robot current robot develop crawl gait pattern easi build robot mechan sensor base method adapt exist locomot control robot gener gait robot robot freedom show autonom evolut behavior physic robot practic argument evolutionari robot attack evolut real robot evolut methodolog develop simul evolut shown success set acknowledg case methodolog work high accuraci occur desir evolv physic robot problem real robot mainten power suppli tether khepera power mainten larg problem evolutionari run measur hour dai interchang part easili replac malfunct leg work time problem evalu quickli evolv individu gener hour evalu unreason evolut approxim dai evalu minut physic robot accuraci readili simul evalu time short previou autonom evolut actual robot evolv behavior compar complex robot evolv control task requir control actuat exampl autonom evolv behavior backward stop behavior wheel robot home navig khepera behavior khepera behavior difficult implement hand difficult evolv simul behavior successfulli transfer simul physic robot test problem develop locomot control dynam gait dynam gait sensit behavior build simul difficult hand develop paramet difficult gait evolv experi outperform gait result show physic robot evolut robot behavior evolv rest document organ section review relat work evolv gait leg robot section descript robot locomot modul section consist descript evolutionari algorithm evolut section describ setup experi robot sensor section present result experi discuss result section section work relat work develop locomot gait leg robot problem studi year research issu popular research group section limit review relat work evolv locomot control physic robot describ gait robot gait robot capabl common pace gait crawl gait consist move leg turn leg support static gait robot center graviti insid triangl support leg contrast pace dynam gait safe area robot center graviti gait consist match diagon leg move pace gait leg side robot move figur show leg posit pace complet swing cycl leg leg ground front left front rear left rear crawl pace time figur gait research evolv gait leg robot simul evolut neural control evolv simul network transfer physic robot produc smooth walk behavior simul built ii robot genet algorithm evolv locomot control unlik exampl robot actuat control leg control consist binari string bit appli voltag wire robot neural control evolv simul obstacl avoid locomot gait perform physic robot similar simul walk gait observ simul physic robot robot simul develop evolv walk behavior exampl control evolv simul produc work actual robot similar work real robot evolut ann evolv control tripod gait robot stage evolut evolv oscil evolv walk behavior fit determin cellular encod interact evolv control input fit individu assist evolutionari process stage evolut evolutionari approach develop gait lab creat gait hand develop crawl gait gait crawl pace gait develop good time move robot backward gait develop differ work evolut complet autonom evolv dynam gait autonom evalu involv coordin sensor determin locat measur distanc challeng problem compar perform evolv control develop hand find evolv control joint inform locomot modul sensor feedback evolv control recov detect occurr robot platform locomot modul robot experi soni robot head leg freedom dof tail give total dof bodi length includ head approxim length leg shoulder onboard head stereo infrar touch sensor touch sensor bottom leg addit cpu bodi gyroscop acceleromet detail descript robot movement leg control locomot modul modul control robot gait set paramet updat joint angl leg posit swing phase modul recov robot fall movement robot develop variabl gain control algorithm vari gain schedul roll yaw pitch figur robot coordin system paramet paramet specifi minimum gain maximum fix maximum specifi swing cycl start reduc gain durat gain reduc maximum minimum back maximum sin gain phase leg phase start ffi swing forward start swing back ffi end ffi pace leg side bodi leg phase leg opposit side bodi ffi phase twenti paramet defin gait locomot modul tabl list gene individu evolv evolutionari algorithm paramet posit orient swing path rate swing amplitud oscil bodi locat gain vari swing cycl leg evolutionari algorithm evolutionari algorithm ea run onboard robot consist initi phase evolut popul paramet phase ea chosen base valu research experi section describ select reproduct phase ea evalu section tabl paramet list gait paramet unit initi rang pace bodi center mm bodi center mm bodi pitch leg mm front leg mm rear leg mm step length na swing height mm swing time ms swing na switch time ms ampl bodi mm ampl bodi mm ampl bodi mm ampl yaw ampl pitch ampl roll min gain na shift length initi popul creat uniform distribut search rang tabl list twenti paramet gene initi search rang initi rang determin experi hand develop gait individu creat evalu dynam gait paramet configur result robot fall gener initi popul set paramet initi popul robot fall replac randomli gener individu individu initi popul evolut begin tournament select select individu parent individu replac algorithm decid perform recombin mutat number individu randomli select tournament individu randomli select mutat individu randomli select higher individu lowest fit replac offspr mutat recombin variat equal probabl select mutat recombin recombin individu parent creat child individu gene child ff ith gene child ith gene parent ff random number rang mutat parent individu perturb valu small amount gener child individu random number distribut determin number gene mutat gene mutat select randomli select gene mutat ffi mutat ffi uniform random rang valu set paramet initi search rang problem experienc initi experi individu receiv significantli higher fit inaccur measur distanc infrar distanc sensor result pull search poor paramet reduc problem individu number time store ag increment time individu parent recombin mutat individu reach ag ag reset method desir result experi set paramet move robot quickli straight line section describ experi individu evalu evolut place insid pen figur end pen strip color cloth mark center end camera robot turn center color strip cloth robot measur distanc infrar sensor proce locomot fix amount time robot stop end time encount wall robot pan head find color strip measur stop distanc distanc robot score test locomot paramet calcul averag speed trial individu fit averag locomot trial center robot color strip dedic lsi chip color detect tabl detect color rang pixel posit color figur pictur environ strip robot turn gait turn place robot turn fix direct desir color detect detect robot find averag horizont locat pixel desir color convert angl camera cover angl ffi averag locat fall ffi center period robot center head pan similar center behavior robot bodi remain fix head turn color strip detect robot calcul offset current head angl rotat head face color strip distanc measur infrar sensor locat robot head infrar sensor return convert distanc creat function robot pen fix distanc color strip averag read test set paramet begin robot test distanc color strip determin reliabl rang robot maximum reliabl rang crawl gait move closer closer infrar sensor read robot wall give slow stop prevent robot run wall infrar sensor read robot bodi move normal posit start distanc determin averag consecut infrar sensor read robot target color strip move forward crawl robot move color strip figur robot pen amount time set locomot paramet stop robot fallen onboard current individu score robot individu robot trial end successfulli robot pan head find color strip stop distanc determin averag consecut infrar sensor read simplifi optim veloc straight score trial product veloc straight score averag veloc robot trial straight function angl robot forward direct direct target color distanc target figur calcul straight convert measur offset function straight normal account robot distanc color strip robot fix orient larger robot closer color strip function defin score start stop stop start stop start stop time stop stop ffi function constant maximum minimum measur distanc tabl list valu stop valu stop robot find color strip assum robot gait turn sharpli pan head face color strip case receiv score score receiv ffi individu select averag score trial tabl sampl valu stop stop stop ffi ffi ffi ffi ffi ffi ffi ffi ffi method run experi evolv gait evolv pace gait differ experi time set leg swing gait set leg swing ffi shift leg pace gait set leg side robot move left side ffi shift result evolv gait popul size ran gener random individu creat make initi popul individu initi popul individu move move backward move awkward individu tendenc walk curv end evolut individu propel robot smoothli straight individu fit score move minut trial figur graph plot result evolv gait figur graph show result evolut pace gait initi individu gait stabl gait randomli gener individu creat initi popul paramet initi popul coupl good individu move quickli individu fit gait larg varianc perform trial locomot paramet averag score trial gener averag figur gait result allevi maintain individu ag reproduct gener evolut individu move figur sequenc imag evolv pace gait interv frame gener averag figur pace gait result experi gener approxim hour evolv paramet individu pace gait list tabl discuss implement evolutionari algorithm enter fit score addit distanc move robot object measur aesthet adjust individu fit find paramet dynam gait errat notabl earli stage evolut set paramet perform evalu poorli figur pace gait figur gait averag fit multipl trial result evolut dynam gait consist perform find reason averag perform trial autonom evolut hand gait pace gait evolv autonom evalu fit evalu metric metric distanc fix amount time evalu metric inaccur individu improv individu start trial middl pen left approxim wall good individu easili allot time happen row score trial good individu frequent low score result low upper limit evolv chang variabl time trial score averag speed upper limit factor limit maximum evolv speed variat start angl robot initi plan run pace experi gener gener improv differ fit result start angl robot center color strip robot spent switch gait paramet current individu turn slightli robot penal stop larg ran straight result differ fit top individu matter luck select pressur individu popul improv experi produc pace gait faster gait true manual evalu automat evalu reason hardwar design pace gait robot shift bodi assist lift leg ground gait leg side bodi clearanc ground move leg difficult robot robot twist torso twist bodi lift leg ground achiev good perform pace evolv gait dynam gait evolv drag forward move leg ground run experi robot angl bodi forward rest front leg run rear leg drag ground individu crawl front rear leg slide ground dynam gait stabl leg eventu fall leg stabil move leg ground switch robot time fall leg evolv earli individu move fast rest leg individu lean side tend turn move receiv larg penalti stop consist rest leg side bodi remov drag robot move straight line graph pace paramet initi random popul good hand tailor control case run individu initi popul show period minut cover fit move smoothli straight bounc frequent turn averag fit popul indic perform evolv paramet robust robust end individu offspr tend similar success individu robust mutat success offspr paramet flourish paramet sensit mutat offspr success di individu sensit environ leg calibr voltag individu perform differ typic consist frequent place move curv ad sensor feedback reduc affect find suggest individu special environ evolv gener gener control individu evalu environ evolv dynam gait hard robot month develop test evolutionari algorithm frequent mainten neck repair cpu board exchang wire leg replac time dozen rubber feet simul easili construct problem requir fine control simul option paper present work autonom evolut dynam gait evolv vector paramet locomot modul evolutionari algorithm run onboard robot robot sensor fit individu evalu assist algorithm successfulli evolv pace gait robot tabl show fit valu individu initi popul individu found actual speed individu pace gait move robot approxim significantli hand develop gait unsuccess develop pace gait tabl summari result initi pop fit fit speed pace previou work evolut real robot simpl robot evolv control task minim simul robot built similar control successfulli evolv complex robot dof evolv sensit behavior locomot sensor achiev result control result show feasibl evolv behavior real robot futur work plan evolv behavior simul model lowlevel behavior evolv real robot acknowledg author ronald jun member soni group refer simpl climb run proc intern confer robot pp francesco evolut home navig real mobil robot ieee transact man stefano competit theori practic anim animat mit press open architectur robot entertain del marina proc intl conf autonom pp hiroaki develop autonom robot robot entertain autonom john randal qualit dynam analysi evolv locomot control herbert anim animat pp applic evolv locomot control robot robot autonom freder cellular encod interact evolutionari robot technic report sussex develop honda humanoid robot proc intl conf robot pp nick minim simul evolutionari robot phd school cognit comput sussex andrew alan genet program approach construct neural network control walk robot proc conf robot pp maja dave challeng evolv control physic robot evolutionari gari david ingo learn gait proc intl conf advanc pp evolutionari robot intern laboratori microprocessor swiss feder institut technolog luc emerg function robot agent evolut proc fourth workshop artifici pp embodi evolut develop humanoid robot antagonist driven joint dof trunk intl conf intellig robot pp
ML/337 6 journal artifici intellig research submit publish estim jonathan baxter lab henri street pa peter bartlett technolog addison suit ca abstract approach direct polici search reinforc learn receiv recent attent mean solv problem partial observ avoid problem polici degrad method paper introduc algorithm gener estim gradient averag reward partial observ markov process control stochast polici similar algorithm kobayashi algorithm chief advantag requir storag number polici free paramet natur interpret term requir knowledg underli state prove converg show correct choic paramet relat mix time control pomdp briefli describ extens control markov continu observ control version train stochast polici intern state companion paper show gradient estim gener tradit stochast gradient algorithm procedur find local optima averag reward introduct dynam program method choic solv problem make uncertainti applic dynam program problemat larg infinit situat system dynam state partial observ case approxim techniqu reli explicit parametr exact method reli parametr form function tend extens studi machin learn literatur sutton approach yield remark empir success number includ learn plai checker chess schedul dynam channel alloc algorithm train approxim function suffer theoret perform greedi polici deriv approxim improv fact polici ai access foundat morgan kaufmann publish reserv baxter bartlett amount equal maximum approxim error state happen parametr class function greedi polici optim illustr concret simpl appendix altern approach circumv approach pursu class stochast polici comput gradient respect averag improv polici adjust paramet gradient direct note polici directli gener indirectli function case paramet paramet adjust minim error approxim true paramet adjust directli improv perform polici gener function algorithm long histori oper control discret event system machin learn describ contribut present introduc background materi explain approach reader familiar materi skip directli section contribut present paper histori algorithm problem problem system dynam perform gradient comput close form challeng aspect approach find algorithm estim gradient simul gradient calcul numer adjust paramet turn estim effect perform simul crude prohibit ineffici problem mild regular turn full gradient estim singl simul system techniqu call score function likelihood ratio method sixti comput perform gradient iid ident process perform function depend random variabl probabl mild regular gradient respect expect written rewrit sum differenti sourc requir regular obtain equat express perform gradient estim rewrit observ formula simul gener sampl distribut sequenc xn gener iid law larg probabl quantiti likelihood ratio score function classic statist perform function depend replac estim perform gradient regen process extens method regen process markov process weiss independ episod partial observ markov process william introduc reinforc algorithm iid sampl previou section sequenc state random encount visit design recurr state sequenc state start state goal state case written sum transit probabl paramet equat admit comput regen cycl form state transit term estim form comput function estim cycl comput storag paramet paramet updat perform function entir estim comput storag real threshold version algorithm element earlier anderson vector reinforc learn elig trace terminolog barto al baxter bartlett algorithm algorithm regen process set state transit episod finish set set return goto exampl perform function includ sum scalar reward scalar reward state correspond averag reward multipli expect recurr time neg length cycl implement assign reward task time goal case discount reward start discount william point simplif case sum scalar reward depend state possibl time start state updat singl regen cycl written influenc reward earlier state drop term write proof intuit shown correct equat simpler formula estim perform gradient set introduc variabl set set estim updat suggest altogeth simpli updat suitabl prove converg usual requir converg stochast gradient algorithm estim algorithm straightforward normal stochast gradient algorithm updat gradient direct sum updat regen cycl tsitsikli provid converg proof albeit slightli updat form move estim expect updat updat suggest context pomdp jaakkola al tsitsikli consid case reward discuss baird moor algorithm polici paper interest suitabl choic perform function combin search approxim function method result algorithm view techniqu spirit barto al polici actor function critic primari motiv reduc varianc estim evid phenomenon present number includ barto al kobayashi baird moor recent work subject includ sutton al tsitsikli discuss updat section address question probabl simpli gener matrix transit probabl directli case mdp state transit typic gener feed observ depend stochast state stochast select control random set control base approach gener control stochast form lookahead fall distribut successor state fix function control denot probabl control paramet observ discuss carri replac algorithm william reinforc algorithm algorithm variant extend cover multipl agent polici intern state import sampl method refer reader work rubinstein shapiro rubinstein analysi applic method system network queue worth mention larg literatur perturb analysi seek similar goal estim perform oper restrict assumpt ho cao estim perform gradient algorithm previou section reli identifi recurr state updat gradient case elig trace relianc recurr state problemat main varianc algorithm relat recurr time visit typic grow state space grow time visit depend baxter bartlett paramet state frequent visit initi paramet rare perform improv situat partial observ difficult estim underli determin gradient estim elig trace system difficult obtain estim gradient direct access recurr state solv estim principl techniqu introduc bia view artifici truncat elig trace method start point formula elig trace time simpli truncat number term backward cao elig trace updat transit nx nx case reward estim gradient direct step exce maximum recurr time infinit ergod markov estim gradient bia approach varianc diverg limit larg illustr natur select paramet larg ensur bia accept expect true gradient larg varianc prohibit result cao wan illustr nice potenti difficulti method likelihood ratio rememb previou time requir storag kn paramet obtain small memori grow bound altern approach requir fix amount memori discount elig truncat express term likelihood ratio reli avail underli state xs xs replac estim discount factor case estim gradient direct step simpli estim analyz present paper similar estim replac reward baselin al continu control kobayashi fact place affect expect estim algorithm judici choic reward baselin reduc varianc algorithm present al estim expect stationari distribut gradient discount show fact estim gradient expect discount reward stationari distribut depend paramet similar estim tsitsikli time replac estim averag visit identifi recurr state final observ elig trace defin simpli filter version sequenc infinit filter case finit filter case address interest theori optim filter estim contribut describ gener algorithm base gener estim perform gradient gener pomdp control stochast polici denot averag reward polici paramet reli access underli recurr state write expect estim produc show lim quantit close true gradient provid exce mix time markov chain induc pomdp truncat estim prevent set arbitrarili close varianc algorithm estim approach prove converg probabl discret continu observ control space present algorithm gener markov chain pomdp control stochast polici extens investig version paper written outlin develop briefli section companion paper show gradient estim produc perform gradient ascent averag reward describ tradit stochast gradient algorithm util gradient estim perform line search result present result paper appli markov chain distinct eigenvalu estim bia varianc found bartlett baxter gener markov chain treat refin notion mix time roughli varianc grow bia function baxter bartlett ing theoret result present paper toi practic aspect algorithm number realist problem reinforc learn problem model reinforc learn markov process finit state space stochast matrix ij give probabl transit state state state reward matrix belong class stochast fp denot markov chain assum markov chain reward satisfi assumpt uniqu stationari distribut satisfi balanc equat denot assumpt magnitud uniformli bound state assumpt ensur markov chain form singl recurr class paramet markov chain end recurr properti class determin averag assumpt conveni includ recurr class quantifi theorem algorithm baxter al assumpt restrict recurr class chang paramet adjust discuss mdp complet mention action state space polici learner paramet determin polici directli indirectli determin transit probabl care depend satisfi assumpt differenti assumpt meet note easi extend setup case reward depend paramet transit equal straightforward extend algorithm result case section illustr goal find maxim averag lim denot expect sequenc transit gener assumpt independ start state equal stochast matrix ij ij ij result present paper appli bound stochast case expect reward state estim comput gradient averag reward gener mdp averag reward find optimum problemat section gener assumpt gradient local optim ensur exist suitabl gradient random requir class stochast matric satisfi addit assumpt assumpt rp ij exist ratio ij ij uniformli bound part assumpt transit ij rp ij case set forbidden ij satisfi assumpt ij ij ij nn paramet ij ij ij ij ij kl ij kl assum moment exist justifi suppress reward depend note convent paper equat regard shorthand notat equat form comput differenti balanc equat obtain rp baxter bartlett system equat defin invert balanc equat show left eigenvector denot column vector consist matrix stationari distribut row rewrit matrix satisfi lim write lim lim lim easi prove induct converg assumpt exist equal write rp rp mdp suffici small number solv yield gradient direct state space small exact solut small deriv optim polici polici iter point pursu gradient base approach place problem practic intract find comput gradient approxim techniqu present section argument lead coupl fact uniqu solut justifi exist run step comput small show express uniqu matrix satisfi equat case tractabl dynam program algorithm estim approxim gradient markov chain show gradient split neglig discount factor approach denot vector expect discount reward state depend write proposit proof observ satisfi bellman pj pj section term estim singl sampl path markov chain theorem show gradient estim algorithm present paper converg rj bellman equat equal rj impli rj algorithm al estim term express import note rj quantiti term stationari distribut depend paramet algorithm al estim gradient expect discount reward expect discount reward simpli time averag reward fact gradient expect discount reward proport gradient averag reward theorem show term neglig approach notic proposit arbitrarili larg limit theorem lim baxter bartlett proof recal equat discuss rp rp stochast rewritten discount factor express rp lim complet proof show invok observ write rp back sum write rp theorem show good approxim gradient approach turn valu close lead larg varianc estim describ section theorem show provid transit probabl matrix distinct markov chain short mix time initi distribut state markov chain converg stationari provid assumpt exist uniqu stationari distribut satisfi lancast theorem spectral resolut theorem theorem impli distribut converg exponenti time constant converg rate mix depend eigenvalu transit probabl matrix exist uniqu stationari distribut impli motiv kind algorithm estim base differenti reward back rp sum diverg reason converg orthogon rp limit larg view sum orthogon infinit direct finit direct finit compon estim approxim render finit alter substitut lead approxim final paragraph section estim largest magnitud eigenvalu multipl left eigenvector stationari distribut sort eigenvalu order turn determin mix time chain theorem show small compar gradient approxim accur estim direct updat theorem compar direct gradient estim denot spectral condit number matrix defin product spectral norm matric kak ka kak max kxk denot euclidean norm vector theorem transit probabl matrix satisfi assumpt stationari distribut distinct eigenvalu matrix eigenvector eigenvalu normal product satisfi notic expect stationari distribut mix time bound theorem depend paramet markov spectral condit number markov chain impli eigenvector equal ratio maximum minimum probabl state stationari distribut eigenvector orthogon condit transit probabl matrix distinct eigenvalu condit number replac complic express involv spectral norm matric form proof exist distinct eigenvalu impli express theorem polynomi write proposit show baxter bartlett easi verifi left eigenvector write sm diag proposit sm sm sm inequ appli inequ obtain sm spectral norm bound factor numer clear definit spectral norm product matric satisfi kak spectral norm diagon matrix max jd sm sm combin equat prove estim estim gradient markov chain algorithm introduc mcg chain algorithm estim approxim gradient singl sampl path markov chain mcg requir real dimens paramet paramet elig trace paramet gradient estim note time step averag algorithm mcg chain algorithm paramet class stochast matric fp satisfi assumpt arbitrari start state state sequenc gener markov chain transit probabl reward sequenc satisfi assumpt set state visit end theorem assumpt mcg algorithm start initi state gener sequenc satisfi lim proof fx fx denot random process entir process stationari proof easili gener arbitrari initi distribut fact assumpt fx asymptot stationari fx baxter bartlett write ij ij rp ij ij jjx rp ij ij probabl respect stationari distribut process fact magnitud reward domin converg theorem rewrit equat rp ij ij denot indic function state expect respect stationari distribut chosen stationari process fx ergod process fz defin rp ij ij obtain fix function fx fz stationari ergod proposit rp ij ij bound assumpt ergod theorem lim rp ij ij lim lim estim concentr term observ br br br bound magnitud reward ij ij assumpt lim equat mcg algorithm show equal requir estim gradient partial observ markov process algorithm appli class stochast matric comput gradient rp ij section special case class random polici control partial observ markov process observ qualif mean assum polici access observ process depend gener state assum control ng observ mg determin stochast matrix depend paramet state observ gener independ probabl distribut observ denot probabl observ random polici simpli function map observ probabl distribut control observ distribut control denot probabl control observ random polici observ distribut correspond markov chain state transit gener select observ state baxter bartlett distribut select control distribut gener transit state probabl ij chain function set paramet observ markov chain state transit matrix ij ij ij equat impli rp ij ij algorithm introduc algorithm gradient partial observ markov modifi form algorithm updat base note algorithm requir knowledg transit probabl matrix observ process requir knowledg random polici essenti algorithm al reward baselin algorithm assum polici function current observ algorithm work finit histori observ optim polici function entir observ histori extend appli polici intern state algorithm algorithm class random polici satisfi assumpt partial observ markov process control random polici correspond class markov chain satisfi assumpt arbitrari start state observ sequenc gener pomdp control gener randomli reward sequenc satisfi assumpt sequenc state markov process set observ control subsequ reward end estim converg algorithm replac assumpt similar bound gradient assumpt exist ratio uniformli bound theorem assumpt algorithm start initi state gener sequenc satisfi lim proof proof line proof theorem ij ij ij expect respect stationari distribut fx process fz defin control process observ process result argument proof theorem control depend reward circumst reward depend control control consum energi add penalti term reward function order conserv energi simplest deal defin state expect reward baxter bartlett redefin term lim expect trajectori perform gradient approxim rp due fact satisfi bellman equat replac account depend line replac straightforward extend proof theorem set paramet depend reward modifi reward depend directli line replac converg approxim theorem carri provid uniformli bound reward consid tsitsikli baird moor baird moor show suitabl choic lead combin polici approxim set usual reward discount updat seek minim expect bellman error ij effect minim bellman error drive system state small bellman error motiv approach understood consid bellman error state case greedi polici deriv actual polici expect gradient comput kind updat algorithm polici plai role function plai role critic reward depend current previou state substanti alter analysi estim extens infinit control space converg proof algorithm reli finit state observ control space clear modif algorithm appli immedi pomdp countabl infinit countabl ij kernel densiti observ interpret appli subset probabl densiti function densiti subset euclidean space finit theorem extend show estim produc algorithm converg prove gener result impli case densiti subset finit case theorem gener space satisfi topolog assumpt definit assumpt control space topolog gener measur defin measur space refer measur observ space refer measur satisfi condit case theorem refer measur count measur refer measur measur assum distribut absolut continu respect refer deriv mass finit densiti euclidean satisfi assumpt assumpt probabl measur absolut continu respect refer measur probabl measur absolut continu respect refer measur refer measur deriv exist ratio bound replac algorithm deriv respect refer measur converg result gener theorem appli densiti euclidean space theorem control space observ space satisfi assumpt refer measur control space algorithm baxter bartlett replac assumpt start initi state gener sequenc satisfi lim proof appendix result version extend prove properti algorithm section briefli outlin result multipl agent singl agent gener action multipl agent paramet set distinct observ environ gener action polici agent receiv reward signal cooper solv appli collect pomdp obtain concaten paramet singl vector na na na easi calcul show gradient estim gener collect case obtain appli agent concaten result na estim produc appli agent lead algorithm agent adjust paramet independ explicit collect adjust maxim global averag reward similar observ context reinforc al algorithm biolog plausibl synapt rule appli network spike neuron neuron regard independ agent shown network rout applic polici intern state consid pure reactiv polici chosen control function current observ easili extend cover case polici depend finit histori observ optim control polici function entir observ histori observ histori summar form belief state current distribut updat base current knowledg suffici optim behaviour extens polici intern belief state aberdeen baxter similar spirit extens reinforc al estim deriv gener comput estim deriv averag reward singl sampl path underli pomdp observ dx densiti perform measur dx denot matrix deriv verifi log log term outer product log matrix entri log log sequenc state visit recurr state markov chain section combin yield squar term express outer express deriv algorithm comput estim hessian involv addit usual elig trace matrix trace updat time step algorithm return averag term outer product comput deriv gradient method optim polici paramet bia varianc bound theorem bound bia rel appli underli markov chain distinct eigenvalu extend result arbitrari markov chain extra gener bound involv number state theorem paper suppli proof varianc scale provid formal justif interpret term present gener algorithm comput arbitrarili accur approxim gradient averag reward markov chain chain transit matrix distinct accuraci approxim shown control baxter bartlett size eigenvalu show algorithm modifi appli partial observ markov process control stochast discret continu observ state space finit state prove converg probabl algorithm briefli extens polici intern estim gener bia result chain varianc result avenu research continu time result follow extens result present mcg algorithm appli countabl infinit state converg result case companion paper present result show rapid converg estim gener true gradient give variant algorithm present variant gradient ascent make estim present result show effect algorithm varieti includ nonlinear physic control problem acknowledg work support australian research benefit comment anonym research perform author research school inform scienc australian nation appendix simpl polici degrad learn approxim approach reinforc work minim form error approxim function true function long necessarili lead improv polici perform function includ appendix illustr phenomenon occur simplest geometr intuit phenomenon markov process figur control transit probabl matric system state probabl start state state probabl opposit state reward state reward optim polici select action polici stationari distribut state discount state discount expect state sequenc state transit gener solv bellman yield estim figur markov process learn approxim function state scalar featur ensur paramet learnt greedi polici obtain state state illustr neg tempor differ learn popular techniqu train approxim function shown linear converg paramet minim expect squar loss stationari distribut argmin substitut previou express optim polici solv yield valu wrong sign situat optim polici implement greedi polici base approxim function class observ optim polici converg function greedi polici implement suboptim polici geometr illustr occur shown figur point graph repres valu state scale state state ax weight squar euclidean distanc graph point correspond expect stationari distribut squar differ function shade greedi polici function rank state state bold line repres set realiz approxim function solut approxim function found project point true function line illustr figur project suboptim weight distanc space account polici boundari appendix proof theorem proof topolog lemma definit pp baxter bartlett optim approxim legend figur plot space system note scale axi weight squar root stationari probabl state optim polici solut found simpli project true function set approxim function lemma topolog space gener measur space sequenc set satisfi partit fs distinct element empti fxg fs sg proof countabl subset fx countabl neighbourhood construct partit countabl set defin fs fs estim measur partit pair distinct point pair disjoint open set pair neighbourhood disjoint suffici larg fall distinct element partit true pair fs sg trivial measur singleton fxg measur fs fxg fact fxg lemma result show approxim expect random variabl singl sampl path markov chain lemma measur space satisfi condit lemma suitabl sequenc partit lemma probabl measur defin space absolut integr function event defin uniqu element lim proof sign finit measur defin absolut continu respect equat defin deriv respect deriv defin lim section theorem theorem express equal ae proof ij absolut continu respect refer measur write ij ij baxter bartlett depend absolut differenti integr obtain rp ij ij avoid clutter denot distribut denot distribut rp ij ij probabl measur gener write ij notat lemma defin ij ij measur set notic ij pr jx sequenc partit lemma denot element lemma ij lim ij lim ij estim assumpt domin converg theorem interchang integr limit lim ij lim pr jx lim probabl expect respect stationari distribut distribut random process insid expect asymptot stationari ergod ergod lim lim easi doubl limit exist order lim lim lim argument proof theorem show tail uniformli bound requir refer learn control intern state tech australian nation stochast optima engin gradient descent gener reinforc learn advanc neural inform process system mit press baxter bartlett hebbian synapt modif spike neuron learn tech research school inform scienc australian nation estim approxim bound reinforc learn journal comput system invit special issu colt adapt element solv difficult learn control problem ieee transact experi estim journal artifici intellig research learn plai chess machin program athena scientif dynam program optim vol ii athena scientif probabl algorithm sensit analysi markov chain potenti perturb realiz ieee transact control system real analysi probabl wadsworth california stochast approxim optim winter simul pp likelihood ratio gradient estim stochast system commun likelihood ratio gradient estim regen stochast advanc appli perturb analysi discret event dynam system kluwer boston reinforc learn algorithm partial observ markov problem advanc neural inform process vol mit ma analysi algorithm elig reinforc learn imperfect function fifteenth intern confer machin pp estim reinforc learn continu action stochast gradient ascent intellig autonom system pp reinforc learn pomdp function approxim fourteenth intern confer machin learn pp reinforc learn stochast hill climb discount reward twelfth intern confer machin learn pp algorithm neural inform process system mit press theori matric academ san ca optim markov reward process tech mit polici search tech mit intellig laboratori learn control partial observ environ fifteenth intern confer uncertainti artifici intellig learn cooper polici search sixteenth intern confer uncertainti artifici intellig sensit analysi likelihood ratio winter simul confer sensit analysi simul likelihood ratio oper problem mont carlo optim phd thesi optim complex stochast system singl sampl path score function method annal oper score function estim sensit analysi optim queue network annal oper modern simul model york discret event system york studi machin learn game checker ibm journal research baxter bartlett measur unifi approach englewood nj learn partial observ markovian process eleventh intern confer machin learn reinforc learn dynam channel alloc cellular telephon system advanc neural inform process pp mit press optim control partial observ markov process finit horizon oper optim control partial observ markov process infinit discount cost oper reinforc introduct mit cambridg ma isbn polici gradient method reinforc learn function approxim neural inform process system mit press approach network rout tech australian nation practic issu tempor differ learn machin achiev plai neural analysi tempor differ learn function approxim ieee transact automat simpl statist algorithm connectionist reinforc learn machin reinforc learn approach schedul fourteenth intern joint confer artifici pp morgan kaufmann
AI/338 2 identifi handl structur incomplet valid probabilist eugen santo jr dept comp sci eng connecticut ct sheila bank calcul insight fl scott brown david dept elec comp eng air forc institut technolog abstract expert system attempt address problem expert system design bayesian knowledg base knowledg gather domain expert framework inferenc uncertainti perform natur knowledg complet combin possibl impract system inher system problem incomplet gap knowledg base area lack knowledg preclud hinder arriv solut knowledg omit knowledg erron omit valid result intent strength captur relev portion knowledg critic model expert knowledg domain research method handl form incomplet administ graphic interfac goal detect incomplet correct knowledg engin intuit fashion introduct issu consid construct complet knowledg base system knowledg acquisit phase knowledg engin extract knowledg expert method extract knowledg numer scheme knowledg chosen knowledg engin carefulli build knowledg expert system inferenc opportun input inform build system modif knowledg base exist system affect area reason verif valid knowledg base system increasingli import part todai sophist knowledg base system great amount research perform area past year ram preec small oleari larg number knowledg inferenc knowledg acquisit common consensu method research center scheme bayesian knowledg base captur uncertainti issu scheme part expert system shell expert infer integr framework expert system develop bank bank research develop methodolog correct problemat area unintent incomplet present knowledg base incomplet recogn valid tool correct lack knowledg introduc result work integr system test case instrument valid test case submit system result compar expect result incomplet occur inferenc reach expect solut defin test case incomplet sourc investig paper identifi incomplet exist graphic incomplet tool assist knowledg engin locat area incomplet extract miss inform insert knowledg base verif valid difficulti develop knowledg base knowledg knowledg lead error form type error incomplet research stem handl incomplet valid stage develop main object close knit import understand distinct differ verif defin make system built correctli critic step ensur inform deem includ inform interpret appli correctli system inspect specif exist verif check complianc specif correct softwar syntax built verif refer test ensur output system correct check system develop user request assum knowledg base built satisfactorili expert system valid consist run sequenc test case system compar system result result expert opinion smith process find larger system okeef al state consid cornerston evalu expert highli effici implement invalid system smith valid refer test concern insid result system import major literatur sole concern specif automat error check aspect matur autom tool exist prakash autom built system verif continu address knowledg base construct ensur qualiti final product includ entir develop knowledg base increment test aid find inaccuraci incomplet earli develop system correct difficult correct determin valid benefici determin human expert problem area creat reason expect system perform expert system knowledg base perform chang drastic initi stage system field test valid earli harm critic applic live field test expert knowledg model maintain involv develop system assist identifi error earli develop cycl detect stage valid valid modif enhanc implement import earlier test test ensur origin system degrad modif made correctli implement comparison previou test case result perform modif effect test updat system remain valid area insid modifi area type test import probabilist chain infer alter bayesian highli flexibl knowledg santo close relat bayesian network fact subsum bayesian strongli base probabl theori foundat framework enabl inferenc incomplet knowledg contrast bayesian network demand complet specif probabl distribut make knowledg knowledg base inferenc difficult cumbersom avoid system valid power fact specif design incomplet desir unabl drawn knowledg base incomplet correct incorpor knowledg base bayesian random variabl repres object event world rv instanti state valu combin model current state world inferenc knowledg involv comput joint probabl rv type inferenc belief belief diagnost domain explan state world built combin instanti support arc shown figur instanti repres oval repres instanc rv arc repres relationship support repres smaller rectangl circl assign probabl figur cloud heavi support singl probabl sidewalk wet support singl cloud heavi probabl order support case cloud activ constraint includ sidewalk wet cloud heavi fig ffl support condit rv instanti mutual activ time support ffl cyclic knowledg node support ffl probabl rv sum valu greater complet discuss constraint bank bank bank incorrect incomplet imperfect inform ubiquit inform real world critic knowledg engin understand condit exist creation knowledg base concept essenti incorrect bank bank inconsist primarili relat probabilist valu condit probabl sum greater type error discov correct knowledg acquisit process form inconsist knowledg introduc knowledg engin immedi inform continu updat statu window process assur knowledg consist entir knowledg build process incorrect occur queri system result incorrect solut find locat error correct harder aspect valid continu address varieti approach sensit analysi neural network reinforc learn techniqu bank incomplet exist set input valu pass system fail arriv type omiss difficult detect locat knowledg base incomplet case unintent incomplet sourc human error major sourc type error expert difficulti convei complet heurist knowledg knowledg engin lack inform lead incomplet knowledg base inform miss develop knowledg base left futur modif type knowledg area type drug medic constantli develop abil handl incomplet critic valid system abil critic abil incorpor incomplet advantag desir qualiti incomplet identifi direct depend region defin evid item test case region modifi addit link link answer item direct depend region addit link manner place answer item direct depend region evid incomplet dissip methodolog develop research graphic present manner suitabl knowledg engin locat area incomplet incomplet link ad futur inferenc link ad tool manner forc maintain rule methodolog describ methodolog handl incomplet miss link bayesian knowledg base incomplet link identifi locat test case test case lack direct depend connect evid answer correct incomplet approach graphic present knowledg engin mean locat correct incomplet found test case desir trait methodolog includ ffl maintain structur previou inform assumpt made inform address current test case correct ffl disallow knowledg engin input inform violat knowledg rule mutual bank ffl inher larg knowledg base problem find incomplet exist order fix problem tool avoid present inform overwhelm knowledg larger knowledg base test case valid resubmit submit test case start direct depend check valid test data mine ka edit support graphic incomplet tool end fig test case process consist set distinct rv consist answer consist evid test case submit system result compar expect result test case valid number step system figur depict flow test case system valid tool place assumpt suppli test case test case knowledg base valid constrain assum correct entireti knowledg engin burden ensur test case complet valid import understand evid item directli relat answer vice versa evid answer item part test case answer evid item depend intersect evid depend region answer instanc direct depend region kei valid effort environ formal defin rv instanc directli depend connect sequenc parent child relationship directli depend sequenc parent sequenc child connect node figur show direct depend region evid item definit random variabl instanc directli depend random variabl instanc exist sequenc random variabl instanc fx xn posit element sequenc random variabl instanc element support condit element sequenc random variabl instanc element support condit fig direct depend region valid test step check direct depend region connect evid answer item evid answer found direct depend case incomplet pass tool probabilist valid bank direct depend region check incomplet exist test case correct knowledg base structur graphic incomplet tool visual interact approach knowledg engin examin knowledg base complet accuraci tool activ assist gener solut engin select prefer choic type correct avoid modif assumpt automat valid tool make abil view relev portion knowledg base problem occur kei incomplet methodolog extend graphic present displai incomplet correct intuit fashion defin incomplet miss miss miss state incomplet miss rv state correct data mine normal knowledg acquisit mode concern remaind research unintent incomplet miss link relationship test case direct depend region check discov type methodolog begin present graphic format locat incomplet aid distinctli displai direct depend region evid answer item incomplet test case abil assist knowledg engin search pertin inform incomplet link locat node long constraint violat addit link constraint violat care avoid situat link node special handl methodolog mode incomplet correct add mode insert mode mode correct incomplet form locat sourc knowledg engin select correct incomplet evid answer node direct depend descend evid answer node locat target depend activ mode add target node direct depend ancestor evid answer node insert target node descend direct depend region evid answer node restrict ensur direct link correct direct resolv current incomplet problem select sourc target manner correct incomplet due direct depend relationship node extend target identifi knowledg engin target correct incomplet avoid constraint violat understand function graphic incomplet question function addit incomplet link node direct depend region preliminari test function add insert mode recreat highli connect start link remov requir singl exist graphic incomplet tool recreat link receiv number test case order test case determin amount insert versu addit total construct graphic incomplet demonstr incomplet link handl graphic incomplet tool highli connect work support part afosr project refer knowledg base develop tool requir intellig monitor aid tenth intern florida artifici intellig research verif expert theori practic intern journal expert system valid expert system perform ieee expert valid blackboard order knowledg sourc aaai workshop verif valid current approach handl imperfect inform data knowledg base ieee transact knowledg data engin tool aid verif valid ai applic intern journal expert system valid current trend issu knowledg engin review design valid system screen product innov ieee transact cybernet framework build uncertainti journal theoret artifici intellig tool acquir consist knowledg uncertainti aaai workshop verif valid probabilist valid aaai workshop verif valid
IR/339 5 knowledg web extend rdf schema michel klein stefan decker dieter fensel frank van harmelen ian horrock abstract holland vrije universiteit holland depart comput stanford usa depart comput uk widespread interest emerg ontolog web rdf schema basic tool enabl user defin structur constraint express metadata web resourc includ provis formal express suffici ontolog model reason show rdf extend includ express knowledg languag enrich requir addit express semant languag describ ontolog languag oil extens rdf import advantag approach ensur maxim share partial interpret oil ontolog semant awar processor yield correct partial interpret introduct comput chang singl isol devic entri point worldwid network inform exchang busi transact support knowledg exchang kei issu current comput technolog ontolog plai major role support inform exchang process area definit ontolog formul past decad captur essenc ontolog base relat definit ontolog explicit specif share conceptu conceptu refer abstract model preprint submit elsevi scienc novemb phenomenon world identifi relev concept phenomenon explicit mean type concept constraint explicitli defin formal refer fact ontolog machin machin interpret inform provid unambigu share reflect idea ontolog captur consensu restrict accept group rdf schema rdf mean defin structur constraint express metadata web resourc formal semant primit defin rdf schema express primit suffici ontolog model reason task requir addit layer top rdf schema tim call layer architectur semant web lowest level semant web requir gener mechan express machin readabl semant data resourc descript framework foundat process provid simpl data model standard syntax metadata languag write factual statement layer schema layer rdf show formal knowledg languag logic layer illustr defin ontolog languag oil extens rdf schema oil infer major ist project infer layer unifi import aspect provid formal semant effici reason support provid descript epistemolog rich model primit provid frame standard syntact exchang notat provid web commun show rdf extend express knowledg enrich requir addit express semant languag describ ontolog languag oil extens rdf enabl express formal languag web offer basi autom inform filter queri answer import advantag peculiar approach extens method ensur maxim share partial interpret oil ontolog semant awar processor yield correct partial interpret paper structur section present short introduct rdf tool evolv ontolog rdf schema section introduct oil section illustr detail rdf schema oil knowledg languag result rdf schema definit oil make express oil ontolog rdf syntax section discuss approach make tap addit advantag oil reason support formal retain maxim compat section present rdf rdf schema section present main featur rdf rdf schema critic review design introduct rdf semant web requir semant inform rdf foundat process applic exchang inform web rdf defin data model describ semant data basic data model consist object resourc entir web part web collect object directli access print book resourc uri properti specif relat describ resourc rdf statement consist specif properti properti resourc question individu part statement call rdf defin basic model primit introduc standard syntax rdf document defin properti term resourc appli wide web state publish subject object statement statement link state creat staff member resourc member act state email address rdf statement resourc statement appli nest result underli data model label statement act link object subject graph entir graph introduct rdf schema model primit offer rdf basic rdf schema specif defin model primit rdf rdf schema extend rdf assign extern semant specif extern semant rdf schema semant captur rdf oil bear similar relationship defin semant specif resourc extend rdf schema oil captur mean captur ad li care creat extens rdf schema partial interpret addit oil semant yield valid rdf schema interpret similar rdf schema fulfil role xml schema xml prescrib order combin tag xml document rdf schema inform interpret statement rdf data constrain syntact rdf descript definit correspond binari predic ground predic term oil rdf present document includ constraint structur actual oil ontolog section briefli discuss structur rdf main model primit data model rdf schema figur present hierarchi rdf figur present relationship rdf primit prefix refer rdf space primit prefix defin refer primit defin rdf note rdf properti primit construct definit rdf schema specif specif instanc rdf properti dual role make view rdf properti predefin newli introduc rdf properti introduc referenti rdf schema make uniqu compar convent model meta model make rdf schema specif difficult read cf model primit rdf schema discuss main constraint rdf figur hierarchi model primit rdf figur relat model primit rdf core class rdf express view instanc class class class properti instanc slot relat instanc defin concept concept instanc core properti relat model relationship resourc class resourc instanc class relat model subsumpt hierarchi class transit class subclass class class subclass subclass inherit graph relat model subsumpt hierarchi properti properti properti resourc properti impli resourc properti inherit graph core constraint defin class constraint subset cover properti defin constraint restrict rang domain properti permit express rang constraint properti enforc interpret union domain oil section offer descript oil detail found small ontolog oil present figur languag design model primit commonli descript logic orient featur clean autom reason class consist subsumpt provid fact system dl reason develop end clear rdf specif appli instanc titl creator subject descript didact ontolog describ african anim publish type format identifi sourc languag eat properti transit weight rang properti function colour rang string properti function anim plant disjoint anim plant tree plant branch tree leaf branch defin anim eat anim defin anim eat disjoint mammal anim eleph eat plant colour defin eleph africa defin eleph india eleph instanc inform africa contin asia contin relat india asia figur oil model anim kingdom core languag expect extend futur set addit primit note full reason support ontolog primit ontolog oil repres ontolog ontolog definit segment adopt compon defin dublin core metadata element version segment consist option import option rule base slot axiom definit class definit associ class class descript class consist statement slot type definit definit state condit class membership suffici condit statement class slot boolean combin class express oper standard dl semant situat class express defin rang data type data type support oil integ string rang defin express defin data type consist integ greater equal defin consist string slot constraint list constraint appli slot typic constraint instanc class defin slot constraint slot instanc class express list instanc class defin slot constraint relat slot relat individu instanc class express list instanc class defin slot constraint relat distinct instanc class express slot relat shortcut min slot definit associ slot slot definit slot definit specifi global constraint appli slot relat consist domain rang addit qualiti symmetr axiom assert addit fact class class disjoint instanc valid axiom disjoint class express list disjoint cover instanc class express instanc class express list instanc class express instanc class express list class express list syntax oil gear xml rdf defin dtd xml schema definit oil deriv xml schema write instanc oil ontolog deriv rdf syntax oil oil extens rdf schema rdf basic model order tripl object link rdf enrich basic model provid vocabulari assum semant section present care analysi relat rdf oil defin oil exist vocabulari reason twofold rdf primit effect formal semant specif formal semant oil extend rdf primit rdf full provid backward compat oil rdf complet schema found rdf serial previou section rdf ontolog import mechan outer box oil specif rdf defin xml namespac definit refer rdf namespac definit make extern defin rdf construct local oil specif rdf actual ontolog oil namespac definit make rdf rdf definit oil specif ontolog defin oil rdf import note namespac definit import statement transit actual ontolog defin namespac rdf rdf element oil directli correspond rdf rdf element unavail metadata describ oil ontolog structur rdf format dublin core element set suffici import namespac dublin core element set import note oil provis definit inform guidelin rdf imposs enforc schema definit oil ontolog consist set definit import definit simpl list refer oil modul includ ontolog make xml namespac mechan incorpor mechan rdf specif contrast import statement namespac definit transit class attribut definit class definit link class attribut defin class simpli declar assign id demonstr write oil class definit make maximum exist rdf extend rdf addit construct tabl figur inform rdf guidelin start properti class capit illustr examin systemat oil class definit repres rdf defin anim eat plant eleph mammal eat plant colour figur oil extens rdf subsumpt hierarchi defin class subclass instanc eat plant part plant defin class subclass mammal defin class primit class start translat class definit header straightforward construct properti assign definit identifi class defin class chose introduc extra class oil class class option identifi class defin method serial import note model method make actual class instanc introduc nice distinct oil rdf schema actual class instanc gener class oil explicitli identifi defin assum primit class subsumpt translat statement rdf straightforward simpli exist rdf order defin class subclass class properti slot constraint serial slot constraint class rdf mechan restrict attribut class local level due natur rdf data properti defin domain descript coupl relev class overcom introduc full potenti capac extens introduc placehold class specif class slot model oil namespac subclass similar slot constraint cardin extra properti serv assign concret cardin constraint connect slot constraint actual properti refer class restrict introduc placehold class oil rdf specif appli rang restrict group actual oil ontolog pair helper properti helper properti direct counterpart term oil serv connect class defin properti connect properti restrict subject properti connect properti restrict class restrict serial part slot constraint primit introduc proce restrict type properti string boolean express slot constraint complet translat element fill featur oil boolean express boolean express express evalu class definit concret type case class express boolean combin class slot constraint case concret type express simpl string integ complex express section boolean express evalu class thing plant part plant introduc common special placehold introduc sibl construct boolean express kind express specif boolean introduc subclass note singl class essenti simpl kind class subclass figur oper connect operand properti properti direct oil primit term serv helper connect class relat class rdf data model mean properti serial boolean rdf schema definit oper read helper properti defin fact boolean class express express construct type model stem directli rdf approach appli defin observ properti restrict relat class properti stem fact properti restrict plai role boolean operand list statement illustr featur translat class bit translat oil subsumpt statement rdf statement list superclass rdf model slot constraint serial manner demonstr slot constraint concret type slot constraint restrict concret type shortcut syntax restrict introduc form primit serial slot introduc class helper connect direct rdf constrain properti datatyp rang constrain string creat subclass sake clariti subset liter string rang filler properti set type liter semant type process rdf processor fact case string made inform guidelin complet translat class note properti restrict element tabl oil construct oil primit rdf syntax type class properti class class class class class properti class class class class class class cardin class serial express translat oil class definit rdf syntax specif construct maxim sacrif clariti specif enabl rdf agent understand specif retain option translat back oil unambigu examin serial global slot definit slot definit oil rdf slot citizen ontolog slot definit oil map nice properti definit rdf properti direct rdf tabl present overview oil construct rdf construct subtl differ domain rang restrict oil rdf oil multipl domain rang restrict singl slot interpret set restrict intersect class individu statement multipl domain statement interpret union class statement limit reason capabl rdf drastic semant properti rang restrict rdf current consensu rdf commun semant domain rang chang rdf anticip interpret multipl domain multipl rang restrict conjunct semant differ rdf oil class rang domain class case rang express sophist conjunct semant multipl rang extend rang restrict rdf serial introduc domain rdf broader rang class deriv class membership domain statement union semant express valid class express concret type express translat slot simpl domain rang restrict eat domain translat complic properti ag domain rang rdf rang properti string definit subclass state rang ag global oil specif aspect slot properti definit rdf domain rang oil slot attribut qualiti light add properti domain rang add class reflect qualiti slot rdf serial properti add qualiti properti oil definit properti transit read abbrevi method translat qualiti properti featur nice distinct oil languag actual translat class section actual properti consid instanc properti made instanc assign multipl qualiti note repres qualiti properti rdf gener approach model axiom present approach make distinct construct construct altern serial attribut properti defin qualiti properti actual ontolog defin qualiti properti oil specif level actual ontolog level approach model qualiti defin properti actual ontolog instanc qualiti approach preserv level distinct dislik meta meta level object level solut clean distinct make meta object level axiom tabl oil construct oil primit rdf syntax type class properti domain properti properti rang properti properti properti transit class function class symmetr class axiom oil factual statement class ontolog correspond relat class greater rdf featur binari relat simpli map oil axiom rdf properti chose model axiom helper properti connect class express involv relat axiom consid natur approach model rdf note binari relat model object rdf properti instanc class simpli introduc primit alongsid relat higher ariti figur introduc placehold class model specif type axiom introduc properti connect axiom object class express relat properti connect axiom object class express illustr serial axiom disjoint axiom relat class express connect class express axiom object type properti cover axiom cover relat class express class express serv function part cover model cover introduc separ placehold subclass specif type cover model subclass introduc addit connect cover axiom connect cover axiom class cover subject illustr serial axiom class anim cover mammal instanc anim instanc restrict valid express previou demonstr knowledg construct oil defin extens rdf schema oil ontolog fulli express rdf schema defin extens schema follow valid oil ontolog restrict valid ontolog express rdf schema extens problem data type enforc instanc string instanc integ syntact due fact rdf schema specif primit data type work data type xml foundat capabl rdf schema specif oil prevent intertwin boolean express class boolean express concret data type statement syntact prevent kind introduc separ boolean oper class express concret type express made schema convolut kind problem schema prevent unnecessari oil variant standard rdf schema bnf grammar oil logic point wrong statement empti class unnecessari affect semant limit compat ontolog plain rdf schema compat rdf schema discuss extent compat achiev semant extens underli languag distinguish level ontolog languag ontolog languag oil languag state level consist ontolog class subclass properti express languag level level instanc individu lion belong class defin level exist schema recommend reveal ontolog languag rdf specif properti relat written rdf instanc written rdf rdf examin semant extens rdf schema find ontolog languag import realiz oil includ rdf schema sublanguag class express written oil legal rdf schema oil class definit item legal rdf schema definit oil extens rdf part oil definit rdf schema illustr note semant statement imposs rdf schema processor interpret entir state legal rdf intend semant properti restrict understood applic notic statement fulli interpret rdf schema processor oil instanc written import consequ fact level organ extens rdf schema show achiev import compat oil compat rdf rdf schema specif valid oil ontolog declar achiev partial forward compat mean ontolog written richer model languag processor simpler ontolog languag fulli interpret instanc inform partial interpret ontolog achiev simpli ignor statement rdf rdf namespac oil definit rdf schema processor interpret statement simpli assert subclass properti interpret albeit interpret definit partial interpret semant rich semant poor process agent crucial step share semant web realist hope semant web built singl standard semant rich show multipl semant model languag lead complet imposs interpret simpler processor pick rich processor safe ignor rest knowledg partial interpret correct respect origin intent problem rdf schema previou section explain defin express knowledg languag extens effect implement layer semant unsolv problem specif oil rdf account restrict restrict cycl subsumpt hierarchi restrict cycl repres class essenti model primit knowledg kind constraint significantli add complex rdf document highli undesir semant syntact constraint limit kind model reason requir detect constraint violat basic contrast oil rang restrict properti discuss section circumv defin dummi superclass class rang reason restrict rdf model rang restrict cleaner solut process extend encount coupl peculiar rdf definit strike discuss section main problem model properti dual role rdf schema level instanc level make challeng model understand rdf specif make distinct clear extens relat consist relat semant relationship unclear obviou mean list domain restrict union element mean relat respect inherit domain rang restrict unclear relat work work ontolog languag date back work frame languag earli dai ai effort design ontolog resent languag date recent year promin effort area shoe ontobrok oil replac defin top rdf rdf essenti merger oil focu compar share principl ontolog languag maintain maximum backward compat exist web standard rdf schema differ oil li languag succe maxim ontolog content understood schema applic understand rdf schema recogn languag specif oil unlik built top rdf ontolog content understood rdf agent rdf properti state simpl subclass relat part oil ontolog access rdf agent local defin properti defin definit reli cyclic definit simpl subclass relationship daml ontolog inaccess rdf agent situat complex class definit definit class intersect class express complet opaqu rdf agent understand semant definit reli fact intersect implicit semant make subclass relat access rdf schema agent argu oil ontolog languag built top oil achiev larger rdf mention ontolog languag merg idea incorpor oil present repres kr languag rdf adopt rdf larger initi languag demonstr inform web shown rdf small step express requir semant web illustr rdf extend addit model primit defin formal knowledg oil import advantag approach maxim compat rdf rdf schema document valid oil ontolog oil ontolog partial interpret semant poorer process agent needless partial interpret incomplet correct intend semant ontolog firmli extens method gener applic knowledg formal acknowledg sean monica michael comment review earli draft paper refer silver bullet knowledg manag electron translat approach portabl ontolog knowledg acquisit url resourc descript framework schema specif candid world wide web semant web road intern world wide web resourc descript framework model syntax world wide web van oil corbi knowledg engin knowledg model intern confer lnc lectur note artifici pp van ontolog infer tech rep vrije universiteit faculti van van der tool knowledg ebusi rdf schema model und informatik und st descript logic proc pp oil intellig inform guarino workshop applic ontolog european confer artifici intellig ecai van relat ontolog translat guarino workshop applic ontolog european confer artifici intellig extens approach model ontolog workshop semant web fourth european confer digit axiom ontolog engin model concept guarino workshop applic ontolog problemsolv european confer artifici intellig ecai knowledg discoveri worldwid kitano work note workshop base inform system nation confer artifici intellig aaai pp url dynam ontolog seventeenth nation confer artifici intellig menlo pp url high intern flair confer
ML/340 6 comparison featur combin strategi visual attent system laurent koch california institut comput neural system program msc california usa abstract visual attent primat detect conspicu target clutter scene classic deriv describ attent rapidli model reproduc attent simpl detect local spatial discontinu orient optic combin uniqu map salienc map sequenti order focu attent studi problem combin featur visual modal unrel dynam rang color uniqu salienc map combin strategi compar natur color simpl normal linear combin learn global normal local nonlinear competit salient locat perform measur number detect salient target found strategi yield perform improv time find salient target yield special system poor gener strategi effici approxim yield significantli perform preserv gener target featur learn introduct primat attent real conspicu object clutter visual environ reproduc target detect capabl artifici system import navig aid robot navig base studi human studi believ visual attent act akin neuron visual world enhanc restrict area attent enhanc progress cortic hierarchi pattern recognit locat attent spotlight control featur extract crude segment conspicu locat entir visual massiv parallel compet attent attent sequenti salient imag locat analyz detail visual attent seemingli perform break complex scene understand sequenc circumscrib pattern recognit problem volit compon attent bottomup form attent studi disregard compon model function account visual attent primat model share similar gener architectur topograph detect local spatial discontinu orient optic flow achiev mechan akin biolog visual recept field recept field properti approxim filter gabor filter orient featur map visual modal combin uniqu map model salienc map sequenti order focu attent send correspond li ck attend locat return inhibit featur map intens orient color linear filter differ normal linear combin salienc map input imag weight coeffici binari target mask learn figur gener architectur visual attent system studi earli visual featur extract parallel repres entir visual scene featur extract achiev linear filter featur type color oper extract local spatial discontinu featur type featur map combin uniqu studi inform combin modal import color discontinu compar orient involv learn target region target combin maximum detector select salient locat salienc map shift attent locat subsequ suppress system focu salient locat central biolog artifici combin featur visual modal unrel dynam rang color uniqu salienc map model assum simpl summat featur linear combin weight quantit compar combin strategi natur color simpl summat scale fix dynam linear combin weight imag addit combin enhanc featur map isol peak suppress featur map uniform local iter competit salient locat model detail model present briefli schemat figur import rememb type color orient extract separ combin uniqu activ control attent fusion inform difficulti combin featur map uniqu scalar salienc map repres priori compar dynam rang extract mechan larg number featur map combin intens comput spatial color orient intens contrast color contrast orient contrast ms ms ms ms attend locat input imag salienc map figur oper model natur imag featur combin strategi section salient object strongli color contrast orient contrast object attent shift ms ms simul subsequ suppress salienc map mechan attend object traffic sign final smaller intersect indic exampl model predict natur synthet imag found salient object strongli map risk mask salient object present larger number map simpl approach solv problem normal featur map dynam rang sum featur map salienc map priori weight featur refer strategi learn learn introduc specif target detect featur map global multipli weight factor final input salienc map sum featur map featur map weight train base featur map insid manual outlin imag region desir target learn procedur weight featur map consist comput global maximum minimum map comput maximum insid manual outlin target maximum target updat weight addit learn rule independ map dynam determin learn speed posit weight learn procedur particip salienc map featur map show higher peak activ insid target map remain system weight converg comput initi salienc map attent scale fix rel weight featur map potenti diverg addit learn rule avoid constrain weight fix sum note local maxima activ imag averag activ area local activ import visual extend region small strong peak peak highli salient immedi averag activ extend region low featur combin strategi refer strategi global amplif simpl normal consist global promot featur map small number strong peak activ man global suppress featur map elicit compar peak numer locat visual scene normal denot consist normal featur map dynam order elimin amplitud differ due dissimilar featur extract find global maximum averag local global multipli map local maxima activ consid compar map ignor homogen area compar maximum activ entir map averag activ spot measur activ locat averag differ activ locat stand strongli promot map differ map uniqu suppress normal replic biolog inhibit neighbor similar featur inhibit featur combin strategi refer strategi iter local interact global normal present previou section simpl easili implement suffer drawback strategi biolog global find global maximum cortic neuron local connect strategi strong bia enhanc featur map uniqu locat significantli conspicu featur map repres distribut conspicu locat entir visual normal suppress map equal strong spot human typic report spot salient fourth featur combin reli simul local competit neighbor salient locat gener principl provid inhibit locat featur inspir connect believ organ primari visual cortex featur map normal valu order elimin amplitud differ featur map iter convolv larg neg result iter dog section shown figur yield strong local excit visual counteract broad inhibit neighbor locat filter obtain figur section differ gaussian filter iter normal featur map central excitatori lobe strongli promot activ locat broader neg surround inhibit strongli activ locat present nearbi dog filter repres total width set width input imag oe oe input imag iter normal featur map subject dog dog differ gaussian filter discard neg constant inhibitori term implement map initi scale introduc small bia slowli suppress area excit inhibit balanc region typic correspond extend region uniform textur dog salient dog implement differ result convolut separ excitatori gaussian convolut separ inhibitori gaussian reason approach separ convolut excitatori small subtract effici insepar convolut reason boundari import problem inhibitori lobe dog slightli larger entir visual field dirichlet boundari condit yield strong edg effect introduc unwant behavior normal process corner imag uniform random invari activ receiv circumv problem truncat separ gaussian filter point portion overlap input map truncat convolut comput fact symmetr boundari condit yield uniform filter entir imag figur present advantag biolog plausibl dirichlet visual neuron recept field edg visual field implement figur boundari condit consist comput dot product filter map overlap normal result total area divid area overlap region reduc set adapt output fire rate rang similar neuron map exampl oper normal scheme figur show similar map compar activ peak suppress map peak stand enhanc dynam scheme complex map local alter global map figur iter iter iter iter iter iter iter figur iter normal featur map strong activ peak surround weaker initi stronger peak gain strength time suppress weaker activ region converg singl activ pixel center initi strong larg number iter note final rang inhibitori filter exce connect inhibit fed back higher cortic area recept field cover substanti portion entir visual lower visual area smaller recept field term dog filter carri framework gaussian pyramid interest note normal scheme resembl network local inhibitori implement oper normal scheme refer scheme iter iter iter iter iter iter iter figur iter normal featur map numer strong activ peak peak equal inhibit result entir map suppress result discuss natur color imag evalu featur combin strategi consist imag red target demonstr simplest form featur map system specif encod main featur target explicitli detect system featur map consist imag vehicl emerg triangl target complic form special target uniqu imag conjunct red color ffi ffi ffi orient featur type repres system separ independ featur map consist imag acquir video camera mount passeng side vehicl driven german traffic sign tabl averag number detect standard red test set emerg triangl test set traffic sign test set imag traffic sign imag target measur number detect target target imag detect naiv iter train red triangl traffic traffic sign found sign found traffic traffic sign target outlin binari target mask creat target consid detect focu attent intersect target imag disk radiu pixel complet coverag entir imag requir locat system perform random visit averag locat find small target imag imag split train set imag traffic test set imag learn train random pass set halv learn speed pass compar result obtain test imag set featur combin model dedic normal featur weight set model model iter dedic normal featur weight learn train set retain test set challeng target immedi detect version model imag version model immedi find target discard ensur perform result summar tabl naiv repres simplest solut problem combin featur map uniqu salienc perform simpl normal prove effici elimin featur map numer peak activ intens map imag larg variat illumin iter implement spatial competit salienc yield compar addit biolog plausibl addit learn rule prove effici special gener model limit special obtain global weight featur learn simpli enhanc weight map suppress poor gener expect learn larg varieti object singl set object ideal requir specif set weight type linear train emploi sum featur learn conjunct model train emerg triangl attend strong obliqu edg red color present red blob absenc obliqu orient extent human train detect learn conjunct featur remain controversi remark train model perform altern model studi traffic wide varieti shape color textur sign method consist yield poor perform method yield special model iter normal approxim yield reliabl detect salient imag locat repres approxim human salienc altern studi kei element iter method exist suppress neg figur tempor global activ entir map typic result mutual inhibit activ weakest activ peak due pass threshold elimin distribut activ peak term isol peak overcom inhibit receiv tempor map global activ start compar peak present period activ slower stronger peak effici inhibit peak iter scheme refin wai order mimic close physiolog earli visual neuron appli relat output fire rate neuron strength gener admit earli visual neuron sigmoid transduc function model interact neighbor region visual field simpl subtract complic pattern interact recept visual neuron report compar simpl strategi combin multipl featur map visual modal singl salienc map introduct simpl learn scheme prove effici detect specif broad special gener model remark good perform obtain normal replic biolog spatial competit salienc addit learn normal strategi provid perform improv model weight summat featur combin strategi acknowledg work support nsf refer koch select visual underli neural hum pp theori pp visual salienc monkei natur pp jan visual attent select artif intel pp attent mit neurobiolog model visual attent invari pattern recognit base dynam rout neurosci pp nov search model visual bull rev pp mechan dynam static scene opt eng pp baluja select attent visual monitor control robot robot sy pp architectur attent mit model visual attent rapid scene ieee tran patt anal mach pp cannon model inhibitori interact effect perceiv vision pp apr integr cortic proc acad sci pp jan gilbert specif horizont connect cat visual neurosci pp jul vlsi circuit visual neural inform process system pp mit transduc function threshold human biol cybern pp cell cat striat vi neurosci pp aug interact visual process pari pp cortic mechan detect focal orient natur pp nov
DB/341 3 issu softwar engin jurgen lind german research center ai im germani abstract discuss conceptu foundat agentori softwar develop relat fundament element agentori view establish program approach motiv concept autonomi basic properti school discuss develop histori program paradigm lead perspect softwar system paper conclud outlook paradigm chang softwar system introduct agent system interest research field comput scienc natur captur structur behavior complex system stimul huge interest make softwar engin softwar make idea distinct fit gener pictur softwar present person viewpoint softwar engin firstli discuss interrelationship concept agent relat program paradigm relat method interest close relat order clarifi describ level abstract involv program paradigm gener identifi aspect common main differ point major contribut agent orient paradigm softwar engin provid outlook paradigm chang softwar system aspect program paradigm term extrem fuzzi captur set aspect complex system theori hard ware design languag program languag fig level abstract aspect locat level abstract interrelationship seldom explicitli formul triangl shown figur describ level abstract view make program paradigm form triangl chosen express fact number concept level abstract higher level layer approach common comput scienc theori separ concept level abstract main advantag layer approach knowledg lower level understand work higher level concept level abstract repres conceptu close framework higher level theori complex lower level incomplet combin higher level theori obtain full coverag part world model note distinct level sharp fact program model assum essenti equal comput power program model implement term model write softwar pure imper program languag implement deduct framework produc concept separ aspect comparison concept awar concept shift abstract current assign level adequ hardwar level abstract encapsul architectur implement comput hardwar comput von neumann architectur introduc late architectur consist processor subdivid unit comput control memori store hold instruct data program architectur common modern comput greatli optim techniqu cach parallel speed comput recent trend hardwar commun turn system network normal person comput jointli work demand task virtual supercomput combin advantag lower cost standard hardwar extrem scalabl add comput resourc vision futur internet entir net virtual supercomput make individu comput power obsolet parallel point view program hardwar attempt build hardwar architectur implement program paradigm directli hardwar attempt success safe assum program paradigm share ground theori higher level thing theori conceptu comput model abstract characterist hardwar theori aim captur capabl comput devic order gener statement automat comput ture radic mathemat conceptu von neumann architectur enabl formal analyz program execut architectur comput theori intend tool programm express idea program natur earli comput theori meant foundat program declar program demonstr empir investig cognit psycholog claim necessarili hold true start comparison issu entiti handl level abstract entiti object object rang concret entiti real world conceptu entiti exist design head object system class determin object basic properti class link wai relat class inherit model conceptu extens common base specif object commun send messag messag request servic receiv object provid intern inform chang current state addit concept paradigm restrict introduct refer reader unfamiliar concept collect concept clear manag size vari greatli approach face problem singl definit entiti dealt exist agent theori built wide accept notion agenc strong notion agent model term mentalist notion desir intent strong notion requir mental concept explicit implement agent notion forc agent weak notion requir view agent defin agent term observ properti agent exhibit social abil notion agenc strict argu pragmat definit agenc design decid agent implement minim extern properti call weak notion agenc explain absenc formal aspect make fall back famou articl earli dai artifici intellig author argu ascrib mental qualiti machin comput understand structur machin program explain predict behavior machin program mccarthi constraint minim requir complex entiti ascrib mental categori mental categori ascrib mental qualiti mean understand commun pure conceptu tool serv express exist knowledg program current state reason ascrib belief ascrib belief adapt limit abil acquir establish gener term elementari structur program gener reason ascrib higher level organ illustr point view mccarthi program sourc code form complet determin program behavior simul mental categori describ behavior mental categori talk reason origin mccarthi discuss reason select reason relev program state point time directli observ observ inform express mental categori complet simul predict behavior basi ascrib mental qualiti feasibl ascrib mental qualiti lead gener hypothesi program behavior finit number simul mental categori ascrib correspond programm intent design program program understood chang easili structur program easili access sourc code form fourth point extrem import task understand exist softwar increasingli import softwar industri develop softwar easier access origin develop idea eventu manifest easier understand design lead higher cost effici softwar mainten gener mccarthi approach idea agent view discuss controversi point view argu bui system simpl perfectli understood conceptu integr achiev view intent entiti simpl system agent lead clearer system design circumv problem decid entiti agent person problem annoi design phase softwar design view identifi basic structur element outlin basic concept describ arrang element point fundament similar identifi basic descript element program class class definit specifi class variabl object method object accept class link class inherit class class extens exist instanc class collabor exchang final structur connect instanc class instanc class concept correspond world replac class state variabl method messag role definit describ agent data produc desir result request trigger servic fundament conceptu similar map due limit briefli summar tabl turn conceptu issu similar program technic aspect runtim environ discuss gener structur runtim system runtim system program paradigm environ program interpret environ radic oop aop structur element abstract class gener role class domain specif role class variabl belief method capabl relat collabor negoti composit holon agent inherit role multipl instanti role individu knowledg polymorph servic matchmak tabl map oop aop simpl restrict administr task manag heap provid slightli elabor servic garbag collect exist complex runtim environ provid complet reason engin logic program declar program languag prolog object agent relationship exist respect program model conceptu abstract requir implement higher level abstract divid implement theoret concept implement entiti implement manipul basic entiti runtim object static repres object architectur architectur simpl current state object relat object class determin oper perform object repres arbitrari collect data element function granular object potenti limit effici issu dictat entiti model object realiti conceptu benefit slightli weaken object manag system repres relat inherit defin class object manipul creat destroi object object manag system dynam aspect method select polymorph except handl garbag collect runtim thing distinctli complic similar gener structur basic entiti agent implement agent architectur agent architectur built theori bdi establish link abstract concept provid runtim environ role descript make agent fundament relat agent role architectur agent architectur complex object dynam aspect dealt rich exist larg number agent architectur due vast number imposs identifi gener architectur smallest common denomin basic perceiv reason act cycl orient minim agent model agent perceiv state integr percept knowledg base deriv action execut gener cycl abstract view agent architectur encapsul specif aspect task agent manag system agent base runtim environ provid collect mechan enabl agent contact enabl agent design interact standard basic servic provid agent manag system standard defin program languag level syntact framework manipul entiti runtim level defin program written program languag directli interpret runtim system compil intermedi format understood runtim system directli assembl code syntact construct provid program languag programm underli semant concept effici express intend function program elegantli gener implement conceptu model gener write program easier comfort programm term conceptu framework directli integr conceptu model singl high level program languag problemat difficult find good combin concept overwhelm averag user find syntact concept gener concept attach program languag case object approach work languag lead cobol perl numer languag imper languag enhanc object program system eleg combin program concept context softwar trend clear knowledg wide accept agentori program languag state approach design extens establish jam agent combin concept java design languag design languag abstract program languag aim conceptu model system grain level design languag graphic notat make easier design access system structur design languag unifi model languag integr separ design common hat uml varieti structur element defin semant flexibl combin diagram captur aspect softwar system core uml languag describ softwar system requir specif final design uml context system discuss due gener natur core suit problem extens cover special aspect extend uml provid structur element diagram enhanc express power base languag favor develop extens uml respect concept part fipa standard suggest extens uml complet diagram type call protocol diagram diagram combin element uml interact diagram state diagram model role plai agent interact agent diagram type specif multipl thread interact protocol support protocol nest protocol templat base gener protocol descript gener design languag necessarili constraint model aspect system person count gener softwar architectur framework framework applic area design languag reason view framework provid set structur abstract repres level abstract exampl framework includ java bean mean provid compon flexibl interconnect mechan basic structur softwar develop environ visual focu support develop graphic user interfac structur element design languag graphic element combin grammar regul element put world area larg number framework exist due machin languag structur program program program structur unit program subroutin object agent relat previou level bound unit program subroutin persist local state object independ thread execut initi tabl histor develop program paradigm complex dealt adequ tool support exampl design languag rang framework complex power tool zeu toolkit british telecom mechan put applic histor perspect discuss histor aspect develop program paradigm understand approach natur successor prior develop tabl captur histor develop machin languag program earli dai program monolith block inher structur view subsequ chang recogn program made smaller structur subroutin concept subroutin power control flow aspect program neglect data involv view chang time group data comput singl structur unit call face chang lead passiv object face activ structur unit call present histor develop captur main idea form complet satisfi agent tabl requir independ thread execut sound term fuzzi draw basic idea develop coher suggest shown figur program collect function establish welldefin goal function imper sequenc statement collect mathemat express link set goal achiev goal interpret develop program interpret term data manipul function oper data lead structur program semant relat aspect program spatial relat object agent resourc function data fig histor develop stronger explicit relat data function introduc abstract data eventu lead program final step object augment resourc comput freeli freedom resourc alloc process lead concept find fundament agentori autonomi weak notion agenc identifi autonomi central concept credit autonomi fundament aspect weak notion prerequisit achiev agent free decid argument hold reactiv idea agent autonom agent strike revolutionari lead softwar system system longer collect passiv object object perceiv model design activ entiti view complex system complet tradit approach explicitli accept fact system design system dynam bit design set initi state specifi initi goal autonom agent system thing control ongo interact determin system behavior major advantag view support principl local view specif spread entir program code agentori view introduc tool conceptu group agent defin bound element make agent group common make easier identifi larger unit program belong semant bottom line sober remark basic similar approach tempt conclud cloth technic contribut softwar engin revolutionari conceptu contribut nonetheless huge softwar engin epistemolog framework effect commun reason complex softwar system basi mental qualiti consist set term relat adequ captur complex system support easier natur develop system import clear terminolog abstract data type object argu object essenti thing adt introduc year earlier programm prefer object terminolog framework provid approach programm natur model term real world model softwar system major reason success view programm sort mentalist notion develop system subsequ translat term addit transform drop adequ tool express idea directli terminolog point explain ad autonomi accept properti passiv object main contribut agentori view lead complet model approach stimul system design built desir properti coupl system compon high compon return initi question paper softwar engin program paradigm answer quot webster dictionari main noun late latin greek show side side centuri clear typic conjug show word inflect form philosoph theoret framework scientif school disciplin gener experi perform support formul answer question softwar engin requir built basic properti model understand applic view prerequisit accept artifici intellig ascrib basic qualiti desir ascrib machin goal agent commun broaden accept paradigm peopl develop softwar engin case accept develop quickli technolog year wide accept natur softwar engin disciplin question respect long paradigm state interest answer question provid kuhn theori structur scientif revolut kuhn scientif develop continu sequenc disjoint revolut revolut phase normal scientif activ research current state art current gener background daili work research question draw unsolv problem current paradigm principl solv exist framework time question phenomenon observ answer explain current paradigm anomali requir radic chang gener research paradigm deal newli observ phenomena call revolut paradigm captur past experi sort scientif newton theori mechan newton mechan research framework hundr year observ atom level explain newton theori lead develop quantum mechan explain observ atom level major point kuhn theori research paradigm introduc research establish research paradigm introduc upcom gener young research grow spirit paradigm natur accept gener framework scientif histori full exampl process mention theori quantum mechan darwin theori origin speci specif observ true softwar develop establish research neglect novelti concept readili accept younger gener wide accept program paradigm futur softwar make main contribut access peopl conceptu framework support develop applic refer helmut der volum ii bernhard jorg jame odel agent formal multiag softwar system intern workshop agentori softwar engin held intern confer softwar jacobson unifi model languag user guid addison booch analysi design applic mellish program prolog springer chen softwar engin metric model publish ralph jochen requir specif design system graph uml intern workshop softwar engin held intern confer softwar jame moor darwin reed bill introduct object cobol john wilei fipa fipa specif part version foundat intellig physic agent franc editor unifi model languag number lnc hennessi patterson comput quantit approach morgan kaufmann publish michael huhn program intern workshop softwar engin held intern confer softwar intellig reason system jam agent jung theori hybrid agent phd universitat de elizabeth kendal agent softwar engin role model intern workshop softwar engin held intern confer softwar robert kowalski logic problem solv north thoma kuhn structur scientif revolut univ chicago susan lander issu multiag design system ieee april jurgen lind massiv develop method multiag system intern confer practic applic intellig agent jurgen lind softwar engin multiag system phd john mccarthi ascrib mental qualiti machin martin philosoph aspect artifici intellig harvest scott scott kick sun microsoft corpor visual simon mike michael luck design system agent interact intern workshop softwar engin held intern confer softwar muller control architectur autonom survei anand wayn intellig agent practic number jorg muller agent thing intellig agent proc volum collin build distribut system appli artif intellig jame van dyke bernhard bauer repres agent interact protocol uml intern workshop softwar engin held intern confer softwar omg fipa agent work group tom human cognit program psycholog program academ press parunak keynot confer april program system lab program system rao georgeff bdi theori practic intern confer system page san june stuart russel peter norvig artifici modern approach prentic jung social interact framework system descript user guid system testb technic report dfki program languag sun microsystem java program sun microsystem java alan ture comput applic london mathemat larri randal tom christiansen program perl oreilli associ plea lean softwar ieee wooldridg jen intellig theori practic knowledg engin kinni gaia methodolog analysi design journal autonom agent frank joe
DB/342 3 develop queri languag martin erwig marku schneider informatik iv germani abstract integr data abstract data type exist data model approach creat queri languag import class queri identifi concern develop spatial object queri spatial relationship base definit notion predic provid framework build complex predic start small set elementari predic develop show concept realiz relat data model demonstr sql extend enabl queri develop introduct motiv deep relationship tempor spatial phenomena recent interest design data model open issu relat natur definit predic integr queri languag queri flight forc cross snow incorpor featur tempor chang spatial relationship difficult imposs express pure spatial predic turn tempor queri languag incap answer queri paper give definit notion predic spatial object time relationship show develop spatial relationship time spatial object characterist featur research partial support chorochrono fund eu train mobil research contract erb predic perform integr predic sql show integr profit abstract data type approach integr complex object section briefli review data model give reason select section describ criteria design queri section relat predic earlier work spatial predic data model data model data spatial data model gener spatiotempor object defin complex spatial featur complex tempor featur bitempor element attach compon complex tempor data model gener includ variant gadia tempor model main drawback approach incap model continu spatial object time approach integr view space time basi paper introduc concept data type definit tempor object gener base observ time express function time tempor version object type function time object move point evolv region regard special instanc tempor object spatial data type similar approach base work behavior time sequenc introduc element sequenc geometr behavior describ evolut element sequenc time sequenc tempor object issu intens discuss tempor data model tupl timestamp attribut timestamp data model prefer tupl timestamp model expand schema relat explicit tempor attribut describ lifespan valid period tupl time attribut tupl tupl duplic modifi inform object scatter relat approach model continu spatial object definit oper inappropri ad addit attribut relat attribut timestamp model aim gather inform object singl tupl complex attribut valu complex valu incorpor tempor dimens frequent model function time domain attribut timestamp model similar fit model model encapsul tempor object adt object integr complex valu adt approach advantag import benefit emploi adt express reli attribut timestamp tupl timestamp continu model benefit definit adt valu valid dbm data model queri languag reason adt valu model concept dbm data model depend facilit easi eleg conceptu integr adt valu complex data model queri languag queri languag intent queri languag scratch appropri extend widespread queri languag sql main focu integr develop profit fact underli data model rest adt approach necessit conserv extens sql set basic spatiotempor extens mechan complex predic call extend queri languag queri ad function captur adt object oper benefit approach preserv sql treatment easi incorpor predic user standard sql queri standard data featur inquir situat involv data queri facil sql provid integr predic standard data type integ string understood includ builtin predic complex structur data systemat deriv reason predic model canon collect predic combin spatial data type region predic equal identifi spatial queri languag base predic call spatial sql predic applic point found express queri tempor develop spatial object import featur spatiotempor queri languag predic model develop queri part spatiotempor predic make statement valid behavior object period time definit predic function object argument appropri aggreg boolean valu time axi tempor quantifi singl boolean problem tackl basi model basi work consid topolog transit topolog relationship move point evolv region identifi canon collect evolv region obtain predic larg number practic predic reason employ user perspect solut problem furnish user set predic possibl restrict altern pursu strategi extens model dimens intersect account lead relationship combin region object larg number predic reduc group topolog case overload topolog predic provid boundari oper predic mutual captur topolog relationship number predic larger predic construct exist advoc extens approach provid simpl framework predic integr sql macro mechan similar composit event main differ event occur instant time deal predic time period section present describ underli data model illustr data type oper languag queri exampl section introduc predic underpin import develop spatial relationship section show develop queri basi predic section sketch queri predic evalu section draw extend sql section introduc part design queri languag call sketch underli data model show data type oper queri exampl data model illustr confin relat model sql popular queri languag relat scheme written attribut respect domain relat hold domain standard type string complex type encapsul adt includ set oper predic exampl spatial data type region graph model data abstract data type emploi attribut type relat relat function store attribut data tupl design model spatiotempor data compat smoothli chang object continu model time ir tempor version type time model tempor function type time tempor function basi algebra data model data type assign spatial data type point region point locat time element type call move point element type region move call evolv region tempor version applic move line reason line abstract project movement primari entiti movement consid princip integr move line move point chang number essenti defin oper tempor object interest comput distanc airplan storm achiev distanc oper work tempor object return tempor object result function lift version defin distanc note definit impli lift constant object nontempor type tempor lift applic spatial predic spatial predic insid point region bool lift version predic type point region bool mean yield true time point insid undefin point region case make notat gener denot predic lower case letter tempor counterpart start capit letter spatial oper distanc object type point region comput number type lift version distanc map element type region point real queri introduc oper illustr pose queri flight weather condit relat attribut id identifi rout record rout flight time attribut kind classifi weather event high pressur extent yield evolv extent weather event queri unit airlin flight time select flight id queri show function charact spatiotempor object determin object time simpl function applic gener version queri locat plane select flight id notat specifi rang time time interv object appli time interv collect disjoint time interv separ express yield object restrict time interv trajectori oper comput spatial project object euclidean plane move point yield object type line note isol stationari point occur evolv region trajectori oper return region result project union region valu time euclidean plane queri valu domain spatiotempor plane eiffel select flight intersect oper lift comput intersect move point result move point origin move point met assum describ point coordin eiffel tower lift oper denot appli point nontempor object yield stationari point move point move dom oper collect time intersect defin tempor function comput queri inquir largest snow area time select weather kind queri demonstr aggreg oper max extens aggreg oper sql appli collect evolv region relat column comput evolv region oper base binari function max st appli evolv region yield evolv region max st time max geo definit function max geo appli region return larger max geo altogeth mean evolv region comput evolv region max st max st appli lift oper area comput area time final result obtain tempor real answer queri select weather kind area oper appli snow area return tempor real max oper collect tempor real produc tempor real select largest real valu occur tempor real time introduct tupl timestamp model inflex prefer attribut timestamp approach approach restrict incap model tempor develop continu evolv spatial object queri time flight tempor queri languag attribut obtain express queri continu develop interpol mechan event happen time interv emploi adt formul queri select weather id kind lift intersect oper appli move point evolv region yield part rout ly insid extent min oper comput minimum time valu intersect defin formul queri bit gener time airplan lot combin produc undesir null valu flight hurrican consid intersect restrict predic avoid null valu result relat predic investig advanc flight hurrican contact combin fulfil predic account intersect comput section predic defin queri show necess tempor flight enter problem combin check valid spatial predic seri event period tempor order examin constel plane hurrican disjoint met point final plane insid hurrican develop enter hurrican true subqueri answer affirm tempor occur seri specif match combin select id weather kind insid insid queri complic work comput departur time flight rout object appli yield point extent object appli time yield region spatial predic check point li insid region departur time flight plane hurrican comput arriv time flight appli rout extent time check point li insid rout enter extent object impli met border hurrican limit queri determin plane hurrican met moment plane ran border enter hurrican express queri section predic develop adt approach condit express complet chang syntax section investig structur predic construct compound spatiotempor predic basic eventu lead modular transpar mechan extend provid predic small macro facil predic predic essenti function aggreg valu spatial predic evolv time predic thought lift spatial predic yield tempor aggreg determin tempor boolean true predic function type ib definit section defin predic yield true yield true time definit definit yield point region undefin expect move point shorter lifetim evolv region insid expect yield true distinguish kind quantif result time interv aggreg defin rang case insid expect behavior obtain aggreg rang lifetim move point true spatial predic depend natur individu predic spatiotempor object consid equal equal object object lifespan equal order build gener op op function map set formula built logic connect spatial predic constant express denot spatiotempor denot obtain interpret logic connect usual comput spatial predic predic mean denot spatiotempor predic denot function argument return determin express express denot function argument yield boolean denot yield intersect op defin rang time notat give definit version basic spatial predic definit disjoint meet overlap equal cover insid move point move region basic predic defin chosen aggreg motiv discuss detail specif spatial order defin compound captur chang spatial restrict tempor scope basic spatiotempor predic predic refin sj denot partial function yield undefin definit open close interv spatial situat chang observ relationship observ period time singl time point particip object exist period relationship hold instant time interv predic hold time point interv call instant predic predic hold interv call period predic interest note satisfi instant period predic occur altern object satisfi insid immedi disjoint insid meet disjoint satisfi defin oper elementari combin spatial defin predic time check enforc defin hold true time true time true hold hold definit abbrevi open interv simpli write variabl rang definit easi combin tempor composit order denot develop syntact sugar write cascad composit recal rang arbitrari spatial predic tabl rang instant assum spatial predic deriv abbrevi expand pp pq defin develop object simpli sequenc basic predic defin predic captur scenario point enter cross enter disjoint meet insid cross disjoint meet insid meet disjoint sequenti tempor composit possibl build predic import concept denot altern definit shorter quantif relev predic occur move point border region situat point leav border captur interest initi final part kind predic express part develop defin true requir true instant spatial predic note true unit element respect element true true true true section defin combin definit qr jr definit backward combin enjoi queri develop extend sql set basic spatiotempor predic facil predic reconsid queri find plane ran hurrican predic combin semant tempor composit formul queri select id weather kind rout extent compound predic frequent introduc kind macro definit facil introduc predic syntax basic predic elementari spatiotempor predic defin section notat predic oper combin defin section defin convent bind stronger combin bind stronger predic applic omit bracket predic defin predic enter defin enter formul queri plane enter hurrican simpli select weather kind rout enter extent exampl definit predic cross defin leav defin cross defin bypass note predic cross equal definit section insid gener law express relationship develop predic group interest number plane enter snow storm fog select weather kind kind group rout enter extent demonstr develop evolv region assum relat store inform forest forest fire forest complet destroi fire fact forest destroi mean time complet insid equal fire fire forest exist anymor relationship fire forest fire ignit happen border care predic true wildcard final denot select fire area extent mean period time care relationship forest express constantli yield requir exist time point insid equal hold queri develop move relat record migrat bird bird interest swarm fly rout time final meet express defin select bird bird queri evalu shortli sketch evalu queri complex predic work predic transform develop normal altern occur subpart nest develop move outer level distribut restrict develop altern assum evolv region repres move point repres line assum repres time develop check case evolv region move comput geometr intersect obtain result sequenc inform part topolog insid volum run volum volum crucial point chang topolog interv report topolog relationship hold singl intersect interv deriv interv intersect procedur volum analog left match comput sequenc develop specif amount substr investig intersect algorithm describ subsequ paper base adt approach integr spatiotempor data type data model shown queri object formul standard sql observ queri develop spatial object interest demonstr defin basic compound predic specif develop complex develop queri enabl modest extens ddl part sql refer overview tquel acm tran spatiotempor support legaci applic acm symp appli page cheng gadia pattern match languag acm conf inform knowledg page small set formal topolog relationship suitabl interact int symp advanc spatial lnc page clifford histor relat data model revisit page tuzhilin complet queri languag group histor data model page egenhof spatial queri present languag ieee transact knowledg data egenhof reason gradual topolog relationship int conf gi space theori method reason geograph lnc page egenhof topolog spatial relat int journal geograph inform egenhof mathemat framework definit topolog relationship int symp spatial data page erwig gute explicit graph function model spatial ieee transact knowledg data vazirgianni abstract discret model data type acm symp geograph inform page vazirgianni data approach model queri move object erwig schneider predic technic gute tempor object data model comparison int workshop advanc lnc page gadia tempor parametr data page vazirgianni foundat repres queri move object technic report gute schneider spatial data rose algebra vldb zaniolo composit tempor event activ formal semant clifford recent advanc tempor page springer segev shoshani logic model tempor data page snodgrass tempor orient data model page guttman applic abstract data type abstract indic cad data base conf engin design page guttman type relat system int confer data page snodgrass tempor implement publish worboi unifi model spatial tempor inform comput yeh time geometr dimens model evolut approach int conf integr gi yeh model highli variabl data page
ML/343 6 depart comput scienc arti cial intellig methodolog improv ad hoc linguist rule learn method induc cooper rule herrera technic report de universidad de granada granada spain phone fax methodolog improv ad hoc linguist rule learn method induc cooper rule herrera depart comput scienc arti cial intellig de spain abstract linguist model eld import applic fuzzi famili ecient simpl method guid cover criteria data call hoc literatur year high addit quick easi make suitabl learn task paper perform doubl task analyz kind learn method introduc methodolog signi cantli improv accuraci descript power taxonomi ad hoc learn method base data guid learn made distinguish whilst rule obtain speci exampl rstly group subspac ned fuzzi rule obtain methodolog gener accur simpl linguist model cor methodolog base cooper linguist rule gener process make good interpol reason develop nalli design fuzzi system oper mode gener candid rule set combinatori search rule subset cooper behavior introduc approach analyz solv applic di erent characterist linguist system fuzzi cooper linguist simul anneal introduct import applic fuzzi system system model consid approach model system make descript languag base fuzzi logic fuzzi predic import area linguist model interpret obtain model main requir task develop mean linguist fuzzi rule linguist variabl valu term set linguist model consist set linguist descript behavior system model research support project task perform order design concret applic import dicult obtain knowledg base problem solv kb data base rule base store knowledg problem form linguist rule diculti present human expert express knowledg form fuzzi rule made research develop automat techniqu perform task larg quantiti method automat gener fuzzi rule numer data make complex rule gener mechan neural network genet algorithm fuzzi cluster opposit famili ecient simpl method guid cover criteria data call hoc literatur method base short iter procedur advantag ad hoc method clear simplic make easili understand quick perform learn suitabl rst stage model process obtain preliminari fuzzi subsequ ned method distinguish di erent approach obtain linguist rule ad hoc guid exampl guid fuzzi grid rule obtain speci exampl rstly group subspac ned fuzzi rule obtain high perform ad hoc method problem relat select rule independ approach method rule individu perform kb bad cooper rule obtain due interpol reason develop make result accur desir order face ad hoc methodolog improv rule cooper accuraci obtain cooper rule methodolog obtain set candid rule basic involv perform search set combin rule obtain accuraci rule individu fuzzi input subspac paper organ section ad hoc method introduc gener approach exampl guid fuzzi analyz section show methodolog improv accuraci mean cooper rule section behavior ad hoc method analyz di erent fuzzi model simpl function problem section conclud remark point notat consid paper introduc rst time collect notat consult appendix ad hoc linguist rule learn method ad hoc linguist rule learn method main base work data set fe data set number input number output repres behavior problem solv work system previou de nition db input output primari fuzzi partit obtain expert inform normal process fuzzi partit variabl space perform divid number equal unequ select kind membership assign fuzzi set subspac symmetr fuzzi partit triangular membership function cross height shown figur eb es vb figur graphic uniform fuzzi stand extrem set linguist term input variabl note set linguist term output variabl note number linguist term input variabl number linguist term output variabl learn linguist rule guid cover criteria data set address learn process includ optim search techniqu speci calli develop ad main advantag ad hoc method easili understand implement quick perform learn process suitabl rst stage model process obtain preliminari fuzzi subsequ ned techniqu spite interest drawback obtain model accur desir distinguish di erent approach obtain linguist method guid exampl guid fuzzi grid show speci method subsect relat gener scheme ad hoc method present fourth subsect ad hoc linguist rule learn method guid exampl linguist rule gener process guid data set obtain rule speci rule obtain rule belong candid rule stage select process perform gener nal rb wide ad hoc method wang mendel method method put ect rb gener mean fuzzi partit variabl space gener candid linguist rule set set form rule cover data set structur obtain speci set rule variabl linguist label fuzzi set cover linguist rule gener give import rule import obtain comput cover rule obtain nal rb candid linguist rule group candid linguist rule select rule highest import group ad hoc linguist rule learn method guid fuzzi grid possibl gener linguist rule group exampl fuzzi obtain rule group account fuzzi grid obtain combin input primari fuzzi partit fuzzi input subspac number fuzzi input de ned cartesian product linguist term exist input approach found herrera adapt ishibuchi al learn method simpli ed rule rule singl point gener linguist rule method consist fuzzi partit variabl space fuzzi input build set data pair locat fe data space fb jg set linguist label output variabl term set exampl belong cardin ii linguist label comput cover cv linguist rule built term cv work minimum iii add rule present highest rule valuat rv rb gener rule fuzzi input subspac di erent choic consid rule valuat rv work cover cover absolut cover cover rv je max cover set cover exampl rv je cv combin rv rv rv je max je cv relat method method obtain rule method obtain fuzzi grid gener combin label input variabl fuzzi partit method consid gener process perform method involv contribut gener rule rule method obtain respect cover label highest membership method separ set crisp grid bound cross point label belong subspac fuzzi grid belong subspac figur graphic show fact input variabl figur exampl ly white zone uenc gener ly light grei zone uenc ly dark grei zone uenc rule subspac exampl candid rule set depend approach belong subspac fuzzi partit input variabl fuzzi partit input variabl fuzzi partit input variabl rule rule rule figur method contribut gener method contribut gener belong subspac determin approach approach obtain equal rule fact approach exampl uenc wider gener import lm determin case interpret fact make model obtain method accur desir gener scheme ad hoc linguist rule learn method relat method found previou establish gener scheme ad hoc linguist rule learn method figur show figur gener scheme ad hoc method fuzzi partit variabl space gener candid rule fuzzi input subspac gener approach set linguist fb cs rule di erent subspac select rule consequ fuzzi input subspac respect criterion rewritten detail process shown previou fuzzi partit variabl space gener candid rule subspac obtain rule calcul import group rule combin select rule highest import group fuzzi partit variabl space gener candid rule subspac fuzzi input gener calcul rv select rule highest subspac point intuit combin method candid rule gener process rule select rule valuat rv consid give import rule group obtain select rule altern import consid select rule subspac de ned combin implicitli de ned rv coincid criterion select rule algorithm rv rv determin rule group obtain call methodolog improv accuraci obtain cooper rule interest featur interpol reason develop characterist plai kei role high perform consequ cooper linguist rule kb output obtain due singl linguist rule cooper action linguist rule red match system input oper mode ad hoc bracket data set fuzzi subspac cover obtain rule perform subspac global interact rule kb consid nalli obtain spite present good local cooper suitabl fact local process rule make method sensit aim address methodolog improv accuraci obtain cooper rule cooper rule methodolog base combinatori search cooper rule perform set candid rule rule set cooper select consequ highest perform subspac ad hoc method cor methodolog consid possibl di erent accur kb cooper cor perform combinatori search candid rule set consequ accuraci order perform combinatori explicit approxim search techniqu rst accomplish full search set combin techniqu ensur obtain long simpli term run great number combin techniqu recommend con ned space explicit approxim search techniqu search techniqu main advantag ad hoc method abil good fuzzi model search techniqu ectiv quick simul anneal techniqu easili implement good solut quickli sa numer optim techniqu base analog physic anneal process solid algorithm begin initi solut gener neighbor solut mean suitabl mechan adapt current solut replac gener replac accomplish speci probabl algorithm progress process iter larg number time cor methodolog stage ad hoc method gener scheme sa techniqu algorithm fuzzi partit variabl space gener candid rule subspac select cooper rule subspac stage perform obtain set consequ subspac exampl fr nc number subspac exampl nc set identi cation candid consequ term set element run algorithm combin fb accuraci initi solut obtain gener combin random neighbor gener mechan randomli select speci randomli gener evalu qualiti index measur cooper encod rule set consid algorithm global error function call squar error de ned mse output obtain desir output closer measur greater global perform rule cooper algorithm depend perform exampl contribut gener candid consequ gener subspac search space combinatori search larger fact pro con algorithm access result larger search space dicult good solut gener combin suitabl approach depend problem repres set exampl determin candid consequ set subspac depend approach method simplic quick classic ad hoc complex slow remain rule gener closer quick depend great extent search space tackl studi studi make compar studi ad hoc method approach analyz behavior process chosen di erent fuzzi model function problem rice tast evalu electr distribut network problem analyz accuraci linguist model gener process introduc previou section method tanaka tabl show consid method approach tabl method consid studi method approach guid exampl guid exampl guid exampl guid fuzzi grid guid fuzzi grid guid fuzzi grid guid exampl guid fuzzi grid guid fuzzi grid rule subspac unlik ishibuchi al method obtain linguist model rstly method design fuzzi model base simpli ed rule transform linguist accur aim author introduc secondari addit usual infer system capabl obtain output result combin action linguist rule base rule consid subspac make linguist modi er improv accuraci consid paper aim analyz rule gener process modifi db de nition initi db constitut primari fuzzi partit variabl consid case partit form speci number label equal distribut fuzzi set give mean shown figur scale factor translat gener problem variabl run sa algorithm method xed aspect cool scheme exponenti initi temperatur case equilibrium speci temperatur achiev maximum number neighbor gener maximum number accept attain paramet set case stop algorithm stop maximum number cool accomplish speci temperatur neighbor accept respect reason method select minimum plai role implic conjunct center graviti weight match strategi act cation oper linguist model simpl function rst simpl unimod mathemat function consid model graphic mathemat variabl shown figur figur graphic mathemat variabl function train data set uniformli distribut de nition space obtain set valu gener valu input variabl consid uniformli distribut interv data set gener test set evalu perform learn avoid bia relat data train set size data set ten percent train set data obtain gener input variabl valu random concret comput output variabl problem larg search space paramet sa process set aim explor great number possibl temperatur maximum number neighbor nc maximum number accept result initi temperatur case result obtain method label fuzzi collect tabl stand number mse tra mse valu obtain train test data set result shown boldfac paramet sa cool tabl result obtain model label fuzzi partit method mse tra mse analyz note high perform similar present model obtain method ascrib fact great quantiti exampl uniformli distribut method signi cantli improv accuraci model compar cooper method tabl candid consequ set gener subspac approach attempt select perform select rule subspac make select cooper criterion account global behavior rule di erent consequ local cell shown accuraci obtain model notabl obtain accur model slight di erenc depend size search space tackl sa process observ number di erent candid consequ gener determin number combin search space larger ow fact candid consequ subspac mention section search space bigger tabl model es vb eb es bg mg bg bg mg sg mg bg bg mg sg mg bg mg sg sg mg bg mg mg bg vb bg mg sg mg bg eb bg mg bg candid consequ set subspac approach es vb eb es eb eb es es es es es vb eb eb eb rb obtain es vb eb es eb vb eb es es es es es es es vb eb eb vb eb rb obtain complex obtain good solut case main di erenc method make consequ subspac give certainti factor analyz rule higher global accuraci make rule model obtain accur present simpler kb rule tabl number candid consequ subspac model es vb eb es vb eb combin es vb eb es vb eb combin import aspect lm interpret main requir global cooper rule subspac suitabl directli local rule problem rice tast evalu problem subject quali cation food tast import dicult problem case rice tast quali put ect mean subject evalu call sensori test group evalu rice set characterist factor tough larg quantiti relev problem rice tast analysi lead solv mean model techniqu capabl obtain model repres relationship exist goal obtain accur obtain model capabl put light reason process perform expert evalu kind rice speci due section deal obtain linguist model solv problem order data set present set data arrai collect subject evalu variabl question ve mention evalu kind made expert number kind rice grown japan variabl valu real interv aim randomli obtain ten di erent partit mention piec data train set test gener ten linguist model experi label consid fuzzi partit experi sa paramet consid due small size set small number linguist term consequ fuzzi reduc number combin averag ten data gener rst step combinatori search explicit method sa procedur solut quickli found work search space maximum number neighbor maximum number accept number fuzzi input subspac initi temperatur consid algorithm tabl show result obtain model applic valu shown column mse tra mse comput averag mse valu obtain approxim train test data ten linguist model gener case column stand averag number linguist rule kb ten model gener process paramet sa cool averag view obtain determin obtain accur model observ behavior speci rv depend approach whilst method result obtain sel sh valuat rv method result obtain cooper criterion rv respect complex gener fuzzi model observ method obtain signi cantli rule method due fact approach exampl uenc wider tabl result obtain rice tast evalu label fuzzi partit method mse tra mse gener rule outperform method signi cantli accur model obtain cooper rule gener number rule opposit obtain accur model lesser number signi cantli improv interpret obtain linguist model accuraci analyz method rb present half rule shown previou experi conclud cooper set simpl rule perform cooper set rule electr distribut network problem measur amount electr line electr compani measur aspect estim mainten cost main goal problem present spain high medium voltag line easili low voltag line citi measur kind line convolut compani serv small nuclei indirect method determin length line problem involv nding model relat total length low voltag line instal rural town number inhabit town distanc center town furthest client model estim total length line maintain limit estim length line input mention object relat rst variabl radiu prefer solut obtain verifi numer accur explain speci comput villag interest solut interpret human compar randomli divid piec real data obtain direct measur number villag set label train test prior de ning sa paramet consid account search space tackl sa algorithm perform combinatori search space perform combin consid paramet de ned accord fact avoid wast comput time high explor initi temperatur maximum number neighbor accept number fuzzi input subspac exampl process risk fall local optimum due special featur problem face high initi temperatur consid maximum number neighbor maximum number accept temperatur number fuzzi input subspac result obtain consid lm method label fuzzi partit collect tabl paramet sa cool tabl result obtain electr applic label fuzzi partit method mse tra mse analysi model gener method present applic fact problem case spuriou point dealt method gener rule dicult rule nalli select rb point contribut gener rule distort averag criteria rv rv avoid excess domain perform criterion rv cover consid due method averag robust face obtain accur model note good behavior present method linguist model accur model obtain accur analyz method di erenc accuraci found relat search space tackl sa process fact accomplish search obtain perform model interest point cooper linguist rule lessen ect observ cooper opposit method newli obtain model perform accuraci interpret lesser number perform model obtain obtain process obtain lesser number rule exchang lose bit signi cantli improv interpret conclud remark paper perform doubl task analyz featur ad hoc rb learn method introduc methodolog signi cantli improv behavior taxonomi ad hoc learn method base data guid learn made distinguish di erent gener scheme includ show gener perform learn present point combin approach easili obtain hybrid method methodolog gener accur simpl linguist model cor methodolog base cooper linguist rule gener process make good interpol reason develop nalli design oper mode gener candid rule set combinatori search rule set cooper speci method guid exampl fuzzi grid present behavior analyz includ compar solv di erent problem view obtain point interest cooper approach obtain model similar accuraci gener lesser number rule method accur desir due reduc number rule method suitabl problem cooper obtain good result combin accuraci interpret lead conclud cooper rule improv perform linguist model deriv kb rstly gener candid rule set search combin rule good accomplish aspect cooper rule robust appendix notat notat mean number input variabl input variabl set linguist term input variabl set linguist term output variabl term counter output set data pair number input variabl output variabl vector fuzzi set cover fuzzi set cover rule obtain number fuzzi input subspac linguist term subspac input fuzzi input set data pair locat subspac fe locat subspac set linguist label output variabl term set exampl belong fb number candid consequ fuzzi set subspac candid consequ fuzzi set counter subspac candid consequ fuzzi set subspac rule subspac consequ nc number fuzzi input subspac nc fe counter candid consequ set nc identi cation candid consequ set cardin set membership linguist label fuzzi cv cover rule cv refer fuzzi model applic biolog engin system tc evolv fuzzi rule base control genet fuzzi set system sl fuzzi model identi cation base cluster journal intellig fuzzi system evolutionari process learn descript approxim fuzzi logic control knowledg base intern journal approxim reason evolutionari process design fuzzi ieee tran cybernet part cybernet improv accuraci linguist ieee transact fuzzi system applic fuzzi oper design fuzzi logic fuzzi set system solv electr distribut problem hybrid evolutionari data analysi appli intellig empir studi learn fuzzi system rice tast fuzzi set system fuzzi infer ieee transact cybernet system function fuzzi set system simpl power heurist method gener fuzzi rule numer fuzzi set system pedrycz fuzzi paradigm practic academ studi rural urban low voltag technic del research develop ieee transact evolutionari comput approach qualit ieee transact fuzzi system fuzzi logic synthesi genet intern confer genet pp van simul theori applic lx jm gener fuzzi rule learn ieee transact cybernet rr dp approxim cluster mountain ieee transact cybernet la concept linguist variabl applic approxim part inform scienc part inform scienc part inform scienc
ML/344 6 aaai nation confer artifici obstacl detect monocular color vision abstract paper present obstacl detect method mobil robot individu imag pixel classifi belong obstacl ground base color method singl passiv color perform binari obstacl imag high resolut system easili train simpli drive robot environ adapt system learn ground oper system test successfulli varieti indoor outdoor introduct obstacl detect import task mobil robot applic mobil robot reli rang data obstacl detect popular sensor obstacl detect system includ ultrason laser stereo optic depth focu sensor measur distanc obstacl inher suit task obstacl detect obstacl avoid sensor perfect ultrason sensor cheap suffer specular reflect poor angular resolut laser radar provid resolut complex depth vision system requir textur environ perform properli stereo vision optic flow addit individu obstacl detect system difficulti detect small flat object ground reliabl detect object requir high measur accuraci calibr rang sensor unabl distinguish type ground surfac problem rang sensor unabl differenti sidewalk adjac flat area small object type ground difficult detect rang case easili detect color vision copyright american associ artifici intellig reserv ulrich nourbakhsh robot carnegi mellon forb pa develop obstacl detect system base passiv monocular color vision heart algorithm consist detect pixel ground classifi obstacl algorithm perform obstacl oper varieti environ algorithm easi train fundament differ obstacl detect system obstacl criterion obstacl object minimum distanc ground obstacl object differ ground relat work extens bodi work exist obstacl work obstacl detect autonom mobil simpl form obstacl detect oper floor obstacl easili detect appli edg detector input imag environ artifici obstacl surfac uniformli coat carefulli select color floor carefulli set elimin shadow horswil similar method mobil robot oper real environ task give simpl tour floor mit ai carpet floor obstacl detect appli edg detector input subsampl pixel smooth filter obstacl detect system perform long background textur constraint floor textur environ uniformli illumin posit boundari shadow neg weak boundari floor obstacl turk develop algorithm color edg detect obstacl road minim textur similar simpl motion algorithm detect obstacl subtract consecut color imag ground substanti method suffer similar problem system base edg detect algorithm requir robot obstacl motion system fail ground stereo vision optic flow system requir textur work properli overview system develop eleg method base registr ground consecut view leav object extend ground unregist subtract refer imag warp determin object explicitli recov structur view scene registr step method requir ground textur extend work domain textur grimson accomplish system color inform addit edg inform kei assumpt algorithm obstacl front robot ten bottom row input imag refer area obstacl detect rest imag compar histogram small window area refer area refer area make system adapt approach requir refer area free obstacl minim risk violat refer area deep shallow refer area suffici repres pixel higher observ angl problem occur higher imag method perform imag resolut pixel similar obstacl detect algorithm color inform wide varieti environ unlik system pure method permit deeper refer area learn ground observ learn data easili store system histogram refer area ahead constraint refer area free obstacl method binari obstacl imag high resolut obstacl detect obstacl detect system pure base individu pixel pixel differ ground classifi obstacl method base assumpt reason varieti indoor outdoor obstacl differ ground ground flat obstacl assumpt distinguish obstacl assumpt estim distanc detect obstacl camera classif pixel repres obstacl ground base number local visual textur import select attribut provid inform rich system perform reliabl varieti environ select attribut requir comput time perform achiev dedic hardwar higher obstacl detect updat faster mobil robot travel safe satisfi decid color inform primari cue color appeal work color vision mobil robot color inform intens compar color local attribut calcul faster system sole reli edg inform environ environ system difficulti differenti shadow obstacl system import estim distanc camera pixel classifi obstacl monocular common approach distanc estim assum ground flat obstacl assumpt distanc monoton function pixel height imag estim distanc correct obstacl higher obstacl part distanc overestim simplest approach deal problem consist obstacl pixel lowest column imag sophist approach consist group obstacl pixel assign shortest distanc entir group basic approach basic approach explain simplifi version method figur show color input imag refer area depth left output simplifi version remaind section describ detail simplifi version unlik full version simplifi version memori input imag function simplifi version full version detail section simplifi version obstacl detect method consist filter color input imag transform color space histogram refer area comparison refer histogram color input imag filter gaussian filter reduc level filter rgb valu transform color space color inform noisi low assign valid valu hue satur intens minimum hue meaningless low hue assign valid satur minimum appeal attribut model separ color inform intens color compon hue satur band sensit illumin intens band trapezoid area front mobil robot refer valid hue intens valu pixel insid trapezoid refer area histogram hue intens histogram filter simpl averag filter histogram suit natur repres distribut histogram requir memori comput time fourth pixel filter input imag compar hue intens histogram pixel classifi obstacl condit hue histogram bin hue hue threshold intens histogram bin intens intens threshold condit pixel classifi belong ground current hue intens threshold set figur input color imag trapezoid refer area binari obstacl output imag pixel hue threshold chosen smaller intens threshold pixel assign valid hue shown figur simplifi version algorithm perform independ depth refer method detect lower part left corridor trash door shoe pant person stand meter ahead algorithm detect cabl ly difficult detect sensor imag demonstr deeper refer repres area rest imag case shallow refer area top method incorrectli classifi highlight obstacl close robot implement previou shown refer area front mobil robot detect obstacl rest imag approach work correctli obstacl present insid trapezoid refer area assum area immedi front robot free forc refer area shallow depth reduc risk violat constraint demonstr figur shallow refer area suffici repres order deeper refer avoid strong assumpt area immedi ahead robot free obstacl assum ground area mobil robot travel free obstacl current refer area meter deep mobil robot travel straight assum refer area captur meter ago free obstacl robot turn substanti amount short longer safe assum captur refer area free obstacl softwar implement algorithm candid queue refer queue acquir hue intens histogram refer area comput step section histogram current odometri inform store candid queue sampl current odometri inform compar odometri inform item candid queue item orient differ current orient elimin candid queue item posit differ current posit move candid queue refer queue histogram refer queue combin simpl result combin hue histogram combin intens histogram pixel current imag compar combin hue combin intens histogram fourth step section train simpli lead robot avoid obstacl manual easili train mobil robot environ train result consist final combin hue combin intens easili store usag requir memori histogram detect obstacl fourth step section oper mode implement oper assist regular obstacl detect system reli combin histogram learn train work indoor environ static output posit light condit train adapt system capabl adapt illumin unlik regular adapt version learn oper adapt version set combin static set dynam set static set simpli consist combin histogram learn regular manual train dynam set updat oper section robot manual train set combin function add learn item refer elimin item approach correspond algorithm forget learn item adapt chose limit forget item learn long distanc ago elimin item dynam refer queue current dynam refer queue retain ten recent item assist mode suit applic assist devic mode dynam set simpli drive robot straight ahead meter short refer queue quickli fill valid histogram obstacl detect modul detect ground obstacl avoid modul control free user task obstacl avoid robot arriv robot stop surfac incorrectli classifi obstacl user manual overrid obstacl avoid modul drive robot meter forward surfac short user adapt obstacl detect system learn surfac detect ground obstacl avoid modul result implement algorithm electr product ad encod obtain odometri inform vision softwar run laptop comput pentium ii processor clock mhz laptop connect microcontrol serial link imag acquir color ccd equip len camera connect laptop entir system shown figur figur platform figur show exampl obstacl detect algorithm left imag show origin color input imag show binari output imag import note addit imag process blob filter appli output imag color version addit imag indoor carnegi museum natur histori pittsburgh figur show result obtain ground perfectli segment object ten meter ahead figur includ move person input imag part shoe classifi pixel correctli classifi reliabl obstacl detect person lean left wall classifi obstacl figur thin pillar detect shadow correctli system incorrectli classifi shadow cast adjac room left obstacl figur light condit outdoor light illumin larg part floor yellow window algorithm perform correctli label pixel floor figur show algorithm fail detect obstacl color yellow leg center similar floor algorithm troubl detect lower part left made materi floor darker pixel bottom wall leg detect correctli due high resolut imag imag outdoor sidewalk figur side bush detect obstacl larg shadow perfectli figur border paint yellow algorithm reliabl detect grass left side yellow mark side yellow mark sidewalk border detect desir case argument yellow mark recogn easili camera current hardwar softwar execut time process imag pixel ms import note effort spent optim execut speed code faster execut speed achiev subsampl input imag possibl appli algorithm region lower portion imag bottom half correspond current system achiev updat rate similar fast sonar system vision system inform higher resolut sonar figur result test perform obstacl detect implement simpl reflex obstacl avoid algorithm electr algorithm similar robot column drive robot meter assist oper obstacl detect output easili follow sidewalk avoid obstacl research group robot institut successfulli combin method stereo vision provid obstacl detect terrain vehicl al evalu system work long assumpt environ state section violat experienc case obstacl violat assumpt similar ground figur show case includ addit visual clue rate neg lower number experienc problem assumpt ground robot intend oper rough terrain small inclin sidewalk introduc small error distanc estim problem error small obstacl close robot system overestim distanc violat assumpt distanc estim error easili lead pixel correctli classifi obstacl obstacl tabletop common effect import note tabletop present problem mobil robot equip tabletop field view simplest detect tabletop combin system sensor ad ultrason sensor detect tabletop make system reliabl offic environ improv current algorithm improv wai interest investig color space perform applic exampl color space normal oppon color final system easili combin band color space approach band combin histogram hue satur textur measur implement larg environ kind prefer set learn histogram type surfac combin obstacl detect method local method benefit histogram set recent develop topolog local method candid place recognit modul reli heavili ground nourbakhsh improv consist enlarg field view len panoram camera system unclear time consequ result reduc resolut approach consist combin current sensor system sensor system combin appeal due complementari natur system paper present method obstacl detect singl color camera method perform realtim binari obstacl imag high resolut system easili train perform varieti indoor outdoor refer hr sensor mobil theori applic massachusett visual avoid segment intern confer intellig robot obstacl avoid unstructur environ intern confer intellig robot sc visual detect obstacl assum local planar ground technic nj robot technic note sri intern dynam distribut reconnaiss surveil terrain intern confer field servic color road segment video obstacl spie mobil vol place recognit topolog local ieee intern confer robot press
DB/345 3 model extens oodbm advanc applic domain andrea norri institut inform system eth switzerland abstract show model extens data manag system achiev combin highlevel core object data model architectur design model extens mind result gener data manag system framework develop advanc applic system aspect core model queri languag constraint easili manag spatial version data show framework extend core system tempor manag system introduct extens consid pure architectur issu manag system form dbm tailor specif applic domain geograph inform system comput aid design system singl dbm hope satisfi requir applic idea extens dbm emerg number extens system includ kernel toolkit gener system emphasi provid architectur support term engin dbm exist framework servic storag transact access method queri call architectur extens idea evolv engin task construct advanc dbm base system task discuss gener requir system form model extens type oper introduc dbm meet intern confer advanc inform system engin june specif applic aim model extens aspect data model queri languag constraint ensur upward compat core languag mode work remain essenti tempor system enabl tempor semant oper constraint core model queri unaffect tempor queri form queri prefix requir tempor semant requir dbm handl spatial version multimedia data combin framework object data manag system design model extens mind system base om model clear separ model orthogon design gener model express properti requir core model extens system develop architectur exploit current softwar engin principl applic framework design pattern ensur benefit reusabl extens fulli exploit describ architectur system extens exploit implement tempor manag system minim effort begin sect discuss gener requir system true model extens includ discuss requir core model descript core model om section present gener descript system demonstr process model describ develop tempor sect conclud summari outlin futur work sect architectur reusabl part dbm modern dbm support varieti task requir dbm manag persist mean data exist longer task run applic program data structur defin describ store data uniform sophist access method index provid effici data access languag oper support modif retriev data dbm provid mean techniqu data retriev transact manag concurr control multipl user access data avoid problem evolv modern dbm support concept provid data recoveri system crash secur implement extens data model dbm support task user extend model system function dbm support featur list relat dbm support singl data structur relat function dbm support extens data structur type constructor list extens function possibl store method difficult effici effect support applic domain base data model manag tempor spatial data version system limit relat data model respect data structur function make build addit construct applic implement dbm respect extend system support advanc applic domain investig approach area tempor major drawback dbm special semant tempor semant queri result retriev updat oper turn complic error prone specif integr constraint support implement method idea extens step dbm base extens data model featur queri effici access transact crash recoveri support form data algebra oper queri languag integr constraint special semant system upward compat basic data oper constraint form underli data data concept manner work section discuss detail approach introduc architectur support method achiev advanc data model approach data model consid consist part data structur oper data retriev updat op integr constraint introduc tempor data model contrast tempor data model enhanc part nontempor data model support manag tempor data figur show part data model tempor data model extend data model add special timestamp attribut store tempor data add special oper queri tempor data extend data structur suppli special tempor algebra consid part data model support tempor object tempor algebra oper tempor constraint result tempor object model independ type system orthogon model includ collect constraint timestamp data structur algebra constraint data algebra constraint algebra constraint algebra fig part data model dbm provid languag data structur integr constraint applic data definit updat oper data manipul queri queri languag consist sublanguag order dbm gener task queri effici access transact crash recoveri suppli data algebra oper integr notion object algebra integr constraint languag support extend architectur depict fig core system support basic task queri effici access transact crash object algebra constraint extend support advanc applic tempor notion object identifi tempor object identifi uniqu refer lifespan denot object respect real world queri tempor data store form tempor algebra oper overridden algebra oper desir form tempor semant integr constraint replac tempor integr constraint core system oid algebra constraint ql ddl dml tempor oid tempor algebra tempor constraint fig form extens dbm approach support data model support manag spatial data version spatial extend notion object identifi spatial mean posit object space cover attach object identifi algebra oper integr constraint replac oper constraint deal semant version number attach object identifi oper integr constraint deal version object ad system requir model extens introduc deal object algebra oper integr constraint refer object argu advanc applic domain manag spatial version data support extens dbm support abstract data type method written support queri constraint deal special semant applic domain approach base simpli type system dbm disadvantag approach special semant queri specif queri integr constraint core model advanc model similar approach base object deal instanc type add addit attribut special semant deal object inher special closer reveal properti valu advoc approach special semant advanc data model tempor data model account treat tempor properti bit attribut idea extens data model support rich set algebra oper constraint work collect object subsect discuss requir model extens detail introduc data model support approach separ type classif distinguish classifi entiti categori gener concept applic domain describ entiti term type classifi person student tenni player student tenni player person student classifi studi engin mathemat depict left hand side fig repres person employ number student student number tenni player rank member club type hierarchi depict hand side fig person student engin math string date integ integ integ string integ fig distinguish type classif person classifi student tenni player simultan person plai role tenni player time order support model data model object type simultan person object dress type data model support role model object consid instanc singl type subsect introduc data model separ type classif support role model om model figur show simpl schema notat provid om model model collect person address relat associ cardin constraint person address relat person collect person student integr constraint cover demand person classifi collect student cover collect person shade region box denot member type collect collect member type mean object collect person dress type person person student person student address address cover fig schema om model data structur om model support collect object associ collect object object dress member type collect object object collect collect figur show role model support om model object classifi collect collect collect depend collect view object collect show attribut valu employ number salari defin type view object collect show attribut valu type oid john john fig view object role associ object collect relat associ binari collect pair object identifi object identifi refer object sourc collect refer object target collect associ object object identifi algebra oper model om base gener collect algebra list oper support om tabl algebra includ oper cross map reduc special oper binari collect closur tabl algebra oper support om model algebra oper signatur union intersect differ cross product flatten flatten select oe type map map reduc reduc type domain domain rang rang inv ffi closur closur algebra oper input argument result type collect list binari object form oid oid refer object type type oid object type set notion common supertyp greatest common subtyp determin member type result collect union collect return collect type common supertyp collect involv result collect element belong argument collect intersect return collect type greatest common subtyp collect involv object member argument collect type result collect differ collect correspond type argument oper result collect object argument collect member cross product collect return binari collect type combin object collect object select oper argument collect function select object collect result subset argument collect map oper appli function signatur type object argument collect return collect object type type flatten oper collect collect member type flatten collect type type reduc oper execut aggreg function collect valu argument collect aggreg function aggreg function signatur type initi type type om model support special oper binari collect list part tabl domain oper binari collect form collect object element pair object oid belong binari rang oper return collect element pair oper swap element pair argument binari collect return binari collect composit oper combin binari object argument collect object binari object oid object binari oid result collect binari oid closur binari collect reflex transit closur relationship repres binari collect intersect differ cross closur simpli manipul object identifi except map reduc oper select access attribut valu object select desir constraint om model support constraint intersect cardin constraint subcollect constraint demand object collect member cover intersect constraint collect restrict form relationship subcollect disjoint constraint demand set subcollect share singl object common cover constraint demand object subcollect involv constraint intersect constraint relat subcollect common object member subcollect cardin constraint restrict object associ constraint evalu simpli manipul object identifi constraint object model system consid manag framework java environ support om gener data model present sect exist instanti om model environ main core system extens form sect serv manag system applic framework server compon environ develop om model design applic domain framework implement applic map result design model implement manag instanc java class easi major redesign exist class hierarchi figur show scenario client applic connect server client applic server abstract interfac client applic objectstor fig system note fig applic framework part client storag manag compon server exchang mean storag manag system exist manag system persist java system objectstor java describ concept system import understand basic idea framework made facilit system extens core architectur system divid main configur compon configur compon consist part system exchang ffl object identifi manag ffl algebra oper ffl constraint ffl queri languag ffl data definit languag ffl data manipul languag ffl data structur data access algorithm core system core system manag data structur support om model descript structur sect special design pattern connect core system compon featur system applic program interfac storag manag compon storag manag compon persist transact concurr recoveri secur includ access control authent compon design connect manag task pass system basic concept support core object model om notion om collect constraint om object object om model repres entiti java object instanc java class om object uniqu object ident lifetim differ object refer handl java refer object java uniqu long object load java virtual machin store java object file read back file read file mean java virtual machin creat java object refer decid object store retriev solv introduc special class instanc class repres uniqu persist object identifi relat om object depend context object access access object specif object role impli type om object support java environ chang type definit java class instanc shown fig solv problem split om object java class java interfac meta inform om object system defin instanc java class object id om object om type om instanc fig om object approach implement dynam type system system standard java class approach suitabl java class involv meta inform defin schema sect type person type defin java class extend class function system meta inform implement interfac adapt class adapt wrapper interfac class interfac client expect class work incompat class make java class modif class definit packag import public class person extend public string collect om object classifi criteria insert collect remov object collect insert simpli role om object store collect gain automat member type collect collect om object classifi insert collect rich set algebra oper collect sect kind collect bag sequenc provid system constraint structur constraint disjoint intersect collect cardin constraint global constraint check commit time transact local relat singl om object constraint object collect type defin local constraint check time collect updat local constraint fact trigger trigger relat om object activ trigger condit hold note global trigger local constraint treat om object design issu full advantag concept import design pattern pattern describ problem occur describ core solut solut million time design pattern qualiti softwar make build system flexibl support requir implement design pattern achiev extens abstract factori main construct system configur abstract factori defin set abstract paramet applic core system paramet includ algebra oper object identifi queri languag data definit languag parser data structur hashtabl abstract class abstract class defin common interfac subclass defer implement subclass abstract class forc develop subclass implement import method system function data structur store element collect insert element depend collect bag sequenc abstract class defin method insert common interfac insert object abstract public class abstract public void object strategi strategi design pattern defin famili algorithm encapsul algorithm strategi interchang independ specif client object algorithm insert object collect defin insert strategi make vari insert algorithm depend collect bag sequenc public class extend public void object public class extend public void object bridg bridg design pattern decoupl abstract implement vari bridg separ algebra oper underli data structur collect object exchang data structur algebra modifi interfac collect object impli collect object bridg illustr bridg class find object attribut equal smith algebra oper result invok method select object call method algebra object method perform select insert match object result collect invok insert method collect method redirect insert call insert method object invok method insert object public class extend protect algebra decoupl algebra protect decoupl data structur protect public object return public public class implement algebra public string object result perform select oper collect insert match object collect return public class public void link core system configur compon core system connect configur compon instanc java class factori shown fig factori class correspond design pattern factori import concept make system extens factori class method method return instanc class repres uniqu object return instanc algebra evalu algebra oper collect part configur compon obtain call method factori instanc paramet core system subclass class factori overrid method provid core data structur object identifi configur compon core system factori fig link core system configur compon extend featur mean fact replac part configur compon sect list summari main task involv implement extens extend syntax data definit data manipul languag queri chang implement featur subclass standard parser subclass standard object identifi class implement algebra oper subclass algebra class extend constraint class defin subclass class factori link core system configur compon section describ detail extend support tempor object data model tom tempor object data model tom tom base gener object data model om exhibit featur found tempor gener form timestamp data collect object associ tempor relationship object consid object model metadata type specif lifespan instanc construct tom base object identifi extend timestamp timestamp tempor element set time close lower bound open upper bound tom support tempor complet queri tempor constraint tempor complet mean oper found data model gener tempor neglect set differ oper tempor comparison predic support express tempor constraint counterpart tempor semant constraint longer hold singl set state constraint lifespan languag extens section describ extens made syntax languag dml mean build inform system base schema fig sake model collect student defin schema schema data definit languag person link type person java class student type person lifespan type subtyp person lifespan type student subtyp person lifespan collect person set person lifespan collect set lifespan collect student set student lifespan subcollect person lifespan student subcollect person lifespan categori object defin collect constraint object lifespan tom period time object set lifespan paramet support notion extend syntax definit lifespan interv interv interv date date date month dai hour minut parser adapt syntax parser system part compon core core system class syntax parser chang achiev replac exist parser extend minor extend exist parser design standard parser invok special method syntax analysi parser collect constraint definit type method call case standard method return perform action support lifespan syntax extend java class method creat object possibl creat object insert collect import file data term data manipul languag creat object paul lifespan dress object paul valu dress object paul valu salari dress object paul valu insert object paul collect person creat object statement defin om object alia paul lifespan set lifespan paramet lifespan dress object statement instanc java class demo object associ valid paramet rememb om object refer instanc java class shown fig insert statement state object paul member collect person time period paramet note collect person creat load schema support lifespan featur extend dml parser approach case extend dml parser make subclass class method queri queri queri languag languag origin develop power languag oper collect associ simpl object classifi student express union case tom queri keyword valid valid union valid keyword denot queri evalu object valid result queri present form list item system dynam gener window show properti select object figur object case ddl extend java class case support tempor queri fig person object made configur compon outlin made configur compon support tom tabl overview class extend instanc class obtain call method factori note term factori text placehold instanc class class subclass class factori overrid method support semant tom tabl java class extend factori method class class algebra object identifi schema definit file core system invok method factori retriev instanc call parser method schema gener object case parser manag tempor inform lifespan made subclass method tempor inform process sect schema sect parser creat java instanc type instanc collect instanc subcollect constraint parser case instanc call factori method class subclass extend store lifespan inform parser set lifespan object identifi schema object creation creat object import file data defin data manipul languag statement sect core system call factori method return instanc class factori return subclass method manag tempor inform lifespan method parser invok core system creat object parser creat alia associ instanc lifespan set parser creat instanc java class set valu instanc field call method instanc parser relat instanc object paul call method insert instanc instanc list object paul data structur instanc obtain factori method creat om manag om instanc relat object method int support extend class overrid method valid relationship object paul instanc paramet paramet store parser instanc call method class note paramet type object make store kind inform om instanc object collect algebra oper collect repres instanc java class load schema definit file parser creat object invok constructor class constructor call factori method return instanc class manag member case instanc class provid algebra oper data structur algebra return factori part class belong core algebra chang class insert object collect import data file dml parser object paul insert collect person featur specifi time period paul member person support featur class method store addit inform member object valid paramet inform algebra class retriev call collect method class manag inform paramet type store inform restrict specif semant tempor inform insert object paul person dml parser invok method collect insert object set valid paramet call collect method evalu algebra oper simpli mean call method collect object parser evalu tempor queri union invok method collect method union input collect object union oper algebra paramet case keyword valid method call method algebra instanc collect object creat class subclass handl algebra paramet note paramet type constraint global trigger local defin sect treat om object uniqu object identifi case tom instanc global constraint subcollect constraint subcollect person lifespan creat parser load schema definit file parser invok factori method case instanc lifespan paramet denot time period constraint valid class subclass method overridden support tempor semant trigger local constraint creat time object belong present gener approach extend manag system term model extens gener dbm architectur approach build idea architectur provid architectur support term servic storag differ term focuss core data model system advanc applic domain system develop support model proof extend support tempor object data model tom convinc model extens approach lead manag system easili adapt applic domain investig extend system spatial data model version model intend provid implement platform document manag system develop refer formal tempor objectori data model advanc page snodgrass evalu complet clifford recent advanc tempor page ds ty te wise implement concept extens data model data languag acm septemb exodu extens dbm overview zdonik read system dj rh ac klug design implement wisconsin storag system softwar practic framework object match feder implement journal intellig cooper inform elmasri navath fundament system benjamin publish gadia model tempor intern confer data page geppert dittrich construct manag engin acm sigmod vlissid design element reusabl softwar lm gh pf mj shekita starburst dust clear ieee tran knowledg data saak und intern thomson realiz tempor data model sigmod confer page stock data model tool gener system proc intl workshop objectori system om model framework java environ master depart comput eth norri extend approach data manag system intern confer er norri distinguish type classif object data model inform model knowledg volum chapter proc seminar inform knowledg june norri om data manag system technic institut inform eth master depart comput eth rose segev tempor data model tempor constraint intern confer er segev support statist oper extens case studi proc ieee seventh intern work confer scientif statist sep steiner norri tempor extens gener object data model technic report institut inform eth steiner norri implement tempor objectori system system advanc applic steiner norri tempor object role model confer advanc inform system engin dayal uniform model tempor version tempor chapter page publish compil construct articl process macro packag llnc style
DB/346 3 holist process perform analysi perform data peter depart informat thoma depart informat abstract beat list institut softwar technolog vienna technolog paper describ perform data facilit busi process improv base holist perform measur feasibl studi show manag analysi perform data facilit data approach argu shortcom tradit measur system overcom perform data approach introduct order gain competit advantag compani reengin process decad develop initi hammer author argu competit compani depend larg qualiti busi process gain suffici reengin busi process essenti newli design busi process continu improv concern state kei measur control control manag manag improv number author critic tradit perform measur argu perform measur innov custom satisfact integr part regular manag popular figur consequ indic perform empir carri identifi main shortcom current perform measur perform measur strongli perform indic holist perform measur suggest place busi process measur systemat compani launch busi process reengin project neglect process perform measur measur place depart busi unit process level perform data time lag compani data extract system unusu manual data handl low procedur perform report late access perform data complic underli reason relev data function perform data store format decentr data manag lead inconsist data overcom suggest implement system store manag data includ data type system call perform measur seventh america confer inform system data manag support system conceptu aspect discuss research question paper requir pm meet implement gener requir perform measur system main object pm provid time inform perform busi inform commun goal current perform busi process directli process improv resourc alloc process output term quantiti give earli warn make diagnosi weak decid correct action assess impact action achiev goal data store central access categori process shown fig data collect sourc oper inform system iss human resourc product plan control iss support sale distribut result market includ oper system analyt system pm meet requir system capabl track perform indic hr user introduc perform indic assess compani framework broad custom set perform indic requir order perform extern indic turn mean web server extern data print report queri queri pm gather data sourc data collect store media relat data analyz long period time perform data store pm access level staff figur perform central point refer process owner gener manag lower barrier system equip easi data select free choic data aggreg select attribut compar secur featur control access defin check peopl data pm level current perform target valu perform indic definit target valu power measur tool enhanc usabl pm support autom dissemin result pm support distribut perform result intranet make alert select peopl perform indic fall lower limit personnel personnel data data sale sale data data click click stream stream data data market market research research data data specif requir perform measur section data requir pm built compani shown requir transform run system build pm build work suggest start organiz goal analysi includ definit identif busi descript busi process goal inform deriv perform indic compani pm built seventh america confer inform system gener descript compani perform analysi perform compani belong electron machineri divid busi plant construct good manufactur style major good util element unit larger automot engin number order carri year goal compani achiev market reduc cycl lower stock raw materi turnov custom satisfact main busi process compani busi process analyz improv pm sale process servic process sale process includ invoic activ includ negoti deliveri date term payment activ good order deliv custom deliveri note produc activ includ creation forward enter system servic process consist servic dispatch order servic repair faulti equip servic order telephon fax servic process carri time year number personnel engag process goal busi process inform compani goal fig goal sale process order achiev goal cost carri request servic repair faulti low profit high subscript price servic order carri subscript individu bill except rule low cost low materi turn support modern equip fig show move inform involv role optim travel low salari low cost high product qualiti train servic staff variabl move high profit low materi consumpt high subscript price servic qualiti modern equip staff motiv pm creat categori gener manag head busi process figur goal network servic process process particip refer process gener manag interest custom aspect turnov busi custom satisfact busi unit process process owner analyz cycl custom satisfact process process particip cycl time custom satisfact process work technic requir technic perform data store wide sql user access perform data run perform support web browser seventh america confer inform system data manag support manag perform data structur data continu improv busi process user custom servic servic reduct satisfact fig repres relev dimens question determin robust architectur meet requir mention option access manag relev data oper system maintain separ suggest fig solut consid data transact system store user order analyz busi support time unsatisfactori complex process prepar data data sourc account complex rise possibl al list al maintain separ consist definit data suggest inmon data subject collect data support design perform data semant data model data creat relat relat model support storag data minim model gener data model optim futur user demand project present chose structur seventh america confer inform system time process process custom satisfact custom custom figur structur indic construct semant data model data research develop number concept root classic model proposit base concept notat suggest ibm examin approach decid appli adapt design analyt process approach reason lead cf adapt project successfulli approach accept peopl involv project power express adapt posit aspect adapt recogn omit clear separ semant logic design perform relev anticip power express mention requir major learn effort data design basic element adapt fig measur indic repres kind measur dimens fig show part process perform data model compani previou section center cube custom satisfact turnov shown cube measur cycl time cube durat measur dimens custom satisfact consist singl percept perform measur calcul formula cube attach relat dimens cube turnov dimens process time shown process dimens hierarchi built instanc process hierarchi busi unit hierarchi aggreg path shown instanc process busi start bottom element arrow point higher aggreg level step conceptu data model implement physic star schema architectur microsoft sql server analysi microsoft measur cycl time process hierarchi custom process time depart hierarchi durat process busi unit hierarchi busi unit process activ perform analysi perform question aspect questionnair question hierarchi questionnair custom satisfact questionnair process time measur expect percept perform perform gap expect percept custom custom categori custom hierarchi custom turnov custom process time time calendar hierarchi year month figur conceptu design process data adapt notat inform satisfi dai measur turnov section data model measur monitor section show cube implement perform measur system design system result requir discuss begin paper shown fig hand relat data manag analysi store measur relat store auxiliari data describ busi busi unit manag goal primari goal organ deriv goal organiz entiti specif measur access perform data auxiliari data goal formul compani process level number aspect order counteract demonstr weak tradit report fig show user interfac pm built aspect develop environ aspect seventh america confer inform system data manag support goal defin process level servic process individu goal kei perform indic indic target actual perform shown actual perform determin queri perform data basi comparison target actual perform gap calcul repres column fig deviat lead user interfac system user defin inform possibl inform person charg principl case major deviat realiz alert handl analysi send email defin condit met case unplan develop perform indic process manag inspect detail directli tradit manag inform user view detail data determin fig possibl navig slice freeli perform data mean restrict defin user access dimens put place seventh america confer inform system access access target valu goal goal tree tree auxiliari data user interfac perform data current current past past perform perform pivot tabl servic analysi server olap cube target valu figur architectur perform figur user friendli interfac offer holist view process figur facil analyz root unsatisfactori perform fig perform analysi perform relat work busi process analysi control receiv attent research industri small number prototyp product implement commerci monitor project process perform measur system implement financ depart larg compani system collect monthli system carri data transform store perform data run system user process access perform data exampl perform indic control payment outstand dimens analyz product mention main shortcom system data sourc holist perform analysi weak limit flexibl queri pisa inform system process analysi tool develop germani pisa evalu audit trail data workflow manag system mq process definit data gener process model tool ari workflow audit trail data import relat store workflow instanc state ari access process analysi odbc current version pisa offer interfac run architectur perform indic analyz tool show averag cycl time process work time process actor shortcom pisa account audit trail data workflow manag system includ data oper perform system flexibl analyz process limit perform tool develop id germani tool collect data modul calcul predefin perform indic aggreg level store relat interfac access main group middl manag execut manag typic perform indic offer cycl particip main drawback tool data sourc product perform indic limit aspect frequenc pro pro tool jointli develop compani img st year ago pro extract data modul inventori sale distribut pro extract raw data comput valu perform indic relat suppli chain tool base ms pivot enabl aggreg level perform indic report includ limit tool packag data sourc limit perform indic limit aspect frequenc seventh america confer inform system data manag support common understand perform measur perspect turn mean perform measur system data perform indic defin basi compani strategi analysi show measur tool type data sourc workflow erp perform indic defin freeli support compani strategi probabl shortcom perform measur tool develop technic busi perspect shown holist process perform analysi requir data oper system workflow system erp system combin multipl data sourc assess process perform achiev approach extract data oper system store perform data success perform data approach offer enhanc analysi featur execut dimens time process busi unit aggreg level analysi restrict offer insight process owner role perform data approach enabl analysi report tool analysi tool ms sql server tool emploi tool facilit creation user lower barrier manag adopt perform measur system perform data approach repres step forward sound integr process view turn repres prerequisit improv busi process continu basi refer program vol pp perform measur harvard busi vol pp european foundat qualiti manag excel model access januari technolog busi process sloan manag vol pp work harvard busi vol pp jh busi process improv breakthrough strategi total data model techniqu data ibm intern technic support san wh build data john wilei process perform measur al busi inform technolog pp perform measur system tool support total qualiti vol pp perform measur intern confer system novemb pp busi process analysi process knowledg discoveri busi inform kluwer academ pp von mit der technischen universität juli zur process monitor control technic organiz hawaii intern confer system scienc januari maui seventh america confer inform system
AI/347 2 layer approach learn client behavior robocup soccer server peter stone manuela veloso comput scienc depart carnegi mellon pittsburgh pa april abstract past multiag system emerg activ subfield artifici intellig inher complex interest machin learn techniqu build multiag system robot soccer good domain studi ma multiag learn approach ml tool build soccer server client involv layer increasingli complex learn behavior describ level learn behavior client learn individu skill control ball effect learn learn skill involv multipl player describ learn method detail report extens empir test verifi empir learn skill applic game situat introduct past multiag system emerg activ subfield artifici intellig focuss ai agent behavior ma appli varieti framework rang inform agent real robot inher complex interest machin learn techniqu deal complex robot soccer good domain studi ma gain popular recent intern robocup plan futur robot soccer standard testb evalu ma techniqu straightforward team implement techniqu plai main goal testb facilit trial evalu idea real world wide varieti ma issu studi robot soccer focu multiag learn opportun noda soccer server properti simul robot soccer make good testb ma research sponsor part knowledg base plan schedul initi grant number view document author interpret repres offici polici express govern ffl complex ffl easi access research ffl embodi ma includ abil support reactiv delib agent agent model agent agent affect room cooper competit agent possibl stabl evolv agent resourc manag social convent opportun agent fill role support commun agent opportun plan commun act room explor strategi ffl straightforward ffl good multiag ml opportun approach ml tool build soccer server client involv layer increasingli complex learn behavior call approach layer learn complex futil learn intellig behavior straight primit provid server identifi skill learn move higher level strategi experi insight client act human coach teach young children plai real soccer describ level learn behavior client learn individu skill control ball effect learn learn involv multipl player describ learn method detail report extens empir test verifi empir learn skill applic situat layer learn behavior level continu move upward strategi issu mind open research issu multiag plan ml techniqu stage client develop behavior section describ robot soccer system strateg level part section present previou work relat articl robocup soccer server section bodi section present learn layer verifi game discuss futur work section summar layer learn approach present articl conclud complet robot system conduct work articl intend contribut reason aspect physic robot system architectur system address combin reason view system conjunct vision camera plai field connect central interfac client mind player figur sketch build block architectur transmit interfac client modul client modul client modul client modul client modul raw vision data action code action code object posit figur robot soccer architectur distribut delib reactiv system architectur implement robot soccer system set platform process featur perform physic navig decod respond posit request comput perceiv environ vision perform make send command commun comput robot current system infrar radiat complet system fulli autonom consist process vision system perceiv dynam posit robot imag process transfer host comput make percept client base perceiv posit agent inform state game client strateg knowledg decid client select navig command send robot command main comput robot wireless commun radiat current action code command broadcast directli individu agent command includ posit request navig turn move specif speed robot identif binari code wireless commun figur show architectur layer function system protocol layer term modular input output level layer strateg behavior hope enhanc aid simul client behavior articl relat work system robot serv inspir system develop british columbia system design capabl support robot work scenario system introduc make strategi call reactiv behavior system differ system layer entiti input output behavior robot command actual move perceptu vision view field robot ball camera coordin strateg comput robot ball command coordin layer strateg level exampl intercept player aim player pass teammat action select shoot team collabor strateg posit figur function layer strateg level decomposit notabl team consist necessit develop cooper behavior hope minim learn behavior bottom robot soccer system develop asada lab system asada robot larger equip capabl develop behavior shoot avoid rl techniqu combin behavior goal research similar approach asada develop sophist robot system advanc chosen focu produc robust design enabl concentr effort learn behavior strategi approach valuabl advanc state art robot soccer research real robot mention built robot soccer tournament studi robot conduct research effici simul research simul robot soccer studi ml applic soccer simul ford al reinforc learn approach sensori predic learn behavior simul base close stone veloso learn player learn shoot pass ball neural network teach player shoot move ball goal robocup soccer server al neural network player learn shoot pass techniqu stone veloso work articl neural network tree learn behavior robocup soccer server wide varieti ma research relat layer learn approach paper matar brook subsumpt architectur build multiag behavior top set learn basi behavior matar basi behavior chosen suffici learn remain simpl robust matar robot learn social behavior flock equip basi behavior abil follow abil wander run obstacl approach make similar multipl behavior commit ml order studi interact learn behavior level learn behavior articl involv player assum role role fix current player eventu chang role match progress tamb discuss framework agent role teammat domain learn prasad al creat design agent learn role fill plan combin role learn dynam role assumpt progress higher level learn behavior section addit reason role tamb combat agent reason role oppon plai team behavior recogn oppon action part larger team agent easili make individu oppon behavior goal predict oppon futur action work enhanc previou work aim agent deduc agent intent observ simul extens type articl feasibl physic robot system conduct research simul appli real simul directli base singl robot noda soccer server pictur figur captur complex tool simul realist player vision player commun post blackboard visibl player control separ player teammat player limit action sensor plai occur real time act domain support user build agent figur soccer server system figur illustr format commun server specif client client vision limit object visibl sensori step begin trace figur client teammat oppon brazil dash longer oppon dash client usa usa brazil usa usa usa usa shoot usa usa shoot shoot usa usa usa brazil figur trace simul input output client control player player move ball shoot goal command player dash power direct player turn kick power angl sensori inform server form visual string number type indic time match inform speak angl sound visual inform includ distanc angl visibl object longer center penalti kick client turn face oppon back view method commun illustr messag teammat number heard time spoken messag indic success goal subsequ present end trace sensor action simul noisi notic player begin face directli stationari ball ball angl dash straight ball remain directli front player client turn face ball appar player uniform visibl trace figur begin time continu time increment occur real visual sensor inform arriv entir moment pictur figur ball enter occur action simul occur real time simul featur combin make challeng realist environ conduct research lesson learn simul greatli implement strateg level real robot system learn skill young soccer player learn control ball learn complex soccer server client acquir skill exhibit complex sophist understand act part team useless abil execut individu task gener agent assum possess basic skill move skill learn domain act human coach identifi skill soccer server isol situat requir drill provid learn execut skill reliabl skill identifi essenti soccer server client abil intercept move ball skill ubiquit framework fact taught client similar skill simul intercept move ball difficult move stationari ball ball unpredict movement simul client turn move direct ball figur intercept move ball task frequent soccer server ball complet player collect skill prerequisit kick action defend intercept shot oppon player frequent pass teammat ball move roughli direct player intercept condit difficulti illustr figur ball move past player ball problem primarili defend sensori inform discret interv face method equip player abil intercept move empir chose empir method appropri machin learn paradigm provid client abil perform sophist geometr provid client larg number train exampl learn neural network defend figur defend move directli ball miss defend turn move direct longer ball figur begin defend start unit ball randomli unit defend rang situat train exampl gather illustr figur train kick ball directli defend fix power due ball move directli defend remain ball hit time defend watch ball move directli stop ball time defend behavior train complex learn gather train data act randomli record result action ball ba ball ta turn angl angl turn face ffl bd ffl bd set ta random angl ffl record previou ta ffl ffl ffl record result ball defend simpli watch face ball ball defend turn random angl ball dash defend miss posit learn perform order autom train coach client coach end trial ball past defend start move back trial label save label goal ball goal post miss head wide goal save consid posit result train end coach reset posit player ball trial goal learn defend turn angl base previou bd data save train phase nn learn order learn chose neural network learn work small amount nn settl net sigmoid hidden unit learn rate weight connect input hidden layer linearli weight decai start linear output unit weight decai train epoch configur prove satisfactori task extens tweak network paramet order test nn ran trial defend output nn determin turn angl behavior coach train result nn train number train exampl displai figur miss includ result shot wide defend chanc reach ball past figur record percentag shot defend save reason perform achiev save exampl improv perform defend save shot continu ball movement train save exampl number train exampl result number train exampl save goal figur defend perform nn train number posit exampl column tabl percentag shot defend save order studi effect ball movement defend vari amount soccer server ball rand figur show effect vari defend train nn move straight ball default mean simul true posit ball perturb random amount uniform probabl distribut rang behavior set defend directli ball notic ball straight learn behavior ball defend move straight ball motion advantag learn intercept behavior advantag nn aim slightli wide goal center defend succe time time move straight save behavior nn straight nn straight nn straight nn straight nn straight nn straight nn straight ball motion save percentag nn straight figur defend perform nn move straight amount ball ball nn solut defend intercept move ball hope discret sensori event simul mention problem overli wai approach problem notic nn weigh input heavili techniqu work quick examin input output train nn focuss primarili ball angl curiou behavior simpli lookup tabl map ba typic output nn ba identifi output ba rang defend perform full nn tabl lookup tabl built aid function easili learn method curiou nn compar analyt method basi behavior construct mike undergradu student goal creat analyt behavior result behavior comput ball motion vector previou posit multipli vector predict ball posit sensori step futur defend ta angl move directli end lengthen vector defend perform nn tabl section verifi learn techniqu learn skill client soccer server method attain method chose good option goal build learn client layer learn behavior top similarli notic ball angl learn ball distanc defend behavior nn lookup tabl analyt tabl defend perform lookup analyt method determin ta learn young soccer player learn control readi skill start learn make field plai part team client learn skill exhibit complex pass pass requir action client passer kick ball collect ball receiv task ident defend previou client train nn execut pass open field difficult receiv complic presenc defend proper defend equip intercept ball reach receiv passer face task assess likelihood pass receiv succe figur teammat receiv directli client learn pass teammat behavior build intercept behavior built knowledg pass succe knowledg contribut player pass shoot decid make passer featur scenario featur difficult pick relev build analyt model filter attribut chose learn method capabl determin attribut tree order gather train defin constrain situat coach client monitor trial pass requir coordin passer trial ffl coach randomli player ffl passer announc intent pass ffl receiv repli view field readi receiv ffl passer chose receiv randomli dt test ffl passer record larg number attribut describ trial ffl passer announc pass ffl receiv defend attempt ball learn skill im readi pass player team im readi receiv player team figur begin passer ball teammat oppon randomli region dash player team randomli field player involv plai enlarg present passer announc intent pass goal assess pass teammat figur receiv face passer world passer transmit data assess likelihood receiv successfulli receiv pass data includ distanc angl player count player distanc angl ffl coach classifi success receiv manag pass ball back failur defend clear ball miss receiv defend fail intercept ball kei part gather train exampl passer record attribut describ trial restrict number capit dt abil filter irrelev gather total attribut addit coach half passer receiv perspect attribut receiv perspect commun passer decid player pass dt ffl distanc angl receiv ffl distanc angl teammat sort angl receiv ffl distanc angl oppon sort angl receiv ffl count player distanc angl receiv ffl distanc angl receiv teammat sort distanc ffl distanc angl receiv oppon sort distanc ffl count player distanc angl passer receiv perspect receiv sampl tree output success confid receiv success confid failur confid receiv im pass player bottom figur passer receiv randomli dt evalu likelihood pass teammat succe pass receiv figur passer announc receiv expect ball teammat move behavior remain stationari figur receiv record result pass fewer maximum number player remain attribut mark unknown goal learn attribut predict pass receiv lead miss standard code default paramet gather total train miss train data produc prune tree node give error train set tree shown figur attribut start passer perspect notic frequent attribut receiv perspect train tree compar effect passer decid input potenti receiv node tree test number oppon receiv passer perspect tree predict pass fail tree move node test angl oppon passer sort oppon closest oppon receiv term angl passer perspect oppon tree predict success deeper node tree order test dt perform ran trial passer dt receiv behavior train dt return confid estim passer receiv candid classifi success tree predict failur lowest confid read select notic passer game situat passer option dribbl shoot compil result sort dt confid success pass chosen receiv tabl largest number pass classifi success confid larg portion classifi success confid success rate success rate obtain receiv chosen randomli result obtain condit forc passer requir pass ball trial notic passer fairli pass dt predict success confid greater result success rate approach limit success rate skill test repeat defend intercept success rate success result success failur miss tabl result trial passer dt receiv result breakdown passer confid prior pass passer forc pass predict failur teammat pass teammat lowest likelihood failur result percentag number case attribut obviou construct analyt heurist passer receiv comparison passer random choic train reason improv random choic pass closest teammat compar dt closest teammat heurist closest teammat heurist produc success rate number compar favor dt success significantli lower success rate passer achiev dt option pass closest teammat heurist estim likelihood pass succe simpli postul passer pass closer teammat likelihood estim true goal learn clear advantag dt method decid knowledg pass succe extrem demonstr built skill learn previou section client learn judg likelihood pass receiv successfulli receiv judgement repres layer quest build intellig soccer server client layer learn tree interpret wed jul passer oppon passer oppon passer angl passer angl passer teammat passer receiv distanc passer distanc passer player passer player passer distanc passer distanc passer oppon passer teammat passer oppon passer receiv distanc passer oppon passer oppon passer distanc receiv teammat passer receiv distanc passer distanc passer oppon receiv player passer oppon passer oppon passer oppon passer oppon passer oppon passer distanc passer distanc passer distanc passer oppon passer oppon passer player passer player passer oppon passer oppon passer distanc passer distanc passer oppon receiv angl receiv angl passer teammat passer teammat figur train tree fewer case cover remov present attribut start passer perspect attribut start receiv perspect player number player receiv distanc angl passer scale strategi judg likelihood pass real simul soccer player readi start make situat player pass strateg posit shoot verifi level learn incorpor implement set plai pass previou section illustr figur player start ball front dribbl oppon goal notic oppon decid stop dribbl consid option notic shoot dribbl forward longer decid pass accord sequenc laid previou announc intent pass nearest player dt decid teammat successfulli receiv pass teammat defend dribbl pass pass pass shoot figur illustr implement set plai player improv visibl player learn skill earlier articl figur passer topmost receiv pass ball receiv adjac defend intercept ball train nn skill defend kick back left goal plai start receiv immedi kick ball teammat wing easili collect ball begin dribbl goal behavior teammat began set notic defend path decid good angl shoot shoot train dt nearbi teammat pass chosen receiv ball immedi shoot goal ran set plai time order verifi learn behavior robust reliabl defend equip skill defend break plai fact attack team successfulli string pass shot goal learn behavior demonstr behavior situat implement set plai suggest number possibl layer learn set plai player start ball dribbl oppon predetermin distanc distanc chosen player pass central oppon ball flexibl power approach dribbl player learn continu shoot possibl action space predic discret state reinforc learn method applic track oppon teammat possess ball player propag reinforc valu made possess ball candid layer learn behavior part receiv teammat readi pass teammat directli commun player receiv pass learn move posit current implement set dt learn passer receiv stationari teammat receiv goal chosen receiv learn move behavior built learn pass dt learn satisfi precondit success pass level learn introduc adversari issu addit learn cooper player learn thwart oppon counterpart receiv learn move receiv pass defend learn move prevent pass behavior potenti complex defend goal intercept simpli prevent defend optim behavior move posit passer pass defend intercept ball adversari behavior addit issu consid adversari continu adjust evolv increasingli complex behavior net advantag side potenti block competit coevolut identifi address research work genet algorithm robot soccer team plai singl adapt quickli oppon behavior perman harm perform oppon anticip address adversari learn issu continu build soccer plai agent move continu wide rang learn method addit nn hope test genet type learn method continu build learn layer aim eventu reach strategi perceiv strategi oppon articl describ initi step creat complet soccer server client ml techniqu start abil intercept move nn teach client skill prerequisit execut complex behavior individu skill basic form multiag learn action execut singl make environ agent agent kick client intercept ball build individu dt teach client evalu likelihood pass teammat succe evalu repres convent form multiag learn agent teammat directli affect pass action implement set plai involv player learn behavior set plai verifi learn behavior situat chose skill build higher level behavior skill particip pass knowledg teammat receiv pass client decid shoot continu layer learn behavior top interest studi learn method interact multiag research continu move behavior creat complet team soccer server client learn behavior continu appli method succe simul physic robot system refer aaai coevolut learn multiag paper aaai spring menlo march aaai press aaai technic report sandip hosoda sensor space categor robot learn proc intern confer intellig robot system page hosoda behavior acquisit real robot reinforc learn machin rodnei brook robust layer control system mobil robot ieee journal robot roger craig kanazawa exploit natur structur reinforc experi robot unpublish manuscript john grefenstett robert method competit cooper coevolut learn multiag paper aaai spring page menlo march aaai press aaai technic report thoma hayn sandip sen evolv behavior strategi predat prei gerhard sandip adapt learn multiag page springer marcu huber edmund decid commit action coordin intern confer system page menlo june aaai press hiroaki itsuki minoru hitoshi osawa challeng problem ai ai spring maja matar design understand adapt group behavior adapt decemb hitoshi itsuki learn cooper action case studi pass plai soccer coevolut learn multiag paper aaai spring page menlo march aaai press aaai technic report itsuki noda hitoshi matsubara soccer server research system workshop novemb nagendra victor susan lander learn organiz role heterogen system coevolut learn multiag paper aaai spring page menlo march aaai press aaai technic report ross quinlan program machin learn morgan san christoph richard belew method competit find oppon worth beat stephani sixth intern confer genet page san juli morgan kaufman michael user guid januari michael intellig behaviour dynam robot master british august michael alan rod stewart control robot testb ieee intern confer page peter stone manuela veloso beat defend robot learn continu function david michael michael advanc neural inform process system page mit press peter stone manuela veloso multiag survei machin learn perspect submit journal artifici intellig research februari peter stone manuela veloso collabor adversari case studi robot soccer intern journal system peter manuela collabor learn robot soccer world cup soccer novemb ieee robot autom societi milind tamb teamwork dynam environ intern confer system menlo decemb aaai press milind tamb track dynam team activ thirteenth nation confer artifici menlo aaai press minoru hosoda behavior coordin mobil robot modular reinforc learn proc intern confer intellig robot system page gerhard sandip editor adapt learn multiag system springer
IR/348 5 method reinforc cluster descriptor shen lee depart comput scienc hong kong scienc technolog hong china abstract engin act agent particip search engin receiv queri user redirect particip search engin process engin incorpor particip search engin singl global search engin term number page index fresh index engin store descript data index maintain particip search engin estim relev search engin queri receiv abil engin select relev search engin determin qualiti final result facilit select document space cover search engin exist method tend focu descriptor descriptor search engin entir index paper cluster search engin document space cluster descriptor cluster show cluster descriptor provid finer accur document enabl engin improv select relev search engin search engin select scenario independ discuss paper experi verifi search engin select effect identifi relev search engin improv qualiti search result introduct enorm rapidli amount inform web made internet valuabl discov inform search engin user relev web page ocean billion document nowadai web huge web page updat index maintain search engin refresh period extrem time resourc consum search engin crawl web download web page refresh index difficult singl search engin cover larg web index time search engin index smaller part web refresh index frequent specif network domain web server local geograph area small search engin return pertin web page compar singl global search engin coverag web small page relev user queri order miss relev user visit search engin individu engin middlewar consist number particip search engin particip search engin maintain index offer descript inform index engin engin record descriptor estim relev underli search engin queri receiv reduc resourc relev search engin invok process queri select relev search engin refer server select procedur good server select method effect identifi relev search server relev search engin run server server term search engin search server interchang set document compar singl search engin provid larger coverag web return web page incorpor larg number search index small part web effici document space cover search engin engin engin descript inform server index make server select accur larg amount descript inform requir resourc particip search engin collect engin store process clear tradeoff amount descript data store engin accuraci relev estim exist server select method tend focu descriptor descriptor search engin entir index descript inform consist total number document index search index term total term document clear inform word busi doesnt context word adopt approach cluster search engin document space cluster repres document space engin cluster descriptor server rank method cluster descriptor estim server relev cluster identifi homogen group document search engin document cluster descriptor give finer document space cluster repres part document accur word cluster bear mean select relev search engin improv argu cluster fast cluster method literatur obtain document cluster descriptor effici show paper gener larg number cluster order improv perform descriptor import note particip search engin dont physic cluster document space retain physic organ retriev method implement cluster modul obtain cluster descriptor send engin engin cooper system engin make inform provid particip search includ exist work cooper system econom incent high visibl high rank engin encourag particip search engin provid descript inform work motiv method appli system distribut search document machin system manag reason defin inform cluster descriptor develop server select method base cluster descriptor document collect deriv trec evalu perform method compar exist method show method good perform select candid larg set server evalu situat expect encount engin system review relat work section server rank method cluster descriptor rank scenario independ discuss section present result drawn section relat work refer hierarch distribut search paper address issu publish recent mention server rank critic problem ggloss server rank regard baselin server rank method document queri term server index comput similar document queri ggloss good score server sum similar valu cori adopt infer network estim relev underli server queri term document frequenc server collect frequenc server basic df strategi prefer term distinguish server term larger varianc cue valid stand server differ greater weight server rank larger varianc relev server separ irrelev server recent server rank method rank server document greatest similar queri server server rank similar document retriev document greatest similar queri document maximum normal term weight queri term averag normal term weight queri term refer server rank method similar theoret model aim retriev maximum number relev document minimum cost server perform curv term recal cost retriev document total cost retriev document server relat queri cost differenti server cost function equal lagrang optim number document select server anticip model extend optim retriev cost user relev document xu croft server rank method show effect diverg cluster queri calcul server server rank base similar cluster server method cluster method estim server relev cluster descriptor server select improv accuraci server delin document space index search engin detail data content present descriptor document frequenc cori engin motiv cluster document underli server index similar document group descriptor data size inform describ document store engin server select base descriptor cluster case document server index cluster tightli simpli treat document singl cluster server rank assum document index user queri repres vector vector space model document vector weight term vector defin raw term frequenc term divid maximum raw term frequenc term document similar vector cosin vector dot product divid norm xm norm defin cluster similar document vector comput answer user similar queri vector document vector repres document retriev comput cluster effici cluster algorithm discuss cluster procedur algorithm base main memori data structur cluster featur tree birch algorithm incur fewer disk effici significantli improv object studi effect server select method determin necessarili cluster algorithm improv qualiti server select adopt wide cluster algorithm iter algorithm converg quickli cluster algorithm start rough cluster iter adjust cluster cluster satisfactorili refin xu croft adopt method show version straightforward faster algorithm descriptor cluster cluster document cluster briefli repres cluster basic inform cluster cluster cs descriptor consist ffl total number document ffl centroid aw aw averag term weight term document cluster includ document ffl document frequenc df df df number document cluster term aw averag document matter document term queri multipl document queri term relat queri vector pw refer weight deduc pw aw averag term weight term document term cluster similar weight cluster server rank method base cluster descriptor calcul similar server similar weight underli cluster assum qt qt queri df probabl random document cluster sim similar cluster estim independ scenario scenario independ scenario independ scenario assum distribut term document mutual independ probabl document probabl document due independ distribut assumpt probabl random document cluster equal probabl random document queri defin pm total number document cluster queri term simplifi weight vector repres document sim similar weight vector queri sim estim similar cluster defin sim time number document queri term sim pm sim scenario scenario similar ggloss specif slightli make assumpt manner made ggloss assum document weight term distribut uniformli document term probabl random document term correspond repres vector rv pw pw probabl document correspond repres vector rv pw pw term pm ph probabl document correspond repres vector rv pw pw ph probabl document term equal correspond rv assum sim similar vector rv queri sim estim similar cluster comput sim ph sim ph sim defin dot product queri vector repres vector rv document frequenc incorpor repres sim equal ideal ggloss weight weight cluster estim weight server scenario estim similar cluster document index search server cluster cluster defin estim similar sum cluster weight top cluster assum sim estim similar weight sim sim sim sim estim similar defin sim sim server weight top cluster major relev document ss index cluster smaller estim similar weight estim ss similar number cluster method reduc amount data store select similar server queri receiv result justifi effect server rank simul environ consist construct document volum volum trec consist document total size distribut randomli server skew distribut differ relev underli server obviou larger server relev experi base uniform distribut document paper difficult effect identifi relev server document uniformli distribut document index server cluster cluster descriptor server similar valu estim user queri engin select similar server process queri number select server refer cast number select server evalu queri return retriev document tfidf document sort descend order tfidf valu local document frequenc tfidf formula shown effect global document frequenc local document frequenc rank document uniformli distribut server web queri short term effect necess adopt document frequenc weaken maintain global inform impract engin consist larg number particip search engin engin merg document retriev select server final result list return user fifti queri experi trec topic short queri format adopt web queri short short trec queri term averag number return document larg web queri user small number top document basic perform criterion experi number cluster gener larg number cluster document cover search cluster smaller number highli similar document cluster descriptor describ document cluster produc cluster storag space metasearch engin cost gener larg number cluster high examin effect retriev number cluster similar weight cluster server index gener similar weight server valu obtain top document consid figur notic valu initi number cluster total number cluster exce cluster affect valu import mean dont spend lot term cluster gener descriptor storag gener larg number cluster order method work total cluster top doc top doc top doc figur effect total number cluster independ evalu ratio server select sum similar valu top cluster similar weight server estim percentag cluster calcul weight server refer evalu ratio evalu ratio equal similar weight cluster server relev document queri similar small number cluster cluster turn high cluster similar weight queri cluster highest similar weight relev document verifi intuit experi result shown figur top cluster evalu comput server top document improv cluster emploi rank result fluctuat perform verifi figur rank scenario compar rank scenario estim similar cluster consid independ rank scenario queri emploi evalu ratio top cluster top cluster top cluster top cluster top cluster top cluster top cluster top cluster figur effect evalu ratio independ examin perform server rank method scenario result depict figur show independ rank scenario perform scenario evalu ratio phenomenon attribut fact queri term emploi trec topic highli correl adopt independ rank scenario server select method evalu ratio cluster cluster cluster cluster cluster cluster figur rank scenario comparison compar server select method exist method section evalu method number cluster gener document search server evalu ratio case examin result rank method valu top top document compar result experi shown figur cast number small cast number method significantli rank method cluster number top document number cast number differ method diminish obviou server select cast method number server engin expect select small number relev server evalu queri order speed queri execut save system resourc method identifi relev server accur cast number small suitabl metasearch system cluster method identifi data pattern suggest paper document space cover search server repres cluster repres cluster descriptor relev search engin user queri estim accur show experi server select effect identifi relev search server queri import engin server select mechan identifi small number relev server larg number underli server experi reveal basic aspect server select document space satisfactori document index cluster larg number cluster moder number cluster suffici describ document space reduc cluster cost storag space engin cast number cori ggloss cluster cluster top document cast number cori ggloss cluster cluster top document figur server rank method small percentag cluster descriptor estim server relev queri store inform similar result reduc storag cost perform cluster descriptor rank underli server cluster document physic period updat cluster descriptor send engin faster increment cluster algorithm aim produc rough cluster design manner cluster featur tree birch acknowledg write chapter support research grant council hong china number refer modern inform retriev addison brin page anatomi hypertextu web search engin comput croft search distribut collect infer network page fuhr approach select network ir acm transact inform gravano gener gloss broker hierarchi page discoveri internet acm transact system shim effici cluster algorithm larg page jain dube algorithm cluster data prentic saracev real life inform studi user queri web sigir lawrenc gile access inform web vol juli connel impact select distribut search page silverstein pedersen cluster arbitrari corpu subset page li effect metasearch engin intern world wide web confer xu croft languag model distribut retriev page rish effici effect metasearch larg number text page liu effici effect metasearch text incorpor linkag document yuwono lee server rank distribut text retriev system internet intern confer system advanc applic page livni effici data cluster method larg page
HCI/349 4 secur architectur applic session handoff erik thoma fred richard mario lu depart comput scienc california lo angel lo ca ubiquit comput varieti wire wireless connect lack effect secur architectur research address specif issu design build secur architectur applic session function kei compon enabl ubiquit comput architectur incorpor number proven approach context ubiquit comput emploi capabl model access control adopt public kei infrastructur approach provid effici authent secur demonstr effect implement applic enabl secur architectur show incur low latenc introduct aim ubiquit comput provid mobil user access comput servic interconnect network internet research perform provid infrastructur applic support issu secur gener difficult address problem due highli heterogen natur client devic intend particip ubiquit comput platform laptop person digit assist secur issu arisen interact mobil applic support heterogen client research project collabor effort ucla medic school comput scienc depart gear comput infrastructur ucla hospit built environ physician staff worker wire wireless ubiquit access medic record enabl effect patient treatment high inform access enabl develop wide arrai support provid user function call applic session handoff recent work demonstr import ash mobil function applic transpar migrat session discret stream data seamlessli follow user number heterogen client facilit middlewar layer act data conduit handoff mediat enabl scalabl present transcod work fund nation scienc foundat award success implement number issu secur difficult resolv due devic heterogen constraint lack support infrastructur problem accentu consid import secur legal social context medic record function address issu includ authent author user access share system data data data network definit secur semant seamless session handoff function support ubiquit comput paper address issu contribut mobil comput research provid number protocol support secur ash function provid effici effect secur enforc strengthen robust ash kei compon lead converg heterogen mobil comput augment provid secur framework support futur applic mobil comput specif challeng present address paper enforc effect access control system resourc provid secur applic session handoff sever degrad exist system perform secur subsystem effici perform session handoff stream data implement secur architectur make ash resili wide rang includ passiv malici messag alter implement number approach design enforc access appli proven access control model applic infrastructur augment model abstract object oper modern oper system network emploi public kei infrastructur scheme enforc secur network transport layer model scheme demonstr effect implement prototyp applic enabl secur mechan implement show secur architectur protocol provid effect establish mainten secur channel fig broad overview architectur middlewar applic server show system unreason degrad perform exist architectur explain secur architectur futur work remaind paper xii present architectur discuss relat research work present secur includ access control xiii demonstr present implement evalu xiv conclud paper xv futur work ii background relat work architectur depict figur top figur applic server servic data number heterogen client includ wire desktop pc wireless mobil devic note typic poorli suit support myriad client improv servic avail introduc middlewar layer client idea middlewar tier context middlewar server provid system scalabl applic session handoff ash capabl user experi converg comput platform user work applic wire desktop decid move wirelessli connect pda ash user applic session state seamlessli move desktop pda time manner request session state includ discret stream data varieti network interfac bandwidth note state consist data structur variabl applic defin session entir process immedi differenti approach process migrat middlewar handl data transfer desktop behalf user automat adapt content move data fit devic characterist pda transcod fit pda end program applic platform demonstr util function enabl web browser teach medic multimedia ash environ answer question scalabl design fulli distribut middlewar servic layer multipl autonom middlewar server aggreg research effort explor softwar architectur support mobil comput address issu session handoff heterogen client author present rover toolkit distribut object model support program mobil devic activ network ant suggest programm network node inject capsul code data toolkit facil deliv adapt data match network condit project network workstat middlewar tier provid transcod multipl www client applic data servic user transfer data network digit network infrastructur secur context network provid authent servic address devic heterogen exploit comput power middlewar essenti approach base kei distribut center authent request process incur larg workload pose singl point system failur attack seek authent mobil client distribut middlewar infrastructur avoid singl point failur run time iii secur architectur secur architectur design provid ash authent user access control system secur commun arbitrari network entiti common secur messag messag address make system resili secur attack design authent authent user emploi approach leverag standard public kei infrastructur foundat recent network secur protocol set certif author issu certif valid user commun entiti establish temporari trust relationship global verifi certif carri entiti commun entiti seek ensur messag messag transport layer design effect wireless client vulner passiv eavesdrop activ alter due broadcast commun channel critic data sign encrypt transport layer reach network data secur network entiti broken stand occur en rout lower layer data secur recent found evid weak network secur wide deploi similar approv transport layer secur protocol famili emploi system accomod heterogen wire wireless client secur lower layer data secur provid system authent user access system resourc proven concept system secur access control model emploi extend context ubiquit comput enforc system extend access control model model access control model inform system defin secur system state machin state tripl constant set constant set access matrix access finit set oper consist read write model mandatori access control model restrict subject pass access subject subject object classifi fix lattic secur level shown inform higher level lower level simpl rule model effici implement low cost offer natur extens model defin secur legal insert network entiti subject set object set insert network commun oper send receiv access set highlevel subject data subject data prohibit oper access control matric store applic server middlewar server regul ash model high level inform system low level user devic capabl augment extend model capabl oper concern approv access control case network entiti handoff session specif set network entiti secur deliv session capabl capabl formal defin pair made uniqu object identifi set oper interfac object secur model enforc capabl tamper system entiti obtain capabl capabl system entiti hold wide modern oper system capabl secur techniqu directli ash design implement practic mechan capabl transport layer secur protocol initi session authent handshak establish master secret session master secret effici gener function sourc random number gener server current time random number gener client current time random exchang commun parti certif base conclud master secret qualifi capabl function basic clone standard messag digest capac gener output arbitrari length combin current client current server random uniqu live session comput properti messag digest output function uniqu master secret tamper claim design commun protect data encrypt order decrypt ash anchor session hold session capabl master ash design effici comput commun system resourc incur extra overhead protocol detail devic user authent system resourc devic authent user authent pair devic shown figur begin devic activ client start remain resid handl relat mw dcc fig devic authent handshak mw dcc scc fig user authent login mw dcc dcc scc fig mw dcc dcc scc scc fig cleanup commun icl contact class authent handshak establish secur devic control channel commun encrypt scheme establish handshak devic authent approv access control mw regist devic local list devic creat consid part network particip user start session pull remot session devic push session devic ash roam remot place figur depict user authent session mw secur session control channel establish session master secret scc obtain appli function master secret dcc dcc share session properti function prevent session secret ensur dcc privaci scc secur session data channel establish network connect applic server icl creat session data channel scc procedur emploi function creat scc send user begin servic spawn applic devic applic part session migrat ash occur ash push move ongo local session pull move remot ongo session local devic spatial devic concern establish secur mean directli commun commun architectur ongo session secur ash push depict figur session devic start icl send command mw behalf access control mw respond list qualifi devic user notifi mw desir destin icl send current client session mw client session session capabl applic state bootstrap applic destin make ash mw send ack access control polici devic establish scc mw send back establish send messag mw receipt mw transfer session data send cleanup messag origin devic remov session devic reconnect activ session ash pull depict figur begin user authent devic point scc establish creat anchor session devic user send mw newli establish scc access control mw repli list qualifi session user user notifi mw desir mw send scc select locat devic icl transfer client session capabl mw relai turn merg cleanup similar mw send reconnect activ session iv implement evalu architectur implement larg java client middlewar server choic java softwar port modest difficulti facilit integr client devic run heterogen combin environ nativ librari requir encrypt primarili perform enhanc link java applic java nativ interfac set librari architectur written architectur ti structur possibl client middlewar server run mw dcc dcc scc fig login mw dcc dcc scc scc fig cleanup delai session data size ash encrypt ash encrypt fig latenc incur perform encrypt mhz pentium pro tabl master secret length number master secret secret dataset amount code written languag perform reason requir code follow design manner experi capabl model prove feasibl design gener larg number real session master secret implement conform standard gener data load sql queri implement issu check session master secret tabl show result case million master secret session standard master secret find master secret million session session signatur messag digest master secret check checksum session master secret million session test arithmet relat number number master secret length result show occur half million million session result demonstr messag digest function function master checksum directli session capabl emploi regul ash heterogen client design implement ideal case design messag digest probabl function output long chanc exponenti output length linearli tabl ii averag time oper client platform mhz mhz mhz pentium pro dcc handshak time bit dcc handshak time bit certif user start session time tra network protocol model transport layer secur implement evalu ash model order quantit perform perform number experi vari scenario experi devic user authent experi measur time requir machin perform devic authent user authent experi involv measur comput overhead trial devic machin run java redhat linux mbp ethernet pentium iii mhz middlewar server client list tabl ii rsa public kei scheme result tabl ii show devic authent costli low end mhz approxim ms result due comput overhead rsa decrypt class authent cost devic authent paid devic bootstrap scc establish quickli averag latenc approxim includ session initi delai process delai execut function experi latenc experi latenc measur mhz machin mhz machin experi design measur overhead perform ash slow machin measur import work requir ash target side mw previou experi session data transfer measur overhead protocol averag latenc show ash protocol creat unreason overhead hardwar setup quantifi experi repeat previou experi vari session data transfer ash data size rang byte megabyt experi perform scheme turn show overhead incur data encrypt ash result figur show reason ash perform degrad test session size megabyt futur work heterogen modern mobil comput devic made gener secur support softwar infrastructur difficult paper suggest gener secur scheme focu effort provid secur support applic session handoff ash function serv import role futur converg multipl client devic fulfil ultim goal ubiquit comput ash import function research augment util secur natur progress develop effort design implement secur architectur lai groundwork secur framework past ash aspect environ design goal architectur provid secur support includ access strong secur ash reduc scalabl hinder fast handoff discret stream data order answer select adopt pki tl ensur authent model access capabl regul authent user access system resourc establish number baselin metric encourag specif hardwar softwar testb show client authent start session approxim millisecond devic bootstrap cost perform applic session handoff ms toler multimedia stream applic anticip extend work futur investig heterogen platform network assort network determin advantag wireless interfac provid secur connect cellular data research udp data stream support stream data integr previou work distribut middlewar architectur secur plan refer liao programm support adapt mobil ieee person august zhang nomad ucla technic report bell comput unifi exposit mitr corpor wagner mobil insecur intern confer mobil comput juli rome itali henderson network architectur heterogen mobil ieee person octob jb deni van horn semant multiprogram commun vol pp commun vol pp fox gribbl indirect authent intern confer mobil comput andrew fox comput applianc data intern confer mobil comput juli itali kaashoek toolkit mobil inform acm symposium oper system principl liang java nativ addison weslei zhou migrat acm comput june walker adapt acm symposium oper system applic session time ieee intern confer commun june twist mobil interact session ieee workshop internet applic san juli distribut middlewar servic architectur support mobil internet acm wireless mobil internet workshop juli richard daniel dougla richard robert alessandro david michael jone system softwar comput societi intern confer sandhu lattic interpret wall nation comput secur netscap commun corpor authent servic open network usenix januari rubin attack break lab report activ network comput commun april allen tl version wagner schneier ssl protocol usenix workshop electron internet ieee network juli transport layer secur
IR/350 5 inform retriev fast cluster genr ivan johan ander research ab abstract paper describ collect specif empir defin stylist base genr predict brought rapid topic cluster build interact inform retriev interfac present search result prototyp present address specif problem inform enrich inform seek dialog encourag support iter refin enrich document past shallow semant term frequenc search word todai tool search inform document base term occurr text searcher enter number term number document term close relat term compar frequent retriev present system list form method work point intuit compet user edit document base give predict result obviou drawback term frequenc provid document content suffer shallow text facet featur list term difficult user pinpoint term search relat set relat variant focu specif drawback tradit inform retriev search process acknowledg recent research project recent search seldom affair typic search improv refin retriev set good metric interfac support persist increment refin object studi complex document topic term document topic inform seek dialog dialog design central field comput design principl made research gener interest humancomput interact reason linguist comput lot offer dialog languag lot dialog languag technolog applic dialog design algorithm terminolog statist put thought dialog design system transcend typic dialog field inform system search term result list dialog build increment special pipelin architectur system user special queri special result set cluster retriev initi queri result cluster repres retriev document insert cluster irrespect rank special queri figur special enrich document cluster repres topic select inspect list format uninterest judg document intern process order topic genr displai seek inform seldom clear pictur goal mind typic user familiar materi find express inform system preliminari reformul previou inform retriev interfac support persist manipul dialog object repres system understand search topic document effect search term term retriev user document retriev term term set topic set topic style inform retriev interfac shield user variat displai user act iter interact prototyp implement assumpt interfac design user cope complex interfac goal reduc amount inform user subject true inform present manner found task usag context user accept built fulli function prototyp experi iter search experi world wide base search web document user enter tradit system produc rank list output base term displai distribut result set dynam gener topic cluster orient genr document space displai work board matrix user process consist main present classif cluster engin implement run standalon applic microsoft window includ index search engin make commerci search engin index retriev document index servic return local architectur pipelin process compon connect disconnect user request pipelin deliv stream document world wide web user main goal graphic design interact design build interfac appeal untrain internet user interest fun case inform visual tool scientif support interact design specialist user graphic design function aesthet qualiti result standard element standard program tool involv graphic industri design design process inform visual comput era case aesthet beauti pleasant clariti usabl reason introduct comput inform visual process aesthet lack aesthet qualiti distract bore user indirectli loss potenti usabl function underli function aesthet qualiti graphic design feel fun sacrif strict reliabl high inform densiti color user domin interfac strong color extrem shape time bore user extens interfac combin sober color simpl interest shape built carefulli chosen graphic element function prototyp design high interact mind user initi interact enter queri click search button send current paramet set number initi ia start background pipelin consult index engin list start retriev candid document internet initi start deliv document present pipelin design leav user control interfac time lock indic show classif engin run background stop button user halt background clear button clear current document set displai choic made step user drag drop subset present document set regroup panel request regroup cluster stop filter pipelin continu simpli add filter end pipelin set return finer analysi turn inform document found pop document time document defin sole list repres document member topic stylist homogen cluster interfac stylist variat text show stylist observ choic linguist item stylist item observ level linguist choic word similar mean choic construct commun textual organ stylist item import entir set indic systemat differ set document perceiv consist tendenc make stylist choic call genr establish commun function style stylist variat genr languag varieti detect reliabl larg batteri simpl stylist item pronoun count rel frequenc type construct passiv util authorship determin simpl calcul averag word length distribut success predict inform retriev balanc corpora test genr palett internet find print document creat test materi collect involv risk circular evalu criteria interpret vagu express understood user face real engin problem put genr distinct predict retriev comput genr equat base text wall street journal text person technic document karlgren find find foundat user percept central task built genr palett tabl interview defin genr consist user expect observ conveni comput measur stylist variat outlin previou section work previou report genr sampl person home page commerci home page gener public interact page page custom searchabl index journalist materi popular report public formal text run text faq link list discuss contribut usenet materi error messag total tabl current genr palett recogn genr automat genr intuit workabl automat analysi calcul larg number textual featur individu text work categor machin learn algorithm pioneer work dougla comput stylist descript aim find distinct regist varieti spoken written languag made larg number stylist featur collect work weigh standard method multivari statist work basi featur lexic rel frequenc class word person instanc add gener textual genr specif rel number averag word instanc vector specif internet materi number imag number href link instanc normal measur standard combin present simpl categor rule categor tool longer word ratio object class textual certainti dozen rule categor text eleven genr defin section genr partit major textual turn split split vari nineti cent success make wrong choic time addit featur defin genr palett result improv result categor object potenti genr cluster content simpl cluster algorithm similar measur compar topic document cluster centroid respect base standard defin salton bucklei standard term cosin length standard collect frequenc measur factor collect domain specif terminolog variat emphasi high quick dirti cluster initi document set work assumpt low cluster interfac desir search engin includ system time wait data arriv algorithm entir document initi cluster form random case cluster proce assumpt document arriv repres subset entir retriev set dare assumpt overli enabl start cluster restrict order squar hierarch cluster defin cluster small number number adjust interfac cluster variant standard hierarch agglom algorithm jain decid cluster adjust document rout simpl algorithm decid cluster membership cluster repres centroid centr point list term highest match distanc hierarch cluster algorithm cluster refin easier implement entir cluster stage coupl tighter search engin algorithm substitut integr system evalu method design develop satisfact small develop method pinpoint weak design time encourag pursu strong side user basic compon base empir evalu prove immedi subject satisfact cluster algorithm genr classif bare interfac complet place prototyp run interact test evalu design refin gave small number subject simpl retriev task altavista order question interfac vari subject subject chosen repres test popul subject ag averag poor measur small case subject pool hit mark assess averag experienc internet search servic reason understand search servic work task find album concert review oasi find list hotel subject introduct main idea shown search user altavista task experi supervisor gave tip queri formul subject stuck subject minut task subject altavista search produc result spite subject understood interfac remark subject chang cluster comfort short explan genr refin spite low subject interfac subject interfac intend search document genr intend result show genr determin algorithm current state make mistaken choic hit rate ten concept work flexibl genr determin document fall genr cluster head improv subject chanc find document space absolut work larg document inspect document imposs larg number categor iter search engin deliv top rank document formul queri larg weight determin correct answer found closer integr bottleneck elimin improv includ futur plan project work design team fulfil compet successfulli search machineri refer dougla typolog english david jan john tukei approach larg document collect fifteenth annual intern acm sigir confer research develop inform copenhagen acm johan ivan karlgren balanc corpu nordic comput linguist copenhagen copenhagen nil erik linguist stylist franci frequenc analysi english usag houghton donna harman fourth text retriev confer nation institut standard special public washington marti hearst jan reexamin cluster retriev result collect nineteenth annual intern acm sigir confer research develop inform zurich acm jain richard dube algorithm cluster data prentic hall karlgren variat inform retriev septemb comput languag karlgren cut text genr simpl metric discrimin intern confer comput linguist kyoto comput languag million hardest corpu tag intern confer comput linguist han karlgren helsinki tc characterist curv scienc ross quinlan program machin learn san morgan kaufmann gerard salton christoph bucklei approach automat text retriev inform process manag jim fang jose troi jin jon wild languag inform text retriev confer donna harman nation institut standard special public washington edward tuft visual displai quantit inform
Agents/351 1 electron scientif technolog roadmap carl sierra sierra content question mediat agent electron commerc current develop interact auction negoti protocol applic engin product standard secur legal issu privaci research develop perspect interact auction negoti protocol applic engin product standard secur legal issu privaci vision acknowledg question internet continu spawn market electron commerc chang market convent commerci practic adapt condit brought global practic begin technolog plai critic role regard potenti eventu deliv level gener sophist electron commerc conduct time number sociolog legal issu address opportun realiti internet growth surpass optimist forecast million user million user million europ activ unbalanc countri high sweden popul countri moder itali usag reason dispar found sociolog attitud technolog climat factor relev report big part internet user sampl bui web part qualifi regular shopper import differ countri detect respect produc finland spent time spain basi forecast european bui good servic year suggest current million shopper european revenu current million million number european execut futur electron commerc observ previou figur state electron commerc internet reach critic mass europ european commun awar fund research inform commun includ electron mid eighti program serv esprit project fund past agent technolog central project project fund agent technolog effort aim research program recent fuse societi program program total budget billion period year aim support agent special area electron commerc unit nsf year launch specif program multiag system budget million current corner stone eu polici favour agent technolog find aim put contact group research industri develop ultim goal creat synergi project group improv compet european industri excel academia mechan agentlink educ activ build agent relat literatur facilit collabor member node main activ regular meet interest sig run consid cluster interest academia industri sig electron gather main particip area evid interest agent electron commerc found seri workshop agent mediat electron commerc recent year april august descript current main research activ electron commerc europ present scientif technolog term research develop line foreseen outlin refer exemplifi line research mean research public run project fit materi gather meet special interest group fund eu agentlink network excel octob april septemb attend meet contribut idea piec text integr document refer european project found mediat agent electron commerc number techniqu structur relat custom seller internet user attribut good acquir user model profil order target banner determin negoti strategi develop made center passiv web queri type interact richer flexibl wai interact witt agent mediat step commerci transact mediat corner stone commerc mediat infrastructur payment softwar agent similarli extrem util electron commerc due ffl autonomi agent work reactiv independ human wait good deal divert attent ffl agent equip person profil reflect user prefer ffl social abil commun abil agent permit negoti servic transact ffl intellig agent learn perform time ec scenario equat make monei ai techniqu appli agent show characterist assist custom select automobil featur give set hard constraint car satisfi seri grade soft constraint repres prefer custom agent constraint satisfact techniqu satisfact soft constraint current develop section outlin activ europ line identifi sig meet particip dimens interact commerc interact buyer seller deliveri order support autonom agent increasingli wide rang industri commerci domain agent high determin decid condit action perform agent interact autonom agent achiev object suffici capabl resourc complet problem solv interdepend object interact make agent undertak action perform modifi plan action delai bring forward action longer agreement common action basic mechan auction negoti subject subsect auction design electron auction receiv attent group focu platform iiia barcelona formal model bath notion trust plai central role method enforc action agent design electron institut similar tradit reason research direct strang institut auction electron market place agent group develop electron market place europ european union fund project object negoti fundament power mechan manag interag depend run time negoti negoti share limit resourc autonom entiti acquaint convinc act accept agent direct control persuad acquaint act wai simpli instruct agent engag negoti process joint made parti parti contradictori demand move agreement process concess make search altern european group mechan model negoti argument simul negoti problem categor wai classifi problem underli incent inform actual size limit resourc share unknown agent split size unknown time sign set agent interest limit resourc unknown set agent characterist unknown agent bargain deadlin privat agent compet bui object worth privat agent time prefer bargain split dollar depend categori problem fall negoti model appli build autonom agent capabl flexibl sophist broad area consid defin negoti model negoti protocol issu negoti reason model agent emploi paper describ research area focu aspect concentr predominantli final point present formal account negoti agent reason compon concentr process evalu incom gener counter model specifi kei structur process involv endeavour defin model shape practic insight eman develop system negoti agent busi process manag converg result type negoti model report reinforc learn algorithm design enabl agent adapt chang includ competitor agent point view certif servic nowadai ident seller ebai method good number servic trust busi bureau honesti servic act parti deliveri good monei charg contract price fee research area receiv interest recent nsf initi negoti workshop year clear evid protocol kei issu interact protocol wai interact particip progress deal agent interact order reach agreement privat commun prefer parti find accept deal offer iter reach agreement issu issu basi issu time design mechan game theoret extrem import point view effici compani good european refer respect design effici power manag interest approach petri net found applic rich varieti interest applic domain applic rang market electr manag ab busi insur shop assist spite common applic domain retail import aspect retail target compani interest produc effici commerc techniqu data mine cluster profil permit belong technolog repertoir european project torino reason project design shop assist project agent technolog design virtual shop engin group delib approach agent model agent approach agent architectur instanc reason fuzzi rule platform develop europ mention european project object end product short term case kind electron provid user profil shop agent shop assist zeu agent develop bt permit programm develop agent particip market place swedish institut comput scienc market infrastructur develop includ facil sign matchmak negoti artifici intellig research institut spanish scientif research council platform design electron auction develop permit auction strategi programm templat defin agent european research group appli formal techniqu analysi interact dynam logic product engin work remain laboratori research depart compani softwar product orient definit agent applic gener europ mobil agent platform internet mole mobil agent platform develop java fm free platform creation auction product specif orient electron commerc exist research product aim gener product standard commonli share belief europ import produc standard specif environ outcom current research fipa foundat intellig physic agent agenda develop open standard main focu attent secur administr organ care secur featur human custom commerci tool particip electron commerc tool provid effect secur electron commerc receiv global accept individu human custom reason secur threat appli electron commerc system agent mediat electron commerc copi denial spoof masquerad good secur techniqu defend attack access audit public kei infrastructur certif mobil agent acknowledg group research develop agent program roam network collect data order user bui good research effort concentr secur protocol protect agent malici host agent electron monei expir parti provid secur transact made provid anonym transact trust parti secur contract sign project secur transact scalabl internet result obtain mention mole softwar develop stuttgart legal issu privaci compani deliv softwar net percept bundl onlin shop model user prefer essenti agent instruct perform autom mediat task agent face choic establish prefer techniqu model instanc rough set data mine candid profil gener explor project mimic similar approach project determin relev inform european direct regul protect individu regard process person free movement data mislead direct nation law give shape legal framework electron commerc current research project account framework specif manag data agent project give legal assist agent develop project eclip commerc legal issu studi legal implic limit commun internet research develop perspect deduc previou wit agent stage product merchant broker agent mediat electron commerc close relat inform gather short term develop field move step forward involv move real negoti deal make order facilit develop research develop face seri ffl relat ideal actual agent behaviour respect aspect optim ffl relat role agent inher reliabl softwar repres ffl gener interact standard social market certif accept interact trade convent ffl gener servic agent shell gener trade payment contract perform certif interact order give answer challeng research field face basic problem game sociolog commonli believ econom model agent scenario restrict game theoret econom model recommend field theoret model econom valid type probabl scenario electron commerc view techniqu social scienc argu real impact electron commerc dramat chang suppli chain consum contact directli produc produc effici distribut chain effici produc custom price electron commerc wit creation electron version book cd direct relat custom produc permit massiv agent technolog suppli chain permit market market chang permit particip player clear applic short trade good commod consumpt estim advanc trade amount trade occas small imposs imagin manual trade softwar agent mandatori order applic research result fast market auction futur similarli happen auction main type auction made protocol agent interact auction agent equip seri parametr bid strategi agent technolog suffici permit auction academ exampl auctionbot fm european project deliv product support auction year negoti auction limit type product flexibl interact gener type interact understood wide form process group agent commun mutual accept agreement witt real applic gener ecommerc tool provid possibl envisag agent initi explor set author sign contract agent pass inform number final contract agent make applic electron commerc applic fulli autom ffl interact fast instanc bandwidth trade time back user trade round ffl interact repeat high commun domain learn agent user behaviour effect area fall ffl trade rel small transact small monitor process stop automat trade time loss import stress import small compani complet small privat end consum impli busi busi set ffl process repeat long time reason order justifi invest train automat agent learn custom prefer highli desir explicit prefer elicit time consum busi ffl product easi number tradit difficult comput scienc problem pose major difficulti negoti complex object problem relat semant commun relat prefer elicit simpli time consum tune huge number paramet challeng futur agent mediat negoti ffl trust aspect requir attent research gener system refer reliabl commun channel particip authent safe payment deliveri attent gener electron commerc system cover negoti phase broker contact buyer seller strict protocol total control institut act broker robust trust mechan direct contact buyer structur reput achiev extern review gener peer ebai amazon auction system vulner manipul review substanti avoid review open agent trust issu actual bui sell import role plai chamber commerc concept electron chamber commerc explor softwar technolog group consult limit chamber commerc plai increasingli import role mediat tremend experi tradit trust guarant act catalyst electron scenario ffl protocol engin convent commun strateg level agent signal type negoti problem face size negoti protocol follow ffl prefer model model prefer essenti give agent capabl act user model negoti challeng face correspond model model prefer reveal import aspect strategi line research data fuzzi logic cite profil case base reason techniqu approach futur challeng dynam prefer interest prefer consum chang time ai approach induct modal logic increasingli deal challeng ontolog provid custom ontolog product interest reason techniqu model match provid custom move requir common ontolog fuzzi prefer mean clear cut fuzzi fuzzi logic statist model user prefer techniqu explor learn order construct model user prefer direct queri develop techniqu observ user behaviour present product make suggest ffl problem solv simpl offer negoti protocol order persuad acquaint argument support protocol permit critiqu argument reason model gener undercut model prefer argument adapt area electron commerc protocol question investig dialogu set establish balanc fix protocol free dialogu remain open envisag smooth transit type free type interact mid long term rang agent negoti protocol interact order studi wai protocol knowledg good bad protocol argument mean convinc acquaint protocol follow econom choic protocol fundament import deal end argu seek advic specialist agent protocol follow challeng research line applic travel agenc retail industri primari applic domain benefit agent technolog retail industri obtain model compar present order busi answer question effici larg present product tree structur find user guid user site agent answer search guid navig number applic develop year agent mediat auction gener trade negoti travel packag applic retail agent develop uk otto germani special interest agent interact public administr european union long tradit citizen interact public administr ida data programm aim enabl eu agenc interchang administr electron procur programm project build virtual suppli chain sme particip public procur intermedi mean autonom agent element support framework programm agent procur cost procur recept offer process govern procur achiev web plan move procur futur procur system won challeng inform societi engin practic point common agreement agent necessarili adapt mobil long essenti issu model creation virtual enorm varieti legal issu commun face crucial upcom year point view engin crucial point agent market market open open market interact agent specif design owner market open market owner simpli result interact protocol agent locat exchang inform offer develop base close market issu privaci trust quickli move engin agent server implement open market full autonomi open market buyer reluct permit agent sign contract agent complet market control vendor make busi research institut impact agent technolog north human interact guid provid structur everydai life institut repres rule game includ form constraint human shape human interact establish stabl structur human interact core issu institut agent desir similar mechan shape agent interact design infrastructur open agent adopt mimet strategi borrow adapt social mechan proven valuabl emploi articul human societi characterist desir model agent trust except handl societ chang human societi deal issu deploi institut determin permit individu sever punish evolv alter human strang point contact sociolog comput scienc import specif develop multiag system product system gener applic product merchant broker product place agent incorpor negoti capabl offer integr servic electron bank possibl transfer storag product standard standard crucial engin system clear advanc futur direct studi updat profil standard order incorpor idea cover european direct privaci softwar custom requir softwar compliant respect de facto standard scene recent incorpor big player sun ibm make natur focu attent agent develop fipa omg recent order effort secur electron commerc transact refer commod secur high good object trade electron mean autom trade agent depend secur softwar provid includ strategi agent agent perform tent agreement human secur prefer import issu order trust trade platform protocol outstand ongo direct challeng ffl definit secur level interact protocol negoti secur level ffl public kei server signatur assign manag agent manag system ffl trust broker agent architectur anonym custom access compani agent legal issu privaci market inform particip inform protect develop electron commerc satisfi requir eu direct privaci intern standard compliant direct vision expect face basic challeng put custom heart busi inform custom order carri agenten wit area heart busi deliveri retail seri technolog develop econom produc dramat impact agent electron commerc ffl mobil devic comput industri slowli approach comput devic individu wit begin centuri devic worn individu electron commerc adapt instanc agent prefer warn close shop instruct close urgent deal dinner agent technolog central permit ffl context percept big challeng technolog detect context human complement profil user user context permit intellig interact trade agent human wed mobil devic detect restaur automat switch mode receiv messag urgent interrupt pda mobil devic offer tomato usual interest close deal move restaur receiv import learn behaviour context essenti techniqu ffl process face end area open enorm possibl interact player area recent popul compani develop mechan interact rule case area negoti characterist mention paper fulli telecommun power expect lot market permit interact particip market ffl disappear comput voic emot mood detect mechan essenti improv percept capabl comput devic year capabl comput infrastructur distribut network build possibl cheap comput devic electr applianc good item open world potenti applic electron commerc devic connect awar local retail satisfi owner negoti applianc consum power negoti power provid order minim power bill acknowledg roadmap built opinion idea particip sig meet london barcelona year agentlink network excel potenti mistak error sole author im special grate contribut written materi form posit lar marku fredrik walter van de veld refer project url auctionbot url bath url url bt lab url project url cambridg consult limit url build electron marketplac zeu agent toolkit agent mediat electron noriega lnai springer pp url ed studi social simul url ed practic applic intellig agent technolog direct european council octob protect individu regard process person data free movement data publish nov scheme anonym electron commerc secur intellig trade agent confer ai pp ab url sic market infrastructur agent mediat electron noriega lnai springer pp yahoo url compani manag suppli onlin negoti function autonom agent robot autonom system url mobil inform agent vol lnai ed artifici comput simul social life ucl url hp lab url url iiia url version url imperi colleg url intellig agent manag busi vol pp design test negoti protocol electron commerc applic forthcom public negoti evolutionari approach pp mole url negoti principl john pp ed institut chang econom perform cambridg univ agent advanc featur negoti electron commerc virtual format process forthcom public url model spanish fish market report agent mediat electron noriega lnai springer pp agent reason negoti argu journal logic comput url ed negoti behavior academ yahoo reput url consum trade agent electron auction market ai commun sic url negoti model autonom agent lnai springer pp universita di torino trade direct url url trust url amsterdam url treur url url
ML/352 6 fuzzi cluster identif fuzzi model robert ferenc depart process po box hungari delft depart inform technolog system control system engin ga netherland abstract construct interpret fuzzi model mean cluster address shown fuzzi set consequ paramet ts model deriv cluster obtain algorithm preserv partit linearli transform input variabl model complic interpret rule form easili interpret model transform input cluster algorithm base expect maxim identif gaussian mixtur model techniqu appli benchmark mpg predict simul nonlinear process obtain result compar result literatur introduct fuzzi identif effect tool approxim uncertain nonlinear system basi measur data fuzzi model model attract attent model consist rule fuzzi mathemat function consequ part fuzzi set partit input space number fuzzi consequ function describ behavior region construct ts model step fuzzi set rule determin knowledg techniqu paramet consequ function estim function chosen linear standard linear method appli bottleneck construct procedur identif membership nonlinear optim problem optim techniqu inher drawback optim sensit choic initi paramet easili stuck local obtain model poor gener optim fuzzi rule initi mean valid local linear model system hamper posteriori interpret optim ts model altern solut nonlinear optim algorithm genet algorithm prove construct fuzzi system sever comput requir limit applic rapid develop tool fuzzi cluster cartesian input output tool obtain membership function attract featur approach simultan identif membership function consequ local linear model implicit regular cluster fuzzi set initi model directli project individu variabl gener difficult interpret fuzzi project fuzzi set prefer project approxim defin membership function parametr deterior perform model due type decomposit error approxim error decomposit error reduc eigenvector project membership function result overfit poor gener identifi model cluster algorithm wide method gg paramet univari membership function directli deriv paramet cluster linear transform input partit accur captur decomposit error occur result model transpar hard interpret linguist term defin linear combin input variabl form easili interpret model reli transform input cluster algorithm base expect maxim identif gaussian mixtur model mixtur model data origin mix popul em algorithm wide estim paramet compon mixtur cluster obtain gg cluster multivari gaussian function altern optim cluster ident em identif mixtur gaussian model fuzzi weight expon cluster prototyp easili repres interpret fuzzi model similarli fuzzi cluster altern optim method emploi search cluster techniqu demonstr mpg predict problem nonlinear benchmark process obtain result compar result literatur shown modifi algorithm good predict perform interpret model improv rest paper organ section ts fuzzi model present section iii describ cluster identifi ts fuzzi model section modif cluster algorithm section present applic exampl section vi ii fuzzi model nonlinear regress identif unknown nonlinear system base data xk index denot individu data sampl difficult find model describ unknown system construct local linear model select oper point model framework base combin local model valid predefin oper region call oper model model gener bi valid function ith oper regim paramet vector local linear model oper regim repres fuzzi set case fuzzi model obtain ri multivari membership ai bi paramet local linear wi weight rule wi chosen design fuzzi system repres belief accuraci rule knowledg wi proposit express logic combin proposit univari fuzzi set defin individu compon conjunct ri xn fulfil rule calcul product individu membership wi rule aggreg formula bi ts fuzzi model oper model valid function chosen normal rule gaussian membership function repres fuzzi set center σ formula exp σ varianc gaussian curv choic lead compact wi exp xx vj center vector denot vx matrix varianc xx σ σ σ iii fuzzi model identif base cluster data sampl collect matrix form concaten regress data matrix output vector yn observ column vector zk data set partit cluster assum base prior instanc method estim optim context system result fuzzi partit matrix element repres membership observ zk cluster cluster shape obtain definit cluster prototyp linear distanc measur cluster algorithm appli identifi ts model main drawback algorithm cluster approxim equal volum properli identifi result cluster directli univari parametr membership function circumv paper algorithm appli cluster volum restrict lower approxim error relev consequ paramet obtain cluster found cluster tain gg cluster transform exponenti membership function defin linearli transform space input variabl probabilist interpret cluster cluster algorithm interpret probabilist framework denot uncondit cluster probabl fraction data domain influenc multivari gaussian term vi covari matrix fi algorithm identif mixtur gaussian model probabl densiti function expand sum cluster distribut gener cluster repres gaussian function exp gg joint densiti variabl model mixtur multivari gaussian function condit densiti mixtur gaussian model regress problem formul basi probabl paramet vector local model obtain probabl gaussian compon gener regress vector xx exp vx xx xx exp vx vx obtain partit covari matrix fi xy yy xx row column xy column vector element column row vector element row yy element row fi construct membership function mixtur model defin fact kind oper model valid function chosen model ts fuzzi model rule weight wi membership function gaussian defin necessarili diagon form decomposit univari fuzzi set univari membership function requir interpret decomposit approach base project approxim typic introduc decomposit global estim consequ paramet interpret local linear model rule consequ longer local linear nonlinear system approach exact base eigenvector project call transform approach denot eigenvalu eigenvector xx eigenvector fuzzi model obtain transform input ri bi transform input variabl gaussian membership function exp cluster center vx varianc estim consequ paramet method estim paramet local linear consequ model weight total squar weight ordinari squar ordinari estim ordinari weight method appli estim consequ paramet rule minim min xe matrix extend column matrix membership main weight estim consequ paramet xe obtain cluster covari matrix directli obtain estim ai xx xy directli properti estim total estim bi cluster local approxim regress linear subspac regress space smallest eigenvalu cluster covari matrix fi typic order magnitud smaller remain eigenvalu eigenvector ti normal vector hyperplan span remain eigenvector similarli observ vector prototyp vector partit vi vector vx scalar output eigenvector partit ti partit written paramet hyperplan defin cluster vi bi paramet deriv geometr interpret shown weigh total estim consequ data point weigh membership tl algorithm error input variabl tl algorithm minim predict error ordinari algorithm input variabl model local strongli smallest eigenvector defin hyperplan relat regress reflect depend input variabl iv modifi cluster discuss section main drawback construct interpret fuzzi model cluster cluster gener fuzzi covari matrix xx decomposit error made project circumv fuzzi cluster method section expect maxim base fuzzi cluster regress cluster input local model output input uncondit gaussian defin domain influenc cluster similarli multivari membership function output distribut xx exp vx xx exp xt xt transpar interpret model cluster covari matrix xx reduc diagon element similarli simplifi version cluster algorithm exp identif model mean determin cluster vx expect maxim identif model algorithm form fuzzi cluster σ basic em observ valu random variabl model densiti model η em algorithm obtain estim maxim likelihood iter current cluster paramet assum correct base posterior comput posterior probabl interpret probabl piec data gener distribut condit probabl current data distribut assum correct paramet cluster maxim likelihood data sought uncondit probabl mean weight covari matric comput xx vx vx order find maxim paramet local linear deriv set equal ln ln repres local consequ xk equat result weight identif local linear model weight matrix standard deviat calcul standard deviat paramet distribut function defin σ modifi fuzzi cluster identif ts model em algorithm provid easili implement similar identif ts fuzzi model transform input domain initi data set weight expon termin toler ɛ initi partit matrix hold repeat iter step calcul paramet center membership vi standard deviat gaussian membership paramet local µ xk µ µ weight collect matrix priori probabl cluster weight step comput distanc measur µ xe wi distanc measur consist term distanc cluster center quantifi perform local linear exp step updat partit matrix µ ɛ exp σ applic exampl identif problem consid automobil mpg predict benchmark identif simul nonlinear dynam system literatur method cluster total estim consequ paramet cluster weight ordinari estim consequ paramet method transform input variabl method origin input variabl cluster method sensit differ numer rang data normal unit varianc automobil mpg predict goal predict fuel consumpt automobil basi model data set obtain uci repositori machin learn domain theori remov sampl miss data set reduc entri data set divid train set test sampl perform model measur root squar predict error approxim power identifi model compar fuzzi model number rule obtain matlab fuzzi toolbox model fuzzi model identif toolbox base cluster input ts fuzzi model model year featur number neglect cluster algorithm run numer problem featur small number discret valu fuzzi model rule identifi method cluster method achiev valu train test perform model toolbox similar valu train test data result obtain gave overtrain model train data test data result cluster method good gener properti comparison give result linear regress model linear model paramet input variabl variabl number train test model fuzzi model input variabl select featur model structur mpg model captur correl input ts fuzzi model extract cluster multivari membership ri ai bi transform input ri bi estim mpg model easili interpret valid human fuzzi set defin linearli transform space method result standard rule origin variabl conjunct ri weight year bi tabl compar predict perform obtain tabl comparison perform identifi ts model input variabl method rule rule rule rule present identif sensit normal data tabl denot result obtain make identif normal data model perform train data improv number perform evalu data improv effect start degrad varianc squar method train error larger model complex input variabl model strongli correl smallest eigenvector defin hyperplan relat regress reflect depend input variabl differ small eigenvalu small eigenvalu cluster fuzzi cluster method show slightli perform algorithm method identifi fuzzi model transform input good perform effect partit input figur algorithm present section yield cluster rotat input space figur cluster project easili interpret membership function defin individu featur shown figur model figur model reduc flexibl result predict perform demonstr perform interpret differ perform turn neglig tabl fuzzi toolbox matlab fuzzi model identif box identifi fuzzi model mpg predict problem tabl year year membership membership weight fig cluster detect gg cluster algorithm weight fig cluster detect modifi algorithm weight year fig membership function obtain method obtain fuzzi model good perform compar altern techniqu weight model year displac fig membership function ts model mpg predict base input result model good extrapol predict surfac model input shown figur surfac compar predict surfac gener model model estim higher mpg heavi car lack data due tendenc manufactur begin build small compact car mid figur obtain model suffer problem identif nonlinear system mpg weight fig predict surfac model system studi nonlinear system year approxim nonlinear compon plant fuzzi model approach simul data point gener plant sampl identif data obtain random input signal uniformli distribut sampl evalu data obtain sinusoid input signal simul data shown figur input model xk fig simul output plant input signal tabl ii compar perform squar model identifi techniqu tabl ii fuzzi model nonlinear dynam plant rule rule method train set test set train set test set predict surfac oper regim local linear model fuzzi model method result optim consequ paramet compar result obtain optim rule select approach yen wang method inform criteria success select rule initi set rule order obtain compact accur model initi rule base obtain partit input equal distribut fuzzi set rule select order determin orthogon transform linear rule consequ optim fuzzi model rule achiev squar error train data evalu data base conclud model approach capabl obtain good fewer rule approach present literatur vi applic fuzzi cluster identif fuzzi model address method extract ts fuzzi model fuzzi cluster obtain cluster present result fuzzi model base transform effect partit fig surfac plot ts model data sampl shown black dot φ fig oper regim obtain input time hamper interpret model form transpar model reli transform input variabl cluster algorithm account correl input variabl model perform model techniqu demonstr benchmark literatur cluster algorithm cluster algorithm present base minim sum weight squar distanc data point zk cluster µ cluster center weight expon determin fuzzi result cluster chosen fuzzi partit matrix satisfi minimum sought altern optim method initi set data weight expon termin toler ɛ initi partit matrix hold repeat step calcul cluster center step comput distanc measur µ zk µ distanc prototyp calcul base fuzzi covari matric cluster distanc function chosen priori probabl step updat partit matrix µ ɛ µ zk zk µ exp zk zk acknowledg support hungarian ministri cultur educ hungarian scienc foundat greatli acknowledg grate support research fellowship hungarian academi scienc refer local global identif interpret paramet fuzzi model ieee intern confer fuzzi page san fuzzi model control kluwer academ hb construct fuzzi model product space cluster fuzzi model select page jc jc dunn optim fuzzi heurist estim paramet mixtur normal distribut ieee transact page cm bishop neural network pattern recognit oxford nr draper smith appli regress edit john wilei ab optim fuzzi cluster ieee transact pattern analysi machin model analysi de wc fuzzi cluster fuzzi covari matrix ieee page san editor fuzzi model select approach fuzzi cluster analysi method data analysi imag nition john wilei jang input select learn ieee intern confer fuzzi system soft comput approach learn machin upper saddl jang ct sun model control jin fuzzi model system ieee transact fuzzi ta johansen identif fuzzi model paramet preprint world juli ta interpret identif fuzzi model ieee tion fuzzi local model gaussian mixtur model statist data process phd oregon gradual institut scienc park transform approach fuzzi model ieee transact fuzzi ta editor multipl model approach nonlinear model control taylor ja compact fuzzi model complex reduct evolutionari optim proc ieee tional confer fuzzi page san sugeno gt kang fuzzi model control fuzzi set sugeno approach qualit model ieee transact fuzzi takagi sugeno fuzzi identif system applic model control ieee transact man yen wang applic statist inform criteria optim fuzzi model construct ieee transact fuzzi
DB/353 3 execut queri pack ilp hendrik blockeel luc dehasp bart demoen janssen jan ramon henk report cw katholiek universiteit leuven depart comput scienc execut queri pack ilp hendrik blockeel luc dehasp bart demoen janssen jan ramon henk report cw depart comput kuleuven abstract induct logic program system send larg number queri lattic structur queri typic select queri highli similar independ execut queri involv lot redund comput mechan execut hierarch structur set queri lot redund comput remov incorpor queri pack execut mechan ilp system tild implement prolog engin support pack execut lower level result demonstr effici gain queri pack execut mechan gener natur incorpor ilp similar effici improv expect keyword induct logic machin data mine classif primari secondari introduct data mine includ ilp emploi approach basic larg number gener test order check valid search hypothesi space seldom exhaust practic clever greedi search strategi number gener test approach huge true complex hypothesi space case ilp hypothesi space structur search space make lattic close lattic comput involv test valid similar comput perform execut queri perform execut queri store intermedi result comput solut tabl xsb prolog engin practic memori requir feasibl search intermedi result shortli achiev extent rearrang comput remov execut strategi queri comput effect share paper discuss strategi execut set queri avoid redund comput strategi present adapt standard prolog execut mechan report techniqu induct logic program system result suggest case order magnitud achiev significantli contribut applic induct logic program real world data mine task remaind paper structur section describ ilp problem set work set section defin notion queri execut standard prolog interpret comput redund algorithm execut queri pack avoid redund comput section describ queri pack execut strategi incorpor exist induct logic program algorithm section present result give indic system achiev queri pack execut mechan section relat work mention section conclud problem set problem set set conjunct queri deduct tupl variabl occur queri find set succe find queri instanti queri succe refer tupl intuit uniqu identifi singl context learn singl predic kei typic consist variabl occur head learn assum ilp system learn definit evalu exampl form set uniqu identifi ground substitut tupl mean put problem set prolog queri kei queri find coupl result set defin find fact predict problem set gener cover task typic encount ilp set queri succe statist queri readili obtain discoveri frequent queri number kei succe induct horn accuraci comput result set induct classif regress comput class entropi varianc exampl cover queri involv simpl comput count similar problem set return inform system practic avoid comput result set updat relev counter set effici result obtain applic system avoid comput overhead inform true true fig queri pack queri pack definit definit queri pack tree structur liter conjunct liter node path root node intern repres conjunct queri queri member queri pack set queri pack shown fig queri member repres pack prolog term denot queri pack textual write oper node oper intuit close correspond disjunct queri pack construct execut complex prolog queri reflect tree structur pack separ children node separ node set answer substitut queri union set answer substitut member pack execut pack manner remov lot redund show set repres complex comput evalu queri separ impli comput queri call queri respect answer substitut associ zs singl altern valu gener call interest answer substitut singl answer substitut suffic altern cut note cut surviv backtrack backtrack yield branch avoid succe kei reconsid execut mechan implement ineffici manner preliminari result suggest overhead involv implement destroi effici gain obtain redund reduct fulli exploit share comput level prolog engin effici execut queri pack solut effici execut queri pack effici consist extens wam abstract machin underli prolog implement extend wam oper discuss perman remov branch pack investig anymor extend wam basi prolog engin dedic induct logic call start point queri pack execut mechan usual prolog execut queri prolog program backtrack prolog gener solut give instanti succe queri pack consist conjunct conj liter set branch queri pack note leav queri pack empti set branch queri pack denot conjunct denot set branch queri pack repres set queri execut queri pack aim find queri pack succe queri pack execut usual backtrack occur queri success detect avoid part queri pack longer consid backtrack queri succe algorithm report success queri queri point higher queri pack queri pack safe remov queri depend queri queri leaf set success suffici remov depend wait depend queri report success queri pack report success start evalu root queri set branch queri pack branch queri pack queri pack remov set valu due backtrack queri pack execut case fewer branch consid execut queri pack defin algorithm execut addit control usual prolog execut usual prolog execut backtrack behaviour model loop gener solut oe conjunct queri pack solut fail return backtrack occur level call queri pack addit control manag solut branch execut import notic initi set branch queri pack chang destruct execut algorithm leaf success return branch remov queri pack queri pack initi final end empti set branch queri pack remov fact branch destruct impli due backtrack queri pack execut branch execut return success backtrack current queri pack conjunct branch report success queri pack fig show algorithm make pack execut mechan comput result set defin problem statement queri pack queri deriv pack construct ad report liter leaf task report simpli add qn qn queri execut predic evalu current implement result set implement index queri exampl implement feasibl typic comput long number queri pack multipli number exampl hold current ilp applic execut pack substitut oe child execut child fq child empti fig queri pack execut algorithm exampl pack kei leaf add report conjunct leaf increment compil evalu fig queri pack comput result set dynam load execut ilp system interest result set provid report predic avoid overhead explicitli build result set note algorithm strategi run queri singl move call outer outer strategi ilp system outer strategi import advantag process larg data comput complex lower upper bound speedup factor achiev execut pack separ queri obtain pack queri time comput answer substitut obtain failur part spent part spent repres total time execut queri execut pack introduc show speedup factor bound branch factor ratio comput complex share part comput complex part assumpt constant branch factor comput liter depth pack domin speedup factor approach depth pack queri pack execut ilp system section briefli describ exist ilp algorithm show execut method includ algorithm improv effici refin singl rule algorithm discuss algorithm build tree node liter conjunct liter node node path root form queri run decid sort build liter conjunct put node chosen queri path root gener refin queri refin queri form ad liter evalu refin data set inform gain yield put liter ad origin form refin node point clear lot comput redund exist refin evalu separ refin liter ad singl refin step refin queri obtain queri pack essenti level root immedi branch tild lookahead facil refin form lattic queri pack multipl level note root pack consist conjunct give pack form liter root greater benefit queri pack execut expect assum node refin queri node cover exampl circl left object object queri pack gener refin instanc evalu backtrack root pack happen refin evalu queri queri prolog engin search object fulfil constraint execut pack search system tild system induct logic program algorithm consist repeatedli refin system principl rewritten make queri pack evalu mechan achiev effici gain system perform search refin progol order consid hard comput level node list open node produc evalu refin involv execut replac pack execut principl perform level refin ad part effici pack execut mechan exploit larger extent effect domin depend refin refin point gain execut loss effici refin pack speedup achiev expand expand evalu fig sequenc queri pack refin left queri pack result pack remov queri found infrequ pack evalu result bottom left pack level ad queri step produc bottom pack iter evalu continu pack empti frequent pattern discoveri altern famili data mine algorithm scan refin lattic manner queri frequenc exce threshold instanc algorithm apriori method find frequent ilp variant base apriori queri pack correspond store subgraph total refin lattic level path root level subgraph correspond frequent pattern path root leav depth correspond candid frequenc comput queri pack exploit massiv similar candid make evalu effici essenti algorithm start empti queri pack iter pack evalu pack extens figur achiev ad potenti frequent refin leav ad level total refin lattic evalu goal evalu empir investig actual speedup obtain ilp system refin found infrequ queri frequent prune pack execut mechan moment exist tild experi attempt quantifi speedup pack wrt separ execut total speedup yield ilp system tild comparison implement tild wai tild run normal implement queri gener evalu relev exampl implement queri repres evalu queri involv prolog outer implement exampl consid queri run call previou involv disjoint execut queri pack execut queri pack put common part share queri comput redund execut pack execut queri main differ case queri compil pack execut queri pack execut queri share set turn slowest attribut fact queri compil execut interest obtain compar differ pack execut disjoint execut accur effici gain obtain redund remov blur effect implement differ pack execut origin implement idea net effici gain account implement remaind section focu time set provid inform total time build record time compil load queri time execut exclud time comput statist result set retriev queri evalu net speedup tild due queri pack total time compar disjoint pack execut execut time setup measur time tild dataset simpl classif theori exist exampl setup true classif theori small size exist case tree remov influenc tree size induct time case differ tree size set implement select test multipl test qualiti give rise differ tree size observ earlier implement report tree size tabl case small differ size observ tree induc set size pack depend refin gener vari set tild lookahead paramet gener largest tabl overview result obtain setup tabl similar overview setup total induct time execut time pack compil pack execut interest observ compar total net speedup factor obtain speedup larger larger pack gener lookahead compar execut time disjoint pack speedup factor obtain larger pack yield larger speedup subtract compil time total induct disjoint execut approxim fast origin outer outer net effect pack yield import gain individu total induct time vari number exampl set confirm affect complex learn algorithm depend number exampl run experi mutagenesi data set tabl queri pack larger data lookahead largest pack queri larg pack amount time spent compil larg net speedup specif case factor high speedup obtain case complex gener variabl liter share larg proport data set problem relat research pattern recognit introduc ilp benchmark la tree size origin disjoint pack speedup ratio total comp exec total comp exec net exec exampl exampl exampl exampl exampl tabl statist tree built tild function lookahead set set disjoint pack report time total time build time spent compil pack time spent execut time measur tree size node total induct time spent highest speedup factor expect complex comparison engin prolog compar perform exist effici gain achiev queri pack execut offer offset effici implement engin tild run data sicstu engin implement tild engin engin set tabl show result tabl effici pack execut mechan remark made leuven ilp system origin implement implement make builtin prolog system put advantag compar construct effici improv la tree size origin disjoint pack speedup ratio total comp exec total comp exec net exec exampl exampl exampl exampl exampl tabl statist tree built tild function lookahead set set disjoint pack report time total time build time spent compil pack time spent execut time measur tree size node engin expect compil produc nativ code compil experi experi suggest time unstabl wrt implement respect dynam assert result grain salt implement engin normal implement outer queri gener evalu outer implement queri level gener put pack evalu implement give execut time la tree size origin disjoint pack speedup ratio total comp exec total comp exec net exec exampl exampl tabl time mutagenesi tabl run end time time consum moment sicstu tabl compar engin dataset mutagenesi languag bia chosen gener limit number refin small branch factor search gener queri pack deep narrow tabl number queri level result tabl execut time mutagenesi maxim search depth vari level result interest show behaviour observ tild speedup factor bare depth contrast tild larger pack yield higher speedup sight found observ made refin pack pack ad prune branch lead infrequ queri effect ad level widen pack lowest level pack typic leav previou narrow pack speedup obtain mutagenesi level queri frequent queri tabl number queri mutagenesi experi level pack pack pack speedup ratio exec total exec total exec total net exec tabl result mutagenesi pack larg depend branch factor speedup factor expect narrow effect stronger effect suspect effect approxim equal strong anticip behaviour deserv investig summari result experi confirm queri pack execut effici execut highli similar queri exist ilp system tild mechan achiev speedup factor prolog engin achiev current state develop engin advanc engin queri pack mechan compet differ effect pack execut tild prompt investig influenc size shape pack effici gain obtain relat work tild relat work describ outer strategi tree induct queri pack execut prolog execut point counterpart apriori mechan count idea set queri individu queri exist tsur al describ algorithm effici execut queri flock context queri pack execut queri flock execut mechan inspir apriori set deduct context main differ queri pack queri flock queri pack hierarch structur queri pack similar queri flock flock repres singl queri placehold equal set queri obtain instanti placehold constant flock applic lot redund comput perform ilp system paper identifi sourc redund method avoid execut queri discuss queri pack execut incorpor ilp system queri pack execut mechan implement prolog system call dedic data mine ilp system reimplement make mechan evalu result experi confirm larg speedup obtain conjectur queri pack execut mechan incorpor ilp system similar speedup expect problem set queri pack execut introduc techniqu kind task queri execut long queri hierarchi futur work includ improv engin implement techniqu suitabl engin handl larg data set interest issu port queri pack execut mechan context relat lot work commun singl set queri case hope combin effici comput perform comput share mechan result significantli effici larg mine acknowledg hendrik blockeel fellow fund scientif research luc dehasp fellow kuleuven research fund jan ramon fund flemish institut promot scientif research industri henk support languag author luc de raedt influenc srinivasan suggest term refer ai verkamo fast discoveri associ rule advanc knowledg discoveri data page mit blockeel induct order logic tree phd depart comput katholiek universiteit blockeel de raedt lookahead discret ilp intern workshop induct logic volum lectur note artifici page blockeel de raedt induct order logic tree artifici june de demoen scale induct logic program learn interpret data mine knowledg pattern recognit chen warren tabl evalu delai gener logic program journal januari de raedt logic set concept learn artifici de raedt van induct constraint logic klau takeshi thoma intern workshop algorithm learn volum lectur note artifici page dehasp toivonen discoveri frequent datalog pattern data mine knowledg bart henk execut queri flock ilp eleventh workshop logic novemb page rissanen fast scalabl classifi data mine intern confer extend muggleton entail progol gener ross quinlan program machin learn morgan kaufmann seri machin learn morgan sh king compar background knowledg induct logic program system de intern workshop induct logic dick jeffrei serg chri rajeev rosenth queri gener mine acm sigmod intern confer manag data volum acm sigmod page june acm press
Agents/354 1 proof tempor logic knowledg dixon michael fisher depart comput mathemat manchest metropolitan manchest uk abstract tempor logic knowledg order complex system agent dynam inform surround present resolut method proposit tempor logic combin illustr exampl paper correct previou resolut tempor logic knowledg tempor modal introduct combin logic reason complex system accid analysi secur protocol logic system incorpor dynam compon repres chang inform compon captur agent knowledg motiv compon notion desir intent tempor dynam logic dynam modal logic repres knowledg modal logic kd intent area combin logic focu current research interest verifi properti specif combin logic proof method compar effort devot proof method combin logic resolut base method linear time tempor logic finit past infinit futur singl copi modal logic tableau algorithm version logic combin present tableau base proof method belief desir intent logic linear branch time tempor logic modal logic found vardi al provid complet tempor logic knowledg complex issu paper outlin resolut base proof method proposit linear time tempor logic logic work extens work end made extens version fact achiev paper show multimod extens provid carri separ inform modal dimens interact logic resolut compon carri formula involv disjunct liter carri inform compon proof tempor logic hard due interact futur moment encod simpl valid complex tempor resolut rule requir deal complex satisfi pspace combin interact structur paper syntax semant tempor logic knowledg normal form logic present relev set resolut rule illustr problem version present correct argument outlin relat work tempor logic knowledg give syntax semant logic kl tempor logic knowledg modal relat restrict relat logic kl halpern vardi syntax formula construct set primit proposit languag kl standard proposit connect knowledg assum set agent ag ng introduc set unari modal connect ag formula oe read tempor dimens usual set connect weak interpret connect discret linear model time finit infinit obviou choic flow time natur number order usual relat assist reader unfamiliar semant tempor oper oper basic altern provid syntax semant subset oper introduc remaind abbrevi formula kl construct connect proposit ffl set proposit ffl constant ffl proposit connect ffl tempor ffl modal connect set formula kl defin ffl element ffl true ffl au aw ag defin class formula definit liter proposit definit modal liter liter semant assum world state definit infinit discret sequenc index natur number note timelin correspond run halpern vardi set timelin definit pair timelin tempor index point set point definit function point ft fg definit kl structur ffl tl set distinguish timelin ffl ag agent access relat point point ffl valuat defin semant languag satisfact relat relat hold pair form hm pi model kl rule defin satisfact relat hm true hm hm iff hm iff hm oe hm oe iff hm oe hm hm oe iff hm oe hm hm oe iff hm oe hm hm oe iff hm oe hm oe iff hm oe hm oe iff hm oe hm oe iff hm hm oe hm oe iff hm oe hm oe hm oe iff tl hm oe satisfi valid kl defin usual agent access relat kl model axiom normal modal system valid kl model oe oe oe oe oe oe system wide logic reason kl term tempor logic knowledg liter modal liter disjunct liter modal liter normal form tempor logic knowledg formula kl transform normal call separ normal form kl basi resolut method paper tempor logic introduc extend tempor logic tempor logic assist definit normal form introduc connect hold begin hm start iff gener form normal form implic altern disjunct liter part normal form repres hold begin time formula gener form rule form relat defin term oper defin oe oe common knowledg defin maxim fixpoint formula oe oper defin maxim fixpoint oe rule form start initi step true true true liter liter modal liter involv modal oper rule disjunct modal liter rule modal rule outer oper surround conjunct rule omit conveni conjunct drop set rule translat translat renam techniqu complex subformula replac proposit truth proposit link formula replac state tempor oper replac fixpoint definit reduc number tempor oper core set detail translat normal form note modal rule disjunct modal true rewrit restrict normal form present requir addit renam step rule renam formula proposit obtain rule true true ensur modal rule modal liter oper merg appli tempor resolut rule step rule combin variant call defin set rule rule rule rule combin produc rule conjunct combin rule repres resolut tempor logic knowledg resolut rule present split initi modal step resolut tempor resolut type resolut variant classic resolut tempor extens resolut formula initi resolut liter rule resolv initi rule true start start disjunct liter initi rule resolv start start start modal resolut modal resolut appli rule base modal resolut system introduc gener appli resolut rule liter modal liter modal rule relat modal oper rule firstli resolv liter modal liter negat rule appli true true true resolv formula negat essenti appli axiom obtain negat true true true axiom resolv formula give rule rule liter true true true rule involv push extern oper rule rule liter true true true mod mod defin definit defin function mod defin disjunct liter modal liter mod mod mod mod mod mod resolut rule requir explan implicit oper surround rule oper resolv rule rule distribut extern implic resolv adjust disjunct rule show distribut detail hand side rule rewrit implic recal modal rule surround implicit oper rule rewritten disjunct modal liter liter resolv hand side implic obtain rewrit disjunct theorem delet disjunct modal liter obtain requir resolv final requir rewrit rule obtain set liter rule step tempor resolut true true disjunct liter step resolut resolut consist applic standard classic resolut formula repres constraint moment simplif rule transfer contradict state constraint previou state simplif subsumpt rule appli pair step rule resolv rule liter rule resolv step rule true contradict state rule gener extra global constraint true rule state satisfi moment time contradict satisfi moment time constraint repres rule call defin similar rule found redund omit appli rule obtain rule resolv obtain deriv resolv simplif subsumpt left hand side rule simplifi iff iff rule remov simplif repres valid subformula contribut gener contradict true rule valid valid true satisfi subsumpt form part step resolut process classic rule remov subsum rule present subsumpt express oper ae oe fd bg side condit hold subsumpt step appli rule delet lose inform termin cycl modal step resolut termin resolv deriv form start tempor resolut tempor resolut aim resolv set rule impli set rule effect gener tempor resolut written infer intuit resolv occur satisfi occur eventu satisfi satisfi ensur moment futur gener resolv sound resolv pair resolv subsum rule resolv leav formula resolv translat interact oper kl make definit rule translat kl remov outer level resolut rule set merg rule impli contradict rule set rule rule form tempor resolut appli rule set merg step forc satisfi tempor resolut rule side condit side condit ensur set rule impli side condit ensur make true moment satisfi side condit ensur hand side mean left hand side rule set satisfi left hand side rule satisfi moment hold left hand side rule satisfi moment time hold left hand side rule satisfi satisfi set rule loop search set rule algorithm detect set rule work rule normal form translat resolv tre obtain rule proposit true true algorithm tempor resolut method kl formula test step perform translat give perform modal step resolut simplif start deriv termin note resolv gener continu step select eventu side search set tempor resolut rule appli resolv subsum detect translat step resolv found termin declar step pure formula comparison resolut system suggest begin illustr formula unsatisfi initi world world model reflex world give contradict show formula translat normal separ relev obtain start true true true proof continu true true true start ir obtain contradict show origin formula unsatisfi show oe valid negat translat start true oe true true true resolut commenc true merg rule obtain resolut rule oe tre true oe true true true true start ir comparison previou version version suggest modal rule possibl modal liter modal true modal rule appli liter modal liter negat extend version true true true equal rule sound due presenc axiom appli modal liter rule rule suggest extens true true true true obviou achiev resolv copi origin rule replac similarli extend version rule true true resolut modal formula translat normal form obtain normal form start true true true appli rule doesnt lead contradict resolv rule introduc variabl true true potenti appli continu altern continu true true true achiev contradict dont origin rule option resolv appli true true true dont obtain contradict dont origin rule demonstr incomplet suggest set rule origin rule addit reach proof step produc resolv appli forev termin problem correct firstli show transform preserv satisfi theorem kl formula satisfi satisfi translat proof analog suffic theorem satisfi set rule set rule obtain applic resolut rule satisfi shown show applic resolut rule preserv satisfi theorem set rule unsatisfi refut tempor resolut procedur paper complet shown construct graph repres model set rule type modal repres tempor dimens node graph pair consist union member set proposit modal oper fk unsatisfi eventu tempor dimens delet graph repres applic resolut rule empti graph correspond gener proof singl modal case theorem tempor resolut procedur appli set rule termin essenti set proposit hand side rule set rule gener appli resolut rule finit resolut algorithm termin deriv relat work translat base method successfulli reason combin modal logic prove modal formula reason directli formula modal logic translat subclass classic logic reason place logic framework translat base approach multimod logic logic extens km axiom found translat base approach modal theorem prove combin tempor reason part resolut method paper rao georgeff tableau base proof method bdi logic combin linear tempor logic modal logic modal logic belief kd desir intent interact modal compon consid tableau method combin consid tableaux method descript logic combin modal implement vardi al combin proposit linear branch time tempor logic varieti interact theorem prove seri paper concentr complex satisfi problem obtain complet system ad axiom axiom complet system synchroni perfect recal system perfect recal set execut agent consid stai time ad interact singl agent case complex valid doubl exponenti time case time theorem prove reifi tempor logic belief consid branch time tempor logic consid includ oper importantli induct axiom mention paper give procedur logic kl method mention correct respect origin modal tempor logic semant discuss issu relat combin logic consid present resolut method multimod tempor logic knowledg extend singl modal tempor logic knowledg present correct suggest extend singl modal version version end paper singl modal formula involv tempor oper involv modal oper separ resolut rule appli compon inform pass logic form disjunct liter extens present separ tempor formula separ formula modal oper resolut rule appli compon separ work verif complex system agent specif languag involv dynam inform compon motiv part collabor develop current work involv implement system ad resolut rule deal interact tempor modal logic kl problem core framework domain accid analysi attempt prove properti specif resolut acknowledg author van der hoek comment suggest work refer de rijk combin modal logic de rijk combin studia fisher clausal resolut method ctl branch time tempor logic journal theoret artifici de translat gf dixon tempor resolut breadthfirst search algorithm annal mathemat artifici wooldridg resolut tempor logic knowledg journal logic fisher resolut method tempor logic twelfth intern joint confer artifici intellig page august morgan kaufman fisher normal form tempor formula eleventh intern confer autom deduct volum lectur note comput page june clausal tempor resolut van der vardi complet axiomat reason knowledg time submit halpern vardi complex reason knowledg time lower bound journal comput system horrock fact system autom reason analyt tableaux relat intern confer volum page fisher normal form proof combin modal tempor logic intern workshop frontier combin system lnai shadbolt resolut theorem prove reifi modal logic journal autom cw johnson applic user model reason human contribut major accid judi seventh intern user model confer page springer verlag system resolut part proposit logic lectur note comput de method modal logic logic journal igpl mechan proof secur public kei technic report comput januari form translat journal symbol septemb rao procedur proposit logic workshop agent page august rao georgeff model ration agent fike knowledg reason page april rao georgeff formal model procedur system technic report australian artifici intellig june sistla clark complex proposit linear tempor logic acm juli van van der ch meyer motiv attitud goal commit intellig agent ii page fisher proof method tempor logic knowledg belief journal appli
ML/355 6 global optim perceptron ga pa comput scienc dept madrid jj dept architectur comput technolog campu de granada gener problem model select obtain paramet make model fit observ data perceptron train backpropag mean find hidden layer initi weight learn paramet paper method attempt solv problem combin genet algorithm bp train mlp singl hidden layer ga select initi weight learn rate number neuron hidden layer applic specif genet oper combin advantag global search perform ga mlp paramet space local search bp algorithm applic algorithm benchmark problem show mlp evolv smaller achiev higher level gener perceptron train evolut show improv previou version algorithm introduct state art applic artifici neural network design layer correctli initi paramet establish train bp version wide train exampl includ braun evolutionari base approach whichev method train mechan iter gradient descent algorithm design step step minim differ actual output vector network desir output vector method successfulli pattern due learn encount difficulti converg extrem converg global optimum learn constant guess heurist method set paramet adjust depend problem type network hidden unit train set leav problem automat mlp paramet set optim open wai approach optim problem increment decrement al good genet algorithm yao good increment cascad correl lebier tile perceptron cascad parekh al method zhang al base ad hidden neuron network minimum size reach requir decrement algorithm present al pelillo al base big network elimin hidden layer neuron obtain smaller network approach set weight optim brain damag le al optim brain al al method construct neural classifi base regular prune evolutionari neural network provid altern task control complex adjust number weight ann hybrid ga bp train ann ga design ann appli search optim set weight topolog al ga evolv popul ann encod paramet hidden layer binari string de al method base evolutionari approach provid optim set synapt weight network author search topolog white al miller al al coupl ga weight elimin method yao liu al combin search optim set weight search optim ga bp de al present method base evolutionari approach face optim design neural network architectur choic learn method approach search optim learn number neuron connect merelo al al al approach base simul anneal bp present decrement increment algorithm gradient descent optim suffer problem reach closest local minimum search space point method began evolutionari neural network effici search subset paramet aim paper present algorithm tune learn set initi weight hidden layer size base ga obtain result bp intend make capac abil ga find solut close global abil bp tune solut reach nearest local minimum mean local search solut found ga popul initi hidden layer specif oper design chang ga search optim architectur hidden initi weight set architectur learn rate net remaind paper structur section present architectur genet oper section describ result section genet algorithm design algorithm gener initi popul random weight valu hidden layer size rang maximum order size repeat evalu train train set obtain fit number correct classif valid set hidden layer size select individu appli genet oper replac worst individu individu obtain test error fit function number hit carri test case individu ident classif hidden layer fewer neuron impli greater speed train classifi facilit hardwar implement classif accuraci number hit obtain divid number hit total number exampl test set steadi state algorithm empir found faster obtain solut select algorithm individu fit chosen genet oper offspr replac worst individu current gener evolv mlp codifi chromosom handl genet oper ga binari initi paramet network evolv specif genet oper crossov addit elimin hidden made eo librari philosophi object fit evolv spirit ga ds ep data structur equal evolut genet oper act directli ann initi weight learn rate subject weight obtain train clone mlp creat comput fit initi weight remain unchang origin hidden layer oper treat hidden layer neuron weight unit genet oper chang mlp percentag mutat number cross applic prioriti oper number individu gener genet oper test higher prioriti mutat level remain oper mutat oper modifi weight depend applic rate base algorithm present modifi weight network epoch network ad subtract small random number uniform distribut interv learn rate modifi ad small random number uniform distribut interv oper applic probabl weight found empir obtain result lower probabl crossov interchang hidden layer neuron parent learn rate swap net addit oper attempt solv main problem bp difficulti guess number hidden layer neuron ad hidden neuron set size ga search space oper intend perform increment start small structur increment ad hidden unit elimin oper elimin hidden neuron random oper intend perform decrement prune node obtain result gener smaller network network prevent grow substitut oper appli low prioriti replac hidden layer neuron random initi random weight oper consid kind mutat affect gene algorithm run fix number gener evalu individu popul obtain fit limit epoch establish bp variant perceptron train algorithm algorithm avoid local problem bp improv probabl avoid local minima experi result eo librari toolbox develop due facil librari offer evolv object fit function genet oper toolbox defin interfac class algorithm evolutionari comput exampl interfac object eo make easier reproduc sourc object evolv eo made articl mention show dynam genet algorithm compar method evolut classif error hidden layer size typic run shown figur shown quantiti optim classif error optim higher prioriti fit classif optim size run shown gener mlp classif accuraci hidden neuron gener perceptron accuraci fewer hidden neuron gener mlp accuraci hidden neuron gener mlp classif accuraci hidden neuron simul perceptron accuraci fewer hidden neuron select winner run time paramet set random initi benchmark test appli data set divid disjoint valid gener gener figur evolut classif error term hit percentag hidden layer size typic run dna set gener mlp classif accuraci hidden neuron gener perceptron accuraci fewer hidden neuron gener mlp accuraci hidden neuron gener mlp classif accuraci hidden neuron simul perceptron accuraci fewer hidden neuron place test order obtain fit mlp train train set fit establish classif error valid set ga finish reach limit classif error test set result shown obtain result program implement methodolog train mlp train run topolog learn paramet net found benchmark valid set obtain valid error mlp test error obtain test set cancer dataset uci machin learn dataset breast cancer breast cancer obtain wisconsin madison dr william exhaust dataset sampl attribut class sampl code uniform cell uniform cell margin singl cell bare normal class class distribut origin set benign malign dna problem electron imag classif object classif studi structur repres larg viru observ electron larg prepar show characterist roughli circular view penetr region centr call top view rectangular shape cancer error size learn cancer qp cancer qp cancer qp tabl result evalu qp cancer result obtain al tabl show averag error averag size net number hidden learn paramet found learn rate obtain result qp found net hidden layer size term number paramet number weight net dna error size learn qp gener gener gener tabl result evalu qp classif view larg viru test hidden layer size learn paramet result obtain hidden layer size term number paramet number weight net obtain mlp lower gener error method cancer present similar account mention standard obtain smaller size similar classif result obtain similar obtain notic search learn extra effort guess suitabl learn constant train network dna ga execut gener popul probabl mutat cross point crossov oper popul replac individu mlp output number hidden unit evalu epoch initi learn coeffici execut paramet minut tabl show result obtain algorithm compar shown dna evid outperform gener achiev error achiev error compar method obtain result error net size optim valu learn paramet result generaliz kind chang adapt initi weight minim error result paper present algorithm train mlp base ga bp experi prove method achiev result variant obtain network size learn paramet result improv previou variant method algorithm obtain higher gener error unseen test achiev bp algorithm qp minim number hidden unit optim criterion achiev evolv initi weight learn oper alter ann size strategi attempt avoid individu inherit train weight step full autom mlp set learn constant benchmark dna test algorithm compar result show ga obtain mlp classif accuraci obtain train mlp convent procedur futur work extend present method includ develop genet oper improv perform increment learn addit approach present qp algorithm oper suggest present algorithm appli solv real world problem acknowledg work support part project project feder project bibliographi se variat empir studi connectionist model summer morgan braun direct adapt method faster backpropag algorithm proc san pp jj moran optim competit learn neural network genet algorithm lectur note comput vol pa jj global optim perceptron ga submit xin yao yong liu design artifici neural network evolut appli mathemat gf pm todd su design neural network genet algorithm intern confer genet page san network grow learn shrink forget intern journal pattern recognit artifici intellig xin yao review evolutionari artifici neural network intern journal intellig april lebier learn architectur neural inform system ds yang honavar construct neural network learn algorithm pattern classif technic report depart comput iowa state morri sequenti learn approach singl hidden layer neural network neural network mlp iter construct algorithm neurocomput analysi prune backpropag network artifici real world map problem lectur note comput vol pelillo method prune layer neural network lectur note comput vol le js sa solla optim brain damag neural inform system ds pp dg watanab optim brain extens perform comparison pp mad lar kai jan morten michael larsen neural classifi construct prune test error estim neural network ap oa vv fast learn neural network mean hybrid evolutionari gradient algorithm proc ic evolutionari comput de evolutionari neural network nonlinear dynam model lectur note comput vol david white pano genet algorithm optim topolog weight neural network design lectur note comput vol coupl weight elimin genet algorithm reduc network size preserv gener neurocomput de della optim neural network time seri predict world confer soft comput june file hybrid genet algorithm train neural network artifici neural pa jj optim perceptron paramet simul anneal submit whitlei algorithm select alloc reproduct trial jd schaffer intern confer genet morgan zbigniew michalewicz genet algorithm data structur evolut program extend edit werner standard backpropag method genet approach setiono wh pattern recognit linear theori applic medic diagnosi numer thoma coleman siam philadelphia pp lutz set benchmark benchmark rule neural network train algorithm technic report fur universitat septemb jj jm automat classif biolog particl imag convent optim learn vector quantiz neural letter dj davi train feedforward neural network genet algorithm proc internat joint conf artifici
ML/356 6 advanc friend except item pronunci analog stefano della pisa rue pari abstract multilingu challeng classic nlp problem data difficulti state rang order rule proper treatment phenomena transcript rule human expert oner european stop short level correct accuraci accept practic applic illustr multilingu system pronunci test english perform assess output statist transcrib gener point made techniqu longer competit combin advantag tractabl bonu reliabl applic tradit system analog comput gener analog defin inferenti process unfamiliar linguist object target analogu familiar object base piec knowledg acquir deal present mean written unknown word read aloud basi analog word spell pronunci familiar reader fig pronunci italian infer pronunci base orthograph overlap input string approach conceptu close bakiri mercer stanfil pronunci emphasi laid cognit plausibl base retriev role analog automat data cluster extract regular put forward psycholinguist circl count analog relev clue true analog word sake orthograph similar relev analog factor assum written word read aloud impli knowledg transcript orthograph charact align phonolog segment inform align mean condit analog transcript simplifi learn problem shown sophist linguist knowledg raw align profit task hand intend dataset base object give sort learn involv process read word aloud analog comput emphasi natur intern architectur dataset base exposur increment chang affect accuraci analog emphasi differenti model system sullivan damper focu base retriev analog map show automat analog cognit accur point capabl credit potenti applic basic introduc discuss essenti ingredi procedur definit pronunci analog structur dataset base object dataset search space recombin transcript analog map core algorithm procedur target word pronounc italian subset closest analogu extract dataset point analogu found basi number charact share target charact reliabl overlap analogu dataset target word simpl implement notion analog map analogu base object share target longest chunk run start leftmost charact longest base object share longest continu chunk start os rightmost charact backward longest strategi illustr chunk longest head tail simpli concaten figur analog interest relat issu analog map exist search search space defin respond assum candid analogu base reflect underli structur dataset view assumpt exist linguist structur underli dataset base object claim structur analog natur map candid remain recombin pronunci target word obtain correct pronunci align analog chunk recombin trivial element simpl chunk concaten fail account assum italian dataset candid analogu target word concaten respect head tail yield transcript italian charact read analog fail captur case pronunci italian independ start phonolog account context context form island reliabl orthograph span read safe chunk reliabl candid pronunci fail includ relev island reliabl mild form recombin ensur enforc condit final part longest head share longest tail chunk overlap part pronounc recombin ee tt tt ii mm oo nn aa figur analog refer compat overlap consecut chunk hook hook length longer hook accur result pronunci wider portion context account confirm evid collect italian shown accuraci vari function hook remain compar constant size dataset end transcript make hook charact opposit end transcript hook contribut train contribut accuraci train contribut accuraci train contribut accuraci tabl accuraci hook length ratio number qualiti pronunci total number pronunci provid note train set contribut contribut accuraci rate system steadili case ordinari word proper head tail long cover target pronunci provid interest consequ perform time attent grasp infer principl friend sheer martin martin strike advantag infer good perform obtain mean fairli basic algorithm final recombin constrain chunk analog map limit extract longest head tail remain amount regular machineri fail captur french martin target word pronunci analog martin base object base object possibl match target object martin martin complet martin pronounc martin suitabl tail found hook candid head french dataset proper arab amin provid easi hook transcript analog clash power regular french pronunci word read final indic gener weak strategi delin due difficulti model analog pressur except relat martin martin analog map fit gener altern defin systemat paradigm french martin marin martin marin figur phonolog paradigm paradigmat slot analog island straightforward express paradigmat link shown analog marin marin repres common core share orthograph phonolog level share repres separ node complementari distribut word link common core refer distinct node complementari distribut paradigmat paradigmat slot link core paradigmat slot call paradigmat link note core turn complementari distribut analog core paradigmat slot martin share pronunci express common core distinct link depart paradigmat link defin relationship distinct matic slot common make predict pronunci unknown word orthograph string fit network paradigmat node analog island reliabl analog island phonolog altern consist phonolog discontinu orthograph spite string marin marin pronounc end complementari distribut give rise independ node mar mart figur paradigmat network analog map marin martin form analog paradigm system martin analog martin reconstruct continu path paradigmat link slot slot arrow refer paradigm extens recombin desir pronunci alphabet free monoid alphabet pronunci function induc ae set base relat pronunci note longest common head longest common tail empti string defin xy xy xy algorithm algorithm foral build fy sort foreach build xy sort foreach break end end break end target object longer map unstructur list base paradigmat node base object distribut paradigmat node map head target paradigmat link depart node system map analog island consid suitabl candid analogu analog pressur martin martin weaken target martin longer map martin result match analog island paradigmat extens martin case friendship mean limit idiosyncrat proper deriv suffix accent shift turn segment tripl altern margin vowel bold pronounc blind analog routin miss systemat paradigmat link analog hook sum view analog matter similar target gener associ principl govern dataset entireti analog paradigm captur network analog relationship dataset structur size dataset finer paradigm system accuraci improv pronunci lack paradigm immun learn altern ad pair suffic constru analog paradigm paradigm overrid analog pressur niti ne va figur case paradigm share charact string immun figur correct altern analog accuraci unlik system awar transcrib fail provid output input word possibl split pronounc mean pronounc languag minimum context rule applic system remain silent weak conserv nonetheless pai long run prove claim french compar perform transcrib map perform altern dec expand learn algorithm build increment tree iter expend rule context train word correctli transcrib paper show perform system size train dataset french proper correct curv rise slowli earli stage dec correct system learn similar experi run word randomli select nettalk rosenberg remain word train correct score nice dec silent correct accuraci version implement strategi test data yield improv result analog strike approach implement softwar score transcrib accur outstand futur work sum crude form orthograph analog effect outperform fairli sophist techniqu power analog hing weak conserv inferenti unfamiliar target foreign pronounc tent analog easi except grasp statist method treat dealt learn miss analog isol except complic rule write rule captur statist group except enter fine grain paradigm exert analog pressur make analog accur default rule provid rw rule arrai convent instanti analog factor sheer consid interest phonolog altern routin analog map illustr paper fail word pair assum transcript store dataset analog correct pronunci analog mean altern place head ser turn tail turn analog map carri map head target tail altern interdepend lack altern principl solut extract discontinu chunk chunk charact miss defin sophist routin hole discontinu chunk fill work analog offer interest solut nlp data acquisit directli perform except longer steadili contribut system context sensit tackl paradigm analog discontinu analog map effect tool deal depend refer approach transcript proper draft research paper project neural network model read neural comput psycholog workshop recogn print current model read advanc theori practic academ press program pronunci analog comput speech langag compar studi english map intern machin learn workshop analog comput process umist organ activ orthograph knowledg read aloud journal psycholog human percept perform pronounc combin reason phd stanford ca dynam expand context applic correct symbol string recognit continu speech intern confer pattern volum imag cognit basi grammar berlin problem solv larg knowledg base learn case meet american associ artifici intellig inform theoret approach automat determin phonem intern confer speech signal process volum analog autom reason academ press pronunci unknown word analog evalu research colloquium evalu italian transcript rule technic report network learn pronounc english text complex system reason appli english pronunci meet american associ artifici intellig pronunci system talk north holland techniqu research colloquium
IR/357 5 high idea dieter stefan michael rudi studer institut germani copyright american associ artifici intellig reserv abstract world wide web import electron inform sourc queri interfac provid reason servic limit ontobrok consist number languag tool enhanc queri access infer servic www techniqu base ontolog ontolog appli annot web document provid queri access infer servic deal semant present inform intellig broker servic web document achiev requir chang semiform natur web document introduct world wide web huge amount knowledg subject html document enrich applic provid knowledg anim virtual hypertext link web document repres relationship knowledg entiti base html browser present materi user distribut inform knowledg unit retriev inform web weakli support main queri answer servic web search facil carri search web web web catalogu ontolog improv queri answer support www ontolog discuss literatur mean support knowledg share friedman noi approach base assumpt model explicitli number share knowledg metaphor newsgroup defin role ontolog group peopl share common subject relat point view subject annot document provid intellig broker servic enabl inform access web document design implement tool enabl ontolog enhanc web develop broker architectur call ontobrok core queri interfac formul infer engin deriv webcrawl collect requir knowledg web provid languag formul ontolog subset formul defin queri languag annot languag offer enabl knowledg provid enrich web document ontolog inform strength approach tight coupl semiform formal inform knowledg support mainten servic gener knowledg manag integr reason semiform document paper organ provid motiv approach sketch languag tool repres formul annot web document ontolog inform final discuss possibl limit ontobrok relat work bottleneck www www huge amount inform inform kei factor enabl success stori formal simpl retain high freedom present inform strictli follow basic design paradigm freedom inform simpl formal bottleneck access inform web basic search techniqu human textual graphic hyperlink keyword base search engin retriev hyperlink process queri answer infer servic www limit compar relat deduct enabl queri infer servic deriv knowledg discuss exampl illustr limit current www access imagin find research subject research smith feather consult search engin result huge set page kei word feather present limit page intern flair confer person identifi requir human search effort investig page page requir inform found format queri list hyperlink textual graphic inform denot requir human read extract relev inform inform sourc research subject mr feather list research topic wide knowledg softwar requir human extract retriev inform burden web user addit loss time limit inform retriev automat agent miss common knowledg requir extract inform textual mention problem trivial compar queri refer content page imagin find research subject research group figur written central page research page determin member research group page requir search effort lack recal make queri impract distribut heterogen group peopl web current retriev servic retriev inform repres www sound trivial significantli limit queri answer capabl imagin feather write homepag cooper research motta investig formal specif problemsolv method complet miss inform motta repeat inform homepag consult page answer mechan make implicit symmetri cooper provid answer sum discuss identifi issu improv semant inform guid queri answer enabl answer syntax semant directli understood process automat agent softwar enabl homogen access inform physic distribut heterogen repres provid inform directli repres fact www deriv fact background knowledg subsequ discuss languag tool provid queri interfac queri formal orient ontolog defin notion attribut valu gener scheme mean object instanc class attribut structur queri languag exploit provid tabular queri interfac shown figur research benjamin email address result shown figur ontobrok collect distribut inform queri figur collect research topic member research group system institut retriev research topic research group distribut homepag research possibl queri knowledg base inform ontolog queri foral attribut class research class support select class attribut ontolog select ontolog present manner ontolog repres larg hierarchi concept regard handl hierarchi user scan vicin class class suitabl formul queri user overview hierarchi quick fig advanc queri interfac fig result queri easi navig class hierarchi class requir met present scheme base hyperbol geometri rao class center depict larg class border surround circl mark small circl figur fig result queri fig hyperbol ontolog view visual techniqu quick navig class center closer examin class vicin user select class hyperbol ontolog class class field user select attribut attribut choic menu class determin attribut base interfac ontobrok automat deriv queri textual form present result queri figur figur ontolog basic support provid queri answer element ontolog ontolog taxonomi rule effect effici queri evalu procedur languag base infer engin horn logic simpl horn logic epistemolog point view epistemolog primit simpl predic logic horn logic rich support adequ ontolog ontolog defin concept axiom adequ languag defin ontolog provid model primit concept lausen model primit integr logic framework provid horn logic subset contrast descript express ontolog queri directli part ontolog class citizen instanc valu concept attribut provid answer mean variabl substitut artifici express logic relationship horn provid richer languag defin complex express intern translat transform normal logic program exampl horn rule tabl concept hierarchi consist elementari express declar subclass relationship attribut definit declar attribut concept valid type attribut rule tabl ensur person public public author person vice versa kind rule complet knowledg free knowledg provid provid inform place reduc develop mainten effort annot knowledg www gener formul tabl ontolog definit concept hierarchi attribut definit rule person object person research firstnam lastnam email public affili foral html develop extens html syntax enabl ontolog annot web page provid gener idea detail found broker idea approach html start point add ontolog relev tag minor origin html page knowledg page annot made access fact ontobrok approach knowledg provid annot web page complet formal knowledg page remain readabl standard browser netscap navig ms explor sourc upto reduc develop mainten effort factual ontolog inform html page provid epistemolog primit annot ontolog inform web object identifi url resourc defin instanc class attribut set relationship object establish discuss approach provid inform knowledg ontobrok requir design ontolog annot web document design ontolog time consum activ aim formal consensu model aspect realiti build model pai dimens improv web present document compani organ refer model intern data inform standard establish standard repres inform area effort pai back make extens markup languag defin annot languag exist html page xml document requir extens minor simpl improv web access annot web document ontolog inform easier train person basic html knowledg annot ca page hour thousand provid sophist tool support process annot written text editor queri interfac make graphic ontolog process produc annot possibl stabl web sourc replac annot effort deriv wrapper extract inform ashish knoblock wrapper directli deriv factual knowledg infer engin ontobrok scenario wrapper replac annot process process translat annot fact decid design annot languag minor extens html document web formal develop resourc descript framework format add meta inform includ semant inform document approach show number similar ontobrok approach aim content inform enabl autom process web resourc ontobrok annot inform tightli integr html reduc redund inform web page minimum meta data defin rdf provid extra page en insid element web page text fragment link directli annot semant element repeat enrich design problem maintain web document due redund inform final version rdf recommend easi task implement wrapper automat gener rdf definit annot ontobrok join standard enabl agent read meta inform gener automat rdf descript make annot knowledg agent broker servic search web inform knowledg ontobrok answer direct question human user autom search mechan read rdf make ontolog ambit provid autom access search agent essenti view ontobrok step direct knowledg web establish broker servic ontolog provid semant descript inform content requir free client directli contact broker make custom search agent consult broker servic queri answer ontolog broker compet clarifi topic provid knowledg human user contact final small select broker servic return person search agent relat work paper introduc method tool enhanc web ontolog mean annot www document ontobrok includ queri interfac formul infer engin deriv answer pose web crawler search subnet translat ontolog annot fact infer engin ontobrok basi realiz knowledg acquisit initi develop knowledg manag system industri design regard ergonom question knowledg industri input output infer process system twofold piec knowledg enabl tight coupl semiform formal knowledg ontobrok approach closest introduc idea ontolog annot inform www html page annot ontolog support inform retriev base semant inform major differ underli provid inform introduc arbitrari extens ontolog central provid index defin queri client ontolog term annot html page web crawler miss knowledg fragment entir www answer miss import inform web crawler miss knowledg bit ontobrok reli notion defin group web user ontolog subject inform provid client complet knowledg ontolog term provid index complet collect annot html page ontobrok deliv complet answer pose queri philosophi ontobrok tailor homogen intranet context knowledg manag shoe ontobrok differ respect inferenc capabl shoe descript logic basic formal offer limit inferenc capabl ontobrok reli support complex inferenc queri answer situat ontobrok gener context approach support integr distribut heterogen inform sourc mediat translat user queri inform sourc integr wrapper content descript inform sourc provid connect inform sourc mediat approach assum inform sourc stabl syntact structur wrapper extract semant inform heterogen larg collect web assumpt fulfil wrapper approach complementari acknowledg richard cooper refer jl ca agent inform gather ieee ca wrapper gener internet inform sourc ifci confer cooper inform system south carolina commun banff knowledg acquisit system workshop canada friedman cd state art ontolog design ai logic foundat languag journal corpor memori knowledg manag industri prospect challeng journal comput special issu inform technolog knowledg springer scienc techniqu base hyperbol geometri visual larg hierarchi acm sigchi confer human factor comput system web agent intern confer autonom agent conceptu basi mediat servic ieee pp
Agents/358 1 market protocol decentr suppli chain format william walsh dissert submit partial fulfil requir doctor philosophi scienc michigan doctor associ professor michael chair professor edmund professor jeffrei professor martha pollack professor robert abstract market protocol decentr suppli chain format william walsh michael wellman order effect respond chang market busi partner rapidli form suppli chain thesi approach problem autom suppli chain process determin particip suppli exchang term econom framework suppli chain format formal task depend network model captur subtask decomposit presenc resourc import challeng aspect suppli chain format order form suppli chain decentr price system provid econom framework guid agent competit price agent optim alloc respect outcom optim approxim competit equilibria yield approxim optim alloc market protocol agent negoti alloc resourc form suppli chain presenc resourc protocol produc solut greedi protocol common artifici intellig multiag system literatur protocol base analyz agent bid polici protocol converg suppli competit equilibria typic approxim competit equilibria agent product technolog protocol alloc input agent produc output subsequ decommit phase recov fraction lost surplu problem solv combinatori auction ensur agent receiv partial alloc combinatori protocol analyz strateg bid empir compar protocol econom metric protocol solv proposit satisfi problem perform direct implement variant perform compar algorithm ii william walsh reserv teacher friend ii acknowledg thesi includ result joint work fredrik daniel makoto advisor michael wellman chapter collabor fredrik dan instrument deriv analyt perform analysi chapter result collabor makoto mike involv work fund laboratori graduat student research fellowship grant digit librari initi work perform equip provid grant darpa inform surviv program contact mike data structur algorithm year undergradu school michigan teach impress chose work summer didnt understand econom ai time enjoi experi stai phd year meet strang student anymor long ago decid phd comput clear idea process entail great mike encourag guid importantli interest respect mike made feel colleagu student grate rest construct comment suggest improv thesi lead develop jeff instrument develop econom knowledg intuit research prepar earli version iii thesi inform econom class ed provid comment thesi oral qualifi earliest work thesi robert brought attent interest pattern motiv analysi martha join shortli provid construct suggest commiss number week member advic face tough job search research group develop gener understand econom market provid idea number specif problem understand problem auction evolv discuss work wurman incorpor earli suggest dave pennock improv understand sat kelli provid technic advic numer occas dan reev drop lend hand problem bring attent thesi evolv idea origin suggest jonathan entir ai lab staff extrem make life easier kathi annual health insur jeff rob quickli solv regularli occur comput deb handl travel arrang famili extrem support endeavor uncondit love word import educ encourag pursu offer advic solicit entertain possibl accomplish chose brother sister great friend time michigan special place graduat school number friend roughli chronolog order friend import graduat iv school dai ann sourc creativ good friend toni enrich summer pasadena continu close friend faith love tabl content dedic ii acknowledg iii list tabl ix list figur list xiii chapter introduct autom suppli chain format aspect suppli chain format relat work market approach organ thesi problem task depend network automot suppli chain format problem specif model issu problem resourc content price competit auction price equilibrium competit equilibrium exist special structur valid solut analysi auction theori good distribut protocol discret good combinatori auction strateg analysi vi protocol auction mechan bid polici properti price equilibrium effici properti solut converg combinatori protocol combinatori auction mechan combinatori bid polici evalu market protocol compar protocol perform evalu setup implement result strateg analysi combinatori protocol special case equilibrium deviat detect distribut negoti negoti model detect algorithm applic negoti simultan independ negoti deter deviat deviat incent deviat mediat backbon applic detect detect gener equilibrium feasibl decommit discuss proposit satisfi suppli chain format market protocol origin experi construct result variant protocol uniform price vii differenti price econom interpret ration behavior search complet variant experi construct result discuss decentr summari futur work summari contribut futur work bibliographi viii list tabl tabl distribut effici class combinatori protocol effici suboptim optim distribut effici class effici neg suboptim optim averag effici network protocol comput student compar effici mean instanc admit competit equilibrium admit competit equilibrium percentag instanc attain equilibrium averag effici network factor equilibrium attain averag fraction surplu obtain produc network protocol effici fraction surplu obtain produc combinatori bid base fix linear summari comparison base combinatori bid polici polici network simpl perform protocol variabl measur protocol measur round comparison satisfi flip problem ix list figur figur automot suppli chain format problem network task depend network automot suppli chain depict figur effici solut network auto network network greedi protocol produc alloc competit equilibrium network cost valu network cost valu inequ constraint price paramet constrain exist equilibrium network network exist equilibrium support solut inequ constraint price constrain exist equilibrium support solut valid solut network produc dash arrow good produc lose solid arrow produc win good network network requir exponenti number bid reach network network converg solut valu network network equilibrium classif protocol column distinguish mechan scope row distinguish bid polici strateg network simpl network unbalanc network network bigger network result combinatori protocol experi network simpl number result combinatori protocol experi network unbalanc condit cost structur competit equilibrium exist number result combinatori protocol experi network unbalanc condit cost structur competit equilibrium exist number result combinatori protocol experi network condit cost structur competit equilibrium exist number result combinatori protocol experi network condit cost structur competit equilibrium exist number result combinatori protocol experi network bigger number result combinatori protocol experi network number result combinatori protocol experi network condit cost structur equilibrium exist number result combinatori protocol experi network condit cost structur equilibrium exist number network network result polici network simpl number network mediat negoti network schemat state diagram entiti algorithm agent incent deviat network mediat prematur acknowledg mediat network activ backbon network negoti network network transform fq fu fu solut network correspond satisfi truth assign shade vertic solid edg solut xi median runtim problem runtim problem network simplifi transform sat instanc repres network fq fu fu algorithm xii list appendix proof theorem notat xiii chapter introduct autom suppli chain format current practic electron commerc technolog autom improv exist mode commerci interact great analogu tradit store consum commod albeit assist increasingli sophist search recommend system realm technolog develop orient improv commun coordin establish busi partner data format electron data interchang extens markup languag provid framework develop standard busi electron exchang transact catalog inform techniqu suppli chain manag develop group partner manufactur compani coordin optim product schedul technolog greatli improv commerci practic provid greater reduc cost radic vision busi transform exponenti commun bandwidth comput abil potenti remark friction busi interact malon emerg put view busi relationship lose current persist charact malon larg compani dynam form connect produc good dissolv project complet refer group organ form temporari ad hoc accept full extent vision virtual number busi trend provid compel evid move direct softwar linux oper system gnu tool develop hacker posit evid viabil virtual corpor debat gener applic develop trend virtual corpor manifest broadli softwar compani develop sun microsystem programm bid fix custom softwar problem tradit manufactur exemplifi major automot increasingli product compon ford gener motor part manufactur separ compani small compani form partnership compet establish compani applic servic provid crop provid standard technolog servic suppli common paradigm virtual corpor suppli chain network product exchang relationship span multipl level product subtask decomposit compani bui good servic support product servic turn compani suppli chain typic refer structur manufactur servic contract relationship span multipl level view suppli chain suppli chain format process determin particip suppli exchang term exchang suppli chain form maintain long period time mean extens human interact demand commerci make face explod growth complex inform ing advanc support autom suppli chain format compani rang auto maker comput manufactur base busi model rapid custom product satisfi consum demand fluctuat resourc cost avail compani respond rapidli maintain product capabl profit increasingli occur complex unmanag autom suppli chain format acut goal understand engin process autom suppli chain format engin autom suppli chain format great challeng begun tackl work present thesi goal engin descript strive model dynam suppli chain format occur present practic seek design protocol autom format suppli chain support present work present model suppli chain reflect challeng aspect suppli chain format amen formal design analysi present market protocol suppli chain format preset theoret econom analysi suppli chain format problem specif protocol aspect suppli chain format section highlight salient aspect complet model suppli chain format model suppli chain format includ task depend network model present encompass aspect make progress autom suppli chain establish framework identifi aspect defin characterist suppli chain format subtask decomposit agent special capabl perform combin produc resourc order complet complex agent deleg subtask turn deleg subtask resourc content constrain set feasibl suppli chain agent requir common resourc subtask tangibl piec complet resourc scarciti exclud agent jointli oper suppli chain commerci agent aim maxim suppli chain agent incur cost tradeoff ultim serv agent statu complet model account valu multipl attribut monetari qualiti assum agent privat inform agent detail understand imperfect knowledg agent entiti inform central form suppli author dictat action agent decentr inform author impli distribut make suppli coordin negoti protocol agent form suppli chain strictli requir local commun limit knowledg rest system agent interact suppli chain format complex agent gener incent reveal analyz strateg interact agent strateg interact gener involv reason inform agent possess action uncertainti introduc complic model suppli chain format construct suppli chain disrupt failur failur intent fraud agent legal decommit contract cost advantag negoti process affect uncertain event bound variat knowledg multipl strateg equilibria make agent negoti strategi uncertain failur negoti commun channel occur negoti full negoti protocol agent strategi failur asynchron commun introduc random element negoti relat work exist model artifici intellig multiag system oper research literatur captur element suppli chain format review domin model relev clarifi scope briefli mention suppli chain problem accur forecast effect plan product deliveri meet demand minim activ field research oper research industri problem manag differ suppli chain format exchang partner suppli chain assum inform gather agent effect optim global product suppli chain studi problem autom process determin suppli chain particip assumpt inform make decentr reader interest suppli chain manag refer extens review detail problem suppli chain focu model suppli chain format rosenschein zlotkin studi class problem call task orient domain variant receiv attent multiag system literatur tod consist set task cost function set task sandholm examin gener tod includ cost constraint task achiev agent initi alloc set negoti mutual benefici exchang task lower cost andersson sandholm extend model agent pai decommit contract contract model address strateg interact task incorpor subtask relationship characterist suppli chain contract net protocol chain format protocol ai ma commun contract net earliest approach hierarch subtask decomposit core featur underli model contract net subtask proce decentr agent commun potenti actual subtask partner protocol flexibl accommod multiattribut optim criteria contract net view framework decentr suppli chain protocol obviou implement contract evid adapt davi appli optim criteria local greedi reflect negoti level evolv suppli chain request quot propag network bid propag back sourc singl iter show section greedi approach result suppli chain resourc content exist al issu simultan negoti multipl subtask issu level suppli chain asynchron agent opportun final contract negoti pend uncertainti induc complex problem agent commit grosz studi problem assign task perform role agent sharedplan collabor plan framework model base describ constraint execut time constitut complex task content share resourc model explicitli individu agent addit potenti individu resourc limit grosz combinatori auction assess task produc share plan find limit task assign combin role affect tradeoff comput combinatori auction result alloc task depend network describ detail chapter subtask decomposit presenc resourc content chapter present specif market protocol resolv content decentr manner market approach decentr knowledg view suppli chain format negoti problem motiv desir obtain suppli agent decid exchang produc behalf autom suppli chain protocol negoti suffici amen implement analysi auction provid framework design analyz negoti protocol resolv resourc content gener auction market institut explicit set rule determin resourc alloc price basi bid market gener definit offer lack specif establish conceptu framework market auction serv mediat negoti popular discuss suggest electron commerc autom mediat potenti provid benefici special servic reduc agent search effort improv result charg lower transact cost compar mediat agent focu search negoti effort engag potenti negoti process implement explicit set auction structur autom negoti properti establish standard autom negoti formal agent negoti process space potenti auction provid myriad option design negoti protocol theoret underpin class auction guidanc design practic auction proven recent success onlin auction ebai auction proven effect mechan autom negoti electron market rise major effort automot industri largest busi internet auction todai gener limit scope singl singl level suppli chain dynam suppli chain format requir negoti multipl contract input level network potenti suppli chain form coher suppli agent resolv local product feasibl condit content scarc resourc local constraint give rise complex global agent resolv local knowledg make hard resourc constraint complex suppli chain immedi obviou achiev goal suppli chain format show fundament tool type guid decentr make negoti agent form coher suppli chain approach coordin simultan distribut negoti interrel matter concern challeng problem altern explor address coordin problem singl combinatori auction mediat negoti make standard auction theoret work complic limit current state art auction theori discret complex suppli chain put problem suppli chain format current sphere deriv analyt result show coher suppli chain resourc content form decentr work view thrust understand complex import problem organ thesi chapter formal suppli chain format term task depend model decentr subtask decomposit resourc depend model includ agent properti global optim evalu solut qualiti chapter directli includ materi present develop walsh chapter describ price system abstract framework guid decentr agent make encapsul inform rel good competit price equilibria type price structur give global feasibl suppli chain agent perform local optim respect price competit equilibria possess desir stabil perfect gener exist task depend network present type approxim competit bound local suboptim agent alloc bound global suboptim solut equilibria necessarili reason show chapter equilibria analyz market protocol defin valid weaker condit price price suppli chain solut remaind chapter turn focu static properti price alloc issu comput decentr manner market protocol defin market protocol consist auction mechan agent bid polici control market control autonom agent understand implic auction analyz result agent behavior review relev result field auction theori chapter directli includ materi chapter present price base protocol analyz agent bid polici converg auction paramet equilibrium paramet show converg properti protocol protocol surprisingli effect form suppli chain born empir chapter major shortcom dead end agent acquir input unabl sell output augment agent decommit undesir input contract chapter directli includ materi chapter describ altern approach address bid problem inher distribut auction present combinatori auction bid agent entir demand comput alloc entir space relev good directli elimin problem dead end occur present strateg bid polici combinatori agent account effect contribut global alloc chapter directli includ materi due complex market protocol analyt result provid complet stori perform chapter empir evalu combinatori measur effici distribut surplu agent chapter directli includ materi chapter describ protocol detect distribut negoti includ protocol base termin detect algorithm discuss incent agent deviat detect protocol present mediat backbon augment prevent deviat chapter directli includ materi chapter detour primari thesi focu protocol solv combinatori problem highli decentr fashion spirit program approach distribut comput direct electron commerc applic reader interest lie primarili realm electron commerc awar proof explain suppli chain format interest section ad intuit oper prove suppli chain format problem reduct transform proposit satisfi describ highli decentr sat applic task depend sat instanc show solv sat albeit extrem practic problem size show simplifi market structur variant market solv sat problem surprisingli decentr fashion present qualit comparison oper variant algorithm central sat shed light search work chapter directli includ materi walsh chapter summar contribut thesi suggest direct futur work defer proof appendix proof instruct import understand materi appendix refer notat thesi chapter problem task depend network suppli chain format problem agent interest achiev task perform agent time order perform agent achiev deleg agent turn subtask form suppli chain decomposit task achiev constraint task assign resourc agent requir common resourc subtask tangibl piec accomplish task task perform behalf agent subtask perform satisfi task rival resourc make distinct term refer task resourc provid agent assumpt good share limit econom analysi thesi good replic margin softwar provid interest challeng econom analysi address thesi automot suppli chain format illustr model suppli chain format applic hypothet automot industri automot industri natur product car tier automot suppli chain form maintain long period time extens human negoti begin gener form compani call mediat negoti part focu effort exchang singl level product broader problem form feasibl suppli chain ford distribut ford auto assembl job shop gm distribut gm auto assembl ford transmiss factori independ transmiss factori figur automot suppli chain format problem automot ford gener motor acquir contract transmiss product order produc model car ford produc transmiss factori acquir independ transmiss produc gm capac produc desir independ produc independ transmiss produc capac provid transmiss ford ford independ transmiss factori requir servic job shop job shop capac serv simultan contract job shop transmiss factori scarc good alloc figur show potenti flow good limit capac job shop impli constraint feasibl suppli chain ford acquir transmiss independ job shop serv independ factori ford simultan ford gm simultan satisfi realist job shop independ transmiss factori constrain provid servic limit number agent period time discuss tempor resourc model issu section problem specif provid formal descript suppli chain format problem term bipartit graph type node repres good task depend network acycl vertic set set set set set edg connect agent good produc exist edg agent make unit edg provid unit agent requir unit good treat unit separ distinguish subscript explicit subscript interpret implicitli subscript agent requir unit input edg treat multipl output unit manner input output express integ quantiti agent type posit task depend network consum acquir unit good set consum exist set iff produc produc singl unit output good condit acquir input exist set iff edg exist singl gn produc input good complementari agent acquir order produc accomplish partial set altern produc output wai good produc task depend network constrain agent produc good assembl input chain product restrict enabl analyt result describ subsequ chapter broadli view global commerc cycl product negoti tend cluster limit scope refer result suppli chain typic acycl refer posit produc network produc output maximum distanc formal state maximum level produc input defin respect distanc produc basi produc input defin acycl figur show task depend network model automot suppli chain problem figur good consum produc input repres produc input repres curv box number agent respect cost explain arrow agent good agent provid arrow good agent agent make good produc label ford auto assembl requir contract acquir work metal ford transmiss order produc car observ introduc agent call ford transmiss subcontractor gm job shop work metal gm distribut gm car gm auto assembl ford transmiss ford transmiss factori independ transmiss factori gm transmiss ford transmiss subcontractor gm transmiss subcontractor ford distribut ford car ford auto assembl transmiss product figur network task depend network automot suppli chain depict figur mission subcontractor model fact independ transmiss factori produc ford transmiss gm transmiss distinct good serv alloc subgraph edg mean agent mean acquir alloc vertic agent good incid agent alloc graph iff acquir iff good alloc graph iff acquir iff produc activ iff output produc feasibl iff inact acquir input consum feasibl good materi balanc iff number edg equal number ford distribut ford car ford auto assembl job shop work metal gm distribut gm car gm auto assembl ford transmiss ford transmiss factori independ transmiss factori gm transmiss ford transmiss subcontractor gm transmiss subcontractor transmiss product figur effici solut network auto alloc feasibl iff agent feasibl good materi balanc solut feasibl alloc form partial order feasibl culmin consumpt consum acquir good exist solut involv multipl consum consum solut solut figur show solut alloc task depend network figur shade agent solid arrow part agent dash arrow indic element problem part solut note gm transmiss subcontractor win inact recal inact produc solut properti met refer configur inact produc acquir input alloc dead end produc product cost provid unit output cost repres obtain engag direct cost incur produc output total product cost alloc assum consum prefer obtain singl unit good consum obtain obtain singl unit good alloc obtain max task depend network cost valu respect agent definit alloc definit set effici alloc feasibl alloc max task depend network serv conceptu formal analysi tool central decentr necessarili perfect complet knowledg entir network assum agent perfect knowledg good interest chapter assum knowledg behalf agent analyz market mediat facilit negoti good describ agent relev mediat good interest knowledg includ rule enforc mediat mediat exist agent interest respect good mediat agent reveal commun negoti mediat agent true cost awar agent prefer good direct scope facilit address detail agent mediat achiev mutual awar edg task depend network assum accomplish unspecifi broadcast protocol model issu task depend network model directli repres fairli simpl product capabl consum util power model gener problem form solut complet task depend network encod proposit logic formula constraint satisfact problem provid hint model complic product util function model produc produc singl unit scale product replic produc agent repres possibl altern good creat separ produc input combin model complic consum function combin multipl consum produc repres addit function simpli instanti consum sum term function consum prefer bundl repres bundl output good input produc compon respect output bundl found develop complex model care design space good situat desir tempor good time model tempor good framework multipli good index good time slice provid similarli multipli produc repres product time straightforward consum util version good transform achiev blowup good produc polynomi number discret time unit transform gener control design environ make point model express suggest wai cast network structur individu agent lead outcom strateg set problem resourc content recal section typic contract net protocol alloc task greedi bid propag produc consum con figur network network greedi protocol produc alloc singl pass approach form satisf suppli chain suffici resourc basic contract net protocol includ mechan explicitli address resourc scarciti content multipl agent produc accept bid input establish network lookahead contract net construct suppli chain limit resourc greedi protocol produc solut network shown figur produc bid common function monoton output bid produc prefer acquir input cheaper acquir unit good feasibl particip part solut address problem resourc chapter present iter market present comparison perform contract net exist suffici formal descript contract defin class suppli chain detail comparison assumpt agent construct feasibl alloc form solut network cost valu shown figur form solut prove posit converg result special class chapter present empir result indic tendenc form solut chapter price competit auction task depend network view variant addit constraint resourc content find solut task depend network central manner search techniqu extra bookkeep account ad constraint problem find effici alloc cast mix program problem solv fast commerci describ section focu decentr constraint agent oper autonom privat inform product capabl price system econom framework guid alloc agent decentr fashion price system assign good nonneg number price price rel agent price guid local make chapter identifi structur price system desir properti ration agent make assum agent util function util sum hold neg obtain alloc good agent maxim price inform provid definit agent alloc price con figur competit equilibrium network cost valu price equilibrium alloc competit equilibrium price feasibl assign agent alloc optim agent surplu constraint price hold feasibl alloc produc solut obtain surplu produc solut obtain surplu consum solut obtain good maximum posit total payment equal price ci consum solut obtain surplu nv competit equilibrium alloc stabl agent alloc equilibrium agent obtain alloc degrad agent alloc absenc gain trade refer pareto optim figur show competit equilibrium network cost valu price shown respect good gener expect iter auction protocol discret bid adjust protocol describ chapter overshoot exact equilibria small amount approxim equilibrium concept analyz protocol wellman defin discuss properti exist type approxim equilibrium relev task depend network agent maximum error surplu optim section show paramet correspond paramet market protocol comput price alloc denot maximum surplu agent obtain price subject feasibl max feasibl definit alloc equilibrium price feasibl good materi balanc equilibrium correspond standard notion competit equilibrium price equilibria shown effici fairli gener condit hold case task depend network demonstr prove gener result equilibrium suboptim effici fix bound theorem equilibrium price feasibl alloc nonneg differ effici alloc defer proof subsequ theorem appendix proof instruct import understand materi corollari theorem competit equilibrium alloc effici task depend network competit equilibria due complementar input produc valu equilibrium competit equilibrium trivial set paramet suffici high consum produc obei equilibrium condit exchang good gener equilibrium valu valu obtain competit equilibrium proport consum valu produc cost equilibrium support competit equilibrium exist figur show constraint con figur network cost valu inequ constraint price paramet constrain exist competit equilibrium order support solut equilibrium underli network consum shown figur con perfect competit equilibrium posit valu paramet obtain equilibrium solut involv agent constraint price good ensur produc sell output constraint price good ensur produc sell output constraint price good ensur activ constraint price good ensur trade good constraint price good ensur activ consum bui good constraint price good requir equilibrium solut solut effici candid alloc pure competit equilibrium paramet pure competit equilibrium note sustain solut competit constraint price good rise linearli cost produc exist network equilibrium exist support solut figur show constraint price equilibrium support solut network observ solut network constraint con figur network network exist equilibrium support solut inequ constraint price constrain exist equilibrium support solut price good ensur produc activ solut produc requir unit good produc higher consum con good equilibrium support solut network observ nonexist equilibrium network fact multipl unit good requir solut graph undirect path vertex vertex note task depend produc multipl unit unit repres separ edg alloc iff unit good produc multipl wai produc good theorem effici alloc exist equilibrium support competit equilibrium exist special structur prior show perfect competit equilibria exist network special case structur task depend network competit equilibria competit equilibrium complementar input produc good input complementar preclud competit equilibrium task depend network network input complementar produc input theorem competit equilibria exist network input complementar figur instanc network cost structur admit competit equilibrium constraint good ensur price good suffici high produc constraint price good constraint part lower bound price good constraint influenc undirect path good good produc lower bound constraint price good sum lower bound constraint price input produc constraint price good propag path good good cost structur network multipl undirect path good good give rise lower bound constraint price good preclud competit equilibrium turn undirect cycl preclud competit equilibrium recal graph undirect path vertex vertex network iff unit good produc multipl wai produc good theorem competit equilibria exist condit theorem bear similar theorem note theorem requir alloc theorem hold origin network valid solut chapter show equilibria concept analyz decentr market protocol protocol reach equilibria network weaker constraint consist lesser agent ration solut alloc solut valid respect price consum solut pai singl good exist singl hg ci activ produc note solut valid preclud inact produc admit dead con figur valid solut network figur show valid solut network underli cost valu figur analysi auction theori discuss static configur properti price system section address problem price alloc obtain decentr manner comput price alloc decentr elicit inform agent commun agent design mechan agent incent reveal inform comput desir outcom auction class mechan auction serv mediat structur guid negoti decentr make agent gener auction simpli formal rule comput alloc price provid base set messag receiv agent due space potenti auction provid myriad option auction design core activ common auction consid auction literatur receiv bid messag agent particip exchang auction rule bid central auction clear determin good exchang payment buyer seller reveal intermedi auction rule intermedi inform tent price hypothet exchang refer statu report quot engin problem li design auction rule encourag desir outcom negoti goal attain price equilibria alloc case thesi present progress problem pose fundament remain unsolv gener case agent bid polici behavior interact auction auction mechan control system bid polici determin individu agent understand implic auction design requir analysi market protocol combin auction mechan agent bid polici definit theoret result market protocol present limit class problem refer call field game auction theori avoid term pure behavior aspect bid complementar discret price equilibria show section task depend greatli complic auction design analysi auction recent discuss context exchang shown special case competit equilibria exist task depend network section show exist market protocol converg competit equilibria find strong result gener problem review result price equilibrium auction theori reveal limit posit result typic good definit analyt result obtain good wellknown arbitrarili good gener equilibrium equilibrium price exist convex product function gross substitut condit met gener protocol find competit equilibrium distribut manner algorithm implement protocol comput price alloc good distribut system distribut protocol discret good good competit equilibria exist exchang economi gross substitut condit met show exist singl complementar suffici preclud equilibrium exchang economi show exist assumpt natur interpret task depend network reader consult standard textbook detail discuss exchang gross substitut suffici condit common type simultan ascend auction converg competit equilibrium agent bid variant simultan basic structur includ separ auction good interest agent submit success higher bid auction auction clear agent stop bid highest bid agent win good pai base final bid simultan ascend auction promin unit state fcc spectrum auction wide studi perform simultan auction desir agent complementari prefer wide recogn problem simultan ascend distribut auction leav agent undesir good complementari prefer combinatori auction altern approach distribut auction combinatori mediat negoti singl perform global match combin good base bid gener approach receiv attent ai commun motiv part techniqu quickli perform global optim sandholm result combinatori equilibria auction establish economi wurman wellman combinatori demonstr combinatori price equilibria exist wurman wellman describ iter combinatori auction combinatori equilibrium framework park ungar describ iter combinatori auction converg effici alloc agent follow myopic strategi strateg analysi analysi agent bid polici import challeng compon evalu implic auction design bid polici determin individu control auction mechan design bid polici number distinct polici account agent effect alloc monetari transfer identifi polici strateg necessarili fulli gener wai agent strateg import understand gener determin polici strateg simpli observ bid behavior underli reason determin polici strateg natur access explain behavior strateg term begin analyz agent bid make assumpt agent common assumpt agent ration agent knowledg capabl auction imperfect knowledg agent inform attempt optim expect surplu obtain auction wide studi concept analyz strateg polici equilibrium set polici constitut equilibrium agent incent deviat agent plai equilibrium polici assumpt agent common knowledg distribut agent cost valu drawn mcmillan survei state knowledg strateg analysi auction exchang economi insight fundament challeng understand agent behavior prefer good complementari definit result restrict market encompass market characterist task depend network except gener vickrei auction exist techniqu comput foundat game theori text chapter formal treatment strateg issu auction mechan design analysi gener complementar major type distribut combinatori iter problem inform structur extens form game task depend prerequisit comput current state art game theoret analysi comput equilibrium addit assumpt agent behavior analysi common assumpt agent comput bid base current current price good interest myopic manner park wurman type util function exclud type straightforward bid polici exhibit properti agent chang bid full histori bid auction assumpt behavior plausibl larg number agent potenti contribut agent solut small gain strateg behavior advantag agent bid case establish pursu aggress strateg behavior lead pitfal uncertain environ wellman tournament framework develop evalu candid agent polici complic domain santa fe doubl auction tournament provid unexpect insight effect polici continu doubl auction icma trade agent competit encourag develop sophist agent polici complex market game exist class auction variabl refer vickrei mechan gener vickrei auction easi comput agent bid polici agent report entir util function submit bid combinatori comput global optim report price good bundl charg comput domin polici agent report true util matter agent agent report true greatli simplifi agent problem strateg properti perfect ideal econom perspect comput budget buyer seller pai monei imposs simultan ensur incent budget individu ration agent achiev neg recent work park al suggest budget individu low incent deviat truth report chapter protocol make progress understand market protocol discret product develop protocol call ascend price simpl implement environ produc good alloc support equilibrium paramet protocol auction mechan separ auction good auction run direct coordin agent interact auction submit bid good bui sell bid pair offer bui sell indic quantiti offer indic price offer bui unit good refer bui offer offer sell unit refer sell offer agent bui sell good task depend bid posit neg quantiti offer assum jq offer bid agent submit multipl offer auction receiv send bidder price quot price result auction end current bid state offer ti current win lose due tie current price suffici agent win offer price clarifi price quot report bidder quantiti bui sell current state agent bid notif agent chang leav previou bid stand assum commun reliabl asynchron messag eventu reach bound delai note auction agent determinist run nondeterminist due asynchroni auction send id recent bid receiv agent price quot agent respond price quot reflect recent bid agent difficulti establish understand input output bid state base delai report bid continu state messag agent auction alloc auction bidder notifi final price unit transact good note quiescent system necessarili solut state detect straightforward central asynchron system perform oper local messag pass chapter describ protocol detect gener distribut base algorithm auction run rule wurman price auction variant vickrei auction gener exchang multipl unit good set offer includ unit offer auction set price equal price highest offer offer price separ winner winner includ sell offer strictli price bui offer strictli price formal definit asynchron reliabl messag pass system agent offer price case offer submit earlier win bui sell offer match issu price auction report price current good price specifi amount buyer offer order bui current set offer price determin price mth highest offer produc complementari ensur feasibl challeng requir care design auction run auction requir price agent success bui offer posit number price success sell offer auction enforc ascend rule simpli reject agent offer price constrain direct price design produc accur indic rel price input output price fluctuat direct common auction literatur practic place ascend restrict price fact place restrict price ascend offer price restrict ensur price quot rise monoton auction progress section show restrict bui sell offer serv kei role establish relationship system solut converg system bid polici design negoti mechan gener control agent outcom mechan base assumpt behavior typic assumpt econom agent ration plai polici form equilibrium discuss section complex suppli chain rule differ typic simultan ascend auction agent submit offer price increment current price format market current analyz equilibria simultan ascend auction analysi assum agent follow bid section variat respect polici describ explor rang chose work investig set polici depth chosen polici obei ascend offer restrict enforc respect local inform requir knowledg agent myopic inform provid current price forecast futur price recal consum acquir singl good maxim surplu price assum consum initi offer good interest long win chang offer win offer good argmax stop bid produc object maxim differ price receiv output total price pai remain feasibl assum produc initi offer sell output subsequ offer price attempt recov perceiv cost input case offer quantiti input win input perceiv simpli win price previou offer made perceiv cost offer output multipl offer good assum separ perceiv cost respect bid output produc initi offer input gradual offer ensur feasibl offer price input good price quot lose good win output figur show produc bid function current price current current price quot shown good dash arrow good produc lose solid arrow produc win good current offer price current offer price current offer price offer good price hold figur produc dash arrow good produc lose solid arrow produc win good note produc place bid output good receiv commit input good produc counteract potenti risk continu updat bid base price feasibl statu produc reduc exposur dead end increment offer price input minim amount properti price equilibrium effici properti equilibrium interpret term price suffici condit result correspond equilibrium theorem price alloc determin protocol iff inact produc bui input inact produc bui theorem establish bound ineffici good differ result high valu poor bound ineffici equilibrium agent win offer equilibrium construct altern equilibrium price tighter bound ineffici equilibrium alloc produc proof theorem detail theorem equilibrium comput nonneg differ effici alloc bid polici safe produc produc obtain neg surplu except produc bid polici safe safe produc bid polici ensur feasibl produc arbitrari network polici produc bid polici meet constraint offer price offer price input win output offer price high assum produc offer price input lose current offer input win current offer output produc updat bui sell offer simultan price quot polici produc bid input base state current offer respect offer place output produc win output neg surplu stuck win input offer slight variant bid call safe safe produc produc updat sell offer price updat input win newli updat output offer theorem quiescent state safe equilibrium network input complementar safe safer individu longer reach regular safe produc wait notif result pend output offer input offer result delai greater local delai commun output good auction produc win output offer requir propag messag path network buyer output good bui offer price good gener type network cost structur produc equilibria section examin weaker properti converg valid solut equilibrium run result dead produc bui potenti sourc effici loss figur show result run network valid solut dead end produc produc incur cost provid good contribut dead end pure wast global effici perspect alloc undesir directli produc commit pai input make larg network dead end result effici neg profit individu agent contract decommit protocol remov dead end reach decommit inact produc win input posit price decommit contract input protocol appli produc lose output due decommit decommit process agent exchang good remain contract refer decommit figur produc decommit contract theorem impli agent decommit iff produc equilibrium remov produc remain agent equilibrium decommit benefit produc lose monei agent receiv neg surplu particip achiev make auction alloc undesir produc lose output sale decommit start consum figur network network requir exponenti number bid reach beg question enforc requir inact produc agent decommit addit dead effici lost fail find solut posit solut form solut inferior effici solut end necessarili mutual chapter describ analysi sourc equilibrium attain set network solut converg auction bid polici suffici system reach refer maximum consum max note section commun model assum messag deliv eventu messag arbitrarili lost agent auction messag id ensur handl messag order theorem reach finit number bid observ asynchron run protocol requir number bid exponenti network function consum figur show network illustr observ agent start place bid sell unit good produc initi lose input agent offer price output good produc receiv price quot good updat bid good offer price time price time continu produc updat bid good time extend network maintain label consist figur produc place bid good note bid price quot propag exponenti growth occur situat converg requir exponenti number bid asynchron turn bid superflu meaningfulli affect outcom protocol describ persist state subsequ bid effect matter solut converg converg requir number bid bound size network maximum consum definit run state consum activ produc bid receiv chang bid price quot receiv transmit auction requir subset requir observ quiescent state state theorem run time time theorem run state time time produc inact inact produc activ activ theorem subsequ bid effect term solut converg theorem establish bound number relev bid reach theorem reach state number bid bound polynomi size network consum activ produc chapter describ distribut protocol detect detect termin negoti reach price sell offer consum good rise system necessarili reach state reach price consum good reach valid solut theorem reach system state repres valid solut converg fact problem find solut lead expect problem converg solut exponenti number bid number bid bound polynomi expect exist network converg solut exponenti practic find construct problem consum exponenti order converg solut proof reli reduct sat problem find solut task depend network random problem phase consid hardest problem sat algorithm solv crawford gent mitchel difficult encod task depend network run simul requir reason remain futur work class task depend network requir exponenti consum converg metric gent al difficulti problem provid insight perform task depend network theorem run valid solut state consum win offer agent correct belief good bid consum activ produc receiv current price sell offer lost due tie subsequ price quot system state valid solut note requir ti sell offer suffici ensur alloc seller chang ti sell offer activ produc sell offer price price output good produc lose tie break output system con figur network network converg solut valu converg valid solut valu matter high consum network shown figur observ solut includ agent includ agent offer price good win unit good agent offer price good agent offer price good agent win good account dynam show obtain valid solut pattern asynchroni exist special case network structur provid posit result solut converg recal theorem state safe variant converg equilibrium produc input theorem show suffici high consum converg solut theorem solut assign good consum cost exist converg valid solut identifi converg protocol nontrivi support experi variant fail reliabl termin solut state ascend price restrict pivot achiev desir behavior michael wellman ran set suppli chain format part classroom assign involv human agent plai role variant auction mechan restrict human fail reach solut ten problem trial run fact multipl found easili agent pursu simpl polici present section involv design softwar produc particip arbitrari task depend network economi economi simultan ascend price agent constrain follow bid polici section ran subset agent number economi hand trial homogen agent design replic student reach solut trial heterogen agent agent design result solut draw uncontrol report outcom suggest subtleti underli problem analyt result present complet pictur network structur understand perform perform empir result describ chapter success complet due larg effort classs graduat student scott wallac chapter combinatori protocol agent acquir undesir subset desir good shortcom market protocol agent complementari prefer problem manifest dead end address describ combinatori consist auction mechan strateg agent bid polici agent submit bid bundl good singl combinatori auction prevent dead end ensur inact produc acquir occur combinatori auction mechan simplifi exposit focu empir studi combinatori assum consum desir singl good denot framework easili gener includ complex consum prefer combinatori auction studi agent submit bid report cost auction comput alloc maxim report inform agent result agent pai price report alloc receiv auction receiv monei pai proce distribut evenli consum agent place bid form hr hg hg integ quantiti agent demand input neg good report pai case neg demand bundl good produc requir unit input produc output seek payment place bid set bid auction comput win alloc max st agent win global feasibl long produc bid repres local feasibl combin input output comput alloc optim report bid note assum produc singl set input complex equat produc altern product possibl agent surplu excess receiv alloc comput auction produc surplu divid remain report surplu equal consum consum surplu total surplu network equal effici alloc combinatori bid polici immedi agent behav report true combinatori auction result defin payment induc truth revel domin strategi scheme gener requir context mechan defin budget balanc interest open question altern design posit incent properti fact agent prefer regular assumpt explor lehmann al present opportun mechan design exploit effici alloc produc obtain surplu report true cost combinatori auction studi perform strateg bid polici combinatori auction elimin risk agent acquir bundl occur distribut agent place strateg bid face separ negoti structur assum common knowledg consum report true limit attent produc strateg behavior fact distribut excess surplu evenli consum reduc incent consum behav strateg assum class consum agent loss model strateg consum consum place bid dummi good place bid produc produc uniqu provid dummi good requir input good consum assum common knowledg structur network consum produc cost drawn probabl distribut uniform recal common strateg model auction literatur assum agent plai equilibrium strategi base common knowledg cost distribut task parallel produc consum unit shown figur deriv equilibrium produc network recogn correspond auction mcmillan show auction buyer valuat singl common chosen probabl distribut uniform buyer equilibrium bid polici adjust notat sign protocol base individu hold iter combinatori mechan wurman agent make increment offer bundl potenti interest determin implic strateg bid polici mechan remain interest complex problem produc dx reduc observ agent strateg offer accept payment premium converg number produc grow figur network network equilibrium deriv equilibria difficult slightli complic network produc equilibrium express network investig attempt defin plausibl strateg bid polici assum produc bid obtain fraction expect surplu scale expect proport contribut global show bid polici gener equilibrium polici simpl parallel network gener polici reduc network denot surplu agent case consist bid true valu cost agent produc particip effici alloc contribut produc alloc contribut produc alloc differ tween effici global global exclud note part effici alloc produc rel contribut defin term expect proport condit part effici alloc assum produc report possibl particip effici expect term bid network parallel figur turn bid polici correspond equilibrium strategi observ consist produc produc comput jp denot ith order statist produc reduc jx equat order statist remain produc cost remain produc cost uniformli distribut comput reassur justifi bid polici case entail firm complic network bid polici note plausibl win produc share expect contribut global empir revenu theorem impli analog result auction shown bid polici equilibrium section discuss produc deviat base bid polici explor possibl variant polici constitut network section present equilibrium analysi network network combinatori protocol lowest cost produc effici alloc win produc obtain fraction surplu deriv analyt express perform combinatori protocol slightli complic network chapter describ empir studi perform combinatori compar result chapter evalu market protocol compar protocol figur illustr divid space protocol necessarili class column distinguish mechan issu resolv global combinatori distribut collect auction row distinguish agent bid polici account agent effect alloc monetari transfer categor protocol dimens combinatori distribut true cost strateg equat figur classif protocol column distinguish mechan scope row distinguish bid polici strateg clear categor repres combinatori polici strateg dimens shown produc report true cost engag reason effect equat directli includ produc contribut effici alloc proper classif justifi produc polici input offer argument produc gradual offer avoid input reduc chanc stuck dead account possibl produc action result undesir simpl form strateg reason strateg reason account produc effect network context broader bid dynam strateg combinatori bid polici consid produc effect entir network argu lie closer end spectrum combinatori categor note section bid combinatori mechan produc perfectli effici virtual definit natur benchmark judg perform protocol section evalu effici protocol develop object perform comparison determin protocol question mechan design factor alloc comput commun author negoti scope agent bid behavior mechan design protocol liter imposs make progress understand challeng compar plausibl protocol mechan choic produc report true cost combinatori obtain surplu certainti combinatori bid produc achiev neg surplu occur bid aggress assum produc bid strateg combinatori auction empir result section show produc obtain posit surplu bid simultan ascend price auction argu plausibl bid polici combinatori mechan acknowledg gener constitut put reason pursu myopic polici face progress distribut mechan explan empti cell figur justifi strateg behavior distribut progress case difficult attribut dynam complex appli iter combinatori auction wurman perform evalu setup order gain understand effect combinatori auction protocol simul protocol sampl task depend network chose focu small set network exhibit varieti structur simpl unbalanc bigger studi network figur network simpl ran experi multipl instanc network instanc randomli chose produc cost uniformli consum calcul fix exclud exist solut consum probabl determin consum valu establish pursu aggress strateg behavior lead pitfal uncertain environ wellman bid behavior environ face burden demonstr reason figur network unbalanc figur network figur network bigger figur network assum distribut produc cost discard instanc effici solut set test effect competit equilibrium exist perform gener instanc cost admit competit equilibrium cost simpl theorem instanc thereof competit equilibria gener instanc bigger cost distribut gener instanc desir type cost structur repeatedli chose set produc cost randomli uniform distribut desir properti met determin competit equilibrium complet inform network procedur recal competit equilibrium effici optim alloc attempt solv system linear equat competit section solut equat result price constitut competit equilibrium exist commerci program find effici alloc attempt solv linear competit equilibrium equat type cost structur test random except feasibl run instanc instanc measur fraction effici attain measur fraction surplu fraction optim obtain produc implement lack gener close form combinatori bid experi emploi mont carlo simul comput approxim mont carlo produc gener cost produc uniformli effici alloc comput base true consum true cost randomli select produc comput report run comput final bid averag comput valu particip effici alloc refrain bid solv combinatori auction alloc problem approach introduc andersson al calcul valu simul essenti winner solv optim fraction total runtim simul domin commun perl script wrapper emploi manag aggreg data result experi effici combinatori protocol strongli depend figur plot effici achiev combinatori protocol seri network instanc plot point surplu measur horizont effici combinatori auction alloc shown vertic axi plot shade region show abstract result class effici function surplu figur result combinatori protocol experi network simpl number combinatori protocol effici region low rang surplu notabl except instanc condit region instanc slightli suboptim high rang surplu network exhibit region mix effici class middl region surplu contrast combinatori observ strong relationship surplu effici class figur result combinatori protocol experi network unbalanc condit cost structur competit equilibrium exist number figur result combinatori protocol experi network unbalanc condit cost structur competit equilibrium exist number figur result combinatori protocol experi network condit cost structur competit equilibrium exist number figur result combinatori protocol experi network condit cost structur competit equilibrium exist number figur result combinatori protocol experi network bigger number figur result combinatori protocol experi network number figur result combinatori protocol experi network condit cost structur equilibrium exist number figur result combinatori protocol experi network condit cost structur equilibrium exist number observ distinct vari effici class tabl show percentag instanc protocol network combinatori instanc network opt simpl equilibrium exist equilibrium exist equilibrium exist equilibrium exist bigger equilibrium exist equilibrium exist tabl distribut effici class combinatori protocol effici suboptim optim instanc instanc network neg opt opt simpl equilibrium exist equilibrium exist equilibrium exist equilibrium exist bigger equilibrium exist equilibrium exist tabl distribut effici class effici neg suboptim optim recal section effici loss attribut necessarili mutual dead failur form solut solut find suboptim solut infer percentag instanc exhibit suboptim examin differ total suboptim column tabl decommit affect contribut reveal elimin suboptim infer percentag instanc exhibit suboptim examin suboptim column combinatori protocol solv problem suboptim produc benefit compar decommit solv problem recal introduc discuss section agent bid strateg polici combinatori protocol produc instanc suboptim bid observ network network combinatori protocol produc number suboptim nonzero instanc explain phenomenon fact network multipl consum network singl produc report high lower report result posit combinatori auction gener result effici multipl consum desir produc effici solut possibl produc report consum suboptim solut nonzero solut combinatori protocol curiou result combinatori protocol produc greater fraction suboptim alloc instanc equilibrium instanc network gener result specif figur suggest number suboptim instanc network fraction suboptim instanc shown tabl greater number suboptim instanc sampl larger tion cost structur instanc network effici solut consum construct competit solut consum affect perform deriv condit equilibrium effici solut competit equilibrium support solut suffici exist price combin equat combin equat combin equat combin equat equat repres combin inequ elimin price compon equilibrium condit equat suffici condit exist competit support solut consum suffici condit nonexist equilibrium solut partial inequ made strict inequ ensur solut maintain ensur equilibrium exist support solut make strict inequ inequ remain valid add term side give condit nonexist competit equilibrium network consum effici solut higher solut consum equat solut consum sum solut show price equilibrium expect differ valu smaller case effici solut support competit equilibrium condit comput compon fact instanc instanc effici solut chosen give suboptim alloc tabl show averag effici attain factor network equilibrium exist differ dead end sourc ineffici exist competit equilibrium effect perform protocol produc perfect effici competit equilibrium exist studi instanc combinatori network simpl unbalanc equilibrium exist equilibrium exist equilibrium exist equilibrium exist bigger equilibrium equilibrium tabl averag effici network protocol effect equilibrium fact fail find solut case unbalanc protocol produc higher effici instanc admit competit equilibrium instanc network admit equilibrium clear combinatori protocol sensit exist competit equilibrium observ consist network type cost structur result effici combinatori protocol network combinatori protocol equilibrium network significantli equilibrium exist combinatori network unbalanc tabl comput student compar effici mean instanc admit competit equilibrium admit competit equilibrium check differ perform perform student compar effici instanc admit competit equilibrium mean instanc admit competit equilibrium tabl show result indic mean equilibrium instanc underli popul entri posit decim place small reject hypothesi equilibrium mean face high suggest safe reject hypothesi inspect data high probabl result equilibrium instanc larg neg effici fact entri evid equilibrium mean network cautiou result distribut uniform meet formal criteria applic inspect data support reach instanc network unbalanc admit competit combinatori protocol essenti produc produc perfect effici instanc admit competit equilibrium network produc essenti optim result instanc admit competit produc suboptim result instanc admit competit equilibrium network combinatori protocol produc optim effici result instanc admit competit produc cloud posit result instanc safe conclud effici equilibrium instanc tabl show percentag instanc attain competit equilibrium network straightforward determin equilibrium attain observ dead end strong connect exist competit network equilibrium simpl unbalanc equilibrium exist equilibrium exist equilibrium exist equilibrium exist bigger equilibrium exist equilibrium exist tabl percentag instanc attain equilibrium found found network simpl unbalanc equilibrium exist equilibrium exist equilibrium exist equilibrium exist bigger equilibrium exist equilibrium exist tabl averag effici network factor equilibrium attain equilibrium notabl except admit competit frequent produc dead end equilibria form small percentag preval phenomenon paramet chose exist equilibria support effici alloc requir high valu conceiv attain equilibria frequent higher valu paramet converg solut gener requir iter high valu bid paramet chanc offer overshoot consum valu successfulli find solut tabl show averag factor equilibrium attain produc result equilibrium care draw statist network equilibrium instanc note salient trend equilibrium run produc perfect smaller ineffici bound theorem alloc produc equilibrium iff dead expect portion effici loss equilibrium produc run attribut neg surplu incur dead end differ effici shown equilibrium column evid hypothesi surplu lost dead end suboptim solut domin ineffici equilibrium attain improv decommit greater differ effici optim effici tabl show averag fraction surplu obtain protocol recal combinatori extra surplu strateg produc distribut evenli consum produc obtain posit surplu strateg bid polici combinatori auction base combinatori network simpl equilibrium exist equilibrium exist equilibrium exist equilibrium exist bigger equilibrium exist equilibrium exist tabl averag fraction surplu obtain produc network protocol network produc gain surplu bid obtain surplu reason produc output offer minimum amount accept exchang output rise bui offer price rise produc output offer happen case block agent feasibl alloc note decommit step distribut high averag surplu produc averag produc surplu highli shown column strateg analysi combinatori protocol assum bid polici argu plausibl combinatori auction show constitut equilibrium simpl class network class parallel network shown figur show equilibrium task depend network gain greater insight strateg problem combinatori perform analysi simpl network section describ simpl network comput multipl equilibria section explor weaker notion constrain strateg equilibrium network simpl special case equilibrium network shown figur assum cost combinatori auction consum obtain good denot produc neg figur network agent win bid auction perfect effici surplu produc agent receiv surplu averag effici obtain set bid polici equal probabl solut comput combinatori auction strateg game bear similar asymmetr inform version nash demand game equilibria exist form asymmetr inform nash demand buyer seller cost drawn uniform distribut common knowledg buyer seller place bid exchang good seller buyer buyer report greater seller exchang good price offer present model seller produc assum consum report true common model buyer combin consum produc maintain strateg origin assum excess surplu consum reveal differ nash demand buyer seller split surplu differ report close form base combinatori bid polici close form base combinatori bid polici network produc show bid polici equilibrium network depend produc improv expect surplu report lower higher amount equilibrium polici network theorem equat constitut asymmetr equilibrium network proof proof theorem polici assum produc report equat produc improv chanc win report win report produc effect choic win report produc win produc similar produc produc equat bid produc jointli obtain surplu iff win expect effici equal expect fraction surplu obtain produc expect effici equal probabl solut turn expect effici maxim agent win includ probabl agent win maxim con figur network gener polici appli singl consum network good good potenti buyer potenti network shown figur solut network easi equilibrium network special case produc simpli particip iff equilibrium polici previou section relat cost produc section polici close ti produc theorem equat constitut symmetr equilibrium network comparison bid polici produc polici effici surplu base fix linear tabl effici fraction surplu obtain produc combinatori bid base fix linear tabl show expect effici expect fraction surplu obtain produc bid base fix price linear consum fix solut instanc result maxim expect effici result obtain extens simul mont carlo report sampl mean confid interv produc cost chosen randomli uniform distribut instanc posit surplu effici result base polici confirm analyt observ obtain higher effici higher produc surplu equilibria base bid polici daniel reev perform role produc analyt result network equilibria prefer base polici gener base polici includ equilibria broader class network gener method automat comput equilibria goal requir advanc explor form equilibrium network form repres continuum fact arriv equilibria simpli guess form prove equilibrium suggest multitud equilibria network result beg question agent equilibrium plai equilibrium select open problem refin select equilibria field game theori deviat instanc experi section found empir network singl produc expect obtain higher surplu report assum produc report base bid polici produc network simpl improv expect surplu unabl comput equilibrium explor possibl exist constrain strateg equilibria call consid set coeffici fh produc report produc improv surplu threshold percentag report base report comput mont carlo simul experi section perform search coeffici constitut network simpl note produc network metric strateg limit search homogen search discret unit tent search deviat coeffici vari discret increment found produc network simpl improv surplu random instanc homogen coeffici provid small advantag deviat surplu optim figur result polici network simpl number measur base simpl combinatori equilibrium averag effici produc averag fraction surplu tabl summari comparison base combinatori bid polici polici network simpl produc report higher network instanc base polici shown figur region bigger base protocol higher report reduc averag shown tabl produc lose surplu obtain lower produc gain surplu report win tabl show produc obtain lower surplu report compar base polici comput equilibria perform limit deviat analysi network network unbalanc competit equilibrium produc expect gain surplu report assum agent base polici conjectur produc gener report higher base polici follow result base polici section constitut upper bound effici deviat incent network competit equilibrium produc gain report agent gain deviat agent benefit deviat result suggest complex form network simpl chapter detect distribut negoti chapter describ market protocol suppli chain format run state agent stop bid detect straightforward central asynchron system perform oper local messag pass problem distribut negoti run chapter describ protocol detect gener mediat distribut base algorithm agent incent deviat detect present augment elimin incent form deviat framework develop appli mediat limit protocol negoti model set set manag specif negoti issu involv subset agent mediat control exchang resourc design concern denot agent interact mediat mediat agent interact definit negoti network undirect bipartit graph vertic edg link agent mediat exist edg iff defin edg term negoti mechan requir network structur fix negoti process mediat agent figur network mediat negoti network case task depend agent consum mediat manag negoti good auction descript negoti network model meant encompass broader class mediat negoti problem negoti network depict figur run agent box mediat circl negoti protocol gener type messag agent send offer messag mediat send notifi messag agent form content messag vari rule enforc mediat negoti polici agent negoti offer typic bid bui sell notifi price quot highest bid type rang arbitrarili defin messag space assum mediat implement fix rule issu notifi messag agent function offer messag receiv agent agent execut negoti dictat offer messag transmit mediat function histori notifi messag receiv mediat implicit descript negoti behavior complet determin messag pass negoti network assum extern event interven mediat rule agent strategi assum commun reliabl asynchron recal mean messag eventu reach bound delai note mediat agent determinist negoti nondeterminist due asynchroni design send action entiti send messag msg entiti action receiv msg denot receiv definit negoti protocol quiescent messag reach intend recipi send occur receiv agent send offer base receiv set notifi messag mediat issu notifi base receiv set offer messag process reach negoti mediat final outcom commenc execut phase individu entiti determin base negoti messag send receiv process quiescent local negoti messag send base receiv point asynchron commun finit threshold local suffici ensur global detect detect protocol oper layer top underli negoti protocol protocol augment negoti protocol offer notifi messag previou addit messag manag detect process algorithm dijkstra termin detect algorithm directli serv author distribut process send messag activ entiti send messag activ continu send receiv messag send comput termin entiti send messag describ essenti algorithm complet consult lynch start initi quiescent sourc send messag entiti newli activ entiti make note entiti activ proce protocol inact activ receiv receiv send fulli acknowledg local send figur schemat state diagram entiti algorithm behavior gener entiti protocol present schemat figur initi quiescent inact activ receipt messag transit activ respond messag receiv agent acknowledg ack track messag implement deficit increment send messag decrement receiv ack reach state messag local transit back inact send ack messag activ outstand activ relationship protocol form sourc root tree extend activ leaf entiti local quiescent process reach sourc sourc receiv acknowledg detect process termin observ detect process termin iff underli protocol quiescent applic negoti defin layer top appli algorithm mediat model straightforward agent mediat augment behavior pass track ack messag detect protocol result behavior essenti composit basic negoti behavior transit diagram figur case negoti initi singl entiti entiti plai role detector global case appli negoti network consid initi subsequ activ trigger state chang entiti negoti begin state multipl entiti local state negoti situat trigger extern event schedul announc agent send offer messag handl augment negoti network introduc special call consist agent potenti activ initi mediat plai role activ relev agent immedi commenc negoti ad central detect algorithm activ origin acknowledg ultim flow back observ commun directli initi negoti protocol distribut agent mediat awar neighbor network entiti detect global dissemin negoti inform mediat agent proce execut negoti deal simultan independ negoti feasibl desir wait entir negoti network achiev global order begin execut deal agent world ultim connect path relationship area negoti complet virtual irrelev distinguish independ negoti detect simpli maintain separ ident separ initi negoti protocol involv distinct agent mediat maintain distinct state activ link acknowledg deficit distinct protocol negoti messag negoti part ack messag reflect back negoti ident messag acknowledg sourc entiti detect global limit negoti initi inform involv entiti negoti complet negoti correspond independ interact negoti level depend actual entiti particip multipl negoti activ base predic local activ negoti interest tradeoff case interdepend issu negoti treat part negoti process ensur quiescent state exist execut issu separ prevent necessarili delai concern predomin depend factor likelihood sever delai agent weigh criteria protocol associ outgo negoti messag deter deviat discuss presum agent mediat follow protocol assumpt typic justifi implement certifi global trust question case agent design negoti mechan account incent face incent construct augment detect deviat distinct wai agent deviat detect protocol failur acknowledg receiv messag activ mode failur acknowledg activ reach fulli acknowledg state prematur acknowledg send ack fulli acknowledg state activ agent activ negoti spuriou acknowledg receiv messag deviat easi elimin technic mean requir specif refer acknowledg messag ack entiti recogn acknowledg addit implement requir uniqu messag identifi acknowledg state complic deficit counter typic worthwhil negoti ignor categori deviat henceforth note variat behavior underli negoti protocol form respect detect protocol case agent fulli acknowledg local action send immedi enter state incomplet acknowledg assum negoti protocol restrict agent enforc mediat base inform agent typic discret negoti influenc presenc absenc reliabl detect agent activ mediat concern potenti delai reach global perfectli affect correct determin process agent discret send offer messag activ prior receiv messag long offer claim part exist negoti case constitut activ action effect amount initi distinct negoti discuss section incent deviat failur acknowledg fail send ack agent effect hold detect process negoti messag prior ack affect set action inform dissemin mediat conceiv delai agent affect time detect systemat underli asynchron commun model limit predict effect delai acknowledg indistinguish delai commun set run negoti protocol unaffect failur acknowledg effect agent fail acknowledg prevent negoti deal execut direct benefit agent statu negoti deal run protocol produc dead end agent benefit mechan outcom particip initi term individu ration indefinit delai acknowledg elimin dead end leav open possibl agent acknowledg attempt influenc outcom negoti underli negoti protocol unaffect occur due sensit agent prefer time complet negoti threat agent delai block execut negoti deal agent modifi make concess threaten agent delai negoti affect behavior relat independ respect negoti prematur acknowledg prematur acknowledg agent inform activ negoti mediat turn activ ongo deviat protocol incorrectli detect global agent strong incent deviat negoti network figur instanc network shown figur agent activ mediat turn activ activ agent consid negoti depend negoti reach state consid result mediat suffici favor outweigh uncertainti outcom send ack sourc detect final favor outcom wait rest network quiescent run risk send offer diminish outcom figur agent incent deviat network mediat prematur acknowledg mediat improp acknowledg fact result prematur detect improv point deviat fact prevent agent negoti action prematur acknowledg potenti explor extens protocol counteract activ activ serv prematur acknowledg interest activ incent activ agent mediat reason subsequ activ ack local quiescent end benefit reason similar deviat remedi prematur acknowledg effect prevent activ mediat backbon address potenti incent agent deviat detect exploit fact agent commun directli presum faithfulli execut protocol effect circuit path elimin abil agent cut negoti prematur acknowledg activ mediat necessarili pathwai potenti depend agent set link oper protocol modif offer messag carri indic mediat activ send agent offer activ receiv agent treat agent activ immedi acknowledg activ interest link agent notifi agent activ messag outstand prevent decept notif extend authent mediat valid proper activ link form newli activ mediat act agent messag establish activ link predecessor result modifi activ link form agent leav modif introduc commun retain distribut commun structur origin network requir agent initi repres mediat figur depict version network mediat activ path agent direct link activ pattern figur figur network activ backbon observ augment detect agent incorrect detect prematur acknowledg activ mediat deviat scheme acknowledg agent posit wait activ acknowledg detect protocol call acknowledg complet local comput messag pass guard failur timeout threshold acknowledg expir directli elimin possibl deviat addit coordin mediat similarli elimin deviat timeout lead incorrect detect asynchron commun uncertain comput risk messag acknowledg lower timeout activ acknowledg delai messag acknowledg attribut local agent process asynchroni commun link delai activ acknowledg delai entir network worthwhil accept risk order deter anticip delai tactic applic auction provid direct system relat auction instanc gener mediat negoti model bid offer messag price quot notifi messag auction relat good run simultan coordin simultan ascend agent manag commit ensur auction close iff agent finish bid oper typic resort central control techniqu achiev properti distribut asynchron environ detect work detect motiv detect protocol describ appli detect protocol consum initi subsequ offer notifi messag depend network agent auction auction close global suppli chain acquir input produc result extens protocol support activ acknowledg follow natur line necessarili direct relationship section observ run requir number bid exponenti network size reach reason bound obtain number relev bid reach turn modifi detect protocol slightli detect detect produc acknowledg bid inact receiv produc output bid due ascend remain inact agent bid produc output good agent follow detect termin iff consum quiescent produc inact iff run argument proof theorem produc inact place output bid number input bid polynomi network size remain inact observ detect protocol termin number bid bound polynomi size network agent follow detect consum activ produc chang run inact produc win state good negoti termin continu inact produc deviat incent detect protocol detect protocol observ inact produc win incent acknowledg detect gener equilibrium comput market approach base system negoti structur resembl figur complet connect distribut price adjust serv underli negoti detect determin competit equilibrium reach andersson figur network negoti network describ equilibrium converg distribut auction comput good multipl node tree structur approach extend mediat negoti model messag pass mediat mediat agent basic approach detect appli distribut context feasibl decommit domain includ product sandholm gener rosenschein zlotkin local feasibl trade result global feasibl alloc trade execut immedi independ trade detect global establish feasibl establish global issu highli feasibl joint outcom strict feasibl hasti trade preclud potenti deal leav agent good hold andersson sandholm find mitig effect myopic behavior agent decommit opportun includ penalti decommit ensur contract decommit cycl indefinit defin commit entail negoti action central matter design negoti mechan expect vari level commit wide multiag negoti discuss contribut chapter formul distribut detect problem solut problem base algorithm protocol work correctli asynchron reliabl messag commun channel underli negoti contribut examin incent effect ad protocol layer detect show agent incent deviat basic protocol prematur acknowledg extens form mediat backbon prevent behavior argu result augment protocol potenti present incent agent deviat fail acknowledg messag deviat possibl timeout avoid behavior violat respect version protocol mediat deadlin messag acknowledg immedi case simultan independ gener leav agent design negoti process messag belong augment protocol mediat agent establish activ mediat negoti protocol start invok permiss detector mediat condit detector negoti requir agent associ offer messag exist polici matter worthi studi chapter proposit satisfi argu section natur assum decentr author electron commerc suppli chain format find decentr constraint present multiag system incent priori agent inform incent engag joint activ involv interrel depend understand comput properti kind decentr system requir model decentr comput yokoo formal problem distribut constraint satisfact problem design varieti effect distribut algorithm approach gener distribut adapt central perform effect pursu market model decentr system delin boundari knowledg line commun agent limit scope maintain knowledg resourc direct interest interact agent indirectli market auction approach increasingli popular recent evidenc number applic literatur market solv climat control power load manag alloc comput server flow belief aggreg sampl shoham tennenholtz directli pose question market provid answer interest appli concept econom mechan design commun complex behavior assumpt support addit case fifti year consid market decentr solut linear program problem adopt market protocol framework gener equilibrium theori yield comput model capabl solv convex program problem line analysi provid answer respect sort combinatori optim problem interest ai research multiag coordin problem resourc alloc wide believ pose fundament comput challeng address examin possibl market solv proposit satisfi problem decentr manner origin sat consid remain object activ research studi ai led greater understand difficulti steadi improv central start success describ market approach refer collect protocol approach describ emploi protocol sat problem encod task depend network market protocol appli problem refer origin solv sat problem highli decentr requir long time solv small problem show variant protocol solv larger problem albeit econom plausibl suppli chain format class np problem problem solv polynomi time nondeterminist comput problem class problem np hard term requir problem np wide believ problem mean requir exponenti time worst case develop market approach solv satisfi show problem form suppli chain show describ reduct transform sat suppli chain format problem transform combin protocol give describ standard sat problem formul suppli chain format problem definit set collect set liter truth assign satisfi definit chain format task depend edg solut theorem understand transform sat understand present proof appendix proof concept standard methodolog prove requir show problem class np prove polynomi solut fact solut show instanc sat reduc instanc polynomi time reduct transform answer problem instanc iff answer sat problem instanc reduct variabl fail satisfi truth assign iff kei observ reduct satisfi truth variabl satisfi jq variabl fail satisfi transform ensur order produc truth assign produc acquir fail satisfi scarc resourc jq alloc task depend network sat instanc includ good fail satisfi assign variabl satisfi assign agent jq produc fail satisfi produc posit assign produc neg assign produc assign individu variabl consum assign construct network ensur satisfi assign primarili control avail necess gc pc figur network transform fq fu fu proof np straightforward verifi alloc solut observ obtain good count edg incid good produc reduct transform instanc sat instanc jq add add add hs add add add hp add hg add add hp add hg add hg ci hp add hg gc pc figur solut network correspond satisfi truth assign shade vertic solid edg solut figur show network transform fq fu fu configur sat configur satisfi truth assign instanc map solut add add hp add hg add add input output edg add hs perform similar oper jq variabl fail satisfi jq produc requir input feasibl solut hp figur show feasibl alloc correspond satisfi truth assign network configur configur sat solut materi impli hp hp assign jq unit materi jq edg type hg hg jq variabl fail satisfi variabl satisfi satisfi truth assign transform run polynomi time number edg incid thereof polynomi size sat instanc market protocol full knowledg sat emploi central algorithm effect decentr agent incent particip market framework model term recov cost acquir assum produc cost consum obtain obtain singl unit good price indic rel guid agent local make protocol effect form suppli chain task depend network requir agent knowledg valuat good price inform reveal auction thereof obtain market protocol call origin appli sat task depend network assum reliabl synchron messag agent updat bid simultan synchron round assumpt serv focu studi simplifi result pertain gener task depend network appli asynchron case synchron theorem impli worst reach number bid round polynomi network size magnitud consum result present suggest requir larg number round reach valid solut find show section number round bound consum effect tradeoff runtim chanc find solut origin experi understand perform perform batteri experi compar central algorithm construct ran algorithm set problem chosen random sat model set variabl variabl chosen uniformli independ negat probabl elimin unsatisfi problem problem vari number gener consid hardest problem occur phase transit call crossov ratio problem satisfi mitchel hogg problem phase transit wide benchmark sat studi phase transit problem estim phase transit point experi comput formula found crawford fit data give ratio understand perform broader rang ratio ran trial number variabl total paramet set suffici high ensur found solut problem gener hard satisfi import gener problem randomli filter unsatisfi forc problem satisfi assign make easier filter method problem gener larg problem requir complet satisfi test procedur filter unsatisfi instanc al recent show gener hard satisfi problem effici hole agent auction run plausibl measur runtim bid round auction run lg ju time increment updat techniqu improv amort perform altern recal reduct transform produc number time sell directli analog flip variabl round multipl place experi show number flip highli linear number round flip compar bid round flip rough estim rel perform result algorithm found solut problem domin perform instanc ran significantli faster median requir time round requir flip figur show median runtim algorithm rang ratio problem fare poorli median heavi tail slow run shown figur runtim significantli higher median obtain qualit similar result problem observ figur typic sat algorithm mitchel runtim slowest phase show problem phase transit test perform result show constrain size problem practic solv prohibit slow fairli small problem solv effect worst run requir compar flip worst run problem requir ten million round hour comput limit rang problem size ratio median round median flip figur median runtim problem ratio round flip figur runtim problem suffici establish qualit perform rel variant protocol fact solv sat problem highli decentr fashion insight comput power market perform poorli prospect market model provid practic approach decentr combinatori problem import immedi discount market approach conceiv myriad approach prove effect guid explor altern market identifi aspect contribut poor perform number featur task depend network encod sat problem reduc perform assign repres separ assign agent variabl coordin auction share determin assign chosen direct encod singl agent repres variabl variabl agent directli determin assign base price wait bid round variabl auction report price quot presenc assign end slow bid price gener pass agent updat propag auction state variabl assign produc win make assign price higher current offer price assign produc updat bid adjust variant protocol describ section makoto yokoo altern encod central inform control compar origin task depend network encod argu natur agent repres assign figur network simplifi transform sat instanc repres network fq fu fu offer price higher current bid offer price offer price produc assign process potenti round formul simplifi market sat problem suggest assign produc consum variabl good origin make jq fail satisfi assum produc exist variabl variabl agent determin assign order select agent obtain fail satisfi chosen assign select assign variabl agent correspond satisfi sat assign iff agent acquir assign figur show network simplifi transform sat instanc repres network addit simplifi network explor altern auction mechan bid polici section describ variant simplifi sat market structur section agent submit bid auction auction respond price quot bid occur protocol continu produc continu place sell offer price focu bid variabl agent result section variant protocol perform faster uniform price protocol uniform price base adapt simplifi structur auction agent place bid offer bui price agent updat bid price offer publicli increment agent withdraw bid auction ident produc chang auction rule comput price alloc base current offer variabl agent number concret set bui offer jqj unit fail satisfi auction report price quot bid price price price highest price offer highest price offer fewer jqj offer bid price jqj offer bid price price equal price lowest offer bid price specifi price win bidder pai auction stop current state price specifi lose agent offer order win bidder price quot bidder offer price jqj highest offer price auction alloc unit price auction agent jqj highest offer win pai price quot final auction break ti favor earlier receiv randomli simultan receiv offer agent randomli initi assign variabl place offer price subsequ receiv price assign minim assign defin assign maximum sum current perceiv cost comput assign cost case agent current assign agent perceiv cost submit lose lose agent increment lose offer chosen assign hasnt submit offer submit offer price agent updat offer win current assign observ market reach agent local assign constitut global satisfi assign differenti price protocol differenti price auction agent place bid demand unit price agent switch quantiti demand constraint auction report price quot depend demand auction maintain premium price auction jqj unit total demand express bid auction report price quot jqj auction report price bidder jqj auction report price bidder demand report premium price singl bidder demand jqj auction premium report premium price randomli chosen bidder demand report price bidder demand jqj auction randomli alloc jqj agent bid demand alloc current bidder demand agent receiv pai price price quot receiv agent randomli initi assign variabl subsequ receiv price assign minim sum price report price prefer current assign cost equal agent initi flip place bid demand quantiti assign place bid demand quantiti opposit assign agent flip resubmit bid assign receiv premium price quot agent flip assign receiv price quot bid agent updat bid observ market reach agent local assign constitut global satisfi assign case agent pai receiv econom interpret ration behavior interpret protocol econom term requir model agent valu assum behavior plausibl ration assum consum place achiev satisfi pai monei alloc produc supplier seek acquir surplu profit particip singl sourc obtain satisfi solut variabl agent provid output potenti sourc incom make monetari profit variabl agent particip pai monei obtain individu particip satisfi solut variabl agent obtain particip satisfi solut variabl agent maxim surplu differ obtain total price pai acquir bid polici agent account effect behavior price alloc assumpt reason larg network individu agent effect outcom bid polici consid myopic agent bid optim surplu current price specul futur price produc myopic bid obtain base current price plausibl approach depend accur price quot price agent pai final alloc price quot agent pai bid stop current state protocol differ significantli price quot signal futur price movement price quot lower bound amount agent provid basi agent belief price quot price expect addit agent condit section ration variabl agent stop bid total cost assign exce agent pai global satisfi posit payment protocol termin unsatisfi alloc unlik expect ration agent stop bid reach satisfi alloc section call question price quot futur price indic bid polici plausibl ration agent reason expect protocol termin instanc auction termin negoti base random signal mechan encourag desir behavior bound length negoti search market price rel global agent price guid local bid process distribut search price support satisfi alloc price rise suffici high rel block variabl assign part solut initi weight current state solut current state local minimum make local chang reduc total weight violat weight violat end figur algorithm price close analog weight correspond fail satisfi algorithm present figur weight measur local minima visit algorithm weight bia search local minima contrast cost global state local protocol price local state price satisfi current occur local minima global state algorithm sequenti flip variabl assign reduc global weight violat weight count satisfi bid excess excess current choic variabl assign satisfi price agent attribut cost satisfi agent reduc bid demand agent attribut posit cost flip assign make agent cost evalu closer algorithm current cost evalu uniformli variabl agent distinguish cost evalu depend win case bid lose case price price assum total cost differ perceiv price extra win agent assum lower swap assign assign swap directli variabl determin variabl friction small agent offer bid price differ agent attribut wide vari cost agent attribut premium cost attribut cost unlik variabl flip simultan protocol benefici perform agent oper flip occur simultan yokoo observ detriment neighbor share incorpor synchron step db prevent simultan neighbor flip concern satisfi neighbor simultan flip satisfi variabl simultan flip satisfi expect preval protocol neighbor variabl simultan flip satisfi needlessli unsatisfi unlik protocol explicit mechan prevent simultan neighbor expect protocol differ number satisfi neighbor flip spread agent desir common similar total cost evalu price share simultan flip satisfi agent attribut wide vari cost cost evalu neighbor agent close expect reduc number satisfi neighbor flip complet show incomplet close variant morri show algorithm incomplet assum note impli asynchron system cnf observ solut problem assign variabl variabl case initi random assign agent submit offer price fail satisfi current assign assum random tie break occur win win win win tie break auction offer initi variabl agent cost current assign assign agent flip assign round submit offer price fail satisfi assign assum random tie break occur win win win win round agent cost current assign cost flip assign subsequ agent cost differ current altern auction tie break agent continu flip assign simultan round agent converg equal protocol oscil indefinit sat instanc show incomplet initi assign tie simul result strongli suggest converg solut refrain describ trace run due greater complex agent interact show incomplet exact cnf observ solut assign variabl initi random assign variabl premium unsatisfi long remain choic variabl pai premium chosen randomli posit variabl chosen pai case flip indefinit variabl flip algorithm reach truth assign converg satisfi truth assign necessarili make flip global delai undesir flip posit satisfi truth assign posit auction unsatisfi report premium price variabl protocol converg similar result hold variant experi section describ construct result experi compar protocol db construct experi focu behavior protocol benchmark sat instanc experi conduct satisfi uniform random problem phase transit ratio benchmark librari bound comput problem instanc ran protocol db round ran restart flip start round synchron bid round correspond cycl yokoo agent particip reach satisfi maximum round reach recogn artifici limit bid round reduc plausibl agent bid polici run experi db section chose approach consist compar perform protocol set experi measur term protocol term round result perform summar tabl show number variabl fraction run successfulli result satisfi solut standard deviat flip round compar protocol top subsequ protocol improv factor compar previou perform measur except compar perform averag improv median measur find satisfi assign higher fraction instanc improv due simplifi network essenti plausibl conjectur differ db differ number satisfi neighbor flip predict order protocol satisfi neighbor flip perform test conjectur measur satisfi neighbor flip recogn protocol simultan modifi central algorithm simultan flip ad hoc paramet control number simultan flip satisfi neighbor gain insight effect satisfi neighbor test simultan flip vari fraction neighbor flip vari number gener simultan flip distinguish contribut perform neighbor flip tabl show averag number flip flip round round flip averag fraction satisfi neighbor flip sfb perform substanti success ratio averag median db tabl perform protocol variabl measur protocol measur round flip neighbor flip flip protocol round flip round ratio db sfb tabl comparison satisfi flip problem satisfi neighbor flip fraction total flip result sfb support conjectur neighbor flip contribut significantli perform differ perform sfb sensit monoton fraction satisfi neighbor flip tabl suggest altern explan perform differ db requir time round time flip measur number round db perform flip found found averag number round variabl flip averag total round averag number round db perform flip averag total round poor perform rel db due extra round requir produc flip conjectur extra round happen auction randomli reassign premium price round agent cost fluctuat directli progress time premium verifi test variat price report premium fraction premium premium posit agent cost fluctuat heavili random assign premium cost problem found requir flip round ratio round flip round compar variant outperform fraction satisfi neighbor flip evid suggest differ perform db larg due extra round requir produc flip satisfi neighbor flip appeal round explain rel perform differ ratio round flip round altern explan poor perform due fact cost continu attribut respect satisfi price unsatisfi price distinguish satisfi unsatisfi price provid effect indic rel difficulti satisfi recal agent demand receiv price quot attribut cost satisfi test attribut cost satisfi modifi algorithm found algorithm rare found satisfi assign perform differ section test suggest identifi poor perform discuss decentr protocol highli decentr agent commun auction turn requir knowledg auction commun agent particip agent commun exist agent variabl auction commun agent variabl commun variabl oper fulli asynchron variabl synchron neighbor detect minima ensur neighbor variabl flip simultan experi suggest highli decentr protocol perform perform compar central algorithm perform factor db experi variant suggest perform obtain decentr open question decentr approach perform central sat algorithm present meet perform improv central algorithm develop advent central algorithm util techniqu restart contribut significantli perform subsequ base random flip reduc heavi tail perform distribut found restart significantli improv perform max flip max solv problem instanc averag round median restart implement synchron system cooper obviou techniqu util asynchron system intuit econom interpret restart respect random straightforward agent independ flip randomli fraction bid clear interpret econom term show suppli chain format transform sat problem task depend network show solv sat problem market protocol solv sat problem existenti evid highli decentr solut method gener class combinatori problem intrigu origin protocol succe explicit search state random perform origin base directli task depend impract slow improv perform protocol simplifi market structur price method significantli affect differenti price protocol roughli time uniform compar perform differenti price protocol justifi term ration econom agent behavior variant protocol perform significantli origin decentr distribut algorithm outperform differenti price factor found fraction satisfi neighbor flip explain differ perform origin conjectur evid suggest uniform price perform differenti price attribut cost satisfi evid suggest distribut solv problem faster differenti price requir fewer round produc flip inform analysi suggest search protocol work protocol resembl central algorithm appli intuit oper gener task depend analysi properli account broader class structur identifi tradeoff term runtim plausibl assum agent behavior understand tradeoff make inform engin appropri applic altern decentr approach problem environ market approach benefit provid interfac agent evalu direct behavior context broader make understand develop market approach complex coordin explicitli incorpor model agent econom motiv context problem solv futur work includ deeper analysi ration agent behavior chapter summari futur work order effect respond rapidli chang market busi partner autom process suppli chain format made contribut develop autom suppli chain format formal model suppli chain format captur subtask decomposit presenc resourc combin problem aspect receiv attent suppli chain format literatur develop market protocol presenc resourc produc suppli chain solut protocol common ai ma literatur present theoret econom analysi suppli chain format problem specif protocol shown protocol adapt solv proposit satisfi problem highli decentr fashion section summar contribut greater section suggest avenu futur work summari contribut provid framework autom suppli chain task depend network model suppli subtask decomposit presenc resourc content set respect decentr constraint local knowledg control agent argu auction provid effect approach structur negoti resourc exchang agent decentr manner auction rule combin agent polici bid auction constitut market protocol suppli chain format design understand effect suppli chain format protocol challeng limit theoret guidanc literatur thesi protocol presenc resourc produc solut greedi implement contract net analyz protocol respect effici distribut surplu price equilibrium strateg bid price underli type provid abstract framework guid decentr agent make encapsul inform rel good competit price agent optim respect price establish competit equilibria exist task depend network due discret good produc input complementar show competit equilibria exist network network input complementar produc requir introduc type approxim price call parametr agent individu alloc differ turn parametr suboptim global alloc equilibria prove analyz iter market protocol introduc protocol bid call due ascend bid reach produc feasibl termin solut state reach solut suffici high consum find solut minor variant find competit equilibria network input consum unabl converg solut network paramet set produc dead produc acquir input provid lead loss neg produc extend produc decommit dead end price alloc determin equilibrium iff dead end combinatori protocol agent avoid difficulti coordin input output found problemat perform global optim combinatori auction elimin problem dead end auction comput effici alloc agent bid true produc obtain surplu bid analyz auction assum strateg bid polici bid polici constitut equilibrium simpl class gener equilibrium empir studi show produc obtain posit surplu strateg bid polici combinatori auction surplu small rel consum produc strateg behavior result prevent suppli chain form find effici loss attribut dead improv produc gain surplu bid obtain surplu combinatori avoid dead end frequent comput alloc suboptim effici termin competit equilibrium pure competit equilibrium exist surprisingli effici gener higher network admit competit equilibrium effici combinatori protocol strateg bid affect exist competit posit perform strateg analysi combinatori auction network network show multipl equilibria equilibria discov result higher effici base strateg polici network simpl discov approxim strateg equilibrium lower effici lower produc surplu base strateg polici applic termin detect algorithm problem detect distribut negoti develop mediat backbon extens deter form deviat detect protocol addit main thrust protocol decentr proposit satisfi show problem find suppli chain task depend network reduct transform appli sat encod task depend network origin protocol solv sat problem highli decentr impract slow show variant simplifi market structur price perform protocol studi perform distribut protocol improv perform econom realism inform comparison protocol central algorithm shed insight oper search futur work task depend network model strong power global basi begin understand autom suppli chain format transform model complic product demand function necessarili strateg direct unnatur agent perspect extend model encompass altern product complex consum time depend suggest model present transform map multipl agent singl gener give strateg model gener multiattribut valuat task depend network manner similar method suggest model tempor multipli good space clear explod number good attribut effect handl greater number attribut requir multiattribut auction protocol pass multiattribut inform network realist produc solv complex intern complex problem order evalu cost feasibl option type extens fidel implic agent bid polici comput converg speed market protocol effort agent forecast agent predict certainti oper form suppli chain sophist agent emploi probabilist reason techniqu evalu evalu option negoti unexpect event occur impair oper form suppli agent protocol repair reform suppli chain thesi assum simpl set myopic bid polici simultan ascend auction agent coordin input output bid dynam auction understand strateg bid behavior challeng albeit import problem futur work develop game theori analyt extens form game iter auction make progress understand perform altern approach develop bid polici tournament proven effect wai encourag smart peopl design smart polici evalu rel effect polici wellman axelrod evolutionari approach evalu popul fix iter prison dilemma involv project search group approach step evolutionari framework search space parametr polici schedul problem simultan ascend auction schedul problem subtask depend characterist suppli hope success schedul domain provid insight approach task depend network suggest decommit solut problem dead end strateg analysi protocol phase account produc lose monei decommit expect produc aggress bid decommit beg question enforc produc decommit dead address fact decommit potenti break contract downstream produc reduc aggress bid mitig potenti charg penalti produc initi decommit paid produc output contract decommit reduc spuriou decommit produc stuck costli dead end strateg analysi combinatori auction base strateg bid polici gener gener includ equilibria broader class network gener method automat comput equilibria strong guidanc literatur approach problem gener verifi equilibria challeng task analysi perform network larger network auction type multitud potenti auction desir properti amen analysi interest avenu iter parametr polici exhibit complex formal strateg explicitli reason agent affect price alloc auction park observ auction desir agent comput valuat iter combinatori auction wurman iter combinatori auction suppli chain format handl bid bui sell offer role distribut auction combinatori auction negoti independ market maker cooper busi establish combinatori auction core portion industri market inevit compani negoti entiti core social manag combinatori auction design effect market combinatori auction remain interest problem futur work futur work line provid insight comput power market relationship price decentr search formal analysi present inform insight oper search appendix proof theorem theorem chapter proof theorem lemma feasibl alloc price express proof equat expand good materi balanc feasibl price term cancel left origin formula solut theorem equilibrium price feasibl alloc nonneg differ effici alloc proof refer condit equilibrium effici alloc condit impli feasibl recal formula feasibl alloc equat express valu condit alloc agent optim condit alloc agent optim equat impli condit impli sum term equat feasibl proof theorem effici alloc show construct equilibrium refer produc defin section show construct exist price defin competit equilibrium support refer condit competit equilibrium initi order max hg set price minimum valu activ produc nonneg surplu set suffici high consum obei equilibrium max set inact produc hg pi set posit obei equilibrium hg hg definit feasibl feasibl subgraph feasibl remov edg make lemma exist feasibl subgraph root produc proof feasibl subgraph root unit good produc good set price minimum activ produc receiv surplu output set produc receiv surplu theorem effici alloc exist equilibrium support proof feasibl constraint equilibrium met show price paramet construct surplu constraint equilibrium hold agent equilibrium condit hold construct directli ensur consum nv obei equilibrium condit show condit hold consum contrari produc price comput receiv surplu lemma exist feasibl subgraph root produc receiv surplu denot alloc augment ad feasibl agent lemma improv remov contradict optim equilibrium condit hold equilibrium condit hold set suffici high activ produc optim activ surplu inact produc output show altern produc price receiv surplu lemma exist feasibl subgraph root produc receiv surplu lemma improv replac hp gi contradict optim equilibrium condit hold inact produc input set valu suffici high remain show inact produc surplu suffici show inact produc acquir input posit price assum produc acquir good posit price acquir multipl price produc surplu price lemma feasibl subgraph root produc surplu improv remov give contradict proof theorem network input produc optim alloc partit produc set produc singl produc input procedur input complementar equilibrium construct price support competit equilibrium input complementar initi price perform price nv ne hg ci ne nv ne ne network input price sequenc directli connect sequenc agent good agent alloc sequenc vertic hn hn nv hn ne obtain surplu obtain obtain strictli posit surplu obtain hn obtain surplu activ obtain strictli neg surplu activ hn hn obtain surplu activ obtain strictli neg surplu activ nv hn hn obtain nonneg surplu activ obtain strictli posit surplu activ hn hn ni ne obtain surplu obtain strictli surplu open sequenc sequenc condit condit sequenc length greater sequenc lemma procedur input complementar equilibrium reach state sequenc constitut cycl proof contrari cycl price cycl cycl show creat feasibl solut higher give contradict initi hn remov edg edg ne add edg add remov vertic consist ad remov edg produc feasibl feasibl input output chang good agent inspect condit definit sequenc appli open edg incid ad remov materi balanc agent good materi balanc good good materi balanc produc feasibl agent unaffect transform definit agent obtain lower surplu agent obtain strictli higher surplu feasibl alloc sum agent price contradict optim assumpt exist lemma price good procedur input complementar exist finit sequenc price price proof show construct desir refer condit step procedur input complementar equilibrium price occur step trigger agent step obtain strictli surplu alloc condit price step desir nv price step good match condit step price procedur input complementar equilibrium ensur find agent match condit produc posit cost consum posit find agent find agent correspond condit find good continu manner process construct sequenc show process select vertic eventu select element nv lemma cycl eventu find nv give sequenc lemma procedur input complementar equilibrium termin proof contrari procedur termin price good infinit number time cycl vertic hn hn price good occur step agent good match condit step price trigger agent good price good price infinit number cycl exist price agent trigger price trigger agent good price good arbitrari number construct price sequenc lemma exist procedur termin theorem competit equilibria exist network input complementar proof show procedur input complementar equilibrium termin price agent obtain maximum surplu give competit equilibrium price lemma procedur termin procedur agent nv optim remain show nv contrari nv optim case algorithm prefer good price price immedi price rose price immedi lemma sequenc price condit sequenc surplu condit appli obtain strictli neg surplu denot creat feasibl solut proof lemma ad edg hn ne remov edg kg agent unaffect transform agent obtain lower surplu transform agent obtain surplu higher neg surplu feasibl alloc sum agent price contradict optim obtain maximum surplu nv line proof case show suboptim provid contradict optim shown algorithm termin agent optim support competit equilibrium alloc proof theorem effici alloc present procedur equilibrium construct lower bound upper bound price good turn bound construct price good prove result price fact competit equilibrium price support observ competit equilibrium treat consum obtain good set consum desir singl good max addit produc creat produc output input loss consum prefer singl good denot good consum desir denot refer hn ni neighbor vertex refer null vertex neighbor vertex connect subgraph select perform set set bound visit updat price bound set price lower upper bound procedur set price good set procedur updat bound neighbor fix updat surplu bound neighbor surplu bound neighbor properti maintain set updat surplu bound neighbor surplu bound neighbor properti maintain set neighbor perform set nv neighbor input output input output neighbor input output input output lemma procedur equilibrium comput price bound good proof contrari state assum good visit agent constrain set chang agent constrain set chang recal lemma feasibl alloc equal sum agent price show transform altern feasibl alloc comput altern price show sum greater initi good initi set chang price alloc portion root perform lower agent constrain perform upper agent constrain perform lower iff visit agent constrain perform upper iff visit agent constrain describ portion transform lower input constrain neighbor input perform upper agent constrain output perform lower agent constrain output constrain input perform lower agent constrain remov incid edg nv add incid edg upper output constrain input perform upper agent constrain input constrain neighbor input perform lower agent constrain output perform upper agent constrain remov incid edg nv add incid edg observ vertex visit upper bound lower bound show feasibl consum feasibl produc feasibl add remov incid edg add remov prove materi balanc good lower perform agent constrain occur set lower add remov gi upper perform constrain occur set upper add gi remov materi balanc maintain good visit lower set immedi set lower agent nv good output ad lower set lower agent good case input ai remov lower set upper agent good case case input ai remov upper oper occur lower constrain set ad lower agent constrain set remov lower combin addit remov edg incid prior lower materi balanc maintain show similar result visit upper establish feasibl show agent agent agent visit construct alloc visit upper constrain upper set price neighbor good price comput set price neighbor good comput neg surplu price nv posit surplu price altern price assum visit construct visit upper constrain set set upper set price good neighbor price comput set neighbor price activ surplu visit lower constrain similar argument upper surplu shown agent agent contradict initi assumpt good theorem competit equilibria exist proof show agent optim price comput procedur equilibrium feasibl result price alloc constitut competit equilibrium construct ensur step set bound ensur consum nv optim construct lemma optim similar optim produc visit set good input set set price neighbor good price bound comput step set set smallest price maximum surplu bound neighbor good construct lemma price good set posit surplu price set set similar output step set largest price maximum surplu price set neighbor good price good set surplu optim optim shown agent optim shown competit equilibrium exist theorem chapter proof theorem prove refer condit equilibrium lemma reach network consum obei equilibrium condit proof consum maintain singl win offer good nonneg obei condit final price alloc contrari condit consum good bui won offer note algebra manipul contradict bui good price final offer offer won offer price substitut equat left equat consum bid polici specifi bid price contradict consum obei condit lemma reach network inact produc bui produc obei equilibrium condit proof bid polici ensur produc sell output nonneg lemma condit directli impli surplu sell obei condit produc bid polici feasibl final price alloc produc bid polici ensur offer win profit condit hold condit hold theorem price alloc determin protocol iff inact produc bui input proof case condit equilibrium fail inact produc bui input case lemma show consum obei equilibrium condit auction rule ensur condit condit equilibrium met proof theorem prove refer condit equilibrium lemma good quiescent state network agent win offer proof contrari agent win offer bui offer sell offer set case agent set bui offer bid agent bui offer lose offer agent win offer price produc bui offer increment consum offer agent place bui offer higher contradict case agent set sell offer case bui offer higher bui offer strictli recal sell mth highest offer determin bui offer sell offer sell offer strictli bui offer agent win offer contradict case case agent win offer lemma equilibrium price network exist price competit equilibrium produc good proof show condit equilibrium hold good materi balanc condit hold agent adjac good surplu bound met consum hold input bound perceiv cost produc bid polici impli produc surplu bound hold input agent adjac good lemma win offer impli win surplu bound met consum win won good equilibrium condit theorem impli produc bid polici specifi offer price hg output win give hg optim hg hg hg optim inact surplu bound met produc input theorem equilibrium comput nonneg differ effici alloc proof lemma equilibrium produc good substitut equat theorem prove present theorem proof theorem theorem quiescent state safe equilibrium network input complementar proof minim chang show inact produc bui input posit price invok theorem prove present theorem produc win input posit price lose offer output price final offer final price price quot receiv place offer price offer lose previou offer price higher assum win offer safe bid offer input win offer price high offer agent lose offer subsequ offer offer price higher win contradict assumpt lose win input posit price quiescent state safe equilibrium proof theorem prove refer produc defin section task depend network maximum produc maximum number input good maximum consum max lemma run network agent place bui offer proof consum offer bound prove induct produc produc place bui offer produc place offer bui input price increment bui offer mean previou time submit bui offer price lose bid quot greater offer greater output consum offer bui output produc lose output offer situat input contrari produc place bui offer induct assum produc place bui offer produc win output offer appli reason analog base case produc place bui offer lemma immedi lemma agent place bui offer proof consum offer offer place offer time produc initi place bui offer input lemma produc bid produc subsequ offer higher increment maximum input theorem reach finit number bid proof lemma finit number bui offer show produc place finit number sell offer establish finit number total bid produc chang output offer price input price input lose offer good win unchang input offer switch win lose price chang unchang input offer switch win state price chang suffici show price price produc input good chang finit number time prove induct produc price quot input good produc finit number time produc input place output offer input good produc produc input place offer price price chang chang bui offer lemma number bui offer finit assum produc place finit number output offer good input produc number output offer finit number input offer finit number input output offer place finit number output offer proof theorem prove refer produc defin section definit lemma run state time interv inact produc offer input good time interv smallest period time agent requir updat bid price quot proof definit interv consum activ produc offer simpl induct inact produc show produc inact time win output inact produc remain inact interv produc inact chang input offer lemma run time interv time interv smallest period time agent requir updat bid price quot proof contrari run time consum activ produc chang offer chang offer lost offer win chang input offer violat chang offer lose input price input lose bui offer price bui offer time agent chang win output offer chang input offer definit preclud lemma definit preclud prove theorem theorem run time time proof lemma conclud interv extend interv indefinit proof theorem lemma run time produc inact time inact time produc activ time inact time smallest period time agent requir updat bid price quot proof agent lower inact produc activ agent bui offer theorem definit inact produc chang offer lemma inact produc chang input offer remain inact offer activ produc inact offer output price input happen inact produc offer output chang offer chang activ produc feasibl chang violat lose bui offer time respond chang output offer remain activ theorem run state time time produc inact inact produc activ activ proof invari present theorem lemma proof theorem run network maximum produc maximum number input good maximum consum max theorem reach state number bid bound polynomi size network consum activ produc proof reach state observ lemma number bui offer bound polynomi concern number sell offer price bui offer produc perceiv cost good rise sell offer produc sell offer requir auction lemma impli activ produc perman inact place output offer proof theorem theorem reach system state repres valid solut proof definit requir activ produc chang feasibl agent feasibl definit price activ produc output good total price input output violat consum won offer consum bid win unit consum chang bid auction map success bui offer success sell offer ensur materi balanc constraint valid solut satisfi proof theorem theorem run valid solut state consum win offer agent correct belief good bid consum activ produc receiv current price sell offer lost due tie subsequ price quot system state valid solut proof current price consum bid polici dictat consum chang offer condit valid produc feasibl bui offer input agent bui offer activ produc feasibl valid solut win offer output input place offer output price higher sum input good price definit valid current price output good sum current price input won offer offer higher previou offer price higher sum current price input higher offer higher establish agent bui activ produc place sell offer good show impli price quot price assum contrari offer bui offer win sell offer price due updat lose sell offer price agent lose previou offer price high highest offer strictli higher highest price price tie break ensur set win bui offer chang win seller offer sell offer lost tie set win sell offer chang price alloc consum activ produc chang bid system valid solut state base current price valid solut state base price quot proof theorem prove refer produc defin section theorem solut assign good consum cost exist converg valid solut proof denot max max hg show theorem hold jpj show reach state win stop bid desir solut form observ consum good hg ai offer construct produc direct path output induct produc offer higher input basi produc win output offer definit input offer increment offer input offer input offer lose win output offer lose offer output win offer offer establish base case assum properti hold produc show hold produc induct win output argument similar basi offer prove induct case produc offer higher jpj input produc denot maximum number subgraph root show induct produc direct path offer basi produc offer bui consum offer produc offer bui direct path offer jpj bui produc offer sell offer successfulli bui offer higher offer higher amount number input equal offer basi case proven assum properti hold produc prove hold produc offer bui induct produc offer sell basi consum offer produc offer jpj bui offer bui output offer hg prove induct case jpj produc offer higher jpj jpj shown agent place bui offer high produc direct path place sell offer high agent possibl offer high offer win win offer higher win price observ theorem state valid solut proof theorem chapter proof theorem theorem equat constitut asymmetr equilibrium network proof recal network depict figur produc report easi incent deviat polici case assum produc report equat show polici produc expect surplu produc report es expect surplu reduc es deriv respect set result find report correspond equat expect surplu equat complex condit rang case expect surplu es expect surplu monoton optim report upper give es case case expect surplu es equat maxim point occur lower boundari case maximum li rang report give es maximum occur lower give es case case expect surplu rang expect surplu case high case polici case equat shown rang symmetr equilibrium appendix notat symbol mean task depend network set vertic task depend set edg task depend network edg agent good interest provid unit alloc alloc edg good agent interest acquir unit alloc acquir alloc set good task depend network set agent task depend set consum task depend network set produc task depend network subset produc singl subset produc alloc good consum symbol mean consum place good consum obtain alloc produc cost produc incur produc output cost produc incur alloc effici alloc price good network price good price good surplu agent receiv alloc price maximum surplu agent obtain price subject feasibl minimum amount bui offer parametr consum alloc suboptim equilibrium minimum amount sell offer parametr produc alloc respect equilibrium produc ps alloc respect input equilibrium maximum consum max maximum produc network maximum number input good produc report pai case neg bid agent combinatori auction maximum surplu report set bid combinatori auction maximum surplu agent symbol mean set produc effici alloc surplu contribut set produc surplu contribut produc set variabl set origin protocol protocol uniform price protocol differenti price db distribut algorithm bibliographi bibliographi dimitri henri bart selman gener satisfi problem instanc seventeenth nation conver artifici page martin andersson tuoma sandholm level commit contract myopic individu ration agent intern confer page andersson fredrik manag larg scale comput market intern confer system softwar technolog page fredrik integ program combinatori auction winner determin fourth intern confer page robert axelrod evolut strategi iter prison dilemma lawrenc genet algorithm simul chapter page morgan albert baker metaphor case studi agent bid actual cost schedul factori clearwat jeffrei john david porter alloc uncertain approach rand journal john competit equilibrium exchang economi journal econom joseph packag assign model technic anderson school lo novemb borenstein econom electron commerc journal econom winter david brenner john morgan versu simultan ascend approach technic princeton bargain incomplet inform oper peter bob william taylor hard problem twelfth intern joint confer artifici page john cheng michael wellman converg distribut implement gener equilibrium outcom comput clark price public good public fall scott editor paradigm distribut resourc alloc world web jame crawford larri result crossov point random artifici william virtual structur corpor centuri randal davi reid smith negoti metaphor distribut problem solv artifici loveland machin program commun volum page mark juan antonio architectur open electron marketplac contract net softwar agent acm confer electron page gabriel david gale strategi structur match market gabriel david auction journal polit christin anthoni john david porter improv design iter auction technic california institut march dijkstra termin detect comput inform process ronald joseph yoram mosh vardi reason knowledg mit daniel friedman john editor doubl auction evid drew jean game theori mit michael garei david johnson comput guid theori freeman ian gent tobi walsh sat phase transit eleventh european confer artifici page ian patrick tobi walsh search thirteenth nation confer artifici page ami peter stone autonom bid agent trade agent competit ieee internet grove incent team page equilibrium gross substitut journal econom english auction differenti commod journal econom bernardo colin william phase transit search problem artifici editori introduct special issu frontier problem phase complex luke barbara grosz combinatori auction collabor plan fourth intern confer multiag page issu dynam configur suppli web workshop negoti alexand vincent crawford job coalit gross substitut novemb dag coordin suppli chain schedul phd norwegian scienc paul auction guid literatur journal econom david game theori econom model clarendon daniel yoav shoham truth revel approxim effici combinatori auction acm confer electron page equilibria mechan bargain incomplet inform journal econom kevin mark yoav shoham test suit combinatori auction acm confer electron page david daniel electron commerc journal econom winter nanci lynch distribut algorithm morgan jeffrei varian gener vickrei auction technic dept univ juli thoma malon robert dawn economi harvard busi page michael jerri green theori oxford john mcmillan auction bid journal econom june john mcmillan analyz auction journal econom winter john mcmillan sell spectrum journal econom summer paul put auction theori simultan ascend auction journal polit april david bart hector levesqu hard easi distribut sat problem tenth nation confer artifici page jame moor thoma revolut rise deutsch paul morri method escap local minima eleventh nation confer page roger mark effici mechan trade journal econom david park ungar iter combinatori theori practic seventeenth nation confer artifici page david park ungar strateg manipul iter proxi agent seventeenth nation confer artifici page david achiev payment scheme exchang seventeenth intern joint confer artifici david park effici ascend price bundl auction acm confer electron page david pennock michael wellman repres aggreg belief competit equilibrium secur market thirteenth confer uncertainti artifici page jeffrei rosenschein zlotkin rule encount mit john john richard palmer effect trade insight doubl auction tournament journal econom dynam paul market mechan maxim research collect scientif paper paul tuoma sandholm suri improv algorithm optim winner determin combinatori auction gener seventeenth nation confer artifici page tuoma sandholm fredrik gain loss specul equilibrium market fifteenth intern joint confer artifici page tuoma sandholm implement contract net protocol base margin cost calcul eleventh nation confer artifici page tuoma sandholm limit vickrei auction comput multiag system intern confer page mark steven william trade seal bid exist effici journal econom mark steven william bayesian theori auction friedman chapter page bart hector david mitchel method solv hard satisfi problem tenth nation confer artifici page bart henri cohen strategi improv local search twelfth nation confer artifici page carl shapiro varian inform rule harvard busi school yoav shoham mosh tennenholtz ration comput commun complex game econom daniel market theori firm cambridg sharma critic research issu manufactur suppli web workshop agent electron commerc manag suppli william vickrei competit seal tender journal carl bernardo jeffrei scott distribut comput economi ieee transact softwar page william walsh michael wellman market protocol decentr task alloc intern confer page william walsh michael wellman effici equilibrium task alloc economi hierarch depend sixteenth intern joint confer artifici page william walsh michael wellman extrem decentr algorithm proposit satisfi seventeenth nation confer artifici page william michael fredrik combinatori auction suppli chain format acm confer electron page william makoto michael wellman approach proposit satisfi seventeenth intern joint confer artifici michael wellman hu conjectur equilibrium multiag learn machin michael wellman william walsh distribut detect multiag negoti fourth intern confer page michael william peter jeffrei auction protocol decentr schedul game econom michael peter kevin daniel william walsh design market game trade agent competit ieee internet michael wellman program environ applic distribut flow problem journal artifici intellig peter wurman michael wellman combinatori auction acm confer electron page peter william michael wellman flexibl doubl auction electron theori implement support peter michael william walsh parametr auction design space game econom fredrik han akkerman power load manag comput market intern confer page han akkerman decentr market versu central compar studi journal artifici intellig fredrik program applic power load manag phd lund makoto yokoo distribut algorithm solv distribut constraint satisfact problem intern confer page makoto yokoo algorithm distribut constraint review autonom agent makoto yokoo distribut constraint foundat cooper system
DB/359 3 theorem analysi tool david susan centr telemat inform technolog netherland septemb abstract present base analysi tool system integr constraint specif map logic reason semant oper mechan theorem prover isabel pv tool verifi semant requir schema transact support advanc transact model workflow cooper work give method safeti analysi gener structur edit oper cooper author system introduct specif methodolog program increasingli import past ten year recent led interest program verif theorem prover logic approach model featur hol present approach method behaviour singl object viewpoint typic includ integr constraint collect object lifetim applic program oper transform consist state point view state persist collect object give formal model persist object store simul memori structur implement model suffici describ oper semant typic featur program heterogen late nil valu recent system reli transact model requir design provid assert semant schema exampl includ limit consist requir preserv number static integr correct undo method method method effect commut tabl method method knowledg semant schema advanc transact model provid flexibl mechan concurr control essenti modern applic workflow manag cooper work assum design provid requir knowledg schema peopl make mistak seemingli trivial line easili lead inconsist persist data research support informatica describ tool assist design verifi correct assert schema outlin safeti analysi framework base theorem prove logic show adapt theorem prover task defin gener isabel theori system show specif schema encod proof schema perform isabel system paper overview analysi includ introduct isabel section section introduc specif call case studi section discuss formal model persist object encod semant specif schema model includ number gener oper theorem combin actual schema inform term oper discuss section show typic languag heterogen late encod section show extend isabel tool assist reason schema proof framework transact safeti analysi section discuss relat work analysi make theorem prover technolog section summari discuss futur work architectur oasi tool schema specif languag call oasi object includ facil constraint queri object transact definit featur object manipul languag common technolog late heterogen collect structur oasi tool similar loop tool oasi specif languag map schema translat simpl formal model object logic model resembl memori structur implement suffici describ oper semant specif languag reason compon tool implement logic incarn isabel theorem prover major compon oasi tool detail oasi specif schema translat ml oo theori isabel extend isabel theorem prover isabel open implement ml hol theori formal theori standard data type find set reason heterogen collect object share extend standard theori gener oo theori simul memori implement theori defin function describ effect primit updat retriev oper attribut updat attribut deriv number theorem interact analysi method transact schema translat schema translat directli implement ml map specif objectori schema defin term oper gener theori object input oasi ascii convert intern abstract syntax tree ml output consist isabel file extens definit class ml file extens standard lemma schema file load isabel proof schema initi oasi specif oasi schema consist number class persist integr transact class definit written simpl procedur updat languag oasi support singl inherit persist root provid entri point global variabl integr constraint oasi facil associ constraint schema constraint queri express state oql queri figur show part gener graph includ basic structur edit oper base implement document author system class handl file system object actual content identifi directori displai url address type schema defin abstract class element node atom node composit node concret extens class node link concret extend abstract class element class extend implicitli extend abstract class object schema defin persist analog attribut class program languag figur integr constraint content persist root constraint assert requir constraint assert link composit node link node composit node constraint assert element nest object command languag consist small number commonli construct atom updat object variabl attribut updat object persist reachabl java system object long directli indirectli reachabl root compound command form sequenti bound condit collect updat method call method bodi defin command statement method appli updat receiv object referenc persist attribut object pass actual paramet oasi schema declar number transact transact similar receiv object transact typic execut sequenc method applic notion integr ti system verifi integr method level focu method transact figur method definit schema method composit node section method remov element compon receiv provid connect element condit test appli abstract method class concret implement class node link late bind select implement base type receiv object method respect integr constraint schema section show oasi system prove automat constraint respect address attribut gener isabel theori object isabel specif call theori theori consist collect definit axiom system extend default collect data type theori defin gener theori describ knowledg objectori knowledg express term theori subject section syntax similar ml syntax part give annot clarifi symbol figur class persist root schema figur static integr constraint schema figur method definit schema state model partial function object identifi valu repres function predefin data function type partial function type model option option data type includ constructor repres undefin function repres defin function actual suppli type variabl type instanti concret type describ class structur section type object identifi defin oid alloc alloc abstract notion defin function retriev updat function model paramet make specif function extract domain object object store note declar natur definit isabel comput wai reason predic check object type satisfi predic predic filter express reflect type constraint definit defin predic appli compon function select inform compon definit motiv intend attribut select applic appli function object object arbitrari return arbitrari valu domain type modifi compon introduc gener function complement function applic return function written function oid equal return modifi oid valu map function return applic construct correspond delta approach observ function type object bind modifi object oid defin constant oper delta defin oper combin delta object store valu defin oper overwrit call figur illustr theorem oper accumul effect individu delta overwrit delta oper model sequenti model transact commit delta appli real state paramet object store addit oper call appli repres bound iter construct oasi command languag illustr oper set iter curri function delta depend iter variabl addit argument type applic construct accumul effect delta result appli element oid delta check modif element stand quantifi uniqu modifi select descript quantifi return case element updat appli updat correspond case conflict updat deriv number theorem interact gener oper theorem rewrit rule manner theorem includ rule associ reflex rewrit rule function deriv applic modifi object store valu figur list theorem applic rule correspond case delta pattern argument applic rule discuss section model knowledg oasi schema translat supplement gener theori discuss previou section inform input schema translat gener isabel file definit class integr constraint schema translat implement semant output hol notat schema translat defin implement oasi construct show paper discuss previou section introduc abstract notion state partial function oid valu gener type specif type variabl instanti type inform reflect class hierarchi data type data type disjoint union case concret class abstract class concret instanti structur inform object attribut suppli argument data type constructor inform includ attribut inherit superclass class refer compound object refer form accommod object share heterogen object class group isabel type constructor type provid requir type inform system inform model isabel conveni encod examin type tag section show encod oasi featur term gener theori enhanc inform queri constraint schema translat map oasi queri express function function input object store argument isabel predefin data type support commonli oql queri languag construct set express oql isabel syntax translat oql express straightforward translat oper object attribut select complic introduct object identifi explicit lookup object store encod gener retriev oper theori object repres comparison make function express type amount check object type isabel code accomplish express oid argument function symbol hol syntax function return type tag bind bound return gener theori object defin pretti printer print predic hide actual case split underneath pretti printer upper bound case mark base inherit relat oasi attribut select code oper oasi express type repres observ return wrongli type common deal undefin function result hol pretti printer displai express constraint queri constraint schema repres isabel pretti isabel quantifi written type cast origin constraint fall translat hol updat late transact updat method repres function hol function map input object persist oid actual paramet valu requir oid tupl tupl includ modif object persist method return method posit tupl method class hol side condit reflect structur origin method bodi condit applic method element object involv late base actual type correct implement method appli easili express predic print condit express yield boolean negat oper import comput condit assumpt branch proof compon tupl return branch describ effect assign attribut algebra manner subsequ compon tupl repres persist root paramet modif variabl tag tag mean variabl method appli compon tupl return boolean schema translat gener code shown inher automat code gener easili obtain simplifi term rewrit section transact transact sequenc propag transact commit transact distinguish receiv object transact semant provid appli addit input object store delta repres transact updat method transact level put code lookup receiv object appli method section give transact semant method system oasi tool support autom transact safeti analysi tool implement autom proof success specif initi proof goal safe natur deduct infer exhaust search strategi verifi combin transact search inher incomplet autom proof procedur return goal solv explain detail step start transact safeti proof start transact safeti isabel proof goal construct schema translat defin ml function autom process method constraint verifi method defin class safe respect constraint type ¤ verif method transact respect individu constraint predic depend addit constraint schema constraint necessarili order extract attribut object addit assumpt paramet command isabel respond initi proof goal form constraint assum hold initi state form substitut modif result method applic constraint express observ state constraint evalu form commit object store input object store mention section proof goal actual proof start unfold definit initi goal isabel simplifi simplifi perform set theorem theorem read condit rewrit term unifi express side equal sign rewritten term side provid hold default isabel simplifi instal larg collect standard reduct rule rule easili ad simplifi task extend simplifi ad number rewrit rule simplifi express involv construct gener theori object list addit file gener schema translat assert definit rewrit rule definit automat unfold step unfold definit rewrit initi goal complex occurr input object store replac express reflect modif subterm subterm repres condit constraint context updat object store pattern reduc rewrit rule gener theori object figur term rewritten rewrit attribut select algebra updat oper updat attribut irrelev respect select field identifi simplifi applic rule figur observ result attribut select express directli term input object store constraint irrelev respect part proof goal detect straightforward term rewrit prove method interact constraint proof requir updat appli part safe natur deduct infer step addit term rewrit isabel natur deduct classic reason set introduct elimin rule logic autom natur deduct infer default configur tool includ machineri reason tool implement search variabl introduc quantifi automat backtrack perform altern unifi tool requir distinct made safe unsaf rule safe rule appli introduc instanti undo step stage proof introduct quantif elimin unsaf safe step rid trivial case classic reason interleav step simplif simplifi extens made classic reason extens includ rule introduct rule predic rule proof gener automat oasi schema translat resid provid mechan reason type express type case gener type simplif immedi discard irrelev appli safe infer step goal gener list subgoal goal requir analysi exhaust search safe step remain goal subject exhaust analysi safe infer step interleav unsaf step involv undo unif step isabel limit search depth termin search tactic practic depth suffici case step autom proof strategi packag singl isabel tactic tactic proof procedur proof instruct implement heurist tactic paramet limit search depth call tactic depth initi goal produc ¢ ¢ tactic automat find requir exhaust search isabel print messag practic result oasi schema translat consist approxim line ml code gener oo theori line theorem input schema includ class method constraint theori ml file gener schema line code tabl show result verifi safeti method class respect method constraint proof time tabl result method safeti constraint figur proof time isabel run sun mhz solari time rough guid effici autom method safeti proof time trivial proof immedi solv theorem prover combin constraint method oper attribut discuss previou proof trivial straightforward term simplifi real power theorem prover reveal case constraint method oper attribut persist root combin constraint method previou proof involv tediou step part schema shown paper relat work number interest program languag issu studi isabel compil correct program verif interpret verif program languag semant studi involv deep languag semant hol languag semant semant domain model hol deep techniqu make gener proof program shallow gener theori object section analog semant domain state proof proof map hol term gener theori object theorem prover techniqu appli context relat formal logic hoar logic verif deduct synthesi transact respect number static integr constraint work share similar base framework modern theorem prover time author publish theorem prover technolog earli stage develop extens made order theorem standard data type natur number set defin scratch model capabl standard hol theorem prover al studi problem method verif respect static integr abstract interpret tableaux reason properti applic code logic import issu type object share address work compar length al theorem prover techniqu logic appli context program reason class specif trace semant encod support reason behaviour relat class jacob al studi verif java pv theorem prover tool call loop translat java class logic pv system semant approach base support proof refin relat jacob al address number issu contrast work studi transact persist object behaviour individu object contrast relat work relat address issu object object membership multipl class contrast relat work tool limit transact safeti analysi section work paper extend previou work addit topic inherit heterogen emphasi model schema extens isabel system provid autom reason schema build idea doherti hull state encod delta valu differ delta valu describ updat context cooper delta valu cope parallel due updat approach differ scholl identifi parallel thread work object futur work shown repres construct specif languag logic isabel theorem prover achiev defin isabel theori resembl memori persist object store construct specif languag defin gener oper theori logic achiev prove theorem gener oper reason specif oper present result static analysi integr proof shown section involv combin typic featur heterogen abstract late nil repres interact languag featur encount applic schema work base gener graph edit function real system system method safeti requir case studi verifi isabel tool worth mention initi specif forgotten kind error schema easili overlook immedi spot theorem prover tool limit transact safeti analysi theori tool base gener semant properti updat expect result extend kind proof requir encount applic reason semant oper applic oasi reason tool area workflow cooper verif requir proof method result refer editor build stori morgan richard andrew mike john john john van experi hardwar descript languag hol intern confer theorem prover circuit practic volum ifip transact june libkin verifi properti transact principl system page lewi design perform assert concurr control system page februari manfr tobia christian verif function languag foundat softwar technolog theoret comput volum page schaefer static manag integr design implement extend technolog march program verif higher order logic technic report electron research cattel dougla editor object odmg morgan kaufmann san verif environ ml program peter workshop ml page san june acm sigplan mitchel wand theorem prover verifi simpl proof compil correct technic report colleg comput decemb detect conflict updat intern workshop program languag septemb reason class logic model tool european symposium volum lectur note comput page isabel van den van reason java class scholl determinist semant updat sequenc page april cri martin ramamritham effici rewrit histori page april tobia mechan semant textbook foundat softwar technolog theoret comput volum page lawrenc gener theorem volum lnc pv world wide web qian axiom system transact inform process novemb qian deduct synthesi transact acm transact decemb marek wolfgang thoma peter muth ward cooper transact cooper activ model vldb septemb thoma theori structur specif proc intern confer theorem prove higher order logic lectur note comput scienc david herman automat verif transact workshop program languag est david susan engin approach atom transact simpl object model achiev reason technic report cooper hypermedia author environ acm confer hypertext page tim david automat verif transact safeti acm transact septemb wolfgang kla histori merg mechan concurr control cooper environ ieee workshop research issu data page
HCI/360 4 publish retriev descript evalu marku oja laboratori comput inform helsinki technolog finland abstract develop system call retriev imag similar set refer imag larg unannot imag techniqu base hierarch variant map call tree structur map set refer retriev set imag similar form imag featur shape techniqu introduc facilit automat combin multipl hierarch level mechan adapt user prefer select imag resembl descript system set method applic evalu retriev perform imag retriev applic present introduct imag retriev subject activ research initi notabl cbir system qbic photobook mid task develop effect product base cbir proven extrem difficult due limit comput current cbir system reli featur extract imag imag typic simpl featur color primit shape detect human easili detect distinct object semant concept imag recognit human routin group imag visual mimick behavior challeng task develop effect imag retriev urgent issu perform assess method featur approach quantit measur perform imag retriev system problemat due subject human percept user retriev system individu exist definit answer imag queri exist wide accept perform assess method object quantit comparison algorithm imag retriev system base approach difficult perform due lack standard method applic move pictur expert group start work content standard multimedia inform manag process call imag retriev system design framework gener research algorithm method imag retriev system base queri pictori common retriev paradigm current cbir applic queri base imag shown extern locat user identifi imag relev nonrelev current retriev task system inform select imag user interest accuraci queri improv relev feedback form learn adopt tradit inform retriev relev previou interact refin subsequ queri approxim user challeng imag retriev descript evalu current queri perform user interfac support multipl parallel featur techniqu introduc featur combin automat user requir enter weight featur goal autonom adapt user prefer similar imag iter refin queri system imag user detail descript system present found home page includ work demonstr system locat map imag index method base map som defin elast net point fit input space visual grid som consist regular grid neuron model vector map unit map attempt repres observ optim accuraci restrict set model model order grid similar model close dissimilar model fit model vector carri sequenti regress step sampl index unit identifi condit model vector subset belong node center node updat function distanc ith node map grid regress reiter sampl converg unit time tree structur som order achiev hierarch imag allevi comput complex larg variant som call tree structur map repres hierarch grid neuron grid standard som tree structur reduc time complex search complex search remark lower larg som level access tree structur structur som level illustr figur figur structur challeng imag retriev descript evalu comput light facilit creation huge som hold imag store imag featur vector calcul imag train level begin top level featur vector present map multipl time model vector store map unit modifi match distribut topolog order featur vector space train imag distribut map unit model vector map unit regard averag featur vector map unit hierarch imag form map search data set featur vector match model vector associ imag refer imag map unit ideal correspond imag unit bottom level map imag queri imag retriev iter process util relev feedback approach queri begin fix select repres imag uniformli pick top level subsequ queri accur user present select subset imag match expect relev fit queri improv achiev system learn user prefer select made previou round system mark imag select user posit imag neg intern data structur base system present user set imag imag select approach select imag map close featur perform present queri rel weight opinion implement practic mark locat shown imag map posit neg depend user select reject imag normal sum equal som level treat matrix form valu describ user content map unit map matric filter symmetr convolut mask order spread neighbor map unit imag extent similar present start som unit largest posit convolv figur convert posit neg map unit convolv map map surfac displai posit neg map unit shown left result convolv map shown challeng imag retriev descript evalu figur user interfac retriev refer imag map unit imag shown present round process continu map unit largest preset number imag gather set imag present user posit neg mark imag convolut visual figur displai posit map unit white neg black shown left map convolv result map surfac shown white black region convolv illustr posit neg valu imag queri target white part map typic retriev session consist number subsequ queri retriev accur imag resembl posit imag queri form list tree queri user back previou queri round proce queri inform retriev system user interfac current user interfac ongo queri displai figur parallel map structur repres map level som train rgb shape left size som level top bottom convolv set imag consist imag select posit previou round retriev process imag unselect subsequ chang contribut posit neutral queri set imag repres build select posit displai separ horizont current imag obtain convolv map unit challeng imag retriev descript evalu evalu retriev perform number measur evalu abil visual featur reveal imag similar present section assum total imag imag class ae similar imag priori probabl ae class ae nc ideal perform measur independ priori probabl type imag imag class observ probabl imag featur vector calcul euclidean distanc featur vector imag sort imag base ascend distanc imag store indic imag vector denot ith compon imag defin vector ae vector locat imag belong class imag vector order perform class featur extract cluster imag belong valu concentr small valu defin observ probabl observ probabl measur probabl imag imag belong class nearest imag featur extract optim situat imag class cluster longest distanc imag imag class smaller shortest distanc imag worst case featur complet fail discrimin imag class remain imag observ probabl close priori ae form scalar observ probabl observ probabl function index easili compar featur extract deriv scalar measur enabl comparison larg valu small valu small valu larg valu correspond good discrimin scalar measur reward larg valu small punish larg valu larg chose figur merit describ perform individu featur type local measur calcul averag observ probabl retriev local local measur obtain valu figur obtain class global split cluster cluster separ cluster class global figur merit weight sum observ probabl calcul global challeng imag retriev descript evalu global attain valu favor observ probabl concentr small indic punish larg probabl larg index valu half measur total fraction imag found half sequenc half half yield optim case half priori distribut imag figur local global half larger discrimin abil featur extract measur appli quantit denot describ perform cbir system singl featur type base measur averag number imag system retriev correct found measur resembl method present human test measur fulli automat obtain measur subset imag singl featur implement comput program simul human user examin output retriev system mark imag return system relev imag belong queri process simul perform data collect human imag class record total number imag present system imag shown form histogram calcul averag number shown imag hit occur figur yield ae ae ae nc priori probabl class valu perform system random pick imag smaller perform experi set evalu approach set experi imag collect corel galleri product collect photograph artifici imag wide varieti subject imag size pixel major imag small number grayscal imag imag convert origin format jpeg featur extract method appli imag creat featur size top bottom vector time adapt featur studi includ color shape featur simpl textur featur color textur featur calcul separ zone imag zone form determin circular area center imag size circular zone approxim area imag remain area divid zone diagon line averag color featur tabl obtain calcul averag separ region imag result featur vector describ averag color imag inform spatial color composit color moment featur introduc color moment featur comput treat color valu color channel separ probabl distribut calcul challeng imag retriev descript evalu featur class airplan face car textur tabl comparison perform featur extract method imag class entri perform figur local global half moment color channel result featur vector due vari dynam featur valu normal unit varianc textur neighborhood featur calcul region color featur color pixel examin estim probabl neighbor brighter center pixel featur result featur vector shape histogram featur base histogram quantiz direct edg imag histogram separ form region featur vector obtain featur describ distribut edg direct part imag reveal shape statist manner shape fft featur base fourier transform binar edg imag imag size normal pixel fft magnitud imag fourier spectrum filter decim factor result featur vector order evalu perform singl featur system type separ imag class pick manual corel select class consist priori probabl criteria imag belong face class main target imag human head ey visibl head fill imag area car main target imag side car complet shown imag bodi car fill imag area airplan class imag aircraft helicopt accept number imag system present round effect result system set return imag round result tabl show result form scalar local global half measur observ probabl local measur larger priori probabl shape featur outperform featur type imag class perform measur clear perform measur suitabl singl descriptor result experi system shown tabl featur basi retriev combin featur test shape featur yield result color textur row tabl examin result test gener trend larger set featur yield result smaller set featur result featur result section tabl valid trend featur gener improv result conclud system benefit challeng imag retriev descript evalu featur class textur face car airplan tabl result valu experi exist multipl featur type gener featur type perform imag approach robust method set featur imag map form thereof parallel featur type retriev perform benefici exclud retriev process proper oper system featur averag perform similarli futur plan paper introduc approach imag retriev method quantit evalu perform result experi show system effect select set parallel combin yield retriev perform obviou direct retriev perform extens studi featur find set featur averag perform vast collect unclassifi imag made prepar imag search engin world wide web refer corel corpor world wide web home matt stephen peter yianilo target test pichunt bayesian multimedia retriev system advanc digit librari wayn al queri imag video qbic system ieee page septemb kohonen volum springer seri inform scienc extend edit oja hierarch featur map proc int joint conf neural volum page ieee servic center challeng imag retriev descript evalu progress map european confer artifici intellig european artifici intellig john wilei august marku oja framework imag retriev map scandinavian confer imag june context object atlant octob mpeg marku brandt map imag retriev oja samuel kohonen page alex rosalind stan sclaroff tool manipul imag storag retriev imag video volum spie san salton mcgill introduct modern inform retriev comput scienc seri marku marku similar color imag storag retriev imag video iii volum spie page san februari challeng imag
AI/361 2 embodi embodi evolutionari algorithm popul robot richard watson jordan pollack dynam evolutionari machin organ center complex brandei massachusett usa abstract introduc embodi evolut methodolog automat design robot control ee evolutionari robot techniqu avoid pitfal evalu time util suit futur work behavior evolutionari algorithm distribut embodi popul physic robot reproduc situat task environ built popul robot successfulli implement experi control evolv ee compar favor solut simpl task detail report initi discuss applic ee advanc distribut robot task introduct work inspir vision larg number robot freeli interact share attempt perform collect object repres food energi robot mate exchang genet produc control program resid member robot popul likelihood robot produc offspr regul abil perform task collect human reposit robot popul robot evolv substanti technolog demand made algorithm detail ad workabl develop vision knowledg articul harvei methodolog call embodi evolut defin embodi evolut evolut place popul real stipul evolutionari algorithm execut distribut asynchron manner popul exclud method serial evalu candid control singl robot algorithm maintain manipul specif individu agent central manner creat popul physic robot perform task evolv human kind paper introduc implement embodi evolut report result initi experi provid embodi evolut motiv relat work motiv creat ee methodolog pertain research area view ee artifici life evolutionari robot substrat evolut collect robot behavior artifici life natur adapt mechan complet decentr distribut evalu implicit reproduct carri autonom agent central author artifici life literatur exampl simul system agent behavior reproduct activ integr dyer rai agent behavior impact reproduct synonym reproduct experi enabl research explor critic effect result merg reproduct behavior behavior experi physic robot integr reproduct autonom behavior evolutionari robot real robot evalu evolv popul set control central store reproduct occur robot motiv ee research popul real artifici evolut distribut autonom properti natur evolut emploi ideal autonomi distribut control task behavior adapt mechan evolutionari robot evolutionari robot seek offer altern robot control er real robot small evalu control evolut husband cliff floreano mondada evalu control serial real robot time evalu perform human larg number evalu requir evolutionari algorithm make simul attract method evalu candid control lack fidel simul lead problem control evolv simul account subtleti physic characterist robot task environ fail transfer real robot cliff brook transfer problem provabl elimin care design simul assumpt factor critic task distribut robot applic problemat regard critic factor difficult ascertain due complex environ interact larg number robot complex model high resolut sensori apparatu make simul slower real time simul larg number evalu requir evolutionari techniqu prohibit ee dilemma fidel speed embodi evolut simul avoid transfer ee larg number robot parallel evalu process collect robot distribut robot system pose challeng establish method distribut control easi achiev decomposit problem problem subpart neatli separ independ build independ autonom agent hand design machin structur realworld neatli separ work collect robot restrict system homogen independ flock forag agent experi control architectur al al balch arkin al work involv learn typic occur simul littman saunder pollack balch simpl physic connel matar parker al difficulti accomplish highli coordin behavior complex interact domain motiv embodi evolut evolutionari robot address collect task real robot technic engin challeng continu power difficulti coordin multipl robot robot popul larger order hundr deploi complex central evolutionari algorithm commun bottleneck central evolutionari algorithm synchron evalu reproduct difficult ee central evolutionari algorithm definit ee stipul adapt mechan distribut distinguish embodi evolut mere parallel embodi evalu larg number robot algorithm distinct exist work method robot adapt task embodi evolut potenti offer ideal substrat studi emerg group behavior explor mechan adapt discov problem decomposit distribut architectur mean provid substrat studi distribut adapt mechan ee adher ideal scaleabl robust ee potenti agent evolv deploi issu includ er import long term embodi unifi collect robot embodi evolut framework begin unifi artifici evolutionari collect robot area provid motiv embodi formul long term goal integr issu problemat current er method appli interest interact current er method scale evalu larg number candid long perform evalu serial real carri evalu real robot avoid transfer problem appar difficulti turn advantag embodi evolutionari algorithm popul robot situat share ee larg number distribut architectur scale larg number robot perform larg number evalu parallel real transfer problem interact agent occur comput overhead simul perfect fidel real world act implement embodi evolut experi embodi evolut requir construct popul continu power deliveri distribut evolutionari algorithm review turn note role simul work popul robot embodi evolut requir larger number robot evolutionari robot work experi requir minim capabl robot object ee interact robot sophist individu robot built popul simpl robot design minim individu capac capabl ee import design criteria enabl larg popul includ low manufactur durabl face frequent physic interact robot robot emploi suppli mit media laboratori al pic microcontrol shown figur robot measur diamet light sensor input motor output commun transmit receiv lego motor microcontrol board recharg circuit recharg cell bodi figur robot design initi ee experi direct diod direct vertic reflect floor achiev local omnidirect commun figur robot show contact point collect power floor continu power technolog power requir embodi evolut demand power deliveri system batteri power sustain robot period order longer period uninterrupt power achiev tether robot directli power sourc provid batteri recharg station robot visit period tether easili recharg station made transpar respect robot forc robot interrupt activ amount time develop refin altern method transpar power robot run power construct modular interlock panel panel number strip tape altern connect posit neg pole dc power suppli modular construct floor expand easili robot contact point shown figur geometri contact point make contact pole dc rotat translat robot floor power drawn robot contact point rectifi deliv robot control motor power circuit design built maintain optim charg small recharg event loss contact floor build power learn research group built floor similar construct parallel effort viabil util power suppli approach earlier prototyp floor ceil style ai system distribut evolutionari algorithm princip compon evolutionari algorithm evalu carri autonom robot distribut fashion ee scale effect process evalu carri autonom metric program robot measur perform fail maintain adequ power result floreano explicitli fit function object collect time metric perform monitor robot extern observ exist measur robot abil explicitli reproduct ee distribut asynchron assum creat robot offspr implement robot popul robot structur reconfigur reproduct simpli exchang control program inform select realiz individu suppli gene individu lose gene replac combin ga observ simplifi genet pick parent produc offspr combin gene replac ga select individu random overwrit gene fit fit fit offspr develop decentr probabilist version ga ee call probabilist gene transfer algorithm method reproduct valuabl evolutionari robot requir robot meet reproduct event occur genet inform travel local reproduct locat movement robot robot pursu reproduct activ concurr task mode robot maintain virtual energi level reflect robot perform task robot probabilist broadcast genet inform commun channel rate proport energi level broadcast mutat version gene robot genom robot receiv robot receiv gene overwrit gene receiv robot accept broadcast gene probabl relat energi level robot higher energi attempt resist reproduct attempt frequent robot lower energi send receiv gene pick fitter robot transfer gene fit robot averag left mixtur gene proport rel energi level approxim recombin evolutionari algorithm broadcast robot awar rang coordin reproduct event robot notic robot reproduct action modul energi robot energi level data broadcast robot identifi energi valu exchang reproduct event involv minim unidirect commun make algorithm resili gene commun parsimoni algorithm suitabl robust implement popul robot role simul ee primari benefit ee elimin difficulti method frequent er acknowledg simul valuabl research disciplin gain insight understand complex system built simul ee system aim simul provid simul robot part methodolog transfer solut simul actual robot simul serv testb evolutionari algorithm setup experi simul ee system provid indic identifi critic factor approach investig setup experi aid simul experi scratch real robot popul experi result task deploi robot embodi evolut environ behavior robot control simpl artifici weight evolv perform similar task environ consist pen lamp locat figur lamp visibl posit floor plane robot task reach light start point pen beacon mount light signal robot reach light sourc trigger reset behavior move robot random posit orient peripheri robot behavior turn robot random invok robot sensor physic sensor read chang significantli time step behavior oper independ evolv control pen multitud de facto environ includ amount matar task implicitli requir robot successfulli overcom figur robot pen experi light center shown uniqu id robot collect reach light infra red receiv overhead data store monitor progress experi result control architectur initi experi simpl artifici control architectur serv evolv depict figur weight network evolv network consist output input robot light sensor receiv bia emit constant integ interv valu output node weight sum input sigmoid function network simpl comput pic microcontrol chip adequ larg search space network weight equal size search space genet algorithm wide genom figur control architectur experi simpl artifici integ weight rang input left sensor brighter bia node constant activ valu output node weight sum input sigmoid function individu learn place robot weight valu robot perform local broadcast robot commun channel rang broadcast robot commun robot peripheri bodi maintain reproduct energi level energi level regul reproduct event reflect robot perform task robot energi reach light broadcast gene energi increment reach light energi level exce maxim energi decrement broadcast energi level fall minim robot rate send gene proport energi level decrement occur rate broadcast decai exponenti time recent visit light frequent robot reach higher energi level instant satur point defin maxim energi level approxim integr robot perform task frequenc reach figur overview reproduct energi level maintain experi integr robot behavior predic bia output input sensor left left motor motor evolv weight sensor procedur evolv weight start energi repeat forev energi energi end repeat end procedur procedur calcul updat check stuck success beacon return random posit end procedur procedur end procedur procedur weight equal probabl equal probabl local store mutat energi energi end procedur figur pseudocod control program implement probabilist gene transfer algorithm experi code run robot method synchron coordin central text result figur show frequenc light successfulli reach robot popul time experi main experi evolv weight perform task initi condit network evolut experi weight configur produc output motor neutral start experi control robot case robot weight random robot weight solut figur control show broad rang perform level provid refer judg success trial evolut place embodi evolut popul robot achiev perform favor compar solut robot learn approach light perform effect result provid evid fulli asynchron evolutionari algorithm oper effect popul physic robot provid control program result achiev crude measur perform averag trial energi level odd perform compar usual mean robot energi level reset robot receiv specif reproduct event energi level measur perform measur perform control resid robot figur averag hit rate time curv show perform robot popul random network weight data evolv experi averag data experi averag run run minut robot horizont axi repres time run vertic axi repres averag rate hit robot reach light time window minut comput instantan hit rate data point graph data point time error bar evolv shown show standard deviat random network weight achiev hit solut achiev approxim ten hit popul evolv perform eventu meet hit rate evolv solut begin network weight robot achiev averag perform hit minut twenti minut experi artifici control architectur robot varieti solut discov evolutionari minim structur evolv solut exhibit behavior qualit evolut favor robot shown figur reason intend address futur work figur trajectori solut time embodi evolut solut random weight robot evolv loop behavior behavior light sourc futur work futur work exist number control experi map paramet space expect refin understand dynam algorithm set provid robust oper good solut stabl popul remov robot abil resist reproduct attempt resist model optim paramet investig includ rate robot energi reach light attempt process develop complex task environ control architectur begin recurr version network architectur oper raw sensor input task report simpl involv aspect robot strong interact forc implicit embodi evolutionari reproduct process physic type interact investig simplic task environ transpar respect dynam interact complex task perform loop behavior slightli effect result statist data collect date result prove question hope answer effect hypothesi loop behavior overcom physic robot pen effici solut task explicitli includ robot call experi system hypothesi loop solut robust inevit hardwar varianc exist robot find mundan long term goal distribut robot method automat discoveri problem decomposit balanc local autonomi group coordin emploi larg number robot task environ evolv interact avoid introduc problem robot assign robot discov work group interact behavior reflect natur structur task hand goal critic research balanc individu group balanc local global credit balanc cooper homogen encapsul modular term dynam group format encompass issu goal pertain kei element goal interact individu evolv embodi evolut ideal substrat investig coevolut dynam group format provid substrat investig provid solut embodi evolut methodolog evolutionari robot ee popul robot evolv situat task environ adapt mechan distribut popul reproduct carri autonom robot evolutionari adapt seamlessli integr robot task behavior experi ee emploi popul robot suppli continu power floor develop evolutionari algorithm oper probabilist transfer genet inform robot commun distribut robust wai make effect implement popul robot ee number opportun ee enabl studi effect integr reproduct autonom behavior manner simul alif experi ee offer advantag er time parallel elimin transfer evalu carri real robot ee substrat futur research investig collect robot behavior ee introduc complic establish er method central collect data made difficult reproduct ee base principl ee suscept failur robot isol embodi evolut suit team manner ee appli team evolut task behavior experi provid embodi evolut successfulli appli ee simpl task neural network control search space surprisingli solut result show solut evolv ee perform compar solut futur experi provid greater clariti advantag difficulti ee method acknowledg work report paper made industri contribut peopl miguel built ee conduct embodi experi confid giovanni motta design built batteri recharg circuit robot administ experi robot work order kumar design built earli prototyp circuit ir commun circuit futur work greg member demo challeng insight question fortun colleagu fred martin mit media suppli cricket microcontrol refer appli ai system continu power suppli khepera product literatur appli ai canada behavior state retriev ieee intern confer robot ieee comput societi press behavior robot aaai workshop multiag learn rc format control multiag robot intern confer system jl local action global stigmergi collect artifici life mit press experi synthet psycholog mit press ra robust layer control system mobil ieee journal robot autom ra ra intellig journal brook ra life real varela european confer artifici mit press husband evolutionari adapt behavior distribut journal theoret artifici intellig creation autonom genet evolut driven simul adapt behavior home navig real mobil ieee transact artifici life ii evolut husband fourth european confer artifici life mit press person commun genet submit husband cliff evolutionari roitblat anim animat mit press husband harvei versu control autonom annual confer artifici simul ieee press ad minim simul evolutionari husband fourth european confer artifici life mit press robot radic envelop adapt behavior person commun game framework reinforc intern machin learn confer program robot reinforc ninth nation confer artifici intellig reliabl collect experi real de symposium robot springer verlag behavior anim intern confer simul adapt mj function ww eleventh intern confer machin learn morgan kaufman mj learn autonom robot evolv control physic robot autonom special issu evolut robot mondada mobil autonom sanchez evolv springer behavior real garbag collect robot autonom system emerg modular develop control system mobil adapt behavior le action select cooper agent simul adapt behavior le learn advanc special issu select paper iro ts approach synthesi artifici life black bring transpar aesthet back scientif instrument project fund nation scienc foundat furnitur team autonom studi role critic mass adapt task pollack anim animat mit jb evolut commun scheme continu simul adapt behavior iv reinforc independ cooper intern machin learn confer behavior acquisit multi mobil robot environ reinforc learn base state vector intern confer robot effici mate prefer affect locomot evolut artifici swim artifici life mit press commun artifici artifici life
Agents/362 1 journal cooper inform system fc world scienti publish compani dynam agent chen dayal hsu hewlett packard page mill road palo ca usa receiv insert claim dynam agent infrastructur provid shift static distribut comput dynam distribut develop infrastructur realiz shift compar infrastructur distribut comput infrastructur corba demonstr highli dynam system servic provis distribut applic data mine web extens di er agent platform infrastructur support dynam behavior modi cation agent dynam agent design xed set prede ned carri load modi ed dynam agent adjust capabl accommod environ plai di erent role multipl applic featur support manag facil dynam commonli applic program manag resourc modifi capabl infrastructur system develop easili top system support dynam servic modi cation movement prototyp develop hp lab made extern research group introduct distribut problem solv decentr cooper task handl multipl distribut autonom agent global control task accomplish exchang inform agent invoc task agent su cient inform capabl solv entir problem support distribut problem system develop odyssei aglet concordia ort agent standard undertaken agent interop work omg www consortium environ agent gener dynam partial unpredict applic requir particip agent dynam behavior agent react environ chang behavior issu address prior work dynam agent system exist agent agent behavior xed time agent creat chang agent total replac agent cooper import particip agent plai di erent maintain ident consist retain data knowledg share agent agent agent chang behavior prefer replac agent requir softwar agent capabl partial chang behavior execut dynam agent ration agent model notion desir intent belief agent repres problem desir repres goal intent repres plan achiev goal dynam agent cast framework messag read connect input stimuli lead partial chang agent desir necessarili invalid prior knowledg accumul agent goal chang current plan suspend resum futur interest develop dynam agent motiv support highli dynam distribut applic distribut data plan dynam provis servic work ow applic involv dynam vari task illustr dynam comput system manag agent gather inform number monitor individu process input share result cooper achiev system manag load balanc normal emploi default plan carri task base system resourc model unanticip event failur chang plan process addit forward messag origin report fail stop regular program run plan respect fail system perform accumul period time remain valid balanc load system execut temporarili alter ident remain report cooper reli ident commun chang replac extens applic dynam agent occur distribut data mine system built hp lab agent intern journal cooper inform system dispatch mine access log web site determin interest user access pattern agent cooper dynam modifi behavior adapt knowledg base chang user chang content chang usag pattern learn dynam alter data mine task mine di erent type knowledg chang acquir di erent mine algorithm perform task chang describ applic detail section support softwar agent dynam chang behavior modi cation agent highli desir su cient agent equip xed set function distribut agent distribut commun abil request cooper agent agent requir support move made agent agent store data program object behavior resourc knowledg order work agent resourc agent maintain adequ state includ knowledg execut object agent problem divid multipl tackl agent nal solut entir problem gener level level term solut subproblem autonom agent capabl work global multilevel coordin servic resourc directori support agent cooper capabl agent acquir knowledg program manag adjust behavior total replac agent capabl agent maintain previou goal experi multipl applic motiv develop dynam agent infrastructur dynam agent carrier dynam agent individu program dynam agent consist xed carrier part changeabl action part newli creat agent carrier behavior gain modi ed dynam load java class repres knowledg applic program carrier part consist manag facil distribut store program maintain commonli action commun cooper agent mobil agent support reduc secur encapsul agent make reloc agent form hierarch group group coordin resourc directori servic servic system infrastructur support problem solv dynam agent infrastructur design facilit develop autonom softwar agent modi modifi move servic call dynam servic client load program infrastructur greatli simpli es cooper system prototyp infrastructur implement hp build includ distribut data mine system explain dynam behavior obtain util automat action commun describ commun action part dynam di erent action carri dynam agent discuss trigger mechan dynam behavior modi paper organ comparison relat work section dynam agent architectur section cooper dynam agent discuss section extend exampl system built dynam agent infrastructur section includ manufactur process schedul system dynam provis work ow manag distribut data mine system web access conclud remark section static comparison relat work distribut comput system construct fundament static dynam contrast dynam agent infrastructur static distribut comput infrastructur corba tradit distribut comput infrastructur odyssei voyag distribut static intern journal cooper inform system static con gure distribut comput system typic characterist fix locat servic con gure invok corba comput rmi remot method make invoc transpar corba server chang locat corba registri locat chang made dynam corba server move access client runtim ned function xed set function remot infrastructur function invok server object interfac interfac ed term interfac de nition languag server object essenti implement interfac implement recompil chang made runtim number type invoc argument interfac rede lead client point server prede ned behavior dynam interfac corba server program chang function client bound interfac stationari servic servic provid mobil implement interfac necessarili portabl movabl remot function invoc mechan gener base send request result server xed locat ow program object support servic provid static regist distribut comput infrastructur dangl object static con gure distribut comput framework applic obviou limit highli dynam cooper problem solv requir gurabl system compon act time adjust behavior accommod environ exchang data program object cooper distribut dynam locat static behavior dynam agent distribut applic construct mobil agent java program foundat move data program agent includ gener magic odyssei objectspac voyag ibm aglet mitsubishi concordia support agent commun mobil agent creat remot site agent commun languag knowledg exchang protocol ort incorpor kqml corba undertaken er remot invoc provid start point system internet exist agent platform lack abil reason softwar server client static code prede ned function odyssei agent object instanc xed set thing de ned object odyssei agent function chang launch receiv reload program odyssei altern function provid launch agent platform support servic reconstruct chang agent behavior mobil agent bring capabl travel agent lack knowledg program manag facil support dynam behavior cooper mention dynam servic provis mean servic modi ed move exibl demand requir system compon dynam con gurabl modi reset capabl current mobil agent capabl actor relat model distribut comput actor similar agent system implement actor model support actor support dynam method actor xed time actor creat dynam solut solut problem softwar agent develop dynam agent manag execut action capabl modi chang data program object carri cooper establish exchang unlik dynam agent gener creat problem solv capabl gain dynam load java class intern journal cooper inform system repres knowledg applic modi ed distinct featur dynam agent manag capabl handl resourc persist knowledg action object agent multipl applic remot invoc achiev gener messag pass mobil achiev dynam remot abil execut relev action liter move network remot machin achiev desir ect reduc network tra requir comparison exist agent support mobil behavior modi dynam agent updat function exibl launch dynam agent function chang carri maintain consist ident chang dynam agent behavior made partial base avoid cost move agent comparison remot invoc dynam agent object interfac refer xed set function view dynam interfac servic con gure modi ed repres altern paradigm distribut comput adequ support todai distribut task share system support dynam load procedur system provid xed messag protocol xed program languag script procedur written node system assum languag infrastructur support greater exibl open messag program written languag agent local messag dynam locat acquir earli work describ dynam behavior modi cation model work introduc concept knowledg manipul exist oper oper code rule rule languag belong commun commun post messag blackboard context provid object manag includ persist rule move context move comput share characterist dynam differ dynam agent carri gener set servic resourc manag program execut set servic dynam agent dynam agent support dynam agent commun share blackboard behavior dynam agent limit code applic wrap java class infrastructur support number featur facilit cooper dynam agent observ ort softwar engin make softwar compar hardwar softwar system dynam gener behavior softwar system requir compon dynam behavior support dynam behavior requir properti common varieti applic provid softwar compon capabl cient develop maintain compon solut provid gener java program cooper knowledg program manag facil dynam agent carri action greatli simpli es develop problemsolv system dynam agent architectur structur figur dynam system lightweight manag servic manag servic invok servic api applic speci action execut agent servic api gui enabl form xed part dynam agent changeabl part consist java class repres knowledg action program determin capabl xed part dynam applic program act autonom applic program carri agent call action program execut instanc action program call action receipt messag api dynam agent instanti execut carri program function access dynam agent activ commun dynam agent fix part agent dynam agent provid manag servic distribut action program knowledg carri action program agent messag queue messag handler manag messag queue manag messag intern journal cooper inform system receiv interpret messag interact style includ messag forward support incom messag handler launch messag interpret decod messag action handl instanti execut action program dynam agent carri multipl action program handler instanti execut provid varieti continu automat process messag put speci ed network locat signi servic start stop exibl agent action manag dynam extend agent manag dynam extend agent manag servic action open server detail agent handler instanti execut agenda object agenda object repres list concurr condit action execut dynam agent action request agenda involv agent note agenda object simpli action program written script languag agenda handler serv interpret conveni de ne agent plan hard code plan logic action program resourc handler maintain persist dynam agent object data packet java class instanc includ languag address instanc action execut dynam agent dynam agent manag servic access updat data perform commun messag er refer underli manag action refer access api servic simpli es develop carri enhanc abil cooper addit agent support gui enabl user interact aid agent applic develop agent gui er dynam agent class protocol object action agent servic api mainten auto displai agenda handler agent servic load carri gui resourc handler action handler messag handler execut inbound outbound figur basic structur agent agent state user view part agent includ inform object system resourc program address content messag queue messag log write agent messag queue object agent user manual enter messag agent agent send agent user add object agent object store manual enter text user enabl launch simpli send messag run agent agent servic dynam agent creat system call run local site dynam agent launch clone remot site send request instal site clone made option remov remov origin logic move copi origin agent describ mechan detail discuss mobil dynam agent agent uniqu identi ed consist machin identi er port identi intern journal cooper inform system symbol uniqu agent space agent space de ne space group commun agent agent space manag coordin coordin agent ad distinct maintain agent registri space coordin creat prior dynam agent coordin coordin publish design address newli creat dynam agent dynam rst attempt regist symbol address coordin send messag coordin commun dynam agent send messag agent address consult coordin obtain address instruct load program address consult coordin request sender obtain address dynam agent record address dynam agent aliv dynam send messag coordin coordin broadcast termin dynam agent remov address coordin maintain directori regist program messag interpret open server agent execut directori map symbol regist uniqu agent url agent receiv request execut program request provid url consult coordin obtain program address load program coordin regular agent coordin coordin assembl partial result number agent dynam agent form hierarch group group coordin option servic resourc directori servic servic detail dynam behavior dynam agent agent function creation changeabl gain load local remot rule activ open server agent equip basic intellig decid chang resourc manag network class loader load program identi ed url action manag instanti instanc load program start dynam agent agent receiv messag content possibl coordin load messag interpret class creat instanc class store instanc agent receiv request execut program determin select load problemsolv creat instanc class start execut agent messag mechan separ point agent behavior ned class behavior chang dynam abil agent behavior updat capabl compon depend environ iti situat exibl essenti dynam applic basic manag capabl built agent architectur support distribut applic integr dynam convent remot approach agent infrastructur activ support program ow addit data ow control ow agent dynam integr program code regist agent rst creat action applic develop action java program arbitrari function order access agent servic program wrap class implement interfac class support class librari action fall style action action start task nish daemon action action start typic perform intern monitor task addit servic interfac provid explicitli stop kill daemon action action open server essenti agent manag servic explicitli load start agent creat open server extend agent servic exibl con gure open server java class develop subclass class support class inherit capabl function agent includ access servic open applic program open server environ wrap deploi agent applic exogen signal messag program intern journal cooper inform system type exogen inform made agent deploi agent analyz request web request forward web server agent cgi program open server deploi agent monitor web request provid cgi convert request agent messag insert agent input queue open server architectur agent servic incorpor environ wrap function seamlessli agent infrastructur commun infrastructur support commun carri action agent di erent action carri agent program commun messag describ turn commun carri action agent carri action subclass subclass function servic resourc manag servic dynam agent carri facil send launch clone retriev updat object objectstor access activ action agent displai data agent carri action dynam agent start pass inform paramet action action program messag agent action creat receiv thread regist socket instanc identi agent api function carri action multipl action carri dynam exchang inform dynam agent synchron mechan provid ensur object piec replac updat send action receiv action commun dynam agent speci program modul provid extern java program commun dynam agent agent instanti server extern program rst creat receiv send list socket dynam prior receiv list result object dynam agent mechan pass document url web cgi program dynam trigger distribut data mine task involv multipl dynam agent inform relat suggest relat return convei user easi system compon approach conveni dynam agent dynam system integr messag agent commun messag perform cooper messag manag servic action send receiv messag interact style agent infrastructur support interact sender expect repli receiv sender expect repli direct speci messag store agent messag manag maintain multipl messag store manag singl input messag send messag expect applic program speci es repli messag store repli direct messag manag add messag store identi er messag envelop receiv agent turn attach messag store identi er request access repli mailbox servic api similar messag agent subscrib subject messag forward support messag agent mark agent receiv forward copi messag agent primarili act dispatch agent open messag interpret syntax messag messag object includ envelop content envelop address speci cation languag protocol interpret intern journal cooper inform system content languag content arbitrari gener long consist interpret languag exist access locat network receiv agent contact coordin sender address load messag type dynam creat long messag interpret locat agent cooper content gener messag structur messag interpret messag interpret architect default interpret structur content messag messag type nest list pair support number messag type messag type kei agent abil exec instruct receiv agent execut action action program paramet execut encod pair messag start instruct receiv agent start open server open server dynam extend agent manag servic builtin paramet start server encod messag launch instruct receiv agent creat agent speci paramet includ speci initi instruct speci set initi messag agent agent creat agent exist agent receiv messag abil launch agent agent secur access concern atyp coordin con gure agent request creat agent coordin part agent system bootstrap coordin rst instruct execut initi action includ launch number local remot agent clone instruct receiv agent creat agent clone request agent clone discuss subsect agent mobil messag type copi load updat support user de ne arbitrari type interpret agent exchang inform program accept distribut pass instanc record start server autonom clone launch agent provid fundament support dynam agent cooper dynam agent resourc manag applic program execut agent store inform manag resourc manag resourc manag support type data object store maintain list triplet primit packet type packet store conveni place agent inform statu inform store packet store automat synchron agent gui displai object store maintain java event agent object task share result share program run agent servic api function access object store support store simpli es develop individu applic program share enhanc cooper capabl applic program preserv agent state share concurr sequenti action execut agent agent piec inform store request inform send messag execut action piec inform analog method mobil major bene agent mobil support typic remot client transport mechan found orb conduc support mobil internet agent move di erent support move program di erent site base condit program move receiv receiv site provid capabl accept program agent infrastructur support program remot program load agent local agent mobil bene ts reduc bandwidth consumpt met rst level level mobil ad exibl dynam system recon gurat support agent mobil base notion call agent clone remot site clone made intern journal cooper inform system option remov remov origin logic copi origin agent clone possess data program object origin agent origin agent address agent factori instal remot directli request agent factori creat clone origin agent send reproduct request coordin agent capabl creat agent design creat agent remot site seri commun origin obtain knowledg program object clone partial control clone origin agent receiv forward incom make messag lost process clone agent includ step agent platform send clone request target platform coordin creat agent platform address send resourc address respond reach quiescent send requir messag task requir perform stop process incom messag simpli forward summari dynam behavior modi cation discuss current client system develop integr static approach system compon ned corba claim dynam agent infrastructur support dynam behavior modi cation system compon number mechan provid summar de ne messag format creat messag interpret languag de ne messag type default interpret extend default interpret send exec action messag class url receiv agent load class execut instanc extend servic creat open server start open server send agent start server messag dynam agent creat agent load address platform resourc send address load resourc request task agent platform figur process clone distribut agent commun messag facil extern softwar compon commun agent agent proxi cooper dynam agent argu cooper problem solv system facilit featur dynam agent infrastructur previou section dynam agent commun issu messag abil present request exchang move locat support manag resourc action dynam agent partial chang behavior replac retain ident state cooper problem solv compar move partial chang minim network tra intern journal cooper inform system infrastructur support addit featur facilit cooper agent analog servic provid distribut comput infrastructur corba coordin servic addit servic provid group dynam agent cooper servic provid coordin design dynam agent dynam agent team multilevel call discuss addit featur detail dynam agent provid resourc manag servic maintain directori regist program messag interpret open server agenda directori map program url dynam agent receiv request execut program exist url consult obtain program address load program case coordin isol servic request servic provid dynam agent carri applic transpar make request servic featur explain carri dynam agent request servic provid send request send request maintain request queue process request individu thread request forward design dynam agent address order result back interact servic provid push pull push activ send request servic provid pull wait servic provid send request repli messag support redund server server request automat balanc enhanc reliabl interrog server request mark urgent receiv period time dynam agent distribut applic reli event commun program event treat asynchron agent messag deliv event subscrib event dynam agent event noti cation event subscrib event gener make subscript dynam call handl event gener event subscript applic domain case singl combin coordin receiv classi es event messag system probe distribut event messag regist event subscrib agent event distribut agent subscrib event prior knowledg subscrib agent arrang multilevel dynam form hierarchi dynam agent form refer base applic spatial distribut resourc avail includ coordin local servic dynam agent provid kind resourc option previou exampl consid singl domain hierarch problem divid multipl tackl nal solut entir problem gener level level solut subproblem form coordin servic turn coordin level rule appli domain resolut coordin hierarchi root domain coordin registri coordin coordin creat prior creation coordin domain resolut dynam agent uniqu identi ed coordin regist domain coordin inform creation time dynam agent address dynam agent includ dynam agent migrat load coordin group coordin intern journal cooper inform system group coordin figur dynam agent group local coordin updat notifi broadcast chang domain resolut messag request messag dynam agent foreign receiv forward coordin higherlevel forward involv multipl level request forward push signi featur form dynam di erent static form distribut comput domain support distribut comput infrastructur applic describ applic built capabl dynam agent infrastructur previou section rst applic manufactur process schedul track behavior modi cation capabl dynam modifi execut plan manufactur resourc plan applic commerci system easili plan modi ed dynam situat occur plan time unforeseen event plan creat instal oper site plan algorithm typic xed version system exibl ofth dynam show plan modi ed plan algorithm adapt oper environ busi polici compon brought line disrupt system dynam agent applic illustr dynam provis work ow servic commerci work ow manag system requir work ow server client instal gure site work ow process execut dynam con gure compon work ow servic work ow servic longer compon dynam dynam agent provid exibl develop deploi work ow applic provid exist work ow manag support except handl applic distribut web mine system illustr featur cooper problem solv dynam behavior modi cation manufactur process schedul track custom order product group web server product group web server product manag product manag platform platform messag coordin platform plant manag platform plant manag platform plan plan figur agent manufactur process schedul track manufactur increasingli reli coordin plant subcontractor achiev time deliveri custom order prototyp simpli ed manufactur schedul track system base intern journal cooper inform system dynam agent infrastructur coordin set function sell number product dynam commun web check inventori creat custom involv multipl sequenti concurr job track execut dynam deploi agent manag util resourc job assign di erent load gener involv multipl manual program task interact notifi execut statu job replan dynam track capabl captur except resourc except congest signi deviat demand report coordin inform make cation make human expert modifi resourc alloc polici noti es relev polici turn adapt algorithm resourc tabl applic program system develop individu illustr dynam integr construct recon gure servic featur dynam agent capabl determin load updat restart dynam agent carri server handl handl commun system compon support dynam agent execut track plan action nish step emploi ltere rule determin replan trigger condit express combin requir slack time knowledg current condit sati dynam agent remain part plan execut modi ed plan perform track knowledg condit dynam ltere rule dynam alter switch track plan action program react requir order environ plant polici di erent program activ load handl job dynam agent system compon plai di erent role di erent replac agent behavior modi maintain consist identi er commun channel temporari dynam agent launch carri speci ed brought coordin dynam launch noti es exist dynam gain abil commun dynam provis work ow servic illustr dynam agent dynam con gure work ow cation cooper capabl provid infrastructur static structur distribut di erent servic provid di erent stationari introduct dynam agent liber servic provis static con gurat underli support persist object dynam agent integr system integr made provid dynam con gurat servic dynam servic provis scenario implement dynam agent infrastructur applic program run dynam agent gener problemsolv plan base applic logic condit involv multipl manual program task remot order resourc execut requir work ow servic execut provid dynam step launch dynam agent load work ow dynam agent carri program task launch agent workflow server client request load pm server execut busi process send process definit intern journal cooper inform system pm process manag pm request load server request load process manag pm process manag pm worklist manag worklist manag worklist manag task dispatch softwar agent figur dynam servic provis messag request download server request download server manag url speci ed messag send messag request download work understand assign start process execut pm task execut order work item gener manual task user program task dynam agent download program rst dynam agent execut execut result back ow control termin decid termin work ow server web distribut data mine web applic mine web server access inform discov categori inform dynam suggest web page site visitor comput suggest dynam dynam link hypertext page web usag mine work cluster usag pattern deriv analyz web server access inform cluster techniqu cluster discov pertain static hypertext layout thought web page design cluster usag pattern classifi visitor web site group base page visit unexplor page group dynam suggest visitor navig hint group user base access pattern onlin shop catalog onlin shop catalog visitor interest group base access pattern exampl group expect retir visitor access babi furnitur babi cloth page relat babi suggest interest link follow type visitor interest dynam suggest comput mine cluster relev time visitor access web natur task type inform di erent dynam adapt cluster allevi problem web usag mine system attach singl web server observ user web server comput suggest inform corpor intranet typic spread multipl web server inform user interest locat web server user visit web server order collect session comput relev includ web server web usag mine system dynam agent infrastructur ideal environ implement web usag mine system multipl web server scalabl fashion web usag mine system consist agent implement top agent infrastructur figur assign agent call web advisor web server web advisor encapsul behavior web usag mine system knowledg comput dynam suggest web advisor perform task url request url request web server web server intern journal cooper inform system web advisor web advisor messag figur web advisor system session coordin learn agent session user session user session set page user visit web server user access rst web web advisor web server session owner session assign uniqu session id session id pass web advisor subsequ access request session web advisor queri session owner session inform comput dynam web advisor receiv request page rst retriev session inform knowledg mine prior access page visit user determin page user interest link page dynam insert web page user return page user user session updat ect recent page request user store back session owner detail web usag mine system found web usag mine system make dynam agent infrastructur commun agent session session owner send session inform central session coordin agent session coordin archiv session inform futur round mine learn agent recomput cluster recent session collect notion access simpli assum request user extend period session termin dynam agent session coordin redistribut knowledg base web advisor system detail learn algorithm found dynam distribut natur agent framework applic illustr learn agent send cluster inform web advisor adapt knowledg base web advisor previou version cluster knowledg base replac cluster receiv messag learn agent cluster algorithm dynam modi ed bring agent learn agent cach cluster action program reload fresh copi network algorithm comput suggest design layout suggest dynam swap web advisor agent cach comput suggest action program reload fresh copi network session coordin dynam add remov web site particip web individu web server owner decid start stop servic reader open server deploi web advisor agent receiv web request direct cgi program cgi program insert web request pipe le exist distribut comput infrastructur corba provid stationari servic exist mobil agent infrastructur support agent xed set function infrastructur lack support mobil merg ow ow develop softwar agent dynam modi capabl agent core system support impract develop support function scratch agent dynam agent infrastructur provid solut problem prototyp develop hp lab made extern research group dynam agent provid core system carri capabl chang claim approach repres shift static dynam distribut suitabl highli dynam servic provis dynam agent intern journal cooper inform system higher autonomi cooper exist type agent chang capabl handl multipl task retain support mobil agent level program modul manag knowledg action object provid persist multipl applic point dynam agent behavior prede ned class capabl chang dynam softwar engin point notion introduc work greatli reduc system infrastructur dwell make easier develop deploi adapt mobil softwar agent carri task cooper dynam experi infrastructur dynam system dynam servic develop dynam distribut applic data mine refer agha model concurr comput distribut system mit agha kim unifi model parallel distribut comput journal system base architectur commun intellig agent cooper servic network manag intern confer manag multimedia network dayal dynam softwar agent busi intellig applic inten confer chen dayal contract transact hierarchi sixth intern workshop research data engin chen dayal transact nest process manag system proc intern confer data engin dayal applic adapt data facilit web inform access sigmod workshop research issu data mine knowledg transact model long run activ seventh intern confer larg data tim yanni jame eld kqml agent commun languag softwar mit franklin graesser taxonomi autonom agent proc intern workshop agent dynam agent hr mr design manufactur agent interact asm design manufactur michael genesereth steven ketchpel softwar agent commun acm object manag group corba facil architectur speci cation omg doc architectur adapt intellig system arti cial special issu agent ibm program mobil agent java wooldridg jen intellig theori practic knowledg engin review mae arti cial life meet lifelik autonom agent commun acm gener magic agent odyssei hs nwana softwar overview knowledg engin petri intellig ieee expert rao georg model ration agent written intern confer knowledg smith contract net commun control distribut problem solv ieee transact comput agent societi agent product research activ object space voyag core packag technic overview white knowledg manipul object acm transact ce inform page dayal user access pattern dynam hypertext link annual confer world wide
DB/363 3 customiz hyperlink insert mainten engin softwar engin environ dept comput scienc california usa abstract sourc code import part program browser semant syntact relationship object refer form relationship deriv tool perform static analysi origin softwar document implement browser tricki program strategi provid support analysi tool deriv relev relationship difficult build tool distribut document requir extens code data commun power motiv exist static analysi tool conjunct www technolog implement browser distribut softwar project framework customiz platform insert html link softwar document inform gener exist softwar analysi tool specif retarget quickli incorpor rang link insert tool softwar legaci softwar develop environ enabl tool builder offer custom support gui paper describ describ experi effort system introduct world wide web ubiquit medium deliveri access wide distribut document low access led rapid advanc browser technolog http client web browser support sophist interact hot drag select park drive florham nj martin dept comput scienc victoria bc abil handl type network protocol client constantli enhanc strong incent leverag increasingli power technolog aim exploit softwar engin environ softwar develop project increasingli personnel cost market segment project involv distribut softwar document complex browser handl distribut develop project sourc code discuss author specif goal facilit addit exist softwar develop environ central focu task insert html link sourc inform store repositori exist assum onlin document store sort syntact semant document deriv analysi tool store repositori format user set relationship link content action link activ gener link insert engin read queri interpret insert html output result text kei goal project provid flexibl link insert variabl accommod includ interpret number mean link rest paper organ section discuss import function softwar develop motiv section discuss detail achiev goal outlin section briefli describ applic section discuss relev work automat link includ relat relationship work goal html softwar document kei function softwar develop environ report programm spend time understand larg project good support process student program understand strategi programm comprehend empir studi programm style explor desir browser support kind explor programm start examin class structur focu specif method call class member data specif class member function lead examin type definit class data lead explor class style task requir link led flexibl link configur kei goal system secondari goal system retarget larg legaci project lot inertia part due personnel difficult introduc develop environ ongo project part develop effort deleg geograph remov site desir introduc tool support distribut develop project minim disrupt manner complex configur build procedur larg bring tool process special tool run entir sourc base advantag introduc capabl develop environ increment fashion avoid global analysi tool goal system introduc sourc code exist develop environ forc configur build procedur advantag exist process disrupt develop learn current familiar www tool leverag tool includ graphic interfac access document repositori relat relat relat step refer function gui includ document viewer devic menu scroll bar manipul viewer gnu emac editor gnu tag support simpl action move view function refer function definit develop environ support action distribut browser access remot document transpar request queri import note inform relat browser typic built analyz sourc document browser built run analysi tool java program analysi tool difficult complex languag sophist tool analyz construct extent highli desir built exist analysi tool kei issu address browser implement gui extract relat sourc distribut goal leverag exist tool technolog area sourc languag power simpl gui interfac paradigm public domain low browser netscap commun support user browser desir featur hot distribut document machin commun protocol handl transpar manner html browser sourc insert softwar relat sourc code html link describ address link insert task architectur meta gener tool insert html link raw text framework tool function shown figur background fragment sourc code shown figur link insert input output static analysi tool link insert engin output html figur input sourc output html document repositori input sourc figur architectur link insert devic link insert occurr function highlight browser develop click gatewai tool execut effect retriev sourc text constitut definit relev html link result html return browser basi import note link insert demand store version sourc undesir volum softwar frequenc import present accur inform maintain advantag dynam link insert explor length discuss sort link requir type program understand mainten task gener link insert engin insert sort link singl link insert engin type link depend current mainten task describ element html link relev rang variabl link handl insert import paramet html link insert call link user http client activ link click softwar posit link determin deriv mechan static analysi sourc code posit sourc code line column function variabl store link insert engin inform introduc link input softwar document origin gener inform link posit order occurr sourc insert perform effici html link simpl url point directli html invoc cgi engin gener html data sourc link addit inform cgi engin process figur addit valu assum html document creat sourc link cgi type link shown figur definit function transform html link displai find cgi step step find queri find url target document definit function refer queri target queri find target document document retriev step retriev queri locat inform function call occur bodi definit queri call anchor queri tupl anchor relat result queri posit link insert step link insert invok specif cgi addit inform form paramet type figur find link inform drawn tupl anchor relat step posit mean link tailor design user relev inform rang accommod type task provid add www legaci project rest discuss customiz aspect languag languag step previou section describ main concept illustr detail specif languag languag concept languag deal basic concept document sourc code test configur manag formal specif deal sourc code document document type collect link link specif central step target queri locat target document link specif determin type target document class anchor queri step detail paramet insert link step view repres specif html render document set link relev view applic document type function view link class class list member document view altern view present seri link top page default view document select altern view make default view document type applic gener set specif exampl figur describ element step link insert specif specifi type target link valu attribut element specif target queri anchor queri domain specif languag note languag differ languag domain sourc code analysi web applic applic basic algorithm link insert unlik languag procedur seri structur describ element step applic algorithm resembl fix languag parser procedur element implement detail detail action click process applic specif interpret url html gener insert tool link figur link url link invok link insert engin gener engin recogn link function specif shown figur attribut document type target document displai link bodi function definit document type identifi default view displai document specif target queri encod html link minim resourc import smaller illustr exampl queri separ specif target queri focu function figur link specif specif queri specif shown figur specif includ queri string substitut paramet link execut queri link figur includ paramet function substitut queri string result queri function evalu mechan evalu queri determin section target queri specif describ find document locat result specif file locat attribut result start line number assum document locat document document retriev mechan vari retarget mechan section conclud step link insert process document default view case result document type default view document type shown figur default view specifi turn back examin step link insert proce specif anchor separ queri specifi queri string document locat substitut locat substitut queri string result actual queri evalu queri result list correspond locat link anchor document detail associ document type default view fairli omit queri function start locat queri string posit figur specif target queri anchor queri link figur view specif anchor queri specifi attribut return anchor tupl locat inform queri return tupl line attribut string match line attribut tupl attribut attribut indic html link type insert posit string match line target document anchor tupl posit call function occur bodi target document definit function locat html link insert begin step actual link insert link url link insert addit link includ pair type link addit item link function insert valu drawn anchor tupl specif link insert addit link paramet link attribut specif attribut anchor tupl enter link paramet link insert final result html return result activ origin link call function retarget softwar engin environ kei object compat leverag introduc www legaci softwar develop reduc disrupt ongo result exist analysi tool present implement document repositori varieti data storag strategi imposs determin priori storag format access method make assumpt tradeoff assum relat model flat model document repositori relat languag retarget machineri accommod schema retarget machineri base coupl design pattern adapt pattern factori method basic link insert engin implement defin virtual base class simpl relat access retarget specif defin implement class inherit publicli base implement virtual member function classic adapt pattern page implement class inherit privat actual implement class synopsi public base class document detail shown figur db queri class shown class db method close evalu queri virtual method implement specif interfac result evalu queri method instanc class relat wai iter tupl appli select class tupl method class class class class class class class class document virtual int virtual string virtual int virtual int factori method exampl repositori queri db class db virtual void virtual void virtual queri class tupl virtual string attr figur interfac class document interfac access valu individu attribut class virtual method access valu normal form detail shown abstract correspond composit pattern page uniform access composit object individu object class document member function process individu line document repositori class method open close document factori method page creat object document repositori method implement return instanc implement class deriv repositori queri interfac class discuss factori method implement invok creation oper creat instanc defer actual implement specif retarget experi retarget environ experi simpl cross refer analyz base analyz gener experi version cia cross referenc tool experi engin environ recent retarget describ experi retarget describ experi analyz program notori difficult syntact semant irregular popular cia implement www exist analysi tool attract proposit experi built analyz produc simpl cross referenc relat function global variabl flat file document repositori simpli unix tm file system relat normal form cia famili tool highli compact format store potenti quadrat size relat format store list valu list line number attribut languag extend accommod sort normal form attribut valu implement includ link variabl macro view present combin link fourth effort major restructur chang design pattern motiv desir softwar binari form sourc form easi straightforward fourth newest member cia easi evalu system retarget domain specif framework intend support introduct customiz softwar develop environ argument customiz present earlier paper result retarget work reusabl framework retarget customiz secondari goal undertak retarget trial previou section address retarget framework implement html link insert engin scratch softwar develop environ discuss find relat issu experi retarget effort bulk retarget effort implement interfac prior current line code implement hour knowledg specif document repositori write specif view group link wai interfac code leverag type link link insert specif compil tabl core engin insert link engin loc languag compil includ small size due heavi templat custom standard templat roughli code interpret rest string match html interact document access adapt map core engin code leverag retarget altern implement link insert engin softwar develop environ engin reason readi addit link view layer architectur style bottom layer implement html middl layer provid primit support basic link insert top layer implement link difficult provid set link build reusabl infrastructur type imposs engin correctli time core engin infrastructur find leverag write loc adapt interfac exist line code provid baselin definit favour effort learn languag effort develop debug reusabl framework similar scratch difficulti understand implement adapt interfac conveni languag framework offer viabl altern implement www legaci softwar environ retarget interfac fairli simpl quick produc custom link view desir relat work www research project effort discuss provid comparison repres sampl store manag link separ content kei system address issu project leed specif concern problem hyperlink store separ link dynam insert document time http server system sophist featur handl link insert document read hypertext content microsoft word tm perform text insert link dynam link insert polici context determin link insert special link definit featur link link depend textual context semant specif locat file reduc content content evolv freeli linkag custom author facil special featur creat link special store link inform link insert facil accept link inform vari predic assumpt inform readili exist sourc case softwar sourc code analyz gener link inform hard build modifi kei contribut regard retarget specif map link insert inform constel broad concept distribut softwar develop environ base www technolog typic http augment client side gui extens handl variabl function server enhanc servic offer sourc code develop orient activ integr facil leverag exist www softwar engin asset implement function similar advanc featur handl multilingu link multimedia content video concern maintain consist link inform distribut document probabilist algorithm develop distribut state link inform specif focu link insert softwar link insert capabl flexibl specif languag retarget insert link base inform store wide rang deriv exist analysi tool noteworthi relat system environ detail wai format sophist content exampl usag human genom shown link citat summari inform softwar object softwar featur conjunct inform displai explor possibl complementari www tool www fertil environ numer tool supplement basic web technolog emerg frequent sourc code web leverag technolog type tool work dynam gener web page context tool adapt find view web browser differ sourc includ differ file relationship link alert system monitor report conveni graphic tool visual histori tool provid graphic visual histori share context team intranet applic web distribut code inspect empir studi suggest distribut inspect base www save cost reduc interv preserv effect technolog distribut group browser follow leader seri link achiev group browser event distribut notif system clear applic distribut inspect experienc develop lead distribut group novic larg bodi sourc explain design function major project area softwar develop effort columbia architectur distribut collabor softwar develop leverag web open architectur accommod tool inform sourc fit nice link insert tool framework differ motiv introduc increment benefit legaci softwar ment leav rest environ unchang complet base integr distribut set environ uniform interfac persist legaci environ offer continu viabl opportun increment tool limit futur work gener html engin customiz retarget softwar engin task requir strategi explor abil custom link creation support suit specif task retarget introduc legaci softwar develop environ minim effort disrupt benefit analysi tool build procedur build legaci environ leverag programm requir familiar www infrastructur rest environ constant stream www technolog leverag context legaci environ limit languag facil ad integr element editor debugg examin issu integr introduc major paradigm legaci origin intent interfac strongli relat model model accommod implement adapt harder link insert engin maintain context inform current default link wast bandwidth difficult chang engin persist data inform problem languag semant inform mask macro call difficulti occur link insert provid inform handl pass difficulti link insert current implement assum singl locat link insert engin situat document repositori distribut work approach address problem develop front end specif languag hide syntax provid friendli user interfac interest extend softwar document main difficulti insert link base inform deriv analysi document explor approach base interfac publish popular http client tom alex henri david rosenblum comment suggest refer graphic histori world wide fourth intern world wide web world wide lesli david de wendi gari hill distribut link tool reader proc fourth intern world wide web confer chen engin practic reusabl unix chapter john wilei ryan graphic navig softwar document repositori intern confer softwar emden data model support reachabl analysi dead code detect proc sixth european softwar engin confer acm sigsoft symposium foundat softwar page michael inform abstract system ieee transact softwar march corbi program challeng ibm system languag independ sourc code analyz gener proc fourteenth intern confer softwar fred thoma internet differ track view web world wide januari frank al system vlissid design element reusabl orient softwar addison judith grass chen inform usenix april kaiser stephen architectur effect util distribut heterogen inform resourc technic report columbia depart comput march stephen jack yang architectur environ proc intern confer softwar ram program languag hypermedia proc intl world wide web june cognit process program proc workshop empir studi ablex nj specif driven gatewai tool solowai cognit analysi code inspect proc workshop empir studi ablex nj stai multicast asynchron notif intranet web technic open tutori guid addison url minder servic de lg mw wade anytim code web remov inspect bottleneck softwar develop intern confer softwar perri alexand wolf foundat studi softwar architectur acm sigsoft softwar engin octob personnel christoph ram proc usenix confer languag usenix octob mari shaw david garlan softwar perspect emerg disciplin gnu emac manual kenni muller visual environ engin proc intern confer softwar design framework develop network applic proc fourth intern world wide web confer compar develop cost ada
AI/364 2 word disambigu base semant densiti rada dan moldovan depart comput scienc engin southern abstract paper present word disambigu method base idea semant densiti word disambigu context wordnet internet raw corpora provid statist inform word associ metric introduc measur semant densiti rank combin word method indic correct word time top rank top rank introduct word disambigu open problem natur languag process solut impact task refer infer method broadli classifi make inform provid machin readabl dictionari inform gather train corpu semant disambigu train church inform gather raw corpora train hybrid method combin sourc knowledg lexicon colloc statist method produc high accuraci result small number preselect word lack wide semant tag corpora exclud learn method disambigu method disadvantag defin statist method disambigu adject adverb approach determin conceptu distanc measur semant close word semant network length shortest path connect concept measur conceptu distanc determin likelihood word associ method determin noun verb wordnet larg text base occurr verb semant relat verb object determin measur semant similar noun object method larg corpora base made measur conceptu densiti method paper appli measur conceptu distanc verb direct link provid noun verb hierarchi method measur semant similar noun method consist hierarch concept graph construct wordnet data semant similar formula method provid link word approach approach paper base idea semant densiti measur number common word semant distanc word closer semant relationship word higher semant densiti defin semant densiti work case uniform realiti gap knowledg semant densiti provid estim actual semant word introduc semant densiti easi measur wordnet count number concept word common metric introduc appli combin word rank idea paper internet raw corpora sourc internet gather statist wordnet measur semant densiti shown rank word result sourc issu combin rank order provid rank possibl parallel serial serial approach provid result verb noun method consist rank noun retain algorithm output produc algorithm rank pair verb noun extens method pair verb noun larger window word consid essenti aspect method present provid associ word binari combin control modul distinguish correct associ small pool wordnet fine grain make difficult pinpoint correct combin semant close applic machin fine grain disambigu work inform extract applic lump simpl sentenc question briefli action main idea sentenc investig report pair phrase ambigu poor result search interfac base sentenc improv associ verb noun determin wordnet gloss verb synset noun occur context verb gloss corpu rank noun order improv determin conceptu densiti verb noun reason accuraci approach consid task statist method larg text larger collect bigger probabl provid accur rank biggest number text electron store favor automat process thought internet sourc corpora rank word step method pair creat pair verb remain noun replac word similar list similar list creat word noun synset word noun hypernym synset algorithm untag verb noun pair rank noun form similar list noun noun mean similar repres repres synonym number noun defin wordnet form verb noun pair pair form search internet rank search perform internet group rank noun experi power search engin hit provid altavista verb noun noun result action resolut reject amend legisl person support expend fund provid defeat person wait term receiv vote law expect resign topic hold meet remedi problem place burden award fee award protect court tabl sampl result obtain rank noun internet oper provid group deriv express asterisk wildcard indic find word match pattern letter number hit noun rank noun relat verb test method pair extract brown corpu queri form input search obtain accuraci provid rank noun classif tabl present sampl result obtain column result tabl present rank noun column mean mean top rank provid top rank queri form result obtain prove oper bigger number hit rank remain interest observ creat queri start pair extract file search web identifi word link lexic relat base idea fact noun directli verb highli probabl object verb express interest determin verb noun share common context determin conceptu densiti verb noun measur word knowledg sourc nlp applic conceptu densiti verb noun difficult larg corpora dictionari semant link verb noun semant link trace gloss provid context verb algorithm untag verb noun pair rank noun determin algorithm tag verb noun pair pair determin verb wordnet denot method section noun rank step consid pair conceptu densiti comput extract gloss includ method determin explain determin noun gloss constitut verb noun store level verb determin noun includ determin number ij common concept noun obtain noun obtain suitabl combin verb noun provid biggest valu ij order determin statist provid tag version brown corpu word word includ synset hierarchi top hierarchi denomin class word word class word word class investig part common noun statist measur perform probabl word part number probabl speech word noun verb tabl probabl word class shown tabl class noun probabl correct class noun hierarchi includ noun class noun method consid noun class work probabl correct class smaller base experi includ verb determin hypernym verb hierarchi top bigger hierarchi provid synonym direct provid accuraci metric comput larg corpora replac corpora result achiev gloss consid enlarg order miss correct answer conceptu densiti metric determin conceptu densiti noun verb algorithm ffl list noun sv gloss verb hierarchi determin hypernym level hierarchi ffl list noun sn class common word list produc list common concept weight cd ij conceptu densiti ij ij ffl ij number common concept hierarchi ffl weight noun verb ffl desc total number word hierarchi noun noun big hierarchi tend big ij weight sum common concept normal respect dimens noun hierarchi estim logarithm total number descend hierarchi number common concept noun verb weight weight summat common concept noun verb normal rapport noun hierarchi consid metric run program formula provid result improv metric weight level noun addit level verb hierarchi pair phrase law verb wordnet make write alter write student shake organ noun law collect rule respect assemblag thing group law set rule govern activ legal document set law prescript guid conduct legal legal offici instrument natur law rule bodi rule conduct inher human natur essenti bind human concept abstract gener idea infer deriv specif law natur gener base recur fact event scienc mathemat law concept abstract gener idea infer deriv specif legal philosophi branch philosophi concern philosophi ration investig question exist knowledg polic law forc law personnel peopl obei practic law learn profess master graduat studi law school judici studi law learn profess profess believ requir advanc learn high search pair creat word similar list law step method rank number hit noun law elig algorithm determin includ noun gloss weight determin noun class tabl valu obtain combin number common concept verb noun hierarchi ij summat weight noun verb total number noun hierarchi desc conceptu densiti ij pair deriv formula present ij weight desc ij tabl valu comput conceptu densiti conceptu densiti ij number verb number noun law biggest conceptu densiti combin file test test method pair randomli select sampl entir tabl pair present tabl pair verb noun result total number verb notat mean verb noun result action resolut reject amend legisl person support expend fund provid defeat person wait term receiv vote law expect resign topic hold meet remedi problem place burden award fee award protect court tabl sampl result obtain pair extract noun column illustr number combin verb comput total verb total noun number column column result obtain conceptu densiti method determin associ verb noun number column interpret mean combin verb result combin mean combin verb result top combin dash mean noun includ determin rank method discuss column tabl rank provid respect combin tabl present summari result number rank provid pair combin consid consid percent tabl summari result pair match choic match top choic top choic evalu ffl gloss base calcul conceptu densiti advantag elimin larg corpu disadvantag corpora determin noun verb error rate verb noun function wordnet ffl combin case combin determin context pair protect court combin court mean assembl conduct judici busi method court room law court outlin hard compar long distinct resid approach consid base statist word disambigu priori noun base algorithm disambigu verb noun make comparison accuraci method assign word frequent base evalu method case case pair consid assign frequent result accuraci verb accuraci assign frequent verb noun measur wordnet occur probabl adject adverb result accuraci disambigu verb noun assum frequent word import improv achiev method accuraci extens method paper method present appli similar determin conceptu densiti pair oper step number word consid time word present method base measur conceptu densiti word wordnet metric improv weight verb noun word user select choic depend applic internet sourc statist raw corpora method extend word part speech cover wordnet difficult compar obtain method collect mean method word time estim extract squar root accuraci pair choic choic disambigu noun higher number provid averag refer digit equip corpor altavista home page word disambigu conceptu intern confer recent advanc natur languag bruce word disambigu annual meet associ comput linguist june guthri lexic disambigu simul anneal intern confer comput linguist franci comput analisi american brown church darpa speech natur languag matwin algorithm word semant disambigu intern joint confer artifici intellig multipl knowledg sourc word comput ga lexic intern journal ga semant concord darpa workshop human languag ga rg semant concord identif arpa human languag technolog ht ng hb integr multipl knowledg sourc disambigu word annual meet associ comput linguist santa develop applic metric semant net ieee transact man vol pp select prefer acl workshop tag text lexic april resnik perspect word disambigu method acl workshop tag text lexic april af smeaton wordnet knowledg base measur semant similar technic work paper school comput dublin citi combin lexic knowledg method word disambigu comput linguist word disambigu rival method associ comput
IR/365 5 open archiv build framework carl lagoz digit librari research group cornel ny abstract open archiv initi develop promot solut aim facilit effici dissemin content root lie commun year focu extend includ content provid paper describ recent histori origin promot broaden detail technic standard metadata applic futur plan categori subject descriptor interfac definit languag gener term standard keyword digit protocol introduct octob meet held santa fe discuss mechan encourag develop solut group meet unit belief ubiquit interconnect web opportun time dissemin scholarli inform physic archiv run paul lo alamo nation laboratori radic chang publish paradigm respect field similar effort extend strike domain permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee june va copyright acm herbert van de digit librari research group cornel ny result meet format open archiv initi begin work framework facilit feder content provid web undergon period intens develop technic origin focu broaden encompass content provid domain emphasi classifi refin extens test technic framework organiz structur support initi establish open archiv initi reflect origin commun term archiv gener accept synonym repositori scholarli paper member archiv profess justifi note strict definit implic preserv author institut polici term broader repositori store inform languag term unambigu request archiv commun constrain explan term due intent architectur perspect defin promot machin interfac facilit avail content varieti provid open access inform repositori conform technic framework term casual ignor fact monetari cost type restrict inform advoc inform recogn reason restrict denial servic attack inform paper document develop open archiv initi describ plan futur time complet paper technic specif metadata harvest protocol substanti interest approach advoc establish framework applic domain catalyst feder broad content provid year true technic framework defin metadata harvest protocol suffici underpin develop usabl digit librari servic origin initi meet develop open archiv initi detail earlier paper section summar materi perspect current develop event origin lie interest altern tradit scholarli publish paradigm disagr natur widespread consensu radic inevit numer motiv factor chang number scholarli comput life produc result increasingli rapid pace veloc chang demand mechan report result lower latenc time experienc establish journal system ubiqu network person comput creat consum demand web deliveri research result econom model scholarli publish sever strain rapidli rise subscript price research librari budget scholarli develop altern model commun scholarli result form repositori demonstr viabl altern tradit journal public physic archiv run paul lo alamo nation laboratori number establish effort ncstrl collect demonstr grow interest scholar internet web vehicl dissemin research find advoc view solut step radic transform scholarli publish author reclaim control intellectu properti publish process octob meet santa fe call preprint organ belief archiv kei impact make bridg number archiv issu relat santa fe meet sponsor council librari inform resourc digit librari feder scholarli publish academ resourc coalit associ research librari lo alamo nation laboratori suffici establish framework requir technic organiz agreement benefit feder repositori scholarli endeavor increasingli scholar move research result disciplin feder encourag construct innov servic servic inform repositori process inform link creat queri maintain servic benefit feder demonstr earlier work join lo alamo archiv ncstrl system prototyp prepar santa fe meet numer facet includ uniform metadata document access protocol particip santa fe meet decid solut critic widespread adopt provid meet adopt solut metadata harvest solut print provid metadata open intent metadata basi servic develop detail metadata harvest technic agreement provid section result meet set technic organiz agreement santa fe convent technic aspect includ agreement protocol metadata harvest base broader protocol common metadata standard open archiv metadata uniform identifi scheme organiz agreement meet inform involv establish email list commun rudimentari registr definit accept polici consum harvest metadata santa fe meet close enthusiasm particip refin agreement pursu implement short period technic specif complet post publicli access web site result santa fe meet number particip quickli implement technic agreement experi number prototyp servic dissemin santa fe convent februari clear interest commun number commun intrigu solut view metadata harvest mean end strong interest research librari commun kei member commun met cambridg sponsor digit librari feder andrew mellon harvard half goal meet explor wai research librari aspect collect web search engin includ repres research librari museum metadata uniform fashion kei step achiev goal addit evid interest santa fe convent form open archiv initi workshop held acm digit librari confer san antonio european digit librari confer lisbon particip workshop includ metadata digit librari scholar interest respond wider interest requir number made member open archiv initi santa fe meet month origin mission solut mean achiev global accept goal share major deem restrict possibl alien commun directli engag interest number aspect technic specif specif origin mission gener applic broad rang commun credibl effort uncertain due lack organiz infrastructur commun research librari commun hesit adopt stabil organ promot mainten standard question issu organiz stabil address august librari network announc organiz support resourc ongo effort support announc made press format steer membership commun level intern particip steer list appendix section steer immedi address task compil mission statement reflect broader scope mission statement open archiv initi develop promot standard aim facilit effici dissemin content open archiv initi root effort enhanc access archiv mean avail scholarli commun continu support work remain cornerston open archiv program fundament technolog framework standard develop support work independ type content offer econom mechan surround broader relev open access rang digit materi open archiv initi organ effort explicitli commit explor enabl broader rang applic gain greater knowledg scope applic underli technolog standard begin understand structur cultur adopt expect make continu evolutionari mission organ open archiv initi technic umbrella practic publish archiv refer librari figur framework multipl commun mission illustr figur technic framework design umbrella exploit varieti commun kei element mission statement formul organ effort explicitli organ awar technic infrastructur metadata harvest proven effect mean facilit achiev organiz structur strategi reflect belief steer requir delic balanc stabil flexibl strong consensu goal scope control area potenti area resist expand scope current technic goal met justifi steer step address focu santa fe technic agreement fix problem reveal test agreement technic form meet organ cornel septemb result meet report section technic framework technic framework open archiv initi intend provid approach membership recogn function limit framework address number issu complet manner note bill arm strategi gener cost function technic framework intend replac approach provid altern constitu address exist solut note prove realist function root technic agreement li distinct class data provid adopt technic framework mean metadata content servic provid harvest metadata data provid protocol metadata basi servic remaind section describ compon technic framework theme carri framework section attempt defin common denomin multipl commun provid hook individu commun address individu interf detail technic framework open archiv metadata protocol specif web site metadata technic framework address metadata extens commun issu subject discuss metadata commun attempt answer simpl manner requir metadata address requir data provid suppli metadata common format dublin core metadata element set mandat common element set dublin core subject discuss investig research literatur place burden consum metadata toler export heterogen metadata reli servic map domain strict interest easi usabl decid common metadata format prudent dublin core result origin santa fe convent defin metadata open archiv metadata function tailor commun broaden focu forc altern leverag activ work dc commun formul set resourc discoveri chosen familiar dublin core note field dc option discuss requir number dc element record requir prefer perspect spirit persuad element option desir earli stage encourag metadata supplier dc metadata reveal market metadata practic note specif dublin core common metadata set made base belief common metadata set explicitli granular resourc discoveri discuss qualif detail descript simpl area content threaten goal simpl resourc discoveri approach strictli separ simpl discoveri descript metadata address technic framework support parallel metadata set technic framework place limit natur parallel metadata record structur xml xml schema valid section time complet paper initi step encourag develop harvest metadata set repres commun work metadata set target commun repres research librari commun similar effort call commun museum open languag identifi technic framework defin byte stream serv packag mechan harvest metadata record header inform common record independ metadata format dissemin harvest process inform defin header uniqu identifi record indic date latest date chang metadata record metadata metadata singl format note section data provid capabl emit record dc metadata metadata format option option hold data metadata part record hold inform term condit usag intern structur defin protocol left individu commun decid syntax semant definit schema sampl record shown figur metadata record dissemin network access server data provid conform repositori support set protocol request defin section repositori metadata record harvest repositori correspond item relationship record metadata express multipl natur item type metadata store type deriv item includ metadata scope protocol admittedli natur item intent harvest protocol meant agnost natur data provid support content fix metadata deriv metadata format intermedi form content metadata store figur sampl record metadata intermediari extern content provid illustr figur record identifi natur identifi deserv discuss record identifi serv kei extract metadata item repositori metadata format produc record identifi act manner kei uniqu kei correspond metadata deriv item protocol address issu global uniqu identifi issu address level section record identifi identifi item issu identifi content repositori scope protocol client protocol access full content metadata record protocol recommend repositori element metadata record establish linkag record identifi item mandatori dublin core format identifi element select harvest protocol enabl consum metadata gather metadata data provid cumbersom imagin transact larg research librari metadata entir catalog provis select make protocol subset record desir broad rang function express protocol includ provis specif complet predic manner inform request decid high function protocol opt simpl criteria select harvest note section record date defin date latest date modif effect chang metadata record dissemin harvest request correspondingli date rang total partial lower bound upper harvest mean increment harvest client weekli schedul harvest record select harvest record ad modifi harvest time protocol defin set option construct group item repositori select harvest set harvest request record specif group return harvest request item repositori organ set repositori defin hierarch organ set set figur illustr sampl set hierarchi fiction print repositori actual mean set defin protocol expect commun protocol formul welldefin set configur control vocabulari set develop mechan servic provid experi protocol proce interest commun exploit set mechan suffici function provis select client make harvest request repositori larg fulfil singl protocol make provis case notion state figur sampl set hierarchi result set client explicitli open conduct transact close session session mainten notabl complex ill suit protocol intend carrier protocol request simpl flow control mechan make partit larg transact request flow control mechan emploi resumpt return repositori harvest request larger repositori respond time client resumpt token make subsequ request transact complet open archiv metadata harvest protocol initi protocol santa fe meet subset protocol subset protocol function metadata aspect legaci context present barrier simpl implement current technic framework built easier implement protocol open archiv metadata harvest protocol open archiv metadata harvest protocol consist request verb protocol carri http post method intent make simpl data provid configur conform repositori readili web tool request internet host port http server act option path respect http server handler protocol request keyword argument consist list pair protocol request pair specifi protocol request figur show encod sampl protocol request http post method request specif request return record identifi dc format figur sampl request protocol request encod xml includ protocol request gener facilit machin batch process xml defin xml schema goal make conform technic specif machin verifi test program visit issu protocol request test conform schema defin protocol remaind section summar protocol request verb retriev individu record item repositori requir argument request record format metadata includ record identifi verb retriev inform repositori schema specifi inform return identifi human readabl repositori base url repositori version protocol support repositori address administr repositori addit fix protocol mechan individu commun extend function verb list descript commun defin xml schema specifi semant addit descript repositori verb retriev identifi record harvest repositori option argument permit select identifi base membership specif set repositori base delet specif date rang verb retriev metadata format repositori option argument restrict request format specif record verb harvest record repositori option argument permit select harvest base membership record specif set repositori base delet specif date rang verb retriev set structur repositori data provid conform registr expect data provid fall layer higher layer impli data provid support protocol definit state conform testabl valid track provid protocol requir registr procedur data provid regist web site registr entail data provid registr softwar test complianc data provid record conform convent identifi follow convent fix string indic namespac identifi repositori uniqu namespac identifi uniqu respect repositori scheme advantag repositori adopt convent record identifi resolv central resolut made web site intent make resolv mean support open link base identifi attract approach demonstr experi conduct namespac process standard recent start test refin particip septemb technic meet cornel develop rough outlin technic framework task normal put framework form specif undertaken cornel open archiv initi activ coordin continu feedback group implement consecut version protocol plai import role activ particip group solicit origin santa fe convent commun sponsor cambridg meet solicit led test organ alpha tester email list complet list alpha tester shown appendix section includ repres research repositori publish collector web site metadata alpha test includ rudimentari servic provid construct search interfac base metadata harvest alpha tester deserv special mention virginia tech creat continu updat repositori explor examin complianc repositori recent version protocol document simeon warner alamo nation laboratori michael nelson northern carolina extens version protocol document result test encourag protocol specif pass number vet extens error ambigu virtual tester remark implement conceptu simplic protocol road ahead begin open archiv initi began phase public technic framework initi process public meet schedul meet held washington dc januari registr meet close maximum particip reach particip repres wide varieti commun european meet schedul februari berlin particip meet heard complet overview goal technic framework meet provid opportun develop commun open archiv framework commun form group data provid exploit extens open archiv harvest protocol metadata develop target servic meet meant extend period harvest protocol intend period protocol stabl phase motiv belief commun fulli understand function limit framework major function larg research implement plan experi function technic nation scienc digit librari project fund nation scienc foundat goal creat onlin network learn environ resourc technolog educ group cornel fund core infrastructur portion context alpha test experi harvest servic form basi servic infrastructur futur plan includ work partner san diego super comput center harvest metadata normal storag metadata make metadata searchabl protocol project fund european commiss partner uk main object develop advanc internet access mediat servic support scholar individu member commun interact larg interdisciplinari electron archiv plan investig construct servic open archiv foundat digit librari feder testb cambridg meet earlier meet interest project particip octob andrew mellon foundat explor resourc issu metadata harvest identifi step result meet commit number institut metadata number collect open archiv technic experi servic metadata project framework chang expand intrigu period li ahead encourag widespread interest open archiv initi context awar approach goal don member steer point technic includ number assumpt issu fulli understood common metadata interact nativ metadata set convent incent reward institut organ particip intellectu properti issu harvest technic framework encourag model scholarli examin member digit librari commun made casual statement publish hope creat framework investig issu lai foundat inform statement issu critic success field appendix steer arm inform system dale ed fox paul alamo nation daniel carl lagoz clifford lynch john digit institut human herbert van de don water andrew mellon appendix alpha test site institut particip alpha test technic museum consortium cornel lo alamo nation laboratori nasa oclc resourc discoveri network illinoi urbana champaign north carolina pennsylvania southampton virginia tech acknowledg member open archiv initi commun steer technic alpha workshop particip develop year care read edit support work open archiv initi digit librari coalit network nation scienc foundat grant darpa contract refer van de santa fe convent open archiv initi winner loser global research villag serial free futur review journal digit librari commun acm jy lagoz comput research promot rapid dissemin archiv comput scienc research digit librari fourth acm confer digit librari ca van de ml servic magazin jr architectur distribut document librari commun approach find research materi digit librari feder acm digit librari acm confer digit june san texa associ comput machineri research advanc technolog digit european septemb lectur note comput scienc berlin springer digit librari digit librari electron publish mit press ca warwick architectur aggreg set metadata cornel comput scienc accommod simplic complex lesson dublin core experi seminar metadata netherland institut archiv educ hagu dublin simpl content descript format electron resourc mind queri map heterogen inform sourc intern confer manag data symposium principl system dublin core simpl xml schema part primer world wide web consortium xml schema part structur world wide web consortium pv xml schema part datatyp world wide consortium van de refer link hybrid librari environ part gener solut experi van de refer link hybrid librari part framework link van de refer link hybrid librari part gener link magazin search middlewar simpl digit librari protocol
HCI/366 4 interfac inform joint process audio visual inform interact ibm thoma watson research yorktown ny usa abstract exploit human perceptu principl sensori integr joint audio visual improv recognit human activ speech event detect speaker intent human ident presenc acoust degrad due channel present result varieti context demonstr benefit joint process introduct human varieti mode inform touch recogn peopl understand activ begun investig method combin audio visual inform improv robust natur human comput interfac short term focu exploit visual inform improv technolog speech speaker speech event detect speaker chang detect presenc acoust mismatch due channel long term object build perceptu interfac inform interact multipl sensori inform sourc acoust activ recognit interpret human activ intent applic work includ accur audio transcript effici search retriev multimedia content improv interfac multipl mode robust recognit human activ realist environ automobil public inform background problem recognit technolog base acoust figur illustr schemat step involv fusion singl ident person speech captur audio visual sensor stream sampl rate sampl signal repres featur space featur fusion audio featur concaten form singl featur interpol slower stream equal made singl classifi combin independ stream multipl classifi note case featur region interest percept extract speech speaker recognit entail detect face extract region region interest describ methodolog face result demonstr benefit joint process speech speaker detect detect describ extract region interest face detect facial featur extract face detect facial featur local method video face detect perform emploi combin subsequ face featur find face templat size chosen imag pyramid permiss scale frame size face search imag space face candid video signal segment narrow search candid significantli high proport pixel remain face candid score base fisher linear discrimin distanc face space candid region threshold score consid face face ensembl facial featur detector extract verifi locat facial includ lip corner center search featur occur hierarch featur featur locat rel high level featur locat featur locat stage determin score combin prior linear discrimin dff speech recognit human fuse inform audio visual stimuli recogn speech visual modal complementari inform audio modal focu interest demonstr improv realist task broadcast transcript larg vocabulari dictat impair sourc audio sensor video sensor audio sampl video featur transform featur transform confid direct sum confid collect larg tm train utter script consist subject close hour speech full frontal face color video subject minor distanc light variat video captur resolut pixel frame rate encod audio captur sampl rate video stream experi select utter subject randomli split train test utter creat utter train set utter test set process video data extract mouth statist face detect featur local templat train video frame mark facial featur locat face detect perform test video sequenc approxim million assum face present video frame face detect mouth featur local roi estim visual featur comput summar result error rate larg continu speech recognit preliminari experi detail hmm base system vocabulari word languag model visual speech repres cascad transform mouth region transform project discrimin featur space standard cepstral featur repres audio stream obtain wer wer wer featur fusion fail improv asr perform small vocabulari task result experi asr improv achiev audio corrupt audio corrupt ratio match noisi audio wer improv fv classifi classifi classifi refer similar metric similar metric refer figur inform fusion engin incorpor visual inform implement fusion featur fusion fusion mean hmm investig stream estim techniqu wer reduct achiev clean audio case speaker recognit combin imag video base visual signatur audio featur base speaker identif improv person authent imag base speaker identif facial featur locat includ larg scale featur small scale prior statist restrict search area featur estim gabor jet gener gabor jet set gabor filter sine wave modul gaussian filter scale orient scale give complex coeffici featur locat simpl distanc metric comput distanc featur vector train face test candid distanc train candid test candid featur defin averag pj ak kx measur similar test face face templat speaker identif approach audio base speaker identif model enrol repres mixtur gaussian model defin paramet set consist vector covari matric mixtur weight vector pi goal speaker identif find explain test data repres sequenc frame total fai model mi test data sum log test frame measur likelihood fusion fai nx speaker recognit face recognit speaker identif carri top score audio identif scheme list combin weight sum subsequ candid chosen defin combin score function singl paramet ca cv sin angl select rel reliabl audio face identif optim gain maximum accuraci train data elabor denot respect score ith enrol speaker comput nth train clip defin variabl nth clip belong ith speaker equal uniti minim number empir error nx arg max joint score fai experi carri cnn video data collect part arpa broadcast transcript task linguist data consortium digit clip anchor report frontal shot face video tape format train data clip speaker test data consist addit clip speaker result combin audio visual inform speaker recognit linear fusion method shown tabl detail speaker chang detect detect valuabl piec inform speaker identif metadata search retriev acoust condit clean noisi telephon audio id video id linear fusion tabl speaker id multimedia content explor visual speaker scene chang inform remov detect hypothesi perform audio video techniqu improv exploit joint statist audio stream video correl audio video speaker newscast video scene chang shortli audio chang speaker chang problem detect transit point time model data set model singl gaussian process distinct gaussian process obviou notat vector covari matrix bic base model select procedur consid differ bic valu model maximum likelihood ratio log dimens vector transit point speaker chang video base scene chang detect statist model base criterion bic criterion describ altern procedur color histogram gener video featur vector type diverg nx vi log xk xk vi adjoin vector vi superscript denot kth compon vector comput averag fix number sampl past transit point threshold fusion fusion problem intellig combin probabl probabl fv video featur vector past posit probabl fa comput base audio data posit fusion strategi adequ fusion map fc case fusion strategi solv optim problem arg max paramet account fact speaker chang audio signal speaker chang video signal minut panel discuss audio speaker immedi video chang initi result video content suggest fusion improv recal rate recal rate speech event detect speech recognit system open intuit natur interact current hci system speech recognit requir human explicitli intent speak turn microphon keyboard kei aspect natur speech commun involv abil human detect intent speak recent experi refer human detect intent speak combin visual auditori cue visual cue includ physic frontal lip automat detect speech onset carri detect base audio energi method combin method comput probabl densiti fa pr fv mixtur gaussian pdf simpl fusion strategi linear experi fc subset speech recognit train data improv speech event detect db snr combin visual inform built practic system visual cue head pose visual mouth activ intuit manipul microphon state speech interact fusion multipl sourc inform mechan robustli recogn human activ intent context human comput interact present result suggest improv obtain fusion audio visual inform speech speaker speaker chang detect speech event detect refer lip vol pp dw dg recognit sensori american vol pp larg vocabulari continu speech recognit broadcast domain ieee continu speech recognit automat speech understand speaker recognit video broadcast fusion techniqu ieee iyengar speaker chang detect joint statist riao april detect human comput interact ieee int conf acoust speech signal potamiano discrimin train hmm stream expon speech recognit proc cascad imag transform speaker independ automat proc int conf multimedia potamiano stream confid estim speech recognit proc recogn face broadcast video ieee intern workshop track face gestur
HCI/367 4 feasibl termin johan henk delft technolog netherland abstract paper studi requir wearabl termin requir translat gener hardwar architectur consist programm modul commun central interconnect care select compon show feasibl construct ar termin weigh kg roughli dissip batteri averag resourc termin oper hour introduct goal ubiquit comput comput act support instantli comput move awar center attent ubiquit comput realiti import technolog wireless commun augment realiti wireless commun requir obtain servic provid arbitrari comput locat user state art wireless provid bandwidth coverag applic web surf wireless comput limit text graphic imag forev load commerci interest wireless commun advanc bandwidth individu user quickli augment realiti technolog ubiquit user interfac hide comput human awar applic augment realiti capabl enhanc real world addit inform conveni locat view user inform simpl plain complex synthet object support dutch organ appli scientif research physic electron laboratori displai stereo augment realiti requir exact locat orient user render visual inform correctli applic advantag locat interact travel guid provid inform spot spot comput intens augment realiti high unsuit wearabl comput task posit video compress requir special compon achiev high perform low energi consumpt energi consumpt batteri fraction weight wireless termin wearabl comput provid raw process power requir applic ubiquit commun project develop gener wireless termin enabl ubiquit commun paper termin meet challeng requir term energi flexibl termin studi base modular design exploit mode provid individu compon ar termin feasibl build todai hardwar consist standard integr circuit commerci integr major undertak requir requir gener termin difficult ar technolog rapidli advanc true experi limit deriv requir user perspect termin displai augment inform time flexibl support applic ar perform assum ar applic scene synthet object view user stereo displai requir augment environ true object object detail textur dynam request server backbon network requir wireless connect suffici capac anticip applic displai full motion throughput wireless connect order mbp user latenc wireless stringent interact audio requir ms object posit accur user view rotat accuraci reason requir correspond roughli quarter thumb arm length maintain accuraci user move moder latenc ar displai subsystem requir ms short time detect user comput augment view base head updat displai ms latenc requir constrain exce hz rotat accuraci consequ resolut displai size pixel field view minim resolut pixel requir posit system accur place virtual object meter locat accur cm wearabl ar termin wearabl cloth weight hinder user movement balanc compon camera weigh compon meant store pocket limit weight size pda weigh gram devic weigh properli shape compon match form human bodi weigh kg hinder user import consequ wearabl requir weight batteri part ar termin limit kg state art batteri technolog mean ar termin carri wh energi design major issu develop ar termin figur system structur flexibl field augment realiti rapidli evolv requir mobil termin user profit futur develop termin design handl advanc hardwar develop softwar hardwar user start cheap low perform displai upgrad altern convinc ar potenti softwar import offer support gener process termin applic develop system structur requir previou section extern specif ar termin perform requir concern termin total weight concern singl unit commun throughput understand impact global requir import identifi unit interact depend figur show function system structur ar termin project consist unit applic crucial connect unit drive imag synthesi instruct respond input user interfac locat report posit unit applic handl contact user reachabl wireless network figur hardwar architectur note imag synthesi sole control inform posit unit meet ms requir latenc user movement displai updat includ applic loop introduc latenc applic specifi object augment imag synthesi determin object displai user view base exact posit orient note imag captur unit imag imag compress posit system connect aid meet rotat accuraci requir featur extract imag real world offer addit mean correct drift error posit devic acceleromet gyroscop knowledg posit orient user viewpoint vital imag accur view hardwar architectur system structur function descript ar termin map specif hardwar requir section met complex task design issu address choic impact issu hardwar architectur figur constrain seemingli unlimit design altern ar termin hardwar templat offer enforc flexibl structur consist modul interact central interconnect flexibl modular hardwar architectur requir flexibl ar termin improv product accur posit easili integr replac origin posit modul product incorpor simpli ad central interconnect gener processor flexibl applic softwar low power modular structur suitabl power import limit batteri capabl ar termin modul switch depend applic watch video clip commut train camera posit modul power prefer modul equip local behav intellig power devic autonom explicit control applic frequent emploi method reduc power requir load task server backbon network constraint task execut cost complex termin reduc demonstr project complex deal distribut system address issu data consist hardwar architectur modul connect wireless network central interconnect configur task backbon multipl devic advantag modular structur modul free multipl devic provid singl interfac modul posit system combin inform camera imag provid requir posit accuraci sensor part singl combin input occur local interrupt modul local process import avoid unnecessari data copi interconnect multipl devic offer wide rang obtain singl devic wireless connect modul equip infrar gsm offer commun backbon network indoor outdoor select autonom devic remaind termin shield hand figur demonstr architectur demonstr valid system structur hardwar architectur discuss section demonstr assembl compon emphasi develop termin requir function short time frame month usag compon conflict wearabl result demonstr weigh kg dissip experi gain construct provid import input design wearabl termin present section demonstr consist base station wireless termin hardwar architectur termin shown figur central interconnect termin bu passiv slot advantag standard pc board render imag stereo perform ordinari card head mount displai commerci displai stereo displai field view resolut weigh demonstr architectur close match hardwar architectur section wireless connect custom design infrar link driven dsp board send receiv dsp board perform video input directli camera interconnect figur posit magnet tracker number fix ultrason acoust limit usag demonstr indoor environ figur show demonstr hardwar figur demonstr figur applic artifici lem real box power ultrasound sensor softwar demonstr open system base linux kernel softwar organ system structur section imag captur connect posit system ultrasound system calibr unlik larg fraction softwar develop hardwar product typic accompani vendor softwar linux imposs chang proprietari natur manag simpl lem execut demonstr figur show view hmd real artifici object dynam switch card phone mw gram mw oz light mw mpeg enc gram wh gram wh gram wh gram wh gram mb ram mw gp mw gram mw gram mw wavelan mw light mw mw mw mw mw mw mw mb ram mw mb ram mw mw mw mw mb ram mw pc card pc card fifo fifo fifo fifo mw mw mb ram mw gyro mw posit wireless connect interconnect applic imag captur imag synthesi irda mw mw figur architectur design section discuss iter design process wearabl ar termin aspect neglect demonstr experi intellig modul reflect termin architectur present figur modul equip cpu control dedic hardwar interfac modul processor heterogen programm modul simplifi softwar modest power demand sa architectur flexibl system wearabl altern design dedic hardwar reduc power consumpt deploi futur function modul flexibl import todai remaind section discuss design modul result select compon present figur goal power dissip limit ar termin oper hour kg batteri oper time termin depend effect mode hardwar compon deploi execut mix ar applic issu discuss section interconnect interconnect form heart ar termin capabl transport data modul requir speed actual throughput requir depend data stream gener ar applic hand anticip maximum throughput burst roughli deriv throughput demonstr requir interconnect interfac minim glue logic processor intellig modul basic interconnect altern share bu ethernet packet switch atm share bu easili extend modul flexibl requir ar termin disadvantag bu technolog limit data rate power consumpt mode difficult realiz bu interfac requir listen continu determin data address mbp part texa instrument dissip transmit full speed packet switch perform ratio switch transport data parallel activ modul particip consid ieee candid ar termin interconnect ieee model manufactur resolut color bright field view refresh power displai bit mono color bit color bit color bit color bit color planar bit color planar bit mono planar bit mono tabl characterist micro displai offer switch data rate meet throughput dissip render unsuit ar termin switch specif design current fpga implement dissip mw port aggreg throughput mbp switch fabric intermedi solut perform ieee low power dissip switch transfer mbp mw channel unlik passiv switch driven control processor sa fifo buffer data transport switch easili interfac cpu present modul configur switch control dissip posit posit modul driven control program cpu combin inform gener multipl sensor sensor head gyroscop sensor orient sensor sensor track local movement orient user head global posit track gp receiv dissip mw exclud antenna accuraci gp receiv enhanc dead reckon navig system intern magnet electron enhanc gp inform correct drift accumul error head worn sensor disadvantag gp oper outdoor environ requir ar termin function indoor addit sensor calibr orient devic gp function system demonstr unsuit limit singl room dissip project research possibl featur extract track object user view requir camera deliv stream imag posit system sophist algorithm analyz camera imag deriv gener video captur addit camera hook posit system directli imag render displai processor control render displai system convert descript scene object render specif input format polygon decompress audio video encod mpeg stream obtain backbon server wireless connect ii render chip render real time dissip requir addit mb choic displai import determin ar termin larg extent displai form capabl interest offer small form factor combin low power requir tabl list characterist commerci micro displai requir high resolut displai section displai select basi ar termin applic imag captur main requir camera low weight mount user head encod compress audio signal camera prefer output digit signal camera approach weigh dissip analog output explicitli convert digit signal cpu imag captur move data encod interconnect task execut applic save gener modul virtual cost wireless connect wireless commun modul emploi multipl devic provid cost defin power dissip power dissip radio typic depend rang oper irda short rang wavelan gsm global coverag cpu run commun softwar drive select connect backbon network depend applic perform radio current locat provid seamless hand multipl radio contact outdoor irda wide accept standard infrar commun low power requir hp dissip mw transmit mbp short rang limit irda indoor environ offic hallwai wavelan radio rang outdoor perform depend distanc target mbp limit rang indoor commerci pc card dissip gsm radio nokia integr pc card gsm phone antenna deliv dissip intend backup move wavelan coverag softwar sa form core intellig primarili select aspect advantag sa support linux oper system softwar demonstr system run top hope fraction termin major obstacl devic driver distribut comput aspect introduc intellig modul concept applic render share main cpu run separ modul termin softwar glue bind intellig modul larg impact energi power weight posit gp receiv gp antenna dm gyroscop mb render displai ii mb mb video applic camera encod mb wireless connect infrar wavelan gsm mb interconnect fifo mb batteri ar termin estim tabl power weight breakdown ar termin tion organ softwar modul control mode hardwar devic deliv requir perform lowest cost case oper system transpar exploit case applic softwar chang requir explicitli control hardwar reduc energi consumpt accept level linux schedul modifi adjust processor clock speed automat match workload applic decid switch imag batteri run low applic posit render video captur wireless link entertain video commun guidanc inform retriev tabl applic classif feasibl integr compon present previou section requir major engin effort board design built host intellig softwar port develop effort justifi ar termin meet initi requir state section termin wearabl tabl summar data present breakdown term weight power dissip note power dissip number report peak compon dissip mode lower ar termin weigh kg dissip breakdown consid bare roughli add glue logic yield total kg batteri termin oper hour power breakdown show render modul correspond total case wireless connect assum radio activ time account highest contribut wavelan applic scenario oper termin peak load hour ar applic rare compon mode exploit extend batteri life identifi opportun mode number applic scenario scenario entertain ar potenti interact game environ type applic stress render modul posit system video commun wireless connect handl full motion video class applic remot wearabl remot inspect made ar termin applic stress wireless connect video captur modul guidanc kind rout plan softwar interact travel guid spot applic ar type inform yellow access ar termin intellig ad user conveni result applic remembr agent tabl classifi scenario list util modul termin difficult quantifi effect usag applic rare termin resourc observ extend oper time termin hour identifi requir augment realiti termin base initi experi demonstr develop system structur hardwar architectur termin flexibl architectur built central interconnect intellig modul imag video wireless commun programm modul capabl make intellig power devic control select compon modul driven implement reason weight ar termin base compon power breakdown termin show feasibl weight kg power dissip current batteri technolog mean termin oper realist applic load effici exploit mode estim termin oper long figur basic board statu futur work member determin realiz termin base paper plan built technolog develop relat mobil multimedia commun project delft basic processor mb mb bu connector figur built test board small equip extens board interact specif hardwar devic interconnect combin simpl processor board extens board advantag hardwar incorpor easili design extens board author concentr aspect softwar layer complet ar oper system applic acknowledg van dick kee van henk anonym review valuabl feed back design issu address paper refer displai survei ieee standard ubiquit commun program delft jan design wearabl oct embrac energi effici handheld multimedia comput kortuem issu design collabor wearabl comput ieee virtual realiti annual intern advanc wireless termin ieee person feb mann smart wearabl comput person mar van der jansen accur overlai mobil augment realiti comput rhode wearabl remembr system augment memori person special issu wearabl livingston superior registr integr landmark track magnet track siggraph page aug katz vertic handoff wireless overlai network acm mobil network special issu mobil network summer multimedia portabl devic wireless inform access ieee transact oct weiser comput scienc issu ubiquit comput commun juli
ML/368 6 vision applic autonom indoor navig chen dissert submit michigan state partial fulfil requir doctor philosophi depart comput scienc engin abstract vision applic autonom indoor navig chen adapt critic autonom navig mobil robot adapt mechan rang simpl color threshold complic learn artifici neural network major focu thesi li machin learn navig navig system robin develop feedforward neural network robin reli radial basi function network current method achiev great success major local minimum train perceptron radial basi function network stuck poor local minimum flexibl system train road hard make system adapt road condit retain good perform road condit learn term problem part hierarch optim subspac learn infer treat navig retriev problem major compon automat featur start random initi system emploi principl compon analysi linear discrimin deriv featur suit navig task nonparametr partit flexibl global parametr regress emploi direct map nonparametr partit regress realiz partit tree mechan low comput partit tree logarithm retriev complex address complex issu learn larg number scene binari domin eigenvector principl compon analysi linear discrimin analysi partit node lead effici onlin increment learn system learn reject learn sampl real time similar basic map retin input output steer signal system successfulli test exhibit limit capabl handl complic situat number turn corner system fail make turn tackl problem incorpor state rel posit robot corner system system incorpor state util simpl effici visual attent mechan determin correct state test set fewer learn successfulli test indoor navig floor engin build sun onlin increment learn autonom navig compar studi method shown advantag faster learn perform task test acknowledg indebt professor john thesi topic sourc idea phd program michigan state dissert complet grate professor georg jim serv provid critic comment dissert acknowledg special dr jain dr advic research topic enjoi discuss current member work dan hwang receiv numer nice lab lisa han salli paul jason built mobil robot rome test express special gratitud han provid program robot control benefit discuss present member paul iv yao scott nicola qian lin daniel due marilyn bin yu zhong ow special advisor prof lin guidanc close relat dissert topic sincer express gratitud parent love encourag life wife join support understand tabl content list figur ix list tabl xiv introduct review mobil robot vision road techniqu edg detect region analysi road percept approach approach major difficulti autonom navig adapt learn direct map differ neural network approach mobil robot rome thesi overview autonom navig introduct exist system motiv learn effici function approxim imag space function imag space learn approxim process learn function approxim hierarch partit approxim automat featur deriv imag imag space express featur discrimin featur project separ gener learn vi data organ binari partit tree construct construct mdf learn phase perform phase differ neural network approach complex complex learn phase complex perform phase result imag acquisit mdf cluster effect cluster children effect tree size retriev real run comparison approach simul feedforward neural network simul radial basi function network comparison approach map ann architectur futur work increment learn navig introduct increment learn domin eigenvector comput navig retriev problem power method quotient conjug gradient method updat increment learn insert sampl reconstruct matrix parent node matrix increment method increment learn algorithm analysi result indoor navig introduct state markov model stochast partit tree nearest neighbor regress navig retriev problem case indoor navig result vii comparison approach simul feedforward neural network simul radial basi function network comparison approach futur work summari contribut futur work map test site set train sampl viii list figur differ tradit approach direct map tradit direct function directli map input imag output steer signal schemat differ current neural network approach navig direct map neural network pictur rome lab singl ccd camera mount top robot tilt angl navig map imag path select space control signal space illustr hierarch dirichlet partit partit tree label center cell label child parent center belong shown due lack space partit tree illustr express featur valu project valu ax illustr discrimin featur mdf project separ subclass geometr illustr binari geometr cell thicker line boundari cell line boundari cell learn perform phase schemat differ current neural network approach navig direct map neural network approxim map visual input output control signal base local neighborhood input imag sphere repres input space denot sampl visual input output input base interpol output nearest neighbor mark solid dot pattern sampl learn imag straight corridor corner upper row straight corridor lower left turn ix differ mdf repres learn sampl straight corridor corner learn set mdf learn set learn sampl repres subspac span learn sampl repres subspac span mdf number plot space class label learn sampl test imag subspac span includ learn set subspac mdf subspac fewer class learn straight corridor imag train learn sampl repres subspac span learn sampl repres subspac span mdf number plot space class label learn sampl test imag repres subspac learn learn set corridor imag corner subspac mdf subspac distribut absolut angular error retriev head direct plot base queri test set straight hallwai learn corner mdf mdf exampl retriev queri retriev mdf retriev sampl autonom navig train straight corridor corner circl locat imag rome navig automat corner row corner row sampl train top part row output gaussian distribut peak correct head direct sampl imag gener locat orient simul navig path imag gener perspect project camera model train set trial random guess initi weight show record sum squar error trial minim mark circl show target output class train sampl correct ffi ffi ffi ffi ffi error histogram retriev head show network output overlaid target output simul output target output plot solid line dot line train record set sum squar error trial solut mark circl comparison feedforward network rbf network obtain set imag train disjoint set imag test error histogram train set shown left column error histogram test set shown column evolut increment learn tree node macro tree evolv fix node updat imag accept search path repres dash line updat macro node search path leaf micro node mark sampl train hallwai imag upper row straight lower left turn time record learn set imag imag increment learn record distribut absolut angular error retriev head direct plot base queri test set straight hallwai learn corner map test train section untrain section mark thicker line rome navig automat turn row turn row time record learn set imag state show imag corner white box attent window attent imag shown show correl imag pad peripheri resiz spatial resolut architectur vision guid navig stand type corridor structur indoor navig markov model indoor repres state action local attent view singl global view arc current local view global view input output part map test site test loop thick solid line corner intersect train test mark arab number xi sampl train imag corner intersect set consecut imag corner intersect test loop sampl state transit cover pass continu run test loop corner label digit plot sampl control signal state control signal plot set figur correct head direct case left turn turn left turn straight section corner chang correct head straight section smaller sampl trajectori corner show state robot navig show failur case state upcom wall show robot successfulli made turn state rome navig autonom corner imag video sequenc robot imag front robot mobil robot view sequenc corner real navig imag time step sequenc show robot approach successfulli made turn enter straight section time record increment learn set train imag learn time record sampl train top part imag row output gaussian distribut peak correct head direct row binari state field field train set trial random guess initi weight show record sum squar error trial minim mark circl show target output class train sampl correct ffi ffi ffi ffi ffi error histogram retriev head direct show network output overlaid target output simul output target output plot solid line dot line train set initi weight network output train imag plot solid desir target output plot dash line comparison comparison perceptron principl compon analysi linear discrimin analysi perceptron initi principl compon regress approach text xii comparison feedforward network rbf network obtain error histogram train set shown left column error histogram test set shown column xiii list tabl comparison thesi work navig algorithm size mdf tree train set imag total learn time set imag time retriev train input comparison retriev time tree version flat tree structur set learn imag train size learn set accept imag comparison approach state predict comparison approach time qualit comparison approach notat local input number hidden node number center number learn sampl abbrevi parametr correct memori summari state transit train stand previou state xiv chapter introduct goal thesi develop learn techniqu facilit train mobil robot autonom indoor navig practic learn algorithm meet increment good perform issu address dissert mobil robot system provid uniqu opportun develop percept navig techniqu environ order perceiv extern mobil robot kind includ color scan laser stereo inerti collect inform higher level process integr sensori priori map road direct vehicl action review mobil robot vision visual input import sensori sourc human driver thompson moravec pioneer exploit role machin vision autonom navig jpl robot visual input form polygon terrain model path construct stanford cart emploi moravec interest oper pick distinct featur imag inform featur obtain stereo algorithm hierarch correl successfulli navig clutter environ sidewalk al stereo vision system base match vertic edg infer surfac earli mobil robot limit vision system launch autonom land vehicl project fund advanc research project led numer research activ includ motion track univ massachusett track data qualit navig advanc system built cmu built cmu group concentr difficult vision problem realist environ produc practic algorithm mobil robot vision research project summar book format techniqu develop autonom navig appli strateg civilian improv safeti human driver significantli lower number traffic accid darpa past decad wit mobil robot project good survei found thorp al unit gener motor work corpor built system base color threshold japan develop prototyp softwar group led work autonom navig number year road techniqu basic task obstacl avoid mobil robot travel road area avoid obstacl task separ techniqu task vari practic sensor input task direct rang measur sonar infrar sensor obstacl avoid sonar infrar sensor outdoor road reflect surfac gener outdoor environ obtain signal reliabl rich visual inform road obstacl avoid sonar infrar sensori input low dimens handl obstacl avoid system make sonar infrar sensor road algorithm broadli classifi edg detect input imag road region statist pattern recognit appli road cluster road road stereo algorithm obtain depth inform edg region road percept laser ann map detect featur qualit output directli map visual input output steer feedback track object model model optim control vehicl approach good coupl optim control machin vision edg detect edg detect commonli earli mobil robot navig system predecessor detect road edg find central line path gener assumpt road li ground plane road edg parallel hough transform line fit process find path perspect map input imag view view direct view gener call view road line path ground plane parallel simplifi optic flow obstacl road commonli navig system problem type road techniqu detect edg outdoor strongest edg real road edg weaker detect situat indoor navig true path edg detect due ambient light distract background real road edg necessarili fit parallel line model assumpt line fit appli road edg due edg detect suit structur road lane mark stripe overcom limit singl line featur track algorithm explicitli model constraint featur structur road advantag prior knowledg environ featur featur track algorithm design featur track method current featur track fail algorithm account gener edg detect achiev perform avail lane mark greatli enhanc adapt perform drive system ralph good ralph road curvatur highest signatur score pick winner techniqu lead success posit handler region analysi altern edg detect region analysi road scene classifi road region type algorithm reli heavili approach geometr road model textur classifi pixel road rich inform chromat color wide outdoor navig color video navig includ project imag pixel color space simpl adapt threshold robust method thorp appli statist pattern recognit techniqu road scene segment cluster appli road classifi pixel road class repres gaussian vector covari matrix obtain learn process classifi maxim likelihood classifi imag pixel achiev perform vote scheme hough transform obtain road model cluster appli road make spatial color tupl rgb compon color spatial locat pixel algorithm cluster pixel nearbi locat similar color class cluster algorithm model chosen set candid road model base global match road edg detect region analysi algorithm suit unstructur road map cmu warp machin architectur due iter natur learn slower road stereo depth inform navig measur reduc comput hierarch match match featur point detect edg stanford cart moravec interest oper pick set featur track correl frame obtain depth inform algorithm hour navig meter system hierarch correl point chosen interest oper stereo base match edg commonli indoor outdoor navig stereo algorithm constraint obtain depth major constraint applic navig percept rang reliabl obtain directli navig contrast rang measur laser scanner provid depth map rang project research institut measur phase shift laser laser scanner advantag tradit vision techniqu stereo insensit ambient illumin major disadvantag acquisit rate limit navig typic acquisit rate frame percept place road navig laser scanner build terrain map navig approach artifici neural network successfulli appli engin applic ann found role navig effort perceptron develop meng kak purdu indoor navig system coupl neural network base modul semant base plan hough transform detect edg intens imag result fed neural network produc qualit output indic rel posit landmark output directli fed planner higher level plan system land vehicl neural develop group feedforward artifici neural network train backpropag learn algorithm system map input imag output steer signal autonom navig explicitli type imag featur system base neural network approach simpl navig perform achiev successfulli test varieti road situat extens includ network autonom combin network vehicl move smoothli type road elvi method altern artifici neural network altern successfulli robin develop univ maryland extend martin radial basi function neural network map input imag output steer signal regular robin achiev smoother behavior shown map major compon neural autonom simul studi report approach navig essenti control problem visual sensori feedback ideal method perfect coupl optim control machin vision techniqu work seamlessli coupl optim control comput vision navig great effort group kalman filter feedback control detect visual featur observ intern set model object object tempor inform approach term approach object incorpor gener model object background knowledg rang subclass visual code distribut object center aspect condit approach track set featur driven measur error predict featur measur feedback control vehicl approach emploi extend kalman filter estim intern state nonlinear system model linear nomin trajectori comput engin state updat cycl shorter shorter linear model true nonlinear system group explor approach earli demonstr shown potenti inerti system ad power comput engin pentium remark perform demonstr success approach li effici inform visual input seamless coupl optim control featur track achiev effici navig advantag structur road limit system applic major difficulti autonom navig discuss advanc made autonom navig face major difficulti major difficulti li deal road type exist approach autonom navig typic restrict good clear lane absenc continu road requir necessarili case desir seek method gener applic wide rang scene encount drive condit major difficulti li illumin light condit challeng current navig true indoor outdoor outdoor road edg due poor edg shadow object fool system outdoor variat illumin night time dai time dai sunni dai requir dynam rang achiev current visual sensor major difficulti li lack effici gener requir mean system learn huge number hundr million exist autonom navig system limit type applic virtual restrict scene type capabl learn scene problem major lack capabl handl larg number scene type major includ local minima problem artifici neural slow learn problem possibl learn adapt learn direct map amount road condit variat crucial factor determin applic system handl varieti navig system emploi adapt mechan navig pave lane mark illumin easili simpl adapt color threshold input imag steer signal input imag steer signal line fit vote road boundari edg detect region analysi figur differ tradit approach direct map tradit direct function directli map input imag output steer signal situat unstructur road unmark lane sudden illumin sun occlud shadow cast nearbi design reliabl autonom navig system great challeng mention earlier group develop adapt mechan outdoor drive environ robin directli map preprocess input imag output steer signal autonom navig direct map tradit approach schemat differ direct map tradit method shown fig edg region extract subsequ imag process step obtain inform requir vehicl steer extract edg region suffici make autonom navig direct map preprocess imag input richer inform edg map region segment bypass intermedi step process edg map segment region higher level inform navig map treat global optim process properli direct map expect achiev reliabl effici differ neural network approach work present navig part hierarch optim subspac learn infer framework navig system motiv ffl automat featur deriv minim restrict type scene system handl framework automat deriv express featur discrimin featur maxim classif power inform input data method potenti applic wide varieti condit ffl nonparametr partit regress nonparametr partit flexibl global parametr regress direct map nonparametr partit regress realiz partit tree ffl mechan approach mechan map input imag vehicl control signal ffl low comput complex partit tree logarithm retriev complex address complex issu learn larg number scene due low system rome capabl realtim navig comput perform sun special imag process hardwar frame grabber schemat differ current neural network approach shown fig current neural network approach explicit function directli map visual input output signal repres linear nonlinear function linear nonlinear combin layer neuron adjust paramet weight layer feedforward width center layer weight layer rbf network input retriev nearest neighbor learn sampl output sampl interpol obtain actual output notic task decomposit visual input direct map interpol base nearest neighbor retriev ik ik figur schemat differ current neural network approach navig direct map neural network output weight distanc current input interpol process desir output direct map fig regard global approxim minim global sum squar error target output simul network output regard approxim map base learn sampl approxim achiev ad learn sampl space requir store sampl local adapt nonparametr flexibl global parametr regress partit good tradeoff speed perform project pursuit regress adapt algorithm function high comput complex friedman excel discuss subject mobil robot rome mobil rome mobil built student steve jon han major hardwar compon consist sun enhanc serial port laptop termin wheel locomot control send command serial port ultrason sensor infrar sensor circular pattern control serial port proxim subsystem maximum detect rang ultrason sensor infrar sensor return binari number detect object rang cm ccd color camera sun imag grabber mount camera walsh develop navig scheme symbol landmark map appli classif techniqu local mobil robot control architectur robot navig figur pictur rome lab singl ccd camera mount top robot tilt angl setup rome serv testb experi present thesi pictur rome lab shown fig rome upgrad power version major upgrad host comput replac mhz comput flexibl unit direct percept thesi overview thesi author develop machin learn techniqu appli navig mobil robot chapter applic navig navig problem treat retriev problem newli grab imag retriev partit tree train sampl drive robot joystick control retriev output control signal imag steer signal chapter learn scheme increment train rome obtain satisfactori perform complex increment learn low experi conduct verifi perform algorithm system develop descript perform increment learn frame inform pomerleau feedforward perceptron back propag learn elvi hancock thorp method concaten input imag output signal treat singl long vector robin rosenblum davi radial basi function neural network weng chen retriev partit tree input imag repres long vector weng chen enhanc state inform simpl visual attent tabl comparison thesi work navig algorithm deal scene type improv system state inform simpl visual attent mechan incorpor chapter comparison learn mechan navig repres mobil robot vision system directli map input imag output control signal shown tabl algorithm dissert wide test indoor possibl appli outdoor navig chapter summari work dissert futur research direct discuss chapter autonom navig earliest version navig introduct central part autonom navig system navig accept input imag intent signal path navig output control signal vector control vehicl fig schemat illustr view navig denot function map element space element space challeng task autonom navig construct automat system approxim complic navig control signal imag path select figur navig map imag path select space control signal space function comput quickli real time exist system function typic extrem imag space common address problem design rule base type imag collect system develop implement rule outdoor road follow human design rule follow road edg wallac al thorp al hebert indoor corridor follow reli floor ceil edg meng kak autonom navig system intens imag reli type predefin road lane floor amount road condit variat crucial factor determin applic system handl varieti environ navig system emploi adapt mechan navig pave lane mark illumin easili simpl adapt color threshold situat unstructur road unmark lane den illumin sun occlud shadow cast nearbi design reliabl autonom navig system great challeng investig develop adapt mechan outdoor drive environ design handl road adapt color classif deal structur road explicitli model constraint singl techniqu road detect fail structur road exist system predefin type featur system greater system specif featur feedforward artifici neural network train learn map input imag output steer signal autonom navig explicitli type imag geometr featur system base successfulli test varieti road situat altern neural network approach robin develop univ maryland extend martin corpor robin radial basi function neural network map input imag output steer signal regular robin achiev smoother behavior report motiv work present navig part hierarch optim subspac learn infer framework navig system motiv ffl automat featur deriv minim restrict type scene system handl framework automat deriv express featur discrimin featur maxim classif inform input data method potenti applic wide varieti condit ffl mechan approach mechan map input imag vehicl control signal ffl low comput complex address complex issu learn larg number tree logarithm retriev complex due low system rome capabl path comput perform sun special imag process hardwar frame grabber feedforward network radial basi function network deal high result perform task test start random initi guess difficult lead correct solut requir human interact select popul center radial basi network chapter organ section introduc basic concept relat result learn nearest neighbor approxim section discuss statist tool automat deriv linear featur learn sampl section explain method automat construct tree complex analyz section result report section comparison current neural network approach present section final section conclud remark learn effici function approxim imag space digit imag pixel row pixel column denot vector space set imag pixel cg written vector rc actual map posit pixel compon vector essenti fix select pixel practic imag valu finit defin point domain finit fx jx dg call hypercub order statist pixel repres covari matrix random vector pixel assembl locat highli correl origin store element matrix typic larg absolut treat imag vector notat conveni necessarili lose inform function imag space navig shown fig function defin huge space notat drop input notat simpli denot part understand control problem model function input vector output vector control vector autonom navig vector head step size classif scalar kg indic class label input classif output suffici confid measur nomin output class ith compon indic confid probabl input class categor output consid special case output problem classif control repres partial function map element domain element codomain defin space regard partial function necessarili defin entir set denot imag imag life subset learn approxim process object construct navig approxim function function error approxim measur error measur squar error ek fk df probabl distribut function defer lot part affect error measur measur error point ae subset interest problem consist input function typic highli complex map input vector repres imag current correct control paramet vector power method construct learn seri case acquir learn data construct base notat sampl point denot fx drawn real situat underli distribut close real distribut learn function approxim function approxim problem deal typic regress problem statist pattern predict featur vector fact due underli assumpt featur preselect simpl relationship exist linear regress tree tree call tree popular statist pattern recognit method work complex natur function highli number sampl smaller dimens domain function approxim paramet linear regress paramet vector linear regress tree work threshold compon give intermedi classif challeng problem learn highli nonlinear function case fundament intellig receiv attent past introduc concept task establish relat result learn set consist sequenc case investig relat space definit partit fp consist learn set partit consist consid result partit base learn set infinit consist partit dirichlet voronoi diagram special partit consist consist point closer definit learn set approxim defin partit nearest neighbor kx kx nn approxim constant constant dirichlet tessel fp consist nn approxim boundari dirichlet tessel arbitrari boundari side whichev conveni definit learn set approxim defin nearest neighbor scalar weight function approxim neighbor nn version immun learn set top nearest neighbor distanc roughli averag top neighbor weight function form ff ffl small posit number avoid denomin ff determin fast weight runner point distanc compar nearest neighbor weight factor nearest neighbor ff reason choic ff ff approach nn approxim interpol scheme includ gener radial basi function hierarch partit issu larg number sampl requir learn phase approxim function perform input nn approxim find nearest neighbor larg number record item linear search requir accept navig larg hierarch space partit scheme lead retriev complex definit hierarch partit set partit fp pm partit finer partit fp partit tree tree repres hierarch partit level repres entir space node level children partit level cell node leaf node partit cell repres leaf lowest level hierarch dirichlet tessel hierarch voronoi hierarch partit satisfi addit cell partit deeper dirichlet tessel shown fig partit cell dirichlet entir pm correspond leaf node necessarili dirichlet partit entir space typic huge hierarch partit cover space cell size area sampl larg cell figur illustr hierarch dirichlet partit partit tree label center cell label child parent center belong shown due lack space partit tree creat cover area sampl small cell creat cover size cell directli relat accuraci approxim region defin low probabl approxim roughli region high densiti approxim detail small cell approxim defer discuss construct section studi function approxim hierarch partit structur drastic reduc complex find cell pm belong search find leaf node node child node node complet tree intern node children tree level leaf node algorithm visit children number node visit search algorithm bl log complet search complex logarithm number leaf node analyz complex detail section hierarch partit fast retriev final partit pm hierarch partit dirichlet partit shown fig boundari cell level defin cell level boundari present finest partit pm typic inconsist dirichlet tessel defin sampl nn approxim directli defin hierarch partit deal problem explor competit path techniqu approxim leaf node reach definit hierarch partit fp pm integ constant competit leav input defin level children root center nearest neighbor node level competitor level level children competitor level competitor level leav level element center nearest neighbor element competitor level competit leav competitor level note competit leav necessarili nearest neighbor nearest neighbor includ competit leav node path root leaf includ competitor level larger occur definit approxim learn set replac competit leav obtain long includ interpol competit leav typic close nearest neighbor plai major role interpol nearest neighbor miss competit result interpol good competit leav approxim due interpol singl nearest neighbor competit leav import issu deriv featur determin shape size cell partit cell cover larg region function constant chang import reduc number leav gener effect small number learn sampl automat featur deriv restrict type scene vehicl improp predefin featur system defin long straight edg indoor system fail curv hall wai place long straight edg defin smooth curv edg outdoor system fail road condit poor defin edg present road edg edg tracker fail presenc occlud road edg system automat deriv featur depend type environ system learn oper imag imag space dimens imag space typic larg moder dimens rc absolut intens imag pixel bound number space imag imag robot oper environ distribut small subset huge space region shape complex function approxim smaller space object learn find repres subspac approxim actual major concern project effici repres small subspac space reduc dimens lower dimens inform data project effect discrimin discrimin analysi deriv featur gener discuss dimens reduct project reader refer excel survei huber express featur discuss imag object categori regard sampl repres random vector repres linear combin orthonorm basi orthogon matrix consist orthonorm column vector loss assum random vector redefin featur vector repres vector predict small number term object scene basi column vector covari matrix approxim prove optim vm minim squar error ffl kx unit eigenvector covari matrix largest eigenvalu comput project vector comput vm project give minimum call express featur describ sampl popul linear transform ratio squar error total varianc satisfi set learn approxim scatter matrix uu number learn smaller dimens comput eigenvalu eigenvector larg matrix uu find eigenvector eigenvalu smaller matrix fact eigenvalu uu eigenvector eigenvalu uw eigenvector uu eigenvalu project reduc imag dimens typic lot smaller fig illustr mean region sampl point distribut lower dimens figur illustr express featur valu project valu ax origin space eigenvector direct sampl variat reduc dimens linear featur maxim preserv euclidean norm sampl work reader refer discrimin featur system distinguish varieti road type cross straight road type coupl intent decid navig action type current head direct camera fix result scene head direct depend road extend current head requir navig classifi scene nearest neighbor type criterion suit scene euclidean distanc space necessarili perceptu distanc due effect unrel euclidean distanc view scene time larger scene origin imag space scene consid categori label sampl data discrimin analysi explain automat deriv featur categori random vector class ith class probabl vector scatter matrix scatter matrix defin sw class ig scatter matrix defin ey mixtur scatter matrix defin sm sw maxim scatter respect scatter discrimin analysi object function maxim find featur scatter class larg scatter class small linear featur rectangular matrix column vector linearli independ map repres linear project space space object determin matrix object function maxim object function measur scatter volum maxim ratio wg wg prove object function lead project matrix column vector eigenvector largest eigenvalu column vector call discrimin featur linear featur maxim ratio rank featur contribut maximum object function figur illustr discrimin featur mdf project separ subclass fig illustr mean mdf class sampl comput separ subclass direct differ mean variat mdf catch major featur crucial classifi subclass imag categori number sampl belong ith class jth sampl ith class vector ith class grand vector sampl replac grand sampl mixtur scatter matrix replac sampl scatter sm defin sampl scatter matrix ith class scatter matrix replac sw scatter matrix replac relat sm sw hold sampl scatter matric stabl solut eigenvector eigenvalu obtain simultan diagon project discrimin analysi procedur break scatter matrix sw true dimens input imag larger number learn sampl discrimin analysi perform space project degeneraci typic occur discrimin project project discrimin project project space project project mdf space defin project discrimin space space determin dimens sw sampl maximum rank sw order make sw input space mdf project size sw larger mean discard largest eigenvalu eigenvalu typic extrem eigenvalu smallest nonzero eigenvalu discard import classif smaller number class larger chosen integ satisfi variat criterion separ featur discuss linear featur linear project consid deriv featur linear featur possess optim properti discuss fast comput import question separ linear featur separ region arbitrari shape space section final partit hierarch partit finest partit pm intermedi partit speed search linear featur impli cell partit pm bound hyperplan fig linear approxim virtual region desir accuraci cover show nn estim gener mild continu uncondit risk nn estim bound bayesian risk sampl size approach infin fine hierarch partit scheme tessel base finest linear featur suffici solv virtual smooth nonlinear problem unlik feedforward neural network train type iter minim method success class partit suffici number sampl mdf make partit accomplish fewer hyperplan gener gener learn data organ automat organ visual data find cluster sampl data search cluster assign child cell correspond child hierarch cluster structur data explor hierarch tree construct algorithm cluster analysi time consum due iter complex suit learn huge number sampl object approach learn complex close learn set size hope lower complex item examin learn partit sampl smaller smaller worri cell correspond cluster interest find match sampl cluster major concern partit tree exist featur deriv base actual sampl node receiv learn phase node level level set task node figur geometr illustr binari geometr cell thicker line boundari cell line boundari cell binari partit tree speed tree search central issu project input product vector rang imag chose adopt advantag minimum comput simplic implement node singl featur featur intern sampl featur threshold break sampl left child result binari shown fig context organ sampl wai select featur node assign sampl child node fu iter method classifi blood cell sethi maxim amount averag mutual inform gain partit step chou emploi criterion inform diverg project automat deriv linear featur node applic sampl label featur class label mdf construct set learn sampl object automat construct root tree accept entir set learn sampl node comput featur vector sampl neg left child remain process perform root node children termin node sampl power method comput domin eigenvector number sampl dimens input sampl time complex comput domin eigenvector project input sampl featur total complex number learn sampl comput featur time consum level node correspond larg cell sampl finer level node level sampl comput exact partit level rough adopt constant maximum number sampl comput level number sampl node exce subset sampl randomli select comput wast remain sampl sampl node assign children fine number sampl assign node small number sampl node larger sampl comput pseudo code algorithm construct construct call node comput averag construct mdf mdf mdf class label requir sampl learn set type label label hierarch label hierarch label form class label level hierarch label intend direct group sampl desir hierarch label level label corridor tree group sampl corridor imag corner imag subdivid sampl finer class label special case hierarch label construct algorithm mdf similar major differ comput mdf label set label learn sampl form label sampl label label intend level node level number larger deepest level sampl termin node node sampl singl label form pseudo code algorithm mdf construct label construct mdf call deepest label node comput label averag assign left varianc sampl class select threshold boundari cut cluster boundari perfect classif due natur partit fast algorithm import number sampl imag larg learn phase perform phase result learn phase illustr fig leaf learn imag control signal vector perform approxim leaf node leav depend queri input learn phase learn sampl acquisit builder imag control signal perform phase imag acquisit imag retriev interpol control signal figur learn perform phase connect leav interpol part part tree store gener regard visual inform entir input retriev differ neural network approach schemat differ current neural network approach shown fig current neural network approach explicit function directli map visual input output signal repres linear nonlinear function linear nonlinear combin layer neuron adjust paramet weight direct map interpol base nearest neighbor retriev ik ik figur schemat differ current neural network approach navig direct map neural network layer feedforward width center layer weight layer rbf network input retriev nearest neighbor learn sampl output sampl interpol obtain actual output notic task visual input output weight distanc current input interpol process desir output direct map fig regard global approxim minim global sum squar error target output simul network output regard approxim map base learn shown fig approxim achiev ad learn sampl space requir store sampl notic simultan work hancock thorp appli method outdoor navig elvi system elvi figur approxim map visual input output control signal base local neighborhood input imag sphere repres input space denot sampl visual input output input base interpol output nearest neighbor mark solid dot pattern global parametr regress method train sampl pair input imag output gaussian distribut peak desir treat monolith vector coordin eigenspac weight gener output output part eigenvector method nonparametr method local interpol approxim function global parametr method complex detail complex analysi analysi mdf node mdf project emploi complex learn phase time complex comput featur sampl dimens set learn imag dimens typic low resolut imag suffici larg number learn sampl averag depth time complex learn algorithm log number learn imag node level complex log time complex log number learn sampl low learn complex due fact method avoid iter analysi input make extend method futur increment time requir learn singl sampl time space complex number node binari tree number leav child node store domin eigenvector space complex learn phase complex perform phase time complex averag depth binari tree queri input imag project node search complex retriev match imag log low time complex system fast larg intern node learn domin eigenvector space complex perform phase result experi includ perform evalu real run mobil robot built platform imag acquisit test site navig experi insid engin build msu area consist corridor turn rome control manual pictur posit learn set imag head direct left head head direct correct head direct record straight set pictur roughli meter learn imag sampl drive control manual figur sampl learn imag straight corridor corner upper row straight corridor lower left turn ing joystick correct head direct obtain consecut head increment pictur turn grab shorter meter frequent head updat turn sampl learn imag shown fig mdf cluster effect show result quantit mdf perform differ classifi scene comput imag straight corridor imag group class class straight corridor classifi head direct recov correct head class ffi class ffi class ffi class ffi class ffi class consist imag corner fig show record larg area contrast mdf record locat edg spatial resolut fig show learn sampl subspac span figur differ mdf repres learn sampl straight corridor corner learn set mdf learn set learn sampl repres subspac span learn sampl repres subspac span mdf number plot space class label learn sampl figur test imag subspac span includ learn set subspac mdf subspac fig show mdf sampl singl class spread wide sampl class tend mix mdf sampl class cluster tightli sampl class farther fig classifi unknown imag environ nearest neighbor space good mdf space observ perform repres imag includ learn sampl plot set straight train corner untrain fig fig structur class cluster visibl mdf tight case fig figur fewer class learn straight corridor imag train learn sampl repres subspac span learn sampl repres subspac span mdf number plot space class label learn sampl cluster children children node divid sampl imag handl parent node smaller group group smaller number gener fewer class mdf effect cluster comput mdf set straight corridor imag set corner imag mdf comput straight corridor learn imag shown fig mdf compar fig fig class fig group tighter class distanc larger fig straight corridor imag learn set plot subspac corridor imag learn set test imag group tightli fig figur test imag repres subspac learn learn set corridor imag corner subspac mdf subspac effect tree size comparison type tree experi mdf featur mdf featur pure perform shown previou mdf root level classifi scene corridor classif tabl show distribut node level mdf tree tree learn straight corridor corner mdf tree total leaf tree total leaf node mdf tree typic smaller hyperplan repres mdf effect cut boundari class mdf tree tree level number node level number node total total tabl size mdf tree train set imag angular error distribut angular error distribut angular error distribut figur distribut absolut angular error retriev head direct plot base queri test set straight hallwai learn corner mdf mdf retriev larg number test imag learn conduct fig show error distribut retriev head direct set test tree train disjoint set straight hallwai corner compar fig fig error retriev mdf tree figur exampl retriev queri retriev mdf retriev bin impli gener power give intuit kind imag retriev retriev result shown fig real run real chosen control signal correct head speed step size imag retriev program search match leaf store control signal control robot set train rome learn drive learn imag straight corridor corner imag size mdf project rescal origin size smooth reduc effect input total comput time learn phase rang shown workstat time tabl total learn time set imag workstat averag time retriev tabl time retriev train input tabl depend sun workstat learn navig walk time straight corridor corner corridor drive success mdf version implement rome test demonstr mdf version exhibit consist direct histori version test peopl walk rome bother recogn entir scene type landmark road tabl show time retriev train fast navig experi mdf faster fig show trajectori sampl navig fig show imag illustr environ test scalabl perform collect larg set point start women men figur sampl autonom navig train straight corridor corner circl locat imag figur rome navig automat corner row corner row retriev tree flat version space imag space time time ratio wrt tree version tabl comparison retriev time tree version flat tree structur set learn imag train imag corridor section train time data comparison tree version flat version nearest neighbor found space comput time data shown tabl clear tree greatli speed retriev speed achiev tree version comparison approach artifici neural network success engin includ navig robin develop cmu univ maryland system map visual input directli output control signal feedforward network robin rbf network compar method matlab simul output scheme output pattern train sampl gaussian distribut peak desir correct head output layer node resolut figur sampl train top part row output gaussian distribut peak correct head direct output node correspond correct head sampl train pair shown fig neural network simul output head peak gaussian fit output neuron output layer set data set real imag straight hallwai set imag correct head ffi ffi ffi ffi ffi class sampl set full set real imag set imag train navig includ imag straight hallwai section imag corner section set data trajectori sampl imag gener orient translat squar typic set consist synthet imag ffi ffi ffi ffi ffi sampl imag shown fig road map dark area white area road sampl imag figur sampl imag gener locat orient simul navig path imag gener perspect project camera model set imag test learn approach situat simul feedforward neural network simul feedforward neural adapt learn rate matlab neural network toolbox similar hidden node simul size problem number imag small size imag train feedforward network found reason solut trial start initi random guess found input dimens neural network converg reason solut random initi weight run matlab script file time random guess initi weight train epoch set larg converg local minimum fig show train record set hidden node fig show weight converg good solut train trial provid solut small error shown fig simul synthet imag set consist learn process easili stuck poor local minimum fig show trial train record set error histogram solut mark circl fig shown left column fig converg reason solut difficult train set epoch random initi guess minut sun reason typic epoch minut batch train set epoch random trial shown fig dai cpu time simul radial basi function network implement robin typic rbf network normal recept field normal unit sum neuron layer normal improv interpol shown refer site center select rosenblum davi cluster algorithm center sum squar error trial sum squar error trial node output layer absolut error frequenc target output error histogram node output layer output node output layer output class output class node output layer node output layer node output layer output class output class output class figur train set trial random guess initi weight show record sum squar error trial minim mark circl show target output class train sampl correct ffi ffi ffi ffi ffi error histogram retriev head show network output overlaid target output simul output target output plot solid line dot line sum squar error trial figur train record set sum squar error trial solut mark circl select result satisfactori manual assign subset input pattern center center select process tediou interact simul rbf manual select subset typic view train set set set error head direct train set center chosen set similar number center center manual select robin center train rbf network imag set test set imag fig trial manual center error histogram train test set reason select center shown fig manual center train set minut comparison approach realist imag set set train disjoint set data set fig test error histogram plot fig approach perfect retriev train error histogram concentr singl bin error compar fig fig feedforward neural network rbf network obtain compat error perform head test rbf network bit train set train test head accuraci experi advantag good perform train feedforward network give reason random trial initi weight rbf network provid compar perform manual center select tediou dont center suffici train sampl rbf network act nearest neighbor estim comput complex prohibit number train sampl larg pai extra cost store train sampl memori size tree byte set payoff extra storag enabl reach good perform accuraci speed train fast map ann architectur learn algorithm easili map neural network architectur domin eigenvector binari partit node comput neural learn algorithm refer tree structur map neural network architectur binari tree split leav network hidden layer node comput split layer node path leaf output node path output layer leav similar desir output futur work framework present restrict scene type potenti applic scene reli scene automat deriv spatial global featur insensit local small scene road edg occlud object presenc mdf version gener version tighter class cluster smaller tree size due avail larg hard disk fast logarithm retriev made store absolut error absolut error absolut error absolut error distribut feedforward network absolut error absolut error distribut rbf network figur comparison feedforward network rbf network obtain set imag train disjoint set imag test error histogram train set shown left column error histogram test set shown column larg number learn imag unreason method present attract situat consist floor edg avoid futur work includ experi wider varieti drive environ approach requir number imag real time increment learn futur direct line research chapter increment learn navig chapter batch method train navig discuss chapter increment learn issu address binari requir domin eigenvector node finer turn learn mechan discuss chapter increment low comput complex introduct autonom navig challeng task autonom navig system reli track specif lane mark outdoor floor ceil edg detect road region base featur color textur system strong relianc priori model road rule implement model fit algorithm model rule suit due condit road clear lane variat illumin road condit invalid underli assumpt vision algorithm order deal system emploi adapt mechan design goal work adapt mechan vari simpl adapt color threshold complex machin learn artifici neural network outdoor artifici neural network train train learn characterist featur road current condit successfulli test varieti road condit elvi method altern artifici neural network avail lane mark greatli enhanc adapt perform drive shown ralph road curvatur correct highest signatur score pick winner techniqu lead success posit handler explor increment learn issu framework increment learn natur human gain drive experi increment train import machin learn autonom total inform train huge highli exce limit physic storag devic batch train method practic effici train artifici neural network increment learn updat comput neural network iter set imag hard implement learn real essenti domain autonom drive increment learn algorithm learn tree structur present comput method reduc maxim critic learn remaind chapter organ section describ effici domin eigenvector comput increment learn section present realiz increment updat section increment learn algorithm result report section section increment learn domin eigenvector comput briefli describ autonom navig scheme framework navig retriev problem navig regard complic function map input imag output control signal learn set train imag build partit tree learn imag control signal node method extract characterist featur partit input imag space process tree current node imag similar control signal perform newli grab imag retriev imag train control signal retriev imag steer control signal notic elvi method outdoor navig elvi input imag output vector treat long monolith vector treat input imag output steer vector deal increment learn elvi chose binari partit simplic space partit base imag project singl eigenvector largest captur largest varianc sampl imag assign node obtain eigenvector largest eigenvalu lead effici increment learn algorithm increment eigenspac updat algorithm discuss increment updat eigenspac qr decomposit discuss classic textbook golub van loan discuss focu increment updat solv eigenvector largest simpler effici method power lanczo quotient conjug gradient method popular wai comput domin real symmetr matrix power method power method oldest method solv matrix ae order arbitrari vector sequenc defin equat au kxk denot norm write ff normal written ff ff provid ff number eigenvector domin procedur ff ff ff iter tend converg vector ly subspac span eigenvector ratio close converg slow iter tend vector term squar bracket equat regard weight sum eigenvector coeffici ff ff ff contribut eigenvector shrink factor power method iter domin eigenvector contribut random vector chosen ff due truncat error fix number iter give satisfactori result number iter time complex power method quotient conjug gradient method real symmetr matrix order eigenvalu eigenvector max max kxk denot product defin norm vector kxk call quotient eq clear domin eigenvector vector maxim quotient nice properti quotient critic point unstabl saddl point global maximum practic solv maxim problem conjug gradient method gradient quotient approxim improv approxim comput ffi search direct found conjug gradient fi ffi chosen solv max ffi ffi solut ffi ap ap ap ax ap ax fi comput wai practic choic fi initi domin eigenvector randomli chosen unit sphere method iter iter time iter loop number time chang small method typic converg faster power method number iter time complex method power method method easi complex fix maxim iter denot iter number power method candid comput domin real symmetr matrix power method lanczo algorithm write numer stabl lanczo algorithm highli nontrivi updat increment learn fu kg set imag vector covari matrix assum repres vector length number imag typic smaller number pixel easili shown eigenvector covari matrix eigenvector eigenvalu comput matrix calcul smaller matrix insert sampl vector updat updat kw updat rule insert sampl time complex applic typic ae time complex insert delet sampl reconstruct matrix parent node matrix node child node sampl fu ng vector ps sampl child node vector ij ij ij ij bn ij ij denot matric element ij ij ij ij bn combin ij express ij ij bn comput reconstruct time increment method start random initi guess domin method increment estim domin eigenvector gener good initi domin eigenvector iter time reduc significantli ri denot iter time increment method ae assum small fourth term rh case kw ignor scale differ newli append row column momentum true domin eigenvector close true domin eigenvector append compon estim domin eigenvector append initi domin eigenvector increment learn algorithm modifi tree increment learn built dynam input imag imag decid briefli micro tree fix node macro tree node macro tree figur evolut increment learn tree node macro tree evolv fix node describ increment learn detail found paramet chosen number imag node reach domin comput power method node fix subsequ learn child node creat number imag flow node larg order speed type micro introduc call macro tree easi discrimin type built project domin eigenvector decid stop grow child node number imag node node stop grow leaf node structur increment learn shown fig type node fix node macro node macro tree node micro tree number imag macro node li node domin eigenvector comput child rebuilt imag control signal check cross valid procedur decid neighbor input imag obtain retriev learn retriev control signal toler desir control input imag increment learn conduct item maintain fix number imag flow index number increment updat vector accept learn imag flow node covari domin eigenvector hierarch partit structur achiev effici retriev retriev procedur shown search input imag find control signal call node leaf linear search imag store node find nearest imag arg min ku return control signal node root micro tree figur updat imag accept search path repres dash line updat macro node search path leaf micro node mark newli accept learn updat shown fig locat macro node search insert imag increment updat leaf micro find leaf micro node search path updat fix number procedur build partit tree increment grab imag desir control signal retriev learn call retriev control signal satisfi toler back step increment locat macro node search path denot node leaf node search path node leaf node node node increment updat eq node fix comput eigenvector domin eigenvalu power rebuild child node fix node node comput eigenvector largest build child node node analysi unusu case child time complex imag number accept learn imag iter time comput domin eigenvector term time complex updat complex retriev learn complex comput eigenvector power method built ila import properti accept learn imag perfectli retriev properti accept learn imag retriev locat imag newli accept learn imag insert macro node leaf exact retriev evolut learn learn fix accept learn imag fix retriev path determin tree rebuild procedur result search path accept imag result mobil built platform sun host comput rome control pictur locat increment learn correct head direct record sampl imag increment learn shown fig test site indoor hallwai turn light condit fix test hallwai section account light night imag preprocess unit varianc notat describ version comput domin eigenvector matrix ffl version ila power method matrix child node comput ffl improv version ila method matrix child node comput ffl improv version increment method matrix child node comput initi domin eigenvector comput method reach domin eigenvector node comput increment set number chosen accept imag accept linear search maxim iter method set fig show time record learn accept imag fig time increment learn accept imag typic time learn number imag flow macro node reach reconstruct child conduct matric domin eigenvector node child requir comput figur sampl train hallwai imag upper row straight lower left turn sequenti imag number sequenti imag number time figur time record learn set imag imag increment learn record batch time improv obviou structur learn tree accept imag shown tabl learn tree includ macro node micro node order evalu system test learn tree set imag error histogram retriev head direct shown fig retriev nearest imag accept level macro node micro node node total tabl size learn set accept imag learn obtain perform explor competit path pick show error histogram linearli search match set accept learn imag fig competit path provid result absolut error distribut absolut error absolut error linear search figur distribut absolut angular error retriev head direct plot base queri test set straight hallwai learn corner test site shown fig learn hallwai section corner mark thicker line robot rome train direct real rome reject sudden chang head direct assum smooth steer behavior drive speed slow retriev imag place corner learn section section figur map test train section untrain section mark thicker line figur rome navig automat turn row turn row train rome consist perform numer experi fig show sampl sequenc imag rome navig autonom hallwai compar time version set sampl artifici assign output algorithm accept sampl paramet set fig show time data maxim time ila algorithm improv obviou improv increment method visibl improv time complex comput domin eigenvector quadrat height fig construct tree balanc peak due reconstruct number sampl reach visibl figur sequenti imag number sequenti imag number sequenti imag number time ri figur time record learn set imag author improv previou increment learn algorithm reduc maxim latenc ila algorithm successfulli appli indoor mobil robot navig increment learn real time experi method converg faster result stabl behavior outperform power method method featur deriv chapter applic linear discrimin analysi shown work indoor navig algorithm solv gener eigenvalu problem ax bx comput issu pursu scalabl improv ila version studi carefulli ila algorithm make extens vector greatli improv vector processor interpol output achiev smoother navig behavior chapter indoor navig earlier effort tree indoor navig experienc difficulti complic situat involv number corner intersect robot fail make turn system start robot realiz enter corner state inform solv ambigu problem situat notic visual attent mechan solv ambigu problem state simpl visual attent incorpor earlier introduct difficulti experienc appli complic environ learn train sampl sampl drive conflict hard solv imag problem solv state inform rel posit robot environ markov chain variant hidden markov model partial observ markov process successfulli appli indoor navig research koenig simmon appli pomdp integr topolog metric inform navig xavier xavier maintain probabl distribut current pose successfulli handl uncertainti includ actuat sensor uncertainti kind input motor report deriv sensor report gener deploi sonar sensor great gain state inform capabl visual attent disambigu global similar local scene state inform robot determin acquir local view global scene finit state machin model state navig state transit probabl directli estim due high cost estim probabl distribut visual sonar sensori probabl retriev approxim distanc train sampl vision global inform compar fewer state notic state deal unanticip event measur deal unexpect event autonom mobil robot program stop detect novelti rang show state inform natur partit tree effici disambigu attent similar virtual camera emploi author present systemat framework system state defin learn onlin deal situat stateless system visual attent requir approach teacher defin state onlin preprogram control rule static control scheme learn scheme potenti handl navig scene remaind chapter organ section show problem formul markov model realiz nearest neighbor regress nearest neighbor regress comput effici stochast partit tree shown section indoor navig discuss section section present result section compar approach futur work discuss section state markov model difficulti experienc appli map neural complic autonom learn train sampl sampl drive ambigu hard solv monolith imag fig show imag corner imag impli small euclidean distanc requir straight ahead turn left subregion mark white differ obviou correl imag attent imag sensit translat column direct depth height blob sensit robot translat column direct attent window extract part properli make easier judg stage action landmark select issu trivial incorpor mechan systemat learn write separ program scene work report framework markov model coupl capabl straight section global input imag suffici figur state show imag corner white box attent window attent imag shown show correl imag pad peripheri resiz spatial resolut visual navig attent window critic corner intersect system time local view act differ global local problem solv system state histori inform outcom random covari time present past input imag past fx defin regress function jd markov model goal estim eq markov model rewritten learn set consist tripl form total number learn sampl current previou outcom current outcom effici high nearest neighbor estim approxim function nn approxim denot nearest neighbor learn set input output train sampl nearest neighbor estim wide function nearest neighbor estim approxim markov time seri nonparametr includ kernel estim nearest neighbor predict markov time jx successfulli appli nearest neighbor estim predict time seri converg properti nearest neighbor estim jx markov time seri prove refer appli nearest neighbor estim approxim markov model markov chain variant hidden markov model partial observ markov process successfulli appli indoor navig research koenig simmon appli pomdp integr topolog metric inform navig xavier notic differ hidden markov model normal hidden markov model transit probabl doesnt depend input transit probabl markov model explicitli depend observ time step markov model nonstationari outcom state control signal mobil visual attent signal attent window observ preprocess input imag time step nearest neighbor estim equat markov outcom state rest normal map function recurr variabl architectur navig shown fig singl tree simultan nearest neighbor estim current input imag previou state deriv control signal attent signal current state real control motion mobil robot extract attent window video camera att mobil robot figur architectur vision guid navig stand stochast partit tree nearest neighbor regress challeng high typic thousand briefli describ address challeng problem navig retriev problem navig regard complic function map input output learn set train imag build partit tree learn sampl record desir pair node method extract characterist featur high input space partit input space process tree current node sampl similar output signal perform newli grab input retriev input train output signal retriev input desir output chose binari partit simplic speed space partit base project input principl compon vector pca sampl input assign captur largest varianc input obtain eigenvector largest eigenvalu lead effici increment learn algorithm learn process increment data covari matrix estim input sampl domin eigenvector estim comput power method quotient conjug gradient method domin eigenvector estim estim covari matrix prerequisit author address problem stochast approxim stochast approxim shown high accuraci requir eigenvector estim appli oja karhunen method stochast approxim domin eigenvector stochast matric finit constant oja karhunen iter repres learn rate denot vector comput domin eigenvector covari matrix set outer product sampl oja karhunen converg stochast approxim prove theorem bound symmetr matric mutual statist independ largest eigenvalu unit multipl probabl densiti bound uniformli neighborhood eigenvector largest eigenvalu increment learn sampl conduct learn domin eigenvector updat increment child updat process list list sampl list child node vector domin eigenvector child node process child node shown accept list parent node form list delet sampl updat insert sampl updat obtain list child node case indoor navig compar outdoor road indoor navig face similar challeng stabl featur floor stabl contrast pattern typic navig path indoor corridor type shown fig notat corridor left left straight corridor corner situat group exit corner intersect reduc number figur type corridor structur indoor navig state merg indoor corridor section type repres shown fig approach corner intersect repres singl ambigu state transit transit loop jump depend current visual imag previou state transit state depend current observ previou state estim nn estim visual attent local view state disambigu state case raw input imag size averag window reduc half size global left local attent window subregion raw input imag center size attent signal binari flag global view local view koenig simmon sonar sensori input observ hmm model defin state spatial grid hallwai path larg number state similar hmm directli appli figur markov model indoor repres state action local attent view singl global view arc current local view global view complex train hmm input imag higher navig task challeng visual imag relat control directli rang data visual imag number state greatli visual input richer inform system rememb inform model shown fig case shown fig imag preprocess unit binari field repres state predict current predict attent binari flag indic global view attent window output control signal current pair field mark solid box concaten form singl long vector input field preprocess raw imag input part output part figur input output part dash box predict associ quantiti collect quadrupl control signal mobil robot correct head direct train state transit markov model result mobil robot rome mobil built test algorithm train robot navig loop shown fig floor msu engin build floor plane cover area approxim squar meter type corridor structur shown fig type fig affect perform test algorithm floor engin build loop includ junction sampl train imag corner junction shown fig corner junction typic indoor navig structur width straight corridor segment navig vision environ challeng method predefin featur figur map test site test loop thick solid line corner intersect train test mark arab number figur sampl train imag corner intersect set consecut imag corner intersect test loop floor edg train sampl collect human control sampl drive input previou current state output control signal obtain input imag normal unit suppress effect absolut light bright contrast variat preprocess raw input imag previou state inform queri retriev sampl current state head sampl discard increment learn conduct train sampl collect reason set train sampl section loop test system continu learn locat present sampl rome set free rome roam speed robot slow correct head direct larger ffi robot enter state order remov spuriou state transit resort higher order markov vote scheme state histori step histogram histori state comput state transit confirm number vote current state unchang fig show sampl state transit pass test loop corner transit state confirm corner intersect state fig state sequenti time step state sequenti time step raw output state output state smooth figur sampl state transit cover pass continu run test loop corner label digit plot smooth scheme achiev stabl navig behavior sampl control signal state show fig robot turn left fig fig robot turn left corner fig observ straight robot turn smaller magnitud result smooth navig behavior stateless experienc difficulti guid robot navig test loop fail make fig show scenario plot collect sampl navig trajectori fig show failur case state fig show case robot retriev imag left turn critic turn visual posit similar imag left corner robot turn left fail make turn fig show case robot fail make corner fig show state sequenti time step control sequenti time step corner corner control sequenti time step control state sequenti time step corner corner figur sampl control signal state control signal plot set figur correct head direct case left turn turn left turn straight section corner chang correct head straight section smaller figur sampl trajectori corner show state robot navig show failur case state upcom wall show robot successfulli made turn state figur rome navig autonom corner imag video sequenc robot imag front robot robot perform state inform robot successfulli made turn state disambigu critic scenario fig show sampl run corner fig show mobil robot view sequenc real navig corner imag grab singl time step retriev pair current imag previou figur mobil robot view sequenc corner real navig imag time step sequenc show robot approach successfulli made turn enter straight section perform frequenc hz onboard sun robot increment learn conduct onboard batch train set sampl sun time record shown fig maxim time learn sampl train increment learn conduct test run observ perform stabil learn robot pass autonom navig test loop minut robot observ continu run longer hour time onboard batteri provid power low dozen test robot perform time sequenti imag number figur time record increment learn set train imag learn time record comparison approach show perform compar altern compar feedforward neural network radial basi function network separ set data comparison set data collect separ time floor engin build train set train sampl result tree lead success perform test train loop set set sampl set redund cover scenario map current head output scheme output pattern train sampl gaussian distribut peak desir correct head output layer node resolut sampl train pair shown fig neural network figur sampl train top part imag row output gaussian distribut peak correct head direct row binari state field field simul output head peak gaussian fit output neuron output layer simul feedforward neural network simul feedforward neural adapt learn rate matlab neural network toolbox similar hidden node simul simul show perceptron converg reason weight start random initi weight set data section studi behavior perceptron set real imag straight hallwai set imag correct head ffi ffi ffi ffi ffi class sampl set full set real imag set imag train navig includ imag straight hallwai section imag corner section imag collect corner straight section connect corner set data trajectori sampl imag gener orient translat squar typic set consist synthet imag ffi ffi ffi ffi ffi size problem number imag small size imag train feedforward network found reason solut trial start random initi guess found input dimens neural network converg reason solut random initi weight ran matlab script file time random guess initi weight train epoch set larg converg local minimum fig show train record set hidden node fig show weight converg good solut train trial provid solut small error shown fig simul set consist learn process easili stuck poor local minimum principl compon regress provid initi sum squar error trial sum squar error trial node output layer absolut error frequenc target output error histogram node output layer output node output layer output class output class node output layer node output layer node output layer output class output class output class figur train set trial random guess initi weight show record sum squar error trial minim mark circl show target output class train sampl correct ffi ffi ffi ffi ffi error histogram retriev head direct show network output overlaid target output simul output target output plot solid line dot line output node output layer figur train set initi weight network output train imag plot solid desir target output plot dash line comparison weight layer initi princip compon input layer initi linear regress desir output hidden layer initi mlp led converg experi shown fig set train epoch learn process converg quickli result small error notic network output initi smoother network output class form compact class weight imag perceptron shown fig set imag chapter train hidden node output node initi weight layer principl compon input shown fig final weight layer learn shown fig eigenvector linear discrimin analysi shown initi weight layer final weight layer learn eigenvector linear discrimin analysi figur comparison perceptron principl compon analysi linear discrimin analysi perceptron initi principl compon regress approach text fig clear learn similar result linear discrimin feedforward network properli initi simul radial basi function network implement robin typic rbf network normal recept field normal unit sum neuron layer normal improv interpol shown refer site center select rosenblum davi cluster algorithm center select result satisfactori manual assign subset input pattern center author comparison orthogon squar automat center select perform comparison approach set train set test error histogram plot fig approach perfect retriev train error histogram concentr singl bin error studi accuraci retriev head accuraci studi approach current imag previou state map current state map approxim map current head network mlp linear output layer perform discrimin analysi classif hidden state predict number output node number code binari pattern network node highest correspond predict state number node hidden layer rang number node hidden layer rang rbf classif similar state code absolut error frequenc absolut error absolut error frequenc absolut error feedforward network absolut error frequenc absolut error rbf network figur comparison feedforward network rbf network obtain error histogram train set shown left column error histogram test set shown column binari pattern number output node number state output node highest predict state center select orthogon squar set data train order train set test set accuraci state predict report tabl tendenc overtrain train result poor gener perform test set number epoch determin simpl check state predict accuraci train set test set number epoch lead balanc perform train test set chosen imag set shown appendix set redund set train set lead perform test disjoint set tabl clear perform mlp suit task train test mlp tabl comparison approach state predict speed approach report tabl train learn mechan set time millisecond record sun record time cpu time spend map includ time spent grab imag learn paramet load time obtain program network map mlp time ms ms ms tabl comparison approach time qualit comparison summar tabl approach suit hardwar implement major power local adapt nonparametr flexibl global parametr regress partit good tradeoff speed perform project pursuit regress adapt algorithm function high comput complex friedman excel discuss subject mlp global parametr regress minim global squar error learn mlp network perform deterior learn sampl term problem navig shown experi fewer memori loss problem memori loss problem allevi due local nonparametr regress mlp experi show problem train network make singl turn network corner thing mlp hard time navig test corner local para hierarch time space corr global compl compl conv learn mlp global trial mem loss global ol hard local full log feasibl tabl qualit comparison approach notat local input number hidden node number center number learn sampl abbrevi parametr correct memori fig experienc similar problem road condit pomerleau method arbitr individu network train specif road integr arbitr network difficult issu state inform solv problem navig explicit rule network arbitr involv experi advantag good perform train feedforward network give reason random trial initi weight random initi weight rbf network provid compar perform train sampl rbf network act nearest neighbor estim comput complex prohibit number train sampl larg pai extra cost store train sampl payoff extra storag enabl reach good perform accuraci speed train faster futur work characterist algorithm summar markov model navig state inform visual attent incorpor framework deal complex scene realiz nonparametr nearest neighbor regress stochast partit tree effici nearest neighbor estim visual data learn algorithm local nonparametr adapt exhibit flexibl global parametr regress mlp method compar navig approach sonar visual imag richer inform number state greatli reduc futur research extens test navig environ direct command make turn intersect current framework state includ inform desir turn direct feasibl framework util futur studi chapter summari dissert present visual navig scheme navig treat retriev system directli map preprocess input imag output steer signal contrast global parametr regress current nonparametr partit regress dissert nonparametr partit regress flexibl global parametr regress project pursuit regress approxim map high comput complex nonparametr partit regress dissert good tradeoff speed perform nonparametr partit regress realiz partit tree train principl compon analysi linear discrimin analysi node automat deriv featur partit autonom navig newli grab imag retriev steer control signal match learn sampl control signal system successfulli test indoor navig domin eigenvector pca lda binari increment learn scheme develop low comput complex onlin increment learn algorithm greatli facilit compar previou mode state inform navig chapter state inform incorpor term state inform simpl visual attent mechan natur incorpor system system model markov model realiz partit regress set fewer learn successfulli test floor engin build contribut major contribut dissert summar ffl nonparametr partit regress directli map preprocess input imag output steer signal navig partit regress global parametr regress robin partit regress local regress spline exhibit flexibl ffl onlin increment learn algorithm low comput complex domin eigenvector principl compon analysi linear discrimin analysi comput node fact chapter develop effici increment learn algorithm greatli train navig ffl incorpor state inform simpl visual attent mechan model markov model implement partit tree state inform system disambigu scenario similar visual steer signal autonom navig state inform visual attent provid possibl system work complic situat natur incorpor system extra arbitr layer determin featur track algorithm navig network suit train path futur work research work dissert show direct map nonparametr partit regress success indoor tion issu remain ffl obstacl avoid author concentr indoor navig natur question extend framework make robot avoid obstacl navig depth inform obstacl avoid stereo algorithm direct rang measur sonar infrar sensor obstacl avoid ffl light problem outdoor navig light major challeng outdoor navig test indoor ambient light chang simpl normal scheme rescal input imag unit varianc deal ambient light normal scheme work indoor navig deal greater variat light elabor mechan indoor black white visual imag outdoor typic color imag preprocess enhanc contrast road area robot rome design work indoor limit outdoor experi conduct rome small wheel diamet low clearanc interest algorithm perform outdoor navig similar preprocess input fed good perform expect ffl automat design state chapter state manual design author indoor navig autonom navig kind design avoid ongo effort cluster aim automat deriv state visual navig ffl visual attent simpl visual attent mechan emploi system system attent window fix attent window global view visual attent discrimin scenario similar global view local attent window requir steer signal practic autonom navig elabor visual attent mechan effort made group virtual attent window extract global scene virtual camera shown lane transit intersect navig approach natur incorpor visual attent system intern state approach includ state inform visual attent reason approach success approach reli object track space improv visual attent autonom navig appendix map test site floor engin build serv test site thesi work test loop mark blue line appendix set train sampl set train imag collect test loop shown fig ccd len includ train sampl increment train floor engin build set train sampl studi chapter train imag displai train data current head ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi state transit train set summar tabl state sum sum tabl summari state transit train stand previou state bibliographi environ mobil ieee tran robot vol pp vehicl vol juli pp parallel stereo vision system gener obstacl lane ieee tran imag vol pp bobick mit media lab perceptu comput section technic classif regress chapman proc intl joint conf artifici pp tempor kohonen neural chen grai scale transform invari textur identif wavelet decomposit hidden markov ieee tran pattern analysi machin vol pp handwritten word recognit hidden markov model type stochast ieee tran pattern anal machin vol pp squar learn algorithm radial basi function ieee tran neural vol pp chen autonom navig technic report depart comput michigan state east chen learn technic report cp depart comput michigan state chen increment learn realtim navig improv scandinavian conf imag chen indoor visual proc intl conf pattern method bend ieee symposium intellig juli pp partit classif regress ieee tran pattern anal machin vol pp mobil robot local classif master depart comput michigan state east nearest neighbor ieee transact inform jan analysi time recent statist vol pp vision road vision carnegi mellon pp hand sign recognit proc intl conf comput pp june essa gestur analysi interpol mit media lab perceptu comput section technic da cluster state approach symbol neural vol pp pattern prentic scheme improv road vehicl guidanc comput proc spie mobil robot pp oct percept exploit lectur seri road rel ieee tran pattern anal machin vol pp intern confer imag analysi septemb passeng car ieee symposium intellig pp improv autonom road intellig autonom march germani visual autonom road vehicl guidanc visual biolog system unman ground vehicl erlbaum capabl dynam proc intern joint confer artifici intellig nagoya august control architectur robot pattern vol pp feng gradient method solv smallest larg symmetr eigenvalu intl numer method vol pp frank statist review regress vol pp bentlei algorithm find match logarithm expect acm tran mathemat vol pp adapt regress spline annal vol pp introduct statist pattern ed san golub van matrix john hopkin pattern classif parallel develop code neural featur biol cybernet pp pattern classif ii biol cybernet pp memori storag neural gener model global comput neurosci pp mit gu stabl fast algorithm updat singular technic report hancock eigenvector land vehicl imag system dec discrimin hasti american statist vol neural macmillan colleg navig map road scene activ proc ieee intl conf robot pp map proc world congress neural vol pp hidden markov model speech edinburgh classif hidden markov model ieee tran signal vol pp annal vol pp vision appli vehicl ieee tran pattern anal machin vol pp jain algorithm cluster prentic jame featur map touretzki leen advanc neural process system pomerleau thorp gener neural base autonom road imag understand washington april pomerleau neural network road intersect detect proc ieee symposium intellig pp sept tactic technic report robot januari map speech proc intern conf artifici neural function analysi norm karhunen method stochast approxim truncat intl conf pattern pp oct detect lane boundari vehicl track techniqu spie confer aerospac mobil robot nov kirbi procedur human ieee tran pattern anal machin vol pp model robot road vision carnegi mellon pp art comput sort koenig robot navig architectur base partial observ markov process artifici intellig base mobil case studi success robot murphi mit expand applic correct symbol string recognit continu proc int conf pattern pp version learn vector proc int joint conf neural vol pp optim artifici neural elsevi scienc pp applic proc vol pp vision navig build mobil ieee tran robot vol pp land vehicl road proc intl conf comput largest eigenvalu power lanczo algorithm random siam matrix anal vol pp line segment indoor mobil ieee tran robot vol pp probabl van optim vector space john linear nonlinear program publish chandrasekaran eigenspac updat algorithm imag proc ieee intl symposium comput coral pp nov context depend acoust inform context independ speech vol pp mao neural network featur extract multivari data ieee tran neural vol pp meng robot navig neural network environ ieee control pp avoid navig real world robot phd stanford sept robot rover visual navig ann research moravec stanford cart cmu proc vol pp classif blood cell binari tree ieee tran pattern anal machin vol pp calcul primari imag set ieee tran pattern anal machin vol pp plan object recognit structur proc ieee conf comput vision pattern pp june learn recognit object intern journal comput vol pp eigenvalu decomposit larg imag spatial tempor adapt ieee tran imag pp vol track visual proc ieee intl conf robot san object recognit proc ieee intl conf robot twin simpl algorithm nearest neighbor search high technic report depart comput columbia oja stochast approxim eigenvector eigenvalu expect random math analysi vol pp minor linear neural neural vol pp train artifici neural network autonom neural vol pp network percept mobil robot kluwer academ rapidli adapt posit proc ieee symposium intellig sept poggio approxim vol pp theori brain cold spring symposium qualit vol pp numer recip cambridg tutori hidden markov model select applic speech vol pp grand challeng artifici ai pp winter dream comm pp challeng artifici pp oct power intl numer method vol pp rosenblum radial basi function network visual autonom road univ maryland center automat tech rep rosenblum improv radial basi function network visual autonom road ieee tran neural vol pp classifi design mutual ieee tran pattern anal machin vol pp tree perform enhanc artifici neural network artifici neural network statist pattern recognit sethi pp shah robot navig scene model stereo len machin vision vol pp compon analysi miss data applic polyhedr object ieee tran pattern anal machin vol pp simmon probabilist robot navig partial observ fourteenth intern joint confer artifici intellig pp sirovich procedur human journal optic societi america vol pp multistag multivari phd depart brown digit road map system autonom ieee symposium intellig juli pp guest special issu reinforc machin vol navig system jpl proc pp vision navig mobil phd dept comput navig ieee tran pattern anal machin vol pp vision carnegi mellon pp autonom cmu ieee pp user manual version transit research vision mobil world constraint imag match proc ieee int conf robot san apr pp vision system autonom land vehicl ieee tran pattern anal machin vol pp turk journal cognit vol pp robot proc ieee intl conf robot san pp april indoor robot navig symbol landmark phd depart comput michigan state east wang tempor sequenc learn base proc vol pp wang chunk process tempor ieee tran vol pp wang tempor pattern ieee tran vol pp wang learn complex tempor pattern ieee tran neural vol pp visual navig system autonom land ieee robot vol pp webb optim intern classifi network perform nonlinear discrimin neural vol pp visual proc workshop perform methodolog comput pp june approach intellig proc aaai spring symposium integr robot leap stanford march recognit intl journal comput vision accept weng converg properti mdf version technic report depart comput michigan state east weng autonom navig technic report depart comput michigan state east weng navig proc ieee intl symposium comput coral pp nov weng learn proc intl conf pattern vol pp aug weng navig neural vol pp algebra eigenvalu oxford mathemat wilson configur state recognit mit media lab perceptu comput section technic method time seri time ser vol pp densiti regress estim markov sequenc mix journal multivari vol pp survei conjug gradient algorithm solut extrem symmetr ieee tran vol pp gradient method quotient minim gener eigenvalu vol pp sequenti data featur intern report fur netherland regress model time vol pp
IR/369 5 recognit hand postur ying thoma huang beckman institut illinoi il abstract proc ieee conf hilton head human hand highli articul hand postur recognit challeng research object recognit due learn approach handl larg variat visual input gener learn method problem label train data paper describ approach allevi ad larg unlabel train set combin learn power learn paper handl case small label train set experi show outperform learn method base implement gestur interfac recogn set predefin gestur extend hand detect algorithm appli object recognit task introduct current ve wand joystick popular devic inconveni unnatur recent human hand serv motiv forc research gestur analyz recognit hand gestur complic model mean hand gestur depend peopl set specif hand gestur vocabulari predefin virtual environ ambigu limit hand gestur static hand postur tempor hand gestur hand postur express concept hand configur hand tempor hand gestur repres action hand movement hand postur act special transit state tempor suppli cue segment recogn tempor hand gestur research result show static hand sign tempor hand gestur seldom present suggest studi static hand gestur tempor gestur separ sign gestur vocabulari ve applic structur disambigu simpl command manipul gestur defin fulfil natur interact gestur command simpl hand postur switch command mode gestur point make estim point direct problem empir problem ve applic problem formul classif problem predefin static hand hand postur mean hand postur recogn view direct natur requir ve applic user camera natur user oblig issu command unknown direct culti human hand highli articul larg variat hand postur handl make system hand postur express concept act special transit state tempor recogn estim hand postur human postur main topic gestur recognit work area approach hand configur estim advantag hand model hand configur independ view method directli achiev recognit model imag featur construct correspond joint angl estim minim project surfac model imag evid silhouett light approach good surfac model process point line featur emploi kinemat hand model recov joint angl hand postur estim accur correspond model observ imag featur establish physic model statist model emploi estim hand configur problem estim hand configur trivial current method requir reliabl featur detect plagu drawback trivial achiev model calibr accuraci accur estim hand configur import applic manipul virtual object input classif hand postur applic command switch hand postur larg altern approach approach classifi learn set imag sampl easier approach achiev major automat featur select train data collect discuss featur extract select address train data gener current method larg depend train data set good gener requir larg repres label train data set manual label larg data set tediou scheme cluster hard pure approach achiev accur classif approach investig train data problem manual label sampl collect larg set unlabel hand motiv train good classifi small set label data larg unlabel data set power learn hybrid learn paradigm experi show outperform learn method algorithm appli object recognit task formul problem section section section describ approach algorithm experi result found section section conclud paper give futur work induct problem hand postur recognit identifi postur view direct hand postur imag shown figur row classifi postur class featur extract select independ design classifi raw imag space physic extract imag process emploi compact object select physic featur lot domain knowledg step applic ad hoc larg risk area bound compact hand moment edg repres hand postur total hand postur share set statist avoid research emploi mathemat featur substanti physic mathemat featur preserv imag inform object princip compon analysi techniqu largest compon statist method extract mathemat featur larg train data set physic mathemat featur larg reduc raw imag space serv compact featur plai role object recognit weight heurist weight physic featur figur postur data heurist plausibl mathemat harder find physic mean mathemat featur discrimin analysi techniqu mean automat select weight featur area face gestur success method base discrimin analysi techniqu put harsh requir train data larg label data set expect discrimin analysi output good label data sampl label learn interest result theori support vector machin classif boundari relat support data set identif support vector motiv role vector easier collect larg number unlabel unlabel data inform joint distribut featur probabilist structur data distribut paramet probabilist model estim learn imposs assign class label label data fact suggest label data label class unlabel data estim paramet gener model hybrid train data set consist label data set featur label size unlabel data set size set make assumpt distribut assumpt label data select unlabel data set assum unlabel set larger label set classif problem repres arg max data space number class goal induct learn learn classifi gener data small set label date larg set unlabel data em framework approach appli learn label unlabel data treat miss valu emploi gener model assum hybrid data set drawn mixtur densiti distribut compon mixtur model repres sampl drawn hybrid data set make assumpt compon mixtur densiti correspond paramet estim maxim posteriori probabl maxim assum sampl independ introduc binari indic ic ij ij ij em probabl paramet estim iter hill climb altern calcul expect valu unlabel estim paramet em algorithm gener reach local maximum consist iter set set arg max denot estim iter size label set em basic perform label data identifi compon em algorithm appli probabilist structur data distribut determin advanc assum probabilist structur gener model align ground truth em good partli reason unlabel data hurt classifi data dimens high size train data paramet estim gener model highli induct learn gener probabilist structur data em fail structur assumpt hold approach problem structur select comput resourc altern find map data cluster map data probabilist structur simplifi captur simpler gaussian mixtur multipl discrimin analysi techniqu relax assumpt probabilist em suppli mda larg label data set select discrimin featur mda reduc data make task statist estim easier mda natur gener fisher linear discrimin case multipl basic idea mda find linear transform map origin data space space ratio scatter scatter maxim detail found mda mean catch major class discount factor relat classif featur relev classif automat select combin linear map featur substanti physic mean advantag mda data cluster extent project make easier select structur gaussian mixtur model appar mda statist requir label sampl estim statist covari combin mda em algorithm combin paradigm basic idea enlarg label data set identifi sampl unlabel data techniqu made enlarg label set emploi gener model lower space map transform mda begin weak classifi learn label set expect weak classifi unlabel sampl classif confid jk base probabilist label jk assign weak classifi jk jk heurist weight unlabel data choic output probabilist label weight unlabel fix transform gener model perform mda weight data set find linear transform data set linearli project space dimens unchang label estim paramet probabilist model probabilist label bayesian classifi algorithm iter algorithm termin method preset iter compar threshold paramet consecut note simplif probabilist structur mda compon data distribut mix find linear map nonlinear map found simpl probabilist structur approxim data distribut map data space gaussian gaussian mixtur experi show work pure em experi describ collect train test data data extract physic mathemat investig unlabel data comparison classif applic hand detect data collect set shown figur gestur vocabulari gestur interfac repres gestur command hand local system develop automat collect hand imag serv unlabel local system output bound box hand hand postur larg unlabel easili construct unlabel hand imag note bound box imag introduc train data set includ make recognit algorithm robust postur sampl manual label investig effect unlabel data compar classif construct test data consist label imag step data preprocess includ background subtract histogram equal light correct step larg bypass influenc background physic mathemat featur hand experi advantag textur edg extract normal physic gabor wavelet filter level orient extract textur standard deviat wavelet filter fourier descriptor repres hand shape statist hand contour total edg moment edg distribut imag featur total extract mathemat hand imag resiz raw imag space dimens pca emploi find featur space experi approach find good role unlabel data investig unlabel data feed algorithm number label unlabel sampl mathemat featur extract pca princip dimens mda set unlabel sampl label figur combin unlabel data reduc classif error automat label sampl mechan figur studi dimens paramet pca mda princip compon pca minor import discrimin featur neglect princip compon discrimin class princip compon pca includ number unlabel data unlabel data unlabel data unlabel data unlabel data unlabel data figur label unlabel data number princip compon pca import paramet pca dimens mda rang number class interest lower space class classifi label data unlabel find good dimens paramet pca mda dimens pca figur dimens pca mda comparison classif algorithm compar experi test physic mathemat featur number princip compon pca set set label data perform mda dimens label train perceptron experi hidden layer node experi scheme nearest neighbor classifi label label sampl bootstrap classifi grow newli label sampl ad classifi label label unlabel data em tabl show comparison algorithm perceptron nearest neighbor nearest em tabl comparison algorithm tabl algorithm outperform method perceptron trap local minima experi poor perform nearest neighbor classifi partli due label data grow scheme reduc error automat expend store templat problem scheme order confid measur grow error label accumul pure em algorithm converg satisfactori classif experi end pretti good result hand detect combin skin color postur recognit detect hand skin color segment limit search hand detect figur show skin color region segment arm hand detect accur bound box hand region hand postur recognit import achiev natur interact virtual environ applic learn approach gener method train data collect larg label train set manual label sampl figur hand detect power learn unlabel data set learn reduc number label sampl combin mda em mda make em perform em suppli mda label data perform discrimin analysi experi show outperform learn method perceptron nearest neighbor algorithm appli object recognit task current linear mda simplif probabilist structur case mda investig futur converg stabil analysi algorithm studi physic featur hand imag studi make extens comparison mathemat featur work hand detect extend current hand local system applic algorithm object recognit task worth pursu acknowledg work support part nation scienc foundat grant grant author anonym review comment refer ieee intl conf comput vision pattern classif scene analysi version recognit class specif linear project european confer comput april set imag object light ieee hand sign recognit intl workshop automat face gestur sign recognit intens imag sequenc complex proc ieee confer comput vision pattern gestur signal hand track deform ieee intl conf automat face gestur gestur human comput hand ieee intl conf automat face gestur hand model gestur recognit human comput ms dept univ illinoi analysi hand ieee comput graphic classif label unlabel document machin independ recognit deictic arm proc annual conf ieee industri electron pp learn hand pose recognit ieee automat face gestur track articul ieee intl conf comput face ieee gestur estim model refin monocular camera ambigu limit inequ proc conf face gestur accur gestur recognit ieee intl conf automat face gestur classif hand postur complex intl conf automat face gestur natur statist learn ying thoma human hand ieee intl conf comput ying thoma gestur gestur franc ying thoma adapt selforgan color segment algorithm applic robust human proc asian confer comput
ML/370 6 acm intern confer intellig user interfac program induct learn formul lau daniel weld depart comput scienc engin washington wa octob abstract program demonstr potenti improv product previou system approach gener paper defin method perform gener base machin learn technolog foil base foil induct logic program algorithm analyz method theoret argu lower sampl foil learn interest class program keyword program machin induct logic version space introduct comput user larg unabl custom applic fit individu task problem custom address wai ffl adjust prefer default simpl limit option consid import applic design research greatli improv discuss comment greg alan adam william pedro michael oren neal alon mike perkowitz research fund offic naval research grant nation scienc foundat grant arpa rome lab grant ffl applic support macro user record fix sequenc action replai sequenc shortcut click macro requir sophist creat user simpli record normal interact macro limit util repetit task minor variat ffl script languag sophist user write program control applic type custom user requir program experi knowledg potenti complex script languag applic interfac program demonstr aim combin simpl interfac macro express script languag macro user construct program simpli perform action user interfac familiar unlik learn program control structur abstract complet system consist major part trace gener construct programmat user action gener execut trace program capabl produc trace interact manag explain result program user gain author execut program user behalf user perform sequenc action email goto messag sender goto messag sender oren goto messag sender dan forward current messag goto messag sender goto messag sender dan forward current messag goto messag sender goto messag sender execut trace gener conjectur user email messag output messag system interact manag describ procedur accept refin offer execut highlight result implement undo facil paper problem trace gener previou system heurist approach defin method perform gener base machin learn ffl gener ffl induct logic program foil theoret empir analyz implement offer ration reconstruct aspect eager system learn fewer foil learn interest class program loop iter foil quickli learn program shown train exampl shown prior work complet system trace gener interact manag compon gener execut trace program involv determin length iter notic regular iter recogn condit construct interact explain gener user obtain author program execut prior system made contribut work restrict trace gener focu aspect discuss cypher describ system eager system detect autom repetit action applic user action compar action histori scheme system detect repetit highlight predict offer autom remaind sequenc programm construct user interfac draw interact set rule determin infer constraint widget placement iter sequenc learn text edit command reli user multipl disambigu program chimera gener constraint graphic object multipl snapshot facil creat macro graphic edit domain support program lisp perform reli user disambigu exampl system reli heurist rule describ gener heurist make system expert system labori difficult extend eager recogn fix set sequenc user email messag mailbox dai week set rule infer constraint loop fragil heurist domain advoc establish machin learn techniqu perform robust trace gener demonstr remaind approach yield low sampl complex foil capabl gener small number train exampl consid appli algorithm witten al identifi shortcom current machin learn approach appli inabl advantag domain knowledg user hint sketch framework machin learn witten describ algorithm detect hierarch structur sequenc gener grammar repeat subsequ singl algorithm elegantli obviou appli background knowledg bia gener grammar plan recognit typic requir larg librari plan check user action work view induct learn strong bia plan bauer present algorithm construct plan librari corpu log user trace option action model litman terminolog subsumpt tempor constraint network match execut sequenc librari plan lesh etzioni adapt version space algorithm perform goal recognit implicit construct reason action precondit effect work similar previou machin learn effort develop softwar schlimmer describ system predict user write system work learn finit state machin model note syntax tree classifi fsm state mae learn user predict user action action recent contrast work attempt learn loop induct learn problem watch user system induc abstract procedur human execut section wai encod trace gener induct learn problem ffl iter loop order sequenc system gener multipl iter ffl induct logic program exampl relat descript individu user system learn datalog program order set rule predict action execut remaind elabor encod discuss rel advantag version space encod version space algorithm order maintain compact set maxim specif set maxim gener version space set express consist train data date intuit underli algorithm posit exampl result set maxim specif neg exampl set maxim gener refin interest specif consist train half full algorithm version space perform trace gener loop iter posit encod featur vector column argument attribut adopt simpl conjunct hypothesi languag wildcard semant simpl hypothesi repres set exampl match pattern hypothesi copi subj past moonei common lisp match sequenc command copi subject action past file hypothesi wildcard correspond procedur loop requir hypothesi equal gener conjunct conjunct equal wildcard symbol simpl execut trace adapt eager paper horizont line separ loop iter goto messag sender copi subject past goto messag sender copi subject past previou trace encod shown chosen repres singl attribut goto messag messag sender choic critic omit attribut length consid gener choic independ learn algorithm simpler restrict procedur sender goto dan copi subj past goto copi subj past conjunct hypothesi quickli process exampl shown return sender goto copi subj past specif consist hypothesi predict user copi subject messag sender messag version space approach strength weak algorithm gener exampl low sampl complex due strong bia afford conjunct hypothesi languag strong bia major limit hypothesi languag incap express program save messag dan file messag train sender goto dan copi subj past goto copi subj past goto dan copi subj past goto oren copi subj past system produc sender goto copi subj past correspond unintuit loop user save messag file note hypothesi languag incap express program save messag dan file messag problem develop express hypothesi languag limit handl loop approach improv macro handl restrict class condit break individu number correspond action iter lost address express hypothesi datalog program induct logic program ilp foil extens rule learner input set relat train exampl classifi exampl target concept posit exampl algorithm learn order set horn describ train exampl term input relat learner emploi sequenti cover algorithm creat rule explain subset posit train remov exampl posit exampl cover rule grown gener specif learner start empti rule horn target relat head empti add conjunct liter rule stop criterion met learner perform search base inform gain heurist liter consid search includ instanti relat equal variabl negat liter ad rule rule cover posit train consid complet algorithm view hillclimb search space conjunct base inform gain heurist foil formul encod user action foil differ featur vector encod predic calculu featur encod data train exampl past subject figur type relat describ learn problem target relat bold logic redund relat reduc sampl ital exampl correspond individu action loop iter circumv problem enabl simpler user interfac user manual identifi separ make learn problem harder encod simpl model time learner util order action execut gener featur vector encod express inform close world assumpt neg train exampl command messag command imposs exploit neg exampl notion user eventu execut illustr foil algorithm term hypothet email applic background inform user past interact email applic encod term predic calculu type primit relat shown figur ontolog base oper perform user interfac copi subject past action command argument repres argument command messag subject current messag structur action command arg messag text file sender goto dan null null copi subject goto past copi goto past copi subject goto past copi goto oren past copi subject goto past copi figur compact displai train exampl email ontolog line tabl repres singl posit train column redund attribut speed learn sage sender attribut describ messag relat encod background knowledg order hold action successor action relat express background knowledg order messag sequenc facilit recognit loop iter messag sequenc full applic includ sequenc relat common sequenc dai user action convert set liter ontolog user move goto messag sender action repres ad background theori close world assumpt add neg ensur command argument foil learn order set horn predict user command argument command figur show posit train exampl compact form repres iter loop user copi subject success messag past train exampl cwa foil output rule system predict user command command action past execut goto execut command fourth rule classifi user command predict prune postprocess modifi foil learn algorithm attempt classifi simpli classifi subsequ action foil learn rule argument train rule state action argument previou command goto text learner exploit fact text rule previou command copi argument command argument rule predict argument goto command previou command past argument directli sequenc current fourth rule akin command rule gener classifi argument action predict prune simpl foil requir neglig cpu time posit correspond iter user loop condit loop test power induct logic program show learn loop involv condit construct condit loop revisit section version space similar previou task copi messag subject case user copi subject messag dan copi subject messag email foil learn horn iter posit train messag present variabl length loop path loop path action email foil learn horn pseudocod present introduct train exampl cpu pentium section describ experi shed light power foil trace gener method result section report result experi compar speed sampl complex foil small set exampl measur effect foil sampl complex ontolog repres email domain comparison techniqu figur compar foil exampl paper learn program remain exampl involv condit construct foil requir addit iter correctli learn learn condit program express result show machin learn approach eager heurist approach requir ontolog comparison choic ontolog impact learnabl develop foil experi number ontolog converg email ontolog section compar sampl size cpu time induct rule argument previou section ffl email standard defin previou section ffl email redund relat remov elimin relat foil action time action time figur comparison foil column number action requir learn correct program exampl action loop cpu time pentium receiv iter singl train capabl learn correct program exampl involv condit branch factor space search path length solut length result ffl add redund hold action assum iter loop learner induc desir rule shallow search cost branch motiv command argument learn independ imagin system learn command rule ad relat speed induct argument ffl ontolog replac command argument target relat relat action command argument motiv observ command argument relat separ learn make problem harder ffl ontolog replac command argument target relat ontolog design attempt reduc number conjunct rule learn command argument term number small selector system exampl singl target relat figur show result experi email ontolog requir fewest train exampl action cpu time email combin action big relat figur comparison sampl size cpu time ontolog column report number train exampl requir learn correct iter program step long foil unabl learn correct program big relat ontolog fewer train exampl hour time report quinlan foil pentium run linux measur compar give benefit hint loop length foil unabl learn correct program big relat ontolog train exampl hour branch factor search grow exponenti ariti target pazzani kibler analysi foil complex futur work work number research question primari concern foil system scale domain complex program complex wai address issu priorit liter order direct heurist search search bia give learner background inform previou task loop bia encod agreement constraint grammar learn user disambigu equal altern machin learn algorithm prove suit version space induct logic program gener model action precondit effect learn singl proposit rule learner learn disjunct concept elimin weak machin learn algorithm sensit import experi altern ontolog proposit learner handl action train exampl vocabulari program templat approach successfulli appli wrapper induct open question system deal noisi data implement user insert irrelev action switch order action subsequ iter order unimport reason model allevi type segment problem view type noisi data paper talk gener trace action system capabl identifi correct subsequ gener approach data mine learn nugget high predict attempt classifi entir train set plan breadth work incorpor applic microsoft address interact perform user studi quantifi potenti benefit previou approach program demonstr heurist order minim number user action observ system gener gener implement trace gener induct learn possibl method appli applic develop foil test email context motiv eager system learn gener lower sampl complex due strong conjunct foil learn variabl length condit loop frustrat foil learn nontrivi program iter measur effect ontolog sampl complex refer bauer acquisit abstract plan descript plan recognit proc nat conf william cohen grammat learn logic program explicit descript languag artifici allen cypher program repetit task demonstr allen watch program page mit allen editor watch program demonstr mit kautz formal theori plan recognit phd david graphic edit allen watch program page mit doorenbo wrapper induct inform extract proc int joint conf neal lesh oren etzioni sound fast goal recogn proc int joint conf page neal lesh oren etzioni scale goal recognit proc int conf principl knowledg page henri lieberman program demonstr system begin programm allen watch program page mit patti mae learn interfac agent page david ian witten interact concept learn system applic appli artifici mitchel gener search artifici mitchel machin learn mcgraw brad myer creat user interfac demonstr allen watch program page mit cg ih witten detect sequenti structur proc workshop program taho juli cg ih witten identifi hierarch structur algorithm journal artifici intellig gordon program demonstr sixth australian confer page nov pazzani kibler util prior knowledg induct learn machin pazzani kibler util knowledg induct learn machin pollack infer domain plan phd jr quinlan learn logic definit relat machin reiter close world gallair logic data page plenum schlimmer softwar complet pattern construct user interfac artifici intellig page litman terminolog reason constraint network applic plan recognit proc int conf principl knowledg octob weld introduct plan ai page winter ih cg dl interact learn implic ml hci workshop machin learn meet page juli
IR/371 5 exploit structur intellig web search udo depart comput scienc essex colchest unit kingdom abstract rapidli grow amount onlin data regist intellig search engin access restrict amount data found intranet limit domain sort search engin simpl keyword easili adapt domain huge cost paper present mechan address intern document structur extract concept structur document similar found classifi directori effici larg languag independ make assumpt document structur overview issu extract structur text challeng abiteboul find inform web straightforward task user request inform locat appli standard search engin simpl pattern match techniqu restrict search defin corpor intranet web tediou task match document user left great number partial match document result problem approach exist overcom approach tend reli document structur creat concept hierarchi product catalogu applic inform store document collect heterogen natur present mechan classif hierarchi set web page extract concept word base structur detect document relat document basic idea select keyword document found ffl meta inform ffl document head ffl document titl ffl part document separ import term import work larg languag independ exploit layout cost effect extract concept function classif individu document directori link document similar classif manual maintain web directori looksmart present work preliminari thought structur data collect emploi dialogu system cope user queri retriev document result match remaind paper structur discuss relat work detail section offlin process index document sampl domain explain classif built result index process onlin system index tabl copyright ieee publish hawaii intern confer system januari hawaii person materi permit permiss materi promot creat collect work resal redistribut server copyright compon work work obtain ieee final report implement issu recent experi give relat work roughli approach solv problem find inform user set semistructur document reli enorm amount data structur inform grant context work relat work detail index document research topic inform retriev commun year document intern structur collect measur gigabyt web track introduc trec seri question small web task find link inform web data obtain effect search rank obtain page content found hyperlink result improv overview result summar measur benefit gain standard trec retriev measur link work layout analysi motiv convert print collect document tag electron version system aim process type document base heurist rule perform physic logic analysi intent captur conceiv object add document present captur semant content document find logic structur document actual document style focu segment classif segment process primarili base contour font shape inform classif step base comparison text segment predefin structur mean geometr cue linguist knowledg prototyp identif typic symbol inform style document incorpor process step relev field relat work document cluster inform retriev cluster reli larg amount data ibm text mine project aim automat gener taxonomi larg corpu unstructur wire document hierarch cluster algorithm build bottom cluster work upward form cluster group relat cluster cluster base pure linguist element word domain term word phrase text recent conceptu index document collect machin learn techniqu appli order extract document context digit librari close idea structur collect extract phrase document longer manual tag train corpu build classifi extractor similar system extract learn cluster relev feedback web inform retriev user queri retriev document conceptu group unlik approach structur extract index domain search result interfac metasearch engin dynam group search result cluster label phrase extract snippet search engin return retriev document applic tradit offlin cluster approach document collect number retriev document motiv zamir al document cluster shown produc superior result cluster thousand document quicker million document problem cluster miss point classif structur data set built advanc document classif close relat differ cluster predefin categori manual train phase document classifi northernlight search engin result group dynam creat call custom search folder user narrow search case match search cover internet access data assum custom search folder offer queri retriev answer dealer colchest colchest ontolog version exist languag resourc wordnet successfulli search product catalogu document collect held relat part research actual construct ontolog cost creat resourc enorm difficult appli solut domain document structur advanc deal semistructur inform web retain structur store data data model mean wrapper retain captur transform html document xml format queri languag develop promin system stanford lore drawback index depend formal defin structur expect input experi semistructur substanti applic clever project topic relat search domain complet internet problem solv filter page relev specif problem match author hub place relev collect link author hub found pure connect web page base hit algorithm develop kleinberg modif algorithm present part clever project extract hub author perform combin text link analysi text window hyperlink evalu initi weight hyperlink set iter calcul start amount text hyperlink vector vote introduc depend word document content hyperlink document rank relev queri term overcom problem spam web page internet wide search problem subdomain number link document smaller problem occur page refer small number document document anchor text addit structur inform found context hyperlink furnkranz task classifi page set class report classifi document reliabl inform origin page point document featur deriv document text system develop intranet search result record shortest path root node term hyperlink appli result found search engin exploit hyperlink ignor intern structur index web page intern structur incorpor standard web search engin promin googl develop inspir idea improv qualiti search effici make link structur anchor text page rank depend page refer system associ web page text text found anchor link page make return page crawl googl track visual present detail font size give heavier weight word larger font rest document googl queri match document system address similar problem user provid good servic document web page bt yellow page talk page build classif implicit part input data sourc index web page classif impress work fine domain independ context lot data index web special applic manual tailor classif semant content document collect domain depend classif readi hand chang amount data reliabl classif case structur construct actual data desir aim extract small number import keyword document function relat document interpret relat extract concept import assumpt make frequenc term found document specif term found context type call concept standard ir paradigm yellow page talk page regist trade mark british telecommun plc unit kingdom web page distinguish type context candid keyword ffl meta tag ffl head tag ffl document titl tag ffl sort emphasi bold ital ffl free text document keyword phrase found select concept filter stopword mean ignor free text complet reli meta tag infrequ sourc spam conceptu inform reduc number keyword select document possibl keyword select strategi back frequent keyword found document titl inform assum noun content bear ignor keyword extract part phrase noun illustr pick actual exampl document found web server essex essex web page domain list stopword expand includ term essex word form index process stemmer page entitl essex overview hyperlink file travel inform campu find figur show select frequent keyword document keyword select directori frequent keyword document compar figur show index select appli concept approach term directori frequent concept select file list directori demonstr frequent word necessarili desir choic queri word squar exampl bu guid travel travel figur frequent keyword classif ad stopword list work addit investig keyword select document actual text structur document content page refer mean hyperlink result differ significantli case approach consid classif extract concept word lead type document classifi select concept concept start page directori abstract singl document interpret number item group frequent concept document select repres content directori directori treat normal document structur classifi directori yellow page richer link head type link call link classif address colchest area local directori list refer area bu depart figur select concept type link refer user relat roof servic link builder context link index process data orient build structur classifi document exist classif scheme mean empti classif defin basi relat concept pair concept extract document directori term administr visitor figur relat road bu intend captur semant content fact correl section shown user decid inform interpret ignor relat word problem subset relat frequenc fall threshold depend domain size data pair road bu exclud defin base relat concept extract directori singl document dialogu system web search discuss index construct onlin queri process bit top correct long simpl keyword lookup return accept number document experi shown problem turn document found user queri gener queri tend retriev larg number match small domain time obviou smaller user queri match index backend dialogu system success queri initi dialogu step concept hierarchi appli rank classif structur dialogu system solv observ start match queri web page simpl request visitor inform match document read ten time screen link refer page present conceptu approach reduc number match find match list term visitor concept word inform frequent earlier figur directori start page essex perfect fact word visitor found page exploit involv dialogu step present user option constrain search queri gener user term ad queri user offer continu search select visitor includ travel campu compar search classifi directori mean retriev list classif time user decid queri specif forc system displai rank base concept hierarchi match match relax thing happen automat queri term worsen dramat obviou document retriev automat relax appli incorpor dialogu step user decid sort relax perform option gener user wai relax actual dialogu ffl search partial match user decid part origin queri continu ffl expand modifi queri exploit user decid chosen replac part origin queri search hotel travel inform relax bu train list term travel continu search bu train travel ffl find document match part queri part match document refer hyperlink ffl displai start page directori match queri singl extend list relax depend context option relax check advanc addit domain knowledg enhanc relax specif applic back claim made interest find concept relat fact semant relat domain depend languag specif link queri irrelev queri involv term dialogu system user decid implement issu gather robot start root collect strategi relev web page found ignor document html format locat domain gather document pass index compon robot index construct program perl make exist modul text index process brill tagger wordnet porter stemmer reduc word stem resourc appli languag english anecdot note number implement porter stemmer interpret algorithm differ word artifici stem artifici perl modul return artifici decid appli perl implement provid porter web base onlin dialogu system run sicstu prolog execut access socket initi part base subsequ reimplement extern msql oracl platform sparcstat ultra mb work memori run solari focu index sampl subdomain web page essex arbitrari choic framework fulli implement plan valid approach domain figur show start page onlin search system figur user interfac recent experi result fine tune algorithm complet present result evalu initi test show result classif hierarchi paper built effort usefulli appli case page page retriev user queri result concern retriev result success queri initi displai page queri term list concept made page larg number match web offer user relat concept constrain queri match figur screenshot sampl queri user twelv web page relat academ work depart option lead larger number page refer singl person figur select concept present statist demonstr amount data extract index essex domain index web html ascii page access start page presum robot file prevent robot crawl tabl statist domain tabl list main concept alongsid concept term found context singl document highlight strong restrict main concept prototyp number index page number free text keyword index number select concept number select main concept number page concept number hyperlink averag number keyword page averag number concept page percentag page concept give list frequent select concept found web page sampl concept number occurr work paper paper work research linux histori model studi frequent main concept main concept number occurr studi cour research paper work vision paper work unit histori project vision note frequent concept constrain relax user queri constrain queri ad gener term result match document upper threshold current prototyp prevent frequent concept appli major task remain evalu develop system standard techniqu queri submit search engin period hour queri collect august sampl queri chosen test system access index indic concept flat keyword indic standard search user fill user satisfact form similar order improv system interest automat extract keyword combin classif hierarchi present method sophist index web site subdomain web captur structur relat document retain uncov inform make assumpt document structur result index appli dialogu system navig user option queri answer case judg relev document base concept relat classif automat creat applic creation classif hierarchi document process result classif structur manual refin experi involv html document similar approach long layout analysi appli preprocess document order mark sort layout found acknowledg anonym review comment address final version paper sam steel spent time discuss issu paper prepar slide term refer abiteboul queri data intern confer theori page brill simpl part speech tagger confer appli natur languag brin page anatomi hypertextu web search engin seventh intern world wide web confer tomkin web scientif kleinberg automat resourc compil analyz hyperlink structur text seventh intern world wide web confer chang hsu enabl relev feedback inform retriev www ieee transact knowledg data chen dumai bring order automat categor search result human factor comput den lin system organ intranet search result usenix symposium internet technolog system slatteri learn extract symbol knowledg world wide web fifteenth nation confer artifici intellig tenth confer innov applic artifici intellig page de webb intellig directori assist bt technolog de webb assist classifi directori intellig system soft tool lectur note artifici intellig page springer layer approach inform retriev acl cole page furnkranz exploit structur inform text classif www symposium intellig data analysi springer verlag access web ieee intellig frank improv digit librari index support bailei overview web track eighth text retriev confer kleinberg authorit sourc hyperlink environ symposium discret algorithm american associ artifici web search indic workshop artifici intellig web technic report page aaai press de webb extract semistructur data lesson learnt natur languag process intern lectur note artifici intellig page springer doorenbo wrapper induct inform extract li qualit search engin ieee internet smith wrapper gener linguist knowledg intern workshop web inform data kansa widom manag system semistructur data sigmod miller lexic intern journal autom gener taxonomi larg document collect hawaii intern confer system scienc porter algorithm suffix strip sahuguet web xml glass intern confer cooper inform system salton editor introduct modern inform retriev book picard report search web distribut collect eighth text retriev confer gate semistructur intern workshop knowledg summer automat discoveri logic document structur phd cornel tool creat structur document collect print materi technic report tr inform scienc research thoma logic program intellig web search intern symposium methodolog intellig system turnei extract text technic report nation research council institut inform turnei learn algorithm extract inform de turner evalu natur languag dialogu result experi workshop spoken dialogu full natur interact dialogu empir analysi intern confer languag resourc evalu zamir etzioni dynam cluster interfac web search result eighth intern world wide web confer zhai fast statist noun phrase document index confer appli natur languag washington
IR/372 5 reliabl extract data machin learn approach craig knoblock southern california fetch technolog southern california steven minton fetch technolog ion muslea southern california abstract critic problem develop inform agent web access data format human develop set tool extract data web site transform structur data xml result data build applic deal unstructur data advantag wrap technolog previou work abil learn highli accur extract verifi wrapper ensur correct data continu automat adapt site data extract introduct tremend amount inform inform form easili applic hope xml solv xml widespread case address problem applic domain interest parti xml schema definit previou work wrapper gener academ research commerci product primarili abil rapidli creat wrapper previou work make attempt ensur accuraci wrapper entir set page site capabl detect failur repair wrapper underli sourc chang develop technolog rapidli build wrapper accur reliabl extract data semistructur sourc figur graphic illustr entir lifecycl wrapper shown copyright ieee person materi permit permiss materi promot creat collect work resal redistribut server copyright compon work work obtain ieee bulletin ieee comput societi technic data engin gui label web page wrapper induct system automat page label chang detect web page wrapper wrapper verif figur lifecycl wrapper extract data wrapper induct system set web page label exampl data extract user initi set label exampl system suggest addit page user label order build wrapper accur output wrapper induct system set extract rule describ locat desir inform web page system creat wrapper verif system function wrapper learn pattern describ data extract chang system automat repair wrapper pattern locat exampl chang page wrapper induct system detail entir process remaind paper learn extract rule wrapper piec softwar enabl semistructur web sourc queri sourc explicit structur implicit underli structur document figur text email structur head exploit extract bodi messag onlin regular structur exploit extract data automat critic problem build wrapper defin set extract rule defin locat inform page item extract extract rule locat begin end item document consist sequenc token html find token item hard part problem construct set extract rule work page sourc kei idea underli work extract rule base group consecut enabl wrapper locat start end item page restaur descript present figur order identifi begin rule figur sampl restaur document guid st oak main st adam figur sampl restaur document start begin document skip token find landmark consist word ignor find landmark call start rule identifi begin address write similar end rule find end sake restrict discuss start rule note mean begin address rule address start rule landmark immedi begin address reli landmark defin base landmark placehold capit alphabet string exampl wildcard deal variat format extract rule disjunct assum address mile locat bold figur displai ital extract base disjunct start rule disjunct rule order list individu disjunct appli disjunct rule straightforward wrapper success appli disjunct list find match simplifi exampl rule real world sourc wrap disjunct develop stalker hierarch wrapper induct algorithm learn extract rule base exampl label user graphic user interfac user mark page system gener set extract rule accur extract requir inform approach induct learn increment build extract rule exampl contrast approach kei featur stalker effici gener extract rule small number rare requir case exampl suffici abil gener small number exampl explan page sourc gener base fix templat variat stalker learn landmark part templat variat hand exampl suffici induc reliabl landmark stalker exploit hierarch structur sourc constrain learn problem base schema data automat difficult problem extract item seri simpler complex rule extract restaur address phone number hierarch approach appli rule extract list rule break list tupl correspond individu tupl extract phone number restaur hierarch approach advantag extract data page complic format layout list previou approach handl stalker sequenti cover algorithm train exampl learn minim number perfect disjunct cover exampl perfect disjunct rule cover train rule match produc correct result stalker creat initi set repeatedli appli step gener perfect select candid refin candid add result refin stalker obtain perfect disjunct è remov exampl è process repeat train exampl stalker type landmark refin topolog refin make rule specif ad token exist add landmark rule assum base exampl figur learn start rule address stalker proce select guid search gener set initi rule consist singl landmark chosen match token immedi begin address guid case initi token match exampl match match earli stop encount html exampl begin gener stalker select refin refin stalker candid shown obtain landmark refin token ad landmark rule creat topolog refin landmark ad work correctli stalker stop learn process return successfulli wrap inform sourc wrap exist approach empir evalu sourc stalker learn extract rule learn perfect rule rule accuraci learn rule accur identifi highli inform exampl stalker significantli hard task fail learn perfect system provid carefulli select exampl inform exampl illustr except case unrealist assum user skill larg number document order identifi suffici set exampl learn perfect extract rule gener problem exist tool machin learn solv problem develop activ learn approach analyz set unlabel exampl automat select exampl user label call exploit fact multipl wai extract inform case wrapper system learn type forward backward rule rule present forward start begin document end backward rule start end page begin find begin address figur backward main idea user label system learn forward backward rule run rule set unlabel page rule system consid user label intuit approach rule page identifi token begin address rule learn base set token sequenc token follow begin highli make exact mistak rule user label obtain highli inform train make gener accur extract rule small number label exampl illustr exampl figur restaur citi locat radiu document sourc similar address shown exampl similar address shown address bold present randomli initi train set assum initi train set consist label base learn rule rule correctli identifi begin address restaur mile work incorrectli exampl stop begin phone number correct rule user label wrapper induct algorithm capabl identifi inform exampl relat field inform extract data free text research algorithm appli straightforward manner exist wrapper induct algorithm appli task stalker fail learn perfect rule base random exampl comparison start random made queri result averag accuraci task improv rate reduc learn rule rule accur experi relat test appli lead improv accuraci label train data verifi extract data problem larg past work extract data web site site chang chang kushmerick address wrapper verif problem monitor set gener densiti numer charact approach detect type address problem appli machin learn techniqu learn set pattern describ inform extract relev field inform singl field vari system learn statist distribut pattern field wrapper verifi compar pattern data return learn statist distribut differ oper notifi automat launch wrapper repair section learn pattern repres field sequenc word wildcard wildcard repres syntact categori word belong gener complex inform suffici start end pattern descript data field set street address oak main st adam start pattern end refer start end pattern data prototyp field problem learn descript field set label exampl pose relat classif conserv task neg exampl classif algorithm learn discrimin descript posit exampl conserv task learn characterist describ posit exampl highli describ randomli gener set neg exampl chose frame learn problem conserv task algorithm call find statist start end pattern set posit exampl field pattern occur frequent expect chanc token gener randomli independ approach similar work grammar induct pattern languag suit captur regular small data field algorithm oper build build prefix node correspond token posit sequenc depth tree path tree start root node pattern found algorithm algorithm grow tree increment ad child node correspond extend pattern singl token child repres special pattern learn citi node pattern child node judg respect parent node number occurr child pattern suffici number occurr parent pattern baselin probabl token extend parent pattern prune step insur child node specif sibl occurr occurr judg retain significantli exampl match entir tree algorithm includ pattern extract step check pattern specif pattern decid exampl longer sequenc explain null hypothesi pattern learn lend data valid task wrapper verif set queri retriev html page wrapper extract train exampl learn algorithm find pattern describ common begin end field train exampl verif wrapper gener test set exampl page retriev similar set queri pattern describ statist proport test exampl train wrapper judg extract judg fail learn repres expect format configur wrapper verifi extract data data immedi result regular frequenc verif method depend applic tradeoff time data accuraci monitor wrapper distinct web period month result queri store period result compar correct wrapper output manual check result reveal wrapper total comparison verif algorithm correctli discov algorithm incorrectli decid wrapper chang case work reduc high rate posit origin sourc chang sourc extract extract extract extract rule titl begin rule end rule author titl price avail berg titl extract rule titl begin rule end rule author titl price avail nil nil titl extract rule titl begin rule end rule author titl price avail berg titl automat repair wrapper figur process web site larg syntact minor format slight reorgan page content field tend remain exploit pattern learn verifi extract result locat correct exampl data field page requir inform page automat label exampl induct learn process produc correct rule site wrapper algorithm set train exampl set page sourc machin learn techniqu identifi exampl data field page learn start end pattern describ field train exampl page scan identifi text segment begin start pattern end end pattern call significantli longer shorter train exampl elimin leav hundr candid page candid cluster identifi subgroup share common featur featur cluster rel posit adjac visibl user group score base similar train exampl expect highest rank group correct exampl data field figur show actual chang site system automat adapt chang top frame show origin extract rule book extract result page middl frame show sourc incorrectli extract result font color chang bottom frame show result automat process correct rule extract titl evalu algorithm extract data web page correct output output extract algorithm rank list cluster data field extract cluster check judg correct complet instanc correct context page extract citi extract citi part address ran extract algorithm distinct web attempt extract data field sourc case top rank cluster correct complet instanc data field case correct cluster case candid identifi page close relat work cohen inform retriev approach reloc inform page approach evalu actual web difficult assess approach work practic discuss work address complet wrapper creation build wrapper ensur wrapper accur extract data entir collect verifi wrapper avoid failur site automat repair wrapper layout format main technic contribut machin learn accomplish task approach advantag fact web page high regular structur analyz regular structur wrapper induct process detect landmark enabl extract desir field develop initi wrapper induct process realiz accuraci induct method improv simultan learn extract rule identifi except case make regular page enabl identifi landmark field field approach automat detect wrapper repair capit regular structur extract field wrapper initi obtain numer exampl field enabl profil inform field obtain structur descript monitor repair essenti bootstrap approach initi exampl provid learn wrapper wrapper obtain exampl analyz greater depth leverag end highli scalabl system wrapper creation mainten acknowledg research report support part rome laboratori air forc system command advanc research project agenc contract number part unit state air forc contract number part integr media system nation scienc foundat engin research cooper agreement view author interpret necessarili repres offici polici express organ person connect refer blum mitchel combin label unlabel data proc confer comput learn page learn stochast regular grammar mean state merg method lectur note comput page cohen recogn structur web page similar queri proc nation confer artifici intellig page freitag kushmerick boost wrapper induct proc nation confer artifici intellig page etzioni grammar infer algorithm world wide web proc aaai spring symposium machin learn inform hsu dung gener transduc data extract web journal inform kushmerick regress test wrapper mainten proc nation confer artifici intellig page kushmerick wrapper effici express artifici intellig minton learn common structur data proc nation confer artifici intellig page knoblock select sampl redund view proc nation confer artifici intellig page knoblock hierarch wrapper induct semistructur inform sourc journal autonom agent soderland learn extract rule free text machin moonei activ learn natur languag inform extract proc intern confer machin learn page
HCI/373 4 interact track dougla oard julio colleg inform studi institut advanc comput studi colleg park md usa departamento de sistema universidad de spain abstract interact track year share experi design compar strategi search assist kind experi experi document user task scan rank list document written foreign select relev queri aim compar translat strategi full search user task maxim number relev document found collect search system particip team focu aspect search task queri queri translat relev paper describ share experi design briefli summar experi run team particip introduct inform retriev term typic queri natur languag find document written languag user compon system user search collect recogn relev document gener refer situat task multilingu inform access evalu forum interact track occas commun research share experi design compar strategi provid interact support multilingu inform access process case includ task particip team experi document user task scan rank list document written foreign languag form autom translat select relev topic aim compar translat strategi support document select process full search user find relev document complet interact clir system team regist submiss receiv section describ share experi design section particip describ sought test section briefli fuller analysi result found team paper section make observ year track briefli discuss prospect futur experi design basic design experi consist system intend refer set group set topic written languag searcher document collect languag searcher lack languag standard procedur search present order list combin defin search session rel set evalu measur search session permit comparison system compar main number topic searcher minimum number searcher order experi durat time search minut reflect lesson learn statist test limit insight limit number topic searcher remaind describ aspect detail topic topic select evalu fulli autom rank retriev system evalu campaign main reason select previou year topic insight number relev document topic advanc fresh topic criteria topic select select broad topic select topic relev document document assess discard topic easi presenc proper noun correl accuraci relev judgment depend order document english titl descript select topic field shown space case find document show impact case relat european car industri find document report situat european car industri fall sale countermeasur comput secur statu comput secur regard network comput anim find discuss impact comput anim film industri import european union econom polici marriag find document report presum marriag michael jackson lisa mari separ german arm forc find document report polit arm forc germani eu fish quota find inform fish quota eu restrict topic particip team pick topic languag provid prepar manual translat addit languag searcher popul document collect particip search document collect finnish provid standard machin translat spanish collect english collect team found languag pair case search procedur team chose full search searcher topic descript written languag understand system find relev document document collect searcher instruct favor recal situat pai translat document avoid pai translat irrelev document searcher answer question specif point experi languag skill complet search topic complet system compar system solicit gener feedback experi design searcher perform half half search limit minut time requir session approxim includ initi train break team chose focu sole document experi design searcher scan frozen list document standard queri automat select relev topic descript queri gener combin present order searcher system standard facilit comparison system chose order sought minim interact examin averag adopt latin squar design similar previou evalu present order topic vari particip combin topic order present order matrix shown tabl addit particip ad group matrix evalu section describ common evalu measur data individu team support addit evalu activ measur ident searcher block block system system system system system system system system system system system system system system system system tabl present order associ topic system data collect search type data set document select relev searcher option attribut durat assess confid judgment valu rank list document identifi creat rank retriev system list submit team document team queri formul reformul submit rank list queri refin iter evalu measur set document select relev produc unbalanc version van rijsbergen measur call recal valu valu recal prior model case miss relev document find document pai turn relev comparison averag measur system test order system search particip team encourag augment comparison addit measur base analysi data list assess assess questionnair observ statist relev assess provid relev assess nativ speaker document languag document judgment made searcher support reliabl comput top document rank list produc search iter search system relev judgment assessor immedi assess pool document assess specif judg particip team express interest team submit experi sic maryland team form jointli bbn technolog maryland group document select sic sic experi center measur assess text nativ languag searcher compet hypothesi test nativ languag significantli reason expect assess slower reliabl foreign subject fluent level year sic system develop part clariti compon year experi salient featur interfac panel user store result assess process debrief question ad year protocol investig user confid judgment compar passag extract system automat extract approach base syntact semant pattern base main verb sentenc argument pattern show basic inform sentenc languag searcher document languag languag searcher passiv languag abil goal experi discern approach support rapid accur select relev document bbn maryland compar summari construct automat headlin gener word stori summari document languag searcher searcher fluent standard translat basi condit headlin automat produc document remov grammat constitu tree lead sentenc document length threshold met hypothesi test headlin support rapid assimil topic document accuraci group experi full maryland focu maryland experi queri formul iter queri reformul hypothesi provid greater insight control queri reformul process improv usabl search yield greater accuraci reformul particip interact system system provid descript translat control translat system perform fulli automat queri translat queri languag english document languag searcher spanish experi test document summari base phrase document select experi queri reformul experi basi document translat approach interact search phrase translat summari word origin gener order magnitud faster full machin translat user perform search system system gener possibl relev noun phrase user pick phrase automat system translat phrase search document natur user interact system translat select noun search perform phrase translat summari queri languag spanish queri languag english document languag hypothesi search phrase translat summari case yield compar search approach base queri translat result discuss result measur shown tabl design evolv rapidli year year design includ evolutionari improv year growth log file analysi preclud quantit evalu sic result group experi condit experi queri formul refin maryland automat queri translat maryland queri translat queri translat document translat experi document select sic foreign languag doc sic nativ languag doc passag pattern hedg tabl result number particip team level team particip particip sixth team provid rank list document select task bit sooner good time futur make point venu evalu interact individu research run design studi explor aspect topic uniqu strength commun draw advanc state art interact clir requir includ inform comput interact research team draw broad rang includ team interest special serv enrich dialog bring research perspect particip evalu framework evolv import expect greatest legaci result discuss idea share possibl continu process start assess process leverag work side contribut addit relev judgment interest studi assess process research team world work interact natur venu report result share idea discuss relat task search narrow topic interact question answer idea consid decid commun interest serv year rel stabil evalu particip research team build result year reason explor futur extent bound futur forc add valuabl dimens compet resourc good idea world constrain choic made spirit explor afraid explor radic idea interest direct question answer yield interest interact task track imag retriev work interact search spoken document retriev interest interact search speech natur challeng track seek meet real natur expect involv user research point interact clir commun hope direct journei thousand li measur distanc ancient begin singl step past group achiev interest import result time step acknowledg indebt peopl organ fernando lopez wrote evalu script maintain web site distribut martin creat assess ellen coordin relev wang provid translat english spanish collect carol peter continu support encourag refer dougla oard evalu inform document select carol inform retriev lectur note comput scienc van rijsbergen inform retriev
DB/374 3 acm symposium comput june rotat polygon minimum enclosur victor miami depart mathemat comput scienc abstract algorithm implement rotat polygon polygon pk polygon find rotat translat polygon place overlap version algorithm implement solv rotat minimum class find minimum area solut minimum enclosur algorithm rectangl fix scale copi fix convex arbitrari rectangl minimum enclosur pure translat minimum enclosur bound minimum area experi determin largest practic minimum enclosur import applic algorithm industri problem discuss paper practic algorithm numer techniqu robustli calcul polygon set minkowski rang intersect polygon rotat rang angl introduct number industri gener part cut stock sheet industri gener nonoverlap layout polygon shape fabric layout permit finit set orient pattern fabric limit orient translat manufactur small research fund technolog corpor fund award alfr sloan nsf grant subcontract nation center grant depart consum affair tion typic larg make differ cloth util glass sheet metal grain stripe layout materi arbitrari orient part problem manufactur solv minimum enclosur polygon pk fix place polygon overlap case overlap denot case goal find layout pk minimum enclosur find layout pk minim measur common version industri strip minim length rectangular fix width minim area valu dozen hundr translat version minimum enclosur expect run time minimum enclosur algorithm exponenti layout softwar replac human hope heurist layout problem translat demonstr algorithm modest excel tool creation heurist larger valu expert human perform case work base pack column wai heurist algorithm subset polygon pack tightli union treat singl polygon paper examin valu practic solv rotat minimum enclosur problem switch heurist give perform main issu run time numer robust result paper present algorithm robust implement rotat polygon minimum enclosur implement algorithm implement multipl polygon minimum enclosur algorithm rectangl fix scale copi fix convex arbitrari rectangl minimum enclosur bound minimum area experi determin largest practic minimum enclosur properti distinguish algorithm heurist abil kei detect algorithm rang intersect polygon intersect rotat rang angl ff fi origin algorithm integr rang intersect framework develop origin solv translat enclosur paper show rang intersect linear circular arc boundari practic algorithm comput rang intersect approxim polygon manner suitabl algorithm earlier translat algorithm numer demand appli polygon set intersect minkowski sum collect polygon repeat output implement exact arithmet number bit requir repres coordin grow exponenti cascad quickli crash naiv round arithmet implement paper present hybrid techniqu nearest pair round implement polygon set oper float point arithmet nearest pair round exact arithmet ensur creat version exact arithmet numer cascad relat work essenti approach layout heurist simul genet combin comput geometri mathemat program heurist limit theori solut sourc layout softwar limit practic fall human cloth util number survei heurist recent work simul anneal boundari match group polygon genet algorithm driven layout hybrid approach heurist approach tailor sheet metal permit rotat chazel introduc place convex run time bound nonconvex al improv recent work deal find largest copi convex find minimum enclosur convex run time log extens case analysi linear program place singl convex convex run time algorithm clear run time case parametr program find solut solv linear program translat theoret practic success combin comput geometri mathemat program algorithm practic solv ten polygon minimum enclosur prove number theoret run time bound includ log place nonconvex log place minimum fix orient rectangl paper survei result translat relat algorithm previou work gave formula place polygon formula work translat rotat case previou translat algorithm gener work polygon branch bound paradigm gener translat algorithm handl rotat case manner call true gener translat algorithm algorithm present true gener true gener requir robust set oper subset subset repres valid configur singl polygon place set valid rel posit polygon respect configur set dimens curv surfac boundari numer robust wai implement set oper branch bound paradigm cascad set oper manner extrem stress numer algorithm present requir set oper polygon robustli true gener run faster current implement robustli algorithm present repres practic tradeoff run time numer robust outlin section algorithm rotat minimum enclosur rang intersect section analyz rang intersect algorithm construct polygon approxim section nearest pair round algorithm section result algorithm rotat algorithm approach gener previou practic translat algorithm essenti approach mathemat program algorithm input algorithm set polygon pk polygon case minimum replac set configur assign translat rotat polygon simplifi conveni replac addit polygon complement fix translat rotat case goal find configur overlap polygon complement mean pk lie insid configur call solut case minimum goal find nonoverlap layout fit minimum area abstract algorithm languag translat work hypothesi set constraint configur restrict add set constraint elimin solut evalu attempt find solut hypothesi satisfi split hypothesi solut resid constraint algorithm gener root set constraint solut satisfi restrict hypothesi evalu restrict empti set find subdivid hypothesi evalu success call solut hypothesi solut algorithm stop find gener set solut note find solut solut translat find solut rotat case minimum enclosur algorithm act time find solut establish upper bound area minimum upper bound constraint restrict discov solut output solut hypothesi minimum area possibl solut hypothesi solut establish area run algorithm output slightli smaller upper bound diminish upper bound solut roll back diminish upper bound upper bound establish numer accuraci appli symbol perturb solut establish solut smaller area algorithm numer root hypothesi hypothesi algorithm ff fi ij ff fi bound angl ij planar region case translat solut minkowski fa set ij root hypothesi work rotat defin rang intersect rotat angl rang intersect intersect copi rotat ff fi lemma construct root hypothesi rotat lemma solut rotat ff fi solut translat fi proof ff fi fi solut rotat translat case rotat set ff fi root set ij equat equat solut satisfi constraint equat hypothesi case minimum set set rectangl fix set similar copi convex set equal element size equal upper bound suffici larg trivial find postpon discuss gener section restrict previou work translat establish type geometr restrict linear program restrict restrict deriv equat appli case rotat rotat origin assum polygon origin tripl geometr restrict replac ij ij ih stop polygon diminish area threshold fraction repetit lead numer difficulti deal nearest pair round geometr restrict exact algorithm special essenti exact formula case geometr restrict linear program restrict gener empti solut current hypothesi evalu develop practic algorithm rotat overlap minim find translat rotat minim sum overlap pk algorithm perform rotat layout pk insid rectangular find layout minim width fix full paper show gener compact minim area scale convex enclosur area arbitrari rectangular problem evalu algorithm simpli consist run rotat overlap minim set addit constraint deriv current hypothesi compact base linear addit constraint convex addit constraint angl equat translat equat ij replac convex hull minimum enclosur algorithm find solut compact layout local minimum area establish upper bound area local minimum case base output evalu translat satisfi equat output layout rang intersect fi case subdivid angl rang output satisfi equat algorithm essenti algorithm translat algorithm explain differ full paper subdivid angl algorithm select polygon total overlap polygon maxim current translat rotat output closer midpoint fi algorithm divid rang divid rang midpoint rang fi fi gener gener root hypothesi fi replac fi add constraint gener analog minimum area rectangl enclosur section minimum enclosur algorithm case rectangl fix width variabl length replac ij subset ad constraint previou constraint hold case scale copi fix convex polygon case minimum area rectangl arbitrari length width requir sophist root hypothesi summar idea add addit polygon region xy enforc arbitrari rectangl area greater approxim xy polygon rang intersect section gave definit rang intersect polygon intersect copi rotat angl ff angl fi origin rang intersect planar region bound line segment circular arc circular arc concentr origin set convex minkowski sum principl implement oper section gener overlap minim algorithm requir switch linear program quadrat convex program difficult handl intersect circular arc numer robust make difficult implement intersect minkowski sum section establish complex rang intersect linear complex approxim polygon suitabl algorithm approxim subset error proport complex linear implement construct approxim rang intersect theoret complex lemma rang intersect complex proof construct concentr trapezoid analog standard trapezoid vertex extend arc direct interior termin arc hit boundari procedur cut linear number concentr region bound line segment concentr circular arc intersect rotat copi fl fi ff set set endpoint arc angl fl lie insid clear arc li singl concentr trapezoid rang intersect concentr trapezoid comput independ constant time concentr trapezoid rang intersect concentr trapezoid meet boundari nice fashion easi show complex boundari union linear number arc line segment polygon approxim order comput polygon approxim perform radial trapezoid vertex extend line origin figur radial trapezoid polygon approxim direct interior termin line hit boundari figur show type radial trapezoid form polygon approxim complex case arc outer line segment approxim arc tangent line tangent endpoint middl parallel outer bound line segment case polygon approxim intersect lose middl part topolog illustr figur lemma ball radiu polygon approxim rang intersect suffici small fi proof approxim subset shown arc boundari longer basic show approxim outer arc error fl time radiu tangenti approxim arc error fl time radiu figur polygon approxim trapezoid topolog differ outer radiu thick concentr trapezoid origin trapezoid independ fl suffici small topolog chang figur occur individu radial trapezoid approxim satisfi condit union lemma properti ensur substitut polygon approxim rang intersect actual rang intersect algorithm algorithm subdivid angl accuraci approxim squar angl rang expect divid angl rang time obtain accuraci ffl practic algorithm full paper describ lieu construct full circular trapezoid complement monoton rai origin intersect region singl line empti set impli monoton compon bound function polar coordin comput minimum angl size ff window rotat origin comput maximum slide window angl ff comput polygon approxim minimum curv outer polygon approxim maximum curv curv bound approxim rang union compon complement union rang union nearest pair round previou give method geometr round line segment reduc coordin maintain consist topolog geometr round absolut case output oper repeatedli input section summar geometr round nearest pair round techniqu current implement polygon intersect minkowski sum previou shortest path nearest pair round round lattic point float point coordin round method round integ lattic nearest pair round simpler shortest path larger numer error discuss method exact arithmet work algorithm exact round algorithm nearest pair round repeat round step round step nearest pair vertex pair edg vertex creat actual round resum round stop pair featur farther threshold edg intersect round step creat vertex midpoint vertic move vertic vertex edg endpoint vertex creat vertex edg origin vertex move edg endpoint origin edg broken edg vertex endpoint round step pair vertex form angl endpoint theorem nearest pair round converg introduc intersect proof kei nearest path round perturb introduc minimum distanc featur appli round step featur ignor pair angl endpoint measur minimum featur separ time actual minimum round move featur actual perturb time actual minimum featur separ partial order set line order number number length longest length longest ad intersect point round vertic break edg form shorter edg round arithmet round algorithm float point arithmet oper appli nearest pair round exact arithmet measur distanc round step expect numer stabl stabl hundr cascad oper result algorithm implement overlap minim line polygon set line line overlap minim experi run dec alpha roughli speed intel pentium ii figur target output length figur target output length polygon altern compact posit figur ran minut dump run time minut accur algorithm evalu verifi solut shorter polygon ran algorithm industri part vertic good find minimum length enclosur quickli shown figur bad challeng system input length previou hour evalu verifi solut length run target closer previou figur target output length figur hand compact figur target output length figur target output length rang intersect method practic minimum enclosur gener minimum quickli requir long time verifi modif speed algorithm search hypothesi space individu polygon pair time speed make bad choic polygon angl spend time investig angl worth pursu translat section involv perform complex set oper curv object difficult make oper current result demonstr algorithm worth effort special case true gener essenti formula solv case experi translat work solv case possibl case reason amount time forget paragraph mention manufactur small tilt experi paper run full rotat small rotat rang intersect algorithm practic larger valu refer largest placement convex polygon insid workshop algorithm foundat juli pk motion plan convex polygon polygon environ placement de form rigid ou phd universit de polygon placement translat rotat annual symposium theoret aspect comput lectur note comput scienc page irregular shape nest place evolutionari approach ieee intern confer cybernet comput cybernet simul page octob chazel polygon problem advanc comput volum comput page jai daniel algorithm nonconvex polygon applic layout phd harvard daniel strip pack order compliant proc acm workshop appl comput page daniel multipl translat part approxim algorithm pack problem european journal oper ka wb solut approach irregular nest problem european journal oper august typolog cut pack problem european journal oper abd techniqu nest irregular shape base rectangular modul current advanc mechan design product green yao comput geometri proc annu ieee sympo found comput page singl polygon mathemat program technic report work paper pennsylvania state depart industri manag system algorithm problem comput oper page guiba david round arrang dynam proc annu acm sympo comput page han na approach nest cut problem neural network simul anneal journal engin comput upper lower bound nest problem lectur note comput aspect automat nest irregular shape proc spie int soc opt eng spie intern societi optic page soc opt octob richter optim blank nest simul anneal journal mechan march nest complex part irregular boundari journal mechan li compact algorithm nonconvex polygon applic phd harvard li compact separ algorithm nonconvex polygon applic european journal oper doubl gener techniqu calcul line segment intersect round arithmet proc annu ieee sympo found comput page round face lattic plane abstract conf comput page translat polygon minim enclosur linear program base restrict proc annu acm sympo theori comput page daniel translat polygon minim enclosur geometr algorithm mathemat program technic report center research comput appli harvard multipl translat part exact algorithm victor practic method set oper polygon exact arithmet proc conf comput page victor shortest path round page victor rotat polygon overlap minim annual acm symposium comput geometri version accept comput theori vj daniel translat polygon minim enclosur mathemat program intern transact oper research prasad set heurist algorithm optim nest shape blank comput kp rao slide algorithm optim nest arbitrarili shape sheet metal blank intern journal product june cut pack research bibliographi journal oper research algorithm nest pattern comput integr manufactur intern world scientif vol page world pf bg autom pack review industri implement spie intern societi optic page septemb
Agents/375 1 dissemin mobil agent distribut inform filter wolfgang kurt rothermel institut parallel distribut system germani abstract claim benefit mobil agent technolog reduct commun cost area inform filter applic mobil filter agent effect coordin account current network difficult achiev contribut situat data distribut remot data server examin mobil filter agent present approach coordin agent minim commun cost valid studi cost save constel show save achiev face actual internet condit introduct claim benefit mobil agent technolog reduct commun applic latenc reduc load network predict made scenario inform filter mobil agent travel larg remot data examin local return compar small result situat data distribut remot data server examin filter method explor benefit mobil filter agent perform task situat present major problem solv success employ mobil agent scenario knowledg current network condit agent model simpli requir agent abil perform remot copi code remot server start argument send agent remot place reduc commun depend fundament characterist network connect agent platform data server employ agent coordin order achiev effect reduct commun cost decid agent platform replica agent data server respect replica examin assum host network agent platform figur present dissemin mobil filter agent data transmit agent platform data server note agent transfer origin base platform receiv agent dissemin process result transfer data download agent platform data server base agent platform transfer agent code invoc paramet figur dissemin mobil filter agent sketch idea solv problem recogn approach gather repres knowledg network characterist extend valid develop call network distanc map scalabl effici access distanc comput network present approach coordin dissemin mobil filter agent introduc concept dissemin describ mobil agent data server agent examin show algorithm comput dissemin schedul schedul minim commun cost result examin remot data server remaind paper organ discuss dissemin problem formal section relat work section briefli introduc approach network distanc map section map basi comput effect dissemin present section section evalu commun cost save constel section report cost save real applic context inform retriev dissemin problem system model model network set host function assign distanc pair host assum distanc nonneg symmetr pair host connect due host network failur model infinit distanc network host call data server possibl store data public access set data server denot network host provid platform host mobil agent set agent platform denot explicitli assum host agent platform assumpt unrealist commun cost function amount ship data network distanc sake simplic present evalu section product function approach special distanc distanc express number round trip bandwidth problem formal dissemin problem set data server de amount data examin data server se de amount data result examin data server sr de size mobil filter agent base agent platform agent code initi result deliv symmetri assumpt approach construct network distanc algorithm comput dissemin schedul reli dissemin schedul describ dissemin agent coordin filter set data resourc consist sequenc agent transfer replic form tree figur node tree repres agent platform agent edg tree correspond agent transfer repres tree agent replic order repres child node schedul assign visit agent platform data server examin platform interest reduc commun cost matter send clone child agent migrat children examin local send clone altern speed reduc number exist replic agent dissemin schedul formal denot set agent platform visit function de assign agent platform examin data server access server data agent move assign platform function src fbg describ sourc agent copi respect agent platform commun cost result execut dissemin schedul agent transfer cost se data transfer cost sr result transfer cost denot distanc host network defin dissemin problem problem find dissemin schedul minim cost function complex show dissemin problem number agent platform jaj sketch polynomi reduct steiner tree problem steiner tree problem base weight graph set node problem find minimum cost span tree node arbitrari steiner tree problem fn establish dissemin problem assign comput polynomi se sr de fd de de jd aj special version dissemin data server reachabl agent platform download cost cost dissemin problem determin agent transfer cost optim solut minimum span tree agent platform connect respect data server show solut steiner tree problem solut special dissemin problem vice versa polynomi algorithm solv dissemin problem satisfactori qualiti meet scalabl requir deal larg number agent platform data server relat work mobil agent perform aspect rare examin perform model singl interact procedur call sequenc interact network characterist inform size request scenario differ account aspect gather relev network order agent distinguish agent platform data server assum static assign platform data server examin ranganathan al present mobil agent applic consid current network characterist agent dynam replac chat server latenc chat client minim server client latenc frequent measur client solut complet measur distanc scale scenario possibl internet host involv problem similar dissemin problem fundament differ hinder adopt techniqu develop multicast rout multicast group persist larg number messag particip chang group remain multicast rout adapt path time network condit group member contrast group agent platform involv specif dissemin problem valid singl messag mobil agent set multicast group singl agent dissemin extrem network load group member wide distribut creat predefin group combin involv platform requir exponenti number group altern remain problem determin group agent platform special scenario dual problem agent dissemin problem document replic larg client popul bestavro present approach document replic hierarchi proxi server hierarchi set home server optim criterion proxi maxim number document request satisfi proxi contrast network distanc explicitli consid seltzer suggest partit client host cluster geograph close locat host replic perform independ cluster differ approach hierarch improv distanc measur network import differ approach interdepend singl replic agent copi agent platform receiv agent code dissemin process data server examin agent neighbour cluster network distanc map section overview approach repres distanc comput network detail descript discuss approach found valid perform basi larg scale measur internet distanc map comput basi set measur server measur distanc arbitrari network host assum agent platform adopt function basic idea partit set measur server agent cluster close connect host repeat partit process final obtain tree structur node repres cluster host cluster refin direct tree leaf node correspond singl agent platform addit data server assign closest agent platform evalu cluster criteria experi articl base min aim minim maximum distanc host cluster paramet determin number cluster set host divid cluster tree extend distanc valu sibl node distanc sibl cluster estim averag distanc arbitrari agent platform belong cluster distanc sibl platform directli deriv network measur distanc data server closest agent platform figur show graphic cluster tree partit cluster distanc cluster cluster cluster cluster network agent platform data server cluster platform agent platform server closest distanc data figur cluster tree comput basi agent platform distanc deriv tree denot distanc ka agent platform estim distanc children common ancestor auxiliari function cl map data server closest agent distanc agent platform data server estim dk argument estim cluster tree directli result network measur maximum simpl distanc agent platform closest agent platform order obtain distanc estim data close connect cover cluster tree deriv distanc feasibl linear linear tree depth transit extens comput dissemin schedul present approach comput dissemin schedul step describ basic algorithm solv dissemin problem suboptim polynomi time appli mechan hierarch network achiev hierarch strategi algorithm satisfi scalabl issu algorithm requir avail paramet dissemin present section relev network distanc basic algorithm basic algorithm comput suboptim effect schedul greedi heurist improv current solut ad agent platform set visit agent platform largest benefit regard commun cost initi solut client server solut data server examin base agent platform trivial schedul solut fbg function src agent transfer occur client server solut origin schedul comput extend schedul src includ addit agent platform includ set visit check data server examin agent de determin closest agent platform agent transfer src src closest closest closest min cost function comput cost relat dissemin schedul compar cost schedul formul algorithm comput suboptim dissemin minim commun cost figur complex comput extend schedul cost requir step iter algorithm main loop comput jaj ja initi examin data server base platform av comput extend solut includ av cost result schedul includ minim current add current schedul av av improv od figur basic dissemin algorithm extend schedul comput solut includ agent transfer upper bound tight achiev algorithm run polynomi complex enorm larg number agent agent transfer data server hierarch algorithm base distanc map improv scalabl basic algorithm develop hierarch version exploit abstract network cluster network distanc map main idea cluster tree appli basic algorithm set sibl cluster start base agent leaf node cluster tree point perform basic ancestor base platform check place copi agent node sibl node save commun cost check appli basic algorithm section set node consist node sibl node receiv agent leaf node agent special agent assign select child node achiev greatest benefit agent comput cost dissemin altern select receiv agent parent check benefici sibl agent copi appli basic algorithm figur show scenario process tree start base platform node sibl node copi agent case step repeat parent node benefici sibl exist parent node benefici sibl detect node receiv agent select rightmost child forward agent agent copi addit agent platform result schedul shown side figur agent platform label number cluster tree data server assign agent platform function omit sake simplic result schedul formal src function omit node receiv agent special node check node receiv agent node check benefici sibl figur hierarch schedul cluster tree result schedul complex discuss paramet describ size cluster denot tree depth denot maximum number children node algorithm run time optim precomput function assign data server ancestor cluster tree feasibl import aspect complex hierarch algorithm execut basic algorithm compar small set sibl node subset data server belong consid node data server relev schedul comput ancestor cluster sibl agent transfer occur schedul comput sourc agent copi number schedul comput cluster tree agent sibl check base ancestor addit sibl check combin run time tree server platform equat differ equat basic algorithm factor obtain hierarch order magnitud jaj run time estim hierarch algorithm addit agent copi result addit schedul comput level cluster tree expect tree faster averag case valid present valid cost reduct achiev dissemin mobil filter agent perform internet measur distanc number hop number network router exist path round trip time time transmit simpl datagram packet remot host methodolog perform network measur internet tool determin rout path internet host result data deriv number hop rough estim round trip time succe support host router detail discuss caveat found web server internet offer perform measur locat arbitrari internet host compil set web server addit host perform measur measur server total measur successfulli measur subsequ reli distanc measur default median respect distanc metric median metric median basi comput cluster tree min criterion inform measur methodolog detail analysi cluster tree found order evalu qualiti comput dissemin schedul ran test seri assum measur server provid agent platform network measur compar cost tradit client server approach cost result applic dissemin schedul test scenario ran test distinct base agent platform distinct data server present result averag run size agent normal data amount multipl agent size order reduc number variabl graphic present set se amount examin constant data server result size assumpt restrict valid experi set result size achiev similar result se result basic dissemin algorithm explor qualiti basic dissemin algorithm network distanc directli measur reli cluster tree vari number data server amount examin data graph figur show achiev cost reduct number agent transfer averag cost reduct defin agent solut server experi distanc metric small data amount quarter agent size data server cost reduct achiev data size time larger agent size data server cost reduct addit commun cost result agent amort data server cost reduct larger number data server significantli number agent transfer depend roughli linearli number data server data amount depend valid larger data amount number agent platform number reason agent limit number data server data amount number data server data amount figur basic dissemin cost reduct transfer number data server data amount number data server data amount figur basic dissemin cost reduct transfer point number agent transfer independ achiev cost reduct assum data server platform mobil agent upper bound achiev cost reduct explor bound perform test larg data amount data server reduct scenario ran base distanc metric result depict figur observ cost reduct higher metric reason effect found empir distribut distanc metric distanc distribut small deviat variat larger lead fact averag distanc data server closest agent platform averag distanc data server closest agent platform measur filter agent transfer closer data defin distanc number agent transfer higher metric depend number data server data amount similar upper bound cost reduct scenario data amount data hierarch dissemin algorithm evalu qualiti hierarch dissemin algorithm network distanc deriv cluster tree result cost reduct shown figur cost reduct higher basic algorithm hierarch hierarch algorithm base network distanc deriv cluster tree distanc estim real basic algorithm hierarch algorithm base abstract cluster consid group data lead accur estim cost reduct achiev hierarch algorithm advantag basic algorithm compar hierarch larger number data server data amount number data server data amount figur hierarch cost reduct metric metric number data server data amount vanish data amount data server interest observ neg cost reduct data amount data server found distanc agent platform close connect data server gener underestim cluster tree cost estim solut includ agent transfer optimist result observ neg cost reduct effect vanish larger number data server larger data amount achiev cost reduct determin result estim upper bound scenario data amount data server metric metric valu basic algorithm characterist number agent transfer similar basic algorithm discrimin approxim effect determin mention approxim effect distanc cluster contribut effect dissemin schedul result hierarch algorithm comput dissemin schedul linear algorithm basi distanc deriv cluster tree surprisingli achiev cost reduct equal hierarch algorithm show effect schedul distanc basi cluster tree empir run time final interest remark compar real run time comput schedul test seri observ comput hierarch algorithm turn time faster basic algorithm expect effect dramat larger number agent platform cost distanc map cost save calcul experi network load process construct maintain network distanc map cost difficult assess relev depend number client make network map servic profit draw servic network commun identifi larg varieti applic profit network distanc map rang replic servic kind distribut object repositori cost distanc map depend distanc measur method desir accuraci measur bandwidth overhead higher measur current round trip time variat scale respect metric import factor distanc updat current round trip time highli dynam successfulli estim acharya saltz found sampl describ current distribut current round trip time remain valid minut detail discuss cost construct maintain network distanc map found applic requir distanc subset interest network host applic smaller distanc map construct set consid host reduc set address prefix document document cost reduct cost reduct queri term basic basic multicast invari tabl cost reduct test queri applic section present applic profit mobil filter dissemin interest inform sourc applic scenario applic idea construct special search call domain recogn document belong domain domain expert roughli work incom queri forward tradit search engin list uniform resourc locat receiv document url relev expert domain relev document includ expert knowledg base user queri answer order achiev effici examin remot document mobil agent filter process applic dissemin algorithm size agent remot document return tradit search engin develop filter compon recogn scientif articl english prove filter effect queri detail domain expert filter compon scientif articl found achiev cost save evalu employ dissemin method typic occur context search scientif articl queri submit altavista result list url collect elimin link invalid point document document remain link examin filter function agent dissemin cost reduct calcul base assum measur compil experi previou provid agent platform measur distanc host document relev queri host stuttgart measur assum base platform size filter agent code kbyte document size tradit search engin amount data back remot filter agent domain expert byte document document document recogn relev tabl main result evalu tabl show queri number document examin domain number scientif articl found page manual analysi cost reduct metric dissemin algorithm conclud dissemin mobil filter agent significantli reduc commun cost applic cost save larger metric larger basic dissemin algorithm futur work contribut shown employ mobil filter agent significantli reduc commun cost examin remot data server present algorithm comput effect schedul dissemin mobil agent valid basi extens internet measur experi shown hierarch cluster agent platform improv effici schedul comput order magnitud basic dissemin algorithm effect approach comput dissemin schedul appli arbitrari scenario commun messag send recipi recipi set host messag send occur agent dissemin scenario scenario replic dissemin scenario host forward messag host role agent platform recipi role data server cost function futur work concentr improv distanc estim cluster tree estim turn major reason effect cost save hierarch algorithm decoupl applic agent dissemin construct network distanc map intend appli approach coordin employ agent scenario refer studi internet delai technic report depart comput decemb www traffic reduct load balanc cach ieee special issu parallel distribut vol januari march pp architectur global internet host distanc estim servic proc ieee march ieee press understand white case geograph proc conf hot topic oper system detail decemb document softwar rm reduc combinatori problem complex comput jw plenum press pp mobil agent proc int work conf distribut applic system septemb octob chapman london mobil program proc usenix ann technic anaheim januari perform model mobil agent system proc int conf parallel distribut process techniqu applic la june juli volum pp comput network prentic pp effici dissemin mobil agent proc ieee int conf distribut comput system workshop web base austin sun al ieee pp maintain special search engin mobil filter agent proc int workshop cooper inform agent juli august wei lectur note artifici intellig juli pp dynam distanc map internet technic report comput scienc juli
ML/376 6 quantif evalu metric classif ricardo ibm tj watson research mill river usa daniel ibm tj watson research po box yorktown usa abstract paper bia evalu metric classif inform uniform tradit evalu metric lead natur measur distanc bia evalu metric give practic measur observ distanc bia evalu metric correl differ predict accuraci compar version learn algorithm differ evalu metric experi domain show expect accuraci differ gener measur correl actual differ learn algorithm simpl search weaken complex algorithm learn result show interact learn compon kei factor understand learn perform introduct symbol classif rule evalu metric serv assess potenti express featur logic combin express construct final hypothesi select featur node common tradit puriti quantifi uniform puriti subset induc express instanc kind includ inform gain gain ratio statist white laplac gini index paper studi bia adopt tradit evalu metric limit case express previou work defin bia tendenc metric favor express follow definit bia prefer partial order space candid express question address metric favor metric differ rank express show bia adopt metric uniform enabl compar differ bia measur distanc bia evalu metric comparison tradit metric measur quantifi similar metric explor connect measur differ predict accuraci learn algorithm built evalu metric multipl experi domain show expect accuraci differ gener measur correl actual differ learn algorithm singl featur singl rule correl coeffici question complex learn tree correl coeffici conclud interact compon learn algorithm account fulli explain accuraci perform organ paper section review definit tradit evalu metric section bia number induc subset defin measur distanc bia evalu metric section describ experi domain discuss section extend summari preliminari classif avail train set train made train vector point featur space label class unknown target function assum train consist independ ident distribut exampl obtain fix unknown joint probabl distribut space exampl class split function express restrict logic repres featur logic combin featur target concept assum logic form evalu metric quantifi qualiti partit induc express train subset train jt jt train express divid fx fx set cover set cover complement set divid coverag concept complement figur show class valu number exampl class number exampl cover class repres number figur defin probabl estim data definit tradit evalu metric maxim output inform gain entropi figur express valu class probabl estim data gain ratio statist log gini laplac bia metric defin section share common express base puriti induc subset evalu metric function number posit neg exampl cover express complement altern defin function coverag coverag figur inform gain function coverag posit neg express contour plot show line coverag plane set learn simpli express simplic renam posit neg exampl cover metric extend plane defin variabl defin plane coverag plane metric defin section plot coverag plane bound total posit neg exampl figur plot inform gain number posit neg exampl point evalu equat fact account coverag complement reflect symmetri maximum valu attain extrem point induc subset class uniform bia line answer repres order evalu metric point coverag answer result project coverag plane point project plane line line constant extent coverag plane figur show line obtain project inform gain coverag plane line point height line join mean valu line cut space line move parallel extrem point arbitrarili lower half coverag plane shown figur long monoton extrem point line divid half space lower region encompass point prefer point left upper region bia evalu metric determin shape line contour obtain project coverag plane evalu metric project line shape coverag plane differ order rank express distanc bia evalu metric proce explain method quantifi distanc bia evalu metric find singl line evalu metric fix point coverag plane repres line pass function map valu line left upper half coverag plane divid half space left upper region prefer lower region ro figur differ bia metric repres area cm cm point posit region coverag plane chosen depend valu independ variabl denot contour line metric pass point point lower half coverag plane laplac function defin fix point hp solv equat gener contour function order ensur definit valid entir coverag plane contour function return neg number repres denot posit threshold equat repres famili line laplac function definit distanc bia evalu metric fix point metric defin distanc metric area line metric pass point formal area line written ffi defin ffi dp integr total number posit exampl captur disagr figur show project singl line metric correspond point intersect line shade area line quantifi differ bia equat interpret assum express coverag coordin express metric order coverag coordin fall area curv metric equat measur metric singl point natur extend equat gener measur dissimilar metric simpli averag size region space coverag coordin measur dissimilar defin ffi jrj ffi denot set point coverag plane numer approxim equat focu attent equat quantit comparison test effect posit evalu ffi effect conduct seri experi figur show coverag plane equal class proport half plane divid tabl comparison evalu metric pair metric laplac laplac laplac gini region point line perpendicular end extrem point point label carri comparison evalu metric defin section appli equat point goal experi determin metric similar effect evalu express region coverag plane comparison mathematica obtain numer approxim equat result shown tabl coordin row number top repres result evalu equat number bottom show fraction area cover top number respect area entir half space coverag plane area half space figur equal gener area equal analysi tabl show differ inform gain gini prove metric share bia observ statist simpli constant factor time inform metric project line coverag plane leav open problem proof gini project line bottom tabl smallest differ averag gini inform gain magnitud differ gain ratio inform gain differ gain ratio gini distanc laplac function show differ notic tabl differ pair metric point point conclud ceil effect chapter occur point qualiti express region close optim floor effect occur point proxim forc metric assign low credit express region highest differ expect region upper lower bound restrain agreement bia skew class distribut answer effect skew class distribut coverag domain unequ class proport map coverag plane stretch wide tall depend domin class line perpendicular axi line connect extrem point line attain maximum size popul class grow larg rel class shorter size line difficult distinguish differ bia express lie close line point skew class distribut import factor compar effect evalu metric learn highli skew distribut lead metric yield similar gener fact differ detect equal class distribut experi section attempt give practic measur defin equat gener expect disagr distanc bia ffi interest compar differ predict accuraci result evalu metric determin measur correl perform differ experi learn algorithm algorithm conduct search space logic express repres conjunct featur liter valu final hypothesi rule cond cond class cond boolean featur class assign satisfi rule model justifi fact obtain consist train data target necessarili ly point coverag plane test measur region coverag plane algorithm perform space conjunct liter outlin figur algorithm learn algorithm beam width metric singl hypothesi rule liter list liter beam ff liter liter form conjunct beam liter track evalu metric elimin poor express break beam ff combin end major class return figur learn algorithm return singl rule final methodolog tabl compar perform learn algorithm search singl rule conduct evalu metric tabl report version algorithm algorithm inform gain gini perform pair column column list domain extract uci repositori domain extract tabl andrew column tabl averag locat final express rule coverag plane region closest region point final region closest entri column result averag algorithm run region coverag plane final express li averag algorithm domain tabl order base valu column assign domain region entri column region region column tabl show proport posit exampl train set entri found averag proport posit class train set run algorithm present train column tabl predict accuraci achiev domain stratifi averag repetit number repres standard deviat previou initi discret step make featur boolean featur discret catlett nomin featur boolean featur nomin train set divid half conduct beam search logic express mention half serv valid current express avoid statist error multipl comparison run perform ibm model test util measur test util measur defin equat experi row tabl averag predict accuraci algorithm domain comput absolut differ predict accuraci pair algorithm comput averag distanc bia pair evalu metric tabl result match averag distanc bia metric averag accuraci differ averag distanc bia gini laplac map absolut accuraci differ algorithm gini linear regress model appli data yield correl coeffici tabl predict accuraci domain hypothesi number repres standard deviat concept region proport predict accuraci class info gain gini gain ratio laplac statist vote cancer star cluster promot mushroom region hepat zoo credit game heart region diabet region point strong variabl interdepend measur differ accuraci perform result similar experi summar tabl entri show correl coeffici obtain fit linear regress model data result group column column domain column elimin effect skew class distribut filter domain proport rang leav total domain skew distribut experi produc correl coeffici improv relat measur differ predict accuraci evid comput equat assum class distribut similar domain analysi assum equal class tabl show result experi similar group domain region coverag express final rule hypothesi highest correl observ domain group region skew distribut elimin entri column tabl model analysi limit result hold learn algorithm address relat measur differ accuraci hold complex algorithm answer question report addit experi experi simpl algorithm output final hypothesi repeat experi report correl coeffici compar row result tabl domain elimin skew valu experi complex algorithm tree hypothesi correl coeffici result show number learn compon algorithm weaken correl measur differ predict accuraci evalu metric compon alter learn fail understand interact compon result poor understand perform tabl correl coeffici data compar measur differ accuraci hypothesi correl coeffici experi domain domain skew dist averag averag region averag region averag region robust analysi effect tree continu partit featur summari paper bia tradit evalu metric show project evalu metric coverag plane plane axi repres number exampl class cover yield line constant shape line prefer express bia lead natur measur distanc bia evalu metric result show correl measur differ predict accuraci learn model built evalu metric singl featur singl result show correl weaken interact compon compon learn algorithm learn section conclud kei element understand differ perform account interact learn compon futur work extend result distanc bia learn model appar design learn studi initi step understand differ perform produc explicit model partial order space serv quantifi amount agreement bia model acknowledg grate se june apt valuabl suggest work support ibm tj watson research center refer collect problem field student research worker classif regress tree wadsworth chang continu attribut order discret attribut european work session learn empir method artifici intellig mit press multipl comparison induct algorithm machin estim multivalu attribut fourteenth intern joint confer artifici intellig san morgan kaufmann uci repositori machin learn empir comparison select measur induct machin program machin learn san morgan kaufmann layer search empir learn fourteenth intern joint confer artifici intellig san morgan kaufmann evalu metric bia applic unpublish ibm tj watson yorktown bia measur tree induct machin mathematica book wolfram media
DB/377 3 reconfigur queri execut plan distribut dbm kenneth ng wang richard muntz eddi comput scienc depart inform scienc laboratori california llc lo ca usa ca usa abstract massiv size grow demand support data mine result queri extens support data wareh analysi applic parallel queri evalu requir accept perform queri frequent process suboptim due inaccur estim queri characterist statist prior queri system configur resourc avail queri evalu distribut dynam reconfigur queri execut plan adapt environ queri mean significantli improv queri evalu perform base oper algorithm coordin step reconfigur introduc altern execut context checkpoint restor syntact extens sql relev characterist user defin function support dynam reconfigur system present introduct grow demand support data mine massiv result queri requir parallel process deliv reason perform queri system configur resourc avail workstat farm environ uncommon introduct abstract data type function extens dbm applic domain data imag inform make difficult estim intermedi data size udf oper queri optim treat udf opaqu oper consid optim static optim method optim queri execut satisfi todai queri process requir parallel queri execut plan specifi process manipul data produc result queri subtask call oper configur refer composit connect data parallel oper assign processor present approach improv queri perform extens distribut dbm dynam reconfigur parallel object advantag cost estim inform queri statist select adapt chang system configur resourc avail avail comput resourc effici util evalu time long run queri minim reconfigur includ option reassign task chang data parallel import part perform reconfigur ensur correct complet queri result mean erron result produc correct result gener address issu studi oper bring oper state modifi configur oper migrat data partit merg global aggreg local aggreg restrict scan data figur sampl queri execut plan introduc erron result lose valid context carri oper execut context partial sum count averag forward newli configur oper oper semant great impact context manag identifi characterist relev dynam classifi oper method captur restor execut context section present overview work support dynam reconfigur parallel queri execut plan section devot discuss oper coordin context manag suggest sql syntax extens udf registr support reconfigur featur result reconfigur section discuss relat work section section summar paper present outlook futur work reconfigur overview parallel queri execut plan parallel queri execut plan specifi process manipul data produc result task assign workstat farm environ multipl oper group execut behav maxim perform oper refer basic macro oper essenti distinguish oper clone data instanc process portion input data knowledg oper input order great impact optim perform simpl select sale illustr case record retriev descend index order number basic oper function implement algebra oper enforc physic properti sort data record ordbm number builtin function queri express abstract data type udf introduc express complex data structur queri requir user defin minima udf oper dimens arrai find grid point smaller shown figur creat function integ extern languag paramet style variant null call sql extern action final figur registr udf udf characterist part user defin memori area assign udf context execut space alloc execut udf defin delet execut summari inform process data item carri forward execut influenc behavior futur comput ordbm informix illustra support oper comput function fashion design resembl queri evalu paradigm support data stream process assum oper run stream process environ oper execut call iter queri stream oper read input object sequenc dictat posit data produc output modifi oper context set valu initi context null memori oper process input dynam optim overview dynam optim dynam optim period measur system perform queri characterist metric run time problem analyz perform parallel divid concern effici collect execut environ statist cpu network queri characterist select perform evalu varieti statist provid inform predict workload network traffic dynam optim dynam optim consid reconfigur cost addit execut cost addit cost dimens complex search queri plan dynam program techniqu find plan maximum estim throughput finit number futur time period residu execut time point start divid fix length time period system statist queri characterist begin period estim base measur inform period includ reconfigur overhead optim make maxim aggreg throughput start dynam program algorithm comput maximum expect throughput begin period end period estim configur lead perform queri plan perform determin execut process modifi queri plan consist oper bring oper state reconfigur perform deadlock miss state save state inform includ buffer input output record oper execut plan state initi execut environ modifi includ move buffer input output record reinstat comput restart comput phase execut parallel option implement phase chosen base semant oper respect cost focu discuss oper coordin state reconfigur form form plan modif oper reloc oper instanc processor similar process migrat major differ semant oper exploit context data process effici implement migrat data stream modifi distribut polici oper consum clone chang output data distribut polici altern consum clone send record altern record modif data parallel number clone oper data distribut polici produc oper adjust send clone proport record regroup split merg oper macro form reconfigur oper reloc oper replac semant algorithm place transform semant algebra exchang order commut oper pipelin reconfigur classifi oper classif oper oper coordin context manag option deriv present complet end execut context oper initi statu oper point oper return initi context end oper call complet project period oper class return initi context iter constant queri aggreg function comput dai averag ibm stock close price input consist daili close price chronolog order sporad contrast period number iter return initi context data depend bound oper sporad oper comput monthli close price averag input stream ibm stock close price record chronolog order fix length memori oper class properti execut context depend input record constant return priori udf comput busi dai close price run averag input stream daili ibm stock close price record chronolog order effect record read iter disappear fix number input context rebuilt process fix number record variabl length memori contrast oper fix length memori input record time limit effect effect input record context data depend bound variabl length memori oper comput dai run temperatur averag input stream consist measur temperatur record chronolog order context oper class oper comput monthli averag ibm stock close price input consist unord stock price record class oper coordin perform reconfigur leav consist state requir met oper involv reconfigur reconfigur plan parallel queri execut plan view structur set oper instanc direct commun channel respect data stream commun oper instanc produc data stream produc oper instanc consum stream consum consum produc oper instanc top ultim consum produc data stream oper oper instanc bottom level ultim produc consum data stream oper instanc oper instanc suspend arbitrari optim oper complet number iter reach suspend point oper reconfigur lower cost optim delai context captur period oper point cost captur restor context minim discuss design issu coordin algorithm detail found deadlock situat occur coordin issu consum empti input buffer middl iter input data produc suspend prevent case deadlock transmiss requir bound algorithm consum suspend oper instanc requir start iter output buffer room hold output addit output buffer reserv consum clone receiv request time due network delai produc receiv due consum insert special tag output queue consum clone ensur consum clone awar clone suspend coordin algorithm outlin identifi root send request involv clone root clone root oper suspend reach suspend point clone root oper produc root oper request suspend process continu oper instanc group suspend point note algorithm optim oper instanc involv figur identifi involv coordin algorithm appli involv evalu continu modifi oper produc suspend oper state reconfigur action oper save buffer wait oper coordin phase modif perform parallel context manag oper context manag refer maintain execut context oper instanc perform plan reconfigur simplest case oper context option complet context captur wait oper instanc execut context context null strategi delai oper point dynam checkpoint period reconfigur checkpoint record option chosen context manag oper instanc checkpoint record initi checkpoint record evalu resum note reconfigur checkpoint record oper instanc success iter suspend requir captur processor state inform program stack limit reconfigur option oper reloc homogen machin checkpoint oper suitabl case checkpoint method applic oper replac newli elect oper ident intern data structur learn method altern situat checkpoint inappropri checkpoint oper origin udf save context set context udf udf origin udf udf input output number iter input output input output output context learn figur checkpoint context learn learn context learn build udf context process record describ reconfigur learn method reconfigur oper replac extens form reconfigur straightforward found replac oper instanc oper instanc semant creat coordin algorithm connect produc consum connect initi record input execut learn mode input record produc fed execut parallel learn discard output send consum output record receiv number input record reject arriv data process record input buffer buffer accept input record execut normal mean send consum produc record destroi context learn reconfigur record oper instanc process order context answer depend oper class process oper instanc fix length memori iter term order process record difficult variabl length memori oper class current context depend read record counter number read record greater assur context state hard determin context oper instanc read record impract case learn method suitabl class oper implement perform extend syntax function registr sql syntax extens statement registr udf support reconfigur featur shown figur ital text style oper creat function extern languag reconfigur class complet period sporad fix variabl checkpoint learn order partit rang figur extens udf registr reconfigur option appli udf pair function defin captur restor context checkpoint function oper consid learn function determin context establish number data object process learn function defin learn method consid period sporad fix length memori variabl length memori oper input stream order partit polici constrain parallel udf registr shown figur userdefin minima function complet udf routin checkpoint oper defin result implement distribut version queri drawn applic domain creat function minima integ extern reconfigur class complet checkpoint languag paramet style variant null call sql extern action final figur udf registr local minima pressur earth surfac oper scan function retriev surfac pressur prescrib time interv chronolog order record pass minima udf extract locat local minimum sea level pressur constraint list local minima time track udf link form wind direct workstat run suno mb memori experi start udf assign machin machin lightli load cpu time queri machin extrem heavili shortli queri cpu time cpu time due comput intens migrat minima udf trigger dynam optim detect minima udf consum cpu time decid instanti clone minima udf reconfigur illustr figur clone track minima machin machin minima initi track minima machin migrat track minima machin machin figur reconfigur experi ucla climat model data set sea level pressur wind record storag size gb execut time approxim minut execut execut plan workload chang dynam reconfigur initi oper assign machin minut execut plan minut minut improv high compar initi compar plan note execut plan chosen time workload extrem high moment incur overhead consist plan search plan modif environ paramet estim cost plan modif includ oper context manag checkpoint measur plan search dynam program algorithm approxim system paramet predict total overhead experi execut time proof plan search plan modif system param estim cost dynam reconfigur evalu comparison plan plan plan reconfigur minut figur experi perform analysi concept track checkpoint cost learn method context note plan search cost configur estim cost fix reconfigur form plan modif cost low make dynam reconfigur benefici relat work relat work area exist work complet satisfactori limit restrict function replac scan oper relat address inaccur estim data select collect statist system reconfigur unprocess portion improv perform major differ work reconfigur point oper partial pipelin data flow consid work consid dynam reconfigur parallel execut expect adt extens reconfigur option consid research oper udf consid research intermedi result materi plan modif work practic case larg volum data set method execut context desir intermedi result algorithm reschedul oper scrambl queri plan due data arriv delai network compar work consid gener case method context captur restor intermedi result materi function wide studi recent year publish work optim queri evalu studi udf execut data parallel interest compar classif reconfigur classif parallel similar reason approach context rebuild udf requir input stream order effect record read disappear effect record read udf handl unord input stream irregular execut context pattern attempt improv perform long run queri execut reconfigur suboptim fly overview dynam optim algorithm extens ordbm approach model context characterist udf enabl optim obtain suffici inform reconfigur coordin algorithm suspend involv oper instanc perform reconfigur introduc option support context import remain work respect dynam reconfigur studi effici measur dynam optim sensit userdefin function system configur data characterist great impact make predict model system variabl data statist kei trigger reconfigur mechan reconfigur fly motiv improv queri techniqu appli case fault import queri evalu involv larg data wareh analysi applic reconfigur run due resourc failur altern fault toler execut dynam queri easili execut mobil comput environ system configur chang anytim refer dynam queri optim proc april livni technic report technic report depart comput januari dewitt parallel challeng opportun invit muntz design implement queri execut environ technic report june gm kb wang queri optim ibm famili data engin graef al extens queri optim parallel execut volcano queri process advanc graef wj mckenna volcano optim extens effici search april lm haa al starburst dust clear ieee jm hellerstein jf naughton queri execut techniqu cach method proc acm jm hellerstein stonebrak predic optim queri predic proc acm ibm sql refer informix illustra user manual informix februari parallel process aggreg scalar function dbm proc acm dj dewitt effici queri execut plan proc acm ap languag manipul arrai proc rr muntz dynam reconfigur parallel queri execut plan technic report depart comput septemb ramakrishnan case enhanc abstract data type proc seshadri ordbm enhanc data type proc acm rr ng scalabl exploratori data mine distribut data proc mj queri scrambl initi delai acm load share facil heterogen distribut comput system technic report april
ML/378 6 journal artifici intellig research submit publish reason fuzzi descript logic iei pisa itali abstract descript logic logic manag structur knowledg reason individu defin set individu common properti experi dl applic shown case extend capabl context multimedia inform retriev lead convinc dl treatment inher multimedia object content retriev paper present fuzzi extens combin zadeh fuzzi logic classic dl concept fuzzi reason concept support defin describ properti present constraint propag calculu reason introduct uncertainti receiv attent artifici intellig commun attempt extend exist knowledg system deal imperfect natur real world inform rule impress work carri result number concept number problem identifi number solut develop duboi knowledg logic basic unit relationship natur captur peopl encod knowledg sever limit abil repres uncertainti world lack knowledg real world fact estim true probabl abil repres inher exact definit exist fact true true decad substanti amount work carri context descript logic dl logic reconstruct knowledg aim provid simpl declar semant captur mean popular featur structur knowledg main point dl consid descript logic refer terminolog concept languag web page descript logic commun found address ai access foundat morgan kaufmann publish reserv attract logic knowledg base applic good express power comput complex famili knowledg system build respect complex complet build varieti applic baader experi dl applic shown case extend reason capabl dl context multimedia inform retriev point necess extend dl capabl treatment inher multimedia object retriev classic dl describ real multimedia retriev retriev multimedia object content queri system access inher relev multimedia object queri establish limit logic decid tout court multimedia object satisfi queri rank retriev object strongli system believ relev queri extend dl fuzzi capabl choic fuzzi set theori endow dl capabl deal uncommon tresp motiv semant point fuzzi logic captur notion concept clear definit fuzzi concept plai kei role content descript multimedia object human concept context content imag region mean fuzzi statement establish sentenc proof theoret point exist techniqu reason fuzzi logic present gener fuzzi base dl express repres dl adapt easili dl present literatur import point show addit express power impact comput complex point view import nice tradeo comput complex express power dl contribut popular note fuzzi extens manag knowledg complementari dl extens manag probabilist extens except shown hollund possibilist dl consid reason fuzzi dl probabilist extens enlarg applic dl address issu reason individu knowledg uncertain knowledg reason probabilist framework gener harder comput point rel probabilist case case complet axiomat miss comput problem address carefulli proce section introduc alc section extend alc fuzzi case discuss properti section section present constraint propag calculu reason section conclud present topic research quick alc specif dl extend fuzzi capabl repres dl introduc classic section fuzzi extens alc present assum alphabet call primit concept primit role individu concept role concept express collect mean set individu fol point concept unari role interpret binari predic concept languag alc build primit concept syntax interpret dl base notion interpret interpret pair consist empti set interpret function map individu element uniqu primit concept subset primit role subset interpret complex concept defin work assum metavari option subscript superscript note concept role map open formula fc fr fa fr fc fd fc fd fc fc fc fc formula repres letter concept interpret note assert assert express type instanc express type instanc student assert tom tall assert tom friend tim primit assert assert form primit assert form semant point interpret satisfi terminolog axiom terminolog axiom concept concept definit concept express form primit concept concept state exist specif relat concept ferrari reason fuzzi dl state ferrari sport car car concept definit express form primit concept concept concept definit state concept state tenni identifi kind sport tenni sport tool semant point interpret satisfi concept interpret satisfi concept definit knowledg entail subsumpt finit set assert terminolog axiom call knowledg base ka denot set assert denot set terminolog axiom call terminolog kb pure assert assum terminolog concept left hand side terminolog axiom cyclic definit present interpret satisfi model kb satisfi element kb entail assert model satisfi terminolog concept subsum respect model hold problem determin call entail problem determin call subsumpt problem determin satisfi call satisfi problem alc satisfi build expand terminolog substitut primit concept occur defin defin term kb work elimin concept concept replac concept definit primit concept stand absent part definit obtain replac concept concept definit directli primit concept kt kt left hand side occur hand side transit closur relat directli kt kt cyclic kt defin concept argument concept occur defin term concept definit argument concept substitut defin term process iter remain undefin concept argument concept definit yield terminolog ka primit concept occur ka defin substitut defin term yield transform nice properti obtain replac primit concept occur defin defin term restrict attent pure assert kb worth note process exponenti problem reduc satisfi problem exist techniqu base constraint propag solv problem donini conclud terminolog basket tenni video sequenc basket repres semant content interest retriev video queri queri concept video answer list hold reason fuzzi dl individu sport queri concept video video retriev hold fuzzi dl fuzzi extens directli relat zadeh work fuzzi set fuzzi set respect membership function assign element estim belong belong mean element membership function satisfi fuzzi set respect complement altern restrict membership function aim investig interest reader consult duboi justif choic min max bellman shown reason condit min max uniqu choic set intersect set switch fuzzi notion membership element wrt fuzzi set regard statement fuzzi concept interpret classic interpret fuzzi set concept statement membership individu member fuzzi set fuzzi interpret fuzzi interpret pair crisp interpret function map individu crisp concept membership function role membership function concept natur interpret membership function fuzzi concept wrt object domain object element fuzzi concept interpret similarli role interpret function satisfi inf equat standard interpret negat tresp note semant result view open order formula fc existenti quantifi view disjunct element domain inf relat open order formula quantifi view conjunct element domain concept interpret crisp fuzzi dual relationship concept fuzzi assert fuzzi assert express form alc semant point fuzzi assert constrain equal state video basket interpret satisfi fuzzi assert interpret satisfi fuzzi assert fuzzi assert satisfi set interpret notic combin restrict primit fuzzi assert fuzzi assert involv primit assert express form form reason simpli reli observ hard imagin situat assert strict relat leav easili extend case type assert reason fuzzi dl note work fuzzi assert form fuzzi terminolog axiom fuzzi terminolog axiom natur extens classic terminolog axiom fuzzi case syntax point fuzzi terminolog axiom fuzzi concept fuzzi concept definit fuzzi concept express form primit concept concept fuzzi concept definit express form primit concept concept semant point natur extens classic set fuzzi case fuzzi interpret satisfi fuzzi concept satisfi fuzzi concept definit note work fuzzi consid fuzzi form min drawback formul clear defin determin prefer reli standard interpret fuzzi subset fuzzi knowledg fuzzi entail fuzzi subsumpt fuzzi knowledg base finit set fuzzi assert fuzzi terminolog axiom crisp denot set fuzzi assert denot set fuzzi terminolog axiom pure assum terminolog concept left hand side fuzzi terminolog axiom cyclic definit present interpret satisfi model set fuzzi satisfi element fuzzi kb fuzzi entail fuzzi assert model satisfi terminolog concept fuzzi subsum wrt model hold fuzzi kb assert interest comput lower upper bound end defin greatest lower bound wrt defin upper bound respect inf determin lub call bound problem properti section discuss properti fuzzi logic properti proposit case easili extend order case concept concept involv note hold gener interpret entail relat similarli hold note true case impli lub determin reduct hold express languag modu ponen concept hold modu ponen role hold hold modu ponen support bound propag taxonomi support hold reason fuzzi dl note drawback properti long infer priori fix sound semant fuzzi semant sound wrt crisp semant fuzzi kb occur leav fuzzi assert role negat present crisp alc transform fuzzi assert assert part fuzzi extend fuzzi terminolog axiom easili verifi proposit fuzzi kb occur fuzzi assert fuzzi entail entail classic interpret satisfi fuzzi interpret hold induct structur concept shown satisfi similarli role fuzzi interpret satisfi satisfi satisfi gener satisfi introduc proposit hold gener set unsatisfi easili verifi restrict attent fuzzi relat immedi fuzzi assert fuzzi assert note definit dual proposit reli fact show fuzzi proposit kb fuzzi proof show deduct prove deduct prove build extens case straightforward hold firstord case involv proposit fuzzi kb occur fuzzi assert set fuzzi assert easili verifi confirm proposit subsumpt classic case method subsumpt concept wrt terminolog reduc case empti imag snapshot car major street european citi underli imag analysi tool imag imag semant imag index tool establish imag imag note weight keyword text quantit descript text wrt quantit descript imag wrt handl concept axiom ferrari car replac car ferrari car simplifi reason fuzzi dl ferrari imag infer easili verifi hold fuzzi assert hold conclud section analogu fuzzi case terminolog queri concept defin fuzzi kb deriv terminolog axiom replac fuzzi terminolog axiom underli semant video index tool furnish semant descript video video basket video tenni easili verifi hold video rank video retriev process algorithm fuzzi alc decid requir calculu loss gener pure assert fuzzi kb develop calculu style constraint propag method context dl calculu extend fuzzi proposit calculu chen kundu fuzzi dl case address entail subsumpt problem final problem subsumpt problem problem reduc entail problem procedur entail problem alphabet alc variabl interpret extend variabl map element interpret domain alc object individu variabl constraint express form alc concept role fuzzi constraint express note assert fuzzi assert constraint fuzzi alc variabl alc object call variabl definit satisfi fuzzi set set fuzzi primit constraint primit fuzzi constraint obviou easili verifi fuzzi entail problem reduc unsatisfi problem set fuzzi satisfi satisfi determin finit set fuzzi constraint satisfi base set constraint propag rule transform set fuzzi constraint satisfi preserv set clash model complet rule appli clash model set fuzzi constraint clash constraint tabl conjug pair fuzzi constraint entri tabl tabl clash tabl conjug pair condit pair fuzzi constraint conjug pair fuzzi constraint conjug exist notic conjug fuzzi constraint infinit conjug connect rule relat rule rule sequenc fuzzi constraint condit rule fire condit current set fuzzi constraint fuzzi constraint match precondit consequ constraint ad rule reason fuzzi dl variabl constraint set variabl constraint set variabl constraint set variabl constraint set exampl rule instanc conjug conjug variabl variabl set fuzzi constraint complet rule applic complet set fuzzi constraint obtain set fuzzi constraint appli rule call complet due rule complet obtain rule call nondeterminist rule rule call determinist rule easili verifi calculu termin complet finit set fuzzi constraint obtain finit number rule applic fuzzi assert fuzzi assert fuzzi assert easili verifi show verifi complet appli rule sequenc reason fuzzi dl sequenc defin sequenc clash sequenc clash prove prove relat verifi complet clash sequenc ferrari ferrari clash proposit finit set fuzzi constraint satisfi exist clash free complet termin easili case rule satisfi satisfi complet clash show rule sound assum interpret satisfi show satisfi satisfi satisfi exist clash free complet build interpret satisfi satisfi call canon model primit constraint collect lower upper bound restrict defin constraint satisfi constraint collect set truth wrt truth wrt truth tabl defin lower upper bound constraint satisfi min min tabl distinguish case set empti constraint tabl defin make small exist fact addit condit choic satisfi concern case constraint type show problem case introduc upper bound equal greater equal contradict exist sum primit constraint reason fuzzi dl interpret domain set object primit concept role induct structur fuzzi constraint satisfi case satisfi case similar case satisfi case similar case satisfi satisfi case similar case involv shown similarli case case satisfi case construct equat inf satisfi case shown similarli case satisfi satisfi case shown similarli show interpret build fuzzi assert shown construct complet complet branch show satisfi build interpret proof proposit freeli addit restrict choic equat choic free solut domain set easili verifi satisfi comput complex point fuzzi entail problem proven classic entail problem proposit fuzzi kb fuzzi assert determin problem termin algorithm crisp kb defin proposit entail problem crisp alc fuzzi entail problem requir exponenti space due problem inherit crisp case easili verifi complet concept variabl order requir polynomi smolka introduc trace rule oper rule modifi rule shown reason fuzzi dl variabl actual constraint set variabl actual set constraint rule appli object compel make nondeterminist choic constraint form conveni appli trace rule rule applic set constraint trace set obtain applic rule replac smolka shown set constraint satisfi trace clash size trace bound polynomi size polynomi space prove satisfi trace rule work start constraint set form gener reli donini set constraint set constraint obtain applic rule applic size polynomi bound size consequ role relationship remov longer carri addit inform step appli method check trace clash set constraint satisfi trace clash fuzzi similar trace rule easili defin correspond trace rule rule variabl actual set fuzzi constraint trace rule correspond rule defin similarli crisp shown set fuzzi constraint satisfi trace size trace bound polynomi size satisfi problem complet proof result establish import properti fuzzi dl addit comput cost paid major express power procedur subsumpt problem section address subsumpt decid concept fuzzi terminolog reduc case empti terminolog appli kb process loss limit attent case analogu relat hold easili shown proposit concept individu assum hold contrari interpret hypothesi absurd assum hold contrari hold interpret extent satisfi hypothesi satisfi absurd check solut restrict proposit shown proposit hold proposit establish proposit order check hold check entail relat respect valu equal greater due fact valu proof convert proof case similar proposit extend fuzzi dl lemma individu show satisfi satisfi assum satisfi complet set fuzzi constraint obtain replac show complet satisfi sequenc infer rule appli set fuzzi constraint obtain applic rule induct show sequenc infer rule appli set fuzzi constraint obtain reason fuzzi dl applic rule complet complet case rule applic complet case easili verifi rule applic complet show assum contrari clash contrari assumpt induct case analysi rule limit present rule proof similar verifi rule applic complet case easili verifi rule applic complet show clash free assum contrari clash case tabl easili clash contrari assumpt conjug pair fuzzi constraint tabl pair conjug pair contrari assumpt proven similarli lemma shown lemma individu lemma lemma proposit individu hold subsumpt problem reduc entail problem algorithm procedur problem address problem determin fact answer queri type fact loss assum concept normal shown case fuzzi proposit set fuzzi proposit form determin finit set greatest lower bound proposit wrt element determin comput greatest easi search order element perform binari search valu success entail test lub comput comput determin smallest proposit set fuzzi proposit proposit proposit easili extend fuzzi descript logic case quantifi chang valu proposit set fuzzi assert assert show satisfi largest satisfi mark trace compon queri assert deduct reason fuzzi dl complet start appli rule mark express type largest complet clash clash tabl clash tabl distinguish mark mark clash independ largest clash clash largest clash tabl assum conjug pair fuzzi constraint similarli previou distinguish case mark mark clash largest choic mark clash largest choic easili verifi case analysi rule mark clash largest choic easili verifi case analysi rule mark clash largest choic sum prove largest algorithm comput tabl binari search determin log fuzzi entail test futur work present gener fuzzi extens dl express repres dl fuzzi dl enabl reason presenc alc fuzzi alc concept semant point fuzzi concept interpret fuzzi set concept individu interpret sentenc syntax point lower upper bound complet algorithm reason algorithm solv entail subsumpt problem bound problem algorithm set min max pick min max set min exit set min set max step algorithm set min max pick min max set exit set max set min step tabl algorithm import point concern comput complex complex result show addit express power impact comput complex point view extens dl manag vagu yen introduc vagu simpl dl languag interest point includ languag definit vagu concept mean explicit membership function domain rang determin membership pressur low languag concept mean concept low defin idea alc tresp type concept modifi strictli languag defin tresp concept modifi semant point extens tresp languag straightforward cost pai express power comput complex algorithm point thing radic tresp linear problem gener inequ form op op op ident modifi function semant connector solv minimum comput solut solut comput reli method domain linear reason fuzzi dl simplex method similar approach fuzzi dl aspect consid tresp crucial wrt model multimedia inform imag video analysi tool provid fuzzi assert form infer work basi extend exist dl base system research open point clear reason case fuzzi gener form case cycl fuzzi kb interest topic research concern semant fuzzi connect choic semant connect consid huge number literatur impact semant point view question impact comput complex algorithm point view remain open acknowledg anonym review comment earli version paper extens paper refer knowledg infer system descript acm sigart terminolog knowledg system complet infer algorithm proc workshop process declar lectur note artifici pp repres reason probabilist knowledg mit press analyt formal theori fuzzi set inform classic knowledg meet realiti proc int conf principl knowledg reason pp morgan lo alto decid reason terminolog knowledg system proc int joint conf artifici intellig pp franc morgan lo alto decid reason terminolog knowledg system journal artifici intellig sound complet fuzzi logic system zadeh implic oper proc int sym methodolog intellig system lectur note artifici pp da system knowledg base formula predic calculu variabl annot express fuzzi terminolog logic proc int conf inform process manag uncertainti lectur note comput scienc deduct concept subsumpt instanc check journal logic fuzzi set system academ nj enforc full uncertainti proc nat conf artifici intellig pp washington approxim theori practic proc int sym methodolog intellig system lectur note artifici pp analysi logic probabl artifici intellig probabilist descript logic de confer uncertainti pp altern proof method possibilist logic applic terminolog logic annual confer uncertainti artifici intellig washington lopez de pool express descript fact proc int conf principl knowledg reason probabilist reason terminolog logic intern confer principl knowledg pp frg reason fuzzi dl tractabl probabilist descript logic proc nat conf artifici intellig pp uncertainti vagu knowledg base system germani fuzzi logic resolut principl journal model retriev structur document text imag european confer research advanc technolog digit lectur note comput pp itali logic multimedia inform retriev van logic uncertainti inform advanc model retriev vol kluwer intern seri inform chap pp kluwer academ usa relev terminolog logic inform retriev annual intern acm sigir confer research develop inform retriev pp switzerland comput complex terminolog reason back artifici reason hybrid system frg combinatori algorithm complex englewood jersei probabilist reason intellig network plausibl infer morgan lo alto back system overview sigart hard approxim reason artifici intellig attribut concept descript complement artifici probabilist terminolog logic model inform retriev acm intern confer research develop inform pp publish springer frg fuzzi descript logic proc nat conf artifici intellig pp usa note relationship fuzzi logic logic technic report istituto di dell itali reason experi zadeh fuzzi proposit logic technic report istituto di dell itali descript logic vagu knowledg proc european conf artifici intellig brighton ration decid fuzzi implic proc int joint conf artifici intellig pp canada mk gener term subsumpt languag fuzzi logic proc int joint conf artifici intellig pp australia fuzzi set inform
IR/379 5 fran eric steve lee gile featur select web applic roc inflect powerset symposium applic saint san januari featur select web applic roc inflect powerset prune fran eric glover steve lawrenc lee gile nec research independ nj inform scienc pennsylvania state pa abstract basic problem inform process select featur ensur event accur repres classif simultan minim storag process irrelev margin import featur address featur select procedur perform search featur power set find smallest subset meet perform requir major restrict exist procedur typic explicitli implicitli assum fix oper make limit statist structur featur power set present method combin design procedur finit direct set structur receiv oper curv featur determin maxim size featur subset rank problem search restrict smaller result reduct comput complex optim receiv oper curv end user select oper point cost function optim algorithm produc natur method boolean minim featur combin describ data oper point describ data common featur threshold tfidf data show result perform automat boolean queri modif gener distribut nich metasearch engin introduct basic problem inform process select featur ensur event accur repres classif simultan minim number irrelev margin import featur select smallest size featur set meet perform requir reduc storag requir comput requir ensur good gener final classifi featur select problem acut oper point end user unknown metasearch engin load bandwidth requir result desir oper point queri secondari sourc store index massiv quantiti web risk exact cost risk function end user advanc paper address featur select problem classif applic discret featur set object select parsimoni subset featur meet rang futur classif perform requir contrast featur select procedur explicitli implicitli specif oper point optim complet receiv oper curv receiv oper curv minim complet classif perform subset featur curv complet summar optim tradeoff independ dimens featur space roc classifi featur subset yield maxim recal level roc depend statist data roc curv captur ratio probabl true probabl occur dynam environ web flexibl redesign classifi optim featur select requir comput roc subset rank subset perform size optim featur set depend oper minim cover set select index number practic difficulti ideal approach size featur power set exponenti number prevent exhaust featur subset modest size optim effici procedur calcul roc singl subset densiti long design procedur comput roc data finit comput roc subset larg set class densiti element combin make featur select remark challeng problem exist featur select procedur problem complet roc implicitli assum oper point approach classif rate singl scalar metric proxi perform subset excel approach sophist notion markov implement metric entropi estim assumpt result significantli inferior perform oper point cost function lack flexibl adjust oper environ classif perform complet summar scalar obviou problem result incomplet understand perform exist induct procedur small data set research focu strategi guid search featur power assum perform subset reliabl repres cross valid control subtl crucial point order compar featur induct algorithm classifi structur subset optim exhaust induct approach exist featur select algorithm satisfi properti arbitrarili larg featur subset addit method differ exist approach due extens exploit statist properti induct algorithm finit data kei result analysi suffici data exist classif perform classifi obtain high probabl find optim classifi featur subset arbitrarili small featur subset size subset select procedur reliabl estim optim perform featur rank number featur limit approach dynam estim critic subset size dynam prune featur power reduc problem polynomi search problem paper arrang section formal featur select classifi design summar major statist result work start section defin filter structur form partial featur subset receiv oper curv show np design analysi combin roc filter structur defin method prune featur power set illustr perform algorithm synthet statist advantag classifi perform algorithm classifi structur manipul yield boolean minim featur combin describ data oper point describ data common featur threshold tfidf data section appli approach select featur repres confer call paper construct simpl classifi queri modif search engin subset classifi section summar design recent result describ perform method appli finit data assum fx assum featur featur threshold tfidf valu obtain document analysi carri straightforward manner assum valu finit alphabet assum input space class condit probabl fx fx featur subset consist obtain set input fx sampl denot bit string length adopt convent denot vector symbol vector element subscript frequent associ bit string integ featur subset classifi function assign element binari sequenc space form region class distinct classif rule separ class rule yield probabl alarm detect defin fx fx set ao oper point defin binari map featur set refer achiev oper set note switch output classifi oper point line connect oper point classifi produc oper point convex hull achiev oper set implement receiv oper curv set oper point yield maxim detect rate alarm rate roc effici summar inher difficulti separ class subset subset classifi ly roc refer roc support classifi exhaust classifi subset practic imposs trivial small case induct procedur requir find roc support classifi design procedur solut problem effici obtain roc support classifi class probabl infinit data method provabl effici method obtain roc theori string rank likelihood ratio function fx fx roc support classifi provabl found order alarm perform success assign string order likelihood ratio true class region roc support classifi make discuss concret provid simpl simpl test subset true densiti function roc support classifi develop np design shown pd achiev detect rate alarm rate classifi classifi document relev featur featur featur design approach search problem find classifi function maxim reduc search space dimens search space dimens enorm reduct complex exhaust gener induct procedur author reliabl provid roc class densiti class condit distribut unknown statist estim finit label data set set class condit densiti sampl space classif problem gener sampl element yield valu assum class distribut independ finit data set drawn independ class condit sampl yield success symbol class assum class data label correctli data comput class condit histogram densiti estim likelihood ratio estim finit roc calcul appli np procedur rank histogram bin bin bit likelihood ratio estim map set classifi procedur yield estim roc support classifi complet discuss propag error occur design procedur found major trend import binari independ set sampl true true detect perform bound region sampl estim detect rate assum sampl classifi posterior distribut pd pd estim alarm rate similarli local true underli alarm import result classifi bound locat true oper point estim oper point arbitrari confid pure function number data sampl evalu bound independ featur subset size local probabl posterior probabl occur interv set oper point obtain estim detect alarm rate classifi produc np design procedur defin curv curv estim perform curv result impli accur reflect perform set classifi suffici number data point irrespect number featur result consist gener theori gener theori method palo hill climb ensur rank classifi account error estim variat method address problem ensur optim classifi set found issu discuss set classifi produc np design depend order sort likelihood estim featur set size sort order corrupt sampl classifi found statist sort error depend exact form underli distribut gener trend exist intuit explain densiti estim likelihood ratio estim depend histogram bin count mass distribut remain concentr bin featur dimens bin count likelihood ratio sort error classifi produc optim featur irrelev perfect random effect amount data spread bin bin small bin count high probabl sort error true perform order true probabl mass found bin bin estim densiti distinguish sampl uniform class densiti sort equal case sort effect perform random assign true perform classifi return np design approach curv featur subset size point improv discrimin offer addit featur defeat error sort true perform classifi approach curv number featur train data set evalu perform procedur yield roc estim call naiv estim perform curv result increasingli optimist perform estim intuit number bin ultim sampl obtain true class occupi individu bin np design procedur label bin class yield perfect discrimin train set statist effect combin yield effect illustr graphic figur number featur fix data true perform curv approach perform perform classifi accur simpli probabl find optim classifi search neglig naiv estim perform curv diverg estim perform increasingli optimist featur subset size point exist critic size rigor studi design induct procedur mechan search set exist estim roc possibl error scale properti cost comput present author expect threshold effect induct pf pd roc figur classifi yield detect alarm rate determin roc curv estim perform curv summar estim perform set classifi produc np procedur finit data locat highli accur set classifi produc np procedur gener suboptim number featur bin label increasingli assign randomli curv naiv estim oper perform curv train data estim true perform classifi memor train data approach perfect perform algorithm rank classifi singl oper point evalu true backward select procedur common assumpt irrelev featur easili detect depend commonli recogn requir induct algorithm return reliabl estim perform singl classifi subtl crucial point induct algorithm provid classifi structur rank subset remov remov optim exhaust classifi space complet satisfi requir arbitrarili larg featur subset induct method exist featur select method meet requir lesser requir consist rank amount data np procedur filter structur roc curv section show partial order defin featur order conjunct statist analysi prune featur subset space note roc curv subset subset optim depend desir oper point perform featur subset select base roc number optim rang power set order featur subset order call uniform prefer establish roc curv denot pf pd pd pf pf roc curv featur subset li roc curv featur subset properti defin filter structur set power set featur present subset worst optim bayesian fusion procedur subset roc uniformli prefer convex hull correspond sampl classifi structur properti trend shown figur defin forward featur select procedur automat estim size maxim featur subset rank procedur shown graphic figur compar set size convex hull compar roc estim obtain statist improv featur subset remov high roc curv subset accur lie inferior convex hull obtain subset individu pf pd figur illustr select roc support classifi featur subset curv curv combin sampl yield roc curv convex hull curv featur subset prune search formal establish absolut order featur power set order sort featur set subset size order dictionari order featur indic subset point reflect fraction total number subset search reach basic algorithm shown tabl algorithm order featur subset curv calcul store start singl element subset current subset randomli split separ subset compar convex hull smaller featur subset averag li statist buffer distanc convex set remov constant pd pd pd pd standard deviat beta distribut detect perform estim set size reach fraction addit test remov subset classif perform significantli obtain subset obtain test remov random label assign stage improv rate converg end run synthet test case illustr perform algorithm simpl introduc section add irrelev featur class addit featur uniformli white variabl problem perform classifi gener roc curv subset equal roc subset expect algorithm rapidli prune search space set element extra featur irrelev classif implement algorithm dataset sampl class sampl class assum total ten featur dataset class split sampl sampl estim perform classifi test data cross valid exhaust featur subset subset calcul subset averag train set bia classifi detect defin averag vertic distanc calcul figur show valu scatter plot function fraction power set approxim mode shown figur support content gener diverg number featur initi execut calcul store randomli select subset calcul convex hull dp tabl algorithm forward filter featur power set roc estim result suggest addit approach prune power monitor prune subset averag bia exce threshold approach extrem reliabl practic bear investig suffici analyt result rigor defin threshold standard statist test properti beta distribut determin valid threshold algorithm tabl figur bia defin averag distanc function fraction featur space result individu subset curv show approxim mode region separ dash vertic bar correspond featur subset number element figur show fraction power set function current search posit subset consid full np procedur perform set prune due fall significantli convex hull subset due high accuraci random effect featur detect element subset consid due small size includ larg number larger major part power set rapidli prune procedur subset featur yield addit return ad featur chang critic filter exhaust figur curv show fraction featur power set direct calcul filter structur function fraction featur power set np estim perform curv label diagon correspond exhaust search figur show cumul fraction power set full np design function current search set power set curv show approxim featur subset larger subset elimin term processor result obtain number comput estim roc subset scale exponenti size subset filter exhaust figur curv show cumul fraction power set full np design function fraction featur power set curv label diagon referenc standard exhaust search region separ vertic bar correspond featur subset number element complex implement major comput effort involv perform design subset featur due sort likelihood ratio histogram bin calcul classifi label convex approxim linear length histogram cost np design order log constant featur subset integ current technolog integ oper exhaust perform featur subset approxim featur hour comput prune subspac significantli depend critic subset size np design procedur break nc subset length small rel total number featur nc rough estim calcul complex comput roc exhaust search subset size prune featur power set subset size comput problem chang admittedli polynomi problem critic subset size correspond limit approxim featur reduct repres improv size approxim practic size consid modest larg number featur prune approach combin heurist partit featur subset manag prune approach perform approach discuss note scope exist extend exist backward approach exploit fact featur subset critic limit search statist reliabl fashion queri modif text classif queri modif context build categori specif interfac user queri automat augment search term oper effect restrict queri result relev categori queri modif techniqu valuabl custom exist integr multipl distribut occur build categori specif metasearch engin metasearch engin forward queri larg number secondari search collat rank result central present user ad queri modif forward user queri secondari search fewer irrelev result return metasearch reduc bandwidth consumpt comput load meta engin site advantag search servic inquiru inquiru download web page queri return metasearch engin metasearch framework import predict recal alarm rate impli queri modifi search engin inform alloc server predict qualiti expect quantiti result produc search order result user queri modif fact search engin support boolean search queri modif gener conjoin user queri disjunct conjunct modifi gener featur bit string fx document featur featur extract procedur introduc part paper offer simpl eleg method comput suitabl boolean queri modif note binari express true class region roc support classifi encod modifi desir boolean form classifi subset featur correspond queri modif consist involv featur condit queri probabl retriev document desir categori maxim recal rate accuraci modifi concret assum class statist densiti simpl problem introduc section modifi recal expect posit retriev true class region classifi express modifi yield set document featur label data queri modifi extract featur select procedur obtain subset close convex hull construct point result curv correspond queri modif queri modif request nich search queri modif closest desir oper point practic queri modifi major area investig explor detail major problem secondari search engin limit oper queri length address problem framework procedur approxim simplifi modif appli boolean logic express simplifi minim lengthi express form hard problem queri modif gener categori defin track user onlin approach roc support classifi queri modifi number term queri equal rank classifi boolean featur subset classifi lower valu fewer shorter length group classifi group gener convex hull oper point search engin requir queri shortest modifi closest requir oper point group submit approach yield highli discriminatori queri modifi low low bottom left corner find short modifi high higher modifi relat binari encod class region negat yield modifi suit true class modifi correspond classifi oper upper corner roc system inquiru inquiru page correspond url return underli search engin download analyz improv rank user system stage approach short queri modifi provid pool candid complex classifi appli central oper point intermedi valu retain part benefit queri modifi queri modifi web search section illustr construct set queri modif detect confer announc site detect problem larg number page similar featur site high discrimin perform achiev account joint statist featur note announc venu call paper call paper page main confer page coincid combin manual automat total page relat confer retriev web page manual classifi posit class page set secondari servic restrict search text featur structur inform consid indic text featur occur titl page dictionari construct document number document class phrase record phrase class phrase rank ratio number time phrase true number time class top featur select featur calcul extract queri modifi classifi featur shown tabl figur show perform roc prune algorithm dataset larg data algorithm estim optim classifi subset featur reliabl perform curv suggest classif perform obtain model interact fewer featur subset calcul queri modifi disjunct term separ queri modifi group number featur modifi group convex hull oper point calcul modifi convex hull algorithm account statist variat beta function decid point includ paper submit accept readi date paper paper comput scienc fax inform interest tabl tabl phrase creat top rank queri modifi front modifi phrase denot phrase occur bodi text pf pd tabl select queri modifi figur convex hull oper point achiev queri group number featur queri modif ing queri modifi convex hull perform shown figur symbol queri modifi shown tabl queri modifi simplifi boolean order histogram modifi filter exhaust figur forward prune featur set featur problem vertic axi show fraction power set subset function posit search posit fraction search space note logarithm scale due larg dimens space larg number negat element relev featur counter intuit negat term requir problem due similar true class build modifi perspect role neg modifi result view term modifi describ relev document tenth modifi modifi written term make cut captur document term view correct assign describ secondari cluster relev criterion class featur statist valid featur select intens problem requir summar perform classifi element featur power set introduc method reduc problem exponenti polynomi flexibl select final oper point approach integr number result fact design procedur yield classifi increasingli random bin label featur subset size random result shift true perform diagon direct set relationship satisfi element featur power roc curv detect design procedur break restrict statist valid subset small comput cost small algorithm method perform statist valid reduct discret space make explicit data distribut roc curv offer protect uncertainti apriori class probabl singl set classifi monoton perform produc easili chang vari singl scalar paramet approach text repres discret alphabet threshold tfidf difficult accur model class probabl illustr extract queri modifi metasearch algorithm present exhaust subset critic size limit approach directli construct classifi group featur size thirti incorpor compon approach sophist search approach sampl power size featur subset process exist approach turn benefit significantli restrict search space result estim critic size limit exist induct approach construct backward select note care elimin featur rank perform procedur statist warrant refer featur subset select machin eleventh intern blum relev featur exampl machin artifici pp effect gloss text discoveri proc acm recal gloss estim intern confer parallel distribut inform system septemb stanford protocol internet retriev digit librari metasearch engin support user inform proc cikm pp koller optim featur proc intern confer machin pp morgan caruana attribut proc intern confer machin pp morgan irrelev ninth nation confer artifici pp langlei tree abstract work note workshop aaai van detect estim modul vol wilei duda pattern recognit scene analysi john wilei isbn classif featur select finit data sixteenth confer uncertainti artifici intellig pp june probabilist artifici vol subset select search probabilist proc aaai fall symposium isbn lawrenc page analysi improv web ieee internet vol pp lawrenc neci meta search seventh intern world wide web pp search commun accept public automat queri proc sattler gener extract queri data web proc pp boolean bell syst tech vol pp logic minim algorithm vlsi minim
DB/380 3 en informatica xml benchmark project ar ml mj buss inform system april report issn cwi po box gb amsterdam netherland cwi nation research institut mathemat comput scienc cwi part mathematisch dutch foundat promot mathemat comput scienc applic smc sponsor netherland organ scientif research cwi member european research consortium informat mathemat copyright mathematisch po box gb amsterdam sj amsterdam telephon xml benchmark project albrecht schmidt martin kersten daniela florescu ioana manolescu michael carei ralph buss po box gb san jose le chesnai abstract standard ort queri languag xml document draw research user increasingli focu attent technolog deliv challeng sheer amount xml document produc applic pose data perform evalu optim xml queri processor upcom issu long tradit xml store benchmark project framework assess xml abil cope broad spectrum di erent typic pose applic scenario benchmark intend implementor user compar xml independ speci applic scenario benchmark er set queri intend challeng primit queri processor storag engin workload consist scalabl document set cover major aspect queri process queri challeng rang stress textual charact document data analysi includ typic queri complement research result obtain run benchmark xml platform intend give rst illustr state art acm comput classi cation logic design languag keyword introduct xml data interchang format penetr virtual area internet applic bring massiv amount data content provid increasingli interest deploi advanc data manag system site data volum exce toi size complex challeng attract attent research commun earli effort concentr schema issu theori organ data lack fix incompat exist technolog sight xml gain momentum commerci product began market develop focu research specif technic issu physic introduct data queri perform start determin success failur solut develop major minor vendor grow scrambl leverag exist product rudimentari xml support pure relat data xml document product provid meet requir requir sketchi differ xml relat data easi implic underli data store fulli understood definit textual markup languag mean unlik case data element order string core data richer data float abstract data type extern provid schema avoid excess coercion data type cope tree structur xml document result intric hierarch relationship regular path express essenti ingredi queri languag evalu effici refer model relationship exce limit tree structur requir map logic logic oid effici manag earlier work map wealth properti exist data model undoubtedli guidanc prototyp implement top data object standard api direct access intern work drawn valid extent effect map remain unclear simpl extens product perform improv due interdepend system obviou advantag hard assess put quantit short benchmark deal design outlin issu past year commun develop rich tradit perform assess system rang research develop benchmark industri standard famili tpc benchmark mention exampl benchmark offer coverag gear data model flexibl possibl semistructur queri languag exce exist system limit benchmark version paper challeng featur tool kit evalu retriev perform xml store queri workload scalabl document set queri queri intend challeng queri processor import primit queri languag number examin queri processor prove benefici queri processor oper varieti architectur suit applic workload exhibit special characterist xml store deriv technolog textual inform retriev data structur persist object store product expect displai diverg behavior perform stress test system architectur benchmark document queri aid verif queri processor challeng problem high level queri languag introduc world problem xml xml queri processor expect freedom physic document attempt tackl combin freedom queri execut order charact namespac research regard output xml queri processor execut benchmark queri set exhibit detail workflow requir incorpor queri processor applic scenario benchmark user estim cost deploi system applic scenario answer question system fit motiv queri answer machin repositori xml figur workflow scenario xml process system consist logic layer physic distribut network make benchmark result interpret abstract system engin issu concentr core queri processor interact data store network commun cost java transform output test scenario depict figur applic run machin choic xqueri amalgam research languag data xml process standard languag choic major competitor field updat agreement semant standard defin target audienc paper divid group framework present vendor refin queri processor compar implement custom assist product provid simpl case studi pilot project essenti ingredi target system provid data framework tailor exist technolog xml set refin design algorithm rest paper structur motiv necess benchmark xml queri introduc structur document present queri give preliminari result obtain run queri test environ motiv exist benchmark cover plethora aspect tradit data manag rang queri optim transact process make establish techniqu store process clear natur data repercuss perform engin issu effect techniqu origin area argu benchmark specif xml queri processor evolut xml differ significantli evolut relat standard earli stage accept support larg commun perspect benchmark design result kind themat provid challeng typic queri primit combin tradit featur present xml process system result qualiti system engin benchmark descript shown document logic repres data structur map nice relat clear system handl effici document natur languag compar googl full text search favorit rdbm xml map give hint dbm architectur respond xml challeng summar textual order xml structur origin document incorpor featur make simpl queri system prepar challeng queri section string basic data vari greatli length pose addit storag problem type problem type rule queri languag tend clash gener string token xml queri involv hierarch structur form complic path relationship connect order queri tend requir join aggreg oper relat system compound schema xml document make queri formul tediou user point view null valu blow size user long complic path express author talk activ xml schema problem make document access reformul concept integr constraint xml context solv problem requir addit engin effort appeal xml gain popular quickli benchmark queri design address matter specif descript design xml benchmark requir carefulli model make behavior queri predict formul queri feel natur present challeng outlin characterist document closer technic issu gener document hierarch element structur nest element render tree structur xml document subsect describ structur document model deploi internet auction site main entiti open close categori relationship express refer except annot descript natur languag text element structur semant belong hierarch schema depict figur semant entiti mention item object sale sold carri uniqu identifi bear properti payment monei refer descript encod element item assign world region repres item parent open auction auction progress properti privaci bid histori refer bidder current default type auction time interv bid statu transact refer item sold descript item region site peopl person descript categori categori reserv descript edg mailbox mail annot bidder descript initi annot descript price homepag profil incom figur element relationship queri element close auction auction finish properti seller refer buyer refer refer respect amount item date transact type annot made bid process person email phone mail homepag credit card profil set open auction watch categori featur implement classif item categori graph link categori network entiti constitut structur part schema regular entiti basi person predict list bid order input relev stark contrast offspr annot descript element make dual xml length string intern structur vari greatli markup item format instruct charact imit characterist natur languag text ensur cover full rang xml instanc data structur tradit prose appendix impress document show snippet refer overview refer connect figur care refer featur deriv uniformli distribut variabl note refer instanc xml element point type xml refer interest object refer categori gener text gener text bear characterist natur languag analyz shakespear plai determin statist characterist text gener mimick distribut frequent occur word shakespear plai incorpor addit characterist relev perform assess descript seller author watch seller interest person categori annot item close auction open auction figur refer token text compress method commonli suffici assess text provid email address sourc electron phone directori care preserv import characterist origin time scrambl data combin similar techniqu avoid clash exist email address xml construct xml standard defin construct produc flexibl markup justifi definit queri challeng directli made restrict set xml featur data gener essenti xml process gener document entiti notat distinguish charact data charact data assum string type viewpoint storag engin dont includ namespac queri restrict bit ascii charact set provid dtd xml schema inform effici map stress addit inform exploit gener document design implement document call provid scalabl xml document obviou requir capabl produc xml document eager meet addit demand gener xml document platform independ user interest run benchmark download binari gener document matter hardwar oper system accur scalabl rang minim document factor arbitrari size limit capac time resourc time ideal scale linearli resourc alloc constant independ size gener document order reproduc document independ incorpor random number gener reli system random number gener document scale factor document size tini mb standard mb larg gb huge gb figur scale benchmark document basic algorithm found statist textbook unit implement normal distribut fairli high qualiti assign element dtd plausibl distribut children observ consist referenc number item organ contin equal sum open close provid accur scale scale select set number item person user defin factor calibr number match total document size slightli mb scale factor fig found result document size deviat anticip percent meet effici goal interest challeng refer creat place straightforward solut sort id referenc larg document solv problem modifi random number gener produc ident stream random number implement partit set item id referenc open close auction current requir mb produc document size mb gb pentium detail descript tool found document context ol stand import benchmark standard xqueri explicitli design data integr strictli assum document presenc doubt manag larg amount xml data previou xml benchmark effort design workload includ updat bulk date standard agreement exact semant updat resort xqueri syntax liter formul queri respect singl larg document commit specif scenario author experi problem document test awar size document larg system data gener offer mode output entiti file chosen user note modif version benchmark user make dtd id idref declar convert requir attribut valid parser check uniqu exist id idref respect path present assum singl remain local stress solut regard semant queri defin section differ matter execut singl document collect document queri semant document norm benchmark queri benchmark queri section list queri benchmark consist chose express queri xqueri successor quilt standard note queri set preliminari exact match simpl queri establish simpl perform primit unit establish interpret subsequ queri test abil handl simpl string lookup fulli path return item id regist north america return order access queri user gain insight dbm cope order xml document effici expect dbm handl queri order constraint return initi open auction return queri evalu cost arrai note queri harder evalu relat struggl complex aggreg select bidder element index return current open auction current high initi return complex applic index lookup case relat queri advantag aggreg index attribut execut queri akin aggreg tpcd benchmark list reserv open auction person issu bid person return stress textual natur xml document queri tag order sourc document cast string gener data type xml document queri interpret string cast string data type carri semant queri challeng dbm term cast primit addit schema inform dtd cast occur frequent sold item cost count return benchmark queri regular path express regular path express fundament build block virtual queri languag xml data queri investig queri processor optim path express prune irrelev part tree item list return count good evalu engin realiz complet document tree evalu express piec prose return note count aggreg requir complet tree cardin respect relat queri note tag exist document chase refer refer integr part xml richer relationship hierarch element structur queri defin horizont complex good queri optim advantag cardin set join list person number item bought close return return count list person item bought europ close return return return construct complex result construct element put storag engin stress context creat materi document view queri structur person record group interest profil person larg part person record repeatedli reconstruct avoid simpl copi origin translat french benchmark queri list person french markup result distinct return return fernandez al point cost gener textual answer creat materi view differ greatli note requir system construct materi view compar rel cost creat view versu output text interest join valu queri test abil handl larg result join basi valu differ queri refer chase queri refer dtd optim logic oid queri cascad size result set provid optim opportun note altern queri formul oper list number item sale price exce person incom return return count list number item sale price exce person incom return return count reconstruct kei design map determin fragment criteria complementari action reconstruct origin document queri test abil reconstruct portion origin xml document benchmark queri list item regist australia descript return full text continu challeng textual natur xml conduct search form keyword search scan studi isol interact structur essenti concept consid queri restrict subset document combin content structur return item descript word return path contrast section quantifi cost long path dont includ wildcard descend deep tree return queri check exist path select path predic print keyword emphasi annot close auction return confer return id seller auction emphasi empti return miss element test queri processor deal aspect xml element declar option dtd person dont return fraction peopl homepag high queri present challeng path system function applic queri put applic user defin function proof xml udf import user assign semant gener string type coercion convert currenc reserv open auction currenc function convert return convert euro return experi experi sort lack plai role order group queri requir sort gener string give alphabet order list item locat return aggreg queri comput simpl aggreg assign person categori note aggreg includ person relev data group custom incom output cardin group count count count count return experi experi benchmark activ evalu progress commerci research set evalu present meant illustr case studi full compar analysi system scope paper experi report section gather work monet xml intern structur access research vehicl xml process contrast find experi made relat system show similar behavior add fundament result report semant xqueri version queri check tool run benchmark document made project web site includ data gener queri set map tool convert benchmark document flat file map similar binari fragment deriv map desir experi monet xml base translat queri section monet execut algebra mil techniqu due highli fragment binari data model monet mil queri lengthi comparison compact xqueri extrem queri binari relat scan respect string translat thousand line mil advantag path summari monet xml formul assum queri formul time number present figur measur warm benchmark document scale factor dtd schema inform time measur silicon graphic server equip gb main gb scsi hard disk experi experi queri rp monet xml queri ms queri ms queri ms queri ms queri ms queri ms queri ms queri ms queri ms queri ms queri ms queri ms queri min queri ms queri ms queri ms queri ms queri ms queri ms queri ms figur perform monet xml scale factor pentium iii cpu clock mhz instal oper system redhat linux kernel version benchmark document scale factor gener indent bulk load mb time includ map relat tabl write tabl disk commit transact map process monet xml work dtd gener schema fly turn attent run time displai figur give preliminari interpret note queri repetit factor list queri execut environ queri consist tabl scan monet featur oper fast incur data volum queri establish perform scan tupl tabl map scheme queri provid turn part queri plan comput indic complex requir comput attribut determin bidder element index respect open auction ancestor complex queri plan higher innoc xqueri queri suggest run time high featur predic implement attribut store global order queri quantifi cost cast oper comparison monet cost coercion low respect rel complex queri execut plan ms execut note charact data origin includ store string cast runtim richer data type queri appli cach cast result regular path express challeng present queri monet xml evalu regular path express regular express search path monet xml schema sequenc element attribut tag encount experi experi sourc document surprisingli system access path effect plai role index queri execut complic path queri implement join refer attribut store chase refer monet xml amount execut string cheap comparison deem individu element similarli construct complex queri result point put xml process system test show path express join express queri simpl bulk work li construct answer set amount mb xml text monet xml spend total process time construct answer set compar time extract variabl origin data produc massiv amount output test abil cope larg intermedi result potenti buyer item interest produc million tupl challeng queri optim pick good execut plan insight data volum influenc queri output perform monet xml domin cost desir possibl featur xml store abil reconstruct document isomorph document bulk load show monet xml minut reconstruct tini fraction origin document basic action perform sort union order relat relev larg number lookup oid monet perform impress experi logic oid improv perform queri continu stress textual side xml execut search monet xml provid indic scan larg part scan word make execut data volum involv remain join neglig term process time estim influenc long path express versu short tabl path cheap longer path significantli time short counterpart avoid unnecessari stress schema xml document queri data queri execut plan comput intersect set queri primarili interest interest establish rel cost function applic sort oper compar system architectur perform favor binari fragment data model incur data volum comput easili fit main memori aggreg conclud queri set combin tabl scan set differ data model plan data volum addit present test relat evalu benchmark persist object store gmd note queri xqueri novic formul benchmark queri short phase problem languag mention point facilit queri formul enorm queri processor valid path express user sequenc tag exist great user simpl path evalu empti result dbm decid path express issu warn path express tag approach queri possibl lead result forward standard queri languag tremend facilit exchang idea interest parti simpl optim appli direct consequ analysi benchmark result monet xml queri execut sacrif gener note optim includ perform figur schema inform form simplifi schema creat fly monet xml reduc storag requir queri process inlin relationship path express storag engin monet collect make decid path sacrif origin semant document storag engin similar inform collect creation hash index achiev technolog optim chase refer materi destin node logic case refer avoid larg scan point replac gener string elimin cast achiev integr view intermedi result queri optim monet project gap document hard gener high cost reconstruct part highli fragment data show construct special index cost research topic present specif develop xml benchmark set queri lesson learn execut workload specif benchmark design standard issu xml start point queri captur essenti primit xml process data manag system path queri null hierarch data order data coercion data type discuss lesson learn run queri research monet xml demonstr singl gener map text document instanc divid line li queri stress textual natur document order constraint reconstruct queri queri stress perspect associ retriev schema inform schema queri hint characterist refer gener allevi problem compet design rule schema adher depend applic area expect work continu evolv futur import part complet applic scenario lack updat specif promin hope continu standard effort make incorpor updat futur commonli standard benchmark exist xml world good collabor effort refer schneider benchmark advanc technolog intern confer extend march volum lectur note comput page ceri compar analysi xml queri languag sigmod kersten mil primit queri fragment world vldb xml product xml boyer canon xml version brin page anatomi hypertextu web search engin comput maler extens markup languag benchmark xml data manag berlin naughton benchmark acm sigmod intern confer manag page acm shah benchmark sigmod acm sigmod intern confer manag page acm queri languag februari florescu xml queri languag heterogen data sourc intern workshop web page refer florescu kossmann store queri xml data ieee data engin suciu effici evalu xml middlewar queri acm sigmod intern confer manag grai transact process perform handbook meyer xml system enhanc structur map base statist intern workshop web conjunct acm page lee chu compar analysi xml schema languag sigmod kersten optim monet british nation confer volum lectur note comput scienc page set bad vldb intern confer larg data page de join queri oodb intern confer larg data base santiago de page sahuguet mistak made lesson learn technic xml store benchmark effici relat storag retriev xml document intern workshop web conjunct acm page massiv stochast test sql intern confer larg data page naughton relat queri xml limit opportun intern confer larg data base septemb page xml schema refer snippet benchmark document unit state eighteen page idl author profess monster remov rescu run peac oak assembl hole patienc mirror master yield offic embrac fear distinct ship descript charg graduat school
AI/381 2 phd depth audio signal classif david gerhard school comput scienc simon fraser bc canada report submit author written part phd depth requir school comput simon fraser februari content introduct motiv audio signal classif research applic audio signal classif audio signal classif fit scheme thing auditori class fourier analysi overview research relat audio signal classif auditori scene analysi pitch detect automat music transcript speech classif system requir featur cluster analysi durat classif depth featur extract physic featur perceptu featur cluster algorithm neural net success restrict cluster analysi durat fix analysi frame analysi hidden markov model abstract audio signal classif consist extract relev featur featur identifi set class sound fit featur extract group algorithm depend classif domain applic paper present background understand gener research domain includ signal spectral auditori scene analysi present basic element classif system perceptu physic featur cluster algorithm analysi durat neural net hidden markov model discuss relat asc techniqu present overview current state asc research literatur introduct paper present review state current research literatur pertain audio signal classifi begin introduc field asc continu discuss gener research field auditori scene analysi asc fit present classic recent approach asc motiv audio signal classif research human classifi audio signal time consciou effort recogn voic differ telephon ring task dont difficult problem sound weak similar sound find difficult door hall close main area motiv asc research instruct human knew gener system classifi treat auditori research answer question psycholog physiolog method comput asc system provid start point human asc research nice machin human sound doctor listen patient breath order medic expert system program asc remot area quickli consult human expert countri transport expert auto mechan car engin problem listen sound engin make run area human expert ear job asc expert system provid opportun work remot commun situat expert inaccess asc system potenti hear human comput perceiv sound camera perceiv visual world tape record voic mail system provid variabl speed user easili understood low content slow listen carefulli noisi complic section asc system construct automat alter playback speed constant rate inform potenti hear augment applic includ sound separ automat transcript code sound commun classif scope gener classif asc research problem segment solv smaller problem asc work conceiv result system connect time futur creat gener sound research classif clear individu asc problem solv individu system design task common asc problem tackl recent classifi piec sound broadcast sound sourc human speaker form music problem interest peopl system exist fairli task music classifi type classif music audio signal human speech classifi languag accent human word phonem spoken problem classic speech speaker recognit research work problem year research work specif sound data scope depend composit sound effect investig research work gener data retriev base featur similar templat match direct concentr transcrib data sound written includ music sound effect transcrib data found media radio princip direct research area creat system automat gener close caption identifi subject content media program applic audio signal classif asc applic potenti reach relev applic discuss includ speech applic automat transcript divid applic area comput tool asc number exist comput applic audio speech recognit obviou applic signal classifi phonem assembl word asc improv current speech recognit technolog wai speech mation emot idiom emphasi prosodi pitch loud speech convei rise pitch end question asc system develop identifi advantag prosodi creat automat text punctuat good subject piec speech recogn word system scan radio channel traffic improv perform speech classifi subject recogn word investig identifi accent prosod characterist speech subject comput wai speech music command recept speech recogn typic assum receiv music transcript system tend assum receiv music gener classif system set audio process tool system identifi incom sound rout whichev sound process applic obviou applic creation audio multimedia asc speed creation aid access melodi access direct human form hum whistl sing comput consum electron applic asc develop market product import order relev support govern industri grant program excel sourc research monet current research sourc fund futur research research benefit form consum human asc applic includ microchip present larger devic automobil asc devic telephon inform user type respond signal make call devic differ answer speech human speech depend gener action instruct telephon hang navig autom telephon menu devic radio detect mute sound blank pictur surf ad return origin channel program resum applic attract compani prefer ad mute surf compani endeavor produc classif softwar treat schedul program devic radio design search desir traffic report weather type music applic found fit discoveri left reader market research analyst automat equal equal bank filter sound signal signal alter depend rel amplif attenu signal filter channel intend result process equal signal higher perceptu qualiti origin signal problem process appli manual alter channel set set manual set requir person control automat equal analyz signal decid set improv signal applic signal identifi filter set appli enhanc signal signal set appli devic exist todai identifi feedback public address equal attenu channel channel feedback happen equal filter hear aid public address system modern hear aid collect filter situat user hear aid chang set automat equal system detect current environ appli filter set gener set specif environ audio signal classif fit scheme thing asc subset gener research field call auditori scene analysi discuss detail section page asa analysi auditori entir group sound listen hear moment sound mix singl individu sourc remain identifi comput asa comput analyz auditori scene part asa process stream auditori signal group signal repres sourc present signal difficult problem address research todai inform auditori scene divid individu stream analyz depend content asc pictur order stream stream asc determin stream stream speech stream asc research concentr consist singl auditori stream prepar time power robust stream separ techniqu applic signal natur singl human speak quiet offic speak local microphon mount headset asc research aim audio stream signal common natur occur auditori scene signal import research continu state art stream stream separ intens instruct decid content auditori scene separ auditori class talk import develop taxonomi auditori signal wide varieti auditori signal class overlap taxonomi present develop order studi domain sound class process develop develop familiar data domain discuss research taxonomi present summar figur page begin top gener root call sound import defin sound simpli pattern wave air sound detect anim comput defin sound pattern air pressur detect doesnt avoid nasti problem tree fall forest split root class sound human hear sound human hear import note depend human talk averag human hear frequenc hz young children hear sound frequenc hz intens sound factor sound intens measur db sound averag person hear defin sound measur log ratio intens sound intens sound human experi pain db perceiv sound level import note minimum audibl pressur threshold pain chang depend frequenc lower frequenc sound smaller percept intens rang frequenc intens rang ag exposur excess loud problem averag human defin sound peopl averag hear detect sound detect human taxonomi design system hear instruct human hearer design system level extrem rang human hear theoret hz hz taxonom sound frequenc hz intens greater db call sound sound describ taxonomi complic sound split pleasant subject classif classifi sound term simpl sound harmon complex natur sound harmon instruct good classifi sound class sound human natur gener english noun phrase kind sound natur sound artifici sound import note dispar speech consid natur artifici sound consid taxonomi present primarili attempt divid domain sound discret chunk singl axi classif taxonomi classif made scale time taxonomi fulli develop multipl featur sound top level section page discuss featur sound data domain featur space higher classif level lead intuit present taxonomi remain linear top level engin random signal classifi distribut energi spectrum signal uniform energi distribut colour energi distribut pink constant power octav frequenc constant power suit auditori research white physic equal distribut pink sound equal distribut structur brown frequenc distribut colour classifi perceptu peopl popular music era perceptu sound undesir listen difficult defin type object gener comment made perceptu sound larg percentag energi higher frequenc consid energi harmon relat intens signal high sound harmon seri consid high intens interest note peopl white relax listen natur sound ocean wave natur sound gener class distinct class level sound matter natur natur taxonomi defin natur sound sound natur natur world anim earth make natur sound natur sound classifi object make sound wind water sound anim sound import realiz natur sound fact due interact object rock water sound made water crash rock pour rock water wind sound gener wind tree wind interact outer ear creatur listen wind artifici sound artifici sound consid opposit natur sound sound human exclud speech music speech music natur sound put identifi separ individu class level artifici sound includ made build sourc sound classif intent telephon ring artifici sound intend ambul artifici sound unintend remov restrict uncertainti sound made field grain plant human natur grain construct directli manipul human make natur sound move sound shift natur sound artifici sound class sound fact result object interact sound object tire truck interact road artifici interact sound speech speech defin sound made human vocal tract intend commun record speech sound approxim speech consid speech wai split speech domain obviou classifi speech languag classifi speech speaker emot content subject matter speech classifi speech word phonem music music defin sound made human includ human commun emot feel peopl natur sound taxonomi restrict music wai categor music classif make music music made instrument group instrument music classifi famili instrument type instrument individu individu marin band year music classifi set instrument plai music put depend content music class identifi cultur music classif reduc lower level individu piec music classifi chord harmon base music classifi individu note fourier analysi sinusoid mathemat function trace simplest repetit motion natur ball rubber band descend slow band stop gravit equal restor forc rubber begin ascend stop restor forc gravit equal momentum system call simpl harmon oscil repetit motion creat call sine wave found form natur found vari air pressur sound wave sound creat ad infinit number sine wave essenc fourier synthesi gener function gener summat infinit number sinusoid frequenc amplitud frequenc sinusoid time repeat amplitud high oscil reach ball rubber band amplitud farthest ball travel rest state human vertebr organ call insid ear analyz sound spread compon sinusoid end organ sensit low frequenc end sensit higher frequenc sound part organ react frequenc present gener nerv interpret brain fourier analysi mathemat perform function opposit fourier fourier analysi consist function compon sinusoid sound sound sound natur sound anim veget miner object interact artifici sound speech music colour white pink brown perceptu featur sourc intent vehicl build tool object interact content chord pattern melodi note languag speaker emot content sentenc word phonem number instrument instrument famili individu type genr perform cultur music type figur taxonomi sound figur sound signal sinusoid compon frequenc phase fourier transform mathemat function signal fourier fourier signal show spectral composit signal list sinusoid identifi sinusoid amplitud phase phase signal start locat sinusoid rel specif phase measur indic part complet oscil sinusoid phase radian ident sinusoid phase radian signal sinusoid phase radian numer opposit sinusoid phase radian signal cancel shown ear mean sinusoid phase perceiv sound spectral rich sound frequenc compon figur sound phase compon fourier discard shown steadi state signal amplitud spectrum sound phase phase spectrum signal time perceiv chang phase perceiv shift phase inform import depend applic fourier transform fourier transform inform frequenc present signal spectral content signal chang work signal song note plai fourier transform distinguish note fourier show inform window ham window window fft ham window fft window fft window figur effect window function sine wave note fourier transform attempt fix lack time resolut classic fourier transform input data broken small sequenti call frame fourier transform appli frame success produc show harmon spectrum signal progress origin fourier transform oper signal theoret infinit requir frame expand infinit length repeat frame infinit number time produc signal transform break frame boundari introduc spectral compon transform present origin signal solut problem appli window function scale amplitud signal reduc discontinu frame boundari window function window function shape squar call squar window window function complet remov frame boundari reduc effect substanti figur show simpl sine wave window window fourier singl sine wave fourier singular figur window complet remov boundari work design window made clear improv made complic window worth extra comput requir produc ham window simpl comput yield good result long window function gradual reduc amplitud input signal edg frame reduc spectral blur window function appli clear inform frame boundari lost improv overlap frame part signal analyz inform lost frame boundari pick boundari frame spectral techniqu fourier transform spectral common origin easi implement relev compon audio signal thing fourier good time local accur model human frequenc percept transform discret fourier frequenc band repres equal amount spectrum base fourier easi implement comprehend spectral rich signal harmon relat partial transform seri equal space peak human auditori system long understood perform kind frequenc analysi incom sound analysi perform equal logarithm space studi sound studi human vertebr perceiv make design frequenc analysi method model analyz frequenc born transform signal process ratio center frequenc filter band bandwidth width frequenc band transform relat center frequenc constant pitch interv typic octav resolut end resolut end model resolut pattern difficulti implement difficult necessarili result analysi synthesi origin signal problem toler phase phase basic window fourier implement specif algorithm fast fourier transform improv modifi frequenc fourier transform act bank filter equal space frequenc input signal organ overlap frame size window type output frequenc versu amplitud form envelop amplitud frequenc sinusoid modifi synthesi techniqu track phase improv basic phase peak detect algorithm peak spectrum track time rule phase essenc collect recent improv fourier transform fourier transform system improv transform major drawback fourier transform base complet frequenc domain fourier inform frequenc behavior behavior techniqu techniqu spectral signal captur inform signal larg window inform smaller window wavelet accomplish basi function expand contract time basi call thought window descript mathemat natur function design transform wavelet discret wavelet wavelet stretch fill entir time frame analyz inform present frame wavelet scale fit half analyz half half frame slightli higher frequenc local half entir frequenc spectrum cover inform highli local inform local wavelet attempt cross boundari pure pure correspond inform inform extract signal kind hybrid method emploi extract time frequenc inform wavelet transform overview research relat audio signal classif asc broad research area part larger research field order creat system classifi import instruct analyz human perform desir classif audio research fact subject person music anoth ear human sound classif asa larger research field asc fit sound research deal individu sound combin sound asa studi auditori scene compon auditori event stand hear individu car drive hear peopl talk hear distinctli singl construct classif scheme work sound auditori asa perform research area appli improv asc pitch automat music speech languag multimedia present histor recent work area auditori scene analysi albert landmark book present perspect human sound percept work organ human visual auditori side concentr gener concept loud pitch realiz process brain determin hear differenti sound build world term pictur auditori scene classic problem auditori scene analysi room engag background pour drink readili filter unimport pai attent hand human track singl auditori person frequenc intens troubl understand friend analog show process auditori system lake analog imagin dig short shore stretch human auditori system determin boat fast larg object recent thrown figur observ motion bring problem consciou vertebr time dai difficulti show phenomena process auditori signal similar visual percept alloc properti belong event clear event properti appli system break perceiv common visual exampl famou figur background foreground clear boundari belong face phenomenon occur audit music note ambigu pivot chord kei chang perceiv belong kei ambigu resolv chord defin kei appar motion occur audit vision seri light flash singl light travel line light flash slow break individu light turn similar kind stream dimens seri note similar tend stream note dissimilar frequenc sequenc perceiv high tempo fast differ frequenc larg tempo slow frequenc differ sequenc perceiv stream rapid success link human visual percept wai suggest concurr process system similar brain structur recogniz frame refer research pitch detect pitch detect popular research topic number year basic problem extract sound signal fundament frequenc lowest sinusoid relat partial pitch partial harmon mean frequenc partial relat frequenc lowest partial small ratio frequenc lowest partial signal fundament frequenc pitch strictli relat differ pitch perceptu quantiti physic properti pitch valu relat log pitch octav doubl frequenc relationship directli frequenc doubl hz correspond pitch interv slightli octav relationship intens perceiv pitch sinusoid intens sinusoid sinusoid frequenc hz perceiv drop pitch intens percept pitch harmon content pure sinusoid frequenc base sinusoid perceiv slightli octav richer spectrum enforc percept make octav signal distinct notion distinct percept pitch sensat vari relationship partial harmon relat partial tone distinct percept pitch partial tone distinct percept pitch research area pitch detect psycholog relationship pitch import distinct true pitch detector perceptu model account produc result pitch scale frequenc scale pitch detect interest asc research primarili featur asc system classif system base song recognit reli heavili indic speech recognit system inform extract hidden content form prosod inform inform pitch detect present section page section page automat music transcript automat music transcrib receiv input music live concert record produc output fulli notat score asc signal assum music classifi individu note initi burst research applic occur mid comput deal amount data repres record music part problem solv part prove harder anticip solut treatment present refin pitch detect make music transcrib chang methodolog earli algorithm breakdown automat music transcript machin gener spectral estim pitch detect symbol format inform previou stage make spectral estim pitch detect method pitch inform organ format recogniz human comput common method present data midi instrument digit leav research develop tool translat data form symbol format part music transcript complic difficult task melodi line repres seri pitch repres kei signatur time signatur intellig experi decid grammar rule suggest music make task uncertainti principl present gener algorithm context relat accuraci music grammar set deal obscur uncommon notat possibl find difficult notat simpler passag notat possibl difficult form automat music transcript problem case instrument plai note case piano guitar plai chord case requir identif concurr pitch difficulti problem appar consid case pipe pipe sound harmon perceptu singl note identifi set individu note question complic note separ constitu part identifi singl note problem pitch detect work research separ problem auditori stream separ pitch detect sound separ number music transcript system individu stream spectral simultan attack synchron research split sound signal compon stream speech speech fundament audio research topic year research produc machin comput made task research direct produc machin understand analyz speech standard topic speech research appli classif speech speaker voic detect speech recognit fundament speech classif problem goal produc readabl text human speech fundament problem speech recognit analysi ambigu utter phrase im spoken natur phonet ident year experi make human good task phrase dont context popular exampl easi recogn interpret easi nice accur interpret work speech recognit describ histori field refer interest reader work histori basic speech recognit algorithm classif algorithm system decid phonem spoken spectral analysi pattern match tempor shift hidden markov emploi set templat closest match phonem classifi system classifi phonem work observ human speech product involv phonem phonem recogn assembl phonem word larg task word stream gener individu phonem job speech recogn decid word stream speech recognit technolog commerci applic program respect job technolog ultim goal speech recognit fulli automat speaker independ recognit natur speech natur environ recognit applic work natur speech specif speaker headset speech independ speaker headset natur speech independ speaker headset microphon error requir human postprocess clean text technolog research continu speech recognit point headset microphon speech speaker train system speaker recognit commonli desir result speech research speaker recogn ideal applic secur devic entri password analysi voic voic identifi door open appl comput softwar oper user access file space voic match expect smaller expect speaker expect phrase environ low difficult problem larg number author make speaker member list author peopl person speaker claim potenti speaker recognit call speaker verif current research consist attempt discov set speech paramet variabl speaker problem speaker verif discov distanc metric metric small variat lead incorrect neg result person recogn system strict system deal linguist sound peopl environ speaker verif ideal build entri system headset microphon mount wall door factor psycholog effect human unconsci chang voic pattern heard pitch proport partial voic detect applic work algorithm appli speech assumpt system hear desir develop system ensur speech heard system drive forc field voic detect system develop pass speech block ensur speech analysi system receiv system optim situat type speech noisi speech filter voic fact set sensit intens incom signal signal loud record signal drop record stop advanc threshold control voic detector true suffici volum trigger record devic record engag presenc speech voic detector develop specif form discrimin system develop specif goal segment speech tool make classif extend make gener classif speech versu sound classif system requir classif requir approach step step step step differ problem problem featur step classif problem typic data reduct sound larg import featur lost data data reduct stage call featur consist discov import fact data case featur extract case compar featur extract rare skip data origin form temperatur read thermomet time asc system input sound form seri voltag repres sound pressur level import inform form quantiti spectral locat featur base measur base characterist report perceiv human section divid featur domain discuss categori cluster step classif problem find featur valu correspond categori featur successfulli separ group case desir class goal separ obviou featur sound period goal separ call robin featur case featur difficult identifi automat cluster emploi cluster techniqu depend type data cluster cluster system emploi desir categori categori discov algorithm progress section present discuss cluster method todai analysi durat examin featur import awar signal extract featur featur extract entir featur extract short chunk sound earli classif system singl analysi durat fix swept signal window small method featur requir longer durat extract success requir calcul extract featur frame size analysi durat method classif templat comparison requir form durat situat sound classif sound class durat method durat match linear time time scale signal stretch match templat method success asc alter featur valu frequenc stretch hidden markov method durat match alter featur valu basic track occurr expect event signal progress section discuss method durat analysi method signal durat match classif depth classif system assign item small number class classif system number class greater system perform degrad accept level design make choic limit number potenti depth classif hierarch classif system number classif specif limit small number class automobil classif system begin classifi manufactur classifi station choic compani make knowledg make easier classif process stop point desir inform made current asc system typic small number potenti asc system hierarch classif system progress hierarch classif classif system discuss paper discuss hierarch system featur extract featur extract typic stage classif system asc system research elect appli modul system filter unnecessari inform applic king ham window accent classif data domain speech research attempt gener classifi typic potenti remov inform classif featur asc system typic divid physic perceptu featur base human hear sound exampl perceptu featur rhythm physic featur base statist mathemat properti signal exampl physic featur rate energi perceptu featur relat physic pitch relat relat spectral content interest featur present user enter inform sound retriev user describ sound term author divid featur subject featur featur account featur user compet engin signal request sound request sound pitch typic input sing hum subject featur encompass author call person descript difficult system design deal inform subject featur author give request sound sound select speech request sound imit make sound bee electr hum physic featur physic featur typic easier recogn extract sound signal directli relat physic properti signal perceptu featur relat human perceiv sound reli great deal perceptu model research elect base sound classif system primarili physic featur easier defin directli relev human experi energi straightforward physic energi measur signal time energi discov silenc dynam rang energi signal typic calcul window signal squar sampl averag squar root result engin quantiti research featur examin rel absolut squar root depend data classif result desir featur relat energi signal energi specif frequenc varianc low detect silenc argument strict energi threshold detect differ frame signal frame signal low begin end fade figur influenc higher harmon cross rate left note multipl cross cycl distribut energi time distinguish speech music speech consist period high energi period low energi music consist energi distribut measur energi distribut measur energi modul rate claim speech modul energi hz relat featur rate method recent gain stand sound classif research literatur made popular util put measur signal cross unit time idea inform spectral content signal thing research thought directli relat number time signal repeat unit frequenc made clear problem measur signal spectral cross line figur spectral rich figur cross line time cycl detector develop initi filter remov higher partial contamin cutoff frequenc chosen carefulli remov inform remov partial signal possibl detector detect pattern autocorrel find repetit shown inform featur unrel track research examin statist featur correl spectral centroid energi signal spectral centroid fairli high signal human speech phonem pure statist found author gather data call contour found contour speech significantli featur discrimin similar averag measur spectral characterist differenti speech music unintuit show advantag physic featur perceptu featur featur sound signal immedi evid human perceiv attract properti relat featur featur extrem fast calcul mean calcul spectrum extract inform calcul real time run total signal receiv system featur base input signal voltag posit send sign signal spectral featur spectrum signal describ distribut frequenc signal shown human ear perform kind spectral analysi human extract inform spectrum stand reason system design process sound benefit examin spectrum sound spectral techniqu histor analyz classifi sound spectrum signal gener signal broken spectrum calcul frame spectra displai spectrum result measur frequenc content signal time physic featur spectrum signal depend classif goal fundament spectral measur measur rang frequenc present signal featur discrimin speech music music typic larger bandwidth bass drum high frequenc bandwidth system case bandwidth calcul averag differ frequenc spectral spectral centroid signal author paper varianc autocorrel bandwidth featur gener featur call harmon featur classif system harmon refer relationship peak spectrum object vibrat reson human voic music creat sound strong frequenc peak evenli space interv spectrum harmon sound differenti voic identifi music classif system present featur base statist measur spectrum includ spectral spectral centroid spectral flux spectral point frequenc spectral energi distinguish voic speech spectral centroid measur averag frequenc signal music higher spectral centroid speech sound spectral flux measur rate chang spectral music higher rate spectral flux speech fundament frequenc relev period signal period signal signal repeat perceptu period signal pitch signal signal repeat slight variat signal period slowest rate signal repeat clear extract signal make signal period detector serv dual extract make rest signal consid period randomli vari detect signal consid sound multimedia discuss import featur distinguish piec retriev piec music base melodi peak extractor identifi signal differenti made pitch differ understood easili import rememb system includ perceptu model pitch detect multimedia detect speech word boundari idea larg variat happen middl happen end word author discuss util method indian languag discuss extract method locat voic human speech gener sourc gener period function shape filter vocal transfer function filter peak specif call depend phonem articul tradit speech rel frequenc typic identifi vowel form exist primarili voic exist sound whisper speech complet understand understand normal speech whisper speech shown figur locat year tradit speech time time figur comparison whisper speech voic speech top frame show spoken phrase time bottom frame show whisper note whisper speech sound sourc chaotic broadband recent specif sound classif classif algorithm locat sound signal classifi gender speaker author gather data averag frequenc male found suffici differ classif featur exist human featur useless identif classif sound artifici sound domain utter classifi languag accent accent classif discuss foreign accent local languag identifi foreign phonem local languag featur modul featur base time inform cooper featur featur strong make case recent classif featur combin gener reliabl classif simplest featur durat sampl multimedia applic durat sound featur sound finger snap shorter sound shorter sampl melodi make durat recognit durat vari version specif version version store version sung hum input durat match method emploi length sound length store templat inform durat match section page classif system present durat harmon segment featur identifi speech durat space syllabl fairli specif tone length tend vari wide featur measur modul filter signal hz theoret modul rate speech energi hz band featur indic featur refer measur find syllabl onset identifi find time syllabl perceptu featur extract perceptu featur goal identifi featur human classifi sound perceptu featur relat physic instruct investig physic counterpart perceptu featur physic featur found correspond perceptu extract inform classifi base templat sound identifi perceptu featur pitch prosodi pitch import perceptu convei inform sound close relat physic featur frequenc numer pitch fluid quantiti good discrep found system develop transcrib sound music score system work provid unexpect music piec kei kei guitar tune slightli sharp human perceiv pitch situat current detector fail interest exampl phenomenon miss fundament present simultan pure tone human auditori system fundament frequenc common present pure sinusoid tone pure tone octav lower tone fundament perceiv harmon seri impli pitch frequenc spectrum signal import prosodi characterist speech pitch phonem spoken indic deeper mean pitch phrase rise question prosodi word phrase sentenc thing depend part sentenc emphasi convei mean emphasi gener higher phonem durat word analysi prosodi classif impli speech recognit prosodi speech convei mean author identifi dialog fundament piec speech prosodi speech recognit perform sentenc prosod end classifi characterist speech identifi prosod featur frame fundament step speech recognit system classif frame voic fairli physic voic frame tend lower spectral centroid tend differ physic perceptu featur deepli understood classif label put phonem physic quantiti label repres piec sound classif featur made pitch assumpt input energi frame discern pitch normal speech frame reliabl classifi system classifi basi pitch domain speech correspond classif human discuss talk perceptu percept characterist sound difficult quantifi characterist call collect defin qualiti sound distinct instrument voic sound pitch call due spectral distribut specif attack note spectral discuss classif correspond sound zhang kuo provid discuss import featur differenti class speech music acknowledg spectral inform attack note import state tempor evolut spectrum audio signal account larg percept discuss method extract inform sound extract physic featur correspond featur difficult problem investig music analysi definit answer author multimedia system discuss describ subject featur acoust perceptu featur sound word describ includ idea templat match classifi basi identifi physic featur system collect exampl sound classifi cluster featur featur decid sound belong categori rhythm piec sound consid mean individu perceiv event sound repeat predict manner tempo music piec speed fundament event occur research attempt extract rhythmic inform piec sound repetit event energi pitch spectrum music rhythm simpl energi complic seri fit rhythmic framework repeat problem tempo rhythmic framework minut intens part piec problem rhythmic featur question featur system design differenti speech class rhythmic music form speech featur speech rhythmic detector overrid featur speech intend end rhythmic speaker speak rhythmic problem consid featur rhythm rhythm detector emploi form autocorrel extract rhythmic signal filter permit band band autocorrel author method detect strong drive beat fail rhythm deviat central music music underli beat inconsist emot express make job rhythm detector difficult modern danc music rigid beat metric perform detect presenc rhythm type music gener classif system present rhythm detect sound effect clock tick telephon ring discuss effect discuss extract method rhythm detector cluster algorithm cluster broad research topic easili constitut complet depth paper section give overview cluster appli acoust signal discuss fairli low issu involv select cluster current techniqu todai complet discuss cluster cluster appli specif sound classif speech set featur extract featur normal specif numer amount scale featur assembl featur vector task decid set class featur vector close belong classif automat creation set class larg set featur vector field featur refer featur vector repres specif datum call case typic cluster larg number case cluster small number categori cluster algorithm make repres case case repres cluster chosen case closest centroid cluster simplest cluster algorithm start repres seek classifi simpli repres case closest distanc metric adapt version algorithm repres case base case closest centroid cluster cluster algorithm repres case determin repres case algorithm number algorithm determin number cluster segment paramet space featur chosen discov algorithm neural net class algorithm paramet map paramet space techniqu neural net cluster neural net present set train class neural net train select correct class present correct train case process network readi classifi case danger method neural network perform investig paramet make classif intent research discov understand parametr differ method danger set train vector carefulli construct case train set happen record microphon case record network classifi base paramet microphon paramet instrument neural net comput techniqu base model biolog receiv input group electr output electr combin magnitud incom threshold neural network group model neuron react input provid output input layer neuron accept incom paramet hidden layer output layer classif make neural net power neuron connect connect signal sourc neuron pass target neuron neuron receiv input connect weight target neuron fire weight target neuron continu process neural network set specif task train input vector present suggest result connect weight adjust algorithm ensur network make proper classif train vector network close approxim tool classif neural network classif system speech recognit multimedia dialog act classif pass method train neural network difficult insid network wai train analyz connect weight inform data techniqu classif inform network connect weight deduc hyperplan separ region classif network techniqu costli inform produc success restrict neural network classif techniqu choic made class step classifi success techniqu relat process elimin classif made stage class remov list possibl success restrict algorithm design heurist specif task author success restrict classifi type audio separ silenc energi featur sound move step separ specif harmon chang harmon depend variabl sound silenc music varianc featur sound speech sound classifi method similar hierarch classif discuss earlier cluster final section present quick descript specif cluster algorithm fairli quick implement easi classifi finit number class research set classifi work figur classif class left dispar case select repres assign separ remain case assign class repres case closest time class combin cluster form final group research suspect class case set classifi find cluster combin cluster gener cluster algorithm begin point case set start point repres case class algorithm consid case point furthest case algorithm approxim bound case paramet space figur show set case paramet space left frame figur show furthest point select cluster repres class algorithm assign case repres case distanc form frame figur algorithm conclud step repres class centroid cluster remain case repres case process repeat coupl improv accuraci analysi durat discuss section page segment signal window frame order analyz featur chang time analysi featur difficult problem frame size gener amount featur frame size section discuss issu involv analyz signal time fix analysi frame simplest make analysi frame frame size stick featur extractor optim frame sequenti frame signal fulli examin problem method featur time scale easili extract singl frame size featur exist small measur smaller featur exist longer period measur longer frame problem solv present observ featur chang frame frame rhythm observ frame size observ chang total signal energi frame frame analysi classif algorithm attempt make signal inform singl frame creat classif high account dynam natur percept sound featur constanc measur frame valid frame singl measur observ frame frame constant vari classif algorithm account frame sound make good sound sequenti classif system attempt classifi sound singl conflict featur lead incorrect classif analysi term includ wai investig data frame discuss section page analysi techniqu receiv attent year wavelet analysi small wave wavelet frequenc wave sinusoid wavelet input signal repres sum wavelet amplitud locat set wavelet gener singl mother size wavelet gener scale mother wavelet reason wavelet analysi low frequenc wavelet extract inform signal low high frequenc wavelet extract high resolut inform success techniqu fact resolut investig transform hidden markov model audio classif import form templat match set templat store audio signal compar distanc measur determin templat closest input signal sound bird impact techniqu work individu instanc sound similar sound human put categori wide variat car fraction minut human voic obviou situat person articul drawn emphasi situat simpl templat match fail scale templat match templat stretch fit size input stretch attack decai portion chang make fit templat record plai back faster slower sound human classifi put categori origin record hidden markov hmm asc attempt rectifi problem markov model system set set transit state transit system proce state state base current state probabl transit state make markov model hidden observ state standard markov state directli observ hmm state directli set observ state observ state depend probabl observ hmm signal classif set observ input hmm signal classif attempt decid set hmm gener set observ classif system number class hmm produc incom signal class incom signal fit hmm work sound chang durat durat chang occur singl state state hmm begin state attack jump back middl state durat sustain portion follow decai portion state state sound close model templat stretch fit length input signal audio signal classif research field encompass smaller research topic signal featur pattern match plai import role asc system design asc decid specif asc task perform featur extract cluster classif asc current research field work plan develop bulk phd thesi theori implement system classifi sound speak sing limit input domain drastic make problem class sound problem distinguish work encompass research select featur implement evalu effect system bibliographi murrai tune histor survei michigan state colleg east speech theori implement john wilei albert auditori scene analysi mit bunch dynam sing voic chri david sourc separ note identif music intern confer speech signal page michael clark intersect time frequenc brian clarkson alex pentland cluster audio video intern confer speech signal volum page stanlei lawrenc jame sensat percept brace colleg dan david optim estim em algorithm speech separ intern confer speech signal volum page gerard ran classif appli music signal page daubechi wavelet local signal analysi ieee transact inform ph track partial addit sound synthesi hidden markov model intern confer speech signal volum page richard duda peter hart pattern classif scene analysi john wilei improv music pitch track princip decomposit analysi intern confer speech signal volum page bori xavier estim fundament frequenc music sound signal intern confer speech signal page bori xavier fundament frequenc estim track maximum likelihood harmon match hmm intern confer speech signal volum page john sound technolog van nostrand alexand elli arthur mendel studi music pitch bernhard stefan automat index sound neural net comput music fall nevil fletcher physic music hedg method robust determin fourth intern confer spoken languag volum page david gerhard comput music analysi technic report tr simon fraser david gerhard automat interv rel pitch mathemat connect music page august david gerhard audio visual phase space mathemat connect music page august david gerhard audio signal overview canadian artifici winter david gerhard lossi compress imag wavelet coeffici canadian confer electr comput volum page ben gold nelson morgan speech audio signal process john wilei listen mit herm time pitch movement accentu syllabl fourth intern confer spoken languag volum page leonard juan jose pitch detect algorithm base wavelet transform fourth intern confer spoken languag volum page robust automat speech recognit kluwer academ franci hubert long richard schwartz transcrib radio fourth confer spoken languag volum page sound onset detect appli knowledg intern confer speech signal volum page automat music transcript christian laurent evid autocorrel theori auditori tempor process journal acoust societi octob benjamin spectral analysi discrimin novemb robin king automat accent classif foreign accent english speech fourth confer spoken languag volum page keller barri granular synthesi page period analysi model sound separ auditori scene analysi intern confer speech signal volum page william kuhn pitch recognit algorithm music applic comput music fall john lane pitch detect tunabl filter comput music fall lloyd hugh boyl scale michael lund lee robust sequenti test speaker verif journal acoust societi januari fred rai gener theori music mit gerald mackai global scale dialog act classif prosodi fourth confer spoken languag volum page jame transcript music sound comput comput music page novemb brian editor hear academ yang akira fast audio classif mpeg code data intern confer speech signal volum page harri olson physic engin dover martin bernard predict music pitch compon frequenc ratio journal acoust societi septemb martin comput model music transcript phd donald speech song william saul william brian flanneri numer recipi cambridg francisco pablo match fundament frequenc estim music signal intern confer speech signal volum page michael aaron carol compar perform studi pitch detect algorithm ieee transact signal octob lawrenc rabin juang fundament speech recognit prentic curti road comput music tutori mit juan physic music featur extract tempor segment acoust signal page rao word boundari detect pitch variat fourth intern confer spoken languag volum page john saunder discrimin broadcast intern confer speech signal page manfr schroeder power law freeman jurgen pattern classif john wilei eric music percept system phd massachusett institut carl psycholog voic instrument shapiro imag code wavelet coeffici ieee transact signal keith jenkin neural network model pitch percept comput music fall lesli smith sound segment onset offset journal music eric malcolm construct evalu robust discrimin intern confer speech signal volum page mark steedman comput phil tran soc subrahmanian multimedia system morgan kaufmann san michel victor zue automat transcript gener audio preliminari fourth confer spoken languag volum page barri editor handbook acoust ecolog arc dougla robust model continu speech base automat classif fourth confer spoken languag volum page luc van marten pitch determin auditori model journal acoust societi june dougla jame search retriev audio ieee page fall bin yang content base search multimedia master simon fraser june tong zhang jai kuo hierarch classif audio data retriev intern confer speech signal volum page
DB/382 3 scalabl process transact broadcast push pitoura depart comput scienc greec pano chrysanthi depart comput scienc pittsburgh abstract deliveri attract attent mean dissemin inform larg client popul wire wireless set address problem ensur consist currenc client transact presenc updat addit control inform broadcast suit method vari complex volum control inform transmit subsequ differ space process overhead method combin cach improv queri latenc rel advantag method demonstr simul result qualit argument transact process local client contact server approach perform independ number client introduct tradit data deliv demand client explicitli request data item server receipt data server locat inform interest return client form data deliveri call wireless satellit cellular server machin provid rel channel support broadcast deliveri mobil client locat insid geograph region cover facil infrastructur form data deliveri call deliveri broadcast support network data server repetit broadcast data client popul specif request client monitor broadcast retriev data item arriv broadcast channel deliveri central increasingli import rang applic involv dissemin inform larg number client applic includ inform feed stock quot sport electron mail road traffic manag cabl tv import electron commerc applic auction electron tender inform dissemin internet gain attent address problem preserv consist currenc client valu broadcast data updat server control inform broadcast enabl valid transact client method vari complex volum control includ transmit invalid multipl version serializ inform cach client support queri latenc perform method evalu compar qualit argument simul result method consist preserv contact server method perform independ number client properti make method highli popul servic area provid transact support tailor transact import reason great major transact dissemin system readonli updat transact effici process transact special algorithm consist queri ensur contact server import exist client channel typic small commun capac number client support great chanc overwhelm server client request avoid contact server latenc client transact method applic wire wireless set current updat treat context cach updat consid term local cach transact semant transact broadcast discuss project special hardwar detect valu read ensur consist architectur extend case distribut site broadcast content fragment resid site recent work involv develop correct criteria transact broadcast environ broadcast medium transmit concurr control relat inform part transact manag undertaken client remaind paper organ section introduc problem section method process transact method extend support cach section section perform method compar qualit argument simul result section offer present plan futur work transact broadcast broadcast model server period broadcast data item larg client popul period broadcast call broadcast cycl content broadcast call client listen broadcast fetch data arriv assum updat perform server dissemin client access data broadcast mode make assumpt transact concurr control server client listen broadcast continu read specif item select tune import case portabl mobil reli oper finit energi provid batteri listen broadcast consum energi select client prior knowledg structur broadcast determin item interest channel broadcast form directori inform broadcast data instanc client inform broadcast subsequ read smallest logic unit broadcast call bucket bucket analog block disk bucket header includ inform inform header includ posit bucket offset begin offset begin data item correspond record assum user access data attribut search kei bucket item consist transact assum server broadcast content consist finit set data item state typic defin map data domain denot defin set order pair data item valu data relat number integr constraint express relationship valu data state satisfi state consist violat integr constraint data item transact execut server updat valu assum content broadcast cycl consist assum valu data item broadcast correspond state begin valu produc transact commit begin transact read data singl execut concurr overhead make assumpt clariti present set item read transact static time access data transact read data item valu state simpl transact correspond read read broadcast client transact read wait read defin span transact maximum number read data client transact read data valu read consist defin readset transact denot read set item read read set order pair data item valu read correct criterion readonli transact transact read consist data readset transact form subset consist state assum server transact preserv consist state produc serializ execut execut serial number server transact produc consist state goal method present paper ensur readset transact correspond state transact process method invalid report form list includ data item updat server previou activ transact client maintain set data item read begin client tune read invalid report read transact abort item invalid report theorem method produc correct transact proof transact read current valu written transact commit begin commit size broadcast equal number item size kei bucket size broadcast method prone starvat queri updat transact minim number invalid abort older version data item retain temporarili broadcast commit data maintain broadcast multipl version item older copi item concurr control successfulli process onlin transact tradit system client transact perform read oper transact read data largest version number read largest version number abort header overflow bucket bucket overflow bucket figur broadcast theorem broadcast method produc correct transact proof term data item read correspond state begin data previou valu previou maximum transact span transact proce successfulli read older version data server broadcast older constant transact abort server maintain constant number version item valu item previou cycl number older version retain properti server server broadcast previou consist transact span smaller amount broadcast reserv version adapt depend feedback updat rate server broadcast organ wai organ broadcast approach broadcast version end broadcast data item singl recent broadcast pointer pointer point older version broadcast end overflow bucket data offset posit begin remain fix server recomput broadcast index client local store directori locat data item broadcast follow pointer locat older version overflow bucket drawback readonli transact read version penal wait end transact satisfi current version suffer similar latenc size version size size attribut ber updat maximum transact span size data bucket size total size overflow bucket pointer offset begin overflow bucket end analog number overflow alloc space version broadcast number version broadcast differ current version version current cycl version creat broadcast version data bit suffici test scheme ensur transact read consist valu produc serializ enforc transact read valu correspond content singl suffic transact read valu correspond consist state necessarili broadcast conflict serial graph test method serial graph histori denot direct graph node commit transact edg oper conflict oper serial histori serializ iff acycl assum transact read data item write readset transact includ serial type edg pair transact depend edg express fact read written edg express fact wrote item read method work client maintain copi serial graph local serial graph server includ transact commit local copi client site includ addit activ transact issu site server broadcast updat serial graph receipt client integr local copi graph read oper client accept creat cycl local serial graph issu transact abort serial graph server necessarili concurr control practic sg sg sg sg sg tl figur read commit commit item read emploi implement method describ implement method base assumpt histori strict histori strict data read overwritten transact wrote termin method applic case addit overhead begin server broadcast control ffl differ previou serial graph server broadcast transact commit list transact connect direct edg ffl augment invalid report report includ data written identif transact wrote content broadcast augment identif transact wrote broadcast begin client tune obtain control inform updat local copi sg serial graph includ addit edg node client add edg activ transact activ transact rs set item read item augment invalid report rs client add edg transact wrote conflict transact wrote suffic add edg read item depend edg ad transact wrote read oper cycl form shown suffic add edg ad edg transact wrote prove method detect cycl includ transact lemma sg subgraph sg includ transact commit lemma broadcast cycl item read overwritten broadcast cycl type cycl form includ form jp sg hold method detect cycl proof figur show graphic format cycl theorem method produc correct transact proof state serial updat transact item read updat transact read similar approxim criterion appli transact main differ implement broadcast control inform form serial broadcast inform pair data item space effici complet copi serial graph lemma suffic transact subgraph sg item read overwritten item space process overhead client subgraph maximum transact span queri client lemma outgo edg volum control inform tid size transact maximum number transact commit maximum number oper server transact assum transact identifi uniqu suffic alloc bit transact identifi distinguish transact version number broadcast indic transact size version number relev size broadcast data size invalid report oper transact particip conflict transact differ previou graph edg total size differ assum broadcast pair conflict transact transact pair newli commit commit transact conflict broadcast control inform end previou offset item begin remain fix local store directori cach reduc latenc answer client cach item interest local cach reduc latenc span transact find data interest local cach access broadcast channel smaller number cycl assum unit correspond unit broadcast presenc cach item stale approach commun updat client assum invalid combin form approach applic assum begin server broadcast invalid list page updat report invalid page cach invalid report invalid page remain cach invalid page client fetch replac page cach current current mark cach invalid report similar invalid report method report differ granular cach invalid report includ page invalid report includ data item transact process techniqu easili extend accommod cach read check item cach item found cach page item read cach item read broadcast simpl enhanc scheme extend cach includ item insert cach queri item invalid abort mark abort continu oper long valu found cach read oper accept item cach version number call method version cach tabl perform model paramet server paramet theta distribut client paramet theta distribut time client read broadcast number read cach cach replac polici cach invalid lru vari invalid offset access server offset kei access client oper server updat unit unit theorem version cach method produc correct transact proof support broadcast cach includ version number item cach extend includ item transact wrote inform broadcast time item read test cycl item read broadcast perform perform evalu perform model perform model similar present server period broadcast set data item rang assum simplic flat broadcast organ server broadcast set item client access item rang subset item broadcast access probabl follow zipf distribut paramet theta model access access pattern increasingli skew theta client wait unit make read request updat server gener zipf distribut write distribut rang paramet call offset model disagr client access pattern server updat pattern offset overlap distribut client page frequent updat offset shift updat distribut item make interest client number client read cach cach figur abort rate number read oper client transact assum transact commit server server transact number updat read read oper time frequent updat read oper server rang follow zipf offset updat set server client maintain local cach hold page cach replac polici cach recent page replac page cach entri invalid subsequ tabl summar paramet valu parenthesi default comparison method concurr updat server invalid data valu read transact abort anew figur depict abort rate scheme present cach client cach reduc number transact abort reduc span probabl invalid total version item maintain abort rate depend updat rate overlap client read server updat pattern result refer broadcast size broadcast volum import measur effici term bandwidth volum broadcast data affect time client transact access data larger volum longer client wait data interest channel figur show broadcast size function maximum transact span number updat transact span broadcast method number updat broadcast method figur size transact span updat number updat span formula develop previou section latenc quantifi durat readonli number transact read control inform method broadcast addit transact wait version end quantit result refer currenc transact classifi base currenc requir currenc requir updat transact reflect data read transact tabl summar currenc properti transact method disconnect techniqu present differ requir activ client monitor broadcast continu continu monitor requir desir set case mobil oper reli finit power provid listen broadcast consum select tune requir access broadcast minim access broadcast sought client disconnect common data broadcast deliv wirelessli client cycl read invalid report ensur correct activ transact client refrain listen broadcast number cycl resum execut long requir version air transact toler miss broadcast cycl broadcast toler disconnect depend rate creation version item chang transact cycl method toler client disconnect client miss broadcast anymor serializ activ read transact anew toler version number broadcast read oper accept iff version number smaller version broadcast transact listen client inform requir cycl detect period retransmiss control inform toler intermitt connect invalid report item updat broadcast client cach improv toler disconnect futur work present suit process techniqu provid support consist queri broadcast push wire wireless set mobil stationari client techniqu scalabl perform independ number client compar techniqu quantit simul show rel advantag techniqu extend wai assumpt valu broadcast begin cycl refin scheme refer support granular invalid report includ bucket item extens organ specif item broadcast frequent address problem determin optim tabl summari transact minimum broadcast method broadcast size updat server affect affect moder tran activ cach process overhead moder maintain sg server small small depend activ depend updat updat rate span server tran rate depend updat span transact long latenc cach maximum number report transmit invalid version state item read concurr toler disconnect depend individu transact span updat rate depend updat rate cach size addit inform broadcast overwritten time invalid state currenc read perform state perform read oper oper state state transmit version refer zdonik broadcast data manag asymmetr commun environ proc zdonik dissemin updat broadcast disk proc li evalu distribut scheme high perform distribut system journal comput barbara certif support transact wireless system proc ieee int conf distribut comput barbara imielinski cach strategi mobil environ proc goodman concurr control recoveri system bestavro document dissemin www ieee data engin septemb architectur decemb kumar adapt broadcast protocol support effici energi conserv retriev mobil comput environ proc ieee int conf data wiederhold transact distribut acm data organ access ieee alonso adapt cach invalid method mobil environ mobil network lori effici flexibl method transient version avoid lock transact proc pitoura chrysanthi scalabl process transact broadcast push tech report univ comput scienc pitoura chrysanthi exploit version handl updat broadcast disk tech report univ comput scienc pitoura data manag mobil comput kluwer academ silberschatz correct execut proc acm ramamritham effici concurr control broadcast environ acm yan sift tool inform dissemin proc usenix technic
DB/383 3 interact path type constraint peter buneman fan scott weinstein depart comput inform scienc pennsylvania april novemb abstract xml emerg import standard data exchang world wide highlight import semistructur data xml standard requir schema type number develop roughli correspond data definit languag constrain structur xml data schema advoc integr form constraint capabl express constraint relationship recent studi path constraint context semistructur data futur xml involv form understand interact paper investig interact studi constraint implic import understand semant system queri optim number result path constraint implic establish presenc absenc type system result demonstr ad type system case simplifi reason path constraint case make harder shown path constraint implic problem decid ptime untyp undecid type system ad implic problem undecid untyp decid cubic time finit type system support partli armi research offic nsf grant support graduat fellowship institut research cognit pennsylvania support nsf grant introduct numer ad structur semant xml document advoc integr constraint concret constraint system develop constraint extens exist type system ad independ ad wai xlink independ type system express simpl constraint studi constraint type system separ understand interact integr constraint semistructur data origin studi path constraint constraint express constraint extens studi overcom limit central technic problem investig paper question constraint constraint follow constraint necessarili number decid undecid result establish paper semistructur data unconstrain type system schema extend work report investig interact type system constraint system interest result present ad type system case simplifi analysi path constraint implic case make harder exhibit implic problem path constraint undecid context semistructur decid type system ad give constraint implic problem decid ptime untyp undecid type system practic interest phenomena address section discuss instanc implic problem cast problem structur repres figur describ xml version isbn author isbn author ref isbn author ref person isbn isbn titl isbn titl ssn ag author author book book person author ref ref ssn book titl wrote wrote wrote year figur xml document ssn wrote ssn wrote semistructur data express number data format typic path constraint graph describ relationship author wrote express denot root variabl rang predic denot edg label path graph sequenc edg express formula denot ff sequenc edg label vertex book path root vertex figur note introduc constraint mention type system kind constraint studi type document type id id id id id id type constrain fashion interest interact form constraint word path constraint class call word introduc studi refer figur typic word constraint figur repres bibliographi penn refer word constraint assert author book person book written person occur typic integr constraint call extent constraint consid form constraint path repres regular express shown context semistructur implic finit implic problem word constraint decid ptime class path constraint studi mild gener word constraint constraint word constraint link extern bibliographi mit warner call view compon call local graph depict ad edg eman root node label lead natur expect extent constraint hold local extent constraint constraint local call local constraint constraint exampl word constraint demonstr constraint capabl express natur integr constraint fundament part semant import queri optim queri xml document shown context semistructur implic finit implic problem undecid decid fragment identifi fragment properli class word capabl express local constraint main result paper investig interact constraint type similar model studi support set structur model infinit instanc requir set finit model restrict set context semistructur data model investig implic finit implic problem fragment call pw class local extent constraint complex result problem summar tabl result demonstr path constraint implic wildli complex context untyp data type data ffl implic finit implic problem undecid context untyp data type system problem decid finit implic implic implic finit implic finit implic finit implic pw local extent constraint semistructur undecid decid undecid data model decid decid decid model model undecid undecid undecid model undecid undecid undecid tabl main result paper ffl implic finit implic problem local extent constraint decid ptime untyp context type system problem undecid mention undecid implic finit implic problem shown result strengthen paper establish undecid implic finit implic problem pw fragment organ rest paper organ section review formal definit constraint word describ implic problem implic finit implic problem pw local extent constraint section present semistructur data model type constraint model section show undecid result establish semistructur data type system investig implic finit implic problem pw strengthen undecid result report establish undecid implic finit implic problem pw untyp data establish decid implic finit implic problem context show implic finit implic problem pw remain undecid context section demonstr ad type system necessarili constraint implic investig implic finit implic problem local extent constraint show untyp problem decid ptime type system problem undecid section summar main result paper identifi direct work path constraint review definit path constraint languag introduc describ fragment implic finit implic problem section show problem wildli complex context untyp data type data path constraint languag vocabulari constraint languag relat signatur oe constant finit set binari relat symbol depict direct jgj set set label edg graph figur view structur path finit sequenc label defin path formula ffl denot call empti ffl path free variabl denot tail head node vertic true path sequenc edg label ff write ff paramet clear context concaten path denot simpli ff path ffl ff ffl form ff path ff prefix denot ff exist fi ff fl ff suffix denot ff exist fi fl ff length path defin ff ffl ff fi refer figur person wrote node path formula true prefix path person wrote length path constraint defin definit path constraint express forward form backward form fl path path ff call prefix denot path fi fl denot set path constraint denot integr constraint encount section includ local constraint proper subclass introduc investig definit word constraint express form fi fl path set word constraint denot pw word constraint forward constraint prefix empti path ffl extent constraint section word local constraint implic problem advantag path import reason rise question logic implic path constraint describ implic finit implic constraint notion refin context section assum standard notion model implic logic structur constraint denot satisfi model finit set constraint denot satisfi model oe oe implic problem problem finit subset model satisfi finit implic problem problem determin finit model satisfi set consist constraint section constraint question model satisfi instanc implic problem shown constraint implic queri optim section show implic finit implic problem undecid context untyp data problem decid finit context model section show undecid result untyp data hold fragment fragment gener pw class word constraint introduc present fragment ff path pw fragment defin pw pw pw implic problem pw problem finit subset fg pw model satisfi implic problem pw studi implic extent local extent constraint section local set consist extent constraint local extent constraint section constraint local extent constraint fg finit subset pw question model satisfi instanc implic problem pw show untyp problem undecid undecid result pw gener pw mild shown implic finit implic problem pw decid ptime light undecid special case implic problem implic problem local extent constraint illustr local extent constraint section model constraint satisfi constraint implic presenc constraint local set consist local extent constraint constraint question model satisfi instanc implic problem local extent constraint repres global constraint local augment common prefix constraint repres common prefix mit notion describ local extent constraint definit ff path binari relat symbol constraint bound ff form fi ffl fi prefix subset prefix bound ff finit subset bound ff path ff ff ff ff ff form denot prefix definit db db local connect db path ff constraint bound ff view local extent constraint db subset prefix bound ff consist local extent constraint constraint local connect db path ff set partit consist local extent constraint db constraint local interest implic local extent constraint db constraint presenc constraint local constraint formal definit definit implic problem local extent constraint problem finit subset fg prefix bound ff constraint bound ff model satisfi section show untyp constraint local constraint interact implic finit implic local extent constraint db constraint longer true type context implic finit implic problem local extent constraint decid ptime context semistructur data problem undecid context model semistructur data structur data semistructur data versu structur data investig semistructur data model model present abstract term logic section abstract studi path constraint implic model semistructur data model semistructur data irregular structur miss schema data structur constrain schema exampl data found world wide biolog data integr document xml view semistructur data observ semistructur data model direct unconstrain type system schema abstract semistructur oe signatur form section denot root denot edg label refin notion path constraint implic context semistructur data denot impli denot finit impli finit context semistructur implic problem problem finit subset fg implic finit implic problem pw local extent constraint formal context semistructur data model structur data constrain schema data found instanc mention section applic data consid xml constrain schema studi gener similar model studi support set structur schema term type constraint section investig interact type constraint path constraint schema instanc describ schema instanc assum fix countabl set fix finit set atom type int definit finit set class set type type defin notat repres set type record definit schema tripl ffl finit set ffl type ffl type assum schema uniqu entri schema specifi type entri point xml document figur schema attribut ffl consist book ffl map book erson record erson ssn ag wrote book isbn year ref author fp ffl fp book definit instanc schema tripl ffl oid assign map finit set ffl map oid fv denot domain atom type ffl repres entri point instanc denot set instanc schema type constraint present abstract structur data view semistructur data constrain schema line abstract semistructur data repres structur logic structur satisfi type constraint structur depict direct type constraint abstract simplifi analysi interact path constraint type system defin signatur determin schema schema defin set binari relat set unari relat ffl ffl note distinguish binari relat denot set membership relat definit signatur determin schema constant symbol finit set binari relat symbol edg finit set unari relat symbol sort defin signatur determin schema ffl instanc schema intend ffl includ ssn isbn ref author ffl includ fp repres instanc schema satisfi type constraint assum repres data entri point record label set type data structur satisfi type constraint specifi restrict edg vertic type base definit instanc give ffl element jgj uniqu type ffl element jgj type satisfi constraint atom type outgo edg class type outgo edg label lead element type jgj type iff class type outgo edg edg label type jgj type iff type constraint schema formul sentenc logic simplifi count quantifi semant structur satisfi exist uniqu element detail discuss count note defin logic definit schema constraint determin sentenc oe defin ffl oe ffl oe oe ffl oe ng oe type constraint determin schema sentenc defin oe definit abstract schema finit denot set abstract denot set satisfi path constraint revisit refin definit path path constraint context justifi abstract path constraint satisfi refin signatur determin schema defin path path constraint binari predic section context model type constraint path structur exist path defin path undefin path constraint undefin path satisfi structur interest constraint denot set path ff iff assum schema constraint defin term path notion defin definit schema set path schema type path ff defin induct ffl empti path ffl ffl ff ff path exist class ff section path schema repres logic formula denot tail head node notion path length defin set path defin schema defin ts fff fi ff ff fi denot ff suffix section defin path constraint context definit path constraint schema express forward form backward form fl path ts ffl forward ff fi ff fl ffl backward ff ff fi fl fi path ff call prefix path fi fl denot denot set path constraint definit word constraint schema sentenc form ff fi denot fi pw denot set word constraint understood write pw simpli pw context refin definit pw section schema fragment pw defin pw pw pw ffi function defin section local extent constraint definit refin context type path constraint implic restrict schema schema fg finit subset denot impli denot finit impli schema implic problem problem finit subset implic problem context problem schema implic problem decid context implic finit implic problem pw local extent constraint formal constraint schema wrote book author person author wrote word constraint note constraint present slightli section instanc constraint interpret stand project record attribut mean element set illustr path constraint schema natur interpret instanc notion defin instanc constraint lemma justifi abstract structur defin reveal agreement abstract respect path constraint lemma schema iff hold construct iff defin smallest set satisfi ffl set object element ffl record object attribut distinct node ffl jgj ffl ffl jgj iff type denot unari relat ffl iff iff straightforward verifi ffl finit ffl iff easili verifi defin iff simplifi assum base type domain infinit exist inject map unari relat denot sort unari relat denot class type defin map jgj ffl ffl base type ffl jgj ffl note finit ffl ffl jgj easi verifi iff lemma immedi corollari corollari schema fg finit subset model explor impact type system path constraint model mild variat differ support set support finit set construct infinit instanc infinit set finit schema instanc defin schema notion type constraint defin notion abstract defin definit denot set satisfi respect finit set rule set class set finit node finit outgo edg structur requir respect finit set rule node repres set structur infinit outgo edg schema notion pw pw implic finit implic problem pw local extent constraint defin implic finit implic problem pw local extent constraint context defin shown lemma hold note ffl schema defin logic implic problem finit implic problem coincid problem decid section show problem ffl schema set defin logic implic problem finit implic problem necessarili lead decid problem section show schema case implic problem finit implic problem problem undecid model restrict model support record structur set record consist valu atom type oid finit set class set type defin notion schema instanc defin compar featur structur proven repres linguist data schema notion type constraint defin set type consid notion defin defin implic finit implic problem context lemma hold context note schema defin logic implic problem section show undecid result establish semistructur data type investig implic finit implic problem pw prove theorem context semistructur implic finit implic problem pw undecid theorem context data model implic finit implic problem decid finit recal pw fragment corollari immedi theorem corollari context implic finit implic problem pw decid finit theorem strengthen undecid result report theorem context semistructur implic finit implic problem undecid investig implic finit implic problem pw context theorem context implic finit implic problem pw undecid theorem context implic finit implic problem pw undecid corollari theorem corollari context implic finit implic problem undecid corollari context implic finit implic problem undecid undecid untyp data prove theorem reduct word problem monoid present detail review word problem monoid word problem monoid recal notion definit monoid tripl ffl nonempti ffl ffi associ binari relat ffl element ident ffi ffi ffi monoid finit finit definit finit alphabet free monoid gener ffl set finit string letter ffl concaten oper ffl ffl empti string definit finit alphabet equat pair string finit set equat fi ff fi test equat fi monoid homomorph word problem monoid problem result theorem word problem monoid word problem finit monoid undecid reduct word problem monoid prove theorem show undecid result hold ff binari relat symbol implic finit implic problem pw binari relat symbol theorem context semistructur implic finit implic problem pw undecid prove theorem present encod word problem monoid term implic problem pw show encod reduct finit alphabet finit set equat loss assum fl fi ff fi defin logic signatur oe constant set binari relat symbol note symbol binari relat symbol oe ff repres path denot ff denot concaten oper path string encod term pw pw consist consist fi ff fi test ff fi arbitrari string encod pair string pair constraint pw reduc word problem monoid problem determin reduc word problem finit monoid problem determin subset pw show encod identifi basic properti lemma oe ff jgj jgj straightforward induct show encod reduct word problem monoid suffic show lemma lemma context semistructur ff fi iff iff prove proof similar simpler show show exist finit oe defin notat exist finit monoid homomorph base defin relat ae iff ae ae class ae respect fb ae ae construct structur jgj ae distinct node defin jgj ae ln ln ln figur structur proof lemma binari relat popul ae ae structur shown figur construct easi ae ae uniqu node ae ae ae ffi ffi properti easi verifi claim claim finit show suffici show finit function defin ae total inject finit claim construct claim ff fi ae ff fi homomorph ae ff ae fi ae ff ae fi construct ae properti shown straightforward induct uniqu ae ae ff uniqu node jgj ff ae ff fi ae fi ae ff ae fi fi ae ff fi shown ff claim claim show uniqu node jgj ff fi ff show defin finit monoid homomorph defin relat exist finit oe loss assum jgj base defin relat ae iff ff fi ff fi ae denot class ae respect notion defin ae import properti claim finit show ae ae sg fs ae ae ae jgj jgj jgj sg finit easi verifi ae iff ae fact assum ae ae definit ae definit assumpt ae ae shown ae ae assum ae ae loss assum exist ae ae contradict assumpt fact hold function sg defin ae fact easi total inject sg finit defin binari oper ffi ffi easi verifi claim claim ffi ae ae ae ae show ae ae jgj ae exist jgj ae ae ae ae lemma ae ae ae show ae ae ae claim ffi associ ffi ffi ffi ffi ffi ffi claim ident ffi ffi ffi finit monoid defin ae homomorph ffi ffi complet proof lemma undecid contrast theorem show context path constraint implic decid finit establish theorem present finit axiomat implic finit implic provid algorithm test path constraint implic finit axiomat set consist infer ffl ffl ffl fi ffl ffl ff ffl ff ffl ff fi ffl ff fi schema fg finit subset ir denot provabl theorem show finit axiomat path constraint theorem schema finit subset fg iff ir iff ir schema implic finit implic problem coincid decid finit subset ir sound problem coincid defin problem lead decid problem undecid due prove straightforward induct length ff untyp lemma hold gener lemma arbitrari schema ff uniqu lemma lemma hold context lemma schema forward constraint word constraint ff iff jgj ff exist jgj ff jgj jgj lemma uniqu node ff lemma schema backward constraint word constraint ff fi iff jgj fi lemma exist jgj ff fi jgj jgj lemma uniqu node uniqu node fi fi show theorem proof theorem sound verifi induct length proof suffic show claim schema fg finit subset natur number maxf fgg path ae ffl ir ffl ir notat definit claim hold claim ir show claim defin structur claim defin construct substructur jg fo ff construct defin ffl path fff ff kg ffl relat path defin ff fi iff ir note commut ir iff ir ffl ff denot class ff respect fb ff ff path ffl type path ff determin ff fi definit pw defin ffl ff distinct node jg ff ag ffl ffl ff ffl class fi ff fi note transit base defin distinct node ffl jgj jg ffl ffl ffl jg class outgo edg label type class show structur claim easi verifi jgj finit show claim claim ff path result claim lemma uniqu node show claim induct base ff ffl recal induct assum claim ff show claim hold ff ff path induct ff path jff lj ff ff definit ff ff ff claim hold claim show show assumpt lead contradict forward constraint jgj lemma claim ff ff fi ff claim ff ff lemma ff contradict assumpt backward constraint jgj lemma claim ff ff ff fi claim ff fi lemma ff contradict assumpt properti claim ae path lemma claim lemma ae definit commut ir ir lemma claim lemma ae definit commut ir ir complet proof claim proof theorem algorithm present algorithm test path constraint implic context schema algorithm input finit subset path ff fi comput pseudo model jgj path iff ir iff ir theorem algorithm test implic finit implic constraint context present defin schema finit subset ff fi defin ff fff fig forward backward ff ae ae denot ae prefix section give algorithm tabl procedur algorithm tabl note algorithm remark algorithm independ schema requir input constraint path defin schema inform algorithm finit subset path ff fi structur oe set edg label ff fi path constraint rule oe ffl jgj ae ff distinct ffl ffl oe popul iff ae rule rule jgj ae ae rule rule ae ae jgj ae ae output tabl algorithm test path constraint implic procedur jgj oe delet oe edg label add oe edg label oe jgj delet oe edg label add oe edg label jgj jgj tabl procedur merg algorithm schema algorithm algorithm context schema remark schema input algorithm finit subset path ff fi structur comput algorithm natur extend structur ffl jgj distinct ffl ffl fo ae ffl ae class outgo edg label type class easi verifi long ff fi easi verifi call structur defin extens respect remark procedur merg transit remark step algorithm lemma schema path ae exist uniqu jgj constraint appli algorithm properti algorithm low complex analyz complex algorithm ne cardin oe nc cardin ff ng size length ff cardin note ffl ne nc ng ffl step execut time ffl test ae step time time data arrai index edg label oe time ffl procedur merg execut ng time step ng time total cost execut merg ne data time algorithm run time implement data algorithm run time proposit show algorithm correct proposit schema finit subset path ff fi algorithm comput structur jgj path iff ir iff ir step algorithm ensur lemma step ensur denot extens respect easi verifi ir theorem definit easi verifi ir definit easi verifi induct number step construct show path ae exist node jgj ir step construct fact correspond applic rule step correspond applic step correspond applic merg correspond applic commut verifi ir verifi ir proposit algorithm theorem theorem immedi undecid context explor impact type show theorem context set construct implic finit implic problem pw remain undecid line proof theorem show theorem reduct word problem monoid present encod word problem monoid term implic problem pw show encod reduct begin definit schema recal alphabet section defin ffl ffl defin fcg ffl note symbol record label binari relat symbol ff repres path denot ff straightforward verifi type constraint lemma ff properti uniqu jgj node denot ff uniqu encod equat recal finit set equat section encod term finit set constraint pw pw notion pw defin section constraint constraint consist constraint defin fi constraint fi consist constraint defin encod test equat constraint pw subset pw reduc word problem monoid problem determin reduc word problem finit monoid problem determin show identifi basic properti easili verifi lemma lemma fi show proof similar lemma jgj uniqu node jgj uniqu node jgj ln figur structur satisfi lemma ff ff ff uniqu node jgj ff jgj straightforward induct lemma structur satisfi form shown figur lemma fi lemma uniqu node jgj denot node lemma uniqu node ff jgj ff uniqu node fi jgj fi ff fi lemma ff fi show encod reduct word problem monoid suffic show lemma lemma context ff fi iff iff proof similar lemma prove proof similar simpler show exist structur exist finit monoid homomorph defin relat proof lemma ae ae defin proof lemma defin construct structur jgj ae distinct node distinct node defin jgj fo ae unari relat popul ffl ae ffl fo ffl fo binari relat popul ffl ffl ffl ae ae construct easi verifi claim claim note ae ae ae ffi ffi proof lemma shown finit finit claim construct claim ff fi ae ff fi homomorph ae ff ae fi ae ff ae fi construct ae lemma uniqu straightforward induct shown ae ae ff uniqu node jgj ff ae ff fi ae fi ae ff ae fi fi ae ff fi claim claim show uniqu node jgj ff fi ff fi exist show show exist finit monoid homomorph defin relat ae iff note lemma easili verifi relat lemma ff fi lemma lemma ff proof lemma ae class ae respect notion defin ae proof lemma show claim claim finit show ae ae sg fs ae ae lemma ae finit function jgj jgj jgj finit function sg finit easi verifi ae iff ae function sg defin ae total inject sg finit defin binari oper ffi ffi proof lemma easi verifi claim claim ffi ae ae ae ae show ae ae lemma jgj exist uniqu jgj ae uniqu jgj ae ae ae ae lemma ae ae ae ae ae claim ffi associ proof found proof lemma claim ident ffi proof found proof lemma finit monoid defin ae proof lemma show complet proof lemma undecid context show theorem context finit set construct implic finit implic problem pw undecid recal schema defin section note schema proof lemma establish undecid finit implic problem pw context reduct word problem finit monoid establish undecid implic problem pw suffic show finit implic problem implic problem coincid show lemma lemma schema defin section context finit subset fg model model lemma finit subset fg iff note lemma implic problem pw undecid finit implic problem pw undecid note implic problem finit implic problem lead decid problem problem consid connect schema defin logic show lemma proof lemma fg ae model construct finit structur recal notion defin proof theorem recal notat definit fgg construct distinct ffl jg jg ffl ffl jg ffl augment jg class jg type class show structur desir node jgj finit outgo edg definit jg finit finit construct jg finit easili verifi easili verifi iff iff suffic show assum exist jg ff loss assum ff shortest length path construct jg ffl ff ff ff ffl class jg ffl ff outgo edg node jg jgj argument jg definit path fi ff length contradict assumpt structur desir prove lemma lemma hold context shown lemma structur form shown figur node node repres fr node element repres infinit set structur case context implic problem local extent constraint light theorem tempt ad structur simplifi reason path constraint case section show decid result develop semistructur data break type investig implic finit implic problem local extent constraint theorem context semistructur implic finit implic problem local extent constraint decid ptime theorem context data model implic finit implic problem local extent constraint undecid theorem context data model implic finit implic problem local extent constraint undecid note implic problem local extent constraint special case implic problem corollari theorem corollari context data model implic finit implic problem local extent constraint decid finit decid untyp data show theorem idea proof reduct word constraint implic shown context semistructur implic finit implic problem pw decid lemma context semistructur implic finit implic problem pw decid ptime defin function construct reduct ff path constraint defin constraint ffl forward ffl backward recal definit implic problem local extent constraint definit fg finit subset prefix bound path ff binari relat symbol bound ff definit partit foe oe oe bound ff oe oe forward constraint prefix ff form ff ff ff path ff prefix ff reduct defin step defin function oe oe remov ff prefix oe fg oe fg defin function oe oe remov prefix oe fg oe pw pw function establish lemma context semistructur iff iff iff iff lemma suffic show theorem implic problem local extent constraint reduc implic problem pw note ff determin function comput ptime decid implic problem local extent constraint ptime decid implic problem pw prove lemma proof lemma show proof similar simpler proof consist part part show iff suffic prove path ff finit subset fg finit model iff finit model simplifi assum constraint forward form proof gener case similar finit model construct finit model construct finit oe signatur defin section recal notat pf lt rt definit exist oe fgg defin ffl fo ae path mg ffl ffl iff easi verifi finit jgj finit jgj definit show exist oe exist definit contradict assumpt oe finit model show finit model ff ae ae ae ae ff denot ae prefix section ae ff ae distinguish node jgj ffl jgj fc ae ae ff ffl ffl ffl iff condit exist ae ff ae ae ff exist ae ff ff ae ae jgj easi verifi finit jgj ff finit show observ simpl construct fact uniqu node ffl ff ae iff ae fact ae ff ffl jgj fr ae ae ffl ff ae ae ae ffl ff ae ae ae show exist fact ffl oe exist oe exist ffl fact fact construct contradict assumpt part show iff argument part suffic show finit model construct finit model ffl jgj fr ffl augment edg label structur shown figur finit finit show model oe definit prefix construct oe definit oe oe figur structur proof lemma oe oe bound definit oe form fi fi ffl definit exist contract assumpt model oe note bound form fi fi ffl form definit complet proof lemma note proof applic context schema structur shown figur due type constraint theorem conflict proof theorem recal defin section set prefix bound subset breakdown decid show decid result establish break context prove theorem reduct word problem monoid recal alphabet section defin schema ffl ffl defin fcg ffl note letter record label ff repres path denot ff encod equat recal finit set equat section encod term finit set consist constraint fi fi encod test equat constraint definit easi subset prefix bound set partit ffl consist defin constraint bound ffl consist constraint bound oe prefix oe constraint reduc word problem monoid problem determin reduc word problem finit monoid problem determin section easi verifi lemma lemma hold context due type constraint context semistructur lemma longer hold gener lemma properti uniqu node node denot exist uniqu node ff statement hold uniqu jgj node denot ff uniqu lemma fi lemma ff ff ff uniqu node jgj ff lemma jgj lemma fi show encod reduct word problem monoid lemma context ff fi iff iff proof similar lemma prove proof similar simpler construct exist finit monoid homomorph defin relat proof lemma ae ae defin proof lemma defin defin jgj ae defin proof lemma distinct node defin jgj fo ae unari relat defin proof lemma fo binari relat popul ffl ffl ffl ffl ffl ae ae structur shown figur note valid record jgj proof lemma easi verifi ffl ffl ffl show show exist finit monoid homomorph defin relat ae iff proof lemma shown ff fi ff fi proof lemma defin ae notion defin ffi proof lemma verifi ln figur structur proof lemma ffl finit ffl ffi ffl ffi associ ffl ident ffi finit monoid defin ae proof lemma verifi ffl homomorph ffl ffl complet proof lemma breakdown decid show theorem type system theorem break implic finit implic problem local extent constraint undecid context finit implic problem local extent constraint undecid context note schema defin section schema proof theorem establish undecid show implic problem local extent constraint undecid context lemma suffic proof lemma similar lemma lemma schema defin section context finit subset fg model model context implic problem finit implic problem local extent constraint coincid undecid implic problem local extent constraint undecid finit implic problem local extent constraint form constraint separ semant xml type constraint path constraint investig interact demonstr ad type system case simplifi analysi path constraint case make harder studi constraint introduc interact type type system objectori model similar studi support record set type system support finit set set model restrict dozen result establish paper interact constraint type system shown implic finit implic problem undecid context semistructur decid finit type ad shown implic finit implic problem local extent constitut fragment decid ptime untyp context type problem undecid result show decid result establish untyp data break type system occur studi interact path constraint gener type system studi theorem complex lead undecid result extens work studi form practic integr constraint interact type system extens design path constraint syntax conform xml xml dtd constraint section xml constraint express path path path path path path describ syntax extern link studi accomplish remain acknowledg leonid val tannen victor vianu valuabl comment discuss refer abiteboul intern confer theori vianu foundat publish abiteboul kanellaki ident queri acm sigmod intern confer manag pp abiteboul vianu path queri acm symposium principl gurevich classic problem malhotra content descript note paoli markup languag recommend buneman tutori acm symposium principl weinstein undecid implic problem path technic report depart comput inform weinstein decid restrict implic problem path technic report depart comput inform weinstein constraint semistructur structur acm symposium principl cattel morgan san suciu queri languag note mathemat introduct logic academ note anthoni transform data structur phd depart comput inform lassila swick descript framework model syntax work draft de rose note maler link languag work draft round van benthem ter handbook logic languag
DB/384 3 constraint satisfact view updat translat hua shu abstract view updat problem translat updat request view updat request base data present approach problem relat condit tabl repres relat translat view updat problem disjunct number constraint satisfact problem solut csp correspond translat view updat semant inform resolv ambigu handl addit constraint csp approach enabl appli rich result csp research analyz solv import problem manag introduct relat view virtual relat schema make user focu relev data view queri languag materi physic copi view store virtual relev inform view comput view updat problem refer problem updat issu updat request view problem attract lot attent commun procedur view updat translat updat base relat defin problem view updat updat base data exist determin uniqu translat view updat request maintain consist free side addit inform applic semant gener translat procedur procedur ad problem formal problem solv separ ad semant inform resolv ambigu chang problem specif render procedur contribut show problem view updat translat transform constraint satisfact problem mean condit tabl solut csp correspond translat view updat semant inform resolv ambigu handl ad constraint csp approach enabl util rich result institut fur universitat lang germani current dept comput sweden grow csp includ larg number constraint satisfact algorithm techniqu paper extend abstract includ proof found paper organ briefli describ view updat translat problem consid condit tabl simpl exampl illustr basic idea approach translat view delet insert view modif handl composit delet insert present transform rigor section complex approach discuss view updat translat denot instanc scheme set semant constraint scheme assum satisfi constraint view defin relat algebra express instanc view respect denot updat model map instanc instanc denot request updat view updat view denot problem defin translat translat updat updat consist hold view defin relat algebra express relat shown tabl stand project attribut stand natur join requir tupl concaten common attribut tabl attribut denot assum user issu request delet tupl effect delet relat tupl fl shu ecai european confer artifici intellig edit henri prade publish john wilei question translat delet request updat request base relat view delet request translat delet modif determin translat delet import identifi tupl give rise tupl tupl call tupl tupl delet tupl lead delet view delet lead delet tupl view tupl tupl exact translat delet request delet relat worth notic approach fail find translat ambigu major problem view updat multipl translat view number translat translat priori rank respect set predefin prefer criteria translat view updat involv iter check uniqu translat semant inform find translat view multipl user inform resolv user translat problem consid paper concern search consist state satisfi satisfi translat show paper problem transform csp semant inform resolv ambigu readili handl addit constraint prefer polici optim translat requir minim updat adopt prefer translat perform minim requir user cancel effect updat condit tabl relat data free tupl tupl variabl condit tabl tupl tc finit set free oe map associ logic formula tupl call local condit condit express built mean boolean connect constant equal atom form variabl constant condit repres column label con tupl local condit call naiv tabl local condit true call horn tabl local condit conjunct atom equal denot special term repres undetermin similar variabl domain assum domain domain variabl model delet tupl relat denot evalu condit respect valuat evalu condit defin equal atom true evalu evalu condit boolean connect base strong kleen logic respect valuat condit satisfi falsifi undefin condit valuat condit true omit local condit con column omit instanc free tupl respect valuat denot assign variabl tupl denot tc jg call state tc respect set ic tc denot collect state tc review definit relat oper interest reader consult tabl illustr repres relat view naiv tabl tabl con condit tabl evalu semant correct manner respect primit relat oper cartesian union set ic queri denot result queri set ic proven theorem oper en oper defin union set ic hold valuat variabl ic queri set ic repres consid result appli proof result definit relat oper definit affect introduct evalu oper set bound belief nonmonoton reason shu polynomi maxim size theorem basic idea relat view defin term relat oper select join involv equal updat oper deal singl tupl relat binari csp csp constraint involv variabl csp constraint involv variabl call gener csp constraint consid condit defin section research csp restrict binari csp gener csp transform number binari csp constraint gener csp disjunct condit cn csp transform result replac origin csp disjunct constraint conjunct condit cn connect simpli omit eventu lead set csp disjunct result csp binari csp constraint equal atom form negat equal atom binari csp tupl finit set function map variabl domain equal atom satisfi equal atom satisfi constraint posit constraint neg solut constraint satisfact problem valuat variabl satisfi constraint falsifi constraint csp solvabl solut exist neg constraint deriv posit posit constraint deriv neg csp solvabl due space review relev approach solv csp interest reader consult book attribut distinguish view defin relat express set attribut involv attribut select condit union distinguish attribut call extend attribut set recal relat shown tabl attribut attribut extend attribut set view attribut translat delet request recal relat shown tabl delet tupl approach determin translat replac valu relat attribut extend attribut set variabl outcom tabl shown tabl valuat variabl domain function dj domain attribut extend dj dj fjg dj dj dj dj fjg dj dj fjg jg call relat respect stand delet modif condit tabl shown tabl repres view find constraint effect delet state case valuat defin evalu tupl respect result tupl condit condit falsifi construct binari dj fy fx number solut csp recal valuat defin updat base relat compar updat base relat origin base relat deriv updat delet tupl translat view delet solut csp correspond translat view delet semant constraint solut delet view translat delet relat formul term ad constraint csp obtain dj fy fx solut updat base relat respect compar updat base relat origin base relat deriv updat base relat modif tupl delet tupl modif tupl updat base relat respect compar updat base relat origin base relat deriv updat base relat modif tupl delet tupl criterion minim updat adopt solut minim valuat variabl respect prefer notion minim mean simpli assum minim minim number updat prefer solut translat delet request updat base translat updat belief nonmonoton reason shu translat insert request insert tupl altern wai translat insert view depend semant translat modif translat insert start translat insert request modif relat includ domain delet consid call tabl stand modif domain variabl assum valuat defin condit involv variabl evalu tupl respect result tupl condit fourth condit falsifi construct binari fx fx csp solvabl neg constraint deriv posit constraint valuat defin easili check csp construct base valuat solvabl translat insert request modif translat insert request insert add free tupl tupl variabl variabl repres valu attribut defin domain variabl domain attribut result relat free tupl call stand insert tabl show repres view con achiev effect insert make condit tupl condit insert side affect construct fb csp transform binari csp neg constraint time posit constraint solut binari csp translat insert transform gener procedur approach solv view updat problem summar algorithm depend view definit primit view updat request creat naiv tabl repres search space translat view updat request ffl updat request ic respect ffl updat request intend translat insert base ic respect insert request intend translat modif base ic respect valuat variabl introduc ic wrt call tupl view updat specif comput view ic repres tc tc base closur properti infer mean state respect view state construct csp base valuat variabl tc solut construct csp solv construct csp prove translat procedur present gener translat view updat request theorem view updat specif translat procedur algorithm gener instanc satisfi construct csp construct csp base state kei technic problem approach tc show construct csp base state valuat variabl tc solut construct csp valuat partial respect variabl algorithm state tc tabl defin set attribut valuat constraint satisfact problem base view state construct ffl set variabl tc ffl function defin domain variabl tc ffl partial valuat vp assign valu variabl smallest set satisfi belief nonmonoton reason shu defin subset tabl ft tupl tupl constraint smallest set prove csp construct base algorithm requir properti theorem state tc defin set attribut valuat variabl tc solut construct csp base algorithm discuss approach comput view construct csp base state solv csp complex comput view polynomi size base relat definit multipl csp construct base state tc due multipl partial valuat vp satisfi condit denot number variabl tabl denot maxim size domain variabl number csp time complex construct csp base state tc number constraint construct csp time complex solv csp approach bound exponenti number variabl handl semant comput enforc constraint naiv tabl obtain step algorithm result repres set horn tabl equal gener enforc polynomi tupl gener depend exponenti growth local condit approach bound exponenti size base relat semant constraint consid approach suitabl applic number variabl introduc base relat limit depend equal gener tupl gener summari studi approach view updat translat basic idea transform problem constraint satisfact problem provid sound complet transform updat view report attempt direct formal devic condit tabl approach make modifi problem formal chang underli problem solver add chang semant inform intend updat modifi underli csp solver remain make rich result csp research design algorithm solv view updat translat problem approach depend current instanc view appli view updat view definit time approach adopt complement previou approach case view updat satisfi suffici condit exact uniqu translat suggest translat view updat highli desir acknowledg work support part swedish research council engin scienc invalu comment previou version paper refer bancilhon semant relat acm transact dayal philip correct translat updat oper relat acm transact antonio marco relat queri process won david don problem incomplet inform relat gupta materi techniqu ieee engin tomasz imielinski jr inform relat journal translat view updat updat view involv acm symposium principl pp acm press role semant translat view updat ieee view updat translat view definit intern confer larg data base pp morgan kaufmann introduct van updat relat independ acm transact relat view updat translat intern confer larg data base pp palo morgan kaufmann publish hua constraint satisfact view updat translat technic institut comput edward foundat constraint academ belief nonmonoton reason shu
HCI/385 4 state art distribut depend comput john bate laboratori commun engin uk report octob report dedic memori fonseca forward mean technolog latest exist form product research project investig product futur commiss prepar report distribut depend determin creat bore survei assess map direct express opinion research area highlight special fund attent overrid aim europ anticip adapt readi gain greater share global market centuri report structur analysi academ industri research commerci product rang technolog area rang technolog cover depth network breadth option technolog includ provid repres illustr time write technolog warrant treatment includ distribut depend system technolog enhanc advanc emerg write report hear omit reader feel inclin contact compil report interview intern expert area cover ning expert read comment rst draft opinion express report opinion expert opinion sought individu aspect de nition choic project opinion necessarili bad thing disagr factor stop open discuss forward hear john cambridg octob acknowledg peopl provid advic opinion creation report includ ross richard stephen gile nelson ian pratt read comment initi version report includ nick xavier mark research brian marc paul watson xu david powel excel detail comment extend gratitud member execut board support assist develop document network excel distribut depend system fund european commiss esprit programm mission coordin european research distribut depend make research access govern industri qualiti educ system address aspect design network comput system system rang system control aircraft ight applic search inform web inform author john bate lectur commun engin uk director commun technolog compani activ media john involv membership execut research link industri inform ii content introduct europ academia industri futur predict report structur distribut applic network architectur wire network local area wide area connect high perform cluster intellig devic home area network exist lan network comput intellig control lan wireless network local area wireless wide area wireless gener wireless network wireless local loop network oper system academ os research commerci os research mainstream oper system oper system iii depend system research theme speci test valid languag tool support relationship standard depend system distribut object technolog select platform commerci corba recent success market consolid user base aliat develop commerci academ research distribut object servic distribut share memori mobil agent world wide web commerci web technolog enhanc web cach architectur gener web world wide web distribut system mobil comput locat technolog wide area locat iv local area locat augment realiti wearabl comput servic support locat applic mobil applic support locat system distribut multimedia platform qualiti servic middlewar platform support multimedia applic multimedia object con gurat build multimedia object media multimedia applic multimedia groupwar commerci multimedia system mobil multimedia distribut multimedia platform distribut groupwar synchron groupwar collabor virtual realiti asynchron groupwar work ow distribut groupwar support gurat distribut system support persist data distribut applic system persist languag tupl space persist distribut share memori servic network storag servic high perform file servic intellig storag devic video demand multimedia storag architectur network storag servic distribut system manag distribut system secur authent cryptographi redund scatter distribut system secur languag distribut program distribut system distribut object con gurat reactiv control distribut system distribut system theori recommend vi introduct report map worldwid distribut depend comput aim europ posit refer worldwid addit technolog factor interest analysi report assess area europ ahead rest area section report assess relationship industri academia section futur develop consequ project section report analysi distribut depend comput structur number section introduc structur report make recommend suggest relat european research base analysi worldwid exampl motiv applic area relev introduc section europ current distribut depend comput project origin europ unit state recent year maintain statu area distribut depend comput due number high qualiti research excel academ institut research lab rich industri base develop market product skill invest worldwid market research product con denc research commun superior lack competit europ factor attribut number includ lack govern lack europ abil challeng bad reput european softwar product pick european industri perform impress major player act worldwid european academ industri ibm al counterpart europ secondari statu due lack research talent abil european countri pocket high qualiti work europ match usa unit thrust fortun situat europ continu develop world forc reckon sphere distribut depend comput factor contribut european address focu report european academ diculti market work worldwid commun con dent strategi feed european research idea commerci research fund bodi invest european research develop distribut depend comput directli compet prove superior similar project report acronym abbrevi analysi point europ ahead rest world term assess futur develop provid academia industri analysi distribut depend comput includ factor relat academ industri research commerci product bound analysi area mainstream oper system fact academ oper system research ahead industri product term situat simpl market leader oper desktop dictat technolog deploi consum academ research provid viabl hope uenc exist standard emerg person mobil academia blank sheet paper lead industri properli develop academ work feed industri product bene cial payo academ process issu industri account import assess invest research area topic extrem industri interest ascertain fund bodi invest interest bene ting industri bodi assess level industri develop area vital industri invest great deal research directli relev industri fund requir academia academ fund bodi avoid sponsor academ work mirror industri sake pure academia luxuri focuss relev industri futur collabor academia industri industri partner real requir test design model link back section situat complic fact research lab industri locat european fund american compani bene cial situat europ illustr fact world true global economi compani massiv european market extrem import massiv public surround recent set microsoft research laboratori england welcom europ develop industri develop european world largest corba vendor illustr slowli happen futur predict research report consid futur develop futur bright academia ahead europ ahead invest research prudent case technolog domin commerci invest research ectiv industri lan wan dan han soft hard convent oper system network architectur hard system arch mobil agent system distribut share memori web distribut object platform middlewar event system mobil comput multimedia system distribut groupwar system languag distribut system secur theori storag transact manag servic persist distribut applic safeti critic internet commerc busi applic mobil applic depend system figur structur report report structur figur illustr structur report project report divid layer lowest layer network includ network type network project area discuss section project involv network hard system discuss section network oper system layer discuss oper system document target speci calli support distribut depend system section describ mainstream oper system project section cover detail oper system system layer oper system applic term middlewar depend system issu intersect middlewar layer provid reliabl issu depend discuss section lower middlewar layer choic platform technolog build distribut applic includ distribut object section distribut share memori section mobil agent section web section higher middlewar layer concern technolog build lower level gener technolog creat advanc technolog platform target support speci class applic system includ report distribut system section support mobil comput applic section support distribut multimedia system section platform distribut groupwar section platform gurabl distribut system section system coexist build complex distribut con gurabl mobil multimedia middlewar servic layer concern distribut servic manag function applic discuss network storag servic section servic structur data includ persist languag section distribut transact system section servic distribut system manag section languag layer concern languag distribut system section issu concern level distribut system report cover distribut system secur section theori section distribut applic wide rang distribut applic commerci concept demonstr research system distribut applic drive process distribut system distribut system design good understand applic requir build system overview potenti distribut applic scope report applic area provid motiv current distribut system support project safeti critic applic includ network control system process manag manufactur system nuclear reactor monitor system address support depend comput internet electron commerc involv global web includ servic web di erent middlewar approach address requir mobil agent distribut object technolog discuss relev busi intranet class applic includ cooper work work tradit applic middlewar technolog relev includ distribut support support transact manag mobil applic techniqu make applic mobil develop number user mobil comput commun equip expand area overlap middlewar multimedia groupwar mobil multimedia conferenc network architectur section discuss current technolog network network architectur background discuss distribut network technolog dictat physic transport build interest research academia industri close sync area relationship realiti physic network dictat academ paradigm technolog transfer wide commerci system section divid discuss wire wireless network paradigm wire network rang tradit wire lan emerg wire home area network wireless network includ person cellular commun immin higher bandwidth satellit commun system distinct applic area wire wireless technolog begin introduct wireless local loop er high bandwidth commun direct rival wire backbon network technolog network architectur hard distribut system design oper predict redund built toler failur architectur discuss section wire network discuss wire network cover commun media protocol interest model devic network discuss local wide area emerg area network composit includ intellig home area network network comput altern exist local area predict domin asynchron transfer mode network desktop market due commerci technolog technic superior solut ethernet technolog domin lan switch ethernet ethernet adopt wide high capac server market leader relat technolog includ cisco hp atm superior tradit ethernet virtual circuit er low latenc high throughput solut address problem ethernet context switch ethernet coupl virtual circuit solut interfac consortium small switch solut investig notion switch chip reli bu er endpoint er low latenc solut fast network predict year solut produc undercut ethernet er link machin approach deploi commerci ibm academ twent switch wide area atm import technolog backbon network market altern atm frame relai virtual atm market fore er solut backbon problem ip run hybrid network protocol internet design internet provid byte support compat exist byte address incorpor function provid multimedia support bandwidth reserv packet secur infrastructur ecienc scheme ow identi cation number assign router path store inform packet deliveri comput incorpor technolog mainstream depend microsoft polici ad support market domin rang oper system section connect home busi reli technolog connect internet digit subscrib technolog high data rate transmit exist twist copper pair support simultan transmiss tradit phone servic digit multimedia trac servic multimedia servic er downstream channel bit rate upstream control channel success video demand trial mass occur due insuci demand high rate digit subscrib er higher rate downstream upstream develop work copper wire short distanc requir high perform cluster cluster workstat altern parallel comput high perform applic area discuss report base model distribut share memori section high perform video demand servic section intellig devic desk area network techniqu workstat design bu architectur intellig autonom screen devic attach switch origin work cambridg architectur base atm switch devic commun atm cell similar system eth zurich southern california work cambridg develop includ sourc network design deploi distribut system commerci product emerg network attach storag devic disk onboard processor attach directli fore system video devic home area network research area network devic home includ wash central heat system idea user manag home integr lan exist distribut system le home area network follow peopl central heat automat kid home signal start cook dinner mobil comput whilst home project address issu work cambridg low bandwidth atm network interconnect devic home research underwai provid manag model home area network exist lan network comput model comput local area push strongli commerci quarter network comput involv return simpl user termin thin servic power server machin advantag network comput cost workstat cost system mainten instal softwar softwar download requir central server java word processor download local browser session user system le store manag lost le local backup appeal bene model network comput prove commerci success due market invest product low cost solut sun oracl sell network comput solut intellig control lan area attract attent commerci network switch router manufactur involv put intellig switch router give client control network relev project mit activ network network activ router switch network activ process user user administr inject program network tailor requir user activ network send compress program node network request node execut program process packet recent work pennsylvania bellcor develop activ network system care design plan languag activ languag simpl ecient plan program strongli type static inject network plan program call resid servic thing authent program altern approach activ network er cambridg control atm project project consid data examin network control control path alloc share switch provid bandwidth reserv qo export manag control interfac polici implement di erenc approach activ network activ network put intellig switch approach intellig switch applic implement polici wireless network interest research commerci domain wireless network technolog support user mobil wire environ section exist futur system person wireless intellig mobil devic describ wireless local altern technolog wire line internet connect european commerci solut research project lead world technolog local area wireless local extens exist network wireless ethernet mobil comput card support radio commun base station attach lan technolog commerci market leader wavelan lucent technolog short commonli emploi standard irda red data standard support million devic worldwid technolog compar research blue tooth problem technolog sensit bright light narrow view angl european famili standard digit high speed wireless commun spectrum develop telecommun standard work standard novemb standard serv ensur di erent manufactur wireless commun equip oper spectrum standard describ common air interfac includ physic layer wireless commun leav higher level con gurat function open equip manufactur wide area wireless commerci mobil telephoni servic current solut person wireless voic data connect system european digit gsm standard ahead region adopt gsm gsm develop european group special mobil proven robust system finland gsm mobil phone system support data includ sm messag gsm technolog superior superior busi model roam agreement support seamless gsm phone provid countri current support data trac inadequ support applic multimedia conferenc current user base sati ed voic data trac account gsm trac europ devic integr commun gsm person nokia user demand fall cost technolog facilit rang soni instal gsm phone digit watch gener wireless network gener person data servic support adequ bandwidth mobil user access multimedia data servic support global coverag standard requir cater requir gener mobil telephoni data standard call mobil telecommun origin race scheme introduc integr broadband commun network provid standard telecommun system europ de ne european standard enabl global usag person mobil commun surround move cellular coverag cover call type cell diamet commonli indoor micro cell diamet outdoor citi trac densiti high larg amount macro cell diamet km core cell cover major countri satellit cell cover vast area give mobil access user remot region factor research domain european research exodu investig factor interconnect public telecommun includ public data network integr broadband commun network system xed part network independ xed network infrastructur base asynchron transfer mode technolog system er wide rang servic di erent environ mean famili radio network interfac termin termin access usabl bandwidth air provid broad rang data applic potenti applic expect support credit card electron document le termin simultan voic live multimedia concept exibl support data servic de ne todai refer satellit network satellit er total earth coverag mobil telephoni initi motorola leo proprietari compat limit data bandwidth er onlin year system compat er higher bandwidth refer research project investig blue tooth consortium radio blue tooth industri consortium includ nokia toshiba attempt establish standard radio interconnect replac irda experi low low rang ubiquit wireless network enabl applic devic addit protocol support gsm cellular devic sm messag byte messag devic ort deliveri basi method asynchron deliv latest travel report emerg technolog sm smart messag involv gsm devic interpret messag mobil program applic restaur menu order inform download standard mobil phone massiv rang applic envisag technolog wap applic attempt technolog consortium includ motorola planet de ned wireless markup languag download extend function wireless local loop wireless local loop technolog aim market fast internetwork reli xed antenna oper basi rang er bandwidth site wireless local loop technolog enter commerci domain great speed attract site internet home great potenti internet develop countri big player market includ nortel lucent network ubiqu network mean oc environ network desk area network network comput make impact busi stai accept home area network delai research home user set vcr successfulli excit envisag world ubiquit wire wireless network set cook dinner digit watch whilst transit home lead wire network europ lead wireless network mobil user wireless excit europ maintain sphere high bandwidth wireless local loop lead rapid internet worldwid oper system oper system provid endpoint support distribut comput section discuss mainstream oper softwar deploi busi domest system support multimedia qualiti servic improv perform applic oper system system discuss separ section mainstream oper system research domain complex academ research ahead industri extent irrelev core requir busi research domin marketplac forc dictat direct oper system develop os desktop war microsoft os server war won competitor nt server variant unix eventu nt user lock manufactur platform applic run microsoft posit dictat evolut oper system duti os research ensur microsoft pai back invest made european fund technolog incorpor gener case recommend report mainstream os research europ cut link continu theme report account industri put back mainstream os fund usefulli develop os includ wireless chang discuss academia dealt separ commerci system academ os research academ domain ahead commerci domain oper system technolog research design build structur support high bandwidth applic main approach soft schedul multimedia qo improv structur qo outstand european os kernel develop part pegasu ii project support qo resourc includ displai disk prototyp fulli impress demonstr construct european project note gener aim overcom limit ecienc exibl rst gener system linux oper system run top er function process run linux lead project spin scout mit provid qo aim provid perform improv applic run version tailor protocol stack demonstr show perform improv construct web server mechan web server creat http put tcp ip header check valid packet transmiss massiv perform gain arguabl extens prioriti gener os er qo spin approach blur distinct kernel applic applic kernel dynam link code run system kernel extens add kernel replac default migrat applic function kernel address space sensit kernel interfac secur restrict properti program languag idea improv perform reduc number context download disk routin kernel prevent applic handl interrupt approach incompat approach scout arizona design applic qo issu de ne notion path extens network connect qo commerci os research popular commerci oper system microsoft window oper system oper system support design speci calli support qo multimedia commun sun microsystem commerci os platform multimedia applic multimedia work qmw support qo project comput construct real time oper system speci calli design multimedia box support qo drawn commerci provid put qo natur network support requir schedul insuci mechan distribut multimedia oper system wireless devic expand market market leader microsoft version window highli regard altern excit recent develop joint ventur nokia motorola aim develop epoch compani smart phone mobil devic pose threat potenti microsoft market futur devic mobil phone handheld window ce deriv comput commun devic support import manufactur mainstream oper system argu research system embodi qo total network devic resourc awar superior ad hoc extens distribut system develop part pegasu ii good thing fund esprit scout system high rank dicult tap mainstream os market good research diversifi target support mobil devic excit european research collabor link develop oper major partner european compani european futur import futur issu support qo link middlewar provid high level access system develop middlewar qo architectur implement properli support lowest level requir easi program mechan encod polici babi monitor resourc give user interfac desktop user select qo level applic qo meter slider applic area receiv research recent low point europ os research histori symposium oper principl sosp wide regard system confer held europ rst time paper european institut includ jointli author ibm watson research centr defenc lower submiss european paper blind review process undesir situat highlight issu discuss issu interest question percept argu strong os research commun work europ adequ standard note refer work european accept fault manner write public work chang attitud activ research link theme report market research europ low notic shout exclud argu european longer gener interest mainstream os research case ensur equal confer work oper system hard oper system gener deploi miss deadlin catastroph exampl system car nuclear reactor control system due wide experi success develop mar project vienna mar involv analysi develop time system cover hardwar schedul perspect design process control vehicl control system mar architectur emploi redund fault toler node check hardwar compon duplex bu node period execut set task node receiv messag execut send execut mar deploi subject major coordin program valid group domain hard schedul knowledg requir maximum execut time work includ knowledg constraint analysi tool develop support mar os provid analysi worst case execut time work assess ectiv polici schedul hard system choic time trigger event trigger reduc commun mar trigger fault toler commun system implement architectur transport system mar hard system approach includ system hard deadlin analysi system statist task reach deadlin tendenc gener resourc share project guard project carri consortium includ compani deploi comput respect applic nuclear railwai space system aim guard project signi cantli lifecycl cost system project design gener cot hardwar oper con gure instanc aim meet requir critic applic domain project california san diego project promot approach call fail awar time asynchron system model system toler partit commun trac light connect junction commun trac throughput event commun independ switch safe state approach appli europ implement automat underground railwai system adapt fault toler task address europ project alpha kernel spring kernel european team york collabor spring group adapt fault toler system border concept discuss section aspect spring develop dynam schedul task arriv dynam time resourc constraint account avoid priori comput worst case block time task dealt static schedul kernel embodi ectiv architectur retain signi amount applic semant run time approach high exibl grace degrad plan applic semant featur integr provid direct support achiev applic system level predict kernel global replic memori achiev predict distribut commun abstract provid kernel includ plan time support spring strive exibl combin techniqu system develop support dynam task make fault toler object base support distribut system object servic access point oper object inform object comput time deadlin retain object dynam schedul develop top unix major system research group european academ commun concentr approach meet real time work relat ada group contribut work close british aerospac roll commerci oper system design support os softwar system extens small set option cooper process exibl architectur scale lean scale virtual orchestr hundr processor sell commerci option recent er function small footprint notabl system path nder mission mar europ sun commerci product er di er provid richer develop includ corba orb oper system provid design multimedia discuss section depend system area depend comput cover relat rang research topic includ fault fault fault remov fault forecast topic fault prevent major driver work formal program languag softwar engin research commun depend research commun main seek bene concentr ort research topic secur consid part realm report dealt separ section depend system research cover stage system develop mechan depend run system section deal depend system disciplin issu depend relev report depend distribut system commun overlap fault toler groupwar transact depend system research cultur depend system commun develop technolog area control system depend critic depend comput commun european research carri notabl expert research team led brian randel paulo david powel luca herman unlik distribut system expert work cooper project past year project issu depend comput project focuss cooper close industri unlik area distribut european involv depend comput referenc extens american paper due work produc group individu research theme nation industri fund project europ develop theori techniqu area depend comput europ research theme develop consist involv collabor centr excel includ newcastl technolog vienna citi york project ort develop esprit project depend comput end project investig make develop depend comput system predict ectiv current project safeti qualiti evalu depend investig approach current standard practic safeti secur project remark continu develop involv top european research activ collabor speci test valid speci test valid formal speci cation document autom introduc gener test case valid process formal speci cation wide speci cation autom stage lifecycl canada contributor aspect depend comput research contribut area formal speci cation document depend system assist valid system function work great interest nuclear issu valid critic softwar import project repres area advoc formal speci cation strengthen autom object composit techniqu improv system design function test formal speci cation involv automat select test data techniqu develop project approach combin main approach determinist approach test data gener probabilist er good test coverag work continu project simul occurr fault inject techniqu fault inject mean test mechan assess ectiv coverag estim current includ techniqu simul error inject upset radiat fault inject design phase mean fault simul model institut lead research includ coimbra chalmer languag tool support distribut program distribut object make languag depend comput object approach object structur develop fault toler middlewar approach adopt european project toler hardwar activ replic object mit actor model similarli pursu softwar implement toler hardwar fault extend activ object model work project improv approach toler design fault work structur improv design fault toler valid continu project techniqu toler hardwar fault develop base compil ection automat insert place call replic checkpoint manag code transpar applic programm european ort project project exploit softwar architectur paradigm subsect design construct depend system involv rigor de nition depend softwar architectur guid integr fault toler mechan respect requir depend properti issu fault toler error recoveri distribut concurr languag work carri inria renn languag construct improv reliabl distribut system support forward backward recoveri distribut transact process system illustr paradigm toler physic fault system programm request action execut failur occur rollback state initi exampl system argu inform section replic object mechan support fault provid consist altern object network connect fail atom group isi repres mechan fault toler maintain consist object replica work isi group cornel navig group lisboa investig model framework group support area depend comput middlewar handl degrad servic occur network partit relev applic mobil comput cooper work describ applic reliabl maintain oper condit order deliv qualiti level feasibl network applic ronment awar dynam modifi behaviour depend oper environ recent environ awar work focuss speci cation implement system servic support partit awar continu oper network applic restrict singl partit span multipl concurr partit goal system provid mechan polici govern partit oper applic decid servic partit qualiti level notabl project area includ transi israel ort area perform itali earli work bologna start broadcast project continu project end lead implement call base process group technolog suitabl extend system implement middlewar recent work involv integr result group commun servic java rmi method technolog design group collect replic remot object eld depend middlewar develop area clear develop depend system requir standard area distribut system area involv servic tool aid construct depend system work carri guard project studi middlewar enforc integr polici aim con ning ect design fault softwar michigan construct middlewar platform build integr distribut servic platform includ process group inform middlewar includ found section washington develop corba orb call tao inform section project construct middlewar distribut applic project object provid set extens middlewar servic schedul network execut clock er strict tool support depend comput easili add tool environ achiev provid uniform mechan access design data convert form tool requir tag grammar cdl db scheme gener tool relationship standard standard import depend system safeti critic suitabl qualiti relat sector develop standard safeti militari fact design similar job project similar de ning approach safeti secur encompass standard aim creat improv uni ed improv con denc system safeti secur requir map model standard implement uni ed model enabl work depend criteria valid applic standard model test control system pari metro depend system work europ set standard domain hard depend understood commerci invest area militari system nuclear requir research dry research involv improv softwar lifecycl cut develop cost improv safeti ensu extrem bene cial rest distribut system commun depend comput commun busi put critic system wealth gain cooper distribut system depend system commun process action work vienna identi ed futur control system internet distribut object technolog wide recogn distribut object system er eleg scalabl paradigm construct distribut system object repres comput compon distribut system term server function type interfac method invok network remot method invoc access servic object object system extend support stream event section distribut object system commerci recent domin forc support academia industri distribut object platform dictat develop platform omg corba microsoft dcom sun java rmi select platform java rmi er advantag coupl tightli java languag pass object distribut garbag collect nativ close system lock user singl languag technolog er featur found java unabl exist system java rmi make iiop protocol make corba class alongsid corba analysi choic distribut object technolog corba dcom dcom attract work microsoft product microsoft domin os supplier standard unstabl proprietari bind multipl languag tting label corba languag driven intern repres academia rang higher level servic design work architectur involv commun object request broker orb mechan transpar commun client request target object implement simpli es distribut program decoupl client detail method invoc make client request local procedur call client invok orb nding object transpar activ deliv request return caller corba proprietari orb iiop label standard prefer option option microsoft commerci leverag analysi marketplac hint carri commerci corba recent success corba commerc distrust bad experi window nt big server system mean unix system import true bank sector fact dcom unix fact corba manag commun window unix make platform choic oper market consolid trend coupl year consolid orb corba market main select product market leader rst major player market orb number platform compani tend stick vendor platform good understand busi side orb vendor corba complex requir compani technolog provid consult bring make client warm corba involv larg deal orb vendor make pro implement platform major vendor orb approach orb market angl tool support corba complex technolog commerci program idl unknown intend develop graphic environ support applic develop licenc deal futur secur orb market includ netscap oracl sgi os packag consolid market illustr larg player abandon orb sun hp orb product orb digit transact servic implement icl dai orb special rst orb implement corba secur servic futur product uncertain icl enter strateg allianc microsoft orb system user base distribut platform requir user base dcom microsoft develop million desktop connect internet corba expand user base commerc bank nancial institut adopt corba technolog big biggest user corba exampl bank america credit europ proof corba statu bank wouldnt invest technolog didnt er signi advantag bank dont fact corba reliabl trust technolog necessarili newer perceiv keen sprint nortel aerospac industri boe corba manufactur system big custom potenti attract corba standard distribut object set object servic includ speci cation object transact secur event servic trade servic detail aliat develop dcom corba di er develop process microsoft initi put omg standard decid industri repres standard develop commerci implement month continu corba depend good forward qualiti engin industri sit standard bodi driven market potenti product develop attempt make corba servic omg repres due lack relev compani europ european telecommun rm exampl european particip commerci import corba establish market surviv storm microsoft long dcom run platform microsoft window nt time establish trust big server market announc develop dcom enabl big unix server talk window desktop dcom sourc code speci microsoft involv strateg deal sourc code bridg technolog allevi gap bridg involv translat protocol request corba dcom system integr exist make strateg choic corba dcom distribut system develop futur corba busi system dcom work technic commerci orb cope scale system million object ten thousand client academ research reason commerci platform repres accept academia case identi shortcom academ research work enhanc distribut object platform address work framework standard area research orb washington develop orb call tao tao orb design provid qualiti servic applic vertic integr corba middlewar os commun network interfac current focu polici mechan dispatch corba request hard system avion meet period deadlin crucial system correct architectur featur tao orb architectur applic varieti statist system network distribut multimedia tao project transfer technolog tao orb vendor research result area research support multimedia design construct show orb made fast process multimedia data achiev high perform exploit protocol characterist corba speci faster commerci orb freeli successfulli research system distribut object servic distribut object system requir set higher level servic provid addit secur fault toler function servic deploi work standard framework typic servic distribut object system servic servic requir client locat bind object object export interfac trade servic trader namespac object trader attribut distinguish object class object transact servic applic requir fault toler object transact servic servic support atom set oper object oper commit state roll back oper secur servic applic requir secur channel commun secur servic servic manag authent ensur claim set secur channel inform section distribut object system provid trade servic omg ned standard servic distribut object servic includ corba world requir implement compat omg standard exist research system convert system compli standard system newcastl transact distribut object commit model part current modi ed make compliant omg object transact servic speci cation develop project investig framework systemat synthesi custom applic interconnect servic distribut share memori distribut share memori involv share larg virtual address space connect set workstat attract programm program memori singl machin paradigm chang model move distribut world oper requir commun central servic disadvantag approach scalabl easili support heterogen system futur dsm applic ideal workstat high perform comput dsm system support high perform comput berkelei network workstat project provid dsm system activ research eld develop distribut share memori implement network workstat run exploit symbiot relationship data replic implement dsm system scalabl order combin ecienc project eld dsm carri aim develop massiv parallel applic network heterogen workstat enabl execut parallel applic reli share memori support load applic fault toler interest distribut system commun dsm higher level dsm support applic singl requir high system support requir project develop persist distribut involv partner industri sponsor er altern approach le servic er ecient share repositori structur data uniqu compar similar system combin dsm approach secur fault toler approach persist implement persist reachabl emploi garbag collect algorithm mobil agent de ned omg common facil task forc mobil agent small medium grain start stop execut research interest mobil agent altern tradit distribut system construct paradigm provid function distribut agent hop site site run arbitrari comput collect data deliv back parent site agent system requir host servic provid land site execut environ domain requir visit model agent state migrat strong weak migrat strong migrat involv transpar migrat execut state data weak migrat involv data state agent call start method arriv agent system requir secur model ensur unfriendli agent damag system resourc system agent commun servic term agent import factor languag implement agent system implement java agent system caught industri due lack experi lack wide deploi support infrastructur java import languag decad section bytecod system independ agent wander freeli heterogen great number commerci api access java java agent access busi corba servic java agent natur extens applet servlet system wide context web section agent system java languag implement omg open standard agent architectur section review agent system review omg detail similar system provid agent system weak migrat function aglet ibm tokyo system mobil agent simpl implement agent wide grow user base import address detail aglet base commun primit aglet workbench aglet workbench support transpar requir implement applic develop odyssei gener magic develop proprietari telescript system place object act host servic mobil agent deal access host machin commun object reli java rmi mole project stuttgart similar agent techniqu aglet sandbox secur model directori servic mole includ polici resourc charg servic resourc control mole model support user agent commun system agent abstract resourc mole support event servic notifi mobil agent section fujitsu notabl extens agent host servic ection system behaviour depend context minim function promot ned user implement secur polici voyag objectspac agent function servic support locat voyag secur servic restrict oper foreign object load network voyag feder directori servic programm build link hierarchi manag object distribut system system scalabl voyag agent assign global uniqu id voyag advanc messag system track agent network forward messag secretari object support remot invoc remot agent includ abil instanti object remot java class made instanti remot system lifespan agent time ara kaiserslautern platform er strong migrat function execut mobil agent written includ java aim appli agent mobil volum wirelessli intermitt connect comput global distribut standard open agent architectur omg standard mobil agent facil open framework mobil agent system standard target data interchang facil requir support mobil agent model intend odyssei team collabor standard provid framework agent agent author di erent languag java languag choic system work academ research current industri avail high qualiti commerci system mean danger academ system irrelev target highli area european project commerci champion work agent inform collect move close resourc network commun di erent emerg mobil agent paradigm support mobil comput section agent user provid mobil applic area europ potenti lead world wide web world wide web world captur public imagin global scale web browser user interfac home busi user basic web browser connect web server request text simpl protocol call http web increasingli bootstrap medium access distribut technolog futur distribut applic access web browser section develop web sphere commerci applet servlet support client comput architectur design transform web scalabl distribut system platform commerci web technolog commerci develop web sphere incorpor support sun java languag web browser web server java applet program download web server run local browser browser extend incorpor java bytecod interpret address browser displai window approach enabl load comput move server major compon network comput model section java servlet technolog aim replac exist cgi gatewai technolog cgi web server support dynam comput typic cgi program process inform form access problem cgi execut process spawn server ineci highli server major bottleneck servlet address problem requir code load remain avoid process cost applet servlet technolog ad softwar engin methodolog due exist rang class java basi java program access wide grow rang distribut technolog provid select implement option comput occur client server enhanc web cach popular web urgent solut aim mask result trac congest improv time cach replic frequent access data current cach model web inadequ account di erent type page access pattern number solut investig cach prefetch prove costli popular resourc optim distribut server base knowledg resourc access pattern project replic scheme replica push collect replic client locat nearest server download web page cooper cach interconnect cach provid perform softwar harvest project system cooper cach experi poor perform cooper cach handl request issu sibl addit receiv client work web cach address perform penalti crisp central map maintain list object present cooper cach local cach request map server interrog local object work improv cooper cach aim reduc memori consumpt cach limit object replic cooper cach solut minim number messag exchang sibl cach central server relai project similar enhanc protocol architectur gener web european project investig support gener web servic globe vrije newcastl web resourc encapsul distribut object replic scheme di erenc system globe advoc transpar aim highli visibl cach di erenc globe aim wide distribut object local base model remot invoc globe notion distribut share call polici distribut coher version globe point di erenc polici person homepag client master polici share whiteboard client local replica updat propag replica concern referenti problem refer page longer distribut refer count solut address problem world wide web consortium model web includ option cach individu web page world wide web web continu grow rate number web server worldwid doubl month java applet success servlet replac cgi technolog web cach research rapidli feed commerci process web object technolog standard time system bene gener eleg replic referenti clear distribut system excit topic area distribut system system develop exist distribut object paradigm section evolv support emerg activ applic requir dynam asynchron distribut occurr system develop support evolut event asynchron occurr distribut user click interact applic noti cation movement mobil user sensor system type event combin event trigger activ applic automat turn light walk room model registr noti cation distribut event client regist interest event sourc sourc respond asynchron detect event rang interest notifi occurr interest parti system er applic author model declar rule respond combin event noti cation emerg area event storag event store tempor order reconstruct past scenario commerci interest technolog emploi academ research omg corba event servic speci cation microsoft activ channel model system term event channel client regist interest sourc receiv event occur event channel problem approach account ltere event individu client requir inject event network network congest client perform unnecessari ltere true event sourc receiv thousand event user locat servic section multimedia servic section recent omg noti cation servic speci cation address issu event qo academ model develop system repres project interest work triniti colleg dublin gem system imperi colleg event work cambridg applic area investig project includ multimedia applic activ support mobil virtual realiti distribut system manag unlik model account issu ltere event cambridg model parametr event class requir registr templat provid regist interest rang interest suppli speci paramet match wildcard match paramet event match templat noti ed client remov network overhead send event occurr model made secur client issu certi cate present notifi prevent event fake event spam gem cambridg event system support composit event event rule event client express rule declar describ logic tempor order event occurr simpl redirect phone phone ring person oc event phone ring locat event person left assum im meet languag express composit rule servic ecient monitor composit event develop issu fact event distribut sourc arriv sequenc build polici correctli order event applic demand protocol regularli check progress event sourc recent project newcastl develop approach distribut work ow base event rule event noti ed work ow manag compon make work ow polici rule trigger action work part european ds project section servic provid part stuttgart mole mobil agent project implement omg event servic construct support mobil endpoint event servic build hierarch structur coordin particip local event demon machin coordin commun minim span tree built dynam coordin ad remov transpar coordin broadcast event event platform support reliabl deliveri agent movement emerg requir store event retriev replai work cambridg investig event store store index event tempor order queri languag provid enabl retriev complex nding pictur drew week walk oc tea room replai event sequenc applic construct replai user movement event real environ vr model environ replai support disconnect oper reconnect user catch session event miss europ clear lead system develop excit ts distribut object wide rang applic support easili paradigm mobil comput mobil comput excit research area distribut system aim support mobil user wireless network technolog section mobil locat track augment servic support applic mobil applic framework wireless network technolog support mobil user introduc section section technolog ubiquit wire comput equip mobil user access resourc locat order develop mobil applic rst detect locat user equip technolog locat rst technolog support wearabl comput augment realiti survei comput carri person enhanc environ inform middlewar platform servic support system overview system technolog provid applic mobil user applic follow locat technolog locat technolog make locat user piec equip issu xe wide assumpt comput local build campu comput infrastructur issu granular locat person room locat push smaller granular interest inform orient user wide area locat de facto technolog wide area locat global posit system origin militari applic gp receiv highli accur time transmit number determin posit metr instantan veloc receiv determin gp transmiss block build indoor conjunct wireless user gp locat transmit local area locat rst gener locat technolog activ badg parc tab xerox parc badg transmit uniqu code detect network sensor penetr locat ascertain granular activ badg technolog work commerci product advanc technolog locat develop activ bat radio ultrasound technolog accuraci locat xe sensor ceil build address bat badg attach radio address bat transmit techniqu call ceil sensor determin sourc locat smaller toronto develop inform space user move track palmtop proxim activ locat inform area map situat displai system electromagnet track capabl resolv locat orient track object high resolut magnet eld emit singl transmitt track posit orient number sensor locat error typic area approxim metr sight obtain system constrain metr augment realiti system locat head track augment realiti system north carolina optic sensor built head mount unit sensor sensit beacon built room ceil knowledg posit beacon beacon locat orient user head determin system highli resolv locat orient fraction system costli deploi head mount unit larg unwieldi design tag equip augment realiti wearabl comput wearabl comput comput worn restrict normal provid input output interest wearabl comput transmit receiv inform network augment realiti describ process inform output gener wearabl comput augment user real world navig provid inform object ar depend locat frame refer entiti ar requir user equip wearabl comput manag locat track inform overlai current ar project develop north carolina track enabl system direct user overlai directli user eld vision system cumbersom deploi singl excit technolog potenti develop wearabl comput project mit displai overlai text sound wearer normal view physic world editor emac project displai imag overlai user view real world menu option displai usual top mount user head transmit output radio remot user nger posit interpret posit pointer convent displai user select menu option carri function servic support locat applic environ ubiquit comput develop xerox parc consist environ mobil xed comput user requir applic parc tab system tab discov room person tab chang set humid light level project rutger aim support data replic migrat mobil user user work data site move work type wire wireless middlewar layer transpar manag map gener task network work cambridg investig servic base registr interest user locat noti es client occur gile john metr technolog deliveri noti integr heterogen sensor servic distribut section cambridg work dynam modi fed stream locat monitor locat proxim mobil applic support section discuss support user mobil distribut multimedia environ user applic recon gure desir provid mobil explicitli program bene cial provid abil vari adapt applic behaviour environ move teleport techniqu support user mobil user interfac applic mobil user nearest workstat applic written window system made mobil requir proxi server user base workstat forward protocol request server provid level indirect displai applic move mobil user locat map current locat workstat displai prototyp activ badg provid user locat data weak teleport multimedia support ti make mobil medium audio displai connect follow user dynam recon gurat applic level approach mobil multimedia build multimedia applic mobil agent system section applic work emploi obliq mobil agent system applic move user con gure follow user machin machin support state save visual obliq applic user interfac move approach produc monolith applic singl user mobil agent control function user interfac work cambridg extend support mobil user possibl cooper multimedia applic tag applic user movement detect manag agent charg applic move comput user locat multimedia object involv applic user interfac move user project integr mobil monitor lightweight mobil object multimedia heavyweight mobil agent mobil control adapt techniqu adjust local resourc avail european project investig mobil applic ongo esprit project involv partner fast uw target remov distinct mobil user paradigm creat class user abil access full rang servic inform user interact varieti devic portabl network comput gsm phone architectur enabl user persist activ presenc access wide rang devic presenc form pro le inform resourc relev individu user autom user task intellig agent technolog exploit enabl pro ling adapt chang user goal architectur valid industri applic pilot plan make prototyp softwar wide freeli provid free charg research organ plan provid input standard bodi omg locat system technolog section excit focu develop time europ world leader mobil comput disappoint european project investig mobil system collabor industri dick twent pisa carri feasibl studi secur person digit assist work feed project develop prototyp includ middlewar architectur applic mit work wearabl comput institut superior european institut research work caught press imagin cover multipl popular articl show kind mass popular bring work attent wide rang academ refer propag lead attent fund industri distribut multimedia platform distribut multimedia environ distribut user process displai media di erent type integr environ typic applic includ teleconferenc video demand media type present greatest diculti manipul continu video audio resourc sourc network connect period time provid connect earli multimedia system research illustr pitfal develop directli top system speci devic servic system long time develop portabl middlewar platform provid author model support speci calli multimedia applic principl develop academia remain involv provid platform support construct manag multimedia applic industri concentr develop gener technolog technolog wide home user lesson principl learnt academia uenc work faster network home oc user aspir technolog grow issu lack scalabl industri approach highlight academia opportun work push develop principl technolog industri carri separ develop approach commerci distribut multimedia technolog illustr user dont technolog internet teleconferenc popular home intern call made reason reliabl price local phone call connect internet commerci platform accept distribut busi meet larg system analogu scope market busi meet bandwidth happen year popular mobil commun mobil demonstr market mobil multimedia technolog develop mobil phone support teleconferenc year mobil user make seamless ubiquit deploi workstat make ubiquit deploi telephon research address requir qualiti servic order provid smooth continu media qo requir involv reserv bandwidth network oper system research reserv bandwidth includ displai memori section describ scout recogn requir lowest higher level platform design work qo realist oper ort basi architectur qo multimedia applic architectur commun group commun addit vari bandwidth characterist di erent type rang wire lan lower bandwidth mobil connect bodi work consid issu carri lancast research lab bristol middlewar platform support multimedia applic work earli mid academia industri research lab remain principl lesson learnt prove wire network multimedia object con gurat implement multimedia applic ad hoc desir standard block construct applic object enabl abstract detail author level system requir object technolog framework support ad easili object abstract multimedia video lter displai process con gurat involv plug object input output stream arbitrari video sourc connect lter connect window distribut multimedia object exist distribut machin con gurabl multimedia object system involv object technolog author mechan speci cation con gurat gener discuss con gurabl object section tour machin system develop bellcor platform develop support develop multimedia applic resourc object abstract devic audio video switch coordin resourc manag higher level session object creat applic instanc manag process con gurat achiev commun resourc manag model concentr platform commun aspect directli address interact distribut media control system develop massachusett similar model augment view logic devic sourc process object speech special ect object support work berkelei acm approach extend window system server acm run workstat server factori manag creation logic devic object repres abstract physic devic logic devic map physic devic object manag di erent acm server connect stream type medium compat object connect stream creat associ logic devic composit logic devic stream logic time system server present ensur event noti notifi event point logic stream model account resourc reserv connect request requir develop acm provid toolkit activ displai object provid higher level construct origin acm model approach adopt similar paradigm provid con gurabl multimedia object mit system geneva multimedia framework cambridg imp system system construct activ address issu con gurat involv multipl media dynam creat manipul imp system servic assist process con gurat gurat servic creat object client locat distribut multimedia object factori stream connect system research deploi wide everydai mean commun commerci system unabl compet recent enhanc con gurabl multimedia object system abil recon gure distribut consist project qmw con gurabl multimedia object system support qo stream connect multimedia transact provid support recon gurat consist state whilst maintain qo level switch video sourc whilst maintain smooth throughput requir research illustr potenti multimedia object build block multimedia applic work interact multimedia associ move intern multimedia servic model base corba con gurat involv client manag object connect object stream object level qo request stream author approach exist con gurat multimedia object approach graphic con built top multimedia object system project investig graphic con gurat system geneva multimedia framework provid direct manipul tool abstract level author idea multimedia object select graphic draw space compat object connect data ow diagram underli model data ow directli graphic con gurat mechan intuit connect provid mechan dynam object control exibl approach present cambridg imp system languag design con control multimedia object build multimedia object area research extens distribut program support construct multimedia object paradigm section interfac de nition languag de ne method invok object interfac repres speci cation commun requir underli architectur multimedia facilit integr continu media distribut environ stream endpoint uniform declar event characterist interfac cater current idl model research work develop underli commun architectur make featur level work lancast investig provid gener object type build devic stream underli model commun architectur enabl stream abstract vari bandwidth instanti work cambridg similar approach stream endpoint qualiti factor speci ed idl client import interfac qo work address shortcom support event section build activ object desir declar type event method current platform forc object builder ad hoc approach callback routin declar client object pass refer call back method noti cation reli agreement client server declar function client server work cambridg provid underli event architectur support gener registr noti cation idl extend support declar event activ object interfac gener event modul provid method object signal event detect media problem network deliveri multipl relat stream media data lip movement video stream audio section examin approach author multimedia object model mechan similar approach higher level servic coordin lower level object skew mismatch exce speci ed object acm approach object discuss support explicit present examin logic time system present object time stamp stream convert common scale speci format di erenc mask object server inform schedul format speci ed skew stream catch mode system karlsruh thread assign monitor stream report reach point made base speci ed skew bound long rst thread wait speed retain lancast orchestr model high level orchestr control lower level orchestr exist present object sourc sink site interact regular interv control skew achiev stream ahead skip model develop cambridg insert stream agent con gurat present object involv continu provid jitter remov bu er servic inform object requir mutual relat audio video lip stream agent relat group view logic time valu present object adjust present rate sync term author model approach complex relationship de ned multipl object harmoni model assum object plai time cwi extend model skew toler speci ed link graphic model tempor point point start video audio clip plai lip sync mode system graphic editor incorpor timelin point speci cation present object cambridg imp languag languag primit express relationship multimedia applic distribut multimedia system support notion system user interact point media present reach trigger action applic approach multimedia applic gener event initi exibl reach point time happen work athen cwi exhibit type event model model limit approach event section cambridg imp system system design open extens mind rule describ composit event express monitor seri action detect infrastructur support multimedia object support registr noti cation composit event servic support monitor complex scenario multimedia groupwar terminolog technolog interchang larg synchron distribut platform multimedia middlewar platform section describ detail platform speci calli groupwar groupwar support system interest built multimedia object platform rendezv bellcor built tour machin system collabor session manag system broadcast facil multipl user join session rendezv share applic ad session underli tour machin user session con gurat implicitli queri share applic set lancast model extens group set interfac stream connect sourc connect stream group sink sink control group commerci multimedia system standard bodi special interest commerci system tend develop standard platform system target support teleconferenc cover discuss synchron groupwar section compar commerci microsoft deploi research show massiv di erenc capabl er multipl dynam con gurabl open netmeet er close limit impress usabl internet commerci system bene ted multimedia process occur decad standard compress audio jpeg mpeg distinct product exchang inform compress make multimedia usabl internet standard composit multimedia de present engin develop director system distribut mobil multimedia multimedia support mobil user excit area academia ahead europ ahead mobil multimedia involv multimedia connect mobil user whilst move main area wireless multimedia devic popular mobil telephoni market integr mobil phone pocket conjunct wireless yield mobil teleconferenc system europ mobil telephoni compani infrastructur distribut multimedia platform technolog brought qo architectur support potenti disconnect lower bandwidth characterist wireless model section mobil multimedia ubiquit comput environ multimedia workstat combin technolog locat mobil user move place bring applic session project europ investig mobil multimedia session follow user nearest workstat recon gure stream connect preserv multimedia confer carri whilst wire environ full coverag area section target mobil system speci calli distribut multimedia platform clear realm academia clear order support open multimedia requir global support high exibl busi exist commerci system enhanc network technolog develop ve vital academia plai role commerci technolog high qualiti research import deploi distribut multimedia platform architectur er real qo order illustr make architectur programm concern burden program unaccept low level europ excel opportun lead mobil multimedia gener research project concentr show technolog deploi real hospit academia work industri research advantag distribut groupwar groupwar describ distribut softwar platform applic construct support distribut group user groupwar system support terminolog area comput term comput support cooper work distinct di erent wai cooper ect requir di erent type groupwar main architectur adopt support base messag parti central server system architectur involv singl point failur replic involv user version system state version commun propag updat robust bring plai distribut system consist fault toler disconnect work hybrid architectur combin server join confer replic work addit import distinct groupwar synchron groupwar involv commun multimedia conferenc share draw asynchron messag includ exist system email bulletin board emerg share calendar project discuss groupwar divid synchron asynchron system section discuss refer research commerci system speci area experienc lot interest time cover synchron groupwar collabor share asynchron groupwar work ow system synchron groupwar earli mid groupwar research focuss develop platform support wide rang applic type base perceiv applic requir good report outlin applic distribut groupwar perceiv share cooper group teleconferenc game support requir applic factor group session manag oor control system calgari altern approach extend user interfac toolkit support groupwar base replic architectur charg session manag gestur support provid transpar overlai mechan matur system er similar function platform support replic architectur construct system isi current trend groupwar base fact platform fail provid full rang support requir number system prove whilst support support groupwar applic class adequ synchron groupwar platform develop target speci applic applic restrict research domain year ago low cost commerci product open commerci system enabl process includ video encod standard itu protocol applic data share commerci system support synchron teleconferenc share control remot applic control remot applic enabl distribut user control applic give demonstr present platform support includ microsoft featur commerci groupwar system content deliveri architectur present internet microsoft present powerpoint present stream architectur ensur present proce pace collabor virtual realiti collabor virtual realiti involv enter virtual environ interact user avatar research prototyp develop research issu distribut vr system con gure session distribut mechan propag updat multipl distribut world qo ensur throughput adequ user ensur realism typic approach illustr distribut interact virtual environ sic base approach server consist concurr control common data achiev activ replic reliabl multicast protocol system develop triniti colleg dublin appli paradigm section con gurat propag updat user world event ltere techniqu cut number event noti ed commun object view notifi locat emerg option develop distribut vr distribut system techniqu underli model vr compon gener work cambridg approach research actual usabl system commerci distribut quak ii research system close qualiti render updat rate interact quak ii underli distribut architectur unfortun user attempt shoot asynchron groupwar asynchron groupwar base messag group user principl asynchron groupwar embodi commerci platform build asynchron groupwar system microsoft outlook exchang server product mechan cooper share share task exchang server set altern commerci system lotu note platform build asynchron groupwar built top replic server schema de ned natur exchang messag made relev recipi di erent part stai consist replic system proprietari system built asynchron groupwar platform includ xerox digit altavista forum work ow work ow system process model describ stage work document requir distribut compon signal task complet work ow system respond action work ow attract lot attent commerci market larg commerci system tend sophist industri market leader ibm proprietari system commerci approach attempt web manag work make exist technolog reduc cost action technolog metro system recent research system newcastl rule coordin work ow process issu tool work ow context import issu open system address work ow manag coalit develop work ow refer model attempt process distribut groupwar research platform support synchron asynchron groupwar fail gener research concentr support speci applic distribut vr work ow commerci system repres system academ domain year focuss futur cooper work paradigm deal di erent model user interact tradit mobil user vr user support cooper individu user di erent context interact feder system issu research begun issu work support gurat distribut system distribut applic object accept methodolog applic requir complex object bank interconnect set teller machin techniqu con gurat involv support creat interconnect network object import principl separ speci cation system structur power con gurat techniqu appli manner desir add remov compon con gurat shut compon remov teller machin bank network upgrad version techniqu term recon gurat commerci applic requir consist preserv system recon gurat bank happi transact lost broken connect imperi colleg world leader area technolog support con gurat recon gurat system support con gurat imperi evolv iter darwin system object describ input output connect object con gurat speci ed term con gurat languag composit object built basic object build block larger system european project con gurabl distribut system inria rhone alp system similar imperi work address integr heterogen system support systemat synthesi middlewar con gurat languag extens omg proprietari scheme adopt darwin support preserv applic consist recon gurat divid recoveri avoid scheme recoveri approach reli transact recov data loss failur recon gurat avoid scheme prevent inconsist wait safe state applic prior execut recon gurat work imperi culmin approach requir mechan essenti recoveri assum transact model manag avoid programm particip avoid scheme special properti system abil system disrupt recon gurat restrict section distribut system undergo chang system support mainten distribut invari recon ensur user oor control distribut confer similar dedic corba platform issu recon gurabl system recon gurat process approach speci cation con gurat recon gurat graphic tool work imperi approach graphic recon gurat intuit mechan scale bulk manipul larg number servic larg number repetit oper recon gurat work imperi approach includ abil manipul larg number object scope manipul explicitli current european project call ds coordin complex distribut investig framework servic exist provid dynam control includ dynam recon gurat partner project newcastl inria rhone alp imperi colleg bull ds call task control coordin servic platform integr softwar repres activ softwar manag monitor direct execut multipl task manag work appli work newcastl work ow section ds address architectur descript languag recon gurat permit descript dynam softwar architectur compon interact chang execut environ execut servic speci ed adl corba includ object transact servic provid reliabl con gurabl recon gurabl distribut system receiv interest deserv commerci domain technolog er great potenti larg su er nancial damag chao vital system chang con gurat continu develop research europ lead aim feed industri support persist data distribut applic section concern speci calli issu support persist distribut applic larg bodi work design build system persist languag scope report system system centr busi term commerci market leader informix system support call highli advanc robust system er advantag relat sql busi wide adopt system due massiv invest industri standard address issu odmg odmg produc standard system import commun system relev distribut object system section odmg present uni ed data model commun superset omg idl datatyp object queri languag manipul object approach conjunct improv eleg distribut system busi solut momentum main year oracl version informix introduc bene ts semant replac relat model relat tabl inherit properti area advanc activ activ tradit give abil notifi client oper interest withdraw amount account larg bodi work exist eld activ recent work recogn build event noti cation mechan activ distribut event system section support rang includ stock price correl persist languag persist languag remov explicitli formul queri system valu languag program execut nish di erent form program system popular persist program system illustr project glasgow sun lab java import program languag distribut internet comput persist program catch java technolog system team experi area sun system de facto standard persist java orthogon appli java transit work conjunct java garbag collector support persist persist transpar programm code oper persist transient data system requir made java virtual machin tupl space tupl space model experienc charg rang enhanc support emerg applic tupl space space share distribut client tupl retriev associ match current work investig addit tupl space log safeti critic applic qualiti servic paramet tupl space model combin java group bologna coordin languag librari add primit java coordin languag mechan higher level java socket rmi implement advanc coordin instanc control mobil agent similar base extend java tupl space pursu javaspac persist distribut share memori altern approach persist persist distribut share memori illustr project section servic overhead exist servic high exampl applic store updat inform thousand event import area mobil support applic requir activ locat proxim record locat user equip spatial index capabl demonstr commerci support updat rate requir type applic solut develop area exist technolog inadequ storag captur event distribut sourc applic includ memori reconstruct past event event index replai event lost disconnect replai feder applic event record user mobil movement vr time period support requir develop special servic work carri cambridg network storag servic servic data storag vital compon distribut system multimedia servic store static le servic popular approach attempt develop intellig disk attach directli network servic support storag deliveri continu media video demand servic integr multimedia storag architectur provid support multipl media type integr environ high perform file servic system aim improv perform tradit system cmu mellon andrew file system coda attempt reduc server load cach le work ensur multipl client view le consist recov case crash af approach client simpli es issu xf berkelei approach local similar local observ xf le server close client data client le determin mobil user access client contact consist server part local determin machin cluster suppli data fail contact home cluster data system creat integr le storag system dec src virtual disk system le system system featur includ automat load cheap ad addit storag fault toler tightli coupl storag reduc possibl space throughput request schedul design run secur network interfac provid server intellig storag devic recent approach improv le system perform concept intellig disk disk devic plug comput bu control intellig disk network interfac attach directli processor enabl implement le system directli idea direct disk ineci server project network attach secur disk cmu system client connect directli store authent le system server devic deal le layout advantag knowledg disk amount le system polici built disk le system server capabl veri ed devic oper perform work assimil storag industri member includ quantum seagat consortium activ pursu technolog requir enabl adopt pegasu project cambridg twent glasgow swedish institut comput scienc investig schedul intellig disk support qo video demand video demand involv deliveri continu media data distribut client technolog receiv industri attent commerci domain server target local area network environ client pc equip hardwar design applic inform kiosk multimedia le consist short video clip video server environ hotel confer centr ibm product serv client rate system class includ comput power pc number client server support typic server disk arrai obtain larg storag capac throughput admiss control mechan restrict number simultan qo due lack commerci network bandwidth reserv solut server handl simultan stream distribut system order provid larg collect video ectiv hierarchi storag media rang semiconductor memori disk storag librari admiss control mechan extend distribut includ alloc bandwidth backbon network control mechan interact larg transact process system handl bookkeep oper custom bill video server base collect power workstat silicon mainfram comput shark multimedia server run le system microsoft tiger video server collect pc construct scalabl server stripe distribut segment movi collect server balanc access load server replic segment level mechan fault toler ort area provid capabl servic examin solut enabl negoti reliabl maxim servic scalabl oracl media server base massiv parallel comput exploit larg capabl claim deliv concurr video stream multimedia storag architectur research project investig architectur support multimedia data integr environ storag architectur develop cambridg system byte segment abstract lowest level provid varieti higher level servic storag physic storag simpl higher layer provid abstract client abstract includ continu media session qo level access le integr servic architectur bene includ uniform secur model le type gener lowest level texa austin similar physic integr le system multimedia data featur includ disk schedul ecient support request storag manag support multipl block size control enabl placement polici implement le system fault toler layer enabl data type speci failur recoveri integr featur provid data type independ mechan lowest level disk bu er storag manag higher level modul lower level featur data type speci storag network storag servic industri main control player storag convent system video demand commerci promot motiv disk vendor desir sell disk market di erent excit wai prove ectiv altern cheap pc disk remain achiev potenti industri domest infrastructur remain provid viabl altern digit broadcast satellit video rental shop commerci system provid architectur integr multimedia qo european research ahead industri architectur integr side distribut system manag distribut system grow popular softwar creat destroi dynam manag system complex matter research autom manag distribut system import area manag form monitor activ distribut make manag perform action modifi behaviour system principl distribut system manag separ manag polici autom manag servic interpret polici facilit dynam chang behaviour manag system polici requir european project jointli investig manag distribut system approach manag type polici polici oblig polici distribut manag polici system polici de ne manag permit permit john permit read personnel record employ grade oblig polici guid make process de ning manag error count monitor agent send warn messag oper larg complex distribut system di erent encod con ict inconsist unavoid project investig detect con ict manag system structur di erent manag polici appli approach polici manag section inform relat system monitor announc gener servic distribut system event noti ed rule manag respond base prede ned composit rule system investig approach develop imperi colleg con gurat manag aspect manag distribut system simpli es process deploi connect softwar compon system section investig dynam con gurat recon gurat system control gurat languag separ speci cation system structur comput intern standard de ned set osi manag standard base concept manag object de ne manag view resourc term attribut visibl manag read oper perform resourc manag object emit event noti cation manag standard fact manag directli invok oper manag repres progress commerci tool manag environ realm distribut system academia ahead result european project encourag due grow number distribut complex mundan manag emerg standard area great interest commerci vendor year distribut system secur open distribut system trust host network applic involv transmiss privileg credit card techniqu develop ensur privaci inform main techniqu authent cryptographi cryptographi user data attack gain inform listen inform authent client server secur determin ident concern protect local area avoid singl point failur authent authent process reliabl verifi ident authent system origin develop mit base work needham schroeder import integr nt version make industri standard mechan consist kei distribut centr run physic secur node librari subroutin hat distribut applic authent user design user log workstat provid workstat obtain inform process access remot resourc behalf user gener temporari privat call session encrypt messag client project improv includ project european system applic similar techniqu improv provid support heterogen domain secur sophist access control audit deleg design recogn import design world standard incorpor featur technolog construct set secur infrastructur compon product develop number industri includ icl access bull sa integr system manag siemen trust centr secur mail cryptographi cryptographi involv kei encrypt inform transmit decrypt inform intend recipi de wide symmetr kei technolog current initi replac term advanc encrypt standard candid algorithm submit world process year open internet public kei cryptographi pgp good encrypt algorithm highli secur public kei program regard de facto standard email encrypt internet program encrypt email le intend receiv read rsa public kei cryptographi technolog million copi softwar commerci vendor develop netscap rsa encrypt includ digit certi cate ssl design secur web transmiss credit card inform client part ssl includ web secur access web server technolog incorpor rsa encrypt visa set electron design safe transmit sensit person nancial inform public network local area network connect internet reli technolog authent cryptographi protect entir network system servic locat gatewai network ltere packet ensur access privileg port accept domain technolog commerci domain redund scatter research europ led innov secur techniqu call redund scatter fr reli techniqu withstand malici act intrud corrupt insid fragment dissemin data ensur con redund avail fr approach circumv singl point failur repres authent section toler authent servic implement multipl secur site threshold kei scheme fr appli le archiv implement secur distribut applic distribut system secur main applic area encrypt transmiss sensit inform inform relat credit card transact trust techniqu increasingli requir global internet market ground deploi question cross bridg user suppli credit card provid suitabl technolog applic reli internet feel adequ protect languag distribut program distribut system area gener program sun java repres java support concept modular softwar develop inform hide system independ compil interpret java virtual java interpret exist major byte code standard underli system wide rang reusabl compon form java class present interfac system notori dicult socket java build distribut object system section mobil agent system section java rmi interfac java languag transform implement corba dcom bind java emerg mobil agent system built widespread user base system independ java make ideal applic area support execut form java provid web browser user download applet browser applet address browser displai commun network web browser de facto user interfac internet java adopt major commerci receiv signi support languag compet make signi breakthrough distribut object area import languag distribut program eld interfac de nition languag enabl distribut object abstract commun commun endpoint er data type read written endpoint main idl java requir java languag dcom interfac omg idl system independ omg idl area import distribut program languag transmiss queri data distribut servic system odmg integr data descript languag queri languag compat omg idl corba uni ed languag commun approach con gurat provid distribut object type interfac abstract commun control function enabl gurat languag emploi connect object arbitrari complex section standard exist con gurat import research languag darwin imperi colleg rhone alp reactiv control distribut system approach interest declar languag reactiv control distribut system section rule process manag object monitor occurr scenario rule perform action set distribut object approach successfulli control multimedia applic system manag distribut system speci cation distribut work ow distribut system theori distribut system theori relev area distribut system cover report theoret framework involv develop model distribut algorithm system formal techniqu properti system investig rigor test formal proof distribut system theori broad topic coverag develop scope report inform scope distribut system nanci lynch mit present sourc formal proof behaviour wide rang distribut algorithm introduc section area formal techniqu appli softwar lifecycl depend system speci test valid formal speci cation document autom introduc gener test case valid process depend comput reli abil ectiv test debug execut work bologna develop formal model speci cation dynam properti distribut comput detect properti algorithm develop implement part distribut debug system industri bene ts formal techniqu develop model area research microsoft investig model agent movement secur mobil comput theoret work mind complex issu distribut work total isol theori invalu tool model prove properti system approach invest larg amount time build system recommend report review current distribut depend comput worldwid base review europ aim world forc distribut depend number recommend continu develop young research young academ strong link european similar build research collabor futur radic programm start achiev result area potenti area skill write research paper market research market research institut excel market work qualiti work work unknown work fund europ develop research market skill techniqu superior technolog speak potenti introduc skill radic work improv web site european institut import project languag prevent learn bene cial repositori project europ exchang visit institut make ort give interest talk pai research market intern research link research aim make contact work area contact stem intern boundari foster cooper competit advanc quickli top peopl worldwid commun colleagu incent foster collabor european site senior version radic meet aim produc success european collabor project recommend event engin produc work group ag rang nation event europ link bene cial europ event stage confer forum local show technolog front audienc expert unsuccess event term europ pro le held europ rst time european paper success event confer confer target academ happen mixtur peopl world happen europ due combin market confer receiv larg number paper submiss world nal programm intern ibm impress er host confer understand industri issu assess industri agenda area import fund work big american player incorpor commerci system research work address commerci relev cooper prefer european industri area mobil comput academia learn worth protect requir academ idea properti roadmap workshop european academia determin mileston set achiev document refer powel schedul gener architectur system middlewar suit ieee workshop middlewar distribut system global gp user guid lloyd commun juli agha al linguist framework dynam composit protocol intern work confer depend comput critic alexand al activ network architectur ieee network special issu activ control middlewar support distribut applic ieee anderson continu media server mechan anderson al case network workstat ieee feb arnold gosl java program languag infra red data associ irda interact multimedia associ multimedia system servic technic version al orthogon persist java acm sigmod dec aj appli schedul theori static prioriti schedul softwar engin azuma track requir augment realiti page uni ed framework speci cation detect dynam properti distribut system technic publish intern confer parallel process la mg baker commun infrastructur construct reliabl applic distribut system hawaii intern confer system system support network applic intern confer distribut comput hall multimedia ieee person bacon al event build distribut applic intern workshop servic distribut network environ al enhanc web cach replic ieee internet al architectur con gure distribut applic middlewar fresh approach file system qualiti servic bate framework support activ applic sigop european workshop bate bacon support interact present distribut multimedia applic multimedia tool march bate al integr collabor presenc mobil winner paper confer award bacon framework support mobil user multimedia applic acm mobil network nomad applic al multimedia client ibm lan server acm baumann al mole middlewar mobil softwar agent middlewar beck und system mobil technic faculti comput virtual realiti model languag speci cation technic august version cd al mobil network ieee person al softwar test base formal speci cation softwar engin bershad al safeti perform spin oper system acm symposium oper system bharat cardelli applic proc acm symposium user interfac softwar novemb dynam recon gurat servic corba intern confer con gurabl distribut improv reliabl distribut server ieee intern confer multimedia comput al tool execut multimedia present intern workshop network oper system support digit audio germani novemb bluetooth bluetooth technolog overview adapt fault toler system workshop comput al structur transport dynam multimedia document multimedia futur control coordin complex distribut system environ parallel program network heterogen workstat journal parallel distribut qualiti servic architectur comput commun cattel al object standard morgan hierarch internet object cach technic southern ciancarini rossi coordin commun java agent vitek mobil object programm volum lectur note comput page ciancarini rossi coordin java agent www journal coordin multiag applic refer architectur ieee tran softwar work ow manag coalit work ow refer model microsoft corp microsoft window multimedia programm netscap corpor secur socket layer survei select groupwar applic support platform technic broadcast technic report multimedia applic support open distribut system phd depart lancast al design valid softwar concern prospect seminar safeti system reli fault inject formal test fault toler ieee transact powel system workshop futur trend distribut comput martin estim fault toler coverag evalu ieee transact al support interact multimedia multimedia davi al tupl space base platform adapt mobil applic intern confer de mei al object chapter visual composit multimedia digit altavista forum strong framework membership servic acm symposium principl distribut radio equip high perform radio local area network function speci cation technic exodu experi architectur distribut friend approach ieee transact broder summari scalabl web cach share protocol comput commun public acm sigcomm cristian approach construct applic intern symposium fault toler fish al video inform commun commun januari situat inform space spatial awar palmtop comput omg common facil task forc mobil agent facil fore fore wireless applic protocol forum wireless applic protocol architectur speci cation technic sloman implement interact con gurat manag distribut system intern confer con gurabl distribut al multimedia present system tempor activ media multimedia futur fujitsu homepag video compress standard multimedia commun garcia al qo support distribut multimedia commun intern confer distribut pretti good privaci oreilli gener commun linda acm transact program gener world telescript gibson scale disk gordon abadi calculu cryptograph spi calculu fourth acm confer comput commun gordon cardelli mobil ambient home area network internet engin steer group recommend ip gener protocol technic standard object manag group common object request architectur speci cation object manag corpor connecticut ma object manag group event servic speci cation technic march group homepag relai group cooper cach world wide web tripathi mission critic oper chapter environ hard applic io seltzer case geograph interact ve dive system ieee multimedia hall control adapt manag advanc atm control architectur david hall appli mobil code distribut system phd cambridg comput june harter hopper distribut locat system activ oc ieee al perform system acm symposium oper system shark continu media file server dick mobil digit companion desk area network acm oper system hill al rendezv languag commun januari howard overview andrew file system usenix winter technic vienna depart nuclear state art report softwar import safeti technic version ibm imielinski badrinath wireless mobil comput challeng data manag commun page octob isi distribut system isi refer network comput network comput initi al bring technolog web web except handl model parallel distribut softwar journal program notat express error recoveri distribut objectori languag open workshop broadcast framework sound custom distribut runtim system ieee achiev middlewar custom con develop experi prototyp intern confer con gurabl distribut fault inject tool assess fault toler int symp randel design secur reliabl applic approach european depend comput jg silva techniqu evalu depend modern comput ieee transact softwar javasoft remot method invoc speci cation jensen kernel comput model alpha distribut oper system mission critic oper system io kaashoek al applic perform flexibl system acm symposium oper system radiat valid mechan ieee implement evalu ecient dsm softwar practic rout hybrid multimedia network confer multimedia commun septemb system ieic transact inf al system program model mar intern symposium autonom al prototyp implement control sae congress al interfac system internet intern symposium internet lee distribut virtual disk lesli al design implement oper system support distribut multimedia applic ieee journal select area septemb storag model multimedia object ieee journal select area april lo pope implement high perform orb multipl network transport lo modular extens network storag architectur phd cambridg comput technic report cup distinguish dissert lotu lotu messag leverag power domino note white paper wireless inform devic lynch distribut algorithm morgan berger make world wide web cach server cooper intern web sloman event monitor languag distribut system mark cochran grammar relat ieee marr al evalu test statist test symposium safeti comput control protocol ecient web cach intern symposium distribut microsoft deliv content creat activ channel mitchel al dynam recon gure multimedia approach acm sigop european kramer maintain node consist face dynam chang intern confer con gurabl distribut system mogul hint cach web acm sigop european al oper system hot motorola satellit commun gsm mou gsm mou associ homepag nelson locat system phd cambridg comput ap microsoft video softwar nicola architectur multimedia commun system ieee journal select area april nist algorithm twenti centuri integr ieee commun objectspac voyag home page al toolkit develop distribut video game virtual world simul interact virtual interconnect workstat euromicro padmanabhan mogul predict prefetch improv world wide web latenc sigcomm architectur ara platform mobil agent intern workshop mobil harrison distribut internet cach australian comput scienc powel distribut lesson ieee gener upgrad architectur depend research technic follow project follow environ develop softwar ieee von phd technic januari os randel xu softwar fault design open hopper teleport window system environ ieee person august roseman greenberg build groupwar acm transact rsa rsa homepag rsa secur electron transact chase rabinovich directori structur scalabl internet cach technic duke north make system depend softwar architectur work ifip confer softwar architectur satyanarayanan highli file system distribut workstat environ ieee workshop workstat oper levin evalu strategi corba dynam schedul ieee system session microsoft vision distribut object chase approach build larg internet cach sixth workshop hot topic oper system distribut refer support acycl garbag collect technic institut nation de recherch en informatiqu broadcast technic report persist distribut store cooper applic shaw garlan softwar perspect emerg disciplin prentic al design implement integr multimedia file system multimedia comput al overview distribut program system ieee sloman polici driven manag distribut system journal network system singl chip high perform atm switch technic pegasu technic report number id softwar quak ii architectur overview bate architectur support storag retriev event servic digit continu media phd cambridg comput technic report stankov spring paradigm system ieee al augment realiti wearabl comput technic report mit media object model distribut program inform authent servic open network system winter system team research report team research report team research report action technolog metro technolog lucent technolog wavelan activ network architectur multimedia comput network scalabl distribut file system symposium oper system ifip work chapter softwar valid mean statist retrospect futur direct depend comput critic applic statist approach test objectori program intern symposium al stream disk storag system video audio file acm ibm tokyo aglet homepag integr manag guard tucker osi structur manag inform journal network distribut system comparison autonom mobil agent technolog technic technic van system birman van reliabl distribut comput isi page ieee comput societi vazirgianni model interact multimedia present comput virtual interfac architectur waldo al javaspac speci cation technic sun march wallac jpeg pictur compress standard commun wang wide area mass storag file system technic white hopper locat techniqu activ oc ieee person comput scienc issu ubiquit comput page wessel con gure hierarch cach corba compliant transact work ow system internet applic al applic environ ieee intern confer multimedia comput xerox homepag di dynam adjust depend ecienc softwar predict depend comput toler distribut system symposium research secur framework systemat synthesi transact middlewar
IR/386 5 open electron marketplac dogac softwar research develop center dept comput middl east technic turkei abstract electron marketplac call commerc process marketplac model adapt workflow higher level abstract provid workflow technolog make custom electron commerc process user highli reusabl workflow architectur negoti abil capabl adapt dynam environ agent commun handl knowledg queri manipul languag architectur make complet model electron commerc process involv parti invok exist applic defin task restructur control data flow task creat custom built process definit architectur data exchang realiz extens markup languag provid simplic highli open architectur metadata activ express resourc descript framework common busi librari achiev busi domain domain specif document type definit vertic industri provid specif miss dtd replac origin specif electron extens markup languag common busi librari work partial support middl east technic project scientif technic research council project introduct market plai central role facilit exchang payment main match buyer facilit exchang servic payment market provid institut legal regulatori enabl effici function market recent year dramat role inform technolog tradit emerg electron onlin auction success marketplac million item auction categori exampl includ develop anderson consult part smart store virtual agent spite number success electron marketplac form stage open platform exploit emerg standard technolog agent technolog fulli exploit develop cope tremend amount inform process involv electron commerc autom desir servic marketplac offer custom improv electron marketplac call open electron address issu featur offer electron commerc process marketplac model workflow realiz compon research commerci compani creat system support aspect electron commerc onlin virtual catalog electron marketplac system provid interest shop fall short fulli exploit capabl offer electron medium system handl custom custom bui relat item depend item compat requir stem natur item bui printer person comput creat depend comput printer specif softwar consid amount memori requir illustr compat requir current system design handl request time custom bui item search make inquiri step bui compat relat item servic shop cart support inquiri buyer buyer give depend item specif order relat support provid compat requir depend express user repres control flow depend express compat requir knowledg base store rule system develop facil autom busi process conduct organ electron commerc process workflow templat adapt user workflow base approach involv parti defin task invok exist applic workflow control automat creat custom built workflow workflow templat higher level abstract provid workflow technolog make custom process user workflow definit make invok number activ parallel provid effici dynam reengin commerc process user balanc system workload search relat item store activ parallel recoveri function workflow system automat rollback activ depend activ desk request user execut parallel comput request automat roll back comput request fail workflow system architectur design consist function base reusabl compon realiz type agent agent greater agil adapt due properti proactiv proactiv initi condit occur respond environ negoti abil agent aspect flexibl execut workflow process lowest invok type task achiev specif task agent design task agent queri xml negoti handl activ requir user attent schedul workflow determin control task agent modif depend negoti agent schedul function design agent schedul adapt dynam environ negoti schedul agent deleg part workflow process schedul agent implement workflow dtd highli reusabl enact workflow definit written xml conform dtd user flexibl includ process definit conform workflow dtd workflow templat recoveri compon initi failur unanticip chang specif occur realiz agent type agent facilit agent agent find provid servic servic interact user handl agent call interfac agent underli complex system hidden user interfac agent provid graphic user interfac user requir user workflow process definit adapt exist templat infrastructur base xml electron commerc ubiquit electron commerc architectur base infrastructur provid semant provid open electron commerc architectur effort world wide web consortium provid data exchang data semant standard rdf effort develop open electron commerc framework base common busi librari xml gain great momentum emerg standard data exchang internet power li extens ubiqu invent tag subject area defin document type definit content orient tag enabl comput understand mean data busi xml definit describ achiev tag semant consist merchant boundari cbl consist product taxonomi messag format xml develop meltzer baselin version system cbl set build block common busi domain address price order standard measur basi ensur xml applic complement set dtd common specif vertic open electron commerc infrastructur achiev specif vertic domain exchang healthcar bui trade work domain produc common terminolog structur document person comput infrastructur make cbl dtd vertic domain provid specif miss dtd replac origin provid dtd dtd workflow definit advantag defin workflow dtd long workflow engin internet interpret workflow process defin xml conform dtd execut enorm flexibl term level system involv agent knowledg queri manipul languag languag protocol exchang inform knowledg agent kqml design knowledg extend agent negoti organ paper section present workflow manag system architectur provid electron marketplac call explain architectur provid detail scenario describ relat work develop marketplac previou work build workflow manag system final section includ wfm architectur workflow manag system architectur build block marketplac workflow manag deal specif execut busi process workflow manag system modifi busi process busi electron commerc highli dynam unpredict difficult give complet priori specif activ perform order workflow system includ flexibl enact system capabl support resourc incorpor easili workflow adapt workflow specif chang extend electron commerc process marketplac model compon partit potenti larg load particip agent minim commun compon essenti achiev scalabl workflow system support ten thousand activ order process workflow instanc electron marketplac workflow system develop explain relat work section lack mean workflow system servic order achiev level make standard effort kqml labrou xml extens markup languag data format structur document interchang web framework tag structur data develop defin unlimit set tag bring great flexibl xml resembl complement html xml describ data citi html defin tag describ data displai bullet list tabl document type definit accompani xml essenti defin rule element present structur relationship element dtd valid data xml bring power flexibl applic number benefit develop search agent workflow process enact workflow process enact perform mean agent exchang xml kqml messag data definit written xml workflow definit agent system kqml commun agent note kif interchang kqml commun agent prefer rdf xml due power lead open easi understand architectur xml restrict rdf hierarch data circumst found suffici xml case adequ describ product taxonomi relat product agent exchang document rdf type agent interfac schedul task recoveri agent facilit agent agent function explain interfac agent interfac agent collect collat relev inform user initi workflow present return result explan request user addit inform recoveri user confirm mean interfac complex underli distribut hidden user initi specif interfac agent construct initi schedul task satisfi user specif find contact schedul agent execut workflow negoti negoti strategi emploi agent explain end section schedul agent schedul agent agent real workflow enact workflow definit xml interfac agent user execut task subprocess control definit contact task agent schedul individu task contact schedul agent deleg part workflow find relev negoti set agent schedul job schedul agent ensur correct workflow process presenc concurr execut workflow algorithm provid task agent task agent act wrapper actual applic typic task agent task procedur execut task access task collabor user task human task commun schedul agent recoveri agent report current situat task type task miller user web transact task support acid isol properti task ordinari applic enforc atom isol includ workflow user task pure manual task phone call user web task involv web applic depend type task charg task agent capabl user task agent worklist manag capabl recoveri agent recoveri agent knowledg run past instanc workflow commun schedul agent task agent gather inform run instanc recoveri agent access histori mechan queri failur task unanticip chang specif recoveri agent initi produc path definit follow make backward recoveri mechan determin task inform relev schedul agent path figur structur agent facilit agent act facilit kqml agent system collect agent term capabl facilit agent find satisfi order facilit system facilit agent address queri answer request agent facilit agent facilit agent gener structur agent shown figur structur common agent system except interfac agent graphic user interfac xml agent understand content kqml messag form kqml messag xml content agent messag queue track incom outgo messag agent messag respond messag receiv agent code includ procedur modul agent realiz function agent code xml kqml messag gui commun layer figur workflow manag system architectur figur show architectur consist compon agent part workflow manag system workflow system initi user web browser interfac agent construct definit xml conform section process order start interfac agent send definit schedul agent capabl interpret definit schedul agent enact process deleg part schedul agent execut tree form schedul agent interior node task agent leav schedul agent find schedul task agent capabl requir work facilit facilit agent hold repositori store agent task agent applic web browser schedul agent task agent interfac agent web browser repositori facilit agent recoveri agent histori transact task kqml commun web user task agent predefin control depend agent requir task manag simpli instruct start task jen agent mutual agreement term condit task perform negoti call type negoti negoti auction vickrei auction type negoti vickrei auction particip auction submit seal bid receiv parti particip lowest bid award work lowest bid price auction model support term bid made slight modif vickrei auction model agent determin winner agent price offer term durat work achiev assign percentag import term involv negoti singl obtain rule auction appli agent interact agent negoti work deleg task invoc workflow process definit defin work accomplish order principl activ workflow process xml defin workflow process workflow definit interpret agent compon capabl xml document access dtd xml enabl plug plai workflow xml make easi creat special markup languag identifi describ good numer document type busi xml definit describ workflow achiev respect cbl includ workflow servic descript futur version system time develop dtd workflow descript replac origin workflow process defin collect task subprocess dogac process task input output paramet block type workflow iter activ block serial block perform activ parallel block execut parallel parallel block differ termin activ requir termin block condit block constrain execut activ result condit express block activ perform member list activ iter block repeat time iter paramet requir block defin altern path definit workflow extern event handl activ activ messag agent extern variabl workflow definit activ condit block control condit extern variabl valu extern variabl dynam updat flow workflow process determin document type describ workflow process featur provid appendix provid workflow process written xml conform simplifi workflow definit sell process bookstor written xml paramet task express condit dot omit save space process shown graphic figur figur sell process bookstor book found confirm basket book book found deliv payment custom request obtain list book descript book search bookstor parallel custom confirm book found bookstor confirm book ad basket custom payment subprocess execut deliveri book schedul payment deliveri process bypass payment subprocess includ task credit card number custom deliveri user task schedul person work item satisfi role definit subprocess find deliveri servic specif user item task role definit workflow definit involv type task transact user earlier order agent capabl execut task accept task execut mechan describ metadata task resourc descript framework respect defin metadata individu task rdf foundat process metadata provid applic exchang inform model rdf repres properti properti valu basic data model consist object resourc thing properti specif attribut relat describ resourc statement assign properti resourc sentenc creator statement resourc properti rdf data model conceptu framework defin metadata concret syntax requir xml mean rdf express refer schema defin term rdf statement specif mean varieti schema form rdf defin specif characterist autom task rdf defin sequenc altern refer collect resourc rdf metadata descript store marketplac directori agent pointer descript workflow process definit attribut shown metadata descript deliv deliv hour rdf schema task defin marketplac rdf schema specif order assign user task workflow user capabl perform metadata user role involv workflow manag system role user descript written rdf role definit provid commun agent kqml labrou labrou commun kqml languag protocol exchang inform knowledg kqml set standard messag type ibm kqml perform perform set paramet introduc keyword messag repres queri price share ibm stock ontolog assum queri identifi token receiv messag languag perform kqml organ categori perform context inform knowledg exchang kind agent mechan perform prematur termin overrid default protocol rest network facilit perform agent find agent process queri kqml essenti agent heterogen natur commun kqml design knowledg aspect languag inadequ agent negoti negoti implement exist perform associ interpret origin intend price negoti capabl offer kqml respect insert perform insert price offer counter agent knowledg base accept make counter insert price kb natur handl negoti agent accept insert insert global fact item negoti add perform accept syntax intend mean perform express messag id true condit perform achiev messag intend provid term negoti perform previou messag intend provid counter previou messag perform termin negoti agreement condit refer previou messag perform kqml termin time agreement defin provid agent negoti perform figur negoti figur negoti agent illustr agent task perform agent capabl agent facilit agent accept achiev messag task agent capabl execut task show agent agent contact facilit agent agent agent agent facilit capabl perform task facilit recommend agent agent task question auction start agent send messag agent repli messag messag agent receiv accept offer agent confirm send accept messag condit accept content part agent execut task send result back agent import part messag shown figur marketplac architectur explain workflow manag system discuss approach build electron seller buyer meet negoti make deal figur architectur discuss electron commerc model chain parti agent librari buyer side seller side seller buyer task agent task agent kqml facilit workflow templat marketplac directori commun repositori kb histori appl appl histori interf agent agent interf agent recoveri recoveri task agent task agent marketplac classifi describ electron marketplac model workflow manag system present previou section note model realiz workflow manag system basi ad special compon meet specif model electron complex busi process model effect current marketplac support behavior overli simplist manner exploit workflow system model bui sell process singl number agent coordin realiz electron commerc process core directori document type definit dictionari repositori facilit workflow knowledg base item compat check librari modul agent main compon marketplac directori explain document type definit dtd part system describ workflow process describ custom interest describ individu describ term negoti mention section process buyer describ interest seller sell product find buyer interest part id dtd mention item detail product descript produc industri group effort produc specif comput possibl implement xml dtd common busi librari system includ dtd laptop conform specif gener dtd replac origin agent vocabulari term negoti agent hour durat compar scale minut hour order achiev common terminolog term produc modul provid cbl cbl includ group dtd weight descript time locat term trade defin cbl defin agent give dtd part kqml messag understand context question demonstr dictionari synonym interfac agent obtain request buyer user term term dtd item dictionari synonym evolv time dogac comput store describ product servic buyer bui term dictionari synonym search match word dictionari synonym empti begin marketplac learn synonym term user answer queri term learn knowledg base compat requir set rule knowledg base relationship item custom bui comput interest printer rule check interfac agent order provid relat offer buyer compat requir item custom softwar product specif memori requir compat rule check buyer make request incompat item buyer warn request adapt develop simpl knowledg base inform research develop repres process relationship item agent marketplac gener function agent section wfm featur agent specif marketplac environ interfac agent differenti main type buyer seller mode activ passiv activ buyer buyer make request item bought passiv wait request seller sell product activ seller sell specif product passiv wait buyer interest bui product role introduc model market polici interfac graphic user interfac differ type mode user briefli describ function interfac agent mode seller activ interfac agent activ buyer construct initi workflow process definit buyer item servic depend item java applet provid interfac agent shown figur buyer detail bui comput properti comput inform search interfac agent dtd marketplac directori task agent field obtain dtd present buyer detail part figur fill buyer prefer buyer provid negoti detail item request figur interfac buyer seller interfac agent capabl provid relat item servic buyer request item custom comput interest bui softwar suitabl comput relat item automat offer custom interfac agent achiev knowledg base hold rule compat requir item search knowledg base store marketplac directori interfac agent buyer translat buyer inquiri workflow definit xml modifi workflow templat obtain marketplac directori find schedul agent start auction suitabl schedul agent transfer work winner schedul agent kqml messag workflow templat type buyer seller section workflow process user requir interfac agent handl monitor workflow ad capabl interfac agent provid modul agent agent passiv interfac agent passiv buyer activ buyer regist marketplac provid interest shown wait idl request seller point interfac agent adapt workflow templat activ workflow instanc find suitabl schedul agent negoti passiv interfac agent type seller regist seller marketplac list regist catalog seller suitabl catalog regist seller regist interfac agent kqml messag introduc seller marketplac messag seller provid regist catalog exist dtd marketplac access interfac agent passiv seller obtain workflow templat marketplac directori workflow initi request buyer similar case passiv buyer activ seller initi sell process provid detail product sell type interfac agent gui similar provid interfac agent buyer seller click interfac agent initi workflow process contact schedul agent send workflow definit obtain adapt templat activ seller seller interfac agent workflow system person physic deliv product buyer interfac agent type interfac agent type gui displai work item assign user interfac agent provid worklist user interfac agent type requir realiz electron marketplac environ electron commerc model interfac agent implement underli workflow system kind workflow process model requir task agent marketplac type specif task agent addit task agent workflow activ categor negoti task negoti seller buyer specif item type negoti negoti type task agent negoti criteria user obtain begin interfac agent number messag exchang task agent seller buyer side agreement reach negoti task agent offer determin end negoti attribut negoti side deliveri negoti algorithm negoti negoti model base raiffa negoti negoti model transform negoti model set mutual influenc issu negoti faratin type negoti call integr bargain sequenc offer negoti call negoti thread offer gener linear combin simpl call tactic term strategi denot agent weight tactic time strategi agent make intern reason model histori negoti influenc negoti thread negoti agent score function stem order decid offer agent score function return score assign issu rang accept valu score interv conveni element model rel import agent assign issu negoti weight sum weight issu agent score function contract defin sum score issu multipli weight order prepar counter offer offer negoti thread agent set tactic gener valu variabl negoti set famili tactic base busi process applic develop faratin tactic set function comput issu singl criterion set valu issu rang singl domain agent criterion comput singl achiev gener counter weight combin tactic cover set criteria order determin result agreement contract maxim score agent util strategi agent receiv offer gener counter offer combin tactic issu detail negoti found user task user activ execut schedul type task agent requir user task agent store request worklist user task agent decid user work schedul achiev rdf metadata rule user exist marketplac directori explain section role send kqml messag interfac agent user work assign deliveri product buyer manual task peopl deliv packag user task agent find interfac agent peopl rdf metadata role negoti find work item store worklist person interfac agent person inform work item queri task task agent requir queri seller catalog seller export catalog xml page marketplac catalog search specif submiss world wide web consortium deutsch queri xml document effort queri data abiteboul buneman sgml bohm approach adapt queri xml document queri task agent document object model implement xml parser queri processor answer queri dom uniform mechan access manipul xml html document dom defin api xml document show queri written queri comput shop catalog comput shop catalog product entri conform simplifi queri written comput disk larger price lower facilit agent facilit agent workflow facilit agent store seller buyer serv catalog specif marketplac environ messag facilit agent messag seller sell kqml xml messag agent respond messag queri seller catalog buyer interest comput kqml xml agent system give capabl offer sampl messag schedul agent kqml xml messag execut workflow definit achiev definit includ specif process task mean schedul kind workflow process conform templat seller buyer workflow type buyer seller categor parti passiv activ buyer activ bui item servic passiv prefer wait seller sell item servic hold seller templat resid marketplac directori configur interfac agent mode user buyer seller behav activ passiv time contact interfac agent simplifi version templat gener interfac agent mode buyer seller provid version templat appendix figur workflow templat activ buyer workflow templat activ templat figur modifi buyer inquiri made replac seri type block constraint order item collect note depend specif order block preserv detail item includ definit modif clear section figur workflow templat passiv buyer workflow templat passiv workflow passiv buyer initi extern seller workflow task request activ seller flow activ negoti task schedul result payment subprocess schedul queri queri queri negoti negoti negoti payment request negoti payment figur workflow templat activ seller workflow templat activ workflow templat activ seller similar activ buyer product detail obtain seller interfac task schedul find possibl interest buyer find interest buyer facilit agent messag buyer conform buyer request repli negoti task schedul result payment deliveri schedul figur workflow templat passiv seller workflow templat passiv passiv seller activ messag agent activ buyer messag initi workflow task queri seller catalog send result queri wait buyer interest bui product negoti task schedul payment deliv task invok negoti negoti payment deliv negoti negoti payment queri request interest deliv scenario provid scenario activ passiv seller pair describ architectur figur find schedul agent buyer bui item marketplac reach marketplac url marketplac spread site provid scalabl avail marketplac directori link similar trader link object manag group trade object servic specif queri marketplac directori involv queri link current current answer queri interfac agent schedul agent schedul agent figur interact task agent buyer queri task agent seller interfac agent activ agent send applet buyer site buyer web browser capabl conduct busi marketplac point interfac agent interact buyer shown figur inform gather interfac agent adapt relat workflow templat involv adapt control flow data flow templat ad delet activ subprocess subprocess schedul user long definit conform interfac agent schedul agent schedul workflow instanc negoti schedul agent schedul instruct thing schedul capabl execut workflow reason overload access relat task agent negoti illustr figur interfac agent buyer negoti schedul agent sch queri task agent interfac agent schedul agent task agent schedul agent task agent task agent task agent result result result queri task agent queri task agent queri queri queri seller side buyer side schedul agent interfac agent schedul agent interfac agent schedul agent interfac agent recommend facilit agent start negoti send messag achiev perform schedul agent make conform sch make offer int send accept messag send sch messag final negoti schedul agent job enact find task agent execut relat task workflow seller side initi buyer task agent send queri seller interfac agent queri event activ passiv seller interfac agent figur interfac agent adapt templat passiv find schedul agent workflow instanc schedul agent start execut workflow instanc schedul task queri task agent assum seller catalog express xml queri express mention result buyer task agent origin queri buyer seller identifi negoti start phase shown figur negoti perform negoti task agent side negoti process seller side initi extern event negoti task agent buyer negoti process realiz negoti scheme faratin suggest kqml messag final accept kqml messag agreement payment process schedul side task agent payment buyer side user prefer payment type credit relat inform credit card number user agent contact interfac agent buyer task agent send inform seller side task agent activ payment process figur interact negoti task agent seller deliv deliv product custom task user user task agent execut task requir turn auction deliv item interfac agent run behalf interfac agent job result auction displai work properti address deliveri work item worklist section describ scenario activ buyer scenario buyer bui comput desk comput game custom connect marketplac contact interfac agent activ interact user interfac agent obtain request buyer depict figur detail comput shown detail desk cd gather interfac agent schedul agent task agent schedul agent negoti task agent negoti task agent negoti task agent agent negoti task agent negoti task agent buyer side seller side schedul agent interfac agent schedul agent interfac agent schedul agent interfac agent negoti task interest interest interest interfac agent convert request initi workflow process definit xml appendix adapt workflow templat obtain marketplac directori activ buyer graphic initi workflow process definit buyer requir shown figur figur workflow process buyer request figur adapt workflow process figur illustr final workflow definit adapt templat definit buyer request figur step execut scenario bui bui bui bui bui bui cd desk payment queri queri queri negoti negoti negoti queri queri queri negoti negoti negoti bui desk bui cd queri queri queri negoti negoti negoti bui comput relat work marketplac architectur commerci earli marketplac kasbah kasbah system user creat autonom agent bui sell good servic behalf sell agent sell marketplac contact interest bui agent negoti find deal marketplac job facilit interact agent specif commun languag agent local built commun predefin set method architectur marketplac includ infrastructur requir conduct commerc internet support commun agent form autom transact vickrei mechan implement negoti strategi trader server bank trader agent bui sell good server classifi includ search retriev ad categori bank set basic bank servic check account electron cash agent commun socket connect offer electron broker architectur omg corba distribut infrastructur main custom custom search servic directli supplier search regist broker corba chosen commun infrastructur solv problem negoti mechan emploi simpl auction implement emp boll marketplac dbm base architectur busi transact electron market realiz set modular market servic product data store dbm access market server jdbc interfac reich global electron market system develop java gener market framework infrastructur specif compon interfac implement plug framework order obtain oper market dogac present initi idea workflow base electron marketplac web decker notion agent matchmak broker behavior defin kqml perform describ role interact agent experi conduct evalu perform tradeoff broker system author conclud broker system effici load balanc lower overhead system robust retain dynam requir marketplac sycara architectur coordin multipl intellig softwar agent present author classifi agent interfac task agent inform agent interfac agent main task inform filter allevi user cognit overload task agent user perform task formul problem solv plan carri plan queri exchang inform agent inform agent provid access possibl heterogen collect resourc architectur suggest paper influenc design chen infrastructur support dynam behavior modif agent function action dynam agent predefin load modifi architectur support mobil agent author present servic provis realiz dynam agent previou work realiz workflow system agent workflow manag system cai java applet front end transport agent backbon transport agent program migrat machin machin heterogen network busi process handl agent agent tcl system implement transport agent agent standard commun usag limit make agent tcl system huhn present usag agent manag heterogen transact workflow agent commun common ontolog realiz part transact kind comput actor system actor control interact compon architectur agent reason decid task perform miller web technolog workflow present meteor workflow manag system interfac infrastructur built web technolog data flow realiz exchang html page cgi main commun mechan server jen design implement busi process manag approach busi process view collect autonom problem solv entiti negoti coordin agent commun specif agent commun languag interpret nativ agent jen negoti agreement agent enforc central control author present formal framework contract manag autonom agent agent contract manag interest deal contract manag form contract accept parti schedul exchang consid individu interest electron commerc process model develop imit counterpart electron opportun technolog offer electron medium fulli exploit provid user commerc environ complex commerc process hidden user exploit advanc technolog provid open architectur import paper architectur address issu provid user user friendli environ express system handl underli complex workflow architectur architectur base open infrastructur xml cbl implement agent implement kqml parser jatlit stanford full kqml grammar standard extend perform jatlit mechan commun agent xml document kqml agent make valid dtd xml xml parser dom implement refer mae agent marketplac bui sell good intern confer practic applic intellig agent uk suciu queri languag xml dogac guest editor acm sigmod record special section electron commerc decemb dogac guest editor distribut parallel special issu electron commerc kluwer design implement distribut workflow manag workflow manag system nato asi seri electron marketplac web nicola electron marketplac web formal workflow correct issu presenc concurr phd middl east technic dept comput novemb dogac formal workflow correct issu presenc concurr distribut parallel meltzer xml electron enabl network economi reich architectur dynam electron market nicola stephanidi editor research advanc technolog digit lectur note comput springer suciu semistructur data xml intern confer foundat data organ dom document object model level specif recommend raiffa art scienc negoti press jatlit singh meteor workflow manag system journal intellig inform yang structur document storag refin declar navig access mechan vldb sycara matchmak broker proc intern confer system sycara zeng coordin multipl intellig softwar agent intl journal cooper inform segev object framework electron requisit ifip confer electron commerc huhn singh manag heterogen transact workflow agent nr jen agent market virtual market electron commerc appli artifici design implement agent architectur electron msc dept comput middl east technic march wiegand busi process manag intern journal cooper inform suciu queri languag optim techniqu unstructur data proc acm sigmod intl conf manag canada jen negoti function autonom agent int journal robot autonom busi model electron market commerc europ juli hsu dynam servic provis proc intl conf cooper inform newyork rdf resourc descript framework model syntax specif work draft resourc descript framework schema specif work draft wiener lorel queri languag semistructur data intern journal digit kla driven electron marketplac commerc internet nog workflow manag system web transport agent technic dartmouth colleg schedul contract autonom agent intl conf cooper inform system newyork trade object servic omg document system vickrei competit seal tender journal xml extens markup languag recommend emerg role electron marketplac commun august labrou finin semant approach kqml gener commun languag softwar agent intl conf inform knowledg manag labrou finin kqml specif technic report baltimor counti appendix dtd workflow process definit cdata durat cdata mode type mode cdata type role cdata user cdata descript cdata number cdata type cdata type type type appendix workflow templat activ buyer templat item result item seller item seller seller result process passiv buyer templat request request repli repli activ seller templat buyer buyer buyer repli repli passiv seller templat request queri interest result request request queri result interest appendix adapt workflow templat result seller seller
HCI/387 4 icon gestur virtual environ timo sowa arti cial intellig group faculti bielefeld po box germani abstract interpret icon gestur spatial domain idea improv commun capabl humancomput interfac approach gestur recognit deictic gestur view icon sign di erent deictic relat refer base similar work report breakdown complex notion similar kei idea comput model gestur semant icon gestur base empir describ rst step recognit model icon gestur implement prototyp gestur recognit system observ spatial concept relat featur icon gestur express recognit model base method compar geometr structur gestur object introduct gestur commun modal supplement speech wide attract attent eld interact past year applic bene wai multimod approach combin di erent kind commun synergist gestur speech bandwidth commun support cient style interact potenti natur simplic oral gestur compet present wimp compet learn virtual user move imposs interfac gestur complement concept commun easili express modal linear structur advantag abstract inher support commun concret spatial content properti gestur make interfac applic point interfac paper present approach util gestur inform carrier shape properti object applic background research area virtual design spatial concept plai signi role focu intuit interact machin requir learn approach base system design result empir studi object descript icon gestur shape gestur typolog mcneill hand movement subset icon gestur gestur type simultan speech depict refer term icon deriv notion icon sign suggest peirc icon obtain mean similar refer mean inher part sign type sign typolog index symbol requir addit knowledg intellig indic share situat symbol share social background icon gestur occur respect geometr properti spatial con action model approach con ned rst spatial properti con gurat problem gestur recognit viewpoint engin reduc pattern classi cation task data stream case recognit data sensor classi ed ned set categori class determin mean gestur result direct map gestur express mean engin viewpoint put benoit al recognit gestur typic pattern recognit problem standard pattern recognit templat match su cient gestur pattern recognit approach work gestur de ned dictionari icon gestur approach part inventori standard lexicon icon refer spatial properti con gurat scenario number potenti possibl gestur realiz ident content claim sender receiv share similar cognit capabl perceiv sign mental transfer refer gestur correl indic symbol deictic gestur de ne gestur express di erent due person prefer fundament properti icon gestur express mcneill gestur movement hand arm peopl talk gestur spontan creation individu uniqu person follow gener principl element xed assum interpret gestur success paradigm di erent pattern classi cation detect similar gestur refer requir analysi compon compon relationship reveal conduct empir studi object descript summar section outlin model prototyp implement recognit system gestur relat research multitud recognit system manipul gestur task robot navig virtual sign languag comput game overview research eld found approach icon gestur commun attempt recogn interpret icon hand gestur realiz icon system prototyp user interact object virtual move speech command accompani dynam gestur direct interpret gestur speech suggest possibl gestur system gestur segment complement spoken utter static gestur place dynam gestur movement icon respect shape properti evalu hand postur correl shape object referenc verbal hand rotat appli author call process correl icon map term gener map gestur express refer object phd thesi describ studi autonom gestur object design found di erent strategi usag surfac design emploi visual object author map mean gestur structur aspect consist respect preval combin postur function includ indic height hand thumb index cut materi hand properti studi fig stimuli object empir studi conduct empir studi analyz gestur behavior peopl natur exhibit face task object descript studi gestur behavior di erent narr special gestur gestur chose set close resembl target situat total subject describ part virtual construct applic displai project screen subject equip electromagnet mount wrist neck evalu hand speech record microphon headset descript frontal view show snapshot hand mention gestur explan explicitli enforc told experi particip explain object watch video imagin object corpu data consist gestur record accompani speech common evalu form featur gestur express relat geometr properti stimuli object observ suggest limit set gestur featur exist spatial entiti object assign major spatial entiti object extent di erent orient stimulu object quantit reproduct extent compar relat extent object signi featur linear circular distanc palm apertur hand orient curv gestur featur combin form gestur shown fig section movement describ domin object extent hand apertur subordin extent elong object meant parallel featur singl featur occur sequenti seri gestur phrase cubic object fig subsequ gestur indic spatial dimens gestur phrase belong common gestur form idea unit found peopl structur object part slot shaft part spatial relat scope idea unit space establish persist gestur context call virtual environ kita subsequ utter relat detail studi found fig gestur speech record devic data motion microphon headset corpu show vertic extent object model gestur speech recognit gener framework prevail psycholinguist theori gestur speech product assum sourc multimod utter origin speaker work memori nomenclatur proposit spatial butterworth call mechan conceptu process visual imageri mechan uenc mutual evok modifi assum conceptu predomin drive forc speech visual imageri promot gestur product disagr detail speech gestur auditori process analysi visual process syntax spatial analysi multimod interpret long term memori world conceptu visual imageri work memori fig abstract process model gestur speech recognit product process result gestur spoken utter product model mcneill assum basic origin utter call analyt process imageri mcneill inform process approach dialect process gestur view materi develop common sourc assum gestur commun convei inform contribut visual imageri conceptu receiv current approach speech gestur integr conceptu built fusion oral gestur inform provis properti includ ect spatial requir visual imageri provid basi abstract model recognit process shown fig recipi perceiv speech gestur analyz structur proposit part mean determin integr modal common conceptu multimod interpret step properti icon analyz time persist imag gestur part built properti persist essenti creation visual context serv refer frame subsequ utter analog product exist independ conceptu process evok imageri vice versa abstract recognit model focu technic realiz process step spatial analysi construct imageri comput model applic scenario approach comput treatment imageri refer identi cation task idea system movement featur object postur data recogn spatial analysi phase segment spatial entiti coder icon map visual imageri refer fig model recognit system refer object recognit gestur identifi object set object base gestur descript comput model substanti spatial shown fig visual inform input consist movement postur data provid data glove motion visual process spatial analysi subdivid process step gestur featur hold recogn segment modul divid gestur phase subsidiari movement meaningless postur assum gener determin part basi movement postur featur speech featur activ phase abstract basic spatial entiti spatial entiti build block store visual imageri compon spatial relat di erent entiti determin structur spatial gestur input construct map mechan compar intern object imag select object match implement approach base comput implement rst prototyp user select object set object displai screen icon gestur set instrument compar environ empir studi fig show user wall displai di erent shape object recognit system virtual realiti framework call base softwar environ easi access vr program featur recogn hand featur recognit system modul transform postur data cyberglov gener fig prototyp select refer object gestur shape descript tion modul base kinemat model human hand includ comput hand segment posit joint angl put scene model provid control mechan correct data map model develop test input data hand modul consist stream vector repres measur bend sensor cyberglov vector element number correspond joint angl linear fashion cyberglov measur point perfectli match joint model hand model ed glove transform depend appli comput miss model data result model repres movement user provid hand contact real object bodi hand modul set fuzzi variabl express bend nger symbol deriv notat modul di erenti ve basic nger stretch set ve variabl comput nger handl hand modul provid inform left hand index hand subsequ modul fuzzi inform concern posit thumb align opposit nger facilit detect gestur short distanc movement featur data locat orient wrist provid track devic data combin output hand modul absolut posit center palm refer di erent movement featur case heurist gestur movement fig visual hand model real hand cyberglov detect evalu hold linear movement segment featur gestur phase static dynam gestur detect base develop group facilit rapid prototyp evalu system gestur movement phase segment prototyp system support simpl gestur segment base typolog movement phase suggest kendon typolog de ne gestur unit movement occur rest posit unit consist gestur phrase gestur stroke option prepar retract phase rest space implement area chest height movement segment begin end rest space count prepar retract phase consid analysi retract rest space signal end gestur initi icon map process type gestur stroke prototyp hold synchron hold linear movement hand transit movement sequenti stroke ltere spatial entiti coder regard promin mean spatial extent diamet special case basic spatial entiti spatial entiti coder abstract concret realiz gestur transform set spatial entiti spatial entiti store visual imageri compon spatial relat exist entri determin system check domin extent equal extent imaginari visual graph spatial entiti node spatial relat link ext dom fig spatial dynam gestur move spatial extent recogn check spatial relat orthogon domin icon map icon map modul determin object object knowledg base match content visual imageri output icon map refer object applic command map base comparison gestur graph ned object graph mean subgraph match map process evalu object graph cost expend transform gestur graph true subgraph model cost function modi cation node link de ned individu prototyp comput cost function simpl assum object model mean gestur graph addit node link delet node link insert node type extent extent superclass diamet transform extent node diamet node cheaper vice versa transform cost node link total sum repres mismatch gestur object fig exempli es recognit process cubic object gestur unit indic cube extent dimens gestur model graph node spatial entiti built entiti relat orthogon eq equal determin graph match object note complet match necessarili recogn object object extent cube interpret match gestur model bar ext ext eq eq eq ext ext match object fig recognit gestur unit map static model imageri featur compar object model work present approach interpret gestur applic virtual design virtual construct task model simpl map gestur utter spatial entiti relat spatial gestur built approach import imageri addit conceptu structur construct context ai techniqu imag imag recognit mean subgraph realiz speech prototyp system remain open issu descript speech uenc imageri construct point improv gestur segment detail analysi gestur featur gestur stroke progress refer christian catherin lambert bernhard multimod speech system handbook standard resourc spoken languag system supplement volum van de duboi mean understood european bulletin cognit butterworth icon word retriev speech gestur design experi scenario phd technisch universiteit kendon aspect process utter mr relationship verbal nonverb page kita gestur speak mcneill chapter page david thorisson intellig multimedia chapter mit stefan approach lifelik gestur anim ecai european confer cial page io press marc gener framework multimod interact virtual realiti workshop futur ar adapt press speak mit mcneill hand gestur reveal thought chicago david mcneill factor speech gestur product chapter page david editor languag gestur cultur cognit cambridg bruno cient graph match algorithm preprocess model graph phd andr natur function biolog foundat motor semiot aspect lawrenc erlbaum vladimir rajeev thoma huang visual interpret hand gestur review ieee transact pattern analysi machin juli charl sander peirc collect paper charl sander peirc press harvard regina thoma jan hen version hamburg notat system sign introductori volum intern studi sign languag commun deaf franci david robert susan karl rashid gestur speech multimod interact monocular video note interdisciplinari colleg march timo sowa icon gestur object descript virtual empir studi technic collabor research centr arti cial david interpret depict gestur aaai spring symposium intellig page stanford march henrik distribut virtual realiti framework ieee virtual page
IR/388 5 enhanc group awar collabor digit librari john laboratori interact cooper universidad de la center missouri garden abstract digit librari regard virtual space collabor scholarli research conduct digit librari provid collabor space scientist work solut earth problem group awar collabor easili achiev increasingli distribut environ virtual space digit librari user work describ environ enabl group collabor user global access digit librari achiev extend exist librari facil recommend alert commun interfac recommend group digit librari introduct digit librari highli complex dynam inform space top varieti servic provid end user servic aim facilit inform resourc individu group activ inspir vision worldwid digit research world start develop number project relat digit aim address special domain user popul marchionini missouri garden lead digit librari initi virtual collabor space scientist gener public util collect inform kei aspect digit librari orient support collabor work common scientif advanc knowledg strongli reli research learn relat scholarli endeavor effect commun peer research natur conduct scientist interest problem research question physic distribut world environ studi share member global enabl maintain ongo discuss reflect state disciplin paper describ softwar compon digit librari enhanc awar librari patron user common interest gener commun collabor opportun remaind paper organ section detail context insight research practic commun section discuss conceptu design section describ current implement section present statu project direct ongo futur develop digit librari initi har accumul knowledg earth ecosystem support grand challeng st centuri plant sourc food oxygen live system provid benefit societi raw materi cloth medicin al plant speci disappear faster rate scientist studi tradit mean collect share inform hope solv problem inform commun technolog support distribut chang establish work improv effici qualiti inform gather dissemin particip digit librari initi intern advantag develop world wide web reifi conceptu framework research collabor occur project north america china sponsor nation scienc particip effort contributor patron gener face highli complex expect varieti servic provid librari assist deal complex environ contributor build digit librari requir multidisciplinari approach collabor commun context account special author review process complex interact team member project involv includ plant part biologist govern agenc forest bureau land fish state conserv biolog survei offic editori consist plant distribut unit state canada institut commit staff time facil success complet expect occur al al environ patron end user digit librari present complex scientif data plant includ special taxonom treatment morpholog distribut plant illustr taxonom rich digit medium make librari patron interact user casual user answer basic studi ecolog impact construct research extend exist knowledg base geograph region architectur past year develop system architectur address collabor inform manag commun librari servic built top distribut object repositori rich mix electron document textual bibliograph provid knowledg base current understand plant world servic made interfac provid type user varieti activ librari support interest explor approach librari servic user interfac current architectur evolut system architectur present al agent servic plai kei role servic interfac develop view al taxonom treatment construct al person inform retriev group work facil user expect work isol current interest digit librari spring opportun collabor enabl order user advantag inform commun resourc made commun effect librari user user digit librari presenc level area mean contact experienc user digit librari provid direct recommend newcom explor taxonom group inexperienc benefit expert recommend knowledg authorit opinion digit librari make group awar provid commun time protect privaci user individu prefer describ compon aim provid group awar commun function distribut repositori taxonom navig servic recommend servic server node taxonom browser group commun interfac awar interfac patron node figur compon environ digit librari conceptu design main object realiz potenti digit librari virtual gather place commun virtual group emerg criteria user interest level major design goal enhanc group awar user improv chanc commun user relat interest provid mechan commun collabor virtual group emerg regular compon mention build previou develop architectur compon architectur relev illustr figur sake servic interfac includ diagram taxonom navig servic provid requir number includ taxonom browser user repositori inform navig taxonom tree start group plant share number characterist move higher lower point user access data taxonom distribut refer authorit relat public plant illustr introduc major compon work conjunct taxonom servic taxonom recommend servic commun awar interfac recommend servic server introduc notion recommend servic recommend system repres emerg technolog user util unwieldi inform space connect user recommend servic refer extens collect recommend strategi client interfac recommend produc user refer librari element similar user request past user examin librari item user overlap interest request basic form recommend term collabor shoham recommend servic oper close relationship taxonom success recommend depend user action close user defin interest profil find user librari similar interest expert taxonom group identifi provid rank explicit recommend user specif librari area awar interfac compon introduc gener refer diagram awar interfac user navig access item virtual group user expert author log explicit recommend relat item made awar interfac bring event user attent action contact user group user access recommend commun interfac set action user event enabl compon introduc label group commun interfac figur user initi particip synchron asynchron individu group commun scientist expert present librari student examin expert profil question engag live student present option contact expert synchron audio asynchron virtual group exist discuss item student present option join synchron virtual asynchron mail distribut figur group awar collabor environ prototyp implement develop prototyp implement compon prototyp extend exist librari function introduc extens implement illustra manag system basic storag manag data repositori taxonom consist collect function multipl taxonom tree function access popular web browser newli develop function implement program access cgi java applet javascript program displai inform commun option independ window textual graphic element figur commun servic group awar extens make exist infrastructur present servic user extens taxonom browser initi session taxonom user present group awar option separ shown figur option commun servic select option user option contact expert examin relat shown figur option user send messag group taxonom expert regist discuss function implement mail distribut list expert present time user contact live enter virtual room implement commun displai figur alert window pop expert profil contact synchron user decid join synchron discuss option figur user obtain list regist user contact synchron asynchron figur virtual room recommend servic user obtain recommend pointer relat materi librari suggest expert user librari user individu prefer reach recommend alert window pop provid link relat rank provid recommend suggest link illustr figur expert suggest check user reach morpholog descript speci expert stronger recommend user level person provid recommend window pop autonom fashion user prefer profil unsolicit recommend user option main panel explicitli request recommend librari materi relat figur recommend provid current user domain expert option success reli librari commun member provid user particip form user commun point user option main panel person suggest rank interest user recommend rank domain expert figur show option user updat recommend user regist expert current level updat exist record recommend rank materi relat current updat exist recommend author taxonom treatment automat consid expert figur recommend recommend ongo futur work prototyp section demonstr major function includ design system part evolv digit undergo test actual librari base initi posit feedback success relat effort expect contribut significantli assist user fulli librari resourc softwar discov inaccess inform relationship librari deal highli complex dynam environ work realiz full potenti enhanc commun collabor digit librari mention section number recommend strategi amen part recommend servic current prototyp oper social protocol user explicitli provid recommend indic particip discuss collabor activ work implement strategi base observ user behavior similar measur user profil improv qualiti recommend reduc amount explicit input user area interest futur develop includ explor audio channel graphic virtual room bly roseman greenberg altern current implement acknowledg work support part grant andrew mellon foundat nation scienc foundat refer acm special issu recommend system commun acm collabor recommend commun acm de agent de en la de en una digit tech rep laboratori interact cooper universidad de la support awar distribut work group agent de como en tech rep laboratori interact cooper universidad de la worldwid digit librari commun acm practic digit librari morgan kaufmann monograph systemat missouri garden vol missouri st mo network place collabor approach construct digit librari acm intern confer digit librari forthcom introduc agent servic provid digit librari acm intern confer digit librari build gener biolog inform infrastructur nation academi scienc nation research council forum human quest sustain world dc north america digit case studi publish journal network comput applic
HCI/389 4 intern confer comput educ south pp support workspac awar distanc learn issu experi develop collabor learn system hua wang san chee school nation singapor scienc drive singapor abstract recent wit enorm growth network relat technolog materi increasingli publish web student encourag access leisur distanc learn www shift educ paradigm instruct collabor learn system user learn collabor increasingli interest scientif commun learn organ initi design prototyp collabor system support collabor learn internet usabl studi prototyp reveal import awar inform review wellknown collabor system find system todai lack support awar workspac awar type awar collabor learn situat set design requir system design prototyp awar widget typic collabor share electron whiteboard widget learner maintain awar learner interact share workspac collabor cooper user interfac user studi introduct world wide web chang internet extent synonym modern internet recent open learn distanc learn virtual institut spring globe educ program increasingli distribut teach classroom increasingli replac interact learn materi internet comput replac teacher distanc learn www present uniqu challeng learn distribut learner physic remov complet transform learn experi feel part lack motiv report student studi onlin onlin learn shift transfer ownership learn learner critic onlin teach human learn imperson real challeng design revolv retain tradit classroom design onlin ensur teacher student accept approach altern form learn guid philosophi suggest princip effect technolog part intern confer comput educ south pp idea constructivist theori appli case translat basic principl success learn experi practic design constructivist learn entail construct knowledg experi directli receiv encod inform extern world specif featur constructivist philosophi hold borrow research child plai valuabl form learn plai involv combin hypothet outcom imagin situat event manipul test idea learner concret feedback accuraci idea work plai power forc develop individu social led addit awar power gain made learner work grow bodi research collabor cooper learn demonstr benefit learner work learner collect learn effort advantag collect effort learner reflect elabor peer collabor virtual learn develop effort promot plai constructivist learn user collabor onlin learn particip activ virtual world level collabor provid environ augment support distanc learn order maxim educ develop collabor learn environ addit tool extens complement collabor virtual learn system paper present design awar widget collabor learn environ section overview present usabl studi perform discuss result section critic evalu collabor learn overview mutual awar collabor sketch collabor tool design requir section present design awar widget section discuss continu futur work usabl studi prototyp usabl studi system prototyp conduct determin effect gather feedback improv section begin overview descript method emploi studi discuss result present overview prototyp implement collabor learn system undertaken stage prototyp environ implement basic system collabor share electron whiteboard share mind map editor system support collabor learn group flexibl session collabor tool group resembl class broader mean group hoc group ad hoc group hoc group predefin list member project tutori group ad hoc group inform transient group system user join ad hoc group ad hoc group gener emploi discuss peopl similar interest session group user share collabor activ session commenc time user enter end user leav user launch collabor tool session user launch tool automat tool owner set mode share tool gener mode data owner share end close local share applic methodolog studi interview techniqu gather inform structur investig tradit control experi section describ setup studi intern confer comput educ south pp student particip studi paid volunt divid group group person group consist comput scienc undergradu group consist secondari school student group consist colleg student learn fine art student basic knowledg person comput student unfamiliar notion experi distribut groupwar system studi physic particip work person comput color monitor comput arrang particip observ provid assist particip record video camera kind task studi student group present discuss task student present dilemma situat question motiv discuss resolut dilemma task chosen problem correct creat natur collabor discuss set group present newslett design task design task gener hard student perform encourag collabor student particip introduc studi guid tour system function felt comfort began task time complet task hour complet conduct short interview investig event observ task explor data record observ group interact system session short interview conduct audio tape end session result discuss found student user comprehend successfulli system complet number complaint made system complaint group lack support lack support commun observ conflict situat user delet object awar user observ user end work commun rest user commun notic learn student experienc difficulti system fail support mutual awar user awar grant everydai set distribut normal cue inform sourc peopl maintain mutual awar lost awar import collabor learn reason reduc overhead work learner interact natur effect enabl learner engag practic collabor learn occur provid support mutual awar conclud studi mutual awar plai import role usabl collabor learn system briefli review collabor system present overview mutual awar collabor learn statement design requir critiqu relat applic attempt creat similar collabor system microsoft netmeet offer wai exchang inform peopl onlin meet critic netmeet share displai model share gener pc applic netmeet intern confer comput educ south pp support workspac awar ncsa collabor system framework share java object colleagu internet launch applic type session remot open applic type particip session support workspac awar groupwar toolkit develop build applic synchron distribut conferenc implement featur groupwar widget enabl interfac featur confer particip easili ad groupwar applic design awar widget discuss section partial inspir featur design educ special support distanc learn awar collabor learn gutwin greenberg identifi type student social task concept awar workspac awar social awar awar student social connect group task awar awar task complet concept awar awar activ piec knowledg fit exist knowledg workspac awar understand interact share workspac involv knowledg thing examin workspac awar perceiv essenti factor learner initi interact collabor peopl maintain mutual collabor activ order research effort manag narrow focu restrict studi small group workspac medium size design requir benefit gain creat mutual awar free gener problem provis awar privaci violat user disrupt aspect privaci import environ design present action peopl peopl necessarili detail reveal peopl issu privaci violat easili point dourish conclud studi media space system privaci issu settl technic mean necessarili involv social interact technic control inform overload gener problem electron environ inform densiti awar inform distract user work design awar widget care choic present awar inform bandwidth hardwar present constraint awar inform provis student afford high bandwidth aim design awar widget awar inform prefer request explicitli distract awar inform automat collect user work system basic guidelin design awar present inform distract provis awar inform collect inform transpar user design awar widget section concentr select design awar widget start present framework guid design detail design awar widget intern confer comput educ south pp framework guid design applic requir type awar inform awar widget select requir applic applic studi case share electron whiteboard reason whiteboard present typic workspac conform constraint small gutwin greenberg present framework design awar widget framework good start point design framework consist element process maintain workspac awar part framework divid workspac awar type inform peopl track share workspac part concern retriev present awar inform identifi part part design learn situat activ workspac awar analyz collabor task determin groupwar support call base design awar widget shown tabl share whiteboard convei aspect awar inform whiteboard element statu indic radar view telepoint object chat presenc presenc view rectangl exist telepoint user start chat present ident color authorship action view rectangl initi person action show navig action intent artifact artifact lock object proxim telepoint action proxim telepoint artifact locat locat object locat view rectangl telepoint locat workspac gaze gaze gaze view rectangl telepoint view extent view rectangl telepoint view reach peopl reach thing insid view rectangl radar view gaze object point object point view tabl workspac awar inform provid kind awar mechan radar view displai workspac awar inform miniatur entir share workspac individu move freeli workspac provid inform whereabout activ usabl studi shown radar view effect peopl maintain awar spatial task displai emploi repres workspac object displai peopl differenti object radar view overview entir user view port repres color rectangl radar view user id attach rectangl identif radar view design fulli interact drag view rectangl radar main view scroll locat user chang color color rectangl identifi user intern confer comput educ south pp figur show sampl whiteboard window radar view telepoint enabl student bob work upper side mari work lower side workspac applic interfac shown radar view top left corner main view radar view show main view color rectangl bob move radar view inform view locat bob view rectangl mari view rectangl telepoint telepoint act locat draw user attent user telepoint point user id shown telepoint owner ident user id bear color rectangl repres user radar view enabl easi associ user figur show telepoint bob mari id paint color rectangl repres view mari repres color red telepoint highlight yellow move telepoint statu indic figur radar view telepoint awar widget statu indic mari telepoint figur statu indic awar widget bob telepoint intern confer comput educ south pp collabor learn happen user manipul object lock collabor user obtain lock share object manipul object show dialog box time user attempt lock object distract solut signal user object lock user acquir lock design widget call statu indic specif handl problem transpar layer emploi show object statu show statu lock object lead user clutter order distract user object statu shown user click statu shown lock object user decid lock figur show applic interfac statu indic enabl lock yellow circl held user object chat verbal convei peopl point indic practic point gestur noun call deictic refer ubiquit share workspac deictic refer crucial part commun share space object chat design facilit deictic refer referenti commun involv messag person thing set object transcript collabor activ messag knowledg workspac time fragment newslett layout move good object chat person select object send messag object messag shown object collabor work group object messag sender refer sender id time stamp shown messag receiv sound plai light flash statu bar applic messag figur show applic interfac user mari yellow rectangl whiteboard window show chat messag mari opinion duke icon bottom corner flash light incom messag statu object chat messag shown statu bar statu object chat messag figur object chat awar widget object chat messag flash light light intern confer comput educ south pp current system implement basic oper object design histori mechan store retriev object chat messag flexibl effici manner futur work investig workspac awar distanc learn environ continu direct plan conduct experi establish usabl awar widget improv widget design step collabor learn system larger sampl student track collabor tool longer period time main object phase evalu understand collabor learn tool awar widget design student studi stage engag process iter design longer find exist face face practic creat awar mechan peopl expect refer cognit cultur educ vol pp extens collabor virtual learn intern confer comput pp privaci develop comput support cooper special issu pp teach craft write learn essai honor robert lawrenc erlbaum classroom make break marshal redefin student root educ pp control media european confer cooper work pp learn materi workspac awar educ confer comput support collabor pp framework awar small group workspac technic report depart comput usabl studi awar widget share workspac groupwar acm confer comput support cooper pp knowledg commun intellectu social technolog foundat cooper lawrenc erlbaum pp ncsa april april real time groupwar groupwar acm transact comput human learn educ technolog research vol pp checklist interfac crew nasa research contractor report observ studi collabor intern journal vol pp social dimens asynchron learn journal asynchron learn vol pp
DB/390 3 ieic tran inf vol januari paper special issu gener technolog formal approach detect secur flaw morita student seki minoru ito member summari flaw import order flaw mean infer method permit method enforc acc control flaw occur author main aim st algorithm detect flaw problem polynomi time reduc paper mention problem find maxim author kei secur term rewrit system introduct recent author model objectori author eleg model harmoni concept object access method paradigm author user repres set mean invok method tupl object object class paper adopt author model assum manag polici author user invok object method execut object identifi result object primit base type declar user extern specif open manuscript receiv manuscript august author graduat school inform nara institut scienc japan detect secur flaw import order secur secur flaw mean infer result method permit method author manag system enforc access control secur flaw occur author show secur flaw unari object class author user implement bodi polici infer schema instanc author user term detect problem secur flaw decid infer main aim paper show cient algorithm detect problem secur flaw adopt method schema formal model oodb schema basic featur oodb method complex object semant simpli defin base term rewrit show problem reduc congruenc closur solvabl polynomi time practic case paper mention find problem schema instanc author user term find maxim subset infer problem solvabl polynomi time practic case mention variat problem model secur flaw discuss user attack model infer infer infer mean user infer exact result ieic tran inf vol januari method show infer refer discuss infer oodb infer mean user infer candid result method refer discuss infer ref oodb paper infer oodb secur flaw classifi infer control roughli infer mean user infer return method control mean user control object instanc queri languag support updat oper infer consid secur flaw paper queri languag support ref detect infer formal obviou refer schema author sound algorithm decid secur flaw exist instanc instanc consid input algorithm decid secur flaw exist method schema syntax introduc notat defin syntax method schema famili disjoint set fn set function symbol ariti countabl set tf denot set term freeli gener term tf denot term obtain term term defin set occurr smallest subset sequenc posit integ satisfi empti sequenc center dot repres concaten replac denot defin definit method schema finit set class simpli famili mutual disjoint finit set mn set ariti mn partit call simpli call signatur definit express object class definit formal base method definit declar applic result object subclass definit express tm object user method definit state applic result term rewrit start formal definit present sect definit method origin introduc abiteboul finit set class partial order repres class hierarchi subclass superclass method signatur set base method definit set user method definit combin exist method definit morita formal approach detect secur flaw fig method fig hierarchi method schema repres relationship personnel custom figur show method schema user method leader custom return leader group partner custom boss belong method inherit method definit inherit class hierarchi method definit class manag subclass inherit method definit definit smaller respect formal defin inherit method definit definit method base method definit case write call write irrelev uniqu base method definit resolut write user method definit defin method definit method definit exist incompar respect semant semant method introduc abiteboul defin set object base method map set object assign interpret semant user method defin interpret base method term rewrit set denot cartesian product definit call method schema pair assign finit denot call ct os partial map ns os satisfi total map denot domain restrict belong defin belong undefin interpret ieic tran inf vol januari green object brown object applic clerk green result brown write tupl class object write implicitli assum compon write term tm call instanti term instanti term consist method object os instanti base leftmost innermost reduct defin definit instanti term tm leftmost innermost occurr subterm instanti term exist term reflex transit closur exist call fo write execut os nonexist execut abo execut termin execut simpli write understood context success method execut order detect secur interest result success method execut mn ns comput exist term rewrit system induc definit comput congruenc closur definit relat tf call satisfi impli fn binari relat tf congruenc relat subset tm satisfi ns close respect subterm requir smallest subset satisfi condit comput result success method execut desir small defin restrict congruenc closur os order achiev comput lemma ft refer show problem theori equal reduc congruenc closur problem lemma hold fact lemma os ft induct length proof definit exist lemma hold lemma hold evid induct shown proof morita formal approach detect secur flaw step induct hypothesi lemma hold step induct lemma hold step induct hypothesi innermost reduct exist induct prove provabl lemma hold lemma prove theorem hold lemma theorem os result success method execut obtain leader subterm definit obtain leader construct obtain congruenc closur black obtain leader summar time complex comput result success method execut defin size term denot number element set number node tree repres defin descript length defin descript length denot sum defin size denot ns ns comput result success method execut ns maximum number ariti method ref detail secur flaw author author model discuss author model main adopt gener simpl author model definit method schema user finit set mn mean permit invok method tupl object simpli write unari method author model base author set infer rule infer rule user permit invok object ieic tran inf vol januari permit invok object subclass base author expand assum author expand author user interpret execut permit silver prohibit green silver formal definit user infer method interpret author user os term tm interest decid infer object os defin inform obtain inform exist object denot set object exist os defin smallest set satisfi fix set exist os regard knowledg exist os assum partial knowledg advanc deriv polici obtain result inform class object class class exist exist user hold exist object obtain class belong exist obtain relationship inform equal term obtain directli ns tm user hold os hold user hold hold deriv polici sect correspond polici obtain type declar base extern specif user data object assum user object repres basic integ string mean user properti exhibit assum user priori knowledg base method basic valu implement object user priori knowledg base method base method comput factori assum user user user behavior factori mean object user permit invok priori knowledg base user inform inform user infer inform user kind infer substitut infer rule yield equal contraposit yield inequ inequ interpret shown fig arrow label show tabl show result method execut assum author user obtain equal morita formal approach detect secur flaw fig interpret tabl substitut assum author obtain obtain inequ contraposit substitut condit user os user condit satisfi hide os user examin condit user infer condit schema interpret author user state infer os obtain sa infer neglect case exist object user os disjunct equal infer conjunct inequ avoid formul complic infer inequ useless infer equal user infer model congruenc closur equal user obtain directli equal obtain includ finit set ground equal author user interpret obtain os infer class belong condit conclud infer class belong neglect case class belong infer exact equal obtain appli term mean equal obtain regard ground regard algorithm comput congruenc closur introduc congruenc relat tm mean user infer definit defin congruenc closur ieic tran inf vol januari binari relat tm satisfi os polici tm polici simpli write understood context previou os user obtain brown green user obtain brown congruenc detect problem secur flaw definit pro secur flaw decid tm exist os subset tm defin sect subterm order comput comput defin sect advanc detect problem secur flaw solvabl comput result success method execut comput obtain os comput exampl term verifi white obtain silver leader leader construct obtain black secur flaw output user obtain result permit user prohibit directli invok method leader author os leader leader exist object secur flaw output complex comput defin sect time time complex comput refer ref theorem detect problem secur flaw solv kn maximum number ariti size term verifi implement result base method store tabl static user invok base user obtain result method retriev tabl repres size tabl repres assum corollari detect problem secur flaw solvabl polynomi time morita formal approach detect secur flaw fig procedur find author safe author shown decid tm exist os exist object author call safe exist mean data obtain problem definit find pro tm maxim safe subset theorem find problem safe author solvabl polynomi time show algorithm find safe author fig subset obtain safe maxim exist hold os definit impli exist safe hold os hold lead maxim safe author detect problem secur flaw test detect problem solvabl polynomi time corollari find problem safe author solvabl polynomi time give prioriti element author find maximum safe author prioriti variat find problem safe author find safe author prioriti element sum prioriti element maximum problem solvabl tighter bound open special case prioriti problem solvabl polynomi time algorithm element check order discuss detect problem secur flaw provid algorithm solv problem reduc problem congruenc problem solvabl polynomi time practic case mention find problem safe author shown problem solvabl polynomi time practic case variat problem state sect left futur work mention adopt method schema formal model oodb method schema support set object method schema defin queri set directli appli method paper model oodb support set object deduct objectori order support set modifi definit sect infer rule oper set method schema support updat paper discuss problem updat interpret updat interpret chang safeti author user obtain inform interpret integr constraint notion safeti author extend method author secur flaw violat integr constraint make situat complic problem involv updat left futur work discuss detect problem secur flaw schema problem schema author term exist interpret secur flaw exist respect safeti author schema independ interpret acknowledg author dr dr watanab nara institut scienc technolog comment author grate review invalu comment work support part ministri sport cultur japan scientif research ieic tran inf vol januari refer comput infer databa ect scienc bertino approach author model data knowledg hh advanc implement applic rl rivest mi electr engin comput scienc seri handbook comput ed pj eb mm author model proc conf secur garvei ect practic formali infer statu ect hs framework data databa statu ect chapman formal approach flaw report june author model acc ieic ran inf june detect problem data flaw ieic nov dc procedur queri proc intl conf deduct lnc detect flaw objectori proc acm conceptu handl infer statu ect morita receiv inform enc scienc hei phd candid graduat school inform scienc receiv inform comput ectiv join faculti graduat school inform scienc inter theori formal method seki receiv inform comput ectiv join faculti scienc minoru ito receiv inform comput ectiv april graduat school inform scienc scienc inter theori applic dna probe hei member ieee comput societi
IR/391 5 maximum entropi languag model integr topic depend speech recognit jun wu center languag speech process john hopkin md abstract compact languag model incorpor local depend form long distanc depend dynam topic condit constraint present constraint integr maximum entropi principl issu assign topic test utter investig recognit result corpu present show small number model reduct word error rate languag model perplex achiev trigram model analysi demonstr gain larger word result compar obtain interpol model framework present extend easili incorpor form statist depend syntact relationship hierarch topic constraint introduct languag model crucial compon system convert languag includ speech text current algorithm languag tend suffer acut base predict word immedi word human face compar task easili outperform model richer linguist inform complet context present method exploit depend dynam model topic present compact model integr depend statist sound manner maximum entropi framework model combin topic relat inform model essenti idea inform retriev literatur extens made weight discern topic genr document scheme exploit differ languag model construct separ model individu genr topic captur differ construct result fragment train usual remedi interpol topic specif model model construct data altern present start similar make ad hoc exponenti model limit object fast work read speech support nation scienc foundat grant dynam model notion semant notion topic approach base latent semant analysi recent refresh departur method present perplex newspap text method present treat salient featur ngram frequenc salient featur admiss model requir satisfi constraint reflect set featur principl select statist model meet constraint method advantag constraint vari significantli topic made model topic train train make obtain estim compon model model small number free paramet consequ present result featur easili includ higher order frequenc document syntact frequenc po constraint easi integr unifi manner simpli featur corpu model constrain match section formul model issu assign topic test utter discuss section section describ experi corpu spontan american english telephon analysi result section make comparison method method combin topic specif ngram model linear interpol combin topic depend denot vocabulari speech recogn languag model view famili condit probabl mass function word wk base classif hk trigram hk framework long rang histori assign topic suffici statist histori tripl hk pt intuit suggest word vocabulari strong depend topic estim separ condit fragment train data result poor estim word topic relat term seek model addit meet margin pt pt jt note margin probabl reliabl estim condit margin base complet left model requir replac estim linear constraint form defin famili model famili highest qualit addit assumpt maxim smooth model model exponenti paramet linear constraint suitabl normal constant numer term correspond standard fourth paramet determin topic comput issu model estim gener iter scale algorithm comput model paramet predominantli comput storag paramet estim overcom order successfulli implement languag model incorpor topic depend constraint unifi manner overcom complex addit unigram partit train corpu base topic perform iter gi algorithm updat separ correctli combin updat corpu reduc comput complex order magnitud topic assign test utter issu lm speech recognit actual spoken word topic topic assign base recogn investig impact recognit error process topic chang progress examin topic assign entir test part utter studi topic assign utter base includ includ utter result present section result train set model consist total million word annot rang affirm action topic recommend caller data call adher assign topic vocabulari task word includ word train test set perform lm evalu test set word utter test list gener recogn hmm gaussian mixtur output densiti bigram lm recognit word error rate averag perplex transcript test set report baselin experi tabl show perform standard trigram model model constraint minimum count bigram includ model trigram leav infrequ bigram model perplex wer tabl perplex wer trigram model maximum entropi model trigram constraint trigram model rapid model present smaller model construct calibr model ngram constraint constraint model essenti replic perform model improv ad constraint yield attribut featur method estim model side train corpu process obtain repres vector weight frequenc vocabulari term exclud stop stop word list word low semant content topic classifi vector cluster procedur initi cluster assign deriv manual assign topic result cluster assign fix side remaind train process word unigram frequenc cluster differ significantli frequenc corpu design word word log word relat topic roughli word topic word constitut million train token model train constraint kind word addit constraint topic assign test model topic assign test utter investig option manual assign topic automat topic assign base refer transcript gener recognit assign oracl minim perplex present tabl sourc text perplex wer topic classif manual assign ref transcript oracl tabl topic assign base erron recogn degrad perform wer small loss perplex neglig loss wer topic assign base recogn correct transcript comparison oracl room improv investig topic assign granular found recognit perform achiev assign topic utter base current utter result present tabl note topic text perplex wer topic classif ref transcript oracl tabl dynam topic assign individu utter base current utter tabl effect assign ad constraint reduc absolut wer rel perplex gain insight improv perform topic examin agreement topic assign level tabl utter prefer model filler serv vital function hard made assign closest match topic result present formal extend easili soft topic emploi standard cosin similar measur commonli ir commun assign topic test sentenc null default baselin choic topic classifi sourc agreement level topic text topic conv conv classif level topic topic topic ref tran hyp tabl topic dynam view topic assign remain major closest topic assign larg fraction closer topic prefer equal remark result topic assign close topic similar analysi recognit perform improv model aim improv vocabulari divid word unigram constraint word token refer transcript mark belong set perplex calcul separ word recogn output similarli recognit error assign separ wer set word token test set constraint tabl show breakdown result set languag model topic word word wer wer tabl analysi perform gain lm word model constraint divid vocabulari simpli word stop word defin token test set remaind stop word tabl present perform gain analyz partit languag model content word stop word wer wer tabl perform improv word clear tabl gain perplex predominantli improv wer word greater wer import end user interpol topic compar trigram model model introduc addit paramet modifi probabl hundr word context topic altern model approach partit train build separ model topic topic train smaller interpol topic specif model model train data obtain smooth model compar approach construct bigram trigram model specif topic partit million word corpu model section interpol trigram model obtain smooth model tune interpol coeffici held set interpol weight minim perplex test set interpol model tabl show recognit perform interpol model topic test utter interpol model topic model model perplex wer topic topic topic tabl comparison interpol topic model argu approach permit combin unigram constraint effect inform interpol topic specif trigram model due systemat integr constraint model model includ lower count rapid experi section compar model constraint bigram trigram implement model constraint frequent compar model perform model shown tabl clear topic condit reduc model perplex wer tabl final comparison lm wer amount case model topic model reduc absolut wer rel perplex trigram model improv word section conclud remark languag model combin topic depend constraint unifi fashion small perform gain cost addit paramet perform improv word small number unigram provid improv inform provid complementari integr model abil framework extend easili combin current effort direct exploit syntact structur obtain left partial utter syntact constraint provid inform complement topic depend addit constraint word class frequenc base part hierarch topic depend order extend model deriv benefit flexibl offer framework acknowledg substanti assist topic classif provid david yarowski provid list stop word algorithm automat assign topic test utter refer local global constraint statist languag proc vol pp syntact structur languag proc vol pp aug chen adapt languag model unnorm exponenti proc vol pp clarkson model adapt mixtur exponenti decai proc vol pp apr squar maximum axiomat approach infer linear annal vol dec iter scale annal math vol syntact word relationship languag phd qualifi project cs john hopkin iyer long rang depend proc vol pp oct model adapt dynam proc vol pp sept martin languag model proc vol pp sept htk book
Agents/392 1 monitor control resourc usag mobil agent system paolo antonio corradi dei bologna abstract mobil agent technolog shown time remark problem limit commerci environ kei issu control oper foreign mobil agent author perform host execut environ rule ma access resourc control resourc usag admit agent execut instanc protect attack paper present solut framework monitor control ma platform describ design implement monitor compon integr system paper show build block distribut monitor tool inform state mobil agent resourc enabl enforc manag polici ma resourc consumpt introduct mobil agent technolog demonstr suitabl applic domain number ma platform limit number exampl servic main motiv stem fact softwar compani trust complet ma technolog potenti problem introduc host execut foreign activ entiti research obtain result ma secur protect host site run agent defend agent code state current execut environ ma platform exploit tradit secur techniqu ma access local resourc techniqu target protect cesar stefanelli dip ingegneria attack mobil agent engag resourc make unavail activ appli techniqu track resourc quantit associ user aspect disregard ma framework tend support tool account ma resourc consumpt bill agent user confid ma system built embodi compon support monitor eventu limit resourc usag mobil agent execut agent user author execut local administr give maximum percentag threshold total cpu time order preserv cpu avail local activ servic agent obtain permiss open network connect network usag eventu account gener amount traffic claim agent monitor critic factor accept ma technolog enlarg core industri applic avail onlin monitor compon consid crucial ma order observ behavior mobil agent runtim permit correct manag oper enforc requir polici ma resourc usag recent ma platform adopt java implement languag java present obviou advantag support mobil agent class secur mechan directli provid basic facil languag java virtual machin abstract hide inform obstacl deal monitor extens java technolog overcom jvm profil interfac export jvm intern event debug monitor java nativ interfac permit integr java program execut code java framework face necess integr compon tool compliant widespread internet snmp shown suitabl encapsul specif aspect legaci compon paper describ monitor applic program interfac implement build monitor compon ma environ integr secur open mobil agent platform exploit collect event produc java applic object alloc method emploi technolog make integr nativ monitor implement window solari linux encapsul legaci snmp compon filter inform yield aggreg monitor limit overhead due long sequenc snmp exploit obtain monitor inform ma resourc local remot local visibl global state distribut resourc mobil monitor agent charg filter transport request data build distribut framework emploi monitor inform knowledg base enforc suitabl manag polici monitor indic exploit possibl oper specif mobil agent resourc fine granular case local congest administr dynam limit number oper author agent remot complet block paper final report measur overhead introduc monitor support oper system overhead depend granular monitor indic time interv tune dynam administr runtim condit present perform show feasibl approach modif standard jvm consid basic requir ma platform aim work global open distribut environ internet technolog monitor mobil agent ma program paradigm technolog design implement applic internet scenario mobil agent requir establish trust relationship involv order protect agent execut environ control amount resourc mobil agent runtim order protect agent execut environ attack denial major threat avail ma platform scenario stress import measur control resourc consumpt ma system current ma platform implement decid classifi resourc jvm resourc oper system defin resourc support jvm visibl run agent set jvm resourc consist local remot resourc access java object execut resourc host oper system lower abstract layer author mobil agent cpu bandwidth current execut jvm hide visibl effect cpu time consum specif agent ma platform exploit java mechan control access jvm resourc advantag basic version proprietari part java program environ control jvm resourc access defin suitabl permiss class secur polici control java code access mobil agent requir mechan dynam ascertain qualiti usag access jvm os resourc solut guidelin viabl build resourc manag resourc potenti access mobil forc agent work resourc intermediari entiti agent direct visibl resourc manag mediat solut requir write manag type recogn overhead proxi access possibl organ monitor servic inspect state jvm os resourc agent execut exploit java technolog extend visibl integr extern standard snmp monitor monitor control consumpt jvm resourc interfac featur java platform design develop debug java applic api jvm dedic profil agent jvm notifi intern event java thread state class load object profil agent profil agent notif specif type event perform limit manag action jvm java thread garbag collector permit achiev visibl os resourc provid standard invok code jvm api interfac permit java thread invok nativ function typic written window nt dynam link librari share object librari solari linux java program invok nativ simpli declar method keyword nativ bodi bind obtain call jvm call request function nativ librari execut specifi mode method rule perform paramet java invok thread invok nativ method direct nativ librari call jvm entiti nativ method callback java environ invok java access modifi object call java java except snmp monitor solut network manag domain special protocol type possibl remot snmp manag snmp agent snmp manag protocol request valu state indic snmp agent snmp agent plai role server repli manag request extract indic valu local mib mib specifi organ format maintain state indic recent research work show trend exploit java basic technolog system manag area main motiv capac java support rapid prototyp wrapper integr java recogn manag corba start java platform implement snmp compon put legaci manag solut local monitor control mobil agent secur open mobil agent program framework design implement support servic open untrust internet environ exhibit modular organ set layer middlewar servic implement java achiev portabl figur servic agent secur agent dynam instal extens compon permit code state migrat servic provis achiev scalabl crucial global internet offer local abstract describ kind interconnect system node host place agent place group domain abstract correspond network local default place charg rout function integr legaci compon corba mobil place local abstract support mobil enhanc normal place specif featur automat reconfigur chang domain attach applic middlewar servic multimedia distribut inform retriev java virtual machin heterogen distribut system system manag secur manag migrat commun monitor figur modular servic architectur platform paper give gener present platform middlewar focu specif solut adopt monitor control agent claim ma technolog industri commerci applic slow limit confid organ ma execut make crucial flexibl mechan tool agent access polici express ponder dynam observ control amount resourc consum ma execut ma platform provid function monitor manag mobil agent enabl system administr control oper malici badli program admit agent reason design implement compon integr program framework inspect state local jvm resourc permit oper simpl manag action agent monitor state resourc agent singl exploit platform coordin local monitor entiti section organ produc global vision monitor distribut infrastructur perform onlin manag servic figur show architectur uniform monitor interfac independ platform heterogen implement class integr profil snmp nt class dll monitor applic program interfac class java nativ interfac agent window nt os compon resourc manag class linux class java virtual machin snmp agent class agent solari os compon profil agent jvm profil interfac agent linux os compon figur architectur profil agent gather monitor inform jvm resourc monitor target collect event filter process offer monitor indic servic execut monitor function immedi portabl host run jvm version snmp snmp agent act snmp manag interrog standard snmp agent target obtain monitor data local os resourc snmp agent uniform java interfac wrap possibl snmp implement local optim snmp section simplifi configur phase secur paramet integr distribut secur infrastructur exploit class achiev visibl os resourc integr monitor function function implement nativ librari interfac platform dll microsoft window nt sun solari linux charg load correct nativ librari current monitor provid platform independ permit obtain os resourc monitor data snmp agent target host figur show set method provid monitor paramet summar current state monitor agent run administr servic autonom servic obtain manag inform runtim adapt servic provis runtim overhead monitor result promptli immedi manag section tune time method msec invoc paramet time interv refresh monitor indic time interv propag compon updat statist collect interrog snmp invok nativ monitor librari method return object arrai object class shown figur object maintain data relat current pid process monitor data includ cpu usag total alloc memori miscellan inform thread jvm maintain refer java thread number load alloc invok network file system oper java thread identifi time cpu usag packag public class string current oper system public class int process id string float long cpu time long physic memori long virtual memori long total phy memori thread info public class extend thread thread object int load class int monitor int object int live object int heap alloc int live heap alloc int invok method int tcp read op int tcp write op int udp read op int udp write op int file read op int file write op long life time public class int thread id float long cpu time public class int udp packet int udp packet int udp error int udp error int tcp connect int tcp segment int tcp segment int ip packet int ip packet int ip error int ip error public class int process id string process long total space avail float public class string ab file long time open int figur class interfac class report aggreg monitor data usag commun infrastructur target host monitor data includ total number tcp connect percentag packet receiv percentag discard output packet paramet permit give evalu host traffic condit identifi congest situat class maintain gener inform file system target free space percentag total detail data open file activ process file open current class return open time open mode implement basic guidelin implement tool modifi standard jvm possibl monitor mobil agent interven sourc code fundament adopt distribut monitor servic open internet infrastructur requir design implement ad hoc profil agent dynam configur monitor jvm snmp agent obtain monitor data snmp agent execut nativ librari rm uniform data acquisit heterogen monitor mechan profil agent profil agent permit configur dynam event notif provid class monitor indic obtain filter histori previou perform detail profil agent possibl chang set notifi event monitor implement method event notif relat object method java monitor updat statist monitor event provid immedi readabl indic maintain huge log monitor data profil trace size total memori alloc thread agent log full data due execut system call memori alloc refresh interv monitor indic chang dynam tune depend constraint condit section figur sketch piec profil agent code regist event signal event ev profil perform action figur show initi class load initi intern profil trace invoc method increment maintain account tcp read oper agent time interv data repres rough estim incom network traffic produc java servic compon inform traffic due specif java thread command profil agent examin dynam invoc paramet method set maximum level detail trigger object default profil avoid excess overhead dynam gener process object dump event refer method refer case case stat updat tcp statist figur monitor invoc profil agent snmp agent snmp agent refin extend snmp gatewai compon includ framework distribut manag heterogen network element act snmp manag local interrog snmp agent snmp agent program request monitor inform maintain standard mib data network element mib extens includ host resourc group call run run softwar perform group provid inform resourc usag process execut obtain exploit standard snmp mib snmp agent improv effici standard snmp deal network transfer larg chunk monitor data transmit chang indic maintain valu paramet snmp agent local interrog snmp agent obtain result offer indic possibl remot significantli reduc gener network traffic singl mib variabl lower level aggreg multipl variabl requir aggreg health function percentag discard ip output packet obtain combin mib number output ip datagram discard problem buffer rout total number ip datagram transmit local gener packet forward snmp agent perform oper support mutual authent case interact agent obtain dynam secur inform public kei infrastructur integr program framework local store configur paramet specif snmp agent support order autom possibl complex phase initi tool snmp agent host resourc mib extens support manag enabl gather monitor data process nativ mechan inform crucial control action agent depend runtim condit host environ administr enforc strict polici agent cpu usag total cpu usag host overcom threshold nativ modul extract uniform data exploit heterogen monitor mechan provid target oper system manag class emploi load nativ librari runtim implement nativ monitor compon window nt solari linux compon integr java class call nt linux depict figur figur show piec dll access os resourc state indic maintain microsoft system registri kei figur report poll registri obtain updat inform process execut system call permit obtain perform data report invoc return refer nativ call access inform process identifi pid data pointer obj pointer cnt pointer cnt pointer inst pointer figur monitor process inform dll solari linux implement nativ monitor modul dynam librari exploit featur virtual directori make visibl os resourc state indic file system librari poll monitor inform execut process read file directori permit obtain maintain data ident process cpu nativ compon extract descriptor open file virtual pid identifi monitor process file descriptor data combin inform system file approach similar implement unix util aggreg inform network usag obtain invoc standard system call distribut monitor control agent place exploit local compon achiev visibl monitor enforc local polici ma resourc usag mobil agent act distribut servic compon distribut global vision distribut state resourc consumpt order enforc distribut control manag polici administr enforc polici involv set distribut total cpu time dai consum agent princip lower xxx compon basic mechan provid distribut manag monitor data coordin local monitor entiti term mobil agent monitor control distribut system provid distribut monitor control design implement type manag explor explor agent charg collect monitor data set target target belong network local manag agent command combin monitor result present global view monitor domain system administr manag deleg manag oper similar organ hierarch level number target domain system administr deleg manag oper manag oper autonom collect inform state administ manag coordin oper explor agent explor gather monitor specif alert threshold refresh time command manag oper manag creat monitor explor control target domain explor agent period migrat target domain host invok local order collect monitor indic jvm resourc os explor respect alert threshold manag modifi threshold explor notifi manag autonom correct oper servic compon explor reduc network traffic due distribut monitor perform local manag oper manag system administr explor invok profil agent function control manag local java thread modifi prioriti run thread forc thread control suspend agent interv exploit persist mechan observ specif implement jvm limit control action addit control function recogn crucial emerg market recent stimul sun research work provid separ execut environ java thread group permit independ control overhead distribut tool tune modifi monitor paramet chang dynam visit time interv explor target domain host refresh time interv modul manag command explor invok profil agent method notif specif kind adapt dynam collect monitor data enforc manag polici section present result overhead agent monitor administr defin agent permiss duti agent permiss action agent author perform set target possibl depend runtim condit agent duti action agent perform set target resourc condit place control network resourc consum target administr enforc distribut author polici limit number socket oper agent dai target host domain limit number socket oper appli group set agent princip agent duti administr request explor agent lower automat prioriti agent run host total cpu usag percentag host higher defin threshold simpl explor control singl agent monitor state singl host permit defin duti monitor state target domain perform manag oper group agent distribut monitor tool ascertain number socket oper agent agent node domain manag command explor probe target domain request socket oper control agent introduc delai control agent author permit polici depend current distribut state enforc distribut agent distribut tool enabl monitor cpu usag trigger manag oper manag command explor control state cpu usag host depend interv time duti specif threshold explor act agent exploit function modifi dynam prioriti java thread condit control agent permiss duti express complex function monitor indic shown monitor current state agent java system servic compon extern jvm evalu agent monitor control valid applic distribut monitor control mobil measur overhead compon intel pc microsoft window nt linux sun workstat solari host interconnect mb ethernet local area network section report cost modul regard profil agent java benchmark applic stress cpu memori usag gener fix number thread object measur report refer case benchmark process averag number thread measur overhead modul depend time period refresh monitor indic defin overhead percentag introduc monitor tool overhead averag complet time java benchmark unload tool execut note unload target repres worst case load grow faster ratio valid measur benchmark test measur confirm expect averag paramet condit averag load figur depict introduc monitor inform support platform diagram drawn function refresh time repres interv success invoc nativ monitor modul exhibit linear depend reciproc refresh time obtain analog trend measur case nativ monitor window solari linux refresh time figur process monitor test show limit overhead lower refresh time interv greater consid accept refresh monitor indic time period suffici enforc resourc usag polici nativ modul continu collect monitor refresh interv repres period success interrog nativ monitor result measur overhead introduc profil agent jvm notifi continu kind event poll refresh time repres interv process collect observ event order obtain desir monitor indic figur depict contribut relat data access notif method object trace result obtain solari platform similar window nt differ lower maximum figur show notif scarc load condit independ refresh time refresh time affect overhead due process collect event read indic object trace shown relev factor profil agent larg amount data requir receiv collect profil total overhead refresh interv greater object trace disabl monitor data read object trace method trace trace sampl time monitor object data read method trace trace sampl time figur profil agent consid distribut monitor control exploit mobil explor agent migrat interrog local modul size explor vari carri monitor end includ monitor state target figur report time explor collect monitor indic snmp depend number host target domain snmp agent filter monitor data collect polici ma resourc experienc snmp agent oper significantli reduc size indic collect explor respect size raw mib valu optim imposs tradit approach fix central manag remot interrog snmp agent involv graph ma technolog suitabl target domain includ interconnect low bandwidth link ethernet lan host connect modem explor slow link migrat lan solut link snmp request snmp central manag locat time explor snmp explor agent snmp explor agent snmp target domain figur explor snmp monitor agent target domain relat work monitor control agent oper execut close relat enlarg accept ma open issu ma platform ma program environ provid mechan control account agent resourc consumpt modif standard jvm research activ exploit mobil agent suitabl implement technolog monitor manag distribut recent research experi demonstr ma flexibl effect decentr autom control distribut servic compon introduct ma java implement web servic recent chang perspect monitor research work accomplish year distribut instrument system achiev interest limit monitor requir instrument sourc code binari monitor tend suitabl monitor mobil agent servic consist distribut heterogen compon suspend execut effort specif address monitor concentr produc effect tool gener exploit mechan specif oper system solut suitabl open heterogen distribut environ internet area network monitor research standard protocol interrog state network equip protocol simplic approach start provid network traffic monitor granular network segment monitor exploit librari command unix enabl network packet filter analysi host goal dynam observ network provis onlin monitor servic compon applic level regard activ simpli address enhanc standard snmp solut web access start exploit java network facil code mobil provid integr middlewar distribut monitor due novelti exampl java monitor tool base exploit sun profil agent perform analysi collect monitor data obtain view debug java applic implement profil agent profil larg set function present result data analysi tabl diagram organ xml lesson learn direct futur work result monitor control resourc consumpt agent feasibl necess enabl dynam tune monitor overhead adjust sampl frequenc set collect data normal work test monitor agent neglig overhead sampl frequenc hz notwithstand encourag result work achiev complet flexibl control agent resourc consumpt improv perform local compon adopt filter strategi maintain monitor indic work adopt ponder polici specif languag express oblig permiss polici agent polici permit control threshold depend runtim state manag distribut trigger automat manag oper control condit extend distribut monitor control agent permit account bill regist user effect resourc usag agent account bill exploit larg set monitor inform provid compon requir evalu process monitor data suggest differenti strategi data possibl overhead reduct acknowledg investig support italian della ricerca framework project infrastructur qo web multimedia servic heterogen refer vigna mobil agent lectur note comput vol springer agent integr electron commerc inform vol sun microsystem java virtual machin profil interfac essenti java nativ prentic addison network manag java ieee vol jan mobil secur open program ieic transact vol integr manag environ network resourc ieee journal select area vol mobil agent technolog intellig bulk manag data network oper manag symposium apr snmp agent middlewar mobil ieee vol mar manag agent polici great jan open secur mobil agent framework system journal network system vol mar resourc mar technolog unix system administr prentic sep wang mobil agent network oper manag symposium apr von resourc account interfac acm conf orient languag applic overview nomad mobil agent ecoop workshop mobil object design implement distribut measur ieee transact parallel distribut vol dec portabl flexibl distribut instrument softwar practic vol dec ieee vol june monitor steer parallel concurr practic vol sep traffic measur ieee vol perform analysi base
DB/393 3 branch path express jason jennif widom stanford abstract path express form basi queri languag semistructur data data queri optim problem path express relat express common nontrivi queri xml data search entir space queri plan branch path express gener introduc heurist algorithm gener queri plan branch path express algorithm implement lore system report result varieti queri shape compar optim execut time suit algorithm small queri compar optim plan produc exhaust search plan space introduct work semistructur data recent data manag xml data model queri languag path express data path form core queri languag lorel xql struql unql data encod xml simpl nest structur tag special attribut refer xml data set document refer db subel path express identifi author book identifi book titl common queri languag mention branch path path express begin singl sequenc nest multipl subgraph explor initi explor simpl queri author book titl branch path express lorel write select grep branch path express queri note linear path exampl special case branch path express queri optim problem branch path express consist find good queri evalu plan branch path reason amount time true system xml lore multipl wai access data multipl wai subel relationship element refer situat exhaust search entir plan space branch path express impract avoid effect reduc search space relat queri work support nation scienc foundat grant optim sac optim linear path express objectori heurist good idea branch path express branch natur path express opportun heurist base queri structur major contribut paper present algorithm effect reduc search space queri plan branch path express wai extent transform appli queri plan move entir branch path express individu compon advantag posit plan algorithm implement lore system complet dbm xml present experi show strength weak experi compar optim execut time small queri compar time optim plan produc exhaust search plan space statist cost formula kei estim cost queri plan introduc special statist optim path express creat desir statist prohibit larg data cycl describ subset statist estim inform provid complet statist problem optim branch path express obviou ti join access join method select problem relat system explor connect detail section compar result relat work semistructur work present appli relat implement algorithm easili adapt semistructur xml queri languag mention earlier rest paper organ section survei relat work preliminari definit set work section section describ desir statist optim path show subset statist full set creat section describ algorithm gener queri plan branch path specifi section report conclud section ent relat work path express optim resembl access method join optim problem relat view path express compon dot oper variabl join vast bodi research relat model appli reason chose simpli adapt previou work relat model problem optim branch path express semistructur xml relat work optim join regard access join set tight coupl evalu order access order preclud access access method preclud order detail section data access method typic cheap support storag lore support pointer special index access method typic support relat system similar join consid relat join order optim algorithm path express optim benefit path statist support relat system section relat work specif queri linear star branch queri branch path express semistructur xml queri languag arbitrari tree shape addit explor gener tactic plan gener relat optim consid major style plan space exhaust sac search iter improv simul random search space larger space consid relat optim problem natur structur suit reduc plan space manner find optim plan space forc categor approach aggress prune gener idea underli algorithm transfer relat set interest qualiti plan gener algorithm contrast gener relat work semistructur closest work consid optim restrict form branch path express approach handl set linear path express linear path start relat branch queri compar exhaust search heurist search context system search branch treat unit plan work extend work wider rang path queri optim strategi work optim consid path express optim linear path express heurist compon path express bound classic search strategi assign remain access join method dynam program algorithm optim linear path express time number class queri class consid perform result report heurist suggest paper effect branch path heurist limit search space consid gener path context semistructur label wildcard regular express oper gener path express optim studi describ queri rewrit techniqu transform gener path express simpler form prior optim algebra optim framework specif avoid exponenti presenc closur titl keyword book db author keyword lastnam person figur tini xml document graph view data firstnam citi address state oper techniqu complementari work incorpor algorithm queri optim unql semistructur queri languag accomplish translat unql formal basi optim rewrit rule push select search plan space perform queri optim struql discuss classic optim search strategi adopt lore initi queri optim discuss branch path express handl algorithm present paper preliminari adopt data queri access method support lore system framework motiv paper lore manag system design specif store queri xml data lore origin data oem object exchang model recent migrat extend lore data model queri languag conform xml standard clariti issu surround xml suffic assum path express navig kind relationship work optim branch path express appli easili semistructur data model queri languag xql potenti relat dbmss discuss section ground illustr tini portion simpl xml encod shown left side figur graph side recal path express form basi queri languag data includ lore queri lorel defin path express formal list path express step specifi singl step form sourc variabl label variabl view semistructur xml wai translat xml document wai encod illustr graph xml detail import gener result present interest reader refer path express individu branch figur branch path express rang subobject object assign path express list step sourc variabl destin variabl earlier step sourc variabl identifi distinguish entri point variabl sourc variabl step variabl destin variabl step ti branch path express sourc variabl path express find author titl book reachabl present algorithm produc queri evalu plan branch path express list path express provid input output optim plan search space algorithm algorithm list arbitrarili complex branch path express situat isol individu construct individu branch set list step creat step singl list list step found list specifi linear step destin variabl sourc variabl step list sourc variabl step step sourc variabl start list combin list violat easi construct time linear length ti branch graphic depict figur note branch path express strictli tree paper path gener repeat destin lorel equat variabl make assumpt access method support underli system order attack path express optim problem access method path express step assign access method physic oper queri provid object bind variabl step paper access method step extent scan es access method label input return yi object pair edg object object es access method support forward scan fs access object label input return object reachabl edg label note bound access method execut fs access method support physic storag layer backward scan bs object label input return object parent edg label note bound access method execut bs access method support lore support addit access path index index text index support lore dataguid specif lore feasibl gener work present paper similar es access index exist predic user queri minor extens incorpor access method algorithm present paper join method path express step connect share oper similar join perform simpl linear path express es access method perform join share variabl fs access method kind join requir pass bind step step paper join join join case explicit join pass bound variabl left recal path express begin identifi entri point correspond uniqu object lore treat path express step implement detail remaind paper assum effect variabl singl match object variabl plan branch path order access join method total number plan access method join creat bushi plan type search space access method work permut found exhaust plan space result plan valid ai plan invalid fs access method requir bound plan violat bound variabl restrict invalid oper support pass bind variabl es method fs method elimin invalid size exhaust plan space prohibit larg statist queri optim reli statist cost formula estim predict run plan consid cost formula implement formula lore physic oper intermedi result size kei gener factor depend statist gather data section briefli discuss statist result size estim optim branch path express tradit relat statist estim predic estim number tupl relat produc join relat statist complic class hierarchi statist long sequenc join embodi path express optim path express accur estim number path lore set threshold gather statist label sequenc length explor algorithm effici comput present algorithm scope paper larg cost produc statist cyclic data clear exist cost comput time storag space larger accuraci statist statist label sequenc length total number instanc sequenc denot jpj total number distinct object reachabl denot jpj label total number subobject object reachabl denot jp lj label total number incom edg instanc denot jp evalu linear path express ab bi bind estim averag number bind bind estim averag number parent bind call estim linear path express label comput statist jpj jpj statist accur estim result size linear path express length store statist linear path length statist includ inform incom outgo edg give inform linear path length statist linear path length estim statist combin statist progress smaller path reach path size path express length combin statist overlap path length path express step path express step remov combin statist path formula jpj jp jp path express step common note time gather statist branch path extrem gener threshold combin statist individu branch standard formula similar procedur foreach order foreach assign access method step foreach assign join method adjac step build actual plan return figur pseudocod exhaust algorithm plan select algorithm assum queri plan plan order assign access method assign join method connect access method exhaust algorithm search entir estim cost return predic optim plan section present addit algorithm heurist reduc search space varieti wai run time algorithm domin size plan space search present algorithm roughli order run amount plan space explor search space prune wai search space algorithm subset search space previou algorithm present appli plan gener focu effect appli algorithm algorithm gener plan search plan space altern plan shape except algorithm swap left subplan algorithm search small amount plan produc bushi plan algorithm design plan space explor inspir observ queri pose lore system wai reduc search space wai combin algorithm algorithm present interest repres confirm experi present section algorithm exhaust measur compar plan produc exhaust search plan space recal total number plan consid exhaust algorithm access join method plan valid violat constraint select access join method step order shown algorithm check valid plan consid figur recal algorithm input branch path express express list step algorithm motiv algorithm continu gener step reduc number access method permut algorithm consid step order combin join assign access method greedili order join method procedur creat structur track bound initi empti bind return procedur bind singl step access method intl return modifi bind creat plan order optim bind modifi bind modifi bind creat plan order optim bind plan modifi bind plan modifi bind plan return return figur pseudocod exponenti algorithm permut approach replac term exhaust search result plan algorithm access method perform singl scan assign access method bind variabl pseudocod obtain replac line figur procedur perform linear scan track bound variabl assign access method portion plan space prune run time prohibit larg due term local optim access method global optim cost singl step isol lower es fs bs fs bs situat es rest plan lower cost fs bs access method algorithm exponenti algorithm reduc term subset step order algorithm gener step order swap order step input list approach reduc step order term figur show search space reduc procedur accept list step list variabl bound plan produc plan step optim join access method step access method step join select plan remaind kei construct subplan bound variabl structur track variabl bound strong influenc select access method step reduc number order algorithm reduc permut join access method consid make local optim respect set bound variabl note plan chosen plan construct algorithm similar spirit origin lore optim full techniqu appli entir lore languag procedur bind cost find step access method foreach bind plan modifi bind cost remov chosen step add bind add chosen step final plan join method return figur pseudocod polynomi algorithm note algorithm order step input list section specif address issu algorithm polynomi algorithm reduc plan space aggress algorithm combin step access join method select oper shown figur make greedi step access join method chosen iter loop loop find cheapest access method remain base current bound variabl step cost ad variabl mark step remov step cost access method es lastnam iter bound point bs author join method variabl select greedi approach produc plan situat author phone number optim plan includ es bs polynomi algorithm plan bs chosen es bound variabl es cheapest point iter algorithm es access method requir bound es evalu path express fs bs access method bind remain step heurist algorithm identifi step make good es start point defer moment definit start point mechan procedur connect adjac pair fs bs method foreach adjac pair assign fs remain step foreach plan temp return figur pseudocod algorithm es start make simpl pair start point complet complet plan pseudocod algorithm figur start point select chosen step copi set loop figur consid adjac pair start point consid adjac sequenc step lead destin variabl sourc variabl step start gener assign fs step connect assign bs connect step join method subplan lower cost ad final plan note step share multipl connect path access method select remain step assign fs access method sort order extent respect bound variabl restrict kei success algorithm identifi step make good es start point shown figur recal figur procedur step sort size extent procedur select step start point increment ratio size kth extent threshold accept kth step good start point long size previou extent isnt larg denot size kth extent procedur complic detail initi defin special threshold case extent grow steadi rate ratio determin step assign es access method set absolut maximum start point extent size base recal variabl singl object automat assign start actual lore implement isnt es method find object handl special manner note algorithm start path express begin good set es start point crucial note constant figur ratio cutoff requir procedur boolean nontrivi initi ratio total cutoff copi step result return figur algorithm set obtain current set result good perform wide varieti shape queri complex algorithm log section perform time algorithm branch algorithm optim branch isol optim subplan branch combin final plan order subplan cheapest join method subplan pseudocod shown figur identifi individu branch section chosen polynomi algorithm section optim individu algorithm note concern branch reli bind pass branch optim separ disadvantag approach es access es subplan branch algorithm simpl comparison simpl log algorithm search tini fraction plan space shown figur sort step size join order singl pass sort list assign access join greedi base current bound variabl introduc transform complet plan plan lower cost move access method advantag posit reassign join method divid pair base granular oper branch entir subplan correspond complet branch origin path express step move individu access method procedur subplan branch optim algorithm foreach sort arrai subplan base cost join subplan return figur pseudocod branch algorithm procedur bind assign access join method singl scan foreach modifi bind return figur pseudocod simpl algorithm branch assum set branch section size number branch note access method step branch adjac plan start collect access method branch place plan long bound variabl restrict met bound variabl restrict reorder consid simpl greedi run reorder branch plan heurist estim cost subplan branch append final plan cheapest subplan reli branch final plan procedur repeat branch final plan construct cost reorder branch small comparison number reorder invalid subplan branch depend branch execut step branch wai search addit plan space analog oper step time repeatedli find step smallest cost reli step final append access method step final plan process cost estim remain step analog oper step valid reorder step consid gener add addit run access method assign number valid reorder limit evalu effect appli plan gener algorithm algorithm exponenti benefit greatli qualiti initi plan produc sensit order step input algorithm combin step order access method select singl provid reorder step decid access method perform result implement algorithm present section lore perform varieti experi data path express vari shape report time requir construct queri plan queri execut time set experi section summari result algorithm provid section examin specif result detail section section focu improv produc appli plan produc algorithm section compar result optim plan gener exhaust search set inform store rent sell compani peopl work compani particip make movi movi movi subobject peopl act locat movi store movi rent store object subobject store locat compani store compani compani dont store assum relat movi industri compani subobject peopl work compani person person includ thing dislik shape data import highli uniqu entri point db small distinguish categori data movi reachabl compani reachabl data fan rapidli thousand hundr thousand data wider narrow depend path data narrow store rent movi note number huge data narrow store data fan explor path experi pattern commonli nest data pname fname alik figur sampl set branch path express algorithm execut time rank total time rank tabl result experi conduct lore intel pentium ii mhz machin run linux size buffer size set page size result ran algorithm exhaust includ algorithm augment sampl set branch path express shown figur rank algorithm base time execut chosen total time select execut plan ad rank algorithm treat queri equal import result shown tabl algorithm algorithm tabl perform term plan execut speed rank algorithm algorithm rank total includ time requir optim note algorithm rank eleventh total algorithm exponenti explor fairli larg portion search result report section experi algorithm creat fastest instanc rank top strength consist select good plan reason amount time plan produc algorithm branch simpl perform shown column tabl algorithm produc good plan small number result inconsist situat algorithm perform depend complex interact queri shape detail statist data interest result tabl poor perform algorithm exponenti recal section algorithm reduc step order consid similar lore optim strategi full lorel languag high time algorithm expect optim time prohibit larg rank algorithm optim time execut time total time tabl experi simpl branch path slow plan produc algorithm unexpect appar make local access method step order ignor global situat note anomali result tabl execut time algorithm report explor strictli larger plan space expect produc strictli plan attribut slight inconsist imperfect statist cost cost accur gener shown detail result section detail experi section algorithm experi simpl branch path experi vi express similar shown figur averag actor act movi store carri movi benefici plan evalu branch intermedi result tabl show total time rank total time algorithm branch gener plan quickli plan es final es actor complet plan plan perform case data discov branch independ contribut final result optim branch independ irrelev portion explor algorithm simpl poorli select es bs movi fs plan verifi object subobject work backward algorithm produc plan subsequ result plan averag slightli deviat execut time experi branch experi ti person singl roughli half peopl thing peopl phone number result experi shown tabl rank algorithm optim time execut time total time tabl experi branch rank algorithm optim time execut time total time tabl experi longer branch algorithm happen contrast experi worst execut time chose es aren fs immedi narrow search peopl phone number algorithm find plan reason algorithm phone start point section chosen start plan experi longer branch experi peopl situat treat branch unit result poor plan result shown tabl algorithm produc good plan plan produc algorithm shown es narrow search peopl bother actual thing interleav execut branch plan result good execut time poor made algorithm plan algorithm poorli requir branch execut experi weak es fourth experi illustr weak inher es access method es oper join competit multipl fs oper major drawback es consid entir extent label ci fetch locat locat movi film contrast fs rank algorithm optim time execut time total time tabl experi weak es optim time execut time total time tabl algorithm experi bind store number store comparison number locat small tabl present result experi plan situat fs access algorithm algorithm gener plan algorithm optim branch forc es notic queri shape similar experi algorithm produc optim shape distribut data access improv queri execut time optim time section good perform plan produc algorithm net effect win recal oper step granular doesn appli heurist search add optim time queri execut time averag rang faster chang faster benefit depend queri expect impact plan produc algorithm experi section result shown tabl algorithm poorli appli plan order magnitud faster queri perform longer optim time evid total time found produc tangibl improv reason cost comparison exhaust search implement exhaust search strategi section order compar true lowest cost plan plan chosen algorithm exhaust search algorithm averag time optim tabl summari averag time optim limit path express fewer express slow optim algorithm produc plan competit optim plan ran repres experi calcul slower plan compar plan select exhaust algorithm tabl show averag multipl queri execut time experi compar optim plan consid extrem point simpl linear path express algorithm algorithm algorithm produc plan exhaust algorithm produc plan time slower worst algorithm gener plan exhaust plan time slower algorithm produc plan time slower tabl algorithm produc competit plan small fraction optim time futur work investig queri optim problem branch path express semistructur xml queri languag introduc algorithm reduc larg search space plan varieti transform complet plan optim time implement algorithm lore confirm strength weak found result obtain algorithm gener plan log time consid wide varieti algorithm base initi result report plan investig addit algorithm combin techniqu compar algorithm tradit search dynam program search simul anneal iter algorithm design branch path express work fold techniqu complet optim lorel queri refer abiteboul queri semistructur data intern confer page januari wiener lorel queri languag semistructur data journal digit april suciu queri languag optim techniqu unstructur data acm sigmod intern confer manag page june extens markup languag februari recommend buneman semistructur data sixth acm symposium principl page tutori moerkott evalu queri gener path express acm sigmod intern confer manag page june yu index select scheme nest object hierarchi twentieth intern confer larg data page septemb suciu queri languag xml intern web suciu catch boat experi manag system acm sigmod intern confer manag page june suciu queri languag manag system sigmod septemb suciu queri optim algorithm semistructur data technic june fernandez suciu optim regular path express graph schema fourteenth intern confer data page februari tang select path express process algorithm intern confer larg data page kersten random select twentieth intern confer larg data page septemb widom semistructur data migrat lore data model queri languag intern workshop web june goldman widom enabl queri formul optim semistructur intern confer larg data page august ioannidi kang random algorithm optim larg join queri acm sigmod intern confer manag page atlant widom manag system semistructur data sigmod septemb mchugh widom path lore workshop queri process semistructur data data januari mchugh widom queri optim semistructur data technic stanford septemb extend version mchugh widom queri optim xml intern confer larg data septemb rajaraman index semistructur data technic stanford heurist approach optim path express intern confer expert system page unit septemb ono lohman measur complex join queri optim sixteenth intern confer larg data page august kersten complex join intern confer larg data page august widom object exchang heterogen inform sourc eleventh intern confer data page march ramaswami kanellaki oodb index acm mod intern confer manag page san xml queri languag ql queri languag decemb paper onlin price access path select relat manag system acm sigmod intern confer manag page june yu queri optim system intern confer expert system page august effici index structur object orient twentieth intern confer larg data page septemb swami optim larg join combin heurist combinatori techniqu acm sigmod intern confer manag page xie han join index hierarchi support effici navig twentieth intern confer larg data page septemb
HCI/394 4 work note ai dialogu pedagog content knowledg tutori dialogu system support vincent oct av nger um mp ter te car mello cm er cmu ed engag research project creat tutori dialogu system student learn current prototyp analyz gener explan state recogn type omiss provid feedback approach architectur tradeoff equip system sophist compon dialogu manag simpl system perform accuraci preliminari evalu studi approach dialogu manag dialogu system classifi student input respect hierarchi explan categori repres common wai state complet incomplet explan geometri rule system feedback base classif extens desir order make dialogu robust introduct effect metacognit strategi explain exampl step student learn greater understand student good prompt leverag improv learn actual ai educ literatur evid support effect tutor al system interact natur languag plausibl student learn explain word natur languag flexibl express partial student show tutor construct complet knowledg articul forc attent relev featur combin visual verbal learn mode creat memori facilit recal potenti advantag fulli obtain tutor give feedback student student work tutor version prompt explain step check prompt provid good explan prepar test hypothesi student learn explain word receiv feedback explan end develop tutori dialogu geometri explan assist student gener gener explan step word system engag student restrict form dialogu improv explan suffici work prototyp start phase pilot test geometri explan fig ur geo metr exp lan tutor tutor built top exist system geometri problem geometri tutor school pittsburgh area design architectur face number choic find phrase call biggest bang architectur equip system fairli sophist compon detail understand explan system provid detail feedback dialogu plan manag compon simpl simpler follow approach develop ms algebra symbol focu identifi pedagog content knowledg student produc accur complet explan pedagog content knowledg strategi experienc human tutor student deal common difficulti scaffold effort pedagog content knowledg includ knowledg typic error pathwai learn success tutor student gener accur geometri explan knowledg provid good detail comment student improv explan incomplet lead student good explan difficulti start analysi small corpora student explan student explan geometri tend incomplet wrong system hierarchi explan categori repres common wai state full partial explan geometri rule decid feedback give student explan primarili classifi hierarchi difficult limit current easi predict improv give greatest bang extend plan guid result frequent preliminari evalu pilot ad sophist mechan strategi data suggest improv learn describ current architectur geometri explan tutor illustr current capabl mean dialogu exampl present result figur architectur geometri explan tutor preliminari evalu accuraci compon discuss limit address pedagog content knowledg add push dialogu manag architectur geometri explan tutor geometri explan tutor cover unit make curriculum origin geometri unit deal geometr properti angl geometri explan tutor cognit tutor monitor student work problem assist form feedback hint unlik cognit geometri explan tutor requir student explain step engag student restrict form dialogu order student state geometri rule accur system colleagu staff student system architectur geometri explan tutor base standard cognit tutor architectur augment compon figur dialogu compon creat semant explan classifi respect hierarchi explan categori cognit tutor modul check explan geometri rule decid react feedback give import knowledg sourc hierarchi explan constitut pedagog content knowledg explan categori hierarchi repres wai state geometri rule frequent occur wai state rule incorrectli excerpt hierarchi shown figur node repres class explan vastli surfac form canon sentenc fall categori shown node explan figur excerpt explan repres knowledg base categori bottom hierarchi repres correct complet wai state triangl rule explan categori higher hierarchi repres progress incomplet wai state rule hierarchi includ inform respond student explan attach categori feedback messag explan student classifi categori identifi explan relat geometri rule make angl unit kei point categori driven observ real student corpora student explan rich network captur categori occur frequent learner progress success hierarchi implement loom knowledg base knowledg base ontolog consist geometri object angl relat ontolog cover materi angl unit tutor curriculum knowledg base definit concept relat compon student input approach emploi activ chart parser combin featur structur unifi develop grammar rule parser unifi build featur structur encod syntax sentenc direct loom build semant loom classifi test coher semant respect semant constraint express domain ontolog coher semant loom classifi respect explan categori cognit tutor modul decid respond student tutor determin geometri rule student explain rule justifi current step tutor determin set applic geometri rule run cognit model geometri problem solv model captur typic desir knowledg geometri repres form product rule tutor select feedback messag student explan complet statement relev geometri tutor accept explan explan partial tutor select feedback messag feedback messag categori explan classifi explan geometri tutor tabl dialogu geometri explan tutor shown left success attempt explain geometri rule show ad previou shown explan categori tutor classifi explan ng ru ent il eo tu ou exp lan ad ur ty pe som eth state en ra eo rule en es pro ang le ng ou le ay con base le con ru en er ou le ay con base ell ang le ev ry le ng base le iso le con en cc ep te correct stu dent al po ack con ba ng le con ba ng le con ba ng tri con ba ng tri student state rule explan wrong geometri tutor inform student fact begun experi integr statist naïv text classifi ch compon fail produc statist classifi determin explan correct geometri tutor print feedback messag student track deal unexpect illustr wai leverag statist text classifi dialogu geometri explan tutor geometri explan capabl illustr dialogu shown tabl dialogu adapt protocol collect session colleagu staff work system order make dialog reflect current replac gener current system version downsid dialogu realist tutor student explain triangl base angl triangl congruent start minimum effort explan test humor student increment refin explan explan accept tutor tutor produc pedagog content captur explan hierarchi categori repres correct complet statement triangl rule figur bottom student explan categori thumb provid triangl rule justifi step explain step categori repres statement tabl dialogu geometri explan tutor hat ou wh en ad le ou hat hat ap ou le sum ru le ut tu ak sm chang es sum lo ou av idea ou state geo rule sum eri clo se sum eq ot le bu add le hat od ut specif ang le add eri su ang le wh deg ang le le ad cc ep te correct stu dent al po ack base angl triangl incomplet level statement tutor gener feedback messag suggest statement provid rule explain triangl rule feedback messag categori dialogu smooth prefer avoid tutor tutor shown step instanc tutor repeat subsequ dialogu circumst dialogu tabl student start explan attempt complet simpli ad sentenc read add interior angl tutor feedback make clear minimalist strategi step student quickli track gradual improv explan complet step except tutor feedback reason tutor produc messag step compon handl construct add illustr statist text classifi enabl tutor produc feedback messag compon step answer classifi explan categori compon statist classifi return categori enabl tutor acknowledg step student track triangl sum statist tutor tutor understand il tri ng ng ng tri tabl classif accuraci compon classif result classifi correctli explan complet explan incomplet explan refer classifi overli gener categori explan complet explan incomplet classifi incorrectli classifi total dialogu illustr tutor accept common form abbrevi student make student angl strictli speak measur angl form phenomenon refer concept mean relat concept prime york gui girl citi call tutor accept common form complaint tutor respond sentenc angl add student measur interior angl add sentenc linear pair treat student measur angl linear pair tutor accommod accept abbrevi ellipt express tutor goal student learn insist level languag tutor interpret sum mean sum measur angl triangl argu meant tutor assum sum impli challeng deal construct semant observ semant constraint input sentenc form dealt system compon recov miss structur semant construct built sentenc occur abbrevi abbrevi tutor handl differ semant construct reflect tutor notic sentenc triangl sum compon build semant includ angl tutor option insist complet explan level system insist easi determin choic ultim driven student learn preliminari evalu compon conduct preliminari evalu classif accuraci compon test data corpu explan collect session colleagu staff work system explan label hand author assign explan specif categori explan hierarchi belong categori invent total categori repres data set knowledg base extend includ definit categori system run classifi explan tabl dialogu geometri explan tutor tw ang le iso le al thing ree ang le iso con tw con le eq thing ree ang le iso con tw con le eq al ou le ay con le le eq cc ep te correct stu dent al po ack con ng tri con ng tri con ba ng le con ba ng tri shown tabl system classifi explan correctli correctli classifi fall categori full partial explan rest mean student state geometri rule system classifi explan categori strictli wrong remain explan classifi categori unrel correct categori system classifi explan correct time accuraci score fact deal classif small differ categori rule except caveat accuraci result obtain data set develop system data set obtain subject advanc target popul work expect accuraci score data student target popul result provid preliminari indic choic geometri explan limit classifi react dialogu turn base classif explan attempt context account tutor respond type omiss explan produc coher illustr exampl limit approach system memori dialogu detect situat student stagnat regress respond adequ tutor engag strategi lead student direct line human tutor limit worth greatest impact illustr tutori strategi current domain discuss plan explor util current illustr form stagnat discuss tutor made respond manner contrast previou current dialogu tabl involv student ag student target popul student averag shown actual system skip part dialogu omit step dialogu spell tutor spell step student close correct explan angl triangl explan miss term step angl triangl design hint fact messag writer anticip student word explan fix simpli craft messag student add word explan improv previou explan attempt explan tautolog sign student fulli understand type tutor oblivi problem simpli repeat feedback messag gave spite fact messag unsatisfactori problem student concept base angl term context tutor realiz provid feedback time tutor angl triangl term messag tutor cut chase simpli student term explain term mean problem address current student quickli back happen easili student tutor student stuck order detect kind tutor histori list categori explan attempt classifi increasingli specif messag explan categori avoid system provid hint student click button messag sensit current state explan coordin feedback feedback interleav order achiev simpli sequenc messag feedback make student feedback messag messag tutor provid explan make real effort explan observ similar minimum effort tactic pattern student hint discourag tactic make tutor forthcom conflict maxim good tutor tutori strategi student explain categori pedagog content knowledg address tutor strategi lead student struggl produc explan exampl strategi bridg observ student provid provid explan geometri step restat arithmet numer answer justifi correct thing preval procedur replai suggest student struggl provid explan argu step mean term import term geometri term congruent reflect superfici repair shot dark student improv explan step tutor introduc term numer answer invit provid procedur knew procedur thing strategi ground explan task activ student complet successfulli strategi unlik strategi ms strategi illustr hypothet dialogu triangl sum theorem find subtract subtract angl number triangl triangl state gener rule triangl total tutori strategi occas assist student classroom studi tutor version provid feedback strategi natur effect geometri rule note strategi geometri explan tutor dialogu shown conform assumpt made current system utter student attempt provid complet explan dialogu shown requir form dialogu plan add facil effect tutori strategi human tutor improv learn wizard oz kind human tutor commun student comput interfac smart comput explor question counterexampl tutori strategi involv counterexampl student state angl addit measur angl form adjac angl equal sum measur rule difficult rule explain assum student explain angl addit rule start kind inform explan student tend provid frequenc student state geometri rule judici counterexampl lot state explan mathemat big angl equal sum small true diagram gener rule big angl small big sum small problem chang problem diagram bit draw move adjac angl draw big angl small big angl sum small small adjac adjac angl angl equal sum chang diagram time angl adjac worthwhil tutor show student ubiquit strategi mathemat reason clear kind extend dialogu carri context problemsolv distract solv geometri problem hand student engag activ focu explicitli creat state definit base exampl term defin guidelin nation council teacher mathemat includ kind mathemat argument import object current system capabl gener dialogu shown reason gener replai dialogu current system present counterexampl feedback messag modifi difficult recov student understand counterexampl difficult stick strategi counterexampl student illustr dialogu shown point clear import capabl question explor mean wizard oz studi involv project develop tutori dialogu system student learn main student learn geometri skill greater understand secondari student learn student learn basic math commun skill respect field cognit goal test hypothesi greater impact learn student explain structur comput menu develop strategi equip system sophist compon dialogu manag compon simpl effort develop compon detail analysi explan preliminari evalu studi show compon accur classifi student explan reason classif student explan work compon continu order improv perform pedagog content knowledg consist hierarchi explan repres common wai provid complet partial complet statement geometri rule system knowledg dialogu turn classifi explan select feedback messag approach enabl tutor respond type omiss explan produc effect dialogu extens order make dialogu robust tutor detect situat student stagnat improv explan receiv tutor feedback tutor student situat system dialogu histori multipl level feedback messag explan categori coordin hint messag feedback messag clear tutor engag tutori strategi procedur replai investig import follow methodolog exemplifi studi expert human tutor perform wizard oz studi build altern version tutor test lead greater student learn acknowledg research sponsor nsf grant center interdisciplinari research construct learn joint research center locat pittsburgh carnegi mellon refer tutori dialog support ad natur languag understand cognit tutor limit student student vanlehn springer verlag tutori dialog support rose build dialogu system tutori paper aaai fall symposium menlo aaai press cross tutor answer explan foster learn understand edit io cognit lesson learn journal learn metacognit approach journal learn student studi exampl learn solv problem cognit de elicit improv understand cognit vanlehn support comput framework coach intern journal artifici intellig studi effect verbal problem solv journal intellig tutor system miss build strateg tutor rose build dialogu system tutori paper aaai fall symposium menlo aaai press intellig tutor school big citi intern journal artifici intellig evolv technolog knowledg system sowa principl semant explor knowledg san morgan kaufmann machin learn curriculum evalu standard school mathemat nation council teacher mathemat council mental dual code approach oxford press understand geometri explan rose build dialogu system tutori paper aaai fall symposium menlo aaai press learn effect variabl elicit contemporari educ effici robust parser carnegi mellon
HCI/395 4 infrastructur comput steer virtual realiti environ luc henri bal german han jw mathemat comput scienc physic astronomi faculti vrije universiteit de boelelaan hv netherland abstract present system enabl scientist interact steer simul virtual realiti environ modif sourc code interact analysi simul run remot comput descript system gener commun layer control execut gather data runtim describ implement soccer diod laser molecular dynam introduct network high perform graphic open opportun complet type applic world scientif comput move manag interact program virtual realiti system commerci scientist visual data set produc simul program simul run remot supercomput wide virtual realiti environ provid tool control simul rise number research steer virtual realiti central issu design virtual environ scientif applic network virtual environ rapidli develop year numer toolkit specif distribut simul gener network function virtual realiti system skeleton vr applic system open requir substanti effort build applic relat research area control run refer comput steer defin interact control simul execut scientist control set paramet program react current result comput steer enhanc product scientist give problemsolv environ exist cse build applic requir modif sourc code unsuit sourc code unavail describ system call base scientist steer program virtual realiti system requir modif program enabl interact analysi simul run remot comput vr coupl simul virtual environ scientist model simul set graphic object object input paramet simul data produc system gener wrapper simul control execut remot comput supercomput cluster data produc simul pack comput host virtual environ proxi remot simul built receiv data gener simul proxi plug virtual realiti updat object scientist commun persist layer infrastructur infrastructur consist descript graphic interfac creat descript code virtual realiti environ visual control program directli domain space simul main contribut work steer system requir modif sourc vr framework scientist simul evalu steer system vr framework ibm cluster cave graphic real applic laser molecular dynam paper structur section survei relat research section introduc system small show facilit coupl simul virtual environ applic built infrastructur section present relat work work relat wide activ research area refer gener comput infrastructur system globu legion provid environ creat applic conceiv collabor virtual realiti larg data set discuss network virtual environ steer system interact collabor visual radic chang scientist comput system interact user interact program visual domain distribut collabor multipl user geograph locat interact share applic toolkit design provid network virtual environ provid function collabor graphic focuss virtual environ battl simul entiti simul soldier replic split area permit reduc commun di protocol conjunct multicast achiev scalabl toolkit support network model virtual world share object paradigm network medium set interconnect server object share world main goal build collabor design environ mr toolkit maintain share world distribut frequent udp packet updat world callback state updat propag data set dive focu network obtain virtual reliabl multicast spatial decomposit virtual world massiv environ region graphic support data stream focuss dynam extens network environ configur add function discov environ runtim system base perform replic updat scene graph remot user group commun approach structur consist global oper delet insert network function virtual realiti system skeleton vr applic call templat system open remain basic requir substanti effort build applic exist applic restrict interact visual process direct zoom advanc form refer comput user interact simul process system support steer typic provid interact requir user monitor chang applic program intern variabl address issu fine grain steer offer system focu complet execut simul set input examin simul produc result execut iter ship intermedi result output environ comput scienc integr framework steer studi larg applic domain medicin scientist construct simul connect set modul data flow paradigm modul compil function written fortran wrap interfac central modul schedul synchron system scientist modifi paramet trigger evalu connect modul visual modul provid present data system design build close suit studi exist applic graphic output visual steer applic programm design program specif program structur structur graph made block sourc code arc repres control program stop block user script execut data retriev modifi visual manag extern librari iri explor magellan requir user annot sourc code produc abstract view consist steer paramet output data object modifi provid breakpoint master program control steer program graphic interfac gener monitor steer command visual extern librari design studi parallel applic data distribut steer paramet declar steer command synchron appli task user connect applic collabor user lock steer paramet steer massiv parallel instanc comput fluid dynam requir paramet simul annot sourc code system extract transfer data applic remot server graphic interfac provid manag data gather cse exist applic program integr distribut steer environ applic annot input output connect server server act data manag compon compon subscrib output compon server manag data exchang synchron system data manag visual compon editor design graphic data direct steer simpl classic visual main environ function interact steer modifi sourc code design spirit goal build system combin power function comput steer virtual realiti combin control simul data exist oper system open gl perform cave lib globu descript file server object vr framework proxi simul code gener figur softwar layer consist code gener vr shown figur minim program control simul data user describ simul descript file file process gener proxi server simul wrap server object control execut server interfac method resum simul data gener simul automat propag proxi object object local copi remot simul reflect input valu command server manag incom data simul present vr framework simul descript model design descript languag user describ input paramet output data simul dedic interfac descript languag section present descript simul set input set output data graphic object present figur graphic interfac describ file start user give inform execut directori simul section feed simul input paramet input file system acquir output data instanc standard output file data manipul simul provid type type defin user basic type defin system project struct point float time simul bounc execut directori simul process file input init posit input int nb step output current posit graphic ball type sphere current posit color figur sampl descript file type combin basic type figur type matrix object input paramet dimens option input applic number input paramet input section output object similar output section graphic object object graphic output data produc simul user interact modifi steer visual simul object output type select code gener wrote code gener descript file gener code network shown part figur select function build network virtual environ wide vr commun base nexu commun librari callback method call loop idl start stop kei init file produc point read point steer command vr user proxi server simul figur result architectur paradigm site defin kei publish remot site subscrib kei automat receiv data callback function mechan small data larg data set polici support thread network protocol facil avatar model sgi perform librari code gener produc class server object proxi object object thread object defin set kei callback function input output kei defin transmit marshal code type gener system heterogen environ set kei creat control simul shutdown manipul proxi server entiti deal network issu figur present result architectur descript file figur show relat server object refer figur proxi object gener program basic endless loop wait remot method invoc proxi object vr framework present figur preliminari perform produc current prototyp latenc measur perform tcp udp protocol buffer rpc manner function data throughput test buffer charact data valu marshal tabl show latenc throughput node linux cluster tabl present data amsterdam internet udp tcp udp tcp latenc char doubl node da linux cluster udp tcp udp tcp latenc char doubl da linux cluster ibm figur perform measur vr framework human speech movement interact select measur oper start stop proxi object object object world simul output sound graphic figur vr framework code develop virtual realiti framework steer visual data produc simul built top perform librari exploit high perform sgi workstat top librari control vr devic tracker shown left part figur architectur figur focuss vr framework refer figur consist object simul repres object updat gener proxi object interact modul user send command proxi directli manipul object simul steer framework function applic section develop menu system control execut simul slider button modifi paramet valu interact modul user rotat translat object graphic part includ basic object transpar textur board textual inform specif detail discuss applic section figur show default virtual environ provid consist virtual laboratori manipul box data board present text inform figur laboratori applic evalu approach coupl simul implement applic interact diod laser molecular dynam illustr incorpor exist usabl ad user interact robocup figur interact robocup robocup standard problem intellig goal team cooper autonom agent plai soccer real robot simul player construct vr environ human cave geograph locat plai run robocup simul natur central role plai call soccer track state game player inform game player individu process request state inform server autonom comput behavior server enforc rule robocup ignor invalid command player robocup vr system unmodifi exist server softwar player commun server send soccer command command express simpl consist kick server discret time slot command player time slot execut kick command requir player close ball run system cluster comput cave program user game interact implement proxi inform commun exist visual data set configur file consist player posit ball posit success state visual system comput quantiti veloc player built virtual soccer player movement interpol stand run develop softwar track behavior human cave tracker connect view glass monitor posit human player insid cave tracker connect wand global movement soccer field tracker attach foot human player recogn kick convert tracker soccer command transmit server coupl cave locat amsterdam stockholm cave connect human particip game difficult problem realiz virtual robocup system latenc simul program human player move virtual soccer move happen instantan human soccer server requir time process chang posit connect substanti delai problem typic delai introduc simul program harm natur interact develop accur algorithm navig soccer interact gener command server implement system program commun tediou error prone commun automat gener case studi robocup show applic larg class system diod laser simul figur diod laser simul applic implement visual diod laser refer attractor numer simul perform semiconductor diod subject optic feedback due result dynam system infinit freedom explor investig larg data set call user paramet space simul run gener trajectori space space provid decid focu natur phase space physic point view output phase shown figur previou studi visual simul gave insight dynam behavior suffer sever lack interact link simul run ibm cave simul comput fix point phase space set paramet user interact set valu select paramet slider fix point serv start point simul point scientist directli select point start simul comput trajectori increment cave trajectori visual manipul scientist simul stop start paramet valu benefit easier previou approach studi sensit laser enhanc abil modifi paramet simul system requir modif simul deal easi code interact physicist test investig behavior diod laser gain insight complex system interact molecular dynam figur interact molecular dynam applic concern coupl molecular dynam simul virtual realiti system molecular model tool essenti design studi molecul steer molecular dynam user express extern forc system overcom energi search geometr configur dock problem studi focu numer simul visual describ advantag connect molecular dynam simul visual includ serial parallel design flexibl incorpor option control integr forc field restart capabl visual environ structur biologi wide plain dock structur refin trajectori analysi import featur coupl run simul studi trajectori molecul local forc appli graphic interfac haptic feedback tool author describ link molecular simul user express extern forc system overcom energi barrier state molecular dock simul program user virtual realiti environ interact genet algorithm run parallel comput search geometr configur vr scientist gain deeper understand complex conform modifi structur express forc virtual environ perfect match feasibl studi experi interact wrap molecular dynam simul visual vr environ current implement remot simul run da parallel cluster comput visual cave input paramet select molecul simul number time step temperatur correspond minim set paramet larg possibl implement interact paramet select paramet modifi start time output descript file produc intermedi result execut posit veloc read proxi process continu show dynam molecul classic molecul shown figur coupl md simul visual modifi sourc code made origin develop modifi softwar simpl manner quickli coupl virtual environ easili switch simul packag steer simul forc effici vr environ implement system scientist interact steer requir modif origin program enabl interact analysi simul run remot comput set graphic object fi scientist descript file object repres input paramet simul data produc system gener server control simul send data produc virtual environ data updat graphic manipul steer simul visual control program directli domain space simul run simul ibm cluster coupl cave vr system real applic laser molecular dynam studi lesson learn applic type applic easili implement easi maintain compar previou interact visual steer gain insight complex system system web site refer kaashoek perform evalu share object system acm transact comput feb carlsson dive platform virtual environ comput foster kesselman blueprint comput infrastructur morgan foster kesselman infrastructur toolkit intern journal supercomput applic high perform greenhalgh benford collabor virtual environ teleconferenc acm transact legion vision worldwid virtual comput commun jan visual molecular dynam journal molecular papadopoulo provid fault steer parallel applic int supercomput applic high perform visual applic steer environ page asada robocup synthet agent challeng intern joint confer artifici page herman visual steer molecular dynam protein design ieee comput scienc winter brown review applic cave research network ieee virtual page steven interact system virtual molecular dock ieee comput network softwar architectur virtual environ visual attractor comput van van lier survei comput steer environ futur gener comput parallel molecular dynam program intern journal supercomput applic high perform park effect network characterist human perform collabor virtual environ ieee virtual page johnson integr problem solv comput steer system hawaii intern confer system page jan tool visual interact steer parallel applic page sun decoupl simul virtual realiti mr toolkit acm transact inform juli ng softwar toolkit virtual world singhal zyda network virtual design implement man interact case studi robocup poster session ieee virtual realiti distribut virtual realiti framework ieee virtual page van van lier environ comput steer comput societi vetter high perform comput steer physic simul page zyda portabl system dynam environ ieee virtual realiti annual intern symposium
Agents/396 1 speech act dialogu agent david traum maryland william build colleg md usa introduct dialogu agent interact commun coher sequenc relat messag topic servic goal basic insight speech act commun transmit inform action chang state world mental state agent involv state context dialogu speech act theori agent theorist design place agent commun gener framework agent action commun action requir express logic action requir block familiar classic ai plan multipl possibl simultan action studi speech focu pragmat semant languag messag term model good introduct issu natur languag aspect pragmat import concern infer result perform speech act speech act work analyz interact natur speech act conveni level analysi artifici commun languag rule interpret act perform artifici languag concern vagu foundat ration pp ambigu rang action agent perform roughli fine simpler role speech act agent particip dialogu agent bulk paper review import work speech act implic dialogu agent section review foundat work speech act stem work philosophi languag section work artifici intellig aim provid comput account speech primarili account agent engag commun perform interpret act emphasi perform recognit singl utter section work expand speech act theori includ aspect dialogu section work agent commun languag formul term speech act concept languag make identif speech act issu languag speech act transpar relat surfac form section reconsid issu confront speech act light present work section begin sketch theori speech act present point extra element requir agenc foundat philosoph speech act work work speech act begin philosoph languag interest issu natur languag pragmat difficulti primari view mean sentenc pragmat concentr utter sentenc object gener concern aspect context product interpret austin austin observ utter descript state thing utter chang mental interact state particip speak speak speaker perform speech act multipl type action perform austin distinguish act act includ phonet act produc act produc word belong vocabulari construct conform act product act refer illocutionari act act perform answer give subsequ work speech act illocutionari act illocutionari act illocutionari specifi type action proposit content specifi detail action hearer request illocutionari act directli deduc act gener indirect speech act act perform expect composit account content austin bridg utter bid inform partner speaker diamond utter achiev multipl function case direct bid act indirect inform act perform action achiev effect special situat utter convent natur commun exampl includ speaker intend gener utter achiev austin spent effort utter creat result explicit perform utter result utter word accompani perform utter speech act verb dont convent form insult declar austin consid relat perform utter pragmat phenomena fact monoton entail ordinari logic austin classifi illocutionari act base primarili illocutionari basic give preliminari verdict nomin commiss commit speaker behav attitud social apolog exposit utter fit clarifi postul searl searl extend refin austin work illocutionari act observ austin decomposit speech act illocutionari forc proposit content show kind negat perform sentenc sentenc proposit illocutionari act content proposit content illocutionari act longer make searl proposit content act combin predic refer act stand perform concert illocutionari act import contribut attempt provid suffici condit perform illocutionari act present constitut rule rule defin game footbal sort normal condit concern condit intellig speak includ convent pai proposit content condit describ restrict content futur action preparatori condit involv constraint world make speech act sincer condit involv align speaker actual attitud attitud express act essenti condit involv speaker intent perform act searl add condit base grice notion mean effect act part produc hearer recognit utter intend produc effect mean recognit intent searl improv austin classif type illocutionari act mention austin classif fairli base similar illocutionari verb act searl point correspond illocutionari illocutionari verb languag describ act searl altern taxonomi base act searl present analysi dimens speech act outlin point act correspond essenti condit attempt hearer repres world commit point compon illocutionari forc forc includ notion strength dimens direct fit word world statement fit word world commit request fit state world word searl list differ construct shop list shopper fit world groceri word made observ indic fit word world ident list differ critic repair mistak case word world shopper bought chop observ simpli cross write list back store exchang repair error express psycholog state act express mental attitud part speaker assert express request express desir act dimens relat close searl sincer condit speaker nonetheless express perform speech act strength point relat attitud gener held vari strength tent firm command statu particip social relationship speaker plai role strength forc gener order privat suggest request differ relat searl preparatori condit interest distinguish threat searl separ condit relat desir speaker relat rest relat answer deduc distinguish statement proposit content aspect proposit content plai role illocutionari request involv futur statement past correspond searl proposit content close relat dimens speech act gener act thing perform speech perform speech act kind action exampl includ institut includ featur social institut languag individu posit institut marri peopl bid searl act institut claim obei rule languag make statement consid gener institut posit agent societi difficult searl mean rule syntact semant suffici perform notion languag produc undertaken commit perform illocutionari verb perform style perform distinguish announc confid searl produc consist speech act taxonomi searl categori commit speaker truth express involv hearer involv commit speaker convei psycholog state bring correspond world word searl speech act theori formal world unifi ai model speech act difficulti earli philosoph work speech act exist formal account action mental state design definit speech act definit difficult test observ stake actual commun episod rapid progress reason action give oper account speech term ai plan oper bruce account speech act theori term ai work action plan defin natur languag gener social social action defin term intent present social action paradigm show speech act combin form larger goal show act inform request achiev intent chang state belief perrault influenti ai work speech act date work toronto perrault cohen perrault tackl problem languag defin speech act plan oper affect belief speaker hearer set program set import goal work speech act write account speech act answer ffl circumst observ speaker sincer successfulli perform speech act produc utter ffl success perform speech act make speaker model hearer model ffl mean utter relat act perform utter suggest theori speech act base plan ffl plan formal languag describ state languag describ set plan construct specif legal plan structur semant formal languag ffl definit speech act oper plan system realiz cohen perrault model mental state consist type belief belief modal oper agent proposit believ follow hintikka augment belief structur includ quantifi proposit agent agent agent proposit agent true modal oper nest belief model goal agent perrault cohen make satisfi issu plan system modifi version strip maintain method deal frame assum chang world explicit mention effect oper describ type effect effect john john figur cohen perrault plan request hold action succe precondit proposit true oper applic precondit meant cover sincer condit order successfulli perform agent action model speech act request plan includ form question request inform relat request inform desir figur show slightli simplifi kind plan structur agent build decid issu desir action perform perform action ff realiz john desir perform john perform find perform action effect john perform ff assumpt cooper john realiz john assum direct effect request belief john perform ff perform request reli john ration process intend perform ff model wide rang applic cooper explain answer question ff perform speech allen perrault essenti formal cohen slightli investig role plan speaker hearer hearer hearer act speaker hearer figur allen speech act oper ferenc recognit cooper set show techniqu recogn agent plan import interpret utter recogn indirect speech act coher relev manner utter request inform train leav train bring level surfac speech roughli compar austin correspond surfac illocutionari act correspond speaker actual intent illocutionari act realiz surfac speech addit requir hearer recogn speaker intent plan system basic strip system precondit specif oper detail instanc illocutionari act surfac speech act logic provid account cooper hearer deduc speaker plan provid request provid step deduc detect obstacl speaker plan unknown provid work expand improv speech act oper figur allen perrault model nice handl role plan intent recognit recogn indirect speech relat role aspect surfac form linguist indirect speech act convent elegantli combin linguist inform yield hypothesi current utter linguist cue produc partial speech act plan infer rule possibl remain theori speech act perrault start point problem utter insuffici determin effect speech act effect utter action base part prior includ mental state utter formal condit hold tricki axiom state effect utter declar mood account possibl fail standard act perrault approach state effect term default logic common effect deriv defeat simpl axiomat intent normal default includ belief transfer rule agent believ agent believ agent declar state agent declar believ proposit content utter simpl schema perrault deriv expect consequ perform declar utter context formal simpl number difficulti foremost lack treatment belief speech act chang perrault framework handl case belief ad kind agent chang belief logic strang properti agent convinc prior belief make utter effect presenc logic lend comput induct proof scheme make deduct appelt konolig reformul perrault theori term hierarch autoepistem logic reformul advantag implement abil order default overcom problem perrault normal default lose simplic perrault framework hard appelt konolig describ point view ideal observ particip formul resort unintuit devic belief utter mcroi hirst uniform abduct approach product recognit speech aspect context identif surfac form approach reason mistak interpret process manner amen reason cancel presupposit dynam logic approach problem work base strip provid fine time chang research move logic action provid power clearer semant explicit base variant dynam logic cohen levesqu cohen levesqu attempt solv number problem relat formal speech detail logic action mental attitud lai framework basic theori ration action base dynam modal logic world semant give axiomat modal oper belief deriv intent persist agent commit bring realiz unachiev cohen levesqu logic show effect illocutionari act deriv gener principl ration cooper interact contrari commun act primit defin mean agent sincer give imper request claim recogn illocutionari forc utter import hearer speaker recogn act speaker perform part process claim illocutionari act descript model resourc agent conclud descript searl condit act deriv ration agent logic extend framework handl perform defin illocutionari act attempt perform request act request compon assert assert compon made true success action request perform requir success attempt success control lie paradox explicit mention defeat aim sadek sadek similar logic ration action basi semant speech act basic logic differ cohen levesqu world time sequenc time point sadek aim logic act ration action agent reason accomplish desir intent logic request figur sadek speech act oper plan act occur result simpl reason agent mental procedur ration agent architectur applic commun act implement basi dialogu manag compon ag spoken dialogu system sadek commun action formul term feasibl intend effect lead plan intend effect act actual effect perform goal action plan goal requir action satisfi act dialogu act simpl speech act sadek formal agent request agent perform action shown figur discuss approach cohen sadek great benefit clariti semant featur make difficult gener basi model speech act model belief attitud base model logic incorpor omnisci logic consequ accept suffici agent limit mean sadek incomplet forward chain reason handl import infer relat dialogu act plan adequ simpl kind interact ag system queri knowledg base potenti inform remain method power gener gener collabor problem solv difficulti notion time sequenc event rich model dialogu situat model action inherit feasibl condit request action switch mental state pg mean persist goal detail dynam logic sequenc event reli predic mean action thing happen preclud ad tempor overlap longer clean action serv transit world final difficulti base notion deriv adequ model rang speech act thing miss notion oblig commit main ingredi instanc cohen levesqu commit oper goal intent social commit extend speech act dialogu interest speech act pragmat analysi utter combin coher interact languag intertwin kind action engag dialogu aim speech act earli comput work interpret isol sentenc describ work extend analysi deal dialogu phenomena dialogu function action litman allen extend allen perrault work includ dialogu singl hierarchi plan singl plan describ type domain plan plan domain plan perform cooper clarif plan concern goal plan higher intent structur notion describ plan plan paramet litman allen account larger rang utter previou includ clarifi correct defici plan discuss carberri lambert make ad problem solv plan domain plan litman allen problem solv plan wai build actual domain achiev plan cohen levesqu extend work section theori joint intent action present analysi confirm dialogu theori joint intent develop state particip dialogu joint intent task complet part definit joint intent parti believ object intent achiev parti strive make belief mutual goal mutual belief drive agent commun confirm attempt comput literatur explicitli concern account gener notic lack respect mention intent make mutual believ turn intent perform confirm distanc logic actual utter explain count recogn multipl level interact research attempt model kind phenomena dialogu strata action realiz rang action phenomena includ limit action concentr speech act extend model includ multipl act set influenti earli classif analysi classroom dialogu modifi system rank smallest transact move speech act dialogu exchang set includ feedback unit transact subdialogu includ multipl exchang aim achiev task research line call exchang structur dialogu parallel idea gener distinct move act drop agent gener plan level execut move game path desir realiz tradit speech act insuffici model dialogu introduc level call contrast austin act act includ level repair mutual attent agent plan level collabor task traum introduc scheme incorpor featur approach base includ terminolog rank item rank built constitu lower phrase sentenc linguist cover type phenomena level act type sampl act uu uu ground cancel du core speech act eval multipl du argument clarifi convinc tabl traum act type level includ act coordin ground act coordin flow mutual tradit core speech argument handl coher level summar tabl differ dialogu act taxonomi tradit speech act requir particip agent perform ground full mutual belief establish oblig describ kind dialogu act dialogu act function updat dialogu context context divid includ linguist surround utter semant underli task physic locat particip interact space social type situat role particip plai respect includ cognit mental state particip type global local aspect roughli constant perform dialogu thing divid dialogu act act dialogu control act act affect linguist cognit semant dialogu control act affect social physic context consid act involv inform inform provid act consid wide rang class dialogu control act type feedback act consid percept interpret correspond ground act evalu includ accept dispatch fulfil commun express act type function function statement belief belief judgment question desir inform desir inform request desir tabl function commun act tion level give posit feedback level impli problem higher give neg feedback level impli success lower level class social oblig manag place reliev pressur parti rang interact manag includ act commun time contact structur function occur difficult principl cluster classif type contact manag function easili lowest level commun manag product speech necessarili close relat feedback varieti act introduc oblig written extens commun gener speech act cover action work similar manner reject distinct austin speech act reason directli utter form context function effect distinguish kind effect speech serv thing speaker previou state tend aim bring hearer world utter kind effect tabl show act main express function utter number sender receiv sender relat oblig gener sincer condit searl speech act theori agent send request agent oblig answer receiv provid receiv relat oblig similar section evalu utter report evalu consid type base basic hierarch commun function interlocutor continu interlocutor perceiv interlocutor understand reaction cover messag accept reject commun function restrict content main cover aspect speech manag commun interact commun manag speech act base agent commun languag speech abstract level utter chang interact good level descript describ agent commun natur languag research decid languag base speech act good agent commun languag difficult process speech act interpret agent directli identifi speech act perform part messag research studi pragmat aspect natur languag process method test system natur languag interpret scheme base speech act agent commun languag kqml recent agent commun languag knowledg queri manipul languag year research group interest heterogen agent commun flexibl manner requir agent commun languag kqml attempt meet underli agenc model agent manipul knowledg send queri answer broker servic provid main idea languag base austin perform messag receiv identifi state kind action paramet identifi aspect languag ontolog agent pass messag understand detail content languag kqml underspecifi term rang perform order kqml agent send receiv messag requir reserv mean design free add extra perform implement reserv set perform concern messag agent act intermediari messag kqml number group agent commun languag problem specif lack diverg perform step provid cover perform cohen levesqu point vagu perform broker miss includ commiss kqml flexibl agent avoid perform ad miss disappoint basic build block commun left speech act interfac languag collabor research advoc limit interfac base speech act commun gener reason comput mediat pass analysi updat design restrict flexibl commun interfac handl reason forc theori make cooper product discuss number issu attempt bypass languag interpret determin speech act type directli surfac featur agent explicitli signal speech act type note speech act theori explic connect form grammar content pragmat effect research trivial left relat agent commun form correl content limit languag reduc ambigu vagu arguabl cut thing indirect speech act effect form semant term direct agent agent form agent recogn convent interpret spring theori undoubtedli case human limit channel express commun social desir thing stop case artifici agent limit agent speech act theori reconsid number issu evalu view languag speech act theori view commun agent basic question speech act afford sort ontolog statu intermediari perform languag effect mental spite initi question util number fact small commonli set act circumscrib rang commun interact difficult issu utter singl utter introduc number kind chang introduc act bundl larg number act adopt approach hierarch orthogon singl utter perform multipl function simultan inform current state suggest futur action issu speech act view object thing occurr subject agent view perform relat question condit intent perform act requir act achiev distinguish attempt success perform act level speech act strictli agent plan commun easier agent plan recogn concret bundl function move directli utter featur context chang true agent ontolog discrimin action perform speech act action theori main block adequ formal speech act requir complex express logic action interact speech act particip requir logic gener action proce synchron action speech provid condit effect perform action requir sophist reason mental state agent sketch aspect act reason action speech act theori account includ extens classic plan ffl tempor includ reason overlap simultan action ffl attempt action fail achiev desir unexpect result follow ffl multipl individu mental state ffl cooper agent ffl reason ffl integr plan act larg amount research dedic address summar explor complex involv reason act richer environ annual european workshop model autonom agent world varieti approach problem social attitud kei featur speech act physic action main effect mental interact state state extern domain attitud intent familiar agenc chapter theori speech act social requir compon part behalf multipl agent big issu attitud basic primit individu attitud belief intent hold individu attitud deduc hold social treat mutual belief oblig composit definit execut joint plan mutual belief ground mutual belief commonli assum social attitud theori speech act plan main effect speech act addit mutual belief mutual belief prerequisit utter speech act mutual section review repres properti mutual belief term simpler acquir mutual belief belief varieti cluster relat includ discuss gener term author treat term synonym mean mutual mutual believ group agent necessarili true formul mutual belief peopl part intuit underli phenomenon mutual varieti wai model compar model theori formul call iter defin mutual knowledg agent proposit sa ks ka kak infinit conjunct nest belief approach adopt includ allen eleg default logic theori obtain belief prior knowledg set credit harman approach harman formul mutual knowledg group peopl mutual knowledg refer fact point approach strictli stronger iter includ inform common knowledg common knowledg replac infinit conjunct final approach discuss approach credit lewi lewi formul rule common knowledg common knowledg popul state affair hold reason hold reason hold schema clark appar belief space approach model belief space set proposit believ agent nest belief repres nest space space system belief space system belief user belief turn space system belief user belief system belief cohen adopt iter approach requir infin belief space space deeper deepest point parent creat nest nest nest belief iter approach gener present belief iter loop approach share featur approach quick determin mutual belief exist search unlik iter fact strong approach implic mutual belief mutual repres slight modif add separ kind mutual belief space repres mutual belief approach bruce newman rhetor knowledg system mutual belief disallow nest belief mutual belief give essenti power cohen system approach mutual belief controversi formal model mutual interest question mutual belief establish interact agent long imposs establish mutual knowledg environ messag transmiss fail formul speech act assum mutual belief perform utter share situat effect singl agent speech examin actual reveal process feedback accompani initi spoken gener sort acknowledg assumpt mutual belief made lack understand signal sort repair request repair case origin speaker receiv observ request acknowledg repetit origin contribut attempt elicit kind feedback assumpt mutual belief result directli singl utter simpli ideal model belief modal logic result properti logic unfortun consequ basi model speech act commun consequ reason make incorrect predict mental state agent unabl recogn relev necess perform feedback act establish mutual understand clark refer process reach mutual belief common ground present descript term present accept phase track augment common ground proce model agent involv requir examin subsequ span text order determin boundari phase develop comput account ground process account base speech act action repair materi tradit speech request requir particip parti full effect mutual belief speaker speaker introduc level dialogu structur call unit core speech act complet du built ground act recogn fact multipl type action occur extend speech act theori act ground core speech level model behavior higher order coher dialogu finit automaton track state sequenc ground act model predict subsequ act determin perform order ground du realiz effect constitu core speech oblig claim oblig model social situat includ natur languag captur effect speech request oblig repres agent set formal sourc oblig oblig action accept achiev request address accept reject utter understood incorrect repair utter initi du acknowledg du request repair repair request acknowledg acknowledg tabl traum allen sampl oblig rule aspect examin deontic logic oblig defin term modal oper call permiss action obligatori permiss action forbidden permiss action obligatori respect set rule agent perform action adopt model suggest agent behavior violat defin social law oblig mean rule broken assum agent gener plan action violat rule oblig action occur directli conflict agent person agent violat suffer consequ meet oblig reduc intent goal agent oblig action contrari goal child apolog hit younger oblig similar note author hierarch import abil forc oblig argu oblig plai import role account interact dialog tabl show oblig result perform speech act oblig replac model speech act augment result model readili account behavior adversari situat situat agent adopt goal oblig encod learn social guid agent behavior intent recognit share plan level complex intent recognit requir handl typic interact everydai process social situat oblig addit goal intent form agent pursu oblig goal import agent reason choic made explicit agent design agent illumin relationship process notion initi dialogu initi lead relat concept occur result speech commit fact true relat sincer condit postul searl agent make agent commit truth claim unlik oblig consid direct connect futur action agent oblig commit agent special prefer make true equal valid approach inform agent report fact longer assum question interest contrast kind commit intend futur state relat requir action agent believ state hold coordin share plan joint intent common social attitud joint intent share plan concept model collabor team act intuit collect individu intent belief coordin teamwork activ sort collect intent attitud formal account cooper fairli controversi properti attitud collect intent relat individu intent particip import question share intent guid individu individu belief intent form share section review attitud lewi defin convent situat regular behavior conform expect conform prefer conform typic side road drive england japan left america doesnt matter driver side drive long coordin activ individu intent state mutual knowledg norm knowledg convent serv make mutual member popul follow grosz sidner basic viewpoint extend pollack definit simpl plan formal set mutual belief execut action intent agent perform part action present default rule base cooper commun add share belief share plan formal develop searl start intuit collect intent summat individu intent distinguish convent actual cooper activ postul primit form reduc individu intent problem produc individu intent individu act cohen levesqu present term individu intent arent primit term mutual belief weak mutual goal formul individu goal perform action accomplish imposs event complet agent strive make belief mutual framework explain type commun behavior confirm develop similar agent execut plan extens notion execut plan group agent fa execut plan mp execut plan mp action action constraint constraint occurr action agent commit occurr action oblig agent perform action part plan formul differ work mention mutual belief stipul compon multiag plan execut mutual belief import adopt plan repair plan strictli kind teamwork person commit occurr action oblig person intent perform form glue bind collabor team agent break team time drop commit oblig remain agent motiv action action perform deem imposs notion mutual belief intent sharedplan formal commit inform agent action perform imposs joint intent hard agent adher commit person goal diverg defin speech act rich logic mental state action partial develop give definit speech import compon speech act essenti characterist isnt act import criteria recogn act perform speech act part defin characterist enabl condit aspect mental state commun observ access act bit dialogu perform kind act compon speech act plan agent plan speech act accomplish plan relat actual behavior realiz turn speech act type shown tabl act easili interv tempor interest period speaker speech event continu stop featur prosodi expect interpret act serv delimit individu turn simpl act difficult simpl dynam overlap interv agent speak consid theori core speech act ground full instruct ground act formul execut plan section formal model ground process earlier section agent involv task orient dialogu assum execut special abstract plan recip shown figur abstract recip call cr commun claim success execut special recip result mutual belief agent commun agent engag model execut plan special recip call plan recip special cr plan act present acknowledg content broken indetermin number conceptu granular present content ack content tempor constraint agent constraint object constraint content figur traum plan recip commun proposit constraint perform piec present occur achiev mutual belief constraint type execut present acknowledg content determin convent languag commun context part content express explicitli part composit convent mean present implicitli convent situat mean ground act formal specif execut relat plan compon execut addit definit situat logic action repair execut plan content ground action includ speech act type action content core speech act perform core speech act perform constraint content core speech act includ effect effect shown tabl commit meant social commit state individu commit actual effect interest gener reason reason believ commit truth definit argument act sequenc core speech constraint time content answer inform question act effect tabl sampl speech act effect plan speech act definit speech act captur part reason plan speech act utter matter exhaust list agent care direct extend effect spring perform act context agent perform act probabl produc effect desir act plan level plan argument act dialogu singl speech act interact natur gener plan advanc agent predict futur action accuraci pai plan utter react action manner move achiev agent goal kind argument negoti requir involv casual complet unplan utter recogn speech act agent combin featur input utter aspect current context mental state visual field set previou decid act perform big question recogn speech act recogn act intent motiv agent produc act case indirect speech easili separ question decid agent perform request decid agent intent perform action agent mistakenli perform carri effect intend intent realiz carri burden oblig social commit agent deduc intent deduc agent perform act lead behavior avoid trap competit question plan infer challeng util deep intent recognit claim action effect expect set futur combin facil repair erron recogn intent plan speaker plai role act fact crucial agent actual success rememb natur dialogu case promin interpret act perform interpret real time speaker easili access interpret difficulti understand act agent queri find meant ground process speech act good link mental state agent commun theori speech act strain contemporari theori ration requir express theori action mental good testb theori agenc world specif concern natur languag speech act interpret ambigu allevi restrict agent commun issu cooper system infer intent acknowledg author idea speech act report greatli aid jame jen harri peter elizabeth thomason author partial support write paper armi research offic number nation scienc foundat grant work develop collabor jame allen support grant number onr research grant number nsf grant number refer bruno marco behavior game pragmat dialogu cognit jame allen maintain knowledg tempor interv commun novemb jame allen recogn intent natur languag utter michael bradi robert comput model mit jame allen time plan kautz reason plan morgan jame allen georg ferguson action event interv tempor logic journal logic jame jame austin editor read plan morgan jame allen miller sequenc tutori technic report depart comput juli jame allen raymond perrault analyz intent utter artifici jen linguist commun action cooper phd depart jen oblig option dialogu jen activ base approach pragmat technic report gothenburg paper theoret jen elisabeth speech life speech technic report gothenburg paper theoret jen elisabeth semant pragmat linguist feedback journal intent basil dougla appelt kurt konolig nonmonoton logic reason speech act belief intern workshop page austin thing word harvard baker lund flexibl structur interact cscl environ european confer ai page jon situat chapter model theori common knowledg csli lectur number center studi languag sadek ration agent kernel cooper spoken dialogu implement logic theori interact intellig agent iii intern workshop agent languag lectur note artifici intellig bruce gener social action theoret issu natur languag page pp bruce deni newman interact plan cognit inform dialogu commun action relat partner model inform process mm structur multimod dialogu elsevi scienc publish harri context dialogu control harri interact manag function context requir twent workshop dialogu manag natur languag system page carberri plan recognit natur languag dialogu mit jean recoveri dialogu phd herbert clark arena languag chicago herbert clark manag problem speak speech herbert clark edward schaefer collabor contribut languag cognit herbert clark edward schaefer contribut cognit chapter phillip cohen plan speech act phd reproduc tr depart comput toronto phillip cohen hector levesqu perform ration base speech act theori page phillip cohen hector levesqu commit intent commun mit phillip cohen hector levesqu ration interact basi commun intent commun mit phillip cohen hector levesqu confirm joint action page phillip cohen hector levesqu teamwork phillip cohen hector levesqu commun action artifici agent intern confer system page june phillip cohen perrault element theori speech act cognit brazil develop descript spoken studi page routledg demazeau editor decentr ai elsevi scienc publish demazeau editor decentr ai elsevi scienc publish dignum van linder model social commun action intellig agent iii intern workshop agent languag lectur note artifici intellig richard fike nil nilsson approach applic theorem prove problem solv artifici tim richard don robin kqml agent commun languag intern confer inform knowledg manag grice mean philosoph barbara karen sparck lynn editor read natur languag process morgan barbara grosz candac sidner plan intent commun mit barbara grosz krau collabor plan complex group action artifici barbara grosz krau evolut sharedplan volum extern interfac work group draft specif kqml languag www hallidai categori theori grammar halpern mose knowledg common knowledg distribut environ journal harel order dynam logic gilbert harman review linguist behaviour jonathan bennett elizabeth linguist pragmat constraint utter interpret phd elizabeth jame allen constraint speech act ambigu page hintikka knowledg introduct logic notion cornel jerri hobb ontolog page kurt konolig hierarch autoepistem theori nonmonoton preliminari report intern workshop page doherti game dialogu esprit workshop yanni labrou tim finin semant approach kqml gener commun languag softwar agent intern confer inform knowledg manag yanni labrou tim finin kqml specif technic report comput scienc electr engin maryland baltimor lynn lambert recogn complex model dialogu phd reproduc tr depart comput inform delawar lynn lambert sandra carberri model annual meet associ comput page hector phillip jose nune act page stephen pragmat cambridg david lewi philosoph studi harvard dian litman plan recognit integr approach understand dialogu phd reproduc tr depart comput rochest dian litman jame allen process common plan intent commun mit anthoni belief foundat comput theori belief technic report pennsylvania state depart comput decemb william mann dialogu convent human interact desiderata agent commun languag work note aaai spring symposium inform gather distribut march mccarti permiss inform introduct technic report dept comput rutger susan mcroi abduct interpret reinterpret natur languag utter phd reproduc tr depart comput toronto susan mcroi hirst repair speech act misunderstand abduct infer comput david control comput model phd oregon comput inform scienc tech report raymond perrault applic default logic speech act theori intent commun mit martha pollack plan complex mental attitud intent commun mit rao wooldridg foundat ration agenc volum reiter logic default reason artif april sadek dialogu act ration plan workshop sadek studi logic intent knowledg reason page sadek commun theori ration principl commun act model aaai workshop plan interag artifici agent kernel spoken dialogu progress report aaai workshop integr natur languag speech comment cohen levesqu intent page mit stephen mean oxford john searl speech act cambridg john searl classif illocutionari act languag john searl collect intent action intent commun mit john searl daniel foundat illocutionari logic cambridg yoav shoham mosh tennenholtz synthesi social law artifici agent societi page candac sidner artifici languag collabor negoti nation confer american associ artifici intellig page sinclair analysi english teacher pupil oxford question lund studi number lund david traum comput theori ground natur languag phd depart comput tr depart comput rochest david traum model dialogu agenc intellig agent iii intern workshop agent languag lectur note artifici intellig david traum jame allen forc plan demazeau decentr ai page elsevi scienc publish david traum jame allen speech act approach ground intern confer spoken languag process page octob david traum jame allen oblig dialogu process annual meet associ comput page david traum jame allen formal theori repair plan execut plan recognit workshop uk plan schedul special interest septemb david traum elizabeth act spoken dialogu comput special issu languag van der hoek van linder meyer integr modal ration agent volum daniel unif speech act theori formal semant intent commun mit daniel mean speech act cambridg von wright deontic logic marilyn walker inform redund resourc bound dialogu phd werner editor decentr ai elsevi scienc publish terri winograd fernando flore understand comput cognit publish
DB/397 3 extens uml case map concept daniel gunter ottawa abstract descript reactiv system focu heavili behavior term scenario cope complex servic provid behavior aspect handl earli design process flexibl notat express concept uml offer notat concept describ servic concept absent present case map scenario notat case map scenario map architectur compon type notat support structur increment develop complex scenario high level integr variat behavior scenario structur placehold call stub paper present concept extend semant notat uml model complex reactiv system ad exist uml view bridg gap separ requir case detail view express interact diagram statechart exampl telecommun system design trajectori suggest introduct model reactiv system requir earli emphasi behavior aspect interact system extern world relationship intermedi activ perform system scenario good repres aspect stakehold understand ow distribut critic telecommun system repres complex reactiv system emerg telecommun servic requir industri standard bodi describ design increasingli complex protocol true wireless mobil user termin bring addit dimens complex recent upcom technolog base agent involv complex unpredict negoti commun model issu protocol entiti dynam natur evolv run time design standard telecommun system servic result design process frequent major stage stage servic point view prose tabl focu stage control flow entiti repres sequenc diagram messag sequenc chart msc stage aim provid specif protocol procedur formal specif provid sdl margin develop methodolog decad ago describ servic protocol isdn descript reactiv behavior natur telecommun system scenario mean model system function interact entiti stakehold understand gener intent technic detail requir scenario notat due inher complex scale emerg telecommun special attent brought earli stage design process focu system function view detail belong lower level stage process member recogn improv process order cope realiti cite studi group evolut standard recent approv research question lead recommend research question focu notat develop complement sdl uml captur user requir earli stage design design detail notat describ user requir scenario refer messag system compon reusabl scenario wide rang architectur alloc scenario architectur compon notat enabl simpler model dynam earli perform analysi requir earli detect undesir interact servic scenario uml activ diagram provid capabl area notat dynam refin capabl alloc scenario architectur compon requir extend uml case map concept case map visual repres causal scenario combin structur show relat case diagram histori applic descript reactiv system natur avoid detect undesir interact scenario servic earli perform analysi extens bibliographi found user group librari addit concept found notat uml make appeal tool design reactiv system number properti satisfi requir section scenario map variat behavior structur scenario structur integr increment facilit earli detect undesir interact paper present concept extend semant notat uml model complex reactiv system ad exist uml view bridg gap separ requir case found stage detail view express interact diagram statechart diagram exampl telecommun paper illustr concept extend uml semant notat model reactiv system section introduc case map defin core concept term uml semant metamodel section show combin behavior scenario structur singl view benefit captur dynam behavior illustr section section core concept present potenti benefit offer design trajectori suitabl reactiv system case map core concept case map notat base core concept section subset concept link exist uml semant metamodel advanc concept specif lead suggest improv uml metamodel discuss section overview notat case map visual notat describ causal relationship bound underli organiz structur abstract compon gener repres task compon gener repres softwar entiti entiti relationship causal involv concurr partial order activ link precondit trigger effect postcondit result describ telecommun servic earli stage design compon involv fig describ basic call process simplifi telecommun tini telephon system accompani origin call screen featur fig map element form core notat start point scenario arriv trigger event satisfact precondit scenario effect repres end point describ result event postcondit repres cross connect element discuss show progress scenario fork join wai repres altern guard condit repres concurr path scenario evolv merg common path shown synchron concurr path diamond repres stub act call oc map fig plug origin stub basic call map requir bind relationship start end point map connect path segment stub bind relationship start point stub condit req sig origin pb basic call map fig tini telephon system featur notat tt scenario interpret arriv call request oc featur check call deni call deni repli prepar signal system verifi call parti busi idl busi repli prepar signal repli prepar signal concurr updat system statu result ring event illustr descript abstract data gener causal flow effect dataflow diagram control flow diagram control procedur call method current semant end point oc map abstract syntax static semant base graph structur specif xml document type definit concret syntax visual introduc previou section support visual edit navig set valid transform ensur satisfact rule dynam semant indirectli provid term formal languag loto underli semant base label transit cc csp main semant concept case map hidden detail concern fig gener term independ current core concept form class diagram diagram abstract class constraint order focu essenc concept preserv context integr uml ring pd bound map bound fig overview core concept white class implicitli tt fig tabl shade class discuss exampl remain section tabl descript concept class descript map composit path element compon map plugin stub map start point end point path element superclass similar node connect graph start point begin causal scenario possibl precondit end point end causal scenario possibl postcondit action element path element causal path refer perform dynam continu element static stub stub compon dynam stub alloc path element wait place discuss possess addit attribut superclass repres locat multipl path element connect multipl predecessor continu rule subclass defin continu rule case continu rule composit path altern condit attach path fork composit concurr path stub superclass repres static stub stub singl bind relationship continu element select polici timer predecessor includ end point postcondit start point precondit action element link concept uml concept link uml wai advantag similar activ diagram facilit connect activ diagram share concept common construct notat extent tt fig effect term activ diagram difficulti suggest notat slightli target model procedur activ diagram focu intern found model concern extern essenti model system reactiv natur usag link concept semant model activ activ graph metamodel case map cast metamodel extens mechan uml tag addit ocl constraint notat icon suggest concept support activ diagram includ part uml metamodel uml commun benefit suggest extens lead notat base uml integr notat extend uml lead compat integr uml wai fig present option uml behavior element found uml metamodel extend concept depend metaclass found activ graph collabor cover section option result packag lot duplic crowd set packag metaclass case concept collabor activ graph state machin common behavior concept uml metamodel case collabor common behavior extend activ graph support fig integr concept uml metamodel layer activ graph state machin fig illustr altern modif directli activ graph packag depend state machin unlik current uml depend collabor tabl simpl activ graph metaclass support concept discuss tabl tabl map concept activ graph metaclass concept metaclass map activ child class path element state parent class state similar node graph start point simplest state state nest state end point simplest state state nest state action element activ atom action state simplest entri action exit transit trigger implicit event complet execut entri action similar activ atom action referenc action element continu state parent class element state kind choic kind junction state kind fork kind join stub state static stub activ refer static stub activ graph metamodel possess element support concept discuss relationship fig cover underli state machin predecessor captur transit link bound care intern repres static refin ocl constraint minor differ concept semant activ graph activ path leav fork eventu merg subsequ multipl layer fork join nest restrict static stub multipl incom path multipl start limit initi state overcom number wai graph child class fig limit enhanc bind relationship solv problem section discuss role compon link scenario potenti impact uml metamodel combin scenario structur main strength resid capac visual integr scenario structur compon singl view design reactiv view understand scenario path enabl architectur reason compon notat scenario bound structur visual alloc path element underli compon notat type compon reactiv system context interrupt servic distinct scope simpl rectangl notat gener compon repres softwar entiti entiti path bound compon structur fig simplifi version tt system fig illustr concept fig path bound architectur user commun respect agent start point user initi event end point result event observ compon perform alloc req req ring req switch sn req ring ring architectur msc sn switch ring intellig architectur msc fig path bound compon potenti msc easili decoupl path improv reusabl scenario lead behavior pattern util wide rang applic fig scenario path context compon base intellig network refer model switch compon establish commun user featur locat insid network element call servic node oc perform sn compon scenario structur architectur reason earli design cycl path surviv evolut modif underli architectur scenario term messag exchang interact compon note messag sequenc chart differ natur complex sequenc diagram fig msc captur scenario fig term messag exchang straightforward interpret artifici messag ital msc possibl deriv scenario path fig potenti msc scenario time bound architectur complex protocol involv switch servic result multipl messag commun constraint prevent user commun directli servic switch involv relai issu relat commun structur evolut version structur abstract focu put reusabl causal scenario structur context structur path element compon uml semant support core concept class repres compon concept compon type path element alloc discuss previou section uml metaclass collabor fit concept compon compon interpret role fig gener compon type user role uml classifi declar nest compon specifi restrict view gener classifi compon show partial view behavior compon type current support compon concept note compon concept uml compon metaclass core repres replac part system packag implement realiz set interfac explain addit depend activ graph collabor fig alloc path element compon easili captur activ graph possess concept mechan divid state activ graph group partit visual uml activ diagram partit poor semant simpli regroup instanc abstract metaclass core remov rest uml metamodel metamodel enrich support alloc relationship found fig fig potenti state path fig solut support compon concept captur essenc path element tabl alloc directli repres solut partit concept activ graph alloc partit relev class activ subclass solut achiev prefer express term activ term state capabl support element model dynam behavior import characterist notat capabl combin integr scenario path enabl model dynam behavior section present dynam stub local design altern behavior scenario evolv run time notat dynam stub timer partit activ path element structur integr scenario wai interest construct dynam shown dash diamond static stub dynam stub multipl select determin select polici polici make composit order select select polici languag suitabl context fig extend origin tt basic call dynam stub underli architectur base type compon essenti understand compon includ system origin oc call deliveri displai caller phone number featur prevent user phone time interv pm user provid valid person identif number time fashion establish call featur captur map simplifi point stub segment bound origin stub default oc displai stub default show multipl stub integr multipl sequenti scenario structur req fig basic call dynam stub timer shown clock symbol timer special wait place await event environ case scenario visual connect end point empti path segment requir event arriv timeout path select polici displai stub simpl call parti subscrib default origin stub select polici complex user subscrib oc featur potenti undesir interact select polici solv fix state resolut rule dynam stub make local potenti conflict scenario lead simpler select polici avoid resolv conflict scenario combin basi featur interact filter method undesir interact detect dealt earli design cycl uml semant support sig default map pd dynam stub origin pb map basic call map shown fig dynam stub stub multipl map bound select polici select polici instanc defin potenti reusabl object mere attribut stub static stub map tabl activ graph state machin metamodel simpl multipl bind displai ring map pd oc map stub extens fig solut child class dynam stub refer possibl handl bind relationship refer abstract dynam stub activ state activ fig extend activ graph dynam stub support wait place timer concept illustr fig achiev uml method suggest statechart diagram activ diagram wait state place activ diagram model reactiv system core concept state dynam stub relationship select polici section describ vision case map fit design process core concept address issu connect model design trajectori suitabl telecommun system uml regroup diagram captur view partial system earli stage design stage detail design diagram techniqu focu orthogon ax structur diagram target softwar conceptu entiti relationship behavior diagram behavior statechart structur diagram captur aspect system requir architectur applic domain share connect behavior referenc entiti structur diagram exist conceptu gap function requir realiz term behavior illustr fig view repres piec puzzl bridg gap requir case provid view system extern behavior uml behavior diagram view describ intern behavior detail provid traceabl progress function requir detail view base ponent time combin behavior structur explicit visual sequenc collabor diagram show behavior object singl case statechart diagram show behavior singl object show behavior object case view contribut greatli understand complex reactiv system uml structur diagram present process relationship impli behavior indic describ actual behavior requir descript case visual combin behavior structur system level uml behavior diag describ behavior detail interact provid visual case term effect path case map project visual descript behavior directli structur abstract compon provid framework make detail design express uml view fig miss piec uml puzzl invest leverag connect uml view languag gener class diagram activ diagram bridg case class diagram protocol commun constraint connect lead sequenc collabor diagram fig gener process formal autom navig tool present method gener msc hierarch state machin statechart diagram sale similar work gener sdl model al loto formal mean valid design detect undesir interact earli design cycl research project includ gener perform model layer queu abstract test case tree tabular combin connect enabl creation design trajectori relev telecommun suggest introduct inspir requir captur architectur reason transform msc interact diagram state machin rt statechart diagram final concret implement autom code perform interact test gener perform stage futur work paper illustr satisfi requir section section semant uml activ graph metamodel support core concept notat advanc concept combin structur behavior alloc path element model dynam behavior dynam stub select concept integr uml metamodel extend activ graph connect collabor concept notat discuss paper includ failur interact dynam compon left futur work attempt minim number modif semant uml uml activ graph decoupl state machin reorgan packag repres good opportun includ concept discuss notat activ diagram visual concept extend support structur show partit dimens straight line repres causal activ spline order adapt complex structur distinguish compon boundari symbol activ larg fit compon layout advantag spline small cross note diminish case diagram relationship case model judici stub good case activ requir studi notat enjoi enthusiast commun user successfulli domain telecommun reactiv system user complain lack formal semant concept found uml actor distinguish opportun add view uml integr express concept uml semant link languag move reactiv system acknowledg indebt member user group judici support refer wireless intellig network servic case brazilian symposium comput case map captur valid distribut system fourth ieee intern symposium requir june pp case map loto prototyp valid mobil group call comput pp case map document type definit work june design case map commun state confer engin march systemat traceabl progress scenario model commun hierarch finit state machin phd carleton august case map case map architectur entiti complex transact softwar decemb pp prototyp conf practic applic intellig agent march inform process loto formal descript techniqu base tempor order observ behaviour recommend specif descript languag recommend sdl combin uml recommend messag sequenc chart question defin notat user requir canadian novemb applic case map system design tool support meng dept system comput carleton octob interact filter case map requir sixth intern workshop featur interact telecommun softwar system object manag unifi model languag version june role activ diagram int pp unifi model languag refer manual addison behaviour case map specif descript submit brazilian symposium comput wc concurr option softwar seventh intern symposium analysi simul comput telecommun colleg octob pp turn uml domain commun octob pp case map web page user
DB/398 3 histori ari abstract describ background develop origin ari recoveri impact commerci world research commun provid introduct concurr control recoveri method ari famili algorithm discuss recent develop affect transact manag area futur concept repeat histori turn import paradigm examin transact manag head world observ histori repeat requir consid mainfram world avail import requir broader inform technolog commun introduct transact manag import function provid manag system techniqu develop deal import aspect transact concurr control recoveri transact abstract acid isol properti support dbmss user design scope atom isol interact techniqu develop small subset implement product prototyp permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb mohan ibm almaden research center harri san ca usa describ background invent ari recoveri isol exploit famili impact algorithm research commun commerci world section briefli summar ari algorithm discuss implement statu present roadmap numer paper focu ari relat work rest paper discuss recent develop transact process distribut comput gener base specul happen year background impact starburst project start almaden research center distribut dbm project focuss build brand relat dbm extens primari object treat project golden opportun decid revisit assumpt influenti system rdbm project area transact manag decid learn accumul experi ibm rdbm product undergon custom usag year decid examin close approach recoveri adopt product log shadow page system research conclud wal shadow succe produc recoveri method support record lock flexibl manag variabl length record system primari reason page smallest granular lock hierarch dbm im support record level lock unsatisfactori physic log lock result inflex storag manag frequent offlin data reorgan decid aim system problem fresh perspect time research commun wrongli understood addit work justifi spend time examin document code system im understand work find design bug system ten year product version worthwhil investig prove extrem insight invalu knowledg gain investig document extens ari collect paper cite origin ari publicli document research report form led establish ibm data base technolog institut umbrella encompass research product group gave ibm numer opportun interact dbm custom product develop learn import unsolv drawback solut featur implement dbm product prototyp basic ari algorithm summar section extend numer wai describ extens subsect gener extens ari implement dbmss persist object file messag queu oper system approach formal subset ari extens ari exploit oper semant provid high avail support context simul analyt studi perform algorithm summar paper implement vari numer product research prototyp starburst extens dbm extend edit manag window transact process monitor file microsoft sql server nt file gamma machin exodu extens dbm shore persist object system gi predat transact messag queu product distribut storag manag lotu distribut oper system vm share file system implement unawar ari cover textbook tutori search web reveal ari taught ben trier wisconsin base earlier work system call mar develop educ recoveri simul explain explor ari includ visual featur ibm obtain european patent basic ari recoveri method due year gave european patent ibm obtain patent lock recoveri method ari famili algorithm section summar algorithm belong ari recoveri isol exploit famili algorithm support high concurr oper effici flexibl storag buffer manag relat nest index cheap techniqu reduc elimin lock fast restart recoveri interact queri process concurr control recoveri techniqu base concurr control techniqu develop applic system recoveri method shadow recoveri method gener approach log approach techniqu wal recoveri method choic techniqu system possibl limit form manag long field wal updat page written back disk locat read updat disk wal protocol assert log record repres data stabl storag chang data replac previou version data disk log record log uniqu log sequenc number time record written log assign ascend sequenc logic address log record version number timestamp finish log updat system recoveri base log record latest updat page field page header page system correl state page respect log updat relat page time log page referenc log record log record compar determin unambigu log record updat reflect page buffer order enforc wal modifi page ensur log forc disk write page disk implement system time page modifi physic page disk page current written written locat physic page shadow page discard checkpoint restart recoveri occur shadow version page system failur occur shadow checkpoint tend disrupt checkpoint activ data manag state modifi page buffer pool log written disk shadow version discard current version made shadow version result synchron action checkpoint restart recoveri intern shadow version techniqu log updat perform wal approach wide adopt techniqu detail comparison method discuss recoveri assum base wal concurr protocol discuss applic system techniqu summar origin ari algorithm variant discuss adapt ari share disk manag data lotu ari aim section provid overview origin ari recoveri method develop flat transact model log recoveri ari atom durabl properti transact order provid ari track made log implement wal protocol updat page log page log logic fashion byte chang page log ari page track page state time page updat log record log record field updat page tag page ari recoveri state page respect log updat page addit updat activ perform forward process ari typic log record updat perform partial total rollback transact normal restart undo process origin log record delet record page written undo log record describ insert result write updat field recoveri state page view evolv origin updat undon ari support lock mode permit multipl transact updat data concurr kind featur requir recoveri method support oper log log quantiti field decrement log valu field avoid erron attempt undo redo action unnecessarili track state page write unlik earlier recoveri properti log record chain log record written forward bound amount log ensur face repeat failur restart recoveri nest rollback contrast im undo multipl addit undo multipl undo time sever problem situat undo log record made field predecessor log record undon inform readili log includ pointer recent log record written transact field recent written track progress rollback system continu rollback system failur interrupt complet rollback nest rollback perform system bypass log record undon describ action perform undo origin undo action term exact action logic undo made high concurr support kei insert page transact move page transact kei insert permit descript exploit transact roll kei locat page tree delet nest rollback occur partial rollback total rollback partial rollback point termin earlier point transact point termin rollback written describ kei delet page enabl restart media recoveri restart recoveri restart transact system abnorm recoveri process ari involv make pass redo log order make process period normal ari checkpoint checkpoint log record identifi transact address recent written log modifi data buffer pool restart ari scan log checkpoint end log analysi inform dirti data transact progress time checkpoint brought date end log analysi dirti data determin start point log scan immedi redo pass analysi pass determin list transact roll back undo pass recent written log record determin redo ari repeat histori respect updat log stabl storag effect page reflect disk system failur updat includ updat transact commit reach state commit time crash miss updat loser transact process repeat histori essenti reestablish state time failur log record updat redon affect page log record redo pass obtain lock protect uncommit updat distribut transact remain state end restart recoveri recoveri method system miss updat termin transact redon redo pass call select redo paradigm show paradigm lead problem smaller lock support wal pass undo pass loser transact updat roll chronolog singl sweep log continu maximum log record process loser loser transact remain undon unlik redo undo pass normal perform undo condit oper ari compar affect page log record decid undo updat log record process record process transact determin field depend nest top action time transact commit irrespect transact commit atom properti situat perform page split page delet index reloc record storag method put transact messag system ari support concept nest top action desir effect accomplish write dummi end dummi recent log record written current transact start dummi ari bypass log record transact roll back complet repeat histori featur ensur system failur perform loser transact system failur occur dummi undon log record written log record desir atom properti concurr control lock acquir data desir granular assur logic consist access latch page acquir forward undo latch semaphor compar acquir latch cheap term instruct execut reader page acquir share latch page read updat acquir latch process assur physic consist page examin deadlock involv latch latch lock avoid ensur rule restrict number page latch held simultan order latch hierarch request order request obei hierarchi restrict avoid request lock hold latch lock acquir transact prevent roll back transact involv deadlock system ari support select defer restart fuzzi imag copi effici media recoveri lock mode exploit semant oper requir abil oper log flexibl respect kind buffer manag polici implement characterist store data effici storag manag vari length object interest redo interest high logic undo support opportun exist exploit parallel restart recoveri algorithm support featur summar detail cite paper algorithm creat remot site backup recov disast present written system long paper explain write point numer advantag write undo updat present recoveri motiv describ unpublish aspect recoveri system partial rollback paper show system paradigm log base shadow page chang context wal select redo undo pass redo pass log updat perform transact rollback write log index updat space manag inform track page state page relat log updat ari show import concurr recoveri storag manag produc high concurr high perform method ari share disk multipl comput approach provid scalabl dbmss share disk architectur share architectur sn implement dbm parallel edit sd implement oracl introduct record level lock support sd necessit enhanc ari deal fact multipl instanc buffer concurr read write access set data share disk make matter addit share previou parallel deal store coupl share machin run design sd hardwar softwar environ deal central lock manag distribut lock hardwar hardwar run special global lock manag hybrid lock paper document altern environ implement instanc write log record local local log asynchron merg media recoveri failur possibl complex singl system environ typic exemplifi client dbm softwar directli oper page disk manag server server ship page client handl global lock client client cach page transact commit client server support environ client produc log record perform updat send server time gener local log manag assign server manag log disk write singl log log record receiv client cs environ differ sd environ section share system relationship implement version ari design client server environ implement exodu ari data long topic fashion web research lotu note target manag data year note enabl internet product chang domino repres server note client function ident domino note joint effort subsidiari iri associ ibm almaden major featur implement latest lotu tradit recoveri scheme note design origin type recoveri accomplish requir design work enhanc made ari deal fact storag manag note note entireti store singl oper system file locat machin architectur independ format data structur file data structur move arbitrari wai data structur attach log made option data structur level granular log turn user note user frequent move replic file copi oper system log version overlaid older newer version system accommod complic requir analysi redo pass ari modifi analysi pass gather extra inform redo pass skip process log record compar page write paper describ result variant ari call recoveri isol exploit semant restrict repeat enhanc version origin ari recoveri method enhanc relat amount redo updat perform time system restart order bring consist state minim extent repeat histori perform repeat histori paradigm ari includ redo miss updat transact roll back undo pass restart lead wast work illustr ari paper repeat histori requir support lock analyz paradigm effici handl smallest granular lock combin paradigm select redo origin ari algorithm data lock case log redon incorpor retain good properti ari avoid undo singl pass media enhanc result reduct number amount cpu process redo undo pass restart improv avail system process transact begin earlier origin ari algorithm requir updat log point recent commit updat page updat present page usual determin compar page relev log record data page coarser granular lock rule impli loser transact log miss updat case turn rule suffici loser transact roll back system failur happen result written surviv system failur page affect updat written back disk undo perform treat transact termin roll back complet transact perform partial rollback begin commit page written disk origin updat perform ensur updat belong loser transact transact updat affect page figur condit page affect page page origin log record updat compar page suffici page greater necessarili origin updat present page origin log record content enhanc includ field call log record rule handl state updat redon affect page greater equal note rule recoveri method perform undo updat pointer bypass process undon log record histori complet handl undo chang condit undo log record updat perform page greater equal log record requir irrespect undo perform written undo perform explan flexibl offer oper log support mode lock ari term reduc extent repeat histori loser transact updat physic log lock support miss updat loser transact page updat transact page redon origin ari algorithm properti undo updat undo updat explain fundament reason exist recoveri algorithm work correctli face failur restart recoveri media recoveri work led understand fundament interact concurr control recoveri method implement recoveri isol exploit semant nest extens ari algorithm origin design transact model appli gener model nest transact includ partial rollback upward downward inherit concurr execut ancestor descend subtransact adopt system architectur encompass aspect distribut manag briefli summar extens made origin ari recoveri method obtain ari log record written transact link backward chain pointer commit subtransact link parent reflect transact tree log subtransact log pointer record ts written ts parent transact chain commit inferior form tree call transact backward chain tree relationship commit subtransact store subtransact forgotten commit analysi pass collect data commit simplifi recoveri gener model nest transact upward downward inherit concurr execut ancestor descend roll action inferior roll back chronolog order log updat perform rollback mean track commit inferior roll remain undon achiev record set point log record process commit inferior undo restart process start analysi continu redo pass end undo pass redo process work algorithm analysi undo pass modifi support log content field set log address singl origin ari algorithm implement basic featur adapt support recoveri system present modif support advanc transact index manag concurr search structur discuss frequent problem provid recoveri transact system failur transact consist multipl search structur oper receiv attent late origin research report paper provid treatment concurr control recoveri index manag transact system paper document detail system lock algorithm explain design featur paper enhanc algorithm vastli improv concurr perform characterist spite effort public index understood research commun taught suffici discuss textbook summar develop transact perform number index includ rang scan serializ execut transact support present assum tree architectur index data relat kei valu record identifi record kei valu rid record identifi record locat set data page leaf page index index entri form pair index duplic instanc kei kei store leaf page singl rid fit page object lock kei individu index entri make differ case index call lock index entri lock lock underli data kei index entri lock mean record lock lock page part rid index lock data lock perform concurr tradeoff involv approach detail kei lock record store index index entri sql potenti lead higher concurr compar lock featur lock overhead retain idea lock individu index entri perform lock lock obtain case lock prefix lock index id make specif index explain problem involv support concurr modif index tree question answer log index recoveri system miss updat reappli smo modif oper page progress time system failur effect smo reflect disk version ensur restor structur consist tree updat index page minim concurr accessor transact roll back successfulli complet ensur undo result loss updat perform transact interven period page affect detect kei insert transact page subsequ smo roll access kei detect kei delet longer belong due subsequ smo roll access kei insert avoid deadlock involv transact roll back special logic handl deadlock involv roll back support granular lock design object lock found condit effici repeat read phantom problem uniqu index kei delet transact permit insert kei transact tree smo progress ensur transact recov run effect smo recoveri isol exploit semant method concurr control index concurr execut permit lock protocol correct log recoveri made support high concurr tree structur oper unlik system transact wait lock kei index read modif page transact transact roll back deadlock lock rule differ depend index uniqu index index compar system kei lock ix lock mode intend origin tabl level exploit semant oper improv concurr techniqu applic concurr control storag access structur kei lookup request kei kei lock make request kei suddenli insert current transact termin prevent repeat read protect insert present insert transact instant lock lock higher kei lock kei rang lock rang kei span valu kei present index lock kei protocol insert transact check lock kei insert kei mode insert kei lock request incompat lock acquir fetch delet instanc kei result kei disappear commun reader insert case uniqu exist uncommit delet kei delet transact acquir lock kei reason reader check kei lock fetch find request kei mode delet kei lock request incompat lock acquir fetch kei lock insert check delet lock held commit enhanc origin system index concurr control algorithm implement vm share file system recoveri isol exploit semant index method control concurr log index data store recoveri featur base ari support high concurr lock index data se lock underli record data data page record acquir commit durat lock index page index structur modif oper page split page delet concurr support consist lock transact perform smo roll effect smo propag successfulli tree rollback smo undon accomplish perform smo insert requir page action relat split propag tree write dummi complet insert necessit split perform delet kei necessit page delet page kei delet perform log action relat page delet complet dummi point kei delet log record transact rollback complet dummi bypass log record relat smo ensur oper smo rollback restor structur consist partial complet smo undon fashion time restart special process perform determin index structur inconsist special handl index redo index perform fashion index normal process undo perform fashion protocol normal process system failur occur subsequ incomplet smo undon structur consist tree logic undo attempt resort special restart process featur implement extend edit manag enhanc form call unix product design origin concurr control techniqu gener techniqu incorpor vm share file system system base system techniqu recoveri support media recoveri index dump index problem read page crash occur page written page load dump roll forward page brought detail media defer present handl delet empti perform merg partial fill leaf page requir simpl extens method extend implement handl share disk im terminolog environ multipl instanc access modifi develop wai improv concurr reduc neg implic index entri lock delet kei outlin idea conjunct logic kei delet adapt gener search tree adapt idea hierarchi index distribut context present concurr control implic multipl index access singl tabl record present extend hash studi long report literatur concurr control multipl transact simultan access structur base simplifi notion transact transact assum consist action search structur problem serializ complic consid transact consist multipl action paper deal extend complic linear hash paper deal problem provid recoveri transact system failur gener model transact lock concurr activ permit algorithm literatur inconsist consid failur recoveri interact concurr control log transact subtl linear hash deal concurr control recoveri aspect transact access dynam storag structur larson dynam hash algorithm call linear hash separ uniqu primari kei tabl memori retriev record file page access secondari storag larson consid lh practic method offer retriev larg dynam file discuss impact concurr oper read file perform oper file file contract reloc record method control concurr oper serializ prevent roll back transact involv deadlock includ recoveri techniqu handl transact system multipl oper transact provid high concurr effici recoveri exploit power ari recoveri method concept abil support logic impact lh storag method rang queri prefetch data discuss handl vari length record updat record implement lock level concurr support reduc content transact access data drawback lock transact access larg number number lock acquir dramat compar situat page lock transact determin piec data commit state system avoid benefit lock transact access record time avoid drawback lock granular transact access numer record read method avoid lock expect data commit state method idea simpl method determin piec data commit state transact process system method cheaper altern lock approach past method advantag concept transact system record page relat state page log updat action page crux method inform inform activ updat transact data page commit resort lock compar page inform oldest updat transact execut system crucial fact make method accomplish object page log record oldest execut updat transact uncommit data method appli lowest granular lock page finer simpl method reduc lock latch method level concurr support benefit updat transact reduc cost lock content present data page applic method discuss detail order appli extens system page system partial object log system method step time page access find recoveri manag access share storag note transact obtain latest page long page access date number time lock obtain latch page share mode conclud data page commit lock usual determin data interest commit global cover transact benefit comput specif object file access updat transact access object global bit past unduli restrict applic method object interest concept turn practic fulli implement partial unix perform advantag benefici share disk context exploit provid fast restart capabl process transact redo undo pass restart recoveri progress queri process lock concern start system work queri process gener relat concurr control make queri execut choic queri optim concurr control relat action data manag compon case system queri optim relat action upper part system compon case system numer exampl illustr import lock relat issu plan queri execut perform advantag integr time correct queri execut depend approach issu isol level dirti cursor access path select index index optim lock granular high concurr queri optim criterion idea implement famili transact internet ag develop transact process distribut comput area area comput influenc recent trend tp internet processor emerg worldwid web java dramat influenc tp dc open inform resourc custom busi partner internet access chang data access pattern dbmss file system store inform chang dramat requir tp system regard attribut perform histori repeat consid requir context mainfram comput larg requir small medium tp applic global merger import drive factor permit data access heterogen hardwar softwar environ necess legaci tp system cic im internet enabl slide long talk expand section found window nt provid support ibm network protocol distribut program program commun commit distribut transact involv mainfram pc environ web provid custom servic reduc cost elimin intermediari call center tradit wai busi comput realiti remain organ adapt inform system support custom directli interfac tp system perform usabl expect demand train peopl custom servic servic tp applic issu web gatewai softwar basic aspect tp applic redesign electron commerc respect busi busi interact busi consum transact open tradit tp system full blown potenti involv perform multipl updat origin browser part singl distribut inform retriev style access requir address number issu relat client payment advanc transact model flex kei role plai belief support concept final year workflow manag extens tradit tp monitor tier distribut comput popular year tier comput addit middlewar softwar run embrac wide difficulti cost involv realiz major benefit cost comput server result mainfram emerg concept server consolid refer replac larg collect server cluster consist small number mainfram ibm cic enhanc support share disk cluster environ valuabl featur workload balanc singl system imag modifi system support cluster coupl facil intellig share store sophist share requir develop innov solut problem relat global lock buffer recoveri perform asynchron program program commun form persist messag popular ibm success product arena includ persist storag extend version manag messag recent introduc messag function directli rdbm messag manag oracl dbm approach requir enhanc concurr control protocol isol level support dbm meet consist perform requir transact messag system area research commun paid attent concept popular commerci world deserv research tp dc standard activ widespread belief object technolog approach improv softwar product exist legaci tp applic ad oo wrapper applic commerci implement omg object transact servic clear wide quickli product product tp applic perform characterist comparison applic built procedur tp technolog ot extend java world java transact servic java bean exploit java server side build tp applic perform attribut robust major concern respect technolog year debat tp dc commun paradigm program program role tp monitor world web server rdbmss featur support thread present long time tp monitor cic wide rdbmss oracl tp monitor deepli involv applic data manag rdbmss manag data manag program store web server corba object request broker attribut tp monitor emerg applic classic tp monitor enhanc support web object technolog emerg special onlin analyt process dbmss arbor huge data built queri effici algorithm tool develop vendor extract data oper tp system special index massiv data handl featur develop manag data research begin address issu contrast research commun focuss respect replic data asynchron replic favor choic implement rdbm product develop year widespread trend inform technolog oper organ core busi comput relat result difficulti encount organ manag network heterogen system organ desir reduc cost comput compani ed ibm global servic job relat trend organ stop develop tp applic softwar bui packag applic resourc plan vendor sap erp vendor enhanc made function dbmss reli store data busi reengin suppli chain integr applic supplier custom order improv oper cost time market integr expect happen futur internet privat network case past electron data interchang workflow manag system expect plai big role transform busi industri academ research commun work tp dc focuss problem great interest commerci world led innov technolog develop directli product develop repeat histori evolut popular ari famili concurr control recoveri algorithm discuss impact algorithm research commerci world view provid roadmap numer relat provid summari ari algorithm research aspect engin focuss detail decid pai attent practic experi make fundament contribut area transact manag lucki work environ expect dbmss enhanc futur featur higher concurr improv data avail accommod demand requir internet world parallel exploit reduc time perform oper data index system design tune manag peopl transact expect place daili live design system attribut reliabl avail mind begin crucial system success usag relat problem discuss address suffici research intend exhaust survei work research literatur paper written year applic protocol objectori theori integr view recoveri concurr sophist index protocol numer lock algorithm implement design case detail implement substanti addit design work acknowledg acknowledg contribut colleagu mine collabor work summar ron dick don dave russ jeff tina frank bruce bob andrew kurt peter amit jim kent juli steve watt marko peopl product research group adopt research brought product prototyp incorpor highli strong encourag receiv david theo mike carei pari andrea dave lomet salzberg acknowledg cooper manag pat bob laura haa toler work ibm research publish wife mohan deserv special accept long work hour frequent travel refer concurr proc intern confer data februari concurr control recoveri principl transact process system morgan effici scheme provid high proc acm sigmod intern confer manag san june recoveri transact exploit oper proc intern workshop advanc transact model architectur august robust crash distribut proc intern confer larg data august histori evalu system commun vol octob appli technolog mass storag proc intern confer larg data septemb shore persist proc acm sigmod intern confer manag histori system proc intern confer larg data septemb lock protocol index partit proc intern workshop advanc transact model august ww ee manag overview technic ibm system vol mj applic perform ibm system vol implement atom ieee transact softwar vol octob data recoveri ibm ibm system vol gamma machin ieee transact knowledg data vol march modif advanc transact proc intern symposium advanc inform system notion consist predic lock commun vol novemb transact model advanc morgan crash recoveri proc acm sigmod intern confer manag san june varieti concurr control fast vol june recoveri manag system acm comput vol june transact concept morgan ibm ibm system vol principl transact orient recoveri comput vol decemb concept transact recoveri nest proc intern confer manag san concurr control issu nest vldb vol starburst dust ieee transact knowledg data vol march method manag concurr control partial transact rollback orient system log unit kingdom franc patent germani patent april special issu parallel ibm system vol advanc transact model kluwer academ analysi recoveri system log proc acm sigmod intern confer manag san june coupl facil data ibm system vol concurr recoveri gener search proc acm sigmod intern confer manag recoveri mechan prentic perform concurr control mechan central prentic model verif data manag base acm transact vol decemb linear hash separ dynam hash scheme achiev acm transact vol septemb recoveri method proc acm sigmod intern confer manag san june access method concurr proc acm sigmod intern confer manag san june redo recoveri system proc intern confer larg data septemb formal recoveri chapter transact recoveri method support lock partial rollback ahead acm transact vol march reprint read hellerstein morgan kaufmann reprint recoveri mechan hsu prentic ibm research report ibm almaden research januari novemb singl tabl access multipl execut concurr control proc intern confer extend data base march longer version paper ibm research report ibm almaden research march recent work distribut commit messag data vol march algorithm flexibl space manag transact system support granular proc intern confer extend march longer version paper ibm research report ibm almaden research march lock method concurr control transact oper proc intern confer larg data august version paper ibm research report ibm almaden research septemb simpl method reduc lock latch transact process proc intern confer larg data august slightli version reprint perform concurr control mechan central kumar prentic interact queri optim concurr proc intern workshop research issu data transact queri februari optim optimist concurr proc intern workshop research issu data transact queri februari concurr control recoveri method log linear hash proc intern confer data april longer version paper ibm research report ibm almaden research march ibm relat dbm featur proc acm sigmod intern confer manag method provid improv data avail dbm restart recoveri proc intern confer larg data august survei dbm research issu support larg invit proc intern confer foundat data organ octob lnc volum lomet disk optim data integr transact system proc intern confer data march concurr control recoveri method perform concurr control mechan central kumar prentic perspect lotu proc acm sigmod intern confer manag june slide effici high concurr index manag method ahead proc acm sigmod intern confer manag san june longer version ibm research report ibm almaden research august transact manag distribut data base manag acm transact vol decemb recoveri control protocol fast page transfer granular lock share disk transact proc intern confer larg data septemb longer version ibm research report ibm almaden research march effici lock cach data share disk transact proc intern confer extend march data base recoveri share disk proc intern confer distribut comput june algorithm creat index larg tabl proc acm sigmod intern confer manag san june effici flexibl method archiv data proc acm sigmod intern confer manag correct version paper ibm research report ibm almaden research march method recoveri proc acm sigmod intern confer manag case studi problem migrat distribut page recoveri multipl log share disk ibm research report ibm almaden research march restrict repeat histori ari transact recoveri proc intern confer data april effici flexibl method transient version record avoid lock proc acm sigmod intern confer manag san june algorithm manag remot backup data base disast proc intern confer data april longer version paper ibm research report ibm almaden research decemb june program isol ibm research report ibm san jose research juli histor log recoveri commerci jp log protocol proc acm sigmod symposium principl march advanc concurr control transact process execut comput societi manag recoveri method base log nest proc intern confer larg data august longer version paper ibm research report ibm almaden research januari cm share file ibm system vol perform analysi ari recoveri method proc intern confer comput inform novemb transact process chapter distribut acm
ML/399 6 gener accur rule set global optim frank depart comput scienc waikato zealand ian witten depart comput scienc waikato zealand abstract domin scheme oper stage induc initi rule set refin complex optim stage discard adjust individu rule make work paper show good rule set learn rule global optim present algorithm infer rule repeatedli gener partial combin major paradigm rule rule tree techniqu algorithm straightforward experi standard dataset show produc rule set accur similar size gener accur ripper oper avoid suffer extrem slow perform patholog set method critic introduct rule basi popular concept descript languag machin learn extract dataset repres form easi peopl understand domain expert chanc analyz valid combin fact domain varieti approach learn rule investig begin gener transform rule final simplifi rule result rule set accur origin tree strategi appli aq famili algorithm subsequ basi rule learn system strategi determin power rule underli separ exampl cover repeat procedur remain exampl domin practic implement emerg strand ripper perform global optim process set rule induc initi motiv initi rule gener unduli larg drop individu rule optim rule local drop condit motiv accuraci rule set replac individu rule case natur algorithm cohen put start initi model iter improv heurist experi show size perform rule set significantli improv optim process complex heurist paper present procedur avoid global optim produc compact rule set method combin rule learn paradigm identifi section discuss paradigm incarn ripper section present call base partial tree section describ evalu standard dataset compar part commerci successor section summar find relat work review basic strategi produc rule set begin creat tree transform rule set gener rule path root leaf rule set deriv simplifi dramat lose predict accuraci unnecessarili complex disjunct impli express succinctli tree problem obtain rule transform unprun tree set rule rule simplifi separ greedili delet condit order minim rule estim error rate rule class turn consid subset guid criterion base minimum descript length principl perform replac earlier method simul step rank subset class respect avoid determin default class rule greedili delet rule set long rule set error train data process complex separ stage requir produc final rule set shown noisi runtim cubic number instanc lengthi optim rule restrict conjunct test occur path initi tree algorithm repres direct approach learn rule gener rule remov instanc test version er iter induc rule remain instanc automat lead order list type classifi term prune method algorithm investig furnkranz show effect scheme prune rule back immedi separ stop criterion determin ad rule origin formul procedur appli directli set build rule separ class order appropri ripper implement strategi reduc error prune set train data determin drop tail incorpor heurist base minimum descript length principl stop criterion rule induct step rule set close approxim obtain global prune strategi consid individu guid error modifi rule set prune data decid leav origin rule substitut replac made minimum descript length heurist claim ripper gener rule set accur experi larg collect standard section confirm basic strategi build singl rule prune back lead problemat form call prune interact cover heurist gener made implic cover heurist prevent learn algorithm discov implic simpl hasti gener boolean dataset attribut built rule figur corrupt ten percent class assum prune oper conserv delet singl final conjunct rule time entir tail conjunct ripper assum rule coverag train set prune set true true figur hypothet target concept noisi domain rule gener prune back true train data figur sole make scenario rule prune error rate prune set null rule error rate smaller rule set prune back patent accur set shown figur hasti gener artifact reduc error happen pessimist prune variat number noisi instanc data construct situat prune rule compar larg coverag rule smaller coverag happen number error commit rule larg compar total number instanc cover adjac rule obtain rule partial tree method rule combin approach discuss section attempt avoid respect problem unlik ripper perform global optim produc accur rule ad simplic main advantag adopt strategi build remov instanc continu creat rule remain instanc left differ standard approach rule creat make singl rule prune tree built current set leaf largest coverag made tree discard avoid hasti gener gener implic prospect repeatedli build tree discard prune tree obtain rule build increment ad conjunct time avoid problem basic rule learner methodolog conjunct tree add flexibl speed wast build full tree obtain singl process significantli sacrif advantag kei idea build tree fulli explor partial tree ordinari tree branch undefin gener integr construct prune oper order find simplifi singl rule read algorithm summar figur split set exampl partial tree step test divid exampl subset implement make choic subset expand order averag start smallest reason subsequ subset end subset low averag entropi result small produc gener continu subset expand procedur expand subset split set exampl subset subset expand subset expand leav subset expand expand subset expand leav estim error estim error node undo subset make node leaf figur method expand set exampl partial tree stage stage stage stage stage figur algorithm build partial tree continu backtrack intern node children expand prune algorithm check node replac singl leaf standard oper implement make prune plai part replac perform algorithm backtrack standard explor sibl node backtrack node encount children happen potenti replac remain subset left unexplor left undefin due structur algorithm event automat termin tree gener figur show stage continu normal point sibl chosen node stage grai node black leav stage black node lower entropi node expand leaf backtrack occur node chosen stage children expand trigger prune replac node lead stage node consid oper accept backtrack node lower entropi leav replac consid node node replac process effect termin cpu time sec number exampl irrelev binari attribut uniformli distribut exampl part class part class figur cpu time part artifici dataset partial tree stage procedur ensur effect discuss section occur node prune successor leav happen explor found prune back leav situat shown figur handl correctli dataset instanc prevent algorithm path full tree explor achiev greatest perform gain naiv method build full tree time gain prune place dataset numer asymptot time complex algorithm build full tree case complex domin time sort attribut valu place partial tree singl rule extract leaf correspond seek leaf small expand leav implement aim gener rule leaf cover greatest number instanc experi assum accur leaf lowest error error estim bernoulli improv rule set dataset miss attribut practic learn scheme deal effici construct partial tree treat miss valu instanc assign determinist branch miss attribut assign branch weight proport number train instanc normal total number train instanc valu node test appli procedur separ associ weight applic rule test instanc weight deduct instanc total weight pass rule list weight reduc predict class probabl combin final classif weight algorithm runtim depend number rule gener tree built time log dataset exampl time gener rule set size log assum size final theori time complex log compar tabl dataset experi dataset instanc miss numer nomin class valu attribut attribut anneal audiolog australian auto german glass glass hepat iri labor mushroom segment sick sonar soybean splice vehicl vote vowel zoo log ripper number rule grow size train data greedi rule learn strategi pessimist prune worst case number rule linearli train complex bound log experi observ run artifici dataset cohen show perform cubic number exampl result time dataset depict scale figur class percent class case scale cube number exampl result order evalu perform part set practic learn perform experi standard dataset uci collect dataset characterist list tabl learn algorithm part ran ripper dataset result list tabl give percentag correct averag ten standard holt variant glass dataset class combin class dataset attribut delet attribut class delet identifi attribut dataset tabl percentag correct standard deviat dataset part ripper anneal ffi audiolog ffl ffl australian ffl auto ffi ffl ffl ffl ffi ffi ffi ffl german ffi ffi ffi glass glass ffl ffl ffi ffi hepat ffl ffl ffl ffl ffl iri ffi ffi ffl labor ffi ffi mushroom ffl ffl ffi ffi ffl ffl ffl segment ffl ffl sick ffl ffl ffl sonar soybean splice ffi ffi ffi vehicl ffl vote vowel ffi ffl ffl ffi ffi zoo ffl ffl deviat ten shown fold scheme result ripper mark ffi show improv result ffl show degrad mark discuss speak result differ statist level pair pair data point consist estim obtain run learn scheme compar tabl show method compar entri result part part mushroom fact differ decim place number dataset method column significantli accur method row observ tabl part outperform outperform part chanc probabl distribut sign weak evid part outperform collect dataset similar tabl part significantli accur ten dataset significantli accur probabl distribut provid weak evid perform part ripper situat part outperform fourteen dataset perform probabl distribut fairli strong evid part outperform ripper collect dataset type tabl result pair number method column significantli outperform method row part ripper part ripper size rule set import strong influenc mark tabl give inform rel size rule set mark learn scheme dataset gener fewer rule occur compar averag number rule gener part smaller eighteen dataset larger sixteen paper present surprisingli method learn list base repeat gener partial tree manner main advantag part scheme discuss perform combin paradigm rule learn produc good rule set global optim method produc rule set compar favor gener accur produc ripper interest question futur research size rule set obtain method emploi stop criterion base minimum descript length reduc error prune pessimist prune acknowledg anonym review significantli improv exposit peopl donat dataset uci repositori refer fast effect rule induct intern confer machin learn morgan kaufmann rule learn technic report austrian research institut artifici vienna prune algorithm rule learn machin increment reduc error prune intern confer machin learn morgan kaufmann simpl classif rule perform commonli dataset machin uci repositori machin learn depart inform comput scienc solut cover problem intern symposium inform process vol yugoslavia boolean featur discoveri empir learn machin gener product rule tree intern joint confer artifici intellig morgan kaufmann simplifi tree intern journal program machin learn san morgan kaufmann model shortest data descript learn list machin
IR/400 5 latent semant index map rue du switzerland abstract import problem inform retriev spoken document extract relev document poorli decod speech recogn paper stochast index document base latent semant analysi decod document content origin lsa approach singular decomposit reduc document feasibl solut random map map motiv cluster document som reduc effect recognit error extract characterist index term index result present relev judgment retriev result test queri document perplex defin paper measur power index model introduct paper present method index speech data automat transcrib speech recogn goal retriev relev speech section provid natur languag queri index differ automat gener speech transcript convent text sourc word error rate transcript high vari depend speaker acoust condit import problem inform retriev spoken document extract relev document poorli decod speech recogn typic applic spoken data index build retriev broadcast record step separ recogniz speech music sound exist section insid speak recognit extract speech section remain difficult task vocabulari includ foreign languag peopl speech word error rate significantli obtain index hard domain specif adapt languag model amount data rapidli success index decod document requir import word section extract gener inform record index term recogn correctli separ import word artifici neural network larg collect data exact parametr function model ann plai activ role speech recognit text retriev speech system mixtur gaussian hidden markov model hybrid system hybrid system ann comput posterior probabl hmm text data collect ann successfulli order data base semant structur illustr cluster displai latent semant analysi model text data base semant structur found analyz matrix word document model project data lower subspac find import structur remov lsa principl compon analysi singular decomposit lsa gener document index lsa appli find essenti index term document relat paper describ comput lsa base index spoken document appli larg data collect paper describ french asr system decod document index quantit measur base perplex end give preliminari result analysi discuss improv problem approach lsa base idea data effici compress extract orthogon compon direct compon minim project error remain previou compon document collect present matrix row correspond document column exist word inform word posit intend answer index document word matrix svd find singular valu vector largest singular valu obtain reduc space subspac word code sn sn normal row matrix smooth cluster word document semant dissimilar measur larg document collect broadcast record long time matrix larg handl matrix small subset larg vocabulari repres list element exist effici method comput svd matric singl vector lanczo iter tradit lsa difficult due comput complex dimens quickli reduc filter word import common rare word vocabulari reduct inevit reduc index obviou judg import analyz document rare word good document practic index easi adapt data matrix exist easi wai repres lower dimens true eigenvector quickli gener random approxim orthogon vector word present document averag vector word random good approxim lower comput complex method call random map approxim feasibl larg vocabulari drop word expand matrix ad document word import spoken document short import word rare distribut index word care smooth gener cluster similar document averag document vector cluster repres cluster member cluster vector gener smooth integr content semant close document model cluster interpret automat select topic base document collect avoid quantiz error document nearest select set nearest cluster comput smooth map weight averag base nearbi cluster strongest effect gener match broadcast section relev topic figur visual document collect cell correspond cluster som grid lighter color shorter distanc select test document vector neighbor cell origin vector space number insid cell id document closest cell visual cluster label cluster match index word automat decod document account document complet decod word relev word lost substitut fulli irrelev cluster advantag map decod document base content minim effect incorrect individu term classic cluster method cluster vector averag vector cluster adapt cluster fine structur make smooth ineffici train vector affect smoother cluster reflect major structur data cluster train vector affect cluster make easier train larg cluster set learn proce som densiti cluster vector eventu reflect densiti train vector space provid strongest smooth area highest accuraci area train som automat order provid visual structur data figur displai suitabl domin cluster direct immedi concept area chosen document situat evalu index retriev method correct evalu spoken document index difficult task find document code variat improv code cluster creat index evalu index make test queri rank answer direct compar obtain document rank list trec evalu organ nist lot work human expert prepar set test queri select relev document collect broadcast respect queri relev retriev document compar rel measur recal proport relev document proport obtain document relev comparison rank retriev list final check level recal comput averag relev document addit relat measur averag defin top total number relev document direct fulli automat quantit comparison test method quickli work concept call averag document perplex give numer measur index describ document set present perplex lsa variat valu latest trec evalu idea perplex speech recognit long time quantifi rel difficulti recognit task interpret measur higher larger time set word select correct lower perplex smaller vocabulari stronger lm constraint restrict word combin perplex measur strength predict power lm wide compar lm comput time actual wer speech recognit system perplex word wt test set defin pp ln document model defin perplex vector space word document probabl lsa model test document lsa probabl comput normal match vector index term vector test document smooth high word match mean word exist test document word test higher perplex higher averag document perplex mean model predict power test document index perplex mean substitut actual retriev test speech recognit improv perplex necessarili impli improv actual wer experi system index french hybrid recognit system similar baselin decod hour french select extract french le read speaker select set task obtain wer main differ true broadcast record made control condit low level featur speech recognit coeffici valu energi energi featur vector comput ms ms window frame featur vector frame acoust context fed mlp hidden unit output phonem mlp train suggest hmm ti mlp output durat model clone state associ phonem word larg pronunci dictionari multipl pronunci word text newspap speech subsequ comput trigram lm hmm pronunci dictionari integr decod sentenc hypothesi sequenc mlp output section speech work index decod hypothesi pass inform speech hypothesi assign index weight word make confid measur hypothesi index creat invert file index word decod word ad match index word lsa number word lsa list determin assum lsa score distribut select score level index made stochast index word weight lsa score scale index word select directli actual decod weight document code weight averag vector word stop common word word vector normal random vector explain section word weight frequenc current gener weight reflect import word document collect import defin mutual inform simpler document frequenc approach word weight appli weight score index term word index term build document word stem word map root form suppress suffix lsa index similarli default index queri process elimin stop word map word stem find document score base number match queri term document index score normal weight document length term frequenc collect highest rank section list score pointer audio record test trec test materi index ap rp pp pp test rm svd default tabl comparison averag rp lsa version baselin system trec data averag document perplex provid lsa version simul independ test data made test document ignor contribut document lsa result index ap rp pp pp test rm svd default tabl tabl wer speech recogn relev judgment trec english broadcast select quantit qualit comparison lsa index result index test made similar index decod speech recogn wer level select averag wer provid sheffield provid nist tabl rm random svd map import singular valu som cluster unit som train decod decod decod def lsa def lsa rank recal ap rp tabl finer detail comparison refer system lsa system tabl averag number document rank total recal level total number document collect equal adapt version classic cluster map smooth model made weight averag cluster explain section method made smooth model weight averag actual document vector decod made index correct speech recognit error default default paramet queri queri index term relat queri term commonli queri term common associ form larg text relat subject index queri shown improv valu default lsa index test materi decod error lsa method behav made index french newspap data previou make gener base experi experi test method text retriev test relev judgment document perplex comput perplex bit comput separ equal larg document train data stem made languag data french heavier approxim test document rm svd rm test random vector svd reduc origin vocabulari dimens drop word time collect figur show rel perplex smo smo smo smo figur perplex lsa index method upper pictur show perplex cluster model smooth lower pictur match approxim cluster model explan method cluster lsa variat paper describ system decod spoken document index base latent semant analysi document content simpl approach suggest lsa larg document collect smooth lsa model appli cluster som organ view content document collect experi made french american provid relev analysi result test queri measur predict power model defin document perplex measur tabl averag improv svd smooth model som closer comparison tabl lsa retriev document includ slightli relev lowest standard recal level highest rank lsa higher recal level lsa drop cost higher total recal vast irrelev document document perplex random map document stronger smooth ap rp indic show clear improv svd code ap rp indic show improv perplex doesnt chang test upper perplex stronger smooth appli cluster wider cluster kernel impli stronger comparison upper lower part stronger approxim perplex map bigger cluster reason model accuraci point view fact svd code perplex rm due reduc vocabulari comput point view random map faster complex problem number document word conveni chang document vector updat cluster model index faster smaller total number model smaller number select model som algorithm behav larg document affect vocabulari size linearli number document result present paper preliminari experi requir sound ad hoc default valu paramet control document smooth rank retriev document care tune paramet improv result significantli research left integr acoust confid measur hypothesi present stochast test sophist import weight word index term french stem algorithm english suffix implement total algorithm develop rank strategi significantli match document inform includ index weight interest aspect data visual understand structur suitabl word queri refer cook retriev broadcast document system proc page andersen baselin system hybrid speech recognit french jr statist languag model approach integr local global constraint ieee workshop automat speech recognit page mw berri singular comput int morgan connectionist speech recognit hybrid approach kluwer academ sf rosenfeld evalu metric languag model darpa broadcast transcript understand landauer index latent semant analysi amer soc inform kaski reduct random fast similar comput cluster proc page kohonen map extend ed robinson spoken document retriev proc text retriev conf ritter kohonen semant map biol se robertson sparck jone relev weight search term amer soc inform pc improv robust larg vocabulari speech recognit proc
Agents/401 1 desiderata agent orient program languag agent art group liverpool liverpool unit kingdom abstract multiag system design program languag order develop agent multiag system current approach consist classic program languag java prefer languag agent commun rich librari function aim java design multiag system encompass multiag featur aim paper present set characterist present program languag paper describ kind multiag system develop set characterist consequ compar java featur result demonstr java appeal agent commun solut ignor java java java function agent decomposit paper publish technic report depart comput liverpool version introduct begin research domain multiag design implement execut version system begin program languag design softwar engin program languag prolog languag emerg agentspeak congolog meet great success languag receiv java languag languag accompani rich librari function tackl concurr secur popular softwar favorit languag design multiag system java problem aim program languag design multiag system design multiag featur languag realiz design deal directli agent multiag system describ object aim paper present set featur program languag encompass featur show exist object agent goal paper present program languag show realiti java languag program languag languag java work correctli paper structur section featur program languag featur divid featur languag featur deal agent characterist featur explain detail section present languag develop multiag system exhaust survei languag java languag prefer languag order implement multiag system section demonstr java match featur present implement featur present java section conclud paper desiderata program languag section present set program languag list featur exhaust insert gener featur list design insert mobil secur agent program languag featur set characterist section deal agent multiag system scope gener concurr program languag basi program languag agent act concurr multiag system function agent multiag system repres set function featur function project share function agent type agent handl type integ auction string ident knowledg program languag abil describ type classic program languag charact string agent repres collect instanc set agent answer bid auction protocol arrai categori call abstract data type order repres wide rang present classic construct loop program languag correspond abstract data agent handl complex data store schema tree hashtabl time time manag comput delai instanc auction protocol agent deadlin pass time multiag system simul type time discret mean valu discret mean valu handl function order comput time deadlin execut multiag system schedul advanc unexpect event occur execut demonstr abil featur realiz except except throw safe exit event normal behavior system featur design valid techniqu assert abil design check condit hold design hammer price greater reserv price seller request price buyer valid fail warn design mutual agent act concurr modifi object common agent requir design abil avoid agent modifi object concurr mutual facil agent act reach point mechan call synchron synchron interact protocol extens imposs design match rid drawback provid abil extend languag featur realiz librari instanc agent multiag system act concurr concurr featur thread program languag present interest notion pattern encompass notion pattern deal abil part code program object time dataset handl synchron asynchron action messag action bare synchron easili readabl softwar engin read code special assist loto easi understand code program languag game design understand code behav clear syntax semant semant formal easi easi program languag import easi learn softwar engin design follow approach classic program languag java envisag tool order design tool check syntax semant correct tool translat languag code machin interpret code characterist deal multiag system featur provid agent interest design agent primit order usual function insert multiag connect commun servic search agent servic design program abstract main drawback current approach java design function connect commun servic agent insert multiag system design deal socket design level abstract connect agent commun function modifi connect code function modifi notion abstract import notion multiag system order hide complex design bdi bdi logic ration agent logic repres agent belief intent belief environ agent ration agent multiag system interest encompass bdi notion keyword repres desir intent reader consult languag subset mora bdi languag commun interact multiag system import element interact agent task exchang knowledg cooper design set mechan interact udp tcp packet mechan support maintain cognit agent handl knowledg interest provid knowledg manag primit handl updat knowledg import primit consist knowledg base conform intern associ fipa agent standard import design follow standard promot agent conform standard encompass standard messag format adopt standard present mechan design present standard chang requir design chang code mechan abil mix formal model languag multiag theori repres multiag automata petri net interact protocol automata agent behavior design includ element gener code behav formal interest design gener code directli formal handl formal petri net agent uml organ environ agent environ organ design repres easili notion provid primit handl environ popul organ repres electron institut reactiv agent act stimuli occur environ agent architectur read list design import featur miss multiag system notion mobil secur gener consid version design add featur list raw list featur design languag featur match section present kind agent multiag system develop provid characterist kind ma previou section present set characterist provid interest kind agent multiag system develop languag show featur describ wide rang agent reactiv agent architectur ration agent cognit agent architectur bdi knowledg manag environ agent handl time instanc deadlin auction protocol time manag simpl context agent present environ facil environ reactiv agent situat agent current kind environ repres environ agent jump case case case repres portion environ reactiv cognit interact consid reactiv interact pheromon trough environ design primit modifi environ ad inform cognit interact exchang messag provid set primit order send retriev messag ensur connect agent design repres directli protocol automata petri net notion organ design repres primit languag languag exist exist develop agent multiag system imposs exhaust give exampl languag class languag languag languag follow approach golog congolog base prolog languag develop reactiv robot jack languag interest logic part prolog program part java prolog logic program languag design quot linear logic tempor logic concurr metatem quot base bdi logic program languag class program languag repres classic program languag develop agent multiag system quot lisp smalltalk actual languag java doubt program languag develop agent multiag system java advantag remain larg librari function cover domain concurr secur easi insert function java java interest develop agent multiag system section present java characterist java plenti program languag order develop agent multiag system java attract peopl agent commun check java compar languag consid quot languag abandon consid list characterist present function program type variabl arrai loop abstract data type time manag except assert mutual facil synchron extens languag program notion languag readabl semant easi easi learn tool read list featur understand languag appeal multiag system design solut java gener encompass agent featur remain section explain featur java provid agent primit easili implement java design packag function link multiag system class primit jdk abstract abstract mechan method design access method built modifi modifi code method bdi troubl notat write java modal method write commun featur easili java java write internet applic commun facil provid support maintain characterist abstract data type method conform featur directli link languag jade exampl platform conform standard fipa java abil mix characterist realiz abstract data type method formal text organ environ featur realiz structur method realiz activ environ inform agent event occur java object observ read comparison characterist java perfectli featur problem program languag java attract simpler augment languag provid java rich librari function beat java solut agent languag present java written develop agent oblig agent level object level write agent joe public class joe extend thread principl organ environ solut opinion provid program languag advantag java librari insert agent abil languag java design program agent decomposit advantag java method compil program consist translat program java program compil program languag attract design habit learn languag readabl easi languag forget design softwar engin strong background classic program languag explain java languag develop multiag system aim paper present set characterist agentori program languag present featur divid featur present classic program languag agent featur characterist provid design languag cover wide rang multiag system reactiv agent ration agent java program languag develop multiag system interest check java characterist featur deal concurr program languag present agent featur miss featur easili implement java java oppon program languag solut advantag java rich librari function add level java deal agent featur compil program agent featur consist translat agent featur java code compil java code approach interest follow problem model check java program infanc properti multiag system import guess execut multiag system refer al amin program linear logic master depart comput rmit octob luca jack intellig agent compon intellig agent java technic agent orient softwar drogoul de la simul la collect de de de structur dan le phd universit pari formal electron page number lectur note intellig inform page announc fisher wooldridg formal system intern journal cooper inform jade inform page describ multiag coordin protocol inherit seventh ieee intern confer tool page novemb jenkin reactiv robot program scherl logic program languag dynam domain journal logic bauer extend uml agent inform system workshop nation confer icu publish dill java model check autom softwar page rao model ration agent bdi architectur fike knowledg reason page san morgan kaufmann publish shoham simpl agent languag interpret ninth nation confer distribut java program intern journal softwar tool technolog park model check program intern confer autom softwar septemb ramamohanarao design concurr agentori languag wooldridg intellig languag volum page logic program linear logic phd wooldridg reason ration agent mit parson model check multiag system autonom agent system juli
ML/402 6 movement classif humanoid imit maja stefan weber depart comput southern lo angel ca abstract motor control complex problem imit power mechan acquir motor skill describ notion basi set perceptu motor routin primit serv vocabulari classifi imit observ human deriv motor repertoir describ model imit base primit demonstr feasibl model constrain implement present approxim motion reconstruct gener visual captur data typic imit task athlet introduct imit power mechan acquir skill involv intric interact perceptu motor complex research vision motor control explor role schema variant base notion organ complex perceptu motor repertoir smaller set reusabl modul coupl visual percept motor control remain major challeng robot combin notion perceptu motor routin primit notion base recent neurosci evid identifi mechan directli coupl observ movement motor execut primit serv analog basi set structur motor control vocabulari classifi imit observ movement describ model imit base primit demonstr feasibl model constrain implement present approxim motion reconstruct gener visual captur data typic imit task athlet rest paper organ section discuss role primit humanoid imit outlin properti primit section overview work relat imit section describ imit model section present implement constrain version model imit humanoid torso state object implement state section implement control dof physic simul discuss section result experi imit set input motion inspir danc present section issu limit model discuss section paper conclud section role primit imit highest primit defin set motor control set perceptu descript motor control constrain kinemat dynam properti motor commonli perform task motor control deriv descript observ movement facilit motion percept motor control manual current work complex motor behavior result sequenc superposit primit model base evid structur mirror coupl movement visual input discuss detail develop notion primit unifi mechan perceptu motor influenc constraint primit encod invari exact cartesian rate parametr perceptu motor compon perceptu compon classifi spectrum vari relat movement motor control execut similarli larg spectrum motion primit fig diagram set primit arrow impli relationship base biolog assum agent motor repertoir consist set sequenc creat complex behavior deriv set motor control agent primit set control sequenc creat similar set complex set perceptu descript gener agent movement execut consist automat classifi observ movement set result movement term primit motor control compon execut imit observ movement inspir imit requir exact quantit measur observ movement achiev aim function behavior approxim observ movement structur motor perceptu system neurosci evid lend support organ motor system form small set addit behavior frog rat motor system organ small order set converg addit spinal vector field motiv structur motor control model small set parametr control order modular simplifi control articul kinemat structur high number humanoid set motor control set primit creat map assum complet parametr motor set primit necessarili subset motor control map control primit primit provid descript movement properti descript give motor control small number gener primit repres larg class movement approach stand contrast explicit motor plan comput trajectori motor stereotyp trajectori specif task comput de kinemat dynam comput kinemat comput costli notion small set basi behavior learn approxim kinemat specif area workspac specif trajectori set local valid solut problem store recal approach simpler mechan comput kinemat anew time unlik learn reconstruct requir larg amount primit intend parsimoni neurosci evid report mirror area motor cortex trigger execut specif respond observ movement execut inspir lead assum movement percept system movement control repertoir perceiv execut perceptu compon primit made correspond type movement motor execut good set primit kei import approach work explor learn set primit describ implement manual deriv primit instanc actual motion section relat work notion primit inspir neurosci appli motor control mobil robot form schema work form basi behavior unlik previou perceptu motor present mechan combin inspir function mirror neuron natur mechan imit kei properti primit direct coupl percept motor execut relat notion comput theori format recognit aspect singl function relat work base trajectori motor control trajectori simul function motor control primit set notion relat movement primit explor brand edit motion captur data bregler form label human motion unseg video stream demonstr task specif view type imit studi area seri visual imag human perform object stack task repeat robot arm major focu work perceptu part segment visual stream interpret demonstr prime provid initi polici greatli simplifi learn process appli method reinforc learn system task pole balanc dof robot arm work mobil robot directli relat underli mechan biolog imit emploi imit mechan learn mobil robot maze navig connectionist architectur learn commun skill similar domain architectur expand appli imit human arm movement humanoid avatar learn head movement imit popular task approach visual featur inform system directli map set observ head movement movement visual compon system similar featur detector direct map emploi kind primit imit model describ detail model imit primit model consist main actuat compon divid action figur illustr structur model percept consist track serv acquir prepar motion inform process primit encod layer track compon extract motion featur time perceptu input choic primit set constrain type inform extend type inform provid track compon complex compon locat inform primit set gener learn compon provid descript appropri repres type motion fig imit model attent compon select relev inform perceiv motion stream order simplifi classif learn compon select process perform situat observ input set significantli move featur salient kinemat substructur attent model appli begun work problem classif learn encod layer model encompass classif classifi observ motion primit facilit segment learn compon serv determin refin set primit classif compon updat set primit movement encod classifi mean segment time base presenc primit observ motion address issu encod layer repres motion segment amen classif learn motion segment requir chosen provid mean segment movement data invari appli account variat posit scale final issu chosen consist compon layer encod layer output action list time segment repres motion set constraint creat motor control primit primit set list segment import describ interv time primit activ action final consist singl perform imit execut list segment provid classif compon primit control provid control command combin motor actuat design control area research note motor control compon primit manual deriv learn parametr form develop mean learn primit directli movement data address issu dissimilar kinemat perform imit imit system implement fig layout system implement imit model base model implement system imit behavior human perform observ video input actuat humanoid torso simul implement constrain instanti imit feasibl valid figur outlin setup implement context imit model framework classif match arbitrari motion set primit foundat primit current implement model design function classif compon emphasi compon system fulli implement accord model capabl compon simul limit achiev function model relat model implement percept motion data acquir motion track system develop stick figur upper bodi track featur fix posit shoulder output track system shown figur locat inform potenti motion incorpor implement data model featur orient inform includ fig snapshot output track snapshot humanoid attent compon implement assum arm import extract featur motion motion hand base work demonstr human tend focu motion visual observ arm movement descript motion relat movement cartesian space implement flexibl attent modul extract set significantli move featur determin substructur rigid movement kinemat perform complex output modul complex implement modul encod layer implement describ address learn primit set manual deriv set primit base simpl shape serv potenti output learn compon classifi compon vector quantiz quantifi window motion set detail section repres segment motion vector posit gradient chang posit featur frame output classifi compon list segment segment list specifi perceptu descript match observ movement interv time classifi model return list segment describ time interv execut perceptu descript observ form list segment provid classif serv activ motor control set primit interv time gener control difficult subject current research order simul descript primit list classif segment conjunct gener trajectori arm arm control develop deriv primit manual acquir primit descript actual motion section minim geometr set consist arc straight line inspir describ reach movement hand circular movement correspond close path cartesian space arc correspond open circl portion complet project trajectori descript vari order facilit classif path repres trajectori approxim set geometri primit set choic demonstr feasibl model primit set gener automat learn modul repres train motion address automat gener primit set principl compon analysi goal implement implement demonstr feasibl primit quickli gener approxim behavior articul charact implement determin inform suffici behavior imit data system provid insight util control provid develop motor control set motion fig subcompon interfac classifi state common motion modul encod layer straightforward simpli locat trajectori sensit variat posit scale relat motion motion layer repres normal gradient trajectori motion equat describ motion arrai normal frame ø å ø å ø ø å ø gradient length segment motion segment view point euclidean space motion compar comput distanc point space space comparison oper implement comput set distanc pair gradient equat magnitud vector gradient differ comput distanc ê equat segment length longest motion segment segment space classif ù ø ê ð figur show view classifi classifi input set perceptu denot è stream denot á è repres descript comput learn modul perceptu descript è repres arrai normal gradient motion trajectori motion trajectori creat descript è gener video sequenc human perform execut movement repres primit arm simultan human perform gener primit descript human roughli kinemat dynam tabl list action execut perform train video sequenc relationship set primit train video sequenc manual segment isol instanc motion repres perceptu descript perform track attent process train video set trajectori å form motion segment time interv manual segment uniqu identifi time interv motion segment train perceptu descript defin ø ø ø ø ø progress time repres offset begin motion segment figur plot set normal gradient perceptu descript primit descript determin yield primit left descript descript descript arc action train motion extract primit descript vertic reach upward line downward line horizont outward reach outward line line diagon outward reach diagon upward line diagon downward line larg circl larg circl small circl small circl figur instanc arc tabl correspond train motion manual determin primit descript perceptu descript primit è stream input encod primit set classif classif algorithm base approach vector quantiz present step classif determin primit instanc input motion á serv measur presenc primit input motion time denot ø perceptu descript time comput length input motion comparison oper section ø comput convert motion á interv ø ø á window motion length perceptu descript perform comparison oper convert window motion comput procedur summar ø è á state oper motion segment comput dissimilar measur segment oper reciproc make measur similar oper result multipli length descript weight account descript vari assum probabl match longer descript lower match smaller segment measur capabl shown figur peak figur accur correspond manual chosen segment perceptu descript set signal ê comput signal activ primit descript é maxim ä respect time ê ø specifi similar primit descript incom motion á time ø classifi motion á time descript fig set normal gradient space primit consist arc instanc left order ê ø time movement left manual determin primit set left column present left arm perceptu row repres line primit row circl row arc instanc maxim similar measur ä ø ø é ø ø ø è result comput é ä train motion shown figur connect compon routin group similar adjac classif base é adjac instanc time ø ø group é ø é ø group interv execut match descript occur result group oper segment input motion express list segment í segment start end time index descript execut segment figur clutter provid segment occur result poor match time transit valid segment approach problem determin segment import í comput weight confid segment threshold appli weight valu base percentag maximum weight approach yield satisfactori optim eleg solut segment weight comput length segment time sum valu ä time interv ä maximum segment weight store ñ segment consid valid weight greater fraction threshold elimin invalid list ï valid segment form figur show stair step plot list valid segment comput train section figur show comparison valid segment individu reconstruct implement fig result classif train motion left arm plot maximum valu activ perceptu descript left respect time plot identifi index activ indic separ cross circl triangl arc plot left arm threshold valid segment reconstruct actuat execut motion perform invok motor control control command segment result classif current simul function overlai primit descript reconstruct trajectori basic procedur reconstruct place sequenc normal gradient posit time rel input motion normal sum set gradient occur instanc time summat gradient handl tempor overlap segment initi posit input run sum overlai gradient gener trajectori posit transform locat imag coordin proper scale humanoid trajectori control figur approach reconstruct captur essenc input motion train execut circl arc form easili observ scale translat aspect input motion properli account procedur aspect motion lost invari scale translat introduc encod layer basic procedur modifi incorpor limit inform input motion stream reintroduc posit scale properti reconstruct trajectori segment ï interv time segment posit begin á bound box posit interv comput start posit translat offset gradient segment procedur similar reconstruct function ü taylor approxim ü assum frequenc sampl track system fast subsequ term taylor seri length width comput segment bound box determin scale factor gradient segment inject reconstruct reconstruct input motion shown figur gener form overlai oper ì ì vector gradient ë matrix vector gradient scale è vector posit offset state reconstruct vector gradient ì convert procedur procedur simpli maintain run sum gradient record locat result ad gradient sum reconstruct vector transform proport simul specif ratio length arm posit shoulder control execut reconstruct motion actuat detail control strategi movement desir point cartesian space gener forc base virtual spring damper model appli equilibrium point type control serv avoid costli kinemat comput paramet requir desir locat desir orient upper arm reconstruct provid desir trajectori hand desir upper arm orient set constant postur perpendicular bodi parallel line shoulder fig reconstruct trajectori train trajectori space reconstruct basic procedur initi segment posit bound box scale factor evalu video track system input inspir captur captur motion tabl input motion implement imit subsect describ method evalu result imit system error entir motion idea mind evalu effect system comput differ input reconstruct trajectori differ comput root squar error rm error serv estim standard deviat trajectori evalu rm error comput left endpoint input motion test motion set trajectori gener imit system distort origin input motion distort gener ad random motion alia descript throw perform move full arm extens waist level locat head commonli sport perform start waist level oscil outward gradual move upward arm perform height head waist level continu altern locat perform place shoulder height waist height bent elbow move direct similar veloc popular danc lin roof linear version roof perform linear oscil shoulder typic form celebr tire athlet roof circular version roof perform circular motion shoulder result roof motor coordin tabl descript input motion set offset compon posit trajectori motion invok random gener real number ý level distort comput distort ø ø á ø input motion distort á level evalu distort result shown figur error segment error entir motion trajectori combin error reconstruct individu segment result reintroduc aspect translat scale evalu measur comput rm error reconstruct individu segment ï trajectori á interv time figur show reconstruct individu segment train motion figur show result comput rm error motion input set distort train motion level throw motion incur worst rm measur plot figur visual adequ segment valid distanc metric evalu segment evalu figur determin segment valid valid segment segment correctli identifi classifi classifi return amount posit return neg actual evalu manual determin return segment motion true posit result accumul determin shown figur train motion return true posit extract primit throw motion imit perform contrast result rm error futur evalu procedur human evalu test motion believ vari level evalu procedur involv introduc distort train motion imit system present input motion level segment shown figur manual segment origin motion shown upper left box segment stair step structur perceptu descript index order train sequenc structur detect train motion appli level neg posit structur segment appar shown plot ad gradual remov abil return true posit number distort structur segment degrad detect fig plot evalu entir motion rm individu rm individu segment valid segment structur consist individu segment rm error shown figur rm error greater distort reflect magnitud segment structur decai discuss model imit constrain implement valid model state section object implement merit discuss implement demonstr abil system quickli approxim observ classif reconstruct shown figur current imit system exhibit potenti control base primit solid metric evalu perform qualiti result imit difficult assess goal believ imit present evalu procedur appli set input motion procedur base automat comput root squar error provid insight abil imit inher concentr exact reconstruct input motion limit abil incorpor behavior similar motion reconstruct throw motion evalu poor rm gener believ reconstruct examin reconstruct figur valid segment reconstruct yield good imit evalu poorli metric due differ scale analysi segment valid determin posit neg potenti reliabl metric appli human evalu method fig reconstruct individu valid segment space train motion left solid dot curv plot path origin reconstruct incur accompani empir gener work method evalu limit segment direct impact qualiti imit outcom evalu procedur segment valid procedur present correct practic mean elimin irrelev classif problem valid procedur threshold segment weight perform rel weight highest weight segment limit make difficult segment motion endpoint move significantli motion segment standard elimin segment irrelev segment identifi valid part problem address introduc primit repres stop motion primit gener stereotyp account rang motion simpl connect compon routin segment process group time interv base adjac ident classif segment repres occurr perceptu descript segment repres occurr singl perceptu descript account mechan implement perform split dissimilar segment part merg segment current work begun address mechan split merg motion segment detect segment make split merg process unnecessari detect actuat primit descript great challeng face full realiz imit model current simul behavior actuat address detect descript begun approach detect techniqu individu segment signal inform behavior implement human arm inform suffici task consid inform suffici system set primit descript make substanti claim complex kinemat structur possibl conflict control command implement easili adapt perform imit capabl address problem incorpor multipl continu work attent compon model explor primit motion involv object manipul reaction physic environ control viabl basi primit chose control reach movement base inspir human movement studi control provid accept result implement control system provid erat accur reconstruct trajectori exact reconstruct actuat perform control system suffici primit control approach mean control due natur spring damper model suit primit linear suspect control provid mean combin control command motion current implement handl sequenc primit partial attribut abstract natur minim geometr primit set method classif learn primit motion set classif subject current research summari continu work method acquir motor skill imit approach base neurosci cognit scienc data organ perceptu motor interpret result specif specif method describ intend model biolog process model present current statu effort imit improv line pursu develop version video motion track mechan evalu method automat extract perceptu altern present continu work address map perceptu motor compon primit past work develop altern motor control perceptu result present richer solut appli present imit model larg batteri gener train data order learn sequenc superposit primit encod complex skill danc video compar human track actuat movement inform vision visit acknowledg work support usc fellowship nsf career grant maja foundat grant stefan weber sarah effort video refer arbib schema theori encyclopedia page ronald arkin motor schema base navig mobil approach program behavior proc ieee intl conf robot page april ronald arkin robot mit arya mount algorithm fast vector quantiz proc data compress page ieee comput societi atkeson approach approxim continu function sixth yale workshop adapt learn billard connectionist architectur control learn autonom robot adapt billard biolog inspir robot model learn imit autonom page comput underli execut biolog perspect bock data analysi brand style machin proc acm siggraph page bregler learn recogn human dynam video sequenc proc ieee confer comput vision pattern kuniyoshi defer imit human head movement activ stereo vision head ieee intern workshop robot human commun ieee press flash coordin arm confirm mathemat model journal jenkin autom deriv primit movement classif proc intern confer humanoid simon converg forc field organ spinal cord journal multipl model human motor learn control advanc neural inform process system mit robot control learn imit intern symposium intellig robot page skill acquisit human demonstr hidden markov model ieee intern confer robot page assembl task recognit mechan contact ieee intern confer robot jenkin attent select mechan move human figur technic report institut robot intellig southern kaiser transfer elementari skill interact adapt inou learn extract reusabl task knowledg visual observ human perform ieee transact robot exampl group behavior journal theoret artifici fixat behavior observ imit human movement cognit brain maja primit basi link action biologi robot imit anim artifact mit maja matthew complex behavior simpl primit organ simpl rule global european confer artifici life page maja victor matthew williamson make complex articul agent analysi control method drawn biologi autonom agent march simon linear combin primit vertebr motor control nation academi psycholog attent mit paul robot control mit evalu metric result human arm movement imit proc intern confer humanoid cortex recognit motor action cognit brain schaal learn demonstr advanc neural inform process system page mit smith kathi bodi basic schaal kinemat humanoid robot ieee intern confer robot san eric comput theori movement pattern recognit base optim movement pattern gener biolog weber simpl human torso track video technic report institut robot intellig universit southern jenkin imit primit autonom page fig upper left plot show manual segment train motion primit descript left success plot left top bottom show result segment valid distort level fig row figur provid segment result classif reconstruct trajectori set test motion segment plot indic perceptu descript row show result arm altern version
ML/403 6 learn refin case initi result david aha leonard breslow navi center appli research artifici naval research dc abstract reason increment extract queri descript design larg case librari good perform queri difficult cbr vendor provid guidelin design librari guidelin difficult appli describ autom induct approach case librari conform design guidelin perform case librari introduct context workshop entitl classif featur paper contribut machin learn method assist design case librari librari design solut retriev classif case uniqu solut case defin featur vector typic intersect set featur defin arbitrari case paper knowledg refin unlik previou focu knowledg base case rule specif context research cbr infer cbr commerci success approach support task system conduct user answer question case descript repres end user select rank hope solut sequenc solv problem denot queri figur displai case print case librari engin maintain displai rank list case descript similar rank list unansw question user select limit short rank list updat time user select answer question figur displai list question question answer synonym featur case incorrect interfac cabl question printer print displai problem line indic print configur correct interfac replac incorrect cabl correct case print wrong side paper question print qualiti print qualiti white spot print correct side turn paper print side fig case print case librari rank list question line indic displai print data print configur comput port work correct interfac rank list printer line incorrect configur comput port set incorrectli incorrect interfac cabl fig rank list question case queri printer print target case incorrect interfac cabl printer print test problem incorrect interfac cabl figur list rank question relev target case rank relev question target case difficult retriev correct action problem case librari carefulli design yield high user retriev case solut solv high queri effici question answer correct case hierarchi librari case hierarchi editor case librari edit hierarchi extractor case design guidelin hierarchi induc fig case librari process commerci vendor suppli guidelin design case question question ensur good guidelin difficult implement complex librari compani invest costli consult servic altern technolog describ evalu approach implement system librari assist case author librari improv conform set design intent improv perform section describ approach summar section describ initi applic discuss relat futur research section case librari figur summar approach case librari induc hierarchi reveal librari structur enabl case edit assist conform guidelin design version induc singl tree approach figur split criterion gain ratio assum case cluster select frequent occur question node ns case split provid isnt split ns ancestor partit subset answer subset case answer case pass node process carefulli distinguish case sibl queri subset pair share case distinguish case prevent good question good case rank prevent problem promot question case sibl pass case inact case activ case partit distinguish inact case process case multipl leav current implement edit case featur select process reminisc cardi oper basi delet question answer path root node leaf case set case case librari set case distinguish set case distinguish activ question ancestor node intern node select top level induc induc stop return make nq select nq foreach cq ag cq ag induc activ cq mean activ inact cq inact activ inact activ activ inact induc inact return fig pseudocod extract record question answer path order question averag node depth process address librari design distinguish rank question abstract elimin question distinguish minim number question promot question case guidelin distinguish context partit case logic confirm typic answer case expect user answer context question printer print answer confirm question print correct side support guidelin assum context question higher usag select higher node context question tend rank confirm question case satisfi guidelin queri context question discrimin featur select mechan address guidelin initi empir evalu evalu simpl implement determin process improv librari tabl case librari experi origin print queri effici queri guid select answer base target case descript librari perform task involv select similar case solut percentag yield case solut action solv target problem retriev occur rank question includ target target case question similar case similar number match minu mismatch divid case similar threshold queri effici number question retriev lower number denot higher effici test case librari summar tabl print printer failur simpl librari provid infer product obtain port technic assist maintain vertic missil launch system circuit citi answer citi design support branch store personnel librari fairli problemat proprietari reduc number question clear sacrif effici test origin librari resembl primit cbr simul human user rover cycl print librari select case turn larger randomli select singl set case rover experi engin retriev entir case librari vari number case number question displai valu set total number case question assum case effici small valu variabl greatli reduc reduc probabl relev case question highli select prematur termin case select action solv queri problem set intermedi valu investig rover simul cbr express textual descript priori suppli top answer queri initi question rank reflect answer question target case test tabl perform result standard deviat librari origin effici effici print report seed affect rel perform summar tabl averag ten run ti rank list order randomli broken report standard deviat test result inform circumst relat futur research evalu test case librari extract case hierarchi improv case librari perform result show librari improv queri effici repres undergo extens prolong manual year due complex librari design mainten share case librari owner receiv strong encourag continu research evalu investig deliv perform improv case librari recent investig issu modifi case librari wai pair case perform featur select process section ablat studi isol learn featur select primari perform question effect occur rover approach evalu case librari perform suffici mimic human behavior incorpor answer select question answer target enhanc version rover demonstr util good order case found public discuss librari improv retriev perform research context queri deriv increment tan schlimmer increment evalu featur robot task featur goal minim featur cost maxim classif accuraci approach select featur evalu maxim ratio expect match success cost smyth cunningham increment cbr approach context featur evalu cost fix nonzero cost step cost featur retriev subset case match queri dynam gener tree induc featur maxim inform gain distinguish remain case unlik process approach tree case indic benefit approach task featur evalu nonzero cost approach case exist fox leak approach select altern indic case plan task research introspect analysi case indic easili adapt case effici measur context tradit cbr context approach work entir librari knowledg specif retriev failur benefit process modifi case indic problem process unknown valu tree cbr studi al context project describ integr cbr tree induct methodolog question automat select read induc manner process default cbr approach select question answer unknown tree guid tree case engin engin develop expect yield similar perform improv commerci system method comput featur weight split function evalu question discrimin power examin rover paramet simul human user systemat vari select user frequent select current approach knowledg domain specif knowledg tune engin plan test system condit yield realist public describ evolut methodolog case librari aha introduc gener approach paper describ initi evalu system librari aha breslow describ extend includ ablat studi isol reason improv retriev perform set case librari research case author motiv commerci difficult build complex case case author guidelin approach simplifi autom softwar valuabl approach anticip futur research reveal elabor effect mean case librari support case author process cbr system acknowledg ralph john scott gene provid librari experi feedback salli jo cunningham feedback organ attent comment greatli improv paper research support offic naval research refer refin case librari bergmann wilk german workshop cbr depart comput scienc refin case librari report naval research navi center appli research artifici intellig tree improv learn tenth icml morgan kaufmann featur select lazi learner artifici intellig review introspect reason refin index fourteenth ijcai morgan kaufmann induct reason case european workshop cbr chang approach theori refin eighth aaai press program machin learn san morgan kaufmann comparison increment cbr induct learn work paper european workshop cbr unpublish case studi concept acquisit eighth aaai press methodolog evalu theori result ii thirteenth ijcai morgan kaufmann articl process macro packag llnc style
Agents/404 1 agent uml robot soccer jan murrai informatik universit institut ur rheinau koblenz agent uml robot soccer jan murrai institut ur informatik universit rheinau koblenz abstract agent multiag system widespread comput scienc nowadai method agent clear simpl manner paper approach agent uml statechart agent level abstract addit method multiag plan explicit cooper shown domain chose robot lai basi annual robocup competit robot soccer ideal testb research field robot multiag system robocup simul leagu research focu laid agent multiag demonstr approach exampl domain multiag unifi model languag robot soccer introduct agent technolog multiag system gain entranc branch comput scienc propag technolog standard design techniqu arisen research support grant fu german research foundat dfg order gain wide accept agent specif design procedur fulfil constraint avoid ambigu design agent formal easi understand addit applic formal method support specif mechan call formal semant specif formal paper present approach agent design base uml statechart approach behavior singl agent level multiag plan uml statechart meet requir state statechart mean describ behavior system extern event graphic notat intuit easi understand addit uml specif model languag wide accept specif uml statechart provid formal work aim verifi properti uml transform agent specif run code straightforward limit space paper discuss implement interest reader refer choic soccer domain natur soccer team test bed multiag system high dynam game make fast reason quick reaction robocup simul environ annual benchmark robocup competit overview paper paper organ section short introduct robocup initi simul chose present simul leagu soccer server detail show environ agent act section shortli summar uml statechart formal focu laid part formal emploi specif agent section introduc approach agent specif uml specif level abstract special attent laid specif multiag plan section final conclud paper result overview relat work final remark robocup robocup ongo initi bring research field artifici robot multiag system domain chosen testb motiv soccer leagu real simul robot plai annual competit addit competit robocup includ technic session teach simul leagu robocup simul leagu research focu laid topic relat agent multiag system team consist autonom agent connect call soccer simul soccer match soccer server discret time model ms time advanc simul step step client execut action send command server class command major command turn move client kick ball command cycl addit minor control vision sensor commun minor command server simul step simul sensor data client interv depend current set sensor act asynchron set commun agent soccer server agent send messag fix length broadcast agent distanc commun channel insecur suffer low bandwidth discret time model fact command execut soccer server end simul step suggest execut cycl shown figur agent control program begin simul step agent updat world integr sensor inform current belief estim effect action sensor data base updat world model agent select major action execut minor action end updat begin simul step end simul step execut action select action figur execut cycl agent control program cycl select action soccer server execut execut cycl agent control program start anew figur cycl shown dash box begin end simul cycl part agent control program uml statechart behavior sequenc state system depend extern event system state chang accompani execut action unifi model languag state machin model behavior aspect system state machin graphic notat state transit diagram case statechart statechart extens classic state transit diagram basic direct kind node repres state edg stand transit label edg describ properti transit contrast classic std statechart possess state statechart state state machin statechart hierarch std briefli summar part uml statechart formal emploi design agent state transit uml state consid period life condit hold activ perform agent remain state wait extern event occur statechart state repres box round corner state system chang reaction extern event chang state call transit transit string behavior transit transit string tupl set set boolean express domain set action transit defin tupl denot arbitrari state transit string form semant system state event occur condit system execut action state statechart diagram transit shown direct edg label form composit state figur statechart state uml statechart formal type state exist statechart hierarch uml distinguish major class state shown figur simpl state atom possess intern structur assign kind behavior simpl state defin intern transit composit state state intern describ activ composit state concurr state figur concurr state region concurr state special type composit state concurr state composit call region agent concurr region simultan concurr state model concurr activ system agent shown figur state varieti type state syntact sugar statechart readabl synchron synchron concurr activ statechart typic good produc agent consum consum produc synchron obviou scenario statechart figur show scenario part type produc agent agent assembl compon abc synchron concurr state handl synch shown circl resid dash line separ region transit leav synch state enabl transit enter synch state fire synch state label posit integ give upper bound number time incom outgo transit fire upper bound upper bound part type consum transient simpl system remain left delai respect behav simpl state includ part includ part assembl part produc part produc consum figur scenario model statechart histori state special type histori drawn circl label state composit state made rememb activ substat histori state model kind subroutin call interrupt interrupt transit composit histori initi state activ state activ statechart left time context agent design correspond nice continu interrupt behavior agent statechart special initi final state initi state point design start state state machin state machin enter initi state enter transit explicitli lead state machin composit state initi state directli state machin final state state machin activ model machin finish case special call complet event design agent uml behavior agent sequenc state agent state correspond activ agent execut agent wait happen environ behavior agent level abstract make design agent manner task behavior abstract level refin abstract behavior import featur multiag system cooper agent achiev common goal solv problem agent plai role share execut behavior solv part problem support agent role multiag plan model sequenc state agent pass partial event import differ design behavior singl agent role agent multiag plan agent work achiev behavior complet independ time execut concurr point multiag plan synchron individu behavior agent agent work agent wait agent finish subtask layer approach design agent robocup simul leagu specif implement agent level global layer highest level mode level global pattern behavior thought abstract desir agent attack handl standard situat corner kick abstract desir correspond state agent refer mode mode agent repertoir skeleton plan long chang mode specif plan script assign global state constitut level agent design level explicit specif cooper multi agent behavior realiz lowest level hierarchi simpl complex action agent execut skill script level expand higher level result design process layer specif agent shown figur rest section uml statechart emploi specif agent approach section explain high level specif subsequ section deal design singl agent behavior multiag plan skill level address mode level script level skill level script script script script mode mode skill skill skill skill figur layer architectur agent briefli section level addit interest topic design agent part section deal addit uml statechart agent specif mode level robot soccer agent frequent switch behavior abstract level agent defend depend team control ball global behavior happen extern event state agent event condit lead chang state agent model call abstract level simpl soccer plai agent behavior agent team control ball assign free kick agent attack oppon team gain control agent switch behavior half period team line posit player initi posit recur situat fix activ model figur show result soccer team line field game setup state chosen initi state game agent enter final state activ attack defend setup team ball team lost ball line line game game kick simpl player figur simpl player script level abstract desir agent achiev abstract desir agent equip repertoir short local skeleton plan handl situat mode agent access subset depend situat mode agent defend make script call ball agent enter defend mode team control ball script agent fall back pure default behavior main problem past approach script lai rigid plan script select hard interrupt abort uml suit kind specif execut script mean execut sequenc depend outcom previou activ simpl state uml script easili repres composit statechart includ composit state script state enter design state repres begin activ left varieti point outcom script interrupt script world easili model transit origin edg composit state pass script shown figur agent select teammat kick ball coordin teammat final kick ball coordin agent find teammat pass lose script abort agent lose ball activ model transit handl event origin state repres script partner activ fail agent find transit start substat model activ partner kick lost ball partner pass ball figur script pass multiag plan shown model script behavior singl agent uml statechart multiag state multiag plan script agent act simultan order achiev common goal point activ synchron addit requir concurr synchron easili model concurr state multiag script concurr state region role class plai agent activ carri agent model synch state clarifi situat figur agent control ball past oppon plai doubl pass agent pass ball teammat run past oppon teammat dribbl ball pass back handl situat agent equip multiag script role correspond behavior agent run kick figur doubl pass scenario concurr state model script shown figur simpl state script correspond activ print ital descript synchron pass ball object pass agent agent continu role respect posit possess synchron evid timeout execut model transit label mean execut script termin simul step case script fail transit model interrupt doubl loss easili ad edg doubl pass state model script aspect omit synchron clarifi activ synchron role plai agent intern state mean provid enabl agent determin partner reach synchron point addit agent plai role script time specif agent control program base model script individu role add step specif multiag behavior role deriv script state yield agent state basic dash role script model region concurr easi specif agent behavior base region process time agent behavior independ spot requir special attent synch state pass readi run dribbl readi pass doubl pass pass oppon partner pass oppon figur multiag script doubl pass synch state model synchron synchron realiz uniqu handl synchron deriv agent design decid issu case requir synchron chang guard condit occurr event agent explicitli gener commun intern state transit model interrupt error script state transit start edg composit copi edg agent state repres role script event guard enabl agent notic situat arisen execut script determin role script continu doubl pass script consist agent state shown figur synchron ball transport player recipi continu execut behavior control ball kick agent observ event involv knowledg intern state synchron easili handl put guard respect transit prevent transit fire ball recipi pass transit model timeout script copi edg agent indic agent termin doubl pass cycl failur determin role agent plai script handl possess ball readi dribbl pass pass oppon partner ball pass run readi pass oppon ball doubl pass role doubl pass role figur deriv agent state doubl pass skill level soccer server kind major minor action action agent interact environ simul cycl major action catch execut addit number minor action soccer server step includ turn chang view server command abil agent interact environ limit procedur function provid sophist abil agent bottom level robocup team reli heavili knowledg world model soccer call skill qualiti import success team skill transfer player team member skill agent close world model clarifi real soccer player dribbl run ball seri control kick robocup scenario dribbl model sequenc kick dash dribbl skill agent gener sequenc turn kick command ball control run posit figur show statechart describ simplifi dribbl skill transit label lead error handl routin dash kick calcul dribbl lost ball figur simpl dribbl skill viewpoint agent model skill level add techniqu model skill pretti model singl agent behavior skill model sequenc correspond execut agent activ finish extern agent chang state leav statechart activ analogu multiag skill abil agent addit statechart section show uml statechart agent specif event world high agent react occurr event soccer domain event agent posit field lose track ball event agent react interrupt current behavior local search ball interrupt behavior continu uml scenario model histori state statechart model primari behavior mode left high prioriti event state activ trigger event enter primari statechart histori interrupt behavior automat resum agent perform simpl recur continu task parallel main activ activ independ main process model execut parallel model addit concurr activ concurr state agent specif state region describ agent main activ model concurr task agent robocup scenario subordin activ announc agent world model agent announc part world model interv order enhanc teammat belief world primit form sensor fusion establish figur schemat present specif agent uml statechart primari behavior agent region call mode chart addit behavior region combin region entitl concurr activ interrupt model histori state section close paper conclud remark give result present overview relat work final summari outlook present concurr activ agent mode chart high prioriti event react event figur schemat specif agent result implement team robocup simul leagu approach implement team strictli specif mode script uml statechart actual implement prolog api koblenz team particip robocup world cup base state machin explicitli built transform specif implement script team prove competit team finish upper robocup world relat work design multiag system uml agent orient softwar engin add level abstract process model softwar system agent treat agent atom unit model multiag system interact agent present agent orient diagram describ aspect multiag system agent level diagram standard uml notat ontolog gram special form class diagram repres class entiti ontolog relat support commun architectur diagram emploi class diagram model heterogen multiag system term agent class relat uml diagram emploi model instanti class multiag system architectur diagram protocol diagram base collabor diagram role diagram special class close connect protocol diagram model permit interact agent role diagram model role plai agent interact approach aspect interact agent model agent treat atom entiti contrast approach model interact agent describ behavior singl intern agent addit formal task agent uml number extens uml model multiag system interact agent auml layer approach interact protocol agent present level uml extens thereof emploi top level pattern agent interact protocol sequenc diagram situat pattern instanti concret agent particip role plai level model interact agent greater detail end varieti uml diagram emploi sequenc diagram collabor diagram readabl describ agent interact protocol detail activ diagram statechart level aspect specif lowest level process implement interact protocol extens activ diagram statechart extens role meant improv readabl diagram model interact agent continu approach introduct protocol diagram extend semant agent messag improv protocol contrast agent approach formal describ behavior multiag system addit extens exist formal uml made uml util function approach present work combin util function usual transit event replac prefer function return prefer agent execut action current belief expect util action flexibl procedur realiz summari outlook paper present approach specif agent multiag system uml statechart approach aspect formal public uml softwar engin understand specif support accept approach demonstr feasibl procedur exampl domain robot soccer ad result futur work includ investig present method appli applic step direct addit design process put rigidli formal basi enabl appli formal method agent design reason interest properti specif verif thereof refer arai frieder stolzenburg multiag system specif uml statechart aim intellig manufactur bernhard org jame odel agent formal multiag interact paolo michael softwar poggi exploit uml design system engin societi agent page johan iv semant uml state machin technic report turku centr comput jan murrai soccer agent uml universit jan oliv frieder stolzenburg koblenz andrea robot soccer itsuki noda soccer simul robocup object manag model languag septemb version oliv ration agent statechart util function andrea robot soccer oliv jan marco frieder stolzenburg soccer server interfac universit jame van bauer extend uml agent proc inform system workshop nation confer artifici intellig aaai frieder stolzenburg reason cognit robot system reinhard bernhard und de frieder oliv jan bj spatial agent implement logic express languag manuela enrico hiroaki robot soccer volum lectur note artifici intellig jan refer manual june research report jan murrai agent uml robot soccer andrea winter exchang graph anna simon slice book technolog ein technik fur ein bernt volker approach enabl program understand preprocess languag frieder stolzenburg specif multiag system statechart formal analysi model check oliv ration agent statechart util function torsten urgen ebert conceptu model web site gener graph technolog carlo che urgen frieder relat normal logic program transform properti harri andrea winter appli gupro geo case studi pascal von stephan model concurr algorithm urgen bernt franz lehner workshop softwar reengin mai stephan workshop und fur jan oliv frieder stolzenburg logic approach soccer agent engin peter zhang ftp intern workshop theorem st juli frieder garc carlo che introduc gener specif logic program manfr specif symbol implement constraint peter fabio tame richard andrea andi sch standard exchang format urgen roger formal ulrich fuzzi techniqu cach memori jen implement urgen bernt franz lehner workshop mai peter michael abduct model construct urgen bernt andrea winter interchang format reengin tool frieder oliv jan bj spatial agent implement logic express languag kurt carlo simon zur hybrid system frieder stolzenburg power model gener peter jd bruce spencer merg path improv minim model hyper tableaux urgen roger uh worldwid peter norbert ulrich furbach confluent connect calculu bernt andrea winter queri enabl technolog softwar reengin urgen georg pick program urgen ulrich ilkka niemel nonmonoton effici calculi implement urgen steffen infer mechan theori applic ws ki jose urgen mauricio claudia semant logic program stefan urgen teodor przymusinski super logic program urgen dix logic program paradigm stefan urgen burkhard ulrich zukowski comput model manfr kamp greql ein fur da peter urgen angelika manfr andrea winter und formal grundlagen peter da org thoma marx workflow model wfmc dieter obel schedul criteria ag constraint process hard system ulrich furbach disjunct logic program horn program control program andrea schmid solut count infin problem distanc vector rout ulrich michael frieder stolzenburg proof debug peter sch model elimin simplif applic softwar verif bernt andrea peter urgen ebert program system urgen jorg lobo logic program nonmonoton reason kurt carlo jan technischen anwendungen manfr kamp manag softwar repositori program tool gener approach
Agents/405 1 knowledg system laboratori decemb report ksl agent annot world patrick barbara knowledg system laboratori depart comput scienc stanford california abstract virtual world offer great potenti environ collabor work agent function effect heterogen virtual space abil acquir behavior semant inform context interact literatur discuss construct space object provid aid human perform task describ build compar annot environ explan space activ agent quickli intellig actor space exampl provid applic believ agent act inhabit guid children exploratori world qualiti synthet synthet agent introduct todai virtual environ present opportun simul interact involv user imposs year ago virtual world exist form small size limit scope advanc commun technolog comput power produc rich complex elabor virtual world support thousand user simultan engag task critic technic issu scale space small world past ambiti vision futur incorpor amount substant provid adequ support mainten effect content interact suffici build updat world meet user basi resourc scale meet user grow creat intellig agent answer provid particip activ human gener content action abil agent learn reason greatli limit inferior human offset success environ provid direct guid agent human reli real world object space perform daili task clue mean oper sensit intellig human direct critic satisfactori perform call direct annot environ analog textbook markup web potenti richer annot enabl agent limit understand environ behavior environ learn direct queri space reason process annot world support agent broad rang capabl goal agent function effect harmoni design intend space annot educ children environ humanlik charact simul emot person current interest annot space insert varieti charact person goal popul world competitor encount children agent initi content basic reli annot rest paper motiv annot world examin dialog testb illustr type annot simpl believ agent architectur produc educ experi children section examin reason annot virtual place section outlin potenti annot virtual world section briefli describ type annot agent architectur interact section discuss dialog user believ section offer conclud thought thing make agent smart colleg student walk atm screen light enter access code transact deposit slot open insert envelop slot close transact complet student walk lead child hand histori walk exhibit centuri america quickli scan print turn daughter explain work man walk door bar waist attempt push bar pull open door human reli world function memor procedur make atm bring textbook museum understand expert door order navig build expect find clue give inform clue enabl act studi reflect encount make limit expert domain call advantag build knowledg world knowledg world immedi front world properli simpli inform hand requir learn interpret world import difficulti interpret depend carefulli part world design good design facilit user cognit memori bad design mislead creat kind problem intend demand extra thought memor knowledg accur reflect state memori world knowledg make object environ immedi practic requir door handl ordinari person cockpit multitud dial inform human perform daili task world routin capit fact minim amount materi learn depth learn peopl organ environ support disadvantag approach lead clutter inform user interpret airplan cockpit physic restrict make imposs surround control detail explan reli knowledg world ineffici process process intern call interpret effici appli knowledg make quick act perform task familiar place averag human todai complex unfamiliar environ function skill interpret thing past dynam analyz world interact make interpret environ object acquir skill world facilit hinder peopl agent human expect world act design world properti make easi perform intend difficult thing design intent concept afford refer properti properti determin thing flat surfac feet afford sit lean pick door handl afford pull push sign afford read environ afford activ intend creator real person abil perceiv afford uncertain natur environ design limit resourc convei intend thing hope user correctli interpret intent human overcom obstacl order make knowledg world agent human environ access wealth critic inform perform task vocabulari visual physic knowledg design reli agent speak virtual design complet control kind knowledg agent access form knowledg liter world annot attach locat inform explicit ambigu real world annot provid exact descript afford languag agent suit understand possibl virtual world network connect widespread interest fast grow virtual world vehicl simultan interact world fundament offer abil commun peopl real time great abil thing real world place nonetheless kind collabor entertain agent explor vari world human real interpret environ intellig individu agent meant function varieti virtual visit function sophist reason abil environ practic motiv current research intent design virtual environ support activ intellig agent abstract knowledg environ agent reason base agent instant expert content world retain world futur adequ sophist agent system extract mean inform present realiti exploratori environ call dimens virtual world reason easi build annot environ mud intern program variant text easi gener compar graphic simplifi percept control produc substant interest world elabor graphic design research mud educ believ charact provid valuabl inform human interact world curti foner kiss build annot mud environ basic inform locat access simpl queri annot tailor agent extract data present current simpl standard data provid semant assum special program make human domain knowledg make inform explicit agent intellig perform action relev domain goal project provid inform form detail annot basic oper mud world uniqu content agent learn content user explor annot agent directli queri environ recommend exploit environ goal annot store subject updat environ evolv larg design incorpor annot environ substanti burden world design provid detail descript content action simpli support agent particip space advantag give task world builder salient featur environ understand larger mean space current agent system comprehend approach modifi annot environ expect agent automat adapt agent differ abil motiv inform set annot mainstream mud system work command system program languag base set annot meant support lifelik comput person friend assist children explor virtual environ main type implement emot environ explain emot agent annot explain agent react event action suggest type believ behavior built annot describ puzzl hint agent speak updat agent part problem role annot inform agent action relev perform job world combin person domainspecif behavior function annot describ statu game bound suggest move agent make base person desir skill inform agent categori static fix text store mud agent demand event occur agent artist paint hang room paint told action place environ kick annot gener action requir real reason minor syntact categori procedur involv substant comput mud agent queri agent queri environ situat game environ respond evalu agent environ suggest situat environ offer base heurist program annot discuss greater detail door door clue door balanc enorm stone pivot singl person push door door havent push door door figur simpl declar annot pyramid environ figur show declar annot store virtual space agent dialog figur set extrem simpl annot agent integr environ gener behavior simpl believ agent construct simpl believ agent architectur explor annot mud interest recent creat believ includ studi emot model elliott clore collin storytel al model live entiti human interact lester system simpl emot model base al agent fix set emot happi influenc action percept environ action emot person form set emot normal valu tend time action agent fall categori stone call substant effect environ situat stimul user belief intent charact behavior built agent function independ environ exampl includ emot express kick commentari agent topic interest action pair categori domain behavior explicit domain action suggest behavior agent annot agent behavior gain explor virtual world exampl experi devic scientist plai game lectur histori set domain behavior depend agent locat state environ annot add remov behavior agent repertoir agent enter room open option close lose action gain action agent basic control cycl consist tradit loop agent confirm current locat world locat remov annot perman test current environ annot updat visit space retriev annot perman queri environ make entri annot process annot receiv oper attend user kick modifi emot appropri cycl determin action execut system similar stone legal amount energi action highest energi chosen execut round sourc energi appropri action respect current emot valu fix amount energi action repres prefer distribut type action absenc emot influenc behavior receiv energi believ behavior behavior energi level behavior categori reset straightforward process integr intern behavior extern behavior produc reason behavior practic sampl interact figur show interact simpl agent user annot mud dark lit flicker ancient side south wall entranc chamber wall cover imag god passag book dead visibl exit passag obviou west scratch scratch head good idea examin wall wall cover carv paint depict passag carefulli clue map map ancient map examin map ancient map show adjac chamber show connect drawn call ey clear throat examin south wall south wall depict open mouth surround imag ey carefulli give map ill ey balanc enorm stone pivot singl person push push ey press ey sink slightli wall clear throat havent push push ey push ey grate section south wall reveal dark entranc room good figur dialog insid pyramid environ figur user role explor search secret entranc heart lost pyramid fiction call plai user assist expedit charact person default level fear inclin make remark tendenc exacerb environ deep ancient pyramid make worri comment domin side person exhibit friendli action suppress thing interact respond user command hand user hand back accomplish annot inform oper standard repertoir situat thing perform beg leav room behavior part basic enhanc emot annot room indic gener fear respond user open secret door good action gener emot high fear note annot forc respond brave laugh face danger point typic agent react task provid hint puzzl open secret door solut press ey slide diagram ancient map clue solut case user room annot enabl give problem annot describ annot suggest thing agent give clue user annot clue meant spoken annot fact heavi stone pivot opinion clue simpl natur languag process perform verbal clue give agent idiosyncrat flavor speech note interact agent hint quickli speed alter base difficulti problem user level sophist case set high produc problem complex involv locat agent absorb hint place state initi state ey press solut state ey press annot agent chang choic hint user talk agent bui told plai role baker mean sensit role annot environ give specif inform act baker antonio friendli absenc emot annot room exhibit gener happi behavior antonio thing text reaction user comment user attempt bui readi sell depend state environ send updat apolog sell run chang back antonio execut thread train simultan longer made action turn put put counter scarc notic thread consist window comment love dai window thread built antonio bake thread provid thread annot coupl role annot baker thread annot suggest sequenc action common perform contigu perform sequenc action thread atom behavior level thread import execut action sequenc interleav bright room pi low counter divid room side food made sit counter box case displai good sale sale obviou west good good antonio good antonio turn antonio cast ey kitchen antonio window antonio time make bui antonio antonio havent fresh care wait antonio nod nod antonio love dai antonio put bowl antonio hum work antonio smile antonio crack egg bowl antonio add water bowl antonio whistl antonio mix ingredi antonio wipe brow hard antonio put antonio antonio antonio put antonio wait antonio cast ey kitchen antonio put counter bui antonio antonio hand hope enjoi figur dialog antonio case thread high level thread surgeri thread glass give run commentari give agent singl topic span execut seri unrel action quickli life successfulli agent system virtual agent environ complex demand task build virtual separ domain knowledg agent architectur provid interfac work problem made commun challeng evolv agent virtual world annot fuel natur capabl design object real world afford intellig peopl paper outlin begin evolut simpl believ agent construct virtual world annot support believ behavior enhanc action result set simpl agent produc believ behavior acknowledg work support nsf contract arpa contract gift seed grant stanford center studi languag inform offic technolog david administr provid test lee daniel rousseau illumin discuss design refer interact comput game muse research report role emot believ agent commun acm ws architectur social behavior technic report depart comput carnegi mellon pa eleph dont plai chess robot autonom creat commun combin winter confer educ mud jan social phenomena virtual realiti confer direct implic advanc comput ca guid explor virtual world technic report knowledg system stanford ca sociolog case studi agent memo agent mit media massachusett institut ma theori afford ecolog shaw ed lawrenc erlbaum associ direct technic report knowledg system stanford ca evalu mud role intellig agent combin winter confer educ mud jan believ anim pedagog agent intern confer autonom agent del feb ny artifici life meet lifelik autonom agent commun acm design everydai thing thing make smart cognit structur emot cambridg uk dynam sequenc anim pedagog agent thirteenth nation confer artifici intellig aug menlo
ML/406 6 learn model recognit weber perona dept comput neural system dept electr engin california institut technolog mc ca usa universita di itali abstract present method learn object class model unlabel unseg clutter scene visual object recognit focu type model object repres flexibl constel rigid part variabl class repres joint probabl densiti function shape constel output part detector method automat identifi distinct part train set appli cluster algorithm pattern select interest oper learn statist shape model expect maxim method achiev good classif result human face rear view car introduct relat work interest problem recogn member object defin object class collect object share characterist featur part visual similar occur similar spatial configur build model object class face problem fig segment registr train object recogn train part object part distinct estim model paramet global geometri shape individu part describ train solut model learn problem typic requir answer human supervisor featur train imag train imag show object front uniform background requir object posit train imag common refer frame establish amit geman develop method visual select learn hierarch model simpl type featur detector front end method assum train imag regist respect refer grid exhaust search local featur global model shape variabl encod form small region local featur move freeli fig object consist left machin learn recogn instanc object class inform burl al statist model shape variabl model probabilist set shape space densiti method requir label part posit train imag similar approach object recognit includ activ model taylor al model global deform eigenspac method dynam link architectur der malsburg deform energi grid link landmark point surfac object yuill recognit method base gradient descent deform energi function obviou method train problem automat part select gener establish part distinct human observ lend success detect machin walker al address problem albeit realm statist shape model part select argu part select context model format complet solut problem introduc reach intuit suggest good deal knowledg object question requir order clutter train imag solut provid expect maxim framework simultan estim unknown data probabl densiti unknown data problem solv simultan compel reason treat problem exist tradeoff distinct part distinct part strong arbitrari locat surfac manufactur logo car distinct part contribut inform occur stabl spatial relationship rel part approach model object class work burl al object part imag patch detect describ geometri mutual posit part invari respect rigid affin transform joint probabl densiti part shape model object class object detect perform run part detector obtain set candid part locat stage consist form object constel part complet partial constel order partial stage consist object joint probabl densiti calcul likelihood hypothesi object likelihood specif hypothesi object order train model decid kei part select part nose number train lastli estim joint probabl densiti function part shape burl al perform act estim joint probabl densiti function automat method autom step techniqu select potenti inform part step fig small highli textur region detect train imag mean standard oper detector train imag step select region interest imag area train object clutter background object train set similar textur region object frequent similar textur region background uncorrel cluster step favor larg cluster tend select part correspond object interest background part detector train cluster step model learn algorithm inform simultan estim remain model paramet iter combin small number part paramet underli probabilist model estim depend perform model valid data choic part modifi process iter final model obtain improv oper interest valid part select background vq model learn background test imag foreground test imag foreground model structur paramet estim test model final model model train imag train imag part part part fig block diagram method imag target object clutter background background outlin paper section present statist object model section discuss automat part select section dedic step model format train section demonstr method experi car face model object imag model base work burl al import differ model posit background part uniform gaussian larg covari probabl distribut number background burl al model case poisson distribut gener object model model object collect rigid detect detector recognit part detect stage transform entir imag collect part part correspond instanc target object class stem background clutter simpli detect inform object part posit imag ident part type assum type part posit part extract imag summar superscript posit observ unobserv denot row locat detect part type ij vector assum object part correspond foreground object vector set indic point ij foreground point object part occlud entri present unseg unlabel part correspond observ treat hidden miss data call part belong foreground object conveni repres posit unobserv object part separ vector hidden dimens depend number miss part defin gener probabilist model joint probabl densiti note entri random dimens model detail order provid detail parametr introduc auxiliari binari vector encod inform part detect miss occlud variabl denot number background candid includ row variabl complet determin size assum independ foreground probabl densiti number background detect model poisson averag number background detect type imag convei assumpt independ part type background idea background detect locat imag equal independ locat discret grid simplifi case extens gener case straightforward model binomi distribut model foreground detect continu rang chose poisson continu limit binomi distribut admit part type model detector statist depend number model probabl explicit tabl length joint independ govern presenc absenc individu model part joint treatment lead power part occlud simultan densiti model denot set consist denot total number detect type part express fact consist number equal absenc inform part locat fg bg defin ot mt coordin foreground detect bg coordin background detect made import assumpt foreground detect independ background fg model joint gaussian covari note model absolut part posit imag foreground object posit imag obtain translat invari formul algorithm experi describ part posit rel posit refer part fg remain gaussian introduc fundament difficulti formul miss part discuss invari reader refer posit background detect model uniform bg total imag area classif experi present object classifi imag class observ optim expect total classif made class maximum posteriori probabl conveni jx jx jc denot null hypothesi explain part background notic ratio absorb threshold sum numer includ null object present remain undetect part detector consist hypothesi explain null hypothesi concern classif framework mean restrict problem object local identifi foreground part highest probabl occurr target object automat part select problem select distinct object part intim relat method detect part recognit system final put work evalu larg number potenti part settl normal correl effici part detect method extens experi lead method offer compar perform elabor detect method correl base pattern small neighborhood train imag templat prospect part detector procedur reduc potenti huge set part reason model learn algorithm section select part procedur accomplish identifi point interest train imag fig interest oper capabl detect corner intersect center point circular pattern step produc part candid train imag reduct number part achiev step select consist perform vector quantiz pattern similar procedur leung malik standard cluster algorithm tune produc set pattern pattern repres center cluster obtain averag pattern cluster retain cluster pattern cluster exampl tend repres pattern number train imag obtain part averag entir set train imag order elimin remov pattern small shift arbitrari direct due restrict point interest set remain pattern exhibit interest figur human fig point interest identifi train imag human face clutter background method cross denot pattern circl mark pattern sampl pattern obtain cluster small imag patch shown face car car imag filter part select process total number pattern select face car readili identifi simpl result averag larger thousand pattern procedur dramat reduc number candid part part background portion train imag present model learn order train object model set solv problem decid small subset select part candid defin model configur learn paramet underli probabl densiti solv problem configur pdf estim expect maxim greedi model configur search import question answer part endow model number part model gain complex discriminatori power good strategi start model part add part monitor gener error criterion penal complex start learn process face problem select set number part candid produc sec start random select test replac model part randomli select improv model estim remain model paramet train explain assess classif perform valid set posit neg exampl perform replac part process stop improv start total number part model render process model priorit part shown good valid perform smaller model estim model paramet expect maxim address problem estim model pdf set model set train imag detect method reli maximum posteriori probabl goal model class condit densiti accur emploi expect maxim algorithm produc maximum likelihood estim model mg em suit variabl miss infer observ fx standard em proce maxim likelihood observ log dx respect model paramet difficult achiev em iter maxim sequenc refer expect respect posterior jx tild denot paramet optim tild impli valu previou iter substitut em theori subsequ maxim converg local maximum deriv updat rule em algorithm paramet gaussian govern distribut foreground tabl repres govern background densiti factor equat jh jn term depend paramet updat em updat rule depend deriv expect likelihood yield ot mt definit set deriv yield updat rule updat rule obtain deriv respect covari matrix equat lead updat rule find updat rule probabl mass term depend paramet deriv respect probabl observ specif obtain denot delta constraint instanc ad lagrang multipli find updat rule updat rule notic term inform number background point part type differenti respect equat lead intuit appeal result comput suffici statist updat rule deriv express term suffici calcul em algorithm posterior jx dx denomin express equal calcul explicitli gener sum integr miss data hypothesi expect calcul similar calcul sum consist divid calcul averag case slightli complic hypothesi regroup ot mt note dx mo oo oo om mo mm sum hypothesi divid establish result final calcul ot ot mt part mt consid integr miss mt dx mm mo oo mot loop divid desir result conclud em algorithm experi order valid test classif task sect data imag rear view car imag human face mention sec experi perform translat invari extens learn method paramet learn algorithm set valu experi integr dimens gaussian simpli delet mean covari dimens multipli suitabl normal constant number part model perform car train face train face test car test fig result learn experi left show perform car model part select part shown top indic deviat distanc part foreground pdf typic test imag align hand illustr model translat invari center show face model plot show averag train test error measur area roc curv observ moder overfit smallest test error occur part amount train optim number part part train test imag object class imag show target object arbitrari locat clutter background imag background scene exclud target object imag discard hand prior experi face imag indoor outdoor peopl car imag public street park lot photograph vehicl color sport util truck car imag filter order promot invari respect car color light condit imag digit convert grayscal downsampl resolut pixel imag set randomli split disjoint set train test imag face singl person present set fig multipl model left correctli classifi imag part label note middl part exhibit high varianc vertic direct match locat plate roof probabilist made correct match evid accumul match automat select part part automat select procedur sec interest oper appli unlabel unseg train imag instanc target object class perform vector quantiz grayscal patch size extract point interest set pattern produc object shown figur model learn learn model part data set greedi configur search em algorithm potenti converg local learn model record averag classif error model learn entir set select part knowledg train small model part appli train larger model order investig extent part chosen model size found em algorithm converg correspond model part model matlab implement subroutin written pc pentium ii processor number part configur evalu vari result classifi imag appli fix threshold comput receiv oper characterist base ratio posterior probabl order reduc sensit due limit number train imag averag valu area roc curv measur classif perform drive optim model configur figur show learn model error measur function number part exampl successfulli wrongli classifi imag test set shown fig inspect model make interest observ case found confirm ey corner good part intuit correct featur turn part nose model introduc filter preprocess car model concentr dark shadow underneath car stabl featur research familiar problem track car confirm shadow easiest detect car learn algorithm advantag fact part detector respond multipl locat target object effect pronounc model part difficult predict exploit behavior build model ran learn process assess likelihood converg local extrema model part choic produc choic produc time em correct incorrect incorrect incorrect incorrect correct correct incorrect incorrect incorrect fig exampl correctli incorrectli classifi imag test base model fig part label foreground background imag classifi case threshold set yield equal error rate foreground background imag case imag classifi compar difficult car experi algorithm observ choic part result classif perform lead conclud em algorithm extrem stuck local maximum inspect part type select model notic half part chosen model size present smaller model suggest initi choic part part found perform smaller model good strategi algorithm part smaller model discuss futur work present idea learn object model set set unseg unlabel imag exampl object clutter algorithm automat select distinct part object learn joint probabl densiti function encod object automat construct effici object detector robust clutter demonstr model learn algorithm work successfulli data frontal view face rear view case discrimin imag desir object background imag exce correct simpl model part perform car correct train detect requir implement suggest train detect implement main goal paper demonstr feasibl learn object model directli unseg clutter provid idea aspect implement suboptim suscept improv list implement part detector normal correl sophist detect involv imag neural network consid test current implement part inform suppli candid part scale orient imag paramet describ incorpor interest oper cluster part optim choic algorithm deserv scrutini import aspect implement fall short gener model learn test translat scale affin invari conceptu limit straightforward implement em algorithm rotat scale invari case impract extens acknowledg work fund nsf engin research center system engin caltech nsf nation young investig award pp support sloan foundat grate rob collect thoma mike malik david forsyth comment refer amit geman comput model visual select neural mc tk perona local shape int workshop automat face gestur mc tk perona planar object proc ieee comput soc conf comput vision pattern mc perona probabilist approach object recognit local global geometri proc page tf coot cj taylor object vari shape statist featur european conf comput page rubin maximum likelihood incomplet data em algorithm journal royal statist societi ro duda pe hart pattern classif scene analysi john wilei gj face recognit activ model proc europ conf comput neumann vol page rm haralick lg shapiro comput robot vision ii jc vd rp invari object recognit dynam link ieee tran mar tk mc perona face clutter scene random label graph proc int conf comput page june tk mc perona probabilist affin invari recognit proc ieee comput soc conf comput vision pattern page tk leung malik recon surfac proc int conf comput page taylor locat salient facial featur int conf automat face gestur al yuill templat face cognit
HCI/407 4 mediat inform system gio wiederhold comput scienc stanford stanford ca keyword inform system domain servic abstract task part multipl custom summar stock integr inform compani line predict check transport resourc assign sharabl servic activ middlewar client server defin mediat modul popul layer mediat servic benefit client applic access mediat server sourc directli categori improv access improv deleg mainten defin criteria mediat ownership parti assum delimit scope conform interfac standard enabl applic benefit mediat includ plan decisionmak task requir inform refer data obtain project trend futur sourc typic heterogen heterogen includ level context mediat result intent higher level applic applic solv problem involv multipl subtask multipl domain mediat requir domain mediat domainspecif mediat interfac support client applic interfac provid good encapsul mediat complex system greater individu subtask question effect effici dealt exploit process storag capabl modern hardwar architectur view gener model partit layer domain enhanc applic softwar staff concentr function data resourc manag oper technic mainten concentr mediat layer concept mediat servic provid network domain specialist suitabl payment mediat servic perform independ introduct inform system depend heterogen resourc resourc typic develop maintain autonom major applic result motiv applic establish tend inventori product desk servic network includ textual geograph simul weather forecast applic layer mediat layer foundat layer data simul resourc servic user workstat figur transform data inform dispar data collect support plan support applic typic design independ subsequ establish oper plan develop assess chain candid manag task poorli support practic rare suffici time build data collect plan plan system reli exist sourc figur sketch architectur layer data inform servic deal heterogen sourc overwhelm support applic problem due deal detail crucial detail mediat provid intermediari link data resourc applic program function provid integr integr data resourc task requir carri function retriev relev data multipl heterogen abstract transform retriev data common model level integr transform data match reduc integr data abstract inform densiti result transmit shown figur process add convert data inform aspect present focu detail provid tabl mediat softwar modul exploit encod knowledg set subset data creat inform higher layer applic small maintain small coher group expert task type locat retriev data current emphasi work inform system access prerequisit deal distribut inform exampl approach improv access system facilit varieti system seek except expect valu trend omiss replic inform abstract match level granular assess qualiti sourc figur process featur mediat mediat focu process result retriev type improv retriev type deal overload custom effect retriev creat ad mediat due intellig process invest build mediat justifi expect mediat servic support multipl applic provid mediat warrant distinct architectur sketch figur earlier program exhibit intermediari function led concept mediat construct support specif extend servic statu mediat architectur extend model scalabl sketch figur show develop system set assum deal singl domin local addit wrapper deal legaci data integr combin share gener servic perform independ mediat network bound client server applic requir inform multipl domain multipl mediat datasourc wrapper mediat network integr applic figur evolut network servic mediat mediat built care domain knowledg acquisit handcraft requir code build mediat hand essenti valid concept establish standard interfac mediat approach conceptu shown figur major mediat base resourc mediat practic intermedi layer number exist protocol chosen interfac servic servic interfac interfac resourc access resourc access interfac interfac user interfac user interfac interfac interfac interact interact applicationspecif code specif code domainspecif specif code code specif code code mediat mediat gio wiederhold figur mediat layer interfac interfac base interfac tool serv model distribut augment sql interfac tool corba applic layer interfac greater capabl agent languag kif content kqml manag kind oper kif defin exchang knowledg logic kqml handl object mathemat equat tupl requir sender receiv chosen kqml statement sender receiv vocabulari aspect focu section paper user interfac mediat simplifi deleg complex custom interfac applic program code deal varieti graphic user interfac interfac devic occupi applic program mediat invok applic repres kqml applic program interfac block limit amount gui interact owner mediat sect trade intern code api recapitul earlier paradigm shift recal program file oper major amount effort compet accept paradigm remov code applic deleg manag system dbm difficult special code manag intern consist manag resourc applic share repres concept basi mediat paradigm present creat mediat paper present conceptu underpin autom mediat process autom fulli automat code knowledg provid ad offset cost architectur layer impli formal mediat earlier paper present tool field artifici intellig mediat time gener vision present paper formul servic mediat includ combin select resourc precomput inform invoc wrapper deal legaci sourc select relev sourc materi optim access strategi provid high perform secur filter guard privat data resolut domain terminolog mismatch resolut ontolog differ resolut scope domain mismatch extrapol match differ tempor data reduct histor data limit snapshot abstract match level integr integr materi base match candid join kei omiss replic inform assess qualiti materi sourc prune data rank low qualiti relev omiss inform user model statist summar higher level categori user model report except expect valu trend trigger action due except expect valu transform materi make present effect custom adapt media capabl custom transmiss result inform client show refer chose familiar impli tabl servic provid mediat relat task specif special domain exist rare identifi reusabl task place mediat enabl partit inform process task specialti task combin provid ad overcom cost ad layer inform process identifi maintain servic modul manag benefit servic provid independ program provid servic custom detail digit librari process mediat softwar interchang hub call mediat summar essenti aspect activ reduc data inform appli knowledg search user requir mediat integr combin number current technolog find transform make result inform hub inform highwai mediat recogn autonomi data system inform servic support user applic util autonomi particip enabl system mean inform process insert increment growth requir mediat hub adapt link facil traffic network facil mediat adapt advantag busi repres user sourc adapt user dont care remain figur crucial benefit upgrad synchron applic prior mediat extend data resourc subsystem figur increment system growth mediat process abstract merg special servic util transport hub encourag special factori provid servic implement mediat vari great deal process find mediat program languag lisp optim crucial mediat depend packag written fortran mainten enhanc declar approach understood modifi current mediat code project mediat todai includ manufactur design fighter aircraft aeronaut system gimbal antenna posit spacecraft space system access data healthcar manag texa mediat technolog earli applic integr inform flexibl militari command system technolog project suppli varieti corpor serv contact point project integr weapon system project access provid ibm im design data dec vm factori unix wai text pc phase shown figur develop simultan integr inform local independ supplier site feasibl physic integr imposs integr servic user interfac pd ds wrapper domain model match maker domain match chang notif queri reformul engin applic pride client gui wai server index supplier figur phase develop assum mediat servic perform autonom comput requir abil commun standard convent heterogen comput oper data messag pass infrastructur overcom concert effort commun mediat convent terminolog describ object domain access mosaic tool common technolog todai knowledg access path referenc linkag number subsidiari servic collect linkag harvest fish linkag subject temporari repres cach system cach actual reduc work success retriev todai servic resourc monitor qualiti recent experi show provid initi entri point dedic research document obtain carri copyright copyright violat tool partit amount knowledg perform aspect mediat enorm modular partit tool scienc deal excess size complex size complex number concept distinct base subsumpt relationship growth linear comput distinguish type partit partit distinct link interfac type partit commonli solut text structur split world data modular exemplifi common paradigm choic larg system singl singl process multipl rearrang process optim partit distinguish system technolog versu linear program prescrib comput method mediat method technolog interfac constraint excess technolog emploi modul mainten overhead gener data split scale domain defin domain subset knowledg world manag singl small coher group defin effort requir organ societi medic automot engin societi problem car domain term wholli definit scope differ distinguish domain show simpl domain fig note domain label term observ partit requir system grew size longer maintain defin group relat concept gener knowledg base number domain larg central solut deal subset bring subset partit larg oper partit special author follow paradigm mediat partit follow organiz boundari mediat paradigm return power comput manag domain sketch figur domain special qualiti knowledg acquisit knowledg mainten requir recogn domain specialist organ lead custom figur domain special special make knowledg mainten expert focu constraint handl unrel fish versu bicycl differ domain serv program financ versu engin subset domain similar differ concept structur knowledg electron versu civil engin section paper deal manag ontolog distribut mediat achiev softwar mediat transform data network make suitabl relev consum softwar function carri comput mediat assign comput network softwar easi copi digit mediat rapidli replic softwar typic smaller data easi instal locat compat comput factori chang locat impli flexibl configur network tradit manufactur supplier fail deliv suffici ad rapidli replac replic enhanc technic perform mediat locat mediat data commun lead result inform typic smaller process algorithm mediat softwar move high perform processor improv time demand type mediat replic distribut addit site network commun link time enhanc cach hub find hotel peopl good varieti transport mechan perfectli temporari storag function digit system intermedi storag cach data mediat copi select process store store data identifi mediat appropri sourc data wise refer sourc acquir sourc requir mainten mediat add data appli expert knowledg expert creat mediat mediat maintain mediat remain effect constantli chang world improv mediat exist subscrib potenti client poorli maintain mediat lose time candid replac competitor exist user continu mediat disturb decid applic upgrad flexibl upgrad constrain effect exist commun user maintain number version mediat servic modest charg mediat encourag applic depend version upgrad provid mainten servic applic world constantli chang ad mediat cost applic deal resourc alter high chang occur resourc applic cost possibl hundr custom import system develop design mainten follow tradit softwar industri cost user complain servic select review todai count intermediari locat relev inform review editor filter materi prior librarian review provid addit servic ad manag easi manag materi author www subscrib public lost materi integr document list current easi place paper net publish resolv conflict free dissemin inform provid great intermediari role sustain filter materi respect qualiti account privileg gain subscript payment fee view object design relat view defin subset sourc relev applic view determin scope domain creat unnorm relat repres default relat creat object class concept relev domain semant object carefulli problem resolv permit updat retriev inform object hierarch make easi navig understand summar volum materi network huge grow servic provid summar recent exampl gener tabl describ statu public trade compani base report submit regul seek except effect summar inform transmit user warn issu program person tax deduct normal rang trigger special incom tax peopl design mediat balanc complex gather experi illustr figur dimens amount process provid inform gener breadth domain cover inform requir continu chang technolog build maintain mediat concern manag size opportun appli modern program technolog hard insuffici ad hard costum domain scope servic scope figur fat versu thin mediat comput mediat modul carri task serv user desir aspect model understand direct prerequisit explain user current inform structur system explain schema mediat hierarch model domain task refer resourc access made visibl understand intent user task organ suitabl effort provid adequ interfac manag inform support understand formal model crucial simpl model user applic resourc domain structur typic hierarch linkag user model repres domain defin figur model repres current view user pertain domain consist list relationship ontolog mediat manag access process data concept domain concept typic hierarch paradigm scientif relationship candid path node typic repres inform obtain resourc linkag resourc form network complement ontolog process paradigm domain time process requir linkag requir mediat mainten domain object object configur consist domain term consist relationship object consist forg domain hide valuabl detail ontolog figur domain ontolog revenu collect assum econom model mediat servic maintain long tradit method obtain softwar typic embodi restrict replic secondari close copyright protect model satisfactori approach revenu collect develop todai user mediat pai servic receiv increment charg encourag trial invest small mediat live remot user applic charg easili common todai softwar difficult creator maintain receiv payment fee essenti direct automat electron payment mechan ontolog permit inform distinct sourc access agreement terminolog share area suffici match inform basi word differ mean context domain ontolog vocabulari term specif relationship term definit inform formal specif cite term domain entir structur form semant net isol term avoid commonli accept upper layer share tool object base collect figur establish ontolog sourc initi sourc ontolog defin vocabulari repres textbook thesauri creat index creat bibliographi research locat refer practic verifi ontolog obtain schema origin design document addit inform relationship repres concept constraint attribut ontolog captur knowledg standard effort contribut effort proper definit standard depend subsidiari term defin larg ontolog creat essenti human understand process faithfulli transmit comput domain term domain mean differ shown figur recent result gather terminolog structur relationship recogn valuabl effort deserv attent work tom gruber trace develop current candid ontolog part infrastructur effort commun peopl system share knowledg consist terminolog organ concept ontolog approach solv problem paradigm build build figur paradigm ontolog integr domain differ make integr distinct domain dynam merg capabl essenti achiev associ access multipl transform requir achiev optim maintain correct semant experi issu object tend repres hierarch view underli world data arbitrari composit relat algebra penguin system construct object relat structur model connect refer approach deal build ontolog domain ontolog aggreg term relev give prepar definit accept definit complet document expect particip adjust usag conform definit assum term mismatch make term typic prefix sourc domain identifi approach uml sourc label make distinct micro theori encapsul differ process share inform encourag avail joint ontolog converg coher assur assum term thing explicitli instruct encod match form manag collabor domain restrict evolut local term domain term cover match rule form layer abstract ontolog higher abstract layer defin leav abstract term local abstract layer focu altern domain achiev scalabl inform system approach ontolog partit enabl composit part oper shown figur individu charter defin maintain knowledg breadth maintain depth knowledg domain algebra consist match rule link domain ontolog intersect creat subset ontolog sharabl entri union creat joint ontolog merg entri differ creat distinct ontolog remov share entri figur domain algebra constrain term domain ambigu disappear domain context term label sourc versu domain larg terminolog maintain independ domain religion subdivid hundr autonom agreement reach crucial term term occur subdomain pessimist principl mediat term match match rule rel autonomi local sourc term scalabl layer structur adopt inform structur success domain manag strategi internet distribut convent conserv assumpt risk insuffici match inform retriev assign task creat match rule multipl specif expert expect high qualiti oper data domain creat reason cost evolv system feedback loop exist permit user suggest candid match modifi exist distribut group maintain partit ensur mainten domain knowledg note stress mainten ontolog small enabl semant agreement peopl lag time mainten term chang mean time algebra term disjoint disabl domain seek automat reason ontolog requir formal approach transform eventu enabl optim access develop set oper permit match merg algebra ontolog oper map oper requir match rule intersect base ontolog share ontolog semant integr domain typic share ontolog obtain permit construct effect ontolog differ permit definit local subset maintain autonom negat provid avoid problem infinit set map oper provid domain definit structur ontolog differ algebra provid basi interrog multipl domain semant share establish process mirror approach knowledg base creat articul axiom join data carnot emploi larg broad cyc knowledg make optimist default assumpt term spell told mean irrelev retriev practic carnot system applic limit depth search implement coher order project work platform arpa manag workshop refer architectur document base vocabulari initi establish integr architectur meet boulder organ roger king colorado refin architectur meet organ mike genesereth stanford base contribut particip inform technolog serv specif custom remain depend specialist model design programm implement system object technolog lessen depend specialist infrastructur aggreg detail unit import domain mediat technolog intend scale system sourc domain contribut servic inform applic breadth inform system grow coher knowledg intersect incorpor profit knowledg inform algebra task collect maintain match rule support algebra natur partit specialist collabor integr integr proce multipl level avoid central hinder progress exploit data sourc prime level integr depict figur formal servic infrastructur support pragmat applic combin scalabl flexibl applic develop integr level applic pragmat mediat formal servic control figur integr level tool support effect tool common formal structur softwar artifici intellig technolog hard scale domain grew larg technolog describ provid formal build concept demonstr relat formal manag incorpor ontolog concept foundat manag requir knowledg base recognit domain autonomi import enabl local progress adapt maintain relev capabl rapid incorpor domain innov applic support posit converg mutual major motiv formal manag ontolog current state extent mismatch note improv made interact inform achiev level consensu number project mediat interfac requir seri prototyp effort support air forc concept integr weapon system acknowledg research direct feasibl support colleagu arpa intellig integr inform arpa recent workshop sponsor bob nech david gun chair bill mark tom gruber contribut valuabl idea work progress topic locat www node refer work list handl current inform deal appli network capabl todai system thierri gio wiederhold object relat comput aid vol great octob page wiederhold relat acm sigmod conf manag data boulder michel gio wiederhold mic peter manber michael schwartz harvest inform discoveri access proc intern world wide web chicago octob page harvest sergei jame hector detect mechan digit sigmod page alex jose david integr activ design data engin confer page sudarshan chawath al tsimmi integr heterogen inform ipsj japan shen integr larg knowledg base ieee brad cox idea fort sep georg mason fairfax va cj date hugh guid sql addison weslei peter den mark acm copyright comm april linda oper mismatch ieee data engin confer ieee transact knowledg data dec isabel andrew michael robert gio wiederhold displai medic md march page tr jv knowledg share technolog project knowledg system novemb tim richard don robin agent commun intern confer inform knowledg manag acm novemb queri invert late bound proc jc toolkit support scalabl persist base sixth intern workshop persist object lnc michael genesereth steven ketchpel comm juli michael singh sy distribut anonym knowledg share approach softwar proc gener comp michael genesereth roger refer intellig integr stanford colorado gibb softwar scientif sep jame gosl henri java languag white sun mountain view lui hector anthoni effect gloss text discoveri proc acm sigmod acm sigmod thoma gruber translat approach portabl ontolog specif knowledg thoma gruber gregori olsen ontolog engin mathemat fourth intern confer principl knowledg morgan corpor intellig integr inform bl humphrei unifi medic languag distribut experi improv access advanc solut global inform ieee press robert kahn advanc scientif vol jonathan king queri optim semant michigan press koster inform krishnan dh steier access digit librari corpor present digit librari rutger newark li chri clifton integr heterogen neural proc confer larg data base page rv al program common commun page maurer idea world wide proc distribut multimedia system page kc mari christoph elizabeth manag system encyclopedia softwar john wilei tr wr swartout technolog knowledg ai page object manag group common object request architectur omg document dec rs pf tr nech darpa knowledg share progress rich principl knowledg page morgan kaufmann yanni hector jeffrei ullman mediat system base declar submit extend version nick roussopoulo increment access method cost acm transact sep page gerard salton text inform process smart ieee cs engin march shahar mark musen system patient comput page collect overview report feder ny gio wiederhold ieee decemb page gio wiederhold architectur futur inform system ieee march page gio wiederhold darpa softwar technolog april arlington page gio wiederhold role intellig inform journal intellig inform page gio peter stefano ceri comm novemb page gio litwin tempor data heterogen tempor design benjamin page gio stephen charl channel product inform ieee educ octob robert piscatawai nj gio wiederhold intern symposium gener comput system workshop heterogen cooper vol page dec gio wiederhold qian jj encyclopedia softwar page gio wiederhold digit comm april page gio wiederhold domain manag medic method inform march page
IR/408 5 inform extract heurist movi queri system martin depart linguist ohio state usa abstract semant interpret spoken dialogu system amount extract inform utter system movi queri classifi question movi town theater mention simpl heurist suffic construct highli accur classifi classifi question type attribut induc data featur tailor spoken languag phenomena separ classifi error detect robust introduct movi week option constantli chang rise demand inform time problem creat spoken dialogu system respond movi queri highli adapt light frequent current movi titl discuss implic requir nlp compon movi queri system input nlp compon consist transcrib transcript user queri produc automat speech recognit compon input transform semant hand dialogu manag compon semant interpret step simpl domain hand conceptu inform extract task difficulti task depend properti input level detail encod semant case input spoken languag typic rang start fill top part tabl develop corpu transcrib input prone error introduc asr word misplac middl part tabl taxonomi phenomena inform extract import wrong long user intent determin input propag error make inform extract difficult mean work carri support lucent technolog part summer direct bob carpent jennif discuss feedback chri comment earlier draft paper usual disclaim appli resent construct simpl flat frame list attribut requir figur show semant utter river wild plai understand requir task expect fairli easi task movi river wild town theater figur semant compon satisfi adapt current movi titl frequent routin requir adjust compon portabl adapt system locat town theater straightforward accuraci extract relev inform measur robust perform adequ presenc possibl due error introduc compon measur indirectli term automat construct compon movi domain classif success kind approach easili reusabl potenti robust train procedur minim train data li crux approach difficult suffici train natur domain hand preclud altogeth task identifi movi titl impract gather train data time movi system retrain rest paper explor option construct compon inform extract automat number question type small machin learn data feasibl classifi construct learn built simpl heurist develop compon section section evalu approach discuss properti domain appli contribut perform section briefli summar find start client plai restart plai plai carol repair citizen plane plai word repetit plai fill fox vallei word plai misplac speech boundari time legend fall plai dont lion king tabl problemat aspect transcrib input develop illinoi corpu develop corpu utter express uniqu collect chicago area word uniqu utter annot theater requir special movi titl mention task attribut utter requir provid inform plai give list movi movi utter requir provid inform plai give time plai theater utter requir provid inform movi im locat utter requir provid inform locat fine art theater utter requir confirm movi plai plai exampl annot utter tabl inform extract amount predict valu call class utter predict attribut task task attribut mix inform question type predic sentenc utter label task locat form invari start word fill distinguish utter task task locat main utter task star locat order distinguish valu inform valu movi theater attribut accur predict task predict movi theater extent problem clear deal adjust label corpu attribut question creat ident lost locat task question predict question easili end recov distinct lost task question modul consist classifi question attribut classifi movi attribut classifi town attribut classifi theater attribut compon map quadrupl predict valu potenti valu town theater predict question simpl idea baselin classifi dictionari keyword predict small dictionari shown figur keyword question figur keyword dictionari question baselin classifi sentenc match tie time bradi bunch plai court clear exampl predict base rightmost longest utter task movi town theater null red plai red null null iq plai iq null null tivoli locat null tivoli plai null tabl exampl annot utter client plai movi movi plai rightmost longest match determin effici variant algorithm match finit set keyword rightmost longest pattern match base dictionari figur predict case keyword dictionari achiev baselin accuraci develop corpu improv train tree classifi base includ inform rightmost question rightmost compound presenc word repeat stratifi crossvalid estim classif accuraci comparison train tree base binari attribut indic presenc question word bigram question word time goal predict task attribut rightmost longest match strategi accuraci determin procedur lower baselin question rightmost longest pattern improv result question predict movi rightmost longest pattern match base dictionari full movi titl perform accuraci utter movi titl easi wai improv baselin result dictionari titl lead determin achiev accuraci utter movi titl addit put dictionari uniqu singl word occur movi titl stop list frequent word pattern match base enlarg dictionari perform accuraci utter movi titl note classifi construct train requir discuss predict town rightmost longest match base dictionari town perform accuraci utter town discrep due fact larg number utter label town erron predict theater mistaken town match easili prevent keyword town put entri dictionari keyword area pattern match base dictionari achiev accuraci utter town successfulli block match theater town theater typic theater area predict theater rightmost longest match base dictionari theater perform accuraci utter theater reason low overlap theater town lack uniqu theater rice lake squar cinema refer rice lake squar rice lake rice squar rice theater address construct larger keyword dictionari put theater dictionari occur town put dictionari theater end word indic mall word repeat step trail word entir theater consist word theater add dictionari add uniqu unigram theater town stop list make manual compon modifi frequent due common misunderstand ad dictionari entri predict match base dictionari achiev utter theater misclassif town occurr town theater refer town recov locat distinct repres task attribut question movi theater predict task predict task question determin error extern constraint semant task preclud presenc movi class attribut error product previou baselin tabl comparison classif accuraci illinoi data percent task requir make detect kind error utter predict task dream plai twelv movi titl semant violat error occur movi theater task correct put tabl summar baselin result compar previou result topic identif evalu test set utter care interpret column previou result accuraci predict task figur predict result task baselin attempt predict care subset featur salient unigram bigram figur column product number accuraci expect error independ column observ error correct recov evalu evalu carri corpu utter collect origin evalu dialogu manag strategi utter transcrib automat utter transcript human queri system depend dialogu state user truncat acoust total utter partit set test set data addit train data check systemat error appar decid run classifi modif test question classifi train develop corpu set instanc weight tabl list absolut rel accuraci test data inspect classif error reveal systemat problem theater notic differ jersei illinoi preval schemat east refer user theater class attribut total human automat tabl classif accuraci jersei test data east construct absent illinoi data turn sourc systemat mistak reason approach work good perform simpl heurist task hand easi domain term total number predic implicitli extract kind predic kind find movi theater locat semant sort noun phrase determin predic inform verb extract predict inform accuraci due presenc potenti sourc point write rule hand automat rule induct automat construct rule base heurist viabl produc classifi easi reason inform extract accur reliabl predict local syntact featur redund flat semant detect correct classif error refer jennif adapt mix initi spoken dialogu system inform proc anlp pp jennif bob natur languag call comput vol pp alfr aho margaret string aid bibliograph commun vol pp ross program machin morgan san jennif automat dialogu strategi adapt spoken dialogu proc pp
AI/409 2 geometr foundat probabl vu ha peter haddawi system artifici intellig lab dept wi abstract reason probabl wealth situat rang pool knowledg multipl expert probabilist plan research typic repres probabl interv develop wide arrai techniqu suit requir paper provid analysi central issu repres reason interv probabl focu analysi probabl oper interv perform extens studi oper rel manipul set probabl studi insight sourc strength weak approach handl probabl interv demonstr applic result problem infer interv bayesian network project evalu abstract probabilist plan introduct recent year probabl found applic wealth area probabl facilit elicit domain knowledg insuffici exact probabl elicit knowledg multipl expert result abstract detail probabilist model studi sensit robust probabilist bayesian network probabl advoc altern belief research feel comfort paradigm strict bayesian requir exact probabilist model method exist repres interv commonli approach research work problem mention previou paragraph develop number techniqu handl probabl interv date lack uniform studi central issu manipul probabl interv make step studi approach origin observ probabl oper li heart numer comput probabilist plan expect util bayesian network propag present interv gener call provid analysi kei properti rel manipul set probabl distribut show substitut probabl produc interv version plan project bayesian network propag algorithm bayesian network propag algorithm base dechter bucket elimin algorithm draw theoret analysi produc effici version gener algorithm approach rest area finit convex geometri result applic problem discret finit probabl distribut rest paper organ start section quick review convex geometr concept relev analysi stand origin call adopt term accord standard convex geometri terminolog fine analyz section defin concept data structur basic build block data interv probabl analysi section present theoret foundat probabilist plai fundament role section concept develop interv version dechter bucket elimin algorithm propag interv bayesian network plan project bayesian network probabl bound comput algorithm correct tight suggest explan difficulti comput tight probabilist bound problem section return analyz investig approach repres convex set probabl distribut show class ident class set probabl special belief view lower envelop set probabl repres wai section address issu evidenti updat studi insight explan updat gener belief function difficult issu subject extens analysi add perspect probabl start introduct basic concept convex geometri euclidean space vector space equip product defin pair point yi convex combin point xn linear combin coeffici call convex sum denot cc sum call probabl vector compon set convex hull denot set convex combin point set convex map oe convex set convex map preserv convex cc cc point convex coeffici convex map map convex set convex set convex hull finit set point call polytop polytop smallest set point convex hull equal call set vertic polytop polytop vertic point set probabl distribut sampl cardin call probabl simplex probabl distribut sampl fs correspond point defin gener version probabl rest interv implicitli understood close subinterv definit defin interv vector function map vector wn set point set consist point form cc write cc case call sum sum stand denot icc sum special case minkowski familiar notion convex geometri differ sum coeffici minkowski sum arbitrari properti constitut basi framework fact probabl distribut express sum repres ith vertex probabl simplex fact set probabl set probabl distribut close fact interv entir interv denot wn polytop vertic fx xn xn fact convex map commut convex set oe convex map defin hg cc cc import formul theorem convex hull oper commut conv cc cc section introduc concept special tree view data structur set real number set probabl distribut annot tree branch annot interv node annot set point constraint intern node children fc set annot result appli defin interv annot branch set annot children cc complet defin set point leav interv branch tree encod set point obtain appli leav root leav annot interv call figur depict discuss evalu sum icc close interv note set convex set real number set interv directli theorem convex hull oper icc interv show close interv show lower upper bound explicitli obtain due upper bound upper bound achiev maxim cc upper figur bound special case continu knapsack pack materi categori unit size materi categori number weight restrict weight interv object maxim total achiev greedi approach sort valu descend break ti arbitrarili put knapsack materi current categori subject weight constraint interv sum assign weight minu sum lower bound remain constraint interv restrict explicitli mandatori descript ensur lower bound condit satisfi futur illustr idea comput icc assign weight materi number comput remain weight assign weight materi number weight assign materi total lower bound icc repres figur tree depth root children remark complex algorithm comput sum domin sort materi log call step analog step comput lower bound bel figur exampl face probabl simplex fa set distribut vertic fp belief function bel mass function focal element fa repres interest leav annot vertic probabl simplex set singl element vertex probabl tree encod set probabl distribut call letter stand figur depict fa set vertic probabl simplex figur repres call face polytop figur repres set probabl polytop vertic figur repres belief function view lower envelop set probabl distribut discuss section probabilist plan framework uncertainti state world effect action repres planner tradeoff repres util object find optim plan optim defin maxim expect util exist plan world repres figur concret action abstract action iti distribut state action repres stochast map state frame probabilist planner face burden comput complex seek optim solut popular address problem abstract techniqu guid search plan space reduc cost plan evalu concept appli markov plan structur approach framework plan problem formal problem search optim plan space candid sequenc action planner arm capabl understand evalu abstract plan construct abstract action abstract action defin map probabl distribut state space set probabl distribut state view sound abstract concret action evalu abstract planner evalu elimin set suboptim plan explicitli evalu member set li comput effici present underli theoret framework deriv plai fundament role probabilist action plan probabilist action defin function map state world probabl distribut state world action figur map state probabl distribut assign probabl probabl map state tion fs distribut call branch action function extend function map probabl distribut probabl distribut ep cc essenti probabl distribut action probabilist plan pl finit sequenc probabilist pl fa initi world ini probabl distribut state project pl ini process determin final world final ini ini util function function assign state world real number desir state expect util plan pl defin cc final final ini conveni extend definit util function ep cc expect util plan execut initi world ini written final ini plan pl optim maximum expect util candid plan probabilist action util function import properti theorem probabilist probabilist util function convex map commut note probabilist action util function defin function extend mean expect function oe function defin extend cc show oe convex map cc cc cc cc cc cc cc cc ini ini figur illustr project evalu probabilist plan probabilist action util function convex map easi composit convex map convex probabilist plan convex map figur illustr implic theorem process project evalu probabilist plan project plan pl fa initi world ini state consist element fs initi world repres leav branch figur root node depth world execut action commut defin repres root node depth effect obtain tree replac leav distribut obtain repres replac leav tree depth figur comput expect util replac leav repres fact util function commut evalu obtain abstract action plan call probabilist action concret action gener concret action abstract probabl result world set state state definit understood figur abstract action interpret set concret action obtain process replac probabl interv consist probabl set state consist state consist condit probabl number mean obei axiom probabl consist condit state mean set concret action figur instanti abstract action figur denot instanti relationship semant abstract action function map probabl distribut set probabl distribut ag abstract plan pl sequenc action abstract action instanti plan pl abstract plan pl obtain replac abstract action pl instanti action denot relationship pl pl project abstract plan pl initi world ini process determin final world final defin final ini expect util abstract plan pl defin ini ini notion abstract action plan introduc model sound central concept abstract action call sound abstract concret action initi world ini ini ini abstract action figur sound abstract action figur abstract evalu set concret repres singl abstract singl evalu concret plan set individu substanti reduc time complex find optim demonstr number toi exampl success realworld applic evalu abstract plan amount determin infimum supremum set ini endpoint interv ini call expect util interv pl interv approxim comput theorem gener theorem theorem abstract action abstract plan abstract action abstract cc cc consequ initi world ini set probabl distribut written ini cc expect util interv abstract plan project ini approxim ini ini cc cc icc commut equal due fact util function convex hull oper equal illustr idea switch probabl number probabl context project evalu abstract replac probabl interest interplai abstract util convex plai kei role project evalu abstract probabilist plan planner import properti process evalu abstract plan perform step project branch action plan branch current expand process world set probabl distribut repres comput expect util interv plan replac leav final util valu evalu result reader refer discuss project algorithm theorem state convex hull project abstract world term describ state affair project abstract action abstract action map return set probabl world set probabl distribut project convex hull world result heavili util conveni approxim set probabl distribut convex hull theorem abstract action abstract plan relat prove amount prove element form cc concret commut written cc element interv bayesian network section make infer interv bayesian network bayesian network pair consist direct acycl collect probabl tabl node node graph repres random probabl tabl specifi condit probabl node parent bayesian network repres joint probabl distribut random variabl distribut obtain multipli condit probabl tabl figur depict bayesian network condit probabl bayesian network repres joint probabl distribut interv bayesian network gener bayesian network probabl repres set bayesian obtain process replac interv probabl consist point consist mean point obei axiom probabl figur depict interv bayesian network regular bayesian network figur instanti denot figur bayesian network interv bayesian network instanti relationship answer probabilist queri defin interv endpoint infimum supremum rang bayesian network instanti figur interest comput defin pn pn dechter show bayesian network algorithm updat find probabl find maximum posteriori comput maximum expect cast unifi algorithm schema call bucket elimin present interv version schema comput bound probabl node section case evid problem answer probabilist queri evid studi section discuss evidenti updat main idea algorithm understood figur interest comput probabl bound random variabl joint distribut repres bn instanti note written goal factor sum seri probabl gener seri factor correspond appli bucket elimin algorithm order tg random variabl fact formula gener sum fix mean gener insid sum sum obviou remain sum formula gener sum icc icc icc algorithm gener case interest comput bound probabl node fx topolog order random variabl denot set parent node bound approxim icc icc icc icc note bound obtain algorithm tight algorithm suggest theorem project evalu abstract plan problem evalu abstract plan answer closer problem reveal fact special case answer queri view instanc abstract plan evalu suitabl choic world action loss algorithm evalu abstract plan due fact sum appli yield exact comput global relat perform local independ analogu loss occur approxim maxim sum correl individu sum maxim tradeoff make avoid resort costli techniqu linear program experi planner show approxim produc suffici tight bound order elimin larg class suboptim plan set distribut investig data structur encod set probabl distribut show class class set probabl discuss complex switch show belief interpret lower envelop set repres wai set distribut question answer introduc kind set probabl distribut theorem convex hull oper equal convex hull encod convex set probabl distribut recal figur demonstr set probabl distribut repres node level vertic polytop total number vertic result state close set repres set probabl distribut class class set probabl distribut theorem cc polytop auxiliari standard result convex geometri lemma convex set finit set point point point ui max ui polytop vertic point set real number product element written ki cc icc case view set set probabl util ki expect util interv abstract plan final world easi order comput bound interv minim maxim xi finit set vertic polytop fact weight greedi knapsack algorithm evalu section chosen base order valu materi finit number finit set point satisfi condit auxiliari lemma easi task determin vertic polytop repres estim number vertic polytop repres found number vertic polytop repres node asymptot bound proof result involv omit obtain rough upper bound argument denot number vertic polytop denot set polytop assum cc polytop repres polytop polytop fact proof theorem impli chosen upper bound obtain implic polytop suffici larg number requir arbitrarili larg number node repres implic bound theorem theorem posit integ strict subset exist construct polytop node belong fix point point exist entir probabl set kg easi verifi establish theorem belief function subsect show belief function view lower envelop set probabl repres mass assign function preliminari formul result finit set function bel call belief function bel bel bel mass assign function belief function bel obtain transform subset assign posit mass call focal call frame call basic probabl assign element belief function bel belief function bel view lower envelop set probabl distribut consist probabl distribut consist bel show set probabl distribut consist belief function close convex theorem assert set set probabl equal weight sum face probabl face weight proof theorem found theorem bel cc side interpret set probabl distribut figur evidenti updat theorem natur class ident class set probabl method repres polytop linear principl determin vertic polytop establish system linear inequ polytop probabilist plan framework section approach effici repres uncertainti world list vertic comput list action task difficult determin system linear inequ uncertainti world action project plan project process reduc simpl plan evalu util process reduc simpl evalu process number properti abstract action plan lemma context evidenti turn suitabl linear program counterpart investig reason limit section bayesian approach deal uncertainti involv repres uncertain inform prior probabl distribut updat observ evid obtain posterior probabl distribut defin view evid call evidenti function map probabl function probabl probabl function undefin paper call evid subset sampl bayesian paradigm challeng due requir singl prior probabl distribut statist inform cautiou bayesian approach address issu set prior probabl updat member set observ evid obtain evidenti updat approach refer convex convex convex set probabl distribut subject extens studi white studi case prior set distribut call evid system linear inequ snow show case evid singl uniformli posit white method condit yield exact result convex studi case set prior distribut set distribut consist belief function bel fagin halpern show lower upper envelop correspond pair belief plausibl function show gener strict subset set distribut consist belief function result mean belief function lose inform updat process show loss inform troublesom piec evid updat order piec evid produc result result obtain updat piec evid singl dempster condit bound conjunct convex condit develop exact condit procedur lower class class belief function investig problem convex condit cc hard evid interest determin cc start studi problem special case case face probabl simplex gener case set probabl distribut vertic shown polytop vertic set kg provid proof statement similar proof highli instruct upcom analysi theorem argument involv convex case case easi element side form ff element side form fi set equal establish construct map ff fi easi check map fi satisfi requir observ proof theorem evidenti function preserv convex combin convex map evidenti function difficulti updat evidenti function commut illustr point case updat belief function recal belief function bel mass assign function focal element written bel cc theorem figur evidenti function commut obtain investig base geometr show phenomenon occur normal step probabl normal divid sum cc cc cc ident bel result combin belief function bel evid dempster rule combin imposs bound obtain dempster rule gener strictli narrow bound obtain convex difficulti evidenti updat translat difficulti answer probabilist queri interv bayesian network evid straightforward attempt extend algorithm section evid involv maintain set probabl list polytop vertic incorpor evid theorem comput bound probabilist queri effect realiz idea requir effici algorithm altern leav issu futur research acknowledg doan van vu prove theorem anonym insight comment suggest work support part nsf grant refer boutili abstract plan time constraint twelfth nation confer artifici page juli abstract probabilist model action intern confer artifici intellig plan page june increment condit lower upper probabl intern journal approxim robust analysi bayesian network local convex set distribut thirteenth confer uncertainti artifici page august pack nicholson plan time constraint stochast domain artifici juli dechter bucket unifi framework probabilist infer algorithm twelfth confer uncertainti artifici page august dempster upper lower probabl induc map annal mathemat draper local partial evalu bayesian belief network phd comput scienc univ novemb fagin halpern approach updat belief uncertainti artifici intellig page kw js probabl interv influenc diagram ieee transact pattern analysi machin march convex polytop haddawi geometr foundat probabl submit annal mathemat artifici intellig ha haddawi theoret foundat probabilist plan twelfth confer uncertainti artifici page august ce kahn jr refin plan medic manag acut deep medic hank practic tempor project eighth nation confer artifici page juli bayesian updat belief function ieee transact jr bayesian evidenti updat artifici bayesian ieee transact levi knowledg mit share prefer bayesian maker journal shafer mathemat theori evid princeton snow bayesian infer point estim nation confer artifici intellig page snow improv posteriori probabl estim prior condit linear constraint system ieee transact stirl convex theori ieee transact interv probabl propag intern journal approxim schneider stochast model action plan anytim plan uncertainti intern journal intellig statist infer probabl chapman white posteriori base linear inequ descript priori condit probabl ieee transact
IR/410 5 annot web page cream siegfri steffen staab institut germani abstract richli data constitut basi semant web provid creation metadata annot mode cream creat metadata exist web author mode author creat metadata free put content page cream creat relat metadata instanti interrel definit class domain ontolog compar rigid schema dublin core discuss requir meet develop integr metadata infer document manag describ web page author annot tool semant rdf approxim word introduct semant web build metadata describ content web page tic web requir relat metadata describ resourc descript instanti class definit semant interlink properti previou paper version cream annot framework suit easi comfort creation relat metadata provid annot tool implement call annot environ major drawback order provid metadata content web author creat content version updat version implement extens download version develop correspond function paper annot content annot step save work put addit work load creator author possibl easili combin author web page creation relat metadata describ content difficulti encount web page author found similar annot web page relat metadata found prefer hide border author annot build complet extend framework cream tool order reflect metadata creation web page author annot introduct meta ontolog describ annot author mode ¢ class properti ontolog mode interact switch easili author ¢ annot sketch usag scenario describ ment meet creation metadata explain terminolog detail give metadata creat deriv design cream requir elabor section meta ontolog modular ontolog descript ontolog cream section explain major mode interact implement cream give survei relat work categori knowledg markup knowledg annot environ author environ scenario requir cream origin work face challeng date back start semin initi provid semant markup html page knowledg acquisit commun present web portal portal view knowledg knowledg acquisit commun semant retriev provid origin mean navig queri knowledg base includ guidelin build knowledg portal potenti user provid annot web page decentr manner knowledg collect portal crawl present varieti wai scenario semant markup order provid knowledg time market tal creat knowledg portal busi analyst princip idea busi analyst review busi plan busi report part work requir comparison aggreg similar relat queri compani provid knowledg semant portal handl type annot feed back portal question start case intuit case easili support simpl annot tool found face princip problem found scenario succe end give peopl possibl easili creat document metadata step princip requir annot integr web page author metadata creation outlin semant structur adher ontolog order ¢ share knowledg avoid peopl complex instanc attribut type proper identifi institut ¢ uniqu metadata exist identifi colleagu dieter fensel knowledg grasp straightforward queri avoid decentr knowledg provis ¢ annot identifi sourc annot captur knowledg order avoid redund annot relat html spread relat ¢ html knowledg markup semant relat reader similar effect bibliographi queri jame hendler wise excel current annot tool tend gener annot environ support dublin core provid mean id knowledg markup maintain annot tool support ¢ mainten task obviou annot environ easi order ¢ object easili metadata creation involv intric navig semant structur effort product metadata larg restrain threshold ¢ effici tool support metadata metadata user tend produc requir relat depend autom metadata creation preprocess document version cream present target solut metadata ation web page author annot object pursu combin advanc mechan fact document meta ontolog metadata content inform extract explain section relat metadata elabor terminolog term regard metadata creation tool carri ambigu connot impli conceptu import design ontolog explicit specif share conceptu ¢ domain interest case constitut statement express definit class properti annot context set instanti attach html ¢ document distinguish instanti instanti properti web context typic term resourc speak class instanc datatyp instanc henceforth call attribut instanc class instanti properti class instanc class instanc henceforth call relationship instanc class instanc uniqu frequent attribut label metadata data data context annot metadata ¢ html document relat term relat metadata denot annot ¢ tain relationship instanc term share core altern mean annot emul approach model note attribut instanc comment note relat url paper attribut instanc relat metadata statement cooper relat metadata relationship class instanc textual note figur illustr term depict part web research ontolog show page siegfri steffen annot xml serial rdf fact person instanc denot uri relationship instanc cooper erat inform page object cream easi gener target major mode interact annot web page author implement creat uri method ontolog annot web page url graduat person lectur academ staff design cream cream modul figur annot staab requir section feed design cream design link requir cream modul result map function overview matrix tabl document document visual document content ¢ metadata creator easili provid metadata highlight text document viewer support format content editor convent author document ¢ instanc drag visual content annot infer server drop document piec text link produc account inform meta ontolog section newli gener content annot meta ontolog guid construct xpointer attach instanc ontolog guidanc fact annot framework guidanc ¢ ontolog order share newli creat annot ontolog metadata creator instanti arbitrari class erti semant properti remain void framework adapt vari ontolog order reflect foci metadata creator ontolog browser fact import order guid metadata creator creat relat metadata preliminari experi found subject problem creat relationship instanc creat attribut instanc ontolog miss cue assign relationship class instanc ontolog browser document easi avoid syntax error good visual ontolog class instanc creation relat metadata place semant web ¢ metadata creation subject awar entiti exist part semant web crawler make relev entiti immedi metadata creator proper decid entiti uri entiti identifi metadata metadata creator recogn properti instanti link consequ metadata awar relat metadata class instanc relat flat templat fill built rdf crawler basic tool gather interconnect fragment rdf web build local knowledg base data detail rdf crawler freeli download annot infer relat proper refer avoid ¢ annot requir queri queri instanc exist check provid annot infer server framework annot infer server reason crawl newli creat instanc ontolog serv ontolog guidanc fact queri exist instanc properti underli base infer engin annot infer server infer engin combin reason logic languag semant fact reason fact serv peer document order avoid redund metadata creation ¢ suffici instanc exist annot infer server metadata creator decid captur knowledg web queri singl instanc consid relev web page annot dynam html page desir store annot web page annot web page annot valid invalid metadata creator decid base annot base web page futur goal document manag framework annot part document pattern match annot current implement straight forward base document ment approach uri detect annot document highlight annot document user user decid ignor delet annot creat augment exist satisfi annot metadata inform sophist tool ¢ provid semant annot major goal metadata ation advantag inform extract techniqu annot metadata creator facilit metadata creation task environ envisag major metadata compar exist metadata liter newli type exist text mention document trigger referenc point learn markup order automat annot structur page messag extract system recogn extract relationship text compon integr tool ing integr simpl wrapper approach work integr inform extract system meta meta ontolog separ ontolog design ¢ specif explain section requir constitut singl identifi function cross modul cream support wai storag annot store ¢ side document document manag store annot infer server provid simpl replic mechan crawl annot ¢ annot infer server tabl design link requir cream modul requir storag replic document ontolog crawler annot document metadata gener meta content gener editor guidanc infer manag inform ontolog gener problem server extract consist proper refer avoid redund relat metadata mainten effici architectur cream architectur cream depict figur design cream framework pursu idea flexibl open implement flexibl regard ad replac modul document ontolog browser constitut major part cal user interfac structur replac altern viewer work pdf viewer plugin capabl write rdf pdf ment capabl provid plugin establish vide connect commerci document manag system core basic function work annot infer core simpl mean navig taxonomi se semant capabl datalog reason subsumpt connect annot infer server meta ontolog core idea meta ontolog modular ontolog develop defin ontolog exist independ creation metadata web page author annot meta ontolog describ attribut relationship ontolog cream environ recogn urgent meta ontolog elabor section reader note descript meta ontolog influenc interact depend extent mode interact section vice versa architectur serv basi annot type label annot tool gui ontolog guidanc fact browser annot environ annot document editor plugin viewer queri annot author annot markup plugin plugin extract document manag annot infer server inform extract compon figur architectur cream copi crawl load www web page annot web page domain ontolog specif rdf version resourc assign instanc instanti class ontolog properti se assum ontolog definit secur middl state properti properti ssn role class person link meta ontolog relev piec ontolog proper author annot environ exploit addit piec inform point instanc instanc creat piec text chosen repres cream creat urn calli assign piec text attribut record content instanc select gener content web gener text produc attribut produc text human author attribut refer instanc note person creat web page content refer social secur number ing exist instanc creat instanc person social secur number reader note small ¢ differ metadata creation effort click connect ontolog meta ontolog object ¢ linkag depend ontolog metadata creation scenario statement text passag hold meta ontolog descript conjectur click differ distinguish success failur tool default point instanc creat desir point web page analog type definit order default point behavior class exploit xpointer candid recommend meta ontolog properti properti interact place instanc instanc gener properti instanc type xpointer rent web page automat ad slot stanc content instanc gener web page attribut xpointer offer link gener attribut type indic link text href xpointer matic gener model ontolog person properti instanti meta ontolog annot peopl label pointer mechan gener uniqu id reason creation pointer correct link peopl mention homepag linkag meta ontolog ontolog proper depend current usag scenario properti mode properti mode distinguish correspond wai properti treat metadata creation order describ metadata simpli point place piec text piec multimedia point place order refer current presid presid metadata remain refer apt point part part scalabl vector graphic reader note default pointer vice versa order describ metadata copi excerpt resourc contrast mode quotat chang resourc copi string presid remain unchang origin sourc abandon unlink unlink fact describ stem pend resourc unlink fact typic comment apt combin refer order elucid mean graphic piec multimedia refer point pictur attribut unlink fact unlink fill specif civil mean properti mode slightli overlap definit rang properti reason pointer uri uri typic liter separ uri pointer uri make liter pointer definit rang properti quotat unlink fact consid orthogon rang properti liter resourc meta ontolog descript conclud reader note list possibl meta ontolog descript sketch close partial meta ontolog descript knowledg acquisit ¢ describ softwar tool metadata figur ber attribut requir softwar tool meta ontolog definit attribut instanc requir attribut instanc inform ical gener templat interfac similar structur dublin core templat approach akin construct knowledg acquisit interfac ¢ author dynam ontolog web page cf provis locat annot ¢ trivial object easili clash metadata gener usag elabor meta dynam rule figur templat mode interact metadata creation process support type interact tool cf figur annot type involv work ogi browser annot involv data document ontolog browser annot author web involv data fact browser document editor order clarifi role type describ differ gener type gener instanc class gener attribut instanc gener relationship instanc annot type annot type pure base ontolog browser section gener templat section experienc user navig ontolog experienc user templat user gener metadata attribut relationship complet independ web page view specif properti creat instanc type uri urn properti fill text specif default pointer meta ontolog associ newli creat instanc mark passag text user instanc knowledg order creat relationship instanc arrow figur annot markup basic idea annot markup usag content document instanc gener gener class user drag mark piec content concept class instanc gener class definit meta ontolog descript uri gener urn properti assign mark text arrow figur mark drop piec text concept creat instanti urn belong assign slot urn default pointer provid gener attribut order gener attribut instanc user simpli drop mark content tabl entri arrow figur depend attribut refer quotat xpointer content fill attribut gener relationship order gener attribut instanc user simpli drop mark content relat instanc arrow figur instanc instanc gener connect preselect instanc annot author major process author web page metadata modi author ontolog guidanc fact browser content gener author metadata gener inform extract implement mean content gener integr tion extract annot markup refer reader point simpl inform extract metadata section author produc consist metadata figur annot author content gener invert process markup figur exist instanc label class drop class instanc fact browser document creat text label link arrow figur attribut drop attribut instanc fact browser document arrow figur gener text quotat unlink link text relationship drop relationship instanc fact browser document gener simpl drop relationship instanc rudi steffen trigger creation small piec text arrow figur text correspond instanc label label relationship studer cooper steffen piec text requir edit figur annot author creation list tabl select concept explor comparison relat work cream compar framework semant web consid knowledg acquisit framework vagu similar annot focu fourth author framework emphasi metadata creation knowledg markup semant web major system intens knowledg markup semant shoe ontobrok webkb reli knowledg html page start provid manual editor experi shown knowledg yield extrem poor syntact improp problem sketch scenario section approach line research closest cream shoe knowledg annot webkb annot tool shoe knowledg annot java program user webpag shoe ontolog shoe system defin addit tag bodi html page shoe knowledg annot helper earlier full fledg annot environ webkb conceptu graph repres semant content web document bed conceptu graph statement html page essenti offer templat interfac knowledg acquisit framework comparison knowledg acquisit framework cream framework creat class properti instanc popul html page target roughli similar target instanc acquisit phase framework distinguish ontolog edit ti obviou differ cream intend support web manag displai web page mention web page author adopt principl meta ontolog distinguish wai class properti treat comparison annot framework lot commerci annot tool tool share idea creat kind user comment web page term framework understood remark exist document user tool attach note nice web page cream design ontolog type comment unlink nice attribut instanc belong instanc class comment uniqu xpointer step reli rdf schema kind templat fill annot user schema dublin core fill document restrict attribut instanc user decid complex rdf descript simpl string fill templat support provid syntact correct statement proper refer system similar cream annot tool cite tion extract compon massachusett amherst popul ontolog metadata dealt relat metadata author concern comparison author framework approach relat cream author associ tool extens microsoft powerpoint pursu idea produc powerpoint document metadata code document composit concept relat instanti button ad powerpoint toolbar click author insert annot graphic element graphic element correspond instanc concept arrow element correspond relationship instanc order ontolog powerpoint assign graphic symbol concept begin ontolog editor kind meta ontolog associ powerpoint document cream provid graphic support support part annot permit simultan creation document metadata addit annot exist document associ shown interest idea futur cream author hypertext author concept topic project automat gener metadata descript content web page compar token concept lexicon support ontolog support creation relat metadata unclear extent consid synchron product document metadata author similar metadata automat fill dublin core field advantag statist method alloc valu base current ment jim hendler state markup normal comput requir interact user assist creat page markup creat cream framework offer solid start vision true cream framework creat relat metadata foundat futur semant web version cream present support metadata creation web page author annot cream infer document manag ontolog document meta ontolog refer implement cream framework vide plugin interfac extens inform metadata integr ontolog edit evolut deal issu practic experi identifi problem relev analysi gener problem complet investig tool brought creation relat metadata acknowledg research present paper colleagu student institut gmbh inform technolog stefan decker stanford michael erdmann alexand maedch research leo xu research paper partial financ air forc darpa daml project refer decker build ontolog midterm report intern journal human comput rv guha resourc descript framework schema specif technic recommend van horrock enabl knowledg web extend rdf schema proc www page acm angel queri infer servic rdf queri languag workshop decemb studer ontolog base access distribut inform meersman semant issu multimedia page kluwer academ annot tool web browser applic inform retriev april daniel xml pointer languag version technic candid recommend septemb dublin core metadata april dublin core metadata steffen staab manual semant text annot tool cole workshop semant annot intellig august musen automat gener ontolog editor banff knowledg acquisit andrea witt access inform sourc www world confer www internet refer descript ontolog markup march de hall conceptu open hypermedia semant intern workshop semant page hong gruber translat approach portabl ontolog specif knowledg maedch cream creat relat metadata ontolog driven framework octob heflin hendler search web shoe artifici intellig web search paper aaai workshop page aaai jame hendler agent semant web ieee intellig system horrock express descript fact sixth intern confer principl knowledg reason june page morgan wiederhold web site manag semant web work symposium august swick open rdf infrastructur share web annot proc intern confer hong wu logic foundat languag journal automat gener metadata base concept white paper kushmerick wrapper effici express artifici hendler web agent intern confer autonom martin eklund knowledg web document int world wide web conf page elsevi scienc messag understand nejdl wolf network infrastructur base rdf www submiss musen interfac domain empir evalu intern confer softwar knowledg engin semant commun web portal proc comput staab maedch knowledg portal ontolog work ai summer creat metadata semant annot framework human factor technic report institut role cot applic semant web semant web work symposium august buckingham knowledg extract annot tool workshop knowledg markup semant octob yee hyperlink
ML/411 6 face detect mixtur linear subspac paper abstract present method mixtur linear subspac face detect grai level imag method mixtur factor analyz concurr perform cluster perform local reduct paramet mixtur model estim em algorithm face detect probabl input sampl predefin threshold mixtur subspac method kohonen map cluster fisher linear discrimin find optim project pattern gaussian distribut model densiti function project sampl class paramet densiti function maximum likelihood estim rule base maximum likelihood wide rang face imag includ express light condit train set captur variat human face method test set imag face result dataset show method perform method fewer detect introduct imag human face central intellig human comput interact research involv face includ face face pose express recognit gestur recognit exist method topic assum human face imag imag sequenc identifi local build fulli autom system extract inform imag human essenti develop robust effici algorithm detect human face singl imag sequenc goal face detect identifi locat human face pose light condit challeng problem human face highli object high variabl color textur recent method face detect detect frontal face light condit present face detect method mixtur linear subspac detect face featur light condit imag human face lie complex subset imag space model singl linear mixtur linear subspac model distribut face pattern detect method extens factor analysi factor analysi statist method model covari structur high data small number latent analogu princip compon analysi unlik defin proper densiti model data cost code data point equal princip compon subspac densiti unnorm pca robust independ featur data princip compon maxim varianc input retain unwant variat hinton al appli fa digit recognit compar perform pca fa model mixtur model factor analyz recent extend appli face recognit studi show fa perform pca digit face recognit light affect human distribut face imag space repres mixtur subspac subspac captur characterist face present probabilist method mixtur factor analyz detect face wide variat paramet mixtur model estim em algorithm method present fisher linear discrimin project sampl high imag space lower featur space fisherfac method shown outperform wide eigenfac method face recognit reason project pca pattern classif train face sampl class kohonen organ map label scatter matric gener optim project base gaussian model densiti function paramet estim base maximum likelihood detect input imag scan rectangular window probabl comput maximum likelihood rule determin face detect captur variat face set face imag olivetti umist harvard yale feret method test compar perform method result data set consist imag show method perform report method fewer detect test collect set imag face data set challeng profil face express face heavi shadow method detect face facial express light condit method fewer detect method relat work numer method recent detect human face singl imag sequenc imag give review face detect method survei face detect sung poggio report learn approach locat vertic frontal view human face number gaussian cluster model distribut face pattern comput subspac span cluster eigenvector comput evid face small window move portion imag base distanc metric measur face exist window detect algorithm combin templat match detect method hierarch markov random field maximum posteriori probabl estim algorithm segment imag fix scale gener imag pyramid reduc heurist select area face layer process reflect priori knowledg spatial relationship facial featur mouth identifi templat match gradient intens detect base map estim huang appli kullback rel inform maxim discrimin posit neg exampl face famili discret markov process model face background pattern estim densiti function detect face base likelihood ratio comput train moghaddam pentland probabilist method base densiti estim high space eigenspac decomposit rowlei al ensembl neural network learn face pattern face detect schneiderman al describ probabilist method base local princip compon analysi method preliminari result profil face detect hidden markov model higher order statist support vector machin appli face detect demonstr success detect upright frontal face light condit mixtur factor analyz fit mixtur model factor analyz train sampl em algorithm obtain distribut face pattern detect input imag scan rectangular window probabl current input face pattern calcul face detect probabl predefin threshold briefli describ factor analysi mixtur factor analyz section detail model found factor analysi factor analysi statist model observ vector partit unobserv systemat part unobserv error part systemat part linear combin small number unobserv factor variabl compon error vector consid uncorrel independ point factor analysi descript interdepend set variabl term factor regard observ variabl observ data vector model vector factor gener smaller gener model factor load matrix factor assum distribut normal unit random variabl distribut diagon due assumpt observ variabl independ factor distribut covari goal factor analysi find model covari structur factor variabl model correl element variabl account independ element factor plai role princip compon inform project data expect factor comput linear xx mixtur model mixtur factor analyz factor analyz number factor factor analyz gener model obei mixtur paramet mixtur model vector adapt mix latent variabl model factor mixtur indic variabl data point gener factor analyz set train em algorithm estim em comput expect interact hidden variabl log jx defin ij equat obtain ij equat obtain jx ij em algorithm mixtur factor analyz state comput data point mixtur compon solv set linear equat mixtur factor analyz essenti reduc mixtur gaussian factor analyz fit gaussian portion weight posterior ij covari matrix gaussian lower factor load model paramet dedic model covari structur high dimens detect face pattern detect input imag scan rectangular window probabl face pattern estim equat face detect probabl predefin threshold order detect face input imag repeatedli subsampl factor scan iter mixtur linear space fisher linear discrimin mixtur kohonen map divid face sampl face class gener label sampl fisher project comput base class maxim ratio scatter scatter label train set project high imag space lower featur gaussian distribut model densiti function class paramet estim maximum likelihood principl condit probabl sampl class comput maximum likelihood principl decid class sampl belong reason face class size train set number class cluster result poor figur prototyp face class sampl estim densiti function larg number class label sampl som appli fisher linear discrimin find class label train sampl inform train sampl kohonen map divid face sampl finit number class divid face sampl imag class final weight vector node centroid prototyp correspond prototyp class procedur appli sampl figur show prototyp face class clear sampl face imag pose light condit lower corner upper left classifi class note som algorithm place prototyp featur shown accord topolog relationship imag space prototyp vector nearbi point featur map grid nearbi locat high imag space nearbi prototyp similar intens fisher linear discrimin pca commonli project face pattern high imag space lower featur drawback approach defin subspac greatest varianc project sampl vector subspac project suitabl classif princip compon retain unwant larg variat class project space cluster fisher linear discrimin class specif method find optim project classif find project maxim project determin maxim ratio scatter scatter classif simplifi project space demonstr fisherfac method outperform eigenfac method face recognit scatter matrix defin sb scatter matrix defin sw class number sampl class optim project chosen matrix orthonorm column maxim ratio determin scatter matrix project sampl determin scatter matrix project arg max jw jw sw wm fw ji mg set gener eigenvector sb sw largest gener eigenvalu ji mg rank sb sum matric rank upper bound detail method overcom singular problem comput densiti function label train set project featur gaussian distribut model densiti ccd maximum likelihood jx zk jx zk detect face pattern input imag scan rectangular window determin face exist window rule decid input window face base maximum arg max detect face input imag repeatedli subsampl factor scan iter experi set face imag olivetti umist harvard yale feret wide variat facial express light condit mixtur start exampl imag extrem difficult collect repres set bootstrap method similar includ exampl train face sampl manual crop normal align vertic size pixel make detect method sensit scale rotat face exampl gener origin sampl imag produc randomli rotat imag scale produc face sampl test method set imag collect rowlei sung detect face success detect subimag ey mouth detect detect rate ratio number success detect number face test set tabl show detect rate method report result detect method test set result test set consist imag exclud imag hand drawn show method compar detect perform fewer detect tabl show result test set sung poggio consist imag exclud imag line drawn face method consist perform detect test set consist imag collect world wide express face heavi shadow detect rate method number detect method perform equal detect face method perform slightli figur show result method test imag web page mention result notic detect upper left corner imag figur window resembl face notic method profil face face heavi shadow rotat face face detect effect method due lack exampl train set exist detect method effect detect type face recent method detect rotat face method detect occlud face face heavi shadow discuss method mixtur linear subspac method detect human face facial express light condit method find project pca pattern facilit detect face pattern method fit mixtur factor analyz estim densiti function face method map partit train set class fisher linear discrimin find optim project classif result set imag demonstr method perform algorithm detect upright frontal fewer detect contribut paper summar introduc project method perform pca classif result linear subspac appli mixtur model linear subspac captur variat face pattern method appli mixtur pca project suboptim classif subspac tabl result imag test set imag test set imag text test set test set method detect rate detect detect rate detect mixtur factor analyz fisher linear discrimin neural network naiv kullback rel inform support vector machin figur sampl result mixtur factor analyz imag test set detect face shown window figur sampl result mixtur subspac fisher linear discrimin imag test set detect face shown window clear svm perform face detect studi appli svm small test set face great interest compar method svm larg test set svm aim find optim hyperplan minim gener error theoret upper bound refer kriegman eigenfac recognit class specif linear project ieee transact pattern analysi machin huang face detect maximum discrimin ieee comput societi confer comput vision pattern page duda hart pattern classif scene analysi john huang mixtur local subspac face recognit ieee comput societi confer comput vision pattern page graham virtual gener face recognit face theori volum nato asi seri comput system page deform model face recognit arbitrari light condit phd harvard model manifold imag handwritten digit ieee tran neural kohonen organ map moghaddam pentland probabilist visual learn object recognit ieee transact pattern analysi machin girosi train support vector applic face detect ieee comput societi confer comput vision pattern page poggio gener framework object detect intern confer comput page rauss feret evalu face theori volum nato asi seri comput system page qian huang object detect hierarch map estim ieee comput societi confer comput vision pattern page patil find face photograph sixth intern confer comput page kanad neural face detect ieee transact pattern analysi machin kanad rotat invari neural face detect ieee comput societi confer comput vision pattern page face recognit hidden markov model phd schneiderman kanad probabilist model local spatial relationship object recognit ieee comput societi confer comput vision pattern page sung poggio learn human face detect ieee transact pattern analysi machin kriegman face detect mixtur factor analyz ieee intern confer imag kriegman survei face detect method ieee transact pattern analysi machin
AI/412 2 fifteenth nation confer artifici intellig page juli probabilist system daphn koller comput scienc depart stanford gate ca avi pfeffer comput scienc depart stanford gate ca abstract import thread work knowledg todai system bayesian network provid excel organiz structur larg complex applic limit inabl deal uncertainti bn provid intuit coher probabilist limit abil handl complex structur domain provid languag cleanli integr preserv advantag approach provid natur compact definit probabl model local class frame model instanti set interconnect result coher probabl distribut instanc properti languag repres import type uncertainti accomod framework tradit uncertainti set entiti present uncertainti relationship entiti provid infer algorithm languag reduct infer standard bayesian network describ implement system main frame system exist todai annot knowledg base probabilist inform answer probabilist queri introduct frame system primari technolog larg scale knowledg ai modular organ cognit entiti abil captur pattern common individu provid conveni languag repres complex structur domain model gap express power type framework inabl repres reason uncertain noisi inform uncertainti unavoid real inform inaccur reason true case problem larg resolv past decad develop copyright american associ artifici intellig reserv probabilist reason bayesian network bayesian network full joint distribut set random answer queri variabl evid bn complex distribut repres compactli local influenc model world proposit applic bn larg limit situat fix set attribut inadequ complex kr task recent work languag integr system bayesian provid bridg thread work kr kei compon annot frame probabl model probabl model broadli bn repres distribut valu slot frame simpl slot frame annot local probabl repres depend valu relat slot frame repres phd slot depend slot year slot chain simpl build standard fr approach significantli express power tradit bn probabl model slot depend slot properti instanc model depend properti relat instanc standard class hierarchi fr probabl model class multipl instanc inherit probabl model class mechan slot valu inherit make domain individu citizen framework express import type uncertainti call structur uncertainti probabilist model express uncertainti set entiti number phd student depart repres uncertainti relat confer paper provid probabilist infer algorithm languag base approach model construct algorithm knowledg base includ set gener standard bn queri effect belief slot probabl model express standard frame techniqu facet restrict properti approach virtual frame annot exist kb probabilist inform implement system base capabl interact exist okbc emerg standard fr work improv previou approach combin logic bayesian network attempt direct probabilist horn basic choic horn underli languag dictat properti inabl encapsul object properti cognit frame structur uncertainti framework typic combinatori blowup result lead approach framework overcom major limit earlier structur uncertainti probabilist depend instanc crucial absent creat complex model instanc connect varieti wai basic begin basic terminolog frame system terminolog vari wide system system paper adopt languag basic knowledg model okbc protocol basic unit frame system frame frame set slot valu filler slot repres binari relat filler slot frame frame relat hold gener slot section assum slot assumpt relax section sequenc slot separ period repres binari slot oe denot relat slot frame facet facet ternari facet facet slot frame relat hold standard facet specifi restrict valu slot slot call type main type frame class repres set instanc frame class frame organ class subclass slot class frame describ properti class templat slot inherit instanc subclass class facet templat slot templat inherit instanc subclass overrid valu inherit slot facet probabilist inform incorpor frame kb annot class frame local probabilist model class frame annot call set templat facet slot simpl complex type complex slot type simpl slot explicitli list valu slot simpl slot type complex slot advisor type professor slot particip probabl type slot featur exist kb annot probabilist requir complet redesign ontolog simpl slot node net rang set specifi probabl model simpl slot parent distribut facet natur place put probabl model view gener rang distribut rang parent facet list slot slot depend parent refer simpl slot simpl slot parent facet list slot chain oe refer simpl slot year parent parent distribut facet specifi condit probabl distribut valu slot valu parent condit distribut condit probabl tabl bayesian network combin valu probabl distribut valu slot assum repres fulli function parent valu compact easili accomod framework probabl model complex slot simpli complex slot addit facet call list slot call import list list slot visibl requir possibl empti slot chain slot chain import list probabl model class frame creat instanc inherit templat slot facet probabl distribut valu slot instanc inherit mechan frame system make subclass subclass extend definit superclass overwrit part subclass redefin slot defin subclass overwrit distribut salari specif class import aspect subtyp instanc subclass instanc fill slot type superclass instanc advisor slot instanc class valu assign slot instanc frame directli assign templat slot class level type assign interpret assign simpl slot interpret observ condit probabl distribut instanc condit process result chang belief relat slot subclass assign slot result probabl model instanc belief belief relat slot assign complex slot specifi slot instanc complex network frame student share student advisor depart assign class level result class instanc frame slot featur probabilist frame system relat frame influenc mechan parent slot simpl slot influenc probabilist slot frame frame influenc relat influenc turn resolv difficulti util basic featur slot class slot type slot type slot instanc vice versa view assign specif instanc frame slot encompass assign assign valu slot class frame class set consist frame class model unwieldi deal slot frame refer slot probabilist depend direct intertwin depend restrict lead complex interact frame lead cyclic chain influenc coher probabl model design primari direct secondari call primari secondari frame primari slot parent facet simpl list parent slot export parent list ident import list flow influenc frame neatli parent influenc slot influenc slot decid thesi slot author slot slot thesi design parent field field visibl depend slot depend slot depend import list thesi slot serv dual languag bidirect depend instanc probabilist model defin instanc class immedi impli exist instanc class start model object class exist defin model center entiti interest context semant section present semant probabilist frame knowledg base kb set class instanc semant defin probabl distribut slot valu instanc frame relat instanc order defin coher probabl frame kb satisfi condit basic theme condit familiar realm bayesian depend model acycl complic chain depend frame class instanc develop tool reason depend definit depend pair frame necessarili slot slot hold ffl simpl slot parent ffl complex slot import list instanc frame assign frame type depend assert instanc frame consist exist instanc frame consist depend instanc frame consist instanc class consist note definit depend consid slot chain slot make partit depend conserv overestim true depend necessarili case depend fairli straightforward refin notion found definit adequ definit depend chain list depend cycl depend chain begin end slot depend cycl reflect potenti problem model discuss correct model problemat simpli overestim probabilist depend depend cycl instanc correspond chain depend depend cyclic prevent defin coher probabl model depend cycl class mean instanc instanc depend necessarili case call cyclic distinct instanc class case repres infinit depend chain begin depend depend model typic probabilist semant conclud discuss disallow depend cycl type depend cycl easi prevent pure local class depend graph graph slot edg depend hold avoid depend graph acycl care design depend model slot impli make class depend graph avoid cyclic depend chain class level defin depend chain obtain theorem knowledg base class depend graph cyclic depend chain depend chain cyclic result model elimin depend chain cyclic gener problem easi prevent pure local constraint detect kb depend cycl build global direct graph call depend graph kb node slot edg depend hold kb depend cycl iff cyclic kb depend goal defin probabl distribut instanti note disallow infinit refer chain relat impli infinit depend chain assign valu slot frame issu combin make definit difficult obviou idea follow approach semant bayesian determin set random defin distribut joint space framework rich make approach set instanc frame potenti refer infinit circumv manifest enrich languag structur uncertainti section set instanc frame vari depend influenc valu random variabl model defin semant data gener randomli sampl valu frame model random sampl process implicitli defin distribut probabl assign probabl gener process note random sampl process stochast algorithm approxim sampl process pure thought experi defin distribut section show standard process exact infer effect answer queri rel distribut sampl process build assign slot frame compon requir partial bypass problem infinit sampl chain assumpt finit depend chain sampl chain requir sampl simpl slot termin definit partial instanc frame assign valu subset simpl assign instanc frame subset complex partial assign instanc final subtleti sampl construct instanc frame specif valu slot assign explicit statement instanc process inherit templat slot class instanc belong explain section semant assign condit distribut obtain make obviou modif data gener process sampl gener slot inconsist observ simpli discard entir partial gener point easi rel probabl partial gener data gener process probabl condit observ slot valu sampl procedur build partial piec piec main shown figur sampl singl simpl slot singl instanc frame order sampl correct backward chain sampl slot return foreach parent oe oe slot oe form oe oe extend fail oe empti return oe form assign extend creat instanc extend extend return oe figur data gener sampl model depend determin complex creat instanc frame repres valu complex slot procedur partial global variabl lemma depend graph execut partial defin probabl distribut extens assign depend order parent examin basic step proof prove part suffic show sampl algorithm termin proof proce simpl induct argument length depend chain prove distribut independ observ simpl slot gener condit failur condit appli defin procedur sampl valu slot instanc kb call sampl entir sampl process restart assign simpl slot account evid sampl slot possibl fail distribut obtain slot sampl final theorem depend graph acycl defin probabl distribut partial valu valu assign simpl slot instanc multivalu slot number uncertainti assum slot slot multipl valu fundament concept frame system paper slot type simplifi requir slot valu slot slot slot frame depend properti slot present slot depend set slot element set refer refer properti set definit quantifi slot slot form oe slot chain element type quantifi slot set falseg set valu quantif slot mean valu paper slot true note quantifi slot welldefin number valu slot slot depend directli avoid problem defin gener variabl number parent quantifi treat simpl parent slot slot class depend quantifi slot number valu slot number number fix model situat number paper repres belief possibl structur set entiti world relationship uncertainti number valu slot type structur uncertainti call number uncertainti extend languag repres number uncertainti associ multivalu slot number slot rang set natur number ng assum number valu slot slot treat simpl parent distribut facet describ probabl model number valu depend valu slot relat parent slot rang depend product turn influenc tire case specif assert slot individu interpret assign assert valu prevent multipl valu assert slot assign elimin number uncertainti case slot fewer number assert filler condit assert number assert valu explicitli assert interest examin interact multivalu slot assum slot advisor frame student instanc frame automat assert slot instanc frame inform whatsoev instanc gener member professor class fact professor advisor modifi distribut condit fact note slot relat give rise potenti infinit refer chain paper written due restrict flow influenc primari secondari infinit refer chain sort lead infinit depend chain number uncertainti incorpor semant easili add number quantifi slot depend graph number slot treat simpl edg parent quantifi slot edg make depend properti import filler import type assert sampl process easili modifi account slot slot sampl sampl number assert valu sampl fail instanc type set valu set assert filler instanc theorem continu hold refer uncertainti structur uncertainti repres distribut model structur number uncertainti vari set instanc model describ refer vari relat instanc confer slot class aaai probabl gener ai confer probabl note aaai simpl instanc frame extend languag accomod refer uncertainti complex slot indirect indirect slot refer slot ref simpl slot dictat indirect slot definit indirect slot type ref simpl slot type set valu ae individu type type class instanc defin term ref ref individu ref ref instanc refer slot treat simpl parent influenc simpl slot assign refer slot indirect slot determin indirect slot treat complex import slot depend slot import technic direct assign indirect number refer uncertainti incorpor easili semant add refer indirect slot depend graph refer slot treat simpl depend parent indirect slot depend ref ref complex depend slot import refer frame import slot slot import list account ae ref ae ae individu ae slot chain ae class denot fact import instanc sampl process requir small chang deal indirect slot call indirect sampl refer slot usual assign indirect slot manner determin refer slot theorem continu hold infer present languag semant probabilist frame system complet present simpl infer algorithm answer probabilist queri system handl queri valu slot instanc restrict attent simpl slot queri easili reduc call base model construct process kb deriv bn repres probabl model standard bn infer answer queri node net form instanc frame necessarili oe possibl empti slot simpl slot backward chain depend construct node bn exist algorithm maintain open list node process simpl slot instanc algorithm remov node process node remov process simpl slot quantifi slot simpl slot process parent edg ad call routin add parent list simpl slot parent construct distribut facet slot chain process indirect assign type set copi assign instanc serv role skolem function frame equal make parent defin enforc equal intermedi node slot chain introduc monitor flow valu complex slot flow complic chain indirect slot intermedi variabl spuriou easili elimin simpl phase depend refer slot ae denot frame equal select set possibl node multiplex node parent node node parent ae ae individu ae slot chain oe ae class set select remain deal case introduc number uncertainti slot quantifi slot quantifi slot fulli determin oe valu maximum number assign valu addit instanc valu build frame node depend subset variabl influenc exact form depend depend form quantifi quantifi slot determinist conjunct subset parent quantifi maximum assign valu type figur part construct bn prof case model fifti paper shown shorthand short set depend illustr figur show part bn construct kb case prof instanc node depend quantifi parent impact slot paper assum class paper impact depend depend duplic paper slot confer shorthand parent slot valu aaai structur correspond structur depend graph bn defin map node node node repres node gener instanc lemma edg node node path serv templat depend edg map path cycl infinit depend necessarili map cycl properti basi theorem theorem depend graph termin construct net acycl construct altern specif distribut defin probabilist frame kb bn correspond prior distribut defin kb slot ascrib posit probabl fact valu assert kb order repres distribut defin condit observ assert simpl slot assign lower bound number valu assert indirectli theorem set simpl slot evid simpl slot number slot deriv kb pr distribut defin semant implement approach system graphic annot frame kb facet encod probabl model editor interact underli fr exist frame system infer compon connect fr extract relev inform probabilist construct bn util bn answer probabilist queri system integr successfulli ontolingua frame system repres simpl model vehicl movement pattern militari set experi system show simpl model simpl gener fairli complic bn hundr involv interact entiti discuss integr domin thread work kr languag clean synthesi probabilist reason compon standard frame reason capabl perspect frame system exist frame kb annot probabilist greatli abil frame system express knowledg applic provid infer algorithm capabl answer probabilist queri provid inferenti abil system perspect probabilist languag tool construct probabilist model larg complex significantli scale abil uncertain reason languag excit capabl creat highli express probabilist model structur uncertainti scratch surfac idea easi add uncertainti type defin probabl distribut professor full professor easi combin number refer advisor student select set faculti member cs depart extens consid import issu partial resolv infer problem probabilist model shown reduc problem reason standard approach make full structur encod fail exploit encapsul frame frame class model object idea put good import research topic appli richer framework exploit featur infer effect repres reason larg uncertain domain acknowledg support onr contract darpa darpa contract subcontract inform extract powel foundat sloan foundat refer koller independ bayesian network proc vk pd jp rice open knowledg base connect rice ontolingua tool collabor ontolog construct technic stanford ksl henrion propag uncertainti bayesian network probabilist logic sampl proc pfeffer tractabl probabilist descript logic proc koller pfeffer bayesian network proc db lenat rv guha build larg infer cyc project macgregor evolv technolog knowledg system principl semant page morgan haddawi answer queri probabilist knowledg base theoret comput pearl probabilist reason intellig system morgan pool probabilist horn abduct bayesian network artifici novemb mp js rp goldman knowledg base model knowledg engin novemb
HCI/413 4 busi transact workflow model ap ahm ter ha proper depart comput scienc faculti inform technolog queensland queensland technolog qld gpo box brisban australia australia publish ap ahm ter ha busi transact workflow ninth intern confer advanc inform system abstract specif languag workflow manag system focu process execut success develop workflow reli fuller busi includ process semant model paradigm method extens address analysi process structur commun cognit workflow provid empir insight busi transact workflow develop workflow model set principl address workflow model suitabl advanc includ asynchron synchron tempor constraint perspect motiv illustr suitabl principl inher complex busi transact offer time insight workflow specif workflow introduct workflow recent emerg workflow manag system survei advanc inform system implement model incorpor aspect collabor coordin busi process tradit implement applic partit discret unit oper procedur describ human action part work support busi unit queensland depart public work administr servic busi process combin deliv busi servic endow busi process execut workflow permit greater fit iss workflow level tradit enabl program bind access set file newer applic develop exist applic reflect reengin busi process workflow base provid execut schedul event monitor evid workflow wfm undertaken workflow manag coalit focu workflow specif work coordin work specif put workflow implement level orthogon level specif deal cognit analysi busi conceptu level conceptu level crucial focu essenc facilit earli problem solv prior implement phase addit effect conceptu model techniqu high express power specif effect specif develop commun set formal foundat syntax semant techniqu clear domain longer consid realist suitabl problem domain mean concept featur reflect close problem domain engag larger busi domain iss workflow previou implement model present major uncertainti suitabl cognit workflow busi uncertainti evid number paradigm adopt theori synthesi addit introduc greater cognit effect method includ integr model requir engin enhanc design identifi group conceptu model concept techniqu ultim constructivist warrant review empir insight extens goal paper provid empir insight model extens common frequent encount type busi process workflow relat oper busi transact evid domain oper busi transact server supplier good servic multipl interact involv coordin process typic messag pass collabor process wide cite workflow oper busi transact correspond administr product workflow extens structur framework suitabl principl identifi assess integr techniqu conceptu valid broad unit insul busi servic request result busi refer detail ifip wg task group commiss creat framework inform system motiv servic model workflow incorpor neglect combin structur behaviour aspect interact human comput interact tempor enhanc explicit treatment oper error handl execut resili illustr paper concern techniqu issu extend techniqu busi transact domain paper section overview road closur domain present section highlight workflow model present line suitabl principl section paper conclud summari find open research issu case studi road closur consequ system govern administr land fall number legisl involv number author state depart natur resourc land act commiss grant state land reserv land broad grant ownership titl privat grant titl establish reserv nation park dedic road definit land act impli public appli parcel land elementari lot order grant depart natur resourc obtain view relev stakehold affect affect associ commun order determin potenti parcel affect surround current futur land current legisl author includ local electr power telecommun carrier environ heritag regul author process determin grant complex dai month repeat check requir ensur requir satisfi action constantli occur relat aspect land process investig mine overlap part land overlap part railwai corridor result incompat land repeat interact stakehold resolv unsatisfi requir period busi process chang due legisl restructur effect coordin process integr grant insul busi process custom interact closur road instanc alloc land minist land approv road closur deleg specif person legal approv matter road closur carri import land act issu ramif gener public expect road road close reason includ current potenti dedic access transport degrad road form import corridor exist nativ titl road close perman temporarili subsum adjoin parcel subsumpt parcel involv exist certif issu grant parcel subsumpt parcel involv adjust exist temporari road permit issu state retain area subsequ time case permit road lose statu access side walk cafe road creat parcel case grant issu figur highest level data model express conceptu data model kernel model unlik normal orm object object type case illustr object type figur highest level object model road closur decomposit applic figur shown land parcel alloc deem nativ determin peopl australia grant titl signifi parcel case studi workflow model figur decomposit applic case studi section provid insight conceptu workflow model domain involv busi transact process illustr goal featur workflow improv process core elicit exist contribut workflow solut appreci current gap uncertainti workflow specif intend convei aspect structur framework suitabl principl identifi result assess techniqu conduct highlight case studi present full accord illustr requir techniqu emb concept conceptu directli typic process captur refin model level state principl preclud network decomposit evid integr road closur busi applic applic investig direct correspond highest level abstract workflow similar busi process part depart classifi road closur actor role access inform repositori basi road workflow ancillari intern extern servic interfac creat reason clearer understood busi servic sort workflow concern busi servic encapsul workflow simplifi workflow scenario valid refin scope busi specif articul busi process requir busi process workflow evid applic applic investig gener process argu main object interest applic determin workflow restrict base structur classif workflow classifi type set trigger event dynam classif gener scenario valid principl state techniqu provid explicit notion scenario model valid concern interpret conceptu domain semant distinct verif concern formal impli mechan appli workflow develop scenario type embodi type busi process type busi process involv senior request result process pattern oper busi transact road closur process natur clear type scenario techniqu addit suitabl set concept type identif workflow scenario type tandem model suitabl form major part futur workflow research cognit suffici previou cognit suffici principl relat concept suffici cognit model assumpt fundament aspect busi process execut semant notabl area collect varianc process workflow model identifi data control interact point tempor aspect process model road closur busi transact follow applic applic depict figur applic document letter attach document lodg servic centr servic offic actor role applic entri applic form relev region offic file applic file store applic figur applic process model process model resembl part task structur introduc extend integr model kernel data model hydra process includ initi execut process bent execut trigger shown includ process specif compon action access conceptu specif languag enabl data model structur process data flow diagram concept data flow applic add cognit busi execut semant attribut incom type overlap attribut messag messag type qualifi condit introduct messag requir inform pass case incom messag small arrow messag applic file seemingli trigger adopt notat convent semant messag trigger deposit retriev predefin target process applic file model object store temporari storag natur applic object access formul relat schema assign figur hci point bar enhanc execut cognit applic investig complic process model depict figur applic investig consist number intern check determin applic prepar detail seek view process view stakehold part detail site inspect part made approv offer result reject request suspend posit result prepar make offer effect offer approv descript initi review prepar seek view elabor figur decomposit applic investig intern check present extens handl tradit model hydra task structur yield posit neg rule outcom termin return control evid part road depict figur busi transact base possibl network execut depend execut parallel impli outcom network simpl complex execut trigger termin abort outcom extend express outcom satisfactori determin outcom complex figur decomposit initi review pass extens handl accommod messag figur requir data messag rule messag servic attach messag illustr unlik discuss form messag depict messag synchron messag incom messag anticip time messag time messag execut proce highli express conceptu specif languag sophist rule evid formul posit outcom previou year parcel lot parcel date date date date simpl result complex posit neg outcom neg outcom result execut suspend process depict result reject applic request inform notif interest stakehold provid form notif road closur case notif abort messag activ process involv process applic close abort oper error subject execut resili principl section return initi review figur posit outcom result prepar detail investig applic involv public road closur intent govern gazett servic depart seek view stakehold requir seek depict figur execut figur decomposit seek view candid stakehold determin obtain parcel info extern servic access identifi surround util content messag insert candid stakehold object store place hci point determin process ensur depict figur cover object figur schema candid stakehold messag updat denot fact object store add contact candid stakehold contact add locat candid stakehold locat notic road closur illustr bulk messag incorpor send notic road closur person stakehold address stakehold send messag requir occur dai date gazett illustr tempor constraint postcondit seek date applic tempor constraint site inspect occur prior month intent road closur date applic month tempor function provid start end date process object execut impli execut statist process object maintain time durat process execut depend qualifi tempor constraint run number process simultan time durat run process repeatedli time period cyclic time point constraint appli messag servic access process object messag return time strike note specif type domain treatment tempor aspect formal specif languag algebra specif languag process algebra petri net base approach busi evid exist tempor process constraint indic survei extens workflow note determin complet tempor constraint languag open issu workflow distribut servic access open distribut trader tempor aspect involv tempor durat increasingli import road closur road closur process depict figur demonstr execut construct ensur prior subsequ number trigger reach figur execut path simultan time start figur oper path return control sourc execut servic inform hide kei distinct busi transact busi servic busi process distinct event process event share intent busi intent aggreg busi servic busi servic function process interact involv extern access client request figur decomposit road closur intern access servic part set state depend action result event busi process prescrib function reflect mechan busi servic deliv unlik perform concret data updat state depend success process servic inform hide principl requir techniqu formul servic request independ actual avoid problem direct trigger process context trigger point view environ part actual busi process trigger busi servic request formul request implic process actual request affect applic inform hide principl softwar design conveni model servic object encapsul behaviour lifecycl state state transit paradigm adopt activ rule specif conceptu specif easili adapt event specif servic model road closur busi transact depict figur servic model consist normal state special state indic servic servic shade state transit figur servic model road closur event arriv messag applic document messag event distinguish actual extern event sign contract estat develop extern event workflow captur event depend formal separ workflow specif event lead servic object creation state send messag applic entri trigger workflow figur applic document receiv send applic document process applic transit lodg state occur applic object enter applic state event express formul demonstr conceptu data specif languag eca languag arbitrari fact type mandatori role evalu applic store part workflow execut continu invok illustr import servic state captur requir percept servic independ underli workflow applic date problem found applic relat intern check part initi review figur request inform execut issu notic messag messag event time outgo detect servic object state transit notic subsequ incom messag servic servic object activ process correspond state chang result correspond receiv send correspond process examin correspond includ process model correspond satisfactori case suspend process reject process event involv neg reject reject posit termin result transit applic reject state reject accept eca rule provid indic type event servic react full case event type process object commenc process object fail commenc execut number occurr termin abort execut resili execut resili principl requir techniqu support handl oper busi process execut verifi tradit process model techniqu deal recent workflow model basic mechan except handl detail treatment failur recent subject workflow implement specif tradit transact model recent acid properti isol extend workflow execut survei transact workflow issu tradit transact bind set oper atom unit execut requir failur commit execut success workflow complex structur tradit unaccept failur process result rollback entir workflow recoveri strategi appar road closur recoveri failur occur control system system redo process greater flexibl introduc rang process qualifi number startup failur process recoveri ensur workflow durabl rollback recoveri occur failur gener system termin undo possibl execut occur process commit resourc prior workflow reach termin process access updat rollback recoveri ensur workflow consist addit rollback process object servic state provid extra level rollback granular eca type languag conduc specif recoveri action failur event complex problem domain product requir develop solut qualiti maintain solut make autom support compel focal natur lead percept tool method techniqu support improv tool necessarili improv understand problem domain depend qualiti method techniqu tool invalu lesson undoubtedli time workflow technolog tool provid implement execut recent prior insight workflow posit busi process workflow ontolog leav critic issu workflow open form requir lead effect conceptu model techniqu adher strictli conceptu provid high express time facilit back solid formal foundat syntax semant defin equal techniqu suitabl problem mean concept featur reflect close problem domain techniqu set paper sought provid insight workflow model techniqu improv problem domain conceptu model vastli develop advoc synthet approach workflow model domain concept paradigm model import reflect framework workflow model extens framework set suitabl principl identifi assess number techniqu intend convei inher complex problem domain requir workflow manag attent restrict basic type oper busi transact principl scenario salient aspect align workflow model concept cognit cognit suffici anchor essenti behaviour process model workflow model commerci tool messag messag object store hci point tempor aspect benefit scale techniqu demonstr express specif insight process semant complement current process execut semant workflow specif servic inform hide principl interfac busi denot busi insul knowledg workflow busi servic custom user implement formul servic request servic concept motiv declar specif benefit object paradigm execut resili discuss recoveri manag aspect workflow address techniqu advoc recoveri strategi abort rollback recoveri strategi failur integr transact concept undo redo result futur research issu pertin classif workflow scenario type requir research includ empir exposur restrict attent develop effect develop techniqu develop ramif amalgam concept featur understood formal formal semant workflow specif due attent specif involv highli concurr process behaviour synchron asynchron complex constraint oper inform specif complex natur bound ambigu formal semant verif valid number verif issu workflow specif identifi complex analyz open issu determin complet tempor constraint workflow model discuss constraint process model treatment illustr partial tempor requir servic identifi servic perform scope extens refer ai wm pott goal decomposit scenario analysi busi process reengin sixth intern confer advanc inform system volum lectur note comput page june ja real time process algebra formal aspect ja softwar process model busi reengin inform system develop decentr organ ifip work page august chapman hall ap ahm ter busi transact workflow case road closur queensland technic report depart comput decemb ap ahm ter ha pn busi suitabl principl workflow model technic report depart comput august bot environ support problem solv phd delft fp brook jr silver essenc accid softwar engin ieee april benyon tool kit system analyst comput conceptu model workflow mp intern model volum lectur note comput page decemb chakravarthi make dbm design implement evalu prototyp intern confer extend technolog april pn ha proper gener model conceptu model data knowledg davi softwar analysi specif englewood dur bot dynam model organ simul rl hg intern work confer dynam model inform page elsevi scienc publish busi model busi redesign intern confer system page august de antonelli pernici specif refin level data knowledg april flore jj speak offic support issu challeng welsh support cooper work process survei system issu technic report depart comput june sheth overview workflow process model workflow autom infrastructur distribut parallel april grai editor transact concept techniqu morgan san ta conceptu schema relat design ahm ter er task structur semant process algebra softwar engin januari ahm ter inform model data intens domain phd ahm ter verif problem conceptu workflow specif intern confer conceptu model volum lectur note comput page octob ahm ter ha van der weid formal definit conceptu languag descript manipul inform model inform octob km van lj execut specif distribut inform system ed inform system page editor modern object loucopoulo model process design design intern journal cooper inform januari integr rule base tempor reason effect inform system journal inform februari roller busi process manag ieee page san march ieee comput societi press vj strategi architectur ibm system jl method system design journal appli system gj integr object execut specif framework busi analysi inform system design phd model design englewood rodden survei cscw system interact sj system model world data ci loucopoulo time dimens conceptu model inform dg white process technolog support cooper prospect design issu cscw introduct case page unit modern structur analysi englewood salient featur execut specif languag environ ieee transact softwar
IR/414 5 genr visual finn nichola kushmerick barri smyth smart media comput scienc colleg ireland abstract web user vari wide term topic amount detail web search servic cater individu prefer difficult queri document give extens detail assum modest prior describ shallow text classif techniqu sort document return web search servic genr dimens level amount simpl visual interfac user rapidli find document document inform text shallow linguist motiv user seek inform correl coeffici alic write program web page remind equat point pupil overview equat alic bob submit queri pearson correl web search receiv rank list fig due recent advanc inform retriev techniqu latent semant index web search servic gener good job identifi document relev queri rank list manual inspect alic bob find document satisfi prefer alic document rank relev equat bob document satisfi requir posit goal assist user scenario develop web genr user interfac replac convent rank document list graphic depict retriev document interfac classifi document dimens web document assum amount detail document report primarili fact opinion make contribut identifi document genr import aspect person inform heterogen environ web describ shallow text classif techniqu partit document leav blank cm left column page notic cord genr dimens simpl visual tool user rapidli find document genr classif defin document classif document dimens assum amount detail document report fact opinion note genr orthogon topic relev queri goal definit genr taxonomi taxonomi consist work area explor dimens import easili comput shallow linguist featur dimens user expert topic novic dimens measur amount technic background knowledg assum author estim posit dimens simpl function frequenc length word frequenc html tag formul motiv evid word length frequenc determin complex cognit process sentenc structur preliminari experi suggest simpl formul accord intend conduct systemat experi evalu effect explor machin learn techniqu tune perform detail dimens user prefer summari prefer extend descript detail dimens measur amount explan note detail dimens document detail document aim novic estim posit detail dimens function physic number line render frequenc long word document intend empir valid simpl machin learn techniqu tune perform subject dimens document convei primarili opinion explor machin learn techniqu automat classifi document subject dimens find convent insuffici shallow linguist featur distribut tag current statu futur work current web genr visual prototyp user visual detail genr dimens subject dimens incorpor shortli conduct systemat empir evalu genr classif begin determin system user find document long term goal provid addit person function track individu hope learn model topic prefer order highlight relev recommend summari search servic succe find user find document document genr relev search servic heterogen environ web show shallow text classif techniqu technic popular estim posit document visual interfac user rapidli find document research fund grant offic naval refer anatomi hypertextu web search engin proc int world wide web page al index latent semant analysi american soc inform al automat detect text genr proc meet assoc linguist franci comput analysi american brown mrc psycholinguist ch locu word length effect word recognit read fact content classif digit librari proc workshop person recommend system digit dublin detail explanatori detail detail figur web genr visual user find document demonstr queri retriev document vari wide assum level amount detail note origin rank list user seek document genr
HCI/415 4 principl user interfac eric horvitz microsoft research wa usa abstract recent debat center rel research develop metaphor tool enhanc user abil directli manipul object versu direct effort develop interfac agent provid autom review principl show engin enhanc interact eleg coupl autom servic direct manipul kei idea highlight term system schedul meet manag keyword intellig direct user ui design introduct debat research great opportun lai innov realm comput interact group research express enthusiasm develop applic kind autom refer interfac effort group center build machineri user activ autom action research suggest effort autom expend explor kind metaphor convent enhanc user abil directli manipul interfac access inform invok servic innov front fast pace tendenc diverg interest methodolog versu attempt leverag innov arena pursu principl provid foundat integr research direct manipul work interfac agent goal avoid sole seek valuabl synergi area investig avoid build complex reason machineri patch fundament poor design metaphor avoid limit design interact direct manipul power effici gain autom reason great opportun design innov user interact modal ground design advantag power direct manipul potenti valuabl autom reason principl ui kei problem agent interfac includ poor guess goal inadequ cost benefit autom poor time inadequ attent opportun user guid invoc autom servic refin potenti suboptim result autom effort expend design mixedin approach solv user assum intellig servic user collabor effici achiev user goal critic factor effect integr autom servic direct manipul interfac develop autom import provid autom servic provid genuin solut attain direct manipul uncertainti user goal comput uncertain goal current focu attent user system benefit emploi machineri infer exploit uncertainti user intent focu statu user attent time servic natur time autom servic alert critic factor cost benefit action agent emploi model attent user cost benefit defer action time action distract infer ideal action light uncertainti autom action uncertainti user goal attent cost benefit autom servic enhanc guid invoc expect action emploi dialog resolv kei uncertainti system uncertain user engag effici dialog cost potenti bother user needlessli effici direct invoc termin system oper uncertainti make poor autom servic agent provid autom servic enhanc provid effici mean user directli invok termin autom servic minim cost poor guess action time design servic alert undertaken ey minim cost poor includ time natur gestur reject attempt servic scope servic match variat goal enhanc autom give agent abil gracefulli degrad servic match current uncertainti prefer correctli uncertainti provid user valuabl advanc solut minim costli undo backtrack provid mechan effici collabor refin result design agent assumpt user complet refin analysi provid agent emploi social behavior interact agent endow tast default behavior courtesi match social expect benevol assist maintain work memori recent interact system maintain memori recent interact user provid mechan user make effici natur refer object servic includ experi continu learn observ autom servic endow abil continu work user continu learn user goal testb ui project investig issu overlai autom schedul servic microsoft larg base messag schedul system autom identifi messag open brought focu attempt assist user review calendar appoint calendar schedul text bodi subject email messag focu attempt identifi date time event impli sender system invok outlook calendar bring user onlin appoint attempt fill relev field appoint record system displai guess user user edit guess save final result schedul analysi center text email messag focu system note messag messag focu analyz system establish date messag anchor date attempt normal view base composit date messag written yesterdai text refer schedul meet system understand messag refer identifi impli date system degrad goal identifi span time relev text messag specif displai scope view calendar user user directli manipul view schedul appoint manual knowledg typic pattern express email meet time understand varieti wai peopl refer date system understand tempor implic suggest inform email messag hold meet time futur coupl prototyp time dai typic recurr event analysi reduc number interact complex navig requir user user navig graphic button menu item open search input time fill subject meet perform oper automat singl depend modal select guess user approxim correct posit calendar refin approxim guess impli appoint make uncertainti user directli invok click icon present system trai microsoft window shell system work automat identifi user goal content messag review process bodi messag base assign probabl user view calendar schedul emploi probabilist classif system train watch user work email system make action function infer probabl user goal perform schedul calendar oper infer probabl servic desir make appli phase analysi user autom calendar schedul depend infer assess expect cost benefit system decid simpli wait continu direct manipul outlook manual invoc engag user dialog intent provid ahead attempt provid servic invok phase analysi multipl interact modal configur oper sole manual modal modal manual system action user click small icon system analyz email messag system focu user system displai alert symbol check icon action modal hover cursor icon system summari intend action figur displai direct invoc shown menu dynam popul option pop user schedul organ schedul text system basic work launch popul field outlook window system emploi tradit dialog box request addit inform user oper modal project explicit social presenc form anim drawn ms agent social packag system issu queri user announc result anthropomorph presenc oper establish audio channel interact reduc keyboard interact outlook system system emploi figur manual invoc hover cursor user examin guess click icon system user invok appoint servic system autom speech recognit system develop microsoft research engag user natur dialog intent confid assess user charact mention readi calendar view show user creat tent appoint displai result lower level inquir user interest calendar schedul depend system analysi messag view system listen answer requir addit kei button press figur displai sequenc screen demonstr oper modal messag analyz system decid worthwhil engag user dialog creat appoint anim assist engag user speech text balloon option turn case relai content speech user speech appoint desir natur includ creat appoint review user leav result refin save user express ahead appoint simpli close messag respond varieti natur phrase includ agent immedi nod confirm understand disappear dynam scope calendar view uncertainti indic view messag text case captur figur confid identifi specif time dai make poor bring week view user calendar handl invoc failur continu reason uncertainti engag user dialog messag open system make guess simpli turn wrong system fail automat infer user calendar schedul system directli invok click icon system trai guess worthwhil engag user dialog schedul user busi interact system pose wait patient make gestur evapor amount time system wait time function infer probabl user desir servic system dwell desktop detect sign user includ design behavior handl delai react sign servic declin guid goal give sensibl make potenti valuabl suggest time care note user simpli busi user minim disturb infer belief user goal assist user potenti complex valuabl autom provid effect light uncertainti agent user goal develop machineri endow system abil explicitli assign likelihood feasibl user intent critic system machineri extend set rule link tabl probabilist inform infer relat work user probabilist model user goal emploi continu perform infer probabl altern feasibl goal function observ includ current program user sequenc action choic word queri work leverag recent success build reason bayesian network model leverag work autom text classif make action altern text classif methodolog includ nave bayesian text classifi text classif base support vector machin analysi current version assign probabl user intent emploi svm text classif base effici linear svm approxim method develop platt method coupl methodolog figur sequenc show oper explicit modal messag analyz made engag user dialog receiv confirm speech system creat appoint present guess user refin figur autom scope calendar establish specif dai attempt select span time displai user review refin direct manipul includ set text featur emploi text classif classic manner task label categor har method learn reason likelihood user goal task context assum context user review assign likelihood email messag receiv focu attent goal categori schedul review calendar versu goal categori schedul review calendar base content messag linear svm text classifi built train system set messag calendar relev calendar irrelev email messag linear svm approxim procedur output likelihood user bring calendar schedul appoint current version train initi approxim divid messag relev irrelev messag belief action uncertainti user autom action case invok servic perform intellig agent perspect action versu inact direct expect util autonom action agent believ greater expect inact tabl outcom consid engag intellig agent provid servic uncertainti user goal outcom assum agent access infer likelihood user goal observ written probabl user schedul comput evid pattern text messag recent open brought focu action versu determinist user goal consid goal state user system action action map measur outcom util defin util util action goal true util action goal true util action goal true util action goal true outcom summar tabl expect util autonom action assist user action observ comput combin util outcom case user desir servic desir weight probabl rewrit equat term note expect util provid autonom servic figur graphic analysi expect util action versu yield threshold probabl action action action desir goal desir action action expect util autonom action assist visual implic equat plot expect util function probabl figur displai graph horizont repres probabl user rang vertic axi expect system outcom displai vertic axi expect util user goal outcom list left vertic axi outcom expect act intermediari probabl dictat equat line join determinist outcom action expect act dictat equat similar line join outcom inact expect util threshold agent action line repres expect util cross specif infer probabl user goal threshold refer expect action inact equal make action greatest expect util likelihood user goal inspect easi system action probabl goal greater refrain act probabl threshold probabl comput util set equat equal solv util outcom system check probabl goal greater threshold probabl decid interest user invok servic threshold influenc contextdepend util outcom situat system action goal significantli influenc statu user attent util unwant action diminish significantli depth user focu task reduct action lead higher probabl threshold situat system action goal greater screen real estat made screen real estat diminish perceiv cost needless oper schedul servic bring appoint obscur item user focu attent figur result erron action shift util chang probabl threshold action repres situat system action user user rush diminish action reduc threshold probabl action figur displai geometr chang context util outcom act servic desir lead lower threshold probabl cross action occur dialog option action reason act assist user autonom action user goal integr action dialog expect util framework expect user question util addit case agent initi dialog goal user desir goal case user comput expect util perform dialog uncertainti equat analog equat figur displai graph addit line repres expect util engag dialog highlight util engag dialog user user goal question typic greater util perform action goal desir util user perform desir action typic smaller util simpli perform desir action user goal follow rule select option greatest expect action guid threshold threshold inact threshold dialog threshold provid instant index engag action action figur ad action option consist dialog user goal graphic analysi origin threshold probabl guid action autonom servic user dialog depend assess likelihood user goal system guid autonom servic necessarili perform explicit comput expect threshold directli assess design user directli assess threshold action impli deeper implicitli assum model system emploi default util guid dialog action system user util outcom set assess system comput modifi threshold probabl user simpli kei threshold probabl control dialog action run consid infer probabl user desir servic threshold dialog versu consist inact user attent time servic autom activ occur user readi open servic distract delai provis servic diminish autom found servic alert enhanc build appli model attent tempor pattern user focu attent potenti approach user dialog action user readi perform studi identifi time messag servic function natur messag review user ad instrument monitor length time review messag manual invoc messag servic collect data user goal build default model attent identifi nonlinear relationship size messag review amount time user prefer dwell content messag accept autom calendar schedul oper found relationship messag size prefer time defer offer servic approxim sigmoid function repres sampl data user displai figur continu studi time project aim examin factor explain dwell time includ ambigu complex date time mention messag gener construct model attent time studi make util outcom function messag length time inform separ defer servic user readi receiv current version emploi predetermin default time model base user studi system instruct build time model watch user interact email system record size messag review amount time spent messag schedul oper invok store case manner system enter learn system perform regress analysi data fit linear model data user system delai fix amount time servic invok machineri learn probabilist user model time model system design continu learn user method capabl learn kei challeng artifici intellig research continu store messag calendar relev watch user work email calendar schedul facil invok predetermin time system save messag system continu record time user dwell messag invok calendar oper user polici continu learn user dictat train schedul guid learn compon system period increment refin probabilist user model attent model ongo model continu model guess relev autom schedul servic estim time invok servic summari review kei challeng opportun build user enabl user intellig agent collabor effici present set principl design mixedin user interfac address systemat problem agent guess user method manag uncertainti agent user goal action action dialog figur sigmoid fit sampl data user displai relationship dwell time messag quantiti text messag review uncertainti agent user goal focu attent discuss expect cost benefit autonom action situat highlight method design principl exampl drawn system research elucid difficult challeng opportun improv interact eleg combin reason machineri direct manipul continu effort address problem design user interfac yield fundament enhanc interact acknowledg andi jacob serv primari softwar engin prototyp john platt develop linear svm methodolog current version sahami assist earli studi bayesian text classif identifi messag jack mari susan bill ken dan rick rashid provid valuabl feedback research refer visual inform tight coupl dynam queri filter displai chi human factor comput system compel intellig user acm intern confer intellig interfac januari induct learn algorithm text categor novemb acm infer inform goal bayesian fourteenth confer uncertainti artifici intellig juli morgan kaufmann displai inform make eleventh confer uncertainti artifici intellig august morgan kaufmann lumier bayesian user model infer goal softwar fourteenth confer uncertainti artifici intellig juli morgan kaufmann theori expert system artifici intellig intern journal approxim special issu uncertainti artifici agent assist web intern joint confer artifici intellig august ijcai agent reduc work inform overload commun acm direct manipul interfac debat vol iv number acm probabilist reason intellig network plausibl morgan kaufmann san fast train svm sequenti minim optim smola advanc kernel method support vector mit design user strategi effect acm press nj challeng problem artifici thirteenth nation confer artifici intellig august aaai length messag
DB/416 3 achiev workflow adapt mean reflect david edmond arthur hm ter cooper inform system research centr queensland technolog gpo box brisban queensland australia abstract belief import busi process trigger interest workflow system autom process compet manag philosophi busi busi process reengin radic continu process improv place greater emphasi adapt school school make flexibl evolut workflow issu import present programm metalevel framework aim reveal process assembl coordin task make busi process achiev isol kei facet locat coordin open gener process task coordin extens plan suitabl manipul coordin task structur modifi effect chang aspect system introduct busi process relat group task creat result custom busi process typic oper object busi insur claim engin develop process wholli singl unit span interest busi process manag philosophi busi process reengin continu process improv stimul awar busi process interest idea theoret econom combin global mean corpor expect provid broad rang product servic led support busi process philosophi constantli improv product aim stai provid job philosophi radic current structur discard compani goal place emphasi promot inform technolog mean drive achiev goal quickli led great deal interest concept workflow workflow manag workflow autom busi inform task pass particip set procedur rule workflow technolog design build applic system workflow manag system system complet manag drive workflow order execut driven comput workflow logic approach damag healthi suggest basic chang achiev continu develop understand process applic busi process highli volatil meet constraint opportun pose busi constantli refin unplan deviat norm problem evolut function adapt bp model workflow schema requir unplan event except individu bp requir dynam extens captur valid task sequenc advanc fundament adjust busi quickli adapt softwar system match import structur flexibl system adapt workflow system increasingli appar applic reflect bp support delai bp support current reliabl current wf technolog handl set fairli fix execut sequenc rudimentari support dynam structur dynam extens wf significantli limit applic workflow softwar confront twofold evolut cope dynam busi process softwar gener structur flexibl interfac adapt workflow softwar compon individu busi oper heterogen subject frequent updat consist effect evolut workflow basic step adapt flexibl demand futur workflow manag provid primit increment modif requir provid mechan handl run instanc workflow schema undergo modif al wfm provid function dynam ad delet task chang predefin task sequenc restrict chang oper restrict base wf model proper theoret basi add task wf point time work insert task concurr execut insert task insert task wf region dynam map paramet insert task exist newli gener data al reflect emploi mean construct flexibl extens comput system evolv adapt chang circumst expect applic includ system successfulli answer question relat perform hope demonstr reflect techniqu appli workflow made adapt result begin present basic workflow notat call task present reflect framework model enabl modif task structur repres discuss relat work futur work essenti workflow concept workflow involv number issu workflow engin ffl properti result task postcondit involv complex time task ffl inform flow task inform persist natur extern ffl execut depend task refer control depend base condit base ffl capac number activ instanc gener workflow specif pai attent task function focu coordin task conceptu workflow specif languag capabl captur moment sequenti parallel synchron task structur introduc bot describ analyz process model task depend al extend model techniqu describ strategi experienc inform engin extend formal semant term process algebra task structur express typic workflow ibm view core languag workflow specif al compar term express power conceptu workflow languag al al extend task structur concept tempor nest complex appli concept larg case studi simpl task figur main concept task structur graphic repres al repres assembl line desktop comput construct begin prepar tower cpu disk control insert cabinet insert cabinet step step compon ad prepar insert cpu insert disk control cabinet plug insert insert add plug video ram tower assembl pc figur main task desktop assembl line ad cabinet tower assembl end insert hard drive video ram workflow task basic work unit collect achiev goal task defin term refer subtask decomposit perform repeatedli desir level detail reach task decomposit perform task involv choic repres moment choic coordin execut task kind termin lead termin execut path execut path activ execut path termin graphic repres model sequenti order figur task insert cpu start termin top task prepar initi item task perform part execut task decomposit due iter clear task object initi explicitli figur task initi deal explicit figur task plug start task cabinet insert disk control termin reflect task structur develop inform system work abstract natur system aspect combin final implement idea benefit tremend techniqu found reflect protocol al paepck protocol supplement interfac convent object model user abil increment modifi evolv behaviour implement akin chang program languag underli object model idea reflect captur aspect reifi aspect form suitabl data structur structur basi metalevel investig data structur reflect back origin comput process protocol program provid control scope extens previou architectur aspect languag map control object class protocol object class call metaclass programm adjust specif aspect languag implement concept protocol usefulli transfer workflow system activ extend evolv carri manner perform simpli coher metalevel facil reifi task structur provid execut environ implement oper ad make task initi basic framework al wai workflow programm deal conveni relev aspect inform infrastructur object environ manag set combin comput process captur applic oper activ ffl state aim provid specif object relat applic domain ffl loc act provid descript runtim environ applic object placement applic form map conceptu entiti physic applic object share basic structur behaviour state structur attribut type figur state collect simpl bank account object shown context account state integ string bal float float asset set string worth float invari bal initi bal figur state account ffl descript account object ffl descript form record provid state attribut attribut declar account object attribut asset attribut repres minimum balanc time interest paid ffl invari express condit true object state time ffl initi express condit true instanti object state refer behaviour object object object number domain share behaviour ffl context attribut label behaviour ffl attribut describ individu permit domain object activ term input argument repli forthcom refer loc locat procedur knowledg method ffl context attribut enabl link preexist specif ffl kei attribut attribut attribut distinguish object account account id ffl lookup attribut attribut applic object accomplish surrog object metalevel object specif knowledg locat data form symbol tabl parallel object servic corba map symbol found code object symbol activ relat symbol forward surrog object execut compon system ffl check attribut procedur descript oper precondit check precondit broken constitu part surrog handl part ffl effect attribut procedur descript oper effect lookup attribut determin surrog effect ffl proxi attribut compil code sourc code construct check effect attribut code compil store act act behalf applic program request account surrog object deliv constitu part final refer act activ group object involv object monitor activ collect object constitut domain context assembl intent task shown figur object cpu control creat control delet fg schedul signal trace figur act assembl pc act captur essenc process object involv describ group possibl heterogen object involv task task schedul task signal complet schedul attribut record schedul task instanc bag possibl iter natur task multipl instanc task object system rout client request support infrastructur target object typic applic involv interact varieti local remot support make interact distribut object ident local object task act incorpor task object main repres task structur atom task task task object composit atom figur show task structur task object act figur termin trigger task pre true post true figur task structur object assembl pc task object encod task structur shown figur individu task repres task identifi requir task compon task number place function place program attribut object pre post attribut condit true entri exit task structur question regard model bring adapt extens workflow system task schema evolut answer examin task task object assembl pc task structur shown figur kind made task distinct oper specifi ffl initi task remov attribut oper initi oper task structur start convent version attribut prime ffl task task connect version trigger attribut domain rang subtract signifi task longer trigger instanc evolut view act act repres essenti aspect workflow instanc incorpor schema drive record state execut instanc context repli pre post repli pre task post trigger dom ran trigger trigger trigger trigger trigger task figur task structur descript act specifi oper perform act rule govern execut instanc commenc complet shown figur context repli pre schedul post trace trace schedul task signal repli pre syn task ffl trigger signal post schedul task signal fx trigger ffl fx trigger ffl figur task describ locat instanc oper object instanc migrat number monitor behaviour instanc workflow schema uniform treatment instanc schema subject chang oper kind object instanc adjust delet orthogon achiev isol kei facet locat coordin open process task coordin extens explicit suitabl manipul coordin task structur modifi effect chang aspect system relat work present conceptu oper framework support ad hoc extens individu evolut workflow schema complet minim set consist correct chang oper develop oper support user modifi structur wf preserv correct consist model express power wf model sacrif cope complex algorithm requir model check casati al address problem static dynam workflow evolut defin minim consist set modif primit alter flow process polici manag evolut present deal workflow instanc run schema defin constraint instanc meet order continu execut modifi model primit polici support framework al provid initi step reflect agent consist adapt workflow agent capabl plan alter execut workflow alter process provid coverag ffl metalevel architectur abstract evolut workflow system ffl set rule govern evolut workflow adapt workflow instanc rigor evolut accur reliabl workflow busi process intend develop complet consist set rule workflow evolut incorpor prototyp refer process cambridg unit kingdom full potenti workflow practic journal inform technolog busi transact workflow oliv ninth intern confer advanc inform system vol lectur note comput springer pp reflect agent adapt int conf practic applic intellig agent multiag technolog pp environ support problem phd delft netherland conceptu model intern entityrelationship model vol lectur note comput pp data knowledg engin massachusett institut center advanc engin cambridg mass reflect model distribut object issu data engin distribut object pp london reengin nichola london manag workflow process support runtim adapt system intl conf practic aspect knowledg switzerland structur semant process softwar engin journal problem conceptu wf data knowledg engin black open ieee softwar de art mit usa knowledg engin review reengin rhetor rise fall manag technic busi process resourc warwick omg common object servic technic report object manag group stress test program languag framework dynam workflow manag intl confer expert system applic franc wfmc workflow refer workflow manag workgroup document autom support model view base experi expert inform nordic confer advanc inform system engin vol lectur note comput pp inform model gener case vol studi comput commun io pp
DB/417 3 manag histor semistructur sudarshan chawath depart comput colleg maryland serg abiteboul le chesnai franc jennif widom comput scienc stanford california semistructur data irregular incomplet necessarili conform fix schema structur desir maintain histori queri data repres queri semistructur data difficult structur data due irregular lack schema present model repres semistructur data languag queri import featur approach repres queri directli annot affect indirectli differ state describ implement model queri languag present extens permit conveni access data model describ design implement queri subscript servic permit user subscrib semistructur inform sourc fl john wilei son introduct semistructur data data irregular incomplet necessarili conform fix schema interest data model queri languag semistructur data interest chang manag relat object data relat problem tempor awar work address problem repres queri semistructur data problem challeng work support air forc rome laboratori darpa contract equip grant ibm corpor preliminari version articl fl john wilei problem structur data due lack schema semistructur data base graph applic structur data present simpl gener repres semistructur data present queri data repres describ implement introduc facil user subscrib semistructur describ design implement base motiv exampl palo alto local maintain web site provid inform restaur bai area data restaur guid static interest dynam part data interest find restaur recent restaur captur tool call program version web page produc output copi web page highlight differ version base semistructur content system user web page view travel back version document small portion output produc version restaur guid shown theori practic object vol fig output figur icon color actual repres kind chang small html file produc view interest feasibl option document larger preval feel queri directli find interest simpli restaur guid page line make simpl chang queri restaur data restaur restaur averag price ineffect retriev hold data repres queri languag queri html page motiv typic librari system book circul inform notifi book defin book popular check time past month partial achiev goal set trigger circul notifi book return problem approach librari inform system legaci mainfram applic trigger case librari inform system implement system support user lack access requir set trigger access histor circul check book return check time recent applic data librari system merg inform multipl sourc method queri context semistructur data overview interest compon chang manag context semistructur detect repres queri detect semistructur data challeng problem practic inform sourc interest provid facil author explicit monitor forc infer base sequenc data snapshot studi problem describ algorithm infer snapshot semistructur discuss compon paper paper address problem compon goal repres semistructur start point object exchang model design stanford part tsimmi project oem simpl data object node relationship repres label arc due theori practic object simplic oem encod numer kind includ relat electron document format sgml data exchang format program basic chang oper model node updat node addit remov label arc delet implicit unreach chang annot node arc oem graph repres set annot node arc repres histori node arc queri languag base lorel languag queri semistructur data call chang extend concept lorel path express refer annot result intuit conveni languag express chang queri semistructur data work paper found oem data model lorel princip concept applic data model implement method encod oem translat queri lorel queri oem encod encod scheme benefit build scratch capit exist system semistructur data import applic describ design implement queri subscript servic permit user subscrib semistructur data relat work gener problem repres queri histori addit current main approach call view histori collect state chang oper state state base time addit queri present system state queri approach tempor call view histori combin singl snapshot collect delta obtain state start singl snapshot appli sequenc delta approach work simpl approach idea delta activ trigger languag repres set relat relat approach project repres relat object data work differ work respect repres semistructur relat object data present method queri gener hypothet state queri usual approach complementari preliminari version paper version omit detail includ properti encod translat scheme implement issu version includ descript virtual annot access section outlin paper remaind paper organ section review object exchang model introduc oem chang oper histori section present chang model semistructur section describ chang queri section present encod scheme implement briefli describ system implement section introduc extens languag make access data model conveni describ implement extend section describ queri subscript system implement base materi section conclud section object exchang model object exchang model flexibl model repres semistructur data semistructur data data irregular necessarili conform fix html document describ begin briefli describ oem defin basic chang oper modifi oem introduc concept oem histori describ collect basic chang oper theori practic object histori form basi chang model section oem graph node correspond object arc correspond relationship arc label describ natur relationship graph object subobject multipl object relationship illustr node outgo arc call atom rest node call complex object atom object type arc graph signifi object identifi subobject complex object identifi oem distinguish node call root root implicit start point path express lorel queri languag section defin oem definit oem set object set direct arc function map node reserv distinguish node call root node complex object atom object complex object outgo arc requir node reachabl root direct path run oem describ restaur guid section palo alto weekli introduc section figur show small portion data note restaur entri similar import differ requir semistructur data model oem price rate restaur integ string address simpl string complex object subobject list note data natur hierarch node multipl incom arc node cycl cycl form arc refer guid oem describ oem modifi oem basic chang oper creat oper creat object identifi occur initi atom special symbol updat oper object atom special symbol object atom object complex object subobject model requir remov subobject complex object transform atom add oper add arc label object object object exist arc exist remov oper remov arc object exist arc remov basic chang oper appli valid denot result appli note explicit object delet oper persist reachabl distinguish root node delet object suffic remov arc lead subtleti object unreach creat remain unreach creat arc link rest sequenc section permit result atom unreach object issu discuss section note user typic request base lorel updat languag basic chang oper defin reflect actual level modif oem modif run rest paper januari price rate cuisin chang modif correspond oper restaur ad modif correspond oper restaur node oper add arc label januari subobject ad restaur object arc label modif correspond oper oper januari park lot longer consid suitabl restaur arc theori practic object guid address address restaur restaur street citi price park park lot cuisin price address comment fig oem root guid address address restaur restaur street citi price park lot price address cuisin comment restaur comment park fig oem modif correspond oper result modifi oem guid data shown figur data highlight delet arc repres dash arrow oem histori typic interest collect basic chang describ success modif sequenc basic chang oper valid oem valid denot oem obtain appli entir sequenc set fu basic chang oper valid oem order valid sequenc valid sequenc denot oem obtain appli oper set valid readi defin oem histori assum time domain time discret total element time call timestamp oem time set basic chang oper time set histori repres sequenc set modif definit oem histori sequenc set basic chang oper theori practic object valid oem valid return requir object oem reachabl root oem histori view sequenc ln sequenc atom sequenc relax requir object reachabl root creat node creat arc lead discuss earlier immedi sequenc node unreach consid remaind histori oper object simplifi assum object identifi delet node histori modif consist set basic chang oper histori valid oem figur describ oem repres attach annot oem turn oem graph introduc annot defin oem graph annot describ oem histori section repres discuss properti make repres semistructur data annot tag attach node arc oem graph encod histori basic chang oper node arc correspond annot basic chang oper node arc ffl node creat time ffl node updat time ov ffl arc ad time ffl arc remov time set node annot denot set arc annot denot definit node arc defin function map node set annot node function map arc set annot arc definit tripl oem map node finit subset map arc finit subset oem histori oem histori valid construct repres denot construct induct start consist oem empti set annot node arc repres construct basic chang oper histori assum order oper start process oper order object addit perform updat attach annot node annot timestamp object object creat arc addit perform attach cre add annot timestamp exist arc remov arc simpli attach rem annot affect arc timestamp observ directli store imag approach discuss section histori transform oem figur figur shown figur depict box figur annot timestamp correspond set updat note rem annot annot theori practic object rem guid address address restaur street citi price park park lot price address cuisin comment restaur restaur add add add cre cre cre comment fig object updat node note remov arc restaur object lot park object remov bear rem annot properti repres oem histori discuss advantag feasibl exist oem valid histori note requir record oem empti desir ffl easi obtain origin snapshot node cre annot arc arc rem annot annot smallest timestamp ffl easi obtain snapshot time start root object preorder node find time annot fn tk pick smallest timestamp greater tk ov continu preorder arc eman present time arc eman annot timestamp equal add annot annot greatest timestamp equal ffl easi obtain current snapshot snapshot time current time ffl easi obtain encod histori histori construct tn set timestamp occur order time arc annot annot ov annot ov updat annot defin case ffl easi determin feasibl construct origin snapshot encod histori test ffl show oem histori encod uniqu faithfulli captur inform histori oem theori practic object ffl easi intuit queri histori encod queri section histori oem repres describ queri introduc queri languag call similar lorel languag queri oem begin overview descript syntax semant lorel overview lorel familiar thought extens oql major wai lorel encourag path express path express street address restaur entri guid contrast lorel type system face task compar lorel coerc common type coercion comparison simpli return error unsuit tradit user expect queri semistructur data lorel number syntact conveni possibl omit describ lorel detail present simpl featur understand oem depict figur find restaur price rate lorel select note queri express price rate real number restaur entri oem shown figur integ restaur entri price subobject lorel successfulli coerc integ price comparison succe string encod price lorel return result comparison miss price subobject simpli comparison return result queri singleton set restaur object note result intuit reason origin type difficulti miss data lorel path express includ regular express wildcard match arbitrari path length gener path express power extens simpl path express lorel user complex path pattern graph base extend notion path extend path express annot match path express annot refer node arc annot lorel path express thought match path oem queri execut annot express path express thought match annot path depict figur find newli ad restaur entri select annot express specifi object connect object arc add annot retriev depict figur queri return restaur object kind annot express path node annot express arc annot express recal path consist sequenc label arc annot express occur immedi node annot express occur immedi node arc annot path express node arc annot express call annot path express theori practic object correct annot path express requir add annot present arc label annot node node destin arc label paper path express annot express attach wildcard regular gener annot express difficult annot express introduc time variabl refer timestamp store match data variabl refer modifi valu match annot syntax annot express annot cre variabl note explicitli store updat inform determin easili shown section queri time variabl note user enter timestamp textual lorel extens recogniz format convert automat intern timestamp datatyp figur find restaur entri ad januari select preprocessor rewrit queri obtain explain rewrit select introduc bind object connect object arc add provid bind evalu yield set pair restaur arc guid object add annot timestamp filter pair satisfi condit figur queri return restaur object time data variabl bound variabl lorel oql featur illustr time data variabl select refer figur find restaur price rate updat januari greater time updat price queri select nv nv answer result queri singl complex object shown label chosen method time data variabl label default label semant make semant queri semant rewrit queri queri introduc addit machineri handl annot express queri annot express queri transform canon form includ variabl rewritten rewritten fresh variabl elimin path express introduc variabl object path express path express convert xc rang variabl detail rewrit give semant rang variabl definit includ annot express context absenc annot semant express bind bound object arc label label ox current snapshot note theori practic object standard lorel queri semant queri current snapshot presenc annot semant requir exist bind variabl annot express bind special rewrit queri rewritten select nv nv rewrit extract inform store function return set timestamp found cre annot node definit chang oper section set empti function return set tripl annot function return set pair subobject arc add annot function analog rewrit select result queri process standard manner illustr variabl introduc interpret variabl introduc treat introduc existenti quantif extend treatment variabl lorel figur restaur price subobject ad januari write select variabl introduc rewritten exist implement describ implement queri approach extend kernel lore system annot attach node arc oem lorel queri engin extend queri engin straightforward manner base semant section discuss approach implement altern approach implement top lore encod oem implement translat queri lorel queri oem encod addit modular direct implement approach affect lore object layout queri approach adapt easili data note simpl method encod oem challeng encod permit simpl valid translat queri origin lorel queri oem encod obviou queri translat prove difficult imposs begin explain encod descript translat queri lorel queri final descript system implement encod oem encod oem od defin object object od atom object encod complex object record histori subobject special label encod start charact distinguish standard label occur encod object object list label refer figur ffl atom current arc atom object label arc extra edg ffl creat annot complex subobject atom subobject ffl updat annot attach complex subobject object theori practic object oem fig encod object node annot atom subobject label atom subobject updat ffl current snapshot arc od arc label object encod ffl arc od arc complex object histori arc object arc object encod annot attach complex subobject label atom subobject ffl oem object encod object node subobject chain ascend order valu subobject arc label chain obtain updat oem object encod arc annot subobject chain ascend order valu subobject arc label section chain implement translat lorel encod oem describ queri translat lorel queri oem encod section queri rewritten queri special function assum rewritten queri simul special function express extract requir valu oem encod annot express replac encod scheme section express instanti tripl updat annot object bound express form occur replac case remov involv analog replac express note encod scheme ensur arc exist current snapshot encod access directli label encod arc exist current inform store arc label match label remain issu oem encod atom object store subobject encod object queri compar atom object store subobject comparison queri object variabl access predic function replac object variabl observ arc encod complex object safe perform transform access object variabl occur origin theori practic object oa oem fig encod object arc annot object encod atom complex transform illustr queri section consid rewrit queri complet rewrit yield lorel queri oem encod figur select exist exist exist note simul rang specif subobject access actual price complex object packag note queri return set object repres restaur return histori chang return object enabl user access histori object simplic assum atom object encod complex object subobject practic encod unannot atom object atom object encod simpl atom object translat replac access variabl lorel path express indic option path compon virtual annot access section construct refer virtual annot nv updat oper histori real inform extend idea virtual annot facilit access implicit inform concret section introduc virtual annot facilit access section describ mode access histor defin semant queri refer virtual annot rang function defin real annot data describ implement ad function extend method section access recal section unannot path express evalu current snapshot evalu path express compon snapshot refer price time introduc syntax refer exist park arc object time syntax queri theori practic object guid depict figur list park area close restaur januari write select depict figur queri return park object address lot januari arc restaur object lytton park object arc remov januari variabl occur annot express bound constant queri effect annot express queri evalu intuit evalu queri path express compon qualifi refer snapshot time section snapshot time easili obtain inform special precaut find face unsaf illustr guid depict figur interest find time restaur price rate write queri select basic problem queri store finit number queri requir rang infinit number intermedi timestamp valu overcom difficulti timestamp variabl bind timestamp valu exist explicitli intermedi timestamp valu repres interv begin end convent interv close left open method depend introduc concept add virtual call node annot express syntax annot path express section virtual annot fact subsum virtual annot construct bind tripl valu object continu time time construct bind tripl valu arc exist continu time time requir interv maxim refer current time introduc distinguish timestamp special variabl evalu queri time evalu begin refer initi timestamp introduc distinguish timestamp initi timestamp note neg infin virtual queri rewritten select queri return set pair time interv cuisin price rate depict figur queri return singleton set initi timestamp note express queri basic construct section result queri extrem cumbersom simpl access requir construct exist express handl special case involv miss annot side access excel candid simplif virtual annot semant formal intuit descript semant annot section semant rewrit special function bind rang variabl defin semant arc annot express introduc special theori practic object function map object label set tripl histori repres arc exist time interv maxim condit fail hold rewrit replac section easi obtain snapshot time interv definit function notabl boundari earliest annot arc arc exist section initi timestamp current latest annot arc add arc exist interv arc exist defin semant node annot express queri introduc special function map object set tripl histori repres object time interv maxim rewrit replac section interv valu function notabl boundari earliest annot object interv latest annot current queri write queri return park restaur januari select semant queri conceptu rewritten select figur bound restaur object function result tupl variabl rang singleton set park object address lot satisfi predic lytton park object return queri result construct exampl suggest simpl definit edg annot node annot defin abbrevi add condit note rewrit requir variabl occur annot bound queri independ path express compon appli definit rewrit queri obtain queri case variabl occur construct bound definit abbrevi express fail appli rewrit problemat queri bind queri select problem mitig timestamp variabl bind interv singl timestamp extens paper henceforth assum construct defin bound queri independ path express compon snap construct special class queri studi past state histor queri snapshot time evalu ordinari queri snapshot call queri pure snapshot queri guid june price park address restaur price rate evalu lorel theori practic object queri oem snapshot june select realiti evalu queri express queri evalu snapshot june qualifi compon path express queri select order make write snapshot queri introduc syntact conveni construct requir bound queri independ path express compon snap construct rewritten queri rewritten qualifi interpret access ys rewritten handl analog queri written simpli select implement translat describ implement section extend accommod construct refer figur depict oem encod featur dash line featur section oem encod special complex object atom subobject section refer current queri execut special complex object atom subobject section initi timestamp neg note instanc object highlight object depict shade circl figur section label arc chain object ascend order annot timestamp extend chain includ timestamp encod node depict figur node node annot oem add label arc object encod annot largest timestamp special object arc figur case node oem add arc node special node figur creat arc exist realiti creat arc depict dot encod arc depict figur arc oem encod add arc special object subobject encod histori figur shown object arc annot largest timestamp add oem encod arc label subobject special object figur arc enhanc scheme encod rewrit queri construct lorel queri encod object queri construct replac construct queri construct replac construct section variabl introduc queri treat introduc existenti quantif queri obtain theori practic object oem tn ti oi fig encod object node annot oem tn ti oa oi fig encod object arc annot lorel queri oem encod guid select object delet garbag collect recal oem data model underli explicit object delet oper persist reachabl distinguish root unreach object implicitli delet oem system period perform garbag collect order detect remov delet object time object unreach time garbag collect semant delet object continu exist situat pose difficulti lorel lorel path express access object unreach root current snapshot delet object reachabl annot path express jump path express refer recent snapshot older illustr refer back guid depict figur arc guid object restaur object remov juli arc remov result restaur object citi subobject unreach root impli delet object continu chang remov annot theori practic object restaur arc remov juli issu queri current price rate restaur exist june select price object cuisin result queri queri engin detect inform restaur price object suggest delet relev piec inform rem annot restaur queri result price rate cuisin mitig problem introduc delet record delet object result garbag time object determin newli unreach root mark newli unreach object continu exist annot ensur access object time object annot modifi definit function section state node annot undefin recent time interv modifi implement straightforward queri subscript servic section mention import applic chang manag notifi inform sourc interest describ design implement call queri subscript servic ordinari queri evalu current state result pass client discard ordinari queri restaur lytton subscript queri queri repeatedli scan result base criteria return interest subscript queri notifi restaur lytton describ subscript queri implement system support subscript queri introduc challeng discuss inform sourc interest librari inform web autonom typic approach base trigger mechan usabl inform sourc typic track histor inform format access user subscript servic base monitor track base sequenc snapshot state approach construct queri subscript servic possibl inform access inform sourc tsimmi wrapper mediat present uniform oem view data sourc obtain snapshot relev portion data differenc techniqu base infer base snapshot repres interest describ approach detail subscript consist main refer figur compon pair frequenc specif poll frequenc time data sourc poll order detect filter frequenc time evalu report user exampl frequenc specif fridai poll frequenc impli sequenc time instant call poll time filter time defin analog actual poll filter time obtain explicit user obtain result trigger sourc sourc trigger mechan simplifi describ mode compon subscript lorel queri call poll queri send poll queri wrapper mediat poll time obtain result poll queri section special charact match sequenc label path lorel oper string defin poll queri select theori practic object sourc state specif frequenc time chang result poll queri poll time result histori filter queri fig queri subscript servic base empti oem result poll queri sourc time tsimmi queri oem differenc techniqu obtain histori sequenc oem construct histori initi snapshot section result poll queri subsequ annot result poll queri previou identifi poll queri poll queri poll queri compon subscript queri call filter queri gener addit standard special time variabl refer current filter time refer past filter time current filter time defin initi timestamp filter queri describ data interest user filter queri defin filter queri select definit queri user notifi pair lytton street share park restaur newli creat filter time cafe creat time januari filter time filter evalu greatest poll time return result user guid data depict figur interest notifi night restaur creat guid previou night issu subscript frequenc specif night poll queri filter queri restaur defin defin poll queri restaur select defin filter queri select creat subscript decemb poll time frequenc specif poll time send poll queri guid oem obtain result theori practic object ing restaur object figur empti oem restaur object cre annot built annot timestamp variabl queri neg infin evalu filter queri return restaur object initi result user poll time guid result poll queri ident made maintain note time creat annot restaur object longer satisfi predic result user receiv notif poll time guid modifi addit restaur result poll queri restaur object addit restaur object restaur object detect differenc algorithm maintain includ restaur creat annot note creat annot satisfi predic result queri modifi restaur object user notifi result poll store larg portion underli order detect accur explor wai limit space store merg subscript similar poll make client store trade accuraci space store smaller state detect accur work method determin poll queri filter queri automat simpler form subscript queri futur work motiv uniform scheme semistructur queri languag direct access present simpl data wide varieti semistructur data repres intuit compact manner present queri languag enabl queri data implement chang object repositori base demonstr virtual annot facilit access histor design implement queri subscript servic base plan investig topic extend annot express attach lorel wildcard regular express path express design index annot type studi index achiev effici translat queri lorel queri explor virtual altern implement design trigger languag oem base idea explor techniqu conserv space share data subscript acknowledg grate dan liu substanti effort implement core member stanford group lore project fruit discuss chang manag refer abiteboul queri semistructur data intern confer januari wiener lorel queri languag semistructur data journal digit novemb buchmann activ manag system featur acm sigmod septemb suciu queri languag optim techniqu unstructur data acm sigmod intern confer manag page june cattel object morgan kaufmann san widom repres queri semistructur data intern confer data page februari chawath express model compar data technic stanford widom tsimmi integr heterogen inform sourc anniversari meet theori practic object inform process societi page octob widom chang detect hierarch structur inform acm sigmod intern confer manag page june scholl structur document queri facil acm sigmod intern confer manag structur manipul updat acm sigmod intern confer manag jacob elev delta citizen program languag acm transact septemb widom manag system sigmod septemb melton snapshot twelfth intern confer data page februari object fusion mediat system intern confer larg data page septemb ullman mediat system base declar specif intern confer data page februari ullman queri translat scheme rapid implement wrapper intern confer deduct page decemb palo alto weekli wiener lightweight object repositori semistructur data acm sigmod intern confer manag june sheth ja larson feder system manag autonom acm comput snodgrass ahn tempor ieee septemb soo bibliographi tempor sigmod march widom ceri activ trigger rule advanc process morgan kaufmann san theori practic object
AI/418 2 chen optim anytim search constrain nonlinear program chen scienc technolog thesi submit partial fulfil requir master scienc comput scienc graduat colleg illinoi illinoi abstract studi optim anytim stochast search algorithm solv gener constrain nonlinear program problem continu space algorithm gener assum convex function base search develop theori optim iter deepen order minim expect search time base optim develop optim anytim gener improv solut search time solv gener constrain nlp base theori discret constrain optim lagrang multipli show set constrain local minima dn set saddl point dn implement gener procedur framework locat sp dn incorpor genet algorithm evalu constrain search constrain genet algorithm combin constrain simul anneal genet algorithm algorithm import issu schedul order optim averag search research show schedul minim expect search time theori iter deepen identifi optim constant schedul minim expect search time iii compar run optim schedul extend theori identifi optim schedul parallel process show search optim parallel schedul iter deepen find suboptim parallel schedul deriv perform bound suboptim schedul optim parallel schedul theori gener appli cga develop optim schedul algorithm base optim optim anytim gener solut improv qualiti time schedul improv qualiti level total time solv qualiti level order magnitud find constrain global optimum appli optim anytim solv collect engin applic benchmark result report comparison exist method iv parent acknowledg greatli indebt research benjamin continu support encourag taught research independ creativ research enthusiasm understand problem highest standard scientif research guid real scientist gave full freedom pursu idea open mind confid inspir time previou current member research group provid fruit cooper pleasant weekli group seminar group meet lot work special dr wu research theori lagrang multipli discret dr tao wang develop deepli parent patienc support final continu care support made graduat studi life color full love research support nation aeronaut space administr contract vi tabl content chapter introduct previou work theori stochast search algorithm optim schedul constrain optim optim anytim schedul constrain optim bibliographi vita vii list tabl viii list figur ix chapter introduct engin applic formul constrain nonlinear program problem exampl includ product comput integr chemic control structur optim problem definit constrain nlp solv exist method formula continu special case solv satisfi requir assumpt sequenti quadrat program handl problem object constraint function variabl discret mix applic involv optim formul function discret import develop method handl optim problem divid tabl constrain nlp variabl function type variabl nlp discret object constraint function continu continu tabl definit class constrain nlp constrain nlp class variabl type function type continu continu continu continu continu discontinu discret continu discret continu discret discontinu continu continu discontinu discontinu combin variabl function lead total list tabl studi thesi constrain nlp class research constrain nlp continu variabl continu object constraint function problem solv exist sequenti quadrat program studi algorithm solv dispar constrain optim problem problem repres unifi thesi assum continu variabl discret discret variabl valu function discret variabl approach origin continu variabl assumpt valid continu variabl repres number rang variabl small discret fine solut found discret space fairli good approxim origin solut accuraci solut found discret continu nlp studi accuraci solut scale number base continu constrain nlp repres discret constrain nlp minim vector discret subject object hm vector equal vector inequ discret variabl finit function necessarili linear continu analyt procedur search space cartesian product discret domain variabl loss minim maxim problem transform minim problem negat object function solut wai similar problem differenti function continu variabl class solut defin respect neighborhood open sphere radiu approach asymptot concept exist problem discret variabl solut sought discret defin concept neighborhood constrain solut discret space vector number mean element larger element defin similarli compar stand null vector definit dn discret neighborhood point finit set point dn dn find finit sequenc point dn definit point call constrain local minimum dn satisfi feasibl impli satisfi constraint dn feasibl special case dn feasibl neighbor point dn definit point call constrain global minimum dn feasibl feasibl point set dn opt dn dn theori lagrang multipli solv discret constrain nlp briefli overview theori discret constrain optim lagrang multipli develop research group contrast lagrangian method work continu constrain nlp theori deriv solv discret constrain nlp extend solv continu nlp condit dn strong theoret foundat develop global optim method solv constrain nlp theori base solv discret nlp similar minim vector discret subject gener discret augment lagrangian function defin continu transform function satisfi vector lagrang multipli defin saddl point sp dn dn concept sp dn import discret problem start deriv condit dn lead local global minim procedur state formal theorem theorem condit dn point discret search space dn satisfi condit mean element element requir easi achiev exampl note transform function method continu space pose problem requir transform easi handl inequ constraint transform inequ equal constraint problem equal constraint rest chapter theorem great import impli search sp dn order find dn global aim find dn amount find sp dn minimum object similar result optim gener framework sp dn observ exist work approach saddl point lack gener framework unifi mechan imposs algorithm variat thesi framework solv constrain nlp unifi simul anneal genet algorithm greedi search saddl point framework show lead ga search penalti formul similar algorithm compon framework base condit theorem figur depict gener stochast optim procedur sp dn procedur maintain list candid point search consist loop updat variabl order perform descent loop start stop insert list base sort criterion search subspac gener initi candid initi gener random subspac gener stop updat lagrangian valu candid list loop loop figur gener iter stochast procedur framework sp dn updat variabl unsatisfi constraint candid order perform ascent subspac procedur quit probe gener subspac gener procedur termin feasibl probe gener subspac suppress unsatisfi constraint probe gener subspac point dn point point procedur stop saddl dn true stop point local minima subspac local maxima subspac procedur framework figur unifi implement theorem design compon design constrain optim algorithm dn realiz exist algorithm special case gener improv algorithm tune compon framework survei show exist algorithm sp dn fit framework chapter studi mechan combin perform ascent subspac descent subspac optim algorithm stochast behavior interest studi algorithm random compon random start point stochast search algorithm lead solut solut similar time algorithm run util function reli sampl gener probe exampl algorithm includ local search random start global search random compon escap local stochast global optim sa ga paramet control behavior import probe run qualiti solut longer algorithm solut gener assum iter gener probe search space probe independ perform run algorithm number probe made cpu time converg reachabl probabl defin definit converg probabl pc probabl find solut qualiti probe converg strongest asymptot converg solut desir qualiti probabl search stop solut desir qualiti iter probabl number probe approach infin concept theoret interest practic algorithm asymptot converg impli find solut higher probabl termin finit time definit reachabl probabl pr probabl find solut qualiti probe made pr measur probabl find desir qualiti made probe pr function converg relationship pr pr assum probe independ simplifi reachabl maintain time report algorithm stop pr reach asymptot pc approach infin pr finit figur show exampl pr figur show converg reachabl probabl random probe number state search sa pc respect shown figur simplic pc pr converg reachabl probabl focu fix solut qualiti level random probe simul anneal genet algorithm random probe simul anneal genet algorithm random probe simul anneal genet algorithm pr figur exampl show pc pr random sa ga pr finit exact hard estim control improv chanc find solut qualiti run algorithm multipl time random start examin search space probe expect total number probe schedul multipl independ run order find solut qualiti pr pr pr figur show exampl convex sa absolut minimum respect minim optim number probe minim expect overhead find solut algorithm run multipl time suitabl number probe expect time find solut qualiti minim observ gener hold includ constrain nonlinear optim tabl illustr number probe spent pr expect constrain simul solv constrain nlp function minim subject notat theori chapter detail tabl illustr expect total number probe multipl run find dn number probe probabl success run optim lead minimum averag total number probe find dn note probabl success highest run optim problem solv defin cool schedul run time cool schedul length avg cpu time run pr succ prob run pr avg run find pr avg probe find pr avg time find transform function defin run success find feasibl point object equal probabl hit dn calcul percentag success run independ run tabl show pr larg gener undesir expect number probe success probabl run approach success probabl run lead larg expect number probe optim run multipl time expect total number probe smallest tabl show number probe expend close relat execut time tabl show pr convex function minimum averag total number probe multipl run find dn lead optim averag run find dn import paramet control behavior solut qualiti relax lead smaller minimum point exploit design strategi order refin relax solut found research goal contribut major research goal design constrain optim algorithm develop algorithm solv constrain nlp function necessarili variabl continu base theori lagrang multipli discret constrain saddl point sp dn lagrangian formul correspond sp dn dn framework figur gener approach locat sp dn exist shown special case framework gener includ genet search space suitabl combin mechan order lead search optim sequenti parallel search schedul develop theori stochast search algorithm show run sequenc prescrib schedul qualiti desir time constant expect search time compar run optim develop schedul iter deepen give condit schedul optim extend theori run multipl processor develop optim schedul run parallel base search algorithm deriv framework develop optim schedul algorithm optim anytim search base schedul anytim algorithm gener solut improv qualiti time eventu find dn develop schedul improv qualiti target total time solv qualiti level order magnitud find dn outlin thesi thesi organ chapter survei exist work solv class constrain nlp studi research chapter present mathemat theori chapter present constrain genet algorithm incorpor genet search gener framework theori find optim schedul base optim chapter present optim anytim gener improv solut search time spent show result appli anytim algorithm solv set standard engin benchmark chapter summar research work present thesi chapter previou work summar previou work literatur class problem formul chapter classifi approach base util deriv function overview exist algorithm implement gener search framework find sp dn method summar exist approach appli solv constrain nlp defin chapter requir function gener problem class exist approach aim find constrain local minima satisfi constraint broadli classifi transform constrain nlp direct solut lagrangian transform unconstrain problem penalti formul transform constrain nlp major approach rewrit discret constrain nlp constrain nonlinear program problem solv rewrit process simpl integ variabl natur express summat binari bit variabl exist nonlinear integ program algorithm classifi categori nonlinear problem linear replac distinct product variabl variabl ad constraint linear work problem simpl nonlinear introduc variabl lead larger problem algebra method express object function polynomi function variabl complement work case constraint remov method reduc constrain nonlinear problem gener cover problem object assum linear linear limit nonlinear problem transform problem highli nonlinear object constraint transform nonlinear constrain problem exist techniqu solv problem limit nonlinear problem continu variabl exist linear program method gener welldefin algorithm step stop condit locat dn direct method solv discret constrain nlp direct solut method solv discret constrain nlp transform object constraint function classifi approach major approach base discard repair method avoid point handl nonlinear constraint feasibl region hard lead gener point reject approach base random search techniqu enum algorithm search space estim bound order elimin subspac branch variabl chosen fix priori function approxim linear nonlinear function constraint nonlinear lower bound hard method perform lower bound found linear constraint inaccur constraint highli inaccur bound lead incorrect prune solut lagrangian relax class algorithm call lagrangian relax literatur discret constrain optim method lagrang multipli lagrangian relax reformul linear integ minim minim cx subject gx integ vector variabl constant matric minim subject relax problem simpl solv vector method base lagrangian dualiti theori gener relationship solut origin minim problem solut relax problem deduc research address nonlinear optim problem point lagrangian relax aim find optim primal solut optim dual vice versa approach simpl case linear function work nonlinear function penalti formul method penalti formul approach transform unconstrain consist sum object constraint weight solv penalti function unconstrain method typic penalti formul object weight determin simpl solut formul set larg static posit local minimum dn global minimum dn search space rug feasibl solut locat hard method escap deep local minima move feasibl region feasibl region disconnect local minima global minima feasibl solut origin constrain problem constraint carri larger penalti satisfi constraint depend straint problem abil vari penalti search techniqu unconstrain problem stuck local optima method address method gradual penalti transform sequenc unconstrain subproblem method emploi solut previou subproblem start point subproblem method asymptot converg unconstrain subproblem sequenc solv optim optim subproblem achiev finit amount time solv subproblem lead suboptim solut result subproblem optim solut intermedi subproblem relat final goal find dn dn penalti larg approxim process global optim solut develop constraint handl techniqu develop base formul requir domainspecif heurist find feasibl region maintain feasibl nonlinear stuck easili local minima typic techniqu explain note techniqu heurist natur method base formul find dn simpl problem constraint function object dynam algorithm start min dn min dn larg penalti feasibl solut found review method solv problem base penalti formul method classifi local global search stochast global optim local search base penalti formul local search method base penalti formul reli local probe perturb gener candid trial point advanc search trajectori typic method includ greedi search hill climb method stop condit close relat algorithm step find feasibl solut stuck easili local minima weight chosen properli local search method combin global search techniqu find solut global search base penalti formul global search method base penalti formul involv techniqu escap attract local minima vallei search space typic method includ tabu search heurist repair method strategi guid local search random walk approach bayesian method global search method base penalti formul find constrain local minima dn larg penalti constraint mention select suitabl penalti prove current method heurist select penalti address describ systemat locat dn stochast global optim base penalti formul larg penalti constraint time approach stochast global optim base penalti transform solv discret constrain find dn achiev global optim finit search commit quickli region region dn simul anneal genet algorithm stochast global optim algorithm solv unconstrain nlp sa typic global optim algorithm asymptot converg appli successfulli solv unconstrain optim problem basic idea accept trial point improv object accept trial point object valu probabilist trial point gener current point typic accept probabl probabl defin exp control paramet call temperatur set initi larg reduc slowli import properti sa achiev asymptot converg unconstrain global optimum probabl slow logarithm cool schedul temperatur import properti make sa practic led variat fast simul anneal simul anneal extend neighborhood adapt simul anneal combin simul anneal local search heurist advantag sa li global converg properti appli solv constrain nlp penalti global converg sa ensur search converg optim solut penalti function dn dn origin constrain success sa constrain optim depend heavili proper choic penalti sa requir slow cool schedul order converg optim solut high probabl genet algorithm stochast global optim algorithm reachabl gener maintain popul individu genet crossov gener point point rank base fit object function case unconstrain optim problem start gener individu iter number expect converg individu similar ga requir good choic penalti penalti formul order search converg dn origin constrain problem search end find dn solut variant penalti formul ga handl constraint includ method static penalti dynam penalti anneal penalti adapt penalti wai modifi adjust penalti end unconstrain problem previou penalti level minim method achiev asymptot converg suitabl penalti constrain nlp sa stochast global optim appli solv discret constrain nlp penalti formul includ random search adapt search control random search improv method random search method work depend heavili good choic penalti order find feasibl trial point base random bear final goal find dn dn limit penalti method major penalti formul minimum unconstrain penalti formul condit constrain minimum origin nlp penalti chosen correctli local minimum penalti formul constrain local minimum origin nlp singl procedur penalti gener nlp local minimum unconstrain penalti formul constrain local minimum origin nlp exist algorithm necessarili solv origin nlp minima unconstrain penalti formul method requir function summar previou method solv constrain nlp util function classifi method solv continu constrain nlp solv discret constrain nlp constrain nlp continu constrain nlp discuss chapter interest research constrain nlp variabl continu function method requir appli method includ interv method requir deriv newton method trajectori method cover method requir deriv penalti method requir deriv method class method basi sequenti quadrat program base discret constrain nlp penalti formul discret nlp function solv unconstrain algorithm requir newton method method method limit method discuss section method exploit convex function approach gener formul lagrangian formul subproblem fix subset result subproblem convex solv easili method requir deriv continu improv solut time qualiti classifi method class type method gener decomposit comput iter upper bound solut sought solv primal problem lower bound master problem primal problem correspond origin problem fix discret master problem deriv nonlinear dualiti theori major disadvantag applic class restrict variabl nonempti convex continu subspac convex object constraint function outer approxim solv sequenc approxim approxim subproblem origin feasibl region similar master problem formul base primal inform outer linear method requir continu subspac convex object constraint function convex gener cross decomposit iter altern phase solv primal dual subproblem phase solv master problem similar oa requir object constraint function proper convex function major limit method applic specif class convex subproblem construct solv applic solv gener restrict case convex subproblem prohibit number convex subproblem larg exist algorithm implement theorem condit theorem impli strategi sp dn minimum object result dn correspond dn sp dn wai sp dn review method section method fit framework find sp dn figur discret lagrangian method algorithm discret lagrangian method iter local search sp dn greedi descent perform ascent subspac order penalti violat constraint start point iter loop perform neighborhood descent gener discret augment lagrangian function defin point direct obtain probe point dn loop perform ascent subspac order suppress constraint transform function constant control speed chang lagrang multipli shown point stop dn number neighborhood point small descent subspac number neighborhood point larg point stop feasibl point necessarili sp dn local search stuck local minim point global search strategi incorpor escap local suboptim trap constrain simul anneal algorithm constrain simul anneal applic theorem dn asymptot converg saddl point perform probabilist descent subspac probabilist ascent subspac order satisfi constraint figur show basic procedur line start initi temperatur randomli gener start point decid empir sampl number point search larg sampl lot object valu constraint set smaller line set number trial temperatur set number number equal constraint procedur set start point set start temperatur cool rate set trial stop condit satisfi gener trial point accept probabl end reduc temperatur end end procedur figur constrain simul anneal procedur line implement anneal process line gener trial point neighborhood current point gener probabl defin dn cn cn mean element larger equal element element strictli larger element point set trial point neighbor neighbor discret subspac neighbor neighbor continu subspac neighborhood cn prevent chang constraint line decid accept trial point accept probabl defin exp exp search find point smaller lagrangian stochast fashion stochast descent subspac enforc smaller lagrangian impli smaller smaller total constraint desir probabilist ascent absent tradit lagrang multipli violat constraint stochast order forc satisfact line temperatur geometr schedul order anneal process work asymptot converg prove converg asymptot dn proof model anneal process inhomogen markov show markov chain strongli prove markov chain minim implicit virtual energi base framework gener sa show virtual energi minimum dn detail proof found main result summar theorem theorem asymptot converg markov chain model converg asymptot dn opt probabl tabl fit gener iter search framework find sp dn implement compon framework framework compon gener probe greedi probabilist gener probe greedi probabilist insert probe determinist anneal insert probe determinist anneal power method aspect solv gener continu constrain optim problem unifi fashion find dn slow cool schedul practic cool schedul infinit long finit cool find dn high probabl make multipl run finit improv success probabl find dn test work solv nonlinear benchmark problem major defici sampl long time converg solv larg complex constrain nlp determin suitabl cool schedul solv nlp fit gener search framework figur find sp dn maintain list candid time tabl summar implement major compon gener search framework entail greedi gener determinist insert list determinist accept stop updat constraint satisfi gener probe randomli accept base probabl dimens stop updat constraint satisfi summari survei chapter exist work solv constrain nlp survei show method gener solv constrain nlp involv strategi satisfi multipl nonlinear constraint simultan viabl approach transform constrain nlp unconstrain penalti function solv exist unconstrain search algorithm penalti formul gener cover class problem defin chapter formul lead algorithm restrict scope method solv penalti method find local minima penalti function find global optimum stochast search algorithm sa gener global optim algorithm find global optim point unconstrain problem focu penalti formul thesi exist search algorithm solv unconstrain penalti formul unconstrain minima penalti formul minima constrain local minima origin constrain nlp penalti chosen constraint origin nlp local minima penalti function satisfi exist algorithm solv origin constrain nlp newli develop theori discret constrain optim lagrang multipli constrain local minima discret constrain nlp condit point unconstrain penalti function correspond sp dn dn enabl search point satisfi condit unconstrain penalti function order locat dn origin nlp condit base discret variabl extend work continu space discret continu variabl fine evalu error due discret exist algorithm implement solv gener continu constrain nlp unifi fashion achiev asymptot converg dn probabl fit gener search framework find sp dn rest base extend mechan gener search framework find sp dn includ genet oper studi theori determin optim schedul order minim expect search time applic exist stochast constrain optim algorithm chapter theori stochast search algorithm present theori minim expect search time sequenti parallel base observ larg class convex relationship expect overhead find solut durat iter deepen find optim durat prove optim schedul extend theori parallel process show problem schedul multipl processor order minim expect complet time analyz perform limit parallel parallel iter deepen final deriv perform bound optim parallel schedul list tabl major notat theori notat rest thesi tabl list major notat mean theori align notat sequenti parallel row tabl number processor run parallel studi fix qualiti level chapter drop argument notat chapter simplic investig chapter sequenti parallel symbol mean symbol mean schedul run sequenti schedul run multipl multipl time time parallel processor counterpart ps asynchron parallel schedul counterpart ps sync synchron parallel schedul ac ac sequenti schedul ps ac parallel schedul ic sequenti schedul ps parallel schedul compon compon random variabl denot random variabl denot length run length run opt optim opt optim sequenti schedul parallel schedul processor ic opt optim minim ic opt optim minim ic opt minimum ic opt minimum ic sequenti schedul parallel schedul counterpart sync opt minimum sync parallel schedul id expect length id id expect length parallel id ac figur ic ac sequenti schedul exist optim sequenti schedul set number probe run sequenti schedul run infinit sequenc call compon repres run previou run success run assum independ assign interrupt complet execut sequenti schedul entail run singl processor multipl run make probe search solut desir qualiti found major schedul tradit job schedul complet time schedul number time run success unbound random variabl denot total number probe execut schedul assum succe run goal determin schedul order minim expect number probe schedul classifi sequenti schedul shown figur schedul figur run multipl constant number probe call schedul ic denot type shown figur run multipl number probe call schedul ac denot ac find optim schedul ic show optim schedul ic remain optim compar schedul ac expect total number probe pr figur curv sa ga convex absolut minimum random probe monoton absolut minimum exist optim minim pr lim pr pr bound pr optim minim expect search overhead ic schedul denot optim ic opt sa compon set pr run made set run high pr unnecessarili high lead high cost success lead exist ic opt show optim ic optim ac schedul ic opt minimum ic opt minimum sequenti includ ic ac theorem minimum expect number probe sequenti schedul opt ic opt ic opt pr ic opt proof prove expect number probe ac ac schedul ac ic opt ac compon ac pr pr rearrang exchang order summat ac pr pr pr infinit sequenc trivial prove induct reduc ac pr definit ic opt pr ic opt pr ic opt pr ic opt pr ic opt ac pr pr ic opt pr ic opt ac ic opt pr ic opt ic opt theorem show optim expect number probe ic opt deriv lower bound ac theorem impli ic opt optim sequenti schedul optim sequenti schedul iter deepen goal section design practic strategi schedul multipl run order minim expect overhead find solut prove averag overhead strategi order magnitud opt fail fail fail fail success total time iter deepen optim time pr figur principl iter run domin overhead optim schedul gener problem depend hard determin iter deepen estim basic idea iter deepen shown figur make seri run geometr total run time domin run succe find solut approach figur start small number probe set geometr number probe run multipl time maximum time stop immedi solut found iter deepen id expect total number probe id figur find solut theorem show rel complex id opt procedur id set initi maximum number probe set number run fix repeat evalu success goto end end maximum number probe stop condit satisfi solut qualiti found end procedur figur id sequenti schedul iter deepen theorem optim sequenti schedul iter deepen id opt pr pr monoton lim pr pr ic opt proof base schedul id defin ic opt pr monoton pr pr ic opt pr probabl succe run probe run run pr ic opt eb expect total number probe spent line figur run maximum time probe stop immedi succe eb pr possibl line figur find target solut succe iter run succe success probabl iter run probe larger success probabl iter run probe id bq eb reduc id ic opt bq ic opt eb reduc id ic opt eb id ic opt eb ic opt ic opt search converg finit averag ic opt pr ic opt prove result id ic opt opt achiev goal show id constant factor opt condit condit theorem requir larg iter deepen succe ic opt overshoot larg ensur expect total overhead unbound case overshoot discuss chapter gener set parallel discuss section parallel process goal parallel process minim expect search time parallel multipl run processor basic assumpt run run assign run singl processor complet interrupt partit made assumpt sa iter algorithm parallel exploit run interest schedul multipl run multipl processor order minim expect execut time search rest prove schedul multipl run parallel order minim expect complet time find optim schedul restrict studi perform limit schedul multipl run parallel extend iter deepen schedul parallel prove optim complex schedul multipl run parallel ident parallel schedul run processor consist sequenti compon sequenti schedul compon assum integ run parallel processor run sequenti schedul parallel search termin succe find solut random variabl length run parallel schedul min goal parallel process multipl run minim expect length parallel schedul optim problem belong class np posit number parallel schedul instanc problem involv infinit sequenc infinit time comput gener solut instanc verifi polynomi time problem belong class np problem solv nondeterminist turn machin polynomi guess instanc finit size examin polynomi bound time problem parallel schedul multipl run np instanc infinit size schedul finit algorithm termin finit time infinit schedul success probabl close finit number run show restrict parallel schedul finit number parallel schedul problem impli intract finit number parallel schedul consist sequenti schedul finit durat run parallel processor execut assign schedul termin run processor succe find solut parallel schedul run parallel schedul finit number defin length expect similar defin problem parallel schedul finit multiset compon number probe run total function pr posit real number parallel schedul assign compon processor theorem parallel schedul proof parallel schedul solv nondeterminist polynomi guess parallel schedul comput compar parallel schedul np show partit reduc parallel schedul partit problem multiset posit integ subset prove partit reduc parallel schedul extens case trivial instanc partit defin instanc parallel schedul pr transform polynomi time parallel schedul pr run termin run finish total number probe assign processor schedul partit case lead pr curv problem defin optim expect complet time opt minimum parallel schedul opt determin parallel schedul problem number run schedul restrict opt found polynomi time rest heurist schedul section find sync opt minimum expect complet time import class parallel deriv lower bound opt section parallel iter expect complet time order magnitud sync opt limit parallel process establish classif parallel schedul find sync opt minimum expect complet time class parallel schedul classif give lower bound opt classif parallel schedul figur show classif parallel schedul figur depict class schedul schemat divid parallel schedul synchron asynchron parallel schedul schedul asynchron synchron schedul synchron schedul schedul ps sync ps ps ac ps figur classif parallel schedul asynchron schedul schedul schedul figur parallel parallel schedul denot ps sync ps synchron processor run durat time sequenti synchron schedul divid ic ac schedul schedul ps processor run probe repeatedli success schedul ps ac processor run number probe number probe run time chang minimum expect complet time synchron parallel schedul deriv minimum expect complet time synchron parallel includ ic ac similar sequenti extend result schedul ps defin parallel reachabl probabl probabl solut desir qualiti found make run probe pr expect complet time ps figur show parallel reachabl probabl expect complet time run schedul problem optim minim note plai role pr sequenti schedul ic opt optim minim ic opt minimum schedul prove minimum minimum sync synchron includ ic ac sync opt minimum sync synchron parallel schedul figur parallel reachabl probabl expect complet time run parallel schedul problem note exist ic opt lemma minimum expect complet time synchron parallel schedul sync opt ic opt ic opt ic opt proof proof theorem substitut pr lemma import optim complet time restrict class parallel schedul problem note gener schedul problem lower bound opt opt determin express simpl form sync opt theoret lower bound opt proposit opt opt proof parallel schedul run processor run succe find solut desir qualiti complet time set posit integ defin function defin pr pr pr pr obviou pr pr opt inequ obtain theorem proposit opt argmin proof definit defin pr rewritten easi verifi chosen inequ procedur parallel id set initi number probe set number run fix repeat execut probe success processor goto end end number probe stop condit satisfi solut qualiti found end procedur figur parallel id parallel schedul iter deepen parallel schedul iter deepen design parallel schedul iter deepen expect complet time constant factor sync opt figur show algorithm schedul multipl run parallel iter deepen number probe success run processor execut seri geometr number probe synchron solut desir qualiti found parallel id classifi schedul schedul run reachabl probabl doubl succe expect complet time sequenti schedul iter reachabl probabl make probe id expect complet time parallel id processor theorem theorem optim parallel id id sync opt monoton lim ic opt expect complet time parallel id order magnitud optim synchron parallel schedul parallel schedul problem develop parallel schedul iter deepen optim constant special class synchron parallel schedul summari show optim sequenti schedul minim expect overhead find solut desir qualiti multipl run iter deepen develop optim schedul prove multipl run iter deepen optim expect overhead order magnitud optim expect overhead extend theori schedul multipl run prove parallel schedul assumpt number schedul studi perform limit schedul multipl run parallel iter deepen determin number probe schedul multipl run parallel prove optim past studi aim design schedul run higher chanc prior studi examin multipl run durat run improv probabl solut approach base iter deepen uniqu exploit convex relationship expect overhead durat run fact total overhead domin run theori gener appli exist shown chapter chapter optim schedul constrain optim chapter develop stochast constrain optim algorithm optim schedul constrain algorithm deriv gener search framework find sp dn optim version develop iter deepen estim optim schedul chapter consist part section develop constrain genet algorithm combin incorpor genet oper search subspac gener framework section appli theori develop optim version optim gener feasibl solut prescrib qualiti averag time order magnitud spent origin optim schedul gener solut similar qualiti section evalu combin search framework identifi optim combin constrain genet search figur chapter gener framework unifi search mechan solv constrain nonlinear program problem function necessarili continu framework base condit constrain local minim discret space show saddl point constrain local minima implement search saddl point perform ascent subspac descent subspac order reach equilibrium saddl point exist algorithm sp dn fit search maintain list candid entail greedi gener determinist insert list candid determinist accept candid gener probe randomli accept base probabl dimens dimens method stop updat constraint satisfi extend mechan framework includ genet oper present section cga section combin constrain genet algorithm cga develop base gener framework figur saddl point similar tradit organ search number involv popul candid point search space search lagrangian genet oper gener probe procedur set gener number initi random popul repeat multipl gener evalu candid repeat probe subspac evalu insert number probe updat end procedur figur constrain genet algorithm popul size number gener greedi probabilist gener determinist organ candid lagrangian valu figur outlin pseudo code algorithm call popul number gener tabl show cga fit gener framework saddl point line initi gener number vector lagrang multipli start popul randomli gener user provid line termin cga maximum number gener feasibl solut found success gener stop condit cga iter tabl cga fit gener iter search framework find saddl point framework compon cga gener probe ga sa ga gener probe probabilist probabilist insert probe anneal anneal insert probe anneal anneal line evalu gener individu popul gener discret augment lagrangian function fit function line explor subspac genet search select individu reproduc genet oper insert individu gener lagrangian valu line updat vector lagrang multipli vector maximum violat maximum violat constraint evalu individu max constraint transform posit paramet control fast lagrang multipli chang shown option implement oper gener probabilist greedi fashion probabilist gener uniform distribut greedi gener uniform distribut order ascent lagrangian function subspac option search subspac accept probe determinist anneal rule determinist accept candid improv lagrangian function anneal accept candid reduc lagrangian function exp control paramet time lagrang multipli chang constraint satisfi line updat gener number advanc gener obviou condit cga converg individu impli individu feasibl solut origin problem constraint satisfi continu evolv order suppress unsatisfi constraint note constraint candid design procedur decid specif candid enforc constraint satisfact procedur enforc constraint satisfact candid encount appli cga suitabl popul size benchmark problem optim popul size rang develop dynam procedur select suitabl popul size run present procedur cga perform present small fix popul size determin proper number gener run run cga exceedingli long durat order find dn similar cga studi chapter multipl run cga schedul order minim expect overhead procedur set repeat multipl gener sa line gener dn accept probabl end set set sa part end repeat ga probe subspac evalu insert number probe updat gener number end procedur figur combin cga call popul size number gener find solut desir qualiti section iter deepen determin optim number gener combin constrain sa ga base gener framework figur design integr figur cga figur combin procedur tabl show fit gener framework find sp dn figur show pseudo code combin algorithm algorithm sa ga gener probe subspac procedur call popul number gener line initi popul unlik individu popul defin joint randomli initi line perform probe individu gener probabilist point accept point base anneal probabl distribut control paramet set ng evalu line start ga search sa part complet algorithm search subspac ga evalu augment lagrangian individu order select individu fit order individu vector lagrang averag lagrang multipli popul calcul lagrangian individu averag lagrang multipli note similar cga decid proper number candid popul durat run address issu iter deepen section implement detail algorithm deriv sp dn import neighborhood gener proper trial point subspac order solv constrain nlp import compon method frequenc updat set cga ratio gener trial point subspac current point number variabl number constraint ratio mean updat gener trial point dynam control neighborhood size sa part base ratio rule ga oper iii fit function implement cga default paramet sa part iii ga part gener trial point subspac randomli gener gener randomli gener gener probe greedi fashion adjust adapt constraint repres vector vector maximum violat defin constraint adjust modifi fast chosen reduc quickli lead possibl poor object valu satisfi constraint reduc neighborhood reduc slowli enlarg neighborhood order improv chanc satisfact note adjust refer constraint violat expect iter deepen cga determin number probe run algorithm shown pr finit previou applic user gener experi trial error solut desir qualiti found tune solv larg complex problem interest run singl version adjust schedul adapt order find schedul close optim theori chapter shown gener optim schedul multipl run minim expect overhead find solut observ ic schedul probe run set larg small optim result averag search time determin optim depend pr curv chapter iter deepen order estim optim durat run rest appli iter deepen result id cga id id base theori show optim version requir specif tune search schedul optim schedul order appli iter import identifi paramet control number probe run search framework figur algorithm fit search framework figur length candid total number iter run search total number probe run case cga maintain list candid convent simul anneal cool schedul determin total number probe gener asymptot converg dn probabl prove respect cool schedul temperatur logarithm fashion base origin condit develop sa requir infinit long cool schedul order approach dn probabl asymptot converg exploit algorithm termin finit time wai complet finit time approach infinit long logarithm cool schedul termin finit time desir converg feasibl solut termin high temperatur approach design cool schedul complet prescrib finit time thesi geometr cool schedul cool rate measur number probe probe made temperatur probe total number probe cool schedul probe neighbor point examin independ accept determin length cool log control total number iter set set expect overhead multipl run order find solut desir probe pr order verifi exist optim minim collect statist pr pr solv test problem problem pardalo problem set result test pr absolut minimum optim minim problem pr absolut minimum pr figur show exist minimum pr appli solv cool schedul run time figur illustr exist optim appli solv pr curv convex optim cga maintain list candid number probe expend cga popul size number gener pr pr paramet control gener iter deepen adjust multipl control paramet simultan order lead schedul minim research found perform cga sensit perform cga rang vari impact search pr ng pr pr absolut minimum ng pr figur show exist minimum ng pr popul size appli solv experi run time problem size order remain small rang develop optim schedul cga appli iter deepen fix fix pr reachabl probabl pr pr expect number probe multipl run cga pr pr pr determin expect overhead cga fix popul size form constant gener optim minim ng pr collect statist ng pr cga solv set problem solv result cga ng pr absolut minimum problem optim number gener minim expect overhead find solut multipl run cga figur show exist optim appli solv problem ng pr convex optim iter deepen appli cga figur show id schedul multipl run iter deepen deriv gener algorithm figur id set geometr cool initi cool schedul cool run maximum time stop immedi solut found iter deepen similar appli iter deepen deriv schedul run cga multipl time cga id figur set geometr find solut qualiti initi number gener iter deepen id obtain substitut cga figur theorem id opt condit theorem satisfi benchmark pr ic opt pr ic opt substitut valu condit theorem yield procedur id set initi number probe set number run fix repeat iter deepen find call end set feasibl solut qualiti found exce maximum number solut found success feasibl solut end procedur figur id iter call desir solut qualiti set max number max initi maximum number probe line figur stop condit order algorithm termin algorithm stop solut target qualiti total number probe spent solv target level exce maximum deepen solut found success geometr schedul feasibl solut found stop condit ensur iter deepen appli number time id cga id id call modul anytim search algorithm develop chapter schedul iter deepen fashion modul anytim search call qualiti target stop search resourc procedur cga id set initi number gener popul size set number cga run fix repeat iter deepen find call end set feasibl solut qualiti found exce maximum number solut found success feasibl solut end procedur figur cga id cga iter call desir solut qualiti solut qualiti depend search time user longer search solut qualiti deliv remain issu left design cga id id suitabl popul size gener id set experi result section show optim slightli expect overhead find solut constant cga id optim popul size rang determin priori suitabl popul size present algorithm perform id tabl result cga id id evalu combin strategi framework figur problem cpu time averag run collect iii comput solari mean solut desir qualiti found probe insert strategi target sol dn target sol dn gener subspac subspac id cga id id id cga id id probabilist anneal anneal probabilist anneal determinist probabilist determinist anneal probabilist determinist determinist greedi anneal anneal greedi anneal determinist greedi determinist anneal greedi determinist determinist evalu combin strategi search framework section evalu combin strategi gener framework figur determin combin gener probe organ candid tabl show evalu result problem combin strategi figur combin sa ga gener probe subspac show averag time run combin strategi order reach solut qualiti level dn similar evalu result benchmark problem result show pure ga gener probe subspac sa combin sa ga id id found perform probe gener subspac accept anneal determinist rule prevent search stuck local minima point found perform probe subspac gener probabilist greedi rule candid insert anneal determinist rule gener probe subspac probabilist insert candid subspac anneal rule lead good stabl perform combin strategi experi show result evalu algorithm ten constrain nlp problem object function type constraint linear nonlinear nonlinear inequ number variabl includ simpl ratio feasibl space respect search space vari topolog feasibl region tabl compar perform id cga id id respect id expect total cpu time multipl run solut found column show problem id id cga id id find dn compar perform respect id averag total overhead multipl run dn found fourth column averag time number function evalu id find tabl result id cga id id find solut discret constrain nlp id cpu time find solut averag run collect iii comput solari repres number evalu id problem problem id cga id id id solut id opt id id opt id column show perform cga id respect opt optim popul size found averag time find result show cga id competit compar id opt column show perform id present averag time number evalu constant show averag time opt found result show improv opt id improv id compar id problem summari extend gener framework unifi mechan sp dn correspond dn constrain optim cga deriv framework includ genet search strategi cga similar determin suitabl durat run order minim expect time find solut desir qualiti multipl run appli theori algorithm develop schedul success run durat iter deepen evalu combin strategi framework identifi good combin work practic demonstr improv perform cga compar found cga perform outperform cga term averag search time find dn chapter optim anytim schedul constrain optim base optim schedul multipl run chapter design anytim version schedul multipl run gener gradual improv feasibl solut time eventu find dn observ exponenti relationship object target id averag complet time base exponenti design anytim search util set improv object qualiti target base principl iter deepen prove optim anytim search algorithm test algorithm set standard benchmark compar perform exist method problem formul develop chapter id cga id id determin schedul multipl run order minim expect search time optim search time long solv larg complex constrain nlp applic interest optim algorithm find suboptim solut time limit anytim algorithm algorithm gener improv solut comput time goal chapter design set object target search schedul iter deepen gener improv solut time eventu find dn search schedul optim time gener dn order origin optim schedul find dn approach studi statist perform base statist exponenti model relat object target sought optim averag execut time model lead design anytim search schedul iter schedul multipl run set geometr number probe run set linearli improv object target opt expect number probe origin optim sequenti schedul find dn expect total number probe find solut valu gradual improv time base principl iter deepen prove optim opt perform model constrain optim perform procedur solv applic problem random start point measur probabl find solut prescrib qualiti stop averag time find solut studi previou chapter relationship search time success probabl run focu relationship object target averag time find desir solut optim schedul relax object target improv chanc find solut dn dn origin goal dn approach achiev stop find dn prescrib qualiti approach desir gener find dn alloc lead time find dn dn prove asymptot converg relax procedur approach adopt studi modifi constrain nlp smaller origin nlp consid dn relax nlp procedur asymptot converg behavior remain relax nlp obtain transform object target origin log trace run figur graph show statist relat pr appli solv dot line show trace run assum dn origin dn relax nlp relax problem valid nlp solvabl converg asymptot dn relax nlp probabl relax object function lead possibl larger pool solut expect higher chanc hit point search properti exploit section exponenti model relat opt order develop dynam control object relationship object number probe run pr reachabl probabl section find relationship studi statist behavior evalu constrain nlp log solut optim id pr opt figur show perform model note absolut minimum pr optim expect overhead exponenti improv solut qualiti level problem solv defin cool schedul run show result figur show graph relat paramet solv pr obtain run time combin figur deriv relationship optim pr figur show result deriv figur figur illustr pr curv pr curv deriv figur absolut minimum pr curv similar curv object level exist optim minim pr figur show optim expect overhead opt solut qualiti level exponenti relationship opt observ lead exponenti opt ke posit real constant problem id problem problem problem problem tabl determin linear fit log opt benchmark evalu pardalo problem verifi statist perform experi benchmark pardalo problem collect statist opt regress linear function log opt find calcul determin fit tabl summar linear fit test close show good fit close opt verifi exponenti respect anytim schedul iter deepen design section schedul object target find averag time order magnitud opt figur find feasibl solut small amount time tighten requir find solut qualiti output solut stop import point regress run time order find valu paramet reason paramet model hard estim exploit exponenti relationship opt order deriv set run paramet procedur set initi target solut qualiti repeat gradual improv solut qualiti target call id gener solut qualiti end solut found reduc target level fail solv target end procedur figur anytim procedur iter deepen call id figur inform inform feasibl solut found initi object target recal id stop condit termin search fail deepen termin anytim search id fail solv solut qualiti target level elimin stop condit id anytim fashion anytim procedur stop search resourc solut qualiti depend search time user longer search solut qualiti deliv anytim search object target find solut qualiti id figur line adjust object target solut found time time feasibl solut line updat feasibl solut initi object target base exponenti model principl iter deepen averag number probe find solut grow geometr linear posit constant set expect total number probe find start object target level theorem prove rel complex opt theorem opt proof theorem id opt exponenti model opt theorem show find solut intermedi qualiti linear sequenc improv object target complex domin find solut object target establish show opt anytim optim schedul extend schedul multipl run parallel multipl processor parallel id find solut qualiti verifi statist exponenti relationship sync opt expect overhead parallel id target qualiti linear schedul reduc total overhead domin overhead find solut obtain parallel substitut id figur parallel id expect total number probe parallel find start object target level assum exponenti relationship sync opt theorem sync opt proof proof theorem substitut opt sync opt behavior anytim search demonstr behavior anytim search appli constrain nlp size easi nlp multipl feasibl region larg number deep local minima object function pardalo problem larg nlp equal constraint figur compar anytim behavior origin term solut qualiti execut time anytim perform origin found run cool schedul multipl time dn time time time time time time time time figur comparison anytim perform origin solv constrain minim nlp found optim geometr schedul ran random start point result show perform substanti origin anytim algorithm compar amount found suboptim solut compar solut order time result constrain nlp benchmark survei exist constrain nlp benchmark solver section section report result compar method solv set discret optim deriv continu benchmark problem set section compar method branch bound method solv constrain exist constrain nlp solver benchmark summar exist constrain nlp benchmark tabl column list benchmark column benchmark class constrain nlp column number variabl number constraint fix variabl nlp benchmark suit column show mat benchmark pardalo problem set cute cop optim problem set continu constrain nlp continu function test problem model librari ampl model librari constrain nlp function necessarili summar exist constrain nlp solver tabl column list solver column solver appli solv class constrain nlp column solver requir convex column show main method column show input format accept column show addit requir solver deal continu constrain nlp requir convex function solv continu constrain nlp function continu baron bb solv discret constrain nlp function continu comparison result method lead algorithm solv constrain nlp exist solv constrain nlp tabl summari exist constrain nlp benchmark ampl mp tabl solver requir constraint format requir sequenti quadrat program ampl sequenti quadrat program fortran modest free variabl sequenti quadrat program ampl genet algorithm baron branch reduc baron model factor branch bound extend cut plane lp solv constrain nlp appli solv problem variabl continu discret solut found continu benchmark problem deriv discret version compar method method solv constrain nlp deriv discret benchmark set continu benchmark pardalo problem select problem cute constrain unconstrain test environ gener constrain assum variabl discret gener constrain assum variabl odd indic continu indic discret discret continu variabl rang lower upper bound forc valu problem object function type constraint equal inequ ratio feasibl space respect search space vari topolog feasibl region problem origin develop test tune constraint handl techniqu evolutionari algorithm number variabl test set includ simpl set benchmark collect pardalo deriv practic applic number variabl test set includ simpl test problem set select cute base criterion object constraint nonlinear number variabl number constraint cute larg thousand result pardalo problem report result ten constrain nlp pardalo benchmark solv problem popular packag method wide solv continu constrain nlp discret discret continu solut result algorithm run time sequenc random start point measur perform averag time finish run probabl find feasibl solut prescrib qualiti solut averag time find feasibl solut prescrib qualiti tabl show result deriv discret problem column show problem id solut column find feasibl solut tabl perform comparison solv deriv discret constrain nlp time comput run solari stand feasibl solut found solut qualiti run algorithm sequenc start point problem discret nlp discret nlp discret nlp id solut solut column show result time result averag time find solut solut anytim search run tabl report result discret problem deriv pardalo continu benchmark tabl tabl show comparison result solv deriv perform solv discret constrain nlp find solut discret problem fail find feasibl solut mean discret continu solut found lead feasibl discret solut find poor tabl perform comparison solv deriv discret constrain nlp pardalo continu constrain benchmark time comput run solari stand feasibl solut found solut qualiti run algorithm sequenc start point problem discret nlp discret nlp discret nlp id solut tabl perform comparison solv deriv constrain nlp time comput run solari stand feasibl solut found solut qualiti run algorithm sequenc start point problem nlp nlp nlp id solut feasibl solut problem find feasibl solut solut problem find feasibl averag cpu time gener shorter run quicker success ratio lower limit requir object constraint function solv nlp deriv hard calcul unavail discret compar found perform small problem requir solut time larg complex problem search time tabl perform comparison solv deriv constrain nlp pardalo continu constrain benchmark time comput run solari stand feasibl solut found solut qualiti run algorithm sequenc start point problem nlp nlp nlp id solut time shorter find solut similar discret version result cute benchmark tabl report comparison result solv discret constrain nlp deriv select cute benchmark start point problem column show problem give number variabl number constraint column show type object function number linear equal constraint le number nonlinear equal constraint ne number linear inequ constraint li number nonlinear inequ constraint ni column show solut cpu time obtain term abil solv discret nlp unabl find feasibl solut half problem discret continu solut found lead feasibl discret solut problem similar shorter time solv small run time competit solv larg continu constrain nlp variabl constraint sampl inform deriv term solut qualiti find feasibl solut solv problem obtain solut found solut found solut discret problem find feasibl solut discret problem found solut found solut figur depict normal solut qualiti normal cpu time respect deriv discret cute benchmark solvabl algorithm figur depict result benchmark smaller shorter cpu time solut qualiti cpu time gener longer cpu time solut qualiti tabl list discret deriv select cute problem solv solv time problem larg nonlinear constraint make find feasibl point tabl result compar solv discret constrain nlp deriv select continu problem start point problem time comput run solari mean feasibl solut found public version commerci version submit problem box number repres solut method solut problem id nv nc le li ni solut cpu time solut cpu time solut cpu time quadrat nonlinear nonlinear batch nonlinear nonlinear quadrat nonlinear nonlinear quadrat linear nonlinear linear quadrat nonlinear nonlinear linear nonlinear fletcher quadrat linear linear nonlinear nonlinear nonlinear hong nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear continu page continu previou page problem id nv nc le li ni solut cpu time solut cpu time solut cpu time nonlinear quadrat nonlinear quadrat nonlinear nonlinear quadrat nonlinear nonlinear nonlinear quadrat nonlinear nonlinear nonlinear nonlinear quadrat nonlinear nonlinear linear nonlinear nonlinear linear nonlinear nonlinear nonlinear quadrat nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear quadrat nonlinear quadrat nonlinear nonlinear nonlinear nonlinear nonlinear linear continu page continu previou page problem id nv nc le li ni solut cpu time solut cpu time solut cpu time nonlinear nonlinear nonlinear nonlinear quadrat quadrat nonlinear nonlinear nonlinear lin nonlinear nonlinear nonlinear linear quadrat quadrat mesh nonlinear mistak quadrat nonlinear quadrat nonlinear quadrat quadrat nonlinear linear linear linear linear qc nonlinear linear robot quadrat quadrat nonlinear snake linear spiral linear nonlinear nonlinear nonlinear nonlinear nonlinear linear nonlinear continu page continu previou page problem id nv nc le li ni solut cpu time solut cpu time solut cpu time linear nonlinear quadrat quadrat nonlinear tabl result compar solv constrain nlp deriv select continu problem cute start point problem time comput run solari mean feasibl solut found public version commerci version submit problem box number repres solut method solut problem id nv nc le li ni solut cpu time solut cpu time solut cpu time quadrat nonlinear nonlinear nonlinear batch nonlinear nonlinear quadrat nonlinear nonlinear quadrat linear nonlinear linear quadrat nonlinear nonlinear nonlinear linear nonlinear fletcher quadrat linear linear nonlinear nonlinear nonlinear nonlinear hong nonlinear nonlinear nonlinear continu page continu previou page problem id nv nc le li ni solut cpu time solut cpu time solut cpu time nonlinear nonlinear nonlinear nonlinear quadrat nonlinear quadrat nonlinear nonlinear quadrat nonlinear nonlinear nonlinear quadrat nonlinear nonlinear nonlinear nonlinear quadrat nonlinear nonlinear linear nonlinear nonlinear linear nonlinear nonlinear nonlinear quadrat nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear quadrat nonlinear quadrat nonlinear nonlinear continu page continu previou page problem id nv nc le li ni solut cpu time solut cpu time solut cpu time nonlinear nonlinear nonlinear linear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear quadrat quadrat nonlinear nonlinear nonlinear nonlinear launch nonlinear lin nonlinear nonlinear nonlinear linear quadrat quadrat mesh nonlinear mistak quadrat linear nonlinear quadrat nonlinear quadrat quadrat quadrat nonlinear linear linear linear linear qc nonlinear nonlinear linear robot quadrat continu page continu previou page problem id nv nc le li ni solut cpu time solut cpu time solut cpu time quadrat nonlinear snake linear spiral linear nonlinear nonlinear nonlinear nonlinear nonlinear linear nonlinear linear nonlinear quadrat quadrat nonlinear normal cpu time normal solut qualiti figur normal solut qualiti normal cpu time respect solv deriv discret cute benchmark solvabl normal cpu time normal solut qualiti figur normal solut qualiti normal cpu time respect solv deriv cute benchmark solvabl tabl discret constrain nlp deriv select cute problem solvabl time time comput run solari problem id le ne li ni solut cpu time nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear linear nonlinear linear linear linear nonlinear nonlinear nonlinear nonlinear tabl constrain nlp deriv select cute problem solvabl time time comput run solari problem id le ne li ni solut cpu time nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear linear nonlinear linear linear linear nonlinear nonlinear nonlinear nonlinear comparison result branch bound method compar method bb solver branch bound solv select problem benchmark suit summar result tabl column list problem id select problem variabl column type object function number number integ type constraint function number constraint column show solut cpu time obtain bb submit problem neo server problem method bb term solut qualiti found solut object found solut object problem bb fail find feasibl solut problem bb found feasibl solut object found solut object run time competit bb solv larg problem sampl bb util inform deriv function search point branch bound method solv constrain nlp class requir function method solv constrain nlp class tabl result compar bb solv select benchmark suit time comput run solari time bb neo server mean feasibl solut found box number repres solut method solut problem object constraint bb id solut solut solut batch nonlinear nonlinear nonlinear linear linear nonlinear nonlinear nonlinear quadrat quadrat spring nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear nonlinear linear nonlinear linear nonlinear linear nonlinear linear nonlinear linear nonlinear linear nonlinear linear nonlinear summari anytim search algorithm import solv larg complex constrain nlp time find dn suboptim dn accept found time limit search dn qualiti control schedul durat multipl run iter deepen order overhead domin total overhead run schedul design anytim search find gradual improv dn base statist exponenti control object target iter deepen order overhead run domin total overhead previou run object target dn problem prove optim show order magnitud term complet time origin optim schedul result discret benchmark show improv quickli solv continu discret continu solut lead discret solut solut solv problem deriv evalu unavail result standard benchmark suit show improv solut qualiti branch bound method branch bound method term solut time similar branch bound method appli solv problem function chapter studi optim schedul control multipl run order solv gener constrain nlp continu space nlp studi gener function convex gener search framework solv constrain nlp framework base theori discret constrain optim lagrang multipli main result theori condit constrain local minim discret space show correspond dn sp dn implement gener search framework perform descent subspac ascent subspac order reach equilibrium sp dn gener framework unifi exist constrain cga deriv framework incorpor genet algorithm search mechan constrain algorithm stochast search algorithm succe find solut desir qualiti reachabl probabl run number probe finit enhanc probabl find make multipl run order minim expect time find solut desir qualiti success probabl number probe spent import issu schedul multipl run theori studi optim schedul theori iter deepen order deriv optim schedul dynam prove optim schedul extend theori schedul multipl run parallel prove parallel schedul prove perform limit class parallel approxim schedul iter deepen optim class synchron parallel schedul theori gener appli cga thesi base optim schedul anytim search schedul gener solut improv qualiti time algorithm desir solv larg complex nlp applic suboptim solut accept found reason time base exponenti model relat object qualiti target expect search linear schedul success improv qualiti level time find solut qualiti domin search time anytim schedul optim time find feasibl solut qualiti level order magnitud origin optim schedul find dn result anytim schedul standard engin benchmark shown wide adapt suitabl robust gener anytim solut improv qualiti gener search framework unifi solv nonlinear constrain nonlinear optim problem bibliographi aart simul anneal boltzmann machin wilei ullman design analysi comput algorithm ali storei modifi control random search algorithm intl journal comput direct search simul anneal algorithm optim involv continu variabl technic turku centr comput abo numer comparison modifi control random search algorithm journal global global optim stochast differenti equat journal optim theori septemb andersen andersen interior point optim linear implement homogen algorithm high perform optim anderson walsh graphic method class trajectori journal optim theori june arrow gradient method concav local result studi linear nonlinear program stanford schwefel survei evolut strategi proc intl conf genet page back schwefel overview evolutionari algorithm paramet optim evolutionari minimax dualiti linear nonlinear program baluja empir comparison iter evolutionari function optim heurist technic carnegi mellon baluja davi fast probabilist model combinatori optim proc nation conf artifici intellig baluja local optim simul anneal ieee cybernet confer page varieti global optim method journal global cutler global optim cover method deriv journal global reactiv tabu search orsa journal good survei tactic gener lagrangian multipli context lagrangian dualiti european journal oper bean dual genet algorithm bound integ program technic report depart industri oper chu genet algorithm set cover problem european journal oper partit procedur solv program problem numer page bertseka constrain optim lagrang multipli method academ sequenti quadrat program acta de paul viola find optima estim probabl densiti advanc neural inform process ph constrain unconstrain test environ acm tran mathemat boyan moor learn evalu function global optim boolean satisfi proc nation conf artifici intellig wood hesit adapt search global optim mathemat interior point algorithm larg scale nonlinear program siam journal termin repel unconstrain tunnel fast global optim journal optim theori april stuckei lagrangian reconstruct class local search method proc intl conf artifici intellig tool ieee comput ar ph fortran packag nonlinear optim springer cook complex procedur proc ann acm symp theori page minim multimod function continu variabl simul anneal algorithm acm tran mathemat dekker aart global optim simul anneal mathemat extend continu newton method journal optim theori octob elizabeth jorg benchmark optim softwar cop technic report mathemat comput scienc argonn nation elizabeth jorg benchmark optim softwar perform profil preprint mathemat comput scienc argonn nation nonlinear program algorithm process system synthesi chemic engin page outer approxim algorithm class nonlinear program mathemat page eshelman genet algorithm interv schemata foundat genet volum page morgan kaufmann san nonlinear optim topic chemic engin oxford pardalo collect test problem constrain global optim volum lectur note comput scienc fogel introduct simul evolutionari optim ieee tran neural januari garei johnson comput guid theori san obtain relax integ program comput op ge class fill function find global minim function variabl journal optim theori geman geman stochast gibb distribut bayesian restor imag ieee tran pattern analysi machin gener decomposit optim theori page lagrangian relax integ program mathemat program markov chain converg anneal algorithm statist gile total dual integr integ volum elsevi north gill user guid fortran packag nonlinear program dept univ san glover tabu search part orsa glover critic event tabu search knapsack problem proc intl conf metaheurist page glover laguna tabu search modern heurist techniqu combinatori problem reev glover reduct polynomi program linear program oper glover convert polynomi program problem linear program oper goldberg genet algorithm machin learn pub cover relax posit polynomi program manag cover relax algorithm solv posit polynomi program mathemat bean genet algorithm integ program technic report depart industri oper cool schedul optim anneal mathemat oper editor boolean method oper research relat area hansen global optim interv analysi constrain nonlinear program orsa journal hart theoret comparison evolutionari algorithm simul anneal proc annual conf evolutionari program page method estim scheme global satisfi problem journal global holland adapt natur adapt system michigan ann converg cross decomposit mathemat page gener cross decomposit appli nonlinear integ program problem optim page qi constrain optim genet algorithm pardalo handbook global optim kluwer academ jeong lee adapt simul anneal genet algorithm system identif eng applic artifici join penalti function solv nonlinear constrain optim problem proc ieee intl conf evolutionari page jone forb adapt simul anneal algorithm global optim continu variabl journal optim theori kan machin schedul complex comput prove exist feasibl point equal constrain optim problem mathemat review techniqu verifi solut constrain global optim problem applic interv kluwer academ page kim evolutionari program techniqu constrain optim problem ieee tran evolutionari vecchi optim simul anneal korf heurist invari applic learn machin page michalewicz evolutionari homomorph constrain paramet optim evolutionari hybrid simplex method simul anneal intellig laboratori bell method solv discret optim problem oper linear nonlinear program publish partial separ test problem unconstrain equal constrain optim technic report institut comput academi scienc czech optim neural network ieee tran neural martin otto combin simul anneal local search heurist technic report oregon graduat michalewicz genet algorithm data structur evolut program schoenauer evolutionari algorithm constrain engin problem comput industri engin michalewicz handl constraint genet algorithm proc intl conf genet page michalewicz algorithm numer optim problem nonlinear constraint ieee intern confer evolutionari michalewicz schoenauer evolutionari algorithm constrain paramet optim problem evolutionari applic bayesian approach numer method global stochast optim journal global morri method escap local minima proc nation conf artifici page model genet algorithm markov chain annal math artifici pardalo rosen constrain global algorithm volum lectur note comput scienc constraint satisfact proc conf parallel problem solv page park carter genet search combinatori optim proc acm symposium appli genet algorithm optim page pure adapt search mont carlo optim mathemat vari fit function genet algorithm cut stock unit commit problem ieee tran cybern part powel skolnick genet algorithm engin design optim constraint proc intl conf genet page powel direct search algorithm optim calcul acta flanneri numer recip fortran cambridg smith simul anneal constrain global optim journal global septemb rosenberg minim function binari develop discret van roi cross decomposit mix integ program mathemat page converg analysi canon genet algorithm ieee tran neural user manual version dept chemic univ illinoi urbana converg random optim method journal optim theori method unconstrain optim journal optim theori octob stochast techniqu global survei recent advanc journal global schoenauer michalewicz evolutionari comput edg feasibl proc parallel problem solv schoenauer constrain ga optim proc intl conf genet selman kautz extens solv larg structur satisfi problem proc intl joint conf artifici page cohen local search strategi satisfi test proc dimac challeng workshop rutger page oct discret lagrangian base global search method solv satisfi problem global januari shapiro gener lagrang multipli integ program oper global minim algorithm dynam search trajectori journal optim theori juli wet minim random search techniqu math oper import reduct random optim journal optim theori decemb method gener nonlinear program equal constrain subproblem mathemat stanford softwar multipl criteria comput applic publish trajectori algorithm base gradient method search trajectori journal global hartlei fast simul anneal phy lett elementari survei gener dualiti theori mathemat program mathemat page global optim cycl decomposit simul anneal siam journal control user version technic report princeton algorithm optim problem journal optim theori decemb guid local search applic travel salesman problem european journal oper review statist model global optim journal global chang method solv nonlinear global optim problem global march chen constrain genet algorithm applic nonlinear constrain optim proc intl conf tool artifici page novemb chen optim anytim constrain simul anneal constrain global optim sixth intl conf principl practic constraint septemb wang constrain simul anneal applic nonlinear constrain global optim proc intl conf tool artifici page novemb wang simul anneal asymptot converg nonlinear constrain global optim principl practic constraint page octob wu theori discret lagrang multipli nonlinear discret optim principl practic constraint page octob wang global optim constrain nonlinear program phd dept comput univ decemb wang algorithm nonlinear program applic structur optim journal numer method comput zhang adapt simul anneal optim design electromagnet devic ieee tran watter reduct integ polynomi program linear program problem oper version interact base extend cut plane method process design abo wu discret lagrangian method solv nonlinear discret constrain optim problem msc dept comput univ wu theori applic nonlinear constrain optim lagrang multipli phd dept comput univ wu solv hard satisfi unifi algorithm base discret lagrang multipli proc intl conf tool artifici page novemb wu trap escap strategi discret lagrangian method solv hard satisfi maximum satisfi problem proc nation conf artifici page juli yao simul anneal extend neighborhood int journal comput stochast method practic global optim journal global al improv global optim journal global vita chen receiv bs depart comput scienc technolog china expect ms comput scienc illinoi interest includ nonlinear stochast system model neural comput algorithm design parallel comput
DB/419 3 intern confer expert system applic septemb vol pp design implement deduct manag system li mengchi liu depart comput scienc regina canada abstract deduct system advanc intellig inform system applic directli support ectiv ecient access infer larg amount persist data complex structur data de nition languag data manipul declar queri languag combin approach uniform framework paper describ design implement system introduct import extens tradit relat technolog deduct stem integr logic program relat er oper reason declar ecient secondari storag deduct base relat relat support data abstract power deduct languag support data complex structur ldl lp col hilog relationlog overview languag deduct system support data complex structur ldl coral relationlog concept evolv di erent rst program arti cial end object orient er wai meet demand advanc applic philosophi creat power synergi develop life cycl combin modular past data model develop review major problem objectori approach lack logic mathemat foundat plai import role research foundat essenti de ning semant queri optim combin import featur nest relat object extend relat richer type system includ object orient add construct relat queri sql deal ad data type past lot ort made integr deduct gain iql rol datalog survei dood model develop extend integr exist deduct objectori data model limit featur lack logic semant fulli implement persist manag system object system develop techniqu advanc intellig inform system directli support ectiv ecient access infer larg amount data complex structur languag base iql overcom problem iql ectiv integr featur deduct languag ned logic semant system develop sun sparcstat run solari implement persist system support queri data de nition languag data manipul languag implement base rol relationlog describ design implement system section provid overview languag section describ system architectur section explain le system storag manag section discuss kernel section focu queri evalu issu section conclud comment futur plan due space discuss overview languag class relat complex data structur nest tupl set present summari languag consist fact languag type languag de queri type part type de nition support atom data type includ real class type object base data complex data type de ned tupl set constructor exampl show de ne tupl set type creat type address citi creat type schema part schema class relat schema descript structur basi storag structur queri optim strategi essenti consist exampl show de ne class relat creat class person gender children ancestor creat relat famili husband wife children primari kei class relat de nition di er kei word class de nition collect object relat de nition collect relat tupl object object identi er relat tupl support class hierarchi multipl inherit exampl show de ne subclass creat class isa person salari phone integ creat class student isa person ag integ rule part de ne intent data deriv data fact part rule correspond view relat de ned show de ne rule deriv inform class person relat creat rule person ancestor parent ancestor parent creat rule famili famili wife children person children famili children person children fact part relat tupl object show creat object tom pam object identi insert gender parent fg insert student gender parent fg user queri queri queri repres rule head speci es construct result bodi speci es queri condit queri queri result person queri result person queri result famili queri result children famili rol support rule queri system architectur system implement persist system unix environ function compon roughli divid storag manag shown figur type checker dml manag interfac interfac layer index manag kernel ddl manag data index file system file storag manag storag layer queri manag fig architectur system interfac layer friendli interfac user request di erent translat intern form kernel kind interfac textual interfac web interfac kernel consist ve compon type queri dml ddl index manag type checker deal type check request ddl manag process ddl maintain system catalog relat rule dml manag perform updat relat object queri manag handl user queri index manag maintain index process index relat oper ddl dml provid index inform queri manag storag manag layer manag data structur store rapid access object relat meta inform disk main job storag manag move data disk memori file system storag manag le system built top unix le system correspond disk data le index automat creat system start data le store object relat tupl index le kei indic object relat tupl maintain system le meta data le record inform relat le record inform class le record inform rule le record inform rule index de nition unit le store byte string intern structur data le support relat tupl object indic object relat tupl delet disk le space data le le header dynam storag area block data store le header free space store pointer rst block dealloc heap space end le store pointer address byte le start heap store pointer start dynam storag area block block mark delet left le size le determin block alloc remain matter block delet delet block maintain list block list point block list start speci ed address pointer le header store le address block free space list start dynam data area start empti grow variabl data block alloc pointer le header maintain dynam data area pointer mark end le point locat le extend block alloc alloc block free space list le address block pointer object relat tupl file address repres sign integ valu le grow maximum size gb file address translat exact memori address access memori storag manag charg address map translat le address memori address make ecient adopt techniqu similar call set associ map relat class bu er space fact bu er space lot memori hold memori slot manag manag space occupi entiti request applic mean object relat tupl main memori address return applic request storag manag emploi lru algorithm drop object relat tupl long load memori case block drop chang bu er manag physic delet block store disk format object page bu er similar disk format kernel brie describ ddl index manag kernel queri manag queri manag data retriev rule evalu pertain fact store ned rule rstly translat queri intern optim base condit queri process di erent evalu strategi evalu rule rule rewrit techniqu result discuss queri evalu detail section dml manag dml manag perform updat relat object object relat tupl dml rst invok ddl manag queri schema de nition check respect schema de nition object relat tupl insert successfulli object relat tupl dml rst check referenc reject request modi cation object relat tupl handl similarli updat impli queri dml manag invok queri manag process queri perform updat relat object request queri manag propag updat materi relat object depend updat ddl manag ddl manag process ddl maintain system le class relat rule handl rule queri call dml queri manag inform ddl manag drop materi inform rule request index manag index manag maintain indic relat object hash indic tempor chosen ecient system object identi er kei primari kei kei index indic resid memori disk de ning maintain kei relat store index le hash indic appli memori tempor di erenti relat evalu temporarili creat view queri evalu queri manag data retriev rule evalu pertain fact store data le de ned rule rule system le combin queri process method rol relationlog support evalu match evalu rule order rule rewrit techniqu match inform deriv rule maintain system main memori memori space permit made persist maintain current system user queri concern inform main queri result immedi disk oper user queri concern inform store indic requir inform match evalu queri result person evalu strategi evalu rule main queri process deduct system user queri concern inform main memori queri gener method strategi strategi evalu queri result children famili rule rewrit techniqu user queri comput inform relev queri rule rewrit techniqu simul evalu push select occur approach perform rival ecienc techniqu rule rewrit techniqu evalu queri result person queri result famili discuss design implement deduct system main featur natur support persist class relat pure objectori object relat support complet implement paper develop unix environ system internet debug improv inform system found web site extend edg system develop interfac extend relat algebra calculu top order make tool research teach acknowledg author natur scienc engin research council canada research equip grant liu graduat studi research regina scholarship li refer abiteboul grumbach languag complex object acm tran abiteboul kanellaki object ident queri languag journal stein gemston object manag system commun zicari integr objectori data model program paradigm acm sigmod intern confer manag page chen chu logic program languag deduct jm intern confer deduct page zaniolo ldl system prototyp ieee transact knowledg data deux stori ieee transact knowledg data shan manag system acm tran oc inform jamil implement abstract object inherit datalog neg intern confer larg data page morgan kaufmann wu logic foundat languag journal kifer wu logic program complex object comput system kuper logic program set comput system objectstor system commun ling lee deduct system intern confer expert system applic page springerverlag lnc liu deduct object base languag inform liu type extens datalog set tupl journal logic liu deduct problem solut acm comput liu deduct object languag workshop gener inform technolog system page juli lnc liu queri process relationlog intern confer expert system applic page august lnc liu design implement rol system journal intellig inform liu shan design implement relationlog deduct system intern workshop expert system applic workshop page august press maier logic object technic report oregon graduat seshadri coral deduct system vldb paton deduct survei intern workshop rule system page lnc overview commerci manag sigmod
ML/420 6 knowledg content case memori system griffith bridg depart comput york uk decemb abstract discuss reason reflect implicit assumpt case memori system case ad paper consid content preliminari analysi perform reason system interest model learn aspect reason order studi perform reason system experi current paper present semant recent classif paper explor issu assur illustr knowledg content case memori system resid chosen similar measur case introduct engin system involv set error bound perform system case system accumul experi enhanc perform system preliminari activ state formal knowledg content system system guid oper knowledg knowledg consist compar suitabl aspect oper case memori system discuss attempt describ knowledg content logic point term logic proposit deriv case memori system present necessarili logic order captur set proposit entail case ad approach explic knowledg content demonstr applic engin issu address contrast view adopt function knowledg content case memori model map input output domain function viewpoint work harrison engin user interfac case memori system relev assum learn theori theoret studi learn system model current state learner function adjust accommod data present system make progress studi learn algorithm framework semant gener case case memori system intend map input domain output domain finit set terminolog harrison refer element knowledg content case memori system embodi map domain problem statement space partial order case gener view oper case memori system discuss interfac properti system opt simpler assum descript ffl report ffl system ideal behaviour system function map set assumpt common form learn context map call function notion singl output describ oper system advantag straightforward definit error system role similar measur system demonstr work jantk case memori system model pair oei consist cb similar measur oe set pair cb object cb current assum case free observ target function ffl ffl ffl ffl cb statement cb cb partial function task case memori system interpol partial function repres system repres total function return report descript present system model oei interpol made system depend choic similar measur model similar measur function pair descript return real indic similar oe problem descript ffl defin set nearest neighbour respect cb ffl ffl cb ffl cb essenc reason simpl case memori system return report case descript similar similar measur oe descript current problem order oei function map resolv question set nearest neighbour defin equat exemplar case justifi system output jantk offer suggest resolv case output system undefin case memori system interpret partial function ti resolv prefer order descript ti resolv prefer order report option undesir state affair perfectli good ground similar case option system equip addit domain knowledg nearest neighbour prefer descript report dictat output knowledg priori plausibl descript gener model prefer relat set report option pass moment princip knowledg potenti subsum similar measur defin function repres system oei fx ffl fx fg ffl partial order defin prefer pair report ffl read prefer maxima respect order defin fx ffl ffl semant equat interpret special case system classif illustr semant classif special case output domain concern task classif problem descript requir system output result classifi problem descript instanc concept work equat semant relat semant jantk lang ae po ffl cb neg ffl cb po neg point posit classifi store posit exemplar po strictli similar chosen similar measur oe store neg exemplar neg word interpret resolv equal similar neighbour prefer report call conserv classif strategi equat instanti equat prefer order equat requir discuss gener case partial order empti equat rang possibl case prefer report return equat descript empti solut admit equat long return maximum entir set report maximum defin set report nearest neighbour respect point input domain case function interpret oei undefin constrain oe return singl domain ffl set nearest neighbour respect oe upper bound maxim respect prefer order addit compar element nearest set constraint develop definit upper bound ffl upper bound poset wi iff member maxima wi compar element ffl ffl ffl lemma poset defin singl maximum iff upper bound assum maxima shown ffl upper bound equat ffl satisfi equat ffl ffl ffl equat distinct prefer prefer order equat appli prefer partial order defin acycl graph eventu path graph prefer order reach finit set transit ffl upper bound assum defin upper bound ffl ffl partial order definit admiss prefer relat prefer relat admiss respect similar measur oe function space iff domain ffl valid ffl cb defin upper bound set fx ffl corollari semant express equat prefer relat singl set nearest iff admiss prefer relat respect oe prefer relat similar measur share discrimin applic pictur inform content similar measur prefer relat inform prefer relat discrimin similar measur vice versa light proposit consid case extra show minimum constraint similar measur entail definit situat proposit ident relat admiss prefer relat respect measur oe space function iff function ffl domain valu ffl map similar return valu admiss prefer relat respect oe iff ffl ffl note ffl ffl singleton entail defin upper bound lemma iff jx shown equat hold oe domain function ffl cb problem instanc ffl nearest neighbour cb measur oe share common report equat ffl ffl cb ffl ffl ffl cb shown uniqu ffl ffl ffl ffl ffl ffl ffl distinct domain ffl ffl cb equat satisfi directli ffl cb shown exemplar prevent nearest neighbour equat ffl ffl cb exemplar ffl cb equat case equat addit equat equat exemplar satisfi equat satisfi circumst assum equat hold ffl cb distinct report satisfi equat respect ffl equat necessarili case admiss respect oe consist learn algorithm similar measur oe defin binari function space properti consist motiv minimum constraint similar measur consist learner train correctli reproduc exampl sampl optim domain consist desir properti exemplar system error free assum function repres defin finit consist suffici train exampl system eventu converg good approxim target function ch hold worst case system make suitabl exampl consist properti learn state explicitli learn algorithm famili simplest algorithm defin definit learn algorithm classifi set cb set cb cb set simpl algorithm learn ad member train sampl seri exampl target function approxim target function defin term singl fix similar measur oe simplest wai ensur consist learn algorithm constrain oe system retriev train sampl exemplar present queri definit relat intuit suffici ensur consist claim prove proof theorem assum semant previou section instanti admiss prefer relat definit predict similar measur respect function space prefer order similar measur predict function space iff function ffl pair problem instanc ffl similar exce similar ffl ffl pair problem instanc ffl similar equal equal prefer relat ffl ffl theorem consist space function consist learn algorithm chosen similar measur oe predict suffici assum similar measur oe predict satisfi equat train denot member nn nn definit member cb nn case inequ strict nn nearest neighbour equat whichev exemplar upper bound prefer relat case consist learn algorithm assum nn equat nn nn nearest neighbour st nn nn upper bound requir definit prefer nearest neighbour st nn exemplar necessarili nn includ case nn nn element train algorithm consist necess assum equat hold function ffl pair domain valu train sampl produc hypothesi oei st inconsist hypothesi assum altern equat hold st hypothesi oei produc train sampl equal similar prefer prefer inconsist hypothesi simpl concept learn illustr result refer special case classif system prove version theorem term definit predict classif ffl ffl ffl ffl result special case corollari gener framework present corollari consist classifi consist learn algorithm space classif function iff similar measur oe predict definit equat equat ffl ffl dn ffl ffl dn theorem consist learn algorithm iff equat satisfi shown similar measur oe satisfi iff equat satisfi assum st inequ strict similar equal case strict equat similar equat assum st equat immedi assum st ffl equat final assum st ffl st give contradict paper attempt answer question knowledg content case memori system present view case memori system interpret semant function approxim ideal map input output result present explor gener accept function classifi gener class system gener output arbitrari set output valu paper suffici condit semant consist learn algorithm framework function view knowledg content number notabl error case memori knowledg quantifi straightforwardli compat assumpt comput learn appeal gener result machin learn find progress understand analyt learn behaviour reason system present insight wess globig knowledg content case memori system rest similar measur store case futur work attempt make framework model reason system suitabl simpl instanc design task hope make progress understand natur sourc error oper case memori develop insight claim perform reason system state proven acknowledg author fund epsrc grant receiv addit support case award scheme logica cambridg refer albert learn algorithm machin anthoni comput learn theori cambridg harrison engin case memori system submit journal intellig inform system griffith bridg concept space hypothesi space learn algorithm submit eighth european confer machin learn www jantk learn induct infer acm comput learn juli page acm jantk lang learn pattern languag work note european workshop volum page chase knowledg reason default except brachman intern confer principl knowledg page morgan retriev reason prefer nonmonoton induct logic intern page springer wess globig symbol classif algorithm case studi version space topic european workshop novemb lnc page
DB/421 3 seri classif boost interv base liter carlo alonso juan de sistema departamento de informática universidad de abstract classif method tempor present base boost simpl liter bodi background predic base tempor interv type predic rel region oper region variabl experi data obtain uci show method highli competit previou approach time seri interv base machin learn introduct multivari time seri classif domain signal continu system diagnosi data mine tempor problem tackl extract featur seri kind convent machin learn method approach drawback preprocess techniqu ad hoc domain heurist applic tempor domain difficult captur preprocess descript obtain featur hard understand design specif machin learn method induct time seri classifi work support spanish project tap de artifici pp construct classifi effici learn multivari time seri input consist set train exampl class form time seri seri refer vari time machin learn point point seri attribut method learn time seri classifi work base liter tempor interv boost method gener ensembl rest paper organ section introduct suit method base classifi section includ techniqu effici handl special predic section present result method give conclud remark section boost activ research topic ensembl classifi obtain gener combin base construct machin learn method target ensembl accuraci respect base classifi popular method creat ensembl boost famili adaboost promin member work assign weight exampl weight iter base classifi distribut weight weight depend correct class assign base classifi final result obtain weight vote base classifi inspir good result work ensembl simpl classifi studi base classifi consist liter bodi multiclass problem method extend adaboost multiclass case weak learner handl binari label data requir weak learner handl data high accuraci kei idea round boost select subset set train binari weak learner exampl label posit neg depend origin label subset concret base learner search rule predic mean class list figur show fragment classifi classif obtain weight vote result weak classifi true weight label list weight weight label list increment label highest weight assign base classifi tempor predic figur show classif predic point base predic point point point true variabl point region note learner predic learn algorithm predic introduc test result obtain boost interv base predic kind interv predic rel region base rel predic differ valu interv region base predic base presenc valu variabl region interv rel predic natur describ seri stai predic deal differ valu variabl end begin greater equal scienc true read true true mine true man true figur initi fragment ensembl obtain dataset number posit neg cover exampl weight classifi rang valu variabl interv equal seri noisi strict definit relat hold point filter seri prior learn system time seri classif reli assumpt data clean predic opt extrem interv paramet indic amount chang predic stai strict definit case point interv consid paramet maximum differ valu interv region base predic select definit predic base visual rule languag dynam system introduc predic end variabl region interv begin end end true percentag percentag time begin end variabl region greater equal percentag decid work tempor definit predic due fact extens conjunct disjunct interv demand true percentag addit paramet flexibl region region previou predic interv domain valu variabl case definit region obtain background knowledg obtain discret obtain consecut interv region consid interv form union interv equal reason fix region classifi obtain effici liter easier understand region fix overlap search liter base learner receiv set label posit neg mission find liter discrimin posit neg exampl search space liter liter consid posit neg exampl true number seri point region tempor predic stai base region true percentag object reduc search window explor size power consid number window interv predic evalu extrem interv consid interv predic time number point interv search liter consid calcul exampl class true simpl method interv interv evalu liter method relationship interv consid liter inform save posterior evalu liter interv width obtain previou evalu liter interv consecut width predic true percentag evalu valu length interv sum length interv region consecut interv length sum union interv length sum interv time calcul percentag interv threshold paramet percentag predic select select liter linear number number number region region base number interv lg addit cost select addit paramet figur classif predic predic paramet percentag true linear number valu valid dataset characterist dataset summar tabl dataset classif time seri easi find reason artifici dataset bell funnel artifici introduc learn task distinguish cylind bell funnel exampl gener χ χ χ χ class exampl point variabl control chart waveform wave tabl characterist dataset cylind bell funnel control chart normal upward cyclic downward waveform figur exampl dataset exampl class shown graph η obtain standard normal distribut integ obtain uniform distribut integ obtain uniform distribut exampl gener evalu function figur show exampl class control chart dataset class control synthet gener process time seri length defin rs random number rs rs gt rs gt rs kx time time rs kx figur show exampl class data obtain uci kdd archiv waveform dataset introduc distinguish defin evalu uniform variabl standard normal distribut figur show exampl class version uci ml repositori point region stai true percentag tabl predic set symbol predic predic includ wave dataset gener previou random point ad end varianc dataset uci ml repositori australian sign languag australian deaf commun instanc sign collect instrument glove wrist middl ring finger bend class exampl class number point variabl system support variabl length resampl point result result dataset obtain stratifi number region variabl valu consid paramet rel predic multipl rang variabl divid valu paramet percentag tabl show predic set tabl figur resum result highlight good evolut maximum error dataset number iter boost process tabl result obtain iter number iter method robust control wave wave figur graph result dataset control wave tabl result row show result set column show result number boost iter result row fit advantag interv predic uniqu except wave point base predic obtain worst result situat control dataset design specif test time seri involv situat compress situat present wave dataset result clear predic dataset rel predic adequ dataset region base adequ exampl addit complex true percentag justifi bell funnel publish dataset error except predic point obtain result region base reach set control chart previou result awar dataset similar queri classif check dataset test raw obtain averag error cross result rel predic result region predic result region base predic iter remark point result dataset great improv obtain combin predic set respect result obtain independ waveform error optim classifi dataset approxim dataset frequent test classifi test boost method combin raw work previou result awar dataset error result obtain tree base complex base classifi liter set interv base predic result obtain result region base predic iter result case overfit evid wave result obtain rel iter error optim classifi dataset dataset test boost variant tree result error appar approxim dataset highest number class variabl increment number iter result publish error greater result obtain region base predic shown tabl tempor seri classif system develop base boost simpl classifi individu classifi form liter bodi predic base interv kind interv predic rel region base rel predic differ valu interv region base predic presenc valu variabl region interv experi dataset show method highli competit previou approach data method achiev report result awar strength method base result point base predic show incorpor interv predic improv significantli obtain classifi interest featur method simplic user point method free number iter classifi obtain number iter includ obtain iter select initi fragment obtain classifi continu ad base classifi obtain classifi programm point view method simpl implement boost easiest classif method acknowledg maintain ml kdd uci repositori moham wale david aha robert donat wave control chart dataset refer robert yanni manolopoulo similar queri emploi approach confer carlo alonso juan graphic rule languag continu dynam system comput intellig control volum concurr system engin page io press eric bauer ron kohavi empir comparison vote classif boost variant machin stephen bai uci kdd dj clifford find pattern time dynam program approach um advanc knowledg discoveri data page aaai press cl blake cj merz uci repositori machin learn jh cj stone classif regress tree chapman publish wadsworth thoma dietterich comparison method construct ensembl random machin moham wale learn descript multivari time seri ivan bratko saso intern confer machin learn morgan learn classifi signal rs machin learn data page john wilei juan carlo alonso de seri viii de la para la novemb local featur extract applic librari base phd depart yale robert schapir output code boost multiclass learn problem intern confer machin learn page robert schapir introduct boost thoma intern joint confer artifici intellig page morgan
HCI/422 4 gestur synthesi time agent stefan artifici intellig group faculti technolog bielefeld germani contribut juli abstract synthesi lifelik gestur find grow attent interact synchron synthet gestur speech output goal embodi agent paradigm studi gestur interfac contribut present oper model enabl lifelik gestur anim articul figur render real time spatiotempor gestur knowledg base find product human model mean motion control drive kinemat skeleton figur freedom joint main bodi dof hand model conceiv enabl synchroni respect coordin gestur signal gener system previou context gestur recognit devic intuit input synthesi lifelik gestur find grow attent interfac research gener synthet gestur connect system goal embodi agent paradigm studi gestur interfac embodi agent charact demonstr similar properti human includ abil produc respond verbal nonverb commun repres comput interact human repres human user comput environ mission bielefeld ai lab interact virtual realiti environ natur thing import previou work incorpor gestur input modal virtual measur gestur articul hand bodi movement context interpret classifi featur transduc applic command symbol notat inherit sign time gestur context speech order establish correspond accent behavior speech gestur channel import aspect measur gestur identifi cue gestur effort part gestur indic screen signal electromagnet strong rapid movement strong hand symmetri gestur give figur show signal gener hand movement consecut point gestur develop varieti descript time atn transit record discret featur bodi refer system filter motion data object transform put effect scene thing learn investig issu advanc natur interact scene scenario virtual construct fig track hand movement consecut point gestur previou year dealt point turn gestur accompani commonli classifi deictic mimet project construct start research sophist form deictic includ featur indic shape lead icon gestur project begun year concern systemat studi referenti act gestur scenario set partner cooper construct model investig complex signal origin speech gestur refer goal elucid contribut gestur deixi make salient select object region goal make artifici commun understand produc gestur construct dialogu fig articul commun contribut focuss approach lifelik gestur articul virtual emphasi achiev tempor coordin extern inform signal gener system goal research concept figur conduct multimod dialogu human partner cooper construct task paper organ sketch previou work context carri turn issu lifelik gestur synthesi core issu recent work section describ detail articul commun focu section respect gestur stroke section give outlook start includ speech gestur synthesi lifelik gestur synthesi research lifelik gestur synthesi twofold seek understand biolog cognit factor commun abil gener approach gener learn model explan provid form simul imit natur extent synthesi lifelik gestur find grow attent interact realm type advanc applic gener synthet gestur connect system goal embodi agent equip virtual agent mean gener believ commun behavior import part product natur multimod utter lot progress made respect combin speech synthesi facial anim bring talk head core issu skelet anim articul synthet figur lifelik gestur synthesi resembl featur structur gestur movement synthet speech achiev time accent behavior gestur stroke basi synchron stress syllabl speech remain research challeng approach exist respect product synthet current system produc movement extent reli predefin motion sequenc system produc sign languag gestur explicit base limit set motion primit straight wave form combin complex gestur reproduc natur movement characterist figur adapt movement tempor kinemat properti requir gestur focu work fig gestur product rea max system rea system cassel implement embodi agent produc natur verbal nonverb output relat modal figur gestur anim behavior schedul motor primit execut rea gestur model emploi standard anim keyfram anim kinemat issu exact time spoken gestur utter target author state satisfactorili solv goal demonstr max system figur render lifelik gestur anim gestur knowledg incorpor mean motion control produc multipl kind gestur gestur parametr respect veloc profil durat shape properti emphasi issu produc accent part gestur stroke point time synchron extern event stress syllabl synthet speech detail section articul commun earlier work develop hierarch model plan gener lifelik gestur base find field relev product human gestur approach ground comput anim encapsul motion gener enabl abstract control structur higher level techniqu drive kinemat skeleton highli articul figur freedom joint main bodi dof hand figur turn suffici hand anim arm wrist driven motion gener run concurr synchron achiev high lifelik approach base control algorithm dynam simul optim criteria consid lead physic realist movement provid high level control due high comput cost applic start observ human arm movement commonli conceiv repres emploi singl path kinemat movement base make smooth arm gestur rel guid stroke model figur incorpor method repres spatiotempor gestur featur plan individu gestur biolog motiv techniqu format arm trajectori fundament idea plan gestur imag movement creat intern form arrang constraint repres mandatori spatial tempor featur gestur spatiotempor descript previou stage gestur locat refer deictic retriev common knowledg gestur hand shape point model gestur lexicon postul abstract descript gestur movement stroke inform usag transfer commun intent entri consid defin map commun function explicit movement descript gestur stroke gestur term postur featur movement phase occur gestur stroke featur defin independ symbol gestur notat system build determin individu gestur descript accommod entri uniqu refer specif valu content gestur quantit paramet deictic icon gestur time defin arrang constraint definit tree parallel sequenc node option nest mean defin parallel sequenti action provid origin version convent introduc anim model describ repetit symmetri gestur movement fig articul commun templat point gestur gestur templat shown figur concret syntax denot commun function point gestur refer locat indic point direct paramet finger point locat side point gestur stroke defin movement constraint describ target postur hand reach parallel basic shape index finger hand locat direct referenc extend finger orient referenc palm orient palm symbol figur ascii select symbol gestur descript section explain gestur templat instanti includ time constraint lead individu movement plan execut articul commun motor system movement movement plan plan gestur gestur translat translat motor motor variabl variabl execut execut motor motor command command fig main stage architectur gestur anim system time gestur gener model base varieti find gestur product perform human complex process commonli assum gestur movement deriv spatiotempor work memori cognit higher level transform pattern control signal execut motor system result gestur exhibit characterist shape kinemat properti enabl human distinguish subsidiari movement recogn gestur movement consid distinct movement phase form hierarch structur figur stroke effort part tightli coupl accompani yield tempor synchroni modal found index gestur part spoken stroke onset contrast stress syllabl speech covari time prerequisit figur outlin main stage gestur anim process architectur movement plan execut shown gestur plan stage movement plan imag movement creat previou arrang constraint repres mandatori spatial tempor featur gestur plan order list constraint separ transfer special arm motor control modul modul produc retract phase featur occur gestur phrase figur gestur unit period time success rest limb gestur phrase consist movement phase prepar stroke retract hold hold fig hierarch structur gestur movement briefli describ motor command put effect stage anim system movement control motor program execut arbitrari number local motor program simultan illustr bottom figur emploi suit motion gener method control set design period time arrang taxonomi share function basic oper coordin mean concaten order continu affect connect boundari start posit veloc movement phase creat motion arrang sequenc plan execut control predecessor pass success motor control modul creat prepar proper movement constraint concaten defin assign resp successor relationship complet pass control note defin featur left unspecifi affect complementari featur method account fluent gestur transit emerg activ subsequ gestur fulli retract time movement plan crucial part movement plan issu time individu phase gestur movement hand relev achiev high lifelik perform gestur gestur stroke time kei issu enabl synchroni respect coordin gestur signal gener system apex gestur stroke coordin peak prosod emphasi spoken output gestur planner form movement tree tempor order set movement retriev gestur specif adapt individu gestur qualifi tempor movement constraint accord extern time constraint movement plan modul hand arm motor system interpret varieti select respect defin intermedi target convert posit orient constraint respect egocentr frame gener movement follow trajectori movement constraint respect static dynam featur gestur stroke section comfort defin time constraint respect peak time featur incorpor gestur stroke movement plan gener specif movement constraint time constraint manner give movement figur show instanti gestur templat stroke phase pull gestur start open flat stretch palm end hand left palm dynam movement constraint arm hand initi target postur symbol descript time constraint instanti stroke perform period veloc peak close end period peak time stroke phase apex arm motion apex hand motion synchron carri parallel peak equal time due static movement palm orient remain full gestur stroke fig pull gestur instanti peak time prepar retract pull gestur suppli motor planner smooth transit hold automat gener result veloc profil pull gestur figur shown figur snapshot retract phase shown figur wide varieti point gestur peak icon gestur includ guid stroke outlin rectangular shape lab experi shown specif gestur realm amount minut put effect real time fig veloc profil pull gestur time peak fig stroke retract phase pull gestur gestur speech core issu work product synthet lifelik gestur symbol descript articul virtual figur natur motion time central aspect emphasi li achiev tempor coordin extern inform signal gener system model conceiv enabl natur integr account tempor synchroni work includ integr techniqu extract tempor constraint coordin gestur speech remark ongo work manag coordin gestur stroke formal gestur synthet speech output max agent bolt place time peak prosod max issu point gestur locat shape specif gestur automat deriv motor gestur peak time deriv paramet synthet speech signal combin modul transcript prosodi speech synthesi develop bonn core part consist lexicon roughli entri flexion tabl convert german text phonem word mark promin valu support subsequ gener prosod paramet produc linguist text input speech output gener german provid concaten speech base procedur achiev varieti alter inton speech pitch vari factor rang phone durat vari rang die zu der tag phonet initi plan extern command manipul speech phonet text fig bar outlin method pitch scale time tag addit inton command build method develop lab control varieti prosod function tt system pitch scale time scale markup base extens markup languag tag word syllabl speech tag text phonet text produc alter manipul meet time constraint extern command gener conjunct gestur plan procedur time stress syllabl synchron accent behavior speech gestur synthesi figur roughli outlin extend tt method lab explain face max agent anim concurr exhibit speech present approach lifelik gestur synthesi time work agent demonstr max system model conceiv enabl synchroni respect coordin gestur signal gener system method achiev time accent part gestur stroke basi synchron stress syllabl accompani speech futur work direct system link segment smooth multimod concurr format utter includ gestur rhythmic altern phase tension relax observ issu rhythm commun address wide kei idea earlier work synchron gestur speech hci input devic intend idea product mark grid accent element stress chunk mechan achiev natur tempo multimod output acknowledg research partial support deutsch forschungsgemeinschaft collabor research center artifici author indebt dirk provid scalabl tt master thesi member bielefeld ai group provid gener support wai refer churchil embodi agent cambridg mit jp product gestur speech mcneill languag gestur cambridg introduct synthesi kluwer academ publish approach lifelik gestur anim horn ecai european confer artifici io plan motion control lifelik refin approach comput anim ieee comput societi pp exploit distant point gestur object select virtual environ gestur sign languag interact springer util speech gestur realiz natur interact virtual environ annual confer ieee industri electron vol complet system specif gener sign languag gestur al intern gestur workshop mcneill hand gestur reveal thought chicago talk linguist cognit issu facial anim comput graphic june mix inventori structur german concaten synthesi workshop speech synthesi hen version hamburg notat system sign introductori volum intern studi sign languag commun deaf consortium synthesi markup languag bell sowa icon gestur object descript virtual empir studi submit confer mean april commun rhythm gestur speech al commun interact springer
HCI/423 4 ubiquit corba manuel denni fabio kon roi campbel comput scienc depart illinoi abstract popular ubiquit comput approach wireless connect enabl futur hundr heterogen devic interconnect achiev common task commun network enabl heterogen devic requir standard protocol defin interfac exist middlewar architectur offer standard mechan suitabl heterogen devic resourc requir middlewar solut exce comput limit heterogen devic present paper minimalist object request broker dynam reconfigur smallest memori introduct incom ubiquit comput trend exist collect devic attach peopl build ubiquit comput paradigm provid natur interact paradigm enabl servic main benefit ubiquit comput devic requir defin protocol heterogen devic standard export function offer devic task commun middlewar implement current commun middlewar implement built assum minimum set hardwar softwar requir suitabl desktop comput small ubiquit devic commun middlewar implement java corba big size fit devic limit resourc provid tool dynam reconfigur modifi architectur problem applic requir specif subset function forc link function case client program simpli invok method remot object requir client side function orb request client side static invoc interfac orb implement includ function singl librari tao provid separ librari client server option specif subset function present paper dynam configur orb bring benefit corba maintain small memori footprint kei properti dynam configur architectur dynam configur modifi architectur orb time function requir dynam behavior architectur orb orb collect exchang compon coordin skeleton compon configur design implement motiv lack corba implement small memori footprint dynam adapt requir applic approach design base simplic function requir size applic fraction corba function link fraction total size orb solut dynam configur orb modifi architectur accommod chang requir applic appli simplic principl interfac implement compon simpl defin interfac implement track depend critic aspect alter architectur orb adopt core essenti compon applic programm implement custom select collect polici orb packag specif implement low level function requir corba user implement custom compon top function complet implement corba orb core custom compon configur call configur configur provid glue consist combin compon result combin compon belong categori number compon interconnect defin size defin standard set categori extend function requir categori compon provid implement chang configur entri point orb function separ client function client configur attach configur configur knowledg requir decid compon safe remov applic function client server side exact client server function configur defin categori specif compon marshal cdr cdr writer iiop reader iiop connector invoc interfac current invoc interfac export simplifi dynam invoc api conform corba specif suffici devic function architectur configur similar configur connector invoc interfac replac acceptor object adapt test palmpilot run devic size palmpilot version requir case configur function capabl corba compliant test tao standard desktop orb control video camera pan palmpilot control powerpoint present run window nt hp refer dougla schmidt tao overview fabio kon roi campbel manag distribut ieee februari
ML/424 6 reason acquir user schedul prefer chang time katia zeng robot institut product engin carnegi mellon electr industri pa usa osaka japan abstract schedul typic involv acquisit user optim prefer problem space desir object make practic schedul problem difficult formal costli problem configur user optim prefer chang time paper advoc increment framework improv schedul qualiti incorpor user dynam chang prefer reason implement call record tradeoff consequ result schedul guid schedul improv preliminari result show cabin effect captur user static dynam prefer system exist implicitli manner case base introduct schedul deal alloc limit set resourc number activ difficult schedul problem class job shop schedul job shop task call order consist set activ schedul preset partial order reflect constraint capac constraint restrict number activ assign resourc overlap time interv activ constraint task date due date determin set accept start time activ goal schedul system produc schedul satisfi tempor relat resourc capac constrain schedul system optim result schedul base set minim weight minim inventori cost maxim resourc paper eleventh ieee confer artifici intellig applic schedul problem difficult solv number reason problem schedul object typic user minim weight tardi meet due date diminish inventori cost type combin object perfectli reflect user user combin weight tardi object form tardi make tardi user addit form relationship exist object tardi user schedul prefer chang time due tight interact schedul constraint conflict natur optim imposs evalu impact singl schedul local action global satisfact optim criteria realworld schedul practic involv quantit qualit constraint prefer subject judgement find wai incorpor build schedul conflict object prefer bia optim procedur adapt real challeng research schedul domain thesi learn reason captur user optim prefer chang time complex job shop util chang user prefer control knowledg guid solut optim approach effect optim task varieti reason tradit search oper combinatori explicit optim object defin advanc problem solv practic schedul optim criteria involv tradeoff imposs repres explicit static optim function user prefer depend partial result obtain problem solv difficult user complet defin prefer advanc problem solv number dimens altern involv make larg prevent user give gener applic prefer evalu expert system potenti captur tradeoff requir knowledg acquisit effort dealt optim concern equal import fact problem solv environ prefer user chang time approach captur prefer static requir updat extrem limit approach acquir knowledg continu interact user util machin learn techniqu adapt behavior chang user prefer problem solv context implement iter approach cabin system demonstr capabl acquir user contextdepend dynam chang optim prefer job shop schedul domain work report extend previou work cabin system test hypothesi increment methodolog show good potenti captur user prefer domain chang time control knowledg solut improv preliminari shown section confirm hypothesi learn reason captur user prefer activ area system support system research problem varieti applic offic electron secretari portfolio select digit circuit design product schedul domain autom acquisit user prefer import practic reason domain product object system typic explicitli tremend amount knowledg acquisit effort elicit practic environ matter success depend larg extent capabl acquir user prefer extract user object prefer system built theoret feasibl inform user high cost typic knowledg extract acquisit prevent practic capabl captur learn user prefer interact user system routin oper highli desir world chang develop knowledg acquisit techniqu reflect chang prefer evalu criteria system incap handl chang world fragil easi fail research machin learn opportun possibl system acquir knowledg suffer knowledg acquisit bottleneck learn paradigm deal captur prefer learn algorithm successfulli appli captur user prefer mundan meet schedul domain gener extens learn report effect digit circuit design task induct learn algorithm base chose case base reason paradigm captur user optim prefer chang time job shop schedul domain cbr problem solv paradigm previou experi guid problem solv cbr learn integr part case base problem solv reason success deal except data acquir user knowledg complex domain expend effort knowledg acquisit compar knowledg acquisit system cbr present advantag framework knowledg acquisit rule induct requir great comput effort updat rule base gener rule maintain consist acquir rule comput overhead problem allevi cbr inher increment properti reason cbr problem encount case base increment updat reason consist mainten calcul case match retriev effici memori organ effect rule learn induct understand user underli learn algorithm base statist characterist collect case relev user understand problem base system case understand embodi concret experi user interact rule contextu inform underli instanc thrown contextu inform potenti user understand system reason cbr contextu inform cabin ing system current knowledg acquisit requir causal explan expert teacher acquir domain knowledg approach user program assum possess causal domain knowledg matter domain job shop imposs causal knowledg user li abil perform consist evalu result problem solv impart program case problem solv experi histori evalu tradeoff cabin store categori concept reflect user heurist local optim action combin tradeoff result applic local optim action constitut outcom accept unaccept user concept type record case base cabin guid iter optim search infer optim tradeoff evalu current solut user optim prefer explicitli repres case featur term cost function implicitli repres case base user optim prefer user prefer influenc wai reflect system level abstract identifi type constraint procedur object relat posit neg consequ altern maker maxim minim multipl object structur complic analyt simpl combin object express reflect intent evalu criteria user constraint consist condit object optim essenti defin limit space accept outcom constraint practic turn number potenti make problem solv problem solver decid constraint relax order procedur prefer sequenc order optim set outcom make user prefer chang case applic domain wont occur rapidli drastic assum prefer chang expect user rapidli shift maxim object minim problem solv context chang drastic problem solv horizon main reason made assumpt expect inform current base previou problem solv experi relev current futur problem knowledg base previou experi bit problem solv context user prefer chang drastic problem solv knowledg base rebuilt anew time chang mean acquir data date irrelev handl wai recent case basi futur assign higher weight tempor closer case remot case similar calcul cbr exact problem solv paradigm perform partial difficult determin reason base roll time window approxim constant number recent case effect reflect user chang prefer order make idea time window oper implement point time window size determin exist obviou term window size window system respond user prefer time window case adequ cover problem space reliabl provid advic gener wai address system design tradeoff answer domain task make gener observ domain simpl causal size time window small bigger time window domain overview cabin cabin approach schedul complet suboptim schedul gener dispatch heurist schedul increment call repair tactic cabin repair call focal activ repair mean move activ place schedul result constraint violat turn resolv due tight constraint job shop constraint violat rippl schedul find activ cabin identifi job repair initi call focal job activ focal job repair sequenc start earliest current schedul cabin start empti case base activ repair cabin interact user gather relev inform includ suggest local repair action evalu repair result explan user evalu repair result unaccept case cabin describ applic repair action focal activ user evalu result repair attempt select repair tactic repair focal activ attempt anew repair tactic unsuccess repair focal user repair activ number case collect case base cabin ffl knowledg acquisit interact mode acquir user prefer gener case base interact user ffl interact mode acquir case base incorpor user prefer suggest action evalu outcom user accept suggest overrid suggest ffl automat mode acquir user prefer guid schedul interact user automat schedul automat gener increment repair repair cabin retriev similar case appli repair tactic evalu result case acquisit incomplet domain knowledg schedul problem schedul suboptim schedul improv schedul train data test data evalu criteria contextu domain knowledg repair tactic featur valu evalu result explain failur select repair action figur cabin architectur architectur cabin depict figur cabin consist initi schedul interact schedul repair modul autom schedul repair modul case content case shown figur global featur give abstract potenti repair flexibl lack thereof schedul focal activ local featur identifi potenti predict effect appli repair tactic detail case refer global featur weight tardi resourc util averag resourc util deviat salienc salienc salienc local featur salienc salienc salienc salienc salienc salienc salienc salienc salienc repair histori tactic outcom effect salienc salienc type salienc figur cabin case order bound rippl effect repair tactic bound time time interv end activ focal activ focal job end focal activ cabin repair tactic exampl repair tactic move focal activ resourc left repair time minim amount capac creat move swap focal activ activ resourc repair time horizon amount constraint violat repair histori repres sequenc applic success repair repair outcom repair effect repair effect valu describ impact applic repair action schedul object weight repair outcom evalu assign user set effect repair action typic user optim reflect evalu repair outcom outcom user accept tradeoff involv set effect current applic repair action effect salienc figur assign outcom effect repair outcom case retriev case cabin repair schedul user interact cabin repair schedul recogn schedul find tardi focal activ repair repair invok cbr global local featur indic decid repair tactic focal invok cbr repair effect featur indic evalu repair repair result evalu cbr decid give repair tactic case retriev cabin variat neighbor method detail formula similar evalu captur chang prefer extens experi conduct cabin shown cabin capabl captur static user optim prefer guid solut qualiti robust improv solut qualiti independ method initi solut produc high qualiti solut report preliminari result set experi aim test increment modif methodolog effect captur user prefer chang time reflect select schedul repair action evalu repair consequ hypothesi difficult verifi due dynam natur user prefer order evalu result built reason optim function repair process optim schedul repair effect calcul repair outcom evalu base optim criteria gener case base cabin exact object function work emul human repair schedul make consist evalu repair result note object user cabin implicitli reflect incorpor explicit object reflect case base baselin evalu schedul gener cabin evalu approach suit job shop schedul problem number bottleneck rang due date activ durat vari cover rang job shop schedul problem instanc rang paramet control distribut job due date static due date date remain constant problem moder due date date vari problem varianc dynam variabl date big bottleneck paramet control number bottleneck machin group problem gener random assign resourc execut durat activ schedul problem instanc gener result total problem instanc problem job machin activ job job linear rout activ execut substitut machin bottleneck substitut method evalu perform cabin problem set group divid half train sampl repair gather case case repair valid problem repeat process interchang train valid set report result valid problem set design group problem step problem randomli chosen problem repair tardi optim criterion main reason creation initi size time window case approxim fix didnt construct initi number case cabin repair subset valid problem roughli half number case cabin subset valid problem instanc remain problem divid subset train sampl repair gather subset serv valid problem set repair cabin order simul dynam prefer randomli divid problem instanc subset individu problem instanc assign object function tabl succinctli show design weight tardi evalu criterion arbitrari object satisfi assumpt smooth prefer accept obj tardi obj tardi obj tardi obj tardi obj tabl notat object assign obj subset schedul problem instanc order view reason simul tempor transit user prefer obtain result satisfi object specif assign object function subset problem instanc shown denot subset problem design repair gather case repair cabin subscript refer subset problem problem object function evalu solut qualiti problem obj experi knew object function problem set knew simul human schedul object function perform consist cabin didnt object explicitli implicitli case base simplifi denot problem instanc initi chose repair collect initi process solv problem collect case case serv problem solv experi object obj denot case gather step case solv problem accumul case base criterion obj case stand case collect step solv problem cabin step consist case includ case case collect case solv problem base object function obj case denot case solv problem cabin case case case util solv manner experi accumul case base problem solv experi case gather denot case solv cabin base case case case result present tabl show averag cabin perform group problem obj weight weight tar ment ment obj obj obj obj obj tabl qualiti improv prefer chang observ cabin capabl automat dynam adjust control knowledg user prefer reflect implicitli user gave import minim cabin faithfulli echo chang term effort tardi thing happen user interest reduc conduct set sequenc step initi experi shuffl solv base case case case investig quantit import smooth assumpt prefer chang advoc framework base case base reason knowledg acquisit control knowledg guid iter schedul optim capabl acquir user optim prefer import domain typic complet set explicitli express object constraint gener framework advoc appli addit domain schedul cabin framework allevi knowledg acquisit bottleneck result show potenti approach captur user optim prefer explicitli system result cabin reflect trend cabin implement experi conduct unix workstat smooth transit user chang optim prefer schedul produc cabin acquir prefer routin system real oper environ refer kr baker introduct sequenc schedul rai bareiss knowledg acquisit unifi approach concept learn academ jm bradshaw jh analysi techniqu knowledg combin inform prefer intern journal ar acquir implicit knowledg complex domain expert system editor nearest neighbor nn pattern classif techniqu ieee comput societi lo lisa john tom david person learn tenth nation confer artifici intellig simon french sequenc introduct mathemat elli kristian hammond plan view plan memori task academ kolodn reason morgan kaufmann jk hs sc chu intellig stock portfolio manag system expert april lm dv sj brown reason solut problem redund engin larg scale manufactur intern journal expert tm pv tadep approach knowledg acquisit artifici schedul knowledg miss link ifip work confer knowledg base product manag learn vlsi design ninth intern joint confer lo ijcai tom rich dayn john david experi learn person assist commun juli katia sycara learn control knowledg case schedul problem katia sycara framework knowledg acquisit iter schedul improv reactiv repair artifici develop manag expert proven techniqu busi industri ps critiqu model flexibl constraint evalu schedul workbench intern confer industri engin applic artifici intellig expert june cr editor modern heurist techniqu combinatori problem rich knight artifici intellig david denni kibler learn episod optim machin learn ninth intern workshop page js miller applic cbr desk applic reason page sycara resolv adversari approach integr analyt method phd school inform comput scienc georgia institut katia sycara acquisit user prefer solut improv domain august aaai zeng combin machin learn techniqu predict reactiv schedul graduat school industri summer carnegi mellon
Agents/425 1 adapt agent achiev toler persist broker team kumar dept comput scienc oregon graduat institut nw walker usa philip cohen dept comput scienc oregon graduat institut nw walker usa abstract broker system locat rout share manag legal independ parti system render broker inaccess due failur machin network process failur occur distribut softwar system theori teamwork creat robust broker architectur recov broker present adapt agent architectur show feasibl approach aaa broker form team joint commit serv agent regist broker team long agent remain regist team commit enabl broker substitut multiag system base aaa continu work broker failur long function broker system team commit enabl broker start broker recruit broker team system maintain number function broker system broker effect system teamwork explain term theori joint intent previou theori assum team member remain team long team exist extend theori joint intent dynam persist broker team member chang time introduc notion joint commit team individu commit team entiti member constitut team present logic analysi aaa show aaa broker requir individu commit result robust behavior broker act ration keyword hector levesqu dept comput scienc toronto canada teamwork system middl agent research support darpa program contract introduct system prone failur occur distribut softwar system bug improperli handl except agent program support machin network numer hardwar softwar fault make agent unavail suddenli unforeseen period tradit distribut system literatur techniqu recov failur shown techniqu meant specif failur situat requir special infrastructur support techniqu hot backup object group replic virtual synchroni vote specif mechan commun synchron replica techniqu system extens modif underli agent infrastructur techniqu base system concept amen implement ad plan plan librari gener agent note earlier work teamwork shown agent team robust collect agent face unforeseen situat reason robust behavior exhibit team member team commit success portion joint action success team team recov problem abandon joint goal mutual believ team member goal longer discuss motiv investig exploit teamwork achiev system requir broker middl agent accept locat capabl rout request share manag regist agent facilit task advent electron middl agent increasingli import legal independ parti broker system brittl facilit singl point failur experi quickset system base facilit open agent architectur reinforc agent architectur recov quickli broker failur theori teamwork recov broker system failur due sudden broker unavail present adapt agent architectur robust broker show feasibl approach aaa teamwork recov system broker maintain minimum number function broker system broker inaccess perform characterist teamwork present paper concern logic recoveri techniqu relat teamwork theori applic aaa departur previou theori team exist independ ident member york team player trade term facilit interchang work paper extend middl agent sold owner earlier work team term joint commit individu team introduc notion team commit agent involv commit team entiti individu constitut team concept team commit establish commit lead robust behavior system section discuss theori relat teamwork wai implement team softwar agent adapt agent architectur introduc logic discuss section walk scenario system recov broker explain commit step lead recoveri section present definit team commit relat concept show logic establish commit follow team commit discuss relat work futur work section conclud section summari result teamwork team collect individu work close cooper achiev common goal agent team share goal share mental state absenc characterist impli lack team irrespect agent common coordin mutual oper team agent indistinguish collect agent coordin extern forc thing benefit teamwork appar team member work overcom condit abandon team team activ explain term theori joint intent theori behavior team term intern state modal linear time tempor dynam logic action theori teamwork joint persist goal formal notion joint commit exist jpg group agent suffici condit format team respect jpg jpg prevent team fall wake privat belief team member requir agent abandon team mutual belief feasibl irrelev jointli commit goal agent joint intent action jpg mental state joint intent requir start mutual belief team member jointli intend action joint intent bring mental state agent mutual mutual mutual irrelev section introduc persist team concept team persist goal team intent similar jpg ji commit involv team entiti individu constitut team teamwork intuit expect team robust simpl collect individu earlier work system teamwork shown agent team robust collect agent face unforeseen situat reason robust behavior exhibit team member team commit success portion joint action success joint action team member achiev jointli commit goal team member team member achiev jointli commit goal team recov problem abandon joint goal mutual believ team member goal longer conclud team inher team agent successfulli recov failur sudden unavail teammat capabl task unavail agent altern method jointli execut team member achiev joint goal system observ larg system typic middl agent middl agent substitut middl agent form team joint substitut middl agent unavail system continu work long middl agent remain broker team definit joint commit team commit captur essenc team behavior impli requir individu commit individu commit impart expect behavior individu team member ultim act behalf team realiz simpli commit suffici achiev team member mean honor commit teamwork process distribut coordin protocol prescrib desir end result step distribut interact agent agent decid ration action order achiev end ultim goal entir interact achiev end result intermedi step complet path achiev interact protocol includ step situat thing wrong turn result behavior implement team softwar group softwar agent form normal team respect goal establish joint commit respect goal agent form persist team establish team commit respect goal note team persist respect chang team membership goal order team persist complet main team goal mainten goal implement team softwar requir establish initi mutual belief lead joint ensur requir individu commit follow joint provid support action enabl individu commit honor gener meet requir plan engin reason modal tempor dynam action logic action approach implement team agent program explicit model oper repres construct joint intent form team approach agent programm implicit incorpor belief behavior requir jpg format agent program semant agent program interact agent lead format proper execut requir joint commit variat approach establish logic individu commit follow joint commit decid ration action agent softwar design specif agent program method implement broker team aaa adapt agent architectur aaa facilit system architectur develop form basi research agent commun languag open agent architectur system quickset place heavi demand commun provid accept real time overview aaa agent infrastructur build broker system aaa agent librari develop java agent shell develop aaa agent librari facilit agent serv matchmak recruit refer aaa facilit aaa broker aaa broker interconnect form arbitrari network agent librari support facilit direct commun aaa agent capabl address connect broker registr network transport tcp mechan timeout detect connect failur broker agent dynam enter leav system aaa broker form team share knowledg connect team member logic aaa broker form persist broker call regist broker team establish team intent perform concurr action aaa design implement specif teamwork team intent action argu observ behavior system consequ design aaa mission agent regist broker broker team intent connect long remain regist broker team aaa broker team mainten goal broker team time team format mainten goal result achiev express term broker broker team broker team mutual believ number broker team number act ration team intent recruit broker broker team design aaa broker satisfi result specif state proposit proposit escap condit result mainten goal logic properti establish commit broker team commit result fault toler behavior broker act ration action honor commit deriv mission statement requir broker broker team locat connect strand agent connect broker teammat longer access agent function broker access broker broker serv suddenli unavail proposit requir broker team number broker team broker failur broker team achiev broker possibl recruit broker team aaa agent capabl spawn addit broker request broker serv end result broker start machin network system continu function smoothli state theorem follow proposit commit aaa broker team show prove theorem section theorem agent regist broker commit make fact mutual believ broker team theorem agent unregist broker commit make fact mutual believ broker team theorem broker discov agent regist team commit make fact mutual believ theorem agent regist broker team broker team commit connect agent theorem agent regist broker team broker broker team individu commit connect agent theorem broker successfulli connect agent regist broker team commit bring mutual belief fact theorem broker commit disconnect agent reconnect learn agent reconnect broker commit connect agent theorem broker believ broker team number individu commit requir number broker broker team theorem broker successfulli recruit broker broker individu commit make fact mutual believ broker team theorem explain recoveri process broker system inaccess recoveri scenario figur illustr system broker agent client agent period send request distanc agent capabl agent broker form robust team mission statement proposit system function client distanc agent regist broker system broker time client agent figur distanc agent theorem broker individu commit bring mutual belief agent regist broker client agent regist inform fact address distanc agent distanc agent regist inform fact kill broker teammat longer broker agent regist broker disconnect remain discov longer access believ distanc agent connect broker team theorem broker individu commit bring mutual belief discoveri commun predict place broker team theorem broker team joint commit connect agent mutual believ disconnect team theorem remain broker individu commit contact disconnect agent broker act ration attempt contact distanc agent address earlier distanc agent accept registr request subsequ registr request broker figur illustr situat successfulli contact distanc agent client agent figur distanc agent theorem individu commit inform success connect distanc agent teammat act ration commun inform theorem give attempt contact distanc agent mutual goal achiev theorem inform registr address inform distanc agent current aaa commun attempt combin messag request distanc agent inform capabl successfulli contact pend request client agent complet due failur distanc agent system continu work recal broker team mainten goal broker system surviv broker discov longer commit bring mutual belief fact commun place surviv broker theorem surviv broker individu commit recruit broker team agent client spawn broker request broker contact broker request start theorem predict individu commit bring mutual belief broker team requir number broker commun place broker section commun requir commit team membership definit weak team goal end configur similar figur restor system recov broker failur persist team team real world team team goal persist team continu exist team member chang persist team desir perspect agent fail gener replac agent recoveri process earlier section team formal defin term joint persist goal team member mb appar definit jpg invalid team member leav team individu commit impli jpg drop imposs establish mutual belief introduc notion joint commit team individu constitut team commit member team chang team continu exist long current member share team goal requir mental state team commit special notat repres proposit refer group member satisfi properti formula free variabl call predic α formula denot formula defin α α α π redefin altern mutual belief concept group individu definit group τ group altern belief level group believ group believ group believ depth definit τ variabl innermost formula clarifi bind free variabl quantifi group member group mutual belief believ group mutual belief believ believ believ believ level denot weak mutual goal definit τ τ group τ mutual believ member group group mutual belief definit τ τ group τ group mutual goal group mutual believ group individu goal definit τ τ team special group constraint member team τ weak team goal respect team condit team member believ goal individu goal eventu bring believ goal imposs irrelev individu goal bring group mutual belief believ group exist member longer group individu goal bring group mutual belief definit τ τ τ τ τ py τ py singleton event team τ weak team mutual goal team mutual believ team weak team goal definit τ τ τ team τ team persist goal condit team mutual believ goal achiev team mutual goal achiev goal team weak team goal team mutual belief feasibl irrelev definit τ τ τ τ τ τ τ team jointli intend action team commit action believ team action definit τ τ τ τ τ joint commit joint intent defin respect team entiti individu constitut team team team commit continu long mutual belief imposs irrelev team goal team member leav member join team obviou definit ti teamwork requir establish mutual belief group agent stage shown send acknowledg prior inform believ bring mutual belief agent default group commun mechan broadcast acknowledg establish mutual belief group default formal establish theorem state section commit aaa broker state properti implement establish theorem proposit agent connect broker team connect member broker team proposit agent regist broker team regist member broker team proposit agent unregist broker team unregist member broker team proposit broker teammat longer access believ agent regist broker disconnect team ti commit action believ team action note circular data structur enabl compact mutual belief theorem section follow aaa mission statement proposit give detail proof main theorem prove similar approach directli follow basic theorem commit team commit connect disconnect agent aaa mission statement theorem state agent regist broker team broker team team commit connect agent escap condit show consequ aaa mission statement expand mission statement definit ξ γ denot previou iter denot remain iter substitut action ξ interest iter true action subsequ similar line reason theorem establish note theorem hold team membership chang initi action subsequ theorem action ξ χ χ assum broker successfulli act ration commit theorem assum present member broker team action action start broker team team commit respect team commit χ prove desir result agent regist broker team broker team team commit connect agent remain theorem section establish similar approach theorem theorem follow proposit theorem consequ aaa mission statement show team form joint commit exist team member chang introduc notion team commit team form exist independ team member show main theorem team commit aaa mission statement theorem prove establish aaa consequ teamwork specif aaa built satisfi relat futur work jen teamwork cooper problem solv shown team wast fewer resourc robust agent work explicitli address problem recoveri failur concern paper tamb kaminka teamwork model failur diagnosi recoveri achiev cooper behavior team helicopt unpredict environ helicopt team persist helicopt shot origin joint persist goal exist situat lead undesir behavior surviv team member drop individu goal imposs establish mutual belief helicopt shot klein approach make teamwork theori work extern sentinel monitor progress problemat initi recoveri action problem solv agent particip process approach essenti central approach base teamwork theori decentr tamb zhang notion persist team problem optim goal persist team point formal explain mainten team ident face chang membership concept team persist goal introduc paper formal tamb zhang point issu persist team specif temporari object mainten goal formal idea team base mainten goal continu exist long mainten goal briefli touch mainten goal paper implement explain process system formul mainten goal individu team discuss paper recoveri scheme present paper recoveri system connect left agent idempot behavior messag lost due broker failur resent aaa agent shell recoveri ongo requir complet recoveri investig gener plan base approach implement teamwork gener bdi agent establish execut team commit run time summari introduc adapt agent architectur broker infrastructur build robust system system recov broker failur problem machin commun death broker process present specif teamwork aaa implement argu behavior system consequ teamwork specif specif agent regist aaa broker broker team intent connect long remain regist broker team show requir team individu commit deriv specif conclud teamwork design robust broker system architectur recov broker failur formal notion persist team continu exist team member chang team team persist goal team member commit team entiti individu constitut team aaa quickset system darpa program glue technolog integr experi refer bernstein editor principl transact process high chapter editor build secur reliabl network applic part reliabl distribut chapter chen approach reliabl softwar oper digest paper annual intern confer toler refer cohen plan speech act phd depart comput open agent architectur aaai spring page march cohen levesqu intent choic commit artifici volum page cohen levesqu ration interact basi commun editor intent chapter system develop foundat benchmark bradford mit cohen levesqu confirm joint action intern joint confer artifici morgan kaufman san august page multimod interact distribut intern multimedia confer acm page control agent base system sentinel approach fault handl system australian workshop distribut design govern agent constitut complianc autonom agent jen control cooper problem solv industri system joint intent artifici intellig page kaminka tamb wrong improv robust social diagnosi nation confer artifici klein except handl agent system autonom agent kumar cohen system architectur nune act nation confer artifici morgan kaufmann open agent framework build distribut softwar appli artifici pp williamson internet tamb teamwork dynam environ intern confer aaai menlo flexibl teamwork persist team intern confer
DB/426 3 increment interact sequenc mine zaki comput scienc ny comput scienc renssela polytechn troi ny abstract discoveri frequent sequenc tempor import data mine problem current work assum updat requir pattern scan entir techniqu maintain sequenc presenc user interact modifi mine challeng updat invalid exist sequenc introduc avoid algorithm entir reduc execut time result confirm approach result substanti perform gain introduct sequenc mine import data mine attempt discov frequent sequenc attribut set larg problem origin motiv applic retail includ attach sale custom satisfact appli scientif busi domain health care industri predict onset sequenc industri predict invest risk base sequenc stock market event discov frequent sequenc larg comput intens search space size essenti exponenti length longest transact sequenc high comput cost accept static discoveri approach problem present literatur updat contact work support part nsf grant extern research grant digit equip corpor regular run discoveri program updat produc comput load algorithm perform frequent sequenc search increment updat run entir mine algorithm increment mine problem studi associ rule work increment mine sequenti pattern present method increment sequenc mine goal minim comput requir handl increment updat algorithm accomplish goal maintain inform infrequ sequenc increment data increment part scan incorpor inform data combin inform order determin portion origin process aid vertic layout attribut list transact occur result improv execut time order magnitud handl increment handl interact queri rest paper organ section formul sequenc discoveri problem section describ algorithm build increment approach section describ increment sequenc mine algorithm section describ support onlin queri evalu present section discuss relat work section conclud section problem formul defin increment sequenc mine problem paper concern begin defin notat denot set attribut assum fix member identifi item indic itemset set item itemset denot element order order pure order avoid redund itemset denot number element itemset size call sequenc order list nonempti itemset sequenc itemset ff ff denot ff length sequenc sum size itemset integ sequenc length call sequenc ff subsequ sequenc denot ff fi construct fi strike item elimin occurr time ac subsequ ab acd ff proper subsequ denot ff oe ff fi ff fi gener subsequ length sequenc length subsequ ff obtain drop item gener sequenc share common suffix length gener subsequ ab cd cd cd share common suffix cd sequenc maxim collect sequenc sequenc subsequ sequenc collect sequenc itemset sequenc support frequenc ff denot support number custom sequenc ff subsequ denot min support threshold defin sequenc frequent support min support rule sequenc sequenc confid custom data ad refer origin updat ffi increment updat denot ffi denot collect frequent sequenc length fs denot set frequent sequenc neg border collect sequenc frequent gener subsequ frequent set frequent sequenc origin sequenc set frequent sequenc join origin increment custom shown figur item custom figur show frequent sequenc frequenc shown neg minimum support frequent figur show gener subsequ bold line figur show frequent set neg border chang mine combin origin increment frequent origin cid tid frequent neg border sequenc lattic ab item figur origin increment sequenc lattic tid frequent cid neg border item ab ac bc figur origin increment lattic frequent updat ffi updat element move nb fs increment sequenc discoveri origin increment find frequent sequenc minimum recomput algorithm section describ algorithm fast discoveri frequent form basi increment algorithm sequenc observ subsequ relat defin partial order set call special relat ff ff gener fi specif ff observ relat monoton special relat respect frequenc fi frequent subsequ ff fi frequent algorithm systemat search sequenc lattic span subsequ gener maxim specif frequent sequenc manner figur show lattic frequent sequenc cid tid cid tid cid tid frequent sequenc lattic origin cid tid cid tid ab figur frequent sequenc initi intersect support current sequenc mine algorithm assum horizont layout shown figur horizont consist set custom custom set transact item transact vertic associ item sequenc lattic denot list custom transact identifi pair atom figur show item sequenc determin support simpli intersect length subsequ length subsequ share common suffix gener comput support length sequenc simpl check support result sequenc frequent figur show process pictori show initi vertic item intermedi obtain intersect list lattic decomposit frequent sequenc perform ab ab decomposit class lattic decomposit figur initi suffix length level suffix length class tree section obtain sequenc support limit amount intermedi fit memori break larg search space manag chunk process independ memori accomplish class length sequenc class share common length suffix kei observ class origin sequenc lattic process independ figur show effect frequent sequenc lattic sequenc length suffix singl class result suffix refer parent class class independ complet inform gener frequent sequenc share suffix class element frequent sequenc step obviou item lead frequent sequenc suffix sequenc level smaller independ class figur show effect suffix level obtain tree independ class shown figur comput tree process parent class parent class process parent class process class search figur show search input procedur element frequent sequenc gener intersect distinct pair sequenc class parent parent class element element min jrj jrj figur frequent sequenc check support result min sequenc found frequent current level form class level process repeat frequent sequenc term memori easi memori store intermedi consecut level frequent sequenc level sequenc current level delet detail increment mine algorithm minim recomput origin mine sequenc presenc increment increment assum append order accomplish provid effici memori manag scheme index creat increment sequenc lattic exploit properti prune search space potenti sequenc isl consist element neg border frequent initi construct algorithm previou section children nonempti sequenc gener subsequ node isl support sequenc figur show isl origin figur show isl updat begin section describ memori manag scheme access effici explor properti isl show prune search space potenti sequenc final provid detail algorithm memori order run increment mine crucial memori access minim limit access origin directli index locat disk handl identifi set custom increment item creat temporari consist pair custom increment split temporari origin part increment correspond transact current increment case scenario part read directli index base item provid level index scheme vertic partit number block individu block fit memori block length function depend custom identifi block exist item dereferenc point entri item locat block custom id found index locat item partit perform linear search custom identifi level index scheme quickli jump portion affect touch entir note vertic data format effici retriev affect item touch entir horizont item found scan entir theori increment sequenc explor properti isl construct set tid item increment part ffi collect record cid pair custom affect updat pair origin increment pair support chang custom updat consid set custom origin updat pair increment part support sequenc fs nb updat comput support support updat origin minu transact count sequenc fs nb support support support support sequenc fs nb move frequent set element sequenc remain fs nb proposit sequenc support support item belong present properti form basi increment mine method call sequenc gener descend exist list zm sequenc zm gener subsequ theorem state sequenc member fs nb updat member gener descend nb fs proposit sequenc length fs fs nb gener descend nb fs proof proof induct length gener subsequ note belong fs fs nb contradict assumpt fs base length definit belong fs nb fs fs definit claim nb fs gener descend induct claim hold fs nb fs nb belong fs gener subsequ claim hold case fs fs nb belong fs nb fs nb fs nb fs nb induct step length claim hold gener descend satisfi claim gener subsequ gener descend claim hold argument appli case fs nb increment sequenc mine algorithm goal increment algorithm maintain sequenc lattic presenc updat categor increment base custom transact ad ad custom reduc support sequenc isl transact custom sequenc isl number custom support requir ad custom absolut support min remov isl sequenc fall support default algorithm isl support frequent set neg border element origin goal phase algorithm updat account increment note equat comput origin support valu isl support support support support refer figur phase start comput vertic note phase requir custom item origin increment lowest level frequent insert phase queue item increment set proposit support comput element queue note comput singl item larger comput intersect gener comput support comput support procedur sequenc repres list support length frequent set length member end queue neg border support suggest element hash tabl tabl length process repeat queue empti end phase exact support element isl list element neg border frequent result increment figur element support move neg border frequent phase comput item comput item item parent class comput min neg class phase item construct suffix class class comput gener gener support support suffix support figur ism increment algorithm describ phase figur end phase data structur arrai hash tabl element move neg border frequent set move intersect frequent add frequent tabl process run note ad tabl time evalu involv frequent nb nb start level hash pick element process creat list frequent class step pass result class modifi version add frequent neg border element element isl repeat process tabl empti class figur frequent sequenc suffix class sequenc fs frequent itemset result sequenc ad fs sequenc ab ad nb valid algorithm input phase start insert item belong queue proposit item support result increment item sequenc place item natur algorithm ensur ascend evalu note prune condit result ascend evalu ensur ascend satisfi equat support ascend remain unchang support updat directli appli equat final algorithm track sequenc move neg border frequent set goal phase updat support sequenc belong fs proposit element set gener descend nb fs phase gener list element nb fs sequenc length list reconstruct set frequent sequenc length belong suffix class appli procedur suffix class ensur ascend evalu phase interact sequenc mine idea interact sequenc mine end user queri sequenc rule differ valu support confid excess comput previou work multipl pass made confid pair time unaccept onlin queri problem sequenc mine suit onlin approach hard user estim rule satisfi confid pair interest rule interest rule involv item involv lot manual tune plai memori subsystem server approach problem support queri effici adapt increment sequenc lattic interact queri perform lattic preprocess step algorithm involv comput lattic small support min futur queri involv support larger min order handl modifi lattic link sequenc subsequ length gener easi direct path exist vertex vertex ae node lattic weight support sequenc repres import properti sequenc lattic direct acycl connect length length sequenc lattic produc answer queri interact speed simpl answer frequent sequenc support min maintain queue unprocess initi root lattic pop element place length sequenc connect satisfi queri support ensur node queue multipl time properti node satisfi min queue refin queri support modifi involv procedur quantifi goal find frequent sequenc support return sequenc handl case queue prioriti priorit weight node find stop properti lattic ensur correct includ task return sequenc item handl manner similar simpl queri start root initi queue node sequenc item initi queue set node item rest algorithm ident simpl queri exclud exclud item handl make lattic space follow algorithm includ simpli mark node queue visit start root node simpl queri place node mark visit previou ensur sequenc exclud item handl sequenc item gener place node individu queue start altern initi queue node sequenc goal treat set relat item treat singl item call frequent sequenc involv gener result modifi algorithm reconstruct item special union remov individu item rerun class algorithm item return set frequent sequenc evalu experi singl processor alpha mb memori user process run time synthet size rang gener procedur size benchmark fit goal work assum resid disk dataset gener process maxim itemset averag size gener item maxim sequenc note altern approach filter node found effici averag size creat assign itemset sequenc custom averag transact sequenc assign custom respect averag transact size gener stop custom gener tabl show properti total number transact denot averag transact size custom total number custom paramet gener total size mb mb mb mb mb mb tabl properti evalu increment modifi gener mechan construct dataset origin increment input gener includ increment percentag roughli number custom increment percentag transact custom belong increment assum set increment percentag percentag transact expect custom belong averag transact increment actual number custom increment determin draw uniform distribut percentag custom increment number transact belong increment drawn uniform distribut percentag increment vari increment percentag fix transact percentag ran algorithm entir evalu cost run increment algorithm construct isl origin increment valu percent evalu breakdown cost increment algorithm phase result show speedup obtain increment algorithm comparison time phase phase breakdown time phase phase breakdown time phase phase breakdown time phase phase breakdown figur increment algorithm perform comparison support time phase phase support support time phase phase support figur effect vari phase phase breakdown transact length phase phase breakdown transact length phase phase breakdown transact length figur effect vari transact length algorithm entir rang factor order magnitud move larger increment smaller improv fewer sequenc smaller increment breakdown figur reveal phase time pretti requir dataset increment valu show phase order magnitud larger phase faster entir algorithm size run time phase rate entir algorithm dataset experi conduct vari support size increment size result experi document figur support size execut time phase phase rapidli approach higher number element isl fewer phase number sequenc smaller phase experi conduct number transact percentag constant vari number transact custom figur depict breakdown phase ism algorithm vari increment valu move transact execut time phase progress increment size number sequenc isl number sequenc rel smaller lower increment valu simpl includ exclud rerun neglig neglig neglig neglig neglig neglig tabl interact perform interact evalu perform interact queri section interact queri experi perform sun processor mb memori envisag interact queri featur client machin execut ship result data mine client compar execut interact queri slower machin reason evalu queri slower machin rel speed interact approach slower machin dec queri execut neglig hierarch queri simpli entail modifi execut phase evalu evalu simpl queri support rang refin queri refin prioriti queri sequenc highest includ queri random exclud queri random result present tabl cost rerun algorithm dec machin queri time includ exclud queri low capabl achiev interact speed prioriti queri sort sequenc support sort domin comput time compar rerun faster dec interact queri order magnitud spite execut slower machin relat work sequenc mine previou algorithm shown outperform factor gener factor ten step problem find frequent episod singl long sequenc event present algorithm discov pattern multipl event explor rule space directli sequenc space increment sequenc work address increment mine sequenc relat dynam suffix tree base approach increment mine singl long sequenc deal sequenc multipl sequenc set item singl long sequenc item closest work increment associ mine algorithm present major limit requir size largest frequent itemset increment algorithm present pair approach store set frequent border algorithm track frequent set neg border approach similar border algorithm approach requir singl scan origin make scan increment ism algorithm make scan increment make partial scan origin cite relat work associ import differ associ rule discov pattern discov pattern set frequent sequenc superset set frequent itemset fact itemset space tini fraction sequenc space number itemset space size size size bound sequenc maximum sequenc length space size sequenc search complex challeng itemset search necessit fast algorithm interact sequenc paradigm interact explor associ sequenc episod present idea mine produc larg collect frequent pattern user explor collect templat interest templat approach exploratori analysi integr constraint check insid mine algorithm approach present present cap algorithm extract frequent associ match rich class constraint piec work complimentari approach integr increment interact compon transact support constraint suit framework onlin algorithm mine associ valu support confid present ism lattic framework ism support onlin increment work sequenc data space techniqu maintain data structur mine sequenc presenc user interact result obtain show speedup factor order magnitud increment mine compar state art sequenc mine algorithm result interact approach cost maintain summari data interact approach perform order magnitud faster current sequenc mine algorithm limit increment approach paper size neg result memori util investig method elimin part refin algorithm perform core comput refer aggarw yu onlin gener associ icd feb wong mainten discov associ rule larg increment updat techniqu icd februari mannila effici algorithm discov frequent set increment sigmod workshop research issu data mine knowledg verkamo find interest rule larg set discov associ rule intl conf inform knowledg novemb verkamo discoveri frequent episod event sequenc data mine knowledg intern al exploratori mine prune optim constrain associ rule acm sigmod intl conf manag june al famili algorithm find tempor structur data intl workshop ai march srikant agraw mine sequenti gener perform improv intl conf extend march agraw mine associ rule item constraint intl conf knowledg discoveri data august effici algorithm increment updat associ rule larg kdd august wang discov pattern larg dynam sequenti data intellig inform august zaki effici frequent sequenc intl conf inform knowledg novemb
IR/427 5 learnabl design output code multiclass problem yoram singer school comput scienc engin hebrew jerusalem israel abstract output code gener framework solv multiclass categor problem previou research output code build multiclass machin predefin output code paper discuss time problem design output code multiclass problem design problem discret extens previou present neg result introduc notion continu code cast design problem continu code constrain optim problem describ optim problem norm code matrix norm formal result quadrat program dual depend length code special case formal multiclass scheme build support vector machin solv effici give time space effici algorithm solv quadrat program preliminari experi perform synthet data show algorithm order magnitud faster standard quadrat program packag introduct appli machin learn problem requir assign label instanc label drawn finit set label problem refer multiclass categor classif exampl machin learn applic includ multiclass categor compon includ optic charact text phonem classif speech medic binari classif learn algorithm extend handl multiclass problem instanc gener approach reduc multiclass problem multipl binari classif problem dietterich bakiri gener approach base code term output code short output code output code multiclass problem stage train stage construct multipl independ binari classifi base partit set label disjoint set classif predict binari classifi combin extend predict origin label test instanc work shown output code greatli improv standard reduct binari problem perform output code analyz statist learn theoret context previou work output code concentr problem solv multiclass problem predefin output independ specif applic class construct binari classifi predefin output code ignor complex induc binari problem output code experi typic confin specif famili code famili code suggest test compar class compar pair class random code exhaust code linear error correct code heurist attempt modifi code improv multiclass predict accuraci suggest yield improv lack formal justif paper concentr problem design good code multiclass problem sec studi problem find column discret code matrix binari show find good column polynomi time restrict class binari problem find good column difficult result underscor difficulti code design problem sec discuss gener design problem show set binari classifi problem find good code matrix motiv intract result introduc sec notion continu code cast design problem continu code constrain optim problem discret column code matrix divid set label subset label posit neg sign entri code matrix determin subset associ magnitud correspond confid associ seek output code small empir loss matrix norm small describ optim problem norm code show code design problem solv linear program norm formal result quadrat program dual depend length code similar support vector dual program express term input emploi binari classifi framework special direct effici method construct multiclass support vector machin number variabl dual quadrat problem product number sampl number class larg small dataset english letter recognit problem train exampl requir variabl standard matrix dual quadrat problem requir byte memori describ sec memori effici algorithm solv quadrat program code design algorithm reminisc platt sequenti minim optim unlik algorithm optim round reduc subset variabl correspond singl algorithm reduc optim problem sequenc small size reduc problem equal number class origin multiclass problem reduc problem solv standard qp techniqu standard approach requir larg amount memori number class larg straightforward solut time consum develop algorithm provid analyt solut reduc problem effici algorithm calcul solut run time algorithm polynomi memori requir linear number class conclud simul result show algorithm order magnitud faster standard qp small number class discret code ym set train exampl instanc belong domain assum loss gener label integ set kg multiclass classifi function map instanc element work focu framework output code build multiclass classifi binari classifi discret output code matrix size row correspond class column defin partit disjoint set binari learn algorithm construct column set exampl induc column set fed train data learn algorithm find hypothesi reduct yield binari classifi denot vector predict classifi instanc denot rth row predict label row gener notion close defin function higher confid correct label classifi close function easi verifi choic pick row attain minim ham distanc classifi misclassifi predic hold goal find classifi small note pass paper focu empir loss minim problem standard classif loss separ test set theoret bound assumpt theori leav futur research small row attain maxim function accommod case relax definit defin classifi base code map fy max case pick label uniformli expect error def context output multiclass map determin code matrix set binari classifi assum binari classifi chosen hypothesi class natur learn problem matrix find set suffer small empir loss set binari classifi find matrix small empir loss find matrix set small empir loss previou work problem paper concentr code design problem find good matrix summari notat appendix find column output code assum singl binari classifi find column matrix minim empir loss denot column describ effici algorithm find algorithm run time polynomi size label set jy sampl size note case note sampl divid class label classif defin fraction exampl label classif denot number element equal denot def assum loss gener element random size eq rewrit eq eq expand ur ur ur ur choic maxim set indic attain highest valu set rest indic effici log time sort choic found valu achiev maxim eq oper calcul total number oper find optim choic column log proven theorem theorem ym set train label integ set kg binari hypothesi class hypothesi column output code minim empir loss defin eq found polynomi time conclud section reduct sat demonstr learn algorithm class chosen restrict form result learn problem hard xn boolean formula variabl interpret true defin fx instanc space sampl size label defin learn algorithm algorithm input binari label sampl form xn true algorithm return hypothesi consist sampl sampl algorithm return constant major sampl arg max note learn algorithm hypothesi return empir loss binari label sampl show multiclass learn algorithm minim empir loss column hypothesi return algorithm check formula satisfi case xn true definit eq condit hold number exampl hypothesi classifi correctli eq obtain minimum achiev formula satisfi learn algorithm oracl satisfi set discuss section result underscor difficulti problem show problem find good output code larg set classifi intract note pass effici algorithm find singl column set instanc build tree direct acycl graph multiclass problem leav futur research find gener discret output code section prove set binari classifi find code matrix minim empir loss sampl ym set classifi denot hm ym evalu sampl def predict vector ith sampl show problem problem remain notat previou output code matrix row predict class instanc arg max simplic present assum code valu set assumpt chang problem linear transform set theorem problem natur number label sampl hm ym exist matrix classifi base output code make mistak proof base reduct techniqu introduc simon check polynomi time number classif error code matrix exce bound problem np show reduct vertex cover order prove problem undirect graph code structur graph sampl size jv set edg fv encod exampl set vector set vector set label encod node set label show exist vertex cover node exist code matrix induc classif error sampl vertex cover ju show exist code mistak jv characterist function defin output code matrix denot logic oper exampl predict label equal true label suffer error exampl correspond node exampl misclassifi label correspond exampl correctli classifi shown total number mistak ju code achiev mistak construct subset scan add vertic misclassifi exampl misclassifi edg fv pick random add misclassifi exampl size claim set vertex cover graph assum contradict edg fv belong set exampl vertic classifi correctli sum equat yield exampl edg fv classifi impli sum equat compar eq contradict continu code intract result previou section motiv relax output code section describ natur relax classifi output code matrix real classifi construct code matrix set binari classifi matrix size row correspond class binari classifi map column defin partit disjoint set sign element column interpret set class belong magnitud jm interpret confid partit interpret sign predict set label instanc belong magnitud jh confid predict instanc classifi predict label maxim confid function arg max code assum loss gener class attain maximum function concentr problem find good continu code set binari classifi approach cast code design problem constrain optim problem borrow idea soft margin replac discret multiclass loss linear bound max formul motiv gener analysi schapir al analysi give base margin exampl margin close relat definit loss eq put correct label confid larger confid rest label suffer loss linearli proport differ confid correct label maximum confid label bound empir loss max equal sampl classifi correctli set binari classifi exist matrix loss equal max denot matrix satisfi eq satisfi view code collect vector defin norm norm concaten vector constitut motiv seek matrix small norm satisfi eq entir sampl label problem find good matrix state optim subject integ note constraint automat satisfi chang deriv case gener case matrix classifi exampl correctli exist introduc slack variabl modifi eq max optim problem subject constant optim problem constraint defin optim problem subject relat constraint formal properti scope paper discuss relat problem design continu code linear program develop eq case deal case result linear program simplic present assum case object function eq jm introduc set auxiliari variabl jm standard linear program subject obtain dual program app defin variabl constraint primal problem set set dual program max subject case similar object function eq max jm introduc singl variabl max jm obtain primal subject techniqu dual program max subject program solv standard linear program packag design continu code program discuss detail eq case conveni squar norm matrix norm primal program subject solv optim problem find saddl point lagrangian subject saddl point seek minimum primal variabl maximum dual find minimum primal variabl eq impli optimum object function row matrix linear combin support pattern class coeffici eq set support pattern class case label equal ith support pattern case label ith pattern support pattern variabl view distribut label affect solut point distribut concentr correct label question pattern contribut learn process develop lagrangian dual variabl substitut eq eq algebra obtain target function dual program omit due lack vector compon ith compon equal vector compon notat rewrit dual program vector form max subject easi verifi strictli convex constraint linear problem singl optim solut qp method solv sec describ memori effici algorithm solv special qp problem simplifi equat denot differ correct point distribut distribut obtain optim eq variabl maxim object function optimum omit constant write dual problem eq max subject classifi written term variabl arg max arg max arg max arg max support vector dual program classif algorithm depend product form perform calcul high space transform replac eq eq gener kernel satisfi mercer condit gener dual program max subject classif rule arg max gener framework design output code qp program special algorithm build multiclass support vector machin assum instanc space vector space defin def primal program eq min subject note eq reduc primal program note special case reminisc multiclass approach svm suggest weston watkin approach compar confid confid label slack variabl primal problem framework confid compar max slack variabl primal program tabl summar properti program discuss shown advantag object function number variabl dual problem function depend number column number column affect evalu kernel formal eq construct code matrix increment outlin increment approach note method appli step increment singl binari classifi construct column rewrit eq scalar form subject constant rest column assum induct provid column matrix found provid binari classifi def column find column substitut classifi matrix eq max constraint eq redefin straightforward verifi definit result equat form eq appli algorithm design case case construct singl problem fewer variabl constraint size program remain lose abil kernel concentr batch case find entir matrix effici algorithm qp problem quadrat program present eq solv standard qp techniqu shown tabl dual program depend mk variabl km constraint convert dual program eq standard qp form requir store manipul matrix element prohibit applic size introduc memori effici algorithm solv quadrat optim problem eq primal variabl kl kl constraint km km km dual variabl km km km km km km constraint kl tabl summari size optim problem norm appendix definit constraint linear note constraint eq divid disjoint subset algorithm describ work round round pick singl set modifi optim reduc optim problem algorithm reminisc platt smo algorithm algorithm optim smo fix index write object function term variabl isol def omit index drop constant affect reduc optim variabl max subject program solv standard qp requir larg amount memori straightforward solut time consum problem constitut core algorithm develop algorithm describ effici method solv eq write eq complet quadrat program eq min subject sec discuss analyt solut eq sec describ time effici algorithm comput analyt solut analyt solut algorithm solut describ section simpl implement deriv complex describ analyt solut eq give intuit method fix vector denot note feasibl point constraint satisfi feasibl point constraint tight note differ bound variabl sum induc uniform distribut compon varianc expect constrain optim solut vector achiev smallest varianc compon attain similar inequ constraint fig illustr motiv pick show plot feasibl valu index point design valu compon norm plot hand side plot smaller norm plot left hand side hand side plot optim solut sum length arrow plot set point satisfi constraint sum length plot exploit observ algorithm describ sequel seek feasibl vector compon equal threshold defin vector rth compon equal minimum inequ constraint satisfi defin figur illustr feasibl point reduc optim problem index denot valu bottom plot smaller varianc achiev denot equal constraint eq assum loss gener compon vector descend log prove main theorem section lemma lemma linear slope rang develop figur illustr solut qp problem optim solut equat note equal hold rang function complet proof corollari exist uniqu eq conclud strictli continu rang theorem strictli continu function rang interv interv def uniqu fact function map prove main theorem section theorem uniqu solut optimum optim problem state eq theorem optimum eq form defin eq equal constraint hold plot solut fig shown fig corollari impli solut exist uniqu note definit vector feasibl point eq prove optimum eq show feasibl point vector def defin def fr fr satisfi equal constraint eq feasibl point definit set combin properti start simpler case differ subset coordin coordin compon equal obtain varianc constant vector compon feasibl vector achiev varianc term cancel definit eq assumpt equal contradict turn prove complementari case exist eq conclud exist assum loss gener case analog switch role defin vector satisfi constraint eq equal compon input initi defin sort compon defin eq comput eq assign return figur algorithm find optim solut reduc quadrat program substitut valu definit definit term bottom equat neg term neg contradict effici algorithm comput analyt solut optim problem eq solv standard qp interior point method method comput time section give algorithm solv optim problem log solv equat assum compon vector descend denot algorithm search interv simpl algebra manipul deriv search scheme iff defin potenti function input ym feasibl point eq iter comput eq bp ap yp eq comput fig bp ap eq output final eq arg max figur skeleton algorithm find classifi base output code solv quadrat program defin eq note recal function linear interv slope solv equat find impli eq equat linear complet algorithm fig log time sort vector time loop total run time log final readi give algorithm solv learn problem eq output code construct support pattern term algorithm support pattern output code algorithm fig develop method modifi round stop criterion entir optim algorithm due lack space omit detail full paper perform preliminari experi synthet data order check actual perform algorithm test special case multiclass svm set code matric test train exampl qp figur run time comparison algorithm code design quadrat matlab standard qp packag algorithm note logarithm scale axi row column vari size train set size exampl gener uniform distribut domain partit quarter equal quarter label sampl size ran algorithm run randomli gener train set compar standard quadrat optim routin matlab algorithm implement matlab averag run time result shown fig note axi result show effici algorithm order magnitud faster standard qp packag futur research paper investig problem design output code solv multiclass problem discuss discret code show problem intract gener find column code matrix polynomi time question algorithm gener column run time remain open close relat question find effici column previou column left open futur research usag algorithm find column subroutin construct code base tree direct acycl graph tool increment construct output code motiv intract result discret code introduc notion continu output code optim problem find good continu code set binari classifi discuss detail effici algorithm problem base quadrat program special framework effici algorithm multiclass support vector machin import effici algorithm prove crucial larg classif problem class charact recognit effici implement algorithm implement detail gener result omit due lack space present import question tackl bare paper problem interleav code design problem learn binari classifi viabl direct domain combin algorithm continu code support vector machin algorithm acknowledg rob schapir numer vladimir vapnik encourag support line friedman ran comment suggest refer aha bankert cloud classif output code artifici intellig natur volum page el singer reduc multiclass unifi approach margin classifi machin seventeenth intern peter bartlett sampl complex pattern classif neural size weight import size network ieee transact inform march berger output code text classif workshop machin learn inform leo jerom richard charl stone classif regress tree wadsworth linear program cort vladimir vapnik network machin septemb bakiri thoma dietterich achiev machin learn data mine speech thoma dietterich bakiri solv multiclass learn problem output code journal artifici intellig januari tom dietterich bae kong machin learn statist statist varianc tree algorithm technic oregon state fletcher practic method optim john hasti robert tibshirani classif coupl annal david haussler theoret gener pac model neural net learn applic inform simon robust trainabl singl neuron annual acm workshop comput learn page juli jame hasti error code method comput graphic kong dietterich output code correct bia varianc proc twelfth intern confer machin jc platt fast train support vector machin sequenti minim optim advanc kernel method support vector learn mit jc larg margin dag multiclass classif advanc neural inform process system mit ross quinlan program machin learn morgan william learn intern error propag david rumelhart jame parallel distribut process explor microstructur chapter page mit robert schapir output code boost multiclass learn problem machin fourteenth intern page robert schapir yoram singer improv boost algorithm predict machin vapnik estim depend base empir data vapnik statist learn theori weston watkin support vector machin multiclass pattern recognit seventh european symposium artifici neural april legend var descript section sampl matrix code sampl size class row column index index class correct label index hypothesi slack variabl optim problem dual variabl problem ap coeffici reduc optim prob bp coeffici reduc optim prob cp coeffici reduc optim prob linear program linear max subject ij ij dual program min subject ij ij
HCI/428 4 inform seek social situat activ christoph depart inform technolog zurich switzerland introduct term increasingli denot arti cial comput program robot interact environ order achiev task goal notion refer social cultur aspect consid clarifi term talk comput applic discuss implic social cultur mean context inform seek support proce discuss vari mean term outlin interpret context inform seek support discuss tool implement aspect import context artifact human arti cial comput program robot refer read write data robot equip sensor actuat act environ sensor collect data environ actuat util act environ equat interact attent paid social aspect term larg lost social connot william clancei put overwhelm term situat cial research reduc mean conceptu form social content interact locat time term receiv attent term embodi physic interact environ research workshop direct situat acm sigchi confer april arti cial intellig robot autonom agent capabl acquir histori simpl entiti mean embodi entiti acquir data depend ned data data provid agent situat acquir inform environ sole sensor interact environ situat agent interact world interven human potenti acquir equip lean mechan concept account social cultur aspect investig research investig situat aspect behavior shown mean situat signi canc gener william background arti cial intellig cognit relat stress knowledg locat physic interact social jean knowledg consid relat substitut term situat order stress percept activ tightli bound cultur ident implic social cultur aspect investig research behavior cognit learn educ understand work practic exploit speci design system system account broad social cultur mean system support interact necessarili support mainstream research typic pursu idea usag situat model comput applic make inform approach lead develop number success applic experi limit expert system intellig agent suggest applic model approach limit restrict applic domain research support user avoid constrain interpret situat design support system exploit fact user bring background understand situat inform seek human inform seek domain interest explor increasingli hot topic inform ag approach support focu model user interest refer inform order automat document relev user approach incorpor histor data demograph data determin inform interest situat situat approach static model situat reduc user interact interact comput document inform situat limit physic interact includ social particip inform seek occur isol social cultur set part ongo ort understand act world gari marchionini put seek part person ongo ort understand act world person situat context instant uenc includ inform emphasi implic insight hard approach system intellig tend focu satisfi inform major except establish research inform visual inform seek focu satisfi inform replac interact explor inform space overview inform visual eld found card al research gear investig user interact inform space support constrain determin interpret situat research base major assumpt inform process occur human explor inform view inher dynam phenomena similar knowledg inform seek instanc jean call social describ approach develop order support user interact inform space account approach focu interact global conferenc system usenet largest distribut inform system past usenet heavili ltere experi usenet illustr aspect social situat activ hard observ usenet speci environ characterist constraint heavili util gener insight domain rst approach augment client exploit user interact client reduc amount inform ltere interest discuss user signi period time filter involv model user interest pure base user interact discuss import note tool situat tool support user explor interest interact discuss approach support social navig usenet newsgroup social navig term denot movement item uenc activ broad overview social navig found munro al social navig usenet newsgroup select discuss read user contribut messag discuss tool extend rudimentari version social navig provid addit social activ indic indic visual hidden read activ newsgroup read frequent activ usenet read observ speci support visual read activ enabl user gain insight potenti interest newsgroup user social dynam newsgroup user knowledg particip select discuss read acknowledg author grate rolf pfeifer provid stimul research environ research fund part swiss feder oc educ scienc contract refer social activ interfac compon cscw system eighth annual symposium user interfac softwar technolog page acm press visual inform tight coupl dynam queri lter star eld displai annual acm sigchi confer human factor comput system page acm press intellig reason twelfth intern joint confer arti cial intellig page morgan kaufmann publish editor read inform vision morgan kaufmann san ca understand practic perspect activ context cambridg uk edit situat cognit cambridg uk run model inform navig open person assist intern confer practic applic intellig agent technolog page cognit practic cambridg uk situat learn commun practic perspect social share page american psycholog dc print april editor situat learn legitim particip cambridg uk support situat action high volum data situat annual acm sigchi confer human factor comput system page acm press support situat inform collabor phd faculti switzerland support social navig usenet newsgroup social design workshop acm sigchi confer human factor comput system inform seek electron environ cambridg cambridg editor social navig inform space uk understand intellig mit ma plan situat action problem commun cambridg uk
ML/429 6 featur subset select genet algorithm tr yang vasant honavar acm comput classif system categori learn neural model neural design methodolog featur evalu select featur subset genet construct neural net learn algorithm artifici intellig research group depart comput scienc hall iowa iowa usa featur subset select genet algorithm yang vasant honavar artifici intellig research group depart comput scienc hall iowa state ia abstract practic pattern classif knowledg discoveri problem requir select subset attribut featur larger repres pattern classifi paper present approach optim problem featur subset select genet algorithm experi demonstr feasibl approach featur subset select autom design neural network pattern classif knowledg discoveri introduct practic pattern classif task medic requir learn classif function assign input pattern repres vector attribut featur finit set class choic measur repres pattern present classifi affect ffl accuraci classif function learn induct learn algorithm tree induct algorithm neural network learn attribut describ pattern implicitli defin pattern languag languag express fail captur inform classif learn algorithm accuraci classif function learn limit lack inform report version research partial support nation scienc foundat grant john deer foundat ffl time learn suffici accur classif classif attribut describ pattern implicitli determin search space explor learn algorithm abund irrelev attribut unnecessarili size search time learn suffici accur classif function ffl number exampl learn suffici accur classif thing larger number attribut describ pattern domain larger number exampl learn classif function desir accuraci ffl cost perform classif learn classif practic applic medic pattern observ symptom result diagnost test diagnost test cost risk exploratori surgeri riski blood test present featur subset select problem autom design pattern classifi featur subset select problem refer task identifi select subset attribut repres pattern larger set mutual possibl attribut measur cost risk scenario practic interest task select subset clinic test diagnost perform part medic diagnosi task exampl featur subset select problem includ larg scale data mine power system relat work number approach featur subset select literatur refer shown involv search optim subset featur base criteria interest emploi exhaust search find minim combin featur suffici construct hypothesi consist exampl exhaust search combin featur current approach featur subset select assum monoton measur classif perform ad featur worsen perform branch bound search work convent statist perform poor nonlinear classifi neural network practic scenario monoton assumpt satisfi featur weight variant featur select involv assign weight attribut weight attribut measur relev import classif task cost punch featur subset select special case weight binari weight author examin heurist search featur subset select conjunct branch bound liu john kohavi koller explor random liu random heurist search techniqu genet algorithm punch de brill select featur subset tree nearest neighbor classifi featur subset select algorithm classifi categori base featur select independ learn algorithm construct classifi featur select independ learn techniqu follow filter approach follow wrapper approach filter approach gener effici wrapper major drawback optim select featur independ induct learn algorithm construct classifi wrapper hand involv comput overhead evalu candid featur subset execut select learn algorithm dataset repres featur subset featur subset select techniqu make monoton assumpt work linear exhibit poor perform classifi neural network practic scenario monoton assumpt satisfi addit irrelev featur social secur number medic record diagnosi significantli worsen gener accuraci tree classifi featur select techniqu literatur except design handl multipl select criteria classif featur measur genet select neural network pattern classifi featur subset select context practic problem present instanc optim problem multipl criteria optim includ accuraci cost risk classif turn depend select attribut describ pattern evolutionari algorithm offer attract approach optim problem paper explor approach featur subset select genet algorithm conjunct fast neural network learn algorithm gener approach induct learn algorithm interest reader refer survei approach induct learn neural network interconnect network simpl comput element threshold sigmoid offer attract framework design pattern classifi pattern classif task account potenti parallel fault toler classif function realiz neural network determin function comput connect paramet connect network comput element threshold realiz classif function oe oe finit set class finit number discret real valu set real finit set discret valu attribut map numer valu code scheme evolutionari algorithm gener effect rapid global search larg search space optim neural network offer attract approach solut region search space identifi genet algorithm offer attract approach featur subset select neural network pattern classifi genet algorithm featur subset select neural network pattern classifi train tradit neural network train algorithm present practic ffl tradit neural network learn algorithm perform error gradient guid search suitabl set weight weight space determin network architectur ad hoc choic network architectur inappropri constrain search set weight network fewer neuron learn algorithm fail find desir classif function network neuron result overfit train data lead poor gener make difficult evalu featur subset emploi describ train pattern train neural network ffl gradient base learn algorithm mathemat unimod search caught local minima error function complic evalu featur subset emploi describ train pattern train neural network ffl typic run genet algorithm involv gener evalu individu featur involv train neural network comput accuraci cost make fit evalu gradient base algorithm typic slow problem exacerb fact multipl neural network sampl space choic network architectur order reliabl fit estim featur subset repres popul construct neural network learn algorithm elimin inappropri choic network potenti discov network size complex classif task implicitli train data provabl effici construct learn algorithm real discret valu pattern classif task begun literatur yang algorithm demonstr good perform term reduc network learn gener number experi artifici fairli larg dataset parekh yang distal simpl fast construct neural network learn algorithm pattern classif result present paper base experi neural network construct distal kei idea distal add hidden neuron time base greedi strategi ensur hidden neuron correctli classifi maxim subset train pattern belong singl class correctli classifi exampl elimin process termin process result empti train set network correctli classifi entir train train set linearli separ transform space defin hidden neuron set weight hidden output neuron connect iter process straightforward show distal converg classif accuraci finit train set time polynomi number train pattern experi report show yield classifi compar favor gener sophist substanti construct learn algorithm make distal attract choic experi evolutionari approach featur subset select neural network pattern classifi implement detail experi run standard genet algorithm select strategi report result base crossvalid classif task paramet ffl popul ffl number ffl probabl ffl probabl ffl probabl select highest rank individu popul repres candid solut featur subset select problem total number attribut repres pattern classifi medic diagnosi observ symptom set diagnost test perform patient exist featur subset larg valu exhaust search repres binari vector dimens total number bit mean attribut select attribut select fit individu determin evalu neural network construct distal train set pattern repres select subset featur individu bit turn neural network input node fit function combin criteria accuraci classif function realiz neural network cost perform classif accuraci classif function estim calcul percentag pattern test set cross correctli classifi neural network question number measur cost classif suggest cost measur attribut classif cost perform test medic diagnosi risk thing chose simpl form fit function defin cost max fit featur subset repres test accuraci neural network classifi train distal featur subset repres cost max upper bound cost candid solut simpli sum cost attribut ad hoc choic discourag trivial solut cost solut low select reason solut yield high accuraci moder cost ensur cost max defin suitabl tradeoff multipl object base knowledg domain task combin multipl optim criteria singl fit function wide varieti approach examin util theori literatur experi descript dataset experi report dataset carefulli construct artifici dataset explor feasibl genet algorithm featur subset select neural network classifi dataset obtain machin learn data repositori california irvin pariti dataset dataset construct explor effect genet algorithm select subset relev attribut presenc redund attribut tabl dataset experi dataset size dimens attribut type class pariti problem numer pittsburgh bridg nomin breast cancer numer credit screen nomin glass identif numer heart nomin heart nomin heart nomin heart nomin heart nomin hepat domain nomin nomin structur numer liver disord numer pima indian diabet numer dna sequenc nomin sonar numer vote nomin vowel recognit numer wine recognit numer zoo nomin minim cost maxim accuraci result neural network pattern classifi modifi train set construct origin attribut replic introduc doubl number attribut addit set irrelev attribut gener assign random boolean valu random vector gener augment vector origin bit ident set attribut result dataset assign random cost dataset experi real world object compar neural network built featur subset select genet algorithm entir set attribut medic dataset inform cost measur attribut dataset inform focu identifi minim subset attribut yield high accuraci neural network classifi dataset dataset cost perform cost addit accuraci tabl comparison neural network pattern classifi construct entir set attribut construct subset attribut subset dataset dimens accuraci hidden dimens accuraci hidden bridg cancer glass heart hepat liver pima promot sonar vote vowel wine zoo tion compar accuraci tabl summar characterist dataset result result set base averag shown tabl fit function accuraci select genet algorithm base accuraci compar perform made entir set attribut result term number attribut chosen gener accuraci network size shown tabl result shown tabl network construct subset attribut compar favor network attribut gener accuraci significantli compar network size tabl comparison neural network pattern classifi accuraci accuraci measur cost attribut accuraci accuraci cost dataset dimens accuraci hidden dimens accuraci cost hidden hepat pima substanti fewer result compar gener feasibl fair comparison approach complet knowledg paramet fit function accuraci cost select base gener accuraci measur cost attribut fit function equat pima dataset experi random cost result shown tabl tabl combin fit function accuraci cost outperform accuraci gener accuraci network size minim cost maxim cut accuraci run result featur subset necessarili minimum cost suggest possibl improv result principl choic fit function combin accuraci cost summari discuss result present paper genet algorithm offer attract approach solv featur subset select problem cost perform induct learn neural network pattern classifi find applic design classifi task medic comput applic interest includ autom data mine knowledg discoveri dataset abund irrelev redund attribut identifi relev subset adequ captur regular data approach featur subset select reli monoton assumpt tradit approach featur select limit applic classif knowledg acquisit task direct research applic approach featur subset select pattern classif task power system gene sequenc data mine knowledg extens comparison perform approach convent method featur subset principl design fit function featur subset select domain knowledg mathemat tool util theori topic focu ongo research refer learn boolean concept presenc irrelev featur artifici fast genet select featur neural network classifi ieee transact neural weight nearest neighbor algorithm learn symbol featur machin featur select automat classif data ieee transact man neural network learn expert system mit press genet algorithm machin learn fundament artifici neural network mit press learn system integr multipl strategi page artifici intellig neural step principl integr academ york gener learn structur process connectionist network inform irrelev featur subset select problem page machin eleventh intern confer morgan kaufmann multipl prefer tradeoff wilei practic approach featur select page ninth intern confer machin learn morgan kaufmann featur subset select search probabilist estim aaai fall symposium relev featur subset rough set reduct intern workshop rough set soft comput optim featur select machin thirteenth intern confer morgan kaufmann element machin learn palo morgan kaufmann featur select discret numer attribut seventh ieee intern confer tool artifici intellig featur select classif probabilist wrapper approach ninth intern confer industri engin applic ai es probabilist approach featur select filter solut thirteenth intern confer machin learn morgan kaufmann introduct genet algorithm mit press machin learn mcgraw hill featur select rough set theori page european confer machin learn springer branch bound algorithm featur subset select ieee transact construct neural network learn algorithm pattern classif tech tr depart comput iowa state research featur select classif genet algorithm page intern confer genet algorithm springer perform effect featur select investig deep structur data page intern confer knowledg discoveri data mine aaai press pattern recognit neural network cambridg press note genet algorithm featur select ieee transact empir evalu hybrid genet tree induct algorithm journal artifici intellig de robust featur select algorithm page ieee intern confer tool artifici intellig review empir evalu featur weight method class lazi learn algorithm tech naval research navi center appli research artifici dc construct learn algorithm tech iowa state
HCI/430 4 social behavior believ agent rizzo center cognit scienc torino lagrang itali manuela veloso carnegi mellon comput scienc forb avenu pa usa maria mice nation research council vial marx itali cesta nation research council vial marx itali abstract agent consid view audienc endow typic person paper describ work progress aim realiz believ agent perform behavior influenc repres cluster priorit goal prefer plan achiev goal implement base integr planner serv reason tool agent execut system introduct notion art charact honest reliabl permit audienc idea believ long studi explor media believ refer charact featur produc feel attitud similar human recent research project group oz project cmu agent group mit virtual theater project stanford effort creation believ agent import novelti ba compar creat tradit media concern passiv wit action perform movi cartoon interact ba frontier virtual realiti make possibl interest applic ba concept theater cern interact artist domain realiz interact ba present problem typic tradit media movi cartoon design realiz ba interact human user kind behavior priori autonom flexibl relev literatur emerg import featur ba mark person work ba physic behavior featur suit express studi realiz person ba vari map emot behavior user threaten flight fear angri attack user brave vari featur underli person work analysi creation goal prefer underli agent person prioriti realiz characterist emot reaction realiz believ agent endow complex person behavior paper structur support view approach person present model instanti model person describ goal influenc behavior briefli describ implement realiz planner reactiv execut system draw model person approach realiz believ agent markedli person import attribut emot person construct vari map emot reaction emot class tion typic fear class flight reaction realiz fear aggress behavior order realiz aggress person reilli elliott person repres term combin underli psycholog influenc agent behavior circumst defin pattern pair attribut assign numer agent social behavior characterist repres realiz complex person necessarili relat typic emot reaction essenti cluster stabl explor feasibl approach person consid psychologist coher pattern kind behavior interact environ explain assum subject pursu stabl goal possibl relat coher pattern behavior multipl context face model person base goal plan explain person concern motiv person interest set main goal constitut regul agent behavior account prefer agent specif person plan achiev goal goal consid place start ai work model human person goal psycholog work provid taxonomi basic human goal plan person prefer plan relev featur model person summar current shortcom outlin final model instanti set person influenc specif social behavior goal model inspir carbonel person defin set action characterist action vari context imposs list list ignor hierarch relat grasp underli motiv person base set typic behavior lack gener action base underli person carbonel compact person trait form goal goal underli gener type action tree prototyp goal assign fix prioriti respect person modifi tree chang prioriti assign goal share idea goal structur repres repres hierarchi person standard tree prototyp agent carbonel work relat work abelson drawn attent repres human behavior stori understand stori understand standard tree essenti make default infer inform charact person design agent mark mind rel import goal hypothet standard agent cluster priorit goal built person chosen set goal design agent drawn ford nichol develop hierarch categori repres class goal abstract level analysi goal goal experienc excit avoid subsum goal pursu behavior seek avoid daili taxonomi chosen goal relev descript goal imag wider categori ford resourc provis give valid avoid selfish behavior materi gain amount monei tangibl good avoid loss monei materi possess social interperson meet social role conform social moral rule avoid social illeg conduct build maintain commun avoid feel social isol separ imag receiv posit evalu realm compet evalu moral sphere evalu avoid social entertain experienc excit avoid stress inact empir found list goal prioriti individu goal prioriti central featur human person ba point design cluster priorit goal agent plan wai pursu person manifest pursu assign prefer plan import model prefer goal common maintain believ differ behavior emerg agent set action differ main goal world affect goal activ pursu plan execut affect goal import person goal problem opportun goal instanti interest object achiev wai plan involv perform relat steal object bargain agent plan produc effect desir differ term instanc plan effect violat social thwart goal belong categori plan chosen selfish agent honest selfish care goal respect social rule import except fi goal expect highest prioriti relev featur shortcom model model person basic defin ffl cluster goal ffl set prefer plan achiev goal import note goal pursu activ reaction suitabl context perspect occas opportun pursu person goal sloman person includ longterm express tendenc make choic opportun aspect impli treatment person consid criteria goal activ process regul pursuit goal basi evalu import attain miss featur concern refer gener style goal pursuit featur outlin good start point repres realiz complex person ba person imposs defin goal cluster gener suitabl situat environ order instanti model situat behavior test specif person realiz chosen reason interest complex social behavior basi exchang involv problem typic system work comput dialogu problem underli natur languag discuss distribut impli sophist abil reason interest reason recipi decid recipi held studi behavior symmetr environ pursu work mice cesta basic motiv plan strategi explor person influenc agent previou work mice consist modal activ goal person influenc modal altruist sincer care disadvantag norm norm behavior impli break norm selfish care profit behavior offer exchang spite enjoi make fun interf plai trick goal influenc believ posit relat strong goal strongli mark behavior notic human person list goal rel prioriti import goal import ffl altruist resourc provis altruist give goal benevol kind accompani altruist behavior materi gain low import attribut goal mark behavior altruist imag altruist receiv appreci altruist welcom posit special refer moral domain evalu ffl norm social norm agent concern social behavior compli goal gener import imag norm receiv appreci norm welcom posit special refer moral domain posit view mean social reinforc norm complianc ffl selfish materi gain selfish primarili acquir maintain possess resourc provis selfish interest mean social selfish readi break rule order pursu goal materi gain imag selfish interest receiv posit mean obtain adopt consequ power present imag view good partner selfish interest hide avoid neg evalu moral domain view potenti ffl spite entertain spite plai joke find troubl social spite care social rule resourc provis pleasur spite imag spite care social imag risk neg evalu view make fun interf plan give concret idea behavior typic list explain list goal influenc exampl interact ba endow human agent wash dish life scenario exampl base commun behavior typic altruist dish altruist eager high prioriti assign goal resourc provis norm stand norm high import goal social respect ha selfish dish give selfish accept exchang order pursu high import goal materi gain spite mom spite ha order make pleasur implement delib reactiv plan idea verifi implement agent interact modal human user virtual environ goal project produc behavior introduc person trait implement accomplish prodigi al rap reactiv execut system execut plan adapt changeabl featur environ problem solv oper repres term person agent prodigi narrow search space function constrain select oper variabl control rule appli constrain choic plan algorithm control rule rule specifi choic select avoid current state plan inform control rule prune search determin order explor choic constraint function appli control rule choic oper bind paramet prodigi build plan person account goal prefer oper bind plan produc prodigi input execut prioriti assign plan basi differ person firbi rap action basic execut unit associ set action uninstanti call execut perform task achiev situat applic task map specifi set method achiev condit applic initi task perform set design sketchi plan form delib put task agenda interpret select task time agenda task select constraint explicit order tempor heurist higher prioriti closer select task rap rap applic method chosen execut method primit subtask put main task put agenda execut subtask finish goal list previou section repres task agenda prioriti person plan achiev task repres method rap variabl agent behavior due person produc prodigi select oper interact goal import rap interpret activ task depend prioriti task pursu agent pursu spite work model person specif domain investig realiz believ model implement ground prodigi planner rap reactiv execut system delib planner produc integr planner reactiv system plan flexibl repres person social agent futur develop work includ tighter integr plan model person agent feedback kind interact occur human agent refer integr emot broad agent fourteenth annual confer cognit scienc societi role emot believ agent commun acm juli process model human person trait artifici intellig search strateg social knowledg plan intern workshop distribut artifici intellig affect process model emot system phd northwestern technic report person strive approach person goal concept person social psycholog hillsdal lawrenc erlbaum associ investig reactiv plan complex domain nation confer artifici intellig taxonomi human goal applic human live put framework work hillsdal lawrenc erlbaum associ motiv human person agenc belief park sage system anim interact actor creat person synthet actor springer collabor direct intern confer multiag system cambridg mit press comput theatr read artifici life meet lifelik autonom agent commun acm ed person current theori research press goal concept person social psycholog hillsdal lawrenc erlbaum associ believ social emot agent phd school comput carnegi mellon pa technic report behavior cooper environ intern workshop design cooper system le chesnai cedex inria person synthet agent technic knowledg system depart comput stanford stanford goal understand inquiri human knowledg structur hillsdal lawrenc erlbaum associ emot cognit emot integr plan prodigi architectur journal theoret artifici intellig person kei human live put framework work hillsdal lawrenc erlbaum associ
IR/431 5 multivari inform bottleneck friedman ori tishbi school comput scienc hebrew jerusalem israel tishbi abstract inform bottleneck method data organ techniqu joint distribut method construct variabl extract valu inform inform bottleneck appli document gene neural spectral analysi introduc gener principl framework multivari extens inform bottleneck method multipl system data partit approach util bayesian network system cluster inform captur show construct insight bottleneck variat enabl solut variat present gener framework iter algorithm construct appli exampl introduct data common data analysi paradigm central question understand gener underli principl cluster inform theoret approach cluster requir cluster captur inform relev explicitli determin compon data common data type call principl verb direct object sentenc word document tissu gene express pattern galaxi spectral compon case object discret categor obviou measur similar exist reli pure joint statist organ data variabl captur quantifi relev respect term mutual defin log equal variabl independ measur bit averag convei inform vice aim inform theoret cluster find partit valu inform requir balanc lose irrelev distinct made time maintain relev principl extract partit inform bottleneck method cluster pose construct variabl repres partit principl variat tradeoff inform maxim briefli review principl consequ section main contribut paper gener formul multivari extens inform bottleneck principl extens case cluster relev respect construct system cluster time give concret briefli mention exampl treat detail section symmetr cluster call doubl find system inform applic relat document seek cluster document word cluster word procedur aim find document cluster correspond topic time identifi cluster word topic system cluster unifi principl show construct simultan parallel cluster attempt build system cluster valu aim captur independ aspect inform convei biolog analysi gene express multipl independ distinct tissu relev express gene present framework pair bayesian network repres variabl compress version observ variabl variabl compress parent repres relat maintain predict variabl predict parent formul gener principl tradeoff inform network carri minim inform maintain maxim inform maintain give interpret tradeoff compress sourc fit target model interpret principl gener compress distort tradeoff theori interpret investig principl gener parametr setup show origin principl equat unknown probabilist partit iter solv shown converg show combin determinist anneal procedur enabl explor inform tradeoff hierarch manner applic principl algorithm mention semant cluster word base multipl part complex data neural code analysi inform bottleneck start notat capit variabl letter denot specif valu variabl set variabl denot boldfac capit letter assign valu variabl set denot boldfac letter statement shorthand tishbi al consid joint distribut variabl respect variabl seek partit auxiliari variabl probabilist map mutual inform minim relev inform maxim depend relat variabl independ hand predict introduc posit lagrang multipli tishbi al formul tradeoff minim variat deriv finit wrt proper normal tishbi al show optim partit exp ep familiar kl diverg equat satisfi consist practic solut equat repeat iter similar cluster determinist anneal converg iter optimum proven bayesian network bayesian network structur set random variabl xn dag vertic annot random variabl variabl denot pa set parent distribut consist factor xn pa notat denot main issu deal amount inform variabl xn quantiti captur xn xn ep xn captur close distribut xn factor distribut margin natur gener concept mutual inform quantiti lose approxim product distribut mutual measur averag number bit gain joint compress variabl independ compress addit independ rewrit term depend proposit bayesian network structur fx xn distribut xn pa sum local mutual inform term variabl parent denot sum inform respect network structur pa consist close distribut consist distanc project distribut consist natur defin distort min measur interpret term graph proposit bayesian network structur fx xn distribut assum order xn consist fx pa pa xn express sum condit inform term correspond markov independ assumpt respect order xn recal markov independ assumpt respect suffici requir factor form distribut consist measur term extent independ fx pa pa independ fx pa parent consist altern distanc measur term amount inform variabl captur depend structur bottleneck principl introduc simpl origin ib variat principl multivari semant bayesian network previou section set observ fx xn partit variabl set ft correspond partit subset observ variabl relat observ variabl compress variabl dag assum variabl function origin restrict attent dag variabl leaf stochast function conveni case restrict form complet graph crucial develop simplifi technic assum consist set variabl pa joint distribut combin set pa analog origin ib inform minim minim quantiti attempt make variabl independ modifi condit distribut variabl modifi depend origin variabl inform preserv graph variabl predict simpli children predict parent measur inform variabl maintain target variabl suggest maxim gener lagrangian written pa pa tk variat subject normal constraint partit distribut lead tractabl henceforth show easi form lagrangian direct gener origin ib principl balanc inform lose inform preserv respect simpl applic variat principl figur specifi compress specifi predict choic result lagrangian ignor end lagrangian origin ib method analog variat principl describ close relat variat principl base approxim distribut class defin bayesian network preserv face problem condit distribut pa target construct variabl origin ib assum goal origin variabl natur multivari aaa ttt ttt figur sourc target network origin ib form minim consist denot previou section goal preserv target class model target bayesian network interpret compress variabl describ joint distribut desir structur structur dag repres independ make concret simpl case shown figur distribut variabl dag specifi compress version make independ formal dag figur separ question forc construct lead independ target dag notic dag trivial achiev set independ simultan aim close achiev tradeoff formal requir close approxim distribut consist natur inform theoret measur approxim minim kl diverg distribut consist introduc lagrang multipli control tradeoff object distinguish paramet denot paramet lagrangian minim formul paramet chang minim condit distribut pa rang case trivial solut independ strive make close figur proposit lagrangian ignor end lagrangian origin ib method ib find compress result joint distribut close dag independ back gener appli proposit rewrit lagrangian term lagrangian present previou transform rang correspond rang extrem case mathemat special case restrict transform question relat variat principl exampl version lagrangian reconstruct origin ib understand differ rang solut extrem valu lagrangian minim term emphasi inform transform extrem lagrangian differ minim maxim emphasi preserv inform variabl parent applic extrem case result maxim appli maxim approach inform preserv irrelev minim minim proposit minim violat condit independ impli minim structur write impli proposit maxim minim inform minim maxim applic ignor term parallel bottleneck aa aa symmetr bottleneck figur sourc target network parallel symmetr bottleneck exampl edg present edg present condit independ explain intuit appli understand solut found variat principl variant appli choic choic make vice versa bottleneck variat exampl principl appli situat simpl extens origin ib introduc variabl figur variabl stochast function similarli origin extract inform call parallel compress specifi predict base drop constant term lagrangian written attempt minim inform maxim inform preserv independ rewrit minim minim interpret optim aim find compress preserv inform remain independ inform compon aim minim violat independ suggest dag figur captur intuit independ specifi addit independ requir examin lagrangian defin principl drop constant term lagrangian written attempt minim inform maxim inform symmetr bottleneck compress ta tb ta extract inform time tb extract inform dag figur captur form compress choic obviou shown figur attempt make ta tb suffici separ network independ tb ta tb separ variabl structur network state ta tb depend develop lagrangian defin tb hand attempt hand attempt make ta tb inform ta inform tb inform argu ta tb compress connect intuit target network figur network ta tb independ make independ aim find ta tb captur independ attribut connect arithmet similar write lagrangian tb attempt maxim inform ta maintain tb time minim inform ta tb solut previou section state variat principl section form solut principl assum describ properti distribut pa present lagrangian form easili recov lagrangian form transform present addit notat shorthand denot pa pa vx pa denot ft similarli simplifi assum notat variabl set joint distribut variabl specif note term impli averag valu condit distribut intersect valu consist posit weight averag note term reduc standard kl diverg main result section theorem assum condit distribut fp stationari point normal probabl term deriv definit model eq standard variabl elimin procedur appendix proof outlin essenc theorem defin term distort distort measur close condit distribut involv replac understand measur perform assign condit distribut depend differ distort valu theorem understand role condit distribut reduc differ distort valu exponenti term act condit probabl mass assign smallest distort behavior match intuit emphasi compress input variabl emphasi predict variabl concret reconsid parallel bottleneck appli theorem eq distort term term correspond inform predict similar averag distort defin analog symmetr bottleneck case appli distort term ta term simpl kl term simplifi log log log simpl arithmet set equat ta jt tb jt ta attempt make predict similar tb similarli tb attempt make predict similar ta iter optim algorithm algorithm construct solut variat principl sort sort cluster solut compress factor preserv inform symmetr inform synthet figur applic symmetr bottleneck simpl synthet input joint joint distribut row column permut match cluster dot line show cluster boundari inform curv show progress inform tradeoff graph fraction inform origin variabl maintain compress fraction inform captur circl denot bifurc event start case fix standard strategi variat simpli appli equat iter mth iter maintain condit distribut fp kg algorithm appli updat step comput respect condit probabl fp kg main variant algorithm synchron appli updat step condit distribut iter condit probabl updat comput distort base condit probabl previou iter asynchron variabl perform updat variabl set main differ variant updat asynchron updat incorpor implic updat variabl theorem asynchron iter equat converg stationari point optim problem appendix proof case converg proof gener case involv full version paper current stage proof converg synchron synchron updat converg kei question initi initi point lead solut describ determinist anneal procedur procedur work iter paramet adapt solut previou algorithm solut system shift prefer compress predict recal optim problem make independ parent point solut consist essenti cluster predict variabl suddenli reach point valu diverg show behavior phenomena system success reach addit phase transit addit split valu emerg gener idea anneal procedur identifi bifurc cluster step maintain set valu singl progress detect bifurc end procedur record bifurc tree trace sequenc solut valu figur main technic problem detect bifurc adopt method tishbi al multipl variabl solut previou step previou construct initi problem duplic defin initi solut condit probabl valu determinist anneal correspond system auto electron hockei compress factor symmetr inform figur applic symmetr bottleneck newsgroup data set inform word learn cluster hierarchi categori inform curv show progress inform tradeoff graph note word cluster preserv inform present data pose copi set term scale paramet copi perturb version high random perturb suffic copi diverg small support perturb version solut construct initi iter perform updat equat converg converg point behavior declar split distribut suffici valu declar incorpor bifurc construct repeat process stress anneal procedur heurist natur formal find global optima distinct advantag chart behavior system valu altern simpler approach prove origin ib formul emploi agglom cluster techniqu find bifurc tree bottomup fashion approach appli multivari case present exampl illustr idea examin applic symmetr parallel version bottleneck simpl synthet produc joint probabl matrix figur jaj jbj symmetr compress find natur cluster natur cluster sort joint probabl matrix solut illustr structur interest fraction inform preserv cluster present result fraction inform preserv ta fraction inform preserv tb amount preserv inform plot respect compress compact cluster figur present inform curv curv split current cluster set amount inform preserv relev simultan reduc compress cluster induc split find cluster ta tb split result cluster ta tb split find cluster ta leav tb cluster structur data due inform tb preserv split tb tb predict ta split ta split tb remain unchang split practic overfit effect real inform gain due split realist standard newsgroup corpu natur languag corpu articl evenli distribut usenet discuss group emploi evalu text classif techniqu group similar topic group discuss issu group discuss religion inher hierarchi group model domain introduc random variabl denot denot categori joint probabl compress factor parallel inform figur inform curv parallel compress newsgroup data set show progress inform tradeoff graph probabl random word document collect equal time categori document obtain joint distribut perform preprocess remov file transform word lower remov stop word word digit charact sort word contribut mutual inform categori variabl sort word log subset top word joint probabl matrix jw jcj symmetr bottleneck algorithm cluster dimens matrix set cluster tw cluster hierarchi found shown figur high agreement natur hierarchi construct word cluster high correl categori cluster word probabl word word maxim religi peac religion maxim cluster cluster figur gener map scheme object assign cluster normal probabl cluster typic approxim cluster cluster tw util aspect cluster deal word relev categori cluster word assign cluster word clinton assign word cluster deal polit word sexual assign lower cluster word deal religi issu data parallel compress case compress simultan cluster set word preserv inform categori variabl high figur present inform curv cluster set combin compress variabl inform independ jt jt preserv origin inform preserv preserv inform categori variabl discuss present gener framework data analysi framework natur gener inform bottleneck method immedi suggest bottleneck gener tool implement connect data analysi method explor gener structur iter procedur reminisc em procedur connect reduct ica parallel bottleneck construct decomposit import distinct contrast aim preserv inform specif aspect defin user suggest framework extract structur data numer wai explor simpl tip iceberg work addit applic framework includ analysi gene express neural code dna sequenc document comput linguist applic acknowledg work support part israel scienc foundat isra ministri scienc foundat support fellowship friedman support alon fellowship harri ab sherman senior comput scienc experi report run equip fund basic equip grant refer baker mccallum distribut cluster word text classif acm sigir aj bell tj sejnowski approach blind separ blind deconvolut comp cover thoma element inform theori john wilei hofmann probabilist latent semant index acm sigir page lang learn filter netnew int conf machin page pearl probabilist reason intellig system morgan san fc lee distribut cluster english word annual meet associ comput page rose determinist anneal relat optim problem tishbi agglom inform bottleneck advanc neural inform process system pp object spectral classif galaxi inform bottleneck method notic royal astronom tishbi document cluster word cluster inform bottleneck method acm sigir page tishbi power word cluster text classif european colloquium inform retriev research inform bottleneck method proc confer commun comput tishbi data cluster markovian relax inform bottleneck method neural inform process system proof sketch proof main theorem start theorem basic idea find stationari point subject normal constraint add lagrang multipli lagrangian differenti lemma lemma ju differenti mutual inform term note ignor term depend absorb normal constant term form fy collect term refer equat divid equat log log vx vt vt term depend desir form appli manipul write vx variabl independ transform term kl diverg extract term similar transform appli term deal rule rewrit jv jt involv ignor kl diverg subtract term vt appli normal constraint distribut desir equat turn proof theorem prove converg suffic prove stationari applic assign eq reduc lagrangian requir recal minim lagrangian minim lagrangian show introduc auxiliari subject constraint dag edg easi coincid vx vt space distribut consist properti lemma choic consist equal project assum modifi minim deriv respect equat consist log easi verifi hand side equat depend assign log result distribut stationari point respect easi verifi deriv respect point local minima conclud equal minim respect fix choic put project equal show updat step reduc lagrangian situat remain consist equat satisfi remain issu show iter asynchron iter eq project easili verifi compar eq
IR/432 5 special search engin confer snyder dr cw honour project depart comput scienc south africa februari abstract growth world wide web latest estim size made critic inform accur current gener search engin deliv project implement prototyp special search engin user submit queri confer speci eld return detail inform confer multipl exist search engin provid coverag inform internet interact multipl user concurr make achiev faster inform process goal make tool scienti commun provid research improv access confer inform discuss extens rank confer trip content introduct goal project system architectur design model server structur implement user queri extract search engin url construct search engin request search engin result confer page download confer page confer inform data structur format result html inform process featur detect titl date target featur extract date extract titl extract confer seeker perform coverag accuraci speed string comparison hash method futur work acknowledg detect filter implement class instal manual program list chapter introduct growth world wide web web access special inform tediou job accompani trait gener tradit search engin cover small slice normal index engin cover inform provid user amount data provid process acquir data appar inform confer scienti valuabl inform detail confer research good basi make present work method achiev intellig special search engin word agent add larg number attribut program scope internet commun heat intellig agent forefront current inform retriev technolog internet exhaust mine internet gener agent automat extract inform problemat agent consum network bandwidth inevit gener burden web server circumv assist agent assist agent target site prior search gener focu site mine site human assist argu special search engin biggest attribut exhaust autonom inform gather special search engin gather inform demand act direct assist agent make search engin internet environ robot special search engin approach coincid goal project current technolog search engin internet greatli incorpor nding inform inquiru normal keyword search frequenc measur search engin result search engin combin ect cover cyberspac deliv method nding inform advanc search engin appar statist search engin limit internet vast growth yearli special search engin target group user aim provid user detail inform speci subject order accomplish task cover greater search space detect reduc irrelev inform alarm ultim provid user detail repertoir result search engin base retriev relev special search engin built document systemat extract inform relev special confer search engin identifi common domain attribut document retriev identi cation extract lter plai big role develop project make search engin easili access econom viabl web site construct access provid thin server architectur implement studi made exist search engin understand user interact search engin search engin construct queri made user http search engin search engin server studi examin construct request paramet common mean context request speci search engin project inquiru extract inform document web introduc problem natur languag natur languag techniqu algorithm exhibit great diculti implement inher larg amount process discard favor design heurist combin element natur languag structur html document studi html document context confer site internet undertaken chaotic natur found structur document great deal time spent analyz document correl featur select desir target output examin produc target speci heurist combin form extract heurist outlin report chapter describ goal project chapter overview system design choic made chapter implement project discuss length chapter detail lter detect extract relev data investig chapter show applic discuss perform system made chapter report conclud futur extens chapter chapter goal project thin server architectur light search engin access applic ensur minim client commun client server low preserv network bandwidth system independ server system standard search engin server system make easi redistribut futur system hardwar upgrad system independ client applic recent browser serv client applic system ad avail applic interact search engin ensur coverag inform internet latest search engin basi extract confer link search engin result form search engin attain minim duplic link confer site retriev confer page detect relev confer page achiev faster process perform partli overcom low speed internet relev confer page extract target attribut fulli util capabl hardwar gener speed process orderli displai inform speci confer displai unnecessari detail inform larg detect rate confer small alarm rate extract inform attain larg sourc correct inform provid user chapter system architectur design chapter design choic made implement project overview system model part system interact part model ect special search engin model appli tted suit client side applic robust easili decid interact server made program wide internet access breath limit client interact server typic http sucient provid server inform method commun low client server minim network trac normal static html locat download browser client side provid user eld set set bundl request server server receiv request set temporari html le store result process server redirect browser le result user request figur overview interact client server server structur server handl request multipl make fulli system process server user request broken logic step shown figur step discuss detail chapter figur server di erent logic design modul server chapter implement chapter detail explan implement server data structur method attain system show close interact design model modular structur implement decid implement server java platform independ enabl instal server good platform develop applic support program java object give clean transit design implement make server modular easi extend improv speed mayor drawback java sourc code encod code interpret virtual machin drawback ed compil code nativ code speci server hardwar decid java nativ compil stabl futur server base java servlet speci cation enabl server load unload modul support speci cation support speci cation popular apach user queri extract server receiv queri paramet http browser format call format normal string format follow ascii charact remain servlet deriv popular java applet space charact convert sign charact convert string xy lower charact user queri strip url search case reconstruct normal string queri signal search engin url construct normal request made search engin http request made url format part common gatewai interfac commun webserv make request inquiru url built user queri usag kei word call narrow search result url perform search inquiru request http request typic url actual search engin queri paramet speci ed distinct search engin search engin inform format search result paramet thing amount hit total number speci ed inquiru lot time classifi mean search engin request larg detect search engin gain inquiru incorpor search engin decid inquiru suce good coverag internet abstract search engin object creat deriv class appendix speci search engin made accomod di rent search engin futur request made construct url request caught proxi server request back server authent request reconstruct includ user proxi password authent proxi server extract usernam password request http header http request made result html page save local server separ paramet valu paramet figur inquiru page show typic search result return inquiru search neural network part server request made search engin relev confer link inquiru limit boolean simul concurr request made boolean circumv make concurr request inquiru server ran thread section search engin result result shown figur load server relev link achiev html sourc scan recogn start point signal correct place start extract link return search engin link extract delimit reach sourc signal end result link lack standard output inquiru result dynam dicult accur determin point refer figur show handl thread download process confer page link check duplic extract save data structur design hold inform confer section confer page download internet speed real problem big concern context project serial download amount html page requir obtain requir time combin connect failur plain slow program wait statu code back http request upto timeout progress server volatil natur figur call paper html page show typic call paper minim html code pictur visual appeal intric page exist internet minim time consum natur extens figur show process involv encount problem larg amount thread download html http request specul concurr request limit number activ thread prede ned work maintain high throughput thread manag handl concurr thread thread aliv time thread nish download thread start di rent request inquiru fteen thread start sum thread total process context switch bene method internet speed factor typic sort server instal architectur program bene real concurr execut maintain rel minim number thread html page confer link download thread overview section method inform extract discuss length chapter confer page natur languag algorithm techniqu process amount text process decid fair amount knowledg text attain heurist incorpor aspect natur languag actual html tag html page shown figur download internet enabl faster process time page receiv html sourc token html tag text tag token direct heurist criteria page focu heurist attribut current text text scan detect lter determin relev target attribut extract lter sati ed attribut relev text extract save mutual confer data structur html page stop target attribut confer page extract thread stop thread manag handl execut thread confer inform data structur structur consist basic vector item di rent confer appendix confer link extract search engin element ad vector element confer titl import vector type class item date item encapsul import date exhibit speci confer url confer html page item date item class string date descript date structur protect simultan access ensur mutual typic lock java speci ed languag mean lock object object thread access object schedul lock object schedul thread gain access java term synchron format result html temporari result le store local server avoid clash light timestamp gener le inform extract confer result written le synchron appli output stream inform format html present neat orderli fashion user achiev redirect browser main process thread start browser refresh le ensur system deliv result intermedi inform process written le refresh stop chapter inform process chapter discuss di rent detect extract lter built small attribut bound text speci target confer attribut attent target attribut titl deadlin submiss paper featur detect method detect hierarch natur page view collect paragraph paragraph view sentenc sentenc word natur linguist build block di rent di rent detect lter de ned speci target extract attribut lter act build ultim de ne lter encapsul attribut confer encod de nition lter fairli simpl boolean valu repres lter boolean criteria detect sati es lter set lter target confer attribut activ program attempt extract detect sentenc plain keyword match combin html inform paragraph deliv lter lter count count capit word number paragraph found assist detect valid attribut titl extract titl confer hierarch structur built shown appendix keyword confer combin word fair indic titl sucient titl confer rst paragraph text complic fact html incorrectli delimit html page design visual nish html sourc problem heurist reli html tag de ne scope page titl capit word word sentenc ratio capit word titl titl confer mention titl heurist check titl lter reli heavili actual correct linguist punctuat languag case html page design rare maintain concept date number combin format month good indic date date written larg varieti format confer page inspect found date written mmm format date year appar titl inform page submiss deadlin detect lter structur shown appendix deadlin date keyword due date tting keyword date word deadlin detect target featur extract speci target indic import extract appli attribut extract method basi extract rest pass window amount word text ts detect attribut pro le date word exact format found window word insid window extract date extract found window word extract date mention format preval date detect extract save vector type date found paragraph date prime candid submiss deadlin date perfect criteria deadlin date immedi extract date found paragraph plai term relev detect submiss date relev determin detect lter method reveal inform date earliest date paragraph chosen refer desir submiss deadlin date titl extract extract titl dicult window size accomod titl titl sort inform acronym decid titl occur sentenc titl time delimit sentenc titl sentenc found extract titl confer includ inform part extract result html code confer document sourc result miss redund html tag bad design chapter confer seeker implement method discuss previou chapter extract inform return result user figur show client side applic access user provid subject interest confer submit server seek button figur show typic result return made subject queri neural network figur initi search startup page user contact server user enter queri seek result figur result pictur show typic result page deliv result origin confer search neural network chapter perform de ne type applic perform rate typic perform evalu program coverag cover confer internet accuraci extract inform larg accuraci speed deliv result reason time coverag problemat criteria rate perform dicult determin automat confer speci subject method make access confer speci subject rate perform number confer extract number confer human experi cloud human judgement inquiru return confer internet link failur subsequ search engin failur method coverag portrai percept perform accuraci determin accuraci extract actual confer page return scan manual involv html document inform extract extract correct inform extract easili determin hand prove bit dicult main idea titl easili rate extract titl extra word extract obtain result search neural network found link return inquiru ltere lter reduc link refer actual call paper html document rest html document inform refer confer call paper document relev inform mail thread post internet discard remain confer submiss date extract attribut extract link result dicult obtain manual scan html document result absent speed mention network speed problem problem includ contact search engin download confer page uenc system problem solv hardwar cach html document download discuss earlier section discuss process time confer page extract inform page text process string manipul process intens string comparison rst version algorithm normal string comparison java method compar amount time window pass text word compar number time window decid rethink method repetit decid hash method hash method hash tabl gener relev keyword detect extract lter hash sentenc sentenc portrai arrai integ integ valu compar integ valu hash keyword improv algorithm tremend integ compar faster string comparison hash work sentenc detect window pass save string comparison improv algorithm save averag speed reduc time singl html document millisecond averag number link save process time made system deliv result faster client applic perform pentium iii mhz di rent ve time chapter futur work achiev goal speci ed project provid good platform develop kind enabl multipl user access server request inform subject topic confer server achiev result develop improv object orient code written java provid platform independ code develop result search displai orderli call paper document access result html page develop research improv detect extract extract confer robust architectur implement rank confer qualiti includ futur extens project interact ight schedul diari system provid research commun valuabl inform confer add improv research chapter acknowledg dr direct support andr muller construct problem solv session bibliographi nec research inquiru sun java onlin apach softwar apach webserv java apach modul speci speci comput model human linguist memori limit process breakdown phd carnegi mellon sign web billion document robot threat april lawrenc page analysi improv web ieee internet vol pp lawrenc gener scienti inform ieee commun vol pp januari http base infrastructur mobil www intern www decemb mega search vol pp relev comput complex theori natur languag process mit pp selberg search comparison www onlin appendix detect filter figur depict detect lter relev inform html confer page show di erent boolean lter build nal detect lter figur titl target detect lter detect titl confer figur date target detect lter detect submiss deadlin date confer appendix implement class gure show java class implement project show relationship class demonstr design structur figur java di erent modul code project appendix instal manual chapter explain brie instal server machin linux window oper system make java jdk develop instal di rent version di rent oper system sun java java server develop obtain webserv support java servlet speci cation java java websit webserv host html page servlet easi great document instal servlet instal apach webserv obtain instal extra modul add servlet support java apach project document applic instal instal server oper system softwar server access webserv appendix program list appendix includ extens comment version sourc code latest explain code detail java le ae hash item date
DB/433 3 symposium oper system design februari automat hint gener specul execut fai chang gibson school comput scienc carnegi mellon pa abstract aggress prefetch effect techniqu reduc execut time applic manipul data larg infrequ found file disk cach automat prefetch approach base static analysi histor access pattern effect effect prefetch applic irregular access pattern exploit processor cycl left idl applic stall cycl dynam analyz applic predict futur access approach specul applic code order discov issu hint futur read access coupl aggress prefetch automat approach appli arbitrari effect irregular access pattern design implement binari modif call transform digit unix applic binari perform specul execut issu hint tip inform prefetch cach advantag hint file cach resourc evalu design implement applic tip benchmark suit techniqu perform surprisingli manual achiev reduct execut time data file stripe improv perform amount prefetch applic examin perform design varieti explain circumst fall short achiev applic manual modifi issu hint estim perform design affect widen gap processor disk speed research sponsor darpa order issu indian head contract addit support provid onr graduat member compani parallel data seagat storag wind river data logic introduct rang simpl text search util complex issu larg number file access request servic cach due dispar processor speed disk access execut time applic domin latenc disk access time improv applic receiv benefit rapid advanc processor latenc account proport execut time file system automat hide disk latenc file write perform buffer inform applic write request complet propag data disk automat hide disk latenc file read complic request data read return request data order move local local techniqu hide read latenc prefetch requir system provid bandwidth applic consum construct system capabl provid adequ bandwidth stripe data arrai disk facilit share multipl entiti file server network disk difficulti prefetch li accur determin prefetch prefetch consum cach data data prefetch request immedi data delai immedi data displac file cach effect altern manual modifi applic explicitli control prefetch discuss difficult optim problem mer automat significantli reduc execut time program provid automat method suffici time care resourc usag present approach automat prefetch potenti applic virtual applic effect exist automat approach applic irregular access pattern approach observ cycl applic stall wait system servic read request wast situat occur commonli desktop comput environ applic import acquir highperform server machin disk system millisecond access processor wast million cycl stall wide rang applic cycl dynam discov futur read access perform specul possibl erron code present design automat transform applic perform specul execut issu hint futur read access design advantag tip inform prefetch cach manag hint exploit file cach resourc implement binari modif perform transform obtain substanti reduct execut time applic tip benchmark suit data stripe disk automat obtain benefit obtain manual modifi applic issu hint examin perform design varieti explain circumst fall short perform achiev prefetch estim perform design affect widen gap processor disk speed paper organ section discuss previou prefetch mechan section present automat approach design transform applic section describ framework result section present futur relat prefetch background mention applic manual modifi control prefetch programm explicitli separ request data requir data issu asynchron call drawback asynchron size file latenc bandwidth level content file cach system affect ideal schedul request issu asynchron read oper system immedi issu disk request data call redesign applic issu asynchron programm implicitli make assumpt characterist system applic execut programm address issu sophist prefetch modifi applic issu hint futur read request modul consid dynam cach behavior system act hint section avoid problem manual modif manual modif requir sourc code manual modif involv formid program understand code gener read request determin code modifi applic benefit prefetch applic requir insert line code strateg applic requir structur reorgan support accur time prefetch expect modif made small fraction programm small fraction program automat approach desir widespread form automat prefetch sequenti perform oper system exploit sequenti read sequenti limit util file small sequenti access pattern sophist approach autom oper system gather inform past file access infer futur file request prefetch discov exploit access pattern span multipl applic implicitli recogn cycl prefetch object librari user edit sourc file appli applic approach approach inher limit tradeoff amount histori inform retain achiev resolut prefetch high resolut predict abil anticip irregular block access requir prohibit larg trace prior execut measur prefetch system reduc amount inform retain track type event frequent occur event system abil predict access applic access pattern vari wide run applic heavili system recur infrequ type approach autom prefetch approach consid factor determin specif applic stream read burden oper system requir maintain inform approach gener static analyz applic order determin read request transform applic prefetch occur static approach proven extrem effect reduc execut time applic approach limit hard static analysi activ separ core comput layer abstract call jump approach base applic perform specul essenti form dynam static captur factor prefetch system extract retain unlik static requir detail understand control data flow applic approach requir simpl static transform reli dynam approach easili advantag input data valu execut tip discuss prefetch cach depend dynam state system patterson cao benchmark improv descript text search object code scientif visual davidson comput physic tupl result sphinx speech recognit tabl reduct execut time applic manual modifi issu hint futur report patterson result obtain digit memori run digit unix data stripe disk stripe unit argu issu address separ access understand resourc alloc patterson applic issu inform hint futur access underli system make optim global memori make space prefetch data issu inform applic portabl machin sensit chang condit machin valid patterson design built inform prefetch cach manag replac unifi buffer cach manag digit unix kernel tip attempt improv file cach resourc perform analysi roughli tip estim benefit prefetch hint base accuraci previou hint applic hint balanc estim benefit estim cost estim cost block cach estim opportun cost system benchmark suit includ rang inform prefetch cach reduc execut time data file stripe disk tabl demonstr hint futur read access effect guid intellig prefetch cach advantag bandwidth provid parallel system result applic manual modifi issu hint involv significantli restructur code hint issu earlier obtain benefit prefetch research make demonstr benefit prefetch readili access autom gener inform hint design implement specul execut automat hint gener assum tip underli prefetch system retarget prefetch shown tabl paramet descript seg batch hint segment file fd seg batch hint segment open file cancel cancel outstand hint issu process tabl relev portion hint interfac export tip capabl batch hint specul execut discov read time recal standard unix read call file pointer length paramet tip hint interfac includ call directli analog basic unix read call modif tip addit cancel hint accomplish line code cancel hint call cancel prefetch request cancel specul execut applic continu execut specul issu read request miss file ordinarili stall wait disk read complet specul applic issu hint call encount read request order inform underli prefetch system data request requir hint data cach prefetch system believ prefetch hint data disk cach issu request hint data system parallel fetch hint data servic outstand read latenc fetch data partial complet hidden applic figur depict intuit specul execut work applic issu read request data process million cycl read request assum data distribut disk access latenc million suffici cach resourc store data applic fetch assum specul execut proce pace normal normal execut stall wait read request specul execut issu hint remain read request data layout hint data fetch parallel servic outstand read request subsequ subsequ read request hit applic execut time halv specul execut incur overhead incorrect data valu specul incorrect buffer data disk disk disk specul time normal disk disk disk normal read call hint call figur simplifi specul execut reduc stall show execut proce hypothet show execut proce applic perform specul execut stall order gener hint perform specul execut halv execut time outstand read request incorrect hint lead prefetch system make erron prefetch cach result disk busi read data servic request stall data cach identifi incorrect data cach identifi hint perform specul execut content machin resourc result normal execut experienc addit page miss processor cach miss content processor system multithread server multiprogram specul execut opportun improv perform design goal identifi basic design goal applic transform specul execut transform ffl correct result execut transform applic match execut origin ffl free transform applic slower origin applic ffl effect applic request data hint time minimum impact machin resourc design design requir special oper system support prefetch system strictli priorit kernel applic basic element current design addit kernel thread applic call thread specul perform specul execut applic thread stall ensur specul thread execut origin thread stall assign specul thread low prioriti select preemptiv schedul polici highest prioriti runnabl thread hint call issu specul thread encount read call ensur program correct wai perform specul execut potenti chang behavior applic specul thread share address space origin distort normal execut chang code data valu origin thread specul thread produc visibl chang impact applic system specul thread inadvert inappropri data divid access illeg disrupt execut applic ensur correct transform avoid potenti problem prevent specul thread produc visibl process specul thread issu system call hint call tabl call prevent inappropri data valu disturb normal execut instal signal handler catch except gener specul halt specul execut origin thread block read call prevent specul thread chang code data valu origin thread inspir softwar fault isol involv ad check add set memori alloc routin specul thread prevent specul execut introduc memori leak notic behavior applic inadvert alter depend dynam state locat access time file expect type applic uncommon load store instruct execut specul ad data structur track memori region copi copi resid store instruct execut specul check ad access data structur discov target memori region copi store redirect access copi memori region data structur store redirect newli creat copi load check ad access data structur discov referenc memori region copi redirect load obtain store respect specul execut load store instruct approxim averag instruct solut origin thread execut addit branch instruct avoid perform check avoid overhead make complet copi binari text section constrain specul thread execut call shadow code permit add check load store shadow origin thread execut addit instruct support minim addit instruct origin thread code path effort minim observ overhead support specul execut check perform add directli execut time simpli specul execut proce slowli normal overhead prefer design choic incur overhead incur observ overhead affect perform ensur specul thread execut shadow code static dynam check redirect control transfer possibl execut control transfer static resolv static redirect address shadow code control transfer static resolv includ dynam calcul jump switch statement binari modif tool recogn jump tabl static handl switch statement control transfer reli jump tabl recogn format control transfer static redirect call special handl routin origin intend target address argument origin intend target address shadow handl routin specul thread proce address address shadow code map address shadow handl routin redirect specul thread handl routin simpli prevent specul thread leav shadow code prevent progress specul discuss notic applic scheme specul thread execut newli creat modifi exist shadow code potenti advantag flexibl permit size memori region explor flexibl vari region size discov gener made differ perform improv obtain differ larger reduct perform region size result present paper obtain region gener correct time hint issu hint read call tip inform base prefetch cach issu hint earli ampl opportun hide latenc prefetch situat obstruct goal specul thread execut origin thread specul execut fall normal execut specul proce specul execut wast cycl catch normal execut issu hint hint read call includ long intermedi process specul execut catch normal execut specul thread proce incomplet state specul execut execut path normal execut specul proce specul thread hint futur read call gener stream incorrect significantli hurt perform explain begin handl routin map function redirect control transfer function comput goto statement section describ specul execut track hint issu correctli predict futur read describ specul execut track attempt specul execut track order benefit obtain prefetch pessimist approach specul execut track restart specul time origin thread block read mean specul thread execut return call origin thread block bound specul execut predict futur distanc progress singl unnecessarili limit potenti benefit specul execut attempt number correct time hint gener specul origin thread cooper restart specul detect specul execut track detect specul execut track accomplish specul thread record hint issu data call hint log origin thread maintain index hint log issu read check entri hint log entri hint origin thread specul execut normal execut track entri match read origin thread specul execut correct execut path point past track entri match origin thread specul execut track detect specul execut specul origin thread cooper restart specul order restart specul thread origin thread state origin thread detect specul execut copi valu regist data structur specul thread acquir valu set flag inform specul thread track work perform origin thread issu read request origin thread block read specul thread opportun run specul thread poll restart flag frequent flag clean current specul cancel outstand hint clear data structur specul thread restart specul load origin thread save regist make copi origin thread stack jump instruct immedi read system call shadow code ensur specul thread wast cycl execut origin thread ensur specul thread wast cycl restart specul execut reason track ensur specul thread perform incorrect specul issu erron address situat detect origin thread requir origin thread perform addit work check entri hint log save regist observ overhead small transform applic binari modif automat transform applic perform specul execut chose binari modif requir sourc code specul execut transform perform compil tool implement line code tool restrict digit unix alpha binari produc nativ cc compil static retain reloc inform perform loop significantli number check code tool remov shadow call standard librari output routin routin influenc futur read access requir cycl execut illustr figur applic object file librari link auxiliari object file librari support thread result binari transform link produc transform applic execut object gener line assembl includ dynam memori alloc routin specul thread routin handl control transfer static resolv section routin specul thread execut order restart specul section version combin place dynam check instruct modifi stack pointer static copi stack avoid check load store instruct stack pointer standard standard object file librari thread applic specul execut applic object file librari tool figur transform applic specul execut object file routin origin specul thread order support specul execut shadow code simul effect perform loop optim minim check standard librari routin evalu describ result tool implement design previou section modifi alpha binari digit unix thread support specul execut implement digit unix librari experi conduct main memori run digit unix standard unifi buffer cach manag replac tip inform prefetch cach manag facilit comparison patterson work file cach size set automat invok read prefetch approxim number block sequenti maximum block system consist hp disk averag access attach scsi data file stripe disk stripe stripe unit file system creat hold file experi test run file cach initi empti report result averag run facilit comparison manual modifi applic testb benchmark applic evalu effect approach benchmark applic tip benchmark suit fast pattern match program applic loop file command open read file sequenti argument complet stream read access perform search digit benchmark modif transform time execut size size kb kb kb tabl transform applic statist unix kernel sourc file occupi disk block simpl string occur file free softwar foundat object code input object file command line read object file file symbol symbol tabl string tabl locat file symbol header store file locat symbol string tabl store symbol header make read object file gather debug inform locat read determin symbol tabl loop section object read section object file process data order produc output execut binari link produc digit unix kernel data visual packag user view arbitrari slice data set origin applic limit data set fit patterson modifi applic load data dynam larg data set retriev random slice slice patterson data set number resid disk space transform applic applic binari transform memori unoptim research prototyp shown tabl modifi benchmark applic reason amount result binari process standard produc specul execut unlik origin applic shadow librari support thread addit result execut size perform result shown figur perform specul execut significantli reduc execut time time origin specul manual figur perform improv origin correspond specul correspond applic transform perform specul execut hint manual correspond applic manual modifi issu hint read call issu applic invok oper system sequenti polici begin section time origin specul manual figur runtim overhead support specul captur run benchmark tip configur ignor hint benchmark applic automat achiev perform improv obtain applic manual modifi issu hint gain manual modifi repres substanti improv origin applic base rel specul execut effect techniqu exploit disk parallel underutil processor cycl reduc execut time applic tip configur ignor applic perform specul execut slower origin applic shown figur figur captur factor contribut benchmark read call read block read byte write call write block write byte total hint inaccur hint manual hint total hint inaccur hint manual hint total hint inaccur hint manual hint tabl hint statist total includ explicit file call hint behavior specul applic hint inaccur hint compar behavior manual modifi applic issu inaccur manual hint figur number read call larger number read block issu extra read call file detect end file discount read read call hint manc specul applic potenti neg effect erron hint factor includ memori overhead check hint log entri issu read overhead execut initi routin spawn specul thread perform analysi establish specul execut achiev perform examin behavior specul applic attempt explain differ result obtain manual modifi applic primari metric automat hint gener number correct hint gener tabl summar hint behavior origin transform applic found specul execut issu hint read call manual modifi applic specul execut significantli success hint read call contrast manual modifi applic hint basic reason specul applic hint fewer read call manual modifi applic specul applic determin hint pursu hint discoveri normal execut stall successfulli specul applic gener hint hide opportun pursu hint applic reason data depend limit earli prefetch issu data read call depend data return outstand read specul execut hint read call applic affect fact hint discoveri perform stall largest median number cycl read call largest ratio median number cycl hint call median number cycl read call call dilat larger due check perform specul execut specul gener hint slowest rate equal gain achiev specul manual modifi properti design neglig impact process manual modifi applic issu programm make applic amen prefetch restructur code number cycl depend read call mention section case manual modifi specul produc unmodifi code hint read call specul applic hint read call depend prior read stall prior read complet read call issu read hint data depend data depend hint issu late fulli hide latenc fetch data compar specul manual modifi time data block partial prefetch request applic shown partial column tabl indic specul experienc stall specul proce assumpt futur read call data data depend erron hint benchmark cach prefetch prefetch block cach block read block fulli partial block origin manual origin manual origin manual tabl prefetch cach statist prefetch figur result oper system sequenti polici specul prefetch figur includ tip prefetch cach block read number block read file cach prefetch block number block prefetch disk fulli number block prefetch complet request partial number block partial prefetch request number prefetch block access applic file cach cach block count time cach block servic subsequ effect cach close cach block figur erron prefetch significantli harm cach behavior gener specul gener erron shown tabl contribut prefetch data shown tabl prefetch mechan properti digit unix aggress automat polici base expect file read sequenti prefetch approxim number block read maximum block applic issu read larg polici aggress shown tabl block prefetch sequenti polici invok read call hint gener hint read hint elimin erron prefetch gener polici perform addit gener specul execut desir perform effect specul thread shadow code perform specul applic larger memori consum memori experi page fault origin applic tabl show memori footprint kb number page reclaim number page fault specul applic gener extran signal specul execut erron data calcul tabl show specul applic gener extran signal benchmark footprint reclaim fault sig origin kb kb manual kb origin mb mb manual mb xd origin mb mb manual mb tabl perform specul execut footprint maximum amount memori physic map behalf applic time reclaim number page fault number page gener applic page reclaim occur referenc page memori physic requir oper system requir disk access evalu page physic determin lru polici sig number signal gener applic signal segment violat float point except addit page reclaim page addit occur origin thread block overhead section observ overhead perform captur runtim observ hint disabl vari file cach size report result manual modifi applic obtain mb file cach measur sensit result file cach size run benchmark smaller file larger file cach cach size affect perform sequenti polici prefetch data access larger cach size data remain memori futur access benchmark file cach size mb mb mb origin manual origin manual xd origin manual tabl time applic file cach size vari percentag perform improv rel applic shown tabl perform improv significantli cach size reduc benefit obtain prefetch specul achiev benefit cach read call gener hint longer requir read call unabl hint continu stall data sequenti seldom fetch data access cach size affect benefit obtain hint applic vari parallel arrai wide test singl disk configur smaller larger arrai shown tabl applic unabl deriv benefit addit disk shown figur benchmark receiv significantli benefit specul execut disk prefetch overlap comput perform specul degrad disk erron prefetch consum scarc delai servic applic demand request discuss section simpl mechan emploi address problem object assumpt applic run machin disk arrai compet task run processor disk attach machin share server shown tip system effect extend client prefetch distribut file server multipl disk client rich excess processor cycl shown figur benefit hint applic runtim parallel benefit obtain manual modifi applic monoton benchmark number disk xd tabl time applic number disk vari number disk improv specul manual specul manual specul manual figur perform number disk vari number disk applic issu hint advantag addit disk benefit specul applic mirror manual modifi applic disk configur due dilat factor discuss section specul execut ahead normal execut issu suffici hint disk busi data depend limit hint specul applic util addit disk specul execut gener hint advantag addit parallel rel processor speed due rapid improv processor gap processor speed latenc continu widen number cycl progress specul execut make singl stall predict impact trend effect modifi stripe delai notif complet request simul effect doubl gap processor disk doubl time system notifi request scale result measur half disk posit time data rate improv obtain desir effect perceiv servic time prefetch configur limit number prefetch request outstand disk processor speed disk speed improv specul manual specul manual specul manual figur result simul widen gap processor disk speed speed ratio result current environ data rate improv year simul artifici slow transfer rate disk perform delai access physic sequenti faster model transfer rate simul result shown figur improv obtain manual modifi applic steadili perform limit bandwidth process time small percentag execut time curv specul applic similar manual modifi offset case specul execut gener hint disk busi time data independ processor prevent specul execut addit cycl stall hint read call sophist design advantag addit cycl prove loosen current definit mean specul execut track applic depend recent read valu deriv addit benefit faster processor rewritten newli read data affect futur read interven disk request recal section specul gener hint disk busi current platform speed ratio allevi problem ratio perform improv specul manual modifi futur work successfulli demonstr specul execut autom hint work refin design handl applic discov mechan disabl specul execut time number cancel request issu suffici elimin perform penalti perform specul execut system offer parallel explor gener method limit number erron hint reduc neg impact erron hint investig specul execut effect emploi rang scenario develop method evalu effect specul evalu decid schedul consum share machin resourc multiprocessor environ offer excit possibl biggest challeng propon multiprocessor enabl applic util addit process resourc perform specul execut parallel normal applic automat parallel compil techniqu advantag addit process capabl multiprocessor relat work section discuss static approach autom inform hint tip prefetch cach manag work reli static make dynam inform provid oper system approach appli hint affect virtual memori manag file cach manag hint differ compil place hint base static prefetch reli tip manag schedul prefetch research present robinson close spirit demonstr transact order prefetch data lock significantli throughput reduc effect concurr simul assum correct data prefetch correct lock approach differ primarili aspect reduc transact run complet transact intent commit overlap secondari normal execut explor concurr control techniqu manual design implement system essenti properti work abil automat transform applic idea ad softwar check load store instruct brought attent check perform softwar fault fast altern memori protect check complex costli order implement increasingli common faster comput larger storag encourag user manipul perform determin storag processor perform parallel storag system increasingli applic exploit aggress prefetch simpl effect util storag parallel reduc applic provid suffici detail predict futur access made suffici earli paper extend aggress prefetch research automat hint gener techniqu base specul applic state invok applic stall wait specul execut add observ overhead applic provid cycl time specul execut discov futur read access issu hint aggress prefetch system design implement binari modif tool transform digit unix binari automat perform specul execut appli text search visual system demonstr reduct execut time arrai principl limit current design lack effect automat mechan limit penalti erron hint due data depend larg success design demonstr specul execut approach aggress prefetch acknowledg david nagl digit equip corpor provid paul set hardwar david jim assist tip digit robert invalu discuss john anonym feedback earlier draft paper tip develop hugo tool inspir project steve implement softwar fault isol tool digit unix refer mari al measur distribut file system octob darrel long distribut disk stripe provid high data rate comput system fall ew li implement perform file cach thoma cormen alex preprocessor tr depart comput dartmouth novemb km krishnan js vitter practic prefetch data compress rj ei system pa jt robinson concurr control high content environ acm pp june al storag architectur asplo reduc file system latenc predict approach summer june john stripe network file system doctor decemb david kotz elli practic prefetch techniqu parallel file system decemb long predict file system action prior event winter januari hui lei dan analyt approach file prefetch winter januari mk al fast file system unix acm pp august todd automat prefetch applic octob jk al analysi unix file system decemb kennedi compil support arrai data parallel machin symposium frontier massiv parallel februari david gibson randi katz case redund arrai disk sigmod june hugo patterson gibson concurr inform prefetch pdi hugo al inform prefetch cach sosp hugo patterson inform prefetch cach doctor decemb michael powel demo file system novemb david gibson prefetch earli experi acm sigmetr perform evalu pp decemb compil data parallel program distribut memori machin workshop parallel comput april ks analysi robert al effici fault isol decemb
IR/434 5 world wide preval perform implic kelli electr engin comput scienc michigan ann arbor mi usa occur web transact request url elicit repli ident data payload cach reason suspect web author tool web exist research preval transact impact perform larg cach hierarchi paper quantifi perform impact extent larg client trace network fewer repli payload multipl success transact involv payload payload account set payload byte transfer account roughli browser cach miss proxi miss workload assum cach perform impact similar larg proxi trace compaq corpor explain larg number redund payload transfer report system redund transfer repli metadata browser cach manag discuss simpl protocol extens complet elimin redund keyword world wide hypertext transfer redund duplic duplic transfer resourc rate hit miss perform law introduct occur web transact request url yield repli ident data payload exist browser proxi perform cach lookup redund payload transfer repli payload satisfi current request receiv cach current url awar problem slowli grow commerci major cach applianc vendor encourag site design make web page avoid page advic exp copyright held usa acm jeffrei mogul compaq western research lab avenu palo alto ca usa move web opposit direct control individu site commerci web design tool typic includ larg number small imag bundl tool url site technolog creat potenti reduc cach scale consequ phenomenon previou studi consid preval web perform impact cach hierarchi larg product wai elimin redund transfer web workload trace research collect illumin relationship request url repli describ payload suffici detail paper quantifi impact browser proxi cach hit rate examin larg anonym client proxi trace network septemb compaq corpor earli trace includ messag digest repli detect investig primarili larg gap actual potenti client cach hit rate report redund payload discuss simpl elimin redund terminolog term requir data carri bodi http code code extrem complic discuss payload cach refer cach payload origin server return time messag exchang origin server request payload payload transfer payload refer correct payload obtain cach origin server remot intermedi context trace web payload access url entir trace simul cach violat semant transpar rfc cach suffer payload miss return payload origin server return moment access term relat lack definit avoid discuss work relat work studi directli address central investig aspect http namespac impact cach perform section review literatur relationship url repli payload resourc modif complement request ident url yield repli bodi direct implic cach consist object resourc modif extens studi section compar preval resourc modif report transact affect dougli al report rate resourc modif trace corpor environ high substanti reduc hit rate convent cach brewington cybenko burden modif rate place search engin fit combin exponenti model report roughli interv dai roughli dai doctor thesi consid problem monitor chang inform resourc greater theoret empir depth research base poll url obtain user request notif resourc reflect sampl resourc atyp rate chang padmanabhan analyz dynam content modif delet web site report median interv approxim note alter file minor resourc expect chang frequent call term blur distinct process cach implementor research emploi heurist identifi sign dynam gener impli resourc request al report deem repli larg trace collect washington zhang report custom dynam content render roughli object trace work cast doubt assumpt pointless cach seemingli content report previou access url return case absenc request presenc affect repli payload return subsequ access repeat access queri resourc site return ident payload iyengar challeng exploit dynam repli busi web server report impress perform gain smith al report dynam repli cach hit rate workload al incorpor observ resourc popular modif rate analyt model hierarch cach model illustr impact resourc modif rate cach hit rate suggest cooper cach scheme yield diminish return client popul mirror typic refer special case replica page entir site made url shivakumar investig mirror larg crawler data set report client repli bodi access url bharat al survei techniqu identifi mirror internet bharat broder investig mirror larg crawler data set report roughli popular host mirror extent broder al approxim mirror introduc sophist measur document report similar document larg crawler data set ident document simpl domin form similar workload duplic suppress dougli al report record corpor result instanc resourc ident instanc resourc address perform problem duplic http distribut replic protocol emploi payload digest avoid unnecessari data transmiss replic http client obtain digest indic current state client request resourc copi obsolet mogul review varieti scheme involv suppli origin server client cach elimin problem redund payload simul demonstr scheme yield improv hit rate byte hit modest gain upper assum full particip origin server santo spring describ gener techniqu elimin redund traffic cach packet payload transmit digest thereof avoid redund transfer al design network file system environ perform similar oper chunk file traffic server proxi cach product includ techniqu call payload digest avoid store multipl copi ident payload content fingerprint suppress duplic network al describ similar scheme methodolog order evalu perform impact cach requir detail record transact larg client popul synthet workload gener surg design mimic inappropri log server reflect larg number record evalu client proxi cach order record transact involv larg number user research typic emploi packet proxi log cach proxi complic approach locat cach proxi fail record request serv proxi cach log cach proxi suffer log necessarili reflect payload origin server proxi serv stale content payload origin server cach hit trace collect proxi fail captur user request hit client cach problem convent proxi log includ inadequ poor clock synchron proxi arrai avoid problem collect trace instrument captur user refer instrument browser collect trace small user popul difficult instrument popular browser todai sourc code client proxi collect data main problem data collect difficulti larg client sampl collect anonym trace emploi proxi proxi mark repli send effect disabl browser cach proxi maintain suffer problem sourc code proxi instrument collect data ordinarili log payload rare occas log modifi proxi past discuss trace collect refer proxi collect larg trace larg user popul reason cost trace compar size largest trace http namespac investig unlik crawler client trace support simul cach hierarchi harm practic current http specif long complex server fulli complianc product improv time unnecessari cach miss kind wast fulli compliant behavior lead redund payload transfer mechan introduc improv cach correct lead reduc perform ident data payload serv singl site accompani entiti tag attempt fail request server compliant effici implement common practic violat protocol complic http namespac harm wai content provid emb session identifi url cooki ad rotat creat minor variant html web inflat resourc modif rate padmanabhan document type minor occur frequent site summari exist literatur touch number issu surround preval phenomenon transact impact miss rate full trace reduc trace client server ip address server hostnam url uniqu payload pair transact byte transfer total uniqu payload tabl trace summari statist level cach hierarchi poorli understood proxi trace emploi empir web cach research shed light record data payload digest thereof data set collect web crawler includ payload digest support simul cach illumin resourc access resourc trace section suit investig reflect client request server repli product environ trace analyz anonym web client trace collect network septemb summar tabl trace span sixteen dai reflect million refer million resourc client collect special instrument section refer proxi record request serv silent browser cach paper success code transact trace exclud transact involv payload accur size account slightli transact reduc trace summar column tabl due differ procedur summari statist tabl differ tabl refer earlier paper associ payload singl size includ protocol overhead present studi add length median header size earlier paper maximum field observ transact involv payload client devic enabl web surf convent set reli telephon modem oper roughli kbp import featur trace reflect activ browser proxi cach disabl data client http featur rang delta encod repli bodi anonym messag digest repli bodi featur crucial present illumin relationship url data payload return result specif access url instant featur ensur payload record transact return directli origin client server hostnam url uniqu payload pair transact byte transfer total uniqu payload tabl compaq reduc trace summari statist chanc proxi serv stale payload cach nice featur trace identifi complex heurist data collect poll crawl shed light focu request stream order evalu cach perform impact client trace essenti order evalu impact cach hierarchi client trace attract reflect workload product environ control singl perform enhanc suggest workload analysi easier implement environ web system peculiar reason suspect surf differ systemat convent rich client evalu perform implic larg proxi trace record compaq corpor network detail refer summar tabl compaq trace payload browser cach enabl reflect browser cach miss compaq trace evalu impact browser cach perform reduc compaq trace small number erron transact exclud trace characterist trace larg term number client transact term sum distinct payload size trace roughli gb time trace cach product compet benchmark capac cach gb median size gb workload fill largest cach work set imposs larg standard septemb bank modifi proxi collect trace total capac roughli gb sum distinct payload size request typic client trace moder larg excess median client receiv mb distinct client devic gener trace larger browser cach section browser proxi cach suffici larg suffer capac miss popular distribut url repli bodi affect cach shown figur number client host tabl due lost backup tape repli bodi url rank popular figur refer count url repli bodi refer count url uniqu payload count zipf α zipf β tabl trace zipf paramet web workload studi date popular distribut url distinct data payload tabl report zipf paramet popular distribut url repli obtain fit data linear model form log algorithm refer zipf α paramet client trace remark close uniti al report similar find boston client trace zipf paramet higher server lower proxi interest analysi zipf α vari level cach padmanabhan al discuss implic popular distribut cach comput zipf α paramet payload popular distribut client trace figur show distribut α subset client client request thirti distinct payload exclud hand client number distinct referenc payload client model fit good figur displai separ distribut group remark featur appar figur client zipf model describ popular access payload α trace proxi serv roughli lower individu client refer stream present theoret explan α higher share proxi client α notic higher client zipf model fit close figur show cumul concentr refer url payload sort descend order popular top percent payload account transact top ten percent account url figur concentr refer client trace stronger proxi fraction client α fraction client payload quartil payload quartil zipf paramet α figur cdf zipf α client cdf trace figur al browser cach filter refer refer origin client refer local concentr markedli lower refer stream reach proxi figur refer server proxi refer concentr trace repres studi gener trace repres web gener compar data set trace prior literatur term zipf paramet mime type distribut tabl show median bodi size recent trace set compaq trace roughli span rang mean fraction refer repli bodi url fraction item figur concentr refer trace set median http compaq berkelei home ip hp cabl modem washington avail tabl size trace transact payload mime type count byte count byte tabl mime type distribut trace hp cabl modem trace size similar slightli smaller berkelei consist slow final hop environ compaq size inconsist washington broadband environ cabl modem size larg tabl show fraction byte work set popular mime type account categori shown term transact byte trace roughli similar workload report trace tabl dougli al jpeg file promin client client cach handl jpeg access trace term distinct html preval trace practic logic page multipl html common septemb novemb partli explain differ al collect larg web trace washington packet figur refer report distribut mime type trace imag file account transact byte transfer due client cach washington campu basi quantit compaq trace paper consist recent trace preval transact record pair request url repli data payload repli payload exist record repli payload url url modifi url modifi url uniqu payload payload pair transact modifi url payload payload size rang median sum sum transfer size median sum sum tabl reduc trace statist exist transact url repli payload payload number distinct url transact url number distinct repli payload trace payload modifi url greater shown tabl transact involv transact involv payload account byte transfer workload observ suggest redund transfer redund network address issu section tabl show payload payload constitut work set cach scheme elimin wast storag due yield modest benefit appli workload note trace made cach transact tabl typic avoid tradit client cach cach reduc total number fraction payload refer stream depend payload experi local specif cach configur investig issu distribut payload url trace shown left figur fewer payload access url similarli url yield distinct payload analysi preval modif number time pair occur trace plot center show distribut payload url weight refer count transact involv modifi involv affect transact resourc modif plot show distribut byte transfer payload byte million success transact payload fraction url chang ratio payload alia ratio url chang ratio ratio figur cdf chang alia ratio transact payload payload mime type count byte count byte tabl preval mime type trace access url previou access payload million transact involv payload previou transact url preval exce resourc modif note impli cach miss resourc true simul address question dougli al comput url fraction access return data payload previou access comput payload analog defin fraction access made url previou access distribut chang ratio alia ratio url shown figur figur show payload url modifi figur show alia ratio gener lower chang ratio payload alia ratio url chang ratio attribut techniqu meant elimin redund transfer cost cost subset benefit alia elimin reduc cost similarli reduc benefit fraction item repli bodi url fraction transfer involv item url repli bodi figur cdf payload url cdf transact url payload involv cdf byte transfer payload involv tabl show preval popular mime type trace tabl sort order tabl roughli payload serv mime case defin type common type common midi midi payload access midi transact involv payload tabl show midi account traffic transact gif file account transact byte transfer trace roughli gif transact involv payload fact impli half transact involv gif payload preval html jpeg account roughli transact byte fewer transact involv html jpeg payload techniqu attempt elimin redund payload transfer appli mime imag subject frequent type seldom suffer burden addit overhead examin relationship payload size figur show distribut involv size payload trace top row distribut show transact byte transfer due tend smaller counterpart examin mime type gener hold slightli larger payload size jpeg transact html traffic techniqu attempt elimin redund payload transfer add minim number header bia small payload impli potenti benefit easili singl ident content site case path compon url tabl exampl possibl decid focu effort remedi site replac mirror strategi introduc http namespac site administr avoid type advic white paper fraction traffic due payload mirror content path tabl site design widespread commerci web design tool type control individu site occur popular tool uniqu imag file filenam web author tool contribut type type raw trace anonym type distinguish reduc trace empir work omit anonym ab path prevent distinguish type identifi case url ident versu host distinguish type varieti payload payload access fall categori tabl payload account transact involv payload byte transfer payload access url host remaind case url ident host perform implic quantifi cach perform penalti compar payload miss rate convent cach compulsori payload miss rate explain account differ compulsori payload miss rate repres achiev upper bound perform suffici larg cach explain section term payload obtain fetch section assum cach requir remov polici suffer capac miss assum cach semant cach hit suppli mime type jpeg byte jpeg mime type html byte html byte mime type mpeg byte mpeg figur cdf payload size payload popular mime type solid line transact involv byte dash line horizont scale ident show payload size byte payload origin server easili achiev practic breviti discuss fresh check section abstract cach model convent cach store recent receiv data payload associ request url cach suffer compulsori payload miss access distinct payload payload miss receiv payload satisfi current payload cach associ current request url design cach wast storag multipl copi payload due principl design cach suffer compulsori payload miss infinit construct cach assum cach comput messag digest store cach maintain index map digest valu store messag receiv cach digest comput messag sender proxi origin cach avoid payload transfer store copi payload strategi cach forev payload receiv verifi digest lookup approach ensur current request serv cach requir payload receiv compulsori miss miss due namespac section sketch realiz protocol design avoid redund payload transfer manner present simpli note compulsori payload miss rate repres upper bound perform upper bound achiev practic figur cach process request conceptu maintain cach receiv index url index payload digest note omit consist check pseudocod breviti clariti order ensur semant speci cach perform check verifi payload obtain cach convent hit ident origin server return cach differ suscept payload miss account differ payload miss rate convent cach compulsori payload miss rate inher refer sequenc compar quantifi fraction convent cach correct payload convent compulsori send url receiv payload payload cach correct payload convent send url receiv payload digest correct payload alia proof send compulsori send receiv payload payload payload figur cach index cach payload miss due simul result comput compulsori payload miss rate payload miss rate aggreg browser cach popul share proxi cach serv proxi serv infinit browser proxi serv infinit browser cach tabl show includ percentag infinit payload miss due tabl separ report cold warm proxi simul dai transact trace warm simul proxi report warm client result time client cach equal point client issu request issu result show larg number payload miss convent cach level cach account client payload miss proxi payload miss client emploi cach prevent redund payload payload miss account network traffic proxi traffic reach proxi serv client row tabl show simul payload miss rate payload miss rate share simul ignor forbid payload cach requir payload repli carri simul cach direct impact payload miss rate neglig proxi serv compaq workload result warm simul cach million transact tabul payload miss rate base subsequ transact compaq result roughli similar account roughli payload miss traffic extend simul model finit cach size result lie result explain redund transfer origin motiv investig explain high rate redund payload transfer report system studi show actual client payload miss rate higher predict simul model includ compulsori capac payload miss redund transfer result faulti metadata suppli origin server inappropri browser cach discuss section account substanti fraction redund payload transfer investig remain possibl subject ongo offer tent observ inappropri metadata frequent repli form repli server payload entiti tag curiou phenomenon attempt fail result redund payload transfer research explain larg server farm fail harmon entiti tag server replica mogul investig erron http timestamp larg trace report imposs date header imposs valu timestamp error transpar needless report kind timestamp repli header resourc repli bodi anecdot evid suggest web design tool encourag content creator associ reason expir date page unfortun commerci site incorpor busi rule modifi busi practic rare origin server sourc faulti popular proxi updat cach object header perform browser cach effort avoid serv stale content user truncat expir date maximum evict expir item condit request browser design compli letter spirit strategi prevent transpar failur expir date overli optimist simplifi implement client inflat client miss rate futur work intend quantifi rel contribut faulti metadata browser cach polici redund transfer payload miss rate payload miss rate simul cach due due index compulsori index compulsori cold client cold proxi serv client client client warm proxi serv client client client cold compaq cach client warm compaq cach client tabl compulsori payload miss rate payload miss due avoid redund transfer section abstract model cach sketch realiz practic protocol extens http design appli equal redund payload includ limit call design transfer dtd appli client proxi cach behavior tradit http cach cach cach find hold entri request url cach miss cach issu forward request url origin send payload cach hold expir entri send view resourc return payload real http cach differ abstract model defin section implement suffer redund transfer result inappropri metadata section infinit cach retain storag payload tradit http cach treat valid cach entri cach differ ideal implement updat polici store recent payload receiv replac polici store finit set select maximum expect concept duplic transfer detect ideal cach receiv receiv avoid transfer payload cach suffer compulsori payload miss realiz dtd suffer capac miss cach receiv payload server send entir dtd model abstract cach section cach maintain set cach entri lookup index index digest store payload dtd cach find fresh entri request url forward request origin server server repli send digest cach check store entri match digest digest cach signal server send payload server send http messag dtd avoid request messag header payload miss defin section avoid redund payload transfer occur dtd prevent payload transfer occur convent cach infinit dtd cach store payload receiv delet payload storag simpli receiv payload url finit dtd cach eventu delet payload base replac polici dtd cach benefit retain cach entri cach replac updat algorithm specul entri yield futur dtd hit practic issu dtd practic implement dtd requir solut problem mention problem defer discuss defin dtd compat extens futur paper client detect dtd avoid payload server send header defer send payload client send explicit request altern server send payload stop client send messag http extend support model extra time compulsori capac send payload byte intric form model amort delai model addit abort messag fail reach server time good tradeoff requir work choic digest algorithm requir tradeoff algorithm resist malici digest consum header byte cryptograph hash algorithm properti similar dtd analogu approach santo spring approach avoid redund data transfer elimin approach elimin transfer common prefix slightli dtd suffer potenti ing http approach differ adopt techniqu easier deploi organ control network techniqu prefer singl organ control level cach hierarchi client proxi cach aol summari analysi recent web client trace reveal occur frequent web transact cach scheme prevent storag wast due yield modest benefit workload payload account small fraction work set simul result demonstr account larg fraction payload miss suffer convent cach serv workload roughli payload miss browser cach payload miss infinit share proxi serv infinit client implic alia suppress mechan offer substanti order evalu synthet workload gener standard benchmark attempt mimic redund payload describ simpl complet gener elimin redund duplic transfer detect futur work intend quantifi rel contribut faulti ineffici cach manag problem redund payload describ greater detail latenc bandwidth save achiev dtd acknowledg network studi stuart arnold de jai list gather david describ client cach work western research lab gave access trace gener equip uc san diego lent addit system time cooper jeff michigan ai provid comput support servic explain puzzl phenomena observ brian davison dave pennock direct relev literatur perform tabul data set investig repli header size cooki size martin hp lab answer statist question mark manass appli birthdai paradox peter guid research michigan john anonym review care read draft detail comment improv work substanti refer jr analyz web robot impact cach proc web cach june jin workload web proxi cabl modem environ technic report hp cach web proxi comput feb crovella gener repres web workload network server perform evalu proc acm page juli bharat broder mirror studi host pair replic content proc www comparison techniqu find mirror host www proc workshop organ web space acm confer digit aug shenker web cach evid implic proc ieee brewington observ chang inform sourc phd june brewington cybenko dynam proc www syntact cluster web proc www apr person commun http log consid harm posit web group nov corpor white creat web apr pitkow strategi web comput network isdn apr cooper rfc http june crovella characterist www trace technic report boston cs juli davison web traffic imperfect resourc evalu proc annual conf internet june person commun improv proxi cach cach replac polici technic report hp oct mogul rate chang live studi world wide web proc page dec continu onlin extract http trace packet trace proc web group rabinovich perform web proxi cach heterogen bandwidth environ proc ieee mar rfc hypertext transfer june fisher person commun gribbl brewer system design issu internet middlewar deduct larg client trace proc page dec iyengar challeng improv web server perform cach dynam data proc page dec jain art comput system perform analysi kelli web access measur comput mar tool explor web perform proc web cach june krishnamurthi protocol complianc longitudin studi proc page mar nov patent object sept chang content distribut assembl technic report worcest polytechn mar mogul error http header valu technic report compaq western research dec mogul analysi duplic suppress http technic report compaq western research nov mogul squeez bit http cach ieee krishnamurthi potenti benefit delta encod data compress http technic report digit western research dec van hellerstein rfc delta encod jan faq cach mechan apr network file system proc page oct nation institut standard technolog secur hash standard fip pub dept apr cach metadata updat post mail oct padmanabhan content access dynam busi web find implic proc acm page aug flanneri numer recip cambridg wessel offici report technic measur oct santo effect link bandwidth suppress replic data proc usenix annual technic june shivakumar find document web proc workshop web mar zhu exploit result cach dynam content proc page oct spring techniqu elimin redund network traffic proc acm page aug person commun van http distribut replic protocol technic report world wide web aug web examin web resourc proc web cach apr understand web resourc server improv cach proc www studi impact complet server inform web cach proc web cach levi analysi share cach proc levi scale perform cooper web proxi cach oper system dec origin sosp zhang web object technic report boston cs aug
IR/435 5 intellig system mine inform extract rule web page domain knowledg seo hci advanc institut korea yang choi depart comput scienc korea abstract previou research automat inform extract experienc difficulti acquir repres domain knowledg cope structur heterogen inform sourc inform sourc complex document structur correctli analyz order resolv paper present method build intellig system mine inform extract rule web page domain knowledg system automat gener wrapper inform sourc perform inform extract inform integr appli wrapper sourc domain knowledg wrapper repres xml document flexibl test prototyp system inform claim creat correct wrapper web sourc facilit effect inform extract heterogen inform sourc introduct inform extract process identifi fragment document constitut core semant inform extract system reli extract rule tailor inform gener call order cope structur heterogen inher sourc wrapper defin program rule understand inform provid specif sourc translat regular form agent wrapper special inform sourc system extract rule written human manual wrapper construct scalabl human develop describ extract rule inform sourc newli creat structur chang user limit obtain compar inform inform sourc overcom wrapper suggest automat build wrapper learn set sampl page method wrapper technolog extract specif inform heterogen inform sourc previou inform extract system effect manipul inform sourc due difficulti acquir repres domain requir user involv prepar train exampl obtain extract order resolv paper scheme build intellig system mine inform extract rule web page method automat gener wrapper inform sourc extract specif part inform appli wrapper sourc wrapper gener algorithm recogn mean logic line sampl document domain find frequent pattern sequenc logic line wrapper construct base posit structur pattern kei featur scheme domain knowledg wrapper repres xml document approach modular flexibl provid formal wai repres extract facilit simpler implement emploi xml parser interpret inher xml fulli exploit make wrapper portabl sharabl multipl parti distribut environ adopt approach build hierarch tree html document user provid mean tree html document hierarch process method avoid user involv wrapper learn domain abil process label html document demonstr effect approach test real estat inform page sampl web approach expect easili adapt domain simpli plug domain knowledg paper organ section describ overview specifi kind document handl section present xml domain knowledg section explain wrapper gener algorithm section describ implement evalu system result section conclud summari futur direct system overview system consist modul includ user interpret interfac modul form user queri combin queri templat site user send site obtain search result page html form learner main learn modul gener wrapper site modul analyz content html page pass construct extract rule refer domain knowledg interpret modul execut learn wrapper extract specif part inform html page main target handl label label portion data extract express label denot mean counterpart figur show part search result page home real estat page label document descript figur label document tain number pair ba label denot dollar number number valu note label repres domain knowledg domain knowledg describ relationship wide applic domain make weak reveal plai crucial role recogn semant fragment document domain paper scheme repres domain shown figur domain real estat domain knowledg singl domain repres structur construct structur list number valu target extract object real estat domain includ price number number list uniqu id hyperlink detail pictur xml construct maintain object correspond price correspond bed xml construct object omit figur domain knowledg real estat domain consist list term recogn exist object price object mean line recogn price string symbol describ data type object posit relationship ontolog term valu price data type price ontolog term automat wrapper construct kei function wrapper gener real estat domain learn format descript success search result page output html page list item express pg list item match sampl express id consist attribut denot id case real estat attribut includ number redund irrelev fragment note maintain modul remov pg wrapper learn find start end posit recogn pattern item descript wrapper gener divid convert logic determin mean logic find frequent pattern html sourc search result page broken sequenc logic line logic line conceptu similar line user learner identifi detect html delimit tag html tag consid unnecessari remov phase algorithm determin mean logic line check exist object domain knowledg logic line recogn includ object conform definit logic line origin line divid subpart appli modul mean logic line repres data structur data structur describ mean origin line ontolog data type categori number assign data type object defin posit relationship ontolog categori number assign shown tabl result data structur analyz descript figur shown tabl categor entir page express sequenc categori number phase algorithm find frequent pattern sequenc proce find candid candid pattern duplic attribut candid pattern tabl result data structur descript object line cat type format digit digit digit digit digit digit digit digit url url tabl categori number assign object categori number object price bed bath citi ml detail img gener text price obtain frequenc candid pattern defin fp obtain number attribut defin calcul total number attribut defin note fp select pattern maximum pattern maximum select longer pattern sequenc obtain page descript includ figur note descript sequenc sequenc ml number valid candid pattern includ select frequent pattern maximum figur candid pattern wrapper built base frequent pattern figur show wrapper home site shown earlier figur wrapper repres structur consist construct describ input queri scheme site order search result page inform structur includ url cgi search number html form detail construct discuss paper construct describ pattern obtain previou pattern search modul note pattern includ number singl xml construct built object found sampl page construct consist element specifi term examin determin exist denot delimit discrimin object specifi data type ontolog term object implement evalu interpret prototyp system implement java figur show interfac user search constraint price number figur show result convert logic line find frequent pattern figur show omit omit figur wrapper real estat site figur user interfac result interpret user queri interpret extract number number ml number test system site real estat domain home yahoo real estat move era real estat result convert logic line result find frequent pattern figur trace learner modul system gener wrapper site site fail learn real estat displai search result tabl form satisfi condit label document system produc correct wrapper success interpret fetch data site albeit system recal collect data site domain evalu figur result interpret present scheme build intellig system mine inform extract rule web page method repres domain knowledg wrapper xml automat gener wrapper label document prototyp system show good perform web site domain real expect adapt domain easi modif domain knowledg limit method work label function document work resolv tackl investig method build hierarch tree document recogn mean tabl element refer parent node test site domain progress evalu power practic aim build custom wrapper learn agent appli refer system construct mediat internet acm sigmod intern confer manag pp structur data back acm sigmod workshop manag pp blum label unlabel data confer comput learn scalabl agent world wide intern confer autonom pp wrapper tsimmi acm sigmod intern confer manag pp induct inform intern joint confer artifici pp ieee intellig pp wrapper construct system web inform sixteenth intern confer data hierarch approach wrapper intern confer autonom pp construct dictionari inform extract eleventh annual confer artifici pp induc conceptu intern confer artifici pp inform extract rule free shop agent automat construct wrapper onlin lectur note comput scalabl comparison shop engin intellig system pp
IR/436 5 model score distribut inform retriev empir model number text search engin show score distribut queri basi fit approxim exponenti distribut set nonrelev document normal distribut set relev document model fit probabilist search engin inqueri vector space search engin smart lsi search engin model true search engin oper number languag lead hypothesi text search engin oper languag similar characterist question shape score distribut reflect underli model languag search process discuss assumpt word distribut document show queri relev inform mixtur model consist exponenti normal distribut fit score distribut distribut map score search engin probabl model applic output search engin combin averag probabl search engin probabl select engin queri result show techniqu perform current combin techniqu number ir task benefit score model includ retriev relev feedback discuss futur improv process score model introduct swet research attempt model score distribut search engin relev document statist detect theori materi base work support part tional scienc librari congress depart commerc cooper agreement number part nation scienc foundat grant number part nsf multimedia part grant number find recommend express materi necessarili reflect feng center intellig inform retriev comput scienc depart massachusett ma find threshold decid relev approach success coupl reason choic model assum score relev document model gaussian van rijsbergen comment search engin smart evid distribut similarli distribut comput score distribut requir knowledg relev set document reason filter relev inform inform retriev task discuss score distribut queri model exponenti distribut set nonrelev document normal distribut set relev document show relev inform distribut recov fit mixtur model gaussian exponenti compon output score search engin queri basi approach score model map score probabl rule note train requir approach addit assumpt made kind search engin model shown work larg number search engin data includ probabilist search engin inqueri vector space search engin smart model shown work engin lsi search engin score distribut inqueri smart data attempt recov relev distribut relev inform text search engin oper languag similar characterist lead question score distribut reflect underli model languag discuss shape score distribut assumpt word distribut document probabl relev obtain model applic threshold filter select approach probabl combin search distribut briefli discuss combin output search engin detail rest paper divid section discuss relat work section discuss model score distribut relev document distribut recov absenc relev inform mixtur model solv mixtur model discuss rule map score probabl relev section discuss theoret intuit model section discuss model probabl deriv evid combin section discuss possibl futur work area section conclud paper relat work relat independ work al discuss relev score model gaussian distribut score exponenti distribut appli select threshold dynam filter applic relev small subset data ahead time subset deriv relev distribut separ zhang callan argu distribut recov al suggest wai improv estim note paper requir relev inform subset data discuss relat work previou work score model combin search engin model score distribut search engin section describ output search engin model data text retriev confer trec data score relev inform top document search engin experi data ad hoc track number search engin show exampl model queri inqueri inqueri probabilist search engin amherst queri document score relev inform queri examin relev data separ data normal minimum maximum score queri figur show histogram score queri set document histogram show rapid fall number document score fit exponenti curv data shown fit origin shift document lowest score figur show histogram score set relev document queri histogram approxim normal distribut plot show fit gaussian varianc exponenti fit obtain document plot figur process repeat queri track case found fit data exponenti relev data gaussian fit parametr form score distribut relev inform run relev inform fit score distribut data natur fit mixtur model shift exponenti gaussian combin score distribut approach discuss normal frequenc ¢ distribut queri shift exp fit score histogram normal score figur histogram shift exponenti fit data queri inqueri section mixtur model fit situat queri run search engin search engin return score relev inform show mixtur model consist exponenti gaussian fit score distribut identifi gaussian distribut relev inform mixtur exponenti distribut inform mixtur essenti find paramet relev distribut relev inform apriori densiti mixtur written term densiti individu identifi individu mix paramet present exponenti densiti gaussian densiti standard approach find mix paramet paramet compon densiti expect maxim iter procedur expect maxim step altern space preclud discuss detail em algorithm updat equat reader refer good introduct em procedur initi estim compon densiti mix paramet rapidli converg solut em fit data mixtur fit shown figur figur plot mixtur densiti compon densiti exponenti gaussian fit comparison figur show exponenti gaussian fit relev data compar strategi interpret gaussian compon mixtur relev distribut exponenti ponent mixtur distribut reason note correspond mixtur compon fit data good shown gener reason fit model fit larg number search engin data includ probabilist engin inqueri citi vector space engin lsi engin fit search engin higher averag lower averag model fit document score search queri smart index normal frequenc ¢ queri normal score shift exp fit score histogram gaussian fit figur exponenti fit data gaussian fit relev data queri inqueri normal frequenc ¢ queri mixtur fit gaussian compon mixtur exponenti compon mixtur normal score figur mixtur model fit show exponenti gaussian compon combin mixtur queri inqueri compar comput posterior probabl rule comput probabl relev score probabl relev document score document relev score document prior probabl relev gaussian compon mixtur exponenti part mixtur obtain mix paramet comput simpl manner number comput posterior includ make monoton detail comment fit distribut mixtur model larg famili densiti possibl fit data poisson gamma distribut approxim gaussian paramet choic poisson combin fit data fit relev data separ mixtur fit exponenti gamma compon converg answer case gamma compon converg exponenti exponenti densiti special case gamma choic distribut exponenti gaussian relev dictat function fit data recov mixtur model relev inform shape distribut attempt give insight shape score distribut term assum distribut term set relev document poisson distribut number time term occur document probabl occurr term set relev document assum distribut set document poisson distribut probabl occurr term set document smaller numer attempt made model word distribut past harter mixtur poisson model distribut word document model section close relat model argu research poisson model good approxim distribut neg binomi model distribut word document fit distribut relev conveni assum model main section provid insight rigor deriv queri consist term assum score document proport number match word distribut score relev document poisson distribut score poisson actual score search engin weight function term frequenc document frequenc empir evid show score approxim proport number match word set relev larg larg valu poisson distribut normal distribut figur hand small valu poisson distribut tend distribut fall rapidli figur shape curv consist model score data previou experi show normal distribut good fit score distribut relev data experi show exponenti distribut good fit poisson distribut show distribut exponenti gener shape exponenti monoton densiti number event figur poisson distribut valu harder deriv score distribut queri consist term actual score search engin complic function empir evid major contribut score provid number match term note robertson walker motiv score function model assum score proport number match word provid intuit argument queri term simplic case queri term argument appli gener case assum term club creat singl term averag frequenc term relev joint occurr term lower word chanc term occur find queri reason assum averag frequenc chang essenti reflect background probabl word poisson model shape relev distribut deriv appli probabilist engin inqueri vector space engin smart vector space engin number match term dot product vector repres queri document model languag independ long word frequenc languag approxim predict mixtur exponenti gaussian distribut fit larger class text search engin oper languag combin search engin posterior probabl obtain model discuss applic probabl select threshold filter document combin output distribut retriev discuss applic involv combin output search engin common improv result approach combin score distribut normal rang score combin simpl techniqu linear combin minimum maximum score simpl rang normal account actual distribut score plot lee manual engin select recal figur recal graph combin techniqu data number wai probabl combin search engin altern scheme combin involv averag probabl optim minim error search engin independ output search engin necessarili independ data inqueri smart individu engin denot combin averag posterior obtain mixtur denot combin averag posterior probabl gaussian exponenti fit assum relev differ error perform mixtur fit model lee denot techniqu ad hoc empir techniqu techniqu involv normal engin queri basi score document combin obtain multipli sum number engin score weight averag manual engin select techniqu involv select discard worst queri basi averag queri manual engin select indic combin result achiev note manual engin select requir relev inform plot provid baselin understand limit combin figur show plot combin inqueri smart data defin fraction retriev document relev recal fraction relev document retriev graph creat averag number queri case figur show perform inqueri smart fact inqueri smart lee slightli differ averag inqueri perform impli mixtur fit improv techniqu perform plot manual engin select close obtain perform combin figur describ combin result top engin number engin combin averag plot show combin improv result graph figur curv averag individu search engin plot show combin method appli engin improv search engin improv number search engin combin top show improv singl engin top show improv techniqu shown graph averag slightli differ perform obtain combin posterior probabl obtain relev singl engin mixtur fit improv approach combin work engin document oper languag detail automat engin select search engin perform consist queri queri discard result engin improv combin manual engin select strategi figur select engin achiev perform averag perform search engin averag necessarili strategi abil model comput relev distribut develop techniqu automat select engin averag individu engin lee number combin engin figur recal graph combin techniqu queri basi number approach space preclud discuss detail give averag number approach combin result inqueri smart search engin note automat engin select automat differ inqueri smart lee automat engin select manual engin select discuss combin result result show mixtur model perform current techniqu combin scope slight improv estim mixtur paramet obtain combin clear approach limit perform achiev model combin intuit satisfi number reason combin engin natur probabl easier explain improv made perform techniqu combin engin extend engin provid distribut score behav similar search engin index media score model model score distribut lead number interest question futur applic extens techniqu interest point note larg number search engin similar score distribut obviou case larg class function chang score distribut chang actual document rank lead form score distribut intim relat distribut term languag intuit justifi form score distribut poisson model word distribut formal deriv poisson model accur model word distribut neg binomi assumpt relev distribut gaussian exponenti approxim model interest find model account recov mixtur relev inform notic gamma distribut fit separ relev distribut mixtur model approach work mixtur gamma distribut note distribut obtain em base mixtur model ident obtain complet relev inform result combin search engin em base mixtur model accur obtain complet relev inform suggest room improv em base mixtur model suggest possibl partial relev inform relev feedback improv mixtur model relev feedback fit natur model case result techniqu normal weight averag perform techniqu heurist ground perform lead suspect approxim formal combin techniqu interest deriv principl approach techniqu score model work appli number area singl sigir paper obviou extens problem combin result multipl search engin oper complet obviou result improv case explan provid efficaci techniqu promot document return multipl search engin document present multipl efficaci combin techniqu case unknown extens includ applic languag retriev involv queri multipl languag search languag common problem situat rank output search engin oper languag combin solut satisfactori score model convert score search engin probabl combin probabl probabl combin natur hope experi futur test hypothesi recent score model appli select filter threshold work mixtur model approach gaussian exponenti distribut obtain relev inform subset data worth examin mixtur model improv result interest question mind model fit search engin oper media test lead combin multimedia engin retriev demonstr model score distribut number text search engin shown calli score distribut queri basi fit exponenti distribut set document normal distribut set relev document shown queri relev inform mixtur model consist exponenti normal distribut fit score distribut distribut map score search engin probabl model score distribut combin result search engin produc engin result substanti search engin provid perform poorli combin techniqu includ averag posterior probabl engin probabl distribut select discard engin queri basi futur work includ attempt improv model perform applic model score distribut filter examin final examin possibl search engin index media imag model acknowledg origin work trace back discuss glasgow author bruce croft extens discuss point relev literatur previou literatur score model inform retriev refer van der weid threshold optim adapt document filter proc text retriev confer exploratori data analysi inform retriev research advanc inform page kluwer academ harter probabilist approach automat keyword index journal american societi inform lee multipl evid combin proc acm sigir conf page feng model score distribut combin output search engin proc acm sigir sept mclachlan finit mixtur model john wallac infer disput addison robertson walker simpl effect approxim model probabilist weight retriev proc acm sigir page swet inform retriev system van rijsbergen inform retriev zhang callan maximum likelihood estim filter threshold proc acm sigir sept
DB/437 3 extend approach data manag system norri depart comput eth switzerland februari abstract program system support combin data model program technolog data model support manag collect object object underli program languag approach basi object data manag servic system data model construct entiti relationship support rich classif structur complement structur oper model base algebra collect object introduct technolog gain popular basi softwar develop platform famili data model retain popular conceptu model success technolog combin support develop applic common approach extens model map model model problem approach data model specif program system notion type map model requir disadvantag model support design system oper schema evolv form map support advoc approach combin paradigm distinguish data model type model base model manag collect object object underli persist storag system characterist object term interfac implement type program languag data model specifi semant group object interrelationship deal issu classif relationship object main advantag approach data model independ type model mean model gener support work proc int conf decemb exist system objectstor support collect object differ bag sequenc data model system tend type model offer constraint collect object develop data model combin usual semant construct enhanc model semant data multipl collect behaviour exist data model present data model form basi provis data manag servic system kernel servic provid distribut persist object store access program languag support languag includ extens support persist distribut eiffel develop project role object data manag servic support applic program requir storag access larg interrel collect object call data model base collect model fact gener data model basic notion entiti relationship lead refer approach adopt approach extend data model exhibit featur semant data model algebra collect model structur oper model structur specifi form collect constraint collect oper model specifi oper collect term collect algebra gener featur collect model present sect detail structur oper compon model sect sect sect provid overview collect model conclud remark sect featur collect model schema descript applic realiti distinguish form descript correspond classifi entiti categori gener concept applic domain correspond describ entiti mean type defin form term structur behaviour properti separ notion classif type link similar entiti similar entiti categori type describ form member adopt convent start lower case letter denot type start upper case letter denot categori categori person entiti belong categori type person term form data item underli type system base integ complex object equat object ident object concern manag refer object object manag individu object perform underli persist object store entiti repres object entiti categori group entiti collect object valu object data notion entiti predomin relationship repres properti entiti lack direct relationship project project person staff manag figur relat number disadvantag rumbaugh relationship relationship handl singl logic unit design larg relationship shown abstract mechan partit system subsystem recent number form extens model support relationship includ relationship entiti repres binari relat collect fig show relat manag relat member sourc collect staff member target collect project shade box denot collect collect region type member valu shade region relat repres collect pair valu element pair belong staff element project cardin constraint member staff member project member project member staff import binari collect simpli binari relat constraint collect constraint sourc target collect respect cardin constraint form collect support unari collect atom valu element repres entiti categori binari collect pair valu element repres relationship entiti categori sourc target collect binari collect form associ repres binari collect link binari collect unari collect binari relationship complex relationship repres object collect exhibit set bag properti depend collect duplic element collect order base attribut valu similar form collect support manag objectstor enhanc model semant data model support rich classif structur express conceptu depend entiti categori base isa relationship depend repres model mean constraint collect schema fig direct edg project subcollect project person subcollect student staff constraint member person member staff student possibl repres constraint box subcollect form cover person demonstr subcollect student constraint box specifi demonstr intersect valu member student staff belong demonstr detail collect construct section oper model base algebra collect numer person person project project person staff person student manag figur schema diagram algebra oper collect number system object time process lost advanc relat model term declar queri languag techniqu collect algebra sect collect collect group valu collect object group valu object ident extens properti group valu collect collect object manag persist object collect collect collect denot ident extens collect deem ident case write collect written event equal extens collect set bag element set distinct unord set valu denot yg denot membership relat set set element bag unord unlik element occurr angular bracket denot yi denot bag ys repres bag function element natur number element number occurr membership relat bag defin bag bag extens collect refer set collect extens refer bag collect introduc predic set collect true set set impli bag collect collect member type collect type member extens instanc type written note member type binari collect product type form defin membership relat collect collect element type member set bag collect element type number occurr set set collect number occurr set collect bag collect bag number occurr defin subcollect relat collect collect subcollect iff write note restrict subcollect behaviour term extens set bag assum set collect zg bag collect zi subcollect relat preorder reflex transit partial order properti hold collect fxg hxi case extens set extens bag subcollect relat hold constraint membership collect constraint check valid updat trigger action updat propag ensur consist maintain form constraint collect term predic cover intersect collect cs set collect set collect cs disjoint pair member collect common member set collect cs cover collect member cs subcollect element collect cs case bag subcollect number occurr collect valu common collect cs intersect cs case bag number occurr equal minimum number occurr collect cs collect algebra section present part oper model specifi oper collect term collect algebra algebra conveni oper full account scope section detail descript algebra discuss properti give flavour algebra examin featur oper algebra similar approach algebra object data model main differ stem differ underli structur model fact form collect unari binari repres entiti categori mean algebra differ algebra provis oper specif binari collect andersen scholl al shaw zdonik restrict attent set collect cluet al dewitt cater multipl kind collect form collect unari binari collect algebra group oper oper appli unari collect appli binari collect pair belong collect simpl member valu oper specif binari collect assum form member valu pair semant oper depend behaviour operand collect union oper set collect creat set collect extens form set union extens operand union oper perform bag extens result bag collect form bag union extens operand collect beg question operand collect behaviour extrem disallow oper carri implicit set collect bag collect approach intermedi investig context queri languag base algebra explicit oper provid convert form collect assum descript binari oper operand collect behaviour note set oper algebra minim oper defin term oper intend oper algebra consid fairli group conveni oper impli oper made directli user queri languag base algebra impli oper direct implement issu provid minim set oper address watt theori collect collect determin type result collect collect type piec inform form collect unari behaviour collect set type member type defin common supertyp type common supertyp common supertyp common supertyp upper write defin greatest common subtyp lower type common subtyp write easili shown uniqu oper collect number oper form collect denot collect member type union union oper form collect element operand collect intersect intersect oper form collect element common operand collect differ differ oper form collect element operand collect member operand collect select select oper collect form collect element satisfi predic predic repres function map element boolean valu true true map map oper collect appli function element form collect result set set collect iff exist bag bag collect number occurr equal sum number occurr element map oper includ cartesian product form binari collect unari flatten combin collect collect singl collect reduc give aggreg oper sum product collect valu oper binari collect addit gener oper oper specif binari collect fact member valu pair denot binari collect element member pair type element member pair type domain dom domain oper binari collect form collect valu element pair belong dom rang oper rng return collect valu element composit ffi composit binari collect binari collect pair form match pair set exist bag note type compat common supertyp inv binari collect binari collect pair form swap element pair domain restrict dr special form select oper binari collect restrict binari collect pair element member collect dr binari collect consist pair element belong collect oper rang domain subtract rang subtract correspond oper relat specif languag oper nest unnest binari oper divid binari collect collect closur oper form transit closur defin implement state kernel servic provid distribut persist object store access applic programm program languag servic includ transact manag secur servic support applic program provis class librari manag interrel collect persist object program tool tool program includ data definit storag full queri languag base collect algebra tool develop includ design tool base graphic schema editor gener interact form util portabl toolkit implement number platform port platform base version persist rel aggreg layer seri data storag access includ dynam hash tabl list support concept element aggreg index properti element bulk layer abstract bulk data bag relat instanc bulk implement chosen aggreg layer collect layer support notion collect constraint collect collect number collect physic term structur link hash tabl queri express collect layer port top develop triniti dublin develop lisbon applic program written algebra queri languag persist variant simpl preprocessor construct queri object queri express replac queri languag express refer queri object detail queri process layer port top develop triniti dublin develop lisbon collect model gener data model manag interrel collect object gener fact concern specif form object independ underli type model success data model term widespread adopt conceptu data collect model design basic model notion entiti relationship schema resembl familiar form schema differ worthi binari collect regard link collect relationship higher ariti repres number link introduct object type number form classif constraint support attribut schema attribut consid level individu entiti object type collect model set bag abstract collect isa relationship oper collect requir cater set bag behaviour work underwai model abstract collect behaviour acknowledg work report part esprit project undertaken author part group glasgow david harper contribut design stephen andrew walker implement michael ry comment draft paper refer relationship mechan strongli type program languag larg andersen oper set master institut norri activ queri lazi approach queri evalu oodb intern confer data knowledg novemb support explicit relat fulli ifip confer object orient rousset de editor distribut applic platform exodu extens dbm overview zdonik read system richard algebra base queri languag system data knowledg ceri widom deriv product rule constraint mainten page august deux system commun octob diaz grai relationship main constructor object orient ifip confer object orient objectstor system commun octob norri collect model data manag system phd dept comput glasgow decemb zhu extend paradigm support relationship constraint ifip confer object orient refer rumbaugh relat semant construct languag page spivei notat prentic object algebra view intl workshop distribut object page queri queri process system phd decemb shaw zdonik queri algebra workshop program languag morgan june shaw zdonik queri algebra sixth intl conf data februari dewitt algebra support complex object inherit sigmod walker object data manag prototyp harper glasgow collect paper dept comput research report watt theori bulk data type technic report dept comput glasgow
AI/438 2 path plan lazi prm robert depart mathemat chalmer technolog sweden depart comput scienc rice tx usa abstract paper describ approach probabilist roadmap planner theme call lazi minim number check perform plan minim run time planner algorithm build roadmap configur node initi goal configur number randomli gener node neighbor node connect edg repres path node contrast planner initi assum node edg roadmap search roadmap hand shortest path initi goal node node edg path check obstacl node edg remov roadmap planner find shortest updat roadmap node search shortest path process repeat path return lazi prm tailor effici answer singl plan multipl queri result present paper show lazi method effici practic introduct motiv basic path plan problem find path move object robot complet obstacl denot configur space robot open subset configur problem state initi configur goal configur find continu curv connect determin exist path plan import autom manufactur mobil found applic comput medic molecular ogi requir singl queri path plan interest planner preprocess answer singl queri quickli planner path applic configur space obstacl chang robot grasp obstacl enter workspac time requir plan relat difficulti plan simpl path environ found complic path requir time similar plan time relat desir qualiti return path qualiti path difficult quantifi section gener prefer short path respect metric planner user intuit tune short plan time versu high qualiti planner learn inform previou queri order speed subsequ queri planner find path narrow passag inform ing path passag subsequ queri contribut paper paper present lazi approach probabilist roadmap ner main object provid fast planner adher close requir discuss address standard industri applic complex geometri configur space handl complex gener impli main theme algorithm minim number perform plan avoid local plan global part configur space essenti answer queri explor experi typic industri environ show larg averag total number check perform return inevit solut case clutter configur space fast case narrow passag problem main object call lazi detail section evalu section real industri environ probabilist techniqu path plan problem extens studi number ferent approach overview algorithm call complet find solut determin exist due complex path plan lem complet planner slow practic trade complet probabilist planner successfulli appli problem configur space random path planner solv problem robot freedom planner potenti field guidanc random walk escap local minima interest approach present ariadn algorithm initi configur planner increment build tree feasibl path genet optim search path landmark point previou landmark planner place landmark search path goal configur landmark goal configur connect tree probabilist roadmap method survei section restrict probabilist techniqu probabilist roadmap method method form base solut idea probabilist roadmap method repres captur random node edg correspond randomli select configur path segment preprocess learn larg number point distribut uniformli random found retain node roadmap local planner find path pair node suffici close planner succe find path connect edg roadmap queri start goal configur connect roadmap local planner roadmap search shortest path point power local planner requir node obtain connect implement prm show effici distribut node local planner local planner instanc check straight line node local planner discuss learn phase prm node enhanc step order connect roadmap ad node difficult region techniqu identifi distribut point close number seed randomli select exist node probabl node select proport number edg connect node altern select base node ratio fail attempt local planner find path node niqu connect roadmap prm shown work practic configur space multipl adequ roadmap queri answer quickli variat prm prm weak find path row passag node enhanc step develop effort address issu effort distribut node close boundari led strategi planner initi robot penetr obstacl extent small neighborhood configur order place node close boundari obstacl base prm determin configur sion origin number rai binari search rai find point boundari roadmap node ner identifi boundari distribut point pair pair gener pick point uniformli random pick point close point ad roadmap pair techniqu number node narrow passag present point pick uniformli random retract medial axi method probabilist divid plan process learn phase queri phase initi goal planner insert randomli distribut node connect compon roadmap local planner node insert initi goal configur found connect compon roadmap relat rithm paper adapt scheme adjust power local planner build tree root initi goal configur tree feasibl path extract tree expand gener node randomli vicin connect tree local planner planner iter gener uniformli random node closest attractor select local planner search path maximum length attractor node end path process stop tree intersect gener theme roadmap algorithm construct network path verifi local planner difficult find global strategi local planner effici order avoid region algorithm proce goal mean time spent plan local path final path probabilist algorithm heavili reli fast check requir long preprocess check real applic complex time make probabilist planner slow singl queri industri environ small occur solut avoid local planner global view entir plan process present lazi prm path plan algorithm tailor singl multipl queri make planner main theme minim number check lazi prm section describ algorithm singl multipl queri path plan algorithm similar origin prm aim find shortest path roadmap gener randomli distribut configur contrast exist build roadmap feasibl roadmap path assum feasibl idea lazili evalu feasibl roadmap plan queri process similar idea lazi evalu develop independ planner call fuzzi prm number distribut point form node connect edg pair node suffici close procedur estim length find shortest feasibl path roadmap repeatedli search shortest check time remov node edg search shortest path procedur termin wai exist feasibl path roadmap find shortest feasibl eventu find disjoint compon roadmap case report failur add node roadmap procedur call node start search descript algorithm figur rest section explain step algorithm detail build initi roadmap step algorithm build roadmap consist node distribut uniformli random paramet determin user heurist densiti node region advanc gener difficult remov collid build initi search shortest path check path path node enhanc figur descript lazi prm select neighbor connect node edg set neighbor node edg repres straight line path node local techniqu connect node substitut memori connect pair straight line path node natur node suffici close order select reason metric distanc tween configur metric reflect difficulti connect straight line path connect pair node number neighbor node random depend initi number expect number neighbor equal paramet determin user case harder make feasibl tion direct instanc articul robot occur base joint move joint close move unit weight euclidean dimens posit pose weight chosen proport maximum distanc distanc travel point move unit axi metric easi shown work experi present section search shortest path step algorithm find est path algorithm metric measur length path remain distanc search procedur find check path exist report node enhanc step add node roadmap start search choic determin time solv problem defin give prefer path reject decid path high qualiti path poor qualiti paper focu articul robot euclidean configur space ii rang joint metric weight euclidean similar weight equal vi maximum angular joint give prefer path short execut applic interest variabl check path algorithm found shortest path roadmap check node edg path edg check algorithm requir checker point move step algorithm roughli identifi remov collid node edg roadmap shortest path feasibl check path primarili interest verifi individu node edg jc remov collid node edg effici remov node impli connect edg reason check feasibl node check edg check node start node examin path work altern check node path remov search shortest path reason check node order probabl shortest feasibl path node higher node close check discuss check edg node path start check edg similar work minim risk unnecessari check edg path refin resolut reach remov search shortest path found algorithm termin return path make algorithm record node check resolut edg order avoid check point total number check depend resolut edg path check reflect probabl determin resolut respect metric resolut depend scale weight defin introduc paramet number check requir check longest straight line path assum rectangl opposit resolut quantifi relat length diagon node enhanc search procedur feasibl path exist roadmap node order find node enhanc gener insert select neighbor initi built distribut node inform roadmap left order distribut difficult region method similar node enhanc select number point call randomli distribut point close seed identifi difficult region maintain smooth distribut knowledg limit reli select seed half enhanc node uniformli rest distribut seed ensur probabilist probabl find exist path approach time proof select seed set edg remov roadmap endpoint intersect boundari edg distribut point close boundari enhanc step execut problem cluster node assum add node node give rise number edg enhanc step probabl ad node close distribut enhanc node depend enhanc eventu undesir cluster node avoid edg gener uniformli random select seed figur seed configur space point distribut ing distribut confid probabl dash contour distribut function weight defin distribut node seed distribut point seed multivari normal distribut distribut easi control distribut term metric stretch distribut direct probabl make feasibl connect higher introduc paramet show distribut event probabl figur maximum length edg defin section achiev defin covari upper percentil freedom point multivari distribut covari matrix simpli mean compon distribut varianc show distribut dof event probabl confid ellipsoid paramet control size confid ellipsoid rel figur experi found good choic multipl queri planner found termin return path inform node edg check store long remain roadmap process subsequ queri benefit inform obtain initi final configur simpli ad initi gener run queri roadmap planner eventu find path node edg check make planner effici multipl queri figur experi robot home configur denot result section present perform test lazi prm appli dof robot realist industri environ planner ment modul simul program softwar run window nt check handl intern experi run pc mhz pentium ii processor mb ram test path plan task test part manufactur process robot tend press break plane sheet metal pick bent press shown figur process divid aim automat plan unconstrain path robot denot ten configur shown figur initi goal configur plan denot initi configur goal configur scenario start home configur robot pick sheet metal adjust grip put press develop digit plant technolog sweden configur configur configur configur configur configur configur configur configur figur configur experi robot grasp move place move side grasp move back press grasp configur robot return home configur path plan note seri time grasp place sheet chang neglect small displac center oper task plan configur space configur space build roadmap report result includ number number enhanc plan maximum base consecut run shown tabl averag number check perform node edg averag number check perform path planner return plan time tabl divid graph build distanc calcul node edg graph check column tabl averag valu record data sum indic averag number check averag plan time entir press break oper tabl comparison reason result obtain algorithm simpli check node edg roadmap built lazi prm initi step figur correspond learn phase node enhanc origin prm note long planner find feasibl path immedi tabl enhanc step lazi interpret result tabl ing repres vast major plan time graph build lot time note task roadmap task make graph build time significantli shorter time spent graph search carefulli select point check task total lazi prm check node av edg av return path av min total av max tabl step min av max tabl plan time graph build av graph search av coll check av min total av max tabl check node edg total plan time tabl tabl perform data lazi prm base consecut run task tabl show data prm base run task initi number test frequent search roadmap shortest total time spent short compar averag number check perform lazi prm tabl number check requir explor entir initi roadmap order tabl lazi prm explor small roadmap larg total number check perform return inevit strength avoid local plan global essenti part roadmap explor edg edg final path check finest resolut make algorithm insensit resolut path check tabl reveal import properti lazi prm abil effici conclud node enhanc enhanc step number check tabl small total number node roadmap check small number node algorithm conclud feasibl path exist proce node enhanc step discuss probabilist complet path plan algorithm high configur check oper singl queri handl preprocess requir subsequ queri algorithm learn configur space automat retain inform obtain previou queri planner work effici multipl queri aim lazi prm essenti minim number check search shortest feasibl path roadmap context prm planner frequent graph search complex robot work complex dof check care select point check reduc plan time lazi prm essenti paramet critic perform initi number node strongli correl probabl find feasibl path node enhanc optim choic depend dimens plan desir qualiti path futur work includ investig depend plan time ronment probabilist lazi give fast plan tabl maximum plan time approxim long averag plan time improv enhanc techniqu order make algorithm robust worst case perform improv topic futur research acknowledg author digit plant technolog ab initi project provid suitabl softwar part work perform visit robert robot group comput scienc depart rice robert support swedish nation board industri technic project work paper support part nsf career award nsf cise author member robot group christian nielsen latomb comment refer nm ob lk good distanc metric local planner probabilist roadmap method proc ieee int conf rob nm ob lk prm workspac algorithm page ak nm wu random roadmap method path manipul plan proc ieee int conf rob page jc latomb robot motion distribut approach int rob motion plan industri robot chalmer mh van der gaussian sampl strategi probabilist roadmap planner proc ieee int conf rob page cameron enhanc comput minimum distanc penetr convex polyhedra proc ieee int conf rob page jf canni complex robot motion plan mit solv combin direct random search proc ieee int conf rob page gupta del practic motion ning robot john west motion plan freedom random reflect obstacl proc ieee int conf rob page le jc find narrow passag probabilist roadmap planner algorithm page motwani path plan configur space proc ieee int conf rob page yk hwang ahuja gross motion plan survei acm comp search algorithm motion plan proc ieee int conf rob page ra johnson dw appli multivari statist analysi prentic le jc latomb random cess configur space fast path plan proc ieee int conf rob page le jc mar probabilist roadmap fast path plan high configur space ieee tr rob jc latomb plan motion intent comput graphic page jc latomb robot motion plan jc latomb motion journei digit artifact int rob sm jj random plan proc ieee int conf rob page mc lin jf canni fast algorithm mental distanc comput proc ieee int conf rob page jm ariadn algorithm art intellig cl nielsen le level fuzzi prm manipul plan technic report rice overmar random approach motion plan technic report utrecht overmar probabilist ing approach motion plan ky jc rh algorithm foundat page thoma detect tween polyhedra revisit practic aim proc ieee int conf rob sa nm pf probabilist roadmap planner sampl medial axi free space proc ieee int conf rob page
Agents/439 1 architectur organiz structur paolo giorgini depart inform commun technolog trento povo itali manuel inform system research unit school manag place de belgium john mylopoulo depart comput scienc toronto colleg canada abstract system organ coordin autonom agent interact order achiev common goal real world organ paper architectur style ma adopt concept organiz theori style model framework offer notion goal actor depend formal evalu respect set softwar qualiti predict adapt conduct compar studi organiz convent softwar architectur mobil robot control softwar engin literatur research conduct context softwar system develop methodolog introduct softwar architectur describ softwar system macroscop level term manag number compon modul data control depend system architectur design focu research fifteen year produc architectur style framework evalu effect respect softwar qualiti exampl style control loop exampl softwar qualiti includ portabl interest develop suitabl set architectur style softwar system fundament concept system intent turn theori studi social structur motiv insight kind social theori turn theori studi group commun social network theori studi social structur emerg properti social context interest social structur result design process turn guidanc organiz organ theori strateg allianc organiz style organ theori describ intern structur design strateg allianc model strateg cooper independ organiz actor pursu share goal describ adapt joint ventur architectur model strateg depend model specif formal research conduct context project develop methodolog softwar system methodolog adopt idea ma defin detail design implement idea requir goal heavili earli requir analysi project adopt eric model offer actor actor depend primit concept model applic earli requir analysi kei assumpt distinguish methodolog actor goal fundament concept analysi design phase softwar requir analysi paper structur section introduc style identifi organ strateg allianc theori section detail joint ventur base exampl organ style model term social intent concept framework semiform specif languag found style section present set softwar qualiti attribut style term evalu architectur altern section fragment mobil robot case studi adopt softwar engin literatur illustr style compar convent section present framework select architectur style respect softwar qualiti attribut section overview methodolog section discuss relat research section summar contribut outlin futur work work case studi style describ paper decid simpler pedagog paper understand structur organ origin peopl particip share burden reward organ earli organ primarili militari natur art sun describ hierarch strategi aristotl wrote administr associ cultur advoc princ power moral root organiz trace includ world studi altern organiz structur structur consist stakehold physic social system coordin interact achiev common goal organiz structur primarili studi organ theori describ structur design organ strateg allianc model strateg collabor independ organiz stakehold pursu set busi goal disciplin aim identifi studi organiz pattern model abstract oper manifest form lie object domain realiti part concret world pattern sole set execut behavior exist form stage crystal level granular organ manifest pattern emerg recogniz high low level granular lowest level find inform pattern servic pattern repres busi organ deal basi move upper find busi pattern mix product market flow organiz style highest level granular organiz style address mix context organiz manifest organ layer organiz organ complex arrang collect constitut organiz structur organiz style fulli form pattern definit characterist present rest section organiz style easili measur michael gener strategi exampl pattern strategi type gener properti distinguish strategi distinguish characterist style partial term architectur interest identifi system architectur organiz style defin organiz theori categor exhaust studi manageri point view section insist style due interest candid ma architectur design fact studi great detail organiz literatur present fulli form pattern organ theori organ coordin social identifi function continu basi achiev common goal set organ theori disciplin studi structur design social entiti structur deal descript aspect design refer prescript aspect social entiti organ theori describ practic organ offer suggest chang improv effect adam school organ theori model pattern find formal recur organiz structur behavior briefli present organiz style identifi organ theori studi detail section organ consid aggreg base level sit oper core carri basic task procedur directli link product product servic transform input distribut top li strateg apex make execut ensur organ fulfil mission effect defin strategi organ environ middl line establish hierarchi author strateg apex oper core consist manag coordin activ oper core support separ main line author influenc oper core indirectli serv organ make work typic standard work skill charg appli analyt procedur adapt organ oper environ support special level basic oper work flow legal describ model exampl section pyramid style hierarch author structur actor lower level depend higher level crucial mechan direct apex manag supervisor intermedi level rout strateg author apex oper level coordin behavior local level chain valu backward actor engag achiev realiz relat goal task stage suppli product process particip act add step chain domain good provid expect suppli qualiti ensur massiv retail care direct deliveri consum matrix multipl command vertic horizont channel inform author oper simultan principl uniti command set compet base author jointli govern work flow vertic line typic function depart oper horizont line repres project group geograph arena manag combin coordin servic function specialist project area bid style involv competit actor behav part auction auction actor run auction issu auction receiv bid bidder actor ensur commun feedback auction issu bid strateg allianc strateg allianc link specif facet organ structur trade partnership enhanc effect competit strategi particip organ provid mutual benefici trade product base allianc varieti rang contract joint corpor equiti arrang vari interpret term strateg allianc defin possess simultan suffici organ unit pursu set goal remain independ subsequ format allianc partner organ share benefit allianc control perform assign task partner organ contribut continu basi kei strateg briefli present organiz style identifi strateg allianc joint ventur studi detail section joint ventur style involv agreement partner obtain benefit larger partial invest lower mainten cost specif joint manag actor coordin task manag share resourc partner actor partner manag control local dimens interact directli partner exchang data knowledg strateg oper coordin actor global ensur joint manag actor origin actor possess equiti particip describ model exampl joint ventur section style impli agreement independ partner actor partner autonomi independ act put resourc knowledg accomplish common goal author deleg collabor hierarch contract style identifi coordin mechan combin agreement featur aspect pyramid author coordin mechan develop characterist involv varieti mediat observ level handl condit monitor manag negoti resolv conflict final hierarch execut apex contractor restrict autonomi underli cooper ventur parti style involv incorpor repres extern system advisori structur behavior initi organ repres extern organ trade confidenti author knowledg asset support initi system term contractor actor reconcil adjust view polici system commun model organiz style defin organiz style metaclass organiz structur offer set design paramet coordin assign organiz object affect organ function design paramet goal task control depend strategi definit section describ organiz style present section detail organiz section present case serv model specif agenc locat emploi fifti detail tabl direct director main aspect global strategi creativ form strateg apex middl campaign manag charg find coordin campaign support task administr account document depart administr account constitut handl administr task budget support group document depart defin polici technic mean requir manag ensur servic system support inform retriev oper core includ graphic edit staff charg creativ artist aspect realiz campaign tabl organ direct campaign director creativ director administr director financ director campaign manag campaign manag campaign market editor chief creativ manag graphic graphic design photograph edit editor copi writer document media librarian resourc librarian knowledg worker administr direct assist manag secretari file clerk manag network administr system administr analyst comput technician account account manag credit control account clerk assist figur model strateg depend model model framework earli requir analysi offer notion belief kind social depend actor strateg depend model describ network social depend actor node repres actor link actor actor depend goal attain depend describ depend depend depend actor depend type depend describ natur agreement goal depend repres deleg fulfil depend similar goal fulfil defin appreci subject fulfil obtain task depend situat requir perform resourc depend requir provid resourc depend shown figur actor repres task resourc repres hexagon depend form depend figur compani special telecom servic belgium line product servic rang phone line internet mobil voic data manag shown figur structur commerci organ execut constitut strateg apex defin gener strategi organ chief manag appli specif aspect gener strategi area financ oper charg budget sale plan manag implement sale market defin sale polici technolog polici figur sale organ manag group manag coordin manageri aspect product servic sale reli financ oper handl plan control product depend market accur market studi technolog awar financ oper depart constitut charg manag control qualiti sale plan includ schedul resourc manag support involv staff market depart jointli defin support sale polici market depart coordin market studi sale oper core document promot servic staff defin technolog polici technolog awar servic assist sale peopl consult support technolog train oper core group sale peopl line consult coordin charg sell product servic actual potenti custom figur style figur abstract structur explor case studi figur style actor case studi suggest number constraint supplement basic depend strateg apex depend middl line support type goal depend model strateg depend middl line support strateg apex relationship middl line support goal depend oper core reli support task resourc depend task depend permit middl line depend oper core formal properti formal extend primit formal languag compar kao constraint specif formal tempor logic formal basic type entiti attribut formal class denot relationship object model metaclass actor actor attribut attribut role depend depend type mode depend mode class instanc metaclass formal constraint lifetim instanc tempor logic special predic tempor logic predic hold state element exist state previou predic hold predic hold hold previou present specif strateg manag oper manag depend actor actor actor support actor actor depend type depend support invari depend actor goal fulfil depend goal te ml properti strateg manag consist depend organ goal actor organ predic consist depend organ term properti satisfi fulfil depend necessarili impli goal depend middl support strateg apex depend achiev time depend type goal mode achiev depend invari coordin task ml fulfil dep depend ml fulfil oper manag goal impli goal depend middl line depend achiev time past invari properti specifi oper manag goal consist manag exist coordin task task depend oper implement structur properti satisfi singl instanc strateg apex constraint hold middl support oper te ml su dep depend sa te ml depend permit strateg apex middl support te ml su dep depend sa te ml goal depend permit middl support apex ml dep depend su task depend permit middl agenc oper oc dep depend te task resourc task depend permit oper core constraint hold ml depend permit extern actor middl agenc constraint hold oper specif establish model constitut instanc style model figur shown actor instanc actor class direct instanc strateg apex depend instanc depend class agenc global strategi instanc strateg global properti enforc task depend campaign manag fourth properti joint ventur describ allianc serv model joint ventur structur organiz style specif industri joint ventur coordin collabor activ european aeronaut manufactur built market aircraft joint ventur involv british aerospac develop product task distribut avoid duplic develop manufactur cockpit aircraft system integr develop manufactur british aerospac wing tail unit final assembl carri unlik commerci activ split partner sale oper industri joint interfac extern stakehold custom bui maintain custom airlin approach partner firm deal industri real manufactur defin product polici elabor specif model aircraft launch defend point view interest allianc partner compani individu goal enter conflict collect goal allianc figur industri joint ventur figur model organ industri joint ventur strateg depend model assum industri joint ventur industri deal demand custom depend receiv aircraft mainten servic joint ventur role interfac partner british aerospac industri defin strateg manag conflict defend interest allianc defin aircraft specif joint ventur coordin partner ensur assum specif task build wing build british tail unit build cockpit build aircraft assembl aerospac build assum model manufactur assembl assembl depend partner receiv part plane decid merg helicopt activ joint ventur manag product polici staff reorgan merg helicopt irrespect market inherit helicopt manufactur engin franc germani polit social special close group product singl site plant manufactur larg produc small helicopt la concentr manufactur complex compon requir specif blade figur model organ joint ventur joint assum role role handl helicopt order custom depend obtain machin defin product strategi polici joint ventur role coordin manufactur oper partner depend product small helicopt larg complex compon blade assum consid la depend la suppli complex helicopt part figur abstract joint ventur structur explor case studi figur case studi suggest number constraint supplement basic figur joint ventur figur joint ventur style partner depend provid receiv resourc oper coordin ensur joint manag actor depend partner accomplish assign task joint manag actor assum privat interfac role coordin partner allianc public interfac role strateg defin polici privat interfac repres interest partnership respect extern stakehold part joint ventur style specif role goal role goal actor partner structur properti instanc joint dep depend resourc depend dep task depend partner joint joint manag dep depend goal goal depend joint manag relationship partner joint manag privat joint manag privat interfac relationship joint manag public interfac softwar qualiti system gener softwar qualiti address system predict autonom compon agent high autonomi undertak action commun domain difficult predict individu characterist part determin behavior distribut open system larg predict system contrast agent capabl adapt agent predict anticip plan action adapt unexpect situat secur agent identifi data knowledg sourc undertak addit action base sourc protocol strategi verifi authent data sourc individu agent import concern evalu system qualiti addit possibl mislead inform acquir danger hostil extern entiti spoof system acquir inform accord trust domain agent import issu system secur concern network data protect malici host authent agent make agent ascertain origin receiv intrud masquerad network secur servic ensur network packet improperli read modifi unauthor agent verifi receiv messag modifi transit data secur agent hide data capabl agent problem malici host involv attack mobil agent malici host host execut process secret host prevent host analyz program run alter form program adapt agent requir adapt modif environ includ commun protocol possibl dynam introduct kind compon unknown manipul exist agent adapt system depend capabl singl agent learn predict environ act capabl make diagnosi detect determin fault base symptom success system tend balanc reactiv predict singl agent capabl adapt coordin agent coordin agent recent system coordin gener distribut resourc inform agent special sourc charg solv interdepend action occur goal undertaken individu agent meet global constraint solut develop group agent satisfi condit deem make system effici individu function obviat inform discov agent suffici agent agent solv problem coordin realiz cooper agent coordin entiti achiev common simpli local goal cooper commun agent commun intent send receiv order cooper agent coordin cooper activ observ react behaviour delib commun agent jointli plan action cooper competit delib negoti system delib ad competit success agent impli failur avail agent offer servic instanc fipa standard implicitli explicitli guard interrupt offer servic avail consid secur deal softwar qualiti attribut due import system design failur agent inaccess broker agent necessarili impli failur system system check complet accuraci inform knowledg transact flow prevent system agent similar replic capabl refer compon specif behavior system failur agent depend coordin interact extern system interf activ number incom agent standard adopt modular effici task reduc commun overhead enabl high flexibl impli constraint commun aggreg agent compon part agent compon control composit entiti control result effici task execut low commun prevent system benefit flexibl architectur mobil robot case studi section present applic joint ventur style compar convent architectur illustr comparison classic mobil robot case studi softwar engin literatur simplic pedagog aspect mobil robot control system deal extern sensor actuat respond time activ system environ activ offic deliveri mobil robot typic acquir input provid control motion wheel plan futur path number factor complic obstacl block sensor input robot run mechan limit restrict accuraci robot robot manipul hazard unpredict event leav time respond agent softwar qualiti mobil robot respect activ factor agent softwar qualiti state offic deliveri mobil architectur coordin mobil robot coordin action undertak achiev design object collect sampl reaction forc environ avoid predict circumst oper fulli predict architectur provid framework robot act face incomplet inform contradictori sensor architectur prevent failur oper environ local problem reduc power danger unexpectedli open door necessarili impli failur mission adapt applic develop mobil robot frequent requir reconfigur robot assign requir regular modif classic style sampl classic examin major convent architectur layer architectur control loop task tree implement mobil robot layer architectur classic layer architectur depict figur lowest resid robot control routin level deal input real world perform sensor interpret analysi data sensor integr combin analysi sensor level concern maintain model world level manag navig robot schedul plan action deal problem replan part level top level user interfac supervisori function supervisor global plan control navig model sensor integr sensor interpret robot control environ figur mobil robot layer architectur control loop control compon initi robot action mobil robot respect oper control monitor consequ robot action adjust futur plan base return inform control activ robot compon actuat sensor environ figur mobil robot control loop architectur task tree architectur base hierarchi task parent task initi child task instanc task gather object initi task grab lift task posit initi move left move forward softwar design defin tempor depend pair task object complet lift object featur permit specif select concurr organiz style develop organiz architectur miniatur offic deliveri robot lego robot invent system program platform base golog planner test architectur work abstract reminisc encount layer figur depict robot architectur part control compon oper core manag robot global planner strateg apex plan schedul mission sensor support compon captur real world raw inform hardwar multipl sensor integr coher interpret navig compon direct extern feedback part control real world model concern plan mission establish maintain model world check mission environ ensur predict manag navig middl agenc central intermedi modul coordin movement robot assum toler adapt manag joint ventur style depict figur robot architectur figur organ joint manag assum control interfac role defin mission qualiti adapt coordin deal coordin agent planner defin mission monitor observ check environ figur mobil robot architectur motor control run part subsystem receiv sensor data interpret compon interact directli exchang motor control receiv direct feedback plan updat planner adjust dynam move respect inform provid monitor provid mission inform evalu evalu style control layer task section respect agent softwar qualiti attribut identifi section coordin simplic control loop drawback deal complex task leverag figur joint ventur mobil robot architectur softwar cooper agent compon layer architectur style suggest servic request pass adjac agent layer inform exchang command transact skip intermedi layer establish direct commun coordin behavior task tree permit separ action reaction incorpor concurr agent model proce time compon interact unlik previou separ data interpret world control plan architectur improv coordin compon differenti hierarchi data implement support control implement oper middl agenc strateg apex shown figur joint partner compon interact joint manag strateg compon joint manag return strateg inform immedi mediat request partner compon predict control loop reduc unpredict iter action reaction elimin possibl turn subtl step architectur offer framework deleg separ agent compon layer exist abstract layer address manag unpredict uncertain lowest level clear ad knowledg higher layer task tree address predict clear tent task tree adapt except handler assumpt base turn erron layer exist abstract level address manag unpredict contrari layer higher level abstract lower lower level involv resourc task depend higher intent relationship central posit role joint manag mean resolv conflict prevent unpredict world view sensor data interpret control support simplic make duplic compon behavior easi reduc chanc error system layer robot architect strive incorpor check balanc level system drawback control command transact skip intermedi layer check system behavior task monitor featur integr account reliabl complet data check control mechan integr abstract level assum redund perspect contrari layer check control restrict adjac layer permit separ data control integr hierarchi verifi independ joint central messag task except monitor support joint manag reliabl complet adapt control robot compon separ replac ad independ manipul place insid level detail architectur show layer interdepend layer prevent addit compon delet exist fragil relationship layer difficult chang task implicit make increment develop replac compon suffici regist exist feel impact separ independ typic compon robot architectur isol dynam manipul restrict major compon control refin tune place insid compon joint manipul partner compon easili regist compon joint manag partner commun directli exist depend updat joint manag remov due central posit tabl ii summar strength weak review architectur tabl ii strength weak robot architectur loop layer task tree coordin predict adapt layer architectur indic compon expect robot classic architectur loop task defin function compon concentr dynam organiz style joint focu organ compon expect robot intent social depend govern compon exhaust evalu difficult establish point preliminari result deduc tabl discuss present argu pattern govern organiz fit system applic open cooper compon mobil robot select architectur cope softwar qualiti attribut select architectur analysi function requir framework refin identifi attribut evalu altern architectur style shown figur analysi intend make explicit space altern fulfil attribut style repres attribut architectur multi agent system joint evalu result contribut relationship architectur style qualiti label design repres claim drawn dash cloud make domain characterist consid properli reflect make provid reason select reject solut mark mark prioriti attribut accept attribut cross label deni attribut analysi shown figur architectur style mobil robot attribut mark analysi correl catalogu depict tabl ii top level qualiti attribut identifi softwar qualiti attribut call function requir repres distribut claim agent spoof coordin particip common reliabl qualiti attribut redund joint ventur structur complet style figur partial architectur evalu organiz style relationship type qualiti attribut formal offer tractabl proof procedur relationship correspond classic decomposit attribut attribut satisfi attribut satisfi figur attribut coordin attribut common relationship model situat attribut contribut posit neg satisfact attribut figur joint ventur contribut posit satisfact distribut attribut neg reliabl relationship model situat satisfact attribut impli satisfact denial goal figur satisfact attribut structur impli satisfact attribut reliabl redund analysi select architectur base propag algorithm present idea assign set initi label attribut satisfi assign lead label propag attribut adopt qualit numer axiomat goal model primit label propag algorithm shown sound complet respect respect axiomat descript qualit algorithm attribut associ variabl rang repres current evid satisfi attribut state partial evid ai satisfi start assign initi set input valu subset attribut propag valu propag rule tabl iii propag rule relationship function satisfi function dual tabl propag tabl iii propag rule satisfi qualit framework dual tabl propag schema algorithm figur current arrai pair ai repres current previou label statu graph arrai current initi initi valu initi input user attribut updat propag valu previou step fixpoint updat mode updat work relat ri incom satisfi valu deriv valu sourc attribut comput appli rule tabl iii return maximum comput valu work appli dempster shafer theori sourc inform propag algorithm reliabl compet evid sourc ai updat return rj st ai appli rule appli rule return figur schema label propag algorithm methodolog research conduct context architectur design phase softwar system develop methodolog found concept actor goal describ term concept organiz environ system eventu system methodolog tradit develop structur tailor system oper organiz context found concept earli requir analysi adopt concept offer span phase softwar earli concern understand problem studi organiz output organiz model includ relev goal depend late oper relev function qualiti architectur global architectur defin term interconnect control depend detail behaviour architectur compon defin detail relat work literatur ma offer contribut organ theori concept model design ma fox introduc idea organ metaphor design distribut softwar system studi result manag scienc identifi effici agent organ motiv work focu concept organ theori model organ appli success organ structur design ma organiz perspect increasingli accept ma mathemat comput method progress develop understand fundament principl organ ma taem environ model model framework repres coordin problem taem model analysi simul coordin design organiz structur taem extrem detail design sophist altern complex suitabl architectur abstract goal strateg depend research work system offer contribut organ concept agent relationship model design system architectur concept role model organiz structur system type organiz behavior requir pattern defin formal gaia methodolog role interact model analyz understand system structur organ system view collect stand relationship part pattern interact role main differ approach gaia organ descript includ goal goal part organ descript organ theori compon organiz constraint organiz structur theori design principl aim extend organ theori design control system theori design emb design intellig agent system theori organiz design research result organiz design includ design teamwork model design base idea organ member monitor organiz effect direct organiz design organiz structur evalu organ select implement execut structur network preserv problem solv activ predict model gener organ solv evalu organ teamwork model base joint intent framework introduc levesqu al design system individu agent provid explicit team goal underli explicit model team activ work definit collect specif organiz architectur style design system fundament concept agent system intent system view organiz structur autonom proactiv agent interact achiev common privat goal human organ metaphor suggest set gener style agent prefer organiz design theori social emerg theori paper architectur style ma inspir organ theori describ intern structur design organ theori strateg allianc model collabor independ organ pursu goal detail adapt organiz style organ theorist joint describ cooper strategi busi world style model term intent social primit case studi describ real world organ specif formal contribut includ present evalu softwar qualiti identifi style comparison organiz convent style conduct mobil robot case studi softwar engin literatur present framework select architectur style respect identifi softwar qualiti attribut futur research direct extend formal catalogu organiz style specif model instanc style interpret formal intent social convent architectur element involv librari configur organiz style eventu constitut architectur macro level micro level focu notion social agent pattern exist pattern incorpor system identifi agent inher pattern open architectur mediat detail goal depend identifi organiz style refin achiev refer kazman softwar architectur practic farmer system analysi design uml mcgraw subrahmanian heterogen agent system klusch cooper inform page springer mylopoulo develop methodolog proc int conf advanc inform system page june mylopoulo inform system project inform function integr ma dynam popul proc int conf multi agent chess secur issu mobil code system mobil agent page springer lk mylopoulo requir softwar engin kluwer van ficka requir acquisit scienc comput decker environ center analysi design coordin mechan phd decker lesser quantit model complex comput task environ proc nation conf artifici page norman cooper system knowledg engin lesser predict versu coordin problem solver dynam domain proc nation conf artifici page garrett cooper compet successfulli strateg allianc wilei ferber gutknecht design organ system proc int conf multi agent june treur organ model requir specif multi agent system proc fipa foundat intellig physic agent fox organiz view distribut system transact man model check earli requir specif proc int symposium requir august vlissid design element reusabl softwar garlan shaw introduct softwar architectur advanc softwar engin knowledg mylopoulo organiz pattern earli requir analysi submit ieee joint intern requir engin confer august sebastiani reason goal model intern confer conceptu model octob orient softwar case studi sen jp andr thirteenth intern confer softwar engin knowledg engin air june consult group allianc shape busi harvard gordon apt agent time proc goddard workshop formal approach yang architectur design pattern multiag coordin proc int conf autonom sycara secur agent societi proc workshop fraud trust agent acm xuan diagnosi integr part adapt technic report yokoo organ distribut product system transact knowledg data jen coordin techniqu distribut artifici intellig foundat distribut artifici page gasser organiz approach coordin multiag system und technisch informatik kumar cohen adapt agent achiev persist broker team proc int conf multi agent lego lego robot invent system lesser cooper multiag person view state art transact knowledg data levesqu scherl logic program languag dynam domain journal logic hj pr nune act proc nation conf artifici menlo prefac cox autonom robot vehicl springer structur design effect organ organ model innov architectur centuri prentic editor coordin internet agent springer parson qualit approach appli theori inform mylopoulo knowledg level softwar engin methodolog agent orient program proc int conf autonom porter competit creat sustain superior perform free design pattern softwar develop jen engin execut agent system journal logic wr scott open system prentic intellig busi allianc profit import strateg tool time shaw garlan softwar perspect emerg disciplin prentic shehori architectur properti system technic report carnegi mellon modular architectur offic deliveri robot ieee control modular architectur offic deliveri robot proc int conf autonom agent page marian del februari organiz model organiz chang work note workshop ai theori group model design comput organ work note aaai spring symposium comput organ design organ comput agent comput mathemat organ tamb teamwork dynam environ proc int conf multi agent editor learn dai system springer sg wood architectur evalu collabor system technic report carnegi mellon wooldridg jen intellig theori practic knowledg engin kinni gaia methodolog analysi design journal autonom agent multi agent strateg allianc approach global harvard busi school yu model strateg relationship process reengin phd depart comput
IR/440 5 unifi approach html wrapper learn gunter grieser klau jantk steffen lang bernd thoma technisch universitat fb informatik germani deutsch forschungszentrum fur kunstlich intelligenz germani universitat institut fur informatik germani universitat fb informatik germani abstract dynam internet inform sourc bear abund evid autom inform extract call formal match world wide web realiti learn approach learnabl result appli formal concept elementari formal system appropri gener wrapper class relev descript internet sourc html format relat learn result prove wrapper automat learnabl exampl set stage inform extract internet exploit induct learn techniqu motiv todai onlin access million billion document world wide web great challeng research area relat knowledg discoveri inform extract gener task locat specif piec text natur languag document author approach draw advantag fact document prepar internet xml possibl forthcom syntax interpret browser sit world wide web document syntact express control interpret includ visual interact behaviour text format annot string numer command document content syntact express hidden user user typic interest vari syntact trick invok inform inform present approach assum user deal desir system deal syntax characterist scenario user sourc document highlight repres piec inform interest assum user view evolv gradual chang repres relat text string underli sourc user input sampl instanc relat sourc document left system understand target inform wrap syntact express learn task pose system system gener wrapper concept extract procedur appli sourc extract mechan gener hypothet relat return user step gener mention learn task solv system provid sampl illustr user view sourc receiv list extract tupl user compar system guess result aim depend comparison complain result indic erron extract tupl supplement tupl miss system output user return inform cycl learn inform extract initi interact extract mechan gener appli sourc document cycl interact improv result theoret system perform learn process base posit neg exampl provid user introduct explain approach bibliographi paper list referenc paper present induct infer formal languag posit angluin ch survei induct theori figur order extract assum special text segment delimit call mark begin end relev inform extract extract author text segment resp interpret left anchor author year public identifi left anchor anchor extract author relev year public bibliographi repres html document straightforward find left anchor author nearest left anchor year public repeat long pair anchor found approach commun basic idea defin extract procedur base descript languag investig show wrapper classifi express base structur constraint lead gener question regularli structur descript automat construct learn rule base defin wrapper discuss present figur capit letter denot termin symbol typeset ital rule interpret author year public extract document case match pattern ar yr instanti variabl meet constraint constraint state variabl replac string string constraint explicitli state text segment suit substitut variabl rule text segment substr document match pattern ar yr constraint instanti variabl yield inform requir figur aim paper twofold uniform repres advanc elementari formal system concept gener elementari formal system studi respect investig express power show suffici wrapper semant reason lai cornerston investig learnabl result achiev lift prototyp show describ class html island wrapper prove learnabl island wrapper posit exampl natur assumpt advanc elementari formal system introduc gener formal describ advanc elementari formal system studi express power deal question learn exampl gener elementari formal system introduc develop theori function learnabl intens studi formal framework elementari formal system provid notion notat formal assum mutual disjoint set finit set finit set set variabl call element pattern string ground pattern pattern set variabl predic ariti pattern atom formula pattern ground denot set variabl bn atom bn head form bodi ground atom ground call fact write oe map pattern oe pattern obtain appli oe atom bn rule set coe bn oe ground instanc definit finit set rule ef consid logic program negat major pattern plai role term unif realiz modulo equat theori ffi interpret concaten pattern logic program semant ef defin oper notat ef denot set ground atom denot set ground instanc rule definit ef bn bn ig note oper idempot monoton ts convent definit ef decid turn decid case meet natur syntact constraint theorem denot collect describ problem occur put constraint pattern form admiss substitut variabl wrapper figur approach cope problem explicitli describ admiss pattern conveni explicitli describ except postul pattern serv except admiss contrast provid flexibl realiz elementari formal system inform ef rule form atom stand negat finit failur underli mean xn xn predic succe iff predic fail conceptu difficulti occur defin semant logic program negat finit failur constrain meet addit syntact requir definit requir pose similarli stratifi logic program semant easili requir pose inherit conveni properti theorem formal defin notat set rule rule form denot set predic head rule definit semant defin rule ef predic ariti xn xn ae denot collect closer figur realiz describ interest wrapper express show describ formal languag relat result languag class languag class classic chomski hierarchi interest describ strongli establish relat understand express power definit unari predic fs intuit languag defin unari predic definit ae set languag defin languag unari predic class languag defin result put express power perspect class languag theorem ae properti shown theorem close oper concaten elabor accur similarli introduc constraint structur rule ef resp rule form bn substitut jb note opposit hold simpl iff form pattern variabl occur definit bound iff iff regular iff unari predic simpl denot collect regular similarli theorem result establish theorem close oper concaten theorem summar announc relat import languag class chomski hierarchi cs cf denot class context sensit context free theorem ae cs cf ae ae cs assert theorem theorem decid note theorem shown theorem rewrit theorem cs cf learnabl end present basic result question learn exampl studi learnabl languag class defin learn model introduc gold result obtain provid firm basi deriv answer question html wrapper automat exampl briefli review basic concept refer reader miss detail gold model wai present inform formal languag learn basic approach defin concept text text sequenc word exhaust target languag inform sequenc word label altern word label form text remain word label constitut text complement target languag algorithm learner call receiv input larger larger initi segment text inform target languag gener output gener resp learn target languag text sequenc output stabil correctli describ learn text learn text languag class learnabl text learn languag text summar establish learnabl result theorem learnabl inform learnabl inform proof theorem learn algorithm capabl learn class languag inform obtain cf constitut effect class languag effect class languag learnabl inform base weaker posit exampl small languag class turn learnabl denot collect consist rule theorem learnabl text learnabl text proof special case assert theorem remain verifi fag fa learn algorithm learn languag fl ing posit data relev suffic show case theorem theorem rewrit theorem learnabl text learnabl text wrapper html document demonstr provid framework describ wrapper practic relev wrapper call island wrapper main show assumpt learn techniqu invok automat gener island wrapper posit exampl document carri inform relev inform natur depend user perspect assum content document set tupl tupl angluin ch form relev inform list refer present paper figur aim task provid wrapper extract tupl kind document similar document contrast tradit approach user task construct relev interest algorithm automat wrapper exampl semant html document document inform finit set tupl string string occur tupl import subword string refer tupl list refer intend origin complet refer complet belong belong formal semant document set tupl describ inform semant depend interpret relat string tupl subword formal function semant iff interpret condit describ posit begin begin end intuit exampl provid illustr semant learn algorithm learn wrapper implement wrapper extract tupl document island wrapper island wrapper gener structur wrapper design extract inform html list refer figur island wrapper consist basic describ anchor languag coupl fix top level rule determin interplai basic figur island wrapper design extract html document extract variabl basic defin left anchor languag unari predic assum set predic symbol basic mutual disjoint string substitut extract variabl case actual document substr ffi ffi meet anchor languag put constraint surround relev string argu begin minim constraint string substitut extract variabl short distanc small top level rule depict figur rn rn predic occur basic pr pr figur formal island wrapper iw collect predic occur rule figur rule belong basic rule figur rule basic matter note iw theorem iw decid make island wrapper tailor order island wrapper iw extract inform document meet iw comput substr effect island wrapper iw defin view document iw iw island wrapper iw implement semant iff iw result subsect mind unrealist assum class island wrapper learnabl posit exampl understand princip power limit learn approach provid finer island wrapper put natur constraint admiss anchor languag ae iw denot collect island wrapper ae iw set island wrapper ae iw built anchor languag card learn island wrapper mark text readi studi question assumpt island wrapper learn posit exampl defin island wrapper differ anchor languag learn task reduc problem find describ relev anchor languag potenti user provid element anchor languag system user mark interest inform html document inspect illustr list refer figur inform user interest underlin induct infer formal languag posit angluin ch survei induct theori figur mark document implicit inform anchor languag learn easili deduc left anchor languag string form suffix text segment string suffix text segment anchor languag string prefix text segment learner receiv text relev anchor languag input result subsect translat indirectli adapt set learn wrapper mark text semant fix interpret mark text sequenc pair fulfil document finit set pair pn describ begin sequenc document eventu wrapper learner call receiv input larger larger initi segment mark text target semant gener output describ wrapper wim learn semant sequenc output stabil wrapper implement target semant wim learn class wrapper learn semant implement wrapper result point gener limit wrapper induct theorem class ae iw learnabl mark text proof simpl collect island wrapper extract set rule depict figur case set predic set fp fp fp set fp fp ef island wrapper differ left anchor languag extract variabl claim collect fs ing learnabl mark text shown appli argument similarli prove languag class learnabl ordinari text omit detail uniform bound cardin relev anchor learn theorem class ae iw learnabl mark text proof iw ae iw island wrapper extract mark text iw fix interpret claim wim learn iw success fed learn island wrapper mark proce learn problem problem learn anchor languag ordinari text solv deriv individu learn problem independ parallel conclud solut individu problem combin formul solut learn problem type individu learn problem attack problem consist learn left anchor languag extract variabl learn anchor languag variabl vn learn problem type consist simultan learn anchor languag variabl left anchor languag variabl wim input pm set empti sequenc pair pn comput start posit pn uniqu determin substr wn wn append wn rule depict figur set predic formul rule input run ma problem type fix ma built predic comput input run mb problem type fix mb built predic input run mc problem type fix mc built predic rn output ef ma learn problem type defin ma input set determin set suffix string string check ffi set string pass test goto output goto determin shortest string set string suffix goto mc obtain ma replac term suffix prefix hard ma mc behav requir remain defin learn problem type definit mb rg mb input set prefix suffix string bg collect set rule rule search ef lexicograph set output verif mb correct involv due space detail omit convent concept elementari formal system gener advanc elementari formal system proven suffici express repres wrapper practic relev island wrapper repres class html document perspect island wrapper user direct illustr exampl found demonstr present approach learnabl formal languag hard island wrapper automat learnabl exampl throw light difficulti invok learn techniqu inform extract internet author introduc addit constraint famili anchor languag induc island wrapper investig impact constraint learnabl anchor languag meet constraint turn learnabl posit exampl drawn document island wrapper learnabl result learnabl set stage specif approach autom inform extract internet basic scenario sampl internet user view document inform relev mark text passag user view detail mark text passag result mark formal concept underli theoret set suffici express exampl intend view learn automat induct infer island wrapper learn island wrapper extract inform document appli potenti unlimit number document result present paper justifi scenario type prove inform extract induct learn work problem left futur investig question effici algorithm question gener hierarch structur document sourc note formal develop suit describ wrapper class practic relev wrapper class easili learnabl studi formal framework refer infer formal languag posit inform angluin ch survei induct theori comput learn theori elementari formal ieic tran inf formal system unifi framework languag proc int workshop comput learn pp morgan elementari formal system theoret comput identif inform je hopcroft jd formal languag relat wrapper induct inform phd logic brewka principl knowledg pp csli learn elementari formal gener class infer posit elementari formal inform rm theori formal annal mathemat princeton inform extract rule free machin base learn inform extract proc aaai workshop machin learn pp program intellig web proc int symposium methodolog intellig lectur note artifici intellig pp formal system logic program proc logic lectur note artifici intellig pp zeng resolut ef languag proc int confer young comput pp int academ guid tour boundari learn kp jantk lang algorithm learn lectur note artifici intellig pp
DB/441 3 default reason condit constraint thoma institut und ludwig wittgenstein labor für technisch universität austria abstract present approach reason statist subject base combin probabilist reason condit constraint approach default reason condit knowledg base introduc notion condit entail condit probabilist gener entail system condit show formal nice properti show similar behavior reason number exampl avoid drawback reason handl complex scenario pure probabilist subject knowledg input drawn global knowledg show formal nice gener nonmonoton properti notion condit entail similar properti classic counterpart satisfi ration postul gener irrelev direct infer properti notion lexicograph entail satisfi properti ration monoton notion condit entail proper gener classic counterpart classic notion logic entail condit constraint provid algorithm reason analyz comput complex probabilist default condit system lexicograph condit entail subject primari secondari introduct elabor approach reason statist subject base combin probabilist reason condit constraint approach default reason condit knowledg base give inform descript main idea approach assum statist knowledg set individu form penguin bird penguin assum knowledg individu call tweeti scenario ¢ kluwer academ publish print netherland thoma scenario conclud abil fly bodi work literatur deal handl problem draw subject statist knowledg set individu subject knowledg individu reason back refin pollock work loui work ng import applic empir deduct main idea reason subject knowledg individu equat statist refer inform defin set individu individu statist refer class conflict statist prefer illustr reason introductori set bird refer class conclud fli probabl set bird set penguin distinct refer class conflict statist class set penguin conclud fli probabl literatur work levi bacchu al argu reason deal simpl produc unintuit complex exampl stronger critic formul bacchu al procedur identifi refer class select prefer conceptu flaw relev knowledg local concentr singl piec statist singl refer rare case critic limit classic subject knowledg singl individu pure probabilist subject knowledg conclud scenario knowledg penguin probabl resolv problem limit core idea address import question suspect problem reason solv area reason interv restrict probabilist default reason condit constraint condit call condit constraint extens work reason condit roughli divid approach notion logic entail trace back bool base entail de notion coher gener work logic entail weaker notion entail coher show behavior desir reason idea inspir similar behavior reason desir properti default reason condit knowledg base strict statement classic rule call form £ ¤ handl wai condit knowledg base strict statement penguin default bird penguin knowledg scenario conclud compar carefulli reason default reason condit knowledg realiz common form subclass inherit overrid refin probabilist reason condit constraint ad machineri inherit overrid default literatur approach default reason extens work desir properti core properti ration postul ration postul constitut sound complet axiom system classic entail relat uncertainti measur world classic entail preferenti structur probabl possibl measur world rank entail relat base condit object survei relationship friedman halpern show approach describ notion express plausibl measur solv problem irrelev notion ration closur adventur notion entail introduc lehmann notion entail entail system ¥ pearl specif possibl entail al condit entail order solv problem properti inherit thoma class except maximum entropi approach default entail goldszmidt al lexicograph entail introduc lehmann al condit entail belief function approach suggest al combin notion logic entail condit constraint notion entail system ¥ lexicograph condit entail refer result formal probabilist default reason condit constraint formal gener approach reason statist subject knowledg show similar behavior reason number benchmark exampl reason formal avoid drawback reason handl complex scenario pure probabilist subject knowledg input reason global knowledg formal nice gener nonmonoton properti statist knowledg introductori formul penguin bird fli probabl penguin fli probabl formal number import applic reason statist subject knowledg section strong entail probabilist notion entail gener stronger classic notion logic entail base condit classic notion logic entail probabilist logic program handl probabilist formal resolv inconsist probabilist knowledg base belief formal belief set probabilist formula belief set main contribut paper briefli summar show classic notion logic entail dition constraint classic notion entail coher condit constraint properti desir reason statist subject knowledg introduc approach reason statist subject base combin probabilist reason probabilist default reason condit constraint condit constraint approach default reason condit knowledg base present notion condit entail condit combin logic entail condit constraint entail system ¥ lexicograph entail condit entail show formal similar behavior class reason number benchmark exampl handl complex scenario pure probabilist subject knowledg input reason global knowledg show formal nice gener nonmonoton erti notion condit entail similar properti classic counterpart satisfi ration postul gener irrelev direct infer properti notion lexicograph entail satisfi properti ration monoton analyz relationship notion entail show lexicograph entail stronger condit entail show notion condit condit constraint properli extend classic notion entail ¥ system lexicograph condit show notion entail properli extend classic notion logic entail condit constraint provid algorithm consist check reason notion condit entail analyz complex consist check reason notion condit entail rest paper organ section describ motiv technic background work section discuss classic notion entail condit constraint section introduc notion condit entail condit constraint section analyz semant properti formal section provid algorithm reason formal analyz comput section discuss relat work thoma applic section summar main result outlook futur research note proof result full detail appendix motiv main motiv paper elabor gener approach reason statist subject knowledg guid reason turn approach develop probabilist gener classic default reason condit knowledg base give introduct reason classic default reason reason basic idea assum statist knowledg set individu form penguin bird subject knowledg call form subject draw combin statist subject properti abstract statist knowledg describ convex set statist probabl subject knowledg determin convex set subject probabl distribut statist distribut order constrain subject relationship statist subject statist subject knowledg cautiou point conclud properti leg assum connect statist subject knowledg base leg probabl credul subject statist knowledg set individu subject knowledg individu studi field back refin pollock describ main idea reason find probabl hold individu futur incorpor case suitabl refer probabilist default reason condit constraint class individu thing event incorpor refer class proce refer class suitabl statist suggest equat subject knowledg individu statist refer inform defin set individu individu belong refer class conflict prefer smallest statist give exampl illustr reason exampl deal simpl case singl refer class introductori statist knowledg penguin bird scenario subject knowledg call yellow conclud properti leg set bird refer set individu tweeti belong statist properti leg conclud reason leg probabl statist knowledg penguin bird penguin yellow object easi assum yellow conclud properti easi singl refer set yellow set individu sam belong statist properti easi conclud easi probabl show case refer class conflict probabl interv statist knowledg penguin bird bird penguin assum conclud abil fly properti thoma properti set bird singl refer class conclud leg probabl abil refer class set bird set conflict probabl interv set penguin set bird conclud fli probabl penguin prefer compet refer class guidelin reason limit argu give prefer refer class refer class larger probabl interv superclass issu illustr assum statist knowledg bird assum conclud abil conclud probabl bird respect properti ignor refin approach conclud probabl case minim refer class conflict probabl uniqu smallest statist knowledg penguin object bird penguin assum conclud abil refer identifi set penguin set conflict interv refer class subsum guidelin appli refin approach conclud fli probabl probabilist default reason condit constraint complex scenario simpl reason refin intuit complex show statist knowledg penguin bird bird penguin assum case assum conclud abil fly set set individu oscar belong statist fly abil conclud fli probabl conclud probabl probabl fly probabl fly probabl conclud fli probabl drawback reason refin unclear handl pure probabilist subject knowledg input statist knowledg assum scenario subject knowledg probabl oscar bird probabl oscar penguin scenario subject knowledg probabl oscar bird probabl oscar penguin conclud abil fly discuss reason intuit simpl form statist subject knowledg complex unclear reason handl pure probabilist subject knowledg input reason critic bacchu al argu identifi refer class select prefer reason statist subject relev knowledg thoma local concentr singl piec statist singl refer rare case approach reason statist subject knowledg paper avoid drawback handl complex scenario pure probabilist subject knowledg input drawn global knowledg approach crucial guid main idea realiz properti inherit subclass relationship overrid adopt machineri classic default reason condit knowledg base order realiz properti inherit overrid default reason condit knowledg base basic idea condit knowledg base call default consist set strict statement classic logic set rule call statement rule read £ ¤ rule handl wai knowledg repres strict knowledg express rule penguin bird semant condit knowledg base set plausibl entail default semant condit knowledg base literatur survei desir behavior benchmark exampl gener nonmonoton properti benchmark exampl describ import benchmark exampl default reason condit knowledg base exampl show close relationship reason classic default reason condit knowledg base easi exampl qualit version exampl describ aspect ignor irrelev inform properti inherit classic default reason knowledg penguin bird conclud bird desir yellow bird properti mention knowledg irrelev conclud penguin probabilist default reason condit constraint set penguin subclass set penguin inherit properti bird concentr problem knowledg penguin bird penguin yellow object easi desir yellow penguin easi set yellow penguin subclass set yellow yellow penguin inherit properti yellow object semant problem produc deal principl specif problem inherit block classic default reason knowledg penguin bird bird penguin conclud penguin properti specif class overrid inherit properti specif class desir penguin penguin except bird respect abil respect properti leg talk inherit block semant gener describ aspect ambigu preserv knowledg penguin object bird penguin argu literatur classic default ambigu preserv conclud penguin penguin gener nonmonoton properti summar gener nonmonoton properti consid desir classic default reason properti understood consolid view nonmonoton classic default reason adopt desir featur reason statist subject knowledg assum fix condit knowledg base write denot default plausibl entail postul weaken reflex left logic cautiou monoton thoma commonli regard desir reason notion nonmonoton rw logic valid ref logic £ iff cut cm desir properti ration monoton describ restrict form ignor kind irrelev rm import properti irrelev direct infer adapt irrelev formul minimum requir ignor irrelev direct infer simpli entail default atom £ ¤ occur di logic £ system lexicograph condit entail briefli recal entail system ¥ lexicograph entail condit entail preliminari assum set basic proposit defin classic formula induct element classic formula £ ¤ denot proposit constant classic abbrevi adopt usual convent elimin default express form £ ¤ classic finit set formula default theori pair classic finit set default probabilist default reason condit constraint world truth assign atom map induct extend classic formula usual iff iff denot set world world £ satisfi classic formula £ model denot iff satisfi default £ model denot iff satisfi set classic formula default model denot iff satisfi element world verifi default iff £ set default toler default set classic formula iff model verifi set default conflict default iff model satisfi world rank map world default rank map falsifi default iff integ admiss default theori default conflict default default iff exist default rank admiss iff set system default theori entail ¥ system link order partit default rank probabl rank uniqu order partit set toler defin default rank world rank assign world eri rank world defin defin prefer relat world world iff model set classic formula model iff model ¤ £ classic formula ¤ £ iff true £ model ¤ lexicograph entail default theori defin prefer relat world world lexicograph prefer thoma world iff exist ¤ ¤ £ £ £ ¤ model set classic formula lexicograph minim model iff model lexicograph prefer classic formula lexicograph consequ iff true lexicograph minim model condit entail default theori order transit binari relat admiss iff set default conflict default base defin prefer order world world world denot iff default ¤ £ ¤ ¤ £ £ exist default model set classic formula model iff model minim model iff model prioriti order admiss classic formula condit consequ iff true minim model technic preliminari give technic background introduc proposit languag boolean combin condit constraint interpret probabl distribut set world probabilist framework literatur survei sententi probabl logic import work nilsson fagin al frisch haddawi technic concept adopt defin probabilist default theori probabilist knowledg base syntax strict probabilist formula strict condit constraint express ber strict condit constraint form classic formula ¤ £ strict logic constraint real defin strict probabilist formula induct strict condit constraint strict probabilist formula strict probabilist abbrevi elimin usual probabilist default reason condit constraint set atom penguin fly strict condit fly bird fly strict probabilist formula semant strict probabilist formula probabilist interpret probabl function map sum £ £ ¤ £ probabl classic formula probabilist interpret denot defin sum classic formula abbrevi truth strict probabilist formula probabilist interpret denot induct defin iff iff iff satisfi model iff set atom fly set world fly fly probabilist interpret easi verifi fly fly fly true syntax probabilist default theori probabilist knowledg base condit constraint express form real number ¤ £ classic formula condit constraint mean £ probabl ¤ condit constraint strict condit constraint probabilist formula strict probabilist formula condit constraint probabilist default theori consist thoma finit set strict logic constraint finit set tional constraint iff condit constraint form conjunct atom probabilist knowledg base strict probabilist formula role reason cal subject knowledg express classic repres classic default knowledg pure probabilist statist repres subject knowledg probabilist default theori repres statist knowledg set probabilist knowledg base repres subject knowledg individu differ pure probabilist subject knowledg classic default knowledg input introductori section model statist knowledg penguin bird express probabilist default theori bird leg subject knowledg express probabilist knowledg base penguin semant probabilist default theori knowledg base mean probabilist knowledg base probabilist default theori notion consequ relat tight consequ relat describ entail tightest entail interv relat roughli denot set strict probabilist formula strict condit fix probabilist default theori consequ relat subset tight consequ relat subset section exampl knowledg penguin bird express knowledg impli leg probabl write penguin bird leg express talk tightest probabl bound write probabilist default reason condit constraint tabl probabilist default theori exampl bird leg bird fly fly bird leg fly bird bird fly fly fly fly bird leg fly fly bird penguin bird leg fly fly bird penguin tabl ii tight reason ¢ ¥ ¢ bird leg ¢ bird ¢ yellow ¥ leg ¢ ¢ ¥ penguin leg ¢ penguin ¢ yellow ¥ ¢ ¥ ¢ bird leg ¢ ¢ penguin ¥ leg ¢ ¥ ¢ bird fly ¢ ¢ penguin ¥ fly ¢ ¥ ¢ ¢ penguin ¢ ¥ fly ¢ ¥ ¢ fly ¢ ¥ fly ¢ ¢ ¢ ¥ bird penguin fly ¢ bird penguin ¢ fly ¥ thoma express probabilist default reason condit constraint probabilist default refer notion entail probabilist knowledg base probabilist default theori make exampl benchmark exampl desir behavior probabilist default reason remark reason exampl literatur summar tabl notat refer reason note probabilist default theori exampl summar tabl adopt gener nonmonoton properti classic default reason section desir featur probabilist default reason naiv probabilist default reason reason statist subject knowledg exist formal reason condit constraint show classic notion logic entail classic notion entail coher show nice behavior benchmark exampl describ notion logic entail entail coher probabilist default theori knowledg base analyz behavior benchmark exampl logic entail describ notion logic entail condit constraint argu logic entail probabilist logic back bool defin notion logic entail probabilist gener probabilist default theori knowledg condit constrain call probabilist formula probabilist interpret satisfi default denot iff model truth probabilist differ strict condit constraint satisfi set probabilist formula model denot iff satisfi satisfi iff model exist defin notion logic entail strict probabilist formula logic consequ set probabilist formula denot constraint probabilist default reason condit constraint iff model model strict condit tight logic consequ denot iff infimum ject model note canon defin probabilist default theori knowledg condit defin probabilist default theori probabilist knowledg base form strict condit constraint denot iff tight denot iff perform condit tight infimum subject model denot condit subject knowledg fix draw request probabilist default theori knowledg constrain defin notion appli probabilist default theori probabilist knowledg base strict probabilist formula denot iff strict condit constraint tight denot iff union entail coher roughli simpli draw describ entail de notion recent gener probabl assess defin entail coher condit constraint introduc condit constrain variant probabilist default theori knowledg base condit constraint identifi real number condit event express form classic formula £ probabl assess set condit ¤ event consist set classic formula map associ member real number thoma defin map ¤ real number interpret random gain nation ¤ bet amount stake ¤ bet ¤ pai amount back amount turn true notion coher assur imposs loss bet scheme probabl assess set condit event coher iff number condit ¤ real probabl assess set condit event consist set classic formula map assign interv properti gener coher iff coher probabl assess exist defin notion entail coher probabl assess set condit event probabl assess condit event consequ iff cise probabl assess tight consequ iff infimum subject abil assess set strict logic constraint default express probabl assess set condit event finit set strict logic constraint iff strict condit constraint consequ finit set strict logic constraint default denot iff sequenc tight consequ denot iff tight consequ probabilist default reason condit constraint extend entail finit set strict logic constraint default strict condit £ constraint ¤ classic formula probabilist default theori knowledg condit extend notion entail probabilist default theori knowledg base defin notion probabilist default theori base form strict condit constraint iff denot consequ denot probabilist knowledg tight iff probabilist default theori knowledg constrain defin appli probabilist default probabilist knowledg base theori logic finit set strict condit constraint strict condit constraint denot iff tight consequ denot iff relationship logic entail entail coher shown stronger entail weaker logic entail finit set strict logic constraint default satisfi finit set strict logic constraint default strict condit constraint note statement gener hold strictli stronger entail strictli weaker logic entail benchmark exampl analyz behavior benchmark exampl tight interv shown tabl iii note simpl produc tight interv restrict discuss entail tight interv show notion entail properti compar reason entail strong thoma tabl iii tight naiv probabilist default reason ¢ bird ¥ leg ¢ ¢ ¢ ¥ bird yellow leg ¢ penguin ¥ leg ¢ ¢ ¥ ¢ penguin yellow bird ¢ leg ¥ ¢ ¢ ¢ ¥ penguin leg ¢ ¢ bird ¥ fly ¢ ¥ ¢ penguin fly ¢ ¥ ¢ ¢ ¥ ¢ penguin fly ¢ fly ¥ ¢ ¢ ¢ ¥ fly ¥ ¢ ¢ ¥ bird penguin fly bird penguin fly yield trivial interv undefin pure probabilist subject knowledg report unsatisfi empti interv interest monoton notion roughli miss properti inherit properti overrid principl ideal notion entail probabilist default reason lie idea obtain notion strengthen ad inherit mechan idea weaken ad overrid techniqu handl rest focu idea probabilist default reason extend classic notion entail system ¥ pearl lexicograph entail condit entail probabilist default theori knowledg probabilist default reason condit constraint base show formal nice behavior benchmark exampl preliminari start defin probabilist counterpart import concept classic default reason survei probabilist interpret verifi default iff falsifi default iff set default toler default set strict logic constraint iff model verifi set default conflict iff model verifi default rank map nonneg integ admiss probabilist default theori default conflict default default iff exist default rank admiss iff default rank exist lemma admiss default rank lemma iff set fault rank admiss iff toler probabilist default theori lemma lemma probabilist default theori iff exist order partit condit toler set probabl rank map probabilist interpret member toler tic interpret extend strict probabilist formula admiss iff admiss default iff interpret £ abil ¤ probabl rank admiss thoma probabilist default theori iff admiss strict logic constraint default system extend entail ¥ system condit constraint probabilist default theori ¥ entail system condit constraint link order partit default rank probabl rank uniqu order partit set toler exampl show tabl leg fly fly tabl fly fly fly defin default rank probabl rank assign abil rank probabilist interpret defin result show default rank admiss probabl rank admiss lemma default rank admiss probabl rank admiss defin prefer relat probabilist interpret probabilist interpret iff model set probabilist formula model iff model readi defin notion strict probabilist formula denot iff probabilist default reason condit constraint satisfi strict condit constraint model tight denot iff infimum subject model probabilist default theori defin extend notion strict probabilist formula classic formula £ ¤ give exampl show gener lack properti inherit except subclass respect properti probabilist knowledg base probabilist default theori tabl probabilist knowledg base tight interv leg penguin obtain set set model model infimum subject model leg interv show preserv ambigu tabl probabilist penguin knowledg base tight interv fly model lexicograph entail set model set fly extend lexicograph entail condit constraint probabilist default theori defin lexicograph erenc relat probabilist interpret probabilist interpret lexicograph prefer iff exist model set probabilist formula lexicograph minim model iff model thoma defin notion lexicograph entail strict probabilist formula denot iff model satisfi strict condit constraint tight denot iff infimum subject model extend notion default theori defin probabilist knowledg base strict probabilist formula classic ¤ formula £ give exampl show correct properti inherit except subclass probabilist default theori tabl probabilist knowledg base tight interv leg model leg penguin set set model interv leg leg show preserv ambigu knowledg base tight interv penguin fly model condit entail tabl probabilist set set model final extend condit entail condit constraint probabilist default theori defin prioriti order prioriti order transit binari relat admiss iff set default conflict default default iff prioriti order admiss exampl show admiss prioriti order probabilist default reason condit constraint admiss fly fly shown tabl prioriti shown tabl prioriti admiss fly fly lemma admiss prioriti order lemma prioriti order admiss iff toler probabilist default theori lemma show exist admiss prioriti order exist admiss default rank lemma probabilist default theori iff defin prefer order probabilist interpret probabilist interpret prioriti ing iff exist default model set probabilist formula model iff model model set probabilist formula minim model iff model prioriti order admiss defin condit entail strict probabilist formula denot iff satisfi strict condit constraint model tight denot iff infimum subject model lemma show suffici defin notion term minim prioriti order lemma probabilist knowledg probabilist default strict condit constraint iff infimum subject model minim prioriti order admiss thoma final give exampl show correct properti inherit except subclass probabilist default theori tabl probabilist knowledg base penguin leg tight interv prioriti order uniqu smallest prioriti order lemma restrict attent set model set model interv fly fly preserv ambigu knowledg base penguin leg tabl probabilist fly tight interv prioriti order uniqu smallest prioriti order lemma restrict attent model easi verifi model model model fly fly interv convex hull interv fly fly fly benchmark exampl fly fly fly analyz behavior notion benchmark exampl tight interv shown tabl iv turn properti show behavior similar reason notion entail ignor irrelev show properti inherit global probabilist default reason condit constraint tabl iv tight probabilist default reason ¢ ¥ ¢ bird leg ¢ ¥ ¢ ¢ ¥ ¢ bird yellow leg penguin leg ¢ ¥ ¢ ¢ ¢ ¥ penguin yellow bird leg ¢ ¥ ¢ ¢ ¥ ¢ penguin leg bird fly ¢ penguin ¢ fly ¥ ¢ ¥ ¢ ¢ penguin ¢ ¥ fly ¢ ¢ fly ¥ ¢ ¢ ¥ fly bird ¥ penguin ¥ fly ¥ bird ¥ penguin ¥ fly ¥ respect principl specif block properti inherit problem preserv ambigu note notion entail handl pure probabilist subject knowledg input gener properti analyz gener properti notion nonmonoton relationship relationship classic formal nonmonoton properti concentr gener nonmonoton properti section turn notion gener nonmonoton properti counterpart classic default reason formal show nice nonmonoton behavior fix notion entail respect probabilist default theori thoma theorem show satisfi postul theorem satisfi properti probabilist knowledg base strict probabilist formula rw logic valid ref logic iff cut cm theorem show notion satisfi properti ration monoton theorem satisfi properti probabilist knowledg base strict probabilist formula rm result show satisfi properti irrelev direct infer theorem satisfi properti probabilist knowledg base strict probabilist formula atom occur di relationship formal logic analyz relationship formal turn notion relat counterpart classic default reason theorem show stronger graphic illustr arrow figur probabilist default reason condit constraint theorem probabilist default probabilist knowledg strict condit constraint impli impli tight tabl iv show case figur fact complet pictur shown notion entail figur relationship formal relationship classic formal final analyz relationship formal classic default reason condit knowledg base classic probabilist reason condit constraint logic formula probabilist formula condit constraint kind strict logic formula strict probabilist formula strict condit constraint form logic default theori probabilist default theori logic formula logic knowledg base strict logic formula oper logic set logic logic default replac strict condit constraint default classic implic classic default logic default theori denot classic notion entail respect theorem show notion entail gener classic counterpart classic default reason probabilist default reason thoma theorem logic default theori logic knowledg base strict logic formula semant iff iff corollari show probabilist consequ gener classic probabilist tight consequ gener classic proper consequ corollari logic knowledg base semant logic default theori ¤ iff ¤ iff roughli result show union statist subject knowledg notion coincid logic entail union statist subject knowledg theorem probabilist default probabilist knowledg base satisfi semant iff iff algorithm provid determinist algorithm probabilist default reason introduc notion note nondeterminist algorithm sketch appendix overview problem give overview reason task optim problem fix semant probabilist default reason condit constraint probabilist default theori decid probabilist default theori probabilist knowledg base strict condit constraint decid tight probabilist default theori tic knowledg base £ ¤ classic formula comput uniqu consist algorithm figur decid probabilist default theori comput return nil base lemma essenti reformul algorithm decid classic default reason goldszmidt pearl algorithm probabilist default theori nil return repeat return return nil figur algorithm toler consequ tight consequ reduc problem decid comput tight problem decid logic consequ comput tight logic entail interv probabilist default probabilist knowledg base kei idea reduct set subset exist iff thoma algorithm probabilist default theori probabilist knowledg base denot return unsatisfi ¥ figur algorithm algorithm return satisfi probabilist default theori probabilist knowledg base denot unsatisfi return begin return satisfi ¥ ¥ begin ¥ ¥ figur algorithm algorithm probabilist default theori probabilist knowledg base unsatisfi return ¢ minim prioriti order admiss ¥ case ¢ return figur algorithm algorithm £ probabilist default reason condit constraint probabilist default theori probabilist knowledg base strict condit constraint return figur algorithm £ algorithm return probabilist default theori probabilist knowledg base classic formula £ uniqu pair real number ¢ ¢ begin comput return ¢ ¢ figur algorithm iff iff iff exist iff iff minim prioriti order exist iff iff prioriti order admiss element set satisfi tice unsatisfi probabilist default theori defin readi formul tight logic tight logic denot set thoma theorem probabilist knowledg base tional constraint semant iff iff probabilist default strict subject probabilist default theori probabilist knowledg base classic strict condit constraint ¤ problem decid £ comput reduc comput appli theorem set step comput algorithm ur base iter comput easili implement algorithm simpl exhaust lemma step figur comput complex analyz comput complex optim problem probabilist default reason section complex class assum basic knowledg briefli describ complex class occur result background class problem solv determinist polynomi time oracl class complementari class interchang class problem solv oracl size problem input class problem solv determinist polynomi time oracl probabilist default reason condit constraint relationship complex class classifi problem comput output function class introduc function analog overview complex result analyz complex optim problem section assum nal conjunct strict condit constraint gener case restrict assum £ restrict ¤ conjunct complex result summar tabl roughli complex probabilist default reason condit constraint combin complex classic default reason condit knowledg base complex classic probabilist reason condit constraint £ ¤ atom tabl complex consist gener case case tabl vi complex consequ gener case case thoma tabl vii complex tight consequ gener case case turn decid horn case counterpart classic default reason tractabl problem complex counterpart classic default reason decid gener significantli complex decid classic logic consequ condit constraint comput tight interv complex comput tight interv classic logic comput tight interv complex membership result theorem show consist np theorem probabilist default theori np decid result show consequ theorem probabilist default theori knowledg base strict condit constraint decid probabilist default theori probabilist decid edg base strict condit constraint probabilist default theori edg base strict condit constraint probabilist decid theorem show tight consequ entail theorem probabilist default theori probabilist knowledg base classic £ formula ¤ probabilist default reason condit constraint probabilist default theori edg base £ ¤ classic formula comput probabilist default theori probabilist edg base £ ¤ classic formula comput hard result probabilist result show consist case theorem probabilist default theori decid result show decid hard gener decid consequ hard case theorem probabilist default theori knowledg base strict condit constraint decid probabilist default theori edg base strict condit constraint decid case probabilist probabilist default theori probabilist case edg base strict condit constraint decid probabilist default theori edg base strict condit constraint decid probabilist case tight consequ case theorem probabilist default theori knowledg base £ classic ¤ formula comput ration number case relat work work closest spirit paper bacchu al random world method reason statist thoma knowledg belief bacchu al richer pure probabilist belief input bacchu al deriv exact point probabl strong random world close relat reason maximum entropi proposit reason random world method gener probabilist reason maximum entropi default reason maximum entropi system ¥ goldszmidt al proposit bacchu random world approach roughli understood maximum entropi counterpart formal probabilist default reason approach reason statist subject knowledg pure probabilist subject input knowledg minimum combin statist subject probabl distribut work bacchu al close relat work concern idea combin rank function probabl briefli sketch concept associ proposit order pair consist ordin real al defin lexicograph probabl sequenc probabl measur applic discuss applic notion strong notion entail probabilist handl probabilist belief strong entail probabilist logic present notion complet notion entail probabilist reason refin classic notion logic entail probabilist logic ad base principl properti inherit subclass relationship specif rule add classic probabilist reason assumpt properti inherit subclass specif piec probabilist knowledg overrid specif notion entail tighter classic notion logic entail probabilist logic statist subject knowledg logic conclud leg probabl probabilist default reason condit constraint conclud leg probabl obtain tighter properti leg probabl inherit bird penguin notion gener stronger classic logic entail altern classic notion logic critic literatur inferenti weak nilsson suggest maximum entropi techniqu order obtain stronger notion shown formal probabilist logic program handl probabilist inconsist introduc formal probabilist default reason handl inconsist probabilist knowledg base probabilist default theori probabilist knowledg base mean set express knowledg retract repres gener knowledg hold techniqu probabilist understood techniqu resolv inconsist fault reason bird shown tabl leg fly inconsist resolv retract fly penguin default leg fly entail default fly retract remark notion resolv inconsist appli principl specif piec probabilist knowledg prefer specif note wai resolv simpli relax probabl bound minimum suggest al belief belief deal problem incorpor belief current state belief influenti theori belief makinson point thoma boutili goldszmidt pearl belief default reason condit knowledg base close relat boutili show rank system ¥ correspond natur epistem order theori result suggest similarli close relationship probabilist default reason belief probabilist formula probabilist set strict probabilist formula belief probabilist default theori epistem state defin believ epistem state belief iff summari outlook present approach reason statist subject base combin probabilist reason condit constraint approach default reason condit knowledg base introduc notion condit entail condit combin classic notion logic entail condit constraint classic notion entail system ¥ lexicograph condit entail show formal follow main idea avoid drawback behav similar reason handl complex scenario pure probabilist subject knowledg input reason global knowledg show formal nice gener nonmonoton properti satisfi ration postul gener irrelev direct infer properti notion lexicograph entail properti ration monoton show formal properli extend classic counterpart default reason classic notion logic entail condit constraint gave algorithm reason analyz comput complex interest topic futur research extend approach classic default reason probabilist framework condit constraint interest variabl strength statist knowledg gener system goldszmidt pearl maximum entropi approach parson interest question tractabl case reason formal gain tractabl decid probabilist default reason condit constraint case syntact semant restrict spirit acknowledg grate construct comment question discuss earlier version paper electron transact artifici intellig john pollock comment point relev literatur special joe halpern comment earlier version notion point relat work anonym comment suggest improv work support dfg grant austrian scienc fund project appendix proof section proof lemma assum admiss default admiss impli conflict toler assum toler admiss conflict default toler toler contradict fact conflict admiss proof lemma assum exist default rank admiss suffici show nonempti element toler element lemma admiss toler toler defin default rank order partit assign low lemma admiss thoma proof lemma claim immedi lemma model show admiss definit hold show admiss toler model admiss proof lemma analog lemma prioriti order admiss proof lemma assum default rank admiss binari relat defin default prioriti order set default iff conflict default default admiss assum prioriti order admiss minim wrt restrict defin sequenc default wrt prioriti order admiss mal element lemma toler defin default rank lemma admiss proof lemma prioriti order admiss properli show contradict model assum model model model model probabilist default reason condit constraint default contradict model model proof section proof theorem consist assum claim model model logic model model model left logic model logic model model model model case model model prefer case prioriti order admiss exist model contradict model model exist model model cautiou model model case exist model prefer case prioriti order admiss exist model model contradict model model model model loss assum model case model model prefer case prioriti order admiss model contradict model model model model thoma model model model proof theorem model satisfi model model prefer contradict model model model common model rank satisfi model default model model model model lower rank model proof theorem assum claim denot set atom model denot set atom model model case model prefer case prioriti order admiss model uniqu probabilist interpret coincid probabl classic formula denot cardin denot restrict easi verifi coincid probabl classic formula satisfi default model prefer contradict model model model model direct assum assum model exist model satisfi logic probabilist default reason condit constraint model contradict model model assum prefer prioriti order admiss model model satisfi model model show hold construct hold logic satisfi model proof theorem model satisfi model model satisfi assum model satisfi prioriti order admiss model satisfi defin prioriti order iff ¥ default rank system lemma admiss admiss model satisfi show model minim contrari model exist model exist default maxim falsifi default satisfi default contradict model model model satisfi proof theorem semant natur extend default rank default rank defin easi thoma verifi default rank defin system ¥ iff default rank defin system ¥ show iff natur extend binari relat binari relat defin easi verifi prioriti order admiss iff prioriti order admiss show iff probabilist interpret satisfi default iff satisfi classic default world iff satisfi iff satisfi note show satisfi iff satisfi model model proof show model satisfi iff model satisfi suffici show model constraint satisfi strict condit iff model ¤ satisfi assum model satisfi model satisfi defin probabilist interpret model satisfi model minim model contradict assumpt satisfi satisfi assum model ¤ satisfi model satisfi world satisfi model ¤ satisfi contradict assumpt model satisfi model satisfi claim fact proof theorem assum model satisfi model prefer model satisfi distinct model satisfi incompar set model coincid set model assum probabilist default reason condit constraint model satisfi prioriti order model model satisfi distinct model satisfi prioriti order set model coincid set model proof section proof theorem statement hold assum follow observ probabilist interpret iff model minim model model model show satisfi model exist model contradict model model model show exist model model prefer contradict member model proof section recal result prove theorem show decid satisfi logic consequ strict condit constraint np theorem finit set strict condit constraint decid satisfi np finit set strict decid dition constraint strict condit constraint logic consequ thoma provid small model logic entail tight bound polynomi size attain model polynomi size size nonneg integ denot defin size nonneg ration prime integ assum theorem finit set strict condit constraint ber denot defin strict condit constraint denot cardin greatest size ration number assum number size exist model size result show comput logic entail tight bound gener case round binari search polynomi number call algorithm theorem finit set strict condit constraint classic ¤ formula £ comput uniqu ration number readi prove theorem proof theorem lemma iff order partit set satisfi theorem guess verifi nondeterminist algorithm polynomi time proof theorem give prepar definit denot cardin order partit admiss iff set satisfi weight probabilist default reason condit constraint algorithm finit set strict condit constraint classic formula £ uniqu pair ration number ¢ denot cardin denot greatest size ration number assum return begin model £ £ begin solvabl £ ¢ £ ¢ £ £ solvabl model ¤ return ¤ ¤ figur algorithm ¤ ¤ ¢ £ £ £ order partit defin denot weight order partit admiss classic default uniqu admiss order partit weight denot satisfi theorem iff properti show decid theorem decid £ ¤ thoma call satisfi comput weight determinist polynomi time call decid call theorem iff properti show decid theorem decid call comput weight determinist polynomi time call comput vector round binari round run determinist polynomi time call decid call theorem iff show decid guess verifi nondeterminist algorithm polynomi lemma prioriti order admiss time guess verifi nondeterminist algorithm polynomi time verifi satisfi call check exist satisfi proof theorem assum definit proof theorem ¢ denot number condit constraint £ greatest size ration number theorem uniqu probabilist default reason condit constraint ¤ ¥ infimum subject request comput variant algorithm step replac return step replac check exist model step check comput determinist polynomi time call step call tight consequ step check comput determinist polynomi time polynomi number call step call tight add prepar comput consequ step tight consequ ¤ proof theorem give polynomi transform graph problem finit undirect graph decid construct probabilist default theori iff set atom defin probabilist default theori defin observ shown georgakopoulo al iff satisfi easi satisfi iff iff thoma proof theorem give polynomi transform problem cal default theori finit set classic formula finit set classic classic formula decid construct statement theorem iff defin probabilist default theori defin corollari hold iff give polynomi transform problem set strict condit constraint decid satisfi loss assum model construct statement theorem satisfi iff defin probabilist default theori distinct atom occur defin easi satisfi iff give polynomi transform problem classic default theori finit set classic horn formula finit set classic classic formula conjunct decid construct statement theorem iff defin probabilist default theori defin corollari hold iff probabilist default reason condit constraint defin hold iff give polynomi transform problem classic default theori finit set classic horn formula finit set classic classic formula conjunct decid defin proof similar line argument proof iff proof theorem give polynomi transform low travel salesman cost problem set citi nonneg integ distanc ¥ citi comput smallest length subject tour minimum permut loss assum semant ¥ denot smallest length sum ¥ construct statement theorem ¥ set atom defin defin set condit constraint describ set permut member roughli world model correspond permut member vice versa defin set condit constraint associ thoma permut tour atom sum tour defin probabilist default theori defin observ notic satisfi easi theorem iff shown refer logic vol librari reidel logic theori partial meet contract symbol logic propag condit pp belief pp believ basi comput intel statist knowledg base artif intel manag priorit pp default rule possibilist pp condit object possibl artif intel function default artif intel logic complex probabilist default reason condit constraint logic probabilist default probabl choic econometrica investig law found mathemat theori logic probabl walton dover entropi variabl strength pp default reason belief modal artif intel logic foundat probabl chicago press numer ordin probabilist ieee tran syst man cybern de theori probabl wilei fuzzi comput intel preferenti nonmonoton relat pp object consequ ieee tran syst man cybern theori brewka principl knowledg csli public de reason journal intellig inform system numer ra intellig system elli pp reason condit knowledg complex tractabl artif intel logic reason inf comput measur default acm deduct probabilist artif intel handbook reason uncertainti manag system kluwer academ comput guid theori freeman default causal condit theori mit press bridg approach default artif intel complex reason coher system ann math artif intel thoma consist condit probabl zadeh advanc intellig vol lnc pp maximum entropi approach nonmonoton ieee tran pattern anal mach intel consist artif intel simpl approach belief belief updat reason evid pp probabl default belief causal artif intel world maximum artif intel sententi probabl current technic applic press descript pp reason terminolog pp de gener method probabilist orsa comput catalog complex van leeuwen handbook theoret comput vol mit pp preferenti model cumul artif intel logic foundat statist infer reidel refer sci pp semant frequent comput intel modif evidenti pp monoton theorem pp condit knowledg base pp perspect default ann math artif intel condit knowledg base artif intel knowledg mit press refer kanal uncertainti artifici intellig pp probabilist deduct taxonom probabilist conjunct int approx reason probabilist default reason condit constraint disjunct logic program probabilist intern confer logic program nonmonoton vol lnai pp logic ieee intern symposium logic pp deduct condit constraint basic artif intel logic program inherit logic program condit acm transact comput logic bound probabl uncertain comput intel queri process empir deduct ieee tran knowl data eng artif intel comput complex semant nonmonoton pp natur order default tractabl applic default pp foundat reason brewka principl knowledg csli public probabl foundat induct oxford press theori probabl california press semant approach nonmonoton ieee symposium logic comput scienc pp condit dynam theori epistem harper causat belief vol pp probabilist bound pp
DB/442 3 updat extend logic program abduct sakama katsumi inou depart comput commun scienc japan depart electr electron engin kobe kobe japan abstract paper introduc techniqu updat knowledg base repres extend logic program type view theori inconsist consid formul updat provid method comput updat program updat program extend logic program specifi abduct updat comput answer set updat program techniqu uniform framework type updat comput exist procedur logic program introduct knowledg base updat inform arriv case updat knowledg base knowledg base kind knowledg variabl knowledg invari knowledg updat permit variabl knowledg updat invari part translat updat variabl part type updat view updat deduct distinct knowledg base subject chang updat directli introduc inform knowledg base conflict current knowledg higher prioriti put produc consist theori call type updat theori updat knowledg base inconsist inform knowledg base updat restor consist remov sourc inconsist type updat call inconsist remov studi updat issu logic program deduct individu techniqu realiz updat paper unifi framework realiz view theori inconsist remov extend logic program formul type updat introduc updat program extend logic program abduct show updat realiz comput answer set updat program paper organ section introduc theoret framework paper section present techniqu comput view updat updat program section method comput theori updat inconsist remov section analyz comput complex section present relat section conclud paper preliminari knowledg base repres extend logic program set rule lm ln liter negat failur liter head conjunct lm ln bodi head possibl empti rule call fact bodi empti normal logic program atom program mean state semant defin answer set semant lp set ground liter languag program answer set defin step rule lp answer set minim set satisfi ground rule lm impli empti pair complementari liter lp lp defin rule lm ground rule lm ln ln program form answer set defin answer set answer set answer set consist lp program consist consist answer inconsist liter includ answer set written defin abduct framework paper extend abduct introduc inou sakama abduct program pair lp set liter languag call abduc instanc element call abduc written loss assum rule abduc head fact abduct program ground liter pair explan observ wrt explain extend abduct introduc program remov fact observ unexplain observ note tradit abduct consid introduc explain consist call tradit abduct normal abduct distinguish extend observ call minim impli abduct program observ minim explan observ minim view updat updat program knowledg base variabl knowledg invari knowledg request knowledg knowledg updat request invari knowledg translat updat variabl knowledg type updat call view updat autoepistem theori formul logic program rule abduc bodi made introduc rule abduc definit set variabl rule languag liter program accomplish view updat insert consist program st condit present invari part fourth condit present minim variabl part insert directli introduc knowledg base fact variabl rule invari updat request insert delet ground liter knowledg base view updat problem natur express abduct program program repres knowledg base abduc repres updat liter proposit abduct program ground liter accomplish view updat insert minim explan minim observ wrt goal section provid comput method view updat introduc notion updat program definit abduct program set ur updat rule defin liter rule newli introduc atom uniqu notat pair rule express liter rule insert insert liter rule rule shortli written rule tn instanc liter rule uniqu call updat atom atom true true pair rule situat abduc true rule deriv atom abduc true rule deriv atom abduc true set updat atom denot ua defin ua ua ua ua ua set updat atom form definit abduct program updat program defin ur definit answer set call answer set ua ua answer set repres minim chang updat properti hold proposit abduct program updat program answer set hold answer set st answer set answer set st lp proof answer set ua hold put lp lp answer set answer set answer set answer set put answer set answer set ua abduct program answer answer set lp coincid answer set updat request ground liter insert liter repres rule repres constraint delet liter repres rule repres constraint perform insert program program answer answer set observ observ uniqu minim explan wrt situat express updat atom perform delet program answer answer set observ minim wrt situat express updat atom note insert delet request uniqu answer set answer set comput minim explan realiz view updat knowledg base note constraint extract answer set impli true answer set gener explan addit test check entail pair abduc call observ consist answer set true minim impli insert request pm delet request qn achiev introduc rule pm qn singl goal term mean explain skeptic definit explain credul note skeptic explan proposit proposit abduct program observ explan explan inconsist proof explan consist consist answer set true consist answer set true answer set explan set defin set ua ua defin lemma abduct updat ground liter consist answer set st ua proof consist answer set st ua produc mean make true introduc delet rule lp rule put lp consist answer set true pair minim pair st answer set true answer set st lp ua ua contradict assumpt pair consist answer set true program produc rule lp rule put consist answer set true pair shown similar theorem abduct updat ground liter accomplish insert consist answer set st ua ua satisfi condit proof satisfi condit explan minim explan accomplish insert accomplish insert proposit lemma consist answer set st inconsist condit hold satisfi answer set st satisfi condit put ua ua hold proposit lemma contradict assumpt minim condit select explan comput consist answer set condit select minim explan program local stratifi nlp answer set perfect theorem simplifi corollari abduct program local stratifi updat program ground atom accomplish insert program consist answer set st ua ua proof local stratifi answer set result hold lemma result hold abduct program theorem abduct updat ground liter accomplish delet consist answer set st ua proof delet minim wrt minim wrt atom consist answer set st ua ua lemma consist answer set st ua ua updat rule view fact manner abduct rule call abduc hypothet rule abduc observ background knowledg abduct program introduc section consid special case rule fact extend observ defin section pair set abduc rule abduct program observ explan abduct program abduc rule transfer abduct program abduc fact abduct program abduc rule defin newli introduc atom uniqu abduc rule produc abduct program semant origin abduct program abduct program transform abduct program newli introduc abduc rule explan correspond explan techniqu view updat section directli appli view updat abduc rule theori updat updat program situat inform arriv knowledg base knowledg subject chang program repres current knowledg base program repres theori updat satisfi condit definit program accomplish theori updat consist program st updat program defin union inform maxim subset origin program consist condit impli inform updat inconsist inform make realiz theori abduct framework prioriti current knowledg knowledg abduct program program rule origin program inform variabl abduc rule proposit abduct program accomplish theori updat minim observ wrt proof accomplish theori updat minim set st minim observ wrt abduct program transform abduct program abduc fact techniqu section comput theori updat updat program answer set introduc section updat program minim comput consist answer set constraint consist problem comput consist answer set current knowledg base sleep tv watch tv tv tv updat tv power failur power failur situat express abduct program updat program tv power failur power failur sleep tv watch tv tv tv abduc rule uniqu answer set power tv tv repres delet fact tv theori updat tv updat power failur state power back situat express abduct program updat program power failur sleep tv watch tv tv tv power failur power failur uniqu answer set power power failur impli result updat power failur note hold rule form definit observ formal state theorem updat program accomplish theori updat consist answer set set rule ua proof result hold proposit theorem rule tv power failur tv power failur rule tv power failur tv true abduc fact inconsist remov program inconsist updat recov consist type updat call inconsist remov definit inconsist program program accomplish inconsist remov consist program st inconsist remov captur special case theori updat inconsist empti definit put inconsist remov abduct program proposit directli proposit proposit abduct program accomplish inconsist remov minim observ wrt minim wrt accomplish inconsist remov result hold theorem theorem inconsist program updat program accomplish inconsist remov consist answer set set rule ua program pacif ist pacif ist republican republican answer set lp updat program abduct program pacif ist pacif ist republican answer pacif pacif pacif pacif repres delet rule make program consist comput complex analyz comput complex updat proposit abduct abduct program finit variabl finit set ground liter present complex extend abduct introduc transform extend abduct normal abduct abduct hold explan wrt extend explan wrt normal easili extract put explan wrt normal explan wrt extend wrt observ wrt transform extend abduct normal shown comput normal problem find minim observ mean produc pair abduc check minim theorem proposit abduct program ground liter find explan minim observ find minim observ proof transform normal abduct extend complex class problem extend abduct problem normal abduct result follow complex result normal abduct result impli complex updat theorem find program accomplish view updat insert delet find program accomplish theori updat find program accomplish inconsist remov proof problem find program accomplish view updat insert problem find minim explan minim problem find program accomplish theori updat inconsist remov problem find minim result hold theorem view updat insert gener harder delet level polynomi theori updat inconsist remov hard delet view updat relat work abduct view updat deduct kaka mancarella view updat abduct kowalski abduct procedur comput decker introduc abduct procedur view updat integr mainten procedur correct local stratifi program view updat base procedur restrict program syntax techniqu applic updat comput procedur comput answer set addit task select answer set bry updat abduct specifi updat procedur comput manner consol al provid abduct procedur view updat base clark complet realiz view updat base tradit abduct theori updat updat program comput explan extend abduct inou sakama introduc transact program comput extend applic limit acycl abduct program fagin al discuss view updat theori updat context theori inou sakama view updat normal logic program theori updat term extend abduct updat program paper provid method comput theori updat consid paper gener fagin al updat theori singl formula alfer pereira introduc updat program updat normal extend logic program alfer al framework dynam logic program perform theori updat gener logic program negat failur head approach work point formul updat term abduct program updat program comput view updat theori updat theori updat discuss associ prioriti resolv conflict abduct approach damasio pereira resolv inconsist chang abduc semant summari paper introduc method comput updat extend logic program type view theori inconsist remov term abduct program updat comput updat program result paper show abduct plai fundament role updat problem futur studi extend techniqu knowledg base disjunct refer alfer updat program updat nonmonoton extens logic lectur note artifici intellig page przymusinski dynam logic program proc intl conf principl knowledg page morgan bry abduct deduct proc intl conf logic page mit role abduct view updat intellig inform system damasio pereira abduct extend logic program proc lectur note artifici intellig page decker extens sld abduct integr mainten view updat deduct proc joint intl symp logic page mit press abduct logic semant theoret comput scienc vardi semant updat proc acm symp principl page gelfond lifschitz logic program classic negat proc intl conf logic page mit inou hypothet reason logic program logic program inou sakama abduct framework nonmonoton theori chang proc page morgan kaufmann inou sakama transact extend abduct proc intl conf principl knowledg page morgan kaka mancarella updat abduct proc intl conf larg page morgan przymusinski declar semant deduct logic program foundat deduct logic page morgan satoh comput abduct tm proc intl conf logic page mit zhang foo updat logic program proc european conf artifici page
ML/443 6 workshop learn text june build intellig agent approach shavlik tina dayton street wisconsin abstract present evalu infrastructur rapidli easili build intellig softwar agent task design center basic highli accur standard heurist search lead effici retriev inform approach user tailor system behavior provid approxim advic function advic map neural network implement function subsequ reinforc web dead rate retriev page user provid refin function agent architectur appeal middl ground program languag system sole learn user prefer user rate page present case studi provid simpl advic special system empir studi demonstr approach lead effect homepag finder lead commerci web search engin introduct describ evalu implement system substrat creat intellig agent web approach base idea commun kibler ourston moonei towel shavlik user person interest prefer languag design discuss aspect content structur web page instruct neural subsequ refin train exampl wisconsin adapt web assist idea reinforc learn automat creat train train exampl design import advantag produc agent describ show easili instruct creat finder empir studi finder present result support claim version outperform finder search engin hotbot experi demonstr improv perform train exampl automat gener system descript heart neural implement function guid system wander web judg page encount user program function provid call guid wander score page shavlik call program languag advic underli system blindli follow refin advic base system experi network larg input vector set express advic user person advic essenti attent small subset make learn feasibl cancer research stock analyst express interest advic regularli monitor relev web site articl interest type potenti user develop build intellig agent top peopl result agent phrase user case type user provid advic underli neural imagin type user indirectli special interfac type user creat scenario section tabl descript initi neural network creat read disk resumpt previou view process convert advic neural network analog compil tradit program machin system compil instruct intermedi languag express neural network import advantag automat refin base feedback provid user web tabl algorithm save disk previou creat neural network read user initi advic start ad url search initi search queue url queri user chosen set web search engin site execut concurr process independ process search queue empti maximum number url fetch evalu network score high insert sort list page found score improv predict network evalu hyperlink network score link insert url search queue fit bound independ process user addit insert neural network independ process person rate fetch rate creat train neural network basic oper heurist function provid sort heurist sole find goal collect page rate highest user seed queue page fetch set start url provid simpl queri convert url subset select search engin site mention tabl user depth limit put upper bound distanc system wander initi url fetch page initi predict fetch base content page link fetch analyz system estim page user differ estim constitut tempor differ error backpropag william improv neural network addit method automat creat train user improv neural network wai user provid addit advic observ system behavior invok thought good addit instruct accept advic augment neural network time simpli add network addit hidden unit repres compil techniqu effect demonstr shavlik task provid addit hint rapidli drastic improv perform provid advic relev paper experi evalu increment provis shavlik testb show algorithm robust quickli learn ignor user rate page mechan provid train exampl bp user unabl articul system page provid score standard methodolog investig billsu discuss aspect articl improv neural result user provid advic person easi simpl advic requir larg number label exampl order learn pure induct empir support claim topic experi progress neural network mean mechan process arbitrarili long web page input vector borrow idea nettalk rosenberg basic unit word letter nettalk slide window featur repres page defin respect current center window defin score page highest score network produc page hyperlink comput slide network hypertext hyperlink case window start center word mean nearbi word hypertext fill window posit overview advic languag turn repres web page construct advic languag input featur extract html plain constitut primit advic languag descript basic briefli discuss complic languag construct creat basic extract featur web page standard text inform retriev model left side fig illustr word order lost vector record word present scale number occurr properti tfidf inform retriev system discard common word word root form greatli reduc problem perform preprocess step sole richer preserv inform advantag structur html document fetch page format partial shown line tabl augment local illustr side fig bag word word bag page left current hyperlink window insid current section titl parser web page record titl parent word standard construct indic tabl caption head bag word grandpar current window nest word clarif order web page url page content refer origin web page sampl page space rent stop word remov stem standard approach aspect local space rent page sampl www page sampl word titl word window space rent word url page www sampl page space rent slide window figur intern repres web page tabl sampl extract input featur url case attempt reduc addit word repres fix posit obviou case posit slide repres word fix section due import role special repres field delimit server portion url www aaai org featur repres web rang current version tfidf due manner compil advic neural design lead larger number input assum typic vocabulari ten thousand order repres input vector record featur advantag import aspect neural network repres absent word input featur plai role phase neural weight sum bp due partial deriv involv input featur relat word posit input vector includ length date page creat page server provid window insid html size word word mention advic present learn system hope larg space input featur deal input featur sole learn label exampl advic mean user indirectli select subset featur space huge implicit input vector indirectli select featur involv word advic full input space weight input featur advic high weight valu potenti word mention advic impact network bp complex predic tabl complic predic defin term basic input featur advic finder experi tabl construct tabl satisfi list word basic instruct output tabl sampl advic joe smith home strongli suggest show page joe smith joe smith index home homepag html strongli suggest link strongli suggest avoid show page neural network entri tabl illustr advic map neural network assum seek joseph smith home page intent rule system slide window page plausibl variant person phrase condit larg weight sum output unit network accomplish variant algorithm shavlik rule tabl compil posit treat separ slide constraint itl predic true activ connect referenc input unit newli creat hidden weight set bia hidden sigmoid activ requir predic true order weight sum input exce bia produc activ hidden unit addit link ad hidden subsequ standard link hidden unit output unit weight determin strength rule consequ interpret phrase show page variant rule case studi possibl smith middl initi home possibl titl form page rule show piec advic homepag find compil input true word nth end current hyperlink weight sum substanti treat url separ rule show advic follow link show negat avoid instruct neg weight neural network experi section present case studi illustr effect creat special agent top system task chose task creat finder etzioni system techniqu call dynam refer filter output web indic gener guess url candid found wrote simpl interfac layer top relev inform person home page middl miscellan partial url wrote short program read field creat advic wrote gener advic rule relat slight variant middl special task creat initi gener advic spent part dai advic describ technic comment fulli understand detail experi user retract advic neural network advic ad request find home page learn gener homepag find accomplish crude variabl bind mechan accept instruct word bound input vector field assign queri person ord altern ord ord write advic find featur rule tabl written marker specif motiv methodolog randomli select peopl aha list machin learn reason research run experi evalu reduc comput load limit peopl unit state peopl randomli pick train remain test set manual ran system manual advic advic evalu train train set judg perform task find provid advic discuss import note provid advic specif ai option effect amount execut time accuraci result chose small number maximum number page fetch includ queri initi search maximum distanc travel page return search engin start provid person aha web partial standard exampl common variant convert initi queri search engin mention earlier compar perform perform search engin perform experi etzioni provid web interfac ran hotbot condit set perform special hotbot search aha page queri variant provid hotbot disjunct person requir variant person word queri initi send search engin page hotbot assumpt peopl result return search engin peopl link home compar url provid aha exact comparison content fetch page content page link aha page run fetch url server match aha prevent aha page bp learn perform experi refin automat creat train exampl discuss ran control result discuss tabl list result report percentag report averag ordin posit page hotbot return sort list result provid strong evid version special finder ad simpl produc finder proprietari creat accuraci differ row suggest effect result suggest perform differ confid level cost approach fetch analyz web longer speed ignor question fetch charact web capsul summari search engin relev statist find home averag ninth page fetch tabl empir result system found rank bp bp person search hotbot gener relat work syskil webert billsu webwatch mitchel web agent machin learn techniqu bayesian classifi hybrid learn unlik system unabl accept simpl provid lead learn rate manual visit web page current futur work plan valid claim appeal middlewar creat addit person electron newspap email filter plan continu expand advic languag build abil inform synonym wordnet knowledg text add capabl automat creat plausibl train exampl observ action made user ordinari present evalu appeal approach creat intellig agent web central aspect design system core mean agent built top adapt mean user type defin tailor result agent match person prefer rate inform retriev argu creat softwar agent involv abil direct program provid set approxim abil accept automat train exampl due larg unstructur natur size hybrid approach appeal sole base program languag reli user rate larg number web page case studi present support claim refer tour guid world wide web proc creat reinforc learner machin learn lexic english commun acm theori combin analyt empir method artif intel util knowledg induct learn machin learn identifi interest web site proc learn error natur develop automat text retriev scienc parallel network learn pronounc english text complex system dynam refer case studi homepag domain proc sixth intern world wide web intellig agent approach workshop learn text categor learn predict method tempor differ machin learn artifici neural network artif intel
DB/444 3 mine knowledg geograph data koperski jiawei han huge amount data store data geograph inform inform data grow rapidli compani build data capabl store hundr terabyt data relat natur resourc astronom measur terabyt expect nasa earth observ system transmit gigabyt imag data hour huge amount data pose great challeng tradit data analysi method inform knowledg extract data knowledg discoveri emerg research field technolog discoveri interest implicit unknown knowledg larg data mine repres confluenc research includ machin data inform theori studi knowledg discoveri relat transact spatial data refer extract implicit spatial relationship pattern explicitli store spatial attract attent recent research spatial data featur distinguish relat carri topolog distanc organ spatial index access spatial data access requir spatial geometr spatial knowledg techniqu spatial data mine demand integr data mine spatial technolog crucial challeng spatial data mine explor effici spatial data mine techniqu due huge amount spatial data complex spatial data type spatial access method spatial data mine spatial understand spatial discov spatial relationship relationship spatial reorgan spatial construct spatial optim spatial expect wide applic geograph inform remot imag medic area spatial data short overview provid summar recent studi spatial data includ spatial data mine strength appli challeng face statist spatial analysi statist common approach analyz spatial data statist analysi studi area exist larg number algorithm includ optim techniqu handl numer data realist model spatial phenomena approach base assumpt statist independ spatial distribut data problem spatial data fact spatial object influenc neighbor object regress model spatial lag form depend variabl allevi problem extent make model process complic expert fair amount user domain knowledg control db interfac spatial data structur queri optim focu object attribut extract pattern extract machin data mine method comput geometri evalu statist concept hierarchi knowledg base metadata statist discoveri figur spatial data mine process domain knowledg statist kind techniqu end user analysi spatial data nonlinear rule model symbol valu handl poorli statist approach statist method work incomplet data comput result spatial data mine method extens tradit spatial analysi method put emphasi cooper interact discoveri type knowledg relat data mine techniqu major al tm commerci tool mine storm goal predict hurrican reach territori data describ hurrican observ point observ store tradit tional attribut posit angl multipl tupl describ singl hurrican point data interdepend interdepend data problem algorithm assum independ data gi system support select rule studi show necess extens tradit data mine techniqu spatial data mine analysi complex spatial phenomena spatial object mine process spatial data mine process model ing architectur present figur data mine user control step knowledg discoveri background spatial concept inform store knowledg base data fetch storag db interfac enabl optim queri spatial data index structur effici process compon decid part data pattern recognit decid attribut relev knowledg discoveri extract object usag good result rule pattern discov pattern extract modul modul machin data mine techniqu conjunct comput geometri algorithm perform task find rule relat pattern process evalu modul possibl elimin obviou redund knowledg compon adapt system knowledg discoveri ieee tran knowledg data engin interact control feedback queri refin discoveri final pass user verif method knowledg discov spatial form includ characterist rule gener descript spatial discrimin rule discrimin contrast class spatial data rule associ set featur set deviat evolut rule describ tempor rule describ promin structur cluster rule present number form descript spatial object categor describ number spatial data mine algorithm mine data object detail inform primit concept level desir summar larg set data present high concept level summar detail temperatur precipit data region present gener weather pattern requir data abstract larg set relev data low concept level high perform knowledg extract gener data knowledg discoveri assum exist background knowledg form concept hierarchi concept hierarchi explicitli gener automat data analysi kind concept defin spatial concept inform remain consist lower concept level agricultur concept hierarchi gener concept rice turn gener concept includ wheat similar hierarchi exist spatial data gener region repres counti merg state state merg larger region induct effici data gener techniqu han fu data mine queri express data mine queri languag collect set relev data data gener perform climb gener hierarchi summar gener relationship spatial data higher concept level spatial data climb concept archi attribut valu tupl gener remov attribut gener imposs distinct valu merg ident tupl induct continu attribut gener desir level process merg ident number merg tupl store count aggreg valu quantit attribut store enabl quantit present acquir knowledg gener data express form gener relat data cube oper perform transform gener data form knowledg oper perform view data multipl abstract gener relat map summar present characterist discrimin rule lu al extend induct spatial present gener gener algorithm enabl descript spatial region high level predic algorithm merg spatial region spatial lead map consist small number area descript area produc induct techniqu answer queri descript region disjunct predic gener region gener algorithm creat map consist small number region share descript algorithm start induct spatial gener higher gener extract characterist rule provinc period year relev region temperatur north oder central hot gener extract region provinc period year relev precipit region moder wet figur spatial data queri concept level bore area gener attribut valu merg approxim ignor small region descript data cluster spatial data cluster identifi popul distanc data set data space uniformli occupi data point data cluster identifi crowd discov distribut pattern data set data cluster studi machin learn data mine method cluster analysi techniqu data mine larg spatial larg applic base random algorithm develop ng han cluster analysi improv qualiti effici cluster cluster process present search graph node potenti set central locat point cluster cluster obtain replac singl call neighbor current cluster number neighbor randomli restrict paramet neighbor move neighbor node process start current cluster produc local optimum local optimum start randomli select node search local optimum number local optima search bound paramet solut confin specif sampl comput complex iter basic linearli proport number object find natur number cluster point belong cluster base spatial data mine algorithm develop fashion similar approach discuss algorithm assum user specifi type rule mine relev data learn request similar mine han fu algorithm find descript object cluster orient induct algorithm find vancouv unit cluster locat cluster cluster singl cluster consist singl larg spatial method effici cluster algorithm significantli improv spatial data structur improv effici cluster algorithm sampl method bad sampl lead poor qualiti cluster ester al algorithm improv qualiti sampl algorithm cluster central object leaf node leaf node neighbor point loss cluster qualiti small experi report speed cluster factor number point store leaf node techniqu tree structur perform comput pair object improv effici cluster compar check pair object algorithm cluster featur cf tree construct time consum zhang present birch iter reduc deal problem present method increment possibl adjust memori requir size memori author concept call cluster featur cf tree cluster featur cf tripl summar inform subclust point set point cf defin cf number point linear sum squar sum data xi cluster featur suffici comput cluster constitut effici storag inform method summar inform subclust point store point cf tree balanc tree store cluster featur point insert cf tree ad closest subclust construct cf tree cluster featur leaf node cluster algorithm algorithm point cluster experi report experi show linear scalabl algorithm respect number input good qualiti cluster explor spatial associ method discuss find characterist rule describ spatial object attribut situat desir discov spatial associ rule associ spatial object spatial object concept associ rule introduc mine larg transact agraw al koperski han extend concept spatial spatial associ rule form set spatial predic confid rule rule spatial associ rule state school close sport center close park kind spatial predic constitut spatial associ rule exampl includ topolog relat spatial orient distanc larg exist larg number associ object applic small number confid rule low user interest relat associ singl interest rule appli minimum support minimum control filter associ describ small percentag object rule low confid threshold level descript object threshold find interest associ low concept level number object satisfi predic small mine process initi queri describ class object class set relev relat user describ urban park present descript relat park object user state interest object distanc park minim number costli spatial comput algorithm maximum bound appli detail spatial comput pattern larg support approxim level mine rithm approxim aggreg cluster method answer question cluster spatial problem find cluster question characterist cluster term featur close problem measur aggreg statement cluster close featur inform interest statement close featur aggreg proxim measur close set point cluster featur distanc cluster boundari boundari featur ng present method enabl fast find featur close cluster multipl level mation algorithm encompass convex gradual reduc candid featur approxim circl rectangl elimin featur larg aggreg distanc cluster algorithm calcul aggreg proxim point cluster convex boundari featur pass previou filter algorithm report featur aggreg proxim show minimum maximum distanc point cluster averag percentag point locat distanc threshold algorithm report time process featur mine raster explor raster imag data view case spatial data mine present studi topic observatori sky survei fayyad al sion tree method classif star object terabyt sky imag data imag preprocess imag process system select object produc basic attribut imag base train classifi set rule construct classif process normal imag plate background level averag classif accuraci plate normal normal perform tree method compar neural network neural network fairli unstabl accuraci vari object classifi obtain magnitud previou astronom studi classifi object imag classifi astronom magellan studi analyz high resolut radar imag surfac venu goal identifi task perform manual system basic data featur classif learn data compon effici system identifi portion imag analyz volcano achiev compar intens central pixel region estim background intens neighborhood pixel compon system extract interest featur data standard method pattern recognit edg detect hough deal poorli variabl present case natur data difficult find attribut describ volcano matric imag volcano eigenvector eigenvalu treat attribut describ volcano final perform discrimin volcano object volcano incid angl synthet apertur radar planet instrument strongli influenc imag volcano studi show problem relat differ imag necess plate shown improv plate classif deal uncertainti difficult expert provid classif certainti classif produc larg error classif treat neg exampl smyth al magellan studi analyz issu work model treatment subject label inform expert probabilist model show knowledg discoveri method modifi handl lack absolut ground truth scalabl mine raster data al distribut parallel queri analysi ronment call queri space distinguish raster mine tool account tempor compon dataset design advantag parallel distribut process system enabl extract complex object massiv dataset defin number oper appli queri descript extract object advantag distribut process push task comput data store test larg climat dataset detect weather featur mine gb data year histori yield instanc upward energi wave propag event explain creation hole challeng initi success mine knowledg huge amount geograph data demonstr necess potenti young research field research issu extens studi make mine knowledg larg geograph mechan spatial data mine develop handl multipl themat map interact integr spatial spatial access data wareh techniqu addit data mine task method data guid data studi mine geograph data visual data mine result spatial interact data mine visual feedback design spatial data mine analyz measur discov pattern handl uncertainti incomplet inform spatial data mine fuzzi rough set approach research issu larg amount remot imag data mine method explor data includ detect find similar pictur discoveri relationship phenomena mine sourc distribut store format import issu practic applic includ data clean data integr method mine spatial data combin advanc spatial spatial statist spatial expert system technolog creat intellig gs system spatial data mine attract challeng research theme bring knowledg discoveri power geograph inform system boost gi applic year refer rf wj data mine remot imag intern confer inform knowledg manag pp knowledg discoveri larg spatial techniqu effici class identif advanc spatial pp imag progress challeng knowledg discoveri aaai menlo pp ed advanc knowledg discoveri data mine menlo visual techniqu mine larg comparison ieee tran knowledg data engin ng rt find aggreg proxim relationship common spatial data mine ieee tran knowledg data engin discoveri spatial associ rule geograph inform advanc spatial jth pp bc discoveri gener knowledg larg spatial east workshop geograph inform system world pp select rule induc hurrican knowledg discoveri aaai menlo pp effici effect cluster method spatial data mine intern confer larg data base morgan san pp scalabl exploratori data mine distribut data intern confer knowledg discoveri data mine aaai menlo pp effici data cluster method larg intern confer manag data pp addit refer figur found koperski phd candid school comput simon fraser canada jiawei han professor comput scienc simon fraser canada msc candid school comput simon fraser canada current mail address school comput simon fraser
DB/445 3 vision manag complex model philip bernstein microsoft research wa alon washington problem encount build applic system involv manipul model complex structur repres design relat objectori uml xml semant complex softwar configur model involv manag model transform data model requir explicit model make system easier applic make object special oper simplifi call capabl model manag addit make case model main contribut sketch data model data model consist structur repres model model algebra oper instanti focu structur implement introduct problem encount build applic system involv manipul model complex discret structur repres design xml interfac relat transform workflow semant softwar configur complex document model involv manag chang model transform data model requir explicit map model opportun make dbmss easier applic make object oper simplifi call capabl model manag rachel washington paper make main contribut argu model manag function reduc amount program requir manipul model data model captur model manag function data model consist formal structur repres model map algebra oper structur present shape data model detail justifi thesi model manag worthwhil achiev goal expect detail data model year work function advanc relat oo model manag applic includ lot complex code navig structur maintain navig code drag programm make model manag applic build address level abstract current introduc oper model model composit oper research literatur db field relev design implement model manag function gener support gener model manag interfac illustr scope model offer exampl model model map map xml schema applic order guid exchang xml instanc map web content page layout order drive gener web map data sourc data tabl order gener program transform product data load data map db schema softwar guid migrat map sourc target order drive transform make script port complex applic program environ map compon complex applic compon system deploi order drive gener program build gener function creat model map manipul singl provid environ task expect model manag system primarili manipul model home platform target platform web xml program glue system provid simpl adapt import export model model manag system schema target interpret map model manag system transform instanc target model challeng area find architectur coupl system leverag build model manag function highli gener wide applic competit custom exploit semant data type make gener easili challeng model manag applic consid exampl effort build applic manipul thing thing avoid term metadata overload metadata data keyword data model manag cut problem attent kind structur mathemat semant descript inform leverag gain kind metadata isol describ data focu structur semant model manag implement top advanc db system logic inferenc engin replac technolog begin scenario section motiv coher system describ model oper system provid section discuss formal structur oper section discuss previou work relat model manag system tackl open question extend version paper motiv scenario begin describ scenario model manag system plai central role reduc code burden applic refer model manag oper semant elabor onlin merchant sell book data order store relat schema repres relat data map xml serv data web site share data marketplac onlin merchant dtd conform standard recommend marketplac pant denot map model manag repres class object scenario compani start partnership slightli domain onlin export data dtd compani talk custom dtd element book concern cd task creat relat schema data cd merchant model manag oper creat model proce figur part dtd match creat oper model gener model match function match creat map identifi maxim subset dtd match creat composit includ exact map subset match set creat copi call copi object object connect part match default map dtd relat schema map map map map map transform £ map figur usag model manag oper oper creat model repres part match £ ¤ ¤ ¤ instanti default transform call creat map relat schema domain rang creat align overlap tabl kei prepar merg call merg base model manag oper complic differ common part match function set match dtd rank engin modifi manual system input engin constrain match dtd creat separ relat db compani compani acquir merg db oper relat schema merg origin complex db schema disjoint intern structur system automat gener map schema merg facilit migrat applic merg compani map xml dtd relat schema map pose queri result estim cost process queri result gener function compani face share data growth onlin applic oper import time scenario sound achiev sound extrem hard develop gener algorithm find match distinct model invert arbitrari map optim complet algorithm essenti ingredi success success realiz platform manipul model map high level oper user custom manual algorithm oper section goal reach model section describ attempt data model model manag begin discuss model section discuss map model abstract model label direct graph data model natur platform defin model manag function object model simpl object set properti valu describ state object object relationship set binari relationship relationship pair object refer direct origin object destin direct odmg relationship object assum object instanc class class definit describ set properti relationship properti defin instanc class relationship relationship properti definit relationship properti definit class connect label origin destin side assum class definit object make data model model mixtur class definit ordinari object refer set object interest persist model model composit object object relationship object make explicit repres model object relationship object model time ad relationship ad model object object avoid ordinari relationship model defin content model model simpli set object reachabl root ad relationship object model object immedi part model relationship pair object model solut distinguish relationship impli model similar complex object oo dbmss transit closur relationship eman root assum relationship properti definit schema ¥ set true defin model ¢ definit set object identifi ¢ ¢ set object reachabl relationship worth restrict flag origin side relationship requir relationship model constitut direct acycl graph make correspond intuit notion set simplifi mainten materi enabl content model identifi effici expect simplifi algorithm propag copi oper model section challeng develop mechan repres model store kei issu semant express integr constraint relat schema repres logic formula structur interpret model manag system issu semant model describ store index model challeng storag scheme build model manag system dbm map model kei goal model manag provid support manag chang model map data model crucial model map manipul citizen describ model outlin kei element underli approach model map manipul model map manipul copi delet select avoid defin separ elementari oper requir map model map map map consist connect instanc type map relat schema xml map connect add complex data model unnecessari applic map pair model map relat schema xml dtd repres wai encod instanc relat schema instanc dtd map relat set object model set object languag build complex express map tween relat schema view correspond view view definit part map model languag build express element queri languag arithmet express map nest enabl map model compon map model defin model map definit model map model model model distinguish root element relationship point root object properti identifi model relat map object map properti express object map object relationship domain includ object refer expr map definit map relationship freedom applic structur map wai map similar xml dtd mimic structur dtd relat map highli dissimilar dtd object map children map preserv structur emp addr cat emp phone figur map relat schema dtd figur show map relat schema dtd root connect root relat schema xml requir definit map expr properti abbrevi oper relat domain rang advantag explicit model map pose queri attribut xml dtd map member kei relat formul model answer essenti queri follow regular express similar oql xml queri languag properti expr placehold semant detail requir specif semant root object complex structur repres express challeng find model map trade express semant goal oper gener wide set model type map direct specifi transform data domain rang oper requir map kind composit differenc defin map repres requir manag orient oper input map produc direct map domain rang return approxim issu model manag instanti model map challeng develop algorithm map model produc map oper model recal main goal creat data model model manag reduc amount program requir manipul persist model defin set algebra oper main structur model map requir oper oper return oper oper work type model model manag applic challeng challeng design algebra oper model combin oper effici implement elementari oper standard oper manipul copi definit fairli addit introduc context model manag interest oper model goal captur model manag function undoubtedli time object model navig model set navig data manipul languag underli dbm offer simpler interfac defin oper perform bridg program gap model object model paramet direct order object return cursor oper direct relationship guid avoid model conceiv relationship introduc potenti model membership test object return match differenc applic model manag involv track kei oper accept input return map describ match unlik oper previou output match oper educ guess made base examin schema integr constraint inspect data instanc model guess engin start point design match flavor problem find match depend focu common differ find map model section oper find part dtd match find differ model basic answer highlight differ engin find match consist priori knowledg map knowledg concern object model map model design schema mean home phone mean busi phone partial map model system find complet map extend kei model manag predic specif type model challeng develop algorithm find match model model partial map ifi priori knowledg map find extens complet map match oper appli type model approach obtain gener match encapsul object map criteria similar pair object simpl semant type equal defin match oper input model relat produc map consist object map return match includ express describ domain rang object relat gener match algorithm treat mathemat system black box call gener formula view identifi combin domain rang object match repertoir match custom formal system result match flat object map children root user map mimic structur model match mimick model structur applic easili navig map systemat challeng good structur result match model differenc oper essenti full identifi object model insert delet express object map return full form explain domain rang object relat express domain rang object repres conceptu properti valu relationship differ express mean ordinari differ desir phrase express differ map object empti domain express null challeng diff separ oper special express transform sequenc script gener encapsul gener merg merg activ move content target model sourc model sourc target model amount union sourc target model assign sourc model root sourc target ident placehold hang merg achiev connect root target model children root sourc model effect make copi outgo relationship root connect root semant satisfi step section sourc target merg face avoid creation duplic copi sourc object present properti valu object sourc target state differ insert sourc object relationship present target possibl delet target object relationship sourc address issu gener merg oper variat depend assumpt structur merg address merg paramet delta target drive merg interpret present definit potenti delta challeng semant merg address issu suffici gener subsum semant variat map composit composit map easi defin map ordinari function composit semant work result relationship connect object result map approach relationship map involv composit function result denot creat shallow copi copi map object connect object ¥ replac ¥ £ ¤ ¥ object set set ¥ notic includ map object object includ rang object object equal semant guid procedur result map includ object step section result composit object ¥ object match definit work object map set object object map set web page relat ¥ problemat wai interpret ¥ treat function output set definit composit work case treat function output set individu object step ¥ set object union domain cover semant variat composit oper interest question map relat complex express composit map relat work model manag isol area research db literatur deal aspect problem model manag offer opportun extend work direct section describ work fit vision platform model manag advanc db architectur featur relev develop platform model manag model manag system implement platform includ oo function enabl exploit usual oo featur extens set algebra extens queri model manag function run faster client cach conduc oo db model make techniqu tempor db interest architectur combin oo deduct capabl sophist wai provid benefit model manag lo descript logic inferenc model kei oper model manag involv form invert complet determin model map thought view model term invert map resembl problem invert relev work answer queri view effici oper model transit closur graph import comput closur maintain materi view structur model exploit improv publish techniqu transit closur close relat queri process import learn map model manag function top part differenc differenc model lot differenc graph structur shown comput complex sensit assumpt kind structur graph repres map oper suggest hard develop gener algorithm differenc kind structur interest substanti research literatur differenc leverag understand variat cover gener understand gener solut model chang topic db research data translat recent excel test case gener model manag system schema approach schema integr candid algorithm match inform capac model kei compar model final remark present outlin data model model main abstract captur structur engin inform interfac xml web site semant complex softwar captur relationship model transform match data model includ oper manipul model map class merg oper greatli reduc amount code requir applic manipul model map enabl peopl write model manipul applic todai daunt modern system support function suitabl platform implement model manag data model produc implement cake walk point technic challeng develop customiz effici implement long expect solut challeng result substanti layer softwar properli kind system applic manipul model complic hard build implement gener model manag function line present field stand good chanc improv programm product applic order magnitud excit prospect acknowledg grate suggest thoma sergei john refer rakesh shaul jagadish direct transit closur design perform evalu rakesh agraw jagadish direct algorithm comput transit closur relat peter william peter proc page morgan sander microsoft repositori version open inform model inform maurizio vincini semant integr semistructur structur data sourc sigmod jai won henri korth semant implement schema evolut proc page philip alon rachel vision manag complex model technic report microsoft david jeffrei ullman magic set strang wai implement logic program proc page alex borgida descript logic data manag ieee transact knowledg data bancilhon raghu ramakrishnan introduct queri process strategi proc page philip bernstein data scenario model manag entiti relationship page springer matthia jark manfr jeusfeld rule manag sigmod rick dougla mark jeff david craig torsten fernando editor object data odmg morgan kaufmann sudarshan chawath hector chang detect structur data proc jing elk rundenstein schema reusabl flexibl framework proc page sudarshan anand hector jennif widom chang detect hierarch structur inform proc pedro alon levi learn sourc descript data integr proc dong pang maintain transit closur order delet inform proc shaul dar raghu ramakrishnan perform studi transit closur algorithm proc page dong su increment decrement evalu transit closur queri inform dong su increment mainten view relat calculu sql sigmod page alon answer queri survei vldb yanni raghu linda transit closur algorithm base graph jagadish compress techniqu materi transit closur jan srinivasan rudi gio wiederhold algebra semant semistructur data ieee knowledg data engin exchang workshop wu logic foundat languag pano chrysanthi schema evolut diagram workshop advanc visual page john alexand matthia koubaraki repres knowledg inform system acm laura mauricio hernandez schema map queri discoveri proc renn yanni raghu ramakrishnan inform capac schema integr translat proc page john mylopoulo partit inform base context page gio martin kersten model articul ontolog interdepend proc page myer differ algorithm variat milo schema match simplifi heterogen data translat proc york semant discoveri properti scheme page ieee unit nc bc rw sp vy data process restructur system acm transact denni shasha zhang fast algorithm unit cost edit distanc tree jason denni georg patel structur match discoveri document proc page jason denni shasha edit distanc undirect acycl graph relat problem page
Agents/446 1 framework evalu multiag system methodolog abstract great interest multiag system wide varieti applic recent methodolog relat model techniqu prioriti develop larg scale system work present belong disciplin softwar engin distribut artifici intellig interest softwar engin aspect involv develop multiag system methodolog develop ma methodolog remain extens methodolog extens methodolog effort standard ma platform environ softwar engin aspect develop ma remain open field success agent paradigm requir systemat methodolog analysi design ma applic present paper framework call stand framework criteria comparison ma enabl make compar analysi exist main ma methodolog system orient multiag softwar develop methodolog introduct recent year wit great number theoret practic project field multiag system develop system pose challeng remain open field crucial aspect scalabl adequ softwar engin method université université du à de develop problem undoubtedli bound fact current ma methodolog incomplet factor lack ma platform environ success ma technolog rigor methodolog cover phase ma develop process set task evalu foremost exist ma methodolog develop tool order reinforc strong weak element pave develop adequ ma methodolog develop ma stronger scalabl capabl achiev elabor comparison support compar analysi ma methodolog refer framework compar inform system design method refer framework author adapt analysi design interact system dedic complex administr system criteria framework criteria comparison ma framework base criteria defin comparison ma platform ma group adapt ma develop inspir work origin framework li import adapt objectori softwar engin concept ma develop methodolog goal make ma design systemat hope contribut ma methodolog platform rest paper section describ essenti section present result compar analysi conduct ma section perspect work framework framework defin term dimens author ad cooper dimens dimens technolog ad dimens sixth entitl agent defin criteria mean borrow work dimens express number criteria criteria methodolog dimens descript methodolog framework methodolog plai crucial role ma design miss hidden actual ma design design navig specif viewpoint appli methodolog criteria retain criteria avail softwar methodolog support exist tool support methodolog make reusabl model make methodolog criteria process tradit phase activ softwar engin develop process criterion identifi phase activ exist develop process methodolog criterion entitl prefer process phase phase activ check ergonom evalu develop softwar engin model develop cycl methodolog base criterion call model cascad spiral increment model model develop criterion identifi approach methodolog develop approach evolv user implic contribut outcom softwar develop avoid semant error requir specif error softwar develop cost minimum criterion methodolog mean support facilit commun design user modifi valu criterion system design user interven deliv requir design valu weak user interven begin end medium user interven middl system develop strong presenc user felt system user implic begin analysi phase deliv middl specif design end design evalu model criterion methodolog make provid librari reusabl model avail softwar methodolog criterion tool support methodolog agent technic methodolog dimens requir system extern viewpoint built engin system tend visual graphic order facilit interpret commun expert user hand vital phase system multiag system control system complex requir suitabl assembl mean analysi phase criteria system formal retain framework ad model qualiti deriv dimens describ principl formal model phase criteria system criterion assembl mean analysi typic carri abstract studi strategi criterion describ formal concept methodolog interest formal dynam methodolog provid suffici context support model deriv relationship model system design complet design task faster criterion deriv order relationship model model criterion express element number model model model complet model account total problem model complex number element control develop agent dimens tabl dimens import system make descript specif characterist ma methodolog appli efficaci effici relat characterist featur constitut determin factor social cooper behaviour ultim goal endow agent anticip plan capac behaviour criteria dimens criteria drawn ad criterion delib behaviour agent attribut criterion tabl present grid agent similar grid dimens framework shown reason space constraint criteria agent homogen heterogen agent princip type retain intellig agent soccer robot interfac person assist agent air traffic manag system mobil agent comput inform agent monitor web page autonom agent agent criterion characterist methodolog adapt learn improv autonomi proactiv cooper behaviour work agent achiev common inferenti capabl act abstract task commun abil commun agent languag resembl speech act simpler symbol level mobil migrat host platform person manifest attribut human reactiv select tempor continu ident state long period delib behaviour decid agent predict behaviour intern defin observ behaviour expect stanc dennett cover type base physic law environ agent expect behav design entiti understood specif intent stanc predict base environ order manag dynam organ endow agent modul recognit intent attribut recogn intent guid ensur relev direct interact organ dimens defin organ structur describ member organ relat interact achiev common goal structur organ relat environ resourc produc output natur output ma construct requir underli structur order control system complex dimens defin structur system characterist system intend dimens methodolog specifi structur characterist criteria retain valu adjust order account architectur properti ma ad type methodolog repres organ type varieti role relationship retain type main type hierarch distribut open holon system architectur result combin hierarch environ criterion characterist environ agent act characterist cognit agent explicit environ agent optim behaviour predict made behaviour agent reason ad explicit valu retain agent poss complet knowledg environ methodolog account design agent valu criterion explicit type activ passiv natur methodolog handl equal numer symbol data advantag compar cooper dimens cooper import aspect ma agent cooper achiev common goal author studi influenc social behaviour system perform shown cooper agent problem resolut process improv qualiti solut result highli desir find methodolog gener cooper principl applic consist fashion independ system principl establish maintain cooper agent principl make resolv state criteria dimens commun criterion retain commun mode criteria criteria cooper dimens type commun heterogen agent agent human commun direct indirect post offic synchron telephon asynchron mail criteria natur agent type agent agent attribut agent attribut legend valu criteria ma methodolog ma comm kad em homogen heterogen intellig agent interfac agent mobil agent inform agent agent adapt autonomi cooper behaviour inferenti capabl abil mobil person reactiv tempor continu delib behaviour physic stanc design stanc intent stanc tabl gener characterist agent agent section methodolog account methodolog account base unabl conclud base deduc methodolog account commun criterion languag agent base signal speech act mean cooper criterion cooper concept interact negoti manag accept agreement agent task deleg multiag plan execut control criterion coordin type interact hierarch distribut agent exchang intermedi result make transfer resourc coordin central question ma criterion interact static dynam activ interact engin distribut central criterion natur interact protocol explicit implicit note criterion establish interact mechan methodolog resolv state agent technolog dimens dimens describ characterist softwar methodolog appli characterist critic paramet choic suitabl method applic applic type aim applic type criterion ad criteria dimens ad environ develop criterion criteria process process mode softwar distribut interfac classic method account user adapt flexibl user vb program adapt interfac aim adapt assist interfac reason simultan user behav human criterion applic problem environ criterion describ develop characterist method appli program tool implement methodolog comparison appli framework ma develop gaia multiag system engin methodolog model techniqu system bdi agent methodolog intermedi model methodolog environ agent system develop method analysi design multiag system commonkad methodolog model agent orient design soccer robot team reason space detail compar analysi main observ techniqu methodolog evalu constitut extens extens methodolog object techniqu develop team experi technolog easili integr agent technolog methodolog methodolog constitut extens method commonkad methodolog develop soccer robot methodolog extend provid model account intern state model methodolog methodolog model complet cover problem found softwar support interest interpret commun actor ma develop formal mase make compon gener facilit check cooper dimens ma methodolog technolog dimens superfici account methodolog futur work framework design support compar analysi ma develop methodolog tool enabl identifi main weak strength main ma methodolog start point establish foundat eventu ma result unif methodolog consid avenu present greater detail separ paper unifi methodolog provid stronger support scalabl develop ma applic hope contribut develop ma methodolog exist ma environ platform origin work technolog softwar engin concept context ma develop interest framework grid grid present tabl guidelin develop ma methodolog defin version framework languag futur work interest opportun refin develop unifi ma methodolog spirit project gave birth develop tool inspir support develop ma applic acknowledg research kindli provid document inform relat work present paper natur scienc engin research council canada intern fund program refer adam compar de de en du de architectur de drogoul agent orient design soccer robot intern confer system japan moulin mario design method environ develop multiag australian workshop distribut artifici volum germani iglesia jc jr analysi design multiag system workshop agent architectur juli atal extend version paper publish intellig agent iv agent kinni georgeff rao methodolog model techniqu system bdi van der veld agent break seventh european workshop model autonom agent world germani dennett dc intent mit cambridg deloach sa multiag system engin methodolog languag design agent inform kendal mt jiang methodolog develop system zhang australian workshop lectur note artifici germani fox ms organiz view distribut ieee tran syst man univ vol interfac aux edit pari glaser contribut knowledg model framework phd université henri nanci de compar de de concept de à base de mai standard system acm issu intellig summer schreiber bj jm van de veld commonkad conceptu model proc european knowledg acquisit belgium scott ad multiag system engin methodolog languag design agent inform wooldridg nr jen pitfal agentori intern confer autonom agent wooldridg nj jen nj kinni gaia methodolog analysi journal autonom agent system
ML/447 6 machin colour constanc good brian lindsai martin school comput simon fraser british columbia canada abstract paper present neg current machin colour constanc algorithm good object recognit result algorithm successfulli correct colour balanc imag displai colour balanc typic applic colour rare put comput vision goal show method obviou machin colour vision object recognit colour constanc method test prove insuffici import find addit present result show correl colour constanc perform object recognit colour constanc recognit rate introduct set show machin colour constanc matur point aspect machin vision colour constanc algorithm requir fraction practic long result suffici accur beg repres task provid answer question simultan give measur accuraci past perform colour constanc algorithm report term averag angular error rm error predict target imag test colour constanc put object recognit object recognit strategi swain method base compar histogram distribut imag colour colour index fail ambient light illumin object recogn differ construct model imag swain ballard suggest colour constanc preprocess address solv introduc rel colour absolut colour colour histogram colour constanc method work natur task preprocess imag prior index swain ballard origin suggest fact colour index sensit variat ambient scene illumin expect method scene illumin directli affect imag rgb colour question address exist colour constanc algorithm effect gener colour descriptor colour index work typic rang scene illumin encount practic fluoresc offic light goal test colour develop improv colour index modif outlin paper colour index import colour constanc method colour correct good estim illumin descript colour constanc method neural setup descript test result discuss colour index colour constanc task machin colour constanc algorithm gener descriptor scene colour measur term camera rgb coordin camera output affect surfac reflect illumin red channel spectral sensit red channel equat green blue channel spectrum incid spectral reflect surfac assum rel spectral power distribut spatial invari intens colour constanc method develop exploit spatial variat illumin surfac colour chosen illumin colour descriptor machin colour constanc problem express deriv imag scene canon illumin rgb canon imag scene rgb unknown unknown illumin map account chang rel spectral power distribut unknown canon illumin rgb space defin output soni colour video camera strictli speak human observ paper refer rgb colour constanc method estim chromat colour canon illumin ignor intens compon wai normal rgb elimin effect intens colour index base standard chromat coordin colour correct algorithm discuss colour constanc algorithm convert chromat word chromat unknown illumin rg unknown provid estim chromat rg canon canon illumin colour index perform chromat histogram swain ballard major test rgb includ test space method simpl model histogram creat imag object system recogn object separ background built segment manual imag object chromat histogram determin unlik case model test object separ imag background test histogram intersect model histogram intersect defin model highest histogram intersect score identifi unknown object implement chromat histogram sampl larg imag sampl toler inaccuraci colour constanc colour constanc colour correct test colour constanc neural network algorithm estim colour incid illumin estim transform imag colour canon colour case estim transform directli test algorithm previou test shown perform colour constanc colour correct step case base diagon model illumin chang diagon model von kri adapt coeffici rule diagon model simpli state effect move scene illumin model scale channel independ scale factor scale factor written element diagon matrix previou work shown diagon model work full linear model typic scene illumin type sensor found video narrow band sensit diagon model work algorithm work chromat space case diagon transform model chang chromat move illumin diagon model chromat coordin defin equat show choic chromat coordin crucial diagon model illumin chang present origin coordin colour constanc algorithm test briefli turn version algorithm compar averag rgb imag ideal grei rgb grei rgb grei canon diagon scale factor colour correct simpli grei averag grei averag grei averag algorithm compar rgb white canon maximum found imag band separ variant version correspond case differ al maximum colour channel diagon scale factor colour correct simpli canon max canon max canon max studi shown method perform machin colour constanc method method deriv constraint ambient illumin evalu differ gamut colour found imag canon gamut experi construct canon gamut hundr reflect spectra wide varieti common object canon gamut convex hull set rgb valu arisen reflect illumin canon illumin understand rgb tripl imag scene unknown illumin presenc reveal canon gamut repres full set expect spot canon illumin correspond rgb insid canon gamut obtain illumin canon longer lie canon gamut set diagon transform map back canon gamut repres set unknown illumin intersect possibl figur solid line show convex hull diagon map transform chromat vertic canon gamut dash line show convex hull map canon gamut map describ unknown illumin restrict intersect convex set simpl reflect result chromat canon illumin canon gamut defin convex hull happen hull intens case elimin move chromat coordin defin equat imag rgb convert chromat coordin turn lie canon gamut map canon correspond repres canon map requir scale compon compon correspond canon gamut point case scale canon gamut point yield scale pair figur plot map fill diamond case correspond point insid convex hull canon gamut linear scale map interior gamut point result scale interior convex hull map figur convex hull set repres complet set map canon gamut point convex hull figur repres hypothesi unknown illumin point model chang creat move canon illumin unknown illumin convex hull figur express constraint find imag unknown illumin illumin repres point convex hull illumin possibl result colour canon gamut rgb yield constraint unknown illumin yield constraint chromat map hull vertic canon gamut shown open circl figur map scene point lit unknown unknown illumin repres map intersect convex hull candid illumin elimin convex hull set distinct imag call imag gamut vertex imag gamut yield constraint unknown illumin intersect constraint obtain vertic map constraint set establish heurist method pick remain candid estim unknown illumin hull centroid final estim method possibl illumin constraint result report base method ad illumin constraint measur lot light sourc reveal restrict gamut sampl illumin includ measur illumin includ indoor outdoor illumin light includ concret build light filter illumin unusu exclud result illumin gamut reformul term set diagon transform map illumin canon illumin form intersect constraint imag gamut constrain estim unknown illumin method carri chromat space rgb space method case constraint set polyhedr convex hull potenti case estim surfac bright addit surfac experi requir bright run method convert back chromat space note carri method convert result carri place method estim final estim made maxim volum intersect set method final estim origin chromat estim hull centroid case neural network colour constanc report result shown good perform neural network colour constanc network estim illumin chromat base gamut colour present imag neural network perceptron hidden layer input layer consist binari input repres chromat present scene hidden layer smaller neuron output layer neuron imag rgb scene transform standard space discret present input layer input binari indic presenc absenc chromat imag output layer neural network produc valu chromat illumin output valu real number rang train network algorithm thousand synthet imag gener randomli select illumin reflect surfac reflect integr spectral sensit function camera accord equat learn phase network provid imag data chromat illumin test imag imag experi colour object show pictur soni colour video camera balanc light gamma correct turn essenti linear function lumin rgb camera calibr apertur set pixel clip band apertur manner left imag dark overcom problem extend dynam rang imag roughli averag frame store result float point record imag produc versatil imag simul effect imag apertur effect clip bright spot imag illumin top section part light judg ii light booth illumin judg ii illumin cool white philip judg ii judg ii fluoresc full blue produc illumin similar colour temperatur deep blue sky effect creat chang illumin figur ball illumin illumin spectra plot figur set imag imag object move object group regist imag set object move imag set imag evalu colour index scene illumin object posit imag figur object imag singl illumin figur illumin spectra illumin filter cool white figur spectra test illumin measur adjust camera calibr model subtract variat background averag background determin averag larg number imag len cap adjust pixel darker amount tabl make small camera subtract intercept camera linear data imag result imag closer model rgb valu simpli integr equat incom spectra multipli sensor sensit function comput imag data clean averag block pixel exclud dark pixel recognit perform colour constanc error rm error rgb map canon clip clip rough fit figur object recognit perform function colour constanc error result experi confirm obviou hypothesi colour constanc improv colour index situat illumin test object construct model figur show clear correl colour index perform colour constanc error recognit perform measur figur base weight averag colour rank recognit colour index calcul match strength model strongest match fact correct rank match correct object rank obtain percentag total match rank distil result singl repres weight sum percentag weight rank weight rank weight rank match rank consid failur count measur colour constanc error base comparison correct imag set regist model comput root squar differ basi entir imag chromat target canon colour correct imag adequ canon illumin illumin creat blue cast imag red green intens low possibl reliabl result colour constanc algorithm obtain colour constanc averag produc data plot fill diamond figur note data set extend dynam rang imag order prevent clip visual check colleagu suggest exposur level normal view averag time higher simul imag captur level scale threshold greater match result plot fill triangl figur part motiv experi clip level unexpectedli good perform method compar neural net method compar result report al expect special natur imag clip failur reli pixel clip pixel accur specular highlight provid excel clue colour provid clip imag gener specular preserv maxima channel perform usual human user automat apertur control adjust captur process obtain invari clip pixel case start break maximum channel bad data point verifi degrad simul clip level result plot figur clear clip level algorithm degrad quickli clip level scale perform close report result perform algorithm case shown tabl rm map error clip level artifici clip level extend dynam rang imag white patch grei world gamut map neural net actual illumin diagon map figur rm map error versu artifici clip level rm map error rm differ chromat correct imag target imag curv explicitli depend clip rm differ fewer data point method degrad faster algorithm algorithm rm error actual neural net tabl colour constanc error error rm differ chromat map imag regist target imag result averag estim map imag illumin denot colour constanc simpli input imag output imag denot true unknown illumin rgb colour correct base diagon model rank perfect actual grei world gamut gamut neural net tabl number match rank percent total number attempt match match make case test illumin canon illumin exact origin question machin colour constanc good base feel answer tabl show index perform colour index algorithm preprocess perform find object result rank base actual illumin rgb colour correct colour index diagon model illumin chang support perform conclud distanc machin colour constanc task support object recognit term feel gave machin colour constanc reason result consid closer illumin spatial uniform chromat care remov tempor spatial averag troubl develop good camera model requir algorithm avoid bad match due colour background place object black cloth aspect experi open data real imag object random everydai object object includ object fluoresc compon box fluoresc compon chang matt compon present problem diagon model imag research assist understand intend elimin unintend bia choic object test illumin repres dramat rang term encount common natur light standard light situat ad unusu effect thing heavili filter theater light test machin colour constanc algorithm comput vision task object recognit base colour histogram intersect colour constanc algorithm perform expect base previou result colour balanc imag expect colour constanc process provid colour descriptor accur colour index perform close obtain chang ambient illumin shown tabl turn case colour constanc yield improv simpli improv figur show improv histogram match linearli relat rm error colour predict result al human colour constanc accur state result repres complet constanc complet absenc result experi question human colour constanc suffici accur object current state machin colour constanc perform challeng futur research clear rm error colour predict typic vision task object recognit base absolut descriptor rel colour refer bv learn color fourth color imag nov int comp color constant color ieee tran patt anal mach color recognit object illumin invari properti color opt soc nov colour constanc scene spectral vari fourth european confer comput vol page april method recov surfac spectral opt soc colour constanc vari proc intl conf comp jun algorithm color intl journal comput vision color gener diagon transform opt soc color pami oct vol number ba analysi theori color journal optic societi america oct quantit studi vision vol pp colour theori msc simon fraser school comput rg introduct theori neural publish learn intern error propag de rumelhart jl mcclelland parallel distribut explor microstructur cognit foundat mit color constanc natur imag asymmetr journal optic societi america sept
ML/448 6 model visual attent rapid scene analysi laurent koch ernst abstract visual attent inspir behavior neuron architectur earli primat visual present imag featur combin singl topograph salienc map dynam neural network select attend locat order salienc system break complex problem scene understand rapidli effici conspicu locat analyz detail index visual scene featur target visual search introduct primat remark abil interpret complex scene real limit speed neuron hardwar task intermedi higher visual process select subset sensori inform process reduc complex scene analysi select implement form spatial circumscrib region visual scan scene manner manner model attent includ inform small region visual field progress cortic visual hierarchi attend region select dynam modif cortic establish specif tempor pattern control model build koch ullman basi model relat integr explain human visual search strategi visual input set topograph featur map spatial locat compet salienc locat local stand surround persist featur map pure master topograph code local conspicu entir visual scene map believ locat posterior koch comput neural system california institut technolog ca john hopkin md return intens orient color linear filter differ normal input imag attend locat inhibit linear combin salienc map conspicu map combin normal featur map fig gener architectur model cortex visual map nuclei model salienc map endow intern dynam gener attent shift model repres complet account requir guidanc shift attent framework massiv parallel method fast select small number interest imag locat analyz complex object recognit process extend feedback higher cortic area knowledg target weight import featur high weight reach higher process level ii model input provid form static color digit resolut spatial scale creat dyadic gaussian pyramid progress filter subsampl input yield horizont vertic imag reduct factor rang octav featur comput set linear oper akin visual recept field typic visual neuron sensit small region visual space stimuli present weaker antagonist region concentr center inhibit neuron sensit local spatial detect locat local stand gener comput principl nucleu primari visual cortex implement model differ fine center pixel scale surround pixel scale ffi differ denot obtain interpol finer scale subtract scale ffi yield featur includ size ratio center surround region fix ratio extract earli visual featur green blue channel input intens imag obtain creat gaussian pyramid oe scale channel normal order decoupl hue intens hue variat perceiv low lumin normal appli locat larger maximum entir imag locat yield color channel jr yellow valu set gaussian pyramid creat color channel differ defin fine scale coarser scale yield featur map set featur map concern intens mammal detect neuron sensit dark center bright bright center dark surround type sensit simultan comput set map ffi set map similarli construct color cortex repres center recept neuron excit color inhibit true surround spatial chromat oppon exist color pair human primari visual cortex map creat model simultan account doubl oppon doubl oppon local orient inform obtain orient gabor pyramid oe repres scale ffi ffi ffi ffi prefer orient product cosin grate gaussian approxim recept field sensit profil neuron primari visual cortex orient featur local orient contrast center surround featur map color orient salienc map salienc map repres conspicu locat visual field scalar guid select attend base spatial distribut salienc combin featur map input salienc model dynam neural network difficulti combin featur map repres priori compar dynam rang extract mechan intens map orient map arbitrari unit arbitrari unit stimulu fig normal oper featur map salient object strongli map mask salient object present larger number map absenc map normal global promot map small number strong peak activ global suppress map numer compar peak consist normal valu map fix rang order elimin amplitud find locat map global maximum comput averag local global multipli map local maxima activ consid compar map ignor homogen area compar maximum activ entir map averag activ spot measur activ locat averag differ activ locat stand strongli promot map differ map uniqu suppress biolog motiv design replic cortic inhibit neighbor similar featur inhibit connect featur map combin intens color orient scale salienc map obtain consist reduct map scale intermediari map creat combin featur map combin singl orient conspicu ffi ffi ffi ffi motiv creation separ individu normal hypothesi similar featur compet strongli modal contribut independ salienc map conspicu map normal sum final input salienc maximum salienc map defin salient imag focu attent direct simpli select activ locat defin point model attend model sm layer neuron scale model neuron consist singl capacit integr charg deliv synapt voltag threshold threshold prototyp spike capacit charg sm feed neural network scale oe synapt interact unit ensur activ locat locat suppress neuron sm receiv excitatori input independ potenti sm neuron salient locat faster neuron pure integr sm neuron excit neuron neuron evolv independ reach threshold fire trigger simultan mechan shift locat winner global inhibit trigger complet inhibit local inhibit transient activ area size locat yield dynam shift salient locat subsequ prevent immedi return attend locat demonstr human visual order slightli bia model subsequ jump salient locat spatial close attend small excit transient activ surround rule koch ullman model attent simpl disk radiu fix sixth smaller input imag width height time fire threshold simul neuron chosen ref jump salient locat approxim ms attend area inhibit approxim ms observ differ rel magnitud delai prove suffici ensur scan prevent cycl limit number locat paramet fix implement system prove stabl time imag studi comparison spatial frequenc content model recent devic analyz local spatial frequenc distribut ey scan path gener human grayscal imag found spatial frequenc content fixat locat significantli higher random locat ey trajectori differ attent trajectori volit control visual attent thought strongli influenc ms ms ms ms output input imag sm fig oper model natur imag parallel featur extract yield conspicu map color contrast intens contrast orient contrast combin form input salienc map salient locat orang telephon strongli attend locat ms simul feedback inhibit locat salienc salient locat success select interest investig model reproduc find fig exampl color imag salienc map input spatial frequenc content map locat input salienc map higher maximum yellow imag patch higher maximum red salienc map robust construct simpl measur spatial frequenc content imag imag patch extract fast fourier transform appli patch threshold appli comput number fft threshold correspond fft amplitud perceiv grate measur averag number coeffici patch size scale patch chosen measur sensit approxim frequenc resolut rang measur comput rgb channel model map creat scale comparison salienc map iii result discuss concept salienc map wide model detail provid construct dynam examin feedforward featur extract map combin tempor properti salienc map contribut system perform gener perform model extens test artifici imag ensur proper function object shape vari contrast background attend order contrast model prove robust addit imag densiti detect densiti detect patch patch patch patch fig influenc detect illustr scene target salient uniqu color contrast se detect target found shown function densiti instanti system robust directli main featur target intens color similar properti impair target salienc system attend object salient featur variat properti directli conflict main featur target model reproduc human perform number task imag type shown fig target differ arrai surround distractor uniqu orient fig intens attend irrespect number distractor target differ distractor conjunct featur bar mix arrai search time find target linearli number distractor result wide observ human discuss section test model real rang natur outdoor scene artist normal featur map ref difficult object evalu object refer observ locat salient imag attend locat object build vehicl model predict compar measur local experi similar natur scene salient traffic sign red soda vehicl emerg triangl similar attend locat significantli higher averag factor attend locat attend locat result necessarili similar human ey fixat model attent attract imag common assumpt region richer spectral content inform map similar salienc map imag fig map differ substanti imag extend variat illumin color due area exhibit uniformli high low salienc uniform salienc map agreement subject percept salienc imag studi attend locat significantli lower maximum factor attend locat attend model attend locat high necessarili locat highest salienc measur local implement spatial competit captur subject salienc pure local measur strength limit model architectur compon mimic properti primat earli vision simpl architectur feedforward featur extract model capabl strong perform complex natur scene quickli detect salient traffic sign vari shape color textur design strong perform reinforc idea uniqu salienc receiv input earli visual effect guid attent primat comput major strength approach li massiv parallel earli featur extract attent system previou model base extens relax techniqu architectur easili oper dedic hardwar type perform expect model critic depend object featur explicit repres featur map lead rapid detect independ number distract object modifi featur extract model detect conjunct featur system immedi detect target differ surround distractor uniqu color orient implement primari visual fail detect target salient featur type junction line exist specif neural detector remain implement recurr mechan featur reproduc phenomena contour complet import type human present model includ motion plai strong role human salienc critic model compon normal provid gener mechan comput salienc situat result salienc measur implement relat local closer human salienc implement spatial competit salient locat implement faster simpler iter scheme spatial competit effect similar observ recept field cell striat cortex present conceptu simpl comput model focal visual attent biolog insight guid architectur prove effici reproduc perform primat visual system effici approach target detect critic depend featur type implement framework present easili tailor arbitrari task implement dedic featur map acknowledg werner ritter traffic sign pietro perona review excel suggest support nation scienc foundat offic naval research refer visual attent select artifici vol pp oct architectur attent pp ba ch anderson ch dc van neurobiolog model visual attent invari pattern recognit base dynam rout vol pp nov koch select visual underli neural human vol pp gil mechan dynam static scene optic vol aug baluja da select attent visual monitor control robot robot autonom vol pp dec theori cognit vol pp jan jp visual salienc monkei vol pp jan dl se visual trend vol pp apr jm search model visual bulletin vol pp pyramid filter rotat proc ieee comput vision pattern recognit pp jun ag neural basi visual function visual vol boca zhang tune human visual cortex measur function magnet reson vol pp jul inform process singl oxford press cannon model inhibitori interact effect perceiv vision vol pp apr posner visual attent perform dg pp implement model numer exampl attent predict natur synthet imag retriev effect gaze natur scene neural inform code mar close curv incomplet effect closur proc academi vol pp aug
DB/449 3 runtim system interact web servic clau ander ander sandholm michael bric depart comput scienc denmark march abstract interact web servic increasingli replac tradit static web page produc web servic requir tremend amount labori lowlevel code due primit natur cgi program present idea improv runtim system interact web servic built top cgi run virtual combin browser server runtim system implement extens tool produc interact web servic interact web web document runtim session model introduct interact web servic consist global share state number distinct session local privat state imper action web client invok individu thread session kind execut thread interact client inspect modifi global state provid runtim system interact web servic simpli plain cgi script design simpler cgi protocol inadequ implement session concept support long session involv user interact kind concurr control widespread standard run web stone develop complex modern web servic present paper runtim system built top cgi protocol featur support session concurr control motiv runtim system present basic research comput centr danish nation research foundat present advantag simpl cgi script base solut descript runtim dynam behavior round discuss relat direct futur work briefli describ implement suggest runtim system give short present tool produc interact web servic make extens runtim system packag motiv technolog plain cgi script lack properti expect modern program environ discuss shortcom tradit cgi program motiv solut design improv runtim system built top standard cgi protocol session concept describ motiv concept interact web servic http protocol origin design static document connect hyperlink cgi form dynam creation content document construct server time document request dynam document advantag static document content document natur extens model concept interact illustr figur client number repli comput show page start session form fill submit client server figur interact web session independ static dynam gener page guid session control session thread server session involv number user interact session initi client submit request server start thread control session thread gener repli page back client page typic input field fill client inform gener session termin session concept larg class servic defin number practic problem solv order implement model top cgi model cgi script sequenti session thread explain web servic session consist sequenti comput present inform client wait repli cgi mean execut cgi script page shown web client fact make tediou program larger web servic involv client interact sequenti comput split small bit comput happen client interact small bit constitut cgi script instanc cgi call achiev persist local store restor explicitli instanc web page client simpl servic full session approach approach inadequ gener problem forc termin cgi script client interact deal small script make write mainten web servic difficult servic clear program code start process time client interact perform top complet imag local state store restor time client interact requir local state potenti hold lot content substanti overhead execut web servic provid simpl solut split cgi script connector session thread connector tini transient cgi script redirect input session receiv redirect back web client session thread persist process run resid web server surviv cgi call implement long sequenti comput involv client interact transient connector persist session thread difficulti write maintain web servic improv substanti overhead web server execut servic cgi shortcom repli page session thread directli client session thread connector system write page web server send client browser basic approach annoi problem client identifi select bookmark impli resend queri server server expect repli recent interact natur client select bookmark session continu session current state requir server kind backup latest page client session concept previou make roll back execut session thread previou state thread continu current point execut result send page directli page shown client stack client browser mean stack visit page fill refer outdat page result button browser useless suggest simpl solut send repli session thread write repli file visibl client send client refer repli file url durat refer function identif session solv problem bookmark button press bring client back web page start natur effect method open easi solut problem server requir long time comput inform page shown client client impati lose interest servic assum server connect receiv amount time confirm form temporari page client happen wait extra featur implement runtim system readi instanc connector respond refer temporari page instanc termin page automat load client web browser reload session thread finish comput real page thread replac temporari page real page effect time page real page shown client reload standard html function reload extra network method close server push world cgi program handl safeti requir consist problem tradit cgi program concurr synchron session lock share handl fashion semaphor suppli oper system web servic implement aspect incorrectli result unstabl execut damag behavior solut put safeti mutual complex separ central process call control approach significantli simplifi job handl safeti requir requir formul solut robust part code gener consid ineffici unsaf central compon distribut system case bottleneck server network safeti control spite distribut function safeti control discuss section compon runtim system time number web client access server cgi protocol server side control number session thread run session thread access global data produc page web client time time connector start result request web client connector make contact run session thread connector shut deleg answer session thread back web client give detail descript compon overview compon runtim figur web client web client user provid web servic make servic essenti fill form submit request browser server server handl incom request retriev web page start cgi case connector direct page back web client session thread session thread resid process run web server surviv cgi call repres actual servic code implement provid web servic search produc web session thread repli control internet client server connector figur runtim system connector web client make request connector start request control start session thread request made web client web client continu execut run session connector notifi relev session thread request made forward input thread repli page session thread design file current web page visibl client session write content buffer updat atom client read file time control control central compon session thread possibl suspend execut point ensur state safeti requir satisfi runtim system servic care abandon session thread administr issu dynam runtim system section describ dynam behavior runtim system start explain structur execut session thread start present thread transit session thread start transit involv interact web show web page dealt transit involv interact control present transit give descript compon involv interact execut thread lifetim session thread depict diagram figur thread start show vv activ ww end wait figur state transit session thread enter state activ sort comput eventu reach point html page page shown web client thread enter state show wait web client respond request thread state activ resum execut note world naiv cgi program move activ show back store complet imag local state termin script start process start local state reconstruct imag save substanti overhead save restor local state avoid complet transient connector resid thread state activ thread point execut safeti critic access share carri reach point thread control permiss continu enter state wait permiss grant control thread activ state continu execut tradit approach merg code implement intric detail deal concurr control servic code intermix addit substanti reduc readabl code risk introduc error solut separ code deal concurr control servic code session thread leav state activ end execut start session thread section describ transit start activ web client make server start connector cgi script request made web thread start session request page back client thread reach show call amount instanc pass session thread initi move show content repli file immedi overwritten web page messag html command command make browser reload page temporari repli file overwritten real repli section default content page overridden servic programm simpli overwrit repli file messag specif situat interact client execut run thread servic show page web client continu execut receiv client describ action show page section describ transit activ show execut session thread inspect input produc document construct execut reach point page shown action document shown written repli file figur file client browser fetch page url durat session lose possibl browser restrict build top exist standard cgi script start web termin due session thread repli page readi thread sleep connector wait receiv signal session connector write url repli page cgi di server transmit url back web client browser fetch repli page server show client figur action describ flow data start session thread end client receiv client section describ transit show activ session thread sleep show web client read fill form resubmit result flow data client session thread figur request made client cgi protocol request initi click link press submit button server start cgi connector connector client run thread wake sleep session thread suppli argument interact control control programm restrict execut web servic state safeti requir satisfi thread checkpoint place safeti critic code execut checkpoint thread control permiss continu construct restrict execut safeti requir thread violat requir continu describ detail control session thread permiss grant control control control consist control number timeout queue figur overview control control logic control logic actual compon repres safeti requir control event session thread continu execut checkpoint imagin finit state machin intern control logic requir interfac function runtim queue checkpoint event queue control logic timeout figur compon control id argument repli event enabl id enabl argument updat intern state control logic inform event occur explain function control queue queue form interfac run thread servic queue checkpoint event thread reach checkpoint control permiss continu ad queue event wait checkpoint timeout queue extra featur timeout control permiss continu control timeout queue permiss grant time control wake thread inform permiss grant timeout event occur timeout put special timeout queue implement prioriti permiss checkpoint section describ transit activ wait mention possibl ad checkpoint session code critic code execut runtim system interfac make function servic programm checkpoint programm illustr figur effect thread instanc session reach point wait case case timeout figur checkpoint control wait timeout request thread sleep wait control action control loop receiv request pass checkpoint control push id client queue entri chain permiss remov figur illustr effect figur entri belong timeout queue timeout control delet affect entri queue inform involv thread enabl event function control logic queue enabl event control make event occur remov link entri enabl event respect control logic event occur wake involv thread signal event event schedul polici ensur fair thread wait enabl point grant permiss continu permiss grant section describ transit wait activ request permiss continu thread wait control make signal wake branch event signal control checkpoint figur control grant permiss execut continu code case control send execut continu timeout extend runtim system runtim system previou section extend wai extens implement version runtim system packag futur begin reach limit standard cgi protocol current function standard browser distribut safeti control control central compon case divid control logic independ part control disjoint set checkpoint event control divid number distribut control process problem control bottleneck system successfulli avoid servic monitor idea connector construct servic monitor program run access log statist inform gener connector inspect chang global state state control logic control implement dedic monitor process servic secur commun system present vulner hostil attack easi url repli file identifi session simpl solut random kei make practic imposs guess session id inform client browser session id data written eavesdrop avoid experi make commun complet secur practic requir browser standard protocol experi prevent provid secur verifi user transpar client document cluster session concept illustr figur page gener shown client time servic gener link document client client document involv session thread current solut program possibl cluster servic tediou complic task document cluster implement simpli repli file document cluster present repli file fix durat session histori buffer browser reason function function repli file retriev directli http server connector process connector receiv id session thread cgi queri string document number hidden variabl singl process model server process session safeti run possibl distribut process combin singl process thread memori oper system transpar share code remov overhead process commun result system close dedic web server import differ build cgi protocol relat work idea persist process run resid server central system differ requir approach work server support cgi runtim system tailor support specif detail formal descript make safeti requir written separ suitabl logic found languag write safeti requir compil process safeti control optim memori usag flow capac control develop recent paper gener idea result standard scheme gener control discret event system control uncontrol event languag suggest languag describ sequenti web applic notat compil cgi script directli program construct global dynam local imper client interact system show great facilit effici product reliabl web servic offer automat synthesi advanc reli standard semaphor program concurr control solut compil servic dedic server servic faster simpl cgi script solut easili port machin architectur futur work implement briefli appendix constitut core tool develop bric runtim system shown provid simpl effici solut problem occur due interact web servic session concept constitut framework natur design complex servic base design runtim system wide system easi incorpor develop runtim system homepag implement unix version runtim system implement packag compon figur connector connect compon client server safeti handl concurr control reason section includ packag suppli separ runtim link servic code function easi interact compon version runtim packag implement extens section sourc detail program languag develop interact web servic complet specif compil technolog java run top runtim system present paper intellectu descend project complet design implement vastli expand ambit languag collect tini languag aspect interact web servic minim syntact contribut languag held skeleton languag feel special servic execut dynam vari number thread provid mean control concurr thread synchron central control enforc global behavior conform regular languag accept automaton control logic consist automata control automaton comput collect individu concurr constraint phrase logic extens counter negat alphabet symbol add express regular languag html document valu comput store variabl document gap placehold html fragment attribut tag gap runtim plug concret valu valu highli dynam mechan build document document repres compress plug oper constant time type checker ensur document consist manner standard servic execut secur higher level secur commun digit sign encrypt bit rsa requir protocol implement combin nativ familiar struct arrai replac tupl relat simpl construct small relat effici implement suffici bigger mb relat declar automat handl connect extern server extern relat access subset syntax intern translat sql import mechan glu compon fulli gener macro mechan programm extend languag ad arbitrari product grammar nontermin potenti argument result type macro unlik implement full error messag remain thread back macro definit languag special construct build chat shop macro wrap concurr constraint primit layer syntax version undergo intern evalu bric contact inform document rough high prioriti month project schedul deliv version tool june freeli open sourc distribut unix refer david thoma michael kenneth peter kenneth experi domain specif languag servic usenix confer domain specif santa octob clau safeti control interact web servic master depart comput decemb ram tale wai program web servic technic report bell michael al project homepag cgi program world wide web oreilli version user manual bric note seri depart comput octob ram program languag hypermedia servic intl world wide web open web server interfac technic white april ander project homepag ander sandholm control synthesi januari ander sandholm michael distribut safeti control web servic fundament approach softwar lectur note comput lnc page bric technic report biographi clau receiv msc comput scienc januari research assist emploi bric aarhu project august start phd student bric area interest research domain specif languag compil tool rapid macro program internet servic ander phd student bric consult lab research june august visit algorithm specif group lab research main research interest includ program verif work bric project project ander sandholm receiv msc comput scienc expect hand phd thesi summer june august member technic staff comput scienc research depart bell lucent june august member technic staff algorithm specif group lab septemb decemb visitor softwar product research depart bell lucent technolog work area formal program languag current research interest domain specif languag emphasi languag static program applic control robot web program michael receiv phd cornel associ professor aarhu kernel research bric research center michael studi design implement program type static applic logic
AI/450 2 rigid articul motion uncalibr stereo rig andrea horaud inria avenu de franc abstract paper establish link uncalibr stereo vision motion rigid articul bodi variat project reconstruct dynam scene time uncalibr stereo rig faith motion captur devic introduc origin theoret framework project kinemat rigid articul motion repres transform group project space project veloc defin tangent space project motion inherit structur displac group theoret result lead immedi formul visual motion captur motion synthesi longer requir metric geometri stereo camera articul bodi report formul visual servo system present simul result introduct paper address problem repres control motion robot manipul articul mechan devic imag measur continu feedback uncalibr stereo camera pair stereo rig camera pair recov project structur observ object match imag result simultan shown faugera hartlei relationship project structur recov investig number zisserman reveal submit iccv author grate european commiss support fellowship esprit project upgrad project structur metric stereo rig undergo gener displac affin rig undergo planar motion faugera reveal import algebra properti similar rigid project motion horaud solut comput intern paramet gener motion singl planar motion parallel author investig relationship stereo rig visual control robot manipul cipolla consid affin approxim perspect camera model hager al investig align project invari sensibl visual control presenc calibr base current solut visual servo uncalibr camera calibr stereo rig classic euclidean robot establish visual control law work paper intern camera euclidean robot requir anymor motion robot combin elementari rotat translat introduc special project project rotat project translat transform special weakli calibr stereo rig observ rotat translat reveal structur transform analyz action group project space explicitli project tangent oper establish project forward kinemat model robot manipul note model appli articul motion gener project veloc articul motion explicitli deriv relationship joint veloc veloc observ imag introduc concept visual euclidean camera requir notat bold type bold ital roman angl vector column row vector written denot equal scale give proof matrix ident project reconstruct calibr stereo rig model camera paramet rigidli link point euclidean space project point left project imag plane solv project constraint yield euclidean reconstruct euclidean camera frame jk weakli calibr stereo rig model pair camera epipolar geometri project matric project solv rel project camera frame frame defin thought rigid point attach stereo rig stereo rig remain constant link upgrad project reconstruct euclidean encapsul complet geometri stereo recov amount metric calibr stereo camera observ reconstruct dynam scene rigid articul motion assum fix unknown stereo geometri metric rigid motion time instant gener point rigid bodi coordin respect euclidean camera frame trajectori rigid motion differenti trajectori displac group spatial defin tangent rel frame structur spatial defin tangent oper rt yield motion tangent simpl instantan written matrix gener form vx vy geometr interpret instantan linear veloc frame rigidli move bodi instant distinguish common usag kinemat repres veloc rigid bodi frame spatial refer frame rigid project motion longer assum calibr stereo camera euclidean frame uncalibr rig reconstruct rel project camera frame point project coordin defin notion project kinemat project displac project coordin rigidli move point relat matrix project group calcul point correspond algebra similar displac scalar fl fl pe trace determin determin fl normal unit scale fl rt refer normal form fl project displac straight forward form subgroup modulo fix matrix embodi stereo geometri equat differenti inherit structur simpli matrix denot project analog equat notion project defin rt spatial veloc respect project frame matrix denot gener form pe vx vy orbit project point scale factor ae identifi homogen coordin project relat unknown vector plane infin ae ae ae vector ae ae implicit call height height height invari ae pe ae pe pe ae ae orbit action li hyperplan ae ae ae orbit height project point rigid orbit ae project ae relat metric veloc fix unknown height ae ae appli bodi veloc ae yield ae ae pe ae pe pe ae articul project motion project motion revolut joint project motion articul chain project joint motion project revolut joint project revolut joint repres mean project formul pure rotat twist gener pure rotat revolut axi gener posit space longer repres constrain axi origin linear tr posit joint mean displac origin defin project rotat hr pe tr gener pure rotat tr similar relat jordan decomposit hr pe sin sin jr achiev write rotat similar jordan matrix jr impli rotat angl determin hr famili decomposit span commut group cr jordan matrix jr cr ambigu encapsul project geometri joint denot row column jordan matrix jr se gener trivial element jr jr jr jr substitut differenti homomorph form famili modulo axi posit fix stereo embodi formal appli matrix ident jr yield exponenti form gener hr hr hr hr gener hr write hr ambigu hr cr commut jr joint posit rel frame free axi prove rodriguez form hr hr notic ffi ij substitut expand collect row column obtain qed joint angl rodriguez form analyt calcul project motion revolut joint project geometri uniqu repres gener hr singl hr calcul trial motion revolut joint logarithm hr sin recov gener cf sin project joint project motion joint deriv line section summar found greater detail start pure translat jordan decomposit form pe form modulo translat direct affin stereo embodi gener product coordin vector vanish plane exponenti form logarithm unit length trial motion project motion articul chain project articul motion express mean project gener twist model articul chain kinemat prove project model kinemat articul chain project kinemat articul chain element serial link revolut joint stereo rig rigidli fix respect end chain end call base opposit end call tip joint index element link joint joint index convent uniformli cover robot stereo rig independ rigidli instal rig rigidli mount robot base chain focu robot manipul move front stereo rig vector joint variabl stand depend joint revolut describ configur chain rel arbitrari configur chosen origin assign gener point element coordin configur repres articul project motion project motion singl articul directli express respect project joint joint specif posit space move joint result ri gener ri depend type joint gener encapsul project geometri joint ri articul chain project joint element written argument simpl induct point st element affect motion st hypothesi element move point element move joint actuat joint lock point element move rigidli element appli hypothesi elementari joint motion order qed express wrt frame conjug form substitut pair pe cancel fact element articul motion pe euclidean twist repres joint wrt essenti model chain directli exploit correspond euclidean project motion ih ih ih figur model articul chain project veloc articul chain instantan motion articul bodi differenti trajectori joint space project bodi veloc element time instant chain instantan configur veloc obtain motion tangent tempor deriv dh dq project element definit express insert repres project motion joint posit configur bodi veloc written linear superposit project motion weight point rigidli move element project equat direct differenti rewrit linear superposit respect veloc compon visual servo introduc formul visual servo base project articul motion paradigm consist servo target posit mean align veloc screw differ current target imag featur fix mount robot move visual control stereo rig trajectori initi posit target posit singl servo step point featur figur initi target imag gripper featur trajectori iter control loop call formul gener geometri entir system model wrt project camera frame metric frame anymor knowledg geometri system requir camera geometri gripper featur robot geometri term acquir actual control law longer servo robot cartesian servo manipul seek deriv jacobian relat joint import understand jacobian analyt express ensur sound robot entir configur space contrast exist estim linear model approxim target joint project motion develop current configur current posit space calcul point gripper joint compon develop current posit point superposit express jacobian matrix jh jh camera jacobian jc spatial veloc imag veloc develop point current imag pm project plane step trivial jacobian map pixel plane describ actual perspect jacobian jc jc jc jacobian function jc jh jc jh project geometri system encapsul report simul visual servo system metric geometri simul setup roughli stereo system vergenc captur time motion robot distanc arm link carri gripper size input system joint angl measur imag project gripper featur account real imag independ gaussian oe joint angl accur figur robot trial motion acquisit phase acquir estim point featur gripper gener calcul algebra refin numer method obtain stabl accur result presenc method emploi prove perform real imag data servo point visibl face gripper stack error vector current imag goal imag constitut stack invert jacobian relat proport control law exponenti iter angl trajectori figur trajectori show result servo task translat gripper rotat goal attain iter monoton trajectori cover distanc attain target imag imag imag approxim linear trajectori cover distanc imag error show exponenti decai compon converg attain residu error level summari shown uncalibr stereo rig rigid articul introduc origin formal project kinemat proven power classic kinemat metric space project formul point revolut joint introduc project model geometri articul chain present iter exponenti decai figur exponenti converg lead immedi origin approach visual formul knowledg metric geometri hope theoret work give foundat motiv integr uncalibr visual sensor cycl judg present simul publish practic experi futur work concentr develop practic numer mean valid contribut system practic refer murrai activ visual navig structur proc page ieee comput societi june horaud solut euclidean calibr stereo rig proc volum page faugera project euclidean reconstruct proc ieee conf page san june approach visual servo robot ieee transact robot june faugera dimens uncalibr stereo rig comput vision proc page springer faugera comput geometr viewpoint mit hager modular system robust posit feedback stereo vision ieee transact robot august hartlei euclidean reconstruct uncalibr view applic invari comput page springer berlin hartlei defenc algorithm proc page june ieee comput societi press cipolla uncalibr stereo coordin imag vision march horaud euclidean reconstruct motion stereo rig proc page ieee comput societi januari nelson model manipul robot hand proc volum page april canon geometri multipl project view comput vision imag septemb sastri mathemat introduct robot manipul crc horaud project translat affin stereo calibr proc ieee conf page ieee comput societi june horaud project rotat appli head proc ieee conf june geometr method robot reid metric calibr stereo rig proc ieee workshop visual page june
Agents/451 1 informat school economi commerci law göteborg abstract master thesi intellig agent technolog futur distribut sensor lisa andersson spring master thesi deal intellig agent possibl intellig agent technolog futur distribut sensor system term futur distribut sensor system refer system base sensor develop period ten year research definit intellig examin constitut intellig agent made definit suit applic domain definit base investig intellig agent futur distribut sensor system argu interest gener agent definit applic make foundat definit decid specif featur depend task agent perform domain agent work final conclud agent technolog sensor system present agent type applic futur distribut sensor system institut ericsson microwav system ab den den agent att system som sensor som att till int kan om en intellig agent vi som en intellig agent en definit som att vi har definit till att agent kan vi dock att det int att en definit som att agent det mer att en definit om agenten ha agenten agenten vi att det att person involv master thesi instructor ericsson microwav system great support guidanc vision idea master thesi initi instructor guidanc time spent thesi transform report beauti steen make attend confer held london social skill make feel ericsson final interview time answer question encourag period content target disposit method versu qualit quantit sourc research informat method part intellig part agent sensor literatur studi confer interview intellig agent histori agent nwana foner agent petri agent jen wooldridg mae agent agent agent autonomi commun mobil system agent definit agent sensor agent agent practic work air traffic traffic applic simul person servic sensor radar system work radar futur baltic watch agent sensor system sensor agent object agent simul person assist agent gener discuss futur research appendix baltic appendix interview appendix confer introduct softwar applic softwar industri constantli seek wai creat easi softwar softwar support user grow answer intellig softwar entiti intern goal act behalf user peopl hear word agent secret agent jame perform mission world unknown territori social skill idea found intellig agent defin aim thesi examin technolog intellig agent futur distribut sensor radar system work ericsson microwav system ab background intellig agent popular buzzword softwar applic busi appli technolog focu intens interest case research agent technolog solut problem complex applic intellig simplest softwar program offer assist user gener explan practic research make definit intellig agent todai gener consensu defin intellig agent formal research intellig agent explod breakthrough exist research internet focu area research includ includ intellig agent exampl area telecommun network air traffic busi process data inform electron commerc power manag softwar busi begin discov benefit intellig agent technolog ericsson microwav system ab except ericsson microwav system ab divid part part develop mobil net defenc product radar master thesi depart produc radar system knowledg intens interest technolog examin intellig agent futur distribut system run year time import investig time perspect advantag competitor explor agent technolog appli futur sensor system futur sensor system found project call baltic watch object secur surveil baltic sea project aim produc futur system order discov unusu activ oil spill cargo ship baltic sea find agent technolog invest initi thesi master thesi examin relev intellig agent futur distribut sensor system todai exist common definit intellig agent research develop field creat definit constitut intellig agent investig intellig agent futur distribut sensor understand intellig agent import examin research opinion intellig defin theori theori base research question intellig research area intellig agent young undefin expect intellig agent futur appli number set interest investig wai intellig agent practic case futur distribut sensor advantag disadvantag basi discuss formul intellig agent technolog futur distribut sensor experi drawn answer examin intellig agent futur distribut sensor system baltic watch project futur distribut sensor system includ intellig agent answer question background studi area research intellig agent practic applic restrict master thesi deal intellig agent futur distribut sensor system deal area includ intellig entertain net commerc intend investig technolog build intellig concentr intellig agent specif futur distribut sensor system practic agent system internet market todai system agent evalu system target group thesi written familiar comput softwar busi interest complex softwar product distribut sensor system foremost target group ericsson involv develop distribut sensor system research area intellig agent written experi comput design softwar applic thesi easier understand reader familiar paradigm disposit structur master thesi chapter describ view work base research method gather inform problem area chapter intellig present research definit intellig agent closer agent characterist account result gather combin literatur inform creat agent definit chapter agent give exampl practic agent applic describ sensor system discuss possibl intellig agent futur distribut sensor system combin literatur studi inform gather defin agent theori background chapter gener present thought agent sensor system draw give research appendix deeper explan baltic watch project appendix list interview question interview appendix inform confer method method plan follow perform task research common follow research research structur work redo investig methodolog view appli research method depend problem hand standpoint method research scientif work plan fashion document reader understand start point step work method process research approach experi research suitabl method depend natur problem theoret condit hand versu todai major scientif school school theori emerg natur scienc theori base social scienc reaction school theori realiti observ object theori realiti subject core idea theori exist true research gain knowledg observ theori assum research abil studi problem clear distinct object object result theori strive control uncertainti factor collect object reliabl research result predict control realiti deduct reach goal exist theori assumpt research idea interpret environ understand phenomenon interpret understand central matter human individu focu interest interpret knowledg understand specif situat human individu creat individu perceiv extern realiti differ understand realiti research part thought understand person perceiv surround theori subject research acknowledg research extent effect result theori import understand time mean part studi definit extrem brought closer find research part theori compar found thought school suitabl research object thesi examin agent technolog specif environ distribut sensor system make difficult compar sensor system includ agent agent technolog time develop system method understand intellig agent intellig agent futur distribut sensor system approach typic strive understand knowledg phenomenon find absolut truth inform absolut object previou knowledg effect make investig qualit quantit methodolog qualit quantit method wai approach gather inform qualit method investig profound level broader perspect investig driver behav strang concentr statist perform quantit research perform qualit research interest investig driver behav strang import differ method number statist collect kind data interest quantit method statist number collect describ common situat compar phenomenon express statist relat characterist quantit method suitabl compar research investig differ men grade research countabl quantit qualit method concentr text data interview analysi document techniqu collect data qualit method suitabl research uncertain characterist measur problem imposs quantifi chosen qualit method area imposs quantifi order achiev object interest quantifi mean examin statist approach problem creat agent definit difficulti qualit method make research object awar fact make clear distinct conclud discuss posit neg aspect agent technolog subject perform research critic sourc sourc critic perform research research critic data collect sourc data determin credibl sourc find intern independ document subject compar appli document interview kind sourc extent determin credibl sourc object disput estim sourc depend subject research investig critic secondari sourc primari sourc primari sourc written hand writer part situat observ situat secondari sourc base heard conclud critic primari sourc credibl depend situat hand role situat independ observ trustworthi activ particip research informat informat interdisciplinari scienc rich varieti approach method perform research informat approach interest perform research inform technolog mind informat natur scienc explicit interest natur social scienc dare close technolog put afraid hand dirti script integr element complex combin inform technolog pp align posit work triangl creat enabl posit research inform system corner repres goal predict understand chang mean research examin phenomenon order chang situat research achiev learn hand inform system develop understand mean research interest understand phenomenon examin insight inform system case studi predict mean research predict show predict true research disciplin figur appli corner triangl hybrid research combin disciplin figur triangl research disciplin triangl figur place goal research predict understand understand intellig agent predict agent technolog futur distribut sensor system mean situat extrem hybrid research disciplin method predict research disciplin chang hybrid research disciplin found research qualit school divid master thesi major section part investig intellig agent part intellig agent futur distribut sensor system part form theoret base part research hybrid disciplin understand predict shown triangl illustr reach goal work triangul approach triangul mean approach appli combin sourc method approach school depend posit understand field research combin exampl research combin method school recommend categori methodolog triangul combin method data collect combin literatur studi inform gather confer interview literatur studi import form understand intellig agent interview understand sensor system opportun research opinion intellig agent attend confer absolut latest idea intellig agent area evolv time felt object interview figur triangul combin sourc inform achiev understand problem reach reliabl difficulti triangul approach gener vast quantiti make difficult studi overli question encount inform articl definit intellig agent triangul approach research question approach part intellig agent part agent sensor part intellig agent literatur studi overview constitut area intellig agent began research literatur studi intellig agent gain knowledg continu deeper literatur studi answer intellig find interest literatur mail list electron discuss member associ comput machineri educ scientif societi inform inform inform confer complement literatur studi decid interview research work intellig hand inform practic knowledg main interview complement literatur studi fill articl present latest area angel neg aspect articl thought visit confer give basic knowledg area intellig agent deeper knowledg import discuss subject profound level goal part investig answer question order build theori base research question theori definit intellig agent part agent sensor part intellig theoret base continu literatur studi exist practic agent sensor system draw intellig agent futur distribut sensor system initi stage consid build prototyp appli theori practic applic due time constraint limit build prototyp simul sensor realist technic detail realist result applic real sensor system point prototyp limit focu aspect intellig agent sensor decid result interview research field intellig agent sensor system confirm declin thought decid interview develop work construct sensor system order understand sensor system investig agent sensor system exist problem difficulti sensor system agent technolog start interview present theori intellig agent understand intellig agent relat agent technolog sensor system find research develop practic applic happen futur intellig attend confer practic intellig agent applic interview research work agent practic applic valid idea agent sensor system implement futur literatur studi start work literatur studi intellig agent huge amount inform internet made difficult select articl stop search inform difficult good materi bee research bee encount opposit problem sensor sensor system literatur sensor system secret document reli open inform inform talk sensor system develop gather inform literatur studi associ comput machineri mail list internet internet popular sourc inform question credibl inform judg reliabl import origin inform problem inform internet vari qualiti fact problem determin publish materi problem make import critic judg inform found internet problem link remov alter make imposs find text problem articl publish internet research scientif journal chose articl acknowledg research facil articl author respect intellig agent commun internet medium easi quick access journal articl occas inform inform real agent run internet associ comput machineri associ comput machineri maintain largest publish articl inform technolog access limit member recommend member found acm easi provid major articl intellig agent mail list mail list forum exchang inform specif subject internet particip commun send electron mail server deliv messag particip list member softwar inform agent mail list mail list find intellig agent topic mail list gain inform subject clarifi thing understand exist literatur start mail high expect forum discov research list exchang inform provid pointer find recent articl possibl specif question expert field disadvantag mail list handl unrel receiv confer agent commun grow rapidli articl year date attend confer intellig agent latest idea area lot agent confer chose attend confer applic intellig agent system confer object present agent technolog overcom busi develop expect tangibl benefit invest agent opportun agent provid confer suit goal perfectli subject line interest confer situat london held time confer attend track cover lectur inform confer lectur appendix give fulfil expect interest research area idea difficult understand speaker due languag problem interview interview scientif research divid structur unstructur structur interview perform predefin question unstructur interview guidelin track question interview interview freeli follow interest topic interview problem unstructur interview harder data inform inform chose unstructur interview person experi research intellig agent creat applic base agent technolog inform sensor work sensor system knowledg sensor system thought unstructur interview suitabl structur interview question creat opportun question interview decid chose method call idea research peopl interview reason basi chosen repres popul interview intellig agent chose research interview intellig agent research practic experi construct intellig agent research contact intellig agent longer period research contact booth research commun industri world person interview locat proxim develop applic base intellig make creat collect network preserv knowledg close contact industri call interview person research interview develop inform agent agent connect internet call research area intellig agent intern thought good idea visit confer contact intern research talk arrang meet prior confer appoint research creat framework develop agent construct simpler agent framework research ill particip confer meet interview australian develop agent system thirteen year busi compani tutori dai answer question interview spoke answer question interview famou research particip confer luck poster session tuesdai found interest poster sensor militari domain inform writer poster send materi system call question influenc experi intellig agent interest field specif question research inform work interest experi develop intellig agent intellig agent gener inform inform interview appendix interview sensor system decid person interview sensor sensor system person develop sensor sensor system practic knowledg sensor person work sensor system longer period person knowledg thought futur sensor system interview person expert sensor provid basic knowledg call person develop sensor call interview inform sensor system inform publish written materi due secur classif reason thought crucial work conceptu understand technolog sensor work sensor system understand kind problem exist limit system todai reason interview suggest intellig agent sensor system accomplish peopl contact gave basic sensor system work inform gener detail sensor sensor system public chapter sensor system detail inform interview appendix intellig agent field intellig agent young research area give clear definit constitut intellig agent consensu definit agent present definit research field present result literatur interview confer section chosen present result make separ categori avoid repeat inform describ import characterist agent make definit intellig agent histori intellig agent origin artifici intellig distribut program area join distribut artifici intellig field idea intellig agent emerg idea intellig entiti call agent happen late seventi area earli stage time breakthrough internet similar agent technolog strike strang emerg field distribut program artifici intellig solv problem complex bit give agent goal exist talk intellig agent research refer human intellig artifici intellig suitabl artefact comput intellig agent softwar program kind exist user autonom awar goal exist interest articl sport softwar agent continu search internet time log comput agent present materi found idea user save lot time deleg task provid inform sought conveni agent inform agent common agent exist todai kind agent main research field intellig agent focu internet domain internet focu applic agent area reach market describ agent technolog natur step softwar paradigm agent technolog build previou technolog tabl unit unit unit monolith program structur program orient program extern local local local extern extern local local extern extern extern tabl softwar local van dyke parunak orient program local tabl describ develop monolith smallest unit complet program smallest unit object local behaviour execut step develop agent program encapsul object agent technolog encapsul data locat thread control goal bradshaw strike definit agent show view agent program thought objectori program constraint kind messag method agent essenti object pp notion agent program approach realiti todai discuss technolog agent surviv research agent technolog big program paradigm problem technolog exist todai solv cautiou approach defin outcom agent commun vision interest agent natur part softwar produc scenario agent impli interest stagnat agent program paradigm scenario agent technolog nich small group research research point import surviv agent easier develop applic base agent technolog achiev creation product standard van dyke introduct speech panel introduct speech panel agent definit area intellig agent research common definit intellig agent agent capabl agent specif goal gener proven difficult find commonli accept definit specif offer gener definit agent cover comput softwar consensu essenti natur pp explan lack built construct definit agent base agent accomplish disagr agent chosen present opinion intellig agent research experienc field intellig agent definit illustr common differ defin intellig agent nwana agent nwana acknowledg fact difficult defin agent defin agent compon softwar capabl act order accomplish task behalf user word agent difficult lot busi word travel agent describ term agent umbrella term cover rang specif agent type describ specif agent classifi agent attribut exhibit british telecommun laboratori nwana identifi minimum requir learn agent attribut intellig agent figur agent autonom oper human guidanc individu goal state act meet goal user abil initi import featur complex task execut nwana agent element agent intellig smart abil learn learn process develop interact reaction extern environ mention import agent goal creat smart agent inform figur agent topolog nwana minimum attribut type agent collabor collabor learn interfac agent smart agent figur intersect area figur consid agent prefer agent attribut smart vision perceiv realiti nwana mention dimens classifi agent typolog mention consid agent mobil static mobil agent abil move network execut server va creat static agent abil dimens classifi agent role case sport gather inform inform agent agent featur mobil static nwana show wai classifi call softwar compon agent occur intersect area topolog figur classifi agent abil attribut learn comment nwana characterist import intellig agent definit autonomi good nwana mention intellig term intellig agent closest concept smart agent avoid word intellig defin caught discuss intellig charg word solv problem ignor foner agent foner agent characterist fulfil agent call intellig agent characterist mention risk grace anthropomorph expect autonomi mean agent independ initi act spontan action lead benefit user agent agent exist make task easier user agent abil learn task user perform agent execut task perform user featur call import user agent perform task set achiev agent goal establish intent abil user agent deleg task demand user trust agent carri task properli risk deleg task perform costli user impli user balanc trust agent risk agent wrong user emploi agent respect agent work specif domain natur domain decid behaviour creat gener applic domain close relat concept risk trust agent act comput consequ sever agent user instal agent nuclear reactor grace degrad impli commun mismatch domain mismatch agent fulfil part task trust agent act user reliabl act user agent reach specif goal commun agent specifi user express agent commun side question make understand anthropomorph deal humanlik agent foner agent anthropomorph featur discuss agent agent anthropomorph characterist agent featur expect foner explain interact user agent success agent perform user expect import expect agent match realiti agent foner run mud julia particip mud user knowledg mud access julia knowledg advantag player knowledg julia room mud knowledg player julia fulfil criteria agent independ action julia rememb thing user mud domain knowledg foner state internet todai agent anthropomorph make agent foner view agent comment foner talk trust agent user user capabl perform task agent autonom commun user definit autonomi clear mention respect domain agent intend good point foner program agent lifelik featur petri agent gener descript agent act petri suffici descript appli comput softwar problem petri point mean agent intellig word intellig context agent problemat issu due reason intellig attribut necessarili distinguish intellig agent technolog softwar intellig softwar base artifici intellig technolog creat agent goal make intellig poor agent creat task set accomplish mud multi user dimens game plai internet inform problem petri point intellig defin peopl assign mean intellig petri state talk autonomi separ agent softwar reason find definit franklin graesser appeal petri make definit agent refer definit franklin autonom agent system situat part environ environ act pursuit agenda effect pp extens definit agent divid categori definit mention tempor flexibl charact classif base properti agent agent classifi task perform petri add thing autonomi crucial autonomi impli initi final petri foner agent julia make clear articl julia intellig agent julia speak spoken julia strike user person autonom intellig petri differ softwar perform background task comment petri talk import aspect call agent intellig autonom interest question word intellig charg autonomi import characterist intellig weak definit broad softwar program slightli autonom jen wooldridg agent jen wooldridg agent autonom agent autonom capabl act direct guidelin human agent mean agent control action agent encapsul behaviour intern state agent compar ordinari object intern state import method object invok compon implic object autonom case jen wooldridg agent control agent method belong request agent perform task agent decid perform action agent exampl exist thermostat autonom devic monitor environ action occur wooldridg jen refer system agent make distinct agent intellig agent intellig agent capabl flexibl autonom action flexibl mean agent proactiv agent social interact human solv problem implic agent perceiv environ respond occur final intellig agent mean agent act environ initi achiev behaviour jen wooldridg attribut proactiv repres singl compon differenti intellig agent softwar entiti expert system attribut exclud agent addit attribut comment jen wooldridg make good distinct agent object talk entiti invok make good definit autonomi afraid talk intellig jen wooldridg make distinct agent intellig agent flexibl separ definit artefact thermostat view agent mae agent patti mae intellig agent understand dynam unpredict abil make order fulfil goal intellig agent learn experi accomplish specif task agent abil commun agent human basic function agent mae mae mention agent characterist autonom lifelik mae mean spontan lifelik attribut natur applic interfac agent show facial express interest field entertain interfac agent goal assist user refer person assist import featur abil learn user watch user perform watch agent assist user copi behaviour agent user function person assist person assist specif interest comput perform task user inform work overload comment import thing mae mention order learn agent humanlik characterist spontan import featur contribut make agent intellig characterist import mention featur problem point agent exhibit characterist typic characterist agent mae definit good definit agent final present definit intellig agent agent continu perform percept dynam condit action affect condit reason interpret solv draw determin pp mean agent understand event reason determin final act agent exist dynam environ abil adapt behaviour situat distinct point definit agent belong specif domain area dynam agent work specif area respect agent domain built agent kind domain agent work decid architectur turn decid kind behaviour agent respect decid object suggest build agent decid agent decid behaviour requir fill nich agent work suitabl architectur chosen agent develop agent architectur work complex demand agent adapt comment import defin specif agent base agent agent intend import respect understand agent characterist task agent perform depend domain intend put energi make clear definit constitut agent talk agent relat environ mention characterist carri intend behaviour agent characterist notic great disagr defin intellig agent research agent softwar program offer assist characterist agent opinion drift research defin agent gener descript reason view built agent make suit agent mean make gener definit agent base research made definit intellig agent ascrib characterist agent structur part number import agent characterist chosen characterist work research import featur agent poss label intellig agent research mention characterist mean characterist agent research mention lot characterist autonomi intellig research develop fact agent capabl autonom action agent autonom control action act user agent initi pursu object import featur softwar agent problem opinion characterist agent definit characterist illustr definit intellig agent agent opinion agent julia foner julia good intellig agent fulfil criteria foremost intellig agent autonom initi petri hand julia autonom initi intellig agent se differ julia softwar program perform background task research equal autonomi intellig initi make agent intellig emphasi human intellig talk machin intellig research make differ agent intellig agent jen wooldridg agent simpler intellig agent intellig agent flexibl agent explain intellig refer agent involv word intellig petri state talk intellig agent autonom agent state difficult talk intellig peopl associ intellig human intellig machin research learn characterist involv word intellig learn agent learn order case talk autonom agent question agent learn debat research learn import featur agent mention abil learn import featur agent adapt learn situat intellig agent encount exist dynam environ agent adapt learn environ experi solv advantag softwar program abil program rememb thing memori solv problem agent learn user observ learn agent learn environ learn agent trust avoid wai describ machin learn express learn abil term acquir specif import knowledg physic achiev abil interview commun commun agent user agent mean agent commun interact user natur languag symbol exchang inform agent special agent commun languag kqml agent abil research agent research commun supplement agent featur essenc agent work solv problem complex singl agent solv trough cooper agent goal reach accomplish mention main advantag agent foner user agent solv problem agent solv specif problem definit exclud user agent figur solv problem cooper agent find solut necess agent order solv bring complex task carri complex problem agent perform smaller task complex imagin exist commun case agent observ decid act work interact commun lifelik goal make agent lifelik creat agent capabl emot social interact creation lifelik comput charact requir wide varieti technolog includ speech natur languag understand anim understand dialogu mechan social psycholog essenti controversi matter ascrib agent humanlik displai graphic realist human face research agent show lifelik featur agent lifelik lifelik mean agent act characterist typic human featur agent show featur distinguish softwar program agent lifelik featur easier engag user applic task hand program requir engag user educ train program problem user tend spend time interpret humanlik imag mobil mobil mean agent move comput perform task suitabl perform share resourc execut time internet research mobil agent offer import method perform inform retriev transact network agent internet behalf find cheapest flight destin check possibl agent travel form server server select inform onlin time agent found optim inform calcul transfer back comput static agent receiv tremend amount inform agent select inform transfer stai line hole time disadvantag amount inform receiv speed connect slower connect time send vast amount inform line studi ibm conclud note mobil agent mean remot control disadvantag mobil agent problem receiv server fulli control agent damag server mobil agent work theori technic problem mobil agent realiti confer mobil system present hung mobil agent close system show success applic mobil agent system agent softwar program assist user agent act gener answer depend context system interview approach impli agent domain agent part environ goal singl agent complex divid task agent work commun agent complex agent commun part system simplest intern structur system system figur system studi action learn mail agent predict action base earlier event agent rememb present suggest action user modifi predict function base correct suggest figur singl agent agent support entiti base bradshaw system agent awar order solv specif task carri agent model goal action advantag nwana put agent multipl agent place contrast pp agent commun order agent system commun observ order gain requir knowledg differ system system system agent affect environ chang condit agent system watch inform figur agent repres entiti base bradshaw distribut system agent share task figur reason system domain includ goal repres agent system speed system parallel comput gain scalabl program easier system natur distribut geograph sensor system air traffic control system suitabl system requir fusion inform system charact object system enhanc effici flexibl suitabl system model system provid solut wrong foremost import focu problem meant solv benefit todai focu agent research system agent commun solv complex task singl agent capabl trend multiag system obviou agent system singl agent architectur present agent definit talk agent sensor system make definit intellig agent base present construct applic domain notic gener definit accept lead opinion constitut intellig agent base definit defin intellig agent entiti exist creat user specif task specif domain basic idea intellig agent research definit elementari agent number specif characterist call intellig agent primari attribut intellig agent autonom learn autonomi agent softwar program autonomi mean agent act make agent user autonom reliev pressur user workload give user time spend issu agent intern encapsul import differ agent entiti object featur enabl autonom action strongli jen wooldridg object initi compon call public method agent agent commun specif agent commun languag agent decid act argu differ separ agent object make agent independ agent decid perform task object choic import autonomi agent defin compulsori agent characterist figur import fact research talk autonom agent intellig definit exampl confer compulsori characterist mobil learn autonomi commun figur agent specif featur definit agent learn proce knowledg solv problem agent exist dynam environ environ agent learn carri mission agent learn user act inform find agent learn import human characterist thing enabl characterist intellig agent nwana agent lifelik typic characterist addit characterist learn react interact extern perform pp essenc artifici intellig abil learn agent develop artifici intellig commun central matter agent technolog agent level learn depend kind task agent assign import featur intellig agent abil learn featur autonomi main thing separ intellig agent ordinari softwar compon definit learn make compulsori characterist figur agent mobil lifelik essenti characterist typic agent characterist figur discov argu agent abil learn learn watch user commun simplifi intern structur agent good user time teach agent commun agent user learn behaviour agent abil commun user agent lack abil fact commun languag develop kqml impli area engag research develop agent solv complex task work divid task task complex easier solv mean agent share inform result agent seek requir inform strong connect commun agent commun watch commun make easier agent show lifelik featur disadvantag mae lifelik featur mean spontan entiti act spontan provid addit inform interest mobil characterist import mention interest area solv problem characterist foremost agent slow net benefit agent comput execut lot band width solv task typic characterist lifelik agent specif agent encount poss agent manag agent featur addit characterist featur robust figur explicit agent characterist characterist softwar compon decid featur agent import decid domain agent work wind agent complex task perform agent featur simpl agent solut argu domain agent resid import decid featur agent view agent characterist toolbox pick tool problem agent learn kind task agent perform impli characterist suitabl agent possess mean autonomi learn characterist import characterist characterist import decid task agent perform domain work point mention trust agent inform receiv time save agent lost foner trust peopl deleg task agent talk intellig agent difficult matter problem word intellig subject mean definit intellig agent human mislead call agent intellig argu term autonom agent intellig agent inform agent smart agent nwana suitabl call agent autonom agent import characterist differenti agent softwar entiti fit agent definit question system depend system build intellig agent sensor system advoc approach suitabl agent complex agent commun agent add system interview summari make definit implement sensor part definit point gener definit applic definit investig agent technolog relat futur distribut sensor system definit agent possess autonom featur abil learn characterist suitabl depend domain agent work defin level typic agent characterist addit characterist hope definit make discuss contact concept intellig agent point talk agent intellig definit agent mind agent call autonom continu word intellig agent establish word agent sensor form theori intellig agent move investig agent technolog sensor system explor kind system agent technolog exist agent system idea intellig agent sensor system final describ sensor system exist problem sensor system comb literatur studi interview inform gain confer aspect discuss agent technolog sensor system agent technolog solv exist problem sensor system pinpoint sensor system refer sensor system develop ericsson microwav system case clear text agent agent suit system ill structur complex agent technolog kind applic categori agent suitabl discuss research jen wooldridg bradshaw common opinion categori area agent appli modular agent suit applic fall natur agent technolog object technolog benefit modular applic act form suit agent technolog basic act action changeabl system modular system handl chang modular system chang bit time impact modul modul agent good system modular good system changeabl system system structur inform system design kind system agent agent distinct notion environ mean agent handl dynam environ complex applic complex harder handl agent technolog solut provid abil model compon behaviour program thread execut system akkerman al develop system time agent suitabl system demand control agent practic work system includ intellig agent develop late greatest progress field internet agent act person assist sort mail collect entertain agent comput agent simpl compar agent creat work larg practic system section introduc agent system develop practic construct readi mean test instal air traffic manag air traffic world grow dai requir effici advanc monitor system meet demand system intellig air traffic manag develop aim control infrastructur air traffic control heavi workload manag control arriv aircraft airport oasi calcul estim land time aircraft determin sequenc aircraft land give total air traffic control action achiev sequenc notifi control differ establish sequenc actual advic action respond sudden environ meteorolog condit aircraft emerg carri function intellig agent handl problem solv area specif agent design oper task area air traffic manag system agent solv part task act autonom produc system behaviour type agent oasi perform comput reason relev call aircraft agent reason call global agent system assign aircraft agent arriv aircraft agent aircraft specif data speed altitud collect surround radar system exist global sequenc trajectori checker wind model agent user interfac agent agent head chief activ agent system sequenc agent aircraft sequenc schedul trajectori checker agent control instruct system aircraft wind model agent collect data wind condit form aircraft agent calcul wind aircraft encount user interfac agent handl commun air traffic control oasi handl hundr aircraft interact schedul agent oasi prototyp half year build successfulli test sydnei airport system scale implement traffic applic inform technolog traffic situat grow area interest traffic applic develop system achiev effici traffic save resourc improv ecolog aspect system model architectur traffic distribut mean geographi high level autonomi dynam agent system repres depend system user involv mean transport car branch traffic modal traffic technolog tool simul model complex situat traffic situat technolog improv traffic control system system present system huge deal great amount data gather distribut sensor exist traffic system base technolog light control autonom learn agent capabl control traffic light road cross intellig process imag camera direct determin light green red todai dynam traffic light control call blind sensor advantag estim number vehicl direct inform determin durat green light learn tune durat green light grant direct depend number vehicl captur approach vehicl long case blind sensor possibl abil detect event occur accid approach ambul polic car duti control agent system object control traffic light prototyp successfulli implement simul intellig agent shown power tool develop simul applic intellig agent technolog person practic specif task specif situat environ agent user simul specif situat simul applic model system system agent simul pilot creat combat scenario real human pilot interact autom pilot agent practic prepar real futur situat system simul characterist aircraft weapon tactic knowledg reason pilot exhibit pilot system implement mid royal australian air forc studi involv surrog pilot agent system autonom reach predefin goal act dynam action real pilot unknown simul system monitor system nuclear power develop germani system includ compon simul particl effect human bodi paradigm agent provid distribut commun awar social develop felt import characterist applic applic base approach kind agent provid client agent start simul simul agent encapsul simul model carri part system agent manag user interfac system data agent obtain data base sourc exist agent cover task manag result report data simul data emiss weather condit collect sensor project fulli implement develop optimist finish time system stand comput system increasingli import part naval air civilian applic area air traffic control emerg servic system collect data situat sensor radar long term collabor militari research program includ number western european develop support system agent technolog system alloc close air support identifi target air support mission fire support command inform resourc alloc current situat system present feasibl asset potenti target user select asset target resourc alloc plan user abil assign prioriti target defin damag criteria target applic advanc prototyp develop period successfulli implement test carri servic applic agent creat agent autonom solv task agent commun main agent agent agent handl interact user agent call agent exhibit domain knowledg agent gener solut resourc alloc label agent main agent system encapsul capabl knowledg order gain advantag reusabl agent approach agent act autonom encapsul behaviour thing found system develop system design easili comprehend abstract agent compon perform task user agent person servic assist field research intellig agent submit lot research area person servic notic confer person assist agent repres user learn behaviour act user behalf internet intranet develop applic system person agent repres interest agent search intranet inform interest user agent agent similar interest exchang inform import featur agent learn lot similar system develop system develop franc telecom develop present confer system similar idea person assist agent sensor system sensor detect signal object specif type depend sensor infrar acoust passiv radar type inform event set radar detect object long distanc identifi object combin kind pictur richer larger area examin type inform area order provid applic domain research present exampl sensor system base radar work exampl base sensor model ericsson microwav system ab radar system work radar cover specif geograph area captur inform object boat size capabl identifi larg object difficult identifi object speed object visibl object clue ident radar present detect user radar present fall leaf aircraft difficult draw line interest object decid system built user radar bother kind problem user filter pictur system job decid kind boat aircraft radar detect object long estim size veloc discov unusu event fit expect pattern estim radar combin sensor system interview interview radar cover common area identif object area figur radar staff talk kind object figur radar overlap situat problem radar staff time find object radar object identif mean radar number exact pictur pictur call situat pictur show object visibl area cover sensor radar todai radar abil inform object detect radar correl speech radio commun figur interview common cover area speech figur commun radar todai handl speech radio commun radar radar cover area cover area system develop provid autom commun correl common situat pictur figur show radar form system consist radar commun system radar creat situat pictur radar main radar figur radar system figur main radar abil detect object receiv inform object act spider web object detect main radar call local object main radar support radar cover area part form region inform object support radar transmit main radar object detect region region object main radar connect main send inform collect region sensor system radar identif object main radar receiv inform main radar inform local object region object main radar send local inform main radar send inform receiv form main radar limit set radar start send inform back radar inform overload system main radar decid object inform result call system repres object detect connect radar system inform system object final transmit user user receiv situat pictur interview user main radar region support radar support radar radar correct situat pictur radar put pictur user correl pictur begin sensor system provid advantag singl cover larger discov data secur measur import advantag user correl pictur area cover radar pictur radar problem radar creat situat pictur base detect inform exist common pictur entir cover area mean user connect radar receiv pictur user connect radar system pictur radar receiv inform closest depend radar user connect situat pictur radar radar activ long time easili turn chanc locat activ present manual radar staff interv autom activ radar staff concentr import task identif object area radar cover part problem turn manual mean turn time optim system vision radar countri connect control cover area optim sensor system kind problem todai radar connect complet system cooper mean aircraft discov radar radar activ radar follow object area cover radar activ cover sector plane track aircraft lost coupl radar activ advantag optim radar activ interview interview interview interview futur exist sensor system continu vision sensor connect common inform space figur baltic watch sensor connect intranet internet give particip easili access time baltic watch project figur sensor connect intranet internet catastroph accid baltic sea discuss secur sea baltic watch project aim secur region basic thought project state baltic sea share oper resourc facil order improv secur secur involv traffic meteorolog observ search pollut problem project secur reliabl inform parti countri govern agenc parti benefit spread wrong inform inform find suitabl baltic watch idea creat pictur situat baltic achiev kind sensor sensor monitor sea shore send collect data central process fuse interpret data final creat pictur present oper human report order creat pictur interview user sensor situat land water air sensor inform present oper baltic sea larg number idea exist sensor connect creat baltic watch surveil system coastal air surveil underwat satellit base sensor mast exampl sensor monitor sea shore baltic state appendix agent sensor system provid relev background issu research intellig agent futur distribut sensor baltic watch project answer question base reason analysi definit intellig agent present inform system inform sensor exampl intellig agent system appli practic answer question idea give exampl intellig agent futur distribut sensor system fact present show imposs implement sensor system due social polit aspect critic issu talk futur sensor system perspect due fact answer question informat point social polit view vision sensor system connect common internet base thought support baltic watch project mention agent system ill changeabl futur baltic watch system system divid part countri form part project sensor sensor break parti connect system impli system changeabl system fulfil fourth criterion agent system baltic watch system sensor system sensor break kind sensor inform system advanc system complex sensor involv lot data number sensor system suggest suitabl advantag agent baltic watch system agent sensor system encount system base sensor intellig present system strongli impli agent technolog applic sensor system develop ericsson microwav system ab definit intellig agent conclud autonomi learn import characterist agent poss label agent definit start point reason agent baltic watch system sensor agent baltic watch system kind sensor put system pictur realiti radar monitor part turn radar discov sea identifi word sensor point sensor cover specif turn sensor intellig agent achiev creat agent sensor area agent inform sensor activ turn agent specif area commun cooper reason sensor ad agent agent area object sensor detect sensor agent calcul sensor detect object depend direct store knowledg agent calcul sensor time specif inform situat specif inform inform enlighten agent sensor turn time due fact sensor cover sensit area agent function agent sensor possibl cover area sensor cover area happen sensor break agent sensor cover import agent abil learn interview sensor provid agent spend time search agent import characterist time critic aspect system sensor broken area monitor import quickli sensor cover area clear sensor agent exhibit autonom action control action behaviour initi pursu object agent input sensor agent activ agent determin prefer impli sensor agent control action sensor agent commun cooper sensor sensor agent commun order find optim solut agent commun user system agent learn agent sensor agent rememb sensor agent sensor connect result sensor resourc share obtain found parallel sensor agent exampl traffic applic section exist similar sensor traffic light control agent control traffic light sensor cross sensor agent control sensor decid activ sensor object agent sensor detect object area good thing sensor pick trace sensor object todai commun sensor provid function mean sensor creat pictur current situat benefit object store data system detect oil spill baltic system control store data boat area present boat pollut todai imposs find discov action solut track problem creat agent object enter baltic sea aircraft agent born sensor detect object system agent gather inform object sensor agent detect problem easili retriev inform object present detect object agent sensor agent object inform sensor agent object benefit idea sensor pictur situat refer object object sensor thought agent monitor object implement oasi system section system aircraft assign agent store inform aircraft identif posit object agent monitor object user user interact agent question agent contact user user agent object agent learn rememb object travel object behav commun import featur object commun user sensor agent cooper sensor agent featur object agent agent travel object mean agent depend comput travel intern net system kind agent solv problem posit synergi effect object enter area sensor agent object agent object provid sensor agent give object mean correl sensor object exist sensor disappear simul agent creat simul agent survei agent agent discov strang activ move pattern object unusu construct simul find kind situat occur boat state oper creat scenario sensor agent perform simul baltic watch project exist boat collid agent calcul boat speed make predict head agent discov boat report inform oper turn alarm boat action simul oil spill water spread depend wind water condit agent collect data sensor central simul agent put inform simul scenario scenario present person involv oil simul agent abil learn proce predict similar event thought found practic agent simul present earlier section simul agent construct scenario data agent collect inform creat simul particl similar agent oil simul simul agent perform simul agent data agent collect inform weather water condit sensor type simul agent includ agent simul disast simul rescu oper idea agent simul encount applic section agent simul combat aircraft behaviour model pilot reason process exampl agent technolog appli simul applic state agent technolog power tool construct simul system learn commun featur simul agent possess act independ perform simul form user simul initi user agent start simul learn agent perform simul feedback user feedback teach agent simul success knowledg perform simul agent commun user inform situat sea give user result form simul person assist agent baltic watch project lot interest countri involv interest system interest kind inform system person assist interest parti inform search inform time agent learn user prefer kind inform interest baltic watch intranet internet object agent sensor agent inform user correct situat pictur area monitor advantag agent watch area interest time make instant updat situat pictur agent learn user interest learn sensor give inform area interest agent autonom learn commun agent type collect object sensor agent agent advantag crucial oil spill area interest agent report mean agent lifelik featur exampl system person assist agent order share illustr previou chapter section system sort person calcul action oper make suggest oper summari suggest intellig agent sensor system solv problem futur distribut sensor system sensor agent sensor cover area sensor fail achiev characterist learn commun advantag object store inform object control object situat pictur displai object agent exhibit featur commun learn simul agent simul scenario move pattern object scenario predict final person assist person author find inform specif task agent suggest rule possibl intellig agent suggest agent form agent type agent type agent type commun reach goal sensor agent person assist agent commun agent group sensor system contribut sensor system lot gain idea entiti contribut lot sensor system gener discuss definit intellig agent mean gener definit applic agent agent system disagr research develop definit intellig difficult common understand percept intellig agent made definit understand agent technolog intellig agent common base reason appli agent technolog sensor system easier understand intellig agent sensor system clear definit intellig tailor investig advantag definit strongli import autonomi research agent featur stress advantag rule characterist research provid list agent featur rule featur list concentr import featur exclud addit featur impli agent agent specif characterist agent characterist import aspect creat agent domain work task perform mind made agent type sensor system problem approach rule possibl creat agent gener applic problem area weak definit discuss mean intellig context intellig agent reason intellig defin wai human intellig weak agent abil learn order result agent exist todai agent definit definit creat gener definit applic creat base reason agent sensor system definit solv disagr defin agent agent applic practic situat system rare state agent applic sensor section sensor system fulfil criterion parunak put shown exampl sensor system agent system section traffic light system section exampl agent solv problem sensor system make sensor system effect exampl contribut sensor system fulfil imposs give exact answer intellig agent develop futur distribut sensor system answer agent idea test prototyp issu suggest agent type deal data inform gather simul section perceiv advantag achiev agent technolog solv issu system present common situat inform connect system finland sweden agent provid advantag advantag system easier creat natur modul problem section advantag easi transform pilot prototyp agent system real system agent system easier compon add agent agent reduc complex larg system agent model behaviour interact system note advantag develop easili understand design structur system metaphor agent perform task user agent section advantag found agent user main idea agent technolog reduc illustr oasi flight traffic system section exampl agent technolog suggest agent suit system realtim demand shown section case great advantag sensor system time critic aspect make radic suggest agent sensor system bring agent idea agent technolog sensor system program system total princip program agent specif situat solv specif program sensor system problem agent technolog area develop languag product design agent system exist agent framework languag wide product develop high level skill requir develop intellig agent system consequ long time construct agent case system oasi conclud intellig agent futur distribut sensor relev agent technolog surviv program paradigm program paradigm research point develop start agent technolog easier reach basic concept agent technolog tool develop construct applic section visit confer agent technolog settl program paradigm specul agent technolog eventu replac live side side complement futur conclud van dyke parunak obstacl agent technolog succe easier develop agent remov technolog make breakthrough futur intellig agent shown agent futur distribut sensor argu ericsson microwav system ab agent technolog futur distribut sensor system quot van dyke bet competitor agent solut agent solut difficulti develop softwar applic argu import agent advantag disadvantag agent technolog overestim capabl intellig silver bullet softwar busi solv problem actual master account present answer research intellig difficult make definit intellig agent make gener definit gener intellig agent entiti goal user definit agent autonom abil learn agent characterist toolbox tool depend domain task agent perform intellig agent technolog futur distribut sensor agent technolog sensor system due parunak sensor system due success develop system technolog implement number agent type futur distribut sensor system label sensor object simul agent person assist agent kind agent solv problem contribut sensor system sensor creat unifi situat pictur entir area type agent implement futur distribut sensor system van dyke parunak lectur support agent type system present system evalu work trust suggest implement prototyp proper evalu simul agent contribut wai sensor system make reduc complex make system dynam contribut develop process provid abstract develop easili understand reduc scalabl problem awar fact thing differ master thesi easier start problem exist sensor system investig agent technolog solv problem test suggest work chanc valid agent exampl spend lot time find agent agent technolog meant time left develop prototyp thing great deal knowledg requir includ materi thesi meant classif work mean includ import aspect chapter sensor system detail thing concentr radar contact expert possibl investig sensor work limit futur research master thesi describ area intellig agent present suggest usag agent technolog futur distribut sensor system work area show interest aspect agent technolog suggest ericsson microwav system ab concentr implement agent exampl simul sensor system environ valid agent exampl specif show contribut develop futur distribut sensor system interest investig ericsson microwav system ab approach implement specif repres role investig level learn agent sensor system learn abil specif implement ericsson microwav system ab believ success agent technolog invest suggest develop agent framework base agent applic develop suitabl wait framework develop agent commun settl establish standard develop tool refer system field market predict power load intern confer practic applic intellig agent technolog practic applic compani pp traffic light control technic institut intellig rapport lund baltic lund inform retriev base collabor user intern confer practic applic intellig agent technolog practic applic compani pp construct intellig agent java programm guid smarter wilei comput publish distribut agent internet user intern confer practic applic intellig agent technolog practic applic compani pp ed softwar aaai press mit press techniqu traffic manufactur progress agent technolog pp scandinavian journal inform vol al manag research sage public jm traffic control intern confer practic applic intellig agent technolog practic applic compani pp ln agent intern confer autonom agent taxonomi autonom intern workshop agent architectur softwar theori agent technolog pp inform system simul intern confer practic applic intellig agent technolog practic applic compani pp good ibm research report rc maryland architectur adapt intellig artifici special issu agent agent architectur agent intern confer practic applic intellig agent technolog practic applic compani pp mj intellig agent technolog pp effect ieee intern workshop robot human oasi air traffic manag pacif rim intern confer artifici reduc work inform commun acm juli life meet lifelik autonom commun acm defenc oper analysi confer associ pacif oper research societi depart australia dt hs perspect softwar agent knowledg engin review dt hs introduct softwar agent agent technolog pp hs knowledg engin sept ieee system applic pp rapport method knowledg ed qualit research method sage public survei machin learn technic report depart comput carnegi mellon pa discuss barrier industri agent intern confer practic applic intellig agent technolog practic applic compani pp grace intellig agent situat awar interpret inform system ifip inform system qualit philadelphia van dyke industri applic industri technolog van dyke experi issu develop industri intern confer practic applic intellig agent technolog practic applic compani pp inform agent extract sport result world wide intern confer practic applic intellig agent technolog practic applic compani pp appendix baltic watch ericsson microwav system ab ab system ab start project call baltic watch aim secur baltic sea region project vision mean thought project show imposs goal basic thought project state baltic sea share oper resourc facil order improv secur baltic mean properti environ includ thing region border protect illeg traffic environ disast relief telecommun object kind system author monitor detect pollut traffic telecommun traffic monitor monitor sea detect risk warn ship reduc number incid year monitor ship import countri reason ship carri special monitor exploit fish resourc accomplish posit ship import inform ship pollut traffic detect pollut incid traffic monitor radar technolog baltic watch sea monitor frequent discov oil spill earlier differ chang water movement salt content telecommun todai baltic sea cover call futur great advantag baltic sea gsm commun gsm give traffic surfac possibl connect ship talk phone send inform technolog telephon earli warn surveil system inform baltic watch make inform countri region achiev larg integr system figur figur architectur watch system system architectur integr control centr facil share concern author agenc countri distribut system internet internet base give particip baltic watch access possibl activ part search rescu mission meant develop connect local intranet network agenc author recommend common recommend system integr recommend countri larg freedom local implement kind sensor baltic watch coastal air surveil underwat sensor satellit base sensor coastal exist radar system coast baltic sea air surveil radar monitor air space control air corridor identifi aircraft radar radar aircraft advantag easi chang surveil area underwat sensor exist import surveil water condit protect guard specif object water ensur detect satellit base sensor map object baltic sea monitor weather sensor sensor measur sensor exist todai implement monitor todai uncov area integr sensor system entir sea shore monitor step baltic watch countri monitor progress great interest exampl countri egypt monitor monitor amazon appendix interview date interview interview interview interview interview interview interview method unstructur interview interview hour question intellig agent question research depend relat intellig agent interview unstructur inform question suitabl question interview main direct import question present question agent defin intellig specif characterist intellig agent intellig import agent question mobil work practic exist encount system mobil question singl differ singl encount practic question construct intellig practic experi construct difficulti encount creat question agent technolog agent bee question sensor sensor system interview sensor sensor system knowledg area question gener describ area main question sensor sensor work sensor system commun sensor main problem sensor sensor system sensor cover part situat pictur appendix confer fourth intern confer practic applic intellig agent london april confer divid track lectur lectur present research progress intellig agent technolog paper accept confer poster present poster accept confer consid interest present poster session track shortli agent manag internet commun track includ paper inform agent system present agent technolog creat commun peopl agent meet exchang knowledg inform agent framework platform lectur present agent architectur develop research agent network manag track includ present show agent control network support electron commerc lectur present system electron commerc agent repres inform inform manag system lectur present kind system develop manag inform system handl agent sort filter inform internet kind system present agent larger practic applic agent product plan resourc manag present system develop make industri system effect agent technolog achiev panel discuss dai confer panel discuss subject industri agent held research particip panel discuss mamdani imperi london anand mitchel madison melbourn norman european brussel kate sun ma van dyke center electron ann mi
AI/452 2 regul interact facial express breazeal massachusett institut technolog artifici intellig laboratori technolog room ma usa abstract paper present motiv system autonom robot design regul interact mode social interact dyad human act caretak robot robot motiv system design gener analog interact dyad dyad infant emot drive plai import role gener interact caretak learn task robot appli commun skill acquir social exchang manipul caretak drive satisfi motiv system implement facial express interact regul specif promot suitabl learn environ detail learn scope work repres import step realiz robot engag social interact human introduct build robot engag social exchang human contrast current work robot focu interact dautenhahn work concentr interact social sophist human assist robot acquir commun skill learn mean act approach inspir infant learn commun adult work repres stage long term endeavor present motiv system support research provid muri grant naval research contract santa fe institut autonom robot special learn social context mode social interact dyad human act caretak robot commun skill target learn exhibit turn share vocal context learn involv social exchang robot learn manipul caretak satisfi intern drive infant emot drive plai import role gener interact caretak interact constitut learn episod commun behavior infant strongli learn commun skill result caretak satisfi infant drive infant emot provid import cue caretak assess infant carefulli regul complex interact critic infant learn action critic establish maintain suitabl learn environ infant bore robot motiv system design gener analog interact dyad dyad motiv system implement facial express compon interact maintain mutual regul interact human level intens paper detail motiv system perform regulatori detail learn learn occur left futur paper pictur robot shown figur vision system consist color ccd camera focal mount stereo activ vision head robot abil move orient engag varieti human visual figur robot consist activ vision head supplement facial express robot eyebrow eyelid mouth includ primari sensori input color ccd camera mount ey auditori input vocal capabl construct robot equip number facial featur emot express facial featur includ eyebrow ear robot eyelid mouth facial express fairli simpl easili recogn human robot show express analog paper organ discuss numer role motiv plai natur appli behavior regul intens social learn social context present framework idea cognit design motiv system integr behavior express motor act illustr idea implement physic present result earli interact experi discuss plan extens exist system role motiv behavior learn motiv encompass intens reflect express motor act motiv plai import role anim human behavior learn interest influenc behavior regul social promot learn social context behavior work motiv theori explain anim engag behavior time promot surviv intern drive influenc behavior anim depend intens sensori stimulu result behavior dog respond bone hungri danger regul social infant motiv plai import role regul social interact mother infant displai wide varieti facial express respond event world express cue mother act interpret indic intern state feel modifi action promot content maintain current level intensifi interact infant regul intens interact mother displai emot cue mother instinct read infant express signal modifi action maintain level interact suitabl learn social emot express gestur regul social interact plai import role facilit learn social exchang parent activ role shape guid infant learn mean word parent support framework infant manipul infant interact environ foster abil involv reduc mark task critic reduc number freedom target enabl subject experi end outcom sequenc activ infant cognit physic seek attain bruner ross emot cue parent receiv social exchang serv feedback parent adjust natur intens structur learn episod maintain suitabl learn environ infant bore earli interact infant motiv emot displai plai critic role establish foundat context learn episod learn share mean commun act infant displai wide assort emot cue earli face face exchang mother earli infant basic emot thing mother share impart consist mean infant express gestur interpret mother indic intern state experi argu mother suppli mean exchang infant young infant express act evok specif mother assum infant share mean emot infant discov sort activ part specif routin sequenc natur built serv basi learn episod context expect earli cri infant elicit depend initi interpret cri infant respond mother act infant mother converg specif mean kind cri gradual infant subtli cri cri cri cri cri elicit mother mother reinforc share mean cri respond consist wai subtl variat pair develop commun protocol evid phenomena paragraph demonstr motiv plai role determin robot interact learn social exchang import function robot motiv system establish interact regul intens robot learn design interact robot express provid cue human chang activ modifi intens parti modifi behavior maintain interact robot learn satisfi drive framework design motiv system framework motiv system interact express behavior shown figur system architectur consist motiv behavior perceptu motor system motiv system consist drive behavior system consist type behavior conceptu perceptu system extract salient featur facial express implement motor system motor skill organ oper framework heavili influenc concept psycholog figur figur illustr framework build motiv system integr behavior detail explain main bodi text comput system implement architectur similar basic comput process model transduc activ energi comput integ valu input weight bia number input weight posit posit weight correspond excitatori connect neg weight correspond inhibitori connect process activ activ level exce activ threshold process perform special send output messag connect express behavior motor skill model separ transduc process specif tailor role system architectur detail present section unit connect form network interact process involv connect unit unit pass messag unit connect activ unit pass activ energi unit connect call spread activ mechan unit influenc activ suppress unit group connect network form subsystem unit subsystem special tailor perform comput subsystem behavior drive emot motor percept function follow basic transduc model robot drive serv influenc behavior select preferenti pass activ behavior influenc emot state robot pass activ energi emot process robot reflect emot drive indirectli control express cue robot displai caretak provid learn context robot learn skill serv satisfi drive design robot drive subsystem heavili inspir etholog view distinguish featur drive tempor cyclic behavior drive tend intens anim hunger level sleep cyclic pattern distinguish featur drive natur anim maintain varieti critic paramet energi amount bound rang drive chang intens reflect ongo robot urgenc tend desir oper point drive accept bound oper point call rang regim long drive robot adequ met drive model separ process tempor input implement cyclic behavior activ energi drive rang magnitud drive repres intens drive larg posit magnitud correspond larg neg magnitud correspond environ drive partit overwhelm regim robot evok behavior respect eat hunger sleep fatigu point robot motiv engag behavior maintain drive regim drive move farther desir oper robot engag behavior serv drive drive activ level pass activ energi behavior long behavior intens drive reduc regim drive amount activ energi pass behavior behavior eventu behavior view behavior separ behavior strategi bring robot state directli activ desir behavior case drive potenti circumst prevent activ robot activ behavior eventu enabl behavior activ behavior model separ process intern extern factor comput relev activ level behavior rang max integ determin empir input drive act environ behavior output act reduc activ energi drive behavior serv bring robot state suitabl activ behavior emot robot serv function influenc emot express robot pass activ energi face motor process plai import role regul face face exchang caretak drive plai import role establish emot state reflect facial emot plai import role commun state robot caretak urgenc tend emot plai import role learn face face exchang leav detail paper organ oper emot subsystem strongli inspir theori emot human davidson close resembl framework present robot emot process emot design rough analog respect accompani facial express emot distinct consist famili similar emot grade intens happi rang content baselin activ high activ activ level emot rang max integ determin empir emot intens exce threshold level express extern facial express reflect level activ emot emot rise activ decai time back base line level continu receiv input process unlik emot intens express natur ongo event maintain activ level slightli threshold correspond mood implement establish set bia term blend emot occur compat emot express simultan avoid conflict emot activ mutual inhibitori connect exist emot facial emot accompani facial express implement motor system motor process robot facial featur move human adjust facial featur express emot friesen robot ear move analog dog move express motiv state design motiv system robot motiv system subsystem subsystem implement robot implement implement facial express express skill implement motor part motiv system present relev aspect behavior system present design specif subsystem remaind section motiv establish natur creatur defin influenc act satisfi robot learn social environ behavior organ robot state balanc function environ high learn potenti entail robot motiv engag interact environ interact drive adequ satisfi drive paramount surviv maintain drive regim import process robot basic drive social drive presenc peopl stimul peopl import robot learn social context extrem robot act wai face face contact peopl left drive continu intensifi lone end spectrum robot act wai disengag peopl face face contact robot end spectrum person robot occur person move close stimul drive stimulu gener extern environ intern spontan end creatur bore occur creatur inact period time respect drive bore end spectrum current interact predict robot robot engag kind activ encourag caretak challeng robot interact part creatur occur robot receiv stimul robot reduc interact close turn head secur drive robot learn anticipatori model action world model hold implic robot expect behav environ drive plai import role regul robot interact environ model guid behavior robot maintain environ compet slightli modifi exist model suit environ learn time pass left drive secur end spectrum impli robot expect hold true interact environ behavior move drive insecur end fatigu drive drive unlik robot shut extern world regul interact creatur receiv repeat stimul learn predict model action world time pass number learn event drive approach end spectrum intens level exce time robot time robot consolid learn anticipatori model integr rest intern control structur robot drive return robot readi newli modifi control structur behavior drive accompani behavior activ drive enter regim remain activ return regim behavior plai peopl act move social drive back end spectrum potenti strongli social drive approach lone end spectrum activ level threshold robot engag face face interact remain activ long interact maintain activ act reduc intens drive plai toi act move stimul drive back end spectrum potenti strongli stimul drive approach bore end spectrum activ level threshold robot engag sort stimul environ visual track object plai voic remain activ long robot maintain activ continu move drive end spectrum expect violat act move secur drive insecur end potenti strongli secur drive approach secur end robot activ level robot current expect violat activ level rise move secur drive side spectrum sleep act drive fatigu drive reach sleep behavior turn remain activ fatigu drive restor regim robot sleep serv special function robot restor drive drive drive move robot displai stronger stronger sign eventu culmin extrem anger left express displai strong sign caretak interven robot correct drive imbal caretak fail act appropri drive reach protect mechan kick robot shut sleep method robot restor drive similar behavior observ infant extrem throw fall disturb sleep regul tactic extrem case behavior activ intens drive requir special sort interact activ plai peopl activ particip person analog case hold plai toi expect violat behavior activ environ interact strong import consequ regul intens interact natur interact drive move regim drive longer potenti input strong activ drive enter overwhelm system strongli motiv engag behavior act stop stimul caretak interact robot social drive move regim robot displai express cue caretak back bit emot emot implement separ process framework emot system share strong common function specif target social exchang learn robot sad analog primari emot human emot plai import role learn social interact caretak infant includ excit experi psycholog shown infant show wit unexpect outcom familiar event parent infant displai excit interest cue regul interact al factor serv elicit cognit emphasi emot pain contribut emot level activ activ emot accompani facial express provid caretak cue motiv state robot caretak act robot drive pain inform perceptu process intens signal strong bright light shine camera sound loud robot hear pain signal serv level anger sad robot exhibit sign distress accompani protect close rotat ear loud sound caretak interpret cue robot seek sourc influenc emot serv prevent conflict emot activ time implement conflict emot mutual inhibitori connect inhibitori connect exist happi disgust happi anger recal drive partit establish drive context system region potenti emot facial express facial express provid cue drive balanc caretak respond correct drive potenti posit emot happi interest accompani express caretak interact robot plai learn drive neg emot potenti produc sign distress robot face sign distress caretak addit cue correct respect easili scenario robot face unexpect event occur cue caretak robot anticipatori model case caretak repeat event robot learn suitabl expect note sort interact robot depend drive context plai robot drive regim elicit happi caretak plai robot good inter time fatigu drive deep exhaust end plai robot prevent robot sleep fatigu drive continu intens high fatigu drive begin potenti anger caretak interpret robot act extrem fatigu potenti anger strongli robot displai caretak constru robot throw caretak back point sleep behavior activ motor emot accompani facial express implement motor system motor process low level face motor primit separ process control posit veloc freedom motor skill process level primit implement coordin control facial featur wiggl ear eyebrow arch brow coordin motion common facial express top motor skill face express process direct facial featur show express facial featur move characterist intens vari depend intens emot evok express intens facial featur move quickli extrem posit blend express comput weight averag facial configur evok emot experi result result earli experi shown figur motiv system experi facial express figur summari result text explan figur aspect specif learn human plai robot provid input requir activ behavior stage input provid slider gui replac visual input robot camera tabl robot behavior interact human demonstr robot cue regul natur intens interact human result ongo robot human aim maintain robot drive bound summari present framework inspir work cognit design motiv system autonom robot specif gear regul interact shown facial express influenc establish maintain social interact provid suitabl learn robot profici slightli robot stimul interact human specif demonstr system engag mutual regulatori interact human earli human input restrict gui slider step incorpor visual input specif learn social context learn address paper subject work follow refer ground commun social technic report manchest etholog interact phd mit begin interperson cambridg london lawrenc erlbaum nj natur fundament oxford york facial action code techniqu measur facial consult psychologist palo ca learn explor develop ny system emot cognit vol pp thin matern role develop commun cambridg pp emot mysteri underpin emot simon ny foundat ny behavior network experi bodi languag emot william ny studi oxford york comput model gener emot influenc behavior autonom master mit role tutor journal child psycholog psychiatri
DB/453 3 sql base associ rule mine commerci rdbm takeshi institut industri tokyo tokyo japan ibm japan japan abstract data mine increasingli import size grow larger explor hidden rule wide recogn system domin relat abil perform data mine standard sql queri implement data mine perform sql base data mine fall special implement mine tool sale paper present evalu sql base data mine commerci rdbm examin techniqu reduc cost view subqueri queri time faster sql queri report made perform evalu parallel environ compar perform result commerci data mine tool intellig prove sql base data mine achiev suffici perform util sql queri custom tune data parallel queri commerci rdbm introduct extract valuabl rule larg set data attract lot attent research busi commun driven inform amount store data recent year busi organ begin appli data mine techniqu directli raw transact result bui pattern credit card fraud indic wide recogn method data mine find associ rule basket data analysi typic method approach mine associ base relat standard sql kind mine cpu power demand applic handl larg amount transact data sql approach report drawback perform advantag seamless integr exist system high hand recent major commerci system includ capabl support parallel report parallel affect perform complex queri requir associ rule mine fact motiv examin effici sql base associ rule mine parallel speed commerci parallel system techniqu enhanc associ rule mine queri base compar perform commerci mine tool intellig perform evalu show achiev compar perform commerci mine tool node work effect sql queri mine associ rule didnt examin effect parallel report perform evalu pc cluster parallel platform comparison nativ code program report commerci product evalu associ rule mine base sql associ rule mine find custom bui bui transact larg retail organ call confid rule import paramet support support defin percentag itemset entir transact confid measur support divid support experi emploi type sql queri standard sql queri algorithm enhanc sql queri view materi techniqu enhanc sql queri subqueri techniqu sql queri algorithm transact data transform normal form pass simpli gather count item item satisfi minimum support insert larg itemset tabl form item emploi temporari tabl item combin pass transact match larg itemset preserv temporari tabl pass pass gener lexicograph order candid itemset length temporari tabl tabl length transact data gener count itemset meet minimum support includ larg itemset tabl final transact data length gener match item candid itemset tabl item larg order avoid excess disabl log execut enhanc queri view materi techniqu materi temporari tabl temporari tabl requir pass gener rule tabl delet execut subsequ pass base observ avoid materi cost temporari tabl replac tabl creation view enhanc queri subqueri techniqu expect perform improv util view requir time access system catalog hold lock system catalog tabl creat view subqueri temporari tabl emb gener item combin queri gener larg itemset perform evalu parallel execut environ experi emploi commerci parallel ibm version ibm unix parallel server ibm sp node make system share architectur node scsi hard ram connect high perform switch hp network speed commerci data mine tool ibm intellig miner singl node sp perform comparison sql base data mine dataset synthet transact data gener program apriori algorithm paper experi paramet number transact averag transact length number item transact data partit uniformli hash algorithm correspond transact id process node local hard disk perform comparison show execut time parallel deriv view subqueri sql time faster sql number node result compar execut time intellig miner singl process node true intellig miner singl node transact data store flat file faster sql queri view subqueri sql faster intellig miner singl node transact data read rdbm exemplifi achiev compar perform intellig miner singl node flat file activ node view subqueri sql result evid effect parallel sql queri mine associ rule fig execut time parallel environ speedup ratio shown figur view subqueri sql satur number process node mean parallel execut time faster node parallel network potenti degrad ratio experi suggest associ rule mine variant cpu bound network neglig fig speedup ratio parallel environ analysi execut trace oe oe oe compar variat sql queri perform evalu node mine pass long case pass gener huge amount candid itemset time consum result alik execut time belong sql queri view subqueri sql complet pass faster sql queri record execut trace sql pass decomposit execut time shown figur compar time cpu time fig find close view sql subqueri sql mean sql cpu sql cpu bound execut time queri domin disk write time creat temporari tabl sort time equal repres cost group aggreg item combin temporari tabl secondari storag gener replac view subqueri data transfer directli memori figur modifi sql queri read data buffer pool disk write time view sql subqueri sql sql analysi clarifi problem cost reduc view subqueri kei perform improv fig decomposit execut time type sql queri summari abil perform data mine standard sql queri benefit data integr commerci rdbm easier port code system oe sw report parallel sql queri mine associ rule commerci rdbm show good speedup ratio mean parallel examin variat sql queri improv reduc cost view materi subqueri achiev perform time faster sql queri pass expect improv pass wed report time compar parallel implement sql base associ rule mine commerci data mine tool intellig real show improv queri view subqueri beat perform special tool node origin queri process node achiev perform dont bui data mine parallel execut sql extra cost extrem easi implement flexibl remain lot investig wed check perform pass situat addit plan larg transact data wed investig effect intra parallel smp environ refer swami mine associ rule set item larg proc acm sigmod confer manag fast algorithm mine associ rule proc larg swami mine associ rule proc intern confer data engin parallel sql base associ rule mine larg scale pc perform comparison directli code implement proc confer knowledg discoveri data mine mine gener associ rule parallel rdb engin pc cluster proc intern confer data wareh discoveri jong soo philip yu effect algorithm mine associ rule proc acm sigmod confer manag sunita rakesh agraw integr associ rule mine relat system altern implic proc acm sigmod confer manag sharma chakravarthi perform evalu optim join queri associ rule mine proc intern confer data wareh discoveri parallel mine algorithm gener associ rule classif hierarchi proc acm sigmod confer manag
Agents/454 1 analysi mobil agent base algorithm network manag john hong shen gilbert young depart comput hong kong hong school comput inform griffith qld depart hong kong polytechn hung hong kong abstract recent advanc agent technolog brought method network ant rout algorithm effect effici demonstr report properti studi paper present preliminari analysi algorithm regard popul grow properti jump behavior synchron asynchron shown expect number agent node number neighbor host number agent gener request averag number request shown mild max probabl number agent node normal distribut function varianc max result long max jg design algorithm number agent creat request order meet network constraint introduct meet requir rapid growth program applic due widespread avail internet popular www mobil agent techniqu evolv recent mobil agent program act behalf user perform intellig task capabl migrat autonom node node inform network task determin user agent rang onlin shop distribut comput devic control success exampl mobil agent program paradigm agent process requir commun agent instanc server agent user establish singl host involv messag transfer host machin agent server machin user advantag agent program network usag messag transfer larg reduc ow tremend growth size internet latest develop mobil comput low usag network manag mobil agent base network increasingli demand recent intellig mobil agent base network manag techniqu implement fault diagnosi server dispatch network deleg mobil agent behalf network manag agent network gather inform current statu network agent back summari report report server trip middl travel commun agent server network traffic light network rout problem network manag packet messag destin multipl destin router network manag recommend path shortest send messag search optim path stationari network difficult problem search optim path faulti network mobil network difficult ant rout rout recent mobil agent base network rout algorithm environ idea mimic path search process ant request send messag receiv server gener number mobil agent ant agent move server search destin host agent reach back sourc path search leav mark host path agent sourc host evalu cost path collect pick path minimum cost send messag connect server send alloc agent reserv resourc host path fault manag messag agent gener frequent dispatch network hold amount comput resourc network host agent introduc overhead host machin host machin busi indirectli block network traffic analysi agent popul grow behavior import network manag main object paper show proper select number agent creat agent popul control probabl network model rout algorithm discuss introduc section analyz ant popul network oper synchron mode section extend result case network oper asynchron mode present section network model ant rout graph fix set host edg set connect graph connect matrix network shown figur connect matrix assum topolog network connect graph order ensur commun made host machin pagurek adapt mobil agent algorithm network rout connect manag essenti idea algorithm figur simpl network structur connect request ant agent explor creat network explor agent network sourc destin explor agent select randomli neighbor node move forward agent move node node node node connect node move destin node explor agent backward sourc node sourc explor agent compar explor path explor agent explor cost path alloc agent immedi alloc network resourc node link path path longer dealloc agent path network resourc node link note perform ant rout algorithm determin cost path search explor agent note move make explor agent stuck termin node figur explor agent move jump move jump explor agent move final stuck order allevi problem modifi algorithm present idea essenti explor agent reach destin node predefin number agent die automat agent return sourc node request send messag receiv host time host gener ant agent agent randomli select neighbor host probabl paramet total number neighbor host host ant reach check host destin turn back sourc host report path search host destin agent select randomli neighbor host host move sourc server pick path minimum number hop messag path destin machin server updat rout tabl includ inform path agent popul synchron mode number agent run host time number request initi time host assum network connect graph dynam chang agent network stochast equat kr ffi ffi select agent ffi ae agent select host ffi mean agent select neighbor accord ant rout expect side equat readili shown evolut behavior ant rout markov fp kr pn compact rewritten ji ji ae surviv agent agent run current step ji expect deliveri rate surviv agent transmit defin recurr dynam equat expect number agent network obtain analyz converg behavior lemma matrix lemma eigenvalu matrix spectral jj largest column sum equat strictli jj max jg max jg refer equat express term assum limit lim note diagon domin matrix posit vector lim converg result express theorem theorem ant rout expect number agent run host equal max matrix diagon matrix element eigenvalu matrix express max expect number agent run host equal max proof complet qed deriv covari matrix vector case covari equat random variabl ea expect ea random variabl ffi discuss covari matrix ea denot ea pa fe defin fe readili shown qa equal deriv equat qa qa qa qa oe qa qa converg theorem obtain theorem limit smaller oe qa qa oe lim qa oe notat mean matrix neg lim max max proof complet qed result state theorem theorem visual figur limit distribut lim approxim normal distribut larger max probabl expect number agent host lim pa normal densiti function max max max agent popul asynchron mode discuss previou section reli assumpt agent propag synchron mode present preliminari result averag network oper asynchron mode happen uneven transit delai simplifi give simpl show approach analyz shown figur transit expect random variabl ffi lim lim figur distribut number agent host approxim normal distribut horizont axi correspond number agent vertic axi correspond probabl figur simpl network uneven transit delai delai neighbor host depict number label edg hp ffi expect number agent random variabl ffi host hp hp ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi defin ffi pa ffi equat rewritten model expect side wrt random vector readili obtain equat nonneg deriv equal max kg lim mean limit exist lim limit vector equat readili shown lim max finit propag delai equat similar equat written matrix ji defin similar synchron ji ae theorem state gener case finit integ theorem ant rout algorithm asynchron expect number agent run host equal max long propag delai expect number agent host server finit bound defin varianc qa show varianc qa bound theorem valu bound max max jg readili deduc qa prove principl mathemat induct max max jg max max jg max max jg max jg max max max jg tabl summari theorem prove paper result mode hp max syn max syn hp max max max max jg proof complet qed paper analyz grow behavior behavior agent base rout algorithm theorem prove paper summar tabl subscript drop simplic found long network topolog fix number agent creat request expect covari expect number agent host server independ network oper synchron asynchron mode result provid guidelin design agent base rout comput power host server handl larg amount process refer improv perform tcp wireless depart comput texa technic report amir improv perform wireless proc acm intern conf mobil comput network pagurek mobil agent network manag ieee commun matrix outlin mcgraw appli ant system vehicl rout problem metaheurist intern confer franc luca cardelli languag distribut scope acm symposium principl program di caro dorigo mobil agent approach adapt rout technic report universit de fred dougli john ousterhout transpar process design altern implement softwar practic august intellig mobil network fault manag autom present sixth intern symposium integr network robert grai agent flexibl secur system fourth annual workshop juli garei mr johnson comput guid theori npcomplet colin david aaron kershenbaum mobil good technic ibm research research march jeremi ken fred barri roger guido van system support mobil agent intern workshop object orient oper system octob dag van fred schneider introduct distribut system technic report depart comput june eric henri norman andrew black mobil emerald system acm transact comput februari gunter danni mitsuru oshima secur model aglet ieee internet karnik anand tripathi design issu program ieee pp juli sep danni lang mitsuru program deploi java mobil agent addison peter infrastructur mobil agent fall www decemb craig tim motiv percept mechan mobil agent electron commerc australian workshop distribut artifici vol pp novemb objectspac objectspac voyag core packag technic overview technic juli joel saltz mobil program usenix winter perkin provid continu network access mobil host comput network isdn nov jame mobil internet prentic network model mobil network oper manag symposium februari tanenbaum comput prentic internetwork prentic program languag mobil code acm comput septemb agent jame mobil agent technic gener url octob rout swarm technic report system comput carleton septemb white pagurek improv ant system integr genet algorithm confer genet program white pagurek connect manag adapt agent white pagurek problem solv network intern confer system
DB/455 3 tool intellig conceptu model enrico franconi gari ng depart comput uk abstract paper present tool intellig conceptu model specif multipl eer diagram constraint complet logic reason emploi tool verifi infer implicit manifest inconsist introduct tool support conceptu design phase inform integr inform system data tool evolut part conceptu model demonstr suit develop european esprit long term research data qualiti project adopt extend conceptu data enrich aggreg interschema constraint fulli integr power descript logic reason server act background infer engin conceptu model languag support standard data enrich isa disjoint cover full definit attach entiti relat mean view express entiti relationship schema aggreg entiti multipli hierarch dimens franconi express involv entiti relationship possibl belong schema tool support multipl schema interschema constraint turn extrem support conceptu model involv singl rich schema integr design ontolog reason diagram encod singl descript logic knowledg show result deduct infer link inconsist entiti relationship theoret result dwq project correct complet reason system descript logic core express dlr logic develop implement tool eer conceptu model provabl complet infer mechan consist check deduct deriv impli link schema complet reason mean context valid deduct left infer engin hold full data model emploi richer eer exemplifi scenario section fulli support conceptu design methodolog studi dwq project consist deduct reason task plai crucial role tool store interconnect conceptu user friendli graphic interfac tool client written standard java unix window machin commun corba protocol fact descript logic server experi show handl larg integr conceptu data model nation european telecom compani interfac import export ration rose tm diagram model languag model singl extend conceptu data model adopt basic element er schema denot set object call denot set tupl made instanc entiti involv relationship entiti involv relationship particip entiti relationship repres mean uniqu assign cardin constraint limit number instanc entiti involv relationship entiti relationship properti belong predefin domain string eer model includ taxonom relat state assert entiti possibl option cover disjoint constraint interest featur extend model languag abil complet defin entiti relationship view entiti relationship rn rn en di en figur dlr semant di conceptu schema adopt view languag descript logic unari relationship basic type dlr entiti call relationship syntax rule top figur dlr entiti express built primit entiti en relationship express built primit relationship rn semant entiti express set mean relationship set object entiti relationship full boolean calculu express denot relationship ith argument select type express denot project ith argument relationship tupl cardin ith argument equat bottom figur formal defin semant dlr dlr interest decid fragment order depend dlr view express class kei type depend exist depend deal multipl schema model inform express interschema knowledg mean dlr depend state interdepend hold entiti relationship express conceptu introduc assert assum symbol schema si identifi uniqu symbol assert depend view involv symbol schema worth note integr process increment result integr schema monoton refin understand call sourc destin area code land line cell direct data figur cube telephon call show averag durat compon schema result unifi schema strongli depend singl inform sourc import case design data conceptu schema assum privileg schema global view conceptu global concept relationship reconcil abstract data necessarili complet model sourc inform schema integr sourc schema import point interrelationship sourc schema global schema interdepend sourc schema global integr schema data conceptu schema global sourc schema assert extens eer formal conceptu model aggreg includ extend conceptu data model repres structur aggreg entiti multipli hierarch dimens idea abstract conceptu cube figur full fledg entiti eer diagram aggreg entiti eer class citizen languag describ compon relationship properti compon properti aggreg build aggreg aggreg explicitli built top aggreg dimens model object logic view star relat entiti conceptu schema complet descript data model refer limit adopt formal descript aggreg includ specif valu attribut comput attribut valu compon aggreg function reason import result research dwq project identifi border extens data conceptu data model explicit aggreg function model scenario figur schema integr notic conceptu model highli iter process assum start partial schema add addit object properti object user interest model conceptu tool support design schema make explicit consequ fact model detect inconsist schema schema output model process fact explicitli implicit consequ detect reason measur qualiti factor object schema support design conceptu model process understand schema develop captur intend mean belief correct conceptu argument inconsist conceptu model sourc integr conceptu design data telecommun busi integr data sourc inform specif telephon call sourc tabl relat phone call custom compani locat call schema ambigu clear locat call sourc destin call attempt data system collect inform analysi mobil sourc schema relat global integr schema talk mobil origin destin call differenti servic entiti sourc schema assert entiti global schema entiti sourc schema entiti global schema lack inform real mean entiti sourc schema captur design assert relat relationship global schema closer sourc engin reveal design addit interschema constraint state point sourc mean underspecifi relationship denot call view defin relationship restrict point assert destin relationship fact logic impli integr sourc cell point destin point fact symptom wrong design accept reason found wrong assumpt origin relationship model sourc destin omit integr schema sourc relationship deduct hold model accept conceptu model aggreg conceptu model client schema differ conceptu model orient specif inform depend client area task client interest specif portion data specif form granular aggreg deriv inform conceptu client schema aim captur specif client demand order optim satisfi client inform treatment aggreg conceptu level conceptu model aggreg support specif adequ qualiti factor aggreg conceptu level account qualiti factor mobil call sourc destin area code land line cell direct data figur cube mobil telephon call show averag durat cube rolap data data design process conceptu schema aggreg exploit semant queri back telecom aggreg natur telephon call dimens relat origin call order averag durat figur context data aggreg make figur model aggreg mobil call cube show line fill null type mobil call figur case aggreg entiti exist mobil call origin cell point global schema refin aggreg mobil type call reason immedi entiti inconsist mean view exist data relat aggreg extend entiti relationship formal support inconsist detect shown figur aggreg sourc dimens point level deriv entiti consist fill valu mobil call acknowledg dwq special diego maurizio lenzerini sattler franz baader contribut provid idea theoret ground exploit nicola paolo implement version christoph sanchez develop initi modular translat refer franz baader ulrik sattler descript logic concret domain aggreg european confer artifici intellig page diego giusepp de maurizio daniel rosati descript logic framework inform integr intern confer principl knowledg reason page morgan diego giusepp de maurizio daniel rosati inform conceptu model reason support proc int conf cooper inform system page diego maurizio daniel nardi descript logic conceptu data model jan chomicki logic inform system catarci maurizio lenzerini repres interschema knowledg cooper inform system journal intellig cooper inform enrico franconi ulrik sattler data conceptu data model aggreg workshop design manag data enrico franz ulrik pano vassiliadi data model aggreg jark al chapter page ian ulrik stephan tobi practic reason express descript logic intern confer logic program autom reason number lectur note artifici page ian horrock fact intern workshop descript logic page maurizio yanni pano editor fundament data wareh matthia diego maurizio enrico pano yanni vassili concept base design data dwq demonstr acm sigmod intl confer manag
ML/456 6 situat control robot faculti germani zhang abstract introduc system mobil robot sole base raw vision data reli landmark artifici symbol initi learn step system train compress input data classifi situat associ behaviour situat input data gener omnidirect vision system obviat activ camera run time compress input data fed fuzzi control determin correspond actual situat situat train match control directli drive actuat desir behaviour system tight coupl input paramet space robot actuat complet free intern model map algorithm straightforward implement comput effort lower convent vision system result valid approach kei fuzzi omnidirect robot introduct convent fuzzi control frequent encount problem deal complex system dimens input space larg control process tractabl correl input desir output highli nonlinear difficult system rule case hard find preprint submit elsevi preprint singl interpol control inadequ describ global scenario control input distribut larg input rang interv issu address applic adapt system navig mobil robot environ robot extent made familiar initi train phase task determin posit orient accomplish sole base visual high input resort intern map object model attract map model build cumbersom limit rang applic human reli map manag find environ mental awar home fruit studi mechan anim question find desir place observ environ distinct kind inform gener model exist kind featur extract visual data featur relat specif floor current research ant wasp resort concept mental analogu topograph map metric navig combin snapshot pattern light repres detail reader refer capabl anim partli attribut sensor magnet sophist emul visual sensor afford easier robot system feel current state technolog accomplish task plethora sensor commonli found live organ laser infrar detector larg circular arrai ultrason symbol artifici beacon previou work navig mobil numer approach develop recent year robust accur method obviou major object approach updat intern control extern sensor input intern sensor wheel encod accur short distanc fail long run due slide orient common combin sensor standard camera vision system appli posit environ determin robot posit orient data simpl technic solut suggest artifici solut base approach robust limit industri commerci environ normal camera imag hard translat orient robot motion robot briefli review optic system approach base radio navig ultrason directli relev approach discuss navig system complex control system grow exponenti number input reduc number select express input regard desir system output statist analysi input pattern techniqu princip compon analysi hancock thorp implement navig autonom vehicl imag sequenc vehicl motion steer motion human tutor record collect train imag compress pca imag steer inform project comput eigenvector origin imag reconstruct princip steer paramet reconstruct robot task navig train path corridor imag path steer vector store base fast algorithm pattern posit orient robot calcul inform imag sequenc comput imag store resolut imag imag bank approach applic small work space base monocular camera robot system dudek zhang calcul exact robot posit room camera imag train posit constant orient imag set preprocess convent approach edg extract parallel fed neural network interpol error unknown posit small approach sensit rotat robot flexibl approach omnidirect vision system vision system global view environ acquir rotat camera simpl system deal object approach emploi omnidirect vision system group method extract inform inform process al extract edg object gener mathemat model environ interpol unknown imag perform solv linear equat system gener train imag set system al view extens system detect edg classifi colour combin colour vector similar dudek gener vector input neuron network vision base situat assess earlier work robot navig develop control input simpl proxim sensor aim differenti robot encount obstacl give weight local avoid temporarili reduc weight goal track construct heurist fuzzi rule model complet robot navig area classifi control task broken subtask perform local situat input pattern control correl classif criterion physic neighbourhood set distinct featur learn situat robot posit classifi area fine local control special train fig posit classif situat situat situat situat global scene absolut posit local scene local control local control local control local control fig subdivid global scene local control problem reduc input complex sensor input case raw vision gener scalabl situat classifi develop fuzzi cluster appli fuzzi method directli sequenc origin imag sequenc featur project origin imag input dimens lower exist practic problem dimens eigenspac loss inform rise ambigu complex situat separ dimens featur space select great uniqu classifi desir comput time cluster calcul afford find cluster coher regard desir output approach output relat featur improv variant pca reduc high dimens input space method work observ process constrain low varianc scenario input pattern bear similar global scenario meet suggest appli control scheme complex raw input visual reduc compress techniqu fed situat steer control control architectur appli autonom mobil robot handl complex fuzzi control implement architectur report system make sensor data vision data complex algorithm extract geometr featur classifi situat vision data problem pca pca appli data compress pattern recognit techniqu appli reduc dimens input space gener control input space variabl xm vari sampl input data scatter input space compress ratio low observ high process run input vector vari gradual observ meet imag local scenario robot environ robot move case input vector similar observ input data highli correl assum input vector made random variabl xm origin process case stack imag vector element result pixel row pixel line dimens expect covari matrix vector comput eigenvalu eigenvector comput solv eigenvalu eigenvector posit eigenvalu posit extract structur inform set input variabl xm equal isol largest eigenvalu eigenvector defin transform matrix reduc dimens project subspac span project illustr left part fig subspac span featur easili appli function case fuzzi cover linguist part fig pattern code pattern match rule fire weight vector princip compon output relat rule input vector output nm fig model control depend measur data similar observ sensor imag small number eigenvector provid good summari input variabl dimens determin depend discrimin accuraci process step comput complex afford eigenvector suppli inform indic origin input space determin experi pure heurist automat method subject studi eigenvector covari matrix effici comput perceptron approach input data vector multipli eigenvector point eigenspac sequenc continu input data transform manifold eigenspac fig show imag sequenc fig project imag eigenspac fig sampl imag motion wall output relat featur outlin pca suitabl approach dimens reduct dimens origin imag reconstruct resolut magnitud eigenvalu correspond variabl random problem occur input variabl varianc low control process traffic scene small light green red salient larg imag car pass pure pca appli input data larg number eigenvector repres control input variabl solut problem set vector directli correl input output eigenvector input data featur affect output call output relat featur fig project imag manifold eigenspac base perceptron extract train hebbian learn rule assum train data denot weight vector train denot network output unlik varianc input data weight vector learn rule weight vector direct differ desir real valu output requir input desir output case absolut posit robot coordin element weight vector modifi learn rate calcul weight denot approach similar yuill al comput begin weight vector calcul input data project compon input ly parallel calcul compon subtract input element ij vector adapt ij kj unlik eigenvector weight vector orthogon reconstruct origin data unambigu learn effici princip compon account relat model complex benefit find determin small number featur isol linear transform rest model perform fuzzi control fundament situat global eigenspac project project imag fall situat form specif manifold dimens eigenspac larg manifold easi situat distinguish simpli identifi point eigenspac imag project fig illustr process simplifi manner repres match situat imag simpli defin euclidean distanc manifold situat differenti situat fig dimens shown figur situat situat situat fig view robot camera fig princip compon princip compon princip compon fig situat manifold eigenspac manifold repres part situat shown fig transform omnidirect vision data identifi situat context develop omnidirect vision system mobil robot shown fig complet view environ fulli global redund separ overlap part part input control view area camera divid multipl section size found view area ffi practic case suffici uniqu robot sector cover angl ffi sector independ transform object arbitrari colour influenc sector sector combin pair denot cover view area ffi vector comput combin view area project vector input fuzzi control interpol sector unexpect object chang environ detect sector discard interpol fig mobil robot omnidirect camera ab ac bc transform scale fig sector construct situat classif global eigenspac global eigenspac approach repres situat eigenvector situat manifold store project global eigenspac search manifold find nearest neighbour classifi varianc project respect vector ffl robot locat situat train project deliv varianc ffl robot locat project differ situat smallest varianc identifi correct ambigu percept correct situat classif evalu probabilist colour easili ad robust classif applic section describ hardwar implement system softwar implement show number real imag wall run robot setup vision system consist camera conic mirror polish complet setup shown fig test environ consist miniatur size wall coat textur wall paper includ window door typic problem investig situat shown fig autom process collect train infrar proxim sensor guid robot wall read motor encod reliabl short distanc singl motion conjunct proxim sensor input data train fuzzi control higher level task perform standard pentium pc run linux pc robot commun interfac imag acquir implement robot start arbitrari posit room move straightforward sensor read presenc wall wall record initi situat robot detect end turn parallel wall perpendicular mm imag vision system posit suppli wheel encod record enhanc robust system motion uncertainti slight robot rotat posit consecut learn effect rotat camera input make input pattern prone illumin imag interv reduc sensit bright fluctuat concentr imag convert planar imag standard tangent transform convert imag cover rang slice area reduc dimens input set averag imag situat subtract imag process illustr fig fig show control architectur implement robot subsect sector prepar project weight vector extract input fuzzi vector record intern pair train fuzzi control fig show sequenc raw imag assign situat vector possess dimens origin convert imag fig illustr vector addit averag rotat adapt model interpol sampl train fuzzi control fuzzi control construct model model ideal implement cmac architectur imag corner conic imag complet scene tangent transform imag fig imag transform model defin linguist term input variabl basi function output variabl singleton requir fewer paramet set function output comput simpl interpol process transpar explain note main reason fuzzi control ffl global minimum squar error function found partit input space project fuzzi control fuzzi control project fuzzi control fuzzi control imag acquisit minu sector situat identif multiplex multiplex situat situat situat index match fig visual control ffl learn gradient descent easi implement enabl rapid converg run time learn input data project map output variabl base fuzzi control fig fuzzi gener gradient descent learn perform control enhanc shape basi function fuzzi fig principl move fuzzi set direct data point maximum error fuzzi control approach reconstruct robot maximum error test data invari reduc maxim test error pca approach ten time larger control output interconnect multiplex address situat index implement system achiev refresh rate cycl imag process hardwar pentium discuss show approach base visual arbitrari environ sole input feasibl environ compar typic live room mobil robot find potenti applic servic job develop situat situat situat situat fig imag sequenc train situat situat situat situat situat fig vector addit averag imag situat situat situat situat fig vector addit averag imag approach aim achiev scalabl approach scale arbitrarili movement area situat learn cover area comput time requir memori input input input input fig input variabl model basi function linear number situat geometr model addit inform environ usag sophist geometr direct map lead reduct comput cost method convent robot vision algorithm base geometr featur adapt specif environ method gener applic environ includ kind object low cost hardwar compon standard product ratio good comparison system special hardwar approach appli larg set control problem complex system successfulli grasp manipul limit singl fuzzi control system input control scheme comput complex grow polynomi investig improv moment situat classifi physic group desir futur learn system capabl automat divid larg number sequenc situat interpol requir maximum memori issu size visual area receiv good interpol result amount memori local control directli relat size featur input imag small imag major distinct featur lost automat adapt size import object feasibl replac crisp situat multiplex control combin approach mobil robot task object recognit track acknowledg contribut anonym review greatli improv qualiti paper gratefulli acknowledg refer albu approach manipul model articul control transact journal dynam system measur arkin integr world knowledg reactiv navig journal robot autonom hierarch approach design approxim reason base control dynam physic system confer uncertainti artifici page colour inform omnidirect percept system autonom robot pp ja hancock ce eigenvector land vehicl imag dudek zhang robot explicit object model ieee intern confer robot page luo fuzzi behaviour fusion reactiv control autonom mobil ieee intern confer fuzzi page soft comput prentic inou visual navig rout ieee intern confer robot page track visual ieee intern confer robot page oja subspac method pattern recognit research studi fuzzi logic autonom robot navig soft comput page optim principl learn advanc neural inform process system touretzki morgan san harvei navig journal gener environ map obstacl avoid omnidirect imag sensor conic mirror ieee confer comput vision pattern page yen fuzzi logic base extens command fusion method mobil robot navig ieee transact man al dm ds cohen develop orient select cortic cell rule biolog modular design fuzzi control integr delib reactiv strategi ieee intern confer robot zhang construct fuzzi control model principl applic intern journal intellig
DB/457 3 submit pod paper effici comput tempor aggreg rang predic zhang alexand vassili tsotra gunopulo bernhard seeger extend abstract tempor aggreg queri import costli oper applic maintain data tempor due larg volum perform improv tempor aggreg queri critic paper examin techniqu comput tempor aggreg includ predic tempor concentr count avg aggreg problem handl arbitrari kei previou method separ index kei rang approach base index structur call incorpor featur handl arbitrari tempor count avg queri analyz perform approach present result show effici introduct rapid histor data data tempor aggreg predomin oper data analysi comput tempor aggreg significantli intric problem tradit aggreg time dimens tupl accompani time interv attribut valu valid tupl attribut affect aggreg comput instant includ tupl time interv approach recent address tempor aggreg queri previou research consid scalar tempor tempor aggreg comput kei rang relat effici previou approach addit restrict tempor aggreg time interv address gener aggreg problem tempor aggreg restrict time interv kei rang histor larg queri practic oper enabl manag focu aggreg paper concentr count avg aggreg reduc queri queri queri index structur call solv queri structur incorpor featur maintain comput queri effici comput capac disk page number tupl updat increment tupl updat updat number kei insert space bound log compar perform approach singl index retriev tupl satisfi comput aggreg retriev tupl choic index tradit index tempor index optim solv queri comput scienc ca fachbereich mathematik philipp universitat germani comput scienc ca comput scienc ca fachbereich mathematik philipp universitat germani tupl kei rang aliv time initi result show approach superior perform comput queri small space overhead note tempor aggreg queri involv arbitrari kei rang scalar method applic obviou approach separ kei rang effici larg space requir rest paper organ section discuss background previou work problem reduct address section index introduc analyz section section discuss result comparison section present open problem research background describ previou research tempor aggreg queri includ discuss tempor data model assum work provid short descript previou work tempor aggreg criteria measur effici method support tempor aggreg method maintain aggreg increment tupl cost insert tupl independ tupl kei length tupl interv method method support instantan cumul tempor aggreg result instantan tempor aggreg time instant comput tupl valid instant cumul tempor aggreg instant comput tupl interv intersect interv window offset present approach step requir full scan interv aggreg result tupl found tupl updat valu result tupl affect approach comput tempor aggreg number result tupl practic note approach comput full scan make ineffici tree segment tree increment comput tempor aggreg structur unbalanc impli time comput scalar tempor aggreg present variant aggreg base base worst case behavior remain introduc parallel extens approach present present improv balanc tree method resid semin work scalar tempor aggreg comput index introduc work draw discuss properti detail refer incorpor properti segment tree segment tree featur ensur index updat effici tupl long interv insert delet properti make structur balanc conceptu index time domain aggreg tupl interior tree node record repres contigu time interv special record comput aggreg interv interv interior leaf node interv node interv node advantag instantan tempor aggreg comput search accumul aggreg tree node visit result fast aggreg comput note special algorithm present merg leaf interv equal aggreg valu reduc height tree aggreg comput advantag fast updat logarithm insert tupl interv attribut direct root node root record time interv fulli updat kind updat depend aggreg maintain interv partial root insert root record physic delet tupl delet repres insert tupl neg attribut support cumul count avg aggreg arbitrari window offset maintain aggreg record valid maintain aggreg record valid strict time comput aggreg approach comput aggreg end interv add aggreg record interv strictli end final subtract aggreg record interv strictli begin note special extens support min max tempor data model assum tupl store record time interv attribut aggreg follow tempor normal form specifi tupl equal kei intersect interv loss assum kei time instant posit integ kei space time space time interv interv start end interv reduc time instant end start kei rang rang form low high rang reduc kei high low rang lower record rec aliv time rectangl space consist kei rang time interv record rectangl intersect tempor import distinguish time model tempor applic tempor literatur time dimens kind updat support tempor data depend support environ tupl insert interv fulli tupl ad delet order tupl delet record physic remov design environ environ assum tupl updat arriv order time tupl insert time record interv initi variabl repres current time variabl store tupl delet physic logic tupl delet time record interv end updat record maintain queri delet environ chang past model maintain histori abil chang past case error discov record inform paper assum model feel practic scenario applic arriv time order number erron tupl data smaller correct correct separ error import aggreg valu larg number tupl assum model major influenc index support aggreg queri updat arriv index order partial persist data structur call persist updat creat version data structur previou version retain access version structur call partial persist impli updat appli latest version data creat linear version order partial persist fit nice notion version number replac order sequenc time instant made partial persist approach influenc structur make partial persist graph maintain evolut time access specif time interv partit space rectangl rectangl data page tupl record store data page rectangl tupl kei intersect interv page rectangl creat record insert page page overflow page aliv record copi page kind copi base number aliv record overflow page time split simpli copi aliv record page aliv record time split kei split distribut page median kei attribut data record insert time order import featur minimum kei densiti page time page page record aliv linear page capac kei densiti page drop threshold aliv record page sibl page copi page avoid frequent number record page lower bound higher bound optim solv linear tupl kei rang aliv time queri answer size find answer problem reduct avg sum focu sum count reduc queri subqueri definit tempor relat kei time queri find aggreg tupl kei interv definit tempor relat kei time queri find aggreg tupl kei end time equal tupl end aliv strictli theorem solv queri sum count reduc solv queri proof sum proof discuss hold count queri rectangl tupl kei sum valu tupl interv intersect equal sum valu tupl aliv tupl aliv strictli minu tupl aliv strictli end end tupl aliv comput sum valu tupl kei minu sum tupl record kei end end queri reduc queri queri order support present access method combin index index support queri support queri equat aggreg queri transform point queri indic remain show insert updat tempor tupl repres indic insert tupl affect index insert tupl kei time index add point denot oper index insert hk logic delet tupl affect indic logic delet tupl time index subtract add point denot insert hk logic delet transform insert add point rectangl denot hk time kei time kei time kei figur transform insert delet oper indic implement structur structur effici insert oper kei time add valu point rectangl effici point queri kei time find point focu design structur assum time dimens fix time instant focu kei dimens structur logic store kei kei space kei adjac kei store kei combin kei rang store set kei rang union kei rang insert oper updat store rang intersect smaller rang updat goal structur insert time independ scenario remind support effici insert time interv independ long time interv kei requir effici insert satisfi requir effici point queri effici find point found solut fix time instant find solut time natur extens make partial persist call seri time instant insert oper point queri involv time direct store separ time instant featur appli reduc space logic set time nice emb set space linear satisfi requir set structur design index support effici insert kei time add valu point rectangl point kei time find point basic idea direct acycl graph node result increment insert initi empti number root node partit time space root stand disjoint time interv union interv cover time space point queri time instant direct root node time interv refer root node maintain structur call implement type page index page leaf size index page router point child leaf page assum leaf page index page maximum capac record leaf record store leaf form valuei interv rectangl space aggreg point rectangl index record store index form compar leaf router point child page page union rang record page time interv time page creat time page copi page aliv copi properti show relationship record properti record page rectangl union equal page rectangl assum insert time insert aliv page affect aliv record page aliv page aliv record due properti kei rang record intersect union equal defin term aliv record kei record kei rang intersect record kei rang record record kei rang lower record kei record record index call child page point record child page record rectangl kei rang time insert algorithm modifi assum insert kei time ti page record split vertic ad newli copi insert algorithm insert child leaf record split horizont ad insert page low occur aliv record page copi start time copi record chang current insert time call copi oper time split time newli gener page full subsequ insert page trigger time split result space cost block insert avoid requir time block constant call strong factor call requir strong condit newli gener page due time split strong overflow kei split kei record distribut evenli page optim section discuss optim techniqu appli aggreg page split record page insert introduc optim techniqu ensur record split page idea split record smallest kei rang record data record index split physic add record refer oper logic split order deliv correct modifi point queri algorithm point queri ti aggreg valu record point path root record rec page comput sum record interv rang lower optim affect procedur kei split page actual aliv record comput sum valu aliv record record smaller kei sum valu record page lower rang ad lowest record page higher rang record merg record applic compact record page lead space leaf record page merg horizont vertic time merg place kei merg place time merg kei merg figur time merg kei merg record index record merg similarli differ merg index record merg leaf record index record merg point child page page insert time instant updat index effect insert algorithm process updat time introduc spare index result page creat time subsequ insert page time split kei page index record point physic remov index optim save assum root leaf record insert record split insert record split initi insert insert lead overflow insert strong overflow lead kei split insert root insert figur insert insert overflow time split copi aliv record page page satisfi strong regist root insert complet strong overflow kei split place distribut record evenli page note record page higher rang modifi tree insert shown figur insert aliv root record insert child page record record split result shown figur insert lead time merg time merg figur omit due space limit complex analysi assum record merg page optim appli techniqu improv bound present hold techniqu due space proof lemma theorem appendix discuss impact strong factor due strong aliv record page creat order greater page max number page gener lemma lemma page time split kei split gener page page creat effect insert addit record logic delet amount addit logic delet bound shown lemma lemma insert aliv page overflow introduc addit logic delet lemma time page aliv record aliv number kei insert lemma upper bound height lemma upper bound height dlog insert theorem state insert point queri cost space theorem number disk page access insert point queri space complex log corollari theorem summar perform maintain comput aggreg corollari count queri answer cost space complex log queri time due time identifi root graph search faster root creat evolut case queri time reduc perform result present result compar perform approach naiv approach tempor record tradit tempor algorithm implement gnu compil program run sun server machin processor solari main memori size mb compar perform algorithm estim run time estim commonli obtain multipli number averag disk page read access ad measur cpu time practic measur cpu cost ad amount time spent user system mode return system call assum disk random random disk access averag lru buffer default buffer size page strong factor dataset initi creat softwar transform add record kei studi effect uniformli distribut distribut kei dataset million record attribut record byte long kei space time space dataset uniqu kei averag record kei test dataset interv interv figur show space requir dataset uniformli distribut kei interv approach time space singl worst case space overhead observ similar behavior updat time na ve vari result size vari ratio time faster na ve vari page total time figur space queri perform comparison queri perform measur execut time randomli gener queri rectangl fix rectangl shape size shape queri rectangl length queri kei rang divid length kei space length queri time interv divid length time space queri rectangl size percentag area queri rectangl space figur show faster approach queri larger qr advantag approach queri rectangl time faster naiv queri perform independ naiv approach worst case scan dataset figur compar queri perform space buffer size approach superior tempor aggreg predomin oper analyz histor data paper examin tempor aggreg queri presenc predic queri manag focu tupl group kei rang time interv index increment maintain effici comput aggreg consid count avg fast queri time updat small space overhead initi perform result show benefit solut interest problem optim perform factor support tempor aggreg queri rang extend work spatiotempor aggreg refer unifi approach index spatial proc pp seeger asymptot optim vldb journal pp schneider effici robust access method point proc acm pp moon algorithm comput tempor proc pp consensu glossari tempor concept februari tempor research jajodia isbn pp kline tempor proc pp kline current august tsotra access method bitempor ieee tkde pp lomet method proc acm pp lopez algorithm larg tempor proc pp preparata comput segev tempor data model relat proc int conf statist scientif manag pp histor aggreg master wayn state ye kean tempor aggreg proc int conf pp yang comput mainten tempor proc insert queri algorithm appendix formal describ insert point queri algorithm insert algorithm omit detail optim section algorithm kei time find root page aliv return algorithm page kei time record rec rec aliv endif endfor leaf page return find record rec rectangl return endif algorithm kei time find path node partli cover record level latest read page disk memori index page record level endwhil handl leaf page space record split split endif copi aliv leaf record record split add record endif creat leaf page record store refer endif index page record similar leaf page omit endif handl page record level space empti insert record endif split record copi aliv record add record copi buffer creat index page record store refer endif endfor decid creat root page empti creat root page record endif lemma theorem proof proof lemma page time split kei split gener leaf page max number aliv record copi max number newli gener page lemma true child page index page max number aliv record copi max number newli gener page proof lemma insert aliv page overflow introduc addit logic reason logic delet leaf record logic delet record record index logic child page time record logic logic delet focu addit leaf addit record lemma correct leaf page index addit split record time split kei child page maximum number addit split record maximum number addit split child page total addit proof lemma time page aliv record aliv longest successor path successor root path kei split result kei split occur path number record bf bf number addit smaller number time record aliv record aliv copi strong overflow time number aliv record proof lemma upper bound height dlog tree time instant lifespan tree root kei insert leaf record aliv leaf page aliv record aliv leaf page aliv mean index record aliv point page level index page aliv argument true level page aliv dlog level proof theorem number disk page access insert point queri space complex log examin worst case insert cost insert oper tree latest root page leaf requir constant number node path tree height dlog insert examin cost point queri root page aliv queri time instant answer point queri worst case root extra locat root root page insert overflow root page locat root worst case sum point queri worst case examin worst case space complex total number occupi slot record copi consid occupi show insert creat occupi slot partit occupi slot occupi slot creat copi exist occupi rest set insert creat slot set page insert overflow page insert page creat overflow introduc occupi slot set amort occupi slot insert insert creat amort copi slot page insert insert creat slot set sum insert creat occupi slot insert total number occupi slot log minimum occup page page occupi slot root node minimum occup total number page occupi log space occupi space occupi add space log
HCI/458 4 plai research entertain innov sweden abstract short time research group plai establish effect work creativ approach research inform technolog combin strong focu achiev result young research group time exist averag ag present plai challeng opportun face challeng build credibl basi research academ opportun contribut innov result research commun industri partner keyword hci research futur european design introduct perform excit research inform assur result good small consist inexperienc small countri tradit compet arena legion intern research challeng face plai research group earli succe long success give hope track opportun present result varieti includ confer multimedia siggraph cscw chi uist ieee comput confer includ iswc addit venu huc journal person technolog give flavor plai research group lar erik holmquist appli research art technolog interact institut institut box sweden motiv maintain qualiti credibl bore histori plai research group form januari research institut sweden aim perform innov research collabor local industri partner august contest plai chosen studio interact nation research institut extens fund govern industri part interact institut give opportun move fund project develop strategi chosen research theme institut entertain innov work receiv dedic fund pursu research approach plai wai comput make life fun hope discov approach fundament part method human factor field primari focu lie user evalu empir studi result leav lab real virtual prototyp meant situat peopl found walk extra demo stage prototyp good extrem reward extrem hard innov mean glanc clear make doubli import theori practic leav demo lab relationship activ interest innov interact initi consid useless graphic user interfac long consid practic import uncov interest easili explain research big part live peopl plai vital part develop comput comput game receiv studi scandinavian research commun art entertain import argu research start treat stimul thought area seri intern futur provid opportun specul futur entertain technolog structur practic approach research mean concept result short time make unusu wai adopt game handheld video game offer surprisingli advanc featur low price equip game boi radio portabl awar devic group small wear comput sampl research project displai strategi small comput devic mobil phone design effect user interfac small devic grow plai activ area dai notabl result web browser small termin project attempt make electron exist modern workplac endless stream web electron document fill local pick transform recombin text unexpect project result public place goal provid subtl reflect local activ provid inspir unexpect combin thought explor technolog reader creat link physic object virtual inform barcod rare barcod link url barcod easili print standard user easili augment object composit group alan kai remark attract mit media lab collid technolog collid continu peopl group peopl plai grown phd student informat comput scienc stabil interact institut recent widen scope bring member background includ fine art music composit group member special topic typic ber relev field comput informat fine strong interest field electr music accompani academ wide rang interest vital factor composit group manag project meet deadlin project plai highli origin concept implement test publish research paper wide varieti member tend involv project point big meet futur work project outlin result work plan intend strict serv establish import mileston goal turn lead import effect solut problem track project deadlin larg wall chart show project deadlin result academ due paper tick review result ad entri found good displai work plan found satisfact paper deliv write futur plai excit point fund interact institut bring stabil time free plan month ahead sketch major project area entertain innov hope refer web browser small termin proc acm uist acm media lab le condit creativ research ieee le entertain studio swedish interact institut fun informat falk support group collabor awar devic journal person platform public wearabl devic proc ieee iswc ieee le physic object www bookmark ext abstract chi acm proc handheld ubiquit comp
AI/459 2 survei knowledg compil marco francesco donini dipartimento di informatica sistemistica universit di roma itali knowledg compil ai techniqu address demand reason problem paper survei recent result knowledg compil proposit knowledg base defin limit scope survei exact approxim knowledg compil method includ discuss compil knowledg base knowledg effici reason introduct knowledg base idea agent store knowledg typic logic formal knowledg base specif algorithm extract inform implicitli store deduct logic formal demand comput point view problem logic comput scientist high comput complex knowledg base queri repres check queri logic entail knowledg base prototyp problem reason repres knowledg formula proposit sound complet procedur logic face problem requir exponenti time solv knowledg compil techniqu address comput difficulti central observ kr reason input problem conceptu split knowledg base queri knowledg base modifi knowledg base answer queri idea knowledg compil split queri answer knowledg base obtain data structur phase call queri answer output phase phase call goal preprocess make reason easier respect reason case preprocess effort spent preprocess phase pai comput cost amort answer queri knowledg compil made cope intract queri answer knowledg base orthogon techniqu languag restrict theori approxim languag knowledg queri form subset entir languag syntact tractabl knowledg compil restrict languag clausal form queri languag restrict knowledg compil compil horn proposit knowledg base theori part entail queri correctli answer correctli answer queri correspond tractabl entail problem theori approxim combin knowledg compil proposit knowledg base kb horn formula model subset superset model kb issu relat knowledg discuss ai literatur knowledg process make reason tractabl preprocess default lose sound ai commun issn io press marco francesco donini survei knowledg compil overview paper goal paper survei recent advanc knowledg exact approxim knowledg compil put emphasi theoret briefli comment analyz compil proposit knowledg mention theoret studi show result compil unaccept larg size exponenti size origin knowledg base section introduc main summar comment theoret result limit knowledg compil knowledg base make compil method give reason result class knowledg base section report exact method compil proposit knowledg evalu exponenti growth size compil knowledg base lead research explor possibl compil knowledg base data structur approxim initi knowledg give complet reason section survei approxim compil method knowledg base knowledg compil restrict reason typic case compil knowledg base monoton reason knowledg base demand reason monoton analyz compil knowledg base classic section form knowledg compil knowledg compil case reason task reason context horn proposit formula goal optim knowledg minim size techniqu knowledg compil knowledg base yield logic prime result reason part yield data structur set model structur complex section compil yield knowledg compil knowledg base support infer algorithm section briefli address relat field fix paramet tractabl final drawn section knowledg terminolog paper assum reader familiar basic concept proposit logic autom theorem prove introduct paper interchang knowledg base set formula formula made conjunct formula set denot size knowledg base number distinct occurr proposit paper assum reader basic notion comput complex refer introduct field complex refer complex class ph relat np conjectur strict preprocess common comput scienc compil optim object code perform simpl simplifi exchang preprocess graph obtain data structur fast node reachabl test idea time spent preprocess compil code gain time process data comput scienc preprocess problem solvabl polynomi node reachabl test graph studi techniqu context ai kr reason problem complex comput size output reason part introduc simpl reason problem run liter marco francesco donini survei knowledg compil problem mean question expect finit set boolean proposit formula conjunct normal form liter built variabl true model model entail instanc specifi fl singl liter liter entail point view section usual present problem pair instanc describ part instanc fix split instanc fix vari part repres knowledg assum remain stabl long period make preprocess queri pose knowledg repres liter instanc terminolog address preprocess fix part part preprocess problem compil proposit formula cnf vari part part preprocess liter fl tripl consist question ultim fix vari part goal knowledg compil make onlin reason easier respect set liter entail reason expect solv time polynomi jt jlj matter record liter occur size tabl cardin alphabet tabl consult time time achiev custom data build tabl amount solv instanc concern comput burden desiderata preprocess phase output data structur size grow polynomi respect size mention fix part knowledg reason time polynomi size data structur size vari part section show import requir achiev time desiderata give guidelin defin scope knowledg compil preprocess facilit answer class queri compil process substanti amount termin lead inform definit knowledg knowledg compil deal method process knowledg base output preprocess answer class queri preprocess finit amount time note definit exclud techniqu theorem prove knowledg compil lemmata theorem prover stop finit amount time limit scope survei proposit knowledg compil chang complex class queri answer output logic formula section form compil bound survei actual method knowledg discuss subsect theoret limit knowledg compil appli compil marco francesco donini survei knowledg compil fig compil problem theoret limit knowledg compil recal distinct fix vari part definit problem definit problem compil exist polynomi algorithm instanc data structur jd instanc call return iff vi instanc requir time jd figur pictori descript definit data structur repres output offlin requir occupi space polynomi size fix algorithm repres reason requir sound requir run polynomi time input definit space queri size polynomi jt suffici problem compil condit true problem ffi conjunct ffi built finit set liter version conjunct size tabl mention context suffic set fl iff problem obviou defin compil method comput conjunct prime implic logic fl iff check time proven exist polynomi definit number prime implic formula exponenti size alphabet section dont polynomi consequ preprocess prove compil refer interest comment import item definit fact compil knowledg base remain size polynomi size origin knowledg base drop replac properti assert algorithm requir time polynomi jvj jf size origin knowledg base size store data structur result test fl fl data structur size exponenti number clausal queri answer time polynomi size origin knowledg base binari search problem fl trivial compil definit problem definit polynomi properti condit set vari part input size jf fix part polynomi properti mention definit mean compil space exist encod problem data structur extract inform polynomi time compil condit result give interest inform recent shown pierr marqui remark marco francesco donini survei knowledg compil polynomi hierarchi event strong np wide conjectur similar result easili proven gener problem proposit formula problem tautolog detect polynomi time compil empti knowledg base give formal proof problem compil difficult prove compil impli np suffici condit compil shown typic situat deal parallel tradit notion prove intract prove mean problem algorithm provid np sum prove compil exhibit polynomi definit proven exact compil exact compil method find theorem initi knowledg base classifi exact knowledg compil main prime implic prime implic add knowledg base prime implic make deduct unit resolut prime implic respect tractabl theori prime implic prime implic simplest exact knowledg compil stem fact knowledg base normal form conjunct disjunct normal cnf consequ easili comput dnf implic knowledg base kb conjunct liter kb complementari liter model knowledg base implic variabl posit liter assign neg liter conveni conjunct liter set liter make altern view definit prime implic definit prime implic knowledg base kb implic kb implic make disjunct prime implic knowledg base obtain dnf formula queri kb iff prime implic cnf conjunct amount verifi intersect prime implic kb entail cnf queri comput time polynomi size set prime implic size queri dual method base knowledg compil method base cnf formula implic knowledg base kb disjunct liter kb complementari liter set liter model set model kb implic kb liter implic hit set model knowledg base minim call prime minim respect set hit set compil method target speed queri answer reli prime implic knowledg base definit prime implic knowledg base kb implic kb implic make conjunct prime implic knowledg base obtain cnf formula kb cnf queri kb iff prime implic kb set liter entail cnf queri comput time polynomi size set prime implic size queri prime implic cnf knowledg base gener repeatedli resolv marco francesco donini survei knowledg compil knowledg base resolv discard implic prime method requir resolut perform research algorithm comput prime implic start long time algorithm found reli assumpt knowledg base cnf gener algorithm comput prime implic requir knowledg base conjunct dnf formula theoret number prime implic prime implic knowledg base variabl shown exponenti worst case crawford made studi number implic prime implic cnf knowledg base valu ratio explain import briefli recal recent result knowledg compil ratio studi experi difficulti solv satisfi problem found knowledg base roughli classifi type critic knowledg base easili satisfi knowledg base call critic refut involv part easili found knowledg base call critic hard find satisfi truth refut knowledg base call probabl satisfi back knowledg crawford found size knowledg base number prime implic length show peak correspond knowledg base experi suggest knowledg base benchmark test knowledg compil method base prime implic method gener prime implic adapt comput prime implic method comput prime implic base variant procedur dp procedur test satisfi cnf formula output truth assign set liter satisfi formula set liter implic formula dp procedur search eventu produc prime implic select test method knowledg base dechter rish add implic cnf knowledg base perform resolut base order variabl gener model knowledg base time linear compil knowledg base compil method facilit model gener queri answer compil number prime implic exponenti del val enhanc method prime implic preliminari aspect show intuit advantag method previou subsect entail cnf queri knowledg base check queri prime implic check form definit recal unit resolut form resolut resolv singl liter refut found unit resolut negat queri yield set negat unit resolut obtain empti prime implic made subset liter unit resolut simpl set substitut check unit resolut prime subset unit resolut implic obtain refut polynomi time size initi method turn problem problem solvabl polynomi time respect size formula produc preprocess marco francesco donini survei knowledg compil del val filter prime implic reconstruct unit resolut onlin phase recal algorithm find implic cnf knowledg base work perform repeat resolut prime implic del val method merg resolv resolv merg resolv perform resolut liter resolv ident flg intersect defin redund deriv perform form unit resolut call chain made knowledg base constitut rule horn merg resolv give approach knowledg merg resolv unit unit resolut deriv unit resolut yield resolv unit deriv unit resolut case redund respect unit compil knowledg base del val case compil discard exponenti number prime favor comparison prime implic method benchmark problem theorem prove show adapt algorithm find prime implic dramat reduc number prime size compil knowledg base choic good algorithm gener prime implic crucial feasibl compil limit del val method appli cnf knowledg filter condit prime implic deduct compil knowledg base base resolut theori prime implic refin method present exact compil base prime implic marqui start observ method base transform problem kb involv entir knowledg local test involv prime time enhanc local test complex polynomialtim definit theori prime implic knowledg base kb respect theori kb kb note empti knowledg base obtain definit prime implic theori prime implic extend prime implic set test prime implic theori cnf queri kb iff theori prime implic kb respect fcg empti usual properti prime implic obtain observ check fcg liter kei point deduct theori perform horn entail cnf queri comput time polynomi size set theori prime implic check primal polynomi time marqui suggest good candid set horn set binari subset kb entail exampl number theori prime implic exponenti smaller number del val filter prime favor comparison benchmark problem del val method marqui give algorithm comput theori prime modif compil algorithm base binari diagram initi knowledg base prime implic kb reduc compil shown experi marco francesco donini survei knowledg compil approxim compil section make reason effici theoret result basic problem kr polynomi intract logic entail proposit compil mention section kr approach address comput hard reason languag restrict theori approxim approach achiev tractabl reason problem distinct part set knowledg languag restrict restrict languag repres knowledg fix vari formal interest case result problem compil theori approxim give sound complet answer origin reason problem solv reason inform preserv inform lose sound complet reason part goal fast reason languag restrict approach consid knowledg compil set theori approxim approach introduc analog optim approxim solut common approxim version optim problem minimum number number optim kr deal numer obviou metric answer logic entail problem notion approxim answer entail problem ground semant basi approxim knowledg compil central idea answer queri compil knowledg base unsound incomplet answer approxim side correct answer correct fact answer approxim correct side case aim comput resourc case approxim quick case consult slower procedur approxim knowledg base kb sound queri kb case call upper bound kb observ ub kb iff kb hold approxim knowledg base kb complet queri kb call lower bound kb hold anytim version exact method note method exact compil shown section stop approxim knowledg base method comput implic yield lower queri impli comput implic kb method base del val marqui yield upper bound stop complet comput implic impli queri kb horn approxim origin method approxim knowledg compil selman kautz context proposit knowledg extend languag basic idea method compil knowledg base formula belong syntact class infer proposit formula compil horn fl answer time exist wai compil case compil formula satisfi relat denot set model marco francesco donini survei knowledg compil reason call horn lb knowledg base formula lb man woman person horn lb form compil dual compil version horn formula satisfi relat call horn ub return previou formula ub horn ub selman kautz notic lb previou horn lb approxim ae ae lead notion horn greatest lower bound formula horn formula horn formula hold ae previou horn argument horn upper person horn ub ae ae approxim horn upper bound formula horn formula lub lub horn formula hold ae lub horn lub selman kautz approxim infer respect proposit formula horn lub infer unsound spend time gener infer procedur determin answer directli origin formula gener infer procedur approxim prune search space basic idea extend polynomialtim target languag research investig comput properti horn compil compil knowledg base definit set basic mean polynomi refer polynomi size output preprocess part mandatori give polynomi onlin reason polynomi relax requir algorithm make preprocess fix part hope residu problem matter question wide reason find attempt formula logic formula classic logic relat compil entail problem proposit logic complet reason problem classic proposit logic typic studi subject gener point similar rel notion compil definit formula translat proposit formula polynomi size section circumscript section default logic section belief section circumscript circumscript proposit formula defin notion minim model set letter assign true minim respect set simpl definit enrich wai problem check fl complet possibl translat formula size polynomi jt shown impli polynomi hierarchi definit implic set model exist iff np nc impli marco francesco donini survei knowledg compil polynomi hierarchi level set theorem exist iff np impli polynomi hierarchi level impli paper gelfond al consid paper show compil circumscript knowledg base proposit logic show knowledg base kb interpret circumscript express interpret proposit logic ad kb neg true minim model call result extend gener close world assumpt kb neg fl true minim model tg knowledg compil point view minim ad worst case compil output exponenti number minim nerod al compil interpret circumscript find minim model mix integ linear program comput subset minim model minim maxim respect set answer posit neg queri comput answer queri directli comput compil circumscript directli data structur minim parallel priorit circumscript consid field investig relat knowledg compil search case circumscript circumscript formula gener research find class formula circumscript method find formula method work proposit method knowledg compil default logic proposit default theori pair collect special infer rule call set proposit formula semant default theori base notion state world knowledg base extens deduct close set formula maxim set default rule appli appli default rule lead default theori extens typic infer problem skeptic default prove formula extens problem possibl compil proposit formula size polynomi jdj jw limit similar circumscript prove dechter show compil default theori proposit default extens model proposit formula point class default theori compil polynomi time polynomi space prove class theori credul default reason skeptic applic method context disjunct logic program found belief belief evolut state knowledg set belief chang inform research attempt defin formal belief subject question set repres proposit theori point inform proposit formula infer reason knowledg logic consequ theori formula formal belief literatur start proposit knowledg reason requir knowledg base express proposit formula marco francesco donini survei knowledg compil formal queri answer knowledg base conp translat knowledg base proposit formula compil task winslett formal belief describ method compil knowledg base set proposit variabl show size formula bound size result polynomi al analyz formal belief point admit compil studi iter belief show compil method winslett belief exponenti number relat work section briefli mention form knowledg compil knowledg base support infer algorithm compil yield knowledg base compil knowledg preliminari investig shown briefli compar knowledg compil relat idea fix paramet tractabl optim queri answer compil make knowledg base problem queri answer horn knowledg hammer method optim size horn knowledg base prove find horn knowledg base provid algorithm find horn knowledg base size approxim minim compil compil method present paper output logic formula compil gener output data structur queri answer number queri precomput answer theoret feasibl mose tennenholtz queri languag queri conjunct basi queri number basi queri polynomi number variabl queri call effici basi queri admit effici comput store answer basi obtain answer queri tabl conjunct answer observ queri admit effici liter al observ queri compil circumscript knowledg base structur point restrict form default theori queri compil structur khardon roth sophist repres model knowledg stem result learn monoton boolean function set assign cnf formula assign falsifi call set basi basi assign defin order lattic trueg true assign true true defin set characterist model knowledg base kb respect union set model kb assign basi class horn cnf neg log log total number set characterist model knowledg base respect basi suffici answer queri class observ number log method strictli gener compil mose tennenholtz queri admit effici relat approach recent tractabl bodi research bear similar idea knowledg compil paramet marco francesco donini survei knowledg compil problem input natur split graph cliqu size case paramet fix roughli problem fix paramet tractabl solv time size function independ input knowledg compil fix paramet tractabl input problem split case aim prove problem tractabl part input treat special major differ fix paramet tractabl problem feasibl process knowledg compil assum instanc share fix interest find express complex term part input knowledg compil knowledg base vari fix paramet tractabl defin singl algorithm part input time extens formal analysi similar differ approach perform paper survei knowledg techniqu make reason easier exploit output preprocess phase techniqu concern prime knowledg compil popular appli proposit knowledg belief problem evalu perform obtain time algorithm reason compil knowledg show knowledg compil matur applic recent interest theoret limit knowledg relat complex class shown investig compil knowledg base receiv attent futur acknowledg author grate pierr marqui anonym improv readabl paper work support asi space murst ministri scientif technolog cnr research refer stickel cach model elimin theorem prover eleventh intern confer autom deduct page dechter proposit semant disjunct logic program annal mathemat artifici dechter default reason classic logic artifici intellig kautz vivid knowledg tractabl preliminari report eleventh intern joint confer artifici intellig page sa tractabl cover compil fifteenth intern joint confer artifici intellig page semant comput aspect horn approxim thirteenth intern joint confer artifici intellig page schaerf size knowledg base fourteenth acm sigact sigmod sigart symposium principl system page extend version technic report di dipartimento di informatica universita di roma novemb schaerf intract reason real artifici intellig compact proposit circumscript theoret comput fm schaerf preprocess intract problem technic report di dipartimento di informatica universita di roma novemb schaerf survei complex result logic journal logic comput prime implic prime implic davi putnam procedur workshop proposit held page marco francesco donini survei knowledg compil chandra number prime implic discret de kleer improv increment algorithm gener prime implic tenth nation confer artifici intellig page dechter rish direct revisit fourth intern confer principl knowledg reason page del val tractabl make proposit unit resolut complet compil fourth intern confer principl knowledg reason page del val analysi approxim knowledg compil fourteenth intern joint confer artifici intellig page del val approxim knowledg order case thirteenth nation confer artifici intellig page comput circumscript reduct algorithm fourteenth intern joint confer artifici intellig page fellow tractabl basic result siam journal fellow februari page springer eiter gottlob complex proposit knowledg base updat artifici intellig eiter gottlob proposit circumscript extend close world reason theoret comput fit logic autom theorem prove garei johnson comput guid theori wh freeman san przymusinski relationship circumscript negat failur artifici intellig selman compar linguist knowledg fourteenth intern joint confer artifici intellig page increment recompil knowledg twelfth nation confer artifici intellig page gottlob complex result nonmonoton logic journal logic hammer horn function dnf inform process hammer optim compress proposit horn knowledg complex approxim artifici intellig william special volum frontier problem phase transit complex artifici intellig jackson pai comput prime implic tenth intern confer autom deduct page kautz selman form concept fast infer tenth nation confer artifici intellig page khardon roth reason model artifici intellig levesqu make believ comput artifici intellig lifschitz comput circumscript ninth intern joint confer artifici intellig page jc logic complet reason mainten system base logic constraint solver twelfth intern joint confer artifici intellig page marqui knowledg compil theori prime implic fourteenth intern joint confer artifici intellig page marqui algorithm comput theori prime implic compil thirteenth nation confer artifici intellig page kind logic compil knowledg base theoret comput mccarthi circumscript form reason artifici intellig mose tennenholtz reason knowledg base artifici intellig subrahmanian comput circumscript theori algorithm inform algorithm increment prime implic gener thirteenth intern joint confer artifici intellig page papadimitri comput complex addison weslei publish reiter logic default reason artifici intellig reiter de kleer foundat truth preliminari report sixth nation confer artifici intellig page compil critic constrain knowledg base thirteenth nation confer artifici intellig page crawford implic prime implic random artifici intellig selman kautz knowledg compil horn approxim ninth nation confer artifici intellig page selman kautz knowledg compil theori approxim journal dg hj levesqu gener marco francesco donini survei knowledg compil hard satisfi problem artifici intellig lee algorithm gener prime implic ieee transact gener consensu theori applic minim boolean function ieee transact electron winslett updat logic cambridg
Agents/460 1 technic realist human behavior model agent virtual ontolog juli system engin depart pennsylvania barri phd engin depart pennsylvania pa abstract paper challeng improv behavior realism comput gener agent attempt reflect state art human behavior model attent stress set goal interest construct realist softwar agent virtual realiti train perform aid set web applic paper pursu goal provid framework integr theori model human behavior model cognit emot individu emerg group crowd equilibria social set framework base wide ontolog world valu physiolog factor constru emot subject expect util guid reaction agent make set oppon group differ framework serv extens markov process iter plai emphasi agent capabl redefin drama find counter human player articl present deriv framework initi result lesson learn integr behavior model interact drama stimul thought train doctrin introduct common concern agent develop realism behavior cognit idl object directli affect bottom line commerci mission achiev safeti health individu transfer skill set virtual real world product cognit fit emot natur tend sell lesson appli agent product peopl anthropomorph technolog item slot atm strategi begin emerg beat competit includ greater human mode interact synthesi car navig emot persona ubiquit facial accur mission system grow realiz greater cognit subtleti behavior sensit agent lead greater abil explor altern strategi tactic plai higher level skill attain human behavior agent chang alter arrai behavior cognit variabl agent behavior realist chang function cultur mission forc level fatigu stress time group effect loss close relat topic emul human behavior agent basic charact broadli react person circumst grow graphic anim agent literatur believ topic work great person mask lack deeper reason abil paper interest media broadli appeal type behavior react restrict focu behavior dynam avoid molecular cognit importantli develop field unawar scatter behavior literatur valid model deeper behavior research involv develop integr framework emul human behavior order make publish behavior result construct agent model attempt basic research human model work agent set framework present intend experi integr exploit publish behavior improv realism agent behavior research grow abil creat agent recogn shift plai lock narrow rule plai abil due converg matur number line research human behavior mo agent anim express capabl comput scienc gener electron theater simul goal benefit integr framework present focu task develop agent interact drama intend teach human system term interact drama refer game human player engag discov insight portion world captur drama term intend part convei notion game theori brittl restrict cover type situat human learn chang discov redefin successfulli detect shift plai essenc system seek creat interact drama popul agent understand attempt util human player discov uncov plot actor human player abil learn doctrin principl support number specif agent research issu build deploi agent acquir maintain knowledg agent action success failur creat tactic plan carri believ manner cover reactiv delib behavior presenc player react appropri anxieti reflect integr impact judgment perform factor emot model principl reflect agent behavior punctuat equilibria constru emot reaction mood stimuli person behavior choic end concern agent possess ontolog valu deploi system wind type synthet agent plai combat game impli cope activ strateg surviv decid make tactic larger context agent navig hierarch markov chain interact drama encompass includ complex formal approach markov process dynam program suitabl adapt includ bound ration process realist agent factor mention lead individu differ agent charact stress fatigu due situat agent emot mood depend event present wai model agent differ cultur background make ira captur repres world differ research person assum individu group adopt characterist apparatu establish conduct current thrust juli system engin depart pennsylvania major concern valid system ontolog behavior model deriv literatur integr framework concern valid perspect includ model ontolog extract coher choic rel theoret correspond behavior emerg collect actual dynam observ real world address valid concern kei point articl definit intellig agent defin softwar program effect freedom make lower level plan carri higher level goal agent adapt accomplish intent intellig agent concept attribut make agent interest architectur model behavior artifici agent paper particip game agent observ interact limit subset agent commun form belief action strategi store histori vector belief predict nearbi agent plai current guid action maxim util iter cn loop depict bottom figur von game theori dictat agent attempt maxim util iter nash equilibrium solut payoff matrix uncov except game cyclic agent wind game multipl ne clear priori agent settl worth remind reader maxim iter step lead ne strict optima pareto effici fact dilemma axiom ration dictat player settl ne li reduc util point game articl player assign util perceiv probabl valu dynam game unfold stress emot situat stress constrain agent time drive util maximum step emot hand redefin ne occur payoff tabl redefin entir game emot agent recogn shift plai higher level system terrorist interact drama research game multipl involv part higher decomposit lower game nest hierarchi game lead abil includ game obviou game unfold screen game rigid repres hierarch markov chain larg chain fulli portion game omit human agent player classic definit assum markov chain graph node state edg link repres action lead state transit notion specif level state condit immedi previou state hierarch markov chain describ major state state exist chang variabl captur reach human player agent agent seek visit chain markov chain describ agent action markov chain major state agent valu cognit apparatu agent isol util action refer interact drama opera hierarch markov behavior chosen agent popul scenario consist poor popul live half land popul half group poor area markov chain world middl figur repres juli system engin depart pennsylvania mission larger campaign address upper layer figur larger group seek establish author conduct number mission shift popular opinion support favor fear popul enemi mission expand middl figur cover possibl terrorist leav home base travel checkpoint deliv car bomb bank escap return safe home continu game plai depend node outcom terrorist wind dead clear level inspect terrorist find altern util ontolog emot deriv caught shoot guard checkpoint commit media substanti util popular support idea human player exist direct polici behavior defend player experi interact world effort manag potenti bomb crowd protest activ effici singl fact earli show forc lose game grow greater fund join rank scale conflict discov plai popul feedback effect emerg human player defend provid fair wai legitim local incid effect polic forc draw polit protest mi demonstr win lose war fail recogn system drama figur overview game agent engag illustr natur research human behavior dynam group agent individu agent layer member support util model guard mode guard readi mode home juli system engin depart pennsylvania probabl state transit oper xi current state state human player drive unnot shoot escap unnot potenti escap abort drive shoot guard die finit state markov chain mit xi percept caught action neighbor τ τ mn strategi checkpoint shoot util terrorist util guard util terrorist util guard util oppon enemi terrorist campaign choic caught die drive dead action die bank choic strategi time period class individu caught expect popul agent percept emerg time mn scenario prospect research integr low level contribut human behavior number fatigu individu behavior emerg social interact potenti media impact popul simpl scenario requir model crowd popul opinion implement game involv lot research understand work interact challeng reason research focu section articl move comment briefli state art human behavior model video interact virtual world human behavior model virtual agent larg number challeng exist human behavior model realism agent virtual world section begin broad overview includ specif issu frontier attempt investig challeng challeng realism human behavior model student recent conduct research comput game simul charact interact wai game ag lesser competitor includ model fatigu tactic strateg campaign polit bui sourc integr relev marin corp turn train simul hand hand combat reason reason constitut ongo challeng research construct integr game maker omit reason mathemat foundat code softwar militari model creat simplest manner market project deadlin histor capabl delib reason agent encount theoret rigor construct count perform mathemat theori due popular construct game creation simul finit state machin approach fsm offer implement markov chain organ agent iter meta particip hierarch network vast major fsm system implement date program bottom agent reason concept larger theori valid fsm charact anim creat virtual talk full bodi physic geometr kinesthet accur motor virtual develop architectur charact react appropri small rang emot stimuli utter tend reactiv system cognit process interact comput game industri recogn game environ publish interfac develop power user intellig realist behavior charact game drama recent earli effort deeper cognit function intrigu emot motiv short excit time interact game commun advanc behavior approach artifici intellig higher level function goal artifici intellig research give agent behavior combin abil creat juli system engin depart pennsylvania knowledg commun form belief agent knowledg belief plan action reach intent research desir intent agent commun creat wide arrai formal ground agent reason commun autonom plan learn agent wai environ procedur effect laird van lent point research typic examin narrow capabl deepli natur navig rare worri integr architectur agent free extens comput cycl process implement clear artifici life charact free cycl maintain realist lower level perform paramet game train world militari develop agent planner learner agent perform time game replai maxim control replic train situat consum bui game level run counter philosophi creat agent realist solut give develop abil rollback knowledg agent learn replic earlier train bdi agent learn occur compet payment receiv level lack principl current system game artifici artist stylist impress faith real human behavior game maker hire psychologist verifi behavior rare actual detail rare implement model base principl reaction effect fatigu judgment import except soar research ai bdi commun tend view model method perform task human differ human deep blue plai chess human care bdi ai approach enhanc behavior cognit fidel synthet charact easi techniqu creat capabl human possess artifici agent perform task time exposur swim shark reason equal long chase continu close shark length plai field full speed repeatedli turn return full field speed result current agent accur mimic human oppon collabor import ground agent behavior cognit psycholog scienc find behavior cognit research ignor implement million page publish studi serv principl human behavior perform function person cognit situat emot task group organiz cultur potenti rich resourc agent literatur address interpret translat find principl method suitabl agent implement factor literatur roughli laid neat perform moder function inform judgement test requir timeconsum abil determin valid generaliz find studi behavior scienc game theori ignor system drama tradit game theori mathemat rigor overli simplist game commonli studi involv highli constrain payoff intellectu singl layer plai system goal research studi human maker complex distribut analyz perform obstacl judgment deriv principl design softwar system enhanc hinder system develop studi class agent technolog foster human abil shift juli system engin depart pennsylvania understand wisdom environ research number topic model human specif design intellig softwar relat workflow process attempt shift chang behavior statist individu particip narrow analyt organiz memori broad synthet enabl histor contextu awar theori soft game theori interest thrust field date larg interact drama goal extend idea realm anim agent player interact human player recogn plai level dearth interchang standard challeng exist game ai system easili replac charact wed interact turn dial oppon scenario interest artist render readili extend exist system interest research behavior studi interchang standard commun hardwar store maker screw nail standard size thing bui wont plug thing bui bit ai code readili merg rich offer commun overlap virtual agent argu interchang standard immedi order field matur standard cover api specif plug plai modul complex standard exchang knowledg ontolog agent exchang behavior model transform implement clear model valid issu model model captur nuanc human emot rang stress effect effect judgment choic game engag attent real involv train transfer insight real import evalu model human behavior produc issu run exist game world real past campaign arent styliz version game folk code game world actual preset campaign valid issu model agent reason replic perform task principl model behavior literatur deriv simul deploi alter context impact succe attempt integr numer stress factor research date strongest factor separ integr emot model frontier model rush date rich theori short actual data method valid model consid question struggl order identifi agent base model human behavior dynam role emot ontolog agent behavior princip contribut research human behavior model field li effort provid integr framework enabl recogn avail test relev interact drama contribut behavior field area emot comput make contribut extend emot inher form delib reason work provid unif classic theori emot theori subject expect util unif formal advantag current emot model focu emot process broadli appeal person juli system engin depart pennsylvania interact provid mechan deriv relat util valu wide ontolog valu prefer contribut ontolog creat agent reason deepli util approach particip drama stimul system examin contribut close link agent state express facial bodi vocal humor anim focu emot comput li recent theori central role emot plai human ration idea human ration actor cloud emot western thought cognit scientist artifici intellig research concentr primarili aspect reason problem make good difficult introduc emot equat make perform agent recent theori suggest emot vital part process manag influenc great deal compet motiv integr emot model agent yield realist behavior provid deep model util agent delic threat elimin versu believ peopl iron taught ration product cold logic emot cloud mind ration newest theori suggest ad emot agent focu balanc set altern action larger case cortex damag patient spend entir dai highli logic cost surviv import implement idea theori attempt oz project affect reason seek improv believ behavior fiction set occ model emot occ model wide implement cognit theori explain mechan object world activ emot oz affect reason emot larg model reactiv capabl charact recogn situat reflect broad believ person version oz includ behavior link emot behavior choic articul publish account gratch el yen concret extend occ model event planner deeper delib reason mode depth breadth emot reason agent constru plan plan element happen current make delib idea earlier replac formal planner extend agent constru plan element constru impact object behavior standard area unconsci time physiolog pressur mean provid fairli full implement occ model reaction type object larg adopt mathemat subject expect util base formal deriv ontolog object world approach generaliz solut issu earlier condit relat mechan sum result emot gener guidanc sourc occ model emot object world emot action agent result connect emot world theori suggest link ontolog readili open literatur ten command moral militari doctrin action hierarchi event readili util implement agent type framework present tie ontolog directli emot process situat recognit util action deriv emot ontolog react juli system engin depart pennsylvania effect emot agent capabl human detect shift drama plane system interact criteria behavior realist agent discuss point broad rang organ present top level integr framework discuss reflect desiderata success criteria measur deeper level integr frame work architectur subsystem architectur highlight criteria repres advanc agent behavior realism satisfi select criteria chosen reflect integr issu highlight pose challeng agent behavior model research make research cognit architectur agent algorithm reason framework contribut literatur extend criterion sati fy requir construct variant arbitrarili separ subsystem memori form capabl agent shown figur larg number similar framework literatur refer stand armi call step direct boyd orr call act loop structur comparison model found sherman model depict readili map similarli architectur model subsystem receiv stimuli formul act stimuli limit subsequ system flow process pure reactiv system start interest delib ponder run seek stimuli support altern test system interact delib sake expositori describ figur rotat introduc work memori figur top level integr architectur research altern algorithm gener agent stimuli physiolog system moder signal merg perform impact emot system world valu situat emot juli system engin depart pennsylvania gener agent system procedur express action cognit system probabl mood criteria work memori histori recent past observ action fear task order agent model interest modifi markov process agent seek hierarch markov chain set nest game introduc earlier figur order agent awar chain place work memori set intent task agent seek work current current situat pose task element work memori store process intent recognit bdi agent model belief process game theoret observ world form rememb simpl statist model action situat interest mention equat base figur desir bdi defin affect state hope fear gener emot system fulli section move physiolog subsystem initi react set stimuli perceiv exp environ subsystem includ sensori group number physic process thought reservoir deplet replenish capac exampl physic capac larg number moder abil perform case send alarm pain occur threshold import criterion modul support studi common question perform easi addit delet reservoir interest studi train world stress proxim land individu differ react model reservoir behavior linearli vital criterion modul support studi altern mechan combin low level perform moder function singl stress level stress effect framework show comput integr level subsequ modul capabl reflect function effect emot judgment stress act emot larg reciev stimuli sensor adjust moder physiolog system includ long term associ connectionist memori valu hierarchi ontolog activ situat stimuli intern recal stimuli stimuli impact ontolog act altern emot intens level emot activ turn provid marker serv situat recognit recogn problem potenti act order support research altern emot theori subsystem includ easili alter set equat paramet variabl number emot base modul serv valu ontolog processor editor simpli author altern captur behavior altern peopl organ differ assess artifact world requir emot modul deriv element util payoff cognit system access altern action cognit subsystem locu reason guid sensori emot stimuli receiv assess situat weight emot feel potenti action cognit subsystem materi expect util repli set action convei motor subsystem reactiv cognit subsystem trigger emot sensori mode invok seek input assess cognit subsystem pick process mode select action select process mode major topic human behavior research primari featur integr framework includ goal support test wide rang altern process norm ration crisi cognit system support reason hypothet drive includ norm descript version abil includ norm path juli system engin depart pennsylvania call perform output degrad due emot factor turn node figur modul librari store procedur agent interact displai motor express output base stimuli motor subsystem adjust relev store procedur perform action intend reach state attempt carri action motor system carri repli action perform limit physiolog system vital store procedur includ function portrai altern behavior motor system serv stimuli system long period emot common mathemat framework behavior model section introduc top level overview integr architectur object present layer detail level taxonom compar contribut literatur adopt common semant concept mathemat measur basi compar altern contribut section present semant mathemat turn review mechan involv subsystem emot subsystem strategi cognit subsystem subsystem impact physiolog system perform make interest combin moder altern action set likelihood agent thing current game strategi determin agent find repli strategi pertain perform effect carri chosen strategi section address deriv strategi set begin volumin literatur behavior easili number studi earliest studi classic show stimuli moder perform initi fall threshold pass presenc perform slightli moder time review literatur militari virtual naval hospit address dozen factor effect combat stress stage stress evolv al conduct exhaust review data includ classic studi survei specif silverman al assembl perform moder function literatur abstract includ assess valid data collect concern individu remaind deal factor effect judgment behavior find silverman valid model stimuli interact effect stress behavior find confirm insight attempt delin integr research paradigm judgment stress number effort attempt integr depend studi simul integr differ provid insight process ground review studi develop model make battl sole effect stress gilli extend model account claim prime determin fatigu due sleep juli system engin depart pennsylvania time individu abil experi person form risk frequenc magnitud event plot event stress concern factor ignor altern lead fatigu light formul person event stress base raw count ignor emot item address section provid interest wai integr model effect experi address issu level experi incorpor recognit prime ing approach klein attempt initi studi valid model simul militari mission assess sleep found factor moder explanatori effect level theoret inspir approach adopt inform process theori model model field combat equip screen oper includ factor task workload work rate offer inform process error account attempt explain effect time task mental model alloc attent subtask track task interrupt postpon scale model repetit task network oper model claim time pressur primari determin oper perform empir result back claim account odd altern approach cognit prime determin approach jani mann includ literatur account numer studi stress make conflict jani provid wide site taxonomi strategi cope time risk interpret taxonomi step figur defin taxonomi includ flowchart algorithm call balanc time risk drive maker cope strategi depict item figur figur classic perform moder function effect repli optim repli error time avail risk chang chang adher algorithm deriv valu call integr juli system engin depart pennsylvania vigil panic recognit prime panic avoid panic low medium complet low low high adequ adequ insuffici low medium high high high select mt chang sm mission set whichev repli panic highli experienc br turn recognit prime decisionmak klein avoid occur level sm run ground jani cope pattern adher risk inform decisionmak decid continu chang dm adopt whichev action strongli recommend vigil dm search relev assimil altern carefulli make choic avoid dm evad conflict shift construct ration remain select correct inform dm search dilemma seiz contriv solut overlook full rang consequ choic emot repetit cognit reduct memori span simplist extrem refer cope pattern regard jani adapt routin minor lead poor vital choic made pattern adapt gener reduc dm chanc loss author danger immin gener lead author refin idea rasmussen show skill level perform stage shoot ahead anim model vigil occur rule knowledg level cognit process klein show expert work effect mode immedi recogn altern vigil scan altern jani provid threshold valu maker trigger chang cope insight integr determin stress time pressur risk draw literatur mention provid integr model remaind model intend support jani cope style equat model integr stress result prime determin event stress time pressur effect fatigu quantit deriv constru fact differ nervou type section describ emot filter examin quantit factor modifi combin modifi event stress deriv simpl sum number event recent histori period posit term neg hinder slowdown reach repli current node markov chain past node histor period event exampl includ schedul intermedi state realiz inaccuraci prior inabl proxim unfriendli oppon fire encount hazard juli system engin depart pennsylvania threat mine loss isol es potenti reflect confid agent action success es vari interv total battl stress quantiti event map scale matter empir present follow qualit guidanc virtual naval hospit translat start posit novic experienc combat assum event add subtract subject process filter unlik model post stress restrict focu time frame game τ ψ approach consist gilli frequenc quantiti past confid numer scale rang reli quantit score ignor emot event stress model model term agent place strategi reader recal equat smaller δ bia agent potenti strategi end stage game summar literatur time pressur found simpl linear equat relat magnitud time pressur stress task requir accur time time stress effect perform impact address review literatur recommend magnitud time comput tp ti ti tp tp tp tp approach complet time stress ta shrink tp stress disappear approach infin event time stress quantit inexperienc recent train individu experi amplif effect tp constru time complet task section effect fatigu model deplet cognit reservoir start full agent begin time agent rest remov relev reservoir deplet number suggest literatur sleep exert light lack fatigu toler reservoir replenish due remov moder environ sake simplic current assum replenish time effect disappear time period presenc remov model effect linear function similar manner time behavior moder set suggest greater type individu combin normal sum ef grow longer agent decai juli system engin depart pennsylvania differenti evid literatur suggest sleep depriv domin factor short run continu exert temporari individu literatur effect mix presenc motiv factor model absenc individu recov passag formula recov sleep depriv happen individu sleep assum recoveri exert begin activ level fall exert threshold recov make simpl assumpt arriv food medic attent suffic immedi elimin effect reservoir start full deplet time interv ef period alter repres toler individu specif present logic rule combin factor rule account fact high factor push agent panic panic factor high high factor high moder panic result end factor low result adher rule list similar exist threshold cutoff present empir verif threshold work simul panic high high high medium high medium high adher low low low emot deep model util contribut michael section examin combin multipl emot util estim state examin emot confront reaction state number ξ emot intens correl import valu set valu succe fail state question express ξ intens due kth state world set agent relev set consist set consist union weight import valu agent succe fail ith concern set list path ith ontolog agent trigger condit state function captur strength posit neg relationship agent object effect spare state function captur tempor factor state impact juli system engin depart pennsylvania juli system engin depart pennsylvania emot futur express captur major dimens concern emot tempor aspect sake assum linear addit multipl emot set valu state precipit term equat fact attempt correct figur ontolog show part standard prefer sampl terrorist standard agent prefer artifact object emot model psycholog literatur provid greater detail class model cognit theori includ model lazaru roseman collin input set thing agent concern effect determin emot result fit structur equat strength bring bear present decid pursu occ model elabor occ model defin equat worth introduc preliminari concern tree figur terrorist agent concern tree standard agent act prefer object artifact world agent concern tree richli fill suffic sake stop rule fill concern tree agent limit behavior scenario question figur concern tree bottom leaf node test element nearbi current concern tree hold learn valu import weight link concern tree label sum child weight sum sake conveni children strictli conjunct disjunct research deriv structur weight tree manual part process build agent principl deriv tree machin learn knowledg discoveri interact event dataset terrorist group tree equat evalu function wi state world leaf node fail lead wi multipli branch tree leaf node wi concern tree comput express multipli tree sum ci root ci ci child concern node parent node equat tree figur result weight strategi result dead death standard directli succe fail feel pride attempt mission current fulfil commit attempt correct perceiv attempt current attempt current juli system engin depart pennsylvania ci attempt fulfil attempt act root current commit current fulfil act cognit unit perfect feel singleton set pride commit mission involv return home thwart fail surviv feel shame act act shame juli system engin depart pennsylvania act prefer succe fail dead emot gener prefer ontolog turn occ model expand equat model consist relianc set agent part give advic determin valu fulli develop agent gener sourc guidanc hierarchi valu terrorist elabor weaver silverman work show hierarchi case differ terrorist organ show hierarchi group function polit campaign mission oper lower valu vari wide individu develop complet model agent care probe deeper model person individu significantli effect prefer agent hold terrorist group tend differ care care model differ effect terrorist cell tend drive consensu isol belong mention occ model divid valu agent goal standard agent prefer item artifact element equat goal standard prefer discuss separ goal event highest work start point understand goal individu show basic motiv physiolog safeti social person reject serial work empir shown descript individu ag rich sourc goal drive figur show goal structur terrorist motiv forc top hierarchi terrorist design divid primarili concern basic unimport struggl roof head terrorist concern aspect physiolog live desir preserv term scenario fail succe return home safe prefer avoid situat put conserv consist stai rest model terrorist desir retain home order pai bill avoid situat land occupi begin goal pai bill fail due extrem contribut factor support liber effort place liber forc defend land occup place goal ontolog import support terrorist organ return involv effort shortli terrorist primari belong simul famili goal serv consum remind terrorist agent social life leav organ popular goal account fact visibl show devot gain admir simul terrorist terrorist believ support liber effort prove dedic consid primarili power depend emerg victor violent influenc environ particip effort organ rise rank account part thing place primarili free time goal consum major import alloc import terrorist succe complet current futur mission addit primari simul function support organ extrem import goal serv varieti higher level order particip individu thing lend logist direct cash donat made imposs conduct mission bring cash equip popular support includ method distribut directli support current campaign terror organ undertaken amount support simpli give life reason goal figur initi goal ontolog terrorist agent juli system engin depart pennsylvania point campaign consist current mission abstract notion futur mission futur mission serv consum terrorist current mission determin success campaign current step process subgoal involv drive escap terrorist slightli step stop polic checkpoint experi reason goal move lessen impact relax terrorist emot goal activ agent directli plan make happen reload interest state world agent realiti gener import replenish period spawn activ goal base time fulfil order determin intens emot pertain success failur occ model variabl depend context situat variabl depend event event happen agent clear comput system implement date track tempor proxim goal variabl pertain agent feel consid relationship discuss effort realiz left futur research occ unanticip confirm goal success failur gener joi anticip goal effect state gener hope fear confirm hope fear turn satisfact disconfirm state fear hope relief lack evalu goal goal success gener goal failur gener depend agent question dislik agent experienc emot explicitli defin rl relationship vari scale standard agent behavior sourc turn materi includ standard tree exampl militari ethic moral religi model religi terrorist good idea includ principl religion standard tree equal includ doctrin code behavior found publish account sake simplic describ standard earlier figur note standard unlik interest goal passiv natur repres peopl trigger relev relev affect read account ancient warfar practic threaten care tangibl differ greatli accept standard occ model term action attribut pride shame result attribut extern turn admir intens emot effect primari factor judg implement result intens equat effect standard strength cognit emot agent agent perform action determin shame action person case feel emot action individu strictli action juli system engin depart pennsylvania intens factor involv deviat expect captur idea gener develop intens feel thing expect peopl system place manag role develop belief concern intens factor implement prefer artifact prefer track dislik earlier includ sampl prefer tree figur typic pertain object dislik import militari scenario note view agent object side effect make subject agent feel emot agent avoid shame felt needless harm person explicitli model perceiv agent ra perceiv object ro vari scale emot result effect prefer varieti occ dislik emot intens factor object consid appeal model intens function earlier equat familiar object breed tendenc express prefer intens amplifi intens intens dislik comput occ emot previou subsect pair emot due concern tree relationship paramet posit provid equat gener emot assum set effect valu agent set total weight valu comput equat cognit object relationship function determin probabl success failur question emot intens function equat form rj resent hope fear juli system engin depart pennsylvania jl jl jd satisfact previou rmed previou relief previou disappoint ment previou fear joi distress pride shame admir anger gratitud juli system engin depart pennsylvania jc jc ion dislik jf time interv question begin prospect base emot goal equat work govern earlier equat tree process tick simul instanc emot gener sum total separ valu creat import function emot regul behavior social situat agent repres agent occ model paramet involv agent feel depend type emot gener pair agent defin dislik form cognit unit familiar rf addit paramet ad implement determin intens agent view view ro frame occ field indic affect fire model relationship implicitli end result aspect relationship identifi occ fit explicit effect isol code part model relationship explicitli model cognit artifact addit agent model valu agent agent perfect model valu easili chang editor interestingli requir substanti agent determin valu automat recogn action motiv depend scenario explicitli model agent structur agent misunderstand lead amount conflict place scenario simul grant agent perfect model assign problem studi nonetheless perplex environ provid rudimentari answer determin perform process transform gener trace back influenc person perform blame person hold peopl assign differ blame manufactur societi larg type transform worthi fair amount determin scienc process cut edg psycholog approxim repres relationship multipl parent child agent assign credit action tree search strong relationship rare action action repres group import thing captur crowd popul featur hope implement subsequ version conclud worth briefli mention tempor likelihood issu goal list time interv statement believ true return confid valu variabl bind piec inform convei concern effect past effect confid agent affect event structur inform close resembl convei frame elliot current approach estim futur gener occurr hope fear begin action approach miss occurr extern probabl estim current assum mutual treat probabl sum return subject probabl estim section game theori strateg layer cognit subsystem serv model point factor integr action transit state return markov process node markov chain tick agent process state transit action state transit current intent provid task list plan intent prior expect agent state base recent histori desir action base pair emot scale ξ cope level defin inform agent select defin process stimuli produc agent pursu pure mdp process specif hierarch mdp model theoret plan problem agent make sequenc maxim expect util uncertainti effect action current state moment agent finit number state finit set action transit state optim markov juli system engin depart pennsylvania process defin dynam program problem maxim discount reward util futur period max σ δ optimum point term exp ect discount futur util iter δ discount factor short horizon problem δ reward function util select action state formul expand formul loop iter loop state find br action set action maxim current futur reward avoid local captur find maxim function test δ σ transit probabl state immedi action state st function extern perturb equip reliabl action agent function find maxim util action equat summar standard comput formul dynam program optim markovian process formul assum agent project util state chain game infer maxim util action state work backward state deriv path maxim action reach comput complex game chess overwhelm simplif introduc δ discount futur move plai agent simplif reappli equat step simul determin state result action prior redefin optim path maxim util remaind chain pursu dynam program iter solut polici graph edg transit result emerg path agent larg markov studi posteriori agent formul potenti odd spirit human behavior algorithm silent deriv convent research commun deriv arbitrari reward win human poor move ahead weak probabl estim peopl time time motiv fulli process replac function number altern process style label φ add realiz alter mdp reflect human behavior faithfulli find global seek ne local util settl lesser solut fatigu discov shift plai effect juli system engin depart pennsylvania chang assum util state emot activ previou section occ model gener pair emot intens current state iter plai section posit deriv util call equat util thought simpl summat posit neg emot action lead state pair opposit valenc emot occ normal sum util vari σ ξ argu idea aggreg mask individu summat consist marker theori learn singl impress feel state action bring avoid state util deriv dynam iter emot util action strategi rel ontolog minu cost carri strategi introduc modifi emot function discount heavili weight game achiev closer agent end stage game agent conserv constru surviv import earli make dare maneuv end point modifi util alter emot base mood longer term person factor explor detail deriv mood term shortli permit integr probabl success expect util system agent learn select criteria ignor remov π contrari impli infer π markov drama repeat time mean probabl perceiv probabl expect agent base work memori observ τ period past introduc discount factor probabl express set heavili weight past equat repli defin altern valu ω em perceiv probabl umn equat δ memori coeffici τ number period back action relev em action relev δ expect coeffici action set integr stress section term perceiv probabl equat present simpli pre hand conceiv machin learn program track outcom permiss action state deriv probabl success failur inform date made attempt factor introduc agent discount vulner probabl lower estim probabl lose battl nervou soldier tend overestim probabl failur juli system engin depart pennsylvania prospect heavi bring earlier discuss time pressur effect make present action carri ideal time complet estim simul gener time earlier gave equat tp omit idea tp directli impact probabl time complet task task outcom success turn discuss process style ω larg literatur style function discuss rich set possibl explor modifi mdp framework begin indic compon cope level impact choic strategi rule select process style matter extend current focu goal show illustr set rule work idea provid mechan evalu altern rule exist literatur refer mention postul balanc emot valu vigil moder stress level event stress approach close drop cope state invok emot capabl situat recognit recognit prime decisionmak event stress approach upper physiolog concern panic set place run wildli assum fatigu put state world slow reduc import valu higher level goal physiolog remot object guid adjust set equat present paper emot stress compon event initi task plan call emot model situat ignor probabl appli criterion optim high event panic fatigu reduc posit posit emot ignor probabl appli criterion time pressur primari impact reduc probabl success action altern cope strategi criteria risk event stress ignor emot reduc probabl di thing base choic action minimum criterion panic vigil panic equat ignor situat randomli action base choic minimum feel safe current remain root drop artifact run blindli threat number mood alter emot import potenti determin ω mood filter weight function damasio mood deriv neural apparatu mood deepli longer period order hour dai frijda survei mood literatur found mood studi tend identifi affect state frijda consequ mood interpret sourc literatur model mood includ posit reason refer impact posit neg affect shift subject costli strategi deriv posit neg mood set mention vigil high event formal express juli system engin depart pennsylvania criterion optim natur criterion assum natur present assum posit mood correspond vigil neg mood correspond criterion model longer list affect state survei reveal altern cluster studi studi mention mood angri address mood extrem anxieti assum state panic panic model similar fatigu mood repres ef shown model rest mood number classic rule found standard textbook determin util action depend agent perspect includ exclud make agent greedi iter earlier equat standard criterion iter plai intend deriv nash equilibria oneself reach behavior agent comput util agent assum version valu tree mention assum agent omnisci make greedi agent concern tree altruist assum agent includ teammat mood shift greedi extend altruist factor util action perspect impli attempt minim oppon perceiv includ criteria case probabl agent assum call stress cope style discuss earlier criteria risk greedi max collabor max altruist max friend min criteria uncertainti ω probabl criterion max criterion optim max express subsystem intend action select paramet modifi express motor function subsystem librari store procedur modifi relev appropri reflect stress cope level mood emot activ review adjust point primarili examin impact select strategi true effect carri action call perform effect jani model layer deriv aspect pe task slip low stress sensor inform input denial avoid random action inexperienc agent panic task interrupt abandon occur state panic action pe requir input adjust dimens includ reaction task error rate task complet sake simplic earli dimens pe juli system engin depart pennsylvania assum impact factor step function approxim invert classic ideal pe level attain stress lead greater reaction error complet time account novic expert differ term experi train combin add layer add differenti current version ignor individu differ permit differenti manag differenti set level differ novic expert cutoff doubl tripl side half left side plot relationship equat shown figur shape plot perform vertic preserv step jani mean differ tabl base figur show determin independ drive agent level perform effect qualit indic plot point medium medium high figur map taxonomi effect physic perform effect perform effect percent ideal task complet error event stress time pressur effect fatigu low medium medium high low medium medium high wake adjust ω subsystem reflect emot mood primari emot mood framework process entiti agent reflect statu embodi graphic larg anim omit discuss point reader articl topic excel gener literatur juli system engin depart pennsylvania expert medium low medium high high high high high high step lesson learn date literatur improv realism behavior model complet survei literatur found number model basi cognit model agent behavior fact problem fact integr bulk effort date document figur integr common mathemat framework benefit cost model process integr topic attempt creat integr benefit approach realist deal interplai dimens connect abil address simul open larg number possibl improv agent behavior confront realist scene benefit term game time learn adapt fit scenario interest singl valid theori integr result appeal role ontolog engin approach present paper reli common mathemat framework integr dispar model theori implement simul requir extens ontolog engin flesh lower level ontolog emot model comput util assess agent determin agent follow deviat order doctrin current effort aim ad set tool visual ontolog emot model util make express princip contribut paper li emot deriv util dynam agent comput feel event action standard theoret model basi agent comput util deriv subject matter expert mathemat manipul function approach postul subject matter expert interact stage stage defin ontolog agent deriv util valu tradeoff approach free expert infer place debat squar open literatur account set sourc famili account captur express valu import transform reactiv finit state machin markovian player order approach outlin simpli implement low reactiv automata comput gener forc simul forc environ militari reli heavili finit state automata agent carri task approach work graphic agent reaction support integr physiolog layer model slow alter abil perform current task difficult agent order interrupt decid action theori present framework support reactiv agent capabl requir code effort explor issu framework difficult peopl time implement agent charact futur hope develop case studi highlight framework creat game player focu system complex organ shift top command control decentr manag reli individu case juli system engin depart pennsylvania asymmetr conflict era approach fact lead run risk system continu caught local optima posit conduct parallel hill climb find global maximum system approach hierarch chain human behavior model permit game involv player learn larger plan test thesi framework present implement game terror scenario introduct focu effort crowd model crowd behavior frequent model dynam equat work effect handl movement individu group channel narrow flock bird permit state machin navig spatial area avoid approach introduc panic case state machin avoid wind collid hurt approach ignor root crowd semant young male leav home arriv protest ontolog lead event protest shift behavior violent protest rock throw develop ontolog markov chain lead behavior type implement hope begin develop follow framework develop document paper juli system engin depart pennsylvania acknowledg author acknowledg support model simul offic forrest lt col dr phil dr extend special martin great contribut understand militari plan refer theori game econom game mit human behavior model synthet agent emot person effect util altern terrorist target select case conf comput gener forc behavior simul terrorist pet evolv emot annual confer autonom pp nass media peopl treat media real peopl place cambridg press anim charact autonom agent system agent academ press survei human behavior activ distribut interact saic technic report build cognit rich agent toolkit commun acm rg rj effect sleep loss sustain cognit perform command control behavior research virtual human anim base movement observ cognit behavior comput anim ieee comput lo anim control virtual commun acm artifici life comput commun acm make cognit model comput anim phd toronto jw wl pedagog agent virtual realiti intern confer autonom ps intellig agent interact simul ai jm al agent ieee intellig system agent commun current ieee intellig system rw model human organiz applic militari nation academi press intellig forc project confer comput gener forc behavior fl pp oral commun dr toni chief jr adapt charact lawrenc nj bg expert literatur theori repair knowledg law theori psycholog vol pp virtual naval hospit websit battl stress stress technic report naval train system juli system engin depart pennsylvania engin data human percept wright patterson tech report judgment oxford behavior moder influenc command entiti effect conf comput gener forc behavior steven synthet forc suppress virtual conf comput gener forc behavior perform shape factor comput gener conf comput gener forc behavior se model human inform process task network simul defenc civil institut canada model human perform predict unit effect militari civilian applic ce make model method cd engin psycholog human perform harper collin publish make psycholog analysi choic commit free press york cumul mood vigil perform decrement week sleep restrict hour night workload implic individu team washington nation academi model cooper tradit agricultur talk santa april tradit anim appli comput comput juli pp error human emot control psycholog pp critiqu reason affect process model emot doctor northwestern evanston interplai emot emot oxford motiv harper gerald clore allan cognit structur cambridg art problem martin paul test theori discret person social pp web emot base agent architectur workshop agent proc avail emot base emot base agent architectur workshop agent proc avail bryan loyal adapt architectur carnegi mellon technic report june role emot believ commun special issu juli solut markov process juli system engin depart pennsylvania markovian math pp dynam program markov process john solut finit partial optim oper pp survei partial observ markov manag pp pp emot prefer model forc manag requir air forc tactic command control ieee transact cybernet vol command control oper concept septemb unpublish manuscript fort armi combin arm combat develop command control director combat oper fundament interact report au air forc research institut human problem lm review command control model septemb emot jn handbook pp affect jn handbook pp rule sign symbol distinct human perform model ieee transact man van killer interact comput game artifici intellig summ pp juli system engin depart pennsylvania
DB/461 3 tempor statement modi er michael aalborg christian jensen aalborg richard snodgrass arizona wide rang applic manag data tempor queri languag result carefulli made subtli interact design paper advoc di erent articul set directli impli syntact structur core semant tempor extens nontempor queri languag desiderata facilit transit applic nontempor queri languag data receiv attent paper introduc notion statement modi er provid mean systemat ad tempor support exist queri languag statement modi er appli queri languag cursor de integr data manipul statement provid systemat add tempor support exist implement result tempor queri languag implement deriv rst principl exemplifi approach extend statement modi er extend term formal de ned map tempor statement express combin tempor convent relat algebra oper categori subject manag jensen aalborg comput aalborg denmark richard snodgrass arizona depart comput az preliminari articl accept acm transact system de version product acm version copyright associ comput permiss make digit hard copi part work person classroom grant fee provid copi made distribut pro direct commerci advantag copi show notic rst page initi screen displai full citat copyright compon work acm honor abstract credit permit copi post redistribut compon work requir prior speci permiss fee permiss request public acm ny fax snodgrass gener data queri languag addit kei word tempor tempor statement modi er introduct wide varieti applic manag substanti amount data includ nancial applic portfolio insur travel applic hotel project manag applic scienti applic trend analysi numer applic manag substanti quantiti data held true long maintain continu improv storag technolog applic support data version data retain longer yield larg util promin tempor dimens manag time vari tempor aspect data attract special attent valid time fact time fact true model realiti transact time fact time fact store current fact valid time transact relat requir captur aspect term tempor valid transact time captur speci term relat relat record valid time relat relat record transact time bitempor relat relat record valid transact time term nontempor relat convent relat captur tempor aspect relat technolog support tempor data manag incap exploit time dimens lled potenti work tempor manag conduct past lead wide varieti data model queri languag numer implement techniqu recent queri languag demonstr tempor applic develop bene substanti tempor support queri languag provid tempor support directli queri languag underli dbm half answer import transit exist technolog support queri languag facilit transit success complet rewrit exist applic power tempor support straightforward migrat path tempor statement modi er exist tempor queri includ design unfortun ad hoc feel numer justi cation languag con uenc design interact subtl wai paper advoc di erent approach tempor queri languag design articul desiderata constrain guid start initi nontempor queri languag odmg syntact structur core semant tempor queri languag directli impli result languag design deriv rst principl present paper show emploi statement modi er design tempor extens appli statement modi er addit queri address data de nition modi cation integr constraint languag step show desiderata shape skeleton languag present formal de nition semant queri languag mean map ned algebra express map assum map relat algebra de ne tempor statement term map ned tempor convent relat algebra express tempor relat algebra ecient implement evalu express reli end point time period argument data intermedi make evalu granular independ gener approach amen initi queri focu languag speci rigor de ned tempor extens base statement modi show de nition sati es desiderata present structur section formul requir tempor data model queri languag section proce illustr sampl systemat extend statement modi er provid support tempor manag provid intuit languag section semant show implement term relat algebra extend tempor relat algebra solid foot explor languag topic section relat research explor section section summar point opportun futur research detail technic matter complet paper prototyp system implement select aspect tempor access url paper snippet applic human resourc applic maintain relat record work current salari job current data applic inher receiv assign di erent modi cation made retain past data snodgrass grate applic support tempor extens desiderata tempor extens promin prospect user tempor technolog manag larg amount data challeng ensur smoothli migrat current dbm tempor tempor dbm deliv systemat support time referenc data tabl summar desiderata aim ensur goal remaind section brie show concert cover kei languag design issu desiderata facilit transit tempor dbm upward compat facilit migrat legaci code exist dbm tempor dbm tempor upward compat facilit coexist legaci code tempor exist data render tempor ect oper exist applic facilit applic er tempor support gener queri languag view tempor desiderata systemat tempor support yield systemat approach er tempor support extend er systemat tempor ensur reduc statement explicitli refer time integr support point view data interv preserv provid maxim support view maxim respect interv argument tupl queri languag statement provid maxim support view make treat timestamp normal tabl desiderata overview upward compat softwar industri sql standard speci tempor tempor upward compat requir render relat serv tempor applic impact exist legaci code object make gradual develop applic invalid exist applic adopt tempor import applic develop continu task initi product exist sql statement render tempor simpl relat tempor dimens perceiv sequenc nontempor regular sql statement appli regular sql statement render tempor appli individu snapshot state tempor relat combin result singl tempor relat tempor statement modi er remain desiderata independ legaci issu guid design tempor extens extend ensur aspect extend queri languag tempor support support interv preserv aim preserv interv permit manipul timestamp predic function note desiderata orthogon aspect relat perform properti migrat applic formal de ne turn upward compat fundament import ensur code work modi cation tempor dbm exact function exist dbm upward compat captur essenc assum interfac dbm captur data model talk migrat applic code exist data model data model adopt convent data model consist set data structur languag queri data structur central data structur relat model queri languag sql denot data model consist data structur ds queri languag ql ds set instanc express ql set updat queri statement appli ds db denot statement denot queri updat modi cation data model syntact upward compat data model data structur legal queri express model model exist applic code remain syntact correct definit upward ql ql data model model syntact upward compat model ds ds ql ql queri express exist model evalu result model queri languag express legal element ql ds data model result appli db data model result captur aspect interact applic includ result data cursor definit ql ql data model model upward compat model syntact upward compat ds ql hh snodgrass exist queri comput result system section strong implic detail error code bulk legaci applic code ect transit system illustr upward compat context statement creat tabl id integ constraint primari creat tabl salari id amt foreign kei refer select salari eid creat view select id id simpl legaci statement support reason extens semant dictat rst data de nition statement de ne tabl column column constraint state id primari kei statement ne tabl column tabl constraint make refer select statement join salari fourth statement de ne view return tupl referenc salari requir tempor extens strict superset ad construct easi ensur tempor extens upward compat note upward compat place strict constraint tempor live peculiar languag extend extend data type string extens string data type durat unintend cation upward compat extens includ reserv keyword violat upward reason legaci queri languag statement emploi keyword identi er semant statement illeg impract exclud reserv keyword tempor nontempor extens ad reserv keyword reserv keyword follow current practic avoid overli upward compat sati ed keyword ad reason gener term time interv refer list item incompat keyword aspect item tempor statement modi er tempor upward compat adopt tempor data bene ts tempor support realiz modifi exist applic code develop applic code exploit tempor capabl step formul desiderata aim ensur harmoni coexist legaci applic code applic code point tension assum tempor model place applic code modi relat nontempor applic support tempor dimens data exist exist nontempor relat chang tempor undesir chang applic code access nontempor relat requir exist applic nontempor relat continu work ed nontempor relat render tempor queri return result nontempor db tempor counterpart modi cation statement ensur subsequ queri return expect result definit upward tempor nontempor data model ql ql oper type relat nontempor tempor denot sequenc updat oper de model tempor upward compat model upward compat ds ql subset function tempor data model correspond tempor upward compat consist languag mean creat tempor abil appli queri updat tempor tabl assum tempor dbm satisfi upward compat make thing assum moment execut version human resourc applic access sourc code sql upward compat ensur applic run ne work assum state shown id bob pam sarah salari id amt render tempor ad support underli relat sole abil render tabl tempor valid time snodgrass captur ad special alter tabl type alter tabl add current time alter tabl associ row timestamp special track current time consist time integr constraint sati primari kei refer tempor upward compat ensur applic execut semant salari nontempor speci queri retriev data retriev cursor work referenti integr check appli past state automat retain implement applic enhanc statement queri data exist applic remain singl line code chang assum code includ execut time insert valu delet id select exist salari select statement legaci semant chang underli data tabl chang modi cation statement adequ maintain valid time insert statement add delet statement vertic separ attribut nontempor explicit attribut assum close select view restrict current state achiev practic recompil view de queri return time occur insert implic uc upward compat tempor upward compat concern statement tempor queri languag initi queri languag legaci summar person implement upward compat tempor extens statement evalu tempor dbm referenc semant dbm tempor statement modi er semant de ned standard includ result underli relat statement modi cation cascad check integr constraint invoc de ned impact transact statement error condit code return impact state tempor upward compat ned semant statement evalu referenc tempor relat term interact semant de ned result impact transact statement error condit impact state applic applic emploi statement detect underli relat statement ect tempor relat di erenc evalu nontempor versu tempor relat store state histori maintain histori observ statement tempor extens observ legaci statement implementor ensur correspond preserv time upward compat easili ensur retain syntax implement underli nontempor queri languag rst cut support tempor upward oper retriev data tempor relat includ addit predic valid transact timestamp overlap oper logic delet tupl set valid transact end time oper insert tupl set valid transact start time detail depend underli queri languag dbm implement extend class applic store inform convent date time attribut wai programm examin spectrum approach upward compat ensur applic run tempor dbm tempor upward compat relev situat relat store appar underli dbm notion convert relat attribut tempor relat necess involv extend discuss section dealt semant statement underli nontempor queri turn attent desiderata enhanc present tempor queri languag tempor extens introduc languag construct mirror exist time compon add tquel add snodgrass parallel advoc util exist syntax gener appli time present syntact similar snapshot aim protect invest programm train ensur continu ectiv applic develop migrat tempor model achiev exploit fact programm comfort nontempor queri state queri languag tempor extend data model queri nontempor queri syntact similar tempor queri technic goal make semant tempor queri easili understand term semant queri nontempor relat familiar syntax extend semant make programm immedi easili write wide rang tempor signi initi drop product base notion snapshot reduc bi denot nontempor bitempor relat db db bi set nontempor bitempor relat bitempor oper bi tt vt argument bitempor relat bi data model bi bitempor instant tt vt return nontempor relat data model tupl current time tt valid time vt consist tupl bi time includ time instant tt vt valid transact time snapshot reduc util interpret tempor relat collect point time view illustr assum schema instanc denot sequenc index time state relat time state shown empti view de ne wide rang oper di erenc pn vt de ned sequenc regular di erenc write examin algebra relat di notion expand statement queri queri languag definit nontempor data bi bi ql bi bitempor data model data model bi snapshot reduc respect data model ql bi ql bi bi ds bi tt vt bi tt vt bi bi bi tt vt bi tempor statement modi er snapshot reduc impli queri express nontempor exist queri bi tempor db bi time bi reduc observ bi snapshot reduc respect pose syntact restrict bi make bi di erent bi involv undesir obtain straightforward extens requir bi syntact similar definit nontempor bitempor data model bi bi ql bi data model bi syntact similar extens model data model bi snapshot reduc respect data model exist queri bi ql bi snapshot reduc respect queri ql syntact ident qs string empti extens term syntact ident snapshot reduc extens string term statement modi er chang semant entir statement tempor data model treat tempor relat type syntact construct bi queri nontempor tempor relat type argument relat determin mean construct tempor upward compat sati global imposs achiev extens tempor upward compat syntact ident sati tempor queri evalu result consist evalu syntact nontempor queri state argument tempor produc state output relat evalu tempor queri easili formul understood appli modi cation statement integr constraint prepend statement statement modi er seq detail section modi er tempor dbm evalu statement sequenc semant dimens term view collect snapshot explan follow statement illustr varieti sequenc statement human resourc applic seq vt select seq vt select salari eid snodgrass seq vt select id exist salari eid creat tabl posit id integ seq vt primari posit rst queri simpli return tupl valid correspond return content state request timestamp seq remain queri assum tabl salari alter content id bob pam pam sarah salari id amt queri join salari state amount tempor natur join return result evalu state interv result intersect interv intersect return instant input queri evalu state perform variat tempor di erenc modi er seq vt dbm comput di erenc return conceptu evalu statement state subtract interv interv interv statement de ne tabl posit requir column id primari id primari kei state necessarili posit content posit id posit consist state primari kei ad posit leav consist ad violat primari kei time exampl illustr statement easi write simpli convent sql statement addit tempor statement modi er pre sql vt natur statement dicult write statement modi er skill sql programm dicult formul simpl exampl pure sql extend nition applic queri underli nontempor queri languag extend queri explicitli refer time similar queri seq vt seq vt select eid select salari salari eid sid eid sid overlap period queri left constrain tempor join tupl valid time overlap period condit evalu individu nontempor relat state timestamp present state tempor join conceptu nontempor join evalu addit predic queri comput tempor join return origin valid time semant queri fall snapshot reduc origin valid time present nontempor relat state dbmss gener provid predic function time appli valid queri natur enlarg applic seq vt modi er statement includ predic function valid transact time er higher orthogon wider rang tempor support extend requir presenc explicit time refer chang evalu mode rest statement queri explicit time refer replac unit period period result evalu db model addit explicit time refer evalu unit period definit ql nontempor data ql extens model extend extens queri ql hold ql ii extend enlarg scope statement answer snapshot tempor isol import nontrivi extens direct longer de ne semant pure term individu snapshot semant statement de ned explicitli snodgrass statement includ function predic timestamp de ned section interv preserv coupl snapshot reduc nition syntact similar nition properti guidelin semant syntact emb tempor function languag limit extend adopt view interv data conveni time secur support view view research view arti cial intellig research interv atom valu split merg chang mean data distinguish distinct relat snapshot mean separ result queri gener result snapshot di er result tupl timestamp simpl fhx result fhx hx section delv issu favor result permit illustr issu di erent di erent mean user june decemb evalu alloc past month bob perform judg set rst half left relat bonu id amt id amt relat spite di erenc relat context snapshot reduc relat view collect nontempor relat impli exact nontempor relat distinct di erent mean term import applic di erenti snapshot di erenc relat coalesc tupl tempor relat interv timestamp candid coalesc ident explicit attribut valu adjac overlap timestamp tupl wai tupl store updat oper enforc coalesc due ecienc queri evalu coalesc tempor relat produc result formul speci design desiderata timestamp tupl tempor statement modi er queri possibl mind requir result coalesc solut attract de ne canon tempor relat potenti disadvantag timestamp tupl store preserv time uniqu coalesc relat exist demonstr section timestamp origin enter approach faith inform enter user er control move maintain semant timestamp system user advantag statement modi er accommod languag default preserv coalesc default sequel de ne interv preserv intuit requir timestamp chang assum valid time relat auxiliari notion tempor relat snapshot se point time snapshot ident tupl explicit attribut ident tempor element nite union interv rst de ne auxiliari output requir argument maxim impact tupl queri illustr de nition seq vt select exist definit sequenc explicit attribut valu output point formula argument tupl queri set time point result tupl output point de ne set time point result tempor queri includ output point de ned queri class queri individu assum queri seq vt run famili set output point de ned term individu snapshot vt vt snodgrass vt argument tempor relat time instant return relat dimens relat tupl valid time tupl valid time includ time point valid time formal de nition found appendix db set output point step set requir argument tupl potenti result tupl requir argument minim subset argument tupl output point includ time point definit argument argument sequenc attribut interv subset argument requir result tupl determin proper subset line state result interv subset set output point consid interv subset tempor element time point line requir output point requir argument tupl includ point result interv point introduc line ensur set requir argument tupl minim result tupl hold true equal interest relationship maxim output interv rst relationship illustr reason requir argument tupl de ned subinterv tempor element assum scenario tempor statement modi er requir argument hold properti requir argument tupl long result combin multipl argument tupl fourth relationship illustr combin rst singl set maxim impact tupl interest requir argument tupl definit impact argument sequenc attribut time requir argument tupl maxim impact tupl enlarg relationship de ned maxim impact tupl subset relationship de ned requir argument tupl line exclud requir argument tupl permit larger result interv ensur result tupl maxim set requir argument tupl line exclud result tupl construct combin independ requir argument tupl hold true concept develop de ne notion interv preserv definit queri interv preserv argument queri coincid maxim impact set maxim impact tupl result consist interv preserv result coalesc result interv preserv snodgrass interv split interv preserv sequenc statement attract provid speci tempor semant base view sequenc state queri di erent semant express sequenc queri ensur queri necessarili constrain sequenc semant definit tempor queri languag er statement manipul timestamp regular tempor semant vice versa avail statement standard nontempor semant import context migrat user expect semant nontempor languag requir ensur user paradigm familiar increment adopt featur theoret variant tempor languag tempor strictli express rst order logic languag explicit refer languag modi er vt signal standard sql semant full explicit control timestamp term result statement choic term discuss modi er set vt rang convert nontempor tabl interv data tempor tabl vt select eid salari eid creat tabl creat view set vt select id queri join salari join perform snapshot requir valid time valid time salari result nontempor tabl tabl nontempor tabl explicit period column hand tempor view interpret column implicit timestamp rang speci cation cf section explicitli set valid time view situat introduc section applic store inform convent date time attribut applic programm de ne tempor ectiv tempor statement modi er convert relat tempor order util tempor semant timestamp encod nontempor tabl great varieti approach provid tempor support legaci applic manag data solv queri languag requir tool applic develop de ne tempor view simplifi legaci queri statement referenc view unlik statement er er complet control akin program assembl hard queri languag provid set function predic express tempor relationship perform manipul comput timestamp result construct easi integr requir level predic function appli statement modifi languag previou section motiv de ned desiderata make restrict assumpt properti queri languag data simpl exampl illustr describ constrain languag design space demonstr practic util statement modi er meet desiderata speci section develop design tempor languag concret context complex languag widespread statement modi er restrict speci languag global impact design space upward compat dictat tempor languag statement includ tempor featur data type interv durat valu languag interv keyword chosen interv data period tempor extens contend facil nest null valu facil construct period extract provid host predic data type appendix order satisfi tempor upward statement work tempor relat nontempor detail previou section achiev modi cation statement tempor relat modifi current futur state relat constraint snapshot state argument tempor relat current valid time evalu exist syntact similar snapshot reduc tempor counterpart queri ect design append xed text modi tempor queri seq vt valid time seq tt transact snodgrass tempor view sequenc nontempor semant sequenc queri speci technic de ned queri formul default semant formul wider rang queri applic programm complet control timestamp manipul ag vt tt queri default semant built queri languag timestamp tempor relat made queri explicit attribut util statement modi extend domain speci make restrict part argument tupl consid queri time period add rang speci cation speci cation timestamp result tupl ad detail design desiderata shape design tempor extens sql discuss move detail level good design practic gener guid design extens statement level rst question associ modi er di erent kind statement queri integr modi cation statement section simpli requir statement modi er begin end statement appli statement possibl posit statement modi er di erent type statement provid syntax extens focu tempor extens omit detail termin form quotat mark form deriv standard nontermin form omit yield origin product tabl de nition extend permit declar bitempor tabl view de declar cursor statement modi er outermost queri express augment de nition nontermin scope semant impli statement modi er part queri includ nest except deriv tabl express tempor statement modi er discuss section statement modi er queri express deriv tabl express motiv deriv tabl meaningfulli comput independ remaind queri put di deriv tabl express scope replac view auxiliari deriv tabl express individu statement modi er note deriv tabl di erent subqueri subqueri correl main queri evalu independ separ modi er subqueri statement modi er front assert augment nontermin tabl column constraint syntact shorthand assert statement modi er front tabl column modi er front modi cation statement statement modi er start syntax statement discuss mean mean statement modi er natur divid orthogon speci cation core speci speci speci cation coalesc discuss core semant defer domain rang speci cation coalesc section type modi er determin core semant tempor statement type modi er appli orthogon valid transact time modi er miss modi er time dimens valid dictat upward compat underli argument relat support evalu tempor upward snodgrass compat dictat time dimens present result queri seq keyword present time evalu consist sequenc semant dictat time dimens time dimens present queri result keyword signal semant timestamp process semant enforc dbm ect time dimens present queri result modi time explicit attribut includ result similarli explicit attribut time case lead total kind summar tabl di erent order modi er semant syntax semant vt tt seq vt seq vt seq tt seq tt seq vt seq tt seq seq seq vt tt seq vt seq tt seq vt tt tabl basic usag statement modi er speci cation statement modi er speci cation time domain period constant vt tt keyword restrict part valid current respect period domain restrict appli prior evalu preprocess step statement seq vt period select salari eid creat tabl seq vt period primari kei domain restrict queri interest fact valid restrict integr constraint period speci primari kei constraint enforc time time tempor statement modi er valid valid time time rang set vt transact time semant forbid kind user interact time rang set evalu queri vt set vt select salari statement join valid time result tupl set period cover valid time input includ time point coalesc coalesc merg tupl overlap adjac timestamp ident attribut valu singl tupl coalesc level modi er syntact coalesc oper permit directli relat coalesc instanc consid rst statement coalesc result sequenc queri coalesc relat condit evalu maxim valid time vt select seq vt select vt select ce semant coalesc depend type relat appli nontempor relat coalesc relat coalesc valid time true relat singl time coalesc merg tupl overlap adjac time period mean straightforward aspect coalesc studi semant coalesc bitempor relat subtl overlap adjac time region tupl merg gener overlap rectangl coalesc singl mean result tupl gener result rectangl maxim valid time transact time figur exempli es bitempor coalesc rst pictur displai rectangular shape de ned timestamp tupl pictur illustr basic coalesc coalesc transact time coalesc valid time basic oper combin snodgrass tt vt tt vt vt tt tt vt tt vt fig di erent form coalesc mean rst coalesc transact time valid time exempli ed sequenc coalesc oper matter sequenc result maxim result maxim period formal semant previou section show statement modi er gener nontempor queri languag includ tempor manner sati es desiderata state section approach exempli ed amen nontempor queri languag desiderata impli speci syntact impli speci semant interestingli impli extend exist implement origin nontempor queri languag support augment tempor languag start nontempor queri languag deriv tempor includ semant implement detail depend underli examin augment process tempor extens present previou section tempor semant construct temp express term semant construct sql similar semant tempor extens languag temp express term underli case express semant term standard relat algebra current util algebra oper vt tt sn vt sn tt convert tempor relat convent relat sequenc gener relat algebra oper sequenc vt tt bi ect semant appli approach procedur implement nontempor queri languag arriv implement tempor extens demonstr statement modi er amen de nition semant translat tempor statement relat algebra express translat relat algebra express consist part rst step translat construct level function predic step straightforward discuss rst section step translat statement translat statement enhanc statement modi involv tempor statement modi er cover subsequ section construct timestamp manipul tempor queri languag gener de ne varieti construct manipul timestamp type includ constructor creat instanc timestamp extractor extract constitu part predic oper creat timestamp exist construct exist literatur pp easi de ad construct languag local ect languag design de ne small number construct assum common timestamp timestamp attribut repres valid transact lead de nition appendix includ relat algebra select predic straightforward adapt de nition di erent base period data type evolv part standard queri express de ne mean tempor queri express translat ned algebra express introduc notat algebra express tt denot tupl variabl rang bitempor vertic doubl bar separ explicit attribut implicit tt denot valid time transact de auxiliari oper relat turn timestamp explicit attribut de ned formal appendix overload appli bitempor variant valid transact time oper tp select tupl argument relat timestamp overlap time point tp time dimens select omit result relat return argument tupl overlap period timestamp result tupl intersect tupl origin timestamp snapshot oper sn turn time dimens explicit attribut oper implement attribut explicit convent tabl semant core statement tabl evalu standard relat algebra express correspond evalu algebra express sql nontempor relat algebra oper replac tempor relat algebra oper vt vt vt algebra de ned section due space queri select statement map ve basic algebra oper approach gener type snodgrass tt vt tt vt vt tt tt vt tt vt tt vt tt tt vt vt tt vt tt vt tt vt seq tt bi vt tt tt sn tt vt seq tt tt vt sn vt vt tt rn tt vt sn tt vt tabl core semant modi cation view de assert integr constraint exampl illustr map tempor extens augment algebra argument relat assum bitempor start current term select salari eid sid queri de ned relat algebra express temp tt vt tt vt note map queri relat algebra chang innermost portion bitempor tabl render nontempor timesl valid transact ensur tempor upward compat queri term queri vt select salari eid sid tempor statement modi er queri de ned relat algebra express temp sn vt tt sn vt tt tempor predic select view syntact shorthand standard select condit tabl addit relat vt tt evalu mode valid time tempor upward compat evalu mode transact time term sequenc valid transact time seq vt seq tt select salari eid sid de ned tempor relat algebra express temp bi bi bi superscript translat queri relat algebra express remain standard domain rang speci cation restrict constrain argument relat queri tupl valid speci part tupl intersect restrict consid queri formal tabl vt temp vt temp vt vt tt temp tt temp tt tt tabl de nition restrict time modi er vt rang period determin valid time result tupl di erent situat core statement seq vt statement automat comput valid time replac result evalu speci cation core prepend set vt rang result valid time result core statement return result type result chang valid time tupl result evalu rang detail tabl snodgrass vt rang temp temp temp evalu nontempor relat temp temp evalu relat tt temp temp evalu relat tt tt temp temp evalu bitempor relat tabl de nition speci cation coalesc queri return tempor relat coalesc de ne denot tempor queri queri return modi ed return coalesc version relat obviou result hold replac valid time transact time queri return bitempor coalesc valid transact combin tabl de nition repres version algebra coalesc de ned shortli coal vt temp temp evalu relat coal bi vt temp temp evalu bitempor relat coal tt temp temp evalu relat coal bi tt temp temp evalu bitempor relat tabl de nition coalesc tempor relat algebra provid map tempor extens sql combin convent tempor relat algebra step de ne algebra oper occur express codd relat algebra tabl predic gener project function roughli correspond select list statement tempor statement modi er ft ft ft ft ft tabl nontempor relat algebra tempor relat algebra gener nontempor relat speci tempor oper snapshot reduc nontempor counterpart section presenc construct explicitli refer time section tempor oper interv preserv section desiderata tabl signi cantli constrain design tempor relat algebra figur de nition version tempor relat algebra version omit di erenc tempor oper perform attribut attribut de nition function intersect predic overlap de ned tabl symbol denot tupl concaten vt vt vt vt overlap vt overlap tabl algebra complex oper tempor di erenc gener tupl requir determin result tupl tupl illustr figur line de nition tabl vt fig di erenc snodgrass identi es potenti start point period result tupl result period start period tupl start period tupl end line identi es potenti end point period result tupl line de nition exclud result elimin meaningless combin start end tupl excess period oper nontempor counterpart coalesc special destroi timestamp order enforc coalesc merg overlap adjac illustr figur de ned vt fig coalesc relat coal vt tupl introduc rst line serv de ne start end point coalesc speci ed line fourth line ensur gap ensur tupl start time extend exist tupl valid time start time line ensur valid time result tupl exist tupl comput arbitrari transit closur coalesc time linear bitempor relat algebra natur extens algebra time dimens handl mean rectangl period consid chang basic add complex de found appendix note care end point valid transact timestamp de ning time point precondit ecient execut oper properti statement sql evalu syntax semant tempor statement modi er appli argu extens sati es compat tempor statement modi er reduc properti introduc section breviti avoid tediou cover dimens compat respect ful lled design approach adopt de ning syntax semant syntax extend syntax construct languag legal statement approach de ne semant make straightforward verifi statement retain origin semant speci rst de nition tabl cover ascrib statement convent semant appli relat upward compat respect ensur rst de nition tabl de nition includ statement evalu tempor ascrib statement convent semant current state note care ensur de nition modi cation statement detail appli tempor relat respect de nition languag de nition constrain di erenc sql queri syntact similar snapshot reduc tempor queri xed string statement modi prepend append sql xed string section speci calli depend queri hold languag design carefulli appli statement modi er convent statement requir appli sequenc queri includ function predic timestamp section function timestamp project list predic timestamp accommod tempor algebra vt vt oper bitempor ensur timestamp retain tempor cartesian product oper demonstr oper remain snapshot turn question shortli preserv requir timestamp left unalt modi cation requir set output point de ned section relat mean queri result coincid maximum impact tupl proven requir timestamp regular convent data access tempor semant section speci calli sn vt sn tt function tabl provid set vt semant tabl provid util statement modi er extens statement modi er sati es desiderata list tabl snodgrass examin extend detail recal de nition snapshot reduc nition rst show relat algebra properti respect relat algebra theorem relat algebra sati es reduc properti respect relat algebra vt tp vt vt tp vt tp vt vt tp vt tp vt vt tp vt tp vt tp vt vt tp vt tp vt tp vt vt tp vt tp recal denot time project hold arbitrari restrict rst refer explicit attribut relat union compat fth denot attribut proof properti found appendix di erenc oper snapshot reduc nontempor counterpart algebra statement involv oper snapshot reduc algebra statement obtain simpli remov vt superscript involv cartesian product reduc nontempor cartesian straightforward de ne snapshot reduc tempor cartesian chosen de nition violat snapshot reduc explor design note tempor cartesian product retain implicit attribut argument relat turn explicit attribut oper introduc elimin attribut map tempor queri algebra exploit standard map map sql queri relat algebra queri seq vt select map queri vt vt durat ion vt vt tempor statement modi er de nition cartesian timestamp argument tupl retain explicit referenc project cartesian product make imposs construct correct express tempor project oper inform requir evalu predic lost observ hold tupl timestamp homogen timestamp data model approach retain simpl map retain snapshot reduc tempor cartesian product introduc addit cartesian product produc result implicit valid time note return result relat break properti algebra approach adopt algebra data model includ reduc approach introduc join de ned snapshot reduc transform sql tempor algebra result express vt vt durat ion ad complex oper problem access valid timestamp join origin valid time tupl infer result join cartesian valu readili tempor algebra oper snapshot reduc respect nontempor cartesian product concurr product oper cartesian product refer simpl binari tempor cartesian product de ned permit standard map sql algebra restrict content select speci oper lead violat sql cartesian product speci ed queri speci cation tempor queri result evalu includ implicit attribut argument tupl explicit attribut select time dimens default select expand includ implicit time attribut addit explicit time attribut result cartesian product properti presenc subsequ project oper de ned timestamp data model unlik tempor cartesian product cartesian product oper reduc nontempor cartesian product possess de cienci snodgrass interv preserv theorem relat algebra interv vt vt vt vt vt vt vt vt vt vt proof start select output point de ned select oper figur vt tupl sati es condit show maxim impact tupl formula form vt requir argument tupl timestamp maxim impact tupl timestamp requir argument tupl ident vt situat timestamp maxim impact tupl smaller timestamp requir argument imposs line de nition vt situat timestamp maxim impact tupl larger timestamp requir argument imposs line de nition vt situat requir argument imposs line de nition combin argument tupl yield larger result line de nition argument tupl uniqu contribut point result tupl sati es select condit result tupl vt maxim impact tupl vt vt interv preserv project union exhibit requir argument tupl timestamp tupl timestamp maxim impact tupl ident oper interv preserv maxim impact tupl cartesian product formula vt fhx fhx requir argument tupl consist left argument relat timestamp tupl timestamp result tupl intersect timestamp requir argument tupl result tupl vt maxim impact tupl cartesian product interv preserv maxim impact tupl di erenc formula form vt set requir argument tupl consist tupl rst argument relat set tupl relat overlap tupl rst relat subtract interv timestamp tempor statement modi er tupl relat interv timestamp rst relat yield set interv interv timestamp maxim impact tupl tupl rst argument relat consid individu interv tupl split requir tupl di erenc interv preserv relat work section cover relat work statement modi tempor sql extens queri languag requir queri languag requir author phrase wide context found de nition encount tempor relat aim satisfi requir similar tempor upward compat languag introduc notion classic system user type system user full tempor classic user current snapshot applic classic individu statement issu independ made essenti number design made yield tempor upward compat sql extens formul notion fundament notion snapshot reduc inspir inform concept present context chronolog languag formal process solv identi ed problem goal develop part languag desiderata interv extend studi author theoret aspect interv preserv subject statement modi er tempor statement modi er repres approach ad tempor support exist languag primit form statement modi er chronolog tempor extens languag earlier spring work paper chang submit part cite chang evolv extens interact ansi iso standard interact led syntact semant aim make context peculiar snodgrass exist tempor extens sql complet coverag relat evalu exist tempor sql includ relat design statement modi approach report complianc desiderata claim document prove sql turn chronolog order uc sati ed detail studi found extend sql speci cation queri time aspect extens includ default option de ned syntact queri omit tempor portion retain standard mean sql select oper de ned concern design larg part respect statement form select violat return relat support process restrict overwritten state make interv preserv superset extend move window sati es adequ default mention restrict coalesc relat instanc break interv preserv enforc superset sql retriev facil enhanc facil coalesc coalesc concurr timesl unfold concurr product snapshot reduc semant join set di integr constraint design reason achiev complet satisfact interv preserv support limit support tempor data tempor upward compat statement restrict current properti sati ed process tempor treat time special trivial interv preserv extens sql de ned relat attribut valu tempor partial function time domain tempor express extract time domain attribut valu promin featur tempor express express statement extend time domain tupl discuss sati ed classic user current state relat classic user access past state relat made system full applic break support restrict set oper tempor semant automat tempor statement modi er violat interv preserv support gener interv data sql extend reformat normal reformat sequenc unfold fold convert set interv set constitu vice versa normal oper syntact abbrevi reformat coalesc relat reason satisfi support provid interv preserv preserv unfold interv boundari lost unfold design illustr carri predecessor statement modi er deduct languag includ reduc achiev achiev interv preserv emploi syntact default add valid timestamp result valid omit intersect semant assum return relat retriev nontempor select snapshot speci ed sati es relat return subqueri violat interv preserv coalesc instanc enforc oper implicit tempor semant set oper appli tempor implicit timestamp render explicit util instant timestamp achiev sequenc semant author state liter follow compat easili achiev simpl syntact manipul sourc queri ad tag distinguish compat statement modi er discuss present paper extend sati ed interv directli access queri interv preserv timestamp speci ed chang submit sql standard describ earli work tempor statement modi er design ful ll interv preserv timestamp snapshot reduc queri left ed de nition languag achiev statement extend sati ed sequenc modi er appli statement explicit refer time dimens summari research direct paper discuss extend exist queri languag tempor statement modi enabl languag manag inform start de ning number syntact semant motiv enabl tempor queri snodgrass guag contend legaci permit coexist nontempor tempor exploit programm exist nontempor languag extend desiderata independ queri languag exist tempor languag sati es desiderata paper rst formul requir combin salient featur tempor languag tempor upward salient featur nontempor languag paper explor exempli es desiderata shape tempor extens statement modi extens make adopt approach de ning lead de nition tempor queri languag cover core advanc languag integr data de coalesc languag support point interv preserv default introduct statement modi er make obtain process semant approach statement modi er prefer syntact tempor extens statement modi er ensur avail tempor support statement modi er appli arbitrarili complex obtain tempor process approach author achiev tempor support languag extens essenti independ complex underli nontempor languag extend paper illustr de ne semant tempor statement modi sql term semant sql map sql relat algebra bitempor counterpart standard relat algebra oper provid paper studi properti extend verifi languag sati es desiderata interest direct futur research appli approach nontempor queri languag odmg appeal start due preval practic gener statement modi er dimens time spatial dimens found spatial found data kind data model import challeng provid gener solut support speci semant dimens notion tempor upward compat assum exist dbmss extend tempor dimens dbm replac tempor dbm scenario exist exist record data bene tempor support provid time refer record timestamp attribut semant migrat applic code record time refer regular attribut work time refer captur special timestamp attribut remain open problem tempor statement modi er section tempor view er part fulli address problem requir sophist tool futur direct studi ecient implement techniqu current implement tempor sql illustr feasibl layer architectur architectur identifi bottleneck current technolog respect tempor applic nding prompt develop dbm algorithm implement function ned adt interest research topic speci function call affect statement modi semant function call depend tempor upward context acknowledg greatli contribut robert andrea steiner contribut formal interv bitempor proof theorem robert part earli work statement modi er andrea implement core part languag won kim extens signi cantli improv paper research support part swiss nation scienc danish technic research council grant chorochrono fund european commiss dg xii research contract grant nation scienc foundat grant refer allen maintain knowledg tempor interv commun tempor orient data model acm transact decemb jensen tempor data model intern confer data page februari ieee comput societi snodgrass notion upward compat tempor queri languag februari van benthem logic time kluwer academ gadia relat system inform loss ieee transact knowledg data februari jensen seamless integr time sql technic report aalborg depart mathemat institut electron fredrik dk decemb snodgrass snodgrass evalu complet recent advanc tempor intern workshop tempor page septemb berlin support legaci applic acm symposium appli page februari marti complet tempor queri languag intern confer tempor page juli manag tempor knowledg deduct phd depart eth soo coalesc tempor intern confer larg data page morgan kaufmann mumbai septemb object data standard morgan kaufmann san cli tuzhilin complet queri languag group histor data chapter page cli snodgrass semant acm transact june sql advanc sql program morgan kaufmann ceri gottlob translat sql relat sql queri ieee transact softwar april editor tempor research practic lectur note comput springer gadia weak tempor relat acm symposium principl gadia homogen relat model queri languag tempor acm transact decemb gadia seamless queri tempor data intern workshop infrastructur tempor june gadia tempor parametr chapter page van gelder topor safeti translat relat calculu queri acm transact june jensen dyreson consensu glossari tempor version page jensen snodgrass tempor data manag ieee transact knowledg data snodgrass unifi tempor model conceptu model inform lorentzo sql extens interv data ieee transact knowledg data melton inform tempor statement modi er melton inform snodgrass evalu relat algebra incorpor time dimens acm comput decemb melton simon understand complet guid morgan kaufmann san navath ahm languag interfac histori confer tempor aspect inform page navath ahm tempor relat model queri languag inform navath ahm tempor extens relat model chapter page gadia algebra optim relat model tempor intern workshop infrastructur tempor june snodgrass ahn taxonomi time acm sigmod intern confer manag page sarda algebra queri languag histor data model ieee comput februari sarda histor queri chapter page steiner ad valid time ansi chang dbl steiner ad transact time ansi chang dbl steiner transit tempor support page updat reconsid architectur model data base manag system north holland publish snodgrass algebra chapter page snodgrass tempor queri languag tquel acm transact june snodgrass tempor statu research direct acm sigmod decemb snodgrass overview chapter page editor tempor queri languag kluwer academ snodgrass develop applic sql morgan kaufmann san cli snodgrass tempor implement publish redwood layer implement tempor techniqu intern confer system advanc dasfaa april lochovski data model softwar seri snodgrass toman queri tempor tempor logic advanc technolog intern confer extend volum lectur note comput page march toman tempor extens sql ecient implement page wiederhold write schema time orient medic record data bank technic zicari advanc system morgan kaufmann san appendix predic function timestamp tabl overview construct timestamp manipul tp possibl denot time point type timestamp time durat type interv shorthand period tp tp gran denot granular syntax semant tp temp temp temp temp temp temp temp temp temp meet temp temp gran temp overlap temp temp temp temp temp temp temp temp temp temp iv temp temp temp temp temp gran tabl de nition construct timestamp manipul tempor statement modi er auxiliari algebra oper tabl de ne auxiliari oper relat turn timestamp explicit attribut unlik algebra oper de ned oper overload appli bitempor mean type argument determin oper perform properti exploit de ne semant core statement tabl function semant nontempor relat vt tp tp und tt tp tp und tabl oper nontempor relat function semant relat vt tp overlap tt tp vt overlap tt sn vt rg sn tt function semant relat vt tp tt tp tt overlap vt tt tt overlap tt sn vt sn tt tt rg function semant bitempor relat vt tp tt overlap tt tp tt tt overlap vt tt tt overlap tt tt tt tt overlap tt sn vt tt rg sn tt tt tt rg tabl snapshot oper tempor relat function variant valid transact time version rst vt tp select tupl argument relat timestamp overlap time point tp time dimens select present result relat valid time support function ident function return argument tupl overlap period timestamp result tupl intersect tupl origin timestamp snapshot oper sn turn time dimens snodgrass explicit attribut oper implement level attribut explicit bitempor relat algebra algebra natur gener relat bitempor algebra natur gener sati es snapshot reduc properti di er algebra deal bitempor rectangl period bitempor set cartesian product figur straightforward extens bi tt tt tt bi tt tt tt bi tt tt tt bi tt intersect tt overlap overlap bi tt candid tt fig bitempor algebra bitempor di erenc substanti complex de ned term auxiliari predic idea oper de nition illustr figur larg rectangl solid frame repres time region black rectangl result di erenc bi set eleven white rectangl identi ed dash solid line combin fig bitempor di erenc tempor statement modi er determin time line plai crucial role split de ning result tupl determin time line start vertex extend block reach border de nition figur identi es requir result tupl time coordin deriv time coordin overlap determin line de ne time coordin predic candid tt tt ensur tt satisfi restrict respect tt tempor overlap predic overlap tt ensur determin time line de ned cross time tt tt formal de nition predic found nal oper coalesc bitempor relat coal bi tt maxim period illustr figur ve white rectangl illustr time ve tt vt fig transact time coalesc bitempor relat tupl relat grai tupl tupl result coalesc transact time coalesc ensur maxim dimens coalesc dimens coalesc bitempor relat coal bi vt di erenc role valid transact time formal de nition coalesc bitempor relat proof theorem prove theorem sequenc turn de nition figur tabl substitut algebra express prove snodgrass vt tp vt ft overlap vt tp ft overlap tp show de nition rst exploit commut conjunct rewrit overlap tp overlap formul theorem disallow predic vt tp vt ft overlap vt tp ft overlap tp di erenc respect select deal project select predic commut term observ omit argument disallow make vt tp vt ft overlap vt tp vt tp ft overlap overlap transform rst formula disjunct normal form prove cartesian vt tp vt ft ht ht overlap overlap vt tp vt tp ft ht overlap tp ht overlap usual initi reorder term left proof overlap overlap overlap overlap formula turn overlap overlap tp overlap overlap tp period cf tabl tp tp tp tp tp rewrit formula overlap tp overlap tp period cf tabl tp tp tp tp tp tp tp tp order rewritten formula ident tempor statement modi er di vt tp vt ft vt tp vt tp ft de ned overlap overlap de ned overlap overlap prove set show de ning formula prove implic turn proof found
DB/462 3 materi horizont partit view abstract ci school comput canada receiv receiv form januari accept april data view typic store larg aggreg tabl base subset dimens attribut main data fact tabl aggreg view store data cube attribut method select data cube view materi order speed queri accommod storag space constraint reduc mainten cost paper method select materi select horizont fragment recomput size store partit view decid view select ó elsevi scienc bv reserv data perform introduct data knowledg engin support system busi execut requir analyz snapshot period time organ store comput hardwar softwar platform check store appl macintosh pc system save account store ibm exist underli manag system depart straight entiti check repres male bank custom andrew custom gender save repres custom sex make ongo discuss easier fig show simpl sourc bank relat sourc handl save account accept custom deposit withdraw account sourc handl check account function ext front matter ó elsevi scienc bv reserv ci data knowledg engin fig bank sourc accept custom deposit withdraw cash check account save check record transact custom account minut dai undergo frequent updat result custom transact account balanc consist simpl queri adequ answer sourc custom save account accept deposit custom account account john andrew type queri desir bank support custom manageri data convent adequ truth busi manag wai gain competit advantag make busi goal achiev learn custom interest learn bank branch attract custom account branch bring cash bank learn custom busi execut interest pose queri list total daili balanc close custom branch account period year clear type complex queri answer sampl sourc store current data previou account balanc overwritten transact updat avail histor record list total balanc custom branch queri requir sourc branch account depart visit local transact data wareh system provid solut store summar data establish data wareh system singl data repositori integr inform data sourc relat html common relat data schema design call star schema star schema accommod main integr data main tabl call fact tabl attribut fact tabl main aggreg attribut foreign kei addit fact star schema includ dimens tabl valu dimens attribut function determin foreign kei fact tabl avail collect call data wareh busi maker tool plan futur core data includ onlin analyt process tool data mine applic queri applic chaudhuri dayal argu data wareh technolog successfulli appli includ retail store health care simpl fact tabl integr check save sourc present fig dimens tabl acronym stand dimens attribut acronym repres tabl attribut fact tabl dimens tabl custom account time fact tabl integr transact type account maintain uniqu dimens hierarchi dimens tabl analysi describ foreign kei attribut analysi progress present summar lowest level detail gener level comput total amount monei deposit minut check total amount deposit month analysi comput aggreg gener progress present detail level data cube relat olap tabl data cube aggreg repres data cube label label cart aggreg total amount monei involv transact custom transact type minut label comput total amount monei transact fact tabl correspond sql creat view select sum ci data knowledg engin mean view cart total amount monei group view total amount monei group attribut store data cube tabl fast queri process produc accept result view huge store view mainten cost ci data knowledg engin view store al greedi algorithm select set data cube materi order reduc time answer queri storag space argu approach improv perform aggreg view partit formal algorithm present view select partit initi preliminari studi problem discuss relat work grai al data cube model gener sql groupbi construct comput level aggreg measur data cube extend sql construct creat data cube tabl consist aggreg measur total amount dimens attribut fact main cube aggreg view foreign kei foreign kei attribut dimens hierarchi attribut describ analysi dimens hierarchi time main cube time record minut hierarchi tabl attribut foreign minut hour dai month year work techniqu cientli comput data cube includ express depend cube view dimens hierarchi lattic framework greedi algorithm select set view materi greedi algorithm fig select view set comput sum descend view descend view cardin view smallest view comput bw ˆ gupta al extend greedi algorithm select view index uniform scheme base cost model select view index uniform scheme extend handl dimens hierarchi ceri al ozsu valduriez present horizont fragment idea scheme relat base simpl predic queri access frequenc horizont fragment view relat partit view base valu attribut fragment subset tupl view relat work includ express data partit scheme data aggreg materi problem issu mainten materi view address blakelei al colbi al kotidi roussopoulo fig greedi algorithm view mainten solut relev materi view view mainten issu relev horizont materi view address motiv contribut advent data wareh busi depart branch built maintain applic hardwar softwar platform branch write separ extract program popul data sourc histor version analyz record transact branch period year entail write applic capabl visit branch histor type integr chang oper environ branch call support applic branch run hardwar softwar make support applic complex unsuccess visit answer queri cient sourc local transact data wareh emerg mean integr sourc resid relat html document knowledg support queri olap queri complex volum data larg make queri mainten cost disk space util import wareh issu carefulli select cientli partit view materi improv queri mainten cost disk space util paper contribut present algorithm iter select data view fragment view recomput size partit view futur view select newli comput size compon collect inform calcul size select partit view present result experi approach discuss method materi select view set horizont fragment site issu distribut fragment site focu work origin view approach fragment comput fact tabl data cube view approach aim reduc queri time reduc number row view visit order answer queri view fragment approach reduc mainten cost view fragment fragment view access mainten oper insert outlin paper ci data knowledg engin section present work techniqu base simpl bank wareh system demonstr view queri section present system design architectur displai softwar data compon design section present suit algorithm system design ci data knowledg engin implement view select materi techniqu section discuss perform analysi section present work section show cube aggreg view horizont queri access pattern horizont fragment select materi view recomput size view set fragment materi view select answer queri formal algorithm involv process present section bank data store integr record bank transact bank custom execut bank account branch data fact dimens custom account time domain cid domain deposit withdraw balanc displai sampl fact tabl data fig tupl tabl hold million row typic time transact place record dai minut digit time repres minut hour queri tabl number custom made withdraw save account month fig sampl fact tabl data view ci data knowledg engin queri attribut compon partit attribut analysi attribut measur attribut partit attribut attribut involv sql version queri analysi attribut involv measur attribut aggreg interest step approach simpl predic partit attribut simpl predic form identifi aa ma pa identifi set simpl predic queri attribut pa ˆ aa ˆ month cid ma ˆ number count predic ˆ number custom deposit monei morn minut attribut predic pa ˆ aa ˆ ma ˆ number custom find total amount dollar involv transact type account code minut dai pa ˆ aa ˆ ma ˆ total amount dollar sum find total amount dollar deposit custom minut account pa ˆ aa ˆ custom time ma ˆ total amount dollar sum ˆ cube lattic fig dimens hierarchi fig typic administr face select number aggreg view main cube level dimens level view dimens level view obtain direct product cube cube view dimens hierarchi queri dimens attribut custom dai join cube level view dimens hierarchi interest answer queri cut cost huge ci data knowledg engin fig cube lattic cart fig dimens hierarchi cart tabl dimens level view select materi predic queri attach import predic frequenc applic access intuit import predic make fragment view ip import predic respect view multipli cardin predic row view true appli view applic access frequenc number time predic access predic access sum access product applic access predic make predic ip assum queri access time read sampl fact tabl similar view cart respect view respect view ip ˆ ˆ ip ˆ ˆ ip ˆ ˆ ip ˆ note usual predic access queri applic access view ci data knowledg engin ip valu predic current scheme simpli select highest valu administr determin constitut optim number fragment view depend number factor includ size view attribut select predic predic result delet elimin redund chakravarthi al enum algorithm determin optim set vertic fragment relat set queri access fragment access frequenc enum algorithm comput perform number vertic fragment relat object function call partit evalu pe measur amount local irrelev remot relev access made vertic fragment queri enum algorithm proce comput pe relat comput pe relat vertic optim number vertic fragment suitabl relat queri workload set vertic fragment yield lowest pe extens pe measur determin perform vertic fragment object class distribut object system present pe measur approach extend obtain number fragment view yield perform set queri number optim predic combin determin log log predic creat maximum fragment horizont fragment process mean list predic combin fragment techniqu creat fragment predic calcul pe set horizont fragment predic optim number predic suitabl environ yield lowest pe fragment pe set horizont fragment object function count total local irrelev remot relev access made fragment queri access fragment view optim desir minim local irrelev remot relev access set fragment lowest pe yield perform predic creat set fragment constitut optim predic view queri setup comput administr simplifi techniqu intuit select predic base size view ip valu predic bigger tabl higher number predic select predic creat maximum fragment initi predic fragment view recommend factor choic number predic high ip valu number predic high ip higher number select indic attribut frequent queri partit process view continu predic select step creat predic select simpl predic predic conjunct select predic predic negat form select simpl predic ci data knowledg engin ˆ ˆ ˆ ˆ respect domain form fragment view submit input fragment top level view select view materi inform includ greedi algorithm make futur view select discuss section fragment produc complet minim tupl origin view account fragment fragment scheme present access frequenc select predic determin import fragment set import predic user queri set predic complet natur negat form predic case predic emploi work predic fragment requir minim select import valu predic fragment work predic relev view question fragment process fragment creat complet complet minim set predic fragment mutual serv demonstr creat fragment complet minim tupl belong tupl found fragment relev top level view cart fig select tupl tupl cid give back total tupl tabl partit view top level simpl predic reappli cardin simpl predic view fragment serv select simpl predic relev view predic reappli view cr fig partit view yield cardin predic mean predic base attribut yield fig view cr creat view cart ci data knowledg engin cardin respect view cr predic select high ip valu view select top level view greedi approach view cart select horizont fragment view approach explain main advantag break tabl view horizont fragment drastic reduct queri time averag number row visit queri horizont lower recomput size select fragment requir comput averag number row view access queri fragment averag number row view access queri fragment comput sum product total number row fragment access queri queri access divid sum access frequenc queri access view fig show fragment view number frequenc total number row access queri size select fragment view comput method discuss previou futur select view accomplish greedi algorithm newli comput size view select view turn horizont fragment reduc averag number row visit queri improv queri time queri accur direct fragment adequ address paper algorithm compon call recommend set fragment select fragment view answer queri select view materi view set answer queri queri measur attribut analysi attribut view total number row fragment fragment view read predic fragment view mark conjunct predic queri subset predic fragment view cart run fig show predic fragment size predic queri part fig queri predic subset predic complet answer fig fragment view cart access queri ci data knowledg engin system design architectur fig fragment view cart fig fragment queri predic part object section present block architectur design techniqu paper block architectur highlight softwar data compon design fig relev understand algorithm section present section fig origin data made fact dimens tabl addit aggreg summari tabl work introduc major algorithm algorithm select view materi horizont fragment select view recomput size inform recomput size select view includ fragment view queri algorithm call determin fragment data cube view answer queri obtain total number row tabl search order answer number queri entail sum row fragment view queri averag number row view visit queri comput total number row divid total number access made queri access view output scheme smaller fewer summari tabl algorithm interfac queri access tool algorithm predetermin fragment view answer queri output queri result queri turn faster import algorithm carri execut time overhead algorithm run scheme polynomi time algorithm add huge overhead ci data knowledg engin fig system design architectur user queri access aggreg view vi made set analysi attribut set partit attribut pa set measur attribut ma analysi attribut user queri qi repres subject groupbi attribut interest applic partit attribut user queri qi subset record found view relev applic attribut set simpl predic deriv partit attribut measur attribut user queri qi aggreg attribut interest applic attribut queri union pa part ma attribut view set groupbi attribut view av view car ci data knowledg engin view set answer queri set view materi view adequ answer queri formal design algorithm section make formal present algorithm shown system architectur section discuss compon section discuss execut section present scheme section discuss scheme scheme scheme algorithm select view materi version greedi algorithm present algorithm begin select top level view data cube lattic select view horizont fragment function size horizont fragment view recomput function size view comput view rel partit view input process set queri frequenc access unit daili input view partit step involv partit view step find simpl predic user queri partit attribut simpl predic partit attribut logic oper set pg domain partit attribut jth partit attribut ith queri step rel ip predic queri qi import predic obtain ad product applic frequenc cardin predic view applic access predic formula obtain import predic frequenc number row tupl partit view predic mean queri qi access predic number time similar access frequenc qi step select import predic current scheme select highest valu predic step optim futur scheme decid produc outcom step gener horizont fragment view predic predic conjunct simpl predic natur negat form aggreg view vi set select simpl predic pri queri access set predic mi mi ˆ ci data knowledg engin ik fig algorithm ik ˆ ik natur negat form predic ensur complet view partit view loss tupl fragment feasibl domain data delet set object gener complet minim set formal algorithm fig partit algorithm call function partit select view formal present algorithm fig function call algorithm discuss formal subsect view select partit view select partit size view lattic member set recalcul parent size process continu view select view greedi algorithm size parent view appli view maximum select select scheme assum select view cart data section cube lattic view size shown fig origin size view shown view recomput size shown origin size view cancel size view insid ci data knowledg engin fig view partit algorithm view fragment size remain reason recomput view size yield origin size process fragment view result fragment fig show process select view greedi algorithm partit recomput size select view recal section recomput size cart ci data knowledg engin fig cube lattic size recomput fig view select partit parent view view cart top level view cube lattic select recomput size cart view lattic comput view set comput sum posit size smallest parent view descend view view smallest parent cart size descend cr view includ cr comput size cr view cr highest select time includ partit select view cr comput ip predic ip queri predic product cardin predic select data cube view answer queri access frequenc queri answer asterisk view fig select view chosen ci data knowledg engin cube view impli predic queri yield nonzero ip valu view comput compet choic import predic partit view view horizont select greedi algorithm newli comput size parent mean queri select view comput predic compet predic partit view cardin predic appli view cr ip valu predic select horizont fragment view fragment make size cr select view cr step view lead select view highest comput view time view cart cr descend view comput ca lower size yield total descend view comput view cr lower size contribut ca note select view case ca equal highest check ip valu select predic fragment view fragment view recomput size view scheme algorithm recomput size view basic recomput size view averag number row view access queri account queri access frequenc formula implement algorithm fig fig view algorithm view size ˆ measur size view term averag number row view access measur accur number row view access queri account access frequenc queri fragment view access altern measur maximum number row view access queri hide util access fragment entir view minimum number row access queri risk gain approach algorithm accept input set queri queri input includ predic fragment view question access fig section illustr procedur input total number row queri access fragment comput row count inform easili obtain sql queri select row fragment fig queri predic access fragment obtain total number row access fragment sql select union select product total number row access access frequenc queri comput sum access made queri access view obtain divid total access frequenc queri ceil size view algorithm ci data knowledg engin algorithm queri recommend fragment view produc fastest time queri algorithm perform analysi make maxim static materi view fragment applic frequent radic access pattern provid techniqu determin set horizont fragment materi view longer repres optim set due queri frequenc trigger dynam view work present perform static fragment view assum su cient call static view sequenc step execut order set fragment view answer queri discuss input scheme ma set predic ci data knowledg engin queri set materi view fragment fragment input conjunct predic size fragment number row view predic true step scheme step set view adequ answer queri view attribut queri concaten queri aa ma set aq ˆ set materi set attribut queri aq subset set attribut view made member view set attribut plai role queri set queri attribut subset attribut view comput queri give queri custom deposit monei morn queri aq concaten pa aa ma mean aq list data cube view setup form superset ct crt ct view set select materi horizont partit queri view set select partit section fig algorithm view cr make view set queri cart step view step determin compet view select answer queri chosen view requir scan fewest row order answer queri number row view scan determin sum cardin fragment visit order answer queri mean view requir fragment answer queri lowest total number row answer select view fragment scheme select view vj set fragment vj total number row fragment queri minimum formal algorithm solut fig perform analysi ci data knowledg engin experi conduct bank store sgi oracl experi conduct gener comput system call sgi challeng xl sgi challeng xl processor processor processor mhz processor mhz oracl dbm version run comput system data fact tabl million tupl creat gener data cube view version oracl creation view requir group attribut million tupl tabl view cat face reduc size fact tabl tupl enabl creation data cube view select partit experi fact tabl structur dimens attribut cid number null acc charact tran charact time charact amount number size fact tabl row row fact data cube view run sql select instruct group attribut repres view size view fig varieti queri experi cover type predic fig describ queri workload experi queri term cardin predic access frequenc run scheme perform system time averag cpu time run report algorithm present section greedi algorithm implement scheme run data cube sampl queri workload compar run greedi algorithm queri workload view select select scheme shown fig scheme store horizont fragment select view ci data knowledg engin fig view size fig queri workload fig view select approach monitor collect cpu queri time queri view select greedi algorithm compar time queri partit view obtain scheme fig show time fig show graphic comparison repres improv averag time achiev straight greedi algorithm scale size factor million repres real life situat approach size data experi repres limit resourc constraint complex algorithm ci data knowledg engin fig compar time approach repres number view cube lattic number view select comput time scheme maximum time comput time number queri access system queri maximum repres number predic highest ip valu select maximum number predic comput time maximum xq pt maximum number fragment view comput time algorithm fq mean scheme time complex time complex straight greedi algorithm execut iter term variabl ci data knowledg engin complex algorithm polynomi time algorithm variabl larg number run program execut time notic neglig agreement comput time extens basic model fig graph compar time basic scheme requir administr determin highest valu predic select horizont fragment select view exampl experi run cube level view real life environ requir dimens view index index drastic reduc number page oper dimens view index assign higher type weight ip valu chanc select frequent dimens view cut cost join huge tabl analysi basic cube view assign type weight dimens view assign addit weight dimens join attribut part index select view materi index partit view store index frequent partit view dynam repartit view applic access pattern chang su cientli futur work provid extens extend approach distribut environ horizont fragment view alloc distribut site interest research issu distribut applic mainten relev fragment view consult insert delet algorithm serv identifi fragment visit parallel view mainten express develop run concurr fragment view size data view experi observ perform access aa ma attribut test queri chang collect result experi run setup futur work partit store view lead improv system perform reduc queri time mainten cost queri scan fewer fragment turn scan fewer row store origin view queri time reduc fraction row view access averag queri worst case fragment visit row view access averag queri paper contribut algorithm select materi view horizont recomput size select futur view compon includ recommend fragment view suitabl answer queri studi compar result approach greedi algorithm conduct report futur work direct includ accommod mainten express store dynam select view queri access inform chang fragment maintain includ record acknowledg research support natur scienc engin research council canada oper grant grant refer ci data knowledg engin pm jf comput intern vldb ja pa fw cientli updat materi acm sigmod intern pp data data mine overview data wareh olap sigmod vol march ls df ka algorithm defer view acm sigmod intern june pp ci data knowledg engin ls df ka support multipl view mainten acm sigmod intern pp sb object function vertic partit relat distribut distribut parallel distribut design logic ieee transact softwar ci sr scheme aggreg ninth intern confer comput juli ci distribut object base vertic fragment journal distribut parallel kluwer academ vol pp ci uniform approach select view index data intern engin applic ieee august pp ci accommod dimens hierarchi data select wg system develop method plenum pp data relat aggreg oper gener intern confer data pp index select intern confer data implement data cube acm sigmod intern confer manag june pp wh build data data wareh tool practic techniqu build data dynam view manag system data acm sigmod intern confer manag june pp divid design larg program design mt principl distribut englewood manag comput data technic report rj ibm almaden research san build cient data understand issu data summar annual sa user group intern vol pp research problem data intern confer inform knowledg manag novemb ci maintain horizont partit intern confer data wareh knowledg discoveri septemb publish lectur note comput scienc berlin maintain horizont partit master comput scienc decemb receiv msc comput scienc simon fraser canada phd comput scienc canada held academ posit number associ professor comput scienc canada research interest includ distribut data wareh mine author technic public includ journal articl intern journal distribut parallel kluwer academ publish
AI/463 2 adapt heterogen team lynn parker center engin scienc advanc research comput scienc mathemat oak ridg nation box oak tn usa abstract research address problem achiev fault toler cooper team heterogen mobil robot describ fulli distribut call util adapt action select achiev fault toler cooper control robot mission involv coupl task robot architectur possess varieti function perform time select action base requir activ current intern state cooper team work dynam unpredict softwar architectur team member respond robustli reliabl unexpect modif robot team occur due mechan learn addit remov robot team human present describ detail result implement architectur team physic mobil robot perform cooper box push demonstr experi illustr abil allianc achiev cooper control dynam capabl robot team kei cooper system introduct achiev cooper robot desir number reason robot applic inher distribut requir distribut solut applic solv quickli mission preprint submit elsevi preprint novemb divid number robot oper parallel duplic capabl robot team potenti robust reliabl autom solut redund cheaper practic applic build number capabl robot work build robot perform entir mission adequ reliabl achiev cooper challeng issu address order develop work cooper action conflict commun cooper team work dynam unpredict requir robot team member respond adapt unexpect failur commun modif robot team occur due mechan learn addit remov robot team human previou research heterogen mobil robot cooper control architectur includ planner control function describ architectur includ task task motion execut describ architectur call util negoti framework robot recruit hierarch author address problem cooper approach deal primarili task select problem larg ignor difficult issu physic robot robot commun dynam environ research fault toler adapt cooper control princip characterist cooper control architectur paper describ architectur built heterogen mobil robot control fault adapt cooper call design team robot perform mission coupl subtask task fix order type execut task undo effect task research cover larg rang mission cooper robot report wide varieti applic implement physic simul robot team fall domain coupl present implement paper cooper box push refer report implement allianc hazard wast cleanup discuss implement allianc servic applic bound applic section describ cooper give overview achiev fault adapt provid detail oper primari control mechan motiv behavior section implement allianc physic robot team perform cooper box push mission section offer conclud remark allianc architectur allianc fulli distribut architectur fault heterogen robot cooper util adapt action select achiev cooper control robot possess varieti function perform time select action base requir activ current intern state individu robot design approach number behavior activ receiv sensori input control aspect actuat output correspond primit surviv behavior obstacl behavior correspond higher goal map build explor output behavior suppress inhibit upper layer upper layer deem approach successfulli number robot extens approach robot select number compet action action pursu parallel unlik typic allianc delin activ group figur show gener architectur allianc illustr behavior set jth behavior ij robot correspond level compet requir perform find wast move wast report progress robot team human monitor robot activ behavior select task behavior set robot wai perform activ behavior set perform defin function ij refer task robot work activ behavior set layer layer layer motiv behavior motiv behavior motiv behavior behavior set behavior set behavior set sensor actuat commun allianc architectur fig allianc architectur symbol figur connect output motiv behavior output behavior set line short horizont motiv behavior output behavior set pass robot actuat altern goal pursu robot mean select behavior set activ control activ behavior set motiv behavior due conflict behavior set robot activ point time restrict implement motiv repres arc top figur activ behavior set suppress activ behavior set compet avoid continu activ goal robot pursu exampl type continu activ compet shown figur layer layer layer motiv overview primari mechan achiev adapt action select architectur motiv behavior time motiv behavior receiv input number includ sensori inhibitori feedback activ intern motiv call robot impati robot output motiv behavior activ level behavior repres number activ level exce behavior set activ motiv behavior work robot motiv activ behavior set ij initi robot motiv ij activ behavior set ij fast rate long task behavior set ij determin sensori feedback robot action adapt task select activ team member robot awar robot work task ij satisfi period time task accomplish applic action motiv activ behavior set ij slower rate characterist prevent robot replic action wast needless energi detect interpret action robot call action trivial requir perceptu abil current technolog stand sensori capabl lower anim exce present robot capabl enhanc robot perceptu allianc util simpl form broadcast commun robot inform team member current reli total sensori capabl prespecifi robot broadcast statement current robot listen ignor emploi architectur robot design robot period time commun messag robot affect motiv activ behavior set continu sensori feedback indic task accomplish overrid statement robot perform task characterist robot adapt failur ignor activ robot successfulli complet task complementari characterist robot impati characterist reflect fact robot characterist recognit robot fail featur oper robot perform give task time long sensori feedback task accomplish robot begun task feel attempt task adequ period unsuccess robot task attempt find action product robot robot give task complet accept period time possibl work task prove product stuck perform task forev robot adapt action failur design motiv behavior robot adapt unexpect alter sensori feedback addit task suddenli requir robot perform addit exist condit disappear reliev robot task motiv adapt robot respond appropri current circumst motiv formal model present basic philosophi allianc detail philosophi incorpor motiv behavior mechan present formal model motiv behavior discuss introduc number paramet incorpor allianc extens allianc call learn paramet updat automat knowledg learn team member capabl dynam paramet updat mechan reliev human paramet adjust heterogen robot team member select task effici refer detail mechan note implement model featur behavior languag physic robot team simul robot team discuss threshold activ behavior describ primari input motiv behavior conclud section show input combin determin current level motiv behavior set robot threshold activ threshold activ paramet determin level motiv behavior set activ threshold activ behavior set allianc assum threshold suffici rate impati vari behavior set robot sensori feedback sensori feedback motiv behavior inform determin behavior set activ point current mission sensori feedback physic robot realist robot applic robot applic task world sensor task type activ valu program state variabl state act type virtual sensor serv physic sensor defin simpl function captur notion sensori feedback sensori feedback ij sensori feedback robot time behavior set ij applic commun broadcast commun mechan util allianc serv kei role robot determin current action teammat note broadcast messag allianc substitut passiv action difficult achiev paramet control broadcast commun ae ae rate robot broadcast current activ addit level fault toler give period time robot pass receiv commun messag specif teammat decid teammat function monitor commun motiv behavior robot note team member pursu task motiv behavior behavior set refer type monitor formal defin function comm receiv comm robot receiv messag robot task ij time span suppress activ behavior set motiv behavior activ behavior simultan begin inhibit motiv behavior activ respect behavior set robot effect motiv behavior continu monitor sensori commun level impati determin continu activ behavior set point robot complet current sensori feedback longer robot task activ behavior set eventu motiv behavior behavior set motiv behavior robot opportun activ behavior set refer suppress action behavior set activ suppress ij behavior set ik robot time function behavior set ij suppress time robot behavior set ik activ robot time robot impati paramet implement robot impati featur oe ij ffi slow ij ffi fast ij oe ij time robot robot commun messag affect motiv behavior set ij note robot oe paramet robot paramet chang mission depend influenc robot influenc updat robot capabl chang ffi slow ij ffi fast ij give rate impati robot behavior set ij robot perform task ij absenc robot perform assum fast impati paramet correspond higher rate impati slow impati paramet behavior set robot reason assumpt clear robot robot opportun accomplish task impati reason remain idl task remain undon robot attempt task question slow rate impati motiv behavior control behavior set ij robot perform task ij method allianc motiv rate slowest robot time oe ij continu attempt specif current impati rate behavior set ij impati ij min slow ij oe ij ffi fast ij function impati rate minimum slow ffi slow ij robot receiv commun indic robot perform task ij time longer oe ij time unit impati rate set ffi fast ij final detail address robot motiv activ behavior set ij time hear robot perform task ij accomplish impati reset ij time commun check reset function motiv reset robot receiv messag robot indic perform task ij function motiv reset robot team member attempt task motiv reset repeatedli fail robot complet mission robot paramet implement robot characterist ij ij ij time robot maintain behavior set ij activ yield robot ij time robot maintain behavior set ij activ give possibl behavior set function robot decid ij set ij robot activ ij time unit time set ij robot activ ij time unit time function robot behavior set ij condit ffl work task ij length time ij robot task ij ffl work task ij length time ij motiv calcul combin input calcul level motiv ij ij ij impati ij suppress ij feedback ij ij reset ij motiv perform behavior set ij robot set motiv posit rate impati ij situat behavior set sensori feedback behavior set longer robot decid robot task ij time motiv return motiv grow cross threshold time behavior set robot select action behavior set ij activ robot broadcast current activ robot rate ae robot box push experi allianc architectur successfulli implement varieti proof concept applic physic simul mobil robot applic implement physic robot includ hazard wast cleanup report cooper box push log physic robot run hazard wast cleanup mission physic robot run box push mission complet elucid import issu heterogen robot cooper run physic robot applic videotap applic simul mobil robot includ servic mission bound mission militari involv dozen run detail implement report cooper box push mission offer simpl illustr kei characterist allianc fault toler adapt control due dynam robot team box push mission requir long box push box suffici heavi long robot push middl box move room box push end order accomplish mission synchron push mission defin term recur task push left push end activ opposit side push mission demonstr allianc architectur endow robot team member fault toler action select due failur robot team adapt action select due heterogen robot team note emphasi experi issu fault toler cooper design ultim box concern present issu robot push box obstacl interf robot detect box describ robot experi design robot control softwar present discuss result proof concept implement physic robot team box push applic implement mobil robot type robot robot design manufactur type drive wheel arrang differenti gripper grasp object sensor suit includ infrar sensor bump sensor evenli distribut back robot infrar sensor gripper bump sensor line insid finger facilit grasp small object type leg robot leg sensor suit includ forc detector passiv arrai infrar heat tactil sensor robot measur pitch robot radio commun system physic robot implement robot commun current action system consist radio modem attach base station prevent messag radio channel robot design radio system limit frequenc messag robot messag result involv commun robot hertz robot softwar design capabl robot softwar design box push mission robot vari describ allianc box push softwar robot separ control figur show allianc implement box push mission robot shown control behavior set push left end box push end box allianc activ behavior set control motiv behavior examin design motiv behavior behavior set robot design symmetr sensori feedback requir motiv behavior activ behavior set indic end box push requir figur arrow enter motiv behavior end box push robot push robot feedback intern messag motiv behavior robot detect robot complet push detect imposs current sensori robot provid capabl team member broadcast messag push complet current push push initi begin mission program control code robot opposit end box push sensori feedback motiv behavior grow impati rate ffi fast subscript stand robot perform rate motiv acquir left push behavior set wheel motiv acquir push behavior set ir ir box push control fig allianc design softwar box push mission ffi slow robot perform task motiv grow behavior set activ behavior set involv acquir left end box push end robot left end acquir place assum end move left end box infrar sensor side follow box back turn box abil acquir opposit end box mission import achiev fault toler cooper control begin ideal locat end box scope proof concept implicit assumpt made control begin face end box infrar sensor end gripper finger remain contact box current push consid complet push prescrib period time task motiv perform task temporarili return motiv begin grow sensori feedback task simplifi omit subscript fast slow impati rate section fast rate impati behavior set slow rate impati function omit depend impati deal updat paramet mission control primari wai acquir opposit end due lack sensori push box quickli due power effector differ mean push current locat implicit control assumpt locat end box begin mission differ impli push frequenc team team robot team problem accomplish mission due sever box figur show organ box push softwar figur control behavior control motiv behavior push current locat control push behavior set sensori feedback satisfi push motiv behavior robot push opposit end box requir shown figur arrow push motiv behavior sensori feedback impati perform push behavior rate ffi fast gp subscript refer subscript refer push behavior motiv cross threshold push behavior set push box walk whisker maintain contact box push length motiv perform push return grow sensori feedback satisfi sensori feedback requir behavior set activ opposit requir push behavior set robot push opposit end box sensori feedback motiv activ grow rate ffi fast gh subscript refer behavior behavior set activ motiv cross threshold behavior set walk box experi result demonstr fault adapt natur allianc architectur due robot team basic experi box push mission experi began push behavior set push whisker home behavior set leg motiv push motiv box push control fig allianc design softwar box push mission fig begin box push mission push box room push box end box illustr figur note fast rate impati set delai individu push robot small depend hz commun messag transmit push box dynam alter capabl robot team wai alter team seiz robot mission turn mimick robot ad back team seiz time replac make team seiz remain leav sole team member subsect describ result experi fig fault toler action select seiz robot turn remain robot perform task box push push end push left end box acquir end box experi robot primari goal architectur robot recov failur robot team member seiz turn test abil remain respond adapt action select observ depend set ffi slow remain begin acquir opposit end shown figur push end box continu back execut task push left end box push end box long fail broadcast commun mechan robot perform push opposit end box add back robot adapt action push side satisfi end box push robot team demonstr abil recov failur robot team member experi heterogen goal architectur heterogen robot team work effici robot heterogen obviou wai robot differ task robot differ perform task deal primarili type mechan push box substitut robot middl test abil remain team member respond dynam chang heterogen fig adapt due heterogen seiz time replac push remain robot adapt action push frequent team observ experi remain begin push frequent robot push opposit end box robot remain align push figur illustr push reduc rate push ad ffi slow ffi slow paramet differ bit slower push box note paramet differ easili learn robot featur architectur robot monitor learn perform robot team member explain mechan assum impati rate assign human design ffi slow ffi slow assum push left swap team end box longer complet push sensori feedback remain motiv behavior satisfi behavior set activ frequent motiv behavior remain impati activ behavior set robot accomplish task motiv grow reduc rate ffi slow motiv activ behavior set cross threshold activ announc complet task turn prevent remain push side box long continu push demonstr abil adapt dynam chang team heterogen complet experi remov remain team activ complet box push task demonstr adapt action select due action failur robot team member allianc fault toler cooper control architectur heterogen mobil robot team appli mission involv larg independ task architectur fulli distribut individu robot level team level robot number interact motiv behavior control activ set behavior robot execut task team control distribut equal robot team robot select task independ central control level distribut allianc architectur scale easili mission involv larger number task architectur util form negoti simpl form broadcast commun robot awar action teammat control mechan allianc design facilit fault toler robot recov failur individu robot commun adapt action select due robot team membership dynam environ demonstr abil implement allianc physic simul robot team report result physic robot team perform box push demonstr report paper number addit studi undertaken issu includ effect lack awar robot team member action numer effici refer detail descript implement allianc architectur physic simul mobil robot team acknowledg support research provid part research initi offic naval research contract part advanc research project agenc offic naval research contract part corpor addit support provid offic engin research basic energi depart contract martin energi research corpor refer endo develop task assign system commun multipl autonom robot journal robot rodnei brook robust layer control system mobil robot ieee journal robot march rodnei brook behavior user guid memo mit ai april rodnei brook eleph dont plai chess robot autonom philipp claud le mark indoor autom mobil robot ieee intern workshop intellig robot page paul michael david adel problem solv phoenix environ coin technic report massachusett isr radio commun posit octob fabric robot architectur integr cooper mobil applic indoor environ intern journal robot februari parker adapt action select cooper agent team herbert stewart intern confer simul adapt page mit parker experi mobil robot cooper asc specialti confer robot challeng februari parker heterogen cooper phd massachusett institut artifici intellig februari parker design team journal advanc parker learn system journal advanc parker architectur cooper ieee transact robot gerald sussman comput model skill acquisit phd massachusett institut
DB/464 3 inform manag scientif data abstract data data mart successfulli appli multitud commerci busi applic proven invalu tool integr inform heterogen sourc summar data inform dissemin vital scienc work commun scarc tradit wareh techniqu dont transfer scientif environ primari reason difficulti schema integr difficult scientif busi complex concept relationship differ fulli import determin integr autonom sourc scientif data sourc highli dynam data data sourc particip mediat transfer data updat reflect modif cost repeatedli perform updat tradit requir dynam prohibit paper discuss issu context ongo research effort util uniqu integr strategi identifi instanc maintain differ data architectur extens reduc cost maintain introduct past amount inform busi scientif individu corpor routin comput record proprietari inform distribut public inform www challeng face data manag todai fulli util wealth inform overwhelm end user system maintain competit advantag provid data busi inform process driven technolog advanc data wareh analyt process relat accept standard system sql data access manipul languag commerci compani red address step involv analyz scientif applic face uniqu problem address tool part problem lack standard scientif domain inform sourc share common data data manag architectur primari problem subtl complex relationship data dynam sourc schemata ongo research effort make data wareh feasibl scientif environ concentr bioinformat problem failur unifi publicli data sourc hamper scientif progress solut scientif domain goal bioinformat enabl advanc comput analysi identifi similar dna protein sequenc structur specif applic analysi area protein fold recognit compar model research area base hope understand sequenc protein complex relationship make structur predict feasibl physic model knowledg obtain care examin protein fold properti protein dna genet organ express data inform spread multipl commun data access method burden fall scientist resolv integr interpret result barrier prove difficult data goal reduc cost creat maintain semant consist view data heterogen data sourc evalu develop prototyp data structur biologist prototyp level form novic graphic queri editor intermedi level direct sql access perl advanc user protein data bank data integr framework addit sourc support protein structur function genom distinguish effort bioinformat commerci data wareh salient uniqu associ strategi link relat integr defin correct provid consist view instanc data maintain heterogen instanc architectur design architectur improv reliabl perform compar feder provid full access origin data base infrastructur defin base mediat gener substanti reduc cost creat maintain paper describ challeng involv successfulli perform schema data integr highli dynam present approach address import issu resolv inform manag data clean suffici room explor begin overview relat effort section section briefli discuss problem current schema integr techniqu present approach section describ implic architectur choic section briefli discuss infrastructur background scientif applic face problem address commerci tool domain inform sourc share wide accept format storag reli flat file util relat type inform provid data continu evolv exist tool model manag complex data encount scientif applic approach data manag bioinformat compar object protocol model develop lawrenc berkelei nation set tool scientif data manag repres scientif experi requir complex data model model facil provid commerci relat manag system data model includ protocol class model experi toolset consist schema editor manag graphic queri tool relat schema definit work exist scientif toolset extend facil queri system link toolset complimentari function address set challeng project tool manag transform data provid integr access multipl data sourc transform integr access achiev constraint rule special languag approach integr access multipl data sourc approach provid integr schema sourc user requir directli rule constraint involv queri integr access extrem approach prevent casual unfamiliar detail individu data fulli util resourc aim manag multipl inform sourc provid tool integr access multipl inform sourc tsimmi object call object exchang model wrapper translat oem nativ mediat queri manag locat data sourc request inform thrust project provid access dynam inform sourc unstructur world wide web approach scientif applic depend greatli easili data domain repres oem program graphic queri access multipl biolog domain queri editor facil import displai relat schema geograph distant commun user pose queri execut site maintain particip provid inform user correct wai combin inform join queri approach requir hard code inform relationship particip ad requir updat relationship approach interact scientif data web base form approach significantli limit user abil interact data consid integr heterogen data sourc schemata global schema present coher view data sourc defin schema involv identifi relat concept data map common resolv syntact semant differ occur individu global schema creat conceptu overlai sourc similar concept attribut global schema translat creat map sourc concept global approach consist view data defin implicit relationship attribut data sourc relationship produc unintend result difficulti identifi instanc object ident difficulti understand merg data assum ident minor differ protein shown figur includ sequenc inform protein includ tissu protein found concept result composit shown figur reason problem practic implicit relationship attribut data sourc protein entri state occur breast instanc share slightli sequenc type mismatch common busi scientif domain import distinct busi correct case scientif domain mediat decid instanc repres protein combin result global remain distinct choic accept instanc mediat select origin sequenc repres result instanc heterogen inform lost instanc associ function protein tissu identifi queri return sequenc cancer relat protein found breast produc expect result simpl suggest resolv conflict ad sequenc attribut global map origin sequenc global attribut initi reason complex result queri data structur quickli complex manag face multipl data sourc reduc potenti approach remaind section natur kei overlai complex primit concept repres multipl data sourc identifi relationship permit concept base concept form natur kei repres fundament real world concept sharabl defin semant identifi natur kei requir care examin data sourc expert understand underli concept overli simplist concept chosen extrem difficult identifi repres interest relationship complex concept implicit relationship creat result problem found natur kei singl characterist definit complex concept definit semant data format repres semant close relat easili gener definit integr identifi protein sequenc natur protein sequenc basic concept found data obviou map correspond identifi categori relat base natur tradit similar tradit relationship natur person wrote articl repres normal relationship global instanti local data store treat relationship tradit discuss ident relationship relat instanc natur kei repres object relationship explicitli defin associ natur kei implicitli defin overlai approach make relationship instanc preserv data heterogen maintain connect attribut concept relationship occur sole singl trivial includ global schema sourc schema integr protein sequenc tissu protein protein sequenc tissu function function sequenc figur simpl schema integr structur repres figur approach global schema origin structur relat relationship sequenc attribut dot heterogen present sourc correspond tissu function identifi stringent associ natur sequenc homolog ident similar relat similar identifi associ attribut weakli relat statist equal oper concret protein sequenc natur kei sequenc homolog identifi ident base high homolog similar base lower score minor variat sequenc count ident provid user inform relat specif protein maintain heterogen found sourc similar relat identifi close relat famili natur kei fundament chang sourc schema modifi limit correspond effect schema chang isol small portion global schema data sourc associ ident concept rich environ experienc user complex queri data creat explicit relationship concept significantli reduc effort requir adapt schema permit inform instanc easili identifi retriev architectur approach access data multipl heterogen data feder data provid simpl connect permit user creat queri multipl time approach provid consist view user expect formul extrem complex queri user understand intern relev manual resolv syntact semant construct queri sourc nativ queri languag potenti user intim familiar detail work connect data desir approach provid resourc broad critic provid consist interfac data feder defin integr schema subset data interest feder global schema repres virtual combin data particip sourc form consist queri pose feder applic data translat nativ queri result combin pass user drawback approach order process queri effici sourc particip feder requir contribut resourc queri storag feder data repres approach suscept long delai answer queri mislead incorrect result return data sourc temporarili reduc amount network traffic improv queri data combin singl result monolith data approach introduc tremend amount storag requir data case singl avoid typic summari aggreg data summar data provid type inform origin data limit scientif environ difficulti data current fulli function busi sourc schemata stabl notion account rare dynam scientif area exist entri chang base sourc schemata rapidli evolv understand underli biologi combin advantag system form uniqu approach integr consist view integr data user local data cach reduc network traffic improv perform reliabl base mediat data architectur shown figur combin monolith feder approach architectur global schema subset inform data similar feder schema expand includ summari aggreg inform local data store addit import frequent access sourc data result consist view data greatli improv queri abil pose ad hoc queri origin domain data subset data cach local initi identifi sourc refin time queri involv data repres local store requir access remot feder access method provid obtain inform demand automat convert data sourc semant format global time delai access remot data user unawar data local remot access architectur improv base approach import wai improv feder approach reliabl cost particip feder provid singl collect point local store transfer particip cost data sourc critic environ individu data sourc resourc contribut feder consolid singl locat reduc network traffic amount data return join network connect slow act cach data provid correct result data sourc unavail approach improv tradit maintain access detail inform reduc storag cost duplic data identif data approach ensur remain research scientist reduc impact sourc schema benefit improv system perform invest requir creat maintain data cach regularli updat reflect sourc simpl batch process techniqu automat download integr data data sourc effect environ genom data monoton exist data rare modif schema enter data updat explicitli made administr data integr global schema data sourc convert tradit approach data integr write complex wrapper data convert target pass data sourc larg complex program modifi properli interpret format sourc ad program gener reduc time requir modifi creat mediat wrapper crucial feasibl make extens effort requir adapt automat gener api mediat written mediat translat class import question exact set inform gener mediat order answer task mg perform gener mediat mediat gener straightforward code mg resolv semant conflict data sourc order resolv type format mg inform data characterist data wai convert resolv structur conflict requir map inform describ abstract relat schema order resolv semant mg inform legal transform function requir type suffici mg perform task mg defin mediat accept data wrapper transform data enter directli incorpor data sourc administr extend abstract definit ensur requir transform method mg creat api mediat administr write wrapper read data sourc pass api mediat wrapper extern tool gener integr taxonomi defin tabl repres taxonomi extend abstract includ inform updat map gener wrote parser read flat file pass data mediat creat mediat significantli reduc effort requir maintain dynam environ demonstr reduct time requir integr sourc prototyp wrapper sourc wrapper sourc wrapper sourc api data mediat figur architectur adapt minor schema requir modifi parser read format requir modifi mediat creat addit inform mg found inabl fulli util wealth publicli inform scientif domain gener commerci product busi applic meet uniqu scientif domain address subtl data integr issu result complex relationship scientif obviou schema integr issu result dynam natur sourc address problem util mediat architectur provid consist interfac scientif data architectur reduc storag requir maintain access data uniqu view correspond extens differenti approach provid reduct mainten cost genom present approach manag scientif scientist util data work hard produc bibliographi protein sequenc supplement nucleic acid batini lenzerini compar analysi methodolog schema acm comput pp ms tm cm express sequenc nat genet aug simon taxonomi current issu system march sussman protein data bank content atom coordin entri format descript version tech report octob chen overview object protocol model data manag inform vol gener mediat ontolog intern workshop knowledg meet base mediat gener ifci confer cooper inform system aug lim srivastava prabhakar identif ninth intl confer data pp april austria jennif widom integr access heterogen inform sourc tsimmi aaai symposium inform pp march ag se structur classif protein investig sequenc structur journal molecular biologi identif proc intl workshop ieee comput societi pp april japan transform biolog applic doe workshop santa nov sheth larson feder system manag distribut heterogen autonom acm comput septemb shin graphic ad hoc queri interfac feder genom comput sc eng ct doe workshop santa nov work perform doe contract
DB/465 3 deduct problem solut mengchi liu canada deduct result integr relat logic program techniqu problem remain inher simpl synthesi languag point view discuss problem complex object updat examin typic languag address issu categori subject definit data manipul queri program logic intellig deduct theorem logic knowledg formal logic logic formal mathemat program gener theori addit kei word deduct logic nest relat complex object depart comput canada liu content introduct deduct languag ldl col hilog relationlog deduct languag rol iql schema featur hilog rol updat prolog dlp extens ldl transact logic deduct problem solut introduct logic program independ develop area comput scienc technolog evolv order effect effici manag maintain larg volum increasingli complex data reliabl memori devic underli structur primari focu research led develop data model wide data model relat data model power relat data model li rigor mathemat foundat simpl paradigm queri languag relat data model found applic past express data model system er model taxi al gemston al al sam iri al hull exodu al kim al al al odmg logic program direct earlier work automat theorem prove artifici intellig base mathemat studi relat assert deduct formal term proof model theori proof theori formal specif correct reason model theori prescrib gener assert interpret respect collect specif fact logic program program descript logic repres knowledg deduct solv problem deriv logic consequ wide logic program languag prolog kowalski sterl shapiro horn subset logic program languag resolut principl method infer semant prolog lack express number area past number richer express logic program languag login life hilog al godel lloyd oz mercuri al xsb al import studi relat logic program relat conduct theoret point view minker gallair jacob ullman maier relat logic program found similar data languag level found complementari aspect relat system superior standard implement prolog respect data secondari storag secur integr zaniolo control execut queri languag queri optim compil techniqu liu ensur effici perform wide rang storag structur express power function relat queri languag limit compar logic program languag relat languag reason capabl relat queri languag express complet tradit program result mismatch program relat queri languag program languag express deduct integr constraint uniform sterl shapiro integr logic program relat techniqu led activ research area deduct al ceri al grant minker combin benefit oper reason declar effici secondari storag function symbol typic build function complex data found oper relat made flat relat restrict form prolog function symbol call datalog declar semant base work logic wide accept standard deduct languag ceri al past evalu strategi specif deduct main focu extens research al bancilhon ramakrishnan beeri ramakrishnan ceri al ioannidi ramakrishnan jiang mumick al zaniolo ullman ullman number deduct system prototyp base datalog report includ nail al al al xsb al coral al al al al ullman survei deduct system deduct system varieti applic domain includ scientif languag applic transit closur path problem suit applic larg amount data access complex queri support problem remain inher kind deduct languag point view investig problemat area deduct provid flat structur directli support complex valu common applic object orient offer wai meet demand advanc clear incorpor object orient deduct data model capabl current deduct natur deal schema featur uniform framework languag provid deduct problem solut manipul schema inform updat modifi immedi obviou express updat logic framework elabor problem survei typic languag area consist exampl issu relev deduct languag includ semant logic program negat predic stratif fixpoint semant al local stratif perfect model semant stabl model semant lifschitz przymusinski stratifi semant semant al altern fixpoint semant logic program disjunct deduct minker fernandez minker al subrahmanian hypothet reason bonner chen inou goebel constraint al jaffar maher grumbach su separ survei issu languag survei deal predic stratif fixpoint semant follow prolog convent word start letter variabl anonym variabl deduct languag relat data normal form found engin graphic applic requir proper manipul arbitrarili complex valu intern structur nest relat data model al yuan roth al roth al colbi leven loizou abiteboul beeri develop past decad tupl compon relat possibl nest set relat datalog base relat support nest tupl set predecessor prolog indirectli support nest tupl functor fact prolog store inform car functor interpret freeli prior mean liu prolog indirectli support set list set express repres predic repres goal variabl occur list element sort standard order duplic treat set read set instanc provabl fx pg problem predic prolog base list predic semant usag list set express simpl membership predic detail iter list predic involv program complic contrari gener philosophi declar program datalog extend past year incorpor tupl set constructor beeri al abiteboul grumbach liu prolog extend incorpor set construct basic oper set al hill lloyd examin datalog hilog relationlog ldl ldl data zaniolo naqvi tsur chimenti al beeri al languag extend datalog support complex valu semant implement mcc ldl indirectli support tupl functor directli support set nest relat dept dept dept area area cpsc bob db ai joe os pl db math sam gt cm si tom ca repres relat ldl deduct problem solut dept dept support access element ldl member predic support construct set ldl power set set group set set construct list element set set construct defin element properti satisfi exampl deriv relat set book titl book base relat total price book exce rule set term zg book px py note cardin set set featur directli support prolog relat repres fact ldl rule ldl group parent person set obtain hy hy unlik set cardin set set group program base group negat order semant rule form ln negat rule evalu rule head predic symbol complet evalu rule program determin static base predic symbol program limit ldl group mechan restrict singl rule set rule group rule ldl group parent person set obtain hy liu hy gener introduc intermedi relat obtain desir shown problem group requir predic make direct definit nest relat imposs hy hy intend defin nest relat directli achiev intend ldl group restrict singl rule group requir relat bodi evalu relat head rule problem introduc flat intermedi relat hy cumbersom access deepli nest data procedur introduc intermedi variabl relat ldl fact find comput scienc depart research area includ db find ai research area repres ldl start top level gradual level introduc intermedi variabl db ai nest relat dept obtain normal relat dept area deduct problem solut nest oper extend relat algebra defin al dept area dept area cpsc bob db cpsc bob ai cpsc joe os cpsc joe pl cpsc joe db math sam gt math sam cm math sam si math tom ca order obtain dept dept area group time introduc intermedi relat dept dept col col object grumbach type extens datalog support complex valu directli unlik functor object tupl col directli support tupl constructor set nest relat dept repres col dept dept featur col interpret functor call data function deduct framework data function plai crucial role function data model semant data model col natur support function depend deduct function depend support data function member predic access set construct set group unlik set data function col set fact relat defin col functor par functor par group parent person set denot group involv rule note uniqu set liu parent data function group set data function task shown repres col set ldl shown perform col functor zg px py book col group rule data function cumbersom access deepli nest data order relat repres queri introduc intermedi function db ai rule col show obtain nest relat dept normal relat dept area dept dept program col stratifi order welldefin semant stratif base predic function symbol program rule form ln negat data data rule evalu rule head predic function symbol program stratifi determin static base predic function symbol occur program task shown rule rule stratifi semant col stratif col deduct problem solut wu program intend mean rule peter hobbi bridg tom hobbi includ chess tenni hobbi peter hobbi tom program stratifi mean hilog hilog chu chen type extens datalog intend solv problem ldl set tupl view atom functor prolog relat dept repres hilog fact dept note tupl set uniqu chang dept insid relat set hilog special mean aig set consist db ai mean db ai element special directli access deepli nest data give nest structur uniqu queri repres hilog directli introduc intermedi nest term hilog directli atom queri simpli repres nest relat dept obtain normal relat dept area dept set mechan natur support group involv rule liu relat express hilog set mechan requir stratif task shown repres hilog col program express hilog special treatment set hilog limit explicitli set set ldl support problem hilog assumpt practic larg hilog languag variabl set tupl section discuss true languag similar hilog relationlog relationlog liu type extens datalog power set tupl constructor implement regina shan shan liu relationlog combin featur col hilog directli support complex valu col nest relat dept repres relationlog col relationlog support hilog special set treatment partial set elimin assumpt partial set term form zi correspond hilog set term zg support set ldl complet set term complet set term form zg correspond ldl term form unlik term partial set term relationlog head bodi rule partial set term denot part hilog group set ldl rule group set relat directli defin relationlog hy hy rule group set deduct problem solut ldl program stratifi order semant stratif base predic symbol program rule form ln negat complet set rule evalu rule head predic symbol ldl program stratifi determin static base predic symbol occur program partial set term head requir relat defin relationlog hy hy hy hy deepli nest data directli access relationlog partial set term queri repres relationlog directli introduc intermedi obtain nest relat dept normal relat dept area dept dept col program express stratifi program relationlog fact peter hobbi bridg fact tom hobbi includ chess tenni rule state hobbi peter hobbi tom relationlog limit support incomplet set partial set support incomplet tupl tupl null common applic tupl repres tom father repres relationlog clear mean rule incomplet set tupl complet set term relationlog partial set set cardin complet knowledg easi queri set cardin set cardin relationlog lack discuss section liu deduct languag concept evolv program artifici end object orient offer wai meet demand advanc applic introduc fundament principl data model examin applic deduct languag object ident repres object real world fundament problem object kei subject updat updat kei break continu object care updat tupl set refer object reflect chang permit explicit object object valu uniqu object identifi entir assign object repres associ object identifi object remain fix unlik object identifi creat destroi updat object object identifi attribut valu user access object identifi vari system system complex valu object complex object object identifi object share object referenc object identifi updat valu share object affect object refer part object call state kim object object real world object identifi natur question object kind view view object atom set object object relat attribut attribut valu object chang object attribut object express term function attribut valu form tupl view iri al al view natur incorpor function multivalu depend view pair object identifi object view data model richard kim view result simpler import view object identifi identifi tupl atom valu set method object manipul method method implement signatur provid extern interfac method implement typic deduct problem solut written extend program languag class class set object intern structur attribut method class object belong call proper primari class object class directli captur relationship object class belong basi queri formul defin attribut method instanc object belong class object belong class perform reason object uniqu primari class show inherit make object belong logic class class hierarchi inherit class organ class captur gener relationship class subclass subclass inherit attribut method superclass instanc subclass logic belong superclass inherit enabl reduc redund specif maintain complet inherit place instanc complet data model subclass modifi inherit modif call overrid defin superclass applic subclass subclass block inherit inherit singl multipl case singl subclass hierarchi form case multipl subclass hierarchi form dag multipl inherit eleg singl conflict defin superclass approach resolv ambigu reli user defin prioriti super class inherit explicit requir inherit distinct overrid resolv ambigu consensu underli semant multipl inherit encapsul encapsul deriv notion abstract data type program languag object encapsul data method appli data encapsul requir inform object manipul mean method defin object user applic program directli examin modifi method object encapsul abstract interfac object achiev kind logic data independ notion data model approach appli deduct framework turn base logic program languag login treat object identifi atom liu valu object relat attribut class object joe posit work sam posit work cs head prof pai inst pai rank inst object salari attribut fact provid inform pai rate professor instructor rule specifi infer salari tupl set object arbitrari attribut structur behavior inform defin declar class inherit support rule fundament problem gener object rule issu properli address rule interest manag interest dept class intend mean rule depart manag coincid pair manag interest object identifi creat pair variabl occur head problem rule clear variabl quantifi wu quantif make suggest existenti quantifi argument quantif substanti point wu correct quantif happen work function determin label quantif yield result obviou quantif syntact structur rule problem variabl rule bodi rule al extend base wu gener lausen kifer deduct problem solut al solut problem partial implement universitat freiburg germani al treat atom object functor attribut class object declar attribut class support attribut inherit ag parent person joe tom person pam person integ string ag parent string object identifi symbol denot subclass relationship class membership statement subclass joe instanc class attribut applic class person declar arrow scalar attribut definit attribut definit inherit subclass attribut valu object joe repres arrow scalar valu set arrow power deduct languag semant compar support functor object set functor object object identifi rule repres interest manag work functor rule infer functor object instanc class interest pair mechan deduct languag warren live lattic sander unlik support simpl support attribut program drawback distinct class domain class object distinguish occurr program attribut declar inform strictli separ attribut inform clear separ notion schema liu essenti system pure deduct languag directli support relationship deduct languag discuss previou section support monoton multipl attribut support attribut overrid block set treat object attribut functor object set mechan creat object directli base set argument attribut set treatment set hilog statement attribut ag bob set semant statement set children bob mean part set statement children bob union partial valu infer program special treatment complet attribut infer number step rule fy fy fy fy uniqu treatment set make imposs complet attribut tom pam parent prevent addit person infer joe parent untyp languag complic syntax semant full symbol import featur type uniqu primari class lowest class class hierarchi object object built dealt axiom term mean user care properli includ axiom program program type object uniqu primari class notion type express axiom appli attribut valu functor object support behavior featur method encapsul rol rol object liu recent deduct languag implement regina al base solv problem discuss unlik rol type languag object class strictli distinguish function schema instanc schema deduct problem solut declar attribut subclass attribut declar class constrain instanc class instanc fact rule provid inform object rol partial complet inform attribut support limit form partial complet set term relationlog program express rol schema ag parent isa person act tom person pam person joe ag parent string pam object pami partial set term unlik rol class symbol isa denot subclass relationship primari class membership arrow scalar attribut definit arrow scalar attribut valu repres tom pam parent replac partial set term pami complet set term unlik rol simpl syntax semant semant import multipl inherit uniqu primari class functor object requir type respect class definit functor object interest instanc functor class interest pair featur rol functor class gener class relat functor object directli repres relationship rol attribut attribut valu functor object set gener rol subsum datalog ldl group relationlog partial set term special case ldl rule rol book liu px py rule repres rol interest type functor object interest separ identifi untyp functor object class interest pair identifi interest pair rol support multipl attribut discuss support monoton multipl attribut inherit subclass rol inherit attribut declar superclass overrid inherit intern servic address class address cn address address cn address subclass address defin attribut address integ appli instanc address cn address defin string cn address overrid inherit attribut declar address achiev rol class support address isa address cn isa address subclass block inherit superclass subclass class class french orphan orphan defin subclass person french orphan subclass french orphan declar attribut ag person french inherit overrid attribut declar person orphan french orphan inherit father mother attribut orphan french orphan block inherit attribut father mother person intend semant natur support rol class mother ag mother isa person french isa person french orphan isa orphan french overrid attribut father deduct problem solut mother mother isa person attribut father mother block french orphan insist french orphan mother class definit overrid inherit french isa orphan featur rol set treat citizen object functor set attribut class definit fact rol limit object identifi rol directli identifi tupl set atom rol treatment class gener object class treat object meta al infinit layer ordinari attribut support rol problem rol class relat subclass relationship attribut rol deduct languag support support approach limit support group functor object partial complet set mechan gener relationlog behavior featur method encapsul support rol iql iql queri kanellaki type deduct languag base data model object iql pair object identifi unlik iql object set atom object famili children phone children phone phone phone fo object identifi identifi identifi identifi atom famili phone number add simpl updat object identifi access liu object identifi dereferenc oper denot tupl children phone set fo iql directli support relat addit class pure data model relationship object difficult deal repres iql relat object identifi object problemat deduct pure approach argu regard direct support iql combin benefit relat approach object identifi simpli constant introduc explicitli fact rule user object identifi program languag creat rule variabl occur bodi view syntact variat construct objectori program languag unlik semant mechan intend rule repres iql interest interest rule gener pair relat pair creat object identifi pair relat interest pair variabl head bodi rule assign pair object identifi object identifi object ident iql object share updat set group data function col rule show deriv relat relat object identifi group iql rule creat object identifi set ancestor person rule object identifi group ancestor person rule gener relat dereferenc object identifi identifi set note rule rule evalu rule unlik datalog col stratif automat determin base predic function iql symbol deduct problem solut shown rule user iql care stratif program composit rule organ program rule iql object mechan deduct languag al ozsoyoglu iql type languag clear separ notion instanc schema object class strictli distinguish function instanc schema schema declar class type kind object identifi creat rule complet determin type class object iql problem object mechan lead infinit loop support discuss kind semant defin underli data model iql make languag complic iql depend relat object exist relat pure deduct languag problem valu treat object properti iql part object mathemat store integ attribut prime integ identifi separ identifi case tupl set separ relat class suffer problem model relationship includ class includ relationship relationship includ relationship schema support iql limit support import featur attribut inherit behavior objectori featur method encapsul incorpor method encapsul deduct framework remain open problem schema featur schema descript constrain data queri part consist relat schemat inform store relat relat languag queri data schema notion schema properli support deduct base logic program languag inher type semant schema deduct framework predic correspond relat order reason schemat predic variabl belong liu order logic logic met unif problem undecid languag schemat inform implement deduct system inform languag prolog combin program work gener predic transit closur sort predic pass paramet return predic rule queri prolog binari predic current predic unifi term gener term predic rule current current rule defin relat collect predic rule defin relat collect predic structur semant prolog base support featur ad hoc statu logic program examin languag reason schemat inform deduct rol hilog predic function role predic construct function construct term term atom predic function symbol fix ariti shown prolog applic symbol predic function ariti hilog al gener usag declar semant note hilog hilog discuss section kind symbol paramet ariti variabl paramet function function constant depend context term form paramet variabl usual repres atom context unari relat view set unari term view set part relat repres hilog deduct problem solut dept hilog support repres classifi deduct languag variabl place predic variabl reason schemat inform consist repres respect depart tupl relat attribut ag salari defin relat queri relat collect relat relat collect depart joe belong relat collect softwar admin relat relat collect older joe relat collect pair ag depart relat collect pair salari relat collect highest salari depart defin relat collect relat hilog explicitli deal ariti relat order queri relat shown rule queri attribut hilog defin hilog relat relat naqvi deduct languag base ldl problem discuss solv introduc attribut tupl redefin tupl discuss defin tupl db softwar admin softwar admin attribut function predic relat tupl liu set tupl form ag salari specif attribut joe relat hardwar referenc relat order attribut attribut omit order variabl attribut deal ariti base defin relat relat collect relat matter ariti version rule relat relat collect attribut relat hardwar relat collect relat hai term definit intuit rule featur introduct replac semant solut unif evalu rule deduct gener unif match term variabl variabl limit rang attribut rule variabl rewritten replac variabl attribut rewritten rule logic mean number attribut languag decid approach natur simpl integr definit manipul schema data notion schema relat structur inform salari requir tupl relat form ag salari wife rule case pure class relat class denot set object common attribut prescrib attribut deduct problem solut applic instanc class organ subclass hierarchi prescrib attribut superclass inherit subclass natur question reason subclass attribut inform class attribut inform object deduct languag support reason class attribut inform portion program base discuss class subclass definit part object person hardwar softwar admin joe hardwar ag salari children ag salari children unlik defin attribut inform class instanc attribut inform remain discuss section class attribut object differ object occurr special place variabl place class attribut reason class attribut inform program rule queri collect attribut class attribut instanc class shown cumbersom queri class reason distinguish ordinari object class queri place class kind arrow cumbersom queri liu instanc class rule show collect subclass subclass rol rol liu languag support reason subclass attribut inform class attribut inform object clear notion schema class attribut variabl rule semant featur rol base replac semant languag decid program repres rol schema person children phone isa person hardwar isa softwar isa admin isa act joe ag salari children user explicitli defin subclass primari class membership symbol base gener subclass class membership deriv symbol rol rule queri base rol program isa subclass isa subclass isa isa instanc instanc paid due deduct problem solut rule rol version rule collect instanc instanc rule find highest salari depart discuss section rol functor class relat mechan rol queri relat schema imposs queri attribut relat featur cumbersom updat relat deduct undergo updat absorb inform past method incorpor updat construct languag abiteboul vianu bonner kifer bonner al bonner kifer bry chen de simon kaka mancarella kowalski al naqvi krishnamurthi al reiter freitag model updat languag subject substanti current research import issu relat updat deduct point view nondeterminist bulk condit updat discuss famili deduct languag support dlp transact show deal issu prolog basic updat primit assert retract assert insert singl fact rule succe initi fail comput backtrack fact rule delet prolog retract retract delet unifi argument retract match remov fail remain match updat prolog base relat store depart salari queri prolog fire joe toi depart salari hire bob shoe depart salari liu updat express queri perform kind updat write gener updat rule queri head rule specif updat account base relat store balanc account rule withdraw monei bal bal bal bal bal bal withdraw account queri variabl occur bodi rule existenti quantifi updat prolog nondeterminist section size base relat store section section store student size store size section prolog rule enrol student section size num num num num num num nondetermin due variabl occur bodi rule existenti quantifi prolog infer mechan updat queri bulk resort updat rule prolog base relat rule give salari sal sal sal sal order give salari issu queri nondeterminist delet call queri deduct problem solut insert salari salari semant assert retract prolog exact effect call code assert retract difficult predict result updat reli oper semant declar semant order execut subgoal import logic content goal rule exampl chang order assert retract bodi rule yield result distribut prolog system version retract bug strang behavior call extern distribut problem assert retract sever access creat difficulti updat mechan prolog suitabl deduct show problem condit updat prolog avg sal relat base averag salari depart prolog avg avg intent hire averag salari depart stai hire averag salari hire bob greater bob prolog undo updat backtrack dlp extens notion state inher notion updat state datalog set base deriv relat updat transit state state chang dynam logic logic reason program test chang valu environ natur semant updat extens datalog updat dlp logic warren datalog extens updat updat predic symbol divid disjoint base predic rule predic symbol dynam predic symbol base predic symbol dynam predic symbol basic addit delet tupl base relat atom form dynam predic symbol call dynam atom updat queri dlp form dynam atom updat ff queri updat execut queri ff evalu true updat ff simpli updat queri ff updat complex updat express liu updat repres nest updat queri dlp wai updat rule bodi updat queri dlp updat repres updat rule dlp bal bal bal withdraw account updat queri infer mechan dlp updat queri unlik undo updat backtrack queri dlp delet tupl bal bal dlp undo delet backtrack dlp support nondeterminist updat variabl occur bodi rule existenti quantifi nondeterminist updat rule defin dlp order num num num num num db queri insert joe section check full backtrack undo insert section section joe enrol nondeterminist section updat queri dlp queri part evalu express condit complet updat satisfi condit updat repres avg queri averag salari hire bob greater avg fail queri fail updat undon leav residu bulk updat repres dlp updat rule sal deduct problem solut sal sal sal updat dlp oper semant read updat mechan suitabl deduct dlp extend directli support bulk updat updat repres extens dlp sal sal sal sal sal xg queri updat perform transform definit datalog sal sal sal sal evalu relat denot current project attribut replac current instanc project ldl krishnamurthi extens datalog updat base relat dynam logic assign semant updat base fact updat primit updat action repres prefix symbol base insert delet denot action insert base fact current state kind updat distinguish semant kind updat order execut yield final state kind updat declar semant repres ff fi stand updat action kind updat updat result depend order execut order execut yield final state kind updat oper semant repres ff fi stand updat action semant kind requir ff execut fi result updat repres queri fire joe give salari liu queri chang order execut delet substitut variabl perform insert rule updat action bodi defin updat rule repres bal bal bal bal bal bal rule updat action evalu head rule queri rule updat action evalu directli queri unlik prolog variabl occur bodi updat rule existenti variabl quantifi infer mechan updat updat repres sal sal sal sal sal sal updat sal queri gener substitut sal sal sal chang salari sal sal group substitut support condit provis backtrack remov effect previou updat condit fail intend updat express semant variabl occur bodi infer mechan updat result rule similar rule version rule num num num num num deduct problem solut num db queri insert joe section db nondeterminist updat support updat mechan incorpor ldl nondeterminist updat ldl support choic oper form vector select instanti variabl satisfi function depend nondeterminist updat repres ldl num num num num num num choic oper section select insert dynam logic interpret updat ldl semant updat conson oper mean updat predic semant tricki transact logic notion transact essenti oper introduc prolog inform al logic program formal transact logic tr kifer bonner al bonner kifer tr extens syntact semant updat tr unlik main featur tr natur model theori sound complet proof theori tr primit oper provid delet insert fact del logic connect call serial conjunct denot introduc sequenc fi mean ff fi updat requir sequenc repres transact tr del updat requir sequenc repres del tr transact defin rule call transact liu updat rule repres bal amt del bal prolog tr variabl occur bodi rule existenti quantifi evalu mechan evalu execut nondeterminist updat natur support rule repres tr del transact condit updat repres tr avg avg dlp averag salari hire greater queri fail leav residu order support bulk tr relat assign relat spirit extens dlp discuss section rule tr give salari sal queri content relat comput rule held relat relat assign rule assign content relat relat assign pass argument defin rule salari tr approach deduct forc side stringent requir actual requir includ effici process abil express complex subtl relationship side simpl clear semant logic program infer capabl express forc deduct languag simpl root logic deduct problem solut gram relat data model discuss problem standard deduct languag datalog complex object updat examin typic solut import area discuss publish date deduct languag complet program task perform singl framework deduct languag support common applic clear deriv inform rule null valu deduct languag structur method import featur object properli support encapsul address deduct semant defin expect express deduct languag develop incorpor import featur solv problem discuss implement techniqu investig power deduct system eventu deliv market extend applic acknowledg author michael associ editor acm comput review critic read articl valuabl comment suggest substanti improv qualiti accuraci survei averi acm comput cori correct work partli support natur scienc engin research council canada refer frontier intern confer data base theori pp lnc power languag manipul complex valu vldb journal ed intern workshop theori applic nest relat complex object lnc languag complex object acm tod formal semant model acm tran system foundat addison weslei object ident queri languag primit acm sigmod intern confer manag data pp datalog extens queri updat comput system scienc liu introduct life joint intern confer symposium logic program pp mit press logic program languag inherit logic program interact conceptu languag acm tran system program languag object vldb journal theori declar knowledg minker foundat deduct logic program pp morgan kaufmann publish magic set strang wai implement logic program acm symposium principl system pp amateur introduct queri process strategi acm sigmod intern confer manag data pp minim indefinit inform disjunct deduct intern confer data base theori pp lnc formal model nishio intern confer deduct objectori pp formal approach data knowledg engin set construct logic languag logic program power magic logic program logic program languag intern confer extend technolog pp hypothet negat linear acm symposium principl system pp hypothet complex express theoret comput scienc transact logic program intern confer logic program pp mit press program transact logic intern workshop program languag york pp overview transact logic theoret comput scienc model class hierarchi contradict acm sigmod intern confer manag data pp develop data model schmidt conceptu model pp practic constraint intern confer larg data base pp morgan kaufmann deduct problem solut abduct deduct intern confer logic program pp mit press integr data model program paradigm acm sigmod intern confer manag data pp data model queri languag exodu acm sigmod intern confer manag data pp ed object morgan kaufmann logic program springerverlag model acm tran system logic program languag deduct nishio intern confer deduct pp nest relat base knowledg acm sigmod intern confer manag data pp program logic bulk updat hypothet reason ieee transact knowledg data engin foundat logic program logic program complex object acm symposium principl system pp ldl system prototyp ieee transact knowledg data engin relat model data larg share data bank comm acm extend relat model captur mean acm tran system algebra queri optim nest relat acm sigmod intern confer manag data pp prolog figur commun acm de model determinist queri updat deduct intern confer larg data base pp morgan kaufmann design implement system acm sigmod intern confer manag data pp al system commun acm languag program logic finit set logic program semant disjunct deduct intern confer data base theori liu pp lnc disjunct deduct intern confer logic program autom reason pp lnc manag system acm tran offic inform system logic languag deduct implement intern symposium system advanc applic pp prototyp intern confer data engin ieee comput societi impact logic data base intern confer larg data base pp york ed logic data base york logic deduct approach acm comput survei altern fixpoint logic program negat comput system scienc semant gener logic program journal acm stabl model semant logic program intern confer symposium logic program pp mit press impact logic program comm acm practic constraint acm symposium principl system pp descript semant model acm tran system deduct system prototyp intern confer inform knowledg manag pp acm dynam logic lectur note comput vol live lattic rule languag data knowledg engin godel program languag mit press hypothet reason logic program logic program effici transit closur algorithm intern confer larg data base pp morgan kaufmann implement multimedia knowledg base manag system acm tod logic journal acm deduct problem solut constraint logic survei logic program deduct object base meta data manag journal intellig inform system implement program logic program suitabl algorithm comput partial transit closur intern confer data engin pp ieee comput societi updat abduct intern confer larg data base pp morgan kaufmann declar earli effort commerci deduct technolog vldb journal languag reason schema acm sigmod intern confer manag data pp logic foundat languag journal acm logic program complex object comput system scienc introduct mit press definit research direct ieee transact knowledg data engin earli year logic program commun acm updat event calculu logic program real horn languag intern confer larg data base pp morgan kaufmann logic program set comput system scienc program languag intern confer larg data base pp morgan kaufmann semant null extend nest relat acm tod type extens datalog set tupl intern logic program symposium decemb pp mit press deduct object base languag inform system overview object languag journal intellig inform system type extens datalog set tupl journal logic program design implement relationlog deduct system intern workshop expert system applic workshop august pp press liu prototyp deduct proc intl engin applic symp februari pp press foundat logic program deduct languag method method inherit acm sigmod intern confer manag data pp ed theori relat comput scienc press logic object technic report oregon graduat oregon languag bad idea workshop program languag develop dbm oopsla pp acm york declar express deduct updat acm symposium principl system pp languag updat minker foundat deduct logic program pp morgan kaufmann publish transact updat deduct ieee transact knowledg data engin design overview system intern confer logic program pp mit press magic condit acm tod languag facil design applic acm tran system concurr updat prolog intern confer logic program pp mit press updat logic program acm principl system pp logic languag data knowledg base comput scienc press normal form nest relat acm tran system declar semant deduct logic program minker foundat deduct logic program pp morgan kaufmann publish extend stabl semant normal disjunct program intern confer logic program pp mit press ed applic logic kluwer academ publish survei deduct system logic program coral deduct system vldb journal system comput intern confer logic deduct problem solut gram reason pp lnc logic reconstruct relat theori schmidt conceptu model pp updat logic program modular stratif magic set datalog program negat journal acm queri languag relat inform system extend algebra calculu nest relat acm tod magic count method acm sigmod intern confer manag data pp xsb effici deduct engin acm sigmod intern confer manag data pp reason mainten hypothet reason gener comput introduct relationlog system intl workshop deduct logic program june pp function data model data languag acm tran system oz program model van leeuwen comput scienc todai lectur note comput vol pp execut algorithm effici pure declar logic program languag logic program art prolog mit press model integr manufactur data sam ieee comput societi paraconsist disjunct deduct theoret comput scienc data languag intern confer larg data base pp morgan kaufmann principl system comput scienc press principl volum comput scienc press comparison deduct system intern confer deduct pp lnc beat datalog acm symposium principl system pp deduct system vldb journal captur dynam defer updat intern confer logic program mit press
IR/466 5 regress model ordin machin learn approach ralf technic berlin depart comput scienc statist fr berlin klau technic berlin depart comput scienc neural inform fr berlin februari tr depart comput scienc technic berlin abstract contrast standard machin learn task classif metric regress investig problem predict variabl ordin set refer ordin regress task ordin regress frequent social scienc inform retriev human prefer plai major role problem problem ordin regress due order class problem machin learn commun wide consid statist statist method reli probabl model latent variabl condit stochast order paper develop distribut independ formul problem give uniform bound risk function main differ classif restrict map object rank transit asymmetr combin theoret framework result measur theori present approach base map object scalar util valu transit asymmetri appli principl structur risk minim emploi support vector machin deriv learn algorithm base larg margin rank boundari task ordin regress method easili extend nonlinear util function give result inform retriev task learn order document respect initi queri show algorithm outperform naiv approach ordin regress support vector classif support vector regress case rank introduct train sampl object machin learn statist find depend object target valu process call induct requir make assert finit set observ wide accept kind induct requir restrict assum depend restrict reflect prior knowledg problem hand chosen contrast statist prior knowledg express form probabl distribut observ assum depend machin learn techniqu make prior knowledg explicit restrict paper preliminari version al introduct space assum depend make distribut assumpt vapnik machin learn problem classif regress estim problem ordin regress share characterist task basic assumpt made machin learn iid sampl xy xy set map learn procedur select map predefin loss risk function minim statist learn theori risk function expect loss loss point weight probabl principl empir risk minim function minim loss emp sampl introduc quantiti bound deviat inf deriv chervonenki pollard al main scenario consid finit unord set task refer classif learn iff iff adequ captur loss point metric set real task refer regress estim case loss function account full metric structur metric loss function optim probabl model optim measur term squar error class estim theorem state loss function result smallest mse problem share properti case finit set exist order element contrast regress estim deal fact space variabl type exhibit ordin scale consid result measur continu variabl philip ordin scale lead problem defin loss function task anderson exist metric space distanc element defin simpl loss reflect introduct order loss function found act true rank predict rank suggest exploit ordin natur element order space induc map loss function pref act pair true rank predict rank approach make formul distribut independ theori ordin regress give uniform bound risk function roughli risk function measur probabl misclassif randomli drawn pair class section problem ordin regress inform retriev al al econometr model gruber al classic statist anderson de mora applic suggest model rank interv real line task find latent util function map object scalar valu due order function restrict transit defin properti prefer relat result learn task refer learn prefer relat al wong al learn prefer relat reduc standard classif problem pair object consid true gener properti transit asymmetri violat tradit bayesian approach violat stochast transit al pair task learn reduc find util function reflect prefer induc unknown distribut learn procedur pair object applic larg margin idea structur risk minim al al result algorithm similar support vector machin vapnik vapnik popular recent year due good gener properti vapnik smola scholkopf girosi weston al verri weston watkin learn applic svm product object method potenti function call appli al make model distribut depend model ordin regress util function incorpor correl featur minim comput cost predict rank object section introduc set ordin regress present result algorithm field statist section present distribut independ model ordin regress give explicit bound loss function show relat ordin regress problem prefer learn problem justifi choic prove basic properti loss section argu classif metric regress solv ordin regress problem satisfactori give train error minim method interpret deriv distanc measur captur loss finit sampl section deriv algorithm ordin regress model rank applic larg margin techniqu base map object underli util extend approach util function appli section present learn curv approach control experi experi data inform retriev notat paper vector denot lower case bold element vector denot sake notat symbol simultan denot probabl distribut probabl abbrevi symbol mean distribut expect wrt distribut denot dx superscript denot estim base randomli drawn sampl size superscript refer optim function set real natur number denot distribut depend model ordin regress section recal cumul threshold model ordin regress input space ae object repres featur vector denot number featur distribut depend model ordin regress outcom space fr order rank symbol denot order rank interpret prefer iid sampl ae xy finit number multinomi distribut stochast order cumul model order make assumpt stochast order relat space jx jx jx jx stochast order satisfi model form monoton function refer link function stochast order fact jx jx jx jx jx jx longer depend appli jx jx model call cumul threshold model motiv assum ordin measur latent continu variabl observ rank train set iff function determin data definit real line divid consecut interv correspond rank make linear model latent variabl ffl readabl drop subscript follow context distribut depend model ordin regress model link function ffl distribut ffl ln exp complementari tabl link function model ordin regress denot normal function ffl random compon distribut ffl equat ffl ffl make distribut assumpt ffl ffl obtain cumul model link function distribut function ffl note quantil function ffl monoton function distribut assumpt ffl yield complementari model tabl estim cumul model order estim conclud model observ equal ffl jx transform probabl rank equal estim sampl distribut independ model ordin regress transform frequenc event note complex model determin linear assumpt ffl thought regular result likelihood equat complet train set obtain random equat call design matrix multivari gener linear model gener linear model determin design matrix equat link function ffl sampl link function coincid distribut assumpt data method calcul maximum likelihood estim exist detail main difficulti maxim likelihood introduc nonlinear link function conclud review classic statist method highlight main assumpt made ordin distribut assumpt unobserv latent variabl assumpt stochast order space distribut independ model ordin regress section present distribut independ model ordin regress anderson philip doubt feasibl formul distribut independ model ordin regress semin work claim appeal requir ordin data model invari arbitrari permut statement start point analysi distribut assumpt made model space jw map object rank function induc order element input space rule distribut independ model ordin regress neglect order space function class written class arg max function class properti theorem unknown probabl measur function class minim risk function defin ae proof relationship equat dx dx minim iff arg max insert dx closer equat show suffici condit map incur equal risk assum rank risk equal independ term rank map optim rank arg max properti account order space inappropri case natur order defin element distribut independ model ordin regress distribut independ risk function account requir argu distribut independ model ordin regress singl function pref induc order space incur smallest number pair object similar reason sobel model properti note due order space map induc order space equat defin rank differ pair object distinguish equat function violat order account weak order induc appendix case automat care risk function account order space pref pref pref note definit xy iid sampl drawn obtain iid sampl drawn fact exploit role paramet loss role paramet incorpor priori knowledg highlight characterist rewrit equat equat expand expect make pref pref jx dx jx dx distribut independ model ordin regress assum peak rank variat small independ pref term bracket unequ rank exchang role pref control amount assum variat treat assumpt concentr probabl rank effect control complex learn procedur risk function interpret account term bracket depend defin pref risk function rewritten expect pref equat show great similar classif learn risk function due loss function pref exploit ordin natur loss function found risk function ordin regress account order present appeal properti risk function section applic erm principl erm principl recommend map minim empir risk emp pref expect function emp defin emp pref size train set deriv train set unfavor practic applic order reduc complex learn appli deriv uniform converg bound pref notat simplif defin space event pair xs ys unequ rank rank differ jy sg distribut independ model ordin regress defin risk misclassifi randomli drawn pair pref shorthand notat denot object pair train set deriv jy ni indic function rank differ cardin theorem assum unknown probabl measur xy assum unequ sequenc equal rank equal hold true pref pref corollari assum train set size drawn iid unknown probabl measur equal hold true emp emp emp jj proof theorem prove explicitli deriv expand probabl occurr event distribut independ model ordin regress obtain dx dx dx dx ffi unequ sequenc equal rank definit event account term exclud probabl deriv ae fact pref time pref equat equal pref pref final ffi equat prove statement corollari directli theorem term prove corollari import paramet appar size train set depend due restrict pair rank differ equal higher higher size train set account function defin function corollari state empir risk map sampl loss relat map sampl constant factor depend problem distribut independ ordin regress reduc classif problem pair object import chain argument lead origin problem find function map object rank sampl distribut independ model ordin regress ordin natur rank account result formul find function map pair object class oe revert chain argument lead difficulti observ admiss function fulfil equat defin transit relat appendix call problem problem prefer learn shown optim function pair object result function longer transit al problem stochast transit al note demand transit asymmetri effect reduc space admiss classif function act pair object distribut independ bound pref main advantag distribut independ model ordin regress theorem applic uniform converg bound chervonenki pollard vapnik vapnik theorem probabl measur xy iid sampl vc dimens set function fl pref hg ae fi fi pref emp fi fi oe exp oe probabl random choic corollari probabl ffi inequ hold simultan pref emp ln probabl inequ hold simultan arg min emp arg min pref pref pref ln ln ffi proof virtu obtain iid sampl iid sampl drawn proof theorem mere applic distribut independ model ordin regress uniform converg bound set indic function theorem vapnik statement corollari obtain set side theorem ffi solv statement valid emp emp virtu hoeffd inequ probabl ffi emp pref ln ffi combin statement corollari inequ obtain statement corollari theorem vc dimens induc loss function class fl pref hg involv maximum number object arrang order set function equat major merit theorem fact vc dimens coincid number free paramet deriv algorithm overcom problem ordin regress section theorem bound risk maximum likelihood solut section distribut assumpt hold true drawback theorem bound bound true risk pref assum patholog distribut underli data tighter bound found make addit set function map object rank set ff rg function map object real line threshold point note close relationship cumul model section give tighter bound justifi algorithm present section theorem applic structur risk minim bound al al distribut independ model ordin regress theorem assum set map object rank exist set map object function function vice probabl measur xy iid sampl deriv equat dimens set function bound function function emp fl min jf probabl ffi pref log log log ffi js proof recal theorem al theorem real valu function class fat function bound function continu fix probabl ffi learner correctli classifi iid gener exampl fl min error bound log log log ffi account iid sampl obtain iid sampl drawn classif pair carri base differ bound pref substitut util result theorem prove theorem dimens thought maximum number object arrang order function minimum margin fl equat worthwhil maxim margin min jf bound true risk emp constant function properti risk properti risk section give properti risk function give suffici condit function pref minim risk function show pref measur rank coeffici rank induc pref space equat argu naiv approach ordin regress problem insuffici captur exist depend data theorem function pref obei pref pref jx jx pref pref jx jx pref pref jx jx jx jx jx jx jx jx minim risk function function proof rewrit risk function pref dx dx jx jx pref jx jx pref jx jx pref jx pref properti risk definit pref minim pref integr minim result conclud minim pref restrict hypothesi space function match order induc unknown order measur amount discrep pref risk function substanti give result theorem set rank rank coeffici kendal tau defin kendal bja number pair higher rank compon pair number pair higher rank compon pair finit sampl sampl deriv equat emp emp pref emp pref pref arg min emp counterpart pref theorem sg fh pref sg set predict rank sampl pref proof definit emp emp emp pref emp pref whilst definit kendal tau rank count minu loss time error quantiti rescal interv start minu obtain emp emp pref emp pref rearrang term prove theorem algorithm latent util model point view minim emp emp minim kendal tau pref term rh depend kendal tau linear function number step bubbl sort resort line kendal argu loss constitut natur measur compar map object rank argu simpler approach treat ordin regress problem classif problem treat rank indic instanti real valu function al solv ordin regress problem option neglect inform train set due order class consid unnecessarili larg hypothesi space achiev satisfactori gener consequ defici demonstr section option assum metric structur space rank invari choic rank real number section conclud defin loss captur number incur order inform previou strike balanc insuffici assumpt classif approach base strong assumpt metric regress approach algorithm latent util model section appli theori section deriv algorithm ordin regress equat strict order induc weak order theorem weak order appendix function weak order set measur theori function call scale relat weak order finit number rank similar cumul model suggest model rank disjunct interv real line denot set disjunct interv relat induc defin algorithm latent util model definit linear util model introduc linear function relat mention scale assum function call util function relat measur theoret approach problem note scale induc map object rank rule equat incur error train set equat iff note prefer relat express term differ featur vector thought combin featur vector pair object assum finit margin featur vector class make constraint stronger ji algorithm latent util model ffi ffi ffi ffi ffi ffi ffi ffi figur map object rank rank rank axi note coupl hyperplan defin margin coupl hyperplan min time defin rank boundari posit measur violat constraint assum vector fulfil constraint equat weight vector maxim margin time rank boundari equat figur determin minim squar norm kwk constraint approach close relat idea canon hyperplan support vector classif theoret justif applic srm theorem theorem bound pref case introduc lagrangian multipli primal optim problem ff fi min max ff fi perform unconstrain optim respect lead dual problem ff max ff ff ff ff algorithm latent util model problem standard effici solv techniqu mathemat program mangasarian joachim due term solut ff problem calcul sole term product featur vector refer featur vector fact exploit section gener method nonlinear util function reconstruct util function optim vector ff solut problem optim weight vector written linear combin differ featur vector train set ff pair object ff support construct optim scale space pair refer support vector util function repres vector ff train set reconstruct util function addit constant ff calcul benefit significantli reduc comput cost estim rank boundari estim rank boundari note due equat differ util greater equal train exampl ae fraction object train set rank differ start rank ni fi fi algorithm latent util model estim arg min optim threshold rank li middl util closest object rank detect train exampl recal unconstrain optim primal problem equat ff fi ff condit condit replac ff evalu solv qp problem estim rank boundari object classifi equat extens nonlinear util function make model introduc map call comput ff involv comput product differ vector equat model replac occurr ff max ff ff ff ff defin assum featur space reproduc kernel hilbert space uniqu determin call kernel properti product space function simplifi result avoid explicit comput map order estim equat comput ff ff jj deal nonlinear util function run comput difficulti state theorem bound risk pref depend dimens margin quantiti min algorithm gener featur space result section present result algorithm present section start give result artifici data algorithm control set give learn curv field inform retriev retriev model assum initi queri user rank small number document return ir system rank find rank remain document accord rank user learn curv ordin regress experi compar gener behavior algorithm svm support vector regress method pai attent ordin natur treat rank class continu valu reason algorithm comparison due similar regular kwk hypothesi space make compar gener observ unit squar ae uniform distribut assign observ result ffl ffl vector predefin threshold figur point assign rank addit distribut quantiti ffl shown treat task classif call incorrectli classifi train exampl solid line figur rank boundari train set size ordin regress classif metric regress figur scatter plot data point map interv ffl equat learn curv svm sv regress algorithm ordin regress measur pref error bar confid interv estim risk pref order compar algorithm randomli drew train sampl train set size rang make repres rank drawn train set classif svm carri comput hyperplan algorithm present weston watkin algorithm present section chose kernel paramet case support vector regress loss function definit loss threshold transform real valu predict remain data point estim risk pref result averag result train set size obtain learn curv shown figur pref pref larger constant factor theorem algorithm ordin regress gener faster exploit ordin natur underli compar classif explain fact due model latent util coupl figur hold true case svm learn curv ordin regress algorithm close explain fact predefin threshold defin differ size chosen util continu rank estim regress algorithm magnitud result gener behavior figur assign point rank learn function base randomli drawn train sampl size row bottom result algorithm present section result svm treat rank class result assign rank number result assign rank real number underli assign result figur plot assign unit squar rank rank function learn randomli drawn train set rang size paramet comput learn curv rightmost column true shown column algorithm present section perform vari train set size train set size method found util function set threshold repres true rank column show result svm task hyperplan coupl ordin natur account result train point column assign made algorithm repres rank similar good result learn gener behavior compar ordin regress method defici task appar chang rank fourth column appli time rank dramat gener behavior method conclud crucial task applic metric regress estim method task ordin regress definit rank section automat solv algorithm applic inform retriev experi make initi queri user make ir system return bundl document user user assign rank small fraction return document task learn algorithm assign rank remain unrank document order rank remain document assum quantiti interest number incur rank induc learn algorithm quantiti captur emp equat document respect rank measur emp remain document experi paramet experi publicli dataset found result ohsum dataset collect william consist document queri respect rank result partial wrt textual queri experi result queri effect replac consist document order appli algorithm comput document vector compon restrict term time result term lead document vector normal length document vector uniti joachim train set size ordin regress classif train set size ordin regress classif figur learn curv svm algorithm ordin regress ohsum dataset queri measur pref error bar confid interv figur show learn curv svm algorithm ordin regress measur term number incur algorithm show good gener behavior compar algorithm treat rank separ class note plot pref proport misclassifi pair restrict pair rank quantiti larger estim probabl incur result randomli drawn pair exclud document rank evalu set theorem figur show learn curv algorithm measur number misclassif treat rank class svm perform algorithm import note minim loss automat lead minim number optim order train set size ordin regress metric regress train set size ordin regress metric regress figur learn curv algorithm ordin regress ohsum dataset queri measur pref error bar confid interv figur show learn curv algorithm ordin regress measur number incur perform artifici real world dataset algorithm fail find rank minim number explain fact equidist assum util longer hold account data space type problem figur show learn curv algorithm measur number misclassif expect curv algorithm measur note algorithm minim pref explain gener behavior note made adapt paramet size reason task train exampl set reason portion valid discuss discuss paper introduc learn task ml commun task ordin regress ordin natur outcom space task interest inform social scienc problem machin learn exist approach problem field statist section approach problem make distribut assumpt underli continu random variabl loss function applic distribut independ method solv ordin regress problem exploit fact induc loss function class set indic function give distribut independ bound risk show ordin regress problem exist uniqu prefer learn problem pair object result built link ordin regress classif method time pair object rank interv real give tighter bound risk bound involv quantiti margin time rank boundari base result present algorithm similar support vector algorithm stress algorithm instanti present theori retain model rank appli gaussian process zhu al gibb mackai type linear classifi order deriv util model approach rank result complet algorithm note present loss involv pair object problem classif reformul pair object lead problem learn relat order extend binari classif method multipl techniqu tibshirani weston watkin techniqu size hypothesi space quadrat linearli number recent work shown learn relat gener behavior method extend multipl class relationship measur theori prefer learn investig includ question applic method present section lead automat larg margin theorem answer question final close gap method extens past theori develop field machin learn acknowledg indebt collabor peter stimul research topic fruit craig mark jason leo bernhard scholkopf alex smola provid support vector implement al project fund technic berlin fip relationship measur theori prefer learn give result measur theori model prefer structur materi recal basic notat relat system identifi prefer relat theorem weakli order set motiv util function approach set relat call tupl relat system write arb recal gener properti relat bartlett prove good gener behavior backpropag method appli classif problem year extens success applic made develop theori depend capac concept dimens bartlett relationship measur theori prefer learn definit binari relat set reflex ara symmetr arb bra asymmetr arb transit arb arc neg transit arb arc complet arb bra weakli connect arb bra definit binari relat set weak order asymmetr neg strict order weakli connect weak order transit weakli order set relat defin relat recal call theorem weakli order set theorem weakli order set set weak order exist definit fr asymmetr transit relat easili shown empir system weak order properti pair rank strict order map relat system defin equat obviou weak order refer refer theoret foundat potenti function method pattern recognit learn autom remot control haussler scale sensit uniform converg learnabl journal acm regress order categor variabl journal royal statist societi seri philip measur model order categori variabl appli statist sampl complex pattern classif neural size weight import size network ieee transact inform theori mitchel futur sort learn medic risk evalu advanc neural inform process volum pp predict gener abil learn machin ph usa vapnik support vector network machin learn bayesian classifi larg margin hyperplan hilbert space technic royal london de predict comparison ordin model commun statist theori method multivari statist model base gener linear model interv order interv graph jon wilei son refer mackai effici implement gaussian process approxim support vector machin technic massachusett institut artifici intellig laboratori ai memo nonlinear dynam program tibshirani classif coupl advanc neural inform process san ca morgan kaufmann learn prefer relat inform retriev aaai workshop text categor machin usa regress model ordin machin learn approach submit machin learn comput techniqu model learn chapter neural network applic pp kluwer academ accept public probabl inequ sum bound random variabl journal american statist associ robust statist john wilei son text categor support vector learn relev featur technic depart artif intellig report advanc kernel method support vector chapter make svm learn practic mit press maximum regress data journal american statist associ rank correl method refer gaussian process tutori nonlinear program hill regress model ordin data journal royal statist societi seri gener linear model chapman hall support vector machin appli face recognit neural inform process usa press converg stochast verri properti support vector machin neural comput automat inform organ retriev smola support vector machin refer manual technic royal london support vector learn ph technisch universita germani anthoni structur risk minim hierarchi technic royal london regress estim support vector learn machin master technic munich complet rank procedur loss function commun statist theori method tverski foundat measur vol ii san academ press gruber construct quadrat polynomi object function intern confer econometr pp springer refer linear foundat extens kluwer academ estim depend base empir data natur statist learn theori statist learn theori john wilei son chervonenki uniform converg rel frequenc event probabl theori probabl applic support vector reproduc kernel hilbert space random technic depart madison watkin densiti estim support vector machin technic royal london watkin support vector machin technic royal london spline model observ data societi industri appli mathemat linear structur inform retriev annual intern acm sigir confer research develop inform pp gaussian regress optim finit linear model technic neural comput research
IR/467 5 digit librari young partnership allison ben juan pablo lisa michel weng interact lab maryland colleg md abstract inform resourc access digit interfac resourc peopl digit interfac typic design older children adult begun develop digit librari interfac young children year prototyp system call offer graphic interfac review search result paper describ motiv design partnership establish children design technolog outcom current lesson learn keyword digit inform retriev design educ participatori cooper design zoomabl user interfac research grow bodi knowledg digit adult older student develop interfac suitabl younger elementari school children year children access sound favorit space young children forc negoti interfac time label requir complex proper read necessit understand abstract concept content knowledg young abil recent interfac digit librari begun develop young children mind virtual electron world anim product interfac digit collect tend smaller older children adult common trend past decad digit librari interfac simul book metaphor hierarchi inform screen librari commun scienc librari catalog develop mid led professor christin ucla system necessit keyboard requir read keyword side graphic book read list content result system exemplifi technolog creat older elementari school children read skill import part interfac work hci commun produc numer altern approach visual search result approach interfac develop maryland enabl user drag slider rang queri select check box radio type string search color size code marker item repres search result approach work order data filter linear categor valu select nomin valu string search young children interfac cognit challeng abstract connect idea queri criteria side screen result visual queri result concret approach develop michigan part digit librari initi separ space queri object launch queri user simpli select object queri drag data set collect search launch result queri highlight data set interact system abstract queri surprisingli difficult children grasp extrem concret label young children understand question queri approach idea base work xerox parc graphic queri transpar box filter drag scatter plot data filter button label boolean queri oper slider control threshold numer data filter overlap oper combin result queri immedi highlight difficulti system li understand boolean queri concept approach present boolean search diagram develop waikato system user drag circl queri term term creat type workspac depend placement queri creat dynam result digit resourc displai system simpl user type keyword term read list difficult young children research graphic direct manipul interfac hand exampl discuss show possibl definit limit system young children user address begun research develop graphic direct manipul interfac view queri result digit librari support nation scienc foundat began research septemb content provid discoveri channel depart research enabl develop digit librari prototyp devot multimedia inform anim technolog teach strategi develop limit content start point role children teacher design process children plai import role creat technolog children establish team research includ comput educ visual elementari school children classroom teacher research method make point view enabl voic heard design process research understand impact children design digit understand technolog impact children user understand develop work children wai locat hci collabor team children ag year ag work local elementari school children year grade design partner children lab critic role initi brainstorm experi set direct digit librari research children school inform understand idea generaliz popul children made role children research studi integr teacher design partner lab group section role challeng design partner role design partner children includ part design process experi children equal stakehold design technolog children adult equal opportun contribut design process past research team develop technolog design methodolog support children role design partner strategi work children partner call cooper inquiri combin adapt prototyp figur children adult collabor design partner hci lab participatori design observ techniqu contextu inquiri time resourc technolog children adult alik gather field initi develop reflect write journal pursu write creat technolog subsequ section paper design discuss detail specif design method brainstorm digit librari technolog current design partner team includ faculti graduat undergradu staff children year disciplin comput art repres member team meet afternoon week lab field summer meet intens hour dai began digit librari research fall ad design team elementari school teacher grade grade teacher technolog coordin children team school teacher children lab team work research project minimum month meet school hci lab environ process introduct children mentor teacher consid develop softwar teacher point bit worri contribut team research children made easi knew worri challeng kind design partnership adult children design partner negoti team easi task children accustom adult adult accustom charg children learn trust adult listen adult learn elabor listen passiv listen process time found extrem import work design partnership found month design team develop abil build idea origin due develop process time expect strength design partner experi wait find direct pursu continu relationship children offer great deal flexibl design activ research children formal schedul made strength partnership member design team feel empow challeng design partner process children experi live contribut opinion adult respect found chang children child share idea team todai adult book screen child inform previou research attempt adapt design partner experi school set europ found paramet school dai exist power structur teacher made difficult develop true design partnership time devot activ build partnership involv children teacher technolog develop chose integr role inform research role defin late roger sussex notion question children part design process numer research includ children design make distinct children tester end design children partner contribut children inform design process critic role children plai part inform design process technolog children observ exist input paper sketch technolog children offer input feedback young peopl plai import part design process continu case design partner experi digit librari found method work children easier negoti school set opportun work ethnic popul minim disrupt busi school dai learn children digit librari technolog chang make useabl children wide varieti background style children work research team inform children male femal african asian work pair children pull regular schedul time school year children work research session minim time complement research effort design team back lab children work school taught teacher design run resist school dai expect teacher ownership technolog design partnership partnership minim impact busi school dai detail method inform design section design process began digit librari research call session teacher children thought import brainstorm previou work felt encourag feel team split group consist research group design digit librari futur anim inform group prototyp materi children call string brainstorm prototyp develop gener idea digit librari interfac interfac specif content case interfac graphic team spent time critiqu digit librari system anim magic school bu explor world anim amaz anim activ center dk seri arc nation zoo lincoln park chicago children technolog teacher research observ children technolog adult write children session children note wrote thing thing figur note journal anim digit librari session collat sticki note board frequenc pattern dislik overwhelm session search inform anim charact child extrem annoi children begin note adult team numer sticki note comment bore novemb turn children explain good search make applic children found annoi due anim charact children adult team compar found observ team spent session brainstorm draw journal critic idea crystal team idea team metaphor journei design partner explain thing decemb thought friend charact give kid reason find thing idea emerg interfac base anim thing notion drag anim part repres thing search number journal text question anim pictur drag repres question idea emerg question children answer anim anim famili part addit area inform design partner wast product anim children love decid inform hard wait version idea emerg teacher critic structur approach digit librari teacher point children learn anim group older children learn anim geograph wai anim children grade level advantag librari teacher point big differ grade teacher cover compar grade repres differ ag set member team began work elementari school children local school realiz team knew young children search complex queri understand conduct empir studi school develop understand children search base learn lab develop set hierarch nest envelop base categori inform child design partner interest anim children school search envelop pictur anim observ behavior learn children search differ depend gender found boi tend dump envelop floor thought put thing search anim girl team tend care search time interest pictur find exact anim question led notion applic fulli support structur search equal valid effici method access inform step back lab begin design begin feel idea emerg previou design session zoomabl author tool children artist began sketch team refin idea notion clearer team kid told repres queri formul queri kid held search criteria child notion search result began form team develop made link digit librari applic author tool ultim meant build interact prototyp top architectur addit concept area anim evolv form zoo farm pet bird search area function prototyp develop technic continu refin interfac queri kid paper chip repres search criteria peopl repres kid consult team microsoft access metadata anim imag contribut content partner child design partner insist biologist wrong spent afternoon web prove point correct metadata interact prototyp usabl design brought back school inform children fifti part explor paper prototyp offer feedback comput prototyp studi report detail section full descript current prototyp present prototyp initi interact prototyp call built continu zoom applic lab origin develop partnership research royal institut swedish institut comput scienc nottingham collabor storytel applic built java toolkit develop research zoomabl user interfac access metadata imag anim microsoft access mention previou section base design team develop prototyp applic current version consist area user media anim figur show initi screen area area virtual zoo zoo content anim familiar set enter zoo user map virtual zoo zoom part children find anim interest search criteria children media zoom find search criteria zoo area fulli implement world area children anim anim geograph present children globe spin zoom zoom region world find anim live part world search criteria children media polar north find polar search criteria world area fulli implement search area user abil visual manipul queri featur queri preview search area pictur figur charact top left area kyle dana call provid view search criteria queri region make search area item region compon queri form item left side region repres type media imag camera repres item side region repres hierarchi anim classifi enabl children media anim base biolog taxonomi explor children click shadow item enabl drill hierarchi item item select zoom replac item shown move user click arrow left hierarch item item click zoom queri kid hold neck item part queri criteria media item zoom kyle hierarch item dana click item kyle dana make back origin locat remov criteria current queri figur left initi zoo world search area search item kyle dana visual repres queri children formul prototyp perform intersect item select categori union item select categori limit express successfulli enabl children desir queri requir explicitli distinguish union intersect figur show seri screenshot demonstr children pose queri red region kyle dana show result current queri children zoom region click result queri pose user quickli item correspond queri criteria prototyp child inform school result encourag differ gender children displai search disappear prototyp children construct complex queri paper prototyp children encount difficulti size imag result size navig control begun address version prototyp lesson learn start learn number lesson design process digit librari technolog term design combin children design partner lab children inform school quickli brainstorm possibl minim disrupt school schedul children teacher understand design partner child inform school offer feedback idea present elabor build idea case lab lesson learn design process concern teacher introduc teacher delai children equal foot child adult found teacher learn children group children treat teacher quickli embrac technolog great deal contribut design content structur digit facilit work school term lesson learn mo st interest children search reason search item adult led firm belief work develop connect digit librari author tool notion content specif interfac emerg strongli needless develop interfac digit librari figur process queri imag anim fly eat plant child click item repres imag child click categori thumbnail result camera top child click item child click arrow hierarchi queri point imag anim fly notic thumbnail result area child click categori child click item complet specif queri child click result area child result result area form make zoo area make content specif metaphor critic children digit librari librari place wander kind inform futur direct term futur forward explor possibl navig search applic built function built multipl mice work time explor happen children collabor navig inform enhanc content ad text item develop direct connect major addit prototyp expect empir studi younger children acknowledg work accomplish child design partner lab rebecca thoma inform grade yorktown elementari school indebt teacher led technolog coordin carol princip thoma inspir intellectu discuss ben catherin ann joseph research project support es support nation scienc foundat discoveri wild life baltimor learn commun project refer dynam queri inform imp evalu human factor comput system acm pp design interact storytel space children design interact system acm pp extens zoomabl user interfac graphic toolkit java user interfac softwar technolog acm design storytel technolog encourag collabor young children human factor comput system acm pp contextu defin system san morgan kaufmann cooper develop technolog children children human factor comput system acm pp children technolog design partner druin design children technolog san morgan kaufman design collabor educ human factor comput system acm pp enhanc dynam queri movabl filter inform visual human factor comput system acm pp inform environ workspac intern confer digit librari acm pp design cooper design comput system lawrenc erlbaum graphic queri specif dynam result preview digit librari user interfac softwar technolog acm pp st children inform cognit demand book librari system school librari media pp anonym young children search strategi construct search queri human factor comput system acm kid didnt confirm knew druin design children technolog san morgan kaufman participatori principl practic lawrenc erlbaum children inform retriev case analysi opac journal american societi inform pp technolog design partnership children behaviour inform technolog scienc librari inform literaci school librari media pp
ML/468 6 sound algorithm imag retriev index paolo marco dei itali abstract imag retriev system aim improv effect search imag set region similar imag assess comput similar pair region combin result imag level paper provabl sound algorithm perform similar search region access index result demonstr effect compar altern retriev strategi introduct real world field weather requir effici access imag base content goal imag retriev system defin set properti effect content imag featur retriev user access cbir system imag possibl arrang specif spatial organ recent number imag retriev system present imag set pixel share common visual color textur process similar assess imag split distinct match region imag region refer coupl combin similar queri db imag comput combin similar score match region figur region match algorithm recent emerg cbir system exist work partial support grant murst nave heurist match algorithm associ region imag obtain incorrect scope spatial constraint account paper focu nearest neighbor user imag similar queri imag queri present sound algorithm imag implement system algorithm independ underli cbir requir similar imag comput similar score match region begin discuss outlin limit queri process exist imag retriev system section formul region match present approach ws correct resolut section present effici effect section conclud limit exist system order give adequ obtain exist system extract overlook import phase queri process visualseek similar imag comput account rel posit region queri carri simpl match phase perform region queri rang queri dimens request region respect queri higher candid set imag consist imag present region result set previou optimum match comput user imag imag singl correct associ queri region singl region db inform number queri region lost figur similar imag assess account similar match region set candid imag user request imag similar forc similar threshold retriev similar retriev system fragment imag wavelet match phase consist retriev db region similar queri region score descriptor db region index rang radiu determin issu queri region combin appli imag region obtain match rel size match region ad obtain similar score imag imag similar queri imag higher threshold return queri result main limit visualseek resid fact requir specif similar threshold rang queri suit scenario user priori knowledg distribut similar guess similar high lead empti slightli lower result overwhelm number return imag blobworld cbir system fragment imag region homogen respect color cluster algorithm blobworld queri resolut algorithm structur index color descriptor blob match phase perform blob queri predetermin number order similar db region issu nearest neighbor queri index combin phase consid region obtain match phase comput imag similar oper combin region score approach major limit match queri blob comput ignor match singl blob imag distinct queri blob section number region return match phase priori unrel number imag request user specif queri imag show section lead miss correct imag cbir system discret wavelet transform fuzzi mean algorithm divid imag region similar queri imag imag comput sim distanc correspond function map distanc valu similar satisfi varianc distanc comput sampl region distanc region account differ color textur descriptor rel size combin phase consist comput similar imag averag similar match region denot region match algorithm queri region sim sim match region queri region region sim optim region match match region carri ignor spatial local inform color region account comput similar region assum similar imag comput monoton function rm sim match region expect similar score note blobworld satisfi combin oper averag optim region match problem formul gener assign problem ij sim similar score region fr qn region fr sm denot index set match ng goal maxim function rm sim introduc variabl ij ij ij sim max rm sim ij ij ij ij eq mean determin score sim match eq express constraint region assign region definit set ij valu satisfi constraint express eq call correct match definit correct match ij queri region region call complet match note correct match imag number region lower queri region complet definit correct match maxim function express eq call optim denot opt index evalu section describ algorithm aim evalu nearest neighbor queri carri reduc number candid imag optim region match problem solv similar imag comput combin distanc region approach access method index region imag index structur effici answer nearest neighbor perform sort access output region order distanc respect queri region retriev match queri run sort access index region region queri imag suitabl condit stop sort access imag retriev account region return index sort access phase optim region match problem solv candid imag region retriev sort access imag return result queri region region stop region result set candid imag figur produc candid set imag sort access phase ensur result includ set candid sort access stop imag candid set lead similar score lower imag stop condit account correct region assign definit sort access phase halt optim match imag lead lower score respect correct match candid comput account region retriev index case similar score obtain sort access tabl comput imag imag similar averag region similar candid set imag fi score imag candid set potenti lead score continu sort access phase add imag candid set score region match region sort access stop imag ad candid score fourth obtain complet match definit imag score sort access phase imag candid set lead lower score monoton combin function rm sim ensur algorithm correct imag result imag lead score order solv optim region match problem set candid comput similar score queri region region candid imag rq rq region imag similar region imag similar tabl sort access queri imag clear sort access phase stop complet assign account region return index scan lead ws algorithm shown figur random access phase consist comput similar score ij queri region region candid imag return region result set reason blobworld algorithm stop condit exist complet assign ws queri region rq iq open sort access index scan insert result region set stop sort access imag complet assign region imag region pair rq rs rs comput score ij comput optim return imag highest similar score sim figur ws algorithm comput optim assign candid imag hungarian algorithm gener assign problem reduc linear assign problem due eq correct ws omit lack independ specif rm sim function combin region score similar reli monoton rm sim note sort random access phase ws resembl fagin algorithm major differ deal issu correct match tabl incorrectli stop sort access step result preliminari techniqu perform sampl consist imag obtain region index queri workload consist hundr randomli chosen imag includ experi perform pentium ii mhz pc main memori run window nt set experi present concern effici approach order test perform ws figur compar averag number candid imag hungarian algorithm function number queri valu sequenti solut queri lead number candid imag equal number imag horizont line label exact region assign sequenti index version number depend number queri region graph ws algorithm reduc number candid imag perform degrad number queri region complex find object intersect set augment confirm figur queri time shown region ws ws ws ws ws ws figur averag number candid imag number queri region time show effect compar result obtain ws algorithm fraction queri region queri lead approxim queri figur tradeoff qualiti result queri evalu cost shown qualiti measur sum similar score imag normal respect case region queri cost comput time rel time resolv queri graph show qualiti cost strictli correl number queri region reduc major part point fall effect reduc queri cost region queri imag work introduc origin approach correct resolut similar queri imag qualiti figur tradeoff qualiti cost approxim queri retriev algorithm ws present comput optim match region queri imag region order maxim similar score imag preliminari experi conduct system shown approach effect respect altern retriev strategi refer imag retriev wavelet page sept seeger effici robust access method point rectangl page atlant manag complex match retriev spatial arrang sept malik system imag index retriev page june zezula effici access method similar search metric space page aug zezula process complex similar queri access method page mar daubechi ten lectur wavelet fagin combin fuzzi inform multipl system page june samet rank spatial page aug kuhn hungarian method assign problem naval research logist shim similar retriev algorithm imag june smith chang fulli autom imag queri system acm multimedia page nov
HCI/469 4 intern symposium wearabl comput oct usa wearabl spatial conferenc space billinghurst human interfac technolog laboratori advanc percept unit washington bt laboratori box heath wa usa unit kingdom abstract wearabl comput provid constant access comput commun resourc paper describ comput power wearabl provid spatial graphic audio cue aid commun result wearabl augment realiti commun space audio enabl avatar remot collabor surround user user natur head motion attend remot commun freeli awar side move commun space conferenc space support dozen simultan user inform user studi suggest wearabl commun space offer amount inform access natur interfac introduct broad trend emerg interact portabl comput commun facil remain open question comput aid mobil commun wearabl comput recent gener portabl machin worn provid constant access comput commun resourc wearabl comput defin comput subsum person space control wearer oper interact access wearabl typic belt back pack head mount displai wireless commun hardwar input devic chord keyboard configur demonstr number real world applic includ aircraft mainten navig assist vehicl mechan applic wearabl dramat improv user halv task time case vehicl inspect target applic area user benefit expert assist network enabl wearabl comput commun devic enabl remot expert collabor wearabl user situat presenc remot expert found significantli improv task current collabor wearabl applic involv connect local remot user problem interest comput power wearabl support collabor multipl remot peopl explor visual audio enhanc aid collabor commun space creat remot user repres wearabl comput issu increasingli import telephon incorpor comput power portabl comput telephon kei issu comput mediat commun confer phone call effect prior work field teleconferenc comput support collabor work address question background research role audio visual cue teleconferenc produc mix result experi conduct compar audio audio commun condit sellen summar report main effect collabor perform due collabor technolog mediat type technolog mediat peopl gener prefer audio perform task effect audio video case perform collabor natur vari task interact speech cognit problem solv visual cue import task requir video transmit nonverb cue overestim video show commun avail view share workspac user attempt commun video conferenc environ gestur wildli recogn gestur base fact speech critic medium teleconferenc experi thought audio suitabl creat share commun space pure audio system high qualiti audio conferenc multipl particip flip switch month trial al found audio suffici usabl commun space major problem user easili space user visual cue determin interact user increasingli difficult discrimin speaker higher incid speaker overlap interrupt problem typic audio space suggest audio small group usabl peopl present shortcom overcom visual spatial cue bodi languag cue combin show attent interest simpl version cue replic desktop video conferenc enhanc desktop conferenc tool includ visual confer tabl alongsid share document text chat facil confer tabl includ icon peopl confer simpl microphon particip activ interest infer absenc spatial cue video conferenc system mean user find difficult peopl pai attent hold side establish ey contact video conferenc system attempt provid spatial cue hydra system multipl small posit local user user easili attend individu particip turn face monitor side support system wall projector transmiss screen creat remot life size particip seat real tabl user make ey contact conduct parallel prototyp support spatial video conferenc ey contact common disadvantag system user control remot camera posit viewpoint spatial relationship particip unlik collabor technic problem overcom system scale support larg group particip virtual realiti provid altern medium group peopl share commun space british telecom demonstr virtual conferenc user repres life virtual avatar virtual room user freeli move space set viewpoint spatial relationship collabor virtual environ spatial visual audio cue combin natur wai aid commun effect show peopl easili monitor spatial audio stream select interest simpl virtual avatar spatial audio model enabl user discrimin multipl speaker spatial interact valuabl govern interact larg group enabl crowd peopl inhabit virtual environ interact imposs tradit video audio conferenc wearabl commun space result previou section suggest ideal wearabl commun space high qualiti audio commun visual collabor underli spatial metaphor import aspect creat collabor commun interfac visual audio present inform current wearabl comput head mount displai stereo headphon displai inform present combin inform fix user viewpoint doesnt chang user viewpoint orient posit inform fix rel user bodi posit vari user viewpoint chang posit requir user viewpoint orient track inform fix real world locat vari user viewpoint orient posit requir user viewpoint posit orient track bodi world stabil inform displai attract number reason inform space overcom resolut limit head mount displai work user wear head mount displai seat rotat chair track head orient user experi inform surround effect million pixel inform present enabl annot real world context depend visual audio creat inform enrich environ intuit real world task current wearabl inform displai work chosen begin simplest form orient give user impress surround virtual cylind visual auditori inform figur contrast tradit head stabil wearabl interfac figur head stabil inform displai figur freedom displai head mount displai navig cylindr portion inform space field view wai rest space rotat inform space user track user head orient space requir addit hardwar map switch voic input direct angl requir simpl freedom tracker minim hardwar requir make cylindr spatial inform displai attract cylindr displai natur head bodi motion vertic make difficult user disori previou paper found user locat inform rapidli type inform displai tradit wearabl inform space sawhnei schmandt demonstr spatial audio improv access audio inform wearabl user simultan audio stream displai configur wearabl conferenc space creat remot collabor virtual avatar distribut user avatar live video stream speak audio stream spatial real time emit avatar figur spatial conferenc space user turn face collabor talk awar place user move space enabl viewpoint spatial relationship collabor space support dozen simultan similar current collabor virtual environ displai user real world enabl remot collabor real world task remot user wearabl comput head mount displai interact desktop workstat wearabl conferenc space face remot user crucial factor establish equal relationship remot collabor technic requir conferenc space place year remaind paper describ prototyp develop featur implement research initi collabor singl wearabl comput user desktop pc user situat encount wearabl user field request remot expert aim develop wearabl interfac support medium size meet manner natur intuit hardwar wearabl comput custom built pc base comput ram run window figur show user wear displai comput figur wearabl hardwar hand held wireless radio trackbal button primari input devic displai pair virtual convert displai remov left virtual head mount displai occlud resolut pixel field view stereo headphon inerti gyroscop freedom orient tracker wireless lan give internet access feet base station wearabl compat sound board headmount microphon desktop pc standard pentium class machin internet connect sound capabl wearabl interfac wearabl comput graphic hardwar limit wireless bandwidth interfac simpl conferenc space run full screen applic initi blank remot user connect user join conferenc space repres block pixel textur map static pictur resolut imag crude suffici identifi speaker importantli spatial relationship wearabl user hope futur wearabl comput cpu power wireless bandwidth suffici support real time video textur map wearabl user head track simpli turn face speaker interest user navig roll trackbal forward backward viewpoint move forward backward direct virtual imag real user roll trackbal move virtual space navig space user constrain chang viewpoint horizont radar displai show locat user conferenc enabl user find easili figur show wearabl interfac wearabl user perspect interfac develop microsoft librari suit wearabl interfac support spatial internet telephoni user connect conferenc space audio broadcast user space spatial distanc direct speaker listen user face move closer speaker speaker volum due sound speaker constrain remain plane listen audio simplifi audio cull audio stream speaker closest listen broadcast spatial significantli reduc cpu load conferenc space custom develop telephoni librari incorpor microsoft direct sound librari figur user view wearabl conferenc space desktop interfac user desktop workstat interact conferenc space similar interfac wearabl case applic run window applic desktop user navig space movement rotat head posit left button held translat user backward forward space map avatar orient movement desktop interfac intuit wearabl interfac user desktop machin wear headmount microphon talk conferenc space listen stereo headphon distribut softwar architectur wearabl desktop interfac base custom librari collabor virtual environ develop british telecom wearabl desktop client applic run multicast group creat enabl client commun multicast socket multicast protocol effici mechan broadcast data multipl network node shown scale larg commun conferenc space rout multicast shown figur transform data repres avatar posit orient messag data audio data user connect commun space assign uniqu identif user move avatar id posit orient inform broadcast transform multicast group transform data flow rate user receiv client group updat relev avatar posit orient transform inform user audio stream relev receiv user posit figur distribut softwar architectur similarli user speech digit broadcast audio multicast group receiv client sender ip address identifi avatar audio belong posit orient audio spatial real time audio implement util microsoft direct sound technolog captur audio broadcast audio multicast group receiv client comput buffer plai back direct sound order audio oper full duplex mode captur rate bit result data rate connect multicast group user connect disconnect affect user conferenc space initi user experi develop wearabl conferenc space set explor spatial visual audio cue compar tradit portabl commun audio collabor mobil phone process conduct user trial evalu spatial audio visual affect commun collabor preliminari inform trial found user easili discrimin simultan speaker audio stream audio expect effect notic number simultan particip particip prefer visual collabor hear speech poor qualiti visual enabl connect spatial relationship speaker cue commonli commun gaze modul bodi motion radar displai find collabor bare visibl user found continu real world task talk collabor conferenc space move conferenc space trackbal collabor block critic portion user field view interfac easi intuit head track wearabl easier desktop interfac user connect conferenc space spatial multipl audio stream put sever load slow graphic head track make difficult wearabl user confer peopl simultan problem reduc faster cpu hardwar support graphic wearabl comput sever spatial cull audio stream overcom select stream singl spatial remov audio altogeth present prototyp wearabl commun space spatial visual audio cue enhanc commun remot group peopl interfac show comput commun facil coupl wearabl platform preliminari result found user prefer audio visual cue spatial audio make easi user discrimin speaker suggest applic wearabl comput provid altern tradit commun devic conduct formal user studi confirm result evalu effect spatial cue commun pattern futur plan investig presenc spatial video enhanc commun incorpor live video textur map enabl user remot collabor speak user send view improv collabor task wearabl commun space support numer collabor applic particip sit desk mobil share virtual environ facilit audio visual commun group peopl ad potenti textual audio inform specif trait import augment commun space user form effect cognit map associ annot inform physic object surround demonstr bodi stabil system commun space locat rel user abil explicitli posit object commun space rel user real world locat excit rang applic user view avatar confer particip overlaid attach physic notic board repres power vision conferenc remot video conferenc particip separ window screen spread user posit space user prefer acknowledg colleagu british telecom hit lab product nick dyer produc render figur refer smart wearabl comput person vol march wearabl result system design guidelin interact juli sydnei australia tour prototyp mobil augment realiti system explor urban environ intern symposium wearabl octob lo ieee pp design wearabl comput chi georgia march empir studi collabor wearabl comput chi confer denver pp collabor perform physic effect outcom commun cscw nov cambridg acm press remot effect mediat talk technolog human comput vol pp comparison mediat commun psycholog vol pp interact human commun scientif american vol rethink video technolog interperson theori design implic academ press disembodi commun video multimedia environ chi human factor comput acm pp role vision mediat commun ed erlbaum pp field studi media space cscw nov cambridg acm press desktop futur multimedia conferenc bt technolog vol octob pp speech pattern chi york pp spatial cue improv videoconferenc chi york pp videoconferenc virtual social design cscw octob pp teleconferenc system capabl multipl person ey contact half mirror camera common point extend line gaze ieee transact circuit system video vol august virtual conferenc bt technolog vol octob pp spatial model interact virtual environ european confer comput support cooper work septemb auditori scene perceptu organ sound mit exploit simultan listen chi confer denver york pp support casual meet network cscw nov cambridg acm pp crowd collabor virtual environ chi georgia march hundr million pixel displai ieee vrai seattl septemb ieee lo pp world comput augment interact real world environ user interfac softwar technolog novemb pp evalu wearabl inform space ieee vrai march ieee comput societi lo ca design spatial audio nomad environ intern confer auditori displai novemb human comput survei nonverb behavior system workshop perceptu user interfac oct ieee comput societi lo interact multimedia internet exploit realiti multicast network architectur virtual environ ieee vrai confer ieee comput societi lo march pp
HCI/470 4 confluenc comput vision interact graphic augment realiti klau david chri dougla dieter koller andr kramer eric rose ross european research centr germani verlag music munich architectur project manag uk texa tx abstract augment realiti technolog user view real world enhanc augment addit inform gener comput model ar user interact combin real virtual object natur paradigm constitut core technolog applic appli ar fulfil strong requir includ registr track sensor object detail understand scene comput vision imag process technolog plai role acquir sensor scene model balanc robust integr automat imag analysi interact user assist input magnet tracker order meet requir emerg global inform futur interact highli collabor distribut conduct research pertain distribut collabor ar technolog demonstr work prototyp collabor interior collabor mechan repair paper describ approach ar exampl underli technolog introduct augment realiti technolog user view real world enhanc augment addit inform gener comput model enhanc consist virtual artifact fit displai inform exist real object ar user work examin real receiv addit inform object task hand exploit peopl visual spatial ar bring inform user real world pull user comput virtual world ar user interact mix virtual real world natur paradigm user interact inform visual constitut core technolog applic real applic strong demand ar technolog met demand list order combin real virtual world seamlessli virtual object align real model user environ essenti determin locat optic properti viewer calibr regist object global coordin track time user move interact scene realist merg virtual object real scene requir object behav physic plausibl manner occlud occlud real move shadow indirectli illumin object cast shadow enforc physic interact constraint real virtual detail descript physic scene order creat ar interfac requir present virtual object high build user interfac high convinc interact inform visual techniqu research issu top applic context ar address distribut share virtual support user collabor connect local remot ar instal comput vision imag process technolog brittl slow plai role acquir sensor scene model video signal backdrop virtual object explor imag understand techniqu regist track camera object extract structur scene balanc robust integr automat imag analysi interact user assist input magnet tracker approach ar combin graphic live video signal camera produc enhanc view real displai standard video monitor track user motion provid basic point capabl form point devic attach magnet shown figur suffic applic scenario demonstr ar queri inform object real world manipul virtual interact relat view scene screen conduct research pertain distribut collabor ar technolog grow global inform expect demand collabor highli interact comput technolog network emphasi li provid interact concept distribut technolog user collabor explor augment local remot form demonstr work prototyp collabor interior collabor mechan repair paper describ approach ar exampl underli technolog previou work research augment realiti recent expand area research briefli summar research conduct date problem control object cursor present free hand gestur feiner al augment realiti laser printer mainten task augment realiti system aid user step requir open printer replac part wellner demonstr augment realiti system offic work form virtual desktop physic desk interact physic desk real virtual document al augment realiti medic applic ultrasound imageri patient patient video imag al augment realiti system surgic plan applic al augment realiti comput gener stereo graphic perform telerobot task describ applic augment realiti manual manufactur process pose problem illumin combin synthet imag imag real scene util comput vision ar depend requir applic deer explor method requir produc accur high resolut stereo displai order achiev virtual physic registr azuma bishop al describ techniqu calibr displai hugh present method track equip ar vr gleicher witkin state control regist model object imag neumann address issu dynam calibr registr augment realiti system system measur registr error combin imag correct pose error grimson al explor vision techniqu autom process regist medic data patient head segment ct mri data rang data relat recent develop object camera calibr algorithm calcul relationship coordin system geometr imag plane camera kanad develop techniqu track imag fiduci mark patient real time special hardwar correl affin project small imag area imag al special optic track devic plate led attach medic track ultrasound probe regist data bet al henri al stereo data align patient head mri ct data applic scenario develop basi applic demonstr section discuss exampl potenti applic section describ detail grasp system research issu focu collabor interior design fig augment room show real tabl real telephon virtual surround virtual chair note chair partial occlud real tabl virtual lamp occlud tabl scenario interior design assum offic manag work interior design layout room offic manag intend order furnitur room comput monitor pictur real room viewpoint camera interact manufactur select furnitur queri graphic paradigm system descript pictur furnitur manufactur made model piec group furnitur meet requir price request user piec render furnitur monitor view room furnitur posit furnitur rearrang user satisfi view piec monitor actual room move camera furnish room point view user consult colleagu remot site run system user remot site manipul set furnitur static pictur room design user instantan distribut lock mechan ensur piec furnitur move user time group user site work layout room figur group record list furnitur layout furnitur room futur refer collabor mechan repair fig augment engin mechan repair scenario mechan assist ar system examin repair complex engin system present varieti inform shown figur annot identifi describ present import inform mainten manufactur record user interact real object natur set point devic monitor comput mechan point specif part ar system displai line text describ visibl compon give user hint object queri point devic object add delet annot tag track annot move engin orient line attach annot tag engin follow visibl user easili identifi part view engin mechan benefit assist remot expert control inform displai mechan ar system system infrastructur grasp system form central core effort graphic visual scene align provid interact interfac figur show schemat grasp hardwar configur workstat hardwar gener graphic imag displai high resolut monitor scan convert transform graphic displai monitor standard video resolut format scan convert mix gener video signal video signal input camera lumin kei magnet capabl translat rotat workstat continu updat valu posit orient track includ video camera point devic frame grabber digit video imag process comput oper softwar implement program languag schemat diagram softwar architectur shown figur specif align coordin space order align virtual real object model user environ essenti calibr sensor displai devic determin locat optic regist object interact devic global coordin track user oper scene calibr sensor video equip initi camera locat tracker effect scan video mix determin procedur refer track calibr describ techniqu mix comput vision algorithm vari amount inform interact input user imag calibr essenti step ar system mix live video input synthet gener geometr data live input captur analog video signal camera synthet data render digit scan convert video signal order align determin horizont vertic posit scan convert imag respect camera relationship aspect ratio synthet test imag marker posit comput distort paramet translat test imag scan convert video signal imag calibr determin locat marker grab imag discrep origin locat marker posit grab imag determin translat scale distort induc scan convert interact imag calibr method user identifi marker grab imag distort due frame grab live signal synthet signal pass scene video monitor workstat monitor keyboard scan convert video workstat video frame grabber pal video camera point devic tracker hardwar tracker transmitt pal receiv object fig grasp system hardwar configur applic window system hardwar window toolkit augment vision interfac system system fig grasp system softwar configur grasp system automat routin comput distort paramet easier find homogen color area imag thin line marker automat algorithm test imag black squar find dark fit line boundari determin corner squar corner suffic determin distort paramet scan convert comparison approach illustr import distinct interact automat human work sharp line pattern provid interact automat algorithm accomod due digit effect work thicker pattern automat algorithm determin geometr properti extend area edg corner area essenti design system applic visual calibr aid chosen intend recur theme work fig camera calibr grid camera calibr camera calibr process calcul paramet imag pixel camera assum paramet camera remain fix augment realiti session camera paramet track updat comput camera point camera object calibr grid shown figur posit grid posit center marker grid world coordin system map object featur imag featur calcul current vantag point camera imag distort properti map point imag coordin determin rai scene align object point focal point camera camera rai object point intersect focal point uniqu determin pose imag properti defin linear system equat comput camera paramet map object point imag point minim measur error detail grasp system interact camera calibr user center pattern label type code keyboard comput camera calibr algorithm discuss essenti calibr pattern fit strength automat algorithm calibr board show arrang black squar white background process imag quickli determin posit extent black blob imag fit rectangl blob outlin finer scale match left top bottom squar calibr determin calibr paramet camera magnet tracker calibr paper comput vision techniqu reli optic inform exploit magnet track interact input track system consist transmitt receiv attach camera pointer scene track system automat relat posit orient tracker track coordin system transmitt box task tracker calibr procedur determin track coordin system resid respect world coordin system ar applic critic issu vr applic system track rel motion absolut posit track object devic real world coordin frame greatest import ar scenario realiti augment virtual inform begin calibr magnet track relat local coordin system world coordin system process perform calibr grid camera calibr determin locat point calibr grid magnet tracker point world coordin establish system linear relat track coordin world coordin determin unknown posit orient paramet tracker registr interact devic real object addit devic calibr previou scene physic object user interact interact devic object regist respect world coordin system calibr pointer attach tracker section fig point devic pointer registr magnet track system regist track posit pointer system figur pointer determin posit tip pointer relationship attach magnet tracker procedur requir user point point space orient time pointer attach tracker posit orient tracker mark tracker coordin system record result procedur set point direct common properti point distanc pick point space direct point orient pick point comput paramet defin posit orient point approach solv system linear equat object registr object registr process find paramet defin posit object rel system step track object order establish relationship magnet receiv object studi strategi determin pose object camera base reli calibr camera match landmark object project imag plane method coordin calibr manual pointer magnet order infer pose object extens research pose determin comput vision literatur techniqu appli limit class model scene focu comput vision research typic autom featur essenti augment vision locat landmark point imag found manual user assum point map locat imag rigid transform project repres orient object rotat creat linear system unknown point point uniqu solut practic assum input data system squar solut order reliabl result rotat treat element independ linear system orthonorm solut produc rotat matric produc undesir artifact transform combin graphic system orthonorm enforc ad addit penal creat nonlinear optim problem solv gradient descent gradient descent initi unconstrain constrain solut typic found iter fig calibr track engin wirefram engin model regist real model engin calibr model turn movement track graphic show camera good align imag calibr produc error depth term solut case engin model shown figur approach produc rigid transform match landmark point imag pixel error centimet error evid object turn figur attribut error primarili error camera camera model calibr procedur topic ongo research error develop procedur section calibr object point devic method assum point devic capabl gener world coordin posit real world case point devic calibr magnet tracker attach wooden cone devic accuraci half error bia transfer directli object calibr error problem comput rigid transform set point pair pointer keystrok user world coordin coordin landmark point object rise linear system unknown uniqu solut point case point solv error object error measur produc solut repres transform nonlinear penalti term introduc order produc constrain solut track object sensor calibr registr refer stationari aspect scene gener ar deal unwant dynam scene track denot abil system cope dynam scene calcul extern camera paramet pose object result calibr track regard contin updat paramet explor approach magnet optic track magnet track magnet track devic tracker technolog corpor receiv attach camera potenti move object receiv freedom translat respect locat fix world coordin reli magnet technolog tracker provid posit orient updat speed oper laboratori setup magnet track larg realist track data easili corrupt materi vicin receiv tracker oper limit rang drawback limit accuraci sensor read optic track optic track method base detect track featur imag corner salient easi reliabl detect imag uniqu featur world track approach corner squar attach object wall figur track move camera scenario relev ar applic user move scene continu viewpoint assum model scene exist add black scene aid track process squar regist scene model camera calibr techniqu section point posit camera scene track pai attent speed robust algorithm exploit time coher user user move continu motion benefit process result previou imag adapt model user motion predict track featur frame perform full camera calibr procedur incom imag reason inform imag error prone sensit fact account imag process method real video data order cope sensit exploit physic constraint move object priori knowledg forc chang motion camera assum forc constant veloc case gener motion constant translat veloc center mass rotat constant angular veloc axi center mass constitut motion model figur fig optic track approach track corner squar left figur show corner room squar figur show detect squar measur posit orient camera move object case magnet track chang time respect stationari world translat angular refer motion estim motion paramet angular veloc motion estim filter base kalman filter techniqu unknown successfulli model process order veloc filter process enabl smooth motion presenc noisi imag enabl step video frame predict reduct search space featur video imag speed process typic drawback optic method base fact reason inform imag lead numer instabl perform carefulli hand advantag imag real object perfectli align render counterpart align error minim imag optic track approach accur advantag optic track oper visual basic limit spatial rang natur human track object navig environ object interact realist virtual object real scene requir virtual object behav physic plausibl manner occlud occlud real move shadow indirectli illumin object cast shadow enforc physic interact constraint real virtual augment realiti system detail descript physic scene track object context activ vision refer goal object fovea updat pose frame zc xc yc fig motion translat rotat rotat ax center mass constant absenc forc denot world coordin yc denot camera coordin frame acquisit scene descript straightforward approach acquir scene descript suggest geometr ar system align physic counterpart real section advantag model easili serv start point access semant inform demonstr mechan repair applic problem approach geometr model case interior restor build typic oper model complet model abstract real physic object typic show detail repres model gener scene model fulli anticip occurr mug car crane construct user human collabor system account chang exist build construct engin partial disassembl figur user object expect virtual object interact chang object rest scene comput vision techniqu acquir addit inform scene inspect inform gener lack semant descript scene directli augment realiti electr wire essenti context realist fig modifi engin fact user remov air cleaner detect ar system virtual model align real posit virtual object scene expect futur ar system hybrid model data provid understand object relev task enrich model automat acquir inform scene investig imag understand techniqu ar applic paradigm comput shape determin depth inform sketch imag full descript scene provid distanc respect pixel imag ongo research develop techniqu determin object shape stereo motion object shadow highlight import algorithm user work scene algorithm initi setup gather scene inform compil rough sketch scene updat techniqu ar session option involv modal laser rang scanner sonar sensor section discuss approach investig shape estim stereo data stereo classic method build shape visual cue calibr camera imag scene vantag point stereo locat domin object featur imag point object rai cast focal point camera featur posit imag intersect determin distanc object point camera shape stereo studi extens comput vision literatur choic imag featur detect algorithm featur match algorithm imag critic import depend type method algorithm shape stereo result depth map depth map goal comput shape inform ar applic avail map exist algorithm comput depth map ar context camera geometri obtain calibr camera independ camera calibr method section detail stereo algorithm paper heart algorithm li comput dispar map describ distanc match point imag accomplish comput match kind imag featur deriv origin smooth intens edg posit neg corner posit neg corner separ contrast direct corner distinguish featur type improv match result prevent incompat imag featur match posit neg corner algorithm iter determin match imag featur comput imag start initi hypothet match iter chang minim energi function integr entir imag influenc error term relat qualiti edg match left smooth term ensur recov surfac exceedingli rough noisi figur show pair stereo imag dispar map comput imag shown figur depth map shown figur figur show comput depth map occlud virtual float cube fig pair stereo left imag imag shape shade complementari geometr shape extract approach exist exploit reflect properti object imag smooth object uniform surfac reflect properti exhibit smooth variat intens reflect light refer shade inform human natur vision system determin shape object goal shape shade replic process point design algorithm automat determin shape smooth object imag fig dispar comput stereo pair figur dispar row dispar column brighter point larger dispar fig comput depth map pair imag figur brighter point farther camera comput depth map occlud virtual object case float ad scene shape inform number applic area knowledg spatial characterist scene import shape shade inform fill gap depth map left shape extract method geometr extract work highli textur object featur match imag shape propag shape inform homogen area investig smooth object surfac determin directli shade inform method characterist strip calcul shape shade set framework modern differenti geometri extend method comput deriv object independ standard surfac orient calcul independ deriv inform classifi critic verifi assumpt reflect function identifi effect imposs imag mix real virtual world scene descript obtain interact form basi mix real virtual world mix perform interact great emphasi effici depend scene option pursu scene descript geometr hand combin list real virtual model geometr render comput interact real virtual object render model real object lumin kei featur video substitut respect area live video data user pictur monitor blend virtual object live respect relationship real virtual object straightforward approach applic polygon scene descript descript comput depth section depth map convert geometr tessel decim data tessel phase real object initi graphic hardwar depth map virtual object perform automat virtual object pixel camera valu depth map drawn set background color real object present origin video displai unmodifi pixel figur present virtual cube occlud wooden stand engin occlud object real approach approach advantag depend applic full geometr model movement camera polygon approxim depth map rang camera posit scene model camera move copi depth map directli hardest map recomput camera motion project transform depth valu depth map approach work stationari camera shape extract algorithm perform interact speed geometr model approach suffer inher depend scene complex scene repres larg polygon render technolog process real time size depth map depend scene complex approach applic depend requir system design depth provid full inform larg part scene back face object singl view deriv polygon model suffer incomplet larg camera motion uncov unseen area scene descript collabor ar discuss techniqu solut make ar singl user object object realist displai interfac serv present user consist coher world real virtual object applic scenario remind fact virtual real environ natur encount person interact virtual environ platform research cscw distribut interfac challeng ve system effort relat vrml context grasp interest problem paradigm distribut ar investig solut area distribut comput experi system architectur collabor interfac share virtual world architectur share ar system support virtual environ type replic system architectur share user base separ user call share logic object creat specif interpret model interfac rapid feedback user interfac make replic architectur attract ar turn lead share user view manipul object independ manag share inform simultan conflict updat lead inconsist interfac distribut compon applic model replic distribut support user interfac applic execut process host comput grasp interfac distribut correspond concurr system result architectur implement successfulli interior design demonstr provid distribut replic architectur directli support forecast librari grasp system base messag bu forecast dynam approach construct distribut ar applic central support reliabl commun facil distribut extens hardwar system bu situat dynam connect distribut bu send receiv messag analog group commun broadcast system messag select capabl common system linda sun forecast messag bu implement fifo transport protocol special sequenc process uniqu global order messag simpler form node broadcast send messag sequenc reliabl protocol dissemin messag uniqu global order messag stream messag pass sequenc node detect messag schedul listen global messag stream protocol similar amoeba reliabl protocol reliabl buffer transmiss node sequenc node extra acknowledg messag bu abstract invoc replic transpar applic make program applic easier grasp programm familiar concept multipl local view extend distribut set forecast messag bu collabor ar demonstr implement model direct interact compon send pointer track inform remot gener function floor control state share video transmiss audio video librari synchron video track event style discuss augment realiti realist applic requir comput inform world user perform task ar system approach regist track object scene model import camera magnet tracker provid essenti realtim link comput understand world realiti sensor calibr carefulli incom inform align physic world sensor input full potenti current ar system due due lack algorithm interpret signal combin inform sensor research field comput signal pattern speech investig topic time algorithm matur project annual comput speed feasibl ar applic applic oper simplifi condit scene understand easier task gener comput vision problem oper borderlin comput vision inject autom process feasibl engin approach simplifi task algorithm hybrid includ interact user input modal paper shown develop explor techniqu address import ar issu pragmat approach build realist demonstr applic influenc research indic discrep state art tradeoff autom assist explor user interact reserv control scene augment synthet inform data base modal explor user interact comput gestur sound displai crucial regard question ar system obtain optic input similar user comput vision techniqu foremost remain provis interact capabl real virtual object integr seamlessli augment world accur track predict user camera motion essenti relat research direct lead investig collabor augment realiti report develop distribut infrastructur demonstr oper collabor set collabor ar technolog kei interact paradigm emerg global inform societi highli visual natur ar hard requir distribut demand develop collabor style invest approach address issu augment collabor potenti provid easier effici human comput skill merg capabl rapid research progress expect scenario collabor interior joint maintain repair complex mechan devic realiti user refer kh augment technic introduct grasp system technic report kh de rt distribut augment realiti collabor design applic eurograph architectur project manag engin introduct architectur cambridg unit novemb azuma bishop improv static dynam registr optic displai comput graphic siggraph page juli merg virtual object real ultrasound imageri patient comput graphic siggraph page juli neumann dynam registr correct system virtual realiti annual intern symposium page north march te track data associ academ remot control object gestur commun juli virtual realiti model version specif framework fuse stereo imag volumetr medic imag proc comput virtual realiti robot medicin page april ieee augment applic displai technolog manual manufactur process hawaii intern confer system page januari deer high resolut virtual realiti comput graphic siggraph juli architectur proc august jj zhai displai system augment realiti formal video programm confer human factor comput system page augment realiti commun juli illumin problem comput augment realiti page januari editor appli optim estim mit gleicher witkin camera control comput graphic siggraph page juli goldstein classic mechan hugh virtual environ track hardwar comput graphic siggraph page august ds comput hessian object shape shade technic report gj sj pl wm evalu valid autom registr system enhanc realiti visual surgeri proc comput virtual realiti robot medicin page april ieee automat registr method imag guid enhanc realiti visual ieee confer comput vision pattern page june grimson object recognit comput mit cj dj rl evan registr surfac data guidanc visual proc comput virtual realiti robot medicin page april ieee horn robot vision mit electr engin comput scienc seri mit massachusett horn mj brook shape shade mit calibr displai augment realiti applic virtual realiti annual intern symposium page septemb fran kaashoek andrew tanenbaum fault toler group commun oper system kramer distribut augment realiti submit vrai enhanc realiti oper room visual page lo octob ieee comput societi press low perceptu organ visual recognit kluwer academ michael donald audio video internet ieee april marr comput investig human process visual inform san jp realtim camera calibr enhanc realiti visual comput virtual realiti robot medicin page april jj applic augment realiti commun iro intern confer intellig robot page juli posit sensor registr imag proc comput virtual realiti robot medicin page april ieee decim triangl mesh comput graphic juli white paper technic june calibr requir procedur augment realiti system ieee transact visual comput septemb turk polygon surfac comput graphic juli kanad object registr imag overlai proc comput virtual realiti robot medicin page april ieee wellner interact paper digit desk commun juli ahuja motion structur perspect error error estim ieee tran pattern analysi machin rose object calibr augment realiti eurograph anderson resolv augment realiti symposium interact graphic page april acm press articl process macro packag llnc style
ML/471 6 hybrid coordin reinforc behavior control paper hybrid coordin method control architectur hybrid method advantag robust modular competit approach optim trajectori cooper paper show feasibl hybrid method applic autonom underwat vehicl behavior learnt onlin mean reinforc learn continu implement neural network appli realist simul carri result show good perform hybrid method behavior coordin converg behavior introduct robot methodolog design autonom agent robot middl huge amount robot applic methodolog endless quantiti method solv common characterist behavior encod coordin behavior implement control law input output basic structur consist behavior input sensor send output actuat behavior coordin phase coordin modul receiv behavior gener singl output appli robot output select singl coordin classifi competit output superposit behavior coordin call cooper coordin advantag disadvantag control perform autonom vehicl test architectur action select dynam approach process descript languag simul mission extract institut informat girona campu spain competit method action select show good robust behavior select modular ad behavior bad trajectori found continu chang domin behavior cooper method optim trajectori paramet properli tune lack robust small chang paramet lead control failur set behavior cancel action behavior higher prioriti obstacl avoid paper hybrid approach competit cooper coordin system aim advantag coordin hierarch hybrid node node act cooper competit coordin depend activ level behavior test feasibl hybrid coordin control architectur design test make high capabl reinforc learn robot behavior implement techniqu rl appli rl algorithm adapt coordin system research rl learn intern structur map perceiv state robot action work present mahadevan demonstr decomposit agent learn polici set robot simplifi learn speed approach paper continu implement algorithm gener state action achiev neural network approxim direct train network state field applic underwat robot work present paper correspond research project robot reinforc learn experi theoret assumpt present result base realist simul uri term due accur model simul sensor onboard control softwar work base real experi structur paper section describ hybrid coordin system section introduc continu algorithm behavior learn section applic test hybrid coordin method detail section simul result futur work present section hybrid coordin due disadvantag competit cooper methodolog aim make hybrid coordin method coordin hybrid approach robust modular competit approach good perform cooper coordin base normal behavior output output vector repres veloc behavior vector activ level import behavior control robot figur sharpli defin control action activ behavior coordin system set hierarch hybrid figur node input gener merg normal control node hierarch cooper coordin system idea good perform cooper predomin behavior complet activ node domin behavior suppress behavior complet activ domin behavior partial activ final combin input behavior slightli modifi domin behavior complet activ domin behavior nondomin slightli activ obstacl mix obtain situat cooper behavior robust present deal critic situat figur normal output behavior ni domin xi figur hierarch hybrid node coordin behavior sen behavior act behavior behavior figur architectur hybrid coordin system node abil gener normal gener behavior effect behavior depend squar activ domin assur critic situat domin control depend control produc behavior hybrid node tune phase coordin set behavior defin hierarch classifi behavior depend prioriti disposit coordin system hierarch hybrid node figur coordin method classifi hybrid approach gener domin behavior affect behavior level activ author knowledg sort hybrid coordin system present method offer good properti successfulli implement autonom robot method implement simul show good path robust modular control mission reinforc behavior program unknown paramet identifi solv robot system includ learn techniqu adapt order perform chang environ reinforc learn class learn suitabl robot onlin learn inform environ requir rl agent maxim scalar evalu interact environ evalu gener critic util function rl system map state environ action order obtain maximum reward state sensor inform perceiv robot action behavior output veloc rl knowledg form machin learn theori base finit markov process approach paper continu implement algorithm tempor differ mean transit probabl state dynam environ tempor differ method suitabl learn increment requir onlin robot learn import characterist algorithm optim action valu independ polici import architectur behavior learnt control vehicl origin algorithm base state perceiv action reinforc receiv updat valu denot pair continu valu converg greedi maximum state point optim action figur show algorithm paramet defin learn discount rate maxim futur reward agent concern maxim reward learn rate random action probabl explor agent explor action order find optim initi arbitrarili current state action maxim ˆ carri action world probabl ε appli random action short term reward state ˆ ˆ max ˆ ˆ α γ figur algorithm due finit larg learn time memori requir sophist method implement enabl gener state action paper continu implement algorithm neural network approxim weight updat backpropag algorithm direct converg proof continu implement suitabl network configur paramet algorithm demonstr converg continu algorithm structur show figur state reinforc function action maxq nn weight updat unit delai max backpropag learn figur continu algorithm structur neural network approxim input continu state output reinforc function associ state reward order find action maxim network evalu action appli action finit kind robot work autonom underwat vehicl call uri robot intellig applic consist target mean camera avoid obstacl set sonar sensor act autonom camera record movement target collid lose target applic design carri swim pool light absorpt appli applic fulfil realist simul work base real experi uri vehicl uri design built girona hull steel design withstand pressur meter spheric shape simplifi construct dynam model vehicl simul mission laboratori sphere direct due stabil vehicl pitch yaw architectur accomplish mission architectur behavior design behavior input sensor gener vector defin associ behavior gener activ level determin final robot movement figur show schema architectur behavior obstacl avoid goal avoid obstacl perceiv mean sonar figur behavior learnt continu algorithm dof reinforc function neg reward depend distanc obstacl detect activ level proport proxim obstacl target behavior target video camera point figur track board base chromat characterist rel posit target behavior learnt continu algorithm dof reinforc function neg reward target move posit rel coordin system activ level target fl sonar beam figur schema architectur β fr α α camera view sonar paramet α camera paramet figur sonar transduc video camera layout target recoveri goal behavior recov target disappear camera view dynam vehicl adopt simpl polici track system lose behavior spin move vehicl vertic direct behavior learn preprogram activ level contrari target behavior simul result environ call environ virtual real develop design implement mission integr softwar platform object orient control architectur autonomi charg control vehicl high low human machin interfac mathemat model vehicl virtual environ modul simul vehicl action modul virtual underwat figur simul sensor video figur run simul posit vehicl environ model identifi paramet uri architectur implement structur environ design figur move target introduc carri close path repeatedli veloc target chang maximum veloc behavior implement neural algorithm freedom implement independ reward behavior learnt influenc number iter requir learn dof approxim figur show evolut dof behavior train algorithm explor action space learn track target figur show map behavior learn phase dof behavior complet mission test figur show track error evolut mission vehicl close obstacl avoid behavior partial control track error hybrid coordin system gener cooper target lost simul episod order find optim neural network configur final layer neural network paramet specif behavior tabl figur learn evolut behavior figur map behavior figur track error evolut mission obstacl avoid behavior input variabl sonar transduc valu center perceiv output variabl ax vehicl speed critic function dist rt dist rt rt behavior activ act param α γ neural network input ax output sigmoid act function sigmoid act function act function tabl obstacl avoid behavior specif target behavior input variabl target posit target desir veloc estim output variabl ax vehicl speed critic function dist rt dist rt rt behavior activ target altern param α γ neural network input xt ax output sigmoid act function sigmoid act function act function tabl target behavior specif futur work paper hybrid coordin method control architectur method test simul experi architectur implement continu implement qlearn algorithm simul result show feasibl hybrid approach converg learn algorithm hybrid coordin demonstr behav robust competit coordin optim path cooper neural network implement algorithm demonstr converg optim obtain maximum reward futur work concentr realiz real experi improv behavior order learn simultan behavior rl function behavior acknowledg author acknowledg spanish govern project autonom system laboratori hawaii research collabor refer robot mit robust layer control system mobil robot ieee journal robot vol situat agent goal robot autom vol pp motor mobil robot navig intern journal vol pp build agent autonom behaviour system artifici rout artifici intellig build situat embodi agent lawrenc erlbaum gn overview method control confer control marin craft august overview robot simul implement underwat vehicl spain informat applic institut research iiia reinforc introduct mit machin learn coordin behavior eighth page morgan learn emerg task autonom mobil intern confer intellig robot system pp automat program robot reinforc learn artifici measur effect reinforc learn robot adapt neural reinforc learn behaviour synthesi robot autonom residu reinforc learn function approxim machin twelfth intern san qlearn continu state action space proc australian joint confer artifici continu valu behavior acquisit intern confer fusion integr intellig page distribut environ virtual real experi underwat robot intern confer robot autom icra hybrid control architectur low cost proc control applic marin guidanc control ocean vehicl john wilei
IR/472 5 authorit sourc hyperlink environ jon kleinberg abstract link structur hypermedia environ rich sourc inform content provid effect mean understand version principl studi hypertext research commun context predat journal citat analysi field bibliometr problem search hyperlink environ world wide clear preval techniqu inform inher link fulli exploit work develop method automat extract type inform hypermedia environ link report experi demonstr effect varieti search problem www central problem determin rel page environ issu central number basic hypertext search result search consist larg set relev select small subset page present user difficult formul definit author context test algorithm formul notion base method locat bipartit commun link structur formul interest interpret term eigenvector matric link motiv addit heurist cluster comput type similar hyperlink document preliminari version paper symposium discret ibm research report rj depart comput cornel ithaca ny work perform larg part leav ibm almaden research san jose ca author support alfr sloan research fellowship nsf faculti earli career develop award introduct link structur hypermedia environ rich sourc inform content provid effect mean understand version principl studi hypertext research commun context predat journal citat analysi field bibliometr problem search hyperlink environ world wide clear preval techniqu inform inher link fulli exploit work develop method automat extract type inform hypermedia environ link report experi demonstr effect varieti context www method appli fairli structur link present focu develop test algorithm search world wide web show interest connect algorithm spectral properti matric deriv link structur underli connect develop insight prove converg properti set www present defin process discov page relev queri qualiti search method necessarili requir human make concret load term previou sentenc begin observ improv qualiti search method www present rich interest problem wai orthogon concern algorithm effici storag current search engin typic index larg fraction www respond order util search tool time order provid result significantli greater typic hard search tool comput extra time lack object function concret defin correspond human notion qualiti work center issu improv qualiti search seek methodolog search larg hyperlink effici implement exist techniqu initi emphasi work algorithm type qualiti measur refer author document highli authorit document intuit repres broad user queri algorithm definit natur effici mean comput author analysi method term eigenvector turn motiv addit heurist difficult formul appeal spectral method feel interplai spectral analysi motiv heurist interest featur work queri authorit sourc view search begin queri unifi view notion type queri proper handl type requir set techniqu type queri ffl queri inform web ffl specif queri www consortium html ffl queri page concentr type queri present sort obstacl difficulti handl specif queri call scarciti page requir difficult determin ident page classic work inform retriev type problem easili expect find thousand relev page environ set page gener variant enter string search engin altavista sophist mean issu scarciti fundament difficulti li call abund number page return larg human user digest provid effect method autom search necessarili stronger version classic inform retriev notion method provid larg set relev small collect work origin issu abund problem discov authorit page larg hyperlink environ problem interest complex face dilemma order search authorit formul concret mean recogn concept highli subject human algorithm framework account bring notion link pictur claim environ www explicitli annot type human judgment order formul notion author creation link www repres concret indic type creator page includ link page measur confer author notion cloud fact link creat wide varieti author face vast size underli inform presenc individu link set authorit page relev initi crude approxim examin simplest implement presenc link indic simpli page measur variant work page relev subgraph www comput queri string million page www approach defin root set number defin top page index altavista search rank page subgraph induc sever problem approach subgraph typic larg fraction node isol root set reason omit page authorit queri rank highli altavista score function reason approach start root set grow larger base set consist page belong point page point page prevent size arbitrarili truncat page upper bound rank page subgraph induc base set attract extrem authorit page topic point page suffici broad gener relev page result list top page javasoft home page home page vacat network home page java program home page earth biggest bookstor list featur worth gener rank result queri pure featur list page view answer page relev origin queri page swiss internet consult home page amazon sixth page singl book java program page larg lack themat achiev goal provid page authorit relev approach tempt conclud preserv relev authorit page make text current search engin tricki issu page list string multipl time earlier natur find netscap home page queri microsoft home page queri electron frontier foundat home page queri page respect queri term work method circumv difficulti latent semant index rang cluster techniqu inform goal understand accomplish link find page simultan authorit relev strike result achiev make essenti text whatsoev approach proce essenti initi form base set defin set featur discuss make observ authorit page relev initi queri larg author common overlap set page point addit highli authorit expect find call hub page link multipl relev authorit page hub page author common throw unrel page larg hub author unrel page larg figur commun hub author hub author exhibit call mutual reinforc good hub page point good good author page point good hub identifi hub author base set method break circular section describ basic algorithm task method iter propag link web converg simultan steadi state type weight final output deriv equilibrium set pair set small set author small set desir small set page return user queri refer pair set commun hub mutual reinforc pictur pair side direct bipartit subgraph base set hub link author skelet depict figur pictur central claim authorit page identifi belong bipartit commun link graph algorithm section valuabl featur techniqu robust respect deal queri topic million relev arriv reliabl estim authorit page examin thousand page base set notion guid intuit find authorit page start small root set provid www suffici number relev page queri topic effect techniqu hamper rate growth indic produc reliabl result search topic greater number relev page discuss motiv return authorit page search hub page typic provid start point user gather authorit page queri topic context page collect link resourc topic interest creator distinct properti page observ number sourc write mere content web network foster simultan serendipit discoveri ubiquit hyperlink list favorit site individu home page appar feel compel assembl similar carefulli constitut turn web site corpor overview section describ basic method show exampl behavior find authorit page show iter algorithm analyz eigenvector comput pair matric deriv web prove converg queri base set multipl commun hub link versu commun commun page java smaller commun queri term multipl mean set queri term refer polar issu involv group link spectral interpret algorithm natur discov addit correspond coordin larg absolut eigenvector time refer discuss issu section heurist intuit approach analog spectral partit undirect graph import note simpli spectral partit web graph studi eigenvector symmetr matric deriv adjac matrix base structur find direct bipartit simpli partit node set section appli method problem page larg construct base set neighborhood determin good author result interest notion page defin link structur experi techniqu direct primarili understand natur qualiti output extent correspond human judgment difficulti assess result algorithm clear attempt defin domain evalu output requir judgment typic make benchmark directli present set adopt approach evalu output claim element feel result strike fairli obviou varieti reason hard produc standard search method www present number exampl section compar techniqu exist number searchabl hierarchi galaxi distribut www virtual librari hierarchi provid list authorit compil human standard search topic repres hub comparison autom method section compar result techniqu content ten topic yahoo directori interest evalu extent commun discov method robust ident extent root set produc similar commun hub author section discuss experi includ comparison root set produc issu queri number search comparison root set produc issu queri term number languag section problem determin queri topic order method produc reliabl set hub author recur queri defin topic princip commun hub author relev gener queri initi topic fairli clear algorithm design locat commun hub author base set regard initi favor topic larg vicin root set deriv queri refer process focu queri gener origin topic show section eigenvector effect produc relev result face phenomenon commun relev initi queri exist correspond eigenvector note outset primari interest studi qualiti search method cost algorithm effici method discuss ultim turn effici main comput step algorithm reduc singular decomposit matrix thousand task highli optim code approxim coordin larg absolut eigenvector find reliabl result obtain simpl iter algorithm small number iter method produc output small fragment www answer queri question effici paper www index local perform time requir simpli fetch html sourc hundr thousand construct base greater bottleneck issu larg separ comput requir algorithm preliminari experi local corpu million patent problem process document relat work link structur work connect area bibliometr studi written document citat structur relat work hypertext research commun work predominantli citat explicit hyperlink mean cluster enhanc relev judgment basic measur document similar emerg studi bibliometr bibliograph coupl document quantiti equal number document cite quantiti number document cite quantiti insid analysi method shaw combin textual part cluster algorithm document constitut node undirect graph edg weight measur edg delet order produc hierarch cluster discuss interest applic bibliometr measur cluster complet realm analyz relationship modul larg softwar system work bibliometr citat count assess scientif close relat issu classic work area garfield addit basic differ algorithm fundament differ method classic bibliometr work li explicit separ hub investig equilibrium exist discuss phenomenon make context hypermedia find categori classic bibliometr set scientif serv uniform role observ bibliometr studi review journal constitut except basic principl interest distinct hub author regard work hyperlink cluster search hypertext research commun schneiderman basic notion measur base identifi cluster graph hypertext environ weiss al defin similar measur page hypertext environ base link measur gener bibliograph coupl arbitrarili long chain refer larson perform analysi set page relev sampl queri gener cluster techniqu describ method applic relev page respect queri base relev descend tree rao combin link topolog textual similar group categor page www mihaila spertu framework construct www queri combin predic page develop method assign page subsequ user search highli rank rank page base algorithm correspond roughli simul short random walk direct link graph www kazman method visual rank result queri return www search engin method essenti enlarg set return page includ page join member link rank page enlarg set number page connect link notion augment search engin result basic step algorithm compon work differ significantli make crucial includ explicit distinct hub rank page obtain direct count neighbor link framework natur construct multipl commun rank page method give descript basic algorithm algorithm run arbitrari set hyperlink repres set direct graph natur consist page direct edg presenc link applic discuss typic subgraph induc base set associ author weight hub weight page maintain invari weight type normal squar sum view page larger author hub iter algorithm recal mutual reinforc relationship hub author natur express point page larg receiv larg point page larg receiv larg motiv definit oper denot page sum point page sum point figur basic oper weight fx fy oper updat oper updat basic mean hub author reinforc figur find desir valu appli oper altern fix point reach state version basic algorithm denot vector initi set appli oper appli oper normal sequenc pair produc converg limit theorem return author hub weight basic converg result difficult develop pair author weight vector denot result appli oper oper normal vector denot result time denot vector coordin equal addit notion symmetr matrix denot eigenvalu index order absolut denot eigenvector sake make technic assumpt matric deal assumpt refer princip eigenvector assumpt analysi affect substanti theorem sequenc converg limit proof write fp denot adjac matrix graph entri equal edg equal easili verifi oper written ax unit vector direct unit vector direct standard result linear algebra state symmetr vector orthogon princip eigenvector unit vector direct converg bound princip eigenvector entri orthogon sequenc fy converg limit show dictat assumpt orthogon sequenc fx converg limit proof theorem yield addit result theorem assumpt princip eigenvector princip eigenvector aa set set figur expand root set base set output process user point view pair set page largest page largest small constant repres algorithm estim strongest author hub theorem directli develop method comput effici iter stuck exposit reason underli motiv approach term reinforc oper run process iter oper comput weight fx fy start vector perform fix bound number oper small number iter good result interest note entri number page point entri aa number page point individu matrix entri correspond notion bibliograph coupl discuss comput hub author queri method find authorit page requir paramet experi assign default valu suppli queri string search engin return set refer root set enlarg root set base set recal introduct consist page belong point page point page restrict singl page bring page point point crucial number www page hundr small defin graph subgraph www induc set distinguish type www link link page domain page domain level url string page link creat simpli user navig infrastructur tend convei inform link author page point delet link graph edg result graph varieti sophist wai handl inform provid url remain interest run iter algorithm graph obtain set hub author basic result give sampl queri discuss introduct obtain author ncsa window mosaic home page netscap corpor home page microsoft internet explor list top author found algorithm line html titl note set author includ home page ncsa microsoft internet explor home page browser worth note page domain includ initi root set provid altavista queri obtain author syntax word initi page return search author javasoft home page java java book page faq author electron frontier foundat blue campaign onlin free speech center technolog voter telecommun watch american civil union author bill road ahead microsoft occur root set queri rank altavista natur view fact page occurr initi queri term topic suffici princip set author relev queri return issu section studi case princip commun close ti initi queri topic multipl commun basic search method find commun hub author base set number set interest find distinct commun set page relev queri topic graph varieti reason string mean drawn string term context multipl technic commun string refer highli polar involv group link eigenvector matric aa provid natur extract multipl commun hub author base set begin note simpl fact theorem aa multiset eigenvector chosen proof eigenvalu eigenvector suffic show av eigenvector aa eigenvalu observ pair eigenvector relat theorem appli oper parallel appli oper parallel pair weight mutual reinforc relationship seek pair appli multipli magnitud factor extent hub weight author weight reinforc eigenvector posit neg entri pair commun author consist page posit coordin consist page neg coordin commun intuit mean produc previou algorithm find base eigenvector intuit method iter oper modifi method ad step obtain addit note commun eigenvector larger absolut tend intuit subgraph link refer notion strength commun interest featur commun deriv eigenvector draw heurist intuit underli spectral graph partit expect pair commun eigenvector connect underli graph linkag mean context queri topic basic result give exampl type commun obtain queri mention interest phenomenon page larg coordin eigenvector tend essenti commun hub author gener strongest eigenvector similar larg eigenvector remain orthogon due differ coordin smaller absolut obtain fewer distinct commun expect set eigenvector notion reflect output select distinct commun eigenvector identif commun interest task make difficult challeng issu queri simpli search word plural strongest commun concern jaguar footbal team automobil princip eigenvector jaguar page posit end offici jaguar websit jaguar home page brett jaguar page jaguar posit end jaguar car global home page jaguar collect offici web site queri strongest commun queri consist themat relat page close relat topic includ home page theoret comput mathemat page wavelet st posit end michel dan homepag johan ronald rivest homepag author st neg end index guid mathemat softwar author neg end wavelet page wavelet sourc wavelet resourc wavelet mention commun posit neg end eigenvector link structur case mean separ strike queri natur question eigenvector produc distinct commun page issu complic exist hub page link extens page fact eigenvector produc clear posit end abort reproduct internet resourc plan abort clinic onlin home page nation abort feder neg end abort side web queri found page interest authorit page topic interest link structur environ discov exist page show minor modif framework develop type page similar base notion build page turn good author commun author commun exhibit type similar algorithm simpli defin root set page point initi page run algorithm section start root form enlarg base set find hub author set result compel begin home page honda motor york stock princip eigenvector honda ford motor compani north web site enjoi ride homepag site princip eigenvector american stock exchang smarter place york stock exchang home page futur option chicago exchang wall street journal interact edit nasdaq stock market home page reload option exchang stock busi market home page note difficulti inher compil list page consist text overlap presenc creator www page tend page order method initi page fairli larg strong author show top author commun show top result output valuabl type illustr home page acm special interest group algorithm comput page rank highli princip commun reveal summari strongest author sigact princip eigenvector societi industri appli mathemat center discret mathemat theoret comput scienc ieee comput societi home page ieee home page comput scienc bibliographi server electron colloquium comput complex cover page web virtual mathemat variant phenomenon frequent home page search engin comput compani strong vicin essenti page domin list author princip topic initi page case commun eigenvector find strong commun introduc page complet remain close relat initi page good notion versu discuss earlier clear illustr phenomenon provid queri start home page york time author princip commun princip eigenvector york time web usa todai cnn interact altavista main page excit microsoft white home page list mixtur type organ compani shown eigenvector separ superposit comput compani posit end organ neg end st posit end microsoft ibm corpor appl comput sun microsystem intel world corpor home page depart mit lab comput scienc web page st neg end york time web usa todai cnn interact mercuri center chicago ey net cb electron telegraph searchabl hierarchi experi applic basic framework discov authorit page queri find multipl commun themat relat find page similar initi queri page easier verifi effect algorithm task page list automobil commun list queri repres side issu notion remain attempt evalu page return find concret evalu claim searchabl hierarchi www provid approach achiev topic section mention exampl searchabl hierarchi introduct galaxi www virtual librari list authorit compil varieti broad search topic hierarchi provid extern gener list queri list authorit page topic compar result section show respect method produc root set queri topic lead similar commun hub author searchabl hierarchi test algorithm topic yahoo directori portion illustr comparison make output method content www searchabl ten topic drawn yahoo sake top hub author princip commun figur queri drawn explicitli page searchabl hierarchi hub page topic includ hierarchi attempt repres special medic hierarchi page rang medic kei word categori site mention categori site index index tabl figur top hub top author princip commun queri list set page referenc referenc page label prefix dash hierarchi page topic make observ experi ffl relev page yahoo top hub page relev page top hub page relev galaxi page top hub page queri yahoo galaxi anatomi audiolog cardiolog figur referenc searchabl topic ffl ident top hub page summar www virtual librari hierarchi page topic emerg top hub page top hub page relev page hierarchi remain top hub page pointer page relev belong larger searchabl hierarchi top hub page relev initi queri ten topic attribut measur quantiti assembl hub page topic ffl hierarchi score highli medic consist referenc author top www virtual gener score extrem altern root set method produc result start small sampl relev page initi root set impli commun hub author produc exhibit type give addit indic commun result search method insensit choic page initi root set multipl search engin straightforward produc root set queri string issu queri search altavista infoseek excit issu queri search engin effect produc root set intersect run number test found main commun tend similar structur vari root eigenvector chang hub author princip eigenvector root set eigenvector root set queri section show author princip commun root set provid show start infoseek excit produc similar commun case princip commun find commun browser manufactur princip eigenvector ncsa window mosaic home page home page microsoft netscap ncsa neg end netscap microsoft ncsa window mosaic home page microsoft internet explor mosaic macintosh queri method obtain multipl root set queri topic issu queri search engin languag experi interest advantag natur make text discov good hub author multipl group common commun provid link observ phenomenon varieti method find relev hub author written languag queri issu english issu number topic yahoo list german found princip commun english version similar form commun french german version princip eigenvector internet astronom american astronom societi home page home page nasa data system home page neg end nasa data system home page astronom internet european southern observatori homepag astronomi space scienc neg end nasa data system home page astronom astronom pictur anim internet lexic score turn discuss typic wai algorithm extens method make robust common difficulti experi section root set gener search set grown hub author determin set basic phenomenon investig call algorithm converg set hub author origin topic larg fraction case occur share basic queri topic queri topic greater www princip commun hub author relev gener initi topic basic exampl simpl exampl make notion concret queri yahoo list altavista index roughli page algorithm essenti converg authorit page topic princip eigenvector center control prevent home page page medic confer typic link larg number gener medic acquir lot author similar phenomenon occur ten medic topic consid section issu observ ten earlier topic current altavista index roughli page correspondingli resourc page author weight specif page prevent gener strictli analog phenomenon occur queri altavista index roughli page special largest www topic web princip eigenvector archiv web summari web virtual librari exampl demonstr common form author princip eigenvector correspond gener initi queri topic reiter basic reason phenomenon slightli set page queri string primari hub author produc simpli consist topic set page lexic score function rang techniqu implement prevent strongli posit featur algorithm stand tempt weight page lexic score deriv queri incorpor weight iter algorithm comput hub author undoubtedli underli topic strongli respect hurt algorithm abil perform basic task locat authorit sourc discuss note authorit page find queri string set page string link desir altern commun develop queri term construct advantag point brought produc multipl commun hub distinguish set commun set run basic algorithm base set produc number commun note earlier small number commun eigenvalu restrict appli lexic score function commun rank commun function attempt lexic score function suffer greater lesser problem discuss author explicitli initi queri term comput singl total score page partial offset provid number page relev commun term suffici hope score larg option score function report set experi perform extrem simpl commun top hub top author form set rc repres page page queri string ff denot number time string occur page score commun ff ff worth comment basic variat arbitrarili repres set commun weight defin comput cumul weight ff jx jy aesthet favor method main reason score comput maintain knowledg weight commun commun repres user small repres score commun improv order argument comput score base user defin function ff simpli count number occurr term undoubtedli crude defin fi string score commun ran experi section fi place ff achiev qualit similar result context score function base pure score function deriv techniqu latent semant index test crude score prove surprisingli effect test cluster perform algorithm provid reason pure effect set discuss commun tend exhibit strong uniform form basi link densiti term frequenc set relat reliabl notion term frequenc singl page properti hub observ hub page topic tend rich individu term topic function ff rank commun eigenvector queri discuss begin section commun top hub produc medic confer page searchabl hierarchi commun top neg end intern web confer confer intern www confer fourth intern world wide web confer paper term mixtur queri method produc lexic score term term result score vector face problem set vector natur total order discuss natur approach rank commun situat discuss candid total worth mention natur partial write coordin equal coordin set score vector vector maxim arrang thing commun maxim set maxim commun prove smaller full set commun order make notion yahoo queri fashion similar previou primari commun gener topic princip eigenvector home page onlin paramount pictur onlin fact turn commun eigenvector highli relev perform test set commun eigenvector commun score method produc vector coordin figur provid result point plane point maxim interest posit hull point set point figur term occurr lie line neg slope separ point set point lie posit hull maxim point label figur turn arguabl relev commun interest note opposit end heurist intuit spectral graph discuss section commun label top hub page includ yahoo page top author neg end academi motion pictur art scienc index dian ying envelop interact guid academi award oscar predict oscar annual academi commun label top hub page includ yahoo page top author posit end golden award foundat return issu order commun score cover basic discuss recal commun score ac ff sm natur method sum coordin valu ac robust reason term exhibit greater varianc number time occur term great influenc score function plot figur point rank highest measur basi simpl feel born intuit vector defin minimum coordin rank commun valu explicitli find commun queri term occur commun label figur show result rank base subset topic yahoo list commun eigenvector column number maxim column number ly posit hull lexic score approach discov relev commun weaker eigenvector case queri maxima po hull commun includ excit award festiv page silent classic movi author gener movi resourc includ yahoo documentari page specif rest gener movi page includ western page figur optim commun function feel problem score rank commun produc base associ queri present number interest issu work point discuss basic issu work interest direct futur work final summar substanti direct observ outset descript method make clear approach describ restrict hypermedia basic investig applic structur collect scientif paper begun experi method larg corpu patent number natur direct graph structur find clear interpret notion commun implicit analog drawn relationship modul larg softwar system basic measur bibliometr method graph defin commun electron larg set individu organ experi section basic techniqu construct natur sophist method defin neighborhood root set provid search engin notion adapt updat set algorithm proce run multipl success phase algorithm end attempt identifi good set node root set phase notion good set complex judgment involv hub author maintain relev initi queri textual content page bring point strike featur version algorithm frequenc remain initi queri topic suffici analyt order understand boundari set queri algorithm remain set queri pure algorithm remain obtain set gener initi interest determin method search level specif result commun make textual content document make commun experi section basic approach rang techniqu investig acknowledg prabhakar raghavan invalu discuss extens robert kleinberg gener insight rob barrett suggest method ibm research intranet provid initi soumen david alan christo sridhar eli valuabl comment suggest refer ao ga web queri proc intern world wide web ae jc gw intellectu structur scientif subfield author american soc info pp analysi identifi hierarchi acm tran inf pp search visual web proc intern world wide web raghavan search autom submit public digit equip altavista search aj partit graph comput logic base eigenvector connect ibm technic disclosur pp reason world wide web big multimedia august latent semant american soc info pp excit excit navig connect czech math pp inform hypertext medic commun pp analysi tool journal pp impact current june cf van matrix john hopkin infoseek infoseek search intern busi ibm patent mm coupl scientif american pp tr cluster macro retriev american soc info pp world wide exploratori analysi intellectu structur ann meet american soc info bring order stanford digit librari work paper sow extract usabl structur acm sigchi confer human factor cj van inform design commun pp van product journal impact american soc info pp salton automat text process rw ma refer machin theori sj rl wm citat index part cluster structur composit document american soc info pp wm citat index part retriev perform composit american soc info pp scientif measur relationship american soc info pp mine structur inform proc intern world wide web partit planar graph ieee symposium foundat comput world wide web world wide web virtual dk hierarch network search engin exploit hypertext seventh acm confer hd kw ann rev info sci pp
ML/473 6 hybrid neural system stefan wermter ron sun york januari prefac aim book present broad spectrum current research hybrid neural advanc state art neural network arti cial intellig hybrid neural system comput system base arti cial neural network symbol interpret interact symbol compon book issu relat di erent type neural contribut success hybrid symbol supplement neural type util interact develop neural hybrid system strength weak hybrid neural current principl methodolog hybrid neural system impact hybrid neural techniqu order bring di erent organ intern workshop workshop hybrid neural organ stefan wermter ron held decemb denver paper present workshop cover essenti aspect strand hybrid neural system successfulli address import issu hybrid neural system research paper contribut select book present cover research area collect select contribut repres snapshot state art current approach hybrid neural system extrem activ area research grow interest popular hope collect stimul interest area hybrid neural system mark steve christo hybrid intellig system group import assist prepar book alfr hofmann springer cooper contributor book januari stefan wermter ron sun tabl content overview hybrid neural system wermter sun structur rule layer hybrid connectionist model cognit scienc jerom feldman david bailei type quanti er connectionist model rapid reason relat process neural network exiv reason en modular neural architectur reason christoph address issu connectionist symbol rule encod gener infer nam park hybrid model theori nement nelson distribut neural architectur languag process dynam recurr network sequenti data process stefan kremer john fuzzi knowledg recurr neural dynam system perspect christian lee gile combin map distribut marshal miikkulainen hybrid neural learn internet agent stefan christo connectionist simul empir acquisit grammat relat william cottrel je rei elman larg pattern make great learn context step grand uni ed stephen gallant integr graphic rule adapt learn structur inform paolo marco gori alessandro transform explan lesson current issu futur research direct extract knowledg arti cial neural network alan freder guido robert andrew joachim symbol rule extract neural network guido bologna understand state space organ recurr neural network iter function system dynam peter georg ner christian direct explan knowledg extract perceptron network perform low back pain classi cation marilyn steven stewart michael foi anthoni jb high order symbol rule competit learn holist symbol process sequenti evalu jame barri kalman vision cognit approach mind embodi cognit sharkei tom supplement neural reinforc learn symbol method ron sun map symbol process timo honkela evolut bridg connectionist symbol system reilli cellular neural associ arrai symbol vision christo jame austin applic integr environ model mobil robot gerhard stefan stefan palm overview hybrid neural system stefan wermter ron sun centr st peter uk cec depart usa abstract chapter introduct eld hybrid neural system hybrid neural system comput system base arti cial neural network symbol interact symbol compon describ recent result hybrid neural system give overview main method outlin work present provid addit refer highlight import gener issu trend introduct recent research area hybrid neural process remark activ develop enorm success hybrid intellig system area languag medic fault diagnosi industri equip nancial applic research motiv examin hybrid neural model base di erent viewpoint point view cognit scienc pure neural attract symbol interpret neural architectur brain neuron structur capabl perform symbol reason lead question di erent process mechan bridg larg gap acoust visual input signal symbol reason brain special di erent structur lot function brain architectur highli special organ level cortex area respect connect di erent cognit process homogen expect base di erent evid cognit scienc neurosci multipl architectur involv human process point view hybrid symbol di mutual complementari properti combin symbol advantag easi explicit fast initi dynam variabl bind knowledg abstract neural show advantag gradual analog robust gener advantag mutual hybrid symbol neural architectur di erent process strategi support neurosci cognit scienc point view desir explor neural network knowledg engin complex hybrid system form hybrid neural architectur classi cation scheme hybrid system architectur cover speci neural instanc recurr network cover expert system continuum hybrid neural architectur emerg neural symbol knowledg rst introduct present ed taxonomi uni ed neural transform hybrid modular architectur uni ed neural architectur uni ed neural architectur type hybrid neural system refer uni ed hybrid system reli sole connectionist symbol interpret node link speci knowledg task built uni ed neural architectur earli research uni ed neural architectur trace back work feldman provid gener framework structur framework extend di erent direct explan logic reason recent work line neural theori attempt bridg larg gap neuron cognit behavior question natur neural model symbol symbol reason neural model apt framework captur varieti cognit argu inher process characterist neural make suitabl task cognit model learn process easili develop neural gradient descent induct logic program method type connectionist architectur distinct node repres concept distribut neural architectur set overlap node repres concept work research feldman sun smolenski demonstr connectionist network suitabl implement symbol process higher cognit function distribut neural approach model intellig easier incorpor prior knowledg model structur made directli correspond symbol knowledg neural learn lead distribut work integr distribut transform architectur hybrid transform architectur transform symbol neural vice versa main process perform neural automat procedur transfer neural symbol vice versa transform architectur insert extract symbol knowledg neural architectur hybrid transform architectur di er uni ed neural architectur automat transfer unit uni ed neural architectur interpret symbol hybrid transform architectur knowledg transfer symbol symbol exampl transform architectur includ work automata extract recurr network transform symbol rule feedforward network extens examin arti cial neural network common transform architectur rule extract architectur symbol rule extract neural network architectur receiv lot attent rule extract discov hyperplan posit unit neural network transform rule rule extract perform perceptron network kohonen radial basi function recurr network extract symbol knowledg neural network plai import aspect current insert symbol knowledg gradual practic hybrid modular architectur hybrid modular architectur symbol neural modul task symbol initi nal transform architectur combin integr neural di erent wai exampl screen robot navig sensor neural process fuse symbol expect varieti distinct made neural symbol modul hybrid modular architectur tightli coupl complet integr coupl architectur coupl hybrid architectur separ symbol neural modul control ow sequenti process nish modul modul begin modul activ commun modul unidirect coupl hybrid modular architectur semant analysi queri dialog process simul navig coupl architectur model structur combin chart parser feedforward network exampl call passiv includ coupl enabl form cooper modul form coupl term main modul care transform input data rectifi output main modul main part process task process neural main task accomplish symbol method form cooper modul maintain control task signal modul handl speci aspect task form cooper equal partnership multipl modul tightli coupl architectur tightli coupl hybrid architectur separ symbol neural modul control commun common share intern data structur modul main differ tightli coupl hybrid architectur common data structur bidirect exchang knowledg modul make commun faster activ dicult control tightli coupl hybrid architectur refer activ coupl hybrid architectur exampl tightli coupl system neural determinist inferenc built control symbol marker pass neural similar determin hybrid system develop consist rule fact base neural network train radial basi function network tightli coupl hybrid architectur multipl exchang knowledg modul result neural modul direct uenc symbol modul vice versa nish global process system determinist scan tightli coupl compon structur process semant classi cation neural network action symbol modul carri action process control switch back modul tightli coupl hybrid architectur structur process detail system coupl symbol neural explor synergi fulli integr architectur fulli integr hybrid architectur discern extern di erenc symbol neural modul interfac architectur control ow parallel commun bidirect commun channel integr hybrid architectur develop explor integr hybrid process spontan languag analysi fulli integr interleav constitu modul interact multipl channel function connect node modul connect node modul hybrid system design lee al interleav reason modul neural network modul direct hybrid neural system feldman bailei distinct level cognit linguist comput structur connectionist comput biologi level biolog level condit vertic hybrid bridg di erent higher level reduc ground lower level research methodolog advoc examin concept neural theori languag approach research gener accept idea multipl level neural cognit model model construct neural symbol subsymbol process implement neural network horizont argu bene level make progress understand cognit view base realist assess state art neural model focu essenti issu synergi symbol subsymbol process detail implement horizont approach successfulli hybrid instanc analysi pure neural system vertic hybrid attract neurosci hybrid system horizont hybrid tractabl build hybrid neural system learn interact repres major issu develop symbol process neural network neural network design symbol process involv complex intern structur consist multipl compon di erent learn made dicult address problem type structur system built learn process involv ect acquir constraint facilit hamper learn term learn hybrid neural learn content xed learn architectur learn content architectur time hybrid neural learn system fall rst hybrid model belong current work parallel neural symbol includ separ algorithm appli simultan separ algorithm appli integr learn pure neural learn symbol issu import make progress theori applic hybrid system theori preliminari earli work theoret framework date lack theoret framework abstract detail task domain step direct research relationship automata theori neural process natur languag continu import test area explor hybrid neural architectur argu featur human learn architectur human research neural network argu import develop environ languag learn argu syntax innat process abstract learn dynam learn natur languag import design parser techniqu present context avoid problem lose constitu argu systemat neural network substrat base principl evolut research improv www neural network search engin emploi fairli tradit search machin learn neural network improv process heterogen unstructur multimedia data import research area knowledg extract neural network order support text mine inform retriev induct learn techniqu neural network symbol machin learn algorithm combin analyz underli rule data crucial task appli neural appli learn distribut design vector scale task larg context vector essenti learn document retriev due size linear comput inform retriev vector restrict logic complex form analyz fractal approach hard applic import system built foreign exchang rate predict som reduct gener symbol input recurr network produc rule approach symbol process classifi usenet text present classi cation hierarch map relat neural classi cation work text rout neural network import part vision associ progress neurosci comput neurosci infanc relev progress hybrid symbol neural system relat complex high order neuron possibl build power function focu global brain instanc build biolog inspir robot root cognit argu year comput power sucient match human principl mean deep understand lack import issu situat assess action perceptu pattern recognit primit state rich percept requir link rich set action argu languag human intellig involv intellig cognit process conclud remark work theori fundament principl hybrid neural system work relat automata theori neural logic network issu focu order tackl larger real world task neural instanc inform learn internet classi research underli vector neural network import vertic form neural hybrid model wide cognit logic languag process horizont form hybrid exist larger knowledg intellig agent condit monitor interest futur extent comput neurosci er idea constraint build sophist form neural system refer survei critiqu techniqu extract rule train arti cial network technic queensland andrew rule local function network rule extract train arti cial neural network arti cial intellig simul brighton barnden complex sun architectur incorpor neural symbol process barnden editor advanc connectionist neural comput volum ablex publish arti cial neural network black ieee transact neural modular neural architectur reason hybrid neural system bologna symbol rule extract form neural network hybrid neural system bologna accur decomposit standard mlp classi cation symbol rule intern work confer arti cial natur neural page system integr connectionist symbol approach spoken languag understand intern confer spoken languag page sejnowski comput brain mit principl framework techniqu rule extract perceptron intern confer arti cial neural page juli long ecient question answer hybrid system intern joint confer neural ner neural network ai chapman learn structur connectionist network technic report feldman bailei layer hybrid connectionist model cognit scienc hybrid neural system feldman ballard connectionist model properti cognit stolck rst ve year autom languag acquisit project ai integr graphic rule adapt learn structur inform hybrid neural system lm fu rule learn search adapt net nation confer arti cial page lm fu neural network comput intellig gallant neural network learn expert system mit gallant context step grand uni ed hybrid neural system lane integr system neural network robot skill intern joint confer arti cial page san gile insert nement symbol rule dynam driven recurr neural network connect intellig hybrid system hybrid model theori nement hybrid neural system kalman holist symbol comput sequenti evalu hybrid neural system hendler develop hybrid model barnden advanc connectionist neural comput high level connectionist page ablex publish overview strategi integr workshop uni ed hybrid page structur connectionist uni cation algorithm nation confer american associ arti cial intellig page neural network exiv reason hybrid neural system honkela map symbol process hybrid neural system jang sun function radial basi function network fuzzi infer system ieee transact neural morgan berkelei restaur project intern confer speech languag page larg pattern make great learn hybrid neural system harri develop hybrid neural system machin health monitor intern congress condit monitor engin page gk palm applic integr environ model mobil robot hybrid neural system kremer theori grammat induct connectionist paradigm technic report phd dept comput sc kremer dynam recurr network sequenti data process hybrid neural system uni cation connectionist simul arti cial neural page determin syntact parser connectionist natur languag page lawrenc lang dyer inferenc connectionist network connect pedreschi hybrid neural network approach scienti engin data analysi eighteenth annual intern confer british comput societi specialist group expert page ht high order symbol rule competit learn hybrid neural system macintyr smith applic hybrid system power industri intellig hybrid page kluwer academ mr miikkulainen combin map distribut hybrid neural system macintyr hybrid neural simpl coupl fulli integr neural network neural comput hybrid neural network expert system kluwer academ hybrid intellig system kluwer academ miikkulainen subsymbol natur languag process mit elman connectionist simul empir acquisit grammat relat hybrid neural system mozer neural net architectur tempor sequenc process weigend time seri forecast futur understand page redwood gile extract insert symbol inform recurr neural network honavar arti cial intellig neural principl page academ san gile extract rule recurr neural network neural cw fuzzi knowledg recurr neural dynam system perspect hybrid neural system austin cellular neural associ arrai symbol vision hybrid neural system park approxim radial basi function network neural park address knowledg issu connectionist symbol rule encod gener infer hybrid neural system peterson sun rbf network altern hybrid architectur intern joint confer neural pollack distribut arti cial reilli evolut bridg connectionist symbol system hybrid neural system reilli sharkei connectionist approach natur languag process lawrenc erlbaum william learn intern error propag rumelhart parallel distribut volum page mit sharkei mind embodi cognit hybrid neural system model rapid memori format system meet cognit scienc page type quanti er connectionist model rapid reason relat process hybrid neural system simpl associ systemat connectionist variabl dynam bind behavior brain shavlik framework combin symbol neural learn honavar arti cial intellig neural step principl page academ san smolenski proper treatment behavior brain march learn distribut classi cation term intern joint confer arti cial page sun variabl bind connectionist network connect sun integr rule robust reason sun hybrid report workshop integr arti cial intellig sun supplement neural reinforc learn symbol method hybrid neural system sun workshop uni ed hybrid approach sun connectionist symbol integr lawrenc erlbaum sun la comput architectur integr neural symbol process kluwer academ sun peterson autonom learn sequenti experi ieee transact neural thrun extract rule arti cial neural network distribut advanc neural inform process system mit san thrun neural network learn lesson current issu futur research direct extract knowledg arti cial neural network hybrid neural system understand state space organ recurr neural network iter function system dynam hybrid neural system replac pattern matcher expert system neural network intellig hybrid page john wilei ml sj sj ma ajb direct knowledg extract interpret perceptron network perform low back pain classi cation hybrid neural system waltz import import present workshop hybrid neural symbol waltz feldman connectionist model implic wermter hybrid connectionist natur languag process chapman thomson wermter prefer moor machin neural fuzzi integr intern joint confer arti cial page wermter hybrid approach arti cial neural languag process handbook natur languag process marcel wermter knowledg extract transduc neural network journal appli hybrid neural learn internet agent hybrid neural system wermter build lexic dynam arti cial neural network intern confer cognit scienc page hybrid neural plausibl network agent nation confer arti cial page scheler statist symbol approach learn natur languag process wermter weber learn syntact semant spoken languag analysi arti cial neural network journal arti cial intellig
Agents/474 1 present workshop juli design issu agent system thoma scott deloach depart electr comput engin air forc institut technolog street ohio abstract paper address effect system multiag system design system human interact directli softwar agent collabor approach problem solv main level multiag system domain level individu agent level domain uniqu challeng mixedin system design individu agent agent design interact human agent integr singl system introduct current research relat intellig agent capabl structur individu agent order solv complex agent work cooper agent heterogen environ domain multiag system multiag interest coordin behavior system individu agent provid behavior uniqu type multiag system human interact softwar agent collabor approach problem solv goal paper describ fundament question design mixedin system start fundament level design place domain level individu agent level multiag system engin research multiag system engin attempt determin engin practic multiag system abstract provid multiag system develop distribut softwar system mase methodolog specif design formal agent system synthesi describ multiag system agent formal languag transform formal specif code view mase abstract paradigm agent higher level abstract typic object simpl method invok agent coordin action accomplish individu commun goal viewpoint issu agent view agent conveni possess intellig handl intellig system compon equal framework mase methodolog similar tradit softwar engin methodolog special distribut agent paradigm methodolog basic step shown figur methodolog design gener compon system defin system figur mase methodolog domain level design step mase domain level captur basic type interact agent system analyz complet bigger view system context context includ human interact system system impact oper system develop agent intellig agent defin import concern definit type extern interfac domain design problem domain level design agent level design compon design system design model collabor system collect heterogen agent commun problem partit agent perform task contribut solv larger problem identifi type identifi interact occur type agent interact agent specif type commun occur agent system defin coordin describ sequenc messag pass agent achiev coordin commun critic secur multiag system defin gener system commun secur protocol agent level design step mase agent level design level defin agent architectur individu agent type agent architectur defin compon agent interact formal specif intern compon agent work defin agent architectur specif compon defin compon specif agent architectur compon defin behavior individu agent integr agent multiag agent particip specif set complet agent ti specif inform store produc agent inform requir specif ti inform agent specif complet issu found case agent act interfac specif resourc softwar tool formal specif agent frequent model interfac agent exist softwar tool compon design compon design level obviou level mase methodolog agent architectur compon design compon design scratch defin formal specif compon exist goal defin agent advantag exist compon enabl compon obviou agent compon includ infer search learn algorithm system design system design place design compon complet defin domain system design pick number type agent defin paramet agent definit technic part system system defin verifi properti interest safeti live gener multiag system system complet highlevel system issu agent compon actual system gener formal gener multiag formal tool system formal specif enabl exist analyz properti system result system tailor specif agent system jafma agent gener java specif low level commun structur carri agent formal agent softwar synthesi base formal specif continu research area current synthesi tool support agent system base specif defin hierarch system includ structur behavior aspect simpl specif inventori agent number seq char seq char price stock inventori stock reorder inventori stock inventori figur structur specif formal model synthesi tool reason softwar verifi consist correct properti specif transform formal design model objectori sourc code gener formal approach benefit abstract mathemat behavior agent system mechan autom verif system properti autom code gener seq char seq char char inventori price figur function specif state receiv state action send idl search acknowledg search idl figur state transit tabl schema figur formal specif object class repres singl stock attribut repres stock item quantiti hand similarli schema aggreg inventori system set stock item set discontinu item total function map stock item reorder level lower part schema repres invari case item includ inventori reorder point item agent perform figur find set stock item price limit output task set item number price pair dynam behavior state transit tabl agent wait idl state receiv request inventori inform send acknowledg enter search state invok task send result resum idl state issu agent system agent pure frequent interfac softwar tool agent effect human expert defin softwar agent interfac human local repres impli team consist human interfac human interfac rest system model interact multiag system human client model human basic input queri interfac coordin agent system back human process simpl session involv human clarif addit inform variat role human input task agent human simpli acknowledg accomplish result inform similar queri human addit suggest fail task human server onlin human receiv queri inform agent act behalf agent human agent suddenli pop inquir avail time block meet case human provid return origin human receiv formal feedback result answer provid human queri sender inform clarif justif origin request model spirit true collabor approach model group softwar agent cooper solv problem human particip client server role time session method interact encompass concentr remaind paper issu interest uniqu mixedin concept context level system primari issu system individu agent level multiag domain uniqu challeng interfac agent part encapsul human ident softwar agent rest system potenti differ domain level term time softwar agent typic process messag fairli human part significantli slower respond human respond total time typic minut depend length averag break individu agent level primari factor affect design compar softwar agent factor concern uniqu data structur behavior softwar affect specif design issu deal special case interfac resourc build exist research agent learn user prefer tailor interfac specif user direct concern involv defin form interfac tabl base match formal descript problem formal specif form issu domain address rest paper issu relat individu design issu involv model underli architectur behavior special agent architectur support client server role respond ad hoc input human asynchron input softwar agent handl human queri send queri behalf human individu tailor problem solv individu human interfac common part captur reusabl architectur set architectur agent design build agent issu involv interfac commun human agent collabor commun text frame data exchang readili fulli autom agent interfac human support formal data includ binari graph graphic model model basic concurr state state model repres concurr process multipl simultan receiv multipl overlap time multipl open task human work time order process singl human send request inform system pend request inform time model type singl queri present human human agent process possibl send request wait finish task human respond origin queri final provid inform invok form send back singl messag type model model includ share data increment updat displai share inform dynam updat agent submit increment similar tradit blackboard agent effect write inform common displai human monitor time depart collabor schedul displai current parti independ add schedul variant model agent regist inform interest inform continu previou agent concern schedul classroom result schedul access agent determin enrol agent concern room inform enrol simpli regist inform design issu design issu relat model section model intend repres differ agent depend primarili type problem support provid human prefer human defin queri basic defin agent interfac rest system queri depend type problem agent design handl input inform suppli base answer question defin inform support queri syntax queri base question ultim defin syntax agent agent inform answer defin inform make requir answer syntax base question defin syntax agent agent form inform exchang defin form present queri inform form human provid inform increment base inform syntax updat basic question context approach interest answer question relat directli design human interfac system interfac question applic softwar agent hypothesi design support formal base design tool aid softwar engin specif project result agent code automat gener refer multiag system engin methodolog languag design agent system workshop note agent orient inform system seattl agent framework multiag system develop cincinnati teach formal extens analysi sei san jan introduct formal specif prentic
DB/475 3 symbol time granular bettini roberto de milan itali abstract recent literatur time effort made notion time granular relationship order common framework system adopt time granular paper consid mathemat finit period time identifi symbol formal captur class granular achiev formal analysi express symbol formal introduct wide agreement ai commun requir system support standard time granular exampl standard time granular user defin granular includ granular definit applic context work repres effort formal notion time granular relationship order common framework specif system adopt time granular formal essenti mathemat suitabl present manipul common user goal paper identifi intuit formal captur class granular formal framework close class respect oper class intuit finit period invent symbol formal work exist analyz express respect goal symbol base collect tempor repres tempor express occur natur languag applic domain appoint schedul time manag formal adopt extens research ai area deduct influenti slice formal introduc formal extens express power includ featur framework power formal repres calendar time includ existenti support featur consid framework calendar express specif defin overlap granul time formal repres recur event form repres call gap occur granul granul time granul defin union month relev work interv repetit includ emphasi work reason qualit relat calendar express tion research cite work time granular includ contribut paper side give result express formal identifi basic approach symbol extens formal captur class finit infinit period granular defin section introduc formal notion time granular section briefli describ collect slice symbol evalu express formal properti section extens collect formal captur conclud paper section appendix summar syntax symbol appendix proof result paper time granular section introduc mathemat time granular refin summar granular defin respect underli time formal simpli set element order relationship integ natur number ration real number choic time domain definit granular map integ index subset time domain element element condit state granul granular overlap index order time domain order condit state subset index set map subset time domain contigu time domain granular defin countabl set identifi integ index set provid granular comput definit cover standard granular week bound granular granular granul granular interv granul defin map map subset time domain year year independ integ term input output gener string descript granul index relationship time granular defin essenti concept paper definit granular period respect granular exist subset integ exist number granul condit state granul union granul assum union granul period properti ensur granul union result period composit granul term granul pattern repeat time domain granul granul call condit enforc granul period repetit granul granular period respect set index describ granul index granul infinit set index describ descript arbitrari granul mod common granular kind year period respect dai month period respect turn period respect dai practic problem requir granular system set time granular period respect basic granular microsecond depend accuraci requir applic context assum fix basic granular cover time domain definit granular period period respect basic granular figur repres set definit partit main granul contigu valu admit granul valu circl identifi finit period finit granular divid finit irregular finit period infinit period granular divid granul granul granul granul infinit side classif express power symbol formal approach symbol section remind syntax semant collect slice analyz express respect class period granular collect slice tempor interv collect formal collect structur set interv order collect measur structur order collect formula correct provid granul easili adapt case finit index granul formal finit granular treat uniformli result gap infinit finit figur classif time granular order list order collect order list collect order interv denot set contigu moment time collect month repres collect dai collect order order provid author introduc class oper collect notion primit collect calendar defin order collect form infinit number meet interv start specif class oper call dice slice dice oper divid interv collect collect divid interv interv week fulli month dice oper adopt subset allen interv relat slice oper provid mean select interv collect select week identifi dice oper slice list keyword identifi singl interv collect keyword nondeterminist interv collect express arbitrarili class oper start explicitli period set group interv defin interv meet interv start finish calendar slice formal introduc altern collect formal order underli evalu procedur symbol express base notion calendar slice similarli collect calendar period infinit set consecut interv interv calendar index consecut integ basic calendar term time calendar defin dynam exist construct gener calendar interv obtain group granul calendar start group success treat circular list calendar interv cover finit number interv month calendar slice symbol express built calendar denot set necessarili consecut interv form sum identifi start point interv durat symbol denot calendar set natur number keyword sum simpli denot start point interv index belong start point interv sum denot start point interv cn point sum denot set point begin dai februari april year durat form symbol denot calendar cn number success interv durat slice denot set interv dai februari april year express relationship collect slice essenti period set similarli formal notion basic defin finest time unit domain loss paper assum basic calendar basic granular mention section term slice express collect express period number instant pattern interv denot express interv period obtain constant shift interv period cn calendar period common multipl defin list denot durat interv term return element return number element list express slice express respect formal notion granular introduc section interv denot slice call disjoint slice granular slice granul form union set granul basic granular set repres interv denot interv describ set theorem disjoint slice exist finit infinit period granular infinit slice algorithm deriv interv length term basic calendar granul start interv denot slice period period granular defin slice period term shown algorithm easili adapt deriv interv denot granular simpli defin explicitli map granul interv disjoint ensur result map granular ignor except leap year infinit slice hour basic calendar slice hour number hour period slice denot set interv period granular defin number interv show slice granular slice express denot interv span tuesdai thursdai interv wednesdai fridai definit pair granul granular overlap granular found understand express slice formal respect check granular identifi class disjoint slice theorem finit granular infinit period exist slice theorem state finit granular repres hold period granular unbound side granular repres denot infinit set interv slice slice formal minimum maximum set result conclud disjoint slice repres set granular identifi figur repres granular enforc disjoint simpl syntax restrict collect formal proposit collect result applic dice slice oper note addit refer interv easi extens captur period granular gap infinit disjoint slice express finit figur subset granular captur slice formal interv equal disjoint proposit semant fact calendar disjoint interv similarli granular collect granul form union granul repres interv interv collect describ composit granul theorem collect exist period finit period granular similarli theorem develop algorithm deriv interv denot period bound present interv data defin granular interv period defin bound start granul collect express identifi order interv structur collect order higher irrelev respect time granul express denot collect mondai year start januari assum dai basic calendar jan comput express period mondai defin period dai week equal period comput mondai period year respect basic calendar year express period comput year defin period number granul obtain interv algorithm restrict year repres mondai end extract interv mondai counterpart theorem theorem period finit exist collect express gap infinit collect express finit figur subset granular captur collect formal note granular side circl figur captur conclud slice collect incompar slice repres set overlap collect repres period granular translat formal express denot finit infinit difficult gener rule translat symbol preserv intuit express oper slice intuit interpret semant collect formal extend addit oper control statement introduc facilit set fourth saturdai april previou syntax user defin collect overlap interv impli collect express extend formal exist granular extens collect slice formal extens repres gap granular requir interv granul form instant repres granul defin set perceiv unit extens collect formal order captur set period granular introduc notion primit includ calendar defin collect formal order collect interv repres granul primit collect pc pc sp synchron point respect exist calendar period express term set interv identifi posit granul pc period synchron point sp start instant express repres semest dai week dai semest start week start properli interv repres granul compani weekli work shift period shift treat singl time granul week thursdai synchron point granul start mondai januari dai period dai identifi singl granul form sixth start repeat dai denot fourth start repeat dai user collect express arbitrarili appli dice slice oper start primit collect oper appli definit convex dm fx fy dm set valu repres dice oper base binari relat iff intersect iff start iff dm meet iff iff dm iff dice oper order collect ft left operand interv return order collect ft rel ug strict form rel ft rel portion part result set relat similar chosen convex interv good basic set common granular simpl implement extend richer set taxonomi relat collect operand singl procedur appli result collect order higher slice oper replac order collect nonconvex interv fk kn replac collect made subset interv posit collect fk kn collect express defin express denot week end year order collect assum interv correspond year slice return interv dice return finit collect order select return interv dice gener order collect week start januari state formal properti extens theorem extend collect formal repres granular period finit support algorithm proof theorem extend nonconvex interv granular captur extens shown figur paper consid recent theoret framework time granular analyz influenti calendar symbol shown theoret framework gener captur set disjoint interv formal side shown subclass granular repres formal gap infinit extend collect express finit figur subset granular captur extens extens collect formal captur larg class provid good coverag granular found tempor reason applic work definit implement set perform symbol extend collect express problem interest applic address deriv work briefli investig slice refer jame maintain knowledg tempor commun ferrari access control model support period constraint tempor acm transact ce ws rt xs glossari time granular tempor research sripada lnc survei pp gener framework time granular applic tempor annal mathemat artifici baltzer scienc preliminari version proc conceptu workflow book support workflow wide press express time interv repetit formal comput tempor granular tempor proc pp acm implement calendar tempor rule gener proc pp reason int journal intellig time taxonomi interv proc aaai int pp collect tempor proc pp montanari metric layer tempor logic time dissert seri institut languag domainindepend tempor reason recur comput effici symbol period proc pp reason period proc intern workshop tempor reason melbourn tempor queri snodgrass kluwer academ syntax summar syntax symbol formal note basic calendar consid text variabl symbol express denot calendar gener pc rel pc rel start intersect meet interv interv sel integ integ proof proof theorem basic calendar infinit slice illustr algorithm deriv point fr repres start point interv denot term algorithm work step add element sum describ slice technic trick obtain start point term main loop consid granul slice start avoid check infinit number granul combin comput index term singl granul denot slice fr dp begin element element begin begin find begin begin function find receiv input calendar integ number comput index interv start point interv function return index granul granul indefinit point identifi algorithm begin interv durat order deriv interv term translat durat term granul durat equal maximum index granul granul deriv interv hn denot slice period interv period simpli slice period term integ period granular defin easili disjoint slice granul overlap definit period exist interv denot index granul granul integ ng includ construct granular period contradict hypothesi conclud st exist st integ integ exist integ construct granular interv denot belong interv denot period period interv contradict hypothesi st algorithm easili adapt deriv interv denot granular simpli defin explicitli map granul interv disjoint slice ensur result map granular finit case trivial proof theorem infinit period granular definit period wrt basic granular identifi basic calendar period term granul explicit descript granul period set index granular set repres interv cal calendar gener includ interv largest interv ad order cover time line cal calendar constructor defin section case synchron period valu express evalu cal calendar interv start granul cal show slice express interv cal interv start trivial period exist granul mod start point interv cal cal period start point interv cal construct interv cal interv denot newli insert slice cal start point cal impli interv denot slice easili construct cal cal interv denot exist granular finit cal cal gener explicitli list interv proof analog proof proposit proposit semant oper express possibl structur interv collect higher select interv interv collect deriv subset disjoint subset disjoint interv satisfi relat interv lead multipl presenc result collect strict oper rel select common subinterv interv gener overlap interv type oper simpli select interv collect base index assum collect express built calendar appli slice dice calendar overlap conclud deriv collect equal disjoint interv proof theorem proof base algorithm comput interv denot collect express period interv finit algorithm trivial collect explicitli set dice slice oper algorithm gener interv result applic algorithm repres infinit collect order finit set interv period possibl lower upper bound identifi valu min max choic begin period induc calendar definit collect defin specif oper appli algorithm evalu collect express left algorithm appli dice order appli dice interv collect order algorithm appli slice singl slice order result singl interv collect order algorithm appli dice finit collect express return lower upper bound collect oper finit collect return algorithm gener bound collect store minimum min maximum max bound collect end collect express collect period min lower bound max upper bound algorithm calcul interv identifi collect express set procedur implement slice dice oper sake illustr case procedur implement oper collect express identifi interv overlap collect express assum interv denot dn interv execut gx denot granular identifi granul collect basic gx function return index granul form granul gx interv overlap dc gx ba gx begin dr gx ba gx detail algorithm report extend version paper deriv interv denot collect find granular arbitrari collect express denot infinit number interv global algorithm obtain set interv identifi collect period min max defin period granular period equal equal number interv collect bound minimum min maximum max term granul index lower min greater max check formula section deriv granul period granular finit similarli appli time deriv interv denot interv defin explicitli granul easili algorithm comput interv denot construct lead granular trivial finit period case consid detail granul union set granul interv denot explicitli defin period length equal show interv granul interv denot denot interv period consid explicitli defin interv interv return integ period properti period wrt mod explicitli defin empti contradict assumpt construct true formula min max case lead assum interv denot min max conclud proof theorem granular consid theorem part proof theorem construct calendar cal cal finit infinit easili collect express defin gener interv slightli elabor construct make relat defin period granular requir addit term collect express definit specifi granul defin granul definit specifi granul defin proof theorem introduc interv theorem extend analog proof techniqu show gap counterpart period granular captur extend formal extens theorem relev part modifi algorithm procedur implement dice oper follow semant appli interv detail algorithm report extend version paper depend express period interv period defin granul gap granular easili shown extend collect express extens theorem finit case case gap granular period granul period set index basic granular set repres interv defin primit collect pc mz mz pc interv interv transform granular descript notat primit collect similarli theorem period accommod oper
DB/476 3 queri optim presenc limit access pattern daniela florescu alon levi ioana manolescu dan suciu abstract problem queri optim presenc limit access pattern data order obtain tupl provid valu show presenc limit access pattern search space annot queri annot describ input plan describ theoret analysi result search space base describ queri optim algorithm design perform condit algorithm search set annot queri prune invalid plan earli search space algorithm search strategi order produc complet plan earli search describ experi show algorithm perform studi tradeoff design algorithm introduct goal queri optim system translat declar queri express logic schema imper queri execut plan access physic storag appli sequenc relat oper build queri execut tradit relat queri optim find effici method access data queri optim auxiliari data structur index sort order file order effici retriev set tupl relat structur exist altern scan entir relat exist exist fall back option perform complet scan import assumpt tradit queri optim recent queri process applic common characterist perform complet scan relat queri optim problem complic fact limit access pattern data applic optim presenc foreign tabl function function requir set input order return set tupl applic area motiv work queri process data integr process data ffl data data integr system access autonom remot sourc order answer queri data integr system model content remot sourc sourc provid limit access pattern data serv happen main reason underli data store structur file legaci system interfac data natur data store tradit sourc provid limit access capabl reason secur perform common access limit web form interfac requir field form fill order obtain answer ffl graph base data recent applic found data model base graph natur biolog semistructur data model xml applic model label direct node correspond object label edg correspond attribut graph logic model queri pose uniqu method store storag tune applic store graph pose natur limit access pattern data edg forward system scan entir set object graph note limit appli case fundament reason limit access pattern exist mismatch logic model data pose actual physic storag data evalu presenc queri optim requir explicit descript access pattern data wide class access pattern limit data model bind pattern bind pattern specifi attribut relat valu access set tupl bind pattern specifi retriev tupl provid valu attribut bind pattern view method abstract storag data queri optim paper consid problem queri optim presenc limit access bind pattern set bind pattern describ wai access tupl set queri task effici find optim queri execut plan plan exist queri execut plan adher bind pattern limit relat begin note close relat problem treat paper note bind pattern method provid queri optim explicit descript data storag method describ storag structur focu describ group data data structur describ limit access pattern data section discuss disjoint class storag descript combin note applic optim presenc bind pattern problem data integr import bind pattern limit issu data integr context treat semant reformul user queri exploit capabl sourc perform local process section discuss problem involv extend queri optim paradigm accommod limit motiv begin illustr problem drawn actual applic integr scientif data goal conduct marin studi level water pollut sea applic includ sourc data result set experi sourc store result experi water sourc report result experi level pollut water integr data sourc enabl scientist predict water pollut level wide rang time combin result pollut experi water circul data result experi store sourc schema experi defin uniqu sourc sourc figur execut plan sourc data store proprietari data store relat oper data limit sourc kei experi date select depth experi retriev locat relat complex encod geograph coordin retriev result experi relat complex pictur list describ speed direct water circul sourc perform select locat circul situat similar sourc date depth retriev kei experi retriev locat pollut complex imag select locat emiss locat repres geograph coordin rectangl share sea surfac rectangl fashion sourc refer set rectangl order facilit scientist data sourc answer queri rectangl input locat sourc return number describ similar sourc repres repres sourc typic oper scientist perform data answer queri water circul pollut emiss locat match high similar queri written conjunct goal find optim evalu access limit data sourc figur describ wai evalu valid limit relat queri execut plan valid access limit evalu strategi plan select condit date sourc order retriev kei experi perform date kei obtain experi locat oper perform depend join join temporari relat sourc calcul similar pair locat select satisfi similar predic step kei select experi retriev desir imag circul pollut depend join implement algorithm plan evalu depict figur start retriev sourc kei experi perform depth tupl valu depth date complex comput execut engin data integr retriev relat kei experi perform sourc result filter desir kei result experi sourc order retriev respect order retriev imag locat experi sourc sourc test similar imag sourc retriev thousand experi perform dai reason assum cach result queri execut needlessli repeat comput valu remark plan depict figur execut limit data sourc reason imposs retriev tupl relat locat sourc solut solut paper base extend optim incorpor limit bind pattern kei idea underli solut optim search space annot queri annot subplan describ variabl queri input subplan studi effect ad annot size result search describ effici algorithm search space idea ad bind pattern annot subqueri annot transform explor sidewai inform pass strategi focu paper annot optim studi effect annot size space queri execut plan annot queri execut plan set constant execut plan set constant subset annot includ variabl valu pass subplan show larger set annot lead find plan paper make contribut ffl show presenc bind pattern limit affect fundament properti search annot queri execut explor space bushi tree special handl place select address show extend tradit queri optim search space valid annot queri execut plan queri execut plan annot set bind receiv input addit classic annot includ subgoal plan cover plan produc interest order ffl provid analyt empir studi effect ad annot size search space studi consid shape queri number bind pattern relat studi show import case number valid queri execut plan smaller case import case search space grow significantli compar tradit optim ffl describ queri optim algorithm design perform effici properti analysi algorithm consid valid bushi execut plan order exploit case search space smaller algorithm prune earli plan part valid execut plan algorithm strategi order produc complet queri execut plan fast optim produc complet queri end optim process behavior accept case search space significantli larger tradit case algorithm heurist combin join select placement ffl describ implement optim algorithm result extens set experi experi measur perform algorithm condit queri shape number bind experi show bad optim content section formal defin problem section describ effect bind pattern properti search space section analysi size space annot queri execut plan section describ queri optim algorithm section describ implement section describ result experi end discuss comparison relat work problem definit section formal defin problem set paper class conjunct queri notat conjunct queri queri denot xn predic denot xn tupl variabl atom xn conjunct form queri bodi atom head variabl select result requir queri variabl head note join predic express multipl occurr variabl subgoal set atom form xn constant set variabl call bound variabl denot data access relat associ set bind describ access pattern tupl relat bind pattern relat map argument alphabet fg depict bind pattern attribut relat mean bind pattern bp relat attribut bp map valu access tupl bind pattern relat specifi access pattern valu order obtain tupl tradit queri optim problem case attribut map relat multipl bind pattern describ wai obtain tupl relat set bind pattern relat queri execut engin pattern access data bind pattern section sourc sourc depth date depth depth depth depth depth locat locat circul emiss sourc locat similar bind pattern label cost access cardin expect output bind pattern depth label cost cardin mean cost retriev set tupl relat constant date number experi perform dai averag queri execut queri execut plan queri tree leav label relat queri intern node algebra oper refer leav queri execut plan atom plan discuss plan join select oper paper select simpl form assum cost select neglig simplifi discuss plan assum introduc stage distinguish kind join regular join depend join type join binari oper appli queri execut case regular input queri execut execut independ result tabl join tradit join algorithm type input execut requir bind obtain result left note kind join receiv literatur function implicit filter theta note depend join implement join requir special algorithm mention algorithm search space annot queri execut plan annot describ variabl queri input plan node queri execut plan tree label pair set conjunct cover adorn describ variabl order execut adorn map variabl set mean adorn variabl map start execut variabl map variabl map execut obtain valu exampl shown subscript show set variabl map denot class adorn map rest variabl queri algebra express repres fragment queri execut plan depict figur partial plan annot set conjunct set annot node queri execut plan arbitrari set data access descript relat queri execut annot plan satisfi condit leaf access relat access pattern adorn correct obtain extend bind pattern map variabl select node child select variabl adorn obtain adorn chang map variabl join node children adorn satisfi variabl map map variabl map map map map rest variabl bound set variabl valu pass left map map set join depend regular join queri execut plan denot optim includ compon queri execut physic implement relat oper cost queri execut plan cost physic queri execut plan implement cost atom queri execut plan directli deduc cost data access cost queri execut plan estim base cost oper cost subplan cost special care case conjunct variabl posit attribut modif bind pattern map map function orthogon search strategi algorithm influenc effect prune method make monoton assumpt cost model reson plan obtain plan replac subplan cheaper subplan cheaper queri execut plan cover conjunct queri adorn map bound variabl queri call complet queri execut plan problem set data access descript queri ou goal find complet queri execut plan cost minim end section introduc term conveni discuss queri execut plan consid label set conjunct queri ident adorn queri execut plan viabl part complet queri execut plan adorn bp weaker adorn bp denot bp bp variabl map bp map bp adorn map set variabl queri execut plan cover queri execut label set conjunct adorn weaker adorn chain queri bound variabl relat symbol bf fb ffl class valid viabl ffl class valid plan includ produc bind requir input ffl class fg valid ffl class cover class queri execut plan solv subqueri relat partit set queri execut plan class plan class label set conjunct adorn discuss refer coverag viabil class mean plan plan class viabl plan cover plan plan cover plan cover appli select plan obtain plan optim bind pattern section show set exampl basic properti underli style optim reconsid presenc limit compar garlic data integr system partial handl bind pattern limit framework begin argu essenti queri execut plan annot input variabl kei featur distinguish algorithm garlic order simplifi ignor issu interest order produc queri execut plan partial queri execut garlic partial plan construct fashion base partial plan gener garlic plan execut constant queri complex partial plan execut bind part queri input consid gener phase algorithm partial plan temporarili open execut constant argu subsequ show plan import ramif properti search space queri fg access pattern relat retriev tupl relat relat give attribut build set partial queri execut plan garlic construct queri execut plan iter plan obtain obtain obtain singl plan plan size execut constant queri iter yield singl gener phase plan temporarili construct iter plan lead final plan search strategi emploi garlic import properti shown exist plan answer garlic find optim plan limit implement depend join oper turn plan open exist close subplan model execut depend join implement nest loop algorithm execut iter model tree shown model suffic close plan point highlight limit garlic special import context data integr sourc network nest loop join effici implement depend join author variant join algorithm order implement depend join algorithm case complic implement hold anymor suffic close plan queri execut plan model execut cach techniqu montag time express execut output tupl cach input execut model subexpress close partial queri execut plan garlic miss effici plan context data integr essenti sophist implement depend develop algorithm effici explor open subplan refin consequ discuss refin notion class style optim cheapest queri execut plan plan belong class cover set base relat queri annot plan set variabl requir input addit set base relat cover class plan determin combin subqueri solv plan requir input variabl atom plan singl plan access pattern simplifi ignor issu interest order paper valid viabl consequ fact refin annot plan size space grow significantli class plan prune earli plan belong invalid class class invalid queri execut plan class execut limit access pattern previou class fwg invalid class viabl plan class part complet queri execut plan section prune class plan dramat effect size search section show valid viabil check effici addit properti search space import understand design explor bushi tree special treatment select bushi presenc limit access case set tree includ plan cartesian set bushi tree queri execut plan cartesian product avoid plan cartesian search space bushi tree queri fg access pattern relat easi note linear queri execut plan includ cartesian product includ cartesian wt recal tradit queri graph space tree necessarili includ plan cartesian product queri optim limit search tree cartesian product placement context decoupl join order placement select placement made heurist push queri fashion separ phase mix join order placement predic dynam program style optim queri execut plan annot variabl input interact placement select join order subtl search join order result plan differ wrt placement select illustr queri fg access pattern relat combin pattern pattern depend join obtain plan class fg combin pattern pattern join obtain plan class easi plan cover plan appli select variabl plan obtain plan plan select turn plan turn cheaper standard optim class consid bound origin queri shown plan set conjunct set bound variabl bound origin ignor situat plan class plan optim class real optim conclud note order perform optim presenc access pattern optim search space annot queri plan algorithm avoid invalid plan prune plan earli order avoid cartesian algorithm bushi tree tree special care place select detect multipl queri plan result ident execut section analyz size search space sanction section size search space size space search queri optim emploi dynam program understood section studi effect size search space presenc access pattern search space annot queri execut plan present analyt empir studi result studi justifi choic made design queri optim algorithm section theoret studi studi examin size number valid complet queri execut plan number valid partial queri execut plan consid style optim number queri execut plan larg partial plan dynam program consid small fraction partial plan case chain queri number plan cartesian product number bushi partial plan cartesian product consid dynam program algorithm note number plan explor dynam program result interest emploi dynam program yardstick show classic optim strictli higher size search space dynam present improv optim algorithm complex match dynam program result analysi shown tabl tabl show maxim number valid queri execut plan valid partial queri execut plan case bushi tree consid case tree consid formula includ queri execut plan cartesian product appendix provid sketch entri tabl obtain appendix includ focu studi chain queri binari rn xn combin access pattern set bound variabl line relat access line repres classic access pattern comparison entri note count plan cartesian number row appli queri chain queri line relat access fx line transit line line number relat bind pattern ff vari relat bind pattern bf assum access pattern exist queri execut line relat bind bound fx xn start left line relat bind pattern bf ff line illustr complex join order limit access pattern line repres extrem singl solut solut bushi basic wai classic case permut number plan consid dynam program algorithm dramat line line remark bushi tree consid consid classic case plan line graph ll dp ll dp fx fi fi fx xn queri bind pattern relat rn row tabl bound size search space optim presenc bind pattern queri rn xn bind pattern rn row column repres total queri execut plan column restrict count plan column repres partial queri plan consid dynam column left linear plan refin analysi number relat ff rest bf exact formula entri depend relat tabl show maximum obtain chosen interest observ formula line coincid line line line consid interest case left linear plan obtain shuffl join left rn wai complex higher line case limit access pattern line illustr case complex addit access pattern ff bf gener exponenti higher doubl exponenti line partial queri execut plan consid dynam program algorithm kei draw tabl queri shape presenc limit access pattern significantli reduc number valid dynam program algorithm discard invalid explor significantli smaller space case complex stai complex join order studi size search space analyt studi upper bound size search case mathemat analysi section describ seri experi design measur impact presenc bind pattern size search space figur evolut valid partial queri execut plan complet queri execut plan depend number bind transform studi effect factor size size number shape queri graph type structur bind pattern studi number complet queri execut number viabl partial queri execut number partial queri execut plan gener gener viabil test real size search space complex algorithm proport complex algorithm viabil test proport measur number bushi tree measur effect plan cartesian product random queri facilit experi implement random queri gener number number variabl desir shape pf queri produc output conjunct queri requir properti support kind queri chain star complet queri random type queri queri categori construct fix percent variabl relat number percent variabl belong relat number rest variabl assum belong singl relat valu associ variabl relat randomli rest experi valu cardin relat gener randomli tupl select randomli chosen cost tupl bind pattern select randomli perturb bind simpl analysi show size search space affect contradictori bind pattern limit size space bind pattern size space order analyz contradictori factor respect appli strategi start simpl case relat fff access iter appli transform set origin input bind ffl bind pattern current transform put back current set ffl bind remov origin bind pattern transform size access pattern restrict transform size search wai access data figur point obtain result queri gener randomli paramet show averag ratio number plan transform number plan bind pattern complet result experi effect bind figur show number complet queri execut plan number partial viabl queri execut plan vari number applic bind transform queri variabl bound queri show result bushi cartesian type queri shape observ size search space quickli type bind pattern introduc applic queri plan number viabl partial queri execut plan global star slowli figur evolut valid partial queri execut plan complet queri execut plan depend number transform number total partial plan figur show evolut total number partial plan queri normal type queri manifest behaviour experi conclud prune plan crucial order avoid larg number plan section show influenc test run time optim algorithm ran test vari paramet interest observ number complet queri execut plan depend shape queri faster complet queri slower star size shape queri execut plan bushi plan cartesian product strong effect rel averag effect figur show number complet queri execut plan number partial viabl queri execut plan vari number applic transform queri variabl variabl bound show result bushi tree cartesian product figur show growth search logarithm scale type queri manifest exponenti growth search space depend number transform number viabl partial queri execut plan grow number import claim paper viabil test essenti figur show number total number partial plan obtain gener algorithm plan produc show figur number viabl partial plan number complet plan rapidli figur show total number partial queri execut plan underscor import check viabl plan figur number valid partial queri execut total number partial queri execut complet queri execut plan bind transform cartesian test effect plan cartesian product figur ratio size search space complet queri execut cartesian product versu size cartesian product show ratio vari number bind transform bind transform ratio constant slowli grow complet normal queri chain queri ratio grow drastic rapport pretti constant grow slowli await result transform figur effect product transform consequ size search space analysi size search space illustr develop algorithm consid valid prune search space ignor problem analysi hard predict size space smaller tradit significantli larger order optim algorithm effect handl larg search space main problem style optim search space larg plan produc end optim approach pursu section emploi search strategi main advantag produc plan improv optim proce queri optim algorithm section describ queri optim algorithm detail begin describ kei principl underli focu import aspect basic principl algorithm optim plan search space bushi plan includ cartesian placement select algorithm extens style ffl point algorithm maintain set partial queri execut plan label class belong cost class set conjunct cover adorn ffl set atom plan access singl relat relat atom queri execut plan bind pattern describ access pattern tupl ffl iter step add plan combin exist plan select join oper creat result plan adorn satisfi condit adorn section ffl plan class queri execut cheapest found ffl choic partial queri execut plan combin base util measur significantli class consid strictli order number conjunct cover ffl combin step prune invalid plan select subsect discuss main point algorithm differ search treatment placement detect useless class detail queri optim algorithm figur search build queri execut plan class time class consid order number conjunct cover queri execut plan class cost determin point chang disadvantag strategi complet queri execut plan obtain phase optim analysi section behavior accept context address problem larg search emploi search algorithm interleav explor class associ util measur partial execut plan produc util function depend number conjunct cover plan number input variabl step search partial execut plan greatest util combin plan cover disjoint set conjunct queri advantag search algorithm tune util function produc complet plan fast main disadvantag algorithm consequ fact class isol cost plan class cost plan chang extra bookkeep result track cost incur addit cost show section tradeoff factor favor placement select join order placement select blow size search space previou work power heurist decoupl join order placement select optim heurist introduc select queri execut plan presenc predic placement select fashion separ join order made shown plan select top oper class plan select complet ignor select gener miss optim plan goal algorithm select combin phase extent requir order miss minim plan algorithm consid select fashion creat plan cheapest found class algorithm check obtain plan appli select plan exist algorithm check exist plan cover select appli cost appli select cost plan select ad algorithm appli select enabl improv plan exist class algorithm check exist select cost select cost algorithm replac plan plan select effect step set maintain class exist queri execut plan join oper select class plan select maintain properti entail algorithm maintain minim number class algorithm find optim plan select result case end gener class origin queri assum queri queri execut happen queri execut plan queri select easi check optim plan entir queri obtain introduc select optim plan class cover queri case class queri belong end gener algorithm appli exhaust placement optim plan class cover queri cost phase small detect valid viabl class state algorithm consid valid plan viabl queri execut plan valid queri execut plan result combin step combin plan gener adorn result plan set variabl bound queri empti set repeat chang conjunct queri adorn bound variabl queri plan iff conjunct figur valid test set input bind extend variabl queri test queri queri execut plan stop plan maxim util measur set fg find set plan combin common order util combin join depend adorn add plan plan cover find exist plan class ignor test viabl ignor plan replac recalcul cost add cover replac recalcul cost class return optim plan set plan cover queri gener placement select queri includ optim plan figur queri optim algorithm algorithm test viabil queri execut plan obtain slight modif algorithm decid queri queri execut plan figur show simpl inflationari algorithm decid queri queri execut plan step algorithm add set solv subgoal subgoal adorn satisfi viabil test queri class obtain fresh relat symbol construct queri remov subgoal replac ps variabl associ singl bind pattern adorn easi verifi queri execut plan class viabl implement section shorter implement jdk briefli explain choic made implement algorithm data structur partial queri execut plan design structur store partial consid criteria retriev subset plan ffl join plan search plan share common conjunct build plan tree call plan join candid search time build plan potenti scope set plan ffl decid valid plan appli inflationari algorithm join candid suppli bind mean join search time plan criteria previou ffl order newli creat plan bring cost improv class access class plan time plan creat plan rememb viabil properti class retriev exist plan ffl decid join plan replac select exist find plan bind pattern yield appli call set plan select denot set cover search set make insid group plan built conjunct occur time cheap plan produc scope plan group set conjunct notic join candid plan group interest cach inform plan group set group join candid group comput creat date search plan ad inform search candid perform linear time size result import improv case search entir plan set queri sake assimil conjunct access plan group plan begin group set conjunct plan candid group fr fg fr fg fr fg search plan group group set conjunct plan candid group fr fg fr fg fr fg fr fg fr fg fr fg plan cheaper replac join candid plan member group note search plan ps search subset ps special structur give quick access inform found hash tabl partial plan class extra effici find plan produc class plan cost comparison made cost model consid simpl cost find good cost model distribut environ question scope work model inspir reli basic properti cost fan choic cost model irrelev affect qualiti solut found optim util measur rememb describ util function compar plan decid explor search ffl made conjunct ffl made number conjunct free variabl measur design favor big plan chanc join plan variabl enabl depend join variabl bound plan join build solut decid cost util partial execut plan auxiliari sort util measur plan replac class util function consid costli modif recomput heap structur replac cost compar order plan search candid plan return sort util measur experi setup experi ran sun jdk memori fact implement time consid rel variat valu vari paramet reflect properti languag queri gener search space optim time vari shape vari shape compar dp scale discuss relat work queri optim algorithm extend style optim accommod limit access pattern data algorithm import featur necessit result analysi search space presenc limit access pattern algorithm search space annot queri prune earli search plan invalid viabl part valid complet perform search space algorithm emploi search produc complet plan earli optim process algorithm handl placement select tailor context result show algorithm achiev good perform focu small part search space paper extend dynam program style optim handl limit access pattern natur question queri optim paradigm transform random approach approach optim start initi complet appli transform order find optim plan approach requir set transform rule valid plan classic transform rule associ commut join appli approach bit subtl situat random cover valid plan analysi search problem provid paper facilit futur attempt appli search paradigm state reason exist limit access pattern mismatch logic physic view data bind pattern describ mismatch tsatalo al describ mechan describ storag pattern data describ storag structur store data result select join logic schema data describ secondari path index field replic bind pattern disjoint set mismatch logic physic view data combin famili extend algorithm wai annot queri execut plan note execut plan manipul thought materi relat join algorithm larger search space combin context bind pattern queri execut plan requir join number relat relat mention queri leaf queri execut plan queri subgoal optim algorithm plan join order find plan exist note problem limit access store data context data integr access data web queri bind pattern problem build queri execut plan limit access pattern consid work data integr work address question exist order access data sourc answer queri obtain question find optim order consid relat issu queri optim capabl data sourc vari haa al queri optim context garlic data sourc capabl perform join intern model limit access pattern sourc framework moerkott work optim tabl function garlic work work part bigger effort build queri optim context mismatch logic physic view data futur direct build optim support bind pattern direct extend optim explor queri execut plan direct acycl graph tree note plan tradit optim presenc limit access pattern refer serg abiteboul queri data proc int conf theori complex join proc int conf larg data base page peter buneman semistructur data proc acm symposium principl system page surajit tak yan join queri extern text execut optim techniqu proc acm sigmod conf manag surajit chaudhuri shim queri optim presenc foreign function proc int conf larg data base surajit chaudhuri shim optim presenc predic proc int conf larg data base mari daniela alon dan suciu queri languag xml widom tsimmi integr heterogen inform sourc journal intellig inform march graef queri evalu techniqu larg acm comput june laura donald edward jun yang optim queri data sourc proc int conf larg data base measur complex join queri optim proc int conf larg data base alon anand joann ordil queri heterogen inform sourc sourc descript proc int conf larg data base morri algorithm order subgoal proc acm symposium principl system page heurist random optim join vldb anand jeffrei ullman answer queri templat bind pattern proc acm symposium principl system san yanni ioannidi versatil tool physic data independ proc int conf larg data base page yanni ioannidi versatil tool physic data independ vldb jeffrei ullman inform integr logic view proc int conf theori vassalo yanni papakonstantin describ queri capabl heterogen sourc proc int conf larg data base effici dynam program algorithm order join select proc conf extend technolog
Agents/477 1 agent architectur proactiv persist player charact brian mac cunningham depart comput triniti dublin ireland abstract game develop driven achiev realist graphic result situat todai game set visual photo realist world norm game develop seek make game stand artifici intellig plai import role game design obviou applic ai game creat player charact visual world creat comput inhabit world shallow uninterest paper introduc idea proactiv persist model human player vicin issu involv creat persist intellig agent architectur creation interest robust charact introduct comput game industri bigger film industri technolog game driven desir achiev real time photo realist graphic larg achiev longer huge leap graphic technolog make game stand manner doom leav stage open aspect game technolog move forefront real contend role ai graphic technolog creation game environ behaviour comput control charact player charact lead game experi applic sophist ai techniqu control rectifi situat creat game experi part larger research effort seek achiev applic sophist ai work identifi potenti intellig agent architectur interact entertain comput game kei goal piec work agent architectur creat interest applic paper proce introduc concept proactiv persist agent outlin differ techniqu creat current game motiv applic discuss challeng uniqu design agent area discuss relev field current agent research identifi section discuss concept intellig agent elabor rang agent architectur initi break main reactiv delib agent hybrid agent mix outlin detail number architectur identifi architectur agent base environ advantag futur challeng architectur discuss motiv monster pv visibl act interest thing happen player code comment sdk quot code comment system develop kit repres attitud lot current game design essenc game design interest thing area game environ player activ approach accept lot game action game heavili script event pointless player arriv locat rang adventur game role plai game virtual popul agent act autonom irrespect locat greatli add game offer kind adventur game market todai vast rang player interact simpli wait player arriv locat await involv plai script sequenc kind charact consid static denot work virtual world popul proactiv persist agent comput control charact belief desir goal charact pursu accord real time persist agent refer fact locat game world illustr situat game world made inhabit player charact figur show plan world initi state player move world period figur show posit charact chang time half life system develop kit found interest version philosoph question tree fall forest make sound hear realiti peopl current comput game figur game world room inhabit charact world implement static agent room player charact model shown shade squar figur time step player charact locat model model figur posit charact game world chang time situat static agent shade difficulti scheme case time period room player room model time period player charact move room remain room time period model fourth time period player return room model anomali model time period moment moment scene crucial motiv bring charact point scene leav scene static agent model ignor notion complet maintain continu model solv problem situat shown player encount model maintain maintain realism player encount time period model requir kei goal determin model order maintain realism believ illustr differ implement static agent implement properti agenc agent oper direct human kind control action intern state social agent interact possibl kind agent commun languag agent perceiv respond time fashion occur agent simpli act exhibit behaviour initi model static agent fulfil properti properti uniqu kei differ abil number attempt made design comput game agent base techniqu academ sphere game industri interest academ project includ excalibur project oz project work undertaken institut learn northwestern usa interest commerci game interest includ sim black white properti agenc larg system social abil suggest made comput game limit appeal chang shift occur refer game game place stronger emphasi charact interact main focu game plai import note discuss applic concept social abil impli properti sphere agent research agent research social abil refer abil agent commun attempt share knowledg creat applic properti social abil align consid social abil real world agent applic engag user interest entertain interact engag fulfil social abil criteria team number recent game agent abil interest social interact achiev relationship model expand section architectur relationship model illustr quot fact comput give continu bar throw beer dai dai happi issu uniqu agent applic intellig agent vast rang inform assist sort trawl web articl interest system act air traffic control dispar applic area led agent base research fragment worth identifi applic area relev work design agent interact entertain area identifi agent involv robot agent design facilit human comput interact discuss similar field identifi issu uniqu design agent applic similar agent robot applic stem fact situat complex dynam environ expect perform robust manner agent environ virtual world interact place world complex robot base agent environ real world robot architectur comput game consid techniqu agent robot borrow agent develop ai number techniqu borrow obviou path find algorithm wide applic differ applic area differ meant perform elabor similar agent involv hci obviou agent involv capabl maintain entertain interact agent involv hci relat user kind agent denot affect agent agent give rise number issu found system kei understand goal design agent design effici effect design interest agent concern maintain believ player agent involv system breath charact desir import agent cost effect option reason plan action respond realist success failur plan design architectur applic import easili configur requir stem fact agent act charact entertain experi author configur agent order achiev rang charact design agent true comput number practic restrict account nobl goal virtual world implement realist achiev base hardwar system design typic comput game ai process receiv approxim processor cycl import architectur scalabl expect agent base system game design make charact central game fulli proactiv reli tradit static techniqu charact world desir design dynam switch simpli static charact fulli proactiv persist game requir kind techniqu refer ai similar work conduct graphic research current agent architectur definit intellig agent touch previou deeper exposit worthwhil section explor major trend agent design past number year field break main reactiv delib agent hybrid agent combin reactiv delib number architectur fit categori present architectur consid turn illustr advantag drawback system applic area number relev exampl past applic intellig question intellig compar question reason agenc softwar design philosophi set techniqu agent techniqu vari wide rang disciplin applic rang inform assist sort trawl web articl interest air traffic control system make robust accept definit agenc difficult consid problem briefli definit worth definit notion weak strong agenc weak agent consid fulfil properti agenc notion strong agenc controversi strong agent fulfil properti agenc implement concept appli human concept includ mentalist notion belief desir intent model agenc applic emot abil agent visual cartoon anim face agent applic fit comfort strong notion agenc reactiv agent behaviour agent simplest form intellig agent architectur architectur work brook result subsumpt architectur kei reactiv agent work hard wire stimul manner sensor inform result specif action simpli encod rule simpl architectur number compel advantag reactiv system fast reactiv system program understand reactiv agent determinist complet predict reactiv system requir support infrastructur wide architectur applic todai applic reactiv agent implement finit state machin spite reactiv architectur coupl major drawback situat agent find encod rule place huge burden design eventu relat fact complex environ rang situat vast make design reactiv system imposs behaviour base dialog system present requir separ behaviour utter speaker major reactiv system troubl form simplest long term plan reactiv agent intern model world incap reason abstract agent simpli receiv input react simpl rule delib agent sophist agent architectur delib agent built classic symbol base ai agent build intern model world formul plan order achiev goal state plan system order logic base situat calculu order formul model construct plan plan abil main advantag system suffer complex involv due logic base delib system make realtim requir agent realm infer base reason processor intens realist complet delib agent system drawback delib agent requir constant mainten knowledg base fast move dynam environ encount applic major issu consist system maintain involv updat infer made base knowledg chang pure delib system wide applic exampl note run excalibur project attempt creat delib agent applic achiev place heavi restrict potenti search space infer project concept anytim agent emerg hybrid agent hybrid agent combin aspect reactiv delib agent philosophi hybrid agent make featur architectur reactiv system deal time critic behaviour long term plan achiev delib system lead introduct mediat system exampl hybrid agent includ interest variat number variat core architectur develop relev applic elabor agent design philosophi design broad believ agent involv design agent profici wide varieti thing kei ensur agent remain time believ broad agent good effect oz project emot agent requir uniqu game applic agent displai react emot give number attempt made includ social agent agent virtual world requir commun believ human user agent differ gener notion social abil agent research notion sociabl term agent remain discuss social agent term applic agent abil interact social human user agent lot research area part larger hci research effort engag user implement anytim agent emerg excalibur project concept anytim agent simpl agent delib base ad constraint form plan iter slice process agent current plan infer time slice run action subsequ process time slice allot plan reevalu improv advantag kind system overcom process restrict delib system believ agent constantli pursu aspect current plan final architectur discuss agent architectur work design goal reiter kei goal design seek satisfi autonomi scalabl social abil extend reactiv believ persist configur order satisfi goal modular architectur kei build block architectur figur system major behaviour system social system goal base planner schedul percept behaviour system select social select goal base planner select schedul figur modular design agent architectur game translat common knowledg base system access base system pass action select modul elabor detail game system consid classic reactiv system made behaviour set world condit robust processor effici agent behaviour part behaviour system model number measur describ agent person bodi research field exist number avenu explor social system reactiv system similar respect behaviour system main task modul deal interact agent distinct made refer social classic agent research refer social system talk social system refer actual social interact danc kind social requir uniqu applic obviou tradit agent base word system social action world maintain model relationship enemi main reason separ social system system stai true modular philosophi architectur system separ conceiv applic social system reason separ due similar modul tightli coupl modul system planner delib system abil make plan base content knowledg base system form order logic order reason world schedul modul uniqu domain mean maintain believ agent daili busi achiev smallest processor hit schedul give task agent time dai modul domain achiev high level believ small amount process wrap select mechan mediat modul action base suggest believ architectur satisfi design goal challeng remain true design goal implement outlin implement challeng architectur pose number challeng implement kei remain true design goal outlin effort made make system scalabl easili configur mean implement reactiv social role pass system consid role pass slightli sophist typic reactiv system present role pass involv implement infer rule code role agent chase defend point bargain role number variabl bound object bargain partner role pass offer slightli sophist typic implement reactiv system retain main speed determin delib system pose problem implement due process time complex involv implement achiev present consid infrastructur system popul agent challeng main issu comput agent immedi visibl receiv process time immedi visibl player number schedul techniqu investig order achiev number advantag glean level detail techniqu demand accur path made agent vicin player agent architectur applic present kei goal creat architectur construct believ interest agent entertain challeng build previou satisfi bibliographi joseph bryan scott broad aaai spring symposium integr intellig stanford march rodnei intellig proc morgan san rodnei robust layer control system mobil mit ai lab memo septemb intellig outlin resourc orient approach emot knot page donna creat intellig comput graphic world ma aaai spring symposium artifici intellig interact entertain john repres knowledg situat calculu epistem journal reliabl issu volum make cognit model comput phd michael martha milind michael model springer piotr gmytrasiewicz christin model emot interact entertain work note aaai spring symposium artifici intellig interact entertain menlo aaai press march collabor dialogu model base interact reactiv intern confer autonom marina del acm press id robot architectur believ game aaai spring symposium artifici intellig comput aaai technic report system wooldridg roadmap agent research develop journal autonom agent van killer interact comput proc aaai pp aaai press mit lewi jeff jame anim pedagog interact interact learn intern journal artifici intellig educ michael review interact drama believ technic report school comput carnegi mellon pa june muller pischel agent architectur concept applic research report deutsch forschungszentrum fur kunstlich intellig agent comput intern confer comput game open world plan paper workshop constraint ai technic page aaai menlo affect mit charact form knowledg aaai spring symposium ai interact rao theori tech rep australian artifici intellig april social behavior believ work note aaai fall symposium intellig novemb andrew ai comput present aaai ai interact entertain spring symposium bryan intellig game develop octob intellig agent interact simul environ ai spring ian artifici emot drive emot work note aaai spring symposium artifici intellig interact entertain menlo march steven ai game confer march comput program studi natur languag commun men machin commun associ comput nr intellig workshop agent lectur note artifici vol page wooldridg jen intellig theori practic knowledg engin emot agent phd ian wright jame ai processor june
IR/478 5 intern confer parallel distribut process techniqu pp copyright press text imag metasearch web steve lawrenc lee gile nec research independ nj abstract web continu rel coverag web search engin search tool combin result multipl search engin valuabl paper detail text imag metasearch function inquiru search engin develop nec research institut text describ featur includ link inform provid statist usag perform inquiru web search engin imag inquiru queri multipl imag search engin download actual creat imag thumbnail displai user inquiru handl imag search engin return direct link engin return link html page engin return html inquiru analyz text page order predict imag correspond queri individu imag search engin tend excel class combin engin surprisingli effect find imag queri text imag metasearch function inquiru surprisingli describ parallel architectur engin effici text imag parallel web search introduct limit search servic web led introduct metasearch engin metasearch engin search web make request multipl search engin altavista infoseek result individu search engin combin singl result set advantag metasearch engin includ consist interfac multipl engin improv coverag develop metasearch engin web inquiru number differ typic metasearch engin inquiru fundament architectur download analyz individu web page referenc search simpli retriev merg search engin mean inquiru date work current content extens analysi page content page analysi function perform inquiru includ extract summari make relev assess easier consist relev measur page typic metasearch filter improv duplic detect base queri term queri term highlight quick jump link view queri morpholog cluster word phrase inquiru return result progress parallel architectur inquiru typic return result faster standard search engin respond multipl search engin improv coverag note advantag inquiru applic search engin paper detail imag metasearch function provid detail statist text metasearch cover previou paper imag metasearch number imag yahoo imag surfer altavista larg web search engin search imag lyco hotbot altavista tend index imag tend excel ferent queri concept appli text metasearch appli imag section describ motiv oper keyword base imag metasearch function inquiru previou work compani pl dialog veriti produc system integr result multipl heterogen text metasearch servic exist popular metacrawl servic metaseek metasearch engin imag metaseek target queri keyword focu imag metasearch function inquiru motiv principl motiv imag metasearch function inquiru similar motiv creation text metasearch poor limit limit limit user interfac imag search engin expand poor automat determin relev imag keyword base queri difficult task imag search engin typic mean assess relev difficult imag produc result limit coverag search engin index publicli imag web index web exhaust coverag web coverag imag limit engin tend index coverag improv combin result multipl engin limit avail due search engin network observ engin respond vari time limit user interfac imag search engin support queri engin support phrase queri advantag metasearch techniqu queri modifi appropri individu engin architectur figur show simplifi control flow diagram imag metasearch algorithm engin consist main logic imag metasearch code parallel page retriev daemon pseudocod simplifi version search code process request check syntax creat regular express match queri term send request relev imag search engin loop page retriev maximum number imag page retriev page search engin search engin extract hit link set result send request hit send request set result applic page imag imag meet displai criteria add imag displai queue analyz queri term locat page predict imag page correspond queri send request download imag endif imag displai queue creat singl imag montag imag queue displai montag clickabl imag portion imag origin individu imag show detail page origin imag endif end loop imag displai queue creat singl imag montag imag queue displai montag clickabl imag portion imag origin individu imag show detail page origin imag endif print summari statist engin return list web engin analyz page order predict imag page correspond queri mechan engin queri term filenam imag file found locat imag closest queri term figur simplifi control flow imag metasearch interact page retriev daemon shown grai small thin imag filter imag typic icon separ note engin displai imag group creat montag thumbnail imag map displai page individu thumbnail click montag techniqu browser implement prone crash present larg number smaller thumbnail imag note architectur engin reli valid url provid imag search engin imag download filter link longer valid engin present thumbnail imag low search engin user determin relev imag easili compar engin return url referenc imag page imag result return progress imag download imag download click full imag displai window imag web page shown queri term highlight imag cach result substanti improv reduct frustrat wait imag load engin detect filter ident imag checksum file figur show inquiru imag queri sunset home option feedback add url analysi paper search sunset yahoo hotbot altavista photo finder section delet engin total retriev process duplic altavista imag hotbot imag photo finder yahoo imag sunset web usenet web usenet imag figur sampl inquiru imag search keyword sunset effici impress imag metasearch techniqu present techniqu slow surprisingli fast result engin typic displai remain imag typic displai faster user displai imag part perceiv speed due parallel architectur engin figur show median time engin respond queri made simultan web search engin figur show median time arbitrari web page download queri made simultan page median distribut time significantli shown figur show histogram page retriev time arbitrari web page download page parallel result page retriev significantli faster averag page retriev explain imag metasearch engin start displai result quickli potenti drawback imag metasearch techniqu amount bandwidth note simpli bandwidth rapidli bandwidth issu import futur bandwidth requir brute forc search web text metasearch detail text metasearch featur inquiru provid section detail link statist usag servic perform search engin number search engin median time web search engin respond figur median time web search engin respond number page median time download web page figur median time download page request simultan link improv metasearch standard search engin make link page googl pagerank part method rank page pagerank consid number link page link highli link page rank inquiru number link page techniqu inquiru make link inform queri return page link desir page return desir page page found link descript page page research homepag page link page includ research link shown figur inquiru displai link page easi follow link inquiru analyz graph creat link page result order identifi authorit page link page link author result similar hub author comput perform kleinberg algorithm inquiru simpli number link page result set figur show algorithm kleinberg typic iter augment result set neighbor page link graph web inquiru add substanti comput requir plan compar algorithm algorithm usag perform statist inquiru nec research institut analyz queri inquiru april user perform averag queri page view queri inquiru show suggest time page time figur time arbitrari web page time greater shown bin home option feedback add url analysi paper search hotbot googl msn infoseek altavista excit lyco northern light snap fast yahoo search link page simpli enter url adob mac editor execut editor michael wellman associ editor craig boutili bernhard walsh fayyad sridhar mahadevan david waltz stephani forrest maja matar brian section delet david waltz web usenet web usenet imag main vote rank hub author duplic site partial suggest summari figur sampl inquiru queri david waltz result david waltz summari link homepag link underlin shown link directli user find valuabl document averag word higher typic report valu web search engin queri higher typic report web search engin higher number word queri phrase due user popul queri suggest inquiru make term queri phrase return page term inquiru suggest phrase user follow suggest phrase futur obtain improv result user read inform suggest good teach user queri queri featur search servic figur show median time web search engin function time median distribut time significantli skew time vari significantli engin time summari discuss text imag metasearch function inquiru search servic inquiru number advantag text metasearch analyz current content page inquiru demonstr text imag includ download analysi match page feasibl imag inquiru queri multipl imag search engin download actual hub author author hub network inform financ wall street journal link monei section person monei section pc quot search beat busi cube nyse link economist link data broadcast corpor activ lynx financ forum figur sampl hub author comput queri apr apr apr date median engin time altavista excit googl hotbot infoseek lyco microsoft northern light snap yahoo figur median time search engin respond creat thumbnail displai user imag search engin return list inquiru analyz text page order predict imag correspond queri individu imag search engin tend excel class combin engin surprisingli effect find imag queri implement inquiru show surprisingli download process imag refer selberg etzioni metacrawl architectur resourc aggreg web ieee page ae inform gather agent queri web search engin technic report comput scienc colorado state steve lawrenc lee gile context page analysi improv web search ieee internet selberg etzioni search comparison metacrawl world wide web john ana benitez visual inform retriev larg distribut onlin repositori commun steve lawrenc lee gile search world wide web brin page anatomi hypertextu web search engin seventh intern world wide web winograd pagerank citat bring order web kleinberg authorit sourc hyperlink environ symposium discret page san januari bharat mr improv algorithm topic distil hyperlink environ sigir confer research develop inform saracev real life inform studi user queri web volum page
IR/479 5 interact manag text rakesh roberto ramakrishnan srikant ibm almaden research center san usa abstract describ system maintain hierarchi textual document interact oper requir system includ speed minim effort athena satisfi requir classif cluster engin appli interact speed develop accur model naiv classifi recogn classifi text show special naiv classifi accur absolut standard implement enhanc includ law success laplac long author subject present interact cluster topic discoveri find highli accur cluster digest user feedback merg correct classif algorithm complet partit data interact cluster achiev higher cluster accuraci absolut popular agglom cluster method introduct peopl organ data form unstructur textual due flourish web usag system manag text typic provid support keyword queri manual arrang document hierarch structur benefit folder hierarchi includ abil quickli locat document rememb exact keyword abil easili set relat document task maintain coher folder time result user simpli messag accumul messag remain delet benefit folder hierarchi realiz web search engin site larg product catalog provid maintain hierarch categor enhanc usabl search result facilit present system henceforth refer athena simplifi process hierarch document organ text mine algorithm athena implement top lotu note support manag discuss concept appli equal document repositori includ collect web page text file import function athena topic unorgan collect document group group consist document topic hierarchi reorgan hierarch collect document hierarchi hierarchi popul inform current popul hierarchi organ document topic automat rout document document fit multipl categori option rout displai categori hierarchi identifi document node hierarchi detect concept drift node detail descript athena function classif cluster basic build block implement function technolog studi extens area inform machin learn standard techniqu perform poorli applic naiv classifi recogn classifi text found special naiv reduc number error absolut compar standard implement enhanc includ law success laplac long weight author subject cluster algorithm appli domain fast avoid tax patienc user present interact cluster topic discoveri find highli accur cluster digest user feedback classif algorithm complet partit data interact cluster accur absolut accuraci agglom cluster method paper layout rest discuss relat work system rout cluster email text document discuss relat work autom text hierarchi manag cluster classif algorithm section describ technic detail classif compon section result justifi design section technic detail cluster empir evalu efficaci section conclud summari direct futur work relat work previou develop classif model rout gener special case system provid agent assist user predict action user address task textual organ rout incom document relat work includ system cluster assist user larg collect document directli address problem creat maintain document requir system algorithm capabl extract inform involv user process appli algorithm make detail comparison system section agglom text cluster organ result queri network inform naiv classif organ document exist categor scheme classif compon athena classif compon hierarchi document identif document decid base classifi model classifi competit techniqu text classif stabil quickli support autom hierarchi reorgan limit number exampl fast construct quickli singl pass make suitabl model quickli classifi incom document simpl updat presenc document addit make easi maintain experi sprint classifi found low accuraci domain due small number exampl class larg featur space basic classifi estim posterior probabl class document ignor class estim number document class total number document dataset estim assum word document occur independ number occurr word class multipl total number word class maximum likelihood estim simpli estim give probabl word occur result document word present class standard approach address problem smooth maximum likelihood estim laplac law success jv jv size vocabulari number distinct word formula result assum word priori equal multinomi form naiv classifi document treat bag word set word yield accuraci enhanc classifi special standard classifi appli techniqu long document author subject subject treat subject word subject occur time prevent long document domin folder document word threshold treat word occur number word document weight threshold determin part train set valid set enhanc cumul yield upto accuraci improv experi small class larg class vocabulari number word number occurr word correct correct fig skew due laplac correct search idea larger improv examin word maximum impact classif document word found ratio class athena chose class highest investig misclassifi document reveal probabl estim word highli skew laplac correct figur explain skew word maximum likelihood estim class appli laplac consid time larg class small class suspect laplac correct creat strong bia larger class law success replac laplac law success law success posit estim jv class probabl estim due gf hardi gj turn centuri estim linear interpol maximum likelihood estim uniform prior rewrit substitut jv jv note correct ident laplac correct attempt improv accuraci naiv kohavi al experi correct dataset uci dataset consist textual data found slightli reduc averag absolut error compar laplac correct empir evalu ran experi dataset shown tabl refer email reuter dataset vocabulari avg std dev avg std dev reuter tabl dataset characterist lambda reuter lambda reuter improv accuraci fig correct version distribut notic email dataset larg number rang exampl rang document accuraci number comput figur show chang accuraci vari rel accuraci laplac correct accuraci improv largest gain dataset accuraci number low number error reduc dataset tabl optim vari depend dataset recal hypothesi reason improv accuraci due bia larg class produc laplac correct verifi measur size bia classifi misclassifi document cm misclassifi class class geometr misclassifi document measur size bia classifi figur show size bia dramat confirm hypothesi misclassifi class time larger class optim valu ratio lewi dataset number standard final reduct top class error class reuter tabl accuraci standard deviat note dataset gave dramat largest chang size sensit accuraci athena automat procedur select optim basi portion train set valid comput accuraci classifi valid set valu obtain optim recent work mccallum al uniform prior global prior frequenc distribut entir smooth maximum likelihood estim algorithm expect maxim assign weight distribut basi procedur typic requir dozen iter summari result tabl show accuraci classifi standard naiv classifi laplac correct classifi correct laplac optim determin automat part train set valid set classifi correct author long document reduct error standard version final version top accuraci classifi classifi judg correct top choic correct observ larg gain accuraci due small gain accuraci due author long document absolut accuraci rang email reduct number error note classifi accuraci significantli higher top class accuraci achiev applic make multipl recommend document rout user make final select applic document natur belong multipl class multipl classif document inform user possibl cluster compon cluster compon topic discoveri unorgan collect document develop interact approach cluster involv iter present user number relat document suggest folder call set document cluster digest term borrow system text cluster assist user document collect cluster digest present user determin document collect worth unlik athena produc complet cluster form cluster digest appli algorithm produc digest directli result time suitabl result algorithm produc digest incorpor feedback user cluster model produc addit avoid user desir number cluster apriori multipl text popular effect belong agglom class drawback class algorithm quadrat runtim limit applic overcom complex intermix iter partit cluster algorithm agglom scheme basic idea appli inferior fast partit cluster algorithm document set point agglom cluster effici found complet cluster typic error reorgan document opt develop algorithm quickli produc cluster digest topic leav document partit classifi experi reveal approach accur algorithm thought cluster digest time evolv present user discard irrelev move document discard digest modif addit digest mine remain document user request implement cluster user exact number cluster discov algorithm detail digest evolut routin figur call algorithm variabl specifi number cluster digest evolv simultan set algorithm call cluster desir user input set input document set cluster digest integ number cluster evolv simultan integ digest size bound number document cluster return cluster digest consist digest size document score algorithm descript remov document digest initi cluster random document initi cluster document minim cluster top digest score document exist goto step return cluster cn maxim fig algorithm evolv cluster digest make similar return float point indic maximum function accept singl document set document argument approach comput similar document pair cosin distanc vector term term frequenc damp squar root function similar cluster averag similar document function accept cluster digest set cluster digest return function maxim document highli similar cluster highli dissimilar cluster method comput score function properti ae step algorithm perform involv input set belong cluster seed cluster document dissimilar seed polici spread search good cluster digest document space step grow cluster document time maximum size reach cluster stop chang virtu score step attempt maxim similar document dissimilar evolv cluster discov cluster ensur algorithm perform complet partit input evolv digest discov topic repres exist note scheme greedi document ad cluster disappear iter document score highli earli cluster evolv longer score highli featur ensur document remov improv final result athena emploi paramet set set chosen yield good small time document collect thousand cluster digest size java base implement simpl obtain tight bound iter perform cluster continu evolv reach desir size number iter perform cluster digest reach desir size typic amount linear complex assum cluster digest size bound constant number iter small constant linear complex user desir larger cluster proport collect size bound procedur modifi grow cluster singl document time found slow cluster growth earli iter growth iter order linear complex significantli result evalu compar tradit cluster method includ hierarch agglom cluster suit experi evalu perform find cluster digest compar techniqu agglom cluster fulli partit input order produc cluster modifi return central document cluster suit experi evalu appli interact classifi previou compar cluster method fulli partit input document agglom cluster algorithm work place document iter merg pair similar cluster desir number cluster remain cluster similar averag similar document cluster document similar function document frequenc damp cluster algorithm ensur fair comparison algorithm cluster algorithm cluster seed initi cluster number equal number desir singl randomli chosen document pass made input document document move cluster similar process repeat cluster stop point return collect evalu obtain file standard benchmark data order show result appli gener show characterist select document prevent folder document compil activ mail excess slow agglom algorithm overli skew input distribut reuter document topic assign evalu topic discoveri assum organ provid folder hierarchi cluster data fifti trial folder select random document intermix cluster algorithm run result document collect made identifi cluster digest document chose identifi smaller number cluster digest number true cluster order determin sensit agglom cluster number cluster identifi real world true number cluster number cluster user identifi true number cluster demonstr knowledg true number cluster necessarili improv agglom cluster identifi cluster digest return result cluster digest maxim averag set cluster digest provid algorithm comput metric digest digest document singl true cluster puriti digest defin maximum number document experi run owner person machin order maintain privaci requir experi complet singl machin free regular work dai puriti fig puriti result cluster digest digest belong true divid total number document digest metric digest digest present topic distinct cluster number true cluster cover domin class cluster digest impli maximum score appli algorithm find digest experi result experi figur superior scheme respect puriti metric respect superior agglom algorithm identifi cluster return digest algorithm attempt identifi true number cluster fare counterpart identifi cluster evalu interact cluster set topic athena user popul topic addit document appli classifi previou section evalu techniqu work attempt fulli recov true cluster complet partit input document select folder random intermix document form algorithm input fifti trial perform result averag agglom cluster algorithm attempt identifi true number cluster cluster document consid class match domin class cluster comput accuraci cluster minu error rate appli repeatedli folder discov folder discov digest domin class digest match number digest identifi order discov folder exce true number cluster comput error fig accuraci result approach sum total number document digest belong domin class digest error ad number error produc classifi popul cluster remain document simul appli remov error cluster digest merg cluster digest discov folder evalu effect system present user small number exampl manual correct athena classif classifi appli order broaden train set document folder document folder document present user athena count error suggest class folder document belong figur interact approach cluster lead substanti improv accuraci standard cluster techniqu manual correct athena classif small number exampl appli classifi lead improv note obtain result provid tradit cluster techniqu knowledg true number cluster fact improv suggest cluster organ document rare match true cluster defin statist techniqu interact cluster approach user guid algorithm desir partit input document futur work address problem simplifi process hierarch document organ manag text mine algorithm classif cluster basic build athena system rich function automat creation mainten hierarch text user discov topic unorgan tion document partit document topic reorgan hierarch collect hierarchi give document exampl exploit inform current hierarchi rout document find document identifi node hierarchi reorgan due concept drift node implement applic requir classif cluster make standard solut inadequ enhanc basic algorithm featur includ law long author subject enhanc led absolut accuraci test data set develop interact cluster algorithm algorithm find highli accur cluster digest obtain user feedback classif algorithm complet partit data algorithm result absolut accuraci agglom cluster strict classif cluster algorithm previou interact dimens receiv compar attent feel research direct cooper algorithm prove fruit acknowledg andrea dimitri howard sunita john shafer magnu contribut design athena refer srikant interact manag text research report rj ibm almaden research san ca juli sm weiss autom learn rule text categor acm transact inform raghavan signatur navig text proc intl conf larg page dr kr jo jw tukei approach larg document collect proc intl acm sigir conf research develop inform ww cohen learn rule classifi proc aaai spring symposium machin learn inform ij good estim essai modern bayesian method mit hardi correspond insur improv simpl european confer machin poster softwar bayesian classif featur select proc fourth intl conf knowledg discoveri data kohavi scale accuraci hybrid proc intl conf knowledg discoveri data lang learn filter proc intl conf machin page note gener case formula induct posteriori probabl tran fac lotu note dd lewi ringuett comparison learn algorithm text categor annual symposium document analysi inform page mae agent reduc work inform overload commun tom mitchel machin chapter andrew mccallum kamal nigam comparison event model naiv text classif workshop text andrew ronald tom andrew ng improv text classif shrinkag hierarchi class intl conf machin pazzani billsu learn user identif interest web site machin tr payn edward interfac agent investig learn issu mail agent interfac appli artifici rasmussen inform data structur chapter cluster page prentic englewood es natur law success technic princeton research report john rakesh mehta scalabl parallel classifi data mine proc intl confer larg septemb horvitz bayesian approach filter junk proc workshop learn text segal kephart intellig assist organ proc intl conf autonom baldonado servic organ network inform autonom proc acm confer digit page
ML/480 6 converg theori applic factor distribut algorithm heinz muhlenbein theoret foundat gmd laboratori gmd forschungszentrum st augustin abstract paper investig optim addit function evolutionari algorithm call factor distribut algorithm fda base factor distribut gener search point separ adf consid map gener linear function metavari defin multipl allel map transform fda univari margin frequenc algorithm exact equat select comput assumpt select truncat select approxim equat time converg deriv analysi function fda numer investig separ function time converg similar separ adf fda outperform genet algorithm recombin string keyword fisher addit genet factor distribut introduct genet algorithm popul base search method set point point select point gener genet oper recombin mutat simpl genet algorithm select point denot vector discret random variabl distribut gener averag fit popul simplic assum binari variabl select scheme call averag genotyp proport fit valu select guid creation gener point discret densiti defin paramet mean straightforward implement equat prohibit central question genet algorithm popul base algorithm formul equat approxim substanti exponenti comput real world comput partnership extend genet approach base probabl theori approxim equat explicit aggreg structur aggreg schema give schema extend usual notat defin schema valu held variabl free sum equat member schema obtain probabl select probabl term margin distribut abbrevi schemata defin margin distribut state question term probabl set margin distribut exist good approxim equat comput polynomi simplest choic order schemata univari margin distribut univari margin distribut algorithm point gener densiti order schema defin gene loci distribut equat order schemata give bad approxim claim schema theorem creat point recombin good approxim equat muhlenbein numer theoret evid recombin behav similarli approxim equat equat order approxim complex distribut higher order schemata schemata illustr problem loci order schemata gener exist close express function bivari distribut problem discuss detail muhlenbein al paper fit function factor product margin distribut addit function ae ng ng outlin paper investig separ section transform function function metavari defin multipl allel problem exact equat select comput equat fisher fundament theorem natur select gener linear function section weak form fisher theorem proven arbitrari fit function examin relat structur equat structur fit function result comput approxim solut linear fit function section investig special function defin set overlap variabl condit distribut section deal truncat select approxim solut obtain defin evalu factor distribut algorithm numer exampl fda extens factor map metavari multipl allel assum probabl express product lg index set disjoint ng combin metavari allel js fit function formul fit function metavari valu map js demonstr map exampl ff ff ff ff defin metavari function transform ff ff ff ff ff ff ff ff ff metavari obtain gener linear function higher order interact consid ij ij ij ij metavari larger combin bit metavari assum index set ij disjoint simplic assum set suitabl map transform gener linear function map function mg set mod div mod div xm defin metavari defin equat fit function transform gener linear function lead larg set reason partit set separ metavari partit case transform function linear comput section equat select gener case exact equat call mind domain definit discret vector discret random variabl shorthand notat element proof variabl denot variabl function denot margin probabl distribut polynomi order distinguish interpret write note free addit constraint deriv respect addit definit definit subset denot product space jj sum fix ji multipli formal proof binari gene comput exact equat select express defin addit genet varianc summat equat equat obtain differ equat univari margin frequenc defin definit univari margin distribut algorithm gener point origin space gener point deriv map defin factor distribut algorithm origin space size index set js bound fix constant margin distribut comput enorm reduct compar factor theorem multipl allel select start taylor consid fix variabl notat defin structur proven part express deriv order higher involv calcul deriv shorthand notat paramet omit interpret variabl term independ term obtain theorem select arbitrari fit function separ fit function transform gener linear fit function function fisher theorem valid corollari gener linear function select combin equat obtain deriv independ higher deriv show complet linear fit function higher order deriv vanish gener corollari fit function order interact order deriv vanish yield order deriv vanish gener weak version fisher theorem fisher theorem valid gener linear function arbitrari function show greater equal point gener equat proof base gener form inequ baum written notat theorem ij polynomi nonneg coeffici homogen variabl ij fp ij point domain ij ij denot point coordin ij ij ij ik ik theorem select margin frequenc remain function variabl consid variabl defin ij constraint ij fulfil show equat ident equat univari margin frequenc easili obtain ij defin equat ik valid margin frequenc fulfil assumpt theorem numer properti averag fit popul properti termin algorithm section investig exist vanish higher order deriv structur relat paramet consid fix omit formula theorem jj subset exist function proof induct jj lengthi omit theorem state number interact variabl order higher deriv vanish give exampl assum deriv gener linear function binari variabl conjectur assum deriv form ij section approxim solv differ equat linear function linear fit function theori obtain equat chang allel frequenc linear fit function arbitrari alphabet arbitrari linear function ff ff ff ff margin frequenc step select equat ff ff theorem linear function margin distribut select select ff ff ff sort equat multinomi fix substitut order obtain multinomi chang sign product involv lead ff ff ff evid ff ae jj term ff occur jj time altern jj jj obtain ff yield ff ff ff deriv order higher final ff ff ff ff ff differ equat easili comput numer analyt solut complic deriv approxim solut special case theorem ff ff approxim margin frequenc ff ff ff ff ff ff ff ff ff ff fi ff obtain equat ff approx figur approxim exact allel frequenc calcul frequenc ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff fi ff ff ff ff ff ff ff fi ff ff ff ff ff fi ansatz obtain equat ff ff ff ff ff ff ff fi divid equat function defin ff case obtain exact solut equat approxim exact difficult function ff ff fit function theorem comput numer valu numer compar approxim valu exact valu result shown figur plot frequenc logarithm lead linear graph predict condit probabl distribut index set analysi difficult probabl distribut longer product independ distribut introduc condit probabl order describ problem simpl index set probabl distribut factor jx factor product probabl constraint determin paramet gener distribut variabl paramet slight reduct number free paramet goal calcul omit paramet clear context equat obtain equat suitabl aggreg deriv differ equat distribut defin probabl formul result theorem theorem select fit function set give factor jx obtain jx jx chosen consist actual sum equat jx lead procedur insert yield jx jx denot univari margin frequenc set jx jx jx jx jx jx lead differ equat note result formal similar term jx complex usual term tediou calcul final express deriv conjectur formal obtain exact equat simpl overlap set analysi extend chain overlap variabl interpret calcul condit term difficult set overlap irregular difficult obtain factor probabl investig problem numer simul approxim deriv theori factor distribut algorithm fda base factor distribut gener form assum jy ae ng mathemat discuss factor problem reader obtain factor exampl discuss detail set transform fit function gener linear function select suit mathemat suit practic optim algorithm select weak final stage algorithm fda truncat select fda ffl step set gener ae point randomli point equat ffl step select ffl step comput condit probabl jy select point ffl step gener popul jy ffl step termin criteria finish ffl step add point previou gener gener point ffl step set step fda extens work origin space separ function algorithm gener search point fda combin mutat recombin genet algorithm oper probabl distribut factor probabl defin equat faster proport individu gener local approxim condit margin distribut jy zn arbitrari larger yield uniform distribut chosen small jy fda micro macro structur subset disjoint fit function gener linear function macro variabl defin integ select analyt deriv exact differ equat margin distribut truncat select comput exact differ equat show similar fda section simul converg result truncat select analyz simpl fit function detail count number bit string approxim relev fda recal theoret result al assum loci ident univari margin distribut initi popul differ equat obtain equat select denot varianc popul denot select intens obtain differ equat differ equat differenti equat deriv solut sin equat complet describ dynam complet show select truncat threshold select intens tabl tabl select intens comput gen number gener converg converg achiev averag fit popul equal fit gen obtain set gen gen depend size size popul truncat threshold result expect fda behav truncat select ffl gen ffl gen conjectur statist properti confirm conjectur valid popul size larger critic popul size defin minim popul size find optimum high determin critic popul size difficult succe analyt formula numer result test conjectur number gener equilibrium function function set valu function order ident set valu theori expect result gen equal gen smaller fda main altern rest gen ga tabl gener truncat threshold result tabl confirm predict note equat predict gen obtain actual simul fda ga genet algorithm truncat select uniform crossov slightli gener mention function genet algorithm gener knowledg turn fit function test suit denot number bit turn dec defin dec dec defin separ decept function order dec factor distribut function separ function function function defin function function chain interact structur variabl set function difficult optim global optimum optimum trigger optimum function function factor numer comparison separ function system ij ij sum spatial neighbor ij factor grid spin sequenti number till js js distribut variabl variabl left side condit sign grid interact cover factor class model exact solut comput comput fairli difficult free boundari problem tabl numer result order shorten comput run stop occurr individu maximum number gener gen gener count stop result gen depend great differ fit function larg differ separ number variabl consid separ function initi margin probabl speed converg function equat obtain good predict gen gen fda fda ga fda fda fda gat fda fda fda gat fda fda gat tabl numer truncat threshold gen remain constant popul size larger critic popul size shown entri tabl model complex optim problem reflect popul difficult greater popul size model small popul critic popul size larg function critic popul size dramat expect comparison note result genet algorithm ga uniform crossov truncat select genet algorithm solv separ function difficult function solut model surprisingli simpl ga found optimum run case fda outperform genet algorithm qualiti solut obtain number function evalu obtain optimum factor distribut algorithm fda extens separ adf separ function behav function multipl allel select deriv differ equat margin frequenc truncat select confirm numer number gener converg estim equat deriv simpl linear function percentag initi popul gener gen smaller shown fda effici separ adf factor condit probabl differ converg speed optim separ separ function difficulti optim problem reflect popul size obtain optimum give impress fda prefer genet algorithm simplest fda implement set function solv surprisingli larg fda function complex gene interact structur success fda critic depend correct probabl model problem constraint optim problem discuss muhlenbein al refer le ja inequ applic statist estim probabilist function markov process model ecolog bull math genet theori natur select de genet algorithm optim machin learn adapt natur artifici system press scienc breed applic genet algorithm evolutionari equat select predict evolutionari distribut graphic model evolutionari optim submit
HCI/481 4 ieee transact control system technolog control law design haptic interfac virtual realiti richard member blake member ieee abstract goal control law design haptic displai provid safe stabl user interfac maxim kinesthet virtual environ paper outlin control design approach stabil haptic interfac coupl broad class human oper virtual environ absolut stabil criteria develop explicit control law design bound haptic displai displai displai strength weak approach illustr numer result devic highlight abil design procedur handl difficult problem control law synthesi includ structur flexibl sensor actuat author depart electr engin box wa author submit ieee transact control system technolog introduct word haptic mean relat haptic feedback unexplor convei inform human comput video monitor visual speaker provid audio analog haptic displai convei kinesthet inform oper touch haptic displai gener forc feedback cue repres resist virtual rough virtual weight virtual mass haptic devic shape rang larg industri manipul motor desktop mice field haptic led research applic excit work surgeri simul goal permit student surgeon safe practic procedur haptic graphic interfac accur reflect real surgic condit area forc feedback design design touch object haptic greatli effici creativ rapidli evolv side haptic consum product consum haptic devic forc feedback joystick comput game accept standard applic program interfac number forc feedback enabl comput game forc feedback steer advent forc feedback forc feedback enabl graphic user interfac eventu bring haptic technolog major comput desktop virtual build block system haptic develop washington laboratori demonstr util haptic technolog cad virtual prototyp applic system excalibur submit ieee transact control system technolog forc displai built haptic technolog wa fig illustr simul user select manipul individu block group block haptic feedback repres prevent object render interact forc block fig excalibur virtual build block simul haptic interact mode interfac haptic flow devic comput comput devic haptic displai render forc effect devic creat forc input devic feedback potenti instabl exist instabl degrad qualiti forc feedback inform human oper case devic inertia forc consequ instabl sever field control haptic displai offer interest challeng control conflict perform stabil good submit ieee transact control system technolog perform impli forc veloc experienc human oper ident gener applic softwar haptic interfac perform haptic displai limit extrem simul free motion extrem gener rigid constraint minimum maximum achiev haptic interfac delin measur haptic perform inabl render arbitrarili small larg human oper onset instabl stabil haptic interfac strongli affect applic softwar natur devic contact applic refer determin forc render haptic displai human oper applic call unachiev level creat excess rigid virtual haptic displai oscil violent manner human oper contact haptic displai affect stabil system improperli design instabl ensu oper grasp devic tightli oscil occur devic earli applic haptic distinct made virtual environ control law haptic devic virtual environ control system stiff damp virtual wall feedback gain devic posit exampl found approach major drawback difficult ensur complex dynam virtual environ translat stabil control law haptic devic applic softwar tune test stabil exist virtual environ tune specif applic softwar submit ieee transact control system technolog redesign haptic displai haptic enabl cad packag work properli forc feedback induc instabl link slightli mechan damp improv approach control law design haptic displai separ problem devic control design applic softwar artifici coupl haptic displai virtual environ al salisburi suggest similar approach coupl haptic devic virtual environ virtual adam put problem stabl haptic simul framework approach rigor stabil perform analysi gener class haptic displai virtual coupl design devic structur forc sensor measur delai paper build theoret work present review framework analysi design haptic interfac introduct develop previou result reduc techniqu restrict assum human oper realist level model excalibur forc displai numer data provid critic design point work extend permit regul virtual coupl design broader class haptic displai haptic displai implement numer excalibur strong agreement theoret result highlight util framework haptic interfac analysi design submit ieee transact control system technolog ii framework stabil control method root linear circuit effect load condit termin electr network mechan analog electr haptic subject variabl load condit point interact human oper point interact virtual environ mechan substitut veloc current repres flow forc voltag repres effort haptic interfac model exchang energi human oper virtual environ studi stabil system describ perform haptic interfac fig show network model haptic simul human oper affect physic point contact haptic displai virtual environ modul ve fe point inform exchang haptic interfac virtual environ digit system star superscript variabl defin time sampl human oper haptic interfac fig network model haptic simul analysi design haptic interest matrix matrix map input output matrix haptic interfac virtual environ wai form matrix ve fe passiv absolut stabl passiv submit ieee transact control system technolog hybrid altern hybrid form form algebra combin element provid matric exist matric posit true detail found haptic simul stabl human oper virtual environ result characterist equat root half simpl root imaginari axi priori knowledg level human virtual environ haptic simul remain stabl variat notion handl issu robust absolut stabil linear absolut stabl exist set passiv termin system unstabl haptic interfac made absolut haptic simul remain stabl long human oper virtual environ passiv stabil criteria provid suffici condit absolut stabil linear pole half simpl pole imaginari inequ impli satisfact criteria matrix form suffici hold demonstr haptic interfac satisfi stabil submit ieee transact control system technolog system level passiv human oper virtual environ treat energet interact human arm mechan devic passiv reason assumpt found neural feedback arm high adapt exert human passiv requir virtual environ act passiv oper challeng intuit simul physic motiv effect obei conserv law passiv formul numer integr routin achiev strict adher law difficult brown show explicit passiv integr equat motion imposs experi demonstr absolut stabl haptic interfac robust coupl virtual environ passiv haptic repres human oper arbitrari passiv overli conserv arbitrari passiv extrem case human perfectli rigid human grasp haptic displai mechan difficult achiev level perform maintain absolut stabil case assum minimum level min provid human contact devic strategi coupl form switch system unstabl oper break contact haptic devic haptic displai implement includ forc stabil analysi domin unrealist scenario infinit high human stiff submit ieee transact control system technolog postul maximum level max human oper fig show analysi model modifi includ minimum maximum level human vh fh haptic interfac human oper passiv absolut stabl fig human oper model human oper term arbitrari passiv min notic result human min infinit result human iii excalibur model excalibur cartesian design act haptic interfac virtual remot environ motor provid control forc steel cabl transmiss mutual orthogon translat ax user grasp handl mount end effector shown fig devic capabl render peak forc continu forc axi workspac mm dynam manipul function orient handl workspac ax motion consid restrict attent design point excalibur success design condit yield control law satisfi stabil criteria orient ax point repres motion handl ve virtual environ passiv submit ieee transact control system technolog neighborhood mm mm measur bottom posit fig detail excalibur model found intern dynam system repres stiff matric control distribut matrix vector repres intern state system input forc appli handl human oper forc gener actuat output interest veloc veloc strain gaug vh va final element analog integr load cell manufactur reduct output filter measur forc equat govern dynam system written laplac vh cv ms ds va ms ds submit ieee transact control system technolog numer valu relev paramet provid appendix equat motion altern written term individu transfer function vh va note subscript attach transfer function match subscript output variabl subscript match input variabl iv haptic interfac design haptic interfac mechan devic encompass human oper virtual environ understand stabil properti separ haptic interfac cascad combin network haptic displai virtual coupl shown fig haptic displai implement haptic displai fig haptic interfac haptic displai includ physic structur vc haptic interfac analog digit control softwar haptic displai access virtual coupl ve submit ieee transact control system technolog end physic human oper exchang energi displai end inform discret unlik physic specif causal inform port possibl haptic displai motion displai forc displai case output input case input output individu class type haptic number implement common displai forc address straightforward follow exampl perform design analysi implement displai common implement haptic displai optic encod provid measur devic point actuat signal sampl period creat digit xa devic veloc case simpl differ gener output digit forc pass hold provid control input actuat fig show displai implement submit ieee transact control system technolog fig displai implement equat haptic displai deriv fig haptic devic includ integr devic veloc hold xa laplac transform digit signal xa xa xa sk ω π sampl period paper assum ω π place signal sampl haptic devic reason assumpt system low pass properti lower transfer function va xa xa st hold haptic displai differ vc xa xa ω π submit ieee transact control system technolog appli vh xa st ha aa final step includ differ veloc give equat type haptic displai matrix vc hh ha ah aa hh ch cc effect implement strategi numer research disadvantag approach made open loop devic move free human oper full inertia friction manipul highli accept devic inertia friction altern implement desir displai presenc high level inertia common industri make displai implement impract altern configur devic submit ieee transact control system technolog displai implement number applic concern fig show block diagram displai fig displai implement close posit control st find displai equat altern hybrid st st st aa aa st ah st aa aa hh ch vc st st vc posit regul determin maximum render st type haptic displai order simul rigid virtual design highest gain violat stabil constraint virtual coupl implement haptic devic va xa half haptic shown fig virtual coupl artifici link haptic displai virtual environ virtual coupl st fa hold fm haptic displai xc rectangular integr vc fc submit ieee transact control system technolog network addit control design haptic interfac absolut stabl gener function limit choic network specif explicit design criteria coupl function found singl ci ci ci displai virtual coupl induc limit maximum render act virtual environ haptic displai virtual environ drive system unstabl gener excess rigid constraint magnitud larg maintain absolut stabil haptic interfac limit virtual coupl consist singl seri mc bc zc ca virtual environ simul small limit haptic displai render displai virtual coupl act depend provid requir level system remain stabl small permit unconstrain free meet requir absolut stabil detail motiv virtual coupl found actual implement virtual coupl network dictat type haptic displai virtual environ simul virtual coupl submit ieee transact control system technolog match causal haptic displai displai coupl accept gener true coupl connect displai end virtual coupl match causal virtual environ virtual environ act virtual coupl implement shown fig vc fc environ environ vc fc environ environ design absolut stabil displai basic fe ve fe fig virtual coupl implement combin displai implement virtual coupl fig matrix combin haptic interfac vc vc fc zc fc zc fe ve fe submit ieee transact control system technolog hc st note invari choic virtual environ causal analysi design result follow differ li implement virtual coupl appli condit absolut stabil haptic hh st zc transfer function forc appli handl veloc handl forc actuat mechan devic inher open loop function posit real satisfi inequ rewritten explicit express separ unknown quantiti coupl quantiti displai zc st hc ch hc ch virtual coupl design equat hand side real valu function plot frequenc ω π achiev absolut stabl haptic virtual coupl real part function exce lower bound form plot maxim maxim virtual coupl optimum solut achiev select spring ci ci minim differ left hand side submit ieee transact control system technolog constraint inequ satisfi valu found perform rapid numer search displai cascad combin displai singl seri virtual coupl altern hybrid form haptic interfac st zc ve absolut stabil equat case zc st hc ch hc ch control design step displai st posit chosen posit real function handl regul devic behav passiv virtual environ veloc turn develop design regul haptic interfac equat rewritten altern hybrid form concern upper left st ha st zc aa ve hh submit ieee transact control system technolog notic make st st zc upper left term st find zc satisfi defin regul upper left term posit real displai virtual coupl posit regul satisfi st st zc kc bc displai virtual coupl chosen satisfi entail plot side ca graph left side exce curv ω π optim perform minim virtual coupl paramet select minim differ left side constrain inequ satisfi impact human model stabil condit assum human arm bound stiff damp valu consist previou work measur author limit minimum impart min limit maximum human oper includ stabil analysi simpli replac equat hh hh max max submit ieee transact control system technolog numer result control law design excalibur haptic displai implement detail focu numer design result regul virtual coupl implement softwar test excalibur part virtual build block system environ virtual coupl implement shown fig displai find virtual coupl form absolut stabil haptic interfac lower bound form side shown dash line fig haptic interfac equat modifi includ human oper result design bound shown thin solid line fig frequenc differ differ result control design design optim virtual coupl ci ci found left side result plot fig bold line submit ieee transact control system technolog displai human model hz line overlap human model fig displai virtual coupl design step control law design displai implement accomplish found displai virtual coupl paramet posit regul st st step find virtual coupl absolut stabil fig show lower bound real part virtual coupl dash line bound calcul human model thin solid line show bound modifi includ limit maximum human virtual coupl design dramat affect introduct human model induc unreason level human interact drive requir virtual coupl excess level virtual coupl design human model repres st bold line fig virtual coupl paramet defin ca submit ieee transact control system technolog bc kg note posit regul repres control gain turn reduc virtual coupl regul gain virtual coupl explor paper result human model human model hz fig displai virtual coupl design control law haptic displai implement test system simul fall class type virtual environ virtual world consist cursor fifti build block virtual coupl connect haptic displai cursor cursor move insid block button devic connect virtual coupl select block collid block block virtual posit constrain lie surfac obstruct block vertic mate align knob overcom friction equat motion integr euler veloc approxim trapezoid posit estim note submit ieee transact control system technolog brown explicit integr routin virtual environ strictli satisfi passiv implic simul small mass maintain stabl numer integr equat motion cursor block mass kg control design provid stabl haptic simul term stabl impli detect diverg oscil combin virtual environ state human oper grasp import virtual environ state free constrain block human oper grasp condit relax tight grip arm fulli extend condit correspond human maximum grasp control paramet tune find valu make system margin stabl tabl show deriv gain theoret counterpart displai virtual damp held constant stiff instabl detect occur augment virtual oper combin displai virtual coupl found reduc mass hold constant theoret damp posit regul gain instabl occur combin grasp mass reduc number factor account differ theoret result theoret control law base linear model excalibur discrep model true behavior lead design error addit error linear nonlinear account design effect motor submit ieee transact control system technolog cog torqu transmiss cabl slack contribut differ experi attempt combin virtual environ grasp mean exhaust search port test miss true result optimist tabl theoret versu gain ci ci ca theoret perform comparison quantifi perform haptic interfac ultim goal human percept interfac act transpar window virtual environ virtual environ simul free free cursor motion human oper feel forc handl oper realiz handl virtual environ simul select build block handl quantifi haptic interfac perform notion rang rang delin minimum maximum haptic interfac render human oper haptic interfac absolut straightforward calcul ca submit ieee transact control system technolog bound realiz minimum simpli input human oper port virtual environ port fe maximum found virtual environ ve magnitud rang bound haptic displai implement consid paper shown fig thin line repres displai bold line show displai bound frequenc calcul design model theoret control law lower bound repres haptic interfac simpli system domin rigid bodi damp total inertia kg lower bound displai implement driven virtual coupl frequenc domin coupl mass kg oper greater inertia damp virtual environ simul free handl liter float workspac mass upper bound rang repres handl virtual environ simul infinit rigid constraint haptic interfac act ground displai effect spring seri combin virtual coupl stiff mechan submit ieee transact control system technolog stiff handl actuat effect spring constant displai seri combin posit stiff devic mechan stiff chose displai posit regul gain displai virtual coupl case ident upper bound kg hz hz kg origin design modifi displai fig rang haptic displai implement thin line bold line detail realiz haptic interfac implement absolut connect type virtual environ obviou question answer devic depend displai simplest implement forc sensor adapt difficult improv motion displai open loop devic devic submit ieee transact control system technolog lightweight implement displai implement implement devic high level friction high gear ratio abil tailor perform displai highlight fig reduc loop posit gain virtual coupl paramet reduc bc kg provid absolut stabil rang bound show improv kg degrad perform vi absolut stabil criteria develop design haptic interfac control law stabil wide rang human oper virtual environ approach demonstr design regul virtual coupl haptic displai displai displai numer result excalibur devic valid efficaci theoret method appendix design model excalibur defin term cf submit ieee transact control system technolog analog filter load cell output cv refer cv surgic train medicin meet virtual interfac virtual realiti base minim surgeri ieee int conf robot pp submit ieee transact control system technolog cj perform gui point task comput proc asm intern mechan engin congress pp rj haptic interact virtual doctor electr aug design framework kinesthet ieee tran robot vol pp je jm affect haptic ieee int conf robot lo pp fp issu forc comput vol pp je pe mc stiff virtual wall proc ieee virtual realiti annual int pp se td emul stiff wall static friction magnet tran journal dynam vol pp je mc jm haptic displai tool proc int conf intellig robot pp cb jk method haptic proc int conf intellig robot pp submit ieee transact control system technolog rj haptic interact virtual ieee transact robot vol pp sk analysi synthesi linear activ john wilei fb fundament properti transmiss proc vol pp proc ieee int conf robot pp jm implement simul haptic doctor mechan northwestern dec jm brown je implement simul haptic proc asm intern mechan engin congress pp rj mr perform haptic theori proc asm intern mechan engin congress pp feel manipul dynam virtual tran journal dynam vol pp jk phantom haptic devic probe virtual proc asm intern mechan engin congress pp submit ieee transact control system technolog rl develop interfac virtual proc ieee virtual realiti annual int lo pp cl gr jj wa simul virtual mechan haptic feedback industri robot proc ieee int conf robot pp geometr factor arm postur journal vol pp
HCI/482 4 case studi hand input design virtual environ interact abstract present discuss design issu involv hand input virtual environ hand input devic limit type interact user perform virtual world due natur devic approach allevi limit provid hybrid input devic enabl user combin inform gener hand input devic describ glove input devic tool augment glove object manipul menu select method test evalu hand postur gestur develop singl hand devic virtual graphic conduct flex input introduct number approach interact virtual environ approach attempt solv small interfac problem isol incorpor complet interfac solut head object select user natur select manipul object hand posit thumb imag desir object techniqu object user hold press button hand import reason interact techniqu solv small problem isol natur input devic individu special input devic work interact techniqu design difficulti map combin techniqu joseph jr robert zeleznik brown site nsf scienc technolog center comput graphic scientif visual po box ri usa appli techniqu due inflex glove report continu joint angl measur finger slow complic postur gestur recognit techniqu gener discret event trivial button press order flexibl input extend exist virtual environ interact creat robust virtual environ hybrid interfac interfac seamlessli combin input devic interact techniqu provid flexibl robust method interact virtual environ flex develop hybrid input devic combin continu joint angl measur discret button input improv number exist virtual environ interfac techniqu develop organ remaind paper organ manner section describ previou work relat flex descript compon design issu develop interfac hardwar describ number interfac techniqu flex input section provid area futur work previou work basic approach hand input virtual environ approach user physic attach comput approach devic devic extract inform hand extract type geometr data topolog data geometr data repres inform shape topolog data inform finger touch part hand approach difficult extract geometr topolog inform due problem comput vision focu approach type input devic develop measur finger joint detect electr contact finger tip glove fault isol glove good extract geometr inform enabl repres hand virtual environ mimic interfac widget slider method signal activ deactiv widget glove conjunct hand postur gestur difficult determin gestur begin end appli constraint user gestur glove provid seri button widget finger tip extract topolog data interact postur determin flex finger make difficult repres hand virtual environ attempt combin type inform type data glove except digit data entri glove develop specif enter text singl hand manual work combin discret continu hand input devic extract geometr topolog data simultan overview approach order develop interfac combin geometr topolog built hardwar prototyp system test evalu interfac design hardwar system number benefit emploi plug plai strategi quickli ad remov button widget compon system enabl user incorpor cloth sensor wearabl interfac conduct sensor provid import sensor contact sensor specif sensor natur cloth lend glove cloth prototyp construct devic base hardwar input function appendix provid descript electron compon build hardwar system glove cloth button button combin cloth button finger arbitrarili hand augment exist glove creat flex input figur figur flex input system glove interact techniqu ing flex input flex improv number exist techniqu select object virtual environ creat techniqu develop combin geometr topolog data major problem imag plane interact techniqu head sticki lift frame hand object select user activ select primari hand user requir separ input devic trigger select oper flex input simpl effect seamless method start stop object select place cloth button place user primari hand head place cloth button thumb middl finger user posit thumb object middl finger thumb contact signal object select button press signal object cloth contact posit middl finger palm base thumb side index finger left side middl finger similar cloth contact present combin placement cloth button devic worn cloth button shape size present clear advantag inflex input devic hand sticki finger lift palm techniqu start stop object select cloth contact hand frame hand select techniqu figur show head techniqu placement cloth contact middl finger figur user wear flex input devic invok head object select techniqu round tabl place middl index finger user activ select oper move tabl method select object virtual environ cast laser scene user hand select imag plane problem laser point difficult start stop select input devic laser point object select method point postur mechan select object virtual environ perform flex problem mechan order achiev robust user make postur extrem configur hand put undo strain thumb flex input allevi problem place cloth contact thumb side middl finger shown figur natur movement put strain thumb glove capabl analog slider glove report continu measur joint angl hand difficult determin user finger slider widget flex seamless transit discret event cloth contact continu updat bend sensor made mechan activ deactiv slider cycl argu user make postur ident hand configur flex input hand gestur postur recognit hardwar work mechan provid percent accuraci figur user point select desk virtual environ user make select press thumb side middl finger menu item finger button press creat menu button user cycl menu item flex extend finger user select button finger fulli extend fulli flex explor menu item user easili invok techniqu configur chang rotat paramet import benefit compon flex applic develop method test hand postur gestur develop test hand postur retrain gestur recognit time consum compon flex input develop quickli move cloth contact part hand chang softwar compon restart applic applic develop quickli test feel ergonom hand postur gestur abil move cloth contact creat hand interfac implement glove glove isol futur work number area futur work research determin hybrid interfac provid virtual environ interact method plan continu develop hybrid input devic explor give user perform virtual environ applic order extens user studi requir evalu cloth contact thumb left side proxim joint interact techniqu exist techniqu input devic interact techniqu develop tip iceberg import continu research appli interact virtual environ area work explor user prefer wearabl interfac solut solut comput interact approach problem occur typic user physic connect comput interfac function wireless input devic paper present case studi hand input design issu virtual environ interact flex input custom built hardwar prototyp develop button base input devic develop hybrid interfac augment devic produc continu input event flex improv exist virtual environ interact techniqu imag plane object select develop hand postur gestur develop devic gener pure geometr topolog data studi goal make approach power metaphor interact virtual environ acknowledg special timothi rowlei discuss hardwar design brian perkin provid electron christin invalu assist creat flex work support part nsf graphic visual intern busi advanc network sun appendix appendix inform design implement custom built hardwar quickli prototyp test hand input devic design implement electron microchip pic chosen primari mean interfac touch sensor rest system low cost simpl program chip made suitabl task provid serial commun pin touch sensor monitor extra glue logic output pin protect discharg resistor capacitor network driver chip step volt output pic line level contact possibl pair wire report separ driver report separ wire connect driver workstat infer contact wire contact microcontrol report touch issu touch issu touch issu driver softwar determin wire touch lower amount memori make softwar simpler faster part list part usag bit microcontrol built primari interfac chip resistor pull resistor resistor protect resistor capacitor protect capacitor convert volt pic output level electron pseudocod repres code pic electron box short possibl byte alloc repres statu timer determin short long transmit implement cut bounc problem algorithm pin set voltag check voltag statu increment set transmit statu refer js mj rc mr mine imag plane interact techniqu environ symposium interact human interfac select recogn intent hand gestur iast intern confer comput graphic electron corpor introduct virtual technolog cyberglov tm manual palo tg hand gestur interfac devic human factor comput system graphic tm glove system instal guid user mountain dj mj interfac object manipul virtual environ virtual dj zeltzer survei input ieee comput graphic dj hand input phd massachusett institut digit data entri glove interfac devic bell telephon murrai jersei patent number mann smart wearabl comput person volum issu jc nf kassel survei design issu spatial input acm symposium user interfac softwar jj jr multimod interfac framework hand gestur speech virtual environ applic lectur note artif gestur fel hinton adapt interfac human factor comput
HCI/483 4 constraint parallel process virtual realiti depart electr engin comput scienc tuft ma abstract introduc paradigm design implement distribut virtual realiti constraint program written framework execut multipl comput improv perform easi specif implement interfac hide network aspect messag pass machin distribut environ perform network optim user understand parallel distribut program serial version user interfac descript languag parallel comput perform modifi interfac descript introduct develop softwar model user interfac descript languag program interact behavior virtual realiti interfac introduc languag element essenti set constraint dataflow graph chose express power suitabl describ continu interact found constraint view introduc perform penalti compar convent approach improv perform interact formal separ concern desir interact behavior implement mechan user interfac design concentr express underli runtim system perform discret robert jk jacob depart electr engin comput scienc tuft ma parallel execut level paper introduc link variabl program interact execut design singl set distribut machin updat variabl execut parallel perform improv framework write vr program transform exist program address issu perform provid util run time tune network manag simpl manner background graphic user interfac toolkit base paradigm implement tradit wimp interfac accept tool suit interact style virtual realiti fundament characterist interfac common gener class emerg includ type music accompani intellig agent interact entertain ey ubiquit comput share higher interact previou continu exchang occur discret event dialogu interact techniqu reli continu interact introduc higher cleaner user interfac descript languag perform constraint view effect express ineffici highperform applic virtual realiti declar constraint specif procedur program freedom implement sophist manag execut time separ concern user interfac design tailor speed element user interfac maxim subject interact comput resourc separ user interfac constraint specif design describ ideal desir behavior infinit comput resourc singl calcul constraint parallel comput advantag multipl comput improv perform framework execut vr applic environ specif languag base specif languag model describ program aspect vr interact identifi basic structur syntax interact user posit essenc sequenc interact wimp interfac set continu temporari virtual user object hand object posit relat continu function ident map user grasp object lead model user interact part graph function relationship continu constraint relationship typic activ moment part set discret event handler specif continu relationship activ deactiv softwar system base interact design provid fundament treatment natur continu phenomena time motion handl discret event discret event mechan commun continu discret detail exampl power system base continu time observ continu portion formal set constraint constraint element develop virtual realiti user interfac express power benefit separ program desir behavior program implement hook address vr perform issu user simpli declar specif desir relationship turn underli system updat constraint freedom manag comput time wai achiev good interact explicit effort part writer constraint constraint solver free handl task sequenti approxim desir behavior depend cpu time frame continu time consist object element defin relationship variabl entir set element connect form graph end graph propag end interact conceptu continu encod directli applic deal track event conceptu continu devic exampl conceptu continu interact drink cup virtual throw ball virtual drive car virtual citi interfac meet sever perform requir order maintain perceptu virtual requir drive forc design current implement found constraint gave flexibl manipul parallel process fly improv interact system system san constraint solver constraint graph distribut faster time support virtual environ lazi evalu algorithm base optim algorithm hudson system add featur design specif requir vr interfac design rapidli updat user input consequ reason discard input favor respond latest input input fairli behav gener limb movement continu time handl variabl link variabl object store valu link input output invari data flow graph element serv continu data repositori variabl directli connect input applic semant commun user interfac model hold intermedi result link calcul link object function attach end variabl link input variabl place result calcul variabl bodi link specifi attach variabl relat link enabl disabl user input link link part constraint network enabl disabl quickli chang constraint network fly flag set clear link enabl disabl abil enabl disabl portion graph user input kei featur model link multipl output multipl input link read input variabl perform complex function eventu gener token event handler gestur recognit ey track applic user object object select develop applic user object virtual world object select bright object proport time object reach bright object select user manipul singl variabl input output multipl link condit provid enabl disabl group link enabl disabl link individu figur link variabl figur show variabl circl link rectangl link enabl default constraint graph draw cross circl top link disabl graph read left variabl input link variabl output variabl disabl link delet network disabl link part data structur enabl attach variabl relationship termin temporarili enabl programm specifi input output variabl link repres graph defin output variabl affect chang input variabl automat gener depend graph output relev input variabl found search enabl increment constraint algorithm work effici start request variabl work backward chang start evalu link topolog discret time interact fundament discret compon exampl includ button menu choic gestur recognit verif result enabl disabl constraint applic gener deal discret input event retract exist constraint assert similar mechan handl discret time event object captur token respond read hardwar input event window system sourc turn token send event handler event handler bodi describ token applic send token event event handler interest token execut bodi includ set make custom procedur enabl disabl link event handler recogn state state provid servic depend state factori move object assembl event handler state diagram figur commun event handler continu time subsystem enabl disabl start enabl intersect disabl button intersect press intersect follow hand button disabl enabl figur state diagram event handler hand intersect move event handler receiv token object event handler transit state user press event handler receiv token transit enabl link disabl link relat object movement hand button event handler receiv token transit disabl link enabl link relationship termin detail state diagram notat found parallel process major difficulti parallel process transform program written sequenti machin execut multipl machin parallel program written initi written execut singl machin sequenti program execut parallel multipl workstat sourc code differ parallel serial version librari compil execut compil parallel compil gener coordin machin read input devic render worker machin constraint calcul coordin workstat displai devic input polhemu ey tracker read data input devic render graphic worker calcul base request coordin approach parallel worker coordin exact copi constraint graph worker execut constraint solver variabl initi phase coordin partit graph request variabl worker coordin assign individu worker coordin partit graph relat variabl form group variabl request specif variabl coordin worker graph approach parallel distribut calcul machin affect correct machin maintain entir affect speed coordin execut algorithm partit graph find number variabl variabl depend variabl worker shown foreach variabl int worker foreach variabl mod coordin complet copi constraint graph execut constraint enabl bring critic variabl comput involv variabl control posit orient head hand updat quickli maintain coordin asynchron send larg reduc network overhead messag multipl request enabl disabl set variabl request updat variabl worker repli coordin request updat variabl similar batch multipl result larg messag commun worker multipl user constraint graph distribut coordin request variabl worker set valu variabl simpl matter add addit coordin support interfac ad coordin simpli requir number addit coordin configur file run addit coordin execut origin coordin execut issu design interfac main issu describ handl input write user interfac descript involv mice hand tracker assum attach devic posit repres posit virtual hand space coordin coordin set variabl result multipl coordin manipul singl virtual hand interfac requir design interact interfac user plai asymmetr role interact configur applic layer identif number physic devic attach machin devic automat translat devic origin id applic layer identif yield devic link attach input devic duplic handl interfac user environ control head hand user particip simul applic identif number programm write program assign role user develop applic user manipul object user object press keyboard role user grab object applic develop demonstr strength weak virtual park applic develop test perform demonstr flexibl effici virtual park consist object slider control orbit arm control direct entiti plai virtual ball humanoid avoid close hit virtual ball travel park depend forc end final ground graviti pull grab object includ humanoid ball user grab toss ball humanoid interact behavior base complex function account locat ag magnet magnet strength snapshot virtual park shown figur part constrain graph shown figur space show ball object humanoid humanoid assign singl task singl worker ball figur virtual park humanoid worker worker worker figur constraint graph virtual park perform measur final task evalu quantit measur perform improv parallel initi measur suggest convent measur evalu parallel process system vr tabl show worker throughput system frame rate throughput due parallel comput perform multipl frame rate due fact implement top tcp coordin send multicast worker simul multicast support tcp simul coordin spend time send request worker time render displai measur number evalu link humanoid frame figur time humanoid brought date number tabl number frame worker evalu rate total work accur captur interact perform vr user interfac system great deal process gener displai late score tradit parallel process user total throughput total latenc displai video frame measur perform frame oldest piec data gener frame conjunct frame captur interact perform vr user interfac total process throughput frame latenc show valid late inform time coordin render displai perform track messag network messag latenc show long messag spend network worker back coordin time requir worker evalu instrument coordin timestamp request send worker worker timestamp request time run constraint solver bring variabl coordin receiv calcul time request minu time worker bring variabl messag latenc measur time request spent network show accur render frame visual valid frame statist clock skew request request minimum time request output variabl subtract current time skew describ worst differ render user figur plot show addit perform latenc figur worst frame latenc observ speedup made assumpt restrict process sequenc experi demonstr introduc declar user interfac descript languag provid extra freedom underli implement perform languag made perform obtain parallel process relat work frame number continu model similar graph set constraint actual input output draw research constraint system model abil graph dialogu research constraint graphic interfac languag motiv wimp explicitli support temporari constraint introduc time manag techniqu constraint applic system constraint model describ interact graphic constraint effect graphic anim interfac gleicher constraint turn event recent work interfac continu approach approach softwar architectur virtual realiti interfac develop feiner colleagu pausch colleagu green colleagu develop toolkit build virtual realiti system work concentr architectur toolkit user interfac descript languag address interfac virtual realiti concurr dialogu parallel virtual machin pvm softwar system util heterogen network parallel serial comput singl comput resourc pass interfac standard specif design write distribut memori parallel process util main differ parallel system task extern similar task alloc compil appreci overhead task manag task alloc coordin request variabl worker queri coordin send worker worker execut multipl queri parallel task unlik pvm design support applic develop ad user add coordin mean worker serv request coordin make worker work consum load network messag differ concern perform requir design primarili virtual realiti applic requir high frame rate distribut applic framework comput constraint number time factor account evalu time constraint interact requir coordin coordin worker commun coordin worker respond coordin continu sampl data input devic sampl data worker process immedi worker send process data back coordin request oper perform time constraint design provid specif languag execut environ parallel execut interfac declar program execut distribut environ speed code modif easi specif function simpl pattern engin perform optim network control hide network aspect messag pass machin distribut environ programm understand distribut parallel system emploi familiar serial introduc measur vr user interfac perform total throughput defin perform latenc data frame experi demonstr introduc declar provid extra freedom underli implement perform constraint languag made perform obtain parallel process refer specif paradigm design implement doctor tuft gm valid approach achiev larg scale comput capabl afip confer vol apr afip pp design implement constraint imper program proc ieee comput societi intern confer comput pp april vander ba da pointer variabl constraint acm transact vol pp june ba myer garnet toolkit refer support highli graphic user interfac tech report carnegi mellon comput scienc mar ba da rb vander ds support interact user ieee vol pp novemb kenneth jerom sequenti parallel pw publish high level framework anim graphic proc acm pp simul virtual realiti mr acm transact inform vol pp chri rout refer ted parallel public user comm vol pp april high perform toolkit proc acm pp jb dt structur virtual proc acm human factor comput system pp jeffrei steve ross john wilei specif paradigm design distribut vr applic singl multipl doctor tuft ld js dc fp exploratori molecular visual system interact proc acm pp rapid prototyp system build virtual adjunct acm human factor comput system vol pp graphic toolkit base differenti proc acm symposium user interfac softwar pp green architectur metaphor user comput vol pp juli proc acm pp mp rc jf architectur extens interfac proc acm symposium user interfac softwar pp marina del mpi messag pass interfac forum interfac intern journal supercomput applic high perform peter parallel morgan kaufman rendezv constraint mainten proc acm symposium user interfac softwar pp sl jf rendezv architectur languag construct acm transact vol pp june state transit diagram languag visual ieee vol pp visual languag user proc ieee symposium visual pp ieee comput societi interact advanc vol ed hr hartson pp ablex publish formal specif design commun vol pp reprint softwar specif ed gehani ad pp softwar model specif languag user acm transact vol pp hudson system compil constraint technic georgia tech usabl se specif flexibl user interfac proc acm symposium user interfac softwar pp se attribut flexibl algorithm lazi acm transact program languag vol pp juli sk feiner cm metaphor explor virtual proc acm symposium user interfac softwar pp sl visual languag imag journal visual languag vol pp june paul time object orient john wilei framework parallel distribut practic pp singhal michael virtual acm york ny
DB/484 3 busi process qualiti except prevent daniela inria campu bp le franc abstract busi process autom technolog increasingli compani improv effici intern process offer custom order satisfi custom busi process execut high predict qualiti crucial organ meet servic level agreement stipul custom earli risk miss order set expect correct action paper focu critic issu busi process predict prevent occurr deviat desir accept behavior problem base data wareh mine techniqu describ architectur implement tool suit enabl except prevent show result obtain tool suit analyz intern hp process introduct motiv process manag technolog increasingli tradit permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb fabio shan hp lab page mill road palo usa order improv qualiti effici administr product manag ecommerc rapidli reliabl deliv servic busi individu custom order attract retain custom busi organ provid servic execut predict qualiti process autom busi process correctli execut support system meet workload process resourc perform work item time fashion paper focu critic issu busi process reduc occurr except term except mean workflow process autom commun defin except deviat process execut prevent deliveri servic desir qualiti notion process design administr state problem address avoid delai complet order fulfil process escal complaint manag custom care process typic exampl except case compani meet servic level case servic deliv accept qualiti custom point higher oper unaccept qualiti servic provid perspect concern extern qualiti perceiv consum term faster intern qualiti perceiv servic provid term lower oper paper present tool suit support organ prevent except except analysi user determin except analysi show delai suppli chain process occur specif supplier involv understand except busi manag identifi requir avoid futur occurr except compani decid remov supplier list tool suit dynam predict occurr except process instanti progress refin predict process execut proce inform except predict set expect process execut qualiti user applic action order prevent occurr except tool predict process instanc high probabl miss process instanc prioriti import process potenti damag miss order inform resourc work item process instanc execut approach base appli data mine data wareh techniqu process execut log busi process autom system call workflow manag simpli record import event occur process includ start complet time input output resourc execut failur occur activ process execut clean aggreg workflow log analyz data mine extract knowledg circumst except occur inform explain occurr predict futur occurr run process instanc work part larger research effort aim develop busi intellig techniqu tool busi process optim exampl challeng problem address methodolog includ process definit intellig assign activ automat identif system requir base workload predict remaind paper refer research area busi process short appeal busi develop solut present technic main issu face identif technolog support composit technolog architectur prerequisit process data analysi avail process data mainten complex discuss goal design develop tool suit solut applic condit capabl meet wide set requir decid initi focu issu relat contribut complex test assumpt applic approach specif problem prevent except present addit notion versu process execut vari depend busi analyz predict broad rang situat user interest determin except analyz predict identifi data mine techniqu process attribut provid input data mine algorithm problem except predict ideal make predict process execut stage build predict model tailor process execut stage paper detail discuss address describ techniqu tool except prevent relat work approach except analysi predict base data wareh data mine gener contribut area prior art exist field except limit estim deadlin expir base simpl statist techniqu summar underlin main differ approach paper contribut process time manag provid build work system domain author address problem predict earli process instanc meet order escal problem action process activ process maximum assign process design base activ estim execut time meet process deadlin maximum durat process escal activ execut faster maximum slack time dynam adjust maximum durat subsequ activ activ slack part proport estim execut time cost escal deadlin expir author present techniqu deadlin monitor manag process definit includ specif expect durat activ durat defin design determin base past execut design defin deadlin activ process deadlin latest complet time activ defin interv process instanc start time process translat diagram base expect activ durat defin earliest point time activ finish latest point time finish satisfi deadlin constraint execut process current time expect durat calcul latest end progress process instanc assess respect deadlin inform alert process administr risk miss deadlin inform user urgenc activ approach differ present aim predict kind deadlin expir build predict model leverag data wareh data mine enabl accur base characterist process data dai week process activ approach present paper except user understand remov except differ respect paper present architectur implement tool suit except analysi illustr result approach tool suit extend provid function mention work hwang al deal except analysi process execut log goal author support user handl except occur except handl suggest provid user inform similar situat handl previou execut goal aim analyz except understand predict prevent handl process model process execut log hundr commerci research prototyp system process model log share basic concept section present process model execut log structur hp process wfm top built prototyp conduct experi paper concept techniqu applic virtual wfm process direct kind work node repres invoc activ call assign execut human autom resourc rout node point rout execut flow node base rout rule start node denot entri point process complet node denot termin point arc graph denot execut depend work node execut output arc node connect arc activ arc output rout node fire base evalu rout rule figur show approv refer paper present result simplifi version actual process hp request approv kind process start specifi clerk manag evalu request email request confirm start process process loop list select clerk approv reject result notifi request work node servic defin logic select resourc resourc invok execut work servic defin process data item pass resourc invoc receiv resourc complet work work node servic descript node notifi request notifi request notifi final figur servic descript execut resourc initi notifi request initi approv join approv notifi approv work approv check approv statu notifi final work node schedul wfm read servic execut resourc select rule servic put work item perform resourc worklist resourc period connect pick work item assign group member execut detail process model provid introduct gener provid log inform process execut audit log typic store relat dbm audit log includ inform process instanc activ complet current execut user start process servic instanc activ complet current execut resourc execut node context servic data modif data item time complet detail descript audit log schema provid architectur section present architectur tool introduc environ work paper develop suit process definit execut monitor optim mom data period extract wfm log load load script design support analysi process execut data possibl heterogen sourc process execut data compon provid wide rang report function mi sing commerci detail discuss provid engin execut data mine algorithm data order understand specif execut path process figur approv process meet servic level agreement gener predict inform predict behavior perform process wfm optim workflow engin workflow engin simul monitor optim manag workflow audit log workflow audit log sourc consol etl aggreg predict model process definit execut data commerci tool figur architectur solut engin engin store extract inform easili effici access consol extern olap report tool mom access inform live inform run process instanc store wfm log make predict dynam optim process instanc execut mom configur prioriti process instanc high probabl instanc finish time mom alert process administr foreseen critic situat except analysi section describ approach support busi user understand except begin section present notion provid overview approach except dive detail descript implement illustr result obtain appli tool suit analyz except hp intern process notion except approach agnost except user free state event situat analyz except defin condit process execut data condit hold process instanc label affect except wide rang except type instanc slowest node execut user configur analyz specif except specif process analyz instanc approv process dai refer except present access process instanc check label select instanc affect except user monitor except behavior includ add except type defin condit detail definit implement except behavior provid except analysi overview except analysi perform appli data mine techniqu process definit execut collect treat problem classif problem classif applic input label train data set form relat row describ object custom custom manag class object belong classifi produc set classif map condit object attribut mean object attribut satisfi condit belong class classif rule identifi characterist object term valu object attribut classifi discov classif custom virginia yearli salari classif classifi inform rule probabl classif perform rule correct except analysi problem map classif process instanc belong class interest find relationship classif rule identifi characterist process instanc characterist user understand address approach analyz instanc process affect specif except phase process data prepar phase select process instanc attribut includ part input data set analyz classifi relev attribut includ valu process data item stage process instanc resourc execut activ process durat number time node execut attribut interest data structur relat creat popul process instanc execut data except analysi prepar phase join singl view inform gener previou phase except label inform instanc except comput except definit time mine phase appli classif algorithm data gener data prepar phase interpret analyst interpret classif rule understand identifi problem ineffici address remov iter mine interpret phase order identifi interest effect classif rule mine phase gener classif rule classifi process instanc base attribut interest specif case consid classif rule identifi correl process instanc durat deadlin expir except obviou interest correl analyst repeat mine phase remov process instanc durat attribut consid gener classif classifi focu attribut futur version applic plan make process data prepar phase select attribut base kind except analyz current process data prepar phase anticip difficult problem iter detail implement section detail approach except analysi present built top oracl tool suit written sql except analysi modul part engin compon figur phase data challeng classif applic typic requir input data resid relat tupl describ specif object analyz except affect instanc prepar tabl process analysi includ row process column correspond process instanc attribut addit column store label inform unlik tradit classif inform singl object scatter multipl tabl multipl row relat instanc face problem defin suitabl process analysi tabl popul collect process instanc data instanc attribut problem node activ number time instanc number activ unknown identifi interest node execut attribut includ process analysi node execut repres issu address decid node activ multipl analysi specif node execut altern approach consist node execut process analysi tabl number column proport maximum number execut determin process instanc data fact techniqu inform mine necessarili give result tabl gener typic includ undefin number node activ greatli differ instanc instanc commerci data mine tool suitabl manag tabl classif base larg number similar attribut null difficult interpret understand result approach heavi approach consist insert attribut set node execut multipl repres execut repres execut node due experi conduct execut node process higher correl kind process relat process execut time execut subgraph process observ number process instanc attribut interest gener unlimit except relat ratio durat node sum numer data item implement configur tool select attribut shown higher correl except test perform process analysi tabl includ attribut process activ complet correspond multipl timestamp hour dai addit holidai flag denot process instanti holidai data initi valu process data length item resourc start process instanc process instanc durat process analysi tabl includ attribut node process set attribut includ node execut multipl discuss activ complet timestamp process instanc data valu node output length item resourc execut node final state node complet node durat number activ node process instanc attribut includ attribut set process analysi tabl automat built process analysi prepar script script process analyz input retriev process definit inform script identifi node data item part creat process analysi tabl script popul tabl process instanc data user restrict process analysi tabl data instanc start time interv except analysi prepar phase implement code receiv paramet process except gener view view join process analysi tabl tabl list instanc affect except provid data set includ process instanc attribut label inform obtain view includ inform requir classif tool gener classif rule mine phase perform algorithm techniqu varieti data mine classif applic market develop mine expect commerci tool preliminari version tool suit typic tree except analysi tree wide work larg data larg number data continu easi understand simplifi interpret phase object classifi start root evalu branch condit base object leaf node reach repres partit leaf node reach leaf tree identifi class path root leaf identifi set condit identifi classif rule leaf node indic rule probabl object identifi characterist belong class tree build algorithm aim identifi leaf node classif rule accur tree gener mine analyst focu leaf node classifi instanc except tree root identifi attribut attribut valu lead leaf identifi characterist instanc result appli approach toolkit analyz administr process electron request process implement top hp process access hundr dai repres discuss result obtain analyz approv process figur specif identifi characterist instanc dai complet averag execut time access month process execut approxim process instanc instanc affect import process instanc data defin ran script previou section label instanc gener except analysi tabl sa miner lead commerci data mine gener tree prepar tree split proport correctli classifi record assess record train data record valid paramet gave result led restructur schema prepar script earlier tool final produc interest result simplic confidenti show exact tree detail result summar main find figur result show case requir approv longer except instanc typic approv addit activ execut specif instanc major process instanc time activ execut process instanc start fridai work fact postpon mondai happen identifi correl immedi order understand resolv problem fact process approv node longer expect identifi correl classifi simpli part natur process identifi correl isol bottleneck aspect process organ improv discov correl except resourc reveal group workload analysi spot problem suggest reassign work appropri busi process busi intellig requir care interpret result identifi due kind data problem characterist border analysi perform process start time window data set instanc complet approv typic verifi request formal correct payment made octob mine tool analyz determin instanc start spring longer start summer fall tool state accuraci rule high result due data properti data set polar respect start instanc start spring octob formal analysi typic part futur research agenda leaf includ instanc approv loop resourc execut node belong set node describ percentag instanc characterist normal except train valid set actual number train set valid set except normal figur simplifi tree obtain analyz approv process predict prevent except goal work predict occurr except aim predict except earli process adequ expect process execut speed qualiti set previou provid overview approach detail approach describ implement illustr result overview problem except predict similar except analysi except predict identifi characterist except check run process instanc characterist approach except predict includ phase previou section differ account process data prepar phase face addit challeng context except predict problem classif rule gener except analysi work poorli predict run instanc classifi process instanc possibl earli stage attribut execut resourc durat node undefin classif rule gener except analysi phase includ rule process instanc classifi assum algorithm mine phase undefin attribut branch condit branch condit evalu predict accur undefin attribut branch condit closer root follow tree improv classif branch condit evalu undefin attribut branch condit root tree give inform address issu modifi process data prepar phase gener process analysi tabl eventu result classif rule tailor make predict specif stage process instanc execut stage set node execut instanc process analysi tabl target deriv classif rule applic process instanti time prepar assum knowledg process instanc input start resourc start instanc attribut classif rule phase execut discuss previou differ perform tabl gener process data prepar phase addit phase common except except predict includ predict reaction phase predict phase predict run process instanc made classif rule appli live instanc execut classifi instanc run instanc except probabl instanc affect except reaction user system alert risk action reduc possibl prevent occurr detail implement section detail process data reaction phase phase discuss perform implement previou section process data prepar phase determin process instanc combin node execut state process analysi tabl construct section stage node make predict process instanti time process analysi tabl inform instanti initi process data resourc start instanc process analysi tabl gener stage execut node attribut list except analysi section current execut attribut set node includ phase implement script process input paramet gener process analysi tabl process predict phase execut except monitor em part mom compon figur access wfm log order make predict access wfm log requir live updat period dai depend busi classif rule obtain analyz actual predict made live data wfm write log access retriev classif gener approach assum mine phase store output rule interpret applic em em oper period access wfm audit log copi tabl inform process instanc execut oper simpl execut top small data period purg audit log archiv neglig effect perform oper system data em examin instanc process monitor em determin execut check node execut access retriev classif rule case form base execut stage tree em scan tree evalu branch condit base process instanc reach leaf node leaf node indic probabl examin instanc except probabl tupl insert warn detail process instanc except execut probabl except occurr reaction phase execut except prevent manag part mom monitor warn tabl except predict process alert user regist contact person process user perform action wfm organ prevent except reduc impact configur proactiv interact wfm attempt prevent except form autom consist process instanc prioriti instanc late process administr level prioriti depend probabl process instanc late futur plan extend automat reaction capabl modifi process instanc work node prioriti base risk cost miss modifi resourc assign polici activ faster resourc influenc point flow rout avoid except satisfi custom process goal process execut result show initi result obtain appli approach hp administr process refer approv process figur specif process durat except approv good predict instanc durat start instanc result tree reveal length process correl request creator length data item approv length number loop combin instanc affect except predict accur process instanc execut inform instanc accur predict made execut node approv activ execut inform likelihood process exc accept execut time tree predict durat except stage process figur show fact execut node approv slightli half instanc predict except probabl figur tree except predict execut node approv observ durat node rule gener analyz except remov attribut input data identifi correl understand except occur case focu correl experienc stage process instanc accuraci predict typic execut node interest optim algorithm base identif except predict phase execut stage instanc predict except accuraci interest result conclud remark paper present approach tool suit except prevent discuss main challeng face undertak address approach implement result encourag plan put effort research area address issu lie ahead research agenda includ refin except predict handl problem multipl execut node process instanc gain knowledg aim develop classif algorithm scan relat data scatter multipl tupl multipl tabl extract classif aggreg data singl tabl research object includ refin process data prepar phase select attribut base except develop complet methodolog except improv mechan autom except prevent work present paper part research effort aim develop busi process intellig solut research object context includ process definit execut path analysi dynam resourc optim refer linoff master data mine mc shan wareh workflow challeng opportun proc itali sept time manag workflow system hp process design guid edit hp technic refer guid edit tang mine except instanc facilit workflow except handl apr product workflow escal workflow manag system proc nov
Agents/485 1 formal collabor practic reason system pietro dept electron comput southampton uk nichola dept electron comput southampton uk timothi dept comput aberdeen uk abstract present abstract formal model social set cover aspect recognit potenti cooper joint autonom agent pursu joint grant order decid agent abil repres maintain model mental reason agent mental influenc agent mental state social mental shape advoc gener mechan attempt impact agent mental state order cooper joint approach architectur collabor mentalist notion prefer commit plai central role guid individu agent group behaviour identifi precondit fulfil collabor commenc prescrib cooper agent term apparatu interact process progress satisfactorili model formal logic bdi joint mental social behaviour introduct common distinguish fundament mode theoret practic theoret reason describ form reason goal knowledg typic outcom justifi belief practic intend direct conduct expect explain agent act reason mode reason inferenti process move problem theoret reason conceiv reason undertaken answer theoret problem case practic reason reason undertaken find answer practic problem logic vol pp oxford press formal collabor make full statement theoret involv give relev inform infer repres answer problem agent draw theoret practic focu practic reason practic reason conceiv speci reason coordin intent state affair belief altern action mean achiev state practic judgement recommend prudent conclud intent act practic judgement practic reason vehicl work requir step form sequenc path action situat composit concept practic judgement agent brought practic reason agent commit act complianc judgement tradit work area practic reason concentr agent advent internet form network comput applic cooper agent work common multipl agent increasingli norm extend notion practic reason deal inher social aspect class system specif concern issu formal specif practic reason social group agent primarili design exhibit intellig behaviour collect collabor paradigm activ multiag system refer group logic decentr agent cooper achiev object typic capabl individu agent gener view model kind distribut reason collect agent collabor search space problem order find solut number theoret model investig decisionmak social set approach cover full breadth social cognit activ typic involv process agent endow identifi capabl group form commun cooper achiev individu goal goal system cooper behaviour stem predefin interact tightli coupl agent oper specif cooper protocol advanc system design agent knowledg system object gener strategi commun coordin main focu coordin strategi multipl mental apparatu inferenti mechan agent obscur mere assumpt agent frequent coordin goal undertaken individu agent relat definit encapsul notion practic reason formal collabor make major commun member autonom decid action perform reason process coordin paper put forward altern view treat process number social cognit aspect dynam intertwin approach mental model intim combin account social interact capabl mental model explicit account agent mental oper perform refer agent capabl interact mechan coordin behaviour effect common social environ aim provid account reconstruct entir process lead intellig autonom agent make collabor manner formal model offer insight agent mental state rang social behaviour lead part process address agent engag gener reason mechan regul agent mental state modifi jointli reason relationship mental state interact coordin mechan enabl relationship kei role combin mental model social plai process social mental shape process mere social natur agent impact mental state motiv behaviour process involv role social relationship simpli agent social relationship social environ agent locat sourc mental attitud agent adopt complement chang individu mental state extent agent social capabl reason mental apparatu chang complement intern social motiv mental attitud complex interplai agent social environ turn process agent social relationship complet augment bare individu mental attitud kei characterist approach distinct social practic reason meant cover process agent recogn potenti organ reason commit action social practic reason fundament stage strictli refer mental apparatu inferenti process agent reason mean achiev state affair term social environ broadli refer pattern social relat agent potenti involv refer set social relationship agent establish establish circumst evolv formal collabor make build section model consist practic agent confront problem identifi potenti cooper resolut group gener group form social practic reason agent involv newli form group set social inferenti find solut problem set negoti member group interact effort make agreement action perform group paper provid agent architectur social practic reason plai central role model identifi precondit fulfil commenc prescrib cooper agent term apparatu interact progress satisfactorili work extend state art wai theoret identifi fundament structur comput process underpin system environ view abstract specif agent design interfac mechan individu social repres step goal implement ground applic model system link theoret specif implement import agent exhibit predict reliabl behaviour individu agent level system level remaind articl structur section outlin number desiderata met principl account section introduc quantifi logic formal express model logic reason repres mental attitud individu agent group section overview model section subsequ stage section situat work relat literatur section present conclud remark desiderata theori product varieti social action interact standard individu process identifi desiderata requir adequ account social set criteria subsequ evalu model unit analysi construct requir social institut theorist individu agent creat product social interact individu agent habit mind behaviour develop social environ individu motiv concept individu individu motiv deontic defin formal collabor make process involv goal search evalu search evalu select prefer implement individu concept defin individu local behaviour insuffici base build principl presenc agent dynam make differ individu made process negoti bargain coalit format collabor necessarili singl member group averag captur dynam make social set address unit analysi joint motiv deontic agent reactiv agent part requir benevol priori disposit cooper agent respond perceiv chang occur social environ affect mental state behaviour agent initi exhibit opportunist behaviour agent share social environ agent individu agent seek maxim effici satisfact prefer insuffici rich base repres agent frequent commit social commit valid basi agent variabl motiv habit social mixtur commit captur featur bratman share cooper activ mutual group member disposit mental state behaviour agent involv local individu behaviour influenc expect base belief mental attitud commit joint agent particip commit act order make joint agent favour joint drop intent escap condit true commit mutual agent commit support attempt plai role benevol agent decid initi social process commit make support perform joint activ adequ theori describ featur agent commit identifi kei doxast motiv attitud fundament form behaviour bring commun essenti commun joint activ joint intent goal adequ collect practic problem solv adequ commun commun provid inform influenc integr activ commun interrel effect poor commun frequent formal collabor make cite basi conflict problem social set good commun basi establish effect relat motiv agent involv cooper activ commun involv structur facilit coordin activ reach joint adequ theori describ commun prescrib mean place cooper fail agent assum cooper success initi fail progress satisfactorili reason agent jointli commit make adopt goal intent turn incompat ongo cooper activ unpredict event make complet practic problem group jointli commit solv turn unsolv control capabl agent adequ theori assum success cooper failur account kei stage process failur occur behaviour agent circumst successfulli complet conflict conflict expect process organiz conflict function spontan commun enhanc stimul creativ conflict structur factor lead conflict interdepend differ agent intent differ expect mental attitud behaviour type conflict involv conflict friction role conflict role conflict conflict agent involv cooper lead action effect perform part adequ theori describ situat conflict identifi resolut techniqu agent adopt process work group organiz identifi stage collect expect progress make broadli stage task announc stage involv recogn potenti social action acquaint group member natur problem requir stage involv search altern action group member judgement group member typic possess valu differ resolv group arriv agreement adequ theori recogn involv sequenti identifi kei behaviour process phase formal collabor make involv rule routin adapt anticipatori choic oldest behaviour specul organ time attent scarc resourc work organiz suggest organiz behaviour involv process organ standard oper procedur stabl routin learn situat adequ theori account driven rule reflect histori encod past experi behaviour rule routin defin behav local agent joint action progress plan run difficulti formal framework section overview formal framework model express complet formal definit appendix formal languag draw extend work logic reason social mental explicit refer time point interv oper usual equal oper classic quantifi remain classic connect existenti quantifi assum introduc obviou punctuat symbol comma time term denot time variabl rang time point occurr formula stamp time written mean hold time time point assum discret linear addit time term denot tempor variabl rang time interv tempor interv defin pair point interv form equal written time point time point time point increment time point obtain extend time point interv interv increment usual connect linear tempor logic defin mean satisfi mean eventu mean satisfi time prefer consist work bell bell huang formal individu mental attitud draw mechan relat agent group similar wooldridg jen languag extend formal framework term reason role explicitli address formal joint mental attitud section detail discuss formal collabor make st st conveni adopt interv term form abbrevi simpli multipl occurr interv term elimin result unambigu abbrevi complex sentenc tempor term repeat adopt convent miss tempor term closest tempor term goal state time goal time perform action agent group agent term denot variabl rang individu agent agent typic requir perform make achiev number properti agent agent control task resourc part cooper activ agent respond perceiv chang place environ affect mental state agent simpli act exhibit opportunist behaviour initi agent social initi social relationship mutual support execut joint action term denot group variabl rang group agent group agent simpli subset set agent agent group easili relat simpl set theori relat agent group mean agent denot member group denot relat group obviou interpret singleton mean singleton group singleton action plan addit term denot agent term denot sequenc term denot sequenc action distinguish action sequenc type occurr world oper occur state action sequenc interv complex note formula special treatment appendix formal collabor make action defin usual occur mean action sequenc immedi action sequenc occur mean occur occur test action occur true occur mean action sequenc action sequenc occur action distinguish depend perform individu agent group agent simplifi assum action sequenc sentenc form state interv group denot agent requir perform action action sequenc denot mean agent interv singleton formal perform action sequenc agent group agent introduc occur singleton action distinguish action monitor guid mental state world anim function action requir intellig agent behaviour regul set mental attitud interest action action simpli transit regul mental de facto expect intend result introduc deriv oper plan repres reason action individu agent group agent perform order achiev state world oper express fact time action sequenc group plan bring state time st time action sequenc plan group achiev occur group requir perform satisfi sophist definit plan adopt distinguish bodi precondit plan bodi point method carri precondit refer circumst plan execut made explicit partial plan hierarch plan notion illustr group agent state world final reach primit plan type attempt repres refin model leav futur work formal collabor make broader categori action action action action sequenc time repres plan bring state time singleton definit action captur notion action agent group eventu perform satisfi state world describ past execut action introduc st time state world brought consequ perform action sequenc group occur group requir perform satisfi consequ occurr doxast motiv individu mental attitud analysi base fairli standard bdi framework agent mental state set interrel mental doxast attitud motiv attitud deontic attitud introduc individu doxast motiv attitud develop technic apparatu deal semant deontic attitud dealt section belief agent belief set includ belief belief mental attitud introspect belief discuss belief set incomplet agent updat belief observ world receiv messag agent express agent introduc modal oper mean time belief hold formal semant modal oper natur extens hintikka tradit semant model world time point frame centr set world binari relat doxast altern distinguish actual world formal collabor make express semant sentenc model variabl assign iff assum usual schemata axiom modal rule logic introspect rule condit relat condit serial condit transit condit euclidean relat satisfi condit valid axiom axiom theorem complet axiomat normal modal logic necessit rule rule infer axiomat normal modal logic desir agent desir conceiv set state world agent bring express agent introduc modal oper mean time desir desir mean time desir hold set agent desir consist agent desir desir lead contradict agent desir conflict believ semant analog basi logic necessit properti axiom assum unbound variabl quantifi set time world axiom assum replac formula languag formal collabor make axiom necessit rule theorem rule infer axiomat normal modal logic goal goal defin set consist realiz state world agent expect bring repres agent agenda motiv current futur behaviour agent goal desir goal consist realiz desir inconsist section subset consist realiz desir move select subset consist desir consist agent goal state world agent bring autonom potenti candid motiv behaviour goal instrument achiev goal desir goal adopt physic social environ agent influenc adopt goal consequ role parallel desir express agent introduc modal oper mean time goal goal mean time goal hold start formal axiomat goal axiom state goal close implic introduc weak realism constraint goal agent goal proposit negat believ agent goal contradict belief logic goal condit access condit serial condit st iff relat satisfi condit valid axiom axiom necessit properti properti contrast krau al framework goal desir contrast framework agent goal desir cohen levesqu assum agent belief goal properti framework agent adopt goal time note weak realism constraint case desir agent desir attain state world believ formal collabor make semant goal analog bel de intent fundament characterist individu intent involv special kind act long agent intend achiev commit act perform action deem achiev state distinguish form intent depend argument action proposit intent subdivid intent involv perform intent involv achiev state affair perform action grosz krau type intent commit agent adopt conflict constrain replan case failur grosz fundament mean correctli mesh collabor agent plan contrast grosz repres basic intent oper commit agent practic reason conceiv prior motiv line practic reason agent intend state affair commit attain world intend state hold commit agent find practic mean attain state affair paper primarili concern formal agent practic reason focu modal oper repres intent proposit hold time desir intent mean time intent hold agent adopt goal intent intuit agent achiev goal simultan subset goal commit act achiev subset point futur intent goal intent agent adopt autonom potenti motiv behaviour order goal oblig adopt intent agent author control behaviour formal axiomat intent intent close implic consist introduc weak realism constraint intent agent intend proposit negat believ ensur agent intent grosz krau identifi potenti agent commit potenti conceiv similar call candid move grosz krau potenti stem agent practic reason perform action commit agent reason eventu act formal collabor make contradict belief necessit properti condit condit serial condit st iff relat satisfi condit valid axiom semant intent analog goal prefer kei compon modal pref express prefer formula section agent prefer plai activ role social practic action select order intent fulfil modal oper mean hold interv semant modal term world prefer von wright conjunct principl agent prefer agent prefer world hold hold hold hold agent prefer interv prefer rise paradox prefer prefer prefer state desir properti describ unreason situat avoid constraint natur prefer idea compar differ actual world adopt select function origin introduc bell huang line treatment condit bell huang defin function set closest world denot set world model satisfi variabl assign defin function associ subset state interv agent prefer time express prefer associ set closest world world hold hold greater associ set closest world world hold hold model variabl assign semant condit formal collabor make semant axiom iff iff state conjunct principl transit prefer state disjunct principl prefer doxast motiv joint mental mutual joint joint goal joint intent maintain section adequ model requir provid coher set data structur conceptu mechan individu group level perspect individu construct higherlevel entiti plai role attempt formal reason collabor behaviour conceptu distinct step constitut approach identifi kei concept relat individu identifi kei concept relat collect identifi relationship individu collect concept section mental state individu agent term intent prefer introduc similar conceptu construct describ doxast motiv mental attitud collect agent formal identifi principl kei relationship level collect group formula languag includ modal oper mean time group mutual belief proposit hold mutual belief infinit conjunct agent belief agent belief agent belief hold joint desir convei fact agent connect state world bring joint goal point state world agent achiev candid move joint joint intent convei idea agent individu commit achiev state intend individu commit achiev state semant oper defin examin semant member group mental attitud formula formal notion joint prefer main reason model mentalist concept individu prefer plai central role form practic judgement social practic reason joint group stem process negoti number agent influenc perform action joint prefer obscur individu practic reason mechan involv prevent formal negoti process agreement reach group collabor agent formal collabor make introduc oper mean time member group believ hold semant agent group desir attain state agent group goal attain state agent group intent attain state defin analog group time mutual believ iff time member abbrevi abbrevi formal joint goal intent order establish joint state world member condit member group individu mutual belief group member condit suffici establish joint concentr case joint intent imagin agent individu commit achiev state world case mutual belief agent intend achiev intend share intent agent simpli find hold intent suggest establish joint intent state agent intent individu intent state mutual belief agent case joint desir joint goal similar joint intent summar condit joint intent group joint desir member desir mutual believ group member desir member intend member desir mutual belief group joint goal joint intent defin joint desir formal collabor make unlik previou work area defin joint mental attitud entiti broadli combin underpin individu attitud work area definit advantag captur interplai individu mental attitud function relev gener notion joint mental attitud model formal joint mental attitud involv collabor model formal individu agent mental attitud mental attitud ontolog joint mental identifi main form individu agent attitud attitud agent belief group member believ group member believ mental attitud held group member agent intent group member hold mental attitud agent belief group member believ group member believ group member intend group member hold mental attitud year work distribut artifici intellig philosophi mind principl mentalist apparatu involv collabor activ work argu formal cooper ground formal mental state involv consensu connect individu joint mental attitud constraint relationship individu joint mental attitud levesqu al requir agent group hold group goal kinni al requir group goal intent distribut constitu agent basi skill capabl cavedon al requir joint attitud team entail joint attitud type joint mental attitud group entail mental attitud type constitu agent theorem express link mental state agent mental state group agent belong properti stem definit joint ensur mental attitud individu agent propag upward group agent part collect joint intent agent part collect intent collect intent agent collect intent social joint commit agent individu intent state affair entail agent commit act achiev group joint intent suffici ensur group commit perform joint action reason joint intent strongli persist individu intent joint intent bring group member commit part group act formal collabor make collabor manner ensur member individu commit intend individu commit act joint intent drop group member decid leav group reason addit condit joint intent order strengthen joint commit act collabor ensu addit condit ensur import facet relationship collabor agent agreement group member group control member behaviour deontic aspect oblig member group order captur properti joint persist intent joint give formal persist joint term composit notion build concept social commit social commit primit notion express relat group agent commit group action sequenc commit defin social commit individu agent group social commit individu agent special case social commit social commit express term formula agent commit group make true agent group defin similar time commit make true iff action commit perform plan achiev plan achiev plan achiev collabor posit formal strongest motiv attitud consid joint commit group agent joint commit achiev state affair long persist joint intent state joint intent persist extent strengthen relationship group member norm natur social commit notion make joint persist intent group joint commit act collabor manner formal collabor make formal intent primit intent cohen levesqu approach joint commit subset joint goal joint intent subset joint commit group act joint mental persist joint intent persist joint goal joint intent persist joint intent stabl joint commit cohen levesqu defin joint commit simpli term escap condit account natur relationship group member notion fail explain group agent commit act collabor circumv shortcom norm constraint behaviour bind multipl agent group member commit part achiev state view follow cohen levesqu joint commit term persist unlik cohen conceptu joint commit term persist joint intent joint goal model persist joint intent state affair ad stronger condit group member individu commit group respect state approach distinguish joint goal persist joint distinguish persist joint persist joint intent term escap condit norm constraint collabor agent definit time group joint commit make true iff joint persist intent group joint persist intent mutual believ true joint intent true social commit fulfil joint mutual believ social commit fulfil joint true mutual belief continu hold mutual believ true member longer motiv part group drop commit note express condit joint intent abandon cohen levesqu escap condit refer emerg attitud incompat initi commit motiv weaker escap condit case group member adher group joint subsequ adopt intent incompat joint condit model flexibl account case content escap condit complet agent joint commit achiev state affair circumst chang correctli predict futur advanc content escap condit joint commit drop formal collabor make give formal notion joint commit role logic enrich term denot rang role role view set mental attitud govern behaviour agent occupi posit structur system similar attempt develop cognit model attach role mental attitud goal intent occupi adopt adopt turn impact agent mental state agent mental attitud simpli complement attitud role provid agent inform goal intent drive behaviour assum role organiz unit lead agent adopt goal contributor unit success role provid agent inform execut task unit role influenc agent commit proce requir cognit role advoc attach role main type mental mandatori attitud option attitud mandatori attitud constitut relev role attach attitud agent adopt role option attitud intim constitut role attach attitud decid adopt attach role secretari intent correspond refer job specif oblig adopt intent attach goal friendli peopl busi secretari expect oblig behav note notion mandatori mental attitud consist concept organiz commit commit commit adopt mental attitud attach role group organiz commit group impli commit act accord oblig rel mental attitud attach role light role term mandatori mental attitud formal collabor make consist prescript account role set behaviour oblig base organiz commit group express fact agent role order investig impact role system agent mental logic enrich oper mean role time linda mean time linda act secretari depart social relationship addit term denot relationship variabl rang relationship type relationship type repres relationship abstract pair role role link type social relationship empow dictat work agenda instanti relationship type rise social relationship agent relationship type give rise number relationship instanc involv boss involv boss subsidiari introduc oper social relationship type time social mental shape social mental shape refer phenomenon mere social natur agent affect mental motiv behaviour typic outcom modif agent mental adopt social motiv mental attitud modif individu motiv outlin agent adopt mental attitud partli driven social environ agent locat claim role relationship plai activ causal govern agent behaviour individu mental state enrich extend formal develop set process social mental shape involv note notion role consist account role set behaviour distinct mandatori option attitud rich varieti individu collect norm posit author sergot note complet cognit role requir introduct modal oper formal attach mental attitud oper expect express mental attitud agent intern adopt role attach agent mental attitud section semant mental attitud express access relat world explor issu paper leav futur investig formal collabor make social role social relationship agent relationship agent kind associ engag iter seri social action interact aim complet mental state social action interact process social environ role agent social complement augment agent bare individu mental attitud introduc modal oper formal process social mental shape basic social mental shape base social social mental shape occur agent write time belief desir goal intent hold role social mental shape formal influenc role agent mental state express modal oper term role mean outlin mean time social influenc role attitud state world iff time occupi role adopt attitud consequ role note distinct mandatori option mental attitud section fundament problem prevent automat agent occupi role system mandatori attitud attach agent automat adopt attitud occupi role subject social mental shape process option decid adopt attitud option attitud attach role agent decid reason social mental shape agent number wai agent influenc anoth mental state main mode social influenc found system author agent influenc adopt mental attitud power guid behaviour disposit agent influenc adopt mental attitud simpli intend contribut welfar trust agent influenc adopt mental attitud strength confid social mental shape formal term prefer agent influenc role social relationship adopt prefer formula concern form social focu social driven adopt goal intent formal collabor make agent influenc adopt agent mental attitud process argument negoti threat agent threaten adopt mental attitud basi futur neg deni social mental shape agent place social relationship agent influenc adopt mental attitud mode social influenc suitabl circumst mode influenc exploit social social relationship exist definit social relationship section author absenc social relationship agent author prime minist case social relationship exist agent involv friendship note social relationship repres input output social mental shape process agent involv relationship decid persuad process argument aim type relationship establish social relationship repres outcom social influenc form social mental shape agent social relationship dealt social mental shape social relationship formal social mental shape occur pair agent social express modal oper term mean time social influenc hold mental attitud form social mental shape agent believ agent mental reason adopt mental attitud cover form social imit spontan benevol emul note case social mental shape agent social form social mental shape detail social relationship social mental shape formal agent mental state influenc social relationship agent social relationship type believ mental attitud reason adopt influenc situat social relationship form social mental shape base depend agent adopt acquaint mental attitud social mental circumst agent involv social formal collabor make relationship requir adopt acquaint mental attitud agent autonom decid establish relationship agent relationship automat number mental attitud mental state mandatori attitud boss order perform activ secretari decid interact establish social case chang mental state adopt intent boss formal model overview present overview model formal express logic section model base wooldridg jen formal cooper process similar approach wooldridg jen work inspir model realiz cooper aim identifi basic step process approach mental attitud agent involv process model aim cover entir process contrast focu primarili process involv process mental model strictli coupl account social interact capabl cooper agent explicitli repres mechan influenc agent mental state behaviour interact autonom agent provid theoret foundat inferenti apparatu interact give account practic reason process social set stage model practic individu process begin state world agent intend realiz agent confront practic problem agent solv problem typic individu decisionmak situat occur potenti cooper resolut practic problem potenti relev agent recogn section group agent recogn potenti cooper stage solicit assist stage end group joint practic problem base joint commit achiev state world section social practic member newli form group reason action group perform order fulfil joint commit find answer practic problem stage success agent practic judgement action perform form intent group perform action section member attempt bring agreement group action perform stage formal collabor make action joint intent joint commit group act ensu section complet cover begin aim provid descript ideal world assumpt made detail worth note deal structur model assum simplic model strictli stage directli realiti process inher stage agent involv return previou stage model deal action execut final conclud agreement action perform group contrast approach support idea practic reason action individu agent group agent make time unexpectedli prevent act decid postpon execut action chang mind decid perform newli action fail execut action individu agent group made action decid simpli mean give answer practic problem answer practic problem involv practic judgement favour specif commit act simpli perform provid circumst chang realist agent situat awar extern world chang circumst alter make commit perform action suggest built action provid answer practic problem view conclud element note consist idea success practic reason conclud theoret reason conclud justifi belief conclud action action practic practic practic basi agent intend achiev practic problem problem fulfil intent environ recognit potenti cooper identif agent opportun collabor agent resolut practic problem formal collabor make practic basi involv state world agent intend achiev intent state trigger process agent problem agent confront situat decid action perform order attain state agent extent fulfil intent affect action open regard direct realiz state affair agent intend bring agent intend possess attain realiz situat connect directli agent agent intent constitut practic basi subsequ intent practic piec possess practic forc practic problem order agent achiev state world intent practic forc requir line practic problem answer theoret problem found answer practic problem found situat agent made practic problem longer present problem turn success unsuccess desir state world achiev agent intent fulfil practic problem made practic problem relat agent physic social environ agent locat confront agent achiev limit action met eventu action perform physic social environ relat practic problem agent physic social environ overrid factor principl method principl method enabl agent resolv practic problem limit environ recognit potenti cooper practic basi relat practic problem insuffici give rise process agent social influenc resolv practic problem isol incap unwil resolv problem social influenc solv collabor agent lean agent social environ act make commenc exist potenti cooper resolut practic recognit potenti agent explicitli separ stage potenti cooper formal collabor make trigger subsequ phase process agent agent involv joint nonetheless potenti cooper relev order conveni exploit agent awar potenti exploit agent cooper agent cooper attain potenti cooper potenti cooper social relationship bring social relationship abil involv form cooper abil point feasibl social mental shape process endeavour adher intent achiev state discuss intent repres step gener joint practic basi subsequ order joint basi brought social mental shape process requir influenc intent achiev definit potenti cooper definit respect state affair intend potenti cooper social believ relationship brought believ social mental shape process influenc adher intent achiev concentr condit potenti cooper recogn agent recognit potenti cooper valuabl agent order recogn exploit recognit place social depend relationship potenti cooper agent social respect achiev state occur assum cooper agent potenti rule circumst agent cooper potenti cooper achiev due agent unawar potenti section mention number mode social influenc agent agent adopt mode order establish social relationship agent choic effect mode depend number physic social agent discuss issu leav futur work definit potenti refer strictli cooper activ case number agent cooper resolut practic central planner awar joint unawar interest result collabor activ rule form emerg social activ model cooper base weaker ground unawar implicit tacit formal collabor make agent unabl fulfil intent achiev isol agent assist fulfil intent agent intent achiev state attain inform access form social interact state achiev agent fulfil intent achiev isol intent fulfil agent collabor manner agent achiev notwithstand abil hold intent achiev collabor reason underpin intent cooper agent fulfil intent isol eventu bring number difficulti fulfil intent collabor agent turn solut bring faster accur act agent desir act collabor manner collabor bring effect fulfil agent intent agent influenc adopt fulfil intent involv agent form collabor aim achiev agent achiev individu motiv intent achiev collabor social influenc adopt establish form collabor activ achiev head depart expect involv head depart resolut role ensur similar academ standard appli agent abil act role head depart induc seek cooper agent influenc agent social fulfil intent establish form collabor aim achiev agent achiev influenc agent achiev collabor secretari oblig boss involv colleagu execut task secretari abil execut task relationship establish boss induc seek cooper light definit recognit potenti cooper definit potenti state affair condit potenti cooper recogn potenti depend form collabor activ achiev note point aim incorpor prescript side social depend formal definit discuss agent requir establish requir bring social depend agent model norm aspect social depend appeal social mental shape base role social mental shape occur agent formal collabor make give formal definit enrich formal framework introduc deriv oper notion potenti cooper couch term agent abil establish social relationship social mental shape process definit recognit potenti cooper couch term notion social depend turn build concept abil individu agent group agent order formal introduc deriv modal oper express notion abil abil consensu literatur definit abil defin abil primit modal follow wooldridg jen adopt definit origin moor definit abil achiev state iff action sequenc achiev directli find achiev definit possibl action sequenc plan agent achiev state directli action sequenc plan agent closer give formal express notion introduc introduc express fact time abil achiev isol time note notion abil close abil bui pen dollar dollar bui black pen red abil bui gener definit abil definit group abil achiev state iff action sequenc plan achiev directli find achiev possibl action sequenc plan group achiev state directli action sequenc plan group closer state formal notion group abil turn concept social depend agent notion recognit potenti cooper base agent intend formal collabor make achiev state abil intend achiev social influenc achiev depend agent respect achiev state definit state condit social depend relat potenti collabor agent definit depend form collabor activ respect state intend bring believ jointli achiev true believ abil achiev intent perform action sequenc believ plan bring social influenc adopt collabor achiev social influenc agent social collabor achiev st st definit social depend modal oper primarili aim captur prescript sourc social depend sourc reflect influenc norm author agent mental state behaviour make agent social depend agent capabl fulfil requir lean agent establish form cooper oper captur aspect appeal process social mental shape role agent social agent requir depend agent cooper regul influenc act isol shown section conceiv role set attach mental attitud impact agent mental state behaviour process social mental shape norm reflect attitud attach role requir depend formal collabor make eventu establish cooper activ agent induc depend simpli subject social influenc agent type social influenc place social relationship agent requir agent adopt intent achiev state world collabor isol agent social commit achiev author chang mental state induc seek cooper social depend relat brought social mental shape process occur agent give formal express notion potenti perspect respect state affair agent potenti cooper attain state affair social relationship agent exist believ relationship brought believ influenc adopt intent achiev state note definit potenti cooper agent ident agent cooper achiev state affair express argument notion term agent rewrit ad side ident altern defin potenti cooper leav open agent opportun find acquaint cooper search process aim attract requir cooper establish exist social relationship agent preclud agent establish form cooper agent exist social relationship give formal express notion recognit potenti agent recogn potenti cooper social depend joint activ group gener recogn potenti cooper solicit assist involv agent resolut practic problem stage end group identifi potenti cooper insuffici ensur begin simplic focu prescript approach account type prescript agent requir act isol norm reflect role formal collabor make agent recogn depend agent state decid solicit assist give intent leav temporarili fulfil time futur make number assumpt agent behaviour assumpt primarili concern fundament facet process lead format web social mental link bind member group main step involv gener ident individu intent achiev state gener joint intent achiev gener joint commit act collabor manner achiev state step dealt turn individu intent gener oper successfulli gener group agent seek assist influenc agent establish group act collabor manner express process social influenc term agent attempt social mental shape process aim influenc agent mental state social mental shape primarili intend bring joint practic basi basi meant practic forc joint practic problem group order achiev state world group member individu intent achiev state establish joint practic basi individu intent practic forc involv form act fulfil suggest agent recogn potenti cooper resolut problem order achiev attempt seek assist induc agent adopt intent achiev state group agent ident individu intent step gener group express assumpt agent intent recogn potenti cooper respect intent achiev long recogn attempt social mental shape process aim intent achiev fail belief intent achiev formal assumpt introduc formal express notion attempt agent achiev state affair mention section notion influenc regard gener form interact base appeal past appeal prevail assum agent seek assist establish group ad agent group exist make exist group adopt joint intent formal collabor make perform action introduc complex action express attempt achiev perform achiev main assumpt individu intent gener state recogn potenti cooper respect state affair long recogn attempt impact mental state adopt intent achiev fail intent achiev group made collect member directli involv kind agent particip give contribut joint share intent group interest final part group oblig join group coordin awar made group agent member group share group ultim intent agent member group make give contribut made behalf member cover situat focu made number agent share practic problem awar directli individu involv process recogn process social mental shape aim gener individu ident intent strictli account kind peopl particip process influenc adopt intent agent form intent social mental shape process simpli happen collect agent share practic problem find conveni join capabl solv problem effect manner commenc influenc mental state adopt intent paper aim give account entir process begin individu agent request assist influenc adopt intent agreement made group talk social mental shape individu intent gener joint intent gener agent share ident individu intent necessarili motiv act fulfil intent collabor manner case scientist formal collabor make hold intent find scientist gener intent independ influenc adopt intent necessarili expect collabor coordin fulfil intent competit intend drop intent ident individu intent entail joint mentalist notion support form collect behaviour agent hold ident subsequ step agent intend hold intent joint intent condit group agent act resolut practic problem definit joint intent group member individu commit intend achiev state awar intend member equal final mutual awar group jointli intend achiev bind agent individu intent common mental joint intent provid cognit step gener group express assumpt agent intent recogn potenti cooper respect intent achiev success social mental shape process aim adopt intent achiev long recogn potenti attempt joint intent jointli achiev fail mutual belief jointli intend jointli intend achiev express assumpt constraint logic mental joint intent state impli group member individu intent state entail member desir goal state group joint intent achiev state member individu desir goal state group base mutual knowledg mutual depend member interest achiev ident state goal achiev group joint intent achiev state member individu intent state member hold desir goal state kind agent share ident intent share desir formal collabor make group member interest intend bring person benefit case member social influenc join group achiev collabor goal group joint intent state entail member individu intent reinforc member individu state account formal axiomat mental attitud repres intent goal desir time joint commit gener joint intent cognit ingredi provid foundat collabor activ group suffici order group establish inher weak fact easili drop agent order joint intent fulfil drop escap condit true member group simpli joint intent norm constraint ensur stabil creat interperson oblig oblig group act collabor member drop intent exit group violat oblig frustrat expect ingredi joint commit group joint commit determin group persist hold joint control likelihood group drop intent express assumpt agent commit recogn potenti cooper respect intent achiev success gener joint intent held achiev long recogn potenti attempt joint commit held achiev mutual belief held joint abil bring fail mutual belief held believ joint abil achiev mutual belief held intent joint commit achiev formal collabor make condit assur persist joint intent condit mean mutual awar joint abil requir attain justifi condit context assum seek assist respect intent achiev state believ joint abil attain gener condit joint commit establish group mutual eventu true group achiev directli mutual believ agent member group requir abil assist eventu stage group gener member jointli commit give answer joint practic problem trigger individu group gener stage successfulli process guid mental attitud mental attitud reflect group joint commit ground notion joint intent mutual belief motiv group gener point mutual belief mutual depend necess collabor order state world joint commit mutual depend potenti motiv form group work scientist share intent find mutual intent intend part group jointli commit find mutual depend scientist motiv part intend part group commit group motiv gener agent solicit assist social depend joint activ respect achiev state affair agent sought form group intend member reason unconnect origin request assist motiv agent decid benevol give agent futur agent formal collabor make agent convinc part group enabl achiev goal agent oblig cooper resolut practic problem share joint intent hold agent assist request oblig cooper specif agent seek agent request assist author involv agent form cooper prescript sourc cooper captur notion social mental shape base role social mental shape occur agent role function influenc adopt intent circumst request agent role entail set behaviour oblig base mental attitud attach oblig function prescript sourc collabor activ social mental shape occur agent function prescript sourc cooper long agent author forc join group achiev state collabor manner social commit respect achiev oblig involv collabor activ aim achiev subject social mental shape process base author accept request adopt intent member group collabor social practic reason group gener jointli commit achiev state joint practic basi practic problem ensu section individu group joint commit achiev state constitut joint practic basi possess practic forc support remain stage group joint commit state trigger joint practic problem group member confront problem group achiev state give answer problem mean jointli decid action group perform fulfil joint commit agreement agreement reach agent individu reason action group perform fulfil joint commit reason undertaken individu agent locat social set call social practic reason social practic reason point logic argument cognit mechan group joint commit transform group member individu intent group perform action fulfil joint commit evalu concept practic distinguish reason broader term reason design process structur gener process practic reason process pass practic aim action truth agent practic reason commit polici action commit perform reason action commit perform action explain justifi line practic reason formal collabor make structur practic reason practic argument structur proposit avoid structur practic reason practic infer structur proposit main constitu motiv connect relat content motiv favour action connect type infer mention end mean end result consist favour mean secur end studi kind practic infer relev problem explain understand behaviour conduct individu agent group agent embark discuss social practic briefli discuss formal main form practic infer individu agent highlight basic structur individu practic main structur subject repres practic reason undertaken social set process practic reason social set social order requir perform agent member group structur reason expect couch term mentalist notion ensur social orient taxonomi basic practic infer type section focu schema practic infer individu practic reason philosoph logician charl peirc contend abduct distinct type view introduc hybrid form induct follow peirc import modif practic infer distinguish deduct infer distinguish practic infer abduct induct treat practic induct special case practic abduct deduct practic infer deduct practic infer regard instanti gener major time intend attain minor time believ attain perform action sequenc time intend perform present paper deal practic infer subsum individu action gener rule action intermediari action hold action formal collabor make form practic infer intent achiev state world practic judgement mean achiev state practic judgement practic relat end mention mean secur end note form practic infer deduct consequ logic infer deduct practic infer support true convei evid practic infer formul basic schema practic draw distinct choic decid gener decid make mind make mind involv give minim question conceiv explicitli action sequenc explicitli decid prefer altern action sequenc line practic infer lead choic ideal includ step time intend attain time believ perform action sequenc attain time believ perform action sequenc attain time believ perform simultan perform time intend perform form practic motiv set clear deduct consequ logic infer agent consid agent logic accord base deduct infer transcend inform gener commit base practic necess encod contrast practic deduct thought explicitli practic necess deduct practic infer intent reflect practic infer reflect decid form practic infer practic infer distinguish note action consid altern mean bring result agent intent achiev action attain prevent agent attain altern mean achiev formal collabor make practic practic infer taxonomi reflect type inferenti process individu agent select action practic abduct peirc maintain occur scienc everydai life distinct pattern theoret reason explanatori form accept call kind theoret reason call practic practic infer satisfactori structur reason process pass intent achiev state affair intent perform action satisfactorili fulfil prior intent reason process includ initi process set altern action plan agent attain state process critic evalu practic judgement made action agent intent perform action structur process reflect practic distinct kind practic infer adher time intend attain time believ set altern action sequenc perform attain time believ satisfactori mean achiev prefer perform action sequenc action sequenc includ time intend perform core idea prior intent achiev state world transform intent perform action satisfactorili achiev state world abduct practic infer aim satisfactori confid accept practic induct induct practic infer treat instanc abduct practic infer induct practic infer structur reason process pass intent achiev state affair intent perform action basi observ satisfactorili fulfil prior intent induct practic infer adher gener time intend achiev time believ time action sequenc turn satisfactori mean attain time believ action sequenc plan attain time believ action sequenc satisfactori plan attain time intend perform formal collabor make contrast type abduct practic infer forward term expect induct practic infer infer backward experi call infer abduct infer infer plai central role form collect infer process choic behaviour induct practic infer special case abduct practic infer mean step induct practic action sequenc believ satisfactori mean achiev thought conjunct belief prefer altern belief brought belief past perform repres outcom fourth step induct practic believ satisfactori plan attain reflect belief past perform inform basi practic judgement express practic induct practic abduct prefer function form intent action sequenc fail attain past perform longer accur basi select pass past perform intent perform practic practic induct base comparison altern mean attain state comparison hidden prefer function turn satisfactori past satisfactori compar current altern taxonomi basic social practic infer type light concept individu practic section concentr main form social practic infer broadli social practic infer defin structur proposit correspond reason process member jointli commit group undertak order give answer joint practic problem social practic infer sort motiv base group joint commit achiev state connect relat content motiv favour action connect individu type infer end mean end mention consist favour mean secur end social practic infer support perform action plan group fulfil joint commit jointli reason inher reflect group member intent stanc group process social practic reason emerg group member reason repres member group intent formal collabor make cognit agent endow mental attitud structur social practic reason social practic infer reflect group individu agent mental formal term higherord individu mental attitud develop concept social practic individu main type deduct infer social deduct practic infer state member group basic schema social deduct practic infer time group jointli commit achiev intend achiev time group believ achiev perform action sequenc time intend perform intent perform action sequenc deduct consequ logic infer extent believ action sequenc group perform order achiev social practic infer logic deduc give evidenti support intent base practic necess perform group achiev social practic infer member jointli commit group believ action group perform fulfil joint social practic infer logic deduc individu choic involv question practic infer formal valid social practic infer infer aim satisfactori individu social infer render set social practic infer state member group basic schema abduct social practic infer time group jointli commit achiev intend achiev time believ set altern action sequenc plan attain formal collabor make time believ satisfactori plan achiev prefer perform action sequenc action sequenc includ time intend perform number altern criteria select satisfactori action develop expect monetari maximum expect criterion mention satisfactori determin agent mental circumst choic made step time believ satisfactori plan achiev implicitli provid straightforward gener specif choic criteria schema reflect gener prefer function underli number specif choic criteria concept social abduct practic infer captur oldest behaviour specul idea time attent scarc resourc altern action perform achiev state world consequ altern consid action select choic altern respect search altern situat care intellig social practic reason requir gener altern call cost make mistak plenti time altern social practic infer social practic infer special case social practic infer state member group basic schema induct social practic infer time group jointli commit achiev intend achiev time believ time action sequenc turn satisfactori plan attain time believ plan attain time believ satisfactori plan attain time intend perform social induct practic infer built core idea organiz decisionmak organ tend devot attent plan fail meet target plan meet target plan search reduc plan search undertaken search altern continu satisfactori plan discov formal collabor make reflect concept induct practic altern plan compar review sequenti accept reject basi observ past perform core idea organiz concern role adapt rule organiz choic behaviour involv calcul consequ organ standard formal formal procedur learn situat part reflect deeper comparison altern basi subsequ awar role plai organiz direct attent process rule stabl organiz routin creat chang idea rule routin encod experienti wisdom reflect lesson outcom trial error learn select retent prior behaviour organ prone devot attent primarili plan fail meet driven routin procedur reflect histori past argu adequ account describ kei social reason process inher induct model social induct infer reflect prefer base past experi agent practic judgement satisfactori action base evid past execut action social practic induct correspond process mean rule encod prefer fit situat rule appli situat rule insensit mental state consid social deduct practic infer relat reason process undertaken member jointli commit group process intent favour perform action group order group perform agent practic reason process connect involv coordin problem captur formal fourth stage model negoti displai basic type social practic illustr process member jointli commit group reach agreement action group perform fulfil joint commit shown section agent conduct social practic reason deduct form kei role process plai agent practic belief action perform group order state world achiev agent end intent group perform action practic judgement case agent view action group perform group member inconsist intent group perform differ action agent form agreement action group perform form disagr agent agent practic necess deduct formal collabor make cal infer base agent number ident altern action consid choic made choic criterion select satisfactori altern agreement action call answer joint practic problem common assumpt system research plan group agent endow joint group member carri execut condit idea joint plan complet sequenc action successfulli perform achiev state close behaviour plan clear complex interplai plan support social environ interplai obviou fact specif desir effect requir achiev specif state origin joint plan specif rout success joint plan turn depend number social action interact agent individu agent deploi gener strategi incorpor social interact acquaint part gener process process involv explicitli formul potenti joint plan repres agent mental state plan function ingredi gener process complet recip success light describ agreement gener action process action result individu agent apparatu number social action interact agent negoti captur underpin foundat process jointli decid action group perform negoti process agreement made parti agent make suggest modif receiv request amend object altern action negoti rang number quantit qualit aspect action success negoti expect resolv number issu satisfact agent contrast issu requir order agent agreement develop formal analysi negoti simpli focu kei underpin process common form negoti minimum requir order negoti place agent successfulli conduct social practic reason process negoti commenc form practic belief action satisfactori action perform group achiev state practic favour practic intent group perform action suggest practic judgement formal collabor make assumpt formul reflect minimum group agent jointli commit achiev state eventu follow state agent hold commit iff maintain intent group perform action order fulfil joint commit assumpt mean agent joint commit eventu drop commit fulfil agent gener intent group perform negoti commenc agent attempt gener mutual belief group content intent negoti trigger agent attempt bring state mutual believ group action candid move action statu write assumpt make intent group jointli commit attain state world hold intent group perform action sequenc long group joint commit follow state bring state mutual believ group intend group perform fail bring state mutual believ group believ satisfactori action sequenc group perform fulfil joint commit assumpt mean agent successfulli conduct social practic reason process attempt gener mutual belief group practic intent group perform action fail gener mutual belief group practic judgement express form practic necess case formal collabor make deduct prefer altern action case order negoti social mental shape process aim gener agreement action perform agent intend group perform group closer agreement perform action agent object prevent agreement action perform group express attempt group jointli commit bring state world intend group perform action sequenc believ intend group act perform action sequenc long group joint commit intent follow state attempt social mental shape process aim intend group perform fail intend group perform assumpt mean agent attempt make intent group exert social influenc process aim chang belief group ultim impact intent negoti process end agreement action perform group agreement impli agent share intent group perform action maintain section share ident individu intent entail joint mentalist notion support form collect behaviour group joint commit act manner complianc definit joint commit agreement reach group time action sequenc repres outcom process joint time joint persist intent joint action sequenc eventu perform time group made joint perform action sequenc plan formal collabor make achiev definit joint reflect properti mutual believ perform order bring joint intent perform order bring social commit fulfil joint mutual believ social commit fulfil joint true mutual belief continu hold mutual believ brought consequ perform member longer motiv part group drop commit group success make joint process conclud transform commit intent transform joint joint achiev state affair joint joint perform action plan group order bring state individu joint action constitut essenc process transform joint outcom simpli answer joint practic problem composit concept inher reflect joint commit gener social practic reason process relat work focu work formal process perform number cognit agent jointli commit act work share common research issu main artifici intellig formal formal model mental model multiag system present relat work area situat research relev literatur formal collabor make formal languag paper develop languag draw extend previou work bell huang wooldridg jen cohen levesqu relationship work logic close resembl bell huang ca logic explicit refer time point interv time point assum discret linear bell express semant prefer oper function avoid properti simpler semant prefer logic extend languag respect term denot group mechan relat agent group term denot role social relationship type modal oper denot joint mental formal set oper perform cohen levesqu logic languag modal repres mental mechan describ structur occurr complex action bell logic extend cohen levesqu languag formal account term group agent joint mental attitud logic similar cohen levesqu share linear view time time explicitli time explicit logic express system enabl type mental attitud express goal proposit true specif time futur intent proposit time point wooldridg jen languag logic term express group agent modal express joint mental attitud logic languag point departur logic base linear view wooldridg jen branch tempor model mental model work ai research support idea agent model term mental state common approach model agent bdi system differ highlight compar approach vari usag mental attitud cohen levesqu wooldridg jen refer primit mental attitud belief goal defin attitud term rao georgeff primit intent definit suffici suitabl articul descript mental state behaviour agent involv process wider definit prefer mental model strictli resembl krau al logic modal repres mental attitud desir goal intent close contradict belief belief close agent assum omnisci goal framework agent adopt goal formal collabor make repres desir state affair model intent contrast assum agent adopt goal intent research model agent mental state social set assum intent goal section distinguish type cohen levesqu make distinct intent action express proposit argument intend bring state world mean commit sequenc action state hold adopt capabl fulfil isol unabl act agent assist agent requir contradict mean agent intent proposit negat believ distinct intent consist grosz krau type potenti potenti intent repres agent mental state adopt intent mental attitud potenti candid move formal notion goal contrast model commit agent practic reason plai induc agent achiev intend state world notion plai kei role coordin problem form basi mesh coordin statu updat form basi social connect number agent jointli perform social practic reason process major deduct social practic infer section formal doxast motiv joint mental attitud account mutual belief similar cohen levesqu mutual belief infinit conjunct belief belief belief proposit contrast model joint goal joint intent entiti system joint mental attitud build underpin individu mental attitud agent involv contrast model joint share individu mutual belief section explain weak account joint mental attitud formal term addit requir notion social commit build castelfranchi work notion formal concept joint commit joint commit reflect web social commit relat agent group contrast model joint commit term mutual depend agent varieti motiv disposit move agent social commit gener joint commit act notion joint commit cohen levesqu formal collabor make joint commit form joint joint intent formal joint commit group agent share mental state joint intent joint joint intent entail joint commit formal joint commit strongest motiv attitud framework model escap condit joint commit built weaker flexibl group agent drop joint commit mutual precondit true agent begin joint commit formal joint weaker notion escap reason abandon joint commit emerg attitud incompat initi commit model system aspect studi research varieti dai econom organiz behaviour theori philosophi sociolog distinguish main categori model formal architectur social implement architectur aim softwar system manag coordin number agent domain model develop paper li aim develop theoret foundat formal languag number similar categori approach conceiv constitut number stage section identifi main phase adequ theori account task announc negoti process strictli resembl wooldridg jen stage cover process formal ideal assum stage iter stage recognit potenti cooper describ negoti process agent contrast model captur underpin motiv social process stage stage practic start begin formul practic problem motiv agent seek assist distinguish potenti cooper detect agent recognit occur social depend relat exist agent involv point differ formal social practic reason process agent undertak make joint process obscur account transform joint occur social set rise final joint identifi kei joint mental motiv attitud guid group relationship attitud synthet identifi notion captur agent commit collect action group gener success formal collabor make express mutual belief group group abil achiev state member commit achiev state stage formal process collect mental ident individu intent strengthen joint turn strengthen joint commit stage describ joint perform action section explain model deal action execut number approach cooper activ develop revisit evalu model stand bratman outlin main featur share cooper mutual commit joint commit mutual support model consist aspect model agent reactiv cognit entiti act basi mental agent mental attitud account occur social environ group term doxast motiv attitud account commit joint activ mutual support interest area investig dai compar model multiag work concentr multipl agent mental attitud coordin activ grosz krau develop formal model collabor plan mental state particip collabor activ handl complex action provid minim mental state requir group agent meet order continu successfulli perform collabor activ focu collabor plan detail collabor activ rest eventu action individu agent involv focu reason process individu agent undertak jointli commit act collabor manner formul full partial sharedplan aim provid definit collabor plan knowledg abil act commit joint activ distribut group member concentr detail articul collabor plan group action major goal work provid clear conceptu framework form collabor activ evalu term mental state social interact reason process undertaken particip idea agent involv process perform social practic reason process lead tuomela definit social practic infer schema social practic infer intent achiev state world schema practic judgement express belief mean achiev intend state number point differ schema tuomela agent perform social practic infer ident action group decid perform agent believ part mutual believ group agent hold belief agent conclud practic infer perform part action model agent reason action end practic judgement reflect form agreement group social infer agent intent group perform action base agent practic formal collabor make intent lead agent interact acquaint order reach agreement action perform group deduct infer consid account infer agent prefer plai kei role select satisfactori action conclud remark present abstract formal model social aspect recognit potenti cooper joint autonom agent pursu joint grant order decid agent abil repres maintain model mental reason agent mental influenc agent mental attitud social mental shape advoc gener mechan attempt impact agent mental state order cooper joint aim number issu hitherto neglect social scienc ai defin condit potenti initi social interact potenti recogn agent present logic model joint attitud ident individu attitud group form joint strongest motiv attitud consid joint commit formal type social reason deduct provid clear conceptu model repres structur abduct induct reason process undertaken practic distribut social environ section set number properti adequ theori exhibit briefli revisit desiderata evalu model consist unit analysi construct requir model build social construct formal languag term denot individu agent group agent agent local decisionmak apparatu extend deontic attitud mutual joint joint joint joint commit captur dynam process common social set agent autonomi captur agent entiti decid interact request accept reject request assist basi motiv autonomi captur notion agent requir agent recogn potenti cooper expect attempt agent involv cooper activ influenc mental state agent requir accept agent attempt advoc negoti agent interact order make prefer group reactiv captur agent cognit entiti endow set mental attitud repres physic social environ agent locat attitud reflect perceiv chang formal collabor make cur environ turn regul agent behaviour reactiv manner proactiv captur agent abil initi social process deem agent intent stanc perform varieti social action interact basi belief acquaint mental attitud behaviour agent model agent attempt satisfi prefer agent fulfil intent seek assist agent agent make prefer group influenc group perform prefer plan agent decid benevol move action deontic attitud social commit group jointli commit make member social commit group behaviour regul social norm constraint jointli commit make agent mutual behaviour regul expect commit act collabor manner persist joint intent perform joint activ reach joint commit mutual support joint persist intent part group close joint commun essenti explicitli consid commun notion social mental shape inher build assumpt number agent commun common social set model describ commun action term effect mean place agent mental state influenc number interact strategi base pattern commun model consist current theori commun cohen levesqu gave account illocutionari act attempt bring mental attitud particip consist model notion attempt number point agent action aim influenc acquaint mental state cooper fail model cooper grant varieti stage process formal structur model base number assumpt reflect ensur process stage success agent recogn potenti cooper unabl social mental shape process agent agent jointli commit make joint adopt intent turn incompat ongo cooper activ situat joint commit act collabor manner drop group joint made group negoti fail group closer agreement agent fail influenc answer joint practic problem found formal collabor make conflict model reflect conflict number stage conflict potenti cooper agent attempt make adopt intent incompat intent conflict negoti process agent prefer belief action perform group attempt make group perform action stabil joint commit rest group member commit group form conflict pair involv agent drop commit common joint commit exist group conflict strictli relat agent autonom agent requir decid basi differ prefer cooper activ agent behaviour regul disposit satisfi differ prefer order cooper place conflict differ prefer overcom process model explicitli identifi stage stage practic gener relat task announc orient involv recognit potenti cooper number social action interact aim gener group stage practic reason evalu phase group member search altern action give answer practic problem altern action evalu practic judgement intent gener favour practic judgement fourth stage deal negoti group member attempt group closer agreement action perform phase joint made group jointli commit perform action involv rule routin adapt anticipatori choic stage model formal structur social practic reason practic infer plai kei role maintain section infer reflect process prefer model inher encod anticipatori calcul standard stabl rule encod experienti wisdom main contribut paper formal properti social set link properti mental attitud agent involv minim mental state requir agent continu perform process combin mental model account social interact capabl formal collabor make unlik previou explicitli repres reason mechan influenc agent mental attitud behaviour interact autonom agent reason influenc integr set reconcil conflict mental attitud guid agreement gener process number issu intend address futur work refin model includ detail treatment process recogn potenti process group process negoti assum agent recogn potenti cooper attempt gener group subsequ attempt gener joint intent joint commit group realist stage account possibl agent attempt gener joint mental attitud model deal number cognit agent awar involv process emerg form cooper involv unawar agent theori account emerg social phenomena necessarili entail full mind particip jointli perform envisag provid detail account relat modal focu relat individu joint mental complex process form time process model process joint mental attitud form futur work highlight kei step process individu mental state mesh joint mental attitud ensu futur research compar evalu argument dynam influenc agent mental attitud line verifi effect argument condit lead set criteria select argument stage develop cooper indic argument type agent cooper negoti process acknowledg author anonym valuabl detail comment earlier version paper author deepli mr jane kind assist edit process refer theori practic reason american philosoph practic reason london bach linguist commun speech act mit power polit social psycholog bargain san barbuceanu coordin agent social constraint plan nation confer artifici pp formal collabor make function execut harvard bell chang attitud intellig workshop agent wooldridg ed pp bell huang dynam goal hierarchi intellig agent theoret practic rao ed pp model ration player ii econom bond ed read distribut artifici intellig san bratman practic reason harvard bratman intent morgan ed pp mit bratman share cooper activ philosoph strategi cooper distribut problem solv intern joint confer artifici pp km carlei knowledg acquisit social phenomenon instruct km carlei group approach advanc group castelfranchi individu intent group intern confer ed pp aaai press mit san castelfranchi model social action ai agent artifici castelfranchi falcon basic mental attitud collabor cognit primit ma pp rao tidhar social individu commit intellig agent theoret practic rao ed pp cavedon sonenberg social role prefer goal intern confer pp chella modal introduct cambridg clark practic infer routledg cohen levesqu intent choic commit artifici cohen levesqu ration interact basi commun intent morgan ed pp mit cohen levesqu teamwork march behavior theori firm englewood davidson essai action event clarendon intent stanc mit collect commit intern confer ed pp menlo ca coordin distribut problem solver kluwer academ lesser corkil trend cooper distribut problem solv ieee tran knowledg data montgomeri coordin distribut search hierarch behavior space ieee tran system man mose vardi reason knowledg mit franklin graesser taxonomi autonom agent intellig agent ed pp springer gallier strateg framework dialogu european confer artifici pp gasser overview dai distribut artifici theori ed pp kluwer academ gauthier practic reason oxford georgeff ingrand research procedur reason system technic ai sri menlo final phase formal collabor make griffith luck cooper plan select system engin ninth european workshop model autonom agent garijo ed pp lectur note artifici grosz krau collabor plan complex group action artifici action social group handi understand edn penguin harman practic reason review hintikka knowledg belief cornel hintikka semant proposit attitud refer ed oxford jen control cooper problem solv industri system joint intent artifici obrien wiegand busi process manag intern journal cooper inform sycara wooldridg roadmap agent research develop autonom agent tidhar werner plan team activ artifici social system select paper fourth european workshop model autonom agent castelfranchi ed pp volum lectur note artifici sycara reach agreement logic model implement artifici lesser corkil distribut vehicl monitor tool investig distribut problem solv network ai nune act eighth nation confer artifici pp levitt march learn annual review palo annual lewi philosoph studi harvard posit studi law logic reidel publish luce raiffa game john steiner understand agent perspect intern confer pp march organ theori choic perspect organ design van de ed pp wilei march simon mcclelland rumelhart parallel distribut process mit manageri strategi publish moor formal theori knowledg action read hendler ed pp morgan kaufmann san nelson winter evolutionari theori firm harvard norman jen model social bdi framework intellig agent tool asian pacif confer intellig agent technolog liu ed pp world scientif sierra jen agent reason negoti argu journal logic peirc write charl chronolog edit rao georgeff model agent bdi architectur proc intern confer principl knowledg reason fike ed pp morgan rao georgeff procedur bdi logic journal logic formal collabor make georgeff sonenberg social preliminari report decentr ai werner ed game introduct game theori basil searl essai philosophi mind cambridg sergot norm logic inform ed io du social le agent phd polytechniqu singh group abil structur decentr european workshop model autonom agent agent world demazeau ed pp elsevi scienc singh multiag theoret framework commun smith framework distribut problem solv research smith davi framework cooper distribut problem solv ieee tran system man theori condit studi logic american philosoph strauss social order san tamb flexibl teamwork journal artifici intellig tuomela theori social action tuomela miller philosoph werner unifi theori commun social structur distribut artifici huhn ed pp kaufman wooldridg approach distribut problem solv ecai european confer artifici john wilei wooldridg jen intellig theori practic knowledg engin wooldridg jen cooper problem solv journal logic von wright logic prefer edinburgh von wright freedom determin north holland publish appendix formal complet definit detail formal languag paper syntax account formula model express present semant satisfact rule formula languag defin syntax definit languag countabl constant union disjoint set point type sequenc countabl set variabl union mutual disjoint set countabl set predic symbol symbol natur number call formal collabor make oper symbol punctuat symbol comma definit term constant variabl sort term term sort time relationship action sequenc object set defin minim set denot set set set variabl constant note demand predic appli term definit syntax formula languag defin definit relat function time point interv definit defin oper dynam logic formal collabor make definit complex action defin choic semant assum actual world world set time point world thought world share common flow time repres set interv defin term time point world popul set agent group subset set group agent group relat simpl set theori agent intent belief agent relat usual map time world frame world agent time point condit captur idea set access world assum intent agent relat agent local prefer agent prefer time world associ set closest world true greater associ set closest world true set primit action type primit action world set set relationship definit domain denot set sequenc set languag quantif time relationship sequenc primit object note fix world definit interpret biject variabl biject definit model set distinguish member set set time set set set set relationship set primit action set formal collabor make agent primit centr centr centr centr agent associ set world interv interpret function final function extens predic symbol preserv ariti definit variabl defin term valuat function defin semant languag defin satisfact hold interpret structur formula languag interpret structur tripl variabl assign rule defin satisfact relat definit definit true world satisfi assign formula valid interpret rule defin satisfact relat make addit function denot set world model satisfi variabl assign defin function type set closest world true function defin return primit action refer action function defin return agent requir action st definit variabl assign satisfi formula world model written formal collabor make true iff iff iff iff iff iff iff iff iff iff iff iff iff iff iff iff differ receiv septemb
Agents/486 1 recognit militari incorpor machin learn intellig agent clinton simon goss pearc abstract view plan recognit shape oper comput requir present oper requir govern level natur reason process combin comput requir includ perform speed softwar engin ort constrain type solut softwar develop adopt machin learn provid recognit event agent provid mechan mental state recognit qualit di erent previou research architectur integr machin learn bdi agent suggest result develop prototyp provid introduct paper tool assist construct agent capabl plan recognit paper class agent agent provid comput gener forc applic subject research develop program research plan recognit undertaken simpl domain section complex domain simul explain requir place investig descript recognit section form basi detail set requir sophist intellig agent section speci cs favour machin learn implement detail subsequ section detail design technolog demonstr relat research system implement resourc bound reason de ne plan structur descript goal achiev implement complex human model system ed plan recip achiev prede ned end previou research plan recognit agent system requir agent provid explicit candid plan rao work tackl reactiv recognit problem make simplifi assumpt natur agent perfect knowledg plan complet set plan recognit attempt remain agent memori event world unchang period recognit work tidhar busetta extend function capabl type plan recognit remov fourth assumpt demonstr capabl system recogn mental state militari simul construct extens comput bdi model ad memori incorpor tempor aspect requir mental state recognit rst assumpt limit perform system attempt model human cognit provid agent perfect knowledg plan agent true heterogen system agent recogn mental state real di erent varieti agent possess explicit plan form understood agent attempt recognit complex interact set plan recognit attempt agent system provid plan agent expect recogn order recognit recogn recogn complic signi cantli complex domain quickli unwieldi signi implement agent system model warfar laird notabl implement di erent model cognit soar support view cognit provid featur assist plan recognit mental state model agent exhibit behaviour environ knowledg agent attempt achiev case agent activ cooper achiev commun explicitli coordin action commun unavail environ isa hostil agent develop model mental state agent base observ world inferenti reason plan explicit attribut bdi model relev mental state recognit agent observ attribut directli infer base observ plan structur descript action action directli observ observ environ lead primarili plan recognit infer mental belief plan recognit view import stage develop mental model agent execut plan agent capabl reason futur action agent desir predict action advanc execut agent preemptiv measur support friend counter foe greatest chanc success predict futur action requir knowledg plan underlin import plan recognit agent predict action mental model develop includ plan execut observ atom unit plan recognit accumul evid accept singl plan set gener multipl plan applic singl observ event remov ambigu agent acquir evid time evid plan reject imposs remain ambigu remov singl plan remain plan recognit successfulli complet process simpl number applic plan small discret signi di erenc plan plan recognit requir agent di erent capabl observ environ extract pattern assist trigger recognit observ process simpli ed agent concept complex plan recognit occur observ action repres outcom plan execut simultan result interleav action agent observ action di erenti singl plan sequenc action plan oper execut deal complex agent inferenti reason natur observ make natur current situat uenc interpret observ reason process set context observ process reason data emerg air combat model air oper defenc scienc technolog conduct simul oper analysi support royal australian air forc oper research ort develop support simul incorpor model air forc personnel cognit model challeng address adopt bdi model dmar softwar model human reason air combat simul place requir natur plan recognit domain present exampl di cult scenario plan recognit encount air combat domain speci characterist environ physic posit aircraft tactic emploi pilot chang quickli pilot act team de ned role team subject dynam rearrang militari scenario air combat environ hostil pilot activ attempt destroi aircraft face di culti reason incomplet inaccur knowledg sensor pilot electron surveil measur subject limit rang accuraci enemi aircraft activ emploi sensor gure illustr situat occur combat serv highlight di culti emerg domain team oper pair pilot leader coordin radar usag missil ring chanc figur show aircraft conduct intercept singleton plan recognit challeng decid aircraft coordin pair singl aircraft act oblivi exist pilot team plan plan craft adopt role act figur team tactic execut multipl pilot situat requir deal simultan threat plan execut aircraft figur show pilot engag case simultan execut plan evad aircraft intercept long plan mutual coexist challeng exist simultan execut plan simultan place posit attack evad figur multipl simultan plan ambigu figur show aircraft engag combat oppon commenc turn decid turn repres attack escap unawar presenc similarli unawar hostil awar presenc ambigu reconcil interestingli perform simultan similar previou situat execut singl plan di erent depend perspect viewer turn evad turn attack figur ambigu action plan engag pilot regularli evalu statu action highli dynam natur air combat common pilot partial drop plan rapid partial execut discard make recognit pilot action di cult figur show pilot engag typic intercept highlight extent plan switch occur attack commenc radar defeat success turn attack attack prove unsuccess case pilot adopt signi adopt plan minut radar attack attack attack figur plan switch comb environ advantag obtain deni enemi knowledg intent air combat achiev creat doubt adopt decept tactic figur show situat posit vulner attack vulner posit attack figur tactic scenario indic situat deal successfulli emploi simul observ aircraft limit primarili case close inform messag radio limit suppli sensori inform mean inform process pilot enemi tactic primarili trajectori aircraft data pilot critic concern interpret bear aircraft rel match tactic trajectori data event give clue plan enemi pilot execut missil launch warn radar mode oppon radar lock requir section examin requir plan recognit emerg analysi simul requir split oper requir decid natur air combat comput requir result human resourc construct simul softwar oper requir trajectori natur air combat primari sourc observ inform feed plan recognit process trajectori aircraft rel geometri plan recognit deal primarili type data intermedi recognit plan recognit process provid agent inform current set data type weight evid level abstract gener behaviour high level plan whilst execut plan shop rst invok car kei plan recognit capabl plan di erent level abstract structur plan recognit plan recognit structur determin plan execut determin class plan plan deriv inform agent plan preliminari wai activ seek inform dynam environ period plan recognit attempt agent capabl reason discard current attempt recognit outdat balanc recognit accuraci team team plan agent work cooper team cooper achiev commun explicit team structur team plan recogn coordin behaviour relationship action ofth member team recognit team plan ambigu case result failur plan recognit process discrimin altern recogn ambigu occur deal appropri preemptiv recognit plan recognit di erenti plan earliest moment ideal plan complet time agent reason current state plan recognit process action action behaviour predict recognit process capabl plan complet capabl provid accur insight futur behaviour expect agent execut plan comput requir real time perform agent interact human capabl real time perform plan recognit undertaken faster real time agent respond time constraint real time system complex simul system complex pilot aircraft requir sophist model techniqu manag complex result softwar balanc act requir resourc limit engin larg simul riski busi remov unnecessari complex softwar consid system integr larg invest exist agent model pilot plan recognit softwar develop modul exist model system system integr machin learn exist bdi agent section deal descript compon integr machin learn descript expert pilot explain relationship event type decomposit ying circuit recognit bind trace simul activ simul enhanc provid descript world view data trace dynam knowledg posit dynam entiti ight rel pilot motion system dynam bind di erent occur trajectori input time seri techniqu simul base statist pattern match learn handwrit gestur recognit match call speci calli adapt recogn base trajectori inform pearc recognit appli low level instrument data bind occur trace pilot behaviour algorithm unknown segment label trajectori case present system exampl trajectori simpl polygon approxim techniqu relationship trajectori segment extract relationship calcul relat rule gener explicitli depict relationship state de ned di erent state figur start bank mid finish mid turn bank figur partit match techniqu relat task descript control action inform displai extern parser event match rule descript consist syntax event relationship turn leg de ned relationship di erent event rel wind head runwai context overlap intent output interact valid partial enact sequenc simul system inexact match bayesian probabl network negoti altern rule transfer airport variabl condit detail algorithm exist agent design intellig softwar agent model command oper develop simul comput gener forc agent varieti incarn develop exampl agent formal rao georg georg dmar languag bdi model ration agenc valuabl product tool develop cognit model agent provid bene ts modular autonomi bdi model easier knowledg acquisit agent design creat model behaviour easier engin view human cognit shape commit bdi model ration agenc model basi basic framework larg simul report program support develop model extend exist research direct work heinz shown team team tactic model bdi paradigm air combat environ rao murrai investig theoret applic recognit intent lloyd describ architectur incorpor work memori human perform aspect bdi model exist model human cognit intellig agent softwar accompani current simul practic notion intent bdi model provid languag suitabl describ human make term understood softwar engin experienc maker subject model figur show standard agent architectur exist implement detail vari model model basic concept stai oper situat awar situat assess tactic select data physic model respond form complex symbol descriptor raw data recogn situat descript previou step modul assess situat base recognit previou step select tactic base current set intent implement tactic standard oper procedur choic base number team resourc figur fighter pilot agent design agent de ned situat awar data enter agent environ process higher level concept deriv data translat data belief raw numer data concept real peopl aerodynam model aircraft fuel remain piec data modi ed model fuel gaug limit number signi gure data made pilot agent actual data agent pilot tend number tactic pilot convert number higher order concept fighter pilot code word describ fuel state type languag raw situat assess situat instant time base symbol descript situat emerg previou step assess situat involv recognit enemi tactic activ adopt tactic team member tactic select situat descript select tactic emploi stage involv scan factor involv make current tactic goal larger team option accept standard oper procedur modul implement tactic repertoir agent rigid doctrin militari standard oper procedur mean detail implement tactic straightforward implement model make implement explicitli languag support bdi dmar provid suit plan agent reason goal goal agent perform attempt successfulli complet mission detail implement issu agent discuss discuss technolog issu system integr plan recognit capabl requir exist agent model agent model code suit develop model human rule knowledg base reason summari design agent provid section detail found heinz incorpor function model human observ di cult tidhar busetta develop practic plan recognit extens dmar model observ complex trajectori relationship air combat problemat machin learn appli handwrit recognit prove success spatial trajectori space algorithm base relat evid incorpor tempor aspect order prune search space dynam successfulli predict symbol complet aircraft relationship primari insight plan pilot train discov pattern aircraft trajectori report agent recognit complet simul progress continu search input agent pattern pattern match possibl report recognit achiev greater function capabl serv queri agent current statu recognit process candid remain set attempt match report indic rel likelihood event report serv queri natur rel set train exampl provid extrapol predict expect futur behaviour train recogn pattern short live distinct missil complex compound pattern involv aircraft act minut coordin team intercept recognit report agent dealt agent context speci fashion train action aircraft level fundament level report simpl left roll simpl event missil radar radar messag agent report inform feed plan recognit process type speci ed tidhar busetta learn recogn complex situat subsum plan recognit agent provid knowledg reason recognit agent ignor recognit request clarifi inform handl recognit inform highli context sensit agent knowledg reason tactic situat posit assist recognit process agent instruct restrict search subset plan believ heart architectur view plan recognit experienti observ inferenti reason machin learn suit model observ bdi system dmar suit model reason combin achiev plan recognit synergist collabor process applic plan recognit occur context speci combin inferenti reason plan belief goal intent cognit plan recognit mental state infer data environ frame queri recognit memori experienti observ experi memori recognit learn situat recognit figur system architectur system present combin machin learn system origin develop hand write recognit extens exist bdi agent model order provid requir plan recognit function previou section reveal extent plan recognit air combat domain question recogn trajectori variabl relat rel ight path aircraft absolut aircraft trajectori potenti import trajectori aircraft rel section overview account design exist agent modul integr plan provid agent reason plan recognit process output system feed directli situat awar modul develop agent plan requir undertak reason plan recognit seamlessli ad exist agent modul run separ process commun agent custom protocol plan recognit provid exist agent restructur redesign addit modi cation advantag function concept demonstr system develop test theoret idea consist ight simul pilot agent call machin learn modul connect ight simul observ agent simul presenc ying instructor guid pilot land task observ action pilot er advic action accomplish form model human pilot mental provid set plan procedur knowledg requir task land light aircraft plan guid agent recognit process observ complex relationship geometri environ bind geometri learn descript behaviour recognit di erent behaviour di erent tempor spatial scale recognit simpl pilot turn complex compound pilot land runwai instructor agent receiv inform simul instrument provid altitud standard data machin learn modul train di erent situat exampl left turn set ap instantan entir land complex minut exampl situat store librari learn exampl run simul modul continu attempt recognit ight simul develop joystick implement ight dynam model current train aircraft develop ight simul view gener set instrument effect wind model input le geograph featur build tree model ying implement dmar languag knowledg requir agent circuit respond engin failur sudden wind provid form plan plan dmar system graphic procedur knowledg requir complet task instruct pilot instructor agent data flight simul situat recognit figur system architectur plan reli extern inform execut data form data ight simul typic exampl roll pitch engin rev data typic type data pilot acquir ight instrument data machin learn modul typic exampl nish nish data exampl type data pilot infer examin environ relationship entiti plan follow progress pilot issu messag pilot guid circuit emploi integr figur show system architectur system implement silicon graphic server run data transfer process custom protocol system capabl oper free flight detach ight simul pilot free practic ying train attach train phase ight instructor attach human pilot simul instruct normal mode oper order demonstr correct function system suitabl seri task establish train exampl relev ight condit complet system trial experi task environ circuit ying standard part learn involv ying roughli rectangular figur procedur ying circuit straightforward standard type aircraft airport locat pilot commenc taxi end standard circuit pilot receiv instruct screen atyp instruct left base leg head climb train modul train ight condit circuit descent train amount ying aircraft provid exampl ight condit practic number exampl limit ve train store exampl build store experi provid recognit ight condit futur instruct flight instruct ight pilot simul circuit guidanc agent ight condit encount map experi announc recognit instructor agent instructor agent process inform inform current posit circuit pilot task perform pilot continu obei instructor agent aircraft safe land result train di erent ight condit number train exampl limit ve di erent pilot train leg base leg land final leg leg climb figur circuit fly ew aircraft control pilot perform train pilot ew circuit permut trainer pilot attempt successfulli identi ight condit error instanc accur circuit ying pass inform recognit process agent inform assist model pilot mental state agent successfulli guid pilot circuit provid real time advic action pilot warn perform essenti provid advic time fashion case agent process data inform requir circuit poorli unabl match train exampl error ight condit consciou ort made poorli success whilst import success secondari gener aim test comput feasibl connect model behaviour model behaviour constraint real time system ight condit train su cientli di erent task discrimin phase ight di cult compar applic put real success experi demonstr potenti machin learn system model behaviour link rule model simul tabl revisit requir section requir speci plan recognit test preliminari phase examin detail futur work phase research involv recognit complex includ thing team behaviour team complex smaller complex scenario result ambigu phase extend integr recognit process tightli agent explor issu relat intellig recognit system agent server queri state world preliminari experi con rmed potenti machin learn cooper perform experi test featur system paper requir test oper test statu trajectori success intermedi recognit phase level abstract phase structur plan phase dynam environ success team team plan phase ambigu phase preemptiv recognit success behaviour predict success comput test statu real time perform success complex success system integr success tabl test requir section plan system requir integr varieti technolog order satisfi requir level capabl practic softwar engin constraint signi softwar engin advantag li remov agent explicitli provid plan recognit machin learn demonstr explicitli code issu test train process mainten store train exampl signi issu indic reduc ort requir engin agent system requir compon paper highlight plan recognit requir simul system meet requir system implement incorpor machin learn intellig bdi plan recognit test potenti dispar technolog function prototyp test environ construct test environ select human loop ight simul result system function successfulli test undertaken rigor test schedul plan futur provid detail inform system abil meet requir laid mesh machin learn provid function real time system minimum softwar engin ort futur work focu extens techniqu area extend test includ recognit team plan team structur occur social complex environ provid plan recognit requir involv larg group aircraft recognit trajectori larg skill base behaviour regard skill base percept part total repertoir observ behavior work potenti provid behavior clone techniqu integr skill base action bdi agent complex environ greater comput demand softwar order maintain perform develop recognit algorithm comput cienci agent develop acknowledg author gil tidhar thought comment futur mike insight cognit valid murrai continu support research program refer behaviour clone control skill machin learn data method page tidhar extens dmar recognit intent technic air oper contractor wooldridg formal speci cation dmar intellig agent fourth intern workshop agent architectur languag springer cross agent model air warfar australian joint confer arti cial intellig rosenbloom architectur gener intellig arti cial nielsen coordin behavior comput gener forc fourth confer comput gener forc behavior lloyd simul human characterist oper studi research report heinz air combat tactic smart air mission model heinz advanc oper reason tactic analysi confer turner air defenc oper analysi model oper research symposium newel uni ed theori cognit harvard pearc interact match induct comput vision imag goss learn structur di erent domain lectur note arti cial pearc relat evid theori spatial interpret procedur phd school perth georg rao georg model ration agent intern confer principl knowledg page morgan kaufmann san rao murrai recognit applic model distribut ai lake rao plan recognit theori reactiv recognit technic report australian arti cial intellig june rao uni ed view plan recip technic report australian arti cial intellig august intellig agent interact simul environ ai spring fly train manual ight brie ng air aviat theori centr pty fly model air team journal appli
ML/487 6 induct approach verifi cryptograph protocol lawrenc comput laboratori cambridg street cambridg england decemb minor novemb abstract inform argument cryptograph protocol secur made rigor induct definit approach base ordinari predic calculu cope system proof gener human effort requir analyz protocol week yield proof script minut run protocol induct defin set trace trace list commun interleav protocol run protocol descript incorpor attack loss model spy privat kei forg messag compon decrypt previou traffic protocol analyz ree protocol variabl prove event ev event ev properti hold provid remain secret properti prove viewpoint receiv final messag session kei convei good content content introduct overview induct method messag oper synth attack model protocol standard rule induct regular lemma secreci theorem find attack mechan theori messag agent messag defin synth deriv law govern oper rewrit rule symbol evalu event intrud knowledg prove possibl properti prove forward lemma prove regular lemma prove theorem prove secreci theorem prove session kei secreci theorem prove authent prove simplifi protocol protocol attack model protocol prove prove machin proof analyz strengthen protocol protocol authent protocol deviat protocol model protocol model server ii content main result prove potenti attack relat work introduct cryptograph protocol intend agent commun secur insecur network obviou secur goal spy read content messag intend import messag alic nonc timestamp give correct indic fresh paper discuss denial servic typic protocol make contact deliv kei parti involv surprisingli hard problem combinatori complex messag intrud gener problem properti protocol intend achiev anderson excel tutori present exampl defin terminolog formal method analyz secur protocol popular approach state explor belief logic state explor method model protocol finit state system exhaust search check reachabl state safe low interrog special tool attack quickli state space small requir drastic simplifi assumpt belief logic formal agent infer messag receiv origin logic abstract proof identifi protocol flaw miss belief logic address weak simplic fruitfulli borrow concret notion send idea deriv messag protocol formal set list event send agent extend trace permit current trace agent true sender messag forward item read agent activ attack properti prove induct theorem prover isabel analyz protocol requir explor effect chang exist protocol hour law proof techniqu develop protocol applic gener approach orient prove absenc attack discov attack variant protocol suggest burrow al page overview induct method unawar mao earlier attack attack structur proof yield insight protocol paper describ overview detail protocol analyz illustr model illustr model authent protocol demonstr deal authent relat work discuss overview induct method inform argument correct conduct term happen hypothet salesman end alic bob possibl session kei custom salesman read certif alic custom attack trick bob accept kei share salesman identifi nonc prevent custom find argument made rigor formal tool induct definit induct definit list action agent system perform induct rule reason consequ arbitrari finit sequenc action induct long semant program languag cope nondetermin conceiv applic induct pioneer proof secur model capabl attack oper return compon set messag model decrypt past traffic kei model forg messag attack term synth algebra law govern synth prove induct invalu reason protocol induct protocol definit model behaviour honest agent faithfulli execut protocol step presenc attack model agent reveal secret messag inher nondetermin model possibl unavail belief logic short main reason mechan elimin human error induct verif protocol involv long detail proof safeti properti prove induct protocol case consid state system reach protocol step simplifi safeti properti case reveal combin circumst lead violat case cover properti prove custom stop tamper nonc step send alic wrong salesman experienc talk messag tradit protocol notat ideal mechan express concaten invit set machin syntax fat brace express inform protocol descript omit brace encrypt notat ka individu protocol descript rest common theori messag analysi messag item includ agent nonc kei compound messag hash messag hash encrypt messag kx kei equal express symmetr kei theori assum nonc sequenc number timestamp regard random string encrypt messag alter read type compon includ redund messag bodi satisfi assumpt overview induct method publish attack involv accept nonc kei compon alter model admit type explicit protocol cheapli prevent oper synth oper defin possibl infinit set messag defin set close extens extend set messag item deriv initi knowledg histori messag trace set part obtain repeatedli ad compon compound messag bodi encrypt messag regard kei part kx part repres set compon potenti addit kei prove part establish occur hash fact prove kx part part part part set obtain repeatedli ad compon compound messag decrypt messag kei set repres glean break learn listen fact prove kx part set synth model messag spy build element repeatedli ad agent form compound messag encrypt kei agent ad publicli nonc kei ad spy nonc kei fact prove synth kx synth synth attack attack enemi observ traffic set send fraudul messag drawn set intercept messag model messag protocol demand perfect compet player spy hold commun agent suffer model spy control unspecifi set hold privat kei protocol descript includ oop event loss session kei spy accept honest agent send normal protocol messag secret send fraudul messag combin particip protocol run intercept imperson agent spy protocol common bodi law tactic proof tactic prove case induct automat model protocol event trace form mean send messag event note mean store event replac kei state repres initi knowledg privat scan list event agent read messag address event note ax visibl spy variant protocol page ka ka kb ka kb ka contact gener na identifi run forward messag authent ad nonc gener session kei packag separ decrypt part messag check nonc forward rest similarli compar nonc accept protocol step model extens trace event server constant variabl rang includ spy transcrib step overview induct method ev na fresh nonc agent distinct ev extend event ka ev trace event form nb fresh nonc ev extend event kb shown event messag compon intend encrypt kei shown attempt read ev trace event form ka kb fresh kei ev extend event ka kb server messag decrypt compon kei reveal item accept messag valid repli ev trace event kb kb ev extend event agent receiv messag expect decrypt check nb nonc forward compon sender messag shown messag rule messag recent hold fresh nb standard rule check nonc confirm session implicit step suffic prove authent certif receiv step tl model includ rule session confirm order support resumpt past session assum messag step receiv identifi send messag step receipt satisfactori messag step model forc agent trace send respond interpret trace indic reject agent particip protocol run trace repres state run respond past matter respond number protocol safe liber remain safe check ad agent respond recent messag prevent model attack exclud trace weaken theorem prove trace standard rule protocol descript requir addit rule empti trace rule model fake messag accid ev fraudul messag ev extend event spy bx messag past trace includ initi hold kei arbitrari set agent spy plausibl masquerad bad agent tl protocol arriv session kei exchang nonc appli function model tl assum function arbitrari inject protocol agent appli function spy addit rule appli function messag item protocol kei comput requir analog rule ev trace distribut session kei run involv nonc na ev extend event note spy overview induct method oop model loss session kei assur lost kei futur run oop messag includ nonc order identifi protocol distinguish recent past loss oop rule bring hidden properti light clear oop express induct specif defin set trace set close rule recal set natur number induct defin rule reason induct defin induct principl set usual mathemat prove natur number prove prove set induct principl hold trace ev provid preserv rule creat trace prove cover empti trace prove assert form event ev messag trace extend ev event event ad front rule resembl list consid conceiv protocol trivial induct prove agent send messag trace event form hold empti rule condit prevent creation event regular lemma lemma concern occurr item messag compon theorem form part set messag spy strong hold spite spy easi prove spy hold exclud bad agent induct proof amount examin protocol rule observ involv send kei spy send induct bad agent secreci theorem result state nonc session kei identifi messag natur expect server session agent nonc item straightforward prove kei part messag determin valu part secreci theorem regular lemma easi prove state term part oper secreci secret agent secreci theorem state term proof long typic split case kei typic result involv state spy hold session reveal suffic prove send messag form claim spy send messag make agent send learn session work possess discuss suggest form theorem obtain session kei previou obtain traffic protocol step introduc proof induct requir strengthen gener set session kei session kei theorem prove theorem form hardest task analyz protocol huge case analysi result processor time requir exponenti number kei encrypt singl protocol messag bit creativ yield substanti simpl essenti proof script work theorem make explicit agent session kei encrypt kei gener theorem prove secreci nonc session kei secreci theorem state server distribut session kei spy kei spy treat respect honest conclud agent kei accid theorem stipul oop messag session kei spy forbid oop messag involv current protocol vulner replai attack overview induct method secreci properti prove command constant problem secreci proof present formula discard amount inform carefulli induct formula express find attack secreci suffici correct server distribut kei wrong pair agent receiv messag simplifi version protocol outlin answer secur part messag encrypt ka origin encrypt part messag origin receiv fraudul messag previou na substitut nb machin proof lead scenario na role easi invent attack intercept messag record na masquerad ca server issu session kei packag na kei masquerad cb ka kc cs kc ka ca kc ka ca kc ka cb ka replac nonc na na messag eventu accept kei kei talk na origin nonc attack discov mao boyd server detect repetit nonc occur origin version nb encrypt messag nonc assur identifi princip verifi bind complic formal proof correct na nb uniqu identifi messag origin coincid prove receiv expect nonc server distribut session kei intend parti mechan theori messag approach mechan instanti gener theorem prover isabel logic isabel support induct defin set automat tool isabel syntax order convei feel proof conduct methodolog tailor isabel make heavi classic reason modifi suit higherord logic prover pv hol prover provid simplifi condit rewrit rule perform automat case split express form set theori algebra law synth lost hol predic make satisfactori finit list polymorph type system resembl item type agent type msg expect type infer elimin type express law rewrit type automat agent messag kind server friendli spy friendli agent form friend natur number declar specifi type agent isabel call server nat type natur datatyp agent server friend nat spy datatyp declar creat union inject rang disjoint kind agent friend spy friend friend friend kind messag item declar essenti shown observ type agent type msg shown declar make abbrevi datatyp msg agent agent number nat nonc nat kei kei msg msg hash msg kei msg kind messag agent nonc inject nonc kei simpli type mechan theori messag coercion datatyp creat hash hash hash encrypt strong inject yield law kx spy alter encrypt messag decrypt relev kei violat rsa redund incorpor form encrypt loss inject complic theori defin synth oper synth defin protocol set messag part set includ close project decrypt defin set close rule part part kx part part part defin set includ close project decrypt kei kx synth defin set includ agent close hash encrypt agent synth number synth synth synth synth synth hash synth synth kx synth illustr syntax deriv law govern oper const msg set msg set induct fst decrypt isabel defin prove desir rule includ introduct rule constitut definit case analysi induct definit part make part hash part kx inconsist typic privat kei includ hash serv encrypt messag prove privat kei part basic lemma prove deeper properti deriv law govern oper section present law prove protocol verif requir examin systemat mechan prove definit oper part part synth synth equat build break result trivial synth synth consid combin involv oper remain irreduc model mechan theori messag fraudul messag spy deriv prove law deriv bound enemi part typic set messag trace rule elimin fraudul messag yield upper bound part bound induct hypothesi analog rule rewrit rule symbol evalu appli rewrit rule term transform set agent form evalu deal partial argument symbol evalu part straightforward protocol step send messag typic subgoal express previou section discuss case fraudul agent agent agent agent expand big express involv element insert set part agent sound subgoal kei simplifi kei part shown element form kei isabel theori repres set insert similarli insert rewrit rule symbol evalu element subgoal simplifi manag kei part rule symbol evalu part fairli obviou straightforward induct proof part symbol evalu difficult defin set kei decrypt messag def kx kei pull decrypt rewrit rule encrypt messag involv case analysi match kei nest encrypt give rise nest express relev kei automat tool gener full case analysi short proof script imposs case remov quickli redund case simplifi simplifi result express symbol evalu express term invok induct hypothesi rewrit relat simplifi case agent forward agent messag visibl previou traffic mechan theori messag symbol evalu synth result infinit simplifi assumpt form synth messag fraudul induct definit nonc kei give rise implic nonc synth nonc kei synth kei kx synth kx synth rule encrypt messag replai similar rule hash synth fact mention section theorem prove synth store isabel appli automat simplif logic proof complex averag command automat tool full proof execut event intrud knowledg trace list form note ax event trivial declar datatyp datatyp event agent agent msg note agent msg assum environ agent share server spy kei redund function specifi initi knowledg spy kei agent set bad def kei def spy def function spi model set messag spy trace messag network intern note bad regard control empti initi state recal list consist ev prefix list ev spi def spy spi def ev spi def ev bad spi ev function spi describ view traffic order formal messag spoof formal protocol rule mention previou messag directli set ev formal notion fresh set includ part messag held privat agent kei fresh differ kei def def ev def ev section discuss model protocol detail specif suppli theorem prover identifi left nil empti fake fraudul protocol oop loss session kei set trace constant nil rule examin fake condit ev state ev exist trace denot messag forg spy decrypt recal hold bad privat kei spy send forg messag agent includ server rule addit ensur agent send messag trivial fact elimin imposs case proof rule formal step list current trace simpli ev user subgoal arisen rule induct nil fake ev synth spy ev nonc na agent agent agent agent nonc nb agent agent set server agent agent nonc agent agent kei server agent agent agent agent nonc agent agent set server kei kei server agent agent nonc set kei set oop server set note spy nonc kei figur protocol prove possibl properti nonc na agent mean gener fresh high probabl random byte rule set denot set strip tempor order agent respond past matter restrict rule ensur respond messag current proof requir prevent detect replai attack rule discuss translat inform protocol notat isabel format suffici straightforward autom prove possibl properti theorem prove protocol descript possibl properti assur messag format step prove agent forc act protocol proce messag transcrib incorrectli possibl properti agent distinct kei nonc trace final messag ka theorem prove join protocol rule order show precondit met prove forward lemma result prove reason step agent forward unknown item rule agent ev proof trivial spy transmit find spy learn respond messag forward parti remov layer reveal spy forward lemma state part theorem state part nest oop rule remov layer messag spy forward lemma state act add kei ev prove regular lemma statement form condit messag lemma prove appli gener case protocol step oop step forward part appli forward part express term part prove trivial nil case standard automat tactic simplifi remain case isabel programm user defin tactic perform task return remain subgoal fake case prove automat basic regular law state secret kei remain secret ev ev bad command gener proof prove theorem fresh session kei nonc uniqu identifi messag origin exclud possibl spoof wai case session typic formul refer event server sender ev na nb na nb ev na na nb nb free occurr event uniqu determin compon shown appli theorem requir proof messag question origin server altern presum exist messag encrypt secur agent agent prove secreci theorem ev trace bad spy perform encrypt lack kei free occurr na messag determin ident obtain encrypt kei secret built prove formul regard regular lemma proof hard gener prove secreci theorem section discuss session kei theorem obtain set session kei obtain messag theorem formul arbitrari trace ev arbitrari set session necessarili present trace hand side simplif replac distribut render theorem trivial direct trivial prove theorem daunt task techniqu make prove secreci theorem routin appli induct step forward part appli forward express term simplifi rewrit rule evalu pull agent nonc compound messag perform automat case split encrypt messag fake case prove standard argument involv properti synth argument program work protocol investig session kei effort secreci theorem requir detail argument chief prove nonc nb protocol remain requir establish correspond nonc kei prove session kei secreci theorem theorem state protocol correct viewpoint ev bad server issu kei ev kei lost oop event involv note spy ev kei spy secreci theorem slightli harder prove previou step possibl messag mention theorem statement session kei induct hypothesi yield result isabel prove step case automat oop case show oop messag involv involv na nb requir session theorem discuss previou section full proof script consist command execut gener proof step prove authent session kei secreci theorem hold protocol variant attack correct receiv expect server messag form agent condit confirm certif authent prove complet secur appeal session kei secreci theorem correct protocol differ messag encrypt ka ka kb ka kb ka receiv step inspect certif encrypt forward runtim measur pentium ii human gener shorter proof omit irrelev step prove authent state trace event form kei messag agent agent agent agent server correct instanc step theorem establish compon messag tamper session kei secreci theorem appli check nonc assur good kei talk subject condit secreci theorem lemma prove induct resembl regular lemma main certif kei proof requir subsidiari encrypt part messag suitabl version messag nonc nb uniqu identifi compon messag encrypt part discuss nonc na nb protocol run bad element agent agent agent agent proof complex nonc bind encrypt messag step ident format safe conclud receiv messag trace messag form kei recal send messag agent agent agent agent server messag correct nb statement consid nonc compar messag proof requir prove induct lemma main kei detail nonc prove simplifi protocol abadi needham suggest simplifi elimin encrypt messag nonc serv bind messag explicitli intend recipi ka kb ka author claim page protocol effici conceptu simpler machin proof support claim vital trivial prove nonc uniqu fact prove proof script smaller run faster protocol slightli weaker origin lack encrypt messag intrud masquerad learn session kei origin protocol assur present prove protocol origin version assur replai messag burrow al note page obviou choic demonstr induct method protocol research investig low discov subtl flaw protocol attack full protocol consist devot distribut public kei burrow al identifi flaw proof command model protocol part public kei fresh assum public kei reduc protocol kb ka kb messag assur decrypt kb extract nonc na messag assur presenc burrow al claim na nb share secret comput session low refut note ran protocol enemi start run agent masquerad argu attack agent talk enemi expect mechan analysi present reveal adequ reli stronger assumpt mere honesti attack occur talk honest agent privat kei low suggest simpl fix good model protocol agent public kei privat kei spy bad privat kei privat kei coincid public kei model resembl start figur present induct definit protocol step standard ident oop messag protocol distribut session kei happen nonc protocol step current na fresh nonc agent distinct add event current trace event form nil fake ev synth spy ev nonc na agent nonc nb agent set nonc set set figur protocol nb fresh nonc add event write sender mean messag current trace event add event ab decrypt messag check na nonc repli challeng send back nb mention model implicit fourth inspect messag arriv suffic prove theorem state infer present prove nonc remain present spy prove na messag proof properti na na na separ run messag form nonc na uniqu determin agent traffic lemma assum na secret form part induct proof na secret hold honest agent unpredict nonc neglig probabl step messag origin provid expect nonc consist attack consid run princip run protocol spy void low found problem protocol viewpoint attack concern prove situat symmetr prove induct nb remain secret authent isabel proof script theorem work trivial alter easi prove nb messag form uniqu determin na nb remain secret attempt prove secreci leav subgoal past send messag agent subgoal describ consist set attack detail weaker properti prove send nb step nb remain secret receiv nb step present proof usual argument assum messag form addit nb remain send step receiv repli contradict receiv result form impli impli receiv messag suggest gener strategi prove decrypt messag form presenc prove perform step messag agent nonc na ev nonc nonc na ev agent agent agent nonc na ev agent ev nonc na agent nonc ev nonc ev figur notat item remain secret conclud reveal perform decrypt procedur mere act decrypt weaker exhibit sign messag nonc broadcast signatur assur presenc machin proof give impress isabel present theorem provid number lemma state na nb prove induct machin proof lemma state na instanc messag determin compon standard proof script corollari previou lemma trivial proof lemma refer presenc encrypt messag past traffic remain theorem refer event form involv encrypt messag crucial theorem secreci na condit bad bad express proof reli previou assum secreci na induct hypothesi theorem final na start run receiv messag messag subject proof induct reli secreci na proof script theorem command execut ten theorem attempt prove secreci nb lead subgoal proof agent set nonc set nonc set nonc nb situat event instanc step trace call agent na start run messag show circumst simplifi form claim nb remain secret step messag messag reveal nb spy proof state hard interpret induct formula requir addit lemma easili recogn attack assumpt describ event nb remain secret protocol analyz strengthen protocol low suggest improv protocol ad explicit step agent includ kb ka kb previou proof work version high level minor seldom exist proof prove prove natur seek strengthen properti nb state nb presenc step uniqu determin messag compon step form nonc nb determin na addit fact prove secreci nb recal subgoal present version messag agent messag theorem nb impli contradict protocol protocol gener arbitrari number parti contact contact authent server run resembl contact agent chain arbitrari length form agent add fresh nonc request messag sake extend chain contact authent server server gener fresh session kei gener kei pair agent adjac chain session kei authent protocol figur authent protocol client bundl agent remov certif forward rest predecessor chain receiv protocol hard analyz number number parti number session kei vari accumul request program properti prove obviou simplifi protocol distribut singl session common agent chain secur depend honesti agent possibl applic weak give separ session kei adjac pair prove gener particip receiv certif session kei spy kei isabel proof modest scale fewer result run minut authent protocol protocol invent john bull descript hash hash pair share kei messag enabl server check origin agent figur show typic omit hash agent start run send protocol ka share na fresh isa placehold indic messag start run send similar messag step repeat time desir compon ad messag messag digest prefix termin agent perform step server destin step server prepar session kei pair accumul request build caller final request arrow point occurr outer level call call server gener session kei kc prepar certif kc kc session kei kc redund share kc server includ agent chain treat agent initi receiv session kei dealt server discard remain outer request messag server prepar certif kb kb note intend nonc nc encrypt kei request messag token end request server gener session kei certif ka process request server return bundl certif return certif kc kc kb kb ka deviat protocol step agent accept certif forward rest predecessor chain agent perform step start run kb kb ka ka descript describ special protocol run client convent protocol notat cope arbitrari number process nest messag section protocol induct definit deviat protocol correct flaw origin protocol formal protocol differ origin origin certif distinguish order intrud easili exchang correct ad certif explicit good engin practic simplifi proof bull accept chang protocol dummi session kei kc avoid treat agent special case agent certif implement safe omit dummi certif remov inform system make inform intrud origin protocol implement encrypt hash verif encrypt primit correct protocol depend form provid implement origin xor flaw protocol certif accompani agent clear safe simplifi specif omit model protocol request protocol form request notat messag digest trivial defin proof appli definit directli default rewrit rule appli argument express simplifi rule prevent exponenti blowup protocol law subject messag spoof iff suitabl messag digest nil recur fake ev synth spy ev recur nonc na agent nonc agent recur nonc nb pa set agent nonc recur server pb set respond server rb recur agent agent nonc agent agent nonc set agent nonc agent nonc set recur figur protocol protocol model protocol discuss figur present induct definit rule empti trace spy standard rule current na fresh nonc agent distinct add event model protocol kei written token fix messag current trace event pa nb fresh nonc add event variabl xa hash kei verifi compon run form nest depth agent server specif omit equat defin pa omiss simplifi proof hold weaker protocol agent react messag send instanc step request server ignor current trace event server build request pb add event construct rb includ verifi integr process defin rule constrain agent server send proof requir detail current trace event add event bar decrypt compar nonc nb forward remain certif final step protocol accept implicit step certif prove authent protocol oop messag easili express authent protocol kei nonc spy hold session kei kei agent model server server creat list certif induct definit defin set trace set tripl session kei tripl belong set respond ev current suppli prevent session kei compon return newest session kei caller certif kei ev agent nonc agent agent nonc agent respond ev con respond kei kei part pa agent nonc server agent nonc agent nonc agent nonc respond ev figur server occurr hash definit ensur server accept request verifi hash knowledg kei induct definit consist case fresh kei respond ev base case handl end request seek session kei respond ev fresh ev main result prove respond ev case handl request list seek session kei contact respond relat understood pure prolog program argument pa ra output kei includ ra includ certif induct definit serv logic program concept ture express complex behaviour program easi reason coarser model server respond needlessli complic input list output list certif routin lemma hold list certif form induct relat gener set list server imposs base case simpli ev case ev ev ev secreci theorem express term occurr case result substanti blowup simplif induct introduc induct respond introduc includ invalid theorem prove respond main result prove analysi resembl protocol possibl properti prove regular lemma secreci theorem govern session lead session kei secreci certif part reach spy theorem certif origin server protocol possibl properti logic trivial messag format compat machin proof requir effort due complex term number choic prove case run agent server spy gener theorem agent prove induct effort justifi typic regular lemma state kei agent form part messag form part hash recal discuss secur properti induct protocol definit main induct set defin term trivial proof requir induct definit result reduc justifi induct respond ev rb ev result harder prove protocol prove theorem requir command induct simplif outer induct yield protocol base fake case induct replac step case base case induct step subgoal surviv simplif theorem difficult proof nonc gener request uniqu hash kei agent nonc na agent agent theorem import agent identifi run nonc theorem appli gener step step step requir theorem reason theorem work symmetri nest request affect reason session kei theorem formul ree proof difficult induct respond lead excess case split simplifi proof defin set main result prove session kei unusu complic kei certif certif creat iter respond theorem state certif form certif form nb respond ev agent theorem strong agent receiv certif immedi learn agent receiv subject secur kei hope session kei secreci theorem follow messag session kei part kei safe spy reason amount induct messag protocol theorem state agent kei induct larg straightforward step case induct respond lead complic prove lemma respond ev na bad bad agent kei session kei format singl set proof appli certif symmetri halv effort compar relat work instruct theorem isabel syntax session kei ev rang kei session kei secreci agent part ev recur kei potenti attack proof subject assumpt implicit model attack protocol implement expect step agent messag evid present spy masquerad replai messag read result certif kei type pass nonc admit attack form certif mistaken authent protocol safe attack form certif encrypt secur origin session kei encrypt form xor hash pad hash session kei encrypt form immedi obtain session kei reveal relat work research induct trace model verif theorem prover model hand earli analyz protocol jo specif base logic anim identifi weak protocol model system defin initi state state secur goal invari prove state transform preserv invari style reason induct grai mclean establish secur invari work base tempor logic proof hand work base proof checker model fraudul messag formal model state agent spy formal protocol server function session particip server issu prove properti resembl forward lemma state secret kei ka kb remain similar regular lemma properti state decrypt traffic session kei model restrict constant fix role initi spy start hold prospect imperson honest agent decrypt messag note attack work give accept kei talk approach base process calculu csp examin work origin model agent spy model realist engag concurr plai spy ident kei low discov numer found paper develop isabel model paper make direct comparison examin variant protocol discuss differ speed nrl protocol analyz report possibl nonc attempt state space larg protocol analyz perform unusu combin search proof base state prove induct infinit set state unreach full analysi carri assur formal proof relationship induct examin schneider base work csp model appli law csp proof rank function describ undesir event prevent prove theorem rank function establish properti question schneider publish detail hand origin protocol version consid number authent properti increasingli gener ultim concurr run schneider mechan hand reveal error bryan schneider prove simpl properti singl run authent protocol schneider consid consequ messag satisfi equat law messag algebra properti encrypt rsa induct method simpl gener handl version version public protocol analysi reveal discov attack variant addit protocol discuss analyz variant simplifi version version base session kei encrypt kei complic analysi model part internet protocol tl secret nonc comput session kei proof highli autom isabel command gener thousand infer small protocol involv small proof script analyz hour protocol week figur includ time spent extend model encrypt hash adher design principl explicit simplifi proof model check effect mean find attack replac theorem prove cope finit failur find attack protocol work induct proof symbol examin protocol step analyz turn reason explain understand protocol cope circumst protocol proof script version form start point analysi script minut competit model check method complement protocol design model check quick inspect appli induct approach investig deeper properti formal method secur theorem easili misinterpret correct point flaw version correct point particip detect tamper proof script distribut obtain url refer protocol proof separ reason particip attack protocol sober remind limit formal method model ideal real assum strong encrypt make model detail make reason harder composit approach level protocol cryptograph transport verifi separ approach challeng acknowledg needham gave valuabl advic due bull explain protocol gordon suggest simplif treatment fresh ryan wagner anonym comment draft articl research fund epsrc grant tempor esprit work group refer abadi roger needham prudent engin practic cryptograph protocol ieee transact softwar januari peter introduct induct definit handbook mathemat page ross anderson roger needham program comput jan van comput scienc recent trend lnc page lawrenc isabel prove properti authent system approach formal verif cryptograph protocol acm confer comput commun page acm formal verif cryptograph protocol technic refer stephen hol extens automat analyz cryptograph protocol comput secur foundat workshop page jeremi bryan steve schneider pv authent protocol john bull david authent protocol technic report defenc research needham logic authent royal societi john clark jeremi jacob secur recent protocol inform process comput secur foundat workshop ieee comput societi comput secur foundat workshop ieee comput societi tim christoph allen tl version januari request internet bruno steve schneider pv csp verifi authent protocol gunter ami theorem prove higher order lnc page dieter entiti symposium secur page ieee comput gordon introduct theorem prove environ higher order logic cambridg jame iii john mclean tempor logic verifi cryptograph protocol comput secur foundat workshop page matthew hennessi semant program elementari introduct structur oper semant refer hoar commun sequenti process richard catherin jonathan system cryptograph protocol analysi journal richard analyz encrypt protocol formal verif techniqu ieee journal select area low break fix protocol csp tool algorithm construct analysi intern lnc page low attack secur protocol comput secur foundat workshop page low case studi csp detect error secur protocol technic oxford comput low compil analysi secur protocol journal comput mao colin boyd formal analysi secur protocol comput secur foundat workshop page ieee comput societi catherin analyz comparison approach comput secur lnc page catherin editor workshop design formal verif secur protocol septemb sam john friedrich von henk formal verif design pv ieee transact softwar februari lawrenc relat formal protocol journal comput secur press refer lawrenc gener theorem prover lnc lawrenc ml work programm cambridg lawrenc gener automat proof tool robert autom reason essai honor larri chapter mit lawrenc induct analysi internet protocol tl acm transact inform system august lawrenc tool support logic program manfr mathemat method program summer school nato asi seri page publish method obtain digit signatur commun februari model verifi protocol csp comput secur foundat workshop page peter ryan design verif secur protocol technic report defenc research peter ryan steve schneider attack authent tale inform process januari steve schneider verifi authent protocol csp comput secur foundat page ieee comput societi
IR/488 5 power word cluster text classif school comput scienc engin interdisciplinari center neural comput hebrew israel tishbi school comput scienc engin interdisciplinari center neural comput hebrew israel abstract recent introduc inform bottleneck method inform theoret extract featur relev valu variabl previou work suggest appli method document gene express data spectral analysi work present implement method text classif appli inform bottleneck method find preserv inform document categori cluster featur classif previou work similar cluster procedur show significantli reduc featur space minor chang classif accuraci work present similar result show train sampl small word cluster yield improv classif accuraci perform word directli introduct automat classif document increasingli import tool handl exponenti growth onlin text algorithm suggest task past year common approach start evalu matrix word versu document train data count matric tend highli train data small document repres featur optim classif algorithm standard procedur reduc featur featur select approach select subset select word featur classif latent semant index probabilist lsi method reduct inform retriev task altern approach reduc featur group word smaller number cluster featur crucial stage procedur determin word recent introduc inform bottleneck method show give question formal optim solut lean pure inform theoret ib method base simpl idea empir joint distribut variabl compress mutual inform variabl preserv method consid find minim suffici partit effici relev code variabl respect applic implement method varieti includ gene express data analysi classif galaxi spectral properti document cluster variabl correspond set document set word stage captur inform set document extract stage featur cluster document manner empir result show significantli improv accuraci document classif natur question work word cluster provid improv classif accuraci document label case addit variabl document categori text classif task predict variabl term maxim string charact european colloquium inform retriev power word cluster text classif word cluster preserv inform relev categori variabl procedur simpl find preserv inform categori cluster repres document featur space space classif algorithm predict categori document previou work baker mccallum similar approach classif document base shown significantli reduc featur small chang classif perform work start achiev similar ib framework theoret found procedur motiv understand strong result case situat featur extract procedur yield improv classif answer fact statist robust origin word statist word statist hard advantag situat amount label train document small label document categori practic situat amount label data satisfactori experi suggest situat lead improv classif word featur inform bottleneck method cluster algorithm start point distort measur data point class centroid distanc matrix distort cluster task adapt wai optim problem consist find small number class low distort high connect main problem approach choic distanc distort measur arbitrari sensit specif reflect inaccur structur compon high data natur measur similar word similar joint distribut topic variabl set word set topic document word categori defin number occurr word categori calcul simpli sum occurr word train document belong categori denot document set number occurr word document roughli word similar distribut categori belong cluster mention intuit simpl word similar distribut plai similar role classif cluster formul find cluster hierarchi member set base similar condit distribut wrt member set introduc call issu select distanc measur distribut unresolv earlier work principl approach avoid arbitrari choic distort distanc measur empir joint distribut random variabl compact preserv inform relev variabl simpl intuit idea natur inform theoret find cluster member set denot mutual inform constraint inform extract european colloquium inform retriev power word cluster text classif mutual random variabl symmetr function log consist statist measur inform variabl variabl vice compact determin qualiti measur fraction inform captur gener problem exact optim formal solut assumpt origin joint distribut solut term distribut cluster prior probabl membership probabl distribut relev membership assign probabl inform bottleneck principl determin distort measur point log diverg condit distribut formal optim solut equat solv exp normal singl posit paramet determin classif procedur inform compact cluster forc repres part wrt mean principl find word denot maxim amount inform preserv agglom inform bottleneck algorithm shown simpl implement inform bottleneck restrict case cluster case word belong cluster correspond limit eq yield natur distanc measur distribut easili implement agglom hierarch cluster procedur denot specif distribut easili evalu mutual inform set word cluster gener framework appli agglom greedi hierarch cluster algorithm algorithm start trivial partit jw singleton cluster element step merg compon current partit singl compon local minim loss mutual inform formal defin optim cluster solut mean word assign normal probabl account natur languag properti word natur appli approach algorithm exist directli solv optim equat eq preliminari test show algorithm tend produc similar sake work focu simpl cluster algorithm european colloquium inform retriev power word cluster text classif equat mutual inform due merger defin inform valu algebra js function js diverg defin js case fp equal argument ident upper bound symmetr metric note interpret multipl merg js introduc inform optim criterion result similar measur directli emerg analysi algorithm simpl step perform merg cluster minim figur provid pseudo code agglom procedur naiv classifi turn describ classif algorithm work naiv classifi induc classif rich empir support context document classif simpl detail analysi effect word featur work prefer concentr naiv leav combin sophist classif algorithm ib method futur work fd jdj denot set train document label categori fc jcj goal estim condit probabl categori interest rel order categori probabl independ focu denot order sequenc word document fw jdj write jdj jw european colloquium inform retriev power word cluster text classif joint probabl distribut partit jg construct calcul js jw find indic jg minim merg updat gg updat cost wrt end figur agglom inform bottleneck algorithm naiv assum probabl word document independ context formal approxim jw jdj estim estim word categori previou work number train document categori condit probabl word estim defin eq estim jdj jdj classifi probabl class ib classif procedur simpli translat word repres document replac eq avoid standard ad european colloquium inform retriev power word cluster text classif natur defin formal intuit featur word final eq determin class assign jdj jdj word ident distribut word cluster loss inform denot cluster merg process defin eq effect classif process reduc featur space extrem word distribut approxim algorithm tend cluster merger small loss case weight averag estim averag robust gain improv perform predict estim ib result improv classif accuraci strongli support predict notic ib cluster procedur section probabl cluster word poor estim effect due prior factor eq merg word small smaller inform merg word high prior estim design section describ experi dataset experi dataset work base standard ir corpu dataset corpu collect lang articl evenli distribut usenet discuss group natur languag corpu emploi evalu text classif techniqu group similar topic group discuss issu point schapir singer document corpu present group peopl tend post articl multipl classif task typic suffer inher estim relev probabl test subset chosen tabl check classif corpu includ ignor file lower upper case replac digit special charact charact special charact stem word occurr procedur main interest compar perform word featur concern comparison effect size train set sampl goal induc scenario larg sampl train set word featur larg sampl train set featur small sampl train set word featur small sampl train set featur european colloquium inform retriev power word cluster text classif dataset newsgroup vocabulari includ size comp scienc polit ic religion sport tabl data set detail dataset randomli split document equal approxim train document categori random sampl train small sampl train set wrt test scenario approxim train document categori repeat process time iter initi random partit document train test set classif accuraci test percentag test document correctli assess function number featur denot sort word contribut mutual inform categori variabl sort word log subset top word sort train document estim avoid high cluster top inform word produc similar curv test determin number ib rang check perform full vocabulari result figur present result averag iter dataset result larg sampl approxim document categori train similar result present small number achiev similar perform word sport data reduc featur space order magnitud approxim word classif data set sampl size significantli improv classif perform result small sampl case train european colloquium inform retriev power word cluster text classif document categori data set case yield improv classif averag iter tabl data yield improv optim perform word data perform robust iter perform word error bar figur interest note small sampl full vocabulari perform small subset inform word due overfit dataset max acc word max acc cluster improv comp scienc polit ic religion sport tabl comparison maximum accuraci small sampl word inform curv ib framework measur evalu cluster qualiti amount inform preserv inform merg process page agglom ib preserv inform high number cluster view amount inform preserv function number examin fraction preserv learn word compress cluster figur present curv dataset larg small sampl case larg sampl case variat iter small cluster reduct order origin inform preserv small sampl case larger variat inform curv iter cluster preserv origin inform absolut valu inform small sampl seemingli inform begin larg sampl case evid data due poor statist small sampl matrix word categori effect artifact due estim joint probabl exampl gain addit intuit cluster present exampl extract agglom ib algorithm scienc data set larg sampl case randomli chose half document small sampl case half document european colloquium inform retriev power word cluster text classif word cluster log word cluster acc comp word cluster acc log word cluster scienc word cluster log word cluster religion word cluster log word cluster acc polit word cluster acc log word cluster sport word cluster log word cluster word cluster log word cluster figur averag result data set horizont axi correspond number classif vertic axi percentag test document correctli classifi data upper figur correspond larg sampl case lower figur small sampl case error bar repres standard deviat iter european colloquium inform retriev power word cluster text classif log larg sampl small sampl log larg sampl small sampl figur normal inform curv iter larg small sampl size data horizont axi number word cluster vertic axi correspond absolut inform curv run horizont axi left vertic axi correspond absolut amount inform preserv case found inform word cluster maxim inform preserv categori case preserv origin inform tabl give exampl extract cluster cluster repres word roughli word semant similar cluster larg sampl sampl size small clear correl tend cluster cluster larg sampl small sampl space flight mission nasa shuttl space command spacecraft moon satellit command solar mission smith burst encrypt pgp qa fed kei bear encrypt fbi privaci secur trust algorithm secur patient cancer msg medicin ey infect chronic modern circuit amp plastic dk trust chip devic disk scheme voltag rf outlet telephon secur make good articl tabl cluster exampl scienc data larg small sampl size case cluster chosen cluster member present note charact replac digit replac upper case letter lower discuss work present implement ib method text classif extract maxim inform categori obtain low document result show train data method yield european colloquium inform retriev power word cluster text classif ment classif accuraci compar origin word featur train data significantli reduc featur minor chang classif perform import issu left futur formal analysi result requir prove reduct techniqu improv gener abil train sampl size small work simpl classif low comput complex sophist approach higher complex case turn high featur space dimens ib reduct turn complex approach practic label data activ learn queri techniqu appli specif document label queri method significantli reduc amount label data train text classifi statist label document method smaller combin reduct activ learn natur work direct acknowledg discuss yoram singer greatli appreci research support grant isra ministri scienc foundat fellowship support refer baker mccallum distribut cluster word text classif acm sigir cover thoma element inform theori john wilei dumai lsi inform experi report nation standard tishbi agnost classif markovian sequenc advanc neural inform process page hs tishbi predict queri advanc neural inform process system hofmann probabilist latent semant index acm sigir page joachim probabilist analysi rocchio algorithm tfidf text categor int conf machin learn joachim transduct infer text classif support vector machin int conf machin learn lang learn filter netnew proc int conf machin page lewi ringuett comparison learn algorithm text categor ann symp document analysi page papka train algorithm linear text classifi acm sigir page dd lewi catlett heterogen uncertainti sampl learn proc int conf machin european colloquium inform retriev power word cluster text classif lin diverg measur base shannon entropi ieee transact inform lee distribut cluster english word annual meet associ comput page schapir singer system text categor machin tishbi agglom inform bottleneck proc neural inform process system page tishbi document cluster word cluster inform bottleneck method acm sigir page tishbi hard cluster limit inform bottleneck method prepar tishbi object spectral classif galaxi inform bottleneck method notic royal astronom tishbi data cluster markovian relax inform bottleneck method proc neural inform process system fc pereira inform bottleneck method proc confer commun yang pederson featur select statist learn text categor icml page european colloquium inform retriev ii
IR/489 5 search world wide web steve lawrenc lee coverag recenc major world wide web search engin yield result coverag engin significantli singl engin index coverag engin investig vari order combin result engin yield time document averag compar result engin analysi overlap pair engin estim lower bound size index web million page internet grown rapidli incept decemb anticip expand year amount scientif inform number electron journal internet continu journal internet world wide web repres advanc retriev dissemin scientif literatur advanc educ introduct search engin altavista excit hotbot lyco northern light web view searchabl encyclopedia access scientif literatur long dream scientist web search engin made larg grow bodi scientif literatur inform resourc access scientif inform retriev literatur domin directli widespread group scientist major search engin compani claim size web continu index close entir web grow web rapidli grow inform present difficulti tradit inform retriev technolog tradit inform retriev system design environ typic index static collect directli access document natur web bring import question central architectur search engin expand number regularli updat detect reloc inform answer question impact search methodolog search web futur web search technolog number comparison provid rel coverag inform web search engin test involv run set queri number engin report number result return engin result comparison limit search engin return document queri term behavior occur inform retriev technolog engin requir exact match excit infoseek engin return document relat document longer exist engin delet invalid document document exist chang longer queri term addit document relev prevent accur estim coverag engin basi report number result selberg etzioni present result base usag log metacrawl meta search servic substanti search engin result significantli repeat result inform limit present percentag document user follow origin search engin result limit number includ fact relev difficult determin view present order affect user relev judgment present result percentag uniqu document return coverag engin result suggest engin cover fraction made experi consid percentag uniqu document top document return engin search engin return document selberg etzioni distinguish engin cover fraction cover entir web return document document queri result rank differ engin produc statist coverag major web search estim size recenc search engin major search engin consid alphabet northern light common percept engin index roughli document index larg proport web compar number document return search analyz search engin queri perform nec research institut methodolog retriev entir list match document engin retriev individu document analysi number nec research independ nj usa institut advanc comput colleg md usa tabl estim coverag engin respect combin coverag queri perform decemb confid interv hotbot comparison note result specif queri perform queri made state engin time perform note result partli due index engin index ident word document engin typic maximum file size effect truncat overs result due index reflect coverag engin search engin coverag ci hotbot altavista northern light excit infoseek lyco scienc vol april straint entir list document match queri retriev search engin order queri includ studi constraint import mention order engin rank document vari engin queri result document engin document engin uniqu url resourc found determin engin index uniqu url index url return subset url document document engin list match attempt download full text url document download queri term count constraint import detail search engin return document queri term number import detail analysi duplic remov total number document return engin combin includ ident page url queri consid engin treat capit queri differ altavista return capit result capit individu page page time includ analysi fix maximum document queri engin combin remov queri return document includ document exact queri term count word document match queri term form word exist document order document count match queri constraint engin morpholog queri special charact common word engin treat special charact differ stop word hotbot altavista list altern page special page includ statist engin specif identifi altern northern light document part publicli index analyz queri satisfi constraint tabl queri perform decemb queri initi made nec normal work period month manual check result retriev engin correctli engin period chang format list document request page document number consist check detect temporari failur search engin estim size web basi analysi overlap engin number import consid search engin typic index document hidden search form exclud document authent requir expect true size web larger estim search engin start index document interest estim size web engin index refer accur estim size web base overlap engin assum engin sampl web independ page index search engin user regist page reason assum user regist page engin page index engin partial depend sourc statist depend sampl perform engin fact search engin typic index page link popular page estim size web combin engin smallest largest term coverag reason expect larger engin lower depend index page page user regist index popular fig coverag number search engin queri perform decemb result normal averag combin averag queri averag queri significantli document return number search engin fig order estim size index web total number document web exclud page consid search overlap pair engin analyz overlap engin assum engin sampl web quantiti number document return engin number document return engin estim fraction index cover engin size index web estim number page index engin time hotbot index million page rel coverag valu tabl estim number page index engin tabl estim size portion web index analysi overlap pair smallest largest term coverag analysi limit queri return document avoid difficulti pair engin estim deriv averag note estim smallest engin smaller actual combin coverag engin studi million conclud result statist depend sampl individu engin search engin index web ci lyco infoseek infoseek excit excit northern light northern light altavista altavista hotbot report scienc vol april page web expect estim size assumpt accur engin size estim size web overlap larger engin estim index web million page overlap largest engin express engin coverag estim term fraction index web individu engin northern estim size web vari significantli internet archiv estim million page item imag forrest research estim million page altavista chief technic loui estim web million page wire digit report web million page decemb tom mitchel extrapol size report literatur produc current estim million page basi exist estim significantli underestim size web investig percentag document report engin longer valid page move longer median ag document return engin investig provid inform recenc search engin experi run decemb percentag invalid link northern hotbot time includ comparison result similar experi perform august rank engin term percentag invalid link chang significantli analysi median ag document return engin show similar experi perform august result suggest index pattern engin vari significantli engin recent page engin factor involv tradeoff size updat number drawn experi coverag search engin investig vari order magnitud estim lower bound size index web million page engin index fraction total number document coverag engin significantli limit basi estim size index individu engin cover index web engin limit network disk comput combin item claim contrari combin result multipl engin significantli combin engin studi cover time web engin engin engin largest coverag hotbot altavista scientist search inform occur place web home page scientist inform specif paper duplic link refer coverag search engin simplest mean improv coverag web search engin combin result multipl meta search engin metacrawl altern combin inform sourc major search engin autom onlin search internet softbot transform queri goal plan algorithm gener sequenc action order satisfi goal planner extens knowledg inform sourc access success softbot locat home page individu studi shake al search home page locat home page locat home page hotbot greatli improv possibl improv search scientist creation search engin design index page import scientist refer note internet capsul html wizard internet domain www barri scienc fox wire growth june june salton introduct modern inform retriev selberg fourth intern world wide web decemb annual meet american societi inform scienc url normal remov suffix trail remov port design remov segment domain url directori depth greater account machin charact url tild search engin typic upper limit number document retriev limit altavista northern check ensur limit januari upsid sci pr digit hotbot search site largest web million page extend enhanc web power decemb person commun etzioni commun acm sixth intern world wide web santa april anonym review comment suggest regist unregist trademark properti respect owner april accept februari fig coverag engin respect estim size index web queri perform decemb percentag index web index major search engin lower commonli believ note reason expect true size index web larger estim statist depend remain largest engin scienc vol april
ML/490 6 open framework distribut multimedia retriev hen wolfgang david mcg squir thierri pun comput vision rue du ch geneva switzerland comput scienc softwar monash australia laboratoir de commun ecol polytechniqu de switzerland abstract articl describ framework distribut multimedia retriev permit connect compliant user interfac varieti multimedia retriev engin open commun media retriev markup choic imag featur set queri algorithm permit multipl user queri system adapt queri paradigm adapt problem queri queri annot user interact implement level wai relev feedback implement posit neg imag qbe queri method approach search imag give overview entir collect success nement addit queri long term line learn implement featur prefer user domain user learn automat present multimedia retriev system core framework search engin techniqu adapt tradit inform retriev retriev multimedia bene ting year ir research textual visual featur treat facilit true multimedia retriev protocol applic make search engin design benchmark test queri search engin compar result motiv fact imag retriev commun lack benchmark exist text retriev motiv multimedia retriev system aim retriev document base similar queri document document element search paradigm di erent convent reli exact match speci ed eld queri term standard queri languag idea queri taxonomi imag retriev present al sql ful ll role convent queri languag facilit system compon interfac benchmark tool share web version web page local instal version web page lead duplic reduc system usabl user learn interfac search engin solut problem interfac block ort creat common benchmark cbir exist textual inform retriev measur benchmark develop al exist treat ibm qbic al de ne similar global local color textur text start point search engin blobworld al user select weight imag segment construct queri research devot develop imag featur discov mean combin weight produc result user inform system exploit techniqu insight obtain year ir fact appli adapt multimedia document inspir present research direct combin element modular modul ad chang base eld applic distribut framework compon present multimedia retriev markup languag result collabor group geneva circu group lausann cooper research group rst aim separ user interfac queri engin structur standard send queri cooper research group featur base xml parser multi paradigm er featur queri choic featur algorithm properti sheet paramet privat tag special featur system easili speci ed sql detail found al server interfac figur commun protocol user interfac permit user connect varieti dispar queri engin illustr figur reduc develop time learn time facilit comparison queri engin descript commun commun structur remot procedur client connect send stai connect server server break visual inform process enhanc retriev imag retriev consult system connect server shut connect send messag answer request current speci cation support request capabl descript select data collect classi ed queri request collect queri select con gurat queri classi ed queri permit con gurat meta queri run formul qbe transmiss user interact data xml import reason xml commun framework corba basi implement rst xml larg commun framework corba er common format log le simpl common format user data make easier research group share type data common free imag collect system form power tool collect share cbir user interact data reason xml basi larg number free xml tool parser tool evalu le xml format xml main descript languag kind meta data internet content descriptor requir group ensur long term support speci cation grace degrad grace degrad kei success independ extens basic principl summar server client recogn xml element attribut encount text complet ignor extens design standard inform remain gener user principl provid guidelin independ extens avoid con ict di er extens plan maintain promot central registr document extens facilit translat user log extend exampl log server server listen port messag tcp socket client request basic properti wait answer code server inform client capabl similar simpl client request list collect descript wai queri client open session con gure user meta queri client request algorithm request answer send list algorithm handshak mechan interact client program meta queri agent automat obtain inform describ server similar simpl client open close session con gure algorithm chosen user enabl server learn queri processor interfac con gurat client request properti sheet descript server vari algorithm di erent relev paramet gurabl featur speed er weight function bucklei varieti method level prune al paramet irrelev search engin properti interfac adapt speci paramet speci es interfac turn data xml send back server short interfac con featur speci es displai element user enter attribut caption featur valu user enter integ attribut mechan complex properti send xml text multipl element queri formul queri step depend queri paradigm er interfac search engin includ design extens paradigm basic qbe queri consist list imag relev level assign user user mark imag posit imag neg queri imag refer url server return retriev result list imag url queri group transact formul log complex queri appli system process singl queri varieti version al system al import case preserv log knowledg queri logic relat usag initi idea protocol inter oper separ interfac actual queri er potenti applic open interfac server inform evalu inform form meta search engin benchmark benchmark cbir common benchmark cbir commun exist ten year ir commun process develop benchmark suit base benchmark perform evalu automat manual ort base al develop exibl benchmark test suit relev judgment account compar system system evalu method recal normal averag rank imag retriev figur relev judgment cluster imag manual classi cation judgment number user experi shown user judgment di er strongli al squir pun make import judgment compar system perform time system paramet usabl system depend strongli system er method speed evalu evalu mean meta search engin meta search engin er possibl automat rout queri search engin applic user nding optim search engin search applic gener combin solut queri engin meta search engin al wide accept common queri languag greatli simplifi develop search engin benchmark test search engin relev judgement perform measur figur benchmark compon freeli research group develop client applic written java portabl er queri multipl posit neg queri multipl collect algorithm scatter plot result aspect similar basket imag figur java interfac search engin search techniqu system al squir al squir al inspir ir larg number simpl featur contrast cbir system store imag list discret featur featur consid present present imag result data structur treat text document sequenc word word present present text featur weight similar featur weight scheme text retriev bucklei weight scheme equat present featur imag featur map featur imag store invert le data conjunct featur weight scheme make integr text complet textual featur treat visual multimedia document natur system weight algorithm featur relev ij log cf imag score kq kj featur relev tf term frequenc featur queri result cf collect frequenc queri input result number featur relev queri imag equat base fact featur frequent collect distinguish imag featur frequent imag describ imag imag featur present version emploi local global color textur featur extract frequenc statist imag collect intent make system featur approxim present human vision system featur read al user add text imag facilit retriev imag search annot interact feedback strategi choic interact feedback includ relev feedback al er user possibl mark imag posit neg exampl neg feedback problem mechan avoid problem inspir contrast classic relev imag attack problem nding good imag start point qbe search imag browser user nding target present sequenc overview success ned learn user interact overview present user chosen maxim expect inform gain techniqu rst emploi evalu pichunt al al present extens modi cation pichunt scheme give user possibl chang mind queri process incorpor framework long term learn usag log le system permit long term learn al learn techniqu account imag mark queri step imag mark posit associ common featur higher weight featur common imag mark posit neg queri step contrari lower weight learn techniqu emploi domain basi account goal di er user user group open multimedia framework section describ framework exchang part system framework close system retriev multimedia document open platform compon exchang easili fast chang system integr research group neighbor disciplin research group work project part de ned program interfac make framework develop cooper circu group collabor mirror group twent separ interfac search engin achiev circu basi part system replac expand easili main system figur graphic framework easi adapt system diver requir domain consum replac compon project algorithm multimedia collect characterist featur section interfac algorithm featur textur annot color figur complet framework system result research made freeli interfac conjunct parser multimedia inform retriev reduc inform overload public domain research concentr aspect problem interest work continu develop freeli queri set benchmark suit distribut conjunct benchmark make rst comparison larg number exchang collect packag includ simpl command add imag collect queri engin chosen featur extract automat invert le gener featur result ad collect queri engin interfac imag displai collect chosen moment di erent collect imag incorpor system system er possibl includ collect multimedia item web extend concept imag search exchang featur di erent set featur system combin featur select queri featur set di erent absolut work domain multi modal data medic imag di erent featur set face imag photograph collect imag collect interfac con gure displai featur group moment er text local global color featur local global textur featur base gabor wavelet investig featur group special imag trademark plan exchang algorithm weight scheme incorpor system weight scheme bucklei comparison weight scheme cbir found al di erent domain vari weight vari access function er exampl weight scheme classic document frequenc equat weight binari term independ distribut comput corba distribut actual comput number comput network queri collect queri featur group queri machin depend comput power figur balanc comput load import system intens user paper describ open framework multimedia retriev er easi adapt system diver area applic develop retriev server corba client figur distribut comput corba system freeli exchang proven interfac user chose compar retriev engin common commun protocol greatli facilit comparison common rst step benchmark suit multimedia retriev engin demonstr feasibl techniqu adapt ir shown ectiv textual visual featur natur common lead easi integr true multimedia retriev framework easi exchang part system adapt system scenario multimedia data manag adapt domain medic imag trademark recognit underwai evalu distribut system complement separ interfac search engin distribut actual comput machin internet local network acknowledg work support swiss nation foundat scienti research refer altavista search engin altavista imag search annot depart comput scienc washington engin symposium electron multimedia process applic storag retriev imag video san ca imag ieee confer comput vision pattern recognit ieee comput san puerto rico queri taxonomi multimedia al symposium video data target test pichunt bayesian multimedia retriev advanc digit librari librari pp queri imag video qbic ieee comput web page sur mage inform base user relev feedback imag al symposium video data mpeg requir group context object atlant doc intern long term learn imag technic report comput vision comput rue switzerland strategi posit neg relev feedback imag technic report comput vision comput rue switzerland perform evalu imag overview technic report comput vision comput rue switzerland ecient access method imag retriev invert al symposium video data de extens standard multimedia queri benchmark draft technic report comput vision comput rue switzerland hunt move extens bayesian method multimedia al symposium video data multimedia storag archiv system iv vol spie usa symposium video data qbic qbic tm ibm queri imag content relev feedback inform smart retriev experi automat document prentic englewood cli pp term weight approach automat text technic report depart comput cornel york term weight approach automat text inform process manag relev feedback term weight scheme imag intern confer visual inform system number lectur note comput pp queri imag inspir text invert weight relev scandinavian confer imag analysi pp comparison human machin assess imag similar organ imag visa scandinavian confer imag analysi pattern recognit societi pp overview seventh text retriev confer seventh text retriev pp
DB/491 3 integr data knowledg work bank control becker matthia jark global technolog deutsch bank germani schloss sankt germani abstract integr data system develop distribut manag control deutsch bank combin avail histor data report plan facil major compon interest includ olap system terabyt meta process heterogen data select individu olap report posit back individu busi activ control workbench develop user metadata level introduct control system network report subsystem full function spectrum control deutsch bank onlin bank db german subsidiari includ db db system creation balanc sheet inform bank regul daili intern statu report manag system assess busi busi sale evalu commerci bank sector permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow intern confer larg project motiv challeng data qualiti factor integr data heterogen principl model aggreg data target busi goal individu busi unit simpli result histori rule system heterogen hidden program code data part control system end report consequ semant heterogen knowledg structur hidden individu transform program control workflow analyst spent lot time reconcil seemingli contradictori inform report main design goal clarifi heterogen physic integr data relationship data sourc report perspect made explicit improv transpar report refresh data highli effici achiev hand captur sophist domain system knowledg inform network metadata emploi tailor effici scalabl olap system heterogen consolid uniform data environ base uniform histor busi data store architectur system tune effici mass data process fast report refresh current daili cube report histor data maintain full detail year gb base data control store flat file gb note amount reflect short oper histori system expect grow biggest part import analysi instrument gb interlink data cube store collect matric olap system call remaind describ individu compon architectur shown figur lower part show basic control common clean base store integr heterogen data control workbench cbm control oper detail found section middl figur find olap environ data cube extract client analyst detail section underli data sourc analysi interconnect manner defin evolv cdr workbench control dimens held meta section term tradit data roughli correspond oper data correspond client environ enrich metadata facil data due semant rich heterogen level logic data physic effici safeti control dimens report control analysi cbm control workbench fig compon basic control state data heterogen sourc control support cbm control workbench support gener version oper oper manag control base detail inform design mass data storag consist access method kei standard import export interfac data import heterogen oper statist archiv control applic standard interfac file deliveri system special file creat modul call file interfac gener tailor individu deliveri system data export place standard interfac suppli access transform import data achiev consist data base uniform data mean transform extrapol aggreg data data regist kei data field heterogen deliveri system current histor data undergo sort structur process homogen storag current past method storag access request varieti access requir insert mass exchang delet data access individu deal data process individu deal vari access requir necessit vari storag method data avail time remain accept requir accept redund data storag long integr redund inher ensur redund data access access modul extern user black box data access provid access function encapsul strictli separ logic physic aspect flexibl data administr storag respect extens structur physic data base import featur possibl flexibl effici repetit compon storag export effici repeat repetit execut smallest deliveri inventori level affect level repetit process automat integr workflow control manag program modul work common steer control center record process step statu evalu subsequ program process achiev scalabl structur construct flexibl permit subsequ structur implement quickli relev compon problem incorpor data inventori administr cbm cbm central workbench control work support addit relev interim account shift plausibl check cbm access individu account topic field olap olap system environ develop market softwar base germani flexibl olap function drill roll dimens aggreg applic modul data data integr dynam price revenu manag standard instrument report analysi complex carri base aggreg report data construct control main featur context full integr metadata concept report data meta structur composit record metadata relev structur data cube report definit data view administ drill function user abil call trace analysi basi aggreg report individu deal select criteria data analysi defin scalabl storag capac interest unlimit analyt declar dimens defin data dimens aggreg level requir storag capac comput world insuffici interlink data cube dimens scale data cube constitut logic hypercub possibl navig slice remain fulli system scalabl perform move high volum current data make fulli refresh data dai flexibl scale switch freeli batch dynam onlin aggreg time delai dynam onlin aggreg larg avoid usag effici hash techniqu metadata manag state semant heterogen domain rule hidden program code main motiv project postul conceptu perspect document mean data relationship critic success factor system map conceptu approach logic level increment creation basic data sourc restructur data numer cube format report structur equal import size complex import major challeng physic level includ schedul join oper data integr product cube dynam aggreg aspect consid close interlink document autom task goal metadata manag facil analog meta workbench call cdr meta bring knowledg wide rang heterogen applic system aspect describ data viewpoint knowledg base system interact compon activ knowledg network steer drive process system conceptu logic physic level consist flexibl ensur figur step oper process sourc import olap cube creation back oper indic rich knowledg cover knowledg oper data import knowledg import interfac knowledg definit specif knowledg transform rule transform knowledg organ product structur knowledg file space manag storag knowledg oper control subprocess knowledg deliveri specif knowledg aggreg dimens transform export knowledg aggreg rule knowledg report posit knowledg report timet knowledg export rule knowledg organ unit aggreg subprocess knowledg product dimens drill knowledg storag administr integr consist flexibl ensur analysi subprocess fig knowledg network process cdr tool dimens cdr central user tool control system peopl manag deliveri interfac report posit defin adjust process carri onlin oper integr program driven integr extens qualiti effect addit import cdr featur time statu concept defin schedul monitor polici oper data flow shown figur onlin statu control data import creation data export metadata export function automat interact evolv structur extern system system form oper year impact achiev qualiti goal coher control pathwai report currenc avail evolv effici handl massiv amount heterogen data sourc client side primari success factor includ highli effici flexibl facil provid metadata model environ support qualiti aspect conceptu perspect bank account knowledg addit tradit logic data transform physic data transport manipul facil interest data architectur research european dwq project ongo work concern extens part broaden access client side acknowledg due peopl aachen frankfurt contribut significantli success system refer mbh product descript june architectur qualiti data extend repositori approach special issu advanc inform system engin inform system fundament data cp framework analysi data qualiti research ieee tran knowledg data eng
Agents/492 1 direct plan attent agent goal autonomi timothi jame forest norman dissert submit partial fulfil requir doctor philosophi london depart comput scienc colleg london abstract action agent goal autonomi driven goal gener refer belief desir abil essenti agent requir act interest domain predict situat warrant gener goal case domain lead gener goal detect immedi goal pursu action time agent influenc goal tend recur time dai week goal serv motiv agent interact agent process type predict behaviour pattern thesi model goal autonom agent gener goal unexpect domain cyclic automat process import effect goal autonomi agent exhibit capabl potenti unpredict number goal goal hold plan attent consum real agent resourc bound limit number goal hold plan attent bookkeep search oper primari mode cognit overload heurist mechan direct limit plan attent agent goal autonomi mechan serv focu attent agent limit number salient reason prevent cognit overload agent emploi modern plan reason method effect abstract acknowledg long guidanc grate weekli discuss momentum maria fox encourag feedback number discuss mile luc ian mike luck mark dinverno doctor studi fund engin physic scienc research council thesi gener macro packag ucl thesi document class provid support russel intact due year forget acknowledg content introduct object broad context problem contribut thesi outlin domain relationship interfac chang motiv design constraint domain environ agent discuss limit domain abstract agent motiv agenc motiv agenc motiv motiv goal motiv motiv agent motiv agent goal process cycl desir intent architectur content overview comparison irma motiv agent architectur architectur alarm gener goal goal gener tempor repres time point interv reason time point interv alarm function alarm gener alarm replenish mechan replenish discuss relat work danger time commit opportun satisfi inact goal opportun encod time detect opportun effect detect opportun danger time satisfact goal alarm appropri condit danger due conflict intend action inact goal danger due domain time commit plan interpret detect conflict time commit inact goal effect conflict time commit alarm discuss content relat work direct plan attent threshold effect chang threshold threshold control determin requir trigger rate determin threshold ceil summari goal process goal activ alarm delet alarm delet goal activ alarm mitig discuss relat work summari discuss introduct summari alarm heurist alarm gener danger time commit alarm mitig alarm trigger function planner critic evalu alarm process machineri consequ larg number relev goal consequ small number relev goal potenti ineffici overhead goal gener goal planner alarm function characterist content notat prototyp motiv agent syntax code tempor goal action plan demon alarm mitig function replenish alarm process prototyp motiv agent simul alarm process machineri initi state time mon time mon time mon time mon time mon time mon time mon time mon time mon time mon time mon time mon time mon time mon time mon time mon content time mon time mon time mon time mon time mon time tue time tue time tue time tue time tue time tue content list figur focu simpl block world scenario plan view environ process diagram motiv agent architectur process diagram architectur relationship irma motiv agenc simplifi process diagram architectur exemplar alarm function alarm gener alarm gener cyclic replenish goal detect opportun behaviour alarm encapsul goal gener servic motiv fulli stock interact intend action inact goal detect danger interact time commit goal partial order plan extern time abstract abstract time commit influenc danger time commit control alarm trigger rate effect action tempor characterist cognit load architectur goal gener manag list figur process gener goal effect mitig alarm function effect repeat mitig alarm effect repeat mitig alarm behaviour mitig alarm simul focu behaviour alarm encapsul goal tidi room behaviour alarm midnight behaviour alarm midnight focu partial order plan extern time effect prior time commit alarm encapsul goal mitig temperatur room chapter introduct agent reason avoid unnecessari object object research present thesi direct limit plan attent agent goal autonomi agent capabl successfulli direct plan focu salient goal agent capabl successfulli limit plan focu suffici small number goal prevent reason resourc overload number goal pursu broad context import trend field artifici intellig research focu shift isol process belief algorithm integr element complet design georgeff wooldridg wooldridg wooldridg shift ai method judg perform realist requir evolut plan technolog case point earli plan gp strip tweak recent princip design gener good plan satisfi conjunct goal effici techniqu number ffl plan problem inher intract plan algorithm gener satisfactori solut problem chapter introduct fix period time ffl planner reli complet world assum complet correct model domain problem address extent make sensori action plan system agent collin ffl planner reli complet action assum effect agent action complet correctli model ffl goal planner design pursu partial achiev goal problem address extent emploi techniqu plan haddawi system address critic classic plan identifi ffl planner activ essenti model interact planner domain light ai paradigm success number robot develop focu dynam interact gener algorithm plan gener agr kaelbl agent design number singl type interact agent environ mechan select mae present behaviour select algorithm flow network select behaviour present associ memori approach action select cf norman anderson rosenbloom cooper al edg network repres relev link behaviour repres strip oper behaviour conflict behaviour behaviour activ level fraction activ level system proven effect low level control agent behaviour predict simon difficult system problem emploi knowledg reason scale complex task altern approach georgeff type control system agent number low level behaviour reactiv action packag characterist potenti combin delib action select machineri system design enabl planner gener loop reactiv plan procedur reason system control system capabl extens plan react chang situat interact environ pr implement gener desir intent architectur rao number broad agent architectur literatur chapter pr agent perform simpl belief plan schedul function interact chang recent system develop aid manag flight sydnei airport integr type delib process physic action develop agent design task realist environ present number import challeng ai research percept process agent combin belief maintain ground world model make plan control agent make fast act time agent requir world model plan commun act negoti cooper agent specif problem investig thesi integr goal gener plan function complet agent architectur problem agent requir interact environ static list goal suffici flexibl state environ chang time pursu goal longer desir singl goal satisfi depend relationship chang time agent effect goal autonom chapter introduct capabl gener goal fly chang alter goal goal present act goal prioriti goal chang requir agent suffici agent limit reason agent agent capabl gener goal intern state state extern agent goal autonom goal autonom agent agent gener goal environ servic multipl motiv feasibl agent respond event gener goal requir action dai week achiev goal goal influenc agent behaviour agent requir act cyclic successfulli interact agent maintain state variabl agent mitig hunger time attend lectur timet activ schedul goal time agent goal autonomi influenc vari potenti unpredict number goal goal gener demand reason resourc agent act goal agent number import time requir agent decid goal plan act comput combin goal attend agent physic capabl achiev goal limit reason resourc goal manag delib limit demand resourc met number goal undergo delib process demand resourc exce agent swamp bookkeep search oper mode activ situat refer thesi cognit agent produc kind due complex problem concern involv gener solut problem agent goal autonomi plan delib process fact shown gener determin plan instanc extrem sever restrict requir polynomi time npcomplet sever restrict make plan problem trivial contribut set goal agent present time focu plan attent focu activ figur focu focu reason resourc limit number relev goal cognit overload prevent agent reason avoid unnecessari agent design interact realist domain capabl gener goal limit goal consid candid action cognit overload prevent number goal distribut time problem solv direct attent goal action present time combin requir effect structur space goal agent pursu similar illustr figur goal candid action subset set goal agent agent plan goal agent act present subset goal focu plan agent goal lie focu activ agent activ pursuit problem address thesi mainten focu plan attent cognit overload prevent number goal agent pursu contribut thesi contribut ai primarili detail specif system limit direct agent plan attent alarm process machineri design motiv issu comput extent psycholog plausibl primari requir process develop recollect goal serv avoid unnecessari chapter introduct reason type goal ortoni type goal gener literatur concret explan motiv affect behaviour agent distinct sourc goal goal gener goal automat gener avoid reason involv gener goal period timet classif motiv avoid unnecessari reason exhibit type goal direct type goal gener import function role agent architectur hammond present mechan agent suspend goal recal goal light opportun achiev opportunist recollect suspend goal serv avoid unnecessari plan opportun enabl goal achiev minimum plan possibl physic effort section alarm process machineri present thesi contribut area research provid complet account recollect goal light opportun influenc opportun part complet goal recollect mechan account influenc delai danger time satisfact suspend prior time commit agent goal autonomi effect direct limit plan attent discuss simon sloman sloman norman long perform agent includ filter expand filter penetr theori cognit affect beaudoin discuss mechan goal regul heurist threshold filter depend aspect agent state includ thesi contribut area research provid account load reason resourc agent affect suspend goal hold undergo delib process recollect goal mechan suspend goal enter state consid activ term refer goal agent focu plan attent inact goal activ activ term explain greater detail chapter note undesir consequ subsystem thesi outlin threshold affect likelihood agent recal suspend goal load reason resourc agent cognit assum close relat time commit action import pursuit action thesi outlin outlin thesi characterist environ relationship agent environ constrain design agent oper environ import wai chapter discuss constraint agent design due real world domain complet correctli primari interest problem address thesi chapter broad agent present mechan present chapter wider architectur context architectur compar relat agent architectur chapter detail alarm process implement goal manag process serv limit goal attend provid agent focu plan attent chapter core gradual introduc aspect alarm process machineri chapter discuss mechan goal gener introduc idea alarm serv prevent goal process delib function agent chapter unexpect agent intern state state extern environ effect goal consid discuss chapter describ condit goal brought agent attent subsequ process goal chapter serv previou give overview alarm process machineri evalu algorithm chapter conclud open issu manag goal limit plan attent discuss chapter introduct chapter domain previou argu agent control system includ process limit direct reason attent broad agent architectur specif contribut work import describ type applic environ agent intend act illustr issu robot develop mit ai laboratori robot design environ latest seri robot capabl uneven includ inch tj wheel robot capabl taught locat place simpl answer question navig request robot design effect nich effect role fulli understand agent design design design space import understand environ nich nich space influenc constrain design import gener characterist domain interest agent relationship develop design constraint peculiar implement distinguish gener constraint lead gener principl agent design section characterist realist environ influenc constrain design agent discuss made number implement document section describ notion develop prototyp motiv agent architectur section critic examin refer url chapter domain relationship relationship agent environ analysi serv highlight motiv work describ relationship primari agent sensori affect capabl respect interfac agent nich dynam environ chang independ action agent number constraint design agent control system motiv develop goal manag mechan thesi section agent environ agent object term refer domain abil chang state state thing environ act state object chang due action agent process govern physic simul environ interfac agent interact environ aspect act chang state variabl environ point view agent import issu simul sensori process sensor data sensor efficaci scope simul sensor defin environ agent detect time block world figur agent manipul block detect posit block environ time pengi view state entir game board agent design manag simul move room detect state variabl thing room move room room agent build model sampl state thing state thing room continu chang longer interv state room date agent inform state variabl unavail sensor data lead inaccuraci agent model environ sourc model inaccuraci inaccur data agent sensor distribut vehicl monitor claim autonom gener goal suffici condit autonomi argu agent autonom abil relationship tileworld simul simul sensor qualiti agent detect extern state thing sensor limit efficaci pengi agr agent inhabit environ ic block number bee pengi detect present locat bee previou state predict trajectori bee pengi detect intern state bee govern detect state agent chang pattern observ circumst state object chang behaviour object predict depth agent sensori capabl environ improv commun agent indic intern state agent improv suffici similar behaviour agent agent attempt chang aspect environ act object agent environ point view agent import issu simul affect capabl agent scope affect capabl respect agent efficaci agent abil agent suffici scope affect capabl satisfi cooper agent commun agent pengi agent game collect number magic ic block pengi pursu task avoid kick ic block commun involv pengi bee game pengi cooper bee successfulli collect magic ic block agent requir aid agent succe cooper achiev goal commun fact task cooper coordin possibl agent issu simul affect capabl agent possibl action unsuccess agent attempt pick object unsuccess attempt oper time chang construct simul environ commonli model possibl number object number state chapter domain shoham sloman poli object mark figur block constant size figur tabl figur posit block environ state vari agr inhabit maze ic block number bee agent bee chase pengi intent kick ic block accur kick ic block import design pengi kick ic block pengi fast bee travel maze bee travel significantli faster penguin design surviv long environ design agent environ import determin type thing inhabit state thing chang chang state object agent environ model determin fast state sourc chang state simul environ import determin control agent hold import influenc agent design sourc chang object agent process govern physic simul sourc chang agent process simplest environ inanim object environ agent design environ sole sourc chang state case block section figur state object chang due process initi agent hot cup cool design agent environ account effect decid act act dean boddi agent design inhabit number agent initi chang object environ control agent aspect environ depend rel efficaci agent environ agent influenc physic commun action rate chang state object agent import design agent variabl relev agent environ agent fast respond appropri state thing environ section agent design effect relationship initi state tabl goal state tabl figur simpl block world scenario nich granular abil act match granular state relev object agent significantli chang pengi design make act compar rate bee motiv design constraint design constraint serv identifi critic motiv issu approach design intellig system present thesi multipl chang goal ai plan system assum agent reach end point repres conjunct goal initi state goal proposit world model made qualifi tempor constraint deadlin agent goal task complet classic block world domain block mark figur typic task agent stack block block block block block block satisfi conjunct goal valid proposit block world domain agent achiev task complet simpl domain domain agent sole sourc chang state prove understand complex plan develop plan algorithm allen rich knight lee al review practic agent requir interact domain chang independ action agent static list goal suffici flexibl agent georgeff lanski discuss procedur reason system illustr point scenario involv robot emploi astronaut assist space station robot proce pursu goal robot fetch chapter domain warn light detect indic malfunct control jet space station robot gener goal suspend origin resum complet newli gener goal agent effect capabl gener goal alter focu chang goal present act goal prioriti goal chang capabl essenti agent requir act domain chang independ agent predict block world agent state domain chang space station state space station independ action robot unavail inform previou georgeff lanski astronaut assist respond detect warn light pursu goal assist posit detect warn light respond warn detect reason period fault detect fault left chanc state import variabl occur spontan action agent limit part domain behaviour agent influenc monitor variabl astronaut assist diagnosi report fault space instruct posit detect fault agent effect check warn light fault interv rate occur long fix typic fault cost failur govern frequenc variabl monitor fault control jet attend hour problem tend occur agent limit sensori scope motiv direct agent ensur import variabl monitor design requir addit agent gather inform environ goal achiev collin abil agent gener goal sampl state variabl servic top level goal import requir agent act uncertain domain behaviour direct goal agent present pursu variabl import relat relationship current focu agent curiou state variabl case chang import agent present focu attent motiv behaviour agent motiv gener goal seek inform state environ block world agent sole sourc chang environ state sole initi condit environ postcondit action agent perform stabl unstabl condit proposit state water boil hot time boil water cool accord physic environ action agent initi condit environ postcondit action agent perform agent sole actor domain activ domain import aspect state domain agent perform action unstabl agent affect achiev goal agent behaviour domain agent act time satisfi domain interest refer time critic domain abil agent act fast time achiev goal essenti agent behav effect time critic simul real phoenix project agent requir manag simul forest fire american nation park deploi simul fire reason time time control forest fire evolv independ activ agent direct pengi act fast surviv section develop beaudoin sloman simul hazard babi fall di agent act fast prevent babi fall russel wefald boddi dean block world agent manipul block total control domain agent long agent decid time complet domain game time agent make act critic determin agent success chapter domain recharg point order book point room frozen room frozen room room room room temperatur room room temperatur load bai room temperatur offic figur plan view environ natur simul agent classic plan method make success behaviour routin pengi agr pr georgeff rap behaviour base layer interrap architectur approach ai method al review behaviour level agent act level agent activ includ plan goal manag agent physic capabl perform capabl agent meet constraint domain prototyp agent discuss thesi implement simpl domain implement includ planner simul interact implement concentr goal manag mechan present chapter serv execut specif part complet agent intend full simul domain environ environ consist number room characterist door figur plan view environ room characterist shown diagram capac room type environ room capac room govern unit stock store room type storag environ room govern type commod suit storag room room hold unit stock temperatur freez make suitabl storag commod frozen load bai storag temporari storag deliv good prepar order collect custom deliveri good supplier collect order custom load bai offic storag stock time offic recharg order book agent commun supplier custom process concern commun agent concern order book simplif method commun real agent agent recharg point recharg batteri diagram includ point situat room commod past sell time messag order book agent send receiv messag supplier custom agent send request reject accept messag custom model negoti commun minim main order book agent initi process commod receiv messag custom messag custom assum request correct request order withdraw order case messag receiv standard form easili interpret agent request order prospect custom syntax defin type messag type chapter type structur summari syntax appendix request trademark research softwar chapter domain uniqu identifi distinguish integ identifi time custom arriv collect order list commod number unit commod requir stock stock object tupl unit stock stock commod type stock time stock unit sold unit frozen sold tuesdai agent agent custom supplier custom supplier found entranc load bai resourc resourc squar figur resourc recharg order book point room room object identifi room room room refer capac capac type environ room design temperatur actual temperatur list door room move list agent list resourc list stock unit room room refer compound object sloman poli object object agent agent room free sampl detect state object agent room agent offic state order sampl state receiv messag domain custom supplier agent state stock level move room sampl aspect state room agent detect arriv custom recent deliv suppli stock move load bai state room agent number ensur adequ level stock meet custom discuss meant term refer section charg agent act environ simul charg charg level refresh period agent requir monitor variabl domain state variabl sensori agent act sampl state variabl circumst section agent variabl domain move locat simpli sampl state object detect locat agent curiou temperatur room state order book variabl essenti agent ensur stock store temperatur agent order request custom temperatur room fault agent move stock room temporari measur temperatur control mechan section agent curiou supplier arriv stock time agent request stock deliv curiou custom arriv collect order maintain stock agent satisfi order custom suffici stock agent necessarili suffici time order requir stock supplier deliv time order receiv custom arriv order delai order stock arriv stock sold agent replac ensur capac agent find level chapter domain commod respond event order stock event occur unusu high demand ic cream heat wave threshold chang normal consumpt rate commod consumpt rate ic cream typic drop threshold drop al refer type behaviour agent act agent respond commod detect room inadequ environ type agent detect unit frozen load remov stock unit room frozen environ type ensur agent prevent stock degrad rapidli implement present assum agent singl cost commod order factor decid volum stock order agent negoti deal number agent motiv cost commod supplier vari price qualiti supplier vari reliabl agent inform decid supplier place order model agent set sell price custom ensur good profit made prepar order ensur order successfulli commod request custom readi load bai custom arriv custom stai load bai limit period time agent order readi time custom leav order agent behaviour custom order satisfi agent negoti agent gain order late custom pai agent late incomplet agent act activ custom agent limit abil vet reliabl custom custom collect agent put custom agent reject subsequ order custom cancel request order frequent custom consid agent discuss tidi agent order stock stock sell agent stock complet order custom stock unit remain unit space agent motiv clear stock longer point locat room discuss limit domain section agent model commun assumpt made simul interact implement lift lack model commun cooper detract efficaci goal manag machineri present thesi goal motiv agent commun involv reason plan requir manag integr plan commun action negoti activ area research distribut artifici intellig present domain loosen assumpt agent complet correct model domain make agent limit sensori scope move locat detect state variabl locat time major present state environ unavail agent agent state data assum perfect assumpt data agent sensor perfect hold agent primari actor domain agent request collect order deliv state stabl agr chapman time critic goal agent gener requir reactiv behaviour focu research manag longer term goal longer term time constraint time reaction short term dynam environ domain suit investig goal manag machineri behaviour select place complet agent architectur environ constrain design agent import wai agent limit control activ custom arriv collect order avail inform agent chapter domain motiv maintain date record state variabl agent limit sensori capabl domain chang independ action agent advanc goal pursu interact environ agent gener goal domain domain accept investig agent design satisfi constraint machineri direct plan attent chapter abstract agent motiv agenc chapter present abstract architectur develop artifici intellig system capabl gener effect manag goal intent provid framework develop comput model goal gener manag term element process motiv agent notat chapter type element process agent architectur tm type function structur appendix notat clariti indic step full implement prototyp motiv agent implement present detail section motiv agenc compar irma architectur architectur base desir intent rao georgeff haddadi section motiv process architectur number relat agent architectur vari detail relev work psycholog ai irma discuss motiv develop includ limit intens process plan schedul system address adapt intellig system architectur ai architectur dynam control plan guid decid focu attent refer beaudoin chapter detail discuss critic ai comparison note addit previou relat literatur discuss end chapter relat work present context chapter abstract agent motiv agenc chapter collect singl literatur review motiv agenc motiv motiv agent function motiv observ environ intern state agent ensur interest serv agent motiv maintain level stock section motiv ensur environ intern state agent relev interest detect specif goal gener potenti direct activ agent support interest agent interest maintain widget stock widget stock replenish order widget supplier motiv influenc agent gener goal order stock widget time widget ensur qualiti degrad quickli agent detect unit widget room ffi motiv influenc agent gener goal move unit widget room storag condit motiv map belief agent state domain possibl list motiv goal motiv belief list proposit repres intern state agent state extern environ perceiv agent time agent belief motiv trigger gener motiv goal section gener goal involv make goal gener condit act effort involv process section motiv goal motiv goal goal motiv goal assum proposit agent make true partial state point section motiv goal time agent belief chang reflect relev goal agent section motiv agenc motiv level goal greater agent motiv act agent motiv prepar order hour time tidi stock room tidi import prepar relev agent tidi room prepar order custom arriv hour motiv tidi room greater motiv prepar order section motiv motiv function heurist evalu intens level intens motiv design reflect relev goal present time intens chang agent belief chang mean goal motiv intens discuss section illustr dimens estim import achiev goal tempor relev relev agent act goal present agent motiv act goal low import high tempor relev goal low tempor relev sloman meal plenti time import illustr similar import goal relev action present gener motiv import find balanc influenc dimens intens estim subject import great influenc intens motiv agent tend import goal goal achiev tempor relev goal great influenc agent tend urgent goal import patholog behaviour undesir import tempor relev goal combin rel motiv goal grune argu compar vector vector knowledg valu combin dimens higher inform combin subject chapter abstract agent motiv agenc goal relev goal agent motiv act goal multipl combin estim dimens motiv agent motiv agent distinct perform import goal gener goal activ motiv agent conjunct top level number motiv capac gener motiv goal detect domain process refer goal motiv goal gener process ad agent list motiv goal gener gener ms bs concat bs distinct function motiv agent activ goal goal activ agent act goal goal activ intens motiv act goal suffici exce agent decid relev act goal intens motiv goal exce goal trigger threshold deriv state planner manipul control trigger goal threshold goal consid activ trigger threshold trigger mg bs goal consid delib select ad agent focu plan attent section delib process check condit goal gener condit agent decid goal act pass planner process gener repres tm function line type gener function list motiv list belief evalu list motiv goal line specifi function case function list bs correspond function motiv list motiv evalu basi agent current belief produc list motiv goal motiv list concaten form singl list newli gener motiv goal standard function concat appendix definit list motiv function motiv goal mg test evalu present intens motiv exce bs intens exce goal motiv function return result list goal motiv agenc gener oe activ planner threshold action figur process diagram motiv agent architectur activ process act filter goal motiv exce threshold consid relev action pass activ threshold activ mg bs bs mg bs goal activ influenc plan process activ goal bring goal attent agent level threshold depend load agent plan goal activ suffici small number planner overload task relev goal goal agent motiv achiev goal ad store goal constitut agent focu plan attent function planner direct action pursuit activ goal specif capabl prescrib architectur role planner discuss detail section motiv agent goal process cycl motiv agent process goal maintain limit direct list activ goal focu plan figur function planner consid oper parallel goal process call subroutin step chapter abstract agent motiv agenc agent gener list motiv goal basi gener function ad list motiv goal evalu trigger motiv motiv goal evalu compar current threshold trigger function trigger goal consid function agent decid activ ad focu plan attent agent decid goal longer delet motiv goal reset consid time refer section updat threshold agent belief repeat desir intent architectur number agent architectur discuss gener class desir intent architectur specif focu irma architectur good bdi agent notat section section architectur compar easili overview bdi state agent repres desir intent belief agent model desir provid sort order intent thing decid intent bdi agent defin level agent intend bui decid book shop bui intent structur bratman al similar hierarch oper level abstract plan intent intent structur similar properti action hierarch plan typic repres task agent commit pursuit intent intent structur agent intent intent structur partial requir refin action agent plan recip relev agent commit select recip oper process agent commit action intend method achiev goal desir intent architectur commenc intent tempor partial time necessarili account dimens tempor partial plan tempor order action plan perform partial partial intent structur gener irma architectur repres linear hierarch plan action gener number constraint exist intent intent structur intent fix time point common action hierarch plan constrain perform action plan fix time point total order action bdi agent gradual refin intent primit action execut rao georgeff georgeff rao bdi agent perform function similar agent gener list option option mean current intent satisfi option gener basi belief desir figur reproduc pollack al option agent mean satisfi current intent gener reason method refin current intent plan refin option agent altern current intent gener basi current belief desir subset option select heurist select function select made basi agent current intent option pass compat current select process subject select intent option agent decid adopt filter ad intent structur chapter abstract agent motiv agenc gener altern select intent structur action refin oe oe figur process diagram architectur atom action perform intent execut agent satisfi intent decid intent longer intent drop agent belief cycl repeat comparison irma motiv agent architectur focu irma agent architectur investig role intent direct activ agent relationship desir intent focu motiv agent architectur investig gener manag multipl medium goal direct plan attent intent structur irma agent repres linear hierarch plan process irma architectur implement tileworld system architectur differ pr filter mechan option select process note irma pr reason select librari plan fragment procedur reason refin process desir intent architectur select option insert option intent structur type hierarch plan import differ irma agent hierarch plan algorithm possibl option deriv refin process introduc intent intent structur gener figur option select option agent gener refin motiv agent architectur assum type plan process conform requir input output primari process involv suggest altern goal agent pursu compar irma architectur motiv agent figur simplifi figur note process select option gener process bdi architectur bratman al similar filter goal motiv agent architectur select process figur combin process select refin exist function differ mechan characterist filter process option filter basi similar current feedback planner agent set current intent motiv agent goal filter basi tempor relev current load cognit resourc feedback planner measur load irma agent present situat larg number goal pursu gener altern process gener goal agent pursu present time mechan examin belief desir option heurist evalu basi agent current intent agent option chosen add intent structur agent belief updat test condit goal gener bdi agent oper gener test cycl comput resourc consum process depend cost gener altern cost evalu option irma option gener set condit hold domain gener altern process similar set pp notic monitor extern environ intern state system detect presenc chapter abstract agent motiv agenc select altern oe oe action planner simplifi irma architectur gener activ threshold planner action oe oe oe motiv agent architectur figur relationship irma motiv agenc desir intent architectur instruct report occurr sourc origin told top level goal gener agent set condit circumst requir gener goal set condit explicitli repres agent requir agent determin goal comput requir option gener mechan predict agent section receiv request custom fulfil order agent design gener goal fulfil order custom consid order profit gener goal maintain record custom reliabl maintain black list agent priori order explicit order class profit mechan test order market condit chang agent account resourc stock time requir danger inform requir enabl goal gener difficult manag number goal agent gener practic altern restrict goal gener simpli motiv agent gener goal type instanc receipt request fulfil order trigger gener goal gener goal fulfil order goal adopt agent subsequ decid goal goal fulfil order gener irma architectur support extent possibl goal consid accept order process normal pass filter consequ achiev goal alter intern state agent condit gener goal prepar order satisfi import time goal gener necessarili time relev custom plan arriv collect order week time appar agent consid gener goal tempor context agent consid agent gener goal process plan goal typic unsatisfi precondit action agent decid achiev goal order satisfi top level goal gener chang intern state agent perceiv state environ goal materi top level goal chapter abstract agent motiv agenc relev act goal plai role set condit adopt intent tempor relev goal plai role adopt inappropri time goal adopt point agent act present goal consum comput intent refin refin evalu agent forc perform reason unnecessari time option adopt intent unnecessari reason avoid influenc time goal gener recal consid literatur bratman al describ option select function design amount comput practic filter mechan compat filter overrid filter oper parallel compat filter pass option compat agent current overrid filter pass option incompat suffici relev warrant overrid filter altern irma agent tend easili distract present intent overrid filter insensit agent behav manner option pass filter consid delib process ad agent intent structur potenti difficulti filter mechan behaviour filter depend load agent comput resourc time number altern gener compat agent current intent size intent structur comput requir refin evalu intent lead cognit overload section pollack al describ experi perform implement irma architectur design illustr effect commit current intent agent perform tileworld sensit filter overrid mechan vari vari likelihood altern option unrel agent current intent consid altern agent redirect activ altern shown commit current intent sensit filter overrid mechan commit current effect agent effect shown consist averag rate environ primari effect modifi sensit filter overrid mechan limit number altern option architectur agent consid secondari effect direct attent altern consist current intent clear effect due limit attent altern consist current intent prioriti experi observ effect effect due limit direct import factor motiv agent architectur extern mechan goal gener present option process select altern goal combin process select refin adopt goal motiv goal motiv depend import tempor relev exce current level goal consid activ threshold depend measur load agent comput trigger activ goal limit comput resourc goal activ trigger consid activ achiev serv limit comput effort involv direct plan avoid unnecessari reason distinct function motiv agent complement extend contrast function irma agent true pr exist bdi agent architectur intent architectur develop beaudoin sloman investig process gener manag goal refer consequ process emot attent primari motiv work explain human behaviour build effect artifici intellig system titl suggest process autonom author unrel goal beaudoin present specif complet agent part implement sim scenario wright basic compon goal goal manag goal goal process monitor agent belief goal basi desir figur goal gener automat chapter abstract agent motiv agenc goal filter goal manag action monitor control goal figur simplifi process diagram architectur activ term activ motiv agent activ process make goal control state candid direct manag goal test determin pass goal pass filter filter activ goal attempt pass similar compat filter filter overrid mechan bratman al likelihood goal pass filter depend load agent plan process agent directli address problem direct limit reason attent section refer gener activ goal impli goal evalu respect filter indic condit goal gener assum condit gener activ ident mechan gener altern process irma design agent issu discuss section determin condit goal practic solut goal gener activ goal consid gener goal perceiv state extern environ goal requir consequ satisfi goal consid goal process possibl discuss beaudoin sloman bratman al essenti differ irma natur filter mechan requir present filter mechan filter depend load cognit resourc filter irma base compat current intent possibl overrid influenc time tempor relev goal import direct attent agent relev goal attent agent direct goal time deadlin point act prior agent act goal urgent attent agent direct act goal worth achiev time type goal agent invest effort schedul plan achiev goal detriment possibl relev goal time factor central motiv agent machineri present thesi regard motiv agent architectur similar irma architectur approach problem limit attent process irma mechan limit direct detail influenc time goal consid literatur provid adequ explan architectur handl goal gener agent chang perceiv state environ solut suggest chapter chapter abstract agent motiv agenc chapter alarm gener chapter introduc alarm describ mechan gener simplest structur associ intens chang implement notion motiv section intens repres goal present hold section time pass intens alarm maximum intens alarm exce goal section threshold situat agent threshold high vice versa chapter alarm structur essenti index scheme subsequ remind goal birnbaum elli elli al hammond kolodn influenc time primari interest issu consid literatur goal manag mechan discuss chapter alarm focu agent attent limit number salient goal section discuss goal goal distinct class goal gener section describ time alarm process machineri section mechan gener goal encapsul alarm structur discuss goal indistinguish mechan produc importantli relat work evalu section section detail chapter notat chapter chapter appendix chapter alarm gener goal goal gener goal state affair agent motiv achiev goal autonom agent problem set solv sort decisionmak capabl term goal denot concept clear definit definit specifi term goal refer thesi definit goal made true import satisfi max tempor context satisfi tempor context consist time point satisfi dt estim long achiev time agent dl max dt dl model real number ffl variabl dl commonli refer deadlin goal fact goal deadlin necessarili impli point achiev goal deadlin pass deadlin time point agent goal satisfi agent goal goal prepar order custom arriv arriv goal order manufactur widget widget goal satisfi arriv agent satisfi custom prepar wait long hard deadlin goal satisfi goal satisfi softer deadlin repres time agent prefer goal time consequ definit goal goal tempor goal limit plan longer delet term goal importantli impli author schank abelson ortoni al author refer goal includ goal time tempor oper thesi section summari syntax definit present chapter chapter appendix goal goal gener persist satisfi cyclic satisfact goal advantag defin goal proposit made true tempor context clear distinct made process gener goal goal commonli refer goal thesi hunger gener chapter motiv hunger gener goal mitig hunger specif tempor context hunger agent decid satisfi goal motiv hunger remain gener goal tempor context domain agent receiv request order satisfi potenti custom agent decid accept goal gener order longer agent longer satisfi goal delet delet goal reason influenc lead gener goal number goal gener time servic motiv satisfi custom order import goal process gener import distinguish goal action achiev goal reason frequent concept goal singl primari satisfi action subsidiari action requir satisfi precondit goal mitig hunger primarili satisfi satisfi nutrit content diet action transform select action function planner action assum consist list precondit hold action execut list describ action make domain specif action defin aspect alarm process machineri suffici clariti action chosen complex form choic restrict scope alarm process definit state set proposit fp chapter alarm gener definit agent intern state extern environ agent definit potenti chang domain action consist list proposit list proposit addit action instanti plan inform estim time requir perform time action import agent ascrib perform goal treat goal manag mechan goal gener process broad class goal gener consid term refer goal sourc goal sourc differ goal achiev proposit gener replenish process gener goal process replenish goal automat potenti adapt specif intend taxonomi goal carbonel distinct type goal gener motiv necess classifi type human behaviour norman ortoni al activ pursuit goal state affair agent achiev condit prerequisit gener goal achiev state event detect agent environ attend meet base agent belief term refer goal gener agent present state domain decid gener goal agent attend meet time chang belief agent believ agent request attend agent adopt goal attend meet consist state chang agent request time subject filter discuss section discuss detail exist work goal goal goal gener agent gener goal agent decid gener goal decid decid time agent time goal gener necessarili time attent direct meet common goal gener agent act goal gener dai week goal tend recur time dai recur refer satisfact goal replenish goal process cyclic gener goal term replenish autonom involv reason term replenish similar class goal gener replenish goal type identifi ortoni al process gener goal cyclic section descript replenish ortoni al view replenish goal goal simpli chang intens section exist type goal gener advantag reason involv gener goal consum comput avoid insuffici type interact agent advantag agent gener goal replenish replenish requir neglig resourc requir goal gener agent requir manag agent custom regularli request order custom agent prepar order custom regular time requir request agent assum custom collect order time custom explicitli request agent respond request decid accept order agent remind prepar regular order time custom remain reliabl gener cyclic goal replenish avoid unnecessari reason filter beaudoin sloman address chapter alarm gener agent perform type goal direct gener goal cyclic simpli respond detect event agent domain sole actor domain agent affect domain activ aspect environ control domain custom commun agent devic situat offic refer order book agent content order book offic event agent agent motiv check order book gener goal agent gener goal mitig state order book period autonom replenish process tempor reason time plai central role process alarm import agent remind suspend goal time agent achiev goal deadlin agent necessarili complet long achiev goal agent repres reason appropri uncertain knowledg time point interv notat chapter appendix repres time point interv singl correct time infer mechan fit requir system agent satisfi order request custom agent twenti minut prepar order similar assum suffici stock practic time requir prepar order vari custom wait minut load bai leav order readi time agent assum twenti minut prepar closer half custom arriv agent order prepar time time account uncertainti agent predict event occur long task perform agent repres knowledg twenti minut prepar order give ten reason suffici confid tempor issu select time granular time goal longer pursu agent goal email messag written thesi accept estim length time requir email messag ten thesi month write repres time requir write thesi minut repres time requir email month express time point interv level granular time repres tupl repres estim length time interv measur accuraci estim agent predict order order order prepar order custom mean basi agent order order order order complet order agent basi estim durat futur interv time equal durat repres agent predict twenti minut prepar order give ten minut knowledg repres order ten agent predict equal thirti minut prepar order time point repres interv fix point point time repres tupl repres estim period measur accuraci estim repres time point interv vari level express element repres number unit time jth level granular repres chosen repres number number ten number minut number tm hour twenti repres time point fix point interv time repres tupl tm tm agent estim twenti minut prepar give ten order order order reason time point interv estim custom long agent prepar order requir custom agent start prepar order chapter alarm gener agent requir mechan make valid infer tempor knowledg answer question infer machineri prototyp agent perform number combin function comparison function section combin function comparison function serv illustr principl involv mechan ad subtract time point interv import maintain accuraci agent estim agent intend prepar order custom time arriv predict custom arriv hour give arriv twenti minut prepar order give ten order worst custom arriv minut earli thirti minut prepar order agent start prepar order hour twenti minut time point averag custom arriv time twenti minut prepar order agent start prepar order hour forti minut time point maintain accuraci agent prepar prepar prepar agent predict start prepar order hour forti minut give quarter prepar definit addit subtract time point interv perform ad subtract ad maintain confid note definit lead agent act conserv manner respect estim futur time point interv altern accuraci result maximum function add subtract follow intuit interpret meaningless repres neg interv time point limit number legal oper result meaningless result interv interv result perform case alarm function reason time point interv import defin mean time point occur interv time due choic interv satisfi relat durat definit relat interpret true agent suffici confid overlap confid interv time point definit lead conserv behaviour function intuit interpret agent predict event occur time event occur time infer occur relat hold appendix tm type function implement method repres reason alarm function intent goal manag mechan avoid reason goal relev agent present agent gener goal prepar order collect fridai todai mondai normal point agent act goal thursdai fridai morn agent remind goal time goal act agent remind goal time satisfi deadlin addit process goal brought attent agent heurist requir alarm structur alarm function uniform goal gener aid analysi behaviour goal manag alarm function influenc intens alarm aid goal manag process analysi alarm function time vari function intens time measur goal encapsul alarm agent function intens alarm function delai time dt delai time time agent predict chapter alarm gener oe dt max dl max oe dt max dl min max oe dt max dl min max figur exemplar alarm function alarm function point act intens alarm function maximum time max dl point time agent predict achiev goal deadlin dl estim time requir achiev goal characterist leav altern discuss ffl simplest function illustr figur intens alarm remain dt linearli max max remain max max import minim alarm function meet characterist assum simul appendix ffl transit intens dt intens max max chang curv ad minimum intens delai time figur intens min minim intens alarm delai dt max intens linearli min max addit minimum intens captur situat action achiev goal maxim relev immedi delai min max alarm function step function ffl intens alarm drop max figur intens alarm function drop min dl captur goal candid action max relev max note intens alarm measur util achiev measur relev agent act goal valu alarm function base estim estim long achiev predict difficult justifi reduc intens alarm function dl ffl intens alarm vari cyclic agent weather forecast tomorrow agent weather forecast radio minut hour agent predict relev goal time alarm function defin vari cyclic alarm encapsul goal mitig weather set intens reach maximum ten minut ten alarm trigger ten trigger discuss detail chapter chapter alarm gener agent goal satisfi goal tempor goal agent weather goal gener tempor context alarm set intens alarm maximum ten minut eleven feasibl cyclic alarm function goal similar requir uniform alarm vari uniform alarm function goal maintain ffl intens alarm vari intens linearli max figur straight line replac sinusoid function illustr characterist clear addit complex shape curv depend addit variabl alarm gener basi tempor relev goal variabl dt dl max figur notat chapter appendix definit alarm function alarm ff dt max dt max remain max dt max max max dt max dt max dl ratio dt max dt express real number deadlin dl time agent goal satisfi period time agent expect requir act satisfi goal estim made point agent attend goal satisfi time intens alarm max dl accur predict long satisfi goal decid ratio period found determin number basic unit time repres consist ten minut number basic unit ratio period time ratio integ level accuraci alarm function plan predict base agent experi accuraci predict account section agent underestim delai long goal satisfi time fail satisfi determin agent experi achiev similar decid amount time reason invest satisfact time limit alloc goal action delai time dt time agent predict act goal agent goal prepar order frozen commod custom agent frozen commod load bai long custom expect commod point agent prepar order commod custom expect arriv commod dt alarm function remain time dt max defin time window agent predict act goal alarm potenti influenc goal manag process vari potenti maximum intens max import goal greater maximum intens alarm encapsul max import goal definit import goal highli intens alarm greater goal import agent goal greater import assum thesi agent assign real number import max primari focu work determin tempor relev import clear work sloman beaudoin import goal necessarili easili model term real number exist partial order import goal depend consequ satisfi impact core idea present thesi restrict foundat remain intact model express import approxim numer import gener factor deadlin long achiev numer import alarm function design provid heurist determin relev goal import goal real number justifi chapter alarm gener event demon intern state extern state event goal creat alarm set alarm alarm figur alarm gener alarm gener system present simpl recognit similar trigger agent gener goal mechan inferenti simpli monitor extern environ intern state report mechan list condit hold event demon dedic event warrant gener goal definit function set proposit proposit hold true fp event demon evalu event evalu refer agent belief agent decid goal requir agent demon respond order request custom detect order book agent receiv order custom evalu order accept custom order profit result record reason gener goal futur section agent decid event warrant creation tempor context import determin custom request order accept goal met order creat time agent estim predict figur seri relat figur illustr function alarm process machineri final process diagram figur intermedi process diagram provid main function machineri figur alarm replenish process affect process process monitor process kei updat replenish event replenish demon oe invok sensor oe intern state oe extern state oe goal gener creat alarm set alarm alarm figur alarm gener goal achiev long time point act import alarm function defin alarm set alarm replenish visibl effect autonom replenish process gener stream goal time goal treat goal gener alarm process plan control process mechan replenish replenish mechan goal gener automat basi simpl rule replenish process gener goal recur cyclic timet agent manag order stock manufactur agent satisfi order request custom stock pass level stock diminish time futur agent goal gener servic motiv maintain stock chapter alarm gener el tend recur period commod period goal commod recur depend variabl rate widget sold custom variabl predict prudent agent widget regularli appropri control rate replenish process defin back section explan type goal gener mechan advantag agent decid widget point dai time dai stock import suffici stock widget widget replenish process defin basi specif invok goal gener widget delai time dai deadlin week max widget alarm function defin alarm direct agent attent replenish goal time week depend time replenish process goal widget recur week time import class replenish goal motiv agent seek inform state world agent motiv period check order book determin order arriv exist cancel section appendix motiv gener goal mitig agent state order book alarm encapsul goal intens time agent check order book reach max goal satisfi simpli agent seek inform state aspect inform lead gener goal check order agent find number order arriv time check inform lead agent decid gener number replenish process monitor state goal gener process delet goal replenish agent influenc goal gener basi goal specif long replenish process exist figur replenish rule inform potenti opportun danger discuss chapter alarm replenish agent satisfi goal goal gener week detect delet specif replenish process emploi demon trigger replenish goal similar goal present alarm function replenish alarm maximum period time alarm encapsul goal gener figur behaviour goal gener replenish consist observ schank abelson pp ortoni al pp pp author describ import type goal insist time satisfi mention section replenish process gener goal cyclic contrast schank abelson ortoni al view goal vari insist level differ enabl goal gener replenish treat ident agent plan reason type specif fix period replenish suffici fulli captur behaviour requir agent contract provid custom ident order custom arriv collect order fridai basi agent gener replenish process set alarm direct agent attent goal prepar weekli order week previou order satisfi due pressur agent late order week custom forc wait order accept order goal satisfi goal replenish deadlin week fridai agent satisfi regular time order complet depend current order complet regular order prepar timet fix period replenish goal satisfi contract provid custom order fridai encod timet replenish process invok deadlin replenish goal fridai rule defin characterist replenish process defin gener goal fix period time goal gener process timet deadlin type process captur requir characterist behaviour automat gener goal chapter alarm gener time intens threshold replenish alarm figur cyclic replenish goal simul figur data simul alarm process appendix illustr behaviour instanc goal mitig temperatur room domain section instanc goal type gener cyclic replenish process govern templat goal replenish deadlin hour time delai time hour estim travel time goal import instanti data present show intens alarm alarm trigger goal activ goal achiev goal replenish time section agent prior time commit alarm time shift effect section mean alarm trigger exce time mitig section intens alarm rise trigger goal activ goal delet goal mitig temperatur room replenish intens alarm remain delai time trigger goal achiev alarm gener trigger effect time commit discuss clear cyclic behaviour simul data alarm replenish manipul replenish serv delet modifi process goal replenish figur agent custom suppli regular process gener gener goal meet order time agent contractu oblig custom prepar order time contract contract bind custom custom requir collect pai order specif time contract condit broken replenish process delet reason exist process prepar regular order custom custom requir regular custom custom pai order hour order collect process detect condit longer hold delet custom fail pai replenish goal contract negoti process gener delet temporari replenish process describ replenish process persist long condit hold domain agent car automat gener goal fill car condit car remain agent possess process detect condit delet replenish delet agent surviv uncondit agent surviv maintain stock suffici batteri charg act goal replenish process analog physiolog drive human hunger thirst condit process delet stori uncondit replenish process influenc behaviour agent concern mainten level widget period replenish goal widget depend rate widget variabl widget rate agent widget task process adapt characterist agent chapter alarm gener replenish rule situat agent find widget due pass widget deliv faster sold replenish period commod short agent regularli gener goal widget event insuffici stock order goal gener period replenish larg monitor success failur autonom replenish characterist process adapt situat chang agent attempt respond chang circumst statist analysi effect adapt period process replenish characterist timet replenish process reevalu agent timet replenish process gener bought milk agent regularli run milk mondai tuesdai replenish process agent adapt recur tuesdai replac period replenish period dai adapt reevalu automat goal gener process requir investig discuss relat work ortoni al distinguish goal abandon goal activ pursu goal categori satisfact goal preserv goal schank abelson effect type cyclic necessarili impli goal treat differ agent type chapter shown effect produc distinguish process goal gener goal influenc agent activ collect regular pai replenish goal ortoni al normal circumst suffici describ behaviour agent driven influenc singl goal insist time case agent work extra hour paid earlier time normal pai agent abil gener goal collect extra discuss pai ortoni al type goal activ pursuit type goal system present differ goal collect regular pai extra pai check tempor context goal fact gener process cyclic goal direct behaviour simpli period shown insuffici goal recur cyclic necessarili fix period replenish process present goal replenish period timet deadlin fact timet deadlin gener constant period agent requir activ agent process control final note intuit odd goal cyclic activ direct achiev agent driven stream goal limit life cyclic goal direct behaviour easili understood carbonel initi taxonomi context model human behaviour taxonomi restrict includ cyclic behaviour driven physiolog possibl gener goal timet cyclic gener intern physiolog state chang descript suggest intern physiolog state goal gener carbonel type goal gener type view consist idea present chapter pp expand taxonomi schank abelson includ fifteen type goal goal lie taxonomi includ roughli correspond physiolog carbonel concern maintain state variabl process environ period chang oil hammond al categori correspond goal gener replenish discuss section taxonomi schank abelson ad achiev goal gener categori achiev state crisi goal distinguish goal term reason gener instrument delta goal gener pursuit higher level goal addit bought lotteri chapter alarm gener concern similar ortoni al goal activ justifi distinct identifi relat problem opportun satisfi exist clear exist problem opportun type goal goal gener opportun deal problem exampl illustr opportun highlight john read peopl magazin wait john mail letter home john prior goal read peopl magazin goal gener simpli john notic magazin line pass john typic motiv goal post letter opportun achiev exist goal present inact affect likelihood goal activ section alter goal achiev exist opportun lead goal opportun easili reach highli prefer state affair number goal type correspond goal suggest wilenski chap reason human decid gener goal beaudoin term denot broad class control state includ subclass motiv state disposit assess situat disposit produc term goal restrict fact beaudoin motiv broadli goal discuss illustr wide rang interpret term definit indistinguish thesi concern produc taxonomi goal goal role control state process agent architectur clear definit provid consist elli elli type intermedi step essenti step function vari shortest durat durat repres time interv discuss agent predict delai intent achiev agent intent attend meet repres agent intent meet friend repres step function longer durat perform interv agent act delai agent remind delai intent agent remind time agent remind intent perform interv simpli captur predict agent make achiev width interv approxim accuraci predict interv relev remind delai intent time predict goal achiev influenc recal delai perform interv suffici basi comput model human behaviour design artifici intellig system alarm process machineri predict futur event repres predict similar perform basi alarm function alarm function repres predict deadlin travel heurist measur chang relev goal time chapter introduc notion goal alarm describ importantli mechan goal gener goal gener process involv trigger event detect replenish process involv alarm design structur encapsul goal potenti subsequ trigger agent attent goal time futur alarm base simpl uniform agent manag goal mechan gener chapter alarm gener chapter danger time commit previou distinct type goal gener mechan alarm set process refer encapsul prevent agent goal agent remind goal time dt max time time alarm set subsequ domain chang unexpect domain impact inact goal goal suspend encapsul alarm goal consid light chang distinct import transient effect intens alarm consid opportun danger time commit intens alarm due effect goal consid earlier agent influenc intens opportun satisfi inact goal opportun time set advantag agent satisfi goal minimum plan time gener trigger goal encapsul alarm reason plan process agent agent advantag opportun made awar goal opportun agent emploi mechan detect opportun satisfi inact goal section concern detect opportun satisfi inact satisfi requir goal requir process effort trigger chapter danger time commit opportun encod opportun satisfi inact goal detect demon definit time alarm agent select encod limit number opportun demon demon monitor state alarm demon inform event figur condit trigger opportun demon precondit action minimum plan satisfi goal definit opportun demon simpl process involv set proposit opportun demon precondit action satisfi goal postcondit success reli agent select encod action demon select opportun demon made basi number criteria opportun agent achiev goal minimum plan effort limit action opportun action plan georgeff vari specif abstract plan effort requir refin primit oper execut specif action opportun plan script recip design plan effort frequent activ primit action agent frequent visit develop restaur script script requir plan effort good candid select opportun characterist planner action planner influenc opportun encod good choic opportun demon occur agent experi nich give indic opportun present frequent action agent precondit action hold time agent frequent mitig cash automat cash machin bank enter bank cash automat cash machin frequent bank open planner script recip commonli refer planner plan recip base prior plan recal store possibl instanti present circumst opportun satisfi inact goal process affect process process observ process kei updat replenish event replenish demon oe event invok sensor oe intern state extern state opportun demon oe opportun oe goal gener creat alarm set alarm set opportun demon alarm figur detect opportun chapter danger time commit limit number agent frequent carri cash card book opportun adopt agent satisfi goal mitig hunger eat agent encod opportun automat cash machin cash insid bank agent wait long queue cash machin adopt opportun cash action adopt opportun situat encod opportun demon import goal opportun demon agent encod depend import agent ascrib quota alloc opportun depend criteria number opportun demon limit quota time detect opportun opportun time set advantag circumst exist action minimum plan effort satisfi inact goal opportun point achiev goal time robbi home hard dai car pass automat recharg machin opportun satisfi goal fulli robbi consid act goal eventu satisfi goal replenish replenish goal delai time hour deadlin hour time goal encapsul alarm trigger attent time futur robbi close proxim automat recharg machin regist satisfi newli gener goal alarm encapsul goal direct robbi attent goal light opportun opportun inappropri point robbi recharg hour time goal recharg satisfi fact point robbi achiev goal recharg time reflect intens alarm intens alarm opportun satisfi inact goal goal relev agent alarm heurist direct plan direct attent agent opportun notat chapter appendix definit goal worth achiev intens alarm greater action anticip potenti opportun perform present opportun fa dg present state function definit effect detect opportun provid alarm heurist flexibl respond opportunist chang circumst flexibl robust natur alarm heurist direct limit reason attent accept detect give agent satisfi demand cf birnbaum al kolodn agent highli import urgent goal exist potenti opportun satisfi import reason reason resourc consum opportun critic time robbi robot race home hard dai car plant pursu scrap merchant pass automat recharg robbi detect opportun immedi consid stop satisfi goal recharg robbi distract wrap lamp post scrap inappropri robbi opportun situat robbi direct attent escap scrap merchant exist opportun trigger attent intens alarm current threshold threshold greater max agent awar opportun intens alarm max exist opportun intens alarm max opportun effect chang import goal effect exist opportun chapter danger time commit simpli mean goal relev agent tempor relev import presenc tempor relev alarm maximum exist opportun simpli make agent remind goal agent remind goal import max greater current threshold reconsid robbi assum exist potenti opportun simpli intens goal chase scrap robbi pursu import urgent goal insensit repres section robbi remind goal fulli charg work birnbaum al hammond discuss section import inact goal agent greater max impact detect opportun achiev goal goal consid light opportun mechan opportun regist ad action opportun achiev alarm structur detect opportun pass agent opportun remov list appendix refer page discuss process goal trigger light section paragraph exampl effect opportun alarm trigger simul simul figur data simul alarm process appendix illustr behaviour number goal gener servic motiv fulli stock opportun satisfi inact goal occur agent plan order stock goal ic cream activ agent construct plan satisfi constitut opportun satisfi goal commod ad order occur simul alarm encapsul goal ic cream trigger activ alarm sampl minut past alarm encapsul goal commod intens trigger simul agent consid activ goal alarm mitig danger time satisfact goal time intens alarm alarm replenish threshold alarm alarm replenish figur behaviour alarm encapsul goal gener servic motiv fulli stock section descript effect alarm encapsul goal mitig trigger activ goal constitut opportun satisfi goal goal activ note goal ic cream replenish goal cyclic replenish alarm encapsul goal remain activ goal constitut opportun satisfi point goal achiev danger time satisfact goal section concern constitut danger time satisfact goal goal encapsul alarm satisfi alarm trigger agent awar goal time dt max max agent predict accur section agent accept order remind goal suffici time order prepar custom arriv alarm function defin reach maximum intens time custom expect arriv minu estim time requir prepar order threshold lower max chapter danger time commit oe alarm creation time variabl intens alarm function goal recharg max dl oe variabl intens alarm function goal receiv widget deliveri ae min dt max dl oe oe durat intend action oe scope persist constraint oe time requir time figur interact intend action inact goal alarm trigger max threshold greater max alarm trigger threshold drop back max chapter chang time requir achiev inact goal significantli danger time satisfact goal illustr figur robbi rebuilt robot work car plant receiv instruct boss attend design meet meet robbi direct attent proce construct plan achiev plan plant build side town robbi number inact goal receiv deliveri widget schedul dai essenti element manufactur deliveri truck widget expect arriv design robbi unawar goal inact design meet robbi remind widget deliveri robbi time back plant meet meet deliveri truck robbi choic leav meet return receiv risk car plant short boss sack danger time satisfact goal robbi remind inact goal receiv widget deliveri leav design deliveri reschedul boss inform conflict conflict resolv robbi awar conflict intend action inact alarm encapsul goal longer time remind agent section agent find situat time requir achiev inact goal significantli action agent constitut danger time satisfact goal section alarm appropri condit definit alarm function typic made normal behaviour agent section robbi gener goal receiv widget deliveri plant rememb goal ten minut estim arriv time truck gener give robbi suffici time suspend present activ meet deliveri truck entranc plant robbi suspend goal encapsul alarm function defin alarm reach maximum ten minut expect arriv time rememb deliveri ten minut robbi car plant alarm agent condit hold robbi subsequ intend danger time satisfact inact goal illustr figur hour robbi travel design meet back plant design meet schedul hour earlier robbi half hour back meet robbi suffici time back plant meet deliveri truck danger time satisfact inact goal time danger effect action critic determin inact goal danger agent detect condit appropri alarm hold time requir reinstat condit critic determin effect danger intens alarm section alarm agent suffici monei agent simpl rule thumb long gener mitig alarm agent time requir agent locat depend travel robbi goal receiv widget deliveri robbi plant chapter danger time commit minut load robbi town robbi countri appropri condit list tupl proposit period time appropri condit robbi alarm receiv widget deliveri robbi plan hour reinstat appropri condit robbi plan dai reinstat appropri condit agent remind inact goal time appropri condit alarm encapsul goal hold detect danger time satisfact inact goal reli agent encod relev appropri condit danger detector appropri condit alarm select encod alarm gener opportun demon alarm encod figur danger due conflict intend action inact goal plan attent agent restrict small number salient agent activ goal plan problem simplifi goal agent attend interact goal planner present unawar inact action agent plan chang domain inact goal longer satisfi time planner unawar inact unawar conflict resolv agent intend perform action delet alarm appropri effect goal satisfi add time requir satisfi goal agent intend effect danger time satisfact goal insuffici time agent danger effect action produc effect complet max agent made awar inact goal action perform agent intend danger effect persist constraint refer causal link post protect danger time satisfact goal process affect process process observ process kei updat replenish invok event replenish demon oe event sensor oe intern state extern state opportun demon oe opportun danger detector oe plan control oe goal gener creat alarm set alarm set opportun demon set danger detector alarm figur detect danger chapter danger time commit time case illustr figur robbi plan attend constraint post proposit commit robbi remain locat meet durat meet danger effect constraint insuffici time robbi return car plant meet deliveri truck expect arriv combin action produc danger effect inact persist constraint time requir creat conflict intend action goal effect danger action agent plan shift alarm function period time function reach maximum earlier time time danger action perform notat chapter appendix definit exist persist constraint agent plan constrain proposit pc hold pc pc conflict jth appropri condit alarm constraint hold time max dl alarm shift alarm reach maximum period endang action perform estim long agent achiev inact alarm reach maximum pc intend consequ plan pc pc pc pc max dl dl dl dl dl postcondit action agent plan conflict jth appropri condit alarm interv action perform overlap interv max dl alarm shift reach maximum unintend consequ max dl definit constitut danger time satisfact inact goal depend plan algorithm agent design discuss assum planner impli alarm process machineri restrict type plan algorithm danger time satisfact goal dl dl dl dl shift alarm function ensur function intens inact goal maximum achiev action perform robbi inact goal receiv widget deliveri encapsul alarm reach maximum minut arriv time deliveri truck gener hour unload truck robbi instruct attend report design meet schedul meet expect hour compli robbi remain meet finish persist constraint post proposit meet expect robbi hour design depart build car plant construct agent intend travel plant design depart action danger inact goal receiv widget conf alarm function encapsul goal receiv widget deliveri shift alarm function reach maximum remind robbi conflict danger action perform note point robbi act goal awar planner attempt resolv conflict danger due domain agent intend perform action danger time satisfact inact agent process endang goal proposit typic precondit action plan persist constraint causal consist action satisfi proposit action proposit precondit persist constraint consist action satisfi proposit time proposit hold choic complex definit chapter danger time commit alarm function goal recharg dt max dl oe alarm function goal visit job centr dt max ak dl oe ak dl dss offic wait queue max ak dl recharg replenish time figur interact time commit goal domain chang action alarm encapsul inact goal longer alarm appropri condit hold due influenc agent danger time satisfact inact goal agent warn chang shift alarm function time danger remov max definit proposit hold domain conflict jth appropri condit alarm shift reach maximum max unanticip consequ agent due action danger time satisfact inact goal detect emploi danger demon fire alarm appropri condit longer hold figur appendix time commit construct agent commit activ time pursuit goal commit reduc time agent act satisfi time commit goal effect prior commit action agent danger time satisfact goal danger time requir satisfi time commit reduc free time action pursuit goal illustr figur robbi redund robot plan action involv collect benefit depart social secur robbi start act goal time goal achiev dss offic open plan achiev robbi commit time requir dss offic hour wait time robbi intent recharg inact goal job centr wait queue dss offic robbi rememb job centr lunch job centr dss offic appropri condit alarm encapsul goal visit job centr corrupt long robbi remain danger longer robbi achiev goal visit job centr commit made plan collect benefit dss offic reduc time robbi job centr robbi remind goal visit job centr plan chang present dilemma robbi decid job centr recharg dss offic subsect discuss process plan interpret determin agent time detect conflict inact goal time effect conflict alarm agent time commit made process inact goal earli suffici time satisfi deadlin plan interpret time commit interv time agent commit activ plan view number interv time interv agent intend act typic plan view partial order sequenc action time constraint robbi collect benefit plan achiev goal time constraint final action plan plan achiev robbi goal recharg figur chapter danger time commit hj hj hj figur partial order plan extern time hj hj figur abstract time constraint case robbi achiev goal goal achiev goal achiev robbi achiev robbi complet plan recharg ten minut complet time constraint plan chang reflect fact robbi recharg deadlin flexibl goal limit tempor relev plan minimum singl time action plan perform illustr figur plan consist action time action time commit made agent construct plan calcul simpli propag constraint plan collect period activ action perform perform order combin action singl time commit durat action abstract singl time commit time commit time commit time commit singl time commit figur abstract time commit process plan assum agent thing time agent perform action time complet action sum expect durat procedur tend produc overestim time agent execut plan agent predict opportun perform action reflect expect durat action plan estim length time requir perform element action typic abstract action hierarch plan structur time commit gener plan interpret procedur repres estim long agent perform action current plan plan progress inform estim improv action perform start time commit ad time figur fit combin produc time commit figur start time commit time commit combin figur detect conflict time commit inact goal transform plan list time assum agent leav activ moment achiev goal deadlin justifi object alarm mechan remind agent goal suffici time chapter danger time commit achiev time agent detect situat agent plan activ result insuffici time achiev goal refer illustr figur robbi dss offic moment achiev goal interv time max dl overlap interv max dl agent remind inact goal max goal sacrif goal visit job centr dl conflict time commit made plan achiev activ goal action interv max dl effect alarm encapsul goal visit job centr due agent time commit robbi start act plan collect benefit max robbi leav dss offic inact goal trigger attent max suffici time suspend current job centr return achiev origin goal collect effect agent time commit inact goal determin assumpt left situat inact goal satisfi time prior commit detect effect conflict time commit alarm agent commit activ period max dl possibl agent remind inact goal time achiev deadlin exist conflict time commit alarm function shift reach maximum earlier time notat chapter appendix definit simplest time tc tc conflict alarm interv tc tc tc overlap interv max dl alarm shift reach maximum time tc tc alarm shift tc tc tc max tc tc dl dl tc tc tc dl tc tc dl dl tc tc alarm conflict time commit time commit tc tc tc tc time commit process affect process process observ process kei updat replenish invok event replenish demon oe event sensor oe intern state extern state opportun demon oe opportun interpret plan evalu time conflict oe danger detector oe plan control oe goal gener creat alarm set alarm set opportun demon set danger detector alarm max figur influenc danger time commit chapter danger time commit interv tc tc tc overlap interv max dl interv tc tc tc overlap max tc dl tc alarm shift reach maximum tc tc alarm shift interv max tc dl tc overlap time commit tc tc tc time shift due time commit tc tc tc tc algorithm appendix number exampl effect time commit trigger alarm domain simul appendix specif section note matter time slot found fit inact goal delai time time max true schedul plan activ schedul agent consid goal goal abandon due lack time planner heurist procedur underestim time agent agent pursu inact goal time action plan read paper travel work ride bicycl opportun achiev goal time estim effect agent time commit made cost involv process requir outweigh small benefit gain estim agent partial achiev perform unrel action servic return complet agent inact goal tidi load bai agent partial tidi area recharg batteri place order return goal affect outcom achiev goal interleav activ estim time agent action goal found agent estim hour achiev goal tidi load half hour period time commit knowledg time requir achiev goal interleav activ result estim effect agent time commit alarm benefit gain knowledg determin outweigh small comput requir alarm process machineri discuss discuss relat work remind suspend goal presenc opportun wide requir design agent make time incomplet imperfect model environ birnbaum collin hammond present distinct view detect opportun satisfi goal suspend fit agent current plan birnbaum collin argu explain form opportun exhibit index suspend goal memori birnbaum chapter suffici explain suspend goal view independ process entiti infer exist opportun infer feasibl solut recognit opportun satisfi suspend goal rout schedul goal fit current plan associ memori memori structur agent sensori data gener model element memori suspend goal agent remind goal index goal associ memori mechan discuss birnbaum refer al kolodn goal limit number exist constitut select goal index associ memori basi predict remind suspend goal achiev normal inferenti process associ memori structur memori consid select limit number potenti opportun encod opportun demon similar function difficulti approach select index suffici gener enabl goal activ wide rang opportunist suffici specif number inappropri recurr suspend goal requir agent remind goal birnbaum pp discuss approach encod opportun demon identifi import consid mechan pursu goal specif goal index term overli specif featur case chapter danger time commit opportun satisfact present opportun pursu goal abstractli index goal term highli abstract featur make difficult retriev goal abstract featur tend difficult process carri problem address design alarm process machineri restrict condit opportun precondit action condit occur domain agent action achiev activ goal agent act goal similar condit opportun occur reason involv opportun import differ opportunist remind approach discuss birnbaum chapter al mechan discuss chapter condit agent remind suspend goal predict encod agent remind suspend goal present state associ memori includ number tempor index implic tempor index central motiv agent present opportun achiev suspend goal remind goal exist opportun intens alarm exce threshold opportun simpli alarm encapsul relev suspend goal intens maximum agent pursu import urgent goal threshold set maximum intens agent remind goal light opportun opportun defin time set advantag agent respond situat inact goal achiev minimum plan effort time delai time goal collin system heurist focu process decid situat fact present opportun satisfi goal system pareto act realist environ refer featur focu determin situat trigger possibl opportun conflict goal agent pursu inact goal index term set condit discuss constitut opportun satisfi goal choic condit opportun mechan bring agent attent condit goal consid light refer featur object constraint opportun compar refer featur agent activ goal conflict featur opportun opportun truck agent pick heavi featur activ goal travel agent reason focuss conflict agent decid block pick weight truck exce limit bridg conflict refer opportun assum valid assum refer featur provid heurist mechan agent reason opportun remind suspend goal light opportun goal achiev time opportun suffici agent present behaviour circumst reason influenc danger time commit investig detect danger time satisfact inact goal similar detect conflict action plan plan algorithm persist constraint causal post action plan ty postcondit action precondit action conflict conflict persist constraint mechan conflict alarm specif number goal successfulli achiev condit hold interv max dl action agent plan endang appropri planner made awar goal time conflict resolv combin effect danger time commit provid complet set influenc time remind suspend goal chapter approach deal opportun satisfi inact combin influenc danger time commit consid context agent remind goal situat present opportun satisfi situat goal longer satisfi effect time agent satisfi chapter danger time commit goal influenc alarm opportun conflict activ quicker achiev goal reduc time conflict goal limit inevit consequ fast cheap heurist chapter direct plan attent chapter discuss process focu agent plan attent direct goal agent remind suspend goal intens alarm goal exce refer alarm trigger threshold intens alarm higher trigger vice versa manipul threshold agent control goal consid time section alarm goal alarm consid process section primari goal manag mechan maintain limit set goal agent act leav planner decid achiev chapter threshold mechan goal brought attent agent essenti simpl intens alarm greater current threshold alarm goal encapsul alarm consid threshold repres sensit agent goal threshold agent intens alarm greater exce threshold threshold agent alarm lower intens trigger manipul threshold agent limit number alarm number goal consid action effect chang threshold success alarm mechan reli heavili threshold level threshold set agent tend pursu activ goal detriment inact goal import agent remind inact goal alarm intens exce tend agent number import urgent task chapter direct plan attent pursu cf beaudoin threshold fewer altern goal agent busi relev insensit inact goal apt agent delai tidi busi prepar urgent delai prepar urgent order tidi agent remind urgent goal pursu import goal threshold set inappropri high threshold effect rate alarm trigger threshold number alarm goal tend consid earlier threshold set agent tend overli distract altern goal gener agent distract goal tidi process prepar urgent order reduct threshold tend number goal comput resourc consum activ inappropri low threshold lead agent spend time altern inappropri goal time pursu activ task threshold control function threshold control rate alarm number goal consid activ cycl section agent busi pursu import urgent point resourc direct altern altern suffici relev agent goal pursu unimport afford invest resourc altern action threshold control requir met problem address remaind section subsect threshold set feedback control actual alarm trigger rate control requir rate modifi threshold figur import differ threshold control mechan classic control theori dynam control actual trigger rate requir trigger rate manipul threshold limit threshold threshold set discuss detail subsect requir trigger rate compar actual trigger rate actual rate lower requir threshold lower lower threshold alarm trigger discrep threshold threshold ceil requir trigger rate set threshold threshold alarm actual trigger rate figur control alarm trigger rate actual rate higher requir threshold opposit effect alarm trigger rate thermostat behav similar temperatur room actual trigger rate temperatur set thermostat requir trigger rate thermostat switch heat system temperatur room requir room hot feedback ensur rate alarm trigger effect control independ total number alarm influenc agent total number alarm number alarm threshold level time tend assum total number alarm intens time analysi assum agent steadi flow goal deadlin agent goal evenli threshold set alarm averag alarm trigger cycl total number alarm alarm trigger rate doubl case alarm trigger rate total number alarm threshold remain trigger rate cycl total threshold initi alarm exce assum agent goal evenli distribut alarm trigger time alarm trigger depend time agent goal satisfi period time larg number goal concentr high intens alarm necessarili constant time feedback control rate alarm threshold tend time high concentr high intens alarm concentr low rate alarm trigger chapter direct plan attent burst alarm temporarili swamp system goal activ section determin requir trigger rate number activ goal load cognit resourc agent mean agent consum greater time pursu activ goal limit time plan cognit load rate alarm trigger number goal consid activ trigger rate agent focuss distract current goal task cognit load trigger rate agent easili distract principl trigger rate reduc lower limit threshold highest max prevent distract practic limit level threshold sensibl set load agent goal suffici import agent busi high cognit tidi remind import goal prepar custom order procedur determin threshold ceil discuss section maximum trigger rate set alarm achiev set threshold mean agent goal consid overload agent plan act capabl advantag alarm mechan machineri low penalti resourc threshold manag system cognit load agent due set activ goal depend long gener execut plan thing slower agent fewer goal satisfi interv time cognit load determin simpli number goal activ goal easier plan achiev easier agent satisfi goal recharg prepar larg order custom goal easier achiev circumst agent opportun satisfi difficult time plan time achiev natur natur plan achiev goal give indic work agent commit wai desir oper plan includ threshold estim long successfulli execut oper fox oper directli execut planner select oper eat joe restaur satisfi goal mitig hunger oper requir agent decid joe meal paid time agent refin abstract time interleav execut hierarch planner pr plan time case plan time factor walk past joe opportun satisfi goal mitig hunger decid plan effort involv time refin abstract oper execut action account give suffici accur estim work involv fox long abstract oper hierarch plan includ estim long alloc planner refin primit oper execut combin plan execut time give good estim time agent invest oper time agent invest activ time agent pursuit goal proport time commit activ goal fewer altern agent prepar time period agent activ goal requir readili task plan repres action agent intend perform time invest agent intend perform part plan agent attend meet repli electron mail messag minut meet import perform action urgent agent act intend act time commit action greater effect current cognit load action perform hour agent commit perform action hour greater effect cognit load perform time invest attend meet effect cognit load time action insert agent plan time magnitud effect depend agent intend act time meet plan effort involv definit opportun section time set advantag circumst agent achiev goal minimum plan effort chapter direct plan attent effect intend action cognit load cognit requir trigger estim simpl procedur period agent commit action fa durat interv requir trigger rate estim notat chapter appendix definit requir trigger rate govern ratio area function interv agent commit area function interv free commit cognit load planner requir trigger rate discret discret function serv bia effect commit interv cognit load function decai constant half life effect commit interv cognit load durat time interv commit interv action fa shown figur effect cognit load perform action estim consum time time perform greatest effect cognit load action similar influenc cognit load durat determin threshold ceil requir trigger rate determin basi cognit threshold manipul control actual trigger rate level agent task busi activ easili distract intend small proport time mention limit level threshold sensibl threshold ceil agent remain sensit goal suffici import rel goal busi threshold control mechan provid requir trigger rate threshold threshold ceil suffici reduc trigger rate definit due agent threshold figur effect action tempor characterist cognit load finit capabl work discuss detail chapter agent continu possibl activ goal alarm intens exce threshold activ goal suffici import urgent pursu section activ goal agent longer achiev activ goal time situat agent decid activ involv decid import goal amount effort invest newli activ import agent intend attend meet hour email messag minut agent busi unimport task moment email remain sensit goal import necessarili import attend meet agent intend attend meet email threshold ceil higher reflect fact import goal urgent import action time agent intend perform action influenc threshold ceil threshold ceil determin weight chapter direct plan attent import action plan function function estim cognit load decai constant half life function ensur threshold ceil influenc action agent intend perform earlier definit threshold weight averag import action agent plan imp summari threshold determin evalu cognit load agent threshold ceil cognit load defin requir trigger exact relationship cognit load requir trigger rate depend characterist agent plan act capabl requir trigger threshold rate alarm current updat threshold determin definit updat reduc actual trigger rate exce ffi threshold ceil actual trigger rate li ffi ffi chang threshold level ffi ffi ffi threshold manipul trigger rate control limit rang requir trigger rate size rang determin variabl variabl requir prevent threshold fluctuat actual trigger rate control close requir rate size step threshold chang small enabl accur manipul larg threshold alter suffici quickli system respond cognit load paramet depend implement alarm mechan goal process goal process agent remind make process goal agent process goal wai goal activ alarm alarm delet goal left reconsid goal activ alarm delet agent decid act goal activ mean goal ad focu plan attent mean goal achiev planner alarm goal serv delet alarm delet goal activ goal activ agent longer alarm goal delet agent longer influenc alarm alarm mitig fact agent consid goal mean longer relev present time alarm goal alarm mitig effect mitig reduc intens alarm subsequ maximum agent reconsid goal time futur addit effect action opportun list alarm fact alarm trigger presenc opportun mean opportun consid section notic plan control goal manag mechan independ goal manag mechan monitor planner planner focu plan attent direct delet goal figur goal activ alarm delet agent attempt achiev goal goal activ achiev goal sole planner agent decid activ alarm delet alarm goal activ advantag agent achiev goal present situat decid advantag activ agent guid agent attempt achiev goal time goal agent greater benefit agent gain chapter direct plan attent process affect process process observ process kei replenish event demon oe sensor oe intern state extern state opportun demon oe opportun time commit oe danger detector oe oe goal gener creat alarm alarm set demon detector set alarm action plan control goal delet focu plan attent goal activ goal alarm mitig alarm trigger oe set requir trigger rate requir trigger rate set threshold threshold figur architectur goal gener manag goal process ti agent activ goal achiev reason period time serv primari function goal manag limit agent plan attent goal avoid unnecessari reason agent time pursuit import goal greater import goal greater benefit agent gain activ schedul problem solv goal vari import time determin basi util principl ensur agent agent delai pursuit goal task relev pursu principl concern limit number goal visibl planner goal estim ten minut achiev insuffici time hour goal goal activ alarm mitig reconsid section goal activ time achiev reason time period rel time requir achiev goal goal estim coupl activ suffici time half estim coupl suffici time agent conform principl agent manag plan busi schedul tidi leav free time goal agent remind order prepar reliabl custom due alarm threshold goal consid activ principl agent plan time maximum benefit pursuit activ goal insuffici time agent achiev goal activ goal goal activ agent conform principl treat goal basi agent conform principl goal agent consid import prioriti heurist make time estim flaw agent act import goal insuffici time left import goal predict prove inaccur chapter direct plan attent agent conform principl manag principl plan busi schedul tidi activ agent remind import goal meet custom order principl goal achiev reason period time plan activ greater import goal activ case goal activ meet custom order import tidi agent continu time pursuit activ remind suffici import altern goal ad focu plan attent alarm trigger basi goal process except estim long satisfi goal chang agent present opportun satisfi goal decid time achiev goal opportun achiev goal defin recognit action perform present state satisfi goal postcondit alarm trigger presenc time estim goal length time action estim time estim goal estim long satisfi goal made time goal gener encapsul alarm alarm delet goal activ section consid condit alarm delet goal activ occur alarm alarm delet goal delet goal goal agent longer satisfi goal cohen levesqu goal satisfi agent activ goal act goal satisfi agent satisfi goal action awar goal alarm goal delet goal activ agent fail find plan achiev goal agent goal achiev agent receiv request potenti custom order satisfi specif time agent gener goal prepar agent set alarm remind goal time custom goal process schedul arriv agent busi task remind goal time longer agent achiev custom left goal hard goal achiev deadlin possibl agent gain continu act goal goal order stock widget agent remind goal import agent achiev goal deadlin time agent achiev time agent achiev goal type deadlin refer soft deadlin section simplifi problem great deal agent gain achiev goal time pass agent point time gain achiev goal time alarm goal delet goal activ condit agent delet alarm activ goal goal longer relev agent constitut relev agent receiv request potenti custom order satisfi time agent decid accept reject order agent make basi custom agent expect custom collect pai time order profit agent price agent charg commod order larg agent make suffici profit agent gener goal satisfi custom order custom requir order satisfi goal profit custom reliabl agent gener goal reject request custom requir order order agent consid custom figur made agent simpl critic determin goal gener initi chang domain made process reason exist goal goal agent gener goal satisfi order reason chapter direct plan attent request receiv reject order meet order figur process gener goal exist goal custom requir order profit made negoti norman rosenschein custom reliabl time goal gener agent evalu event trigger decid gener goal satisfi section goal achiev period due replenish process adopt automat gener goal gener goal serv avoid unnecessari reason section reliabl custom requir order tuesdai negoti contract agent agent prepar order collect tuesdai custom payment condit contract remov custom request agent decid adopt order agent assum custom requir order reason replenish goal custom requir regular custom break condit contract includ condit custom collect pai time time goal alarm situat chang custom fail goal process collect agent receiv messag cancel payment reason gener goal longer agent longer goal satisfi agent goal satisfi order custom custom consid reliabl custom subsequ prove agent longer achiev goal agent satisfi subsequ order agreement reach custom alarm reason exist goal alarm check alarm delet goal activ reason exist goal longer hold action delet alarm agent gener goal alarm encapsul goal satisfi custom order delet custom longer consid agent gener goal inform custom order reject custom free commenc negoti agent order requir alarm mitig intens alarm reflect relev goal encapsul alarm agent alarm trigger goal goal longer relev present time alarm fact goal consid intens alarm mitig time goal consid goal relev agent consid goal check order book decid activ goal time intens alarm relev goal approach max agent decid activ forc reconsid goal time threshold subsequ max mitig alarm model construct function intens ad alarm effect danger time intens alarm intens alarm function time trigger time agent mitig stop mitig function definit effect mitig function alarm function illustr figur notat chapter appendix chapter direct plan attent min max min max max min max figur effect mitig alarm function goal process intens time max max min dt threshold figur effect repeat mitig alarm definit mitig function min min ratio express real min max approach max max agent goal check order alarm encapsul goal agent decid activ goal time chang fact agent commenc action max ensur goal satisfi time agent set max forc reconsid goal critic time threshold subsequ max case figur max agent tend activ goal frequent goal activ effect agent goal decid mitig alarm function illustr figur alarm function min dt continu rise linearli max intens alarm exce threshold goal encapsul alarm consid made process goal simplifi pictur alarm behav threshold assum constant max intens alarm due danger time commit consid chapter direct plan attent intens time max max min dl threshold figur effect repeat mitig alarm goal check order point time agent decid activ goal agent consid alarm mitig min intens alarm back max exce threshold goal reconsid point agent decid activ alarm mitig exce threshold time goal consid frequent max approach activ time max predict point time agent commenc action successfulli achiev goal goal activ max goal activ time max agent suffici time satisfi goal deadlin time pass chanc goal satisfi deadlin goal activ time approach max frequenc alarm trigger maximum time proce max trigger frequenc minimum figur frequenc alarm trigger agent consid goal threshold constant max relat modulu differ max goal agent continu remind goal minimum frequenc agent decid delet alarm goal activ stage planner maximum trigger frequenc minimum durat tmax goal consid cycl time alarm impract solut goal process time intens alarm alarm alarm alarm threshold figur behaviour mitig alarm simul attempt achiev definit differ time mitig min max max max min max jt max min max max jt max max jt max jt addit mitig alarm goal activ opportun alarm longer influenc intens alarm mechan effect achiev opportun demon insert detect opportun alarm structur opportun demon remov opportun alarm structur alarm trigger goal opportun remov process simul figur data simul alarm process appendix illustr behaviour alarm encapsul goal prepar order custom alarm order mitig chapter direct plan attent activ alarm encapsul goal prepar order steeper gradient order exce threshold time agent prepar act goal alarm mitig steeper gradient exce threshold time goal activ alarm encapsul goal prepar order behav similar exce threshold time faster rate activ alarm function cross threshold consid due low frequenc alarm sampl discuss relat work threshold mechan direct attent agent salient goal type control state mechan exploit research contribut filter penetr theori start beaudoin pp filter serv limit attent pass goal suffici insist exce threshold level threshold primarili depend situat beaudoin distinguish acut situat split distract drastic situat discuss term import current urgenc activ total number activ inact concret specif provid alarm process alarm trigger threshold depend import urgenc action agent intend depend goal consum cognit resourc chapter contribut present oper specif filter indic practic implement produc process involv recollect agent suspend goal gener enact interest psychologist interest studi harri elli alarm process machineri present intend model behaviour human prospect interest compar behaviour process behaviour report psycholog literatur harri wilkin report human subject tend recal goal frequenc time act approach alarm process discuss goal activ alarm encapsul goal alarm mitig mitig intens alarm maximum max time agent predict goal activ alarm trigger agent decid act agent tend remind goal frequent max approach diari studi present elli likelihood subject report recollect formul intent subject involv task requir attent alarm process likelihood goal consid activ tend threshold level threshold tend load agent reason resourc cognit load number urgent import action elli subject tend remind intent shorter interv time agent act behaviour exhibit alarm process machineri correl subject import attribut intent size perform interv intent short perform interv consid import pure possibl agent greater risk miss interv pure alarm process machineri alarm encapsul goal higher import greater chanc consid alarm trigger goal process act doubl filter alarm trigger intens exce current threshold heurist goal check determin worth act present made basi heurist strategi goal plan machineri goal filter process modul load agent cognit resourc primari contribut thesi previou chapter provid oper account goal manag process provid concret specif system critic examin improv chapter direct plan attent chapter summari discuss introduct chapter gave high level overview motiv agent chapter alarm process solut problem direct limit plan attent alarm trigger goal chapter summari previou chapter detail discuss alarm process machineri section function specif alarm process machineri fairli term bring import definit chapter explain detail combin reader refer appendix read appendix present implement prototyp motiv agent section function planner motiv agent discuss broad term section examin alarm process machineri critic number open issu planner goal manag interact identifi futur research summari alarm heurist alarm structur associ goal heurist measur intens essenti index scheme subsequ remind goal birnbaum elli elli al hammond kolodn alarm process machineri present previou chapter serv manag gener activ goal motiv agent architectur present chapter agent gener goal decid detect event automat goal similar goal delet gener goal encapsul alarm structur intens alarm heurist evalu inform chapter summari discuss alarm structur goal visibl plan reason process consum small amount comput resourc section intens alarm agent remind goal encapsul alarm possibl act satisfi alarm intens alarm exce current threshold goal consid activ goal alarm delet process goal planner agent decid goal longer alarm delet goal activ alarm mitig mitig effect goal alarm trigger time goal consid activ section serv aspect alarm process machineri alarm gener alarm gener basi initi predict goal relev import inform specif alarm influenc intens threshold level remain max agent remind goal time max max dl inform consist time agent act delai dt time agent goal dl estim time satisfi minimum intens alarm delai min maximum intens max import agent satisfact goal goal uniqu achiev unpredict variabl dt dl min max determin predict time goal gener alarm set gener section agent pursu goal cyclic time dai variabl determin alarm specif section notat chapter appendix estim typic plan action satisfi goal goal activ plan gener summari alarm heurist definit alarm function alarm ff dt min max dt max remain max dt max max min dt max dt max min max dl ratio dt max dt express real number danger time commit transient effect uncertain chang danger time affect intens alarm opportun action opportun satisfi suspend goal action perform minimum plan goal worth precondit action hold goal postcondit action opportun detect action encod opportun demon time alarm set definit goal worth achiev intens alarm greater action anticip potenti opportun perform present opportun fa dg present state domain effect detect opportun intens alarm max effect remain durat opportun alarm trigger goal activ goal activ alarm mitig effect opportun remov danger initi predict defin alarm function number appropri agent goal attend meet locat predict meet predict agent agent subsequ plan time danger time satisfact meet agent set chapter summari discuss appropri condit hold domain dai constitut danger time satisfact goal agent plan dai meet constitut danger goal danger goal encapsul alarm shift appropri alarm reach maximum earli agent time achiev definit exist persist constraint agent plan constrain proposit pc hold pc pc conflict jth appropri condit alarm constraint hold interv max dl alarm shift reach maximum pc intend consequ plan pc pc pc pc max dl dl dl dl dl postcondit action agent plan conflict jth appropri condit alarm interv action perform overlap interv max dl alarm shift reach maximum unintend consequ max dl dl dl dl dl proposit hold domain conflict jth appropri condit ff alarm shift reach maximum max unanticip consequ agent due action proposit typic precondit action state explicitli definit complex refer rich knight weld discuss constraint post plan algorithm summari alarm heurist effect detect danger shift alarm function achiev evalu alarm intens danger time satisfact singl alarm function shift maximum requir time commit construct agent commit activ time pursuit goal commit reduc time agent act satisfi goal activ agent commit action time satisfi inact goal max dl agent remind goal earli success satisfact determin time commit agent plan interpret section implement algorithm appendix definit simplest time commit conflict alarm interv tc tc tc overlap interv max dl alarm shift reach maximum time tc tc alarm shift tc tc tc max tc tc dl dl tc tc tc dl tc tc dl dl tc tc alarm shift bring conflict time commit interv procedur repeat alarm shift suffici interv max tc dl tc overlap time commit tc tc algorithm appendix alarm mitig alarm trigger goal goal longer relev present time alarm fact goal consid intens alarm mitig mitig temporari reduc time chapter summari discuss definit mitig function min min ratio express real min max approach max max min max jt max min max max jt max max jt max jt alarm trigger alarm structur alarm set detect set appropri possibl time shift due detect possibl time shift due time mitig default defin definit intens ff max eval eval eval trigger exce threshold control rate alarm trigger requir rate depend load plan control process agent updat threshold level threshold level cycl alarm evalu cycl period cycl section depend function planner current threshold rate alarm requir trigger maximum threshold level threshold definit updat reduc ffi actual trigger rate exce threshold ceil ffi actual trigger rate li ffi ffi chang threshold level ffi ffi ffi ffi ffi definit requir trigger rate govern ratio area function interv agent commit area function interv free commit interv jth action plan perform durat end point definit threshold weight averag import action agent plan import assign jth action plan function planner goal process goal planner plan process provid list goal alarm process plan relev action present time focu plan attent planner goal pursu planner alter focu activ figur goal chapter summari discuss focu plan prioriti goal chang agent present singl goal focu plan goal tidi stock agent act import current threshold level set limit threshold ceil goal present inact relev present situat activ agent agent remind gener goal prepar order custom expect arriv goal planner decid suspend present goal start plan prepar order continu tidi pursu newli activ goal time make agent account rel import effort invest goal focu activ characterist respect deadlin relev inform agent achiev goal prepar order custom arriv success sell tidi stock easili interrupt loss effici prudent agent suspend goal present act prepar order scenario indic problem involv decid goal focu plan attent thesi concentr mechan control goal solv difficult problem decid goal goal focu agent activ figur work area plan paradigm haddawi notion intent tempor structur partial plan rao planner delet goal focu plan attent goal delet satisfi agent detect request order book satisfi order tuesdai custom agent decid custom reliabl order profit gener goal prepar order collect time goal encapsul alarm time alarm trigger agent consid goal activ agent remind goal time goal activ agent decid act goal immedi estim minut achiev goal urgent goal pursu twenti minut agent activ goal commenc plan function planner goal delet goal gener goal encapsul alarm structur goal activ focu plan attent focu activ figur focu achiev order readi time collect custom point agent goal satisfi delet agent goal delet agent satisfi agent activ goal prepar order custom agent attend goal plan achiev discov due previou order unusu larg number widget insuffici stock satisfi order long widget agent unabl negoti custom goal delet cohen levesqu condit agent pursu behaviour agent gener activ goal prepar order request receiv messag custom cancel order goal satisfi agent achiev goal agent prepar longer reason agent achiev goal custom collect cohen levesqu modifi formal model intent ad number form background justifi agent agent believ goal longer agent longer intend achiev goal delet constitut relev cohen levesqu suggest intent repres chapter summari discuss explain exist interdepend hierarch plan structur complet answer problem found gener goal section alarm process machineri basi defin interdepend agent belief intent reason gener goal prepar order custom custom requir agent inform order longer goal delet critic evalu alarm process machineri alarm process machineri mechan schedul goal heurist heurist worth depend advantag question address section advantag gain alarm process machineri manag potenti larg vari number goal disadvantag consequ larg number relev goal intens alarm exce current threshold alarm goal encapsul alarm structur consid alarm exce maximum max threshold greater max trigger threshold drop back maximum intens threshold opportun satisfi goal threshold deadlin goal pass agent goal behaviour goal consid act current situat consid intens alarm evalu possibl goal act consid goal act consid sloman bratman smith import evalu alarm process machineri determin condit behaviour occur threshold reach threshold current threshold level set limit trigger rate alarm rate alarm trigger exce requir rate threshold alarm trigger suffici high rate lower rate alarm trigger present time significantli exce requir due total number alarm influenc high concentr high intens alarm present critic evalu alarm process machineri cognit load agent reflect requir trigger rate differ requir actual trigger rate threshold immedi intens alarm higher level alarm trigger goal consid threshold set level maximum intens alarm trigger actual trigger rate requir trigger rate threshold lower fact maximum intens alarm low threshold mean alarm encapsul goal greater import max goal worth present situat agent time averag intens exist alarm threshold lower maximum intens alarm modifi version problem ti train approach save modif act number goal goal activ goal save inact goal lunch time tempor relev goal hunger intens alarm encapsul goal max train perceiv event predict urgenc save high commit action immedi pursuit urgent goal cognit load requir trigger consequ threshold high threshold reduc sensit altern action goal hunger fact goal relev action intens alarm high goal hunger typic attent busi ensur safeti situat present busi act goal unawar notic immin alarm gener reach maximum intens goal immedi relev fact busi goal present focu remind highli relev goal save differ import goal low import associ goal hunger reflect low threshold ceil fact load cognit chapter summari discuss time intens alarm threshold alarm alarm figur behaviour alarm encapsul goal tidi room resourc due activ goal hunger actual threshold level constrain import goal consid alarm encapsul goal save redirect attent pursuit import activ alarm process machineri prevent alarm trigger goal consid high proport agent cognit resourc present invest activ import urgent goal encapsul significantli high number alarm greater greater number goal higher combin tempor relev import number relev import inact goal import inact goal agent attend consid simul figur data simul alarm process appendix illustr suppress alarm maximum intens due high threshold figur show behaviour alarm encapsul goal tidi room domain threshold period time threshold maximum intens alarm shown alarm encapsul goal tidi room reach maximum due high threshold trigger critic evalu alarm process machineri drop back low intens alarm prevent trigger agent direct higher prioriti goal period time order dai alarm higher intens process threshold agent lower prioriti goal inher properti heurist alarm suppress due high threshold import agent briefli agent pursu action intend perform conflict achiev inact goal effect danger shift alarm function maximum present time threshold high alarm interact prevent alarm trigger agent prior action prevent achiev goal prevent agent simpli danger decid activ goal consequ small number relev goal number inact goal averag number alarm intens level tend trigger rate threshold lower agent tend period time high concentr goal time goal relev action domain order prepar period time agent behav period time relev goal small number relev goal tend threshold reduc agent tend goal earlier fail meet import goal agent period relev goal pursu order worth prepar present time fulli stock wide rang good activ influenc agent action check order tidi check state devic room figur agent expect order time room recent tidi temperatur control devic room show sign fault agent tend reduc threshold level alarm immedi trigger agent activ pursu goal behaviour similar advantag agent access goal relev chapter summari discuss time intens threshold alarm alarm alarm alarm order figur behaviour alarm midnight action time agent benefit activ goal point act agent benefit activ order schedul prepar dai check requir commod act prepar order behaviour exhibit alarm process discuss elli human subject report consid task relev action point low perform routin activ dai simul figur data simul alarm process appendix illustr behaviour simul alarm process machineri period low activ figur show behaviour alarm influenc agent time alarm illustr figur intens quickli tend alarm prepar order alarm encapsul goal high frequenc replenish goal check critic evalu alarm process machineri time intens threshold alarm alarm alarm alarm alarm figur behaviour alarm midnight order book consid goal type replenish trigger replenish alarm function repres goal check temperatur room ident check temperatur room shown alarm illustr figur shallow alarm function includ alarm encapsul goal tidi room commod threshold period vari slightli notic due low frequenc alarm function alarm shown figur threshold trigger sampl frequenc correct import point alarm tend trigger long max intens exce threshold easili import goal earlier respect max alarm trigger agent mitig trigger alarm alarm act potenti ineffici alarm process machineri situat produc ineffici behaviour schedul multipl goal manifest discuss time commit chapter discuss section robbi robot intend job chapter summari discuss centr collect benefit activ dai goal job centr inact robbi plan pursuit goal collect benefit robbi prior commit collect benefit reduc time job centr robbi remind goal job centr dss time satisfi goal deadlin robbi robot alarm process machineri present scenario remind goal job centr time goal achiev remind job centr invest effort plan possibl act satisfi goal collect benefit suspend activ job return dss offic collect benefit awar goal effort wast act collect benefit remind goal visit job centr fact alarm process machineri hide goal planner lead ineffici solut ineffici tend bound due design alarm process machineri mechan predict tempor resourc requir ensur agent remind goal term resourc requir achiev good margin influenc detect danger time satisfact inact goal combin influenc time commit good margin overhead goal gener chapter motiv agent architectur compar motiv process architectur argu agent gener type goal requir agent prior filter process requir beaudoin sloman architectur motiv process architectur mechan filter situat warrant gener gener goal gener goal mechan present direct limit plan attent goal gener goal delai estim travel time import filter mechan complementari type limit basi cognit resourc alarm process machineri extend manag gener filter goal consid gener goal critic evalu alarm process machineri hy goal deactiv goal delet goal gener goal encapsul alarm structur goal activ focu plan attent focu activ figur focu goal planner issu mention investig detail thesi goal present focu plan goal deactiv alarm trigger earli due agent detect situat present satisfi goal robot pass automat recharg point home car plant section satisfi goal recharg relev remind goal recharg light opportun fact present opportun achiev goal automat recharg machin notic order point continu pursu presenc opportun goal relev place agent abil deactiv goal return previou continu journei home goal recharg deactiv simpli treat newli gener goal case agent inform time integr plan achiev goal current agent suspend goal time effort invest plan achiev goal agent greater amount chapter summari discuss inform goal achiev present situat detect recharg point adjac situat simpli plan abandon plan detect opportun previou agent suspend goal light fail agent suspend goal gener plan simpli point pursu present time agent goal holidai goal refin number specif relat gener servic top level goal agent plan bag arrang cat number relat goal pursu goal ticket activ relev present time advantag agent suspend subgoal abstract plan action goal number constraint achiev goal relat goal encapsul alarm structur kind relationship intens alarm alarm trigger encapsul intens alarm encapsul relat goal intens possibl trigger investig depend type plan machineri avenu futur investig alarm function characterist studi investig alarm possibl base affect behaviour agent possibl discuss section alarm function shape modifi behaviour agent uncertain alarm function maxim max dt drop back exce max dt max extrem alarm function remain max max dt remain level analysi extrem sensit mechan alarm function alarm process machineri assum import goal repres singl real number clear work sloman beaudoin import goal necessarili map set real number exist partial order import goal depend qualit quantit factor issu requir detail investig impact core idea present thesi restrict foundat remain intact explan import goal comput initi import type goal assum constant tidi goal import order stock goal import feasibl agent dedic processor period comput rel import goal prioriti agent typic slow chapter evalu alarm process machineri present thesi mainten limit focu plan attent heurist mean evalu benefit agent control system ineffici behaviour chapter provid convinc argument alarm process machineri lack good initi solut import problem chapter summari discuss chapter primari object thesi provid oper specif mechan capabl limit direct plan attent agent goal autonomi work real agent agent goal autonom successfulli interact domain predict argu section agent plan capabl direct limit plan attent contribut detail specif initi implement repres progress understand design complet agent solv problem domain object met sourc goal analysi lead goal term gener process content cf schank abelson ortoni al primari sourc goal identifi achiev state automat replenish prior due charact agent found distinguish automat replenish goal agent pursu goal period depend long goal basi timet identif replenish distinct type goal gener motiv primarili fact automat goal gener avoid reason involv gener goal agent perform type gener goal cyclic simpli respond detect event refin classif motiv area futur investig import tempor relev goal mechan bring agent attent goal time clear tempor characterist goal outlin number encod scheme discuss simpl alarm function select initi analysi intens chapter alarm order agent goal specif alarm structur intens alarm depend tempor relev goal encapsul alarm import tempor relev goal primari issu agent initi predict goal relev captur alarm function structur alarm function vari depend inform agent goal simpl uniform function aid analysi alarm process mechan develop observ agent requir act domain complet correctli initi predict goal relev inform chapter type unexpect domain distinct influenc identifi thesi contribut provid detail account recollect goal light opportun motiv observ agent present situat goal achiev minimum opportun goal worth achiev attent limit function alarm process machineri prevent agent remind goal light opportun goal detriment activ opportun combin alarm function effect danger time commit determin intens agent alarm exist danger time satisfact inact agent tend recal goal earlier agent commit action futur conflict time requir inact agent tend recal goal earlier current threshold level depend action agent plan perform influenc likelihood alarm serv heurist schedul inact goal thesi consid choic agent make alarm trigger alarm delet consid abil alarm trigger number time activ delet import heurist natur threshold mechan effect chapter eleg solut problem consist effect intens alarm thesi discuss load agent cognit resourc due plan achiev activ goal thesi author specif mechan design direct limit plan attent present suffici detail implement feasibl initi implement present result simul discuss relev point thesi chapter appendix notat notat ffl classic ffl set fx set satisfi predic addit notat point time period time boolean function evalu true point time period period time equal sum period point time period period time real number repres ratio period time proposit proposit hold time appendix notat action set proposit precondit set proposit postcondit point agent intend complet note action instanti plan estim time requir perform instanti import agent ascrib perform action instanti plan set action set persist constraint persist constraint proposit hold set time commit agent made plan time commit tupl durat time commit end goal intens intens model real normal arithmet oper differ intens level max alarm import threshold threshold small chang threshold threshold ceil ff alarm action anticip potenti opportun satisfi goal encod opportun demon action opportun satisfi goal ff present state condit ff intens ff time alarm function mitig function function requir trigger rate alarm actual trigger rate ffi small chang trigger rate appendix notat appendix prototyp motiv agent syntax main featur tm lazi function aid reader interest code unfamiliar languag bird good introduct function program written consist list definit set function function input paramet deliv singl output result independ context function return input valu properti call referenti transpar import make program written languag easi reason consequ definit function contrast understand behaviour function refer bodi effect scope depend explicitli pass input paramet common function mean function pass input paramet function return result function power high abstract entir function behaviour abstract tailor specif task function offer input paramet higherord function map appli function element list power function abstract abstract major contributor estim offer order magnitud reduct size sourc code tradit languag task lazi languag mean valu construct valu exist refer appendix prototyp motiv agent valu consequ refer arbitrarili larg list natur comput complet structur lazi offer power problem search problem gener search space explor element languag search construct space order gain effici behaviour avoid construct part space eventu function definit consist option infer function definit specifi type input paramet output definit function behaviour consist function local input defin result input paramet function arithmet constant defin environ function return result depend condit met input paramet condit function express condit return guard true guard evalu true guard subsequ guard true default guard case true condit express specif pattern lefthand input paramet match input order function length length xs length defin function length evalu length input list specifi input match order mean input list element element call rest list call xs specifi length input list found length remaind list element remov equat specifi length empti list ensur list fact enter order basic type number charact boolean valu offer basic primit addit list element code singl type list function support tupl vector element number element size vector vector compon tupl singl number singl algebra data type type construct compon built algebra type page finit type sum type construct easili abstract data type offer essenti provid mechan separ implement concret type abstract type programm code section tm code make alarm process machineri prototyp motiv agent present code written mean comment line begin symbol infer type function data structur written code aid reader good program practic inform basic function member concat standard function map appli function member list filter filter list element satisfi predic append list infix oper add element front infix oper hd return element tl return list element member return true element list concat append list list produc big list languag method manipul list list function list definit function similar combin standard function map function altern definit function list xs test predic function evalu symbol function call result function element result list exampl illustr behaviour prompt function call find list squar domain element greater xs appendix prototyp motiv agent xs map implement design number abstract alarm alarm specif domain assum full implement includ domain physic specif agent section descript domain definit number function provid unnecessari detail function omit worth mention function overload standard function show function overload defin object type transform list charact function exist type transform clear context function show object type abstract object type time function includ signatur abstract object call overload function show abstract object type time transform list charact displai function worth note show function overload instanc abstract object defin displai mean simul appendix output provid step output overload show function call alarm mitig consid time step inform displai actual output interpret output structur appendix section present action plan abstract type specif relev type function definit structur trigger demon section alarm mitig function section section prototyp goal replenish process present tempor type time implement abstract type time point interv repres tupl tupl tupl repres estim time point code repres accuraci section field singl tupl repres number ten minut order definit refer number time denot time refer time time time time time minu time time time divid time time num time time bool shorter time time bool time time time time time time time point interv perform function minu addit point addit time point interv subtract time point time interv meaningless assum oper circumst subtract time time interv subtract smaller interv check legal function minu error guard indic neg result assum definit maintain accuraci result addit subtract accuraci result sum accuraci argument section add minu error neg add support function subtract requir necessit involv addit subtract ten minut singl ten minut ten minut period twenti hour dai week function carri remaind return tupl field result addit field pass minu base carri remaind perform similar appendix prototyp motiv agent add add cd ch ct num num num num base carri sum sum sum carri subtract subtract bd bh bt num num num num base borrow differ differ differ borrow function evalu true argument argument type argument number week number week number week equal number dai number dai bool ew ew function divid support function gener estim time interv interv divid code num function compar time point detect time point defin interv function determin interv time shorter function lead function shorter ad signatur abstract type time occur time definit shorter function evalu minimum interv earliest time maximum interv latest time list interv time point function evalu point time conform characterist point time current time wednesdai saturdai time wednesdai return function determin deadlin replenish timet section element list time pass function determin absolut time characterist current time list deadlin tempor characterist replenish process wednesdai process invok mondai function find time wednesdai saturdai function find earliest wednesdai appendix prototyp motiv agent ts time time time np np np np np np hour np np np dai np np np week error infer goal type goal implement abstract type signatur abstract type specifi number function extract modifi field goal structur implement function goal goal goal import goal goal durat goal deadlin goal goal durat goal goal deadlin goal goal goal essenti differ deadlin instanc type inform data structur sake clariti number type synonym defin code import num time durat time deadlin time action type action implement abstract type signatur abstract type specifi number function extract inform singl put act end modifi end point action assum instanti inform perform act end long act dur implement function action action action time action durat precondit action postcondit action time action action action plan implement prototyp alarm process agent assum emploi style plan algorithm agent plan repres tupl consist list action instanti list order constraint list causal link persist order constraint action perform action perform point time common repres causal link tripl explicitli tie action planner implement simplifi function determin time shift due danger intend consequ plan action plan implement abstract type signatur abstract type specifi function manipul structur type plan function plan order constraint causal link trivial function propag constraint time commit section relev type definit appendix prototyp motiv agent hj hj hj figur partial order plan extern time plan plan plan plan plan plan danger plan plan plan order action action action time link constraint propag assum goal motiv agent pursu delib action finit tempor relev goal deadlin import consequ assumpt plan motiv agent gener extern time constraint action achiev goal plan construct action perform action plan perform point time subsequ action final action perform goal achiev deadlin partial plan illustr figur reproduc figur extern time constraint action virtu constraint plan durat action time constraint found action plan function propag constraint serv updat constraint action plan code os os function propag updat end point singl target plan action extern time constraint order constraint action os end point action minimum end point infer extern time constraint action constraint action plan action action constrain perform figur plan constraint action perform perform perform perform perform function collect path evalu list path plan action extern time constraint target action case action function collect path evalu list minimum infer end point action determin function infer end function propag action action propag ec os os action time path minu function collect path call function propag gener list path singl path list plan action extern time constraint action list action target function list construct function collect path oper function collect path concaten list path target list function appendix prototyp motiv agent function collect action extern time constraint function design return list path singl current target singl path list action consist head rest list consist action target action constrain includ target action rest list gener call function collect path action constrain perform current action previou action found function action constrain perform function collect path follow path previou action action os concat os action action os map os os prev prev prev prev os prev prev os distinguish danger intend unintend action function danger serv distinguish danger due intend unintend consequ futur action effect action planner assum post causal link persist effect causal link constrain proposit consequ action point time causal consequ action unintend causal consequ intend function danger evalu tupl list tupl unintend intend danger consequ action agent plan danger app app ls ls ls cl code rest ls cl function return list appropri tripl correspond action plan intend unintend conflict appropri condit due postcondit action conflict appropri condit postcondit action conflict proposit field appropri condit tupl function conflict depend type function interest app concat action app app conflict proposit proposit bool time commit plan repres commit agent made action pursuit goal plan view number interv time agent commit action inform implicitli repres durat order constraint action extern time constraint plan function time commit transform structur type plan list commit interv repres interv time agent commit action construct plan singl commit field repres field repres end commit repres commit hour activ wednesdai week action commit interv found action isol function propag constraint point assum action plan inform minimum end point commit action plan repres extract function sort order latest commit sort commit function implement quick sort commit interv simplifi function simplifi appendix prototyp motiv agent commit commit small larg xs commit xs simplif commit interv simpl interv sort interv latest end point singl commit function termin commit interv possibl list action end combin list gener commit interv head oper interv combin sum durat simplifi simplifi simplifi simplifi simplifi demon demon varieti agent architectur thesi detect situat warrant gener goal invok replenish process detect delet replenish goal detect situat replenish process code delet detect potenti opportun satisfi inact goal detect danger time satisfact inact goal due unexpect environ demon implement function gener event report relev process evalu simpl boolean definit demon evalu condit demon hold uniqu identifi goal candid gener case exist goal case belief valid proposit world model start cycl agent belief demon fire relev event report predefin function filter function check demon simpli remov return event action action demon event ds bs filter bs event agent decid gener goal event replenish process fire gener goal automat specif section event replenish process identifi delet demon demon gener relev event event action opportun ad alarm structur encapsul goal identifi event reciproc demon fire opportun achiev goal uniqu identifi longer exist event action opportun delet relev alarm structur alarm subsequ trigger opportun page event appropri condit section ad delet influenc alarm identifi appendix prototyp motiv agent alarm mitig function alarm agent determin valu variabl delai estim time requir achiev alarm minimum intens import goal alarm function defin definit intens num durat deadlin import time intens dt dur dl dt tmax tmax tmax minu dl dur alarm agent determin time mitig present intens alarm time alarm account time shift due danger time shift mitig function defin definit time time time time intens ton shift ton ton shift ton ton shift shift replenish replenish automat process trigger event type occur replenish process gener goal deadlin delai time set fix period time time replenish process timet period time time timet time period replenish process invok mondai templat specifi period time time deadlin delai time replenish goal set specifi tempor characterist period replenish process replenish process invok mondai deadlin replenish goal code set dai give hour dai delai time set mondai give hour hour period timet replenish process invok mondai templat specifi time deadlin period time deadlin delai time set specifi time week deadlin replenish goal delai time found goal replenish deadlin set dai week saturdai depend circumst invok invok deadlin replenish goal set wednesdai week give ten delai time set mondai give hour timet differ goal replenish replenish process time deadlin delai time partial instanti goal deadlin set list condit replenish goal templat list anticip list appropri condit function find dt dl gener deadlin delai time replenish goal replenish process invok time time dl dl xs implement function limit prototyp agent capabl gener delet replenish modifi period replenish characterist experi gener replenish process appendix prototyp motiv agent implement part goal trigger event delet replenish process trigger event alarm process alarm tupl consist list appropri alarm list detect opportun satisfi encapsul time shift due detect danger time satisfact time shift due effect time commit agent mitig function alarm structur implement abstract signatur alarm alarm goal alarm alarm time alarm alarm time intens time alarm alarm alarm opportun alarm alarm opportun alarm alarm plan alarm alarm alarm alarm shift time gener alarm requir fulli instanti set appropri condit tempor relev goal alarm set delai deadlin import goal empti list opportun satisfi goal opportun demon set time alarm time shift due danger danger demon set time mitig function time time time intens goal replenish basi partial instanti replenish type inform deadlin delai time replenish goal appropri condit goal replenish app goal instanti alarm function defin delai time code deadlin determin function find dt dl opportun demon set dt dur dl dt dl rt dur imp intens alarm depend satisfi level alarm mitig present time rel time shift due time tc current intens sum alarm mitig function agent detect opportun satisfi intens alarm set maximum alarm sum current valu function alarm time intens minu dan mitig alarm function gener mitig function minu present alarm intens present time time determin function end mitig opportun satisfi goal assum consid reject period mitig end time min mitig max max mitig max definit variabl min mitig max mitig alter requir repres minimum mitig durat ten minut maximum durat max hour tmax minu time appendix prototyp motiv agent time time time time tmax tmax differ tmax differ differ posit tmax posit time time time posit tmax minu tmax tmax minu function reproduc comput time shift alarm due detect danger time satisfact inact goal follow definit appropri condit distinguish danger due intend unintend effect plan action function section depend danger action schedul extent causal link case intend goal encapsul alarm extent time shift due danger comput idea function determin period time dl alarm reach maximum period danger action danger effect inact goal due agent maximum time shift comput tmax tmax tmax minu dl dl danger app time deadlin time tmax dl tmax dl dl time deadlin time code tmax dl tmax dl dl deadlin time durat time dl dl dl minu dl function commit shift determin time shift alarm due effect agent prior commit made plan goal schedul max action present plan shift alarm function time commit return function time commit order latest commit case gap agent commit found goal achiev goal encapsul alarm repres time commit max dl interv shift back time function find gap period time agent time commit accommod period function infix oper function find gap symbol prefix function cs dl dl cs dur dl start hd cs commit time shift cs minu shift minu start end start minu appendix prototyp motiv agent prototyp motiv agent prototyp motiv agent oper call function run agent function requir list list replenish process initi alarm state tupl field type time repres plan updat agent belief time state threshold intens belief proposit function run agent evalu list list charact output present appendix function oper ffl function gener alarm gener goal encapsul alarm structur list belief alter present state belief check goal gener replenish alarm replenish function replenish alarm newli gener replenish exist alarm process alarm check time commit danger account due agent alarm structur updat time shift requir alarm check opportun satisfi goal encapsul danger due extern environ alarm structur updat opportun danger detect alarm evalu present time test intens alarm exce present threshold level function trigger split list alarm list trigger list consid time ffl alarm trigger consid determin activ mitig return function function alarm structur updat function mitig alarm alarm mitig ffl present state alarm process displai list trigger code consid time shown ffl call rest state process state function termin rg rg trig mit nc rest rg mit map trigg rg threshold plan time rg rg trigger threshold time plan appendix prototyp motiv agent appendix simul alarm process machineri appendix present discuss simul alarm process machineri agent oper domain simul code appendix output present appendix output produc code effector sensor function includ complet agent hand simul point interv time model number ten dai week accuraci measur term agent number replenish process characterist goal replenish captur uninstanti goal type time delai time type captur type replenish process list condit delet goal period time timet agent number structur type function templat return uninstanti goal templat requir function gener object abstract type time replenish goal templat repres regular order agent custom agent prepar order consist unit commod unit unit mondai thursdai state agent goal replenish specif thursdai week deadlin replenish goal set mondai thursdai delai time set hour deadlin field illustr case deadlin delai time appendix simul alarm process machineri set condit delet test function simpli test custom cancel order consid timet order templat exampl function evalu boolean symbol period period timet timet period simul hour period scenario mondai week tuesdai week interv alarm function inact goal evalu vari hour minut interv chosen specif type behaviour alarm process machineri state alarm function gener result data present format produc simul initi state initi state program output displai initi state agent activ inact goal agent singl activ goal tidi room figur page inact goal encapsul alarm structur entri show identifi goal uniqu import goal delai travel time deadlin object type time gener replenish gener goal prepar order activ goal tidi sat mon inact goal prepar order mon mon prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon curiou mon mon curiou mon mon curiou mon mon curiou mon mon curiou sun sun sat mon sat mon mon tue sun tue tue sat mon wed tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed mon mon prepar order tue tue prepar order sun mon prepar order tue tue section show state agent alarm time point time alarm trigger alarm trigger goal activ alarm mitig alarm goal consid state alarm process machineri time point repres set alarm consid simul alarm process machineri gener output time point form alarm repres intens time number identifi appendix simul alarm process machineri time intens oe oe dt max dl dt max dl time commit due goal figur effect prior time commit alarm encapsul goal mitig temperatur room delai travel time shift due danger time commit opportun detect time mon simul start mondai week threshold set goal tidi room activ pursu agent alarm trigger point agent consid activ pass goal mitig temperatur room state order frozen ic cream chip prepar order number agent plan state intend tidi room ten minut past achiev goal predict hour figur time commit conflict goal check temperatur room agent achiev goal dl tidi room time shift minut requir ensur agent remind goal check temperatur room goal achiev max figur section simul agent account possibl interrupt activ goal calcul time shift alarm due prior time commit agent goal activ goal tidi room interrupt check temperatur room flag goal inform gener estim time shift due prior time cost alarm trigger mitig activ agent focu time mon plan attent direct check order book frozen ic cream chip agent decid delai activ goal alarm trigger curiou mon mon curiou mon mon curiou mon mon sat mon sat mon sat mon prepar order sun mon alarm mitig curiou mon mon curiou mon mon prepar order sun mon alarm consid prepar order mon mon prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon curiou mon mon curiou mon mon mon tue sun tue tue wed tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed mon mon prepar order tue tue prepar order tue tue time mon minut past threshold due number activ goal rate alarm trigger alarm trigger goal check temperatur room trigger period mitig short deadlin goal reach deadlin compar intens alarm encapsul goal check temperatur room alarm mitig due deadlin period mitig section agent consid activ goal intens alarm encapsul goal appendix simul alarm process machineri fact agent activ goal frozen ic cream chip constitut opportun satisfi agent place bulk order commod requir includ agent remind goal cat goal delai time midnight agent relev present time agent consid goal alarm trigger decid activ goal activ goal due space limit alarm trigger mon tue sun tue curiou mon mon alarm mitig mon tue curiou mon mon alarm consid prepar order mon mon prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon curiou mon mon curiou mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed mon mon prepar order tue tue prepar order tue tue curiou mon mon prepar order sun mon time mon agent remind goal check temperatur room due time pursu goal present agent decid activ time note time section time mon period mitig greater due respect deadlin section alarm trigger curiou mon mon curiou mon mon alarm mitig curiou mon mon curiou mon mon alarm consid prepar order mon mon prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon curiou mon mon curiou mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed mon mon prepar order tue tue prepar order tue tue prepar order sun mon mon tue wed time mon agent remind mitig goal check temperatur room point agent achiev goal check order book agent complet satisfi goal tidi room decid redirect attent check temperatur room prepar order alarm trigger time agent mitig trigger alarm fact agent satisfi goal frozen ic chip check order book goal tempor context definit replenish addit agent mitig state order book notic order arriv agent decid gener alarm encapsul goal prepar order appendix simul alarm process machineri request agent influenc alarm encapsul inact goal activ goal alarm trigger prepar order sun mon curiou mon mon curiou mon mon alarm mitig alarm consid tue tue tue wed fri curiou mon mon prepar order mon mon prepar order wed wed prepar order mon mon prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon curiou mon mon curiou mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed mon mon prepar order tue tue prepar order tue tue mon tue wed time mon agent plan order prepar custom expect check temperatur room prepar order agent inact goal prepar order custom expect arriv noon agent predict coupl hour ten prepar order alarm process machineri design predict futur event made goal gener process conserv manner alarm process hour period consid suffici agent time prepar order prepar order ten twenti minut hour conserv behaviour modifi modifi time mon infer made tempor section alarm shift hour mean deadlin effect alarm maximum intens trigger alarm shift agent decid activ goal recharg time agent finish tidi room goal goal replenish alarm trigger curiou mon mon prepar order mon mon mon mon alarm mitig curiou mon mon alarm consid tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon curiou mon mon curiou mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed time mon satisfi goal recharg activ agent visit recharg situat offic order book agent present locat constitut opportun satisfi goal check order book agent make special journei agent decid activ goal light opportun goal check temperatur room activ appendix simul alarm process machineri alarm trigger curiou mon mon curiou mon mon curiou mon mon sampl alarm mitig curiou mon mon curiou mon mon alarm consid curiou mon mon curiou mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed time mon time agent check order book lead agent make gener goal prepar order goal check order book delet subsequ replenish agent remind check order book noon agent plan act goal prepar order collect custom noon agent commit influenc intens newli replenish goal fact delai time goal agent remind due time shift hour time goal behaviour illustr potenti effect prior time commit agent alarm prior time commit effect alarm encapsul goal check temperatur room alarm shift hour suffici alarm trigger time time mon agent achiev goal prepar order goal regular replenish process automat gener goal encapsul alarm alarm trigger curiou mon mon alarm mitig curiou mon mon alarm consid prepar order wed prepar order mon mon curiou mon mon curiou mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed curiou mon mon curiou mon mon time mon time threshold due rate alarm trigger agent plan action plan express agent intent prepar order agent remind goal check order book temperatur room activ alarm trigger curiou mon mon curiou mon mon alarm mitig alarm consid mon mon appendix simul alarm process machineri prepar order wed prepar order mon mon curiou mon mon curiou mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed curiou mon mon time mon agent prepar order goal delet agent remind time check temperatur room goal activ join goal check temperatur room order book alarm trigger curiou mon mon alarm mitig alarm consid mon mon prepar order wed prepar order mon mon curiou mon mon curiou mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order mon mon prepar order mon mon prepar order tue tue prepar order fri fri time mon prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed time mon threshold drop due agent achiev recent activ goal alarm encapsul goal check temperatur room prepar order agent activ short term mitig goal gener servic motiv satisfi custom order goal check temperatur room check order book goal replenish agent gener goal satisfi order request custom agent influenc activ thirti inact goal alarm trigger curiou mon mon curiou mon mon prepar order mon mon alarm mitig prepar order mon mon alarm consid curiou mon mon curiou mon mon curiou mon mon prepar order prepar order mon mon prepar order tue tue mon mon prepar order wed prepar order mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order mon mon prepar order tue tue prepar order fri fri appendix simul alarm process machineri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun tue tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed time mon agent consid recharg prepar order made mitig alarm encapsul goal prepar order time nearer deadlin goal check temperatur room replenish achiev goal check temperatur room agent detect fault system room put commod store room risk goal gener save stock store room move room similar storag goal gener encapsul alarm usual goal tempor context high import alarm encapsul goal tidi room reach maximum time maximum low rel alarm influenc agent behaviour time alarm reach maximum threshold suffici high prevent trigger goal tidi room consid threshold drop threshold drop section alarm trigger mon mon prepar order mon mon alarm mitig prepar order mon mon alarm consid curiou mon mon curiou mon mon mon mon curiou mon mon curiou mon mon curiou mon mon prepar order prepar order mon mon time mon prepar order tue tue prepar order wed prepar order mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun mon tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed prepar order mon mon time mon short time goal save stock room consid activ time agent offic recharg batteri constitut opportun check order book agent alarm trigger mon mon curiou mon mon sampl alarm mitig alarm consid curiou mon mon curiou mon mon curiou mon mon curiou mon mon prepar order prepar order mon mon prepar order tue tue prepar order wed prepar order mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue appendix simul alarm process machineri tidi mon wed tidi mon wed tidi sun tue tidi sun mon tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed prepar order mon mon prepar order mon mon time mon primari influenc agent action satisfact goal save stock room goal agent plan act activ goal agent remind goal prepar order goal activ alarm trigger prepar order mon mon alarm mitig alarm consid curiou mon mon curiou mon mon curiou mon mon curiou mon mon prepar order prepar order mon mon prepar order tue tue prepar order wed prepar order mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun mon tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed prepar order mon mon time mon time mon agent alarm suffici high intens trigger time threshold alarm greatest intens alarm encapsul goal prepar order alarm trigger alarm mitig alarm consid curiou mon mon mon mon prepar order wed wed curiou mon mon curiou mon mon curiou mon mon curiou mon mon prepar order prepar order mon mon prepar order tue tue prepar order wed prepar order mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun mon tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed prepar order mon mon time mon agent action primarili direct prepar order agent remind order dai due collect agent estim half hour prepar remind goal plenti time achiev alarm trigger prepar order mon mon appendix simul alarm process machineri alarm mitig alarm consid curiou mon mon mon mon prepar order wed wed curiou mon mon curiou mon mon curiou mon mon curiou mon mon prepar order prepar order mon mon prepar order tue tue prepar order wed prepar order mon mon tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun mon tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed time mon goal check temperatur room activ goal mitig order book prepar order note deadlin goal prepar order alarm sampl intens suffici alarm trigger time threshold agent remind goal time achiev deadlin alarm trigger curiou mon mon curiou mon mon curiou mon mon prepar order mon mon alarm mitig alarm consid mon mon time mon prepar order wed wed curiou mon mon curiou mon mon prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order mon mon prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun mon tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed time mon agent remind final order dai alarm trigger order goal activ redirect agent attent agent activ goal check temperatur room mitig alarm encapsul goal recharg goal check order temperatur room replenish time order order book alarm trigger mon mon curiou mon mon curiou mon mon prepar order mon mon alarm mitig mon mon alarm consid curiou mon mon curiou mon mon curiou mon mon prepar order wed wed prepar order prepar order mon mon prepar order tue tue appendix simul alarm process machineri prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi sun mon tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue mon tue wed time mon time onward agent order monitor import variabl domain temperatur room tidi agent redirect attent recharg tidi room note intens alarm encapsul goal tidi room maxim time equal threshold behaviour alarm encapsul goal present time illustr figur alarm trigger tidi sun mon mon tue mon mon alarm mitig alarm consid curiou mon mon curiou mon mon curiou mon mon prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue time mon prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue wed time mon agent plan tidi room coupl hour plan time conflict time achiev goal mitig temperatur room alarm shift maxim intens evalu time agent present place order constitut opportun satisfi goal alarm trigger curiou mon mon curiou mon mon curiou mon mon alarm mitig curiou mon mon curiou mon mon alarm consid curiou tue tue curiou tue tue prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi sun tue tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue appendix simul alarm process machineri time mon threshold drop reflect agent lower activ time alarm tend trigger earlier goal check temperatur room activ intens agent activ goal tidi room intens check order book maxim intens intens alarm encapsul goal tidi room gradual prior present threshold high trigger threshold alarm trigger alarm trigger curiou mon tue tidi sun tue curiou mon mon curiou mon mon alarm mitig alarm consid tue tue wed mon wed curiou tue tue curiou tue tue prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue time mon alarm trigger alarm mitig alarm consid curiou tue tue curiou tue tue time tue tue tue wed mon wed curiou tue tue curiou tue tue prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue time tue agent check order found delet goal join alarm encapsul goal check temperatur room replenish alarm trigger alarm mitig alarm consid curiou tue tue curiou tue tue curiou tue tue tue tue wed mon wed curiou tue tue curiou tue tue prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri appendix simul alarm process machineri prepar order mon mon tue tidi mon wed tidi mon wed tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue time tue tuesdai agent consid activ goal check order goal recharg activ agent complet tidi room goal gener period replenish process delet complet characterist illustr page period replenish deadlin set thursdai travel time set hour replenish rule delai time set tuesdai hour alarm trigger curiou tue tue tue tue alarm mitig alarm consid tidi tue curiou tue tue curiou tue tue wed mon wed curiou tue tue curiou tue tue prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue time tue time tue alarm trigger agent consid check temperatur room agent finish tidi room mitig state order goal replenish encapsul alarm order alarm trigger curiou tue tue curiou tue tue curiou tue tue curiou tue tue alarm mitig alarm consid tidi tue curiou tue tue tidi tue wed mon wed prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue time tue alarm trigger alarm mitig alarm consid tue tue tidi tue curiou tue tue tidi tue wed mon wed prepar order wed wed appendix simul alarm process machineri prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue time tue alarm trigger curiou tue tue alarm mitig alarm consid curiou tue tue curiou tue tue curiou tue tue curiou tue tue tue tue tidi tue tidi tue wed mon wed prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue time tue time tue hour agent action direct monitor number import aspect domain temperatur frozen room order book tidi room goal recent achiev goal type replenish gener servic motiv replenish gener servic motiv order record alarm set goal agent remind goal tidi room agent influenc singl activ goal goal tidi room inact goal alarm trigger tidi mon wed alarm mitig alarm consid curiou tue tue prepar order prepar order mon mon prepar order tue tue curiou tue tue curiou tue tue curiou tue tue curiou tue tue tue tue tidi tue tidi tue wed mon wed prepar order wed wed prepar order prepar order mon mon prepar order tue tue prepar order wed tidi mon wed tue tue tue wed fri prepar order wed wed prepar order tue tue prepar order fri fri prepar order mon mon tue tidi mon wed tidi mon wed tidi mon wed prepar order tue tue prepar order tue tue appendix simul alarm process machineri bibliographi implement theori sixth nation confer artifici pp plan robot autonom system plan tempor world intern joint confer artifici pp rule lawrenc erlbaum associ task plan uncertain intern confer vol pp integr emot broad fourteenth annual confer cognit scienc societi goal process autonom phd school comput birmingham studi motiv process prospect artifici ninth biennial confer artifici intellig cognit pp introduct function intern integr process plan phd depart comput yale opportunist plan sixth annual confer cognit scienc pp bibliographi solv plan eleventh intern joint confer artifici pp schedul problem solv artifici intellig artifici aisb quarterli prospect theori lawrenc erlbaum jersei plan stabil mind machin plan practic comput intellig robust layer control system mobil ieee journal robot autom eleph dont plai mae design autonom theori practic biologi engin press comput complex proposit strip artifici intellig goal fourth annual confer cognit scienc pp autonomi cognit agent wooldridg jen intellig workshop agent vol lectur note artifici pp plan conjunct artifici intellig mit press minim mit intent choic artifici intellig bibliographi trial understand design requir agent complex ai magazin plan kei fourteenth intern joint confer artifici pp symbol continu process automat select aisb quarterli present tenth biennial confer artifici intellig cognit scienc plan morgan kaufmann hierarch plan involv travel comput intellig intent mit press framework integr artifici intellig artifici intellig review prospect memori delai conceptu einstein prospect theori lawrenc erlbaum associ recollect studi cognit affect memori approach plan incomplet intern confer principl knowledg pp approach applic theorem prove problem artifici intellig investig reactiv plan complex sixth nation confer artifici pp pragmat bdi muller tamb intellig agent workshop agent vol lectur note artifici pp bibliographi formal basi hierarch sixth australian joint confer artifici intellig hierarch plan iee control theori applic reason eleventh intern joint confer artifici pp reactiv reason sixth nation confer artifici pp bad ai magazin compar inform process letter agent ohar jen foundat distribut artifici pp util function deadlin intern confer principl knowledg pp view plan memori academ press opportunist eleventh intern joint confer artifici pp artifici intellig rememb theoret framework illustr human learn blackboard architectur artifici intellig bibliographi architectur adapt intellig artifici intellig cognit model cognit scienc intellig monitor eleventh intern confer artifici pp control cooper problem solv industri system joint artifici intellig action plan robot autonom system process model reason problem ninth intern joint confer artifici intellig rememb intent distinct form british journal psycholog ai magazin reason action plan artifici knowledg engin review approxim process problem ai magazin review tempor knowledg engin review formal framework agenc intern confer pp dynam action eleventh intern joint confer artifici pp bibliographi situat agent mae theori practic biologi engin press systemat ninth nation confer artifici pp tempor logic reason process cognit scienc negoti ohar jen foundat distribut artifici wilei abstract nondetermin plan reaction twelfth nation confer artifici pp challeng ieee comput imit man scienc human problem program agent journal artifici intellig research attent schwartz shapiro advanc theori plenum press motiv goal action work note aisb workshop model behaviour forward colleg depart comput scienc research note heurist control reason seventeenth annual confer cognit scienc pp goal creation motiv wooldridg jen intellig workshop agent languag vol lectur note artifici pp bibliographi implement motiv muller tamb intellig agent workshop agent vol lectur note artifici pp design implement architectur busi process submit manuscript cognit structur cambridg press predict plan fifteenth annual confer cognit scienc pp partial order planner intern confer principl knowledg pp unifi theori handbook vol elsevi artifici intellig introduc evalu agent eighth nation confer artifici intellig investig agent commit technic report depart comput scienc plan work note aaai spring symposium control select percept refer featur guid reason fourteenth annual confer cognit scienc pp procedur proposit muller tamb intellig agent bibliographi workshop agent vol lectur note artifici pp model ration agent intern confer principl knowledg pp abstract architectur ration intern confer principl knowledg reason bdi theori intern confer pp davi varieti academ press artifici mcgraw hill rule design convent negoti mit press studi limit mit press nonlinear natur fourth intern joint confer artifici pp erlbaum associ plan reactiv robot unpredict tenth intern joint confer artifici pp artifici intellig opportunist design seventeenth annual confer cognit scienc pp model social john wilei motiv emot control psycholog review bibliographi scienc mit press interperson lawrenc erlbaum associ cognit theori commun slack stock commun artifici intellig theoret appli pp explor design eleventh european confer artifici pp robot seventh intern joint confer artifici pp sim toolkit explor agent muller tamb intellig agent workshop agent vol lectur note artifici pp schedul stabil mind machin structur view problem ai magazin gener project intern joint confer artifici pp abstract reason morgan chapter plan window durat activ ieee transact pattern recognit machin intellig symbol acquisit adapt agent work note aisb workshop model behaviour forward colleg depart comput scienc research bibliographi introduct commit ai magazin preferenti semant ninth nation confer artifici pp plan comput approach human theori knowledg engin review intellig workshop agent vol lectur note artifici intellig agent workshop agent vol lectur note artifici analysi emot psychiatri psycholog
DB/493 3 ecient comput weight proxim relationship spatial lin zhou liu zhou school comput scienc south wale nsw australia school comput inform south australia sa australia depart comput scienc electr engin qld australia abstract spatial data mine recent emerg number real urban weather medic imag road trac accid demand ecient solut complic problem investig problem evalu top distinguish base weight proxim relationship cluster featur measur proxim averag fashion address nonuniform data distribut cluster combin standard paradigm lower upper proxim present ecient algorithm solv problem algorithm implement di erent mode experi result give comparison illustr ecienc algorithm spatial queri process data mine introduct spatial data mine discov understand unknown knowledg larg spatial wide rang demograph weather pattern urban transport process typic spatial queri nearest map receiv great deal attent year spatial data view advanc spatial demand ecient solut newli spatial queri inspir success advanc spatial queri process techniqu relat data mine machin learn comput geometri statist analysi research result system prototyp spatial data mine recent report exist research provid system solut cover number special solut mine task result includ ecient comput spatial associ rule spatial data classi cation gener spatial predict trend analysi cluster cluster analysi mine imag raster cluster shown tool partit categor spatial data cluster knowledg discoveri number ecient algorithm exist cluster algorithm ectiv construct ectiv provid reason cluster spatial applic cluster natur cluster area equal spatial properti cluster base surround proxim common measur repres relationship cluster featur problem comput closest featur surround set point space base proxim relationship investig problem comput closest featur number real applic spatial set point repres area point repres parcel polygon correspond vector golf motor buyer develop area closest featur point applic measur proxim relationship averag fashion address nonuniform data distribut applic import area area meter swim pool suggest put weight evalu obtain top featur base import investig problem comput weight closest featur featur weight formal de ne wk problem section assum cluster featur store naiv solv wk rst comput proxim featur solv wk problem practic featur part solut rule fast ltere techniqu ltere techniqu develop unweight problem suitabl speci calli design solv unweight problem motiv algorithm adopt standard techniqu combin power prune condit lter featur algorithm implement di erent mode perform evalu experi demonstr ecienc algorithm rest paper organ section present de nition wk introduct adopt spatial architectur section present algorithm solv wk section report result section discuss present modi cation due space limit provid proof theorem interest reader refer long version paper preliminari section de ne wk problem featur simpl close polygon space set point space call cluster notat simplic assum wk cluster featur note assumpt support real applic cluster repres set land featur repres natur place shop entertain center data found electron map digit librari ecient access larg spatial data paper adopt sand architectur spatial consist set spatial object relat describ properti object formal de ne wk input consist cluster set mg group featur group number featur found featur point length actual shortest path comput presenc ten thousand di erent road shortest euclidean distanc point boundari denot ect geograph proxim relationship length actual shortest path ect call distanc note line point comput lower upper proxim bound section de nition extend cover case insid boundari insid boundari address arbitrari distribut point averag proxim quantit model proxim relationship ap jcj mention wk rank import featur posit import featur smaller weight weight assign group featur user system default set fw mg posit valu part input wk wk model featur featur lead smallest valu wap wf ap wf weight wf note proxim cluster featur measur aggreg jcj clear comput closest featur cluster measur mean top featur problem special case wk weight algorithm solv wk present ecient algorithm solv wk algorithm denot stand comput weight closest featur solv wk comput wap pair cluster featur comput closest featur base wap valu note wap easili comput de nition wap approach run time jf featur involv featur cluster point make approach comput prohibit practic experi result section con rm resolv problem adopt paradigm ltere step lter comput wap valu candid featur simpl ectiv techniqu solv wk weight equal draw circl encompass cluster featur intersect circl candid appli techniqu gener wk di erent draw di erent circl di erent group featur due di erent weight group featur candid left lter power ltere techniqu base lower upper bound wap valu comput actual wap quadrat time comput lower bound upper bound wap linear time respect size cluster rule de nite closest weight comput weight averag proxim valu elimin featur basic idea algorithm algorithm integr algorithm spatial due reason spatial index built wk problem involv featur di erent themat spatial index built themat map di erent bring diculti make spatial indic featur quali ed part store spatial user interest part park make exist index base store spatial object applic paper exist spatial index techniqu necessarili support comput aggreg argument appli averag distanc comput algorithm consist step read cluster bu er step read featur batch batch bu comput lower upper bound wap cluster determin comput wap step appli method remain featur solv problem wk subsect detail algorithm step step success algorithm larg reli good lower upper bound wap good lower upper bound mean bound comput fast rst present lower upper bound note present algorithm present paper restrict case featur cluster quali ed wk store spatial object immedi extend cover case featur cluster part store object lower upper bound averag proxim recal rst notat cluster denot convex polygon encompass featur call bound convex polygon smallest bound convex polygon call convex hull denot pf rectangl orthogon coordin axi minimum bound rectangl refer minimum bound rectangl denot rf minimum bound rectangl rc rf cluster featur idea shortest distanc longest distanc rc rf repres lower bound upper bound ap idea problem rst problem rectangl intersect case necessarili shortest longest distanc rc rf de ned problem bound tight rectangl intersect happen similarli convex hull present tighter bound lower bound comput base lemma lemma theorem convex hull minimum bound rectangl ap word lower bound ap lower bound tighter shortest distanc bound rectangl arbitrari point denot maximum distanc point upper bound ap theorem arbitrari featur ap clear hand side inequ theorem upper bound ap comput time comput bound tighter longest distanc minimum bound rectangl gener prove tight upper bound depend choic centroid cluster upper bound comput obtain lower bound note gener pf lower upper bound replac convex polygon read relev cluster step rst read cluster speci ed bu er comput centroid maxim distanc step linear time respect size read filter featur subsect present step total size featur process larg bu er simultan featur read bu er batch batch note primari goal make candid set close actual mean small set candid expect left main memori ltere step store detail candid main memori process ltere step develop initi candid set assign rst examin rest featur determin candid case candid check featur includ candid set remov lemma immedi veri ed lemma cluster featur weight wf wf pf wap wf lemma mean wf pf lower bound wap denot wf upper bound wap denot lemma set candid kth smallest featur solut wk wap featur lemma greater consid part solut wk situat ad updat featur longer candid remov naiv scan determin featur remov speed divid part set candid remov make order link list store xed length store current largest lower bound element store identi er spatial descript initi set empti element sort lexicograph order speci process rst comput valu wap add rst featur lexicograph order rest candid speci ad proper posit element move ad ad updat time check remov featur lower bound bigger descript step step read rst featur comput lower upper bound featur comput rst featur comput move element updat reduc remov featur batch featur process bu er candid featur comput ltere process step full inform remain featur solv wk appli inform perform comput wap valu method complex step read user speci ed cluster relev step linear time respect size step ltere process read lter main comput lower upper bound wap possibl insert run jf number total featur step time comput wap remain featur note algorithm run time time complex method higher ja smaller con rmed experi result section variat implement algorithm di erent mode order evalu perform di erenc bound shape featur ltere process rst mode denot minim bound rectangl featur comput lower upper bound wap altern mode minimum bound convex hull minim bound denot mode denot adopt ltere minim bound rectangl rstly obtain order link list minimum bound convex hull comput featur store repeat step order link list process step report experi result perform implement experi result method mode algorithm implement pentium mb main run evalu algorithm ecienc scalabl perform evalu basic step method read cluster featur contribut experi record cpu time exclud cost experi adopt common set featur edg cluster point featur group group rst gener cluster implement algorithm cluster experi result depict figur averag time note algorithm respect abbrevi diagram rst conclud method practic slow slower intuit comput lower bound featur observ ecient ltere phase lter number featur left comput reduc intuit signi cantli slower number featur con rmed experi experi undertaken dimens number featur vari run algorithm cluster record averag time result depict figur number featur vari algorithm run cluster averag time record experi result depict figur histogram present averag run time algorithm tabl present fig averag execut time algorithm number featur graphic present algorithm averag run time tabl present fig averag execut time algorithm di erent db size experi suggest faster perform faster experi choic di erent valu di erent db size chang observ experi show scalabl algorithm conduct experi suggest algorithm ecient scalabl applic convex hull valu graphic present algorithm averag run time tabl present fig averag execut time algorithm di erent ltere procedur accur applic minim bound directli convex hull follow applic minim bound appli mode remark investig weight top featur problem proxim relationship present ecient algorithm base prune di erent mode algorithm experi result show algorithm ecient problem algorithm gener constrain applic interest reader refer full paper detail refer agraw fast algorithm mine associ vldb improv adapt similar queri process vldb optim strategi spatial queri vldb sander algorithm discov cluster larg spatial intern confer data mine spatial data lnc autom analysi catalog sky advanc knowledg discoveri data ed advanc knowledg discoveri data menlo introduct spatial vldb dynam gener nement concept hierarchi knowledg discoveri ieee tran knowledg data system prototyp spatial data intern confer kaufman find group introduct cluster john wilei find aggreg proxim relationship common spatial data ieee transact knowledg data koperski discoveri spatial associ rule geograph inform advanc spatial symposium mine knowledg geograph commun acm ecient comput weight proxim relationship spatial knowledg discoveri larg spatial east workshop geograph inform ng ecient ectiv cluster method spatial data ectiv algorithm mine associ acm preparata comput design analysi spatial data shaw statist techniqu geograph david jorg cluster algorithm mine larg spatial ramakrishnan ecient data cluster method larg intern confer manag articl process macro packag llnc style
Agents/494 1 multiag system solv web electron travel problem universidad carlo iii madrid de la po universidad carlo iii madrid de la po universidad carlo iii madrid de la po abstract paper present multiag architectur work di erent element main goal recommend solut electron tourism domain system user system di erent type intellig autonom agent main characterist plan knowledg share inform intellig agent heterogen geograph distribut main inform sourc system internet inform sourc distribut knowledg base system process store inform perform automat agent inform translat homogen format reason order obtain di erent partial solut partial solut reconstruct gener solut present user system recommend di erent solut user analyz learn interact categori subject descriptor inform data organ interfac collabor cial knowledg arti cial intellig multiag system gener term inform comput agent design agent multiag system introduct distribut arti cial intellig consid problem solv simultan subsystem integr coordin di erent agent complex problem multiag system ma agent concept exist complet descript princip characterist summar agent incomplet amount inform accur abil solv problem exist system global control data data share agent system execut agent work receiv queri anytim dai studi design system interact system world multiag system activ eld er modular characterist essenti larg unpredict domain system build set modular compon special solv problem aspect agent softwar agent paradigm solv problem interdepend problem agent system coordin ensur interdepend properli manag paper present distribut multiag system obtain data reason obtain solut nalli suggest user vast amount inform store web user connect inform heterogen distribut impract build singl uni ed system combin inform sourc user build special dicult maintain develop situat origin import user inform obtain satisfactori result problem solv system lter repres cientli inform obtain web system amount inform retriev distribut cooper multiag approach problem solv dynam environ approach integr tradit problem solv plan advantag provid distribut system design work dynam special inform store internet paper analyz main characterist system process system obtain set solut inform acquir system store solut solut obtain advantag gain learn user behaviour pro le solut store solut store user categor prefer sort list gener solut paper divid ve section describ multiag system section analyz system interact section present web design section show paper reason web main advantag ma techniqu exibl highli adapt behaviour system ma made heterogen element plai di erent program execut di erent function modifi behaviour dynam ma includ di erent softwar applic complex agent system includ softwar applic kind system achiev good result provid methodolog integr distribut control algorithm problem solv techniqu system ma success due mention solv big size special classic system success di erent system work interconnect cooper provid ecient solut inform distribut di erent place softwar share di erent agent capabl solv problem ma approach integr di erent type agent summar agent pai attent user queri show solut analyz problem obtain abstract subsequ request solut problem di erent skill commun learn user pro le custom system answer set di erent main goal reason set solut di erent skill commun di erent agent plan main reason learn cbr techniqu index categor store agent ll detail obtain requir inform internet di erent partial solut web agent combin obtain detail solut queri figur graphic shown system made set agent commun cooper reach problem solut agent planner agent planner problem solut agent user web wide world problem solut agent user figur gener architectur architectur design manag problem exist special overload inform intern knowledg agent share reason retriev inform main function connect user graphic user interfac kqml protocol reach function figur modular descript architectur shown heterogen inform web control modul commun modul knowledg base figur architectur main goal accept problem user analyz problem obtain homogen learn user select solut store classifi user custom system request user knowledg learn commun request solut figur show gui implement commun user system user view answer problem user connect system retriev solut store system store pro subset desir solut gui pro le shown figur exist gui commun figur shown gui java sun java develop kit figur user agent input figur success solut system shown show solut sort user behaviour learn store solut modular modul capabl task reason agent system figur show modular descript interest characterist commun implement protocol commun agent planner web heterogen storag data store inform agent characterist statist inform plan server plan subplan plan solut control manag di erent agent modul main handl partial valid inform acquir heterogen inform sourc build agenda handl question agent task handl answer question figur gui pro le learn modifi system behaviour obtain solut success user queri learn modul di erent learn learn gain ecienc plan obtain solut learn control rule retriev adapt store solut agent avoid plan process plan work solv user problem plan modul planner planner main reason modul agent gener abstract problem speci user data planner obtain abstract solut problem obtain multipl abstract problem solut planner order gener solut heurist cost function abstract user problem avoid overload agent manag problem high level abstract gener solut translat accur solut de data user solut order agent cooper solv complet solut planner solut languag transform inform agent work planner solut gener solut divid set subproblem gener solut divid set oper analyz independ problem figur output heterogen inform control modul commun modul knowledg base server plan figur architectur translat queri goal reach system agent inform obtain agent web agent experi agent modular architectur architectur shown figur handl question agent properli translat question queri access web access answer web ltere store data base inform place request inform request relat ight web heterogen inform control modul commun modul knowledg base queri request figur architectur train town request agent translat understand queri web site cooper cooper architectur di erent agent cooper reach solut di erent agent share knowledg skill complet abstract solut obtain obtain complet solut agent system success share knowledg obtain solut retriev store learn user prefer sort solut section format share knowledg analyz share inform agent agent common knowledg characterist simplifi process share reason knowledg commun agent perform perform store implicit order agent commun system agent subset kqml format tabl format shown show accept reject perform request travel airplan perform inform request perform accept make cooper negoti agent commun protocol complet solut obtain user de nition problem abstract solut planner section show protocol work system agent automat access bu hotel inform develop perform format request compani mad java inform price java accept java reject java tabl perform commun protocol agent implement commun figur show protocol initi send descript user problem solv problem reason modul cooper show di erent type perform user solut figur commun protocol commun process agent acknowledg messag gener perform send answer recommend solut tabl solut messag sender task start agent readi perform gener perform send messag agent request gener di erent type act perform sender order execut task agent negoti agent figur cooper agent reject request inform obtain nalli desir inform process complet solut nalli show user applic section detail descript domain system work electron tourism domain electron travel agent abil manag travel plan kind plan agent repres lodg agent user travel train rent book room hotel import point manag travel move origin destin town lodg destin transport target town return initi town handl item consid train bu travel transport user local bu taxi move train station bu station mean agent decid local transport import complex part problem number solut grow exponenti move possibl target town refer possibl rent provid user inform public transport present subsect user interfac system commun user shown user travel barcelona madrid june return solut possibl solut system reject set solut order gain subset solut shown user recommend solut solut match learn prefer user pai attent extract main characterist store solut classi ng solut introduc set exampl main characterist user airplan compani plan work futur solut minim time exampl airplan bu train compani tabl success solut recommend reject solut didnt match learn characterist rst solut recommend user mark compani ight faster travel transport solut recommend train travel barcelona solut optim cost cheap travel bu faster travel airplan present multiag approach problem solv dynam environ motiv work design system reason dynam inform studi data ect plan process studi problem solv cooper techniqu data store web system agent show web system applic data automat obtain system solv user problem refer bond gasser read distribut arti cial intellig san francisco morgan borrajo veloso lazi increment learn control knowledg ecient obtain qualiti plan ai review journal special issu lazi februari bradshaw softwar agent menlo park wittig intellig softwar agent foundat applic etzioni move food chain ai summer finin al draft speci cation kqml agent commun languag jun kqml agent commun languag intern confer inform knowledg manag page associ comput gasser distribut arti cial theori chapter overview page kluwer ketchpel softwar agent commun singh read agent san francisco morgan knoblock ambit softwar chapter agent inform gather bradshaw menlo al model web sourc inform integr arti cial intellig sycara multiag system ai integr plan prodigi architectur journal theoret veloso carbonel deriv analog autom case util machin mar wooldridg jen intellig theori practic knowledg engin octob
AI/495 2 comput semant autoepistem belief theori stefan brass jurgen dix teodor przymusinski school inform pa usa dept comput william colleg md usa dept comput ca usa abstract author introduc simpl power knowledg call autoepistem logic theori call autoepistem belief theori belief theori shown static comput iter natur monoton belief closur oper static belief theori natur semant call static semant easi belief theori finit construct static stop countabl iter power result obtain paper show static finit belief theori fact obtain mean singl iter belief closur oper result elimin multipl iter comput static semant replac definit static semant explicit straightforward definit close relat result establish intrigu relationship static semant clark complet finit belief theori show static semant obtain augment set ensur formula belong clark complet believ true result open effici implement static iter reason logic theori static reduc classic theorem prove involv clark complet logic knowledg semant logic program deduct preprint submit elsevi preprint februari introduct recent formal reason semant normal disjunct logic program includ stationari static semant normal disjunct logic program author introduc simpl power nonmonoton knowledg framework isomorph mention formal semant special case significantli express formal consid individu call autoepistem logic shown constitut power formal serv unifi framework major formal understand mutual relationship exist formal semant enabl provid simpler natur definit natur lead flexibl modular formal semant theori autoepistem logic belief call autoepistem belief theori case moor autoepistem semant belief theori defin mean introduc class call static static fix point natur monoton belief closur oper autoepistem logic stabl belief theori static comput iter belief oper static belief theori natur semant call static set formula static easi belief theori finit construct static stop countabl iter power result obtain paper show static finit belief theori fact obtain mean singl iter belief closur oper result elimin multipl iter comput static semant replac definit static semant explicit straightforward definit needless exist point definit static semant significantli simplifi notion underli theori preliminari result note intern confer principl knowledg reason doyl shapiro pp partial support nation scienc foundat grant foundat interest result applic obtain close relat result establish interest intrigu relationship static semant clark complet finit belief theori show static semant obtain augment set ensur formula belong clark complet believ true reduc reason static semant easili accomplish comput clark complet underli modal logic hand autom theorem prover result open effici implement static iter reason logic theori static reduc classic theorem prove involv clark complet autoepistem belief theori begin recal definit basic properti autoepistem belief origin introduc fix proposit languag standard connect proposit letter true denot set proposit extend languag proposit modal languag augment modal oper call belief oper formula form bf arbitrari formula call belief atom consid atom formula extend proposit modal languag formula origin languag call object proposit theori modal languag call autoepistem belief theori definit belief theori belief theori arbitrari theori proposit languag set bm bg bg bf bf object atom arbitrari formula assum simpl axiom schemata infer rule describ arguabl obviou properti belief consist distribut bf bg invari infer remark set axiom definit slightli origin definit autoepistem belief theori axiom system complet section map falseg denot proposit interpret simpli treat formula bf proposit notion model carri proposit logic formula proposit consequ iff interpret repres model set liter show truth valu object belief atom relev definit formula belief theori denot cn smallest set formula languag instanc axiom close proposit consequ invari rule formula deriv belief theori belong cn denot fact belief theori consist cn cn result establish immedi hold proposit belief theori formula bf bg statement formula believ true negat statement formula believ infer rule formula deriv believ semant autoepistem belief theori defin semant autoepistem belief theori provid mean belief atom bf intend mean belief atom bf base principl predic minim bf hold minim bf hold true minim model order make intend mean defin minim model belief theori definit model model smaller model belief atom fewer object fp pg ae fp ff ff minim model belief theori model properti smaller model formula true minim model write min minim entail simpl belief theori car prove minim entail min order find minim model assign arbitrari truth belief atom minim object atom car run easili minim model valu remain belief atom irrelev car broken deduc min car min moor autoepistem intend mean belief atom autoepistem belief theori enforc defin suitabl theori definit belief theori belief theori call static belief theori satisfi cn min fg rang formula static obtain augment belief atom bf properti minim entail fix point theorem static belief theori static fix point monoton belief closur oper static construct ff defin ordin number ff fi ff successor ordin ff def cn ff min fg rang formula fi limit ordin defin fi ff sequenc ft ff monoton uniqu fix point ordin result establish static complet belief theori theorem static static belief theori coincid smallest theori satisfi cn min bf proof static satisfi condit condit oper monoton theori conclud ff ordin ff conclud observ static formula true static constitut call static complet belief theori slightli complex belief theori ix order iter comput static complet easili check min ix cn min fg ix broken cn min fg proposit conclud min cn min fg infer static complet assert car consid fix broken run condit definit complet static static belief theori call static complet describ static semant belief theori predic complet semant logic program complet determin clark complet static semant belief theori fulli determin static complet easi verifi belief theori consist static complet consist static static complet clark complet easi belief theori finit construct static complet static stop countabl step power result obtain articl show static complet finit belief theori fact obtain mean singl iter belief closur oper result elimin multipl iter comput static complet replac definit static complet explicit definit close relat result establish interest intrigu relationship static complet clark complet finit belief theori show static complet belief theori coincid cn set formula deriv belief theori augment set set repres set belief formula belong clark complet strictli result appli call residu theori show finit belief theori transform finit residu belief theori set minim model clark complet easili result reduc reason static semant underli modal logic hand autom theorem proof power result base idea ad belief theori set formula ensur model belief oper fact minim task accomplish suitabl gener clark complet work restrict class belief object residu theori introduc investig class logic program give slightli gener definit definit belief theori residu belief theori arbitrari belief theori object set arbitrari bg bg bf bf object atom arbitrari formula bg bg bf bf object atom consid singl object atom bg bg bf bf describ natur extens notion clark complet clark complet initi introduc class normal logic program gener disjunct program posit studi extend class residu belief theori goal ensur object atom true rule bodi true head liter definit clark finit residu belief theori object atom falsiti atom defin extend clark complet atom bg bg bg aa bf bf atom head clark complet belief theori union complet object atom languag falsiti atom interest result show residu belief model clark complet minim model clark complet describ minim model semant residu belief theori proposit finit residu belief theori interpret languag minim model model clark complet proof appendix worth point weak origin version clark complet fact appli residu arbitrari normal program clark origin complet enforc minim model tautolog made complet axiom useless problem origin definit clark complet distinguish logic negat belief clark complet inconsist rule present definit clark appli class residu belief turn finit belief theori transform finit residu belief theori set minim model coincid proposit finit belief theori transform finit residu belief theori call interpret languag minim model minim model proof appendix elementari theori partial suffici obtain residu program detail definit transform reader refer describ briefli remov rule atom head bodi rule trivial satisfi useless transform call defin object atom rule rule head applic rule result belief theori obtain delet rule ad belief theori rule give simpl tradit notat belief theori requir form unfold bodi liter obtain residu program easili procedur repres form consequ proposit obtain import theorem finit belief theori clark complet describ minim model semant theorem finit belief theori interpret languag minim model model clark complet denot set augment belief theori ensur formula belong clark complet believ lemma lemma arbitrari finit belief theori cn formula true minim model bf proof appendix readi state fundament result obtain articl theorem complet clark static complet finit belief theori defin cn proof cn show cn min fg ffl bg theorem min hand side ffl min theorem proposit tautolog proposit bf proposit lemma conclud mean prove fix point belief closur oper static conclud fix point coincid static complet result state static complet obtain augment set ensur formula belong clark complet believ establish interest intrigu relationship static complet clark complet finit belief theori reduc reason static semant comput static complet easili accomplish comput clark complet underli modal logic hand autom theorem consequ proof result immedi obtain fundament theorem obtain power result state static complet arbitrari finit belief theori obtain singl iter belief closur oper theorem static static complet finit belief theori obtain singl iter belief closur oper cn min fg theorem state static complet obtain augment belief bf formula true minim model theori elimin multipl iter comput static complet replac definit static complet explicit definit addit theorem fourth static complet present paper needless exist point definit static complet significantli simplifi notion underli theori foundat result obtain belief theori note min ix ix cn min fg impli broken proposit belong static complet proposit belong complet easi verifi min run formula run belong clark complet min written form distribut axiom da appli formula proposit conjunct belong conclud static semant deriv broken observ reason util iter belief closur slightli complex iter perform needless method lead ident result refer stefan brass jurgen dix gener approach comput disjunct semant nonmonoton extens logic lnai page stefan brass jurgen dix disjunct stabl semant partial evalu journal logic abstract stabl semant partial evalu intern page lnc stefan brass jurgen dix disjunct wellfound confluent calculi iter gcwa journal autom abstract confluenc iter gcwa logic artifici jelia page lnc stefan brass jurgen dix semant disjunct logic program base partial evalu journal logic accept abstract disjunct semant base partial intern logic program page mit stefan jurgen teodor przymusinski super logic program principl knowledg intern confer page san morgan bry logic program formal applic proc eighth acm symposium principl system page bry negat logic formal construct logic dimitri inform system artifici integr page springer keith clark negat failur gallair logic page dung fixpoint approach declar semant logic program el ra north american confer usa mit octob dung natur semant logic program negat el ra confer foundat softwar technolog theoret comput springer michael teodor przymusinski relationship circumscript negat failur artifici john mccarthi form nonmonoton reason artifici jack minker indefinit close world assumpt confer autom page springer przymusinski knowledg framework base autoepistem logic minim belief twelfth nation confer artifici august page lo confer american associ artifici morgan kaufmann teodor przymusinski static semant normal disjunct logic program annal mathemat artifici special issu disjunct program teodor przymusinski autoepistem logic knowledg belief artifici sakama seki partial deduct disjunct logic declar approach logic program synthesi transform meta program lnc page springer proof theorem section proof proposit model complet axiom atom bg satisfi direct satisfi model assum direct satisfi complet model direct satisfi rule bg bg bf bf true bf true bg interpret differ model minim minim model satisfi rule bg bg bf bf direct complet axiom violat assum smaller model minim object atom complet axiom bg contraposit proven opposit minim model model satisfi complet axiom bf bg smaller bf bf bg bg hand side true conclud proof proposit show belief theori transform residu belief theori appli easi applic combin tautolog remov object atom bodi introduc bodi mean finit number transform lead belief theori bs bodi appli procedur object atom belief theori produc residu belief theori suffic establish lemma lemma belief theori result applic delet tautolog minim model delet tautolog chang set set minim model appli rule object rule rule head ffl rule result applic logic consequ rule model model ffl minim model show model necessarili rule violat rule mean minim model interpret equal model object atom occur negat rule mean rule rule atom rule aa rr unfold rule tautolog violat exclud multipl occurr infer rule violat contradict show set minim model ffl minim model part model smaller minim model part proof model contradict assum minim model ffl minim model model smaller model model lead contradict proof lemma prove lemma minim model special belief theori lemma belief theori set formula belief atom minim model minim model satisfi proof ffl minim model model smaller model differ interpret belief model model contradict assum minim ffl minim model satisfi model model exist smaller model contradict minim continu proof lemma lemma arbitrari finit belief theori cn formula true minim model bf subset consist belief axiom instanc axiom formula forc deriv rule model coincid model requir closur logic consequ chang set model lemma minim model minim model satisfi hold minim model proposit minim model coincid model hold model proposit consequ compact proposit finit subset ff ff tautolog proposit necessit proposit closur classic conclud proof axiom definit origin axiom show axiom definit complet origin definit autoepistem belief theori consist normal necessit infer bf recal presenc axiom axiom axiom bf state formula proposit axiom necessit rule axiom infer rule theori languag instanc axiom close standard proposit consequ necessit rule instanc axiom close standard proposit consequ infer rule proof theori instanc axiom close standard proposit consequ necessit rule true belong necessit rule axiom hold show axiom hold show formula bf bg belong necessit rule normal axiom infer bf bg bf bg show axiom hold suffic prove formula belong necessit rule normal axiom infer bf appli normal axiom conclud bf show bf bg demonstr infer rule hold belong belong normal axiom immedi bf bg theori instanc axiom close standard proposit consequ infer rule axiom hold belong rule belong axiom conclud bf bg belong prove belong normal axiom hold remain show close necessit belong true rule formula bf belong impli bf belong
IR/496 5 cluster web document categor daniel maria robert kyle georg jerom moor depart comput scienc engin mn abstract cluster techniqu intellig softwar agent order categor document world wide web cluster extract salient featur relat web document automat formul queri search similar document web tradit cluster algorithm priori knowledg document structur defin distanc similar probabilist techniqu bayesian classif tradit featur space high rel size document space introduc cluster algorithm effect cluster presenc high featur space cluster base gener graph requir ad hoc distanc capabl automat discov document similar associ conduct experi real web data featur select compar cluster scheme standard hierarch bayesian classif autoclass world wide web graph princip compon analysi work support part armi research offic contract armi high perform comput research center cooper agreement number number content necessarili reflect posit polici offici infer addit support provid ibm partnership ibm sur equip grant access comput facil provid minnesota supercomput institut introduct world wide web vast resourc inform servic continu grow rapidli power search engin develop aid locat unfamiliar document subject queri return inconsist document referr meet search criteria interest user feasibl extract full mean html intellig softwar agent develop extract featur word structur html document emploi classifi categor document cluster offer advantag priori knowledg categori categor process result cluster automat formul queri search similar document organ bookmark construct user profil present cluster algorithm base graph partit compar perform tradit cluster algorithm inform retriev tradit cluster algorithm defin distanc similar probabilist techniqu bayesian classif break size document featur space high characterist inform retriev applic filter categor document world wide web algorithm perform presenc high space section describ cluster section present result number experi method select featur compar result cluster algorithm show partit cluster method perform tradit distanc base cluster final section compar work similar system present idea futur research cluster method exist method document cluster base probabilist distanc similar measur method hierarch cluster cluster select set word document featur document repres featur view point space number problem cluster space tradit method trivial defin distanc measur space featur vector scale avoid skew result document length possibl common word document techniqu tfidf deal found experi tfidf scale number word document larg scheme gener requir calcul document chosen initi random high cluster mean randomli chosen cluster poor job separ document probabilist method bayesian classif autoclass perform size featur space larger size sampl set depend independ underli featur web document suffer high high correl featur valu found hierarch cluster autoclass perform poorli exampl cluster design effici handl high space larg data shown result describ associ rule hypergraph partit associ rule hypergraph partit cluster method base associ rule discoveri techniqu data mine techniqu affin item transact find sale relationship item sold supermarket custom transact transact view relat tabl item repres attribut domain attribut binari domain item bought integ indic frequenc transact figur depict portion typic supermarket transact figur portion typic supermarket transact associ rule discoveri method find group item occur frequent transact group item refer frequent item set discov frequent item set form vertic item hyperedg repres frequent item set hypergraph partit algorithm find item cluster similar item captur implicitli frequent item set document retriev view set document transact form document correspond item featur correspond transact entri tabl document repres frequenc occurr featur document frequent item set found associ rule discoveri algorithm correspond set document suffici larg number featur common frequent item set map hyperedg hypergraph typic repres transact depict figur figur transact view typic set hypergraph consist set vertic set hyperedg hypergraph extens graph hyperedg connect vertic set vertic correspond set document hyperedg correspond set relat document kei problem model data item hypergraph determin relat item group hyperedg determin weight hyperedg hyperedg repres frequent item set found associ rule discoveri algorithm associ rule captur relationship item present transact set transact transact subset subset defin support count respect number transact associ rule express form support rule defin confid ff defin task discov associ rule find rule greater minimum support threshold ff greater minimum confid threshold associ rule discoveri step step discov frequent set support greater minimum support threshold step gener associ rule frequent frequent item set comput associ rule algorithm apriori excel candid find relat item note algorithm find frequent item set support greater threshold threshold determin domain specif manner frequent item set captur relationship item size greater equal note distanc base relationship captur relationship pair data point frequent item set captur relationship larger set data point ad model power nice captur hypergraph model hypergraph cluster larg group relat item partit highli connect partit achiev hypergraph partit algorithm partit hypergraph part weight hyperedg cut partit minim note minim essenti minim relat violat split item group part bisect partit highli connect task hypergraph partit algorithm partit larg hypergraph size minut person comput hypergraph partit elimin bad cluster cluster fit criterion set vertic repres hyperedg set vertic repres partit fit function measur good partit defin fit function measur ratio weight edg partit weight edg involv vertex partit good partit examin filter vertic highli connect rest vertic partit connect function vertex defin connect measur percentag edg vertex high connect suggest vertex edg connect good proport vertic partit vertic connect measur greater give threshold consid belong remain vertic drop partit filter document achiev support criteria associ rule discoveri compon algorithm depend support threshold document meet support document share larg subset word prune featur cluster larg document set return standard search engin keyword queri princip direct partit algorithm princip direct document repres featur vector word scale unit length algorithm method begin document singl larg proce split subclust fashion stage method select cluster split cluster subclust part scatter measur averag distanc document cluster cluster size desir result cluster approxim size part construct linear discrimin function base princip direct direct maxim comput document princip direct respect defin hyperplan normal princip direct pass hyperplan split cluster part children cluster cluster entir cycl repeat time desir result binari tree hierarchi cluster root entir document interior node split children leaf node constitut partit entir document set definit hyperplan base princip compon similar hotel transform comput princip direct lead eigenvector sampl covari matrix fast singular solver advantag high sparsiti term frequenc solver cost proport number nonzero term frequenc matrix discuss detail method differ latent semant index wai lsi origin formul method reduc search space handl retriev document set search term oper scale document vector unit length singular decomposit matrix document vector shift document origin order comput covari matrix lsi method comput singular vector entir matrix document order singular begin process comput singl lead singular vector vector easier obtain repeat comput cluster found cluster smaller initi comput faster norm document repres featur vector word scale unit length usual euclidean norm leav sparsiti pattern untouch altern scale tfidf scale scale fill entri drastic cost algorithm factor spite tfidf scale lead notic improv result experi hierarch cluster classic algorithm implement bottom hierarch cluster method base distanc function start trivial document cycl loop merg cluster loop cycl reduc number cluster repeat desir number cluster reach chose distanc function base measur cosin angl document cluster repres cluster mean scale cluster size discourag larg cluster autoclass algorithm autoclass autoclass base probabilist mixtur model set data autoclass find maximum paramet valu specif probabl distribut function cluster vc vc class mixtur autoclass calcul probabl data point belong class advantag autoclass theoret foundat bayesian statist cluster result provid full descript cluster term probabl distribut attribut work discret continu attribut result cluster probabl data point belong cluster analyst determin cluster membership data point base probabl weak autoclass underli probabl model assum independ attribut assumpt restrict problem basic model provid satisfactori distribut function order discret attribut attribut respect hidden domin cluster process result setup experi present select web page ten broad affirm action busi capit electron commerc intellectu properti industri partnership inform system materi process manufactur system integr personnel manag page obtain keyword search standard search engin page archiv label facilit entropi calcul subsequ refer page direct archiv ensur stabl data sampl page fairli dynam content result obtain similar experi smaller set document report document obtain part network excel manufactur line origin experi experi describ paper grew initi set valid larger dataset result obtain origin experi seri experi larger dataset obtain yahoo onlin support scalabl section word select dataset set criteria size comment word select word quantil filter quantil filter select frequent occur word accumul frequenc exce threshold includ word partit contribut word exce threshold top word select frequent occur word includ word partit contribut word top word select top word augment word html word tag frequent item set select word document word list word cluster object measur identifi import group word word text frequenc prune word select exclud occur top text frequenc prune word select exclud occur top text frequenc top text frequenc top text frequenc tabl setup experi word list document filter porter algorithm implement deriv ten cluster document algorithm analyz result object reduc cluster problem retain import featur document ten experi conduct distinguish select shown tabl evalu cluster result valid cluster algorithm compar perform algorithm complex difficult find object measur qualiti cluster decid entropi measur good cluster cluster document class entropi cluster cluster document entropi cluster higher total entropi calcul weight sum entropi cluster compar result experi compar entropi algorithm featur select method note hypergraph partit method cluster entropi comput document cluster experi suggest cluster method base partit work type inform retriev requir calcul randomli chosen issu cluster mean close space linearli scalabl respect cardin document featur space contrast hac autoclass qualiti cluster affect data set method similar behavior experi filter base word frequenc major frequent item set experi discuss method perform tradit method hac norm featur select criteria algorithm autoclass hac tfidf scale prohibit featur select criteria size hac hour minut autoclass minut algorithm larger dataset experi show algorithm scale linearli number entri term frequenc matrix document small fraction entir dictionari term frequenc matrix larger dataset entri nonzero algorithm advantag yield scalabl illustr norm tfidf hac tfidf hac norm autoclass cluster entropi experi entropi figur entropi comparison algorithm cluster result shown slightli number cluster cluster note lower entropi cluster perform qualiti experi point notabl gener cluster algorithm yield qualiti cluster full set featur discuss larg dataset comput cost prohibit import select smaller set repres featur improv perform cluster algorithm lose qualiti experi featur select method repres show restrict featur set frequent item set part associ rule identifi small set featur relev cluster task experi produc result obtain full set note drawn discuss confirm earlier seri seri time obtain cluster algorithm number nonzero entri term frequenc matrix figur time obtain cluster data set algorithm time sgi challeng plot number nonzero term frequenc matrix experi total independ set document norm scale aa bc ec er ip mp pm entropi tfidf scale aa bc ec er ip mp pm entropi figur distribut document cluster algorithm tfidf scale cluster column show document label cluster judg qualiti cluster distribut class label cluster figur show class distribut experi algorithm tfidf scale full result data web figur show class distribut experi hac algorithm tfidf figur show result figur show result autoclass hac norm scale aa bc ec er ip mp pm entropi hac tfidf scale aa bc ec er ip mp pm entropi figur distribut document cluster hierarch cluster algorithm tfidf scale cluster relat work number web agent inform retriev techniqu characterist open hypertext web document automat categor document semant inform link structur document content classifi group document term hyperlink structur system requir inform maintain router bo combin hierarch agglom cluster techniqu user interact organ collect web document list person bookmark file pattern recognit method word cluster hartigan partit cluster algorithm discov salient html document featur find similar html document web cluster algorithm scale larg number document broder calcul sketch document web cluster similar document sketch exce threshold resembl document similar document aa bc ec er ip mp pm entropi figur distribut document cluster algorithm cluster cluster document cluster yield cluster autoclass aa bc ec er ip mp pm entropi figur distribut document cluster autoclass algorithm cluster document cluster easili index www maintain maarek hierarch agglom cluster method form cluster document list person bookmark file individu document profil vector consist pair lexic affin document similar function indic share method scale larg document search syskil webert system repres html page boolean featur naiv bayesian classif find web page singl user profil balabanov present system singl profil find similar web document user candid web page locat compar word vector user profil return page tfidf scheme calcul word normal document length system larg dictionari limit user wide techniqu reduct princip compon analysi data set data item variabl pca comput covari matrix size calcul lead eigenvector covari matrix lead eigenvector matrix princip featur data origin data map princip direct project data lower dimens cluster tradit cluster algorithm hierarch cluster autoclass pca guidelin determin number dimens data base proport varianc explain characterist root covari matrix note method provid wide guidelin difficult find number dimens choic small lose import featur data choic larg captur import larg tradit cluster algorithm work effect latent semant index reduct techniqu extens inform retriev domain similar natur pca find singular decomposit covari find singular decomposit origin data pca lsi preprocess method produc lower dataset subsequ process algorithm context queri lsi success reduc lead higher result user queri consid preprocess modul context preliminari experi direct carri lsi yield respect entropi obtain lsi extract dimens approxim term frequenc basi subsequ method main difficulti lsi pca method necess comput lead singular valu vector term frequenc desir dimens naiv matrix solver oper comput prohibit method advantag sparsiti speed substanti lanczo method great success algorithm difficult comput lead singular valu vector lsi lead singular vector time result low dimens approxim typic substanti process cost subsequ cluster method potenti occupi space origin depend choic kohonen featur map neural network base scheme project high input data featur map smaller dimens proxim relationship input data preserv data set larg discuss converg depend initi paper present method associ rule hypergraph partit princip direct suitabl type inform retriev applic discuss method depend distanc perform high space experi suggest method perform tradit cluster algorithm techniqu featur select perform featur document cluster experi suggest featur select restrict present frequent item deriv apriori tradit method tend perform evid hypergraph partit method perform featur select includ word document author html tag futur research plan includ develop method increment cluster classif document discov initi set cluster plan investig cluster techniqu word cluster word cluster classifi document search relat document web refer mark al learn probabilist user profil ai ai verkamo fast discoveri associ rule um advanc knowledg discoveri data page ai verkamo fast discoveri associ rule um advanc knowledg discoveri data page marko yoav yun adapt agent autom web journal visual commun imag berg graph hypergraph american obrien linear algebra intellig inform retriev siam bolei princip direct partit technic report depart comput bolei hierarch taxonomi partit technic report depart comput andrei steven mark manass syntact cluster web proc intern world wide web april chang hsu customiz search tool cluster proc intern world wide web cheeseman stutz classif theori result um advanc knowledg discoveri data page chen sycara webmat person agent search proc intern confer autonom richard duda peter hart pattern classif scene analysi john wilei frake stem algorithm frake inform retriev data structur page prentic frake inform retriev data structur algorithm prentic englewood golub van loan matrix comput john hopkin univ eh mobash cluster base associ rule hypergraph workshop research issu data mine knowledg page eh mobash hypergraph base cluster data summari result bulletin technic data jackson user guid princip compon john wilei ak jain dube algorithm cluster data prentic shekhar multilevel hypergraph applic vlsi domain design autom kohonen memori sy lu ks fu cluster procedur pattern analysi ieee transact man maarek israel ben shaul automat organ bookmark content proc intern world wide web mobash web page categor featur select associ rule princip compon cluster workshop inform technolog dec porter algorithm suffix strip ross quinlan program machin learn morgan san gerard salton michael mcgill introduct modern inform retriev dm ue statist analysi finit mixtur distribut john wilei ron mark peter david gifford hierarch network search engin exploit hypertext cluster seventh acm confer march marilyn william punch find salient featur person web page categori proc intern world wide web april
Agents/497 1 activ logic program dipartimento di universita degli studi di loc abstract paper present logic program languag aim defin agent agent system main design object introduc declar fashion essenti languag close syntax semant plain languag special atom rule extern agent respond action intern event trigger past present event awar extend resolut agent answer queri plain cope kind exhibit reactiv proactiv behaviour introduct paper address issu defin logic program languag reactiv proactiv agent clear procedur declar semant motiv paper straightforward build logic agent difficult build logic agent interact perform action initi event occur extern lot work order equip logic agent sophist form ration logic agent repres agent build argument mean infer rule agent logic rule infer relat logic agent defin specif infer rule commun modal logic agent combin belief goal updat practic reason bdi fashion logic agent interact environ limit logic agent reason action subsequ manipul simpli logic complex data act accord declar polici approach relat logic syntact base transit system oper semant reactiv proactiv agent typic achiev function mean condit constitut stimulu agent perform kind action approach aim combin ration reactiv reactiv ration model reactiv rule integr constraint proof procedur combin approach approach obtain ration reactiv agent treat commun primit abduc approach logic program repres actual behavior agent detail behavior complex notabl except relev approach concurr logic program languag congolog base situat properti system formal prove congolog implement develop constraint logic program languag context specif methodolog base linear logic paper focu repres reactiv proactiv logic program simplest object introduc declar fashion essenti languag close syntax semant logic program result languag call easi easi easi distinct atom repres extern event place action messag extern event atom distinct atom repres intern intern event correspond reach trigger kind activ agent distinct atom reason past present event agent distinct atom repres action perform reactiv rule event extern reactiv rule understood agent reaction action rule action action rule understood defin precondit action activ rule action model proactiv agent perform action aim reach kind reactiv behavior agent act reactiv rule activ procedur semant base extend resolut declar semant agent agent system base current stage consist herbrand model suitabl modifi version logic program repres agent snapshot organ repres agent system order discuss simpl basic languag plain proposit finer distinct consciou fact introduc variabl relat issu cope lack leav topic scope present paper practic logic languag featur real remain simpl clean easili mention approach reactiv logic program extern event order illustr extens rule understood logic program instanc logic rule mean prove truth consequ rule truth condit truth import notic rule candid resolut goal final select fair appli consequ oper interpret resolv reaction interpret stimulu assum extern occur independ program extern action affect depend environ program put work distinguish case similarli logic approach leav languag develop decid agent made consciou event suitabl repres event agent call action view simpli assum event assum true agent ag observ event rule defin program agent interpret rule determin action execut stimulu enhanc logic program kind modul agent multipl studi topic assum form modular program divid separ endow affect standard refer agent implicitli refer logic program defin ag associ ag set distinct atom ag fe repres extern event call event atom event atom true agent assum event place record set ev ag ag possibl provid rule understood stimulu call rule reactiv rule notic singl reactiv rule event multipl definit assum event reactiv rule applic reactiv rule remov ev state limit bodi rule situat fairli analog true rule mean aim prove specifi activ infer undertak atom bodi intend determin truth vice predic prove true opposit side implic notic truth impli truth truth truth check make interpret order make recogniz rule slightli notat instanc replac token syntax reactiv rule sake predic fact ag repres extern stress explicit denot event determin rule instanc ag rain open open umbrella rain ag rule case agent open umbrella truth event check truth relat condit open umbrella usual logic prove condit umbrella notic atom condit reactiv order relev variat previou ag rain open decid open umbrella decid instanc enter action ag reactiv associ ag set distinct atom ag fa repres action ag perform call action atom action perform extern agent initi bodi explicit rule head call action rule bodi rule express precondit action perform action rule ordinari fact treat resolut order make visibl action rule express precondit add syntact sugar distinguish action rule action rule form left implement hand atom true extern agent action perform case ag interact environ rule action action potenti perform time predic fact ag repres stress explicit denot ag danger call polic call polic extern event danger ag agent react ordinari impli possibl perform action call polic ag call polic ag perform precondit action rule notic arbitrari decid predic insert set ag action distinct action ordinari predic action affect observ agent declar point action subgoal action rule action subgoal action rule succe fail case action standard procedur semant horn languag practic action unsuccess achiev intend effect extern environ refer action call polic practic prevent phone order agent cope kind protocol interact agent implement make agent awar failur action possibl special gener extern agent suitabl event rule intern react assum trigger kind activ agent defin set distinct ag predic consid possibl reactiv rule kind predic call intern event procedur point assum obtain mean ordinari record set iv ag reconsid trigger reactiv rule similarli extern intern event reactiv remov iv predic fact ag repres intern stress explicit denot assum express fact sing song henri theori henri happi sunni happi sing sing song defin reactiv happi henri state intern happi interpret determin action intern event plai import role agent make kind plan achiev goal mean reactiv rule relat intern plan subgoal achiev intern event simul sort reason react subgoal predic belong ag automat attempt time time refer subgoal happi attempt appli reactiv rule case success left possibl guid suitabl direct action atom consid intern agent action assum ann invit friend check possibl car bu call friend susan order join repres rule ann invit car bu car car car susan draw past event event atom bodi rule case depend happen extern intern event record event atom ag ag add distinct atom stand mean event happen past call ep ag set atom express georg happi rule georg happi call call notic sourc nonmonoton observ behavior agent queri agent henri initi succe event call happen event past event agent react reactiv rule appli past event ad handl time set past event sort import notic fact record extern event action perform set past event constitut repositori harm declar point view practic point sort agent enforc coher interact extern environ notic set past event mean similar memori imper record arbitrari statement draw present event reason extern event agent react atom bodi correspond event reactiv rule appli distinguish reason react event event atom add distinct atom stand mean event happen consid call en ag set atom mari alarm clock realiz time stand switch alarm clock mari god late alarm clock ring god late stand alarm clock ring switch alarm clock ring extern god late agent interpret intern event notic ring alarm clock reason mean special predic alarm clock ring rise reaction alarm clock ring god late mari switch amari alarm clock ring present event reason effect action procedur semant build interpret possibl monitor extern intern respond stimuli mean extens assum associ set goal process ffl set ev ag extern event agent agent possibl ffl set iv ag intern event prove stimuli agent possibl ffl set pv ep ag past event intern procedur behaviour agent consist activ answer queri plain respond extern intern event prove goal intern event suggest goal attempt time kind activ principl independ answer extern intern event agent respond goal disjunct compon goal goal defin conjunct mean comput fail disjunct fail suggest strategi prove goal interpret step pick subgoal add extern intern event resolut strategi adopt implement perform interleav compon goal definit resolut strategi scope paper concentr defin resolut step interpret perform formal definit extend resolut notic resolut step updat set ev iv pv definit case case select atom belong exist compon goal case atom chosen set extern ad compon goal stage infer case gener applic resolut strategi state order case class event definit logic program defin agent ag set extern event ag intern event ag action ag past event ep ag present event en ag set ev ag iv ag pv ep ag goal form resolut deriv goal set ev iv pv mean step select atom defin appli select atom input obtain ev iv iv iv pv pv select atom ag defin deriv goal compon goal replac ev ev pv pv ag iv iv fq iv iv select atom en ag ev deriv goal compon goal replac ev ev iv iv pv pv atom ev join deriv goal compon goal ev ev fe iv iv pv pv fe atom iv join deriv goal compon goal ev ev iv iv fi pv pv fi atom ag join deriv goal compon goal goal resolut pick subgoal compon goal proce refut usual case adequ subgoal action atom defin event atom reactiv perform action mean select action atom defin remov goal action precondit left implement perform make action atom true form extern agent action intern includ set iv possibl trigger intern reaction atom event ev extern event consid atom simpli remov ev remain agent react agent knowledg reason possibl react react extern intern insert compon goal goal event remov set event insert set past event insert compon goal correspond intern event case compon goal agent act left resolut strategi case appli step left resolut strategi extern intern organ interleav compon goal consid previou definit fact subgoal intern event insert set iv sake notic definit made introduc nest refut atom nest subgoal subgoal form resolv subgoal intern event nest subgoal obtain empti nest subgoal prove iv iv fag notic ev repres kind input channel agent classif event messag observ interact extern resolut strategi input kind declar prioriti select possibl declar semant work complet definit declar gener term evolut system declar semant agent initi agent behavior sketch describ evolut set interact initi idea studi properti system semant singl introduc concept evolut agent system object declar model reactiv rule extern intern event moment plain herbrand model slightli modifi true mean unit rule chang mean differ previou version bodi trick reactiv program event assum transform ad bodi rule mean rule ag defin condit rule true truth event happen add rule model fact reactiv rule past event gener object declar model action point action atom true action perform rule simpl program written plain herbrand model fact modifi program model ag assum event atom action atom defin modif ensur action atom true action defin condit true assum defin herbrand model fact modifi program model interpret action state deriv action perform rule defin action action rule form fa assum add rule defin add mean perform precondit head provid condit bodi true extern intern past event true add unit defin declar semant program written enhanc languag standard declar semant program obtain mean modif work prove resolut correct complet wrt declar mean adapt standard proof import notic defin semant languag modifi leav semant approach unchang properti exploit technic machineri relat method program analysi abstract partial remain applic behavior agent simul resolut strategi program differ form select cancel obtain extend semant approach defin procedur model evolut logic program build comput rule build comput herbrand model start point set event chang unit back step obtain evolut agent system order studi instanc pick suggest adopt techniqu field conclud remark agent defin complet input resolut strategi theori input recogn underli integr convert incom form intellig agent insert channel lot implement issu left open paper import point time possibl guid direct time constraint constraint influenc resolut strategi clear prove program satisfi requir metareason import remark agent reason basi possibl requir sophist strategi achiev interest basi enhanc languag reflect reflect prolog basic languag line metalevel inform construct agent record inform heterogen inform view integr heterogen inform system import notic consid negat negat import express practic point except state gener reactiv rule assum negat defin situat bird fly avoid predat anim run abnorm penguin anim predat attack escap fly escap run fly negat add complic declar procedur semant ad negat main topic futur research work suitabl comparison relat work miss add comparison final version paper refer autonom agent design base increment induct learn logic program van der lesper scherl proc symp logic approach agent model page utrecht zini logic program synerg combin applic semant logic program perspect springer reflect agent metalog program lnc page metalog program semant applic int theoret artifici zini combin logic agent rapid prototyp engin distribut applic accept toni combin introspect commun ration reactiv agent del logic artifici lnai page reflect model distribut object manag research issu data engin distribut object lnc page pick heterogen activ agent technic research report gelfond lifschitz repres action chang logic program logic genesereth ketchpel softwar agent comm giunchiglia multiag system stanford giunchiglia local model contextu reason work paper common fourth symp logic formal kowalski sadri unifi agent architectur combin ration reactiv pedreschi logic intl workshop lnc page scherl foundat logic approach agent program intellig agent agent lnai page lloyd foundat logic edit jen argument agent work paper common fourth symp logic formal rao georgeff bdi theori practic intern confer system page san june rao georgeff model ration agent fike knowledg reason page morgan kaufmann san april levesqu commun system agent methodolog lnai page van de van der meyer formal semant abstract agent program languag van der lesper scherl proc symp logic approach agent model page utrecht
HCI/498 4 build block wearabl comput henk faculti inform technolog system delft netherland abstract implement wearabl develop processor board rich set interfac support dynam voltag perform power scale match mw wearabl configur multipl oper fpga board dedic reduc power consumpt significantli introduct small wearabl comput integr wearabl ubiqu mobil phone comput capac flexibl comput wearabl comput equip sensor monitor environ state user offer context awar servic user straightforward locat awar tourist applic rapid advanc technolog enabl product power wearabl comput futur unclear killer depend factor user interfac standard touch augment realiti infrastructur telecom oper provid open access public peopl collabor question impact requir put wearabl comput rapid develop uncertainti applic domain call flexibl hardwar easili adapt futur flexibl lead ineffici usag resourc resourc wearabl flexibl comput cpu lot power static solut implement custom hardwar paper describ approach strike balanc flexibl energi consumpt combin process fpga dedic signal process custom hardwar realiz flexibl wearabl comput dissip modest amount power delft technolog research develop wearabl comput rang devic handl multimedia inform stream wireless link augment realiti termin displai visual inform project properli integr real world minim develop effort hardwar softwar decid cpu core wearabl put number requir process easili interfac devic rf unit support intens applic demand support effici support standard program debug tool open research result made publicli solv tension adopt modular approach modul base interfac easili modest perform good ratio wearabl configur multipl unit oper parallel deliv raw mip requir equip modul posit touch realiz set build block wearabl comput design build block linux advanc radio termin section detail function perform build import aspect discuss separ section build block built intel select low ratio rich support run mhz perform compar pentium arm processor support linux oper conveni matur gnu util modular structur open linux easi extens tailor devic driver support linux address requir state previou section figur show processor board hold mb mb flash boot connector adapt board develop standard wavelan wireless commun board full speed processor board consum implement scale section applic requir peak perform consum power perform power dissip cpu match applic processor lcd interfac part user interfac provid separ extens kitchen sink board includ interfac keyboard stereo audio mono audio channel convert client irda id channel connector hard disk kitchen sink board offer buffer option ethernet card rich set support interfac build wearabl comput augment realiti termin requir addit interfac develop board posit read figur processor board process sensor data render stereo imag displai interest board extens board hold fpga chip serv offer ratio cpu dedic video captur softwar program interfac serial interconnect multipl oper parallel cascad multipl board essenti total process requir exce capac singl implement wearabl task map separ processor content hardwar resourc singl complic schedul tabl list method connect multipl board energi transfer bit dynam compon static dynam consumpt run link full speed transfer energi memori bu shown refer figur complet includ cabl static power energi bit speed dynam total kbp ethernet mbp mbp memori bu tabl interconnect characterist receiv note transfer speed interfac throughput trade power consumpt schemat design file build block freeli web batteri energi resourc wearabl comput compon select low power section discuss aspect design voltag scale prime reason select processor oper low voltag dissip power support frequenc scale oper clock speed rang potenti reduc energi consumpt prerequisit processor voltag reduc simpli reduc clock frequenc pai comparison switch cpu reduc frequenc voltag result power save due quadrat relat power dd data sheet oper experi show rang feasibl dynam adjust match process demand bursti design programm voltag regul pin note voltag processor core compon run fix loss variabl power suppli measur depend potenti save rang extend linux kernel modul clock frequenc core voltag adjust memori paramet control cycl extern deriv processor clock kernel modul access write desir frequenc pseudo kernel lookup tabl select minimum core voltag processor function select frequenc time switch µ stabil intern clock delai low support bursti applic rapidli chang process video decod fp incur penalti power consumpt fix voltag scale voltag clock frequenc figur power consumpt effect voltag scale shown figur plot power consumpt benchmark vari processor frequenc fix voltag power linearli frequenc scale voltag result curv show expect quadrat power consumpt differ largest case voltag scale yield factor improv note voltag scale effect applic memori subsystem fix preliminari result obtain video decod show power reduct cpu power drop configur origin requir extern measur control equip support voltag scale dynam scale extern convert setup support power scale ideal support futur research mobil platform desir higher level integr process modul develop achiev higher level integr newer technolog origin term compon assembl modern assembl techniqu integr function semiconductor technolog offer lower power consumpt previou design integr convert processor directli control core voltag current sensor major power rail oper system directli measur power consumpt system combin techniqu enabl power awar modul obtain view state system compon select power consumpt account memori bu short reduc capacit load power consumpt applic save mw power measur control circuit consum mw power major audio hard switch power suppli chip high power high effici custom hardwar system design modular expand mind fpga board mention section primarili design intellig interfac card commun fpga board wearabl comput cpu reconfigur fpga footprint board hold wide rang cheap high densiti million offer flexibl studi power impact process programm chip develop custom board assist wearabl specif task posit video captur custom board solut obtain discuss posit hold acceleromet gyroscop magnetomet gp receiv data sensor fed kalman filter posit estim situat power consumpt import posit shut sensor period time note sensor time stabil power magnetomet sampl minimum stabil time ms sensor cyclic turn ms turn save mw statu moment write modul fulli posit wireless comm ethernet render figur platform architectur board stage debug plan put quarter drive forc demonstr system capabl render statu front build requir integr wireless render wearabl figur show modular structur platform posit wireless modul render modul depend graphic card accompani softwar librari pc architectur posit modul discuss section wireless modul consist processor adapt standard wavelan card platform softwar studi qualiti cost realist set relat work devic abund consum market low power power processor compaq ipaq seri pocket pc design similar base pda commerci tend close possibl enabl research ad chang hardwar board small support standard interfac isa interfac sort characterist make popular wearabl comput research product offer power consumpt research comput compar process power consum versu devic resembl compaq base target research commun hardwar complet restrict research compaq reserv deriv work custom import technic differ core power suppli design ten percent effici core suppli differ amount mw consum batteri power delft technolog implement wide rang wearabl comput minim design implement effort develop set build block configur individu wearabl processor hold form heart wearabl implement voltag cpu perform power match demand applic cpu provid suffici comput multipl interconnect oper parallel addit develop fpga board ratio dedic applic video captur interfac link form interconnect multipl vari clock frequenc fpga perform match reduc power consumpt develop custom board assist wearabl specif task posit video captur case posit combin data sensor yield locat design flexibl vari rate sensor data accuraci power consumpt made acknowledg develop start project fund develop continu program fund tu research program van van der comment draft version paper refer design linux machin journal linux linux advanc radio termin design page western research lab pocket overview slide consortium feasibl termin ieee acm int workshop augment realiti page san oct dynam voltag scale microprocessor int symposium mobil multimedia system applic page nov pentland augment realiti wearabl comput winter
ML/499 6 learn design support kati borner abstract present gener approach combin method interact knowledg acquisit method machin learn approach develop order deliv knowledg requir learn rest knowledg scheme case distinguish knowledg subgoal knowledg design emploi protocol user action tackl initi input increment knowledg acquisit learn task structur subgoal similar relat applic introduct integr increment learn system lessen burden knowledg elicit system develop goal paper point learn interact system cbr main problem solv method section briefli describ domain deal section sketch role trace interact learn section present basic concept knowledg scheme emploi section reason learn procedur appli present final part paper discuss approach introduc paper applic industri build design gener applic domain delin integr knowledg acquisit learn industri build design focu instal build complex infrastructur main problem layout subsystem fresh electr comput phone architect blueprint draw solv problem reason natur problem solv method captur procedur build draw correspond snapshot design object problem solv htwk depart po box frg depart cognit frg make knowledg scheme develop support build design repres object build design graphic basi code level basi reason learn figur snapshot constitut fresh air suppli net build type attribut refer state design graphic repres geometr object state design build correspond configur object repres substitut rectangl circumscrib rectangl overlap point readabl draw essenti improv fig repres state work design fresh air suppli net build code repres valu fix set geometr attribut describ placement extens type attribut repres state object adher valu type attribut form fix aspect relat subsystem build morpholog denot gener function area address state attribut specifi kind resolut emploi size relat part build envisag area describ state object repres area linkag cover floor object repres fig type knowledg scheme basi learn similar relat give outlin knowledg acquisit integr interact input procedur learn provid trace trace protocol interact captur knowledg action perform user design knowledg extract trace feed system support human design tackl complex task divid part provid guidanc select state tackl design gener concret design solut automat case user posit reject offer system user support system subgoal design trace intent extent solut solut knowledg base state state solut design trace subgoal solut figur human system interact figur sketch interact human user system work dancer emploi trace record reflect user action trace elicit knowledg provid user emploi input learn procedur paper knowledg acquisit proce learn analysi trace output learn procedur requir subgoal design actual situat subgoal suggest subsequ design present concret design solut human user knowledg closer knowledg give case accur domain independ figur object state case industri build design illustr fig design state approach label state correspond arrang object ident case subsequ state relat ffl object repres attribut valu fix set attribut set attribut divid set attribut repres geometr object properti set attribut repres state object type repres concret geometr attribut valu object refer peculiar state similar relat ffl type repres task accomplish mean object type realiz task type collect type emploi design build full list task accomplish describ entri syntact level notion type refer problem solv activ test concept task ffl defin state set object ident type state repres type set geometr attribut valu object exist state repres requir object type design type object depend repres mean reason precondit result state relat case depend stage problem solv state role problem solut borner ffl case defin pair problem solut problem defin repres solut repres object design fulfil requir import differ type geometr descript object constitut solut repres subgoal repres concret design solut formal provid basi introduc procedur learn realiz increment knowledg acquisit design knowledg acquisit learn gener learn procedur introduc section enabl increment knowledg acquisit output learn procedur input subsequ learn procedur initi input provid list user action record work system basi ffl preprocess trace user action ffl identifi extract state tackl depend lead task altogeth form ffl collect ffl deriv similar relat case problem turn examin procedur extract free trace learn similar relat case applic preprocess trace trace made user action record design build trace repres sequenc state success provid inform deselect object design assign requir design build scheme set aspect set set morpholog set time trace valuabl sourc knowledg input learn procedur cover unnecessari wrong action elimin trace preprocess order obtain knowledg suitabl knowledg acquisit learn trace input preprocess fig earli design build school object object number object attribut valu solut assign object reflect assign valu dy object deselect creation object object select immedi deselect reflect user mistak inform relev subsequ extract school init school school school school school school set school resiz school deselect school select school deselect school init school school school school school school set school resiz school deselect figur trace state type valu geometr dimens dy creat object filter extract data fig data mark filter output trace fig object object type creat object object type trace extract learn design task divid sequenc subtask tackl task accomplish creation object knowledg requir design object captur knowledg refer divid task sequenc subtask subgoal build difficult acquir precondit effect design step free trace provid input learn complex structur altern peculiar design build figur design suppli net output state transit input procedur learn output procedur start design build usag region root node continu design climat usag region step design room wai shaft usag borner figur area sequel doubl arrow denot depend design design start design suppli net set object type time express requir design specif object parallel altern wai design repres determin object goal accomplish aim user guidanc partit complex realiz case learn kind templat sheet introduc domain emploi discern acquir case project templat sheet grid domain attempt make natur unit miss requir reason domain unit suitabl refer problem solut assum task design requir design strategi return air access connect shortest connect fresh air access curv track achiev reduct form precondit design object type repres case state design repres solut assum case solut state type index type cb fig fig problem descript object type necessarili case specif problem relat number task cb cb cb cb cb cb cb figur task depend learn similar relat deriv similar relat retriev prior case problem solv similar assess wide accept effici cbr similar assess fast preselect determin set candid structur similar assess structur comparison basi adapt describ similar relat learn similar assess proce compar weight attribut valu similar measur ham learn relev attribut reason input case group case ident output weight relev attribut classif structur similar assess structur case determin similar underli term algebra graph concept learn induct proper substitut appli substitut set case deriv gener call specif gener kind prototyp case set discuss detail prototyp similar assess imagin prototyp room repres room rememb concret room permit appli proper modif rule lead prototyp enter unseen easili recogn room simpli appli proper modif compar result room prototyp prior concret room permit deriv knowledg room set modif rule proper delet prototyp determin structur similar actual problem borner similar assess proce select rule appli actual problem applic yield prototyp actual problem structur similar case set adapt proce transfer oper solut descript concept deriv analog applic ident oper term result solut discuss system design rest effort manual knowledg elicit success simpli time feed knowledg requir system architectur enabl knowledg elicit learn user support system usag provid achiev combin learn knowledg elicit techniqu knowledg elicit establish framework system built enlarg learn techniqu develop framework real challeng enabl adapt support design delin approach incorpor learn system differ approach pursu similar goal emphasi reason major problem solv method learn procedur sketch deliv knowledg requir base reason increment learn accomplish trace user design record state user system increment learn state prefer sequenc similar relat knowledg learn support similar adapt build design time system lack knowledg solv problem problem alloc user simpli system task alloc user trigger system background knowledg close linkag knowledg problem learn adapt system user domain chosen algorithm underli preprocess trace extract implement test determin similar relat case usag similar assess adapt constitut backbon program call synthesi knowledg discuss detail acknowledg research support german ministri research technolog joint project fabel contract project partner fabel german nation research center comput scienc sankt consult technic htwk karlsruh refer kati similar guidanc topic reason select paper european workshop reason stefan michael volum lectur note artifici kati formal reason workshop pp fabel report jaim analog theori reconstruct problem solv machin artifici intellig jaim tom volum morgan palo jaim craig steven integr architectur plan learn architectur kurt technic report gentner kenneth model cognit scienc pp digit build extens comput support manag futur intern confer architectur design pp kati oliv gerhard knowledg acquisit design support european confer cognit scienc janet morgan cooper machin learn vol michalski pp morgan steven induct logic academ gordon note induct machin intellig meltzer american borner
IR/500 5 copyright ieee publish hawaii intern confer system januari hawaii augment recommend system interfac offic practic christoph thompson xerox research centr europ franc abstract autom collabor filter system collect evalu user qualiti relev store inform scientif movi number user give evalu system produc statist high qualiti predict item interest promot creation rich evalu essenti import issu remain resolv work present issu collect set design principl improv autom collect final present principl implement real usag set system allevi inform overload overload term increasingli apt descript current experi deal inform commun channel publish mean gener myriad possibl interact work leisur activ gener difficulti make inform choic relev good qualiti inform answer user partli autom techniqu base model interest user techniqu model user isol inform space context evalu relev document work field inform retriev inform filter broad categori inform retriev inform filter effect identifi document content match interest pattern effect term evalu qualiti piec inform qualiti evalu perform human social process support share knowledg referenc broad categori system techniqu aim exploit process collabor filter system filter inform basi opinion user base explicit action user document annot user dave chri case system categori activ collabor filter note commun user larg distribut organ internet reli fact person interest address statist techniqu develop identifi group share opinion tast domain system reli activ user specif read attempt autom process filter relev inform basi numer express user prefer system techniqu call autom collabor filter autom collabor filter activ collabor filter approach base assumpt user futur algorithm oper find user rate number item common rate comput correl user algorithm figur grouplen system describ pearson algorithm comput correl repres rate user item repres averag xs rate algorithm valu rang tend item rate tend notic item account comput rate xy cov xy figur pearson algorithm correl obtain predict score item base rate peopl item provid correl figur show part algorithm predict score item base rate user user correl algorithm weight averag rate item weight correl user score produc typic algorithm modifi includ correl threshold decid posit correl user appli algorithm review pred figur predict score document base user rate approach present base identif neighbor user tend share opinion suffer problem summar problem sparsiti problem earli problem refer paradox autom collabor filter system benefici wait neighbor produc evalu item basic earli problem point person produc meta inform good bad inform item relat earli sparsiti usenet user cover tini percentag document sparsiti motiv peopl read inform hand sparsiti pose comput challeng harder find neighbor harder recommend document peopl rate autom collabor filter base statist techniqu reli matrix order produc good predict order overcom problem approach obtain set document rate obtain bigger set rate comment call algorithm approach ergonom approach design algorithm approach algorithm approach aim result set user idea smarter complex wai produc evalu list approach partit approach base inform space divid domain user interest domain matrix document confid measur predict approach knowledg pump grouplen system hybrid system hybrid collabor approach base neighbor identif complement analysi approach leverag fact content analysi perform independ number rate fab system neighbor user creat basi linguist profil deriv feedback document agent grouplen simpl linguist agent learn user prefer respect languag accuraci number repli messag grouplen context usenet design ergonom approach ergonom approach aim support low cost provis rate comment make recommend activ directli benefici user approach base provis recommend consid common good maintain ergonom approach allevi common good problem present perceiv benefit act recommend consid primarili altruist activ place publish peopl chang perspect put person aspect altruist strong impact number recommend made review exist approach direct rank search relev feedback inform retriev elabor feedback user past inform item produc automat score incom inform provis dynam score mechan deriv recommend rank addit benefit make recommend soap system environ search function integr recommend function market model author stress recommend system effect maintain market mechan knowledg pump system simpl rule put visit recommend visitor pai redistribut share item review person storag inform obviou person benefit link recommend person activ bookmark annot implement knowledg pump system recommend built top bookmark facil integr work practic idea minim cost provid recommend integr function practic inform consum knowledg pump project work usabl issu work place wai approach relat integr practic possibl emb recommend function repositori inform act store retriev inform item complement low cost possibl rank comment seamless integr recommend function select point tool part document base cost provid recommend user possibl rank recommend provid evalu enrich discuss recommend possibl act print base evalu read annot made write document sheet paper inform item repres electron document inform wai everydai print record music make possibl recommend annot user access system action proper context paper base interfac collabor filter system review algorithm ergonom combin provid real advantag concentr ergonom approach overcom problem autom collabor filter system usag paper base user interfac paper usag offic environ hype import document print lifetim due afford paper provid document read screen includ easier annot process share document colleagu mean print room share group point inform embodi print pass printer document organ mean cover owner document print usual inform time stamp cover sheet case recycl process print memori print log gener printer server administr account observ aspect print print cover sheet print document enabl servic knowledg share servic manag share knowledg embodi print document person commun level relev observ print process print document make implicit declar person print declar read document result reason probabl document peopl group group print awar opinion cover sheet aspect cover sheet lot free space conveni output space cover sheet creat document relationship identifi owner print document usag aspect file print document time action lead problem retriev document smart recommend interfac basi observ print process construct paper user interfac knowledg pump system document cover print collect provid contextu recommend interfac scan document storag retriev system function current smart split document token time document print smart activ produc figur primari function provid access document web encod document url print store subsequ retriev document document manag system figur smart public recommend note cover sheet provid mean collect contextu recommend document print read document coupl leverag observ print document wider interest user make recommend judgment form recommend system provid larg classif schema submit cover sheet augment user interfac applic specif addit command directli cover complet list commun interest devic person note altern provis public review store recommend person note evalu put read document contextu list review kp user print request activ search recommend system discov user system evalu document case list review print back cover sheet rate comment user figur figur review perceiv earlier recommend connect provis person function smart document token storag person note function person util independ publish note comment commun possibl store note sheet paper document fit observ paper offic environ final mechan kp appli submit review smart integr work point view integr recommend activ work smart support provis recommend print moment fit observ read activ carri paper print document avail read activ meant support note access document implement paper base user interfac produc recommend system awar requir main abil recogn document abil queri recommend system review equip instruct automat process abil trigger comput step user scan annot discuss implement main grai figur document recognit creation figur system architectur document print job consist postscript document printer produc system document case url sake chosen rule document content analysi make assumpt url header document extract postscript document approach satisfactori work major web browser platform queri recommend system equip permit process discuss solut base technolog environ enabl automat process paper element form descript process softwar element xerox toolkit project advantag xml base languag layout form addit standard element place format text imag tag insert activ feedback element form feedback element singl set checkbox scan rectangl content captur bitmap store process interact form descript action perform form scan exampl action regist feedback store comment approach flexibl account futur user prefer aspect content tabl figur show descript extra tag build paper form displai set checkbox user make rate numer scale paramet item context rate command execut checkbox number checkbox displai numer valu checkbox specifi clip area return applic paramet item comment size clip clip area locat creat checkbox front tag text associ action checkbox paramet command execut checkbox select figur descript languag tag scan annot binari inform store inform form addit inform process record user ident concern url ink todai printer print requir data standard method technolog store binari inform paper barcod xerox advantag higher densiti form hidden imag figur form grai rectangular area bottom part black squar bottom upper left capit posit mark equip materi function call recommend system paper present approach overcom identifi issu autom collabor filter concentr paper interfac integr collabor filter base inform system real practic improv qualiti result current statu implement earli draw deploi smart interfac real set intend polish interfac strongli test system real usag import integr dai work small problem felt disrupt permit user accept price face potenti problem limit space establish strategi filter inform piec paper wont run power smart constitut client part perspect sort client upgrad easili server softwar correctli handl smart produc put sever reliabl constraint requir backward compat intend conduct field studi month refer system evalu comput commun acm pp yoav shoham collabor commun pp support flow knowledg network inform technolog knowledg springer recommend system work resnick bergstrom riedl open architectur collabor filter octob chapel filter agent improv predict qualiti grouplen research collabor filter cscw novemb acm pp user interfac approach commun workshop design commun design commun nov paper electron paper user acm acm pp analyt resourc design ga social agent provid peopl acm pp xerox concept knowledg manag support system document
HCI/501 4 collabor schedul learn predict abstract transfer desktop interfac world larg goal ubiquit comput ubiquit comput strive world larg individu larg part improv commun individu paper describ system enabl collabor peopl creat model daili schedul individu perform predict base model gp data learn distinguish locat track time locat visit markov model predict locat visit base previou behavior introduct technolog knowledg user user reason action user model step answer question defin user model acquisit exploit consult model human user system comput agent constitut stochast process user system requir collect larg amount data constantli collect relev data data continu adapt refin model privaci technolog account fulli ubiquit comput infrastructur year reli wearabl sensor full rang data collect abil wearabl technolog daniel thad starner colleg comput georgia institut technolog ga usa data store upload user opportun remov data integr model chosen wearabl global posit system receiv attach data logger devic satisfi constraint privaci data easili interpret hardwar small lightweight gp advantag global absenc signal provid discuss gp piec inform latitud longitud satellit transmit date receiv calcul altitud head posit inform suffici perform simpl user model fairli high accuraci piec data idea user current locat potenti applic individu benefit note system schmandt agent learn locat import user valuabl list remind specif physic locat agent predict locat user visit remind present user time fashion remind user shop list groceri store remind user pass store frustrat distract remind user mile enter product agent determin goal suggest altern rout base current traffic condit mobil predict agent travel system issu due lack radio shadow due power wireless network inaccess wearabl comput lack hidden user cach user wearabl add messag outgo queue wait network send messag behavior agent predict user rang wireless network alert user travel connect urgent internet agent delai transmiss network connect energi preciou resourc mobil amount energi transmit messag fourth power distanc situat cost transmit messag vari time dai type servic predict agent optim transmiss base prior knowledg user move dai collabor benefit user model benefit realiz user model share replic relev model queri model time inform deleg coordin user model central servic assum case call servic servic access model straightforward servic sam offer determin potenti meet time set individu access model locat typic sam provid pass common problem sam encourag serendipit meet sam predict friend travel offic lunch time don suggest call don make arrang meet sam suggest complic interact immedi appar cooper group scenario illustr point alic bob weekli tuesdai meet rest research group subject turn encrypt alic bring bob book cryptographi alic realiz bob meet book sooner sam discov alic eat dinner bob fridai sam ev deliv book alic ev alic bring book dinner ev deliv book bob spend weekend read prepar discuss alic tuesdai seri interact allud complic mechan ev directli benefit servic alic bob build friend ev unknown alic bob offer servic gener sam exchang form reward reward point exchang similar favor pool particip time idea concept basi scienc fiction book distract bruce corpor world web site develop similar trust system evalu post softwar develop previou work locat predict system interest cellular network commun recent year unit state govern locat peopl place call cell contextu servic discuss da describ track system call deliveri transit wireless cell input markov model user move stai cell long period model updat network fewer cell successfulli deliv call number cellular subscrib imper manag admiss telephon cell site yu leung develop system mobil predict guess cell user visit reserv resourc problem identifi locat wolf al rest time mark start end point schmandt model locat base loss gp signal deliv inform order begin investig kind serendipit agent describ construct program model travel read file gp coordin output list list trip probabl destin queri agent user home place user stop groceri store home answer question user lead serendipit user alert meet data collect manipul data collect perform standard portabl gp receiv record gp data receiv move mile hour gp satellit data collect user period travel atlanta area discern home work area figur higher densiti dot locat strang throw data log data user travel greater data larg interest locat user spend point amount time previou log point point long wait highwai due accid occurr record probabl count destin low user stop place work point high rel occurr rate probabl consid destin correspondingli high figur point atlanta determin rule found minut good amount stop time gp coordin place interest gp measur physic locat vari record log gp point locat user stop minut point dai variant cluster algorithm basic idea point half mile point radiu point found center process repeat continu stop chang longer point radiu remov process repeat point remain left collect cluster point origin radiu fairli inform limit gp gener scale build park process data time find miss time transit rel frequenc probabl tabl order probabl data record accomplish cluster run cluster algorithm time time radiu chang small result plot graph knee signifi radiu number cluster begin converg number point knee radiu form effect multipl scale walk colleg automobil citi cluster cluster locat origin stream gp data analyz cluster user move markov model gener node repres probabl transit calcul probabl calcul order probabl visit locat previou locat previou locat order order predict base tabl futur work gain result improv perform problem lack data month worth data locat implement week trip work mondai compar trip church sundai find cluster multipl perform predict scale implement schedul learn multipl movement build colleg campu predict easili movement area citi exampl involv combin record data user unabl experi multipl data set plan track user perform experi collabor refer da approach track mobil user pc network mobil comput page chang energi conserv rout wireless network infocom page user model author phd rob chri schmandt inform deliveri page jean wolf jean randal william elimin travel experi deriv trip gp travel data yu victor cm leung predict call admiss control bandwidth reserv wireless cellular network ieee intern confer
IR/502 5 pair model evalu arab ocr product gregori center autom research maryland colleg md abstract perform optic charact recognit system crucial monitor technic predict ocr provid scientif explan system behavior identifi open problem research past compar perform ocr assum accuraci achiev individu document dataset independ paper show accuraci report dataset correl invok statist techniqu pair model compar accuraci recognit system theoret show method tighter confid interv method ocr comput vision literatur visual call accuraci scatter provid visual summari perform result method summar accuraci comparison entir corpu simultan research visual compar perform individu document imag report accuraci speed perform function scan resolut contrari perform system degrad imag resolut averag time ocr document linearli function suddenli constant behavior ocr algorithm sampl imag resolut higher standard resolut product compar arab automat page reader saic arab dataset evalu statist visual method present articl gener compar accuraci recognit ocr system pair confid perform saic dataset introduct perform evalu ocr system crucial typic ocr part bigger inform retriev system machin translat system perform depend perform individu perform system function ocr recognit rate knowledg perform function ocr accuraci rate predict minimum recognit rate requir achiev system perform rate order monitor progress ocr quantit measur period quantit perform evalu ocr system assess progress field scientif understand contribut accuraci improv specif submodul explain ocr system achiev accuraci determin area impact improv entir system articl report evalu result commonli arab ocr automat reader version arab version start discuss provid background ocr evalu literatur section metric quantifi error discuss section section provid statist theori pair compar perform arab ocr system section describ protocol conduct evalu section discuss result perform evalu background ocr evalu broadli categor blackbox evalu evalu blackbox evalu entir ocr system treat unit perform perform system evalu corpu scan document imag select text zone delin text correct text string kei human process delin zone kei text prone error final ocr algorithm run text zone result compar kei text string match routin theori corpu repres sampl popul imag algorithm design factor time cost forc limit size dataset feasibl process adopt ocr evalu program uw evalu process evalu corpu consist english annual document depart busi legal spanish german busi letter uw dataset consist english technic journal perform individu submodul ocr system submodul skew detect page zone text extract zone segment evalu attempt earlier vincent al evalu evalu access input output submodul ocr system segment access coordin zone produc ocr crucial blackbox evalu requir access intermedi provid perform analysi submodul level blackbox evalu account error due segment research advoc synthet gener data ocr evalu methodolog al document typeset standard typeset system word bitmap imag document automat gener bitmap degrad parametr degrad model degrad level control vari paramet model methodolog advantag labori process manual type data complet avoid manual scan process independ languag limit typeset typeset softwar effect page font size type ocr accuraci studi conduct control experi variant methodolog haralick print ideal scan transform ideal match real imag process research gener geometr level bound essenti build classifi conduct blackbox evalu arab ocr product section describ metric evalu ocr section describ statist techniqu compar measur metric perform evalu metric good evalu ocr section describ metric import give advantag disadvantag repres number symbol number correctli recogn number symbol number symbol number symbol replac number symbol number symbol correctli recogn page normal total number symbol accuraci call recal inform retriev literatur notic number reflect number extran symbol introduc number symbol correctli recogn page normal number symbol text system accuraci higher system higher gener fewer extran symbol number symbol insert normal number symbol number symbol delet normal number symbol number symbol substitut normal number symbol metric comput dod error base match routin articl report metric word process comput metric word charact level metric predict improv inform retriev system base word metric judg improv human readabl manual machin translat accept text input statist comparison sampl mean comput metric ocr algorithm result statist section describ theori statist comparison measur problem encount compar ocr result algorithm product compar mean obtain run algorithm dataset underli accuraci popul typic distribut gaussian make assumpt justifi assum dataset larg larg current discuss mean greater statist techniqu basic assumpt compar accuraci describ techniqu refer arnold detail larg sampl infer mean xn set ocr accuraci number obtain process document imag underli distribut accuraci varianc oe sampl varianc estim popul sampl oe result hold larg sampl distribut asymptot close gaussian fact due central limit theorem construct confid interv estim error function jz ff level infer mean independ sampl xm sampl ocr accuraci number obtain process document imag yn independ sampl accuraci sampl varianc sampl varianc underli popul varianc oe popul varianc interest draw differ mean ffi estim ffi differ sampl ffi oe previou confid interv estim differ mean ffi ffi ffi pair model infer differ mean correl pair ocr accuraci valu oe correl occur accuraci document imag result previou subsect requir sampl independ result section proce construct variabl sampl sampl varianc interest draw infer ffi estim ffi ffi oe oe confid interv estim differ mean ffi ffi ffi discuss previou section expect valu pair estim equal differ popul mean differ pair estim varianc estim varianc equal pair estim varianc smaller uncertainti lower sampl size pair estim correl inform reduc uncertain estim protocol section describ setup select saic dataset corpu perform evalu corpu binari imag arab text manual type correct arab ascii string ocr system ideal produc run ocr product dataset comput accuraci rate ocr defin percentag charact correctli compar output arab ocr product automat reader pro product run pentium pc run microsoft window dod error counter count error softwar run sun ultra run solari arab browser view text order reduc manual script written autom process depart provid dataset origin imag remov imag leav imag text encod format origin sampl util convert imag dataset zone singl column text subimag imag shown figur imag clean scan magazin comput gener document result evalu comput page accuraci defin averag page accuraci rate achiev accuraci achiev accuraci confid interv accuraci absolut page accuraci averag higher confid interv differ mean higher higher tabl higher histogram accuraci product shown figur empir distribut accuraci gaussian accuraci distribut tail scatter plot accuraci pair shown figur point plot correspond document imag dataset correspond accuraci imag correspond accuraci point diagon repres document imag product achiev similar accuraci point diagon repres imag accuraci differ lot imag perform scatter plot shown figur algorithm perform figur averag time ocr imag plot time resolut algorithm sampl imag standard resolut ocr process numer subimag dataset ocr output shown figur summari shown pair model approach perform comparison rise tighter confid interv method comput differ ocr accuraci methodolog evalu arab ocr automat reader shown saic dataset higher accuraci averag page accuraci rate averag page accuraci higher higher error function resolut note accuraci drop imag resolut averag time ocr page imag resolut algorithm sampl imag standard resolut prior ocr process scatter plot visual page accuraci visual summar techniqu algorithm develop easili detect analyz outlier acknowledg depart defenc provid ocr error count softwar research support part armi research lab depart refer annual test ocr tech rep inform scienc research la evalu ocr proc annual symp document analysi inform pp april complet environ benchmark document page pattern recognit pp septemb page segment proc ieee conf comput vision pattern june local global document degrad int journal imag system technolog document degrad model methodolog degrad model valid phd imag defect structur document imag automat methodolog gener charact scan ieee transact pattern analysi machin intellig decemb multilingu ocr proc spie conf document recognit retriev mathemat davidson ocr train test data proc symp document imag understand april accuraci accuraci figur plot distribut page accuraci imag plot distribut page accuraci notic accuraci distribut gaussian accuraci scatter plot accuraci scatter plot accuraci scatter plot accuraci scatter plot figur scatter plot ocr accuraci resolut data point repres specif imag data point repres data point repres accuraci point diagon repres document imag product achiev similar accuraci point product perform point side product number imag resolut ocr accuraci resolut ocr figur accuraci function document imag resolut accuraci recal ir number correctli recogn symbol normal number symbol number number correctli recogn symbol normal number symbol ocr output notic higher higher confid interv shown tabl differ mean statist resolut error ocr error figur error delet substitut error normal number function document imag resolut resolut ocr time figur averag time ocr imag time mhz intel pentium processor ram cach notic automat reader amount time process imag automat reader sampl imag standard resolut ocr process figur subimag perform imag achiev accuraci achiev accuraci subimag origin imag shown output shown output shown oe oe oe oe figur subimag perform poorli imag achiev accuraci achiev output figur subimag perform imag achiev accuraci achiev accuraci output oe oe figur subimag perform imag achiev accuraci achiev accuraci output figur subimag perform imag achiev accuraci achiev accuraci output figur subimag perform imag achiev accuraci achiev accuraci output tabl total error pair differ number report pair differ confid interv higher total error higher insert error interv estim techniqu pair interv smaller point note gener text imag manual pair differ report imag product produc accuraci plot figur report file product gener result number file product crash larg substitut differ delet differ pair pair insert differ error differ pair pair tabl accuraci differ function resolut higher accuraci higher accuraci pair pair tabl time differ charact pair tabl number crash file requir human file list crash messag pop user manual zone imag list crash assum ocr system work complet automat mode
ML/503 6 genet solut problem small disjunct deborah alex freita universidad postgradu program appli comput scienc pr brazil universidad comput scienc dept av pr brazil abstract small disjunct rule cover small number exampl rule contribut predict accuraci problem small disjunct cover set small disjunct cover larg number exampl paper solut problem discov accur rule base genet algorithm basic idea method hybrid tree genet algorithm approach classif exampl belong larg disjunct classifi rule produc exampl belong small disjunct classifi genet design discov rule introduct context classif task data discov knowledg express set predict rule typic discov rule disjunct normal rule repres disjunct rule condit repres conjunct small disjunct defin rule cover small number train exampl gener rule induct algorithm bia favor discoveri larg small disjunct prefer due belief captur gener special train valid test set glanc small disjunct includ discov rule tend error prone deeper studi issu small disjunct reveal fact interest context data disjunct cover small number set small disjunct cover larg number exampl instanc report realworld applic small disjunct cover roughli train exampl rule induct algorithm ignor small disjunct discov larg classif accuraci significantli degrad small disjunct cover exampl repres rare case applic constitut interest concept discov bear mind goal data mine discov rule tend interest user paper hybrid algorithm method rule discoveri cope problem small disjunct basic idea exampl belong larg disjunct classifi rule produc exampl belong small disjunct classif classifi rule produc genet algorithm hybrid method hybrid method rule discoveri combin tree genet algorithm algorithm bia gener suit larg small disjunct genet algorithm robust algorithm tend cope attribut interact easili tailor cope small larg attribut interact method discov rule train phase phase run algorithm induc tree leav transform rule set rule rule consid small disjunct depend coverag number exampl cover smaller equal threshold phase consist genet algorithm discov rule cover exampl belong small disjunct develop genet algorithm phase individu repres rule run ga discov singl rule individu predict class exampl belong small disjunct run ga number small disjunct number class predict small run discov rule predict class genom individu consist conjunct condit rule condit pair consequ specifi predict repres genom fix ga individu rule consequ run rule variabl number rule condit ga minimum number condit maximum number depend small repres rule genom ga genom individu consist total number predictor attribut dataset number ancestor node tree leaf node identifi small disjunct question genom ga individu attribut label ancestor leaf node defin small disjunct structur genom individu illustr figur gene repres rule condit form op ij subscript identifi rule ij jth domain op oper compat attribut gene consist identif predictor identif oper op categor op continu op identif set attribut valu ik attribut singl attribut ij attribut continu call activ bit condit present rule op op ij op nj figur structur genom individu evalu qualiti individu ga fit fit tn fp stand number true true neg posit variabl evalu perform classif rule tournament tournament size standard crossov crossov probabl mutat probabl elit elitist factor individu gener pass unalt gener addit standard genet develop oper design simplifi candid rule basic idea call remov condit rule make shorter oper appli individu individu form unlik simpl oper oper elabor procedur base inform theori regard incorpor heurist ga rule discoveri heurist question favor remov rule condit low inform rule condit high inform gain detail run ga exampl test set classifi test push tree reach leaf node node larg classifi tree algorithm classifi rule discov ga small disjunct rule cover test classifi default rule experi strategi defin default global default rule predict major class local default rule predict major class exampl belong current small disjunct comput result evalu ga public domain data set uci data set repositori adult data set dataset attribut continu class experi predefin data set train test exampl exampl exampl miss remov data set number exampl slightli reduc exampl train test data set experi wave data set data set attribut valu class data set run procedur experi leaf consid small disjunct number exampl belong leaf smaller equal fix size experi valu paramet report result compar perform hybrid default paramet ga run popul ga run gener evalu variant hybrid global local default rule result adult wave data set shown tabl result refer accuraci rate test set column tabl size threshold defin small disjunct label report result produc column report accuraci rate test set achiev separ exampl classifi rule rule column report accuraci rate test achiev classifi exampl note figur column constant result refer case test exampl classifi definit small disjunct tabl result compar hybrid adult data set accuraci rate accuraci rate global default rule accuraci rate ga local default rule disjunct size larg disjunct small disjunct larg disjunct small disjunct larg disjunct small disjunct tabl result compar hybrid wave data set accuraci rate accuraci rate global default rule accuraci rate ga local default rule disjunct size larg disjunct small disjunct larg disjunct small disjunct larg disjunct small disjunct label report result produc hybrid method variant global default rule note figur column figur column hybrid method rule classifi exampl belong larg disjunct includ redund column tabl sake complet column report accuraci rate test set rule discov ga column report accuraci rate test achiev hybrid classifi exampl label refer result variant local default rule mean column analog explain column tabl differ perform variant hybrid variant achiev predict accuraci compar column column tabl note distinct pattern result case disjunct consid small cover row tabl case accuraci rate rule produc ga slightli inferior perform rule produc adult data set superior wave data set small differ perform refer rule small impact accuraci compar column column tabl pictur emerg disjunct consid small cover fourth row tabl perform rule produc ga perform rule produc data set compar column column fourth row tabl small disjunct rule accuraci rate rule accuraci rate improv accuraci small disjunct rule impact accuraci compar column column fourth row tabl explan result disjunct consid small cover train exampl ga run exampl estim rule qualiti comput fit function ga manag disjunct consid small cover number train exampl ga significantli higher low estim rule qualiti comput fit function significantli ga robust abil cope attribut interact lead discoveri rule accur rule discov result prove rule discov ga superior rule discov recal test exampl belong small disjunct classifi rule default rule question kind rule good result report answer question measur separ rel frequenc kind rule default classif test exampl belong small disjunct found rule classifi test exampl belong small disjunct default rule depend definit small disjunct paramet rel frequenc rule vari adult data set wave data set confid small disjunct rule discov ga good job classifi test exampl belong small disjunct evid measur separ predict accuraci rule default rule classif test exampl belong small disjunct case rule rule higher predict accuraci default rule expect credit good perform classif small disjunct assign default rule kind evid case case hybrid beat tree turn comput effici run ga train set exampl recal order discov small disjunct rule run ga number class number small disjunct total process time ga run vari number small depend data set definit small disjunct process time run ga hour largest data largest number small experi perform pentium ii hour reason process time small price pai predict accuraci discov rule process time ga run reduc parallel process techniqu method greatli facilit exploit parallel discoveri small disjunct ga run complet independ access small data local memori simpl processor node futur research problem discov good rule rule due natur small disjunct data mine system discov good rule sacrif good discov rule solut problem hybrid exampl belong larg disjunct classifi rule produc algorithm exampl belong small disjunct classifi rule produc genet algorithm order realiz hybrid method algorithm develop genet algorithm tailor discoveri rule hybrid method evalu data set found perform ga hybrid method depend significantli definit small disjunct result show differ accuraci rate rule discov rule discov method disjunct consid small cover accuraci rate rule discov method higher rule discov disjunct consid small cover exampl disadvantag hybrid method train set exampl hybrid method order order extra process time small price pai predict accuraci discov rule import direct futur research evalu perform hybrid method kind definit small rel size disjunct absolut consid research direct compar result method rule discov ga case aspect design ga modifi refer dr aa hybrid algorithm cope problem small disjunct data mine proc genet evolutionari comput conf la usa juli ja element inform theori john small disjunct learn error local loop telephon proc intern confer machin aa evolutionari algorithm chapter forthcom handbook data mine knowledg discoveri oxford aa sh mine larg parallel process kluwer construct assess classif rule john son le bw concept learn problem small proc ijcai genet algorithm data structur evolut program ed ma estim concept difficulti cross entropi ma knowledg discoveri data iee aa discov interest predict rule genet algorithm proc congress evolutionari comput jm scale induct learn massiv parallel machin learn apr jr program machin morgan kaufmann learn hard concept construct framework comput intellig
AI/504 2 declar signatur id de renn campu universitair de beaulieu renn franc abstract exist detect signatur close detect algorithm cumbersom detail recent work declar signatur languag level abstract write signatur languag oper support show transform declar signatur oper process point technic detail consid care perform translat systemat handl signatur specif languag declar semant produc rule exist id base construct introduct formal algorithm signatur order detect detect system briefli cite diagram stat color petri net rule expert system emerald languag articl strongli dedic underli search algorithm signatur clutter oper detail make hard maintain recent approach signatur declar defin lin al defin gerard defin michel languag dedic describ attack signatur aim languag detect describ relat event audit trail languag ignor function provid offer oper support articl firstli declar signatur languag provid combin function complet union offer declar system show produc oper detect rule declar signatur partial event correl logic condit verif alert trigger function formal defin declar semant rigor describ sequenc event audit trail consid occurr signatur semant extend earlier work chakravarthi context activ order implement signatur produc rule id declar signatur defin algorithm build graph structur signatur graph shortli repres evolut detect process rule target id automat gener illustr exampl involv expert system emerald siggraph diagram close stat systemat exhibit number technic problem combin logic partial order negat problem solv main contribut articl exhibit chain transform declar signatur specif oper rule maintain signatur concentr essenti aspect signatur captur declar semant oper aspect automat address remaind paper structur section present illustr complet specif signatur section declar semant section detail algorithm produc rule id relat work discuss section paper conclud section overview declar signatur specif languag section present syntax inform semant declar signatur specif languag introduc basic element call show combin filter build signatur complet specif formal semant sec basic filter filter signatur defin constraint event figur show abstract syntax filter constraint specifi relat event field term term set constant valu variabl event satisfi event match filter constraint oper equal inequ match regular express match list extend declar signatur id constraint constraint op erm op erm alu abstract syntax filter signatur signatur arg bodi bodi bodi bodi bodi extern red bodi trigger extern roc bodi extern red red erm signatur erm abstract syntax signatur signatur specif figur show abstract syntax signatur signatur declar signatur statement similar function declar tradit program languag signatur built composit shown bodi bodi sequenc instanc found instanc found instanc found remain part trail choic instanc found instanc instanc found interleav instanc found instanc independ found trail describ partial order event instanc negat instanc found instanc exist instanc event instanc base case induct definit signatur filter instanc signatur found event match filter sec statement call extern logic predic instanc signatur found instanc found predic hold trigger statement call extern report alert instanc signatur found express trigger compon mean alert attack complet signatur section present signatur detect attack exploit buffer overflow program distribut solari environ vulner report cert advisori graphic front end administr instal softwar packag command solari packag file step overflow creat file directori put overflow string step execut instal fake packag locat figur present signatur exploit audit trail declar constant valu event identifi defin filter event file creation creat file match paramet unifi paramet file real user id unifi paramet userid filter event program execut execut program unifi paramet real user id unifi paramet userid filter file creat arbitrari oper connect filter user variabl paramet filter specifi file creat user file bound variabl add statement extern predic verifi file prefix file locat creation file execut variabl user specifi oper perform user creat file system call creat file solari system ad miss identifi present difficulti attack perform user signatur variant shown declar signatur id extern predic extern procedur call declar constant const creat const open mode const exec const filter file creation path path file filter program execut path userid signatur exploit trigger signatur exploit trigger statement specifi extern procedur report alert detail semant section present declar semant signatur formal present call filter event match semant induct defin syntact construct previou section event match event structur field set event field domain valu field definit event set pair note field event definit set variabl filter set constraint fc form event binari relat variabl set constant note power set definit set variabl fv vn substitut oe total function definit event satisfi constraint substitut oe iff definit event satisfi filter substitut note oe constraint satisfi match filter substitut instanc signatur definit trail total order sequenc event element trail note call event import distinguish posit event time inform signatur express relat event semant signatur account posit event constraint time inform declar statement definit signatur oe substitut variabl instanc signatur trail posit ff fi substitut mean ff fi ffl figur induct defin ffl relat syntact construct import note bound ff fi posit event instanc filter definit ensur bound coincid event occur posit match filter substitut oe definit ensur instanc occur end posit part sequenc strictli lower start posit part declar signatur id definit ensur part choic occur definit ensur part interleav occur start posit end instanc minimum start posit end part definit ensur instanc instanc occur start end posit instanc bound search interv strict ff fi lower bound strict oper point search begin instanc detect upper bound strict event satisfi filter occurr alarm definit ensur instanc occur hold note result appli substitut oe variabl predic red trigger definit ensur instanc occur statement produc side effect interf detect process produc debug transform signatur rule previou section detail declar semant intend mean signatur introduc oper motiv fact search perform transform declar signatur oper automat compil signatur exist id formal focu system section algorithm achiev task algorithm intermedi diagram call siggraph present compon show oper rule gener structur remaind section detail main step siggraph construct siggraph definit siggraph kind finit automaton node correspond state process search audit trail signatur arc orient label filter outgo transit node correspond event id react state transit label predic declar statement mean transit made event satisfi constraint filter predic procedur attach call id transit perform ff fi ffl filter iff ff fi ff oe ff fi ffl iff ff ffl fi ffl ff fi ff fi ffl iff ff fi ffl ff fi ffl ff fi ffl iff ffl ffl ff fi ff fi ffl iff ff fi ffl ff fi ff fi ff fi ffl iff ff fi ffl ff fi ffl trigger iff ff fi ffl semant signatur signatur write set variabl set predic statement set procedur trigger statement standard notat power set set give formal definit siggraph fig illustr definit excerpt graph definit signatur defin set ae init initi state init set final ae transit ae set ae declar signatur id node identifi identifi id node variabl assign reach state node label flag state recurr state recurr id readi transit fig node node choic point arrow start determin node recurr detail sec distinct recurr recurr state made consum rule exist recurr state siggraph compar duplic token petri net final state siggraph final state due exist temporari final state construct defin subset final state label flag flag discrimin temporari final state mean detail sec figur final state transit transit label set red predic declar statement red set rig procedur declar trigger statement rig predic red hold perform procedur rig call transit made label discrimin transit type graph arrow correspond progress discoveri instanc arrow correspond backtrack previou state graph instanc neg part found figur transit node correspond detect link creation file read process bound variabl node figur transit cancel search process termin gener rule siggraph section siggraph gener rule id exampl languag gener russel rule russel languag system overview languag found complet definit languag semant russel program collect rule rule consist statement rule formal paramet handl set instanc rule formal paramet substitut effect node state transit label transit transit state event id event pid event obj filter node rec event pid event id filter event pid event id event obj filter node node rec excerpt siggraph repres signatur rule begin begin trigger trigger begin trigger trigger trigger true trigger fi russel rule gener node fig declar signatur id call activ time event gener process activ rule event satisfi execut part rule instruct modifi set activ rule process event node graph transform russel rule figur show rule node fig ar set node number paramet rule rule outgo transit node correspond statement rule condit part statement obtain conjunct constraint filter bound variabl constant predic red bound variabl replac paramet rule unbound variabl replac audit field unifi part rule variabl compar paramet variabl predic pred evalu action part statement obtain ad set activ rule event instanc rule successor node transit trigger statement call procedur rig node label event rule add set activ rule event gener rule expert system toolset expert system emerald detect system descript capabl found program consist definit fact set infer rule fact infer rule part guard test exist fact satisfi logic part action fact base modifi call extern function figur show rule node fig fact type creat node graph achiev statement valu store fact correspond bound variabl node infer rule creat transit graph guard rule test exist fact origin transit fig rule test exist fact type rule test event fact satisfi condit condit statement gener condit similar gener russel bound variabl substitut valu store fact event satisfi fact successor node creat rule fact creat procedur rig set call call declar fact type node definit rule transit eid eid eid fact rule gener node fig node label fact state remov fact transit rule correspond fact remov node label fact remov shown build core structur siggraph back algorithm build step construct graph consist creat core structur set node transit relat defin function build structur graph signatur induct defin syntact construct present definit function illustr fig filter repres letter constraint filter definit filter graph filter belong mark ar rig node empti set node mark default possibl modifi transit node label filter mark graph depict fig filter side choic obtain merg init state merg final state graph oper illustr fig graph side declar signatur id interleav obtain perform cartesian product graph init state final state oper illustr fig graph sequenc init state init state final state final state init state merg final state oper illustr top fig graph side negat transform transform id parallel instanc posit part instanc neg part instanc neg part search cancel transform split step cartesian product comput state result product final state final state result mark result mark node mark instanc neg part signatur instanc posit found label state arbitrari mean recognit prioriti cancel consist semant fig step interest instanc event instanc fig transit init state present suppress make state suppress turn fig oper remov transit label lead suppress node transit attach step transit final state suppress previou unreach state suppress fig oper lead suppress node transit step transit final state mark replac transit init final state mark merg uniqu final state mark obtain transit predic pred red refin trigger trigger obtain transit final state procedur proc rig static analysi variabl bind siggraph section detail comput ar set node graph comput set suppress transit ad init state cartesian product graph step transit final state step step step transit state replac transit init state final state merg uniqu cartesian product graph init init init init init init init init init build core structur graph specif declar signatur id time variabl event field variabl gener boolean test store variabl event field due disjunct path lead node graph filter attach transit instanti set bound variabl node differ path led node algorithm section perform task comput ar set node time discov ar set path led duplic node ar set uniqu path lead node transit connect node node defin set equal constraint tg transit state bound variabl destin state bound addit unifi match filter attach transit figur show execut algorithm detail section filter abstract variabl equal constraint fig rom set relat node transit fg yg yg definit node defin relat rn transit end connect node rn fig node transit class node algorithm algorithm fig relat rn node creat number transit redirect node algorithm base loop order ar set comput order order induc depend definit rom calculu ar depend depend ar set predecessor node depend ar set predecessor node algorithm graph order exist note algorithm transit backward search set instanti variabl grow init iter initi graph init init iter iter init comput ar set siggraph fig iter node duplic node fxg transit transit similar node split node duplic path init lead set bound variabl node duplic incom transit node variabl instanti account siggraph ar set comput algorithm sec step construct siggraph set permit evalu constraint due lack variabl refin placement predic red set find recurr node declar signatur id foreach node set class rn foreach creat node incom transit outgo transit transit end foreach delet node incom outgo transit end foreach algorithm comput set siggraph constraint signatur event constant signatur event variabl constraint evalu instanc situat event occur event problem avoid rewrit initi express correct express natur declar semant result ar set automat constraint delai evalu transit constraint evalu belong ar origin constraint transform variabl variabl ad ar set node transit predic ad red set transit transit transform siggraph ensur predic ad red set evalu locat refin placement red predic item section refin placement predic figur show signatur combin negat statement rec rec rec init node transit set filter set node identifi flag init siggraph build core structur comput set evalu siggraph find rec state suppress predic redund transit transit final state illustr step siggraph construct declar signatur id graph figur result step construct siggraph core structur comput ar node ar set transit repres filter red set rig set note construct core predic attach transit scope statement graph fig remark respect predic label evalu transit bound predic evalu true transit evalu predic transit redund foreach transit foreach predic set variabl suppress suppress end foreach end foreach algorithm delai predic remov redund algorithm fig remov redund predic test remov predic inform evalu fig concern transit test remov predic inform evalu perform transit case evalu reach origin state transit fig concern transit find recurr state state mark outgo transit ar set equal successor transit state mark case mean state transit id readi detect event lead path path variabl instanti shown fig node exist transit node node transit node add variabl ar set node transit start transit bind variabl node successor relat work combin function complet union offer declar system chain transform declar signatur specif oper rule oper semant declar signatur independ implement chakravarthi al defin semant composit event languag context activ semant extend semant logic variabl correl event lin al defin declar signatur part project signatur direct acycl graph node label logic predic describ constraint event dag structur tempor relat event variabl predic express event correl signatur easili nest mean author iter algorithm instanc detail critic treatment variabl bind gerard describ declar languag condit combin disjunct conjunct oper extend ad construct construct core structur siggraph inspir algorithm gener russel rule static analysi variabl bind present michel languag provid framework describ scenario attack condit impact target system signatur fragment languag dedic signatur descript union fragment awar oper semant languag articl declar signatur specif present semant shown produc oper detect rule declar signatur number technic consid write exhibit partial negat logic lead instanti problem solv problem static analysi evolut variabl bind declar signatur id detect analysi hand specif prone mistak autom process limit risk suit develop perform improv acknowledg jensen earlier version articl fruit discuss refer detect survei taxonomi technic report depart comput chalmer march cert coordin center advisori vulner solari sc kim composit event activ context detect proc intern confer larg languag model detect attack proc lnc vol st ra attack languag detect proc acm workshop nov gerard definit implement dun langag trail universitair de la belgium le softwar architectur languag audit trail analysi proc pa porra state transit detect approach ieee transact softwar march kumar classif detect comput phd purdu west kumar eh pattern match model detect proc nation comput secur lin sean wang jajodia specif adapt strategi proc comput secur foundat workshop ieee comput societi pa porra detect comput network expert system toolset proc ieee symposium secur michel attack descript languag detect proc intern confer inform languag tool distribut detect phd de la pg neumann pa porra experi emerald date proc usenix workshop detect network sun microsystem basic secur modul feb part number
DB/505 3 build larg locat tabl find replica physic object heinz ep ch geneva switzerland california institut mail code california ca usa abstract problem build larg locat tabl physic object occur number plan physic data manag control reclust replic satisfi system make local remot replica individu physic raw reconstruct data singl replica larg run file replic impli tabl resolv locat independ object descriptor physic locat object replica found modern physic experi tabl scale object argu tabl implement limit freedom lookup exploit specif properti physic data model specif viabl implement discuss kei object locat object object data replic introduct cm experi plan store petabyt data year object consist begin singl event object individu object hold raw reconstruct data event mean object creat annual object potenti replic region centr multipl replica object exist local site object reclust stage tape disk object locat tabl requir resolv locat independ object descriptor physic locat object replica found preprint submit elsevi preprint april logic physic object identifi manag singl object identifi uniqu call object identifi physic logic logic oid prefer data movement plai perman address store object move freeli object replic access version support price flexibl oid map lookup step physic locat replica object object locat tabl present paper logic oid aim enabl access physic object replic lookup determin replica return lookup oper order access cost gener system system system replic mass storag system stage tape system replic object reclust object locat tabl implement wai implement resolv logic oid physic locat good introduct altern techniqu found obviou choic implement hash tabl binari tree show implement direct map faster direct map exploit fact logic oid invent system object creat direct logic oid creat encod exact physic locat turn specifi physic locat object resolv oid involv retriev pointer read singl disk page worst perform case direct object lookup gener singl random disk read oper cm physicist run physic analysi visit event ten time product rate experi cm produc event job access object event translat object lookup oper implement direct impli random disk read oper typic disk drive process random read oper physicist disk drive parallel object retriev object direct logic oid implement found ensur worst perform case occur practic system exploit properti physic analysi greatli improv worst case physic order individu event process irrelev prefer process event time order occur access calibr data transform prefer system requir small event iter time order impli individu object time order event store locat pointer valu time process concurr locat lookup oper singl disk page read scalabl fix partit event set chunk chunk set typic part singl physic channel run exact chunk size import expect choic chunk size led tape perform logic oid job model logic oid uniqu identifi object hold physic data event oid chunk event sequenc id chunk id event sequenc uniqu identifi event object belong event sequenc number simpli posit event chunk belong uniqu identifi object object exist system event id raw data object uniqu identifi produc data version number configur chang id reconstruct physic object uniqu identifi reconstruct algorithm comput version algorithm version data algorithm data model impli reconstruct object exist object updat place physic job defin job event set event visit assum event repres event sequenc pair job piec execut code loadabl share run event kind object read event id object id object event smaller event set understand job function object event execut system comput set chunk object identifi chunk system run request event chunk iter event time order event sequenc number object locat tabl figur depict physic object locat tabl top quadrant bottom quadrant physic object distribut locat shown collect set replic object call exist geograph distribut site cern site cern hold tape disk collect tape object chunk collect disk store subset object subset store collect disk assum distribut system interfac data store cern local copi object locat tabl site top distinguish index level replic site object lowest level store physic object locat cern disk cern disk cern tape cern tape disk disk physic object rc cern id index chunk id index locat metadata top level collect index event sequenc number collect content index collect object locat index fig physic object locat level index arrow locat physic pointer object locat tabl execut automat determin replic object access order access cost process level execut singl show function singl run physic analysi job model section access object id event set chunk realist access object chunk id id fix repres ident object event sequenc number logic oid set id chunk id find collect relev job content collect repres set event sequenc number collect locat cern tape collect locat cern disk collect locat cern disk collect locat disk run replica read obtain inform case answer read object collect read object collect read object collect read object collect list long optim read object repres compact call compact schedul schedul defin collect object read schedul repres order list collect schedul collect collect schedul decid collect object collect schedul left collect object read introduc idea split problem access comput optim schedul run schedul actual lookup read cover schedul schedul architectur mechan run larg part architectur implement studi part earlier work start creat object iter separ type object request run iter id iter hand physic code job run insid method call obtain object request set set object deliv order event sequenc number start implement creat collect iter collect schedul collect iter intern bound object iter queri collect iter order deliv pointer replica object collect iter method return present pointer present collect iter collect local disk implement implement advanc lookup pointer local collect content index collect pointer advanc object request object found present pointer collect object locat index complex implement collect iter iter remot collect access set object collect packag object file download file fast ftp mechan creat local copi object comput set index level data hand remot mechan packag add index packag collect object locat transfer local site start iter packag transfer complet complex implement creat overlap oper feasibl comput optim schedul introduc problem comput optim schedul list schedul sl previou collect schedul number repres collect number sl optimum schedul run find optimum mean singl schedul sl schedul object request collect schedul cost cost minim defin cost schedul sum usag cost collect schedul usag cost collect cost function defin implement comput usag factor number object collect schedul size collect byte load data collect addit factor cost method object access transfer network cost reflect polici govern remot access repres gener find cost function collect polici issu encod base earlier prototyp experi argu cost function absolut reason cost function gener yield reason result prototyp experi cost gener framework prohibit good schedul comput reason time oper experi comput schedul implement comput schedul approach phase statist gather collect relat set request object typic item statist run class object collect size class object object request statist made time read indic set exploit fact set concern repres sort list integ phase solut space sl schedul search algorithm comput cost candid number object collect schedul comput quickli statist gather phase number fed cost function fig time complex phase implement find optim schedul figur show time complex phase implement run insid simul physic analysi system number collect uniqu chunk id id combin vari optim schedul gener found schedul problem theori practic good solut found quickli interest problem size note figur show time complex find optim requir optimum heurist quickli find good solut larger problem size schedul method fast faster heurist explor clear speed scalabl opportun improv approach exhaust replic impli tabl resolv locat independ object descriptor physic locat object replica found modern physic experi tabl scale object obtain scalabl limit random lookup oper perform tabl local access lookup ensur process subsequ object lookup oper singl index page read disk scalabl lookup support scalabl updat oper updat collect ad delet figur replic object collect object creat collect content indic ad collect exist disk storag level requir costli step collect index support transpar access object collect larg part system implement respect find good cost reflect polici govern remot work remain refer kossmann perform evalu oid map proc conf larg data base septemb van der cach filter queri massiv dataset tertiari storag proc kansa novemb van der automat reclust object larg high energi proc idea ieee scalabl hundr client object proc usa comput experi approxim algorithm set cover problem euro oper august
IR/506 5 gener topic internet ireland dept comput ireland tabl content introduct design strategi implement discuss refer abstract survei highlight internet user frequent frustrat fail locat difficulti link present internet applic address problem identifi semant domain consist tightli interconnect group part popul virtual world inform repres relev page structur relat user easili semant virtual librari introduct internet global inform resourc access unlimit amount inform paper describ difficulti suffer internet combin influenc web introduc integr solut tool directli tackl issu examin previou work search identifi similar differ survei internet user identifi internet user find exist engin attempt address appar success experi site problem trace jointli poorli structur limit current internet browser technolog netscap rank concern inabl find page visit user internet vast potenti long user experi difficulti locat navig inform sourc address issu identif navig turn web index engin note make clear distinct web index engin structur awar search engin index identifi page search search engin identifi small subset data index engin ignor hyperlink page brin search engin base search internet hyperlink structur index engin firstli identifi page user search term appli rank function identifi page index function base featur frequenc term prefer header presenc previou visit statist proxim search term queri term context includ search result requir user intellig agent appli assist internet search engin combin result individu combin rank function usefulli disambigu page describ search engin site navig site navig partli attribut lack navig virtual imposs construct site structur tradit browser lead feel design site rare problem site map common techniqu internet surf gener present user conflict site numer hyperlink time descend previou level link disappear user immedi face choic level arrai option lead topic page interest forc backtrack web page root tree oper return parent node backtrack connect recent abandon page user expect eventu list visit page revisit abandon user find correct link correct parent page unrealist explor complex user examin page return page web index engin present result order list thousand page queri term user find internet experi describ virtual realiti creat design strategi describ theoret compar exist work area search start examin techniqu identifi suitabl inform exist engin view task identifi semant collect relat user queri part describ virtual world repres internet subset gener displai chosen page typic user queri consist sequenc term expert frequent add term queri similar queri point altern collect page deal aspect queri effect form virtual librari provid inform inform retriev citat long estim import academ public hyperlink cite refer author includ web page hyperlink topic relat search engin hyperlink structur identifi collect document relat topic googl search engin make extens link structur anchor text identifi web page search techniqu similar describ techniqu highlight differ number extern link page receiv page merit hyperlink function combin link presenc queri term approxim genuin citat unlik brin page distinguish anchor text attractor satellit remaind terminolog attractor site site point refer topic collect page refer page topic deem primari sourc inform virtu consensu web author refer site attractor member individu page attractor site satellit page refer search topic link attractor site satellit secondari sourc inform attractor attractor collect satellit page refer inform resourc topic virtual world primarili sourc inform attractor satellit similar clever author hub primari firstli author individu page attractor member spread clever requir iter process rank multipl function al discuss greater detail process identifi author hub terveen basic unit refer search web feel extra flexibl retriev produc result tune process softwar interfac improv human understand complex comput softwar graphic anim techniqu al techniqu exist visual understand larg inform space portrai softwar virtual realiti shown benefit realist understand abstract map physic world case suitabl virtual librari static data applic show content link html page abstract graphic object provid foundat satisfi criteria abstract page vrml relev hyperlink repres line node avoid inform avail vrml abil displai inform vari level detail googl result displai simpl list structur allevi user difficulti combin problem search navig address terveen al basic unit refer result displai graphic form seat seat arrang central state wood al combin techniqu dynam graph user histori semant relat page typic end depict similar region form kind user gener semant map offer comput gener world terveen al combin search engin graphic depict search result displai result layout graph depict page work support virtual realiti provid interact simultan displai avatar support virtual world attractor satellit user perform topic serv structur page locat user shouldnt follow hyperlink page page refer visit interfac support user navig virtual examin underli standard browser present relev inform static aim elimin user remaind paper describ search engin mechan creat implement section discuss implement detail java base applic accept user search term identifi site satellit relat topic result gener vrml world depict discov inform singl environ framework base previou work gener virtual realiti internet gener virtual world repres individu world support internet partli adapt previou replac page scatter node identifi search number kei compon collect creat requir vrml world start collect seed set url topic exist internet index iter rank schema appli identifi attractor satellit attractor map vrml integr topic page singl inform world satellit relev addit inform core attractor node architectur uml packag diagram figur uml packag diagram web inform repositori heart complex inform model store satellit central search examin web inform built creat seri object aggreg hierarchi full view internet domain question construct object famili base notion site refer html page support concept attractor site attractor ad structur content inform store provid ad inform final visual section web investig inform design facilit creation vrml world underli structur web base complex maze electron link document interrelationship node repositori model object model chief design goal design inform repositori achiev distribut scalabl data structur implement inform repositori locat independ manner abil inform repositori platform independ format support abil transport inform internet inform retriev perform separ accomplish build complex object orient top java framework implement interfac inform hierarchi identifi attractor build web inform repositori algorithm stage identifi candid inform identifi attractor final stage collect satellit node fulli understand underli part build inform examin step detail initi stage begin retriev seed set url number web search topic appli rank algorithm base threshold function appli identifi set candid attractor candid satellit attractor rank stage algorithm kei inform group identifi attractor rank function base concept url valuabl inform relat web site point output set url formula attractor satellit topic candid attractor elimin drive inform retriev process turn subject attractor rank function data attractor relev satellit node satellit final stage complet collect satellit import satellit relev attractor subset fe point recov page initi discard threshold recov due proxim attractor rank function similar kei author entiti point numer extern web page differ extend base set url propag web page extract url add intern refer store import satellit relev attractor subset point recov page initi discard threshold recov due proxim attractor attractor identif applic focu aspect web concentr url extract page web inform repositori aid comparison url structur appli seri analysi stage includ step resolut partial rel url absolut url protocol analysi url classifi web resourc subset protocol mailto consid identifi attractor node examin dn url belong url addit inform extract html page content inform anim vrml provid detail view illustr attractor member satellit detail view repres vrml primit combin textur map textual inform hyperlink attractor member divid categori depend posit link graphic link node node locat tree link node lower site tree back current node popul web inform process begin examin task search result virtual creat vrml virtual world design transfer web view desktop vrml silicon graphic cosmo player convent web browser cosmo player user full interact vrml world reli main featur inlin anchor node prototyp combin primit shape line creat complex shape treat primit world inlin file larg world defin multipl partit complex world smaller unit file node altern virtual greater detail displai user trigger proxim sensor node extens amount inform present attractor reveal satellit detail relat inform anchor associ url object world anchor user virtual world interact directli underli navig virtual environ vrml world attractor goal give user vari level inform depend locat world perspect achiev incorpor proxim sensor attractor site check viewer predefin region reveal addit inform attractor site support summari detail view attractor site user present summari view attractor view simpl group vrml primit limit text render larg number attractor user entir world understand relationship attractor site activ virtual world proxim conjunct extra inform part scene ad detail attractor member reveal summari inform content creation vrml world gener world involv integr author vrml dynam gener code author code defin standard entiti world creat web icon aid web inform repositori gener dynam account code final world vrml provid basic build block creat vrml segment vrml process diagram vrml world build stage stage creat seri inlin vrml file repres attractor satellit posit layout world determin sensor inform ad reveal addit inform user attent locat relationship node determin ad final graphic textur appli node type aid reflect content underli entiti figur process diagram compon build attractor satellit compon gener summari detail manifest inform repositori build system determin graphic layout attractor relat add sensor inform translat system vrml maintain vrml compon add textur structur inform annot world inform enrich user world enrich virtual facilit page identif final vrml world subject number valid stage readi displai achiev vrml hierarchi vrml compon creat stage polymorph vrml gener algorithm combin compon inform inform repositori method involv runtim manipul java class loader dynam bind requir vrml compon creat requir vrml world discuss detect attractor site satellit node success approach understand complex inform model world wide web techniqu emploi url referenc approach determin import inform identifi inform data identifi tradit index base search engin major problem deal inform mean present user solut adopt repres result inform graphic techniqu visual understand larg inform space exist dean realist understand abstract structur map physic manipul graphic interact constitu graphic object depend web index start rank futur studi integr web index depend kei featur slow inform retriev internet busi index engin process construct world typic interact virtual world topic prove invalu virtual librari structur natur familiar topic world futur distribut applic perform system consid problem deal data overload frequent accompani internet limit current internet index engin consid inher limit current internet disori effect user perform extens search introduc tool interact internet product manner firstli identifi attractor site credibl sourc inform user detect satellit refer attractor inform creat complex inform model repres subset internet interest user gener virtual realiti world depict content structur identifi internet virtual domain user interact web attractor site depict navig environ reveal level includ satellit relev structur relat graphic text graphic cue provid summari inform inform sourc locat world detail examin page content support refer anatomi hypertextu web search intern world wide web lee page analysi improv web ieee internet henri agent assist web intern joint confer artifici hill visual collect topic relat web acm transact volum sr scientif june sr web link ieee price baecker principl taxonomi softwar journal visual languag inform techniqu displai navig larg inform proc ieee symposium inform oct scienc virtual realiti virtual sp framework abstract ieee symposium visual aug vrml virtual realiti model jl ns rj web intern web confer poster pp huang chang web ieee internet combin dynam gener sigart structur tech depart comput gener virtual realiti high perform comput network virtual realiti workshop lnc network work group request resourc locat editor xerox
HCI/507 4 adapt color segment algorithm applic robust human hand local ying thoma huang beckman institut illinoi il usa abstract proc asian conf comput paper describ adapt color segment algorithm transduct learn algorithm local human hand video sequenc color distribut time frame approxim map scheme prune merg facilit find number color cluster automat due dynam background chang light distribut color time stationari algorithm som transduct learn nonstationari color distribut color space combin learn paradigm color cue motion cue integr local motion cue emploi focu attent system approach appli task human face track color index local system implement sgi workstat reliabl effici color hand transduct map introduct current virtual environ wand joystick fundament input devic devic inconveni unnatur high dof input human consid natur input human comput interact motiv research analyz recogn human bodi movement goal natur user interfac recogn understand movement human step achiev goal reliabl local track human bodi face hand magnet sensor suppli motion inform magnet sensor plagu magnet altern interfac gestur command input repres set hand gestur order recogn hand gestur system local track motion human hand articul hand make task local track object video sequenc kei suppli input recognit part applic system local estim bound box object imag track includ track estim motion track posit orient object high dof track track deform object estim posit size object extract fundament inform object difficulti visual track complex unknown light condit deform object track multipl object problem made challeng accuraci speed import evalu track algorithm imag featur object suppli cue track algorithm approach match edg object approach imag templat small motion assumpt assum differ consecut approach achiev accur result assumpt algorithm recoveri depend remedi track method gener comput make realtim applic system hard realiz altern local imag inform edg emploi motion rough shape segment object background human hand uniform make approach comput effici robust skin color strong cue human track segment track bootstrap case small motion assumpt hold naiv approach collect skin color sampl skin color region expect separ background threshold distanc color space larg variat skin color peopl solut make statist model skin model tune collect larg train data set color chang ing mess skin color model case problem collect larg label train data set trivial success track system built base color segment challeng problem relat track segment clutter background color distract chang light condit adapt color segment algorithm robust local appli human hand track motion captur applic method construct uniqu skin color approach adapt color distribut transduc learn color model imag sequenc color distribut time frame approxim map color cluster color space learn automat cluster algorithm number cluster advanc order captur nonstationari color som transduc comb learn paradigm motion cue emploi focu attent local system algorithm appli track task color segment algorithm base selforgan map transduct som discuss section section hand local system present section result shown section paper conclud section automat color segment color consid strong tool imag segment static color differ easiest global cue object segment root color video color marker frequent facilit locat object clutter video scene color comput give inform imag segment attract lumin histogram techniqu segment approach color predic work appropri threshold histogram threshold easili found histogram correspond simpl hard handl clutter background find good threshold complic approach make parametr color model gaussian distribut gaussian mixtur problem prior knowledg determin number compon distribut advanc color segment scheme approxim color distribut imag color space map output neuron som correspond color cluster map visual interpret larg data set map space base competit learn scheme som consist input layer output layer figur show structur som number node input layer dimens input structur output layer connect node connect input node weight index wine node output som hebbian learn rule adjust weight win node neighborhood node som highli relat vector quantiz cluster good characterist som partial data densiti preserv properli train figur som structur problem cluster algorithm number cluster advanc success cluster algorithm depend number cluster case basic som algorithm output higher output neuron correspond cluster number cluster lead result tessel pattern space neuron data lower densiti domin pattern higher densiti node order map hard obtain approach problem crossvalid structur number output fix good structur determin valid structur approach offer flexibl find structur fast altern emb heurist dynam chang structur som train algorithm automat find number cluster scheme prune merg grow algorithm competit learn scheme deal problem find competit winner som output node distanc input vector weight vector node distanc measur defin distanc measur input vector weight vector node som measur euclidean distanc measur standard node smallest output winner arg min output node determin winner find smallest output suitabl input vector weight vector center convex hull weight vector current input includ weight vector cluster misplac unnecessarili adjust weight robust make smallest winner node gener input weight vector explain figur figur grow scheme som weight input vector input vector weight vector output node current input includ weight vector cluster misplac unnecessarili node creat compar median output make rule detect situat competit output ith node weight vector competit winner found arg min prune train node rare mean cluster low densiti kind node prune threshold set determin node merg train distanc weight vector node calcul weight vector merg node assign averag weight node algorithm summar initi set number node randomli initi weight repres weight vector ith node kth iter draw input train sampl set randomli som find winner node equat adjust weight winner node neighborhood node step size neighborhood counter iter grow node grow scheme node rare delet prune calcul distanc node perform merg scheme segment train data set collect color data vector weight set pixel larg small intens includ train data hue satur unstabl rang map label pixel pixel label index node map transduct som problem track color segment unknown light condit chang color object case fix light color object shadow object find invari light problem easili solv invari situat bring difficulti approach make uniqu fix skin color distribut skin color imag sequenc statist distribut fix assum static background fix light probabl densiti function color color normal time distribut color model neuron repres color cluster current time frame som offer simpl color classifi competit output imag current time frame segment classifi good time frame densiti color model adapt time address gaussian mixtur model linear extrapol emploi adjust paramet model set label train data drawn frame imag label data set hard obtain solut problem call transduct updat weight structur train som set train data transduc som captur distribut train data set transduct consist label unlabel sampl algorithm weight som time frame train data set drawn randomli imag time frame repres som time frame train data set classifi som partit label data set unlabel data set sampl confid classifi put sampl set label index win neuron put unlabel algorithm section emploi updat unlabel data set label data set step drawn label xk win neuron input xk som time frame transduc local system local system base color segment motion segment method emploi make system robust accur introduc comput cost figur show overview local system frame camera initi train som cluster algorithm section initi color distribut scene initi map train fast color imag input som output index win node som competit node segment indoor work environ newli captur color imag time frame som transduc algorithm section figur local system framework som segment input imag find color region stage lower resolut imag make segment faster morpholog oper rid pixel som updat updat scheme section label train data set randomli select segment ignor bright dark color work system color determin track problem solut color region human hand face solut rule automat find interest color motion intent detect motion region examin frame differ optic color region interest color case object color track face hand recogn sign languag color segment algorithm separ wai locat region method scheme cluster find centroid isol blob techniqu label blob heurist find bound box perform color segment algorithm test larg varieti pictur local system integr color segment algorithm run wide rang oper condit global hand track system base color segment suppli input articul hand motion captur experi show color segment algorithm automat local system reliabl color segment algorithm appli segment task perform segment paramet maximum number cluster scene set maximum number cluster scene set figur color segment result left column sourc color middl column segment imag column interest color region figur show segment result left column sourc color middl column segment column separ color region color segment color region averag color region pixel sourc imag assign label color segment label mask separ color region segment algorithm work experi background color algorithm find exact color region textur segment result noisi color distract textur background hand face imag cheap camera indoor environ lab algorithm successfulli segment hand region face region perform local typic scenario control displai simul desktop environ camera mount top desktop comput keyboard area give imag sequenc move hand typic applic track human face local system simultan local multipl track move human local system essenti base global segment larg reli track result previou frame tracker lost frame recov interf subject track algorithm robust system handl chang light condit extend transduct som color classifi hue satur weight system insensit chang light intens object shadow intens light sourc problem insuffici strong dark bright background bring troubl color segment hue satur unstabl system give weight intens light condit color segment algorithm fail transduct local result experi figur hand move move book book shade light color skin chang blue box bound box interest color region demo sequenc download local system robust effici experi background scene clutter book interf hand shade local system find correct bound box due sudden chang light tracker lost quickli recov continu work skin tone affect system imag interest color region initi train som work test experi local interest object video sequenc essenti comput vision applic clutter unknown light condit multipl move object make track task challeng comput vision techniqu suppli good wai human comput interact understand movement human requir robust accur track human bodi hand face paper present robust figur result local frame imag sequenc move hand interf book local blue box bound box interest color region local system base color segment som transduct som tessel color space automat imag segment som competit process pixel imag label index win node light condit background distribut color imag sequenc stationari order captur nonstationari color som transduc comb learn paradigm experi show local system capabl reliabl track multipl object real time desktop sgi workstat transduct som classifi effort find combin learn scheme process competit node essenti track system made faster parallel implement competit process local system offer bound box interest object shape analysi local object extend estim motion object acknowledg work support part nation scienc foundat grant grant refer rajeev hand dynam unconstrain intern workshop face gestur peter analysi featur color imag ieee confer comput vision pattern san puerto june shan hand track system sign languag recognit intern workshop face gestur color model applic skin compaq cambridg research lab technic report crl rick john skin color intern confer automat face gestur format topolog correct featur biolog vladimir interpret hand gestur ieee model select adapt dynam proc probabilist techniqu track object multipl part object intern confer automat face gestur int comput track human spie ying thoma articul human hand approach ieee intl conf comput ying thoma hand analysi anim context ieee intl conf imag ying thoma huang human hand local color segment ieee intl workshop analysi track face gestur
IR/508 5 invent hyperlink http transmiss protocol amaz structur internet world wide web web link check web inform organ huge collect inform resid net paper report crawler document collect topic engin technolog collect part digit librari collect synthesi draft submiss donna cornel digit librari research group hall ny categori subject descriptor inform search gener term perform keyword digit topic inform introduct digit librari made collect resourc view collect set semant relat resourc repres url collect approach scale order control success growth digit reli increasingli autom includ wai find build collect paper report effort automat put collect scientif start web subject hierarchi gener idea download page web classifi topic area effort highli result approach vari wai optim result achiev section describ web crawler locat resourc section describ digit librari benefit research review project devot build collect section explain detail concept crawl superior search explain version crawl section briefli cover implement crawl section current result paper conclud idea mercat automat build collect web search start web crawler mercat inher extens web crawler develop system research center palo alto mercat configur perfect vehicl explor web crawl strategi collect synthesi access mercat join list research interest work crawler figur adapt show conceptu mercat work mercat special person simpli scalabl distribut job download run analyz download option enqueu child link download loop shown figur execut continu typic hundr belong singl instanti java crawl henceforth call primari data object crawl url share thread research opportun add crawl opportun analysi url frontier dequeu ip fetch download page fingerprint page enqueu page url filter final analyz link extractor analyz page figur system block diagram mercat webcrawl dn http document link extractor sequenc analyz appli download page ai extens base analyz consist constructor call process method call download page process method content page inform url analyz appli order configur file final analyz link suppli extract link download page send url filter stage point mention extract child link encapsul object page inform ad url filter filter simpli encod configur discard url domain remain url pass chanc add parent inform pick download prioriti frontier object add proper queue user overrid frontier custom class configur file machin run mercat access version work remot cornel src palo alto note analyz link mercat download page run thread program addit made extend basic mercat object alter mercat code clean design construct java implement mercat project cornel digit librari research group involv larg project institut nation scienc digit fall project hope coupl hundr scientif collect searchabl collect valuabl costli begin form bulk success reli autom techniqu form maintain content wai collect gener initi lesser qualiti fund collect carefulli built train research access power web crawler platform decid automat collect acquisit wai crawler collect resourc discov exist collect web paper collect gener object autom collect build build number collect minimum user input autom kei futur digit librari project aim collect high respect topic educ collect good document automat collect gener lot research recent year build digit collect semant relat materi earliest collect start motiv harvest project index collect harvest select document sourc data index redistribut harvest mosaic browser time web tini experi ncsa harvest recogn index www home page document web harvest configur automat collect summar relat object internet larg collect hand annot special collect harvest sophist function system complet digit librari part collect sourc url web ftp url file url collector convert index extract metadata softwar chekuri al start broad topic select yahoo subject categori start train set page topic build term vector output order list categori download categor page topic ad collect build oasi distribut web crawler aim produc high high recal collect comput scienc result build collect report collect builder start set paper relev topic paper convert plain text relev figur comput term phrase children download paper prioriti queue depend combin metric paper categor random human sampl end determin good collect collect builder combin automat techniqu cora web crawl system creat portal complet automat train search engin set research paper refer hyperlink build larger collect topic mukherjea describ topic manag comput hub singl topic repres document vector base term seed url search queri kei approach project narrowli project start broad queri divid web topic plan build collect time search cluster number techniqu collect synthesi main approach search crawl combin search cluster addit technolog ad mix search engin obviou question simpli pose topic interest search engin make collect top search engin work crawl web index part download build effici possibl comput page rank base link structur download retriev url overlap queri word term vector document vector space explain problem search engin index small portion web cover topic search engin aim uniform coverag search engin download index entir web coverag topic small problem search engin interest examin part header data paragraph final search engin suscept search engin keyword spam harder analyz complet page content arrang word page attract collector cluster cluster long favorit inform retriev techniqu obtain relat subgroup amorph collect document cluster inher search start topic return relat result start corpora detect topic cluster number research cluster build collect idea corpora divid cluster relat cluster topic process big cluster overlap classic inform cluster centroid comput cluster surrog cluster meant speed make classif document describ cluster willet excel survei cluster collect build basic type classic cluster method hierarch start complet similar matrix distanc document collect call agglom iter start full collect pass cluster document fly updat centroid document drop cluster start cluster method start complet unsuit classifi web simpli web finit characterist web rule iter method method clear centroid start crawl build larg number search cluster fit bill crawl search attempt download document web search topic page figur crawl search engin faster narrow crawl specif topic approach introduc chakrabarti number variat introduc unifi theme effici figur current web download search crawler crawler topic dot area search result fewer relev document collect return crawler main problem crawl effici main techniqu link structur analysi content analysi link analysi base theori document point document similar document link document similar content analysi word similar document base document relat subject word hybrid approach combin link text analysi point link content analysi relat document lead natur concept past research citat relationship term similar content term similar link follow link page deem relev topic collect synthesi approach basic approach collect build figur assum topic virtual collect onlin document exist topic select author collect search construct centroid virtual collect topic search engin queri virtual collect centroid web crawl collect topic figur build collect build collect start number centroid number distinct collect crawl effici centroid massiv web crawl perform part figur illustr partial crawl document match centroid distanc measur figur document fall close document close centroid end hope collect centroid distanc cosin correl term vector document vector space corr ci weight term centroid di weight term document term dictionari weight comput classic techniqu log di fi number document search construct document frequenc term belew summar metric cosin correl yield assum weight normal weight centroid divid product norm dictionari union term found centroid document download time major factor crawl effici singl massiv crawl classifi document class number individu topic download page definit tricki filenam assum part larger latex document crawl mercat configur mercat wai accomplish varieti crawl wai configur mercat fall gener start stai stop crawl section describ configur start paramet configur file seed crawl start immedi ad frontier unclear make good seed intuit rich broad scope yahoo mercat default ad interest experi start top googl search result topic crawl begin arm dictionari set construct explain section load start run instanti analyz term file load configur file paramet extens base analyz object process method program page content pass extract text string split text string individu word remov word stop list word hashtabl word frequenc kei hash frequenc word document add complet hashtabl word stem interest select document collect pass extens link extractor subclass program hashtabl comput cosin correl download document centroid document classifi centroid yield highest correl correl document belong collect document length import normal document vector length term common automat class centroid term greatest weight sort categor made singl word ignor document fewer word overlap centroid tunabl download document frequent term includ dictionari unlik classic inform oblig word collect interest document overlap simpli ignor word dictionari remain slow crawl term discrimin valu exist adjust fly word high discrimin respect centroid adjust advantag mercat dictionari updat document download stop crawl crawl view tree link mercat download url crawl loop automat detect avoid crawler gener infinit seri question tree abandon path valuabl page order valuabl page control mercat cutoff threshold threshold determin differ page cosin correl page cutoff limit number page abandon crawl path tree cutoff link page diamet web case web find area futur research dynam adjust cutoff threshold depend learn crawl repres learn peer futur find relev item stop criteria list descript link follow list url download support mercat url collect big time centroid futur crawl union individu subject stop criteria mercat offer choic time limit empti frontier stop condit failur mercat comput run mercat support make crawl result current experi start topic hierarchi mathemat extract html yield leav topic stochast top url return googl queri mercat configur page set download mercat run analyz term topic order descend term import class centroid weight chose term frequenc document frequenc construct centroid result set item centroid truncat highest weight term section term combin make dictionari weight explain earlier detail result dictionari centroid follow dictionari faster fairli small dictionari word pertin area rang valu built base truncat level centroid shown section dictionari base term result highli correl document base ran faster word larger dictionari smaller tend bring page dict word min max avg df tf idf centroid dict word min max avg df tf idf centroid rang idf point cut dictionari size hurt word origin topic smaller dictionari analyz subclass global histogram term frequenc write file checkpoint time figur graphic layout centroid base similar direct arrow point centroid centroid closest edg mean cosin correl centroid closest centroid note centroid built automat rule human step relev feedback human search result topic consid train run ai automat centroid gener research make good centroid retriev scarc centroid close overlap measur comput complet similar matrix cosin correl vector figur show centroid centroid similar top left area middl top unconnect compon geometri center partial differenti equat graph nice laid test centroid mercat classif code cutoff threshold prevent download approxim centroid classifi lead space centroid hope url topic crawl crawl perform threshold cutoff crawl link occur page correl higher centroid closest assembl collect postscript document relat topic mathemat term hierarchi crawl perform measur wai plot correl download order measur effici crawl assum high correl impli relev effici crawl download highli relev document earli explain doc corr perform term term centroid document centroid centroid correl level figur rel effici centroid case find slightli highli correl document download set case shorter centroid smaller dictionari download document minut larger centroid initi crawl meant determin long centroid shorter figur snapshot download document cosin correl show case good case concentr collect found idea high correl high rank impli high relev judgment highli difficult make relev judgment measur crawl classic inform defin number relev retriev number document retriev download document long find relev defin number relev document rank correl order collect size simpli document correl strongli centroid document half item collect figur show result topic queri geometri euclidean triangl highest rank document relev good short collect final point expect lengthen crawl lift test comparison googl search made relev assess plot result googl start high relev rank origin googl rank figur plot geometri collect base crawl document download correl stabil search result googl search quickli irrelev topic descript idf closer inspect result calcul idf valu basi centroid optim crawl initi term frequenc document frequenc approxim document frequenc recomput term rang word move size dictionari remain pictur document figur compar origin crawl figur recomput good effect discrimin good document bad clear higher rank retriev figur show origin term weight updat weight work absolut librari automat method discuss requir shown plausibl build collect crawler knob scope investig sort variat collect synthesi approach main goal lift curv mark cluster overlap document correl highli put collect vari start place select crawl corr corr class download figur result download document recomput idf weight point dot repres similar document closest order document download order approxim thread run similar class download figur result crawl origin dictionari base centroid document download correl closest centroid shown document high darker mean junk retriev effect recomput idf valu origin recomput rank figur origin idf valu recomput idf valu recomput result higher rank appar higher vari cosin correl good line vari cutoff updat dictionari idf valu fly initi result show worth implement vari initi centroid length centroid centroid vari minimum accept overlap document term centroid term paper clever suggest thing link link follow link document ident singl acknowledg work fund part nsf grant project ii bill arm suggest carl lagoz improv clariti present acknowledg technic system research center compaq refer arm autom digit effect comput skill task magazin digit librari juli raghavan search web acm transact internet aug belew find cambridg ur ad support dynam focuss search eighth intern web page august bharat improv algorithm topic distil hyperlink environ intern acm sigir confer research develop inform page aug schwartz customiz discoveri access system technic report depart comput juli schwartz harvest inform discoveri access addit inform brin page anatomi hypertextu web search engin intern world wide web confer onlin feb manass cluster syntact cluster web sixth intern web santa page apr septemb carrier kazman search visual web connect sixth intern web page santa apr chakrabarti recent result automat web resourc discoveri acm comput dec rajagopalan automat resourc compil analyz hyperlink structur text seventh intern web page apr comput network isdn system special tomkin experi topic distil acm sigir workshop hypertext inform retriev acm van den dom approach web resourc discoveri eighth intern web page august web search automat current decemb internet broker bot rider davison topic local web annual intern confer research develop inform retriev juli acm dean find relat page world wide web eighth intern web page august gori crawl context graph intern confer larg garfield map structur page john wilei raghavan infer web commun link topolog acm confer hypertext time space structur hypermedia system page june han karypi document analysi result technic report comput mar indyk scalabl techniqu cluster web intern workshop web najork url sampl intern world wide web elsevi najork measur index qualiti random walk web eighth intern world wide web page heydon najork extens web crawler world wide dec kleinberg commun acm comput dec compil document collect internet sigir fall lawrenc gile access inform web juli moran stochast approach analysi acm inform apr seymor autom construct internet portal machin learn inform retriev menczer belew adapt retriev intern local context scale page mukherjea organ web inform eleventh acm confer hypertext page san mukherjea system collect analyz web inform intern world wide web elsevi august enhanc inform retriev feder bibliograph data sourc author network base european confer page sept najork heydon web crawl technic report research report compaq sept najork wiener search crawl yield page intern world wide web hong acm salton automat inform organ retriev portal power cornel engin page fall term vector fast access index term web page intern world wide web elsevi search scienc willet recent trend hierarch document critic review inform process boddi power build digit librari collect joint confer digit page digit librari softwar system acm confer digit san june june titl acm digit san page zamir etzioni web document feasibl demonstr sigir nsf nation mathemat educ digit librari project project report magazin digit librari nov
AI/509 2 independ permut andrei broder mose alan michael mitzenmach abstract defin studi notion independ famili permut independ set chosen random word requir element fix set equal chanc minimum element imag research motiv fact famili essenti algorithm practic altavista web index softwar detect filter document investig discov interest challeng theoret question relat concept present solut list rest open problem digit lytton palo ca usa comput scienc stanford ca usa part work author summer intern digit src support pierr christin fellowship part aro muri grant nsf award match fund shell xerox corpor depart mathemat carnegi mellon pennsylvania usa part work author visit digit src support part nsf grant digit lytton palo ca usa introduct classic analysi hash scheme entail assumpt hash function random assumpt kei belong hash tabl size function uniformli random function notat stand set slightli conveni assumpt impract function requir bit exce storag fortun case heurist hash function behav close expect behavior random hash case rigor probabilist adapt hash scheme presum hash function prescrib properti found constant expect time hold function chosen uniformli random function suitabl found necessarili search limit smaller set function situat led carter concept hash famili hash function call weakli pair distinct element chosen uniformli random call independ pair distinct element arbitrari turn situat analysi hash scheme complet weaker assumpt chosen uniformli random assumpt chosen uniformli random function limit random exist famili size easili implement practic hash function design adapt hash scheme commerci product concept log log independ import theoret applic excel survei lubi conveni permut function set permut famili permut independ similar independ independ mean set chosen random word requir element fix set equal chanc minimum element imag state assum chosen uniformli random chosen distribut uniform distribut natur practic simpl repres explain definit motiv fact famili essenti algorithm practic altavista web index softwar detect filter document web undergon exponenti growth lead document ident ident experi publicli document web duplic document innoc local copi popular malici erron case repres problem index softwar main index duplic wast user seldom interest document queri inform concept captur standard distanc defin string comput distanc requir comparison entir document larg collect document sampl mechan document turn problem reduc set intersect problem process call document set sd discuss view sd set natur number size sd equal number word resembl defin sb sb experi high resembl close captur inform notion comput resembl document document fix size sketch sketch comput fairli fast size sketch resembl document comput linear time size sketch assum document interest sd practic chosen uniformli random set permut sb sb independ random permut document store list sa readili estim resembl comput element sa sb common set avoid quadrat process coordin share document detail case hash discuss deal sad realiti imposs uniformli random led smaller famili permut satisfi independ condit equat independ equat hold practic relax accept small rel error approxim independ rel error approxim mean set chosen random word requir element fix set equal chanc minimum element imag expect rel error made evalu resembl approxim independ famili set interest smaller situat discuss typic set size restrict independ set size restrict independ mean set chosen random famili restrict approxim independ turn distribut famili uniform lead qualit result ultim interest practic famili permut studi minimum size famili satisfi combin requir minimum size exponenti practic solut exist turn exact properti gener necessit exponenti size approxim properti satisfi polynomi size famili complet synopsi result tabl entri bound impli entri tabl mark entri bound mark start opposit end studi good perform provid famili easili implement softwar independ numer practic implement interest linear altavista implement perform situat independ famili evalu perform set studi distribut minimum imag examin element minimum famili type upper bound lower bound uniform distrib distrib uniform distrib distrib log approx uniform distrib approx distrib max approx uniform distrib approx distrib min log log tabl synopsi result minimum size famili element minimum probabl extrem valu chosen worst set regard properti chosen uniformli case expect bound random choic synopsi answer tabl follow convent note definit independ famili type bound probabl element bound probabl element upper lower upper lower independ worst set linear worst set ln ln independ random set linear random set tabl synopsi result qualiti approxim subsequ result similar idea literatur properti independ kei featur monoton rang hash function cohen properti minimum element random permut estim size transit solv similar relat problem histori develop expect concept independ prove futur applic preliminari version work construct indyk independ famili discuss exact independ provid bound size famili independ begin determin lower demonstr size famili grow exponenti theorem independ larg common multipl number subset element minimum famili number divid hold divid number size fact number theori remark proof lower bound restrict independ famili note proof requir member distinct theorem hold duplic permut describ independ famili size significantli smaller trivial bound form lower bound theorem exist independ famili size initi assum construct famili permut stage divid set equal top bottom wai partit set bit string element top half bit string ith posit proce partit half bit string string string half ith set divid part size partit part halv bit string string defin partit part continu part size process produc permut set natur topmost element receiv smallest number permut properti element minimum correct probabl verifi directli calcul split element equal chanc upper half lower element top half equal eventu topmost element element top lie equal eventu topmost number permut famili log simpl calcul show size famili explain remov assumpt power fact bit string defin partit set size equal halv fact bit string defin partit set size part size construct permut stage begin ith partit set size continu string length partit part maximum size part produc perform partit give independ permut number permut size famili remark worth note famili stronger properti requir minimum unord set smallest element unord set equal subset size exact problem distribut focu result uniform demonstr interest lower bound theorem nonuniform distribut theorem famili size distribut independ prove directli number multipl peopl write linear program find satisfi theorem variabl permut repres weight express condit linear equat variabl total constraint system feasibl solut element uniformli put basic feasibl solut variabl solut yield famili satisfi condit theorem remark theorem beat lower bound corollari size famili exponenti prove tight lower bound section restrict construct upper bound approxim problem exact problem requir exponenti size turn attent approxim problem prove existenti upper bound construct upper bound deriv lower bound approxim problem existenti upper bound obtain existenti upper bound size approxim independ famili probabilist method simpli number random permut theorem exist famili size approxim independ exist famili size approxim restrict independ assum appli straightforward probabilist argument pick permut uniformli random set element permut chosen uniformli min number permut min note binomi distribut event event consid bad event pair interest bound probabl bad event appli bound hold pair pair probabl bad event occur ln probabl larg probabl bad event famili permut approxim independ rel error restrict case argument hold suitabl pair pair probabl bad event occur ln ln probabl impli part theorem remark argument show select permut uniformli random yield approxim independ famili high probabl permut chosen uniformli random chosen famili yield exact famili theorem provid suitabl solut document similar problem discuss result problem conveni repres random permut recal random permut element requir log bit practic lead simpl linear permut section construct upper bound techniqu section show larg famili chosen random approxim restrict independ high provid explicitli construct suitabl famili procedur check randomli chosen famili approxim restrict independ famili provid explicit construct theorem exist approxim restrict independ famili size log log similar theorem split set group initi split set equal split set random group suitabl independ hash function concern set size independ hash function divid element fall hash bucket continu construct hash function base explicit construct independ distribut bit binari string result proposit construct famili bit string log log proposit construct independ famili hash function suitabl hash function map string length log log bit determin imag element domain famili bit string log famili hash function independ hash function defin permut hash function sort element order occur sort order defin permut temporarili famili hash function independ fix set size hash function good element hash distinct bad famili hash function element probabl probabl element hash locat fraction bad hash function famili permut probabl element minimum deviat bit string construct hash function log deviat yield deviat desir obtain smaller famili break process hash spirit theorem hash function hash view select bit hash select independ success yield smaller famili map set size bucket size greater probabl close independ add error probabl level conveni replac log deriv absorb order notat probabl element hash locat log requir log log log log log log log log gener log wise independ distribut log distribut log close independ proposit requir log log log log log bit sum ignor lower order log log total yield suitabl construct famili size log lower bound uniform famili prove lower bound famili uniform probabl distribut show term existenti upper bound theorem improv theorem approxim independ famili element smallest permut fix permut set element occur smallest element permut permut case smallest element permut discuss element imag approxim independ minimum element permut solv equat optim yield simplifi yield lower bound lower bound famili prove lower bound size approxim independ famili probabl distribut lower bound proof yield lower bound independ famili close upper bound obtain section theorem approxim independ possibl probabl distribut fix element set pair satisfi permut element smallest element order smallest element show pair satisfi approxim independ fact pair satisfi independ definit set count smallest element event minimum permut distribut event event satisfi principl calcul note fact definit approxim abbrevi mean clear union distinct size evalu term express note equal term probabl satisfi independ famili note depend famili calcul easili comput probabl satisfi famili obtain combinatori ident hint algebra deriv equat magnitud total probabl mass permut satisfi pair number distinct pair permut satisfi permut satisfi pair mean size famili corollari exact independ possibl probabl distribut plug result theorem remark theorem prove stronger equat show probabl satisfi posit long approxim independ famili pair permut maxim bound corollari hold approxim famili exponenti small lower bound restrict famili lower bound theorem hold independ famili similar lower bound restrict independ famili properti hold set size properti hold set permut famili act replac theorem lower bound restrict independ famili similar achiev lower bound size restrict independ famili properti hold set size set permut induc permut satisfi mean element occur element state split disjoint set permut element occur element occur permut satisfi tripl tripl admiss restrict independ famili set size admiss tripl permut satisfi fact obtain lower bound number permut famili focu admiss tripl fix call tripl symmetr assum notat denot subset size set obtain lower show permut satisfi admiss symmetr associ set symmetr edg larg graph associ symmetr satisfi permut edg smaller graph concept graph entropi introduc smaller graph requir cover edg larger graph argument lead lower bound formal defin graph vertex set vertex element subset vertic adjac set disjoint edg correspond symmetr edg set defin edg present permut satisfi tripl symmetr satisfi symmetr edg present graph union edg graph fact obtain lower bound size graph entropi review briefli basic fact graph entropi begin standard concept inform theori note random set notat conveni definit random variabl finit entropi log definit random variabl finit mutual inform definit result graph entropi definit graph probabl distribut vertex set denot set independ set set admiss set distribut satisfi vertic graph entropi defin xy definit random variabl repres vertex random variabl repres independ set lemma graph graph distribut assum uniform distribut omit notat graph entropi easi entropi complet graph vertic log entropi empti graph lemma central lower bound proof recal show entropi graph small compar give lower bound size lemma graph set connect compon graph state simpl result entropi complet bipartit graph lemma complet bipartit graph log log random variabl uniformli distribut random variabl probabl probabl log log comput bound entropi graph defin lemma log minim definit graph entropi recal random variabl rang random variabl rang set independ set distribut uniform log log max maximum size independ set theorem chapter maximum size achiev set vertic element subset fix element max constrain rang vertic log log max log max log yield log log log lemma recal graph edg symmetr satisfi permut set element occur set element occur edg set set singl connect compon size complet bipartit graph size independ set lemma log log lemma log log provid upper bound express express equal function upper bound substitut yield log log hand side maxim maximum lemma log argument symmetr fix give care argument symmetr valu defin auxiliari graph valu observ sum graph isomorph lemma bound entropi permut graph isomorph proof lemma show depend posit permut maxim middl element distanc middl element comput lower bound fact maximum entropi graph bound lemma show fix permut averag entropi graph averag comput element yield lower bound size recal obtain theorem theorem restrict independ famili entir argument restrict independ famili small remark lower bound restrict independ famili lower bound maximum set size lower bound theorem independ famili size min log log linear independ famili focu behavior permut linear transform focu situat element prime famili permut permut form ax mod linear transform easi repres make suitabl real applic result suggest famili permut perform practic situat gener upper lower bound result linear permut requir provid proof result begin simpl lower bound hold linear transform independ famili result form theorem chosen independ famili permut set show smallest element requir theorem chosen independ probabl map smaller probabl map element smaller minimum probabl upper bound independ famili permut base linear program formul problem subsequ origin piotr indyk suggest simpler proof bound present linear upper lower bound deriv bound specif linear transform show famili linear transform approxim independ constant theorem set subset ln randomli chosen linear transform form mod proof basic fact seri remind reader definit basic fact inform found standard number theori text definit seri order consist irreduc fraction denomin order consecut fraction order seri fraction insert higher order seri comput fraction time minimum element transform multipli min mod minim mod valu imag minim element lie find fraction time minimum element find expect min mod conveni expect min mod concentr express number mod multipli number arrang circl number set view mod posit ith token time token start posit multipli token move circl direct token move step time tick larger motion continu scale circl distanc token origin circl multipli fraction part henceforth motion token uniformli comput averag distanc token closest origin uniformli distanc measur distanc averag distanc min mod term comput approxim yield correct approxim lower order token closest origin token reach origin integ point token speed reach origin time token closest origin proper fraction denomin term sequenc order consecut fraction sequenc order token speed closest origin time interv length time token start origin move speed averag distanc token origin interv obtain averag distanc entir weight sum pair consecut fraction contribut interv find simpl form result build start sum build set sum build order seri order seri deriv sum order seri order seri deriv order seri ad fraction form proper posit standard shorthand contribut summat interv fraction insert fraction insert insert fraction contribut interv contribut chang note exist consecut fraction chang summat build order order sequenc order summat order sequenc simpli evalu express asymptot obtain theorem requir detail note fact order sequenc probabl random point closest origin converg emploi common transform standard number theori text hardi wright yield proce straightforward algebra manipul approxim place equal express disregard lower order ln dy ln ln prime ln ln ln theorem show find set element minim ln time random linear transform linear transform set element minimum element probabl approxim ln result time element minim random linear transform theorem set subset ln randomli chosen linear transform form mod number point move circl speed point move speed point move speed determin averag distanc point closest origin averag distanc correspond fraction time minim element multipli consecut fraction order interv point move speed closest origin begin interv remain time meet point move speed point remain closest origin end interv point meet distanc origin averag distanc point closest origin interv contribut interv averag minimum theorem find simpl form result averag build chang move order sequenc order sequenc fraction insert consecut fraction chang contribut interv note chang averag move order sequenc averag distanc determin order sequenc algebra manipul similar theorem comput summat ln seemingli bad behavior linear practic suitabl perform random set set size max fraction permut element minimum minimum asymptot reach ln worst prove expect chosen uniformli random set size bound linear transform approxim independ respect random set theorem bound defin subset permut map ith element fraction permut ith element minim size larg vari continu unit circl jump discret simplif dismiss lower order term larg compar valu chosen result asymptot find conveni replac term definit interest asymptot chang result bound max denot expect random choic set note varianc varianc bound make simpl bound expect maximum ident distribut random variabl lemma ident distribut random variabl varianc max show max max max max symmetri find upper bound bound varianc bound varianc defin notat denot uniqu linear permut ax mod linear permut multipli map indic random variabl varianc dz dz dz appar imag randomli chosen element probabl greater continu line dy dz dy dz bound term turn bound varianc yield theorem order deriv altern express appropri bound pr term chosen uniformli random express bound sum power term lemma show sum term fix maximum sum power achiev term sum extrem result bound lemma experi valu independ uniformli random experi succe probabl success summat simpli number tripl experi succe lemma total sum term sum maxim term extrem valu assum rang correct simpl calcul yield bound bound rang substitut bound dy dz dy dz dy dz dy dz prove theorem comput integr bound varianc calcul easili yield prove theorem simul suggest fact behavior famili linear transform random set conjectur expect converg asymptot note theorem gener straightforwardli independ famili notat slightli care index variabl summat proof acknowledg author enlighten discuss seri refer linear hash annual acm symposium theori page el simpl construct independ random variabl random structur alon spencer probabilist method john wilei introduct analyt number theori secret web commun set famili combinatori probabl cambridg broder resembl document compress complex sequenc broder filter document fun mitzenmach independ permut annual acm symposium theori page mitzenmach independ permut draft manuscript syntact cluster web sixth intern world wide web page broder karlin multilevel adapt hash annual symposium discret page san jan carter class hash function journal comput system apr cohen estim size transit closur linear time annual ieee symposium foundat comput page cover thoma element inform theori john wilei auf der tarjan dynam perfect upper lower bound siam aug hardi wright introduct theori number oxford indyk person commun consist hash random distribut cach protocol reliev hot spot world wide web annual acm symposium theori page el bound inform theori siam alg disc knuth art comput vol fundament algorithm lubi independ technic report intern comput scienc rai alta vista search revolut find internet walsh platform digit technic person commun
Agents/510 1 multiag architectur fuzzi model delgado dept ciencia de la artifici universidad de granada martinez dept informatica sistema universidad de april kei descend fuzzi multiag architectur abstract paper hybrid learn system combin fuzzi model techniqu investig order implement intellig collabor mean multiag architectur involv agent embodi problem solv potenti strategi enhanc power fuzzi model system introduct recent fuzzi complement convent model activ research topic found success applic area fuzzi model present built base oper experi process complex expert kind situat learn techniqu fundament import problem state set data presum function question suitabl methodolog deriv rule data unknown function approach automat gener fuzzi rule numer data domain expert attempt solv realiz typic difficult model solut space case model relev inform form empir prior knowledg data repres instanc system behavior approxim reason system capabl handl imperfect inform term soft comput describ combin emerg comput fuzzi probabilist neural network genet algorithm situat multipl approxim techniqu practic collabor approach hybrid system past year number hybrid soft comput technolog integr improv algorithm perform hybrid system interchang techniqu combin techniqu vari problem problem lead idea multipl coupl distribut system techniqu develop system compon encapsul offer homogen interfac distribut environ mechan apt intellig cooper ponent support design implement cooper distribut applic paper intellig agent collabor mean multiag framework investig learn techniqu fuzzi model context approach involv agent embodi problem solv potenti strategi enhanc power fuzzi model system object show framework experi techniqu order select combin approxim system behavior section describ fuzzi model process perspect intellig agent multiag gener perspect architectur section present techniqu implement agent context fuzzi model process section show behavior combin agent techniqu simpl repres focu test show possibl architectur order interrel learn techniqu final present indic futur trend fuzzi model agent recent subsum frame literatur relat fuzzi model find fuzzi neural network fuzzi subset theori combin descent gradient techniqu cluster techniqu recent combin techniqu solv problem relat system model fuzzi model approach form fuzzi system model fuzzi import problem identif method system identif fuzzi model data concern consist structur identif paramet identif fuzzi model base idea find set local relat describ process expect method fuzzi model express nonlinear process ordinari method fuzzi model consist number fuzzi rule part fuzzi consequ part part form combin fuzzi set defin domain variabl relat fuzzi rule fuzzi rule form fuzzi input space associ consequ express fuzzi linear singleton fuzzi rule fuzzi subspac input variabl relat output variabl establish structur identif consist structur identif consequ structur identif structur identif system find input variabl affect output collect variabl variabl identifi structur identif concern relat identif crucial problem fuzzi concern identif optim number fuzzi partit input number fuzzi subspac correspond number fuzzi rule paramet identif concern identif paramet membership function fuzzi set fuzzi rule case form paramet identif perform structur tune paramet identif separ perform structur identif context fuzzi cluster base techniqu great success object cluster detect behavior present data obtain system observ addit inform perform process fuzzi model set fuzzi approxim descript method result rule set approach problem fuzzi model system studi object approach problem optim rule gener method tune techniqu base modif paramet fuzzi rule obtain cluster techniqu give creation hybrid system appli fuzzi system model clear obtain good fuzzi appli kind techniqu problem outlin fuzzi model process combin altern complementari techniqu structur paramet identif shown possibl hybrid system fuzzi intellig agent compon hybrid system intellig agent agent architectur recent year grow interest ai research distribut artifici due growth comput network distribut artifici intellig aim creat multipl intellig interact commun possibl share common knowledg order provid addit problem solv facil entiti intellig agent viabl definit agent research commun softwar develop reason work definit program artifact qualifi intellig agent consid program devic capabl reason make import properti agent abil oper human maxim perform respect object agent consid intellig exhibit form intellig behavior user point view provid small intellig compon easili integr gener softwar solv problem solv larg complex softwar system provis facil multipl fuzzi model problem solv paradigm singl softwar system strategi appli solv aspect approach select problem solv function proce speed problem solut problem solv method concurr activ attempt solv solut chosen featur relev case method solut solut provid method provid addit safeti assur agent kind insert multiag system agent creat initi paramet agent compet determin strongest domin multiag system larg autonom decentr compon cooper perform complex solv problem task multiag system creat vast set heterogen solut carri complex desir task offer black box high encapsul support interact scheme platform pai attent compon backbon develop intellig system pillar learn algorithm deal uncertainti technolog interact agent commun architectur found topic interact agent integr intellig softwar agent agent base system commun agent paramount import intern research group standard agent commun regard commun agent topic kqml arpa kse open agent architectur sri evalu opt kqml task kqml languag arpa knowledg share effort standard languag exchang inform agent knowledg base relev featur commun languag exchang syntax inform encapsul inform set perform extens extens integr intellig recent broadli accept creation system learn fuzzi model technolog develop distribut softwar agent group arpa knowledg share effort consortium develop convent knowledg base knowledg base system collabor asynchron autonom effici sibl distribut architectur architectur investig knowledg model commun infer techniqu independ group agent solv problem agent form system defin coupl network problem solver work solv problem individu agent autonom entiti capabl carri specif task cooper agent multiag system offer decentr model control mechan messag pass commun approach cooper system agent act global improv system versu system agent act benefit system benefit deriv individu benefit compon agent design cooper case conflict agent evalu advantag agent util program special specif task commun solv difficult problem entireti combin special part brain gener answer add system featur special agent chang system reason comment part system independ special specif task system deal basic coordin negoti agent commun transmit inform commun exist offer servic servic agent exist system collabor architectur agent common languag agent exchang messag coordin paramount import ma agent coordin combin individu capabl approxim agent special solv specif problem agent charg divid problem task perform special agent task depend perform fact forc coordin mechan agent mention unabl negoti exist goal conflict agent mention solv problem agent evalu measur agent select extern agent structur set servic offer goal resourc sourc intern object structur share process launch control servic request architectur coordin achiev platform special agent agent regist inform net servic servic defin featur solv problem commun learn techniqu explain algorithm appli kind architectur system architectur architectur layer intern layer task agent step inform request made interfac agent perform layer charg learn part process inform improv result layer interfac agent charg deal human oper adapt request addit inform confirm present inform request mention servic agent distribut system servic agent facilit agent facilit act yellow page indic find agent perform specif task task agent servic find request facilit agent list agent facilit return inform task agent charg activ send retriev result interfac layer layer charg deal world softwar charg user request elimin inconsist ambigu layer charg show result user qualiti servic offer basic feedback interfac layer retriev inform system produc deal human user present inform deal extern inform resourc gener call interfac inform agent task layer layer plan decomposit inform request activ agent charg inform retriev learn softwar layer consist part agent charg knowledg extract inform system part agent exist charg detect group data similar behavior data agent creat collect fuzzi rule appli learn techniqu gradient genet system evolv depend accept feedback system feedback human train data file due learn system tend techniqu produc result task fuzzi model schema base system acquir inform complet layer charg inform acquisit interfac layer task layer learn tak cobol ta ple deci figur schema task layer variabl identif cluster gener featur creation fuzzi rule system tune rule rule system infer step techniqu techniqu implement special agent agent basic kqml commun interfac receiv paramet case techniqu give intermedi result time restrict result immedi rule system optim tune agent give intermedi result continu tune rule system break time limit parallel applic wai process inform agent charg consid interest charg inform planner posit neg result choic techniqu experi paramet techniqu case rule tune modifi learn number agent section describ agent system classifi role servic offer goal resourc sourc intern object structur share process launch control servic request servic agent facilit agent act yellow page agent agent system regist exist facilit servic agent offer system facilit provid agent inform servic offer obtain task agent task agent system complet explan oper section cluster agent kind agent perform cluster data set find behavior tendenc group data cluster cluster gener rule model data rule gener agent agent creat fuzzi rule system kind rule gener agent differ creat kind inform input paramet number rule gener type fuzzi number rule tune agent agent tune fuzzi rule system optim train data train data provid system agent tune method make easier add system featur method simpli regist facilit evalu agent evalu agent fuzzi rule system infer result data due kind fuzzi rule system evalu resourc agent inform agent provid inform system agent inform resourc intern object rule system store fuzzi rule system produc inform store train data system control agent planner agent plan agent charg activ synchron agent agent elabor work plan charg ensur work plan fulfil receiv assign interfac layer activ inform learn agent error control agent agent planner agent decid perform task fulfil wai launch agent perform task agent finish assign task return result special agent call chose consid fit perform fusion result final error control agent error control agent charg control malfunct system error control task agent fail messag task agent redirect error agent filter process error control direct time messag error control charg report success failur task control situat time limit restrict task time limit task suscept interrupt request task agent answer limit reach task interrupt inform failur planner unreach condit task requir condit fulfil work properli condit unreach system error agent inform planner task control start finish due condit system reach sequenti task task perform order planner ensur task perform correct order planner error control agent perform action inform launch agent error control agent verifi inform agent system planner paramet error agent check addit inform agent request error control assign agent global system error control agent charg avoid degrad condit system kill set limit workspac set fuzzi model ma architectur defin multiag architectur return attent learn techniqu agent implement lose system singl find system approach function model system sampl set behavior system space xp domain input domain output collect data repres behavior tendenc obtain behavior fuzzi rule ah fuzzi set rule creat chapter show creat infer mechan approxim reason background rule obtain approxim function mean fuzzi rule system collect sampl find inher problem kind model limit number rule system artifici complet cover input space creat rule system forc cover input space make rule suffici broad good strategi thing creat rule system find function zone sampl similar cover zone rule find zone cluster techniqu rule gener cluster cover point greater membership cluster probabl overlap gener rule complet cover input space forc system cover input tune system tune techniqu model underli modif limit rule quickli lead situat hole input call rule system solv problem background rule system fuzzi rule system background rule behav similar normal fuzzi rule mechan bit sampl activ rule normal fuzzi rule system activ background rule rule singl default output complet system base distanc background rule membership greater background rule improv system restrict freedom tune fuzzi rule normal system background rule system gem background rule system gem envelop background rule system base set call gem rule point input space output space minim memori wast normal fuzzi rule system cover rule verifi calcul output system gem rule describ section gem rule tune infer cluster agent explain cluster agent multiag architectur integr exist cluster data dont inform data structur linear cluster algorithm find centroid import aspect stand cluster process perform input output product space object process shown work perform detect cluster exist data interact input product space account consequ interrel output space cluster perform account output valu exampl obtain centroid ca form domain xp belong domain method method input set pair input output valu object perform data detect centroid detect cluster modifi version classic kohonen algorithm loop centroid closest learn sampl set centroid vicin number iter method work gener random centroid insid data space input sampl measur euclidean distanc center input sampl select closest center winner center center belong set move input sampl vi vi monoton learn rate center set closest center winner center number iter reach winner center modifi paramet method start number iter reach paramet data number global iter start end learn rate method tabu search heurist solv combinatori optim problem hill climb local search techniqu trap local optim tabu search move current solut make object function hope eventu achiev solut present tabu algorithm fuzzi cluster algorithm object centroid membership calcul similar fuzzi algorithm paramet fuzzi cluster ci simplifi explan configur tupl centroid vector membership denot paramet maximum tabu list probabl nt number trial maximum number iter tabu list length algorithm mean simpl sl initi step arbitrari solut object function comput equat select valu step gener step ab gener nt trial solut ant evalu object function valu step select step order ascend order denot tabu step object function tabu ca modif step insert ac bottom tabu list delet element tabu list ao jc stop solut found jb object function step altern exist gener trial move centroid space calcul membership matrix random number greater move perform rule gener agent simplic chosen simplifi fuzzi rule form fuzzi set consequ rule chang simpl singleton consequ real method produc rule membership interpret express rule rule express xp express interpret membership input xj fuzzi set membership defin membership function depend kind fuzzi number rule initi output method defin number rule creat set center fuzzi number constitut rule defin membership set output explain creat gem background rule independ fuzzi rule system gem background creat gem rule fuzzi rule number center gem rule center fuzzi rule output output train data multipli membership function preserv input data train gem rule cover cover output calcul yj vh special avoid calcul center futur trend section wai find center gem test formal membership function till independ gem method gener fuzzi rule method method input set centroid creat rule centroid triangular fuzzi number fuzzi set gener center equal centroid calcul width assign centroid centroid closest exampl assign farthest width fuzzi set gener centroid greater distanc reason ensur train data sampl member fuzzi set slightli greater avoid element furthest membership membership function ensur rule fire method triangular fuzzi number center base defin fuzzi number membership function xj output calcul output exampl fire weight membership exampl dimens form xi xp yi initi rule output vn express vh fire strength rule rn xj wai express fire strength defin measur global coincid compon fuzzi number aij rule shown coincid measur membership case product fire ii note ensur input space ensur train data sampl cover problem gap cover gem rule method method analog center rule extract cluster divid input space matrix cell hypercub rang equal dimens defin center hypercub center rule method creat distribut rule width rule slightli greater hypercub overlap rule rest paramet calcul rule tune agent set rule gener previou method good approxim system model calcul error output estim error approxim function squar real yj fuzzi rule system infer infer process start measur improv fuzzi system tune rule infer valu closer real creat base output gradient descent note gem rule tune similar fuzzi gem background rule modifi method modifi output rule tune gem background rule system modifi output fuzzi rule modifi output gem rule rn modif adjust output shown iter tune process method method algorithm improv global output set individu improv method modifi vh rule yj closer fulfil object exampl check rule fire obtain subset pj fire strongest fire strength tune output rule make rule output closer output weight learn rate weight fire strength rule criteria pa system global output yj closer method tune gem rule strong point method ensur tune made tune made exampl method appli rule system singleton output give intermedi result iter solut found mean process interrupt work give resum tune process point method method improv error gradient descent error obtain express depend yj regard output rule regard fuzzi number fire modifi vn fuzzi set rule descent method seek vector minim object function vector tune paramet vector object function express learn rule express tune process iter constant object function minim error fuzzi rule system method triangular fuzzi system depend group center fuzzi number base fuzzi number consequ rule vi vector form develop kc kb kv rest process perform iter applic express variabl process finish reduct error iter determin constant express tune sharp method gem rule system method develop kind fuzzi number give intermedi result infer rule system defin produc result exampl search accur system develop kind fuzzi rule system ad special featur call multipl fuzzi rule system error describ section rememb order enhanc fuzzi rule system ad background rule background rule solv problem fulli cover input space method infer result simplifi reason method defin singleton output rule fire point infer weight fire strength rule ah vh fire strength defin membership approach result import criteria tune perform infer system equal mean rule cover gem background rule system activ calcul output express simplifi reason fire strength gem multipl membership fuzzi number input space fuzzi membership center gem rule gem rule cj gem rule output vj calcul membership express calcul final output vj pc system cover input space output special featur multipl fuzzi rule system error build fuzzi rule system find behavior line data set data set includ expect valu data train system tune rule minim error make approxim underli function due fact error make data interest creat rule system model error make rule system system model error good expect addit system produc accur approxim origin system process repeat estim error system point ad error system error featur approach fit distribut agent system rule agent system deduc estim error rule system request agent creat rule system model error agent finish work agent concurr model error paramet combin number number origin rule system includ rule incorpor estim error fact process repeat model system fuzzi rule system model function train set pair expect output system xj fuzzi rule system creat fuzzi rule system fuzzi rule system model function xp differ output real function creat model repeat process indefinit model point error layer stop process detect error tn greater error error calcul mean error produc error layer error produc layer mean good moment stop note kind system yn calcul independ due fact layer independ fuzzi rule system calcul mean addit layer delai answer infer system agent infer time layer result ad due fact qualiti model function approxim depend lot paramet number rule system test combin simultan exist resourc agent special techniqu tune method agent charg evolut exploit line kill agent preliminari result satisfactori result present section select show flexibl accuraci function model object experi combin agent show result system singl planner model train data random sampl area insid interv insid interv valu insid fig pair input exampl output ej combin gem cluster error layer tune method fuzzi rule system gem error cluster rule rule infer rule layer gener tune fr cl rg rg rt method appli creat cluster appli tune method appli tune method constant error layer characterist base show graph result result obtain valid set data sampl train sampl figur comparison error obtain fuzzi rule system number epoch tune figur function approxim figur function figur evolut error forc tune method worsen error figur comparison error obtain error layer train data check data figur function approxim fig differ method error fast stop epoch adjust adjust epoch gradient descent ensur method continu error exist hill error evolut fig method forc reach epoch fig error obtain error layer error layer perform system figur shape real function approxim futur multiag architectur paper prove flexibl tool fuzzi model process possibl ad agent care creation tune process possibl test combin techniqu continu modifi system method improv accomplish improv modifi output rule fuzzi number avoid hill error buffer fuzzi rule group tune process process worsen basic hill ascend method continu give intermedi result buffer reach improv studi import situat center gem rule method situat gem rule zone input space rule cover fuzzi rule give good system studi studi method discov zone fuzzi system high order cover gem rule focu research develop hierarch fuzzi rule system system start number rule tune creat rule elimin expand rule high divid model influenc area rule natur improv system fusion close rule similar behavior simplifi system system find number rule minimum error make minim refer gener fuzzi rule world pp product space fuzzi ieee int conf fuzzi pp converg emerg reason techniqu journal soft vol autom reason learn proc june martin fuzzi rule cluster base european congress fuzzi intellig technolog soft august pp germani martin para la de analisi sep pp hierarch cluster fuzzi int journal approxim vol delgado martinez de para de en el martinez tabu search approach fuzzi cluster interfac comm vol pp juli al work note aaai spring softwar aaai overview knowledg queri manipul technic report depart maryland kqml agent commun arpa knowledg share extern interfac work group work juli agent commun proc intl conf inform knowledg acm inform knowledg exchang knowledg build knowledg ed io fuzzi cluster descript fuzzi model sixth intern confer inform process manag uncertainti system juli pp spain fuzzi classif system rectangular fuzzi rule genet fuzzi set vol pp distribut artifici john wilei fuzzi control fuzzi set vol pp function fuzzi model refer fuzzi fuzzi set vol pp modular hybrid fuzzi set vol pp susan multiag design ieee pp xie approach fuzzi ieee intl conf fuzzi fuzzi infer suitabl fuzzi instrument control pp engin identif fuzzi fuzzi set vol pp approach qualit model ieee tran fuzzi vol pp ks tabu search approach cluster pattern vol pp structur identif fuzzi infer ieee transact fuzzi vol pp al intellig ieee pp decemb fuzzi set vol pp fuzzi rule mountain tech report pedrycz fuzzi model cluster fuzzi set fuzzi rule ieee tran vol pp complex system model fuzzi ieee tran man vol pp fuzzi inform vol pp
AI/511 2 journal artifici intellig research submit publish probabilist deduct condit constraint basic event thoma institut fur universitat germani abstract studi problem probabilist deduct condit constraint basic event show global complet probabilist deduct condit constraint basic event concentr special case probabilist deduct condit constraint tree elabor effici techniqu global complet probabilist deduct condit constraint tree point present local approach global complet probabilist run linear time size condit constraint tree condit constraint tree interv show global complet probabilist deduct global approach solv nonlinear program show nonlinear program transform linear solvabl polynomi time size condit constraint tree introduct deal uncertain knowledg plai import role knowledg reason formal methodolog handl uncertainti directli indirectli base probabl theori focu probabilist deduct condit constraint basic event interv restrict condit probabl elementari consid probabilist deduct problem consist probabilist knowledg base probabilist queri give classic probabilist knowledg probabilist knowledg probabl tweeti bird greater probabl tweeti provid bird greater probabilist entail greatest lower upper bound probabl tweeti solut probabilist deduct problem entail greatest lower bound entail upper bound probabilist deduct condit constraint proposit event global approach linear program local approach iter applic infer rule note immedi gener satisfi problem classic proposit logic section research global approach spread import work probabilist logic nilsson work main focu analyz comput complex satisfi entail probabilist logic develop effici linear program algorithm problem ai access foundat morgan kaufmann publish reserv georgakopoulo al show satisfi problem probabilist logic appli column gener techniqu process approach develop papadimitri al andersen hansen al al report result effici special case probabilist satisfi entail papadimitri al identifi special case probabilist satisfi solv polynomi time work global approach concentr reduc number linear constraint al number variabl fagin al present sound complet axiom system reason probabl express linear inequ proposit event show satisfi problem express framework earli duboi prade infer rule model default reason numer fuzzi quantifi subsequ research infer rule aim analyz pattern human reason al al al frisch haddawi discuss infer rule deduct probabilist logic recent work infer rule concentr integr probabilist knowledg descript logic analyz interplai taxonom probabilist deduct summar main characterist global local approach global approach perform rich probabilist languag probabilist deduct linear program global complet request tightest bound entail probabilist knowledg main drawback global approach gener provid explanatori inform deduct process result tractabl global approach driven technic possibl linear program techniqu artifici intellig applic artifici intellig context main advantag local approach deduc result explain natur sequenc appli infer rule al frisch iter applic infer rule gener restrict narrow probabilist languag rare restrict languag global complet give global complet local probabilist deduct restrict comput complex theoret result tractabl local approach main motiv idea paper elabor effici local techniqu global complet probabilist deduct inspir previou work infer focu research languag condit constraint basic duboi prade studi chain bidirect condit constraint basic event special case duboi al discuss probabilist deduct conjunct basic event describ open problem probabilist deduct chain bidirect condit constraint basic event duboi probabilist deduct condit constraint basic event al qualit version approach reason linguist quantifi al appli set bidirect condit constraint basic event report result global complet comput complex present deduct techniqu deduct techniqu gener global complet examin tree bidirect condit constraint basic event present deduct techniqu base system infer rule comput logic entail greatest lower bound technic notion defin tight lower answer queri contribut show global complet probabilist deduct condit constraint basic event restrict class probabilist deduct problem difficult algorithm effici solv probabilist deduct problem condit constraint basic event hope effici approxim algorithm elabor effici algorithm concentr probabilist deduct condit constraint tree interest subclass probabilist deduct problem condit constraint basic event condit constraint tree undirect tree basic event node bidirect condit constraint basic event edg node deduct condit constraint tree gener deduct chain bidirect condit constraint basic bayesian condit constraint tree repres probabilist knowledg base differ bayesian encod probabilist independ main contribut result condit constraint tree point present function deduc greatest lower upper bound linear time size condit constraint tree condit constraint tree interv show greatest lower bound deduc linear time size condit constraint tree comput upper bound turn difficult solv special nonlinear program show nonlinear program transform linear program result linear program number variabl inequ linear size condit constraint tree deduc upper bound run polynomi time size condit constraint linear program run polynomi time size linear program import contribut paper relat question perform probabilist deduct condit constraint iter applic infer rule linear program idea infer rule carri effici techniqu global complet probabilist deduct condit constraint tree consid deduct problem gener pattern reason proof sound global complet technic complex result work extend significantli gener probabilist deduct problem note companion paper report similar limit local approach probabilist deduct taxonom knowledg rest paper organ section formul probabilist deduct problem consid work section probabilist satisfi condit constraint tree section deal global complet probabilist deduct exact gener condit constraint tree section give comparison bayesian network section summar main result work formul probabilist deduct problem introduc syntact semant notion relat probabilist knowledg gener condit constraint tree probabilist knowledg detail condit constraint give gener introduct kind probabilist knowledg consid work deal condit constraint proposit event repres interv restrict condit probabl proposit event note formal background introduc section commonli accept literatur work frisch work assum nonempti finit set basic event fb set conjunct event closur boolean oper abbrevi conjunct event cd cd set proposit event closur boolean oper abbrevi proposit event gh event true event abbrevi condit constraint express form real number proposit event condit constraint call defin probabilist interpret proposit event condit introduc atom event binari relat atom proposit event set atom event defin fe note atom event interpret world correspond map atom event proposit event iff ag proposit contradict probabilist interpret pr map sum pr extend proposit event sum pr extend condit constraint pr iff note condit constraint condit probabl probabl condit event note entail pr semant condit probabl statement assum halpern frisch haddawi notion logic consequ condit constraint defin classic probabilist interpret pr model condit constraint iff pr pr model set condit probabilist deduct condit constraint basic event constraint kb denot pr kb iff pr model kb kb satisfi iff model kb exist logic consequ denot kb iff model kb model condit constraint set condit constraint kb denot set real number exist model pr kb easili verifi logic consequ kb iff inf observ yield canon notion tight logic consequ condit constraint condit constraint tight logic consequ denot kb tight iff inf set close interv real line note canon defin inf max min iff kb iff kb tight iff kb base introduc notion tight logic probabilist deduct problem solut formal probabilist knowledg base consist set basic event set condit constraint kb kb probabilist queri probabilist knowledg base express form variabl tight answer substitut oe fx kb tight call oe fx tight lower answer oe fx tight upper correct answer substitut oe fx kb defin notion sound complet relat infer rule techniqu probabilist deduct infer rule kb sound iff kb condit constraint kb set condit constraint sound local complet iff kb tight techniqu probabilist deduct sound set probabilist queri iff comput correct answer queri sound global complet iff comput tight answer queri comput complex framework condit constraint proposit optim problem comput tight answer probabilist queri immedi gener satisfi problem classic proposit logic problem decid proposit formula conjunct normal form survei garei optim problem comput tight answer probabilist queri remain condit constraint basic theorem optim problem comput tight answer probabilist queri basic event direct probabilist knowledg base basic event proof problem graph optim problem comput tight answer probabilist queri basic event direct probabilist knowledg base basic event proof similar line proof georgakopoulo al finit undirect graph construct probabilist knowledg base initi node basic event node kb node kb jb edg vg kb jb easi probabilist knowledg base construct polynomi time size show iff fx tight answer probabilist queri kb iff kb exist map edg vg cyclic permut member defin node edg vg iff node pr defin fa fa pr model kb model pr kb atom event defin iff node edg vg effici algorithm comput tight answer probabilist queri basic event direct probabilist knowledg base basic event effici algorithm solv special probabilist deduct problem rest work deal probabilist deduct condit constraint tree section motiv evid practic import kind probabilist deduct problem motiv senior student mathemat describ experi success success student influenc student reach interview professor senior student influenc time invest book hobbi estim probabl student success li probabl student success greater probabl student success greater probabl student success greater probabilist knowledg complet probabilist estim probabilist knowledg base fig set node probabilist deduct condit constraint basic event kb set condit constraint arrow label su wp st ho pr bo wi figur condit constraint tree success interview studi spend time studi book spend time hobbi express probabilist queri yield tight answer fx fx fx fx success student interview studi spent time studi book spent time hobbi express probabilist queri yield tight answer fx fx fx fx condit constraint tree formal defin condit constraint tree queri condit constraint tree provid addit subsequ run exampl condit constraint tree probabilist knowledg base undirect tree singli connect undirect exist kb pair condit constraint pair adjac node fbg impli kb basic event call leaf iff neighbor condit constraint tree exact iff kb queri condit constraint tree probabilist queri conjunct event disjoint basic event path basic event basic event basic event common queri condit constraint tree iff basic event iff basic event strongli iff basic event path basic event complet iff ef leav fig show condit constraint tree left side exact queri condit constraint tree fig strongli complet queri condit constraint tree fig figur condit constraint tree condit constraint tree kb conjunct event basic event write iff exist path basic event basic event jg write iff path basic event basic event hold jg condit immedi entail kb kb note restrict kb made technic conveni deduct techniqu section easili gener condit constraint tree satisfi restrict iff kb restrict queri path basic event basic event basic event common crucial deduct techniqu section assur problem comput tight answer complet queri reduc problem comput tight answer complet queri tight answer strongli complet queri note restrict trivial satisfi queri queri section tight answer queri import practic probabl uncertain basic event collect basic event certainti probabilist deduct condit constraint basic event probabilist satisfi show condit constraint tree nice properti satisfi condit constraint user prevent inconsist probabilist knowledg note condit constraint tree trivial model probabl conjunct negat basic event probabl atom event lemma show model pr condit constraint tree real number construct model pr set pr atom event conjunct negat basic event note pr coincid trivial model pr ident pr lemma crucial induct construct model condit constraint tree lemma condit constraint tree fb pr model kb real number map pr pr fb pr model kb proof easili verifi pr probabilist interpret remain show pr model kb kb pr model kb pr gh pr pr pr pr theorem show condit constraint tree nontrivi model basic event probabl greater theorem condit constraint tree fb model pr kb proof suffici show claim exact condit constraint tree claim prove induct number basic event model pr kb abbrevi kb exact condit constraint tree kb kb kb fcg model pr kb pr uv uv induct model pr kb defin atom event pr lemma assum pr pr probabilist interpret pr atom event defin pr ac pr atom event easili verifi pr pr atom event pr model kb pr pr entail probabilist deduct present techniqu comput tight answer queri direct exact gener condit constraint analyz comput complex problem comput tight answer queri reduc problem comput tight answer complet queri problem reduc problem comput tight answer complet queri tight answer strongli complet queri complet queri exact condit constraint tree focu problem comput tight answer complet queri direct exact condit constraint tree exact condit constraint tree complet queri comput tight answer start defin direct tree direct acycl graph node iff closer direct tree uniqu determin condit constraint tree complet queri fig show complet queri exact condit constraint tree fig left side set node partit strata lowest stratum node children highest stratum node parent node fig show strata node comput tightest bound logic entail kb tightest bound node comput exploit tightest bound comput children iter comput tightest bound node start node lowest stratum termin node highest stratum distinguish wai comput tightest bound ffl initi leaf ffl chain arrow common node ffl fusion common node complet queri exact condit constraint tree fig left side fig illustr wai probabilist deduct condit constraint basic event strata figur direct tree comput tightest bound node common node chain fusion fill tabl show greatest lower upper bound comput node stratum bound ff inf ff fi fl subject pr kb tabl show request tight answer fx tightest bound ff ff comput strata ff ff fi fl stu stu tabl local comput tightest bound initi chain arrow fusion figur local comput probabilist deduct condit constraint basic event focu technic detail present function ff ff fi fl comput greatest lower upper bound definit denot kb node leaf children leav node conjunct children leav conjunct event conjunct leav descend node node case refer initi leaf case node chain arrow common node case node fusion common node defin function ff comput greatest lower ff ff ff coincid greatest lower bound pr subject pr kb ff leaf chain fusion ff ff pr ff ff ff express ff comput greatest lower definit node descend node set condit constraint kb set model defin atom event function ff sound global complet respect iff ff ff greatest lower bound pr subject pr theorem show sound global complet ff theorem probabilist interpret pr hold ff exist probabilist interpret pr ff iff proof proof full detail appendix present function ff fi fl comput upper bound note ff fi fl show crucial result exact condit constraint local probabilist deduct techniqu sound global complet ff ff fi fi fl fl ff fi fl coincid upper bound pr pr pr subject pr kb ff fi fl leaf chain fusion ff fi fl ff pr fl ff fi fi fi fl fl fl ff min ff fi min fi fl min fl min ff fi function ff fi fl sound global complet respect iff ff ff fi fi fl fl upper bound pr pr subject pr theorem show sound global complet ff fi fl show enabl proof induct definit ff fi fl theorem probabilist interpret pr hold ff fi fl exist probabilist interpret pr ff fl exist probabilist interpret pr fi fl probabilist deduct condit constraint basic event proof proof full detail appendix note theorem show fl ff fi express min ff fi definit fl fusion replac ff fi effici comput fl exploit comput valu ff fi theorem tight answer complet queri fx ff ff condit constraint tree focu comput tight answer complet queri gener condit constraint tree condit constraint tree complet queri local deduct techniqu exact condit constraint tree section easili gener condit constraint tree true comput greatest lower bound concern comput upper bound gener easili exact condit constraint tree condit constraint tree gener comput upper bound result solv nonlinear program nonlinear program solv illustr chain condit constraint tree kb complet queri theorem straightforward arithmet request upper bound maximum subject nonlinear inequ ux vy ux vy vy ux ux vy vy vy vy system nonlinear upper bound monoton maxim subject nonlinear inequ ux ux ux ux request upper bound shown fig request upper bound maximum figur upper bound chain probabilist deduct condit constraint basic event transform nonlinear program linear program replac variabl xm xn maximum subject nonlinear inequ coincid maximum subject system linear inequ xb xm xm xm xn xm xm xm xn xn tight upper answer complet queri condit constraint tree comput solv similar nonlinear similarli transform linear program complet queri condit constraint tree fig side request upper bound maximum subject system linear inequ fig gener linear inequ trivial subsum note variabl xm correspond node xm xq xn xn xq xq xq xq xq xm xn xm xn xm xq xm xn xm xm xm xm xm xm xq figur gener linear inequ chain tight upper answer comput solv linear program variabl linear inequ note comput tight upper answer classic linear program approach result solv linear program variabl linear inequ section focu technic detail subsequ gener function ff section straightforward comput greatest lower bound condit constraint tree present linear program comput request upper bound condit constraint tree pr denot kb node case node node refer defin gener function ff comput greatest lower bound condit constraint ff ff ff coincid greatest lower bound pr subject pr kb ff leaf chain fusion ff ff pr ff pr ff ff ff sound global complet respect iff ff ff greatest lower bound pr subject pr theorem show sound global complet ff theorem probabilist interpret pr hold ff exist probabilist interpret pr ff iff proof claim follow theorem focu request upper comput solv linear program exampl start defin function ff fi fl variabl xb ff ff fi fi fl fl ff fi fl leaf chain fusion ff xb fi fl xb probabilist deduct condit constraint basic event ff fl pr xc fi pr xb xc ff pr fi pr xc fi pr fl pr fl fl pr ff min ff fi min fi fl min fl min ff fi system linear inequ defin set linear inequ xg xb xg xh xg parent intuit definit xg satisfi correspond exact condit constraint tree kb kb pair xh pair show upper bound subject pr kb ff fi fl follow upper bound subject pr maximum ff fi fl subject xg satisfi implicitli perform variabl transform exampl transform correct condit constraint lemma xg satisfi condit constraint exist uh xh uh xg uh exist xg xh uh xg node parent proof node parent uh defin uh xh xg xb node parent xh defin xh uh xg readi formul optim problem comput request upper bound theorem maximum subject ff pr exist pr proof kb theorem request upper bound maximum subject ff uc kb lemma maxim subject ff solv gener optim ff tackl linear program method solv optim interest rough idea time complex comput request upper bound interest improv effici topic discuss rest section ff gener optim problem linear program easili transform linear program transform elimin easili due ff remain outer elimin introduc linear inequ operand linear operand outer upper bound rough idea time complex comput request upper bound analyz size gener linear program number number linear inequ number linear inequ extract ff fl fusion produc fl fusion ff ff chain fl due cross number gener linear inequ tree branch avoid introduc auxiliari function ff fi fl variabl xb ff ff fi fi fl fl ff fi fl leaf chain fusion ff xb fi fl xb ff xc fi pr xb xc ff pr fi pr xc fi pr fl fl pr probabilist deduct condit constraint basic event ff min ff fi min fi fl min fl min ff fi note ff chain separ case simpli ff xc reduc number gener linear inequ lemma show function ff fi fl express term auxiliari function ff fi fl lemma xb satisfi ff fl fi fl fl fl proof sketch claim prove induct definit function ff fi fl theorem theorem lemma tight answer complet queri fx ff maximum subject ff fl fx tight answer complet queri condit constraint tree fig side time complex comput request greatest lower bound request upper bound analyz section strongli complet queri focu comput tight answer strongli complet queri gener condit constraint tree condit constraint tree strongli complet queri tight upper answer fx comput tight lower answer comput tight lower answer fy complet queri distinguish tight lower answer comput local function ffi tight lower answer complet queri section tight lower answer fx tight lower answer fx focu technic detail direct graph belong complet queri section pr denot kb node case node node refer defin function ffi comput greatest lower bound case ff ffi ffi ffi coincid greatest lower bound pr subject pr kb ffi leaf chain fusion ff ff defin section ffi ffi ffi pr ff ffi min ff ffi ff induct definit ffi easi ff entail ffi defin ffi ff ff fusion defin section ffi sound global complet respect iff ffi ffi greatest lower bound pr subject pr theorem show sound global complet ffi show upper bound pr subject pr theorem ff pr hold ffi ff probabilist interpret pr ffi ff ff pr ff ff pr proof proof full detail appendix readi give tight answer strongli complet queri condit constraint tree theorem condit constraint tree strongli complet queri tight lower answer complet queri fy tight answer fx ffi tight answer fx tight answer fx proof proof full detail appendix probabilist deduct condit constraint basic event complet queri show problem comput tight answer complet queri reduc problem comput tight answer complet queri comput tight answer strongli complet queri complet queri strongli reduc complet queri strongli complet queri complet queri condit constraint tree fig comput tight answer fy complet queri tight answer fz strongli complet queri gener condit constraint tree replac node pair condit constraint node repres comput tight answer complet queri condit constraint tree note reduct queri path basic event basic event basic event common theorem condit constraint tree complet queri strongli exist basic event condit constraint tree kb kb strongli complet queri kb tight answer complet queri kb fy tight answer strongli complet queri kb fz tight answer complet queri coincid tight answer complet queri kb basic event exact condit constraint tree tight answer complet queri fx ff ff fl ff ff fl defin section tight answer complet queri fx tight answer complet queri fx proof proof full detail appendix queri problem comput tight answer queri reduc special problem calcul tight answer complet queri queri condit constraint tree complet queri je condit constraint tree kb gener leaf ef remov remov pair kb kb ef basic event leaf basic event kb pair replac occurr basic event remain show gener probabilist deduct problem solut origin probabilist deduct theorem tight answer queri coincid tight answer complet queri je kb proof kb condit constraint tree gener step tight logic consequ kb show tight logic consequ kb logic consequ kb kb subset kb model pr kb defin atom event extend model pr kb defin atom event pr atom event conjunct negat basic event real number model construct induct proof theorem pr pr pr entail tight logic consequ kb iff je tight logic consequ kb introduc synonym basic event step comput complex exact condit constraint tree show exact condit constraint techniqu comput tight answer queri run linear time number node tree exact condit constraint tree denot number node lemma tight answer strongli complet queri comput linear time proof exact condit constraint approach comput tight upper answer complet queri ff fi fl run time direct tree comput time initi leaf constant number assign perform leaf direct chain constant number arithmet oper perform arrow direct tree initi leav perform chain run probabilist deduct condit constraint basic event time fusion branch direct linear time number branch fusion run time gener condit constraint tight lower answer complet tight answer strongli complet analog comput time theorem tight answer queri comput linear time proof assum set basic event total order basic event conjunct event queri written order queri reduc complet queri section reduct time gener complet queri strongli claim immedi lemma gener complet queri reduc strongli complet queri section reduct time basic event theorem comput time claim theorem lemma note fl theorem comput time condit constraint tree gener condit constraint techniqu comput tight lower answer queri run linear techniqu comput tight upper answer queri run polynomi time number node tree gener condit constraint tree denot number node lemma tight lower answer complet queri tight answer strongli complet queri comput linear time tight upper answer complet queri comput polynomi time proof claim shown proof lemma linear program techniqu comput tight upper answer complet queri run polynomi time linear program run polynomi time size linear program size linear program number variabl number linear inequ show size linear program section polynomi number variabl number linear inequ induct definit ff fi fl shown number ff fi fl limit number linear inequ extract ff fl limit number gener linear inequ limit note rough upper bound condit constraint tree branch lower complet binari tree compar section compar tree chain basic event number gener linear inequ linear theorem tight lower answer queri comput linear time tight upper answer queri comput polynomi time proof assum set basic event total order basic event conjunct event queri written order proof theorem queri reduc complet queri section reduct time gener complet queri strongli claim follow immedi lemma gener complet queri reduc strongli complet queri section reduct time basic event theorem comput time claim follow theorem lemma note theorem tight lower answer comput comparison classic linear program approach briefli describ probabilist deduct condit constraint tree classic linear program approach van der al hansen al queri exact gener condit constraint tree node tight answer comput solv linear program request greatest lower upper bound optim valu linear program xa opt opt xa subject xa xa xa kb xa xa kb tight answer comput solv linear program variabl linear inequ tight answer complet queri condit constraint tree fig yield linear program variabl linear inequ probabilist deduct condit constraint basic event solv linear program standard simplex method standard immedi exponenti time open question column gener techniqu solv linear program exponenti time worst case comparison bayesian network briefli discuss relationship condit constraint tree bayesian network bayesian network defin direct acycl graph discret random variabl node condit probabl distribut random variabl instanti parent specifi uniqu joint probabl distribut pr joint probabl distribut pr uniqu determin condit distribut condit independ encod bayesian tree bayesian network direct tree direct acycl binari random variabl close exact condit constraint tree exact gener condit constraint tree undirect tree encod exact gener condit constraint tree describ convex set joint probabl distribut singl joint probabl distribut assum exact gener condit constraint tree kb associ probabilist interpret pr model kb undirect tree independ causal markov tree idea carri singl probabilist interpret exact condit constraint gener condit constraint interest topic futur research investig comput tight answer exact gener condit constraint tree kind independ yield tighter reduc number model exact gener condit constraint fix probabl exact condit constraint tree independ specifi probabilist interpret probabl node respect upper entail exact condit constraint exact condit constraint tree fact bayesian tree binari random variabl summari show global complet probabilist deduct condit constraint basic event concentr special case probabilist deduct exact gener condit constraint tree present effici techniqu global complet probabilist deduct exact condit constraint present local approach run linear time size condit constraint tree gener condit constraint introduc global approach run polynomi time size condit constraint tree probabilist deduct condit constraint tree motiv previou work literatur infer rule gener pattern reason studi work present class tractabl probabilist deduct driven artifici intellig applic import note deduct process exact gener condit constraint tree easili elucid graphic comput tight answer complet queri exact condit constraint tree fig left illustr label node direct tree fig tightest bound tabl bayesian condit constraint tree probabilist knowledg base intuit graphic differ bayesian condit constraint tree encod probabilist independ understood complement bayesian restrict applic independ hold difficult access condit constraint tree restrict express power gener probabilist knowledg probabilist deduct condit contraint tree act local infer rule case desir explanatori inform specif local deduct subset knowledg base design phase probabilist knowledg import paper concern question perform probabilist deduct iter applic infer rule linear program techniqu paper elabor idea infer rule probabilist deduct paper show idea infer rule bring effici techniqu global complet probabilist deduct restrict set technic complex result extend probabilist knowledg base significantli gener condit constraint tree significantli gener probabilist deduct problem condit constraint iter applic infer rule global complet probabilist deduct note similar drawn companion paper show limit local complet infer rule probabilist deduct taxonom knowledg probabilist deduct probabilist logic program assum probabilist independ subrahmanian iter applic infer rule note techniqu global techniqu linear program approxim techniqu base logic probabilist deduct condit constraint basic event acknowledg grate michael wellman comment thoma eiter valuabl comment earlier version paper paper extend version paper principl knowledg intern pp appendix preliminari proof section make technic prepar proof theorem notat abbrevi system lemma optim valu linear program solv proof theorem lemma max subject min subject proof claim easili verifi assum condit constraint tree union node common model model relat common node combin model condit constraint tree import result lemma lemma set basic event basic event pr pr probabilist interpret atom event conjunct event pr probabilist interpret atom event fb pr pr pr pr atom event fb fb fb probabilist interpret pr atom event pr pr pr atom event set basic event fb fb fb proof probabilist interpret pr atom event fb defin pr pr pr pr pr pr pr pr pr atom event fb atom event fb fb show pr satisfi atom event fb fb fb pr pr pr pr pr pr pr pr pr pr pr atom event fb fb pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr proof similar pr pr pr pr pr proof pr atom event fb analog appendix proof section give proof theorem show global sound global complet function ff ff fi fl proof induct definit ff ff fi fl probabilist deduct condit constraint basic event prove global show local sound comput fusion prove global construct model condit constraint relat greatest lower bound relat upper bound comput fusion model trivial combin model model model connect common node model extend condit constraint tree combin model model connect common node model extend condit constraint tree chain model relat comput tightest model connect common node relat tightest bound comput run chain fusion technic prepar lemma show global complet function ff fi fl chain fusion lemma real number ux ux ux ux proof claim easili verifi lemma prove local sound local complet function ff ff fi fl chain fusion lemma probabilist interpret pr condit ux ux ux probabilist interpret pr condit proof claim verifi straightforward arithmet transform base properti probabilist interpret readi prove global sound global complet function ff ff fi fl proof theorem claim prove induct definit ff case tackl iter split conjunct event reduc gh conjunct event disjoint basic event defin ff gh ff ff model pr satisfi condit pr ff model pr induct hypothesi pr pr pr satisfi condit lemmata ff ux pr pr induct hypothesi pr pr pr pr pr satisfi condit lemmata model pr ff model pr pr pr defin proof theorem model pr case induct exist model pr pr pr pr pr iff assum theorem exist model pr pr induct exist model pr pr pr pr exist model pr pr pr pr pr pr lemma pr pr pr pr pr pr lemmata probabilist interpret probabilist deduct condit constraint basic event pr pr pr pr pr atom event cg pr pr pr pr pr pr lemma exist probabilist interpret pr hold pr lemma ff easi iff gh induct model pr pr pr pr pr pr pr pr pr iff pr iff lemma pr pr pr pr pr pr lemmata probabilist interpret pr pr pr pr pr atom event pr pr pr pr pr lemma exist probabilist interpret pr hold pr lemma easi iff proof theorem claim prove induct definit ff fi fl case tackl iter split conjunct event reduc gh conjunct event disjoint basic event ff fi fl gh ff fi fl ff fi fl pr pr satisfi condit pr ff fi fl model pr induct hypothesi pr pr pr pr pr pr pr satisfi condit lemmata ux ux ff fi fl gh model pr model pr induct pr pr pr pr pr pr pr pr pr pr pr pr pr satisfi condit lemmata model pr satisfi ff fi fl model pr pr pr defin proof theorem proof induct pr pr pr pr pr pr lemma pr pr pr pr pr pr lemma probabilist interpret pr pr pr pr pr atom event cg pr pr pr pr pr probabilist deduct condit constraint basic event lemma probabilist interpret pr hold pr lemma ux fi fl proof induct model pr pr pr pr pr pr pr pr pr pr pr pr condit entail result lemma pr pr pr pr pr pr lemma pr pr pr pr lemma probabilist interpret pr pr pr pr pr atom event cg pr pr pr pr lemma probabilist interpret pr hold pr lemma ff fl gh show claim prove analog induct model pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr pr condit entail result lemma pr pr pr pr pr pr pr pr pr pr pr pr lemma pr pr pr pr lemma probabilist interpret pr pr pr pr pr atom event pr pr pr pr lemma probabilist interpret pr hold pr lemma note comput upper bound difficult comput greatest lower edg lemmata greatest lower bound subject pr upper bound subject pr gener appendix proof section give proof theorem technic prepar lemma show local sound function ffi fusion lemma real number proof claim easili verifi lemma show local sound local complet function ffi chain fusion lemma real number probabilist interpret pr condit pr pr probabilist deduct condit constraint basic event xu real number probabilist interpret pr condit proof claim verifi straightforward arithmet transform base properti probabilist interpret readi prove theorem proof theorem claim prove induct definit ffi proof easili gener defin pr pr ff ffi note ff entail defin ff ffi ff ffi note ff entail model pr satisfi condit pr ffi model pr pr pr theorem pr pr induct hypothesi pr satisfi condit lemmata ffi pr pr gh model pr pr theorem induct pr pr pr pr pr pr pr pr pr satisfi condit lemmata ffi model pr model pr pr pr defin proof theorem induct pr pr pr pr pr pr pr lemma pr pr pr pr pr pr lemmata probabilist interpret pr pr pr pr pr atom event cg pr pr pr pr pr pr lemma exist probabilist interpret pr hold pr lemma ffi pr ff pr gh induct model pr pr pr pr pr pr pr pr pr pr pr pr pr pr lemma pr pr pr pr pr pr lemmata probabilist interpret pr pr pr pr pr atom event pr pr pr pr pr lemma exist probabilist interpret pr probabilist deduct condit constraint basic event hold pr lemma ffi ff gh theorem exist pr pr pr pr pr pr pr pr lemma pr pr pr pr pr pr lemmata probabilist interpret pr pr pr pr pr atom event pr pr pr pr pr pr lemma exist probabilist interpret pr hold pr lemma pr pr ff pr pr gh theorem model pr pr theorem model pr pr pr ff pr pr model pr pr pr pr pr pr model pr pr defin pr pr pr pr atom event lemma pr pr pr pr pr pr lemmata probabilist interpret pr pr pr pr pr atom event pr pr pr pr pr pr pr lemma probabilist interpret pr hold pr proof theorem claim theorem hold model pr kb theorem exist model pr kb theorem exist model pr kb theorem exist model pr kb appendix proof section give proof theorem lemma show global tight comput lower bound case theorem lemma probabilist interpret pr condit gf gf proof claim verifi straightforward arithmet transform base properti probabilist interpret readi prove theorem proof theorem definit queri condit constraint path basic event basic event basic event common basic event basic event common strongli complet queri claim theorem special case exact condit constraint tree kb claim theorem hold model pr kb theorem exist model pr kb easi theorem tight upper answer fx show tight lower answer fx theorem exist model pr kb pr pr pr theorem exist model pr kb pr lemma pr pr pr pr pr pr lemmata probabilist interpret pr fg pr pr pr pr atom event gg pr pr pr pr lemma exist probabilist interpret pr atom event set basic event pr model kb claim theorem probabilist deduct condit constraint basic event refer logic vol librari netherland constraint propag condit probabl confer uncertainti artifici pp morgan kaufmann bayesian logic support repres reason probabilist logic approach probabl mit usa statist knowledg base belief artifici logic foundat probabl chicago chicago coher numer ordin probabilist assess ieee transact de theori probabl york fuzzi comput de qualit reason probabl journal intellig inform infer numer quantifi intellig chap pp elli horwood logic reason probabl inform anytim deduct probabilist logic artifici comput guid theori york probabilist satisfi journal condit event probabl assess ieee transact analysi logic probabl artif de model algorithm probabilist bayesian logic intern joint confer artifici pp probabilist descript logic confer uncertainti artifici intellig morgan kaufmann de column gener method probabilist logic orsa journal linear program approach reason probabl annal mathemat artifici probabilist deduct taxonom knowledg doctor universitat effici global probabilist deduct taxonom probabilist conjunct event intern confer inform knowledg pp acm press magic infer rule probabilist deduct taxonom knowledg confer uncertainti artifici pp morgan kaufmann logic probabilist semant annual confer european associ comput scienc logic probabilist deduct condit constraint basic event principl knowledg intern pp morgan kaufmann probabilist logic program european confer artifici pp wilei son local probabilist deduct taxonom probabilist conjunct event intern journal approxim reason probabilist logic program ieee intern symposium logic comput bound probabl uncertain data comput semant framework support subject condit probabl deduct journal autom probabilist deduct condit constraint basic event stabl semant probabilist deduct inform probabilist logic artifici probabilist logic revisit artifici probabilist logic logic autom chap pp academ press combinatori algorithm complex englewood nj probabilist reason intellig network plausibl infer morgan san ca anytim make probabl confer uncertainti artifici pp morgan kaufmann theori linear integ program york uncertainti incomplet deduct system doctor universitat cautiou probabilist infer default detach annal oper van der comput probabl interv independ constraint uncertainti artifici intellig pp amsterdam statist reason probabl chapman york
HCI/512 4 krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp explor navig composit augment realiti morten fred martin bichsel matthia rauterberg helmut krueger institut appli physiolog swiss feder institut technolog zurich institut design construct method swiss feder institut technolog zurich institut work psycholog swiss feder institut technolog zurich center research interact technic eindhoven den az eindhoven abstract plan tool base comput vision support complex plan composit task group seat interact object virtual scene real brick plan view scene project object manipul place perspect view project wall view set virtual spatial attribut rotat zoom planar interact brick posit rotat inform object height control equal constrain planar interact aim paper suggest method tool bridg gap planar interact control control camera activ intellig behaviour introduc control object real virtual tool suggest solut base floor introduct plan tool base comput vision capac complex plan composit task system enabl group interact virtual real brick select manipul object scene plan view scene project tabl perspect view call side project wall plan view krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp storag space user creat object object select put brick object posit object rotat fix simpl brick manipul stai brick cover lift tabl object brought back storag space delet view fig consist chair screen addit person comput video camera system offer horizont plan view combin action percept vertic side view perspect situat system research platform graspabl interact explor section introduc problem relat work real virtual guidelin achiev call natur interact section detail interact configur plan task section present interact augment realiti section detail design handheld brick interact section present implement navig section introduc altern wai control object height system section discuss outcom design activ suggest wai advanc issu present section krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp work real virtual environ peopl set tangibl prefer call natur behaviour bring farther set remov concret world interact virtual object total virtual world larger aim project studi wai integr natur behaviour work order draw advantag world characterist featur natur behaviour peopl act real make speak commun bodi languag touch directli manipul object physic world part memori explor world direct interact foster cooper individu idea sketch natur behaviour sought feasibl mean make interact virtual world natur found import support bodi motion everydai skill support haptic feedback real interact handl intellig featur connect real virtual object clear manner give consist user feedback chose make distinct interact content form content refer kind task solv social set perform form refer thing layout humancomput kind handl kind interact featur offer kind task solv composit task exist object object analogu real machin molecul protein studi subject solv individu group import criteria success task solv task solv defin wai depend task work context augment realiti virtual object real object manipul coincid studi wai implement real interact handl connect virtual world studi manner navig virtual word interest oper interact design accommod domin hand base dichotomi content set explor implement aim determin good design strategi interfac support natur behaviour constru natur krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp term guidelin pertain interfac design design guidelin give visual feedback consist user expect assur navig support exploratori behaviour ensur low risk activ draw bimanu adapt domin hand real handl clear explan connect virtual world offer real handl extend user memori interact configur plan task plan task engin architectur draw model replac design system chang rang support tool draw inform process entail contact cad plan expert sale peopl perform task analysi potenti user group system observ spent great deal time discuss client notic cad support sale trip lack support misunderstand design commun solut travel sale peopl custom familiar layout unabl imagin object dimens plan tool prove attract plan expert sale peopl network system interact user locat site modern manag concept simultan engin base dynam interact cooper expert simultan engin goal earli involv market manufactur compani form team solut rapid product develop goal team significantli success build process type structur process encourag cooper requir met exist technolog video conferenc adequ solut offer natur interact account design technolog result system support earli offer design process apparatu intend complement cad system applic machin citi urban architectur interior design krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp interact augment realiti group work distant asynchron commun peopl build bridg global economi brought rang econom benefit network commun comput applic user interact physic environ deal virtual object case applic user fulli virtual unabl draw attribut tangibl world mental capac emploi adapt virtual leav capac actual task solv altern approach bring virtual world comput real world everydai human activ approach includ aspect natur commun serv mediat mutual bodi languag physic object handl glove respect time user draw advantag virtual enrich import plan task activ plan virtual involv reflect modifi object exist futur virtual object easili chang physic store extern comput memori interact physic virtual method place plan process specif aim project studi wai integr activ work tradit object handl workspac fig ar mean real workspac virtual world user interact virtual leav real world context tool ar wellner al goal ar user continu everydai object encount daili work enhanc augment function mackai ar mean comput inform project draw user interact project inform paper draw ar system al tether brick wireless system ishii ullmer ishii krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp system compar layout offer quicker exact object base multimedia framework system read displai arbitrari object emploi virtual realiti model languag object cad system plan result back cad system geometri aspect product data grow interact cost system engin send receiv numer form potenti work made readili automat calcul price anim robot laser combin plant live simul product cycl system interact tool interact method capabl support distribut network system base section offer tour recent design cycl design brick mediat user virtual world cyclic order user select object put brick object posit object rotat fix simpl brick manipul object deselect cover brick object select brick left idl insid plan view shown interfac significantli easier intuit fig basic step user manipul brick brick handheld mediat link virtual world physic world aim brick form invit user perform manipul rotat cover step cycl cost make mistak low exploratori epistem pragmat action equal support brick left pick plan serv ubiquit extend user memori krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp detect brick achiev light paper light reflect pick camera turn trigger updat comput imag constraint brick size shape reflect area exce size modest technic major question design brick peopl move real brick simultan virtual set perform exploratori brick model base form metaphor feasibl brick block advantag shape user grasp brick easili imag detect simpl due height imag project distort brick suit mediat user virtual world fig begin experi base form metaphor feasibl brick block recent circular rectangular brick base principl reduct screen solv problem interfac user separ user comput user comput situat similar blind stick boundari individu tool extern coincid tool mediat individu virtual world design brick user perceiv interact virtual interact real world brick solut problem found emploi reduct screen common screen border front monitor reduc flatten cue idea make brick open box narrow black border edg bottom brick indistinguish tabl surfac imag distort final aspect connect virtual world moment select virtual object real planar relat term posit rotat establish real virtual call lock mechan lock mechan determin real brick virtual object stai connect moment select moment krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp brick form lock mechan defin virtual object align move brick spatial control rotat zoom basic aspect interact explor bimanu camera control object manipul graphic interfac explor keyboard screen innov featur object part scene multimedia framework full includ tilt roll planar interact brick posit rotat inform bridg gap planar interact view control explor import rang composit plan design product architectur industri design explor virtual essenti assum point overview thing detail call direct control rotat zoom view strategi consid control side view camera requir extend properti comput vision input explor softwar approach pursu activ virtual object introduc activ object featur intellig behaviour support complex oper emploi activ side view control implement altern method plan camera window side view base scene handl base call observ handl plan view brick offer shift brick add zoom zoom brick movement connect movement give shift rotat updat scene user action quit remov brick updat frame interest user action brick scene adjust frame object realworld analogu krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp tabl ground frame user action scene user action scene shift rotat zoom fig remov brick fig remov brick side view camera window zoom object fix approxim height meter ground brick offer shift brick add zoom camera set virtual camera side view handl distanc set zoom window set side view border scale set zoom krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp tabl camera window camera window shift rotat fig camera zoom fig window zoom zoom zoom krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp object height control set object handl ground level object concern rest paper instrument develop virtual scroll side view set object set real tool work integr featur singl virtual tool virtual prototyp height manipul side view control achiev copi section side call height tabl scroll side view perform put brick upper lower edg height slice brick object move fig scroll side view put brick height slice move object height perceiv move object side view real tool control dimens base real tool explor wai physic handl object height closer principl coincid action percept space digit work select object set height button tower offer button combin lumin scale show current height button visual feedback organ height action percept partli coincid slider vertic height handl handl handl height cue organ height action percept fulli coincid actual height handl virtual set carri virtual call floor problemat aspect solut tool requir serial interfac system reli batteri driven remot control softwar solut krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp fig real height box lumin scale handl digit displai back concept floor handl result solut placement manipul object multipl stori fulli virtual solut height slice solut floor solut integr knowledg acquir previou step floor handl height locat edg plan view object select assembl storei assembl select object move vertic floor move upward object unload desir storei object floor visibl support offer virtual call ceil ceil handl height slice object ceil visibl floor object storei handl plan view case side stori visibl ceil affect side view requir floor ceil develop system offer call dynam control clip plane technolog emploi floor ceil connect clip plane object visibl updat side view content case work complet build roof wall part cad model empti floor stori build floor ceil automat krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp fig floor object handl plan normal object select floor select object fig floor handl side normal object floor select floor object camera select fig floor handl aid select floor floor discuss perspect navig method evalu design strategi inspect conduc develop user offer side side altern control method task complet time give quantit data subject particip rate prefer method experi conjectur method base scene handl method base krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp server handl composit task plan rotat brick requir orient brick form brick reli brick orient interest fit form emploi rectangular circular brick zoom control topic asymmetri appli function tilt roll set relat explor futur research concept input prove fruit regard control object height met virtual trigger real answer virtual floor handl cycl futur design strategi evalu outcom usabl studi carri seamless integr floor spatial navig method requir structur scene observ handl valid virtual floor handl plan floor scene observ handl side view scene observ handl select tool floor interest consequ user behaviour design activ guid suggest design guidelin tool method present subject usabl studi guidelin turn clearer refer develop multimedia softwar verlag für heidelberg explor bimanu camera control object manipul graphic interfac ny step ecolog mind ny person commun train design perform improv product san foundat graspabl user ny graspabl user interfac phd toronto ch intuit design tool base direct object manipul gestur sign languag interact lectur note artifici vol berlin heidelberg ny krueger explor navig composit augment realiti gellersen handheld ubiquit comput lectur note comput vol pp intuit simul tool layout process der zurich integr solut support multidisciplinari design task design effect usabl multimedia system kluwer academ boston asymmetr labour human skill bimanu kinemat chain model journal motor vol tangibl seamless interfac bit atom ny function organ social context nardi context mit ma distinguish epistem pragmat action cognit person commun augment paper engin draw video ny grasp hand elsevi candid gener interfac technolog intern confer interfac real virtual world montpelli gestur base interact techniqu plan tool construct design ieee meier plan tool construct design video ny person commun illumin optic design tool physic interfac ny person commun comput augment back real world commun vol understand comput foundat design ablex publish corpor acknowledg peter photo scott editori assist fund swiss feder commiss technolog innov center integr product system eth institut design construct method eth zurich morten research council norwai phd fellowship regist trademark
DB/513 3 access inform sourc www dieter fensel stefan michael steffen rudi andrea witt institut univ abstract broker servic improv access distribut semistructur inform sourc present world wide web reli ontolog make explicit semant web page paper discuss gener architectur main compon provid applic scenario introduct paper describ tool environ call process inform sourc content descript rdf intellig inform queri answer mainten support central approach ontolog describ background knowledg make explicit semant web document ontolog develop area system structur larg bodi knowledg cyc ontolog consensu formal specif vocabulari describ specif domain ontolog describ semant structur complex object describ distribut semistructur inform sourc broker architectur queri interfac formul info agent collect requir knowledg infer engin deriv manag cach semant annot figur semant inform guid queri answer process answer syntax semant directli understood process automat agent softwar tool enabl homogen access inform physic distribut heterogen repres www inform directli repres fact www deriv fact background knowledg rang problem appli broader inform access identif semistructur inform appli automat document extract inform weakli structur text creat textual maintain weakli structur text sourc gener pictur architectur provid figur includ basic engin repres aspect engin receiv queri answer check content fill info infer agent agent collect factual knowledg web style meta direct annot xml futur text mine techniqu engin fact ontolog deriv addit factual knowledg provid implicitli free knowledg provid burden fact explicitli manag backbon entir system receiv fact info exchang fact input output infer fact queri engin term commun kind data data web queri run sourc sourc content extract addit fact found explicitli system appli rule deriv addit inform ontolog structur principl info agent extract infer agent infer manag structur queri engin provid formul queri languag formul ontolog languag base frame logic queri engin infer engin info agent db manag ontolog ontolog ontolog ontolog ontolog fact flow knowledg flow html rdf xml wrapper text miner figur architectur store data deal user deal web deal logic call html integr semant annot html document webcrawl collect page extract intern format detail html found write wrapper stabl inform sourc enabl appli structur inform sourc make annot languag appli cia world fact book show exploit structur regular current web sourc html extract semant knowledg addit annot effort make rdf annot rdf mean ad semant document make assumpt intern structur document info engin deal rdf descript make rdf parser translat rdf descript tripl directli put detail infer engin work rdf infer engin special rdf call rdf interest possibl basic attribut domain rang hierarchi set subclass multipl attribut logic axiom relationship element ontolog instanc queri engin queri languag defin subset languag elementari express complex express built comb elementari express usual logic connect expect normal web user type queri logic languag larg formal definit ontolog practic exploit structur queri languag provid tabular queri interfac quick easi navig provid present scheme base hyperbol geometri detail base automat deriv queri textual form present result queri info agent info agent extract factual knowledg web sourc discuss possibl provid develop small extens html attribut extens markup languag xml tag defin dtd carri semant inform retriev assum dtd defin person tag phone number tag richard benjamin inform directli access semant process ontobrok queri answer xml chanc metadata side product defin document structur xml definit tag dtd semant inform byproduct defin structur document dtd defin tree structur describ document leav tree tag semant elementari inform unit present dtd serial simpl mean describ ontolog limit current version info agent appli static web access knowledg provid javascript mean dynam gener inform infer engin infer engin fact collect webcrawl terminolog axiom deriv answer user queri deriv inform implicitli present web sourc requir inform complet materi annot achiev complex job translat frame logic horn logic transform techniqu deduct applic implement fixpoint evalu procedur adopt model semant comput semant extens dynam filter found semant tractabl semant close world reason negat chosen impli answer queri correct respect complet fact approach negat web argu web open natur view web infinit close world reason version inflationari time infer neg inform assum true assum dynam extend demand queri time incorpor web page open model attract shortcom time queri pose engin download web connect run long time due open introduc infer engin stop inform web infer engin run forev typic border border web search inform insid web site exampl exploit open semant link defin webpag load page queri time usabl semant concept declar queri inflationari step infer process true inflationari semant onlin queri scope exact page queri queri time dynam add page appli subset www captur info engin appli assumpt fragment www assumpt appli context gener info engin decoupl infer queri design ontobrok made import separ web crawler infer engin web crawler period collect inform web cach infer engin cach answer queri decoupl inferenc fact collect effici reason strategi search engin web queri answer index cach start extract page web refin architectur ontobrok introduc separ queri infer engin infer engin work demon background fact infer fact return result back queri engin directli interact infer engin fact infer time critic perform background independ time requir answer queri techniqu queri interfac underli fact robust tool handl mass data simpl includ thing term similar rank queri answer mechan directli integr sql queri interfac part provid requir complex infer engin strict separ queri infer engin weaken case separ disadvantag case enter entir minim model fact intermedi interest answer queri infer engin incorpor dynam filter strategi queri focu infer process successor system ontobrok major design clear separ queri infer engin integr web standard xml rdf answer complex problem comput infer effort larg number fact human annot effort ad semant html document web appli number applic meantim promin initi semant access kind inform research group knowledg acquisit commun harmelen van der share ontolog improv access mainten web sourc limit xml sourc constraint languag express power logic shoe introduc idea ontolog annot web sourc main differ approach annot languag annot exist inform web add addit inform annot shoe inform repeat redund mainten problem affili provid text string render browser time annot meta inform differ infer techniqu axiom infer addit knowledg shoe reli techniqu infer servic provid intermedi posit infer engin deriv addit fact queri interfac coupl easili scale larg dataset acknowledg review workshop comment refer queri comput web kolaiti theori icdt intern januari lectur note comput vol pp gomez knowledg manag ontolog intern confer practic aspect knowledg manag octob brewka dix knowledg logic program logic program knowledg lnai page springer queri infer servic rdf queri languag workshop decemb ontolog base access distribut inform meersman al semant issu multimedia kluwer academ high idea intern flair confer mai knowledg acquisit languag ieee transact knowledg data van altern fixpoint logic program journal comput system harmelen van der van harmelen van der verif intern confer practic applic knowledg manag april pp declar semant web queri deduct intern decemb lnc vol logic foundat journal peter techniqu base hyperbol geometri visual larg hierarchi acm sigchi confer human factor comput invest knowledg commun acm lloyd make prolog journal logic web agent intern confer autonom
IR/514 5 semant approach structur queri web site damiani di milano di tanca di politecnico di milano abstract order pose effect queri web form site data model implicitli explicitli share user approach lack common model hypertextu structur web structur data semant paper techniqu navig descript web site data model base queri languag base model good descript data manipul primit descript web site schema lexic base standard hypermedia design easi schema gener current hypermedia author environ queri graphic queri construct respect navig logic part schemata site schemata manag schema assist client process identif retriev set candid schemata basi set candid client queri individu web extens data cach avoid result excess number candid remot queri manag run side side standard web manag queri execut handl present result client schema suit smooth migrat internet web site produc basi hypermedia design gener methodolog publish chapman hall semant approach structur queri web site introduct steadi growth amount data publish world wide web led number attempt index web content attempt collect index inform reachabl page data build boolean keyword search find web search engin reli term index search engin present sophist queri result deliv perceiv user commun unsatisfactori situat due ffl effect current queri languag interfac suggest semant underli keyword search mechan remain syntact natur prone silenc sophist index techniqu exploit html tag reliev mean solv complet ffl flat result queri result lat list page captur underli structur search web site retriev inform easili present user effici reorgan ffl object index presenc object attach web page multimedia clip java automat index construct updat suggest complement search support queri web research project address review section outlin approach differ base ffl avail schema prerequisit develop effect queri schema carri semant inform queri ffl methodolog design web notion schema present site design process introduct logic descript languag mix descript languag publish tool ms real web page figur link conceptu hypermedia descript languag paper site design artefact attain construct schemata web site outlin figur popular author environ web site hint idea sort navig schema chosen user basi automat site gener research prototyp web site gener base hypermedia design languag design suggest possibl semi fulli automat gener schemata design smooth migrat organ web site produc basi standard design gener methodolog web site schemata form distribut manag server process call schema robot schema robot server process inform web site store present semant approach structur queri web site client execut net paper elabor site classif worthwhil remark schema robot set domain schema robot form distribut partit repositori schemata categori schema robot search robot regard browsabl hypertext provid semant rich inform web site hypertextu structur regard simpli schema avail searchabl schema repositori prove contribut web restructur resourc index system queri formul wrt site advanc client formul queri order formul execut step schema identif schema retriev queri formul instanc retriev present result describ step detail ffl schema identif queri web formul basi schema order user identifi suitabl schema wrt plan facil schema thesauru robot site thesauru intend provid browsabl control vocabulari user acquaint schema data dictionari note number store schemata automat thesauru updat crucial robot perform ffl schema retriev inform provid schema robot search engin identifi candid schemata user graphic user construct queri schemata identifi recept user robot consult instanc cach discard site desir inform cach valu select attribut ag mechan requir ensur consist result step list web site valid refer network address queri manag process introduct queri client search engin area http http list entri remot site area client area queri filter condit queri filter condit queri point list queri manag id scheme logic instanc cach queri manag queri manag queri recept scheme robot instanc cach manag figur system architectur ffl instanc retriev queri broadcast queri manag run candid web site candid web site base underli queri manag process provid interfac exist dbm queri manag maintain copi schema index inform link navig entiti list url result instanc comput target effici critic term time comput result instanc amount gather data origin site ffl present result step perform gather present result basi data structur map html page navig part schema interest amount inform result instanc huge user present synthesi organ result instanc perspect synthet result submit user enabl formul goal select inform comput transport origin site figur summar system architectur paper organ semant approach structur queri web site section present survei exist section describ data model languag section present naiv comput section draw outlin futur research subject relat work huge amount data publish world wide web led number research effort queri restructur www site content section provid overview relat work discuss previou work base approach deal semant figur summar overview ffl free text index semant earli approach web index collect index inform reachabl page data www build boolean keyword search result document system design index www collect inform mark html page encount current web search engin partial base search result flat list html complet unrel hypertextu structur site past amount www data continu user grew unsatisfi pure keyword match find web search engin reli term index world wide web worm webcrawl lyco complement keyword index account html document structur order make educ guess semant lyco summar actual content document advantag inform keyword introductori text gener posit begin file ffl semant taxonomi search engin keyword index exploit taxonomi repres site content popular yahoo search engin reli broad hierarch classif system similar librari congress acm classif comput scienc topic yahoo success spawn multipl similar base idea provid monolith server hold index site content magellan evolv taxonomi develop consortium order exploit taxonomi classif free text obtain power relat work figur classif research approach www queri semant approach structur queri web site fledg servic savvysearch built power index altavista queri servic parallel aggreg result search engin present sophist queri result deliv perceiv user commun unsatisfactori ffl structur site amount research made complement search support queri web project address main www queri languag websql weblog languag model standard sql retain flavour datalog languag languag give small fraction power origin queri languag base explicitli refrain semant issu websql offer standard relat web easili construct html tag user present queri web site base relat relat queri map search convent search engin addit similar queri offer elementari graph pattern search user search simpl path graph repres navig structur web site weblog instanc techniqu lead power deduct queri fulli equip lack data semant ffl semant nowadai wide recogn effect build develop sort semant structur web site order support effici inform captur subject semant web site activ investig techniqu semant semant extend html tag repres semant inform basic idea underli approach kind html tag semant standard navig structur web site semant tag refer entiti data store web page denot relationship semant link meant navig queri variat semant tag idea research present html standard relat work partial effect queri support base semant tag approach address problem web index queri gener framework deal data tsimmi system oem object model repres semistructur inform power queri laurel web user defin oem class tsimmi extract techniqu base textual filter initi object web page data tsimmi addit dataguid facil identifi regular extract instanc produc site schema explor translat dataguid schemata order add queri capabl tsimmi site ffl semant partial except approach lack explicit notion schema due fact advantag queri formul wide recogn techniqu consid www schema inform web site situat evolv number design design methodolog methodolog design web notion site schema present site design process commerci author environ web site hint idea sort navig schema user basi automat site gener research prototyp web site gener base hypermedia design tool translat site schema relat semant base standard relat schema araneu project web site crawl emploi induc schemata web page fine grain page schemata combin build relat view relat view queri standard sql autonom web site worth observ araneu approach schema induct requir web site data convert relat tabl queri instanc schema web site data remain form semant approach structur queri web site graph descript languag web data model design methodolog hypermedia applic wide emploi develop applic convent design entiti modern hypermedia specif languag present navig indic entiti present user approach justifi fact queri support gener offer hypermedia base free user navig effect descript manipul languag web site complement hypermedia model queri capabl section describ languag support data model structur entiti graph integr part design introduct data natur connect graphic interfac formal basi languag design object includ node type repres abstract concret link type logic gener extend includ standard hypermedia design notat link conceptu entiti relationship navig concept www page link schemata cleanli denot logic structur concept possibl hypertext featur index page entri essenti relat hypertext present style section inform present data model languag formal definit exampl found refer found hypermedia design languag present direct label graph formal repres web site view call access queri node graph stand object edg relationship object instanc queri distinguish kind ffl slot call concret depict object instanc slot sound movi movi frame desir granular ffl depict abstract object note abstract object chosen correspond web possibl link graph descript languag web data model ferent design decid level granular schema meant ffl repres rectangl set horizont collect aggreg gener type instanc node index painter galleri case collect ffl entri depict repres uniqu page access portion site altern view instanc site home page entri point type correspond node site instanc worth notic entri point collect node queri creat access structur provid altern present web portion distinguish kind graph ffl structur repres navig link edg stand link collect node repres painter index entiti type ffl logic repres logic relationship edg connect painter paint presenc logic relationship necessarili impli presenc navig link entiti instanc ffl doubl repres navig link coupl logic edg connect painter indic navig link paint reach ffl repres inherit relationship edg connect painter artist note edg make instanc queri level lexic figur show schema figur www site url descript easili obtain part design process html page shown figur note entiti schema mark uniqu code exploit queri execut schemata schema inform structur web site includ object web semant approach structur queri web site navig link coupl link index entiti slot link isa logic link relat relat figur lexicon relat valu logic navig element includ site flexibl choic level detail index entri point relat hypertext present design hypertextu aspect element design interest conceptu content site schema node granular entiti chosen repres site page instanc site entiti professor schema map instanc page page page refer professor differ link constraint implement graph descript languag web data model site period monument author street squar string imag text imag string string text text isa isa home descript photo isa descript map biographi figur schema avail queri time inform instanc refer schema entiti schema ffl set entri point label ep ffl set sl concret object ffl set entiti special label ffl set col collect ffl set logic edg ffl structur edg label sel practic ffl set del doubl edg ffl edg label ffl set product product dictat structur instanc actual product tripl repres type edg instanc graph compon product belong col ep object relat object compon edg label requir product form set duplic product schema semant approach structur queri web site string string string string string string string string string string string string string string string string string string monument bra author period street squar street arena roman della bra roma home start point period period period period author author author monument street squar gran erb monument monument monument monument figur site instanc compon object label type edg label node label belong web site schema repres direct label object node product edg note node connect edg multipl logic edg connect repres relationship presenc structur edg node repres presenc navig direct link page site connect structur edg isa meaningless assum function associ slot label set domain slot type imag set jpeg file instanc instanc schema actual inform store web site page direct label graph set label node node repres object type label label node belong ep sl graph descript languag web data model figur page trial site semant approach structur queri web site col ep entri point label concret node abstract coincid part site collect mean aggreg homogen object addit label call print constant set direct label edg edg node denot ff label belong del edg conform product belong assum implicit equal edg logic edg equal sign node instanc figur instanc schema figur rule program queri node belong node type edg doubl structur pure pure navig wrt queri select monument work author list page site link distinct node interest remark techniqu open interest possibl mix list work index page author queri result transform perform instanc program goal queri restructur inform inform web site page rule arrang program view web site user horn rule repres implic distinguish bodi rule head graph repres part correspond bodi color part correspond head green paper black thin line red node edg thick line green figur rule web site schema figur express find monument author note result collect node build access structur result instanc applic rule site instanc produc minim satisfi instanc satisfi rule match red part rule instanc extend match rule instanc match rule instanc call note dummi node schemata instanc note isa edg instanc rule program author string result monument monument index figur solid rule string result monument author period string figur rule involv negat instanc figur satisfi rule figur red part monument pertain connect case satisfi extend minim satisfi effect rule applic creat link node sel instanc satisfi smaller result queri rule note obtain access structur node result link retriev node altern initi instanc sequel express order filter inform instanc obtain queri rule negat solid line repres posit inform dash line repres neg inform rule red solid red dash green solid rule figur express queri find monument period author instanc figur satisfi rule rs part applic semant approach structur queri web site extend rs part connect extend found gs part case rule goal formal defin rule instanc satisfi set rule rule construct pattern pattern web site schema similar instanc schema pattern equal edg occur pattern concret node print pattern entiti node dummi refer gener instanc node pattern denot graph match part instanc equal edg node map node instanc color pattern schema pattern node edg assign color gs color pr red solid part red part solid part gener color part pattern dangl edg requir subpart pattern rule consist schemata graph call sourc refer target color pattern pr pattern figur color pattern sourc schema figur target ad defin instanc satisfi notion pattern ep instanc total map np node np hold ffl ffl product target print edg ep edg pattern instanc extens constrain equal extens defin respect set rule program notion express constrain pattern extend pattern rule color pattern target instanc satisfi pr constrain extend inform mention instanc figur satisfi rule figur pr constrain extend extend express complex queri combin rule sourc target set set finit set rule work schemata call sourc target gener satisfact case rule set straightforward set target instanc satisfi satisfi rule goal goal schema select inform web site goal combin queri remov uninterest inform result instanc effect appli goal schema instanc call restrict maxim instanc definit satisfact set easili extend set goal set target instanc satisfi goal exist instanc satisfi jg program semant strong connect order predic calculu shown formula binari sort order languag effect procedur transform set rule trivial true graphic counterpart logic syntact variant semant retain order express power correspond hold instanc rule figur express order logic note simpler languag datalog captur express power datalog rule express simpl rule red solid node green edg express semant translat datalog previou semant approach structur queri web site section defin instanc satisfi rule examin logic counterpart intuit mean order queri languag defin act instanc produc infin instanc satisfi rule result semant set sourc target binari relat instanc defin instanc instanc satisfi jj satisfi condit item express requir updat rule red dash green solid satisfi ad red dash part instanc ad green solid part item sourc schema chosen extens semant rule depend sourc schema item express minim gener minim result appli set correspond fact sem relat function sequenc set rule program finit list set target schema set equal sourc schema set program sourc schema set sourc target schema set target semant program ha set pair instanc chain instanc belong number rule put sequenc minim appli fewer minim model sequenc make set rule determinist goal conjunct program target goal semant goal jg complex level construct express queri set conjunct goal result case state tabl figur complex level complet produc desir instanc suffici express interest queri pose web import queri requir full languag complex rule program goal goal rule rule rule goal set rule set set goal sequenc set rule program program goal figur complex level queri figur complement navig transit closur find pair node unreach pair transit closur relationship express label sel easi natur solv queri comput transit closur complement relat program figur solv problem sequenc set rule consist add node link set rule complement transit closur ad goal ad select node pair link relationship interest queri node reachabl specif instanc page artist program complement goal figur note goal optim scope paper semant approach structur queri web site figur goal complement navig transit closur evalu program order express rich set conceiv languag complex rise comput algorithm gener ineffici case queri express possibl goal contribut improv effici program comput subsect present comput algorithm gener present queri base simpl data flavour real complex system toler improv futur work studi data optim base goal offer possibl effici naiv approach present gener comput algorithm present comput result gener set kind backtrack fixpoint techniqu set rule sourc target finit instanc procedur extend instanc finit print call function extend add element satisfi extend anymor satisfi function backtrack point made choic number minim extens continu minim choic function backtrack solut remind procedur comput stabl model procedur evalu program function rule satisfi due minim extens ext ext minim gs extens ext ext select ext add ext return remov ext return return algorithm notion minim instanc extens node edg belong minim subpart extens suffici make extend denot set pair instanc output input prove algorithm sound finit set note complex account high express power languag algorithm reduc standard fixpoint comput program graphic counterpart set rule consist red solid part green solid edg effici comput easili achiev optim express queri pose semant approach structur queri web site rule evalu briefli comment execut queri sampl queri execut base data ffl matrix instanc graph ffl instanc tabl link schema entiti instanc ffl url list ul link instanc html page network object role instanc tabl respect similar ontolog introduc entri matrix list type link logic connect pair node sake figur show binari matrix entri instanc link navig logic relationship row column pertain slot list store slot suffici store auxiliari data structur pertain singl order fast label match associ uniqu code schema entiti list uniqu number call instanc queri manag trace instanc entiti instanc graph url list associ instanc identifi http url mean approach entiti necessarili singl frequent case respect sampl queri figur monument period author francesco remark initi valu paramet instanc figur singl rule figur sourc schema figur target schema queri easili deduc rule omit start consult obtain identifi instanc entiti match rule entiti list period monument list extract equal test label leav red solid part readi follow tree call extend sampl execut depth turn case call extend evalu program figur simplifi version adjac matrix figur sampl instanc tabl semant approach structur queri web site satisfi rule red dash valid instanc monument relat green solid valid result iter call extend satisfi rule red dash valid green solid valid result iter call extend satisfi rule satisfi rule red dash valid green solid valid result iter call extend satisfi rule satisfi rule return true return true return true return true instanc obtain solut queri conclud remark futur work experi current www search engin shown avail schema prerequisit effect web queri mechan fulli awar system paper preliminari step satisfactori solut web structur queri conceptu basi sound develop offer interest subject futur research import issu queri execut made effici special account goal schema inform possibl relat underli semant properti enabl schema robot priori trivial unsatisfi queri conclud remark futur work retain express power origin carefulli tune execut mechan requir complex check avoid deal queri involv kind transit closur critic topic present effici problem heterogen qualiti inform sound track similar piec inform arrang shown user coher understand architect skill softwar design plan deal futur queri feder web site plan web user formul queri basi site schemata extend queri execut mechan account link distinct web site plan address time difficult problem schema deduct basi instanc schema integr unrel schema updat instanc effect treatment instanc schema graph assum huge proport acknowledg author put forward idea gave rise present research due franca discuss subject student michel baldi fabio contribut design develop schema robot part master anonym paper care read comment earlier version refer search atzeni mecca merialdo structur data back balasubramanian bang min systemat approach design www cacm world wide web resourc ieee tran knowledg data eng damiani mg automat thesauru construct support fuzzi retriev reusabl proc nashvil home fletcher semant approach structur queri web site fraternali automat gener web applic declar hammer access heterogen inform sourc proc st design langag evalu cacm pedreschi deduct data model repres queri semistructur proc workshop logic program tool internet gyssen paredaen van der bussch van gucht object ieee tran knowledg data hamilton ieee comput hu nicholson gener web interfac build proc dexa workshop edward languag structur hypermedia cacm konopnicki shmueli queri system world proc intern conf larg zurich lakshmanan sadri declar languag queri restructur ieee comput soc press davison enhanc web logic visual retriev environ hypermedia inform acm tran inform luke spector rager hendler web lyco catalog tool tame proc annual www geneva internet conclud remark futur work mendelzon mihaila milo world wide proc confer parallel distribut inform toronto paredaen tanca declar ieee tran knowledg data paredaen tanca ieee tran knowledg data eng pinkerton peopl experi webcrawl proc annual confer compass fact zaniolo model logic program proc pod sagiv shmueli multipl facet www selberg etzioni search comparison proc fourth intern www di il world wide proc world wide web specif work
IR/515 5 label document cluster pennsylvania moor south str pa abstract ungar pennsylvania moor south str pa automat label document cluster word topic difficult commonli label frequent word end word virtual void descript power tradit stop word remov label predict includ obscur word present method label document cluster motiv model word gener hierarchi mixtur compon vari gener method assum exist document hierarchi construct result hierarch cluster test detect word usag categori hierarchi method select word occur frequent cluster effect discrimin cluster cluster compar method abstract document select subset hierarchi cora search engin comput scienc research paper label produc method show superior result commonli emploi method document document statist introduct rapid growth world wide web research aim facilit organ text document work direct cluster document group set hierarchi document user prefer quickli collect identifi cluster interest examin document detail cluster base approach larg document collect cluster label provid frequent word remov stop list frequent word reveal topic high fail depict detail call collect specif stop word collect comput scienc research term present frequent common comput scienc give addit inform document comput scienc research paper word predict cluster call salient word word disambigu infrequ word high salienc suggest topic simpli word low frequenc word remov exist bodi work aim learn organ hierarch topic word document assum word document follow distribut pattern ascrib compon rang gener specif research wai label cluster reduc elimin problem mention method difficult implement label prefer simpler method label cluster cluster label titl paper central cluster label idiosyncrat fail provid insight qualiti cluster present wai select word cluster label avoid problem method assum exist document manual construct hierarchi result applic hierarch cluster algorithm test independ node hierarchi start root determin set word equal occur children current node word gener current exclud form node method select word occur frequent cluster effect discrimin cluster cluster method method test suit test depend count data main idea method test word node hierarchi start root move hierarchi reject hypothesi word equal occur children mark gener current assign current bag specif word remov node current node detail descript algorithm hierarchi document leav bag word document leaf union neglect account length significantli affect result popul intern node union bag word children start leav move start root word perform test discov test reject independ conclud word probabl occur children specif categori test fail reject independ conclud word equal occur children retain word current node gener root current node remov word node node test repeat step move tree leav hierarchi word isomorph initi hierarchi node word specif node occur current node label list frequent word node cluster document label result present frequent predict word method predict method word select label base product local frequenc fail conclud word probabl occur children combin local frequenc predict yarowski select import word categori illustr approach word disambigu method label document cluster formula consist part defin similar mutual inform estim measur inform retriev distribut weight word occur frequent cluster weight word occur frequent frequenc word cluster frequenc gener categori collect word receiv high predict valu good discrimin distinguish cluster word select formula tend occur cluster specif cluster avoid label gener frequent word word obscur select predict subject constraint statist minimum number list frequent word good result product predict select word high scale section present result comparison method result document experi chosen abstract comput scienc research paper retriev cora search servic subset hierarchi consist paper artifici intellig inform retriev obtain level deep root artifici intellig inform retriev figur £ ¤ ¤ ¥ figur cora hierarchi subset ¥ ¥ ¥ ¤ £ ¥ ¥ ¥ ¤ ¤ ¤ ¥ ¥ ¤ ¥ £ £ ¤ ¤ ¤ ¤ ¥ £ ¤ ¤ ¥ £ ¤ ¥ £ ¥ ¥ ¥ £ ¥ abstract semin paper present cora union stem standard porter stemmer stop word word occur time remov result uniqu word larg data serv feasibl demonstr method low count follow frequent rule appli count greater test perform level test case detect depend children word retain root gener document collect twenti frequent develop word gener comput scienc research paper level test retain fewer perform level relax depend rigor word retain inform retriev retain artifici intellig reason fewer word retain fact branch factor higher inform retriev artifici intellig fewer word common inform retriev artifici intellig remov gener word possibl disciplin terminolog vari substanti subfield clear artifici intellig unifi disciplin simpli histor reason field robot natur languag process vocabulari point leav gener word exclud repres frequent word remov gener tabl present ten highest rank word label frequent predict word method compar frequent word method predict word method inform retriev intern node ten word receiv highest score predict word method tabl result tabl ten word serv label produc predict word method chosen randomli word receiv highest score tabl inform retriev frequent predict frequent inform text retriev learn perform paper user result alloc area attribut comput cooper effici environ increa io predict text inform retriev user web relev librari variant word occur frequent collect successfulli frequent predict word method web import word inform retriev occur ten local frequent due high predict frequent predict word method appli method avoid includ word approach al predict word label complet fail reveal topic cluster result intern node intellig machin subcategori artifici encourag gener attribut fact categori check intuit rel inform label leaf conduct small test peopl phd student comput random list label rank scale believ label repres topic frequent predict word method receiv rank method receiv rank frequent word method predict word method receiv lowest rank averag rank frequent predict frequent predict word method tini sampl exampl leaf node label ten tabl tabl entitl cora rest cluster label show similar result tabl natur languag process frequent predict learn paper model approach word algorithm present inform languag bank cooccurr cue flat grammar lexic resolv symbol tagger learn model word algorithm inform languag tag corpu research frequent predict tag text linguist lexic par corpu tagger word syntact grammar tabl robot frequent predict frequent robot paper environ task plan behavior research control learn actuat configur distinct give mobil multirobot obstacl rhino sensor sensori robot environ plan behavior research control learn describ perform tabl agent frequent predict agent inform paper task distribut present model problem environ action call capabl distribut econom fac partial present situat inform distribut model problem environ comput research plan coordin predict robot mobil sensor commun map environ manipul behavior topolog navig frequent predict agent distribut coordin multiag mechan team cooper negoti exchang ration note word agent part list cluster tabl occur agent similarli inform retriev artifici intellig abstract retain root regard version worth check occur tabl data mine frequent predict frequent data rule databa algorithm mine associ method larg discoveri column discov interest item partit pass scan specifi rule algorithm mine larg discoveri problem gener effici cluster predict databa mine rule data associ discoveri discov frequent cluster larg tabl genet algorithm frequent predict frequent genet program problem algorithm function crossov result paper ga balanc binari block correl crossov implement initi popul schema tradit genet program problem algorithm function crossov ga fit evolv tabl rule frequent predict learn algorithm exampl problem method theori search paper result claudien horn idea ilp liter outlin stop view learn algorithm problem theori clau program rule logic induct predict genet program crossov ga fit evolv gp encod oper popul frequent predict clau logic induct posit exampl special learn prune search ilp tabl speech frequent predict frequent speech recogni model word speaker perform probabl system error asr baselin filter incorpor phone phonem spectral syllabl utter speech recogni model word speaker perform probabl error recogn tabl digit librari predict speech recogni speaker word pronunci recogn rate signif speak spontan frequent predict frequent server librari inform digit imag perform user queri data bandwidth coeffici file increa map materi multipl respon solut www server librari inform digit imag user queri web process server digit librari imag distribut metadata search schedul servic request futur work paper present method label document cluster select keyword frequent word method produc captur word occur frequent cluster effect discrimin cluster method outperform label frequent word method successfulli identifi set collect specif stop word common collect part tradit stop word lack descript power document collect method check word frequenc differ child node lend poor perform hierarchi high branch factor method improv check subset child node word similar frequenc exclud word children retain children method gave uniformli satisfactori result intern node hierarchi featur document show disciplin intern inform artifici machin vocabulari encompass broad topic acknowledg nec research institut partial support work refer approach larg document collect intern acm sigir confer research develop inform page distribut cluster word text st annual intern acm sigir confer research develop inform retriev pp appli multipl mixtur model text thirteenth intern confer machin pp san morgan kaufmann disambigu statist model categori train larg corpora pp distribut cluster english annual meet associ comput pp improv text classif shrinkag hierarchi fifteenth intern confer machin morgan kaufmann learn repres hierarch mixtur model word occurr document confer autom learn workshop learn text cmu build search engin machin learn spring symposium intellig agent cyberspac statist data prentic pp element inform york wilei develop automat text scienc comput scienc research paper search algorithm suffix
DB/516 3 base architectur semant integr heterogen inform sourc richard eindhoven technolog netherland abstract integr architectur aim exploit data semant order provid coher respect conceptu view integr heterogen inform sourc architectur split separ layer assur provid interfac favor lazi retriev paradigm data wareh approach novelti architectur li combin semant driven retriev line attack offer advantag bring discuss respect underli model relat work vast world wide web year integr heterogen inform sourc hot topic solut integr problem design applic provid uniform access data obtain sourc web paper address architectur combin issu retriev semant metadata retriev principl paradigm inform data wareh retriev data wareh approach data collect central repositori user queri bring consist scalabl problem driven approach collect data integr sourc dynam queri evalu mix project implement xml view integr lazi approach evalu queri xml queri languag specif design semant integr xml enorm success wide accept standard mean serial data advent semant web data expect machin target interpret xml show limit state major limit describ grammar author xml document freedom defin languag primit arbitrari assign semant describ conceptu domain model mind xml rule descript wai denot semant hard reconstruct semant mean xml document document metadata descript metadata describ field extern mean document semant metadata content document kind extract semant data rdf rdf provid standard mean describ descript semant metadata top primit ontolog languag oil built languag describ domain identifi hierarchi concept relat axiom deriv fact exist ontolog semant interfac access heterogen inform sourc introduc gener inform integr architectur project involv build ontolog base tool knowledg manag provid architectur semant integr eager approach approach context project aim automat gener multimedia present user queri heterogen inform goal design implement integr architectur base semant integr inform retriev approach offer advantag bring discuss respect underli model architectur main architectur serv provid semant unifi interfac queri heterogen inform sourc aim merg sourc provid cumul view attribut argu approach offer weak understand semant structur integr sourc effect left user queri underli domain model consist hierarchi possibl axiom assum exist conceptu model maintain central schema dynam popul instanc queri resolut cm correspond ontolog repres semant integr integr data sourc directli rdf rdf extend higher level ontolog languag creat cm ontolog engin tool main advantag underli semant model data structur sourc transpar queri interpret result term concept xml queri express term structur shown figur architectur divid separ address section layer xml instanc layer xml rdf layer layer applic layer wrapper ¤ xml xml queri data broker xml domain model rdf ¥ queri data agent rdf queri ¥ data queri wrapper rdf ¥ queri ¢ web £ sourc broker ui data req mobil pda pc km km xml xml queri data rdf queri ¥ data mediat rdf queri engin info request ¥ data present adapt ¢ ws rdf queri data broker rdf queri ¥ data rdf queri ¥ data extern app figur architectur facilit semant integr heterogen inform sourc sourc layer sourc layer extern data sourc relat object html xml possibl rdf base sourc target applic assum fairli gener sourc distribut web main requir sourc abil export data xml serial wrap process achiev scope paper xml instanc layer layer offer serial xml data result previou layer wrap layer consid note assum xml rdf rdf schema ontolog languag xml structur xml data sourc compli leav xml wrap process sourc provid layer layer consist broker provid bridg xml instanc layer mediat design tailor broker sourc map xml sourc underli cm map broker resolv queri mediat establish map xml instanc cm requir identifi schema extract concept sourc describ reconstruct semant term cm relat identifi concept concept cm difficult autom insight applic design step difficulti vari base sourc encod xml concept sourc schema shown figur case broker sourc encod concept attribut dtd xml data shown broker sourc rdf format xml encod adher convent implicit rdf interpret xml file step larg extent autom tool emploi design accomplish step relat concept model provid actual queri requir broker poll sourc data creat rdf triplet triplet instanc atom fact relat data item concept cm figur provid small conceptu xml sourc map left part depict cm rdf encod describ hierarchi class properti note due space limit provid properti class present xml sourc map rule extract relev portion inform sourc relat cm rule languag intuit syntax rule consist side side data transfer posit variabl denot declar begin process instruct make applic awar infer mediat rdf mediat central compon architectur maintain queri infer support result cm consist class hierarchi class set rule correspond axiom class properti appli rule set fact infer fact rule express instanc rule express person affili compani consid languag map xml document affili xy cm rdf relat facil factori conceptu model distanc place person home rdf rdf class tree properti person class sourc dtd person firstnam lastnam address broker map rule sourc result result cdata id id attr attr id broker map figur map sourc instanc conceptu model rule design note maintain global cm applic feasibl scalabl distribut approach instanc architectur cm serv input sourc architectur bring scalabl environ www mediat rdf parser queri decomposit queri inferenc support actual mediat implement analog dom modifi rdf data model label mediat receiv queri applic layer proce analyz resolut demand infer rule appli fact evalu infer rule note infer engin assum fact contradict retriev approach initi queri enrich retriev fact enabl infer engin appli rule queri subqueri distribut broker actual queri trigger navig request applic layer collect data appli infer construct send applic layer applic layer numer applic advantag semant unifi interfac provid architectur type applic vari search agent hypermedia guid user queri composit cm produc queri hypermedia present support adapt applic instanc similar architectur maintain similar architectur instanc data sourc solut problem integr heterogen inform sourc order provid uniform access data gather sourc web integr architectur combin semant metadata retriev offer semant interfac access heterogen inform sourc possibl infer mechan deriv provid integr sourc enabl inferenc retriev introduc bottleneck fact infer engin retriev request room optim investig problem context verifi idea implement prototyp refer framework lazi mediat cm workshop web simpl rdf interpret tim mark weav chapter machin page san stefan sergei frank van dieter michel michael ian horrock semant role xml rdf ieee octob ricardo editor modern inform chapter text multimedia languag page acm van klein oil nutshel european workshop knowledg manag lectur note artifici intellig witt access inform sourc www world confer www internet van van der horrock tool knowledg manag ebusi octob automat gener hypermedia ad hoc data heterogen legaci inform system engin feder inform page aka io sergei bridg gap rdf xml technic stanford onlin hiroshi kent tamura xml chapter sampl nontrivi page michael georg jame wu logic foundat languag journal stefan dan angel queri infer servic rdf queri languag workshop paul de bra automat hypermedia gener ad hoc queri data acm digit page paul de peter system framework acm comput
IR/517 5 machin learn knowledg discoveri applic knowledg discoveri text yve kodratoff lri univ orsai cedex text deliv summer crete juli publish lectur note ai tutori summari present goal goal compar ml knowledg discoveri data call data order insist differ order make idea easier includ descript research topic find relev kdd kdd goal show definit give kdd directli appli text lead restrict definit knowledg discoveri text provid compel set rule obtain call kdt techniqu introduct kdd data mine academ interest dm develop method extract knowledg set data expert interest kdd process data data transfer dm appli dm valid result dm final interpret user process cycl improv critic expert machin learn kdd common strong link acknowledg import induct normal scientif field reluct accept explor common point reluct reli appar contradict insid theori revisit paradox order explain avoid bad analyz restrict larg common point develop acknowledg definit show appar innoc approach exploratori statist speak classic statist possibl perform induct speak deal classic scienc criteria knowledg valu scienc knowledg accept criterion valid knowledg accept individu eleg eleg equat illustr famou minimum descript length principl favor descript amount bit encod claim frontal evalu model knowledg primarili understand principl mdl draw enorm amount bit prefer casual user reason induct ml kdd reli heavili induct process scientist show kind blind faith favor deduct argument recent present blind deduct process complex hope achiev approxim approxim model obtain object ground stick deduct paradox theori confirm underlin exist contraposit theorem shown exist contraposit prove theorem confirm simultan observ simultan observ negat negat confirm observ confirm observ thing confirm hypothesi confirm count instanc simpli induct absurd order show induct induct complex chain reason step analysi complex lead understand condit safe confirm perform summar argument remark specif semant paradox hold depend semant implic rel descript properti black theorem logic mean call correl habit call theorem deepli ill call problem discuss implic carri causal mean implic carri mean causal implic repres causal probabl point call paradox observ smoke cancer confirm notic spuriou introduc instanc theorem french confirm observ smoke french cancer mean german cancer confirm theorem simpl analysi correl show easili nation link smoke cancer strike problem recent french paradox state higher count american die heart attack call paradox fact french causal found typic french habit disput argument argu conjunct instanc confirm smoke cancer confirm person drink cancer medic logic conjunct drink effect smoke confirm independ state paradox origin knowledg lead special link theori confirm theorem logic confirm condit simultan stress heart disjunct contraposit longer paradox case causal absurd confirm avoid care examin mean implic simpl count statist method avoid easili trap paradox practic consequ show scienc build theori spite paradox show confirm measur automat perform implic inherit properti semant coupl confirm coupl disconfirm probabl confirm estim count number item count total number approxim implic causal semant confirm coupl disconfirm coupl strength confirm approxim remark explain classic definit coverag confid section make knowledg discoveri data recal acknowledg definit kdd canon kdd dm scientist definit introduc concept ml discov knowledg request interest ill insist consequ refin definit ad concept issu defin kdd melt pot previou includ ml ml scientif field base valid measur accuraci kdd measur simpl practic import kdd cycl step step good scienc step mere engin acknowledg definit kdd kdd extract potenti unknown knowledg larg amount data insist larg amount data treat simpli impli algorithm fast trend comput scienc accept requir detail comment develop consequ unknown knowledg measur interest section develop person point view kdd unknown knowledg unknown knowledg implicitli statement wrong find knowledg contradict exist effort machin learn statist aim find knowledg contradict exist principl underli develop success induct logic program creat contradict exist success ilp due automat integr invent model bodi exist knowledg due fact resolut work resolut call process resolut similarli process invent relat hold clear contradict bodi exist knowledg point avoid contradictori knowledg common charact approach includ form induct reason interest nugget knowledg contradict larg bodi consid interest discov larg number rule consid typic trap kdd system avoid knowledg stress import goal acquisit knowledg induct intellectu danger process tightli control obviou goal avoid invent trivial academ research neglect view paper deal exist research field develop techniqu pretend user specif call mere engin scienc research kdd commun account requir test rel pattern discov data larg measur result classif true deal finit set cardin total number exampl total number line infer measur provid estim valid implic measur statist measur comput relat cardin classic measur support confid kdd system discov associ measur convict interest recent introduc definit account differ causal descript implic introduc order illustr small data set tabl valu illustr measur perform data set refer result causal support descript confirm causal confirm causal confid depend put causal depend causal support descript confirm causal confirm causal confid depend put causal depend causal support descript confirm causal confirm causal confid depend put causal depend confirm directli number instanc equal number instanc repres mean due level contraposit confirm higher level descript equal confirm number women short hair approxim women long clumsi recogn woman length hair number men long hair order recogn order recogn woman hair length causal relat contraposit number women long hair number women long hair measur relat relat implicitli classic measur confid high descript implic low real causal implic kind case contraposit equal absolut certainti illustr limit valu illustr norm coeffici show classic depend measur strength causal confirm contraposit partli account case correl classic depend measur measur mean disconfirm correl confirm reject hypothesi illustr typic case directli interest rel illustr case measur useless implic contraposit support support implic express true measur size intersect divid size algorithm detect associ perform kind count base formula gener import support stress present measur implic terabyt data happen confirm number danger implic small interest show behavior varianc normal explain intens present implic care account effect random definit support classic impli descript implic case causal claim approxim mean support measur present literatur approxim notic ad confirm comput amount comput finit world account simultan indic causal support account size behavior displai descript support causal support higher descript confirm contraposit depend semant implic descript notic mean confirm disconfirm independ case equal causal notic wai approxim causal confirm case account confirm case causal confid descript support divid order express fact largest expect impli relat equal implic absolut trivial data set confid approxim definit confid posteriori probabl high confid entail low confid believ interest introduc explicitli number exampl contradict critiqu definit definit confid depend order measur strength depend claim measur strength adequ probabl case confirm doubt descript confid depend confid depend valu high descript implic definit descript confid equal depend confirm disconfirm defin implic confirm disconfirm disconfirm implic neg data support hypothesi implic measur add confid brought direct instanc confid brought contraposit coeffici stem fact posteriori probabl equal link link introduc valu chang confid interest critiqu critiqu definit account disconfirm case causal confid high implic show amount disconfirm norm coeffici equal instanc case causal data confirm weakli implic measur introduc goal express confirm hypothesi ignor differ causal causal implic true implic largest lowest convict largest largest convict intersect due simpl convict favor largest support largest convict measur valid descript implic probabl interest intersect expect larg ratio condit probabl written measur valid descript implic classic measur measur valid continu variabl correl coeffici variabl real valu xi yi item data base mx varianc correl defin mx intuit measur xi yi tend correl call depend deal discret valu depend ab function probabl occurr practic mean probabl meet ab measur strength depend approxim ab critiqu probabl meet confirm complex definit depend put causal put causal depend defin consist depend time causal depend occur definit conveni time relationship causal variabl depend time twist medic skin sexual habit case happen di heart smoke heart start habit smoke habit act reinforc exist particip death approxim comput depend fit causal author explicit approxim measur imposs check error approxim find eleg give definit causal correct approxim link classic definit express fact occur true complet account topic direct theorem occur high posit occur highli neg theorem occur high posit occur highli neg definit put causal depend comput notic main differ definit classic happen relationship highli confirm contraposit occur case forgotten classic measur happen relationship larg confirm larg disconfirm due accept classic measur reject exemplifi kind remark made confid appli classic measur depend explicitli account disconfirm depend explicitli contraposit definit exhaust case defin put causal depend indirect spuriou spuriou causal spuriou case comput lead accept impli true causal implic hold realiti causal frequent hold higher classic definit spuriou causal depend mine data rel umbrella grass grow find implic rain grass rain umbrella sale problem data inform umbrella sale grass fact occur posteriori probabl grass grow umbrella sale good instanc put causal link probabl grass grow rain umbrella rain definit differ measur spuriou depend confirm directli differ ab accord measur defin differ confirm depend confirm depend occur claim causal measur exist causal link extent slightli definit condit definit definit natur definit condit depend account contraposit exact amount badli evalu classic definit case real real found indirect causal depend case symmetr case find causal flow implic valid show posteriori observ carri causal hypothet rel insecur sugar tooth decai data convei theorem insecur feel sugar sugar consumpt tooth decai data lead insecur feel tooth decai observ probabl tooth decai insecur feel sugar consumpt probabl tooth decai sugar consumpt definit differ measur indirect depend confirm differ ab reason definit definit causal tricki problem develop recent introduct bayesian network reli causal structur research definit causal depend due pearl verma time depend variabl causal defin set variabl definit reli comput measur correl valu measur depend discret variabl show correl depend call independ comput build causal global compat independ simplest call causal scheme present definit causal call reli albeit reason net put causal depend high put causal depend high low low put causal depend put causal depend note comput impli net variabl imagin instantan data gener causal smoke causal place cancer observ causal place case case place true start true individu true entail true show effect individu true entail true confirm confirm case exist anymor place cancer long sick person stop smoke decorrel slice popul time observ causal introduc implicitli time count true true bring back case time effect correctli implic high put causal depend spuriou compar put causal depend smallest orient causal link strictli intuit happen measur interest extens attribut link choic featur possibl user reli applic correl measur discret valu featur featur interest user amount interest valu featur strongli correl weakli correl correl measur ab insist imposs classic definit imagin replac featur probabl data easi defin probabl featur varianc σ nu σ sum product nu nv comput usual case number valu measur correl discret variabl formula ab introduc section formula ab ab depend measur product depend variabl interest probabl occurr high formula restrict case data pure symbol case easi measur independ correl continu variabl correl symbol variabl open problem convinc measur depend continu discret variabl prove disprov causal depend typic symbol hair color typic continu measur distanc random choic statist subset set observ subset assert true call support subset assert true support assert contradict assert set cardin randomli chosen relat confirm random choic smaller intens implic measur differ bigger bigger intens implic measur complex calcul simplifi approxim expect random distribut present measur tend poisson approxim lead actual measur intens implic ii dt ii comput observ valu na nb ii na nb na nb show bit complic comput intens implic ¥ extens except rule seemingli contradictori issu data deem interest method coupl assert form contradict real life secur secur combin statist assert interest instanc statist small cover larg confid similar nugget suzuki studi detect contradict problem except similar statist except problem reduc interest explor possibl intens implic interest except fourth extens link feel ad negat rule sharpli statist method coupl assert weakli negat ad kind measur interest context car drive compar alcohol drastic introduct alcohol extens measur interest individu evalu interest set rule global heterogen equat interest add step exist set distant rule set number fix ahead time obviou extens method heterogen set rule maintain fix reach complet set rule merg approach kdd integr knowledg acquisit concaten approach integr method gener scientif dealt scientif field integr deal machin includ bayesian type knowledg queri cognit scienc field develop methodolog specif aspect realiti put crude ml concentr effort small data set noisi symbol valu statist neuron approach work larg data set pure numer variabl bayesian learn causal model problem determin larg number condit probabl real life knowledg acquisit deal repres skill expert data dbm work pure deduct queri discoveri fit larger discoveri process techniqu short tend show give cognit scienc concern comput effici domain improv integr concentr effort solv problem met instanc integr approach illustr larg kdd system found famou intellig miner silicon clementin isl version sa includ visual pleasant accur understand knowledg concept kind intellectu scientist recognit valid measur accuraci includ work symbol aspect measur success compar imagin solut exist method accuraci peopl work push forward idea criteria import call usabl section absolut hear user applic peopl accuraci import academ peopl concern accuraci approach convinc clear definit measur kei futur progress field posit attitud commerci devot effort provid user visual tool user understand exact mean induc tree measur interest begin give object definit interest knowledg unifi theori guess bring wai qualifi explain section work classic minimum length descript principl state model show cumbersom describ chosen lead tree short rule shortest suggest complet definit knowledg featur user depend knowledg express semant option system work directli languag system work intern explan result languag knowledg separ knowledg longer explan shorter minimum length principl side effici side clariti length explan relev factor order find reliabl definit introduc model user measur result fit model measur build model easi task shown difficulti met field ai attempt build intellig tutor field recogn earli build field concern problem epistemolog differ knowledg extract modifi behavior human mechan ground real world solut comput scientist base provid mathemat proof knowledg provid user result kdd softwar directli typic overli stereotyp inform provid olap shop sell kdd system deliv differ shop manag react improv shop illustr inform knowledg definit kdd link point goal doubli import kdd kdd commun silent requir link famou ture problem recent discuss problem show knowledg kei make differ human comput discuss usabl ground knowledg solv problem engin dirti seventh stem practic point view specialist ml statist tend expect clean data work data clean select pure engin deserv scientif attent kdd hold data prepar integr part kdd hold scientif respect step add specialist kdd field hate dirti claim attitud chang condit current academ behavior argument meet requir make measur prove process defin art scienc true exist establish measur measur reach true due strong industri kdd forward eagerli applic engin scienc strong determin kdd commun maintain high scientif level insur safe balanc respect definit knowledg discoveri text express cover kind text due fashion link word real progress commun natur languag process claim syntact semant inform retriev find text set inform extract fill pattern problem easi part gener kdt call give suggest defin kdt scienc discov knowledg knowledg mean kdd section knowledg extract ground real modifi behavior human mechan agent definit introduc kdt problem proper show kdt differ nlp kdt discov knowledg mean induct nlp interest induct appli ml techniqu nlp knowledg understand directli usabl qualifi statist tabl princip compon belong nlp specialist present knowledg tabl transform text start point kdt includ kdt constitut complet kdt system knowledg discov larg amount show kdt aim improv text discov relat hold bodi text give differ section rule describ knowledg year miscellan le mond show kind deep understand articl notic part nlp commun attack problem call knowledg extract statist tool interpret result give set rule discov detail method hope illustr power kdt knowledg text strike discov exist nlp system provid analysi text variat depend tool problem kdt transform usabl data tool french languag sold compani execut analysi text tabl syntact semant result constitut row column featur text tempor syntact concept semant featur concept order give probabl word instanc met text set thousand paper found year french newspap le select criterion larg order work preliminari perform output kdd tool clementin compani produc rule conclud fact le mond larg speak concept text analyz europ commun conflict europ famili europ woman economi europ set rule express paper insist catastroph concept talk underlin unexpect behavior newspap part world concept strongli evok le mond speak commun interest analysi statist absenc evok concept speak strongli le mond speak north economi notic concept le mond avoid speak significantli absent speak strongli detail analysi understand absent concept absenc show kind knowledg notic kind text amount potenti research enorm present discuss strike differ ml field correspond roughli exist kdd commun recogn problem statement larg disclaim properti put disclaim properti strike instanc disclaim kdd specialist member exist kdd commun acknowledg deal ture problem acknowledg discov usabl mean ground mean deal ture consequ definit test defin research kdt kind knowledg yield provid kind knowledg absolut express properti link larg number text analyz show definit lead defin field research refer knowledg discoveri appli softwar product process knowledg acquisit fayyad smyth data mine knowledg fayyad smyth advanc knowledg discoveri data aaai feldman unpublish commun ecml workshop text metric select principl data mine knowledg pp lnai berlin de informatiqu scienc kodratoff bisson epistemolog conceptu journal intellig inform kodratoff organ machin multistrategi volum tecuci michalski page san francisco kodratoff discoveri proc june partridg case induct ieee comput complet version case induct comput comput intellig softwar pedrycz peter world press searl brain penguin london searl scientif american pp order understand disjunct version workshop machin learn organ lri report universit choic disjunct version space proc intern confer machin saitta pp morgan ca suzuki discoveri reliabl except proc suzuki kodratoff except rule base intens principl data mine knowledg pp lnai berlin supp theori acta june review publish univ po box le netherland
HCI/518 4 hci intern intern confer august usa approach user interfac design process ericsson radio system ab box sweden daniel technolog canada david carr technolog sweden abstract pattern describ gener solut common problem context origin world pattern program data analysi goal hci pattern creat inventori solut design usabl resolv ui develop problem difficult frequent encount present approach user interfac design context inform visual concret telecommun focu pattern illustr knowledg task interact design solut captur commun introduct pattern formal descript proven concept express solut ui design problem primari goal pattern gener creat inventori solut ui design resolv ui develop problem difficult frequent encount pattern format describ solut design problem pattern origin architectur introduc christoph alexand alexand notic solut appli recur problem develop pattern design knowledg document method softwar engin johnson adopt pattern facilit softwar earli attempt compon fail unit small mesh softwar pattern adopt share larger fine detail compon interact prescript pattern architectur user interfac design notic design problem occur problem gener good solut problem commun guidelin repres gener hard interpret requir excess effort find relev materi interest pattern document design solut workshop pattern pattern deal complex hci design describ pattern good solut common design problem describ invari qualiti simpli pattern provid power gener design guidanc format consist easi read understand convei knowledg good design pattern implicitli skill ui design found solut work past design formal descript solut fact implicit pattern formal pattern explicit pattern mean collect formal knowledg hci pattern captur document design knowledg hot reason interest pattern provid lingua franca read understood background exist formal wai document ui design knowledg weak pattern offer good captur transfer knowledg present easi provid hci intern intern confer august usa busi busi domain domain pattern pattern busi busi process process pattern pattern task task pattern pattern subtask subtask pattern pattern figur link pattern overview busi domain pattern describ type typic actor busi process involv provid start point initi defin system design point relev busi process pattern task pattern commun system vision busi process pattern describ typic process actor involv deliveri complianc busi goal narrow system definit point specif task pattern consid task pattern captur pass knowledg typic work context previou similar suggest interact design solut point structur navig design pattern describ solut proven suitabl task type previou design structur navig design pattern describ wai structur inform implement navig order support task design base inform task pattern gui design pattern document gui design issu base inform task pattern structur navig design pattern base work concern domain specif pattern busi busi process task pattern describ specif domain level specif pattern practic desir make gener invari knowledg gain work attempt gener support transfer design knowledg domain structur navig design pattern gui design gener depend domain mean inform busi domain busi process task pattern lead suggest suitabl structur navig design pattern structur navig design pattern turn point gui design structur navig design pattern base domain specif knowledg context format pattern order demonstr discuss form pattern illustr excerpt task pattern subtask pattern project build pattern languag system design radio network manag pattern select document part activ optim oper radio network incorpor recommend inform visual activ pattern incorpor guidanc design visual context manag cellular telephon network present task subtask pattern design set relev task pattern select discuss busi domain busi process pattern guid select task pattern plan task user analysi case substitut carri task pattern task pattern describ complex point subtask pattern turn describ part task captur knowledg previou similar context forc pass knowledg typic work interact design solut task pattern descript consist describ task pattern call network optim specif instanti gener pattern appli domain context describ goal user requir task problem describ design problem hand compet concern problem compet solut problem structur structur navig navig design design pattern pattern gui gui design design pattern pattern hci intern intern confer august usa clarifi task add feel task order make vivid easier understand forc describ factor influenc directli indirectli detail specif gener rich recur inform typic gather task user analysi inform fit forc descript forc divid context forc task forc describ task characterist special requir build gener knowledg visual made specif task radio network order reader understand problem reader avoid mental translat gener task characterist radio network optim forc descript user inspir paint pictur typic user inform easili basi full descript order exemplifi user context forc captur social factor influenc work design solut commun design task emerg forc pattern describ complex task interact design solut concern interact issu design lower subtask pattern contribut guidanc result subtask pattern describ smaller task part complex task pattern make build time pattern descript relat subtask relat structur navig pattern subtask pattern optim radio network pattern graphic filter histori deriv visual inform seek task result structur navig pattern suggest navig implicitli level complex task structur navig structur navig part task result subtask pattern result gui design pattern suggest suitabl pattern gui design solut subtask pattern complex task made smaller task subtask describ complex task pattern descript quickli larg unwieldi strength pattern task pattern point subtask pattern particip complex task subtask pattern typic experi gener depend user task context due granular descript compon task describ task forc lack structur handl larg amount displai data base context specif network optim problem forc specif problem statement suggest inform visual solut inform visual user task easi involv larg amount data assum user follow inform seek zoom detail suggest organ map imag overview map imag simpl provid critic inform time provid zoom pan map semant zoom greater detail reveal user zoom provid filter dynam queri design provid relev object map imag make user lose spatial context multipl view make content synchron design similar user quickli construct custom visual consist multipl coordin view figur design solut optim radio network pattern hci intern intern confer august usa tion interact design point structur navig pattern lower level detail intuit complex system navig interact design time subpart vari solut subtask pattern refer relat subtask pattern main differ task subtask pattern descript subtask forc gener subset task forc deriv specif divid context forc level detail descript gener complex domain point forc gener task independ context subtask pattern found independ specif problem design solut gener term futur work posit feedback interact design present approach peopl strength support work start build languag question remain unsolv construct point work format structur navig pattern approach offer conceptu design turn abstract turn practic subtask pattern strive captur complex aspect model concern robust chain pattern offer forc link level pattern compon pointer valid concern approach relat pattern unwieldi goal user pattern concern construct pattern easi intuit approach pattern adapt valid practic usag pattern fulli suppli lingua target interact design structur level detail adapt fit actual design project practic pattern hold facilit commun evalu refer visual inform tight coupl dynam queri filter human factor comput system build oxford ny pattern construct oxford ny put pattern languag interact guidelin design inform visual sweden run isbn interact pattern lingua franca interact dc design element reusabl softwar isbn ad object compon research note group principl pattern user interfac coordin visual relat advanc visual interfac ey task data type taxonomi inform ieee visual common pattern languag interfac design
DB/519 3 learn probabilist relat model friedman hebrew stanford daphn koller stanford avi pfeffer stanford abstract larg portion data store commerci relat system statist learn method work data appli forc convert data flat lose relat structur present paper build recent work probabilist relat model describ learn prm properti object depend probabilist properti object properti relat object prm significantli express standard bayesian show extend statist method learn bayesian network learn model describ paramet estim structur learn automat induct depend structur model show learn procedur exploit standard retriev techniqu effici learn larg dataset present result real synthet relat introduct relat model common structur data busi market sale medic scientif dataset store relat relat dollar industri grow interest make sophist huge amount mine pattern regular explicitli model gain deeper understand domain discov relationship model unknown import inform institut comput hebrew jerusalem israel comput scienc stanford gate build stanford ca interest predict person potenti base bank intern busi connect arrest record associ interest classifi web page belong faculti attribut web page relat page induct learn algorithm capabl handl data relat form restrict deal flat set separ attribut typic relat remov richer structur lose inform crucial understand data problem predict attribut person attribut correl attribut attribut relat transact conduct peopl involv transact conduct order decid advanc fix set attribut learn algorithm task learn algorithm deal multipl entiti reach entiti characterist base properti entiti relat induct logic program primari learn framework capabl ilp algorithm learn logic horn rule determin predic hold ilp excel solut inappropri main limit determinist natur rule discov exampl encount interest correl determinist goal paper learn refin probabilist repres statist correl properti entiti properti relat entiti model reason entiti entir rich structur knowledg encod relat start point work structur probabilist exemplifi bayesian network bn provid compact resent complex probabl distribut fix set attribut random variabl exploit local influenc present domain build recent develop field bayesian network deep understand statist learn problem model heckerman role structur provid bia learn task recent develop extend bn incorpor richer relat structur combin advanc kei contribut show techniqu bayesian network learn extend task learn complex model contribut gener preliminari work topic start describ semant probabilist relat model examin problem paramet estim structur select class model deal crucial technic issu distinguish problem learn relat probabilist model learn bayesian network provid formul likelihood function show interact standard assumpt bn learn search coher depend structur significantli complex case learn bn structur introduc tool concept effect describ result synthet final discuss extens applic underli framework relat model describ relat model gener close relat languag model gener framework map varieti specif relat includ probabilist logic program probabilist frame system learn result appli framework vocabulari relat model consist set class xn set relat rm entiti type set attribut attribut valu fix domain valu relat type vocabulari defin schema relat model simpl genet model inherit singl gene determin person blood type person copi chromosom inherit inherit father possibl contamin test attempt recogn person blood type schema class person relat attribut person chromosom inherit attribut result instanc schema defin set entiti entiti type entiti attribut instanc attribut denot relat hx specifi hold interest describ probabl model instanc relat schema social secur fulli determin label attribut fix assum instanti schema attribut call probabilist skeleton structur relat schema partial specif instanc schema specifi set object valu fix attribut relat hold object leav valu probabilist attribut unspecifi complet skeleton structur extend skeleton valu probabilist attribut final definit turn notion slot chain project argument obtain binari relat view slot denot element hold relat algebra notat object set call concaten slot form longer slot chain defin composit binari relat chain appropri probabilist relat model proce definit probabilist relat model basic goal model uncertainti valu attribut object domain skeleton defin probabl distribut complet skeleton probabilist model consist qualit depend paramet depend structur defin associ attribut set parent correspond formal instanti wai object parent attribut distinguish type formal parent attribut depend probabilist attribut formal depend induc depend individu object depend probabilist attribut depend attribut relat object slot chain understand semant formal depend individu object recal repres set object case slot chain probabilist depend multiset notion aggreg theori tool address mother father blood type person mother father blood type person mother father blood type person blood test contamin result figur prm structur simpl genet domain fix attribut shown regular font probabilist attribut shown ital dot line relat entiti solid arrow probabilist depend depend probabilist aggreg properti multiset natur notion mode set frequent occur set valu minimum valu cardin languag notion aggreg multiset valu ground return summari type aggreg argument type aggreg report size multiset parent semant depend defin obviou return genet attribut result blood test depend parent result depend genet materi person test add parent figur show structur simpl prm domain set parent defin local probabl model associ condit probabl distribut specifi set parent recal parent simpl attribut relat aggreg set rel set valu ground type tupl valu specifi distribut paramet skeleton structur local probabl model defin probabl distribut complet skeleton note skeleton determin set object model associ random variabl probabilist attribut object skeleton determin relat set object relationship chain note assum relat object disallow uncertainti relat structur model defin coher probabilist model ensur probabilist depend random variabl directli parent attribut parent defin edg parent defin edg depend structur acycl rel skeleton direct graph defin variabl acycl defin coher probabilist model complet instanti consist proposit acycl rel defin distribut complet briefli sketch proof show construct bn probabilist attribut skeleton construct reminisc model construct approach construct learn algorithm construct network network node variabl aggreg quantiti requir parent parent aggreg random variabl attribut particip relat random variabl correspond probabilist attribut simpli random variabl correspond aggreg node captur determinist function aggreg oper easi verifi probabilist depend induc bayesian network construct suggest answer queri relat model bayesian network standard tool answer queri compil prm bayesian prm express inform result bn defin probabl distribut fix set attribut prm specifi distribut set entiti domain relat entiti prm bn set rule logic set rule proposit rule induc potenti infinit set ground instanti paramet estim move task learn prm begin learn paramet prm depend structur structur determin set parent task learn paramet defin structur learn base train complet instanc task interest crucial compon structur learn algorithm section kei ingredi paramet estim likelihood probabl data model function captur probabl distribut paramet likelihood paramet set defin probabl data typic work log log log kei insight equat similar data bayesian network likelihood function bayesian network induc structur skeleton main differ standard bayesian network paramet learn paramet node network forc ident theori learn bayesian network task perform maximum likelihood paramet estim goal find paramet set maxim likelihood estim simplifi decomposit function summat term attribut class term squar bracket maxim independ rest maxim likelihood estim reduc independ maxim multinomi maximum likelihood estim suffici statist case count valu attribut parent jointli proposit assum multinomi maximum likelihood paramet set consequ paramet learn prm reduc count suffici statist count vector suffici statist count straightforward manner standard queri note proposit show learn paramet prm similar learn paramet bayesian network view learn paramet bn prm induc skeleton discuss learn paramet reason induc complet bn maximum likelihood paramet estim overfit train data bayesian approach prior distribut paramet smooth irregular train significantli robust section bayesian framework good metric evalu qualiti candid structur due space briefli describ altern approach roughli bayesian approach introduc prior unknown perform bayesian data comput posterior distribut paramet appli idea recal prm paramet set individu probabl distribut condit distribut form work bayesian approach learn bayesian network make assumpt assum paramet prior paramet independ assum prior dirichlet distribut dirichlet prior multinomi distribut variabl set distribut paramet dirichlet detail paramet prior satisfi posterior form product independ dirichlet distribut paramet comput easili proposit complet prior satisfi paramet independ dirichlet posterior product dirichlet distribut updat evalu probabl case bn assum instanc impli independ paramet evalu posterior paramet probabl instanc probabl paramet weight posterior probabl valu case term rewritten simpli instanc probabl expect paramet posterior dirichlet suggest expect paramet evalu data formula expect paramet analog proposit assum multinomi prior dirichlet expect paramet proper bayesian solut comput probabl data complic problem assumpt iid data violat instanc independ paramet genet assum data involv inform mother person introduct object probabl attribut simpli posterior paramet reason instanc problem occur data relat train data essenti disjoint scheme problem disappear attribut object parent attribut train set genet mean insert peopl long ancestor peopl problem involv formal justif expect paramet valu argument depend fact probabl instanc linear paramet paramet assumpt violat probabl complex involv multipl instanc class integr probabl data paramet longer reduc comput probabl rel expect paramet correct express call margin likelihood section score structur note posterior sharpli peak train approxim term expect paramet proposit singl instanc expect paramet learn model structur select move challeng problem learn depend structur user import issu address determin depend structur evalu candid defin effect search procedur find good structur legal structur depend import depend structur result coher probabl model proposit skeleton acycl rel easili verifi candid structur acycl rel skeleton train acycl rel encount domain acycl arbitrari simpl approach ensur depend attribut respect order directli depend parent parent class requir directli depend attribut order simpl approach ensur limit cover import case genet model genotyp person depend genotyp depend directli violat requir simpl approach appar cyclic attribut level resolv level individu person ancestor resolut acycl reli prior knowledg domain learn algorithm deal depend model user give algorithm prior knowledg user assert slot ga partial order ga ga ga acycl compon acycl prior knowledg determin legal depend model start build graph describ direct depend attribut yellow edg parent parent edg green acycl red intuit depend green edg relat object order acycl order edg combin depend cyclic depend care prior form cycl intuit suggest depend graph stratifi cycl graph green edg red edg proposit color depend graph ga skeleton slot ga jointli defin coher probabl distribut assign notion stratif gener special case consid acycl edg depend graph color yellow red graph stratifi acycl genet relat ga suffic check depend object acycl proposit stratif color graph determin time linear number edg graph omit detail algorithm lack reli standard graph algorithm note easi expand definit stratif situat prior knowledg involv set acycl set order object grid order simpli color graph check cycl edg color red evalu structur structur decid evalu structur order pick fit data adapt bayesian model select method framework comput posterior probabl structur instanti rule score main prior probabl probabl data assum structur compon defin prior structur assum choic structur independ context bayesian simpl uniform prior depend structur assumpt work set problem infinit structur genet person genotyp depend genotyp simpl natur solut penal long indirect slot log proport sum length chain compon margin paramet independ dirichlet prior integr product integr simpl close form solut simpl gener idea bayesian score bayesian proposit complet satisfi paramet independ dirichlet margin likelihood equal dt gamma function margin likelihood product simpl correspond distribut term depend suffici statist margin likelihood term domin term probabl structur balanc complex structur fit data balanc made explicitli asymptot relat margin likelihood explicit mdl score note bayesian score requir assign prior paramet valu structur infinit altern formid task case bayesian class prior singl network prior addit properti structur margin likelihood structur strong notion defin richer defer issu futur work simpli assum simpl dirichlet prior uniform defin attribut parent set structur search test determin structur score function evalu provid procedur find legal structur bayesian task prm learn hard bn learn bn simpli prm class hope find effici procedur find highest score structur resort heurist search simplest algorithm greedi score metric maintain current candid structur iter improv set simpl local transform score pick highest score deal local maxima random restart bayesian properti score impact comput effici search algorithm score sum local score individu attribut parent search algorithm consid modif current structur parent set singl attribut compon score chang reevalu leav result major comput save problem simpl approach discuss previou infinit structur atom step search process comput suffici statist requir oper restrict set candid structur step afford oper evalu heurist search algorithm address issu high algorithm proce phase phase set potenti parent pot attribut standard structur search restrict space structur parent pot advantag approach precomput view ing pot comput join aggreg requir definit parent precomput view suffici statist subset potenti parent easili deriv view step search greedi effici success approach depend choic potenti parent wrong initi choic result poor structur examin similar approach context learn bayesian iter approach start structur attribut select set pot base structur appli search procedur higher structur potenti parent base structur stop improv made remain discuss choic pot phase simplest approach begin set pot set attribut success pot consist pa attribut relat slot chain length attribut requir issu predefin aggreg attribut scheme expand set potenti parent iter result larg set potenti parent refin algorithm add parent pot pa reason wai evalu addit provid parent discuss context learn bayesian network result suggest evalu potenti parent measur chang score famili add current parent highest score current set potenti parent approach significantli reduc size potenti parent result degrad qualiti learn model implement result implement learn algorithm top postgr manag system requir count obtain simpli select cach avoid perform queri search creat temporari materi view join view comput count test learn algorithm real synthet domain characterist movi actor relat actor movi plai obtain movi actor simpl present kind problem encount deal real miss larg domain inconsist valu fact algorithm deal kind problem algorithm learn model shown figur model close learn genr movi depend decad film process black decad depend film process learn interest depend combin plai actor movi depend gender actor genr movi artifici genet similar present challeng natur domain arbitrarili complex join defin probabilist model domain fairli subtl person relev attribut domain relat attribut person mother father gold standard model gener structur model shown earlier figur train algorithm dataset size rang data set size consist famili tree averag blood test person evalu algorithm test set size figur show test set learn model algorithm learn model correct score small minor algorithm stuck local learn model incorrect structur score poorli scatter plot figur show median learn model outlier standard techniqu random restart deal local maxima discuss defin statist learn learn probabilist relat model data shown idea bayesian network learn carri task shown challeng scale idea larg import issu achiev closer integr technolog includ indic queri optim lot recent work extract inform massiv data includ work find frequent occur combin valu attribut idea significantli comput suffici statist import extens work obviou treatment miss data hidden variabl extend standard techniqu expect maxim miss movi actor actor gender relationship probabilist depend movi process genr decad titl dataset size median likelihood gold standard figur prm learn movi movi actor learn curv show gener perform prm learn genet domain show show test set size sampl show independ learn experi curv show median model function sampl size task preliminari work relat complex infer larg miss valu make cost naiv applic algorithm prohibit domain call infer algorithm learn algorithm avoid repeat call infer larg problem interest issu autom discoveri hidden variabl preliminari answer question context bayesian network context ilp recent context simpl binari relat combin idea extend complex framework interest challeng direct extend class model assum relat structur probabilist attribut valu determin richer class prm probabl structur uncertainti set object number children coupl relat blood found crime scene techniqu automat discov interest entiti relationship hold world acknowledg friedman support grant michael trust daphn avi pfeffer support onr contract darpa onr grant aro muri program approach intellig sloan foundat powel foundat refer chicker learn bayesian network fisher learn artifici intellig statist springer slatteri learn extract symbol knowledg world wide web proc optim statist peer learn bayesian network structur massiv algorithm friedman learn belief network presenc miss valu hidden variabl proc chicker learn bayesian combin knowledg statist data machin heckerman tutori learn bayesian network learn graphic model mit jordan learn dyadic data nip jensen prospect assess ai technolog fraud case studi aaai workshop ai approach fraud detect risk koller pfeffer learn probabl noisi firstord rule proc page koller pfeffer probabilist system proc lavrac dzeroski induct logic techniqu applic elli haddawi answer queri probabilist knowledg base theoret comput pool probabilist horn abduct bayesian network artifici mp js rp goldman knowledg base model knowledg engin
DB/520 3 approach develop implement eager replic protocol alonso swiss feder institut technolog replic avail perform distribut larg number protocol provid data consist idea commerci product due complex perform implic current product inconsist resort central approach elimin advantag replic suit replic protocol address main problem relat replic protocol maintain data consist transact semant found central system provid flexibl reason perform protocol advantag rich semant group commun primit relax isol provid elimin possibl reduc messag overhead perform detail simul studi show feasibl approach flexibl type bottleneck circumv categori subject distribut transact distribut gener reliabl addit kei word group isol replica total order multicast work partial eth zurich dragon research project earlier version paper ieee intern confer distribut comput system pp depart comput feder institut technolog institut inform eth preliminari articl accept acm transact system definit version product acm version copyright associ comput permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copyright compon work acm honor abstract credit permit copi post redistribut requir prior specif permiss fee request permiss public acm fax alonso introduct replic basic mechan avail perform elimin access remot distribut spite larg number exist protocol provid data consist al idea commerci product strong belief design exist solut feasibl due poor perform lack scalabl current product adopt pragmat copi updat solv inconsist left user bridg gap replic theori find correct research solut effici commerci system practic solut clear correct criteria reason avoid good perform solut base combin idea group commun concurr control commun kei issu distribut effici achiev commun overhead small unlik previou replic solut tightli integr underli commun system initi work area al alonso al alonso stanoi al al exploit semant group commun order minim overhead group commun isi al transi al reness al provid group reliabl messag messag order primit group node consist servic perform task avoid perform limit current replic protocol import point correct serializ highest correct level restrict practic address protocol implement level isol implement commerci system al protocol provid level failur behavior cost correct criteria provid high correct relax correct perform main issu approach data consist basic mechan protocol perform transact defer batch write remot copi transact commit time commit time updat write copi total order multicast node receiv write set order site local perform conflict test check conflict transact pass test commit conflict write oper execut arriv serial conflict transact explicit protocol approach develop implement eager replic tabl classif replic mechan primari copi earli solut ingr placement strat base oracl oracl advanc weak consist strat updat base eager lazi deadlock occur work present paper make contribut famili replic protocol combin group level isol enhanc incorpor commun semant optim problem implement replic effici explor detail mean simul studi approach solv problem relat replic al protocol maintain data replic transpar easili integr current provid reason perform transact semant found central system paper organ section overview exist replic solut section present basic idea solut section describ system model section present famili protocol provid level isol section redefin algorithm provid level properti algorithm formal proven appendix section overview simul system section describ conduct experi result section conclud paper overview replica control mechan ensur data consist copi shasha categor mechan updat propag copi updat updat propag transact boundari replic lazi eager replic detect conflict transact commit approach data consist straightforward result commun overhead time significantli time lazi replic delai propag end alonso ing updat propag background process copi inconsist occur term copi central updat distribut approach primari copi updat perform primari copi propag secondari copi avoid concurr updat copi simplifi concurr introduc potenti bottleneck singl point failur updat copi updat requir updat copi coordin eager replic earli research replic address eager replic strong consist high convent correct criterion eager replic al exist multipl object logic copi execut concurr transact coordin serial execut logic copi tabl classifi eager protocol al ceri al earli solut eager primari copi approach dai stonebrak algorithm updat approach base al effort devot optim size el abbadi cheung al agraw el abbadi epidem protocol al commun mechan provid causal augment ensur serializ lazi replic eleg eager straightforward solut includ commerci system user warn eager replic full synchron requir commerci favor lazi propag model approach exist base primari copi highli special line transact line analyt replic server primari copi approach updat propag copi immedi commit transact push strategi effort minim time copi inconsist ibm data propag gear olap architectur adopt pull strategi updat propag client request impli client updat request central copi oracl symmetr replic support push pull eager lazi replic eager replic implement store procedur activ trigger oracl lazi replic scheme primari copi updat replic case transact perform conflict problem reconcili addit commerci work develop approach develop implement eager replic lazi replic strategi wide rang approach weak consist model bernstein chen pu econom paradigm al epidem strategi al solut distribut file replic web al document replic al effort made develop lazi solut serializ al al breitbart al base primari copi approach basic idea restrict placement primari secondari copi control order updat appli secondari copi approach provid fast time messag exchang execut serializ set configur transact execut sever restrict recent approach combin eager lazi replic techniqu korth anderson al system eager commun place boundari transact determin serial order distribut lock scheme access lock primari copi build global serial graph detect avoid execut system lazi execut transact place site propag updat remot copi commit mechan updat commit transact appli site solut primari copi base transact updat primari copi resid site minim overhead replic protocol view question combin correct properti eager updat perform advantag lazi replic goal protocol number reduc messag overhead separ problem global serializ replica convent protocol treat oper transact individu lead number messag transact approach scale node minim messag bundl updat oper singl messag optimist scheme lazi replic postpon write replic data end transact assum applic significantli read write solut read oper perform local inform read oper exchang elimin deadlock shasha shown configur probabl deadlock directli proport number replica avoid deadlock group commun alonso group commun ensur messag receiv total order site oper transact singl messag transact arriv site suffic grant lock order transact arriv site perform updat order avoid kind deadlock note total order deliveri transact impli serial execut oper execut parallel serial execut recent suggest cpu pai execut transact skip concurr control whitnei al optim level isol serializ al restrict commerci altern correct criteria lower level isol grai reuter al level correct perform attempt maxim concurr reduc conflict profil transact significantli improv perform inconsist compar lazi solut advantag understand accept relax correct requir relev distribut environ longer transact execut time lead higher conflict rate optim level tradit protocol introduc amount addit overhead normal process order provid level full correct weaken provid faster solut context reliabl messag deliveri determin correct complex messag exchang mechan atom transact faster commun protocol provid effort approach similar found configur typic found system reuter alonso al model section present formal model distribut distribut consist number call site node maintain set object access execut transact assum fulli replic system node commun exchang messag figur show main compon node al grai reuter commun model commun place multicast primit provid group commun system al chandra moser al dolev van reness al primit manag messag exchang group node provid messag order assum group static consist approach develop implement eager replic lock tabl reliabl order log data recoveri manag copi transact request commun concurr control transact manag network replica control node commun modul network node system node send deliv receiv send physic receiv network commun modul system send deliv receiv send physic receiv network fig node architectur commun model fix number node fail section enhanc model protocol semant account failur recoveri site figur depict layer configur system send messag pass commun modul forward site includ send site node multicast send messag group member commun modul node physic receiv messag network deliv local system local receiv messag term messag deliv node receiv interchang refer recept messag deliveri messag node place site messag deliv node commun modul receiv messag network group commun system provid deliveri messag eventu deliv failur occur messag import featur messag order concept order motiv fact messag depend node multicast content messag depend content node receiv messag order causal extend fifo order defin causal messag reflex transit closur causal node receiv send node send send fifo causal order deliveri order messag causal relat node receiv unrel messag order total order prevent ensur messag node deliv serial order group commun system provid deliveri messag deliv physic receiv network node receiv messag arbitrari order alonso messag node deliv node order order messag causal messag deliv node order messag deliv total order node receiv messag receiv receiv exist algorithm implement deliveri order al token implement total order approach implement isi al master site determin sequenc number multicast regularli site exact number physic messag multicast delai send receiv multicast messag strongli depend order algorithm broadcast commun transact model user interact submit transact node al transact execut transact result particip site transact partial read write oper logic object transact read write logic object oper index transact read object oper label logic read oper translat physic read copi local node write oper translat physic write copi oper conflict access copi write histori partial physic oper set transact conflict oper order order correct transact conflict oper isol level isol al grai reuter highest isol conflict requir histori serial histori lower level isol restrict inconsist inconsist occur defin term phenomena ansi sql standard specifi isol recent work shown protocol implement commerci system literatur match ansi isol level al al adopt notat oneil describ phenomena interest paper dirti read uncommit version sever problem dirti read cascad abort abort write oper undon abort read invalid version approach develop implement eager replic lost write result read oper version creat updat lost read valu read exist constraint read version fulfil constraint write exist constraint violat write concurr control model lock protocol al grai reuter implement isol level write lock commit time recoveri avoid possibl reduc conflict profil transact read lock earli read lock protocol paper base serializ implement strict al avoid phenomena lock held end transact long cursor stabil avoid long delai writer due conflict read oper reuter al al wide implement commerci system transact scan perform complex read long read lock delai write oper order avoid commerci system read lock immedi end read oper read inconsist occur avoid sever lost updat system long read lock object transact updat sql cursor lock object refer cursor lock held cursor move close object lock transform write lock al read sql call read lock oper transact submit updat oper transact write object call mechan cursor stabil analog discuss oneil note write lock avoid lost updat avoid cursor case occur snapshot isol elimin read lock complet al transact read consist snapshot log current updat transact integr snapshot snapshot isol object version provid individu snapshot object version label transact creat version transact alonso read version object label latest transact updat commit start version reconstruct appli undo actual version request version gener transact write object perform version check updat abort featur call committ win snapshot isol avoid snapshot isol provid oracl version note snapshot isol avoid inconsist ansi sql standard formal provid serializ histori hybrid protocol combin snapshot isol requir updat transact acquir long read write lock transact snapshot unlik cursor stabil snapshot full serializ requir updat transact distinguish queri replica control model variat approach updat transact group singl total order commun system order transact execut transact summar transact submit node system local owner remot transact read oper perform local replica write oper defer read oper execut bundl singl write set messag ws updat consecut read perform privat copi transact write set node local total order total order determin serial order transact conflict receiv write transact manag perform test check conflict action order conflict write oper total order determin commun system request write lock write oper write set ws atom step write set process process lock request order messag deliveri conflict write oper order site transact start execut oper object previou conflict oper execut note process request lock serial execut transact long oper success transact execut interleav protocol serial conflict total order total order includ order account situat failur occur differ protocol check conflict handl import characterist protocol total order care treatment read oper make protocol unnecessari approach develop implement eager replic comparison relat work model differ significantli protocol individu messag singl updat transact order provid distribut epidem approach el simpli total order modular el enhanc causal order commun system ensur serializ approach requir read made visibl site combin eager lazi replic breitbart korth similar solut transact execut local singl site commun place transact commit order determin serial order local site commit transact site appli updat local site commit transact posit total order determin reli fact remot site total order serial breitbart korth anderson al updat commit approach differ breitbart korth anderson al send distribut lock global serial graph determin serial order updat separ messag deliveri order write set messag determin serial order unlik mechan breitbart korth anderson al exchang serial messag oper algorithm similar execut transact local check commit time global execut serializ replic protocol previou protocol discuss section replic serializ construct protocol replic version strict al alonso write set conflict test check conflict local transact receiv write set write set intersect read set concurr local read transact abort protocol shown figur explain figur refer copi object simpli omit vertic line figur show run node node store copi object read write read write transact submit time start local read set read lock phase figur read transact multicast independ write set ws ws phase commun system order ws alonso lock manag node control coordin oper request transact local read acquir local read lock read oper defer write request end read phase send commit bundl write ws multicast order lock deliveri ws request lock ws atom oper ws lock grant lock ii write lock read lock transact process lock enqueu lock request iii grant read lock write set ws abort grant ws multicast abort messag local multicast commit messag write write lock grant perform oper termin deliveri commit messag oper execut commit lock deliveri abort messag undo oper execut lock fig replic protocol serializ time lock tabl lock tabl fig execut ser protocol approach develop implement eager replic ws node ws lock manag request lock ws atom step phase conflict lock write lock grant system abort transact denot attach lock entri commit messag multicast order requir oper execut phase commit deliv oper perform phase ws lock manag process lock phase ws lock wait assur wait finit time successfulli receiv lock commit lock lock phase end lock includ node lock manag request lock ws phase request lock lock manag encount read lock send phase abort lock grant abort wait observ write skew phenomenon result execut local node avoid abort local transact ws send abort messag order lock manag receiv ws simpli ignor lock manag receiv messag termin transact phase protocol deadlock transact node local updat transact node proof correct protocol found appendix execut transact requir messag multicast write set total abort commit simpl messag owner read oper abort owner process lock phase ws commit commit messag arriv due action initi lock remot node obei owner transact grant wait write lock prefer read lock avoid unnecessari abort mechan avoid abort read transact possibl abort writer reader requir protocol writer abort system approach avoid enabl site independ decid outcom local transact option tradit write oper wait read transact termin approach creat deadlock desir altern node inform node local read oper site check individu conflict lead execut effici send inform read set write alonso local read acquir local read lock read oper case short lock updat lock execut defer write request end read phase write lock read lock short transact process lock enqueu lock request fig protocol cursor stabil set complex identifi read object transact written version read perform affect abort reader avoid distribut read avoid pai abort read oper protocol explor approach replic cursor stabil weak point ser protocol abort read oper conflict write protocol lead starvat read transact continu abort simpl wide solut problem cursor earli read lock read oper affect result execut serializ algorithm previou section extend straightforward includ short read lock figur show step chang step requir short read lock immedi object modifi step show protocol abort conflict short read lock write oper wait finit time lock conflict long read lock abort note grant wait short read lock delai write set arriv grant order request lead abort protocol avoid abort depend relat short long read strongli applic depend ser cs protocol requir write set total order multicast messag simpl multicast cs protocol fulfil atom requir transact ser protocol provid serializ avoid occur proof found appendix replic snapshot isol cursor stabil solv abort problem gener inconsist problem conflict difficult handl visibl site entir system snapshot isol effect separ read write oper avoid conflict advantag queri perform interf updat queri awar approach develop implement eager replic transact manag node coordin oper request transact local read read oper reconstruct version label transact highest ts ts ts send commit bundl write ws multicast order ws messag ts timestamp lock version check deliveri ws perform atom oper ws write lock current version label ts ts stop check lock abort grant lock write lock write lock wait transact modifi ts ts stop check lock abort enqueu lock request write write lock perform oper commit oper commit lock fig replic protocol base snapshot isol replic replic protocol base snapshot isol concern transact perform updat order enforc committ give snapshot object version label transact transact tag bot timestamp bot timestamp determin snapshot access uniqu timestamp transact object uniqu oracl al timestamp transact counter commit transact distribut difficulti timestamp consist site achiev sequenc number ws messag write set deliv order site sequenc number write set easi uniqu ident system set timestamp ts transact sequenc number write set ws bot timestamp ts set highest sequenc number messag ws transact transact ws lower sequenc number ws termin transact higher sequenc number commit visibl transact lower messag sequenc termin figur describ algorithm replic snapshot isol assum amount work version reconstruct read phase small version maintain version object al reconstruct copi current version appli undo request version gener oracl special rollback segment provid effici undo al assum similar mechan lock phase includ version check ws alonso updat transact abort assum version check fast oper check occur object updat reduc overhead case frequent node preliminari check local transact send ws exist write conflict abort restart local check repeat recept ws node node decid commun transact commit abort node extra messag conflict exist write oper write set messag multicast note serializ abort reader conflict write snapshot isol abort concurr writer access item abort advantag algorithm depend ratio read write oper snapshot isol advantag compar serializ cursor stabil requir singl multicast messag properti read oper write oper si protocol atom transact provid serializ avoid occur proof found appendix hybrid protocol snapshot isol queri consist view updat transact serializ object updat frequent abort concurr write significantli affect perform long transact suffer committ win strategi avoid hybrid approach protocol full serializ updat transact snapshot isol queri combin full serializ decid protocol transact declar updat advanc approach implement simultan lead administr overhead updat transact object receiv timestamp reconstruct snapshot transact lock manag handl read lock updat transact overhead replic make read intens applic group commun follow approach solut modifi make fit schiper accept practic solut provid full correct effort approach lead inconsist case failur provid perform isol pragmat solut base typic trade introduc inconsist case failur process transact fast approach develop implement eager replic assum crash failur model node run correctli fail addit process step recov system site run delai messag possibl vari messag failur handl group commun system group commun system handl failur provid group mainten servic reliabl node failur commun lead unreach node detect timeout protocol assum primari partit continu work partit stop work behav fail node applic provid virtual synchron view failur event system al commun modul site maintain view current member group messag respect view group commun system observ failur run coordin protocol call view chang protocol protocol commun system deliv messag member view exclud fail node instal applic inform call view chang messag applic program site perceiv process failur virtual time note node view chang consecut view fail virtual synchron system node gener sequenc commun event event send messag receiv messag denot messag deliv receiv view chang notif consist view loss gener assum event view run system node sequenc commun event start view end consecut view failur fail faulti virtual synchroni view synchroni messag node view deliv node receiv messag node view deliv node reliabl messag node view reliabl deliveri deliv node deliv node uniform reliabl deliveri deliv node fail deliv node uniform reliabl reliabl differ messag deliv fail node uniform reliabl node receiv alonso messag node fail case set messag deliv fail node subset messag deliv surviv node case total reliabl deliveri fail node receiv messag node receiv order messag correct singl run view view chang protocol exchang messag deliveri site commun modul node messag node group acknowledg recept network simpl view chang remain node send unstabl messag node reliabl big impact messag delai normal process uniform reliabl deliveri deliv messag applic delai messag addit messag round similar involv vote process reliabl messag deliv messag deliv simpl multicast messag deliv immedi recept network order respect messag numer view chang protocol work specif implement causal total order servic provid reliabl al schiper moser al friedman van reness view chang introduc system work failur occur lower rate messag exchang interv rang minut hour accept failur handl system deal failur base notion atom consist atom impli transact commit abort node detect remain node pend transact requir execut termin protocol remain node process resum al termin protocol transact fail node remain node decid outcom approach similar view chang protocol distribut system replic system decid outcom pend group commun system decid deliveri pend messag compar typic protocol area al friedman van reness overhead similar differ system decid neg abort commit group commun system behav posit deliv messag view chang protocol assum task termin protocol replic consist replica object resid node converg achiev part atom approach develop implement eager replic site commit updat transact subsect show algorithm transact atom node total updat appli order site consist node provid combin protocol present section uniform reliabl reliabl messag deliveri combin discuss failur occur atom provid appendix detail theorem proof run node instal view instal failur extens entir execut straightforward snapshot isol node differ reliabl uniform reliabl deliveri si type node view receiv view chang messag simpli continu process transact group chang due network partit disallow current group continu process transact set transact write set view theorem si reliabl uniform reliabl atom transact node proof reliabl uniform reliabl deliveri total order ws messag view synchroni modul node receiv prefix ws messag receiv view chang live write set node deliv group node fail deliveri characterist system failur reli atom si protocol case uniform reliabl reliabl deliveri si differ set transact commit fail node node recov uniform reliabl messag deliveri node fail deliv prefix sequenc messag deliv node behavior node fail node failur occur fail node simpli stop easi atom transact includ fail node theorem appendix reliabl messag deliveri fail node commit transact node commit happen fail site deliv write set fail site deliv write set al node token send write set commit local fail messag site transact note scenario occur uniform reliabl deliveri commit transact receiv site perform spuriou transact reconcil alonso serializ cursor stabil hybrid similar cs hybrid protocol differ node reliabl uniform reliabl deliveri unlik owner transact decid outcom transact fail node leav transact definit node fail view transact invok node write set ws node receiv ws messag instal view deriv set transact outcom determin view set transact set transact invok node write set messag view set transact invok node fail write set messag receiv node fail theorem cs hybrid protocol reliabl uniform reliabl transact atom transact node proof reliabl uniform reliabl site receiv messag write set instal view chang set transact set transact receiv write set messag decid outcom behavior system failur appli atom properti protocol transact atom node consist note type transact type transact node messag simpli made view group transact invok node fail write set receiv site refer group transact handl differ depend reliabl uniform reliabl deliveri reliabl messag deliveri impact set transact commit fail node determin transact atom fail node write set commit messag uniform transact atom entir system fail recept view node transact safe abort transact activ abort node fail uniform deliveri node receiv commit transact visibl commit fail write set commit messag deliv requir approach develop implement eager replic uniform reliabl appli abort reliabl default case abort theorem appendix call approach node decid consist pend transact view correctli continu process overhead uniform deliveri avoid risk reach transact case write set ws uniform reliabl commit abort messag reliabl deliveri modul receiv view chang exclud node decid block transact continu process transact transact node commit abort fail node achiev transact atom transact block transact atom argument detail descript theorem appendix scenario similar block behavior protocol note block impli node complet unabl process transact transact conflict block transact execut usual transact conflict block transact wait reason abort transact recoveri transact commit fail node abort possibl send messag reliabl deliveri case node commit transact group local node fail node commit transact site reconcil recoveri transact atom node atom consist preserv node previou transact block abort recoveri recov node ident rest system node start execut transact true complet node ad recov node perform standard recoveri al contact peer node obtain current state exist possibl peer node send entir copi send part log transact execut recov node fail option depend size number transact execut recov node advantag view chang protocol checkpoint determin recov node view chang node fail fail fail node rejoin system view chang trigger recov node receiv transact recov node restor state time view chang replai log alonso peer node includ transact receiv execut transact receiv start transact care system reliabl messag deliveri allud fail node commit transact node updat reconcil undon recov node simul model perform protocol evalu similar techniqu studi concurr control al carei livni gupta al simul paramet summar tabl model collect object site store copi object site consist processor data disk disk processor request process fcf order paramet captur time perform oper object fetch object disk percentag oper data resid main memori commun overhead model paramet physic messag transfer overhead cpu time send site cpu time receiv site time differ messag size assum time overhead delai place ip level network util calcul size messag bandwidth network percentag physic messag lost assum broadcast medium messag group site requir singl physic messag logic multicast messag involv physic messag messag total order messag loss detect combin acknowledg neg acknowledg similar protocol receiv multicast acknowledg multicast gap sequenc number messag detect neg acknowledg sender resend messag messag basic servic singl multicast reliabl messag deliv receiv network uniform reliabl deliveri messag deliv acknowledg receiv total order algorithm implement descript moser al token pass system token owner send messag acknowledg piggyback token case reliabl messag deliv immedi messag deliv uniform reliabl messag deliveri wait node acknowledg recept messag model commun similar note implement reliabl commun messag loss detect commun system lost messag resent approach develop implement eager replic tabl simul model paramet gener number site system number object number processor site number disk site cpu object process time disk access time object access disk access commun cpu overhead send messag cpu overhead receiv messag basic delai ip level lower network bandwidth messag loss rate transact type number op transact write op transact type read op object written workload belong type timeout timeout distribut algorithm concurr interarriv averag time arriv transact node distinguish transact type type determin number paramet transact perform oper distinguish read write oper percentag write oper transact determin percentag read oper object written requir read lock end transact cursor stabil transact type describ transact perform local percentag workload belong transact type object access transact chosen randomli transact execut concurr control model algorithm previou section transact assign node read oper perform sequenti node end write set node comparison implement tradit distribut lock protocol strict read oper execut local write oper multicast site simpl reliabl multicast remot lock oper acknowledg back optim standard protocol acknowledg entir oper local site receiv acknowledg execut oper oper start deadlock detect neg acknowledg back local node multicast abort messag remot node oper successfulli execut local site send commit messag remot site deal deadlock behavior implement version distribut deadlock detect distribut deadlock alonso detect timeout commerci system paramet timeout set timeout interv implement global deadlock detect mechan node request lock lock detect algorithm run algorithm messag delai cpu overhead oper includ disk read object disk subsequ period cpu usag process object access transact abort restart immedi make data access origin incarn open queu model transact start exponenti arriv distribut determin interarriv interarriv paramet determin throughput system small arriv time lead high experi result conduct extens set simul experi analyz behavior protocol system respect set paramet present summari import result show gener behavior relev differ protocol paramet fix experi discuss variat led absolut rel behavior protocol baselin set shown tabl consist object number processor site transact process commun dedic processor commun order differenti transact process commun overhead number disk cpu time oper ms disk access ms buffer hit ratio fix network bandwidth note bandwidth limit factor experi match result previou studi van reness moser al assum messag loss rate experi transact type updat short consist long consist oper type updat rate depend short transact repres workload low data content long transact show higher data content transact type transact oper timeout interv distribut algorithm ms short updat transact long updat transact transact global deadlock detect mechan experi set time transact transact type pure overhead execut oper singl site experi reason boundari transact process bottleneck readonli transact execut local write oper updat transact execut system achiev higher throughput transact experi set time mix workload smaller long updat approach develop implement eager replic tabl baselin paramet set transact type ms ms short long timeout ms transact experi main perform metric averag averag time transact start complet averag time confid interv shown result time transact consist execut time wait time commun delai abort rate protocol evalu provid complet pictur result perform figur abbrevi ser cs cursor si snapshot isol hybrid protocol protocol messag set ws messag uniform reliabl bl block protocol ws uniform reliabl exist rb refer reconcili base version messag reliabl figur order label correspond order curv label highest curv top label highest curv experi commun overhead concurr control protocol differ number messag delai si protocol singl total order messag multicast protocol send messag total order servic messag simpl order multicast transact protocol uniform reliabl messag deliveri suffer higher messag delai protocol reliabl messag delai protocol concurr control mechan provid conflict profil abort si abort writer cs avoid experi analyz interplai aspect vari commun paramet model effici commun small messag delai overhead group commun system work slow commun long delai high overhead analyz sensit protocol commun overhead workload long judg optim reduc messag overhead reduc conflict rate commun determin paramet tabl depict set ms experi alonso tabl commun set ms test run ii iii iv vi vii viii ix small msg medium msg larg msg small msg medium msg larg msg basic network delai ms time ms short ser cs ser bl cs bl si ser rb cs rb si rb ee basic network delai ms abort rate short ser ser bl si ser rb cs cs bl si rb cs rb fig experi time abort rate short transact vari high overhead set overhead messag half overhead multicast messag assum flow control involv messag measur real network node show result set paramet valu test run iv ms simpl reliabl multicast ms total perform figur experi depict test run set paramet short transact figur show averag time abort rate short transact time ms node short transact workload transact process requir resourc data content small messag overhead greater impact time low commun time correspond execut time transact commun time protocol depend number complex messag exchang commun processor util satur high commun cost commun costli delai rb protocol show approach develop implement eager replic manc outperform ser cs multicast perform due reduc number messag suggest worst behavior wait deliv write set messag node acknowledg perform similar protocol commun fast commun degrad quickli due enorm amount messag satur commun processor abort rate gener low protocol fact abort rate commun delai explain number transact system slow commun delai transact transact spend time system transact probabl conflict abort rate rb protocol lower abort rate bl version shorten time bot deliveri write reduc conflict profil transact experi skew write cs lowest abort rate ser si similar abort rate fast commun delai behavior degrad due abort reader arriv write transact abort abort reader commun delai likelihood case si problem abort commit independ node transact acquir lock commit note bl version ser bl version behav similarli reason transact abort read phase wait write set deliv phase bl version protocol low commun lower abort rate ser ser si abort unnecessarili abort rate quickli degrad time long due resourc satur long transact figur show averag time abort rate long transact time ms long transact long transact higher data content short transact total number messag smaller transact start time interv reliabl messag deliveri domin factor high commun concurr control method import factor term time rb cs outperform si ser due low conflict rate advantag si send messag predomin commun satur messag delai larg direct impact time long transact bl version cs protocol perform slow commun due high conflict rate abort rate cs outperform protocol due alonso basic network delai ms time ms long dd ser ser bl si cs cs bl ser rb si rb cs rb ee basic network delai ms abort rate long ser ser bl si ser rb si rb dd cs cs bl cs rb ee fig experi time abort rate long transact low conflict rate degrad commun slow degrad commun longer rb version ser si high abort rate abort rate larg impact time happen earli phase transact problem system restart abort transact automat return notif user cs prefer choic time degrad fast fast behav significantli protocol delai creat acquir lock site conflict rate extrem problemat wait period transact wait lock protocol paper avoid problem cs si avoid conflict ser abort restart reader earli phase transact execut note long degrad abort rate ser si timeout interv deadlock difficult implement deadlock detect mechan unrealist real order figur abort rate analysi protocol gener behavior summar behavior protocol case serializ uniform reliabl messag deliveri provid full consist correct conflict rate network delai serializ uniform reliabl messag deliveri bad result abort rate longer time result show strategi follow depend characterist system commun system perform maintain protocol low messag overhead snapshot isol reconcili base protocol data content lower level approach develop implement eager replic read transact time ms updat dd si rb ser rb cs rb rb read transact time ms read dd ser rb si rb cs rb rb fig experi time updat transact isol altern order achiev small abort rate show perform algorithm sensit capac perform commun handl high conflict rate degrad fast condit worsen experi transact replic pai major transact queri execut local commun cost analyz behavior protocol mix workload consist long updat transact percentag transact type vari investig pure resourc data content impact commun commun cost set low valu test run iii tabl show result rb protocol analyz hybrid protocol ser updat transact snapshot transact figur show time updat transact transact function percentag transact workload time ms transact time transact type percentag transact due resourc content replic write local read data content lock wait lower abort differ protocol directli reflect abort rate writer reader protocol updat transact cs behav low rate data content high cs abort si behav similarli similar abort rate admit low rate rate smaller system degrad updat transact time updat transact longer protocol due alonso addit messag exchang longer wait time transact ser time protocol ser protocol abort reader low abort rate updat transact ser high abort rate high time abort fast number transact time start compar result protocol analysi experi show transact special treatment avoid unnecessari abort simpl ser potenti deadlock resolv abort result unaccept high abort rate transact case hybrid protocol good altern reader transact yield good perform requir excess resourc updat hybrid protocol unlik si cs transact declar advanc special treatment cs perform provid repeat problemat applic experi show applic restrict low low workload configur degrad fast condit optim scalabl abil scale system depend number updat oper system execut site analyz factor run experi workload short updat transact readonli transact time ms node scalabl limit workload updat oper execut number node system result number write oper lead end resourc satur configur resourc satur start node number node lead perform degrad degrad due enorm amount transact process power perform write oper node scale due data content experi chose updat rate order analyz factor affect scalabl number site plai import role influenc number messag involv calcul involv determin total order workload combin short updat long transact time updat transact constant entir time ms rate ms node transact time transact ms node transact workload repres approach develop implement eager replic number site time ms updat dd cs bl cs bl si rb cs rb si rb number site time ms read dd cs bl cs bl si rb cs rb si rb fig experi time updat transact number node tion central oltp distribut manner mean amount write access distribut analyt access number node commun paramet set valu test run iv tabl skip ser protocol previou experi ser abort transact figur show time updat transact transact number site system updat transact system behav slightli system due higher load node execut read oper updat transact ms system node execut read updat transact ten node higher observ similar behavior observ commun overhead figur time protocol number node due messag delai total order uniform reliabl messag delai significantli time number node rb protocol behav counterpart complex commun protocol concurr control method conflict rate messag show result compar result figur si behav bit send messag impact commun processor overload behavior protocol small number node problem write oper wait node respond addit node probabl write oper wait site transact lock time transact similar evalu protocol protocol consid experi abort bare influenc behavior updat transact slightli number site cs alonso read lock transact wait updat transact write lock commun longer version write lock longer bl rb version write lock write oper perform commit messag deliv bl rb send commit messag reliabl deliveri messag deliv physic receiv commit messag deliv acknowledg receiv number site system longer receiv acknowledg block wait read lock longer bl rb note si protocol acquir read lock result transact rb version node time transact compar protocol transact wait long updat transact lock node time due degrad time updat transact analysi algorithm scale fairli provid good perform wide rang configur main factor commun delai number site protocol scale long commun system scale short messag delai number node provid solut updat replic exploit advanc commun semant optim messag support order avoid problem distribut address concern design flexibl choic level isol handl data content achiev high perform case slow network architectur implement detail provid show applic feasibl approach present quantit analysi compar perform method system workload configur detail simul model replic evalu time approach gave analysi behavior experi demonstr commun plai major role replic transact process sever perform problem avoid reduc messag overhead techniqu minim number messag transact snapshot reduc messag overhead messag transact reduc commun cost reduc messag latenc reconcili base protocol commun protocol low messag delai user incorrect data rare case protocol perform significantli full protocol commun slow approach develop implement eager replic messag overhead constant transact size messag delai time transact lead concurr transact higher data content problem sever long short transact overcom concurr control protocol lower isol cursor stabil updat rate sever problem replic system due extens resourc requir allevi conflict rate reduc cursor stabil snapshot isol hybrid protocol eleg solut avoid abort queri serializ enforc transact updat execut normal protocol queri execut snapshot isol protocol show good result number node system high main factor commun delai long messag delai reason short protocol show good scalabl comparison standard distribut protocol show protocol stabl broader rang workload configur avoid fast abrupt degrad experienc eager updat replic feasibl wide spectrum applic configur fulli serializ protocol fast low system low conflict rate percentag transact reason high system configur happen optim term lower level isol maintain reason perform replica consist replic transpar part futur work implement algorithm manag system test perform real environ explor sophist tighter integr group commun primit transact execut al initi result hide commun overhead transact optimist approach transact execut total order total order alter exist serial transact commit final total order violat serial transact abort reschedul proper posit total order techniqu feasibl rang protocol term accept commun delai work version protocol deal partial replic partial object replic site exist local site long transact access replic data partial fulli global order total concurr control enforc criteria order preserv serializ al protocol enhanc straightforward support partial replic alonso acknowledg schiper discuss topic grate breitbart weikum comment suggest improv paper appendix proof protocol appendix proof protocol present section prove transact atom failur free case transact commit abort site node failur network partit occur show ser cs si level isol section serializ prove atom serializ characterist show ser deadlock free lemma ser protocol deadlock free proof show lock transact eventu grant analyz behavior protocol conflict situat distinguish read lock ws process read send request abort receiv lock protocol figur read lock write lock ws process request wait finish denot assum sequenc transact wait write lock write lock request atom step wait read lock conflict oper write oper ws process ws time process ws abort step protocol cycl final receiv lock write lock request read lock previou point show write set ws eventu receiv lock termin lock grant prove ser deadlock total order properti specif fact approach develop implement eager replic conflict deadlock read transact abort acquir lock commit conflict deadlock write lock transact acquir step conflict deadlock theorem failur free ser protocol atom transact proof show node local updat transact node owner decid show remot node obei abort easili remot node termin transact receiv messag commit obei lack deadlock node eventu grant write lock execut oper theorem ser proof base bernstein al show replic data histori acycl replic data serial graph serial graph node commit transact edg order oper conflict oper extend ad edg graph order transact conflict oper logic object serial graph histori produc ser protocol easi ser perform write oper copi oper conflict logic object conflict physic creat edg proof fact write set total ws ws ws ws site show ws ws cycl depend accord total order provid commun system edg exist due kind conflict oper ws deliv ws abort step protocol figur ws ws write lock acquir total order write set deliv read ws deliv read oper perform ws step ws deliv ws alonso extend proof dummi write set assum deliv logic time read lock grant argument updat transact cursor stabil theorem cs protocol deadlock free case failur free atom transact proof proof ident proof ser protocol theorem cs level avoid phenomena occur proof cs provid appli combin proof replic data serial graph mean multipl copi object logic object true reason transact perform updat copi transact atom site commit updat transact total order updat execut order site copi object logic time transact updat object ws deliv directli ws node time lock copi grant time copi written phenomena avoid dirti updat visibl commit transact read obtain short long wait write lock receiv commit version data lost obtain long read lock write step figur abort ws process phenomena due short read lock snapshot isol theorem failur free si atom transact proof si local node send write set ws node decid outcom transact show atom transact show node make induct sequenc write set arriv sequenc total order prove atom transact assum initi transact ts object label assum ws deliv bot node decid commit perform oper deliv node approach develop implement eager replic behav commit abort transact node seri commit transact updat object order transact timestamp version object node transact termin ws nth ws version check step figur outcom time ws process transact check version version exist transact updat object commit grant lock object version creat transact activ updat object theorem si avoid phenomena occur proof reason cs protocol phenomena avoid due dirti updat visibl commit transact ts lower ts read lost ts bigger ts smaller ts moment request abort ts lower ts read read reconstruct older version read transact read creat transact start write write oper conflict conflict consid proof behavior section show transact atom data consist site inform discuss uniform reliabl deliveri atom entir faulti node mean set transact commit resp abort fail node subset transact commit resp abort node provid exhaust proof node fail view state transact node fail case show contradict made alonso node mean node activ site commit transact correct fail node commit abort theorem si protocol uniform reliabl messag deliveri atom transact site proof transact fail node read phase case node transact effect node consid abort site send phase local ws view reliabl multicast uniform reliabl node receiv write set uniform reliabl multicast node fail receiv ws deliv site transact consid abort site receiv sequenc messag ws decid outcom theorem appendix remot lock write mean ws deliv view uniform reliabl ws deliv site reliabl deliveri provid site sequenc messag receiv ws receiv version check result theorem decid outcom complet transact local mean ws deliv due uniform reliabl messag site receiv ws hold previou case theorem section atom transact site theorem cs hybrid protocol uniform reliabl messag deliveri ws commit abort messag view chang atom transact site proof transact fail node read transact consid abort send activ decid commit abort decid commit read lock si decid abort semant reliabl node deliv write set deliv site transact consid abort transact site approach develop implement eager replic site abort make correct local transact write set deliv messag requir transact abort site ws uniform reliabl messag deliv site crash transact site abort process lock phase submit commit messag commun modul fail node physic receiv commit messag site deliv ws deliv transact abort show activ fail case modul wait commit commun modul deliv commit messag due uniform reliabl deliveri commit commun modul deliv site deliv messag case transact pend fail process lock phase submit abort messag commun modul abort messag reliabl commun modul deliv messag back modul immedi wait node deliv messag abort activ time failur node abort case deliv abort messag abort transact abort local commit fail happen write set commit messag deliv messag deliv deliv site transact site commit uniform reliabl deliveri write set exclud scenario node remain group deliv commit messag write set shown fail node transact node fail node failur node transact safe abort theorem section atom transact site theorem cs hybrid protocol uniform reliabl messag deliveri ws block messag view chang properti version proof proof previou theorem case forc block transact case process lock phase submit messag commun modul fail node physic receiv messag commit abort reliabl wait alonso node receiv messag commit abort time failur atom site block refer weak gener theori optimist implement distribut transact ph massachusett institut technolog gener isol level definit proc int conf data engin march pp el exploit atom broadcast replic proc europ conf parallel process august pp el tree effici approach manag replic data proc int conf larg august pp el epidem algorithm replic proc acm int symp principl system pp concurr control perform altern implic acm transact system partial replic group commun primit proc european research seminar advanc distribut system march el advanc transact model workflow context proc int conf data engin februari pp distribut data manag workflow environ proc int workshop research issu data engin unit april principl resili share distribut resourc proc int conf softwar engin octob pp mutual proc acm sigmod int conf manag data june pp ansi american nation standard inform system languag sql model concurr nest transact system journal acm critiqu ansi sql isol level proc acm sigmod int conf manag data june pp concurr control recoveri system addison massachusett lightweight causal atom group multicast acm transact comput system updat propag protocol replic proc acm sigmod int conf manag data june pp replic lazi proc acm symp principl system pp approach develop implement eager replic oracl server buffer manag proc int conf larg data base august pp parallel concurr control perform distribut machin proc acm sigmod manag data june pp classif updat method replic technic comput scienc stanford failur detector asynchron system proc acm symp principl distribut comput august pp structur classif integr replica control mechan technic depart comput columbia grid high perform scheme maintain replic data proc int conf data engin februari pp defer updat data placement distribut proc int conf data engin februari pp transi approach high avail cluster commun commun acm el maintain avail partit replic acm transact system notion consist predic lock system commun acm van pack messag tool boost perform total order protocol technic depart comput cornel van strong weak virtual synchroni technic depart comput cornel weight vote replic data proc acm sigop symp oper system principl decemb pp discuss relat replic technolog danger replic solut proc acm sigmod int conf manag data june granular lock consist share model data base system amsterdam transact concept techniqu morgan kaufmann transact model virtual synchroni bridg gap theori practic distribut lnc pp revisit commit process distribut system proc acm sigmod int conf manag data june pp broadcast relat problem distribut pp alonso perform replic group multicast proc int symp comput june pp suit replic protocol base group commun primit proc int conf distribut comput system process transact optimist atom broadcast protocol proc int conf distribut comput system june bound ignor replic system proc acm symp principl system june pp order event distribut system commun acm algorithm mutual decentr system acm transact comput system extend virtual synchroni proc int conf distribut comput system june pp multicast group commun system commun acm automat distribut system proc acm symp principl distribut comput august pp oracl concurr transact isol serializ oracl white paper oracl server concept manual oracl fast algorithm maintain replica consist lazi master replic proc int conf larg septemb pp transact reorder replic proc symp reliabl distribut system north octob replica control distribut asynchron approach proc acm sigmod int conf manag data pp scalabl updat propag epidem replic proc int conf extend data base technolog pp uniform reliabl multicast virtual synchron environ proc int conf distribut comput system pp lesson wall street tutori proc acm sigmod int conf manag data june pp data replic proc int conf data engin februari pp program design el broadcast primit replic proc int conf distribut comput system approach develop implement eager replic concurr control consist multipl copi data distribut ingr ieee transact softwar engin van flexibl group commun system commun acm high volum transact process concurr phase sql int workshop high perform transact system septemb
IR/521 5 languag model adapt juli dai languag model adapt outlin dai ffl model static difficult deal task domain vari train condit ffl adapt languag model automat deriv topic inform text combin global text statist ffl dai model word languag model mixtur summer school languag model adapt juli model static model ffl local typic previou word ffl statist base markov chain word sequenc paramet deriv word frequenc count train corpu ffl fundament task domain similar train corpu ffl larg amount train order accommod great number variat occur spoken languag model static ffl work underli assumpt static task suffici train hold difficult deal task domain vari train condit ffl adapt languag model attempt exploit longer distanc depend infer notion text comput topic depend probabl summer school languag model adapt juli adapt languag model stage automat deriv topic inform text ffl definit unit spoken data length ffl topic document long distanc statist ffl inform retriev model base histogram weight unigram frequenc stage combin global text statist ffl mixtur ffl maximum entropi model jelinek mixtur formul ffl mixtur partit corpu manual produc set compon lm combin produc mixtur model clarkson robinson ffl dynam cach observ recent word predict static model blend cach unigram statist recent word baselin interpol scheme summer school languag model adapt juli kuhn de mori al model word ffl automat determin pose problem document cluster base content task inform retriev system ffl model word measur similar document van rijsbergen summer school languag model adapt juli model word inform retriev ffl typic base unigram statist ffl stop stem algorithm frake ffl term weight scheme avoid distort occur due common document ffl similar distanc measur model word ffl weight function tf idf term frequenc document weight document frequenc base number document term yu salton ffl applic tf idf languag construct dynam lm recent keyword grishman adjust model probabl word seymor al summer school languag model adapt juli model word read ffl pereira al soft cluster word model distribut cluster membership measur distribut similar baker mccallum applic document classif ffl brown al class base mutual inform adjac class word classif saul pereira aggreg markov model discov soft word class em procedur ffl hofmann puzicha uniform view statist model data latent semant analysi ffl princip compon analysi high discret space captur largest variat word document sacrif inform estim document similar lower continu space sch utz silverstein ffl controversi techniqu lack rigor statist foundat hinton al ffl word model exact probabl estim captur varianc suffici larg discrimin summer school languag model adapt juli latent semant analysi read ffl initi work deerwest al dumai berri al comput aspect ffl languag model speech process applic integr lsa deriv global constraint convent local model condit probabl relat compar lsa predict mixtur languag model ffl mixtur weight sum compon ffl compon deriv partit corpu ffl mix factor satisfi clarkson robinson summer school languag model adapt juli mixtur languag model ffl em algorithm mix factor dempster al walker ffl mixtur lm form likelihood function problem find likelihood ffl estim word start initi condit mixtur languag model ffl increment variant word fw process word ffl estim fl fl summer school languag model adapt juli mixtur languag model ffl classifi document semant cluster select lm compon fit piec text ffl problem manual tag document suffic ffl automat scheme prefer problem text data process document space ffl document share vocabulari good chanc concern similar subject ffl ir techniqu comparison mathemat ffl step calcul weight word import document unigram frequenc vocabulari item term similar latent semant analysi ffl advantag unigram relat discard local constraint order vocabulari item markov global effect summer school languag model adapt juli term weight ffl weight word document ij ij global weight collect document ij local ffl global weight design enhanc word wide distribut document ffl document vector defin collect term fa ij okapi formula ffl extens test ir evalu task trec robertson al sp jone al ffl global log log total number document collect number document word occur frequenc weight document frequenc summer school languag model adapt juli okapi formula ffl local ij ij ij ij frequenc count document document length number word averag document influenc term frequenc effect document length modifi constant ffl document length ij ij ij entropi formula ffl global log ij log ij number document ij frequenc count entir collect document document smaller word distribut document summer school languag model adapt juli entropi formula ffl local ij log ij number word ffl entropi formula frequent combin lsa calcul dumai singular decomposit ffl latent semant analysi base singular decomposit word document matrix deerwest al dumai ffl intens matrix percent element modern workstat perform comput berri al summer school languag model adapt juli singular decomposit ffl fd matrix rank column describ document column entri measur vocabulari item term ffl svd ffl eigenvector princip largest eigenvalu defin word document space typic order singular decomposit word document singular valu matrix word vector document vector summer school languag model adapt juli singular decomposit ffl diagon matrix element correspond singular valu squar root eigenvalu aa ffl matrix orthonorm eigenvector eigenvalu aa singular vector ffl matrix orthonorm eigenvector eigenvalu singular vector singular decomposit ffl document space defin singular vector largest singular valu ffl closest matrix squar rank origin matrix berri al ffl vector describ warrant project comput li closest document subspac respect origin space summer school languag model adapt juli singular decomposit ffl project possibl term weight document vector hundr dimens ffl project repres princip compon inform document ffl word document classifi vector cluster document ffl cosin angl oe vector oe jjx jj jjx jj term weight document vector project reduc dimens space ffl cluster distanc oe oe summer school languag model adapt juli british nation corpu ffl gener corpu great varieti topic exampl spoken written british english manual tag level linguist inform specif restrict subject field genr ffl partit manual tag domain spoken domain written domain automat infer class segment fix size term svd reduct british nation corpu world affair spoken written imagin natur scienc appli scienc social scienc commerc art leisur file word domain domain summer school languag model adapt juli word class ffl model word word belong class tend document frequent word classifi class ffl month year except okapi term weight svd found cluster verb word class ffl planetari system relat word planet miss fact frequent word ffl word cluster gener difficult guess common concept member isol spuriou word cluster total improb summer school languag model adapt juli associ class domain social scienc commerc art leisur document document document imagin spoken natur scienc manual domain world affair appli scienc automat class okapi term weight svd associ factor ffl associ entropi partit log log joint entropi ij ij log ij vari press al summer school languag model adapt juli associ factor term weight scheme svd svd unigram frequenc okapi formula entropi formula automat class manual domain ffl okapi term weight work ffl svd dimens contribut significantli simpl unigram frequenc case affect offlin procedur mixtur lm estim form document vector train corpu select vocabulari stem appli term weight appli svd matrix obtain document project space classifi document vector document build class specif model subset corpu summer school languag model adapt juli onlin procedur adapt languag model form document vector word sequenc observ appli term calcul project select suitabl class specif lm compon blend singl lm estim complet train corpu calcul score data blind mixtur updat model perplex trigram hit singl convent lm mixtur manual tag domain lm automat infer class lm ffl mix factor updat blindli identifi domain ffl lower trigram hit improv perplex mixtur summer school languag model adapt juli blind mixtur updat lm perplex associ associ factor svd associ factor unigram frequenc entropi formula okapi formula svd lm adapt wn evalu set window size gener set class lm mix score select class lm singl convent lm term weight svd project summer school languag model adapt juli lm adapt number class svd number class unigram frequenc entropi formula okapi formula singl model svd renal summari dai ffl model word base unigram statist term weight scheme similar measur latent semant analysi ffl mixtur languag model automat deriv topic inform text combin global text statist summer school languag model adapt juli refer mccallum distribut cluster word text classif pp languag model framework larg vocabulari speech recognit ieee transact speech audio process obrien linear algebra intellig inform retriev siam review della mercer model natur languag comput linguist user refer british nation corpu version oxford comput servic robinson languag model adapt mixtur exponenti decai cach volum pp integr semant predictor statist languag model volum pp harshman index latent semant analysi journal societi inform scienc rubin maximum likelihood incomplet data em algorithm journal royal statist seri improv retriev inform extern sourc behavior research comput inform data structur algorithm englewood prentic hall renal mixtur languag model natur languag engin model manifold imag handwritten digit ieee transact neural network summer school languag model adapt juli puzicha statist model data technic report ai memo massachusett institut artifici intellig laboratori statist method speech recognit mit press princip compon analysi springer seri statist springer verlag languag model adapt dynam margin volum pp dynam adapt stochast languag model volum pp de mori natur languag model speech recognit ieee transact pattern analysi machin intellig lee distribut cluster english word pp vetterl numer recip cambridg press walker mixtur maximum likelihood em algorithm siam review okapi overview text retriev confer pp pereira aggreg markov model statist languag process confer empir method natur languag pp sch silverstein project effici document cluster pp grishman nyu languag model experi csr evalu darpa speech recognit pp summer school languag model adapt juli rosenfeld nonlinear interpol topic model languag model adapt volum pp sp robertson probabilist model inform develop statu technic report comput laboratori van inform retriev butterworth salton effect inform retriev term accuraci commun acm summer school
IR/522 5 automat discoveri languag model text jami margaret du center intellig inform retriev comput scienc depart massachusett massachusett usa abstract text larg organ internet make difficult person search languag model describ content select algorithm gloss provid assist automat select inform current practic languag model cooper approach import limit paper demonstr cooper requir select servic construct languag model sampl content normal process run queri retriev document random sampl approxim carefulli select queri sampl approach avoid limit cooper enabl addit capabl result demonstr accur languag model learn small number queri document introduct text larg organ internet make difficult search desir inform larg corpor network provid access thousand lotu note oracl corpor document manag text document access thousand searchabl text person inform select algorithm gloss solut permiss make copi part work person classroom grant fee provid copi made distribut profit commerci copyright titl public date notic copi permiss copi post server redistribut requir prior specif permiss fee sigmod usa fl acm select algorithm select automat rank text likelihood satisfi queri select algorithm requir manual scale effici million handl inform appeal solut respect select algorithm interact directli rank algorithm interact index languag model describ content content languag model vari select gener languag model describ word index term occur frequenc inform indic term occur languag model essenti element select research activ direct studi concern paper interest select servic acquir languag model provid languag model request call cooper assum parti provid inform parti cooper model turn weak solut environ manag parti paper present method acquir languag model requir special cooper sampl assum select servic run simpl queri retriev small number document languag model built automat document sampl test seri experi result demonstr accur languag model learn small number queri document sampl avoid problem cooper approach enabl addit capabl support cooper method section describ select includ languag model acquisit approach languag model section methodolog result section section discuss sampl enabl addit capabl relat section conclud select peopl commerci search servic face select problem peopl search select subset simplest choic search choic practic environ commerci servic group set common newspap collect court group manual process automat method common group effect solut inform inform access pattern anticip inform select effect solut select algorithm rank similar queri queri yield rank tailor queri typic top threshold similar select search select algorithm appeal handl rang moder comput requir compar ordinari full text inform retriev effect demonstr research studi effect languag model prohibit comput commun cost compar queri select algorithm compar queri index partial repres content call partial languag model languag model arbitrarili complex tend consist list term occur frequenc occurr complex languag model includ inform phrase term type inform unclear acquir languag model start protocol techniqu acquir languag model start protocol al consid iso standard interfac inform retriev system start protocol exchang languag model protocol basic idea simpl list index inform frequenc occurr small amount corpu inform number document suffix strip word extrem frequent word remov start protocol excel solut singl parti control reli make poor solut control parti fail provid wont lie cooper system upgrad inaccess system reli cooper solut start cooper protocol enabl provid cooper select servic provid hostil select base corpor simpli incent cooper select servic uncommon inform provid internet order number peopl visit site start protocol offer protect problem problem assumpt vocabulari frequenc inform provid compar difficult occurr compar occurr occurr ir system varieti word stem stopword special index common date select algorithm find imposs differ system start protocol ideal suit environ control singl cooper index uniformli characterist small organ larg approach requir acquir languag model sampl select servic recommend search find document satisfi inform observ impli capabl run queri return document match queri minim criterion assum satisfi queri run document sampl content document return queri necessarili constitut call techniqu sampl characterist larg popul estim small random sampl popul hypothesi sampl provid sampl document suffici random learn accur languag model entir open question larg sampl requir construct languag model accuraci word occurr follow highli skew word occur word occur rare word middl frequenc rang thought distinguish document singl evid highli frequent word distinguish bit evid suggest import vocabulari occur frequent acquir sampl resourc measur queri run document reason algorithm sampl simpl select initi queri term run queri retriev top document return updat languag model base characterist retriev document assum necessarili run queri return document free cost acquir languag model issu li scope paper stop criterion reach select queri step algorithm involv number specif queri term document examin stop sampl defer discuss choic section paper sampl number advantag techniqu learn languag model requir special cooper run queri retriev assum minimum level servic requir absenc special cooper enabl sampl learn languag model wont cooper make content languag model learn consequ normal behavior build languag model directli sampl document select servic control content languag model free select servic imposs task reconcil approach text index stopword case select servic determin sophist detail appli creat languag enforc consist languag match detail languag model characterist select algorithm document sampl dn rich resourc enabl select servic provid addit capabl select enabl complex analysi content drive visual aid union sampl sampl serv select enabl set queri import piec inform difficult acquir sampl size zipf law empir evid show vocabulari growth addit document rate independ size unclear estim size sampl size primarili select algorithm scale word frequenc languag model provid vari size similar effect obtain scale frequenc learn languag model size sampl base make size byte document uniqu term total term varieti cacm homogen heterogen tabl test corpora piec desir methodolog hypothesi motiv work accur languag model learn sampl text simpl queri hypothesi test compar languag model learn sampl languag actual languag model record number queri document requir learn languag model achiev level accuraci languag model experi conduct languag model consist index term frequenc frequenc measur number document term frequenc stopword discard languag model construct control learn actual languag model compar word languag effect discard learn languag model word consid stopword default stopword list inqueri ir frequent word suffix remov word languag model construct control suffix remov prior comparison actual languag actual languag model stem choic consist languag model explor research literatur select test effect corpu characterist size quickli accur languag model learn homogen set titl abstract scientif articl commun wall street corpu american newspap heterogen consist trec cd newspap magazin scientif govern document standard test corpora research tabl summar characterist metric languag model consist type frequenc inform term vocabulari correspond learn vocabulari actual vocabulari measur percentag learn ratio correspond learn frequenc inform actual frequenc inform measur spearman rank correl coeffici metric percentag learn learn vocabulari necessarili subset actual learn examin subset document natur proport set cover proport term actual vocabulari found learn vocabulari call metric percentag learn percentag learn metric poor match text skew distribut term text uniqu term text occur occur occur time vocabulari text word occur time percentag learn metric treat term languag model equal import realiti convei inform content ratio skew distribut term text larg number essenti irrelev small number frequent term frequent term convei inform content metric measur qualiti learn vocabulari weight import term ratio metric measur proport term occurr cover term learn languag model learn vocabulari actual vocabulari ratio number time term occur term ratio mean learn languag model word account word occurr consist occurr occurr learn languag model ratio spearman rank correl compon languag model term frequenc rel import descript power term inform retriev algorithm typic frequenc inform compon statist rank procedur term occur consid repres content sampl algorithm estim proport document term estim size imposs estim actual number document term estim proport document term compar actual proport document comparison number document examin true proport accur estim document amount error built type comparison accur rank term frequenc occurr compar rank term occur learn languag model zipf law predict relationship term rank frequenc term frequenc estim vice versa spearman rank correl coeffici accept metric compar rank spearman rank correl coeffici defin rank differ common term number term rank ident correl coeffici uncorrel coeffici order coeffici select requir rank correl coeffici suffici learn languag model repres rel import index term suffici rank term select algorithm insensit small rank open question error algorithm toler select accuraci deterior li scope paper paper simpli studi correl learn actual rank varieti condit set paramet experi sampl requir make choic queri term select document examin queri queri run determin select word randomli actual languag model initi queri select select frequent select term languag model inform experi found choic initi queri term effect qualiti languag model learn subsequ queri term chosen varieti section case term chosen subject order avoid select term retriev document term select queri term number requir charact long requir similar requir index term text retriev system guid document sampl queri experi conduct determin effect vari paramet cacm experi present paper end examin document experi present paper end document stop criteria chosen empir run initi interest learn languag model small size sampl experi continu thousand document ensur unusu happen cacm number document examin percentag term found cacm number document examin ratio figur measur learn languag model cover vocabulari percentag term cover learn languag model percentag word occurr cover term learn languag model document examin result seri experi conduct method gener queri number document examin queri vari goal experi determin effect languag model learn combin paramet produc fastest learn accur languag model queri run determin select word randomli baselin experi consist subsequ queri term randomli languag model examin document queri number determin paper present result number document result baselin experi shown figur graph figur demonstr percentag term learn poor metric judg qualiti languag model document order discov cacm vocabulari repres word occurr cacm contrast dramat vocabulari discov repres term occurr recal stop includ frequent term discard languag model comparison stop word word languag syntax convei inform stop word discard ratio grow converg rapidli cacm number document examin spearman rank correl figur measur term rank document frequenc learn languag model term rank document frequenc document examin percentag term found examin number document function vari wide examin ratio experi frequent term found examin fix number matter big ratio greater curv impli point term occur rare consist zipf law figur show rate rank term learn languag model begin match rank term actual languag model model small homogen cacm converg correl coeffici exce model heterogen converg reach correl coeffici document heterogen converg reach correl coeffici document unlik converg constant rate correl term rank influenc size model cacm reach high sampl model reach lesser sampl model sampl experi demonstr repres term frequenc learn sampl small fraction content question answer rank error distribut evenli opportun gather inform proper rank frequent term rare term measur distribut error subject current research open problem correl rank accur select correl coeffici requir correl coeffici suffici sampl continu reach level correl requir sampl queri greatli improv size sampl number document examin queri baselin experi retriev highli rank document queri number baselin produc good result empir number paramet reason investig effect vari cost run provid process build languag model wait cost reduc examin document queri searchabl web return document titl addit document request characterist suggest examin document queri cacm doc doc doc tabl effect vari number document examin queri long sampl method reach ratio doc number document examin spearman rank correl coeffici process run queri retriev document intend approxim random sampl queri necessarili return sampl document document return queri similar vocabulari term frequenc gain examin suggest examin small number document queri seri experi perform determin effect vari number document examin queri valu test difficult graph differ accuraci languag model learn examin number document includ paper differ sampl produc stabl result rang paramet set point ratio reach languag model homogen cacm learn quickli document examin queri document queri larger heterogen document queri larger heterogen make differ document examin queri differ suffici small base rel cost run queri examin document choic requir fewer queri reach number result show cost examin document sampl number document examin ratio number document examin spearman rank correl figur measur queri select strategi affect accuraci learn languag model percentag word occurr cover term learn languag model spearman rank correl coeffici term rank learn languag model wall street journal document examin avg number queri tabl number queri requir retriev document queri select criteria queri select strategi baselin experi select queri term randomli learn languag model random select learn languag model baselin paper produc good result empir queri term select learn languag model select languag model queri select strategi reason investig effect vari earli hypothesi frequent term produc random sampl occur varieti context metric measur term frequenc common inform retriev document frequenc collect term frequenc averag term frequenc tf metric differ tend test method select queri term learn languag model earli concern learn languag model initi strongli document happen sampl bia reinforc continu select queri term learn languag model solut select term complet languag hope random set queri term hypothesi design languag hypothesi compar languag techniqu previou set experi languag model experi full languag model choic creat unfair bia favor interest languag model actual languag model provid investig carefulli seri experi methodolog previou set experi number document examin queri queri term select learn languag model term frequenc metric randomli languag model test result similar result present tabl random languag experi learn import vocabulari term inform quickli random languag requir queri creat sampl document differ select queri term dont occur sampl occur fewer document result learn languag model similar languag model exact match sampl superset view result number fail queri higher select queri term languag model similar experi demonstr select queri term learn languag complet languag produc markedli skew sampl document rate learn faster measur number queri slower measur number document examin whichev metric languag model learn moder cost experi demonstr select queri term randomli learn languag model effect select base high frequenc result hypothesi high frequenc term occur weak produc random sampl hypothesi valid experi high frequenc term tend frequent similar wall street journal care approach select high frequenc base part speech pai attent relationship sampl produc result simpli random select queri term produc random sampl document select stop criteria term rank learn languag model converg term rank actual languag model number document examin differ learn actual rank long disappear complet stop criterion sampl system decid learn languag model suffici accur hypothesi learn languag model converg actual languag model rate hypothesi support extent experi spearman rank correl coeffici initi rise level rate converg slow predict inform stop criterion simpl techniqu compar learn languag model time learn languag model time ffi learn languag model suffici conclud learn languag model converg similar languag model determin spearman rank correl semant obviou intuit experi show identifi small improv correl languag model learn document interv tend highli correl coeffici notic differ correl actual languag model defin measur averag rank differ term rank view averag measur percentag number term move convert rank defin rank differ common term number term rank term ident term rank rank term rank rank term swap term occupi vari multipl term occupi case languag vari figur show languag model creat increment languag model creat cacm document languag model creat cacm document mean averag term rank move distanc reach place number term rank common valu observ gener indic languag model chang dramat document increment interest result valu snapshot languag model fell document independ size cacm number document examin chang document figur averag distanc term move convert rank document rank document document examin result suggest establish stop criterion base inform observ languag model learn languag model accur consecut document span fall independ relat discrep ratio spearman rank correl coeffici languag model converg ratio suggest converg constant number document spearman coeffici suggest rate converg influenc size ratio constant number document suffici experi suggest stop condit creat depend inform observ learn languag model question stop condit suffici sampl constant number irrespect size characterist peak summar content interest primarili automat method learn languag model suffici accur detail automat select algorithm languag model person gener natur text simpl method summar content displai term occur frequent stopword method effect word occur illustr point world base microsoft custom support web chose content present late base earliest sampl unclear paramet set sampl experi document examin queri subsequ research fewer document queri effici term learn languag model rank avg tf rank produc metric easili document microsoft softwar avg tf produc inform word rank list content word draw strong summar content test simpl word list effect summar necessarili effect techniqu frequent common relationship word consequ creat languag model sampl document make power summar sampl process restrict word list frequenc restrict inform provid set hundr document mine frequent interest inform inform enabl construct power inform summari simpl languag model cooper method queri queri process term ad queri document make longer repres person inform queri occur user assist interact document retriev queri base term word phrase tend occur queri necessarili synonym phrase alien ad queri tend document term avg tf term avg tf term avg tf term avg tf term avg tf project microsoft access set command excel object print applic offic user data product window work visual internet menu server beta error text set word servic box softwar tabl basic articl code version printer file setup messag nt mail system inform field user dialog select tabl top word found sampl microsoft custom support avg recent paper show queri significantli improv automat select arguabl import languag model inform document term occurr occur document occurr document polit queri algorithm requir larg repres document analyz pattern ordinari document search inform task clear expand queri select queri specif introduc bia select open problem queri gener select task sampl method build languag model solv problem build languag acquir sampl dn union sampl frequenc frequenc pattern occur set serv select algorithm union sampl favor specif reflect pattern common queri select view advanc make queri common part automat select peopl inform retriev system decad ago ir system million peopl form internet system inform comput network store commerci scatter thousand searchabl text manag varieti larg small content provid challeng research commun make inform access inform singl todai automat select solut incomplet solut environ internet cooper natur languag model dissemin protocol start address varieti problem encount world environ sampl approach languag model acquisit present paper avoid problem cooper protocol appli older appli system specif incent easili defeat intent avoid problem reconcil word custom index text problem arguabl problem cooper appli provid intend cooper paper show sampl produc accur languag model text vari size content hundr document document acquir run hundr queri resourc measur amount amount network low addit benefit sampl document directli select servic construct set languag model vari complex simpl word frequenc languag model select detail languag model identifi relationship select servic document acquir sampl build cooccurr queri type queri significantli improv accuraci open problem acquir paper present solut work report paper import step direct automat step select algorithm number document scale open problem size estim sampl content criteria recogn languag model suffici accur principl criterion subject current research queri select criteria lead rapid learn languag model acknowledg paper base work support part nation scienc librari congress depart commerc cooper agreement patent trademark offic advanc research project arpa order issu contract recommend express paper necessarili reflect sponsor refer croft search distribut collect infer network eighteenth annual intern acm sigir confer research develop inform page acm distribut scalabl mechan distribut inform retriev fourteenth annual intern confer research develop inform page octob acm dumai latent semant index text retriev confer page nation institut standard special public jc jc cl kj prei evalu select testb experi annual intern acm sigir confer research develop inform retriev garc paepck start stanford internet intern confer manag gravano garc gener gloss broker hierarchi intern confer larg page garc effect gloss text discoveri problem intern confer manag page editor text retriev confer nation institut standard technolog special public heap inform comput theoret aspect academ hp luhn automat creation literatur abstract ibm journal marcu comparison effect comput human search intermediari journal american societi inform mj editor fact figur nation inform standard organ inform retriev applic servic definit protocol specif em nk learn collect fusion strategi eighteenth annual intern acm sigir confer research develop inform page acm xu callan effect retriev distribut collect annual intern acm sigir confer research develop inform page acm zipf human behavior principl introduct human ecolog
ML/523 6 case base surfac reinforc learn chri drummond depart comput ottawa abstract paper demonstr exploit vision process techniqu index case base surfac surfac result reinforc learn repres optimum choic action achiev goal state space paper show strong featur occur interact system environ detect earli learn process featur system identifi task solv retriev relev surfac result order magnitud learn rate introduct import research issu case base learn combin learn method aamodt plaza point gener machin learn commun aim produc coher learn method fulfil specif distinct role paper discuss combin case base reinforc learn advantag method learn inform limit requir knowledg present state infrequ real valu reward learn action bring system desir goal state occur achiev level learn rate slow import exploit result prior learn definit advantag quickli similar solv paper explor idea store result learn case base critic case base index case central intuit work strong featur environ mean featur stabl easi accur earli learn process environ includ system featur system interact world interact repres function notion strong featur larg dictat shape surfac featur differ small amount expect surfac differ small amount research shown function accur reconstruct record steep slope task produc similar featur result qualit abstract paper insight work vision close relat marr earli work featur essenti marr cross point popular techniqu object snake locat featur import differ task end mean learn process recognit process accur produc speedup learn averag learn episod rest section discuss case give introduct reinforc learn snake section present experi demonstr featur extract lead substanti reduct learn time section deal futur work relat research case base case base consist case indic case surfac obtain reinforc learn task index curv strong featur surfac extract snake rest section discuss case indic produc reinforc learn simul robot environ main room room goal shown bold line figur dash line made clear section robot action small step direct learn task determin shortest path goal start locat simpli robot coordin legal rang defin wall main state space simplifi assumpt effect action depend previou task learn action state action robot immedi goal state close goal problem evalu action result progress goal reach term credit assign problem problem focu work reinforc learn commun address action evalu wait final outcom correl evalu action state robot learn state estim distanc goal estim result local move robot state smallest estim distanc goal earli learn process state close room case case robot main room case goal fig room room goal accur estim true distanc time action estim state updat estim state eventu process propag back accur estim goal state directli record distanc paper usual reinforc expect discount reward state fl influenc reduc progress farther futur occur fl reward reach goal farther state goal smaller form surfac state space figur show surfac produc learn process environ figur fig surfac gradient vector algorithm frequent reinforc learn qlearn research adopt simpler algorithm assum world discret markov process state action action discret action state maintain roll averag reward maximum action state equat surfac discuss previou paragraph shown figur repres maximum watkin dayan prove converg optim constraint reward learn rate ff optim solut action greatest state robot greedi algorithm shortest path goal extens continu space function approxim simplest divid state action dimens interv result cell repres averag rang action region state space applic method success exist gener proof converg featur extract plot figur steep slope separ area rest plot compar environ shown figur appar correspond wall room strong featur discuss paper exist distanc goal robot side wall insid room room featur visual readili appar intuit vision process techniqu locat plot figur repres magnitud gradient vector surfac absolut largest gradient form hill steep slope surfac locat featur curv found li ridg hill method call snake figur dash line repres contour line hill figur dark line initi final posit snake simplifi imagin snake consist number individu hill spread line repres initi posit snake climb independ movement rel constrain main advantag approach curv produc smooth prevent individu point trap local minima addit characterist process prevent point collect hill snake reach top ridg tend oscil equilibrium limit step size process brought stationari state detail mathemat treatment approach initi snake final snake fig fit snake construct case base discuss begin case surfac produc reinforc learn multipl case produc process converg action valu small room configur surfac snake curv posit defin bound room critic aspect room posit doorwai gradient plot figur doorwai vallei separ end hill width posit doorwai determin magnitud gradient snake index consist coordin point snake surfac gradient point room configur fix interv snake fit procedur repeat surfac snake exist case retriev snake determin weight sum euclidean equat superscript snake case index actual magnitud differenti vari learn process posit snake posit vallei larg static remov effect magnitud valu magnitud snake produc vector differ threshold magnitud valu greater locat valu locat norm multipli scale factor ten sum provid match exce match select case match copi case base learn system surfac close match task hand match learn complet refin normal learn process experi present environ discuss section goal remain ten size room door posit width room denot case shown figur basic algorithm discret function approxim discuss section function approxim divid state space arrai discret cell algorithm run ten room configur appreci chang surfac initi posit snake establish method discuss section locat featur snake posit gradient inform extract form surfac case room configur design test case result surfac gradient vector shown figur fig test case surfac gradient vector learn episod start surfac goal effect default case case base algorithm run increment action establish comparison algorithm run case base algorithm rerun snake fit result surfac increment inform extract good match exist case surfac store surfac fig surfac action gradient vector experi test surfac left case base algorithm chose match slightli smaller room door similar case figur experi test surfac includ case base repeat procedur actual surfac select case select base featur extract surfac shown figur gradient vector show roughli form test case success extract featur earli learn process action norm case close case exact case fig learn curv figur show learn curv experi curv produc euclidean norm differ surfac increment converg surfac test case topmost curv show learn curv case base end slowli converg asymptot close reach variat surfac due stochast select oscil low subsequ action snake consid suffici close index case base curv show result surfac close desir learn curv drop dramat surfac introduc slowli asymptot curv effect result shift posit action learn rate factor twenti exact solut learn curv drop minimum experi demonstr featur detect earli learn process effect index case base exact surfac close match result learn rate limit futur work number limit valid approach experi small case base repres ten room singl fix goal extens experi larger case base repres varieti goal learn curv repres accuraci surfac averag distanc goal inform test measur produc similar detail experi requir demonstr gener true experi domain experi previou featur due robot interact wall exist object defin boundari make notion edg extract central vision process situat object defin boundari import situat type al paper robot arm strong singular arm work space aha salzberg paper learn success control surfac encount difficulti area strong exampl demonstr space defin object strong occur work aim identifi easi impact learn determin detect suffici earli learn process provid learn rate number limit present implement idea discuss paper singl snake locat featur connect boundari state space environ complex collect room multipl snake present real technic problem complic match algorithm surfac approxim match task modif detect posit modifi typic case base learn process futur work involv solv problem investig combin idea plan system case plan oper learn process singl case determin case refin reinforc ultim case relat work close connect present form instanc base case base learn conjunct reinforc learn address number econom state state updat deal hidden state issu address peng tadep learnt instanc combin linear regress set neighbour point salzberg learnt instanc carefulli select genet algorithm issu address moor atkeson queue instanc updat frequent improv learn rate issu address mccallum tree expand state includ prior state remov ambigu due hidden state work singl address hidden state problem gener problem repres larg state space case base state sequenc trajectori unlik work present case function learn result complet learn method complementari approach work relat case base plan gener connect reinforc learn plan connect stronger futur discuss previou combin modif case common case base plan connect object recognit vision research wai model base similar case base method final applic work paper shown case base surfac significantli improv speed reinforc learn introduc notion vision process techniqu extract featur evolv surfac experi demonstr featur stabl extract earli learn process refer aamodt plaza foundat methodolog system approach artifici intellig commun pp learn appli nearest neighbor algorithm dynam control task proc fourth intern workshop artifici intellig statist pp chin dyer recognit robot vision comput survei pp kristian hammond framework plan experi journal cognit scienc rajeev sharma peter geometri visual coordin proc ninth nation conf artifici intellig pp freder martin levin track deform object plane activ contour model ieee tran pattern analysi machin intellig pp util distinct reinforc learn proc twelfth intern conf machin learn pp mccallum state identif reinforc learn advanc neural inform process system pp zhong signal edg ieee tran pattern analysi machin intellig pp david marr vision comput investig human process visual inform wh freeman moor atkeson priorit reinforc learn data real time machin pp jing peng effici dynam program proc twelfth intern conf machin learn pp john steven salzberg teach strategi control ai special issu lazi learn hanson comput strategi object recognit comput survei pp rs sutton learn predict method tempor differ machin learn pp rs sutton integr architectur react base approxim dynam program proc seventh intern conf machin learn pp tadep scale averag reward reinforc learn approxim domain model function proc thirteenth intern conf machin learn pp manuela veloso jaim carbonel deriv analog autom case storag util machin learn pp christoph watkin peter dayan technic machin learn pp articl process macro packag llnc style
IR/524 5 code repres hierarch inform web directori fidel de la la de universidad de campu de spain abstract articl describ code repres hierarch categor inform retriev system web code wide signatur file rigid approach flexibl power categor base direct acycl graph document assign code repres categor inform document signatur paper explain code theori code techniqu appli flexibl environ realiz exhaust analysi import factor repercuss perform system final obtain articl categori subject descriptor search retriev inform servic gener term perform keyword hierarch inform retriev index techniqu introduct inform retriev import research area digit main principl store inform vari directli systemat capabl provid retriev entir collect small number specif desir document principl remain valid world wide web decad angel de la la de universidad de campu de spain amount inform nowadai enorm inform retriev concern method organ retriev inform collect literatur find gener method classifi class full text multiattribut retriev method method begin adapt comput technolog time storag present method invert file due abil search high amount document flash improv method ir due special characterist world wide web internet measur million internet chang dai web wide varieti document type languag high document point page specif user provid short repres queri estim user screen return result code signatur file store flat paper code store hierarch inform necessarili tree direct acycl direct applic code ir world wide web structur paper section state art code method section dedic code scheme appli hierarch inform final conclud section code code common method order obtain signatur research design perform code method start long ago research appli type code retriev mention block signatur obtain signatur word queri signatur comput keyword order keyword queri signatur block posit signatur queri easili determin check block perform code appli inform retriev measur storag overhead drop probabl concern amount space requir store signatur file gener repres extra document review search process match drop queri repres fd actual drop total number target set obviou paramet smaller space overhead higher drop probabl vice order obtain minimum drop probabl space overhead code determin length word number bit set word signatur call weight number word number word obtain minimum drop probabl weight signatur smaller number bit prove signatur size number word drop probabl minim number equal number block signatur literatur demonstr suffici larg approxim drop probabl obtain fd minim drop optim weight signatur obtain ln optim lead number block prove drop probabl obtain optim weight fd code appli hierarch inform code util inform retriev repres field record text document inform repres signatur sequenti code power flexibl tool wide common tradit inform web inform document classifi kind hierarch directori type inform user perform search collect search restrict specif categori order obtain accur result case perform system due main disadvantag high cost merg list document code improv perform type inform advantag flexibl simplic mean util code restrict block fix number word fix number weight word signatur smaller length signatur hierarch inform document classif inform retriev world wide web util due web directori incorpor techniqu import internet search engin classif process perform automat research automat classif futur improv capabl system differ classif method type system base hierarch structur repres document collect figur hierarch structur classif graph inform retriev hierarch structur consid direct acycl simplest case view tree graph standard node parent figur document collect node graph document node restrict node held impli leaf node held document figur type inform user perform search document match queri term usual time user restrict document belong specif categori descend search perform effici invert document restrict belong concret categori search process complic time reduc search process complic list document relat categori obtain merg list relev document list section code repres inform categori document belong applic filter mechan elimin document match restrict characterist perform section show code effici repres categori document belong evid characterist code signatur file document signatur repres categori includ figur observ document includ node child node child node document belong inform store signatur field signatur bit signatur document previou discern main differ tradit code signatur file import differ number variabl document belong side document document belong categori differ effect formula obtain optim weight signatur drop probabl signatur file assum number larg order deriv optim formula larg directli relat depth graph differ impli simplifi formula signatur deal origin formula code show main formula proof formula found appendix fd rw rw formula determin perform obtain code queri restrict categori structur graph give inform search process retriev document belong categori queri signatur signatur node ancestor previou formula drop probabl accur queri restrict categori level assum root categori procur formula deeper level complex mathemat process perform type queri import paramet implement prototyp inform system order simul studi behavior drop probabl type queri simul process gener ten tree approxim node level collect document node signatur weight bit optim weight tree simul group queri restrict categori level tree group queri made queri retriev document simul basi rest simul articl valu obtain drop probabl show figur drop probabl queri depth figur drop probabl queri experi figur observ queri restrict categori level drop probabl similar theoret deeper level drop probabl signatur categori includ inform make queri accur import characterist code scheme impli deeper queri perform perform achiev simul demonstr code hierarch structur inform retriev encourag paramet direct repercuss perform hierarch code section studi effect main paramet perform retriev system paramet hierarch code convent code word signatur assum word impli high number signatur structur hierarch code impli categori signatur reduc appreci number signatur import aspect categori signatur signatur signatur fact suggest research signatur assign categori experi studi effect drop probabl similar categori signatur ancestor signatur signatur categori gener bit common signatur case perform simul process similar experi experi clear similar signatur drop probabl categori level descend alik time worsen remain level brother categori similar difficult differ result achiev categori bit common drop probabl level reduc slight worsen level simul test relationship categori gener signatur bit common brother research show fewer bit common brother perform side reduc number signatur interest result obtain combin approxim research simul join signatur inform categori ancestor categori motiv result obtain bit common ancestor common brother drop probabl queri depth fd bit brother bit ancestor bit brother bit ancestor bit brother bit ancestor figur drop probabl signatur bit common ancestor signatur research step investig code evid work result obtain assign signatur encourag subsect deal paramet hierarch code document paramet paramet interest studi number document retriev queri influenc drop expect result neg examin effect queri result case drop probabl similar anova test factor analyz number document collect object perform simul ten distinct total number document rise result displai figur confirm drop probabl absolut independ number document collect drop probabl number document fd fd fd fd fd figur drop probabl versu number document collect type retriev system common document belong categori term code mean document signatur categori signatur document belong categori signatur made signatur worst case perform perform import limit effect figur observ effect number document belong categori drop probabl drop probabl document belong categori figur drop probabl document categori figur observ effect stronger queri restrict categori softer deeper categori perform worst case half document categori fd queri level mean hierarch code support appropri exist document classifi node experi continu analysi repercuss document categori result show perform rapidli percentag type document augment document parent document parent drop probabl system import percentag document categori strongli recommend variat number bit test percentag document perform improv reduc weight signatur bit main influenc document perform retriev system base hierarch code number document categori drop probabl remain reason valu categori paramet question solv number categori retriev system influenc drop probabl queri figur find answer case simul tree approxim categori analyz drop probabl case result examin anova test conclud drop probabl independ number categori confid drop probabl fd number categori fd fd fd fd figur drop probabl number categori tree import question determin repercuss percentag categori parent system convert simpl tree perform simul model graph percentag categori parent account methodolog parent categori higher drop probabl system level categori signatur parent reason part common total number produc smaller drop probabl step determin effect drop probabl categori parent experi categori level ad parent account differ parent real parent start approxim categori parent result show figur drop probabl differ percentag categori parent figur drop probabl percentag categori graph show drop probabl number differ exist parent figur observ consequ differ categori differ drop probabl parent categori differ node drop probabl valu assum worst queri restrict categori sum distribut categori import influenc drop probabl retriev system side number categori system independ drop probabl number categori parent effect effect relat depth parent categori differ signatur number categori root valuabl assign parent higher level differ drop probabl graph made categori worth variat weight case document test interact categori document addit relationship system categori parent document assign categori drop probabl worsen ad factor structur paramet section describ repercuss structur graph drop probabl previou experi simul graph document assign leaf node deepest level graph perfectli balanc perform evolv tree simul approxim number categori check drop probabl obtain result interest drop probabl improv slightli reason base graph balanc leaf categori fewer improv drop probabl import structur factor depth graph simul graph number categori depth result displai figur drop probabl graph depth figur drop probabl versu depth graph simul signatur built bit weight bit depth graph produc drop categori level reason code higher depth impli number signatur drop probabl depth graph critic paramet repercuss drop probabl variat system depth studi code articl code repres hierarch categor inform retriev web directori code signatur file special fix number word block signatur small weight explain code flexibl power tool dynam environ categor inform retriev system base direct acycl graph util appropri code repres determin princip factor alter drop probabl result demonstr flexibl adapt code system paramet import effect drop probabl percentag categori document depth graph drop probabl complet independ import number categori number document collect structur graph work step hierarch code result encourag aspect improv techniqu gener signatur mathemat develop relat code author continu work implement prototyp web directori techniqu code measur improv obtain time inform retriev system appendix drop probabl formula section calcul drop probabl formula signatur bit weight word demonstr complex combinatori problem obtain express drop probabl account basic drop fd actual drop total number number actual drop easili da obtain number drop complic calcul dt sum df order achiev number drop dt repres combin retriev match specif signatur combin bit set dt rw number time combin bit set repeat combin formula calcul rw rw lead directli equat show section refer modern inform retriev signatur navig text signatur access method document analyt perform evalu acm transact offic inform system access method text acm comput descript perform analysi signatur file method offic file toi survei inform retriev filter technic report dept comput univ inform data structur algorithm special processor text retriev engin search hierarch structur directori set cikm real life inform studi user queri web acm sigir applic random code gather statist bulletin mass base ms access inform web partit signatur design issu perform evalu toi effici signatur file method text ieee transact data knowledg engin cs retriev method code mathemat analysi code american pp
IR/525 5 keyword search bank soumen chakrabarti sudarshan comput scienc iit bombai abstract growth rapid number user access onlin detail knowledg schema queri simpl queri languag design complic describ system enabl search relat data schema bank enabl user extract inform simpl manner knowledg schema write complex queri user inform type interact control displai result bank model tupl node connect link induc foreign kei relationship answer queri model root tree connect tupl match individu keyword queri answer rank notion proxim coupl notion node base similar techniqu develop web search present effici heurist algorithm find rank queri result introduct relat commonli search structur queri languag user data schema suitabl queri search engin web popular altern unstructur queri paradigm simpl user type keyword follow hyperlink navig document knowledg schema current berkelei support fellowship current persist system india partli support ibm faculti partnership grant growth world wide rapid number user access onlin detail knowledg schema queri simpl queri languag design complic user queri languag data mismatch keyword search techniqu locat inform collect document data store relat inform answer keyword queri split due normal bibliograph shown figur paper author citat extract dblp repositori schema shown figur figur show fragment dblp depict partial titl paper inform distribut tupl relat foreign kei refer user paper queri keyword base identifi tupl keyword ascertain proxim link answer keyword queri web start point locat requir inform similar facil context search inform describ techniqu keyword search develop part bank system acronym keyword bank system enabl data schema search relat bank enabl user inform type interact control displai absolut queri languag mine pattern tempor descript length cite cite cite paper write author foreign kei primari kei byron dom sunita sarawagi sunita soumen chakrabarti sunita paper tupl author tupl author tupl author tupl write tupl write tupl write tupl schema fragment figur dblp bibliographi ming requir contribut paper outlin framework keyword queri relat framework make join implicit incorpor notion proxim rank answer fair amount earlier work keyword queri includ describ connect bank model relat work keyword search section present effici heurist algorithm execut keyword queri describ kei featur bank system keyword search bank proxim base base foreign kei link type link model tupl node cross refer edg bank queri keyword match data textual meta data column relat greatest bank li web publish relat data remain web bank publish organiz bibliograph electron catalog search facil applic hand web site provid form carri limit type queri backend web site provid form interfac search faculti student search depart requir search offer creat interfac task user expend effort find form approach case export data web provid text search web document approach result duplic result problem version addit space time overhead highli connect feasibl export combin bibliograph export detail paper web queri requir find citat link paper support bank rich interfac automat gener foreign kei displai result bank creat hierarch graphic view data hyperlink facil built bank system develop java servlet run schema program bank access web rest paper organ section outlin graph model repres connect model answer relev section outlin algorithm increment find answer keyword queri present overview featur bank section section outlin preliminari evalu system discuss relat work section section outlin direct futur work section conclud paper queri model section describ relat model graph bank system evalu option describ model formal inform model descript model direct graph tupl node graph link model direct edg tupl easili extend type extend model includ edg valu referenc column referenc tabl refer column refer tabl refer column kei refer tabl answer queri subgraph connect node match keyword subgraph appar inform convei identifi node graph central node connect keyword strongli reflect relationship answer root direct tree direct path root keyword node motiv outlin call root node inform node tree connect tree conceptu model similar differ detail section import link depend type link relat connect bibliograph link paper tabl write tabl stronger link link paper tabl cite tabl link paper cite tabl higher weight weight tree proport total edg relev tree relat weight figur illustr link point root root requir model write relat foreign kei paper author requir path paper foreign kei edg opposit direct simpli regard edg undirect ignor problem connect larg number node depart larg number faculti student act hub node short distanc reduc effect score solv creat backward edg edg model weight directli proport number link node type comput weight present section figur backward edg ensur direct tree root path leaf illustr effect backward edg return depart forward edg student depart back edg depart student form path pair student depart student back edg assign higher result lower proxim pair fewer student regist bibliograph paper smaller number backward edg weight paper write node result higher proxim restrict inform node select set node exclud node tupl set root node similar scheme figur keyword node author relationship induc due paper node tree shown figur backward edg paper node write connect tree keyword paper node inform node incorpor interest node inspir rank pagerank googl node multipl pointer higher current implement set node node higher node weight correspond higher bibliographi citat user queri queri optim techniqu give higher paper citat tpcd store inform custom order inform refer supplier custom queri match part order higher node weight tree weight combin relev score discuss section formal model base discuss model node node weight edg forward backward edg similar measur relat tupl graph node speak interchang tupl node graph node node graph assign weight depend node current implement set node function node extens handl transfer googl pagerank easili ad model pair tupl foreign kei graph edg back edg extend handl type similar similar relat relat referenc relat referenc relat similar depend type link relat relat set infin relat doesnt refer relat edg weight forward link foreign kei relationship reflect strength proxim relationship tupl set default set desir reflect import link valu correspond greater node respect relat belong weight direct edg depend link link link exist exist simpli assign weight exist earlier assign weight contribut tupl belong relat exist assign weight minimum choic view weight resist electr parallel resist queri answer model queri consist search term step locat node match search term node relev search term search term part attribut metadata tabl view tupl belong relat author regard relev keyword search term queri find set node relev sn extens model incorpor queri requir keyword author easili incorpor approxim match keyword word present tupl extend model incorpor node relev featur implement omit detail answer queri root direct tree node note tree node steiner tree relev score answer tree comput relev score node edg weight condit node present relax answer figur show sampl result queri keyword soumen sunita execut bibliograph result tree node tupl intermedi resp tabl column indent depict tree node keyword distinguish intermedi node color node answer tree assign relev answer present order score score involv combin relev clue node edg node weight edg weight provid separ measur relev desir final relev score rang control variat individu weight node edg larg weight skew result excess approach scale individu node weight maximum node weight graph depress scale logarithm weight inform normal score node defin quantiti log base figur result queri node score averag node score favor root reduc effect intermedi leaf node root node comput averag node multipl search term count time number search term avoid give extra weight tree separ node keyword normal edg score edg divid edg weight min minimum edg weight make depress scale defin edg score edg score defin give lower relev larg tree quantiti rang combin edg score node relev addit factor control rel addit combin formula multipl combin formula total option edg node score valu evalu discard involv log scale multipl score tend compar remain combin inspir standard ir weight smooth choic paramet relat system review search answer comput minimum steiner tree hard made complic node weight requir comput relev tree interest relev tree high relev part user search gener answer increment avoid gener answer low relev user present outlin backward expand search algorithm offer heurist solut increment comput queri result complet detail found full version paper assum graph fit memori moder larg node store attribut tupl rid structur index map rid graph node indic map keyword rid disk resid result graph larg million node edg fit modest amount memori set keyword term set relev keyword disk resid indic keyword backward expand search algorithm concurr run jsj copi dijkstra singl sourc shortest path keyword node sourc copi algorithm keyword node keyword creat singl sourc path iter sourc put order distanc node output empti result requir iter remov top iter node iter iter node output insert iter order distanc node output visit iter creat set origin origin origin iter origin empti empti insert origin tupl creat tupl root path origin node tupl root child continu duplic result full output remov top result insert order relev score figur backward expand search run concurr creat iter interfac shortest path creat instanc iter keyword node copi singl sourc shortest path algorithm graph edg direct idea find common vertex forward path exist node set path defin root direct tree common vertex root keyword node leav tree form connect tree root tree inform node figur keyword node algorithm shortest path iter start keyword node iter visit paper node algorithm gener connect tree root paper node inform node keyword node leaf node tree shown figur connect tree edg direct paper node edg figur opposit edg graph algorithm gener result detect inform author paper figur show pseudocod backward expand search algorithm algorithm pick iter vertex output distanc sourc vertex iter distanc measur extend includ node weight node match find inform node connect tree vertex maintain search term empti initi iter start keyword visit node iter visit node keyword node iter resp connect tree root node keyword node gener gener connect tree node gener cross product node rest fu cross product tupl correspond connect tree root node tree root child tree form remov root node answer gener connect insert node list connect tree gener algorithm approxim sort order weight weight tree sum weight relev tree comput tree weight node weight discuss section node weight consid gener connect tree tree gener exact relev order gener connect tree sort relev comput cost lead greatli time gener initi result avoid maintain small heap gener connect tree heap order relev tree ad tree heap output heap add output tree highest relev replac heap answer remain tree heap output order relev heurist tree gener found work small heap size algorithm gener tree isomorph gener smaller tree higher root larger tree higher node weight larger tree higher relev modulo version call tree duplic tree repres inform node retain highest relev discard rest list result gener duplic detect result duplic relev smaller remov duplic heap insert result heap happen result necessarili gener order relev duplic result case discard result relev higher duplic output earlier bank system rich interfac data store relat system automat gener browsabl view relat queri content program user requir displai foreign kei attribut hyperlink referenc tupl primari kei column find referenc organ referenc relat specif referenc relat select tabl displai varieti tool interact data column project select column foreign kei click result referenc tabl join column displai elimin explicitli write join queri normal case foreign kei join join featur primari kei referenc foreign kei result result distinct valu column displai user click valu tupl tupl displai tabl sort column control oper access click column tabl header displai data schema support figur show result thesi start student menu roll number attribut effect join thesi relat drop column join made figur sampl session thesi relat attribut referenc student relat sampl menu shown attribut refer faculti tabl underlin attribut valu hyperlink bank templat provid predefin wai displai data templat instanc store hyperlink access templat bank system type olap group templat hierarch view sequenc group attribut group student relat depart program attribut initi displai click depart show program click program show student program select depart folder view similar model folder view file directori support environ window explor graphic interfac templat permit inform displai bar line chart pie chart format hyperlink provid graphic data html imag click bar bar slice pie chart show tupl interest featur templat visual manner action hyperlink script user show detail tupl experi perform implement bank jdbc connect ibm experi dataset dataset part dblp repres structur relat format node edg result bank graph dataset inform master phd dissert iit graph thousand node ten thousand edg benchmark evalu rank algorithm domain work select data set academ research relat pick queri illustr wai queri inform keyword author author common author keyword titl queri proper paramet discuss found system return intuit answer ahead intuit case anecdot give exampl queri answer return bank queri dblp mohan top mohan ahuja mohan due confer write relat tupl author queri return jim grai classic paper book grai reuter top answer thesi queri return comput scienc engin depart higher relev number thesi word larger number refer depart gave higher node weight queri return thesi written advisor sudarshan dblp queri return answer shown figur queri return stonebrak connect sunita seltzer paper stonebrak separ log scale answer lower rank answer larg backward edg stonebrak write tupl high weight due larg number paper written stonebrak space time bibliograph node memori util mb java implement notori wast space graph drop page field averag lambda lambda figur error score paramet choic minut load time spent java structur creation expect smaller memori util time properli tune implement graph queri queri bibliograph prototyp tune feasibl bank moder larg effect paramet perform evalu conduct queri form outlin earlier queri chose answer felt call ideal averag answer queri ran algorithm combin paramet node score function score stop answer paramet comput absolut rank differ ideal answer rank answer paramet set sum rank differ raw error score paramet set scale score set worst error score consid answer tree root answer miss paramet rank differ assum number answer figur show error score edg weight repres drawn perform studi import effect node rank set log scale edg weight error score set log scale edg weight error score set edg error score node score log scale edg weight note absolut valu error score ignor edg weight result gener order edg weight sort relev score limit heurist discard tree root node child elimin larger tree root node high node weight reduc edg weight rang back edg popular node high weight result intuit correct answer poor relev rank good set log score reduc error score score combin impact rank result error absolut valu relev score node log scale gave rank log scale construct scenario log scale rank stabl choic paramet coupl log scale edg weight relat work bank close relat system part softwar model queri answer root tree correspond root call comput relev score return tree maximum relev detail underli graph formal differ bank assum model refer edg explicitli repres edg model attribut type model nest simpli edg type work ad xml support bank techniqu assign weight back edg base node weight counterpart node weight base prove critic web anecdot evid show import context search bank effect metadata queri made explicit idea proxim search repres graph goldman al support queri form find object object restrict result tupl relat set permit result structur tree explain arriv answer unlik node edg weight techniqu commerci system natur languag search keyword data store relat varieti task approxim word match natur languag understand detail handl keyword queri publicli web search natur applic graph connect page singl page li al couch problem term steiner tree graph handl queri exploit proxim primari concern bank combin proxim unlik structur data sourc system keyword search sarda jain implement handl path length greater rank system default rank system criteria bank miller al describ system queri data store concentr dynam gener multipl hierarch view user drill find requir data select predic keyword queri object orient browser provid navig click object support keyword search system power facil present interfac blend queri queri requir user schema shneiderman al develop system displai chemic search home base concept dynam queri system focu graphic user interfac keyword unlik bank al provid detail survei relat work graph model queri model present detail detail queri evalu algorithm paper ongo futur work extend bank system handl keyword search xml data plan implement queri investig author transfer form spread node point heavi node user heavier implement form approxim concurr approx paper concurr publish summar group output tupl set tree user answer tree structur explor support extern html aid support integr inform multipl plan system featur includ author mechan select data user queri evalu keyword match metadata larg number tupl defin relev keyword problem keyword match larg number node work techniqu speed queri perform backward search larg number search forward probabl inform node select keyword develop integr keyword queri system relat bank user knowledg system schema queri relat bank greatli reduc effort involv publish relat data web make searchabl exampl type data publish bank includ organiz bibliograph data product catalog framework answer keyword implement algorithm find queri answer increment evalu prototyp term speed answer academ bibliograph observ bank practic moder larg result intuit implement part bank perform evalu refer srinivasan graphic interfac od proc acm page hawk dark matter web poster web sudarshan keyword search bank technic indian institut novemb brin page anatomi hypertextu web search engin comput network isdn william integr object proc intl conf page explor plain languag proc intl conf page proxim search proc intl conf page sudarshan keyword search ieee data engin sept agraw retriev organ web page web page william customiz publish web ieee munro papakonstantin visual interfac integr queri xml visual associ search method heterogen integr mechan configur combin data model unit state patent number grant april file associ search method navig heterogen includ integr mechan configur combin data model unit state patent number grant octob file sarda jain system search report corr shneiderman dynam queri visual inform seek ieee shneiderman dynam path feb gifford hierarch network search engin exploit hypertext cluster proc acm page
Agents/526 1 corpor memori suppli web memori abstract modern product discov knowledg addit factor product trend develop implement corpor memori system global economi lead tighter corpor relat knowledg product exist singl compani particip compani respect suppli chain modern product center knowledg manag face difficult task integr distribut knowledg sourc contribut state interest research integr corpor memori step singl product lead suppli chain memori research develop lead suppli web memori introduct global economi liber lead manag trend reduct vertic rang manufactur realiz shorten flexibl demand modern industri product high complex function manufactur assembl process complex knowledg capac singl forc spend huge effort research develop framework small small batch size establish cooper manufactur complex industri product distribut fashion realiz suppli chain autonomi face rapid chang market requir cooper relationship necessarili static product structur normal fact yield logist defin distribut product knowledg product part product product factor ad chain provid knowledg qualiti ingo bremen quantiti singl lead integr knowledg manag busi inform system lead corpor memori system face task distribut product suppli web gap corpor memori bridg result manag control inform qualiti quantiti situat discuss address point view respect ongo extern cooper support effici inform logist infrastructur inform logist handl design implement object final knowledg singl product manag maintain custom demand suppli chain relat import task manag knowledg short term suppli web lead research interest analysi design distribut knowledg repositori transit corpor memori suppli chain memori suppli web memori corpor memori inform handl complex product bottleneck inform manag identifi amount qualiti inform inform flow separ mayor flow technolog detail product preserv econom administr due separ inform flow correspond strong borderlin exist process product control schedul system individu extrem special independ histor path system evolut tradit approach separ plan activ process implement activ product control result gap involv overcom impli loss inform consequ loss qualiti prolong problemat situat overcom integr knowledg manag approach corpor memori system limit union figur inform share virtual repositori format knowledg product knowledg shop floor capabl machin human resourc suppli chain memori mainten knowledg compani satisfi modern product complex product manufactur assembl singl network compani establish knowledg manag suppli chain lead great number unsolv integr heterogen knowledg manag privaci intern knowledg recent product question stai unansw clear find knowledg product manufactur singl compani role product knowledg keeper distribut produc inform modul produc tier lack transpar product knowledg lead loss time qualiti product knowledg manag system support suppli chain balanc individu compani privaci autonomi liber knowledg share enabl higher qualiti econom product hand system overcom heterogen knowledg compani knowledg manag system face problem autonomi autonom agent infrastructur suppli chain knowledg manag enabl automat negoti intern process knowledg hidden individu autonomi model framework agent appli hand lead problem common autonom agent design model complex behavior entir compani deal lead mutual conflict interest hand suppli chain memori emerg agent overcom heterogen knowledg agent provid knowledg intern structur organ awar actor environ perceiv environ abil cooper coordin agent meet requir architectur introduc featur conflict balanc reactiv delib scalabl social aspect heterogen inform integr address section architectur agent design meet requir framework comput mediat suppli web provid framework adapt commun behavior base explicit conflict manag resolut cope semant heterogen transit central corpor memori suppli web memori approach overcom inform bottleneck hamper effici suppli approach problem major claim argument agent base approach autonomi particip suppli import respect accept technolog autonomi forc exchang inform special inform structur problem transform inform syntact structur level solv reli present standard semant agreement reach standard product classif compet produc automobil industri receiv car equip supplier suppli web memori agent repres compani commun demand product product specif suppli web order make supplier standard product classif agent demand product categori hierarchi commerci militari privat vehicl accessori compon transport compon system automot locomot marin truck potenti supplier mention classif problem figur exchang semant inform identifi request product product classif standard match semant level hard standard correspond class window compar hierarchi easili diverg conceptu standard automot technolog automobil automobil air filter fuel filter window order make approach agent deal kind semant mismatch ideal agent solv semant conflict user interact vision illustr figur produc request product agent translat request commun agent supplier agent mediat translat back terminolog produc approach solv defin map common approach integr problem provid possibl defin map approach kraft translat ontolog special mediat agent custom translat terminolog languag approach great fail ensur preserv user free defin arbitrari map make produc conflict lexic relat attempt provid intuit semant map concept ontolog made observ system approach extend common descript logic model quantifi relationship borrow linguist relationship cover disjoint relat defin valid human expert result definit make automat translat difficult semant correspond approach overcom ambigu indirect map concept ground attempt identifi semant correspond concept classif order avoid arbitrari map approach reli common vocabulari defin concept terminolog descript logic model term inform sourc show subsumpt reason establish relat terminolog similar approach imagin exchang product inform global economi liber huge demand modern cooper tempor logist network adequ develop requir innov fundament concept method manag control integr inform logist usag cooper agent inform logist infrastructur methodolog knowledg manag support distribut manufactur assembl explicit handl knowledg suppli chain enabl react chang requir flexibl architectur reli architectur combin automat semant translat product classif implement approach challeng area research refer adapt multiag system appli tempor network page illarramendi approach queri process global inform system base preexist ontolog ifci intern confer cooper inform system editor logist inform juli cui kraft architectur knowledg fusion transform intern confer system appli artifici intellig context model transform semant knowledg meet woelk synthesi adapt multiag commun protocol product engin domain intern workshop emerg synthesi page
IR/527 5 combin label unlabel data text classif larg number categori rayid ghani center autom learn carnegi mellon abstract major concern learn techniqu text classif requir larg number label exampl learn accur reduc amount label data requir develop algorithm learn effect small number label exampl augment larg number unlabel exampl develop framework incorpor unlabel data output code setup multiclass problem multipl binari problem learn individu binari classif problem show method classif task involv larg number categori doesnt perform combin outperform algorithm combin label unlabel data text classif introduct enorm growth inform led compar growth method user organ inform area recent research activ autom learn techniqu categor text document major difficulti learn techniqu text classif requir larg number label exampl learn accur collect larg number label exampl algorithm provid accur classif label exampl reduc amount label data requir develop algorithm learn effect small number label exampl augment larg number unlabel exampl unlabel case text classif easier obtain label exampl web huge amount text data serv unlabel data classif task collect text trivial quick web spider crawler program automat task unlabel data process build text classif system significantli faster recent work learn algorithm combin inform label unlabel data approach includ maxim estim maximum posteriori paramet gener model text classif gener model built unlabel data perform discrimin classif transduct infer support vector machin optim perform specif test set studi shown unlabel data significantli classif label train data relat bodi research label unlabel data problem domain featur natur divid disjoint set blum mitchel present algorithm classifi web page build word word hyperlink point page dataset featur natur partit algorithm fall set show learn label unlabel data hold assumpt set featur suffici featur set instanc independ class publish studi text classif type algorithm nigam problem clear gener classif task larg number categori output code suit classif task larg number categori earlier work text problem earlier work problem larg number categori develop framework incorpor unlabel data ecoc setup multiclass problem multipl binari problem learn individu binari classif problem show approach text classif problem involv larg number categori outperform algorithm design combin label unlabel data error correct output code error correct output code shown perform text classif ecoc work convert learn problem larg number learn problem learn algorithm handl learn problem appli learn problem algorithm work assign class uniqu binari string length refer codeword train classifi predict bit string predict class codeword closest codeword produc classifi distanc metric experi ham distanc count number bit codeword differ process map output string nearest codeword ident decod step code ffl train phase problem creat binari matrix class assign row train base classifi learn binari function column column divid dataset ffl test phase appli classifi test combin predict form binari string length classifi class nearest codeword combin ecoc algorithm aim combin advantag ecoc offer classif larg number categori combin label unlabel data ecoc work multiclass problem multipl binari incorpor unlabel data framework learn binari problem algorithm ffl train phase problem creat binari matrix class assign row train classifi learn binari function column column divid dataset ffl test phase appli classifi test combin predict form binari string length classifi class nearest codeword problem naiv binari problem learn binari approach effici ecoc reduc number model classifi construct approach number class detail ecoc effici text classif ecoc found approach perform nave approach condit ecoc outperform nave multiclass problem learn model improv singl nave classifi binari problem unlabel data complic fulfil condit unlik normal binari classif problem shown work case involv binari problem consist multipl class class bit creat artifici ecoc consist learn arbitrari binari function class ecoc bit consist multipl class origin dataset sampl classif task consist class ecoc bit partit data class class class actual class number train exampl distribut skew pick initi label exampl randomli class origin class label origin confid label unlabel class condit initi label exampl cover target function binari partit learnabl underli featur split redund independ algorithm util unlabel combin ecoc result improv perform unlabel data descript algorithm nave base classifi experi learn binari problem ecoc classifi algorithm compar approach nave naiv simpl effect text classif algorithm learn label data multinomi model defin word document assum gener independ class laplac smooth calcul word probabl em algorithm compar approach learn label unlabel data shown nigam al techniqu significantli text classif accuraci limit amount label data larg amount unlabel data dataset assumpt correl class singl multinomi compon badli basic em perform suffer em iter statist techniqu maximum problem incomplet data model data data miss em local maxim likelihood paramet give estim miss valu naiv gener model applic em paramet estim class label unlabel data treat miss valu implement dataset dataset experi section hoover dataset corpu web page collect webkb group cmu hoover onlin web resourc crawl compani web examin web page set categori consist class label compani industri sector belong classifi categori classif scheme popul class document dataset compar classif algorithm natur featur split randomli divid vocabulari equal part appli featur set shown random partit work absenc natur featur split job dataset dataset obtain lab consist job titl descript organ level hierarchi level categori leaf categori exampl consist job titl job descript job titl job descript independ redund featur set result code experi code code job dataset code hoover similar tabl classif accuraci dataset naiv ecoc unlabel data algorithm access amount label unlabel data dataset naiv ecoc em ecoc label label label label label label label combin ecoc tabl show result experi compar algorithm em baselin result nave ecoc unlabel data label serv upper bound perform algorithm result report recent paper nigam clear give leverag unlabel data dataset consist larg number class em improv classif accuraci unlabel data neg effect result accuraci accuraci report em iter experi stop compar combin ecoc advantag unlabel data em outperform algorithm dataset worth note ecoc outperform nave dataset pronounc number label exampl small figur show perform algorithm term tradeoff recal standard evalu measur text classif inform retriev literatur nave em good give result result classifi learn em nave classifi skew score test exampl good provid accur probabilist estim nave ecoc result classif reason level recal result encourag enorm applic requir result search engin hypertext classif system algorithm learn binari problem creat framework present paper incorpor unlabel data learn individu binari function learn algorithm learn binari function label unlabel exampl emploi algorithm hybrid em learn binari problem iter algorithm featur split similar fashion featur split featur set train classifi featur proce initi naiv classifi label data probabilist label unlabel data classifi train label data unlabel data label relabel data process iter classifi converg predict combin recal naiv em ecoc cotrain figur recal graph dataset train classifi converg quickli em run iter algorithm thought closer match theoret argument cotrain algorithm essenc argument initi classifi gener larg sampl data train classifi algorithm learner assign label unlabel classifi learn algorithm learn singl time result ecoc perform job dataset hoover kei differ algorithm unlabel exampl iter ad label set perform job dataset due fact relabel prevent algorithm stuck local minima make sensit choic initi exampl discuss futur work note run experi approach sensit initi document provid label exampl lead form activ learn combin method pick initi document perform pick random document mention section learn arbitrari binari function class creat artifici label origin confid label unlabel class ran experi train exampl cover class result report previou section number exampl chosen initi class wai ecoc train ecoc classifi featur set separ combin interest pursu approach futur work potenti drawback approach type algorithm redund independ featur set experi report split featur set random fashion hoover previou work shown random partit featur set result reason perform preliminari work develop algorithm partit standard featur set redundantli suffici featur set extend applic approach regular dataset result shown tabl encourag combin ecoc improv unlabel lot room improv column naiv ecoc label data give upper bound classifi correct label unlabel data reach level perform leav room improv algorithm base approach result paper lead combin ecoc algorithm learn label unlabel data shown approach outperform em shown work text classif task approach perform term accuraci smooth tradeoff applic requir result shown framework present paper gener algorithm learn binari function label unlabel data successfulli ecoc refer output code text classif workshop machin learn inform filter combin label unlabel data annual confer comput learn theori maximum likelihood incomplet data em algorithm journal royal statist seri solv multiclass learn problem output code journal artifici intellig code text classif intern confer machin learn morgan kaufmann san code effici text classif larg number categori master thesi center autom learn carnegi mellon hypertext categor hyperlink pattern meta data intern confer machin learn william morgan kaufmann san exploit gener model discrimin classifi advanc neural inform process system transduct infer text classif support vector machin intern confer machin learn morgan kaufmann san naiv independ assumpt inform retriev machin tenth european confer machin learn comparison event model naiv text classif workshop learn text categor analyz applic effect acm intern confer inform knowledg manag acm text classif label unlabel document em machin
AI/528 2 mix depth dialog process susan mcroi depart electr engin comput scienc wi sy ali depart mathemat scienc wi susan comput scienc engin depart wi abstract describ work develop gener tutor system student practic skill number domain tutor support natur languag interact natur languag process knowledg compon gener lead tradeoff limit superfici process syntact difficulti deeper method conceptu student utter short requir extens reason domain model fulli resolv full disambigu rare solut encod syntact conceptu inform structur framework produc detail request tend produc partial question tend requir infer knowledg framework reason process domain system reason introduct build support system involv collect larg amount knowledg involv provid mechan reason knowledg effici make project involv research medic colleg work system support tool build system educ student aim give student opportun practic make skill number scenario differ control manner give student opportun system explain factor influenc system import goal work develop tool cover number includ medic life skill good nutrit student success program graphic part system interfac fairli gener interact student system natur languag approach system explain fairli sophist topic posit comput scan support diagnosi tailor interact user concern appar level understand approach student great deal flexibl phrase question request student utter short requir extens reason domain model fulli resolv full disambigu rare solut shallow deep depend time creat matter shallow surfac syntact text string deep convent ai knowledg account aspect languag understand lexic mark case attach modifi uncertain refer quantifi distinguish descript noun phrase unlik primarili storag subject logic infer reason system repres sentenc mean multipl level build separ complet structur level process parser defer semant process resolv semant ambigu full knowledg correctli approach opportunist build semant constitu structur inform inform syntax utter includ semant inform properti object introduc semant interpret parser linguist base grammar process student type input produc structur captur syntact mark conceptu inform encod requir reason domain context left knowledg process primari benefit approach gener languag conceptu structur built initi phase specif domain express languag grammar cover wide varieti syntact construct includ fragment sentenc sentenc rel student request diagnost varieti form includ give stori describ case stori case uniform structur built parser subject conceptu framework includ plan recognit student request diagnost mention step tutor plan includ stori mention tutor plan tutor approach framework produc detail request interpret plan recognit produc partial question tend requir knowledg framework system reason system reason paper overview tutor describ natur languag knowledg compon approach question request domain develop medic student learn statist model medic diagnosi exampl domain plan system gener stori problem describ scenario student drawn support request explain reason question fact model prototyp current system tutor shell present predefin stori problem question basi store inform medic patient doctor complain pain inform statist relat aspect patient medic find physic examin result previou diagnost candid inform repres bayesian belief network shell design gener network node diagnost procedur output includ prior posterior probabl evid symptom test candid test rule rule detail case includ facil explain system reason show path belief network determin probabl calcul explan mirror structur infer produc includ small step human reason happi ignor explan repeat content time preliminari user studi system student medic colleg wisconsin reveal import student idea set hypothet case wit action affect statist likelihood candid diagnosi student system overwhelm irrelev inform risk mislead answer question narrowli teacher student prefer give student explan tailor singl word answer justif model deal knowledg system perform task reli varieti inform sourc task ffl manag interact user includ interpret utter ffl reason relat compon medic case histori occur ffl bayesian reason includ abil explain identifi factor task interact address handl queri knowledg underli queri knowledg gener varieti knowledg sourc translat knowledg sourc effect solut inform sourc ffl linguist knowledg knowledg mean utter plan express mean text ffl knowledg knowledg rhetor relationship link utter ffl domain knowledg factual knowledg medic domain medic case ffl knowledg tutor task ffl knowledg statist model interpret inform deriv model interact task inform knowledg sourc repres uniform framework knowledg compon serv central compon architectur system consist compon figur direct arrow direct inform flow compon system user input graphic user interfac support natur languag interact input parser compon perform level process user input grammar domain inform knowledg compon parser interpret user input form proposit utter analyz gener produc natur languag output text messag descript receiv planner gui charact stream gui action mediat planner analyz text plan act kr access inform request bayesian net bayesian net kr updat bayesian net bayesian net statist inform bayesian net queri charact stream charact stream domain knowledg access action kr updat text plan oper net kr updat knowledg user surfac act text messag domain knowledg access knowledg compon figur architectur system control modul call analyz analyz determin user action basi model model store knowledg compon analyz invok planner select content structur analyz reli compon call mediat interact bayesian network processor mediat process domain level rank effect altern diagnost test mediat handl inform interchang proposit inform analyz probabilist data bayesian network processor phase process record knowledg result complet histori knowledg compon serv central compon initi transfer inform file specif bayesian network bayesian network processor knowledg compon mediat convert specif proposit captur connect origin bayesian network knowledg blackboard repres domain knowledg knowledg uniform framework proposit semant network proposit semant network framework repres concept cognit agent capabl languag term inform repres graph node label direct arc proposit semant proposit repres arc repres binari relat node system analog shapiro provid facil build find node reason system satisfi addit node repres uniqu concept concept repres network repres uniqu node knowledg repres concept repres structur entir network connect node repres concept constraint effici infer process natur languag network repres complex descript medic support resolut ellipsi gener reason task subsumpt shapiro shapiro knowledg uniform kind knowledg knowledg base infer process knowledg compon uniform domain probabilist knowledg bayesian support commun cooper interact process tutori dialog rule figur good uniform inform semant network relat domain inform medic plan inform plan describ network repres text plan describ medic case user text plan repres rule knowledg rule gener statement object repres case frame foral exist arc node repres variabl bound quantifi arc figur node rule quantifi variabl end foral end ant consequ end cq mean instanc suitabl instanti instanc consequ believ state end case number end piec case plan case frame set arc eman node express proposit express isa case frame node member arc class arc dictionari standard case frame addit case frame defin describ case conjoin piec case inform node repres concept member class case repres concept case concept case number case inform detail knowledg ant class case member cq act action lex describ plan action conjoin lex lex foral foral foral figur rule state case number piec case plan gener descript case present piec inform coordin conjunct model level shown figur level captur student system utter extend ongo unlik model includ question statement fact repres question request typic give utter procedur interpret oper explicit question request simplifi interpret utter technic term rhetor structur theori refer coordin conjunct stand test exchang system interpret utter sequenc utter utter level interpret exchang figur level tem recov occur mcroi level start utter shown bottom figur utter level parser produc surfac analyz assert part occurr event type content user utter repres liter case student request stori problem imper sentenc stori declar sentenc express desir stori complet imper sentenc stori shown figur attitud form utter imper action content agent act object lex pronoun action member class lex np det lex member object pronoun lex class lex figur node repres utter form content proposit hearer stori speaker system utter level correspond text gener event inform system mode content system utter text messag languag gener sequenc utter level correspond sequenc utter level compar linguist structur model semant repres sequenc utter assert proposit case frame order utter occur determin structur discuss detail interpret level repres system interpret utter utter event level system repres interpret case frame interpret utter stori shown figur utter believ truth mainten system track agent act lex lex action agent act lex action member class lex interpret lex figur node proposit interpret stori gloss node proposit user request system describ case user case pronoun utter level interpret exchang exchang interpret level fourth level model exchang interpret exchang pair interpret event fit convent structur dialog figur network exchang interpret node repres exchang system question user answer case proposit node assert node exchang proposit node repres system interpret user accept system question user understood question requir proposit node repres system belief node interpret exchang repres node interact level major advantag network knowledg share level term knowledg share associ occur uniform concept repres uniqu node section retriev make inform repres network arc connect proposit node system explain user follow arc node repres utter user system interpret node determin ffl user utter understood answer exchang ffl user answer accept understand point explain system believ user understood system question associ network vital interact start fail current statu develop common lisp program languag analog tool creat underli knowledg domain shapiro develop state york network process tool build reason node proposit semant network graphic develop java program languag run network netscap interfac user commun program initi lisp process bayesian network softwar execut lisp foreign summari goal project give student opportun practic make skill primari modal interact english give student opportun system explain factor influenti natur languag process knowledg compon gener build model repres liter utter interpret relat previou student utter short requir extens reason domain model fulli resolv shown encod syntact conceptu inform structur defer extens reason framework produc detail request produc question knowledg framework reason process domain system reason utter acknowledg work partial fund nation scienc grant gift wisconsin medic depart medicin lex action exchang lex member system user lex lex lex answer class agent act lex accept action action act agent act agent interpret figur node repres proposit node exchang event proposit user answer test rule node repres proposit interpret event proposit user accept question system event refer logic languag natur languag process biennial canadian artifici intellig page canada natur languag process knowledg phd state york comput scienc structur comput educ tool interact bayesian network artifici intellig medicin plan text plan interact intern journal expert page natur languag text intellig system lawrenc erlbaum associ concept proposit semant network cognit reprint brachman ed read knowledg morgan lo rhetor structur descript construct text structur natur languag page kluwer academ boston uniform knowledg nlp system journal natur languag misunderstand negoti mean repair speech act misunderstand abduct infer comput dictionari case frame user manual depart comput suni buffalo consid fulli proposit semant network knowledg page york famili comput mathemat
AI/529 2 behavior histori learn nonstationari condit francoi michaud maja matar depart electr comput universit de comput scienc southern lo ca abstract robot oper nonstationari condit learn modifi control polici adapt chang dynam environ approach manag interact robot method model interact adapt select behavior histori behavior learn valid pioneer robot context forag task result show effect approach advantag regular experienc lead fast adapt special learn robot introduct robot oper situat requir abil adapt chang dynam nonstationari control polici chang time mobil robot design paradigm shown good perform adapt oper open environ approach robust simplic construct typic constitu behavior design execut priorit fix flexibl arbitr mechan fix parsimoni behavior robot easili adapt result diminish flexibl improv dynam select behavior extern intern state control polici modul control select mechan work abstract behavior preprint submit elsevi preprint februari import modul nonstationari condit requir learn model environ robot chang dynam environ modifi polici behavior select level deriv model challeng problem care made select behavior nonstationari independ robot oper environ limit action process perform situat agent base abil cope exploit dynam interact environ model interact consist control mechan case framework preserv kei strength emerg model interact dynam environ case dynam environ topolog metric model directli appli dynam difficult design fulli predict captur robot idea explor paper interact robot environ effici captur observ behavior time robot initi set subset safe accomplish assign task goal algorithm learn select altern behavior exploit order adapt robot behavior experienc dynam robot autonom evalu model type interact environ base robot histori behavior regular sequenc behavior reflect interact robot world robot deriv model reinforc learn fashion perform criterion deriv behavior algorithm continu adapt learn static polici approach valid pioneer robot context forag environ paper organ section describ setup mobil robot show behavior organ deriv interact model chang robot behav section detail explan learn algorithm section present result section explain properti learn algorithm relat nonstationari condit section present relat field reinforc section conclud paper setup task descript experi perform real world interfac pioneer mobil robot figur equip sonar fast track vision system robot program mar agenc reactiv languag program multipl concurr process behavior experi conduct rectangular pen pink block home mark green cylind color object perceiv robot vision suffer variat light intens locat pen angl approach obstacl wall detect sonar dark stripe wall pen strip cardboard improv sonar reflect robot equip contact perceiv obstacl pioneer sonar fig pioneer robot home region robot forag search block bring home region pioneer set behavior initi control govern subset behavior behavior control veloc rotat robot base sonar read visual input analyz interact deriv observ behavior behavior classifi respect robot behavior accomplish behavior search call home home behavior call task make robot move behavior refer condit activ base presenc absenc block front robot intern variabl indic robot block underneath field view push proxim robot home avoid behavior requir safe navig environ activ robot home carri disabl order robot approach home region type handl harm situat accomplish refer design determin condit occur ti dynam interact robot environ robot behavior introduc varieti action repertoir chang accomplish task call contrast type priori condit activ object robot learn activ behavior past experi forag pioneer decid activ period time experienc accomplish task figur show architectur specif compon experi behavior behavior organ subsumpt architectur differ activ issu chang dynam behavior activ particip control robot actual behavior depend rule command issu behavior subsum behavior design mutual function emerg activ multipl behavior time home learn adapt behavior select figur show behavior observ learn interact model behavior assign symbol wire send messag behavior execut gener symbol sequenc repres behavior process sequenc construct tree robot interact environ activ separ learn tree determin base activ learn algorithm home avoid rest command interact model level behavior level behavior sequenc vv activ tree histori behavior fig organ behavior level interact model level color background repres behavior activ search task chosen sensori input behavior shown note behavior classif independ subsum organ experi tree mechan algorithm tree structur store histori behavior upper part figur show typic tree node store type behavior control robot accomplish number time transit node successor made observ behavior node type correspond predomin behavior type node repres search task type node creat home task behavior exploit consecut synchron root node tree observ start task letter behavior node type behavior sequenc shown figur path creat tree sequenc home task tree home behavior search task initi observ behavior sequenc current node tree node depict bold tree task empti increment construct robot task leaf node letter store total perform tree path path complet sequenc behavior averag store current perform trial number determin empir comput store histori behavior result perform valu provid abil learn trigger dynam observ robot environ metric perform depend domain varieti factor evalu perform metric learn algorithm chose studi experi base time behavior object idea learn observ behavior robot limit capabl oper dynam environ optim difficult defin nonstationari detail justif choic section evalu express relat amount time requir accomplish task experienc max tb mb tb max tt tt tb refer mb current cycl evalu activ tt repres averag total number accomplish task updat complet task number determin empir analyz typic establish adapt environ toler poor perform result explor option tt captur dynam environ affect time complet task correct factor boost robot term relat reflect amount control robot task compar effect event handl term penal robot perform time accomplish task past note shown figur sequenc behavior situat robot regard past amount time singl behavior tempor separ node consid effect decid behavior activ memor end node trial activ criteria behavior select tree evalu algorithm basic make activ behavior set option refer observ activ sequenc node tree path interact experienc robot situat robot rel interact select criteria compar perform current posit tree expect perform expect perform node sum store perform multipli frequenc rel current posit tree expect perform start posit tree relat refer access perform memor number time node visit expect perform option current posit tree formula determin expect perform simpl bold node tree figur current node expect perform start node expect perform total expect perform node note longer path necessarili lower evalu function influenc number node path time spent behavior expect perform current posit tree choic made algorithm base ffl option maximum expect perform criterion refer tm maximum ffl situat untri option select untri option select criterion refer untri option untri option perform trial option obtain global option tabl arrai past perform index option updat end trial averag result perform option trial evalu behavior activ criteria place mainten node node creat observ occur accomplish robot result node select directli set lower tm greater equal condit posit overrid select made tm note path expect perform default option behav robot explor accomplish path delet mechan algorithm noisi nonstationari delet path interact model tree repres date expect perform weight averag base frequenc occurr option greater influenc variat option make harder modifi chang strategi option forget path lead explor choic discov world node delet serv regul memori enabl robot respond recent opt delet oldest path tree path store criteria easili substitut applic experi goal algorithm learn dynam inappropri start directli domain experi nonstationari condit make analysi valid properti algorithm extrem difficult gradual address static environ condit complex verifi algorithm learn stationari condit experi multipl robot perform behavior repertoir set optim retrain vision system paramet color detect object creat situat design adjust behavior priori knowledg environ learn occur trial search block bring home note learn robot start task search task start drop block direct home depend proxim robot wall posit drop block rel home task start block direct robot face block comput limit amount memori entir robot program kbyte kbyte learn leav kbyte store tree node approxim fig environ configur pen divid region simpler static unexpect behavior select learn robot configur singl block center wall corner good strategi easili find block robot learn rest front wall order rotat avoid behavior exploit block directli locat learn averag total number accomplish search task compar cycl learn algorithm find frequent thought behavior robot move center pen block behavior made robot rotat random angl random reliabl robot block frequent made robot loop block import note discoveri made robot point design perform experi start block center divid pen region figur figur show plot junction tree number node tree learn trial experi robot learn behavior follow wall block chang strategi chang observ option rest trial observ rest option junction tree chang environ configur occur chang strategi stabil start trial corrobor figur demonstr algorithm quickli adapt environ approach show transfer learn configur initi strategi serv bia elabor special prevent chang dynam end averag total number accomplish search task similar result obtain robot learn pen divid region configur show algorithm improv rapidli adapt behavior select strategi situat experienc environ algorithm converg stabl polici reveal optim regard robot perspect includ limit perceptu field detail descript result obtain static condit present block brought home put center shown figur robot ad gener environ program move avoid obstacl stai forbidden contact mount front gripper forbidden region area pen mark dark tile area surround home corner pen control detect obstacl forbidden robot move backward turn move forward junction trial number number node fig graph number node search task tree experi start block chang divid pen region move forward freeli constraint motion result great deal dynam dark area inaccess sensor enabl enter area nonetheless fig environ configur pioneer program avoid obstacl area mark dark tile tape fifteen experi trial hour learn pioneer robot compar learn strategi addit sourc affect behavior face sonar pioneer robot search block perceiv pursu block push blue pioneer robot red pioneer robot pink block nonstationari condit presenc movement vari greatli experi stai close home move region block learn primarili depend sequenc past experi optim determin task larg amount data statist counter data studi experi video tape order analyz strategi regular found interact algorithm adapt detect interact describ result obtain search task illustr properti learn algorithm learn strategi larg involv rest option sequenc option learn observ observ rest rest rest strategi chang time past perform strategi base learn stabl strategi experi fig search task tree experi figur repres part tree learn robot trial complet tree made approxim node observ option node mainten node observ trial posit equal maximum posit tree note path depend select option path time trial figur show trace choic made trial trial test data choic delimit consist trial option select criterion posit tree tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm fig trace choic made search task tree experi choic made initi favor option strategi remain stabl trial end observ rest strategi prefer trial option explor choic made tm criteria consecut choic valu made posit tree notic trial choic tm criterion overridden made criterion fell shorter path sign robot find block experienc longer sequenc choic gener longer path figur node algorithm robot discrimin situat observ rest rest front static obstacl rest front move obstacl distinct made behavior special process distinguish move static lead distinct strategi behavior select figur show number node tree stop start demonstr store path tree nonstationari condit pioneer robot put pen special differ wai accomplish base number node tree search task trial number fig graph number node search task tree experi specif experi test strategi learn pioneer search task observ rest observ rest learn tree node node frequent path happen pioneer interact greatli easier opportun find block pioneer pen influenc pioneer abil find stabl dynam interact environ effect dynam special occur requir complex commun arbitr scheme manag group discuss experi valid properti algorithm involv import properti nondeterminist nonstationari environ dynam chang agent experi dynam condit determin present state environ complet determin current state action select agent access percept learn robot limit sonar color inform posit posit robot configur environ effect action state occas result state make ariti difficult explain definit relat learn algorithm al environ stationari probabl make state transit receiv specif reinforc signal chang time sutton barto explain nonstationari mean true valu action actual expect reward action chang time chang reinforc signal experi creat nonstationari condit occur environ modifi polici chang valid experi static condit start block center continu pen divid polici learn configur valid occur experi distribut robot pen stationari condit move object pen remain uniformli distribut environ effect learn robot case start evenli distribut chang posit move center pen block move home region lot difficulti learn robot deposit move remot area learn robot interf behavior select polici continu adapt base approach share similar differ reinforc learn paradigm learn manner similar mont carlo learn algorithm averag observ return eventu converg expect learn deriv store past experi current situat action form behavior reward base intern measur deduc behavior time reinforc learn method sensat state command action sutton barto reason restrict state typic applic expect state inform agent approach dynam program approach aim find tabl maxim util valu behavior serv abstract state behavior action behavior process optim fix util function state base behavior combin environ sensori inform control polici behavior depend activ behavior activ made interact model similar combin control signal newli activ sensori input influenc control signal issu newli activ behavior possibl behavior subsum follow principl emerg approach activ behavior control robot accord experienc construct deriv behavior kei differ commonli reinforc learn algorithm discret reinforc complet determin perceiv condit evalu function experi differ approach attempt optim extern criteria time requir accomplish total distanc number mahadevan kaelbl crucial approxim function reinforc learn continu larg finit state space problem perform function relat enabl learn algorithm make learn independ constraint limit robot specif design behavior exist effici strategi approach aim effici behavior accord robot abil interact environ fix extern evalu learn perform abil approach make consist base past good balanc explor exploit option result demonstr algorithm abil approach gener unanticip behavior select burden behavior design behavior acquir knowledg specif complex dynam system robot learn strategi difficult design anticip algorithm attempt captur dynam experienc base tree evalu function compon learn algorithm establish explor adapt exploit stabl behavior select strategi evalu function current situat past experi tree captur sequenc behavior compact fashion make base past experi behavior activ criteria exploit compon determin choic tm criterion favor exploit criteria favor explor find option plai intermedi role explor option node algorithm choic exploit option perform serv memori perform option make learn algorithm adapt easili environ reflect constant fashion perform trial frequent difficult chang evalu made larger number trial subject faster explor exploit outcom recent trial criterion prefer random behavior select favor knowledg deriv past experi blindli explor option path delet influenc choic made affect tree delet factor defin memor abil view principl bia set design affect type strategi learn result continu adapt behavior requir extens train period model nonstationari condit influenc algorithm establish critic point behavior factor activ behavior critic point modifi continu alter behavior variabl robot abil due batteri nonstationari critic point provid robot abil make expect base previou evalu current perform relat work approach fit categori hierarch method deal larg state space learn involv structur gate collect gate function base state behavior action switch execut work gate function fix learn occur behavior suppli individu reinforc function work involv learn gate main differ approach histori behavior percept state select behavior compar learn approach approach tackl problem hidden import mobil robot equip limit noisi sensor pomdp limit markov properti state maintain belief state form probabl distribut theori reinforc learn model exact solut pomdp gener consid present difficult optim task requir exponenti amount space time comput polici requir exponenti size solut pomdp ten state minut converg obtain shown exact solut problem intract cassandra al pomdp model make mobil robot navig real offic environ learn pomdp model valid static environ condit learn pomdp model koenig simmon make approach subset probabl constant made ident initi backward probabl variabl approxim slide time window approach probabl observ insid base algorithm learn histori past experi inspir mccallum approach partit state space raw sensori memori featur encod augment agent perceptu input featur label branch perceptu dimens data histori index step leav tree store util estim action mechan successfulli appli learn drive virtual highwai environ approach learn window serv simultan model environ polici algorithm learn strategi behavior behavior abstract mccallum approach learn complet polici discret state space good concern arrang behavior control robot independ discret continu sensori state work system inform discrimin state focu learn thing priori improv learn time addit appli perform measur independ task concern approach differ mccallum select criteria algorithm path maximum expect reward random algorithm compar current expect perform tree explor affect path delet statist evalu leaf node learn observ behavior activ explor reason work ram santamaria comput complex approach greater develop algorithm context gener control architectur intellig agent base dynam select behavior learn nonstationari challeng problem interact environ affect dynam robot limit approach advoc intern evalu interact advantag valid approach dynam observ behavior select mechan consist framework rel exploit control resourc defin robot perspect result show effect approach advantag regular experienc world fast adapt agent gener condit result show approach lead learn unanticip behavior strategi perspect robot robot autonomi approach predict capabl typic lack make move abstract level gener complex behavior acknowledg support michaud provid nserc scienc engin research council research fund offic naval research grant nation scienc foundat infrastructur grant career grant matar author goldberg rest interact lab insight comment refer dynam structur everydai phd massachusett institut coordin multipl behavior acquir reinforc proc intl conf intellig robot system robust layer control system mobil ieee journal robot intellig artifici multipl agenc reactiv technic robot pack act discret bayesian model proc intl conf intellig robot system dorigo robot develop autonom agent artifici floreano evolut home navig real mobil ieee tran goldberg tool design evalu proc nation conf artifici intellig pack reinforc journal artifici intellig koenig learn probabilist model robot proc ieee intl conf robot autom dynam action proc intl joint conf artifici intellig mae learn coordin proc nation conf artifici intellig vol mahadevan automat program robot reinforc artifici mahadevan pack nsf workshop reinforc summari ai magazin exampl group journal theoret artifici reinforc learn autonom learn select attent memori sequenti anim proc intl conf simul adapt mit reinforc learn select percept hidden phd depart comput ct le control architectur combin motiv situat autonom anim proc intl conf simul adapt mit michaud learn histori mobil robot machin learn autonom joint special issu learn autonom parr approxim optim polici partial observ stochast proc intl joint conf artifici intellig ram multistrategi learn reactiv control system autonom robot machin handbook percept vol chap russel artifici intellig modern learn partial observ markovian proc intl conf machin learn sutton reinforc introduct
IR/530 5 wrapper induct semistructur inform sourc ion steven craig knoblock inform scienc institut integr media system center southern california marina del ca septemb abstract tremend amount inform web daili abil quickli develop inform agent crucial problem vital compon inform agent set wrapper extract relev data semistructur inform sourc approach wrapper induct base idea hierarch inform turn hard problem extract data arbitrarili complex document seri simpler extract task introduc induct gener high accuraci extract rule base train exampl label train data repres major bottleneck wrapper induct result show requir order magnitud fewer exampl algorithm stalker wrap inform sourc wrap exist induct techniqu wrapper inform induct inform agent introduct comput user gain access larg varieti inform repositori web base paradigm make di cult retriev integr data multipl sourc recent gener inform agent whirl ariadn inform manifold address problem enabl inform ed set web site access queri queri restaur la price accept visa assum inform sourc provid inform la guid la weekli figur answer identifi restaur la weekli check accept visa kluwer academ publish print netherland ion steven craig knoblock inform agent gener reli wrapper extract inform semistructur web page document semistructur locat relev inform base formal wrapper consist set extract rule code requir appli rule tsimmi araneu depend human write grammar rule reason undesir write extract rule time consum requir high level di culti multipli applic domain involv larg number exist sourc format sourc document time introduc machin learn method wrapper construct enabl user turn web page relat inform sourc section present formal describ semistructur web section present inform extractor wrapper section describ learn algorithm induc extract section present detail nal section describ relat work describ content web page intend human common convent structur html document inform page exhibit hierarch semistructur inform present form list explicit separ distinguish element observ develop catalog describ structur semistructur document ec descript page structur leav item interest user repres relev intern node ec tree repres list list restaur item leaf list case call figur displai ec descript page top page list credit card document includ list hierarch wrapper induct semistructur inform sourc figur restaur descript document restaur address phone review document food decor servic cost address review figur ec descript page street citi individu address extract data document order extract item wrapper ec descript document set extract rule wrapper rule extract node parent list wrapper requir list iter rule list individu tupl ec tree item extract simpli determin path root node success extract parent parent node wrapper appli rst list iter rule appli xs extract rule extract tupl framework document sequenc token html content root node ec tree sequenc content ion steven craig knoblock thai az la nv ca figur simpli ed version document children subsequ content arbitrari node repres subsequ content parent idea underli work extract rule base group consecut enabl wrapper locat content content restaur descript present figur order identifi begin restaur rule start begin document skip landmark rule appli content node case ect appli consist consum pre end begin restaur identifi end node content appli rule consum su parent order end restaur appli rule end document begin rule call start end uniqu punctuat hierarch wrapper induct semistructur inform sourc mean ignor interpret token landmark consist token immedi punctuat symbol html rule successfulli identifi start restaur match correctli start rule match incorrectli consum stalker earli late rule fail landmark exist document deal variat format extract rule disjunct recommend restaur displai extract base disjunct start end rule disjunct repres special type list order list individu disjunct appli disjunct rule straightforward wrapper appli disjunct list rst match detail section illustr extract process work list case wrapper extract area code sampl document figur wrapper start extract entir list base start rule end rule wrapper iter content list address figur break individu tupl order start individu wrapper start rst token parent repeatedli appli content list success start point previou wrapper determin end address tupl start token parent repeatedli appli end rule ion steven craig knoblock list iter process lead creation individu address content shown line wrapper appli address start end rule assum area wrapper extract zip code list extract list iter remain zip code extract di cult landmark separ state zip code situat rule su cientli easili extend power extract languag extract zip code entir address argument describ apr item consum rule appli rule stop immedi rule mean token landmark ignor rule extrem repres variat rule landmark special order present rest paper rule explain handl construct extract rule present section main advantag hierarch extract base ec tree wrap inform sourc arbitrari level data node extract independ approach reli xed order easili handl extract task document miss item item order context induct algorithm gener extract approach turn extrem hard problem simpler nding singl extract rule account item order complex depth ec tree creat simpler rule deal easier task extract item ec tree parent hierarch wrapper induct semistructur inform sourc extract rule finit automata kei concept de ne extract landmark landmark automata rule previou argument function group function appli order repres landmark automaton landmark sequenc token wildcard wildcard repres class illustr previou wildcard landmark interest su cientli express cient navig ec structur simpl gener ne landmark automata nondeterminist nite automata transit label landmark transit place automaton state landmark match sequenc token input linear landmark automata class la singl accept loop transit transit label loop transit mean token encount landmark lead extract rule present previou section order list linear la order appli rule sequenc token appli linear la order list la match stop match process disjunct iter rule appli slightli di erent manner iter rule appli repeatedli content list blindli select rst match risk skip tupl rst tupl extract base order avoid wrapper disjunct iter rule appli rst disjunct ful ll ion steven craig knoblock palm la la watt figur exampl restaur address section present induct algorithm gener rule identifi start end item parent note nding start rule consum pre respect short similar nding end rule consum su respect suffix di erenc type rule consist start consum rst token start token rst loss rest paper discuss stalker gener start rule learn extract rule input stalker consist sequenc token repres pre xe consum induc rule creat train user select sampl page graphic user interfac mark relev data leav ec page mark gui gener sequenc token repres content parent index token repres start uniqu identi es pre consum describ rule induct present illustr assum user mark area code figur invok stalker train exampl pre xe address end immedi area sequenti cover begin gener linear la criteria match content list disjunct appli success fail match gener tupl combin hierarch wrapper induct semistructur inform sourc la repres disjunct nal cover posit exampl creat linear la remain stalker cover return disjunct induc la algorithm gener rst rule import accept posit exampl reject match algorithm consid uncov exampl base gener rule uncov stalker return disjunct rule gener rule extract item parent stalker invok function figur function input list pair idx sequenc token content instanc token repres start sequenc instanc repres posit repres neg stalker gener rule accept posit exampl reject neg stalker typic sequenti cover long uncov posit learn perfect disjunct linear la accept true posit exampl stalker return consist order list learn disjunct order perform function base straightforward disjunct fewer earli late match case disjunct correct match prefer function greedi algorithm learn perfect gener initi set candid repeatedli select ne ning candid perfect run candid return learn stalker invok improv qualiti rule reduc chanc disjunct match random sequenc step ning process disjunct gener order potenti cover maxim number ion steven craig knoblock exampl al empti rule exampl remov exampl cover al return exampl seed exampl shortest candid seed candid candid candid return seed consist consecut landmark ln number token li token seed add landmark li creat rule wildcard match add rule sequenc seed replac li replac li creat similar rule wildcard match add return figur stalker algorithm hierarch wrapper induct semistructur inform sourc ning disjunct order minim potenti disjunct initi candid ned version gener base seed shortest uncov smallest number token prefix token end seed wildcard stalker creat initi candid la transit label landmark wildcard choic disjunct complet consum posit disjunct consum pre end landmark consum trail describ actual ning present main intuit reconsid train exampl figur stalker start initi candid perfect stalker remov cover exampl gener initi candid note match earli uncov exampl consum ref ix cover order obtain stalker ne ad termin ning search candid consum token pre xe uncov exampl fail exampl ad termin hope ned version eventu turn earli match correct late match cover fail match ne rule match anymor earli match correct match perform type post process replac wildcard merg landmark match immedi ad token short landmark match html claim match signi cantli oper margin uenc improv accuraci rule discuss section explain section disjunct consum token call late easi ad termin turn earli correct match ned version consum token hope avoid incorrect match ad termin fail match ion steven craig knoblock function figur obtain disjunct make landmark speci ad state automaton order perform stalker ning token wildcard prede ned wildcard stalker domain speci wildcard de ned straightforward gener ning termin consist token seed wildcard match disjunct landmark ning termin landmark nement make speci concaten begin end topolog nement add state leav exist landmark unchang transit transit label landmark ning termin nement creat disjunct transit replac note di erent heurist select ning candid current fact straightforward long ne care perform extract task good ning candid match earli uncov ning candid extract correctli train nement make fail exampl match incorrectli set heurist figur prefer candid larger potenti coverag earli correct equal prefer candid earli match intuit prefer featur candid current stalker cient nement landmark token seed locat af ter point match seed hierarch wrapper induct semistructur inform sourc prefer candid prefer candid larger coverag correct match earli match failur match fail match fewer token fewer wildcard fewer wildcard shorter pre xe longer fewer token shorter pre xe longer figur stalker heurist earli match base regular share candid correct match creat dichotomi exampl exist landmark work perfectli case stalker select disjunct fail match altern late turn fail match nement thing prefer candid fewer wildcard wildcard token pure fewer token cover pre xe main goal fulli consum pre fewer token content slot extract main assumpt wrapper induct document share underli prefer extract rule base document templat reli structur heurist consist select candid longer landmark closer item prefer speci landmark order pick current stalker di erent set criteria select candid correct match prefer fail match remain exampl earli late repres incorrect case reason similar cite prefer candid fewer token content ofth fewer longer landmark closer item fewer token cover pre xe case incorrect result extract fewer irrelev stalker easili extend construct rule ning process remain unchang mean landmark ion steven craig knoblock modi cation involv termin match rst token instanc token stalker gener initi candid rule induct restaur address figur order gener extract rule stalker train exampl rst select shortest pre seed token consum wildcard match punctuat stalker creat initi perfect disjunct return rst iter end invok uncov train exampl seed stalker creat initi initi candid match earli uncov stalker select ner wildcard landmark ning obtain landmark nement punctuat hierarch wrapper induct semistructur inform sourc figur topolog nement topolog nement shown figur gener perfect match correctli fail match stalker dismiss wildcard landmark remain repres solut longest end landmark disjunct end return uncov stalker complet execut return disjunct rule result order evalu stalker test inform sourc applic domain wien rst wrapper induct system comparison system fair domain speci follow exact condit kushmerick sourc wien label exact remain work close kushmerick reproduc origin wien extract task wien start randomli chosen train learn extract test unseen exampl repeat step averag number test exampl correctli extract rememb perfect disjunct correctli match reject collect sampl detail descript extract obtain rise locat ion steven craig knoblock repeat procedur train exampl train exampl notic user rare patienc label train exampl section distinct part begin overview perform stalker wien test continu analysi stalker abil learn list extract iter compon approach hierarch wrapper induct compar contrast stalker wien base number exampl requir wrap conclud main lesson drawn empir evalu comparison stalker wien data tabl overview system perform sourc rst column sourc sourc miss item item number list ec tree column system wrap sourc complet fail wrap time ignor column tabl order understand data tabl brie describ type wrapper wien gener technic discuss provid wien fairli simpl extract wildcard disjunct item assum present order base assumpt wien learn uniqu extract rule extract item time stalker gener rule extract item independ sibl order extract address area code document figur wien rule ignor charact string extract address encount immedi start extract end extract rule appli match anymor wien wrap perfectli complet fail remain complet failur straightforward perfect wrapper wien languag miss induct algorithm hierarch wrapper induct semistructur inform sourc tabl test domain wien dash denot perfectli src miss wien stalker ion steven craig knoblock gener imperfect rule import note wien fail wrap sourc includ list list level item miss order test stalker wrap perfectli sourc learn addit imperfect wrapper case stalker gener wrapper wrapper rule rule accuraci wrap stalker order wrap stalker induc di erent repres accuraci perfect rule induc base coupl train exampl learn list extract iter rule perform implicit list iter repeatedli appli extract stalker learn explicit list extract iter rule ec tree type rule crucial approach di cult wrapper induct problem simpler extract individu item parent estim stalker analyz perform learn list extract list iter rule test domain result shown column tabl provid number train exampl accuraci rule note list end sourc includ list document di cult wrap includ heterogen list list element type element di erent kind iter task extrem di cult di erent type item hand occurr collect half repres type error date locat price actual date slot remain decid declar sourc stalker sourc multipl present data di erent wai learn rule result tabl line list extract rule requir list iter rule requir rule hierarch wrapper induct semistructur inform sourc result extrem list extract list iter rule learn imperfect rule accuraci learn base singl train induct base singl unusu machin deserv comment stalker learn perfect rule base singl initi candid perfect disjunct situat frequent framework hierarch decomposit problem make subproblem induct individu straightforward nal independ di cult induc extract rule list extract iter rule learn accuraci base exampl effici issu order easili compar wien stalker requir term number train divid sourc main sourc perfectli wrap system sourc wrap perfectli system iii sourc wien fail stalker gener imperfect wrapper sourc wien wrap tabl ii provid piec number train page requir wien gener correct total number item occurr page repres smallest number complet label train page requir wrapper class gener wien obtain multipli number averag number item occurr comput document sourc stalker wrap report piec median number train exampl item requir accuraci data di erent list success line sourc ion steven craig knoblock tabl ii sourc wrap perfectli system src wien stalker doc min max median gener correct rule remain sourc tabl iv present individu descript learn rule provid reach accuraci requir number train exampl analyz data tabl sourc system wrap stalker requir order magnitud fewer train exampl stalker requir exampl rule half rule learn perfect rule base singl observ made sourc tabl present empir data perfectli wrap sourc compact format readabl huge tabl detail inform individu rule sourc tabl ii iii median number train exampl equal half individu item data read requir singl train gener accur hierarch wrapper induct semistructur inform sourc tabl iii sourc wien fail stalker wrap perfectli src wien stalker min max median tabl iv sourc wien outperform stalker src wien stalker doc task accuraci price url product manufactur list extract list iter url titl abstract size date time list extract list iter main bottleneck wrapper induct consist label train advantag stalker obviou tabl iv reveal stalker learn imperfect wrapper sourc pose problem wien explan simpl relat di system de ne train wien exampl entir stalker fragment page ion steven craig knoblock tabl sourc wien stalker wrap src task accur src task accur url faculti sourc titl attent date address citi zip date provinc price countri airlin phone flight fax url email food updat plane organiz alt provid languag url number imag price translat artist album hierarch wrapper induct semistructur inform sourc fragment mean sourc document variat main wien stalker practic chanc variat randomli chosen train set stalker train gener imperfect rule di erent type train exampl lead interest fragment stalker learn perfect rule base signi cantli fewer exampl wien risk stalker induc imperfect plan problem activ learn techniqu identifi type variat provid detail data learn rule di cult sourc problem mention lead rule sourc miss item item order rule learn stalker perfect accuraci sourc advantag stalker label train exampl rule easier focu provid addit exampl di cult lesson base result draw import compar stalker abil wrap larger varieti sourc induc wrapper high accuraci wrapper prefer wrapper stalker capabl learn extract rule base coupl exampl crucial featur user perspect wrapper induct process fast hierarch approach wrapper induct plai kei role reduc number hard problem easier requir fewer exampl extract item independ label exampl item easi extract label singl occurr item train harder item ect accuraci easier extract di cult stalker typic capabl learn perfect rule relev item ion steven craig knoblock fact hardest item stalker learn correct rule lower accuraci averag correct rule erron mean improv stalker behavior base activ learn techniqu algorithm select relev case lead correct rule relat work research learn extract rule occur creat wrapper inform agent develop gener inform extract system natur languag text primarili semistructur inform extract rule reli heavili regular structur appli free text document extract pattern base linguist constraint interest access inform signi number research project depend wrapper retriev relev languag develop manual write wrapper extract rule written procedur languag perl script pattern match grammar system er fairli express extract manual wrapper gener time consum task requir high level rule rewritten sourc su er format order user cope di ashish knoblock expert system approach xed set heurist type bold wrapper induct techniqu introduc wien frequent format reli learn techniqu gener extract rule compar manual wrapper kushmerick approach dramat reduc time ort requir wrap extract languag signi cantli express provid manual approach wien extract languag stalker rule singl wildcard import di erenc stalker wien wien learn landmark search common pre xe charact train exampl stalker hierarch wrapper induct semistructur inform sourc wien wrap sourc item miss order stalker handl ec tree arbitrari wien approach nest document turn kushmerick manual write perfect learn wien wrapper induct algorithm gener extract rule express nite transduc rule gener wien wildcard handl miss item item order rule similar disjunct singl landmark match immedi multipl multipl extract rule strictli express stalker addit order deal miss item order train exampl includ order item contrast inform gener inform extract system unstructur extract techniqu base linguist constraint system relat whisk rapier srv extract rule induc rapier srv landmark immedi follow item whisk capabl multipl landmark similarli stalker unlik rapier srv extract item independ relev item whisk drawback order handl correctli miss item item whisk train exampl order item system handl power linguist constraint stalker capabl futur work primari contribut work turn potenti hard problem learn extract rule problem extrem easi practic typic exampl number requir exampl small ec descript page simpli es problem web page ion steven craig knoblock intend human ec structur gener ect actual landmark page stalker gener close proxim item extract extract rule typic easi induc plan continu work direct learn order narrow landmark activ learn techniqu minim amount label user perform provid stalker acknowledg work support part usc integr media system center nsf engin research nation scienc foundat grant number air forc contract number logist fort contract number research grant ncr gener dynam inform system view paper author interpret repres cial opinion polici organ person connect refer wrapper gener internet inform sourc cooper inform system pp past acm sigmod principl system pp structur data back acm sigmod workshop manag data pp learn rule inform extract sixteenth nation confer arti cial intellig pp tsimmi integr heterogen inform sourc meet inform process societi japan pp sophist wrap inform repositori intern riao confer pp hierarch wrapper induct semistructur inform sourc inform system reason structur collect text intern confer autonom agent pp extract applic gener learn approach confer cial intellig pp transduc semistructur data extract web journal inform system inform manifold aaai spring inform gather heterogen distribut environ pp web sourc inform integr nation confer cial intellig pp induct inform extract phd dept comput tr issu journal intellig system list machin learn inform extract rule free text machin learn
ML/531 6 neural vol navig john weng chen depart comput michigan state east mi receiv novemb april abstract paper present approach autonom navig system recal inform scene navig experi retriev visual achiev high applic road priori scene road system system automat deriv featur imag learn accomplish system principl compon analysi linear discrimin analysi automat deriv express featur scene reconstruct discrimin featur scene classi cation featur describ classifi popul scene approxim complex region linear boundari desir accuraci scheme call partit tree automat construct quickli prune data set search result low time complex retriev size system combin principl compon linear discrimin analysi network tree network test mobil unknown indoor environ learn scene navig experi perform mobil robot navig autonom similar presenc scene perturb presenc autonom sensorimotor neural function tting jj weng chen navig control signal imag path select fig navig map imag path space control signal space introduct central part autonom navig system navig accept input imag intent signal path navig output control signal vector control vehicl fig schemat illustr view navig denot function map element space element space challeng task autonom navig construct automat system approxim complic function comput quickli real time exist system function typic extrem imag space common address problem design rule base type imag collect system develop implement rule outdoor road follow human design rule follow road edg wallac thorp al indoor corridor follow reli oor ceil edg meng autonom navig system intens imag reli type prede ned road lane oor amount road condit variat crucial factor determin applic system handl varieti environ navig system emploi adapt mechan navig pave drive lane mark illumin easili simpl adapt color threshold situat unstructur road unmark lane sudden illumin sun occlud shadow cast nearbi design reliabl autonom navig system great challeng investig develop di erent adapt mechan di erent outdoor drive environ thorp design handl road adapt color classi cation thorp deal di erent structur road explicitli model di erent constrain singl techniqu road detect fail di erent structur road indoor meng kak present mobil robot coupl neural network base modul semant base plan hough transform detect edg intens imag result fed neural network produc qualit output method track major edg indoor scene guid navig studi stereo extract depth map indoor navig kriegman navig exist system prede ne type featur system greater system speci featur thorp feedforward arti cial neural network train learn map input imag output steer signal autonom navig explicitli type imag geometr featur system base successfulli test varieti road situat altern neural network approach robin rosenblum develop univ maryland extend martin corpor robin radial basi function neural network map input imag output steer signal regular robin achiev smoother behavior report rosenblum davi motiv work present navig part hierarch optim subspac learn infer framework navig system motiv automat featur deriv minim restrict type scene system handl framework automat deriv express featur discrimin featur maxim classi cation inform input data method potenti applic wide varieti condit mechan approach mechan map input imag vehicl control signal low comput complex address complex issu learn larg number tree logarithm retriev complex due low system rome capabl navig comput perform sun special imag process hardwar frame grabber feedforward network radial basi function network deal high result perform task test combin principl compon linear discrimin analysi network tree network system start random initi guess dicult lead correct solut requir human interact select popul center radial basi network paper organ section introduc basic concept relat result learn nearest neighbor approxim section discuss statist tool automat deriv linear featur learn sampl section explain method automat construct tree complex analyz section result report section comparison current neural network approach present section final section conclud remark jj weng chen learn ecient function approxim imag space output control object construct navig approxim function function power method construct learn speci seri case acquir learn data notat sampl point denot fx ng nearest neighbor approxim super function approxim problem deal typic regress problem statist pattern predict featur vector fact di erent due underli assumpt featur preselect simpl relationship exist method work complex natur function highli domain number sampl smaller dimens domain introduc concept establish relat result de nition learn set approxim de ned nearest neighbor kx kx nn approxim constant constant dirichlet tessel fp pn nn approxim boundari dirichlet tessel arbitrari proof converg properti nn approxim navig found weng chen de nition learn set approxim de ned xn nearest neighbor xn scalar weight function approxim neighbor nn version immun learn set top nearest neighbor distanc roughli averag top neighbor weight function form xn kx xn xn navig fig illustr hierarch dirichlet partit partit tree label center cell partit tree small posit number avoid denomin determin fast weight runner point xn distanc compar nearest neighbor weight factor nearest neighbor reason choic approach nn approxim hierarch partit perform input nn approxim nearest neighbor larg number record item hierarch space partit scheme lead retriev complex hierarch dirichlet tessel hierarch voronoi hierarch partit sati es addit cell partit deeper dirichlet tessel shown fig partit cell dirichlet entir pm correspond leaf node necessarili dirichlet partit hierarch partit cover space cell di erent size area sampl larg cell creat cover area sampl small cell creat cover region de ned low probabl approxim roughli region high densiti approxim detail small cell approxim hierarch partit fast retriev nal partit pm hierarch partit dirichlet partit shown fig boundari cell level de ned cell level boundari present nest partit pm typic inconsist dirichlet tessel de ned sampl nn approxim directli de ned hierarch partit jj weng chen deal problem explor competit path techniqu approxim leaf node reach de nition hierarch partit fp pm integ constant competit leav input de ned level children root center nearest neighbor node level competitor level level children competitor level competitor level leav level element center nearest neighbor element competitor level competit leav competitor level de nition approxim learn set replac competit leav obtain long includ interpol competit leav typic close nearest neighbor plai major role interpol nearest neighbor miss competit result interpol good competit leav approxim due interpol singl nearest neighbor competit leav automat featur extract restrict type system automat extract featur depend type environ system learn oper project ecient repres small subspac space project ectiv discrimin di erent discrimin analysi select featur express featur featur project describ sampl popul linear call express featur linear featur maxim preserv euclidean norm sampl discrimin featur system distinguish varieti road type cross straight type di erent current head direct camera xed result di erent scene requir navig classifi scene nearest neighbor type criterion suit scene classi euclidean distanc space necessarili perceptu distanc categori label sampl data discrimin analysi automat extract featur di erent categori navig random vector class ith class probabl vector scatter matrix scatter matrix de ned sw scatter matrix de ned ey mixtur scatter matrix de ned sm sw maxim scatter respect scatter discrimin analysi object function maxim linear featur rectangular matrix column vector linearli independ object determin matrix object function minim prove object function lead project matrix column vector eigenvector rst largest eigenvalu column vector call discrimin featur rank featur contribut maximum object function separ featur discuss linear featur linear project consid deriv featur linear featur possess optim properti discuss fast comput import question separ linear featur separ region arbitrari shape space section nal partit hierarch partit nest partit pm intermedi partit speed search linear featur impli cell partit pm bound hyperplan fig linear approxim virtual region desir accuraci cover show nn estim gener mild continu uncondit risk nn estim bound bayesian risk sampl size approach niti ne hierarch partit scheme tessel base nest linear featur sucient solv virtual smooth nonlinear problem unlik feedforward neural network train type iter minim method success class partit sucient number sampl mdf make partit accomplish fewer hyperplan gener gener learn data organ automat organ visual data rst cluster sampl data search cluster assign child cell de correspond child hierarch cluster structur data explor hierarch tree construct algorithm cluster analysi time consum due iter complex suit learn huge number sampl jj weng chen fig geometr illustr binari geometr cell thicker line boundari cell line boundari cell object approach learn complex close learn set size hope lower complex item examin learn partit sampl smaller smaller worri cell correspond cluster interest nding match sampl cluster major concern partit tree di erent exist featur deriv base actual sampl node receiv learn phase node level di erent level di erent set task node binari partit tree speed tree search central issu project input product vector rang imag chose adopt advantag minimum comput simplic implement node singl featur featur intern sampl featur threshold break sampl left child result binari shown fig context organ sampl wai select featur node assign sampl child node fu iter method classifi blood cell maxim amount averag mutual inform gain partit step chou emploi criterion inform diverg project automat deriv linear featur node applic sampl label featur class label mdf construct set learn sampl navig object automat construct root tree accept entir set learn sampl node comput rst featur vector sampl neg left child remain process perform root node children termin node sampl power method van comput domin eigenvector rst number sampl dimens input sampl time complex comput domin eigenvector project input sampl rst featur total complex number learn sampl comput featur time consum level node correspond larg cell sampl ner level node level sampl comput exact partit level rough adopt constant maximum number sampl comput level number sampl node exce subset sampl randomli select comput wast remain sampl sampl node assign children ne number sampl assign node small number sampl node larger sampl comput pseudo code algorithm construct construct call node comput averag construct mdf mdf mdf class label requir sampl learn set type label label hierarch label hierarch label form class label level hierarch label intend direct group sampl desir hierarch label level label corridor tree group sampl corridor imag corner imag subdivid sampl ner class label special case hierarch label jj weng chen construct algorithm mdf similar major di erenc comput mdf label set label learn sampl form label sampl label label intend level node level number larger deepest level sampl termin node node sampl singl label form pseudo code algorithm mdf construct label construct mdf call deepest label node comput label averag assign left varianc sampl class select threshold boundari cut cluster boundari perfect classi cation due ne natur partit fast algorithm import number sampl imag larg learn phase perform phase result learn phase illustr fig leaf learn imag control signal vector perform approxim leaf node leav depend queri input connect leav interpol part part tree store gener regard visual inform entir input retriev di erenc neural network approach schemat di erenc current neural network approach shown fig current neural network approach explicit function directli map visual input output signal repres linear nonlinear function linear nonlinear navig learn phase learn sampl acquisit builder imag control signal perform phase imag acquisit imag retriev interpol control signal fig learn perform phase direct map interpol base nearest neighbor retriev ik ik fig schemat di erenc current neural network approach navig direct map neural network combin rst layer neuron adjust paramet weight rst layer feedforward width center rst layer weight layer rbf network input retriev nearest neighbor learn sampl output sampl interpol obtain actual output notic task visual input output weight distanc current input interpol process desir output direct map fig regard global approxim minim global sum squar error target output simul network output regard approxim map base learn shown fig approxim achiev ad learn sampl space requir store sampl notic simultan work hancock thorp appli method outdoor navig elvi system elvi global parametr regress method train sampl pair input imag output gaussian distribut peak desir treat monolith vector coordin eigenspac jj weng chen fig approxim map visual input output control signal base local neighborhood input imag sphere repres input space denot sampl visual input output input base interpol output nearest neighbor mark solid dot pattern weight gener output output part eigenvector method nonparametr method local interpol approxim function global parametr method complex detail complex analysi analysi mdf node mdf project emploi complex learn phase time complex comput rst featur sampl dimens set learn imag dimens typic low resolut imag sucient larg number learn sampl averag depth time complex learn algorithm log number learn imag node level complex log time complex log number learn sampl low learn complex due fact method avoid iter analysi input make extend method futur increment time requir learn singl sampl time space complex number node binari tree number leav child node store domin eigenvector navig fig sampl learn imag straight corridor corner upper row straight corridor lower left turn space complex learn phase complex perform phase time complex averag depth binari tree queri input imag project node search complex retriev match imag log low time complex system fast larg intern node learn domin eigenvector space complex perform phase result experi includ perform evalu real run mobil robot built platform imag acquisit test site navig experi insid engin build msu area consist corridor turn rome control manual pictur di erent posit learn set ve imag di erent head direct left head head direct correct head direct record straight set pictur roughli meter learn imag sampl drive control manual joystick correct head direct obtain consecut head increment pictur turn grab shorter meter frequent head updat turn sampl learn imag shown fig mdf cluster ect show result quantit mdf perform di erent classifi scene comput imag jj weng chen fig di erenc mdf repres learn sampl straight corridor corner rst ve learn set rst ve mdf learn set learn sampl repres subspac span rst learn sampl repres subspac span rst mdf number plot space class label learn sampl straight corridor imag group class rst ve class straight corridor classi ed head direct recov correct head class class class class class class consist imag corner fig show rst ve rst record larg area contrast mdf record locat edg spatial resolut fig show learn sampl subspac span rst fig show rst mdf sampl singl class spread wide sampl di erent class tend mix mdf sampl class cluster tightli sampl di erent class farther fig classifi unknown imag environ nearest neighbor space good mdf space observ rst perform repres imag includ learn sampl plot set straight train corner untrain fig fig structur class cluster visibl mdf tight case fig navig fig test imag subspac span rst includ learn set subspac mdf subspac cluster children children node divid sampl imag handl parent node smaller group group smaller number gener fewer class mdf ectiv cluster comput mdf set straight corridor imag set corner imag rst mdf comput straight corridor learn imag shown fig mdf compar fig fig class fig group tighter class distanc larger fig straight corridor imag learn set plot subspac corridor imag learn set test imag group tightli fig ect tree size comparison type tree experi mdf featur mdf featur pure perform shown previou mdf root level classifi scene corridor classi cation tabl show distribut node level mdf tree tree learn straight corridor corner mdf tree total leaf tree total leaf node mdf tree typic smaller hyperplan repres mdf ectiv cut boundari class retriev larg number test imag learn conduct fig show error distribut retriev head direct set test tree train disjoint set straight hallwai jj weng chen fig fewer class learn straight corridor imag train learn sampl repres subspac span rst learn sampl repres subspac span rst mdf number plot space class label learn sampl fig test imag repres subspac learn learn set corridor imag corner subspac mdf subspac navig mdf tree tree level number node level number node total total tabl size mdf tree train set imag angular error distribut angular error distribut angular error fig distribut absolut angular error retriev head plot base queri test set straight hallwai learn corner mdf mdf jj weng chen fig exampl retriev rst queri retriev mdf retriev workstat time tabl total learn time set imag corner compar fig fig error retriev mdf tree bin impli gener power give intuit kind imag retriev retriev result shown fig real run real chosen control signal correct head speed step size imag retriev program search match leaf store control signal control robot train rome learn drive learn imag straight corridor corner imag size mdf project rescal origin size smooth reduc ect input total comput time learn phase rang shown tabl depend sun workstat learn navig walk time straight corridor corner corridor drive success mdf version implement rome test demonstr mdf version exhibit consist direct histori version test workstat averag time retriev tabl time retriev train input navig point start women men fig sampl autonom navig train straight corridor corner circl locat imag fig rome navig automat rst corner row corner row peopl walk rome bother recogn entir scene type landmark road tabl show time retriev train fast navig experi mdf faster fig show trajectori sampl navig fig show imag illustr environ test scalabl perform collect larg set imag corridor section train time data comparison tree version version nearest neighbor found space comput time data shown tabl clear tree greatli speed retriev speed achiev tree version jj weng chen retriev tree version space imag space time time ratio wrt tree version tabl comparison retriev time tree version tree structur set learn imag train fig sampl train top part row output gaussian distribut peak correct head direct comparison approach arti cial neural network success engin includ navig robin rosenblum develop cmu univ maryland system map visual input directli output control signal feedforward network robin rbf network compar method matlab simul output scheme output pattern train sampl gaussian distribut peak desir correct head output layer node resolut output node correspond correct head sampl train pair shown fig neural network simul output head peak gaussian output neuron output layer set data set real imag straight hallwai set imag ve di erent correct head ve class sampl set full set real imag set imag train navig includ imag straight hallwai section imag corner section set data trajectori sampl imag gener di erent orient translat squar typic set consist pixel synthet imag ve di erent sampl imag shown fig set imag test di erent learn approach situat navig road map dark area white area road sampl imag fig sampl imag gener di erent locat orient simul navig path imag gener perspect project camera model simul feedforward neural network simul feedforward neural adapt learn rate matlab neural network toolbox similar hidden node simul size problem number imag small size imag train feedforward network found reason solut trial start initi random guess found input dimens neural network converg reason solut random initi weight run matlab script le time di erent random guess initi weight train epoch set larg converg local minimum fig show train record set hidden node fig show weight converg good solut train trial provid solut small error shown fig simul synthet imag set consist learn process easili stuck poor local minimum fig show trial train record set error histogram solut mark circl fig shown left column fig converg reason solut dicult train set epoch random initi guess minut sun reason typic epoch minut batch train set epoch random trial shown fig dai cpu time simul radial basi function network implement robin di erent typic rbf network normal recept eld normal unit sum neuron rst layer normal improv interpol shown refer site center select jj weng chen sum squar error trial sum squar error trial output node output layer absolut error frequenc target output error histogram node output layer node output layer output class output class node output layer node output layer node output layer output class output class output class fig train set trial di erent random guess initi weight show record sum squar error trial minim mark circl show target output ve class train sampl di erent correct error histogram retriev head show network output overlaid target output simul output target output plot solid line dot line navig sum squar error trial fig train record set sum squar error trial solut mark circl rosenblum davi rosenblum davi cluster algorithm center select result satisfactori manual assign subset input pattern center center select process tediou interact simul rbf manual select subset typic view train set set set error head direct train set center chosen set similar number center center manual select robin center train rbf network imag set test set imag fig trial manual center error histogram train test set reason select center shown fig manual center train set minut comparison approach realist imag set set train disjoint set data set fig test error histogram plot fig di erent approach perfect retriev train error histogram concentr singl bin error compar fig fig feedforward neural network rbf network obtain compat error perform head test rbf network bit train set train test head accuraci experi advantag good perform train feedforward network give reason random trial initi weight rbf network provid compar perform manual center select tediou dont center sucient train sampl rbf network act nearest neighbor estim comput complex prohibit number train sampl larg pai extra cost store train sampl memori size tree byte set payo extra storag enabl reach good perform accuraci speed train fast jj weng chen map ann architectur learn algorithm easili map neural network architectur domin binari partit node comput neural learn algorithm refer tree structur map neural network architectur futur work framework present restrict scene type potenti applic scene reli scene automat deriv spatial global featur insensit local small scene road edg occlud object presenc mdf version gener version tighter class cluster smaller tree size due avail larg hard disk fast logarithm retriev made store larg number learn imag unreason method present attract situat consist oor edg avoid futur work includ experi wider varieti drive indoor outdoor approach requir signi number imag real time increment learn futur direct line research acknowledg work support part nsf grant iri onr grant part cui dan swet share part program project contribut construct msu mobil robot extens project testb refer od maintain environ mobil robot ieee tran robot pp olshen cj classi cation regress chapman york jj autonom navig technic report depart comput michigan state east mi pa optim partit classi cation regress tree ieee tran pattern analysi machin pp tm estim nearest neighbor rule ieee transact inform pp color vision road vision carnegi mellon pp pa pattern prentic hall ed scheme improv road vehicl guidanc comput vision proc spie mobil robot pp introduct statist pattern ed san diego gh van cf matrix john hopkin press ce eigenvector land vehicl imag system dj discrimin classi cation chichest neural foundat macmillan colleg publish navig build navig map road scene activ sensor proc ieee intl conf robot pp pj project pursuit annal pp ak rc algorithm cluster data prentic hall da ce gener neural base autonom road follow imag understand washington pp lv gp function analysi norm space oxford explicit model robot road vision carnegi mellon pp de art comput sort search stereo vision navig build mobil robot ieee tran robot pp autonom land vehicl road ieee tran pattern analysi machin pp jk signi line segment indoor mobil robot ieee tran robot pp mm probabl theori van nostrand dg optim vector space john york ac mobil robot navig neural network environ model ieee control pp jk ks autom classi cation blood cell binari tree classi er ieee tran pattern analysi machin pp sk illumin plan object recognit structur environ proc ieee conf comput vision pattern pp principl minor linear neural neural vol pp stochast approxim eigenvector eigenvalu expect random matrix math analysi vol pp da ecient train arti cial neural network autonom navig neural pp da neural network percept mobil robot kluwer academ publish network approxim learn pp theori brain work cold spring symposium qualit vol pp bp numer recip cambridg press ls radial basi function network visual autonom road univ maryland center automat tech rep ls improv radial basi function network visual autonom road ieee tran neural pp ik hierarch classi er design mutual inform ieee tran pattern analysi machin ik tree perform enhanc arti cial neural network implement arti cial neural network statist pattern recognit sethi ak pp se smooth multistag multivari approxim phd depart brown vision navig ieee tran pattern anal machin pp autonom cmu ieee pp eigenfac recognit journal cognit pp progress robot proc ieee intl conf robot san pp jj visual learn proc workshop perform methodolog comput pp wa converg properti mdf version technic report michigan state ss mathemat statist york jj weng chen absolut error absolut error absolut error absolut error distribut feedforward network absolut error absolut error distribut rbf network fig comparison feedforward network rbf network obtain set imag train disjoint set imag test error histogram train set shown left column error histogram test set shown column
HCI/532 4 proc ieee workshop human analysi hilton june ieee learn track human motion function analysi black hasti fleet dept stanford ca royal institut technolog sweden xerox palo alto research palo ca abstract present method model track human motion sequenc video imag analysi divid statist learn bayesian track estim statist model typic activ larg set human motion data human bodi repres set articul cylind evolut joint angl period motion develop set tool automat segment train data sequenc ident comput princip compon cycl algorithm account miss inform enforc smooth transit cycl learn tempor model prior probabl distribut human motion track adopt bayesian perspect approxim posterior distribut bodi paramet particl filter result algorithm track human subject monocular video sequenc recov motion complex unknown environ introduct model track human motion video import problem vari video sport interact human bodi approxim collect articul limb motion thought collect describ joint angl evolv time kei difficulti model bodi angl suitabl tempor primit prior statist analysi case repetit human motion motion sequenc natur sequenc ident cycl exact natur decomposit unknown model estim motion data present set tool carri identif automat suggest iter procedur gener segment respect ratio data align refer domain procedur princip compon individu cycl refer domain statist model technic difficulti includ miss inform motion necess enforc smooth transit cycl deal develop iter method function princip compon analysi base truncat fourier transform learn tempor model prior probabl distribut human motion bayesian framework track gener model imag likelihood observ imag data model gener model result posterior distribut repres close form posterior repres discret set sampl propag time particl filter prior distribut base pca serv improv effici particl filter constrain sampl region subspac paramet space result algorithm track human subject monocular video sequenc recov motion pose complex unknown background bayesian track detail summar unlik previou work align train paper length radiu global tran global rot figur human bodi consist set articul cylind freedom local coordin system axi direct limb joint angular express rel rotat bodi part tail autom method learn tempor model cyclic data form limit import class human motion learn method develop extens cyclic gener human motion relat work model human motion attract great deal attent comput graphic comput vision commun work comput vision commun recognit activ model human motion task hidden markov model extens recognit human action hmm typic provid approxim motion data good synthesi recognit brand recent work suggest fundament weak hmm model captur properti biolog motion smooth linear dynam model human motion repres explicit tempor curv describ chang time joint angl focu model joint angl track human motion simplest model place constraint smooth chang joint angl detail model repres explicit curv variat joint angl time model deriv biometr studi human motion learn data statist data function analysi detail common approach model motion curv align data activ variat subject model princip compon analysi curv data princip compon captur variat train set approach repres imag optic flow joint angl relat approach vector quantiz pca primari detail model track articul model peopl high human tempor curv constrain motion lie lower manifold bayesian method popular track human motion tempor curv thought provid prior probabl distribut valid human motion pca tempor curv statist model variat present train set construct probabilist prior work model human motion curv cyclic motion walk run cyclic motion simpl import class human activ extens studi current focu cyclic motion provid statist treatment ultim goal model human motion automat learn probabilist model train data involv automat segment data individu align activ model statist variat deriv probabilist model complic matter fact train data imperfect commerci motion captur miss data account model cyclic learn method enforc smooth transit cycl previou issu dealt manual case cyclic provid complet treatment automat cope miss data enforc smooth learn part develop model procedur period motion sequenc period motion repetit constitut natur unit statist model identifi train data prior build model segment carri manual procedur present align algorithm segment data automat base estim align cycl motion sequenc transform common refer princip compon transform cycl data comput statist model cycl interpret type specif motion princip compon main sourc deviat sequenc data set cycl statist construct prior distribut bayesian track motion data train form joint provid commerci system sequenc angl term type motion render subject observ altogeth data set consist motion sequenc render individu length motion sequenc rang frame denot length motion sequenc time index number angl motion sequenc angl motion sequenc written formal fz mg motion sequenc train data set sequenc indic set ft miss observ occur frequent data set marker occlud part motion captur system report angl posit coordin case typic frame prevent imput interpol valu neighbor observ spend effort design algorithm manner insensit artifact sequenc align describ procedur estim align paramet segment motion sequenc cycl motion estim base individu motion sequenc transform common analysi estim cycl simpli larg number candid valu assess qualiti align result simpl score function project index defin denot smallest integ greater equal origin sequenc domain pg denot valu project observ data refer coordin limb figur map written ji magnitud ji signal measur project sequenc combin singl defin ratio signal interpret variat data explain signal measur signal intens natur prefer valu produc larg ratio algorithm candid valu set maximum respect estim figur ratio repres set angl function candid period length show left shoulder elbow hip knee angl top seri correspond white signal bottom seri show accumul ratio minimum variat obtain ratio note magnitud normal produc estim figur show individu ratio subset angl accumul ratio function note sharp peak valu optim cycl length note ratio artifici gener white seri row approxim warrant approach respect chang valu fold procedur comput estim optim cycl length sequenc store valu arrai length arrai align multipl sequenc common domain rescal construct offset estim shift motion sequenc minim deviat common prototyp model analog previou paragraph exhaust search optim offset combin due high comput complex suggest iter procedur illustr figur comput approxim initi offset valu step initi offset valu function class minimum fit respect align data arg min updat offset paramet arg min perform improv goto step figur iter algorithm comput optim offset paramet defin refer signal step minim deviat respect align data offset sequenc minim predict error respect refer signal contrast exhaust oper requir comparison solut iter construct improv refer signal current offset signal turn improv offset estim repeat obtain iter optim algorithm termin improv fall threshold step predict clear algorithm converg figur align walk sequenc red curv denot repetit period regress spline estim converg figur show sequenc walk align procedur function class refer chose period constrain regress spline deriv spline design coincid boundari detail concaten refer signal figur discontinu transit cycl princip compon analysi break align data figur individu cycl comput princip compon result slice princip compon interpret major sourc variat data formul probabl model walk algorithm develop illustr figur algorithm address individu motion sequenc align figur sampl frequenc common domain due align paramet problem accommod step resampl comput function estim continu time step function regress spline case difficulti consist miss data design matrix simpli singular decomposit obtain princip cycl length mark miss valu end set time seri index set seri compet function estim domain arg min resampl data common refer imput miss observ stack obtain sequenc design matrix comput vector slice comput fourier coeffici store coeffici comput singular decomposit reconstruct design rank approxim appli fourier transform add obtain imput miss valu valu evalu jjx jj perform improv goto step figur function pca algorithm data imput ponent altern iter approxim scheme suggest recent hasti al context analyz gene express arrai altern svd step data imput step updat design matrix distanc addit comput svd directli princip compon obtain manner discontinu due data imput step explicitli enforc constraint accommod problem translat cycl fourier domain truncat coeffici comput svd fourier domain step reconstruct design matrix approxim step step reconstruct valu improv estim miss data repeat step improv estim iter process continu perform improv fall threshold converg algorithm proven argument similar section provid detail algorithm gener imput design singular decomposit output serv prior distribut track algorithm experi assum motion essenti superposit compon section bayesian track goal estim joint angl bodi pose sequenc imag time outlin bayesian framework defin gener model imag obtain likelihood term specifi probabl observ imag paramet bodi model singular decomposit formul bayesian prior distribut track reformul infer problem comput posterior distribut prior likelihood comput typic difficult high bodi model approxim motion term princip effect reduc arriv feasibl algorithm random vector summar rel joint angl time motion time interpret realiz model assumpt svd figur written form fourier column rearrang denot rearrang vector column coeffici map absolut time rel cycl posit denot speed motion mod bodi posit vector linear coeffici repres global translat rotat torso track person monocular video sequenc entail estim distribut time adopt bayesian perspect posterior probabl paramet time updat likelihood observ imag paramet posterior probabl previou instant tempor prior probabl distribut encod paramet chang time element bayesian approach summar detail reader refer gener imag model geometr optic model camera defin map scene coordin coordin system bodi model kinemat tree articul cylind bodi root global translat rotat map torso scene coordin rigid transform rel posit orient connect limb specif valu paramet vector valu defin set rel joint angl equat combin joint angl global translat defin configur bodi time camera model specifi model project imag geometr formul predict imag time function imag textur time model map surfac model model project textur back imag gener model imag time view map imag time model paramet time project model imag paramet time denot gaussian distribut standard depend view angl limb respect camera limb view obliqu tempor prior tempor model paramet describ bodi configur expect vari time express formal collect distribut individu compon jc jt empir determin standard deviat small scalar singular valu equat expect small vari walk cycl individu homogen transform matrix global bodi gaussian distribut impli gaussian distribut joint angl sampl distribut correspond bodi configur model distribut rel joint angl bodi likelihood model complet bayesian defin observ imag human model configur time base gener model predict imag time compar gener imag observ imag independ evalu gener model limb comput likelihood observ imag product result likelihood term limb pixel uniformli sampl project limb region defin likelihood observ imag imag angl limb princip axi imag plane camera function narrow view angl simpl model work formul robust likelihood model remain area current research limb complet larg likelihood low limb view narrow angl visibl surfac normal roughli perpendicular view true textur pattern highli distort limb thought occlud probabl view model occlud region introduc constant occlud limb occlud express likelihood mixtur imag likelihood occlud act visibl influenc actual imag angl limb princip axi imag plane likelihood imag likelihood limb defin imag occlud limb limb occlud likelihood observ imag bodi pose stochast optim posterior distribut due nonlinear likelihood function result viewpoint match ambigu posterior complic dynam model state evolut embodi tempor prior reason repres posterior weight set state propag time particl filter approach briefli describ method repres vector paramet posterior time repres sampl comput posterior time draw sampl posterior time shape paramet propag sampl point valu comput likelihood likelihood normal sum result set sampl approxim posterior distribut time experi illustr method show track walk person clutter scene ultra sparcstat implement ran rate approxim visual posterior distribut displai project model expect model ns ns likelihood sampl paramet initi gaussian prior time figur show track result frame sequenc show walk person note leg model align imag data arm due fact arm occlud prior driven leg part cycl larg occur model imag start drift person recov larger part bodi visibl paper describ fulli autom method learn period human motion train data statist method present detect length period segment optim align cycl present princip compon analysi techniqu build motion curv method cope miss data enforc smooth begin end motion cycl learn prior probabl distribut bayesian track framework track monocular imag sequenc perform particl filter demonstr result track person clutter imag sequenc acknowledg grate michael gleicher gener provid data experi discuss human motion refer cr dyer cyclic motion detect spatiotempor surfac curv pp bobick davi action brand shadow pp bregler learn recogn human dynam video sequenc pp bregler malik track peopl twist exponenti map figur track person sampl upper row show frame sequenc project expect model configur overlai lower row show expect configur frame lw campbel af bobick recognit human bodi motion phase space constraint pp rehg multipl hypothesi approach figur track pp blake track singular discontinu random sampl pp gordon approach bayesian state estim iee sonar program walk person pp isard blake contour track stochast propag condit densiti pp freeman bayesian estim human motion imag sequenc technic report mitsubishi electr research dynam bayesian network approach figur track learn dynam model pp silverman function data analysi springer human movement analysi base explicit motion model shah pp kluwer academ pub sm cr dyer affin invari detect period motion pp de la torr black framework model articul figur int conf autom face gestur pp fleet stochast track human figur imag motion ireland track person monocular imag sequenc wilson bobick parametr hidden markov model gestur recognit sept yacoob black model recognit activ tempor surfac hasti gener addit chapman tibshirani miss data gene express work depart stanford
Agents/533 1 applic coordin giacomo letizia franco zambonelli dipartimento di scienz università di modena reggio emilia modena itali abstract mobil introduc peculiar coordin problem internet applic suggest exploit infrastructur base multipl local interact space requir coordin activ adapt characterist execut environ occur applic coordin agent belong paper introduc concept coordin base programm interact space interact space execut environ independ program lead behavior agent program interact space visit execut environ obtain behavior interact space exampl show infrastructur coordin exploit simplifi design internet applic base mobil agent mar coordin infrastructur present system concept coordin found clean effici implement introduct design deploi internet applic introduc problem requir tradit approach distribut program develop decentr wide distribut partial knowledg target requir applic compon integr capac deal unexpect situat part term interact internet applic requir applic compon interact varieti possibl unknown entiti legaci compon kind interact assum complex difficult express term tradit lead view distribut applic view reason justifi adopt approach internet applic develop conceiv develop applic term autonom capabl react environ execut proactiv natur deal dynam unpredict exploit notion social typic easili applic term interact protocol find accommod definit agent mobil capabl move internet recogn properti actual execut conceptu design internet applic actual movement softwar agent transfer state node resourc access alloc provid save network reliabl effici execut virtual movement softwar refer fact internet suitabl abstract internet multipl execut environ internet node administr design applic term agent awar distribut natur target virtual move execut environ access resourc alloc synchron agent resourc visit execut environ argu coordin effect reli infrastructur base multipl independ interact space blackboard tupl execut environ interact space charg mediat coordin activ agent execut virtual execut environ infrastructur natur match virtual mobil natur internet agent enforc principl local interact agent move reli global interact requir introduct complex commun middlewar fact agent move execut environ exploit local interact access interact depend environ form agent interact space plai activ role sophist form interact internet applic impli activ role interact execut environ specif characterist secur enact specif coordin law agent access local interact space applic agent requir coordin activ occur specif applic characterist local environ coordin law enact enhanc interact space capabl dynam program behavior interact event make interact space behav wai depend agent issu interact event characterist support strong form coordin administr site adapt behavior interact space enforc transpar agent local applic agent dynam adapt behavior visit interact space specif applic aim paper introduc analyz concept show exploit design develop applic section briefli motiv adopt local interact space internet applic base mobil agent section detail concept coordin effect exploit design develop internet applic section show contextdepend coordin promot clear separ concern comput coordin make applic modular easi maintain section show contextdepend coordin find effect implement coordin infrastructur base programm tupl space firstli section discuss relat work area section conclud outlin open research direct global coupl local uncoupl interact agent mobil discourag gener adopt tradit coordin global distribut share reli presenc global commun abstract global internet scenario space make commun agent ineffici call complex infrastructur deal messag forward lookup agent posit autonomi dynam agent clash strict coupl term synchron activ necess share common enforc model global coupl interact clash principl local interact enforc design develop complex softwar system case internet call geograph local interact suitabl altern make agent coordin infrastructur enforc local uncoupl interact interact confin local interact space local execut environ local interact space act medium asynchron anonym interact occur mediat interact space make agent indirectli interact agent disregard current posit local environ make interact space act gate agent access local resourc kind infrastructur conceiv provid characterist inspir coordin model meet specif suggest adopt infrastructur base independ tupl space execut environ agent site store retriev tupl local tupl space exchang data knowledg messag associ agent read messag environ publish form tupl local space public access local execut agent applic mobil searcher agent roam itinerari internet site access analyz specif html page searcher agent arriv retriev continu itinerari searcher agent discov presenc interest site html origin clone clone site gener tree searcher make agent arriv site time situat avoid coordin searcher agent site visit searcher agent searcher agent searcher agent ignor reli interact feasibl avail complex commun middlewar cope actual agent searcher agent forc refer act mediat central share searcher agent introduc perform reliabl complic applic design local infrastructur base tupl space exploit simpl eleg lead simpler applic design searcher agent arriv simpli check local tupl space presenc tupl left searcher agent previou visit tupl site visit incom searcher agent charg leav tupl mark current visit tupl space effect access inform local html file administr put tupl space tupl searcher retriev inform local html file relat argument tupl coordin model local uncoupl interact fit actual virtual mobil invit applic term mobil agent migrat execut interact space perceiv world consequ obtain interact event site obtain site form coordin agent mobil adopt local interact space interact space simpli infrastructur store forward simpl form complic handl agent coordin agent resid foreign environ agent meet requir face typic problem open opportunist behavior heterogen languag protocol environ specif characterist constrain behavior agent coordin secur resourc control reason characterist applic agent requir coordin occur specif applic case static interact space problem lead huge requir costli mainten activ coordin requir extern condit execut interact space charg burden handl coordin meet applicationspecif requir interact space activ enabl dynam adapt behavior interact event enhanc basic model programm tupl space kind access event request extract behavior program overrid basic behavior tupl space store retriev tupl base stateless kind access event term ident agent perform primit access tupl paramet tupl suppli express behavior call assum tupl space kind access event similar appli enhanc programm interact space base tupl space model adopt programm tupl space model internet model base programm local interact lead form depend coordin interact space execut environ exhibit behavior interact event enabl integr form behavior transpar agent coordin law rule local coordin activ interact event perform agent belong applic lead behavior agent code implement control applicationspecif coordin law instal form behavior interact space visit site agent coordin site interact space coordin specif adopt programm interact space enforc coordin lead scenario depict figur agent applic belong subject local law agent applic spread coordin law site influenc coordin activ agent applic site site agent agent agent agent agent agent local interact space local interact space environ law environ law app specif law app specif law app specif law app specif law figur scenario coordin describ case programm interact space programm tupl effect exploit applic lead coordin discuss coordin law posit impact design develop applic coordin access tupl space semant coordin activ percept affect specif behavior program local tupl space interact effect depend site perform emb secur polici tupl agent enter environ explicitli charg issu impli execut access foreign environ enforc secur site open execut mobil awar malici agent arriv site undermin integr data protect unauthor access awar secur polici adopt execut interact environ issu larg number secur handl agent interact environ mediat programm tupl problem find simpl eleg solut administr program behavior tupl space make unauthor access tupl space harmless requir agent handl except applic searcher agent extract tupl repres html file read kind properli program tupl space provid tupl agent extract tupl space handl heterogen execut environ adopt choic wrt format data resourc wrt local tupl space explicitli deal heterogen discov fruitfulli access environ adopt programm tupl space complet perspect adopt tupl space program react access perform agent transform request make homogen local hand agent perceiv tupl space homogen environ forc chang environ duplic format applic searcher agent site html file html tupl store html page file shape tupl searcher intellig possibl discov presenc html page site administr agent modifi behavior tupl space transform request request transpar agent administr modifi match mechan make match html tupl support open interact exploit tupl space programm deal heterogen issu natur extend case site open host execut agent belong applic possibl heterogen term support languag coordin tupl space support coordin activ group heterogen agent trust site act charg control interact agent possibl damag relat inform retriev tupl space control behavior opportunist interest divert research searcher agent specif commerci site coordin applic design exploit programm tupl space wai facilit access inform visit support exchang complex knowledg agent implement complex coordin protocol applic design exploit programm tupl space adapt interact model modif tupl behavior intend meet specif applic form confin provid tupl space ensur behavior affect access event perform agent specif applic facilit access applic avoid duplic searcher agent put tupl space visit site make incom searcher agent applic awar fact site visit marker tupl report time incom searcher simpli detect file modifi previou visit collect inform updat wrt held earlier visit agent basic pattern match mechan forc searcher agent retriev tupl repres file select repres file modifi visit applic call effect support interact make select html tupl field greater templat tupl access event perform agent applic trigger reaction lead mechan specif mechan influenc applic context exchang knowledg applic put marker tupl space read applic agent sort explicit knowledg exchang agent applic agent explicitli put inform visit tupl space complic agent design requir agent priori inform presenc programm tupl space simpler gener solut agent instal visit tupl space reaction make tupl space reflect term produc inform implicitli transfer applic agent regard agent visit site instal reaction agent applic request html file modifi visit agent arriv worri previou reaction avoid duplic work show make coordin site lead power simplifi coordin enabl dynam exchang knowledg influenc agent code implement coordin protocol burden implement coordin involv agent interact indirectli tupl complex agent agent charg implement code capabl directli handl control proper execut coordin protocol cleaner solut charg interact space tupl burden control coordin protocol programm tupl space express control part coordin protocol term behavior access free agent duti control execut protocol impact design develop avail infrastructur base programm local interact adopt coordin model posit impact engin mobil agent applic model natur invit design applic separ aspect relat specif comput role applic agent relat interact agent agent applic visit execut environ model promot clear separ reduc complex applic design case studi applic design independ focu class design kind inform applic agent retriev visit analyz inform extract data data report back agent select itinerari possibl clone agent influenc visit kind inform exchang programm interact analysi issu lead definit coordin law spread visit site applic independ design choic deriv analysi engin issu matter method inform extract integr applic design opt agent retriev html page site visit agent retriev html page modifi visit independ role applic design develop role site administr kind applic agent deploi administr site design implement coordin law find facilit execut agent site protect site improp exploit local interact space separ concern design phase preserv develop mainten phase code agent separ code implement coordin law independ case studi applic develop add agent integr sophist form analysi extract data html page chang code agent influenc code implement coordin law chang coordin law chang code agent coordin law case studi make agent arriv site retriev html page hat modifi visit design develop discov achiev effect inform agent arriv site analyz html page modifi unmodifi page link modifi coordin law separ code easili integr applic unchang agent distribut visit site updat coordin law similar approach administr chang time law forc agent visit site adapt coordin mar mar agent reactiv develop modena reggio implement coordin architectur java mobil agent characterist make suitabl infrastructur coordin mar architectur mar architectur made multipl independ programm tupl node access agent local execut node figur agent arriv automat bound interact space local local mar tupl space requir integr mar mobil agent system make agent server charg accept incom agent suppli agent refer local mar tupl access primit enforc coordin mar tupl space node intend resourc agent access exploit coordin current mar architectur conceiv addit coordin servic rule possibl agent exploit form coordin support agent system internet node agent internet access local tupl space tupl space roam applic agent agent agent tupl space figur mar architectur class extend tupl class public string tupl field public string public string public date public integ access local tupl space forbidden constructor initi tupl field public string string date integ filenam extens keyword size end class code fragment searcher agent agent migrat site creation templat tupl access local space retriev tupl repres html file relat keyword entri agent access file extract relev inform figur fragment code searcher agent mar interfac mar design complianc sun javaspac specif mar tupl call java object instanc variabl repres tupl field field tupl defin null mar tupl java instanc class implement mar interfac extend javaspac access tupl oper put suppli tupl basi templat tupl suppli paramet pattern match match tupl space templat tupl suppli input oper defin null valu tupl match templat tupl defin valu equal match rule account serial object form provid match refer applic tupl repres html file templat implement java class shown figur figur show code fragment agent creat object class defin templat templat tupl repres html file match mar reactiv model associ reaction access event repres store tupl space tupl form mean reaction method reaction object trigger agent ident invok oper op match put extract tupl tupl space mean instal reaction event tupl space case associ reaction access event match tupl space associ reaction instanc read tupl type content agent ident access event tupl space mar issu mechan tupl space reaction execut access event satisfi match reaction execut instal order reaction method provid inform ident agent trigger oper output match mechan execut reaction fact reaction access event perform agent specif ident independ ident access agent enabl coordin reaction appli reaction appli specif exemplifi coordin mar subsect site store html file extens administr exploit mar programm enabl agent retriev inform html forc deal heterogen administr forc chang local filenam duplic tupl form administr instal reaction shown figur transform request file tupl extens request tupl extens field reaction instal write tupl express reaction object trigger agent issu oper provid templat templat class implement reactiv public entri entri entri oper ident match occur site file modifi extens templat requir match extens entri result chang back extens found tupl return end method reaction end class figur reaction agent perform unauthor oper system administr decid agent read content match tupl delet instal reaction transpar transform disrupt perform foreign agent oper reaction implement readonli class figur instal write tupl space class readonli implement reactiv public entri entri oper ident check ident agent return administr delet tupl return tupl extract end method reaction end class readonli figur readonli reaction behavior reaction combin harmless tupl space made react pipelin oper request readonli reaction execut tupl return reaction reaction design independ independ applic affect code applic agent class implement reactiv privat date date visit public set visit visit public entri entri oper ident match tupl document modifi visit return agent set time visit visit return updat tupl element return end method reaction end class figur reaction coordin mar section agent avoid duplic work site retriev inform file modifi visit agent visit site instal state reaction store inform time visit agent applic visit site access reaction return tupl relat file modifi implement reaction class shown figur instal make agent write tupl local identifi agent make reaction affect applic reaction pipelin harmless reaction independ design chang affect applic compon mar secur model mar assum mobil agent system system agent identif authent agent execut node main secur mechan provid mar associ access control list tupl space tupl acl defin tupl space specif system administr decid oper perform agent tupl author access control polici base acl complement specif program tupl subsect similar secur polici appli regard tupl space agent instal reaction tupl space finer control set access event agent influenc extern agent influenc reaction activ agent specif applic agent influenc coordin activ occur applic context unauthor agent instal reaction potenti appli agent extern specif secur mechan reaction appli specif applic agent reaction figur instal agent write metalevel tupl space null field specifi reaction appli mar write tupl field local identifi agent applic relat work area internet agent explicitli focu coordin model suit mobil explicitli introduc concept relat contextdepend coordin space project ibm defin tupl space inform repositori space recogn limit basic linda model integr peculiar form enabl complex primit ad tupl space approach make space usabl open internet requir applic agent awar oper tupl space dynam acquir knowledg space defin architectur conceiv meet problem agent refer multipl tupl local access tucson model develop context affili research adopt architectur model similar enhanc make agent refer remot tupl space internet servic enforc virtual mobil forc actual agent mobil complex explicitli handl url refer remot tupl space regard tupl space tucson resembl mar full program capabl tupl defin logic tupl space tupl tupl space behavior express term untyp logic unif basic mechan lime model face problem handl interact presenc mobil gener includ mobil user devic softwar internet physic mobil carri movement tupl space tupl space medium provid agent interact agent touch tupl space agent merg interact merg tupl space limit form reactiv provid automat move tupl tupl notifi agent event occur tupl space lime natur promot primit form effect agent access space depend tupl space merg tupl space rule tupl flow tupl space model address problem make coordin group agent obei set law agent initi fix law respect agent enter interact group law typic express oper agent order enforc model dynam associ control process agent join group control process intercept messag agent coordin check compat enforc law interact model address problem relat agent mobil explicitli identifi coordin full potenti enforc coordin system agent interact work progress paper introduc concept contextdepend coordin mobil shown concept effect implement exploit notion programm tupl space defin framework agent coordin easili repres tune specif applic simplifi applic design manag repres import drive forc success internet applic base mobil agent issu address paper coordin infrastructur integr agent commun languag agent interact term role model due import analysi design multiag integr specif methodolog defin develop applic exploit agent mobil acknowledg work support italian murst project infrastructur qo web multimedia servic heterogen modena reggio emilia found young research refer ieee vol pp august concept mobil agent world wide web vol pp coordin model internet ieee vol pp feb programm coordin architectur mobil ieee internet vol theoret comput vol juli ac rocha organ open st nation symposium parallel distribut artifici express power languag programm coordin acm symposium appli finin agent commun intern confer inform knowledg novemb code ieee transact softwar vol pp ibm system vol pp softwar artifici vol pp issu agent program ieee vol pp model agent system design ieee program deploi mobil agent read august nh coordin control mechan heterogen distribut acm transact softwar engin vol pp juli al gp commun st intern symposium agent system palm spring ieee cs octob internet applic journal autonom agent vol pp septemb gp linda meet intern confer softwar lo angel acm softwar aaai menlo park pp softwar engin internet coordin internet
AI/534 2 continu categori mobil robot michael rosenstein paul cohen depart comput scienc massachusett ma abstract autonom agent make frequent knowledg form categori categori human web paper describ agent learn categori interact environ learn algorithm transform raw sensor read cluster time seri predict agent address issu relat uninterpret sensori apparatu show specif exampl pioneer mobil robot interact object clutter laboratori set introduct basic categor autonom categori abstract raw sensor read provid mean recogn circumst predict effect action categori plai import role mobil robot navig obstacl system recogn hand gestur pentland simul agent maneuv highwai interfac autom repetit task pierc kuiper kuiper ram santamaria santamaria sensorimotor agent discov categori focu paper method mobil robot deduc categori uninterpret sensor read rosenstein cohen demonstr techniqu extract sensori concept time seri data cohen result simpl game simul player determinist movement strategi simul record distanc player result time seri transform learn algorithm cluster point algorithm found categori sensorimotor cluster time seri similar pattern paper show approach learn categori scale complic robot domain kind sensor effect measur wheel sonar reflect learn describ detail return prototyp lloyd categori prototyp time seri comput averag member categori cluster figur show prototyp base instanc pioneer robot bump wall recogn current situat match time seri figur robot predict bump sensor short time provid evid sensori categori sort agent carv world robot refer prototyp arbitrari symbol word wall contact mean categori predict make sensor read sensor categori mobil robot oper environ modest sensori categori suppli level abstract raw sensor read khale michaud matar pierc kuiper ram santamaria object agent discov categori adopt cluster analysi techniqu suit goal work subproblem section outlin solut event detect agent set typic gener tremend amount sensor data tempor abstract focu learn algorithm pertin part robot lifetim finit state machin isol kei time robot encount landmark byun matar branch point relev part long stop wheel forward movement gripper length contact contact bumper event detect delai time camera bump switch sonar break beam figur prototyp instanc pioneer mobil robot bump wall compon time seri translat veloc forward sonar bump sensor grai region level prototyp variabl standard deviat time seri appli suitabl amount compress time axi darrel al pentland dynam time warp algorithm perform sort tempor abstract categor human gestur schmill al cohen util learn categori oper model mobil robot dynam time warp algorithm advantag classifi time seri repres costli preprocess step cluster algorithm altern involv detect kei point sensor histori sensorimotor infant mobil possess innat abil detect unexpect sensor read similar approach da al emploi isol time seri segment interfac trigger command word process program split prototyp prefix pattern recogn context suffix predict user action approach differ event act signal cluster explicit point pull exist cluster recogn learn algorithm make simpl rule detect pattern rise edg bump sudden chang wheel veloc robot jump vision read object suddenli disappear rule implement comput correl recent sensor read templat short time seri correl valu exce event signal trigger learn algorithm grab window sensor read center multivari time seri instanc cluster analysi time seri cluster categori allevi difficulti hidden partial observ environ michaud matar ram santamaria rosenstein cohen cluster algorithm origin design discret featur vector extend handl finit sensor histori mean time seri comparison cluster requir measur instanc guid cluster membership design measur dissimilar time account amplitud linear drift pazzani approach fast simpl time fx xm fy ym vector quantifi dissimilar euclidean distanc dissimilar kx choic eq inspir method techniqu base theori dynam refer wai classifi time seri dynam method delai transform part time seri point delai coordin success measur implement make squar yield result multipl addit subtract dissimilar comput suitabl time interv de luca prove delai coordin preserv geometr properti dynam access underli state space limit project relev cluster analysi nearest neighbor state space remain space sensor comparison difficulti work robot varieti sensor pioneer mobil robot studi sonar measur distanc infrar break beam return discret vision system comput object cluster algorithm weigh contribut uninterpret sensor unit rang algorithm deal sensor continu sonar give measur return larg default object cluster individu sensor creat small alphabet pattern specif sensor construct signatur store pattern similar newli observ time seri member alphabet robot navig kuiper byun defin signatur subset featur valu maxim place byun signatur built sensori involv physic locat featur set learn agent raw sensor read figur show alphabet pattern sensor infrar break beam robot gripper alphabet size set pattern encount make initi subsequ pattern forc iter agglom cluster algorithm signatur figur result interact object fit pioneer gripper slot signatur fill comput similar reciproc alphabet pattern recent histori actual valu normal total similar signatur signatur unit vector space alphabet project axi indic match pattern notic figur small cup ball similar consist signatur vastli larg cup signatur recogn object figur base sole pattern alphabet larg small small signatur figur pattern alphabet repres signatur interact object grai region level pattern variabl standard deviat unlik larg ball small cup trip front break beam momentarili reach back robot gripper small cup ball differ ball roll robot stop front break beam account sensor complex exampl sensor weight small subset robot sensor contribut time seri pattern event learn algorithm weigh import sensor decid pattern belong categori grasp small object robot place greatest emphasi attent paid batteri level mahadevan al khale solv problem feedforward neural network schmill al cohen sensor receiv weight util cluster algorithm final step approach learn sensori categori appli stage time signatur input raw time seri pass cluster analysi comput dissimilar ith jth pattern weight averag individu event detect time seri segment sensor bit vector time seri cluster signatur creation signatur cluster raw sensori input pattern alphabet event signatur categori hierarchi prototyp figur schemat algorithm learn time seri categori uninterpret sensor signatur dissimilar ij ik jk ks ik jk ik jk number sensor ik ith signatur unit kth weight ik merg oper cluster algorithm creat larger cluster signatur weight comput averag constitu size merg parallel raw time seri creat signatur merg give prototyp figur time seri plai direct role comput eq initi weight cluster member instanc sensor learn algorithm make event detector sensor exhibit sudden ms window consid part event weight set weight set initi weight form bit vector activ activ sensor bump wall figur forward bump veloc initi weight batteri level gripper break initi weight imagin situat requir sophist weight initi found encourag result straightforward approach add comput cost summari figur schemat entir learn algorithm raw sensor read made robot rate event detector continu monitor time seri abrupt event algorithm collect segment sensor read construct bit vector activ sensor data pass cluster algorithm addit analysi time seri updat pattern alphabet sensor time seri convert set signatur bit vector act initi sensor weight subsequ cluster final output hierarchi sensori categori categori repres prototyp interact object test algorithm figur record sensor data pioneer robot interact randomli bucket control robot design simpl pioneer turn random approach object closest line stop move shortli make direct randomli chosen time object recogn robot vision system detect patch red pixel imag plane object indistinguish red sensori categori base natur featur detail analysi visual scene ran control repeatedli robot interact time object figur cluster hierarchi summar output learn algorithm notic figur categori hierarchi interact object signatur alphabet size set sensor sensori experi object tend cluster lowest level binari tree node repres abstract individu experi figur graspabl object leg fall branch tree object fall branch recal label arbitrari symbol robot symbol averag time seri figur differ size pattern alphabet construct signatur figur alphabet size forc event list signatur bit vector construct detect unexpect sensor read notic event detector capabl discrimin categori experi bit expand signatur slot figur order interact ball cup trigger break beam small pattern alphabet suffic expect complic environ requir larger alphabet prototyp serv repres sensori state abstract goal robot determin state run simpl nearest neighbor algorithm find match recent sensor histori prototyp view distanc nearest neighbor indic progress goal state robot goal locat small ball figur show rel distanc recent sensor read prototyp figur categori hierarchi interact object signatur alphabet size set sensor pioneer approach ball progress made prospect goal state involv activ break beam quiescent event detect match quiescent beam small cup prototyp shortest activ time larg cup worst match prototyp longest activ time beam break progress made prototyp hurt rel distanc small cup shown figur initi event rear break beam deactiv ball roll robot robot impoverish sensori apparatu unabl distinguish ball categori includ small cup discuss sensori categori prototyp act state support recognit serv oper model paper view prototyp state abstract research augment sensori prototyp control schmill al cohen record mobil robot current activ part prototyp data structur result oper model planner prototyp split part correspond store activ ram santamaria santamaria reason approach control mobil robot navig task system made continu case store time seri sensor input control desir sensori case librari time event detect rel distanc prototyp larg cup small cup small cup small ball small ball figur rel distanc prototyp shown averag instanc pioneer robot approach small ball stop short time make contact queri sequenc control command achiev state view state abstract oper sensori categori provid foundat form proposit concept postul build human make innat mechan sensori analysi search regular preserv continu natur percept approach perform similar form sensori analysi mobil robot implement find cluster similar time seri pattern build prototyp retain characterist origin sensor trace show path sensori categori highli abstract autonom agent accomplish great deal prototyp prototyp categori plai crucial role human intellig act categor automat unconsci regularli categori grant forc reason design featur set mobil robot navig clutter offic environ realiz difficult list robot simpl categori wast bucket learn offer common person classifi instanc subsequ categori induct machin learn algorithm research part effort push classif process insid free scientist engin tediou work design autonom agent acknowledg research support nation scienc engin graduat fellowship darpa contract govern author reproduc distribut reprint notwithstand copyright notat view author interpret offici polici express darpa govern refer gestur analysi interpol view ieee transact pattern analysi machin intellig agent autonomi dynam environ intern confer autonom agent acm press cluster analysi john wilei learn classifi observ motor behavior twelfth intern joint confer artifici san morgan kaufmann enhanc time seri fast accur cluster relev feedback present aaai workshop predict ai approach time seri analysi fast similar search presenc longitudin scale time seri ninth intern confer tool artifici ieee press robot explor map strategi base semant hierarchi spatial robot autonom system danger thing chicago press rapid concept learn mobil robot machin learn publish autonom volum build ii conceptu primit psycholog review integr robot ieee transact robot autom learn select attent memori sequenti task anim fourth intern confer simul adapt mit press learn histori mobil robot nonstationari condit machin learn publish autonom volum map learn uninterpret sensor effector artifici intellig continu reason artifici intellig cognit categor lawrenc erlbaum associ concept time seri fifteenth nation confer artifici aaai press de reconstruct framework proper delai time physica learn model continu plan seventh intern workshop artifici intellig san morgan kaufmann classif time seri data nonlinear similar measur physic review letter detect strang attractor lectur note mathemat learn mobil robot navig dynam system perspect ieee transact cybernet part hierarch group optim object function journal american statist associ
DB/535 3 reason base frank wolter michael zakharyaschev institut fur universitat leipzig artifici school comput studi leed england decemb introduct qualit field success deal time space exist wide spectrum tempor languag varieti spatial formal case effect reason procedur develop implement appar natur step combin kind reason import step theori applic doubt attempt construct hybrid clark intend interpret calculu region connect calculu function repres space occupi object moment time muller develop theori reason motion spatial entiti contrast tempor spatial effect procedur capabl reason space time develop main aim paper introduc hierarchi languag intend qualit provid languag topolog tempor construct effect reason estim comput complex languag combin formal tempor spatial reason spatial compon fragment jointli exhaust disjoint base relat spatial region fragment attract attent spatial reason commun suffici express applic gi nice comput turn decid fact result obtain mean encod proposit modal logic necess oper interpret interior oper topolog extend modal make natur choic tempor point base proposit tempor logic binari oper base flow time allen interv calculu closer hope exampl obtain result convinc reader formal fit perfectli tempor logic found applic cs ai program verif specif distribut system tempor decid problem construct effect formal view design decid modal logic dimens topolog space flow time idea kind modal logic reason recent advoc bennett cohn comput behaviour combin logic depend choic spatial tempor permit interact paramet give rise hierarchi languag simplest st applic tempor oper formula languag assumpt chang notion conceptu express st make form complement spatial appli tempor oper formula region term denot state region natur semant languag tempor model state fix topolog space prove satisfi problem languag topolog tempor model comput complex rang np expspac studi structur simplest topolog space satisfi satisfi st problem formula model base euclidean space region connect calculu full connect theori design cohn qualit spatial reason languag primit predic read connect region start obtain result gener flow instanc defin kind relat spatial region basic extern connect partial overlap ident tangenti proper part tangenti proper part proper part proper part intend model topolog space interior oper satisfi usual axiom individu variabl rang regular close set assign map associ variabl set closur oper dual intend mean share formal iff comput point view observ full theori undecid decid fragment import interest relationship spatial region account topolog predic jointli exhaust mean region stand relat experi report renz nebel predic turn conceptu cognit adequ peopl distinguish relat languag consist set individu call region binari predic boolean construct usual spatial formula main reason task formul ffl finit set spatial decid satisfi topolog exist topolog space assign predic replac definit satisfi problem decid shown bennett encod proposit intuitionist logic modal system fact complet respect topolog space elementari proof correct encod provid intuit suffic observ predic repres fragment languag topolog space ix ix ix ix ix ix ix requir regular express ix replac quantifi necess possibl oper denot associ region variabl proposit variabl repres topolog term necess possibl obtain bimod formula ip ip ip ip spatial formula denot result replac occurr predic bimod formula put recal topolog interpret hard satisfi topolog space iff satisfi kripk model proposit bimod logic lewi modal model form si kripk frame binari relat valuat omit write simpli ri fact variabl show satisfi iff satisfi model base forest tree depth root successor length number proof fact found section renz nebel prove satisfi problem formula maxim tractabl fragment tempor spatial configur interest chang time flow time tempor oper standard oper fl time defin usual assum space topolog remain spatial region occupi object chang time pass naiv pictur formal concept topolog tempor model definit topolog tempor model base topolog space ii tripl form assign associ region variabl moment time set function defin wai introduc tempor dimens syntax st obviou applic oper spatial formula denot result languag st definit st defin hold moment induct construct ffl tempor iff ffl iff fm ffl iff interact time space st hard show theorem hold theorem satisfi problem st topolog tempor model proof theorem formul section found section languag st express captur continu region disconnect moment remain disconnect extern connect express power st limit compar region moment connect region todai state tomorrow expand remain express dynam relat true part dynam region moment denot space occupi eu moment formula eu construct import refin continu assumpt requir coincid overlap st captur extend st applic oper fl formula region variabl argument predic region variabl prefix arbitrarili long sequenc region dai denot result languag st st sublanguag tempor oper fl definit extend theorem satisfi problem st decid expspac satisfi problem st st region distinct odd fl fl st satisfi model base infinit topolog st formula finit topolog space st compar region fix time interv auxiliari rigid variabl formula satisfi iff futur present territori russia part eu note formula mean dai territori dai part eu imagin express languag countri europ pass germani euro forev dont countri form europ simpli write formula form europ possibl construct region point belong region futur common point futur state formula point present territori russia belong eu futur moment st applic tempor oper possibl past region variabl definit region variabl region term region term denot st languag result st region term region variabl intend semant region term defin definit ai defin induct region term ffl ffl ffl definit infinit union intersect region problemat observ infinit union contradict axiom full infinit intersect sequenc shrink region result empti set definit region infinit oper bring semant complic avoid problem restrict assign model infinit intersect union reduc finit wai idea accept finit chang assumpt region chang spatial configur infinit mean ai satisfi region term captur st exclud mathemat interest case absolut adequ plan job eventu complet robot paint optimist accept describ geographi europ exampl tempor time line assum arbitrarili correspond theorem satisfi problem st decid expspac gener reduc infinit union intersect finit adopt finit state assumpt region finit state chang state infinit definit model ai satisfi region term finit regular close set ng fa theorem satisfi problem st decid expspac st satisfi iff satisfi base finit topolog space st make languag st express applic boolean oper region term semant mean defin ffl ffl ffl britain northern st result famili languag turn theorem remain valid replac st st modal encod st decid complex result formul prove section mean st tempor version proposit modal logic extend modal method develop denot ml proposit modal languag connect necess possibl oper necess possibl oper tempor oper intend semant encod pure topolog model kripk model fact finit model addit tempor compon make situat complic interpret structur kind respect formula definit kripk tripl form vi ri frame map associ proposit variabl subset defin ffl iff ffl iff ffl iff ffl iff ffl iff standard boolean satisfi definit topolog model ml structur ui ii topolog space map associ proposit variabl set extend arbitrari ffl ffl ffl ffl ffl iff ffl iff satisfi set satisfi kripk model topolog model turn kripk model topolog model ff underli topolog ix maxim subset hold proposit formula cp valid kripk model topolog proof claim clear topolog formula suffic ii standard interior oper real select sequenc xn close set xn put xn type model respect modal translat st finit state assumpt modal translat st ml defin definit region term defin formula region ci fl atom st cit arbitrari st denot result replac occurr predic put term set region term occur call modal translat topolog ui kripk satisfi variabl occur exist finit set ng fa easi show induct case built variabl set ng fb straightforward induct prove theorem st satisfi iff modal translat satisfi topolog modal translat st form special fragment modal languag ml renz show formula satisfi iff satisfi kripk model base depth width mean chain distinct point distinct turn result gener st definit distinguish type ffl call obtain proposit tempor formula oper prefix ci subformula ffl call ci fl obtain proposit tempor formula tempor oper fl prefix ci subformula ffl gener ci fl ci fl prefix string remark begin ci gener topolog model term form definit formula form boolean combin gener tempor oper boolean ci fl formula form boolean combin gener ci fl arbitrari tempor oper boolean easili definit ffl modal translat st topolog ci fl ffl modal translat st topolog show satisfi topolog satisfi ci fl satisfi kripk model simpl form lemma base topolog boolean topolog form gener frame definit consult lemma satisfi topolog satisfi kripk ci fl satisfi topolog satisfi kripk case kripk model vi satisfi ri set form fu point proof satisfi topolog model ui base topolog space ii denot set put rv iff shown put ri defin kripk model vi fv induct construct show iff basi induct case boolean modal oper standard mean ih case easi iff assum prime km km case treat similarli note exist point theorem si depth repres disjoint union reflex closur subset point depth lemma satisfi kripk ui ri set fu point satisfi kripk model vi depth satisfi satisfi proof defin si fx reflex closur set world arrow lead point final cluster cluster condit put vi show iff proof induct basi induct definit recal begin ci formula ci iff ci iff point iff iff iff ci tempor oper boolean treat extend gener case case consid contrari fact easili extend arbitrari simpli construct gener oper depend structur underli combin lemmata theorem obtain theorem st satisfi iff modal translat satisfi kripk underli depth st satisfi iff modal translat satisfi kripk underli depth turn simpler satisfi st formula remind reader ri width point successor renz show formula satisfi iff satisfi kripk model base frame depth width prove result gener tempor case theorem st satisfi iff satisfi kripk underli depth width st satisfi iff satisfi kripk underli depth width proof satisfi ai assum xm region variabl occur denot set atom st variabl fresh variabl region term built xm defin induct term ffl ffl ffl ffl ffl ffl minim exist put ffl minim put fp occurr tempor oper denot set atom tempor oper assign defin readili check induct region term iff topolog space assign iff construct ht iff satisfi prove theorem suffic construct kripk model hf base frame hw depth width iff theorem model vi ri depth iff denot set formula form negat true subformula assum chosen mutual depth proper form assum point proper predecessor construct exist point depth remov point depth result set world loss gener assum form depend form delet case case select point depth remov lead point case select depth remov arrow lead point case select depth remov arrow lead point case arbitrari depth remov arrow lead point denot result relat defin valuat hw variabl iff depth xr show model hf requir point depth valid formula remain show case depth xr depth xr mean xr contrari successor depth contradict depth xr contradict case consid decid begin logic st st simplifi assum tempor oper reader problem extend proof languag st denot set region term fl occur set subformula loss gener assum close definit fork frame hw ffl fa ffl root successor reflex closur relat fha ha label fork pair fork label function associ point subset iff final point access set label fork regard kripk frame hw disjoint union fork point label predic region term write iff hold topolog space determin assign fx definit formula type subset ffl iff ffl iff definit pair hf ffl set label ffl formula type iff denot number definit order pair label fork suitabl isomorph oe iff order pair hf call suitabl ffl pair ffl suitabl pair definit state function function associ hf definit state function hf call ffl pair suitabl ffl iff exist satisfi theorem formula st satisfi iff satisfi proof theorem assum satisfi ai underli topolog space determin disjoint union ri fork defin relat set fork iff isomorph oe iff pick repres class defin set select repres label accord set formula hold moment easi check state function hf satisfi satisfi function associ label fork run pair suitabl set run defin topolog tempor model ai topolog space determin frame cg iff ai bi assign defin di hard check induct satisfi prove st effect recogn exist satisfi idea proof show satisfi satisfi form effect bound fix notat sequenc arbitrari sequenc denot head tail concaten sequenc jsj denot length lemma nm subsequ call nm lemma lemma ji occur sequenc infinit time hf formula realiz step lemma form hf satisfi requir lemma ji form ji formula realiz ji proof exist assum view lemma construct realiz step formula assum realiz step lemma delet repeat interv select realiz step analyz distinct formula form obtain realiz formula step addit requir compli lemma finit sequenc length hf condit pair formula iff formula form realiz step consequ lemma immedi obtain theorem st satisfi topolog tempor model iff sequenc satisfi condit lemma distinct ji ji theorem expspac algorithm capabl decid st satisfi rough descript view equal expspac guess write binari exponenti space guess set label subset check hf guess hf condit check pair hf hf suitabl condit lemma satisfi remov hf guess hf check pair hf hf till reach hf store memori set formula form proce delet time reach pair hf hf suitabl satisfi prove theorem st proof theorem satisfi iff satisfi label const satisfi problem st decid pspace recal satisfi problem pure formula replac proposit variabl predic obtain st oe ffi clear oe satisfi model iff oe ffi satisfi satisfi problem st prove theorem st hard formula satisfi iff satisfi model strict linear order point determin set fork yield satisfi check algorithm prove theorem st assum tempor oper st set region term occur region variabl term form definit state function run function hr domain exist fork hw underli label fork root ffl iff ffl ffl iff exist definit pair ri consist state function hf finit set run call ffl iff exist ffl fork underli label fork exist fr satisfi theorem condit formula st satisfi satisfi satisfi finit domain proof theorem assum satisfi ai underli topolog space determin disjoint union ri fork defin relat set fork iff isomorph oe iff observ set fn ng finit pick repres class repres coincid defin set select repres label accord fork defin oe isomorph repres iff oe put ffl oe ffl oe ffl oe difficult run fr fork fg finit set formula hold moment easi check pair ri hf satisfi satisfi ri defin topolog tempor model ai topolog space determin frame cg iff ai bi assign defin di hard check induct satisfi finit trivial fix formula st hn ff label fork ri hf write run hr ffl hr hr ffl write label fork base fr defin relat iff ffl ffl denot class gener defin relat iff ffl ffl lemma number distinct class exce proof fix defin function oe oe ae oe oe remain observ number function easili lemma ri qi ji ji lemma ri ff fr proof immedi definit lemma ri ji infinit ri ff ji hw run realiz term form ji realiz jf ji label fork run note proof hw run exist assum view lemma run obtain ri run realiz step infinit formula assum realiz step lemma delet state interv construct ri run realiz infinit analyz distinct term form occur obtain ri finit run realiz step class infinit manner label fork time delet state arriv ri infinit term form occur realiz step compli step state compli satisfi construct definit order pair label fork suitabl isomorph oe ffl iff ffl iff ffl iff order pair formula type suitabl decid satisfi problem formula st theorem formula satisfi iff exist state function length ffl ffl hold hf realiz label fork sequenc pair label fork sequenc realiz step pair suitabl proof firstli show satisfi find satisfi condit theorem end satisfi condit suffic show exist set run ri sequenc type satisfi condit condit formul theorem finit sequenc type sequenc type sequenc type consist infinit word form sequenc type sequenc type ffl pair suitabl ffl readili check word run ri lemma exist satisfi condit satisfi tempor model euclidean space formul theori interpret arbitrari topolog intend model applic euclidean standard interior oper renz show pure satisfi arbitrari topolog space coincid satisfi realiz set satisfi formula connect region observ result gener extend oper intend form union region proposit exist satisfi formula satisfi connect topolog space satisfi proof conjunct satisfi topolog space consist point ident interior oper note hold topolog region close includ interior coincid close open space disjoint oper form union region implicitli languag st form obtain proposit st satisfi model base connect topolog cohn applic discret finit topolog space prefer space call connect union disjoint open set proof conjunct proof show hold moment moment case st theorem set st satisfi satisfi model base proof proof theorem suffic show set predic negat topolog model determin kripk model vi disjoint union countabl topolog model base assum model disjoint union fork successor denot ab set region variabl fan ac abc set region variabl fan fan ab ac abc defin partial order iff map ffl ab ab ffl ac ac ffl abc abc map exist put ffl ab ab ffl ac ac ffl abc abc abc ffl region variabl matter routin show hold topolog space assign case fb disjoint extern connect hold remain show includ interior suffic show interior case case ab ab abc ab interior ab ab vice abc interior rang ab rang abc case ac case dual case case abc abc abc abc deduc interior paper construct famili logic intend qualit knowledg reason behaviour spatial region time prove reason logic effect estim comput complex found relationship topolog tempor model base abstract topolog space euclidean obtain result make step studi effect spatiotempor formal interest problem remain open investig connect logic construct paper theorem establish upper bound complex satisfi problem st coincid lower interest extend logic st oper construct formula form fl fl fl eu time futur russia todai part eu assum appli region term finit state infinit set model region chang infinit infinit finit maxim minim respect state start conjectur satisfi problem st compact topolog tempor model decid theorem region variabl arbitrari regular close set requir set acknowledg lutz stimul discuss refer allen maintain knowledg tempor interv commun bennett spatial reason proposit logic intern confer knowledg page morgan bennett modal logic qualit spatial reason journal interest group pure appli bennett cohn logic framework reason topic reason av mv zakharyaschev modal logic oxford logic guid clarendon chomicki tempor queri survei gabbai hj tempor volum lectur note artifici page bl clark calculu individu base notr dame journal formal bl clark individu point notr dame journal formal mj egenhof model topolog spatial strategi queri process comput cohn qualit spatial reason techniqu advanc artifici lectur note comput page vardi reason knowledg mit fine logic part ii journal symbol fisher survei concurr languag applic gabbai hj tempor volum lectur note artifici page reynold tempor mathemat foundat comput volum oxford ri modal part report mathemat gain question journal logic nm formal describ topolog spheric region technic report school comput descript logic concret domain predic journal logic jonsson complet classif tractabl journal artifici intellig mc pnueli algorithm full proposit tempor logic comput aid page pratt incomplet modal logic advanc complet modal logic place de advanc modal volum page csli public manna pnueli tempor logic reactiv concurr system manna pnueli tempor verif reactiv safeti muller qualit theori motion base primit intern confer principl knowledg page morgan procedur combin proposit tempor logic special theori journal autom cohn spatial logic base region connect intern confer knowledg page morgan renz canon model region connect calculu intern confer knowledg page morgan renz nebel spatial reason topolog inform spatial interdisciplinari approach process spatial lectur note comput page renz nebel complex qualit spatial reason artifici mh stone applic theori boolean ring gener topolog transact american mathemat tarski der und die fundamenta van benthem tempor logic handbook logic artifici intellig logic volum page oxford scientif wolter zakharyaschev descript logic intern joint confer artifici page morgan
IR/536 5 statist learn model text classif support vector machin thorsten joachim gmd forschungszentrum schloss sankt germani abstract paper develop theoret learn model text classi cation support vector machin connect statist properti cation task gener perform svm quantit unlik convent approach learn text classi reli primarili empir model explain svm perform text classi cation address support vector machin handl larg featur space text classi cation relat statist properti sucient condit appli svm cation problem introduct wai motiv learn method suitabl learn task ultim interest perform compar studi previou work present studi show support vector machin deliv cation perform success benchmark brittl justi cation learn algorithm limit insight paper analyz suitabl svm learn text classi er theoret perspect paper present abstract model cation task model base statist properti cation problem observ intuit prove type cation problem cientli learnabl svm central result upper bound connect expect gener error svm statist properti cation task paper structur short introduct identifi kei properti permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee septemb usa copyright acm cation task motiv model formal de ned section addit verifi assumpt model real section prove learnabl result section valid model section analyz complex cation task identi es sucient condit good gener perform support vector machin svm develop vapnik al base structur risk minim principl statist learn theori basic svm learn linear rule weight vector threshold input sampl train exampl sn yn linearli separ sn svm hyperplan maximum euclidean distanc closest train exampl distanc call margin depict figur train amount train error measur slack variabl comput hyperplan solv primal optim problem optim problem subj constraint requir train exampl classi ed correctli slack train li side greater equal upper bound number train error factor paramet trade train error model complex note margin result hyperplan solv dual program optim problem subj figur binari classi cation problem dimens hyperplan separ posit neg train exampl maximum margin exampl closest hyperplan call support vector dualiti impli respect solut feasibl point solut primal solut construct train train exampl exist hyperplan call stabl special famili consid call hyperplan hyperplan forc pass ad constraint remov constraint practic perspect text classi svm restrict hyperplan achiev perform similar gener hyperplan experi sv light solv dual optim problem detail introduct svm found properti task make statement learn method work text classi identifi kei properti cation task properti featur space independ choic cation problem involv featur space word occur train document cation problem thousand train exampl lead attribut document vector larg space potenti document small number distinct word impli document vector light bui home properti industri acquir design librari manufactur home amount cash home sold commerci consolid natur end talk corp texa oil ga corp subsidiari consolid natur ga mutual pursu talk consolid ga texa oil detail justic dismiss file justic depart told transport depart support request group dot dismiss applic tran world airlin approv control review applic control led dot ascertain sucient inform base competit jame justic told reuter ed man bui hong kong firm uk base commod ed man singapor jointli announc man bui substanti stake pct held man develop local list soft drink manufactur secur commod brokerag arm renam rm man paci figur document categori share content word heterogen term document shown figur document articl categori overlap document vector small extrem document share content word word occur document word stopword discrimin document corpor acquisit document document good keyword indic di erent high level redund gener di erent featur relev classi cation cue occur document cue partli redund tabl show result experi reuter categori featur stem stopword rank empir mutual inform class label naiv step step step figur structur argument featur rank random tabl learn featur classi er train featur rank result tabl show featur rank lowest inform relev classi er featur point random frequenc distribut word zipf law occurr frequenc word follow zipf law zipf law state rank word term frequent word occur roughli time term frequenc frequent word impli small number word occur word occur infrequ discrimin model text classif goal section statist learn model cation task step approach illustr figur relationship properti cation task identi ed expect error rate svm rst step show larg margin combin low train error cient condit good gener accuraci step abstract properti cation task step connect separ step bound expect error base margin bound show larg margin combin low train error lead high gener accuraci result limit number error kei quantiti margin de ned section maximum euclidean length document vector train loss theorem expect error expect error rate svm base train exampl jj point probabl constant bound hyperplan equal gener stabl hyperplan equal expect train set size proof found note act scale constant margin easili optim problem squar margin doubl scale document vector length bound theorem account scale step model task simpli cation task immedi good idea larg margin margin properti observ train data requir train svm overcom step lai basi connect properti intuit properti cation task stereotyp text classi cation task task arti cial serv motiv model develop section describ document class di er term frequenc type word occur figur graphic illustr stopword independ document posit neg document word occurr set word lexicon word typic consid stopword note individu word open word occur di erent word occur medium frequenc word lexicon subset posit neg document bag occurr posit document neg document word dictionari stopword irrelev posit neg irrelev word document posit neg figur simpl group entri occur primarili posit neg group occurr posit document neg document group occurr neg document posit document low frequenc remain entri part subset entri occurr posit neg document set entri occur primarili posit neg document frequenc versu resembl properti cation task identi ed section input order magnitud real cation task document document word mean entri document vector high level document word word class document document length fairli high level redund heterogen posit neg document group word group word group arbitrari subset word word document impli document class share singl term group mimic properti text classi cation task identi ed section zipf small number word occur set word medium larg set word resembl zipf law abstract definit introduc model describ cation task gener definit ns fs describ binari classi cation task disjoint set featur set includ featur posit occurr featur respect neg occurr featur occur multipl time document de nition includ violat occurr frequenc prescrib model extend handl straightforward appli de nition figur easi verifi high freq medium freq low freq concept arti cial model real cation task empir valid cation task webkb ohsum collect analysi show model start categori webkb collect partit featur space disjoint set posit neg irrelev featur simpl strategi select featur odd word posit document ratio greater word indic neg document ratio excerpt word figur word posit document odd ratio greater spectrum posit indic ratio greater neg indic ratio word vocabulari assum carri inform abstract detail typic document task document captur typic averag webkb document word long posit exampl categori averag occurr set posit indic word account high frequenc medium frequenc low frequenc po word assign assign book chapter class code cse descript discuss document due eec exam exam fall nal section set solut solut spring structur student ta text textbook thursdai topic tuesdai unix wednesdai week word account adapt addison adt ahead aho altern announc announc announc answer appoint approxim tuesdai ture turn turn txt ullman understand unit upenn usr vector vi walter weaver wed wednesdai weekli week weight weslei word gradient ca zimmermann zj zyda neg acm address austin ca california center colleg comput confer contact current depart dr faculti fax graduat group member parallel perform ph pp professor public recent research scienc support technic technolog vision work word aaai academi access accur adapt advisor advisori aliat agent agent alberta album america amherst annual victoria virginia visit visitor visual vita vita voic wa watson weather webster west wi wife wireless wisconsin work workshop workshop wrote yale york word lunch lund lung luo lu zurich word high frequenc medium frequenc low frequenc figur indic word webkb categori partit occurr frequenc occurr averag neg document assess percentag analog word directli translat high freq medium freq low freq rest show cation task connect webkb categori model assum document homogen length composit shown assumpt homogen relax similar found task categori procedur lead high freq medium freq low freq rest averag case model model ohsum categori patholog high freq medium freq low freq rest note model substanti di erent veri es captur properti real cation task potenti di erenti task studi relev gener perform step learnabl nal step connect bound gener perform svm rst lemma show homogen gener separ margin fact term frequenc obei zipf lemma show euclidean length document vector small cation task result lead main learnabl result lemma ns fs hyperplan pass origin margin bound ac proof de ne diagon matrix fs diagon margin hyperplan separ train sampl yn pass origin deriv solut optim problem min yn hyperplan solut vector margin ad constraint optim simplifi solut lower bound margin add addit constraint group featur weight requir ident vector constraint simpli ed de number featur group mean constraint posit exampl neg exampl lead simpli ed optim problem min solut lower bound margin remain upper bound comput close form introduc lagrang solut equal lagrang multipli constraint fact saddl point close form solut notat write xy appropri de ned substitut lagrangian result xy saddl point maxim function subject lower bound margin drop constraint remov constraint object function solut unconstrain maximum greater equal set deriv dl xy substitut yield unconstrain xy special form xy make comput close form xy ac substitut complet proof lemma show set document fulli consist speci ed linearli separ minimum margin note separ impli train loss paper consid case full consist show relax remain bound maximum euclidean length document vector appli theorem document vector document word euclidean length greater bound real document vector bound quantiti tightli make zipf law assum term frequenc document follow gener zipf law typic paramet valu scale document length assumpt zipf law impli word occur frequenc document impli frequent word document occur frequenc slight zipf law short lemma connect length document vector zipf law state word document occur low lead document vector short euclidean length lemma document rank term frequenc document term form gener zipf law base frequenc rank squar euclidean length document vector term frequenc bound proof connect frequenc rank term absolut frequenc frequent term occur time document vector entri valu euclidian length document vector combin lemma lemma theorem lead main result theorem ns fs document term distribut gener zipf law expect gener error svm train exampl bound ac chosen svm equal svm equal proof fact separ di erent result theorem reduc sucient larg lemma lower bound bound expect ac remain give upper bound maximum euclidian length featur vector train data term frequenc follow gener zipf law lemma bound empir valid lemmata lead main result suggest text classi cation task gener linearli separ normal margin small predict test real data reuter earn acq grain crude trade interest ship wheat corn webkb faculti project student ohsum patholog nervou sy immunolog tabl normal margin train loss reuter webkb ohsum data suggest reuter webkb binari stem perform stopword remov ohsum data tabl ohsum webkb categori linearli separ mean hyperplan posit exampl side neg exampl insepar reuter categori due document obviou misclassi cation human index separ larg margin tabl show size normal margin ten frequent reuter webkb ve frequent ohsum categori treat number paramet due link compar featur normal margin typic small nding connect theoret result valid captur import wide present properti text classi cation task compar theoret model result previou section formal describ larg expect margin low train error lead low expect predict error margin relat properti verifi real cation task model section veri es individu step justi conjunct produc result show section compar gener perform predict model gener perform found experi section webkb categori model experi err test webkb reuter ohsum tabl compar expect error predict model error rate breakeven point test set webkb categori reuter categori ohsum categori tf weight stopword remov stem estim paramet zipf law full webkb collect subject assumpt theorem substitut estim valu bound lead expect error denot number train exampl train exampl model predict expect gener error analog procedur reuter categori lead bound expect gener error train exampl bound ohsum categori lead expect gener error train exampl tabl compar expect gener error predict estim model gener perform observ experi unreason expect model predict exact perform observ test tabl show model captur classi cation task dicult correctli predict easiest easiest dicult model detail suitabl perform estim applic set valid formal kei properti cation task relev learnabl svm found sensit difficult easi learn task previou section reveal bound expect gener error larg small di erent identifi kei properti make cation task svm learn occurr frequenc paramet stai bound error rate frequenc discrimin featur discrimin power term set extent vocabulari di er class make di erenc learnabl bound di erenc class condit word frequenc level redund higher lower bound gener error impli desir clue document model ect tfidf weight ectiv svm depend properti task limit model open question model abstract realiti import point assumpt document assum follow gener zipf neglect varianc discret inaccuraci occur short document impli document equal length model xe number occurr word set violat assumpt captur term attribut exact number occurr word upper lower bound make model accur cost number make model understand formal analysi demonstr model break presenc bound tighten parametr model incorpor model type cation problem gener approach paper model upper bound error rate import deriv sucient condit learnabl cation lower bound interest answer question cation task learn svm relat work learn algorithm analyz term formal model typic make assumpt ed text popular algorithm naiv naiv commonli justi ed assumpt condit independ link depend assumpt gener accept text complex depend model remov violat princip problem gener model text remain find gener model natur languag dicult solv text classi cation task paper present discrimin model text classi cation model constrain distribut word describ classi cation accuraci avoid independ assumpt model describ properti text model bernoulli model reject test descript orient approach provid power model tool avoid featur requir implicit assumpt descript vector gener di erent motiv work papadimitri al similar spirit approach present show latent semant index lead suitabl assumpt distribut word assumpt similar exploit di erenc word distribut show assumpt relat statist properti text deriv bound summari paper develop rst model learn text er exampl make quantit connect statist properti text gener perform learner model result discrimin approach unlik convent gener involv independ assumpt discrimin model properti text classi cation task sucient good gener avoid complex natur languag base discrimin paper explain svm achiev good classi cation perform featur space text classi cation result bound expect gener error give formal understand kind cation task solv svm make identifi intuit high high discrimin power term discrimin featur rang sucient condit good gener model formal basi develop algorithm speci scenario refer swanson probabilist model autom index journal american societi inform burg tutori support vector machin pattern recognit data mine knowledg cooper inconsist probabilist inform retriev intern acm sigir confer research develop inform page sahami induct learn algorithm text categor novemb multistag index system larg subject eld page fuhr retriev test evalu rule base automat index van research develop inform joint bc acm page cambridg juli fuhr probabilist approach web document acm intern confer inform knowledg page kansa acm harter probabilist approach autom keyword index part distribut specialti word technic literatur journal american societi inform harter probabilist approach autom keyword index part algorithm probabilist index journal american societi inform jaakkola haussler probabilist kernel regress model confer ai joachim text categor support vector learn relev featur european confer machin page springer joachim make svm learn practic advanc kernel method support vector chapter mit joachim estim gener perform svm ecient intern confer machin san morgan kaufman joachim approach learn text classi algorithm phd note class skew distribut analysi critiqu paper simon inform apr latent semant probabilist analysi pod acm symposium principl page ny acm press sahami machin learn improv inform access phd stanford vapnik statist learn theori zipf human behavior principl introduct human ecolog
Agents/537 1 concept commun van frank de wieb van der hoek ch meyer utrecht depart comput scienc po box tb netherland abstract describ framework program open societi concurr oper agent agent maintain subject theori environ interact commun mechan suit exchang tradit commun mechan program paradigm agent group agent class program govern languag emploi repres inform interestingli question answer give oper model program languag term transit system formal deriv comput program introduct field system rapidli grow research area field real consensu constitut agent appli notion nonetheless proven success concept design gener program gener accept properti attribut agent view autonom entiti show reactiv proactiv behaviour perceiv act environ inhabit social abil interact agent context stronger concept agent assum mental state inform attitud knowledg motiv attitud desir properti thought comput entiti tradit agent view elabor softwar entiti embodi characterist import issu rapidli grow research area electron studi agent assist human tediou task negoti good negoti gener exchang inform highli complex requir involv parti emploi modal knowledg belief knowledg belief parti emerg applic area electron commerc requir develop program emphasi program involv shift perform comput involv concept interact commun term primarili design program system consist collect object object model entiti state store set variabl assign set method invok oper variabl constitut type data object inspect chang state object invoc method central interact mechan paradigm proce method mechan suit commun type inform field system concern program draw classic philosoph program subject paradigm subject point view comput entiti state agent object state map variabl constitut mental state express subject view environ current program system program languag agentspeak desir previou develop abstract program framework formal semant framework fit program open societi concurr oper maintain subject theori interact commun mechan exchang inform commun valu extend framework concept program paradigm agent commun mechan introduct question commun view agent comput entiti oper collect agent environ maintain subject theori specif reason interact agent commun inform explic constitu agent agent activ execut privat describ reason pattern behaviour program execut context mental state consist motiv attitud inform attitud categori mental motiv attitud scope present paper studi paper volum assum agent belief base agent privat system repres process inform addit system entail relat prolog decid formula constitut consequ current belief base oper instanc agent deal emploi thought repres capabl firstord system oper æ updat belief base newli acquir inform newli establish assum agent emploi privat belief strategi commun question give sketch commun mechan base notion analog notion method program system set formula entail relat question õ ü õ constitut ü sequenc formal paramet denot formula instanc question liquid ü reach boil ü ü ü æ ü ü æ liquid ü reach boil point case concern current temperatur liquid case temperatur equal higher question õ assign interfac signatur õ determin detail vocabulari bodi question visibl instanc æ æ æ æ æ signatur case detail question visibl type liquid question defin case function constant denot temperatur visibl invoc question õ ü õ ø ø sequenc close term length ü formula express interfac signatur õ question give addit inform actual paramet ø invoc amount check ü ø denot current inform store answer agent bodi question follow current inform store instanti formal paramet ü actual paramet ø addit inform provid invoc invoc question situat interfac signatur invoc amount test ü ü ü æ ü ü æ denot answer inform store invoc success inform state inform confirm temperatur fluid case signatur equal inform temperatur liquid includ invoc answer belief state addit inform æ suppli make admit signatur invoc signatur question agent invok question distinct translat symbol invoc map symbol question æ assum translat function map predic predic temperatur æ temperatur æ import featur commun mechan defin question agent hide detail underli system analog idea program instanc altern definit question ü ü ü æ ü ü æ interfac signatur question agent repres temperatur differ implement visibl agent concern temperatur measur concept program defin commun adapt mechan techniqu program paradigm object class import characterist program paradigm object popul structur object class object popul instanc ü variabl object class emploi å collect method oper variabl object set variabl variabl code implement method object class class defin blueprint creation instanc activ object instanc parallel program languag pool passiv object assign activ object class addit constitu ë denot program govern behaviour object class main program ë maintain control invoc method method invok arbitrari point control program ë invok method typic constitut subset entir set method issu field program design program languag concurr system object popul dynam evolv time illustr repres languag mention languag pool program languag set object class class identifi root class execut program start creation instanc root mark root object root object execut program defin class creat object class dynam evolv popul concurr oper object attain commun object interact mechan objectori languag base classic notion rendezv constitut commun mechan execut procedur behalf process rendezv view consist distinct stage process call procedur process execut procedur execut call process suspend commun result execut back resum execut rendezv point call involv exchang actual procedur paramet caller commun result back caller program languag defin syntax program adapt concept program paradigm light commun agent import mind drive motiv fact contrast notion agent view comput entiti process reason form inform data express valu introduc notion logic variabl typic element notat denot set finit sequenc typic element ü definit system tupl æ set formula sort languag signatur signatur function relat symbol notat denot set term signatur denot set close term variabl ¢ constitut entail æ ¢ denot belief updat inform æ constitut belief base updat assum global set é consist question question templat question invoc defin definit templat question system æ signatur ø question templat set é question instanc defin é ø ý õ ý é ø õ ø question templat form õ ý õ ý õ question sequenc ü ý variabl constitut formal paramet commun step instanti actual valu differ sequenc variabl ü global variabl scope extend boundari variabl ý strictli local question paramet ü support commun dynam gener agent bodi question logic formula underli system question õ assign interfac signatur õ defin visibl vocabulari question bodi question invoc form õ ø denot sequenc ø close term denot actual paramet substitut formal paramet ü ý formula constitut addit inform actual express interfac signatur õ translat signatur translat analog program introduc definit agent class defin tupl form é é ø set question ë denot program statement procedur declar set inform store consist system describ languag oper agent class emploi repres process inform set é question templat agent class technic conveni requir é question class definit statement ë describ behaviour agent creation agent class start execut statement syntax atom statement definit syntax complex statement discuss definit set collect declar procedur invok case clear omit notat denot initi inform store agent class program simpli consist collect agent class definit program è tupl agent class class program è defin blueprint creation instanc execut program consist dynam evolv agent instanc abil integr instanc possibl extend popul agent creat system type agent integr fall scope current requir outer layer user interfac top program languag assum class program make sort refer agent sort assum system class program includ constant variabl agent denot instanc class assum constant agent refer definit class program action complex statement ë procedur defin action inform process action denot updat inform store inform action denot test formula consequ current inform store action integr ü action form ü denot act integr agent system agent instanc agent class denot sort variabl ü action constitut bind oper bind free occurr variabl ü subsequ program action õ ø action denot act agent ü question õ ø set é class denot sort variabl requir set question templat defin includ templat head õ ý formal paramet ü ý length requir variabl ü action occur scope bind action ü bind action form ô ú ü element ù action answer õ ý action denot act answer question templat õ ý sequenc ü collect global formal ý denot local formal paramet denot bodi question oper ü action õ ý constitut bind oper bind global variabl ü local variabl subsequ agent program rise block variabl refer insid scope scope variabl exist idea variabl ü store actual paramet refer subsequ program dynam integr agent unknown identifi commun instanc program õ ý õ occurr ü action bound action answer question õ agent agent substitut variabl agent question õ answer question agent extend circl acquaint agent awar commun answer actual paramet question refer subsequ agent program techniqu scope featur extend origin scope variabl larger part instanc definit ë ë ë ë ë ë ðó ô ü complex statement mean sequenti composit oper choic oper intern parallel oper possibl defin local variabl procedur call statement denot empti statement effect illustr syntax program languag mean program è consist describ detail class agent constitu class system æ formula signatur predic signatur order relat predic ü denot agent ü predic ü denot agent ü notori pai predic ý ý denot book ý final relat ý denot book ü sold agent ý set set constant denot agent typic element constant denot book typic element set denot price book euro typic element ñ entail relat implement set é class consist question ü þ ü ü ù ý þ ý þ ü ü ù ý ý interfac signatur question signatur question question amount agent ü custom question typic question þ emploi þ accept offer agent ü book offer unaccept procedur declar set þ ü ü procedur loop choic accept offer registr custom note question typic answer side bind global formal paramet ü actual paramet scope variabl ü action program inform ü ü ad inform store provid buyer regist comic sold case offer price exce euro includ situat custom default situat book sold offer inform store class conjunct atom formula form rang element store defin book comic assum inform class agent bui bui book system defin signatur relat ý denot book ü bought agent ý constant denot agent typic element constant denot book typic element constant denot price book set constant repres price book dollar typic element consist ü variabl sort question typic emploi side sell agent ü procedur declar set agent agent regist invoc question ü sell book price dollar offer accept inform store subsequ updat inform procedur termin procedur invok order agent import note price dollar translat price euro translat function multipli price dollar factor yield price euro oper semant defin oper semant program notion instanc agent class definit instanc agent class call initi configur agent tupl ò uniqu constant sort agent assign uniqu agent system address integr initi inform store agent store class initi program statement agent system repres process question answer collect set é procedur invok ë collect set constitu é remain invari execut infer includ configur ò agent stai includ configur simpli distinguish instanc class definit program è system set instanc agent class system popul agent dynam evolv dynam integr instanc class program oper semant program languag defin term transit system transit denot comput step system constitut part agent system execut comput step place case condit satisfi order defin transit notat denot simultan substitut term ø variabl ü statement ë defin transit rule integr commun parallel execut transit rule action statement similar omit definit agent class agent sort variabl fresh agent constant sort ü ì agent ñ class creat start execut statement ì defin inform store formula program ë integr agent substitut actual ñ integr agent program constant replac actual ñ note assum global constant ñ fresh respect local transit fresh respect entir agent popul assumpt ensur agent popul assign distinct definit question templat õ ý interfac signatur denot signatur agent formula term ø transit õ ø õ ý ì æ ü ý ø explain transit rendezv agent question õ ø agent answer question õ ý place case bodi question answer belief base conjunct instanti ü global instanti ý ø local paramet addit inform requir consequ belief base actual paramet ø inform express signatur translat interfac signatur question achiev translat function map symbol symbol signatur requir function translat agent constant vocabulari answer agent ñ extend agent constant occur translat interfac signatur question note inconsist resolv updat oper æ transit reflect scope global formal paramet question extend subsequ formal paramet ü question õ refer subsequ statement ì answer agent mention techniqu extend origin scope literatur scope variabl replac actual paramet definit rule extern rule defin comput step system deriv comput step subsystem subsystem evolv system result configur system system bui recal program è previou section initi system ò consist agent ò empti inform store execut procedur defin ðó ý ý ðó þ þ ý variabl sort þ variabl sort seller ý buyer þ seller commun buyer mean invoc question transit agent integr system evolv step ò ðó þ þ ë ò sell agent ò integr statement ë abbrevi remaind procedur variabl ý substitut constant ò agent ò integr instanc class rule integr extern deriv ò ò ò ë ò ò ë abbrevi remaind program agent ò rendezv agent ò bui agent ò place invoc question sell agent ò commun mean rule rendezv parallel result configur ò ò ò ò ò í í í í abbrevi part program agent ò step rendezv buyer ò seller ò place invoc question inform store seller updat inform ò step lead ò ò æ ò ò ò ò í í abbrevi remaind program agent ò assum inform rendezv buyer ò seller ò place invoc question result ò ò æ ò ò examin requir rendezv bodi question impli inform store answer agent inform provid modulo translat signatur question condit ò ü ò ý þ ü ü ù ý þ ý þ denot translat function map dollar euro equal stand condit hold ü ù follow fact oper futur research benefit structur mechan program studi unifi model languag softwar engin appli model agent commun interest topic featur research studi concept inherit context agent denot concept denot specialist behaviour agent class hierarch describ constitu class inherit class import ingredi studi develop semant subtyp describ circumst agent class behaviour agent class condit relat condit agent subtyp question agent supertyp provid answer subtyp concept point modifi exist local replac agent agent affect behaviour system subsequ step develop syntact subtyp possibl base refin yield method formal prove subtyp relat addit interest issu futur research extend framework mechan agent question answer refer de jn oper semant parallel languag confer record annual acm symposium principl program page st gr andrew concurr principl practic benjamin cum publish redwood treur formal specif case intern confer system page mit rm van fs de van der meyer system commun agent henri biennial european confer artifici intellig page john wilei rm van fs de van der meyer belief system intellig agent intern workshop agent languag volum lectur note artifici page rm van fs de van der meyer open agent commun integr nr jen intellig agent intern workshop agent languag volum lectur note artifici page editor unifi model languag volum lectur note comput scienc knowledg model dynam epistem state bradford frank de wieb van der ch meyer agent program declar goal castelfranchi intellig agent vii agent languag intern juli lectur note artifici intellig volum simon maurizio zini specif heterogen agent architectur castelfranchi intellig agent vii agent languag intern juli lectur note artifici intellig volum milner commun mobil cambridg steven shapiro yve lespéranc model multiag system featur interact resolut applic castelfranchi intellig agent vii agent languag intern juli lectur note artifici intellig volum ramamohanarao design concurr languag wooldridg nr intellig agent workshop agent languag volum lectur note artifici page wooldridg jen intellig theori practic knowledg engin
DB/538 3 semant approach inform momi project bergamaschi castano de di montanari vincini modena milano dsi modena dsi milano introduct continu quest provid uniform access distribut problem integr inform heterogen sourc relev main problem face integr inform distribut sourc relat structur implement heterogen differ hardwar data model data lack common lead semant heterogen semant heterogen occur emploi repres inform model construct repres piec inform sourc approach recent literatur extract integr convent structur semistructur data account semant heterogen data integr architectur base mediat knowledg data multipl sourc combin provid global view underli data fundament approach emerg structur semant semant approach integr heterogen inform approach semant conceptu schemata involv sourc common data model languag adopt describ sharabl inform odl defin subset odl descript logic descript languag constraint research partial fund murst project kernel languag support system develop call momi environ multipl inform implement approach inform integr momi base schemata perform extract analysi process unif process extract analysi process devot deriv common thesauru terminolog relationship base odl schemata construct cluster mean cluster odl describ similar inform schemata unif process build integr global schema analyz sourc integr odl class cluster descript logic hierarch cluster techniqu origin contribut approach enhanc integr process descript logic interact thesauru deriv explicit terminolog relationship odl schemata descript infer relationship explicit optim queri global schema descript logic cluster techniqu autom identif odl class sourc schemata semant relat candid unifi global schema momi architectur odl languag fig architectur momi system shown respect consid power tem tsimmi architectur sourc li translat translat structur data sourc common odl languag similar wrapper perform translat queri oql languag local request execut singl sourc wrapper mediat softwar modul refin odl schemata receiv wrapper mediat gener oql queri wrapper start queri request formul respect global schema mediat modul obtain coupl semant base descript logic engin extract analysi schema analyz minim odl interfac order easili commun sourc descript wrapper mediat introduc data descript call odl recommend object data model standard odl close odl support requir intellig inform integr system odl sourc independ languag mediat manag system common deal sourc relat main wrt capabl express kind express declar integr constraint intra inter map rule sourc wrapper task translat data descript languag sourc odl add inform sourc type overview approach momi approach intellig schema integr articul gener common thesauru object step construct common thesauru terminolog relationship schema class belong sourc odl schemata engin odl interfac wrapper attribut class student wrapper relat attribut wrapper file system attribut file global schema builder queri manag mediat momi artemi figur architectur momi system kind terminolog relationship syn defin term consid interchang consid bt defin term gener mean rt posit defin term gener context terminolog relationship deriv analyz structur context class descript logic techniqu affin analysi odl class terminolog relationship thesauru evalu level affin class intra inter sourc concept affin introduc formal kind relationship occur class integr point view affin class establish mean affin coeffici base class attribut cluster odl class class affin sourc group cluster hierarch cluster techniqu goal identifi class integr describ semant relat inform gener mediat global schema unif affin cluster lead construct global schema mediat class defin repres cluster class union attribut global schema analyz sourc deriv basi pose queri sourc phase integr process detail mediat global schema exploit user pose queri inform global schema queri manag modul momi queri reformul semant optim discuss gener mediat global schema section present process lead definit mediat global mediat view data store local sourc run introduc paper explain approach fig sourc sourc relat inform staff student sourc comput scienc inform peopl belong comput scienc depart sourc tax posit deriv offic consist file store inform student tax fee complet sourc descript gener common affin analysi cluster techniqu appli give cluster tree shown fig classifi class group level affin start affin tree produc cluster global class global class repres class cluster class provid unifi view class gener global class interact design cl cluster affin tree global schema builder compon momi associ global class set global union sourc research school comput scienc sourc cs tax posit sourc tax figur sourc schemata room section cl cl cl cl locat cl student professor depart figur affin tree attribut class belong cl attribut affin unifi uniqu global attribut global class attribut unif process perform automat concern attribut ffl attribut affin due syn term select assign global attribut global class ffl attribut affin due bt nt broader term select assign global attribut global class output attribut unif process cluster cl fig set global dept student tax section faculti addit inform provid design complet global class definit global class global class odl inform attribut map default valu repres form rule odl specif global class person shown fig addit map rule inform map attribut attribut cluster valu defin cluster class global attribut map rule specifi attribut consid class cluster cl correspond defin class staff dot notat sourc class belong map rule defin global attribut rank rank instanc staff member global schema mediat global class defin cluster affin tree implement global schema builder descript global schema builder modul outlin state implement momi project global schema builder process local schemata receiv inform obtain mediat global base user queri compon fig sim integr read local schemata express odl deriv common thesauru set terminolog relationship store interact user descript logic express logic link exist intra inter start relationship common affin coeffici comput pair local class evalu level similar similar class group interfac person research school cs person student kei attribut string map rule comput comput comput tax attribut string rank map rule staff member figur global class specif odl artemi local schemata descript common thesauru mediat global schema sim engin figur global schema builder cluster gener cluster correspond mediat global class futur work present intellig approach schema integr heterogen inform sourc semant approach base compon cluster gener modul minim odl interfac modul compon develop milano futur research work devot deeper studi queri process optim develop queri manag function interschema properti relev perform inform integr process view queri process investig impact topic cluster studi order enhanc classif process semant featur refer knoblock process sim inform advanc plan austin aaai tool semant queri optim proc confer italian associ artifici intellig rome bergamaschi inform highli heterogen sourc textual cooper inform intern cia lectur note comput februari di intellig approach inform integr formal ontolog inform system june di exploit schema knowledg integr heterogen sourc proc sistemi basi di june bergamaschi valid complex object schemata support multipl appli intern journal artifici neural network complex problem solv mw ar resolut semant heterogen acm transact june fernandez ad structur unstructur proc int conf januari pp languag report work group held april de dictionari design proc int conf data april de mg schema techniqu accept public acm transact interschema knowledg cooper inform journal intellig cooper inform cattel object morgan widom tsimmi exhibit program acm page ca resolv schemat heterogen distribut parallel mt scrap wrap wrapper architectur legaci data proc int conf larg architectur futur inform ieee vol
IR/539 5 int comb ink content inform pagerank matt richardson pedro domingo depart comput scienc engin washington box wa usa abstract pagerank googl search greatli improv result web search account link structur web pagerank assign page score proport number time random surfer visit surf indefinit page outlink page equal probabl improv pagerank intellig guid probabilist model relev page queri effici execut algorithm queri time made precomput crawl time term experi larg subset web algorithm significantli outperform pagerank qualiti page remain effici todai larg search engin introduct tradit inform retriev techniqu give poor result vast scale highli variabl content qualiti found web search result improv inform link structur page algorithm hit pagerank highli success googl search engin heurist underli approach page inlink high qualiti page author page includ link page believ high qualiti queri word queri hit invok tradit search engin obtain set page relev expand set inlink attempt find type hub point page high author high comput carri queri feasibl todai search handl ten million queri dai pagerank comput singl measur qualiti page crawl time ur combin tradit inform retriev score queri time compar advantag greater disadvantag pagerank score page ignor page relev queri hand tradit inform retriev measur tfidf rate document highli queri term occur frequent pagerank rate page highli center larg page point page point page center larg relev queri issu queri word page word point page good choic page inlink page page inlink inlink page inlink page term paper search algorithm formal intuit comput crawl time pagerank score page view rate surfer visit surf web blindli jump page page algorithm closer human surfer jump preferenti page queri term problem common pagerank hit topic drift give weight page inlink network consid crawl queri tend relev queri chakrabarti al bharat heurist method differenti weight link algorithm view principl approach problem view analog pagerank cohn variat hit mendelzon pagerank page specif predecessor work appli optim version pagerank subset page queri suggest user machin describ pagerank introduc version demonstr implement effici present discuss result pagerank random surfer imagin web surfer jump web page web uniform probabl link follow step order reduc effect endless cycl surfer jump random page small page reformul graph web direct node repres web edg node repres link web page set set page page link set page link page page outlink add link page graph rank lost due page outlink redistribut uniformli page averag suffici number probabl surfer page point time page set node augment small constant pagerank score node defin equat iter evalu converg initi distribut uniform pagerank primari eigenvector transit matrix edg ji iter equat comput iter mean eigenvector column eigenvalu direct surfer model intellig probabilist hop page depend content page queri term surfer result probabl distribut page probabl surfer transit page page search queri specifi surfer jump link result probabl distribut page correspond pagerank score determin iter evalu equat initi primari eigenvector transit matrix ji arbitrari focu case probabl distribut deriv measur relev page queri multipl direct surfer follow lead page content deem relev queri similarli page outlink add link page page network surfer page jump distribut surfer select probabl term guid behavior equat larg number step select term step reach converg equat distribut determin result distribut visit web page pagerank standard pagerank vector primari eigenvector matrix vector primari eigenvector matrix interest question vector primari eigenvector matrix combin perform equat case primari eigenvector correspond obtain random surfer select queri distribut approxim equal pagerank result reason primari eigenvector matrix element satisfi primari eigenvector equat approxim eigenvector describ behavior approxim pagerank obtain surfer approxim error individu random surfer defin dissimilar choic relev function arbitrari simplest independ queri term reduc pagerank simpl function term page complex function tfidf inform retriev score obtain latent semant heurist measur text import note current text rank function easili incorpor direct surfer model difficulti calcul queri depend pagerank search engin perform queri expect return result problem precomput individu term rank combin queri time equat show comput storag requir hundr thousand word approxim time singl queri independ pagerank set word lexicon assum search queri term plain pagerank term number document term number uniqu pair sk storag term store result comput add minor restrict search queri return document term merg document term vector valu space requir store pagerank factor time queri independ pagerank number web note storag space requir search engin store inform store inform uniqu document term pair document direct surfer arriv page calcul subset node add reason constraint term document common inform retriev relev tfidf comput term document proport number document comput requir factor time comput queri independ pagerank notic experi comput converg fewer iter smaller empir reduc comput requir addit speedup deriv fact complet fit unlik pagerank larg repeatedli read graph structur disk comput emp ca sca ab fraction critic determin scalabl document vastli proport number search case word found word found document case contribut small million page section set uniqu remov common word result million found expect ratio remain constant larger set web page mean requir approxim time storag space time comput time arbitrari queri million word lt give result data crawl restrict domain crawler seed result googl distribut word text follow power law verifi hold true distribut number document word found common remov word dont affect search search googl link link end crawl million page domain million page stanford repositori million page html tag remov process calcul fraction word equal page compar algorithm standard pagerank algorithm content function similarli weight contribut search term log document frequenc publish merg pagerank content rank approach follow normal score add implicitli assum pagerank content rank equal import result poor pagerank found distribut pagerank skew distribut content normal vector result pagerank primarili determin final rank correct scale vector averag top ten term ad vector drastic improv pagerank search volunt request provid singl word doubl word search result total queri top result standard pagerank top result randomli mix rate search result search base content page point tabl show result experi similar experi tabl queri randomli select bharat volunt evalu independ knew result rank obtain perform accomplish rel improv relev result statist sampl person averag volunt tabl result tabl result queri pr queri pr associ alcohol comput lab architectur aid bicycl rock climb matern shakespear presid offic stamp collect car student tourism visitor visa zen averag averag found improv differ statist introduc model probabilist combin page content link structur form intellig random surfer model accommod essenti queri relev function produc result time storag requir reason todai larg scale search engin gari weslei frank experi volunt time refer kleinberg authorit sourc hyperlink environ ninth annual symposium discret page pagerank citat bring order web technic stanford brin page anatomi hypertextu web search engin seventh intern world wide web confer salton mcgill introduct modern inform retriev rajagopalan automat resourc compil analyz hyperlink structur text seventh intern world wide web bharat improv algorithm topic distil hyperlink environ annual intern acm sigir confer research develop inform retriev cohn hofmann miss link probabilist model document content hypertext connect advanc neural inform process system mit ma page comput web page reput ninth intern world wide web confer effici comput pagerank technic stanford golub van loan matrix comput john hopkin edit zipf human behavior principl effort paepck repositori web page ninth world wide web confer
DB/540 3 recent advanc research problem data wareh mohania vijai kumar dept comput scienc kansa mo usa advanc comput research school comput inform south lake australia depart social kyoto kyoto japan abstract recent commun wit emerg data wareh data global repositori store queri data resid possibl oper legaci sourc inform store data easili effici access make effect analyt process tool access data data complex data data support activ current research lead develop aspect data number problem solv make data wareh effect discuss recent develop data view parallel queri process number technic issu exploratori research present solut discuss introduct data integr repositori store inform origin possibl heterogen oper legaci data sourc content data replica part data sourc result preprocess queri store data power tool busi organ make busi architectur data wareh system number wai integr queri eager inform store approach integr data distribut data sourc pai rich translat calcul back sound analysi data wareh coupl analyt process enabl busi maker creativ analyz understand busi problem data system provid solut busi problem transform oper data strateg make inform data store summar inform oper data summar inform effect answer queri suppli pattern toi product california extract inform distribut relat requir queri multipl data sourc integr inform point present answer user requir time onlin data wareh queri find answer central reduc process manag cost number technic issu data wareh attent research commun lot work area issu fore present state art data wareh emphasi requir work present serv good overview excel survei area initi discuss research problem mention field delv research problem minut adopt global approach attempt give direct problem provid insight develop effici solut discuss solut rest paper section give architectur data wareh system discuss model implement scheme section section highlight constraint environ challeng data wareh maintain materi view view mainten branch number consist updat filter view mainten section investig discuss issu parallel data wareh section mention area activ research section section conclud paper discuss futur work data wareh system data wareh system architectur illustr figur data deriv data oper data system oper data sourc connect main function transform clean data monitor sourc data propag integr integr job combin data select data sourc resolv conflict data bring data consist form data propag storag commerci analysi develop tool data load exampl includ sa ibm data approach creat bottomup approach spreadsheet data mine tool front end tool user im rdbm integr oper data system copi softwar tool data data data mart data mart analysi tool writer report metadata data manag system olap server server monitor monitor monitor fig data wareh architectur data obtain primari sourc base data applic queri typic data integr data acquisit tool data obtain primari sourc queri pose system determin primari data sourc order answer queri approach similar eager lazi approach discuss approach data wareh user queri answer immedi data analysi effici data approach feasibl improv perform system approach hybrid combin aspect approach data store data obtain primari sourc demand metadata inform data usag data serv bridg user data data access olap server present front end tool analyt report data mine analysi inform olap server interpret client queri client interact front end tool pass queri olap convert complex sql queri extend requir access data access data primari sourc client queri oper data olap server pass view data front end tool format data client requir data model data model design tradit oltp system model complex queri data wareh environ transact oltp system made queri data wareh queri tend join larger comput time natur kind process environ warrant perspect data model data model data cube turn adequ model aggreg fact multipl call dimens data store fact dimens row column relat data model fact numer factual data repres specif busi activ dimens repres singl perspect data dimens set attribut conceptu data model physic realiz trust relat schema make section briefli describ scheme scheme scheme store data matrix storag structur cell arrai form intersect cell research publish journal data set requir smaller data storag data cluster compactli arrai valu dimens explicitli store tabl schema support data tabl schema tabl schema fundament structur draw terminolog statist attribut set schema paramet measur tabl set attribut set dimens dimens distinct subset attribut call paramet dimens attribut paramet dimens call measur attribut approach uniqu data cube tabl structur inher actual content tabl essenti orthogon structur cell data cube repres tabl tabl entri tabl entri extend dimens interpret mean current literatur tabl give implement implement suggest exist schema implement break tabl dimens tabl fact tabl schema tradit rolap challeng research commun find mechan translat tabl true implement requir data structur implement multipl dimens tabl relat relat data model classic tabl constraint relat defin number integr constraint conceptu design constraint broadli classifi kei referenti integr null check check constraint gener assert constraint easili translat trigger relat consist time concept defin constraint base depend map scenario current literatur model discuss constraint data cube relat integr busi constraint defin conceptu schema provid effici implement mainten cue relat identifi constraint exist model exploratori research area cube constraint class compar relat constraint constraint broadli classifi constraint constraint constraint defin constraint cube exploit relationship exist attribut cube relationship dimens relationship dimens measur attribut dimens attribut hierarchi cell characterist kei cube featur set constraint constraint defin relationship cube defin constraint constraint defin relationship dimens relationship measur relationship measur cube dimens cube relationship cube merg cube subset constraint cube constraint facilit conceptu schema design data provid trigger scenario relat trigger plai import role enforc constraint busi rule effect manner insert delet trigger relat model provid robust manual current data mainten algorithm neglect role trigger design effect view mainten paradigm research commun type trigger effect data wareh constraint set vital import faculti constraint set solv exist problem view mainten author view mainten techniqu base view express tree evalu view queri auxiliari relat materi node tree addit materi view updat node express tree calcul propag fashion updat node tree deriv updat children node auxiliari relat materi children node constraint defin broken smaller compon push express tree provid effici mechan view mainten aggreg queri optim constraint defin node tree updat node check constraint propag parent node updat violat propag updat parent node method constraint push edg express tree effect reduc commun comput cost constraint set act effect filter updat affect view constraint set effect tool aspect data wareh constraint set enabl defin complet algebra data model independ underli schema definit constraint set evolut attribut scenario constraint map world relat world view data model soccer ball constraint impress ball perspect constraint set enabl seek improv implement mechan conserv data task defin constraint set data model complet implement scheme constraint formal defin order constraint decid hope discuss initi spark activ research commun view mainten data store integr inform multipl data sourc materi view sourc data data sourc distribut autonom data sourc mv dw updat process updat materi view underli sourc data call view mainten view mainten problem evok great interest past year view mainten distribut environ rise inconsist finit unpredict amount time requir propag ds dw comput view updat data consist maintain data perform propag data sourc current state data sourc time propag data ensur view reflect consist state base data comput view updat state st data sourc instal view updat data order occur data sourc inconsist data occur place data sourc random dynam data comput view updat chang state data sourc st st violat consist criterion list make mv data decim problem inconsist elimin finit unpredict time requir queri data sourc comput view updat describ materi view data materi view mv data defin set base relat fr rn mv store preprocess queri data set base relat resid data sourc heterogen data sourc chang made relat affect mv mv defin chang mv chang comput mv updat data addit inform relat set resid data sourc comput view updat underli data sourc decoupl data requir finit comput time random data sourc give rise inconsist data data sourc support full function queri sourc comput view updat imposs task preprocess queri materi maintain access base relat approach replic base data entireti data mainten mv local data approach creat problem data ad space complex rise inform redund lead inconsist approach overlook point base tupl present view view base updat subset base relat suffici achiev case spj view subset base relat comput view updat store question address defin set minim auxiliari view materi suffici make view materi auxiliari view dw minim auxiliari view defin question mv instanc exploit current approach maintain mv separ separ view manag view approach fail recogn view maintain identifi set relat materi view issu address time approach set auxiliari view store data set materi view mv av research challeng li find econom av term space complex comput cost view mainten activ research problem feasibl provid view data cost provid exce cost queri data sourc comput view profit queri data sourc updat filter place sourc data reflect data creat view updat instal data leav view data unchang detect data sourc leav view propag data requir check distribut integr constraint singl site filter sourc result view updat propag updat filter reduc size mainten transact data minim time requir make data consist data sourc side effect updat filter make data sourc compon intellig particip data data configur updat check constraint set propag realiz data sourc decoupl data anymor give rise problem configur manag chang schema data sourc data particip entiti inform chang modifi constraint set reflect chang view mainten strategi base constraint set chang constraint set warrant chang exist view mainten transact view mainten view mainten increment queue larg number updat data sourc propag batch updat data sourc data current commerci batch updat period data view updat comput instal transact call mainten transact user typic issu queri data sequenc user queri call reader session batch mainten transact typic larg block reader session make data line durat mainten transact mainten transact typic run night advent internet global scheme give hour shop concept compani strive data onlin hour compani competit strategi increment view mainten updat data instantan chang data sourc rise inconsist result reader session updat data sourc chang result user sequenc queri problem discuss approach problem maintain version tupl data simultan reader session mainten transact block solut integr mainten auxiliari view answer queri mainten transact parallel data wareh discuss techniqu evalu olap queri faster techniqu restrict wai precomput strategi anticip queri materi data olap queri adhoc natur restrict precomput imagin design index scheme discuss provid faster access data store reduc size tabl store data strategi present provid faster queri fast perceiv user mechan recent exploit vendor comput queri quickli execut queri parallel partit data set processor potenti achiev linear speedup significantli improv queri time exploit technolog address kei issu parallel data placement parallel join exist data schema design strategi cater parallel data star schema suggest implicitli partit data set dimens tabl fact tabl dbm vendor claim support parallel data wareh data exist data effect parallel process environ achiev find innov techniqu parallel data placement underli properti data data index strategi provid effici data partit parallel resourc util effect algorithm split data parallel processor perform parallel join oper illustr cue work find effect solut research challeng research challeng discuss directli concern problem faster data integr challeng result data wareh concept mention challeng activ problem due chang user requir requir user view definit data chang dynam develop view adapt techniqu entir recomput materi view chang author present view adapt techniqu data recomput part view deriv exist materi view techniqu applic spj queri adapt algorithm aggreg queri issu investig fragment fragment plai import role design distribut enabl definit unit distribut enhanc queri perform enabl concurr parallel execut queri requir parallel process olap oper achiev quick time import fragment number fragment identifi type slice dice select subset data hypercub global data strategi emploi vendor support olap server partit option sever divid global data remov dimens hypercub method divid cube cube dimens oper perform sever ensur origin cube reconstruct sever cube interest problem problem data data materi ne point effici scheme determin data point effect garbag collect remov unnecessari tupl paper bring roof techniqu integr data quickli effect make data wareh grown strength strength year present challeng everydai find applic wareh plai crucial role discuss recent advanc research problem data view parallel queri process area discuss paper directli contribut larg wareh integr research work area umbrella paper serv step stone direct exploit data introduc concept constraint data cube highlight constraint set aspect data implement mainten paper underlin dynam materi view discuss issu involv area exploratori research present hope issu present invok keen interest data wareh commun refer chaudhuri dayal overview data wareh olap technolog acm sigmod volum page thoma case parallel data wareh olap technic dept az gupta mumick mainten materi applic ieee data engin special issu materi view ka ross adapt materi view redefinit proc acm sigmod intern confer manag san subrahmanian maintain view increment proc acm sigmod int conf manag page multipl view data wareh environ proc intl conf larg hull zhou framework support data integr materi virtual approach proc acm sigmod conf manag page effici comput differ consecut state proc int conf deduct volum lectur note comput page mohania dong algorithm adapt materi view data proc intern symposium cooper system advanc page increment mainten materi view proc intern confer expert system applic mohania avoid view adapt data proc intern hong page dallan ashish singh jennif widom make view data wareh proc intern confer parallel inform quass widom view mainten batch updat proc acm sigmod int conf manag ka sudarshan materi view mainten integr constraint trade space time proc acm sigmod intern confer manag jennif widom research problem data wareh proc fourth intl confer inform knowledg articl process macro packag llnc style
Agents/541 1 learn featur pose estim robert sim gregori dudek centr intellig machin mcgill canada abstract present method learn set featur pose estim landmark learn mechan design applic wide rang gener context comput landmark detect local measur distinct repres encod exploit match set obtain landmark evalu term util task hand method motiv gener approach sensor fusion present evid demonstr util method introduct develop approach robot local learn set recogniz featur robot environ problem learn set landmark set view scene priori assumpt made landmark initi obtain maxim local measur distinct imag approach mimic process visual attent paper extend previou work problem landmark detect match greater approach problem perspect comput optim estim multipl sourc input method base main model detect recogniz characterist linear subspac method recogn interpol reconstruct incomplet optim estim combin pose estim singl view elabor idea paper outlin section present discuss relat work problem pose estim section present overview method approach landmark detect discuss section section present method match candid landmark observ view section present approach determin landmark util applic method problem pose estim gener applic work problem sensor fusion present section result paper conclud section discuss result previou work previou work problem landmark detect context pose estim techniqu earli solut pose estim problem assum problem landmark recognit easili solv reliabl extract uniqu landmark sensor data method reli featur strict assumpt sensor approach includ vertic line detect emploi number author develop method avoid explicit imag defin implicit landmark process train neural network linear discrimin princip compon analysi note circumst imag recoveri reduc linear interpol suitabl model techniqu demonstr good result pose estim object recognit encod featur interpret method base global characterist imag tend fail presenc outlier approach attempt overcom avoid assumpt sensor exploit imag properti overview method section present overview approach pose estim method consist distinct learn explor pose estim phase initi phase set landmark extract imag data group futur recognit learn track landmark encod princip compon comput landmark exploit landmark function camera posit emploi pose camera consist detect classifi landmark current comput pose estim learn landmark method depict figur learn phase imag collect sampl rang pose environ landmark candid extract imag model visual attent note landmark necessarili correspond simpl geometr event scene candid landmark track landmark imag sampl pose space posit figur train method candid landmark track landmark input imag match merg final pose estim independ pose estim figur onlin pose estim phase track landmark extract visual similar set candid landmark configur space track landmark basi comput landmark featur posit intens measur term priori util pose estim set track landmark store futur retriev pose estim posit estim singl imag acquir camera candid landmark extract input imag model visual attent phase candid landmark match track landmark learn phase posit estim obtain comput featur match candid landmark final posit estim comput merg individu estim observ candid visual landmark order extract potenti landmark emploi statist measur local imag content object obtain robustli detect token pose estim good candid statist measur includ salienc measur edg densiti local output match filter individu edg distribut edg element scene close relat basic scene structur greater stabil track edg element distribut share similar advantag underli edg robust variat illumin formul landmark detector filter extract local maxima map imag measur local densiti obtain convolv edg map gaussian mask landmark candid extract base criterion maxim neighbourhood roughli size oper extract candid densiti measur significantli greater landmark candid repres region imag ordinari concept emploi dudek explor environ figur show result obtain run landmark detector imag obtain lab landmark origin intens comput densiti function defin set point imag initi set max point imag densiti function defin set candid point ith iter figur detect landmark imag standard deviat gaussian mask defin set landmark ith iter max iter halt max fall threshold defin repres standard deviat densiti worthwhil stabil landmark detector camera greater stabil lend robust track figur demonstr camera pose extract landmark imag left interv detect landmark candid bold squar note landmark perturb slightli camera move landmark consist mark imag region eventu estim pose track edg densiti track landmark candid landmark recognit maxima extract figur train process develop notion landmark local attent edg densiti landmark repres basic featur emploi pose accomplish comput landmark function camera posit order achiev stabil spatial variabl landmark establish track landmark set pose figur output landmark detector camera posit techniqu landmark track oper train imag landmark candid match select set landmark prototyp prototyp instanc observ landmark candid set landmark candid observ match includ prototyp constitut track landmark task landmark achiev princip compon refer eigenfac context face recognit repres landmark subspac encod intens distribut neighbourhood candid subspac comput intens distribut set prototyp match figur show set landmark prototyp construct prototyp figur landmark prototyp set initi initi defin set candid landmark observ select bootstrap imag set remain view sort distanc camera camera posit bootstrap imag imag consid extract candid match prototyp subset prototyp select set target match criterion prototyp observ instanc match nearbi view candid prototyp perform local search neighbourhood imag match match replac candid match select prototyp match found step match candid imag match reason add track landmark repres creat track landmark prototyp prototyp recomput linear subspac discrimin goal method grow landmark set space camera view candid landmark match correct target larg portion space measur qualiti match term euclidean distanc princip compon subspac defin prototyp local search neighbourhood perform order counter instabl underli landmark detector figur show typic landmark set poster door figur thumbnail imag correspond landmark detect imag grid posit configur space grid posit thumbnail imag posit configur space landmark candid found match prototyp figur typic landmark set track landmark essenti model primit subsequ correspond posit estim note match method make assumpt predict posit relax constraint pose decoupl match problem kinemat robot landmark util pose estim goal learn set landmark order estim unknown paramet camera futur observ landmark assum moment singl track landmark set observ singl landmark singl observ landmark view paramet unknown assum method comput pose estim function comput function view paramet landmark function featur quantifi properti observ exploit intens distribut landmark posit imag featur strictli comput comput approxim previou present method comput comput squar reconstruct featur vector repres princip compon subspac span featur vector interest evalu measur util comput pose estim achiev cross valid cross valid oper train observ input function comput measur error rememb comput approxim defin util moment distribut observ ss defin encapsul repres averag systemat error inher repres distribut error benefit comput comput pose estim observ correct systemat associ result order repres uncertainti estim note comput sole fix quantiti comput train phase note assum error gaussian case measur qualiti train data improv perform process estim pose pose estim pose estim involv extract match learn landmark erat pose estim match equat final step combin estim landmark obtain final pose estim order combin emploi approach smith cheeseman combin estim error model emploi error model prior outlier detect perform find median posit estim xm comput median cm set estim covari cm defin ellipsoid region pose scale control centr xm predict consid accept figur depict set posit estim set median estim estim consid accept solid repres locat train imag repres true pose input imag figur set filter predict set pose estim deriv sensor input includ estim deriv sonar comput sensor featur measur error comput deriv pose estim includ comput outlin modif method framework present repres gener approach sensor fusion reliabl util sourc comput priori explor concern problem estim set paramet weight sourc input made assumpt sourc error approach gener model error demonstr util method problem pose estim result techniqu test varieti environ obtain result result tabul tabl pose camera constrain singl orient imag scene collect demonstr method recov orient method train singl orient figur scene ii scene constrain environ posit camera mount robot measur high accuraci scene simpl construct set imag cm interv pose space scene ii emploi robot slightli complic imag collect interv pose space scene iii emploi camera mount mobil robot ground truth pose robot measur accuraci scene depict figur train imag collect interv pose space result scene produc tabl column record number train number test input sampl pose number track space nearest sampl train error standard deviat error set test input line express qualiti result term percentag figur present set estim obtain test imag obtain scene plot repres estim gener imag recal pose estim gener scene ii iii train sampl test sampl track landmark sampl space accuraci tabl result prior knowledg robot posit accuraci highli satisfi exploit inform multipl case kalman filter serv improv result coordin cm pose estim ground truth figur set pose estim obtain laboratori environ shown figur experi scene time requir train pentium ii candid landmark detect measur util track total total train pose estim phase test imag requir imag note time consum part local phase match phase paper present method learn set landmark set view environ order obtain accur pose estim candid landmark detect local maxima measur distinct landmark candid group track landmark set candid correspond visual region observ viewpoint group achiev match subspac encod adjust posit imag order improv match function comput gener pose estim futur observ match track landmark util measur order determin qualiti train data expect confid subsequ pose estim onlin posit estim perform detect candid match track landmark match gener pose estim set estim combin robust statist argu method easili extend incorpor varieti featur sensor result method perform varieti environ space preclud approach extend domain involv imag video index segment open question relat exploit type approach modul optim number sampl imag acquir refer eric gregori dudek autom map ieee confer comput vision pattern percept mobil page june dudek zhang robot local explicit object model ieee intern confer robot eric mobil robot local singl imag ieee intern confer robot page sk sa track visual ieee intern confer robot page san starner modular eigenspac face recognit proc ieee confer comput vision pattern page june ieee press poggio girosi network approxim learn ieee neural network theori volum page sim dudek mobil robot local learn landmark confer intellig robot octob ieee press sim dudek learn visual landmark pose estim ieee intern confer robot ieee press randal smith peter cheeseman estim spatial intern journal robot locat problem robot navig singl camera comput imag kt sutherland wb thompson inexact navig page sebastian thrun find landmark mobil robot navig ieee intern confer robot page matthew turk alex pentland face model recognit mobil robot nov grace converg rate thin plate smooth spline data noisi smooth techniqu curv page
IR/542 5 interfac make speech readabl searchabl steve julia brian phil larri gari aaron rosenberg park avenu florham nj usa abstract amount privat speech data limit lack tool permit search goal research provid tool overcom inher difficulti speech support visual inform extract describ principl design ui speech hear automat speech recognit gener transcript speech data transcript visual analogu underli data graphic user interfac user visual annot search transcript user transcript access plai specif region underli messag summar previou studi usag motiv describ embodi report laboratori experi month field trial evalu outperform state art system core task attribut support visual search inform extract asr transcript improv effici process transcript provid inform user extract kei point navig import region underli plai directli keyword speech asynchron empir evalu introduct fix refer number fix field trial ref amount privat speech includ broadcast corpor meet record archiv speech data gener benefit express easi produc hamper lack effect end user tool access manipul speech serial medium readili support visual scan kei word spot contrast tool access text text benefit searchabl inform retriev techniqu support visual user navig relev region combin format inform word spot appli systemat process relev region goal current research provid ui support search visual scan speech data previou approach speech access emploi main techniqu type structur indic access speech speaker emphasi extern event user behavior accompani visual event indic repres random access relev region approach involv search automat speech recognit appli result error text search inform retriev techniqu surfac manipul signal process techniqu appli digit speech plai back time normal retain research combin techniqu order access speech data chose refer applic reason studi workplac commun estim million user worldwid organ reli heavili conduct everydai prefer email common featur cellular phone ubiqu problem current user interfac structur paper summar previou studi usag serv motiv design studi identifi kei user messag inform statu track archiv identifi central user strategi messag user transcrib part messag order avoid origin messag describ ui embodi principl hear system gener transcript speech data appli asr underli speech data transcript interfac speech data inform retriev index transcript search graphic user interfac support visual annot underli speech asr transcript provid inform user extract kei point navig import region underli plai directli peopl avoid listen entir messag system appli inform extract techniqu identifi critic piec telephon speech automat discuss address task identifi describ laboratori evalu user month field trial evalu system outperform state art tm varieti task measur attribut support visual search inform extract figur user interfac task process strategi previou studi collect qualit quantit data identifi user kei task strategi process typic data includ server survei interview high volum user data show messag amount half survei report averag messag length half report length minut interview messag complex simpl huge email messag worth substitut seri transact entir task accomplish exchang messag talk person real user report main task process scan search mailbox identifi import extract inform individu track statu current manag archiv store messag scan scan search priorit incom locat valuabl save messag user current scan strategi sampl messag sequenc determin locat statu peopl survei messag header identifi urgent report user listen speaker determin messag requir action locat store user retain detail model archiv survei report messag standard procedur find archiv messag linear natur mailbox search make locat oner multipl messag store inform relev messag user extract critic inform labori process involv repeatedli listen messag verbatim fact caller phone number multipl listen vagu highli detail messag report replai messag half reduc repetit survei user report written note user emploi strategi strategi full user attempt produc written transcript target reduc futur access strategi note indic messag object strategi abstract predict kei point messag caller caller reason import action user origin voic messag backup incomplet sketchi note note identifi navig origin messag user comment labori natur construct manag note statu workplac task deleg common user problem track messag statu statu track preval problem user access time pressur defer process number incom messag access unclear messag dealt main techniqu statu track peopl note inform extract remind note scrap dedic user work remind statu track user note leav messag mailbox remind place user scan archiv scan remind outstand messag weak strategi visibl remind user access archiv unawar presenc unresolv item user manag archiv access user archiv consist messag save valuabl messag engag period access messag sequenc determin preserv remov superflu user make easier scan exist valuabl monitor remind messag engag report extent accumul irrelev messag system design basi studi design multimod system support improv access guid design user strategi messag directli support user task identifi transcrib note captur content messag assist inform extract serv visual analogu store speech messag note support statu aspect archiv manag previou research show util system user onlin note access speech note benefit user felt highli labori design system automat gener transcript asr transcript interfac underli support visual scan search error current qualiti asr call design principl speech access hear asr transcript provid inform user extract kei point read transcript hard user visual scan navig import region underli speech user interfac user select import region transcript plai speech specif part messag peopl avoid listen entir messag ui shown fig main ui player archiv manag tool messag header panel phone switch length phone number phone time phone number extract line attach user note doubl click header select displai asr transcript begin plai messag commonli report limit tradit header absenc inform larg proport call sampl messag telephon switch provid inform extern identifi system provid detail inform extern system widespread address built server acoust model automat identifi repeat inform telephon switch user provid initi label feedback system subsequ identifi caller correctli feedback inform train acoust success messag caller gener server present header inform extract techniqu automat identifi telephon number mention messag phone icon header messag potenti phone number featur user view plai number speech header user edit phone number incorrectli transcrib test phone number identifi program recal transcript gener asr server transcript word accuraci speech format acoust segment algorithm segment identifi durat inform acoust signal energi click paragraph highlight specif region text transcript plai speech region select phone icon bracket number asr transcript click phone icon plai speech number mention futur item extract messag includ time cod ed eva es ag figur search user thumbnail imag current messag depict graphic overview messag user click thumbnail plai entir messag audio paragraph associ note note attach current messag displai messag select search bar user search content mailbox search result present search keyword thumbnail depict region transcript thumbnail keyword user focu region transcript thumbnail relev kei word player support audio plai includ plai entir manual select audio plai speed custom messag speed slow preserv archiv manag tool enabl user file messag folder delet final provid email server forward asr messag header user email origin voic messag store audio attach user read transcript email listen launch client ui plai attach directli describ interfac intend support task observ origin user studi inform extract messag transcript header initi user user kei strategi inform extract textual record messag content messag transcript gener automat speech recognit user extract inform messag wai read transcript directli transcript hard understand due recognit transcript navig region judg import plai speech select relev part transcript provid direct assist inform extract automat extract kei fact phone highlight header transcript scan search import set cue priorit locat import messag provid header inform depict gener inform enabl user visual scan randomli access longer access messag sequenc identifi specif messag automat extract phone number caller facilit scan process provid search user directli access messag content statu track annot overview inform user interfac design support statu track wai analog user paper base strategi leav visual remind user note explicitli record action fig hope mere fact visual messag visibl mailbox serv remind peopl action access messag jane remind action messag requir final cue messag statu messag depict standard email font transcript attach gener header figur messag forward email archiv manag user report problem rememb content prevent build irrelev messag interfac provid set tool manag creat copi delet inform folder implicit support archiv manag provid visibl enabl archiv quickli scan identifi import messag filter superflu implement messag retriev process asr server segment speech text transcript multipl asr pass achiev accuraci ensur system pass complet present ui replac previou pass pass approxim final pass time real time messag audio transcript pass inform extract inform retriev server acoust languag model ir server train hour messag transcript index inform retriev server smart ir engin kei phone extract transcript server server build seri acoust model caller caller messag caller inform suppli switch modul train user user assign messag caller inform provid switch part laboratori studi field trial laboratori studi evalu control condit field trial examin system everydai work laboratori studi compar state art studi main determin outperform experienc user retriev determin system featur extens experi system carri task interfac gave artifici mailbox type repres task prior user task local inform extract messag specif topic extract specif search scan messag directli relat summari messag respect summar view global inform extract artifici mailbox control messag meant examin statu track archiv manag requir access person data user encourag identifi process problem strategi log process number type user interfac outcom task complet time solut qualiti rate independ user differ greatli spent larg amount time optim satisfi solut previou research control normal measur user answer short survei complet effect ui task complet user answer longer survei compar interfac evalu featur interview user experi experi system figur perform interfac search summari task interfac find perform predict perform normal solut qualiti task direct support aspect speech access data analyz analysi task type user interfac independ variabl normal success depend variabl fig found higher normal score effect predict greater advantag local inform extract search summari task requir navig support task differ show higher normal score search task find effect inform extract task requir access proper recogn asr user listen order extract reduc benefit transcript predict user prefer provid direct support aspect speech access judg make task timeconsum relev messag easier inform messag interfac independ variabl relev judgment depend user behavior made predict effect transcript search perform exclud user analysi detail note messag respond search experi qualiti transcript lead peopl plai extract inform directli transcript focu plai import region transcript weak evid predict transcript higher word error rate plai achiev lower normal score suggest poor transcript qualiti reduc perform user comment transcript combin enabl reduc amount speech read relev inform directli transcript navig relev region transcript arent find relev portion listen predict success search enabl user plai perform search effect identifi relev messag reduc potenti number messag listen consist found user successfulli gener search queri tend plai speech user comment provid support util find relev messag filter subset header note search thumbnail transcript featur figur perceiv featur util gener disadvantag interfac error transcript meant read transcript mislead queri fail user comment transcript hard read asr lack punctuat format user spent larg amount time attempt interpret poor transcript larg amount tend score poorli user fail possibl word kei term miss transcript relev document found search user awar problem transcript qualiti good find relev messag easi forget depend qualiti speech user search dont trust search wind blind perceiv util system featur user rate system featur anova perceiv featur util task show major differ featur highli rate phone number found observ support post hoc test user point scenario lower rate featur note repeatedli access import header phone number anticip call specif person laboratori studi show outperform highli experienc user reveal aspect led benefit behavior data show success user plai transcript enabl read inform directli focu relev region messag search effici audio enabl user focu relev messag util search transcript evidenc user prefer featur combin field trial design user field trial investig effect system support core task everydai usag log usag data week collect data number durat messag store oper note search header data collect survei data compar space constraint prevent complet present data main focu user evid provid util featur present data total user session central question concern util transcript inform extract log analysi show user access transcript plai user extract suffici inform messag read plai user comment show peopl extract gist messag listen messag glanc messag topic glanc user plai occas plai complet messag plai oper origin click part transcript partial plai messag util transcript user restrict audio process import region messag contrast greater effici user gener process messag listen entireti sourc evid util transcript user behavior log show user averag messag access contrast process rule amount occur straightforward access messag inform obviat larg number manual paper note record phone number synopsi messag inform easi retriev dont user fact system gener inform record transcript type transcript highli valuabl inform system featur prove extract phone number view header occas messag access access phone number suffici inform user read plai part messag accuraci extract phone number shown fact user correct phone number data util search mix log analysi user retain messag receiv number archiv messag suggest user shift set messag process view perman inform resourc user perman visibl record data show shift archiv view search occas messag search perceiv user survei search peopl archiv access messag visual scan email forward unanticip user extrem posit transcript messag forward email email forward serv notifi presenc incom provid email transcript user determin kei point import plai relev portion user point effici access messag directli email compar complex log system greater access check email frequent respond promptli peopl thought forward provid unifi messag interfac email weekend check email check cool led call screen user point access process messag meant fundament alter handl incom call screen call screen popular cell phone phone includ small displai user forward email cell phone check line decid import access full messag base data gather user built ui speech data base asr transcript visual inform extract search ui support user field trial outperform state art system show provid transcript facilit effici messag enabl user read inform transcript directli transcript inform focu audio plai import region messag automat extract telephon number valuabl field trial shift user view medium requir process inform archiv user quickli habitu idea messag perman archiv provid search inform extract tool convert viabl inform contrast current system make search scan highli oner email forward servic prove extrem success provid rapid scan effici access email transcript speech attach find hear principl speech ui design transcript view visual analogu underli interfac access speech data demonstr transcript util speech search consist work base access broadcast data approach system design access larg speech corpora transcript access speech access indic extract video semant process explain greater success critic differ work li transcript interfac transcript format acoust user import select plai underli speech system transcript control plai factor asr accuraci shown accuraci larg effect success speech search stark accuraci suffici inform extract direct disadvantag approach stem asr error transcript gener place trust inaccur transcript induc error inform extract search address futur depict asr confid inform probabl word correctli recogn word asr lower confid grai suggest treat caution possibl suggest user transcript error correct system combin advantag annot base system avoid oner task handwritten note user point current system commun work requir mobil access user forward email address recent develop version simplifi ui run compaq provid mobil access user report field trial ui ineffect support statu track task explan current lack mobil access mean user remind outstand desk mobil system address practic theoret implic result tool successfulli address problem user effici access data contribut grow bodi research gener method speech access demonstr viabil techniqu speech transcript visual analogu underli support scan search question investig good asr support scan extend inform extract techniqu find import inform time determin messag part messag import trivial prosod lexic final examin approach extend applic speech access meet focu group legal interview refer interact skim speech unpublish phd mit media comput support read read text comparison read intern journal man machin interact comic book present explor video express rich work audio hauptmann multimedia inform acquisit mayburi intellig multimedia inform aaai pp structur repres ubiquit audio acm transact inform search speech data eurospeech acoust indic topic segment retriev spoken document combin multipl index paradigm index ieee van multimedia meet voic messag coordin commun intellectu lawrenc smart retriev englewood asr effect asr accuraci speech retriev intern confer spoken languag augment audio notebook interfac enabl design evalu user interfac support retriev speech archiv talk action plai studi factor underli speech behaviour handwritten note provid access record segment speech speaker identif proc field trial design field trial investig effect system support task everydai usag part studi instal system administ user questionnair address user number messag receiv process gather data inform statu track archiv strategi survei peopl success featur inform messag support core task log usag data week collect data number durat messag store oper messag note search header data administ extend version origin questionnair addit question basic featur search email transcript research result instal system collect log user market secretari support staff larg telecommun compani complet questionnair interview log show frequent system peopl receiv averag system process messag peopl system averag session length hour minut user tend applic constantli unlik short session rule typic messag plai part messag plai peopl header plai messag transcript player click paragraph plai remain time user replai messag messag averag plai session contrast user typic save messag end archiv messag receiv result tabl prefer predict peopl rate process messag support inform statu track archiv hypothesi confirm user prefer partial thing messag show onlin messag note transcrib messag highli record transcript type peopl gist messag listen messag topic glanc scan search scan rate easier visual automat gener inform annot user find easier locat specif messag abil scan hypothesi confirm user switch scan strategi sequenti sampl messag header search expect user chang sampl messag visual scan cochran inform extract user rate inform extract easier automat provis phone user replai messag inform automat transcript header peopl fewer note transcript header inform provid inform peopl note hypothesi measur system statist differ hypothesi process confirm scan confirm locat specif messag confirm prefer strategi locat messag user listen sec user emploi visual scan search cochran confirm inform extract confirm hypothesi measur system statist differ hypothesi replai frequenc confirm frequenc confirm track messag statu ns determin action messag ns confirm delet behavior confirm estim number archiv messag confirm access save messag confirm tabl comparison user interfac log show user averag note amount occur straightforward access inform obviat larg number manual paper note record phone number synopsi messag inform easi retriev dont util transcript inform extract support fact peopl plai part messag access interfac messag plai complet util phone number find relev phone number messag shown fact messag access ui statu track user find easier track messag abil scan outstand messag glanc hypothesi peopl lose note note store singl locat hypothesi system fail support statu possibl handwritten note effect remind messag statu extern visibl artifact user note automat provid messag header insuffici remind archiv scan search predict peopl delet fewer messag predict user judg archiv messag versu archiv search tool provid abil search scan archiv make user judg easier access save messag result show made easier store access valu messag log user retain messag receiv number archiv messag suggest user shift set messag process view perman inform resourc user perman visibl record email forward unanticip user extrem posit transcript messag forward email email forward serv notifi presenc incom scan email transcript determin kei point plai relev messag portion user point effici access messag directli email compar complex log system greater access check email frequent voic mail respond promptli voic peopl thought forward provid unifi messag interfac email weekend check email check cool led call screen user point access process messag meant fundament alter handl incom call screen call screen popular cell phone phone includ small displai user forward email cell phone check line decid import access full messag
Agents/543 1 team format mobil agent institut comput al www home abstract process team format autonom agent distribut environ present environ problem commun consist make insid team deal standard techniqu token pass comput network appli pass cycl token serv commun rout assur consist make insid team maintain organiz integr hand constitut compon plan cooper work perform complet team algorithm team format base simpl agent view reactiv agent augment cooper mechan base sophist agent algorithm base fulli cooper adapt static rout algorithm comput construct order compar perform perform team format algorithm kei team cooper autonom distribut comput network introduct cooper consid kei concept system cooper special interest devot notion team teamwork team format assum applic member team fix research teamwork research team format concern theoret fundament realist model team format process approach team format base exampl domain distribut comput network environ forc partial support state scientif research grant esprit project interact insid inform goal local order maintain integr mechan elimin inconsist make contradictori inform goal insid team manag problem adopt standard techniqu token pass comput network token sign member team token author decid statu team pass cycl token serv assur power pass agent insid team determin commun rout compon plan cooper work perform complet team item correspond inform busi structur notion team simpl organiz form crucial idea approach reli fact team expand start singl agent common goal expand team inconsist knowledg acquir dynam chang team start shrink remov member expand team resourc capabl achiev common member team perform cooper work interest featur approach plan final cooper work team construct step step format introduc algorithm correspond type agent particip team format base simpl agent electr agent simpl agent view reactiv agent augment cooper mechan strategi simpl agent simpl consist make fusion team consist goal result team expand shrink fast strategi electr agent subtl base idea electr circuit resistor roughli strategi determin team join assur maxim subject probabl agent knowledg agent achiev goal order basi comparison perform team format introduc algorithm fulli cooper agent call ant adapt static rout algorithm comput work network server mobil agent move server order resourc scatter randomli server enhanc cooper entri server forbidden agent forbidden agent agent agent compet agent execut type resourc receiv resourc move server end activ team format process cooper mechan instanc cooper structur limit space permit discuss issu detail notion team relat classic notion approach view step understand construct mechan autonom agent form organ rest paper organ section formal distribut environ section instanc environ present section devot concept team team format section algorithm present section version algorithm agent section detail comparison perform algorithm section devot final distribut environ order present graph repres network set vertic set edg mg set mobil agent move server subset server agent set resourc distribut randomli server static server denot resourc manag server transport mobil agent assum fulfil requir mobil agent denot set agent mobil agent assign origin consist minim effort end activ switch state effort relat agent person action execut cost subtract account goal type action execut mobil agent move server provid server action joint action agent agent give resourc agent joint action agent meet state group agent provid server joint action agent mobil agent switch state pass resourc agent agent meet state server agent gossip opportun exchang knowledg agent resourc includ calcul recent knowledg agent detail gossip assur maxim spread inform system note problem state afor mention consist proper cooper transport resourc solv coalit format method base game order comput coalit util agent game difficult real applic result high comput cost includ agent util solut individu agent initi knowledg wander network gossip agent team format method present paper solut exampl cooper mechan exampl consid section devot analyz method agent exchang triangl sign draft bridg team format lattic fig simpl exampl start defin simpler method cooper exchang sign show applic limit case larg distribut call sophist coordin mechan team format method triangl agent enter server ii goal agent enter server ii goal agent enter server iii goal agent resid server resourc cooper call implement exchang resourc idea involv agent exchang resourc follow agreement execut action notic exchang resourc agent agent agent perform sequenti order agent achiev goal server exchang resourc bridg method cooper call sign draft agent agent call draft reward draft written agent bring back resourc agent resourc unreach figur agent enter server goal agent enter server goal agent goal enter serv bridg agent agent server ii agent agent notic exchang agent initi resourc fig lattic lattic lattic shown figur number section number compet agent section resourc requir agent section possess agent resourc requir agent section possess agent notic simpl cooper mechan exchang sign draft construct robust gener protocol lattic difficult job experi show inform perfectli distribut calcul proper exchang sign draft action complic order deal larg complex network introduc notion team team intuit idea team format method present introduct section section concept team introduc formal definit team defin satisfi condit set team consist goal member jg joint goal set resourc team pass df call token pass sequenc agent length jt mode denot current mode mean encod explain token pointer posit pass posit distinguish token moment pass cycl pass describ order token agent pass token agent intuit mean mode team expand team rid team realiz goal member team complet realiz joint member team resourc capabl achiev goal capabl possibl enter server bridg agent initi capabl enter server network joint goal team imposs achiev resourc capabl team achiev goal possess team join goal jg inconsist jg jg join goal inconsist goal agent token call repres inform agent entir power team consist chang mode team decid fusion team subject switch stai expand mode permiss current knowledg team joint goal achiev team resourc capabl addit agent joint fusion team provid team expand goal team consist goal team repres team join switch stai shrink mode obligatori current knowledg team achiev joint goal switch final mode provid team resourc capabl realiz joint goal oblig team member agent member team time team member oblig compli team rule give resourc case team final mode member pass team member agent pass cycl agent oblig close agent token time token time construct team join agent team agent resourc goal decid make team df jg df df pass df token df mode df jg final join agent team agent repres team agent decid join agent team make team df jg df jg df token df mode df expand jg final pass cycl pass pass cycl pass df fig fusion team fusion team team expand mode agent agent make fusion team team result defin df jg df jg jg df mode df jg final pass cycl pass pass pass cycl pass cycl defin pass df figur token df shrink team team shrink mode repres pass cycl pass team reduc team remov agent goal resourc construct pass cycl pass df repres df notic element remov pass cycl agent free previou team oblig final cooper work perform team mode chang final mode pass cycl serv transport rout member team unnecessari transport token agent pass cycl agent free leav team resourc cooper work occur pass cycl agent team reduc shrink mode properti pass cycl pass cycl serv assur power pass agent insid team assur commun flow insid maintain organiz integr team assur cooper work complet team perform final mode item constitut organiz frame team import properti pass formul lemma lemma team condit member team occur pass cycl server agent segment length pass cycl occur pass cycl agent token agent agent receiv token agent formal condit state kn segment pass cycl kn algorithm present section base system initi configur agent resourc section common knowledg agent locat agent resourc chang dynam distribut initi knowledg agent opportun updat knowledg agent resourc agent gossip exchang updat knowledg gossip automaton gossip concern agent posit current configur team network assumpt assur maxim spread inform system algorithm order basi compar perform team format algorithm introduc adapt standard static rout algorithm comput network agent model algorithm consid fulli call ant algorithm implement idea main persist goal ant reach resourc possess ant ant order realiz common global goal system contrast goal interest resourc ant act protocol sketch ant meet gossip ant ant deliv resourc find ant ant resourc ant ant closer detail descript dist minim number pass resourc ant start deliv ant ant calcul exchang resourc order achiev common goal resourc ant calcul distanc dist dist resourc iff dist dist agent dist dist number resourc exchang ant meet order find common server ant calcul server df distanc server current posit ant set ant ant expect meet server ant move server neighborhood maxim expect commun ant find rid express individu ration achiev goal ant wait long place long solv set walk random direct algorithm serv basi comparison team format algorithm algorithm team format section present algorithm team format order present algorithm put protocol agent sake give sketch protocol note protocol ant ant goal common concern global state system algorithm present make technic assumpt agent token agent agent oblig distanc small agent give back token time problem token pass team member solv set knowledg acquir updat agent chanc fulfil move gossip hope inform make goal achiev crucial point construct algorithm mechan decid team realiz goal team reason version algorithm note singl agent consid team reason initi agent free team oblig introduc section achiev goal simpl cooper mechan exchang sign section wander network hope find resourc bound team agent commit creat team agent join exist team simplic present singl agent team simpl algorithm version mechan simpl consist team fusion team goal consist goal result situat team expand shrink fast electr algorithm version team mechan subtl base idea electr circuit resistor explain figur team resourc team clear team make fusion team movement rang team team intermediari team fig graph movement rang depend repres electr circuit graph relat movement rang consid resourc interpret electr circuit team node resistor team team meet goal team mutual contradictori option set resist reflect effort resourc transport easi calcul current intens node circuit node intens interpret measur team resourc team resourc good measur necess team happen union necess includ agent team resourc possess hand happen team form complet realiz goal team construct measur graph movement rang resourc team candid fusion electr circuit detail construct measur implement algorithm long distanc target construct architectur agent implement real distribut environ internet team format mechan view part architectur comput network difficult measur effici independ factor chang process speed network transmiss decid simul version system comput fulli control environ algorithm implement concurr agent simul random choic agent activ random order agent meet server differ real simul concurr consist possibl pass agent server opposit direct situat exclud real world transfer mobil agent requir synchron mobil agent simul opportun observ behavior agent make statist global perform lattic exampl figur serv instanc distribut environ agent algorithm size lattic experi perform gener experi agent effici averag perform simpl agent time ant perform price paid selfish agent submiss team rule recal agent give resourc member complet team world perform simpl agent improv ant problem switch environ ant meet server common knowledg global goal realiz ant activ forev gossip wander network observ poor perform electr algorithm averag perform electr agent time perform simpl agent fact electr agent join team consist team repres unit team larg result joint team unabl achiev fact reach repres team case electr team expand faster size simpl process reduct slower simpl algorithm flexibl electr test exampl statist show complex algorithm polynomi observ simpl agent perform job reactiv agent perform ant problem finish activ distribut environ final experi augment reactiv agent protocol order effici agent make reactiv agent sophist make prove ineffici exampl consid paper team format method present paper complet ration solut point view singl agent format method gener robust cooper mechan clear team format process cooper structur order prove formal analysi team format process term joint action organiz form team flat extrem simpl role agent agent agent token moment clear pass token order pass cycl effect reason token pass agent expand shrink team concern cooper work final mode resourc pass directli agent wander long pass cycl order improv effici team perform addit role mediat team token pass resourc distribut environ distribut problem mediat perform job mediat mediat coordin consist goal team super structur mediat incorpor organiz form team super structur simpl flat frame team hierarch idea close relat gener framework format explor ongo work refer bratman practic reason harvard pr hj levesqu teamwork pr hj ira smith team format hintikka tuomela contemporari action volum social kluwer academ pp je tj norman cooper knowledg engin krau collabor plan complex group action artifici pp wooldridg cooper structur proc august jen commit foundat coordin knowledg engin review pp jen control cooper problem solv industri system joint intent artifici intellig ketchpel coalit format ration agent proc werner plan team activ castelfranchi werner artifici social lnai osawa robocup synthet agent challeng proc ch mueller formal busi process engin base graph grammar intern journal product special issu busi process reengin shehori coalit format ration inform agent proc springer lnai pp mae situat agent goal design autonom theori practic biologi back mit pp team format autonom agent ms warsaw institut faculti electron track latest bound timestamp lnc pp rao georgeff model ration agent fike proc intern confer principl knowledg reason morgan pp tw sandholm vr lesser coalit bound agent artifici intellig pp sycara jha coordin trough coalit format proc scott linear tamb flexibl teamwork journal artifici intellig pp tanenbaum comput network wooldridg jen theori cooper problem solv distribut softwar agent applic lnai pp zlotkin js rosenschein cryptographi mechan coalit format task orient domain proc pp
DB/544 3 clausal resolut method ctl tempor logic alexand michael fisher depart comput mathemat manchest metropolitan manchest uk clausal resolut method ctl abstract paper extend clausal resolut method linear time tempor logic framework effici deduct method varieti applic requir express tempor logic ai tempor logic consid comput tree logic regard simplest logic class kei element resolut normal concept step resolut tempor resolut introduc justifi respect logic complet argument exampl tempor resolut method futur extens method extend ctl ctl extend fair ctl power logic class outlin implement approach adapt techniqu develop tempor resolut autom program specif verif introduct tempor origin develop logic framework describ natur languag consid essenti tool area artifici intellig comput scienc tempor logic crucial structur invok tempor aspect case tempor program specif problem solv inform retriev sequenc step program execut consid sequenc moment state tempor logic proof correct program correspond proof tempor logic area tempor logic extens specif verif properti concurr distribut system power tempor languag varieti complex properti relat deadlock invari applic requir tempor reason logic tool extend tempor model aim repres behavior complex dynam complex abil refer rang execut path model import emerson logic framework reason system call tempor logic underli model time choic possibl branch futur execut logic origin develop specif concurr distribut system emerson varieti specif syntact lead level express constraint comput tree logic shown plai role potenti applic observ emerson suffici express properti requir properti simpl concurr program deal extens ctl ctl commonli consid full logic sistla core logic concentr extend extend ctl incorpor simpl fair constraint shown ctl extend ctl boolean combin tempor modal ctl express power ctl halpern strictli express classif formal specif verif major algorithm research tempor logic concentr algorithm center techniqu satisfi formula linear tempor logic check respect model deriv program emerson varieti algorithm develop logic ctl ctl emerson lee algorithm approach fulli autom applic gener restrict system deduct method base handl arbitrarili complex system provid uniform proof case deduct method requir guidanc assist investig autom deduct method essenti method real applic recent year applic tempor logic requir improv proof method notabl specif verif system georgeff due success model check lack direct applic proof tempor research carri effici procedur logic work produc concern basic tableau automata method logic autom applic deduct method lack research direct proof method led requir potenti proof method clausal resolut power method wide framework classic logic paper introduc clausal resolut method comput tree logic regard simplest logic introduct resolut method framework tempor logic theoret interest import incorpor varieti method techniqu develop resolut method classic logic clausal resolut linear time tempor logic linear discret tempor logic proof method base clausal resolut develop due approach shown amen effici implement base normal form potenti repres rang tempor util varieti model structur extens approach ctl provid refin version fisher kei element normal concept step resolut form tempor resolut introduc justifi respect logic outlin syntax semant ctl rich tempor consist tempor modal repres resolut approach introduc normal form ctl formula ctl formula normal form set formula special tempor remov set express inform origin formula inform concern situat proposit occur futur constrain point tempor resolut rule appli rang resolut simplif rule exampl correct argument provid conclud remark futur show extens clausal resolut approach power logic ctl extend fair ctl power logic class appendix provid complet axiomat system ctl part complet proof comput tree logic syntax ctl defin languag comput tree logic symbol ffl atom pn ffl classic ffl classic defin constant true ffl constant start mean begin time ffl tempor futur time futur moment time ffl path futur path start futur path start set formula defin atom true start au aw path formula path formula ap ep import featur logic distinguish state path formula reflect definit step introduc state step introduc path formula set ctl formula consist state formula ctl formula specif structur tempor oper immedi path path oper tempor oper nest tempor oper boolean combin ctl syntax result ctl weaker tempor logic express capabl path restrict note formula type describ properti satisfi specif path construct ctl syntax ctl express logic quantifi path varieti natur extens culmin ctl intermedi extens extend ctl semant ctl observ ctl featur import ffl state infinit number ffl state belong path sequenc state finit past infinit ffl merg path diverg point path common state detail descript ctl theoret subsystem extens formula ctl interpret model structur ffl set ffl ae binari relat exist hs path isomorph natur abbrevi relat ffl interpret atom proposit symbol state defin relat chang similar definit evalu ctl formula state model notat metalanguag logic constant quantifi top mean metalanguag ffl ffl metalanguag exist differenti metalanguag express languag state exist root structur tree term satisfi ffl infinit sequenc ffl path origin case standard abbrevi indic scope quantifi express abbrevi part induct definit relat ctl semant concern state start iff iff atom iff ffl iff ffl iff ffl iff ffl ab iff ffl xs eb iff ffl xs part definit introduc relat set path formula iff ffl ffl iff ffl ffl iff au iff ffl ffl ffl ffl sk ffl aw iff ffl au definit ctl satisfi ffl definit ctl valid satisfi ffl normal form ctl proof method requir definit normal form ctl formula algorithm gener normal form arbitrari ctl formula retain algorithm preserv satisfi formula develop normal call separ normal form ctl mechan develop tempor logic repeat describ element requir manipul formula basic idea normal form identifi core oper gener formula relev state subsequ state model transform procedur fixpoint unwind renam order reduc arbitrari formula formula form formula present formula restrict start fi initi ff fi global ff fi global ff global ff global ff fi fl true possibl empti intuit formul global rule repres constraint futur behavior current conjunct initi rule provid initi rule constrain successor state constrain sequenc state longer period oper subsum oper repres sequenc oper indic existenti path quantifi plai crucial role ctl case formula eb deriv formula ea hold path incorpor indic express situat mean hold path label indic import process transform normal form resolut merg formula label ident indic shown indic rule existenti path quantifi case label ident index requir rule appli retain indic note omit indic empti rule arbitrari ctl formula transform provid transform occur analog translat logic transform introduct basic rule structur arbitrari ctl preserv satisfi give transform present base fixpoint basic ctl modal develop transform rule base gener rule fixpoint basic proposit symbol specif rule remov modal note formula produc correct form manipul requir formul remov rule variabl remov remov remov au ag remov eu remov aw remov ew recal applic rule requir label formula index case remov eu occur path occur requir renam formula nest basic ctl modal renam renam present rule rewrit formula type pure classic start true enrich set rule transform normal form classic logic set rule term enrich set transform rule express abbrevi path oper tempor oper tran simplifi proof special case remov rule appli formula type start abbrevi path remov special case start start true rule transform case show transform process preserv satisfi transform transform axiom axiomat system present appendix assum negat anchor start provid transform tran abbrevi rule enrich set classic transform rule previou start start tran start tran start aq tran start renam renam tran tran tran start remov true remov start true start renam aq renam normal form formula repres set formula set rule resolut proof tempor resolut method translat carri tempor statement ctl repres set rule order achiev appli type resolut step resolut tempor resolut step resolut step resolut formula refer moment time formul step resolut rule liter start start start case gener empti hand side resolut rule introduc constant situat rule resolv start start start note indic step resolut rule merg formula label ident indic tempor resolut basic idea invok tempor resolut resolv formula constraint constraint import note occur path kind combin prefix account case path consid formula gener tempor resolut rule note formul rule express abbrevi rule repres loop tre tre tre tre resolv includ formula case path occur outstand note rule tre appli formula structur requir label rule tre formula resolv label index earlier proof loop ctl idea tempor resolut resolv formula actual procedur complex number difficult case formula hidden set formula set rule repres idea simpl resolv tempor resolut involv collect set formula oper impli formula formula order construct loop deriv normal form requir remov oper part transform process normal form case tempor crucial part resolut method process search suitabl set varieti algorithm develop implement element method dixon dixon implement resolut method expect success algorithm case framework merg rule tempor resolut transform transfer deriv local state transform pure classic formula rule mention search loop requir merg formula present repres path quantifi merg existenti formula ident ident label termin step tempor resolut rule repeatedli transform gener resolv normal form reach stage resolv procedur termin rule gener tempor resolut origin set rule start true axiomat formul ctl appendix axiom repres induct principl logic present resolut proof recal anchor negat axiom start provid requir transform normal form give resolut proof repeat set gener rule begin step abbrevi step resolut tempor resolut rule start start aq start true start true true merg tre remov aw remov aw start start start start start start note rule appli give step label formula index step tempor resolut obtain merg formula label index formula step proof aq aim search loop achiev merg formula step express requir loop found loop appli tempor resolut rule tre resolv set formula loop eventu aq resolv rule step path quantifi omit index rest proof formula appli relev remov rule formula step obtain step chain step resolut rule appli proof termin start refut negat axiom unsatisfi correct provid sketch proof complet state sound termin theorem theorem applic resolut procedur gener unsatisfi semant logic theorem resolut procedur termin appli formula proof theorem theorem easili establish theorem resolut procedur gener contradict appli complet resolut system establish reason show theorem axiomat formul logic ctl appendix negat resolut refut resolut formul ctl sound axiomat formul ctl complet relat semant led complet resolut system complet show resolut formul ctl deduct power complet axiomat system lemma axiomat formul logic ctl negat resolut refut proof construct method transform axiomat proof resolut refut proof lemma establish fact induct length proof axiomat system fn sequenc formula proof base mean axiom show axiom refut present part resolut proof axiomat system present appendix assum negat deriv contradict serv tempor resolut procedur part axiom consid refut includ transform negat formula normal form start input start tran start tran start remov remov start tran start tran tran tran start renam renam tre remov aw remov aw start start start start tran start note step repres loop resolv eventu rule repres tre oper step proof termin reach start indic negat axiom satisfi difficult develop resolut proof rest establish statement induct lemma valid proof length resolut proof show lemma valid proof length formula fn definit axiomat case fn axiom fn gener modu ponen infer rule case proof lemma ident base case case gener interest prove lemma case gener appendix fn show resolut refut formula construct resolut refut anchor start refut begin start commenc start transform start desir refut establish reason resolut resolut proof renam set formula lead refut start obtain desir start resolv start start construct resolut refut renam obtain set formula assumpt lead obtain true resolv true ey obtain remov ew simplifi result obtain start applic rule lead start obtain refut conclud proof complet extens clausal resolut method develop tempor logic logic ctl provid conclud remark underlin aspect futur effici implement expect techniqu develop implement tempor extens logic ctl arbitrari combin path tempor oper note implement mention obviou benefit clausal resolut techniqu possibl invok varieti method refin framework classic logic clausal resolut approach logic shown amen effici implement futur expect refin normal form resolut techniqu develop logic ctl crucial point develop algorithm search loop tempor resolut techniqu obtain care extens algorithm develop complex due path quantif case ctl depend expect search existenti loop aspect research formal comparison clausal resolut method tableau automata approach extens ctl extens ctl gener ctl weaken syntact restrict boolean combin tempor retain ctl restrict path ctl system formula formula ctl ctl extend ctl introduc mean mean oper retain syntact restrict ctl extend ctl system lee fair properti enrich boolean combin linear system call recal shown ctl base logic strictli express ctl power system class ctl combin sistla case ctl resolut approach develop ctl extend straightforwardli problem due structur formula admiss due nest linear modal case due arbitrari structur formula path quantifi case ctl ctl intend develop normal form similar ctl expect set resolut rule similar case ctl remov rule construct origin path present path quantifi achiev special label formula label sequenc label express path context resolut rule gener sequenc label formula resolv process match label work similarli unif classic logic feasibl goal power approach gener special languag normal form tempor logic approach justifi shown effect case linear time paper basic logic ctl acknowledg author dixon comment suggest work refer resolut method ctl branch time tempor logic iv intern workshop tempor reason publish page design synthesi skeleton branch time tempor logic workshop logic lectur note comput page sistla automat verif concurr system tempor logic specif acm transact program languag page strategi tempor resolut phd depart comput manchest uk search strategi resolut tempor logic thirteenth intern confer autom page tempor modal logic van handbook theoret comput page elsevi procedur express tempor logic branch time fourteenth acm symposium theori comput page decid full branch time logic inform page modal model branch time logic strike back scienc comput page branch versu linear time tempor logic acm page autom reason reactiv system logic structur versu lectur note comput page resolut method tempor logic twelfth intern joint confer artifici intellig page normal form tempor logic applic execut journal logic page logic foundat artifici intellig morgan kaufmann publish tempor logic program eighteenth symposium foundat comput page present futur oxford press model ration agent intern confer principl knowledg reason page approach linear tempor logic logic structur versu lectur note comput page axiomat system set axiom rule deduct repres complet deduct system relat semant logic ctl follow axiom ctl axiom proposit calculu ep ap true true rule infer ctl modu ponen gener
IR/545 5 exploit synergi ontolog recommend system stuart david de agent multimedia group depart electron comput scienc southampton uk abstract recommend system learn user prefer automat find thing similar interest reduc burden creat explicit queri recommend system suffer problem initi inform earli base recommend semant knowledg provid valuabl domain knowledg user inform acquir knowledg date trivial task user interest difficult acquir maintain paper investig synergi research paper recommend system ontolog inform automat extract web ontolog address recommend system problem recommend system address ontolog problem empir evalu approach conduct perform integr system measur gener term keyword recommend system introduct mass content web import question effect search engin filter web page match explicit peopl find articul difficult result larg list search result hand defeat filter place recommend system learn user prefer time automat find thing similar reduc burden creat explicit queri dynam track user interest chang system requir initi learn phase behaviour inform built form user profil initi learn phase perform poor due lack user problem interest develop tool creat annot content make semant web ontolog maintain provid access specif knowledg repositori sourc complement behavior inform held recommend provid initi knowledg user domain interest bootstrap initi learn phase recommend system problem return bootstrap inform recommend system provid detail dynam user interest ontolog reduc effort involv acquir maintain knowledg peopl research interest end investig integr recommend ontolog academ domain commun practic identifi pick similar user recommend system peopl find articul good recogn insight led util relev feedback peopl rate web page interest interest system find page match posit exampl match neg exampl suffici posit neg modern machin learn techniqu classifi page impress accuraci system call recommend system recommend page base rate peopl page collabor recommend system peopl rate explicitli page recommend page similar user rate highli problem collabor filter direct reward provid exampl peopl lead initi difficulti obtain suffici number rate system permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss author semant web workshop usa copyright author hybrid attempt combin advantag collabor recommend prove popular feedback requir recommend collabor recommend hybrid recommend system paper recommend research paper problem difficult problem commonli face recommend system problem recommend requir item user inform acquir poor perform result deter user recommend system effect recommend achiev good perform user long examin type problem problem initi rate profil user situat recommend system basi perform poorli problem system run set user profil rate inform user recommend system perform poorli situat collabor recommend system fail discov similar user behaviour log behaviour data base correl hybrid recommend system perform exampl user interest order find similar item recommend system cope total recommend requir small number exampl base recommend link recommend system ontolog address problem ontolog provid varieti inform user public public provid import inform interest user provid basi creat initi profil address cold start problem personnel record similar user identifi address problem provid set similar user base profil ontolog ontolog domain format consist axiom ontolog provid rich work domain repres main concept relationship work activ relationship repres isol inform home phone repres activ author attend confer paper term ontolog refer classif structur instanc knowledg base ontolog work design repres academ develop southampton team knowledg technolog model event research interest ontolog implement graphic tool develop system popul inform extract automat personnel public ontolog consist instanc public problem peopl area interest import type knowledg expert finder semant web technolog good sourc requir substanti mainten web page major web page receiv hold inform date quickli interest area dynam natur held web page difficult ontolog acquir problem exist system forc user perform gather numer disadvantag lotu develop system monitor user interact document captur interest system onlin document user paper investig link ontolog recommend system overcom interest acquisit problem recommend system regularli provid ontolog interest profil obtain monitor user web feedback recommend research paper relat work collabor recommend system util user rate recommend item similar peopl phoak collabor recommend web link mention newsgroup articl newsgroup post web link consid avoid problem newer newsgroup messag group len altern recommend newsgroup articl group len report problem analysi user abandon system provid rate receiv recommend earli adopt system receiv poor recommend rate gather system typic collabor make earli recommend poor suffici peopl provid rate recommend system recommend item similar content thing user recommend fab recommend web page fab earli rate user order creat train set recommend fund inform observ user infer posit neg exampl interest behaviour system typic recommend requir user system initi period time problem overcom person agent letizia syskil webert person webwatch track user formul user profil profil construct posit neg exampl obtain explicit feedback heurist behaviour suggest link worth current web page recommend page link similar user profil recommend exampl interest observ elicit user profil construct ontolog improv user navig ontolog order formul queri ontolog automat construct knowledg base web manual label exampl domain concept appli techniqu classifi web page system captur dynam inform user interest relev system similar match search interest research paper digit librari recommend system hybrid recommend address problem recommend research paper research user behaviour monitor proxi log url normal work activ algorithm classifi url base train set label store paper central paper grow build share pool knowledg explicit feedback url form basi interest profil user figur show overview system world wide web profil user classifi recommend classifi paper world wide web profil user classifi recommend classifi paper figur recommend system dai set recommend base correl user interest profil classifi paper topic feedback offer user recommend record user user provid exampl topic correct paper classif wrong train classif improv time base user interest profil ontolog research paper topic infer ontolog assist profil case topic inherit infer interest specif topic share interest profil ontolog difficult explicitli repres ontolog term previou trial initi base interview cope problem link ontolog autom realist solut scale larger number user paper classif algorithm research paper central repres term frequenc vector term singl word term frequenc vector comput count number time word paper dimens vector repres term reduct vector achiev remov common word found stem word porter stem algorithm vector dimens ad paper classifi classifi boost algorithm classifi neighbour type classifi call train ad vector space figur show basic neighbour algorithm close unclassifi vector neighbour vector space determin classif ja jb knn distanc document document vector number term document set ja weight term document ja jb knn distanc document document vector number term document set ja weight term document figur neighbour algorithm classifi neighbour train exampl ad vector space rebuild entir classifi degrad incorrect class return partial relev make neighbour robust choic algorithm task boost work repeatedli run weak learn algorithm distribut train combin classifi produc weak learner singl composit classifi learn algorithm classifi figur show algorithm valu call calcul error calcul calcul class weight distribut iter number class weak learner distribut error iter error adjust iter classifi final boost classifi class classifi argmax log iter result class valu call calcul error calcul calcul class weight distribut iter number class weak learner distribut error iter error adjust iter classifi final boost classifi class classifi argmax log iter result class classifi argmax log iter result class figur boost algorithm shown improv perform weak learner stronger learn algorithm neighbour choic boost classifi user profil algorithm profil algorithm perform correl paper topic classif user log research paper classifi belong accumul interest score topic explicit feedback recommend accumul interest topic current interest topic comput time weight algorithm shown figur instanc interest dai topic interest interest valu paper recommend topic rate interest topic rate interest instanc interest dai topic interest interest valu paper recommend topic rate interest topic rate interest figur profil algorithm hierarchi research paper topic held superclass relationship infer broader topic interest specif topic fraction interest infer level weight refer class tree origin topic figur show section research paper topic ontolog artifici intellig hypermedia interfac agent mobil agent recommend system agent belief network fuzzi game theori genet algorithm genet program knowledg inform filter inform retriev machin learn natur languag neural network philosophi robot speech vision text classif ontolog adapt hypermedia hypertext design industri hypermedia literatur open hypermedia spatial hypertext taxonom hypertext visual web navig architectur figur section research paper topic ontolog recommend algorithm recommend formul correl user current topic interest paper classifi belong topic paper recommend user url ensur recommend top interest topic select recommend made total paper rank order recommend confid present user figur show recommend algorithm recommend confid classif confid topic interest recommend confid classif confid topic interest figur recommend algorithm commun practic identifi system ontolog identifi commun practic commun practic person closest group base specif featur common person commun practic inform group peopl share common interest practic workplac commun practic improv perform maintain implicit spread idea act focu innov drive strategi identifi commun practic essenti step understand knowledg resourc organ bring peopl identifi commun practic flourish provid infrastructur give support recognit commun practic identif process larg base inform natur commun structur hidden tool network analysi support task commun practic identif spread activ algorithm appli crawl ontolog network instanc relationship extract pattern relat entiti relat commun practic crawl limit set ontolog relationship relationship trace find specif attend paper member project commun practic base inform set relationship ontolog made formal relationship hypothesi underli inform relationship infer presenc formal formal author paper share interest advantag ontolog identifi commun tradit inform network relationship select weight reflect rel import relat document authorship project membership select requir identifi commun practic base public project work manual select relationship automat select base frequenc relationship knowledg base select relationship weight process depend ontolog type amount inform type commun practic requir work commun practic experi relationship relev desir commun set rel weight experi relationship select manual weight base prefer trial determin effect select integr technolog investig integr recommend system provid solut problem interest acquisit problem figur show system integr ontolog user interest profil user public user domain knowledg commun practic ontolog user interest profil user public user domain knowledg commun practic figur ontolog recommend system integr ontolog recommend system initi set public regist user user public correl recommend system classifi paper set histor interest compil user histor interest form basi initi overcom problem figur detail initi profil algorithm profil fraction interest topic infer specif topic ad public belong class public topic initi profil topic public belong class public topic initi profil topic figur initi profil algorithm recommend system run user ontolog histor public list user system rank list similar user initi profil user form correl histor public similar user profil algorithm detail figur address problem research paper topic user weight constant similar number similar user pub number public belong class cop confid commun practic confid topic pub public pub public similar profil similar profil interest user topic cop confid initi profil topic figur initi profil algorithm task popul maintain ontolog user research interest left recommend system recommend system compil user profil daili profil assert ontolog readi figur detail structur profil interest provid solut interest acquisit problem interest data alongsid static inform ontolog improv accuraci system user profil topic research topic interest interest figur daili profil ontolog system oper recommend system retriev list peopl public url ontolog public classifi research topic hierarchi ontolog paper topic date initi profil algorithm comput set initi profil user tabl show user nigel shadbolt public set topic date formul initi profil algorithm comput interest valu topic acquisit public year public list shadbolt public date topic captur knowledg user ontolog recommend system recommend system knowledg technolog knowledg technolog ontolog knowledg acquisit ontolog certifi commonkad provid support evid fit knowledg manag extract knowledg semant web knowledg acquisit knowledg engin manag knowledg manag profil shadbolt topic interest knowledg manag knowledg system knowledg acquisit run user regist email address identifi email account stuart phd candid return rank commun list displai tabl commun list identifi relat confer research project weight de found closest person joint public shadbolt peopl valu de attend confer tabl result person relev person relev shadbolt beal commun list search match user profil profil accur date initi creat profil base public manag find profil tabl log tabl profil similar peopl person topic interest system system agent system knowledg devic beal agent knowledg knowledg cop knowledg manag shadbolt system profil merg creat profil initi profil algorithm public system year shadbolt interest system topic tabl show result profil tabl profil topic interest system agent system knowledg knowledg devic knowledg manag knowledg cop dai profil updat automat fed back popul research interest relationship relev peopl empir evalu order evalu effect initi profil algorithm integr conduct experi base behaviour log obtain user trial algorithm previou averag perform user calcul approach user select trial entri public select user user typic public url log extract month behaviour record broken weekli log entri week behaviour start empti log creat simul start trial iter integr system simul start trial simul week interest profil record iter complet run initi profil algorithm control run initi profil algorithm start blank profil user addit iter run evalu effect initi profil algorithm commun practic base data week initi profil algorithm comput initi profil user enter system end trial profil record earli prototyp version commun practic confid valu confid valu experi order evalu algorithm effect compar record profil benchmark week profil measur quickli profil converg stabl state exist reason amount behaviour data accumul quicker profil move state quicker overcom week chosen point analysi week behaviour data gather domin user profil effect bootstrap point run system week simpli profil continu adjust behaviour log week result measur compar profil benchmark week profil profil measur topic mention current profil benchmark profil profil indic quickli profil converg final quickli effect overcom profil error measur topic current profil benchmark profil profil error rate indic error introduc bootstrap algorithm figur describ metric note measur absolut error rate profil rel error rate compar week steadi state profil measur absolut profil accuraci subject attempt interest quickli profil reach steadi state complet evalu profil recommend perform found correct number user topic current profil benchmark profil miss number user topic benchmark profil current profil incorrect number user topic current profil benchmark profil user total number user profil error rate correct incorrect miss incorrect profil correct miss correct user user user user user user correct number user topic current profil benchmark profil miss number user topic benchmark profil current profil incorrect number user topic current profil benchmark profil user total number user profil error rate correct incorrect miss incorrect correct incorrect miss incorrect profil correct miss correct correct miss correct correct miss correct user user user user user user user user figur evalu metric result run detail figur result consist singl graph singl point week behaviour log data system profil bootstrap empti bootstrap initi user profil achiev reason low error rate found profil accur captur interest user year tend miss current interest public gener interest weekli behaviour log system profil adjust move initi bootstrap week profil converg benchmark profil algorithm result show dramat price error rate profil produc algorithm tend set similar user interest produc union interest captur user real includ larg number interest relev user interest peopl similar user profil rel benchmark profil week boot trap bootstrap boot trap figur profil profil error rate rel benchmark profil week error rate bootstrap bootstrap bootstrap figur profil error rate error rate measur rel final benchmark profil week topic behaviour log present benchmark profil incorrect topic sourc case bootstrap week error rate constant incorrect topic introduc week remain subsequ week discuss recommend system interest acquisit ontolog problem initi recommend user confid recommend system drop result usag data gather overcom interest gener period updat inform sourc web person record public integr recommend ontolog system demonstr approach reduc problem practic work suggest ontolog bootstrap user profil significantli reduc impact recommend system problem altern start inform regularli feed recommend system interest profil back ontolog assist acquisit interest number issu arisen integr algorithm produc profil low error rate reason reflect previou public good indic user current produc good start point bootstrap profil algorithm fail recent make remain topic final benchmark profil discov recent algorithm extend inform ontolog project user work relationship difficult predict ontolog great difficulti acquir knowledg recent interest select user entri public user enter public publish work user inform make initi profil larger scale sourc inform ontolog build profil improv robust realist situat inform commun practic user found relev base select relationship weight dave de stuart dave lot student interest mobil agent topic relev question relev relationship weight relationship experi identifi relev set commun practic identif accuraci commun practic link accuraci research interest inform identifi recommend system algorithm achiev good error rate commun practic gener user algorithm includ interest similar user improv interest held major peopl commun practic exclud common interest includ profil initi profil algorithm defin constant determin proport previou public similar user factor avail relationship data ontolog qualiti public affect choic empir evalu determin issu calcul topic hierarchi make simplifi assumpt link equal exact relev depend topic question individu weight method determin weight consid altern hierarchi carefulli construct ensur equal semant distanc posit feedback loop exist recommend system make data potenti problem user initi interest entri user profil recommend system commun practic initi loop exist interest calcul question remain good initi profil fulli overcom effect problem initi recommend poor user recommend system chanc improv shown improv made initi empir evalu evalu improv system user give chanc futur work step integr system continu improv set relationship weight calcul commun find select initi profil algorithm commun practic bootstrap error rate fall substanti conduct set user trial assess user integr reveal improv initi profil affect system usag pattern recommend system extend explor idea ontolog repres user profil trial full academ year evalu call recommend system acknowledg work fund epsrc award number project refer learn machin method tool identifi commun intellig inform process ifip world comput congress al statist mechan complex network review modern collabor commun acm volum facilit onlin expert nasa expert seeker intern confer practic aspect knowledg manag cl autonom web agent automat retriev identif interest intern confer autonom minneapoli brown social life inform harvard school press nigam learn extract symbol knowledg world wide nation confer artifici intellig develop evalu cluster techniqu find peopl intern confer practic aspect knowledg manag automat gener ontolog editor workshop knowledg manag canada experi boost thirteenth intern confer machin ontolog knowledg terminolog clarif larg knowledg knowledg build share io access ieee intellig vol appli collabor filter usenet commun acm volum agent assist web intern joint confer artifici august locat lotu discoveri white point activ collabor human factor comput de nr captur knowledg user ontolog recommend intern confer knowledg captur oct bc canada person implement technic report depart intellig buckingham muramatsu syskil identifi interest web nation confer artifici algorithm suffix program juli pp recommend commun jj relev feedback inform smart retriev system experi automat document englewood prentic pp learn recommend posit intellig user interfac acm pp system share commun acm volum commun organiz frontier harvard busi review commun kei knowledg strategi knowledg journal institut knowledg
ML/546 6 chapter data mine interfac comput scienc statist smyth inform comput scienc irvin ca abstract chapter written comput scientist gain understand role statist modern data mine data mine attract attent research commerci arena recent involv applic varieti techniqu comput scienc statist chapter discuss comput scientist statistician approach data complementari viewpoint highlight fundament differ statist comput view data mine review histor import statist contribut machin learn data includ neural graphic flexibl predict model primari closer integr comput method statist increasingli import data mine applic data pattern transact correl introduct goal chapter explor potenti futur relationship statist data argu invit data mine scientif engin statist plai foundat role data mine endeavor target audienc chapter intend comput scientist knowledg algorithm aspect data mine learn statist idea concept work chapter provid pointer reader term varieti context data analysi recent year reader book data mine comput scienc broad set techniqu algorithm extract pattern model larg data set earli broad surg research activ larg driven massiv search pattern data associ busi applic analysi larg transact data archiv evidenc data mine text publish data mine research current work data mine algorithm issu comput effici data engin issu data import topic statist conspicu absenc data mine text paper natur consequ fact research data mine larg practic comput scientist natur focu algorithm comput issu statist issu chapter explor interplai comput scienc statist develop data mine data mine data mine practic substanti convent appli publish commerci applic data case studi present heavi relianc techniqu lineag appli statist tree singl model techniqu commerci predict data mine applic popular abil deal heterogen data type easili handl categor find parsimoni predictor problem techniqu popular data mine root appli nearest neighbor data mine interfac comput scienc statist naiv logist regress mixtur model cluster segment arguabl associ rule main associ rule techniqu clear statist literatur debat success applic data mine reli associ rule success annual confer sigkdd sigmod interest techniqu mainstream convent current data mine softwar tool applic applic develop heavi relianc applic tradit statist idea statistician argu data mine scale convent statist method massiv data effect effort truth accur reflect state affair data mine comput introduc number idea gener realm data idea distinct prior work statist identifi contribut arisen primarili work comput scienc machin neural convent flexibl predict model earli work tree neural network recent techniqu combin histori comput scientist introduc techniqu predict classif problem techniqu start strong algorithm foundat weaker formal statist justif past year machin learn data mine recur pattern flexibl model algorithm appli comput scientist boost framework freund schapir support statist theori date statist justif boost provid tibshirani hidden variabl model cluster predict problem hidden markov model excel complex data speech signal simpl hidden state adequ classif predict applic em framework train hidden variabl model hmm appeal comput scientist couch algorithm basi led widespread adopt comput scientist varieti applic collabor heckerman find pattern global model exampl algorithm includ associ rule algorithm sequenti associ algorithm rule induct algorithm contrast set algorithm algorithm differ convent statist model attempt observ focu manner pocket inform engin data engin aspect scale tradit algorithm handl massiv data set work area involv approach techniqu worth mention context fact research varieti area natur languag human genom develop varieti practic learn algorithm deal massiv data analyz heterogen structur data multimedia data web text document research comput scienc learn algorithm improv understand structur web learn topic categori automat extract document import statist plai major role area larg extent statistician lead charg comput scientist engin adapt statist method problem opportun gener distinct data mine statist data mine typic practic concern observ retrospect data data mine interfac comput scienc statist record transact record bank account issu design construct experi collect data test specif typic vocabulari data miner gener discuss statist aspect data mine view data mine view data mine reduc gener data mine algorithm compon part viewpoint necessarili nonetheless provid insight independ compon make data mine algorithm discuss breakdown data mine process involv numer addit step data data discuss detail identifi primari compon data mine algorithm data mine task fall gener exploratori data analysi visual pattern search associ rule descript model cluster densiti predict model classif perfect categor common data mine task import point task identifi explicitli data mine natur task directli influenc compon model specif structur form seek data descript task structur paramount predict task exact natur structur secondari import compar predict power model exampl gener structur includ gaussian associ linear regress model regress problem input variabl target variabl simpl linear ff ff ff random addit case model structur plane space noisi observ distribut plane specif model consist specif plane parametr ff ff ff unknown paramet structur structur form effect limit view data view rel structur common multipl type structur tree logist regress model classif data structur assum true mechan model famili model structur repres conveni approxim unknown realiti score speak evalu qualiti fit model pattern basi observ squar error classif error score function link model structur observ data form score function highli depend natur data mine task undertaken typic defin function unknown paramet model observ data set practic customari score function small set easili analyz function squar error predict ff ff ff ff ith train view score function function unknown ff paramet seek minim observ data fact free complet gener score function reflect actual loss incur practic gener loss matrix classif simpli count error note score function evalu train data search good valid test data set search good model set fit potenti paramet fit train data data mine interfac comput scienc statist optim score model observ data problem defin data mine algorithm reduc defin comput procedur find score function minim squar paramet space model space model complex vari multipl model form case problem solv close form find ff minim regress problem solv linear algebra determin probabl naiv classifi carri simpli count rel frequenc event case score function complic surfac function multipl extrema mind paramet score function scalar function defin case find global score function problem resort form heurist greedi search space gradient descent multipl random restart space neural network compon heart actual data mine algorithm import awar clever optim algorithm fit model model score task base attent paid fact question data discuss statist data manag actual final step concern implement specif mechan data manag research paper explicit data manag strategi exist machin learn statist learn algorithm assum data read main memori resid flat file data miner awar data manag extrem import practic applic involv larg data set algorithm priori algorithm associ rule make data manag compon explicit descript algorithm multipl linear scan work exist framework compon literatur test emb explicit data manag framework effici data access prioriti exampl approach includ boat framework effici tree fit massiv data set gener data structur moor colleagu effici data access cach varieti learn algorithm framework simpl systemat languag understand make data mine algorithm typic model guid concept appli mathemat score function driven gener principl statist infer connect abstract model actual observ optim data manag compon heavili algorithm natur describ data mine algorithm framework understand primari contribut compon specif algorithm provid refer framework systemat compar algorithm data mine algorithm base regress tree neural network differ primarili term model structur constant function versu combin weight sum term optim carri variabl structur search versu gradient descent continu similarli gener techniqu genet algorithm view belong optim compon data mine view algorithm model natur genet optim framework restrict model structur model typic defin primari role genet algorithm provid search strategi contrast tradit local search method decoupl model structur compon compon mix match model structur optim techniqu manner data miner typic place emphasi statistician primari comput compon data statistician typic place emphasi model data mine interfac comput scienc statist score function compon comput aspect model fit exampl typic research paper field journal data mine knowledg discoveri journal american statist repres extrem end spectrum issu nonetheless spectrum data mine statist differ commun comfort comput scientist grow basic diet algorithm data statistician grow basic diet mathemat model principl statist infer aspect plai import role data mine model transact data briefli problem analyz transact data gener framework outlin previou section associ rule techniqu data mine analyz primarili intend task pattern discoveri secondari associ cluster underli associ rule set statement form probabl binari proposit emphasi associ rule algorithm natur task model search data manag aspect algorithm essenc idea fast count systemat search find set associ rule constrain paper associ rule algorithm tend comput effici algorithm effici search data manag interpret evalu rule set obtain associ rule algorithm good reflect view data problem find associ rule satisfi confid support threshold view gener form queri contrast sharpli statist place emphasi question research place emphasi question larg data set viewpoint thought equal valid import transact statist model probabilist model made arriv individu shopper store model poisson distribut constant arriv rate shopper individu poisson rate extens vari season manner condit event arriv shopper choic specif item item model independ multinomi sampl distribut item basket multinomi size distribut model distribut paramet individu constrain manner small number item specif categori model individu pattern brand type model fact market literatur semin paper recent model inevit built condit assumpt assum independ item store visit approach nonetheless power systemat framework hypothesi cluster custom forecast numer practic gener discuss gener model cluster contrast associ rule statist approach model transact data strongli construct suitabl emphasi comput aspect model fit data differ approach fact associ rule pattern statist model construct global model data set search pattern advantag primari goal construct global model difficult unreason main point compar statist associ rule approach transact data statist model provid flexibl gener languag model aspect tempor incorpor natur systemat manner statist techniqu view provid complementari set tool data mine techniqu associ rule statist approach base data mine interfac comput scienc statist model assumpt hold practic associ rule constraint assum function form process role statist educ data mine order fundament role statist data data miner minim exposur statist concept learn set specif detail model import gener statist explicit recognit uncertainti broad data analysi context comput scientist engin engag data mine limit exposur statist idea undergradu curriculum engin receiv statist educ comput scientist statist concept wide modern engin comput scienc tend leav room introduct statist graduat exposur statist consist larg class hypothesi test elabor fundament import ingredi miss statist educ typic data model ingredi statist mathemat probabilist languag construct explicit model observ data gener model transact data constant arriv rate shopper arriv poisson multinomi choic model item choic type basic build block statist model construct complex model simpler function form term mathemat model basi determin model structur compon algorithm model inform prior knowledg problem wide standard introductori text form stochast model provid readabl introduct broad rang model method appli multivari topic relev data mine excel text special text specif class model spatial model infer primari ingredi foundat reason observ data make infer model structur infer construct specif score function gener statist gener desir properti score function score function gener data score function connect model observ data understand principl infer requir foundat basic principl mathemat paramet suffici argu excess emphasi mathemat formal product context practic data concept method essenti data miner equip penetr research public text statist minim knowledg basic concept requir data miner access rich foundat idea data analysi statist commun provid ag continu reader interest embark readabl introduct mathemat statist text wide academ mathemat statist includ practic art educ compon provid raw mathemat tool compon art craft analyt model tool appli practic subtl issu fair statistician undergradu educ tend acquir year experi level level abil construct analyt model problem model rate arriv custom site predict rate custom bui product data mine interfac comput scienc statist function demograph typic access basic function form model case model form logist log ff ff demograph variabl ff paramet logist model estim data fair basic educ ingredi difficult learn abil successfulli build complex model basic function form decept gloss statist provid guidanc type model prefer applic notabl except import realiz statist analysi predic assum model data gener model techniqu tree reli function nonetheless implicit assumpt assum order individu observ present irrelev point view model aspect abil problem obtain insight method work improv techniqu obviou techniqu appli situat techniqu statist model find limit predict error plot analyz function specif input variabl evid systemat depend larger error larger valu suggest model improv statistician reli varieti diagnost techniqu provid insight feedback iter data data mine practic appli substanti room improv develop tool techniqu user interact data model iter manner ideal world prefer treat data mine algorithm action user limit tweak algorithm paramet search option explor interact data model directli success stori interfac differ typic comput scientist view data typic statistician view data numer exampl comput interfac common recur pattern research essenti idea carri independ statist comput set idea subsequ integr form richer broader framework discuss briefli recent exampl pattern gener context machin learn data earli work neural network larg properti biolog plausibl model detail train algorithm broader statist view neural network highli flexibl regress model gradual began neural network commun member statist commun interest form regress model link establish statist idea gener linear model project pursuit regress led model algorithm statist neural network research model effici multivari distribut time area genet late gener framework develop independ statist acycl direct graphic model framework larg belief network framework pioneer pearl comput scienc year substanti research activ area learn model directli data recent work learn graphic model excel comput scienc effici algorithm comput data mine interfac comput scienc statist infer coupl gener principl paramet structur estim data latent variabl model long histori statist work topic comput scienc broad impact year varieti hidden markov model speech latent variabl model languag text cluster neural network hidden variabl em inher comput concept motiv fundament principl statist plai pivot role comput scienc engin applic tree origin develop appli statist receiv attent statist public pioneer work cart quinlan independ popular tree machin learn famili algorithm cart approach share common result similar algorithm statist work tree typic paramet estim tree select aspect recent work tree data mine data manag issu tree cornerston toolbox data minor variant tree common origin idea research boost algorithm class techniqu iter construct complex predict model combin simpler model boost origin framework comput learn theori machin learn concern theoret learn algorithm comput learn theori differ aspect learn model contrast typic learn model subsequ empir work reveal boost theoret provid practic tool improv gener perform wide varieti predict model statistician began interest result power algorithm gener statist theori explain method work point exampl show long success tradit techniqu develop independ comput scienc statist natur comput scienc younger disciplin field statist broader scope context learn larg area data analysi repeat data mine machin learn appreci impact area comput approach learn ad concept data analysi unrel statist vapnik theori gener base margin subsequ develop support vector machin base theori view distinct convent statist build predict model field nonetheless common data mine harvest idea interfac dark side interfac chapter data mine statist complet refer origin term statist statistician area term data mine perspect comput scientist familiar histor statist term describ comput search techniqu overfit data set uncov pattern spuriou origin term gener neg connot quot data occur set data infer model select data possibl satisfactori result simpli due chanc merit inher method yield result variabl select regress classic data mine context occur variabl select regress appli small train data set data holdout test data mine interfac comput scienc statist fit simpl linear regress model form ff ff ff variabl ff paramet addit variabl set variabl problem find pair variabl set pair set variabl judg minimum squar error similar score model predict observ ae empir linear correl coeffici model predict actual observ ae oe oe target train data point model predict base set input oe oe standard deviat target valu predict ae close high posit linear ae close correl problem find highest posit arg max ij ae ij correl linear predictor variabl comput viewpoint search pair interest search problem systemat search strategi ignor detail search effect size total number variabl chanc select pair variabl predict fact good case pair variabl predict power predict essenti random jx data analyst believ depend fit predict model nonetheless data miner work data set awar encount applic predictor variabl virtual predict power context data problem li fact ae ij vari pair vari data sampl data sampl maximum empir observ ae ij random quantiti data set true expect data set individu ae ij model predict power expect empir observ maximum set ae ij posit optimist size set number candid variabl expect maximum tend find regress real predict power exist specif problem spuriou correl receiv attent field social scienc econometr relat version exist multipl data set deriv set set featur deriv imagin featur predict power sequenti fit model perform model select set gradual chanc accept model good predict fact model select valid data set current data miner awar sort problem valid data set crossvalid techniqu wide data mine provid accur estim model true gener capabl similar problem independ train valid data set simpl binari classif binari input variabl singl binari class variabl train varieti classif model mm support vector naiv kind variat featur combin data mine statist packag make easi train model natur model freedom tend fit train data classif error train data good guid model perform data data mine applic fortun larg data set easi separ valid data set model data mine interfac comput scienc statist select estim classif error model valid select model lowest error rate min minf model futur predict assum predict power input random predict classifi variabl error rate class equal error rate error rate set input variabl note min random quantiti data set vari min pair data set set classifi typic significantli depend model data point classifi simpli ad column predict valu valid data set column independ base model built train approxim thought independ true underli relationship input class variabl random imagin sort observ class valu valid data set subset subset subset mind train classifi black box randomli produc equal valid error rate model simpli number produc subset number produc subset divid total number row essenti view version binomi random toss coin time count occurr locat law larg number error rate column closer true mind finit amount data fact select column minimum empir error rate minimum error rate tend optimist expect neg bia repeat experi function number model extrem case larg find model valid error true error rate model practic input predict power valid estim optimist defin minimum set random quantiti point valid data holdout data provid provid guidanc perform train data element chanc variabl nonetheless present imagin data mine algorithm present random data exampl imagin happen standard associ rule algorithm run data item gener independ rule relat item exact number rule found strength depend item transact gener effect pure random effect massiv search find spuriou associ note hypothesi test techniqu guard repeat applic multipl hypothesi test massiv scale eventu lead accept massiv search massiv systemat search root fundament inabl distinguish pure real structur data practic real structur exist deal random tend domin random nonetheless gener point search techniqu theori data miner troubl wise data miner awar risk convei similar note caution user busi person scientist data mine algorithm fashion data miner awar fundament statist aspect infer data data mine algorithm substitut statist common chapter argu statist algorithm issu import context data mine substanti histori success research interfac comput scienc fact comput scientist statistician substanti term data data miner messag statist essenti valuabl compon data mine futur success data mine depend critic refer abil integr techniqu model infer statist mainstream data mine practic acknowledg author gratefulli acknowledg valuabl feedback earlier draft chapter tom dietterich greg anonym review work support part nation scienc foundat grant note note statist specif deriv broader reader familiar usag replac refer mine associ set item massiv acm sigmod intern confer manag acm deriv theori mean factor analysi tom swift electr factor analysi american empir comparison vote classif machin detect chang categor mine contrast acm intern confer knowledg discoveri data acm markovian model sequenti neural comput master data art scienc custom relationship john wilei son mathemat basic idea select san neural network pattern clarendon press scale em larg technic report microsoft wa classif regress wadsworth statist press gener probabilist framework cluster acm seventh intern confer knowledg discoveri data acm probabl function complex advanc appli statist wadsworth brook problem chapman hall neural review statist statist appli principl chapman hall mine data sixth intern confer knowledg discoveri data pp acm press du squash flat file acm intern confer knowledg discoveri data acm analysi latent structur model latent statist neural network advanc jw kai dm titterington oxford refer behavior public opinion statist perspect knowledg discoveri advanc knowledg discoveri data mit pp everitt dunn appli multivari data john wilei son gener learn applic journal comput system greedi function gradient boost technic statist stanford bump hunt statist addit logist statist view annal tree construct sigmod confer acm neural network neural smyth statist infer data commun smyth statist theme lesson data journal data mine knowledg model bui statist soc statist statist soc hand data american principl data mit forthcom tutori learn bayesian report microsoft wa depend network densiti collabor data technic report microsoft wa dynam oxford press sejnowski foundat neural mit press probabilist latent sigir introduct mathemat ed macmillan statist perspect data futur gener comput knowledg discoveri induct random knowledg discoveri menlo aaai multipl comparison induct machin person commun hierarch mixtur expert em neural learn graphic mit press authorit sourc hyperlink proc symp discret mathemat chapman hall refer person commun statist massiv preprint local comput graphic structur applic expert system roi statist soc specif ad hoc infer john wilei inform retriev latent semant inform data review econom discov frequent episod intern confer knowledg discoveri data menlo aaai subset select chapman hall cach suffici statist autom discoveri data mine massiv data onlin white depart comput carnegi mellon juli cach suffici statist effici machin learn larg data journal artifici intellig problem analysi survei data stat probabilist infer intellig network plausibl san morgan kaufmann survei method scale induct journal data mine knowledg gener product rule tenth intern joint confer artifici san morgan program machin san morgan kaufmann predict era massiv data statist model data neural network relat method classif statist soc pattern recognit neural cambridg press introduct probabl san academ press parallel distribut explor microstructur cognit volum mit press compar pitfal avoid recommend data mine knowledg advanc kernel mit press data procedur survei american approach rule induct ieee transact knowledg data data data analysi grand statist method medic data technic trade rule journal statist learn springer verlag autom discoveri clinic confer medic volum witten moffat bell manag compress index document imag san morgan refer market conceptu methodolog kluwer academ publish realiti check data forthcom data cluster algorithm journal data mine knowledg
Agents/547 1 robust cryptograph protocol mobil agent protect volker roth fraunhof institut für datenverarbeitung germani abstract mobil agent secur young disciplin focu time write invent cryptograph protocol secur aspect mobil agent past experi show protocol flaw protocol remain unnot long period time game break fix protocol evolutionari process lead understand underli problem ultim robust secur system work publish break protocol mobil multitud protocol turn opposit true identifi flaw protocol corradi karjoth karnik includ protocol base secur mobil agent break secur protocol introduct analyz cryptograph protocol mobil agent protect mean meet friend foe anderson summar rule principl good bad practic design cryptograph protocol show paper advic design cryptograph protocol meant protect mobil agent attack malici host summar typic object protocol object mobil agent reveal trust host object agent protect acquir data host tamper data detect owner possibl host gener object protect featur mobil agent malici host host owner trust protocol address object address protocol target protect mobil agent mobil agent free respect hop dynam base data acquir execut protocol host attack oracl gener protocol data enabl attack cryptograph protocol case lead complet secur object case adversari forg replac subset protocol data make imposs owner detect tamper import observ protocol data acquir agent truncat author acknowledg attack control data return agent alic adversari ev bob fig basic scheme attack mount protocol triangl denot agent triangl shade grai denot agent creat adversari ev attack mount analyz protocol interleav attack imperson decept involv select combin inform previou simultan ongo protocol execut includ origin protocol execut adversari figur illustr gener scheme adversari receiv copi protocol data back agent agent protocol failur write encrypt ciphertext symbol kei digit signatur written encrypt privat sign kei write refer bare signatur union signatur sign data assum ident signer extract signatur cryptograph hash input written note assum resist resist impli resist send messag write write confidenti channel concaten written refer entiti ev ev plai role alic plai role victim bob dave plai role addit entiti part protocol itinerari agent written alic host visit agent decrypt target state karnik tripathi target state mean protect confidenti data carri agent idea make data agent host trust respect data confidenti agent host order achiev encrypt public kei trust host target state target state sign origin agent target state receiv host inspect target state ciphertext decrypt host decrypt privat decrypt make agent illustr attack protocol loss assum target state singl encrypt public kei bob alic send agent ev hop bob return alic protocol start assum agent initi consist target state program attack straightforward ev strip copi target state agent sign target send agent bob innoc decrypt target state privat kei make result agent agent migrat back ev carri ev possess alic detect attack problem protocol due lack redund bob oracl alic includ identifi agent altern program uniqu agent design carefulli illustr mean malici state forg append addit target karnik tripathi append idea protect object agent object ad subsequ modif object detect owner protocol reli encrypt initi comput alic base random nonc nonc secret verif protocol return append defin object append append checksum updat ev cut past target state back agent alic share program origin protocol signatur ident server append assum ident extract signatur append redund signer append object host append oper place alic success decrypt extract verifi signatur object checksum equal initi nonc assum ev receiv agent cj ev collud server agent visit part loop itinerari ev discov checksum cj ev multipl choic truncat object grow fake stem agent add replac arbitrari object ml host order ev creat agent object add append checksum cj initi ev send agent bob agent insert target state migrat ev decrypt checksum privat public kei construct agent agent replac previou agent process repeat checksum ev agent bob detect cj publicli verifi encrypt public bob length estim number object append ev make bob reason suspici add sign object send bob long object properli sign matter sign lack redund ev host time sign checksum comput decrypt forg protocol stefanelli protocol call append present karnik tripathi fall prei type attack fake agent hop complet attack summar protocol agent π static code initi applic protocol data inform requir alic initi agent protocol requir nonc γ messag authent code µ initi valu chosen randomli agent add data applic protect host protocol protocol defin pn mn mn messag authent code serv chain relat bind result obtain agent obtain current host ident hop due chain attack execut append result star shape itinerari ev center obviou protocol data ev plan ahead step assum ev receiv agent obtain collud host result loop itinerari due chain relat rememb comput ij ev free choic free choic subsequ target append offer ev ij ij mj ij mj ij ij ev send agent ij insert mj chosen hop insert random data discard return ev ev updat agent shown data acquir mj ij complet round ev plan move fix previou order send agent ev mj suffici comput ev continu agent send resum normal execut underli weak multi hop protocol server oracl digit signatur assur intend recipi sign data famili protocol publish famili protocol direct preserv integr confidenti data acquir agent gener scenario comparison shop agent visit number collect offer idea protocol preserv integr collect offer protocol address confidenti offer publicli verifi chain digit signatur publicli verifi chain digit signatur protocol defin mn cn dummi rn random salt make harder attack encrypt cn call chain relat deduc ident signer signatur pp signer deem owner agent author explicitli mention conclud owner agent secur protocol reli assumpt attack chang element mn chain reason attack oblig attack build complet chain agent remov chain element entri contrast honest prefix properti introduc yee pp import observ input previou chain relat assum ev receiv agent alic ev pick choic note free choic ij ev collect offer origin shop ij chosen order maintain chain valid ev ij ij ev throw increment pick chain relat encapsul offer build agent request offer agent bear signatur ev repeat process discret final satisfi collect encapsul offer past send agent alic fool forward agent sign charad carri hop ev stop attack hop stress problem ev truncat offer grow fake stem possibl acknowledg fact problem shop oracl gener offer term ev alic remark hold sect alic blue red shirt prefer blue find ev shop offer blue agent red offer made agent return alic chain digit signatur forward privaci protocol chain digit signatur protocol forward privaci variat protocol discuss sect order encrypt signatur comput swap goal arrang hide ident shop provid offer integr assur protocol defin mn cn cn problem resolv shop owner agent offer encrypt shop extract ident alic signatur dummi offer hidden author leav specul descript suffici detail point ident verifi easili signatur public kei certif ident bind assur certif public kei encrypt data assum ev receiv ev previou attack smallest number ev ij ev host agent case ev collect arbitrari sign offer agent includ offer ij cut chain append start fresh collect ij remain arbitrari order gener random nonc build chain relat consecut data chain relat comput ident entiti ev hand agent alic decid agent remain carri offer shop worth note integr assur protocol reli secreci associ mj ident shop sign offer mj mean privaci offer featur requir secreci itinerari requir truncat protocol data import abil set term offer return alic publicli verifi chain signatur protocol publicli verifi chain signatur protocol kei aspect protocol shop gener temporari asymmetr kei pair fly mean successor public kei certifi shop gener kei pair shop privat kei receiv predecessor sign partial chain public kei successor privat kei destroi subsequ temporari kei pair gener protocol χ mn cn oracl oracl protocol initi alic easi ev collect valid certifi temporari kei pair simpli dispatch agent promptli return ev transport bob send temporari privat kei χ certifi public kei assum ev receiv agent smallest number ev χ receiv ij exist ev cut encapsul offer collect kei pair shop fake includ shop start append arbitrari build protocol data consecut ident ev final chain relat entiti hand agent instanc alic protocol secur karjoth trust secur mean protect mobil agent distribut marketplac set equal sect except shop trust hardwar tn issu certifi central market author ℜ market author act trust parti merchant custom channel shop devic secur activ attack devic asymmetr kei capabl comput suitabl asymmetr symmetr messag digest devic public kei market authent public kei devic begin alic random set protocol continu tn ℜ tn mn tn mn final protocol shop send alic agent final encrypt alic decrypt verifi checksum consecut decrypt final verifi signatur assum ev run shop electron impli devic certifi market author ev receiv agent ev ev number encrypt equal number decrypt devic secret fact ev encrypt shuffl checksum begin initi checksum alic expect receiv match agent ev encrypt final checksum devic ev pass place devic expect receiv sign tn substitut offer devic extract secret kei encrypt public kei devic encrypt sign offer sign offer checksum pass back alic agent tn mn oracl comput ev pass public kei devic ev back devic tn leak result set sign offer mj encrypt secret kei ev construct valid return alic indistinguish ordinari run agent ev collect sign offer agent collect bob ev send offer tn ℜ offer tn mb offer encrypt devic return offer encrypt offer prepar ev attack checksum ev append offer collect agent attack simpler ev pass public kei devic devic hand agent case pass public kei return agent alic ev delet rearrang offer brought insert forg offer collect posit chain result mean protocol achiev forward integr claim author fact secur protocol fail softwar approach succe instanc chain mac protocol lesson learn hardwar improv secur order prevent attack final encrypt devic verifi data input sign offer constitut signatur random data provid type driver api suffici driver softwar tamper raw hardwar authent argu mutual authent host agent inhibit attack closer turn protocol discuss profit protocol remain vulner target state profit obviou reason defin crucial checksum cn make imposs hop verifi intermedi target state ev arrang target state attack point hop verifi sender agent insert element protocol benefit authent ev sign element replac element complet attack suspicion ev touch encrypt offer hand agent shop pass agent return hop back alic protocol sect obscur encrypt protocol data pass hop hook improv secur verifi protocol data authent result protocol host exploit oracl authent result connect protocol modifi leav protocol protocol import properti data ad host reliabl reproduc mean oracl exploit protocol build strong backward chain includ signatur previou host host verifi chain back start element signer authent previou hop agent make imposs ev hide trace launch attack sweep multipl round attack start posit exist end fake hand agent pass combin authent signatur check problem repeatedli occur protocol legitim host malici host oracl comput protocol data behalf adversari flaw author protocol advic needham anderson sign decrypt oracl mobil agent system vulner type attack meant work human expect happen order valid author process agent cryptograph protocol agent server agent owner mean decid protocol data agent request process belong agent bring rule good ident princip essenti mean mention explicitli protocol involv sign mean authent protocol data sign data type recipi ident host certifi temporari kei authent attribut includ ident previou hop case ev simpli send agent hop ident certifi back due unfortun choic alic fulli verifi chain data protocol data collect entiti valid entiti ident protocol data agent instanc attack agent instanc entiti mobil agent period time hard anticip difficult notion protocol cope multipl agent run concurr agent owner legitim host distinguish protocol run agent instanc constitut protocol run digit signatur code suffici distinguish agent instanc lead import digit sign mobil code suffici assert agent ownership approach favor contemporari mobil agent system signatur code copi code code written agent instanc render agent protocol distinct desir sign credenti code base code adversari potenti valid agent program agent program code base conjunct credenti refer code base owner agent sign static includ code redund distinguish instanc agent cryptograph hash signatur serv uniqu protocol data bound mean digit signatur agent develop awar fact migrat agent malici virtu state assum mobil agent properli repres intent subsequ hop state function program state program host visit attempt protect agent interleav attack futil code carefulli leak confidenti enter negoti base paramet store mutabl state acknowledg paper extend version discuss measur omit karjoth comment initi improv inspir discuss evolv commentari anonym review led improv extens refer anderson comput scienc vol lectur note comput pp springer abadi engin practic cryptograph src research report digit equip june karnik mobil agent technic report mn agent protect internet annual intern comput softwar applic confer pp comput result intern workshop mobil agent rothermel vol lectur note comput pp berlin springer septemb mobil merchant broker distribut proc kotz vol lectur note comput pp berlin springer van handbook appli cryptographi discret mathemat crc isbn roth java archiv applic mobil agent agent mediat electron european perspect dignum vol lectur note artif pp springer mobil secur internet vol lectur note comput pp mobil issu nation inform system secur confer pp octob proc intern workshop secur mobil url
DB/548 3 index ecient method knn process cui yu chin ooi tan jagadish depart comput scienc nation singapor depart electr engin comput scienc michigan abstract present ecient call neighbor search space partit data select refer point partit data cluster transform singl space base similar respect refer point point index structur knn search perform rang search choic partit refer point techniqu freedom techniqu describ choic ectiv adapt index structur data distribut conduct extens experi evalu report result demonstr ectiv introduct emerg applic time seri scienti manipul data frequent oper object similar queri object nearest neighbor search central requir case long stream research solv nearest neighbor search larg number index develop structur permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb adapt respect data distribut tend perform data set poorli techniqu knn search adapt base data distribut uniform behav similar techniqu pyramid good situat highli cluster behav hierarch cluster tree creat problem call reli partit data de ning refer point partit index distanc data point refer point partit distanc simpl small map ort partit standard tree index distanc easi techniqu top exist commerci relat techniqu permit gener result addit result search support onlin queri import facil interact queri data analysi ectiv depend data refer point select present partit refer point select strategi implement method partit refer point select conduct extens perform studi evalu ectiv result show scheme provid fast initi time sacri qualiti answer choic partit method comput complet answer set faster linear section review relat work section background knn search section present algorithm section discuss mechan polici select refer point section present perform result conclud direct futur work relat work index techniqu nearest neighbor approxim search exist index shown ineci support queri form basi index design reduc ect high bigger node reduct ne method index speci calli design facilit metric base queri process linear scan remain strategi knn search high tendenc data point equidist queri point space tree support approxim nearest neighbor search answer obtain quickli necessarili nearest neighbor reduc ect experienc store virtual bound box approxim actual minimum bound box actual bound box bound box approxim rel posit respect parent bound region similar tree node entri lead overlap ecient search mainten effect virtual bound box dynam chang parent bound box ect virtual bound box referenc addit cpu time deriv actual bound box incur perform studi show ecient le background search nearest neighbor queri point distanc kth nearest neighbor ne minimum radiu requir retriev complet answer set distanc predetermin accuraci iter approach examin increasingli larger sphere iter emploi algorithm work queri point nding nearest neighbor begin queri sphere de ned small radiu data space intersect queri sphere search search region expand till nearest point found data subspac intersect current queri space check data point nearest neighbor enlarg queri sphere introduc answer point note start search queri small initi radiu search space tight minim unnecessari search larger radiu nearest point knn process call facilit ecient knn search design motiv observ data point deriv refer chosen refer point data point order base distanc refer point distanc essenti singl repres data singl enabl exist singl index design support similar search similar rang search knn search note similar rang search window search xed radiu simpler comput knn search concentr knn oper onward rest assum set data point unit space dist metric distanc function pair point euclidean distanc distanc distanc function applic data structur point transform singl space step algorithm rst data space split set partit refer point identi ed partit loss pm refer om defer discuss partit refer point obtain section data point repres singl dimens space data point index base distanc nearest refer point distanc function return distanc constant stretch data rang serv partit singl dimens space region point partit map rang emploi data index transform point facilit retriev commerci dbm implement leaf node link left sibl facilit search neighbor node search region gradual enlarg arrai requir store refer point respect nearest furthest radii de ne data space lossi multipl data point space map singl space di erent point partit equidist refer point transform knn search examin knn algorithm search region refer point partit dist max dist min maximum minimum distanc point partit note region bound sphere obtain radii de ne effect data space search queri point radiu sphere obtain conduct nn dist max search nn point rang search ect partit singl space dist min max figur show queri point partit queri point search clear point xed radiu transform due lossi transform data point distanc respect refer point shade region area check figur summar algorithm knn method algorithm similar counterpart begin search small increment enlarg search space till nearest neighbor found search stop distanc furthest object queri point equal current search radiu figur search region nn queri algorithm highli abstract examin brie discuss import routin notat routin furthest return object furthest distanc denot sphere radiu centroid routin outward explain routin leaf routin examin entri node determin nearest updat answer note point valu close closer rst element element node queri predecessor respect distanc refer point successor close left sibl examin search space refer point partit routin typic algorithm locat leaf node search detail descript algorithm omit readi explain search algorithm search begin scan auxiliari structur identifi refer point data space area overlap queri region search start small radiu step radiu form bigger queri sphere main case data space queri data space cientli determin nearest neighbor rst locat leaf node store node necessarili point distanc closest compar sibl search outward refer point algorithm max stop ag initi stop ag figur knn main search algorithm algorithm furthest furthest jsj stop ag di search dist max di di dist max intersect dist max di nil di nil di figur knn search algorithm entri node number jsj furthest furthest furthest kei node node di end partit reach node figur knn search data space intersect queri sphere search queri point data space data space intersect queri sphere examin data space search stop nearest neighbor identi ed data subspac intersect current queri sphere enlarg queri sphere chang nearest list point subspac intersect queri sphere distanc queri point greater occur distanc object answer queri point equal current search radiu answer return accuraci interest provid approxim knn answer quickli iter algorithm set candid nn point result return user immedi ned accur answer obtain subsequ iter import note candid nn point partit answer rst categori easili point distanc smaller current spheric radiu queri answer set user toler amount inaccuraci obtain quick approxim answer termin process prematur long sati ed max speci ed termin prematur select refer point data space partit support similar split data space partit refer point section choic equal partit data space straightforward approach data space partit equal partit hyperplan method adopt partit space pyramid centroid unit cube space hyperplan form base pyramid expect note space similar pyramid method design bound area arch affect search area figur space partit method ectiv data uniformli distribut studi refer actual data space overlap centroid closest distanc centroid hyperplan refer partit point point nearest figur show space queri region ect space queri point central set point retriev axi pyramid tree deal queri data point set point due curvatur compar partit axial hyperplan case pyramid set overlap centroid furthest distanc centroid hyperplan refer partit point point furthest figur show space ect area greatli reduc compar closest distanc extern point point line form centroid hyperplan centroid data space refer point extern refer refer point fall data space heurist expect perform ect area data uniformli distribut note closest furthest map function di pyramid data point pyramid base attribut repres centroid space note refer point special case distanc support figur show closest distanc space observ ect space extern point reduc centroid gener conceptu correspond manner tree gener pyramid tree metric perform approxim studi cluster base partit expect effect data uniformli distribut data point correl partit strategi identifi cluster data space data distribut data point cluster straightforward exist cluster scheme literatur birch cure metric base index depend underli cluster expect cluster strategi uenc retriev perform adopt approach method step obtain sampl obtain statist distribut data dimens select valu dimens valu valu frequenc exce threshold observ valu form centroid valu data pick high frequenc high frequenc dimens base predict cluster treat cluster centroid count data nearest cluster centroid cluster edg figur space partit sucient number data estim cluster note step algorithm crucial number cluster impact search area number root leaf node number cluster point similar distanc refer point number cluster data ned sphere respect centroid incur addit search solut number cluster merg centroid number cluster split larg cluster smaller expect number cluster tune vari di erent applic domain cluster select refer point option select refer point centroid cluster centroid cluster natur candid refer point figur show cluster space edg cluster shown figur centroid sphere area cluster enlarg includ outlier lead signi overlap data space minim select point edg hyperplan refer point figur data space cluster edg point overlap partit smaller cluster centroid refer point perform studi report result extens perform studi conduct evalu perform variant index strategi test di erent data vari data set data set size data distribut extend scheme support knn return approxim answer progress map point maximum minimum valu dimens rang queri requir subqueri compar studi compar linear scan shown ectiv knn queri data space experi setup implement techniqu search algorithm singl index structur obtain sourc code author index page size kb experi perform sun ultra megabyt main run sun solari conduct experi data deriv color histogram imag report interest result knn result found point issu ve hundr averag cost perform metric gener uniform data set data size rang cluster data cluster algorithm similar birch radiu point furthest dimens radiu point furthest dimens radiu point furthest dimens figur ect search radiu queri accuraci gener data set ect search radiu accuraci knn search neighborhood requir nearest neighbor small search sphere enlarg search condit met import studi ect search radiu index method tupl uniformli distribut data set combin experi figur show accuraci knn answer respect search radiu exampl result show radiu accuraci improv hit queri distanc queri smaller requir search retriev requir answer number dimens radiu requir obtain due distanc point sparsiti data space space note seemingli larg proport respect total dissimilar observ capabl gener lot nearest neighbor small queri radiu figur retriev ecienc queri note stop radiu algorithm detect nearest neighbor radiu reach length provid fast initi answer quickli linear produc complet answer faster linear scan reason number dimens number dimens reach longer time produc complet answer expect data uniformli distribut abil produc approxim strategi adopt averag page access cost radiu figur retriev ecienc ect refer point scheme evalu ecienc scheme previou data set averag page access cost radiu uniform center point point farther point figur ect refer point figur show result combin scheme extern point hyperplan centroid note cost radiu radiu cluster percentag trend variant search radiu radiu cluster partit partit partit partit partit partit partit ect number partit radiu cluster ect data size search radiu radiu cluster ect data size cost accuraci rate cluster ect refer point cluster data set accuraci rate cluster ect cluster data size figur scheme knn search expect larger radiu number hit data examin notic scheme ecient produc fast rst complet answer note refer point hyperplan perform data space requir smaller case point perform scheme test data set data point overlap test ect number partit merg number close cluster treat cluster edg cluster refer point partit notic figur complet answer set obtain small radiu notic smaller number partit perform return point due larger partit small number partit result figur show slightli trend note smaller number partit incur higher cost reason smaller number partit partit number drop access higher observ scheme obtain complet set answer short time repeat experi larger data set point cluster edg cluster strategi select refer point figur show search radiu requir locat nearest neighbor partit result show search radiu small data order good percentag knn data size great impact queri cost figur show cost queri speedup factor linear scan nn retriev figur figur show cost ect nearest neighbor return point graph mean percent nearest point obtain number note scheme produc answer lower cost linear scan improv ve time result show pick edg point refer point gener reduc amount overlap accuraci rate uniform accuraci rate cluster accuraci cluster figur compar studi compar studi compar scheme rst experi uniform data set queri queri scheme figur show result experi note produc qualiti approxim answer quickli compar linear scan cost lower linear scan accuraci data uniformli retriev nn longer time linear scan point equidist note perform equal set cluster data set queri queri studi version edg cluster refer centroid cluster figur summar result observ emploi edg refer point perform smaller overlap space scheme earlier scheme return initi approxim answer eventu produc nal answer set faster linear scan note produc approxim answer quickli perform start radiu attempt search exact nn unlik termin nearest point termin entir data set examin obtain nal answer perform poorli rel perform cluster data set uniform data set outperform wide margin larger number drop produc compar scheme recent structur shown ecient signi cantli ecient le note gain due virtual bound smaller size logic pointer store actual pointer intern store memori resid map tabl size tabl substanti fair comparison implement version method similar fashion result ect greatli set cluster data queri page size byte figur summar result result show ecient type queri produc answer progress unabl achiev result show di erenc perform di erent valu signi larger cpu cost linear scan incur seek linear scan featur le entail examin data point calcul distanc data point queri point due limit bu er featur le scan factor impact cpu time figur show cpu time linear scan experi figur interest note perform term cpu time approxim ect trend page access result show method achiev fold speed omit comparison search index order ensur cpu time point higher linear scan averag cpu cost radiu cluster partit partit partit partit partit partit partit figur cpu time present simpl ecient approach nearest neighbor call extens experi conduct result show ectiv cient achiev speedup factor linear scan blow storag requir accuraci result intent faster suit integr exist dbmss outperform robust adapt di erent data distribut extens current implement similar join algorithm acknowledg author provid sourc code structur compar studi work support part nsf grant number refer kriegel break proc acm sigmod intern confer manag page hp hv jagadish independ index compress techniqu data space proc intern confer data page da hp kriegel index structur data proc intern confer larg data page bertino al index techniqu advanc system kluwer shaft nearest neighbor proc intern confer ozsoyoglu index metric space proc acm sigmod intern confer manag page chakrabarti mehrotra local approach index high space proc intern confer larg page zezula ecient access method similar search metric space proc intern confer larg data page goldstein ramakrishnan contrast plot space time nearest neighbor search proc intern confer larg page shim ecient cluster algorithm larg proc acm sigmod intern confer manag data guttman dynam index structur spatial search proc acm sigmod intern confer manag page satoh index structur nearest neighbor queri proc acm sigmod intern confer manag data index simpl ecient approach index proc acm symposium principl page ramakrishnan gehrk manag system index structur space rel approxim proc intern confer larg data page quantit analysi perform studi method space proc intern confer larg data page da white jain similar index proc intern confer data page yu index phd depart comput nation tan progress knn search page livni ecient data cluster method larg proc acm sigmod intern confer manag data
ML/549 6 bayesian explor mobil robot robert sim abstract work address problem robot explor task automat learn map environ mobil robot navig local explor mechan intend applic arbitrari independ world approach avoid arbitrari heurist preliminari result present discuss futur direct investig content introduct problem statement previou work approach comput geometri topolog autonom map construct problem theori bayesian analysi presenc uncertainti explor develop theori explor bayesian approach ad measur preliminari result simul instanti futur direct list figur polygon shortest rout spectrum environ mont carlo simul robot undergo uncertain motion simul result origin scene landmark laboratori scene probabl densiti function robot pose introduct order autonom robot oper requir knowledg task accomplish essenti aspect knowledg map inform enabl robot estim research devot signi amount work solv prior map tackl problem construct map attempt map acquisit problem fulli autonom set major commit modal assum world repres map de ne explor process discov aspect world reliabl model structur behaviour scienti explor real world termin practic robot explor acquir sucient inform perform task measur con denc work aim develop framework autonom explor accomplish task pose problem optim robot knowledg inform world prior work domain constrain sonar vision sensor restrict class model seek gener model facilit wider domain aim address open question pose approach explor principl contribut work theori explor accommod multipl correct world account uncertainti robot action balanc paper divid de ne account question sensor uncertainti problem statement review prior work explor problem present approach provid preliminari result futur direct work problem statement goal develop robust ecient method autonom explor unknown environ task odometri sensor read factor account plan move agent goal maxim certainti world problem compound requir higher accuraci part safeti limit choic model question comput tractabl light de nition requir criteria determin explor termin clear robust ecient solut requir care issu previou work section previou work relev explor problem approach comput geometri problem comput geometri provid insight relat task sonar map real world approxim term bodi research polygon immedi applic import question answer context cg complex cg problem dicult conclud relat problem hard world express term exact solut problem repres lower bound accomplish presenc provid measur evalu algorithm tackl uncertainti rst rout solut repres minimum distanc robot travel order discov repres polygon figur polygon shortest rout start point rout mark bold line rout problem relat art galleri problem chin de ne rout polygon close walk point visibl point walk start point polygon rout problem shortest rout start chin demonstr problem polygon hole problem simpler polygon chin develop algorithm orthogon polygon provid algorithm simpl polygon al develop algorithm solv problem ed explor singl face solv rout problem face partial knowledg class navig bug deal task nding path start point goal environ popul unknown obstacl explor strategi involv travel search obstacl obstacl encount taylor kriegman emploi build set local map base set visibl landmark topolog world consid section class cg problem relev geometr probe problem geometr probe consid problem determin geometr structur result measur devic probe context geometr probe relev result problem domain number discret site sampl order complet reconstruct environ probe model ect ideal behaviour absorpt broad survei wide rang probe model relat result signi interest nger probe introduc cole nger probe measur rst point intersect direct line object model perfect sonar measur sampl cole show probe sucient complet determin convex polygon probe model insu cient determin arbitrari polygon al modifi probe model develop cole probe follow arbitrari curv return point intersect polygon surfac normal point intersect probe author show probe sucient probe polygon edg relat interest problem geometr object veri cation set object target minimum set probe target discrimin object set detail survei result geometr test dudek develop collabor algorithm explor simpl polygon robot commenc explor posit adjac vertic polygon sweep free space travel edg maintain line sight entir polygon result descript topolog base planar decomposit polygon topolog autonom map construct earliest work aim address autonom explor problem kuiper byun work model world graph environ popul point line featur goal automat extract topolog vertic locat local maxima measur distinct subset sensori vertic graph recogn local signatur environ vertic connect arc de ne local control strategi travel vertex recognit veri ed procedur approach duplic gener voronoi graph deal issu de ning local control mechan move vertex vertex topolog approach relev work present al world repres topolog set visual problem local world recogn place base current input imag advantag emploi topolog dicult problem maintain robot pose absolut global refer frame introduc level abstract emploi infer understand command live room approach kuiper byun robot forc oper context extract adequ task requir special knowledg place graph dudek resolv issu de ning set metric island reliabl neighbourhood distinct place distinct place select measur combin inform quantit measur robot local select sensor task neighbourhood figur summar spectrum consid rang pure metric map pure topolog map requir metric inform dudek requir hierarchi gener ascend hierarchi problem theori bayesian analysi move problem rst examin theori motiv current approach task pure metric pure topolog figur spectrum environ commenc rst de ning pose robot repres global paramet captur state world de ned con gurat space de ne set admiss pose observ de ned output sensor belong space admiss sensor read repres raster set pixel intens valu imag acquir camera de ne map abstract method predict observ base pose robot map typic coupl set prior observ de work foundat problem theori problem theori concern problem infer base observ proce robot local imag robot encount posit express relationship local problem invert equat infer problem pose observ sensor imag problem theori rescu principl commit di erent pose imag repres pose robot probabl densiti function input imag map question comput analyt clear import paramet world light surfac geometri notion road map method predict upcom topograph map predict slope trail ahead util map local root remark abil rapidli search place predict match observ develop theori predict observ pose map embodi properti world enabl predict bayesian refer model pose repres subset paramet reader impli comput framework select refer refer member comput method comput explicitli explicit object regular observ spline interpol issu comput model address mackai ferri deal issu context object object repres set abstract infer simpl applic law reveal refer priori probabl densiti function robot prior refer evid map term assum uniformli distribut treat normal constant note prior evid uniformli distribut pose maxim likelihood observ solut equat pose robot underli probabl densiti function complic simpl method desir comput compact pdf varieti comput tool emploi repres probabl densiti function common tool mixtur model mont carlo simul mixtur model repres probabl densiti function nite sum elementari pdf gaussian repres weight term appli elementari pdf approach repres data mixtur model requir priori knowledg number mode data mont carlo simul comput approach probabl densiti function repres implicitli set outcom repeat stochast simul pdf pose robot repres set weight locat point con gurat space weight likelihood robot translat forward figur mont carlo simul robot undergo uncertain motion uncertainti robot head yield distinctli distribut figur courtesi ioanni locat point figur depict mont carlo simul result pose robot undergo uncertain forward motion note uncertainti robot head lead distinctli pose distribut number particl distribut particl repres pdf robot pose advantag mont carlo simul priori requir structur pdf disadvantag number particl requir adequ repres pdf exponenti paramet space faithfulli simul stochast physic system dicult problem mont carlo simul appli successfulli problem robot local visual arm relat turn attent task construct map environ note discuss problem data acquisit data arriv presenc uncertainti robot construct map execut action sensor read task involv measur uncertainti corrupt result uncertainti robot action compound success map eventu useless mention robot classic construct map pose problem probabilist framework problem repres world select probabl straightforward approach probabilist map construct emploi kalman filter updat robot posit posit landmark concept diculti pose kalman filter uncertainti embodi gaussian evolut actual uncertainti pose robot addit gaussian kalman filter assum problem linear extend kalman filter accommod formul rst linear neighbourhood estim taylor seri diculti approach linear lter diverg correct solut order avoid problem encount due assumpt linear gaussian turn gener framework pose suggest thrun al thrun work advantag markov assumpt law show sequenc action observ input probabl map maxim likelihood data method produc probabl map simultan probabl set robot base expect maxim iter strategi likelihood space oper expect maxim phase thrun em pose comput set robot action assum current estim map correct comput maximum likelihood map robot assum pose estim step correct process continu iter map converg local maximum recent thrun suggest increment method adjust map data arriv method exploit mont carlo pose robot distribut comput error robot pose backward time prior observ approach maintain set good start point gradient ascent likelihood comput forego cost search entir space map maximum likelihood estim em approach exploit context comput structur motion camera work signi exploit altern map emploi section note kalman filter approach motiv previou success robot local algorithm map construct present thrun satisfi speci underli uncertainti requir approach assum robot perform task explor collect observ build map make attempt instruct robot collect observ task section explor consid task local map turn problem explor major explor approach appli heurist increment discov unexplor space diculti method qualiti result imposs valid evalu problem address author context problem theori theori optim experi mackai seri paper address problem bayesian interpol function sampl observ presenc observ uncertainti mackai exploit shannon entropi show optim place obtain sampl predict observ observ place interpol function largest applic mackai work fundament theori deriv preserv deriv object function data select ferri emploi mackai framework work activ explor obtain object model show locat observ maxim predict base covari matrix set model paramet describ object formul process base local measur model direct agent sensor read climb simultan uncertainti gradient ferri exploit idea solv object recognit direct sensor place maxim expect reduct entropi probabl distribut object class case author bene fact construct object inform theoret approach appli problem robot navig roi thrun de ne object function navig goal posit world simultan aim minim entropi probabl densiti function de ning pose robot reach goal reason path result path plan method refer tendenc direct robot boundari certainti robot pose improv approach mackai reli import assumpt approxim assum pose robot indic deal uncertain outcom robot action assum distribut model paramet facilit analyt solut observ site appli gaussian assumpt order approxim local gradient uncertainti space make local move assumpt reason critic assumpt theori model phenomena give rise data assumpt agent direct repeatedli collect sampl site model lead improv denc model lead robot ignor region poorli repres mackai refer issu approach goal work develop framework accommod inabl complet captur data develop theori explor consid extens prior work topic explor environ proce develop theori motiv approach emploi approach account requir account uncertainti pose robot bayesian approach map sensor read equat comput probabl pose robot repres predict model theori measur likelihood observ base world context naiv approach data collect move place select action uncertainti pose robot maxim amount select pose maxim expect posteriori entropi log interest contrast idea navig approach roi move goal world minim entropi posteriori pose distribut maxim incorrect explor depend xed properti di erent place world alik matter observ uncertainti place versu ident place remain xed interest likelihood map current equat relat likelihood map face observ pose likelihood observ priori measur probabl map note independ absenc map inform theoret approach explor pose maxim expect reduct entropi probabl distribut state expect chang entropi term mackai de ne log dm repres prior arriv datum set collect data evalu equat requir integr space map pose diculti contrast method construct parametr model base data instanti map term explicit set paramet avoid instanti order paramet implicitli encod inaccess embodi sole set prior observ arriv continu investig insist map lead formul mackai simpli ed comput taylor seri map assum likelihood space distribut neighbourhood avenu explicit actual set observ yield observ space cross datum author investig equat simpli ed context work text mackai observ collect data point error bar interpol implic point abil map predict data weakest author unabl deriv explicit relationship chang entropi model predict observ nearest deriv suggest inform observ noisi appar contradict stem fact model predict noisi highli uncertain predict datum process forc draw line attack theoret unsound uncertain pose robot select pose navig select action execut robot maxim expect con gurat space assum moment con gurat space robot discret nite grid restrict action discret set move forward turn left formul task reinforc learn problem task comput polici select action order maxim expect accru robot princip diculti approach tractabl requir discret robot state straightforward question futur research ad measur direct robot place execut global optim data collect global optim action fact requir robot travel signi put risk due hazard fact physic cost execut optimum action robot lost travel goal accommod present object function repres cost execut action paramet determin desir rel weight expect chang entropi clear junctur sucient penal highli uncertain action question futur investig preliminari result simul section state work date rst instanti explor method simul robot environ figur simul result robot environ termin explor model environ occup grid point hold occ probabl posit intersect edg polygon occup grid initi indic state robot initi pose lower left corner map explor perform rst identifi set candid pose elig explor reachabl base current state occup occup grid simul pdf simul sonar scan posit pose sonar pdf highest entropi select optim pose scan figur show state occup grid iter algorithm model repeatedli select posit scan algorithm termin reason termin conclud section heurist incorrect mackai argument insuci model lead suboptim behaviour model sonar scanner heurist simul explor figur demonstr import issu face address signi interest pursu richer model turn attent task model probabl densiti function vision sensor real world set figur origin scene landmark instanti goal autom acquisit train input discuss section fundament mechan develop abil comput discuss prior work domain landmark learn introduc instanti appli bayesian context robot note prior work cite emploi bayesian formul present unpublish goal comput probabl densiti function camera imag pose map approach make simplifi gener entir imag concentr gener imag neighbourhood set fl visibl salient point probabl densiti function observ landmark distribut maximum likelihood observ comput explicitli function gener base learn mechan construct imag posit landmark set prior observ process scheme infer covari matrix distribut covari captur stochast natur sensor inadequaci model figur depict scene landmark learn uniform sampl pose space figur depict imag nearbi pose pose imag neighbourhood landmark reconstruct method comput formul mixtur gaussian landmark imag correspond gaussian probabl densiti function landmark pose learn predictor landmark point justi cation made choic mixtur model equat correct formul comput joint distribut consid possibl outlier landmark recognit result due limit machin summat model prevent catastroph cost higher uncertainti incorrect assumpt landmark observ disjoint figur depict pose space laboratori set depict figur mode distribut predict pose robot posit actual robot posit futur direct establish framework autonom inform discoveri context robot explor wide varieti issu requir discuss signi issu tractabl integr solv order comput entropi function requir simpli cation exploit mixtur model formul order deriv analyt solut lack explicit model handicap deriv address question model remain comput model present model model imag domain requir complic con gurat space work requir context evalu expect entropi uncertainti robot pose evalu set singl vantag point obtain sensor read question reinforc learn paradigm appli consid address infer geometr constraint context navig ad cost function aim reconstruct imag reconstruct sonar function equal interest issu futur work natur topolog environ express set landmark view di erent region figur laboratori scene probabl densiti function robot pose area depict correspond con gurat space robot darker region correspond imag space give rise di erent set visibl landmark opportun path plan infer base navig set visibl landmark approach li domain hybrid set topolog place local metric map signi gap domain robot research autonom explor domain machin learn studi make research consid task acquir data optim facilit task hand work aim ll gap theoret sound practic feasibl theori explor deriv inform theori speci robot direct acquir sensor read place abil model world weakest establish preliminari result valid part feasibl goal highlight import diculti overcom futur work continu seek marriag robust theori explor practic issu implement refer jd order induc set applic probe convex polygon ieee intern confer robot page ieee tal activ object recognit condit probabilist evid entropi map phd mcgill januari tal frank ferri viewpoint select navig entropi map seventh ieee intern confer comput ieee press wolfram dieter mark reid sebastian thrun collabor explor ieee intern confer robot san ieee press francesco frank ferri activ uncertainti reduc ambigu technic report mcgill intern journal comput vision chin shortest rout simpl polygon discret comput chin simeon optimum rout inform process joel sensor base part increment construct gener graph proc ieee confer robot page ieee press cole shape probe journal thrun algorithm mobil robot local ieee comput societi confer comput vision pattern recognit ieee june frank steven charl sebastian thrun structur motion correspond ieee comput societi confer comput vision pattern recognit ieee june rubin maximum likelihood incomplet data em algorithm journal royal statist societi seri duda hart pattern classi cation scene analysi york gregori dudek environ map multipl abstract level volum nov theori optim experi academ thrun activ markov local mobil robot robot autonom jose hugh simultan local map build natur featur environ sixth intern confer intellig autonom michael isard andrew blake condit densiti propag visual track intern journal comput allan jepson michael black mixtur model imag technic report project technic depart comput march kuiper byun robot explor map strategi base semant hierarchi spatial robot autonom benjamin kuiper byun qualit approach robot explor ieee workshop spatial reason page lo ieee john leonard hugh mobil robot local track geometr beacon ieee transact robot june john leonard han jacob feder ecient method concurr map local john dan robot ninth intern feng lu milio optim global pose estim consist sensor data registr proc ieee confer robot page ieee press vladimir sun kang dynam path plan terrain acquisit ieee transact robot aug mackai bayesian interpol neural mackai object function activ data select neural art galleri theorem algorithm oxford ioanni bug survei technic mcgill ioanni gregori milio explor unknown ecient reduc odometri error intern joint confer arti cial volum page august morgan kaufmann ioanni gregori milio collabor robust explor intern confer robot san april kathleen geometr probe test survei technic report rutger septemb nichola wolfram dieter sebastian thrun coastal navig robot motion uncertainti aaai fall plan nichola wolfram dieter sebastian thrun coastal navig mobil robot navig uncertainti dynam environ ieee confer robot ieee press recent result art galleri septemb ce shannon mathemat theori chapter mathemat theori commun illinoi shi carlo good featur track ieee confer comput vision pattern june ieee press sim mobil robot local learn landmark master mcgill juli sim dudek mobil robot local learn landmark confer intellig robot system octob ieee press sim dudek learn evalu visual featur pose estim seventh ieee intern confer comput sept ieee press steven interact reconstruct geometr probe septemb randal smith peter cheeseman estim spatial intern journal robot richard sutton andrew barto reinforc learn mit visual place recognit autonom robot ieee intern confer robot autom page ieee comput societi problem theori elsevi scienc publish taylor david kriegman explor strategi mobil robot ieee intern confer robot ieee press burgard probabilist approach concurr map local mobil robot machin autonom robot sebastian thrun bayesian landmark learn mobil robot local machin sebastian thrun learn map map indoor mobil robot navig arti cial page januari sebastian wolfram dieter fox algorithm mobil robot map applic map ieee intern confer robot san ieee press ferri autonom driven uncertainti confer comput vision pattern page lo june ieee comput societi press peter curiou machin autonom visual explor phd mcgill
IR/550 5 issn de recherch institut nation de recherch en informatiqu en automatiqu equal time data internet georg anthoni mar em equal time data internet georg mihaila raschid anthoni rapport de recherch mar page internet larg amount structur access ftp odbc html document data effect reason structur data tool exist locat sourc structur data access data requir find build handl multipl incompat protocol paper describ integr access tool accomplish task describ protocol architectur locat data sourc queri languag queri process system access common protocol data exchang result system data access internet goal support commun user share data economi document share heterogen web toronto depart comput scienc maryland depart comput scienc unit de recherch inria rocquencourt domain de bp le chesnai cedex telephon pour inform en avec resum grand quantit de access par de de connect ou dan de document html ce ne pa dune de la structur de ce le nest pa normal il ny pa pour de sourc pour de pour le de pour protocol incompat ce qui integr aux pour ce protocol architectur pour le sourc de le langag de de pour le protocol commun pour de le est qui donn pour de sur notr est global de dune simpl la dont mainten le document base de web equal time data internet hotel restaur catalog figur space data sourc type introduct amount structur data todai internet make invalu resourc inform structur data defin tabl data locat file effect data difficult due absenc servic internet structur defin wai ffl describ structur semant ffl locat relev ffl access data effici uniform manner file tabl amount air notr februari measur hour interv agreement data model describ structur semant type file file data type inform file document text form locat relev data exceedingli difficult scientist locat find ftp directori file file wide accept agreement locat inform user find inform ad hoc method ideal find inform type access data effici homogen data data type data fortran data scientist data protocol ftp major sourc structur inform internet access gener achiev gatewai protocol odbc access method suffer problem support data dictionari cumbersom queri process obtain type type conflict standard type system mechan provid locat odbc server drawback protocol access data ftp file complet structur internet vast amount html file data store html file suffer limit locat access html file descript mean addit data locat data store easier www search inform retriev techniqu lack formal type make difficult access kind data interest structur data difficult access user applic program deal heterogen access protocol data format paper describ call attack problem support structur data structur data model user describ illustr figur class interfac data model circl repres data sourc internet address export type rr hotel restaur catalog figur catalog server address data sourc type type circl extend protocol architectur disco access heterogen data sourc detail architectur protocol section access data homogen heterogen collect access protocol data translat translat extens wrapper concept heterogen distribut translat servic provid gatewai system data sourc translat accept process queri depend data return answer commun accomplish protocol translat detail section catalog server aid locat translat catalog servic effici provid address data sourc data type type illustr figur system access data access find catalog entri access data catalog entri addit locat data catalog server aid integr sourc standard type share multipl user requir data sourc record catalog server aid homogen effici access data provid queri languag queri process system integr locat data sourc access data sourc access data sourc heterogen collect protocol scientist produc data mention result scientif measur data store ftp file address format tabl publish report journal report data interpret scientist read report data exist forc copi data local ftp determin schema scientist exchang inform accomplish simpl scientist regist access data catalog server registr mean transmit tripl inform catalog server consist address type translat data scientist translat translat ftp file format scientist transmit tripl interfac attribut integ attribut integ attribut integ attribut integ updat catalog server call tripl catalog entri catalog entri data scientist includ address catalog server journal articl access scientist system attach catalog server system access data select system function catalog server requir user catalog entri directli queri locat data inria equal time data internet hotel restaur catalog figur link world www system access data access catalog address find catalog entri access data catalog entri scientist free data full function queri languag addit data export data system ad catalog entri catalog server assum mean type understood standard data user assum semant homogen homogen access protocol assumpt standard type reason scientif document clear misunderstand nation standard inform french nation standard inform consist hundr relat document defin measur type data commun user creat standard type simpli provid catalog server type situat structur data support assumpt semant homogen type access ident research semant heterogen complex problem expect research continu applic area defin sophist standard semant semant document defin mean field provid record format marc standard defin bibliographi record librari includ definit detail start project defin standard semant www search engin initi harmon metadata standard develop metadata registri access www initi standard data format gener defin protocol locat data sourc provid access data task focu world wide web descript independ except issu data view data space complementari www requir user catalog server address data form catalog entri broad popular advantag provid map catalog entri www publish html document simultan publish catalog entri inform catalog entri user www read descript data sourc automat queri access sourc accomplish catalog entri pair html document pair text type call dyad document lieu catalog entri tripl regist catalog server provid base www inform locat catalog entri data figur show relationship www arrow refer html document catalog data left set object relat consequ map improv flexibl access user simpl html address access data user access subset data sourc html page subset data sourc world subset html page www world easili construct world accomplish catalog server www world accomplish inform retriev search rr engin languag permit access imag subset world imag subset figur document user longer explicitli catalog entri catalog simpli sweep www catalog entri administr organ lunch meet pari peopl arriv countri administr find restaur hotel meet administr interest data sourc export restaur review data sourc export hotel review administr examin standard www site list standard type find type restaur type hotel administr tabl excel restaur rate guid excel hotel queri express select mention restaur export type select part classic interpret mean variabl bound url match inform retriev phrase variabl bound data identifi url data restaur type type identifi variabl bound data sourc match type hotel type process mention export type accomplish consult index inform retriev index www consult provid index catalog server type match assum level semant attribut restaur hotel type sensibl compar equal contribut permit data locat html document data exchang format special translat data format special process queri data directli resid html document note applic translat protocol www exist data html document central architectur special case translat process data html document section summari address problem describ data provid data locat data provid catalog access structur data provid translat system queri processor system oper environ heterogen collect access protocol data format problem describ defin architectur base translat technolog permit dynam connect defin strongli type data model problem locat defin catalog servic perform type defin languag declar translat type html base syntax problem access defin queri languag combin locat data access defin algebra process queri queri defin protocol data access translat special special case translat data html document result system data access internet goal support commun user share data economi document share paper organ section describ data model section describ catalog servic section describ architectur section describ queri algebra execut queri section describ interfac translat section discuss relat section conclud paper summar contribut describ statu prototyp implement express mean broadcast time discuss issu equal divid polit parti inria equal time data internet data model overview support simpl object data model model similar level mediat standard model strongli type consist base type user defin type type defin set attribut relationship attribut defin basic type relationship defin object type identifi label repres path type support basic arithmet comparison oper boolean oper bnf descript syntax data model appendix syntax similar odmg object data odmg simpl user defin type interfac restaur attribut string relationship busi data model simpl support featur type structur support global object ident section impact lack global object ident data exchang format support process queri directli data resid html document document object type restaur data simpli express interfac restaur attribut string attribut string attribut integ attribut integ attribut integ attribut integ relationship busi francoi de de de relationship encod object refer assum document busi object individu object document identifi html label object rr catalog server data sourc provid access data catalog entri creat catalog entri ad directli resid document document catalog entri suitabl textual descript data present data sourc describ tourist inform write html document interfac restaur attribut string attribut string includ definit hotel guid onlin provid inform restaur hotel pari data sourc connect inform written special html tag regular browser document author regist catalog server form base interfac server robot technolog period web search document extract catalog entri format data maintain catalog server relat url address document describ data type object type made translat specifi address interfac program read data deliv protocol sourc address data sourc tripl express fact object type extract data sourc translat catalog support function ffl interest find document serv entri point access specif lookup catalog select qualifi url ffl url potenti find extract server find return tripl connect url found server fetch document refer scan tripl add tabl inria equal time data internet http server http catalog relat db odbc data sourc http server http ui translat def file translat file translat db jdbc translat odbc data sourc queri processor translat catalog data sourc figur configur compon dot box refer host small box protocol softwar subsystem line exchang queri answer architectur section describ architectur descript base configur compon shown figur larg dot box repres compon compon separ address space resid separ host line compon repres exchang queri protocol data sourc compon store data case collect html relat engin type data sourc catalog compon store data data type translat inform access data sourc catalog multipl independ catalog system type catalog catalog type provid catalog compon similar data sourc differ catalog fix type semant translat compon translat protocol data exchang protocol translat isol work translat queri local format work translat answer back translat compon translat odbc queri processor compon queri servic user compon consist subcompon data sourc subcompon depend data sourc type translat servic provid data sourc compon translat translat export box html data sourc compon depend html document http server data sourc translat provid direct support queri processor compon support process data resid html translat subcompon html document translat compon shown diagram singl translat odbc translat protocol accomplish protocol odbc protocol queri processor compon user queri translat translat understand data exchang format interact compon occur updat catalog queri process kind updat catalog explicit updat user html form base scan html file catalog inform express queri process proce queri enter user interfac queri check catalog search catalog search perform set result catalog entri html plan provid java applet visual rr catalog construct remain portion queri process queri process engin engin issu translat combin return user mention call piec inform locat data type process process translat data sourc depend type process translat locat translat pass argument translat locat data sourc locat pass argument translat queri languag section introduc queri languag provid declar locat access data locat data sourc languag construct deriv websql data manipul express standard construct syntax appendix illustr featur languag run restaur hotel inform introduct interest find restaur pari meet criteria dont inform locat regist type restaur peopl export inform assum schema consult catalog write queri select restaur queri evalu consult catalog server search data sourc restaur object queri sourc type queri present highest transpar locat data doesnt requir user priori inform repositori data downsid potenti larg number data sourc contact relev queri make provid user abil data locat queri select restaur assum html document catalog entri section guid onlin transpar data access express link descript locat data data defin rang variabl collect restaur object access document server host point interest data found assum document access hypertext link server root page step access actual data find document accomplish path regular express la select document restaur document host server mention regular html document regular document skip evalu queri method find document base keyword search mention list catalog server startup inria equal time data internet select document mention restaur sentenc restrict rang document mention phrase document examin document export restaur object extract function mention predic conveni access broad number content document user restrict search relev list site specif data site specif site referenc accomplish send queri catalog server sect address data sourc data dont connect inform contact sourc reli system extract inform catalog connect data sourc extract requir submit queri select document export sourc restaur export sourc keyword instruct queri processor contact catalog extract catalog entri sourc address domain document defin export type match export translat construct match translat data model support relationship queri languag borrow construct oql path retriev address busi offic restaur path select restaur queri process virtual algebra machin answer queri queri processor gener tree algebra oper tree repres algorithm process queri system graef iter model order model construct languag introduc algebra oper locat phase ffl string output list url document string string ffl path read list url return list url access path url match path regular express ffl featur output list url document catalog entri featur equal paramet featur translat oper transpar access ffl type extract catalog entir type type document url ffl queri type send queri translat datasourc output union data object type type translat queri select rr oper data manipul ffl url construct singleton output list url input ffl oe regular select oper relat algebra ffl regular project oper relat algebra map map ffl regular join oper relat algebra join queri process queri parser gener queri execut tree node label oper set previou section select hname document restaur document mention hotel queri translat tree shown figur figur slightli notat oper argument result data process argument result construct tree mention hotel pari restaur hotel extract restaur extract hotel hname singleton figur unoptim oper tree queri evalu oper find document reachabl home page document collect restaur oper extract specif data sourc extract oper extract restaur object data similar process hotel remain tree consist regular relat oper comput final answer html page catalog regular html page simpli inria equal time data internet optim system perform optim queri process optim section give optim note optim depend abil translat execut obviou problem execut strategi data object extract data affect perform avoid unnecessari data part queri ship translat data shown figur mention hotel pari restaur hotel extract extract hname singleton figur ship algorithm produc oper tree queri algorithm process atom gener model comput domain variabl arrai store slot variabl handl oper produc valu variabl arrai consult order build link oper node step atom case mention case export featur case case op end switch end step data variabl collect predic form op constant place argument extract oper end step rr build rest tree standard techniqu relat base relat data variabl note queri processor isol properti transact queri aspect research transact consist heterogen inform retriev aspect work establish isol properti system www translat discuss aspect translat discuss class translat interfac special case translat directli extract object format discuss implic lack global object ident translat interfac system class translat function translat data sourc address type classifi translat locat inform class translat data sourc locat type built directli translat case correspond wrapper heterogen system translat access data data sourc class translat gatewai type access respect jdbc class translat requir data sourc locat pass argument call translat translat dynam extract type data sourc class translat requir data sourc locat type pass argument encod access respect object interchang protocol type extract data data sourc translat support protocol translat interact protocol phase translat regist accept return answer base java remot method invoc system server translat regist servic url contact translat concaten translat program readi servic phase servic connect queri phase data access phase connect url translat obtain instanc queri collect argument pass object return queri argument requir depend class translat invok object result object accept gener answer object method accord classic iter model method close method invok remot queri runtim system access data open method initi queri process method return element answer close finish perform clean oper translat html document special translat provid directli system access object def format html document encod object section translat invok extract queri oper oper data sourc inspect html document special translat invok execut queri restrict scan oper inria equal time data internet select select restaur restaur figur translat construct queri object argument url html document pass option type html document encod type inform obtain document case type miss result queri object accept queri document result answer object support method close data access smoothli integr queri process compat gener translat complic sourc oracl support odbc translat sourc implement jdbc interfac odbc system invok instanc jdbc rmi translat accept convert sql queri oracl odbc server tupl accept server translat convert odbc tupl object translat instanc support method close usual oid effect translat support object ident object refer open issu heterogen environ base object model trivial solut includ oid model access translat base oid requir global oid support local oid made visibl translat interfac mandat global oid feasibl support visibl local oid support system garlic solut resolv complex issu option chosen model permit oid sourc made visibl translat interfac answer queri permit object restrict chosen answer queri object object make refer materi translat interfac data exchang format discuss section handl materi object materi object implic cycl object refer translat accept queri includ path translat accept path path express evalu runtim system busi object select restaur queri process construct submit translat translat accept path express accept queri left figur produc scalar valu translat accept path express accept queri produc restaur object queri execut restaur produc answer queri relat work current research heterogen attack wai problem integr access structur data internet research problem locat rr data sourc main contribut depend exist technolog review research open standard wrapper mediat critic review altern technolog infosleuth www queri languag import research access ontolog semant heterogen inform integr major compet standard corba common object request broker omg manag link data microsoft omg concern definit open object bu distribut corba defin aspect corba creat interfac specif code specif written neutral interfac definit languag idl ensur portabl compon data oper system network effort made develop set interfac goal enabl applic uniform access data store dbm repositori main idea benefit transfer data dbm approach consist defin extens collect interfac encapsul orthogon portion dbm technolog set collect refer kei idea approach concept compon consist independ data provid commun main queri processor set defin interfac facilit data integr minim requir function data sourc unlik odbc connect requir data provid implement sql access standard integr sourc implement interfac tabular minimum wrapper mediat system differ wide capabl mediat capabl wrapper system differ distinct wai system system assum locat data sourc type wrapper lift restrict system system provid facil locat compon mediat wrapper facil central contribut paper import world wide web repositori inform gener interest research commun design declar languag queri websql integr textual retriev structur queri model document structur kind qr minimalist relat approach web document tupl virtual document relat hypertext link tupl virtual anchor relat order queri virtual defin comput keyword match control navig start url web queri includ specif syntax semant queri languag simpl access extern unix advanc displai facil gather view mainten facil distribut inform retriev inform retriev base system indirectli relat work essenc customiz inform extract system extract structur textual document harvest exploit format common file type extract content file result summari object collect record index organ kind mediat broker provid inform retriev search record record relat object format system focu passiv document inform retriev search focu queri strictli type data structur data sourc system focu corba idl object access www protocol queri base access infosleuth inform broker domain ontolog wai handl data sourc domain ontolog extens catalog provid structur domain inform system specif techniqu identifi type translat inria equal time data internet summari result present data access internet data model introduc encod type data html document facilit lightweight publish data architectur base compon integr arbitrari support specif applic introduc type data sourc data store collect html document translat provid translat protocol data exchang catalog locat inform access data sourc queri process compon provid queri process integr compon dynam locat data sourc special type html document pair data sourc connect inform textual descript data sourc content document enabl inform retriev techniqu locat relev data sourc permit easi publish data sourc connect inform introduc queri languag declar access manipul data support construct queri languag introduc set algebra oper gave algorithm construct queri evalu tree interfac oper type translat catalog conjunct queri evalu engin result system altern www access structur data larg popul compon semant bodi user easili exchang data implement statu section describ statu prototyp implement system prototyp main queri catalog server translat compon implement collect java organ class facilit integr java applic program compil compil queri error translat program abstract machin queri execut queri execut engin program execut interpret implement stack machin stack store type integ vector data object evalu rang design oper code implement algebra oper section section interpret encount oper code rang queri engin invok perform actual evalu depend involv send request index server mention catalog server export document network document variabl translat contact extract data data sourc document catalog server implement simpl catalog store connect inform small collect data sourc catalog access rmi interfac method method invok pair argument featur select condit featur appli catalog tabl tupl connect inform retriev success call call close data stream translat implement extract data object html document encod sect differ translat consist access method read html access local file retriev file web http protocol translat support queri extract object type sourc fulli oper translat develop rr prototyp catalog url fulli function list queri exampl access acknowledg philipp comment earlier draft paper refer queri cach optim distribut mediat system acm intern confer manag data page wiener lorel queri languag semistructur data technic depart comput stanford al semant integr inform open dynam environ acm intern confer manag data schwartz harvest inform discoveri access system comput network isdn peter susan gerd dan suciu queri languag optim techniqu unstructur data acm intern confer manag data blakelei data access mass ol db acm intern confer manag data ullman mediat languag standard acm sigmod march carei al heterogen multimedia inform garlic approach technic ibm almaden cattel al object standard odmg morgan scholl structur document queri facil acm intern confer manag data page gardarin al distribut system feder object relat oa ak system solut advanc applic prentic graef queri evalu techniqu larg acm comput june object manag group common object request architectur specif qed publish omg document number edit tr gruber translat approach portabl ontolog specif knowledg inria equal time data internet william kent form singl fact ieee comput societi intern confer san februari ieee won kim modern object acm srivastava inform manifold aaai spring symposium inform gather distribut heterogen march konopnicki shmueli queri system world wide web twenti intern confer larg data page chang paepck stanford internet acm intern confer manag data alberto georg milo queri world wide web parallel distribut inform system page papakonstantin al queri rewrit mediat system intern confer parallel distribut inform system widom queri semistructur heterogen inform deduct dood page springer verlag rusinkiewicz al queri process heterogen environ ieee symposium parallel distribut de sur technic offic intern de sun microsystem java program internet valduriez scale heterogen design disco intern confer distribut comput system simon improv access data context inform acm sigmod home page technic librari web interfac definit languag gio wiederhold mediat architectur futur inform system march joint workshop metadata juli berkelei bnf specif data model definit base odmg schema user defin type interfac interfac definit interfac identifi export export export attribut identifi identifi rr relationship target identifi target identifi identifi base type type odmg support collect base type user defin type bnf specif languag queri select condit attribut attribut field identifi var identifi type var type var node var var mention var export type type var export translat translat var export sourc sourc node sourc type identifi translat sourc node var condit attribut attribut attribut attribut link link identifi inria unit de recherch inria de campu rue du jardin bp es nanci unit de recherch inria campu universitair de renn cedex unit de recherch inria avenu de st martin unit de recherch inria domain de bp le chesnai cedex unit de recherch inria rout de bp cedex domain de bp le chesnai cedex issn
HCI/551 4 novemb src research report practic approach recoveri evict variabl tice susan graham system research center lytton avenu palo california compaq system research center src charter advanc state art comput system basic appli research support compani busi object interest project span scalabl system distribut internet inform interact mobil src establish digit equip corpor test idea build hardwar softwar prototyp assess util realist set interest system complex evalu sole practic enabl investig properti depth experi short term refin design invalu long term advanc knowledg major advanc inform system includ person distribut internet perform complementari work mathemat charact li establish field theoret comput analysi geometr secur formal specif verif work explor ground motiv problem system research strongli commit commun test idea research develop commun lead improv understand research report seri supplement public journal technic note seri time dissemin recent research find seek user prototyp system common encourag collabor research practic approach recoveri evict variabl tice susan graham novemb professor susan graham work electr engin comput scienc depart berkelei reach email comput corpor work copi reproduc part commerci permiss copi part payment fee grant educ research provid partial copi includ notic copi permiss system research center compaq comput corpor palo acknowledg author individu contributor applic portion copyright notic republish requir payment fee system research center reserv abstract resid problem context debug optim user variabl overwritten creat difficult situat debugg user examin state program execut debugg debugg return comput resid problem common optim critic debugg optim code mechan deal appropri part detect variabl evict longer respond appropri user request resid determin studi recoveri evict valu appar paper present limit evict practic solut resid problem solut compil inform debugg locat binari sourc variabl debugg make copi valu variabl overwritten lost order avoid incur debugg preserv valu variabl interest user addit explain paper describ implement limit evict present measur result discuss implic thereof content introduct potenti solut resid problem limit evict recoveri implement detail measur analysi introduct difficult task debugg optim code perform find return sourc variabl user queri main problem contribut currenc data locat resid problem collect data problem currenc problem detect recov situat actual variabl user expect base examin sourc program situat optim chang order variabl assign occur discov actual differ misl bug data locat problem determin correct locat memori current variabl difficult optim frequent copi move variabl elimin store variabl valu memori resid problem recogn cope case request variabl store comput paper focu resid problem approach handl currenc problem data locat problem resid problem variabl lifetim necessarili scope point execut variabl current scope longer comput optim variabl storag locat save dead variabl compil point view dead longer comput debugg point view user examin variabl overwritten save compil evict variabl variabl evict suffic detect place inform user case variabl unavail variabl evict widespread optim program studi perform gross found breakpoint locat variabl scope evict variabl evict imper debugg optim code properli address paper present limit evict practic approach recov valu evict variabl situat rest paper organ section present discuss gener techniqu handl evict variabl debugg present algorithm solut detail section section describ implement solut section present analyz measur present section prior work evict gross present techniqu detect evict variabl potenti solut resid problem basic approach deal evict captur detect simplest method involv track variabl evict locat target program request variabl variabl debugg inform user variabl approach gross easi approach satisfactori frequenc evict probabl larg number user request receiv turn frustrat user reconstruct attempt recomput evict variabl comput problem approach begin track compon requir reconstruct variabl program requir record huge amount addit data data collect pass contribut variabl updat evict variabl receiv fact operand reconstruct sheer volum inform requir approach make impract approach advoc debugg notic variabl evict captur variabl evict place debugg store save valu special lookup valu evict variabl user request discuss approach fulli section limit evict recoveri obviou debugg captur valu evict hidden breakpoint variabl evict order copi variabl execut target program suspend prior evict control debugg debugg set breakpoint instruct evict variabl debugg pass control user hidden breakpoint breakpoint hidden free time hidden breakpoint kernel switch context give control collect return control resum execut target program high frequenc variabl hidden breakpoint requir context save variabl evict highli neg impact run time program conflict abil present evict variabl valu user impact execut speed target program minimum address cost introduc limit evict recoveri limit evict debugg hidden breakpoint copi valu evict subroutin user set control control breakpoint activ run time subroutin affect evict recoveri rest program set breakpoint user slow execut time tradeoff fair fact measur time spent servic hidden breakpoint recov evict variabl valu complet overshadow time spent servic user control breakpoint benefit approach execut target program stop control valu variabl local subroutin user examin valu global variabl argument function call stack assum compil live variabl evict valu variabl user interest limit evict recoveri subroutin user set activ control impact evict recoveri program run time minim approach limit target program execut suspend reason control breakpoint data user evict recoveri variabl current subroutin problem move call variabl argument function call similar problem exist debug core dump situat user request evict variabl debugg save fall back inform user request unavail implement detail order test implement limit evict recoveri part suit tool creat truth debug optim code tool consist slightli modifi version commerci compil develop silicon optim tool sourc program gener optim version base optim compil perform compil modifi version sgi debugg complet descript tool found focu portion relev evict recoveri modifi compil perform dataflow analysi final version optim binari order discov correct locat valu sourc variabl solv data locat problem process dataflow compil discov place target program variabl evict occur compil record inform evict locat special portion symbol dwarf symbol tabl format creat section dwarf variabl evict inform part perform limit evict recoveri set discontinu evict recoveri servic hidden servic user request evict variabl discuss turn order set discontinu evict counter subroutin execut program counter track number control breakpoint user set subroutin time user set breakpoint subroutin step check subroutin breakpoint increment request breakpoint breakpoint user set set evict recoveri subroutin time user remov control breakpoint step decrement subroutin breakpoint counter breakpoint counter discontinu evict recoveri subroutin set evict recoveri check symbol tabl find address subroutin evict variabl set hidden breakpoint address discontinu evict recoveri remov hidden breakpoint execut target kernel encount hidden breakpoint suspend execut program pass control check symbol tabl variabl evict copi variabl current locat special list maintain captur control return resum execut target program time user request variabl consult symbol current variabl present store symbol tabl variabl variabl special list check return report user variabl unavail case occur execut suspend reason control user chang frame execut program subroutin evict recoveri enabl compil consist roughli line code modifi compil perform dataflow analysi order detect locat sourc variabl evict roughli requir write modifi roughli line code ad section symbol tabl record evict inform involv write line code week sgi consist roughli line code modifi debugg count control breakpoint set remov hidden breakpoint determin variabl evict hidden separ list maintain stack frame order handl correctli store list inform maintain stack frame avg time time slowdown static dynam recoveri recoveri sec trap trap recoveri compress li perl averag tabl evict recoveri time measur point find copi variabl return user request evict variabl requir write modifi approxim line code month total effort involv implement limit evict recoveri requir write modifi line code month amount work implement familiar compil debugg code number show limit evict recoveri implement exist compil debugg moder amount effort measur analysi reason perform evict recoveri entir claim attempt neg impact execut time solut chose verifi claim time measur debugg measur run benchmark program level evict recoveri modifi debugg perform evict recoveri select set control breakpoint time measur time program execut measur import question answer long cpu execut long user wait program time measur total user perspect time obtain modifi debugg print current system time initi start execut program execut program termin differ time program benchmark includ program benchmark suit concern possibl spec benchmark program characterist repres measur program written graduat student berkelei program small program dictionari document perform line program input file data hardwar perform seri calcul determin thing cach miss group simul script test network resourc cluster algorithm result evict recoveri measur benchmark shown tabl time shown column number show time execut program evict recoveri column show execut time evict recoveri perform function number function evict recoveri shown column show differ indic time spent evict recoveri actual slowdown shown percentag slowdown column show number hidden breakpoint set number evict recoveri perform execut final column show averag time spent evict recoveri vari millisecond averag millisecond reader note measur implement hidden breakpoint context speed evict recoveri significantli code patch measur evict recoveri select subroutin set remov control perform evict recoveri select subroutin time user request expect limit evict recoveri largest percentag slowdown measur occur program short execut time program execut evict addit time spent evict recoveri rang minut glanc slowdown heavi penalti pai evict recoveri confirm nal hypothesi perform full evict recoveri cost term execut time fact easi erron conclud number partial evict recoveri impract overlook critic aspect limit evict recoveri evict recoveri perform user breakpoint set subroutin illustr import point subroutin set evict recoveri case spec benchmark singl function call million time execut individu call subroutin evict recoveri perform averag evict perform evict recoveri subroutin add addit execut time time subroutin call evict recoveri activ recal scheme evict recoveri activ subroutin user activ control breakpoint set obtain user request breakpoint servic longer fairli safe state invoc time spent perform evict recoveri complet overshadow time spent servic pass unnot user leav breakpoint activ subroutin tini fraction million time function call rest subroutin breakpoint evict recoveri perform subroutin execut normal speed perform evict recoveri subroutin time methodolog collect measur tabl addit year execut admittedli show import limit evict recoveri subroutin invoc activ control breakpoint set full evict recoveri practic limit evict recoveri optim compil produc code evict variabl scope pose major problem debugg user valu variabl debugg prepar answer user queri save variabl valu time evict requir hidden hidden breakpoint evict slow limit evict scheme reduc perform impact select critic evict valu valu evict execut subroutin user set control breakpoint implement scheme shown perform full evict recoveri term effect program execut perform limit evict recoveri practic greatli improv inform user valu variabl refer variabl interact global regist alloc symbol confer record twentieth annual acm symposium principl program januari pp debug global optim phd note hennessi debug optim transact program languag system april pp optim code phd santa practic approach debug global optim debug optim transact program languag system juli pp debugg acm sigplan notic april pp debug inform unix intern program languag special interest juli tice robust method gener variabl rang research report compaq system research palo septemb debug optim phd tech report oct tice approach examin optim acm sigplan workshop program analysi softwar tool acm sigplan notic juli pp note hennessi debug optim transact program languag system januari pp global optim program data flow acm sigplan confer program languag design acm sigplan notic june pp olsen framework debug global optim acm confer program languag design acm sigplan notic pp level debug optim phd xerox parc tr
ML/552 6 intellig diagnosi system balakrishnan vasant honavar artifici intellig research group depart comput scienc iowa state iowa abstract paper examin compar approach design intellig system diagnosi applic includ expert system reason truth mainten statist pattern classif artifici neural network connectionist kei aspect approach demonstr design system simpl automobil fault diagnosi task paper discuss domain characterist design perform requir influenc choic specif techniqu combin applic introduct decad intellig system relat applic rich russel great varieti techniqu technolog design attack problem fundament similar solut classif problem task assign input set categori respond appropri base result classif discuss manag concentr applic domain intellig diagnosi gener research partial support grant john deer foundat nation scienc foundat vasant honavar principl observ carri applic domain intellig diagnosi system extens domain diagnosi plant crop manag problem credit evalu diagnosi softwar hardwar diagnosi integr circuit troubleshoot mechan electron medic detect fault nuclear power oil wide interest intellig diagnosi explor evalu approach successfulli build system paper aim start definit diagnosi webster world dictionari act process decid natur problem examin symptom care examin analysi fact attempt explain understand diagnosi opinion base examin short scientif descript taxonom classif base diagnosi system constru capabl identifi problem examin observ symptom system dub close match produc human provid observ symptom applic desir system remedi fix problem system capabl system extens diagnosi treat delv complet discuss intellig system diagnosi diagnosi system provid set symptom measur encod system task identifi probabl explain observ symptom essenti pattern classif system task determin class categori correspond observ class repres diagnosi exampl pattern classif problem approach solut abund artifici intellig result approach design implement intellig diagnosi system kei issu design diagnosi system knowledg applic domain knowledg engin system design process refer knowledg engin construct expert system system endow abil acquir domain knowledg process autom knowledg acquisit typic machin learn techniqu evid ai offer spectrum approach intellig diagnosi depend type amount domain knowledg approach effici practic paper attempt survei major approach design intellig diagnosi system approach individu strength highlight analysi identifi possibl design hybrid system overcom drawback individu approach rest paper organ section develop simpl diagnosi problem electr system automobil clarifi element formul diagnosi problem run illustr solut problem approach drawn artifici machin neural statist method section overview approach diagnosi section examin expert system section present overview induct approach section discuss neural statist approach section conclud summari sampl diagnosi task compani manufactur automobil order provid custom servic assum compani set telephon line automobil malfunct experienc custom compani receiv call custom car engin start compani expect user problem determin problem call answer human adept automobil automobil engin start possibl wrong ignit batteri moment ignor faulti pinpoint exact expert reli util knowledg batteri faulti wont work expert user turn simpl elimin problem faulti dont work suggest user faulti batteri human prone error due person compani interest intellig diagnost system execut role human expert note call artifici system intellig behavior domain interest automobil fault intellig human expert formul sampl diagnosi problem problem assum concern malfunct failur compon ffl batteri ffl bulb ffl motor ffl ignit compani interest determin identifi problem due failur compon work bulb bad observ symptom bulb faulti simplic stipul observ event symptom ffl work ffl engin start ffl work observ diagnosi system task ascrib symptom failur list compon diagnosi problem clarifi diagnosi task overli simplifi scenario intric involv serv paper autom diagnosi overview approach object build intellig diagnost system produc similar produc expert face situat system relationship observ symptom consequ ai approach distinguish base question address scenario model domain model explicitli repres structur constitu compon organ diagnosi problem system observ behavior conflict system expect behavior task identifi system explain anomali diagnosi automobil design construct group exact model function automobil automobil design built engin start turn ignit engin start mixtur inject engin ignit electr current flow batteri ignit mixtur start model automobil failur engin start easili trace faulti ignit faulti batteri base inform function possibl exact principl diagnosi system diagnosi system de section approach practic model domain unavail model function human medic diagnosi applic typic common practic scenario reli heurist knowledg domain human expert summar knowledg form qualit principl principl codifi system system model diagnost reason human expert efficaci approach depend faith encod qualiti expert domain experi notic principl perceiv expert structur function system explicitli system behavior expert diagnost model approach practic domain underli model system weakli construct heurist diagnost principl rule thumb human domain expert expert system typic built care process knowledg engin knowledg engin refer task elicit codifi knowledg domain expert form system difficulti knowledg engin expert unabl articul reason process suffici encod form usabl expert wai approach lack combin fact diagnost rule thumb elicit expert point time lead intern inconsist evolv knowledg base simpl expert system diagnosi present section approach attempt circumv difficult task extract ifi domain knowledg expert reli larg repositori sampl case present diagnost system attempt solv problem identifi scenario repositori case unlik expert diagnost knowledg domain expert model explicitli form heurist rule thumb implicit repositori case perform system critic depend adequaci organ collect case procedur search collect case close match diagnost scenario simpl diagnosi system discuss section difficulti knowledg engin recent stimul great deal research learn system learn system essenti capabl improv perform task set experi wide varieti learn system base symbol artifici intellig buchanan artifici neural network connectionist network statist pattern recognit syntact pattern recognit gonzalez evolutionari comput detail discuss learn system scope paper interest reader refer discuss interest diagnosi applic induct learn system unlik system craft knowledg induct learn system reli abil extract domain knowledg exampl behavior case histori user report diagnosi expert induct system extract principl model relationship problem induct approach suit domain principl hard formal medic diagnosi expert nuclear wast cleanup success induct learn system includ tree section neural network section statist pattern recognit system section expert system expert system program model reason capabl qualifi specialist fairli narrow domain diagnosi heart credit system typic essenti knowledg base captur specialist infer engin mimic specialist reason process system endow addit call work typic scratch pad work memori hold problem fact provid user symptom diagnosi intermedi deriv infer procedur schemat expert system shown figur work memori infer engin user expert system knowledg base figur schemat expert system critic process expert system design task knowledg engin knowledg engin task interview obtain knowledg code knowledg base scheme typic exampl knowledg scheme expert system semant logic rule structur relat inform call inform inform part observ inform part automobil diagnosi formul domain knowledg term rule dont work problem bulb batteri rule problem bulb batteri engin start problem faulti batteri rule problem bulb batteri engin start problem faulti bulb work memori fact problem discov session consult expert user enter inform current problem work memori system match inform knowledg knowledg base infer fact fact enter work process continu till system reach automobil user problem engin problem observ part initi work memori expert system consult session infer engin mimic expert reason process work fact work memori domain knowledg knowledg base deriv inform achiev search knowledg find rule match inform work memori match simpli add match rule work memori process continu till infer mechan unabl match rule inform work memori assum figur constitut complet knowledg base automobil assum rule construct process akin knowledg user report problem dont work expert system add inform work rule knowledg base match inform find rule add rule problem bulb batteri work memori infer engin cycl knowledg base match newli ad inform work memori find rule rule requir engin start expert system queri user statu engin user respond inform engin infer arm match find rule add problem bulb work memori find match rule newli ad find infer procedur stop user experienc problem faulti bulb essenti typic expert system function expert system design daunt task expert provid domain knowledg qualit automobil diagnosi expert put relationship automobil compon depend knowledg engin work expert understand expert knowledg design good scheme knowledg base determin dont work problem bulb batteri problem bulb batteri engin start problem batteri problem bulb batteri engin start problem bulb engin start problem batteri ignit problem batteri ignit engin start work problem ignit dont work engin start problem batteri dont work dont work problem motor work problem motor figur expert system automobil diagnosi problem infer mechan work chosen rule chosen scheme knowledg base mind infer mechan infer mechan determin rule knowledg base match inform work sequenc bia factor construct knowledg base knowledg base automobil electr malfunct shown figur infer mechan discuss user report engin start infer mechan match rule add problem batteri ignit work memori infer mechan match intermedi rule gener queri user statu user respond dont work match rule fail expert system termin infer return diagnosi problem batteri ignit easi observ knowledg base dont work engin diagnosi problem batteri easili deriv rule problem infer mechan start inform engin start inform rule match deduct sequenc obtain inform inform easili specif diagnosi solut remov bia infer mechan system perform backtrack pursu infer sequenc make knowledg base complet ad complement rule deal situat dont work make behavior expert system insensit order input observ expert system distinguish base infer direct fact strategi knowledg infer techniqu paradigm case diagnosi versu synthesi case design detail treatment scope paper interest reader refer detail truth mainten system mention section truth mainten system provid approach diagnosi system heurist rule form backbon expert system illustr truth mainten system scenario partial knowledg symptom domain knowledg case essenti reason scenario make assumpt quantiti explicit knowledg event knowledg assum quantiti retract assumpt conflict newli knowledg system maintain truth infer iron contradict creat wrong refer truth mainten system atm mr invit ms bs birthdai parti person empti gift decid flower choic make implicit assumpt flower gift sound women love flower suddenli run close friend retract assumpt retract bui flower gift make mind nice pair ear instanc reason reason system unlik classic assumpt infer support specif assumpt retract knowledg base assumpt infer grow classic logic infer grow truth mainten system offer approach deal knowledg typic practic scenario tm system varieti de theoret underpin knowledg base assert retract assumpt primari function tm maintain truth knowledg base identifi resolv contradict creat assumpt newli knowledg typic perform standard approach autom program forbu de describ atm base ginsberg illustr kei idea diagnosi atm definit rule describ domain partit set common knowledg fact set shown figur explan sentenc minim subset suffici entail note read entail simpli mean hold scenario world hold explan sentenc simpli set assumpt true order sentenc true atm defin system queri return explan atm truth mainten task fact contradict fact assumpt infer base identifi retract fact safe ad atm find explan complement call explan find minim set minim set assumpt contradict fact assumpt remov assumpt retract add fact contradict function atm system easili adapt diagnosi de correspond set assumpt proper function set fact describ behavior system term compon figur formul automobil diagnosi problem assumpt fact figur assumpt fact entri correspond assumpt entri captur behavior model term compon entri simpli batteri ignit engin start initi system automat infer follow assumpt assert set assumpt user problem light complaint involv engin work correspond assert extra effort order add find explan remov minim set assumpt contradict case explan remov assumpt assert end remov assumpt diagnosi faulti motor procedur simpl principl comput observ fault make gener form impract applic comput overhead altern mechan comput probabl de possibl polynomi time algorithm comput practic approach reduc comput complex diagnosi involv level abstract focu search hybrid approach transform diagnost knowledg heurist diagnosi rule induct learn section reason system reason conceiv late primarili schank field matur detail exposit interest reader refer kolodn cbr knowledg store form case kolodn defin case case contextu piec knowledg repres experi teach lesson fundament achiev goal reason case situat experienc result action case librari store index appropri retriev case effici current experi match case set case retriev attribut input index case librari case suitabl defin similar solut situat match solut offer select case modifi fit situat step call adapt cbr system involv critic step solut critic compar contrast similar solut base solut repair final formul automobil diagnosi problem cbr system figur show initi state case librari cbr system assum case librari store case cbr refer flat memori organ memori match procedur serial run complet librari determin match input store case librari advantag organ scheme input case case case engin faulti ignit faulti batteri faulti motor compon work compon work unknown engin engin figur case librari automobil diagnosi problem situat match case solut advantag main drawback match procedur intract larg case librari index case quick search tag hash partit librari cluster parallel retriev techniqu allevi ineffici flat memori organ flat memori hierarch memori organ scheme cluster method group case similar determin cluster match item belong cluster consid find case cluster broken result hierarch organ librari typic system cluster case share featur call network altern organiz scheme cluster discrimin discrimin network major differ discrimin network network discrimin discrimin primari cluster unlik network cluster primari possibl organ librari shown figur import design total independ memori choic indic index match procedur determin match input situat store case choic indic critic effect system indic result retriev time slot indic result improp wrong match defin slot indic compon work compon work unknown case engin faulti motor case batteri faulti engin case ignit faulti engin figur hierarch case librari tree match procedur critic compon cbr decid system store knowledg expert knowledg domain heurist match rule system return match domain diagnosi heurist decid unknown condit correspond weak match ident valu correspond strong match opposit valu match heurist demonstr payoff tabl store case input case tabl typic payoff function match case entri tabl match slot input situat slot store case input case entri slot determin match case librari entri slot engin match engin total match case simpl sum match slot clarifi situat observ shown figur engin input situat figur input situat automobil diagnosi problem input match store case shown tabl case librari match tabl match input case base result match case determin match highest diagnosi faulti batteri input situat figur turn wrong diagnosi cbr system diagnosi faulti bulb system feedback system abil modifi result diagnosi time system feedback indic diagnosi fact diagnosi situat faulti system incorpor knowledg ad case shown figur librari engin case faulti bulb figur case ad case librari time cbr system problem faulti bulb note dynam addit case entail restructur librari cbr system hierarch organ memori cbr system differ significantli expert system diagnosi principl diagnost knowledg implicitli repres repositori case addit knowledg design heurist guid match procedur cbr system abil adapt domain addit diagnosi class simpli result chang store illustr diagnosi categori ad librari obviou drawback cbr system incur high comput cost classif consequ search match larg number perform diagnosi approach avoid cost add induct learn mechan section system case repositori extract gener rule cover case repositori significantli reduc size case point store except gener rule dedic parallel neural network associ memori chen fast retriev case induct learn system ai system discuss requir design incorpor qualit knowledg knowledg base process induct learn requir qualit knowledg domain provid exampl system abil determin approxim underli model task domain automobil diagnosi induct system provid exampl observ symptom qualit knowledg statement system exampl determin relationship symptom system induc classif rule order pair instanc instanc classif element set class system equip concept languag express candid class descript element mean test membership instanc class exampl instanc languag vector attribut string defin fix exampl concept languag includ rule sort expert predic logic automata accept reject domain instanc encod observ symptom class repres problem induct learn learn suffici accur descript concept class suffici repres set exampl possibl essenti reduc search problem identifi class descript suffici close approxim criteria search guid search concept space induct learn system differ term choic instanc concept search bia set exampl provid user enabl induct system determin classif rule call train set toi diagnosi automobil compani set train exampl report user problem shown tabl chosen encod train entri simpli mean record case automobil electr problem fail work engin problem start work problem faulti bulb entri observ case fail problem due faulti entri tabl serv train induct system determin classif rule set rule assign instanc symptom diagnosi class system induc classif classifi includ train abil system accur classifi hitherto unseen exampl call diagnosi problem assum work engin start contrari realiti assumpt made illustr alter natur discuss engin diagnosi bulb batteri motor ignit motor ignit tabl automobil diagnosi problem work compon main argument favor induct system train induct system exampl test system unseen shown tabl expect reason diagnosi faulti ignit faulti bulb engin tabl gener abil classifi input train factor affect gener abil induct includ number statist distribut train search bia emploi topic ongo theoret research detail discuss relat question scope paper interest reader refer buchanan pointer current literatur topic restrict discuss simpl exampl induct learn system diagnosi applic simpl class artifici neural network connectionist elementari statist approach section discuss system detail tree induct method classif rule express form tree tree consist leav class intern node repres test symptom term branch outcom test simpl diagnosi problem view tree shown figur faulti bulb engin faulti batteri faulti motor faulti ignit faulti bulb faulti motor engin figur tree automobil diagnosi problem denot work salient featur approach procedur construct tree train exampl describ tree construct process tree classifi fresh exampl start root evalu test classifi branch outcom process continu till assert belong class repres input shown tabl classifi input perform test repres root check work input dont follow branch tree test engin start input branch reach leaf node leaf node correspond diagnosi faulti input problem due faulti batteri notic diagnosi explain proper function work batteri faulti inconsist incomplet inform train set entri train set offer diagnosi problem classif rule infer induct system good inform provid train inconsist avoid cost result produc system depend long train set contradictori exampl train sampl valu attribut assign tree classifi train exampl correct tree object induct determin tree classifi train exampl high gener accuraci quinlan algorithm version occam razor gener attribut mediev english william idea roughli set observ simplest theori model adequ explain observ tree simpli mean set procedur reason simplest tree correctli classifi train set algorithm method construct tree procedur work determin branch attribut gener idea select attribut yield maximum amount inform technic term shannon develop inform classifi train exampl find small tree larger tree correctli classifi train set small tree advantag smaller tree fix set train greater gener abil small tree correspond simpler classif rule lead reduc comput cost classif examin candid comput branch provid maximum gain process build complet tree explain classif problem calcul simpl approach easili extend handl multipl class demonstr automobil diagnosi expect inform question requir classifi input shown log log number exampl train set belong class class attribut input valu root expect inform requir tree root defin number exampl train set belong class class attribut inform gain branch step tree construct process comput inform gain attribut attribut maximum inform gain test node tree clarifi automobil diagnosi problem provid train exampl tabl problem attribut function statu problem output class faulti ignit calcul inform measur problem label class ignit denot number train exampl belong class belong class belong class exampl class motor expect inform classifi train equat log log log log calcul expect inform attribut equat log log log log similarli determin rule thumb maxim inform end engin test root node repeat process partit train set left tree construct root node procedur lead easili compact train set figur engin faulti bulb faulti motor faulti ignit faulti batteri figur tree determin process obviou advantag tree approach induct learn extrem transform result tree set rule sort expert system make algorithm circumv tediou knowledg engin design expert system branch tree give engin start dont work faulti batteri approach fairli robust toler noisi incomplet data reason limit compar infer procedur abduct tree faster execut approach construct tree expert domain drawback tree construct algorithm remedi document extens construct algorithm seek minim cost risk task diagnosi test equal riski case medic formul worth explor artifici neural network connectionist network connectionist network artifici neural network massiv highli interconnect network simpl comput element neuron attract connectionist network stem massiv abil adapt modif comput potenti reliabl perform presenc failur compon input neuron typic repres pattern vector case binari binari vector neuron comput simpl function input transmit output neuron connect output link varieti neuron function practic commonli sigmoid neuron set paramet modifi learn commonli paramet weight weight neuron repres weight vector case linear output input pattern input link vector dot product case threshold sigmoid input held constant weight call threshold bia neuron function list mean exhaust choic neuron function wide rang possibl exist comput power network depend function comput individu neuron architectur network number neuron neuron discuss limit network network connect graph direct focu paper diagnosi task involv tempor network adequ input pattern vector repres point euclidian space refer pattern train set made pattern linearli separ exit weight vector threshold neuron neuron correctli classifi pattern train set shown figur neuron implement hyperplan pattern space defin train set linearli singl threshold neuron classifi entir train set correctli definit linear separ easili extend multipl pattern class network comput element threshold capabl implement arbitrarili complex boundari deal separ train set separ linearli separ class class figur exampl linearli separ function comput capabl pattern classif neural network depend architectur function comput individu set paramet weight design neural network pattern classif task involv determin network architectur type neuron paramet weight valu typic accomplish combin design knowledg induct learn network honavar parekh research learn neural network algorithm algorithm modifi weight fix network architectur essenti entail search set weight enabl network classifi sampl train set correctli fundament optim varieti optim method simul determin weight popular learn algorithm form search chang modifi paramet direct neg gradient suitabl defin error measur respect paramet exampl reader refer order approach learn paramet modif fix network accept set paramet yield desir classif fact exist paramet space search optim algorithm find desir set train set linearli optim search algorithm find set weight correctli classifi train set singl threshold neuron ensur choic network architectur adequ learn classifi train research develop gener construct algorithm attempt find network classifi train set parekh construct neural network algorithm obviat choic network architectur potenti yield network superior gener properti bia minim suggest occam restrict simpl network illustr kei concept figur show neural network automobil diagnosi assum procedur gener weight network describ procedur engin faulti bulb batteri motor ignit faulti faulti faulti figur connectionist network automobil diagnosi problem construct perceptron learn network assum input produc output notic network input understand compon input neuron output neuron network correspond diagnosi categori faulti faulti faulti faulti ignit output neuron label faulti bulb interpret connectionist network problem due faulti output mean compon quickli work neural network diagnosi system problem surfac present tabl involv observ engin dont input base neuron appli input network figur obtain output threshold threshold similarli determin network output output node output produc network neuron ignit input observ correspond diagnosi possibl wrong valid diagnosi input mention pass input train network classifi unseen sampl demonstr gener abil fairli limit rosenblatt perceptron learn rule network figur learn rule equat weight vector neuron time step discret repres desir obtain output neuron vector repres input valu neuron learn rate perceptron equat train network threshold unit train process proce cycl train present turn comput network adjust network weight equat weight network shown figur determin learn rule hebbian learn rule hebbian learn simpl equat ij ij weight input unit output unit number train pattern system ith compon engin ignit faulti bulb faulti batteri faulti motor faulti figur connectionist network hebbian learn train output neuron applic train interest observ network figur produc output indic problem batteri closer diagnosi produc input correspond situat work network figur produc output assert wrong bulb ignit diagnosi circumst network figur produc indic wrong automobil expect human expert simpl network figur demonstr gener network figur interest import point gener drawn rel gener abil algorithm base toi gener capabl combin neural network learn algorithm depend varieti factor includ repres train set match complex classif task complex network razor neural network offer power set tool induct learn diagnost knowledg exampl repres set exampl potenti advantag includ abil toler limit amount abil handl miss potenti drawback unlik case expert system behavior hard understand relianc numer comput involv larg number weight techniqu extract knowledg learn neural network form techniqu incorpor prior domain specif knowledg connectionist network develop knowledg varieti form number research investig techniqu initi network knowledg form proposit rule open possibl varieti hybrid scheme combin expert neural approach statist pattern recognit system statist pattern recognit system offer induct system assum object domain interest distinguish base set pattern typic make pattern vector space complex object instanc attribut induct task case involv analysi statist distribut pattern vector class train set pattern vector class membership class probabl distribut space attribut valu pattern vector train set distribut estim train sampl easili classifi assign sampl class pattern vector sampl popular techniqu applic theorem theorem determin likelihood sampl belong class pattern vector likelihood train exampl estim probabl occurr class condit probabl repres rel frequenc occurr sampl pattern vector class probabl determin sampl pattern vector simpli assign class domain system input sampl pattern correspond input assign class correspond illustr kei compani user problem attribut faulti remain user problem due faulti due faulti due faulti motor compani denot batteri bulb ignit motor wm prefix appli symbol compon frequenc engin work design automobil estim case histori assum probabl input observ denot engin prefix interpret indic compon equat probabl work bayesian infer final automobil diagnosi instanc batteri faulti wont construct probabl choic quantiti perform user report problem dont work work engin start system expect provid diagnosi problem system work rule calcul similarli arriv clear equat system input observ due faulti bulb simpl scratch surfac term illustr principl probabilist infer uncertainti number addit issu dealt practic implement system perform system ideal comput probabl symptom result diagnost test problem comput condit probabl problem special case desir condit probabl distribut comput polynomi time algorithm approxim comput condit probabl work practic dean broad rang tool develop effici probabilist reason call belief network dean russel necessarili statist techniqu reason uncertainti includ fuzzi relat method statist approach outlin reli probabl repres set sampl probabl constitut valuabl ai tool design diagnosi advisori system summari discuss ai literatur rich vari approach design intellig diagnosi advisori system mean offer broad survei kei technolog order paper chosen limit bulk discuss approach wide success design intellig diagnosi advisori hold area section summar approach section term implement diagnosi system base approach choic ai approach adopt applic influenc greatli form avail domain knowledg kind case human expert expert system approach feasibl provid human expert articul knowledg reason methodolog experienc knowledg engin codifi expert knowledg knowledg base infer mechan expert system support form programm individu test valid result expert system main drawback convent expert inabl adapt situat chang time knowledg base expert system substanti complet redesign domain diagnosi time result design automobil engin larg expert system difficulti ensur consist knowledg base piec knowledg ad approach circumv difficulti knowledg engin involv approach diagnosi truth mainten unlik expert system typic heurist knowledg elicit domain system make explicit compon function depend system obviou potenti drawback approach accur model system diagnosi typic reli form system fault task find intract practic requir limit system find fix number model level abstract reduc search candid possibl includ compil diagnost knowledg carri model heurist rule thumb sort encod rule expert neural network process induct learn event knowledg engin approach design intellig diagnosi system turn system mimic human expert observ behavior system induct learn system capabl system circumv knowledg engin store librari case retriev criterion human expert match case face input situat unlik induct learn system build compact model domain main drawback store larg repositori case search match sophist memori organ dedic parallel hardwar effect system depend critic similar metric heurist find match make reason system adapt includ learn mechan essenti delet modifi store case function feedback experienc user monitor perform system combin approach expert system induct learn system interest induct system requir set repres call train util build model neural statist relat observ requir extens past assum exist gradual built induct approach build intellig diagnosi system tree offer simpl power approach induct learn tree train classif procedur effici simpli involv tree root leaf node base attribut comparison intermedi node path unlik neural network statist tree easili understood human user simpl transform tree set rule sort expert system artifici neural network offer attract approach induct learn domain suffer noisi measur miss valu attribut input pattern classifi intellig choic suitabl neural network paradigm learn design input requir experi creat problem numer natur diagnosi problem symbol ignit symbol valu start necessarili map symbol entiti valu numer quantiti natur map input major impact speed comput learn classif gener abil result network except neural network model network paradigm requir complet retrain network problem domain addit diagnosi neural network lack facil explain human diagnost statist typic variant construct induct exampl share advantag neural network probabl estim train exact calcul probabl train set intract simplifi assumpt made approxim algorithm practic neural reason process statist classif system difficult understand typic user discuss singl ai paradigm adequ meet design perform requir met broad rang diagnosi applic approach design system toolbox consist varieti includ expert neural statist method interest hybrid system sun build strength multipl ai paradigm acknowledg armin parekh comment insight suggest earlier draft paper refer read knowledg acquisit palo morgan kaufmann neural architectur queri process intern journal microcomput applic draft depart comput iowa state neural memori architectur content storag recal tech depart comput iowa state iowa artifici intellig theori practic redwood pattern classif scene analysi john wilei expert system design develop macmillan publish compani de build problem solver mit press syntact pattern recognit applic englewood introduct statist pattern recognit academ press neural network learn expert system mit press logic foundat artifici intellig palo morgan kaufmann essenti artifici intellig san morgan kaufmann algorithm optim machin learn syntact pattern introduct addison weslei intellig hybrid system west john wilei fundament artifici neural network mit press adapt natur artifici system mit press learn system integr strategi page artifici intellig neural step principl integr san academ press gener learn structur process gener connectionist network inform artifici intellig neural network step principl integr san academ press algorithm learn oxford press reason san morgan kaufmann genet program mit press digit neural network element machin learn san morgan kauffman artifici intellig hybrid neural network expert system kluwer genet algorithm data structur evolut program theori methodolog induct learn machin learn artifici intellig approach palo tioga structur method pattern recognit springerverlag overview page advanc topic artifici intellig machin theoret approach palo morgan kaufmann mathemat foundat learn machin palo morgan kaufmann construct neural network algorithm pattern classif tech rep depart comput iowa state probabilist reason intellig network plausibl infer san morgan kaufmann systemat introduct expert system knowledg problem solv method program machin learn san morgan kaufmann intellig artifici intellig modern approach englewood dynam theori learn comput peopl cambridg press goal understand erlbaum mathemat theori commun bell system technic framework combin symbol neural learn page artifici intellig neural step principl integr san academ press read machin learn palo morgan kaufmann machin machin learn artifici intellig approach palo tioga introduct knowledg system palo morgan kaufmann comput architectur integr symbol neural process kluwer element artifici intellig common lisp comput scienc press pattern learn thought englewood artifici intellig
HCI/553 4 tree thread chat marc smith jj collabor multimedia group microsoft research microsoft wa abstract chat program instant messag servic increasingli popular internet user basic issu interfac data structur form chat limit util formal interact group task discuss thread text program design address defici current chat program standard form chat introduc ambigu interact number connect turn repli thread chat present solut problem activ support basic structur human solut introduc interfac design challeng usabl studi show pattern interact thread chat equal possibl standard chat program keyword chat comput mediat synchron persist human comput human interact introduct chat increasingli popular form commun commerci servic provid america onlin network internet relai chat provid myriad chat room fill million peopl dai instant messag program msn increasingli popular billion instant messag exchang dai aol billion msn form commun cell phone wireless handheld comput make mobil messag cell phone short messag system servic copyright associ comput permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copyright compon work acm honor abstract credit permit copi post redistribut requir prior specif permiss fee request permiss public acm fax byron lo angel hall charl young drive lo ca rise dramat chat stai chat program popular inform compani bring chat busi world chat evolv past twenti year remain poorli suit hold complex discuss innov chat problem number chat system commerci internet softwar compani integr varieti graphic standard chat alter chat organ exchang messag posit make chat easi comprehend system recent chang underli structur chat discuss core problem chat describ wai guid design thread chat addit report result lab studi test usabl thread chat contrast standard form chat eighteen small group engag task discuss challeng design thread chat suggest futur direct improv system support persist interact compar chat spoken chat form commun close resembl spoken interact contrast spoken chat poor manag organ convei resolv floor control conflict studi chat varieti field share focu challeng ambigu chat introduc normal mechan social interact analysi sociolog studi structur ordinari spoken seek wai improv chat studi natur occur reveal peopl suit fine ordinari techniqu maintain spoken coher understand spoken turn structur govern set simpl rule organ turn talk exchang group peopl sack al argu turn valuabl commod requir orderli alloc social organ presenc suggest turn mean alloc affect rel economi simpl peopl sustain spoken wide varieti topic parti talk time interrupt overlap occur transit speaker commonli occur gap overlap common chat organ turn order arriv central order turn construct undermin techniqu peopl organ coher result inclin exchang short messag ambigu order make chat poor tool knowledg store reduc meet present detail idea potenti transform constraint economi spoken interact posit wai inabl listen peopl speak time long limit number turn spoken chat restrict spoken commun person construct messag read quicker listen system spoken discuss coher product standard chat program properti spoken system offer guidanc design text chat ca direct attent improv chat structur system exchang chat messag thread chat present solut problem support synchron form structur found asynchron thread discuss board usenet system usenet vast number discuss board web site creation extens discuss tree messag turn link system predominantli form asynchron interact delai hour dai turn common system suffer problem discuss complex idea develop time link messag repli thread modifi structur make accommod synchron asynchron core problem text chat research root sociolog studi identifi address major issu standard chat program find lead identifi main flaw exist chat lack link peopl chat program present messag make hard differenti speaker high turn particip chat room problem number system address issu form chat client provid wai associ color font peopl system awar presenc peopl room time improv visual visibl particip receiv inform reaction listen mean turn alter likelihood wrong indic chat system great deal social presenc system address issu erickson address problem present graphic design repres activ peopl applic peopl intuit recent activ lack granular present reaction lack visibl chat system transmit turn user press enter kei system transmit messag unix program form chat garcia result process messag product separ messag transmiss chat chat sporad rhythm fulli form turn pop singl moment produc unfold manner chat lack avail surveil spoken peopl highli sensit small variat time declin invit peopl slightli delai begin turn delai project user origin assessor downgrad alter assess order maintain agreement peopl connect turn quickli assess gap speaker project turn head listen recogn project talk unfold delai chat result type difficulti user leav room easili misinterpret delai encourag user type addit turn modifi initi turn start topic wait garcia found time sequenc distort introduc standard chat system meant portion chat turn clear prior turn flow chat explicitli present stream time result interleav turn chat flow chat text separ vertic stack parallel track text enter user displai turn complet color band side displai user began type long messag enter text displai color continu slide left displai track clarifi sequenti order provid link turn larg group mean link turn separ track difficult associ chat circl approach direct chat circl present user color circl expand amount text enter user circl slowli shrink size text fade time turn visibl present size circl view lack histor compon turn evapor time result applic altern histor visual vertic time line cross mark line indic time size turn wai altern form flow chat share limit msn messeng commerci product partial address problem type bottom window allevi problem provid binari indic solv problem user type enter kei press lack control turn posit work coordin relat shape mean base locat techniqu accomplish spoken interact undermin chat standard form chat posit turn base time enter kei link turn repli assum attempt result messag type adjac intend write garcia standard form ownership floor turn point race begin finish newli fit recent emerg turn twist set rule begin fit turn turn displai prefer short turn press return kei order secur floor extend complex materi frequent chat boi work interview skill conduct notic jame scott enter turn simultan turn fit initi turn turn immedi jame turn conduct fit turn turn fit prior turn user make turn scroll find candid peopl interest procedur time consum result transcript chat demand effort read address design expect slower interact rate typic found chat slower rate user greater certainti turn occupi posit craft short express concurr sequenc problem synchron lack record social context chat room social space develop social histori chat room publicli content evapor scroll histori buffer lack persist mean chat space social histori group media web creat durabl artifact chat room chang result activ log note result transcript problem dai month review chat log chat turn tenth clear attent particip turn intend repli time cue miss histori log turn sequenc make log ambigu record problem address includ timestamp chat reconstruct event chat room timestamp implic record chat obstacl workgroup busi process mean chat program demand full remain user user maintain awar find difficult catch thread chat thread chat address problem histori lack social turn sequenc standard chat room thread chat depart tradit chat number wai bridg gap thread asynchron discuss synchron chat thread chat user interfac displai figur chat turn structur similar microsoft window explor interfac file system hard disk kei element structur turn organ turn structur call thread grow size proper thread chat elimin possibl sequenc turn link directli turn intend respond turn drag drop figur thread chat user interfac user chat top portion window particip inform displai bottom figur thread chat turn properti dialog turn permiss peopl view modifi turn correct locat turn edit delet user click turn respond type press return complet turn user begin enter placehold messag user return kei entir messag visibl turn displai user bold font font fade grai recent ad turn stand featur import thread chat structur turn order arriv point return turn mark read click repli cursor arrow kei turn repli count number repli unread turn beneath displai select room node top chat room enter text creat highlight color background turn typic major topic distinguish turn tree structur thread chat user abil branch longer pai attent user discuss branch longer concern longer pertin addit turn ad thread count unread child turn increment bottom thread chat window inform particip inform includ time number entri time exit basic statist number type turn displai statist persist session user remain list present mark inform provid histori context chat room thread chat automat label turn question answer question mark found text turn tag repli question tag number question answer turn track social account pane turn drag drop place tree possibl thread chat turn permiss properti base extens unix model permiss access click turn author determin repli delet extend permiss author turn edit text turn author peopl modifi owner turn higher tree overrid person repli person specifi set person overrid person permiss origin turn user retain power overrid permiss turn repli includ power delet move entir thread locat person start big branch power thread privat chat middl public public discuss select group possibl interrupt mean user enter turn determin repli text test thread chat thread chat design address kei problem standard conduct user test design success proper thread chat turn intend expect thread chat support topic coher standard chat user maintain coher sequenc turn easili transcript thread chat discuss easier comprehend transcript standard chat room turn longer found standard chat room peopl rush turn type thread chat turn word charact fewer repair statement made expect particip produc fewer turn thread chat compar plain chat balanc level particip peopl thread chat standard chat peopl frequent abandon turn finish enter turn chang context thread chat context reason abandon turn effect true slower methodolog particip recruit lab studi test thread chat particip group eighteen team due eleven group peopl particip receiv free microsoft softwar product time particip chat program past comfort graduat high intermedi comput user particip recruit pool term occup pool men averag ag standard deviat particip chat program thread chat chat program creat microsoft research virtual world group order chat program minim order effect particip told compani recent interview candid job open task chat minut rank candid order hire prefer task repeat time chat set job posit particip uniqu inform singl particip correctli rank candid chat group member thread chat program group start room popul initi introduct review qualif posit discuss candid discuss candid discuss candid final thread made guid discuss agenda busi user ignor user studi result particip answer varieti question reaction chat program measur difficult thread chat rate significantli regular chat program earli stage prototyp core concept chat thread basic user interfac issu resolv line longer screen width automat wrap survei result reveal particip accustom chat inform discuss friend famili evalu thread chat type discuss thread chat intend busi discuss realist futur test thread chat field trial develop longer period shift focu system asynchron task perform lower subject rate thread chat receiv contrast standard studi show user quickli adapt interfac perform hire task differ significantli chat program hire task design correct set candid rank assign score rel distanc correct solut highest score task point thread chat group averag score plain chat group averag score differ found account demograph variabl type level experi chat program level particip score task chat program thread chat affect process group reach group thread chat fewer turn slow fast chat program std dev median standard thread total standard thread total standard thread total tabl number turn slow fast chat room regular chat program thread chat room averag regular chat room averag differ regress equat control demograph thread chat program strongest predictor number turn account varianc fewer turn thread chat peopl longer turn case averag standard chat turn word long averag thread chat turn word differ thread chat reduc ambigu introduc standard peopl enter coher turn mean partial deriv parent turn friction thread chat interfac simpli drag speed score task show thread chat user equal complet task fewer turn balanc particip examin question equal level particip group member type room standard deviat number turn peopl room measur equal particip chat room number group standard deviat thread chat room standard deviat standard chat room standard deviat user studi introduct hei test test review qualif posit prepar organ document kei contact coordin cover basic main person commun manag tea job list major point job interview dont sound correct anna good math number excel graphic abil sound anna hit major kei point web develop central hub offic mark great conflict resolut skill import main interfac manag team member anna peopl peopl skill discuss candid anna organiz good pa rt miss make skill good level good commun skill good posit warrant strong organ commun anna good fit anna peopl skill organiz skill excel unmatch good candid discuss candid show creativ meter excel verbal commun good visual graphic skill mark good peopl skill mark make skill posit confid show peopl skill good interest team convinc readi stop view mark le applic note mark william web good math number fair good desktop process comput mark good candid posit make steve im discuss candid show good word skill fair peopl skill excel make good peopl upset show excel make skill peopl skill doesnt sound peopl person note show excel peopl person easili upset tech commun great fair commun thing arent smoothli line wo rk excel learn note show good excel creativ conflict resolut skill fair doesnt good runner candid posit final base gui feel candid job ey back id anna good base experi conflict skill job anna good commun skill kei posit im readi steve anna good anna time start vote interview dont steve type skill fair np mark steve mark im pick ms wont invit back hire anna eric afraid type mark offici mark mark total answer normal question max thread user studi introduct world follow line modifi text respond larri discuss add repli wild cascad chat subject sound good peopl skill click thread review qualif posit qualif feel peopl skill requir im sharon daniel store manag sharon good candid write skill improv encourag dont indic daniel math skill im inclin vote sharon sharon good conflict resolut skill good manag materi list eric thought miss scott agreement candid creat singl thread discuss sharon graphic art talent benefit compani thought move hire sharon give offer test period motion prefer posit floor clerk eric choic explain jame choic candid eric math skill requisit job store conflict resolut skill top prioriti daniel sound eric point sharon job assist store motiv bye daniel daniel math skill arent math skill arent note good math skill jame larri sound good scott discuss candid discuss candid discuss candid final topic total answer normal question max thread figur variat thread structur gener user trial differ balanc level particip thread chat room logic question balanc level particip thread chat due slower gener faster gener fewer combin base type split particip median group tabl displai number turn made fast slow type chat room made fewer effect greater faster explan phenomenon method interact thread chat significantli diminish advantag fast standard chat room standard chat interact loop read press read press thread read text longer locat interact loop read hand move pointer turn repli press return type speed longer import variabl rapidli gener turn thread chat room verifi gom model fast gener turn thread chat significantli reduc result sequenc larg number repair turn document garcia longer faster made fewer turn thread slow made fewer turn code turn count number repair user studi introduct understand prefer im instant messeng tin review qualif posit make start stuff commun app start ill motion commun commun rate steve good peopl skill excel develop skill show organiz skill fix chat vote linda sheet start linda good sheet beer rid make end easier rid linda id vote wouldnt discuss thing steve show web skill sheet joyc excel web sheet steve show excel web sheet vote steve mail fax easier easier make dial easi discuss candid guess start doesnt graphic strong posit joyc candid joyc lead discuss candid steve doesnt technic posit commun im joyc show candid steve candid guess chat ea chat hard watch steve stuff steve guess work guess time chat program read talk moment imagin thought steve commun rate commun sheet steve excel shell st smile place fall good peopl skill mine desktop orient commun im lost gui chat steve im lost discuss candid joyc final final time gui time web stuff winner steve fix thread chat practic dont iv driver total answer normal question max thread explor hypothesi thread structur group made extens thread structur support thread chat averag turn turn deepest grow depth averag depth turn reproduc small overview room creat trial illustr rang variat wai thread examin room log show particip expect properli place occur standard chat room softwar support mainten norm topic user user feel joyc user oop click question particip thread structur creat extend turn repli seri turn intent frequent user choic order user elimin joyc lack visual graphic art level user final linda joyc discuss user studi highlight area thread chat improv user feedback identifi singl point focu problem thread chat place screen follow scroll track jump move ey screen figur contrast standard chat singl point focu materi tree thread requir frequent scan search turn standard chat user fix gaze bottom screen miss user suggest address awar sound incom frequent request featur user differenti speaker text user report thread chat sustain standard support make process task assign strongest follow discuss thread idea easier answer question post inform make easier respond thread easi follow chat string built stick review candid scroll manag screen close section edit messag move section noisi style plain version chat report difficulti manag follow thread multipl lead line topic pai lost standard chat natur user felt access histori log essenti poorli organ standard form chat time review earlier line scroll screen difficult current discuss review previou import rememb chat paper thread chat easier chat basic interfac remain unchang thread chat address problem standard chat pertain busi applic user test thread chat demonstr peopl easili adapt interfac subject rate system complet task standard chat found area thread chat improv improv usabl thread chat requir research overcom obstacl present materi recent ad distant branch minim qualiti displai turn ad locat investig applic user reorder thread provid manag real estat devot thread combin automat branch control close oldest turn thread problem attent manag significantli mitig direct develop includ creation altern view chat highlight dimens tempor order research question exist effect thread chat number repair statement test readabl result thread chat transcript acknowledg special implement thread chat plan execut studi ken rest microsoft usabl test coordin team recruit schedul particip studi doug microsoft usabl setup oper support team assist microsoft usabl lab refer lead line microsoft research virtual world group instant chat work pc magazin januari visual januari social social persist design acm confer human factor comput interact organ comput mediat commun colleg classroom qualit ey understand turn system synchron comput mediat commun research languag social vol histori enrich data prototyp polici inform volum pp gom famili analysi comparison contrast acm transact pp manag virtual cooper conflict comput commun edit john featur turn shape john heritag atkinson structur social studi analysi cambridg electron social issu internet relai chat media inform strang interact manag internet relai human commun research vol simplest systemat organ chat circl acm confer human factor comput altern interfac chat annual acm symposium user interfac softwar technolog journal
IR/554 5 seek crawler topic perform abstract srinivasan school librari inform scienc iowa iowa ia topic driven crawler complement search engin target relev portion web topic driven crawler exploit inform topic underli context paper extend previou research design evalu topic driven crawler compar crawler harder seek highli relev target page find explor import aspect crawl strategi studi perform crawler strategi depend number topic characterist base notion topic authorit result reveal topic gener obstacl crawler tend perform target page cluster displai perform topic target highli authorit categori subject descriptor storag inform search storag system problem control tree search strategi gener term web design metric keyword topic driven topic link lexic topic characterist introduct topic driven crawler import complement web search engin search engin serv gener popul web user contrast topic specif crawler permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee august finland copyright acm pant filippo menczer depart manag scienc iowa iowa ia activ inform crawler underli search engin design fetch snapshot web topic driven crawler design target portion web relev trigger topic made topic driven influenc crucial previou work evalu framework test number method evalu perform crawler fair limit memori resourc limit previou research case studi metric page reli similar crawl page seed page simplifi crawl problem crawler start relev page goal assess crawler challeng context defin target set relev page select seed start random page distanc target assess crawler abil seek target page limit previou research topic test pool treat alik test set crawler strategi topic result averag perform score test set topic kind summ approach typic studi evalu previou effort understand topic driven make progress learn differenti topic relationship perform topic specif featur illustr point figur displai perform trend crawl algorithm topic type search algorithm batch link chosen crawl potenti link reassess base adapt distribut algorithm attempt identifi number link follow parallel place greater emphasi exploit evid potenti merit exploratori plot repres crawl sequenc end page fetch repres perform measur recal relev set topic section graph rel stand crawler depend crucial topic view work section detail crawler recal recal topic onlin write web page crawl topic auction search page crawl figur differ rel perform crawler topic topic onlin write web auction search intuit level case topic gener interest exploit benefici predict crawler topic exampl intrigu motiv research explor clarifi topic specif issu goal studi influenc topic characterist crawler strategi aim discov method usefulli topic crawl begin long aim identifi topic featur select crawler strategi topic seed url target url identifi topic open directori previou research yahoo dmoz commerci content ran breadthfirst crawl main dmoz categori identifi page children categori node leav extern link deriv topic topic repres type inform deriv leaf page term identifi topic leaf page dmoz hierarchi form keyword basic concaten topic dmoz tree path root leaf extern link form target concaten text descript anchor text target written dmoz human form descript mention comparison previou research goal assess crawler context tabl topic characterist lexic link gener page page point topic keyword target page iti target page target page averag averag score target iti score target page page similar page neighbor page difficult crawl problem treat url seed target url set page relev assess human editor seed select random page neighborhood target page target top inlink return googl turn top inlink set level neighbor page maximum size target page topic uniqu inlink page level select random form seed url topic note defin seed target url absenc broken link exist path maximum length link seed page target page path seed set target definit target page assess crawler base abil find page target page topic directli connect sourc dmoz leaf form semant unit target relev set topic characterist seek quantifi topic characterist hold potenti posit influenc crawler perform kei underli retriev identifi topic featur deriv web begin explor topic topic authorit topic measur base lexic link base featur distinct characterist summar tabl illustr subsect gener classif hierarch case topic higher tree gener lower level definit context web research goal gener topic broad interest larg set larger number interest relat web page unit gener interest topic specif point view gener topic instanc interest properti case crawler differ accentu pai attent topic assess topic gener estim size set wai search topic directli search engin number hit return estim averag number hit return queri topic search fast note repres topic keyword describ dmoz syntax requir keyword present defin lexic gener ast kt keyword topic hit set return search engin queri stand averag estim size set inlink number link point topic repres target url googl altavista inlink target page averag number inlink target url estim gener gener topic greater interest possibl larger number link point number inlink function pagerank estim consist view link lu link queri url set target url topic estim close knit relev page topic interlink set relev page start target page topic assum relev gener estim wai lexic obtain comput averag lexic similar target set order pair target page topic cosin target page repres term weight term page topic ln frequenc term page measur link examin link featur target page specif focu neighborhood target page forward link target page count fraction point back target set measur target perform crawler identifi web commun nu set outlink target page specul topic high link potenti make easier crawler stai vicin relev page true crawler local search strategi topic homogen languag target page easier search problem due tighter lexic criteria relev authorit pair metric pertain authorit target page featur assess context lexic link base neighborhood kleinberg good author page good hub point good hub point good author kleinberg algorithm definit direct graph web page author hub score treat target page topic root set expand base set includ page outlink root set page page top inlink root set return includ base set algorithm appli graph base set algorithm calcul averag author score target url author score averag author score call link repres concentr author target page topic infer link base neighborhood lexic approach root set expand submit dmoz descript target page altavista collect top page retriev set averag author score target page call lexic calcul authorit target topic infer lexic neighborhood evalu framework architectur refer reader previou work detail flexibl effici framework carri crawl experi crawler topic keyword seed url topic page fetch compon url ad list call frontier crawler crawl max page page crawl end sooner frontier empti timeout web download larg page chop retriev kb protocol http redirect filter static page content stale link yield http error code remov found remain page stem constrain space resourc crawler algorithm restrict frontier size max paramet buffer full crawler decid link replac ad crawler perform measur relev assess perform crawler algorithm point topic crawl measur fraction target page visit point section method evalu dynam behavior crawler plot averag recal function crawl page recal point time account relev page visit summar dynam perform singl scalar comput averag posit relev page crawl posit target page set page visit crawler algorithm topic note crawler fetch relev page posit page default max page measur averag crawl posit akin notion expect search length adapt crawl task averag posit averag user wait time relev page order retriev relev page crawler algorithm base larg set crawler evalu previou work number preliminari test select crawler repres present boltzmann crawler algorithm belong distinct crawler frontier size limit max buffer url crawl durat limit max page page topic breadthfirst simpl crawler frontier fifo crawl link order encount note frontier crawler add link crawl page breadthfirst algorithm shown figur crawler link estim criterion select crawl gener iter batch top link crawl select complet crawl page crawler decid batch figur offer simplifi pseudocod crawler link select lexic similar keyword sourc page link estim relev link breadthfirst foreach link visit link doc foreach outlink figur pseudocod breadthfirst crawler foreach link visit foreach link doc score foreach outlink figur pseudocod crawler page cosin kp kq repres fetch sourc frequenc term cosin similar defin equat analog equat local comput term frequenc place link minimum similar score remov frontier order exce max buffer size test version origin kei differ crawl increasingli explor preliminari experi outperform number perform target page seed crawl assess explor prove advantag target seek task pagerank origin pagerank intend combin content base criteria rank retriev set document fact pagerank googl search engin recent pagerank guid crawler assess page qualiti previou work evalu crawler base pseudocod figur reader refer detail pagerank crawler implement foreach link visit foreach link link doc score foreach outlink figur pseudocod pagerank crawler pagerank crawler found competit due minim exploit topic context variant crawler call improv origin emploi combin pagerank similar topic keyword sort frontier url number topic keyword present parent page visit crawl content page point sort frontier url estim pagerank function figur infospid infospid adapt popul agent search page relev evolv queri vector neural net decid link follow evolutionari approach fit measur base similar local select criterion origin algorithm simplifi implement crawler modul variant call schemat illustr figur adapt agent consist vector keyword topic neural net evalu link neural net input keyword singl output unit agent estim link current page text surround link input unit neural net receiv count frequenc keyword occur vicin link weight give import keyword occur link neural net comput link base agent stochast selector pick link page agent receiv energi proport similar queri vector page constant cost charg fetch page agent similar signal improv link estim adjust neural net weight main differ origin infospid algorithm agent move newli select page function foreach agent theta cost theta visit agent agentlink theta offspr figur pseudocod infospid crawler turn true condit determin stochast base probabl δ differ similar current page keyword vector temperatur paramet energi level determin agent surviv agent di run energi reproduc energi level pass constant threshold theta reproduct offspr receiv half energi offspr keyword vector mutat ad keyword vector term frequent current document mutat infospid uniqu capabl adapt search strategi base clue captur page version main improv continu valu function measur relev binari relev function refin notion potenti score link crawl frontier anchor text surround inherit score ancestor influenc potenti score link figur show pseudocod crawler paramet repres maximum depth rel import inherit versu neighborhood score implement set close detail al gener iter batch top link crawl select complet crawl page crawler decid batch test version call higher mean explor strategi foreach link visit foreach link doc foreach outlink score figur pseudocod crawler result analysi figur offer dynam view perform crawler plot versu number page averag topic mention goal compar crawler challeng problem topic url target seed axi repres recal measur topic target page summ analysi make gener observ highest averag recal achiev page limit note construct seed set path maximum achiev recal level crawler significantli breadthfirst perform measur small differ statist significantli baselin poor perform suggest pagerank global measur short topic combin lexic cue focu popular poorli correl topic relev explor crawler outperform exploit counterpart larg margin explor topic driven crawler close inspect dynam behavior versu reveal explor afford long term advantag exchang short term penalti exploit lexic link clue compar detriment perform recal perform statist breadthfirst strictli local behavior limit abil priorit page explor analyz influenc topic crawler rough lower bound expect maximum recal base construct seed set averag recal breadthfirst page crawl figur recal versu page crawl crawler recal averag topic error bar correspond standard error alex tabl rank correl perform topic featur valu ρ bold ρ α critic valu spearman rank correl test α level ten case refut null hypothesi monoton relationship perform topic characterist note lower valu lc ρ mean perform topic featur valu vice versa correl perform topic characterist defin section pair featur authorit measur section averag crawl posit section distribut measur correl measur end rank correl coeffici ρ tabl show valu ρ crawler topic characterist statist support monoton relationship lc topic featur ten case draw data lexic gener hurt crawler ρ explan document term crawler pai creat noisi signal lead crawler affect observ crawler rank lexic gener rank figur scatter plot rank versu rank linear regress rank shown label point highlight topic figur perform topic high link case algorithm obviou local flavor higher correl consist capabl spawn agent target page observ perform topic high link authorit lesser perform topic higher link gener consist bia popular page noteworthi result consist obtain replac perform metric averag recal sequenc page crawl yield result similar tabl illustr weak correl figur show scatter plot perform versu lexic gener strongest observ correl linear regress plot point topic figur confirm intuit section gener topic effect rel perform crawler relat research inform retriev research understood queri characterist affect classic studi saracev kantor queri characterist explor larger context includ studi user search method found number relev document retriev higher question low low high complex presupposit beaulieu al correl search outcom queri characterist examin aspect topic type mitra colleagu explor effect queri strategi differenti queri base initi retriev perform activ research type queri user input search engin author studi million queri pose excit search engin find languag web queri distinct great term uniqu kei differ research dmoz topic keyword start clue crawl user provid question underli retriev seek exploit topic featur deriv web research arena topic featur seldom explor except topic featur examin order elabor observ perform provid explan result chakrabarti al pick twenti topic yahoo garden mutual fund discuss detail order elabor crawler mechan explor notion cooper competit domain bharat experi topic differenti present result full topic set special rare popular topic determin retriev set size altavista lexic amento al experi set topic homogen repres popular entertain topic menczer belew test crawler topic limit corpu analyz depend perform depth topic eb subject deeper topic specif paper present studi topic driven web offer systemat attempt topic base lexic link base gaug influenc featur target seek perform crawler kei result explor crawler displai perform crawler perform specif perform posit correl topic perform breadthfirst posit affect correl perform topic characterist norm perspect topic analysi suggest complex crawler infospid reason target page high author topic specif infospid edg topic relat tightli cluster web commun note result outlin paper strongli depend choic perform measur recal metric figur strict limit small set target page give credit crawler find relev page target set target set arguabl subset true relev bia extend relev set identifi addit potenti relev page topic descript pool page crawl crawler rank lexic similar topic descript smart pagerank select top page rank hybrid metric obtain combin rank measur final comput recal crawler topic page relev set result yield interestingli pictur figur achiev recal extend relev crawler outperform breadthfirst true relev set unknown develop perform measur remain open direct research limit studi low observ correl coeffici pictur clearer altern perform metric research obtain noisi measur rank correl statist test monoton relationship perform topic complex relationship explor work understand mechan authorit affect perform studi studi abil crawler reach specif relev target page introduc main topic characterist authorit futur research plan develop test altern addit topic featur gener directli express size target homogen target set topic analyz dimens time ag ag frequenc updat crawl experi paper short crawl user wait onlin remain determin extent result appli longer million page refer hill predict expert qualiti rate web document proc acm sigir conf research develop inform page sheffield interact experi proc text retriev confer bharat improv algorithm topic distil hyperlink environ proc acm sigir conf research develop inform page brin page anatomi hypertextu web search engin comput van den dom approach web resourc discoveri comput page effici crawl url order proc intl world wide web practic nonparametr chapter page cooper expect search singl measur retriev effect base weak order action retriev system journal american societi inform de bra post inform retriev world wide make search feasibl proc intl world wide web gile effici identif web commun proc acm sigkdd confer knowledg discoveri data page august najork measur search engin qualiti random walk web proc intl world wide web page ur algorithm tailor web site map proc intl web saracev real real user real studi analysi user queri web inform process kleinberg authorit sourc hyperlink environ journal menczer adapt retriev agent heurist neighborhood inform discoveri proc intern confer machin page menczer belew adapt retriev intern local context scale web machin srinivasan evalu web crawler proc annual intl acm sigir conf research develop inform bucklei improv automat queri proc acm sigir conf research develop inform page nelson effect queri characterist retriev result trec retriev test proc annual confer canadian associ inform porter algorithm suffix strip salton smart retriev system experi automat document process englewood saracev kantor studi inform seek retriev ii effect journal american societi inform saracev search public queri journal american societi inform
HCI/555 4 nexu open global infrastructur applic fritz uw alexand kurt marku januari abstract due lack gener platform basic servic reimplement applic cooper applic difficult achiev common platform paper present platform solv problem infrastructur base comput model region physic augment virtual object show virtual object make integr exist inform system servic system easier platform support interact comput model real world integr singl model global content introduct gener idea augment area augment world scenario requir relat approach architectur nexu platform futur work introduct lot inform bound spatial actual organ geograph manner poster hang sign stand electr door open peopl speech heard locat physic object possibl directli manipul bound locat object basic matter fact fundament problem altern experi uniti inform locat handl inform organ natur learn inform system applic account spatial data user object organ inform spatial exist inform system applic center area car fleet geograph inform system applic earli prototyp augment realiti applic base ubiquit wearabl comput show spatial awar applic limit lack spatial sensor infrastructur hand widespread scalabl platform spatial inform system hand subject ongo research technolog gp cheaper smaller develop subject articl exist spatial awar applic develop spatial function integr sensor applic area applic share compon interact set format spatial inform open global platform spatial awar applic platform differ function superset common mechan exist orient futur applic interact intend environ platform small mobil devic carri user devic spatial wireless commun facil devic emploi user interfac platform user requir platform similar attribut made www platform big offer servic offer system scale huge number user inform research commun provid similar success www expect applic larg inexperienc user rest articl organ section present gener augment area augment world section scenario illustr advantag platform support spatial awar applic section state requir section overview exist approach relat field spatial inform access section outlin architectur platform fulfil requir section conclud short overview futur work gener idea main object nexu platform provid infrastructur support applic infrastructur base comput region physic augment virtual object region virtual object experienc nexu platform call augment area augment area consist object geograph instal nexu system inform content comput intern augment area refer augment area model show model lot advantag convent virtual world model augment area close integr global interconnect augment area augment area augment area limit area citi insid consist physic object virtual object virtual object perceiv user nexu physic world object exist physic world object locat spatial chang time depict figur augment area overlap includ figur augment area physic world object interest augment area model repres object note typic includ user person interest locat augment area import attribut spatial posit object case mobil object posit determin locat global posit system activ badg system augment area model applic profit user current account posit detect object meet user current posit import inform cyberguid posit number object augment area interest intellig vehicl highwai system featur augment area model kind term augment notic nexu automat propag model model state trigger action augment area manipul virtual control board scenario section exist inform system world wide web easili integr nexu infrastructur virtual object virtual object anchor augment area access extern system servic kind virtual object scenario section figur illustr central role augment area model connect link client exist inform augment area figur augment area model augment world addit servic isol nexu platform offer integr singl augment area global make integr easier augment area model uniform access applic interfac offer nexu platform due uniform relationship area easili ascertain exampl relationship distanc area area characterist level detail compar model access nexu applic applic easili switch model tourist guid system switch global citi model local museum model user enter museum plan realiz mechan offer integr servic forc user run isol applic citi guid museum guid separ integr tourist guid system advantag uniform format augment area model model integr global time integr model immedi access applic integr work similar integr institut provid regist compon section easi integr model nexu world grow fast reach widespread coverag scenario section present scenario demonstr potenti nexu applic scenario show confer system assist visitor larg confer big talk workshop augment area model system cover build confer includ visitor room build import item overhead projector nexu platform control devic send control signal determin current posit visitor indoor infrar track system inform compon confer system visitor access inform confer conveni manner base virtual inform tower concept virtual locat place interest visitor close access inform attach mobil devic entranc hall offer inform confer agenda workshop talk held room room provid specif inform workshop held room visibl area arbitrarili assum visitor listen talk talk visitor interest question access inform offer person point point perform graphic user interfac mobil devic conveni point devic note kind inform access support world wide web www hint inform bs search bs homepag dai talk find confer system invok navig applic guid current locat confer system control technic devic confer room virtual control board offer author person manipul virtual object control devic locat light volum speaker system nexu platform augment area model propag augment area send control signal physic devic task scenario navig perform gener applic common underli augment area model plug due space limit show augment area model cooper clear model confer build confer system cooper model citi confer order provid inform citi confer visitor requir identifi requir nexu platform idea requir classifi main challeng nexu platform cope nexu deal mobil user physic world object support mobil wireless commun small mobil comput person digit assist notebook nexu usabl larg varieti augment rang area cover nation area cover offic lead heterogen support network technolog track system extend nexu big effort support technolog nexu adapt dynam user network bandwidth aspect heterogen servic inform system access nexu input output devic point devic mention applic augment area model nexu scale larg number user larg number object store augment area model nexu store inform user ensur person inform user author user relat approach singl aspect nexu platform found system interest research area present promin concept discuss relat differ nexu import aspect nexu mobil comput commun basic function technolog develop mobil comput ubiquit ubiquit weiser assum comput abund futur small comput devic abil commun integr object everydai enabl give inform interact user main concern ubiquit comput develop suitabl hardwar nexu support object repres comput model inform attach object comput interfac nexu place virtual object real world inform access intuit inform number system term knowledg posit user provid inform area nearbi background inform answer queri specif trigger action inform account applic built specif posit technolog activ badg system parctab develop offic environ contrast system special model real world suitabl singl environ type applic geograph inform system navig function store retriev data associ geograph object provid geograph inform system combin map perform spatial search object type distanc map connect devic determin posit program algorithm calcul locat navig system geograph inform system provid level nexu model level detail abstract combin geograph inform system support virtual activ object updat real world model augment research area augment realiti goal integr virtual real world special enabl user move augment world typic applic system worker power line water pipe run wall build system interact augment world rang augment realiti applic restrict hardwar progress made wearabl comput contrast exist augment realiti nexu limit applic model level detail combin exist approach spatial inform access collect locat inform creat model world singl platform develop applic concentr applic function bigger audienc address cooper applic architectur nexu platform main nexu platform manag augment area model present uniform access combin augment world model applic interact cooper intend singl provid standard interfac basic function aim reflect architectur platform augment area model lot distribut number node ensur scalabl model store current state stationari virtual object updat augment area model augment area perform platform client queri current state model subscrib event notif nexu platform occur virtual object link lead specif item inform space digit librari servic author modifi delet virtual object set link inform space figur architectur nexu platform architectur platform shown figur function compon extern applic function nexu platform access augment world model standard interfac model link real world gp provid inform state object real world case sensor coupl client interest posit environ platform chang state real world object case standard interfac order ad basic basic servic includ support commun adapt applic compon handl commun compon nexu platform commun effici transpar object stationari mobil comput flexibl definit manag resourc notifi applic appropri design applic react resourc local part augment area model store node nexu platform manag compon local node singl comput cluster comput store retriev spatial data effici updat characterist special store mobil stationari object stationari object build virtual object link modifi moder client servic mobil object updat frequent posit fast distribut distribut perform logic central set compon control access distribut replic part model store discuss distribut compon platform mobil stationari comput present part found compon locat manag continu map object area node inform store queri event servic provid api applic servic transpar access complet augment world model queri subscript event forward node applic client servic modifi virtual object introduc link item inform model manag tool provid function modifi delet virtual object link inform space link virtual object organ group similar content belong provid user specif view model creat distribut cach knowledg inform store cach nexu account inform frequent access area suitabl prefetch techniqu reduc delai access inform support disconnect oper compon platform deal import issu secur privaci global control access handl distribut futur work paper present gener idea platform basic function applic platform applic creat easili reli common infrastructur platform maintain specif model area real world user access inform servic spatial posit real world object combin singl model augment world model applic interact cooper outlin architectur platform discuss relat approach global coverag augment inform servic integr easili page world wide web outlin applic platform attract applic similar world wide web project evalu aspect nexu idea build prototyp prototyp experi measur usag characterist load base experi project version nexu platform build refer maguir locat awar mobil comput intern confer page australia ieee global posit theori practic telo rapid prototyp mobil cyberguid case studi annual intern confer mobil comput network page usa acm analysi distribut scheme manag locat inform technic agent augment softwar agent meet real world intern confer multiag system page japan aaai press fundament challeng mobil comput fifteenth acm symposium principl distribut page usa school comput carnegi mellon acm parctab mobil comput system fourth workshop workstat oper system page usa ieee comput applic ieee workshop mobil comput system page santa usa ieee augment realiti wearabl comput activ badg locat system acm transact inform comput scienc issu ubiquit comput commun
Agents/556 1 design gener agent model franc mt jan treur vrije universiteit depart artifici intellig de boelelaan hv netherland abstract paper introduc formal design composit gener agent model agent model abstract specif applic unifi formal definit model weak agenthood templat pattern larg varieti agent type applic domain type composit develop method desir design agent model conceptu logic level serv defin structur refin instanti larg varieti specif agent illustr agent shown describ unifi manner larg number agent architectur literatur introduct term agent wide varieti rang simpl batch job simpl email mobil intellig mission critic system system air traffic varieti applic agent concentr specif implement agent descript agent implement depend chosen implement platform exist agent architectur compar inform manner principl design descript agent conceptu logic level make difficult compar agent applic agent show varieti perform multitud abil vari significantli nwana attempt made defin common weak notion agent introduc notion explain detail section design agent applic gener model gener model distinguish specif type specif agent task specif type gener model applic structur design acquisit conceptu model applic base gener structur model obtain formal defin conceptu section describ composit design gener agent model conceptu logic gener agent concept process relat weak agent notion predefin gener agent model abstract specif applic refin core design larg varieti agent type applic domain model design basi experi applic diagnosi restor electr network jen negoti load balanc electr composit develop method desir design agent model illustr agent section discuss model obtain descript level design larg varieti agent architectur occur literatur section paper conclud discuss weak agent notion weak notion agent introduc refer literatur weak notion agent notion requir behaviour agent exhibit type autonom behaviour call reactiv proactiv social behaviour autonomi relat agent interact process perform agent full control agent jen wooldridg defin autonom behaviour system act direct human control action intern mean agent request perform jen wooldridg act request li exampl autonom process process control system missil guid nuclear reactor control softwar monitor incom email obtain attent displai icon incom email oper system process exhibit autonom behaviour term agent agent exhibit flexibl consid intellig agent intellig agent defin comput system capabl flexibl autonom action order meet design object intellig requir flexibl respect autonom mean intellig agent exhibit behaviour agent exhibit behaviour react respond inform environ jen wooldridg defin behaviour perceiv environ physic collect respond time fashion occur simpl system exhibit continu receiv inform current air pressur respond inform adjust dial behaviour defin simpli act exhibit behaviour initi behaviour difficult requir type behaviour agent defin weak agent notion behaviour occur simultan behaviour respond incom inform opportunist manner goal initi incom inform behaviour resembl behaviour behav inform receiv environ behaviour mean call behaviour elabor comparison behaviour behaviour found agent exhibit social behaviour commun agent jen wooldridg defin social behaviour deem artifici agent human order complet problem solv agent exhibit social behaviour commun human user dial commun amount control mechan commun control steer gear human direct speed set user gener agent characterist weak introduc section provid mean reflect task agent perform autonomi relat concept plan reactiv social abil relat concept world agent commun interact extern world abil commun agent interact extern world reli knowledg agent world agent model gener gener respect process task gener respect knowledg structur gener respect process task refer level process gener model abstract process lower level specif model respect process model number specif process lower level process abstract type refin call gener respect knowledg refer level knowledg gener model abstract specif knowledg structur refin model respect knowledg specif domain refin knowledg lower level knowledg abstract explicitli includ type refin call instanti design gener agent model composit approach entail process knowledg agent perform composit relat compon knowledg structur process composit process composit gener agent model identifi process agent highest level manner obtain agent process section identifi process level abstract section interfac inform type identifi process defin inform link task control knowledg section address composit relat process level abstract identif process includ abstract level interfac inform type process model gener agent model depict figur process involv control agent monitor evalu goal process maintain model task compon process control process involv manag commun agent task compon agent interact manag maintain knowledg abil knowledg task compon mainten agent inform process involv manag interact extern world task compon world interact manag maintain knowledg extern world task compon mainten world inform process control world interact manag agent interact manag agent mainten world inform mainten agent inform cooper manag figur process highest process abstract level agent agent specif task specif task agent design inform model compon agent specif task exist task model structur compon compon manag distinguish task relat social process negoti compon discuss address detail jonker characterist weak agenc discuss section relat compon percept environ perform world interact manag percept mainten world inform mainten agent inform percept inform obtain action world manag world interact manag social action manag task agent interact manag cooper manag task cooper manag explain chapter perform process initi task process autonom behaviour model interfac inform type number gener inform type distinguish input output gener agent model gener process agent interfac inform type agent agent capabl commun agent receiv incom commun info send outgo commun info agent observ perform action extern world inform type observ info model observ perform compon extern world inform type observ result info model incom result observ inform type action info model action agent perform tabl overview interfac inform type inform type express commun inform inform type subject inform type agent commun direct process input inform type output inform type agent incom commun info observ result info outgo commun info observ info action info tabl specif interfac inform type agent interfac inform type compon agent interfac inform type list tabl agent compon process control belief inform agent extern input inform model inform type belief info belief info world belief info agent output compon process control includ characterist inform type compon agent interact manag world interact manag addit inform compon agent interact manag receiv incom commun receiv agent forward directli compon agent interact model input interfac inform type incom commun world agent model input inform type belief info process input inform type output inform type process control belief info characterist agent interact manag incom commun info characterist belief info world interact manag observ result info mainten agent inform mainten world inform characterist belief info outgo commun info mainten info observ info action info mainten info agent info agent info world info world info tabl specif interfac inform type gener agent model output gener compon agent interact manag includ output agent commun extend mainten info mainten info agent mainten info world inform world agent compon mainten agent inform receiv inform agent belief input interfac belief agent made compon output interfac compon mainten agent inform compon world interact manag receiv characterist input inform type observ result receiv agent forward directli compon world interact input interfac type observ result inform agent world agent inform type belief info output gener compon world interact manag includ output agent observ extend mainten info obtain observ world agent compon mainten world inform receiv inform world belief input interfac belief world output interfac compon mainten world inform composit inform exchang inform exchang agent inform link depict figur observ result transfer inform link observ result info wim input interfac compon world interact manag compon receiv belief inform compon mainten world inform inform link world info characterist compon process control link process info wim select action observ transfer output interfac agent inform link observ action compon mainten world inform receiv observ world inform compon world interact inform link observ world info commun world inform link commun world compon agent interact manag epistem inform mainten world epistem world transfer input belief info world compon world interact agent interact manag process inform link world info world info aim world info compar compon mainten agent inform receiv commun inform compon agent interact inform link commun agent info observ agent inform link observ agent compon world interact manag epistem epistem agent output compon mainten agent input belief info agent compon world interact agent interact manag process inform link agent info agent info aim agent info commun info observ result wim process control process info wim process info aim agent interact manag agent info aim world info aim world interact manag world info wim agent info wim observ info ast agent task control process info commun agent info observ agent info action observ info ast commun info ast commun info ast process info mai observ world info world info agent info info commun mainten agent inform commun world info observ action mainten world inform agent specif task figur inform exchang highest process abstract level agent composit task control task control highest process abstract level agent compon link made agent mean process asynchron inform arriv knowledg composit number gener knowledg inform applic domain independ knowledg structur instanti domain applic inform type provid ontolog knowledg process express inform type provid ontolog languag knowledg base inform link inform type specif concept inform type inform type sort object function relat inform type figur inform concept repres figur icon inform type depict figur inform depict figur design inform type inform type short explan belief info inform belief agent agent world incom commun info inform commun agent receiv agent outgo commun info inform commun agent decid perform observ info inform observ agent decid perform observ result info inform observ result agent obtain action info inform action agent decid perform characterist inform characterist mainten info inform rememb agent tabl inform type highest level knowledg abstract inform type level knowledg abstract section inform type highest level knowledg abstract inform type inform type highest level knowledg abstract highest level knowledg inform type distinguish repres gener agent concept belief inform world commun inform observ observ perform obtain observ action inform inform rememb notion lower level knowledg model inform type list tabl composit relat inform type inform type tabl inform type lower level knowledg abstract inform type info mainten specif inform inform world inform agent inform type directli gener inform type domain specif inform gener inform type fulli gener model domain specif inform type defin instanti specif domain applic inform type action info gener inform type action perform domain specif inform type domain action figur specif action domain applic gener model similar action info action perform domain action figur action info composit gener domain specif inform type inform type observ info gener inform type ob perform domain specif inform type domain inform type observ result info gener inform type observ result truth domain specif inform type domain inform type incom commun info gener inform type incom commun truth domain specif inform type domain inform type outgo commun info gener inform type outgo commun truth domain specif inform type domain inform type domain world agent hierarchi inform type world inform type world sort world info shown section inform type agent inform type agent info sort agent info element inform type hierarchi defin sort world info element agent info element sort info element figur section inform type mainten info world mainten info agent gener inform type resp mainten agent truth domain specif inform type resp agent compar inform type composit defin belief inform inform type characterist gener inform type agent characterist domain specif inform type domain agent characterist standard type assumpt epistem requir info target info defin specif variant inform type world inform agent inform separ inform type agent info inform type agent info sort input atom variant type defin similarli gener inform type inform type world agent includ inform type world info agent info sort world info element agent info note gener model inform type world info agent info refer instanti specif domain applic gener inform type observ action gener inform type observ result enabl agent express statement observ result applic observ agent automat receiv observ result extern observ initi agent decid specif observ transfer perform observ extern world receipt select observ world execut observ transfer observ result back agent agent perform activ depend goal observ request agent observ gener inform type ob observ select agent express relat observ figur gener inform type truth indic defin sort sign object po neg inform type observ result info element ob perform observ info element observ result observ result sign figur gener inform type observ inform type make statement process observ state world contrast statement world statement observ result pressur world state pressur sensor give wrong inform statement pressur true world statement observ result pressur simpli observ note observ pressur mean observ pressur statement form observ result pressur express inform type describ world statement pressur adequ structur express statement statement statement statement call statement statement form subject statement call object level statement gener inform type action perform enabl agent reason figur action perform perform action figur gener inform action perform incom commun commun info element sign outgo commun commun info element sign agent agent figur gener inform type commun gener inform type commun social agent receiv incom commun gener outgo commun gener inform type commun depict figur inform type make statement process commun contrast statement statement told pressur world state pressur agent simpli truth statement pressur true world statement told pressur simpli told note pressur told pressur similar statement statement commun statement info world world info world info element sign agent info element sign info agent agent info figur gener inform mainten mainten world info element belief belief sign figur gener inform belief gener inform type intern inform inform commun agent extend updat belief world agent inform receiv select prepar store inform world relat inform type depict figur gener inform type belief maintain inform world figur gener inform type agent characterist express characterist declar manner domain specif inform type knowledg composit section refer occur domain specif inform type applic gener model concentr instanti inform type specif applic domain domain specif knowledg base gener inform type simpli complet domain specif inform type tabl short explan specif inform type short explan world info express specif inform world agent info express specif inform agent agent identif identifi agent domain action describ action agent perform domain agent characterist express characterist proactiv reactiv gener knowledg base tabl domain specif inform type knowledg specif applic strongli depend applic domain part knowledg formul domain independ make domain similar characterist gener knowledg base agent model specif applic depend relev applic gener model specif knowledg applic simpli left gener knowledg base gener model knowledg base observ result extract kb compon world interact manag identifi observ world inform observ agent inform gener knowledg express agent blindli trust observ applic knowledg ad condit similarli gener knowledg base commun info extract kb part gener model knowledg base compon agent interact manag identifi commun world inform commun agent inform gener knowledg express agent blindli trust agent commun applic knowledg ad condit relat agent architectur applic agent agent architectur type applic design agent architectur formal form conceptu level inform pictur natur languag explan aim develop agent architectur place work piec softwar specif type applic design gener agent model introduc paper aim gener agent model meant unifi design model weak formal manner high level abstract success criterion aim possibl instanti agent model obtain formal specif design model varieti formal agent type agent behaviour unifi design descript obtain enabl comparison agent architectur conceptu formal defin level evalu aim place group agent architectur hand agent architectur design inform formal refin hand exist agent develop specif applic formal specif design context research report conceptu design level structur evalu group agent architectur shown adequ mean design specif type varieti requir specif applic domain evalu group requir show adequ mean obtain compar formal descript type exist agent architectur applic design basi type agent tune specif applic domain develop structur obtain formal design model simul anim behaviour instanti gener agent model design fulfil requir pure delai social anim identifi literatur anim model pure reactiv compon instanti model associ observ action direct interact world model delai separ compon memori world addit world interact manag compon process control repres specif agent characterist gener goal obtain model specif type social compon mainten agent inform pick order anim agent interact manag gener interpret instanti negoti agent achiev load balanc electr applic load balanc electr mean flexibl form negoti made swedish electr industri precursor gener agent model develop applic compon cooper manag complex refin address evalu gener bid compon process control agent characterist impact start stop negoti agent interact manag transfer bid present instanti form compon ast instanti task balanc predict person inform agent inform broker agent world wide web applic inform agent world wide web agent model develop basi instanti design serv inform broker agent broker agent model instanti compon mainten world inform inform object broker maintain broker inform mainten agent profil user agent creat maintain agent specif task match form instanti compon world interact manag agent observ tag html page websit broker agent applic person assist support research exchang scientif paper inform broker agent model support mainten instal ontolog knowledg base commun agent mainten agent process architectur intellig websit base number instanti inform broker agent illustr domain depart store inform agent plai role inform dialogu visitor tailor background visitor lam applic architectur websit insur compani agent social simul applic base norm behaviour simul societi agent behav norm model develop norm agent type agent explicit mental interpret behaviour incorpor decid follow norm violat model design refin manner compon mainten world inform mainten agent compon mainten societi inform ad compon norm distinguish societi maintain societi inform repres mainten agent inform global form agent decid natur includ separ compon make societi norm explicitli visibl distinct person norm specif agent compon agent interact world interact manag process control compon refin norm goal plan strategi manag compon norm adopt made adopt norm strategi manag term control goal manag plan manag process engin exist agent architectur applic number exist applic conceptu design level structur start point refin gener model refin obtain formal design descript type agent diagnost restor agent electr transport manag system electr transport manag develop archon project oper applic agent technolog run control room north spain electr transport network carri electr gener site local network distribut custom manag network complex activ involv number monitor plan carri mainten fault occur applic involv diagnost monitor restor agent engin applic archon found jen agent maintain world obtain instanti compon mainten world inform maintain inform agent system socal acquaint obtain instanti compon mainten agent inform monitor incom data monitor process state obtain instanti process control task compon ast instanti obtain refin complex diagnost model diagnosi model monitor disturb progress restor process monitor model restor plan restor agent detail found jen agent base joint intent inform model cooper problem solv essenti element model dynam manag joint suscept chang due unexpect event model restrict amount detail support model implement agent specif domain jonker formal design model cooper agent architectur made refin model control commun activ agent explicitli distinguish obtain cooper agent model compon process control plan control compon cooper manag alloc commun activ involv refin jonker detail wellknown bdi architectur predecessor pr notion intent gener agent model refin obtain formal design model found treur belief environ world maintain compon mainten world inform mainten agent inform desir intent repres refin compon process case composit base compon belief desir determin intent commit determin compon compon goal determin plan turn intend goal determin commit goal resp intend plan determin commit plan determin treur agent social simul experi mice experi report social theori test simul interact type simpl agent agent limit knowledg type agent distinguish basi social social parasit agent selfish agent effect social characterist interact agent measur simul agent behaviour situat agent surviv grid piec food continu random posit welfar measur basi energi level end result simul number agent surviv societi energet food agent commun explicitli hungri agent agent social characterist assum static agent chang selfish social implic social characterist behaviour agent search intern energi level parasit agent selfish agent search food social agent danger hungri search food normal search food agent social agent give food agent nearbi experi report mice replic extend engin base refin gener model obtain type agent perform basi textual descript provid mice compon gener agent applic small compon process control world interact manag compon process control resourc goal determin plan determin compon resourc manag receiv inform current energi level resourc determin energi level basi inform compon goal determin receiv social characterist energi determin goal agent find compon characterist receiv inform energi level compon resourc manag inform determin state normal compon plan determin receiv inform compon current compon goal goal pursu current state world inform compon plan determin determin action extern world compon world interact manag interpret inform receiv extern transform inform action extern world specif action extern world execut compon defin perform compon observ inform interpret compon action execut prepar tour adept remaind section discuss gener agent model refin obtain formal design model exist agent tour machin interrap zeu ndumu adept tour machin architectur distinguish reactiv plan model layer process concurr reactiv layer formal instanti compon world interact manag agent interact manag gener agent model reaction combin input observ commun inform link world interact manag agent interact manag ad direct inform avoid model inform belief plan layer refin compon process control rule part refin process control model layer obtain instanti compon world inform mainten agent model environ maintain specif approach control control rule form entail incom outgo inform filter control rule process control mean principl layer meant connect independ order practic connect control rule compon process control confirm agent architectur interrap architectur compon plai world interfac agent kb model mental model world model agent control unit plan layer local plan layer layer formal design specif world interfac obtain instanti compon agent interact manag world interact manag design specif agent social model obtain instanti compon mainten agent inform world model mainten world inform mental model obtain refin proce mental concept refer agent concern mental concept joint intent includ cooper manag local plan layer obtain refin process cooper plan layer cooper layer compon agent interact manag world interact manag interrap model richer structur gener agent model control aspect control differ tour architectur layer connect local plan layer process involv layer situat assess compet process control situat compet involv cooper plan layer cooper refin mean control inform exchang world interact manag agent interact process control cooper manag zeu architectur messag execut acquaint planner resourc mailbox messag handler formal instanti compon agent interact manag coordin engin obtain refin compon cooper manag execut monitor planner instanti compon process control acquaint model obtain instanti compon mainten agent inform interact extern world explicitli model zeu resourc includ inform architectur adept environ process repres busi process hierarchi cooper agent hierarchi ensur commun overhead agent autonomi agent balanc agent commun interact manag modul situat assess modul servic execut modul model acquaint model modul refin modul imm refin compon cooper modul sam sm compon compon process modul sem compon mainten agent inform discuss summar process design gener basi gener agent model current futur research issu discuss design gener model gener agent model design scratch conceptu analysi agent capabl characterist main motiv compon distinguish gener agent model compon distinguish agent model domain applic agent model applic brazier base precursor import input process design gener agent model detail gener structur extract model leav domain specif element number case choic made inform type includ structur support gener model hold applic gener structur richer gener model restrict scope applic gener model design wide applic choic made limit number structur includ discuss section agent model develop gener model compon process control refin treur gener model compon process control manag refin jonker gener model scope applic gener agent model cover varieti applic discuss section gener model construct subsum larg number difficult gener model similar applic domain suitabl gener model design part gener model part remain empti remov addit knowledg structur ad addit inform link ad addit compon ad modifi current futur research current research requir engin verif agent applic inform broker agent electron commerc requir engin aim obtain formal function behaviour properti agent system compon agent found treur requir specif express gener form conjunct gener model composit verif approach establish behaviour properti system properti agent refer agent negoti load balanc electr mp intern confer distribut comput ieee comput societi pp nr formal specif case lesser intern confer mit pp extend version intern journal cooper inform vol pp lc model intern dynam behaviour bdi agent py intern workshop formal model lectur note springer verlag pp distribut schedul support call approach appli artifici intellig vol pp hs nwana dt ndumu special issu system earlier shorter version hs nwana dt ndumu intern confer practic applic intellig agent practic applic compani pp cooper model base joint intent jp mj nr jen intellig agent iii intern workshop agent architectur lectur note volum springer pp principl composit system develop ifip world comput confer inform technolog knowledg pp cm norm principl architectur nr lesper proc sixth intern workshop agent architectur publish intellig agent vi lectur note springer verlag rizzo effect interact attitud system perform van de veld jw perram agent break proc eur workshop model autonom agent lectur note artifici vol pp gener task build block expert system design ieee vol pp jen distribut artifici intellig system industri applic ohar jen foundat distribut artifici wilei pp ia tour architectur mobil agent phd thesi comput uk ia integr control coordin behaviour pp mp al lanski reactiv reason plan proc nation confer american associ morgan kaufman specif behaviour requir composit system design fj boman system european workshop model autonom agent lectur note vol springer pp nr control cooper problem solv industri system joint artifici intellig journal varga archon develop dai applic electr transport manag particl ieee expert special issu real world applic dai tj manag busi process intellig agent proc bc expert system confer uk wooldridg applic intellig agent pp wooldridg agent market springer verlag architectur intellig websit insur intern workshop cooper inform lectur note springer press cm composit verif formal analysi reactiv wp de pnueli intern workshop lectur note comput vol springer pp simul social anim behaviour ap del ali methodolog tool system intern confer industri engin applic ai expert vol lectur note vol springer pp inform broker agent intellig websit ali multipl approach intellig system intern confer industri engin applic ai expert lectur note vol springer pp jp design intellig layer approach lectur note vol springer thiel model reactiv behaviour layer agent architectur pp softwar knowledg engin vol pp dt introduct softwar agent technolog pp dt lc advanc engin distribut system intern confer applic intellig agent technolog hs practic applic appli vol pp mp model ration agent bdi architectur fike confer knowledg morgan pp anim cognit harvard nr intellig lectur note artifici vol springer nr agent survei pp
ML/557 6 comparison make criteria optim method activ robot de katholiek universiteit abstract work present comparison make criteria optim method activ robot activ incorpor posit make order maxim inform gain minim cost concentr robot move time pro con statist make strategi discuss simul result approach activ mobil robot introduct featur robot intellig deal robustli uncertainti robot equip contact forc distanc gyroscop perform robot robot decid weight futur inform gain cost make process call activ distinct made activ activ local refer robot motion veloc robot sensor paper refer strategi action requir trade robot action bring closer task complet reach goal posit action gather search surround read sign order uncertainti small time instant assur good task execut typic task activ perform structur environ uncertainti import influenc task industri robot task robot uncertain configur tool work piec mobil robot navig map start uncertain initi configur robot move desir goal configur preset vision applic activ select camera paramet focal length view angl improv object recognit procedur reinforc learn robot balanc local inform gather environ control activ activ intellig robot includ estim estim overcom uncertainti robot environ sensor estim techniqu comput system state fuse data optim control desir control charg task execut close motion execut achiev feedback control combin activ process determin input optim function cost util input control activ challeng robot sensor model nonlinear method linear nonlinear problem treat necess develop special techniqu action gener task solut depend optim criterion function weight inform gain cost relat comput load import task execut uncertainti robot environ sensor data dealt measur suppli inform system partial observ remaind paper organ section activ problem make criteria compar result activ mobil robot present section main group optim algorithm activ section termin activ problem formul activ consid trajectori gener stochast dynam system model η ξ system state nonlinear system measur measur η ξ system measur stand input vector state stand sensor paramet vector input measur function focal length subscript denot discret time state measur influenc input make distinct denot input system convent system consist control estim compon assum input intellig system adapt input estim perform activ task good perform criterion call quantifi sequenc action call inform gain gain task min criterion weight sum term uj minim expect uncertainti expect inform term cl expect cost travel distanc obstacl uj ck function polici weight coeffici give impact arbitrarili chosen design state goal configur fulli determin term uj cl comput base state attent paid goal configur intermedi time term uj cl function time step criterion minim respect sequenc action constraint xn vector physic variabl exce threshold valu threshold express instanc maxim veloc maxim steer minimum distanc action sequenc descript sequenc action wai major impact optim problem solv action ly refer trajectori deviat finit elast band elast strip optim problem reduc optim problem paramet gener present polici sequenc freeli chosen restrict form trajectori maxim maxim ad produc execut trajectori activ problem call markov process system fulli observ state partial observ markov process system measur fulli observ state system measur perform criteria relat uncertainti term uj repres expect uncertainti system uncertainti compar accuraci task complet bayesian uncertainti estim base scalar loss function probabl densiti function scalar function captur aspect function suit experi common function base covari matrix covari matrix probabl distribut state measur uncertainti estim minim correspond minim uncertainti activ action minim posterior covari matrix post fisher inform matrix describ posterior covari matrix effici estim scalar function appli minim matrix logarithm minimum invari transform state vector jacobian scale measur verifi task determin matrix smaller covari state variabl smaller minim trace unlik design invari properti measur make physic target state inconsist unit measur verifi task complet minim weight trace proper choic weight matrix render design criterion invari transform variabl unit transform special case design design natur choic depend desir standard deviat task complet scalar function direct relat task complet minim maximum eigenvalu invari transform measur make physic target state inconsist measur verifi task complet base probabl densiti entropi measur uncertainti state estim inform probabl distribut covari comput cost entropi base perform criteria entropi posterior log expect chang entropi distribut log log activ prior posterior posterior goal distribut distanc rel entropi measur good fit close expect calcul respect rel entropi chang entropi measur chang entropi quantifi form probabl distribut rel entropi repres measur distribut move translat chang entropi rel entropi distanc orient mobil robot beacon consid sequenc motion wheel mobil robot move start goal restrict trajectori optim trajectori search class harmon vector paramet obei preset physic constraint number robot trajectori gener basi refer deviat lk call orthogon robot motion deviat straight line refer trajectori linear superposit lk constant amplitud path length instant total path refer refer trajectori formul activ global optim problem robot criterion minim constraint robot steer orient posit weight coeffici form covari matrix estim state goal comput kalman filter weight cost term assum rel time total time reach goal configur modifi respect time refer trajectori weight matrix repres product normal matrix scale matrix matrix σ assum standard deviat goal configur refer trajectori depend chosen scale matrix ident matrix simul result obtain averag criterion ua kb optim interv fig modifi gener number sinusoid accord refer trajectori plot beacon beacon fig gener averag criterion ua kb uncertainti fig fig accur result goal configur obtain sinusoid accuraci provid bigger cost comput load activ robot approach beacon distinct movement refer trajectori faster inform begin modifi trajectori higher obtain trajectori gener averag criterion ua gener perform gener averag fig perform ua optim algorithm activ activ correspond constraint optim respect polici depend robot sensor constraint optim problem sequenc action restrict optim linear constrain nonlinear squar convex optim dynam robot identif sequenc action restrict optim problem structur fix finit number time step problem state straightforward reward action step goal find polici maxim reward long term optim procedur exist kind exampl due sequenti structur optim perform subsequ solut problem variabl ai iter dynam program calcul optim function polici finit infinit horizon problem polici iter techniqu similar dynam introduc howard infinit horizon system linear infinit horizon problem repres solv linear program state base search method repres system graph node correspond state handl finit infinit horizon problem tree search algorithm search optim path graph exact solut found small number state larger problem approxim solut paper address main issu activ robot criteria determin result action result action criteria term uncertainti minim inform term repres util travel path total time featur basic criteria uncertainti minim optim procedur outlin simul result activ wheel mobil robot sequenc action present acknowledg herman postdoctor doctor fellow fund scientif belgium postdoctor fellow katholiek universiteit leav academi scienc support center excel grant concert research action gratefulli acknowledg refer de experi approach advanc vol pp navig mobil robot navig uncertainti dynam proc discret bayesian model mobil robot proc int conf intellig robot mobil robot ieee tran pattern analysi machin vol pp theoret sensor data select activ object recognit state ieee transact pattern analysi machin vol pp februari sutton reinforc introduct tutori particl filter onlin bayesian ieee tran signal vol pp estim techniqu softwar artech robot motion plan control guidelin motion plan mobil brock framework integr plan proc int symp pp mathemat foundat theoret tran royal societi seri vol pp theori optim experi academ york mathemat theori bell system technic vol pp juli octob inform annal mathemat vol pp de approach trajectori optim base inform proc iro method transform mean covari filter ieee tran vol pp nation laboratori northwestern optim technolog de robot excit ieee tran vol pp dynam program princeton univ dynam program markov process mit polynomi approxim markovian ma vol pp structur assumpt comput ai vol pp survei algorithm method partial observ markov annal oper vol pp
ML/558 6 layer sensor architectur autonom robot indoor environ mobil servic robot transport task indoor environ act normal dynam environ huge number compon robot total repertoir skill high complex build respect task difficult task achiev base environ paper describ layer sensor architectur integr world model build contrast grid base approach featur base approach sensor architectur evalu modul sensor data base natur landmark kei featur sensor architectur modular portabl build extend sensor sensor avoid robot data robot introduct begin nineti expect year number independ oper autonom servic robot area product servic sector realiti industri environ guid vehicl vehicl guid magnet optic line standard practic autonom act mobil servic system system restrict follow line extrem rare research group work autonom mobil robot year mobil system transport task refer real robot toi robot scientif prototyp practic transport main reason gap realiti complex environ robot build current robot control architectur handl complex build robot oper level museum robot build dynam environ elev fire door lead special demand mobil unit todai robot control architectur handl low level drive instruct high level sensor inform process sensor handl elev fire door build integr sensor layer architectur demand mobil unit paper present integr layer sensor architectur world model consid boundari condit sensor architectur part robot control architectur control gmd ai german nation research center inform sankt robot intellig laboratori campu publish intern symposium robot autom nov pp hartmut antonio moral architectur layer literatur briefli layer sensor architectur connect robot modul behavior base modul plan modul design robot control simul robot behavior robot behavior anticip part paper due size offic build featur base approach select grid base approach successfulli museum guid lead space comput time problem build typic aspect class applic plan cooper implement autonom mobil servic robot execut transport task build react flexibl boundari environ lot type complex origin larg number compon corridor lead offic human robot dynam complex small medium infrastructur build includ fire door camera reach compon repres natur landmark reposit perman chang request user fulfil fast comfort user work environ internet browser robot save reliabl larg system numer robot support treatment unforeseen situat overcom system error paper structur section give introduct robot environ fourth section present world model base layer iii layer sensor architectur layer section conclud paper give prospect futur research activ ii ariadn servic robot team robot team consist mobil robot cm cm larg cm high mobil platform carri payload kg speed half speed left drive wheel mount center line mobil platform passiv corner ensur stabil major applic area administr offic varieti task lunch distribut schedul demand dai patrol night fig robot charg batteri equip side core robot pentium pc mhz mb ram linux control intern keyboard radio link robot manag motor optic autonom robot abil drive optic line navig prefer narrow enter elev dock maneuv robot chang autonom navig back platform rig laser front rear laser scan ¢ environ kg robot oper hour batteri charg power drain robot visit automat power recharg connect recharg batteri mission server inform time period robot unavail robot current inform robot robot batteri laser scan repres environ robot move typic build serv gener prototyp build build depart offic room corridor level reachabl elev elev door automat control robot internet radio link offic room door open human web camera floor live observ robot action world model world model spatial base layer iii hand influenc £ fig layout prototyp environ featur extract sensor robot mission hand spatial influenc select sensor featur extract algorithm spatial introduc topolog map schedul job robot plan robot behavior planner graph planner addit geometr featur map landmark recognit robot reloc implement code handl elev door store spatial refer sql includ model sql list person store email telephon number door design inform interact robot human implement user friendli interfac import spatial gener prototyp build simpli adapt build easili extend deal dynam object figur show segment spatial build section xml specif robot client server exchang updat spatial internet structur part topolog map reason layer iv corridor unambigu number corridor type offic junction elev dimens global posit list branch section express spatial relat corridor defin branch current corridor connect branch corridor branch connect branch corridor number branch definit base descript graph planner section describ geometr dimens wall format type fire door sign fig segment spatial color local materi refer telephon local free entri part gener automat floor plan ride robot corridor corridor interconnect control code elev fire door ad hand addit part describ dimens offic code open fire door elev major point intern descript gener base spatial vrml robot floor plan java applet floor plan track simul import design behavior modul predict futur iii layer sensor architectur figur show layer architectur navig behavior robot connect layer sensor architectur lower layer local navig upper layer global plan human machin interfac data layer extract raw local distanc valu ms rang layer implement physic protocol laser scanner technic descript predefin warn protect zone evalu sensor hardwar connect motor hit zone directli influenc speed calcul check rectangular zone point current laser scan situat zone number distanc valu check mean bit test warn protect field violat perman chang warn protect zone spatial visual layer reason layer iv intermedi layer iii featur layer ii data layer object object object polygon distanc real sensor virtual sensor fig layer sensor architectur guid servic robot offic environ check inform length obstacl measur euclidian distanc speed reduct indoor environ reduc number distanc valu laser scanner bit process time complet scan ms yield scan distanc valu reflect point relat angl convert local coordin lowest level model robust real time capabl algorithm implement sensor ad level featur layer raw data detect local orient wall rectangular obstacl algorithm orient calcul offic real time featur detect algorithm base sensor data deriv layer comput featur real time mean ms orient wall posit obstacl extract kei idea corridor offic environ limit wall wall necessarili run parallel wall distanc wall constant inform order implement fast robust algorithm intent calcul width corridor offic laser scan horizont face point discret list wall le ft wall requir initi suitabl valu resolut list cm meter repres valu list collect smallest largest point index list correspond coordin effort oper list discret point left wall step list index differ wall le ft wall comput frequenc distribut differ calcul cm sensor data corridor ax wall avoid dir robot robot obstacl avoid obstacl side cm cm unavoid middl wall robot corner sensor data avoid dir end meter cm fig data algorithm avoid move end corridor frequent differ correspond averag corridor width demand width corridor compar width corridor world model door frame form local maximum frequenc distribut effort point oper comput main loop laser scan point mean list ft width corridor gb calcul orient search largest smallest list entri differ horizont list entri correspond width corridor gb figur show contrast standard polygon fit approach larger distanc point found door nich limit fit distanc point maxim error averag error local orient reloc autonom robot distanc qualiti index correct orient raw laser data transform orient previou scan calcul improv transform coordin wall repres vertic local orient robot calcul orient wall orient wall fi mobil vehicl drive center navig orient calcul point ft ft ft valu list ft inform gain simpl manner algorithm inform robot navig deviat averag width corridor occur pass list ft end corridor obstacl passag end corridor directli natur landmark robot reloc mean world model obstacl cm avoid obstacl left side sensor data wall human meter avoid dir cm cm avoid obstacl left side fig human obstacl scan sensor data wall human meter avoid dir robot cm detect altern orient immedi calcul knowledg posit left gap center distanc obstacl obtain simultan index list entri warn protect zone raw data layer verifi size obstacl robot estim hypothesi object human obstacl robot obstacl differ end corridor close fire door unavoid obstacl ariadn robot led center corridor pass fire door turn vehicl customari germani mean distanc cm wall intermedi layer interfac data real sensor inform virtual sensor model featur sensor combin layer symbol inform combin featur layer ii compar object layer iv indoor environ number import object limit main task reason layer iv plan distinguish level plan highest level larg number job schedul robot problem pickup deliveri problem time window implement approxim strategi call time consumpt job effort independ form preemptiv strategi strategi interrupt current job topolog part world model estim time wait base calcul good robot path level select consist exampl laser scan record robot navig corridor featur detect includ fig posit tracker fig view robot drive build event end plan graph latitud search topolog part world model gener path number corridor graph search literatur standard plan approach wide area lowest level list action open gener corridor base geometr descript corridor world model effort depend number object corridor equal number offic door type plan local plan interconnect plan fuzzi navig fuzzi state variabl fuzzi state variabl express navig advic corridor variabl fuzzi express strength advic visual layer import interact user machin design mainten robot skill oper gener world model simul design robot behavior addit apach web server java applet implement interfac posit track robot www realist posit robot case unforeseen situat overcom system error vrml browser eai interfac cosmo visual behavior robot user friendli system administr check live camera pictur robot reach critic area crowd person area construct work iv result concept implement test robot ariadn team robot drive test environ floor connect elev schloss gmd test data collect dai demonstr test gmd layer data rate hz distanc achiev process scan includ reliabl zone test featur extract layer ii orient posit obstacl gener data rate limit layer averag length line calcul orient environ gmd robust featur extract vari accuraci detect featur cm recognit time complex featur door includ algorithm comput time reloc robot updat driven meter contradict inform gener posit exact centimet accuraci wheel encod cm corridor inform level comput demand posit updat model limit internet access default hz paper present multi layer sensor architectur autonom mobil servic robot indoor environ layer architectur integr modul averag limit intellig spatial data base indoor environ world model evalu modul sensor data base natur landmark evalu robot data level abstract layer sensor layer level control type data exchang realiz order meet constraint kei featur sensor architectur modular portabl build extend sensor concept valid test gmd robot ariadn team futur work improv long term robust total system vi acknowledg author partner member ariadn team claudia support work refer innov technik und technisch joseph robot vol pp march symposium intellig autonom pp und forschung und sj system mail distribut servic intern pp ronald mit konolig architectur autonom mobil mit thrun interact robot applic pp fox burgard comparison local intern confer intellig robot oct hartmut antonio servic robot ecai european confer artif workshop current issu pp hartmut marku dispatch system multipl autonom servic robot applic pp hartmut fuzzi system indoor mobil robot ieee intern confer fuzzi mar pp distinguish robot intellig award michael hartmut object detect autonom informatik autonom mobil pp kautz proposit stochast proc nation confer artifici intellig portland und sick optic definit der und rs rs kenneth dan randal algorithm foundat ak borenstein correct systemat odometri error mobil ieee transact robot pp combin constraint geometr sensor intern journal robot pp gener object descript autonom robot intern symposium robot hartmut jen plan fuzzi control autonom mobil intern confer fuzzi sept pp hartmut receiv diploma comput scienc depart comput dortmund phd electr engin faculti electr senior research gmd autonom intellig system institut st germani primari research interest robot comput intellig publish paper area applic hardwar robot fuzzi logic control member gi dr receiv robot intellig award fuzzi system indoor mobil robot navig phd award thesi german ai institut antonio moral receiv comput engin graduat student robot intellig laboratori comput scienc depart hold de de person en current research interest field control sensor vision guid grasp
HCI/559 4 integr model person emot lifelik charact elisabeth martin patrick steve thoma rist dfki abstract grow number research project academia industri recent start develop lifelik agent metaphor highli commun strong argument favour charact interfac fact make humancomput interact commun style common dialogu earlier work area concentr develop anim present verbal comment textual graphic output interfac empir studi encourag reveal strong affect impact persona suggest simpli embodi interfac agent insuffici agent incorpor deeper model person directli connect concept introduct german research centr artifici intellig recent start project advanc understand fundament technolog requir drive social behaviour agent initi time catch current wave research commerci interest field lifelik charact affect user interfac presenc project intern model agent possibl affect state guid dialogu agent user project featur inhabit market place person trait modifi charact role virtual actor interact present project puppet promot idea virtual puppet theatr interact learn environ support develop child emot intellig skill project reli similar approach model emot person variat regard underli factor influenc agent emot emot person trait made observ section provid short overview project discuss affect natur detail integr model person emot lifelik charact basic concept challeng face attempt affect fact term refer class phenomena distinguish mental behaviour event affect literatur describ class motiv control state result valenc reaction object event includ make affect attribut activ valenc class affect state differenti express effect emot tend close specif event object short mood longer durat defin person complex characterist distinguish individu nation total individu behaviour emot emot interrupt redirect attent accompani consensu natur mean exist theori model person emot plai role enhanc interact captur affect phenomena entireti start point factor model cognit structur emot model clore model readili amen intent ideal suit task creat concret model person emot enhanc believ comput charact occ model emot classif scheme common emot label base valenc reaction event object light agent attitud occ model model presenc puppet determin affect state charact event environ pure descript dimens deriv factor analysi larg number peer report adject descript natur explicit model charact concentr affect interfac directli express trait offer interest possibl attempt recreat charact person trait analysi emerg social social concentr trait outgo confid agreeabl hostil complianc hostil level emot depend control influenc emot charact addit gener affect express manner easili interpret user case puppet project young person emot convei wai integr model person emot lifelik charact empir charact direct power phrase charact speak faster gestur render dialogu act depend agent emot state effect mean convei charact emot includ acoust bodi gestur facial express studi directli applic anthropomorph agent presenc clear extent appli anim anthropomorph featur charact virtual puppet theatr person emot filter constrain process select instanti agent behaviour defin specif behaviour charact emot state state convei simpli result affect occ easili deriv person trait hunger model mimic charact activ bodi state motiv drive mechan provid affect input signal role affect presenc presenc project lifelik charact virtual accompani guid visitor german research centr artifici intellig explor hypothesi explicit affect model agent guid present strategi dialogu creat natur intuit user interfac tailor individu provid user engag enhanc believ virtual charact presenc project address number specif problem flexibl integr multipl input keyboard output video devic architectur intellig adapt affect mode commun applic domain speech inflect remot develop descript languag charact base person trait easi combin comput model person emot plan techniqu guid interact lifelik charact present materi visitor local remot world wide explor possibl tailor interact individu user infer user affect state applic domain major design project requir flexibl architectur capabl cope multipl applic domain domain defin scope inform cover gener interact integr model person emot lifelik charact behaviour lifelik charact domain hierarch structur dialog topic guid thread domain presenc system run dfki entranc busi student institut virtual answer question wide rang dialogu topic cover research peopl dfki capabl initi inform introduc dialogu topic actual thread guid user model affect state agent fig screenshot presenc prototyp integr model person emot lifelik charact remot domain underli mode local domain constraint restrict bandwidth internet place addit requir system make input output resourc system intellig cope vari commun channel affect channel speech inflect longer guid portabl applic system primari role guid user user system reach lab offic remain passiv persona system advantag channel palm comput provid low bandwidth link server system updat user dfki intern signal begin meet talk portabl domain provid real challeng convei affect inform impoverish environ emot person persona system model extend ppp anim present agent architectur develop dfki number featur notabl enhanc input output modal affect affect reason engin affect state recognit gener line recent research affect comput affect inform process channel fig primari emot frozen sexual gener simpl reactiv secondari emot gener delib affect reason engin occ model sloman introduc addit class tertiari emot secondari emot reduc implement initi prototyp fig conceptu view presenc system deal affect state emot person trait weav intric web persona system emot primarili determin persona affect state express system affect output channel gestur speech inflect emot directli influenc choic phrase request reaction dialogu goal reactiv modul delib modul input classif primari reactiv affect goal driven affect mind model world model plan librari dialogu histori control sequenc control sequenc action event bodi present data anim integr model person emot lifelik charact dynam adjust persona person trait valu persona person bia motiv profil agent determin import agent goal event compar emot gener steer dialogu goal charact initi persona affect reason process roughli model input classif primari compon classifi incom action event respect agent concern store mind model dialogu histori filter event pass behaviour modul request parallel affect inform process channel reactiv modul handl persona reaction user system delib modul produc control reaction determin content structur dialogu render persona action perform output gener modul gener facial express bodi gestur output gener account persona affect delib reactiv modul annot action execut addit person trait emot label term fear gener emot dimens valenc model persona social dimens initi model persona agreeabl point peopl tend prefer base match mismatch person exact relationship unclear empir studi led conflict mean persona tend initi remain patient user question case persona fail goal focu emot event evalu respect desir user persona goal attempt infer user affect state creat charact indirectli monitor system error speech recognit compon inaccess inform server altern deriv directli syntact semant form affect acoust volum user utter role affect inhabit market place object inhabit market place investig team lifelik form sale present basic idea commun inform mean simul dialogu observ audienc project implement complet model person seller custom integr model person emot lifelik charact demonstr system design experi person role applic domain suggest inhabit market place virtual place seller agent provid product inform potenti buyer agent graphic emerg sale microsoft agent packag includ programm interfac predefin merlin enabl experi charact user possibl charact assign role merlin role seller buyer assign charact prefer interest fig fig dialog charact set system oper mode system human charact set audienc mode audienc test charact set figur show dialogu merlin car seller geni robbi buyer geni utter concern high run cost merlin plai point view present goal provid observ assum real custom fact car present mere plain fact car fact present evalu observ interest profil integr model person emot lifelik charact emot person follow approach view gener simul dialogu activ investig approach system act screen writer produc script actor distribut approach singl agent goal achiev fig car sale dialogu follow model dimens agreeabl relev dimens social interact contrast inhabit market place start fix set person user design agent person decid model emot dimens presenc valenc presenc agent address user directli human direct commun user agent inhabit market place agent emot state influenc behaviour artifici dialogu contribut account speech act dialogu particip evalu charact term person trait individu goal goal determin integr model person emot lifelik charact desir buyer told relev attribut car power miss dimens import contrast explicitli model user emot state agent presenc project aim posit influenc user emot agent inhabit market place necessarili care agent make dialogu contribut neg impact affect state agent emot agent event differ person inhabit market place essenti convei choic dialogu act semant syntact structur utter emot scenario express facial express syntact structur utter microsoft agent program tool inton convei emot acoust scenario inform system test inhabit market place reveal interest aspect import match person trait surfac characterist subject tend merlin interest comfort safeti expect robbi interest technic detail car confirm earlier empir studi show voic charact role extent role affect puppet object puppet project develop investig virtual realiti virtual puppet base theoret framework deploi avatar synthet charact child plai children distinguish master multipl role interact actor audienc main activ enact reflect process children gain basic understand emot state chang modifi charact behaviour physic verbal action social interact induc emot emot intellig skill import respect earli learn role theori mind approach similar children direct puppet action utter interact children induc charact emot state select charact action integr model person emot lifelik charact applic domain prototyp develop children ag decid model virtual child avatar set synthet charact interact figur show screenshot earli version draw transform full model stage charact design exhibit physic verbal behaviour model anim make fig prototyp scenario commun avatar charact simpl base dialogu model set utter agent equip virtual sensor effector connect virtual environ control agent architectur integr delib reactiv plan foster mention emot skill provid distinct set interfac child control charact behaviour bodi control interfac full control movement select charact mind control interfac chang charact emot state behaviour direct actual motion pattern similar system integr model person emot lifelik charact separ behaviour plan affect reason anim plan control modul agent architectur section li virtual environ emot person agent architectur behaviour plan affect reason consist knowledg plan interpret intent structur knowledg base world model charact plan librari collect plan agent achiev goal intent structur intern model current goal instanti plan agent architectur multipl activ goal multipl plan goal conflict plan instanti execut handl interpret fig fig agent architectur type input influenc agent behaviour plan affect percept event virtual user input mind control interfac updat agent world model influenc affect reason directli chang affect state encod mind model lifelik charact introduc bodi state repres knowledg base regularli updat interpret bodi state act motiv drive agent action activ behaviour eat carri dog hungri cow start output plan process action specif virtual environ facial account current emot state start point mind model captur person affect state charact occ model puppet import express state manner easili interpret young children decid model emot type happi sad plan librari intent structur knowledg base mind model world model bodi state user input mind control interfac percept event virtual environ action specif virtual environ behaviour plan affect reason interpret integr model person emot lifelik charact base evid suggest fact distinct facial express interpret properli children ag emot primarili convei facial express select sound cat happi comput emot gener rule occ model directli manipul child mind control interfac figur project document adopt reduc dimens agreeabl determin larg extent agent behav social interact addit charact set prefer dog long term goal characterist tailor charact give uniqu pseudo person mean partial reli behaviour convei person featur greet charact start plai puppet offer varieti child avatar interact charact scene similar ident presenc user interact persona set input devic child plai role audienc observ interact autonom agent inhabit market place user observ dialogu perform team charact distinct relationship child control behaviour charact scene similar plai physic puppet childhood child seri role differ anim scenario direct child forc puppet chang affect bia complet behaviour agent specif situat depend intern bodi state person featur mode provid valuabl insight observ children chang emot state easi infer convent plai psychologist sussex evalu group year children plai hope find valid assumpt children emot intellig skill improv construct simpl model virtual puppet mind interest abil subject view charact direct behaviour role understand dynam social emot influenc interact integr model person emot lifelik charact project paper person emot aspect affect presenc affect enhanc believ virtual charact produc natur inhabit market place affect tailor role actor virtual market puppet affect teach children emot state chang modifi charact behaviour physic verbal action social interact induc emot broad rang applic area affect import role plai interact affect user interfac work bring piec jigsaw affect compon system graphic design system architectur applic content acknowledg puppet project fund european commun programm school start octob project partner aalborg imag cognit comput presenc project found financ intern dfki presenc intern deduct system group intellig user interfac group inhabit market place fund bmbf fr und refer andr appli artifici intellig special doubl issu anim interfac vol emploi ai method control behavior anim interfac agent appli artifici intellig emot person charact workshop embodi charact oct taho pp descart error publish argument basic ed basic lawrenc erlbaum integr model person emot lifelik charact affect process model emot system phd northwestern institut learn scienc tech report emot cambridg press languag person gile wp robinson handbook languag social psycholog england john wilei son pe individu differ nonverb dimens style journal person social barbara robert van gent agent marina del rei usa person build digit interact partner knowledg human person prefer percept workshop embodi charact oct taho pp isabel ana believ charact stori creation workshop anim pedagog le franc introduct model applic special issu applic journal person microsoft softwar develop microsoft redmond cognit structur emot cambridg press affect comput mit press children express contextu cue judgement emot child believ social emot agent phd thesi technic report school comput carnegi mellon pa extern graphic intern journal kr person marker speech kr gile social marker cambridg pp motiv emot control cognit reprint model yale page architectur requir agent natur artifici sort machin dautenhahn human cognit social agent john benjamin publish van persona substanti proc pp juan emot agent wa
ML/560 6 updat survei evolutionari multiobject optim techniqu state art futur trend carlo de informatica mexico paper review popular evolutionari multiobject optim techniqu report indic main area futur research briefli discuss introduct pioneer work rosenberg late possibl search deal multipl object area research call evolutionari grown notabl increment technic paper intern confer special session intern confer interest group internet multiobject optim doubt import research topic scientist multiobject natur open question area accept definit make difficult compar result method answer correspond maker evolutionari algorithm suitabl solv multiobject optim problem deal simultan set solut find entir set pareto optim solut singl run perform seri separ run case tradit mathemat program techniqu evolutionari algorithm shape continu pareto issu real concern mathemat program techniqu paper provid quick review import work perform indic current research trend import area futur research author maintain list evolutionari multiobject optim statement problem multiobject optim call vector defin problem find vector variabl satisfi constraint optim vector function element repres object function function form mathemat descript perform criteria conflict term mean find solut give valu object function accept design state find vector satisfi inequ equal constraint optim vector function xn vector variabl determin set number satisfi set yield optimum valu object function pareto optimum concept pareto optimum formul pareto centuri constitut origin research multiobject optim point pareto optim definit pareto optim exist feasibl vector criterion simultan criterion pareto optimum singl set solut call solut pareto front minima pareto boundari design locu tangent point object function figur bold line mark boundari problem region point defin bold line call pareto front easi find analyt express line surfac normal procedur comput point suffici amount proce final import approach due obviou space approach literatur limit studi approach popular ffl aggreg function ffl schaffer vega ffl fonseca fleme ffl sriniva deb ffl horn ffl target vector approach aggreg function genet algorithm scalar fit inform natur combin object singl multipl combin arithmet oper approach sum weight min weight coeffici repres rel import object assum interest reader refer detail survei approach applic weight fit function add subtract valu schedul evalu resourc depend exist absenc penalti al weight sum object involv task plan problem move tool center point industri robot locat quickli avoid obstacl aim produc path smooth short jone al weight genet oper order reflect effect appli gener set chemic structur wilson macleod approach method incorpor ga design filter conflict object minim error implement cost filter liu al techniqu optim layout actuat placement plane object minim linear regul quadrat control robust modal control control system subject total asymptot stabil eigenvalu constraint yang gen weight sum approach solv linear transport problem gen al extend approach ad fuzzi logic handl uncertainti involv make process weight sum combin fuzzi rank techniqu identifi pareto coeffici object repres fuzzi number reflect exist uncertainti rel import strength weak method techniqu develop gener solut multiobject optim obviou consequ fact impli kuhn tucker semin work numer optim main strength method effici suitabl gener strongli solut initi solut techniqu main weak difficulti determin weight appropri scale object inform optim point obtain function weight import fact approach gener proper pareto optim solut presenc search space weight schaffer vega david schaffer extend grefenstett genesi program includ multipl object function schaffer figur problem object function pareto front mark bold line approach extens simpl genet algorithm call vector evalu genet algorithm differ select perform oper modifi gener number gener perform proport select object function turn problem size gener total popul size shuffl obtain popul size ga appli crossov mutat oper usual schaffer realiz solut gener system nondomin local limit current local domin individu global necessarili true individu domin gener domin individu emerg gener note problem genet evolut popul excel aspect problem techniqu select individu excel dimens dimens potenti danger individu schaffer call perform surviv select extrem dimens perform produc schaffer meant individu accept outstand object function object moder good valu speciat undesir goal find solut schaffer suggest heurist deal problem heurist select prefer approach individu protect chromosom encourag ad mate select heurist random mate select tradit ga applic variat vega incorpor paramet control select ratio case pollut problem select ratio defin ratio fraction string select basi object fraction select object al interest applic vega model constraint optim problem avoid penalti function modifi standard procedur vega introduc form rank base number constraint violat report approach work optim ga suppli tendenc vega favor solut advantag handl case favor solut violat constraint al approach overcom vega problem wait amount gener shuffl avoid shuffl copi migrat amount individu subpopul tradit multiobject optim approach preliminari design tamaki al develop techniqu individu current popul gener approach mixtur pareto select number individu popul remaind popul gener fill appli vega domin individu number individu exce popul individu gener select individu vega version call pareto reserv tamaki al fit share individu maintain popul strength weak schaffer report main strength approach richardson al note shuffl merg subpopul correspond averag fit compon object schaffer proport fit assign fit compon turn proport object result expect fit correspond linear combin object weight depend distribut popul gener shown richardson al main consequ concav surfac point concav region found optim procedur linear combin prove true set weight main weak techniqu inabl produc solut presenc search space fonseca fleme fonseca fleme scheme rank individu correspond number chromosom current popul domin individu gener domin individu current gener current posit individu rank individu assign rank domin penal popul densiti region surfac fit assign perform sort popul rank assign fit individu interpol worst goldberg necessarili averag fit individu sampl rate procedur global popul fit constant maintain select defin function goldberg deb point type block fit assign produc larg select pressur produc prematur converg avoid fonseca fleme method distribut popul perform share paramet share object function valu applic chen tan li report success multiobject optim control satisfi number time domain frequenc domain specif fleme report success design multivari control system ga turbin engin pareto rank phenotyp share select individu select gener parent aerodynam design blade shape al extend genet introduc object genet genet program replac tradit linear chromosom hierarch tree requir larger popul size special oper identif model altern author report work term convent linear attempt al optim select paramet object recognit scheme call geometr histogram paradigm todd sen variant layout larg scale combinatori todd sen popul nondomin individu updat remov individu domin duplic tradit genet oper share appli popul nich size comput automat criterion maximum criterion minimum divid popul size crossov restrict individu similar permut repair algorithm heurist mutat basic defin rule exchang bit posit avoid prematur converg popul strength weak main strength effici easi implement main weak pareto rank perform highli depend select share factor import add fonseca fleme develop good methodolog comput approach sriniva deb sort genet algorithm sriniva deb base layer classif individu select popul rank basi nondomin individu classifi categori dummi fit proport popul provid equal reproduct potenti maintain classifi individu share dummi fit valu group classifi individu layer nondomin individu consid process continu individu popul classifi stochast remaind select approach individu front maximum fit copi rest popul search nondomin result quick converg popul region distribut region effici li multipl object reduc dummi fit function nondomin sort procedur number object solv minim problem handl applic al find optim distribut activ control element minim aerodynam al invest portfolio interestingli binari tournament select stochast remaind select suggest sriniva deb author claim approach work provid argument choic select strategi tournament select expect introduc high select pressur effect share al fairli larg popul size tournament select absorb extra individu popul design electromagnet system strength weak main strength techniqu handl number share paramet space object ensur distribut multipl solut exist research report main weak ineffici term qualiti pareto front share factor oe share author report perform term pareto front spread uniform popul pareto appli knapsack experi comparison provid horn horn tournament select scheme base pareto domin limit comparison number individu popul determin domin competitor domin result tournament decid fit share popul size larger usual approach select method toler emerg nich popul horn arriv form fit share object suggest metric combin object variabl lead call nest share applic al design composit design minimum drag lift valu constraint maximum pitch moment variat introduc domin criteria problem select mechan select individu reproduc gener popul random walk oper produc local domin individu global domin domin individu encount select share end set pareto optim solut updat store approach design strength weak approach appli pareto select entir segment main strength fast produc good front larg number gener main weak requir share approach requir good choic size tournament perform complic practic target vector approach approach maker assign target goal achiev object popular techniqu includ goal program goal attain approach techniqu yield domin solut goal desir chosen feasibl condit limit applic applic wilson macleod method incorpor ga design filter al combin genet algorithm optim simultan intens atom emiss line trace element function excit condit eric goal program coupl genet algorithm optim plane design planar mechan christiansen appli weight approach optim manufactur problem design robot arm lin appli weight approach structur optim problem strength weak main strength method effici requir nondomin comparison main weak definit goal weight techniqu critic deal search space theori theoret work perform larg amount public report deal applic variat exist techniqu import theoret work area easili ffl fonseca fleme provid import concept pareto wai determin share factor mate restrict paramet ffl horn horn provid import guidelin valu share factor ffl van provid theoret analysi converg pareto set attempt defin limit search domain lot work remain theori techniqu desir perform rigor detail analysi common approach fonseca fleme good candid sort detail mathemat analysi import theoret aspect deserv attent analysi size pareto front respect object research impli size pareto front grow number recent work van number point pareto front depend front shape number object requir work nich fit share accur share factor easili defin detail studi aspect involv parallel approach load impact pareto perform includ algorithm suitabl parallel test function import aspect research area gener disregard technic literatur test function research test approach classic test function provid schaffer semin work function simpl unconstrain show import aspect interest analyz approach concav discontinu pareto deb recent wai creat control test problem evolutionari multiobject optim techniqu optim problem basi interest transform decept massiv multimod problem difficult multiobject optim problem van guidelin design test function suit evolutionari multiobject optim includ technic report sampl test problem combinatori optim benchmark problem deb van perform detail studi perform ga qualiti notori lack technic literatur van detail account exist compar studi metric import defin good metric measur effect techniqu main ffl entir search space parallel process techniqu true pareto front true pareto compar result metric estim ga perform van gener repres solut true pareto approach work short binari string report success string suitabl alphabet higher cardin longer binari string ffl sriniva deb measur point pareto front statist metric distribut metric assum knowledg true pareto good distribut point set direct comparison pareto front true pareto front ffl thiel concern size object space cover set nondomin solut compar directli set nondomin metric fraction pareto front cover metric interest compar studi techniqu substanti suitabl gener test impli work area requir futur research path section lot work remain area briefli describ futur research path mention relat work ffl dynam deb understand dynam popul ga gener appli multiobject optim problem knew popul behav issu make difficult nondomin techniqu progress global pareto front faster current approach ffl stop import defin stop criteria multiobject optim obviou popul reach point improv reach global pareto front main approach stop kind ga fix number monitor popul interv interpret visual result determin halt evolut process ffl number applic evolutionari multiobject optim techniqu problem probabl trend research reformul problem consid object optim constitut realist approach solut problem frequent area reduc singl object remain object treat constraint handl object simultan paper attempt provid gener view main work evolutionari multiobject discuss popular techniqu advantag import problem remain solv relat work process solut acknowledg author acknowledg support project number bibliographi rosenberg simul genet popul biochem properti phd ann optim engin design john design page academ pareto cour volum ii carlo survei multiobject optim techniqu knowledg inform system intern david van gari multiobject evolutionari algorithm histori analysi technic report depart electr comput graduat school air forc institut gilbert jeff applic genet algorithm resourc schedul richard belew fourth intern confer genet page san morgan kaufmann applic genet algorithm task plan learn manner parallel problem solv lectur note comput page publish compani robert david peter robert search chemic structur genet algorithm stephani intern confer genet page san morgan kaufmann wilson macleod low implement cost digit filter design genet algorithm workshop natur algorithm signal page genet approach optim design adapt structur intern journal numer method yang gen evolut program transport problem gen intern confer comput industri page pergamon press li solv solid transport problem fuzzi number genet algorithm intern journal comput industri gen cheng genet algorithm engin design john wilei kuhn tucker nonlinear program berkelei symposium mathemat statist page california press brian genet algorithm solv multipl object pollut problem water resourc david schaffer multipl object optim vector evalu genet algorithm genet algorithm intern confer genet page lawrenc grefenstett system genet search procedur confer intellig system page patrick nichola ian boyd approach constrain ga suppli network method evolutionari comput aisb workshop select lectur note comput page ian eric webb multiobject preliminari design ian integr evolutionari adapt comput technolog design page unit april plymouth engin design optim genet algorithm case schedul hot roll process confer associ oper research societi page world kobayashi optim genet algorithm review fukuda takeshi intern confer evolutionari comput page ieee jon mark mike guidelin genet algorithm penalti function david intern confer genet page georg mason morgan kaufmann publish david goldberg genet algorithm optim machin learn publish carlo fonseca peter fleme overview evolutionari algorithm multiobject optim technic depart automat control system carlo fonseca peter fleme genet algorithm multiobject discuss gener stephani intern confer genet page san illinoi morgan kauffman publish david goldberg deb comparison select scheme genet algorithm gj foundat genet page morgan san sriniva deb multiobject optim nondomin sort genet algorithm evolutionari fall kai chen tan yun li genet algorithm base time frequenc domain design unif linear control system technic report depart electron electr fleme ga turbin engin control design multiobject genet algorithm intern confer genet algorithm engin system innov page septemb ieee pareto genet algorithm aerodynam design equat genet algorithm evolut strategi engin comput scienc recent advanc industri chapter page john wilei west carlo peter fleme multiobject genet program nonlinear system identif applic john late break paper genet program page stanford juli stanford bookstor john koza genet program program comput mean natur select mit carlo fonseca peter fleme nonlinear system identif multiobject genet algorithm world congress intern feder automat page san pergamon press frank neil peter optim geometr histogram electron eighth british machin vision unit septemb david todd sen multipl criteria genet algorithm load thoma seventh intern confer genet page san juli michigan state morgan kaufmann publish carlo empir studi evolutionari techniqu multiobject optim engin design phd depart comput apr sriniva deb multiobject optim nondomin sort genet algorithm technic depart mechan indian institut jacqu ga multipl object optim strategi electromagnet genet algorithm evolut strategi engin comput scienc recent advanc industri chapter page john wilei west loui chi david goldberg invest portfolio optim genet algorithm john late break paper genet program page stanford juli stanford bookstor electromagnet system design genet algorithm genet algorithm evolut strategi engin comput page john wilei thiel multiobject optim evolutionari compar studi parallel problem solv natur page septemb thiel evolutionari algorithm multiobject strength pareto approach technic report comput engin commun network lab swiss feder institut technolog jeffrei horn nichola multiobject optim nich pareto genet algorithm technic report illig report illinoi david goldberg richardson genet algorithm share multimod function optim genet algorithm intern confer genet page lawrenc constant multiobject optim composit genet algorithm symposium multidisciplinari analysi page aiaa paper carlo ga coupl tool improv effici genet algorithm evolut strategi engin comput scienc recent advanc industri chapter page john wilei west alessandro coupl genet algorithm gradient base optim techniqu genet algorithm evolut strategi engin comput scienc recent advanc industri chapter page john wilei west cooper manag model industri applic linear volum john manag goal account control chen liu multiobject var plan method iee transmiss lin genet search strategi optim design structur carlo alan hernandez multiobject optim techniqu design robot arm carlo alan christiansen method multiobject optim civil engin target optim analyt procedur genet algorithm analyt eric design optim goal program advanc design page chapman carlo alan christiansen mose multiobject optim tool engin design engin carlo fonseca peter fleme overview evolutionari algorithm multiobject optim evolutionari spring carlo fonseca peter fleme perform assess comparison stochast multiobject optim werner ingo parallel problem solv lectur note comput page septemb jeffrei horn make thoma david zbigniew handbook evolutionari volum page iop publish oxford jeffrei horn natur genet algorithm evolut cooper popul phd illinoi urbana jeffrei nichola david goldberg nich pareto genet algorithm multiobject optim ieee confer evolutionari ieee world congress comput volum page june ieee servic center gunter evolutionari algorithm converg pareto set ieee confer evolutionari page ieee press david van gari evolutionari comput converg pareto front john late break paper genet program page stanford juli stanford bookstor deb genet problem difficulti construct test problem technic report depart comput deb evolutionari algorithm optim engin design evolutionari algorithm engin comput scienc carlo treat constraint object evolutionari optim engin
IR/561 5 acm oopsla octob resourc account interfac java thorsten von depart comput scienc cornel ny usa abstract spread internet comput model server system undergo import recent research idea dynam oper system extens find commerci result design extens web server ordinari user servic provid deal untrust download execut code unknown origin intent java emerg languag choic softwar argu order realiz full potenti applic deal untrust java flexibl resourc account interfac design prototyp implement interfac present paper interfac account heap cpu network resourc consum individu thread group thread limit set resourc thread invok callback limit prototyp paper implement top standard java virtual machin requir small amount nativ code keyword resourc extens system introduct spread activ content internet make untrust code fact life connect user provid servic client download execut java applet activ technolog serv attract web page server dynam server extens full customiz inform retriev access proprietari dynam upload servic task accomplish concept servlet untrust code execut server program languag java tool implement upload content attent public notabl secur area java appli appli languag cumbersom requir nativ code support languag extend wai perform continu improv current definit java interfac resourc manag applic domain benefit provid interfac standard integr part languag specif includ load balanc prevent emerg extens server address issu resourc manag fact adequ design program languag case languag runtim environ includ featur extens oper system browser essenc oper system run environ run untrust code develop common fact java model mechan control resourc consumpt applic chang thread problem system malici code prevent resourc code charg resourc consum issu repres obstacl deploi commerci extens server resourc control solut java nativ code monitor cpu time consum thread approach tie portabl java environ underli oper result loss portabl mainten problem enforc resourc consumpt pattern applic full control sourc code case untrust unknown applet assumpt made resourc consumpt paper java interfac account heap cpu number byte receiv addit track resourc applic inform thread creat mechan set limit resourc thread associ callback invok resourc limit interfac flexibl support varieti resourc consumpt enforc polici polici ensur thread millisecond cpu time easili shown line code suffic creat polici thread group send polici combin size aliv object alloc thread belong thread group exce design gener system java main intend usag extens web browser extens internet server environ control resourc consum extens contribut paper twofold motiv incorpor resourc manag interfac languag specif java languag similar aspir scope describ applic aim make convinc argument futur extens java resourc manag support provid function includ goal demonstr implement current form modifi underli price function limit perform overhead lesson learn develop import guidelin futur work resourc manag infrastructur possibl chang implement jvm project carri context applic languag featur similar java date awar work provid function gener program languag rest paper structur section motiv extend java resourc manag capabl descript interfac present select implement perform detail limit discuss section discuss relat current statu system plan futur direct section summar paper motiv applic motiv exampl order clarifi crucial java languag similar provid resourc manag interfac interfac resourc consum applic applet monitor limit consumpt resourc enforc group applic readili benefit internet servic extens upload client server imag process servic creat profit independ develop architectur extens web server make develop upload code servic make servic larg group potenti user client access servic standard web browser interfac case sophist special upload code access servic practic applic dynam extens web server adequ implement scenario system core upload code execut singl java virtual machin construct server singl jvm advantag perform call core extens reli tradit os protect mechan separ process encapsul extens secur restrict bytecod run fine control java adequ mechan extens implement protect domain issu dynam extens protect understood context lack support resourc account consequ space environ difficult identifi servlet consum resourc malici servlet easili mount attack aim prevent applic resourc main incent high extens internet server revenu potenti bring lack support resourc account leav altern bill fee principl flat rate typic level forc client resourc motiv technolog extens server function system augment function stock market data access web site potenti user investor web credit invest formula sql queri find technolog stock interest select stock function larg number user web environ creat udf queri motiv facilit extens gener system deploi web larg number physic distribut work platform interact web browser larg size user util udf java ideal suit implement extens secur portabl featur long resourc manag concern resolv activ network extens environ portabl safeti featur java desir goal activ network associ execut content network packet execut program host router internet result easier manag network standard environ infrastructur implement activ network program trust malici network program simpli consum resourc halt instanc extend java resourc manag facil desir context final motiv prevent attack aim web browser typic form attack mount applet applet consum excess amount resourc prevent applic local host perform expect sever hostil applet complet resourc crash applic prevent applic start import point applet resourc malici program error attack classifi proper secur date issu address java implement interfac add resourc account limit facil java main motiv creation portabl extens web environ motiv reflect design part interfac access trust untrust part extens learn resourc limit usag part requir authent caller trust system manag enforc resourc limit part design privileg system resourc control part enhanc web browser trust core environ inform thread state upper limit memori live object alloc thread thread limit byte data thread send limit cpu time thread regist action execut limit interfac present figur consist java except class present method deal thread counterpart method manag resourc thread group basi fact interfac flexibl build complex resourc manag discuss class defin constant identifi resourc export public method handl authent object resourc account subsystem initi cooki ensur parti privileg access resourc manag subsystem prevent untrust code interf resourc manag polici system browser call applet load applet hold call method applet grant resourc grant browser method present figur hand object implement interfac resourc manag subsystem effect oper java thread invok callback meant work conjunct method invok time thread creation detect effect set limit limit unit resourc thread limit thread method invok object implement paramet pass callback inform current resourc consumpt resourc limit clear invok method queri resourc manag subsystem resourc usag thread queri resourc limit caller authent cooki order invok make untrust code monitor resourc consumpt limit resourc manag polici throw except action applic resourc argument constructor type inform retriev caught except valu resourc limit express usag valu report memori network express byte cpu time millisecond exact memori network resourc callback gener thread execut action lead limit desir deal alloc reclaim offend thread kill refer object current implement enforc cpu limit period poll result small configur delai public interfac public void public interfac public void thread int public class extend long long public final class public static final int public static final int public static final int public static final int public static boolean public static boolean public static boolean int thread long public static boolean int thread public static long thread public static long thread figur interfac public class public static void object cooki erp start comput proper class implement privat object ck public void public void thread long switch case case instanceof case case string msg thread paid network throw initi cooki authent object erp notifi thread creat invok thread creat set limit heap memori thread method defin return true network thread paid prevent thread network invok resourc limit termin thread attempt memori pass cpu callback action specif interfac warn thread cpu lower offend thread prioriti add thread cpu limit offend thread except thrown instanc object manag resourc set limit cpu time figur show resourc consumpt limit polici figur resourc manag polici interfac figur show resourc consumpt limit polici advantag interfac code thought resourc manag modul extens server web browser code inform thread creation set resourc limit newli creat thread limit call enforc thread memori alloc object thread point ms cpu time network resourc thread owner paid actual resourc polici real server natur complex oper thread mechan simplifi line instal custom resourc manag polici object type regist resourc manag subsystem object receiv gener thread handl method resourc handl method method thread exce heap memori limit case method invok termin offend thread thread attempt send receiv data network case except gener notion defin thread network resourc call method return caller catch except attempt network unsuccess implement period limit demonstr handl limit cpu case code detect thread consum millisecond cpu time period thread grant cpu time time thread exce current cpu time check made period happen thread receiv millisecond cpu time polici decid lower prioriti thread thread exce limit limit equal current usag effect implement polici thread receiv millisecond cpu time time detect lower prioriti extens thread implement interfac cpu limit method interfac invok thread inform thread respond warn consum cpu make avoid lower prioriti execut applic figur demonstr extens environ control resourc applic import stress applic awar fact valid java program run environ applic affect exce resourc limit applic call learn current resourc consumpt limit bytecod applic rewritten run automat influenc detect rewritten java program context java architectur figur show notion resourc manag fit java architectur provid function import enhanc languag view context core notion class loader secur manag function class loader load class secur manag control access resourc file network class loader detect untrust class notion resourc manag java program control comput resourc implement perform section discuss specif implement issu perform implic present select perform data implement detail perform result consist mhz pentium ii pc mb ram microsoft visual version java sdk environ compil cpu account account memori alloc arrai requir nativ code small set routin written call java program nativ method featur accomplish bytecod insert bytecod instruct select place origin class order maintain inform resourc consumpt rewrit java bytecod java good environ code transform java number properti applic defin resourc polici level privileg monitor behavior extens resourc manag account comput resourc limit resourc consumpt inform resourc avail applic defin class loader specif wai load class separ untrust code trust code class loader load bytecod jvm separ namespac applic defin secur polici level secur manag access control class loader track untrust code untrust cod figur extend jvm resourc manag facil standard jvm extens assist class retain symbol inform enabl member insert jvm stack simpl code fragment insert jvm class loader locat add class demand class loader method call jvm encount refer class load typic class loader implement search class file call convert arrai byte instanc instanc class verifi ensur class semant valid oper type readi execut class rewritten class load avoid runtim perform overhead bytecod rewrit occur call rewrit result byte arrai pass invoc result class object pass origin code jvm core made current implement bytecod rewrit tool develop project thread registr core compon current implement thread registr goal store inform thread activ system modul maintain inform contact user program set clear resourc limit thread resourc consumpt inform thread registr modul gener newli creat thread regist thread registr accomplish inject bytecod instruct begin method class implement runnabl interfac object implement interfac run thread thread method invok result regist thread execut origin code invok method directli start method properli handl account network resourc track amount data transfer thread implement straightforward nativ method class belong packag access network directli method privat protect locat class mean call code action account network usag rewrit packag rewrit ensur method inform record callback inform resourc limit simpl run comput connect fast ethernet order estim overhead bytecod time percent messag larger small messag result encourag made resign experi altern approach track network nativ code top socket layer account cpu time current implement cpu time account mixtur bytecod rewrit nativ code thread registr nativ code routin invok order creat level handl thread handl queri system inform cpu time usag thread part cpu account modul thread creat thread wake period store thread queri oper system cpu consumpt callback gener overhead wake poll thread queri runtim overhead gaug consumpt cpu time accomplish bytecod rewrit insert instruct point method result statist inform cpu usag experi result execut time prohibit reason accuraci achiev account heap memori goal memori account point program memori object alloc thread accomplish bytecod rewrit constructor object modifi record inform alloc thread final modifi gener detect garbag collector free object code method chang bytecod insert object alloc instruct occur origin method code object arrai method invoc insert alloc instruct method increment counter object arrai size verifi memori limit limit callback invok arrai alloc instruct code comput number entri arrai insert origin bytecod comput number entri advantag fact arrai size dimens store top operand stack case arrai stack entri multipli addit method call insert arrai alloc bytecod instruct reason obtain weak pointer newli alloc pointer detect dealloc arrai weak pointer java nativ code role refer object prevent dealloc referenc object weak pointer referenc object chang null store weak pointer arrai alloc thread vector object alloc thread exce memori thread list weak pointer scan size recent arrai arrai weak pointer subtract thread memori usag counter figur rewritten class figur show sourc origin class effect transform shown transform figur show actual effect rewrit bytecod import note thing analyz code number call intern identifi class foo number gener bytecod rewrit virtual machin java stack method expect argument stack signatur method shown bytecod figur figur gener idea code size due memori account transform proport number object arrai alloc origin code method alloc memori chang bytecod transform perform memori account usag limit java applic run order evalu overhead memori account test suit consist run parser gener figur effect bytecod rewrit class foo class rewritten order account memori usag box left show origin sourc file box show effect transform perform class foo void object foo class foo thread alloc public void void object foo pointer alloc thread modifi alloc thread inform object alloc obtain weak pointer detect dealloc arrai element type foo alloc gener final inform object dealloc execut set sort list manipul function lisp interpret run version mark suit test serv set web page jigsaw web server class benchmark program rewritten memori account memori limit set valu callback invok object arrai alloc memori limit check figur show overhead percentag total execut time rewritten program percentag split compon compon report overhead invok empti final object modifi class durat garbag collect java object garbag collector optim bytecod object final compon overhead account memori cost execut routin maintain memori usag statist compon report overhead check resourc limit total overhead memori account limit exce benchmark biggest contributor overhead account resourc involv method refer current thread increment integ store hashtabl check limit involv method call object biggest sourc overhead introduc final result small overhead compar cost limit tabl statist benchmark program execut left side tabl understand data figur number creat object direct impact cost memori account lisp jigsaw alloc object roughli bytecod instruct suffer highest overhead mark benchmark alloc object arrai approxim overhead memori manag small program program arrai alloc frequent futur optim target improv handl statist side tabl provid inform cost perform bytecod rewrit class belong benchmark program class rewritten push refer local invok superclass constructor push refer local alloc return void int int push stack pop int stack push code class constructor push stack push code class foo pop int stack duplic top stack word pop int stack duplic top stack word push int foo push refer arrai foo duplic top stack word push int int pop refer push refer push stack push null object refer pop refer arrai return public void refer local push content field push code class foo int return figur bytecod result transform class foo figur cooper memori account underlin instruct present origin class foo rewritten instruct gener process bytecod rewrit origin bytecod gener jdk mean cost rewrit includ overhead report figur discuss import case bytecod rewrit happen class column report number class rewritten run program test execut jigsaw server code column tabl show time rewrit class current rewrit cost rewrit class program object alloc instruct cost grow total number bytecod instruct number object arrai creation clear overhead bytecod rewrit system environ primarili aim rewrit class extens web server rewrit enter critic path remot client issu request obtain result fortun extens small rewrit lisp mark jigsaw check limit account null final figur overhead account memori memori limit runtim statist statist program bytecod instruct object creation arrai creation bytecod instruct object creation arrai creation class rewrit time lisp jigsaw tabl runtim statist benchmark program applet class jdk distribut averag size class bytecod instruct system extens load rewrit time amort execut extens discuss resourc account interfac present paper significantli enhanc function dynam extens environ subsum function oper system upload extens enabl construct environ capabl track resourc usag extens interfac build complex polici top control access resourc heap memori network thread creation callback limit number thread thread group child thread creat includ standard interfac system extend limit number object type aliv system point time number window open applet number jdbc queri creat user defin function extens control limit action resourc limit restrict java lower thread prioriti imposs chang thread schedul algorithm full control schedul provid resourc addit enforc resourc limit perform overhead memori account directli link fact part jvm tap memori alloc garbag collector make unnecessari rewrit cut overhead dramat modifi jvm dictat reason java librari small nativ easili port virtual machin ty jvm implement fast idea incorpor function jvm limit handl share object thread scenario thread creat larg object hand thread thread exit garbag collect count bs memori consumpt problem exist environ identifi cooper thread ensur data share group thread constraint sever applet secur rule ensur applet access thread thread group architectur easi defin identifi collect cooper thread import made design disallow object share protect domain similar design expect futur design extens environ relat work relat research resourc account enforc resourc limit tradit extens oper safe languag binari code transform section summar import work area influenc research oper system enforc resourc limit long oper system unix shell export limit set resourc limit current shell child process cpu time maximum size data stack virtual memori set enforc resourc limit tradit oper system unit control entir process enforc reli process schedul hardwar support detect memori singl address space oper system advantag radic address space oper system applic architectur earli oper system alloc resourc set memori similar convent oper system basic storag manag mechan explicit refer applic support facil alloc untyp storag unit mechan resourc group provid basi resourc control eq quota encourag requir user applic limit resourc consumpt time applic obtain pass resourc group capabl hidden argument system call oper system interest featur system model manag back store manag applic obtain account collect storag occupi object rent automat storag run forc user storag bank account receiv regular prevent excess fund inact applic architectur spin extens oper system applic safe chang oper system interfac implement spin extens written reli certifi compil safeti extens cpu consumpt untrust extens limit introduc extens oper system concern constrain resourc consum extens kernel softwar fault isol safeti mechan lightweight transact system cope resourc timeout resourc extens hold resourc termin transact support restor system consist state abort extens main object extens oper system servic ad kernel core servic modifi support resourc manag adequ oper system main motiv build safe effici internet environ implement safe java extens entir applic account enforc polici effect time program languag approach abil manipul thread prioriti invok garbag java programm interfac control resourc usag program extens java attempt allevi share goal java web server administr interfac view resourc usag number run thread displai implement api obtain execut time assur resourc avail goal system ensur applic obtain resourc goal ensur program exce resourc limit recent special program languag plan aim provid infrastructur program activ network plan strictli function languag base dialect ml program replac packet header view execut internet host router order protect network avail plan program bound amount space time activ router bandwidth network enforc languag runtim system similar plan limit resourc consum program main differ plan resourc program base length program claim resourc activ network program packet bound linear function size packet header approach constrain resourc consumpt idea underli proof carri code associ proof safeti properti program program runtim check proof gener proof arrai access exce arrai proof verifi execut verif success proof construct amount memori alloc number instruct execut feasibl approach unknown size proof exce size origin code order magnitud problem extens web environ upload time path binari rewrit code instrument rewrit binari trace profil optim tool toolkit design rewrit program modifi code gener address trace instruct count gener address instruct trace handl detail trace emul architectur domain shade binari rewrit tool softwar test tool detect memori leak access error binari rewrit techniqu class tool emploi binari rewrit techniqu consist tool edit execut code tool offer librari routin modifi execut file user design binari rewrit strategi exampl includ om atom recent detail summari binari code rewrit tool techniqu found import java bytecod transform recogn research group recent recent project reli bytecod rewrit provid level secur public bit util detail list issu solv design bytecod rewrit tool overhead report evid java bytecod rewrit extrem perform sensit current statu futur work system paper oper consist packag nativ librari requir microsoft jvm plan port sun jdk allevi problem attack target browser interfac infrastructur defin simpl polici prevent applet heap cpu time network resourc user specifi configur file practic demonstr class implement class implement resourc consumpt polici ad core class jvm execut insid microsoft internet explor result enhanc browser applet prevent mount attack mention resourc addit enabl technolog class softwar understand resourc manag emerg model internet comput main characterist model high code mobil larg number anonym result kind resourc demand made applic tradit oper system environ effici distribut comput resourc model infrastructur research issu design implement demonstr interest resourc manag function ad java modifi incorpor implement jvm work incorpor jaguar extens topic current work transfer object ownership summari paper present interfac extend java resourc account limit capabl main motiv facilit creation extens internet untrust code upload java lack resourc manag sever shortcom build environ address problem small interfac flexibl complex resourc manag polici built implement combin bytecod rewrit nativ code add resourc manag java virtual machin perform overhead small case account cpu time network resourc set java applic memori account result overhead current implement requir modif java virtual machin discuss interfac limit sourc perform overhead present paper import ad function implement jvm acknowledg author grate chri li greg praveen seshadri comment discuss research fund darpa ito contract nsf contract sloan foundat intel corp hardwar donat refer techniqu captur address trace proc intern symposium comput june java program languag protect softwar issu workshop hot topic oper safeti perform spin oper system acm symposium oper system copper decemb simul massachusett institut technolog technic report share protect singl address space oper system acm transact comput architectur gener protocol proc sigcomm symposium commun architectur septemb fast simul execut profil proc acm sigmetr confer measur model comput automat program transform proc usenix annual june von resourc manag extens internet server proc activex control insid microsoft oper system architectur resourc manag proc acm symposium oper system copper decemb seshadri von secur portabl extens proc acm sigmod intern confer manag sigmod vol issu june implement protect domain java develop kit internet societi symposium network distribut system san march java languag specif fast detect memori leak access error proc winter usenix januari marshal execut profil modular program softwar practic page vol program languag activ network submit acm sigplan confer program languag design von implement multipl protect domain java usenix annual june resourc manag oper system st australasian comput scienc java april java web server home page ml jigsaw overview rewrit execut file measur program behavior practic vol februari execut edit proc sigplan confer program languag design june tool instrument java bytecod usenix symposium internet technolog decemb java virtual machin specif code annual acm symposium principl program languag januari issu design implement java java develop softwar mark deal surviv kernel extens symposium oper system design novemb write oper system workshop compil support system februari trace memo center integr stanford april atom system build custom program analysi tool proc sigplan confer program languag design june practic system code optim journal program vol march java parser gener system late code modif robert susan code gener extens secur architectur java acm symposium oper system octob
Agents/562 1 agent base framework mobil user la cort antonio istituto di informatica di catania vial catania itali dipartimento di di itali abstract user mobil easi access distribut resourc greatest challeng face futur year agent technolog approach deal distribut comput user mobil paper strategi support mobil user present base mobil agent platform develop enhanc order user access network servic mobil environ main function platform introduct quick wireless commun technolog portabl comput made mobil comput import user access inform independ place comput power make valid work tool user move place todai technolog made devic similar system notebook valid altern huge comput power low cost widen integr user meet requir term access inform distribut access compani tradit interperson area clear solut found wireless commun technolog made mobil telephon common interperson commun mobil comput talk mobil refer user move comput resourc remain wire user roam commun environ wire wireless coverag area issu face refer scenario paper deal issu connect wireless focu attent environ user applic support user oper transpar regard move base mobil agent present mobil agent softwar modul move network order carri task user word agent entiti act behalf user run specif commun user launch environ main aspect contribut success agent abil oper autonom abil migrat agent applic carri task creat move node network order obtain inform point mobil agent effect tool mobil basic featur agent includ support asynchron standalon mode oper build scenario user submit request run request enabl user obtain result disconnect enabl exploit fix calcul resourc enabl user work mobil devic limit calcul power oper autonomi paper present support mobil user design implement mobil agent platform map agent platform develop manag mobil implement catania section architectur manag mechan map briefli section gener issu softwar agent mobil user support discuss section made map support mobil user present section author futur work direct develop platform creat present map map architectur map platform develop manag mobil agent primit develop total portabl hardwar softwar architectur java languag program programm learn specif api made platform migrat implement map weak agent carri data integr paradigm remot execut code demand exploit mechan dynam load class present java graphic interfac manag agent execut interfac verifi agent activ local present remot server interfac trigger execut agent present independ code resid refer architectur architectur map base concept server agent server provid basic environ agent run agent activ entiti move server commun local agent access servic made server daemon agent agent instanc instanc context network classload agent server serial object agent messag figur map server architectur figur show scheme element form map entiti oper platform host identifi dn address host tcp port number server listen accept agent messag network server main object map entiti daemon context local agent instanc presenc server node belong platform map activ enabl node accept agent network activ agent local daemon entiti map listen wait agent node messag deliv local agent messag agent travel serial form context basic object map server agent present save user function manag context put method enabl creat make server code suspend deactiv resum kill platform map enabl agent run specif map class present class agent refer present search class load remot site save cach memori manag access agent server intern entiti dynam context platform instanc object time request class local remot tabl context class platform save manag platform platform map enabl user advantag graphic interfac fig permit easier manag agent map server graphic interfac show window agent run local list figur map user interfac select agent oper button present upper toolbar button make agent run specif map necessarili map class agent absent figur explain featur user activ map user interfac machin make agent run node map server activ class implement agent desir case url node make run class implement agent resid node user agent run node map server activ user sourc url figur platform present enabl paradigm base remot evalu code demand button server enabl obtain inform map server activ agent execut server map server map server map server map user interfac execut figur run agent machin softwar agent mobil comput mobil agent natur support asynchron oper typic scenario agent user forward request system agent search exchang data agent network case trigger leav initi workstat connect moment workstat agent locat return result type mechan link mean email finish send user email messag result refer case requir storag multimedia solut user disconnect obtain desir result reconnect agent devic support softwar manag email widespread cheap mechan big disadvantag forc user mechan access inform request agent type softwar manag email issu uniform present data approach limit applic result return email agent applic result transact close link platform email messag loss inform approach case server maintain list activ server system user disconnect system deactiv agent server notifi server thing user reconnect system agent user disconnect immedi end remain host wait user reconnect system migrat node bring result search case central element present maintain inform node design proxi fix user agent end task user trigger connect agent migrat proxi node user suspend execut user reconnect server send messag notifi reconnect system solut map refer section maintain list activ server mechan hard solut envisag mechan replic order fault toler mobil comput map gener architectur support mobil user shown figur lookup data server lookup server maintain inform agent temporarili store wait user reconnect system data server simpl node agent store result contact user detect longer connect system host url result retriev url data result server data host lookup server data server data manag agent mobil manag agent user agent user move host host figur support mobil user map figur show step order satisfi mobil user request step user agent trigger user reach node user disconnect interrupt connect occur send messag mobil manag agent present lookup server mobil manag receiv select data server list maintain data server send inform agent updat tabl insid lookup store user id agent url data server commun agent send messag result agent data manag present data server agent specifi data store agent end execut data manag agent store data receiv data server user reconnect station server map send messag mobil manag order user reconnect url connect mobil manag agent consult insid tabl lookup back user inform retriev result server map user send request data data manag requir data request trigger disconnect data manag respond send result execut agent origin trigger user mechan case request trigger user envisag collect inform agent inform maintain agent aliv agent algorithm end execut end user return data interest maintain agent origin trigger user aliv agent step end suspend execut data server user reconnect resum migrat node bring result previou interact environ descript algorithm refer data server result agent store order reliabl balanc load server work present preliminari base mobil support mobil user consid map refer function creat enabl adequ support oper gener user connect system workstat moment work equip adequ secur authent user servic made platform work carri support italian della ricerca framework methodolog tool high perform system distribut project refer agent mobil comput ieee person octob dm cg kershenbaum mobil good technic report ibm tj watson research march etzioni ds weld intellig agent forecast ieee august gp vigna understand code mobil ieee transact softwar genesereth ketchpel softwar agent commun juli cybenko mobil gener distribut comput proc int symp parallel synthesi march interact int workshop mobil agent octob phan mobil softwar overview ieee juli vita design implement mobil agent platform journal system architectur publish
HCI/563 4 lag test augment virtual environ colin john dill school comput scienc simon fraser drive bc abstract describ simpl techniqu accur calibr tempor lag augment virtual environ enhanc virtual hand lab collect hardwar softwar support research human hand motion lag sum delai data pipelin displai inform physic world produc augment virtual world main calibr techniqu modifi turntabl provid easili track period reminisc calibr techniqu shaw green measur show lag special analog sensor part calibr capabl accuraci lag accuraci enabl predict track scheme lag data pipelin describ techniqu environ augment virtual realiti introduct earlier paper summer al describ virtual hand laboratori calibr issu face develop paper extend work context enhanc virtual hand laboratori support render complex augment addit modal torqu provis haptic audio output enrich augment environ experi human hand motion conduct booth depart comput scienc british columbia main mall bc haptic data accur displai move object predict track requir system lag resolut lag frame difficult tempor differ data obtain input sensor data render output displai earlier paper discuss tempor spatial calibr perform system ensur spatial accur stereo view augment environ achiev updat rate hz system lag averag delai delai model frame delai monitor refresh imag frame buffer paper discuss subsequ work accur measur system lag techniqu calibr techniqu measur visual measur system lag inspir earlier techniqu shaw green calibr polhemu sensor period motion provid accur visual measur system lag techniqu video motion blur gain addit inform emploi video camera accuraci requir calibr techniqu close loop measur enabl system calibr analog devic total lag system connect video output signal displai analog input channel system system record frame extern signal signal displai output measur system lag term frame time improv accuraci resolut accomplish manipul geometr pattern echo provid fraction lag measur extern intern techniqu rough correspond system lag predict model data pipelin converg result assur oper data collect trial accur remaind paper describ type experi support background present theoret model data process discuss calibr techniqu result obtain paper conclud comparison addit relat explan knowledg lag improv visual qualiti augment environ support system model enhanc virtual hand lab support augment virtual environ stereo view small cubic work volum experi conduct investig peopl move hand perform action common task grasp manipul object primari hardwar compon silicon graphic workstat northern digit posit sensor base activ infrar emit diod analog input capabl provid data acquisit unit convert custom softwar integr hardwar compon system locat marker object interest updat comput model physic displai graphic work volum provid augment environ experi conduct graphic overlai achiev standard comput monitor suspend work volum monitor reflect mirror option black cardboard back make fulli provid simultan view physic virtual object mix augment virtual object pure virtual figur show schemat diagram detail descript apparatu provid earlier paper summer al experi support improv comput aid collabor comput video telerobot surgeri applic human hand studi underwai tradit interact devic explor hand gestur augment environ figur enhanc virtual hand lab posit orient subject object work volum track posit sensor analog forc exert finger grasp object collect channel type data maintain model physic environ addit virtual object present typic experi analyz subject posit orient small wooden cube workspac human perform analyz monitor subject move wooden cube varieti graphic haptic condit subject move wooden cube record posit orient cube complet trajectori wooden cube hand record subsequ analyz condit subject physic virtual cube locat random subset virtual cube rotat orient physic cube goal experi determin effect mismatch haptic visual inform hand movement perturb correspond physic virtual object advanc set experi underwai wooden cube forc transduc subject pass cube back varieti graphic haptic condit perturb includ size virtual cube contrast actual size physic cube user grasp physic softwar detect contact forc channel posit orient cube hand record subsequ analysi system overview figur illustr data flow occur subject interact system system compon tabl illustr figur ir channel sampl minimum hz updat model workspac data synchron system unit store set temporari regist system unit previou data frame transfer temporari regist circular memori buffer system unit workstat read regist recent frame posit data analog data special scsi interfac workstat read system unit data frame system unit read realtim frame period unread data transfer block transfer mode mb data transfer frame time data transfer offlin data analysi calcul predict perform full data set tabl system compon descript compon descript activ marker emit infrar radiat detect linear devic posit sensor activ marker posit sensor determin posit sensor ir ir sampl frequenc hz spatial accuraci mm analog signal convert system unit analog signal repres extern system input forc digit analog input convert time analog channel sampl frequenc khz accuraci mv system unit collect synchron data posit sensor convert mb scsi sgi figur system lag data flow monitor scsi devic raw data store system temporari buffer facilit commun system unit workstat special retriev data system unit requir step data altern command shown top portion figur sgi workstat monitor run special graphic data collect softwar written opengl irix platform mhz gb realiti engin graphic singl graphic pipe project mirror creat augment graphic object recent frame data obtain scene graph updat render base model physic world includ object sensor addit virtual object present physic workspac middl portion figur illustr mm mm area refresh hz resolut field stereo scene success displai bottom portion figur left ey ey monitor screen resolut hz refresh rate field hz field monitor project scene mirror subject physic virtual workspac singl augment workspac figur face surfac tabl parallel floor tempor system lag model shown figur system lag model approxim frame defin system lag time durat user posit graphic feedback displai mirror lag pixel bottom corner displai lag pixel upper left corner displai system unit clock process system phase amount slack time end softwar updat figur overlap start monitor refresh disabl stereo view photograph camera view imag time diagram monitor refresh figur monocular case time diagram stereo effect diagram half scan line field group system compon contribut frame delai stage process shown figur place sequenti data flow system model render final refresh buffer stage oper essenc pipelin data frame system unit relat compon posit sensor buffer data retriev softwar workstat basic cycl time retriev updat model render imag current ey posit calcul model hz field sequenti monitor refresh requir read imag frame buffer displai stereo glass requir time turn add system switch time field left ey part imag vice effect qualiti stereo model specif hardwar softwar gener pipelin structur similar system model render displai refresh stage oper pipelin phase work frame frame refresh frame frame render data frame acquir system differ system includ nomin frame time updat hz model render complex differ due singl true processor pipelin parallel parallel due multipl cpu addit multipl processor model displai refresh subsystem figur tempor system lag model work cite relat research section address issu mechan data make correct partial movement place time subsystem data updat model time render complet basic pipelin adapt model calibr techniqu equal applic gener architectur techniqu independ specif intern detail reli measur compar input system output earlier paper complet descript system calibr step requir ensur accur estim ey posit posit object workspac predict frame rate frame lag data acquir final base specif provid manufactur silicon graphic confirm theoret test perform softwar ensur data lost record posit analog data hz equip confirm remain synchron frame rate phase differ constant experi multipl time test hz displai frame rate horizont vertic refresh signal verifi predict valu confirm system throughput predict hz frame rate measur lag perform estim frame agreement theoret model visual estim lag adequ experi run futur experi requir accur estim lag system unit collect posit analog data system unit synchron clock mean frequenc phase clock differ data frame collect softwar system unit buffer older data read data frame collect solut problem fulli resolv implement addit modal system haptic audio current work step assum frequenc clock phase drift slowli respect concern develop graphic scene complex small collect geometr reduc larg delai ms ms read data system unit posit data analog data read time due system limit obviou solut overlap collect data model add lag data frame standard encount system solv predict method estim current posit base data previou posit similar predict scheme estim accur forc inform differ import estim lag accur resolut calibr techniqu calibr procedur estim lag similar method requir special hardwar approach special hardwar support calibr lag experi extern calibr ir physic rotat workspac modifi turntabl figur angular veloc adjust rpm knob connect adjust fine adjust posit sensor custom determin period ms observ discern speed variat number measur accomplish mount ir mm diamet physic disk attach turntabl mechan linkag construct disk make easi virtual object displai modifi turntabl ω physic disk θ virtual disk fine speed control arm hold marker ir system unit camera ir marker figur turntabl extern calibr physic disk spin determin posit send workstat white virtual disk ideal physic disk time virtual disk render physic disk move physic virtual disk separ θ radian measur θ constant angular calcul system simpl θ ω blur resolut angular veloc turntabl speed angular virtual physic spatial resolut system lag calcul faster move object blur captur video photographi faster shutter speed light photograph light obtain discern imag room light monitor displai figur textbook ware photograph physic virtual disk analog camera user sit figur posit orient camera track monitor ir side head track asa shutter speed minim motion blur light flash reflect turntabl illumin light room indirect light film avoid color shift phenomena fluoresc light resolut figur workspac setup extern calibr physic disk rotat plane ir determin disk posit point time physic object freedom track system requir ir track physic render augment object requir time oper object fewer freedom ensur obtain worst case estim extern calibr read full complement data requir perform gener posit orient calcul ensur comput overhead high regular usag measur tempor lag experienc subject experi verifi accur calibr virtual disk physic photograph turntabl stationari posit photograph physic disk back side workspac photograph shown figur left side white virtual disk close top black physic expect immedi pictur stationari seri photograph turntabl spin rpm figur show photograph virtual disk lag physic disk virtual disk found lag physic disk standard deviat correspond ms close match theoret system lag model ms measur worst case lag virtual disk displai bottom screen scan left side photograph photograph reveal fade virtual disk disk behavior fast fluoresc entir period refresh scan calcul suggest virtual disk fade half quarter photograph reason addit analyz black angular line photograph figur verifi lp turntabl spin rpm photograph shutter speed black angular line blur turntabl rotat rpm determin confid turntabl spin constant speed rpm confirm exposur observ doubl half blur examin posit data obtain period rpm ir posit intern calibr fed blue monitor signal softwar render color scene initi black monitor full intens pixel voltag higher pixel screen black softwar detect voltag channel time softwar render color scene softwar detect voltag chang analog channel repres system lag log hz analyz determin number input sampl displai output voltag chang result chang displai color black full intens time inform obtain partial fill screen bottom solid color screen channel detect voltag frame monitor refresh top bottom point figur depict screen half color screen point shift left provid time inform calibr modifi sampl rate channel observ subtl voltag sampl displai roughli visibl scan line frame voltag chang color chang black voltag chang detect softwar figur timelin intern calibr rgb monitor signal activ time figur approxim signal devot vertic horizont retrac green signal horizont vertic synchron red blue signal vertic synchron inform control sampl time convert mean signal sampl synchron phase activ phase detect voltag chang signal activ blue signal conduct test batch trial lowest time lag estim batch trial repres actual system lag techniqu work indic averag lag frame time softwar begin updat scene graph color record log file addit frame ad complet close total frame frame time estim extern measur hz sampl rate system round lag upward integr number frame intern techniqu estim discuss lag concern augment virtual environ chose sensor number primari concern low latenc posit shaw green report ms lag polhemu sensor newer model polhemu gener consid superior tracker measur ms lag includ overhead present actual applic conduct test softwar run experi modif techniqu extern calibr measur angular differ physic virtual disk determin lag visual approach viewer adjust predict phase angl virtual disk physic disk provid simpl interact calibr accur approach video camera shaw obtain quicker access imag spatial tempor resolut compar film advantag video extern calibr fed directli emploi standard imag process techniqu autom estim lag intern calibr analyz examin log file produc standard softwar easili figur obtain analog data faster hz log file limit system architectur issu manufactur limit lag calibr maintain synchron intern calibr techniqu output video signal encod time trial support multipl video output sampl video output channel obtain continu estim sensor lag experi basic assumpt synchron mean lag chang rapidli intern calibr techniqu work situat applic techniqu knowledg system lag improv visual qualiti augment environ support lag estim compar tradeoff hardwar softwar configur model figur remov read channel free ms time complex graphic scene affect tempor lag experi involv forc analog graphic significantli improv util predict track algorithm updat augment scene tempor lag gener augment scene futur point time common predict algorithm augment scene match current state state ms past situat user quickli interact system fast hand requir predict track accur estim lag time predict predict identifi system bottleneck suggest method system enhanc initi system lag test isol commun delai scsi devic data frame lost system configur scsi devic data frame longer lost aid complet integr addit system modal feedback modal synchron provid compel experi data research experi knowledg system lag enabl monitor subject continu provid feedback appropri synchron relat research earlier research identifi critic problem augment realiti system elli al conduct experi task similar result suggest ms threshold asymptot perform degrad shaw al discuss problem lag distribut virtual state describ techniqu adjust data sensor latenc achiev consist model physic virtual al describ number wai render pipelin reorgan reduc latenc mcmillan bishop specif imag warp mechan due adjust render imag base data recent data render imag augment realiti system techniqu lag comparison kalman filter predict conduct wu techniqu improv perform lag high kalman filter provid state al discuss augment realiti system surgic hybrid track system gain greater accuraci system augment virtual imag merg video imag physic scene afford opportun delai video lag virtual imag video augment option system merg virtual imag vision physic scene system augment realiti calibr techniqu obtain accur static dynam estim lag work address specif question accur measur lag techniqu appli intend result design accur predict scheme incorpor static measur dynam assumpt note earlier lag vari rapidli experi techniqu appli system equip requir basic modifi easili construct part suit situat pendulum green calibr requir close loop analog analog case haptic devic techniqu futur work problem remain solv close loop calibr video signal input signal vertic horizont blank interv signal condit simpl filter circuit elimin problem provid robust intern calibr input channel monitor secondari video output channel reserv complet close loop calibr procedur invok trial adapt chang paramet predict filter similar close loop calibr techniqu determin lag audio output add system connect audio output voltag input mechan measur delai audio displai manner similar graphic displai measur lag haptic displai difficult higher frequenc requir proper forc feedback acknowledg author faculti enhanc virtual hand lab patienc frank dr evan graham softwar dr christin mackenzi critiqu suggest special ron long shoot develop black white photographi refer factor influenc oper interact virtual object view headmount view condit render latenc ieee virtual realiti annual intern symposium ieee comput societi pp manag latenc complex augment realiti system symposium interact graphic rhode pp realism virtual realiti environ symposium user interfac softwar technolog hilton south pp warp symposium interact graphic rhode pp combat render latenc symposium interact graphic pp decoupl simul virtual realiti mr toolkit acm transact inform system technolog augment realiti realiz needl acm confer comput graphic pp cl calibr augment realiti testb symposium interact graphic pp object transport orient virtual environ phd thesi simon fraser british columbia ks structur object transport orient interact confer human factor comput system lo pp inform visual morgan kaufman publish san ca track experi latenc method virtual environ acm symposium user interfac softwar technolog pp figur stationari physic virtual disk figur physic virtual disk rotat rpm
Agents/564 1 cooper plan agent web agent david universidad carlo iii de madrid de la spain universidad carlo iii de madrid de la spain daniel borrajo universidad carlo iii de madrid de la spain ricardo universidad carlo iii de madrid de la spain abstract paper present plan system cooper work di erent intellig softwar agent main goal solv user plan problem inform store world wide web made heterogen mixtur intellig agent main characterist knowledg share architectur type bridg user coach manag rest solv plan nalli aim share inform obtain web solv plan problem mean cooper solv plan restrict easier problem call abstract cooper valid complet abstract solut order cooper common languag data structur de ned introduct vast amount inform store web user connect network inform heterogen distribut web inform user solv di erent problem spend time analyz data internet lot web applic search engin engin user inform impract build singl uni ed system combin inform sourc user reason summar number inform sourc web grow exponenti lot web inform sourc provid similar inform travel suitabl plane compani destin di erent compani displai web similar data di erent di erent inform sourc provid kind inform easi combin achiev common goal neo domain evacu combin inform weather forecast site inform obtain gi inform server inform store chang dynam time short term weather forecast site good due previou current web search engin basic reli pure syntact textual inform retriev approach integr set di erent special cult maintain develop kind system ambit knoblock user heterogen inform obtain satisfactori result problem solv short time high qualiti true system lter repres ecient inform obtain web system amount inform retriev integr heterogen inform goal complet good qualiti inform necessarili end user solv complex problem system includ intellig element reason complex domain travel suppli good plan combin di erent mean transport ecient neo militari oper intellig system move unit suppli terrain coordin ecient manner arti cial intellig softwar compon ll plan system good qualiti plan complex machin learn system learn experi ai techniqu system framework part call distribut arti cial intellig system built set modular agent special solv problem aspect decomposit agent paradigm solv problem ma agent extens brenner wooldridg properti ma summar agent incomplet amount inform requir abil solv problem central control data agent share data system execut agent work receiv queri anytim agent intern state reason environ possibl learn improv behavior agent framework advantag system societi heterogen softwar commun common languag ma address directli problem integr heterogen handl di erent kind problem complex web inform retriev system mention ma solv ai shown worth di erent agent combin abil synerg shown call learn di erent system provid di erent characterist common goal shown di erent planner work di erent domain veloso case good idea combin di erent planner agent ma system wilkin er adapt ma common languag commun heterogen agent easi add agent requir characterist essenti larg unpredict domain ma inher permit execut ecient complex problem ai integr coordin di erent agent complex problem address bond interdepend problem agent system cooper ensur interdepend properli manag paper present distribut architectur accept queri user queri problem solv system produc solut schemata mean ai problem solv techniqu valid complet inform web paper divid section present relat work multiag section describ section analyz system interact user section present web design system applic section summar section show futur line work relat work approach work wai inform store web approach focu retriev reason inform section analyz system show handl store data focu system web intellig multiag system develop deploi recent web internet applic classi ed di erent wai classi cation system simpl system retriev store popular inform retriev applic main goal system search retriev web inform complex system transform inform share system cooper obtain solut user kind system wide rang achiev complex task retriev inform figur displai classi cation common web applic solid line show kind system belong class discontinu line show applic built subset characterist intellig robust system intellig agent intellig agent softwar entiti assist peopl act behalf make user simpl search engin engin softbot intellig agent complex system figur gener classi cation web system life save provid ed view complex world intellig agent learn past experi agent experi anticip necess user agent technolog combin technolog brenner includ limit neural expert fuzzi machin dicult accur agent wide literatur brenner point intellig agent natur reactiv wooldridg agent learn result action mention mistak armstrong agent predict natur armstrong selberg kei attribut paradigm includ mobil brenner wooldridg agent characterist fact agent move environ requir case agent social natur collabor agent deleg task subordin agent suit agent wooldridg di erent success intellig agent develop recent agent brie softbot agent interact softwar environ interpret environ feedback softbot ector unix command agent chang user environ state etzioni softwar agent user environ construct system main compon basic softwar agent comput framework build agent essenti agent oper system de nition program languag user implement typic softwar agent assist meet schedul agent sim ariadn intellig inform agent inform retriev integr di erent kind inform sourc sim integr craig knoblock knoblock ariadn project deal access inform structur web sourc ambit knoblock enorm number web applic er di erent search engin web internet user section due current evolut web inform requir sort intellig assist user applic consult internet site perform agent speci track submit requir inform perform speci internet task point function agent instal system speci lot research develop kind system mention metacrawl metacrawl softbot parallel web search servic singl interfac user queri popular web search lyco altavista metacrawl characterist obtain result higher qualiti simpli show output search servic selberg letizia user interfac agent assist user world wide web user oper convent web agent track user behavior attempt anticip item interest autonom explor link user current posit agent autom strategi consist rst search augment heurist infer user interest behavior webwatch agent world wide web user webwatch kind inform accompani user page page user highlight believ interest strategi give advic learn feedback earlier tour webwatch onlin irregular basi armstrong joachim intellig web agent develop kaiserslautern search assist search internet base dynam plan plan execut techniqu system due grow import develop softwar commerci research agent develop toolkit dicult select toolkit design architectur paradigm examin popular toolkit deploi ma popular commerci toolkit build test softwar agent construct commun kqml queri manipul finin develop extend standard kqml perform includ addit perform jafma toolkit framework develop structur idea speci agent applic direct develop perspect support multicast direct kqml perform perform analysi system coher consist jade agent develop softwar develop framework aim develop system conform fipa standard intellig agent jade consid agent implement agent platform develop framework pitt jatlit framework creat system jatlit includ messag router messag router simpli amr support messag bu agent fail recov agent send receiv messag kqml messag bu er support mechan agent move freeli host kasbah virtual market place web user creat autonom agent bui sell good behalf user paramet guid constrain agent behavior intellig agent kasbah object instanc market place creat bui sell interact market agent agent complet autonom agent ai machin learn techniqu main interest kasbah aspect good framework test di erent import characterist kind system negoti chavez multiag plan architectur framework integr technolog system capabl solv complex plan problem design applic plan problem solv individu requir coordin ort set technolog human expert wilkin wilkin ma architectur develop cmu mellon execut monitor perform appli evacu oper system integr agent includ mmm user interfac develop research ariadn mention mention goal pick carri civilian safe place agent collabor ariadn locat civilian rout plan transport monitor react event track inform provid obtain veloso hierarch system develop plan militari activ move execut aim combin delib reactiv behavior agent societi organ hierarch militari manner command command tank framework reactiv behavior agent lower level hierarchi guid delib plan agent hierarchi constraint planner anytim planner combin hierarchi baxter architectur reason web main advantag ma techniqu exibl adapt result system ma made heterogen element element plai di erent program execut di erent modifi behavior dynam ma approach integr heterogen agent agent build di erent set user web architectur hide web user user avoid cope overload inform figur show architectur physic repres user reason layer connect physic agent set system agent access desir inform access inform layer retriev inform distribut sourc repres understand previou layer inform repres inform kind electron support access inform retriev system reason layer physic world inform world access inform layer figur layer implement previou figur system built set agent share knowledg cooper search solut problem pose user architectur design cope frequent problem exist web intern knowledg sharabl di erent reason techniqu agent search solut ma approach integr di erent heterogen agent di erent role summar agent connect physic world reason layer pai agent user agent user agent planner agent planner problem solut problem solut world inform web layer reason layer world physic control agent figur gener architectur tion user queri displai solut solut found system problem queri user give moment develop di erent kind futur subsequ request solut problem agent belong reason layer due organiz structur di erent type main role summar handl insert delet agent system agent build dynam team special problem solv task agent manag set heterogen agent repres team agent accept problem agent system solv figur show interrel kind agent rest system agent agent organ manag coach system manag manag belong team correct work team figur manag coach agent organ agent reason receiv plan build abstract solv di erent skill commun plan agent belong access inform layer connect reason layer inform world main goal ll detail abstract plan obtain obtain inform web basic characterist figur control manag task perform agent modul basic made set special skill knowledg modul di erent agent store knowledg skill modul implement special skill agent system commun implement commun protocol system agent modul implement transport implement network level commun agent run di erent comput languag implement standard version kqml finin finin share common languag agent control modul heterogen inform knowledg base profil commun modul languag modul transport modul figur built set standard reusabl java packag class implement basi build di erent system agent subsect give detail descript di erent organ main role connect user set graphic user interfac commun user implement standard languag kqml commun agent system figur modular descript architectur shown heterogen inform control modul commun modul knowledg base profil figur architectur knowledg modul store set di erent user pro le success learn skill analyz custom system main goal accept problem show solut found analyz problem obtain homogen commun solut characterist develop moment order ful ll previou provid domain speci set gui repres inform commun extern de ne ontolog agent system type problem solv section set gui analyz domain shown modular architectur modul capabl task reason agent system figur show modular descript heterogen inform control modul commun modul knowledg base server plan figur architectur interest characterist commun implement subset speci perform share plan knowledg store inform agent main heterogen store data applic plan inform agent characterist statist plan server modul store plan solut control manag di erent agent modul main handl abstract valid inform acquir heterogen inform sourc build agenda handl question agent task handl answer question reason learn modul modifi system behavior obtain solut success user queri plan modul gain ecienc plan process retriev adapt store solut agent avoid plan process veloso plan work solv user problem plan modul linear planner veloso planner main reason modul agent gener abstract problem speci user queri planner obtain abstract solut nalli cooper ll gap abstract solut modul develop moment previou type control agent architectur figur di erent role knowledg base commun modul control modul control skill polici figur gener architectur summar di erenc add remov agent system manag agent activ agent societi group team agent determin agent share di erent team control team stabil smooth work activ agent report problem agent requir team agenda agent team coher work correctli manag coach build team agent reason user problem system modular architectur architectur shown figur handl question agent translat question queri access web access answer web ltere store data base inform place request inform web heterogen inform control modul commun modul knowledg base queri request figur architectur gener architectur appli di erent paper present implement set special task repres inform web domain section problem solv cooper architectur di erent agent cooper reach solut di erent agent share knowledg skill complet abstract solut obtain success share knowledg obtain solut di erent web reason skill agent solut user section format share commun gener cooper solv process analyz share inform agent agent common knowledg characterist simplifi process share reason knowledg commun agent perform perform store implicit order agent commun system subset kqml format finin format shown tabl perform format achiev compani mad java price java tabl perform show achiev rst perform web inform special perform request request store retriev inform obtain kqml perform implement agent manag group agent agent cooper section present cooper solv problem gener point problem pair nal problem person nal broken car solut problem sequenc action initi situat nal action de ned term oper oper screw solut car xing problem plan show figur figur fix car plan set problem oper call domain goal give solut problem domain de ned sequenc solv problem user interact de ne problem send achiev perform problem de nition receiv user problem analyz user problem lot detail make problem solv classic ai plan system attempt solv discard detail transform user problem abstract car xing di erent kind piec tool handl piec reduc number kind piec tool manag size user problem transform abstract reduc set piec tool plan system solv abstract problem abstract solut user requir detail appli plan abstract solut valid realiti ignor actual detail abstract plan complet valid analyz part abstract plan requir detail receiv queri agent special return inform share format told discard plan includ invalid oper di erent car compani inform technic characterist special ll request detail inform valid fix tool handl plan step discard receiv perform valid complet abstract return complet plan complet solut includ action perform speci tool piec plan util directli user applic appli problem solv domain describ appli domain di erent agent cooper solv problem domain idea earlier version section rst describ domain solut describ di erent agent cooper provid solut user commun detail electron tourism domain system provid user servic inform origin destin town di erent mean transport lodg destin inform possibl visit town local return initi town abil focu logist problem provid user plan move place place move place place involv long rang travel achiev mean buse involv local transport mean move bu train station order repres provid solut de ned domain oper tabl commun gui describ problem restrict gui depend problem domain requir gui figur show system figur user agent input data user suppli system departur return date departur arriv citi origin arriv place insid citi train bu oper argument destin destin destin destin destin citi tabl plan oper return trip maximum number transfer econom cost rst tourist long rang kind transport figur user travel barcelona madrid june return date june user start travel airport end trip train station barcelona minim cost mind kind long rang transport transfer receiv user send achiev perform wait solut cooper receiv problem proce build abstract retain part essenti plan process typic descript previou problem ai plan system citi world train insid citi train compani world local transport citi classic ai plan system plan element mention build abstract problem de ne abstract citi citi includ local long rang transport termin user includ user travel plane abstract citi includ airport goal reduc number element planner handl cientli previou restrict long rang abstract citi bu train station abstract citi repeat time maximum number transfer suppli user import remark citi abstract citi attach present abstract plan repres nal travel rest detail provid user stage departur arriv travel consid data queri valid abstract solut problem construct plan problem includ departur transfer citi citi includ local abstract locat termin plan problem includ initi situat user goal user abstract problem planner obtain abstract solut planner repli plan figur solut solut figur abstract solut gener prodigi travel problem set abstract plan detail plan step exist actual world plan valid complet achiev queri queri schema user madrid user queri uninstanti variabl instanti queri actual citi heurist select actual queri gener rst queri schema translat user madrid user madrid queri addit inform airplan variabl instanti receiv queri data transform actual web queri structur data store web site special inform web sourc inform retriev analyz store common subsequ inform tabl return instanti variabl variabl instanti ight madrid valencia instanti abstract plan receiv posit answer plan step plan step receiv answer empti answer reject plan back abstract plan instanti di erent actual plan tabl show gener solut null currenc esp esp esp null null null mad mad mad vlc vlc vlc class null tabl retriev inform mad vlc mad vlc tabl solut commun list actual plan receiv displai user figur show found plan problem displai solut tabl user inform plan click oper data departur present approach solv plan problem inform distribut web paper solv user plan problem mean cooper cooper amount divid plan problem gener abstract plan plan plan problem lot detail make classic ai figur output lem solv attempt solv plan discard detail build abstract version easier solv abstract solut obtain abstract problem abstract solut valid realiti ignor actual detail abstract plan complet valid import reason divid plan process cooper agent inform web heterogen provid multipl format make di erent agent special inform sourc web site free isol complex inform sourc set conceptu idea architectur implement appli actual domain cooper characterist fulli exploit futur line work cooper plan problem divid set subproblem subproblem di erent reason problem solv parallel kind subproblem special di erent plan techniqu inform store agent learn experi solv store intern agent similar inform retriev reduc web access applic case base reason techniqu aamodt veloso plan problem solv adapt solv plan similar reduc enorm plan process order overload user order solut recommend user pro le learn user previou behavior refer aamodt aamodt plaza case base foundat methodolog variat system approach ai ricardo daniel pedro genet program multistrategi approach fifteenth intern confer machin page juli ambit ambit knoblock plan ecient gener plan fourteenth nation confer arti cial ambit jose lui ambit craig knoblock agent inform gather ieee intellig system armstrong mitchel learn world wide web work note aaai spring inform gather distribut page stanford aaai press baxter baxter hierarch distribut plan framework simul battl eld entiti workshop uk plan schedul special interest group decemb fabio giovanni jade agent framework page april bond alan bond gasser read distribut arti cial intellig san francisco morgan bradshaw softwar agent menlo park brenner wittig intellig softwar agent foundat applic david daniel jose manuel molina multiag system solv web electron travel problem workshop recommend system fourth intern confer autonom june acm david daniel borrajo multiag approach electron travel plan intern workshop inform system tx juli albert baker multiag applic develop system intern confer autonom agent minneapoli chavez anthoni chavez patti mae agent marketplac bui sell good intern confer practic intellig agent april michael coen softwar agent environ construct system mit ai lab technic report craig knoblock aren craig knoblock hsu cooper agent inform retriev intern confer cooper inform toronto etzioni segal build softbot unix softwar spring symposium report page pp aaai oren etzioni move food chain ai summer finin tim finin jai weber al draft speci cation kqml agent commun languag finin tim kqml agent commun languag intern confer inform knowledg manag page associ comput le gasser distribut arti cial theori chapter overview page kluwer michael steven ketchpel softwar agent commun ralph dynam plan search internet workshop und kon michael munindar singh read agent san francisco morgan nichola jen coordin distribut arti cial page ohar joachim thorsten dayn tom mitchel tour guid world wide web august knoblock craig knoblock lui ambit softwar chapter agent inform gather bradshaw menlo knoblock craig steven jose lui ashish model web sourc inform integr fifteenth nation confer arti cial lieberman agent assist web intern joint confer arti cial intellig page charl petri intellig ieee decemb pitt jeremi pitt fabio semant pa acl implement jade selberg erik selberg etzioni metacrawl architectur resourc aggreg web ieee page pp softwar overview knowledg engin sycara multiag system ai system integr toolkit construct intellig softwar agent system februari tim jame eld secret secur architectur kqml agent commun languag acm cikm intellig inform agent workshop associ comput decemb veloso manuela veloso jim blyth examin causal link commit plan intern confer ai plan page june aaai ca veloso manuela veloso jaim carbonel deriv analog autom case util machin march veloso integr plan prodigi architectur journal theoret veloso manuela tucker scott integr inform execut monitor june wilkin david wilkin karen myer common knowledg plan gener reactiv execut journal logic wilkin wilkin myer multiag plan architectur fourth intern confer arti cial intellig plan system june wooldridg michael wooldridg nichola jen intellig theori practic knowledg engin octob
AI/565 2 speaker detect dynam bayesian network submiss abstract develop interfac pose challeng action intent user infer sequenc noisi ambigu sensori data tempor fusion multipl sensor effici formul dynam bayesian network dbn framework power statist infer learn combin contextu knowledg problem demonstr dbn tackl problem speaker detect visual audio sensor mouth silenc optim fuse contextu inform dbn architectur infer instanc individu speak result obtain setup actual interact system demonstr superior approach fusion architectur introduct advanc interfac increasingli reli sourc multipl inform ambigu sourc make statist infer crucial interfac applic address applic dynam bayesian network task detect user speak comput dbn class graphic probabilist deriv bayesian network bayesian network successfulli emploi wide rang expert system support applic lumier project bayesian network model user goal window applic dbn graphic encod depend set random variabl evolv time elegantli combin benefit model structur depend variabl priori determin expert design knowledg task domain strength influenc learn larg set data applic dbn found paper demonstr dbn fuse multipl visual audio contextu tempor constraint expert knowledg solv challeng speaker detect problem improv static network architectur shown figur dynam combin output simpl algorithm detect presenc speaker structur network encod context task knowledg oper sensor condit probabl arc network relat sensor output task variabl probabl learn automat train data analyz problem interact scenario geni kiosk plai game human user paper make contribut demonstr strength dbn fuse tempor data weak sensor expert knowledg task domain contextu state environ present network architectur figur infer state speaker activ interact geni game evalu learn dbn model superior previou static bn model speaker detect problem speaker detect fundament problem comput system argu person activ user expect face system speak visual cue decid person face system move lip capabl distinguish activ user activ listen smile audio detect presenc relev audio environ simpl audio cue suffici discrimin user front system speak system user speak individu contextu inform describ bear user activ speak context user expect speak audio visual cue context jointli infer activ speaker smart kiosk develop compaq cambridg research lab interfac user interact system spoken command natur kiosk applic domain make ideal setup speaker detect task kiosk figur camera mount top visual feedback microphon acquir speech input user setup form ideal testb problem analyz problem speaker detect specif scenario geni kiosk version kiosk simul game primari subject secondari subject microphon microphon audio pc frequenc encod geni figur smart kiosk setup data collect figur user set spoken command interact dealer plai game sensor audio visual inform obtain directli kiosk sensor set visual audio cmu face detector gaussian skin color detector face textur mouth motion audio silenc detector compon advantag easi implement easi explicitli tune problem speaker detect detail descript face mouth motion detector found contextu sensor clear import state environ infer state user contextu inform user expect speak comput user likelihood user speak comput answer simpl queri made user likelihood activ speaker setup select simplifi state game contextu inform game state user turn complement onset contextu state mark beep specif frequenc avoid distract frequenc encod contextu signal directli plai speaker figur dynam bayesian network speaker detect dynam bayesian network class bayesian network specif tailor model tempor consist present data set bayesian network conveni graphic describ depend random variabl variabl repres node direct acycl graph arc correspond condit probabl distribut depend variabl coverag subject comput task perform order bn classifi network topolog task obtain local condit probabl tabl variabl condit learn expert remain task comput probabl set node queri set node evid speaker detect evid node discret output sensor queri node probabl detect speaker detail standard bn algorithm addit describ depend static variabl dbn describ probabilist depend variabl time instanc dbn specif structur shown figur set random variabl time instanc repres static bn variabl set tempor depend distribut variabl time depend variabl time condit distribut pr structur depict figur probabl distribut variabl dbn gener written pr pr pr worth note specif stochast model classifi dbn year linear dynam system hidden markov model special case dbn continu discret major benefit dbn network structur simplifi infer complex infer gener bn reduc gener messag pass procedur dbn techniqu hmm literatur linear dynam procedur kalman filter smooth infer dbn reduc simpl bn origin model plethora infer techniqu adapt dbn dbn structur complex ld hmm infer techniqu exist simpl model detail found constrain crucial assumpt justifi special treatment dbn li fact entri condit distribut network assum vari pr depend compact dbn simplifi compact effici em learn algorithm appli suffici statist requir em learn comput consecut time slice learn algorithm hmm case learn complex dbn structur benefit speaker detect problem repres challeng ground test power dbn model complex fusion task type sensor seamlessli integr model reflect expert knowledg domain sensor benefit abund observ data approach model build task tackl expert design network fuse individu sensor group proce integr sensor network contextu time aspect plai paramet learn visual network vision network model depend observ made vision sensor vision sensor infer user face kiosk face directli accomplish small bn binari output sensor input output queri variabl visibl frontal inform user design network structur depict graph shown figur directli observ infer sensori data expert knowledg lead topolog network user depend user part skin face imag face detect sensor detect frontal face plausibl connect node probabl distribut defin visibl frontal face detector textur detector skin detector figur vision network visual network pr pr correspond simpli visual network speaker posterior distribut interest pr posterior effici obtain number bn infer techniqu junction tree optim bayesian speaker present made pr audio network compon sensori data provid call audio inform silenc detector mouth motion detector infer user talk silenc detector detect audio signal present environ discrimin audio signal origin background sourc result user vision sensor motion supplement audio signal result audio network shown figur binari queri node captur inform user talk network demonstr fusion audio visual inform low level mouth motion detector vision close relat silenc detector vision sensor probabl distribut defin audio network motion silenc detector audio figur audio network speaker detect pr pr denot node network speaker optim made compar pr pr integr network audio visual network fuse obtain integr network stage incorpor inform environ plai decid user state contextu inform visual audio subnetwork fuse singl net virtu speaker shown figur chosen network topolog repres knowledg contextu condit met presenc speaker game user expect speak face kiosk talk infer user visibl frontal face detector textur detector skin detector speaker audio contextu inform silenc detector mouth motion figur integr network find posterior pr posterior easili obtain number bn infer techniqu dynam network final step design topolog detect network involv tempor aspect charact observ process involv justifi tempor depend shown ambigu individu sensor time instanc lead incorrect infer speaker speaker frontal audio chang rapidli time probabl speaker present time inform expect made speaker time measur inform consecut time step fuse make inform expert knowledg part speaker detect network tempor depend shown figur speaker audio audio frontal frontal speaker figur tempor depend frontal node consecut time instanc presenc arc node stem lack exact knowledg tempor depend present determin data formal techniqu network structur learn found incorpor element element singl structur lead dbn shown figur node shown dot line direct observ node solid unobserv node speaker node final speaker detect queri node infer network correspond detector textur detector skin detector inform silenc detector mouth motion visibl frontal speaker audio audio frontal speaker observ hidden node face detector textur detector skin detector inform silenc detector mouth motion visibl frontal speaker audio audio frontal speaker observ hidden node figur time slice dynam bayesian network speaker detect ing distribut speaker variabl time instanc condit sequenc measur tx fd mm ct sk tx fd mm ct optim detect speaker time made compar pr pr posterior obtain directli infer algorithm interest predict likelihood speaker previou pr learn topolog dbn discuss previou section learn network paramet formul maximum likelihood paramet problem straightforward applic em algorithm dbn iter lead optim data simplifi learn procedur isol learn portion dbn transit learn network assum tempor emploi fix network learn transit probabl suboptim procedur shown practic yield good paramet estim differ significantli optim stage draw attent fact probabl stai state consecut time instanc decai exponenti speaker detect prefer model constrain environ game durat state tend fairli defin durat word small vocabulari dealer agent effect defin durat contextu state bear user speaker explor durat densiti dbn model state durat explicitli model infer model length durat model adopt techniqu suggest learn inferenc experi result conduct experi conduct common data set data set sequenc user plai game geni setup sequenc vari durat sampl total frame figur show record frame video sequenc sequenc includ audio figur frame test video sequenc video track record frequenc encod contextu inform figur visual audio sensor appli audio video stream sensor provid continu estim respect function silenc sensor intern output energi audio threshold determin sensor yield binari sensor state silenc discret state input dbn model exampl individu sensor frontal silenc shown figur abund ambigu sensori output justifi intellig sensor fusion figur figur show ground truth speaker state mean speaker mean absenc axi frame sequenc contextu inform user turn plai mean comput plai output mouth motion silenc detector experi static bn experi static bn figur form baselin comparison dynam model experi sampl sequenc consid independ sampl part data set consid train data rest retain test train output sensor hand label valu hidden node frontal node present network network learn expect actual valu show presenc speaker express presenc talk frontal face context game exist frontal face necessarili speaker present test sensor output present infer obtain valu hidden node mismatch consid error cross valid train test data averag accuraci obtain figur result individu accuraci low learn network paramet explain figur depict typic output sensor ground truth speaker state sensor data noisi hard infer speaker make substanti error figur show ground truth sequenc state speaker show dd dbn dbn bn figur comparison result obtain static decod sequenc static bn tempor consist queri state ground model built exploit fact figur figur show true state sequenc decod state sequenc static state state state experi dbn experi conduct dbn model sequenc level data consid independ independ learn algorithm section emploi learn dynam transit probabl audio state test phase tempor sequenc sensor valu present model viterbi decod find sequenc speaker state obtain accuraci speaker detect cross improv static bn model indic actual decod sequenc decod sequenc dbn model ur closer ground truth decod static model clear dbn model perform static inher tempor correl featur exploit dbn confirm expect learn tempor transit node experi final test power approach durat densiti state durat twenti learn label data figur show learn state graph plot audio evid graph durat distribut differ exponenti distribut dbn model speaker detect accuraci improv model averag accuraci obtain figur show decod state sequenc model improv perform model figur durat densiti plot state model shown audio state sever hamper complex complex infer exponenti durat state prevent model favor simpler power dbn demonstr gener approach solv interact task dbn fuse output simpl audio visual sensor exploit tempor correl dbn provid intuit graphic framework express expert domain knowledg tempor consist process coupl effici algorithm learn infer repres complex model stochast learn rule simpl express data set simpler static multisensor fusion model base bn introduc dbn model tempor consist present task shown improv perform made static model speaker detect experi network figur demonstr classif rate advantag principl dbn framework obviou complex task scale upward dbn provid viabl altern encount complex adhoc algorithm design determin knowledg expert user futur work valid network design larg subject popul realist condit background clutter investig improv sensor model plan step singl maker engag power pool expert model infer complex variabl depend refer hidden structur complex dynam proc uncertainti artifici pp christian smart kiosk dean model reason persist comput vol graphic model machin learn digit commun mit dynam bayesian adapt process tempor inform gile lectur note artifici lumier bayesian user model infer goal softwar proc conf uncertainti pp introduct bayesian network probabilist reason intellig system san morgan rabin fundament speech recognit englewood prentic ramesh state durat hidden markov model automat speech proc ieee intl confer signal smart proc ieee conf comput vision pattern speaker detect bayesian proc ieee conf comput vision pattern face proc ieee conf comput vision pattern pp introduct proc intl joint confer artifici yang face proc workshop appl comp pp
IR/566 5 match cluster entiti introduct william jacob lab comput scienc henri carnegi mellon pa pa inform retriev larg studi method assess similar pair document document similar metric task includ ad hoc document text classif summar problem area similar metric central record linkag determin record sourc refer entiti determin record insur refer determin bibliographi paper list journal refer public exampl practic record field paper titl natur document similar metric develop ir commun match cluster entiti recent substanti amount work address question tradit ir document similar metric compar short inform entiti similar metric shown competit superior similar metric string base metric varieti rang bibliograph refer scientif paper anim speci popular movi similar accur similar fastest reason usefulli appli combin similar test describ techniqu adapt modifi document similar metric evalu techniqu evalu learn similar metric combin simpl idf base distanc scheme hope learn distanc metric improv distanc metric ultim provid perform compar distanc metric entiti match scheme evalu sole context match conjectur similar learn method task involv document similar document cluster defin present present result discuss relat work present conclud remark adapt match cluster method begin formal defin problem adapt match cluster formal preliminari gener learn assum sourc train pair problem instanc loss measur qualiti solut rel optim intend solut prototyp binari classif set binari vector object learn system set train exampl learn solut problem xj wai formal goal goal paper prove deep theorem adapt simpli motiv describ class adapt adopt simpl notion imagin repeat game time step learner receiv problem instanc solut final desir solut step learner suffer penalti system converg step sequenc cumul adapt match paper adapt system problem instanc solut complex case learn adapt formal task learn match domain domain learn match address research affili formal problem instanc set string address research regist solut set pair specif subset pair match natur loss function size symmetr differ experi measur rel match problem constrain suggest case intend match refer match address sigir research entri phone book entiti refer distinct make solut paper constrain adapt match pair requir adapt cluster problem adapt cluster set string intend assign string encod function integ candid loss function obviou constraint loss function depend cluster permut valu chang loss rel intend assign conveni choic defin number pair cluster state defin size symmetr differ relat base definit loss close relat cost function cluster natur variat problem number case simpli problem instanc pair call variat adapt relationship learn similar formul close connect adapt adapt classif learn natur reduct problem observ constrain adapt match reduc cluster adapt cluster algorithm lc converg construct constrain adapt match algorithm lm converg step desir match function written assum number element integ construct match convert match instanc cluster instanc union pair pair pair pair cluster element map cluster unmatch element train produc cluster instanc reconstruct pair note unconstrain match reduc cluster absent pair overlap arbitrari cluster disjoint observ adapt cluster reduc adapt match adapt cluster algorithm converg construct constrain adapt match algorithm lc converg step idea reduct pair object iff belong cluster cluster instanc convert match instanc exampl train lc cluster problem instanc convert match problem instanc cluster deriv set pair assum find cluster creat cluster connect compon set pair note close relationship adapt match binari classif learn make introduc idea stage classif learner forc step make classif predict set singl object adapt system problem instanc vector object solut vector bit ham distanc easi adapt match reduc minor variat classif observ adapt match reduc stage classif learn reduc adapt match stage classif convert match instanc pair vector pair pair compon pair observ suggest adapt match cluster implement learn learn function map pair indic match note learn reduc adapt observ learn reduc adapt match reduc adapt match stage classif convert learn instanc match problem singl pair differ simpl natur reduct show problem constrain adapt adapt cluster perfect solut problem perfect solut solut achiev practic closer examin show loss enlarg dramat dramat reduct adapt match system deriv adapt cluster observ imagin case intend pair empti cluster algorithm place ai constant function pair cluster loss loss cluster adapt cluster system deriv adapt match observ problem instanc intend cluster place item cluster pair match system construct cluster pair remark notic pair correspond map trivial creat cluster connect compon pair graph lead cluster loss loss match system reduct tight respect loss observ adapt match learn addit loss suffer constrain adapt match system learn system remark note problem adapt match cluster superfici similar learn similar strong show good solut problem necessarili good solut obviou similar learn strong show good learn system necessarili perform adapt constrain adapt match remaind paper evalu adapt match cluster system base learn classifi pair entiti algorithm adapt match cluster observ suggest adapt match cluster implement learn function predict match cluster make approach issu address issu cost evalu learn pair function quadrat impract larg techniqu find subset pair match method nigam assum distanc metric threshold tight tight summar empti set set object comput pick random add pair remov point tight output procedur set train pair assum pair set cosin distanc token version entiti find set point step quickli rank retriev search fact practic learner give predict give numer interpret probabl match denot confid issu address pair accept learn pair function obei constraint constrain adapt constraint cluster size enforc constraint constrain adapt build graph vertic entiti edg weight confid classif comput minim weight graph experi greedi approach exact minim exploit fact graph bipartit experi paper simpl greedi approach enforc cluster size build analog graph vertex set perform greedi agglom cluster implement singleton cluster creat hold element repeatedli merg cluster distanc cluster defin minimum distanc cluster cluster remain algorithm train set cluster run algorithm dataset gener set pair set label posit iff cluster match add label pair train set train classifi train set obtain classifi denot confid classifi pair cluster dataset result run algorithm obtain set pair set comput creat graph vertex set edg weight perform greedi agglom cluster graph find minim weight return result result explor instanti adapt match cluster algorithm classif learn featur set repres pair report result maximum entropi learner featur encod pair shown figur dataset multipl field bibliograph refer address featur extract field consid baselin perform replac graph fix string edit distanc comput edit distanc uniform cost charact insert delet similar algorithm nigam baselin replac formula true iff string substr true iff string prefix featur true iff edit distanc string true iff token match token featur comput analog requir token match token comput valu analog true iff jaccard distanc set token jaccard distanc set comput threshold true number figur featur learn pair function dataset evalu summar cluster collect paper citat cora project collect organ nick provid cluster differ branch organ virginia virginia polytechn consid constrain match dataset restaur dataset restaur restaur guid match guid sheila provid park dataset nation park list common cluster domain split size set potenti recal pair pair cora match domain split size set tight potenti recal posit pair pair restaur park tabl domain dataset constrain system produc true number cluster pair compar previou cluster obtain explor varieti cluster size valu report gave obtain constrain system creat time true number cluster evalu algorithm variat split data train test final train test report result partit partit split data algorithm consid pair set produc algorithm pair instanc test set instanc train set impli train set instanc test set instanc disadvantag procedur imposs creat result adapt method result experi shown tabl record dataset number entiti number desir cluster threshold maximum recal obtain produc number posit neg pair learner tfidf edit distanc adapt preci recal preci recal preci recal cora restaur park tabl result result distanc baselin result edit distanc edit report result set obtain measur bold ten adapt method obtain result compar baselin approach conjectur poor perform adapt system due variat partit train test relat work formal adapt cluster match inspir model singer adapt system set object intend show problem solv learn binari order greedi method construct total order set binari order give provabl bound loss system find bound adapt cluster learn remain problem futur work architectur adapt match cluster method model system mccallum match replac metric learn pair function focu adapt cluster match method distinguish work previou work similar metric entiti gener framework manual implement similar metric idea learn distanc function entiti pair substanti literatur problem statist base theori maximum entropi learn approach advantag requir featur broader rang potenti similar featur recent implement match procedur base maximum entropi learner extend work systemat elimin potenti quadrat cost applic pair function cluster constrain match conclud remark present scalabl adapt scheme cluster match result method compar cluster match plausibl fix distanc metric number enhanc current method futur work hope examin notabl current omiss lack featur directli measur tfidf similar featur perform improv ad featur base word type process ad featur common word hope explor approach adapt hope investig robust method respect size train data number explor learn approach refer rubin probabilist model document retriev relev journal royal statist page cluster analysi applic academ press buhmann hofmann central data cluster competit neural network advanc neural inform process system page morgan san ca grishman descript entiti system proc seventh messag understand confer april ww data integr similar join inform acm transact inform juli pp learn order journal ai volum page rubin probabilist model document retriev relev journal royal statist page theori record linkag journal american statist goldstein carbonel rerank document rerank summar workshop languag technolog multimedia inform page netherland galharda florescu shasha simon extens data clean tool acm june random algorithm advanc neural inform process system vol mit data data journal data mine knowledg pp editor record linkag statist incom intern revenu servic public autonom citat intern confer autonom acm press mong elkan algorithm applic intern confer knowledg discoveri data august autom construct internet portal machin learn inform retriev effici cluster data set applic refer match knowledg discoveri data page automat text retriev inform ha cl match algorithm bipartit technic report de da universidad de automat text structur summar inform process elsevi ra mj fischer correct acm page yang chute map method text classif acm transact inform
Agents/567 1 approach belief bdi agent simon parson paolo giorgini depart electron queen mari westfield london uk past year rise popular mentalist attitud desir intent describ intellig agent model attitud admit desir intent understand simplif mean result system account inform guid human reason world paper start develop sophist system base exist formal model mental attribut introduct past year lot attent build formal model autonom softwar piec softwar oper extent independ human consid goal abil determin achiev goal formal model base mentalist attitud desir intent belief agent model desir agent model state world agent find intent agent model state world agent activ bring popular approach bdi model rao georgeff rao georgeff model explicitli acknowledg agent model world model belief set world agent model make attempt make inform world actual world agent oper work aim address feel weak bdi agent intent quantifi paper consid quantifi agent belief immedi make agent express opinion reliabl agent interact belief current dipartimento di informatica studi universita degli studi di itali figur strong realist bdi agent inconsist paper combin author work argument bdi agent author work belief question quantifi desir intent subject continu work agent mention work extens includ belief describ agent framework system interest explicitli model system give neat modular defin agent directli execut section briefli notion system argument agent architectur consist compon formal structur entiti repres main compon architectur call context declar set axiom number rule infer unit singl logic set formula written logic unit bridg rule infer relat formula unit compon model bdi agent separ unit belief desir intent logic theori unit encod desir intent specif bridg rule encod relationship desir intent unit handl commun agent figur diagrammat arrang unit logic unit commun unit classic order logic usual axiom rule infer belief unit order special predic denot belief agent modal logic interpret belief modal satisfi axiom make belief predic captur behaviour add axiom belief unit desir intent unit base order special predic usual treatment desir intent modal make satisfi axiom captur ad relev axiom desir intent unit modu ponen rule infer complet specif logic unit bridg rule shown arc connect unit bridg rule enforc relat compon agent architectur bridg rule intent unit desir unit mean agent intent desir full set bridg rule diagram bdi agent discuss note remaind paper drop simplifi notat mean rule obviou requir addit explan intend captur idea term context scope instanc action bridg quot commun unit obtain inform action complet term agent add set belief intend express fact agent intent term pass commun unit note formal ignor tempor aspect refer futur agent true prevent desir true bridg shell strong realist bdi agent defin framework complet specif complet agent fill theori unit domain specif add domain specif bridg rule unit argument system argument base fox colleagu system work construct seri logic step proposit interest extens classic logic classic argument sequenc infer lead true system argument adopt argument prove proposit true suggest proposit true strength suggest ascertain examin proposit relev argument form argument work inform logic argument philosophi stress develop independ fit argument agent build argument rule infer unit bridg rule unit make argument set formula build suitabl consequ proposit argument set formula infer belief call result deduct kind reason similar provid label deduct system differ label whilst label deduct system label control system argument label determin valid discuss relationship label deduct system model formal defin argument definit agent argument formula languag tripl set ground belief suggest argument ground argument relat formula deduc set formula deduc definit set ground agent order set hs dn formula theori mg mean formula deduc agent set formula set infer rule bridg rule fr ambigu agent formula theori agent call step argument sake refer deduct step identifi step argument agent equip proposit logic theori fa bg argument bg ai credibl theori argument hs bg cg formul argument bulki involv baggag system record step proof rule infer rule system discuss dung loui pollock reason differ author concern argument singl agent reconstruct argument proposit simpl list proposit number agent argument reconstruct explicitli record detail argument built ad belief previou work consid agent desir intent unit formula build argument outlin previou section permit desir intent admit belief vari desir intent adopt vari resolut argument incorpor belief straightforward build subject rest paper handl desir intent subject continu work associ util desir expect util intent expect util base util state intent aim bring probabl adopt intent achiev work aim build earlier work rao georgeff relat desir intent theori machineri provid simplest build belief translat proposit belief unit agent initi suppli nest modal form argument empti set ground fg belief proposit agent gather extern sensor enter argument ground reflect proposit deduc base set accumul ground detail belief deduct depend belief ground formal handl uncertainti mean express paper belief mass assign theori agent belief unit model made set statement fg fg agent draw deduct sanction rule infer logic belief unit belief unit rule modu agent agent mp combin theori fact belief base origin extern belief attach fact reflect agent view reliabl sourc number advantag ad belief bdi framework mention abil model world greater level detail possibl granular make process situat pick intent random pick intent base expect util investig belief inform agent updat model world learn thing belief updat belief updat approach agent cope chang world alter belief possibl inform differ action captur idea prioriti incom inform updat place assum incom inform prioriti appli situat agent oper dynam world latest inform correct belief agent oper world incomplet erron case agent account inform belief consist redefin credibl proposit light incom inform model adopt principl believ inform item belong current cognit state consist unlik case incom inform principl make chronolog sequenc incom inform credibl clarifi differ updat temporarili ignor belief unit agent proposit proposit observ contradict consist set belief prefer maxim consist set updat doesnt inform model belief adopt drawn start definit definit set fact agent initi program told agent set assumpt definit set deduct agent make set assumpt consequ definit knowledg base set assumpt introduc knowledg space set belief knowledg space made knowledg base deduct made knowledg base knowledg base knowledg space grow monoton element memori contradict definit defin minim inconsist subset knowledg base good maxim consist subset knowledg base subset kb support contradict superset good subset kb superset subset good good support subset ks made proposit good consequ definit origin de kleer work truth mainten system method belief consist gener set ng set good kb defin credibl order assumpt kb extend credibl order good select prefer good cg support set ss step deal consist adopt algorithm find ng deal uncertainti inform adopt theori evid handl dempster rule combin find credibl belief deal reliabl sourc data bayesian condit reliabl sourc conflict adjust deal level extend order defin order good number method includ lexicograph altern order good averag credibl element mean prefer good longer necessarili credibl piec inform final consist select good cg cg good highest select ks deriv sentenc consequ proposit belong cg requir updat belief differ dynam propag calcul set belief step modifi incom inform replac result constrain pick prefer good inform gener set ng set good kb defin credibl order assumpt kb extend credibl order good select prefer good cg support set ss proposit set proposit introduc reliabl sourc credibl proposit kb credibl good prefer good cg support set reliabl sourc procedur belief consequ assumpt suitabl alter section extend belief agent illustr belief bdi investig murder fact belief fg fg fg paolo background inform murder inform inform wit carl suggest shot judg carl reliabl conclud murder paolo form formula subject term ground argument modu infer fact denot formula sign inform ana time shoot wit reliabl belief context fg fg fg inform ana suspect remain main denot denot inform wit dana shoot paolo inform compat proposit number belief process calcul credibl belief reliabl carl dana process belief context fg fg fg investig find evid emerg reliabl judg shoot paolo belief context belief mechan start reliabl fix priori fg fg fg fact build result fairli carl reliabl evidenc high belief fact murder paolo believ dana confid ana suspect summari paper suggest refin treatment belief bdi built system suggest work bring advantag firstli treatment base gener idea approach simpl analog approach made possibl measur measur base theori plausibl mean carri belief handl inconsist harder convent bdi model introduc belief proposit foundat theoret method bdi topic attent acknowledg work preliminari extend approach deal desir test approach real applic direct topic ongo work refer prade inconsist manag priorit entail intern joint confer artifici page chella modal introduct cambridg de kleer tm artifici giorgini belief belief function formal environ intern workshop agent architectur giorgini learn agent reliabl bayesian simul studi learn dai page dung accept argument fundament role nonmonoton logic program game artifici ambler contradict practic reason european confer artifici page fox parson argument belief action hunter applic uncertainti formal springer gabbai label deduct system oxford giunchiglia serafini hierarch logic modal artifici fox logic argument reason uncertainti comput loui defeat system infer comput noriega sierra layer dialog agent intern workshop agent architectur page jen agent reason negoti argu journal logic pollock reason artifici rao georgeff role format intent confer uncertainti artifici page rao georgeff bdi theori practic intern confer page rao georgeff model ration agent intern confer principl knowledg page rao georgeff formal model procedur system technic note australian artifici intellig reiter theori diagnosi principl artifici shafer mathemat theori evid princeton van fundament argument handbook histor background contemporari develop lawrenc erlbaum
Agents/568 1 model check agent uml protocol diagram agent art group liverpool liverpool unit kingdom abstract agent multiag system protocol order exchang messag coordin agent object design directli commun protocol distribut system type call interact protocol encompass agent featur richer messag abil cooper coordin design formal descript techniqu commun protocol graphic model languag base uml year ago agent uml valid agent uml aim paper present model check agent uml protocol diagram paper publish technic report depart comput liverpool version introduct agent multiag system interact exchang inform cooper coordin usual approach describ interact protocol interact protocol deriv commun protocol distribut system directli commun protocol exist agent process agent autonom object agent join order cooper commun agent richer distribut system process send data messag agent verb content verb appli content mean receiv inform sender believ reader consult detail present agent object interact protocol design consid formal descript techniqu commun state machin petri net languag loto sdl type formal descript techniqu logic languag approach year model languag base uml descript evalu model model languag draw attent chosen associ fipa order describ interact protocol languag call agent uml bauer al explain uml multiag system design softwar engin uml descript system agent object encompass repres agent featur uml interact protocol agent uml protocol diagram stage import design interact formal descript valid test protocol properti properti absent deadlock unreach state valid stage check protocol encompass featur requir analysi approach exist reachabl analysi model check deal syntact properti deal semant properti method formal descript techniqu state petri net loto interact protocol design agent uml protocol diagram opportun exist valid protocol diagram aim paper present valid agent uml protocol diagram model check remind paper divid section describ agent uml protocol diagram protocol diagram repres requir provid textual version protocol diagram model check call section present translat languag applic translat section english auction protocol section conclud paper present futur work agent uml protocol diagram descript notion encompass protocol agent agent constraint messag protocol unfold notion explain section agent agent role agent protocol diagram repres repres ident call instanc agent repres role protocol auction seller particip call auction repres ident role agent class complet role role reduc size diagram ident role share role agent protocol diagram box text instanc role class auction figur initi particip vertic bar messag role deadlin particip fipa contract net protocol inform cancel particip initi deadlin fig contract net protocol agent uml lifelin agent repres lifelin correspond particip protocol lifelin creat role activ protocol lifelin present long role action protocol lifelin vertic bar drawn vertic bar role link vertic bar figur messag lifelin split merg altern protocol path merg case figur answer agent uml connector interact protocol design logic connector describ altern choic figur connector figur mean messag concurr connector figur xor figur choic messag connector mean messag chosen connector xor mean messag chosen term ca refer commun act fig agent uml connector notion notion present protocol put condit send messag english auction protocol figur condit messag variabl greater messag condit insid curli bracket design abil send copi messag open auction protocol multipl send messag mean multicast number close vertic bar role send messag number number close vertic bar role receiv messag correspond number copi type messag asynchron figur messag synchron figur possibl messag receiv instantan delai figur fig type messag agent uml insert comment instanc start cfp time diagram figur repetit figur messag request payment curli bracket number repres time messag valu rang current price reserv payment request nest interleav protocol link protocol solut agent uml protocol nest protocol interleav protocol nest protocol correspond protocol protocol case repeat time protocol nest protocol continu condit hold interleav protocol correspond protocol call execut protocol bauer al give auction particip request inform bank account translat agent uml protocol diagram repres import textual version diagram order appli tool possibl describ textual agent uml protocol diagram call uml exchang due lack present depth reader consult syntax languag section describ element protocol diagram translat algorithm translat appendix element set role diagram role correspond process auction seller consum role long letter index mean main part messag descript protocol diagram messag comment kind messag valid content condit omit multipl process copi messag multipl design test channel comment needless valid type asynchron delai messag asynchron synchron featur kind channel repres delai messag condit present condit check execut build path condit hold path condit hold inform state agent state reach agent receiv messag inform tag state protocol reach state state distinguish state label end messag english auction protocol auction seller consum asynchron structur depend current process send messag receiv messag process send goto messag user user trace execut process receiv goto messag construct connector xor connector replac order set messag connector mean parallel send messag featur connector english auction protocol code correspond translat present featur condit simul condit condit hold condit hold condit evalu possibl evalu true connector mean process messag loop od connector obtain goto goto goto test order avoid messag time process send messag set iter condit correspond case process messag connector xor mean messag chosen messag english auction protocol auction seller consum asynchron auction seller consum asynchron messag connector xor messag translat goto goto accept dash replac underscor structur repres option condit correspond index index link messag english auction protocol english auction protocol order exemplifi languag mean english auction protocol agent sell inform agent part interest auction auction begin auction inform auction particip item auction particip inform auction accept bid auction auction particip accept select agreement inform win round inform auction particip bid reject auction open till remain auction particip accept bid auction close compar current price item reserv price hammer price greater reserv item won agent accept bid auction particip inform auction close protocol agent uml shown figur consum start cfp time start cfp time min fig english auction protocol agent uml messag agent multicast situat repeat messag detail item price deadlin bid comment auction particip answer understood messag messag auction particip send inform auction accept bid deadlin auction inform auction particip won round accept lost round reject winner auction particip accept bid auction agent accept item higher price fipa fipa agent send messag understood understand content messag messag auction close auction inform auction particip current price greater reserv inform auction particip accept bid win item descript protocol due lack give translat chan chan init run run goto goto goto goto goto goto goto goto goto goto goto goto goto goto goto goto goto goto goto goto goto line messag process line process process process process process init run process seller consum process match protocol diagram figur case process state process advanc process send messag cfp messag inform protocol translat spin test state protocol reachabl run version decemb partial order reduct full search assert violat accept cycl invalid depth reach store match transit atom step hash size memori usag unreach unreach unreach unreach unreach mean state unreach process process matter consid protocol diagram translat translat problem valid state reachabl notic protocol send messag realiz protocol diagram wrong protocol valid clear interest formal descript valid main stage protocol engin ensur formal descript rid problem valid usual stage formal descript techniqu state petri net loto design graphic model languag agent uml model languag base uml uml exist agent object autonomi cooper interact protocol repres protocol diagram agent uml valid stage agent uml protocol diagram aim paper describ valid agent uml protocol diagram spin protocol diagram design textual version order tool repres textual protocol diagram algorithm translat descript appendix valid import design error diagram error bauer al diagram english auction protocol protocol messag valid concentr reachabl analysi futur work provid richer rang valid valid semant properti deal protocol refer austin thing word clarendon barbuceanu fox cool languag describ coordin multiag system intern confer system page san june aaai press odel extens uml protocol multiag interact intern confer multiag system page peng model agent color petri net autonom special workshop dinverno luck contract net system de veld agent break maamaw number lectur note page fisher wooldridg execut protocol cooper action intern work confer cooper system design valid comput protocol analysi hash protocol test valid page june model checker spin ieee transact softwar languag exchang agent uml protocol diagram technic report depart comput design system atal workshop agent volum lnai page juli jen wooldridg softwar engin handbook agent technolog mit algorithm translat interact protocol formal descript ieee intern confer cybernet confer octob wang extend model languag interact protocol design softwar engin bauer extend uml agent inform system workshop nation confer icu publish translat algorithm messag type mess list messag type channel role role end end end init process role end process role ca version diagram role protocol diagram complet state retriev label state label messag retriev commun act ca ca retriev sender role sr retriev receiv role rr retriev role current end end retriev state ns equal end end messag retriev commun act ca ca ca retriev sender role sr retriev receiv role rr retriev role current end retriev state ns equal end end end messag retriev commun act ca index ca retriev sender role sr retriev receiv role rr retriev role current end index retriev state ns equal end end end end end
AI/569 2 fast algorithm draw larg graph regular paper michael stephen center geometr comput john hopkin md abstract present hierarch method draw larg graph algorithm produc graph euclidean space dimens draw graph obtain project subspac project draw dimens result draw symmetr notabl featur approach util maxim independ set set vertic fast energi function minim ecient memori intellig initi placement vertic implement algorithm draw graph ten thousand vertic neglig amount memori minut pc introduct graph common data structur softwar engin small graph drawn manual result pictur show underli relationship task draw graph hand challeng complex graph graph draw tool focu graph draw commun review eld numer algorithm develop draw special class graph tree planar graph fewer gener graph draw method method choic draw gener graph substanti interest method stem conceptu applic gener aesthet draw exist autom system troubl deal graph thousand vertic paper present algorithm draw simpl undirect graph ten thousand vertic minut larger graph displai algorithm conjunct view displai algorithm accomod graph vertic number pixel displai devic ectiv algorithm depend good turn depend good initi graph creat good larg graph prohibit exist algorithm research partial support nsf grant aro grant depart comput tucson az algorithm creat excel initi reason time kei featur algorithm intellig initi placement vertic draw simpl scheme fast energi function minim space time ecienc rest paper organ section review previou work visual larg algorithm autom graph draw section describ algorithm introduc maxim independ set intellig placement draw section discuss modi cation algorithm includ draw obtain grip layout system base algorithm previou work draw dimens major work graph draw graph algorithm tool design graph draw addit freedom natur grow evid show human brain comprehend increasingli complex structur displai object space initi research inform visual applic begun exist work graph draw algorithm algorithm special kind algorithm draw gener graph approach studi recent draw algorithm includ cruz context orthogon algorithm develop orthogon studi orthogon graph draw present wood visual larg graph visual larg graph present uniqu problem requir solut draw displai entir graph advantag show global structur graph larg graph draw impract limit resolut displai devic make detail hard discern partial draw graph displai larger graph fail convei global structur approach visual larg graph view displai view show area interest larg detail show area success smaller detail view view larg graph multipl abstract level natur realiz multipl level draw level drawn plane di erent cluster structur drawn tree displai algorithm introduc feng feng context visual cluster graph compound cluster graph studi misu north feng lin creat graph cluster base binari space partit displai larg graph introduc qualiti result draw depend initi graph plane algorithm present creat excel initi reason preprocess step layout method algorithm placement algorithm spring embedd rst practic algorithm graph draw algorithm graph model physic system ring spring classic method start random graph util standard optim method minimum energi function choic characterist featur layout algorithm cost function assign graph euclidean space number method base minima chosen energi function produc aesthet graph draw main di erenc algorithm choic energi function method minim energi minim algorithm method improv draw simul anneal method davidson harel exibl algorithm slightli di erent heurist result faster algorithm algorithm ludwig add notion local temperatur speed draw process method draw graph node label shown north main problem standard algorithm inabl draw larg graph classic algorithm draw graph maximum hundr vertic present graph standard approach associ graph hierarchi graph comput start smallest graph larger larger graph stage result previou comput strategi brought area graph draw particl physic algorithm harel harel introduc simpli cation algorithm result faster draw larger graph beauti draw graph vertic mark chapter area graph draw underli step algorithm shortest path time space binari heap implement shortest path problem solv log fibonacci log quadrat space complex incur matrix distanc vertic graph quickli obstacl draw larg graph procedur includ cluster procedur construct hierarchi graph optim method scale displac vector algorithm creat draw base extend slow algorithm algorithm section address problem introduc featur main algorithm creat set schedul function vertex neighborhood initi posit repeat round time comput local temperatur fn add edg figur creat vertex set schedul function algorithm process start smallest point vertex round small constant nement stage scale factor displac vector turn comput restrict vertic algorithm algorithm overview algorithm fig rst stage creat set vertic graph set schedul function detail descript schedul function section main run level start stage vertex set initi posit vertex neighborhood set closest element method determin determin initi posit section nement stage repeat round round small constant nement displac vector set local forc vector local mean forc vector fn comput vertex neighborhood vertic displac vector scale local temperatur factor detail process calcul found section fig illustr draw stage algorithm cycl graph left column show success stage ad vertic initi posit calcul base posit nearest neighbor previou layer column show posit newli ad vertic chang appli method note vertic left column origin eventu ned posit vertex set filtrat face problem draw larg natur associ hierarchi graph produc draw start smallest graph draw larger larger graph stage previou draw import properti hierarchi depth distribut vertic constant depth hierarchi impli initi placement refin figur hierarchi graph cycl initi vertic light vertic ned shade level constant fraction vertic ad make draw level insuci placement vertic linear depth hierarchi time consum logarithm depth highli desir ectiv scheme depend uniform distribut vertic level hierarchi hierarchi graph thought di erent level abstract underli graph uniform distribut vertic impli accur level abstract turn impli draw level harel creat hierarchi graph base cluster number harel simpler method creat hierarchi reli problem algorithm begin produc graph center set vertic graph jv jv constant cluster vertic closest center creat center level set weight edg comput element weight correspond number edg element cluster gc edg form hierarchi graph gc creat straightforward algorithm pick random element add find vertex farthest vertic add continu process element found set ad element farthest jv complet graph center proper graph level applic util graph context graph draw save time space vertex set note edg vertic point logarithm depth graph draw develop test speci call maxim independ set algorithm figur mi underli graph rectangular mesh size dark vertic includ standard maxim independ maxim subset distanc element recal independ set graph element connect edg independ set graph distanc element graph distanc vertic de ned length shortest path graph maxim independ set famili set maxim subset graph distanc pair element fig advantag mi gc number vertic set case mi control geometri graph center size arbitrarili set user build mi time graph center requir knowledg distanc pair vertic shortest path time space bottleneck deal larg graph mi construct construct order independ set construct auxiliari set vertic draw element random element place remov element graph distanc equal distanc factor import ensur vertic distribut small depth element remov chosen vertex vertic distanc equal place repeat procedur empti note set produc procedur ordinari maxim independ set maxim independ set shown fig construct mi stop level diamet mi depth mi provid excel distribut vertic properti high qualiti find vertex neighborhood kei idea hierarch graph layout method stage construct posit nement method appli layer local energi function gradient comput restrict neighborhood util good local posit nement strategi kei mean escap quadrat lower bound space time complex classic method section describ procedur construct set de nition schedul function stage hierarch graph draw strategi approxim nal draw graph perform local nement posit vertex set adjac vertic time complex stage calcul averag make upper bound complex calcul stage graph draw construct set jv logarithm depth set vertic calcul set perform element ad set fig requir element space complex strategi bound jv jv jv jv simpli cation form jv jv jv similarli show exist posit constant equat greater storag complex strategi nding bound log gc log mi depth respect largest set creat repeat applic rst search algorithm vertex depth full process stop full note run time procedur bound jv case express equal jv similarli show exist posit constant equat greater time complex strategi nding bound log gc log mi figur initi placement vertex shade vertic vertic place base graph distanc vertic similar fashion result placement initi placement vertic graph draw algorithm begin place vertic graph randomli plane algorithm adopt di erent approach add vertic current draw time found suitabl place describ process practic euclidean space recal rst step algorithm comput modifi set start process draw place triangl endpoint dist dist dist dist euclidean distanc graph distanc ning posit vertic initi posit vertic vertic posit proce level process continu vertic drawn natur place vertex placement graph distanc vertex closest neighbor base placement strategi simpl idea place vertex vertic posit graph distanc straightforward posit plane dist dist shown fig idea gener vertic determin locat vertic vertex closest neighbor fig obtain suitabl place solv system equat system equat solv pair equat dist dist dist dist dist dist solv system quadrat equat obtain di erent solut closest call place fig local temperatur calcul common problem algorithm determin scale factor displac vector phase earli iter vertic move farther schedul scale displac vector work graph gener dicult reason diculti initi vertic random result arbitrarili nal posit result intellig placement vertic problem local temperatur simpli scale factor displac vector implement consid detail speci cs time complex updat local temperatur constant total time complex local temperatur calcul linear draw major advantag simpl local temperatur calcul unlik major classic optim work minor dimens order obtain graph simpli make vector problem draw dimens higher trivial displai obviou solut problem project case draw project dimens project method gener higher dimens begin random vector normal ke vector linearli independ vector repeatedli random vector check independ previou vector orthogon process produc orthonorm basi vector span subspac perpendicular vector orthogon project direct vector formula scalar product displai screen coordin project respect basi vector simpl scalar product calcul procedur easili gener higher dimens project subspac linearli figur strip vertic drawn directli note rough figur strip fig drawn project note smooth twist independ vector project complet basi orthogon process creat orthonorm basi em vector em em em form basi subspac coordin orthogon project formula experi draw yield result notic di erent regular draw note problem draw bend directli fig qualiti draw graph drawn project fig space time complex main theorem graph bound gc mi set vertic time complex construct space requir log gc log mi proof theorem fact build part algorithm linear time procedur nding element time space complex algorithm determin time space complex procedur nding section show time requir nding set space requir conclud proof futur work present algorithm draw larg graph algorithm emploi vertex intellig placement vertic fast energi minim algorithm figur draw pyramid creat grip base algorithm paper graph vertic draw pentium processor produc draw higher dimens time space algorithm work graph graph low produc high qualiti draw graph graph pose signi challeng vertex shallow algorithm paper design grip system draw intellig produc draw fig fig includ interest class graph call graph draw pyramid produc grip pentium fig refer approach proc int symp graph draw volum lectur note comput page brandt multilevel comput integr transform particl interact oscillatori kernel comput physic brandt method lattic eld comput phy proc fast interact graph visual graph draw gd volum lectur note comput page graph draw rivest introduct algorithm mit cruz graph draw simul anneal graph draw gd volum lectur note comput page davidson harel draw graphic nice simul anneal acm tran di algorithm draw annot bibliographi comput theori di graph algorithm visual graph prentic englewood cli balanc aspect ratio tree draw larg graph symposium graph page journal graph algorithm applic heurist graph draw feng multilevel visual cluster graph symposium graph draw page lin draw algorithm hierarch graph cluster graph symposium graph draw page algorithm orthogon graph draw proc graph draw lnc page feng algorithm draw cluster graph phd depart comput scienc softwar apr draw planar cluster graph proc annual intern confer comput page fast adapt layout algorithm undirect graph graph draw gd lnc page graph draw placement furna gener view acm confer human factor comput system page graph draw intellig placement submit gd north improv layout lectur note comput advanc graph draw lectur note comput system visual hierarch structur lectur note comput harel algorithm draw graph nice proc intern workshop graph concept comput scienc harel fast method draw larg graph technic report weizmann institut automat displai network structur human understand technic report depart inform simpl algorithm draw larg graph small screen graph draw page visual larg graph phd john hopkin misu overview diagram base idea research report fujitsu laboratori parallel simul anneal algorithm gener layout undirect graph graph draw lnc page north draw rank cluster graph draw intern workshop graph sept graph draw algorithm master dept comput univ increment orthogon graph draw dimens di proc int symp graph draw lnc page forc direct compon placement procedur print circuit board ieee transact circuit sarkar brown graphic view commun misu visual structur automat draw compound ieee transact visual object orient softwar dimens engin psycholog human perform harper wood orthogon graph draw small box proc int symp graph draw lnc page
Agents/570 1 embodi agent introduct catherin pelachaud rome depart comput system scienc comput part world feel urgent proper user interfac interact command line type keyboard special comput receiv attent larg audienc metaphor commun appli interact find lot attract human born commun interpret understand speech part develop growth complex involv huge number factor speak face bodi gestur contradict word product speech nonverb behavior work parallel form bodi process add inform difficult express word function adverb adject modul imagin product behavior occurr import verbal nonverb behavior build embodi agent human sensit error perceiv emit wrong wrong time disappear wrong durat displai signal immedi detect true synthet agent fine simul muscl action skin good lip movement creat realist model human demand qualiti anim build anim face lot agent show emot step step main system compon comput lip shape creat lip shape difficult problem model implement singl method explain effect languag includ introduc notion domin function articul difficulti link method comput paramet automat larg corpu data paramet domin function good result synthet model show movement achiev import applic interact languag train charact perfect lip movement anatom correct movement prime anticip movement valuabl produc express anim commun facial express face import commun commun function control flow regul exchang speak floor action nose verbal messag facial express accompani flow speech synchron verbal punctuat accent phonem segment facial express substitut word string express attitud speech interlocutor show primari channel express emot model chosen present facial express action involv express commun function express chang mean depend place time occurr nonverb gaze behavior receiv lot attent system devot comput gaze import factor model agent smooth speak turn point sentenc call user attent object point space commun goal belief gaze function requir interrupt semant analysi inform visual activ spatial system favour interact user model commun function syntact back channel order comput facial express link semant data perform fine analysi user agent answer difficult special case requir elliott parti fine deep reason emot respect comput system present subtl facial express emot face line synchron scheme speech synchron lip includ facial hand gestur delai synchron process easili perceiv user disturb al cite synchron occur comput time output phase system offer automat interact audio visual channel audio channel synchron clock ear sensit delai audio modul send signal imag modul lip shape sound audio imag present crucial miss import pronunci system displai closur lip case system select displai frame sound nonverb languag nonverb behavior occur nonverb behavior occur randomli specif time speech time mark finit state automata schedul action link speech action trigger condit met action durat dynam durat comput blink import comput express serv function commun depend context signal emphasi mark question occurr wrong time interpret signal comput time prime issu ensur nonverb behavior occur wrong time speech displai happen displai distribut signal channel agent system nonverb signal ad creat final anim signal link function redund modal vocal stress eyebrow accent substitut signal place eyebrow mark formul contradict signal modal opposit head shake addit signal add squar hand shape talk gestur refer size vocal head nod redund manifest emphasi occur time cassel stone multimod manag control choic channel displai inform context person talk context dialog place ekman explain length displai rule rule govern displai multimod signal explain varianc notic behavior person talk situat word linguist structur accompani facial express gaze behavior element interact cultur linguist relationship inform integr agent system modul modifi final comput accompani nonverb behavior talk review comput model embodi agent present pro con model establish pro con embodi agent multimod user interfac easi task due reason state art facial model anim achiev great realism natur sophist techniqu film reason type applic face unknown face make user interfac criteria establish face decid face exhibit skill face face human face desir cute cartoon type anim dog evalu system cohen lot effort evalu model evalu methodolog studi suggest product perform user enhanc talk agent cassel report user prefer interact agent show nonverb behavior agent refer benoit multimedia platform speech process anim talk agent benoit septemb design portabl charact workshop embodi octob ni stone anim gener facial gestur spoken inton multipl agent comput graphic annual confer page acm cassel stone live hand mouth psycholog theori speech gestur interact dialogu system fall symposium psycholog model commun collabor cassel power nod envelop emot feedback anim agent appli artifici prevost turn model multimod machin cook design issu situat charact workshop embodi octob cohen model synthet visual speech model techniqu comput de intellig anim agent interact languag train unpublish de poggi verbal nonverb plan workshop behavior interact anim agent fourth intern confer autonom doyl commun agent good idea workshop natur languag embodi intern confer autonom ekman friesen repertoir nonverb code elliott affect process model emot multiag system phd northwestern institut learn technic report digit toni de comput graphic octob wood make face comput graphic annual confer seri acm de de la pour temp phd institut nation accur repres human face vol state art facial page acm mae agent effect agent august principl tradit anim appli comput anim comput juli benoit french fourth intern confer spoken languag speech audibl gestur speech product speech page perceiv talk face speech percept behavior principl bradford book seri cognit psycholog mit badler virtual human present workshop anim interfac agent make august kaufmann publish ni steedman gener facial express speech cognit poggi pelachaud facial perform system prevost sullivan embodi charact de rosi ey commun synthet agent special issu behavior plan charact avatar ai reev simpl complex facial case studi vol state art facial page acm rickel wl johnson anim agent procedur train virtual motor control appli artifici takeuchi nagao commun facial displai modal takeuchi situat facial social interact acm confer human factor comput volum page kr layer modular action control commun humanoid comput ieee comput societi press jh human face interfac human factor comput page april water tm automat algorithm synthet face technic report technic report crl cambridg research digit equip sb terzopoulo visual human activ public interfac technic report technic report crl cambridg research digit equip
DB/571 3 applic machin learn filter jason renni school comput scienc carnegi mellon pa decemb abstract electron mail modern import method categor search mail mail filter method organ incom critiqu modern mail filter describ machin learn techniqu improv elimin benefit provid present mail filter make text classif algorithm naiv present experi show classif perform set privat point issu involv creat machin learn base mail filter conclud elimin problem modern mail filter maintain high classif accuraci introduct modern mail client user organ mail call folder mailbox user group mail messag similar peopl make flexibl mail client make full organiz benefit time consum tediou agent program program call creat automat place incom mail folder rule user mail filter reliev organiz long stretch solv problem tradit mail filter major problem freeli ffl user determin rule mail filter time consum requir navig complex interfac ffl folder hierarchi requir set filter rule ffl filter difficult machin learn method potenti reduc elimin problem remov highli accur filter provid creat mail base simpl text classif algorithm naiv written mail client make user action common mail client elimin mainten involv modern mail filter natur naiv algorithm filter base content document approach modern mail filter user make mail filter classifi incom reduct amount time requir organ corpu filter repres current select filter filter user set rule incom classifi express power rule case user match regular express part messag make express power requir time commit user spend time creat rule updat prefer chang imagin rule filter base messag user spend time encod rule filter suit user spend time maintain set rule classifi address keyword found header filter content time understand encod filter type mail filter machin learn accur mail filter elimin problem modern mail filter applic machin learn method text classif algorithm shown perform algorithm elimin reduc problem mail filter filter base english mean bodi document number studi show machin learn techniqu perform relat classif task ken lang score high classif accuraci task classifi arrai netnew document newsgroup belong david lewi knowl classifi successfulli match messag william cohen test classifi corpu thorsten joachim support vector machin classifi reuter document studi concern classif document gener show machin learn algorithm achiev accuraci classif task wide rang class machin learn algorithm capabl handl task filter person elimin problem modern mail filter algorithm elimin user provid set rule mail filter algorithm detect user made classif prefer observ perform machin learn make task mail filter feasibl machin learn potenti elimin problem current mail strong evid literatur algorithm accur classifi person learn develop machin learn base mail number issu tackl evalu experi machin learn algorithm account method featur select classifi messag choic train exampl carefulli made maxim amount inform algorithm base major text classif algorithm make featur select context text featur select limit number word classif perform algorithm data set make classif task daunt compar perform featur select method determin document frequenc reason method order make featur select method creat notion ag word remov word log ag greater document frequenc word ag defin number document filter system encount word occur frequent classif featur commonli retain featur classif context mail client instanc mail filter access inform messag filter action messag commonli term includ move transfer mail filter classifi user folder piec mail user capabl mail mailbox opportun acquir knowledg user filter decid train filter system piec mail gener class label add word statist mail word statist folder label piec mail word statist mail move folder method label train maxim set exampl good model user filter prefer case method harm larg number messag filter label messag messag label incorrectli label correctli aggress method method make assumpt user incorrectli label batch filter perform goal project surround creat machin learn base mail filter highli accur effici usabl regular user pursuit creat system naiv algorithm work filter mail client goal make effici usabl regular user achiev user subscrib mail list meant discuss system user tool solv problem inher learn base mail filter left give evid successfulli filter mail design order evalu capabl system examin issu involv perform number experi base import issu involv classif present classifi matter involv classif evalu classifi naiv naiv effect classifi text document goal find effect machin learn algorithm show algorithm effect job naiv simplic present text classifi mail filter system complet descript chapter naiv statist machin learn algorithm make assumpt document simpli set word chosen randomli underli distribut determin document class word consid independ actual locat document set class gener fc set fw calcul probabl gener class jc likelihood randomli chosen document belong class jc likelihood randomli gener word class likelihood randomli gener document specif find class part comput equat class class largest probabl valu comparison drop term loss nb argmax jc give reason probabl estim case word probabl jc jv number instanc document class total number word document class jv number word track classif electron mail untouch document directli fit naiv model document set stream charact larg portion document fit notion english text easili text translat set word obviou section messag model english text text translat set word obviou part messag relat sender content messag section part translat set word question document part header bodi header list field pertain messag field pertin mean human understand messag intend content messag order document naiv model interpret close perceiv ignor header field includ experi effect remov header denot remov header order appli naiv classifi set lex charact stream document set word consid sequenc alphabet charact undesir separ part person address result token uniqu consid sequenc charact underli structur charact sequenc web reveal effect lex method filter give alpha consid word sequenc alphabet charact white denot token sequenc charact alpha token sequenc alphabet charact techniqu commonli token text stem stoplist goal stoplist amount data elimin word uninform util toss token word found list common adverb verb word commonli found english languag write relat subject area goal stem link word root end case word root form document word serv porter stem algorithm token word singl word porter stem algorithm convert english word spell common word root list word convert serv accumul classif issu difficulti evalu perform mail filter obtain dataset repres sort data mail filter classifi major regular privat individu give corpu inspect public option evalu set newsgroup mail list document collect repres document distribut found person corpu order evalu repres number user execut program perform varieti experi collect store total user author conduct set experi set experi perform set newsgroup newsgroup messag newsgroup call newsgroup dataset conveni set includ experi order provid basi comparison trait data set experi perform vari extens order give provid number mailbox messag user mail corpu provid metric entropi entropi calcul number document mailbox calcul entropi log indic evenli document distribut user mailbox document evenli distribut entropi equal number mailbox experi experi plan user corpu experi term default experi base configur experi experi attribut base configur modifi descript experi simpli indic attribut chang short descript chang list experi descript alpha stoplist header featur stem alpha replac alpha white replac alpha stoplist stem featur select word consid classif header classif white replac alpha header classif experi perform static set user ad document classifi reinsert label gener document user corpu procedur repeat experi accuraci score gener divid number document label correctli total number document label method chosen due effici concern perform multipl run split document train test significantli comput time limit number user successfulli run experi result document classif accuraci experi result displai figur figur list experi result user inform relat natur user collect figur result experi form graph easier comparison accuraci user experi figur experi result repres bar list left user gener data experi bar plot case note run full rang accuraci score figur displai aggreg accuraci score set mailbox minimum number messag left data point line label accuraci achiev messag mailbox document note log scale note user folder messag time data point folder messag plot observ figur perform user achiev accuraci mark lone except user vast collect spread unusu larg number mailbox relat appar correl entropi classif accuraci privat data set correl due inher difficulti classifi document larg set class order achiev perform data classifi develop sort mailbox hierarchi compar individu accuraci score experi score experi differ experi choic experi alpha experi white poor perform configur experi fact alpha lex address token fairli common peopl organ mail sender alpha discard valuabl classif perform poorli compar note poor accuraci score experi user perform experi found classif accuraci consist accuraci achiev experi experi retain header field classif messag experi retain header field header pertain sender content add detract classif note reason newsgroup data set perform header includ due fact class label document list header user accuraci entropi mailbox messag user accuraci entropi mailbox messag user accuraci entropi mailbox messag user accuraci entropi mailbox messag user accuraci entropi mailbox messag newsgroup accuraci entropi mailbox messag figur full list experi accuraci data set inform classif accuraci user user classif accuraci figur experi classif accuraci group user experi left end group experi number classif accuraci minimum messag folder effect train exampl class classif accuraci user user user user user figur aggreg classif accuraci classif score mailbox minimum number messag discuss user feedback set evid provid paper give strong evid back proposit mail filter gain machin learn techniqu capabl achiev high classif accuraci elimin tradit mail filter longer user spend time creat updat rule longer restrict organ mail keyword match appar room improv perform case user larg collect spread vast arrai mailbox perform accuraci score current mark order achiev filter user maintain larg set construct mail client easili facilit organ mailbox complex hierarch structur mail client make difficult maintain deep mailbox hierarchi problem solv appli machin learn handl larg number target class motiv quest achiev greater filter interest area explor combin algorithm text classif algorithm naiv learn fine control tradeoff recal messag filter pass give highli accur label portion document hand naiv classifi detect thread assumpt messag part thread belong mailbox layer ad filter determin messag mailbox messag locat accur label addit document pass naiv classif area futur research tune classifi content document receiv time period easili imagin valid base filter messag directli proport ag document discuss group discuss focu shift topic decai document easili depend mailbox learn decai rate mailbox user classifi abil make train exampl problem tradit mail filter address paper mailbox organiz user decid renam reorgan mailbox rewrit filter rule incorpor case mail filter special action recogn sever organiz chang user deal classifi suit current mailbox initi rebuild corpu filter detect chang rebuild acknowledg sean kamal victor huang dave robinson experi run collect andrew diego harri carl dave robinson chri brown code contribut bug report member carnegi mellon text learn group advic construct critic tom mitchel kind end patienc love learn explor refer william cohen learn rule classifi aaai spring symposium machin learn inform thorsten joachim text categor support vector learn relev featur european confer machin ken lang learn filter netnew intern confer machin page david lewi knowl thread electron preliminari studi inform process tom mitchel machin learn terri payn learn email filter rule mail agent interfac msc depart comput scotland yang jp pedersen featur select statist learn text categor fourteenth intern confer machin
HCI/572 4 commun system abstract time groceri store left groceri list effici remind bui groceri shop list deliv vicin live world inform overload part daili life receiv larg quantiti email voic mail messag messag relev context system remind remind relev specif locat messag inform deliv time relev part overload reduc paper describ commun system mobil wearabl comput platform keyword ubiquit wearabl applic introduct knowledg worker overwhelm inform overload deal filter inform deliv relev context partial allevi problem paper describ commun system mobil wearabl comput platform emphasi put mobil comput term describ abil comput act inform temperatur user ident outdoor user global posit system seamless track afford sensor context relev inform messag trigger user current geograph locat chi mit media laboratori street ma usa relat work indoor locat type activ badg beacon emploi number system base technolog offer messag offic environ pager clue messag filter system mit media lab system infer geograph locat base entri calendar actual locat system gp barcod track user outdoor deliv inform system guid tour citi campu system user depend inform trigger physic locat note electron version note enabl user wander outdoor attach note locat note trigger pass area gp posit inform system architectur system architectur depict client consist messag engin queri engin client applic run mobil commun wirelessli internet remot server run sun sparcstat client develop java mitsubishi vp speech recognit synthesi interfac watson api server process written perl agent messag engin user posit inform obtain gp system latitud longitud coordin receiv agent translat virtual defin gp data store agent analyz recogn frequent locat featur elimin user fill extens form provid data system salient locat inform user prompt assign virtual locat string tag user requir tag locat immedi futur time identifi mark map locat assign list list specif share groceri store typic share list list text audio data edit number full text edit graphic user interfac mobil audio entri client user text entri regular email system remind messag specif assign virtual locat speech text user origin client user interfac email constrain date time rang gp satellit system internet messag posit info gp receiv modem physic locat messag posit queri posit info client behaviour learn agent server virtual locat messag engin queri engin direct indirect feedback figur architectur system messag messag engin deliv content weather traffic report inform sourc web request inform vari depend geograph context user subscrib inform servic base schedul made dai user request receiv list movi show local cinema leav work fridai mobil user enter defin virtual messag auditori cue indic relev item list inform subscrib auditori cue class inform chosen user limit set cue prefer text data receiv text speech interact system graphic user interfac speech command user defin receiv data arriv leav specif locat minut time user view map current locat neighbourhood movi groceri user privaci issu system monitor mobil user privaci issu common reaction brother privaci account gp track monitor client side sole access client mobil user move virtual locat server updat current posit order retriev relev messag histori store server queri engin modul permit queri locat mobil user order prevent feel author assign virtual locat user queri client regular email system queri request server specif client request author receiv locat queri queri user log locat inform request futur work work progress futur work includ wai filter bodi forward time messag relev context remind includ relev inform locat remot workstat agent profil user learn text audio messag deliveri class inform wai agent proactiv relev content research acknowledg advisor chri head speech interfac group mit media lab refer gregori chri atkeson prototyp mobil confer human factor comput matthew chri schmandt dynam person messag cscw pp novemb jason nick ryan note richard martin wearabl comput global commun intern symposium wearabl octob
ML/573 6 rewrit logic metalog framework david basin manuel mesegu institut germani depart spain comput scienc sri usa abstract metalog framework logic methodolog repres logic reason metalog properti logic framework good metalog framework logic support ectiv reason theori initi model present concret realiz idea rewrit logic theori rewrit logic initi model logic support ectiv reason impli induct reason valid prove properti initi model theori rewrit ection reason metalevel properti uniformli ect induct principl prove rewrit logic theori extens show ectiv methodolog ectiv framework di kind formal prove relat theori establish properti class theori report implement induct theorem prover design base result present paper introduct logic framework logic methodolog emploi repres formal system number logic framework compar analyz distinguish intend applic distinguish logic emphasi reason simul deriv framework metalog emphasi reason logic relationship logic metalog framework includ abil reason logic entail adequ simul entail induct plai central distinguish logic framework metalog counterpart logic proof rule construct deriv entail approach logic framework isabel edinburgh lf formal logic theori induct present theori induct david manuel mesegu present theori framework support induct term proof theori metalog essenti induct theori standard argument requir induct formula deriv object theori induct essenti comput scienc reason oper semant ectiv metalog framework approach metalog framework motiv observ logic syntax proof view carrier set induct built syntax proof constructor logic framework metalog framework share common basi logic framework applic constructor suce simul deriv object metalog preserv induct natur algebra formal metalog initi model syntax proof formal object logic logic ectiv theori initi step logic framework metalog framework ect metalevel induct principl formal logic sum framework ection initi metalog make idea give concret realiz rewrit logic present standard deduct theorem minim logic rewrit logic candid ectiv metalog good rewrit logic demonstr good logic framework balanc point express natur formal di erent entail weak theori initi model mean sound induct principl reason respect model prove theori rewrit logic kei ect reason principl metalevel contribut theoret practic work contribut answer question metalog ectiv logic theori initi answer illumin interrelationship logic metalog ection kei ingredi turn logic framework initi model metalog provid evid rewrit logic metalog framework ing combin ectiv metalog framework nontrivi kind reason relat work approach consid past strengthen logic framework function metalog framework di er signi cantli logic basi ection metareason approach formal theori framework logic support notion modul explicitli equip induct principl theori formal collect modul type theori modul includ induct principl reason term proof approach power relat di erent theori formal altern approach formal theori directli induct de nition framework logic framework theori strong formal induct principl simpl theori fs carri experi formal fs induct de nition term framework induct rule reason term common choic formal theori induct de nition strong framework logic logic type theori calculu construct induct de nition logic set theori intern develop theori induct de induct de nition correspond term formal monoton de induct principl formal deriv framework logic calculu induct de induct principl simpli metalog current research area induct principl logic support abstract syntax organ remaind paper organ section present idea ectiv metalog framework abstractli formal requir metalog section present background materi rewrit membership equat languag section discuss induct principl membership equat theori present simpl notion membership equat theori section discuss rewrit logic logic david manuel mesegu section show combin initi ection rewrit logic metalog framework show uniform induct principl theori extens present section formal metareason rewrit logic metalog proof deduct draw section ectiv metalog framework section begin de ning ectiv logic base describ properti sucient ectiv logic framework function ectiv metalog framework ectiv logic ectiv logic logic import aspect theori repres reason logic gener axiomat notion ectiv logic recent notion express term gener axiomat notion entail system captur entail relat logic entail system consist class sign signatur sign speci es syntax function sen assign signatur sign set signatur sign entail relat sati es properti transit omit subscript clear context theori pair consist signatur sign set sentenc extend entail relat theori obviou de ning de nition entail system nonempti set theori theori call rewrit logic metalog framework entail system call ectiv ectiv logic logic entail system ectiv class nite present theori logic requir ectiv metalog framework requir logic framework function metalog framework section approach formal metareason past approach base ectiv reason abstractli requir logic framework weak valid induct principl reason logic framework express viabl logic logic framework ectiv note speci es requir framework logic altern formul abstract framework logic theori initi form induct reason valid prove sentenc respect initi model theori method equat induct initi concept explain requir list sucient turn logic framework metalog framework requir sati logic entail relat repres theori logic requir sati preserv induct natur algebra syntax proof logic repres argument requir induct formula deriv logic appli framework logic prove theorem logic theorem formal notion initi induct reason principl case di erent form equat logic oper ariti smaller regular cardin induct principl tran nite interest logic framework suitabl repres logic practic interest framework logic theori initi model induct principl david manuel mesegu sentenc initi model theori repres object logic prove induct deal requir relat di erent logic famili logic deduct theorem minim logic deduct relat di erent deduct prove obtain rst ad axiom prove mean sentenc formal relat initi model di erent theori ection plai logic framework sati es requir theori metalevel logic theori theori logic framework theori initi model kei exploit order formal relationship initi model object theori theorem initi model induct principl reason initi model object theori induct principl reason initi model theori give concret instanc idea case rewrit logic show class rewrit logic theori induct principl theori simpl induct principl reason induct properti theori reason induct theori induct reason properti sati ed famili theori capabl analog metalog framework base induct de nition background section provid background materi rewrit membership equat languag materi present standard postpon discuss ectiv aspect section rewrit logic rewrit logic simpl logic sentenc sequent form signatur theori rewrit logic tripl signatur set collect condit rule infer rule rewrit logic deriv rewrit theori logic point rewrit logic metalog framework rewrit logic framework logic formula formal element initi model equat theori infer system formal express infer rule rewrit rule rewrit understood modulo equat support exibl abstract kind infer equat care structur bookkeep formal sequent structur rule sequent rewrit modulo equat axiom rewrit theori underli equat theori rewrit logic choic equat logic attract choic term express membership equat logic logic overload function capabl express partial equat condit view equat theori rewrit theori obviou membership equat logic rewrit logic membership equat logic rewrit logic initi model provid basi reason induct membership equat logic membership equat logic express version equat logic full account syntax semant membership equat logic found de ne basic notion paper signatur membership equat logic tripl set signatur fs disjoint famili set call set sort kind pair call signatur function call element kind kind set model interpret subset carrier kind denot algebra ground algebra set variabl atom formula membership equat logic equat membership assert form term kind sentenc horn atom sentenc form xm equat membership variabl figur set membership equat axiom minim logic theorem sort formal sententi david manuel mesegu theorem formula formula formula formula formula formula formula formula formula theorem theorem theorem fig membership equat axiom minim logic theori membership equat logic pair nite set sentenc membership equat logic signatur partial express membership equat logic fact term sort term sort establish axiom correspond und ned error element emploi standard semant concept logic signatur fa collect appropri kind function interpret function symbol assign sort subset sort thought unari predic semant denot subset kind algebra valuat assign variabl kind valu satisfi equat overload notat identifi uniqu homomorph extens write denot satisfact hold note model function symbol alphabet unari predic fs satisfact relat extend horn formula atom formula standard write formula sati ed valuat model theori membership equat logic simpli horn theori view signatur sentenc languag write model set sentenc model theori membership equat logic initi model basi reason explain detail section write denot initi model membership equat logic theori model note note write object logic connect detail section rewrit logic metalog framework minim sort formula theorem theorem op formula formula formula var formula mb theorem mb theorem theorem theorem theorem fig modul minim restrict axiom horn emploi formula formal properti sati ed initi induct properti system system implement rewrit logic design explicit aim support execut speci cation ectiv comput theori speci ed function modul system modul function modul theori membership equat logic equat function modul assum execut rewrit engin rewrit techniqu oper semant develop system modul rewrit theori rule system modul necessarili termin semant function modul modul denot initi model membership equat logic rewrit theori speci ed syntax function modul form membership equat theori meet requir mention figur function modul symbol ascii charact improv readabl note syntax function modul syntact sugar introduc nite set membership axiom sugar version figur present membership equat theori equat membership axiom horn membership equat oper declar op correspond horn xn xn xn david manuel mesegu variabl kind declar reduc sentenc variabl kind kind explicitli de ned infer system determin di erent connect compon poset sort addit syntact write shorthand formula variabl kind formula sort induct section introduc concept plai kei rest paper de ne induct principl membership equat theori show theori introduc concept simpl set adequ illustr main idea carri applic induct principl membership equat theori membership equat logic subset equat horn logic shown immedi theori uniqu initi model induct principl reason properti respect model de nition sort de theori membership equat logic sort fc cn sentenc form kind formula free variabl sort signatur induct principl respect formula form rewrit logic metalog framework kind membership equat theori de ne induct schema logic signatur note conjunct true implic replac initi model membership equat sort interpret smallest set satisfi axiom equal interpret smallest congruenc satisfi axiom set interpret sort induct gener stage correspond herbrand model collect horn induct principl formal induct stage set induct de ned induct stage induct de nition sort amount induct proof ground term kind sort establish reason membership equat theori augment sound theorem membership equat theori membership equat theori minim logic figur de nition rise induct principl sort formula formula formula formula formula formula formula axiom formal induct structur proof minim logic note induct principl sentenc membership constitut induct de nition subset sentenc call gener sucient induct de nition addit proof oblig sucient complet chosen subset induct schema directli formal membership equat sentenc membership equat logic infer rule induct encod rewrit logic prove membership equat theori david manuel mesegu minim sort formula theorem theorem op formula op formula formula formula var formula mb theorem mb theorem mb theorem theorem theorem theorem fig modul membership equat theori carri metalog reason xed famili theori di erent wai theori membership equat logic paper notion extens theori describ extens parametr set axiom de nition theori membership equat logic extens paramet axiom membership equat theori tg signatur mutual disjoint consist constant call tg membership equat theori function tg denot instanc tg homomorph extens axiom substitut gener instanc membership equat theori axiom instanti instanc variabl replac ground term sg parametr axiom translat result signatur figur modul paramet kind sort set parametr axiom modul formal deduct theorem rewrit logic metalog framework rewrit logic logic framework logic point view rewrit logic framework logic infer system formal express infer rule rewrit rule rewrit theori note rewrit logic structur properti formula express nabl algebra data type satisfi equat rewrit deduct place modulo axiom neutral simplic rule rewrit logic ectiv appli logic framework exampl logic includ linear sequent present modal proposit horn logic lambda pure type distanc object logic rewrit logic virtual direct reason faithfulli simul reason origin logic wai conserv repres logic syntax infer rewrit logic mention simpl direct turn infer rule rewrit condit infer rule side condit underli membership equat logic repres logic sort membership equat theori condit membership axiom directli support rule typic present logic formal system modul present figur repres minim logic membership equat logic idea formula theorem minim logic term sort theorem minim note preserv induct natur set theorem proof minim logic repres famili logic sort membership equat theori theori figur paramet kind sort set parametr axiom theori repres famili logic includ extens minim logic axiom formula theorem minim logic extend sort membership equat theori repres famili logic correspond logic famili instanc membership equat logic correspond logic famili repres membership sort instanc membership equat logic david manuel mesegu axiom term sort theorem instanc abil repres famili logic import rewrit logic metalog give work report section ection rewrit logic section explain rewrit logic ectiv system implement ectiv rewrit logic deduct introduc boolean function ect metalevel membership relat membership equat section explain combin rewrit logic logic framework ectiv capabl build theorem prover carri induct proof ection rewrit logic rewrit logic ectiv theori function encod pair consist rewrit theori sentenc sentenc nite present rewrit theori term function de ned ht ti ht term section hold rewrit logic prove form ht ti ht ection languag design implement make systemat fact rewrit logic ectiv give user ned gatewai rewrit logic entri point prede ned modul speci cation modul term rei ed element data type term modul membership equat rei ed ground term data type modul modul complet de nition modul map theori term membership equat theori tg similar theori rewrit logic metalog framework paramet treat special parametr natur tg express tg fact paramet repres variabl sort term note de nition theori tg technic de ned ordinari membership equat theori extra tg ordinari ground term sort term variabl notat tg potenti depend tg entiti introduc chosen solv ambigu context occur introduc tg membership equat tg denot tg entiti rule appli term membership equat theori reason theori extens boolean function ect metalevel membership relat membership equat logic theori theori prove induct ground term sort function modul speci check membership base give full speci cation restrict subclass modul member modul membership equat theori axiom horn involv membership assert boolean function plai kei rest paper denot mention subclass modul membership equat theori tg write tg instanc tg tg tg write set variabl sort term paramet tg build induct theorem prover section present induct principl reason formula sort de ned function membership equat theori explain combin rewrit logic logic framework ectiv capabl build theorem prover carri induct proof paper detail build theorem prove tool david manuel mesegu build induct theorem rewrit logic infer system explain section ection de ne strategi control rule applic strategi infer rule speci ed rewrit rule necessarili termin import control applic rewrit rule order drive rewrit desir direct user control rewrit rewrit strategi detail de ning strategi induct theorem tool ectiv design function modul prove induct object level infer system induct proof data speci ed system modul metalevel encod syntax proof rule logic induct sort de nition introduc de nition di erent proof tactic guid applic rewrit rule infer rule de ned modul user submit initi goal pair form function modul sentenc signatur goal success transform infer rule rewrit di erent set case success subgoal left applic infer rule rewrit rule control user strategi note build theorem prover di erent level ection result modular design clean separ logic control compon simpli extend tool addit infer rule modul chang strategi languag de ned modul vice versa rewrit logic metalog framework show induct principl introduc section reason membership equat theori uniformli ect membership equat theori extens result present section provid basi rewrit logic metalog framework recent version tool rewrit logic metalog framework induct theorem versu induct induct principl present section prove properti ground term sort membership equat theori sort properti express formula signatur properti hold formula express hold initi model interest properti sati ed ground term sort express formula signatur fact typic prove induct de nition sort properti relat di erent membership equat theori properti natur formula signatur membership equat properti ground term sort ground term sort express formula notic boolean function express formula true situat similar prove properti ground term sort instanc tg theori tg gener statement tg extens fv vn kind paramet formal instanc tg tg ground term sort tg ground term sort express properti formula signatur instanc tg boolean function formal true vn tg true paramet sort claim instanc prove induct mirror expect induct proof show section crucial david manuel mesegu mirror induct reason sort theori extens tg induct reason sort de ned set horn fc cn de nition boolean function set ground term sort term true set term form ground term sort de ned induct set horn fc set horn fc cn idea fc deriv induct rule prove ground term sort obtain induct rule fc cn de nition mirror metalevel induct metareason mirror induct reason notic deal result induct rule quanti ed variabl repres paramet metalevel infer rule theori formal intuit introduc infer rule prove broad class membership equat theori correspond induct properti initi model modul gener form true tg true rang formula signatur modul formula instanc gener form case theori constitut trivial extens sound infer rule introduc base fact instanc tg tg set term sort term term sort tg induct de ned infer rule ect metalevel induct principl de ned de nition reason term sort instanc tg de ne extens tg sort set set horn induct de ne term sort tg paramet variabl sort de ne infer rule prove tg rewrit logic metalog framework de nition tg sort fc cn set sentenc form tg de ne fc tg true tg true tg true fx variabl kind sort term variabl replac variabl kind sort term note free variabl de nition tg fv sort fc cn sentenc form tg free variabl kind sort form true tg true paramet kind induct infer rule respect formula true form de ned de nition formula tg tg tg tg tg true sound infer rule prove david manuel mesegu build induct prover section ection design theorem prove tool explain ectiv design tool implement infer rule induct sort de nition carri formal extend tool induct infer rule extend version tool work report section section give illustr rewrit logic ectiv metalog framework standard deduct theorem deduct theorem minim logic present deduct theorem minim logic implic theorem interest reason begin central hold hilbert system logic justi es proof temporari assumpt manner natur deduct system illustr subtl aspect formal metareason deduct relat di erent deduct obtain rst ad axiom prove arbitrari standard statement deduct theorem statement relationship famili pair deduct system write denot theorem minim denot minim logic extend addit axiom belong result set theorem deduct theorem state formula minim proven induct structur deriv minim logic extend axiom formal minim logic rewrit logic provid minim figur extens introduc figur recal minim repres minim logic formula theorem minim logic rewrit logic metalog framework term sort theorem deduct theorem formula term sort theorem term sort theorem minim notic theorem state implic truth membership assert di erent membership equat theori famili formal deduct move claim formula formal deduct theorem initi model minim true minim true minim term denot variabl sort term object level preserv variabl follow convent term term includ element sort term perform metareason reason term respect membership equat theori minim explicitli assum formal deduct theorem standard textbook proof requir detail gloss trivial correct formal de nition boolean function fact minim conserv minim logic requir formula minim logic super drop proof provabl theorem extens minim logic axiom formula minim logic proof deduct theorem show prove note proof mirror standard proof deduct theorem prove appli ect version induct principl sort theorem extens instanc infer rule reduc prove prove formula figur notic conjunct correspond case involv prove deduct theorem induct proof theorem minim logic extend axiom rst formal case conjunct formal case instanc axiom schemata nal conjunct formal case prove instanc modu ponen david manuel mesegu minim true minim true true minim true true minim true true minim true minim minim fig goal result induct theorem constant membership equat logic reduc prove formula prove conjunct result replac variabl constant symbol sort assumpt minim proof result conjunct mirror proof case standard induct proof deduct theorem denot term sort modul result replac free variabl sort term constant symbol prove true true true minim rewrit logic metalog framework theorem constant reduc prove prove minim true assumpt constant sort term true true true note assumpt fact proven theorem extens minim logic axiom formula minim deriv formula minim true minim true minim true minim true prove equat proof mirror proof formula theorem minim proof mirror prove modu instanc axiom instanc axiom exampl experi rewrit logic ectiv metalog framework carri number proof formal base sophist version deduct theorem minim logic prove result similar basin matthew shown scope applic prove theori induct de nition present gener version deduct theorem appli extens languag axiom david manuel mesegu minim logic theorem deduct theorem hold minim logic implic proposit extens necessarili extens modal logic requir ad rewrit logic base di erent foundat consid object logic similar detail involv move level basic structur proof similar area appli result program transform ectiv declar point program transform program function act term properti satisfi understood paper ectiv declar methodolog program map program speci ed metalevel function add modul equat de ning desir object function structur induct sort de nition properti show induct rule nition comment experi prove theorem issu manag proof combin reason di erent level work logician comput ectiv metalog framework complic bit encod involv state carri proof reason involv level avoid practic problem work ectiv hierarchi exploit ectiv capabl build tool suitabl interfac hide level ection part built speci ed interact induct theorem prover section automat extract theori induct principl reason sort nition induct rule correspond ect induct principl metalevel task hand prove nition prove induct theorem amount comput strategi theorem case initi model interfac hide level note reason logic encod induct de nition logic framework isabel involv multipl framework theori induct de object logic addit languag write tactic rewrit logic metalog framework encod user user abstract detail focu essenti structur proof theorem abstractli approach reason base ectiv logic framework theori initi model initi experi demonstr machineri ectiv deduct membership equat logic rich foundat formal prove experi prove similar provabl logic framework base induct de exibl move theori prove theorem relat theori establish properti class theori requir pose build famili set induct de nition reason element realiz membership equat logic ection number direct work concern gener notion theori reason metalevel famili theori set constant make constant prove develop gener theori calculu reason metalevel famili theori arbitrari set axiom prove involv gener modul full illustr carri proof similar stronger framework logic interest formal comparison rel strength membership equat logic ection versu stronger metalog logic set theori relat question easi ect induct principl structur induct nabl order acknowledg research support darpa rome laboratori contract darpa nasa contract oc naval research contract nation scienc foundat grant author care read draft paper detail suggest improv exposit david manuel mesegu refer introduct induct de nition handbook mathemat page mesegu rewrit logic metalog framework technic septemb basin metalog framework logic page cambridg basin matthew scope intern workshop rewrit logic volum page electron note theoret comput scienc septemb basin matthew structur induct de nition inform mesegu speci cation proof membership equat logic theoret comput ection gener logic rewrit logic applic languag phd mesegu metalevel comput kirchner intern workshop rewrit logic volum electron note theoret comput page septemb elsevi speci cation program rewrit logic sri januari mesegu build equat prove tool ection rewrit logic symposium japan april formal wing formal volum lectur note comput page program proc mesegu principl intern workshop rewrit logic volum electron note theoret comput page asilomar septemb elsevi mesegu axiomat ectiv logic languag page san francisco april xerox parc mesegu ection strategi rewrit logic intern workshop rewrit logic volum electron note theoret comput page asilomar septemb elsevi mesegu ection condit rewrit logic manuscript submit primit higherord abstract syntax intern confer rewrit logic metalog framework type lambda calculi applic volum lectur note comput april ectiv modul algebra applic languag phd finitari induct present logic logic colloquium goguen mesegu model equal logic program volum lectur note comput page gordon introduct theorem prove environ higher order logic cambridg plotkin framework de ning logic januari mesegu rewrit logic logic semant framework technic report sri comput scienc august handbook philosoph kluwer academ publish mesegu gener logic logic framework logic page oxford basin experi framework theori logic page cambridg miller logic reason abstract syntax twelfth annual ieee symposium logic comput june mesegu gener logic logic colloquium page mesegu condit rewrit logic uni ed model concurr theoret comput mesegu membership algebra semant framework equat speci cation volum lectur note comput page mesegu research direct rewrit logic berger comput nato advanc studi juli august mesegu goguen induct comput algebra method page cambridg induct de nition system rule properti confer type lambda calculi volum lectur note comput approach implement de nition intern confer autom deduct volum lectur note arti cial june david manuel mesegu isabel gener theorem contribut tobia volum lectur note comput scienc autom theorem prove simpl metalog lf kirchner intern confer autom deduct volum lectur note comput page juli mesegu pure type system rewrit logic proc workshop logic framework mesegu approach connect applic proof translat sri februari van emden kowalski semant predic logic program languag
IR/574 5 control robot web search engin depart mathemat statist saskatchewan canada liu ibm research ny ph inria sophia antipoli franc jr electr engin dept columbia ny publish proc acm sigmetr perform conf perform evalu vol pp june abstract robot deploi web search engin collect inform dioeerent web server order maintain currenc data base web page investig number robot search engin maxim currenc data base put unnecessari load network adopt queue model repres system arriv queue system web page brought servic correspond index page good perform requir number arriv rate queue chosen index queue rare satur formul stochast optim problem loss rate probabl criteria common approach reduc problem singl object linear function criteria static dynam polici consid static set number robot held dynam set robot function state assumpt arriv form poisson process servic time independ exponenti distribut random determin optim rule dynam rule vari number robot minim linear function loss rate probabl result compar result static case numer studi substanti gain achiev dynam control activ robot web search web markov process introduct world wide web major inform publish retriev mechan internet amount inform number web server continu grow exponenti fast order user inform search engin alta excit system consist main web page text user interfac deal index engin updat robot web server bring web page index engin qualiti search engin depend queri index robot schedul interest function perform establish currenc bring page index bring page investig problem number robot meet demand low network data base illustr figur center index repres queue nite multipl robot act sourc arriv page time success page access independ ident distribut robot ident function independ index time ident independ arriv process robot arriv page index page deliv temporarili potenti updat page network congest creat index engin data base updat wait robot bring page reduc probabl rst number robot suitabl reduc probabl number robot suitabl larg make object formul cost function weight sum loss rate probabl empti studi problem vari number robot minim cost function gener paramet robot schedul problem repres explicit limit network bandwidth store document rst constraint combin case loss creat bandwidth limit model loss creat bound capac occup index frequent wait document modi home make obsolet made part data base bound wait time requir small bound wait time determinist size object function slightli modi variant worthwhil direct research focu simpler rich serv refer model studi balanc network congest server util engin index robot robot site site site site inform collect robot store sourc sourc server finit buffer figur model search engin robot larg literatur search engin compon search engin sourc recommend research aspect subject found design includ distribut robot model analysi robot schedul index queue earli work natur model studi problem schedul singl search engin robot minim extent search engin data base work introduc model studi static optim problem number robot stai xed preliminari present result dynam robot schedul problem section tool theori markov process numer result compar static dynam polici report section section conclud discuss open issu preliminari assum number activ robot vari time function queue number robot activ address situat cast model markov process framework queue model index engin model queue servic time iid exponenti distribut random variabl accomod includ robot bring page server poisson stream rate assum poisson process mutual independ independ servic time featur model number activ robot modi arriv departur epoch arriv incom robot control decid idl departur occur control decid activ addit number activ robot left object polici minim weight sum stationari starvat probabl loss rate introduc mdp set solv optim problem time transit variabl uniform method sec epoch state mdp repres tripl kg ng number activ robot type epoch success epoch ft jump time poisson process intens independ servic time process epoch correspond arriv origin system probabl case departur probabl provid event complementari probabl action chosen time assum made activ addit made number activ robot unchang convent assum epoch correspond event state form arriv occur robot inact departur occur queue mdp set absorb state remov undesir state polici formal action system state reach sever restrict polici activ robot system empti interest state space mdp ng set action system state complet mdp introduc cost transit probabl process state action cost fl independ show choic cost subsequ optim problem hand transit probabl transit probabl equal loss gener pure stationari polici gain gener polici ch recal mdp set polici pure stationari action chosen map current state admiss stationari polici map introduc transit probabl matrix stationari polici class admiss stationari polici polici introduc expect averag cost unit time lim exist limit consequ fact stationari countabl proposit polici averag cost optim inf result order result mdp theori averag cost rst determin class current mdp belong stationari polici select action state state action easili polici induc mdp recurr class set transient state conclud mdp fx mdp commun pair state exist stationari polici access exist matrix lemma mdp commun proof lemma found appendix result lemma proposit sec proposit exist scalar map ir min inf attain minimum stationari polici optim optim averag cost optim polici proposit comput rel iter algorithm proposit xed state xed number map min arbitrari limit lim exist optim action state argmin proof mdp commun lemma proof sec prop return initi minim weight sum stationari starvat probabl loss rate solut problem solut mdp problem formul show averag cost weight sum stationari starvat probabl loss rate result hold polici induc averag cost depend initi state stationari starvat probabl loss rate independ initi state restrict class ae polici gener constant averag xg set polici proposit polici static polici maintain robot note reduc search optim polici polici yield loss gener exit optim polici constant averag cost case commun mdp proposit fix introduc yield fl lim lim drop argument quantiti depend interpret stationari probabl system empti epoch epoch form poisson conclud properti equal stationari probabl system empti arbitrari stationari starvat probabl recal ft sequenc poisson process intens assum loss gener total number custom arriv queue time includ custom queue length time assum sampl path process left limit ident rewrit lim shown expect number loss rst epoch expect occur time epoch interpret loss rate ident lim lim notic quantiti repres number loss unit time loss rate ident direct consequ theori renew reward process theorem set shown polici averag cost fl starvat probabl loss rate optim polici comput dioeerent valu model paramet figur displai optim polici dioeerent valu fl fl fl result obtain run iter algorithm proposit stop criterion max iter comput optim polici displai figur gure optim polici monoton switch exist monoton integ map ng conjectur optim polici exhibit structur prove figur optim polici cost figur optim polici cost figur optim polici cost static versu dynam polici section compar static dynam polici result static underli queue model averag cost ae ae ae optim number robot proposit fl optim number robot arg min fl fl fl result comparison report tabl experi dioeerent set paramet rst comput optim number robot proposit averag cost static case set paramet set number robot rel iter algorithm proposit closer faster algorithm optim averag cost min expect number robot activ optim dynam polici result found tabl stop numer procedur rel error consecut iter number iter iter rel improv report tabl comput optim dynam polici remov restrict number robot optim averag cost minimum min expect maximum max number robot optim dynam polici tabl observ substanti gain achiev dynam control activ robot number robot set rel improv respect optim static polici rang consid model restrict number robot improv rang gain function queue size arriv rate static approach dynam approach fl min iter rel tabl static dynam polici static approach dynam approach fl min max rel tabl static dynam polici conclud remark simpl queue model search engin analyz order optim number robot deploi web cost function weight sum loss rate starvat probabl studi dynam set number robot chang time function workload queue show case dynam polici substanti static base advoc introduct polici web search engin interest open issu includ model robot homogen alloc dioeerent part network determin optim number robot alloc area gener input process markov modul poisson consid accur robot network cost function cost function includ time refer dynam program determinist stochast englewood robot schedul web search pp queue vol wilei markov introduct stochast dynam academ ph jr number robot web search telecommun vol pp arriv time oper vol pp appendix proof mdp commun proof lemma word notat design state level case proof depend state reach level higher level lower level assum rst select polici polici process enter level leav state level recurr assum reach jump level arriv occur level select polici state state state polici polici process success visit level stai forev level visit state polici polici process success visit level stai forev level visit state assum polici process level level move state state nalli state
HCI/575 4 august augment realiti mobil substrat design comput support process control nielsen depart comput aarhu denmark abstract paper investig augment realiti perspect design comput support process control distribut environ base empir studi work treatment technic approach augment realiti augment object environ examin term collect design scenario conclud approach metaphor consist theoret inform design mobil support process control work augment process mobil participatori workplac studi hd introduct advanc technic modern treatment highli distribut dynam strategi support work set introduct mobil technolog augment realiti approach inform design bridg distribut technic set implement comput support mobil substrat process control engin disciplin includ area autom theori cognit system engin focu integr compon system autom level field level focu error hazard control room nuclear power plant reason field cscw studi similar process control set studi london underground luff air traffic control emphasi collabor aspect risk manag mobil technolog distribut work mobil support distribut delimit case exist inform technolog acknowledg mobil mobil devic distribut collabor set reflect work ljungberg luff august heath myer al dix al argu interplai real virtual core design mobil applic share virtual real natur user artefact concept virtual realiti attract attent invent dataglov proven practic applic concept realiti launch strategi integr virtual real world al wellner al base previou studi dynam work treatment plant nielsen mobil technolog support work environ real work scenario detail investig basic approach augment realiti augment environ inform design mobil devic support work treatment set discuss problem introduc separ base interact relat real work situat show perspect control design mobil augment realiti approach inform design shed light situat angl section describ treatment visit set scope case studi augment realiti approach inform design section relat basic augment techniqu real work creat futur scenario regard mobil devic construct support work treatment plant relat augment inspir futur scenario evalu augment realiti relat design mobil substrat treatment treatment case studi part research cooper area hci cscw involv larg scale danish manufactur comput scienc depart aarhu partner explor theoret notion practic design common inform space project focuss field studi conduct research particip paper report observ work plant select follow worker entir daili routin research video camera captur event special emphasi daili work worker dealt disrupt select group clip present plant feedback session user workshop compar work practic site data collect project research treatment plant treatment plant conduct studi modern treatment plant pai august attent flexibl exist work affect coordin work process plant includ chemic biolog phase result segment produc produc electr run plant remaind press plant plant implement automat process remov autom due develop sensor measur control primari paramet oper process radic chemic plant estim capac person constantli run plant expand match product work treatment plant emploi total peopl manag manag plant remain work area chemic test receiv preliminari sort sand trap plant control room press pair worker task specif part treatment process individu worker temporarili labour stabl bound set work individu free task situat demand import goal work relev part plant condit underli process run worker home night weekend worker charg lab spend hour morn collect water sampl qualiti water stage process worker charg ga turbin area check machin collect ga produc hour plant area task natur start morn overview statu plant graph list alarm daili routin check mainten highli find high unpredict plant major alarm receiv treatment plant water level maximum limit tank alarm call address period dai worker handl time specialist call alarm due machin worker complet break daili routin enter cooper effort worker manag specif pai attent warn alarm physic sign desir prevent recov machin breakdown august plant continu engag number experi produc cleaner water cost involv introduc technolog work practic provok unanticip event effect everydai work school disrupt normal visit carefulli plan execut daili work routin dynam structur worker deep understand assign plant order perform task continu reinvent work practic enabl place equip area redefin order task order cope numer event possibl anticip aid explor environ understand design mobil chosen augment realiti perspect import connect physic virtual work treatment inform physic layout individu compon inform comput system augment realiti approach support make connect visibl basi design augment realiti augment realiti approach inform system design redirect inform back real augment exist object replac repres pure comput base system argument base artefact workplac mediat work subtl wai imposs transfer comput base paper flight strip air traffic control document exampl al augment realiti altern approach virtual environ mackai describ technic approach design augment span continuum technic substrat mix augment physic environ augment user enhanc respect percept action wear carri devic head mount transpar displai data glove obviou exampl glove tradit base augment augment input output comput devic physic object white board record written lego brick comput power exampl augment object tightli relat idea comput futur everydai object augment environ independ inform collect object user displai physic object augment environ understood indirect input output extent classif point progress naiv brute forc vr gear approach august augment approach technolog applic user wear devic bodi physic object emb devic object environ surround object user project imag record remot vr helmet data glove intellig electron paper video graphic bar code video projector field present offic posit offic architectur tabl exampl augment realiti relev technolog applic mackai augment design strategi distinguish act object artefact mediat human activ achiev outcom terminolog augment realiti redesign mediat artefact categori augment point specif type consist manner respect work orient perspect augment gener attitud acknowledg histor develop work work gener artefact gener artefact augment realiti gener design strategi close relat idea design comput artefact accomplish transform artefact domain work select situat field studi base work empir materi select situat suitabl understand treatment work explor concept augment mobil substrat specif water brown part daili bob check area tank notic surfac water tank immedi build water check filter suspect turn explain water check filter build part area august situat simpl man work round part plant task physic goal check number thing situat reveal interest point identif mode process encount brown call causal process interf actual goal initi chang routin daili round defin term task checkpoint routin leav plenti flexibl order task perform relat task strict relat physic layout plant contradict motiv work process run continu lack warn brown water risk actual machin breakdown physic layout render process imposs connect compon relat process physic stand side side reserv hold cooper situat worker leav routin recov collect machineri flexibl crucial argu high flexibl import everydai case aspect treatment process absurd claim flexibl physic flow water make send water bai chemic mechan clean process argu technic structur treatment process identifi continu chang process make test joe lab clean lab sampl start daili tour plant pick walk plant collect sampl water inlet secondari set reservoir exchang empti gather sampl automat minut past hour return lab pick remain pick sampl post set reservoir biolog build automat post set joe meet colleagu find paper matrix printer lab suggest joe call find joe decid control room contact joe busi time dai find paper control complet round collect walk meet room find printer paper util room gather process minut august work build call joe content primari clarifi strang grei briefli discuss decid action joe pai extra attent lab result todai joe lab start analysi sampl water organ matter total amount dry matter test minut finish test special heat remain organ total amount dry requir hour joe finish test join colleagu comput room door analysi result prove ordinari ordinari ar scenario explor technic augment strategi metaphor design comput support treatment situat scenario augment object water brown augment scenario set base water materi bob interpret water tank situat daili inspect round augment user part daili bob check area tank notic surfac water tank put vr glass water glass project system inform plant build filter connect compon zoom filter compon notic flow filter low immedi proce room start clean filter augment object part daili bob check area tank notic surfac water tank walk tank displai inform show flow low filter suggest filter immedi proce check primari valu filter filter confirm massiv bob start clean filter august augment environ part daili bob check area tank notic surfac water tank speak command displai system project water surfac flow order show tank part diagram project surfac indic problem filter directli connect tank immedi proce clean make test augment scenario scenario underli assumpt treatment plant access sensor provid continu analysi content water separ part process equip measur amount organ matter amount dry matter augment user joe pick lab comput plant start round inlet connect mobil comput automat water analysi system mobil tool show sensor work download list analysi valu inlet water mobil lab comput proce secondari set reservoir post set reservoir pick concentr build automat analysi equip post set joe meet colleagu pass biolog tank check result equip download inform lab comput control room connect main comput download inform system work build call joe content primari clarifi strang grei briefli discuss joe lab comput result close lie permit rang ordinari augment object joe plant start round inlet inlet displai analysi log collect past hour check sensor alarm analysi result automat main store proce secondari set reservoir post set repeat check routin build automat analysi equip post set joe meet colleagu pass biolog tank check result equip find anomali result august round complet minut work build call joe content primari clarifi strang grei briefli discuss decid action joe result sensor back control room set joe control room access inform compar sensor output checkpoint lie permit rang decid ordinari augment environ joe plant start round inlet speak command displai sensor inform project water joe verbal command proce secondari set reservoir post set reservoir repeat procedur build automat analysi equip post set joe meet colleagu pass biolog tank check result equip find anomali result round complet minut work build call joe content primari clarifi strang grei briefli discuss decid action log walk insid primari clarifi joe call map treatment plant show primari clarifi sensor project wall specif call log inform project map joe colleagu confirm sensor valu lie permit rang strang decid ordinari augment realiti base comput support mobil substrat futur scenario base origin work scenario technic approach augment step scenario lead comput support distribut process implement mobil substrat mobil tool support work treatment plant definit type case augment devic obtain inform physic object exampl explor mobil technolog support treatment work relat augment aspect futur scenario previou paragraph inspir voic august augment user equip user mobil devic provid inform local pc control room feedback hear motor chang pitch adjust speed effect mobil tool call inform water tank show compon physic connect mobil tool enabl oper view measur sensor trivial suggest satisfactori implement user relev inform reli commun compon interest describ network connect compon part augment object mobil devic relat augment object provid interest give exampl situat compon breakdown requir special monitor repair mobil devic compon temporari devic compon put back oper worker area compon local control surveil handl compon integr work daili round definit mean augment physic implicit call softwar physic object sound border augment blur regard devic mention previou augment user add power cord solv commun problem mobil devic compon mobil devic augment user augment environ augment environ mobil devic yield import factor show situat motor broken worker repair part area specialist carri mobil locat displai primari properti make properli shut start disassembl place mobil devic ground access blueprint type motor work mobil devic track motor disassembl piec ground project draw air indic damag part motor worker pick specif area blueprint light aid worker repair subsequ motor mobil devic capac augment object environ hold true complex procedur clean filter august exampl conclud perspect strictli disregard appli perspect design yield result imper artefact design support work practic perspect evalu border perspect longer guid design solut basic strategi artifici base sole interact mode approach augment realiti base assumpt function interact meaningfulli separ softwar design question complet separ exampl shown suggest present collect futur scenario augment realiti base mobil technolog base situat empir studi treatment work base applic technic approach design augment realiti paper altern straightforward idea mobil technolog matter enhanc user present futur scenario rigidli base technic approach augment expect import aspect treatment work neglect situat design perspect limit technic approach design augment realiti fruit metaphor design mobil technolog manner displac focu import work orient issu respect design mobil support process control analysi point kei context dynam technic approach augment induc differenti type mediat point technic classif interact devic approach base specif mediat determin technic substrat relev artefact result artefact incorpor concret activ specif instanc mediat role mobil move role augment augment object augment point gener dynam artefact mediat human activ separ interact function prove problemat detach content work situat case trend distribut autom control system plant mean advanc onlin sensor wireless network condit creat augment realiti base importantli treatment work context import issu address design mobil illustr futur scenario augment realiti base design mobil support physic locat domain obviou simpl bar code advanc techniqu context mere physic locat hierarch technic layout august scenario studi compon plant plai role worker actual work context specif oper interest set inform rang control specif compon context daili inspect set inform control situat machin breakdown access inform control put enorm navig load oper mobil impract size limit handl piec equip situat solut found continuum system intellig determin context possibl oper predefin context depend mode mobil comput support dynam natur treatment plant induc support flexibl adapt treatment plant chang dai dai basi mobil support seamlessli adapt chang configur insensit chang acknowledg gener unpredict add similar dynam respect technic configur step treatment project includ workshop worker treatment plant simul work prototyp develop prototyp inform scenario present paper theoret orient empir primarili serv vehicl test domain comput support wire acknowledg peopl treatment colleagu project leader susann peter minut lingual issu work project support danish basic research centr interact danish nation centr project work danish refer understand construct share space mix realiti boundari acm transact interfac festiv design transform artefact participatori design palo comput social pp ow nielsen dynam framework understand formal construct complex technic set design factori futur york og hansen august liv activ aarhu press pp human activ approach user interfac design nj scenario design set stage reflect action davi rodden context hci design mobil workshop human comput interact mobil edit depart comput glasgow theori practic treatment john wilei cc luff collabor crisi manag multimedia technolog london underground line control room cscw pp dz technolog support make safeti critic environ safeti scienc ljungberg messag pad support scandinavian journal inform system vol pp ljungberg modal mobil interact applic mobil edit fraunhof institut comput graphic make work commun vol pp heath mobil collabor grudin acm confer comput support cooper acm pp reinvent explor augment realiti design space air traffic control lo augment link real virtual world paradigm interact comput acm confer advanc visual acm press multipl pda connect acm confer comput support cooper edit acm pp comput centuri scientif american vol person devic xv ifip world comput austria august septemb inform process interact approach cognit engin human error cambridg press af mackai gold comput augment back real world special issu commun vol
DB/576 3 nearest neighbor queri dynam ioana amr el abbadi comput scienc california santa barbara abstract paper algorithm answer nearest neighbor problem formul recent class queri strongli relat nearest neighbor necessarili complementari unlik nearest neighbor rnn queri find set point queri point nearest neighbor awar algorithm approach answer rnn queri earlier approach rnn queri base neighborhood inform organ term auxiliari data structur argu precomput rnn inform point restrict case dynam insert updat oper lead modif larg part auxiliari data structur answer rnn queri set data point depend number dimens initi data structur algorithm approach flexibl support larger class rnn order support extend current method nearest neighbor search condit nearest neighbor introduct problem answer nearest neighbor queri formal defin recent complimentari problem find nearest neighbor queri studi past year nn queri find point work support part nsf grant number closest queri point distanc rnn queri find set point queri point nearest neighbor complex rnn problem fact relationship asymmetr fact queri point data point nearest impli ps nearest neighbor impli qs rnn data point point straight line nearest neighbor nearest neighbor note nearest neighbor nearest neighbor paper present effici solut rnn queri approach extend data set higher dimens wide rang applic benefit effici implement rnn queri ga vendor compani market expand open ga station citi choic compani strategi pick locat attract custom ga station neg impact exist ga station store locat ga station citi addit inform approach creat view select inform ga queri view ga station geograph closer locat rnn queri return set ga station affect competitor locat queri compani easili analyz effect compet compani rnn queri exist locat paper develop algorithm solut rnn problem gener index addit search nearest answer standard queri present organ present develop compar approach summar goal section section present underli idea algorithm solut problem rnn queri algorithm base exist solut nearest neighbor section extend rnn queri condit nearest neighbor queri present detail rnn algorithm conclud summari extens work section background motiv solut answer rnn queri dynam recent solut base store list data point nearest neighbor nearest neighborhood distanc circl rnn queri point enclosur queri rnn tree store inform nearest neighbor rigid queri relat tupl multipl attribut tupl data point inform answer queri revisit ga station present tupl attribut defin point geograph locat assum tupl includ specif data type servic offer dimens store level servic ga mini automat hand facil locat queri attribut repres inform data set project plane geograph direct queri appli data set project data point desir restrict set subset attribut answer rnn queri flexibl manner set nearest nearest neighbor queri point differ depend dimens consid data data structur construct specif answer rnn queri rigid queri point data set fp illustr figur queri defin dimens nearest neighbor queri space restrict dimens return data point accommod rnn queri span variabl subset algorithm approach project ax ax figur vari nearest neighbor set depend number dimens paper dynam undergo insert delet data point due user updat updat queri dynam static case insert delet oper lead comput modif index structur interest rnn queri context data updat frequent perform import underli data sourc updat view data reflect answer user queri base data updat method simpl effici algorithm base continu maintain list data point nearest neighbor insert delet element lead partial recomput list type support queri interest combin inform state auxiliari inform partial answer overload mainten task view solut present solut answer rnn queri space introduc observ lead give simpl algorithm find nearest neighbor queri point method base exist algorithm answer nearest neighbor queri applic method benefit ffl goal integr rnn queri framework exist access structur approach algorithm independ data structur construct specif set queri ffl updat impact perform affect size rtree index data set rang spatial join queri case insert delet oper comput storag cost specif facilit rnn queri assum nn queri support system ffl addit data structur space requir algorithm base underli index data structur answer nn queri assum spatial data structur applic requir abil answer rang topolog queri nearest neighbor queri ffl solut present facilit base queri constrain point data set class queri make applic involv summar interpret data data view preliminari paper assum distanc point euclidean jp algorithm depend distanc metric result refer data point easili adapt higher dimens notat denot answer nearest neighbor queri point return set point satisfi nearest neighbor condit respect note set point queri point correspond actual data point data base queri point defin line intersect divid space region fix parallel angl rest refer space divid line proposit queri point return data point higher dimens number maximum data point satisfi depend number dimens consid result state proposit base observ upper limit number data point scenario point circl center distanc consecut point circl radiu distanc point line line line divid space queri point line line proposit figur consequ observ proposit space queri point divid equal region straight line intersect space space divid line exist rnn point region exist rnn point region point space divid line delimit proposit space divid show prop assum point region delimit space divid line point point show data point assum triangl case closer qp angl angl case construct space divid opposit line delimit elimin scenario angl line qp qp case impli consequ contradict initi hypothesi proposit simpli state queri point region nearest neighbor nearest space divid import criterion limit choic point region algorithm answer queri find candid set data point region satisfi nearest neighbor condit candid point test condit nearest neighbor point satisfi condit return answer queri algorithm develop past year paper develop index structur base discuss optim method find nearest neighbor figur section region minimum bound rectangl queri base prune index structur intuit point data space group cluster delimit minimum bound rectangl turn part larger cluster mbr smallest rectangl complet set point face mbr data point mbr rectangular coordin opposit corner node store level reflect granular cluster consid algorithm find queri point search compar node level node lead nearest neighbor point rest tree proxim comparison base shortest distanc queri point rectangular cluster minimum distanc queri point furthest point closest face point mbr distanc queri point ensur exist data point mbr distanc queri point detail section squar euclidean distanc distanc reduc comput cost approach effici answer rnn queri build previou work nn queri nn queri frequent relat rnn safe assum method answer nn queri implement system solut paper algorithm easili modifi make techniqu develop nn queri method find region section point satisfi condit set data point result algorithm nearest neighbor search appli data project desir dimens due section space point satisfi nearest neighbor condit modifi algorithm find nearest neighbor point introduc restrict prune index tree node check check proxim queri point root node satisfi condit prune node set interest region data set candid point return candid point nearest neighbor satisfi condit queri point necessarili exist data test compar distanc distanc nearest neighbor import note data point fall space divid belong point return iter tree filter step exclud duplic summar modif algorithm design nn overview queri point construct space divid line intersect queri point section condit nn algorithm find add list elimin duplic step entail condit algorithm find section present modif nn algorithm order support condit nn search find nearest neighbor data point restrict region space region find nn region case mbr region figur condit nn queri section analyz nearest neighbor queri constrain region gener import problem solv type rnn algorithm linear constraint interest special case find nearest neighbor region divid space divid line queri point algorithm find nearest neighbor queri region ineffici scenario figur data point furthest queri point algorithm discard point find cluster mbr context belong region fulli partial figur show case mbr bound consid overlap region mbr fulli mbr vertic minimum bound data point mbr cs vertic mean entir edg mbr definit data point mbr vertex import note case implic exist data point mbr vertic part minimum bound rectangl overlap queri region previou make assumpt data point approach find nearest neighbor region index tree prune section tree lead answer mbr belong queri point closer queri point space constraint problem condit nearest neighbor search extend region space tradit nn method special case gener approach show minor extend nn search algorithm satisfi condit nearest neighbor queri method index tree depth order level creat list node children sort distanc metric root node list visit sort order function children candid nearest neighbor return list remain children visit prune differ algorithm condit nearest neighbor algorithm resid metric sort prune list candid node idea method defin minimum distanc queri point mbr minimum distanc furthest vertex closest plane exist data point rang mbr queri region queri region figur modifi condit nn queri safe discard data point distanc queri point discard list candid nearest neighbor point satisfi condit minimum bound box discard method assum entir volum minimum bound rectangl queri region case condit nn modif tabl posit mbr respect region case consid find goal modifi notion implic manner note measur irrelev mbr partial queri region accommod redefin distanc queri point furthest vertex closest face includ mbr intersect region vertic data point set captur uncertainti case vertic impli edg data point edg necessarili closest queri point redefin function distanc furthest vertex closest face region comput valid definit lower bound locat data point insid mbr case distanc measur point mbr fall region correct looser lower bound gener permit easili ignor dimens rnn queri interest defin simpli distanc relev dimens depend altern dimens consid flexibl approach tree construct base dimens interest determin algorithm rnn algorithm develop paper start find nearest neighbor region test data point satisfi rnn condit find candid point separ region comput region index tree separ prioriti list creat inform minimum bound rectangl read rnn candid verifi index tree present algorithm find rnn point main function creat structur hold inform queri point initi nearest neighbor list call return list nearest neighbor region duplic list elimin function check candid rnn point test queri point nearest neighbor point return clariti describ condit nearest neighbor search parallel practic condit uncondit nearest neighbor flag lag distinguish algorithm integr function show detail run method similar parallel number depend number dimens queri infer format queri point pass argument function inform defin dimens queri dimens comput distanc mbr search condit nearest neighbor method search condit nearest neighbor queri base function pass pointer node index build set list region search branch list pointer children node addit pointer children node counter pointer branch list children children higher count visit step requir search region overhead reduc branch list prune base nearest neighbor found base relationship mbr respect children distanc metric mbr nearest neighbor exclud call child highest branch list point function return updat list nearest element respect data point distanc queri point nearest neighbor candid prune branch list refresh count list branch prune function rune rune distanc comparison criterion discuss section branch list child order count visit node leaf index compar distanc children nearest point updat structur nearest store list nearest neighbor approach addit tree construct store set object consist data point distanc nearest queri number vertic intersect intersect distanc furthest vertex closest face tabl definit return list nearest neighbor point struct nearest struct rectangl struct nearest int rnn list rnn duplic rnn list return count remain candid add return tabl algorithm nearest neighbor search condit nearest neighbor search base queri point number divid space number region search parallel nearest neighbor node rectangl struct nearest int number node boolean condit uncondit search explicitli int intern downward order counter visit upward prune branch order counter leaf distanc queri dist nearest set repres rectangl queri point nearest add nn tabl algorithm condit nearest neighbor search answer test enclosur object rnn tree comput answer rnn queri drawback approach updat modifi maintain advantag fast queri section nn rnn tree modifi insert delet oper develop algorithm specif interest dynam updat frequent queri flexibl refer subset data space dimens method requir construct mainten addit data structur underli index tree updat dynam disadvantag higher cost queri comput outweigh simplic effici updat futur plan includ perform comparison origin solut interest explor altern implement base concurr evalu wider rang queri refer kriegel index structur data intern confer larg page seeger effici robust access method point acm sigmod intern confer manag page kriegel fulli dynam index structur data intern confer data engin march guttman dynam index structur spatial search acm sigmod intern confer manag page june kamel faloutso pack rtree intern confer inform knowledg manag page kamel faloutso hilbert improv fractal intern confer larg septemb influenc set base nearest neighbor queri technic lab fast nearestneighbor search medic imag intern confer larg septemb faloutso complex rang queri region data store intern confer data engin march vincent nearest neighbor queri acm sigmod intern confer manag page closest point problem comput geometri handbook elsevi scienc selli roussopoulo dynam index object intern confer larg page selli roussopoulo distanc spatial acm transact system june
IR/577 5 integr print digit inform norri beat signer institut inform system eth switzerland abstract paper ensur retent kei inform spite dramat digit technolog inform process deliveri recent develop print wand technolog lead widespread digit augment paper enabl paper digit world link interest technolog achiev true integr print digit inform sourc user freeli back paper digit resourc present server technolog support integr user dynam link area print document object applic server compon implement extens inform manag architectur independ print reader technolog digit augment paper framework present manag semant inform applic link client devic support client access introduct issu architectur technolog integr exist data sourc topic interest year commun number solut approach depend level local autonomi requir function target system term form data sourc cover includ categori manag knowledg base file system web document major form data sourc paper document predict longer realist continu paper consumpt decad digit technolog advantag term store access larg amount displai multimedia fast search dynam medium enabl content link updat paper technolog advantag digit media term navig document simpler scan book rapidli page digit document paper support form collabor interact mimic current digit environ achiev integr paper digit gain world number project variant digit augment paper mean link print digit focu print wand technolog data integr concept link mechan tend base physic logic resourc physic posit document link multimedia file result link static link level logic enabl link multipl achiev integr print digit inform simpli underli media user freeli author share enhanc tradit qualiti paper static medium dynam link featur digit media kei semant integr print digit inform li primarili server client technolog suitabl framework capabl dynam map document posit inform object vice versa manag semant flexibl mean classifi associ logic physic resourc manag inform user client devic framework clear separ content enabl document gener dynam suit client user context develop integr server context european project call paper develop assess innov concept technolog aim enrich paper everydai set line current project data web basic integr platform sect introduc system discuss relat tradit data integr architectur section describ gener technolog digit augment paper underli approach sect explain architectur term relev client server compon detail om data manag compon implement integr framework present sect discuss relat work sect conclud remark sect integr print digit data state detail data integr architectur depend factor requir target system characterist data sourc term heterogen autonomi oper earlier project focuss specif problem integr recent research tend address gener problem integr form inform sourc knowledg digit librari web document architectur vari greatli term scope common form semant integr global mediat fig show simplifi version typic integr architectur local schema integr global schema integr data store global level perform map global semant concept local applic applic db applic db local schema local schema integr db global schema integr transform db transform schema user db user schema print document integr applic db applic schema figur data integr architectur integr paper inform sourc digit inform situat schema paper inform metadata integr inform print paper perform link page part page inform object applic shown fig transform map physic document posit object vice versa obtain requir flexibl map physic document posit multipl object map depend user introduc concept layer user model shape describ select area page digit wand return coordin posit transform map object applic shape posit specif layer case point li intersect inform object bound shape topmost layer set activ layer return select activ deactiv specif layer enabl gener context depend result bind posit page resourc current activ layer set assum layer number shape layer point write denot point shape shape exist point shape layer point set activ layer subset layer denot set activ layer set shape select shape point function sm note layer deploi content user assign specif rang layer user activ user specif system user concept deploi user depend content user data compon shown fig manag inform user system user defin prefer classifi type user group enabl author digit augment document defin inform anchor bind content inform anchor base user inform augment paper deploi inform base user profil typic applic user inform deliveri educ teacher addit inform resourc anchor teacher receiv solut includ student obtain hint link materi user prefer user prefer applic show user fig separ compon introduc basic idea integr paper digit inform discuss detail technolog architectur requir achiev integr digit augment paper previou integr print digit inform sourc base abil detect page posit document print reader technolog requir fulli support digit augment paper form wand devic barcod emerg marketplac expect develop futur term cheaper read devic mean encod document posit paper dramat spread digit augment paper annot physic techniqu identifi activ area sheet paper activ area shape defin author correspond text singl figur part activ area specif word text overlap part imag imag user point activ area wand trigger action displai digit media file link execut applic system oper paper detect posit page print standard paper grid barcod inform page number posit term coordin induct ink point paper wand devic capabl measur read barcod final decod page number actual posit reader illustr basic idea system fig shade pattern page barcod encod document posit term coordin logic element page made select defin logic shape digit wand return document posit server map posit turn link digit inform object figur map page posit defin shape fig show page text paragraph imag author select element man imag dog imag select element shape side figur shape form polygon complex shape shown rectangl shape object applic man shape link person object give detail person possibl digit multimedia resourc video sound note capabl link print inform digit dynam link print document illustr fig side show page previou assum indirect link object breed dog natur natur assum inform repres breed anim associ countri breed found side show atla assum author link atla countri repres natur link deriv print inform sourc user point dog paper document present link includ link atla document posit document inform countri breed dog origin found import link imag dog map atla explicitli author dynam deriv base author link concept natur associ notion digit augment paper user back print digit inform sourc print inform contribut avoid problem user switch paper digit inform lock digit world distract origin document approach digit annot physic digit object addit multimedia system provid power tool user classifi build link physic document figur link paper document import issu provid user feedback locat activ area document possibl action locat inform anchor obviou case visibl barcod fig mechan requir inform user presenc activ area barcod author highlight part page link digit inform fig highlight word activ area barcod lower specif make omit visibl hint addit inform leav task find link complet user children book part learn task find addit inform suit book case user gener simplest inform anchor combin wand devic marker pen user highlight area paper ad link experi sound feedback mechan figur annot natur encyclopedia page develop print barcod scheme wand devic system base activ area current research solut present tend base visibl encod pattern expect solut barcod scheme provid good level posit granular futur import factor develop server ensur independ technolog encod scheme assum simpli deliveri document posit discuss relat work sect describ altern technolog present paper server framework base classic client server architectur client wand devic enabl read document posit induct barcod print digit augment document client devic transmit data server process inform paper server consist main compon shown fig barcod decod compon decod barcod receiv input devic present result return extens inform manag architectur compon process request data manag interact applic compon base om java data manag system figur paper architectur overview typic paper user point devic transmit barcod inform preprocess ascii format barcod decod relev inform page number posit barcod http request includ inform wand devic current posit paper document server compon base interact model transform server fetch inform applic return result prefer format digit present devic regular web browser receiv html format result phone receiv wml result page request fig digit present devic laptop comput serv barcod transform compon note barcod transform result place devic mean public result displai larg global displai transform place user individu portabl devic import note oper server side independ print digit wand technolog initi prototyp applic develop exist barcod reader barcod transform process easili adapt form devic capabl detect posit sheet paper compon complet independ form input technolog support extend function term user interact fig present configur initi user studi natur encyclopedia applic run laptop comput barcod reader handl input process applic run pocket pc card shown fig figur natur encyclopedia applic run laptop pocket pc remain flexibl handl user defin entir logic input devic separ interfac simpl replac concret java class implement wand devic easili switch input devic server om java system gener compon access manag data case paper manag user applic perform request process map document posit applic object gener present data describ consid access layer om follow comment om java data manag system gener paper server framework extens inform manag architectur develop support client access inform system base web technolog exist tool web site engin reli specif form client html requir form client handl separ mean requir develop time port applic form client devic client framework requir minim develop access web document form client devic addit option present suit devic question gener framework import consid dynam world mobil devic overview server compon fig specif client access singl java servlet entri servlet mean singl url specif web url type client entri servlet detect user agent type http request header deleg handl request servlet show fig servlet handl request html xml browser wap phone term wml browser support access mobil phone regular speech telephon base speech recognit synthesi support provid server html servlet xml servlet wml servlet api xml server xml xml browser html browser wml browser deleg figur server compon request handl servlet access connect om java workspac om java api connect direct xml server compon direct connect deal request involv data retriev check membership object collect perform updat request involv retriev data xml server forward om java data manag system gener xml data object return servlet request servlet xslt templat transform xml result return client point note gener architectur store xml gener dynam applic data store inform model inform model graph model base object collect flexibl restrict model xml structur access hierarch view data deriv xml structur gener gener xslt templat client provid gener browser editor current set client devic type ad type client devic involv implement servlet write xslt templat specif applic interfac support xslt templat specif document structur term document content built dynam individu inform object scope paper describ detail inform found om data manag compon discuss gener integr architectur sect show compon transform user applic singl separ user prefer gener appli applic store separ conjunct number applic compon applic exist make perform integr separ transform applic involv number applic form digit inform actual prototyp system built paper creat scratch integr compon singl problem distribut compon version om specif support connect distribut compon user applic data store om java data manag framework base om object model om objectori model support inform model structur classif type entiti repres object method trigger defin object type classif entiti semant group repres collect member type member type collect constrain specifi contextu view object access collect object view behaviour associ type collect role repres om high level associ construct enabl relationship classifi manipul directli associ construct support decoupl inform object object tend referenc associ object refer attribut model includ power set oper collect associ express featur om model enabl captur semant applic domain term power set construct support direct manipul associ support link manag system support hypermedia paper fig show part applic model natur develop paper prototyp integr print digit inform natur object applic model resourc mean anchor defin print document resourc link resourc system link built simpl multimedia object piec imag sound clip shown upper part figur interest start link part physic document applic object repres concept specif applic domain case natur concept locat concept connect specif associ express fact speci found specif give speci classif add domain specif semant assum user read print version natur inform speci link digit addit inform anim digit inform earlier follow link back paper world atla give inform countri speci found resourc resourc medium media medium imag medium film medium sound resourc text contin contin habitat habitat locat locat speci speci classif classif classif class citi citi classif classif famili countri countri classif kingdom classif order classif classif partit figur natur applic model bridg physic paper digit transform model defin document meta inform repres shown fig document multipl page page multipl resourc anchor actual inform anchor defin shape circl polygon transform data check specif posit document exist inform system test point li shape resourc anchor inform resourc applic point associ mean fetch inform specif locat activ area print document digit object store applic document document anchor anchor point point shape shape page page resourc resourc partit rectangl rectangl polygon polygon circl circl figur transform compon shown fig model associ shape layer enabl overlap shape possibl link part shape resourc case posit li activ layer return sect provid form deactiv topmost layer time user point document element present data model inform support type client devic templat final render gener xml result base dynam gener xml object store om java client specif render extens stylesheet languag transform support varieti client enabl variat type devic regular user applic user interfac defin applic provid specif group user defin user model relat work describ exist numer approach encod inform piec paper power digit augment paper strongli depend function server compon handl request client technolog user freeli back paper digit dynam creat link paper digit paper resourc paper citizen hypermedia system kei achiev vision li power technolog server side provid flexibl power dynam link manag applic semant explain describ link process support exist project limit start compar system intellig paper approach similar solut standard sheet paper cover print mark term posit detect approach inform encod barcod global uniqu identifi separ document identifi page identifi encod page identifi page specif document major approach map physic locat paper digit content manag intellig paper project adob suit product build electron counterpart paper document link physic page solut retain separ paper digit world digit version physic page creat logic link media element physic page map digit object barcod encod inform piec paper solut interest approach xerox base store data physic paper special cover sheet form build paper user interfac cover sheet front document scanner fax machin connect document servic system definit specif action document augment document addit piec paper technolog develop swedish compani call special pattern dot print grid page digit pen digit camera track movement main focu electron pen inform transmit client goal digit augment physic medium altern possibl creat inform anchor physic paper highlight pen augment small camera simpl comput vision pattern recognit techniqu user make mark paper store pattern document meta inform make support bidirect link enabl user back physic paper digit media video camera mount desk point work surfac projector displai object tabl drawback solut paper process digit desk lose main benefit paper term mobil exist applic base digit desktop metaphor augment version alic adventur digit physic medium visual annot identifi radio frequenc identif tag reader rfid tag enabl document individu page specif part page address combin technolog present electron field sensor locat book bind proxim reader hand control audio rfid tag page page identif paper separ document identifi page identifi identif page element singl page concept barcod idea rfid tag identifi document singl numer exist link singl object piec electron sound movi clip support link relat digit resourc back paper resourc focu project abil annot simpl sheet paper multimedia content server side simpl realiti simpl map posit singl specif digit resourc process request consist displai digit resourc approach digit augment paper enabl paper fulli incorpor digit inform space devic contrast exist project digit augment approach base dynam link logic element inform sourc link physic media kei achiev approach exploit concept term inform dynam link document gener integr platform implement exist data manag support client access context paper develop applic natur deal inform art world prototyp system base convent barcod test model carri initi user studi server develop gener simpl matter chang print wand technolog emerg reliabl form link bidirect enabl user move freeli back paper digit media mean combin featur paper excel readabl digit medium store lot current option access function addit gener link author develop automat link gener compon build dynam link addit explicitli author link gener base user monitor detect trail numer user acknowledg work report paper part european project paper disappear comput programm member project contribut feedback work refer hudson techniqu hyperlink real paper electron content acm chi confer human factor comput volum paper listen electron augment book acm chi confer human factor comput design robinson activ real paper interact electron text lectur note comput widom tsimmi integr heterogen inform sourc meet inform process societi intellig paper lectur note comput paper initi paper assess technic april print data graphic user interfac ieee march feder architectur inform manag acm transact inform page card bridg paper electron paper user interfac acm confer human factor comput find norri om lesson learn build object manag framework workshop java persist januari om provid storag access abstract framework intern confer inform system august meyer insight team environ link data acm chi confer human factor comput volum comput augment learn mackai augment link real virtual world acm avi confer advanc visual newman wellner desk support interact paper document acm confer human factor comput model classif structur evolut control intern confer conceptu model om support mobil work connect confer cooper inform paper sellen harper myth mit sheth larson feder system manag autonom acm comput page septemb norri java framework web engin workshop web engin conjunct intern world wide web hong mai augment audio notebook acm chi confer human factor comput volum harrison bridg physic virtual world electron tag acm chi confer human factor comput volum tag track object physic wellner interact paper digitaldesk commun juli wiederhold mediat architectur futur inform system ieee page
Agents/578 1 emot person effect util altern terrorist target select case studi michael barri phd system engin dept inst research cognit scienc center human model comput info scienc dept pa theori role emot model develop agent long unclear partial due instabl philosoph issu problem psychologist struggl build model partial due gap theori implement agent author paper describ effort emot model part deep model util theoret agent creation simul forc capabl balanc great deal compet realist manner introduct broad research goal concern demonstr exist human behavior model framework effect deploi agent process import goal illustr model systemat captur portrai individu differ social intellig agent agent creat systemat reflect contextu relev emot affect make behavior militari train research issu manifest desir dial oppon group republican bin idea human ration actor cloud emot western thought artifici intellig research concentr primarili aspect reason problem make good difficult introduc emot equat make perform agent recent theori suggest emot vital part decisionmak process manag influenc great deal compet motiv integr emot model agent yield realist behavior provid deep model util agent delic threat elimin versu believ peopl begin model model emot varieti tool psycholog class model cognit theori includ model lazaru roseman collin input set thing agent concern effect determin emot result occ model separ concern goal state standard peopl prefer evalu current state mixtur emot result kei idea theori emot valenc identifi desir undesir impli relationship util function drive theori confirm effect agent intens variabl import previou effort realiz probabl import import extent extent tabl intens factor goal output made theori algorithm creat util function combin emot intens singl number repres desir action detail individu extrem shame avoid action lead goal success moral util strategi score game paper describ partial implement system repres occ model gener emot scenario involv plan terrorist bomb mission emot outcom terrorist mission import rare attack design forc forc mind emot impact enemi gener make mission worth occ model mention occ model divid concern agent prefer goal goal activ agent directli plan make happen reload interest state world agent realiti gener import replenish period spawn activ goal base time fulfil activ goal activ goal state world agent engag attempt bring direct manipul environ typic manifest individu step tightli integr planner demonstr gratch activ goal succe condit evalu fail negat precondit confirm true import activ goal model proport number accept altern mean accomplish step plan interest goal interest goal differ slightli gener agent direct action accomplish import game theoret import interest goal agent action oppon clear interest goal held reason implement static part goal hierarchi import valu set agent author complex social psycholog process involv creation mainten interest justic scope current articl order determin intens emot pertain success failur occ model variabl depend context situat variabl depend event event happen agent tabl show intens variabl permut variabl clear comput system implement date track tempor proxim goal variabl pertain agent feel consid relationship discuss effort realiz left futur research replenish goal replenish goal essenti recur activ goal success failur function long fulfil time fulfil consid time consid unaffect amount time consid fail emot occ unanticip confirm goal success failur gener joi anticip goal effect state gener hope fear confirm hope fear turn satisfact disconfirm state fear hope relief lack evalu goal goal success gener goal failur gener depend agent question dislik agent experienc emot standard standard unlik interest goal passiv natur repres peopl trigger relev relev affect read account ancient warfar practic threaten care tangibl differ greatli accept emot standard occ model term action attribut pride shame result attribut extern turn admir intens emot effect primari factor judg implement result function effect standard strength cognit unit emot agent agent perform action determin shame action person case feel emot action individu strictli action intens factor involv deviat expect captur idea gener develop intens feel thing expect peopl system place manag role develop belief concern intens factor implement prefer prefer track dislik agent typic pertain object dislik import militari scenario note view agent object side effect make subject agent feel emot agent shame felt needless harm person emot emot result effect prefer varieti occ dislik emot intens factor object consid appeal model function familiar object breed tendenc express prefer intens amplifi intens intens dislik prefer collect refer arrang parent node motiv children goal write paper children find open word type concern fulfil condit thwart indic satisfi import valu indic success failur directli success failur parent import valu rang indic child parent indic child irrelev parent find topic critic write give failur import find topic small part finish entir give substanti smaller success import figur show graphic number slash success number slash failur import figur hierarch goal structur fulfil thwart condit express predic logic function relat defin arbitrari python code draw agent knowledg world logic statement quantifi variabl indic agent perform action direct object action goal list time interv statement believ true return confid valu variabl bind piec inform convei concern effect past effect confid agent affect event structur inform close resembl convei frame elliot function predic simpl tabl lookup valu set scenario design attach complet agent draw current belief agent number import issu hidden assign determin probabl tempor proxim futur event relationship import function emot regul behavior social situat agent repres agent occ model paramet involv agent feel depend type emot gener pair agent defin dislik form cognit unit familiar addit paramet ad implement determin intens view view object calcul intens agent evalu agent success failur multipli import valu hierarchi concern determin equat root outcom concern success outcom io import parent equat intens factor discuss determin intens specif emot equat appendix link emot util model consist relianc set agent part give advic determin concern fulli develop agent highest work point basic motiv physiolog safeti social person reject serial work empir shown descript individu ag rich sourc prefer term creat reusabl model emot rich hierarchi standard prefer type agent good rich hierarchi terrorist found weaver silverman work show hierarchi case differ terrorist organ show hierarchi group function polit campaign mission oper lower concern vari wide individu develop complet model agent care probe deeper model person individu significantli effect prefer agent hold terrorist group tend differ soldier care model differ effect terrorist cell tend drive consensu isol belong note describ group peopl extens languag author directli translat descript common differ group hope deriv reusabl provid agent author templat instanti member organ account effect dimens individu differ similar emot peopl pleasur tremend endur great pain goal fail order standard chosen repres observ account person trait person individu emot open experi dimens implement score act weight emot combin util term refer agent proactiv achiev goal individu strongli exhibit trait advanc goal paramount potenti fail standard neg emot outcom individu opportun wade raw chanc enemi trait weight import factor taxonomi agreeabl agreeabl individu strongli concern goal suppress satisfi agent domin trait instinct follow order trait weight contribut util resent trait big measur agent full ramif action strongli exhibit trait avoid action lead neg accompani substanti posit agent action consid opportun achiev goal success trait weight fourth factor emot govern agent endur pain path goal achiev stabl moral object impress significantli posit effect thing term weight import ad util imagin successor state open experi captur observ agent explor action proven provid accomplish paramet act neg weight intens emot gener action full model concern emot model combin event creat person combin singl number order util wealth theori algorithm exist equat convert emot intens util pa pc pc joi distress pride pe equat satisfact rmed shame resent successor admir disappoint ment dislik util action pm person dimens open emot maximum intens emot concern effect time perceiv probabl outcom occur implement system determin action step emot stabil term effect scenario illustr process problem mission plan execut point share common enemi terrorist share common set motiv religi conflict interest enemi terrorist believ conflict terrorist hold standard terrorist share basic goal driven commit act terror base differ polit religion terrorist strike regim present framework gener util structur terrorist util structur import mission target oper effect popul import terrorist carefulli action effect relationship surround popul action mean enemi unaffect terrorist concern potenti outcom aggreg agent repres gener terrorist hold goal succe extent posit fail neg affect conflict essenti game terrorist game theori model process al framework meant offlin gener structur differ group individu explain dynam framework structur process emot person differ simplifi assum terrorist share score person trait target select process terrorist awar potenti sport religi govern militari relev goal standard terrorist shown figur figur goal terrorist figur standard terrorist select terrorist examin util attack begin bank posit highli secur success mission gain public organ addit impact infrastructur current regim terrorist moral object feel pride successfulli strike target action end undesir situat due high goal avoid turn secur entir organ threaten determin popular opinion posit neg evalu emot outcom situat terrorist believ concern gener goal standard shown figur mixtur distress goal popular opinion threaten target bank potenti creat high level joi distress caught lose crowd lower level pride equal weight person combin equat produc util partial show contribut made util potenti emot gener attack secur shown tabl emot intens prob partial distress joi tabl high probabl failur goal substanti lower util altern agent figur view goal figur view standard similar process undergon determin util shown tabl note import religion attack religi landmark consid attract term goal achiev unlik terrorist terrorist standard indic unaccept behavior chosen repres process game determin util terrorist action enemi success attack target attract creat opportun enemi elimin organ turn absenc opportun directli achiev put enemi situat util bank time point view regim goal standard shown partial figur target util terrorist primari ns bank secur threat reaction arena reaction public govern build secur threat religi landmark reaction militari secur threat tabl figur enemi goal figur enemi standard enemi love terrorist target bank secur measur number goal success highli threat demonstr secur interest turn secur valuabl support success territori gener util action enemi extrem make attract terrorist origin estim similar process undergon result shown tabl note due import religi institut lack util build target extrem low enemi highli attract target select terrorist target util enemi primari contribut bank terrorist reaction posit press arena shame reaction govern build terrorist pride posit press religi landmark reaction shame militari terrorist pride tabl turn process terrorist goal util target except unchang due strict object destroi religi religion violent amount shame induc select lower util terrorist terrorist sport arena figur terrorist standard terrorist motiv substanti concern primari motiv target involv commerc begin higher import valu attach success goal structur gener higher potenti joi terrorist resourc success bomb high secur area highli undesir caught terrorist face sport arena cite symbol center commerc addit vulner step paper explain framework integr cognit person theori agent framework base occ model gener emot state unabl provid agent guidanc contribut provid extend cognit occ mechan altern action mathemat occ emot principl person factor util calcul equat agent object precipit util base emot intens person weight util turn determin option classic approach reduc emot person util calcul comput advanc agent allevi number valid concern concern earlier valid occ model choic ignor nuanc subtleti emot person reaction lack empir support factor big model mention assert valid concern partial mitig higher granular model address explicitli address concern mont carlo simul cover variat expect finegrain level attempt approach system design integr larger agent model number import featur handl simpli placehold deeper function offer complet model probabl assess assign primari involv effort integr system part larger agent model repres dynam natur activ goal relationship interest replenish benefici tightli integr decisionmak process feed result back goal structur make model begin implement cope mechan lazaru explicitli model emot decai function agent forc make account emot outcom solv problem terrorist run gasolin drive choic elimin distress potenti joi mission accomplish attain action find ga station result persist distress shame event emot elimin plan make stop model lazaru term model shift import valu concern structur effect concern stop emot straightforward approach yield power method creat agent concern chang experi agent thing agent complet knowledg concern structur dramat effect model peopl acquir inform implement primarili recognit involv raw data histori action emot reaction attempt assembl model motiv action relationship static determin ad hoc fashion deriv paramet directli evalu concern agent believ concern goal compat correl individu goal effect exact event contribut substanti cognit unit parti familiar simpli extent believ model complet deriv paramet belief agent obtain dynam evolv relationship framework lend natur explor implement thought naturalist potenti comput time appendix intens equat resent hope fear relief joi pride shame anger rl rl satisfact rmed disappoint ment distress admir gratitud dislik previou fear ion rf previou hope previou previou fear hope time interv question begin prospect base emot goal sg fg fail ss fs fail sp fp fail ro cognit object relationship function determin probabl success failur question function refer human behavior model synthet agent descart emot human affect process model emot doctor northwestern evanston interplai emot emot oxford motiv harper gerald clore allan cognit structur cambridg william person project martin paul test theori discret simul terrorist
DB/579 3 phd kang depart comput scienc virginia decemb introduct recent demand servic explod applic requir servic includ sensor data web inform onlin smart space applic inform system global due fast growth internet import wide perform predict system core compon global inform system limit compar system oper system easili replic due consist problem system low predict compar system due data depend transact data resourc dynam page transact abort result rollback restart limit perform system main servic bottleneck upcom global inform infrastructur previou research work shown approach improv system scalabl research scarc possibl due inher complex address scalabl system present qo model perform metric applic system base qo develop qo manag techniqu focu fundament requir success realtim transact data fresh success user requir time transact process base fresh data requir conflict frequent transact due high updat workload transact read stale transact schedul prefer manner updat effect qo dynam balanc transact updat workload base current system behavior meet fresh requir challeng research issu unpredict workload tight fresh requir sensor data updat polici dynam adapt current transact workload data fresh time transact manag deriv deriv multipl sensor data possibl chang high import problem comput cost maintain deriv data fresh differenti deriv data fresh popular import deriv data improv system transact differenti transact differenti servic class overload appli feedback control theori provid systemat qo manag predict servic feedback control target perform converg dynam adjust system behavior base perform error measur feedback loop approach effect workload difficult model predict systemat qo expect improv servic avail system due scalabl servic avail core issu feasibl global inform larg bodi user concurr servic kei servic requir transact data fresh met manner expect contribut system consist qo qo adapt servic differenti improv servic enhanc note fast servic necessarili predict servic system exist proof applic feedback control theori qo manag practic impact research import perform predict servic upcom inform era rest organ section discuss qo model transact data type qo perform metric section discuss adapt updat polici manag transient overload dynam adapt updat transact improv affect user perceiv data fresh section servic differenti term deriv data fresh transact section describ perform evalu issu section describ relat work section conclud give expect contribut research agenda qo model qo model basic featur data tempor consist transact type introduc appli model describ qo perform metric qo specif scheme express data transact model firm tardi transact transact miss deadlin add abort data classifi static continu static data continu data object chang continu reflect real world current aircraft stock focu fresh issu continu data continu data object timestamp latest updat address consist issu actual state reflect tempor consist defin valid interv subdivid compon ffl absolut valid interv defin state reflect data object consid tempor inconsist stale time absolut valid interv data object absolut valid interv length time continu data object remain fresh tempor consist ffl rel valid interv defin data deriv data data object deriv data set fx tempor consist arbitrari data object meet absolut consist rel valid interv continu data classifi base data deriv data deriv data object deriv possibl multipl base data current aircraft posit deriv multipl sensor read composit index deriv stock price base data import view environ directli absolut valid interv deriv data object absolut rel valid interv continu data updat period period updat occur period aperiod updat predict system occur data assum avail global clock chang sake focu period updat continu data period updat common sensor read aperiod updat model sporad stock price updat model sporad base highest updat frequenc peak valid interv stock item stock price mark stale updat arriv valid interv valid interv extend period renew timestamp current time transact consist kind ffl updat base data object updat period reflect current statu environ updat transact transact special design call updat ffl deriv data recomput remain tempor deriv data recomput base data recomput transact includ multipl base data read oper write oper call recomput ffl user transact submit deadlin user transact includ transact transact note user transact write continu data object user transact call transact short remaind user transact deadlin deadlin updat set updat period outdat updat recomput instal abort updat stream reflect initi schedul issu section term differenti transact admiss simpl effect newli arriv transact admit request server util estim avail examin aggreg util estim admit transact initi focu main memori model reduc unpredict due main memori cpu system resourc main provid disk resid emploi concurr emploi free prioriti low prioriti transact abort restart qo model simpl express qo model essenti effect qo manag express qo describ perform metric qo introduc qo specif scheme perform metric qo model includ perform ffl transact qo user target deadlin miss toler meet miss ratio qo contract admit transact ffl data time semant data crucial correct make incorrect lead catastroph result loss profit exampl includ aircraft navig system onlin stock trade categor data fresh fresh condit fresh fresh impli fresh ratio fresh data entir data condit fresh measur fresh access data access transact deadlin met time time transact add firm model contrast condit fresh measur segment access time transact note condit fresh qo contract support condit fresh manag fresh intern fresh trade improv long condit fresh support ffl differenti qo rel time servic class rel time premium basic class enforc explicit distanc servic level class perform differenti proport import servic class perform studi rel servic differenti achiev unpredict workload ffl differenti fresh deriv maintain deriv data object recomput relat base data recomput deriv data compar base data updat includ arithmet logic comput multipl base updat frequent deriv data object recomput base data chang studi qo adapt techniqu differenti servic scheme deriv data manag qo specif provid gener qo offer simpl power qo specif applic relat qo paramet requir perform base semant provid soft perform enforc perform isol servic differenti servic requir specif applic differenti servic requir differenti servic desir qo express fair servic fr fr ffl mr desir transact term deadlin miss ratio ffl fr base desir condit fresh base data ffl fr deriv desir condit fresh deriv data fair specifi desir miss ratio desir condit fresh data differenti servic desir qo differenti servic num diff ffl metric perform metric differenti rel transact deriv data fresh ffl num class specifi number servic class ffl diff specifi servic differenti differenti requir differenti class term rel miss ratio adapt updat polici discuss feedback control schedul qo adapt scheme enhanc overload focu base data fresh issu fresh manag issu deriv data cover section approach provid fresh abund research scarc explicitli provid fresh defin model quantifi util updat specif base data object qo adapt techniqu deriv provid grace qualiti degrad overload enhanc gener updat polici adjust base current workload system behavior claim updat polici dynam adapt effici balanc updat transact workload feedback control model challeng research problem provid transact aperiod arriv unpredict manner transact execut time unknown priori workload model perform metric transact data fresh success servic block due data content wast cpu util due potenti transact abort restart complic control design extend gener feedback control schedul framework support qo manag emploi control loop miss ratio cpu util manag avoid control satur util control satur util miss ratio control satur system underutil ratio control loop gener control signal achiev target util miss ratio base current perform differ target miss ratio measur miss ratio control comput control call request cpu util adjust du achiev target miss ratio target qo manag emploi enforc util adjust du neg system qo degrad reduc request cpu util vice versa qo manag scheme realtim base provid soft data fresh block diagram feedback control system architectur depict figur investig refin control model control effect block wast cpu util fresh compet system control model design complex fresh control ignor compet cpu util enhanc perform metric selfish manner end unstabl control simpl power fresh control logic collabor improv overload fresh control logic improv miss ratio fresh data low updat updat lazi manner overload updat util reflect inform deriv model kei idea util control target util error du measur util control loop target miss ratio miss ratio control measur miss ratio error du miss ratio control loop transact transact figur system architectur qo adapt reduc number util remain cpu util improv overload achiev adapt updat polici note adapt sever affect user perceiv fresh success servic risk maintain user perceiv adapt scheme target condit fresh qo time transact fresh access data qo control deni qo requir cpu target condit fresh violat mechan prevent potenti degrad user perceiv fresh commit transact model updat updat workload continu data trivial modern aircraft includ hundr sensor updat high rate stock quot updat stream reach peak time updat receiv higher time left finish transact time transact schedul prefer read stale data balanc updat transact workload econom model introduc estim updat util cost defin updat frequenc continu data object frequent higher cost attribut system assum frequenc period updat system access frequenc measur data object data object access updat object produc high effect quantifi defin access updat ratio arbitrari data object access frequenc frequenc notion interest featur guidelin decid proper updat polici data object pictori descript figur snapshot data object order data object horizont line effect data updat worth access frequent updat call data data horizont line hot data max snapshot cold data min figur snapshot sort access updat ratio reason updat hot data aggress manner hot data object potenti multitud transact miss deadlin wait forc read stale data meet desir updat cold data aggress overload transact miss deadlin wait possibl read stale version finish time cold save cpu util appli lazi updat polici overload cold data updat lazi updat polici current system load approach time access transact demand polici aggress lazi updat polici assum updat arriv instal period miss updat updat immedi data object regard fresh access fresh cold data low transact wait updat read stale version meet transact deadlin note notion depend specif access pattern popular model deriv simpli updat frequenc monitor access frequenc greatli simplifi qo model make model robust potenti unpredict data access pattern refin techniqu endeavor robust result qo adapt dynam updat polici adapt dynam adapt updat polici formal give pictori dynam updat polici adapt base model figur repres set base data imm set data updat od stand set data updat demand data object updat immedi demand imm od imm od data updat immedi load larger fraction cold data object updat demand figur updat polici degrad stop reach degrad defin figur revisit detail explan adapt polici section adapt heurist consist main procedur degrad upgrad procedur descript main procedur tabl main statist collect comput data object access access counter initi sampl period access frequenc larg deviat sampl period smooth potenti larg move averag imm imm od imm od initi state moder load state overload state figur updat polici adapt tabl main procedur updat polici adapt collect access static comput monitor deadlin miss cpu condit fresh call degrad measur miss ratio target miss ratio cpu underutil measur condit fresh target condit call upgrad procedur upgrad long du inform admiss control newli adjust cpu util du sampl access closer recent access frequenc consid comput move averag vice versa updat frequenc sampl period period updat comput access updat ratio observ model limit period updat updat frequenc monitor smooth access frequenc handl aperiod updat aperiod updat definit data fresh explicit notion valid interv relat aperiod updat continu data object consid stale arriv appli model directli applic aperiod updat focu period updat sake simplic lose gener current miss ratio target miss updat polici degrad procedur call base cpu load adjust du neg degrad procedur updat polici chang reduc number updat cpu util data object imm imm note qo adapt perform admiss control approach variat incom workload settl time reach steadi reduc transient workload chang import question estim cpu util save degrad main interest differ requir cpu util pure updat adapt updat number save updat due degrad averag cpu util singl updat su save cpu util updat polici degrad du su averag updat su servic measur run time approach introduc updat transact priori fix updat polici degrad singl data cpu util adjust du du degrad continu data object imm du degrad bound reach horizont line figur figur updat polici degrad limit degrad rang degrad past degrad bound meaningless due reason hot data object updat number updat transact suffer potenti delai updat reduc data fresh updat polici degrad shown figur updat perform immedi updat polici gradual degrad load degrad stop adapt violat condit fresh reach degrad bound updat polici upgrad data object ensur time transact access fresh condit fresh upgrad occur cpu du measur condit fresh target fresh similar approach degrad iter upgrad updat polici du reach extra cpu requir updat subtract initi du upgrad updat polici target fresh extra cpu util upgrad du question target fresh met sampl period upgrad immedi updat data object regard fresh discuss fresh control problem simplifi clear demand updat fail provid condit fresh current sampl data updat immedi sampl period target condit fresh target current condit fresh current measur sampl period perform error term condit fresh sampl period error ae current target target current current target fresh improv approxim proport number data move od imm achiev requir enhanc condit fresh move od imm number data highest od control upgrad systemat set updat polici upgrad bound term number data upgrad upgrad bound jd imm jd imm error jd od imm set data updat immedi sampl period upgrad move data object od imm number updat cpu util potenti number updat approxim eq estim requir extra cpu util eq continu move data stop upgrad stop fresh improv expect achiev move number data comput eq cpu util du qo level term fresh dynam adjust base current miss condit fresh due unpredict workload access qo adapt approach target perform converg continu adjust qo level base perform error feedback loop balanc updat transact workload target transact achiev feedback control model provid condit fresh manag deriv data fresh base data deriv data treat wai respect fresh mainten cost deriv data recomput includ complex logic arithmet recomput occur frequent accept recomput deriv data base data chang system underutil reduc recomput workload qo adapt batch deriv data recomput workload differenti servic mechan perform improv adapt batch deriv data recomput qo appli notion forc delai batch deriv data recomput delai reduc number recomput recomput composit index delai period time relat stock price chang multipl time simul studi show perform improv appli forc delai show determin length delai reduc comput deriv data recomput demand disadvantag approach access transact toler long time due demand recomput qo manag fresh deriv data gradual degrad forc delai provid altern deriv data fresh qo adapt differenti servic forc delai gradual data overload situat continu system deriv data recomput immedi load recomput delai amount delai qo degrad forc delai averag time shorter delai forc delai specif deriv data object longer averag time consecut access sampl period deriv tabl degrad procedur deriv data recomput polici forc delai fd dt fd cold deriv data object updat demand stop degrad comput estim cpu util du cpu load adjust du du du stop degrad step deriv measur smooth access frequenc deriv data object similar defin base data item section delai recomput polici demand cold data object data object forc delai simpli hot data object recomput demand similar reason discuss previou section limit forc delai averag soft provid condit fresh deriv data deriv data access recomput demand recomput polici degrad procedur briefli tabl main procedur initi upgrad invok includ due limit space conceptu similar section differenti servic deriv data recomput high cost deriv data perform improv differenti servic aircraft posit data sensor data chang classifi friend foe avion applic requir higher fresh enemi aircraft posit due critic complex air combat scenario fresh aircraft posit data differenti vicin onlin stock trade server differenti fresh composit index class popular captur popular recomput frequenc deriv data model earlier extend extens straightforward gener model differenti length forc delai deriv data class qo adapt algorithm tabl extend support differenti servic forc delai cold data class qo contract save cpu util expect hot data recomput delai dt procedur iter estim cpu util save handl current overload fresh scalabl servic improv improv cost deriv data recomput note control model support differenti servic term deriv data fresh achiev extend qo manag model differenti transact transact differenti class queri time differenti class frequent overload differenti servic provid term rel transact deadlin miss ratio premium basic class investig control model control differenti investig effect block wast util perform predict control design extend high level semant proport share cpu schedul algorithm pure proport share schedul perform provid admiss share cpu arbitrarili low rel miss ratio achiev simpli alloc cpu util fix proport class workload fluctuat unpredict admiss control emploi provid perform futur feedback control approach achiev rel servic differenti dynam adjust cpu share feedback loop share control error transact target rel miss ratio measur rel miss ratio figur feedback control loop differenti feedback control schedul architectur consist control util control loop cpu share control loop achiev high util rel miss ratio qo contract architectur shown figur util control loop similar figur util control loop activ underutil differenti overload share control loop system scalabl improv avoid potenti underutil cpu util alloc servic averag deadlin miss ratio improv class class workload requir cpu util achiev target perform priori feedback control dynam adjust alloc cpu util base differ target perform measur perform term rel miss ratio class rel miss ratio target rel miss ratio measur miss ratio servic measur rel miss ratio rm eq eq perform error sampl period error rm feedback cpu util share premium basic dynam adjust base current perform error achiev desir servic differenti term rel miss ratio perform evalu testb evalu perform part research test simul realist experi testb assum central model run singl processor simul approach improv perform servic avail term miss ratio throughput overload provid fresh evalu qo simul studi perform substanti feasibl hypothesi control theoret approach qo manag simul insight perform model compar model unawar qo experi perform simul studi ffl experi simplist baselin model admiss control section turn compar rel perform gain provid admiss control scheme deadlin miss throughput compar measur perform improv ffl experi baselin feedback control schedul framework qo manag data updat immedi perform compar fair servic model differenti servic emploi qo adapt scheme ffl experi differenti servic model compar fair servic model experi consist fresh differenti model perform differenti servic model compar perform feedback control system studi transient metric overshoot settl realist applic testb evalu simul shed light semant perform implement potenti improv qo model simul studi limit synthet applic real world applic suffici evalu plan implement model actual system realist applic interest test emul web server back servic stock quot qo specif requir qo provid predict servic manner system perform evalu determin qo provid realist workload trace stock price monitor web dai model actual updat continu client request emul web workload gener surg candid realtim develop virginia access sourc code develop experi open sourc popular web applic support sql queri featur note implement realist experi includ enorm implement effort due inher complex system address implement altern web server extend facilit simpl function continu stock cach materi view web possibl share memori web server web server measur updat util inform updat polici continu data object stock quot extend web server gener answer queri materi stock price base client portfolio task handl provid durabl updat materi view expect approach reduc implement effort perform studi feasibl relat work notion qo studi wide appli comput system numer qo architectur exampl refer adapt qo gener assum user toler qualiti fluctuat switch multipl servic level system gracefulli degrad qualiti level transient overload resourc alloc optim adapt resourc alloc algorithm multimedia qo adapt techniqu studi depth admiss control schedul algorithm provid servic premium class web multimedia server servic differenti architectur web server found abund qo work scarc system prioriti adapt queri resourc schedul provid differenti queri process environ observ perform queri vari significantli depend queri time differenti memori manag schedul queri read operand relat produc result immedi memori temporari file save intermedi queri process slow queri deadlin miss ratio differenti class perform easili fluctuat workload data fresh issu consid stanford inform processor address problem balanc fresh transact data maintain fresh correctli reflect statu transact process time manner studi fresh schedul algorithm introduc schedul updat perform compar similar problem studi deriv data ahm al approach tempor consist deriv data updat deriv data object explicitli time trigger system time constraint met simul rel perform improv shown compar forc delai scheme strip main focu approach problem data fresh transact provid qualiti adapt differenti servic systemat qo manag correct answer queri trade enhanc queri provid approxim answer depend avail data time comput techniqu call mileston approach appli approxim mileston accuraci intermedi result monoton comput progress correct answer queri monoton queri process progress relat system call produc approxim answer queri deadlin approxim answer provid process segment correct answer improv data process begin data determin segment process finish time enhanc relax consist epsilon serializ queri process concurr updat deviat answer queri similar approach call quasi serializ adapt secur manag secur level temporarili degrad enhanc perform scheme lack systemat qo manag architectur servic differenti schedul control earliest deadlin present adjust qualiti level admiss control base continu support soft time accur workload model feedback miss ratio measur compar target miss system behavior adjust base error control loop ad monitor current cpu util improv perform good introduct feedback control schedul design period task transact arriv aperiod system gener feedback control schedul present expand previou work provid soft perform term miss ratio mix period aperiod task approach extend qo manag system block wast cpu util address hit ratio web proxi cach differenti proport import web content class achiev rel hit ratio content class text class cach space alloc dynam adjust feedback loop feedback control theori appli apach web server achiev rel delai servic class dynam connect schedul process realloc class cpu util dynam adjust achiev rel miss ratio approach differenti servic architectur specif design qo manag system deal cpu util expect contribut research agenda expect contribut demand inform servic rise applic agil onlin mobil smart space due fast growth inform servic global explod perform core system compon global inform limit due difficulti replic inher unpredict system perform bottleneck global inform infrastructur upcom inform ag reduc potenti system call support predict servic term soft miss ratio condit qo differenti servic current qo research integr enhanc enabl servic scalabl system improv impact dramat import critic perform upcom global inform era scalabl import issu determin feasibl global inform high servic demand expect data fresh core issu satisfactori user fresh data process time expect contribut summar ffl notion predict servic predict impli gener predict term insuffici defin satisfactori servic address extend notion includ data fresh provid soft fresh ffl control model systemat qo manag effect block wast util handl effect systemat qo manag framework provid unpredict workload util qo due robust feedback control expect contribut rel scarc relat research ffl qo adapt differenti servic qo adapt differenti servic techniqu provid adapt updat polici provid manag fresh base data qo manag scheme provid manag deriv data fresh transact ffl improv transient overload improv due approach scalabl system similar reason perform predict problem system partial allevi global inform infrastructur research agenda due limit briefli describ kei research issu research ffl qo issu consid find fundament factor directli affect servic qualiti transact data fresh consid qo paramet miss ratio condit fresh consid perform metric measur success servic ffl feedback control model qo manag studi effect block wast util chang system dynam feedback control model effect disturb ffl qo adapt techniqu develop qo paramet perform metric techniqu characterist effici manner maxim benefit main focu improv overload sever affect user perceiv data fresh ffl differenti servic scheme consid improv scalabl system interest research issu studi perform improv fresh manag scheme deriv data potenti impact user perceiv deriv data fresh ffl real world applic consid show applic relat applic studi discuss fundament research implement issu base qo model improv testb construct realist experi research present approxim complet part research timelin base current plan futur refin specif research issu interest rise ffl case studi perform verifi feasibl approach studi includ simul studi analyz perform improv due qo adapt techniqu exist control model extend support qo adapt realtim control model investig block wast util problem system ffl feedback control model extend support differenti transact class extend simul support differenti servic term deriv data fresh transact detail simul studi perform evalu perform improv due differenti servic research implement issu investig ffl implement perform realist experi base qo manag scheme design implement realist applic testb experi show robust unpredict workload ffl thesi written revisit research issu result studi experi insight research coher manner includ result refer abbott schedul perform evalu acm transact shin qo negoti system applic autom flight control technolog applic june shin architectur commun technolog applic june shin adapt content deliveri web server qo workshop qualiti june shin qo provis web multimedia servic system decemb kao appli updat stream soft system support effici maintain deriv data ahm trigger updat tempor consist system cao provid differenti level servic web content host workshop internet server june crovella gener repres web workload network server perform evalu perform sigmetr friedrich web server support tire servic ieee septemb qualiti servic architectur acm comput commun april lawrenc model applic adapt resourc manag ieee system engin august moss framework experi qo multimedia servic intern confer multimedia comput bradlei system track retriev data vldb du elmagarmid quasi correct criterion global concurr control proc intern conf larg data heidemann differenti servic web servic world wide web march moss framework versatil network architectur support commun perform ieee liu qo model manag architectur ieee workshop middlewar distribut system decemb middlewar qo resourc manag ieee workshop distribut system decemb kim son support predict system technolog applic page june adapt qualiti servic architectur distribut multimedia applic phd lee qualiti servic manag phd carnegi mellon liu util partial comput system system decemb perform specif metric adapt system system novemb son design evalu feedback control algorithm system decemb son feedback control model algorithm technic report comput scienc depart differenti cach approach intern confer distribut comput april lam implement evalu schedul multimedia applic acm symposium oper system st octob ozsoyoglu hou research queri process workshop oper system livni multiclass queri schedul system ieee transact knowledg data august oper system support multimedia system comput commun special issu iter distribut multimedia system telecommun pu replica control distribut asynchron approach acm sigmod intern confer manag ramamritham intern journal distribut parallel hansson adapt secur manag transact euromicro confer page june tao case feedback control schedul euromicro confer june stankov son architectur object model distribut journal comput system scienc juli hansson misconcept ieee june proport share resourc alloc algorithm system ieee system decemb queri processor produc monoton improv approxim answer phd illinoi lotteri flexibl proport share resourc manag phd massachusett institut schedul transact tempor exploit data semant system decemb
IR/580 5 learn conceptu user model user adapt meta web search martin muller institut semant inform process germani abstract project goal induc conceptu user model transpar queri refin inform filter domain www user model describ user interest respect underli ontolog manual user model edit process pose defin problem conceptu induct learn task research prototyp develop introduct user model machin learn user model repres assumpt user user model system infer user model user store user model induc assumpt reason model model system order adapt user model access user understand manual incorpor machin learn framework lead intertwin formal user model inform motiv algorithm filter process explain user content section motiv conceptu user model learn techniqu describ user model formal project section demonstr learn task carri model discuss approach provid short summari includ overview relat project give formal overview interest user model ontolog refin process technic truncat respect limit space adapt inform retriev web effici user model recommend system build recommend system project tackl problem person document filter vector repres user interest impli intertwin inform resourc web document user model vector repres user explicitli describ user interest vector base method perform pretti explain outcom approach approach explicitli repres user interest lucid user user mainten discrimin domain depend aspect independ aspect core idea intellig meta search engin ffl user model conceptu descript concept hierarchi document content document type consist explicit user interest concept user interest ffl user queri refin respect user model order disambigu queri term begin ffl filter aggreg result respect ffl discrimin document type document categori obtain sort conceptu descript document classif queri refin achiev gener set queri initi search string keyword attach categori occur user model question document match user interest answer document document classif fit user user interest classifi document type categori user conceptu user describ document fit user user model subsum document classif section domain depend ontolog document classif user model descript classif respect conceptu descript effici retriev web techniqu demonstr ontobrok webkb aim larg knowledg base system describ content www similar techniqu reason hierarchi search queri phrase lectur note machin learn queri document type document type content categori effici interpret type sort obtain sort conceptu descript document type hierarchi exampl depict figur ontolog document content librari decim classif handcraft ontolog classif system provid exist classif algorithm simpl document type classifi develop master thesi choic depend pend project id descript public figur document class includ type student research articl concentr user abstract system process work partial handcraft ontolog test phase conceptu user model ontolog concept describ document user model inform user interest repres set express inform user model differ shade part figur visual explain user user model manual user model edit process user chang model action concept figur shade document document document user interest user interest figur user model respect node correspond concept user interest slash node repres concept user interest interpret tree subsumpt lattic proper concept interest parent node impli interest child concept note interest distribut tree interest join meet proper concept hierarchi greatest lower bound defin artifici set express repres aspect user interest concept descript order sort document type simpl interest aspect public complex express public machin learn user model note distribut interest aspect machin learn aspect underwat robot impli interest learn underwat learn underwat explicit repres user model aspect mutual hard feedback gener concept express classifi document categori weak definit interest includ document proven iff concept subsum express classif expand languag weigh class document deliv list pair ci probabl belong categori type system investig approach order sort induct logic program induc user model interpret set order sort horn predic defin subset defin figur repres aspect user interest interest machin user model cognit scienc user tutor system machin learn document type user interest person dive group submarin robot describ figur user interest dual aspect defin neg interest singl aspect interest neg label data user model induct section perform content base classif statist phrase cluster relev feedback suffici larg user model induct learn task induc user model conceptu user model pose defin learn task induct logic program techniqu learn user model set posit neg label sampl user aspect defin learn task set set document respect classif trivial user model set horn posit label order sort gener yield hypothesi concept child node relev feedback user interest categori neg label classifi correct hypothesi deliv call truncat oper upper bound type document sampl describ document classifi belong interest role document type gener step illustr aspect user model figur lead document type lub type mean class class join machin model explain paragraph refin concept hierarchi found learn categori concept machin model emerg bodi liter conjunct input repres intersect concept class canon defin fan oper logic class tutor system cognit scienc tutor system cognit scienc guid user feedback class definit consid newli invent categori defin machin model concept definit defin aspect grow number user categori hierarchi user model label sampl kei sudden growth concept classifi distribut document uniformli classif tree imagin user model aspect user case rise label data exampl disjoint union build group model collabor label discuss issu paragraph label data set equal set mutual learn task order learn concept feedback gener obtain relev feedback crucial drawback www www search applic user provid partial feedback deliv search result techniqu order receiv label train slider interfac order receiv hidden explicit feedback search result provid small amount make sophist method gener label data case turn interest check label data ev vice versa paragraph standard bootstrap method obtain initi feedback data scan user homepag collect user registr form rough pictur learn user focu aspect aspect gener set addit neg exampl account posit exampl disjoint aspect user techniqu yield strong neg bia order number posit make user exampl collabor filter set posit exampl exampl label user interest exampl extract label data user coincid neg exampl interpret posit learn user turn dual posit label exampl interpret neg feedback vice versa construct sequenc enlarg label data set prospect machin learn base approach user model web search domain user model transpar inform filter process lucid manual user model adapt user ilp prototyp tool learn motiv user model profit method drawn borderlin discrimin classif task user model interfac consist conceptu descript break intertwin reveal drawback perform search respect user classif user model depend induc user model depend classif perfect classifi induct concept perfect learn perfect classifi time concept invent futur evalu work violat assumpt result practic open question current work approach present rise interest open research exampl relat initi concept hierarchi order induc suffici user reason condit defin user model sampl introduc section reason condit defin larg complet introduc section question focu current work futur work prospect detail descript system architectur found depend pend project classifi implement user model modul small handcraft prototyp evalu answer question mention refer interfac learn user profil implicit feedback workshop recommend system juli learn probabilist user model user sixth intern ed springer wien workshop paper learn extract symbol knowledg world wide web proc nat conf artifici intellig aaai make www banff knowledg acquisit workshop cluster url pathnam und universitat pp tour guid world wide web ijcai learn document categori descript extract semant phrase proc workshop data engin induct learn ein der resolut auf zum lernen morik der universitat fachbereich informatik intellig architectur inform retriev internet tech institut semant inform univ user model gi workshop und isbn machin learn base user model www search proc int conf user model workshop paper learn user syskil identifi interest web site proc nation confer artifici intellig
Agents/581 1 linda meet mobil gian pietro ami roman dept comput washington campu box brook drive st mo usa abstract lime system design assist rapid develop depend mobil applic wire ad hoc network mobil agent resid mobil host commun place transient share tupl space distribut mobil host decoupl style comput linda model extend mobil environ applic agent host perceiv movement sudden chang context set tupl access agent resid host alter transpar connect pattern mobil host paper present kei design concept lime system introduct todai user demand ubiquit network access independ physic locat style refer mobil enabl rapid advanc wireless commun technolog network scenario enabl mobil comput rang roughli extrem avail fix network facil exploit mobil case mobil ip fix network absent network facil implement reli mobil assumpt made research ad hoc network characterist wireless commun limit bandwidth frequent favor decoupl opportunist style comput comput decoupl expect proce presenc frequent event domain comput opportunist exploit connect peculiar style comput demand approach craft distribut applic alongsid form physic host roam physic space modifi topolog research pai attent form logic mobil refer code mobil entiti migrat code run move code reloc expect offer advantag tradit import enhanc reduc network traffic flexibl customiz provid abil send server portion code vice versa opportun reduct network traffic result possibl minim number interact place network paper present system call lime mobil applic design implementor minimalist set construct deal physic logic mobil physic mobil involv movement mobil laptop pda logic mobil concern movement mobil process migrat host preserv code state underli assumpt work mobil host mobil agent regard instanc gener concept mobil coordin place transient share tupl space access basic set linda primit coordin achiev tupl space global share compon independ actual access tupl space withdraw tupl inform model spatial tempor decoupl compon time commun resid distribut system decoupl linda model natur choic system lime retain basic philosophi goal linda adapt mobil simpl rapid applic develop facilit mechan made parallel program linda attract implementor program varieti view world sea tupl access content logic result implicit tupl space access individu compon applic manag movement tupl space restructur connect formal semant definit lime subject companion paper reli mobil uniti extens uniti notat logic misra concept fundament deal mobil remaind paper structur section review linda section motiv lime design philosophi section present set coordin primit support transient share tupl reactiv fundament concept underli lime section highlight technic challeng involv implement lime outlin sampl applic scenario section summar research contribut highlight direct futur work linda linda begin past decad model commun concurr process fundament abstract provid process share tupl space act repositori elementari data tupl tupl list type actual inform commun tupl space multiset tupl access concurr process tupl ad tupl space perform oper tupl subsequ oper tupl space updat tupl space perform atom tupl remov tupl space execut tupl remov place pattern match tupl content argument call field actual formal actual paramet previou tupl paramet formal formal match actual select tupl tupl space templat match tupl defin earlier formal match tupl templat ariti multipl tupl match return select subject fair constraint oper match tupl tupl space process perform suspend match tupl tupl read tupl space oper execut proce ident fact tupl match deliv process execut oper copi withdrawn tupl space similarli block linda implement typic includ eval oper dynam process creation enabl defer evalu tupl field commun linda decoupl time space decoupl time refer fact sender receiv commun order exchang inform tupl store tupl space retriev process produc tupl termin execut decoupl space refer fact tupl tupl space process node distribut actual locat tupl hidden tupl produc consum decoupl separ behavior individu process commun coordin action idea enjoi wide accept scientif commun rang econom artifici core interdisciplinari research area investig technolog methodolog coordin compon complex system decoupl compon coordin foster linda point contact distinct compon interconnect constitut core recent research softwar architectur chose linda model basi work due minim decoupl time space linda extens mobil environ linda coordin concurr execut compon access share tupl space global static creat maintain properti presenc physic mobil connect longer grant earli research distribut implement linda led problem assumpt disconnect unfortun emploi replic scheme tupl avail physic mobil disconnect forc explicitli save batteri power movement reduc commun cost cellular phone line make matter mobil host mobil complet independ control user form transient contact make unreason assumpt eventu deliveri data logic mobil complic implement distribut tupl space absenc physic mobil replic scheme reli local process longer process move freeli network idea global visibl tupl space unreason mobil demand weaker constraint tupl space dynam reconfigur content model underli mobil agent program travel mobil host compon system mobil host roam provid connect linda model adapt lime notion transient share tupl space ti physic logic mobil tupl space perman bound mobil agent mobil host transient share enabl dynam reconfigur content agent migrat connect variat high level mobil agent interact logic space provid singl host akin mobil host interact physic space span commun link transient share tupl space access primit provid singl coordin toolkit scenario distribut mobil complic implement result constrain lime primit physic mobil present transient share tupl space fundament abstract provid lime notion transient share tupl space summar figur lime mobil agent access interfac tupl space perman agent transfer movement occur inform mobil agent share access convent linda oper section semant unaffect actual content determin differ linda set transient share tupl space mobil agent figur transient share tupl space lime tupl access dynam recomput mobil content merg mobil agent mobil agent transient share tupl space present oper perform effect perform content transient share tupl agent perform tupl insert retriev agent tupl space access agent share construct transient content migrat agent action make content access agent transient share tupl space place reaction set agent arriv mobil transient share tupl space recomput account agent result made access agent sequenc oper call engag tupl perform singl atom transact similar hold departur mobil result disengag content remov atom transient share tupl space rule discuss agent multipl privat tupl subject share tupl space effect defin notion type tupl space case determin share rule agent multipl share independ agent agent transient share enabl agent exchang inform servic broker cd transient share subsequ interfac tupl space tupl space feder tupl space migrat mobil agent mobil host figur transient share tupl space handl physic logic mobil share inform titl payment option select separ inform concern task role agent bound tupl read withdrawn system inform inform concern qualiti servic inform transient share enabl agent access global system inform detail role tupl space identifi tupl space oper dot paper focu agent singl drop tupl space discuss mobil agent lime appli notion transient share tupl space gener mobil compon logic reli extend notion connect encompass kind compon mobil host connect commun link connect avail depend varieti includ qualiti secur connect repres lime paper limit simpl notion avail base presenc function link assum bidirect link presenc rout capabl physic notion connect commut transit mobil agent connect host resid host connect connect host depend physic commun link connect mobil agent depend arriv departur agent creation termin mobil agent regard special case connect assum mobil agent mobil host global uniqu identifi figur depict model adopt lime content mobil agent determin presenc extend mean agent host creat tupl space transient share agent access agent evid figur tupl space regard mobil perman mobil agent tupl space empti mechan transient share appli tupl space host connect merg tupl space feder tupl space content transient share network tupl agent local belong local tupl remot belong tupl space mobil host access notion transient share tupl space natur adapt linda tupl space mobil environ physic mobil place store persist tupl space connect machin tupl space partit scenario logic maintain local tupl respect agent belong complic lime enforc priori partit tupl space subspac transient share provid tupl space abstract depend connect lime notion decoupl linda effect decoupl mobil compon global tupl space coordin model physic logic mobil separ tier abstract worth applic form straightforward adapt model applic exploit mobil agent run mobil host emploi stationari program migrat oper design applic model term mobil host fix tupl space applic exploit physic feder tupl space span exploit tupl space local commun mechan agent comput transient natur lime share tupl space pose addit illustr mobil agent transient share tupl space mobil agent persist tupl space figur persist transient share tupl space ur simpl system mobil initi leav inform intend eventu process simpl depict left hand side figur repres straightforwardli linda perform deposit tupl space tupl inform commun persist global avail tupl tupl remain tupl space depart eventu withdraw perform situat transient share tupl space depict hand side figur initi perform tupl insert transient share agent pick tupl perform transient share tupl space consist bs block longer present tupl satisfi match problem consequ fact lime persist tupl space global repositori tupl configur tupl vari dynam locat compon desir retain advantag provid decoupl time space linda model commun bs perspect desir withdraw time accomplish effect transient share tupl place bs assum lime accomplish exploit notion mobil gener locat tupl tupl space case locat tupl identifi uniqu tupl space identifi mobil agent agent perman bound lime tupl mobil agent simpli version annot tupl intend locat semant oper account locat involv conceptu step step convent tupl insert agent call point tupl current locat destin locat agent locat connect mobil lime system react oper move tupl destin locat combin insert tupl instantan migrat perform singl atom oper tupl remain current circumv problem earlier perform note perform necessarili impli deliveri rule nondeterminist select tupl defin linda place tupl transient share tupl intend case wait connect transfer agent withdraw tupl space tupl automat augment support field record current destin locat inform enabl lime detect presenc tupl tupl current locat intend facilit state reconcili engag disengag tupl space belong system detect presenc misplac tupl migrat chang current locat action part engag tupl action mobil agent disconnect feder tupl space tupl space figur recomput transient share tupl space disengag merg migrat misplac tupl place strictli sequenti order execut singl atom oper disengag reli notion agent transient share tupl space present mobil agent recomput process depict figur initi mobil agent access union tupl physic agent repres fill pattern box repres occurr departur agent physic disconnect figur transient share tupl space partit constitu portion share tupl space tupl current locat includ misplac final destin destin place tupl agent gener solut step basic partit content transient tupl space back physic carri mobil agent merg configur complet tupl space updat process disconnect abil abstract locat mobil agent host access data seamlessli simplifi program task situat desir limit access portion transient share tupl program conveni perform reason programm temporarili concern agent tupl space situat demand form annot similar annot oper form current destin locat defin earlier locat left case symbol combin locat paramet identifi project transient share tupl space review combin lime deal logic mobil singl host show oper permit presenc physic mobil discuss oper oper perform project transient tupl space tupl current locat equal oper mean restrict scope oper singl includ misplac tupl creat agent lime refer tupl destin agent form abil perform oper kind tupl garbag collector agent applic knowledg meet agent purg useless tupl special perform tupl destin current locat restrict scope tupl transient share tupl space final destin tupl misplac agent oper semant transient present misplac tupl direct migrat atom correct time engag physic mobil lime capabl restrict queri perform specif tupl space achiev mobil host current locat identifi mobil agent mobil host destin locat identifi mobil agent restrict hold oper repres destin locat mobil host tupl eventu belong tupl space discuss tupl space made concret mobil physic hold tupl agent destin locat tupl vanish disconnect applic host tupl realiz lime stationari persist agent hold incom tupl destin host make agent locat reactiv program rapidli chang environ abil react great import event concern physic disconnect qualiti avail data carri parti typic arriv departur mobil agent event natur repres linda model tupl solut exploit lime leverag earlier model stationari continu monitor underli layer virtual machin system event includ departur arriv mobil qualiti transform event tupl insert stationari agent inform agent connect feder tupl space gener transient share oper basic mechan cope event process suspend occurr model tupl tupl action tupl retriev solut drawback semant point event caught process interest process interest event perform oper event complex scheme involv priori knowledg number process interest event perform point listen multipl event requir thread control impract fundament problem rest fact linda forc applic reactiv program demand tupl applic desir encapsul reaction event provid higher level abstract programm freed burden deal explicitli synchron issu lime introduc notion reactiv statement form code fragment statement execut tupl match pattern found tupl space tupl space addit constraint deal remot tupl space execut reaction complementari oper reaction provid lime semant statement defin mobil uniti reactiv reaction select nondeterminist guard evalu guard action reaction skip select execut proce enabl reaction normal execut statement resum reactiv statement execut belong separ reactiv program run fix point statement semant offer adequ level reaction regist execut statement includ migrat statement programm effort deal event minim principl arbitrari practic structur constrain implement definit arbitrari express host java current implement truth evalu statement requir access java virtual machin develop higher level languag built top java support manag arbitrari reactiv statement current implement lime specif reduc pattern match tupl tupl space reactiv statement execut statement trigger reaction insert tupl tupl control lime similar issu relat code fragment includ tupl space oper reaction execut separ thread control belong lime system block oper forbidden block process reaction presenc tupl space oper complic matter perform point small fast process execut tupl space oper demand convent statement care semant point oper match pattern reaction gener potenti infinit reaction loop lime present tupl space oper subject constraint stem notion prevent programm modifi reactiv tupl space leav programm evalu semant perform tradeoff applic develop lime api valid hypothesi actual form oper annot omit discuss simpler reaction assum form locat paramet mean discuss reactiv statement feder tupl current locat field identifi mobil agent mobil host reason li constraint introduc presenc physic mobil feder tupl space access mobil depend content belong remot agent maintain requir atom serial reactiv statement requir distribut transact encompass host tupl space oper impract solut lime offer capabl react asynchron avail tupl remot provid oper weaker semant work depict figur privat tupl space mobil agent shown event tupl space collect event tupl introduc simplifi provid lime construct semant invok agent reaction regist share reaction regist oper match transient share tupl space mobil agent figur react remot event lime thick solid line repres thick dot line repres asynchron action perform agent reaction fire execut perform copi augment inform enabl system bind event tupl agent perform asynchron action move tupl action show requir start distribut transact suspend execut connect agent lime eventu deliveri connect reach reaction statement origin oper lime similar notifi oper provid sun javaspac event registr mechan provid ibm develop richer event reaction arbitrari event insert subject work discuss technic issu involv develop lime complex fulli mobil set disconnect place tupl transfer lead distribut consensu problem proper applic level protocol prevent tupl duplic loss matter complic semant requir transfer misplac tupl place part distribut transact tupl transfer affect avail rout network present figur mobil object tm adjac letter board form word timer expir word found score point game initi player player join game connect establish activ disconnect game proce disconnect player connect exchang word updat list duplic word score open issu ad hoc network detect connect challeng implement easi case mobil constrain capabl api hardwar mobil host equip logic lime ideal provid commun api exploit mobil code figur snapshot mobil game termin determin connect player timer inform pass player connect player player final score comput gian pietro ami termin poor primit exist todai minim lime host mobil code system complex design task issu entail care balanc act semant simplic implement mobil uniti defin number interest potenti construct unclear time extent reason implement presenc arbitrari disconnect interest unexplor transient share complex data structur weakest assumpt make ensur implement question continu investig sound approach verifi applic develop applic realworld mobil devic drive criteria select domain experi plan experi varieti hardwar includ possibl custom order evalu requir respect platform comput usabl applic benefit lime countless transient share enabl devic data central repositori requir insert dock rang sourc inform suffici trigger reactiv exchang inform team robot scene natur disast build cooper dynam global map area transient share local inform time contact intellig transport system feed driver highwai inform transfer activ car commun explicit request made mobil agent behalf driver initi set target applic develop cooper game exhibit predict disconnect applic involv mobil agent figur show snapshot lime implement popular word game call tm prototyp built ibm develop initi version develop constrain assumpt full connect anticip small commun peopl collabor applic short commun manag synchron agenda airport meet room object build java api fulli implement lime abstract give opportun evalu implement construct possibl modifi design lime provid softwar packag develop sampl applic involv physic logic mobil paper present design system adapt linda model commun mobil introduc notion transient share tupl tupl reactiv statement hypothesi research minimalist set oper concept provid transient share tupl enabl rapid depend develop applic involv mobil ultim goal verifi valid hypothesi approach plan pursu involv blend formal algorithm applic develop seek provid applic develop tool facilit rapid develop applic care select small set commun primit construct semant definit tailor support decoupl cooper style defin enabl formal ensur high depend minim program effort lime kei vehicl achiev ambiti goal mobil uniti provid formal underpin term semant tm trademark parker brother coordin construct acknowledg paper base work support part nation scienc foundat grant gian pietro picco partial support studi laboratori itali recommend express paper author necessarili reflect view nsf cselt author implement demo suggest comment lime refer km misra parallel program foundat vigna understand code mobil ieee tran softwar garlan le editor proc int conf coordin model languag volum lnc sept gelernt gener commun linda acm comput jan ibm space db johnson rout ad hoc network mobil host proc workshop mobil comput system page tm malon crowston interdisciplinari studi coordin acm comput mar pj roman composit program abstract mobil comput ieee tran softwar feb sun microsystem javaspac march perkin ip mobil support rfc ietf network work shaw garlan softwar perspect emerg disciplin prentic xu liskov design distribut implement linda digest paper int symp page june
IR/582 5 layer approach domain author la layer approach domain author support faculti mathemat comput scienc technisch universiteit eindhoven netherland depart comput scienc state unit state america paper present approach author support web coursewar base layer ontolog paradigm layer coursewar author architectur serv basi formal semant reason support perform gener author task approach repres extens knowledg classif index mechan develop aim support student complet learn task environ addit vertic layer system author assist layer oper role facilit creation ontolog layer ontolog domain educ metadata layer focu domain ontolog creation support addit layer provid process exemplifi method present set gener task relat domain author ontolog support concept web layer process introduct educ open possibl excit bring ai techniqu older teach fulli experi test web advantag bring inform disadvantag user term great potenti multitud potenti user issu user model reach research dead gain popular larg popul user chanc spot pattern greater comput issu ñ lead question make thing blame search semant web research group advoc mean structur ontolog provid inform appli initi coin present instruct meant teach materi coursewar deliveri goal support author creat link frame term evolv multimedia coursewar hypermedia coursewar constraint layer approach domain author la predefin path learn materi adapt educ hypermedia nowadai coursewar gatewai varieti web educ materi specif topic specif educ develop author repres web address descript affect coursewar author process address challeng emploi power approach knowledg classif index learn base subject domain import aspect approach build subject domain ontolog paper present view ontolog support coursewar elabor approach knowledg classif aim support student learn task environ start shortli present layer approach support coursewar aim ontolog creation support defin set gener atom task relat coursewar domain author detail function illustr draw futur research perspect ontolog author support order understand type author support system aim architectur basi built ontolog support function aim author environ main domain librari editor modul correspond horizont layer inform librari domain inform author web coursewar spread dimens defin librari process complex labor intens process linear coursewar author difficult author requir modern author support facilit author assist fig approach coursewar author support layer approach domain author la automat perform author intellig author assist form build activ support domain ontolog central idea captur semant subject domain provid enhanc support author web coursewar power approach reusabl domain ontolog coursewar author perform search system author activ addit layer intellig assist coursewar author work ontolog repres concept map author involv manipul concept creation modif cm semant layer intellig author assist includ consist introduc addit oper cm compar map merg extract subset analyz previou research extra vertic layer approach coursewar author support approach author cooper repres initi main inform object inform base coursewar system repres support author inform object assist oper inform gener repres layer architectur implement system function gui layer support commun inform layer actual descript structur inform object coursewar system subject domain organ layer descript data sourc local store educ metadata layer layer extend architectur assist oper layer oper layer handl oper relat data inform layer provid mean model data ontolog creat altern structur oper layer facilit inform consist consist process domain engin librari engin includ type support consist support consist modul perform activ inform layer provid function facilit process author domain ontolog educ metadata modul consist educ sourc deal task handl notion semant conflict resolut comparison enhanc result ontolog defin addit support modul offer hand set oper check consist altern structur creation number author role offer predefin function facilit effect reusabl structur built author regard reusabl pai special attent issu merg ontolog extract portion ontolog merg decid frame extract sourc identifi semant overlap conflict extract inform target assist merg record sourc insert layer approach domain author la refer select pattern templat educ ontolog present predefin object author oper layer implement author assist base ontolog map author process coursewar author hint author creat link document link item explain detail function assist layer oper layer function domain ontolog creation support comput semant integr situat research larger research framework present note ontolog situat level shown level task lack connect level constrain highlight fig paper focu author role activ tabl atom oper definit relat domain author support activ aim effici inform creation subject domain ontolog domain author task support section focu author task support oper set oper layer present option provid assist layer domain author defin complet set gener author task inform layer subject domain support domain librari engin complet defin atom inform layer tabl paper present sampl domain engin support author task tabl domain author domain ontolog author domain concept map author domain ontolog creation vital cooper collabor aspect gener atom rang oper descript perform set object ta li doc add object domain ontolog metadata librari delet object structur edit object set set metadata librari ensur current state updat inform structur set set directli link relat relat relat relat document list object set graphic textual result view altern view engin result author set check exist object layer approach domain author la oper layer domain assist layer domain assist domain author task tabl illustr interact domain engin domain assist support author present activ diagram system support atom author task add tabl present abbrevi definit atom oper section tabl present excerpt domain author ontolog select basic atom task interact domain engin assist due space restrict present ontolog educ metadata author interact stream domain assist engin trigger common author task involv basic concept higher author task domain task trigger oper perform domain engin ontolog domain structur oper ensur data consist perform domain specif check tabl domain author task author task perform author tabl task domain engin perform check concept updat cm perform final result domain assist analysi present depend concept found domain engin notif concept ad cm result input domain custom present format author support task effici case domain assist perform altern oper author set altern view synonym note check superflu due architectur check verifi link delet link delet number composit action implement repetit call atom oper call task domain assist domain engin result add suggest option add delet domain engin result give altern relev domain match ñ notifi author ad cm add suggest option add delet domain engin result notifi concept miss cm notifi link exist offer edit option notifi indirect link path give altern present de relev domain highlight true perform keyword search notifi author ad cm true true true link path notifi author ad cm layer approach domain author la notifi author ad cm del give altern present relev domain highlight give user option graphic textual cut segment notifi author remov cm del notifi author give altern view option delet cancel delet relev domain highlight notifi author remov cm true del true del fig uml activ diagram atom domain author task add layer approach domain author la paper insight approach support coursewar special focu domain author support function previou experi aim system convinc ontolog power tool web author process difficult templat automat support extend support system addit vertic author assist layer oper layer fig role support author process horizont layer claim give overview author task materi extens intellig author assist interest ontolog design creation ontolog subject domain ontolog paper give explanatori detail domain author support function research border import merg ontolog ontolog process power comparison author cooper environ creat reli exist coursewar coursewar part reli heavili develop research import field paper collabor cooper coursewar author ad semant coursewar subject web standard effort semant web commun semant ad ontolog layer paper demonstr domain ontolog creation function support ontolog semant label separ build provid structur reason check mechan refer ontolog support web author learn teach support educ intern journal continu engin educ experi develop multimedia coursewar world wide tool clear intern journal semant web road map intern world wide web consortium jb hypertext write environ macintosh comput softwar system adapt educ hypermedia tenth intern peg pp collabor author environ support concept map educ technolog de open adapt hypermedia review hypermedia de educ multimedia learn problem layer approach domain author la european confer artifici intellig adapt hypertext workshop adapt hypertext user model cape cod applic design commun dr sb semant map educ psycholog review ontolog engin overcom common int journal ai dl al environ merg test larg colorado author intellig tutor analysi state art intern journal ai adapt author workshop adapt intellig educ system workshop montreal merg ontolog
IR/583 5 question answer web codi kwok washington usa abstract óò øó óö øó ðó øó áò øó øó óò óò ôöó øó øó óò øóö áò ñù øó introduct ðó óò øó ñù øó copyright held hong kong acm oren etzioni washington usa daniel weld washington usa øó çùö óò óö óòðý øó øó øó øó óò óö øó óò øó òóø ìó óò øó øó óò øó óñ óò øó óò background ø øó óñ ü óñ ôöó øó áò øó ùô øó øó ùô øó áò compon qa system óò óð óò øóô áò óò øó challeng web øó òóø òóø øó òó øó øó øó óö ø øó óö ø óö òóø óò ëù øó øó øó óò øó øó øó áò mulder web qa system øó øó ø øó øó øó øóö øó question áò øó øó øó øó øó ø øó óùö óûò ìó óò user final question answer select cluster final answer mei parser cluster nlp parser legend rectangl compon implement round rectangl parti compon tree score answer question classif link parser classif rule candid answer øó óò çùö øûó øó òóø øó áò áò ìó è øó òóø òóø è øó è òóø òóø óò øó øó answer type find phrase match type tree link answer extract tree nlp nlp parser nlp parser nlp parser parser queri formul origin question queri formul rule rule applic question wordnet transform grammar quot noun phrase summari summari extract score idf score web page search engin queri search engin è øó óö øðý question classifi øó çùö øó ý áø ùðø ôöó øó øó óö óö øó ø øó ìó ø ø øó ø øó ø øó ìó ø ø óö áò óö áò òóø queri formul øó øó óò óùö ìó øó óùö óòðý óò òó ùðø øó óò óùö øó øó óò øó óò óò ø øó ìó áø óö ó ùö øó øó òóø òóø øó óò òóø øó øó óò ø øûó ø è óòðý øó óòðý øó óò óò search engin óò óùö ø òóø øûó øó øûó ç øó øûó óò øó óò òó ø óò answer extract áò øûó ôöó ø øó óò æ øóö óò øðý øó óö øó óò òóø øó øó øóö ðó áò øó ý øó øó øó ìó ý æ æ óð ó ùö ìó ý ìó øó ò õ ò ë ò è ò æ ìó óò óö answer select ôöó øó øó áø øó øóô øûó ø òóø øó óò óò ñ û ñ ä óò øó ó ùö ó ùö ø óò óö óò óò øó ôöó ó ùö øó óò ó ùö çùö óùö óùö øó øó øó evalu áò øûó áò øó øó áø ùô óûò øó øó øó óùö ùö óùö óùö áò øûó óò ý methodolog óùö øó øó øó ê øó é é áò ðó ê óò øó øó øó áò øðý óò øó øðý óö øðý øó ñù øó òóø ìó óö ñù øó ùðø øó øó óò óò óùø ø áò óùö øó øó ðó ø óùö áø òóø óùòø øó øûó øó óùö øó ø øóô øó øó ø ø òóø áò ø øóô ø áò ø ø ñù ø ø òóø øó è ø óò è ï è óùö øó øó çò óö óñ áø øó øó øó data set óùö áò ôöó øó øó óò ó ùö ôöó óùö óùö øó óùö óò òóø óùö òóø òóø øó ñù óò òóø òóø øó óùö óò óùö øó óö óö øó question answer àóû øó comparison system áò óùö øó ìó ö ùô ùô øó ö øó óùö ðý mulder googl user effort çò øó øó ø øóô óòðý øó øó øó òóø øó øó óùø øó óò óùö òóø óùö contribut compon çùö øó øó å óòðý øó å ðó ìó óö ìó ò ö óò ùò question answer mulder qf googl user effort å å å î å î å å å å å î å î áò øó áò óñ óò å î øó å å øó ø ø øó ñù å î óòðý áø ùðø øó ø relat work ôöó óö ø ø ý øó óò øó óñ óñ óñ óñ óñ ø øó øó øó óò ø ø øù çùö óò ý øó øó ý øó ø øó ø øóö øó ý øó øó øóö øó ôöó øó øó øó øó óò øó øó øó óò óò øó ý òóø øó òóø óö ø øó øó àóû òóø ùö ý ó ùö áò ôöó øó ø ý óö óò ôöó ù ý øó óòðý øó òóø óò óò øó ø ø øó ý áø ôöó futur work øó óùö øó ý áò øó ø øó øó øó óò çùö ùö óùö ñù øó áò óùö óùö óûò øó ø øó ðó ý ý óùö àóû øó óùö áò óùø øó øó óùö óùö çùö ü óò óò óñ ôöó øó øóö óùö çùö øó ñù acknowledg óò øó ø óñ æ ë refer èöó øó ä øûó ôöó ë ê ë ê áò èöó óò èöó â áò ë ë ë ë å áò èöó ë óò áò èöó ç ùô áò èöó áò èöó óò áò èöó áò å ã èöó ê óò èöó øó óò áò èöó â áò èöó óò çò ý áò å èöó å è å þ óò ê áò èöó ã áò èöó áò áò áò èöó ë à â ä æ áò èöó ç ç øó áò èöó áòø
IR/584 5 heterogen multimedia select web chung februari depart comput scienc heterogen multimedia select web chung korea advanc institut scienc korea abstract multimedia web distinct autonomi heterogen establish maintain independ queri process depend scheme investig problem select number multimedia web multimedia object retriev distribut crucial capabl find global similar queri multimedia local similar measur select algorithm determin candid object relev queri select base number relev object local estim sampl object histogram inform extens experi larg number real data set demonstr method perform distribut heterogen environ multimedia compress histogram introduct decad growth import select larg number web respect queri user send queri perform distribut queri process imposs search process user queri long time complet queri avoid exhaust provid narrow search scope candid approach attempt solv select problem text research made multimedia number web multimedia object imag increasingli import retriev kei problem address paper select relev multimedia queri multipl autonom problem defin list local db sampl object ij db compress histogram inform select number local number sampl object db queri object global similar threshold number select select local base relev solv scheme select sampl object histogram inform local global translat local local similar measur autonom heterogen environ captur statist featur similar distribut sampl object regress estim size queri result local respect histogram lt base size queri result respect gt kei criterion rank lot work made select problem sourc text document gravano al distribut broker system base retriev model estim number potenti relev document queri protocol internet metasearch callan al present probabilist model inform retriev base infer network meng al method estim text base probabilist model tradit method text applic multimedia exist semant gap vector text featur vector multimedia recent work multimedia select made chang al select approach visual similar queri templat repres imag imag cluster local statist data cluster templat approach number sampl varianc similar distribut imag templat determin likelihood cluster visual queri approach base statist similar distribut locat imag imag cluster assum local support featur extract method distanc function approach restrict realist environ web autonom heterogen beigi al engin imag call metaseek visual metaseek rank local histor data relev feedback made user specif chang past inform valid lead incorrect select motiv method design select relev multimedia queri autonom heterogen environ web approach preprocess phase rank phase phase explain sketch illustr figur preprocess phase maintain metadata local inform local collect background regist regist updat larg inform includ local similar sampl object compress histogram inform local histogram gener imag featur data local order estim select queri construct normal space dimens compress discret cosin reduc storag overhead network transmiss cost extract featur valu sampl object comput statist metadata correl standard deviat featur set sampl object rank phase comput featur valu queri object transform global threshold local threshold local similar measur local select estim method estim queri result size compress histogram comput featur valu queri object figur overview multimedia select collect sampl object compress histogram local rank phase comput featur valu statist data sampl object preprocess phase transform gt lt estim queri result size lt comput queri result size gt rank global select inform order rank local mean global similar measur sampl select techniqu develop estim size queri result differ local select global select queri sampl object summari method human human solv problem multimedia select heterogen environ research area issu problem similar measur differ estim queri result size global similar local local similar method differ order rank local global similar point view method reflect updat local time solv suggest techniqu differ estim size local compress histogram inform upto inform local updat dynam local transfer local low transmiss cost spheric select rest paper organ section survei relev background inform section show observ relationship heterogen similar measur work section describ scheme estim number object relev queri local select algorithm determin candid section explain framework experi present result give section background imag featur similar section section describ previou work order explain method assum multimedia site featur extract method imag featur color frequent repres imag easi extract color featur fast comput similar color approach color color histogram wide visual featur averag color averag deriv color histogram color space repres color histogram imag distanc rgb color space reflect human percept hsv color space hsv color blue valu rgb color space transform signal hsv color space formula show transform rgb color space hsv color greater human visual system sensit lumin reduc effect channel compar weight vector featur weight color space repres color base fact human ey sensit bright valu transform valu appli similar distanc color featur vector gener measur color similar rgb color euclidean distanc distanc measur featur vector euclidean distanc vector defin hsv color angular distanc measur color similar featur space repres form corn polar coordin adopt distanc function si vi si vi si vi si vi vi vi angular hp sp vp hp sp vp featur vector hsv color space distanc close imag object similar larg similar measur opposit close object similar close dissimilar defin function map distanc similar definit similar map function distanc valu set nonneg real number satisfi similar map map function map distanc similar imag object distanc convert similar normal techniqu suggest descript comput distanc pair imag calcul store standard deviat distanc calcul distanc valu imag queri imag appli gaussian normal distanc valu obtain percent distanc valu fall rang valu order map rang similar select estim rectangular rang queri order select multimedia relev estim result size similar queri local multimedia select estim requir featur repres vector earlier work select estim method rectangular rang queri method briefli rectangular rang queri rang queri coordin divid partit lemma select rang queri rang repres express select queri dx dx dx dx dx set select coeffici dct relationship similar measur describ relationship similar measur statist data global formal defin definit global sim global ij defin similar queri object ij accord similar measur local sim local ij defin similar queri object ij accord similar measur local db web heterogen featur extract method distanc function similar attribut similar search similar object retriev local object provid exampl illustr local support similar search color attribut extract averag color featur color histogram hsv color space measur similar queri imag local extract averag color featur color histogram rgb color space measur similar figur show scatter diagram global similar valu local similar valu pair imag select set imag imag select element pair element pair select arbitrarili imag diagram show shape graph straight line figur show diagram case local extract averag color featur color histogram color space measur similar local support similar search textur attribut extract textur featur moment color histogram hsv color space measur similar queri imag local extract textur featur moment color histogram rgb color space measur similar scatter diagram global similar valu local similar valu imag case pair imag chosen shown figur diagram show shape straight line figur show diagram case local extract textur featur moment color histogram color space measur similar figur similar valu coordin obtain averag color color histogram hsv color space coordin obtain textur extract moment color histogram rgb color space contrari previou scatter diagram show relationship similar measur attribut figur show diagram case local extract textur featur moment color histogram color space measur similar featur extract method attribut local observ scatter diagram similar valu color color textur show shape straight line prove similar measur attribut show linear relationship made experi show case satisfi linear relationship averag color textur attribut similar search figur averag color rgb figur averag color space averag color hsv space space averag color hsv space figur scatter diagram textur rgb figur scatter diagram textur space textur hsv space space textur hsv space figur scatter diagram averag color hsv figur scatter diagram averag color hsv space textur rgb space space textur rgb space featur extract method distanc shown tabl statist linear regress method obtain equat straight line test statist hypothesi verifi linear relationship similar measur test scatter sampl coeffici determin analysi varianc squar due linear squar due linear squar obtain level linear regress model effect similar scatter diagram show shape straight larger tabl describ featur experi group averag color textur featur tabl show result experi similar measur similar valu measur pair imag made kind pair featur chosen featur chosen group similar search perform queri experi case similar valu measur fix queri imag arbitrari imag tabl show comparison case similar valu measur pair imag case similar valu measur fix queri imag arbitrari imag tabl correl distribut statist valu linear regress line shown tabl case attribut featur extract method scatter diagram show shape straight larger case attribut scatter diagram show shape straight line case smaller case linear relationship satisfi larger similar measur satisfi linear relationship shown tabl observ fact sever differ case similar valu measur arbitrari pair imag case similar valu measur fix queri imag arbitrari imag state observ observ similar measur attribut featur distanc strong tendenc similar measur show linear similar verifi satisfi linear properti distribut similar search web tabl descript featur similar measur featur featur descript averag color featur rgb color space euclidean distanc function averag color featur hsv color space angular distanc function averag color featur color space euclidean distanc function textur featur histogram rgb color space euclidean distanc function textur featur histogram hsv color space angular distanc function textur featur histogram color space euclidean distanc function tabl test statist hypothesi linear regress similar measur featur distanc function featur scatter diagram correl result straight line linear straight line linear straight line linear scatter linear scatter linear straight line linear straight line linear straight line linear tabl comparison case similar measur pair imag case similar measur fix queri imag arbitrari pair imag fix fix fix fix fix pair imag fix fix fix fix fix feat pair imag fix fix fix fix fix work explain method detail tabl summar notat paper tabl notat paper mean db set local queri number select gt global threshold user specifi lt local threshold gt number random sampl object global similar local similar assumpt distribut multimedia discuss assumpt local assumpt local maintain histogram estim select queri assumpt send agent program local order collect histogram select estim assumpt agent program local site sampl object randomli local agent program send initi content local chang larg assumpt standard deviat sampl object store perform normal object local normal real data space featur valu object ij local db valu real data space histogram inform content summari local db gener normal data space dimens order construct featur data normal object ij ij ijk featur ijk featur featur vector ij object db featur matrix form column set featur valu length assum set normal comput standard deviat set perform featur vector dimens formul ijk ijk probabl featur fall rang approxim percent paramet store meta data transform point real data space point normal data space normal data space partit rectangular bucket frequenc valu bucket compress dct construct compress histogram order construct histogram hsv color transform featur polar coordin system rectangular coordin system select estim spheric rang queri multimedia rang queri repres real data space select estim techniqu spheric rang queri estim size queri result histogram rectangular obtain volum estim select rang queri rang procedur calcul volum radiu calcul local similar threshold lt map appli normal queri vector obtain local featur valu queri object volum radiu center real data space calcul compress histogram local gener normal data space dimens featur vector db real data space transform normal data space formula transform normal data space figur show real data space transform normal data space real data space normal data space figur real data space normal data space explain approxim approach estim queri select spheric rang queri singl rectangl obtain volum center side length volum calcul vol side length queri vector comput corner point corner point real data space transform normal data space formula select rectangular rang queri calcul formula multipl rectangl obtain small volum volum small locat randomli side length calcul vol small real data space transform small normal data space formula select spheric rang queri estim ad select small rectangular rang queri select method discuss rang similar search defin rang similar search definit rang similar search queri object attribut rang similar search select object ij similar score sim global ij scenario rang similar search web environ user queri object gt queri object forward decid relev evalu queri queri object chosen queri evalu select merg queri result present sort order user interest identifi produc larg size queri result focu estim queri result size heterogen definit global queri result defin ij db sim global ij local queri result defin ij db sim local ij global queri defin db db number object db local queri defin db ideal rank determin sort queri ideal comput local provid histogram global featur local featur differ introduc select definit popul select comput exact defin sampl select estim definit sampl select denot global queri select estim random sampl size denot local queri select estim random sampl size gt lt hold linear relat lt gt obtain linear regress analysi local similar global similar defin offset differ queri local queri select estim histogram inform local db estim global queri select db estim global queri result size db db approxim discuss properti detail section rank algorithm select criteria defin select top rank list db db db rank estim global queri result size queri algorithm db linear regress analysi calcul sampl object size lt comput estim local queri histogram inform db end rank sampl select similar measur differ diff order estim formula comput fetch sampl object local extract comput progress sampl preprocess phase progress sampl start small sampl progress larger accuraci improv order show accuraci estim method show converg order comput queri sampl object size local db statist meta data sampl regress line coeffici sampl coeffici shown figur estim regress bivari distribut local similar global similar queri sampl object point estim regress line threshold point lemma theorem show converg constant sampl size lemma local queri select estim random sampl size local similar threshold converg stochast local queri select estim object db sampl size lemma global queri select estim random sampl size global similar threshold converg stochast global queri select estim object db sampl size theorem threshold point converg stochast sampl size proof lemma theorem found appendix explain determin size sampl object converg close suffici accur differ accuraci small point determin differ suffici small sampl coeffici determin high observ observ figur illustr bivari distribut global similar local similar respect mean close valu coordin figur repres local similar regress line global similar calcul local similar figur regress line figur threshold point experi order measur effect conduct experi environ larg number imag data queri experi show accuraci method rank multimedia respect queri system written microsoft window hp experi framework test data consist imag bitmap construct imag base semant categor visual special type imag featur extract method distanc function acquir visual featur extract averag color textur featur color space color histogram method extract imag split kk subimag averag color textur subimag extract ij ij ij ij ij ith color compon jth bin ij frequenc ij number total bin total number pixel histogram hsv color ith compon correspond averag color defin averag intens color compon textur repres rel smooth color compon case imag split kk dimens featur vector repres averag color averag color textur hsv color space featur tabl show featur extract semant categori local local similar lt gt tabl test data set environ site featur extract method size semant categori averag rgb color space photo averag rgb color space zoo collect averag hsv color space art design averag rgb color space pattern averag color space plant averag color space clip art averag color space pattern averag hsv color space peopl averag hsv color space pattern averag color space anim collect experi conduct vari paramet tabl test paramet paramet mean dimens dimens imag sampl ratio sr number sampl object divid total number object db number select threshold rang global threshold valu result experi includ comparison rectangl approxim sra execut queri test paramet averag result confid level estim predict interv global similar small rectangl observ number sampl object provid suffici accur global select estim measur rel error defin size result queri size result estim size result queri figur show result rel error sra site site site similar measur hsv color observ rel error rel error rang sampl ratio show result sra rel error show constantli rang global similar measur local color experi illustr rel error chang sampl ratio fix sampl ratio experi figur rel error figur rel error figur show result sampl select queri observ fluctuat sampl ratio small converg stochast constant sampl ratio result show significantli offset differ global local select util sampl ratio larger figur queri figur queri figur queri figur queri examin perform select method perform measur adopt rank order error test queri compar rank return method ideal rank ideal rank determin measur global similar queri imag rank order error test queri calcul db er ir ir ideal rank db base actual result size er estim rank db determin rank algorithm set select select method test queri comput express rel perform deriv accuraci select method comput ratio global queri result size return select method return ideal choic rel perform contribut test queri defin db db gt db gt db set select ideal choic deriv deriv figur show perform select select estim techniqu number select perform random select arbitrari baselin refer comparison techniqu outperform random select yield perform sra figur observ perform dimens imag featur sr figur rank order error figur rel perform examin accuraci select compar techniqu optim figur show size global queri result estim sra calcul elabor sra observ show good perform dimens imag featur figur global queri result size figur global queri result size method address multimedia select problem heterogen environ summar featur valu object multimedia compress histogram statist data similar distribut sampl object method accur estim number global similar queri multimedia similar select differ local sampl select techniqu inform local compress histogram local frequent chang perform experi larg number real imag data set examin effect method method shown suffici accuraci select relev respect queri futur plan extend work collect fusion heterogen multimedia refer chang engin imag symposium electron process retriev imag video san jan chang imag engin relev feedback ieee internet vol page cost model nearest neighbor search data space acm symposium principl page jun shu virag imag search open framework imag manag spie storag retriev imag video page croft search distribut collect infer network eighteenth annual page crane simplifi approach imag prentic zhang data resourc select distribut visual inform system ieee transact knowledg data page nov flickner niblack al queri imag video qbic system ieee comput page sep ck paepck stanford internet acm sigmod confer manag page effect gloss text discoveri problem acm sigmod confer manag page rv craig introduct mathemat lieberman introduct oper research imag segment intens color inform visual commun imag part page jan chung select estim compress histogram inform acm sigmod confer manag page jun rish determin text search internet confer larg data page aug estim search engin confer data page mar mehrotra support rank boolean similar queri mar ieee transact knowledg data page park regress analysi oat effici progress sampl acm sigkdd confer knowledg discoveri data aug jr chang fulli autom imag queri system acm multimedia page nov chang visual search web content ieee page color data john wilei appendix proof lemma lemma theorem area mathemat size sampl finit larg compar limit notat standard practic lemma fix lim proof local local local set random sampl size cumul distribut queri fix threshold defin ij sim local ij random variabl distribut prob varianc distribut deriv var prob lim lemma fix lim proof sim global sim global sim global set random sampl size cumul distribut queri fix threshold defin ij sim global ij prove converg proof lemma theorem threshold point fix lim proof prove lim var var lemma lim
AI/585 2 gener fuzzi classifi base initi johann ferenc depart process po box hungari delft depart inform technolog system control po box ga abstract netherland identif fuzzi classifi problem address binari initi fuzzi classifi select relev featur effect initi partit input domain fuzzi system fuzzi classifi flexibl sion boundari tree parsimoni tree initi fuzzi classifi reduc iter scheme mean improv classif perform reduc fuzzi genet algorithm criterion search redund accuraci appli approach studi artifici wisconsin breast cancer classif preprint submit elsevi scienc summari result set tion problem wine data kei fuzzi genet model reduct introduct result complex classif deal structur issu tion classifi system import aspect select relev featur determin effect initi partit input domain classifi identifi part expert linguist interpret import aspect account aspect approach exhaust search educ interpret aspect neglect recent peopl recogn import aspect make automat identif classif system interpret challeng topic fuzzi logic classifi handl interpret aspect fuzzi logic improv interpret email classifi semant provid insight classifi structur make process fuzzi recogn real effort made result transpar main approach select low number input variabl order creat compact classifi construct larg set rule subsequ set make select rule genet algorithm appli model reduct obtain gener techniqu classif initi step procedur fuzzi model common initi method partit rule gener extrema initi result complex initi model simplif reduct step tation demand obtain compact initi fuzzi model fuzzi ing algorithm similar complex covari base initi techniqu put data partit ellipsoid region membership normal fuzzi set obtain orthogon project multivari membership tion domain project ellipsoid result product space inform loss step make model suboptim result perform model defin multivari membership function gain linguist interpret main advantag deriv step avoid problem crisp initi techniqu motiv high perform comput effici exist tree gener method effect select relev featur initi partit input domain applic regress tree initi fuzzi neural model investig research tree map feedforward neural network variat method tree input domain discret approach extend model prune method tree appli initi function neural feedforward neural network abund paramet render train procedur ineffici train set small method base placement basi function center edg rectangular region defin tree complex result model control complex tree number ad basi function function function fuzzi infer system approach ident initi fuzzi model regress tree similar approach simpl fuzzif regress tree result fuzzi cart model part fuzzi model build fuzzi inequ approach differ present method main initi fuzzi system contrari crisp binari tree transform fuzzi system approxim error ping fuzzi classifi util membership function membership function chosen initi crisp set initi fuzzi system crisp altern tree tune fuzzi system method transform dt fuzzi system deterior classif tune step recov accuraci lead complex fuzzi classifi due addit rule fuzzi set neg mation effect initi approach introduc approxim complex fuzzi model classifi perform rectangular partit input fuzzi model gener parallel boundari main advantag fuzzi classifi crisp dt greater flexibl boundari fuzzi classifi parsimoni dt conclud fuzzi base transform dt complex suggest simpl transform dt fuzzi model successfulli step reduc complex improv interpret optim simplif step obtain interpret fuzzi classifi approach initi fuzzi classifi obtain exact transform tree appli rule base simplif rithm genet algorithm base paramet optim iter improv classif accuraci ensur transpar classifi focu tree base initi step classifi note detail found section explain structur fuzzi classifi section transform tree fuzzi model discuss model simplif techniqu review section section sider classif problem approach studi artifici geometr wisconsin breast classif summari result set classif problem wine data section structur fuzzi classifi fuzzi classifi consist fuzzi rule describ nc class data set rule defin oper region rule featur space rule consequ crisp class label set gi ri xn number number input gi ith rule output fuzzi set connect model product oper interact proposit activ ith rule calcul output classifi determin winner output class relat consequ rule highest arg max certainti normal fire cf initi fuzzi classifi tree construct tree binari tree appli creat initi classifi binari tree consist type intern node termin node children intern node function node visit termin node repres output input lead classif problem termin node label predict class tree construct algorithm gener tree set case algorithm partit data set subset dm set test mutual outcom di case outcom ti binari tree gener algorithm appli numer attribut attribut test written xj select base split criterion default split criterion gain measur account ferent probabl outcom gain ratio explain residu uncertainti class case belong express denot proport class belong jth class inform gain test strongli effect number outcom maxim class subset denot cardin di data set potenti inform obtain partit set case base subset case fall split inform log number outcom test gain ratio criterion assess desir test ratio inform gain split inform gain ratio test averag split maximum gain ratio select partit strategi result tree consist train data practic data ten lead gener complex tree tree construct method prune initi tree identifi contribut predict accuraci replac leaf transform tree fuzzi model binari tree repres term crisp logic repres disjunct normal consist sequenc attribut xj attribut attribut test partit put domain classifi interv interv repres crisp characterist oper region rule rule formul connect domain crisp characterist set case trapezoid fuzzi membership describ fuzzi set max min tree repres fuzzi rule function rectangular region class defin depict tree repres fuzzi defin previou gener form algorithm transform tree initi fuzzi system select termin node dt defin di data set collect attribut test ti relat chosen termin node ti attribut test defin hypercub di data set formul ith rule defin characterist point fuzzi set reduct tune initi fuzzi classifi motiv model reduct crisp tree transform crisp rule base structur fuzzi rule base mind basic reason transform crisp class class class binari tree class featur space fig binari tree fuzzi fuzzi classifi comparison crisp classifi addit inform certainti classifi fuzzi system easili defin parallel dt approxim system manner fig figur accur tion parallel crisp rule fuzzi model rule perfect shown fig obtain membership function overlap interpol effect fuzzi infer rectangular fuzzi result classif boundari smooth parallel advantag properti fuzzi system make fuzzi classifi parsimoni crisp tree suggest transform dt fuzzi model seri simplif membership function ing step subsect shown algorithm start rectangular membership function extract dt membership function extrem case tune genet algorithm provid optim parallel boundari reduct tune algorithm previou shown fuzzi model obtain binari unnecessari complex fuzzi defin boundari crisp sion tree iter reduct method pose reduc classifi maintain accuraci accuraci class class classif problem approxim sion boundari crisp system membership function fuzzi model perfect classif fig solut linearli separ classif problem tree fuzzi model reduct step regain extent tune membership function genet algorithm appli tune membership function user decid accuraci loss gain transpar reduct fuzzi classifi achiev simplif method base similar measur quantifi redund fuzzi set subsequ similar measur base oper intersect union denot cardin oper intersect membership function aij equal membership function simplif procedur similar fuzzi set merg similar exce defin threshold θ merg reduc number fuzzi set model transpar similar measur detect fuzzi set element domain membership close fuzzi set featur similar merg led membership function featur elimin model complet simplif algorithm method extend addit rule prune rule number classif delet form cover except data prune base activ rule measur sum certainti simplif method fig merg similar set remov set similar prune rule small activ fig simplif fuzzi classifi combin paramet optim simplif algorithm result model scheme initi prune fine tune data tree initi ga optim λ ga optim λ model rule base simplif fig scheme complet dt identif approach dt base initi model reduct phase ga forc redund model number remov fuzzi set rule reward similar iter misclassif rate combin similar measur ga object function achiev remov unnecessari fuzzi set iter combin similar fuzzi set penal obtain distinguish term set linguist interpret tradeoff tween similar result function minim λ repres classif error averag maximum similar present aggreg similar measur total weight function λ determin similar reward penal absolut λ determin similar tive accuraci experi decid good final result highli sensit exact good result obtain valu rang detail appli ga found ga appli popul size number chromosom nc domain paramet number gener final optim complex reduct step threshold λ redund search λ final optim threshold set merg θ θ remov set similar set perform evalu order examin perform identif method set exampl present section problem geometr data demonstr capabl algorithm detail wisconsin breast classif benchmark problem literatur compar studi base set classif problem present studi perform evalu perform method problem vari number class featur geometr data simpl geometr classif problem defin investig capabl classifi gener domain class repres shade area fig train test set gener distribut sampl domain initi tree gener algorithm parallel complex tree result intern class class fig geometr classif problem termin node shown fig fig tree gener geometr problem larg number paramet perform result tree recognit rate train set test set fig result model transpar enhanc interpret result tree transform fuzzi model present model prune algorithm appli reduct optim simpl model gener membership tion close shape shown fig simpl show superior approxim capabl fuzzi system crisp fuzzi model gener base dt significantli reduc dt base identif algorithm simpli fuzzifi boundari advantag fuzzi system optim wisconsin breast cancer classif problem previou case studi show obtain good rule ture rule procedur real advantag initi shown real classif problem wisconsin breast cancer data µ µ µ µ obtain membership function solut fig membership function geometr classif problem irvin aim classif distinguish benign malign cancer base uniform cell uniform cell margin singl cell bare normal shown figur attribut integ rang origin instanc omit common studi class distribut benign thick margin unif cell size cell size normal unif cell shape bare nuclei fig wisconsin breast cancer class attribut class perform classifi measur cross valid data divid ten case similar size class distribut left appli construct classifi subsequ valid unseen case advanc version cross valid correct tree size dt shown fig dt classifi termin intern node fig tree gener problem construct tree transform fuzzi model section number fuzzi set number attribut test tree interv test input domain present tree result fuzzi model rule membership function model reduct procedur initi fuzzi model start simplif step led reduct fuzzi set rule contribut percent delet reduc classifi rule membership function optim ga object function obtain classifi subject driven reduc classifi fuzzi set optim ga iter phase transpar compact fuzzi model result recognit rate class class compar fuzzi set fig data fig show obtain rule highli interpret µ µ fig result membership function model scheme valid experi show averag classif worst perform good small classifi compar report result wisconsin breast cancer data wide test tive classif rule extract algorithm error estim obtain cross valid test solut data train result tab roughli compar kruse combin techniqu interact gi rule prune obtain fuzzi classifi initi made appli set result rule duce delet rule heurist learn method appli gradient descent ble triangular membership function semant properti account constrain search space final fuzzi classifi reduc rule featur misclassif valid classif method combin ga fuzzi logic appli problem method number rule gener determin priori method construct fuzzi model membership function rule addit part setiono gener similar compact classifi rule extract feedforward neural network train preprocess data tab fuzzi classifi compact model literatur high accuraci compar studi section intend provid compar studi base set classif problem present perform tabl classif rate model complex classifi construct sin breast cancer problem denot result averag valid author method rule condit accuraci setiono setiono setiono sipper sipper kruse paper dt base fc complex classifi chang tune procedur chosen pima wine uci repositori machin learn ampl classif problem larg small number featur class tab perform classifi measur cross valid classif initi fuzzi construct reduc present driven simplif procedur reduc classifi ga gener ga object function section enhanc perform similar obtain classifi subject reduc tabl complex classif problem problem iri glass pima wine optim distinguish fuzzi set prefer step phase consist model build monitor log number perform classifi tab extrem transpar compact fuzzi classifi obtain tune number rule condit classif perform improv slightli effect bigger effect standard transform techniqu model complex perform gener fuzzi classifi compar perform recent simpl transpar tabl classif rate model complex fuzzi initi tree classifi result tion problem dt fc dt fc acc dt acc fm iri glass pima wine initi fuzzi classifi classif problem initi model deriv mean algorithm crisp binari tree algorithm contrari initi exact transform techniqu appli obtain initi fuzzi subsequ reduc optim iter scheme mean reduct genet algorithm criterion search redund accuraci approach demonstr artifici problem breast cancer summari result classif problem wine data geometr classif demonstr approxim capabl fuzzi system crisp classifi identif algorithm fuzzifi boundari subsequ tune accuraci ad make optim fuzzi system structur lead unnecessari complex fuzzi classifi shown proper rule structur obtain optim procedur obtain classifi compact accuraci compar result report literatur approach regress tree base identif fuzzi topic futur research refer data mine method knowledg kluwer academ de semant constraint membership function ieee tran fs van similar measur fuzzi rule base ieee tran model complex ieee tran fs obtain interpret fuzzi classif rule medic artifici intellig medicin fuzzi model ieee tran fs learn fuzzi classif rule pp develop soft ed rand perform evalu fuzzi classifi system pattern classif ieee tran program machin morgan san entropi tree neural proc ieee initi neural network mean system map tree neural knowledg base system tree initi ieee tran nn combin regress tree intern journal neural print function radial basi function network fuzzi infer ieee tran nn function fuzzi control rbf type approxim intern journal fuzzi system local linear model tree nonlinear system identif cool european congress intellig techniqu soft comput structur determin fuzzi fuzzi cart proc ieee intern confer fuzzi fuzzi cluster analysi method data analysi imag john wilei transpar fuzzi model fuzzi cluster pp compact fuzzi model complex reduct evolutionari proc ieee intern confer fuzzi san pp compact transpar fuzzi model classifi iter complex ieee transact fuzzi system improv continu attribut journal artifici intellig research fuzzi genet approach breast cancer artifici intellig medicin gener accur classif rule breast cancer artifici intellig medicin reason method fuzzi base classif int journal approxim reason
IR/586 5 path author tool lui richard frank shipman iii introduct center studi digit librari depart comput scienc texa colleg tx usa chang user work practic differ author support provid path project concept paper trace transit earlier author tool support integr author recent tool design work web applic teacher accustom hypertext long found research system part everydai live form web web academ busi entertain varieti amount inform web varieti reason inform har supplement classroom teach student teacher inform curriculum student learn pace make educ experi interact al document educ curriculum teacher student unrestrict access global inform issu web vast dynam medium canva exploratori learn valuabl mode student occur environ curriculum develop constrain provid context addit structur inform web orient classroom set student element collect multimedia librari potenti plai import role educ set al addit exist hypertext network make suitabl exploratori learn path type link conceptu similar inform hypertextu web bush suggest associ trail mean maintain inform base mental model path implement guid tour integr demonstr script path section paper briefli describ system teacher add document section describ earli implement author tool lesson learn describ concept implement set author tool section section discuss recent evalu author tool section present direct futur work conclud paper path path web implement path mechan path base metaphor link path point web document author path author document path point path support direct path path essenti list web page order path path aim incorpor inform curriculum addit text ad order contextu inform author provid context ad text annot individu page provid abstract path al detail discuss issu experi path found al al al path access standard web browser support frame figur show page path center studi digit librari browser window split frame bottom frame displai web page path refer view path interfac top frame content bottom frame frame displai widget navig path indic locat path link page displai bottom frame case reader view page path interfac inform icon displai overview path includ abstract short titl page path frame frame annot ad author annot explan document bottom pointer question student expect point note document inform satisfi goal path reader navig path sole click forward back arrow visit path order intend path visit page order choic click page number reader follow link document displai bottom frame explor space relat path reader imag replac content control frame shown figur reader explor space return locat path explor began singl click imag author path earlier tool author path complex inform requir number author activ path figur path interfac figur author step al locat web page evalu materi site select inform element path develop outlin path ad page url annot path step requir path author path author develop page locat inform inform creat path evalu approach provid effect interfac author path path author author search web resourc group select resourc path interfac tool shown figur tool queri web search engin find inform keyword author list page return search engin displai search page list page shift path workspac author add annot page author store potenti page workspac area path page path select view modif inform page displai inform panel bottom window altern version organ inform enhanc version al hypertext system design support inform analysi user abil place move inform symbol set space call spatial algorithm identifi structur implicit layout inform symbol enhanc interfac web search engin capabl support author path al author tool perform search return result collect author organ annot result workspac workspac save collect continu work save path tool author creat path select subset page workspac page url al author store inform collect refer approach implement sun sparcstat figur path author tool figur author tool limit portabl recent implement al investig approach futur earlier author tool provid integr support step involv author process author consist oper phase step mention author collect inform web ad path author creat path resourc store local file system save path move locat regist path gener author tool separ oper phase earlier author tool explicitli support author search page includ path provid interfac search web began project teacher accustom web author tool provid uniform interfac web search engin avoid requir teacher learn interfac develop author recogn teacher todai comfort web individu prefer favorit search engin attempt provid support search author decid assum inform locat handl system side design specif author interfac requir activ network open possibl path edit occur laptop locat home remov technic requir author interfac continu modifi chang interfac search engin concern intellectu properti owner search engin support provid author tool begin creation path web document select phase author decid web page page order annot written absenc network connect addit inform collect previou author collect addit path includ contact inform displai path viewer path overview path cach improv time page cach time access serv local cach page viewer path author includ period chang present problem current path structur author tool accept cach period amount time page fetch locat path creat valid durat author path solut student assign figur author inform dialog figur end current semest path expir date author inform dialog displai figur inform voluntari path author inform java applic backward compat read path creat earlier author tool path save format act path upgrad tool interfac illustr figur implement automat adjust window size depend size displai support screen pixel pixel displai interfac select optim displai paramet adjust displai interfac support addit modif page properti cach delet exist retract reorder page path support author publish path save local file system implement cgi applic access www author login www login password order publish unpublish path path publish displai person list path author modifi user password chang titl path featur interfac administr log remot author login modifi set administr add path visibl global space main list secur issu login handl exist technolog ssl socket figur illustr interfac evalu author tool intermedi school teacher colleg station independ school district evalu set author tool test usabl teacher web search engin find resourc path found author tool easi learn creat publish path tool short time teacher suggest addit featur improv util author tool suggest support featur copi url page directli browser window author add amount text line annot area featur author includ lengthi html tag annot break line teacher addit mode annot wrap text span width window identifi potenti usabl problem tool fix futur figur futur work expect user softwar chang time partli due work infrastructur path observ modifi function offer author support work practic time earlier version path author tool design support user web provid protect environ term interact data web tool focu support author process path author reli author gather inform path offer flexibl freedom author prefer collect data web evalu tool watch sign teacher troubl search inform workspac store page potenti futur path refer atlant august pp al path wide experi hypertext eighth acm confer april pp al acm confer ontario pp al implicit structur organ layout human factor comput chi pp al educ guid path june pp al present spatial iui august pp al path experi hypertext june pp al support emerg interpret visual knowledg technic depart comput scienc center studi digit texa tour tool commun hypertext acm transact offic inform octob pp hypertext path hypertext novemb pp acknowledg materi base work support nation scienc foundat grant particip teacher institut review board colleg station support evalu author tool
IR/587 5 layer approach inform retriev sharon sra intern fair lake court va usa abstract layer approach inform retriev permit multipl search engin multipl natur languag layer convert english queri search engin nlp layer incorpor morpholog noun phrase semant base wordnet introduct paper describ layer approach inform natur languag compon major element approach layer packag tm deploi form govern site nlp compon proprietari ir commerci includ pictur network intern simon john deer emploi abstract layer permit simultan queri multipl user enter queri queri pass server abstract part convert queri format tm tm topic tm boolean queri intermedi queri nlp mode queri undergo morpholog np semant convert illustr user queri translat queri natur disast england specif natur england semant main vermont connecticut nlp compon deploi pictur network intern origin commerci launch approxim imag oper world wide web adjust nlp compon continu activ includ addit semant net tune paramet weight retriev speed nlp compon averag semant perform advanc caption runtim make oper slow remaind paper describ nlp mode requir creat nlp techniqu natur languag process techniqu system includ inform retriev applic perez carballo import work li scale robust techniqu combin system queri larg nlp compon effect convent search algorithm architectur support user queri undergo type nlp detail element process contribut queri compon weight result natur disast expand term weight inform pass search engin layer natur extens layer design nlp search system text caption load word word relat semant net found base store relat displai word check made determin current word phrase correspond proper correspond process invok displai relat nicknam base link file current word phrase correspond locat process invok access displai locat relat virginia massachusett base link locat inform gazett support file current word phrase expand semant net link weight link strongli relat concept high remot relat concept receiv lower make exact match queri text caption car automobil list remot relat concept trunk current word phrase store index search process return word phrase text user queri token divid individu singl word variat convent pattern match singl word recogn match word part store treat singl word part made base content store pattern input pattern store pattern includ liter syntact categori semant categori govern exact match input match store pattern interpret independ word tagger make linguist statist inform tag part speech incom queri portion word match part speech consid part speech tag word strip queri word obtain word convent inflect morpholog word queri strip word word found deriv morpholog implement process check determin result word function word content word function word content relat concept word retriev semant net root word word treat requir exact match match locat identifi separ locat file noun phrase syntact unit identifi intermedi queri formul match index text caption match queri displai match displai top list current search implement build id concept text id list entri object text refer concept entri consist object id weight object id uniqu identifi posit integ assign object index weight reflect relev concept object posit integ add object exist object id weight insert id list concept relev text id list concept queri retriev combin queri id list id weight sort determin exist relev match simultan small number processor instruct pair section treat nlp issu detail semant wordnet semant base wordnet make retriev word simpli exact match suffer drastic constraint part retriev appli correct part speech context tagger loss preposit present problem problem larg restrict pictur show unexpect packag tabl treat preposit content work lead odd partial match tabl pictur packag solut involv intermedi treatment preposit mark part speech tag algorithm distinguish crane noun versu crane verb noun ambigu crane bird piec construct equip addit disambigu perform manual larg volum text impract perform base corpu semant net applic incorpor inform varieti sourc extent order frequenc occurr text case photo caption consist sentenc wordnet subsequ order step top level semant net split event standard knowledg base support natur languag applic approxim link entri semant net suppli inform synonymi hierarch sophist closest danger rank subordin distant relat shake hand link adject danger brake brake contribut lesser amount rank yield lower rank return imag perfect match exact match inflect rank system configur return match rank tabl present weight relat wordnet depth figur level relat hypernym relev irrelev depth relat includ semant term depth rel weight weight figur hypernym make retriev retriev hyponym retriev weight level discount rate queri queri queri queri queri tabl depth wordnet relat relat part speech depth weight noun verb adj adv hypernym noun hypernym verb hyponym noun hyponym verb mem noun noun part noun mem noun noun part noun entail verb verb verb adj adv noun similar adj adj noun attribut noun attribut adj queri organ queri organ return imag match request ffl amorph amoeba blob retriev queri fact queri gener thousand hit practic number level limit excalibur retriev limit expert user elimin word queri recognit limit term aspect system depth weight figur tune trial error corpu hundr thousand pictur caption longer weight file affect imag select affect relev order user practic term mean queri exact match anim threshold set weight alter rank user longer imag list imag remov relev simpli downgrad wordnet design natur languag ir net requir tailor ir link high hierarchi anim retriev queri includ man men problem ffl link smile ffl link entri inappropri commerci system remov order avoid give singl word user emploi queri polysem term inadvert edit singl word reorder disabl user feedback retriev behavior user found battl indian languag retriev imag user link queri user forgiv understand bad match patient view random behavior made difficult user trace logic work languag evolv term task common requir miss term number dozen wordnet coverag gazett integr locat process gazett relat file gazett govern messag understand confer extrem larg larg algorithm select choic made moscow town relev citi russia gazett inform administr unit rough data citi develop algorithm largest administr unit higher york interpret state citi citi size larger citi weight higher explicit design understood york state york citi unambigu refer state refer moscow state weight higher georgia understood countri basic gazett hierarchi permit lo angel san francisco queri california alia tabl convert state abbrevi variant washington district washington dc eastern base chang polit handl queri northern initi step includ latitud longitud inform unit montana cover north northern montana addit locat match fly pattern treat unit retriev nation park mount hood treat phrase accomplish pattern base finit state oper simpl pattern syntact pattern pattern matcher perform noun phrase pattern core noun identif core np trail preposit phrase make distinguish stock car car queri girl red retriev girl red shirt prefer girl blue shirt red hat exampl imag return girl red shirt rate ffl smile young girl wear match jean red shirt older girl wear blue cap sidewai yellow younger girl wear yellow cap sidewai ffl african american girl wear red color ti sit pattern rug floor ffl young girl bright red shirt read book sit chair leg fold hedg garden surround girl wood thick green leav li nearbi ffl young girl red shirt smile reveal brace teeth imag lower red shirt sentenc noun phrase rate plai role red modifi shirt rate appli core noun preposit modifi ffl young girl blue shirt present gift father father wear red shirt imag girl shirt lower rate red shirt mention imag rank ffl laugh girl wear hat red purpl blue jean fulli ir exampl match full nlp slow partial match lead photo output pattern yield weight prefer syntact similar match scrambl partial match weight file np multipli scale noun set rel weight head noun scale modifi set rel import modifi half scale phrase set rel weight entir noun compar rank valu effect multipli noun modifi cumul recognit pattern basi recognit support recognit person organ element mark mark prefer retriev expand match relat form bob match bob work match senat robert recognit pattern emploi larg file set simpl alia nicknam variant singl line file variant deriv manual standard includ book interact develop interact subsystem pose challeng problem conflict data file layer approach good softwar engin system maxim modular modul util type inconsist conflict area morpholog semant boolean logic made cooper section describ problem interact address solut tighter data conflict subsystem access singl share data file case address loosen provid backup case inexact data coordin morpholog analyz stem differ complic synonym lookup problem solv wordnet morpholog morpholog variant creat advanc stem lookup process switch wordnet morpholog simpl issu remain pi list pi pie tagger train collect wall street journal articl present domain special train data set sort perform search independ part speech match found initi part speech choic tagger mark short verb short wordnet find verb search broaden part speech wordnet possess token separ turn nicol nicol full form wordnet fix prefer full form word strip root word incorrect result word tabl english boolean english boolean mean rule wordnet locat complet gazett major gazett multipl york state reconcil gazett locat recast effect branch wordnet semant hierarch organ attach wordnet node recast enabl advantag wordnet gener citi match light philadelphia street preserv gazett prefer boolean oper english word ir system ignor yield counterintuit result treat oper stop word discard perform special handl standard set boolean expand set synonym insect ir system simpli discard turn insect retriev item user avoid convert term tabl boolean oper evalu evalu primari goal commerci work softwar robust accur satisfi pai chang featur improv step custom concern match explain elimin major custom complaint accuraci make bad system explain convinc system basic accuraci custom rare test rare pictur enter success relat queri compar match set complaint recal initi stage system develop ensur pictur retriev reliabl test recal control earli phase test set imag manual photo queri submit photo research process difficult match hard determin credit assign match match human research test live system easier system imag request girl red shirt offer girl kind shirt buri imperfect match beneath highli accur match test queri full bad partial match rank complet count top imag rate recal test subset creat limit criteria imag orient photograph recal test compar queri result featur ad noun phrase syntax rank work test seri relat penguin swim retriev imag swim penguin recal test relat queri comparison keyword search excalibur major test occur major result wordnet rearrang frequenc order base caption initi imag retriev combin noun phrase syntax recognit improv recal fix point attempt test capabl recognit plai larger role improv noun phrase syntax accord previou literatur contribut noun phrase syntax manual improv preliminari experi perform wordnet manual complet untag corpora strictli photo correct answer case corpu includ data provid interest preliminari stage measur ensur test constraint result consist shown measur princip effect tag untag irrelev caption show lack tag correct match miss cross match score bad match match score match incorrect match expect partial match follow good match top ten match score reason score hundr thousand match impract actual care match match top ten matter threshold set match definit threshold perceiv provid insight system perform eleven queri score score untag corpu remaind score corpora term corpu score untag corpu score figur artifici cross match score futur direct futur work concentr speed space determin subcompon nlp capabl incorpor exist ir packag ir answer question item retriev specif target user step system incorpor automat caption select wordnet ambigu word interest determin special photo perform significantli brown corpu refer stochast part program noun phrase parser unrestrict text confer appli natur languag zhai analysi unrestrict text inform retriev annual meet associ comput linguist santa june digit librari imag retriev intern confer multimedia comput system pp digit imag innov method sell color imag intern symposium data commun societi instrument engin octob manual inform accompani standard corpu edit american digit comput depart brown ri evalu phrasal cluster text categor task acm pp croft term cluster syntact phrase acm pp thoma semant concord identif arpa workshop human languag march pp natur languag process text retriev task text retriev confer nation institut standard march pp perez carballo natur languag inform report text retriev confer nation institut standard march queri relat acm sigir pp
IR/588 5 find similar document multipl text clement yu liu wu meng rish dept illinoi il dept comput suni ny school comput florida intern fl abstract present methodolog find similar document multipl text queri posit integ methodolog consist step rank order document retriev order similar document queri rank ahead methodolog retriev similar document queri statist method provid identifi estim similar document number strategi present retriev document identifi result illustr rel perform strategi introduct internet vast inform sourc recent year consid world largest digit librari ordinari user find desir data search engin creat search engin defin set document search search engin index document creat store search engin term repres word combin index identifi document term quickli inform user research support nsf nasa aro store multipl search engin case user find paper subject area desir paper scatter number publish substanti effort user search identifi paper retriev paper solut problem implement metasearch engin top local search engin metasearch engin interfac maintain index document sophist metasearch engin maintain inform content underli search engin provid servic metasearch engin receiv user pass queri local search collect result local search engin metasearch queri user invok multipl search engin closer examin metasearch approach reveal problem number local search engin metasearch engin care local search engin invok queri small fraction search engin suffici document queri order avoid reduc possibl invok useless search identifi search engin provid result queri pass queri identifi search engin exampl system emploi approach includ wai aliweb ggloss savvysearch problem identifi potenti search select problem user similar document local posit integ document retriev identifi carefulli retriev collect fusion problem studi select collect fusion problem identifi suffici condit rank document retriev similar document queri obtain order identifi similar emploi method estim number document high similar queri method extend method incorpor term depend adjac term show optim retriev similar document queri queri submit frequent suppli stanford compar perform method method compar wai retriev document rank order method result demonstr superior perform method paper organ section select problem collect fusion problem discuss detail context paper summari relat work section section sketch method method provid section suffici condit rank optim order retriev similar document method method shown rank optim queri strategi retriev document rank shown optim rank similar document rank ahead similar document retriev section result compar perform method method result involv method conjunct strategi retriev document rank present show percentag similar document retriev vari vari select problem collect fusion problem assum model repres document queri document simpli set word transform vector term weight weight term depend number occurr term document total number occurr term depend number document term rel total number document queri similarli transform vector weight similar queri document measur dot product vector dot product divid product norm norm vector xn pp normal similar similar function normal cosin function similar similar function queri similar document document largest document document distribut dm select problem identifi similar document order metasearch engin maintain repres repres approxim content queri compar repres repres arrang hierarchi repres compar queri address base comparison estim number document similar valu obtain combin estim determin threshold sum expect number document similar equal slightli larger section emploi method method solv select problem problem retriev document estim similar document internet local search engin autonom rank local retriev document local function local similar multipl similar document local queri determin similar comput global similar function local similar function global similar function similar function weight term depend number document term chang global imaginari union local local similar document respect local differ respect global earlier paper solut problem transform threshold global global local threshold local document global similar set document local similar set smallest indic tight local threshold solut metasearch engin modifi user queri submit local search engin local similar modifi queri document local global similar origin user queri document actual global similar document local determin assum identifi document decid document retriev identifi make global similar document shown user simpl strategi retriev document largest global similar merg sort descend order global similar top document ensur optim chosen similar document rank ahead similar document retriev total number document retriev number identifi issu fewer document retriev lose similar document unnecessarili relat problem select algorithm rank order cutoff document consid document ahead rank interest retriev strategi determin document retriev return user relat work solut select problem roughli classifi categori naiv approach perform select metasearch engin simpli send user queri search engin approach emploi metacrawl rough approach repres content rough word paragraph repres typic manual made suffici inform select system emploi rough approach wai aliweb search broker qualit approach detail inform document frequenc term repres content base rank score comput reflect rel queri score number potenti document qualit approach emploi version ggloss cori net quantit approach detail inform repres content directli estim number potenti document estim approach belong categori quantit approach vector approach binari independ case document repres binari vector ith posit absenc presenc term term assum independ method extend binari depend case substanti amount inform lost document repres binari vector repres ggloss estim document potenti estim method shown accur estim method emploi base restrict assumpt approach make past retriev experi respect determin savvysearch approach savvysearch rank local search engin estim number potenti document method select base estim probabl relev distribut document relev feedback obtain reason estim distribut solut select problem discuss method quantit approach develop extend solut collect fusion problem classifi categori local determin approach simpli local search engin return document retriev ncstrl emploi approach user determin approach user determin document retriev local search engin metacrawl savvysearch approach sophist weight alloc approach retriev document local search engin higher rank score cori net emploi approach approach determin number document retriev local base past retriev experi algorithm base train queri probabilist model suitabl feedback depend accur estim paramet valu weight alloc approach heurist natur global potenti document retriev local search engin retriev approach aim properti algorithm guarant potenti document retriev unnecessarili retriev document earlier approach retriev approach goal minim number document retriev retriev approach import applic medic legal domain doctor lawyer find past case similar present case solut paper properti method retriev similar document queri result show approach similar document retriev queri length method estim present solut select problem section review method base independ model estim respect queri queri global similar defin number document global similar queri greater global threshold term weight nonneg real number occurr term document assum independ section present method extens method incorpor type term depend adjac term method distinct term document repres vector dm weight ith term repres queri similarli repres queri um weight global similar defin dot product respect um dm similar normal common normal similar function cosin function easili implement divid norm document norm queri suffici dot product similar function unnorm term weight discuss distinct term repres pair probabl term document averag weight set document queri um repres estim loss assum impli term document consid gener wr dummi variabl proposit relat coeffici term function probabl document similar proposit defin term independ weight term present document repres coeffici function probabl document similar queri term weight equal weight term queri document document vector compon queri term document queri term queri term weight document vector interpret similarli document document term averag weight term document gener function coeffici function sum probabl document queri term similar probabl document queri term similar coeffici estim probabl document similar expand gener function merg term obtain assum term list descend order proposit probabl document similar expect number document similar queri user queri request similar document local retriev local convert number global threshold user queri idea convert similar distribut list global easi determin list number document similar greater threshold similar distribut list desir global threshold easili found total number document similar greater slightli larger case document global illustr continu express base expand express proposit obtain similar distribut list number global similar number estim number document similar greater equal number pair obtain term express pair obtain combin term express pair comput similarli number pair round pair number modifi similar distribut list distribut list document similar higher queri document similar higher similar distribut list local determin desir global threshold similar document easili similar distribut similar document threshold similar document threshold global threshold desir threshold found similar threshold largest integ satisfi queri base threshold number document similar queri greater estim est unrealist assumpt proposit assumpt weight term uniform document term realist term necessarili independ estim inaccur method remov assumpt method section present method tackl assumpt term queri base polynomi factor gener function document unnorm weight unnorm weight term averag unnorm weight term document term estim polynomi form form assum queri weight term unnorm weight normal weight weight distribut improv model partit document term subset subset document lower unnorm term weight weight involv document larger weight weight polynomi gener ik actual weight set document number document term total number document ik partit weight rang subrang possibl length wm ij median weight assumpt weight distribut term wm ij approxim averag weight standard deviat oe easili distribut term weight approxim term uniform weight wm ij document term weight fall weight queri term polynomi gener function replac wm wm il wm il ij probabl term occur document weight jth polynomi obtain probabl probabl subrang polynomi rest estim process ident earlier incorpor maximum normal weight express add compon mw mw maximum normal weight term number document local expect number document maximum normal weight reason document normal weight sum probabl adjust method assumpt term independ distribut proposit realist term frequent arbitrarili chosen word present method remedi term independ assumpt method incorpor type depend adjac term distribut term document set document document largest sum normal term weight normal term weight largest sum call maximum normal weight combin term denot ij term combin singl probabl document maximum normal weight combin ij assum number document point document maximum normal weight combin term term independ distribut document probabl document normal sum term weight ij term estim estim method polynomi repres probabl document maximum normal term weight probabl document percentil weight term written polynomi written term multipli polynomi desir probabl estim criteria term combin singl term ij estim probabl term independ assumpt maximum normal weight combin term higher maximum normal weight individu term aim estim similar similar condit ensur combin term lead smaller similar condit implement comput differ absolut estim probabl compar preset threshold differ exce term combin differ term pair denot ij store combin term ij term obtain document term distribut sum normal weight term appli method combin term combin term ij store maximum normal sum ij averag normal standard probabl occurr differ ij quantiti util determin term combin term queri explain user queri normal term weight maximum normal weight term mw mw polynomi term maximum normal weight combin term greater mw mw multipli probabl document total normal weight higher probabl base assumpt term independ actual probabl estim probabl actual probabl differ term combin term pair test number term test process time consum order process easili carri restrict term queri term term submit pair term adjac locat queri condit simul phrase compon phrase adjac locat estim distribut similar queri document term queri combin restrict combin term individu term essenti decid term queri term term combin adjac term queri term combin combin term phrase consist word simpler recogn phrase word phrase check combin term ij exist combin term ij check combin term jk exist combin term compar differ ij jk larger ferenc term combin term queri jk larger ij term combin distribut combin term estim distribut similar document queri combin term combin term combin term term combin term suffici condit rank optim present method retriev similar document queri multipl base prove suffici condit rank similar document retriev notic estim method section estim global similar similar document local rank descend order estim similar similar document sim estim similar similar document sim sim sim rank order present retriev similar document queri basic idea retriev document order similar document obtain top obtain actual global similar similar document minimum similar obtain document actual global similar greater equal document algorithm termin consid similar document retriev actual similar document compar minimum similar threshold obtain document actual global similar greater equal threshold algorithm retriev similar document actual global similar document similar equal current number document retriev retriev similar document actual global retriev document document actual global similar ii retriev document actual global similar sort retriev document descend order actual global similar return top document algorithm properti proposit set similar document uniqu gener uniqu due ident similar document select method rank higher similar document queri retriev loss assum document actual global similar similar document document similar actual global similar similar document base algorithm document actual global similar greater equal retriev document document similar retriev document document retriev base definit actual global similar similar document notic similar document uniqu document actual global similar greater retriev step algorithm top examin depend true similar document retriev top correctli identifi note set proposit algorithm document set similar document retriev set document rank higher proposit result select rank correctli respect queri rank algorithm similar document respect queri retriev estim accur number similar document long rank properli select method produc accur necessarili perfect rank base estim give good result proof proposit similar document rank ahead algorithm examin minimum number addit examin algorithm proposit set similar document document retriev correctli method conjunct document retriev strategi algorithm method maximum normal weight term queri singl maximum normal weight term actual global similar similar document respect queri rank descend order similar similar document similar maximum actual global similar document smaller similar similar document rank higher proposit similar document retriev observ made result observ end step algorithm slightli document retriev number document retriev addit document retriev examin actual global similar greater equal actual global similar similar document addit number document retriev step observ import assumpt implicit algorithm similar document respect global similar obtain number wai implement retriev number document chosen local similar function emploi select algorithm retriev time estim number similar document posit constant actual global similar document determin similar document document save cach step algorithm modifi queri local similar modifi queri actual global similar origin queri illustr situat origin queri document global function paramet valu global local similar function paramet valu determin local modifi queri easili verifi inform common document frequenc weight document frequenc term global number document term global document frequenc local variat model paramet bs approach appli standard cosin function document frequenc weight observ algorithm examin time altern appli select method method method identifi similar document number retriev highli rank find actual global similar similar comput minimum similar retriev document actual global similar greater equal document examin fewer iter effici algorithm improv document retriev strategi algorithm nice properti reflect proposit drawback problem incorrectli identifi similar document realiti actual global similar similar document significantli similar document illustr similar document select method rank order actual global similar similar document smaller similar document document actual global similar higher similar document document prevent similar document retriev problem drawback avoid extent modifi algorithm observ number examin result present remedi result result report result experi form articl pose newsgroup internet articl collect stanford newsgroup articl form separ smaller newsgroup merg produc larger tabl show size number distinct term collect document queri real user experi queri collect stanford term tabl experi compar perform method method rel ideal method determin similar document optim ideal method implement comput actual global similar document directli similar rank ideal method applic read metasearch engin comparison method chosen similar rank estim number document local similar greater equal threshold method estim number document local similar greater equal threshold base queri term document queri term document term term fn document frequenc queri term document document highest similar weight term sum weight document document similar document similar largest number satisfi threshold number document similar greater threshold estim earlier paper compar estim method method term estim accuraci individu comparison base retriev similar document multipl measur percentag correctli identifi similar percentag correctli identifi document similar experi perform design ideal method queri set similar document posit integ number method method determin chosen estim method top retriev similar document choic method differ method chosen retriev est number document est number number document estim similar document paramet vari estim number document suffici retriev chosen est number sum estim number chosen slightli estim number valu ideal method identifi correct similar document desir document method method identifi number necessarili percentag correctli identifi document tabl show method retriev correctli identifi versu correctli identifi number similar document denot percentag correctli identifi denot percentag correctli identifi document averag improv method method identifi improv rang larger improv smaller valu tabl show result correctli retriev similar document valu averag improv method method identifi document improv rang larger improv smaller valu tabl method set experi consist appli method retriev algorithm identifi desir desir document unlik set number desir queri algorithm method rank estim similar similar document invok retriev strategi retriev document rank order tabl show result tabl method measur shown algorithm identifi desir desir document number similar document retriev percentag desir desir document reach number document percentag tabl result retriev algorithm develop algorithm retriev similar document respect queri collect suffici condit algorithm retriev desir document desir document rank higher rank base similar similar document respect queri algorithm requir accur estim number similar document result show method conjunct retriev strategi number desir document retriev averag retriev averag desir document result limit scope perform experi larger collect queri futur refer fox world wide web queri virginia polytechn institut state baumgarten probabilist model distribut inform retriev acm sigir bruce croft search distribut collect infer network acm sigir experi select search engin metasearch acm juli paepck stanford internet acm sigmod pp gener gloss broker hierarchi intern confer larg data gener gloss broker hierarchi technic comput scienc stanford report discuss estim defin paper disjoint scenario discuss merg rank heterogen internet sourc intern confer larg data harman overview text retriev confer edit comput system depart engin learn search engin queri ai inform data research agenda inform data manag nation scienc march saracev real life inform studi user queri web acm sigir inform system corpor wide area inform server technic report machin april koster index web comput network isdn pp kowalski inform retriev theori implement kluwer academ lee gile search world wide web april pp yu cluster search algorithm incorpor arbitrari term depend acm transact septemb kl wu rish statist method estim text technic report depart illinoi search broker usenix symposium internet technolog system pp rish determin text search internet intern confer larg data york rish estim search engin intern confer data engin march network comput scienc technic report salton mcgill introduct modern inform retriev salton automat text retriev inform comput addison etzioni search comparison metacrawl intern world wide web decemb etzioni metacrawl architectur resourc aggreg web ieee bucklei mitra pivot document length normal acm sigir learn collect fusion strategi inform retriev intl conf machin learn collect fusion strategi acm sigir sift tool inform dissemin usenix technic luk siu estim number desir record respect queri acm transact march meng principl queri process advanc applic morgan san lee server rank distribut text resourc system internet intern confer system advanc applic april pp
AI/589 2 learn perceiv world approach hierarch learn system jun tani soni comput scienc laboratori muse japan tel fax email stefano nolfi institut nation research council vial marx itali abstract paper describ agent learn intern model world structur problem articul develop learn scheme mixtur recurr neural net expert set rnn modul expert multipl level order account categori flow robot experi autonom switch activ modul lower level repres articul flow set rnn higher level compet learn sequenc modul switch lower articul abstract level achiev scheme examin simul experi involv navig learn problem dynam system analysi clarifi mechan correspond articul mechan attent switch mechan loop discuss origin version manuscript publish proc int conf simul adapt ja meyer sw wilson mit version press neural special issu introduct system attain intern world structur organ consensu cognit scienc artifici intellig complex world repres effici util modular hierarch structur symbol system modular hierarch analog neural system mean iter interact difficulti li question continu flow perceiv articul sequenc repres modul kuniyoshi address articul problem robot learn context experi assembl robot recogn task perform sequenc modular robot learn task term combin reusabl modular obtain attain modular task perform tempor segment mean detect observ sensori flow definit predetermin design investig robot defin perceiv continu task perform segment reusabl modul robot navig long research face type problem basic type approach neural network learn approach show simpl local problem robot solv topolog preserv map scheme difficult scheme plain singl neural network organ modular hierarch structur learn content approach machin learn navig travel robot tempor segment mean landmark turn encount straight corridor tempor segment enabl abstract robot experi simpl chain landmark type scheme readili neural network learn approach landmark plai role repres modul problem landmark defin necessarili percept robot repres modul problem gener robot experi attempt explain problem articul structur format modul hierarchi dynam system perspect smith van structur coupl intern neural dynam dynam neural architectur inspir modular hierarch learn method neural mixtur expert jacob al scheme examin conduct simul experi robot navig mechan articul clarifi qualit dynam system concept coher phase transit discuss briefli correspond mechan articul mechan attent switch place loop predict learn flow paper introduc robot navig learn prototyp simul experi illustr set primit emerg enabl construct higher level dynam fashion hierarch learn approach develop combin predict learn scheme learn predict sensat mean system acquir analog model target observ elman show recurr neural network learn predict word sequenc extract regular hidden sentenc tani appli rnn predict learn navig learn problem robot learn predict futur sensori sequenc depend action sequenc workspac shown real mobil robot rang sensor learn structur workspac hidden flow structur environ repres attractor dynam rnn predict learn shown intern model obtain rnn attractor dynam util gener mental plan behavior crucial critic scheme predict sensori input made temporari discret manner mean predefin branch mechan branch plai role landmark invok tempor segment flow experi attempt elimin type predefin mechan tempor segment hope robot find implement tempor segment flow focu magnitud chang time nolfi robot travel straight wall rang imag invari state chang dramat robot encount corner start turn left rapid chang signal segment behavior straight wall turn corner difficulti scheme corner behavior segment time state rapidli corner process clear chang state singl moment partial inform behavior process specif mechan requir time interv behavior corner recogn uniqu event extract specif structur flow scheme paper multipl modul compet expert predict flow specif behavior expert achiev statu learn process modul rnn win predict flow travel win straight wall switch win rnn modul correspond tempor segment flow essenti point scenario segment place mean pronounc observ dynam structur tempor differ state highli pronounc correspond switch dynam rnn learn specif flow rnn learn flow special modul determin process learn competit modul simultan process recognit learn result gener specialti section introduc architectur call mixtur rnn expert extend origin idea mixtur expert jacob al architectur figur show architectur mixtur rnn expert flow figur fig show hierarch architectur consist level gener rnn modul lower level receiv output predict input time form shown fig total output network obtain weight averag output gate open time modul gate open comput dynam time predict error obtain differ predict outcom gate open modul produc lower predict error modul modul lowest error suitabl time interv winner origin work mixtur expert gate network select modul closest correspond target output gate network modul activ autonom result dynam competit modul time util monitor predict error win modul modul profil flow time higher level network learn gate open dynam lower level network rnn modul higher level sampl gate open state lower level current time step make predict time step shown fig denot time step higher higher level sampl interv larger lower level modul higher level compet gate open shown lower result gate open higher level manner higher level network observ lower level activ mean perceiv gate open dynam lower level network perceiv flow signal abstract level algorithm subsect describ mathemat formula scheme singl level network consist rnn target output teach gate open modul correspond state gate open state depend level network activ function repres gate open current intern gate open total output network defin likelihood function maxim predict obtain modifi origin definit jacob al ln ln ky oe denot scale paramet weight rnn gate open updat simultan likelihood function maxim point essenti onlin learn scheme order obtain updat rule partial deriv logarithm likelihood function respect intern respect output rnn oe posteriori probabl modul rnn gener target vector term ky ky ky repres squar error current predict eq denot direct updat intern gate open differenti ln respect involv error term weight posteriori probabl modul rnn shown eq connect weight rnn adjust correct error output rnn global target proport posteriori probabl individu rnn expert input sequenc learn error distribut modul rnn error detail deriv eq eq ref obtain mathemat actual updat gate open connect weight rnn comput backpropag time algorithm sequenc input gate intern state previou step store tempor window memori input window memori shift step forward backward comput mean iter final sequenc step gate intern state connect weight rnn modul updat updat ith gate intern state kth step window obtain ffl term side equat repres direct updat obtain eq term repres damp term suppress abrupt gate ffl paramet updat comput forward direct window memori error obtain eq window memori updat connect weight obtain mean steepest descent method util paramet learn rate ffl momentum ff simul experi environ scheme investig context navig learn problem simul assum mobil robot sensor belt forward side hold laser rang sensor perceiv rang imag surround maneuv manner variant potenti method detail maneuv ref tani adopt room room connect shown fig fig fig show flow correspond robot travel dot line fig robot travel room enter room newli open door travel room time learn experi conduct robot move room total room encount entir travel robot simul step lower level consist rnn modul hidden unit context learn predict state step note rang sensor valu rnn learn reduct comput higher level consist rnn modul hidden unit context learn predict gate open state lower level network step paramet set network ffl ff ffl set level sampl interv higher level time longer lower level observ modul hierarch manner gate open dynam place predict learn level result record gate open dynam lower higher level entir learn process gate open process lower level network figur show time develop gate open state motor input lower level period figur figur illustr modul win lower level network travel period figur fig show profil period step step robot travel room time open turn profil motor command fig open correspond straight open correspond left turn corner pass fig show profil period step step robot experienc room time open turn fig show open event correspond straight make turn corner make left turn fig show profil period step step robot travel room time remark find gate open dynam period differ observ encount room fig open correspond make left turn corner pass previou correspond make left turn open correspond pass learn process network stabil dramat correspond gate open found end type concept gener rnn modul modul lower level network import observ process gener concept total dynam correspond rnn modul behavior static learn process describ gate open dynam higher level network figur show open gate period learn step number graph denot step number lower figur stabl switch gate open place step switch correspond movement room open state correspond travel room room observ open begin robot travel room time dynam replac room evid place modul lower level network note readili understood dynam higher level network stabil stabil occur lower level network result obtain simul conclud architectur success learn environ hierarch interact robot lower level network learn predict row profil flow organ modular specif behavior higher level network sequenc segment behavior creat higher concept room robot perceiv current flow recogn background context behavior situat repeat learn experi time initi condit includ start posit robot room room random initi connect weight network structur higher level network modul structur previou repres room room found case observ lower level structur case found modul structur previou result structur case case observ clear modul structur separ room higher observ lower level structur continu chang gradual prevent higher level structur stabil stabil higher level depend substanti lower level result reveal process arriv optim solut gener unstabl structur chanc studi requir detail understand problem hierarch learn scheme analysi discuss dynam mechan articul build block repres specif structur lower build block higher level construct combin lower level result interpret emerg intern definit tradit cognit scienc studi scheme articul extern design view view robot experi articul emerg interact system environ put forward attempt explain qualit mechan articul dynam system perspect order understand switch modul place dynam room examin time seri predict output rnn modul higher level network figur show time seri predict output error rnn modul higher level network record step step period robot move room room figur fig upper row repres sequenc predict output rnn modul squar align vertic column row repres valu predict input sampl gate open lower level size largest squar area correspond area correspond bottom row repres sequenc input robot move room room step line fig show time seri predict error modul fig observ predict error rnn continu minim rel rnn step fig output sequenc rnn coher input sequenc rnn rnn rnn activ rnn activ input sequenc output sequenc rnn coher input sequenc step minim output sequenc rnn lose coher input switch win rnn modul place quickli iter step rnn specul robot recogn surround room mean achiev tempor coher dynam rnn modul dynam order investig essenti dynam structur organ coher coupl intern dynam compar phase trajectori rnn modul dynam coupl dynam room room figur show comparison figur plot upper row figur show phase trajectori dynam rnn rnn iter autonom input sequenc instal loop predict output input autonom iter rnn correspond mental learn tempor plot activ trajectori context unit autonom iter fix connect weight rnn obtain step previou experi observ trajectori rnn rnn rnn converg fix point rnn rnn converg point gener invari closur phase space analysi show dynam structur rnn rnn fix point dynam structur rnn rnn attractor plot middl row bottom row show phase trajectori coupl rnn dynam room room phase trajectori plot context unit activ state receiv input sequenc robot travel room rnn rnn rnn gener fix point attractor dynam rnn coupl room room plot rnn rnn rnn exhibit similar phase trajectori coupl room rnn coupl room observ coincid previou observ predict sequenc rnn rnn coher input sequenc travel room room previou work studi mobil robot learn predict sensori sequenc navig learn shown rnn learn structur hidden environ attractor dynam mean interact analysi show predict process success coher achiev intern rnn dynam dynam coher perturb coher mean intern rnn dynam dynam mechan explain autonom switch modul current modul activ manner inhibitori achiev coher dynam specif dynam structur hidden input flow essenti dynam structur input flow activ modul lose coher modul activ gain coher flow win modul switch place quickli phase transit dynam state stabl attractor mean switch coher repertoir phase transit result articul system perceiv intern structur flow schemat diagram explan figur figur chain state function import aspect discuss relationship state function hierarch learn direct observ state inform present process state evolv wai structur hidden time develop structur similar case state chang quantit basic adapt type dynam captur similar structur observ time develop state time develop state repres rnn function higher level observ rnn function activ lower level term gate open state gate open state vari result structur chang lower level result time develop gate open state captur rnn function higher level aim hierarch learn organ chain state function level abstract articul attent switch observ modul switch mechan relat attent switch mechan loop explain term metaphor creat mean gate mechan nucleu cortic feedback nr gate transmiss process cortex attend part data select taylor newman gate nr induc global competit loop result compet sensori stream reach macroscop explan dynam mechan articul scenario gate correspond nr rnn expert correspond cortic part attent switch set loop accompani nr gate plai essenti role articul stream multipl level creat symbol concept suggest moment articul accompani dynam switch loop relat work current studi inspir adapt agent research base dynam system approach beer beer notabl dynam system coher structur coupl intern system dynam explain low level behavior walk leg agent simpl visual guid behavior current attempt appli dynam system approach question cognit introduc mental process anticip agent found anticip plai essenti role cognit mechan articul illustr articul input flow trigger predict futur event tempor structur coupl plausibl cognit achiev util coher interact intern dynam initi review process paper author inform relat studi studi discuss al appli scheme anneal competit expert segment time seri complex system basic idea scheme similar segment time seri achiev mean dynam competit expert emploi central gate network singl layer network consist set radial basi function modul train manner anneal techniqu learn process stabil compar case rel easi train radial basi function manner address issu hierarch organ modul author extend mixtur expert system model tempor process wolpert extens multipl pair forward model singl layer organ util control motor output predict sensori input suggest anatom observ motor control function model multipl pair forward model hierarchi rnn learn sequenc sequenc segment mean detect predict error rnn level error larger threshold time sequenc segment step kei symbol higher level sequenc segment lower level main differ scheme sequenc segment mean dynam competit expert predefin threshold valu specul dynam competit mechan natur robust compar scheme recent method call learn bridg minim time lag long time step enforc constant error flow error special unit multipl gate unit learn open close access constant error mechan analog gate open mechan mixtur expert paper address directli issu multipl level articul current paper ring hierarch learn scheme sequenti task learn combin task mean reinforc learn hierarchi ring system built discret sensat action system scheme appli directli problem articul continu flow scheme hierarch learn system mixtur rnn expert scheme examin simul experi navig learn result robot learn articul continu flow dynam modular hierarch structur intern manner multipl level explain observ mechan articul qualit dynam system languag discuss correspond attent switch mechan approach develop wai futur consid paper limit predict learn flow futur develop motor mechan scheme extend cover ensur action gener plan carri util acquir intern dynam ref tani limit present studi interact process undertaken pathwai architectur gener model process interact process modul activ mean interact dynam predict higher level network signal lower level network futur studi behavior gener extens scheme shortcom mention refer bj theater workspac mind oxford press dynam system perspect interact artifici evolut dynam neural network minim cognit behavior pollack wilson anim animat mit press hmm architectur jd tesauro advanc neural inform process system mit press follow learn speak imit social robot master dept uk sj mixtur control jump linear plant ds touretzki tk leen advanc neural inform process system san morgan kaufmann function hypothesi proc nation academi find structur time cognit mode analysi ring larg number mutual coupl van der pol oscil ieee tran circuit long memori neural adapt mixtur local expert neural hierarch mixtur expert em algorithm neural obstacl avoid manipul mobil robot int robot format topograph correct featur map biolog cybernet sensor space mobil robot navig int conf intellig robot system qualit approach robot explor map learn aaai workshop spatial reason learn extract reusabl task knowledg visual observ human perform ieee tran robot integr robot ieee tran robot mi estim depend structur hidden variabl mi mj kearn tk leen advanc neural inform process system mit press flexibl control mobil robot autonom compet acquisit measur comput scienc symbol search commun physic symbol system cognit put puzzl part gener theori neural correl journal extract regular space time cascad predict case mobil robot navig structur environ anneal competit expert segment classif switch dynam neural induct dynam recogn machin continu learn reinforc environ phd texa austin learn intern error propag de rumelhart jl mcclelland parallel distribut process mit press learn extend sequenc principl histori compress neural dynam theori applic autonom robot architectur robot autonom dynam system approach develop cognit action mit press embodi cognit aaai fall embodi cognit interpret dynam system constructivist approach journal learn mobil robot navig dynam system perspect ieee tran man cybernet part jg fn mathemat analysi competit network attent jg mathemat approach neural network lawrenc erlbaum van dynam hypothesi cognit scienc behavior brain press embodi mind mit press multipl pair forward model motor control neural network sequenti behavior learn evolv dynam neural network adapt behavior robust navig real world neurocomput list figur complet architectur mixtur rnn expert predict learn hierarch learn detail rnn modul learn flow lower rnn modul learn gate open dynam higher level simul workspac consist room connect door time develop simul rang imag robot travel time develop open gate motor input lower level network period number data denot current win gate trajectori robot travel dot number modul win number denot step number modul switch place gate open dynam higher level network process learn show sequenc input bottom predict output rnn modul upper higher level network time depend predict error rnn modul phase trajectori rnn modul higher level shown dynam coupl dynam room room upper middl row bottom dynam mechan articul input flow articul coher flow switch repertoir dynam multipl modul rnn rnn rnn rnn rnn rnn predict predict sensori motor context gate open state context higher level sampl figur complet architectur mixtur rnn expert predict learn hierarch learn detail rnn modul learn flow lower rnn modul learn gate open dynam higher level door left time figur simul workspac consist room connect door time develop simul rang imag robot travel input gate gate gate gate gate volum step number step number step number gate input volum gate input volum figur time develop open gate motor input lower level network period number data denot current win gate step step step figur trajectori robot travel dot number modul win number denot step number modul switch place gate gate gate gate gate step number gate amplitud figur gate open dynam higher level network process learn step number rnn rnn rnn rnn input rnn room room step number rnn rnn rnn rnn rnn error figur show sequenc input bottom predict output rnn modul upper higher level network time depend predict error rnn modul coupl coupl rnn rnn rnn rnn rnn figur phase trajectori rnn modul higher level shown dynam coupl dynam room room upper middl row bottom input flow figur dynam mechan articul input flow articul coher flow switch repertoir dynam multipl modul
Agents/590 1 mobil agent web approach paulo paulo silva portug abstract mobil agent paradigm approach develop distribut system work project overcom limit found term programm usabl mobil agent paradigm real applic framework agent platform applic simpl javabean compon approach agent arriv departur directli interact insid paper discuss experi integr compon web enabl receiv send agent approach involv wrap compon insid java servlet includ web server support servlet specif servlet enabl server receiv send agent queri local enabl agent behav servlet approach depart current system enabl exist web server support servlet specif send receiv agent straightforward introduct mobil agent small thread execut migrat machin perform oper local interest applic area mobil agent internet comput mobil agent provid attract paradigm area agent launch navig collect inform perform final return home good result scenario attract wireless mobil devic place easi imagin scenario user launch gather agent shutdown devic reconnect hour collect result scenario agent find deal user autonom system provid integr mobil agent web server follow basic model involv instal agent platform unawar integr agent migrat agent platform interact web server normal differ local approach oper queri inform monitor limit function implement agent hard agent publish inform extend function server migrat agent agent repres web page server user remot interact approach consist develop web server host agent problem typic web site replac exist infrastructur case web server robust scalabl site difficult web site manag accept replac web infrastructur technolog approach mobil agent provid attract conceptu framework comput small thread migrat server perform difficulti address difficulti prevent widespread adopt technolog kei problem user provid psycholog resist infrastructur reliabl paper deal primarili infrastructur integr problem work project overcom limit found term programm usabl mobil agent paradigm framework agent platform applic simpl javabean compon applic develop current approach send receiv agent binari softwar compon approach agent arriv departur directli interact insid paper discuss experi integr framework compon enabl receiv send agent approach involv wrap compon insid java servlet includ web server support servlet specif servlet enabl server receiv send agent queri local enabl agent behav servlet experi framework web secur mechan framework correctli run integr secur architectur server import characterist approach forc agent server integr web requir special web server provid framework exist web give capabl agent oper rest paper organ section overview framework section discuss develop section present work overview distinct characterist framework agent platform agent arriv leav applic part agent platform applic incorpor binari softwar compon code compon give applic capabl receiv interact mobil agent applic develop current industri softwar method integr mobil compon call approach applic centric mobil agent system applic central mobil agent part system plai specif role consequ design applic agent agent back pair distribut program technolog secur integr applic secur complet gener agent interact directli applic insid elimin setup interfac agent configur manag secur polici agent platform instal maintain distribut applic instal simpler manag separ infrastructur share larg number distribut applic polici requir agent accept applic mobil agent end user ad agent framework implement javabean compon center mobil compon compon basic support agent migrat extens mechan compon connect compon implement function commun persist main concern make core compon small time provid power extens mechan higher function connect mobil compon lightweight runtim footprint extens mechan rich reusabl compon compon select applic develop compon implement function code creat applic complet discuss project framework scope paper interest reader refer addit detail agent enabl web server interest build support mobil agent web server necess valid easi exist applic framework web creation web interest applic field paradigm fit web main requir integr mobil agent web server agent behav web resourc publish user web browser access interact dynam gener web page agent queri local inform present web server exist fact mobil agent forc exist server agent perform manag oper server requir base interest stud mobil agent distribut network applic manag kei idea build support mobil agent wrap mobil compon secur insid servlet servlet technolog simpl mechan extend function web uri object instanc instanc call process http request support servlet specif servlet engin connect web server provid servlet function architectur meet discuss architectur depict figur servlet encapsul framework compon configur includ resourc web server mean http request made request forward servlet servlet mobil servlet simpli perform function extens mechan base notifi interest compon run state agent publish inform web mean user remot interact control agent present run site http request http web server mobil compon servlet engin mobil servlet dispatch secur compon figur mobil servlet inform publish web accompani includ ident agent user click request forward term forward agent agent receiv agent save refer agent migrat event enabl refer import point web server decoupl servlet servlet function web server simpli provid map uri forward request servlet request correspond interact agent forward pass agent note decoupl web server servlet engin web server support servlet specif instal configur web server discuss agent interact web server framework concept servic agent mean agent arriv host queri request object implement servic interfac idea implement agent arriv web queri local web servic instanc behav publish inform agent requir object publish object pass requir agent implement servlet interfac http request made agent full inform request includ ip accept session inform import agent distinguish act agent request servic requir deni list onlin main point agent seamlessli regist interest process http examin characterist request interest point approach framework agent arriv interact applic agent access intern object applic mean agent access manag inform present insid web server enabl agent perform mainten task insid featur import aim project studi applic framework develop distribut manag applic agent access inform vari web server web potenti function import secur secur compon instanti protect servic agent host compon agent migrat host prevent tamper ey drop content agent implement author mechan agent correct permiss perform read directli connect host network compon implement cryptograph primit secur protocol inform gather mobil implement easi main difficulti secur secur manag instanti time jvm framework compon run insid secur manag framework reli fortun java platform standard redefin secur implement verifi java method secur manag longer overridden java architectur deleg mechan runtim permiss class check autonom long servlet engin chang secur manag conform java secur compon check runtim permiss action found situat engin main problem solv secur resourc control java platform includ method complic issu investig possibl resourc control librari implic term runtim penalti current perspect experi framework web server servlet posit result test system jigsaw web server jw servlet engin test apach web server main straightforward enabl web server receiv long support servlet common case server experi framework good approach integr mobil agent exist web infrastructur main limit found framework resourc control framework usabl secur intranet extranet type network creat account author log mechan present hold user account futur standard resourc control mechan introduc problem paper present experi framework develop mobil agent compon framework ad exist applic provid support receiv send agent easi built architectur web server support servlet specif receiv agent main featur architectur web server support servlet specif receiv send agent mobil agent technolog exist web infrastructur execut agent restrict proper authent author long exist secur manag modifi compat java secur deleg mechan agent process http session act regular servlet dynam load ad featur run time make approach configur capabl address requir site small footprint lightweight execut environ solut constitut good approach exist infrastructur long order address problem mention present solut present intranet user held account acknowledg investig partial support research agenc program praxi xxi number project refer unit refer mobil gener magic softwar agent autom proc acm expert inform retriev world wide proc int workshop cooper inform agent applic mobil agent person assist electron confer practic applic intellig agent april integr mobil agent web proc ieee workshop collabor agent distribut web boston june design architectur infrastructur web world wide web vol applic mobil agent proc ieee intern confer open architectur network program april sun microsystem servlet specif sun microsystem specif question platform extens mobil agent intern icsc symposium mobil agent virtual organ decemb mobil agent develop mobil agent intern confer softwar engin applic la novemb apach apach web apach comput result proc intern workshop mobil agent sun microsystem java jigsaw web sun microsystem java web ml
IR/591 5 flexibl queri approach comai damiani tanca politecnico di dipartimento di di di abstract line research present aim logic navig aspect data sourc web site unifi notion schema gracefulli support schemata huge subject languag uniform queri express custom access structur site inform survei relat work direct futur research involv fuzzi queri techniqu outlin introduct motiv modern inform system deal data lack complet structur requir tradit manag system survei data relat inform structur data vari wrt wrt data fairli structur evolv rapidli interest inform data store world wide web web site data fulli consist collect sound text time www data extract tradit relat complet semant mirror site structur www inform li extrem approach deal data introduc languag support logic navig present aspect hypermedia data descript manipul languag web gracefulli support schemata huge subject chang retain semant creat design web user exploit semant mean queri facil formal basi languag direct label graph repres instanc queri express web site schemata account natur www provid grace toler data easi mechan schema updat result instanc evolut time effici check instanc correct wrt schema effici check schema queri applic instanc advantag approach avail uniform mechan queri view formul uniform schemata instanc web site data remain form requir web site fulli structur format queri schema avail support adapt user build queri partial wrt express power fulli equip power resourc effect adapt support abil build custom view inform view site client formul queri includ addit inform good deal restructur result mechan exploit exist site content schemata review relat work introduc present oper semant base bisimul section theoret result present schemata gracefulli evolv instanc materi base recent work section queri support design web queri system base section hint futur research subject relat work section provid overview relat work base approach deal semant free text index semant earli approach web index collect index inform reachabl page data www build boolean keyword search result document current web search engin altavista partial base search result flat list html page webcrawl complement keyword index account html document structur order make educ guess semant semant taxonomi search engin exploit taxonomi repres www content yahoo reli hierarch classif unlik librari congress yahoo success spawn similar base idea provid monolith server hold index site content magellan order exploit taxonomi free text servic savvysearch index altavista queri servic parallel aggreg result structur site amount research made complement search support queri web main www queri languag websql weblog languag model standard sql retain flavour datalog languag languag give fraction power origin queri languag base explicitli refrain semant issu websql offer standard relat web easili construct html tag user present queri web site base relat queri map search convent search engin addit similar queri offer graph pattern search facil navig structur web site weblog instanc techniqu lead deduct queri languag dublin core fifteen element metadata set develop improv resourc discoveri web dublin core element describ metainform format site semant convei natur languag descript formal rich web object model lack data semant semant techniqu semant semant html xml tag denot semant inform earli base semant tag refer data store web page entiti denot relationship semant link queri variat idea lead model rdf rdf develop part metadata activ order provid gener metadata architectur web site express xml rdf assert tripl made thought attribut tradit rdf choic uri namespac resourc make model standard model rdf syntact valid assert made model entiti set attribut current rdf attach metadata singl rdf schema work group develop schema definit languag defin metadata system base rdf semant partial except approach lack explicit notion schema due fact advantag queri formul wide recogn consid www schema inform web site number site design design methodolog methodolog design web notion site schema present site design process commerci author environ web site hint idea navig schema chosen user basi automat site gener approach address problem web queri gener framework deal data tsimmi system oem object model repres inform power queri lorel web user defin oem class tsimmi textual filter initi object web page data tsimmi addit dataguid facil identifi regular extract instanc produc site schema semant base schema strudel approach strudel singl graph data model unlik oem data sourc uniformli queri languag data integr araneu project web site crawl emploi induc schemata web page fine grain page schemata combin build relat view result relat view queri standard sql languag inform introduct section introduc data model languag languag support data model structur entiti present nativ semant recal oper semant base bisimul interest properti light formal present materi found previou paper direct label graph repres web site view custom access path queri node graph stand object edg logic navig relationship object graph mode depict rectangl repres abstract object possibl link slot concret depict object atom movi entri string string string string string string string string string string string string string string string string string string string string string string string string string figur sampl schema string great rate opinion string great restaur restaur rate figur sampl queri depict repres uniqu page access portion instanc site home repres rectangl set horizont collect aggreg node type arc structur edg repres navig link navig edg logic label denot relationship doubl label denot coupl navig step logic relationship doubl arc shorthand presenc navig step relationship carri addit mean associ navig link specif relationship schema kind edg singl doubl indic link graph color red red black assign element graph instanc schemata complet black queri red solid red dash green node edg instanc actual call concret graph black graph slot node carri call abstract graph black graph slot valu concret graph instanc schema show graph iff path note bisimul relat impli graph isomorph isomorph graph viceversa hold sampl schema report fig repres restaur chain rule graph program sequenc set rule queri fig aim select restaur rate rule captur queri node list link kind restaur mean uniqu result list request select rate rule pertain neg requir introduc mean dash edg node simpli schemata reduc size result queri rule applic kei concept definit rule applic instanc red solid part subgraph instanc appli deduc inform form inform dictat green part part result instanc subgraph rule appli rule basic logic dictat subgraph red part subgraph green part ad semant rule binari relat instanc pair applic satisfi subgraph minim wrt properti semant program obtain extend rule semant intuit semant appli black pair pair schemata defin abstract semant studi rise number interest immedi applic make model present subsect safe transfer theorem result present subsect prove suggest schemata order repres set instanc structur properti introduc abstract set minim log schema repres instanc schema uniqu bisimul process schema deriv prove number node instanc properti appar automat deduc schemata repres web site interest properti relat function assign schema set ffl fl pair ffl fl schemata distinct set instanc import properti deriv studi abstract interpret safe transfer rule slot diagram fl fl properti correct abstract applic rule abstract graph safe repres applic rule instanc practic impact result interest user issu queri remot rule applic site immedi keyword answer schemata remot site schema instanc instanc present issu local queri manag present issu instanc queri answer queri partial answer user interfac queri schema robot queri manag remot schema search area client area remot site area repositori schema thesauru figur architectur conclud rule applic instanc schema complex queri site issu target site check applic rule site instanc evolut site life applic rule site schema return automat schema site instanc queri execut approach web queri involv basic schema schema queri instanc result present result outlin system architectur shown figur schema identif retriev step involv dialogu client modul distribut server call schema robot interact schema user identifi web server hold inform basi semant content user schema client provid facil queri hypertext structur web site effect support queri execut instanc retriev essenti develop applic queri inform extract site integr result restructur oper queri deliv server call remot queri execut target web site remot queri manag intern lightweight instanc execut queri return result format select user partial result comput remot queri manag process client site local queri manag access addit inform request produc complet queri result present manag facil present result mechan client requir custom present style constraint resourc user locat context interest site updat affect updat trace schema level futur work featur inform address problem remain solv case blind queri written consult site invalid version import avoid remot site give answer unsatisfactori basic blind queri result data inform model attribut blind queri separ entiti viceversa problem effect dealt bisimul check wrt lexic differ termin node path order deal blind queri plan adopt looser notion bisimul queri fuzzi queri languag base graph ffi inform defin graph ratio number path common total number distinct path graph ffi valu queri graph instanc comput answer satisfi formula queri allevi problem plan explor subject futur paper refer serg queri intl conf vol search atzeni mecca merialdo structur data back rdf comai damiani tanca approach model queri www proc lnai tanca abstract semant queri languag proc intl workshop deduct logic program damiani tanca approach structur queri web proc ifip work conf semant chapman hall core metadata element core damiani tanca schemata repres semistructur proc ifip work conf semant kluwer home fernandez florescu kang levi suciu web site manag system proc ifip conf levi mendelzon techniqu sigmod sept access heterogen inform sourc proc st design langag evalu comm acm gyssen paredaen van der bussch van gucht object ieee tran knowledg data hu nicholson gener web interfac build proc dexa workshop edward languag structur hypermedia comm acm konopnicki shmueli queri system world proc intl conf larg zurich lakshmanan sadri declar languag queri restructur ieee comput soc press richer web object sigmod vol march internet world wide proc conf parallel distribut inform toronto milner algebra semant concurr van handbook theoret comput scienc chapter elsevi scienc publish tanca declar ieee tran knowledg data peopl experi rdf schema suciu sigmod dec
HCI/592 4 learn task model andrew neal lesh charl rich candac sidner mitsubishi electr research laboratori cambridg usa abstract collabor kei step develop detail task model domain time consum dicult requir fairli advanc knowledg ai recip paper discuss preliminari idea make easier construct evolv task interact human domain machin system introduct import trend recent work interact user model view humancomput interact kind collabor human user ed coordin action achiev share goal collabor manag base sharedplan theori collabor rich tool kei step build collabor agent develop detail task model domain time consum dicult task requir fairli advanc knowledg ai recip paper discuss preliminari idea make easier construct evolv task model learn intend usag learn knowledg impact learn techniqu characterist underli domain case imper collabor agent complet task user autonom gener sequenc primit action activ particip share agent make utter human copyright american associ arti cial intellig reserv task model task model straightforward recip action primit execut achiev indirectli achiev action action speci ed mean action timestamp action precondit explicit causal knowledg task model precondit ect function action execut recip method action subgoal recip describ set step perform achiev action di erent recip achiev singl action recip constraint includ tempor order logic relat paramet step recip option repeat substanti task model develop lotu tm email system base empir studi peopl work sidner colleagu formal task structur domain term lling primit action individu click tm messag task model email domain primit action control complex target simpl cook domain testb figur show action recip domain produc task model type directli text editor improv approach provid visual tool directli edit graphic inform task model inform task model easier visual easili public act boil paramet liquid public recip achiev step boil option step step bind constraint figur sampl simpl cook domain graph repres subgoal relationship direct arrow repres order relationship action recip dicult visual arbitrari constraint paramet action creat tool task model engin task basic wai envisag task model develop visual tool support construct mainten task model domain expert experienc ai task model techniqu appeal altern domain expert visual tool appeal li expect domain expert easier perform task discuss construct abstract task model scratch imagin human expert perform simpl task applic model perform task demonstr applic human expert annot log action comput extract task model annot log action log action option repeat expert hierarch action log action contribut singl put segment segment singl recip task model demonstr figur segment annot action demonstr web site nding movi plai local theater action label indent segment label annot squar bracket machin learn piec inform order develop task model full advantag express techniqu make knowledg elicit task natur domain reduc number annot machin learn techniqu provid mean reduc annot ort domain expert infer piec inform requir expert explicitli paper concern autom approach learn piec inform develop task model approach increment construct accur task model seri exampl gener knowledg relationship exist action recip exploit learn engin infer annot domain expert made approach statist natur imagin comput access log unannot user activ applic log analyz statist infer techniqu detect relationship import construct task segment relat action option recip step section paper discuss machin learn techniqu techniqu combin learn site fill director slot allen press button select low select print page figur sampl segment annot system learn issu previou section present overview knowledg task model section discuss detail piec inform construct task model full advantag express piec tradeo explicitli elicit inform domain expert machin learn techniqu discuss rst piec inform outlin action recip consid bare minimum amount inform develop task model essenti order support agent capabl make utter human reason recip achiev essenti piec text present user collabor agent agent make utter time entail hierarch problem subproblem linear task gener action insuci segment decomposit trace segment relat action essenti order learn task model hierarch segment correspond action primit action segment step recip achiev action segment execut trace necessarili dicult human domain expert gener trace proper visual tool conceptu identifi segment view grammar induct problem primit action ignor paramet statist infer techniqu gener compact reason estim segment action segment gener consist action accomplish action import segment label consist learn engin determin segment repres wai achiev action repres achiev di erent action techniqu automat gener segment gener consist label surrog action semant meaningless recip set primit action make segment consid recip achiev action segment annot recip learn engin determin segment requir gener current model recip develop previou exampl mark step believ requir option drop believ constraint violat current good heurist learn engin consist assign recip presum recip accomplish disjoint set requir step type recip gener step type separ underscor type option step omit step type sort recip remov depend order step option step present easili track updat recip ect chang belief option step arbitrari number step step type accommod heurist recip step recip logic step step type click instanc refer step type develop model recip case recip step option order learn engin make logic correct deduct step identifi step step develop model human domain expert assign step individu step good heurist learn engin step presum recip singl step type multipl step step repeat string step type step recip step option repeat mark step option repeat consist basi simpli es reason learn engin boolean characterist present easili chang driven good visual tool identifi option step easili infer learn heurist mention infer recip step compar current recip model recip develop previou step model miss presum option step part model infer provabl correct worst case requir exampl number instanti recip assur assum repeat step repeat xed constant number case presum domain expert interest minim face case worst recip constraint support arbitrari structur relationship paramet recip typic exploit kind constraint rst partial order inform step equal action paramet result annot exampl denot relationship vari greatli diculti depend visual amount relationship exist level comfort domain expert relationship tempor order step number step type handl append counter string step type order equal constraint infer track potenti relationship individu exampl remov potenti relationship contradict worst case prove correct close practic action paramet action paramet reason agent suggest action boil suggest includ liquid reason paramet recip relationship step recip accomplish step abstract natur domain expert dicult determin number type dicult infer problem recip dicult postul exist type paramet action paramet common recip tree achiev action identifi recip match postul paramet di erent recip tree correct user heurist infer action paramet reason domain heurist requir make assumpt task model rst assum type action paramet paramet primit action propag recip tree action assum paramet type action paramet type infer recip achiev postul exist paramet type domain strong assumpt practic adopt heurist paramet intuit concept domain expert learn previou section discuss type annot explicitli speci ed domain expert estim machin learn techniqu expect method mix initi manner learn task model minimum amount particip domain expert case machin learn techniqu capabl determin recip librari domain unannot usag log domain expert addit annot number exampl provid oracl avg dev min max order constraint tabl kind annot provid uenc number exampl learn simpl task model vide semant give gloss meaningless recip minim role domain expert imagin human requir relationship identi ed learn engin principl wai knowledg domain expert output learn engin interleav learn task model learn engin make statist infer unannot usag log domain expert begin learn session result priori analysi present domain expert suggest annot downsid approach suggest di er domain expert requir human work suggest restor interfac rasa learn system domain expert interact learn system seek veri cation user induct hypothesi demonstr segment set step subsum set step heurist previou section conclud current demonstr instanc recip present domain expert con comput search unannot log interest case human expert learn engin support domain expert present expert analysi trace base current state task model task model inform elicit expert annot previou superior rst pass base sole statist infer preliminari result partial implement machin learn techniqu work system result present heurist increment construct accur task model seri exampl statist techniqu implement system learn collect trace trace primit gener task model task model elimin domain expert make annot learn engin access task present seri annot exampl human present oracl halt learn algorithm develop task model model advantag approach remov human learn experi conduct task model simpl cook domain action recip option step partial di erent sequenc primit action type gener librari includ paramet valu primit trace gener subset uniqu trace randomli select test collect order test infer system run time run system correspond di erent amount annot provid domain expert annot provid restrict relationship exist primit action option step present inform whatsoev step part annot valu run averag sequenc exampl drawn random test collect segment action provid addit piec inform earlier paper provid measur tabl show task model requir exampl exampl fulli annot exampl addit annot line tabl show addit provid order constraint mean exampl learn engin continu process exampl exampl present develop model chang ned preset exampl row refer learn acquir knowledg demonstr focuss phd depart comput southern lo ca automat acquisit plan librari proc european conf arti cial interact data plan cluster approach proc intl joint conf arti cial intellig plan intent commun mit press plan recognit collabor proc intl conf user collabor manag softwar interfac agent user model interact
IR/593 5 dynam replica select algorithm toler time fault william michel center reliabl comput illinoi illinoi abstract server replic commonli improv fault toler time distribut servic import problem execut applic replic environ prevent time failur dynam select replica satisfi time qualiti servic degrad due replica failur excess load server describ approach solv problem middlewar transpar replic object local area network approach estim time distribut base perform measur regularli broadcast replica onlin model measur predict probabl replica prevent time failur client select algorithm predict subset replica meet time constraint probabl request client conclud result base implement introduct server replic popular approach build distribut servic replic commonli solut improv scalabl distribut ensur time servic significantli degrad number client access servic achiev fault toler scalabl challeng number replica constrain achiev good fault toler alloc replica servic singl client research support darpa integr contract approach scalabl load replica result higher time remain client assign singl replica servic client multipl client servic parallel replica fail servic failur result unaccept delai client servic approach suitabl client specif time constraint failur meet constraint result penalti client order build depend method attempt prevent occurr time failur client select replica replica base understand time requir replica research paper present approach realiz goal replica select algorithm formul object replica deliv lowest time algorithm target client distribut world wide server maintain record ongo client transact algorithm nearest replica base distanc metric replica histor averag time predict time propag messag replica regress analysi collect data pick replica lowest futur propag time activ monitor replica load network estim time select replica smallest estim time effort assign singl replica client case replica fail servic request client retransmit request failur receiv simpl retransmiss suitabl client specif time constraint work target client specif time requir requir met depend manag gatewai client request path perceiv server gatewai protocol handler protocol handler time passiv passiv activ passiv activ fault local area network commun activ handler gatewai intercept path time fault figur commun gatewai handler probabl work target client stateless applic search engin applic replica case distribut local area network approach estim time distribut base perform measur regularli dissemin replica onlin model measur estim probabl replica prevent time failur client select algorithm estim subset replica meet time constraint probabl request client replica select set independ process request send earliest repli deliv client select subset chosen probabilist time requir met member select subset crash respond request implement algorithm middlewar support transpar replic rest paper organ section present overview section describ assumpt system model section describ replica select problem section present dynam replica select algorithm develop toler time fault present result base implement section section compar work relat section present overview figur present overview middlewar compon enhanc capabl corba object provid fault toler distribut applic fault toler provid transpar replic object activ passiv replic depend manag manag replic level applic base depend requir replica offer servic organ group commun member group place ensembl protocol stack layer detect notifi member group membership group commun transpar end applic corba percept commun singl server object iiop achiev transpar intercept local corba messag forward destin replica group shown figur sake figur illustr server replica group singl member group multipl replica member replic scheme support implement protocol handler gatewai client gatewai handler commun server group handler toler kind fault previou work address issu toler crash failur activ passiv handler discuss simultan toler fault crash failur activ handler describ approach toler time result develop time fault handler system model overview describ system solv dynam replica select problem machin host replic servic system distribut local area network machin host multipl replica servic system frequent access client concurr client request servic demand specif time met probabl failur receiv request time result time failur client assum load replica fluctuat period high load make assum link lan connect system experi frequent fluctuat experi period high result larg delai messag deliveri time replica make factor contribut time fault problem descript sourc time problem address find reduc occurr time failur servic request time manner achiev approach alloc replica client base time requir state client express time constraint outlin made alloc replica client requir servic respond request specif express requir qualiti servic specif client qo requir negoti runtim specif includ time client receiv transmit request minimum probabl time constraint met meet time constraint result time failur client frequenc time failur high system unabl deliv time minimum probabl client client receiv notif callback research object reduc occurr time failur normal condit servic due failur replica due load induc multipl client qo requir access servic period time achiev object design request schedul transpar intercept estim time replica offer servic client select subset replica meet time requir probabl high request client schedul histor perform data collect runtim input solv probabilist estim probabl receiv time schedul forward request select replica select replica independ servic request send back earliest deliv client describ design distribut schedul system client local schedul agent make replica select behalf system chang unpredict due load system section imposs schedul predict certainti singl replica meet time constraint order satisfi goal provid scalabl servic time provid reason level fault import schedul make redund level request servic schedul design make adapt base probabl individu replica meet time constraint higher probabl chosen replica meet lower redund level dynam replica select describ dynam replica select algorithm develop address time failur problem discuss perform paramet guid replica select discuss design inform repositori store measur valu paramet describ select measur paramet build model guid replica select conclud section descript design implement time fault handler meet time requir select algorithm factor influenc time figur show stage path typic request client specif time constraint client invok remot method iiop request intercept protocol handler gatewai handler marshal request present protocol transmit network server gatewai commun multicast commun depend number replica client request forward protocol handler server gatewai receiv corba enqueu request queue server applic dynam invoc interfac server fifo order servic request queue server servic request send client protocol handler server gatewai intercept forward client gatewai protocol stack client gatewai deliv earliest receiv request make corba client conduct experi determin factor client gatewai gatewai local area network server handler handler figur stage path request impact time base conclud time affect time request messag travel figur delai includ time messag travel protocol stack time travel wire lan delai incur request path delai make delai messag delai vari load network number group member involv commun queu time request spend wait request queue server time vari speed request servic vari number outstand request server fifo schedul servic request queue servic time spent server process request dequeu request queue request time vari load host addit sourc replica suffer unaccept delai replica crash respond gatewai inform repositori regularli monitor perform paramet maintain recent measur valu distribut inform repositori onlin model measur estim time replica replica select inform rapidli smaller time updat inform current accur inform provid repositori turn facilit select inform lookup schedul import lookup time small mention section client gatewai handler commun server gatewai handler identifi server group client commun client commun multipl server multipl handler load gatewai leverag design associ inform servic time fault handler gatewai design drawback inform redundantli store multipl client advantag compar global inform avoid drawback repositori local client handler avoid singl point failur avoid overhead make call remot inform servic gatewai handler access local repositori avoid enforc concurr result high access overhead repositori local handler cach inform relev servic search space result time access inform gatewai inform repositori client handler store list replica offer servic handler store current number outstand request request queue recent measur delai client replica repositori store servic time vector queu delai vector replica record servic time record queu delai recent request servic replica consid size slide window chosen includ reason number recent request elimin obsolet measur subsect explain paramet select replica replica select algorithm perform measur collect local schedul part time fault handler build model predict probabl subset replica meet time requir select base result probabl defin notat present set replica offer servic request client schedul obtain set local inform repositori ri random variabl denot time receiv replica mi request transmit probabl client request time section determin probabl subset consist arriv avoid occurr time failur denot probabl state earlier section replica subset independ process request send back receiv request deliv client time failur occur receiv replica set time unit request comput distribut time receiv straightforward assum time individu replica independ strictli case share network network delai reason assumpt network delai small fraction time lan environ independ assumpt comput replica subset replica respond time distribut function replica mi comput time distribut explain comput replica mi subscript refer replica mi base analysi present section defin time random equat ri si wi ti si random variabl denot servic time request servic wi random variabl denot queu delai experienc request wait servic random variabl denot delai client replica mi measur valu servic section record valu recent request servic time vector inform repositori queu record recent valu queu delai vector inform repositori vector repres slide perform histori record recent measur record histori period time base observ traffic lan frequent fluctuat paramet verifi observ true environ environ observ simpl extend approach record delai slide window servic time queu delai measur perform paramet record comput distribut function replica mi todo comput probabl mass function si wi base rel frequenc valu record slide recent record ti comput time ri discret convolut ri comput distribut function replica select algorithm abil comput probabl individu replica meet time describ algorithm appli equat select set replica meet time constraint probabl client request select algorithm outlin algorithm algorithm sort replica order probabl individu meet time requir line includ element sort replica list select consid remain replica list sort includ replica candid set includ replica condit comput equat line extend candid set includ select line form final select set includ highest final select test condit line explain reason replica goal set replica meet time constraint probabl client replica select set crash servic request intuit set replica satisfi time constraint probabl failur highest probabl meet set handl failur member set loop line algorithm attempt find satisfi condit line exclud member find extend set includ form final unabl find return complet set justifi set found algorithm handl singl replica crash distribut function member sort list gi gi equat condit line algorithm equat show belong select set crash complet member meet time constraint probabl client request chose address singl replica crash work target environ replica offer servic ran host observ chanc host fail simultan singl method invoc fairli small assum probabl simultan failur replica offer servic fairli low simpl extend algorithm handl multipl failur method similar outlin algorithm overhead practic overhead incur select algorithm gi algorithm replica select algorithm replica distribut client probabl deadlin met φ prod sort order includ replica highest probabl select gi prod prod gi prod return accept replica end end return set consid modifi algorithm select replica respond δ time unit time deadlin δ overhead algorithm algorithm overhead depend number size slide record perform measur broadcast replica measur time select algorithm recent measur δ comput includ overhead modifi algorithm rest algorithm remain unchang design time fault handler qo specif client section explain time fault handler meet time requir make select algorithm client negoti qo requir runtim configur read time fault handler load client gatewai qo requir client request servic store handler client commun servic client make request handler qo specif select set server replica process request time fault handler group commun layer manag commun transpar client applic replic servic client server applic join multicast group multicast group similar connect group messag list member group broadcast group member time fault handler multicast group forward request client select subset server explain subsect client handler interest receiv perform updat server group multicast subscript request server replica server replica track subscrib notifi perform paramet chang push server updat gatewai inform explain detail subsect member multicast group ensembl detect failur notifi group member chang membership client member group remov entri fail replica local inform repositori fail replica consid select process futur request handl typic process time fault handler transpar intercept request time fault handler record intercept hand request schedul modul schedul retriev replica list servic local gatewai inform repositori servic access inform repositori perform data replica offer servic select strategi select replica list replica publish perform updat initi inform repositori subsequ schedul perform histori local inform repositori replica base qo requir select strategi explain section handler multicast request select replica record sequenc number messag time receiv time fault handler server enqueu request request queue shown figur record request enqueu gatewai asynchron process request queue fifo order request dequeu record dequeu invok server applic servic request dynam invoc interfac server send back time fault handler intercept record servic ts handler forward repli back client gatewai perform includ servic durat spent request tq handler publish perform current queue subscrib inform subscrib updat local inform repositori current server publish perform updat time process request client handler receiv repli record time extract perform data messag repli receiv handler deliv repli client handler extract perform data measur client replica tq ts obtain extract data handler updat inform local repositori delai request process redundantli multipl client gatewai receiv multipl request client deliv redund repli client discard perform data extract updat inform repositori gatewai manner repli detect time failur explain time fault handler detect time failur handl occur handler maintain counter track number time client fail receiv time servic handler receiv repli request client handler check time failur occur comput tr time repli arriv time handler intercept request client time failur occur tr time request client handler detect failur updat counter frequenc time servic meet minimum probabl client request qo handler notifi client issu callback client qo specif issu select algorithm overhead slide window slide window slide window number replica figur overhead replica select algorithm quest servic time note collect time data explain requir clock synchron measur time interv machin result conduct experi implement time fault handler analyz perform select algorithm setup set uniprocessor linux machin distribut lan request neglig servic minimum achiev tr section millisecond figur show overhead select algorithm vari number replica size slide window overhead includ time comput distribut function time select replica subset overhead incur request comput distribut function contribut overhead select replica subset algorithm contribut remain experi slide window size conduct experi evalu effect subset replica chosen select algorithm meet deadlin probabl request client client ran machin independ issu request servic delai receiv issu request number server replica select averag number replica select request probabl time request probabl time request probabl time client deadlin figur comparison number select replica experi server replica ran machin respond integ data machin testb background load simul load server replica respond request delai distribut millisecond varianc millisecond client issu fifti request servic client request deadlin millisecond run deadlin met probabl client request deadlin run deadlin valu comput probabl time failur run fifti request measur number run fail arriv deadlin client order studi behavior dynam select algorithm valu probabl time repeat experi probabl valu probabl probabl probabl chose probabl repres case dynam select algorithm achiev highest time failur rate case provid perspect behavior algorithm figur show expect number replica select dynam select algorithm servic client qo specif observ figur deadlin algorithm fewer replica servic client observ figur algorithm lower redund level client request lower probabl time observ probabl time failur request probabl time request probabl time request probabl time client deadlin figur valid probabilist model case client specifi algorithm redund high meet request case client toler number time algorithm redund level minimum number replica select algorithm reason observ algorithm select minimum number replica meet qo requir stringent qo higher probabl chosen replica meet specif qo requir algorithm satisfi fewer replica figur show success select set shown figur meet qo specif client figur show client specifi probabl time maximum probabl time failur observ lower time failur probabl client toler case client accept failur probabl observ maximum time failur probabl deadlin valu result show set replica select algorithm successfulli meet qo requir maintain time failur probabl failur probabl accept client run model accur predict set replica meet deadlin probabl request client result show dynam select scheme make effect replica meet qo specif reduc occurr time multipl client access servic time replica select scheme environ client access servic provid displai variabl time relat work briefli mention relat effort address problem detect prevent time failur client distribut system dream project integr object base framework toler crash time fault distribut system replic scheme dream approach prevent time failur occur result replica handl time failur occur due load induc multipl client concurr access servic research goal relat work wolf address problem meet time constraint corba servic access multipl client global schedul servic assign global corba prioriti base time requir express client prioriti determin order server servic request work wolf address replica crash gener architectur construct call time comput base verifi detect time properti essenti build depend time servic time fault handler implement realiz properti replic servic conclud remark present approach toler time fault replic servic approach algorithm replica dynam request base abil meet time constraint presenc delai replica crash import contribut paper definit probabilist model probabl replica arriv base perform updat model receiv replica input predict made part time fault select set replica meet time constraint probabl request client implement select algorithm infrastructur build depend distribut obtain result show efficaci model select algorithm easili extend environ replic servic support mechan track record recent histori perform replica mention extens work assum server export singl method interfac client extend work support case server export multipl servic interfac modifi inform repositori classifi perform data base method interfac select algorithm perform inform method invok system middlewar knowledg request select algorithm extend distinguish request made server base argument pass client infrastructur support featur work extend activ probe perform inform obsolet anonym review care improv work seri rest team contribut project grate improv readabl paper refer birman replic fault toler isi system proc acm symp oper system page decemb carter crovella dynam server select bandwidth probe wide area network technic boston al adapt architectur depend distribut object ieee symposium reliabl distribut page octob scalabl network inform process environ server select techniqu improv time replic servic march schiper replic corba marriag activ passiv replic ifip intern work enc distribut applic system page june guerraoui schiper replic fault toler ieee page april ensembl system phd cornel januari heidemann automat select nearbi web server technic southern usc tr scalabl http server ncsa prototyp comput network isdn kim middlewar architectur adapt fault toler support ieee high assur system page nov object replic distribut system phd newcastl septemb microsoft microsoft window activ introduct gener directori servic technic microsoft fault toler framework corba ieee intern symposium page june omg corba object request broker sander adapt algorithm toler fault crash failur ieee transact parallel distribut special issu depend network passiv replic system illinoi al flexibl infrastructur implement adapt fault toler ifip intern work confer depend comput critic page januari select algorithm replic web server workshop internet server june build reliabl distribut applic tool phd cornel time comput base technic report univ express enforc time constraint dynam corba system real time
ML/594 6 knowledg model framework learn adapt knowledg wolfgang ralph bergmann kaiserslautern centr learn system applic depart comput scienc po box germani abstract paper present framework learn adapt knowledg knowledg light approach reason system knowledg light mean approach acquir knowledg insid cbr system describ sourc knowledg insid cbr system knowledg present framework term knowledg appli framework case studi knowledg light approach learn adapt knowledg point issu address design algorithm learn adapt knowledg point view issu topic research final close short discuss outlook work introduct investig learn adapt knowledg approach learn adapt knowledg found dial chef system knowledg intens deriv analog approach veloso learn adapt knowledg knowledg intens mean approach requir lot background problem solv knowledg dial chef adapt strategi special problem field acquir base gener domain knowledg reduct knowledg acquisit cost necessarili case knowledg engin effort costli work focu call knowledg light approach learn adapt knowledg knowledg light mean term learn adapt knowledg knowledg light approach dont presum lot knowledg acquisit work acquir knowledg insid system learn adapt knowledg learn paramet adapt acquir knowledg approach learn retriev featur weight learn algorithm vsm nn vsm learn featur adapt weight hill climb algorithm possibl learn global adapt weight local weight prototyp case weight adapt determin influenc featur target complex work area induct learn algorithm extract adapt knowledg case case base paper categor knowledg insid knowledg base sketch framework learn adapt knowledg start point guidelin design adapt learn algorithm earli start point methodolog knowledg model adapt learn approach focu knowledg light knowledg elicit effort knowledg model task learn paramet adapt acquir knowledg approach learn retriev featur weight learn algorithm vsm nn vsm sourc knowledg cbr system richter althoff richter wilk cbr system store knowledg knowledg mean domain knowledg problem solv knowledg describ domain knowledg insid mention vocabulari describ case similar measur retriev solut transform adapt hold knowledg includ compil knowledg develop time actual problem gener includ human knowledg engin activ case base consist case specif knowledg interpret run process problem solv compil manual compil human acquisit mainten task difficult system gener interpret knowledg acquisit mainten task potenti easier requir updat case base part attract cbr flexibl pragmat decid includ knowledg compil versu case interpret develop cbr system gener aim manual compil knowledg absolut cbr system develop decid knowledg distribut depend avail knowledg engin effort case knowledg fill knowledg transform transform found improv similar measur learn knowledg transfer case base similar knowledg transfer adapt knowledg light approach learn adapt knowledg knowledg code focu learn adapt knowledg adapt improv adapt acquir adapt knowledg provid gener framework make compar evalu approach problem develop ad case case base compil happen maintain cbr system learn design made problem solut discuss workshop framework learn adapt knowledg chapter describ framework learn adapt knowledg light discuss knowledg learn adapt knowledg knowledg figur abstract view process learn adapt knowledg induct algorithm sourc knowledg previou knowledg similar case base adapt knowledg transform adapt knowledg learn algorithm vocabulari measur improv adapt knowledg adapt case base induct learn algorithm preprocessor exampl fig adapt knowledg learn knowledg focu induct algorithm gener gener knowledg exampl cbr system consist exampl model real world problem incomplet select knowledg learn depend kind select knowledg induct algorithm data preprocess suitabl result set exampl set attribut attribut deriv knowledg final integr output attribut descript learn exampl induct algorithm learn process adapt knowledg form adapt improv knowledg case studi appli framework rule learn approach mention introduct approach learn adapt knowledg kean algorithm build pair case featur differ case pair build adapt rule briefli describ algorithm term preprocessor build pair case extend note featur differ target differ case inform base kean suggest constrain case pair limit number advantag similar measur select pair suitabl learn input learn algorithm case pair comput preprocessor step learn algorithm build adapt rule case pair featur differ precondit target differ rule subsequ refin gener extend coverag rule base complex gener perform adapt time kean describ learn rule constrain guid explicitli domain knowledg manual compil adapt automat rule learn place kind inform preprocessor adapt sourc input dynam part adapt consist set adapt rule addit inform confid rate rule confid rate reliabl rule inform calcul learn algorithm base gener appli gener rule algorithm control rule applic strategi resolv conflict dynam part adapt describ approach integr learn rule rule learn determin gener rule improv confid rate discuss direct main point paper provid start point framework learn adapt knowledg knowledg light approach complex adapt knowledg hard acquir techniqu number problem approach classif task numer symbol target learn paramet sophist adapt solut learn algorithm learn paramet adapt acquir knowledg approach learn retriev featur weight learn algorithm vsm nn vsm complex work area induct learn algorithm extract adapt knowledg case base algorithm build pair case featur differ case pair build adapt rule acknowledg author prof michael richter discuss suggest work fund commiss european commun contract ii inform knowledg reengin reason irish medic system kaiserslautern bibliographi intern confer algorithm learn theori call paper richter wilk althoff richter wilk technolog experienc base construct forthcom deriv theori reconstruct problem solv acquisit machin artifici intellig volum page morgan lo ca leak learn adapt strategi introspect reason memori search david reason volum page menlo ca aaai press symbol classif algorithm case studi version space european workshop lectur note artifici page springer verlag learn anticip avoid plan problem explan failur annual nation confer artifici intellig page usa morgan kaufmann publish view plan memori task academ massachusett learn adapt rule case diploma thesi triniti dublin learn adapt rule case base advanc reason page springer verlag case adapt incomplet causal model reason research page springer verlag expert case base learn adapt prior case annual florida artifici intellig research page combin rule case learn case adapt seventeenth annual confer cognit scienc societi similar metric learn classifi neural knowledg similar measur invit talk scale machin case studi deriv analog prodigi machin learn method chapter page morgan san mateo weight featur reason research page springer
DB/595 3 chapter index concurr control system supercomput educ research centr indian institut india seshadri lucent bell lab mountain murrai nj usa introduct system implement index ecient locat data item disk signi cantli improv queri time index integr compon tradit assum greater signi canc environ due stringent time constraint transact complet expect make extens index enhanc abil meet transact deadlin practic scenario rapid spread cellular commun technolog result system support environ larg number highli mobil user due user characterist conserv batteri mobil interact system process index essenti quickli process frequent oper locat updat locat queri support high transact process content transact concurr index form perform bottleneck note content physic resourc reduc faster exist equal simpl mechan reduc index content base environ content base data larg absent due transact access disjoint set index content continu pose perform problem common access structur access base data index content determin perform compar share system resourc clear realiz bene ts index incorpor index concurr control protocol tune object environ rich bodi icc protocol tradit design investig research icc protocol recent mention highli reason expect make extens index quickli access base data transact meet deadlin remaind describ repres rst work address studi carri context applic complet transact expir util harm transact miss deadlin consid immedi abort perman discard execut complet perform metric percentag kill transact index protocol larg varieti index structur commerci system typic index prefer access method implement variant data kei valu store leaf node usag term refer variant transact oper delet append kei valu insert delet tradit index oper append oper special case insert oper insert kei larger maximum kei index kei insert rightmost leaf node distinct append gener insert import append frequent rightmost leaf node index ectiv note search oper transact read delet append oper transact updat basic mainten oper split merg index node practic split initi node ow merg initi node empti index node consid safe insert full safe delet entri node safe search modifi index split merg leaf node propag tree closest respect safe node path root leaf node root leaf tree height set node modi ed insert delet oper call scope updat icc protocol maintain index consist face concurr transact access updat achiev lock index node index node lock typic implement commerci dbm import aspect latch deadlock involv latch detect icc protocol ensur latch deadlock occur index lock mode discuss chapter compat relationship tabl standard intent tabl index node lock compat tabl mode ix ix icc protocol techniqu call descent root leaf oper request lock index node hold lock node parent node found lock held ancestor variant techniqu optimist lock level tree child lock class icc class avor discuss repres set protocol protocol class call reader descend root leaf optimist lock updat di updat root leaf lock updat lock descent leaf reach lock updat scope convert lock updat make optimist descent leaf ix lock updat obtain lock leaf level complet updat leaf safe updat oper time lock protocol class protocol reader lock strategi protocol perform preparatori split merg index insert encount full node perform preparatori node split delet merg node singl entri mean unlik updat protocol essenti updat entir scope scope updat protocol split atom oper lock node child found safe made safe preparatori split merg mention protocol class call updat root leaf lock updat lock lock convert split merg made updat optimist ix lock descent leaf lock leaf leaf updat oper restart index lock descent protocol tree modi cation link chain node level speci node tree high kei highest kei root link node split node merg node split insert index entri parent oper arriv newli split node search kei greater high kei link node sidewai call merg step entri delet higher level icc reader updat tree descent reader descend tree lock lock node updat behav reader reach leaf node reach updat lock lock leaf lock leaf correct updat perform correct leaf updat lock perform link lock node node split merg updat perform lock leaf propag higher level hold lock time discuss protocol limit node singl level contrast protocol break scope updat involv node adjac level tree protocol di er protocol updat manner protocol implement descript protocol refer ly protocol found perform protocol respect convent dbm metric transact throughput index concurr control previou function classic icc protocol move major issu incorpor protocol environ discuss prioriti transact serializ ensur undo index action abort transact implement prioriti incorpor satisfact transact time constraint primari goal transact assign prioriti ect system resourc transact urgenc rel concurr execut transact earliest deadlin polici assign prioriti order transact deadlin icc protocol previou section transact prioriti account result high prioriti transact block low prioriti phenomenon prioriti literatur prioriti ect transact miss deadlin undesir design scheme icc protocol order adapt environ latch lock index typic held short contrast data lock retain question ad latch reason make di erenc time comput perform node shorter time retriev node disk transact con ict parent node requir access di erent absenc higher prioriti transact wait lower prioriti transact lower prioriti transact retriev desir child disk delai prove signi con rmed experi prioriti preemption prioriti inherit prioriti incorpor icc protocol transact request lock index node held higher prioriti transact con ict lock request transact wait node wait queue index node maintain prioriti index node held lower prioriti transact con ict lock lower prioriti transact request transact award lock lower prioriti transact current index oper entir altern techniqu base low prioriti transact block high prioriti transact inherit prioriti high prioriti transact expect block time high prioriti transact reduc low prioriti transact execut faster index node earlier posit featur approach unlik run risk oper restart wast resourc limit due natur index transact block multipl node index cumul ect result miss deadlin util prioriti preemption approach studi physic updat independ prioriti inherit address prioriti discuss recommend di erent procedur special case low prioriti transact physic make updat node lock transact complet updat lock updat node normal special action reason transact start make physic updat requir node memori disk access requir updat result swift complet mean prioriti period neglig perform ect prioriti preemption physic updat made requir ort compar updat complet prioriti inherit protocol code signi cantli complex slower negat object transact serializ perform metric appli entir individu index action transact consist multipl index action ensur transact serializ maintain convent popular mechan provid transact data concurr control ari protocol describ protocol adapt domain term refer kei valu index term respect kei denot smallest kei index variant protocol work transact perform index oper respect speci kei kei rst descend tree leaf obtain concurr control point search lock request search kei search kei rang search oper acquir lock kei return acquir lock kei respect kei access rang insert acquir lock kei respect insert acquir lock kei insert lock kei acquir lock kei respect delet acquir lock kei delet lock delet kei tradit lock acquir end transact strict version high prioriti incorpor prioriti mechan similar icc protocol import di transact restart due preemption commenc entir transact current index oper earlier studi dcc protocol rm shown optimist algorithm perform lock environ signi data content light choic open problem remain respect integr optimist dcc scheme index manag make incorpor complet system undo transact transact abort due prioriti resolut data con ict protocol mention due miss deadlin kill result transact abort common convent dbm convent abort resort resolv data deadlock occur infrequ practic abort undo ect index abort mention process undo signi perform impact undo index action abort transact consid design icc protocol term undo transact refer transact requir undo index action undo transact remov origin transact made index structur data lock note imper complet undo transact quickli regular index oper proce inconsist index ensur undo transact treat assign higher prioriti transact execut system undo rel prioriti order exist earlier process perform result detail simul model evalu perform icc protocol wide rang index content environ full descript experi result restrict attent repres low index content insert moder index content high index content search append primari perform metric addit perform metric relat fair factor captur extent bia exhibit transact base size ber data item factor captur extent bia exhibit transact base type type transact updat transact search index action updat transact includ updat delet index action result show index con ict impact highlight design sophist icc protocol factor characterist addit prioriti discard late signi cantli ect perform icc compar behavior convent dbm outcom justi es icc protocol behavior environ speci observ ad preemption index latch result tangibl perform bene accord expect appreci di erenc observ perform protocol topdown class number lock held time scope updat di erent class tree level larg typic organ simpli opt denot protocol sequel protocol notic unfair regard fair metric opt progress favor transact load show extrem bia favor transact protocol perform poorli respect due root sever bottleneck miss deadlin heavi load compar protocol contrast convent dbm exhibit throughput perform reason alter perform environ algorithm appli form load control give preferenti treatment transact satur disk due larg treat transact uniformli independ type miss signi cantli deadlin reason good perform convent dbm full resourc util turn addit factor convent slower updat result higher content level poor perform rm happen transact discard deadlin expir type inher prevent opt protocol perform condit contrast convent opt perform poorli scenario larg number restart high result root bottleneck due larg number updat priorit transact mark number index oper explain prioriti rst pass transact unsaf leaf node rst transact unsaf complet pass made leaf safe split sourc larg number restart priorit highest prioriti transact overtak transact node descent complet pass quickli result transact leaf node unsaf time period node unsaf smaller priorit environ compar environ effect undo move perform impact model undo index action abort transact tempt explicitli evalu featur base advanc number undo expect directli relat transact kill higher kill percentag lead undo implement undo model result di erenc perform protocol experi poorli perform algorithm work protocol miss transact deadlin direct posit feedback undo overhead kill percentag due incorpor undo action correspondingli qualit observ perform di erenc protocol argument plausibl rst studi show impact undo simpli unexpect ect show environ lic mic undo margin impact perform margin impact limit light load occur high kill percentag valu expect undo overhead due larg number abort transact protocol perform undo absenc lower rang load improv typic signi improv observ suggest presenc overhead improv perform rst glanc care investig subtl ect plai undo appar strang behavior explain reason primari reason perform impact lic mic environ disk bottleneck experi undo typic cpu index page requir resid bu er pool access recent undo oper primarili cpu disk overhead mean cpu larg di erenc intuit expect number index node split merg reduc signi cantli presenc undo action abort transact signi light fact index node split merg oper necessit addit disk reason perform undo low arriv rate lic environ averag latch wait time normal oper greatli reduc presenc undo oper explain reader descend tree quickli lock compat lock updat wait lock mutual incompat due natur result chain updat leaf hold latch index tree small occur easili persist updat leaf node typic wait leaf node brought disk latch parent node leaf presenc undo transact elimin bottleneck virtu preempt undo process transact hold incompat latch tree descent preempt updat hold leaf level latch wait disk request complet elimin bottleneck updat gain possess higher level latch quickli descend leaf latch time small compar disk access time bene elimin felt light moder load heavi load heavi disk fulli util primari bottleneck remov latch bottleneck prove ectiv harm amount wast work due larg number preemption rang queri rang observ result qualit similar point queri perform di erenc protocol gener reason rang search signi cantli level data content system hold lock kei valu simultan protocol outcom result present perform improv ad compon design protocol call augment variant blink protocol admiss control mechan call guard adapt earliest detail algorithm found virtu admiss control polici successfulli limit transact admiss sustain signi cantli reduc kill percentag overload region provid perform entir load rang demonstr admiss control index manag load control identi ed modul good provid close ideal discrimin base transact size transact type suggest design protocol good choic index concurr control relat work materi discuss chapter base earlier paper work awar icc recent focu improv perform classic icc protocol suitabl prioriti mechan point rang emphasi tradit index structur manner improv batch kei provid time consid special techniqu bu er hit ratio transact directli access index intern node evalu shown provid improv perform summari futur work attempt regard index process topic import highli reason expect make extens index quickli access base data transact meet deadlin studi perform class icc protocol rang workload oper condit evalu icc protocol call augment admiss control mechan link protocol provid perform term miss deadlin fair transact class identi ed unexpect perform outcom execut undo index action abort transact outlin varieti issu consid studi icc protocol call reason advanc expect exhibit perform behavior similar protocol convent domain expect similar outcom con expect requir actual implement evalu protocol mention section altern approach consid prioriti inherit interest evalu perform behavior scheme treat undo transact prioriti inherit approach ensur transact minim ongo process assum transact perform goal minim number kill transact import open area icc protocol behavior workload transact vari goal maxim total complet transact result extend diminish residu complet transact deadlin expir interest issu extend analysi index structur expect structur util applic mobil includ spatial data repositori acknowledg seshadri work project dept comput scienc indian institut india narayanan srinivasan made signi contribut stage project work support part research grant dept scienc technolog dept india note percentag miss deadlin tupl insert relat index kei order refer abbott perform proc intl conf larg data august bayer oper btree acta ubiquit acm comput concurr control firm proc intl conf larg data septemb oper oper advanc bayer dynam index structur spatial proc acm sigmod intl conf manag optimist concurr control inform carei access schedul firm journal septemb livni deadlin schedul proc ieee system decemb index concurr control sigmod march index concurr ieee tran knowledg data imielinski highli mobil distribut proc intl conf larg data septemb wei access control reserv index proc intl conf data march liu algorithm multiprogram hard journal januari symmetr concurr algorithm proc fall joint comput lehman lock concurr oper acm tran mohan ecient high concurr index manag method proc acm sigmod intl conf manag june lock method concurr control transact oper proc intl conf larg data septemb optim optimist concurr control proc intl workshop transact queri februari mond control preparatori proc intl conf larg data septemb carei memori realtim proc acm sigmod intl conf manag oper journal comput system srinivasan concurr control proc acm sigmod intl conf manag inherit approach tech report dept ec carnegi mellon stankov acm sigmod march analysi ieee tran softwar march
DB/596 3 flow analysi verifi specif concurr distribut softwar matthew lori clark dept comput info scienc dept comput scienc kansa state massachusett ks ma august classif concurr processor abstract paper present finit state verif approach analyz concurr sequenti program satisfi correct properti contrast verif base algorithm polynomi bound run time achiev effici cost improv result select judici incorpor addit semant inform analysi problem analysi approach implement program written ada report empir studi perform appli tool set collect ada program studi suffici prove program properti achiev cost analysi grow polynomi size program introduct applic distribut concurr program technolog move special oper system program mainstream movement motiv increasingli demand system perform requir incorpor concurr greatli complic problem reason correct applic combat analysi techniqu develop develop gain confid qualiti concurr softwar present analysi call analysi verifi program flow analysi techniqu analyz work support advanc research project agenc grant offic naval research grant nation scienc foundat grant correct properti concurr program applic wide rang distribut concurr sequenti paper discuss analysi program explicit task rendezv commun illustr approach ada task program develop defin set program event reason properti concurr program pattern program event analysi attempt verifi program execut satisfi properti core conserv flow analysi algorithm result address question algorithm oper graph model concurr program behavior explicitli repres statement order perform effici flow util judg effici result produc overcom tradit static develop approach improv result underli principl approach conduct seri individu analysi incorpor amount inform execut program behavior reveal constraint repres semant constraint typic provid inform feasibl relev path program model seri progress limit increasingli capabl provid higher level termin suffici result obtain approach improv perform refin program model analysi base elid unnecessari inform retain inform verifi specif properti strength abil combin collect refin constraint make analysi time impract static analysi techniqu profit adopt similar approach special program model analysi algorithm tool set support analysi specif ada task program construct tool call analyz varieti distribut concurr ada applic individu compon concurr applic commun protocol architectur specif appli industri set analyz properti advanc distribut simul system demonstr adher system architectur requir make number contribut flow analysi concurr analysi ffl concurr analysi techniqu prove ffl introduc increment process ffl empir flow analysi practic verifi concurr system establish context section describ relat work discuss similar differ prior research approach section overview approach introduc major compon analysi focu compon turn section present model program behavior serv basi flow analysi section describ formal properti analyz section present flow analysi algorithm li core approach check specif program model section describ constraint mechan improv perform analysi result analysi section present data gather appli tool set analysi collect concurr ada applic section summar major contribut discuss futur direct loop end begin program fragment control flow graph comput tree figur program model background relat work appli flow analysi reason properti sequenti concurr softwar consid finit state verif techniqu attempt prove properti full power theorem prove reason finit model program behavior build relat work flow analysi finit state verif discuss principl static program describ relat work area order establish context research terminolog static program analysi techniqu attempt determin truth program behavior execut program techniqu consid compil time independ execut test data finit state verif techniqu static analysi techniqu attempt prove execut behavior program consist specif intend behavior finit state verif techniqu power theorem prove techniqu prove wide rang interest properti tractabl primari compon verif model execut program behavior specif intend program behavior program properti finit state verif techniqu compar finit model program model program relev execut behavior properti specif verifi program execut consist properti program model accur reflect semant implement system program design approxim system semant order educ complex enabl effici analysi kind inform model control data state control state program oper execut thought program locat counter data state current valu program variabl approxim form project abstract program control data state common class model reli work control flow graph repres control state explicitli store inform data state clarifi natur approxim kind figur illustr program part comput tree cfg fragment node comput tree tripl ctl statement variabl assum greater equal variabl illustr import issu relat program model path comput tree exist path cfg path comput tree map path cfg exist path cfg correspond comput tree path illustr point boolean predic previou evalu constant true comput tree path predic evalu cfg repres condit edg eman node repres condit predic cfg approxim comput tree repres addit correspond program execut spuriou execut call path cfg overestim program behavior approxim model repres comput tree path inform comput underestim program behavior finit state verif includ model overestim program behavior relat properti interest model conserv safe respect set program behavior relat properti cfg figur elimin data compon preserv control state compon depend encod partial data state inform cfg altern requir partial control state inform perform analysi reach definit analysi interest read write oper data repres semant program oper type model significantli reduc size program model reduc cost analysi preserv inform safe analysi specif classifi kind properti address reachabl properti specif path lead root comput tree node state satisfi requir condit studi properti concurr freedom reachabl properti condit individu reachabl properti specif defin term sequenc state event transit state specif classifi describ safeti live properti safeti properti assert prefix program execut enter state pattern state live properti assert program execut continu enter state repeat pattern state live properti appli infinit program execut notion bound live properti properti refer region execut bound pair design program state continu enter program state repeat pattern state verifi properti finit safeti bound live properti wide varieti specif formal describ intend behavior concurr system tempor logic formal petri net program algebra calculi reason gener formal ineffici practic class includ safeti bound captur simpler theori regular express finit automata analyz specif gener practic set interest arbitrarili long finit program execut regular languag express tempor logic limit properti restrict determin conserv program model formul conserv analysi model posit analysi result impli properti hold call result conserv provid neg result analysi properti fail hold properti fail hold program behavior program model neg result term result altern reason approxim program model comput tree larg construct gener flow analysi sequenti softwar program flow analysi origin develop enabl optim compil gener effici code flow specif pattern behavior analyz comput relat defin cfg node cfg typic encod simpl control relat encod addit data control inform exampl pattern behavior includ classic compil optim reach live constant propag support valid verif data flow framework mean formul specif flow analysi broad class problem monoton bound converg comput gener iter solut algorithm bound monoton framework analysi core describ algorithm section approach combin multipl flow singl analysi combin multipl depend flow singl flow analysi offer potenti improv analysi elimin path case combin problem costli execut constitu problem combin base provid simpl approach construct qualifi flow effect practic flow analysi techniqu valid origin appli detect potenti anomali sequenti code dave system approach fix set flow formul detect fix set anomali system gener approach provid singl flow call state propag instanti detect broad rang includ user defin anomali build work extend analysi concurr program incorpor varieti mechan analysi result concurr analysi conserv concurr analysi approach assum interleav model order program action account comput tree interleav larg basi analysi reachabl deriv explicitli model syntact correct interleav trace collect cfg commonli program model size reachabl graph cost search graph exponenti program model compon program data state explicitli reachabl size reachabl graph applic reachabl research investig varieti techniqu reduc state space base properti analyz build analyz state space symbol state space techniqu reduc complex analysi techniqu successfulli appli select program altern line research reason explicitli program state reason condit sequenc program action program execut analysi formul prove negat properti approach encod negat properti condit linear inequ solut determin satisfact properti techniqu exponenti bound run successfulli appli number program practic analysi larg version program approach view program execut sequenc state correspond interpret finit set proposit program properti tempor logic formula algorithm systemat comput set specif valid arriv determin valid specif perform earli approach suffer set state sequenc grow exponenti program size recent basic approach adapt symbol program yield smaller state space exponenti bulk flow analysi research aim sequenti interest recent work appli flow analysi evalu concurr softwar work direct analysi restrict class requir interleav action separ task flow graph model collect task cfg addit repres synchron commun includ detect potenti statement execut concurr data race al shown class rapid flow graph explicit interleav conserv gener interleav model graph incorpor analysi algorithm interleav program task asynchron execut local action repres sequenc action execut collect account fact task execut speed schedul order action task flow graph model set execut concurr program explicitli repres analysi algorithm modifi deriv inform flow graph model section explicitli compactli repres interleav addit edg approach check deadlock freedom ada task incorpor approach refin program model similar spirit refin section flow refin program model prior final analysi result approach differ advoc select applic set appli refin singl improv feasibl support analysi wide class properti deadlock relationship flow analysi involv comput relat encod properti abstract steffen schmidt shown flow formul problem vice versa practic model check techniqu depend analyst accur model program flow reli systemat mechan abstract program inform determin abstract lead analysi result suffici properti mechan incorpor addit inform intend accuraci result similar approach investig techniqu applic flow analysi research verif properti concurr system core extens state propag analysi program model explicitli compactli repres interleav tool set design provid abil combin flow combin incorpor state propag analysi improv analysi result increment approach analysi effici polynomialtim flow analysi address concurr analysi question requir techniqu constraint specif translat refin program program translat refin result state propag specif pa figur architectur overview figur illustr major compon architectur analysi consist ffl extract model execut behavior program model call trace flow graph ffl refin model size accur reflect execut program behavior ffl construct specif check call properti automaton ffl execut state propag flow analysi algorithm model behavior input ffl present result algorithm user ffl incorpor constraint analysi analysi result demonstr specif consist program result fail provid happen fault program execut behavior inconsist specif analysi program fault appar fix analysi rerun case program fault obviou analysi incorpor constraint step incorpor addit constraint perform multipl provid increment approach analysi cost remaind section briefli describ compon architectur model program execut analyst reason execut applic varieti perspect interest determin statement program variabl case interest definit program variabl interest determin read write oper file abstract file open subsequ case user interest event correspond call oper file abstract address variat user user defin event event program definit interest analysi hand defin respect event complex express defin singl event event interest interleav express event construct model program behavior formul properti reason set program execut semant model execut model repres detail program repres suffici inform support desir conserv impli program model repres sequenc program event correspond feasibl program execut node repres import flow control inform repres program action correspond event statement program model model multipl node depend event interest varieti mechan defin map program action event automat defin analyst defin styliz comment program text assur overestim execut sequenc program includ sequenc refin figur elimin sequenc reduc size reduc cost analysi refin similar spirit transform intern optim compil constrain desir produc result matter appli sophist refin consid compil order model result subsequ properti specif properti sequenc set observ event current implement sequenc regular express regular express translat determinist finit state automaton formal convert graphic interv logic describ properti fundament limit express arbitrarili sequenc found wide rang interest properti concurr program effici repres addit sequenc user check properti program execut program execut state propag analysi cast question program behavior consist properti state propag flow analysi problem adapt algorithm appli concurr program extend incorpor constraint algorithm avoid feasibl sequenc program event class base structur properti analyz result analysi complex grow polynomi number node comput conserv answer analysi question analysi result provid formal verif method analysi result provid inform sourc program fault program model elimin order improv result assum subprogram invoc expand inlin program task defin static procedur invoc return mark distinguish event state propag algorithm trade reduct reduct cost analysi distinguish featur major abil modifi tradeoff gain effici program model state propag algorithm event sequenc system analysi constraint encod semant inform program data control state ad sharpen approxim state propag algorithm avoid event sequenc import note capabl produc analysi result sequenc remain model constraint sequenc inconsist properti elimin sequenc enabl result produc model distribut program execut program manipul data rang infinit set valu execut behavior softwar system captur model enabl effici analysi complex softwar abstract model program execut behavior construct inform relev desir analysi preserv model section describ demonstr model small easi show support conserv state propag analysi set sequenc program event occur program discuss refin improv denot program behavior order check specif model program defin common semant foundat defin common set symbol program action map specif formul definit event finit set model uniqu program action symbol element event stand occurr program action explicitli model analysi alphabet defin scope granular program model properti specif user identifi action program interest reason event bound node repres action simplic state propag requir node event granular node determin granular action event defin languag string string correspond program execut refer string program trace alphabet string defin state explicitli infer context specif defin languag string trace flow graph defin term cfg task program assum cfg task conserv approxim sequenc action task execut cfg assum defin action node immedi action node exist control flow edg gener action path verifi properti state propag analysi order event program node annot program model adequ analyz sequenti program concurr distribut program node order singl task boundari form collect cfg task addit node repres synchron action edg repres order node task annot program repres sequenc event occur program path graph defin ffl forest task program ffl addit node repres synchron commun action ffl addit edg repres event order turn build definit step task cfg simplic assum distribut system made execut separ thread control node repres action element repres uniqu node action edg describ potenti execut action node immedi action relat node symbol denot program action form collect cfg local node local control edg union cfg node union cfg label node label cfg node action element event node concurr distribut softwar model synchron multipl program task ada pair task execut match commun statement form call accept specif task entri model potenti synchron action ad commun node match synchron interact label interact event pair match synchron symbol match call accept add set defin symbol synchron refer collect node node union label relat node addit node defin node initi final repres initi final event execut distribut program built individu task defin initi final initi final label relat edg commun node connect interact task introduc addit edg node node replac edg replac edg denot replac edg ad edg edg edg introduc flow graph path express order event immedi follow synchron activ task assum granular node task cfg depend action event alphabet evalu order argument procedur call relev cfg repres legal evalu order explicitli task add initi final connect global initi final node individu task point edg explicitli repres order event task execut concurr address includ immedi edg assum pair node task requir mip edg commun node consid belong task mip edg creat commun node node task initi final program node consid belong task mip edg pair node mip edg ad commun node mip edg ad commun node node denot set mip edg mip edg captur interleav event execut task explicitli encod interleav pair sequenc enabl construct model polynomi number model exponenti save model size interleav result introduct event order summari definit defin flow graph node node individu task cfg addit synchron initi final node edg preserv local control flow edg individu cfg includ edg explicitli repres synchron interleav definit assum program node repres repres uniqu node action relat node symbol denot program action assum set event subset action label set cfg trace flow graph label direct graph node fn initi fn final initi final initi final edg initi final concaten symbol label node visit path yield trace program event collect event trace path set sequenc event occur program execut figur illustr task oper binari present commun entri state semaphor maintain control state local boolean variabl client signal semaphor entri call acquir semaphor client proce local model program event task bodi semaphor begin loop exit accept accept end end task bodi begin loop exit end end task bodi begin loop exit end end figur ada task semaphor figur trace flow graph semaphor assum interest properti concern order semaphor entri call work program event illustr figur mip edg elid make figur readabl commun node depict diamond label node number commun event local node depict round label task node event oval repres initi final label assign node number event semaphor node initi final number commun number node local task naiv construct mip edg pair node task requir edg figur illustr mip edg occur eman node discuss elimin mip edg case prove order captur path toolset convert identifi replac elimin conflict oper regular express syntax defin figur semaphor node mip edg construct construct collect task cfg system proce phase phase forest task cfg input creat isomorph graph cfg action map event alphabet node point local node pair local node correspond entri call accept task entri identifi commun node creat incid edg connect local node local node joint execut captur label commun node phase creat mip edg node task full detail construct algorithm conserv model conserv state propag analysi requir conserv respect execut sequenc program event satisfi produc program model includ path interleav individu task cfg path model path respect semant rendezv commun task block commun action commun action occur task simpl interleav cfg path inconsist commun task path pass entri call accept occur call task defin commun consist path path adher synchron semant languag model definit commun consist path ada interleav set cfg cfg task occurr node entri call accept occurr task assum entri call node occur path accept node occur interleav path entri call node accept node occur path possibl indefinit block commun model deadlock disallow singl occurr call match multipl accept semant imposs prove commun consist set built cfg conserv model sequenc program action event note commun consist determin path cfg particip path note cfg action node interest subset map event node cfg node label action event label simplic refer event sequenc commun consist cfg path deriv commun consist path cfg node node label event question path correspond reduc question exist edg sequenc node record inform unmatch commun statement encount commun consist path defin unmatch commun commun consist path task null theorem commun consist path set exist path order label node path commun consist path exist mip edg node task map cfg node node construct model proof induct length commun consist path prove theorem node ad commun consist path correspond node extend path base path length path length task start node task cfg commun consist path initi path length includ initi start node task path present correspond definit induct path length commun consist path length hypothesi exist call sequenc event path tn denot ident task commun consist path extens commun consist cfg extens group case node local tn case includ control flow successor entri call accept statement desir path extend edg edg exist task cfg logic clariti possibl singl unmatch commun statement task extend account possibl multipl unmatch statement ada select statement node local task tn case account extens commun consist path task tn cfg node form extens desir path extend mip edg mip edg node task mip edg exist node commun action case includ control flow mip successor entri call accept statement cfg node call accept task node note commun statement local node node ad model joint synchron commun entri accept statement exist commun node uniqu predecessor path extend control flow edg tn mip edg tn control flow edg set null path extend control flow edg tn mip edg tn set accept statement entri exist entri call exist commun node uniqu predecessor path extend control flow edg tn mip edg tn control flow edg set null note case handl situat call task block entri case entri call edg extend path exist definit final node node extend commun consist path match commun label commun unmatch commun statement local node theorem impli commun consist interleav cfg path repres true exist path correspond execut interleav cfg path complex model describ time complex construct algorithm space complex ideal measur express complex close relat natur measur number number number entri call accept statement depend number event interest program vari wide depend specif attempt reason express complex term number program statement reason assumpt number program event statement bound constant theorem number node number statement model program number edg maximum number event program number number entri call number accept statement number node sum node model cfg node commun node worst bound singl edg pair node number edg worst case note product entri call accept accur comput entri basi sum set significantli product entri call accept statement commun statement typic small percentag statement program experi number node linear number program statement practic theorem construct time requir construct collect cfg number program statement phase section commun node pair node potenti creat mip edg theorem number node phase requir oper cost domin phase note case statement program irrelev reason specif mention practic commun statement small minor program statement factor typic make cost construct linear number program statement refin proof theorem show path includ event order occur potenti program execut path includ order execut major sourc inaccuraci control flow order asynchron program event relat asynchron event order occur presenc mip introduc path figur illustr fragment control flow edg mip edg mip edg repres potenti execut sequenc event form ab ba assum node node nest control flow singl instanc event node event node occur execut sequenc program event mip form introduc arbitrarili long path node goal refin reduc size elimin behavior execut reduc size reduc cost perform state propag analysi elimin figur mip path behavior improv state propag analysi result reduc cost type refin sequenc event event repres action interest reduc sequenc sequenc interest maintain order event remaind subsect describ simpl mip edg refin label node refin refin reduc size preserv conserv respect sequenc label event simpl mip edg refin naiv construct mip edg pair node task requir edg semaphor elimin edg case prove order captur path elimin mip edg node label impact sequenc event path includ mip edg label sourc destin mip edg assum mip edg label path label task path node mip edg path symbol result sequenc symbol ident make similar argument mip edg label destin node interest find path successor node destin node refin includ event order mip edg refin built implement construct algorithm transform semaphor mip edg refin reduc number mip edg worth set mip edg remain overli conserv number addit mip edg elimin analysi transform retain conserv defin commun interv refin implement toolset ci refin identifi elimin mip edg connect node commun task pattern task synchron immedi section present data ci refin analysi refer reader detail note recent work exploit happen parallel analysi subsum ci refin alphabet refin result transform elimin edg node add set event sequenc transform local edg lead label figur refin semaphor mip edg includ elimin parallel edg result consecut local label node alphabet refin implement toolset algorithm algorithm increment reduc size graph merg pair node sequenc symbol label path lead node sequenc symbol label path lead process stop node merg fix size label algorithm bound set node refin semaphor figur illustr alphabet refin preserv symbol sequenc alphabet semaphor semaphor make figur readabl edg repres pair mip edg node elimin partit refin algorithm basic mip refin elimin mip edg describ execut behavior verif techniqu requir specif intend behavior execut behavior program compar analysi approach intend behavior interest attempt demonstr freedom deadlock includ intend behavior explicitli analyst complet intend behavior larg monolith specif difficult construct reason implement desir write small specif import properti program analysi approach break larg specif smaller partial specif analysi tailor part turn discuss detail tailor section present exampl section support specif reason partial specif translat express directli automata introduc quantifi regular express regular id po id id alphabet quantifi express alphabet quantifi express id express express express express po express express express figur syntax sion control flow graph program standard algorithm convert user provid specif user suppli directli properti input state propag algorithm defin syntax semant describ syntact style write make write specif defin pa construct syntax figur syntax conveni defin oper syntax express describ exclud oper extens style semant consist quantifi regular express alphabet properti denot properti defin set event symbol express mean event symbol establish map program occurr symbol repres execut action standard regular express defin alphabet figur defin semant express oper term languag operand quantifi kind comparison made languag regular express sequenc event symbol repres potenti program execut quantifi event sequenc lie languag regular refer languag test quantifi event sequenc lie languag regular refer empti languag intersect test specif properti semaphor figur properti state prior work perform semaphor task entri call specif properti fg fxg properti properti fg figur semant style pattern event arbitrari regular express prefer guidanc express order relationship formal specif address develop style write find make easier read write specif style consist express construct type interv exclud set form requir form idea interv requir exclud event deriv corbett express style begin outer exclud interv program execut unrel specif trivial accept initi interv iter sequenc altern requir exclud altern sequenc captur pattern event requir satisfi execut style lead slightli longer regular find structur express experi style specif express tempor relationship system event sequenc interv provid build block similar oper typic provid tempor logic data mutual gener form properti style recent work expand gener notion specif style pattern system properti specif shown earlier section instanc global pattern system properti automata standard techniqu construct finit state automaton regular express properti automaton accept event sequenc event alphabet correspond properti interest definit properti automaton determinist automaton properti fs set pa state repres class prefix string properti ffi properti state transit accept state reach string satisfi properti figur properti automaton properti uniqu start properti alphabet properti properti automaton construct semaphor properti state illustr figur pa state transit state repres fact string lead state violat properti specif extens string possibl satisfi call violat state figur violat state repres state construct pa pa determinist automaton prior construct pa convert express canon express oper worst number symbol express larger number symbol origin express time number symbol properti bound size alphabet properti denot properti larger size program event properti case number symbol canon express bound constant program construct pa directli regular express algorithm sethi ullman avoid construct intermedi nondeterminist automaton note exist express algorithm requir exponenti time encount realist specif concurr program exhibit problem discuss properti specif section altern mean formul specif avoid problem state propag analysi aim compar execut behavior program specif intend state propag analysi mechan perform comparison describ practic algorithm check execut behavior repres intend behavior repres pa state propag analysi develop state propag algorithm check regular properti sequenti program model work build result explain state propag extend state propag analysi appli concurr program model section terminolog data flow framework state propag flow analysi properti automaton accept sequenc program trace flow path includ execut sequenc program event lead node describ pa flow graph figur path section check consist properti program check languag empti languag simplifi discuss languag test interest individu execut event sequenc accept interest event sequenc accept mean flow graph path respect accept reduc work requir data flow formul state propag analysi develop ffi extens state transit symbol sequenc symbol initi initi transit ffi ffi start state figur illustr simpl flow graph path lead node node respect pa accept regular languag path ffi ffi ffi ffi strength li fact base structur properti automaton dramat reduc time requir perform languag comput state propag analysi comput node set state reach path node start node fffi initi ng defin meet state union meet order sp set lattic valu function space defin extend total function state sp ff add function sp theorem sp monoton function space defin sp monoton requir properti hold function extend ident function ident function function sp extens total function defin set total unari function defin close composit extens addit preserv closur sp ffi ffi element function produc element construct function composit filter function filter function defin ae total function defin extens sp element defin complement element defin composit filter function fl appli remov element leav element function element sp built composit filter function sp sp show hold produc xg impli defin state propag data flow framework theorem sp sp sp monoton data flow analysi framework theorem definit sp framework instanti defin function map function map sp defin flow state transit function appli produc fn fffi ffi extens ffi set state satisfi framework initi initi node map constant function return ps start state initi fn initi fsg long flow graph repres execut sequenc program instanti sp solut conserv valu state flow graph node theorem execut sequenc event end symbol node function map construct sp sp instanc sp solut final final compar set accept state produc conserv version languag final empti intersect final addit provid complex conserv result formul analysi monoton dataflow framework algorithm solut present state propag algorithm instanc iter worklist algorithm algorithm propag trace flow properti slightli stronger properti function space call distribut set state final node auxiliari data structur al arrai length jn hold set state list queue node jn hold subset state ae fsg initi list fn initi main evalu statement repeatedli list point list list ffi list end irreduc mip edg larg class special solut method formul reduc flow graph main reason chose gener iter worklist limit simpl variant algorithm provid opportun improv accuraci flow analysi concurr program engag synchron commun variant exploit framework formul analysi formul framework node order enforc algorithm comput node potenti chang multipl predecessor node chang node algorithm schedul singl recomput node order improv avoid unnecessari comput node chanc chang valu care algorithm reveal number addit opportun elimin unnecessari comput node algorithm store reflect effect ffi call node easili modifi algorithm store addit cumul valu node call node decid put perform comparison determin comput possibl affect put worklist track set predecessor node chang call comput predecessor optim improv time bound algorithm graph graph node high yield practic speedup toolset implement improv express bound run time algorithm term number automaton state number node describ worklist initi notat conveni theorem propag node state appli algorithm termin time sketch bodi main loop test append oper line node node oper perform number iter visit bound number node achiev node initi fsg size jsj time equal set state automaton jn node graph iter iter main loop theorem hold theorem state maximum fix point solut instanc sp conserv estim node theorem instanc sp initi fn initi ffi induct length path lead path lead initi predecessor correct state valu path extend singl step reach equat solut satisfi definit state theorem hold state propag illustr state propag algorithm appli algorithm check properti semaphor section illustr final set pa state node alphabet refin figur note primarili interest set state propag final set set accept node pa properti hold semaphor program feasibl constraint practic flow base abstract program control data inform encod flow graph abstract reduc size enabl effici analysi softwar system compil optim lead miss opportun code improv intend verif system lead analysi result notic damag util analysi incorpor approach insert analysi addit semant inform explicitli repres effect semant potenti figur refin trace flow graph propag pa state elimin result occur due approxim model overestim execut program strengthen semant content view reduc overestim advoc process constraint select introduc analyst determin analysi result addit inform constraint basic encod condit improv program model analysi constraint determin path execut constraint filter target execut affect analysi conjunct condit condit strong conjunct isol multipl constraint pass execut consist condit constraint thought flow constraint uniqu violat interpret condit encod constraint violat constraint flow combin state propag analysi form qualifi flow analysi space constraint paper focu constraint encod approach emploi combin constraint properti specif state propag analysi approach describ implement toolset gather data section form product constraint properti propag state product automaton altern form reachabl product state implement toolset perform comparison report flow abstract data valu lead control flow path constraint encod variabl valu transit valu recov data relat inform found common constraint toolset autom support creation kind variabl automaton constraint presenc mip edg introduc interleav event separ task refin remov constraint enforc local task control flow elimin type toolset provid autom support task automaton constraint variabl task automaton constraint kind constraint final initi ta figur ta autom concept gener behavior miss compon partial defin softwar system captur analysi interfac constraint hardwar context user interact profil softwar system incorpor analysi environ constraint remaind section describ task automaton constraint variabl automaton constraint detail discuss techniqu combin multipl constraint singl analysi task automaton constraint illustr figur presenc mip edg introduc path violat event order encod control flow edg approach elimin mip edg state propag enforc control flow order task encod feasibl state transit individu task feasibl constraint state ta constrain analysi path correspond set event sequenc model task construct ta build dual control flow graph convert node transit edg ad violat state defin transit state deriv ta directli map node event chosen deriv ta task cfg refin appli reflect task ta construct task fn set local edg incid node initi final node determin start accept state local node task symbol ta symbol concaten event label node node uniqu id symbol repres instanc event node event node occur figur illustr fragment ta task ti ti local edg start state edg initi node start node local successor initi state accept state map node uniqu posit integ concat string concaten definit task automaton constraint determinist automaton ta ffi ta ta ta ta ta fvg set state local node task violat repres path violat task control flow ffi ta fn ta fv ta defin transit local node task transit lead violat ta accept state exit edg task ta start state start edg task ta ta alphabet consist symbol form concaten node label uniqu node local node task structur automata record occurr program point task event occur enabl ta enter violat state sequenc occurr program event violat control flow structur task encount task automaton construct task note enforc condit encod ta state alphabet symbol ta alphabet node model task involv convert id symbol node introduc parallel pa transit pa defin symbol id ta relabel process requir step theorem sequenc program event lead ta violat state correspond program execut call model task program event symbol ta sequenc due structur label ta trigger transit preserv ta state inform store node call ta project ta definit execut sequenc program event occur repres control flow path assum ffi ta ta ta ta ta ff ffi ta ta ffi ta ffi ta ta construct ta happen node ffi ta ta node ffi ta ta successor label compon edg sequenc execut conserv theorem hold construct ta requir step set node task question construct transit state ta entir algorithm section construct ta fast practic variabl automaton constraint flow graph typic model program variabl accur analysi depend model critic program variabl interest model variabl condit statement guard control commun statement variabl defin small finit domain modifi disciplin exampl includ boolean sequenc correspond path label node transform figur va boolean variabl variabl constant valu assign bound counter variabl increment decrement oper appli develop techniqu encod state state transit program variabl va constraint va transit repres modif variabl result condit test valu variabl branch violat repres path violat semant program branch respect current variabl state va constraint boolean variabl shown figur assign variabl model includ repres situat unknown assign variabl result test condit repres transit violat true state test result encount state test result result test inconsist variabl va state boolean variabl va ident structur definit boolean variabl automaton boolean determinist automaton ffi vg set state defin abstract valu model unknown ffi defin transit figur accept state start state model unknown alphabet defin program event effect model variabl theorem boolean sequenc program event lead va violat state correspond program execut structur boolean wai reach va violat state true encount test result state encount test result boolean variabl true reach condit test variabl true program true branch branch condit label propag true branch lead violat state branch point violat program semant real program execut argument variabl valu test valu condit enforc condit encod va state alphabet includ symbol va alphabet result incorpor va analysi depend abil identifi program statement variabl state transit case case boolean variabl develop definit variabl automata addit class variabl includ bound counter variabl variabl defin type boolean variabl automata construct step involv simpl renam transit figur bound counter variabl automata construct similar manner step maximum counter variabl automata construct similar manner step number valu toolset user select va automat special definit specif variabl instanti gener va templat replac variabl templat program variabl note wide rang abstract program variabl encod variabl automata incorpor state propag analysi abstract admit simpl encod accommod long uniqu violat state combin constraint properti incorpor constraint state propag analysi solv conjunct constraint approach achiev discuss approach instanc state propag analysi constraint automata solv simultan state propag analysi properti automaton describ altern approach constraint encod report experi approach section constraint automata structur flow graph path drive constraint violat pa collect feasibl fc encod finit automata construct product call constrain properti automaton definit constrain properti automaton determinist automaton ffi spa set state consist tupl state constitu ffi transit function applic constitu automata transit function accept state correspond tupl accept state constitu pa start state tupl constitu start properti fc alphabet union constitu alphabet enforc conjunct condit encod fc individu condit fc violat conjunct violat state repres violat state fc automata singl violat state lose detect primari differ standard automaton product interpret result state propag slight differ descript section compar termin state valu accept ignor violat state remov contribut state propag result path violat condit enforc fc encod optim constitu alphabet reduc size alphabet correct fc automata alphabet pa alphabet subset optim dramat reduc storag requir repres ffi optim appli construct optim exponenti natur unavoid intent abil small number judici select constraint control potenti rapid growth cost analysi evalu polynomi bound run time suggest approach scale exponenti bound approach expect cost analysi typic applic develop understand feasibl practic appli analysi varieti program correct properti program rest describ methodolog appli analysi describ detail result empir follow number observ result methodolog empir evalu perform implement target ada task program toolset built top infrastructur compon refer toolset version program select analyz evalu ada task program exampl concurr analysi literatur program studi varieti finit state verif techniqu appli chose mixtur program includ scalabl program replic scalabl program dissimilar program dissimilar task program properti develop properti specif engin applic goal properti check develop applic learn great deal sampl size small claim result gener ada task program import concern cost evalu cost construct analysi artifact cost perform analysi isol concern cost concern chose properti valid select program measur perform yield result evalu report refin feasibl constraint includ order achiev result consid alphabet commun task automaton constraint variabl automaton constraint variabl process consid basic analysi refin ad refin constraint problem rigor approach order determin optim optim resourc produc result note ad constraint reduc execut configur addit constraint consid determin optim configur goal find execut time determin reason process develop follow easili find result discuss result evalu influenc order select refin constraint alphabet refin ad addit section gather inform rate growth analysi cost vari size program scalabl case size properti check scale consid instanti program found configur refin constraint led result ran experi candid configur select requir execut time configur scale program configur continu produc result properti correspondingli scale version problem scale larger size case scalabl program properti consid experi section follow present data refin constraint cost primari measur analysi time sum user system time analysi result measur load sparc megabyt physic memori tool compil compil system optim disabl work compil simul ran seri tool construct state propag analysi ran analysi time averag time includ overhead cost relat object manag infrastructur tool built report run time extrem larg reflect fact evalu prototyp system design flexibl effici effici version tool set includ optim develop preliminari data suggest achiev order magnitud perform prototyp time result report repres upper bound perform approach reason rate growth cost analysi plot analysi time versu number node program analysi plot made scale judg rate growth compar slope plot slope refer number node slope analysi time plot refer rate growth refer polynomi refer plot detail empir result appli scalabl ada task program sourc code program experi scalabl start version program progress larger version program larger version size version problem explicitli note tool handl size problem simpl protocol problem simpl protocol program illustr common mechan resourc lock corbett present illustr capabl constrain express toolset slightli modifi version origin legal ada program system consist lock manag commun channel client scalabl number client client task attempt gain access resourc task hold lock send messag simul commun channel lock manag task control access resourc code differ corbett singl entri acquir resourc separ entri client task practic implement lock manag task chang chang number client commun channel task thought passiv data accept data transmit simul channel check number properti relat possibl messag client interleav channel check global properti client send header client packet specif properti problemat depend number client initi explor simpl local restrict version specif client client version protocol header client header client packet client appli refin constraint select process explor effect refin feasibl constraint cost analysi properti perform variat alphabet commun interv alphabet refin ta found obtain result order alphabet commun interv refin combin success larger version protocol program appli refin consid cost analysi scale number client task protocol program client task argu show properti hold client hold pair client client attempt evalu scale verifi global properti addit singl task properti consid global variant multipl applic singl task version analysi time sum composit version multipl applic singl task version involv construct properti program simpl renam analysi time sum composit version iter disjunct individu singl task version start singl task properti figur plot total analysi time versu number node plot includ refer line slope rate growth alphabet commun interv refin analysi problem total analysi time largest approxim minut multipl version analysi client task version singl task properti fact global properti program reason conjunct number local relat event smaller set program task conjunct analyz isol design tool analysi artifact singl cost construct refin amort individu singl task share common refin construct state propag analysi execut client task program figur plot rate growth analysi multipl includ addit refer line slope number task plot cost analysi grow faster total analysi time largest approxim hour minut approach analyz global properti program write singl specifi node task task task task task composit total time individu total time task total time figur total analysi time desir pattern behavior task system grow client program alphabet consist symbol regular express instanc symbol regular oper larg turn properti regular easili produc simpl macro client program note unlik previou version composit scale number client scale figur includ plot analysi composit properti plot cost analysi grow faster total analysi time largest approxim minut illustr capabl verifi global properti multipl approach effect small problem quickli cost composit cross program approxim twelv task note instanc multipl approach hope maxim amount analysi artifact gener clear composit analysi fare comparison multipl turn analysi properti protocol program specifi packet match header weaker version packet singl task match conceiv error subsequ packet unlik previou specifi program execut satisfi pattern behavior alphabet commun interv refin analysi found alphabet commun interv refin combin produc result node task task task task task total time figur total analysi time figur present plot total analysi time properti plot cost analysi grow total analysi time largest approxim minut problem problem standard implement mean safe access share data number research analyz version problem state space program grow exponenti number state program record state reader writer assum client task end number reader number writer demonstr polynomi growth accur analysi improv naiv reachabl analysi problem consist central data call control collect reader writer scalabl number client task reader attempt read writer attempt write share data support client read write code differ slightli exampl analyz includ explicit program termin control shutdown activ reader writer unlik program protocol dine philosoph global state program complet captur control state client task control task maintain local state variabl determin pattern commun event engag control enforc write writer activ writer reader activ semant encod local variabl altern reason execut reason event local client reason event share control task properti protocol program formul term local client event approach pattern event term read ada control task entri abbrevi make readabl properti exclud possibl write read initi writer preclud reader activ writer start addit insur perform variat analysi reader writer program alphabet alphabet commun interv alphabet refin ta control alphabet refin va boolean variabl control task found alphabet refin va obtain result properti success larger version appli refin continu produc result analyz properti start assumpt model variabl prove invalu gain analysi result previou properti found incorpor va variabl insuffici gain analysi result properti perform variat analysi reader writer program alphabet refin va constraint alphabet refin va counter va constraint variabl local control manipul bound counter variabl variabl control maximum number reader read time bound number reader program turn boolean abstract counter variabl check properti reader activ activ data present bound number reader size program found properti alphabet refin va obtain result success larger version program appli refin feasibl constraint continu obtain result properti program share data repositori data reader access typic produc consum problem data repositori kind queue program execut write read perform variat analysi reader writer program alphabet alphabet commun interv alphabet alphabet va unlik analysi incorpor ta control task suffici produc analysi result pattern behavior express prefix program execut encod control flow structur control task share data server initi local state variabl influenc pattern commun found properti obtain alphabet refin ta va analysi costli success larger version appli alphabet refin va feasibl constraint node task task task task task figur total time evalu cost analysi scale began reader size program doubl number reader properti select refin constraint figur plot total analysi time versu number node rate growth total analysi time largest reader approxim properti ga station problem ga station problem simul autom ga station ga station consist collect client task collect task act server similar problem server subsystem client task problem server control task ga station server scalabl collect task ga station problem scalabl significantli number client size server server compon consist oper task accept payment chang custom number pump task independ start stop pump ga oper interact pump enabl pump ga payment receiv inform ga pump pai pump chang code differ slightli exampl analyz includ explicit program termin oper shutdown activ custom successfulli turn pump check properti relat access pump black box perspect potenti interest properti insur singl custom pump time desir system properti white box properti trivial check due control flow pump task properti pump start ga pump stop pump start ga pump start pump start pump stop node task task task task task alpha figur total analysi time ga pump stop pump start perform variat analysi custom pump program alphabet alphabet commun interv refin produc alphabet refin significantli alphabet refin scale problem evalu cost analysi number custom task ga station program began size program doubl number custom step figur plot show analysi problem total time alphabet refin analysi largest approxim minut dine philosoph problem number research analyz version dine philosoph problem insur deadlock freedom dine philosoph problem consist equal number philosoph fork task program scalabl number philosoph fork task organ ring altern philosoph fork task philosoph activ philosoph task access left philosoph attempt gain access fork simultan commun fork task fork share philosoph dine philosoph program distribut control program consid evalu ga protocol central server dart discuss central master task check properti philosoph eat refer properti case properti consid possibl number version properti fact neighbor acquir share properti singl philosoph phil phil node task task task task task singl multipl figur total analysi time phil phil phil phil black box perspect potenti interest properti insur pair adjac philosoph fork time desir system properti white box properti trivial check due control flow fork task experi protocol problem consid composit version properti complex grow rapidli fork oper result specif interleav desir event sequenc fork encount natur properti system requir exponenti long specif number pa state specif grow exponenti properti suggest entir class specif altern approach check pattern behavior fork isol analog multipl analysi protocol program base experi start analysi seri alphabet refin found produc analysi result cost alphabet refin analysi scale number philosoph fork task began philosoph fork size program doubl number philosoph fork step figur plot total analysi time versu number node alphabet refin analysi singl neighbor rate growth analysi total analysi time largest philosoph approxim minut dart applic dart concurr weapon simul applic develop analysi test repres concurr ada program program corbett analyz version program check deadlock freedom version ident corbett experi variant legal ada program note corbett version version origin applic preserv commun structur applic detail comput system consist task simul structur main control initi simul shut task broken data server simul task data server provid access share data multipl simul task simul task read collect data comput valu compon updat data server appropri data server control structur simul task similar control vari base local comput number data server interact data server simul task control share common pattern interact control task uniform chose analyz properti relat interact control task data server simul task properti describ pattern event local singl task select task displai statu updat properti program execut action pair initi stop breviti write ada task displai statu updat ft stop stop perform analysi insur behavior task system oper unlik dine task dart program complex intern control flow appli basic analysi properti toolset exce storag capac incorpor alphabet analysi easili handl problem analysi result obtain minut discuss empir result section demonstr feasibl demonstr exist natur properti program verifi analysi approach cost polynomi size program analysi problem found multipl produc analysi result singl specif protocol differ cost analysi order magnitud specif differ cost analysi small practic matter find analysi level requir factor cost find analysi cost check desir specif program adopt greedi analysi find smallest instanc program larger choic scale composit specif costli analyz multipl specif small instanc protocol program protocol composit specif cheaper grow lower rate multipl specif import factor influenc cost analysi specif local global local specif refer program event instanc small cluster task global specif refer program event instanc scatter wide program imagin task automata add inform clear fewer ta add costli analysi local specif requir fewer ta global specif properti analyz previou section vari local pair task includ event program task conserv specif behavior part system focu analysi specif win perform accuraci improv scalabl analysi problem consid rate growth bound tn number program task number node curv exhibit slight cup fact measur cost grow function size size properti constraint analysi problem case slope pair point plot number program consid cost state space techniqu scale exponenti number task case demonstr polynomi growth problem grow exponenti number potenti program execut consid small collect program properti gener observ rate growth cost analysi untri analysi problem finit state verif techniqu reason execut behavior state system approxim behavior finit model flow typic weaker approxim gain perform appli flow verif kei question analysi produc suffici result experi suggest incorpor addit inform spuriou result elimin exampl consid analysi result suffici verifi specif respect program cost vari program specif analysi obtain level state space techniqu incorpor ta program task va variabl feasibl model explor state space program case dont inform gain analysi result present finit state verif approach analyz concurr sequenti program satisfi correct properti contrast verif base algorithm polynomi bound run time achiev effici cost improv result select judici incorpor addit semant inform analysi problem autom support creat common constraint repres addit inform preliminari carri earli prototyp suffici achiev easili cost analysi grow polynomi size program evalu provid insight refin effect alphabet refin base effect techniqu elimin unnecessari mip edg aggress explor addit evalu report toolset appli number interest wai empir evalu concurr analysi techniqu analyz commun protocol partial softwar system architectur system descript paper approach detail ada approach languag independ program languag carefulli translat program model order event conserv captur flow control translat successfulli develop explor altern model java state propag algorithm chang expect case addit applic program approach applic artifact captur flow event system appli architectur descript detail design verifi properti system view complementari activ test debug hypothesi fault formul properti determin trace fault occur distribut applic extrem common system difficult reason debug inabl replic test extrem import practic techniqu develop reason system evalu report preliminari program worst case bound subsequ work optim lead approach matur techniqu practic develop distribut softwar refer gs ua jc lk jc autom analysi concurr system constrain express toolset ieee transact softwar novemb av je jd ullman design analysi comput algorithm read av jd ullman tool ja jw process algebra synchron commun inform rick christoph dean investig static data flow analysi advanc distribut simul verif workshop distribut interact page septemb jc corbett gs scalabl composit analysi softwar engin decemb acm sigsoft symposium foundat softwar engin cliff click keith cooper combin combin optim acm transact program languag march em ea ap sistla automat verif concurr system tempor logic specif acm transact program languag april empir comparison static concurr analysi techniqu phd massachusett sc cheung kramer tractabl flow analysi anomali detect distribut program european softwar engin analysi event synchron parallel program tool principl practic parallel program jc corbett verifi gener safeti live properti integ program intern workshop comput aid juli jc corbett evalu deadlock detect method concurr softwar ieee transact softwar march steffen concurr semant base tool verif concurr system acm transact program languag januari mb gs jc corbett pattern properti specif verif intern confer softwar sm state space method deadlock analysi ada task softwar engin juli intern symposium softwar test analysi mb la clark flexibl architectur build data flow analyz intern confer softwar march laura graphic interv logic concurr system acm transact softwar engin april matthew model check partial system sixth acm sigsoft symposium foundat softwar novemb ml concurr analysi presenc procedur data flow framework acm sigsoft symposium analysi verif octob mb da schmidt limit state refin intern workshop abstract interpret model octob mb data flow analysi verifi correct properti concurr program phd massachusett septemb mb modular flow analysi concurr softwar ieee confer autom softwar novemb lloyd leon data flow analysi softwar reliabl acm comput septemb srinivasan effici comput inform parallel program sixth annual workshop languag compil parallel august gunter semant program structur techniqu mit wolper partial order effici verif deadlock freedom safeti properti workshop comput aid page juli ms flow analysi comput program comput scienc librari program languag seri elsevi debug ada task program ieee march gj improv reachabl analysi techniqu practic februari gj model checker spin ieee transact softwar function approach program test analysi ieee transact softwar octob lh bk rosen qualifi data flow problem ieee transact softwar januari jen bernhard parallel effici optim parallel program acm transact program languag jb jd ullman monoton data flow analysi framework acta rp model concurr process comput volum appli page sp static detect deadlock polynomi time phd rutger kl mcmillan symbol model check kluwer academ algorithm analyz commun process mathemat foundat program semant march publish lnc milner calculu commun volum lectur note comput scienc sp tj bg lattic framework bidirect data flow problem acm transact program languag septemb tj bg properti data flow framework acta sp bg analysi acm sigplan symposium principl practic parallel murata petri analysi applic april gn gs conserv data flow algorithm detect pair stat happen parallel sixth acm sigsoft symposium foundat softwar novemb gn gs la clark data flow analysi check properti concurr java program intern confer softwar gn gs la clark effici algorithm comput inform concurr java program joint european softwar engin acm sigsoft intern symposium foundat softwar engin septemb gn gs la lj appli static analysi softwar architectur lnc european softwar engin confer held jointli acm sigsoft symposium foundat softwar septemb gn la jm partial order techniqu improv perform data flow analysi base verif acm sigplan workshop program analysi softwar tool septemb gn la lj verif commun protocol data flow analysi fourth acm sigsoft symposium foundat softwar octob gn la lj effici composit data flow analysi appli concurr program acm workshop program analysi softwar tool june rh bp miller detect data race parallel program execut workshop program languag compil parallel august km lj sequenc constraint languag automat static analysi gener ieee transact softwar march km lj static analysi sequenc constraint acm transact softwar engin januari pnueli applic tempor logic specif verif reactiv survei current trend jw de current trend volum lectur note comput page jh reif sa smolka data flow analysi distribut commun process intern journal parallel scienc applic intern corpor advanc technolog investig static data flow analysi advanc distribut simul verif technic da schmidt analysi model check abstract interpret annual acm symposium principl program januari sm tu design implement petri net base toolkit ada task analysi ieee transact parallel distribut octob bernhard steffen gener data flow analysi algorithm modal specif intern journal scienc comput rn taylor complex analyz synchron structur concurr program acta rn taylor algorithm analyz concurr program commun rn fc la lj rw jc al young foundat environ architectur symposium softwar develop page novemb publish acm sigplan notic sigsoft softwar engin novemb rn taylor lj anomali detect concurr softwar static data flow analysi ieee transact softwar attack state comput technolog laboratori report technic research centr wolper tempor logic express inform mn fk constant propag condit branch transact program languag april rn dl ka concurr analysi tool preliminari experi acm transact softwar engin januari wj yeh young composit reachabl analysi process algebra acm sigsoft symposium analysi page octob
Agents/597 1 ieee transact system vol septemb evalu humanoid synthet agent applic paper present experi design empir evalu humanoid synthet agent electron retail applic agent evalu singl home furnish servic experi explor applic depend effect evalu agent person cd servic experi evalu effect rang humanoid agent particip eavesdrop spoken dialogu plai role sale assist result show particip expect high level realist verbal nonverb commun behavior agent rate agent show applic group particip rate agent similar wai applic result show particip prefer agent desir interact fulli embodi agent introduct presenc synthet humanoid agent interfac result social collabor human demonstr rea steve assum anim agent interfac success interact establish object subject measur usabl embodi anim agent develop methodolog support evalu cassel empir investig kind embodi interfac rare result van review empir studi anim agent interfac evalu make difficult make comparison draw gener van identifi categori data import evalu interfac anim subject behavior interact outcom interact perform data manuscript receiv decemb april work support british telecommun strateg research initi author centr commun interfac research uk publish item identifi helen jack ieee import interact contextu aspect categori remain outstand issu respect subject experi interfac embodi anim agent van drew attent import dimens user subject experi commonli perceiv activ research report present paper extend list dimens experi wide rang synthet humanoid agent experi interfac anthropomorph humanoid agent act assist retail context agent select repres import point rang technolog creat talk imag facial disembodi voic agent type disembodi creat human imag agent reevalu contrast retail investig applic depend effect experi investig humanoid agent type retail environ experi video includ experi order investig user expect human facial express comparison visual sophist express technolog video impract interact onlin project demonstr video creat successfulli segment technolog suitabl substitut event video prefer agent type park water pioneer work area talk intrigu possibl futur construct interact face agent evalu humanoid synthet agent capabl assist instrument investig user percept speech output talk sophist talk head baldi talk head produc synthet auditori visibl speech highli develop simul vocal tract shown user interact thalmann facial commun virtual facial face featur track work draw heavili model human facial express develop ekman repres nonverb commun behavior face work concentr speech anim synchron extract virtual realism includ believ simul virtual impli natur virtual human experi pose question particip prefer present imag agent hear disembodi voic takeuchi nagao show peopl interpret facial system facial displai success system lack displai show facial displai concentr argu necessarili neg effect anthropomorph interfac suggest show user appreci human imag interpret imag imag experi report make assess effect imag type attitud experi report evalu select humanoid agent includ cast anim humanoid head embodi agent badler written vision futur virtual human anim tool motion provid anim greater scope develop anim futur studi human movement provid understand anim agent move human movabl virtual walk result experi paper show retail applic offer import environ humanoid synthet agent technolog advanc speech speech synthesi dialogu manag made synthet humanoid interact agent assist user complet task retriev inform product servic studi interfac suggest goal interact research necessarili give comput human determin face interfac research discuss paper evalu synthet agent attempt discov scope includ agent applic studi lester walker al show agent strong visual presenc facial engag motiv user expand empir evalu report show agent type point face dislik sensit walker al demonstr task perform neg affect face interfac result experi paper show agent type distract necessarili lead poorer task agreement result walker al distract reduc attitud agent assist discourag interact agent advantag presenc synthet agent interfac fulli realiz aim work report discov altern mode advantag synthet humanoid agent environ ii synthet agent implement agent experi compar user attitud cast synthet agent type environ contrast applic investig applic depend effect male femal version contrast agent creat fig read male femal person plai role assist record video script dialogu assist avi script file extract speech output femal assist voic femal agent talk head imag person creat map model human creat talk head phonem match match video file facial express imag male femal video adob vari frame imag produc frame import adob run sequenc creat anim imag graphic lip movement facial express eyebrow blink imag static imag male femal assist video record voic creat audio file extract record includ disembodi voic interest issu anthropomorph charact visual interact interfac predict applic receiv posit predict made base literatur mention user benefit presenc agent interfac male voic male predict ieee transact system vol septemb attitud voic male agent femal voic femal attitud voic femal agent addit male femal agent agent type design verbal nonverb predict agent type rate similarli agent increment scale humanoid agent creat primarili studio max voic agent creation creat voic agent chang due neg comment voic deem suitabl extens voic agent voic agent includ control cast agent head male femal anim head creat fig head male femal version head creat agent nod time turn interfac embodi male femal version male femal head creat fig embodi male femal version male femal head creat nod eyebrow includ gestur ad realism agent agent turn interfac embodi environ agent insid applic environ left main applic window male femal version ident differ posit interfac investig user attitud embodi agent virtual environ predict applic receiv posit male voic male predict attitud voic male agent femal voic femal attitud voic femal agent addit male femal agent agent type design verbal nonverb predict agent type rate similarli verbal nonverb behavior facial facial movement speech inton attribut visibl agent experi random blink introduc fig imag male femal agent fig head embodi agent visibl agent facial express record natur creat video introduc control manner visibl agent experi question agent voic stress main word eyebrow visibl affirm agent blink end sentenc mutual gaze user maintain user speak end turn visibl gestur introduc control manner embodi agent cassel categori spontan spontan gestur constitut major gestur introduc embodi agent evalu experi natur dialogu support deictic beat gestur embodi agent deictic gestur point select area top direct user gaze point afford beat gestur nonverb behavior agent type iii applic implement contrast applic interfac chosen consist interfac window displai synthet agent size main applic evalu humanoid synthet agent select posit applic window minim visual visual element applic interfac design consist applic furnish graphic user interfac creat style main window view live room dynam updat request custom fabric sampl select order decor room synthet agent displai window side interfac dialogu illustr agent decor room ident dialogu extract examin tabl applic cd cd main applic window view person updat addit select area row track select person cd synthet agent displai separ window dialogu illustr agent order select track choic listen music excerpt track case disembodi voic agent standalon movi creat male femal version agent type desktop video editor adob manipul seri jpg file imag sequenc live room sequenc imag import appl quicktim movi file creat multimedia quicktim movi file interfac movi file synthet agent export director creat projector time audio visual interfac iv procedur procedur essenti ident alter made design experi improv base feedback gather experi separ group particip part distribut gender ag ag group particip part accommod addit agent type includ cast particip read explan experi prime verbal experi supervisor view video director present random order pentium ii show dialogu synthet agent format questionnair retriev quantit data ident applic dialogu assign agent particip felt repetit ident dialogu similar ident dialogu assign agent fig interfac applic home furnish tabl dialogu excerpt applic fig interfac applic cd servic tabl ii dialogu excerpt applic attitud agent statement shown tabl iii attribut agent assess particip dialogu custom femal disembodi agent passiv methodolog assess agent extrem avoid complex technolog ieee transact system vol septemb tabl iii questionnair item issu involv creat fulli function interact applic rang full evalu interact applic provid inform evalu substanti cast agent made end session particip part short interview provid opportun expand underli issu qualit inform view applic function behavior applic particip rate sale assist scale experi evalu ten synthet agent applic home furnish servic experi evalu ten synthet agent applic person cd servic experi progress assess cast humanoid agent applic home furnish servic result present result agent result experi group assess comparison agent contrast applic order obtain rate ten synthet agent result rate scale complet interview experi analyz repeat measur anova carri agent agent applic independ variabl rate score depend variabl highli main effect agent type margin effect agent gender main effect applic interact effect subject variabl particip ag group particip gender tabl iv show rate agent type applic result comparison attitud questionnair statement express particip felt servic good idea anova agent agent applic independ variabl show highli effect agent particip attitud follow gener trend video popular tabl iv rate score comparison agent type tabl score applic agent questionnair servic good margin effect agent gender male agent posit rate femal agent femal male effect applic found interact agent type applic interact agent type applic suggest significantli attitud agent applic fact lower score imag cd home furnish servic analysi result show particip find servic difficult applic interact anova agent agent applic independ variabl show effect servic gener effect agent type interact anova show highli effect agent particip servic agent male femal male max result discuss detail effect neg distinct accent femal voic attitud anova agent agent applic independ variabl show highli effect agent type particip clariti voic result suggest interest perceptu effect voic male femal agent type ident particip vari attitud clariti voic agent type video disembodi voic rate similarli respect clariti comparison show voic significantli clearer voic significantli clearer evalu humanoid synthet agent anova analyz particip voic result show effect agent effect agent gender effect applic found femal voic male femal male max particip explain femal voic distinct accent male appeal particip interact natur anova agent agent applic independ variabl show highli effect agent respect natur highli effect agent gender applic result show video felt natur significantli natur male agent prefer femal result explain neg attitud femal voic femal male max figur show applic natur home furnish servic cd servic home furnish cd servic max due particip familiar music track mention particip interview attitud friendli questionnair differ attitud friendli compet agent type anova show effect agent agent applic interact found particip felt agent equal compet agent type anova show differ respect friendli agent result agent gender male agent significantli femal femal male max result applic show agent cd servic home furnish male max result explain interact gender applic show femal agent cd servic significantli home furnish servic attitud particip thought assist result agent interact agent type applic home furnish video significantli applic video significantli tabl vi score agent type questionnair voic clear tabl vii score agent type questionnair tabl viii score agent type questionnair felt tabl ix score agent type questionnair felt assist tabl score agent gender applic questionnair assist tabl xi score agent type applic questionnair assist tabl xii score agent type questionnair assist unsuit attitud assist suitabl applic anova show differ agent type video significantli ieee transact system vol septemb tabl xiii score agent type app questionnair tabl xiv score agent type questionnair thought assist result agent gender male agent suitabl femal male max anova analyz result particip agent result show highli effect agent type respect agent interact agent type applic comparison show video popular highli effect agent gender male agent prefer femal male neg femal voic possibl impact attitud particip thought assist natur result emerg respect agent type video thought natur agent type interact agent type applic agent applic trend video natur cd servic result follow trend reason imag artist agent interfac particip agent unnatur compar unnatur compar visual stimuli interfac attitud facial questionnair particip felt speech match lip movement anova agent agent applic independ variabl show highli effect agent type indic particip awar agent lip movement effect agent gender mean agent type suggest particip lip synchron video tabl xv score agent gender applic questionnair assist tabl score agent type questionnair tabl rate score agent type agent questionnair experi address attitud facial gestur embodi agent gestur assess base result agent addit questionnair item address agent person facial express includ experi due fact experi show applic particip experi wit agent applic home furnish servic particip opportun rate agent scale score give indic particip prefer agent repeat measur anova agent gender agent type independ variabl rate score depend variabl show result agent gender femal agent prefer male agent femal male max interact agent type agent gender show agent type gender rate differ femal male version femal embodi agent environ rate significantli higher male counterpart attitud anova agent gender agent type independ variabl show effect agent gender particip evalu humanoid synthet agent tabl score agent gender particip gender questionnair tabl score agent type questionnair voic voic assist femal voic prefer male voic femal male max greater prefer femal particip voic femal agent male male femal voic equal particip voic assist natur anova agent gender agent type show voic male agent thought significantli natur femal agent femal male questionnair item particip thought voic assist annoi statist result show result agent gender particip felt femal voic annoi male voic femal male questionnair item show differ agent type result show voic embodi agent significantli annoi embodi agent voic agent type result highlight interest effect percept voic base actual agent agent attitud particip felt agent result anova show differ agent type significantli polit disembodi voic fulli embodi charact thought polit head result suggest embodi agent plai import role percept polit interact particip gender agent gender show femal particip thought femal agent polit male male particip thought male agent polit femal agent attitud anova agent gender agent type independ variabl show differ agent type tabl xx score agent type questionnair assist tabl xxi score agent gender particip gender questionnair assist tabl score agent type questionnair assist tabl score agent type gender questionnair assist result agent gender interact emerg score show deem friendli show significantli friendli result show fulli embodi agent plai import role head percept agent friendli attitud anova show effect agent gender respect compet agent effect agent type emerg femal agent compet male agent femal male max specif situat case result explain poor percept male voic poorer accept male embodi gestur attitud particip thought assist result show femal agent thought significantli male agent femal male max effect agent type result agent type attitud anova show result agent gender ieee transact system vol septemb tabl score agent type questionnair assist tabl score agent type gender questionnair assist result show femal agent suitabl applic male agent femal male interact agent gender agent type evid show male embodi agent suitabl applic femal qualit find particip perceiv male embodi gestur domin femal embodi gestur gender differ result reiter particip assist anova show femal agent prefer male agent gender differ occur significantli agent type femal significantli prefer analysi qualit interview particip perceiv male embodi hand domin turn distract attitud facial base feedback previou addit questionnair item pertain agent facial express includ analysi agent anova show significantli lip movement distract particip lip movement distract dub lip movement talk head notic artifici result agent gender emerg anova show result agent type respect lifelik facial express facial express head lifelik effect gender emerg show facial express significantli lifelik face make difficult particip judg score similar talk facial express fig score agent type gender questionnair tabl score agent type questionnair lip movement tabl score agent type facial express made assist tabl score agent type questionnair gestur attitud anova agent gender agent type show particip significantli prefer femal gestur male gestur femal male max thought femal gestur significantli male agent femal male max anova show effect agent type gestur result show gestur agent thought embodi agent embodi anova produc result agent type gestur made assist lifelik evalu humanoid synthet agent tabl score agent type questionnair gestur made assist tabl xxx score agent type questionnair gestur made assist fig score agent type gender questionnair gestur made assist perceiv lifelik significantli anova produc result agent type gestur made assist friendli significantli result show gestur gestur promot lifelik friendli agent final particip gestur anova produc result agent gender agent type interact agent type agent gender evid gestur embodi agent perceiv fulli embodi significantli case femal agent insid space vi discuss agent claim interfac support particip group receiv home furnish applic cd servic applic posit applic depend issu emerg evalu agent applic agent rate similarli applic differ occur imag prefer home furnish servic suggest presenc imag artist cd servic interfac addit imag result differ applic agent type number issu emerg respect voic agent quantit data femal voic qualit data reiter femal voic receiv number neg comment particip comment voic annoi voic agent select carefulli clear fluent voic desir agent impact percept clariti voic agent voic perceiv fact voic output agent gender ident video thought natur includ disembodi fact agent custom ident result suggest video natur agent type applic prefer video disembodi voic agent cast particip prefer interact agent exhibit facial express nuanc complement agent consist find reev nass discov particip prefer interact agent consist reflect behavior particip behavior prefer visual displai prefer disembodi voic popular disembodi voic interest issu synthet agent interfac addit ensur behavior correspond visual applic task afford visual displai agent particip comment imag assist distract made interfac interfac design assess servic applic carefulli establish agent actual enhanc distract signal friendli polit high prioriti particip enhanc retail applic number particip set experi suggest cartoon agent assist video imag human anim charact make agent complet user expect capabl agent ieee transact system vol septemb agent experi larg encourag anim agent interfac particip enjoi capabl applic prefer agent interfac found agent prefer agent fulli embodi agent prefer head rememb particip group anim agent interact system cater user turn visual displai nonverb behavior develop provid essenti inform user prefer agent result show gener prefer femal opposit find agent experi previou find suggest fluent voic attempt voic agent femal voic male voic result show import select voic agent carefulli claim attitud male femal agent agent type similar result show femal agent gestur explain larg neg attitud gestur male embodi agent world compet femal agent thought explain poor percept male combin poorer percept male voic differ agent type result show fulli embodi agent thought polit interest research issu percept embodi person movement anim bodi introduc shown agent world desir agent world explan suggest particip prefer embodi agent world particip felt agent distract happen agent tend block view live room space import rememb environ suitabl inhabit anim agent depend applic agent world disembodi voic task demand attent user agent adequ mobil block view male embodi agent world poorli accept gestur perceiv domin larger femal counterpart result show embodi agent environ accept particip embodi agent ad dimens agent proport gestur agent fact accept environ task vii paper provid agent commun fact aspect agent environ human carefulli voic friendli inton agent creat imag make agent lifelik nonverb commun behavior select gestur facial express complement gestur undermin percept agent humanoid talk head humanoid embodi agent appeal user agent gestur promot percept lifelik ensur dimens agent proport dimens environ agent insid virtual environ examin applic task carefulli assess agent distract user task environ acknowledg author colleagu dr input suggest research staff bt park plan experi refer andré user project charact proc workshop oct pp control virtual commun vol pp aug cassel embodi agent mit cassel power nod envelop versu emot feedback anim appl vol pp cassel architectur embodi proc workshop oct pp van impact anim interfac review empir int vol pp jan talk facial displai base morph proc comput anim june pp commun interfac collabor virtual virtual realiti vol pp evalu humanoid synthet agent king proc chi conf companion human factor comput common apr studi effect softwar msc mass inst lester believ anim pedagog proc int conf autonom feb pp lester persona affect impact anim pedagog proc human factor comput mar pp techniqu measur archiv vol perceiv talk speech percept behavior principl mit agent proc workshop juli pp assess effect synthet persona multimod proc int conf autonom june pp park comput facial anim reev media equat stanford univ rickel orient dialog anim agent virtual proc workshop embodi pp handbook method nonverb behavior research cambridg univ takeuchi facial displai proc human factor comput apr pp virtual human virtual proc int conf autonom june tutori virtual proc vol model dialogu phd mass inst van persona substanti proc human comput interact pp human face proc human factor comput apr pp water system synthet face multimedia tool vol pp multimod retail proc workshop interact dialogu sept helen receiv honor electron engin nation join centr commun interfac research pursu phd investig embodi agent applic research interest includ speech design autonom anim develop social intellig agent jack receiv electron engin msc digit phd engin professor electron edinburgh lead multidisciplinari team research centr commun interfac research investig usabl engin ecommerc servic main research interest dialogu engin virtual realiti system design advanc ecommerc consum applic
IR/598 5 intern confer comput transpar control larg complex system zhang faculti germani control problem descript recent advanc theori applic neural network fuzzi rule base system control physic system adequ model linear di erenti equat fuzzi rule descript system advantag neural network model integr automat featur extract learn membership function fuzzi control structur deal local procedur design construct model control understood human user gener fuzzi rule system larg number input variabl su er problem real applic identifi correct factor reduc number minimum gener solut build transpar model interest theoret point view practic applic wide rang complex intellig control problem typic problem brie system identi cation unlik markovian system output depend current previou train data set nonlinear system identi ga data studi compar input ga ow rate output concentr candid input build fuzzi control mean solv problem input de ned linguist result fuzzi rule system million rule model predict highwai economi nancial market complex problem expert estim ten hundr factor reconstruct scenario hard di erenti interdepend complex machin adjust advanc enabl machin equip multipl sensor enhanc perform autom project aim automat adjust machin achiev minimum grain loss maximum harvest set paramet open rotat blow optim set model optim machin set expert achiev set paramet main assum uenc factor grain grain air gener weather wind vehicl speed fuzzi set ideal applic model approxim measur variabl fuzzi model limit number problem uenc factor account inform robot motion classic approach robot vision face big imag process featur extract classi cation robust real process algorithm requir ful lled case research goal gener model transform raw imag data directli action valu imag pixel measur bright level extra imag process control system input variabl model output system motion valu robot robot robot build direct model map input larg part current scienc technolog base analyt method ned domain acquaint explain model physicist richard wrote describ natur gener albert einstein believ explain law physic mechan interpret process natur ow fuzzi linguist rule relat descript easi understand comput type fuzzi rule system model approxim function good reason make control model symbol linguist model transfer skill human expert robot transfer rule human knowledg patch model case data de cienci automat learn transpar model make valid develop easier larg part design shift human comput transpar model wide applic system control complex system base compact descript system model state art structur interpret model varianc fuzzi rule system multipl hierarch fig fig illustr structur solut hierarch structur assum input inform classi ed group group input determin intermedi decoupl input group exist gener automat approach heurist base fusion physic sensor automat inform filter amount inform maxim inform content maintain dimens input data reduc method deal larg system complet fuzzi system rule addit fuzzi system rule multipl fuzzi system rule figur fuzzi system input linguist term hierarch fuzzi system linguist term result rule situat evalu percept behaviour blend hierarchi rule determin weight monolith control figur hierarch fuzzi system input select concept method import input variabl larg number combinatori possibl fuzzi model consid approxim test select input enabl result view build exact model concept simpl implement gener model interpret disadvantag concept input mean inform loss control combin number fuzzi control system thousand million input larg evalu featur extract featur extract signal imag repres inform medium high level select featur ful comput fast featur variabl independ featur vector adequ inform determin featur observ stabl process featur possess mean intermedi featur select manual experi human expert neural network automat method comput linear combin determin output relev featur scenario base subspac project depend measur data similar observ sensor pattern variat small number eigenvector calcul princip compon analysi provid summari state input variabl left part fig result show case high input ectiv dimens reduct achiev project origin input space number input variabl time seri possess case larg reduc method approach comput featur call approach eigenvector partit cover linguist term part fig fuzzi control construct model pattern code pattern match rule fire eigenvector princip compon rule input vector output nm figur map interpret model input vector consist measur system thousand pixel imag linguist interpret exampl pro le gener linguist term figur automat model build function model ideal implement cmac albu de ne linguist term input variabl basi function output variabl singleton method requir fewer paramet set function gaussian output comput simpl interpol process transpar achiev good approxim capabl rapid converg control automat gener basi function interpret basi function posit system output dramat depend smooth origin system function demand model di erent order chosen optim placement input found genet fig illustr function gener membership function interpret tab show rule tabl method work case vt vl vh tabl rule system model number rule larg number rule result tting lost interpret model psycholog survei reveal number minu human capac limit inform process linguist modi optim partit rule base reduc minimum shown tab vl vl tabl rule tabl automat optim partit scenario data main advantag system comparison adapt system perceptron interpret control function transform project eigenspac back origin input imag control rule interpret scenario imag consequ control output illustr rule task guid robot hand imag optim grasp posit screw input variabl linguist term rule altogeth automat learn rotat control rule scenario rotat scenario rotat futur research theme integr neural fuzzi genet chao theori classic probabl theori control method plai central role futur research list import optim input factor track focu interest extent sensor capabl inform softwar robot linguist model human percept sensor fusion inform incomplet noisi perceiv capabl qualiti reinforc signal tness evalu learn system integr symbol granular fuzzi rough set enabl arbitrari transit digit measur concept learn analyt model solv problem properli reliabl model biolog climat environ evolut equip larg amount industri machin consum product higher machin intellig quotient make easier adapt show higher perform save resourc build robot program complex sensor pattern human refer albu approach manipul model articul control transact journal dynam system measur box jenkin time seri analysi san soft comput prentic miller magic number minu limit capac process inform psycholog wang approxim hierarch fuzzi system fuzzi set zadeh comput number comput word manipul measur manipul percept ieee transact circuit system januari zhang construct fuzzi control model principl applic intern journal intellig zhang integr delib reactiv strategi fuzzi modular control logic techniqu autonom vehicl edit learn model control intern comput control page schmidt control model manipul journal robot autonom situat control robot robot autonom
HCI/599 4 driven facial anim realiti abstract demonstr morph base autom audio driven facial anim system base incom audio face imag anim full lip synchron express anim sequenc optic flow incom audio stream pictur face speak rule formul base durat control continu term shape extent lip open addit combin gener anim facial express final applic system discuss context creat realiti introduct human commun verbal word sentenc human commun gestur prosodi design implement comput system cover rang interact face voic challeng object human comput interact research work speech visual inform creat realiti incom audio stream pictur face repres distinguish lip shape pp anim sequenc construct face imag imag align optic flow transit comput store run incom audio phonem video frame identifi transit frame gener optic flow morph base anim consid past paper seek extend includ anim express richer scope anim anim face express assum exist video head subject present express facial method present gener remain facial express basic express consid happi sad section present facial anim system model section method gener anim discuss section summer train indian inst ibm india research lab block indian institut technolog india discuss applic present evalu system context creat realiti final present section system model facial anim system consist extract synthesi modul background process modul audio video speech recognit unit express recognit unit figur extract modul extract imag figur show extract modul incom stream synchron recogn phonem map phonem video frame repres express recognit unit audio base video base short sentenc sharp quick brown fox jump lazi captur extract imag express normal imag optic flow gener complet set express optic flow calcul figur background process modul background process shown figur extract imag correct small pose differ express extract modul gener complet set combin final optic flow express express comput store audio input extract time inform map phonem phonem recognit gener speech recognit unit express transit express sequenc recognit unit figur synthesi modul phonem phonem tabl phonem map rule gener video store imag optic flow figur show synthesi modul incom audio stream time phonem transit express extract phonem map map shown tabl time inform phonem transit extract languag speech recognit engin express recognit unit base audio correct express case express map explicitli provid combin determin frame time inform long phonem transit turn give transit transit brought precomput optic flow anim section show anim system paper achiev realist interact face voic voic speaker left unalt normal imag system wait occurr express combin extract combin footag imag obtain align imag anim result sequenc disturb unintend head motion align imag method similar normal imag compon motion rigid bodi motion rigid motion rigid compon due head translat rigid compon due express lip shape face approxim singl plane view perspect project result describ optic flow rigid motion facial featur captur model model extract rigid bodi compon motion align imag estim paramet approach suggest tsai huang modif tsai method base perspect displac field model kind model method basic squar fit imag gradient singular decomposit calcul paramet facial imag estim rigid bodi motion compon warp imag model align imag slight facial deform due assum planar model face perspect project set imag align respect singl imag repeat process iter lip synchron audio time inform extract incom audio stream speech recognit unit lip movement synchron extent morph govern time inform normal imag intermedi frame gener optic flow base morph techniqu similar transit occur time gener frame time imag warp optic flow calcul optic flow warp obtain imag cross dissolv weight obtain final imag gener frame restrict extent morph depend durat transit figur show rule system transit durat threshold heurist gener morph transit durat morph complet case extend durat transit reduc durat transit transit long morph repres morph complet involv lip closur closur transit occur morph complet irrespect durat complet morph gener morph optic flow comput imag optic flow gener optic flow comput costli imposs real transit optic flow calcul approxim optic gener morph system threshold facial express synthesi background process modul complet set combin central problem solv facial express transit transit gener complet morph adjust optic flow transit gener complet morph adjust optic flow transit figur audio synchron gener incomplet morph facial express gener facial express gener exploit similar found transit facial express import task appropri insert facial featur present delet facial featur present present emploi optic flow techniqu accomplish task accomplish figur find correspond pixel call call put iti pixel ing pixel call optic flow obtain gener figur pair gener introduc featur figur detect facial featur pixel correspond pixel stand featur find correspond pixel call carri pixel found ing nearbi pixel nearbi pixel determin denc pixel nearbi pixel figur introduc featur suppress facial featur disappear figur detect featur present disappear pixel correspond pixel stand disappear featur find pixel construct imag suppress pixel featur imag figur figur exampl combin gener exist figur suppress disappear featur system evalu applic scenario motiv audio driven facial anim includ bandwidth reduct video movi agent multimedia telephon hard hear peopl simpl experi shown visual channel speech effect scenario listen crowd noisi environ vision add redund signal evid cue mask hear impair system test person hear impair sentenc audio left figur exist imag construct imag featur figur exist imag construct imag disappear featur clean case found addit video improv speech understand system valuabl video gener exampl scenario visual receiv end email sender receiv mailbox activ correct read match address case involv field audio due video photograph person shown tv screen audio system present video person speak gener shown audio vision direct attent sustain interest make peopl thing popular actor made thing peopl system thought talk face advantag direct attent sustain interest realiti creat anim face hold human attent successfulli engag person task obtain feedback qualiti clip made shown number peopl feedback posit specif anim clip pass origin express notic artifact teeth lip start autom system creat addit channel commun present audio imag facial anim lip sync express gener anim realist individu variabl preserv gener lip shape express system futur worthwhil includ featur correct gaze control pose eyebrow movement ey blink anim system refer black recogn rigid facial motion local parametr model imag intern confer comput pp cohn express emot face sixth acm intern multimedia confer recognit acm pp imag ieee tran vol pp septemb essa interpret recognit facial ieee transact pattern analysi machin vol pp talk facial displai base morph ieee comput anim pp visual speech ieee intern confer multimedia juli perceiv talk speech percept behaviour mit park comput facial smile frown normal whisper journal acoust societi pp tsai motion paramet rigid planar ieee transact speech signal vol pp
HCI/600 4 design augment realiti augment augment clip chi research bp cedex abstract present review approach studi design augment realiti system varieti approach definit ar requir classif defin characterist ar task focu natur augment base identifi class ar system addit notat complementari method base interact ar system model set compon commun crucial type compon adapt establish bridg real world virtual world defin classif aim provid understand paradigm ar lai foundat futur design principl class system keyword classif interact introduct recent design goal human comput interact extend capabl comput system combin real virtual order assist user perform task physic set system call augment realiti grow interest design paradigm due dual user benefit comput interact real world attempt satisfi requir consist reproduc real world comput model place user synthet world approach consist augment real world ar reconstruct real ar system aim augment addit inform approach ad graphic inform real world ad real world leav blank cm left column page copyright notic duboi research grenobl la cedex forc argu method augment capabl interact real world consensu definit ar design space design ar applic refer guidelin design principl applic domain ar reli method case comput assist medic domain system physic world surgeon oper tool provid inform includ scanner strategi classif design principl base technolog emploi design system account interact surgeon system common understand ar paradigm establish design principl independ applic identifi class ar system defin class system basi characterist identifi studi applic ar applic coupl classif notat model ar system interact level class ar system identifi characterist ar task focu natur enabl defin class system task focu focu refer object involv task mit project user user manipul brick act document menu applic object task multimedia document applic run comput augment museum user system wear inform exhibit displai user perceiv real object ad synthet inform object task paint exhibit task focu belong design augment realiti virtual world real world user perform task order manipul object virtual task focu object real task focu real natur augment augment provid system number form mit system user act user manipul real piec wood interact modal base real object provid user act multimedia document user perceiv unavail world object task visual percept user longer limit real world refer theori action augment dedic execut phase evalu phase natur augment execut number qualiti user evalu realist inform provid user class task focu natur augment defin orthogon classif ax combin valu task focu valu natur augment lead defin illustr figur natur augment execut evalu task focu virtual object block graphic real object museum figur type ar system explain media block gener tangibl user interfac augment execut phase defin modal involv real object modal enabl user manipul virtual object multimedia document augment evalu interact virtual object refer realist graphic screen output modal mimic real world feedback augment execut real world correspond system enabl user perform action real world comput digitaldesk user perform oper real draw final explain augment evalu real world consist visual inform real object interact model addit class ar system model notat principl firstli base identif compon interact system relat compon exchang model understand ar system interact level import type compon adapt establish bridg real world virtual world adapt defin type boundari world perspect shown differenti system enhanc interact real system enhanc interact comput everydai life object part modal distinct understand interact system make part real world classif scheme identifi design issu type studi compar exist system class classif scheme establish design model appli defin design principl acknowledg work support french nation scientif research center grenobl hospit imag feder refer survei augment virtual environ base augment palmtop displai manipul haptic conf proc human factor comput robot synergist devic conf proc seamless interfac bit conf proc world comput comput augment interact real world conf proc user center system perspect erlbaum space augment augment realiti case conf proc paper design augment realiti
Agents/601 1 plan recognit requir simul abstract potenti synergi pattern recognit reason support plan recognit simul combin graph probabilist principl dynam program appli trace behaviour flight satisfi constraint simul enabl agent agent abstract instrument level model invok standard oper base activ reason model constrain recognit process frame queri pilot expect execut current result experi involv dmar procedur reason system pattern match induct system simul import captur rel inform simul includ relationship introduct air oper defenc scienc technolog australia oper simul answer specif question equip compon capabl danger tactic oper flight intellig pilot interact comput human pilot virtual environ interact simul pose challeng integr valid pilot compet comput control agent involv model pilot percept recognit action event occur simul pilot agent exhibit behaviour knowledg attempt achiev case cooper achiev commun explicitli coordin action commun unavail environ hostil air agent develop model mental state agent base observ world inferenti reason comput agent oper flight simul perceiv requir label intent individu agent team structur abstract level agent reason agent intend symbol level involv agent activ instrument level automat wai plan oper pattern import agent recognit model simul architectur identifi agent percept import factor steam system includ battlefield mission involv thousand virtual agent hidden markov model simul robocup leagu singl state system adapt multipl entiti oper simul relationship agent advantag scheme model method repres uncertain knowledg commun behaviour coordin defenc campaign flight simul involv simul air oper simul centr projector displai facil plan recognit reason explor outcom base tactic dmar multipl agent parallel agent realtim control agent standard oper procedur physic model simul motion base plane model activ virtual environ produc trace instrument trajectori agent scene data input gener loop continu trace pilot behaviour output flight task simul physic model maintain instrument rel activ individu output includ platform definit updat inform agent format shown defin platform platform state updat oper agent incorpor air oper run oper simul involv intent receiv contact work paper innov applic ai stream oper agent achiev project area improv make easi construct transfer scenario standard oper agent model behaviour necessarili behaviour issu confront design agent suitabl oper simul recognit plan user whilst execut problem harder identifi action complet pilot agent happen simul millisecond plan recognit requir agent capabl observ environ extract pattern assist trigger recognit observ process simplifi agent concept agent inferenti reason natur observ make natur current situat influenc interpret observ reason process set context observ process reason data emerg simul requir air combat domain specif characterist model human reason air combat simul place requir natur plan recognit domain present exampl difficult scenario plan recognit encount environ physic posit aircraft tactic emploi chang quickli pilot act team defin role team subject dynam rearrang militari scenario air combat environ hostil pilot activ attempt destroi aircraft face difficulti reason incomplet inaccur knowledg sensor electron surveil measur subject limit rang accuraci enemi aircraft activ emploi sensor figur illustr situat occur combat serv highlight difficulti emerg domain pilot find situat requir deal simultan plan execut aircraft figur show pilot engag case simultan execut plan evad aircraft intercept long plan mutual coexist challeng exist simultan execut plan figur multipl simultan plan simultan place posit attach evad scenario indic type situat recognit system deal successfulli emploi simul observ aircraft limit primarili case close inform messag radio limit suppli sensori inform mean inform process pilot enemi tactic primarili trajectori aircraft data requir code plan standard oper procedur plan desir model procedur reason semant model base tree structur model includ multipl world model uncertainti inher agent environ agent limit percept environ world includ time tree singl past multipl futur multipl futur repres choic action agent languag repres world semant combin modal logic comput tree logic definit made current state entiti environ perceiv agent label state agent commit agent achiev goal progress futur path lead goal select select plan form select execut select intent base belief agent current state environ process select form plan reason figur bdi reason approach proven benefici air oper oper agent simul militari support dollar requisit partli reflect matur fundament limit overcom term requir set rao includ wai relax perfect knowledg plan reason modul rel intent perceiv entiti environ make easier explan plan invoc multipl agent execut plan agent capabl reason futur action agent desir predict action agent advanc execut agent measur support friend counter foe greatest chanc success predict futur action requir knowledg plan attempt underlin import plan recognit agent predict action mental model develop includ plan execut observ atom unit plan recognit accumul evid accept singl plan set multipl plan applic singl observ event remov agent acquir evid time evid plan reject imposs remain ambigu remov singl plan remain plan recognit successfulli complet process simpl number applic plan small discret differ plan bdi approach made easier codifi tactic build explan found easier construct modifi oper agent agent capabl simul ship implement dmar procedur reason languag bdi improv abstract declar procedur knowledg improv success oper simul measur term stakehold expert oper requir relationship pilot critic concern interpret bear aircraft rel match tactic trajectori data discret event give clue plan enemi pilot execut missil launch detect warn radar mode oppon radar lock requir captur explicit activ descript relationship abstract requir queri return paramet locat time abstract relat difficult talk form queri return situat relat gener state defin repres direct relationship state si sj term numer attribut attribut simul rel spatial tempor attribut angl time differ state requir recognit ahead time level abstract import factor success recognit effect domain constraint engin system recognit pattern match work design smart domain constraint system expect abstract demonstr provid decomposit event talk activ compound entiti explicitli repres relationship entiti match modul involv includ higher level recognit relationship thing environ level good thing rel goal activ hierarchi explicitli talk leav leav abstract level agent program plan train instanc behaviour search middl architectur view languag plan experi base modul figur match learn implement abstract process multipl attribut state inform requir attribut relat agent agent relat relat requir abstract maintain set time instant contrast singl state transit model hidden markov model repres current situat form singl state observ state standard instrument reason modul queri recognit plan experi match learn modul reason figur plan recognit comput control pilot start set initi frame activ occur modul match modul expect kind thing exampl queri statement match modul subsequ past instanc partial match specif episod similar adapt graph match learn techniqu handwrit domain flight consolid learn algorithm base relat evid theori circuit flight experi system induct logic program principl attribut tree learn induct logic program extens tradit logic program backward specif abstract similar match learn rule machin learn commun call lazi minut match term approach match carri exampl exist match instanc match aim make correspond set state current instanc exist proce stage figur step induct attribut taxonomi abstract rule gener discrimin attribut state techniqu base program gener specif search relat rule induct initi gener satisfi relat exist initi rule rule variabl state continu attribut variabl fall rang attribut shown question stage rule specif differenti relat structur present success gener rule index attribut valu form rang rule replac rule attribut techniqu approxim cluster attribut rang rule partit rule depend attribut state state incorpor rel inform achiev gener rule includ exist rule term notic rule includ rule hand side satisfi rule path relat state relat state connect spatial tempor attribut notic satisfi rule satisfi subsequ state space time result hierarchi rule extend rule exist condit attribut rang occur attribut adapt step match match state current solv respect state exist stage rule inspect relat satisfi rule relat satisfi rule bind variabl state current exist repres relat exist satisfi notic possibl correspond resolv rule partit cluster rule state bind partial match exist state current match state exist occur rule correspond state match step rel match current test exist ad order maintain order rel probabl match remov head queue rule cluster criterion match state exist current solv determin match probabl measur requir rule partit rule rule result tree part index rule underli bayesian network hierarch condit relat rule tree formul analyt determin probabl rule rule tree rel probabl base distribut attribut condit depend hierarch condit rule rule rule attribut probabl correspond condit probabl relat satisfi term determin likelihood ratio relat exist satisfi rule respect divid number relat satisfi rule rj exist number relat relat probabl correspond condit probabl relat current satisfi rule respect exist term divid number relat satisfi rule rj current number relat exist probabl determin current term exist rel probabl match calcul set rule exist gener specif search induct probabilist order effici dynam program principl implement match instanc hundr millisecond desktop workstat captur relat inform discrimin match state current unknown activ instanc occur simpli satisfi rule state inform step rule specif differenti relat structur present activ search gener specif probabilist measur dynam fast servic queri locat activ agent includ return rel spatial tempor attribut result simul trial trial conduct includ scenario situat shown figur match instanc scenario instanc train recognit rate high deem valid air oper simul trial demonstr feasibl approach requir recognit requir percept consist previou circuit flight experi pilot interact updat correct error import strength approach speed construct scenario instrument level transfer improv valid activ current weak combin reason match learn approach test agent entiti determin scalabl refer fly model air mission team journal appli intellig agent interact simul environ ai spring flexibl teamwork journal artifici intellig research autom robot behaviour recognit appli robot soccer proc sixteenth joint confer artifici intellig workshop team behaviour plan recognit im experi distribut central attent monitor proc workshop team behaviour plan recognit flexibl agent time pressur proc intern joint confer artifici pp intellig agent militari simul agent proc eleventh innov applic artifici intellig american associ artifici intellig deploi applic paper pp theori proc intern confer san june formal specif dmar rao intellig agent proc fourth intern workshop agent theori architectur languag springer plan recognit militari incorpor machin learn intellig agent proc workshop team behaviour plan recognit pp learn structur domain lectur note artifici interact match hand draw induct comput vision imag fighter tactic maneuv naval institut press maryland react plan rel rang angl situat intent desir list engag plane situat patrol sector low fuel belief action oper radar visibl segment flight trajectori react chang list intent send figur situat bracket attack repres flight patrol sector particip visibl reach target patrol intercept reason desir dmar system event rel attribut invok plan result plan end list list agent achiev desir reason standard oper procedur match previou event agent environ relat shown situat occur simul relat shown differ head differ time agent state
ML/602 6 reinforc learn discoveri subgoal ami andrew barto depart comput scienc amherst ma keyword reinforc learn mobil robot abstract abil adjust chang environ unforeseen circumst import compon success autonom space robot paper show augment reinforc learn algorithm method automat discov type subgoal onlin creat subgoal agent learn current task transfer relat task abil attain subgoal subgoal creat base common multipl path solut cast task find common learn problem concept densiti find solut introduc approach present addit result simul mobil robot task introduct robot withstand radiat vacuum work ideal candid creat maintain human habitat space robot effect learn adapt autonom research present paper step creat adapt autonom robot abil learn problem set simpler learn problem greatli expand rang applic learn system success reinforc learn introduc subgoal reward learn polici achiev polici option solv problem addit learn current strategi facilit skill transfer task subgoal paper describ method rl agent discov subgoal automat base idea ensembl behavior trajectori accumul agent interact environ ensembl process wai form concept learn agent focu discov subgoal achiev search onlin observ space bottleneck region agent observ space agent visit frequent success path goal unsuccess path suitabl definit bottleneck interest earli persist learn agent discov bottleneck region learn polici reach initi stage polici effect explor quickli refin polici subgoal polici facilit learn similar task treat problem find bottleneck region learn problem defin type system attempt identifi target concept basi posit bag posit neg bag consist neg instanc success trajectori correspond posit instanc agent observ trajectori neg bag consist observ made unsuccess trajectori argu problem find bottleneck region fit concept densiti detect bottleneck region method automat introduc subgoal studi context adapt product subgoal creat base examin protocol iba heurist reflect part algorithm discuss detail rl research method polici learn set relat task examin common probabilist combin form polici rl method introduc subgoal close relat research state visit frequent state reward gradient high chosen subgoal materi present reinforc learn rl learn agent interact environ seri time step time agent observ environ environ transit state emit markovian state reward depend state depend stochast manner object agent learn maxim expect reward receiv time learn map state action call polici object action maxim expect paramet return formul common solut strategi approxim optim map state action maximum expect return start state action action detail option framework defin subgoal option action select execut termin condit satisfi option action chosen option polici option tradit macro gener fix sequenc polici react environ augment agent set base primit set agent perform enhanc option tripl option input set state option option polici defin state option termin option termin probabl state option paper base polici intern modifi time environ defin addit term state trajectori length start time step sequenc state episod trajectori correspond singl episod continu varieti method segment experi trajectori trajectori end reward peak reach suggest iba heurist autonom subgoal discoveri simplest approach creat option search gener randomli base simpl agent test ad set action option degrad agent affect mode explor perform deterior due agent action select agent method creat option approach focu discov subgoal defin agent observ space option creat accomplish subgoal discov agent search bottleneck region observ space idea bottleneck region motiv studi navig task agent quickli discov util doorwai subgoal agent recogn doorwai kind bottleneck detect sensat doorwai occur success trajectori unsuccess creat option reach doorwai option learn current creat earli enabl agent learn rapidli relat task similar environ motiv bottleneck subgoal effect subgoal option agent explor agent form random select exploratori primit remain strongli connect region state space option achiev bottleneck tend connect separ strongli connect area navig navig primit movement command produc strongli connect dynam room room doorwai link strongli connect region ad option reach doorwai room close connect agent uniformli explor environ shown previou work effect explor main reason option dramat affect learn idea bottleneck subgoal confin navig task expect task similar dynam benefit subgoal discoveri paper game agent find kei open door proce discov kei quickli learn advanc level level approach work task bottleneck subgoal achiev make environ environ bottleneck area subgoal locat histogram histogram figur state visit histogram middl stage learn automat find bottleneck region observ space difficult task challeng onlin offlin method examin optim trajectori relat task common reveal bottleneck onlin method inspect trajectori gather learn case discret state complet observ approach simpli state frequent visit examin state count time result histogram gener bottleneck detect navig agent spend time room time move doorwai count visit state bottleneck readili visibl exampl type frequenc shown histogram figur histogram panel shade visit frequenc count collect higher count shade lightli lower count histogram show data collect run trial agent shown panel figur agent explor fix paramet reward agent reach goal state receiv reward discount factor meant agent learn find goal quickli histogram figur frequenc highlight bottleneck state frequenc idea visit frequenc detect bottleneck state drawback noisi graph illustr immedi obviou problem continu larg state space visit frequenc incorpor neg evid bottleneck state principl manner problem motiv learn paradigm concept densiti defin detect bottleneck learn densiti learn problem learn problem object classifi repres set featur observ classif learn author give explan observ result obtain domain explan account observ result multipl posit neg bag instanc posit bag posit instanc target concept neg instanc neg bag neg instanc individu instanc bag label goal learn concept evid present bag problem mine collect trajectori concept defin formul learn problem trajectori view agent individu observ vector instanc bag posit bag success neg bag unsuccess trajectori constitut success unsuccess trajectori defin success trajectori trajectori agent reach goal state matter step success depend reach goal number step bottleneck region observ space correspond target concept learn agent experi region success trajectori unsuccess trajectori maron concept densiti solv learn problem region featur space region instanc posit bag neg bag differ concept simpl densiti includ idea bag larg set instanc region maximum densiti detect exhaust search gradient descent maron defin densiti target concept probabl concept concept fc correct posit neg bag concept maximum dd output dd search perform instanti definit dd rule time assum uniform concept highest defin maron gener model model probabl event bag concept instanc bag probabl instanc target defin gaussian base distanc instanc target concept exhaust search find concept highest dd feasibl task search method successfulli larger problem concept densiti correspond concept bottleneck region region maximum densiti bottleneck region agent pass multipl success trajectori unsuccess abstract type concept space framework paper restrict attent simplest concept space consist individu state subgoal reach bag simpli state trajectori full advantag densiti calcul problem defin add state bag agent start end trajectori set state high densiti posit bag exclud state surround start end state bag iba static filter mechan static filter defin basi filter undesir subgoal discov agent form option agent creat set bag save search maximum densiti region agent creat small number bag initi stage densiti peak noisi bottleneck interest earli maximum densiti region persist learn easi detect region earli persist peak run averag state peak averag state initi end agent creat bag search concept high densiti concept found updat concept earli persist averag rise quickli converg agent examin concept averag rise threshold creat option creat option subgoal extract option input initi wai method paper search agent save state trajectori occurr subgoal subgoal found trajectori time step agent add set state visit agent time posit integ paramet input set subgoal option union state agent save trajectori method base examin optim function subgoal creat learn complet termin set subgoal reach agent longer input set option initi creat function state space problem reward function option give reward step option termin agent reward neg leav input set option function learn experi replai save trajectori algorithm discov subgoal creat option summar pseudocod tabl save full histori term linear size trajectori save memori tabl pseudocod algorithm present paper init full trajectori trial interact rl add observ full trajectori creat posit neg bag state trajectori search densiti peak peak concept found updat run averag threshold pass static filter creat option reach concept init examin trajectori set init polici experi replai agent save trajectori memori space problem practic number task section illustr util algorithm illustr problem result illustr illustr densiti subgoal discoveri simpl problem environ shown figur goal state lower corner trial start randomli chosen state room primit action usual primit action left action succe move agent chosen direct probabl uniform random direct probabl learn learn algorithm section agent creat switch learn algorithm macro agent limit creat option run agent creat posit bag trajectori successfulli reach goal state start state account number step trajectori neg bag creat small number calcul densiti state figur show averag log likelihood densiti state trial result graph averag trial averag densiti subgoal discov figur averag dd valu state higher dd valu shade lightli static filter exclud goal region wall reach low dd valu locat subgoal form learn agent state shade number time select subgoal locat lighter select subgoal ag graph slightli smoother individu graph peak densiti doorwai remain figur show locat subgoal creat run locat door frequent detect subgoal locat option primit step goal episod figur averag step goal automat subgoal detect reason import learn agent detect bottleneck state effect rate converg solut subgoal learn ascertain subgoal agent improv polici averag number step agent reach goal subgoal discoveri compar learn primit action averag result comparison run shown figur clear learn automat subgoal discoveri learn compar learn primit action initi trial option ad approxim trial automat creat option learn simpl task varianc shown differ learn curv greater standard deviat step goal episod step goal option primit experi replai partial experi replai figur comparison effect experi replai part state space result automat discov option learn task fulli understand option perform addit experi time spent experi replai initi option input set spent perform experi replai entir state space test agent equal amount experi replai entir state space start trial agent creat option option creat agent perform experi replai state option input perform smaller number backup total experi trajectori count number backup agent perform trajectori probabilist experi entir trajectori replai approxim equal amount comput work perform agent figur show comparison approach agent learn primit action result figur ax chang highlight region result experi replai learn current option discoveri advantag examin effect option initi polici agent perform experi replai state option input set backup occur main function option function option creat result experi shown figur perform agent partial experi replai indistinguish perform agent effect partial experi replai give agent polici navig doorwai learn quickli clear primari reason newli creat option benefici agent initi polici primit option task goal upper corner episod figur learn curv task compar learn option primit action reason automat discoveri subgoal agent subgoal option facilit learn similar task illustr learn subgoal task task chang move goal upper corner success probabl agent option initi option discov run previou task figur compar averag number step goal agent primit action averag agent learn subgoal option addit primit action avail option learn consist observ transfer task environ ensur option avail polici compar task transfer result experi agent start task learn primit function prior task agent start valu state option input set option compar learn agent result discuss comparison shown figur clear simpli function part task goal upper corner episod step goal option transfer primit valu transfer option valu transfer figur comparison knowledg transfer function newli discov option calli advantag option task transfer highlight distinctli simul robot task test method simul pioneer mobil robot robot simpl vision system field gripper sensor signal ball grip primit action set consist primit action distanc left rotat implement pd task find pick ball deposit close wall run wall time robot receiv reward put ball desir touch time step correctli deposit ball neg reward encourag robot accomplish task minimum time robot learn cmac tile encod repres state space figur simul pioneer mobil robot line eman robot repres sonar beam dash line show vision cone rectangl bottom show ball retina robot creat option run restrict subgoal express subset project sensori space subspac span width displac ball retina subgoal task involv robot move ball robot ball gripper ball loom directli front robot larg imag width retina figur show option subgoal discov robot run project relev sensori variabl figur robot discov subgoal close ball orient directli displac retina width object retina figur frequenc sensori variabl occurr subgoal run achiev robot displac width ball retina result show robot extract subgoal difficult task subgoal benefici agent task environ previou experi discret state algorithm continu space demonstr applic discuss introduc method automat creat subgoal option onlin search bottleneck observ space formul problem learn problem concept densiti solv illustr approach simul task show learn current task facilit transfer relat task result suggest approach aspect challeng automat abstract research part broader focu mine agent experi creat type option clear subgoal achiev type discov paper environ broader idea mine agent past experi yield option environ research part approach current research extend approach abstract concept space comput densiti concept form linearli discrimin surfac robot agent detect concept express singl point featur space develop onlin method filter delet option prove learn option task expect case initi subgoal agent discov shorter path goal potenti drawback method requir neg bag posit instanc case complic tricki defin constitut posit neg bag desir agent visit subgoal unsuccess trajectori affect result densiti calcul investig util noisi bag method influenc neg instanc width gaussian give bag rel measur success drawback method subgoal discoveri agent reach goal primit action option limit problem appli current research address wai extend approach appli goal state easili reach primit action acknowledg author grate comment discuss andrew work support nation physic scienc advanc technolog nation scienc foundat grant eia refer problem reason action machin intellig volum page north herbert simon theori learn psycholog daniel bernstein polici learn mdp technic report umc dept solv problem rectangl artifici bruce learn hierarch control structur multipl task chang environ anim animat iba heurist approach discoveri machin lin reactiv agent base reinforc plan teach machin od maron toma framework learn michael michael sara nip page mit press ami role reinforc learn master technic report ami andrew barto automat discoveri subgoal reinforc learn densiti intern confer machin learn icml ami richard andrew role reinforc learn proc grace hopper celebr women page richard sutton andrew barto reinforc learn introduct mit richard singh mdp framework tempor abstract reinforc learn artifici thrun schwartz find structur reinforc learn leen nip page san morgan kaufmann
DB/603 3 altern correct criteria concurr control lock protocol freez park park depart comput korea abstract concurr control protocol base commerci transact process system order provid serializ execut transact exist transact read recent version data item order ensur correct execut transact featur desir advanc system requir time secur constraint serializ correct call concurr control protocol extend definit relax condit protocol recent version previou prove schedul schedul serializ contribut paper concurr control protocol multilevel system serializ ml transact schedul satisfi secur constraint ensur serializ execut transact protocol produc serializ schedul covert channel protocol remov starvat high level transact protocol base phase lock freez order satisfi secur requir gener protocol provid higher concurr base contribut paper introduct serializ definit correct concurr control research work protocol serializ execut transact protocol maintain multipl version data item order reduc content access data concurr control protocol base provid higher level concurr base singl version order prove protocol base show histori produc protocol mv histori serial transact oper vice versa serial mv histori data item read transact write version mean transact read recent version data item mv histori serializ commit mv histori obtain delet oper belong commit transact definit suffici condit restrict introduc multilevel system ml system system share user clearanc level data classif order ml system satisfi requir serializ elimin covert channel prevent starvat high histori order oper transact execut rel level transact unauthor inform flow ml call covert channel order prevent covert low level transact delai abort high level ml system provid recent version version order achiev requir concurr gener definit repres oper depend prove mv histori histori serializ protocol base provid higher concurr perform base definit concurr control protocol ml system applic protocol ensur serializ elimin covert channel occur data content protocol remov starvat high level transact protocol primarili base phase lock order satisfi freez time transact version data item show histori produc protocol timestamp protocol produc histori protocol base definit protocol provid higher concurr remaind paper organ section correct criteria concurr control protocol section concurr control protocol ml system defin terminolog protocol examin exampl section prove histori produc protocol protocol satisfi secur requir conclud paper section call concurr control present benefit serializ order prove concurr control protocol show mv histori produc protocol serial singl version mv histori sv histori relationship serial mv histori transact transact read version data item written recent creat read oper begin mv histori commit project mv histori serializ mv histori histori transact repres read creat repres write repres commit histori read recent version mv histori serializ serial sv histori mv histori serial sv histori histori mv histori histori histori figur relationship histori figur show relationship histori provid condit exist concurr control protocol base recent commit version data item histori gener mean protocol mv histori mv histori transact unnecessarili block abort restrict assum transact read data item read write data item write definit transact serial mv histori definit serial mv histori set earli affect transact eat oe definit transact data item access read oper transact data item read empti definit serial mv histori data item transact read read oper satisfi case eat oe transact creat version start read oper select version ffl exist transact creat version read version creat creat creat figur ffl read oper select version written recent version creat start figur case eat oe transact creat version data recent creat data item tn transact creat version ffl transact write figur ffl read oper select version figur definit mv histori commit mv histori valid rang version read valid rang version read transact transact valid rang version read transact transact time time time time valid rang version read transact time valid rang version transact figur repres oper depend elimin limit transact read recent version boundari version transact read transact read recent version mv read oper transact affect read set previou transact histori read write version start read creat defin term refin mv histori transact set transact data item read oper transact select recent version version written read oper transact select recent version creat version condit recent version transact order prove mv histori mv show mv histori relationship introduc version order serial graph present version data item mv histori total order commit version mv histori version order serial graph mv graph node commit transact edg type conflict edg version order edg conflict edg oper version order edg version order edg occur lemma mv histori mv histori prove mv histori cycl order show mv histori tn version order cycl assum cycl edg edg case definit read select version creat start version written creat imposs case read creat commit case violat definit imposs exist creat read data item recent version start read creat commit case imposs fourth version order version order exist satisfi version order case imposs contradict assum make cycl serial transact read version creat reason case violat definit acycl show mv histori mv histori mv histori cycl exist topolog order serial mv histori topolog sort show mean topolog sort histori relationship histori proof similar present relationship read write includ version order edg make includ version order edg make transact write fall mv histori histori theorem mv histori commit project serial sv histori iff theorem mv histori lemma mv histori mv histori mv histori definit serial sv histori transit serial sv histori serial histori theorem serializ higher concurr elimin limit transact read recent version data item prevent starvat high level transact ml system concurr control protocol freez present introduc secur model protocol relat work illustr ml system secur model order enforc secur polici system popular model ml system model properti data access secur level transact denot secur level data item denot simpl secur properti read transact read data item restrict star write transact write data item restrict intend sensit data protect permit user secur level higher equal level data paper adopt model secur model relat work research work concurr control algorithm ml system concurr control algorithm base algorithm serializ covert channel algorithm high level transact version low level algorithm block high level transact read low level data item low level transact level commit orang lock algorithm restrict read low level execut begin transact order elimin covert protocol avoid starvat high level transact version lock protocol long transact compar orang reduc number abort high level transact protocol concept version period plai import role protocol version version period recent commit version overwritten version idea similar version algorithm long version period make high level transact read short version period number abort high level transact limit number version time tran tabl histori protocol ml system protocol base relax rule phase lock conflict read write write write elimin data item version creat activ call version transact read recent certifi version order meet serializ certifi lock delai commit transact activ reader data item overwrit certifi lock conflict read lock certifi lock terminolog assum transact read denot data item read creat start execut transact secur level definit hold read write lock data item directli frozen certifi oper hold read lock definit indirectli frozen directli indirectli frozen transact definit frozen point denot set pair time id transact identifi directli frozen certifi time id insert indirectli frozen id id id histori tabl transact secur level assum cr certifi oper directli frozen time low level transact certifi read interf lower level transact indirectli frozen transact frozen point transact empti rule properti present rule protocol assum share clock lowest secur level transact updat clock read clock fr fr illustr certifi oper perform version select read oper fr data item timestamp assign creat fr transact declar start fr transact read level data read recent certifi version data item fr secur transact write oper level data item protocol base write data item fr read low level data item case empti read recent version certifi read read recent certifi version time element id fr read certifi lock hold level wait transact certifi fr exist activ high level transact indirectli frozen transact dissolv mean element fp high level transact id remov fr fr describ fp transact affect made low level transact directli indirectli frozen fr execut directli frozen certifi time insert fr newli check exist low level frozen transact exist set empti element copi definit fp present definit transact greatest low level frozen transact describ properti histori produc protocol level properti appli level protocol addit properti cr certif read write oper cr commit cr cr mean transact read certifi version data item case read transact read version written high level transact read low level certifi version data cr cr cr cr properti easili prove properti case occur secur model case order prevent covert low level transact certifi oper hold read lock frozen read data item creat certif write conflict secur model serial order level cr mean read oper order certif transact write exampl examin histori gener protocol describ transact select version shown tabl transact secur level assum time tran tabl time directli frozen start schedul check oe common data item set oe read recent version tabl transact secur level assum tabl time time start indirectli frozen element copi rule fr time directli frozen includ includ start time affect oe includ fr read creat time read histori time tran tabl correct proof prove protocol serializ elimin covert channel theorem schedul produc protocol mean protocol ensur prove protocol similar tn set histori produc protocol tn cr repres certif defin version order impli cr cr examin version transact select frozen rule select version recent version select definit frozen point version read frozen transact certifi time smallest transact mean exist transact violat definit prove acycl show edg certif cr cr edg serial mv histori direct graph node transact edg repres conflict relationship transact edg correspond read transact read certifi version data cr cr oper version order edg gener case impli definit cr cr case impli cr cr cr cr option imposs definit requir cr cr cr cr edg certif acycl theorem theorem low level transact delai abort high level transact low level transact interf due data content high level transact secur transact read write data item level read data item low level transact conflict read data item write hold certifi lock request read lock hold read lock request certifi lock block compat matrix mean read certifi oper conflict wait complet certifi oper delai abort order prevent covert certifi delai frozen delai abort protocol satisfi secur requir mv transact read recent version data item serializ histori gener suffici condit serializ concurr control protocol protocol higher concurr protocol base definit elimin limit transact read recent version data item protocol protocol freez time transact version elimin covert channel starvat high level transact version recent featur high level transact abort resolv starvat high level transact section prove histori produc protocol mv histori protocol perform protocol base simul protocol observ behavior expect final result refer realtim perform vldb septemb recenc option transact multilevel secur ifip ninth annual work confer august comput mathemat mitr concurr control theori acm transact vol decemb concurr control recoveri queri lock vldb park lock protocol multilevel intern workshop realtim comput system lock consist share model hector gio transact distribut acm transact vol june correct criteria execut transact multilevel secur ieee symposium secur john mcdermott concurr control ifip work confer august concurr control multilevel secur ieee symposium research secur tsai secur concurr intern confer data dbm perform data prioriti base disk ieee system decemb flexibl method transient version record avoid lock technic ibm almaden research secur concurr control protocol ifip work confer august shankar lock protocol multilevel secur provid support long ifip work confer august criteria concurr control system technic report novemb multilevel secur manag system applic ieee workshop adapt polici improv secur system ifip work confer august integr lock intern confer data
ML/604 6 learn hidden markov model structur inform extract seymor andrew mccallum ronald rosenfeld school comput scienc carnegi mellon pa research henri street pa abstract statist machin learn proven field speech begin appli inform extract domain explor hidden markov model inform extract specif learn model structur data make label unlabel data show model multipl state extract field outperform model state discuss strategi learn model structur automat data demonstr data set model paramet improv extract accuraci model appli task extract import field header comput scienc research achiev extract accuraci introduct hidden markov model power statist machin learn techniqu begin gain inform extract task hidden markov model offer advantag strong statist foundat natur languag handl data effici develop evalu due exist establish train algorithm disadvantag hmm priori notion model topolog statist larg amount train data paper main aspect hmm inform extract investig learn model structur data applic hmm assum fix model structur number state link select hand priori domain argu inform correct model topolog typic solut state class optim examin role label unlabel data train hmm introduc concept label data domain label partial overlap target domain show data improv accuraci hidden markov inform enjoi success relat natur languag task wide tag recent appli topic detect track al dialog act model system hmm inform extract includ leek extract inform gene locat scientif system al extract unlik system automat determin model structur state model assembl inspect train exampl freitag mccallum multipl field focu model intern structur focu learn structur hmm extract relev account field sequenc work hmm center task extract inform header comput scienc research paper header research paper consist word main bodi includ author affili address automat extract field construct searchabl comput scienc research model describ paper part cora comput scienc research paper search engin al remaind paper structur review basic hidden markov model discuss learn model structur data examin estim model paramet unlabel data present result extract import field header comput scienc research paper conclud breakdown error hmm make discuss futur work improv model inform extract hidden markov model hidden markov model provid natur framework model product header research paper label word header belong class keyword model entir header class hmm task vari classic extract task identifi small set target word larg document unimport inform discret hmm set state initi final state set transit state discret vocabulari output symbol foe oe oe model gener string begin initi transit emit output transit emit transit made final state paramet model transit probabl state emiss probabl state emit output symbol probabl string emit hmm comput sum path restrict token forward algorithm calcul probabl observ output system sequenc symbol state underli state sequenc hidden common goal learn problem hmm recov state sequenc highest probabl produc observ arg max viterbi algorithm effici recov state sequenc hmm inform extract research paper header formul model state class author affili state emit word unigram distribut learn unigram distribut state transit probabl train data order label header treat word header observ recov state sequenc viterbi algorithm state produc word class tag word learn model structur data order build hmm inform decid state model state reason initi model state transit state state model optim case specif hidden sequenc structur expect extract build model multipl state transit state model make finer distinct likelihood encount class specif locat model specif local emiss distribut differ state class altern simpli assign state class learn model structur train data train data label class inform build model word train data assign transit state word state class label word token transit start state state train state train instanc end state model start point varieti state merg techniqu simpl type merg gener model combin state share link class label sequenc adjac titl state singl header merg singl titl state multipl neighbor state class label merg loop probabl repres expect state durat class merg state label share transit common state reduc branch factor model begin start state select transit titl model merg children titl state transit start state titl state remain model extract state merg made automat hand gener model hmm shown figur illustr model multipl state note public number state emit word multinomi distribut train class model structur learn automat start neighbor merg techniqu bayesian model merg bayesian model merg seek find model structur maxim probabl model train data iter merg state abstract end keyword note address email affili date author note titl start figur hmm optim tradeoff fit data model size reach relationship express rule calcul forward approxim probabl viterbi path model prior formul reflect prefer smaller model implement bayesian model merg learn model structur extract task accomplish automat data model structur transit emiss paramet estim train data obtain unlabel train data gener acquir label train data problemat label data tediou manual effort involv count class transit count word occur class deriv maximum likelihood estim paramet smooth distribut avoid probabl transit emiss occur train data unlabel train algorithm train model paramet algorithm iter algorithm initi paramet adjust model paramet local maxim likelihood unlabel data train suffer fact find local sensit initi paramet set sourc valuabl train data refer data find data label partial appli domain hand portion label data ad model estim process bibtex file bibliographi label citat inform label occur titl occur header label data train emiss distribut header extract bibtex field relev header extract data includ inform sequenc class header experi goal inform extract experi extract relev inform header comput scienc research paper defin header research paper word begin paper section end whichev occur abstract automat locat regular express match chang singl token singl token ad end case termin header special class word identifi simpl regular express convert special case newlin inform remov text target class identifi includ fifteen introduct public number page intro page class repres state output class captur languag phd master type sourc word token label header unlabel header bibtex file tabl sourc amount train data partial fulfil thesi note field commonli account phrase copyright citat thousand header manual tag class label header discard due poor rest split word token label train set word token test set thousand unlabel word token design unlabel train data train data acquir bibtex file collect web file consist million contribut header web train data sourc amount summar tabl class emiss distribut train label train data label data data set fix vocabulari deriv base data set label data distinct word word occur unlabel data combin label data produc vocabulari vocabulari unknown word token ad vocabulari model word train test data vocabulari map token word unlabel data exclud vocabulari estim probabl unknown word model select build hmm model vari number state paramet test model find viterbi path test set header perform measur word classif percentag header word emit state label word true label set model state refer model baselin model emiss distribut train class label data label data vocabulari maximum likelihood estim smooth smooth bell avoid probabl vocabulari word observ train data class number number accuraci model state link baselin tabl extract accuraci model state class extract accuraci result baselin model report tabl model model transit assign uniform probabl reli emiss distribut path achiev accuraci train label data model probabl set maximum likelihood estim label transit set uniformli model benefit addit inform expect number word emit accuraci jump model set transit paramet maximum likelihood achiev result set model fourth model add addit smooth count transit smooth transit probabl improv tag accuraci import note absolut improv due train data model perform train label improv data refer model model comparison model multipl state class outperform baselin model build model structur combin autom manual techniqu start model state built randomli select label train state class label manual merg iter manner header manual state select process transit count preserv merg maximum likelihood transit probabl estim state smooth class emiss distribut estim combin label data extract measur number state plot figur perform baselin model figur model multipl state class outperform baselin state present perform obtain model state result show number state label label figur extract accuraci model state merg number number accuraci model state link baselin tabl extract accuraci model learn data compar baselin model complex model structur benefit extract perform hmm header task compar result perform model creat automat label train data summari result baselin model present tabl model slightli baselin model manual merg model multipl state class perform expect futur work bayesian model merg result fulli autom construct procedur produc model perform manual creat model investig incorpor unlabel data paramet train scheme start baselin model run train unlabel data initi paramet set maximum likelihood transit probabl label train data smooth emiss distribut label label data base vocabulari train produc transit emiss paramet valu local maxim likelihood unlabel data model test extract model perplex test shown tabl perplex measur hmm model lower model assign higher likelihood observ test set result perform model initi paramet estim baselin acc pp acc pp initi vari tabl extract accuraci test set perplex baselin model train slightli larger vocabulari provid gain classif accuraci compar result tabl vocabulari word occur unlabel data probabl emiss distribut result distribut smooth initi estim state emiss distribut linearli interpol initi distribut mixtur weight distribut state weight viterbi path label train data comput model emiss distribut word emit state estim optim mixtur weight local initi distribut em algorithm distribut state interpol optim mixtur weight result model test test set result report extract accuraci estim unlabel data slightli improv baselin degrad model lack improv classif accuraci partli explain fact train maxim likelihood unlabel classif accuraci model capabl point improv test set perplex perplex test set improv initi set improv care select emiss distribut mixtur weight merialdo find similar effect tag accuraci train tagger train start initi paramet estim error breakdown conclud experi breakdown error made perform model tabl show error class baselin model emiss distribut train label label data class train data bold titl dramat accuraci baselin tag abstract address affili author date email keyword note phone titl web tabl individu field result baselin model field note bold occur data label data includ perform individu class note class web class low accuraci limit web class exampl train header web state transit state futur work experi show hidden markov model extract import inform header research paper achiev accuraci field accuraci titl author demonstr model state class provid extract accuraci model state class improv due specif transit context model state expect benefici local emiss captur distribut variat depend posit class header data proven valuabl provid robust paramet estim addit data improv extract accuraci header case label train data data select appli improv paramet estim forthcom experi includ bayesian model merg learn model structur complet automat advantag addit header featur posit word page expect layout inform improv extract accuraci plan model intern state order captur word absorb state possibl affili figur intern model structur state nal model structur displai figur distribut word model intern state emit word expect improv contribut develop accur model research paper header extract refer inequ maxim techniqu statist estim probabilist function markov process inequ learn inform extract hmm shrinkag submit workshop machin learn inform extract robust tag hidden markov model comput speech languag inform extract hidden markov model master uc san diego build search engin machin learn techniqu aaai spring symposium intellig agent cyberspac tag english text probabilist model comput linguist tutori hidden markov model select applic speech recognit ieee al dialog act model speech appli machin learn aaai spring number menlo aaai press bayesian learn probabilist languag model phd ca error bound convolut code optimum decod algorithm ieee transact inform theori estim probabl event adapt text compress ieee transact inform theori van hidden markov model approach text segment event track ieee icassp
Agents/605 1 agent aid aircraft mainten katia school comput scienc abstract aircraft mainten perform mechan consult expert engin repair instruct approv addit engin reli extern inform inadequ index geograph time retriev distribut inform vital engin abil recommend repair procedur mechan request problem domain suit consist distribut inform multipl user prefer describ implement retsina architectur implement reinforc import retsina infrastructur basi construct system introduct agent aid inform retriev support focu agent research commun year theori simul inform retriev system real applic scarc reason scarciti lack real problem domain suffici rich inform complex domain facilit develop applic system examin applic technolog develop research lab paper present applic base experi retsina infrastructur implement system solv exist problem develop framework inform retriev analysi support make aircraft mainten research present multipl public survei pointer addit research refer repair air forc solut develop specif type agent interact design appli rang similar mainten scenario mainten complex vehicl aircraft complic task task involv includ engin possibl expert amount inform involv process larg inform typic multipl storag media inform geograph distribut major goal mainten process perform repair procedur effici shortest time process reli relev time inform deliveri individu involv mainten significantli benefit process paper organ present properti problem section section briefli describ retsina basi develop solut section describ solut provid problem hand section discuss advantag limit solut futur research direct problem standard aircraft mainten air forc involv inspect mechan discrep consult engin decid requir repair consult extern sourc inform includ histor mainten data expert autom introduc consult process repair manual search relev inform time consum incomplet histor data record previou similar scarc store paper format search short period distribut remot locat servic center expert engin locat advic voic fax messag delai hour dai factor contribut ineffici inspect mainten process repair process consist figur part graphic descript attach form ffl aircraft arriv mainten servic center regularli schedul complet limit time period period vari aircraft ffl mechan inspect aircraft locat discrep discrep mechan perform order describ discrep adequ addit reli consult manual experienc mechan mechan fill standard air forc form report aircraft discrep mechan attach support inform graphic illustr figur form engin advic requir repair author perform repair procedur engin locat remot ffl receipt perform manual histor repair inform find repair discrep form fill standard air forc form discrep repair instruct form engin attach graphic illustr clarifi requir repair procedur file form futur histor repair inform ffl receipt form mechan perform repair instruct current repair process ffl major histor repair inform found part figur part form ffl mechan engin spend preciou time manual search histor repair inform draw graphic discrep repair illustr mechan spend wait form arriv engin repli form ffl valuabl discrep repair inform store remot histor inform inaccess store inform difficult keyword free text section form inform paper manual inspect ineffici time imposs due physic constraint inspect environ inform figur histor form current limit problem intensifi due deterior qualiti inform transmit fax machin histor form ffl time effort spent file time diagnosi repair ffl result held paper inform manual updat consist manner problem deal consist support physic distribut rich inform type problem retsina system aircraft mechan enter narrow space manual figur html format form retsina infrastructur retsina system intellig network infrastructur develop inform gather integr sourc support task agent retsina special specif class task agent execut task plan task organ avoid process bottleneck form team deal dynam number agent capabl agent distribut execut machin base model agent agent decid task pass inform cooper agent agent commun deleg request provid find inform filter integr negoti resolv inconsist inform task model system consist major class interfac task agent inform agent interfac agent interact user receiv specif deliv result model util user prefer main function interfac agent collect relev inform user initi present relev intermedi final request addit inform task execut interfac agent hide underli structur complex agent system deviat strict categor occur hybrid agent task agent formul plan carri knowledg task task agent inform agent relev perform part task task agent strategi resolv conflict fuse inform retriev inform agent task agent receiv user deleg task specif interfac interpret specif extract problem solv form plan satisfi identifi inform seek subgoal present plan cooper task agent inform agent plan monitor result composit inform agent provid intellig access heterogen collect inform sourc model inform resourc strategi sourc inform conflict resolut inform fusion inform agent activ monitor inform sourc solut design found retsina infrastructur solv problem consid analyz inform sourc describ agent develop handl sourc interact note agent hybrid share basic retsina agent architectur figur result present form list match form match field keyword view click specif form entri inform sourc sourc inform relev inspect mainten process note stage system develop effort put convert inform electron format express descript inform sourc ffl current form form fill mechan current fault encount inspect electron html format figur uniqu identifi graphic free voic messag digit photograph attach form held file standard graphic audio form locat wearabl comput held mechan ffl histor form collect form previou aircraft consult mainten procedur histor form type manual paper addit attach graphic attach text file includ text graphic illustr servic center collect histor form local disk index system form ffl manual partli html format part pdf format clear extent manual index insepar part futur manual found local disk servic center ffl expert engin locat remot necessarili demand provid unstructur text graphic inform relev problem address aircraft mainten system sourc inform type plane singl servic center case distribut histor inform exist develop solut fit rang aircraft mainten distribut issu agent type develop agent system inform filter fusion support mainten system implement test real data field instal month system type ffl form agent role analyz current form receiv problem present request inform relev solut problem receipt inform filter present manner engin form agent hybrid task agent interfac agent combin interfac engin interfac task decomposit deleg complex inform fusion task ffl histori agent request agent form search histor form relev problem present request rel relev form comput form pass relev threshold answer request histori agent hybrid inform agent task agent combin capabl inform gather filter typic inform complex analysi inform typic task ffl manual agent request data relev problem present request index search assum manual agent inform agent detail function specif develop implement agent agent function histori agent manual agent larg inform agent receiv request inform repli requir inform receiv type singl shot queri content queri includ fault descriptor fault request histori agent histor form limit local search complet partial match leav flexibl search ontolog hit obviou form match design problem insert content repli messag manual agent perform manual match insert content repli messag figur tabl manual submiss request keyword search figur comput mechan form request engin button perform action retriev list keyword fault local file engin request search manual perform field engin insert request keyword snapshot search request window shown figur current form find keyword insert content field outgo request form agent send function button control request manual agent result null user request addit form agent send request local histori agent result send request remot histori agent servic result arriv process present result window snapshot window shown figur result queri list address form found relev keyword order relev user click item list find field keyword result match user request displai select form form displai relev keyword highlight text graphic arrang reason develop autom consult form agent add current form histor form data process flow type built multiag system special type agent instanc system describ process flow inform figur process begin mechan requir certifi inspect plane mechan wearabl comput fujitsu figur microphon digit camera discrep mechan fill electron form add voic note digit photograph form attach engin mechan wait repli engin support form agent extract keyword form form agent automat request relev histor form histori agent relev manual page manual agent request control edit user form agent wait request inform repli request histori manual agent locat central comput network servic archiv inform access locat receiv request histori agent perform search histor form conduct relev analysi repli list relev reason select level relev manual agent perform simpl search index manual repli result search receiv repli histori manual form agent merg result displai engin inform engin decid repair fill electron attach graphic descript grab manual histor form draw send mechan wearabl comput inform flow process end receiv request perform search receiv request perform search return relev manual page receiv form extract keyword form request relev histor form request relev manual receiv result send form mechan inspect aircraft fill form send form engin receiv form engin repair aircraft text audio photo manual form histori agent form agent manual agent engin mechan aircraft inspect repair form form form merg result fill form return form explan figur data process flow system receiv open form wearabl comput detail form approv repair procedur mechan execut actual repair organ descript inform flow process partial view system develop import agent organ provid requir process flow provid descript organ present insight scalabl system graphic illustr organ present figur depict multipl mechan wearabl comput inspect process form form form agent multipl form agent form agent handl form form agent request inform relev form handl multipl histori agent histor archiv form distribut multipl servic center manual agent histori agent request inform multipl form agent close system agent advanc agent agent open system organ retsina infrastructur open system organ presenc interact middl agent discuss applic retsina infrastructur aircraft mainten problem implement provid advantag ffl automat locat retriev relev inform inform provid advic potenti risk discrep pose support repair method ffl histor repair data inform discrep long term learn typic problem aircraft perform ffl access manual index accuraci complet inform retriev reduc probabl mistaken repair ffl result electron fusion transmiss averag repair time reduc speed qualiti inform filter merg repair result time qualit aircraft mainten underli architectur system open similar domain myriad distribut repair domain benefit open form form form form form form form form form form form form agent form agent form agent manual agent histori agent manual manual form manual agent agent engin mechan mechan mechan mechan engin engin wearabl wearabl wearabl wearabl wearabl servic center comput network servic center comput network workstat workstat histori workstat mechan figur system organ system facilit automat addit resourc agent creat exploit modifi exist system open dynam disappear agent inform sourc hamper system retsina agent find altern agent initi choic retsina provid good solut type support demonstr prototyp aircraft mainten system acknowledg work perform cooper support dan dick martin jane siegel wearabl comput project carnegi mellon warner robin air forc georgia fund work provid onr grant refer williamson internet page exampl resourc inform method process user prefer learn michael huhn munindar editor read agent morgan san jen wooldridg agent technolog wooldridg roadmap agent research develop autonom agent nwana lectur note artifici intellig vol softwar agent soft comput williamson design behavior inform agent page lo zeng distribut intellig agent ieee expert system sycara zeng coordin multipl intellig softwar agent intern journal intellig cooper inform
IR/606 5 data mine symbol knowledg extract web rayid ghani rosi jone kamal nigam se slatteri school comput scienc depart intellig system carnegi mellon stefan institut pa usa slovenia abstract inform extractor classifi oper unstructur text error sourc larg amount potenti combin crawler automat augment knowledg base web structur inform world wide web wrap provid kind inform provid sourc possibl reliabl fact give case studi combin inform kind sourc context learn fact compani provid result associ proposit relat demonstr improv inform kind sourc improv reliabl rule introduct world wide web sourc inform inform intend consumpt human data sourc form current research challeng domain comput gather repres knowledg exist knowledg creat knowledg learn thing challeng thought process gather knowledg mine research address piec challeng wrapper induct commun develop learn algorithm extract proposit knowledg web page goal reconstruct explicit data sourc creat web page effici learn extractor inform movi theater restaur entertain combin inform map system creat integr applic inform extract grew muc confer orient extract proposit knowledg unstructur data sourc goal techniqu reconstruct symbol form knowledg author repres explicitli text web page question field progress extract rule learn extract rule set data learn inform extractor identifi person home page approach deal extract relat knowledg exist web combin web page hyperlink structur goal format text web learn identifi relat suggest hyperlink page relat learn identifi relat faculti graduat student text hyperlink web page previou work project integr type inform gather construct relat proposit symbol knowledg web data sourc larg set featur extractor includ simpl learn inform text classif relat learn research demonstr high collect fact specif domain interest select spider web repres stage demonstr inform extract web accur detail aim construct knowledg base perform data mine identifi pattern knowledg explicitli repres fact web detail current work creat knowledg base corpor world built spider primari secondari inform sourc collect knowledg base relat proposit fact total compani appli data mine techniqu knowledg base preliminari result automat learn thing web discov interest regular data agenc tend locat rule automat construct extract identifi locat industri sector notic compani industri locat york knowledg extract date primarili common knowledg compani explicitli repres fact knowledg base step demonstr feasibl approach futur aim discov relat data true note approach text mine advoc paper stand contrast term text data mine approach text strata perform mine analysi creat system gene function discoveri medic text describ process text mine discov morpholog structur rule hold true text question text input mine build tradit data mine dataset varieti simpl elabor text featur extractor appli fairli tradit data mine algorithm discov knowledg subject text paper describ data learn algorithm construct corpor knowledg base present overview data mine techniqu emploi show initi data mine result discuss plan continu research specif suggest discuss futur work figur process acquir potenti interest inform compani web data sourc featur goal assembl knowledg base inform larg number knowledg base data mine experi explor gener properti compani relationship process illustr figur begin data consult hoover onlin web resourc detail inform larg number select compani url list compani url custom crawler built extract inform compani web site crawler visit compani web site search web page site breadth featur list section crawler examin web page augment built wrapper extract inform compani hoover detail wrap featur section complet list featur tabl extract featur extract featur directli crawl compani web site varieti simpl elabor creat simpl mention featur found simpl text search web list compani url hoover offic found simpl regular express page word featur keyword type activ web page compani top level domain compani home page url countri countri featur text classif method extract sector featur independ set compani sector built naiv bayesian model sector label label base sampl web page compani web site naiv commonli text standard text classif algorithm easi train perform compani crawl knowledg label predict model pool web page compani site sector valu locat featur extract advanc inform extract techniqu naiv model region text surround locat conjunct extract rule learn hand seed exampl autoslog system wrapper featur secondari sourc contrast featur extract compani web extractor obtain compani inform hoover reli regular format find relev inform inform extractor automat gener text call wrapper simpl wrapper written extract featur hoover page compani hoover capsul page extract address valu competitor subsidiari extract valu year list abstract featur augment extract featur featur built featur ad relationship attempt give data mine algorithm background knowledg relationship believ search regular ad featur discret continu featur ad data mine accept continu discret version data mine algorithm experi find pattern knowledg learn algorithm section describ algorithm motiv algorithm expect perform task dataset inform compani collect question typic data mine learn featur valu descript extract featur type activ compani engag compani web site point compani mention compani occur compani web site offic offic compani sector naiv predict econom sector compani naiv predict econom sector locat deriv naiv classifi small region text surround countri rule infer url domain applic wrap featur sector list compani hoover page industri list compani hoover page school address address list hoover state extract address competitor compani compet compani subsidiari compani list subsidiari compani product product categori extract product page offic offic list hoover page compani revenu revenu data year net incom data year net profit data year number year year abstract featur compani state compani compani citi compani compani offic common compani compani mention compani mention compani compani link compani link compani compani mention mention compani compani link link compani compani list competitor list compani competitor revenu year bin equal size bin net profit similarli bin net incom similarli bin similarli bin tabl complet list featur compani repres thing found motiv algorithm discov associ larg dataset section inspect data featur learn result approach narrow problem defin potenti interest target concept potenti learnabl target function distinguish compani econom sector order find regular target algorithm learn proposit order rule interest learn rule relationship compani relationship natur captur gener pair compani dataset hope discov rule form sector sector link mention abstract featur section attempt encod kind inform wai make easier proposit relat learner capit discov associ order find associ discret continu featur featur boolean featur distinct valu end featur exampl repres vector boolean featur repres gener associ rule appli apriori algorithm publicli implement version incorpor commerci data mine packag typic datamin assum finit set liter refer subset liter apriori algorithm perform exhaust search dynam program prune search space base paramet user minimum support confid rule algorithm wide mine associ rule liter item supermarket exampl transact item bought associ rule implic form subset liter oe rule hold confid exampl rule support data exampl rule support estim confid estim learn proposit rule tree data mine task find perform promot analyz credit risk detect fraud algorithm extens gener tree dataset partit data implement part commerci data mine packag inform gain ratio criterion perform prune level goal discov pattern data classifi predict unseen deriv rule set tree write rule path tree root leaf learn relat rule search regular relat knowledg benefit relat learner quinlan foil system greedi cover algorithm learn horn foil induc horn begin empti tail search add liter tail cover posit instanc evalu function search measur relat descript compani knowledg base foil pattern relationship compani search interest regular contrast associ rule tree confin version knowledg base foil approach data give target concept learn result experi perform featur section case subset algorithm section interest regular evalu gener model base coverag train exampl check content model set experi aim discov associ data associ rule section set experi involv decid target relat order find rule describ target concept select target state gener proposit rule tree section order rule order rule learn system section find rest section apriori experi associ rule section gener rule continu featur default paramet set support rule set minim confid rule set obtain associ rule inspect frequent rule point data clean point data clean step applic featur closer inspect rule reveal sourc systemat error extractor mistakenli extract offic compani approach lend improv extractor remov rule wrongli extract end associ rule exampl rule found rule give confid express percentag exampl rule percentag exampl associ hold highest confid rule associ extract featur exampl rule intuit understood compani document locat usa provid technic involv sale check instanc link confirm due web page link pdf file link adob provid visitor possibl read document download pdf interest regular compani locat japan sell perform research rule compani locat usa sell suppli confirm compani locat usa perform research run lower confid threshold run associ rule algorithm lower support confid reveal compani mention softwar web page locat usa found compani perform suppli research document web page locat usa rule rule intuit understood compani technolog sector locat usa associ rule involv featur incom show compani dataset stabl financ rule show compani high revenu highli probabl high revenu order associ lower confid featur consid reduc featur set competitor transform boolean featur featur run associ rule algorithm reduc set featur low support confid confid result rule support confid higher associ rule give support data compani cooper ernst young compani cooper arthur andersen compani drug ernst young associ competitor half compani compet quarter compani compet rule show competitor good predictor support compani understood compani compet corpor bp plc retail tree associ rule find arbitrari associ cost complex decid target function tree learner explor complex rule tree shown number bracket refer number exampl cover rule show fraction target label shown learn tree predict econom sector hoover predictor naiv classifi econom classif ident hoover note approach improv accuraci classifi base web page featur learn map similar featur deriv permit featur ident citi atlanta diversifi servic comput servic citi houston comput softwar servic energi citi dalla net health product servic net leisur citi minneapoli diversifi servic figur partial tree hoover sector combin learn featur extract symbol featur wrap hoover util hoover type nil energi hoover type public energi telecommun servic sector net media net telecommun technolog sector net comput softwar servic net diversifi servic sector servic bank servic transport sector telecommun net diversifi servic net manufactur sector net media net drug transport figur partial tree hoover sector combin learn featur extract symbol featur wrap hoover tree exclud citi featur focu learn rule improv base sector classifi result tree shown figur depend citi compani locat featur predict sector comput compani higher revenu diversifi servic compani depend noisi naiv classif compani predict comput softwar energi health compani lower incom leisur compani exclud citi featur focu learn rule improv base sector classifi result tree shown figur note telecommun energi weed incorrect classif predict energi naiv classifi predict incom distinguish media telecommun naiv classifi predict distinguish bank tree find irregular naiv predict transport public compani net hoover sector subsidiari hoover sector comput servic privat hoover sector drug privat hoover sector servic privat hoover sector food privat hoover sector health product servic hoover sector leisur privat hoover sector telecommun nil hoover sector diversifi servic sector sector partnership sector partnership figur partial tree hoover type combin learn featur extract symbol featur wrap hoover sector rule tree target function hoover attempt learn rule predict hoover classif compani defin featur compani defin compani address hoover state result tree shown figur bulk compani publicli trade health servic sector low profit revenu privat sector diversifi predict sector predict naiv classifi partnership final tree learn task predict composit featur valu countri defin hoover address inform predictor deriv compani indic countri deriv internet standard rfc base iso countri code tree valid extract show correctli predict compani headquart japan unit kingdom url provid tree featur predict countri featur select nil tree hoover industri featur note medic compani industri fact technolog compani base massachusett establish lower profit compani headquart california reveal locat bank center pick expect correl oil industri fashion york tree shown figur foil experi proposit rule foil investig learn ruleset broad class target function simpler class unari relat chose learn compani au australia jp japan uk nil hoover type cooper ca hoover type ca hoover type ca hoover type joint ventur ny hoover type mutual compani canada hoover type tx hoover type partnership ny hoover type privat ca hoover type public canada hoover type school tx hoover type subsidiari ca hoover type nil hoover industri ny hoover industri product fl hoover industri agricultur product ca hoover industri cloth ny hoover industri bank md hoover industri bank midwest il hoover industri bank pa hoover industri bank ga hoover industri bank tx hoover industri bank west ca hoover industri medicin ca hoover industri research ca hoover industri corpor softwar ca hoover industri softwar ca hoover industri nv hoover industri invest brokerag ny hoover industri medic equip ca hoover industri medic instrument suppli ca hoover industri network ca hoover industri oil ga product tx hoover industri oil ga servic tx hoover industri semiconductor ca hoover industri semiconductor special ca hoover industri semiconductor materi ca hoover industri wireless microwav ca hoover industri inform net ca net ma figur partial tree hoover state countri combin url base symbol featur wrap hoover type compani produc correspond industri sector found rule intuit read compani headquart compet associ comput softwar servic sector knowledg rule correct compani match compani investig reveal associ compani knowledg base headquart rule lower draw extract cover compani correctli incorrectli knowledg base rule intuit understood compani headquart media industri kind sector locat wrap hoover abstract learn sector naiv model refin knowledg type compani compani note unbound variabl read locat extract compani list hoover page list competitor hoover competitor relationship reciproc rule match compani correctli match compani correctli incorrectli learn predict compani highest coverag rule found match compani correctli intuit understood compani headquart madrid list histor inform arthur andersen net attempt learn binari relat present practic difficulti algorithm turn problem knowledg base binari target relat competitor cut background featur simpl run discov regular match compani correctli incorrectli rule state compani sector competitor discuss demonstr discov interest regular compani mine inform web difficulti process deserv note discuss difficulti encount error natur fact tradit process data mine includ extens phase data clean data clean problemat usual addit sourc imperfect featur extractor relat match gener shorten compani data mine algorithm discov regular result insuffici data clean automat construct knowledg base imperfect data clean effort necessarili iter pattern note featur relat learn memori usag run time foil algorithm prove problemat size extract data set featur promin term number low content suggest featur select techniqu possibl perform featur select learn process select unari target relat learn rule learn algorithm perform fewer construct neg exampl requir result learn suggest subset featur data mine result learn rule suggest featur subset run binari relat discoveri process prove effect foil result observ interact symbol featur featur base text compani web sector featur predict industri sector shown section learn map sector tree identifi region classif space naiv poor correct symbol featur paradigm combin statist symbol featur prove collect symbol text data clear method combin point deriv valu featur compani small list corpor inform web site work result paper suggest number research impact inform machin text dispar knowledg sourc lend improv accur featur accur inform inform wrap sourc train data improv extractor benefici sentenc give label corpu build crawl compani classif give adapt text classifi train slightli train set addit augment extractor oper text symbol provid web background knowledg addit direct greater autom extract featur discov anomali ad hoc manner work run form time extractor detect avoid error rare occur frequent larg collect augment test test permit systemat error test unseen set data actual inform extract perform level keyword spot extend machin learn data label manner hoover data provid richer reliabl featur found exploratori approach apriori weak combin search tree relat learner give greater power approach increment incorpor featur select order render tractabl due time constraint run crawler compani repres hoover run algorithm compani found run crawler gener coupl data perform learn rule predict featur absenc instruct rule relabel part mine algorithm view period time collect knowledg gain understand pattern underli data refer verkamo fast discoveri associ rule advanc knowledg discoveri data aaai mit page verkamo appli data mine techniqu text analysi report dept comput shahabi case studi inform integr ijcai workshop intellig inform apriori slatteri learn extract symbol knowledg world wide web fifteenth nation confer artifici page slatteri learn construct knowledg base world wide web artifici sever rough set data analysi data lin data trend research page kluwer dipasquo html format aid natur languag process world wide web master carnegi mellon freitag machin learn inform extract inform domain phd carnegi mellon hearst text data mine annual meet associ comput model web sourc inform integr kushmerick wrapper induct inform extract phd mitchel machin learn san morgan kaufmann quinlan learn logic definit relat machin quinlan midterm report european confer machin page riloff jone learn dictionari inform extract sixteenth nation confer artifici page aaai slatteri craven combin statist relat method learn hypertext domain intern confer induct logic program lehnert automat learn text analysi rule technic report soderland lehnert trainabl modul inform extract journal artifici intellig research clementin
Agents/607 1 commun associ comput machineri build cognit rich agent sim agent toolkit aaron sloman brian logan school comput birmingham birmingham uk synthet agent vari intellig autonomi design research laboratori motiv includ militari train game educ digit person softwar agent manag internet transact pure scientif approach research interact extrem research process agent approach form requir consist plan coordin behaviour achiev collabor extens logic action belief multipl type emerg phenomena agent instanc rout telecommun network approach intern architectur individu agent requir social collabor complex emerg phenomena complex agent agent complex intern structur combin motiv plan execut emot reaction expect approach increasingli import larg system deploi network level intellig requir individu agent relev work agent cooper perform task requir problem opportunist redirect fine partial unpredict environ import inform current goal arriv unexpect time found unexpect insuffici time requir reactiv mechan task involv achiev type goal act requir delib mechan deal conflict adapt chang opportun cultur requir sophist motiv mechan motiv research interest model human mental function desir interest synthet agent game comput intellig agent capabl perform complex task hitherto research investig simpl agent perform restrict sort manag incom give novic user inform softwar system manag larg compani replac team softwar attempt obtain inform monitor evalu activ subsidiari strateg cognit rich intern mechan structur model complex commun plan agent unexpect argu intellig robot mechan cope resourc limit interact mechan produc emot state involv partial loss control human motiv emot process involv attempt persuad charact interact stori adopt discuss rel import task person assist agent similar mechan involv commun oper involv metaphor relat claim motiv emot requir intellig found kind architectur intern architectur agent vari intellig modular extrem larg number low level compon interact global behaviour explicitli program interven structur account behaviour architectur comprehend extrem agent defin modular architectur hierarch decomposit separ compon perform strongli interact mechan perform task architectur vari function intellig dimens variat concern extent intern architectur pure detect intern extern condit immedi gener intern extern turn trigger reaction figur intern extern feedback loop state alter reactiv agent sensori input combin achiev sophist behaviour exampl includ softwar agent monitor react sensor read chemic control complex vari process sophist reactiv system requir process level abstract sensori motor detect low level signal abstract pattern trigger complex behaviour involv effector prove inadequ context delib architectur achiev greater flexibl set action assembl evalu necessarili select execut delib architectur implement intern reactiv requir larg amount store includ explicit knowledg action relev effect percept action environ reactiv process figur reactiv layer action circumst requir short term memori build structur repres action sequenc order evalu consequ inabl long term store answer question sequenti natur plan construct typic make delib system slower reactiv resourc limit necessit attent filter suppress low prioriti interrupt level abstract perceptu action subsystem requir match abstract process delib system delib architectur requir person assist plant control mechan cope circumst routin reaction inappropri trial error behaviour danger time consum extern observ behaviour produc delib architectur produc pure reactiv long exhaust collect rule assembl advanc design evolutionari process produc set reactiv behaviour advanc inordin long time requir excess amount storag decid reactiv delib architectur environ high complex complex involv time effort requir potenti relev space requir store mechan requir effici find select potenti contend run time conjectur evolut solv problem natur system hybrid architectur involv close integr concurr activ delib reactiv figur hybrid architectur includ mechan transfer result delib layer reactiv layer stereotyp improv speed perform delib layer attend thing learnt human skill similar type skill acquisit softwar agent robot variabl threshold attent filter motiv activ long term memori percept action environ reactiv process delib process figur reactiv delib layer monitor work system assum interact agent perfectli ration fix collect motiv prefer requir simpl cognit mechan payoff matric util function system consist simpl agent inadequ societi intellig softwar agent autonom robot situat set motiv motiv gener instanc goal friend deal unexpect conflict high level object standard prefer realist system account intern conflict conflict negoti plant manag softwar team encount conflict safeti human worker economi plant oper simul battlefield command simul detect handl conflict protect civilian captur oppon context agent benefit addit architectur abil possibl modifi intern process kind figur base mixtur intern reactiv delib process direct agent intern sensori goal delib record recent system discov conflict motiv strategi deal notic problem solv process cautiou strategi requir expect synthet includ agent work group variabl threshold attent filter percept action motiv activ long term memori delib process process environ reactiv process figur layer requir similar varieti intern process instanc requir decid stop solv problem human capabl varieti includ social control ethic standard kind learn delib process found improv impair time stress emot disturb intern includ delib process reactiv process chain associ solv slow environ opportun danger requir action turn unexpectedli global alarm system fast mechan trigger stereotyp intern extern deal situat rapid reaction make mechan produc erron speed intellig found human emot turn synthet agent trainabl alarm system reduc frequenc mistak agent previou discuss lead sophist agent includ concurr process perform kind task ffl analysi interpret sensori data level ffl monitor condit produc rapid global ffl gener ffl assess motiv decid adopt ffl construct plan achiev motiv decid adopt part process decid ffl decid adopt plan execut ffl learn pattern evalu past ffl attempt interpret observ behaviour ffl understand explicit commun ffl decid addit high level robot complex physic requir larg number reactiv process monitor control aspect bodili fine control movement softwar agent deal high volum inform stream requir fast reactiv layer multipl program sim agent toolkit year cognit affect project birmingham explor problem sketch support research design implement softwar sim explor idea implement rapid prototyp found provid support varieti program addit wide object orient techniqu flexibl reactiv intern mechan agent support program mechan agent implement ruleset wide rang condit trigger intern process order support sophist intern paradigm implement intern commun channel part agent agent support process system interfac procedur program condit action link mechan neural net fast process met compil code flexibl process subject interpret intern languag vari rel speed explor resourc limit system presenc increment compil rapid develop support easi student teach environ indirect refer rule redefin easili procedur recompil run system automat store manag garbag collect prevent memori leak implement languag sophist extend languag environ heart commerci success toolkit construct set agent agent compon oper kind mechan includ neural net reactiv mechan alongsid ai symbol manipul solv complex plan task system neural net obtain evid fraud credit transact base subtl combin delib mechan suspect case greater detail factori autom system set reactiv procedur handl routin manag delib planner handl product product layer decid chang criteria suspend plan begin act shortag time collect inform act partial plan agent toolkit base commit soar sim agent commit prove attract research student explor altern design varieti includ simpl comput battlefield simul train softwar model aspect human cognit emot agent plan dynam domain telecommun develop ai environ make simpl demonstr student modifi plan recent work includ improv facil agent recent work requir agent toolkit report type architectur clear research requir effici toolkit dedic type agent architectur task architectur requir narrowli expect increasingli toolkit flexibl sim agent research strongli agent sophist hardest unsolv problem ai system inform avail toolkit addit inform freeli ftp www overview mpeg movi found cognit affect ftp repositori theoret paper birmingham directori readm file list inform sim agent support librari sim agent requir integr solut refer jeremi baxter brian editor workshop softwar tool develop menlo american associ artifici intellig lp beaudoin sloman studi motiv process attent prospect artifici page io davi reactiv motiv collect minder jp mj nr intellig agent iii intern workshop agent languag daniel emot matter iq rosenbloom architectur gener intellig artifici bs logan bound cost nation confer artifici birmingham school comput scienc technic report rosalind picard affect comput mit sloman hybrid system expert cambridg uk british comput societi expert system sloman sort control system person robert trappl paolo creat person synthet autonom person page springer note sloman robot emot proc int joint confer page sloman poli sim toolkit explor agent design mike milind intellig agent vol ii page ian wright aaron sloman implement agent architectur technic report school comput
DB/608 3 stratum approach tempor dbm implement kristian christian richard snodgrass march technic report titl stratum approach tempor dbm implement copyright fl kristian christian richard snodgrass reserv kristian christian richard snodgrass public histori march technic report particip aalborg denmark michael bohlen gregersen christian jensen kristian usa datta richard snodgrass individu particip curti jame cook australia nation korea nation korea michael south usa andrea eth switzerland vassili polytechn usa jef vrije universiteit belgium softwar made provid express impli impli warranti merchant fit icon cover combin letter rune alphabet millennium ago rune alphabet letter angular shape lack horizont line primari storag medium wood rune found weapon rune perceiv hidden power rune arrow icon denot abstract previou approach tempor assum tempor manag system implement integr architectur yield adequ perform tempor implement tempor index join algorithm larg task paper explor tempor dbm implement stratum top exist render task feasibl function underli convent dbm discuss advantag disadvantag stratum architectur compar integr present set criteria stratum architectur meta architectur implement tempor dbm stratum identifi meta architectur specif examin turn exist tempor dbm implement classifi specif architectur identifi specif architectur evalu criteria conclud stratum architectur approach implement tempor dbm integr exist convent dbmss tempor implement blur differ integr stratum architectur introduct tempor extend convent associ timestamp fact implement tempor manag system top convent dbm gener pursu advantag tempor implement techniqu tempor index tempor storag structur tempor join coalesc algorithm implicit assumpt perform tempor dbmss similar convent tempor dbm manag multipl version data convent dbm manag version build complet dbm larg task accomplish major dbm vendor clear applic handl data tempor data manag individu applic support dbm write tempor queri shown tempor sql significantli reduc amount difficult code express tempor queri ch tempor data manag applic benefit substanti support gener goal provid support data construct tempor dbm explor paper tempor dbm implement stratum top convent dbm idea function exist dbm technolog limit build top exist dbmss modifi exist core dbm data queri processor transact manag stratum approach bring tempor support dbm applic approach mean experi tempor technolog approach make feasibl research team implement experi tempor queri part back end queri evalu special tempor oper implement experi gain stratum approach goal build tempor function directli dbm list criteria stratum satisfi criteria includ underli retent desir properti minim impact middlewar defin architectur build stratum middlewar stratum odbc preprocessor architectur captur specif discuss turn architectur classifi exist includ tempor dbm implement list resent survei specif architectur evalu criteria perform tempor dbm implement stratum compar perform integr architectur applic explicitli handl multipl version data integr tempor dbm render comparison practic compar tempor data manag applic reason store multipl version data differ support version applic programm implement version support explicitli paper conclud stratum approach make focu implement reason resourc year integr architectur stratum approach stratum necessarili tempor function implement stratum paper organ section discuss gener idea stratum list criteria stratum implement tempor dbm total specif stratum partit meta current explor section section compar specif architectur criteria relat work topic section section summari paper stratum approach section describ gener idea stratum approach consid approach appli tempor section list design criteria tempor stratum stratum architectur gener idea stratum architectur shown figur downward arrow denot flow queri upward arrow denot flow data box denot softwar compon round box denot compon squar box denot compon level stratum approach applic level consist applic access dbm stratum stratum implement interfac dbm dbm data store stratum applic applic applic dbm applic level stratum level level figur stratum approach stratum applic directli connect dbm commun applic dbm stratum import potenti advantag stratum provid applic data model implement dbm data model implement suppli dbm vendor stratum approach appli tempor idea convert convent support tempor support tempor sql applic send tempor queri tempor dbm queri receiv convert dbm result dbm return stratum process data send applic stratum make convent dbm dbm support tempor data model applic point view design criteria stratum approach evalu tempor dbm stratum stress set design introduc criteria section evalu stratum architectur modif underli dbm requir dbm stratum dbmss point stratum applic stratum dbmss call level interfac reli dbm extend tempor function stratum encapsul dbm applic dbm directli import stratum requir dbm modifi sourc code dbm minim impact middlewar stratum dbmss nativ gener odbc implement stratum discuss section gener api open standard sourc code chang middlewar initi tempor criterion middlewar flexibl criterion dbm assum specif sourc code dbm minim impact middlewar import avoid side effect affect exist applic independ applic stratum implement encapsul dbm applic applic implement dbm nativ applic dbm data model stratum applic data version applic exist applic affect addit time attribut tabl maximum exist technolog thin stratum function underli dbm implement function log transact manag function found dbm implement stratum motiv maximum thin stratum limit resourc implement stratum gradual avail tempor function assum limit resourc earli return invest resourc make tempor function fashion foundat earli avail work tempor dbm function gradual gradual avail import demonstr evalu tempor function retent desir properti underli dbm underli dbm satisfi core acid properti transact retain properti applic affect stratum criterion ensur function provid stratum extens function provid underli dbm mean underli dbm ensur stratum support adequ perform defin adequ perform legaci applic perform stratum perform essenti accept tempor function requir exist applic rewritten applic built tempor support tempor queri tempor fast queri tempor data put gener stratum fast code applic programm automat convert dbm independ stratum independ underli dbm techniqu implement stratum gener avoid sql found ibm dbmss criteria conflict criterion conflict exist criterion conflict criterion stratum implementor specif situat observ order stratum implement fulfil criteria legaci applic stratum affect addit stratum assum tempor sql upward compat work perform ad tabl legaci applic stratum affect tabl alter support time encapsul dbm dba point view dba awar tabl extend time attribut implement support time offer stratum updat statement tempor tabl perform stratum tempor integr constraint implement stratum reli integr constraint mechan dbm implement tempor constraint updat tempor tabl tempor inconsist updat statement pass stratum make stratum semant check tempor sql ddl statement alter tabl support time dimens execut stratum stratum taxonomi explor stratum implement outset gener stratum architectur shown figur set applic tempor sql tempor dbm simul tempor dbm convent dbm stratum applic convent dbm stratum implement lead explor detail sequel ffl stratum directli applic convent dbm ffl stratum middlewar applic convent dbm ffl stratum preprocessor softwar compon subsequ discuss applic api commun dbm gener approach access dbm discuss figur sampl specif api dbmss specif dbmss simpli make discuss easier investig differ point simpli repres api odbc api simpli repres gener api document gener api jdbc api perl dbi api stratum directli stratum directli applic dbm illustr figur figur upward downward arrow denot flow queri round box squar box softwar compon dash line show input interfac output interfac stratum app lib applic odbc api oracl app api dbm api oracl dbm dbm api driver driver oracl driver driver manag api proprietari librari api translat odbc oracl api level applic level stratum level translat figur stratum directli stratum figur odbc translat oracl translat compon exist proprietari librari tempor enhanc applic link proprietari odbc driver oracl api stratum call applic make api intercept odbc oracl exampl figur code call translat stratum call dbm driver manag level code stratum proprietari shown assum code pass librari implement function specif manag tabl librari implement function creat creat updat tabl underli dbm paramet input note code pass paramet contrast api approach properti implement stratum stratum support api librari superset api applic stratum turn discuss exampl figur greater detail applic left figur applic proprietari librari stratum applic proprietari dbm stratum alter possibl applic librari chang implement librari strictli librari interfac applic flexibl stratum make api gener api flexibl figur arrow proprietari librari stratum level api driver manag api level middl figur odbc applic stratum link odbc driver manag stratum applic connect stratum odbc driver manag compon compon compli fulli odbc api odbc applic connect dbm stratum convert argument flexibl stratum map input api call gener api api figur show oracl applic interfac stratum stratum applic compon stratum level compli oracl interfac oracl interfac compon stratum function stratum odbc driver convert tempor sql forward function call studi input output api stratum combin shown figur exhaust possibl stratum directli applic dbmss driver manag yield total specif architectur implement stratum input interfac output interfac proprietari librari specif api gener api ae specif api gener api oe figur input output directli stratum middlewar stratum turn middlewar implement stratum note odbc prototyp middlewar matur interfac type middlewar base odbc resembl idea odbc stratum shown figur dash arrow insid driver manag path explain shortli lib odbc odbc oracl app app odbc tempor driver odbc tempor driver driver oracl driver driver translat dbm api dbm api oracl dbm api stratum level applic level api librari proprietari level figur odbc stratum stratum figur applic commun odbc driver manag stratum implement place gener api odbc stratum implement driver manag compon figur stratum implement odbc driver compon odbc implement stratum driver driver manag extend compon translat tempor sql applic make odbc driver manag forward call connect extra tempor translat compon driver manag check argument call tempor sql perform forward call translat argument odbc driver figur odbc driver oracl path driver manag api driver altern odbc implement stratum driver manag alter translat odbc driver figur show type driver odbc discuss turn odbc exemplifi applic make odbc driver manag perform action odbc simpli forward call argument tempor sql convert dbm queri gener odbc driver odbc driver manag forward call argument driver gener driver convert tempor sql forward call directli specif reconnect odbc driver manag connect driver specif dbm reconnect driver manag driver function applic combin input output stratum level odbc driver architectur stratum shown figur architectur total specif stratum gener api architectur obtain implement dbm specif odbc gener api architectur realiz implement gener odbc gener api achiev ad translat compon driver manag note ident input output interfac input interfac output interfac gener api ae specif api gener api oe figur input output stratum level odbc stratum preprocess architectur implement stratum preprocessor idea shown figur dash arrow show flow program code stratum implement preprocessor compil architectur discuss stratum runtim preprocessor architectur applic gener tempor sql code applic handl queri tempor dbm preprocessor idea wide emb sql code host languag cobol preprocessor preprocessor odbc preprocessor oracl api app odbc api oracl app applic odbc api oracl app api app api dbm api dbm api oracl dbm oracl driver driver driver driver manag api odbc stratum level applic level level applic api figur preprocessor architectur differ architectur preprocessor stratum sourc code applic convert compil execut differ preprocessor extend preprocessor convert code code code run preprocessor suppli dbm vendor show dbm vendor preprocessor figur preprocess step preprocessor compon stratum level applic api applic code run preprocessor stratum level convert tempor sql queri convert api api gener odbc api type input output stratum level stratum directli shown figur leav specif architectur build tempor dbm preprocessor applic stratum architectur section discuss util stratum architectur provid concret exampl categor exist tempor dbm implement found recent survei stratum approach find relat tempor dbm discuss exampl stratum directli shown figur combin input output stratum level result architectur discuss turn proprietari api architectur site larg number applic singl dbm chang underli dbm tempor dbm applic target specif dbm consid strateg compon reason port librari support dbmss advantag singl dbm featur dbm essenti provid reason specif dbm featur hardwar dbm run ibm softwar support data blade assum architectur compani extens dbm bank insur telephon compani dbm part highperform transact process system architectur swiss region bank implement bitempor dbm librari top oracl proprietari api architectur compani exist librari target specif dbm larg set applic compani add tempor support dbm compani gradual move close environ open chang proprietari librari reimplement support map tempor sql make librari reimplement make connect dbmss gener odbc api perl odbc modul architectur modul make access odbc api perl program note perl odbc modul librari schema independ modul built support specif set target gener make applic swiss bank proprietari api mention librari librari implementor awar underli schema dbm target specif api architectur larg set applic dbm architectur gener proprietari api architectur specif api schema independ architectur convert api call proprietari librari reason proprietari api specif dbm strateg featur specif dbm util possibl lead perform architectur applic dbm design dbm chang lifetim applic architectur major dbm vendor extend product tempor support research prototyp ad tempor support exist dbm dbm exampl tempor extens specif convent dbm prototyp implement api convert tempor sql dialect queri adopt idea specif api architectur specif api architectur sourc code applic gener tool user prefer applic access odbc gener api architectur set odbc applic perform problem applic connect specif dbm stratum connect directli dbm odbc driver enhanc perform applic move tempor function stratum store procedur gener api architectur set applic connect updat support tempor data occur driver dbmss access access build convert specif dbm middlewar stratum type combin input output stratum level shown figur gener api architectur normal odbc set applic dbm enhanc support tempor data manag enabl exist applic enhanc tempor sql driver driver user queri server subset odbc driver encapsul server relat make tabl driver manag point view similar odbc driver user queri ascii file sql gener api architectur applic connect dbmss gener driver dbm driver bridg gener driver exist architectur bridg java gener jdbc access odbc differ shown figur driver manag applic bridg connect jdbc driver manag driver connect odbc driver establish connect specif dbm extend driver manag architectur altern gener api architectur extend driver manag advantag singl softwar compon alter provid tempor support multipl underli dbmss preprocessor stratum preprocessor approach simpl wide permit sql code host languag cobol code host languag code run preprocessor compil preprocessor convert sql code function call api convert sourc code compil stratum scenario extend combin input output stratum level shown figur main differ stratum directli preprocessor architectur tempor sql sql possibl compil time omit discuss specif architectur refer reader section specif api preprocessor architectur highli relev dbm vendor preprocessor wide tempor preprocessor necessit underli dbm requir dbm vendor defin tempor sql specif api gener api architectur relev independ softwar support dbm interest singl product relev custom prerequisit specif tempor sql comparison architectur subsect compar specif stratum architectur identifi section criteria introduc section notat evalu architectur tabl field empti criterion fulfil criterion criterion fulfil higher requir na criterion applic specif architectur stratum directli specif architectur stratum directli compar tabl criteria list row tabl order discuss section architectur requir modif underli dbm stratum applic stratum public interfac specif dbm gener api implement architectur gener api input output modif requir middlewar absolut minimum impact give architectur architectur proprietari librari input interfac independ applic applic call proprietari librari tempor function applic rule applic access dbm directli mention section data model problem remain architectur independ applic call input interfac input interfac proprietari librari specif api gener api output interfac spec api gen api spec api gen api spec api gen api modif dbm minim impact middlewar na na na independ applic exist technolog gradual avail retent properti adequ perform independ dbm tabl comparison architectur stratum respect exist architectur complianc architectur proprietari librari input interfac requir librari reimplement find architectur api input interfac exist technolog proprietari librari input interfac provid ensur gradual avail tempor function tempor function provid basi time dimens ad function tabl updat api input interfac requir code applic programm start tempor architectur gener proprietari librari architectur assum architectur output interfac specif api achiev perform architectur output interfac gener api justif tune specif reli store procedur cost perform depend shown row tabl middlewar stratum specif architectur middlewar stratum compar tabl leftmost gener api architectur driver architectur rightmost gener api architectur architectur alter driver manag input interfac gener api output interfac spec api gen api spec api modif dbm minim impact middlewar independ applic exist technolog gradual avail retent properti adequ perform independ dbm tabl comparison architectur middlewar stratum tabl architectur dbm reli addit middlewar impact driver approach requir driver manag driver ad driver manag driver alter driver manag requir addit softwar compon middlewar isol requir reimplement entir driver manag chang find minim impact architectur independ applic input interfac gener provid tempor function retain desir properti underli dbm architectur tune specif dbm perform cost dbm independ tune specif api output interfac dbmss access odbc alter architectur independ dbm multipl specif api preprocessor stratum specif architectur preprocessor architectur compar tabl input interfac proprietari librari specif api gener api output interfac spec api gen api spec api gen api spec api gen api modif dbm minim impact middlewar na na na independ applic exist technolog gradual avail retent properti adequ perform independ dbm tabl comparison architectur preprocessor respect modif impact independ preprocessor architectur similar architectur input output stratum discuss section preprocessor architectur good exist technolog preprocessor approach wide assum dbm vendor softwar experi implement preprocessor gener preprocessor architectur make coupl stratum dbmss lower interact stratum dbmss strata assum widespread applic programm familiar concept dbm preprocessor rate preprocessor architectur similar perform architectur stratum directli perform preprocessor architectur queri optim compil time runtim assum perform dbm independ relat architectur relat work gener softwar design techniqu complex system reduct system broken subcompon interfac function layer entir layer replac affect part larger system long layer adher interfac layer divid system layer independ develop layer found design pattern design pattern provid interfac subsystem pattern layer system work interfac subsystem appli directli interfac provid context stratum specif dbm subsystem type call found decor adaptor design pattern origin system paper introduc design time relat model implement paper discuss detail data model hierarch network data implement top relat model idea similar paper consid implement tempor data model top relat data model altern stratum approach build tempor dbm integr architectur dbm build scratch implement incorpor tempor support postgr dbm architectur support transact time time travel queri languag extens tempor dbm support valid transact time extend academ ingr system implement tquel tempor queri languag implement tempor dbm tempor enhanc dbm built scratch support multipl valid time transact time tempor final integr architectur contact system extend public domain dbm valid transact time support prototyp publicli stratum approach recent implement tempor dbm call support valid time transact time built top oracl dbm support tempor queri languag descend tempor queri languag tiger prototyp close rel implement test onlin mixtur integr stratum architectur document tempor dbm prototyp support valid time implement partli top ingr dbm partli extens ingr dbm ingr kernel extend support interv data type rest tempor function built top extend kernel discuss tempor dbm implement top exist system minim effort implement techniqu cover summari build tempor dbm scratch larg realiz major dbm vendor enabl implement applic exploit support time dbm enabl tempor investig task build tempor dbm reduc build top exist convent maxim function set criteria evalu stratum architectur architectur build stratum identifi fifteen specif architectur discuss categor exist tempor dbm implement awar specif architectur specif architectur compar criteria architectur architectur prefer depend situat stratum tempor function quickli tempor enhanc librari provid tempor support librari tailor specif dbm maximum perform dbm vendor extend product provid tempor enhanc preprocessor stratum top specif dbm dbm vendor make tempor extens requir work compar extend singl librari tempor support short medium term approach build tempor dbm build top exist convent dbm resourc focuss implement tempor function reimplement exist function acknowledg research support part danish natur scienc research council grant nation scienc foundat grant chorochrono fund european commiss dg xii research network activ train mobil research contract refer ahn snodgrass partit storag tempor inform watson system relat approach manag acm die bei den al perl dbi api specif version march bohlen tempor system implement sigmod snodgrass coalesc tempor vldb pp bohlen jensen seamless integr time sql technic report aalborg depart comput fredrik aalborg bohlen tiger bitempor prototyp march vlissid design element reusabl objectori softwar grai reuter transact concept techniqu morgan kaufmann san hamilton cattel java sql api version march jin odbc driver agent march lomet salzberg access method data acm sigmod intern confer manag pp june microsoft corp microsoft open connect softwar develop kit version microsoft roth perl modul march tempor manag main memori prototyp technic report depart comput simon strateg manag year morgan kaufmann san snodgrass tempor queri languag tquel acm snodgrass tempor queri languag kluwer academ jensen steiner ad valid time chang ansi dbl jensen effici evalu natur join intern confer data pp snodgrass implement design implement ingr acm stonebrak design postgr storag system vldb pp row implement postgr ieee transact knowledg data bohlen layer implement tempor techniqu technic report depart comput fredrik aalborg lorentzo transact support tempor dbm clifford recent advanc tempor pp schwartz program perl edit oreilli
IR/609 5 evalu web crawler filippo menczer pant srinivasan depart manag scienc school librari inform scienc iowa iowa ia miguel ruiz dei plaza ny abstract due limit comput dynam natur search engin index web cover portion web monitor continu essenti develop ectiv crawl strategi priorit page index issu import search crawler make addit base relev visit page dicult evalu altern crawl strategi relev set unknown search space chang di erent method evalu crawl strategi appli metric compar crawl algorithm base similar link adapt agent categori subject descriptor storag inform search storag system manc cial problem control tree search strategi gener term design keyword rst perform topic driven web inform retriev introduct permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee septemb usa copyright acm crawler program design retriev web page essenti kei applic serv web start earli queri base crawler fish search webcrawl crawler todai basi larg search engin special servic invest competit intellig scienti paper repositori research area gather momentum evalu crawler rich histori evalu studi compar retriev algorithm context er evalu method measur appli end dimens crawler evalu problem dramat di design evalu strategi valid challeng rst goal explor approach assess compar topic driven crawler method di er assess crawl rst build text classi independ retriev case appli simpl similar metric dynam set crawl page goal appli evalu framework compar type crawler rst priorit link frontier base similar queri page link found crawler base algorithm rank googl search engin base search agent evalu link neural net adapt evolutionari algorithm uniqu aspect explor assess strategi constraint limit resourc evalu crawler gener crawler evalu abil retriev page major hurdl problem recogn good page oper environ real user judg relev page crawl determin crawl success experi involv real user assess web crawl extrem problemat instanc scale web suggest order obtain reason notion crawl ectiv conduct larg number involv larg number user crawl live web pose time constraint crawl overli user avoid time load show user result full crawl limit extent crawl indirect method infer crawler strength assess applic support assum underli crawler speci prohibit assess crawler argu obtain user base evalu result remain junctur import seek user independ mechan assess crawl perform distant major direct consum inform web agent work behalf human web agent human reason explor crawler context paramet crawl time crawl distanc limit human accept user base involv real topic repres collect seed url clear simplifi issu move queri topic clue user context goal queri provid approach start seed url increasingli common crawler research assum page topic page obviou limit assumpt sucient condit user relev user view topic page relev lack novelti reason state focu topic indic relev extent research relat work recent research reveal innov measur perform rst observ dimens assess process measur crawl page import method summar perform set crawl page page import gener level page import measur note refer similar similar base measur show rang sophist cho al explor simpl similar presenc singl word titl frequenc threshold bodi page relev page amento al comput similar page vector centroid seed document measur page qualiti similar measur page text word surround link augment primarili link base measur chakrabarti al uniqu appli classi er built posit neg page determin page import explor classi er page di erenc hub author commonli page import measur cho al page pagerank speci ed threshold relev queri kleinberg notion hub author extend edg weight consid import edg connect di erent site link base qualiti metric reli gener reason notion link ect credibl target page interestingli amento al show author pagerank ectiv identifi high qualiti page judg human expert method pagerank design oper queri implicitli recogn criteria instanc infospid crawl start point obtain clever engin base search combin similar criteria suggest evalu link guid word surround link build belief network except set experi perform cho pure link base metric direct assess crawl summari analysi measur page import backlink count cho al examin percentag import page retriev progress crawl menczer al measur search number page crawl predetermin fraction import page visit chakrabarti al perform similar analysi classi er page call averag averag number relev page retriev di erent time slice crawl author measur crawler robust ident crawler start di erent subset seed set robust measur overlap url server crawl time treat robust independ page import measur authorit page crawl minimum distanc seed set greater greater abil crawler focu search evalu method assess classifi rst approach evalu crawler classi er build classi er topic train set posit exampl train set topic consist page ps seed url neg exampl page seed url topic except topic share url seed qs url exclud ps neg set classi er assess newli crawl page posit classi ed page view page topic measur view similar relev decid classi er exponenti gradient rocchio classi er featur select correl coecient select featur topic optim threshold set maxim score train set due limit space refer reader detail classi er observ chakrabarti al classi er assess page evalu strategi differ wai classi er depend hierarchi topic speci calcul involv condit probabl depend hierarch structur link concept exploit yahoo hierarchi easili work ordinari set topic crawl util classi er guid assess crawl strategi work classi er distinct crawler algorithm assess retriev system approach independ retriev system rank crawl page topic crawler assess page fetch good crawler retriev high rank page earlier lower rank note tempor posit fetch page signi canc crawl conduct live user intent add result crawl index search tempor posit interest observ crawler retriev page minimum distanc seed set constraint consist test crawler share seed set url independ system rank page crawl complet util term weight strategi involv document frequenc comput fetch inform crawl progress reason retriev system smart system reput widespread ir research crawl progress store sequenc page uniqu fetch topic page retriev crawler pool index smart weight topic page vector weight compon weight term page comput kd max ln jsj nk frequenc term page set crawl set term nk number page compon impli cosin normal weight page dataset rank smart topic section queri calcul averag rank fetch page crawl note averag topic rank lower averag crawler minimum averag rank obtain crawler retriev higher rank page lower rank highest averag obtain crawler retriev lowest rank page lower rank page retriev higher rank set max page maximum number page fetch measur akin search length determin number page fetch achiev level qualiti measur smart assess topic similar approach relat previou simpler argu good crawler remain vicin topic vector measur averag cosin similar vector topic vector page visit point tfidf kq tfidf kp tfidf kp tfidf kq set page crawl time tfidf kd weight term document tfidf kd ln jsj nk increment set page crawler grow plot trajectori time assess crawler base capabl remain topic measur assess retriev set topic core underli assumpt crawl set relev page design topic crawler consid paper design topic orient page retriev crawler relat web search engin major advantag work design essenti unlimit number topic long consist method gener topic preliminari result report studi base topic regard small larger studi conduct amento al queri compar ort topic collect size compar favor work cho al essenti topic stanford home al discuss topic topic identi ed yahoo hierarchi rst identi ed yahoo page children categori extern link order rst walk ltere leaf page extern link select rst leaf page repres topic extract rst extern link seed set topic form concaten textual descript link seed set anchor normal tabl show coupl sampl topic tabl sampl topic seed set yahoo categori topic seed set educ censu censu bureau nation assess educ progress data report nation center educ statist nation educ statist inform system joint programm develop statist inform system educ polici africa school district data book pro nancial administr data school district unit state school enrol data censu bureau crawler logic crawler logic main queri url set initi url queri text web privat data structur url statu common data structur figur crawler evalu architectur architectur figur illustr architectur system develop test evalu crawler strategi system design provid framework modul implement arbitrari crawl algorithm easili plug standard share data structur util optim ecienc ect fair evalu exampl common facil includ http interfac simpl html stemmer benchmark report routin system implement perl test crawler visit max page page start seed set crawl end sooner crawler bu er empti explain timeout web download larg page chop retriev rst kb protocol http redirect lter static page content stale link yield http error code remov found good link resourc constraint crawler consum network bandwidth download memori maintain privat data structur support cpu evalu select disk storag store text link fetch page complex select greater resourc order fair comparison crawl track cpu time crawler page ignor time fetch common crawler imposs control network trac benchmark oper limit memori crawler constrain bu er size bu er crawler temporarili store page frontier page link explor subset web evalu url crawler track maximum max buffer page link bu er full crawler decid page substitut page ad crawler assess crawler simpl maintain frontier url prioriti queue sort cosin similar topic page url found figur er simpli ed descript algorithm function return cosin similar topic kp kq fetch frequenc term pagerank pagerank brin page model user sur ng behavior pagerank page repres probabl random surfer link randomli page page time page score depend score page point sourc page distribut pagerank outlink foreach link visit link doc score foreach outlink figur pseudocod crawler foreach link visit foreach link link doc score foreach outlink figur pseudocod pagerank crawler page set page point set link constant damp factor repres probabl random surfer request random page origin pagerank intend combin similar base criteria rank retriev set document fact pagerank googl search engin pagerank guid crawler assess page qualiti combin pagerank similar topic guid crawler point crawl select url highest pagerank url mention crawler store util link inform max buffer web page bu er page fetch bu er delet page similar topic similar calcul equat limit link record bu er point domain di erent sourc page domain ecient algorithm calcul pagerank equat pagerank foreach agent theta cost theta visit agent agentlink theta offspr figur pseudocod infospid crawler calcul comput resourc intens process ideal situat recalcul pagerank time url select frontier improv recomput pagerank url select pagerank crawler algorithm illustr figur function return cosin similar topic page measur equat function comput equat assum page url crawl implicitli link page bu er requir pagerank algorithm converg threshold converg set infospid infospid popul agent search page relev evolv queri vector neural net decid link follow fig illustr simpli ed implement origin algorithm crawler modul evolutionari approach tness measur base similar local select criterion adapt agent consist vector keyword topic neural net evalu link simpl perceptron crawler implement repres vector weight keyword repres agent opinion term discrimin good page network weight model rel import term neural net input keyword singl output unit main loop fig agent estim link current page text surround link feed agent neural net activ keyword sensit input unit neural net receiv weight count frequenc keyword occur vicin link distanc weight function keyword match closest link question process repeat link current agent stochast selector select link di erent link page consid equal document cosin similar agent queri vector comput equat compar estim made previou order improv agent predict di erenc adjust neural net weight standard agent updat agent reward energi proport similar topic newli fetch charg constant cost fetch page agent energi level determin agent surviv agent di run energi energi level compar constant reproduct threshold theta determin reproduct agent spring receiv half parent energi spring keyword vector mutat replac term frequent current document term frequent mutat infospid uniqu capabl adapt search strategi base clue captur page result figur show result rst evalu method classi er techniqu wh section train set classi er figur present result classifi set crawl page train classi er axi repres averag fraction crawl page classi ed posit topic classi er graph present mean standard error crawler classi er show outperform turn outperform pagerank trend consist classi er analysi reveal di erenc crawler classi er statist signi con denc level consist error bar mention measur evalu crawler relev decid train classi er view classi er result close low part due fact posit page compar neg page train classi er classi er tend make neg figur present result evalu method smart independ retriev system show coverag data averag topic axi graph repres sequenc id fetch page axi repres averag smart rank page fetch sequenc posit axi averag comput topic note low averag rank perform graph show boltzmann distribut temperatur epoch train learn rate momentum page visit energi gain cost reduc factor pr bf pr bf pr bf rocchio wh figur assess crawler er error bar plot correspond standard error number highest rank page pagerank infospid figur assess crawler deriv rank averag achiev conduct point top top top support result top infospid signi cantli pagerank point significantli signi cantli pagerank measur combin notion recal averag search length low figur show result evalu strategi measur similar maintain set page visit crawler topic similar score averag topic crawler gure er tempor view axi repres time measur crawl size crawl signi advantag establish pagerank page crawl infospid pagerank figur assess crawler similar topic crawl page introduc method relat metric evalu perform crawler algorithm implement crawler base algorithm suggest compar evalu techniqu evalu method yield fairli consist result base similar measur kind stress classi method driven neg exampl build classi er drawn page independ topic method base retriev system base similar topic give inform data dynam import featur contrast dynam process crawl versu static retriev assess base retriev system augment add con denc system assess page rank vector base smart system boolean search interfac mg provid averag rank page pool fetch averag rate crawler outlin paper base averag topic work analyz perform criteria similar topic import crawler experi limit task locat page similar construct metric focu factor author expect infospid potenti advantag exploit novelti abil expand queri term correl energi potenti captur evalu method paper pagerank arguabl advantag locat authorit page limit assumpt made respect evalu method user assess relev set topic unknown knowledg relev metric recal search length number page crawler visit percentag relev evalu crawl strategi dicult imagin dynam environ web access exhaust knowledg determin topic entir relev set metric requir knowledg comparison test result consist show outperform pagerank nish success crawler similar topic criterion priorit link poor perform pagerank expect algorithm favor authorit page gener regard topic question crawler rapidli drift shown figur attract popular irrelev site pagerank gener perform improv longer crawl suggest trend figur perform infospid agent crawler similar converg relev area neural net discrimin link page figur demonstr infospid achiev highest coverag relev page highlight infospid appli complement search locat highli relev page recent index crawler futur intend studi wai evalu infospid capabl locat relev page small similar topic measur similar visit page expand queri made page relat topic note implement infospid left aspect origin model sake simpli cation ecienc perceptron neural tune weight predict perform epoch high learn rate size infospid popul signi cantli max buffer limit crawler access memori resourc architectur test complet implement algorithm futur research number queri experi limit fact iter softwar design order time crawler averag hour topic hour intend extend experi larger topic infrastructur establish build evalu system evalu system assess altern crawl intend test variat pagerank di erent converg criteria recomput pagerank di erent infospid lookahead di erent learn crawler scalabl sensit crawler perform gaug versu resourc size bu er data structur length time import factor neglect preliminari result report result assum crawler modul time complex determin page visit case di erent crawl algorithm di erent comput requir monitor cpu time requir crawler modul pick link intend data carri normal assess crawler perform time complex acknowledg grate implement earli version pagerank algorithm refer hill predict expert qualiti rate web document intern acm sigir confer research develop inform page ur ad support dynam search intern world wide web bharat improv algorithm topic distil hyperlink environ intern acm sigir confer research develop inform page brin page anatomi hypertextu web search engin seventh intern world wide web rajagopalan automat resourc compil analyz hyperlink structur text intern world wide web van den dom approach web resourc discoveri intern world wide web page ecient crawl url order seventh intern world wide web post inform retriev make search feasibl intern world wide web ecient comput pagerank technic stanford najork measur search engin qualiti random walk web intern world wide web page hull improv text retriev rout problem latent semant index croft van acm intern confer research develop inform page springer de warmuth exponenti gradient versu gradient descent linear predictor technic report technic report bake center comput engin inform santa kleinberg authorit sourc hyperlink environ annual symposium discret page papka train algorithm linear text classi er intern acm sigir confer research develop inform page menczer belew adapt retriev intern local context scale web machin low featur perceptron usabl case studi text categor annual acm sigir confer research develop inform page pinkerton find peopl experi webcrawl intern world wide web porter algorithm sux strip william learn intern error propag rumelhart parallel distribut volum chapter mit salton smart retriev system experi automat document process englewood cli evidenti inform belief network model intern acm sigir confer research develop inform page van rijsbergen inform retriev edit widrow stearn adapt signal process englewood cli mo bell manag compress index document imag morgan san edit yang evalu statist approach text categor inform
DB/610 3 scalabl consist protocol distribut servic colleg comput georgia institut technolog ga scalabl inform system silicon graphic mountain ca august abstract common address scalabl requir distribut servic emploi server replic client cach object encapsul servic state perform system depend protocol implement system maintain consist object copi explor scalabl consist protocol requir synchron commun node copi relat object achiev develop approach call local consist lc base protocol provid flexibl effici node control awar updat cach object develop protocol implement strong consist approach demonstr scale tradit invalid base consist protocol system load geograph distribut dimens scale scalabl distribut consist protocol introduct comput local area network larger interconnect growth internetwork highli interact applic span local network exampl applic domain comput support cooper work virtual realiti base distribut shop applic support distribut servic provid low latenc access dynam chang share state problem scalabl consist access import dynam content web concern system support build scalabl distribut servic provid access dynam chang inform explor scalabl servic dimens system load geograph scale system load abil system work support part nsf grant withstand growth total number potenti client geograph scale abil system toler reduc effect larg latenc distribut system common address scalabl requir distribut servic emploi servic replic cach servic state client node assum servic encapsul distribut object scalabl implement servic lead object state distribut multipl node server replic client cach introduc problem consist multipl copi object focu paper develop evalu scalabl consist protocol consist problem import due interact natur assum access share servic state approach explor develop scalabl consist protocol context distribut share memori synchron inform lock exploit reduc cost consist mainten system scale vari coupl applic assum access servic state control synchron oper share virtual node read render scene recent cach copi incur overhead lock oper approach improv scalabl consist protocol provid weak consist share state updat multipl lead conflict updat resolv explor strong consist protocol ensur access object implement relat servic serial node order updat object conflict updat strong consist formul number wai sequenti consist serializ share memori system consist model requir execut oper share object serializ consist condit time oper execut requir updat object node visibl node copi amount time interact time dissemin updat requir provid strong consist model atom memori consist model requir serial oper respect time oper execut protocol implement strong consist permit accept dissemin effect updat oper explor notion strong consist serial object access sequenti consist client node control quickli awar updat cach object flexibl control updat dissemin develop scalabl protocol strong consist develop approach build scalabl consist protocol develop mechan call local consist basic idea lc mechan summar tradit strong consist node updat share object notifi node copi updat node wide updat latenc larg lc base node updat share state inform node node ensur object copi access consist node awar extern updat fetch copi demand accept copi node execut local consist action invalid local object copi overwritten respect newli arriv object advantag approach access latenc lower lc base protocol read write access complet requir commun node copi access object object copi lazili invalid node execut local consist action object number client request server reduc server load consist relat inform batch object copi network load node fetch copi object demand result object copi node introduc cach consist manner push pull style updat dissemin lc base protocol lc base protocol serial object access client control quickli updat visibl currenc cach copi control base resourc avail commun applic evalu lc base consist built object cach framework top system corba distribut object model preliminari perform result support compar lc base strong consist refer sc lc invalid base protocol call sc inv sc lc carri consist action object copi pull demand object access fault sc inv synchron invalid cach copi object object written show version sc lc exploit lc approach read oper complet older object scalabl achiev dimens scale drive system synthet workload captur read write share pattern larg scale demonstr averag time object access sc inv slower sc lc presenc wide distribut sc inv load server client node sc lc sc inv entail messag client node sc lc rest paper organ section motiv lc approach section describ lc base implement strong consist prototyp evalu topic section discuss relat work section conclud paper section assum lock acquir access invalid messag node request lock lc approach system model assum share object store server node client node cach object copi access local object relat consist requir defin relat object relat document object result experi discuss user updat desir user access updat copi copi node copi interest updat object access defin system global view node view captur valu object access node global node view imaginari extern observ updat object instantan global view defin valu object extern observ object observ progress global view node cach subset node view defin valu cach node ideal case node learn updat instantan summar node iew ae current global iew achiev ideal node updat object synchron node copi object wide area latenc make synchron costli node wide distribut node copi updat object interest object work set lc global view updat updat node made advanc view current global view node view lag current global view node view node ensur view belong global view recent intuit show assum system question central access complet send request central server client updat request servic global view node view defin valu return read request current global view node updat share object assum global view chang updat complet global view interest observ result read request result depend request reach process server request global clock exist request made newer factor network delai subsequ read return older valu lc approach base observ defin term node global view node view local consist node iew ae global iew node iew ae global iew node iew ae global iew time global view view figur global local view global iew recent global view global iew node view necessarili subset current global view belong global view currenc node view monoton advanc decoupl node view instantan global view kei provid scalabl consist access share object figur show simpl illustr consist node view node write share object result progress shown global view assum complet write start empti cach read cach notat mean copi object view local view belong global view read ad object copi cach cach copi local view belong recent global view previou view belong write valu updat copi inform object copi view local consist request copi read ad cach action leav cach state shown figur view local consist belong global view maintain copi invalid copi ad cach result belong global view recent view cach consist local invalid overwritten object copi node view advanc consist protocol synchron invalid cach copi write ensur local view node synchron current global view lc base local view lag current global view lag control depend resourc avail applic commun bandwidth client period request updat server push object valu cach node client node receiv valu consist introduc cach perform local consist action lc base protocol provid enhanc flexibl client access consist object copi level currenc cach inform strong consist lc approach develop scalabl protocol implement strong consist protocol ensur access complet node serial order consist order access node protocol focu ensur safeti requir avoid conflict make serial augment addit mechan meet live requir focu mechan protocol ensur oper serial compar protocol invalid protocol sc inv briefli describ protocol featur lc base protocol outlin actual protocol present invalid protocol inv invalid client cach object copi access client write object cach copi mode xs copi experi copi cach experi commun server return copi copi system copi server invalid collect acknowledg respect node return access client refer client cach object copi mode owner attempt read object copi experi commun server client cach object copi server return copi client server downgrad owner copi mode latest copi owner scalabl protocol limit requir commun node object copi write request receiv server lc base protocol present requir commun lc base protocol similar sc inv lc base protocol assum singl writer object time import differ invalid protocol base lc lc base server transfer write access exist reader invalid messag reader object coexist writer read valu consist node view invalid messag node receiv process messag time object cach updat node lc base protocol order access relat object advanc node view consist manner time object copi ad node node perform local consist action ensur store copi share object valid node view consist action requir commun invalid local copi potenti overwritten view client node commun object server object cach updat object read permiss commun server advanc client view client view advanc period commun initi server client period commun ensur lag client view global view bound object access lc base protocol offer flexibl control currenc cach object copi base resourc avail applic aspect consist protocol local consist action implement explor implement action assum object consist desir store singl server node protocol determin object copi remov node cach node view handl distribut server implement address problem relat object store multipl server node protocol present protocol lc approach implement strong consist call protocol protocol base effici sequenti consist protocol develop share memori system protocol similar present requir client commun server write oper protocol share similar approach includ dynam protocol implement sequenti consist memori protocol maintain consist node view receiv inform object copi store node overwritten commun server case singl inform maintain effici server node protocol shown figur write requir commun server server send messag invalid copi system request receiv inform object invalid maintain refer invalid shown method figur client node request ownership object result server determin copi node ad client request return request result request read miss handl sc inv invalid set request client return case write client receiv invalid cach copi object list object copi client invalid client commun server object written simpl execut protocol shown figur client node initi step cach action client invalid local copi object member read definit copi receiv invalid local copi object member read action current owner current owner client cach add figur protocol step node node remark empti empti xs owner ys owner copi downgrad read copi downgrad add ad add remov ad copi invalid read read latest figur protocol simpl downgrad node copi mode step write commun server grant ownership ad note continu read copi contact server step contact server write server add return local invalid includ read copi read copi invalid protocol figur show action advanc client view action execut client server result server send client messag client invalid local copi object includ messag futur access invalid object result commun server advanc client view recent correct correct proof protocol requir demonstr serial object access protocol maintain consist node cach serial ff produc access complet commun ff simpli order central server execut request oper object cach permit client complet access commun server server serial oper requir commun server assum execut oper requir commun server set local access immedi follow serial ff access consist updat local oper client receiv commun write object copi cach access visibl immedi serial construct client read valu older view object updat node detail proof found object lifetim base protocol consist requir relat object store node maintain singl server incur addit commun overhead develop protocol distribut server assum relat object partit server server object remain fix migrat server replic address lc base node view advanc newli cach object exist object copi overwritten node view approach object copi determin exist object copi valid node move newer view denot copi object store call lifetim lifetim object copi time interv copi access violat consist synchron global clock node access object lifetim defin time interv time read written call time time read overwritten gener copi lifetim easili copi object object updat period time associ lifetim object copi written time write object address problem store lifetim object copi associ copi lifetim interv start advanc system learn overwritten object copi cach node lifetim straightforward field includ web page store dynam content lifetim establish valid object test develop determin set cach copi belong consist global view copi belong consist view overlap lifetim written recent greater lifetim copi overlap correct gener belong consist global view lifetim copi local invalid ad node cach lifetim base protocol lc approach node carri consist action local commun node consist preserv cach copi overlap belong common global includ global view incom object copi gener set copi belong consist view pair copi set overlap lifetim defin object lifetim synchron global clock larg scale distribut reason assum exist clock develop consist protocol requir synchron clock logic clock record object lifetim vector clock vector time order write detect conflict updat replic data system bayou coda vector clock vector integ compon updat node updat node defin node object updat denot clock node vector time updat compar node increment increment return maximum vector time vector compon equal compon compon strictli compon vector time compar equal time call concurr kei correct implement strong consist object lifetim read logic clock set rule clock maintain node advanc clock node global view order logic time creat achiev node increment compon logic clock view advanc order view result execut oper develop set clock rule time object copi updat node clock ensur clock time view correctli reflect order view object lifetim similar field alex protocol explor reduc consist relat messag differ logic time defin lifetim ensur consist relat object refer time interv futur client notifi updat cach copi period lifetim refer time interv past object larg number node access assum node access object mode scalabl vector clock issu strictli compon updat node compact logic clock place vector clock valid clock rule order view logic clock clock advanc reflect view tradit vector view result execut oper node order increment node clock execut oper order oper node messag pass vector time includ messag advanc node clock send messag includ time read clock messag receiv time includ messag updat object share oper node order reason oper write read oper order valu written consecut write read oper return order captur order vector clock advanc cach execut ensur time execut properli order order read oper updat overwrit associ denot reflect time read node time read equal object copi section order read return write oper overwrit easili ensur execut overwrit updat execut clock captur node clock action gener object access rule node complet access local cach copi object object copi read complet advanc node remain view access updat object copi node access increment node view advanc result updat rule access result object commun xs server fetch object copi access complet server writer system node cach server send copi server commun writer return writer copi client downgrad access mode receiv copi advanc vt ensur view read access complet order view produc rule object cach mode updat experienc write experienc commun xs server node cach write server request downgrad access current copi advanc vt action ensur write execut order write produc overwritten copi oper read order updat similar write cach increment write complet rule ensur time read vector clock node view order consist order view rule ensur write time object total order rule ensur time access read object greater time write oper execut object maintain rule ensur consecut write time read oper complet order time discuss time assign object copi read valid time node execut oper gener object copi simpli complet cach object mode experienc execut updat xs overwritten ensur vector time view valu gener total order updat clock view oper execut order view updat oper overwrit read multipl node reflect read oper implement server contact client readonli copi return node experi maximum clock valu obtain client invalid base protocol sc inv induc commun client cach readonli copi encount avoid maintain xs server node rule ffl node request inform server local server updat maintain set send request server ffl cach node mode experienc servic xs server commun downgrad copi mode return current server updat receiv clock acquir copi server return experienc write order read copi overwrit read node execut reader coexist writer read complet view time concurr time view result execut perform node oper awar result invalid view result execut concurr view older copi read order read serial local consist perform object copi invalid cach object copi ensur older copi lifetim incom copi access commun server copi overwritten view gener object copi invalid unnecessarili node advanc copi advanc reduc unnecessari invalid object copi updat ffl local cach object copi advanc node clock object copi valid node present view arbitrarili high set object copi written ffl server request node object node updat copi clock return copi reason ffl protocol server return valid copi server updat object copi clock return request client node aggress advanc server node maintain vector clock time client contact server write fault object copi server local clock server updat clock vector time receiv client advanc view reflect oper execut client client request copi object increment wt vt oper wt vt oper figur sampl execut scenario clock send server request object ensur server clock reflect updat oper execut client server make clock advanc valid time object copi send request node protocol consist protocol base object lifetim techniqu shown figur simplifi notat refer copi store object copi relev discuss denot store copi object read write access complet local cach omit descript oper focu client request add object copi cach desir mode handl event shown client side client experi access miss fault object request copi server receiv copi client compar incom copi lifetim lifetim relat object copi cach updat node clock local invalid local invalid ensur node cach consist copi object node clock advanc rule time object copi result commun similar invalid handl differ lifetim base protocol receiv write request client object owner server request owner copi owner statu downgrad copi invalid copi invalid messag client server recent copi system return request client multipl reader coexist singl writer execut scenario shown figur intuit work protocol object initi step node quantiti left individu oper figur object local clock oper execut cach copi downgrad copi updat copi commun server obtain ownership action client node definit object cach local invalid action xs figur lifetim base protocol read copi invalid local copi node advanc node cach copi updat assign rule local copi invalid node continu read older futur read node result cach miss read recent protocol figur includ action advanc client view period similar action ad protocol server send object lifetim record client requir lifetim receiv server higher client advanc copi receiv lifetim higher cach copi local invalid node advanc view request recent copi invalid object correct similar correct lifetim base protocol requir demonstr serial object access protocol maintain consist object copi basic idea produc order access logic time execut clock updat clock base time object ensur logic time oper execut order consist manner correct demonstr argument inspir work scalabl weakli order memori system system assum type synchron label oper ordinari oper synchron oper order ordinari oper result execut obtain strongli consist system assum user program properli access execut acquir lock read slightli stale data accept applic read complet cach copi acquir lock absenc explicit order induc oper clock rule approach result implicit synchron demonstr access serial proof demonstr correct found hybrid protocol object lifetim base protocol conserv requir assum figur write relat object invalid copi execut overwritten write advanc clock execut protocol invalid object copi unnecessarili protocol suffer unnecessari invalid work correctli singl server case outlin hybrid protocol combin protocol call sc lc client experi object contact xs server denot server maintain read valid time object copi invalid set time includ messag receiv client node receiv local cach object includ invalid object manag invalid write object copi contact invalid set inform object maintain correctli object manag consist maintain object lifetim base protocol time receiv copi combin protocol correctli maintain consist cach object copi implement sc lc prototyp system discuss prototyp implement implement object cach system evalu protocol previou section system support base distribut object invok remot method invoc paradigm code state cach local system built top toolkit support rmi base distribut object perform consist action cach object object method execut read object state state updat current version process run client commun server share memori client process share object alloc space cach architectur client node impact object invoc focu paper compar evalu consist protocol omit detail found focu evalu workload absenc trace interact applic deploi consid synthet workload evalu consist protocol exist workload evalu fall domain distribut file initi evalu system base distribut file system workload workload chosen richer share pattern exist workload captur access user cooper geograph distribut softwar develop environ workload matt blaze thesi larg scale distribut call princeton workload document file access approxim user collect week princeton comput scienc depart workload evalu protocol system load aspect scalabl workload larg industri distribut file system support thousand user organ project orient workgroup connect hierarchi local area wide area network spread metropolitan area studi conduct research toronto call workload toronto workload evalu protocol geograph distribut aspect scalabl inform xf trace chose implement synthet workload gener usabl live load trace toronto workload uniqu evalu geograph synthet workload gener paramet number object invoc client make object invoc princeton hour gener time randomli averag time averag time princeton studi approxim forc experi run hour order run experi control time reduc time arbitrarili effect accuraci result discuss section time object access probabl object creat exist workload web server support access dynam content url workload repres singl writer multipl reader access pattern explor consist distribut server object updat multipl node web workload previou read read write write oper user user user user read write tabl file inertia probabl chosen object access minut tabl tempor local file access client read write inertia determin probabl client access file probabl mode access file inertia princeton trace tabl likelihood file written sharpli open read time entropi suggest princeton workload tempor number tabl princeton workload file wide share node good candid replic cach expect chang quantiti workload experi ratio workload gener workload gener event time gener iter number client averag time determin timestamp event gener creation rate determin event object creation object access object server chosen equal probabl case object ratio determin access type tempor local suggest object list event gener client object inertia determin oper object access object entropi forc oper read data structur object inform access access type client number success read list reader writer object number reader writer decid object creat number read share exact ident reader writer determin equal probabl client workload gener faithfulli valu workload paramet previou studi princeton mention time princeton workload reduc time arbitrarili effect result experi attempt trace faith intend workload approach interest reduc averag chose method shorten experi durat client delai access present time match event time track access delai manner number indic amount control workload number delai control time chosen smallest time client delai access ensur access time object node suffici account time server contact writer send consist relat messag perform experi princeton workload averag time time averag time found protocol sensit chang interest compar feel experi reduc access time perform evalu import perform metric studi averag time object total number cach miss server time spent server servic cach miss server request messag server node send servic client request measur server load client product cach miss experienc client time spent server servic cach miss cach miss server request account total number messag system repres network load perform studi report includ action sc lc period requir client commun server advanc view client view advanc client experi invalid protocol sc inv cach copi invalid synchron write object read access sc lc return older valu compar sc inv sc lc aggress downgrad access object copi client updat object client experi commun server node commun result invalid object copi cach replac result commun server replac object access futur result report base sc lc protocol period messag advanc node view overhead messag depend coupl requir node view explor futur work setup total eleven mhz control experi main memori connect atm switch cluster scalabl evalu dimens server load wide area number client cach miss number client figur cach miss time measur commun cost machin locat citi cost estim access time case discuss system paramet affect result experi ffl size data averag size file transfer found toronto studi ffl client defin full cach size reduc number cach miss previou studi cach size half size full cach chosen chose cach half size full cach full cach size case smaller compar full cach file princeton studi file total number object workload smaller due fact object creat workload activ studi support small number object implement lru cach replac polici ffl server cach disk emul object server statist previou studi assum server cach hit ratio ms averag disk access time result present result experi evalu protocol dimens scale system load geograph distribut titl graph workload number server client system figur show cach miss princeton workload case number cach miss lower sc lc sc inv differ impli client request newer object copi number client server request number client figur server request number client averag time number client figur averag time number client server load client number server figur server load client number client server request number client figur cach miss server request sc lc protocol frequent return valu differ number server request sc lc sc inv figur expect sc lc client write request reach server due server send messag current owner object exist sc inv server send invalid client copi cach differ metric show averag time shown figur sc lc incur addit comput overhead client server side local consist check process vector time network case mb atm reduc effect compar higher number server request sc inv case experi time server sc lc case sc inv case time result system wide area commun cost incur result present show sc inv entail messag number client averag time ms case number client figur estim time sc lc sc lc incur process overhead sc inv server client request network desir reduc server load number messag figur plot server load client product cach miss experienc client time spent server servic cach miss sc inv load server client sc lc larger system control differ protocol increasingli number client system geograph figur show cach miss server request sc lc sc inv toronto workload control cluster environ creat trace cach miss server request messag trace simul commun cost determin access time compar advantag similar absolut number lower princeton workload toronto workload demonstr share share workgroup level cach miss server request experi latenc calcul averag time factor latenc measur minimum latenc sun rpc round trip machin locat citi latenc ms ms byte messag workgroup toronto studi locat citi time plot averag time figur messag carri data assum time messag control messag assum time byte messag suggest link bandwidth longer factor latenc case scenario latenc equal disk access time ms plot averag time factor latenc figur calcul averag time factor measur commun cost actual measur provid result lack control environ observ total number messag princeton workload case hold differ averag time dramat sc inv averag time sc lc case scenario link bandwidth longer factor latenc quantiti compar disk seek time demonstr advantag sc lc sc inv dimens geograph distribut discuss result perform studi suggest protocol base local consist approach scale invalid base protocol workload evalu protocol system load dimens scalabl studi invalid protocol sc inv entail messag server load client lc base consist protocol number user differ impact network server load show advantag sc opt sc inv dimens scale workload industri set user work workgroup orient group spread metropolitan area evalu protocol dimens scalabl geograph distribut sc opt reduc network load significantli access time demonstr scalabl lc base experi larger system system control experi quantifi copi access sc lc reduc cach miss due fact copi invalid immedi object updat futur explor combin overhead sc lc messag advanc node view larger system simul explor scalabl larg number node system relat work work relat consist protocol develop system includ distribut file distribut object system distribut share memori system relat system comparison includ due space consist issu context web discuss protocol studi includ base weak invalid poll base protocol strong consist argu strong consist provid read return older valu write result synchron invalid cach copi number cach miss significantli protocol data point experi suggest sc lc permit stale copi small number access read data invalid base protocol develop fundament approach access updat frequenc currenc cach inform control base resourc avail permit multipl write object ensur consist relat object evalu sc lc perform invalid base protocol sc inv applic toler lag node view current global view distribut file system emploi cach emploi perform xf system make invalid base protocol ensur cach consist af similar effect bayou coda system address cach consist mobil environ bayou address level consist session weaker consist level permit scalabl focu scalabl implement strong consist avoid conflict updat object similar vector read write time sc lc bayou make vector time updat control order updat process server bayou consid server replic address partial cach relat object client feel dynam access approach explor client dynam request cach subset object interest coda file system emploi server replic client cach file client work cach copi deal disconnect coda updat serial conflict updat detect resolv system report user transact coda provid serializ delai commit transact valid share goal coda client access cach object commun server serial object protocol conflict updat advanc view protocol client commun server similar reconcili coda thor rover emploi object cach strive provid strong consist conflict access rover lead consist violat user repair effect thor transact execut local cach copi ensur serializ transact valid prior commit interact desir effect local oper visibl user execut observ oper extern world problemat optimist techniqu emploi thor conflict common resolv optimist protocol emploi thor provid perform address consist level object access thor support transact includ sequenc access scalabl share memori system stanford dash softwar implement distribut share memori consist action delai synchron oper complet goal work develop consist protocol enhanc scalabl reduc commun larg number node reli explicit server instanc run client node assumpt server store copi relat object client cach object access synchron lock system address scalabl access object exist system support applic make object implement commun client server cach consist issu address system system implement replic object group commun group commun atom order requir strong consist costli cach result membership chang requir protocol conclud remark explor scalabl consist protocol provid flexibl coupl node copi relat object access serial conflict updat copi develop local consist approach protocol develop requir commun synchron node copi object access protocol base philosophi node control interest local step ensur consist object access node awar access object cach approach node control currenc cach object copi resourc avail applic develop protocol support strong consist work distribut server implement consist group relat object implement prototyp system support cach distribut explor benefit protocol creat control environ accur repres larg scale system develop sophist workload conduct varieti show flexibl offer protocol provid improv scalabl futur work focu detail evalu protocol includ richer workload simul explor local consist base approach implement level consist refer adv hill implement sequenti consist system proc intl conf parallel burn causal definit implement distribut ousterhout measur distribut file system proc symp oper sy blaze cach distribut file system phd synthet workload model distribut system file server acm sigmetr cate alex global file system proc usenix file system schwartz hierarch internet object cach usenix technic jan patterson cooper remot client memori improv file system perform proc patterson quantit analysi cach polici scalabl network file system proc acm lori notion consist predic lock system commun timestamp system preserv partial order australian comput scienc hennessi memori consist event order scalabl multiprocessor sandhu case studi file system workload distribut environ toronto technic sandhu case studi file system workload distribut environ proc acm grai effici mechan distribut file cach consist proc acm symposium oper system principl page implement replic file system usenix june seltzer web cach consist usenix technic januari mauric wing correct condit concurr object acm transact program juli howard scale perform distribut file system acm tran comput de kaashoek toolkit mobil inform access proc lazi consist softwar distribut share memori proc intern symposium comput satyanarayanan disconnect oper coda file system acm symp oper sy system support scalabl servic phd georgia inst object cach corba system usenix system lamport make multiprocessor comput correctli execut program ieee tran sep build reliabl distribut system corba proc usenix confer technolog wood dynam reduc coher overhead multiprocessor annual intern symposium comput safe effici share persist object thor acm liu cao maintain strong consist web proc intern confer distribut misra axiom memori access asynchron hardwar system acm transact program languag januari zhou sequenti consist distribut system proc intl workshop theori practic dist system time global state distribut system intern workshop parallel distribut mogul hint cach web acm sigop highli scalabl system proc schiper causal consist sequenti consist share memori system irisa welch session weakli consist replic data ieee symp parallel dist inform manag updat conflict weakli connect replic storag system acm plausibl constant size logic clock distribut system workshop distribut algorithm octob wang anderson wide area mass storag file system workshop workstat oper oct invalid larg scale network object cach master thesi
DB/611 3 queri optim select bitmap wu research comput scienc depart technic germani abstract bitmap popular index data applic manag system offer todai paper analyz queri optim issu select oper bitmap continu discret select criteria consid queri optim categor static dynam optim static optim issu discuss optim design algorithm base tree logic reduct dynam optim issu includ approach index encod bitmap index introduct bitmap index spark recent discuss area queri dw access larg portion underli complex select predic involv arbitrari aggreg function transact time criterion perform evalu environ due bitmap index techniqu queri process advantag tradit design support frequent updat updat oper affect tini portion underli tabl variat bitmap index includ index encod bitmap index bitmap join index bitmap index queri aggreg algorithm bitmap index year explor issu queri optim bitmap concentr optim queri oper classifi continu discret select continu select queri predic form op op discret select op approach static dynam queri optim discuss static optim optim includ optim index design improv algorithm index process dynam optim perform achiev strategi exploit distribut inform underli determin execut plan index design continu select design criteria index algorithm evalu continu select index numer alphabet data type select happen design type select index effici queri space requir high defin index design criterion point find global index type select introduc encod opportun improv time effici space effici issu algorithm develop techniqu improv perform algorithm index logic reduct techniqu reduc index process time principl perform dynam queri optim paper show principl appli index cost analyt approach probabilist defin determin evalu plan select core introduc work paper attribut tabl domain denot wg cardin defin jt cardin attribut defin cardin domain rest paper organ revisit variant briefli section give cost model index perform analysi section section discuss issu static queri includ index design issu section algorithm design section strategi dynam queri optim introduc section section variant bitmap index member bitmap index simpl bitmap index introduc classic simpl bitmap index index attribut gender domain attribut stand male femal simpl bitmap index consist bit length bit vector equal cardin index tabl bit bit vector set tupl bit vector set delet tupl tag system extra bit vector tupl bit vector bit set tupl valid easi recogn space requir simpl bitmap index linear function cardin index attribut index index process time singl select linear function length bitmap cardin sparsiti bit vector escal infer poor space util high index process cost variat bitmap index solv problem sparsiti common object method reduc space complex index improv perform queri process solut includ compress encod transform bitmap list method effici reduc space requir bitmap advantag bitmap index queri process oper index process capabl multipl index scan discuss approach preserv advantag bitmap index encod bitmap index revisit index paper refer binari attribut project attribut attribut defin short binari index attribut consist bit vector defin figur show store binari figur binari index attribut attribut valu omit figur number bit vector equal length attribut data type length bit vector equal cardin index tabl formal definit binari index found appendix evalu singl select bitmap read select attribut serv filter exist bitmap index base decim uniform base index attribut compon compon bit select predic logic combin conjunct condit index multipl index scan evalu select predic scan index combin result scan gain final result multipl index scan appli index bitmap index explicitli express necess exist exist bitmap decim digit form compon figur attribut compon compon compon set bit set denot bit vector compon index express evalu singl select read final bitmap data retriev compon compon compon figur index attribut base note base bit vector bit vector deriv conjunct negat bit vector binari bit bit vector compon index prefer omit bit vector reduc space requir factor process time specif factor equal figur show bit set equal bitmap rang attribut bitmap bit compon set figur show compon compon compon figur index attribut base rang note decim digit equal compon set choic base affect space requir perform index queri process binari index index equal consist bitmap evalu select bitmap scan requir binari bitmap scan requir index gener index uniform magnitud base space util index whilst perform index process queri type improv queri type defin discuss section base index worth mention uniform base index effici space time respect index number compon build index base base attribut space requir larger perform theorem defin guidelin find base time optim space optim index defin integ index base smallest posit integ compon index integ index base jaj index point state time optimum deriv base index process algorithm time optimum true subset select continu rang discuss section space time optimum defin subject number describ local optimum index perform index time space vice versa binari uniform space base equal cardin index index worst space util global main interest queri space requir classif queri type perform analysi evalu discuss detail section base result index gain queri perform suffer low space whilst uniform binari base minim space requir cost deterior queri perform variat bitmap encod bitmap index possibl solv dilemma space encod function appli encod function attribut domain build index encod domain binari base domain minim space requir special case smaller binari time potenti queri optim order loss queri perform due binari base form base defin simpli bn consist finit number bn jaj assum base index exist bitmap type bitmap compon access queri process bitmap compon depend queri type scheme worst bitmap scan requir queri process bitmap scan illustr build build attribut defin encod map tabl kei encod kei encod void null retriev void fe null fa fu fc fv fw figur encod bitmap index map function map domain set binari figur show number binari digit determin dlog addit due artifici tupl null attribut domain defin tupl elimin extra process bit vector exist tupl requir simpl bitmap index index set retriev boolean function defin base encod boolean function attribut retriev defin true assign encod attribut valu boolean encod retriev number boolean variabl equal number binari boolean variabl correspond bit vector bit bit vector binari encod attribut evalu retriev select valu form retriev boolean case reduc bit read evalu select bit final bit vector desir tupl operand tabl formal definit list appendix binari index defin encod attribut domain binari index number bit vector larger number bit vector decid logarithm index attribut cardin base number binari decid size index attribut data type attribut short bit vector build binari index consist bit vector delet index extra bit vector exist treat artifici attribut encod attribut valu reduc space requir process time optim potenti binari proper encod number bit vector access queri process reduc bit vector includ exist bit vector index denot logic oper denot logic oper read case proper function due applic environ discuss discuss major approach variat bitmap index introduc cost model queri optim cost model index perform analysi metric evalu perform index space time denot term number bitmap denot space requir index denot number bitmap scan select predic evalu discuss paper cost select select predic defin form op singl op singl op set valu op distinguish evalu continu rang oper evalu discret rang oper defin time time denot index evalu continu discret select global defin time time ae time time ae probabl occurr continu rang predic static queri optim queri optim bitmap index achiev approach static optim dynam optim static optim optim includ optim index design improv algorithm index process dynam optim perform achiev strategi exploit distribut inform underli determin execut plan static optim discuss explor dynam optim section index time optim index metric space time evalu perform standpoint queri optim interest time optim index minim process time discuss concentr find time optim index type rang select introduc shortli time function evalu continu rang select deriv loss equal oper continu rang oper affect result perform analysi algorithm evalu discret rang select defin time function base time defin design criterion global time optim index type space constraint explor design issu involv continu rang select algorithm appendix evalu continu rang select predic index base index base deriv time worst rang oper rang oper equat time effici index number fewer compon index index time effici analysi rang oper confin set continu rang select anomali discret rang select discret rang predic replac disjunct equal select predic ineffici evalu discret rang predic algorithm unreason time function base analyz perform index answer discret rang select attribut rang scheme defin select predic bitmap scan requir treat evalu operand set bitmap scan requir evalu valu discret rang predic evalu effici simpli avoid read bitmap bitmap evalu digit read order defin reason evalu discret rang develop algorithm evalu discret rang predic index defin time base discret rang select algorithm evalu discret rang predic rang equal basic idea algorithm avoid bit vector consequ equal test requir bitmap scan comparison involv perform time algorithm work evalu predic valu set examin bitmap requir evalu requir sake loss depict time function rang continu rang rang index perform equal reason rang continu rang select bitmap read algorithm loop perform equal comparison digit digit total size requir bitmap fit implement algorithm loop read bitmap comparison page page algorithm evalu rang select form index rang equal bit encod algorithm index bn number compon denot bit vector compon select predic fv repres bitmap vector repres set tupl satisfi begin initi arrai bit read return handl tupl end algorithm index bn number compon denot bit vector compon select predic fv repres bitmap vector repres set tupl satisfi begin initi arrai bit read return handl tupl end defin time function algorithm evalu distinguish digit algorithm read bit vector bit vector algorithm read bit vector digit evalu involv digit bitmap read algorithm algorithm gener evalu compon bit vector repres ff ff read rang ff assum evenli distribut defin time function algorithm time rang time equal denot number combin time function append appendix worst larg number cardin select algorithm read bit vector index discret rang evalu defin time ae ae equal rang time optim index discret select space optim index global time optim index defin time optimum type select kind order minim process result index design rang select time optim index possibl fewest compon rang bit encod rang select discret time optim index space index possibl largest number compon equal lead conflict index design criteria attribut type select dilemma design criteria straightforward solut design type select index possibl fewest compon continu rang index binari base discret rang select approach find global time optim index type select defin point design criterion global time optim index type select figur time optim index continu select discret select attribut jaj illustr denot time denot time point curv repres index number compon figur denot time evalu discret select predic denot time evalu continu select predic index comput time function base equat figur index reduc time evalu continu select type time evalu discret vice versa order find point minim total time evalu type defin time time numer data type type select happen alphabet data type discret select continu select alphabet order equat equat larg cardin select bitmap compon access set minimum point function defin global time optim index note sake confin set denot time optim index continu select matter restrict effici find approxim optim describ boundari index space describ optimum continu select describ optimum discret select evalu time continu select bitmap time discret select bitmap index shown time optim index discret predic time optim index continu predic time optim index jaj time continu select bitmap time discret select bitmap index time optim index discret predic time optim index continu predic conflict design criteria figur index function time time time time plot figur minimum point curv point figur point mean index attribut optim type select point index continu discret select binari uniform index ten total time bitmap index select type point time optim index continu predic time optim index discret predic point ae total time bitmap index select type point time optim index continu predic time optim index discret predic point ae figur global time optim index probabl occurr type select point min ae time time ae probabl occurr continu rang predic figur reveal curv figur ae point mean ae time optim index discret select global time optim index global time optim index space constraint space constraint global time optim index space constraint defin min ae time time mg order avoid exhaust search index confin search space find smallest fi ji ng fi jj denot time optim index continu select type time optim index discret select global time optim index space constraint min ae time time figur maxim bitmap store total time bitmap index space constraint point time optim index continu predic time optim index discret predic figur global time optim index space constraint figur show bitmap index fi ji fi jj minim point domain encod explor index design issu binari index encod attribut domain exist dilemma time optim evalu continu select design optim evalu discret select design chosen time effici index monoton function space effici time effici cost poor space improv space effici cost deterior queri perform dilemma space time solv encod simpli number bitmap scan queri process space requir index unchang demonstr work defin attribut figur frequent select predic evalu retriev valu select rang form logic disjunct reduc evalu bitmap bitmap access map tabl kei encod kei encod void null retriev void null figur encod encod function shown figur encod subject select predic exist encod function definit appendix result reduct variabl logic disjunct environ select pattern encod improv time effici queri process space effici find encod involv human expert index design phase requir exampl encod typic dw oper includ hierarch encod rang base encod quick variat find encod defin extra bit vector frequent select frequent result bitmap precomput store system space requir space optim space worst time function effect encod logic discuss binari index dlog denot index attribut algorithm design discuss static queri optim design evalu algorithm tree reduct algorithm improv version introduc improv execut tree reduct rang index decim base attribut predic algorithm evalu predic result execut tree shown figur origin execut tree reduct execut tree figur transform execut tree denot denot run state digit valu larger bit vector set replac bit vector tree figur appli boolean execut tree reduc bitmap scan logic oper tree figur bitmap bit vector read type reduct partial depict digit larger origin execut tree replac tree figur appli rule connect sibl directli shown figur reduc comput complex bitmap scan logic oper bitmap scan logic oper equal predic idea work space give work order appli inform percentag popul bit vector extra inform comput time index creation synchron time index chang version suppress unnecessari bitmap scan defin algorithm logic reduct introduc encod improv queri perform predefin set select pattern execut tree reduct execut tree figur transform execut tree denot denot routin predefin queri dw environ transform select predic disjunct conjunct retriev boolean directli evalu boolean express potenti reduct reduc number boolean variabl reduc number redund logic oper perform logic reduct retriev boolean express boolean variabl correspond bit variabl retriev express bit vector reduc number bitmap scan reduc boolean express minim redund oper perform save cpu time select attribut built figur show retriev boolean express select appli logic reduct express reduc time complex reduc bitmap scan logic oper bitmap scan logic oper logic reduct algorithm introduc order binari diagram binari diagram tabular detail algorithm work scope paper dynam queri optim discuss optim design time introduc queri optim techniqu strategi run time cost model defin analysi algorithm evalu index bn number compon denot bit vector compon bit denot percentag select predic op op bitmap vector repres set tupl satisfi select op begin vn vn switch case case return case return end switch return return handl tupl return end principl defin select evalu phase index scan phase data fetch phase index scan select predic evalu index result phase access plan data fetch phase idea principl match exact time index scan phase access desir data includ extra test perform exclud data extra cost access plan phase smaller improv queri perform dynam optim basic idea method identifi condit access plan index scan phase provid global optim queri process time give illustr idea work select predic defin figur show retriev boolean function reduc function illustr principl borrow set describ scenario paper set theori graph figur bitmap scan logic oper requir index scan phase includ select predic make retriev reduc figur show time complex reduc bitmap scan logic oper bitmap scan logic oper null figur graph retriev boolean function index scan phase extra cost phase result bitmap fetch undesir tupl cost extra order filter undesir tupl final extra cpu time involv spite extra approach result queri characterist distribut underli data order determin queri execut plan match cost model cost model method defin cost queri process total number page read index scan data fetch phase defin term extra data structur cost model bitmap bitmap inform distribut bit logic page space index tabl bit bitmap logic page tupl repres origin bitmap defin definit bitmap bit denot jbj logic page size byte block factor page number object bitmap respect denot bitmap bit defin denot bit figur depict comput bitmap bitmap bitmap divid segment consist segment segment bitmap correspond bit bitmap bit bitmap bit segment set term defin tabl bit bit bit bit segment bit bitmap bitmap figur transform notat descript bit vector fact tabl width fact tabl byte logic page size byte block factor number tupl page bitmap respect jbj number bit jtj cardin jbj jtj number bit bit vector tabl notat cost analysi analysi perform index scan phase bitmap access desir tupl data fetch phase total cost approach jbj term denot cost index scan denot cost data fetch phase approach bitmap evalu index scan phase data access total cost approach express jbj cost approach benefici perform approach jbj jbj jbj gener form analysi deriv oe jbj result bitmap oe result bitmap oe bitmap oe number variabl reduc retriev boolean function addit valu select predic simpli hand side inequ denot total number page gain principl index scan left hand side denot addit cost read extra data page approach data fetch phase inequ approach queri perform calcul term oe inequ bitmap oe read order reduc overhead term replac approxim statist model estim expect number page access expect number page access queri defin function select queri comput probabl model denot total number data page select block factor page number select tupl queri select term denot probabl page access subject expect number data page access process queri denot calcul pn ip approach select queri includ addit valu rang select number select tupl chang queri denot inequ estim jbj proven appendix includ issu approach includ optim problem formal defin cardin select rang attribut rang select predic select defin ratio cardin final result base tabl map problem classic color comput pn pn op cardin select rang cardin set op jsj jv select wg ae cardin select rang assum find prefer answer question avoid unnecessari attempt addit valu includ operand order make reduct reduct answer simpl test operand perform cardin select denot jv jv valu includ make reduct smallest integ jv jv reduct includ addit reason minimum number addit jv idea make neighbor cell figur show note condit satisfi condit impli exist reduct answer optim number bitmap scan queri process respect cardin select rang comput list tabl tabl comput cardin index attribut comput improv number bitmap extend cardin select rang extend cardin select rang number bitmap scan drop cardin optim select bitmap scan tabl optim number bitmap scan respect cardin select comput tabl base properti properti describ number bitmap scan process select dlog ffi cardin select rang largest ffi defin ae fl fl denot modulo note exist uncondit implic cardin select rang number bitmap scan tabl number quick estim extra cost approach extrem cardin select expand tabl cost index scan phase reduc tabl scan requir access attribut valu includ predic tabl check reduct lead determin effect effect lead reduct retriev function expand cardin select effect origin retriev function consist variabl optim solut perform optim solut find expand cardin select rang find common variabl retriev begin common variabl exist cost find profit gain algorithm find set common variabl retriev boolean function complex algorithm common select predic map function ng set boolean variabl retriev set common retriev function begin set initi arrai set fi fi denot denot denot encod fb return end discuss applic principl select oper finit rewritten discuss lose gener encod function preserv appli principl discuss dynam optim index preserv exist total order bitmap attribut domain principl appli quick review select evalu index section evalu predic figur bit vector repres decim digit read digit logic oper perform mask bit encod function call exist total order domain index total order exist encod attribut domain idea principl expand rang select execut tree occur enlarg rang select execut tree reduc figur show figur execut tree chang predic execut tree shown figur scale enlarg select rang impli scale reduct bitmap scan case reduc number bitmap scan case reduc number bitmap scan spite larger select rang inequ cost model determin select rang improv queri perform bitmap comput extra cost data fetch distribut underli data estim chang queri select assum attribut valu evenli distribut chang predic queri select predic queri select numer data type prefer expand select rang digit higher queri select higher extra cost data fetch phase space give discuss issu static dynam queri optim index encod bitmap index main contribut work static queri ffl classifi select type continu discret algorithm evalu discret select index time complex algorithm deriv ffl defin global time function index type point defin minimum point function point serv design criterion global respect type select ffl effect space constraint find global index studi ffl algorithm improv version improv techniqu ffl optim process time order binari diagram binari diagram tabular method literatur minim retriev boolean function dynam ffl principl applic index discuss ffl cost analyt approach probabilist defin select execut plan ffl algorithm defin quickli find set common variabl retriev boolean function set common variabl serv retriev function match approach futur work ffl defin heurist tool assist human expert defin encod ffl appli principl dynam queri find includ expand optim problem algorithm find set common variabl retriev boolean function guidelin quickli find expand select rang requir refer algorithm boolean function ieee tran symbol boolean manipul order acm comput ye bitmap index design sigmod ye bitmap index design cs univ gd analysi inform ubiquit acm comput june dj implement techniqu main memori acm sigmod complex problem graph repres technic queri evalu techniqu larg acm comput storag util gener overflow acta ej boolean bell system technic model architectur lectur note comput scienc intl workshop high perform transact septemb join bitmap join sigmod vol septemb improv queri perform variant sigmod wv problem simplifi truth american mathemat index olap bulletin technic data vol mar ld join process system larg main acm mc encod bitmap index data kl ps bitmap index high cardin attribut research ibm watson research variant bitmap index binari index definit tabl attribut binari attribut valu hb length data type bit binari set bit project posit bit encod bitmap index definit bitmap tabl ft tupl attribut denot domain fa encod bitmap set bitmap vector fb map set retriev boolean function dlog bitmap vector defin denot bit bit bit ff fa retriev function ff time complex algorithm proof equat number bitmap scan algorithm function number distinct digit compon algorithm distinguish bit vector scan time function algorithm defin count number digit compon import factor affect count process distribut digit rang assum number evenli distribut probabl occurr independ deriv time complex set number fv base hb rewritten hv high probabl number distinct digit fv equal summat product probabl expect number bit vector requir read queri process denot probabl number distinct digit fv equal comput transform problem problem combin repetit number ball repetit total kind combin chosen number distinct ball scenario ball number ball select ball ball repetit make total number select ball equal wai pick ball ball wai ball ball repetit probabl distinct ball select sum probabl proven rang expect number bitmap scan defin rang digit bit vector scan total number bitmap scan number bit expect number bitmap scan algorithm algorithm index bn number compon denot bit vector compon select predic op op bitmap tupl valu bitmap vector repres set tupl satisfi select op begin vn return return end probabl hit page denot total number data page select block factor page number select tupl term denot probabl page access subject defin mn mx data page page capac total slot collect mn wai distribut tupl mn slot comput probabl hit page access transform probabl distribut tupl page probabl comput page total mx total mx wai distribut tupl mx slot page includ page tupl subtract case mx denot solut space distribut tupl mx jsj mx denot set page js denot page js principl set number case page empti jsj js js js mx mx wai distribut tupl page page tupl probabl hit page distribut tupl mn mx prove sum probabl equal claim mn mi term hand side equal expand nm nm term column expect leftmost express reduc nm
HCI/612 4 adapt reusabl compon graef martin offic str abstract web ubiquit environ applic deliveri origin intend distribut system organ offer product servic web global point sale central enabl construct applic person user behavior analysi current technolog suffer web legaci log collabor filter adapt content user motiv result collabor filter describ construct approach base abstract concept servic support concept markup languag support seamless evolut applic introduct origin intend medium distribut inform world wide web introduct dynam web emerg platform softwar applic serv varieti import aspect distinguish applic web pc work station applic central softwar serv larg number user instal maintain singl locat drastic reduc cost durat deploi multipl version applic mean behavior user observ singl locat mae shardanand demonstr central acquir data user interest util provid user inform adapt prefer work present paper step dynam gener singl html page inform product recommend adapt complet applic individu custom fundament requir automat adapt applic flexibl evolut orient avail function featur independ build block compon document base implement model web granular kind compon provid mechan abstract implement compon normal web resourc repres featur corpor ident design applic web applic organ overcom problem approach web develop detail begin section contribut introduc servic higher level function abstract describ servic factori languag improv product maintain servic develop conclud section mechan automat adapt applic individu custom fourth section detail algorithm emploi identifi individu custom requir evalu work found end contribut discuss current state art individu adapt applic previou work problem directli address user person subject research year work center user interfac natur part applic visibl user work relat adapt web site solut divid adapt individu applic adapt applic present gener solut adapt behavior runtim user individu applic contrast produc specif user adapt individu user interfac user interfac design commun work adapt user interfac develop individu user interfac adapt user interfac wide discuss contribut adapt process limit analysi singl user behavior individu user interfac develop address adept tool includ user automat produc individu user interfac user interfac descript major limit user model defin manual ui develop adapt web site web commun work adapt web site approach project webwatch path predict approach techniqu close ti structur hypertext consist inform resourc link path predict forecast action user perform reach state notion state ti recent view document resourc complex state limit view resourc includ thing state product configur creat custom advanc order process make path predict complex exampl reli manual input user person interest techniqu collabor filter base user prefer user behavior past navig applic state approach inform user interest determin group user similar interest calcul result recommend resourc user base access resourc user group idea demonstr implement call user enter rate music artist data dynam gener music recommend user requir user activ provid inform commerci applic infer dislik custom observ action order product prove featur crucial user accept type adapt mechan applic highli competit environ internet mandatori avoid minim custom workload evolut adapt applic automat adapt applic level code primit feasibl current technolog find proper abstract compon applic build block reduc complex applic adapt process divid construct softwar suppli orient micro level provid function compon demand orient macro level function compon feder applic user demand kind code abstract ubiquit web document resourc satisfi requir term support granular express power relat overcom limit base approach program model top gener program model notion servic higher level build block encapsul function requir perform task placement order provid custom feedback contrast lower level system function servic perceiv specif technic knowledg servic compon form basi macro level applic adapt evolut support develop seamless evolut larg number servic introduc process servic product base domain specif languag servic factori macro level adapt applic special applic servic servic control servic present custom base automat analysi custom requir detail contribut program model base markup languag approach enabl perform softwar develop web platform independ evolut orient orient program model major product factor cycl softwar develop program model aim facilit develop artifact kind granular level abstract code fragment target languag model compon compon defin level code abstract compon defin relat aggreg special model specif base paradigm model mean instanti object inherit capabl compon simpli prototyp provid class definit model object instanc compon compon serv prototyp compon compon abstract serv prototyp type compon prototyp mechan implement code share object altern multipl refer compon share code share fundament effici mainten enabl modif local contrast suggest web model markup languag compon markup languag extend semant common web languag statement compon definit relat applic extend markup languag build familiar web develop markup languag avail tool syntax parser compon organ virtual compon implement tabl web server resourc compon repositori retriev compon access model compon map automat web implement model compil mechan independ specif platform languag program model gener migrat implement languag simultan support implement languag achiev concept polymorph compon encapsul target languag specif code servic function abstract typic function web base system enabl custom perform task product order inform retriev gener abstract concret possibl system offer custom state system set servic user channel item inform model servic provid system organ concret realiz sell offic chair servic definit servic power task orient abstract servic chang technic occur compar abstract compon servic base level abstract familiar custom domain expert organ interest knowledg requir servic found singl person small organiz unit custom activ easili perform set task implement task servic compon base applic adapt process custom access feder set compon applic granular tend bring level found occur level servic consist compon describ aspect content process detail descript servic compon found autom servic product due practic experi applic environ tend group servic differ limit wai account larg percentag total amount servic develop kind servic bridg gap technic sophist domain expert develop system mean introduc servic factori servic factori servic descript automat produc compon implement servic program model servic descript inform distinguish specif servic gener type servic servic order offic chair gener type product order servic possess numer specif properti describ configur user interfac dialog element servic descript special visual editor simplifi human readabl markup languag contrast code product tool mainten servic remain servic descript level model servic definit figur servic product implement model compon store servic compon framework compon compil htm asp html servic compon produc servic factori inherit exist compon form compon framework servic develop basic affect larger group servic inform servic chang singl set compon framework servic descript singl servic stai unaffect separ concern compon level system architectur increment evolut individu servic group servic process servic product summar figur adapt process web applic special kind servic function system offer user case servic tailor specif task call servic applic servic adapt process perform applic servic base custom requir data section describ data obtain process automat applic servic combin servic make import custom servic system present custom promin hidden custom cognit capac bandwidth system custom interact optim individu custom requir analysi determin individu custom basi provid adapt mechan kind web applic custom function present suit prefer style interact discuss select function form servic detail custom requir servic servic servic servic servic servic figur adapt custom requir servic select problem servic select servic servic servic servic present servic servic servic set servic set custom set custom action past obtain observ custom behavior action relat servic custom problem find set servic custom accur reflect servic custom futur assum equal exposur servic custom simpl approach problem calcul directli set servic relat past action custom singl user environ solut method determin servic regularli custom algorithm implement method refer conserv servic select algorithm servic custom futur deriv custom past action fortun case access multipl custom activ data emploi algorithm determin servic call social servic select algorithm observ past custom behavior appli algorithm servic select obtain set past custom action widespread approach gather inform user activ internet log made web server work custom action interest directli relat set url web server assum result action success subsequ process current applic state relev scenario assumpt couldnt due dynam url complex applic state forc explicitli log user action applic occur conserv servic select algorithm call algorithm servic select custom suggest ad custom determin servic past number success invoc servic custom past action count servic successfulli order complet inform item view long final custom heavili servic select result set social servic select algorithm approach algorithm base implicit exploit recurr pattern user behavior behavior pattern state peopl exhibit past behavior exert behavior futur recent expect futur behavior form complet behavior pattern simpl pattern person servic order telephon instal probabl servic bui accessori telephon exploit servic select explicit definit associ rule captur pattern requir explicit date knowledg exist behavior number complex grow exponenti number servic trivial case behavior relat number relat past user behavior predict user behavior approach base implicit exploit behavior pattern directli associ observ action rule indirectli deriv associ custom algorithm suggest consist custom profil custom gener profil base action relat custom set custom profil call determin user profil similar calcul similar relat pair custom profil target profil calcul target profil servic target profil determin servic select custom profil consist attribut vector attribut describ level usag servic custom appli map custom activ profil past action custom relat servic servic custom successfulli complet servic successfulli custom time determin similar custom profil appli distanc metric base squar differ profil set profil similar metric gener user profil predict custom profil develop equal servic base assumpt peopl behav similar past futur assum custom partial complet pattern custom profil show high similar compar profil execut remain part pattern optim comput target profil calcul weight averag custom profil weight function similar calcul previou step algorithm perform reason decid calcul target profil averag vector profil similar consid custom profil significantli attribut avoid effect profil converg stabil ident profil initi profil gener target profil comput differenti profil relat profil attribut custom action custom action servic determin servic select result set servic custom chang profil similar target profil qualiti predict conduct simpl evalu qualiti predict made algorithm basi algorithm set histori data past activ user ii system compar predict activ perform user complet set exist servic equal user user subject applic experi adapt stage compar number select servic week appli select conserv servic select algorithm social servic select algorithm combin algorithm contribut result set appli algorithm predict servic custom random combin figur qualiti predict figur show result note number tabl interpret rel absolut valu depend actual type number servic present behavior pattern produc combin algorithm deliv result applic singl algorithm runtim complex conserv servic select algorithm complex low complex custom scale linear number servic social servic select prove select servic data custom consid algorithm complex custom basic evalu approach present paper implement complet servic orient system ii develop offic karlsruh joint project packard system product hp europ regular custom ii design evolv open system provid servic intern custom hp system offer hundr servic area hardwar softwar virtual offic servic servic develop decentr manner peopl moder technic skill automat integr system ii highli flexibl adapt custom base past activ user user individu applic experi figur show screenshot ii automat adapt specif custom applic ii servic select combin servic select algorithm previou section present servic adapt custom habit frequent servic displai promin execut automat start web applic automat access current custom frequent servic specif servic retriev displai inform recent evolut custom perceiv person ii applic custom welcom ii servic displai stock report compani summari figur adapt ii paper platform base abstract platform develop model web base model introduc servic factori enhanc product web servic develop technic sophist domain expert enabl busi process web applic servic mechan automat analysi individu custom requir enabl automat adapt applic individu custom compon implement solut problem build block individu custom point view applic perform automat base chang behavior custom evolut servic due busi logic separ process central logic close relat technolog encapsul separ compon achiev clear separ concern relat major sourc chang field custom technolog busi process proof concept successfulli appli approach mission critic commerc environ result ii encourag issu adapt finer granular optim individu task perform custom issu detect custom level user addit requir term system function refer amazon learn world wide aaai spring pp inform cern softwar engin approach web site intern workshop softwar specif design japan adapt adapt microsoft usabl usa web engin web servic annual hawaii intern confer system scienc island usa repositori facilit base web intern workshop web engin intern web confer canada enabl technolog web intern world wide web confer canada gener feder busi applic system intern workshop engin feder inform system ed germani support system web engin comput network isdn system special issu intl www santa usa advanc design environ prototyp task human factor comput system pp associ rule interv acm sigmod intern confer manag pp approach develop interact softwar rostock inform bericht adapt user interfac principl social inform algorithm autom human factor comput system scienc human adapt environ user interfac intern workshop intellig user interfac pp power oopsla pp
IR/613 5 code text classif rayid ghani center autom learn school comput carnegi mellon pa abstract paper explor detail error correct output code learn text classifi show accuraci naiv classifi text classif task significantli improv advantag properti code explor kind random domain code give result ecoc method scale larg data set larg number class experi data set show reduct classif error tradit naiv classifi compar empir result result find close introduct text classif problem group text document class categori defin classif categor document fix number predefin class singl document belong class enorm amount textual data result algorithm automat text classif appli output code method problem text classif shown util approach classif task nettalk letter work refin ecoc text classif usual approach classif learn label train set present learn algorithm algorithm train set construct probabilist model map document class class assign uniqu binari string length refer string codeword train classifi predict bit string predict class codeword closest codeword produc classifi distanc metric experi ham distanc count number bit codeword differ process map output string nearest codeword ident decod step code code applic classif problem understood analog bakiri text classif type commun problem correct categori transmit medium channel channel consist train learn algorithm due error introduc finit train poor choic input featur limit invalid assumpt made learn class inform distort code transmit bit separ separ run system recov error code correct error show ecoc improv classif accuraci naiv classifi give explan improv occur improv accuraci cost train time linear length code type code give result show code construct algebra code theori code choic classif task ecoc method code code correct error transmit data commun task idea code add redund data transmit error occur due data correctli receiv end kei differ code commun task machin learn improv accuraci observ industri sector dataset experi section commun task requir row code term ham classif task requir column reason row codeword class maxim column separ function learn learner bit uncorrel error bit independ error made learner bit correl error bit result error multipl bit code correct error independ error made bit codeword form basi theori code clear column separ point unnecessari wai make error bit independ column disjoint set featur learn bit codeword independ denot concept util set similar cotrain algorithm blum mitchel case classifi web train data hyperlink page page code separ term column ham distanc independ error data independ train phase creat binari matrix class assign row train base classifi learn binari function test phase appli classifi test combin predict form binari string length classifi class nearest codeword tabl ecoc algorithm number class relat work varieti work area text classif output code attempt made combin effort util advantag ecoc offer area text classif text classif work text classif involv statist approach tfidf naiv algorithm repres document vector featur train calcul frequenc probabl featur train document belong class featur singl word case phrase approach neural network pederson nearest neighbor classifi algorithm damerau tree induct learn techniqu text classif output code recent number text classif bag work vote classifi output code form vote multipl classifi schapir al describ classifi vote class class receiv vote winner work convert learn problem larg number learn problem learn algorithm handl learn algorithm appli learn problem thought length codeword bit codeword classifi code bakiri tree neural network letter nettalk data set irvin repositori machin learn artifici neural function implement output unit singl network separ tree bit posit output code shown ecoc approach improv perform learn algorithm provid improv small sampl size berger appli ecoc approach text classif report result dataset encourag give theoret evid random code work differ berger detail studi type code empir evid code random code figur test phase ecoc algorithm problem domain describ data set experi industri sector dataset industri sector base data made market guid consist compani web page classifi hierarchi industri sector data publicli hierarchi account experi flatten version dataset dataset total document divid class small fraction document belong multipl class experi remov document token skip mime html standard perform stem procedur mccallum al slightli modifi version data set remov token occur corpu million word vocabulari size approach experi base classifi learn bit codeword naiv classifi implement rainbow develop andrew mccallum featur select word highest mutual inform gain code section construct method algebra code theori gener code ham distanc row inform code found code literatur peterson code document belong class remov dataset affect result experi onlin result section describ experi perform ecoc explan result compar result perform naiv commonli algorithm text classif experi classif accuraci evalu measur paper perform measur graph point recal goal classif algorithm achiev low misclassif rate test set accuraci measur perform naiv classifi learn individu function bit code class uniqu binari code length classifi test test individu bit classifi combin output compar code class test instanc assign class nearest codeword ti broken randomli code improv classif tabl show perform ecoc approach singl naiv classifi industri sector dataset repeat random split vocabulari size experi word featur select perform select word highest mutual inform gain class observ ecoc reduc classif error naiv classifi lowest dataset mccallum al shrinkag techniqu slightli modifi version dataset hierarch achiev classif accuraci compar ecoc tabl classif accuraci code industri sector dataset vocabulari size method trial trial trial trial nave classifi ecoc closest codeword length code affect classif tabl show classif accuraci industri sector dataset code length observ length code classif accuraci accuraci directli proport length code code accuraci start level observ tabl flatten accuraci curv code longer corrobor result report berger accuraci code length explain fact length properti enhanc good code larg row column separ individu codeword separ codeword larg ham distanc column function learn separ learn function individu classifi make mistak multipl bit hinder code correct tabl averag classif accuraci random split industri sector dataset vocabulari size method classif accuraci nave classifi ecoc ecoc ecoc figur perform ecoc vari number train exampl minimum ham distanc code code code individu bit classifi make fewer result codeword closer correct codeword correctli decod longer code separ individu codeword larger minimum ham distanc improv abil tabl length code reduc classif error assum tabl code classif accuraci case error made individu bit classifi complet independ case error depend lot overlap data featur set learn binari function code length classif accuraci start level number train exampl affect figur show result experi vari number train exampl sampl split result averag produc graph ecoc outperform naiv classifi time previou result classif accuraci code length hold longer code give perform experi tabl show averag classif accuraci individu binari classifi sampl size number train show improv perform expect improv present ecoc observ figur show percent reduct error ecoc train size tabl averag classif accuraci individu bit classifi random split industri sector dataset vocabulari size standard deviat small train exampl class averag classif accuraci individu bit classifi train exampl class ecoc ecoc ecoc figur percent error vari number train exampl percent reduct error vari number train exampl suggest ecoc good perform reduct error size train set good algorithm train data intuit analysi ecoc suggest train exampl improv perform improv perform individu bit classifi tabl improv accuraci ecoc abil depend code length ham accuraci individu bit compar accuraci singl learn classifi problem individu classifi result suggest improv perform roughli rate train exampl percentag reduct error due ecoc depend length code fact domain train data perform error correct properti perform codeword previou result observ ecoc power accuraci collect learner central featur approach learn algorithm code emploi case learn algorithm domain depend code good code larg column row separ discuss method code recent publish paper ecoc approach construct code standard code theori method construct random code construct code captur repres featur dataset code theori algebra code theori wai construct code good properti code earlier experi report paper binari code defin construct matrix entri belong field order convert matrix binari code detail code found primari reason code fix term translat classifi give wrong classifi correct class code separ row mention separ column error made classifi learn bit independ column separ code exist code code provid case calcul maximum averag column separ code experi found separ larg reason code base code theori comput effici wai decod linear search codeword case random code concern dataset consist thousand class random code berger argu random code gener pick entri matrix random give theoret result bound column row separ random code show asymptot length code larg probabl code separ approach argu result hold long code practic comput bottleneck prefer short code column row separ compar properti random code construct code train exampl class ecoc ecoc ecoc gener random code calcul maximum averag row column separ found fix length code outperform random code significantli similarli random code classifi industri sector dataset found result code earlier experi ecoc method random code error rate greater algebra code code type code give good classif result split set class disjoint set priori data account section explor altern method base binari function learn classifi inspir data hand logic function partit class group similar class easier learn random function class world expect function combin footbal class polit world polit class easier learn group polit test idea industri sector dataset compar result code earlier construct code binari problem group relat econom sector code give row separ append bit code result code tabl maximum ham distanc inform row column code hybrid code codeword classif accuraci industri sector dataset code min row hd max row hd min col hd max col hd accuraci hybrid expect bit code perform code code bit construct data hand easier learn classifi tabl accuraci code observ code perform slightli classifi learn accuraci bit ad accuraci expect bit easier learn odd thing bit binari partit induc bit dont equal number group bit class document class equal number column result creat class problem data belong class improv individu accuraci case approach bit column column distinguish class rest expect individu classifi perform extrem accuraci poor ham distanc codeword obviou ad bit code row ham distanc reduc column separ result code tabl show ham distanc inform code row hd slightli column hd significantli reduc creat column lot vice individu accuraci bit reduc minimum ham distanc code describ attempt combin approach outperform approach discuss result previou conclud behavior advantag ecoc approach text tabl averag accuraci individu classifi bit code variat accuraci small train valu averag probabl bit classifi correctli calcul minimum ham distanc code ecoc approach model binomi distribut length code probabl bit classifi incorrectli probabl instanc classifi correctli follow binomi distribut tabl show result calcul min minimum ham distanc code code minimum distanc correct max maximum number error code correct probabl bit classifi classifi correctli obtain result theoret accuraci ecoc method calcul binomi distribut sampl calcul row tabl min max classifi give wrong correct classif obtain probabl classifi classifi incorrectli classifi classifi classifi classifi classifi classifi suggest expect accuraci classifi figur expect accuraci close actual result experi tabl calcul theoret accuraci ecoc minimum row ham distanc maximum number error code correct bit min max min averag accuraci bit theoret accuraci figur comparison theoret accuraci result ecoc code length number train exampl futur work paper examin output code improv text classif demonstr code reduc text classif error reduct error naiv classifi train data larg train method train data difficult gather analyz ecoc approach compar vote method boost bag nave classifi open problem provid valuabl insight extens approach work experi type code analyz perform ecoc process experi automat construct code perform random algebra method start random code column worst classif accuraci modifi column randomli minimum ham distanc code reduc accuraci bit repeat accuraci preset threshold construct code cluster class creat binari partit code class cluster end binari partit creat binari function easier learn arbitrari accuraci combin ecoc approach algorithm util disjoint featur set provid independ bit shorter code improv classif accuraci acknowledg author tom mitchel mark craven numer suggest discuss work research fund part fund refer weiss autom learn text categor problem seventeenth annual confer output code text classif workshop machin learn inform filter class binari group code inform length code theoret singer learn method text categor nineteenth annual intern acm sigir confer research develop inform page learn extract symbol knowledg world wide web fifteenth nation confer artifici intellig solv multiclass learn problem output code journal artifici intellig effici boost algorithm combin prefer fifteenth intern confer machin learn code annual confer comput learn theori code theori oxford press code output code correct bia varianc intern confer machin learn probabl estim output code iast intern artifici intellig soft canada comparison learn algorithm text categor annual symposium document analysi inform retriev train algorithm linear text classifi nineteenth annual intern acm sigir confer research develop inform page decomposit dichotomi fourteenth intern confer machin learn improv text classif shrinkag hierarchi class fifteenth intern confer machin learn machin learn mcgraw hill publish turn yahoo automat classifi thirteenth european confer artifici intellig text symbol approach annual symposium document analysi inform retriev learn bia issu text categor problem technic report universit pari vi uci repositori machin learn data technic irvin jr code mit ma introduct theori code john wilei son program empir learn morgan san ca tree probabilist classifi fourth intern confer machin learn develop automat text retriev system multiclass text categor unpublish boost explan effect vote method annal statist neural network approach topic spot fourth annual symposium document analysi inform retriev map method text categor inform retriev acm transact inform page
Agents/614 1 mobil agent implement flexibl network manag strategi antonio dipartimento di di itali istituto di informatica di catania vial catania itali abstract due comput commun system requir increasingli sophist manag adopt order adequ level perform reliabl central paradigm adopt snmp network manag quick network pose problem central model mobil agent repres challeng approach provid advanc network manag due possibl easili implement decentr activ monitor system paper discuss advantag technolog identifi refer scenario mobil agent repres approach describ prototyp implement base mobil agent platform call map show advantag featur network mobil java introduct grow complex comput network requir sophist manag techniqu properli detect control behaviour system resourc repres main function network manag system provid approach adopt main standard manag data store maintain element manag manag applic run central data transfer provid manag system manag network requir amount troubl network manag action requir year experienc progress effect adopt mobil code possibl code migrat hardwar softwar architectur lot work gener feel mobil softwar agent repres technolog cope distribut system user mobil commonli technolog risk adopt real matter fashion nowadai present act agent field concept softwar agent behav behalf user establish network manag snmp view static code adopt resid network equip period provid data statu order central network manag station execut manag strategi exploit technolog base mobil order extend network manag architectur move portion node data resid manag agent monitor state perform simpl manag function local node agent find irregular oper commun mechan trigger activ recoveri strategi strategi consist system rout manag avoid transfer larg amount data remot node central station inform transfer central station network manag oper agent static resid remot devic move node replac equip function envisag time instal manag procedur maintain procedur migrat central node function make system obtain flexibl manag applic organ mobil manag network longer fix posit order demonstr real applic introduc devot great effort implement network manag architectur base mobil softwar agent system implement map agent platform develop manag mobil complet develop java catania platform user basic tool creation agent base applic enabl reactiv local stop make commun migrat java independ hardwar softwar enabl develop platform oper heterogen environ map map flexibl program environ tailor user issu address latest version ad conform masif standard specif case kind agent messeng verifi interact perform complex manag action creat complet manag show effect distribut manag easili creat adopt mobil agent paradigm rest paper organ section present basic concept tradit network manag outlin main limit section discuss main model distribut manag creat overcom outlin main strength approach base mobil code section short descript platform agent function present case show effect approach section present futur hint research tradit system network manag current network manag system adopt central paradigm manag applic period access data collect set softwar modul network protocol simpl network manag protocol ietf standard protocol manag ip common manag inform protocol iso area network telecommun architectur similar differ oper basic compon system network manag ffl manag station manag station ffl network node comput storag equip interconnect modul call agent run node monitor statu collect data process ffl manag transfer manag inform manag station manag applic execut nm network administr monitor control network element devic termin monitor control access manag inform manag inform consid collect manag agent relat mobil agent discuss avoid refer kind agent term store manag inform base set relat object defin mib modul modul subset standard notat osi abstract syntax notat call structur manag inform infrastructur entiti provid inform standard interfac nm interact act client indic network agent inform network devic set snmp agent manag network nm transport level transport level element network instrument poll mib hub figur snmp architectur applic manag execut nm simpl commun request variabl mib perform manag action local data network manag protocol primit exchang manag inform manag station access mib variabl nm place low level set primit snmp basic type oper set set read oper continu examin subsequ variabl mib limit central paradigm snmp central paradigm adopt snmp network manag quick network pose problem central model comput power network node manag made function manag node distribut mode central gener applic limit distribut requir frequent poll mib limit amount inform typic monitor relat displai mib variabl state interfac state link involv queri displai limit number mib suitabl central manag end applic requir frequent poll mib perform comput larg amount inform comput function function level frequent detect variat high number mib variabl monitor control close devic drawback central approach evid period network manag action import manag oper requir overcom congest traffic close congest part network distribut manag disadvantag total central architectur admit organ introduc form decentr version mechan notif asynchron event send trap messag result specif event occur basic ietf maintain agent simpl event agent commun nm trap typic exampl includ chang state compon activ vice task notif manag action perform made central nm introduc decentr concept proxi lead structur hierarch manag proxi agent set nm send request interact devic wide due implement critic made secur model introduc approach decentr ietf introduct assum exist devic call task provid indic network traffic specif state devic approach orient analysi case ordinari benefit concern semant compress preprocess collect send nm approach base mobil code approach base mobil code network manag overcom limit current central manag system approach base idea logic data produc network devic period transfer central manag station manag applic move network perform reduc workload manag station overhead network idea express develop system base mobil code idea manag present show architectur manag station send command remot devic limit request mib deleg remot agent actual execut remot devic includ elast process runtim provid servic dynam extend present devic approach base mobil code includ manag deleg field applic flexibl paragraph examin manag function advantag adopt specif scheme base mobil code code demand paradigm base code demand improv flexibl provid network manag system structur mib snmp approach type event notifi central codifi modifi manag event defin act local involv nm maintain manag agent simpl project restrict develop due limit comput capabl network devic true year ago devic power higher amount memori static codifi manag function agent function specif natur request devic devic seldom request devic clear static function agent lead wast resourc approach base code demand flexibl maintain agent simpl small time function download code server dynam execut softwar updat request agent obtain approach remot evalu remot evalu deal issu bandwidth wast occur central system oper tradit matter process perform data move agent process mechan remot action perform develop remot execut gener traffic network initi send code typic comput health function health function express consist elementari manag variabl variabl measur devic control tradit system comput function perform transfer variabl involv nm poll oper regular time comput site higher number variabl involv frequenc function larger amount bandwidth occupi network comput load produc function codifi conveni size agent ineffici system due fact gener function seldom technolog base remot comput function directli code perform comput nm dynam execut approach obtain call compress gener manag network interest singl mib aggreg valu develop system manag write manag function invok remot execut specif mobil agent approach base mobil agent add benefit obtain remot evalu case action devic start nm case mobil abil store state movement develop applic agent move devic perform manag function requir agent deleg task decid migrat current reduc interact make process distribut reduc interact nm advantag refer situat nm manag lan link low bandwidth link tradit requir exchang messag nm remot devic singl delai execut manag mobil oper develop model mobil remot run agent size neg assum bandwidth network manag map map overview section introduc agent system map platform develop manag mobil agent primit develop total portabl hardwar softwar architectur java languag program exploit potenti complet languag featur introduc latest map version complianc masif agent system standard standard agent introduc omg agent system system architectur implement improv research area mobil basic requir agent platform function present agent differ architectur implement make interact difficult prevent agent technolog applic masif standard introduc order solv problem interact defin set basic interfac system order commun interact interfac masif concern transfer execut method locat identifi agent agent central compon figur show basic entiti standard relat platform figur masif framework complianc masif standard enabl agent system interact corba system access legaci servic present network flexibl provid manag system possibl integr manag mechan base corba ad peculiar aspect mobil code mention secur crucial aspect agent system aspect import field applic interest paper manag network requir high level set crucial paramet network devic damag function user authent adequ access control mechan present issu dealt map develop adequ model secur adapt specif issu model assur high level protect agent host protect attack unsaf agent run host network damag gener avoid execut agent damag local assur possibl identifi entiti trigger produc agent secur model develop map consid issu authent order protect hand host hand agent agent attack network issu find agent action make distinct author agent code user trigger execut call secur fix node rule condit agent access authent entiti perform level secur commun agent host techniqu adopt make public kei sign encrypt provid java figur graphic interfac manag map aspect deal section manag platform function provid map system manag graphic interfac figur interfac verifi presenc state agent execut local remot server interfac trigger execut agent present independ agent code integr singl develop environ paradigm remot execut code demand graphic interfac includ possibl queri registr system implement interfac agent agent system regist region manag applic section show servic map develop applic perform basic manag oper network implement agent prove effect approach base mobil code solv issu develop agent deal ffl collect inform state network ffl network devic monitor health function defin user figur graphic interfac applic applic actual manag agent trigger structur agent graphic interfac agent figur select agent control list activ agent evalu inform collect agent finish task type agent dialog box view typic paramet kind agent structur applic agent obtain independ nm physic locat manag applic activ node map server manag consol nm creation platform complet integr compat snmp world system integr class creat advent implement snmp stack opportun interact node network standard mib variabl time develop framework monitor quantiti defin defin user agent manag develop basic type mobil agent ffl browser agent ffl daemon agent ffl messeng agent ffl verifi agent perform simpl combin action perform complex action manag creat complet manag show idea present easili implement agent system describ detail function type agent carri browser agent browser agent collect mib variabl set node user variabl collect server visit select dialog box applic agent reach node open snmp local commun build mib variabl wait repli snmp save data obtain intern structur node reach repeat procedur mention return platform result research shown agent realiz function extend mib browser ordinari mib activ connect specif view content mib figur graphic interfac browser agent send snmp request node question variabl browser request move node interact local report global result initi station daemon agent daemon agent monitor defin user start function comput node network comput provid agent move node record higher fix threshold notif messag server agent depart figur show basic function mechan daemon agent implement mean mechan gener event nm notifi freeli flexibl set user remot node mobil messeng agent agent directli interact snmp daemon present node advent messeng migrat node interact agent collect specif inform produc configur select agent contact server number time agent contact agent applic health function health function migrat execut remot node warn threshold figur comput custom health function mean daemon agent messeng agent perform oper higher abstract level mere retriev mib variabl daemon agent perform comput function node messeng collect obtain gener descript state network schemat behaviour messeng agent graphic shown figur notic model agent involv architectur function comput depend specif environ chang obtain inform network show simpl step insert monitor function applic health function health function agent node interact local agent execut node figur messeng interact system agent verifi agent verifi agent perform actual network manag action task collect import oper network remot network devic start host visit node select comput function evalu presenc specif properti system visit verif softwar space disk fix verif log verifi agent report list node correspond properti ad function system agent refer function comput node system develop add function easili respect simpl function insert system point view abstract class function sort templat build function definit abstract public class function implement serializ abstract public void abstract public vector user write monitor extend implement method call start calc perform actual user access mib variabl class node order function manag class begin fun string class descript creat function case creat abstract method call implement descript class begin follow simpl rule configur dialog box distinguish function descript remain class present system opportun store class node map server activ agent dynam load class present agent platform case studi paper show innov approach system network manag explicit manag refer specif mib question depend environ topolog interconnect technolog network administr element constantli control show typic manag task dealt develop agent framework network manag gener carri specif control subset devic element control carri determin static type dynam function depend number na mib calcul select element function exce specif grow rate function depend valu time higher manag decid carri control action algorithm manag decid interven depend specif scope paper task repres network element ne satisfi properti valu mib variabl calcul execut ffl ne repres gener network ffl gener properti ne static type type network dynam free space version softwar ffl health function depend na mib ffl threshold ffl manag execut procedur tradit system lead massiv network function calcul valu mib variabl involv retriev continu poll oper mechan trap present snmp threshold error function present standard mib comput type function rest nm comput traffic gener network singl function ne na ffl ne number element network poll carri ffl na number mib variabl calcul ffl averag size snmp queri retriev mib ffl variabl sampl depend type function tradeoff valu calcul avoid satur network excess frequent poll formula request inform execut complex na prompt manag oper poll traffic reach valu mobil agent elimin portion traffic procedur implement function execut depend local traffic gener network consist code agent migrat remot node begin task code outlin cach mechan present map agent run specif code longer retransmit improv perform comparison central model calcul result messag posit start execut notif manag node itinerari interact local calcul calcul figur interact agent system typic manag task task examin typic devic local inform execut action fault detect function verifi agent approach show flexibl featur manag task consult function collect inform continu action inform decid action point manag opportun decid start filter inform interact agent system task implement repres figur paper present system network manag base mobil agent technolog discuss main benefit deriv adopt compar evalu applic program base mobil code map agent develop agent perform basic network manag includ gener mib browser possibl custom network function monitor interest aspect approach futur develop work concern definit complex health agent adapt migrat dynam type task request refer snmp tool gp picco exploit code mobil decentr flexibl network manag int workshop mobil agent april pagurek mobil agent network manag ieee commun septemb mobil agent enabl technolog activ intellig network implement ieee agent mobil comput ieee person octob gener gmd ibm mobil agent system facil novemb case al simpl network manag protocol rfc wm jd swarup secur mobil issu requir proc nation inform system secur conf gp vigna understand code mobil ieee transact softwar goldszmidt distribut system manag ifip intern symposium integr network goldszmidt distribut manag deleg proc intern confer distribut comput decentr control intellig network manag proc intern symposium integr network li gong java present futur ieee ms jc hold mobil agent secur ieee commun page juli rose manag inform base network manag rfc phan mobil softwar overview ieee commun juli advanc network manag function mobil softwar agent intern workshop intellig agent telecommun applic stockholm august vita design implement mobil agent platform journal system architectur publish vita distribut network manag architectur int confer comput scienc informat durham march marshal rose network manag framework ifip intern symposium integr network mobil agent issu direct volum march stall practic guid standard addison tj essenti system integr distribut object john wilei remot network monitor manag inform base rfc
Agents/615 1 multiag system support network commun takeshi makoto sen yoshida ntt commun scienc kyoto japan internet continu social activ net common system exist support commun net system limit pose problem support forthcom network commun resolv develop multiag system assist social activ network commun call system major issu support network commun issu bring peopl link peopl share similar interest search engin directori servic commun partial sophist system issu resolv support smooth commun includ support visual share common context identifi flow lack context failur identifi flow discuss happen network commun newcom possibl difficulti understand commun issu find relationship firefli view typic exampl term includ aspect depth knowledg attitud mutual knowledg manner commun peopl includ identifi commun individu network commun amorph compar organ compani relationship network hidden unknown difficulti find person peopl suitabl current concern issu exist real problem obviou network commun constrain restrict time place provid commun environ suffici resolv problem activ support agent base interact softwar human softwar import area multiag applic accept version definit version publish cacm march found acm digit librari copyright associ comput permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copyright compon work acm honor abstract credit permit copi post redistribut requir prior specif permiss fee request permiss public acm fax commun commun commun commun agent commun agent commun agent person unit person unit person unit person unit person unit person unit person unit user join user leav figur gener architectur multiag system multiag system characterist specif network make multiag architectur attract characterist particip network commun wide distribut number potenti particip larg monolith system distribut system person agent particip cooper characterist commun dynam natur activ membership chang addit role individu commun chang aspect exist fix organ clear goal network commun characterist contrast area peopl organ work object defin characterist individu member preserv commun member member share common interest gener peopl member commun time depend interest support person adapt individu object interest adapt variat interest activ individu base observ gener architectur view commun collect person commun set relat person unit consist user person agent person agent user gather exchang visual recommend user make person wai agent cooper act user central figur commun agent function provid share context commun act mediat inform commun peopl architectur user person agent commun enabl commun spread net person agent domain specif inform retriev agent special gener interfac agent navig read adapt multipl aspect user user interest achiev chang system dynam autonom domain specif agent clone produc agent make addit commun channel user interest chang architectur enabl user individu user belong commun user multipl domainspecif agent commun system flexibl adapt adapt dynam natur commun commun chang time system develop prototyp applic call system consist person agent user commun agent person agent function acquir user profil visual potenti commun user commun agent function collect user profil maintain inform potenti commun request person commun agent comput potenti commun owner person send data potenti commun relev person agent person agent locat user figur person agent distanc user reflect relev common owner person agent locat center relev user calcul commun agent user profil data profil obtain user archiv mail list keyword extract inform user publish web inform retriev techniqu system acquir profil data automat url user person agent adjust weight viewpoint common interest consist multipl aspect includ aspect date domain voluntari activ user weight viewpoint person agent automat locat user weight cosin person view cord user person agent learn weight user feedback user find person locat inappropri posit close user fact person agent agent modifi weight keyword perman adjust relev person user peopl potenti commun similar interest user multicast messag multicast area basic distanc adjust user user exchang viewpoint commun agent viewpoint receiv user incorpor weight function form viewpoint exchang make individu interest lead common interest share user system enabl user find potenti commun simul possibl potenti form commun develop prototyp applic visual structur call system consist person agent user commun total written java person agent displai structur discuss user interest commun agent classifi messag criteria share commun main dimens chosen express structur import integr person messag repres icon import repres shade person person icon figur messag topic messag locat similar topic locat nearbi topic messag writer messag keyword plan multipl keyword extract keyword automat relev topic calcul commun agent person agent decid locat topic relev scale method locat recalcul messag topic arriv import icon messag smaller import import function interest topic messag interest topic import function adjust user reput messag calcul commun agent collabor filter techniqu user combin aspect chang inform wai user decid join guess question relat topic format person topic user grasp relat topic discuss topic inform topic import knowledg user learn current context discuss anticip join discuss user understand transit topic inform person import understand user causal relat messag user obtain share context commun smooth commun reveal relat find role person futur direct concept network commun support open area applic multiag framework area includ ffl model behavior ffl structur ffl enabl flexibl commun ffl learn collabor user ffl mediat public inform space person includ balanc privaci open opportun technic challeng implement multiag system make coalit agent challeng human agent effect collabor system refer ln referr system matchmak practic applic pp practic applic pp referr combin social network collabor filter commun acm present featur conferenc system www commun magazin commun social meet system visual structur discuss intellig electron system pp support casual meet network pp commun visual commun format person digit assist workshop social interact san pp commun visual agent practic applic pp
Agents/616 1 updat mental state commun af giorgini serafini itali abstract order perform effect commun agent effect utter mental state paper investig updat mental state hearer agent consequ utter perform speaker agent agent commun languag set criteria bind speaker mental state utter sentenc basi give abduct procedur hearer adopt partial recogn speaker mental state led specif utter procedur adopt hearer updat mental state imag speaker mental state introduct commun agent cooper coordin activ simpli avoid interf agent design knowledg abil perspect exchang inform improv social activ real applic commun limit resourc low ratio import decid send agent expect benefit cost commun bdi agent agent desir mental state desir intent agent desir intent behavior agent strongli depend mental state commun main road agent affect behavior agent exchang inform environ desir intent commun activ speaker reason desir intent gener regard utter consequ speaker mental provok desir influenc hearer mental state posit gener independ class speech act declar utter effect mental natur hearer recogn speaker mental state form backward reason kind content receiv commun hypothet mental state origin develop logic theori partial predict dialogu main goal paper provid method hearer adopt recogn speaker mental state basi utter formal mental state base theori context correl mental state agent base theori speech act formal oper perform hearer updat mental state receipt messag novelti paper stand fact abduct theori mental state relat theori semant agent commun languag paper structur section present context formal agent mental state section describ simpl scenario explanatori paper section illustr exploit theori speech act correl speaker mental state utter section recal konolig definit causal theori extend multipl context defin basic oper mental abduct abduct contract abduct section present abduct method updat hearer imag speaker mental state section present relat work draw mental state agent mental state regard mental state structur base primit mental belief desir proposit context formal agent mental state context defin set formula close set infer rule set agent agent set belief intent repres context formula context pair repres fact believ formula context repres fact intent bring gener belief intent express languag context support sake present simpler case languag belief intent coincid call languag formula repres environ agent part formula express fact agent belief intent atom agent atom proposit intuit mean agent believ atom proposit intuit mean agent intend bring formula form call bdi atom reason capabl agent belief intent repres context set infer rule rb exampl reason capabl set logic infer rule reason capabl gener reason intent repres agent desir true believ true mean agent act order chang extern world agent mental state reach desir state affair open critic question scope dissert distinguish continu tradit call defin machineri special infer rule bdi atom sake paper infer machineri set rule proposit logic bdi atom consid atom complet independ belief ascrib agent reason believ believ believ relat bdi atom depend reason capabl ascrib reason capabl ascrib agent explicitli model mean mental call imag js mental state belief belief intent repres context formal intent js belief context belief js belief agent formal pair context iter case finit amount iter intuit interpret formula depend context formula context denot express fact agent believ formula context denot express fact believ believ intend formula context repres fact formula context formula context mean effect context consid isol set theorem context affect set theorem context interact context formal bridg rule bridg rule context mental state context imag mental state call reflect reflect reflect reflect combin reflect agent convert formula simpler format elimin order perform reason imag js mental state reflect lift mental result reason reason pattern prove relat bdi atom prove context perform belief intent agent independ relat belief intent agent repres bridg rule context belief intent bridg rain bring umbrella formal fact agent believ intend bring umbrella isi bs ih fig context agent interest formal effect utter perform speaker belief intent agent denot speaker focu effect utter hearer mental state context hearer belief intent context hearer belief intent speaker belief intent context hearer belief intent speaker belief intent hearer belief intent nest extend indefinit detail level depict figur circl repres context arrow repres bridg suffici illustr abduct method infer mental state commun act logic system formal reason set context connect bridg rule call system give formal definit multi context appli gener definit special case mc system context shown figur connect bridg rule set bridg rule deduct mc tree wff start finit number formula axiom possibl belong distinct appli finit number infer bridg rule wff deriv set axiom ax mc ax deduct end axiom ax detail descript proof theori mc refer reader set axiom context ax mental state agent defin pair set hs belief hs intent deriv mc symbol hb analog hs imag mental state set hs belief belief set hs belief intent symbol hb gener defin hb stand ss imag hs imag ss imag hs imag ss mental state definit mc hearer mental state hearer imag mental state complet determin set axiom ax effect receipt messag mental state imag mental repres suitabl chang set axiom ax set axiom ax context defin set ax provid system call system stress fact multipl distinct languag fig initi hs mental state definit updat mental state imag mental state ms work mc system context shown figur connect bridg rule bridg temp higher condit hearer believ temperatur higher intent switch condit repres figur belief repres axiom context temp higher temp higher believ temperatur higher temperatur higher condit higher condit temperatur lower higher condit stop work believ temperatur higher condit intend stop work ascrib belief repres axiom context temp higher condit temperatur higher set axiom ax fb infer believ condit adopt intent switch condit deduct mc shown figur bh temp higher bh higher bh bh temp higher ih condit fig deduct ih condit bh higher temp higher axiom temp higher model speech act vision speech act treat action repres offer intuit correl speaker mental state utter model speech act precondit illustr idea simplifi version inform oper prototyp member assert speech act class theori speech gener defin action main effect hearer mental state hearer believ speaker believ proposit content prerequisit speaker believ speech act precondit main effect structur simpl oper close relat cohen perrault larger rang effect effect inform oper cohen perrault main effect complet effect speech act hearer mental state speaker control part effect result kind abduct reason perform hearer receiv commun actual mental state gener speaker imag hearer mental precondit inform oper includ speaker goal perform speech act speaker actual intent lead execut speech ascrib hearer kind abduct reason basic assumpt paper causal relationship agent mental state utter sentenc plan fact intent bring mental state formula differ believ intend doesnt mental believ perform inform mental state believ perform inform precondit hold perform speech contextu abduct introduc abduct briefli recal main concept causal abduct explan introduc konolig roughli abduct abstract hypothet inferenti schema causal theori observ set observ explan explan observ minim set chosen set causal justifi observ syntact proposit account abduct formal effect liter finit proposit languag causal theori domain proposit theori simpl causal theori finit proposit languag tupl set liter theori abduct explan observ domain theori finit set consist set satisfi condit simpl causal theori mt mc ft hc ig simpl causal theori context mc introduc extra hypothesi accept fact effect regard explan defin domain theori mt abduct explan observ context domain theori set mc consist context observ deriv set axiom domain theori minim set satisfi condit set satisfi condit decid mc fact set explan conclud problem find ab observ domain theori decid situat domain theori set axiom set simpl causal theori context mt defin temp higher belief nest belief temperatur condit consid observ effect stop intent belief speaker intent condit work consid observ effect rest refer mc left implicit context interest effect context mention temp higher belief nest belief temperatur condit consid observ effect stop belief intent speaker intent condit work consid observ effect context interest context mention ab observ condit fb ong mc context condit deduct figur fb ong minim ab observ stop work fb temp higher condit ong notic temp higher deriv axiom temp higher replac order obtain ab stop work hand accept fb condit ong ab violat consist condit describ contextu abduct exploit hearer updat mental state hearer receiv number observ speaker mental observ concern condit induc send messag receiv inform observ condit speaker mental section hold accept set explan find satisfactori updat mental state section hearer mental state repres set axiom ax system mc order explain observ deriv hearer provid simpl causal theori mc domain theori mc part hs mental symbol ax domain theori hearer hand ax belief chang dialogu argu result accept explan observ consequ portion ax subset symbol ax part modifi recept speech act ax call set current explan chang appli basic abduct abduct abduct abduct abduct denot appli extend make deriv observ context ab domain theori chosen set minim explan choic base partial order ab paper effect specif definit order order strictli depend applic domain mean plausibl explan similarli method repres comput partial order abduct contract oper denot appli contrast observ formula remov formula context minim hit set fa fa set ab context domain theori hit set chosen relat order ab abduct oper denot perform explain inconsist observ formula context defin oper definit levi ident updat inform check precondit perform awar fact condit updat imag speaker mental state precondit hold imag speaker belief mental state obtain updat set current explan distinguish consist inconsist case expand explan comput contract order set mc expand set ad explan result mental state collect set set hit set hit set minim hit set notic coincid main effect mental state perform temp higher current explan easi temp higher fb ong higher hearer comput minim fb ong expand result fb ong notic mental intent switch condit condit intent recognit intent recognit hearer abil recogn intent speaker perform speech act condit state motiv perform intent chang hs mental state believ intend formula discov check differ mental state execut extend includ fact intent differ instanc context formula intuit mean effect speaker obtain utter hearer believ hearer intent speaker hearer make observ observ find explan fact speaker intent make obtain set explan defin similar context hearer belief state restrict recognit problem speaker intent hearer belief intent perform temp higher comput find temp higher temp higher find condit formula belong belong condit mean believ intent make temp higher make intend perform condit final updat observ hearer consequ condit mental believ intent believ believ consequ expand order verifi interest effect yield context relat work work present paper relat main research agent intern agent commun belief agent intern base approach previou work semant agent commun number speech act base semant kqml fipa acl main agent commun languag semant agent involv dialog approach defin concret feasibl agent treat specif set commun act set commun act semant express term precondit main defin set polici agent follow updat mental state receiv messag spite ground research area work attempt combin unifi treatment lobo defin abduct version larg class theori chang oper oper defin abduct version lobo object defin gener abduct chang oper basi exist theori chang work main goal defin specif set theori chang oper suitabl observ gener commun act state number ration postul contract knowledg defin abduct base algorithm comput algorithm hit close definit abduct contract paper matter definit contract fulfil basic ration postul import analog fact knowledg base analog defin paper main differ extend idea case abduct extens special oper logic belief intent al introduc ration postul abduct argu notion abduct correspond attempt determin initi belief state contract belief state epistem input condit work process limit agent belief introduc mental extend process agent intent system import agent intent belief acquir imag mental state maintain belief mental state agent updat hindrik al provid oper semant pair commun request base transit system approach agent mental belief goal mental state set rule describ evolut mental state agent refer moment agent evolut semant commun oper term transit agent belief state differ approach agent imag mental state radic differ fact commun act precondit effect belief agent semant explicit relationship agent belief commun main consequ choic recept messag necessarili yield agent mental state belief consid action agent decid belief independ commun agent provid criteria belief assum function complementari approach provid found execut method belief commun hindrik al deal synchron commun asynchron commun synchron commun mean agent agent necessarili agent agent opposit direct true pair commun request offer deduct abduct enlarg modifi agent belief case deduct reason pattern agent gener answer inform request similarli abduct gener offer fulfil request differ consid asynchron deduct abduct perform gener answer specif process recept send messag paper made fundament assumpt causal relationship speaker mental state utter sentenc develop abduct method recogn speaker mental state updat hearer imag speaker mental state inspir causal relationship classic act adopt vision speech act repres oper investig precondit effect speech act order updat imag speaker belief intent work base system extend notion casual abduct definit effici implement algorithm comput set abduct explan observ object futur work refer serafini model check multiag system journal logic special issu comput logic aspect report itali carberri pope knowledg abduct updat journal appli cimatti serafini reason belief context elabor toler proc int confer system page report itali symposium logic formal stanford pr cohen cr perrault element theori speech act cognit af giorgini belief receiv multipl sourc william frontier belief appli logic gardenfor knowledg model dynam epistem state mit cambridg mp georgeff commun interact multiag plan aaai page model belief model context intern interdisciplinari volum lectur note artifici page springer verlag giunchiglia giunchiglia ideal real belief belief journal logic report itali giunchiglia contextu reason special issu le short version workshop knowledg pp report itali giunchiglia local model contextu reason local compat sixth intern confer principl knowledg reason page morgan report itali giunchiglia serafini hierarch logic modal artifici report itali piotr gmytrasiewicz edmund durf oper formal model proc intern confer system page frank de van der meyer semant commun agent base deduct abduct workshop konolig abduct versu closur causal theori artifici jorg lobo carlo abduct chang fundamenta js rosenschein mr ml ginsberg cooper commun aaai page ny foo relationship abduct belief state workshop abduct page ac ny foo abduct applic abduct infer process belief chang seventh australian joint confer artifici page ac ny foo abduct belief nonmonoton consequ joint workshop deduct logic program abduct deduct page villag rao georgeff bdi theori practic proc intern confer system page ea sonenberg social preliminari report werner decentr ai proc european workshop model autonom agent world page elsevi scienc publish bv js rosenschein mr commun cooper stanford heurist program foundat logic cambridg werner theori commun cooper multiag plan proc lo morgan kaufmann publish
IR/617 5 contextu navig hypermedia queri abstract navig queri result highli volatil requir effort provid firm refer point queri refin user access tradit search engin confront lengthi page hypertext relev inform found access link bring user closer farther inform context queri result current web page lost delaunai mm address issu creat virtual document queri result displai organ refer origin web provid semant hypermedia navig loss context digit librari hypermedia context preserv introduct number user world wide web technolog increasingli user popul search reliabl search inform navig mechan averag user spend fifteen minut search web find piec expert user complet task minut gap expert novic capabl reduc time novic expert search interfac combin power search refin capabl simplist view overwhelm user delaunai mm present user uniqu search support refin novic layout queri result capabl coupl framework support multipl inform repositori media type isabel jame worcest polytechn institut research support part nation scienc foundat career award cise research instrument grant primari applic work digit principl interfac method extend dispar inform repositori world wide web architectur framework discuss greater detail paper present virtual document layout focu abil preserv context navig queri result virtual document layout context preserv delaunai mm user virtual document layout organ displai answer queri specif includ type multimedia object return request layout instruct layout depend user curat layout style user categori style design reflect goal intend user group student templat prioriti explanatori text imag curat templat show object metadata delaunai mm submit user keyword inform repositori layout manag guid displai result final virtual document depend type media object select style virtual document return object displai format navig user move page inform interest view origin web page select web displai origin page separ browser window user web site benefit actual search link singl interfac navig approach extend capabl hypermedia interact figur show navig complex tradit search result delaunai mm tradit model user navig hypertext list result actual page inform site navig style design user travel return list result move context construct user node sphere lose context constantli move movement linear depend design individu site detriment cyclic user cross inform site navig result list user link result page find inform search engin successfulli search site entireti hypertext list result facilit elementari inform gather delaunai mm address shortcom tradit hypertext list creat virtual document delaunai mm relev path extract inform relev displai data user defin virtual document user figur tradit hypertext search result figur delaunai mm search result collect view refer web page alik composit structur type semant link user inform web page semant tradit syntact individu link view origin page point number hop queri result relev inform effect creat local sphere interact ad structur unstructur inform retriev task cyclic navig unsuccess provid relev result user usabl studi result decemb student particip usabl studi interfac architectur studi intuit applic approach queri vast data defin flaw approach interfac creat digit digit survei provid engag subject interest user type result studi support approach note minor significantli usabl user delaunai mm submit queri digit creat virtual page format origin applic queri delaunai mm attribut tailor interfac specif task user complet question survei affirm negat statement aspect interfac user monitor confirm studi usag scenario survei question fair user perform studi week minut leisur detail discuss result found result relat virtual document usabl prefer delaunai mm interfac list user state prefer view result singl browser view origin web page result search option find support altern interfac view search result result studi user popul diminish capac prove global usabl respond expert web searcher high confid search studi fair sampl user respond note typic success find inform find inform submit search bia heavili note prefer interfac exist search close split posit neg user comment time approach slow slow time result transfer multimedia plain text area technic explor expert web searcher time kei usabl factor interfac regard highli individu futur work base result comment user ad format present queri result list hypertext link descript strength addit expert search fast familiar interfac retriev inform addit interfac make hypertext result list subset format addit includ incorpor hypertext result present interfac built java mechan insert hyperlink text block inform determin addit enhanc usabl applic add strength hypertext referenc directli interfac refer georgia tech research corpor gvu www user survei octob cruz user interfac distribut multimedia queri mediat support refin januari cruz wt luca customiz approach queri digit librari multimedia comput network frank halasz reflect issu gener hypermedia system commun juli vol pp
AI/618 2 support dialogu inferenc reason david tucker leonard breslow navi center appli research artifici intellig naval research code dc abstract dialogu inferenc process infer aspect user problem partial descript reason interact increment elicit user problem suffer poor retriev effici prompt user question user implicitli perform dialogu inferenc standard method dialogu inferenc system requir librari design suppli explicit inferenc rule approach problemat mainten introduc altern approach system guid librari design build domain model model partial problem descript queri retriev system infer impli answer initi empir evalu approach improv retriev effici sacrif retriev tr present reason distinguish benefit reason user requir initi provid complet descript problem user enter text partial describ problem system assist elabor problem end user select solut appli commerci tool success relat applic behav tool automat infer problem descript detail user gener infer detail user prompt answer question implicitli answer commerci solut dialogu inferenc problem requir librari design provid complet correct set independ inferenc rule approach complic rule correct domain complet introduc reason approach solv problem librari design suppli domain model case librari rule infer model queri retriev system model easi maintain assur correct complet infer rule partial implement approach aid section describ dialogu inferenc initi evalu end discuss futur research goal relat research case case librari text partial describ set qa pair sequenc action respond state qa summari state constitut problem descript outcom appli action assum success serv prototyp solv task problem descript similar cs case summari user text brill tagger identifi noun phrase perform stem case summari process inspir synonym stopword provid librari design user text comput similar score store similar defin percentag root noun phrase score displai set similar case displai set unansw question case rank frequenc user select answer question build user problem state qa score similar user problem case qa qa qa qa jc qa qa qa qa qa number share ai pair question similar comput result case rank accur figur summar behavior extens support dialogu detail section addit inform dialogu inferenc figur demonstr dialogu inferenc problem librari case defin common printer troubleshoot scenario answer question select problem descript similar function qj rank question sk rank solut problem descript solut select select question case librari impli answer case librari design librari model question gener rule implic text queri system fig support dialogu inferenc user initi problem im black paper displai question print qualiti print qualiti print correct side displai fig dialogu inferenc problem displai question implicitli answer earlier version automat infer answer neg impact case retriev number question user answer retriev satisfactori solut type infer text relat text specif ai chain defin relat pair text infer answer question chain rule infer question indic print qualiti independ rule set approach commerci tool attempt solv problem requir librari design manual enter implic rule text implic rule appli user modifi text descript user descript system text includ assign answer question figur automat answer solut present knowledg engin input rule set larg printer troubleshoot case yield write prone error larg set unrel rule difficult examin maintain larg rule set case librari requir updat librari design avoid incomplet rule set case retriev perform mainten issu complic rule updat process dialogu inferenc figur summar integr knowledg system process relat queri construct rule librari design interact enter librari object model relat domain question model relat question repres semant compact rule easier maintain implic rule gener input model output set rule rule current problem descript input retriev answer impli user text answer question infer answer ad problem descript librari model creat librari design interact modul implement techniqu assist identifi object relationship user enter question printer print identifi object connect relationship user queri confirm tent identif part object model printer troubleshoot librari shown figur relat printer print box denot denot valu diamond denot domain denot variabl print qualiti print printer print qualiti problem black fade print qualiti fig partial object model printer troubleshoot librari print qualiti problem print qualiti print qualiti boolean question list question question interpret interpret print qualiti print qualiti fig partial question model printer troubleshoot librari figur displai partial question model relat question object model question interpret determin deriv answer interpret boolean question test subgraph exist existenti quantifi variabl interpret list question search specif variabl bind subgraph match textual infer depend trigger phrase node question model synonym list maintain system liter match made deriv chain rule requir relat interpret question question model answer answer answer answer question pair impli impli black black fade fade question question fig chain implic rule printer troubleshoot librari print qualiti deriv answer print qualiti relat interpret requir match recogn unknown variabl target subgraph bound sourc graph chain rule relat interpret shown figur shown figur rule state impli rule print qualiti infer chain rule model gener text rule word question case librari repres knowledg binari assert text infer black answer black repres text black question black answer black phrase assert queri infer answer shown figur bind found deriv answer black assert chain rule shown figur impli phrase locat phrase pair text find text pair phrase match retriev phrase text question question answer answer retriev impli answer fig queri retriev impli answer text rule question find ai pair answer find answer pair current question answer impli impli answer retriev fig queri retriev impli answer chain implic rule question black answer black question answer impli black question fade answer fade impli fade assum problem descript question rule queri shown figur find black user input system infer black text infer infer chain rule chain infer made base infer question answer provid user tabl lesion studi result printer troubleshoot librari rule set effici number infer text chain text chain evalu dialogu inferenc retriev effici impact retriev test hypothesi printer troubleshoot construct model text chain rule extract librari solut sequenc librari ai pair case case sum ai pair cluster exist solut librari case uniqu evalu retriev base correct retriev case solut test test methodolog case test remov case librari test case test randomli select phrase summari descript serv input text partial mimic expect user interact refresh displai rank randomli select question answer qa answer cs answer end cs question answer question qa measur examin similar case solut match effici measur number question user answer ti case question rank occur randomli result averag ten trial experi requir set paramet fix find similar result set fix jk jk similar reason final paramet type infer text chain conduct lesion studi text infer appli text influenc initi case rank chain appli immedi question answer appli answer deriv tabl summar result printer troubleshoot includ averag number infer made text infer chain text infer chain rule yield effici gain effect combin effici tabl lesion studi result librari subset rule set effici number infer text chain text chain type infer reduct number question answer state case printer troubleshoot case librari good demonstr effici gain integr section state small pair pair infer test case librari characterist suit demonstr benefit dialogu inferenc chose built consum electron compani circuit develop reason model case case cluster troubleshoot topic problem tv solut select total action case printer averag size state higher pair state logic relat gener natur video confid gener natur answer extract model yield text chain rule case result shown tabl effici substanti higher printer troubleshoot case librari limit size question displai limit retriev infer procedur dialogu inferenc retriev correct case answer question displai automat infer test integr subset case obtain xerox corpor select cluster case printer copi qualiti state ai pair case case distinct solut gener text chain rule subset result similar previou dialogu inferenc effici reduc number question remain text inferenc ineffect case descript mimic user word common question text futur relat work situat approach dialogu inferenc perform text infer benefici case descript overlap question text chain rule benefit case librari state larg logic causal relat pair complet accuraci rule impact retriev perform randomli delet half chain effici reduc question ad half chain retriev drop initi evalu suggest retriev effici improv work remain complet integr model interact elicit case librari design applic question interpret librari model autom dynam verifi consist librari model librari expand evalu integr build model requir domain anticip fast queri process speed assist scale larger case librari addit work domain expert case carefulli design case librari evalu control yield insight system behavior formal determin relationship model characterist potenti effici gain success applic publish nguyen research topic cbr shimazu al multipl interfac mode facilit case retriev aha breslow machin learn approach case librari simultan improv effici yang maintain case incorpor idea leng structur librari develop process kad methodolog briefli discuss autom question weight approach base integ program techniqu zhang yang learn algorithm inspir error requir user provid feedback retriev rank prefer aha integr evalu report paper extend address reactiv plan task form interact cbr investig prompt user question suggest tree sequenti prompt user question determin tree induc case default tradit cbr approach user answer question smyth cunningham algorithm retriev subset match case induc local tree select featur maxim inform gain user prompt suppli valu featur determin local tree user choic question approach benefit integr paper research integr approach cbr framework al introduc languag support hybrid analyt approach intend learn rate reduc brittl induc gener classif task al index transform techniqu cbr system solv mechan design task repres causal relat problem variabl hast al adapt compon predict accuraci reason exampl exist previou effort integr compon improv perform summari paper dialogu inferenc extens reason system extens exploit domain inform effici relat question text prompt user question implicitli answer approach search impli answer detail initi evalu show type infer deriv domain model contribut improv retriev effici futur research goal includ final implement evalu applic mathemat empir navi industri case librari acknowledg david jim hendler review hector janet case ralph print librari research support grant offic naval research cooper research develop agreement infer corpor refer refin case librari intern confer reason springer support reason integr reason framework dw aha jj daniel reason paper workshop report menlo aaai press approach support dialogu inferenc reason multimod aaai fall symposium report menlo aaai press navi aid environ report naval research navi center appli research artifici intellig studi implement combin techniqu automat extract terminolog jl klavan resnik balanc combin symbol statist approach languag mit press case adapt incomplet causal model intern confer reason advanc high perform knowledg report colleg depart comput scienc induct reason case transform approach case base synthesi ai engin design compaq provid consum power artifici intellig annual confer innov applic ai aaai press maintain unstructur case base intern confer cbr springer retriev interfac adapt dialogu desk oper twelfth nation confer ai aaai press comparison increment cbr induct learn work paper unpublish engin approach troubleshoot case base intern confer reason springer analyt classif aaai aaai press appli techniqu system san morgan kaufmann lifetim mainten case base index continu case base reason intern confer artifici applic articl process macro packag llnc style
HCI/619 4 wearabl augment realiti workspac abstract poster describ work build wearabl augment realiti system support true stereoscop graphic pen pad interfac user interfac present track pen direct interact virtual object system assembl hardwar compon serv basic test bed user interfac experi relat collabor stationari mobil ar user introduct relat work augment realiti annot real world comput gener power user interfac paradigm user interact comput natur mobil interfac deploi wearabl comput logic extens bodi relat research show mobil ar present mechan identifi inform fix user inform fix rel user bodi inform regist real world locat applic ar mobil comput follow distinct augment field field typic applic mixtur approach field annot common field prefer simpl inform browsabl navig directli manipul applic mix connect annot field lack accur world referenc track system user locat make direct interact virtual object hard annot easier achiev field track user posit accur field perform wearabl gerhard dieter schmalstieg vienna technolog real object virtual annot virtual object field field figur field object render field object directli manipul comput reason stereoscop render satisfi perform recent object posit user direct interact featur requir stereoscop render recent advanc portabl comput applic rich direct manipul object field feasibl demonstr wearabl ar setup full stereoscop displai manipul object reach user interfac manag user arrang arbitrari applic bodi carri approach interest applic extend ar manipul live model environ construct model hardwar configur setup consist hardwar compon core li power notebook comput equip video chip processor carri backpack user displai deploi virtual stereoscop color displai user wear helmet equip orient sensor web camera fiduci track interact prop ad wireless lan network adapt enabl commun stationari setup futur mobil unit main user interfac pen pad setup graphic tablet pen devic optic track camera marker posit pen incorpor process provid accur track pad figur show imag setup tablet marker notebook pen marker figur compon setup user wear system softwar setup notebook oper augment realiti softwar system user interfac manag system ar base limit stereoscop graphic environ support displai devic project wall workbench mean object user interfac element regist pad softwar support share migrat applic host serv user input track devic process track librari link ar softwar receiv data user head orient sensor provid coordin system bodi stabil world stabil coordin system pen pad track video camera mount helmet process video inform user touch pad pen accur inform provid graphic tablet set posit pen respect tablet featur setup introduc number featur found current system stereoscop graphic emploi enhanc user percept close locat virtual object track pen pad directli manipul object user interact figur game ar chess demonstr collabor stationari user mobil user space space limit field view camera track interact setup coincid field view hmd make interrupt user watch interact applic futur work setup investig collabor issu mobil support mobil user offer interest problem share applic figur show game chess mobil stationari user acknowledg project sponsor austrian scienc fund contract special ivan viola contribut implement refer levin augment realiti wearabl comput special issu augment billinghurst al wearabl spatial conferenc space proc octob feiner tour prototyp mobil augment realiti system explor urban proc octob höllerer situat multimedia present real world proc page san octob bridg multipl user interfac dimens augment realiti proc octob schmalstieg open softwar architectur reconfigur track base xml proc march
DB/620 3 architectur object model distribut john stankov son depart comput scienc virginia va abstract confluenc quickli creat global virtual applic requir access tempor accur multimedia data true militari intellig requir featur commerci applic develop distribut call offer featur type servic audio video support featur potenti provid improv perform function current distribut object manag system present high level design architectur sketch design object model extend data model incorpor time featur object introduct gener internet provid order magnitud improv comput infrastructur order magnitud improv applic level achiev improv global distribut specif offer featur fault qualiti servic video secur dimens support featur potenti provid improv perform function current distribut object manag system research problem solv support solut problem term distribut environ level resourc manag oper system network layer includ provid set applic current gener internet collect softwar servic support vision call system defin innov ffl support base notion data transact ffl parallel recoveri base semant data system oper mode crisi ffl reflect inform specif languag support adapt fault realtim perform ffl idea secur rule object abil rule util profil ffl fault toler object synergist oper transact properti log ffl architectur model interact multimedia transact ffl uniform task model simultan support hard control task multimedia ffl resourc manag algorithm set servic remaind paper discuss highlevel system architectur sketch design nativ site show part fit present technic detail object model properti summari work conclud paper gener design system overview distribut system provid level support inform technolog integr battlefield world wide web access internet wai includ emphasi sensor time valid level support adapt fault support special featur deal crisi mode oper part system run fix secur host part dynam mobil comput gener processor internet design nativ legaci site port interfac legaci system interfac legion system figur nativ site feder distribut model implement tempor data time cogniz qo specif map specif api fault toler secur underli object support sophist applic includ legaci permit port virtual system combin wrapper underli softwar system import mention applic legion distribut global execut platform execut parallel program legion bw legaci system bw wrapper bw bw bw rdbm oodb nativ site site port db system figur isol interact virtual global web individu specif wrapper access download java applet includ standard sql command inform identifi analyz analysi permit make vast comput process infrastructur exist wrapper util legion system provid process power nativ design basic design nativ site depict figur applic user submit analysi gener access imag data activ user standard specif interfac qo fault secur collect requir gener refer servic qo restrict qo imag applic requir initi implement wrapper provid interfac open inform sourc internet implement aspect focu paper high level manner user full qualiti qo fault toler confidenti level secur user oper invok method data data model includ timestamp data data valid interv sensor data posit data transact access object activ map occur high level requir specif object api map modul map modul primarili concern interfac object wrapper issu aspect work object semant inform call reflect inform inform object make simultan satisfi requir fault secur adapt manner inform includ rule polici action underli system deadlin level fault toler request semant inform includ code make call resourc manag subsystem satisfi negoti resourc requir resourc manag subsystem translat requir resourc specif api api fault toler support secur subsystem user invok method object deadlin semant inform object make call resourc manag request servic resourc manag determin alloc primari backup execut method deadlin inform os os api modul prioriti resourc resourc manag critic compon success abil effici manag distribut resourc requir resourc includ physic resourc resourc oper commun resourc link bandwidth semant inform data method object object object object object resourc manag analysi resourc resourc manag api applic level ft api rt api secur api activ object mapper video bt tr qo api figur nativ site assum resourc manag singl system oper system network base compar primit resourc manag implement sophist adapt resourc manag system support applic wide vari servic requir fault secur resourc manag offer ffl provid applic program interfac develop desir servic requir knowledg underli resourc manag entiti servic function mode crisi ffl map servic requir quantit resourc alloc ffl dynam manag network system resourc maxim resourc util provid applic programm servic requir applic fashion resourc manag entiti map servic requir actual resourc qo high qualiti video requir map uni atm network resourc planner ft api rt api secur api resourc manag ip network os resourc manag servic mapper admiss control resourc alloc modul qo api api object resourc figur resourc manag cpu mbyte network bandwidth advantag approach reusabl applic modifi underli resourc infrastructur conveni approach maxim resourc util enhanc resourc manag plan compon plan compon track dynam behavior resourc usag maintain inform current state resourc past futur resourc manag scheme adapt chang resourc demand system crisi figur illustr main compon resourc manag system compon discuss applic program interfac applic program interfac provid satisfi constraint api applic programm access full function system burden intern detail api simpl provid simpl intern api resourc manag system requir applic specif intern simplic ffl oper heterogen distribut comput applic develop requir knowledg underli resourc infrastructur top applic execut ffl adopt provid set api design separ api servic provid build api applic requir applic qo requir applic requir applic secur requir api applic develop audio video qo requir applic term time resourc manag map qo request actual resourc request applic individu task transact requir servic resourc manag resourc manag refer central entiti resourc manag main compon ffl servic mapper perform map qualit resourc request quantit request physic resourc servic mapper gener uniform intern multipl request applic ffl admiss control perform test determin suffici resourc support servic requir applic servic made activ applic ffl resourc alloc modul manag interfac underli resourc manag system resourc manag entiti atm manag ip oper maintain resourc alloc applic ffl resourc planner attempt global optim resourc admiss control decid applic admit reject binari admiss control lead greedi global suboptim resourc alloc current resourc alloc atm network realtim oper resourc planner modul enhanc admiss control process yield global improv resourc alloc resourc planner priorit current incom request resourc base resourc alloc strategi resourc planner obtain resourc alloc modul inform state current resourc alloc resourc planner provid inform futur resourc usag resourc planner process inform admiss control resourc planner plai central role adapt resourc alloc incom request resourc planner initi reduct resourc alloc applic resourc planner decid preemption abort applic object model user set set set rule object model entiti real transact applic requir execut function rule defin constraint action object model extend tradit objectori data model incorpor semant inform qo requir inform includ execut resourc constraint consid resourc type requir section present compon discuss support architectur similar term structur object object model main differ model support approxim support rich set type requir object object tupl object set attribut domain inform set cf compat function determin method invoc timestamp latest updat updat object creation time data store object tempor consist valid interv part attribut repres valid interv attribut timestamp latest updat time attribut timestamp determin tempor consist semant characterist ad futur attribut amount field repres maximum amount exist object belong class collect object similar structur class categor object basi share properti behavior class relat subclass hierarchi support multipl inherit complex object object class late bind support function interfac object defin set method method model si mn method repres execut set paramet execut time requir method case set resourc requir method cpu time si set semant inform method method appli singl copi si constraint consid case avail copi case import note function interfac extens set resourc requir semant inform method compat function defin method invoc semant inform method polici system state inform compat pair method object function boolean express simpl true predic involv semant inform system polici execut parallel object primari mode instanc resourc compat function state boolean return true return transact transact element system bring inform applic return inform object applic transact polici addit usual method invoc requir paramet transact model tn uniqu identifi xt worst case execut time execut rq set polici set consist requir properti option repres precondit met transact repres postcondit satisfi complet transact transact execut event success execut relat transact requir transact term start period requir period execut requir form redund secur requir level secur transact type encrypt authent polici state requir reduc lower level requir replic copi reduc copi resourc manag assign copi object transact polici state wai show order requir reduc polici state system alloc resourc satisfi reduc requir copi copi requir reduc secur requir secret level classifi level omit encrypt polici state deadlin requir reduc secur requir reduc rule rule constraint defin correct state object relationship action event rule model cm rn set object referenc set event invok set set order action cm coupl mode describ action execut compon omit rule specif coupl mode cm rule support default coupl mode action part event detect condit action depend definit action side effect condit evalu condit part action time event event part condit evalu time event occur set event describ event trigger rule event en event ae set atom event constitut event repres set atom event detect updat data extend model support composit event detect complex current design support atom event rule detect composit event set condit describ condit trigger action event detect condit predic includ attribut object system state logic tempor consist constraint express condit action correct violat constraint assum object attribut tempor consist requir requir condit captur situat action enforc tempor consist action pair op ty action type op action oper action type ty describ type action actual oper action depend action type ty support type method transact action type definit simpl complex type reject simplest form reject mean current activ trigger rule reject secur violat failur authent type method invoc rule meant insid object transact wast resourc case oper occur insid object type transact full function trigger mechan activ model coupl mode cm describ invok action perform common coupl mode support detach coupl transact trigger event trigger trigger transact execut subtransact trigger transact defer trigger transact execut commit trigger transact detach trigger transact execut separ transact trigger condit object manag support object model architectur provid modul manag rule function separ schema manag object manag storag manag transact manag recoveri manag rule manag modul briefli discuss object manag modul organ semant inform creation delet concurr control recoveri object persist object creat store perman storag storag manag system startup share main memori segment creat object tabl instanti wellknown locat share segment tabl associ object object entri share segment semant inform object preprocess compil method call rule object object share concurr transact concurr control compat function object util concurr access object invoc method transact request method invoc evalu compat function method invok method depend transact execut request method suspend conflict lock adapt fault toler larg size potenti applic inform domin fault occur frequent wrong time system effici protect common secur breach adapt fault toler briefli discuss adapt featur approach design adapt centric solut fault system deal fault fault fault processor fail silent failur transient fault occur due power softwar race time fault occur data date time approach fault toler support underli model base adapt fault toler fault toler typic user oper fault toler aspect servic servic ffl read dynam request user automat trigger action activ part queri soft deadlin retriev data type includ ffl updat transact user invok automat updat type data includ tempor data ffl multimedia data retriev audio time larg degrad ffl analysi retriev data fed analysi tool process includ process distribut legion fault toler interfac includ featur servic class fault type ft servic queri queri proce processor retri transient fault produc partial result prior deadlin avoid time fault multimedia process shift processor processor fail transient fault degrad servic avoid time fault similar fault toler servic defin combin support adapt fault updat multimedia analysi tool access number object order support fault toler underli system model base adapt fault toler object fault toler tailor cost fault toler user requir object system repres data method data type semant inform support adapt fault toler work input object addit paramet requir time qo fault toler level secur insid object hidden user control modul attempt meet incom requir dynam base request current state system form admiss control user object execut method object passiv output object encrypt result minut control modul insid object dynam interact system resourc encrypt object perform admiss make copi encrypt messag admiss control call schedul decid minut control strategi produc time result base semant object simpl user obtain fault secur time requir invoc subject current system state user user time request level servic object system adapt meet requir note crisi mode trigger set object base tradeoff strategi kei research issu investig map servic level fault toler request underli object research question composit underli object mechan support adapt fault toler object meet servic level requir similar map question exist fault interact relat work awar effort design build system capabl global virtual fault secur properti heterogen environ standard odbc jdbc access address research question pose research past address issu qo network os fault distribut execut platform briefli describ project architectur develop bbn aim support qo corba object level mechan measur enforc qo agreement goal make distribut applic predict provid address issu support qo object inform system properti provid framework support code qo descript languag applic expect usag pattern qo requir connect object applic adapt system support multipl behavior function bound contract suit main object reduct varianc system current implement perform issu plan broaden scope includ secur clear extens fit architectur issu transact manag strip inform design heterogen environ support function schedul tempor constraint data goal includ high perform abil share data open system support notion perform hard applic project distribut activ system prototyp dynam schedul set develop sweden reactiv behavior model eca rule current prototyp support tempor constraint data multimedia inform applic util multipl remot dynam heterogen notion mediat introduc prototyp implement penguin system mediat softwar modul exploit encod knowledg set subset data creat inform higher layer applic deal mismatch problem encount inform heterogen issu pursu commerci system oracl storag multimedia blob larg system integr applic develop industri mercuri project data remot video camera transfer atm network displai provid effort servic recent progress made area qo support oper open distribut system exist system give qo assur heterogen distribut system note exist qo network architectur support integr approach qo network tion tenet protocol suit develop context testb network present servic model internetwork work result design transport protocol network protocol signal protocol support set servic protocol tenet group tailor hard support multimedia data tenet protocol provid middlewar layer accommod applic special requir secur fault toler qo standard effort undertaken network commun atm forum recent complet traffic manag specif support time applic peak rate alloc cbr servic class atm servic class give probabilist qo work group ietf work complet qo servic architectur signal draft servic definit support determinist implement open softwar foundat research institut pursu effort build configur realtim oper system modular scalabl highperform comput system import effort respect cord system cord develop extens suit protocol fault isol fault manag support depend distribut applic project target militari applic oper system ipc primit summari design high level identifi compon solut present architectur object model detail design continu prototyp system develop success approach provid major gain fault secur global distribut access analysi kei contribut distribut system notion transact level support fault secur properti applic success enabl high confid usabl distribut system user obtain secur time access time valid data presenc fault user dynam level servic system set servic level automat capabl significantli enhanc applic inform domin autom support system research question resolv remain includ ffl develop priori analysi perform secur properti collect adapt ffl develop effici techniqu dynam composit ffl analyz interact tradeoff myriad choic ffl determin fault model ffl creat time bound resourc manag admiss control ffl determin access legaci system achiev reliabl ffl determin system work crisi ffl determin system scale refer overview stanford inform acm sigmod sf distribut activ acm sigmod march atm atm traffic manag specif april tenet protocol transact februari adapt fault toler intern workshop comput septemb adapt fault toler comput integr fault toler pp resourc reserv protocol version function internet novemb support multimedia applic mercuri ieee journal select area vol architectur koch complet mc lewi core legion object ieee intern symposium high perform distribut august expert system applic confer august stankov spring paradigm hard oper ieee stankov reflect oper principl realtim prentic cord research septemb integr applic distribut heterogen ieee commun februari mediat architectur futur inform ieee vol march pp maintain tempor issu intern workshop architectur support qualiti servic corba theori practic object april
Agents/621 1 conceptu framework agent definit develop michael luck mark depart comput scienc school comput scienc warwick unit kingdom unit kingdom email email tel tel fax fax abstract agent kind varieti field comput scienc artifici intellig rapidli wide applic rich agent metaphor lead term strength strength li fact appli wai situat weak term agent frequent commonli accept notion constitut agent paper address issu appli formal method provid defin framework agent system specif languag provid access unifi formal account agent escap terminolog chao surround agent framework unambigu mean common concept enabl altern model class system foundat subsequ develop increasingli refin concept introduct ten notion underli system virtual unknown earlier year system move spread nich area interest artifici gener comput technolog dramat sustain growth interest demonstr number major confer workshop dynam cover depth breadth research impress level matur young area reason growth popular field obviou intuit appeal agent progress made complementari technolog dramat emerg world wide web distribut inform technolog lend ideal problem consequ suggest solut agent dual aspect interact world wide web major drive forc contribut factor includ advanc distribut object technolog provid infrastructur develop agent system difficult effect corba distribut comput platform handl heterogen distribut valuabl piec technolog underpin develop agent system fundament techniqu contradict system effort provid sound conceptu foundat onward march applic develop disagr natur agent commerci industri research develop effort underwai time set grow recurr theme form agent confer workshop lack agreement constitut agent difficult truth immedi engag concept imag spring mind term mention prime reason agent system broader extrem rapid growth develop field elast terminolog definit agent concept led adopt common term broad rang research provid encompass set interact partli rich varieti approach applic lack common understand lead difficulti lack vast system adopt agent label obviou justif discuss valuabl common barrier solid problemat find converg languag constrain exclud area current spectrum activ paper seek address problem provid sound conceptu framework understand landscap system approach constrain terminolog rigid provid encompass infrastructur understand natur system benefit rich agent metaphor preserv distinct ident perspect highlight direct focu research develop object paper begin review overview argu formal method provid foundat framework describ notat section introduc agent section describ kei agent compon detail paper end discuss implic view agent enabl field wai framework extend describ specif agent architectur agent landscap terminolog artifici intellig introduct notion agent partli due difficulti arisen attempt solv problem regard real extern environ entiti involv process solut construct address problem limit inflex cope situat agent situat embodi problemsolv capabl function effect effici complex environ mean agent receiv input environ sensori act affect environ effector simpl power concept adopt remark speed branch comput scienc broad applic plethora label agent rang gener autonom agent softwar agent intellig agent specif interfac agent virtual agent inform agent mobil agent rang applic agent tout includ oper system interfac process satellit imag data electr distribut manag control busi process manag electron commerc comput game rich agent metaphor lead term strength weak strength li fact appli wai situat term agent frequent commonli accept notion constitut agent rang area notion term lack consensu mean shoham point number term agent meaningless refer concept agent agreement make agent gener research provid definit earli collect view emerg smith agent softwar entiti dedic specif selker view agent program simul human relationship person refer reason agent agent comput program behav manner analog human travel agent insur agent softwar entiti capabl autonom behaviour heterogen comput environ avoid issu complet leav interpret agent reader agent definit found excel review franklin graesser advanc definit agent defin foundat survei field wooldridg jen weak notion agenc identifi involv autonomi abil function social abil agent interact reactiv agent perceiv respond chang agent behav fashion characterist broadli accept repres kei qualiti assess wooldridg jen describ strong notion preval ai addit weak mental compon knowledg etzioni weld desir agent characterist includ tempor continu agent simpli believ person order facilit effect commun abil agent adapt mobil agent transport machin architectur requir agent accept collabor modifi request clarifi flexibl script decid action characterist regard notion agenc benevol ration wooldridg jen qualiti agenthood joint paper sycara suggest characterist weak notion agenthood broad accept problem recent müller seek survei autonom agent architectur strand reactiv delib agent interact agent properti correspond perfectli kei repres break class agent distinct stream research difficulti approach agent identifi properti exemplifi mobil agent distinct identifi focu movement code host machin kei characterist mobil regard agent properti note earlier critic analysi area mobil agent recognit mobil augment central agent characterist mobil mobil valuabl identifi kind understand agent specif label agent describ characterist impact agent relat domain capabl area effort address issu attempt distinguish agent franklin graesser construct agent taxonomi aim identifi kei featur agent system relat branch field titl agent highlight regard problem notion agent definit agent system situat part environ environ act pursuit agenda affect serv distinguish program agent introduct tempor suffer simpli provid franklin graesser move classifi exist notion agent taxonom hierarchi interest provid solut problem identifi agent petri point autonomi remain kei part definit similar müller taxonomi intellig agent reflect applic identifi class agent architectur suit problem valuabl aid understand rang work clarifi issu discuss nwana offer interest typolog agent system review importantli warn danger agent possibl result agent properti illustr rang design potenti applic discuss inadequ detail analysi basic underli concept make rapidli grow progress vagu appreci natur agent wooldridg argu avoid term meaningless empti attach system merit agent label address problem describ formal framework construct autonomi attempt bring dispar notion agent formal thread research artifici intellig greater lesser group banner theoret work neat led gap arisen formal logic describ theori system formal languag involv construct softwar effort made provid greater harmoni integr complementari aspect wooldridg jen develop model cooper problem solv attempt captur relev properti cp mathemat framework serv specif cp system strand rao attempt unit theori practic wai provid abstract agent architectur serv ideal implement system mean investig theoret properti effort develop altern formal start implement system formal semant agent languag view abstract implement agent program written interpret goodwin attempt bridg gap provid formal descript task defin agent properti term similar concern arisen softwar engin comput system sophist difficulti effect manag develop process dramat combin larg case hundr thousand line complex distribut lead concern qualiti correct softwar product critic safeti secur issu inform prove inadequ assur qualiti softwar test lead improv limit effect order address softwar vast arrai tool techniqu includ banner formal method formal concern descript softwar design properti mathemat logic formal notat natur languag inher vagu formal notat provid mean specif effort goodwin integr ai highlight awar desir adopt softwar engin techniqu address problem face artifici intellig demand theoret analysi system develop investig formal specif medic support system craig blackboard architectur interpret wooldridg formal testb distribut ai soar cognit architectur complet survei relat work formal method formal languag softwar engin artifici intellig provid van harmelen fensel seri paper requir formal framework argu garlan softwar system typic conceiv relat varieti system share common design featur rare typic unstructur wai softwar engin gener agent research design implement seemingli relat vagu uncertain common featur reason design reflect common properti design poorli understood claim made formal specif address issu defin framework common properti famili system identifi result system consid instanc design construct exist design framework intent paper provid formal framework situat agent research facilit fruit discuss effect commun argu formal framework satisfi distinct formal framework unambigu provid mean common concept term readabl understand manner avail readabl explicit notat movement vagu conflict inform understand class model common conceptu framework common conceptu framework exist gener held understand salient featur issu involv class model relev problem framework suffici provid foundat subsequ develop increasingli refin concept import posit level abstract suitabl current task altern design model system explicitli compar evalu rel framework framework provid descript common abstract found class model mean refin descript detail model system construct aim achiev benefit suggest garlan discuss formal reusabl framework framework develop cost offset famili product product displai element desir uniform reusabl softwar compon emploi earlier discuss agent act construct gener framework product lead eleg cleaner definit fundament concept applic notat adopt specif current work major reason suffici express unifi structur account comput system oper structur made schema schema enabl descript system level system complex ad success lower level view build program schema suitabl squar demand formal model implement transit specif program approach formal specif pragmat formal concept remain directli connect issu implement program develop languag increasingli industri strong eleg mean formal support larg arrai book articl develop tool gain accept tool artifici intellig commun term standard dissemin capabl syntax formal specif base set theori order predic calculu extend languag addit mathemat type schema type schema upper declar declar variabl lower predic relat constrain variabl type schema consid cartesian product type notion constrain predic modular facilit schema includ schema select state write var introduc type abstract actual content element notion set write repres set node state variabl set valu order pair valu write node £ node relat type express relationship exist sourc target type type relat sourc target relat set order pair element sourc type relat element target relat function total function element sourc set partial function element sourc relat sequenc special type function domain contigu set number number element sequenc relat defin function defin sequenc node domain relat function element sourc set rang element target set relat exampl dom ran dom ran set element defin set express denot set squar natur number greater detail notat introduc requir framework present inform intuit fashion summari notat definit declar identifi predic sequenc express set relat declar abbrevi definit set free type declar logic logic conjunct logic implic quantif set set membership empti set set set element order pair cartesian product power set power set set intersect set union gener union size finit set set relat relat dom domain relat ran rang relat transit closur function partial function total function sequenc seq set finit sequenc schema notat vertic schema axiomat definit schema oper schema convent state compon oper state compon oper state schema oper state schema oper chang state chang state figur summari notat agent framework autonom agent agent object figur agent hierarchi environ figur complet treatment interest reader refer numer detail formal semant issu paper agent framework discuss detail exist notion distinct lack consensu mean term sort problem construct formal framework kind consid previou section address introduc term concept explic understand agent autonom agent develop formal definit shoham agent entiti mental state ascrib mental state consist compon capabl uniqu correct select demand agent necessarili set mental compon limit assum environ homogen agent direct discuss heterogen agent vari capabl framework minim requir entiti consid agent approach intend encompass provid relat class attempt exclud rigid definit describ environ increasingli detail defin agent autonom agent provid account gener system definit agenc intend subsum exist concept hierarchi agent autonom agent basic idea underli hierarchi environ consist object set autonom agent class fundament compon view world choic autonomi fundament distinguish qualiti framework immedi obviou light import function goal goal defin gener goal defin autonomi autonomi simpli properti foundat serv platform properti agenc specif structur reflect view world shown venn diagram figur built start basic descript definit refin object refin agent refin autonom agent refin agent specif structur part entiti environ abstract descript provid simpli collect attribut environ defin collect entiti object object environ collect give detail descript entiti describ capabl capabl object defin set action primit theoret perform object environ chang state environ agent object distinguish object serv attribut set goal definit object goal level detail defin greater function agent object autonom agent refin descript enabl distinguish subclass defin class agent agent autonom autonom agent agent pursu agenda function control agent defin autonom agent agent motiv show agent behav sophist manner agent structur specif facilit specif languag describ system highest level abstract complex ad success lower level abstract overview structur framework figur box repres arrow repres schema definit agent autonom agent agent show construct detail entiti descript framework autonom agent situat detail descript move top figur bottom show level abstract achiev specif defin agent autonom agent act environ schema detail agent autonom agent perceiv environ similar defin state agent autonom agent situat environ defin framework specif entiti environ construct agent model defin build block primit model creat primit set entiti object agent autonom agent object action agent action autonom agent agent percept autonom agent percept environ state object state agent state autonom agent state figur schema agent framework defin attribut primit attribut simpli featur characterist manifest perceiv potenti perceiv omnisci notion featur includ fact tree twenti feet tall attribut correspond proposit fluent function fluent colour tree attribut perceiv featur set attribut defin entiti compon highest level collect attribut care attribut group describ achiev concern describ collect attribut singl compon state schema construct defin entiti entiti set attribut constraint set constraint explicit enabl differ level hierarchi highlight entiti attribut attribut attribut attribut cup state attribut arm environ simpli set attribut describ featur environ true defin set attribut env attribut entiti situat environ environ includ entiti schema environ state repres env variabl type consist set entiti refer set entiti environ predic requir sum attribut entiti environ subset attribut environ env £ env entiti entiti £ entiti env envisag scenario entiti share simplic norm entiti distinct element distinct attribut object object defin basic level term abil attribut object entiti capac interact environ notion basic build block develop notion agenc object specif order defin introduc action action chang environ ad remov attribut action attach car move wheel delet attribut robot wheel add attribut dissimilar notion add delet list work intend address semant difficulti model action provid simpl action discret event chang state environ perform readabl defin set action action action object set action set attribut object model entiti ascrib notion set basic capabl schema introduc set action refer compet includ definit entiti object refin entiti defin abil term configur term includ refer bodi similar notion goodwin attribut object access environ capabl object schema definit object declar part entiti schema capabl predic part specifi capabl object entiti capabl £ action capabl assum power suppli robot capabl sever limit includ reli physic support weigh thing capabl includ support thing liquid robot connect power suppli object includ fix car report defect object perform environ determin state environ behaviour object model map environ set action subset capabl map defin schema appli schema inform includ object definit relat object properti state defin schema view refin object includ determin set action perform environ defin total function return set action assert predic part schema constrain action object appli capabl object £ env action env £ env capabl object state object situat determin action perform state give action determin applic function defin state object environ state object environ includ schema repres state schema incorpor declar predic schema specifi action object perform redund appli function schema current subset capabl object £ action env capabl situat includ hold set action attach car object oper object action select describ perform action affect environ object situat variabl relat state object variabl concern state natur object capabl remain unchang variabl object instanti view robot power suppli object robot power suppli schema show constraint specifi chang schema leav schema unchang state variabl schema includ affect chang capabl function chang action perform interact place interact state environ ad remov attribut action result chang environ agent autonom agent function environ affect action perform defin axiomat map current environ perform action result environ £ env action env model object interact environ paper restrict analysi individu object multipl interact object possibl model interleav kind state object environ chang schema result environ determin appli current state environ current set action environ determin set action perform appli agent env introduct dictionari definit agent wooldridg jen quot definit agent exert power produc omit act act defin act defin wooldridg jen acknowledg difficulti pure analysi agenc view agent object disposit regard object agent serv revert object circumst concentr natur disposit agent object agent serv case agent autonom agent satisfi goal set goal object object agent goal adopt comput agent explicit goal deal entiti repres goal ascrib goal state entiti adopt goal agent specif defin defin goal goal describ state affair desir robot goal attach car goal state affair achiev environ defin goal set attribut describ state affair world goal attribut agent defin term object agent object set goal formal descript agent agent schema refin object schema constrain set goal oxford dictionari current english oxford strang object wai depend view explicit relationship entiti enabl situat correctli cup view perspect store tea act distinct separ agent treat agent object goal goal goal agent set goal retain instanti object give rise instanti agent agent instanti object agent agenc object agent time subsequ revert object definit mean limit simpl entiti percept agent cup object regard agent ascrib mental serv circumst cup agent liquid end fill cup cup serv cup agent upsid stack paper agent sit tabl serv case object requir entiti intellig agent cup intuit talk import comput agent serv robot robot power suppli robot actuat random consid object robot goal set goal emploi actuat direct pick fix agent goal explicitli implicit hardwar softwar design robot goal kind note random action robot satisfi goal entertain case robot consid agent return cup clear agenc cup tea view regard waiter agent store regard object serv waiter mine finish view cup object agent relev remov cup leav tabl note suggest cup possess goal satisfi exampl highlight rang behaviour agent passiv goal ascrib robot capabl activ manipul environ perform action design satisfi goal agent percept introduc percept agent environ set percept attribut agent subject capabl current state refer percept agent due limit agent perceiv attribut base action call actual percept agent agent perceiv case set percept empti set actual percept empti sensor perceiv requir agent perceiv distinguish mental model actual defin percept environ agent type distinguish physic mental compon type view attribut import note perceptu abil context goal object perceptu abil relev object respond directli environ make percept perceptu capabl context object agent set action enabl perceiv call perceiv action set percept agent potenti capabl perceiv function current environ perceiv action agent typic perceiv entir set attribut select subset base current goal distribut reason system set event event correspond chang percept agent limit resourc process make select base goal percept capabl agent defin includ agent schema refin introduc variabl set perceiv action denot subset capabl function determin attribut potenti agent percept capabl notic function appli physic environ return mental environ argument schema constrain equal describ attribut perceiv agent deal problem agent necessarili perceiv focu subset current mention function appli goal agent contrast previou mental environ return mental environ agent £ action £ env action view goal view view capabl £ env £ action dom simpl reflex agent model goal repres explicitli implicit rule drive agent agent action agent view object entiti view robot entiti sole interest inform requir time model effort robot perform task model agent level goal includ agent level goal percept environ view direct behaviour function schema depend actual percept agent current environ function applic model agent sole object schema includ predic requir return set action predic constrain applic goal function depend agent goal view env action £ £ env env capabl dom agent state describ agent capabl behaviour percept action situat includ schema defin action percept schema defin agent situat object agent situat includ schema attribut environ percept actual percept agent denot calcul function percept £ view percept env percept goal goal percept env robot agent cup agent attach store tea robot perceptu capabl perceiv attribut environ consequ current environ robot perceiv multitud attribut includ car car door due limit perceptu process goal attach actual percept robot includ flat attribut car red cup perceiv capabl actual percept goal fix actual percept agent affect select action agent percept function result behaviour agent percept view model term goal affect action select agent oper oper agent behaviour constrain affect aspect perceptu action percept select function unchang oper variabl agent instanti variabl chang necessarili state agent situat actual percept constraint agent defin chang agent state includ ensur state properti object chang variabl includ schema unalt agent act environ specif action perform depend entiti object agent schema describ object interact directli applic schema includ affect state agent predic schema show explicitli schema variabl updat goal goal autonomi introduct definit agenc develop reli exist agent provid goal adopt agent instanti order ground chain goal escap infinit bring notion introduc motiv ground hierarchi goal adopt demand agent gener goal agent autonom depend goal possess goal gener adopt agent goal gener compon natur relat goal motiv qualit goal describ state affair environ motiv state affair describ term motiv give rise gener goal rob bank distinct motiv goal rob bank provid reason motiv agent agent pursu agenda reason behaviour accord intern motiv motiv ground claim motiv critic achiev autonomi autonom agent motiv agent draw work motiv psycholog definit motiv express role tie implement view role motiv defin fulfil motiv control attent explor relat motiv cognit perspect sloman elabor show motiv relev emot develop comput theori mind motiv relat notion motiv concern develop comput architectur autonom agent argu approach base ration reli util theori neutral stanc detail motiv omit inform concept distinct possibl conflict motiv influenc behaviour defer choic actual mechan subsequ point refin implement whilst concern model motiv work concern defin autonomi autonom agent specif begin specif autonom agent introduc motiv motiv desir prefer lead gener adopt goal affect outcom reason behaviour task intend satisfi goal action type motiv defin set distinct goal motiv depend level environ model specif attribut repres monei repres motiv incorpor detail level attribut provid natur omit overarch concept motiv obscur import conceptu distinct practic concern enabl goal adopt ground tabl descript robot cup agent framework schema variabl tea cup robot entiti attribut object capabl agent goal store fix motiv autonom agent defin autonom agent agent set motiv simpli agent motiv agent mot motiv mot illustr note cup consid autonom goal ascrib gener goal respect reli entiti exist potenti autonom mechan intern goal gener robot motiv hunger achiev relat attach car product hunger relat maintain power relat avoid system breakdown normal robot gener goal attach car seri subgoal power level replac goal attach goal recharg batteri possibl satisfi achiev work long danger robot gener goal period order avoid damag compon robot autonom goal gener environ view cup robot term agent hierarchi shown tabl instanti requir level autonom agent percept autonom goal motiv relev determin perceiv environ schema specifi modifi version function perceiv autonom agent potenti capabl perceiv time independ motiv independ goal function definit autonom agent object motiv goal design motiv autonom agent moment current goal entiti consist framework introduc maintain agent perceiv motiv goal dom perceiv autonom agent action env view autonom agent potenti mean evalu behaviour term environ motiv behaviour agent determin extern intern factor qualit agent goal motiv govern intern inaccess goal deriv relat motiv function autonom agent produc instanc motiv agent schema defin act includ schema domain act function equal motiv agent act motiv goal dom act autonom agent state view env action state agent defin refin definit state state autonom agent defin state agent action perform autonom agent function percept environ act mot goal percept env autonom agent oper definit chang state autonom subtl import differ previou schema goal fix agent capabl explicitli state motiv chang action perform agent chang motiv gener goal agent pursu featur agent flux autonom agent regard continu agent autonom agent perman agent transient revert object perceiv act oper autonom agent perform set refin schema perceiv act consequ agent hierarchi agent hierarchi suffici satisfi requir formal framework identifi earlier unambigu definit descript class entiti eleg readabl make clear identifi featur class refin concept develop concret instanc type exist agent categori interest framework impact exist notion class consequ definit section address agent class descript provid reflex agent agent reflex respond stimulu percept environ dictat action agent perform kind agent view agent agent design goal explicitli encod underli definit agenc relev featur reflex intern state repres prior inform environ fit definit provid agent schema store agent agent extrem limit experi direct behaviour order model environ evalu compet agent captur store inform intern state agent intern simpli refin agent schema ad collect attribut memori schema defin agent abil access intern store attribut memori store agent notic type store env produc percept type view agent store £ env store extern environ distinguish intern extern perceiv intern action access extern perceiv action access extern environ refin definit function agent level distinct function level defin includ refer extern intern perceiv function determin set percept gener intern determin percept extern environ intern perceiv action store intern extern perceiv action disjoint set perceiv action note percept agent select make subset attribut depend goal agent defin perceiv function schema store carri percept actual percept £ £ env action env action action view view intact intact intact dom agent similar spirit agent genesereth nilsson reflex agent intern state russel norvig agent properti broad characterist review introduct cite qualiti fit framework qualiti properti agent type reactiv agent agent autonomi autonom agent ration autonom agent benevol agent agent tempor continu requir person requir adapt requir mobil requir social abil requir tabl characterist agent properti tabl address turn note basic agent reactiv defin abil perceiv respond chang environ entiti function environ point reactiv pure version reflex pursu discuss rel qualiti agent behav direct consequ consid relat strengthen discuss agent gener goal straightforward defin explicitli level agent hierarchi autonom agent defin motiv provid mean gener goal ration motiv agent rememb detail motiv motiv mechan construct suitabl mechan goal gener mitig motiv essenti ration manner motiv amount measur case ration defin term util kei point notion motiv constraint ration behaviour discuss properti benevol agent cooper agent interest blind benevol place model autonom agent cooper occur consid advantag term motiv benevol behaviour satisfi motiv give intern drive good selfish satisfi intern benevol benevol instanti set goal chang durat instanti gener goal design benevol behaviour critic aspect blind benevol concept autonomi provid relat benevol autonom agent natur remain properti depend design agent agent relat hierarchi ad basic entiti refin refin lead specif agent step agent construct similar section address case delib plan agent artifici intellig achiev success complet complic sociolog agent construct model show relationship definit construct foundat work result formal definit agent autonom agent prescrib intern architectur agenc autonomi varieti architectur design view accommod singl unifi structur requir specif minim adher featur relationship entiti cup view object agent depend manner function robot view agent autonom agent depend natur control structur control structur control direct framework intend stand provid base develop agent architectur agent theori increment fashion refin schema framework develop notion agent model cooper descript plan easili refin compon framework high level specif plan sequenc action achiev desir goal simpl type construct set present build definit plan action type defin complet plan sequenc action seq action action plan complet plan partial plan partial plan consist partial order set action shown action occur partial action occur action denot closur ps £ action action £ action total plan partial plan type plan plan schema describ plan agent defin refin basic agent schema plan agent agent set plan set plan mean bring goal subset goal agent plan goal agent desir schema state plan agent set plan goal empti set plan bring goal plan agent agent plan plan £ goal plan goal dom ran plan straightforward refin basic agent model show sophist capabl ad framework arriv descript specif agent definit architectur bdi agent cooper similar investig issu system social relationship agent autonom agent cooper respect goal agent adopt goal term cooper involv autonom capabl resist capabl simpli engag differ engag cooper autonomi entiti involv termin cooper user engag termin user engag make secretari cooper secretari withdraw assist point cooper describ autonom agent gener autonom agent adopt goal gener agent consequ agent cooper occur result motiv individu involv definit engag defin similar fashion cooper goal £ goal £ £ goal goal goal goal detail refin framework address cooper relationship found work relationship natur formal base distribut ai contract net protocol link theoret construct system structur framework present natur provid basi refin descript autonom agent model framework suitabl reason entiti entiti world agent entiti hierarchi basi reason function agent complet task describ agent model agent world type construct present distinguish physic construct mental construct conceptu aid definit agent defin model similarli model cooper agent cooper describ agent model agent environ suffici advanc autonomi sophist agent defin sociolog agent abil model agent autonom agent world social relationship cooper engag agent refin agent framework schema type definit full definit omit agent schema extend sophist agent model plan agent agent hierarchi fulfil requir formal framework discuss section provid foundat subsequ develop detail sophist construct exist small bodi work similar view present lindsai describ set properti autonom system relat factor type number defin system autonom distinguish agenc autonomi consequ differ view consid agent hammer lindsai deni rock qualiti autonomi ignor possibl skip import part framework work includ offer relat view distinguish concurr autonom agent volit similar spirit view castelfranchi autonomi motiv work differ autonomi absolut concept constant context occur exist construct formal specif identifi entiti call agent autonom agent work base exist classif notion consensu recent paper defin agent wildli make extrem difficult explicit natur function taxonomi framework satisfi requir identifi demonstr paper clear definit agent autonom agent understand function system explic factor agenc suffici abstract cover gamut hardwar intellig abstract framework satisfi remain demand foundat subsequ develop refin concept previou section shown framework enabl altern design explicitli compar briefli shown previou section compar qualiti minim relat design enabl produc specif gener access research ai softwar formal method schema describ framework highest level abstract increment detail add system complex level restrict mathemat gener mathemat framework defin contrast natur extend framework refin includ vari set concept exampl model cooper outlin origin framework extend schema schema intend proce task enabl level detail requir present design environ design present level detail acknowledg john michael jennif paul nick colin mark john mike wooldridg comment earlier version paper paper check fuzz packag refer definit knowledg engin program java corba john wilei ny edit industri applic distribut ai commun chanc softwar knowledg engin van dyke applic distribut artifici intellig industri foundat distribut artifici page john wilei ny van dyke agent overview cec klusch cooper inform agent lectur note artifici intellig page berlin intern confer autonom marina del ca acm ny softwar agent commun intellig theori practic knowledg engin collabor interfac agent twelfth nation confer artifici juli page aaai menlo park ca appli artifici intellig virtual intellig virtual environ appli artifici matchmak inform agent fourteenth intern joint confer artifici intellig page canada morgan san ca agent mobil comput ieee person mobil agent commun softbot approach os interfac ieee satellit imag dissemin softwar agent ieee theori practic nm distribut artifici theori page kluwer academ dordrecht methodolog model techniqu system bdi agent demazeau agent break seventh european workshop model autonom agent lnai page busi process manag intern journal cooper inform electron survei knowledg engin entertain softwar agent artifici life autonom agent program artifici program agent program languag commun teach agent learn commun architectur integr agent commun intellig agent fiction forecast ieee intellig harvest softbot ieee taxonomi autonom agent nr intellig agent iii intern workshop agent lectur note artifici page roadmap agent research develop autonom agent architectur applic intellig survei knowledg engin nr intellig agent iii intern workshop agent lectur note artifici page softwar overview knowledg engin agent franklin graesser nr intellig agent iii intern workshop agent lectur note artifici page formal framework agenc autonomi intern confer page aaai press mit press cooper problem solv journal logic abstract architectur ration agent intern confer knowledg octob page morgan kaufmann bdi agent speak logic comput languag van de veld agent break seventh european workshop model autonom agent lnai page formal specif agent properti journal logic mathemat method digit system develop vdm formal softwar develop fourth intern symposium vdm volum page formal medic support system ieee formal specif advanc ai architectur elli chichest formal specif research report depart comput warwick logic dai testb wooldridg intellig lnai page specif soar architectur technic report school comput carnegi mellon formal specif languag knowledg softwar engin knowledg engin van comparison languag kad model knowledg engin van formal method knowledg engin knowledg engin formal design implicit invoc mechan vdm formal softwar develop fourth intern symposium vdm volum page formal framework design methodolog softwar improv formal framework hypertext system iee softwar specif hypertext model formal specif intern confer lectur note comput page role formal reusabl framework acm softwar engin refer manual prentic edit formal specif document case studi approach intern thomson comput london specif case studi prentic edit understand specif languag formal semant cambridg press formal specif intern confer lectur note comput verlag user eighth user june london formal specif intern confer lectur note comput formal specif intern confer lectur note comput verlag introduct formal method john wilei edit formal specif dmar intellig agent fourth intern workshop agent architectur page case motiv reason psycholog motiv emot control cognit model page yale press emot cognit robot emot seventh intern joint confer artifici page bc william lo ca goal creation motiv agent wooldridg intellig lnai page agent wooldridg intellig lnai page provabl bound optim agent thirteenth intern joint confer artifici septemb page morgan san ca artifici modern approach upper saddl nj logic foundat artifici intellig morgan palo ca engag cooper motiv agent model zhang distribut artifici intellig architectur australian workshop distribut artifici lectur note artifici page engin formal comput model journal logic make break oper analysi agent relationship zhang system methodolog australian workshop distribut artifici lectur note artifici page motiv behaviour goal adopt zhang languag applic fourth australian workshop distribut artifici lectur note artifici page contract net commun control distribut problem solver ieee transact framework cooper distribut problem solv ieee transact man contract net goal direct system van de veld jw agent break seventh european workshop model autonom agent multi agent lectur note artifici page agent theori agent case studi intellig agent intern workshop agent architectur lectur note artifici page understand autonom interact european confer artifici august page john wilei chichest determinist autonom system ai societi object technic report soni csl autonomi cognit agent architectur wooldridg intellig lnai page
HCI/622 4 principl pattern languag michael johnston comput scienc dept melbourn australia abstract usabl principl difficult appli specif style guid provid detail instruct misinterpret inaccess approach usabl base design pattern enabl design learn recur problem solv principl paper review desir properti advoc popular style discuss list modifi provid underli philosophi pattern languag sampl pattern exemplifi involv iter select keyword usabl design style guid introduct discuss reconcil gap softwar engin interact primari wai smoothli integr disciplin develop techniqu enabl design coder job obei relev design principl style standard emploi facilit interact design content document rang heurist user memori detail rule form button corner critic ffl difficulti guidelin interpret ffl capabl effect peopl human factor expert ffl excess effort requir find relev section guidelin ensur applic consist user group usabl softwar consist natur guidelin document mean usabl address term gener principl concept map specif system sophist interpret guidelin detail experienc design unanticip misinterpret ignor experi difficulti identifi guidelin context opportun provid intermedi level design principl detail design pattern appli successfulli softwar develop conveni develop place abstract design rule context concret project work introduc concept design pattern explain set hci principl contribut creation design pattern document effort identifi philosophi embodi set hci begin review principl advoc popular industri style guid text typic discuss principl term desir summari properti present goal mind pattern view human comput work modif appli properti overrid goal modifi properti discuss reflect pattern discuss style guid pattern assess result philosophi outlin design underli philosophi design pattern origin develop town plan build consid recur design forc design solut satisfactorili resolv forc alexand al north face pattern pattern appli build north face major forc sun cast long shadow creat undesir shadow region solut fill shadow region thing requir pattern relat identifi underli offer solut solut context detail problem solv natur pattern emploi captur process inher context pattern languag form collect pattern arrang pattern yield context resolv detail pattern chief benefit pattern languag gener mean design begin work relev pattern gener design element pattern languag languag base underli philosophi pattern demonstr forc identifi resolv encapsul philosophi cunningham note alexand discard pattern process embodi architectur philosophi languag gener artefact align philosophi languag artefact deriv directli philosophi gabriel phenomenon tenni player learn hit ball goal hit smoothli achiev player perform action obviou connect aim hit point ball illustr philosophi pattern forc vagu user learn focu implic principl hold design process architectur philosophi includ notion space softwar design philosophi function modul fundament relationship concret design remain relev pattern captur pattern problem inher support clever solut emerg system argu guidelin standard lead poor interpret peopl inexperienc hci pattern languag usabl quick fix peopl knowledg acquisit demonstr larg solv design principl vocabulari pattern interact softwar design project interdisciplinari natur identifi pattern promot understand usabl philosophi requir captur mean usabl aim practic pattern start review style guid platform window toolkit design philosophi ibm common user guid chosen intend detail rule base properti interest style guid author larg softwar open softwar sun text call typic target attribut system refer section summari guid desir properti advoc tradit style guid step survei style guid identifi wide guidelin paradigm ffl appl desktop ffl ibm common user ffl ms window ffl ffl sun open desir properti suggest style guid group categori categori list style guid properti close repres style guid term group properti secondari term locat whichev categori properti section guid dealt design philosophi discuss minor except import note properti style guid fit perfectli notion direct fit direct manipul familiar mislead summari ascertain guid address guid address list properti list view synthesi style guid mean compar guid consist perceiv make maintain continu sustain context user mode judici interfac keyboard placement control standard consist impli set convent applic mean relat object exhibit similar behaviour input devic interpret consist manner tempor consist stabil recommend style achiev reason consist improv learn make system ensur switch applic smooth activ familiar metaphor real plain make object concret visual metaphor familiar guid describ view consist real world recommend familiar featur order user build exist make interfac improv learn process metaphor languag contribut familiar simplic displai descript messag obviou class simplic label make navig section call user common design omit properti list design principl includ guid design simplic mean make applic straightforward overwhelm detail suggest adequ mental model softwar access oper easili kei motiv properti novic perform typic task minimum simplic make applic easier learn visual task support contribut simplic simplic hindranc experienc user user control feedback direct manipul direct user reduc user memori place user control user user give user direct provid output input work select style guid intend wimp oper direct manipul topic frequent discuss major goal paradigm place user comput dictat user point time direct manipul familiar peopl work tool object object tool repres direct manipul recognit recal flexibl user user interfac interfac demand flexibl driven observ rang user usag environ style guid suggest perform task requir task keyboard user control interfac suggest offer guid feedback feedback provid commun applic action give user provid rapid style guid recommend user action result rapid form consist understand user user stai task feel maintain control system visual design aesthet creat aesthet provid natur shade good visual design visual design address layout object guid care point emphasi clariti simplic visual effect attent task aesthet appeal make experi pleasur robust anticip explicit destruct common content style guid user prone make partli user prefer learn read manual system expect prevent error provid clear guidanc flexibl expect user provid cue warn alert user caution event undesir action softwar make easi recov effici accomod user level make user interfac transpar interfac progress disclosur keyboard window progress effici measur quickli accur user achiev task system typic achiev understand task user perform design interfac aim make interfac user focu task interfac effici support properti visual design properti impli system assist user attain profici flexibl user applic control wai complic novic system ensur experienc user awar advanc featur make interfac complic novic recommend style guid make progress provid mechan advanc oper user experienc pattern languag underli design philosophi style guid desir properti notion user control altern view user comput work agent share control perspect view overrid pattern languag section identifi goal pattern languag set desir result adjust style guid desir properti accord goal pattern languag util import process facilit project pattern base philosophi desir principl discuss turn goal pattern languag pattern languag develop driven goal goal evid select desir properti process discuss subsequ pattern usabl context usabl concept defin achiev make matter neglect develop automat elev statu softwar qualiti relationship softwar attribut complex context develop mind usabl consid pattern languag usabl concern user matter reliabl issu power impact user softwar rapidli modifi make easier develop respond chang request made develop question suggest develop discard obsolet percept resourc memori cpu cycl embrac har resourc pattern consid pure pattern languag ideal address detail design issu languag gener perfectli usabl system care implement user comput collabor view comput passiv tool control greater progress made treat parti mutual collabor goal design system account characterist entiti machin rememb raw data human capabl make inspir view laurel work argu softwar treat human comput agent work common divid interfac concept bring question desir properti industri direct manipul user control user perform task easili deleg search web email address desir properti pattern languag consequ strength weak interact comput user varieti interact style allud previou familiar interact treat invari usabl import consum electron equip video virtual realiti technolog driven voic system desir properti gener usabl system broader base properti style guid focu novic fact reflect origin commerci gui softwar cater novic import expert requir style script languag desir properti usabl system pattern languag discuss properti list result properti suggest industri appli modif process process base goal previou section construct properti list style guid properti modifi relev style guid properti shown direct manipul style guid properti account concept direct manipul goal support collabor interact style suggest inappropri treat basi philosophi task effici task effici requir softwar assist user vari experi level accomplish task abil properti simplic subsum concept acknowledg expert requir interact style novic smooth interact enabl user achiev goal worri applic user effici activ standard focu prefer concept consist mean goal ensur user knowledg attain user access document program gui appar activ applic end ident increasingli import number applic rapidli similar applic rob user vital cue requir distinguish applic data item gentner nielson illustr point note book bookshelf exhibit wide varieti book aid bookshelf provid quick mean identifi book gener form book user exist knowledg base commun direct perspect feedback comput passiv wait user process inform user happen led distract dialogu box cooper applic approach support goal collabor human comput ensur system facilit commun mean softwar repres system state understand relev task user perform interfac repres system user comput rich commun environ enabl user express robust user action programm refer mistak user concept robust retain summari emphasi prevent cure user free laurel error easi path recoveri flexibl goal collabor built idea characterist human comput consid flexibl ensur characterist account provid record good reduc human workload goal comput initi comput reduc output accuraci mean speed interact visual denot interfac level detail user question task properti acknowledg user interfac goal interfac visual design cover term follow understand user principl pattern languag style guid gener avoid delv process assum left develop pattern languag appli gener assumpt principl discuss iter human part appar iter develop occur develop necessarili iter partli explain inabl predict human behaviour reliabl user interact inher iter peopl begin creat system adapt support iter plan correctli pattern ensur relev inform involv user consult participatori design understand user usag context softwar engin acknowledg hardwar constraint design interact design understand user context system emphasi method tool import softwar design pattern techniqu automat gener code design document industri experi show softwar design pattern power influenc tend yield larg volum code essenc pattern captur control class bulk code program locat concret subclass make invalu contribut pattern usabl initi address issu function architectur pattern reflect design philosophi sampl pattern outlin figur demonstr philosophi encapsul potenti perspect pattern languag usabl pattern pattern user philosophi intend appli concept pattern interact activ refer task depend specif activ instanc iter element pattern refer pattern includ combin iter pattern gener design conform desir principl discuss previou goal pattern repres collabor consid demand user comput relev extend kind gui sake pattern softwar design detail coverag pattern support task gamma al iter suggest flexibl architectur provid class element iter pattern softwar gamma al support function featur pattern desir properti task effici reflect attempt user easili switch process iter suggest achiev clear mean goal suggest statu object give feedback user idea order circular iter motiv select pattern suggest select object iter context pattern applic user select finit set object forc ffl user iter find process sequenc object time select ffl user iter subset time free jump object ffl comput provid order object sequenc predict user ffl user gener start iter mean sequenc desir iter forward possibl user return earlier state solut consult user determin logic sequenc set object order immedi predict make iter user easili switch process jump object easili mean user check statu materi work understand iter process split window form user process task list side form enabl user access previou form task list show statu task enabl user move form regular sequenc exampl edit sequenc document prepar step month activ iter item gui review histori figur interact activ encapsul design philosophi discuss section view form input toler provid support provid support scarc attain ensur user find order predict flexibl explicitli detail version iter principl pattern find iter order relev requir understand structur participatori design process user evalu cover pattern pattern method rule applic builder tool paper explain establish philosophi usabl order produc pattern gener usabl softwar desir properti investig popular style guid develop usabl philosophi base partial properti provid demonstr pattern reflect philosophi desir process philosophi gener coher lead pattern languag made determin detail cover difficult treat softwar design detail simultan ensur languag applic interact mechan philosophi advoc style guid easi term appli target properti specif solut unclear pattern languag consist element repres recur problem show design produc solut section style guid deal object fail ensur usabl typic concern ensur compon consist manner mechan prescrib classifi specif interact mechan direct manipul captur fundament issu support user design result softwar concept transfer exist knowledg system usabl consid style guid unimport user work oper system find softwar featur consist applic prescrib style pattern languag captur fundament design issu refer angel pattern languag oxford appl comput human interfac appl desktop interfac vlissid industri experi design pattern intern confer softwar page ieee comput cycl design psycholog page cambridg behaviour inform technolog interfac nov design essenti cooper essenti user interfac design idg foster de souza user guidelin menu interfac evalu draft standard humancomput interact page elsevi scienc gabriel pattern softwar oxford vlissid design element reusabl softwar gentner nielson interfac commun aug hartson user interfac develop process methodolog behaviour inform mar helm pattern practic sigplan oct ibm interfac design ibm common user access guidelin cunningham pattern improv architectur vision ieee jan laurel comput theatr jan lauren support guidelin style user interfac design interact dec johnston pattern languag investig altern approach page ieee comput lo microsoft window interfac guidelin softwar design microsoft open softwar associ open softwar foundat style prentic hall englewood sun microsystem open graphic user interfac applic style guidelin schwartz guidelin interfac design chi page york
Agents/623 1 control specul comput environ katsumi depart electr electron engin kobe kobe japan abstract system perform specul comput incomplet commun environ style system specul master agent queri slave agent problem proce comput default answer answer slave agent delai rst provid semant specul comput default logic nding procedur sol written java languag perform deduct reason nding procedur conveni updat agent belief situat world slave agent chang answer master agent avoid duplic comput long actual answer slave agent ict encount obtain recomput appli system reserv problem framework introduct technolog recent recogn import tool distribut comput problem solv academ research busi applic previou research multiag commun agent agent queri agent wait answer comput process suspend agent obtain incomplet commun environ assumpt hold gener messag agent lost signi cantli delai import develop techniqu deal problem solv incomplet commun environ comput logic import role plai formal develop system nonmonoton reason crucial method reason incomplet commun environ solv incomplet problem queri answer satoh al method specul comput system agent queri agent default expect proce problem solv wait notion specul comput multiag system abstract state transit techniqu distribut distribut system specul comput involv reason problem solv perform xed action protocol number realist applic specul comput consid system perform predict travel agent book air ticket hotel room product compani stock materi anticip higher price specul comput master agent question perform specul comput abduct proof procedur specul comput system extens sldnf resolut logic program altern approach specul comput system previou work satoh al base approach procedur emploi specul base approach comput process manner agent consid deduct reason abil deriv situat agent collect tion accept data agent continu gather obtain updat belief acquir inform kind approach relat reactiv behavior intellig agent kowalski sadri discuss import forward reason reactiv abil desir featur intellig agent deriv consequ incom inform eld autom task call nding main object paper logic framework system perform specul comput deriv manner nding procedur base develop system abil specul comput infer engin deduct call implement java realiz sol resolut order linear nding enabl produc interest consequ limit extent comput consequ motiv call reserv introduc appli system con rm framework real master agent queri agent delai data input distribut environ realiz servlet engin paper organ introduc motiv section formal system section reiter default logic formal statu system time section review nding procedur sol realiz default comput section ne comput plai import role avoid duplic specul comput dynam chang environ section summar contribut discuss relat futur work proof theorem appendix reserv motiv reserv problem expect attend meet person attend meet person free person person reserv small room person reserv larg room receiv answer free answer commun partial lost absent follow requir complet reserv room answer ordinari expect free conclud default reserv larg room repli chang reserv larg room small room kind specul comput reduc risk reserv room meet schedul crowd solv reserv develop style system shown figur realiz system implement consist part master agent input expect date place meet meet planner start plan make tent answer master agent send slave agent slave agent free url address meet planner slave agent repli messag make access url receiv delai data input distribut environ realiz servlet engin default reserv small room turn free end situat larg room longer safe cautiou meet planner schedul meet larger room cancel larg room penalti fee specul comput encount tradeo pro risk master agent slave agent repli interfac meet planner java servlet engin figur reserv system slave master agent extract answer ect answer deriv real answer default master agent current output answer di erent master agent recomput plan deduct de ne system de nition similar di erenc underli logic specul comput previou work logic program negat failur repres agent knowledg case written clausal form nonmonoton reason abduct logic program consid reason extend logic program reiter default logic clausal case default easili comput de nition agent framework de ned tripl af set term call agent identi er identi er distinguish individu agent set liter call liter liter predic call extern agent identi er argument liter instanc call write liter repres queri master agent call de ned set form ln liter instanc liter program repres knowledg base master agent de explicit de nition knowledg base slave agent implicitli assum slave agent program knowledg base abil reason question master agent set extern predic share agent assum set intern predic languag correspond reserv agent framework af de ned set consid intern predic master repres extern predic free de assum agent framework af de nition answer default answer respect liter form default default liter default default assum default answer denot set default answer ground instanc liter default default liter default answer default repres default truth assign true mean default answer set default logic default answer default ad program normal default default default default default default default normal default theori extens repres initi belief set master agent note symbol default default order repres belief set agent normal default form notat clarifi liter conveni real implement reserv assum member free default answer set default default default problem master agent updat initi belief slave agent return answer queri assum notion time repres snapshot system time set linearli order set constant smallest element element successor time time written de nition repli set tent answer set depend time de nition repli set time denot set liter form liter assum liter imposs hold repli set store latest answer slave agent reserv time agent answer agent free repli set repli set time mean agent framework normal default theori extens repres belief set master agent special initi belief set default theori obtain belief set default theori time formal framework default problem solv specul comput proof procedur default logic long repli set chang reiter default proof procedur variant pool al requir amount consist costli altern realiz specul comput agent default assumpt consist check made easier de nition answer tent answer set time denot union repli set set default answer respect liter answer sequel reserv receiv repli agent assum tent answer set theorem agent default answer repli set tent answer set time default consist normal default theori extens hold theorem mean tent answer set repres extens default theori default comput substitut comput tent answer set tent answer set comput linear time size default answer agent solv problem default theori time complex infer problem clausal theori reserv problem sati es condit theorem theorem condit theorem hold set formula extens normal default theori lp lp hold set logic consequ lp set formula languag formula liter form default theorem impli specul comput default answer comput logic consequ nding procedur comput logic consequ sol resolut axiom task nding theorem interest interest theorem explicit desir properti task distinguish nding theorem prove practic autom inou reformul nding problem characterist interest criteria interest speci ed languag call product eld characterist enabl reason problem interest prime nonmonoton knowledg induct extens survei nding proposit logic marqui characterist formal de ned subsum substitut liter properli subsum subsum subsum set denot set properli subsum product eld cond set liter close cond condit sati ed belong cond liter belong sati es cond set set logic consequ belong denot characterist respect de ned note empti uniqu mean nding special case nding ad set consequ newli deriv inform call characterist characterist respect de ned de nition comput characterist inou ned extens model elimin calculu ad skip rule extens call sol view ol resolut sl augment skip rule note complet nding complet nding sol resolut comput characterist easi focu produc theorem belong product eld comput sol resolut treat newli ad top start input desir featur nding procedur directli deriv theorem relev ad inform show de nition sol resolut base order sequenc liter possibl frame liter repres liter resolv structur pair order clausal mean de nition set product eld consist sequenc structur dn dn tautolog subsum empti previou structur belong gener select liter obtain appli flg belong flg order obtain remov ii fcg uni mgu order obtain concaten frame remov iii liter frame liter uni mgu obtain delet obtain delet frame liter liter remaind skip rule appli select liter solv appli resolut appli select liter belong product eld deduct top liter solv skip liter collect output output logic consequ fcg liter belong product eld note skip resolut appli select rule chosen prove sol resolut complet nding nding characterist sol resolut implement weak model elimin method enhanc lemma handl prune method introduc enhanc ecienc sol resolut format del val de ne variant nding procedur nding characterist base order resolut reserv top answer liter sol resolut procedur famili complet minim answer comput product eld predic consequ consist answer liter cond denot set posit liter predic cond maximum length term agent return answer return denot default free def larg room small room small solut output tent answer set comput process recal ecient realiz specul comput comput tent answer set long repli set chang repli set chang time solut problem recomput section consid ecient algorithm updat tent answer set previou work slave agent return chang answer real slave agent chang master agent ect problem solv avoid redund duplic comput introduc histori set notion comput process de nition af agent default answer set de ne comput process time quadrupl ro repli set tent answer set call solut set repres solut problem obtain call histori set de ned default de ne ro ro de histori set prepar track obtain solut solut set set obtain replac default answer default tent answer set liter pair answer solut similar label proposit atm store histori obtain solut recomput show algorithm updat comput process slave agent repli newli arriv algorithm design minim comput master agent assum slave agent return chang answer withdraw previou answer altern answer comput current comput ro set repli slave agent comput ro step updat repli step updat tent answer default step check pair contradict contradict hold pair put exit pair recomput obtain step updat histori slave agent return master agent recomput solut repli contradict default answer solut histori recomput avoid agent chang answer minim recomput reserv comput process obtain ro ro def def agent return answer ro def veri agent answer ro def agent request restor answer time agent return answer ro def veri histori pair contradict recomput restor solut meet held larg room relat futur work architectur deal incomplet commun agent perform specul comput problem solv uniqu featur work summer specul comput time formal default comput signi cantli simpli ed notion tent answer set solv reserv problem consid agent deriv incom inform easili implement nding procedur specul comput dynam chang world realiz notion comput process updat comput process perform recomput goal answer slave agent frequent chang realiz histori set veri cation process prototyp system implement servlet java java featur high platform desir implement intellig agent previou work run applet transfer server comput program servlet run program server reduc load user site futur work includ integr approach reconcil ration reactiv behavior agent architectur combin backward forward reason kowalski sadri framework appli multiag system face incomplet commun environ consid case updat request arriv previou comput problem partli solv satoh al approach avoid recomput specul comput realiz suspend process tent answer set problem solv kind optim framework util lemma lemma comput shown ectiv nding plan introduc exploit histori set sensit extens specul comput gener framework system import futur work yamamoto satoh system hierarch structur agent extens framework gener system agent commun case con ict inform receiv di erent agent knowledg environ multipl agent case consid multiag architectur specul comput gener framework proof theorem agent framework default answer set repli set tent answer set time default default default default theorem default normal default theori extens prove theorem default notic set liter satisfi default answer form default default normal default extens show imposs multipl extens case subset default default default subset exist default default construct sati es recal hold inconsist impli maxim subset consist uniqu extens proof theorem condit theorem hold recal lp set formula languag formula liter form default theorem extens normal default theori lp lp prove theorem result theorem theorem extens default theori normal default de ned gener default default default default hold exist hold proof theorem theorem default set default di erenc set exist default liter default set deriv liter long formula lp di erenc set theorem hold acknowledg research partli support ministri scienc cultur japan ken sakama discuss refer peter ulrich frieder stolzenburg comput answer model elimin arti cial moniz pereira updat agent workshop system logic toni commun agent workshop system logic johan de kleer tm arti cial del val method consequ nding compil restrict languag page aaai green resolut basi system meltzer machin volum page edinburgh katsumi inou linear resolut consequ nding arti cial katsumi ken satoh complet prune method consequ nding procedur sol peter baumgartn intern workshop theorem prove page katsumi inou minim answer comput sol robert kowalski sadri logic program system annal mathemat arti cial intellig lee complet theorem comput program nding theorem deriv axiom phd depart electr engin comput pierr marqui consequ nding algorithm dm gabbai ph handbook reason uncertain manag volum page kluwer takashi katsumi implement ecient lemma annual confer page societi arti cial david randi roma logic reason system default diagnosi nick cercon gordon knowledg essai page raymond reiter logic default arti cial sadri toni comput logic roadmap futur comput katsumi ken satoh reason system environ workshop comput logic system page ken katsumi sakama specul comput abduct incomplet commun environ fourth intern confer multiag system page ieee comput yamamoto katsumi inou implement sol resolut base model elimin transact inform process societi yamamoto ken satoh method extens specul comput multiag system annual confer societi arti cial
ML/624 6 learn appli nearest neighbor algorithm dynam control task david aha navi center appli research artifici intellig naval research code dc usa steven salzberg depart comput scienc john hopkin md abstract paper examin hypothesi local weight variant neighbor algorithm support dynam control task evalu nearest neighbor algorithm simul learn task catch fly ball local regress algorithm advoc class problem variant base predict regress comput nearest neighbor outperform simpler algorithm troubl task task local regress algorithm modifi work similar condit introduct dynam control problem subject research machin learn studi investig applic neighbor method solv task modifi control strategi base gain experi connel previou studi highlight fact small design algorithm drastic alter learn behavior paper describ preliminari studi investig issu context difficult dynam control learn catch ball move import problem robot research thesi paper agent improv substanti physic task store experi explicitli model physic world model data gener learn capabl exploit physic model collect model larg number store learn devic understand physic environ tenni player train repeat action thousand studi physic spin tenni ball skill studi gain learner store retriev method investig conduct experi simul robot world robot move freeli flat ball fli air robot model physic motion guid memori abil investig variant neighbor algorithm learn task address nearest neighbor quickli learn rough approxim control outperform simpl outperform simpl control nonlinear scale function instanc attribut learn agent induc control conduct experi investig point crucial robot decid time step direct move input robot robot essenti learn function map vector angl rang learn function perform classif regress techniqu interpol neighbor investig techniqu relat work learn task involv dynam control problem requir agent balanc pole stand cart learn involv select direct push cart track fix length task difficult pole obviou action system troubl time step neural net nearest neighbor approach perform problem interest problem ball fall repeatedli held robot al program robot learn calibr motion strategi built vision system robot effector introduc calibr error robot juggl ball substanti tune taught robot improv perform adjust aim polynomi fit robot error atkeson colleagu investig rang includ method learn function control robot arm result regress algorithm outperform neighbor variant simul robot task examin perform similar algorithm attempt extend work learn difficult task space work hope test method hardwar futur function learn robot catch receiv continu feedback correct direct move wrong instanc encod function instanc exampl learn task close approxim function complet set fact state space small portion space encount train gener accur predict reli correctli gener store instanc learn algorithm experi algorithm investig basi form nearest neighbor extrem form perform function approxim famili algorithm accord machin learn relat includ learn learn learn includ famili algorithm sophist method extract set attempt function estim method local weight regress robot store instanc predict direct simpl default rule train flight instanc comput time step instanc flight store flight complet store instanc includ inform direct robot move inform obtain compar eventu land point ball robot current locat subsequ flight learn algorithm comput similar current state state store select similar comput averag store move determin direct move robot select state crucial simpl algorithm state dimens due fact robot locat ball locat direct flight figur overhead view task angl dimens repres instanc ball current vertic veloc encod import relationship ball flight robot learn algorithm expect fast learn rate nn irrelev attribut kelli import minim number irrelev attribut dimens repres state algorithm faster learn rate state inform relev experi demonstr case preliminari experi led repres instanc angl ball motion respect robot figur height vertic veloc ball conduct learn trial neighbor algorithm trial consist sequenc train throw randomli gener constrain uniform distribut ball fli land meter robot initi algorithm test separ set throw goal robot minim distanc ball ball hit ground catch figur intuit robot movement figur displai flight commenc home plate top movement chosen robot basic algorithm upper left graph demonstr train robot simpli move ball posit ball eventu fli robot head land robot final posit graph show robot move test flight train flight process train robot natur move wrong direct instanc deriv train flight robot move ball land meter robot train robot richer set instanc draw move closer miss meter graph show train robot smoothli track catch end meter ball land locat launch home plate robot start center robot perform track train flight miss ball robot perform test flight train flight miss ball robot perform test flight train flight miss ball robot perform test flight train flight catch ball figur graph show robot move ball train flight track test flight process train flight vari predict mechan face question induc valu function tabl show small sampl result method line tabl show perform algorithm train throw interpol approach simpli averag valu store neighbor weight straightforward averag closer point count heavili rel test local linear regress approach comput regress equat neighbor make predict weight regress approach differ closer neighbor greater influenc algorithm averag distanc ball percent caught local regress local weight regress tabl comparison algorithm depend measur comput regress equat base rel local regress algorithm work task linear regress method outperform simpler method task regard ball robot reach point meter ball land locat shown robot final locat close ball land locat robot fail catch ball true method test discuss target function highli fact discontinu region attribut function smooth small piec shown figur illustr problem vertic axi figur measur direct ball radian axi mark direct ball move respect travel refer ball travel hit meter distanc ball robot held constant meter graph note angl function hit chang angl point chang robot direct left problem occur ball travel distanc meter ball land robot problem ball travel slightli robot move straight ahead ball travel slightli robot move straight opposit direct sharp function sourc slightli weaker perform linear regress method reason crucial predict task encount close crucial made ball close ground fall robot movement made time determin catch ball slightli meter radiu ball land locat robot close ball actual land locat ball land frequent make predict instanc ly close ball rel angl close distanc travel ball remaind flight equal local linear regress assum target function local linear featur space ball travel distanc angl direct ball travel distanc angl direct figur direct move ball meter robot fore make inaccur predict frequent exist instanc encount solv local regress method slight disadvantag goal learn algorithm induc rule physic govern ball learn map state describ ball rel posit veloc action robot appli variant neighbor algorithm solv task virtual method work ball guid robot roughli correct direct robot land locat method due discontinu target function work elabor control strategi hope fix problem futur plan improv ad sensor air effector test abil learn algorithm handl realist control problem refer robot juggl tenni ball accur ieee intern confer robot autom ieee press learn independ grade concept descript sixth intern workshop machin learn morgan kaufmann learn algorithm darpa reason workshop morgan kaufmann learn algorithm machin local model control movement advanc neural inform process system san morgan kaufmann learn speech nexu project fourth intern workshop machin learn morgan kaufmann learn control dynam physic system sixth nation confer artifici intellig morgan kaufmann nearest nn pattern classif techniqu lo ieee comput societi press robot coordin fourth world confer robot research societi manufactur engin hybrid genet algorithm classif twelfth intern joint confer artifici intellig morgan kaufmann experi adapt control dale michi machin intellig oliv boyd acquisit dynam control knowledg robot manipul seventh intern confer machin learn morgan kaufmann function approxim learn control manuscript submit public distribut control spatial robot ieee nearest hyperrectangl learn method machin learn rate good perform criterion seventh intern confer machin learn morgan kaufmann train track robot ninth intern joint confer artifici intellig lo morgan kaufmann reason commun associ comput integr architectur react base approxim dynam program seventh intern confer machin learn morgan kaufmann
AI/625 2 ensembl classi er base approxim reduct institut inform technolog institut warsaw poland abstract problem improv rough set base expert system modifi notion reduct discuss notion approxim reduct qualiti measur reduct complet classifi system base approxim reduct present discuss prove problem nding optim set classifi agent base approxim reduct genet algorithm suboptim set result classifi system ectiv fast introduct rough set expert system base notion reduct minim subset attribut sucient discern object di erent valu set short reduct gener rule problem short reduct gener approxim algorithm genet implement successfulli obtain reduct reason time rule gener base reduct speci classifi object type reduct consid improv ecienc object dynam reduct reduct optim number gener rule method calcul reduct base singl object result calcul time parallel algorithm notion approxim reduct classifi agent introduc section method fast approxim reduct gener evolutionari process genet expert system tune present approxim reduct inform system set set de nition approxim reduct respect reduct qualiti measur subset local maximum measur function approxim reduct subset de ne indiscern relat set object relat valu attribut includ equal de ne partit set object abstract class relat gener jrj jrj fa jaj set number probabl distribut base distribut abstract class account maxim jrj jrj qualiti expert rule remov nal rule set constant remov rule optim paramet found test result obtain case qualiti measur account subset reduct abil gener good rule set qualiti jaj jrj easi qualiti de nition de nition qualiti valu short reduct higher long system base classic short reduct speci recogn obtain ectiv set rule qualiti origin evalu featur de nition predict qualiti measur subset attribut ned cov cov ju train number rule gener number train object classi ed properli rule number properli classi ed object belong number object belong class classi ed number class experi good estim nal classi cation algorithm qualiti real data approxim reduct optim forecast capabl short short reduct rule base attribut gener descript length predict qualiti measur estim ectiv expert system unknown test data reduct respect set optim approxim reduct reduct optim predict qualiti measur connect approxim reduct classic theorem reduct classic sati es condit approxim reduct de nition respect predict qualiti simpl heurist gener approxim reduct random permut attribut gener attribut ad subset qualiti calcul qualiti low small attribut ad qualiti start phase begin attribut replac qualiti measur calcul attribut highest qualiti replac algorithm stop local optimum achiev result approxim algorithm approxim subset qualiti shorter mean number order attribut gener order set object object sort attribut valu addit techniqu improv nal classi cation qualiti gener method rule adjac mean object order rule analyz join system qualiti higher oper method object classi cation case object math rule classifi upper approxim rule set case closest rule mean object order determin complet classifi system base approxim reduct set rule gener order de nition classifi agent base approxim reduct denot tripl set rule gener base valu attribut train inform system permut object optim set classifi agent system gener reduct genet creat rule set approach rule set ltere genet strategi di gener reduct fast approxim heurist reduct construct classi cation system select optim subset agent simpli nal system poor evalu agent valuabl classifi object hard recogn agent team optim set agent due classi cation result test set set agent perform select agent theorem problem select optim subset classifi agent base approxim reduct account vote techniqu rule minim row cover problem binari matric solv select optim subset classifi agent case special data tabl fb ij binari matrix size goal minim set column row select column special inform system construct row matrix correspond pair object addit set object column matrix correspond attribut jaj ju attribut valu rst ij ij attribut valu tabl tabl matrix inform system produc set approxim reduct predict measur high fa present gener rule remov support support class lower gener rule rule ij rule attribut ltere due special form part tabl calcul qualiti measur number column note rule gener accur cover object monoton respect note larger qualiti measur higher fa case rule gener divid qualiti low support rule qualiti subset attribut qualiti column equal prefer set attribut set approxim reduct inform system set rn optim set reduct correspond optim set column object test index rst object note agent classifi correctli object kj optim classi cation correspond column cover number agent system equal number column cover optim set agent minim cardin correspond minim cover binari matrix construct inform system set classifi agent nding optim set agent minim column cover problem nding optim set agent due problem optim set agent select solv reason time genet algorithm experi agent approxim chromosom evalu ectiv separ test data set randomli begin train classi cation process time proport test rule fast ju log ju test algorithm result experi benchmark publish statlog project experi tabl present includ data calcul time averag error rate paramet reduct reduct ltere genet algorithm evolut classi cation algorithm typic reduct initi number nal classi cation algorithm data size time error sat imag letter diabet breast cancer primari tumor australian credit vehicl dna splice tabl result calcul time includ classi gener test test tabl separ test method result case obtain classic method neural worth note error rate present tabl averag experi nondeterminist result signi cantli data long calcul time concern high number class number object smaller object low stabil train object intern test sampl genet algorithm optim set agent classi cation system base approxim reduct present shown section problem optim classifi agent select construct set ectiv approxim adapt techniqu genet algorithm base system perform test system prove ectiv fast benchmark data set paper address problem vote techniqu experi vote techniqu incorpor vote paramet genet algorithm progress acknowledg domain obtain medic institut yugoslavia provid data refer tame larg rule model rough set approach proc czech republ berlin heidelberg pp skowron dynam reduct tool extract law proc symp methodolog intellig octob lectur note arti cial intellig berlin ic research report warsaw technolog comparison dynam rough set method extract law tabl skowron rough set knowledg discoveri physica garei johnson comput guid theori freeman san francisco goldberg ga machin learn liu featur select knowledg discoveri data mine dordrecht michi spiegelhalt taylor cc machin neural statist classi cation elli horwood data nguyen skowron knowledg discoveri rough set approach proc seventh intern fuzzi system associ world vol pp czech republ nguyen nguyen discret method data mine skowron rough set knowledg discoveri physica rough set toolkit analysi data proc intern join confer inform scienc march pp pawlak rough theoret aspect reason data dordrecht skowron discern matric function inform system intellig support handbook applic advanc rough set theori dordrecht find minim reduct genet algorithm proc annual join confer inform pp septemb nc ic research report warsaw technolog theoret foundat genet algorithm fundamenta vol io parallel algorithm knowledg discoveri system proc poland press technic pp cover reduct fast algorithm rule gener proc poland berlin heidelberg pp analyz relat rough set base method accept madrid
Agents/626 1 cost effect mobil agent plan distribut inform retriev school comput scienc engin seoul nation ac kr abstract number agent execut time perform factor mobil agent plan fewer agent lower network traffic consum bandwidth number agent execut time task mean minim number agent impact execut time unfavor popul mobil agent applic domain import factor care review heurist algorithm find minim number travel agent retriev inform distribut comput latenc minim agent specif mobil agent plan similar famou travel salesman problem agent plan object function tsp tsp deal optim total rout map attempt minim execut time complet task inform retriev suggest map distribut inform retriev system find factor mention end tsp call optim agent local rout path result show produc optim perform algorithm realist applic directli problem domain previou work mobil mobil agent mobil distribut agent distribut inform retriev introduct mobil agent technolog reduc network overcom network enhanc robust capabl distribut applic major potenti applic area mobil agent inform involv access huge amount data network transmit data agent migrat host perform task return origin host bear result mobil agent util bandwidth network effici achiev access distribut remot direct connect total comput time data transmiss bottleneck task inform spread host common host geograph separ mobil agent order retriev inform inform retriev pertin node node fulli cover number agent execut time perform factor mobil agent plan fewer agent lower network traffic consum bandwidth agent consum network bandwidth travel design set node badli schedul agent itinerari longer execut time result higher rout cost number agent creat task influenc total rout cost greater number agent creat higher rout cost order reduc provid agent schedul research carri inform retriev agent plan focu agent plan techniqu inform retriev call mobil agent plan paper map recogn travel salesman problem claim agent task visit problem reduc classic tsp map tsp deal optim total rout cost number map attempt minim execut time complet inform retriev differ agent visit node tsp agent behavior deal plan cover node visit number agent task perform rout cost applic system flexibl find minimum number agent maxim perform object extrem import mobil agent system satisfi faster execut lower network traffic agent emploi unrealist assumpt solv problem polynomi prefer find reason heurist solut condit suggest map algorithm distribut inform retriev system find perform factor primari total rout cost import map decid travel time agent alloc local network desir tackl rout cost reason simpl tsp emploi algorithm optim agent local rout path result show produc optim solut adopt inform retriev system retain perform achiev minimum rout cost minimum number agent section relat work section section describ map problem section result present paper section relat work recent map problem research regard ordinari rout problem tsp tsp effort solv map made greedi dynam reduc agent plan problem greedi dynam assumpt made care emploi limit applic extens idea brewington al formul method travel agent problem analog tsp decid sequenc node visit minim total execut time desir inform found formula denot agent return home node anytim tour success occur call behavior import agent behavior tsp mean agent revisit node resourc alloc essenti alloc problem explor agent effici spend time travel network complet set task pose problem tradit problem environ possibl repres distanc tsp dynam program solv problem polynomi time assum latenc constant directli relat wellman al dynam program deriv algorithm find shortest stochast cost path network algorithm appli problem sequenc task perform wellman al augment algorithm path refin algorithm user travel mobil agent problem tabl summar notat paper tour number node exclud home node number mobil agent emploi task home node execut time complet task node identifi agent identifi sequenc node visit agent tour agent node index tour si comput time node shortest latenc node concaten repres tour rout execut tour si entri tour entri tour ik tabl notat paper introduc import definit tabl definit tour tour agent consist node visit process agent task order definit smallest smallest latenc node found evalu shortest pair definit tour repres tour figur explain definit figur repres merg tour consist defin addit latenc comput time node merg reconfigur accord definit figur tour merg tour problem definit assum map modul network statist histori network monitor servic servic enabl mobil agent acquir rout inform task mobil agent problem mobil agent plan problem home node number node index node comput time requir mobil agent perform task node latenc mobil agent move node hj home node comput time equal mobil agent problem minim execut time number mobil agent successfulli complet task express execut defin longest rout node agent visit network latenc home node execut time solut map problem find sequenc agent visit solut consist minimum total execut time number agent approach import object map minimum execut network bandwidth consum agent minimum execut time task smaller special case agent node total depend node largest sum latenc comput time number agent affect network bandwidth number agent task execut time rout cost system flexibl find minimum number agent prepar send achiev minimum execut time task goal decid sequenc node mobil agent minimum number agent minimum execut task formal defin subject express larger total rout sum tour time agent term express minimum number minimum total rout cost line constraint object function express rout cost agent smaller mean task complet determin node largest sum latenc comput time express requir node process problem develop solut base heurist figur show network configur partit part weight edg repres expect latenc connect pair node comput time node node minimum execut time smaller node maximum rout cost configur execut time node ms cost node ms minimum number agent agent cover node shown figur agent cover node shown figur total execut time ms note sequenc tour agent due usag shortest path agent make bypass direct connect node site visit site process site figur network configur plan method suggest map method detail assum network statist latenc bandwidth link load host collect network monitor modul obtain latenc exist link assum network latenc vari assum agent creat home clone node probabl success retriev requir data pair shortest path goal find lower bound execut time number particip agent affect lower bound fastest complet task send agent node simultan execut time depend total slowest link node home time network latenc comput time find latenc pair simpl search combinatori link select node find lower bound execut time latenc pair enter main process construct network graph refer back figur graph show bypass agent latenc direct link node agent indirect tour cost ms cost ms process requir stage start algorithm algorithm provid smallest latenc inform node previou algorithm proce sort node order rout time node set threshold execut time node sort list partit network part gather node execut time part exce threshold build rout path partit run tsp algorithm optim rout path alloc send agent partit develop algorithm perform slightli partit method dynam find partit calcul latenc search node current node agent resid present figur end call tsp program algorithm simpl effect produc asymptot optim rout path network partit node select node arbitrari note node order order execut time tour estim agent travel time ad cost adjac set node sort list threshold calcul travel time threshold execut time node sort list cost node cost time home add cost set node node select minimum travel time ad home result algorithm rout path agent figur algorithm algorithm plan algorithm phase sort node sort node term tour order sequenc result sequenc phase plan agent phi lo mark ha termin outer phase optim agent local path agent ai figur algorithm algorithm plan algorithm phase phase algorithm phase plan agent select ha minimum mark sort node term hat order sequenc result sequenc mark find ak bx break end break termin outer phase phase algorithm figur algorithm simul simul environ simul base practic perspect mobil agent environ distribut inform retriev mean simul measur assumpt chosen surround realist network topolog comput time major measur factor simul network topolog node locat includ node includ node network topolog relat assign latenc pair node network node agent visit local perceiv standard deviat latenc exist pair node network small factor account comput time node problem space drastic reduc node scatter wide area network latenc arbitrari search space problem larger topolog mixtur topolog consist distribut wide area network node locat number agent necessarili number subnetwork latenc measur experi topolog list tabl type latenc rang tabl latenc rang classifi comput behavior simpl retriev complex queri simpl retriev queri requir small comput time headlin type complex queri requir larg amount comput time type retriev requir extens search summar process simpl retriev queri comput time rang complex queri consum ms tabl show configur number node cluster subnet cluster cluster configur tabl number node cluster configur simul perform environ type topolog kind queri number node optim solut node requir tremend amount search space difficult perform experi perform maximum node experi perform find number latenc cost consum actual plan time task compar algorithm launch agent node simul perform kind sun sparc intel pentium iii intel ram result gather present machin averag reflect averag comput environ comput power calcul perform improv simul result tabl show number agent total cost requir combinatori found number network topolog queri type optim solut repres fact simpl comput type requir agent complex lan configur simpl consum time complex total comput time evenli distribut task complet fix number agent close number node provid inform retriev servic comput time node larg total comput time depend node larg comput time cover node consum visit node requir fewer agent tabl number agent total cost requir fewer agent lan wan middl result explain differ latenc exist network topolog latenc commun vari latenc mixtur lan result biggest time gap node time agent spend time node cover node amount time notic differ result algorithm lan result lan complex agent plan algorithm affect perform simplest deploi agent send agent node perform slightli differ find node visit current posit select farthest node select nearest node current node lan algorithm similar show behavior wan configur inform distanc node home suffici node close current result longer travel time distanc show perform equal network time complex network size gap algorithm execut time grow tabl show number node differ algorithm cheaper configur figur show requir number agent worst number agent fewer worst case averag figur comparison number agent calcul rout cost depict figur reduc cost reduct total rout cost enhanc agent plan technolog perform enhanc obtain launch agent comput time algorithm tabl show spend configur compar perform task time consumpt accept kind agent plan figur result similar experi perform complex condit figur comparison cost node node node tabl plan time fruit current research mobil agent great network applic design run mobil agent extract figur clear suggest map method reduc tremend burden network heavi traffic move agent map algorithm distribut inform retriev system mobil agent show improv made map algorithm minimum execut time obtain agent deploi node plan algorithm find minimum number total rout cost consum agent prevent total execut time minimum algorithm found solut number agent solut drastic cut total comput time inform retriev system mobil agent technolog paramet combin network queri type inform retriev number node result show node local area problem requir number agent number node complex plan algorithm effect perform configur good strategi launch agent node comput time node network latenc uniformli algorithm highli recommend assum size mobil agent fix node calcul latenc valu includ time transmit agent size mobil agent retriev oper effect bandwidth vari link link problem includ prepar futur work includ plan mechan refer oshima infrastructur mobil requir design proc intl workshop mobil messag pass constrain environ usenix mobil comput evalu perform mobil messag commun mobil host larg ad hoc wireless network proc acm intl workshop analysi simul wireless mobil august braun travel salesman problem genet algorithm workshop parallel problem solv page cybenko ru mobil agent distribut inform intellig inform page michael zyda mobil agent man public garei johnson comput guid theori elli fundament comput algorithm comput scienc de zobel methodolog distribut inform retriev proc eighteenth intl confer distribut comput page wong intellig mobil agent inform retriev knowledg discoveri distribut data knowledg sourc proc ieee inform technolog mobil agent plan problem phd dartmouth cybenko travel agent problem mathemat control signal januari fuggetta vigna understand code mobil ieee transact softwar januari vigna design distribut applic mobil code paradigm proc intl conf softwar juli kotz autonom adapt agent gather inform aaai intern workshop intellig adapt august la experi user agent mobil applic mobil network mp larson path plan uncertainti proc eleventh confer uncertainti page august
IR/627 5 probabilist datalog rule inform classif transform abstract henrik probabilist datalog combin classic datalog horn predic probabl theori probabilist weight attach fact rule imposs assign exact rule weight construct rule learn algorithm learn rule weight algorithm slow larg set test high number rule appli number extens algorithm order improv effici applic demonstr power learn probabilist datalog show learn rule suitabl low problem schema inappropri higher dimens text classif introduct logic view inform retriev treat retriev infer queri system search document impli queri logic formula true due vagu logic uncertain reason probabilist approach discuss document retriev base estim probabl probabilist approach combin datalog datalog variant horn predic logic wide deduct probabilist probabilist weight attach fact rule rule weight describ approach uncertain logic rule base exponenti condit probabl evalu probabilist datalog develop infer engin difficult calcul rule weight rule bodi appli method field machin learn remedi problem describ algorithm learn rule probabl rule permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee copyright acm depart comput scienc dortmund germani norbert fuhr drawback algorithm slow major reason oper rule evalu perform obtain qualiti probabl learn larg set evalu long time rule learn algorithm evalu high number rule rule test complex gener automat length complex rule direct impact runtim describ extens basic algorithm lead effici improv order magnitud number applic demonstr feasibl classif task problem schema map digit librari rest text section overview probabilist datalog rule approach handl rule probabl section introduc algorithm learn rule weight rule improv section present applic finish outlook futur work probabilist datalog datalog variant predic logic base horn negat limit achiev correct complet model rule form bi subgoal denot liter variabl constant argument rule fact rule constant head empti bodi omit probabilist datalog fact rule probabilist weight prepend fact rule evalu base notion event kei event express fact instanti rule basic assign event kei deriv fact event express boolean combin event kei underli basic event problem rule formul head rule predic estim case bodi rule fulfil situat probabilist infer network link matrix condit probabl rule state document semant relat iff author link document share author link reformul rule set order cover case rule common head predic rule head predic renam pi vector xk atom renam rule rule origin rule set set φ condit probabl definit function γ defin defin rule set probabl integr probabilist datalog rule uncertain rule evalu pp show obviou construct γ valu probabl necessarili yield stratifi program evalu transform probabl addit fact probabl definit weight defin transform rule set construct correct construct proven case learn probabilist datalog rule section present algorithm learn rule probabl γ probabilist datalog similar structur describ subsect structur learn algorithm input algorithm consist set rule common head predic target hypothesi hp set rule head predic renam head predic valu hypothesi space set hp exampl probabilist fact target predic algorithm direct access call oracl exampl exampl return arbitrari label algorithm access background knowledg base kb rule fact evalu search hypothesi hp minimum expect quadrat loss predict error randomli drawn constant approxim valu expect quadrat rest yi set exampl drawn exampl definit approxim defin evalu singl rule pi comput posit neg definit empir quadrat loss hypothesi hp exampl defin probabl comput hypothesi hp evalu transform result set comput empir quadrat loss draw set result gener structur depict figur algorithm present pac algorithm learn γ valu pac approxim learn determinist proposit field machin learn pac algorithm return case correct result fail good properti algorithm base gener architectur input paramet ε δ hypothesi space target predic background knowledg base exampl hypothesi space optimum hypothesi minimum loss stop fi fi od figur gener structur algorithm approxim draw exampl output algorithm probabl δ model probabl probabl error greater ε implement probabl learn algorithm modif section algorithm algorithm adapt algorithm learn condit probabl rule rule learn logic rule logic studi field machin learn method modifi probabilist datalog common order rule avoid test rule head predic definit rule rule iff substitut θ rule set liter head negat rule gener rule iff rule hold rule rule θ θ direct wai gener direct liter append rule liter posit order obtain stratifi datalog program append liter occur occur substitut wai lead evalu rule substitut faster present origin algorithm describ modif algorithm consist nest loop gener local optimum rule start gener rule direct γ minimum expect quadrat loss comput step repeat assign improv rule reach length loop assign rule condit probabl γ outer loop call loop time learn rule condit probabl approxim solv equat system rule unknown γ valu algorithm return local minimum possibl miss global optimum advantag gain due test rule head predic modifi algorithm gener structur loop simpli call gener algorithm current optimum algorithm learn gamma valu direct loss determin probabl final step equat longer rule learn algorithm call rest text figur major drawback algorithm fast weight comput hypothesi local optimum rule determin γ valu lead effici improv develop system implement algorithm addit fact learn rule learn rule clear origin learn algorithm larg set good test rule complex due automat gener rule evalu hypothesi describ solut improv integr target predic knowledg base exampl number rule learn transform rule set loss empti rule set empti rule direct rule hr od figur rule learn algorithm reduc number exampl rule probabl learn algorithm effect properti number exampl polynomi δ ε loss comput exampl paramet result high number requir δ ε exampl speed evalu postprocess abandon implement user exampl exampl learn loss comput draw sampl direct gener rule rule learn algorithm test direct gener rule rule shortest start rule construct exponenti start absurd learn father relat edb predic rule direct gener rule rule make sport person total topic avoid gener lot absurd start task deleg user easi gener reason start special relat domain argument binari relat father reason start rule start rule gener algorithm replac pattern simplifi learn replac part rule liter obtain shorter rule evalu rule requir comput join relat rule bodi join relat ni tupl determin time shorter bodi lead faster evalu rule person parent determinist logic condit argument predic parent instanc predic person liter redund rule discard rule shorter evalu faster rule simplifi rule replac pattern part rule replac liter simplif definit replac pattern statement hs bt arbitrari liter form head bodi pattern head variabl subset variabl bodi constant part semant defin rule replac pattern substitut θ hold import applic area replac pattern model relationship remov redund liter replac pattern state express relationship state argument predic parent instanc predic person rule simplifi pattern substitut θ result rule simplifi pattern substitut θ probabilist case difficult evalu head bodi pattern yield probabl task user ensur properti bodi equal head liter pattern state liter properti true relat determinist domain replac pattern express relat model idb relat knowledg base criterion explain knowledg base rule rule deliv constant tupl event express probabl replac pattern valid probabilist case disjunct pattern algorithm gener rule disjoint liter evalu rule yield empti result superflu significantli improv effici discard evalu rule simpl case disjoint rule liter negat counterpart case test automat gener case defin definit disjunct pattern rule empti head bt semant defin rule disjunct pattern substitut θ unsatisfi rule evalu discard detect state disjunct pattern applic area detect wrong domain rule argument sex constant male person algorithm produc rule detect disjunct pattern problem solv signatur assign argument predic type comparison type detect wrong disjoint domain person sex signatur easi detect person sex error drawback gener disjunct pattern relat signatur rule student examin found signatur simpl disjunct pattern type hierarchi complex approach introduc syntax signatur exist syntax disjunct pattern eleg detect disjunct parallel evalu learn algorithm base gener structur figur γ valu result loss comput part insid complet independ comput connect process hypothesi minimum loss comput learn algorithm distribut comput hypothesi requir evalu evalu part algorithm spend time wait extern program yield notic perform improv constant direct evalu relat manag system enhanc appli learn algorithm common approach evalu rule infer engin notic pretti slow strong improv achiev directli evalu rule standard relat manag system perform fast postprocess restrict rule select statement suffici evalu background knowledg base kb edb predic rule negat predic preprocess step negat rule restrict edb relat background knowledg base kb store tabl predic tabl column correspond predic argument addit tabl predic occur negat complement predic domain algorithm describ transform datalog rule edb predic bodi express relat algebra predic omit step algorithm negat subgoal handl analog posit subgoal transform express relat algebra select select project oper move replac join oper result express form transform select project relat select uncertain fact rule fact rule addit fact rdbm comput event express result tupl event express evalu algorithm comput probabl tupl select queri return result tupl event express event kei idb predic rule probabl relat event express event express conjunct event kei rule transform queri select event order relat prob bob mari mari anton anton peter relat parent peter male bob male anton male mari relat sex store queri return const event peter result queri multipl rule rule evalu separ result merg order statement multipl event express tupl multipl rule free variabl rule disjunct express built probabl event express calcul event express automat disjunct normal applic describ applic learn algorithm test collect text classif reuter collect reuter collect train test document document attach categori task learn rule categori test categori rank select evalu term document stop word elimin highest categori frequenc term good log experi run time determinist probabilist term weight tf idf doc document id set train document weight iff document assign negat liter prohibit disjunct pattern algorithm learn rule tabl show valu paramet det prob rule learn algorithm output rule fewer rule suffici achiev loss result appli probabl learn algorithm output optimum subset subset minimum optimum subset simpli learn rule achiev due high comput larger paramet valu tabl suggest substanti improv gain number learn rule longer liter interest result gain result determinist fact compar approach learn uncertain rule text classif reason high number learn task reduc hypothesi consid term text classif detect spam email collect spam split collect randomli collect size collect frequenc term email term learn classifi test email iff hold probabilist term email reach determinist fact consid achiev percentag document email classifi automat interest user result reuter learn task lower compar collect baselin rule learn perform bad simpl collect detect mushroom appli algorithm collect field machin mushroom collect task detect mushroom exampl consist nomin attribut label split collect randomli collect relat attribut id attribut relat mushroom mushroom id relat determinist classifi mushroom iff hold evalu learn uncertain rule rule set paramet uncertain rule liter uncertain rule slightli real final error reduct result close optimum optimum reach learn rule neuron net uncertain schema map final appli learn algorithm schema map digit librari schema digit librari defin attribut document approach attribut pair data type set valu set binari vagu exampl schema dublin core marc binari relat encod document dc descript queri condit tripl attribut predic comparison encod relat rule map attribut relat ignor predic text retriev document creator area feder digit ultim goal integr hundr heterogen digit librari system common schema support librari standard schema queri map schema standard schema queri dc attribut digit librari support schema attribut state author editor includ standard queri attribut document uncertain rule creator author obtain rule complex rule rule set gener difficult calcul rule weight schema realist dozen hundr digit librari integr imposs construct rule bodi manual learn rule exampl test librari congress open archiv initi repositori document dc marc field support marc schema consist set identifi ordin number field subdivid letter subfield field person subfield date person combin field subfield identifi attribut ad field attribut concaten subfield field subfield learn base exact match valu document attribut convert datalog upper case letter transform lower case charact letter digit convert underscor subsequ underscor transform singl underscor delet start end constant charact result string consid effici randomli chosen subset product document attribut obtain approxim exampl dc standard schema marc librari learn rule dc attribut posit disabl algorithm output determinist rule dc attribut marc field field mention field field invok algorithm level evalu direct evalu relat manag system client replac disjunct pattern evalu achiev comput db client pattern time abort pass dai complet learn rule result show achiev improv direct evalu system yield huge effici improv direct gener uncertain rule higher specif attribut subfield field rule output form section rule probabl introduc result show algorithm learn schema inform comput determinist rule loss schema express dc versu uncertain map requir effici comput probabilist rule outlook briefli uncertain rule gener assign rule condit probabl rule hold tupl requir probabl model probabl transform addit fact ad rule bodi gave overview algorithm learn rule probabl rule bodi algorithm borrow idea common machin learn modifi order fit probabilist datalog shown algorithm extend improv effici practic test show huge learn process appli algorithm test collect clear rule learn low dimens problem main applic area probabilist datalog rule learn schema map preliminari result futur work verifi retriev perform approach develop method transform attribut valu acknowledg part work support eu commiss grant refer extract logic rule train data backpropag network onlin workshop soft page fuhr data abstract network inform retriev system inform process fuhr probabilist implement logic inform retriev advanc applic journal american societi inform dublin core metadata initi dublin core metadata element refer descript induct logic applic elli lewi ringuett comparison learn text categor symposium document analysi inform la lernen für uncertain rule diploma depart comput librari congress librari congress open archiv initi repositori librari congress marc standard uci machin learn repositori collect uci machin learn repositori collect ross modular stratif magic set datalog program negat journal novemb salton bucklei term weight approach automat text retriev inform process ullman principl volum comput scienc rockvil lg valiant theori learnabl commun van rijsbergen logic inform retriev comput learn rule uncertainti integr probabilist knowledg base journal intellig inform knowledg discoveri technic hong kong scienc depart comput yang evalu statist approach text categor inform
DB/628 3 binari diagram router access list scott anton andrew programm highli depend system depart comput scienc privat bag wit abstract network router rule decid packet network filter packet router improv secur perform exclud packet pose secur risk network relev size rule list difficult maintain valid cost rule lookup add significantli latenc order binari diagram compact method repres manipul boolean express potenti method repres rule paper explor bdd develop method analysi rule valid improv facilit hardwar support introduct growth network internet commun creat challeng network design import issu secur perform volum commun import avail critic network applic demand perform secur import network router plai import role improv perform secur filter packet relev congest network reduc subnet perform due reduct network traffic load comput subnet prevent packet enter intern network router simplic call typic set rule determin packet accept packet filter compar packet packet filter rule accept reject packet rule set filter rule typic proprietari format express syntax format gener descript good feel rule set rule set consist list rule form condit action accept reject rule access list cisco router permit tcp rang tcp protocol packet ip address destin ip address accept provid destin port address rang detail rule search condit match incom packet accept reject depend action accept paper present nation research develop confer south african institut comput scientist inform cape novemb condit match search continu rule rule match packet reject rule check order critic chang order rule result packet reject accept problem rule complex ad rule network manag abil reduc congest improv secur maintain flexibl access network practic problem occur rule set ffl difficult understand rule case rule set long maintain difficult valid rule clear effect rule set modif chang order rule set ffl latenc rule set size filter applic pose limit rule implement secur flexibl bigger rule perform requir lead unfortun difficulti understand rule set affect perform analysi traffic rule match incom packet move rule earli list rule lead perform improv chang order rule lead unfortun consequ chang semant research goal aim research explor altern rule set stage focu explor end intern rule set improv lookup perform provid network manag tool understand rule set rule set scope method convert exist rule set cisco access list intern format core rule set boolean written format easi write explor boolean express fruit binari diagram compact method repres boolean express pleasant properti wide rang applic bdd appli problem repres manipul filter rule question research explor ffl bdd repres rule memori complex bdd rule set ffl bdd rule set provid abil rule set modif rule ffl bdd facilit hardwar support rule content structur paper paper report preliminari research undertaken answer question section introduc bdd section show rule set convert bdd address design altern section explor analysi techniqu bdd section outlin hardwar support provid rule set lookup section describ statu work discuss futur research binari diagram diagram method repres boolean express boolean express repres diagram figur figur simpl diagram evalu express interpret start root move variabl path dash variabl path line rule easili evalu function bryant introduc concept order binari obei rule ffl duplic termin remov termin label label ffl duplic ffl redund test remov edg leav vertex delet vertex impli variabl node repres irrelev ffl total order variabl express edg label label order encount order path root bdd reduc order binari diagram simpli call binari diagram abbrevi bdd import properti ffl compact boolean express heurist express ffl variabl bdd express canon simpl mean build bdd practic mean check cheapli bdd construct figur show bdd significantli smaller practic uncommon work express bdd ten megabyt size effici benefit gain bdd make order magnitud differ size boolean express manipul number integ repres bit vector bdd symbol manipul number bit oper addit comparison effici figur order bdd implement reason symbol numer express effici implement bdd common share complex issu size bdd depend variabl order chosen problem find optim bdd order practic good rule thumb find good variabl order bdd packag heurist routin dynam variabl order bdd work applic panacea boolean satisfi problem easili repres immedi bdd solv boolean problem effici stronger result fact problem requir exponenti space convert rule set boolean express section describ rule set convert boolean express repres section describ individu rule rule set convert boolean express section show boolean express individu rule combin give boolean express entir list section explain boolean express construct determin packet accept initi result section cisco access list illustr method modifi fit approach rule cisco access rule form permit tcp rang kei compon rule ffl permit packet match rule accept field section ffl protocol tcp exampl udp ffl sourc number rang ffl mask sourc address ffl destin address format ffl destin mask ffl rang port address port compon port match eq rang boolean variabl introduc number boolean variabl repres inform rule ffl protocol pname variabl proto pname introduc variabl proto tcp ffl segment sourc address introduc variabl form sax segment number segment rule ffl segment destin address introduc variabl form segment number segment rule ffl port repres port port number repres introduc boolean variabl encod port number variabl succinctli repres individu port rang port exampl ffl moment ignor effect mask section discuss mechan handl mask sourc destin address encod boolean repres port care port rule eq match port destin port repres boolean variabl repres posit variabl negat packet match rule bit set true bit set express repres compactli port port function convert number port list rang oper repres effici oper easili defin languag defin inform rule encod boolean express repres bdd compact save chanc prime repres negat altern method repres address method repres port number repres address segment segment address repres bit segment valu rang segment sourc address bit repres repres segment address variabl repres advantag variabl valu segment variabl approach variabl segment approach preliminari research conduct method conjectur rule set grow size method section prefer factor account goal goal primarili compact approach goal primarili approach mask sourc address rule base address mask mask rule specifi flexibl number match rule effect mask bit base address match mask extens mechan repres rule set deal base address rule mask packet address match oper vector segment mask typic mean segment match mean segment sourc address ffl mean packet match machin ffl mean packet machin wit domain cope mechan deal address rule set experi actual rule mask valu preliminari research approach adopt mask segment base address segment variabl includ mask segment base variabl exclud ffl repres ffl repres method section gener mask easili dealt direct implement equat bind tighter entir rule set method entir rule set principl repres boolean express function convert rule boolean express function defin ffl rule set empti packet accept boolean express ffl rule accept rule packet accept match rule accept rest rule set boolean express disjunct boolean express repres rule boolean express repres rest rule ffl rule reject rule packet accept match rule accept rest rule set boolean express conjunct negat boolean express repres rule boolean express repres rest rule ruleset empti ruleset return ruleset tail ruleset accept return reject return lookup bdd repres rule set lookup packet arriv relev header inform extract header inform effect map variabl truth valu packet sourc address destin address port ffl assign ffl variabl assign decid packet accept easi start root tree work leaf variabl current node move true move cost length path root altern approach substitut inform packet header repres boolean express def rule set repres express packet accept comput implic standard bdd oper preliminari result simpl experi undertaken evalu bdd perform perspect larg synthet rule list yield good result redund encourag result give credibl evid set rule provid commerci internet servic provid convert boolean express simpl algorithm simpl perl script tabl cost bdd construct method method cost build bdd bdd size maximum depth bdd process rule set gener boolean express form suitabl system system lazi function languag call fl bdd intern repres symbol boolean express system heurist find good bdd variabl order cost construct bdd reason remain cost find good bdd order note bdd rule set modifi cost small gross size bdd compar origin collect rule text file import cost cost inform assign valu variabl base bdd root leaf worst case cost set cost simpl oper cost lookup origin list linear order origin oper perform rule worst case oper accept reject packet result encourag show bdd feasibl lookup quickli evid rule set real log data worst case averag case import averag case depend real data pattern incom packet import assess cost lookup origin rule set advantag boolean express bdd effect cost chang variabl order size bdd greater length maximum path bdd semant remain statist analysi traffic variabl order averag lookup suffer linear rule difficult import linear order bdd rule set section examin bdd compact lookup rule set potenti bdd rule set wai complet separ bdd analysi analysi encompass number separ consist examin effect modif section present preliminari research point work graphic wai accomplish graphic bdd displai number graphic packag bdd question inform effect open graphic conjunct method explor desir graphic repres bdd effect mechan repres address discuss section suitabl fast lookup packet header inform read set cost integ method set cost understand bear mind repres port number protocol bit inform necessarili suitabl problem data structur place queri valid rule graphic number rule rule set refer sourc destin port protocol difficult understand rule rule develop month ago condit packet destin address accept rule packet address port destin accept rule dozen line packet address reject rang destin address includ rule packet rang address accept rang port number rang destin address includ rule appli depend order rule bdd rule conveni question rule question phrase boolean queri answer bdd ffl packet ffl destin address accept packet sourc address ffl port destin address accept packet sourc address ffl port destin address accept packet sourc address domain ffl destin address accept packet sourc address port packet ffl number queri facil implement test exampl test rang power queri implement effici real challeng present inform queri fl answer present textual form fl power textual provid place burden user interact graphic interfac make easier user queri understand inform coupl graphic bdd modif check effect modif bdd express modif chang ad delet rule chang order rule comparison bdd express origin modifi express construct express compar ffl express ffl rule set impli ffl condit rule set bdd equal return boolean express express type queri section result specifi good idea effect rule number test carri primari comput cost construct list comput cost compar list neglig consist check similar check rule set consist show rule clash redund test implement hardwar implement section outlin approach implement filter rule base hardwar research carri filter hardwar primari benefit perform latenc reduc network router true high proport packet reject secondari advantag secur intern network isol potenti problem packet problem put filter hardwar rule base modifi regularli make modif conveni current programm logic technolog viabl method provid hardwar support filter programm logic field programm gate arrai conveni cheap mechan construct hardwar hardwar design fpga reconfigur design fpga slower vlsi implement advantag cheap small quantiti number tool varieti vendor design implement method present section conveni step stone hardwar implement bdd boolean express effici circuit implement bdd construct standard boolean techniqu construct effici implement bdd rule filter rule set consist moder size fpga capabl implement rule set complet autom process program fpga rule set standard bdd automat construct effici circuit construct format download system fpga act network card function hardwar extend technolog improv paper examin problem filter rule set router rule set import secur perform size filter rule set grow difficult understand rule rule set preliminari research shown bdd rule set viabl method deal problem experi rule set consist rule show size bdd repres rule set moder importantli worst case lookup requir oper bdd facilit statist inform make averag cost lookup low work determin method repres rule wai repres boolean express examin efficaci bdd rule set valid rule varieti question human specifi check rule requir check effect rule feasibl bdd demonstr work improv user interfac final paper conjectur bdd start programm hardwar support filter worth explor conceptu framework undertak work implement hardwar perform evalu properli acknowledg work partial support foundat research develop research gratefulli acknowledg internet solut provid exampl real access list refer variabl order ieee transact bryant complex vlsi implement graph boolean function applic integ multipl ieee transact bryant boolean manipul order diagram acm comput cisco system configur ip system publish cisco web formal hardwar verif system user guid technic report depart comput british anonym ftp programm logic data book san
HCI/629 4 avoid resolut multipl access wireless network garc es avenu lo ca jj comput engin depart california santa california network secur center sun microsystem laboratori palo california introduc analyz avoid resolut multipl access multipl stabl channel access protocol wireless network multipl channel reli assign uniqu channel uniqu identifi node support correct determinist resolut presenc hidden termin dynam divid channel node cycl variabl cycl consist receiv period transmiss period receiv station packet send compet acquir floor receiv channel determinist algorithm receiv period consist resolut step singl round resolut idl control content step receiv period initi receiv place channel assign receiv station channel util packet delai studi analyt simul introduct network direct secondari direct occur neighbor node transmit time secondari occur station unawar exist transmit receiv time station transmit neighbor station transmiss station problem introduc literatur hidden termin problem approach past resolv hidden termin protocol recent receiv attent sender receiv collabor avoid data packet collid packet receiv traffic load control packet throughput system drop stabil oper protocol mean resolut mechan stabl mac protocol past base algorithm resolut protocol data packet resolv achiev throughput singl channel fulli connect network mac work support part advanc research project agenc grant protocol implement resolut control packet smaller data base abil transmitt abort transmiss rapidli detect stabl mac protocol achiev high build separ queue transmiss data addit stack queue control packet resolut stabl resolut approach report date oper network network base base station number protocol provid stabil high load level effici servic low load level resourc auction protocol requir amount overhead auction period difficult implement easi implement fix frame length lead starvat number activ station larg protocol requir base oper ad hoc network hidden termin paper present approach util resolut wireless network advantag uniqu channel assign network node network construct multipl transceiv oper separ fix channel devic current transceiv technolog enabl radio devic channel control singl enabl radio switch channel network construct singl devic station multipl channel render delai characterist network higher fault toler fade earli work protocol design network protocol multipl slot channel reserv protocol multipl channel investig satellit commun system sequenti system channel dynam assign station channel present analysi network network common channel assign present introduc stabl multipl access protocol resolut call avoid resolut multipl multipl channel protocol oper network hidden termin exist assum network node assign uniqu identifi uniqu neighborhood network node receiv initi protocol dynam divid channel assign receiv receiv transmit period transmiss period durat receiv period consist resolut step idl control protocol maintain stack transmiss control packet resolut determinist algorithm exchang receiv period receiv period initi receiv send signal place channel assign receiv station station attempt acquir floor content interv send packet intend receiv send clear send packet receiv rt determinist algorithm resolv request arriv receiv interv packet transmit station acquir floor successfulli complet round control packet content step smaller singl data packet determinist averag delai incur network bound function number neighbor receiv stark contrast prior approach oper correctli network hidden termin rest paper organ section ii describ detail section iii present packet delai channel util obtain section iv compar analyt result simul analyt result close result obtain valid approxim made analysi result confirm stabl load high throughput bound delai avoid data packet effici resolv control packet ii definit assumpt channel access time divid receiv transmit period station uniqu receiv channel neighbor transmit packet node station transmit packet uniqu receiv channel assign neighbor station switch default receiv frequenc frequenc assign neighbor assum exist mechan ensur station assign receiv frequenc station hop station knowledg assign frequenc neighbor assign frequenc achiev appli distribut assign code algorithm algorithm assign frequenc station provid number frequenc assign max dmax dmax maximum number neighbor station mechan elimin avoid hidden termin problem assign uniqu station assign uniqu identifi neighbor achiev exchang id time receiv frequenc assign station assum half duplex station sender state particip interv base determinist algorithm introduc determinist algorithm resolv compet sender cri evolv term size cri bound function number sender assum ternari feedback type idl step handshak procedur meant elimin data call procedur floor acquisit entail station time send data packet achiev station send multipl data packet send packet intend destin receiv packet transmit data requir minimum amount time function channel propag time station sender state particip cri uniqu receiv frequenc assign intend destin initi interv receiv receiv act master neighbor receiv uniqu id resolv content transmitt previou effici mac protocol base receiv maintain stack lowest highest id number station initi transmit defin id id interv broadcast receiv neighbor packet begin resolut step station transmit begin step transmit receiv data packet neighbor packet exchang place receiv assign channel station sender state wait intend receiv channel transmit data packet channel inform maintain exchang station assign uniqu identifi uniqu receiv channel neighborhood network node receiv station maintain stack variabl recal lowest id number send rt initi set highest id number send rt initi set largest number station network defin send id station id station send rt id sender intend receiv stack storag mechan id interv wait permiss send rt paper assum station maximum number station network maximum propag delai basic oper station data packet return receiv channel broadcast initi cri transmit receiv begin content station state cri specifi uniqu receiv id id interv station initi remain receiv end current cri end current cri station data packet switch channel intend receiv particip cri intend receiv end cri station packet remain receiv initi cri station engag cri sender remain receiv channel durat maximum cri transmiss period ch ch ch ch time receiv period fig channel receiv period transmiss period shown fig channel access time divid consist receiv period transmiss period cri receiv period sequenc initi station particip cri assum constantli monitor state channel transmit assum neighbor durat content step vari type step channel receiv period case station owner channel data packet send station remain receiv state initi case station channel shown fig station local packet station initi receiv period transmit channel assign station receiv station neighbor transmit begin station make transit receiv state visual small packet indic station station transmit readi receiv request floor inform id interv station compet acquir floor receiv station send occur receiv state default state activ station station receiv state local packet pend make transit sender current cri station resolv content current cri scan destin channel maximum durat cri heard interv station id id station compet acquir floor extend durat intend receiv channel acquir floor station acquir floor send rt station strategi transmiss rt direct receiv channel sender rt wait listen maximum time destin ct arriv ct corrupt receiv time station acquir floor transmit data packet train data packet ct station monitor channel detect handshak occur receiv lost ct contend station due error lead loss feedback inconsist feedback notic station acquir floor spend maximum cri durat maximum cri durat determin maximum number neighbor maximum cri durat station hear valid station transit back receiv state remain state end cri station transmit rt receiv station id occur due propag delai vulner time period equal propag delai sender determinist algorithm resolv detect absenc ct step cri initi type success idl step durat step durat success step durat size size rt size data maximum channel delai resolut interv determinist algorithm resolv algorithm present analyz detail station local packet send receiv oper execut station scan channel intend receiv inform contend resolut step multipl contend respond station send rt wait maximum time time destin send ct ct receiv alloc sender acquir floor start send packet ct receiv alloc station sender rt station compet floor detect algorithm start round rt receiv station divid id interv id interv id call id id receiv updat stack execut push stack kei push interv station updat valu id interv broadcast inform mark begin step oper repeat time recal step content case station rt state id id interv channel remain idl durat propag delai stack variabl updat receiv station execut pop command stack updat id interv valu case singl station rt send id li id interv singl station complet handshak acquir floor transmit data packet case station send id id interv station send rt creat station id interv split id interv stack variabl receiv station updat fig show station contend floor receiv initi cri cri sequenc initi iii channel util packet delai section deriv lower bound averag util channel upper bound averag delai station experi transmit data packet recal channel util defin amount time channel transmit data packet divid total time order simplifi assum station dmax neighbor station receiv frequenc channel neighbor assum channel similar behavior enabl studi util gener channel observ dmax number distinct receiv channel max dmax ch denot receiv frequenc channel ch receiv station station intend receiv dmax neighbor dmax neighbor potenti receiv station denot intend receiv dmax neighbor station send data packet transmit frequenc station ch channel frequenc defin dmax averag size maximum durat cri receiv dmax neighbor uniqu channel neighborhood network node time maximum number node determinist tree order deriv dmax make analyt result obtain number step dmax maximum number station dmax maximum number station particip averag number step requir resolv dmax dmax dmax dmax dmax dmax dmax averag number idl step requir resolv dmax dmax dmax dmax dmax dmax dmax step time step step step step channel receiv sender sender rt rt ct data rt rt rt rt data rt data rt rt rt rt ct ct data rt ct fig receiv intend receiv send initi cri notic step initi packet dmax dmax dmax dmax dmax dmax number success step dmax dmax dmax calcul multipli number step durat step type step idl step durat step durat success step durat size size rt size data maximum channel delai dmax dmax dmax recal channel receiv interv transmit interv station receiv mode remain mode end current cri station switch transmit mode transmit queue data packet assum station acquir floor transmit data packet start comput theorem upper bound averag delai station experi transmit packet station transmit packet wait dmax time maximum period time hear return channel initi cri hear transmit packet addit dmax interv impli durat longest transmiss period dmax sender sender receiv receiv interv send rt ct data time station return channel case case arriv send time station return channel fig transmiss period case arriv time interv dmax sender content floor case arriv sender return channel transit receiv mode protocol receiv spend time receiv transmiss queue station request floor channel receiv succe request time interv dmax worst receiv spend time transmit mode amount time receiv mode worst receiv constantli idl step neighbor request receiv data packet transmiss queue found receiv state forc receiv switch sender state remain state long durat idl step size packet maximum channel durat longest transmiss period dmax time sender target worst receiv probabl success dmax dmax probabl failur dmax dmax gener approxim event assum independ bernoulli trial probabl time station send data packet success probabl approxim geometr distribut function expect recal geometr random variabl count number failur success occur worst receiv readi prove theorem theorem system station dmax neighbor averag channel delai experienc station deliv data packet upper bound dmax dmax maximum durat cri deriv eq assum station intend receiv worst receiv time station transmit packet fail averag half time model true dmax station hear fail transmiss station return channel switch transmit state receiv state initi cri receiv cri end station transit back transmit state acquir floor channel assign intend receiv fail transmiss total cost dmax time wait expect durat cri station expect durat cri upper bound dmax dmax probabl cri station compet durat resolv initi procedur repeat time station fail deliv data packet retri cri receiv approxim retri event assum independ bernoulli trial probabl time station send data packet success probabl repres geometr distribut function expect expect number failur success averag time spend station transmit data packet written dmax dmax dmax dmax dmax observ data packet origin cri station receiv state case station remain receiv state switch sender state add expect durat cri dmax station switch receiv state sender state thesi fact worst receiv result deriv lower bound averag channel util theorem system station dmax neighbor averag channel util bound dmax number cri station remain receiv state leav channel transmit data packet number attempt station make transmit data expect number data packet receiv station averag durat cri dmax maximum durat cri size data packet frequenc station send data packet determin packet data rate approxim procedur geometr distribut function end cri coin probabl toss decid previou cri station packet send switch receiv state transmit state expect number cri occur station packet send number packet receiv probabl cri initi time resolv difficult expect durat cri upper bound dmax expect number packet receiv cri dmax station dmax dmax observ total durat total channel receiv period transmit period idl period channel number receiv period station data packet transmit channel determin expect geometr random expect arriv time packet packet station finish receiv current cri ad period total durat switch sender state station make trial deliv data packet explain theorem trial govern geometr distribut failur cost dmax number failur data packet deliv successfulli station hear channel intend dmax content successfulli deliv packet total period channel written total dmax dmax number cri expect durat cri expect number data packet transmit channel ch cri averag amount time channel ch transmit data packet thesi immedi divid eq eq iv simul order verifi analyt result obtain previou simul load perform experi total station surround dmax neighbor maximum number channel set max dmax packet creat station independ poisson gener simul repeat number time run averag hour trial assum network ethernet data packet transmit distanc station defin diamet network mile propag delai channel order accommod ip address destin minimum size chosen byte control packet assum byte maximum expect theoret packet delai dmax msec transmit load delai versu transmit load simul fig channel delai figur show packet delai function number data packet transmit channel load appli receiv number packet receiv receiv delai measur msec interv time arriv packet queue packet successfulli deliv packet delai individu trial theoret upper bound predict eq figur compar util deriv analysi obtain simul function receiv load obtain util channel count interv time data packet transmit channel divid total simul time simul result valid analyt result avoid resolut protocol work correctli wireless network protocol base determinist requir node assign uniqu identifi channel uniqu neighborhood node resolv mayor sourc packet failur busi resolv intend receiv initi commun remain receiv end cri station send data packet receiv readi receiv issu station hop receiv frequenc receiv load channel util versu receiv load analysi simul fig channel util resolv determinist algorithm analysi show averag channel delai incur bound function maximum number simul result valid simplifi assumpt made analysi refer auction multipl access effici method fast resourc assign decentr wireless electron april compat determinist proc ieee infocom brewster model sequenti network throughput electron vol pp ji algorithm packet broadcast ieee tran inform pp sept analysi network noisi ieee jj acquisit multipl access proc acm sigcomm august resolut random access broadcast proc afosr workshop commun theori ma sept garc jj avoid resolut multipl access cluster vol pp jj assign code proc ieee novemb dj ra kt reserv multipl access local wireless commun ieee transact throughput perform packet radio network transmit power ieee dong choi perform evalu medium access control protocol local wireless data transact decemb channel access method packet amateur radio comput network pp protocol fast resourc assign wireless ieee transact vol pp switch radio part carrier mode ieee tran vol pp reserv protocol packet electron vol pp delai multicast scheme fade ieee int confer person local area network ieee vol pp simul studi delai ieee tran vol resolut algorithm random access commun ed pp perform packet radio ieee vol pp bs nb bound capac random multipl access problem inform vol pp
IR/630 5 data resourc select distribut visual inform system wendi chang jia wang zhang depart comput scienc state york buffalo ny usa abstract advanc multimedia popular access larg imag video repositori distribut world challeng problem access inform respect summar enabl intellig select relev site base visual queri paper present approach solv problem base imag index queri distribut server record summari visual content imag imag templat statist featur similar distribut imag select search rank algorithm queri similar templat featur templat select term present select mechan implement extens experi perform demonstr effect select approach introduct popular access larg imag video repositori distribut world access increasingli import number medic distribut publish inform visual distribut remot locat made locat rang inform electron commerc typic queri gener client distribut visual select target visual pose queri respect accept form search mechan search repositori answer pose queri answer fed back client gener term illustr figur queri distribut metasearch agent current depart comput rochest institut ny current imag video process lg electron research nj imag imag video meta client client client client browser browser browser browser metasearch agent figur global integr distribut visual inform system deal growth visual inher complex visual data crucial perform care select site order support effici queri custom specif paint imag galleri time effici approach produc rank imag galleri respect desir paint prospect buyer start search highli rank galleri select approach design direct text queri section present overview approach case visual text annot index inform approach subject suffer inflex text annot fail captur content imag advent techniqu approach visual select base featur content imag develop effect facilit visual content adequ summar observ select index record summari visual content imag suitabl abstract form search involv determin visual similar queri abstract visual inform record similar measur captur visual similar imag imag templat templat repres underli imag featur introduc section distribut similar valu imag templat deriv statist featur comput captur likelihood imag relev templat statist featur describ link templat store visual similar templat comput similar compar metadata deriv rank respect pose queri present select term problem select gear handl visual queri approach number varianc similar distribut imag templat determin likelihood visual queri approach base statist similar distribut locat imag imag cluster rest focu discuss imag design principl directli appli video paper organ section introduc relat work select section present select search approach rank base templat similar visual queri present section detail experi compar select approach report section conclud remark offer section relat work give overview exist approach select relev queri select work handl text inform research conduct central index site select central index maintain descript particip content gener model set attribut select relev straightforward consist boolean combin desir submit central user hint search wai area inform divid indic set server index provid directori maintain set describ content particip server directori server search queri forward select underli server indi server consist replic directori servic collect broker indi broker maintain gener object describ indi broker gener object consist textur abstract boolean express set bibliograph field visibl user broker regist gener object directori servic user queri submit directori produc rank list broker descript pertain user queri central index approach adopt search facil creat wwww web server lyco alta vista scale grow number www system index url document titl small fraction document aliweb index server maintain index particip www server system provid approach search electron text archiv metadata organ site select techniqu straightforward research advanc approach select site retriev text inform investig advanc work categor base inform retriev model gloss glossari server boolean retriev model document retriev estim number potenti relev document queri al vector space retriev model comput similar queri train queri relev judgment obtain train queri determin retriev queri inqueri server probabilist retriev model search potenti relev inqueri summar document term frequenc inform keyword term document frequenc term infer network inform rank collect queri site select approach base artifici intellig techniqu earli system expert retriev system expert decid basi match queri describ document collect produc rank list highli visual graphic natur web popular imag video appar select method base text inform suitabl remot user queri unanticip refer imag content imag retriev system develop recent system oper distribut environ select visual queri discuss paper offer approach design distribut visual inform system select approach web search engin visual data resourc web collect select index support effici visual relev select visual queri detail examin imag match desir move complet machineri imag search engin determin relev creat index set site relev imag requir anticip visual queri address intermedi approach inform imag summar repres suitabl abstract form relev queri determin search involv determin visual similar queri abstract visual inform record abstract imag templat formul select strategi imag templat abstract current research visual data consid featur vector repres content data approach develop classifi data cluster cluster repres featur denot gener centroid cluster cluster classifi repres centroid benefit approach hierarch index built templat support effici queri retriev figur show featur space cluster arbitrari shape object featur space shown cluster classifi subclust centroid shown templat cluster approach select templat find select sampl imag semant cluster local hierarch cluster build structur sampl imag call cut result set cluster centroid result cluster templat process appli semant cluster find templat templat repres imag local method find good set templat repres content relat content templat calcul statist metadata respect templat statist metadata site select approach figur subclust centroid similar measur base distanc featur vector imag featur repres highest similar repres similar measur determin comput featur shape imag defin similar measur effect measur captur visual similar imag templat demonstr show exist similar rang distinct cluster figur present textur imag templat sampl imag imag cluster similar valu note templat imag shown figur imag closest featur vector templat imag cluster similar measur rang similar set respect cluster similar measur rang similar set respect templat color templat match sampl shown figur cluster similar set similar measur rang cluster similar set similar measur rang imag templat visual abstract base observ figur illustr similar properti featur space templat gener locat center imag imag similar featur locat small distanc imag similar featur locat larg distanc imag distanc templat imag similar small distanc locat shade area similar distanc templat figur imag cluster small distanc similar distanc templat featur extract system gener close locat featur vector featur space similar figur templat textur color featur figur relationship imag templat observ imag similar measur templat similar ae threshold determin note imag similar necessarili similar imag similar measur templat similar shown figur imag similar distanc templat distanc larg similar assum visual templat configur cluster visual support effici visual retriev focu investig strategi design select approach design metasearch agent support select set initi construct imag templat mean visual abstract time regist metadata suppli metadata includ type media data expect queri special algorithm statist metadata statist metadata collect select approach distribut similar imag respect imag templat collect statist number varianc similar comput store metadata addit distribut rel posit imag respect imag templat collect rel imag group partit imag templat histogram repres similar distribut imag partit deriv store metadata similar locat imag respect templat precomput imag featur extract algorithm develop organ hierarch structur lowest site group group base number imag similar templat defin imag similar templat similar measur greater threshold site group templat higher templat group featur includ textur color shape node repres gener categori color shape hierarch organ templat similar imag cluster organ present individu visual templat present gener superset templat present individu visual figur present conceptu view color shape textur db db db site templat featur class figur conceptu view role accept user queri transform inform queri suitabl search distribut queri select site relai back user distribut rel posit comput background process collect directli regist server metadata collect process metadata collect process affect effici queri retriev organ metadata support effici retriev imag queri queri process receiv queri imag video extract set subqueri fq subqueri repres featur class denot templat exist featur class similar subqueri templat comput set match templat ft subqueri select base ft similar subqueri templat threshold similar subqueri templat greater threshold templat highest similar user submit queri distribut queri visual invok select subqueri similar match templat statist inform return list relev site specif subqueri rank subqueri merg yield final set queri set subqueri match multipl independ templat select approach determin set relev subqueri determin db final set relev set relev imag similar set relev denot db calcul intersect db figur show relationship templat subqueri textur featur subqueri color featur extract queri imag subqueri textur featur match templat subqueri color featur match templat group templat db db group templat db db group templat db db invok select approach determin relev specif subqueri fdb db db db top rank chosen subqueri textur fdb db db db top rank chosen subqueri color featur select approach return set relev queri imag intersect db fdb db db chosen db rank fdb db db base merg algorithm introduc section approach design calcul set present select approach section db db db db db select approach select approach db db db textur shape color text imag queri metadata match templat match class identif imag templat featur class db db db db db db db db db figur templat select approach present select term rank base visual similar queri imag templat terminolog ensu ffl set ffl number imag db similar greater threshold respect templat ffl number imag db similar rang respect templat set partit term introduc section approach similar interv defin similar interv queri respect templat similar interv similar rang center similar ffi ffi ffi predefin offset interv specifi similar rang search similar imag queri queri templat similar interv approach site imag similar fall select formula approach visual db set imag cluster db fc observ analyz characterist similar distribut db respect templat observ templat repres cluster db cluster overlap cluster db similar distribut imag respect templat threshold approxim standard normal curv figur show similar distribut imag respect main imag cluster cluster repres templat overlap cluster similar distribut threshold approxim standard normal curv select approach develop base observ approach highli effect similar distribut scenario figur cluster overlap featur shown figur cluster overlap cluster repres templat select approach overlap cluster treat larg cluster cluster overlap complet greatli reduc classifi cluster produc smaller cluster templat repres main cluster shown figur major imag similar probabl similar probabl similar figur similar distribut imag templat distinct overlap imag similar templat similar templat number imag similar templat greater threshold select approach effect elimin similar distribut imag respect templat threshold calcul varianc distribut number imag db similar templat greater equal threshold valu templat belong featur class calcul similar db respect templat time db regist updat ad delet imag repres instanc similar estim similar db db respect templat confid interv return interv db db db fall db db db estim confid level indic chanc db fall rang small chanc db rang confid interv db db respect templat calcul db db normal distribut elimin similar imag templat limit default db db valu set db db exist templat store metadata popul normal distribut center assum larg number imag similar respect templat rang db db shown figur probabl similar ab ab figur interv similar distribut imag templat subqueri match singl templat substanti number imag similar confid interv db db fall similar interv select set relev db db db select rank order subqueri match multipl independ templat ft templat similar featur queri match templat similar interv calcul select confid interv db db fall fdb db db db db rank select subqueri order db db offset ffi fall similar interv approach favor imag similar larger gener smaller confid likelihood fall complet similar interv approach present select term approach approach detail characterist similar distribut imag approach relev region observ locat close featur vector imag featur space approxim similar imag describ determin relev region subqueri uniformli divid imag cluster repres templat small partit center templat base imag featur featur space consist select import featur import featur featur space select principl main idea principl introduc rotat featur space featur import rotat elimin unimport featur retain fewer import featur featur space repres rectangular coordin system import featur dimens ax coordin system defin cut parallel axi pass templat divid imag cluster yield partit cut divid imag cluster denot partit repres vector hv fd partit featur space vector domain hd intersect portion portion illustr figur imag cluster divid portion top portion bottom portion cut divid imag cluster portion portion left portion defin partit hd hd hd hd figur imag cluster divid import featur coordin templat coordin subqueri imag comput vector hu mod subqueri group partit templat figur subqueri coordin group vector hd equal vector partit note import featur origin featur vector featur retriev imag subqueri similar sim templat relev region respect defin area partit intersect similar interv defin formula figur show definit relev region subqueri locat partit featur space select approach develop base relev region repres histogram similar imag db templat partit number imag partit similar subqueri relev region good estim area match highli relev imag subqueri fall site imag relev region consid relev imag rank higher figur relev region partit queri match partit queri imag repres set subqueri fq set match templat ft select formula featur space repres rectangular coordin system coordin subqueri match templat comput match templat coordin set partit fc comput partit subqueri coordin formula addit partit subqueri fall adjac partit select subqueri locat boundari partit fh neighbor partit chosen fb boundari partit fh set select partit subqueri denot defin fc fh oe distanc subqueri oe threshold vari dimens subqueri default maximum distanc featur repres dimens select formula approach subqueri match singl templat set partit fc calcul formula select relev maximum number imag partit set relev denot defin db db total number imag fall relev region partit respect templat select rank base valu scenario illustr figur repres set relev imag queri repres set imag rank subqueri match multipl independ subqueri similar distanc match templat subqueri match multipl independ templat set partit fc match templat formula db db total number imag fall relev region partit respect templat select rank base valu figur illustr scenario featur subqueri similar distanc templat shade area repres imag sum relev region locat figur approach queri match multipl templat result present section show perform select approach deterior subqueri match multipl templat attribut larger number irrelev imag gener includ rank subqueri match multipl templat shown figur merg select multipl subqueri present strategi rank chosen db merg result return select approach subqueri goal deriv final rank chosen effect merg approxim effect search entir set queri imag approach merg multipl search result al address problem learn result train queri gravano merg result multipl sourc idea submit queri multipl search engin search engin return attribut valu score function appli score function common attribut deriv final score approach suitabl visual subqueri complet common attribut fox al statist method merg search result score return search engin multipli number document collect similar queri statist model calcul target score chosen subqueri queri fq ft set templat match subqueri formula db fdb db final set chosen queri formula fs db db number similar imag select approach rank subqueri db db select unselect db db db db estim score subqueri comput normal number similar imag return select approach multipli weight estim score db subqueri summar gener target score db queri illustr formula ts db db db db site db db rank base order ts db weight db determin base similar subqueri match number match human percept respect visual featur class observ estim number similar imag respect subqueri return select approach accur similar queri match templat queri match singl templat visual featur weight equal human visual percept db defin averag similar subqueri templat divid number match templat multipli percept featur db default adjust user satisfi prefer visual featur figur number similar imag rank select approach top rank fdb db db db chosen subqueri textur featur textur subqueri match templat similar number similar imag rank select approach top rank fdb db db db chosen subqueri color featur color subqueri match templat similar target score intersect fdb db db calcul db db db chosen queri imag rank fdb db db test valid present experi demonstr effect select approach evalu perform merg algorithm collect set color imag internet imag size perform imag segment subimag repres individu visual featur uniform segment term segment imag size imag segment smallest size pixel gener larg number similar imag segment partial overlap imag segment segment imag test imag group tabl summar characterist cluster techniqu develop featur vector configur repres underli textur featur test imag color featur vector configur visual featur show imag garden area collect imag build misc materi food industri imag paint beach imag sand sky collect food imag collect food fabric imag imag metal collect miscellan imag imag imag flower leav imag imag tabl summari characterist test closest featur vector figur extract textur appli wavelet transform color system find color histogram quantiz method distanc similar imag templat calcul euclidean distanc histogram textur color featur experi conduct dedic sun ultra gigabyt memori mhz ultrasparc cpu averag time system list relev amount storag space requir metadata larg depend number templat present number regist set statist metadata store templat number templat number requir storag storag store featur vector templat inform type data expect queri special algorithm monetari latenc site detail comput model metadata storag requir found approach requir mbyte figur templat textur color templat perform metric select recal measur correct complet select fdb db set top site select select approach rdb set site manual judg imag relev queri rank posit integ repres highest rank rank determin select approach relev rdb lowest rank calcul select recal ffl number relev site greater equal compar top select site top relev gj gj db gj recal equal ffl number relev site relev site top chosen select approach recal calcul compar top site select select approach relev gj gj db gj recal equal ffl number relev site relev site top chosen select approach recal calcul compar top site select select approach relev gj gj db gj gj rdb gj perform subqueri present test result base queri queri textur color subqueri threshold select multipl templat formula set textur color subqueri similar textur subqueri templat rang color similar rang number subqueri respect number match templat rang similar summar tabl textur subqueri match singl templat similar rang subqueri match multipl similar rang determin averag similar subqueri match templat note order perform examin select chose queri match multipl textur templat chose queri sim match textur templat ffi offset determin formula default approach textur color subqueri ffi offset set textur subqueri color subqueri threshold approach determin number similar imag set textur subqueri color subqueri threshold set sim rang total queri total queri templat sim rang total queri templat total queri tabl distribut number subqueri base number match templat similar textur color subqueri calcul averag valu subqueri compar top ideal rank top return select approach ideal rank site subqueri determin measur similar subqueri imag imag high similar sim respect subqueri consid relev subqueri relev rank base number highli similar imag top rank experi top ideal rank select import featur textur color featur class partit featur space imag cluster divid partit imag group partit formula templat histogram gener repres similar distribut imag partit textur oe threshold select multipl partit formula set featur featur color oe threshold set featur result report tabl show averag valu function number match templat similar rang select perform experi measur level repres high repres good repres medium low repres low tabl textur approach offer similar perform sim rang templat averag averag sim rang templat averag averag tabl approach result function number match templat similar textur color subqueri approach slightli approach perform significantli color subqueri approach yield perform color subqueri textur subqueri approach perform subqueri match singl templat similar subqueri templat high observ approach subqueri match singl templat multipl templat explain compar figur irrelev imag gener includ rank subqueri match multipl error observ deterior approach similar subqueri templat low similar high approach offer high select result mix similar rang observ similar subqueri templat low templat longer provid sound basi estim merg select multipl subqueri analyz effect merg algorithm select approach calcul averag valu queri compar top ideal rank queri top return merg algorithm ideal rank site queri base number imag high similar respect textur color subqueri sim rang averag averag templat sim rang templat averag averag tabl approach result function number match templat similar textur color subqueri merg algorithm return top intersect top return select approach subqueri number intersect merg algorithm intersect top return select approach subqueri process repeat intersect intersect rank formula percept weight set color textur subqueri number queri respect number match templat rang similar summar tabl queri match singl textur templat singl color templat similar rang similar rang determin lowest similar subqueri match textur color templat sim rang templat textur color total queri total queri tabl distribut number queri base number match templat similar rang select perform experi measur level repres high repres good repres medium low repres low test result report tabl sim rang templat averag averag textur color sim rang templat averag textur color averag recal recal tabl result final rank return merg algorithm select recal averag queri similar averag textur subqueri lower averag color subqueri approach perform queri match singl textur singl color templat approach offer perform recal approach perform similar queri templat high approach perform similar queri templat rang observ approach similar queri templat low discuss base approach offer perform approach good high approach demonstr estim method rank effect individu rank approach perform subqueri match sim rang templat averag averag textur color sim rang templat averag textur color averag recal recal tabl result final rank return merg algorithm select recal singl templat similar subqueri templat high approach perform significantli approach subqueri match singl templat approach outperform approach subqueri match multipl templat chose subqueri match multipl templat low similar match templat situat subqueri match singl templat high similar match valu textur subqueri approxim approach approach valu color subqueri approxim approach approach textur color featur weight perform final rank return merg algorithm similar perform textur subqueri similar approach perform queri match singl color templat test perform final rank improv weight assign color featur recommend threshold formula set note approach requir higher storag approach approach requir statist data number confid templat pair approach requir storag histogram partit templat pair storag requir approach cut store portion histogram cover similar interest test store portion histogram cover similar rang interest similar rang present select approach address problem determin relev site visual queri base visual content achiev abstract visual inform imag templat captur statist featur similar distribut imag indic refer select relev achiev search visual similar queri store templat rank templat select mechan implement approach offer perform approach experi good perform low storag requir approach make estim method viabl altern rank refer special issu imag retriev editor gudivada raghavan ieee jr jain visual inform manag system interact retriev face ieee transact knowledg data croft search distribut collect infer network annual sigir search agent multimedia access internet fourth ieee intern confer multimedia comput system page june effici resourc select distribut visual inform system acm novemb chang zhang metadata distribut visual access ieee metadata silver septemb distribut index autonom internet servic technic dept comput southern june dom al queri imag video qbic system ieee fox shaw combin multipl search text retriev confer page gener gloss broker intern confer larg data page gordon classif method exploratori analysi multivari data chapman gravano merg rank heterogen internet sourc intern confer larg data kahl inform system corpor wide area inform server novemb wai access kaufman find group introduct cluster analysi john wilei koster index web comput network isdn aliweb access lee combin multipl evid properti weight scheme intern acm sigir confer research develop inform page marcu comparison effect comput human search intermediari journal american societi inform mcbryan tool tame web annual intern world wide web page web worm access ng han effici effect cluster method spatial data mine vldb page support retriev larg imag system intern journal multimedia tool march zhang approach cluster larg visual wavelet transform spie confer visual data explor analysi san februari geograph data classif retriev acm intern workshop geograph inform page la novemb john smith chang fulli autom imag queri system acm multimedia page boston ma probabl statist comput scienc applic prentic collect fusion problem text retriev confer page acharya color cluster techniqu imag retriev fourth ieee intern confer multimedia comput system page june watanab featur compress advanc inform system page plenum framework integr distribut visual ieee tian raghu livni effici data cluster method larg acm sigmod intern confer manag page
IR/631 5 document analysi result han georg karypi depart comput scienc armi research center mn technic updat march abstract recent year tremend growth volum text document digit intranet automat text task assign text document class import task organ find inform huge resourc text categor present uniqu challeng due larg number attribut present data larg number train attribut depend paper focu simpl document classif simplic robust extens studi analyz extens experi show classifi consist substanti outperform algorithm naiv wide rang dataset analysi show similar measur scheme classifi document base close behavior match behavior document belong measur averag similar document match dynam adjust class densiti analysi show similar measur scheme account depend term class featur reason consist outperform classifi depend account introduct tremend growth volum onlin text document digit intranet forecast document unstructur predomin data type store onlin huge opportun make work support nsf armi research offic contract doe armi high perform comput research center contract number access comput facil provid minnesota supercomput institut relat paper www effect collect grow tool deal text document automat text categor task assign text document class import task peopl find inform huge resourc text categor present uniqu challeng due larg number attribut present data larg number train attribut categori led develop varieti text categor algorithm address challeng vari paper focu simpl document classif algorithm extens studi analyz simplic experi robust perform centroid vector comput repres document document assign class correspond similar centroid measur cosin function comput complex learn phase algorithm linear number classif complex linear number class extens experi present section show classifi consist substanti outperform algorithm naiv wide rang dataset surprisingli good classif perform scheme suggest util power classif model paper present analysi analysi show similar measur scheme classifi document base close behavior match behavior document belong measur averag similar document match dynam adjust class densiti analysi show similar measur scheme account depend term class featur classifi reason consist outperform naiv bayesian depend account remind paper organ section overview algorithm document categor section describ document classif algorithm section evalu algorithm varieti data set section analyz classif model classifi compar algorithm section direct futur research previou work document categor algorithm develop year fall gener categori categori tradit machin learn algorithm rule probabilist support vector directli adapt context document data set categori special categor algorithm develop inform retriev commun exampl algorithm includ relev linear gener instanc set rest section briefli describ algorithm discuss merit document categor nearest neighbor neighbor classif learn algorithm appli text categor earli dai research shown produc result compar machin learn algorithm ripper classif nearest neighbor test document comput similar document nearest neighbor aggreg class test document assign similar class measur aggreg major drawback similar measur featur equal comput similar lead poor similar measur classif small subset word classif address varieti techniqu develop adjust import term set exampl techniqu includ preset weight adjust mutual inform relief similar metric learn tree wide classif paradigm machin learn data mine tree model built split train set base local optim criterion record belong leaf node bear class label wide classif algorithm shown produc good classif primarili low data set characterist document data set larg number featur class tree base scheme work scenario due overfit overfit occur number sampl small respect number distinguish lead larg tree limit gener abil naiv bayesian naiv bayesian algorithm wide document shown produc good perform naiv bayesian algorithm comput posterior probabl document belong class assign class highest posterior probabl posterior probabl class test document comput rule assign class highest posterior class arg max arg max total number class naiv bayesian algorithm model document vector term im model presenc absenc term naiv bayesian comput quantiti requir equat approxim class prior comput maximum likelihood estim set train document number train document comput assum condit class occurr statist independ occurr term assumpt classifi call bayesian comput equat vari model chosen document popular model repres document bernoulli event model account presenc absenc account term frequenc model multinomi model captur word frequenc inform fact independ assumpt naiv bayesian hold real document data classifi perform surprisingli practic domingo pazzani provid explan good perform classifi argu classifi estim underli probabl densiti provid good solut term loss linear classifi linear classifi famili text categor learn algorithm learn featur weight vector categori weight learn techniqu rocchio algorithm learn featur weight vector train sampl weight learn algorithm adjust featur weight vector featur word contribut significantli categor larg valu test document determin belong categori dot product test document featur weight vector greater threshold gener instanc set algorithm gener instanc set algorithm text categor algorithm combin advantag knn linear classifi featur weight vector categori linear classifi regard singl gener instanc categori featur weight vector effect summar entir categori multipl gener instanc found categori gener instanc featur weight vector learn set similar train sampl test document classifi sum similar gener instanc gi inherit express power knn multipl featur weight vector categori avoid problem knn learn featur weight weight learn techniqu linear classifi support vector machin support vector machin learn algorithm vapnik algorithm introduc solv pattern recognit problem structur risk minim principl train set vector method find hyperplan separ class qualiti hyperplan determin distanc hyperplan parallel hyperplan touch closest data point class hyperplan maximum margin svm problem solv quadrat program techniqu svm extend applic linearli data set soft margin map origin data vector higher space data point linearli separ effici implement svm applic text categor corpu report document classifi classif document repres model document consid vector simplest document repres vector tf tf tf tf frequenc term document wide refin model weight term base document frequenc document collect motiv weight term frequent document limit discrimin reason commonli multipli frequenc term total number document df number document term document lead tfidf tf tf order account document length document vector normal unit tfidf rest assum vector document weight normal unit length similar document commonli measur cosin function denot vector document vector unit formula simplifi set document vector defin centroid vector vector obtain averag weight term present document refer support set centroid analog similar centroid vector document centroid vector comput cosin measur note document vector length centroid vector necessarili unit length idea classif algorithm extrem simpl set document belong comput centroid vector class train lead centroid vector centroid class class document determin term comput train set comput weight scale unit length comput similar centroid cosin measur base assign class similar centroid class arg max comput complex learn phase classifi linear number document number term train set comput document easili comput perform pass train set centroid comput singl pass train centroid comput averag document class amount time requir classifi document number term present comput complex algorithm ident fast document classifi naiv bayesian result evalu perform classifi compar naiv classifi varieti document collect obtain naiv bayesian result rainbow softwar librari rainbow implement naiv bayesian algorithm text classif rainbow option bernoulli event model multinomi event model experi report show multinomi event model work bernoulli event model experi result obtain local modifi version algorithm capabl handl data set result obtain document classif document collect data sourc doc class min class size max class size avg class size word west group west group west group trec trec trec trec trec trec trec trec trec trec fbi trec trec wap webac tabl summari data set characterist document collect experi summar tabl data set collect legal document publish west group data set deriv collect data set fbi foreign broadcast inform servic data data set lo angel time data class fbi data set gener relev judgment provid collect class label gener section articl data set text categor test collect distribut divid label set construct data set data select document singl label data set ohsum collect subset medlin document index uniqu categori subset categori construct data set data set wap webac project document correspond web page list subject hierarchi data remov common word stem porter algorithm classif perform classif accuraci algorithm data set testb shown tabl result correspond averag classif accuraci experi experi document randomli select train remain test set column show result naiv neighbor column show result achiev classif algorithm data boldfac font highlight algorithm achiev highest classif accuraci nb knn fbi wap tabl classif accuraci achiev classif algorithm result tabl naiv bayesian outperform scheme data scheme algorithm outperform scheme accur comparison scheme obtain extend perform scheme statist scheme statist test compar accuraci result obtain classifi test base resampl pair test test base sign test descript test present appendix statist result resampl pair test summar tabl pair classif show number data set perform statist similarli scheme compar naiv ten data data statist similar twelv data set compar statist similar data set compar scheme statist similar data set statist result sign test summar tabl pair nb knn nb knn tabl statist comparison classif algorithm resampl pair test entri tabl show number data set classifi row perform similarli classifi column cation show comput base averag classif accuraci trial greater classifi row statist classifi column scheme naiv naiv bayesian similarli respect knn knn nb knn nb knn tabl statist comparison classif algorithm sign test valu tabl valu greater show classifi row statist classifi column simpl classif algorithm outperform remain naiv bayesian note rel rank similar result report previou work analysi surprisingli good perform classif scheme suggest emploi sound underli classif model goal section understand classif model compar scheme order understand model understand formula determin similar document centroid vector class comput essenti determin class equat similar ratio divid length set document creat equat averag similar measur cosin document document set mean length centroid vector easili understood fact equat length centroid vector averag similar document support centroid thing note averag similar includ document support document scale unit length centroid vector equal similar test document centroid vector averag similar test document document divid averag similar document class altern deriv formula present discuss qualit understand centroid scheme determin similar test document class comput averag similar test document document amplifi base similar document class averag similar document class small class amplif averag similar high class amplif smaller understand classif model simpl binari classif refer averag similar item averag similar item averag similar item test item averag similar item set illustr figur classifi base close behavior match behavior item class item class measur averag similar figur simpl binari classifi behavior model ratio compar ratio ratio measur stronger intern similar item belong class rel similar item belong class ratio measur stronger intern similar item belong class rel similar item belong class measur stronger similar item compar item classif algorithm assign class assign class compar strength similar class rel strength similar item side strength similar class rel strength similar item side assign class rel strength higher perform simpl algebra manipul equat cancel term side inequ extend problem tournament assign class highest class earlier case data item problem document similar comput cosin equat assign class iff assign class centroid vector class classif model document classifi ident assign document class document match behavior measur averag document similar comparison classifi advantag scheme summar characterist form centroid vector similar summar perform naiv form distribut function exampl centroid vector collect document shown tabl collect section tabl show ten highest weight term number term tabl weight term centroid vector note term shown tabl actual stem advantag summar perform centroid vector combin multipl preval featur featur simultan present singl document promin dimens centroid vector highest weight correspond term frequent document necessarili set document import high data set coverag individu featur low case summar addit benefit address issu relat commonli synonym repres centroid vector centroid vector shown tabl instanc tenth centroid wap synonym term album centroid synonym japan classif algorithm naiv tend perform neighbor classif algorithm perform scheme naiv bayesian classifi due method comput similar test document class case naiv assum condit occurr term independ true real document collect understand depend term term document class term term posit probabl term high provid term term posit depend point rise neg depend term condit probabl term high provid term exist posit neg depend term class naiv bayesian comput distort estim probabl document belong class posit depend term probabl estim higher neg depend probabl estim smaller naiv bayesian account term complic classifi bayesian network similar function scheme account term depend class discuss section similar document class comput ratio quantiti averag similar document averag similar document class larg quantiti probabl estim naiv bayesian suffer similar problem case term depend case naiv class term posit averag similar document class tend match term class neg depend averag similar document class small unnecessarili penal match neg depend term quantiti similar averag similar document account term depend averag similar depend term document averag similar document class document high term similar pair document comput cosin high document similar set averag similar document term averag intern similar amplifi similar test document amplif minim larg posit depend term posit depend amplif act correct paramet account similar comput quantiti similar function featur classif scheme reason outperform naiv bayesian classifi experi shown section perform differ understood real document data set set document stori categori set document sport stori document word clinton word frequent word document belong categori word clinton document sport relat word document put document categori stori presid clinton reaction major leagu labor disput player owner stori word clinton naiv bayesian classifi easili misclassifi document assign word clinton high condit probabl categori lower condit probabl categori classifi classifi document similar categori indirectli penal document term discuss conclud remark paper simpl document classif algorithm evalu shown classifi consist substanti outperform classifi wide rang data set shown power classifi due function comput similar test document centroid vector class similar function account term similar test document document depend term present document wai improv perform classif algorithm current form suit handl class support easili incorpor cluster algorithm partit document class multipl potenti mode similar techniqu gener instanc set classifi classif perform improv techniqu adjust import featur set varieti techniqu develop context classif extend classifi refer amin shekhar gener neural network proc intl conf data april baker mccallum distribut cluster word text classif eh moor document categor queri gener world wide web webac ai review eh moor cluster web document categor support system ww cohen fast effect rule induct proc twelfth intern confer machin ww cohen hirsh join text classif whirl proc fourth intl confer knowledg discoveri data cort vapnik support vector network machin thompson automat categor document proc asi classif research dr jo dr jw tukei approach larg document collect acm page page dj spiegelhalt michi cc taylor machin neural statist classif elli learnabl acquisit stress technic report tr institut languag technolog artifici tilburg bv dasarathi nearest neighbor nn pattern classif techniqu ieee comput societi tg dietterich approxim statist test compar classif learn algorithm neural domingo pazzani optim simpl bayesian classifi loss machin ro duda pe hart pattern classif scene analysi john wilei goldszmidt bayesian network classifi machin goldberg genet algorithm optim machin learn eh moor web agent document categor proc intern confer autonom han text categor weight adjust neighbor classif phd octob tj interact retriev evalu larg test collect research page text comparison categori search strategi page joachim text categor support vector learn relev featur proc european confer machin kira la rendel practic approach featur select proc intern confer machin kononenko estim analysi extens relief proc european confer machin wai lam chao yang ho gener instanc set automat text categor larsen aon fast effect text mine document cluster proc acm sigkdd intl confer knowledg discoveri data page lewi naiv independ assumpt inform retriev tenth european confer machin lewi gale sequenti algorithm train text classifi lewi ringuett comparison learn algorithm text categor proc annual symposium document analysi inform lewi text categor test collect distribut david robert jame ron papka train algorithm linear text classifi annual intern acm sigir confer research develop inform page page dg low similar metric learn classifi neural page januari waltz classifi stori memori base reason page mccallum nigam comparison event model naiv text classif workshop learn text andrew mccallum toolkit statist languag text classif cluster tm mitchel machin learn mobash web page categor featur select associ rule princip compon cluster workshop inform technolog dec porter algorithm suffix strip ross quinlan program machin learn morgan san forrest research cope complex data forrest april riloff lehnert inform extract basi text classif acm transact inform jj jr rocchio smart retriev experi automat document process gerard relev feedback inform retriev salton automat text retriev inform comput gw wg cochran statist method iowa state trec text retriev confer natur statist learn theori sm weiss kulikowski comput system classif predict method neural machin expert system morgan san dw mohri review empir evalu method class lazi learn algorithm ai wettschereck tg dietterich comparison nearest neighbor nearest hyperrectangl algorithm machin widrow sd stearn adapt signal process yang expert effect effici learn human text categor retriev yang evalu statist approach text categor inform retriev yang cg chute map method text categor retriev acm transact inform yang liu text categor method yang pederson compar studi featur select text categor proc fourteenth intern confer machin measur statist resampl test measur statist differ perform classif algorithm resampl pair test test compar perform classif algorithm base result trial data set randomli divid train set test set error rate algorithm test set record error rate algorithm error rate algorithm trial student test comput statist distribut freedom trial experi report section null hypothesi classifi term perform reject sign test statist test compar classif algorithm sign test data number data set classifi classifi term classif accuraci pq probabl classifi classifi null reject null hypothesi classifi term perform diana film notabl angel annual albert lo award festiv cb tv rate adult abc household program fox studi research cell risk cancer patient disea women heart drug newspap editor adverti media coverag percent journalist press circul exhibit auction art draw paint galleri van film box million star offic weekend festiv pictur top movi stock dow compani percent greenspan industri busi financ wire pr cabl network fcc rate usa channel deal week weekli publish book fo morton album music record song band concert sold rock stone diana clinton senat white campaign reform republican financ vote presid game smith coach season win se player charact film david music product review michael sound john costum internet microsoft comput zdnet access servic reserv technolog compani ticket opera theater broadwai receipt week net farm legion miami aid concert internet onlin comput servic microsoft web america site compani compani stock usa network million stake daili insid front fox tv film ink deal pictur dvd game player toshiba video digit compact alien wast dump water pollut sea environ river nuclear russia export russian control technolog russia missil german arm dual japan japan tokyo trade insur talk market framework auto nuclear korea north korean inspect seoul al isra arab israel abu terrorist grain agricultur price rice product percent farm market farmer rural newspap publish press media public editor russian magazin book print murder al kill polic terrorist crime court death peopl nuclear korea north weapon korean prolif drug polic arrest kg mexico job american trade worker export women domest crime abu speaker victim bill prevent china trade clinton human polici earthquak quak insur disast california volcano dollar speaker amend submarin defenc nuclear missil paper price cent mill compani profit cost tax pound cent incom rate tax budget uk drug polic crime speci endang blank mammal marin wolf africa kill african project dam power electr river construct vw lopez gm motor german compani hou pound properti home liv retir life peopl social fuel energi nuclear reactor electr power coal cell japan women parti elect labour vote candid mp seat air british island bank world lend develop loan project monetari dollar tax hunter ir fraud rose feder polic kill offic murder shot bomb school educ curriculum teacher test pupil teach ron tunnel rail channel freight ferri kent pound br railwai journalist kong hong arrest kill relea china polic sea island territori china russian disput oil drug legal court de boat ship vessel kong hong sea fish food fda label blank drug cfr addit nobel prize peac soviet award drug sale pharmaceut cent patient depress matrix inquiri churchil export defenc tool drug patient aid infect disea pharmaceut drug cent compani research pound amp sale dollar tourism tourist visitor hotel cent percent increa attract million soviet nato europ tank arm convent bush forest amazon brazil brazilian environ rain rio wap tabl ten highest weight term centroid data set
ML/632 6 nonstandard concept similar reason klau jantk htwk leipzig fb germani present paper motiv author work work learn machin learn work reason research project present focuss paper specif respect gener core paper driven investig nonstandard concept develop import gener restrict view similar basic drawback recent research reason rigor critic intend set stage approach similar contribut progress case gener approach similar similar concept similar object concept exist specif version cognit scienc area present paper introduc nonstandard concept similar formal set integr procedur unif algorithm introduct present paper aim propag concept similar flexibl express underli reason approach todai deal critic approach motiv introduc notion step futur applic investig hand origin author work learn theori explor relationship induct learn learn formal set turn area suffici flexibl similar concept formal argument necess similar measur encourag author investig structur learn problem view point reason turn handl requir formal similar concept object tremend extend comput power enabl system detect similar case respect case distinguish element case base individu carri inform similar lift local properti global start descript state art refer typic develop approach announc standard concept major reason work base formal invok small number standard concept recent workshop public reflect state art basic notion notat case tupl respect finit number attribut similar measur metric richter introduc approach close relat spirit althoff phd similar discuss number standard approach investig chess end game explicitli invok ham metric measur distanc assum transform valu numer vector weight calcul distanc tupl sum distanc attribut valu assum attribut weight notat data base theori denot tupl attribut standard distanc tupl distanc transform describ similar standard version defin similar measur distanc encod distanc figur call similar matter author absolut reason transform call speak distanc object poor view similar meet necess hide essenc measur distanc object argument methodolog deeper concept similar measur admit problem similar measur oe defin equat inherit essenti properti distanc measur ffi symmetri triangular inequ encod version adopt approach sketch provid similar properti case symmetri exhibit note viewpoint research similar problem reflex symmetri basic axiom approach consid concept similar measur chapter section page defin condit logic incomplet symmetri recent problem illustr necess abandon symmetri similar concept flexibl approach motiv introduc chapter problem problem consid scope similar approach global knowledg repres collect case rare reflect compar case standard approach classif collect typic collect number case case case classifi search similar case insid case base classifi standard approach restrict power classif typic problem requir view similar relat set text repres text pattern relat learn characterist case recogn compar coupl case simultan motiv lift similar local global concept gener approach overcom problem develop nonstandard concept previou section intend critic recent approach present section devot construct argument directli lead gener view problem cognit scienc provid huge amount knowledg illustr human reason base case similar wai rich sourc regard put emphasi categor author lakoff work import cognit scienc background classif provid result theoret investig bear abund evid sophist flexibl approach similar close relat rosch concept prototyp illustr exampl found human classifi countri consid mexico similar unit state unit state mexico detail circumst result number experi phenomenon abstract ffl repres exampl consid similar repres exampl express argument measur consid understood newli present case decid gener similar concept model effect report rule encod metric chapter motiv nonstandard similar concept stem induct infer research public integr reason induct infer roughli main result valid area learn function exampl induct infer devic transform normal symmetri similar measur requir longer particip author learn theori research group joint research ventur fabel face research interestingli structur case number ad hoc approach similar deeper investig exhibit structur case similar structur properti account main applic domain fabel industri build case highli structur natur led structur approach similar develop sequel idea similar object map partial order space comput compar similar standard approach easili gener map express similar coupl case kei problem formal justifi make reason difficult attempt present paper attack problem result induct infer base kind nonstandard approach similar result abstract real world demonstr mathemat nonstandard approach deriv principl introduc algorithm reason make essenti nonstandard concept introduc similar induct infer induct infer theori learn possibl incomplet inform inform process assum form understood sequenc case bridg gap induct infer reason excel survei induct infer easi introduct present introduct induct infer area induct infer learn function studi induct infer invent gold semin paper total function assum target object learn exampl gener function complet present graph admiss inform fed learn devic arbitrari partial function learn function present finit initi sequenc order graph order denot initi segment exampl wrt abbrevi fx order argument fx understood sequenc learn inform cover initi segment fx gener ident repres correctli present inform basic definit induct infer famili learn problem solvabl definit call lim instanc earli work identif type denot gn call recent american literatur author call partial function solv learn problem induct infer machin adopt notat sequel reader direct detail larg varieti addit requir consid natur properti learn strategi detail approach outlin illustr gist induct infer class target object learn possibl incomplet inform limit process piec incomplet inform present understood case point search learn manner collect learn similar express knowledg term sequel introduc discuss fundament notat assum space case notat suggest relationship attach suitabl semant case object denot vector attribut interpret vector valu case understood standard approach divid call bodi describ problem present present solut denot notat introduc cg cg notat defin formal semant case base cb similar measur oe interpret classifi problem descript case search similar member cb return solut note approach underli algorithm case base classif present approach express formal denot classifi defin cb ae cb reader recogn problem semant uniqu case satisfi lead formal approach turn logic discuss detail exce present paper discuss regard suffici understand collect case learn similar measur interpret learn classifi requir case tupl collect attribut assum case base finit similar measur oe equat defin classifi induct infer techniqu result learn comput function includ comput classifi basic problem induct infer gener learn manner sketch gener result kei result induct infer strategi learn comput classifi transform normal form word lim denot famili class comput function learnabl theorem hold result interest corollari attach theorem class comput classifi belong exist pair comput devic learn classifi manner empti case base cb oe comput similar measur present case updat case base cb similar measur oe cb cb cb fcg sequenc foe converg cb resp oe area induct learn transform normal form learn collect case tune similar measur reader consult detail proof construct invok corollari similar measur prove theorem nonstandard partial defin formal reason gener similar concept structur similar chapter devot introduct approach similar turn approach adopt close relat work artifici intellig theoret comput case establish explicit close order unif theori term rewrit notion notat concept mathemat theoret comput artifici intellig reduc present introduct remark concept briefli mention notion plai role approach similar introduc detail assum finitari signatur basi build term usual sort famili variabl call assum variabl call decor denot term algebra term tree map tree domain alphabet concept tree domain associ place term concept posit tree posit word alphabet natur number denot set natur posit empti word understood posit root tree tree domain subset close hold wp impli wq relat denot initi part word impli term understood tree tree domain letter word natur number separ readabl map formal flexibl construct sequel comput dealt finit term resp finit tree domain base concept easi introduc notion subterm posit notat jp tree term posit jp posit denot term result insert posit defin posit ae pv reader sketch assum term introduc concept appli substitut map set substitut denot individu substitut written fi substitut canon extrapol map applic substitut fi fi term denot substitut understood set assign fx finit term substitut finit set concaten substitut fi fl written mean fi appli fl term substitut fi call fi fi note denot structur equal complex problem term equal depend background knowledg remark extens follow fi call gener unifi fi substitut fl satisfi fi structur naiv standard algorithm number attempt find effici version algorithm interest reader consult regard concept unif call term search term substitut fi fi satisfi term call desir specif term term variabl sort work result substitut fi fi proper assign note renam substitut term properli specif term written unif free term algebra consid problem great background knowledg assum studi form background knowledg equat theori bridg gap term rewrit system techniqu complet deeper investig exce present paper huge amount literatur unif reader consult topic literatur free term syntact gener refer regard similar term kei idea flexibl approach similar invok defin similar map highli structur partial order space origin idea underli present approach attempt reflect rich structur occur applic domain project fabel mention led idea repres object net structur term appropri tailor signatur approach influenc formal attempt extend induct infer result sketch text pattern inevit requir reflect similar object simultan develop deduct formal horn consid atom approach easili gener set atom summer earli work induct synthesi lisp program base recogn common term structur kei idea process exampl express output liter term techniqu understood guess similar exampl summer approach appli object natur compar deduct approach outlin present approach induct spirit origin close connect research machin esp induct infer formal strength definit induct similar class term defin specif denot concept close construct summer work work interpret term case vice formal case access substitut reproduc term import concept li applic knowledg transfer compar concept complet reflect knowledg collect case definit strong induct similar class term defin pair specif defin fl easili comput similar induct resp strong induct class object similar class object individu object compar similar term yield induct similar similar term similar viewpoint strong induct properli similar space exampl discuss reader recogn imagin refin present make term similar exce space approach present remain open emb concept introduc framework integr standard nonstandard approach comput similar adopt develop scenario reason kei step ffl locat retriev potenti applic case long term memori ffl evalu select case determin applic ffl transfer knowledg current viewpoint point import concept strong induct similar knowledg transfer reason investig left forthcom paper follow discuss handl induct similar close relat unif import obviou definit unif plai necess find specif algorithm literatur contribut effici futur robinson algorithm suggest algorithm solut reason algorithm intend illustr induct similar classif assum case repres label term label indic case repres target concept requir addit assum addit connect term valu case term repres concept written notat assum case base cb finit number posit neg case counter collect cb exampl label case outermost oper ffi worst similar case express term structur left hand argument function algorithm present page close behaviour algorithm publish instanc kei differ complex structur similar collect case due rich occur interest problem standard approach present algorithm understood prototyp famili relat algorithm simpl cb consist cb cb current unlabel term classifi variabl occur term consid assum partial order oe compar complex term gener wrt reduc substitut introduc procedur lift invok algorithm briefli explain detail assum variabl easili distinguish variabl occur variabl variant term consid gener unifi separ fi fi fi variabl term meet fi fx fi fy lift variabl jp express variabl occur posit fi hold jp lift wrt fi mean replac posit subterm relat variabl posit pm mean lift formal express fi pm pm tune notat variabl occur lift term note lift standard techniqu algorithm close relat unif reason effici carefulli shuffl attempt construct gener unifi subsequ requir lift construct start partial unif algorithm introduc describ gist coupl procedur interact complex algorithm turn unabl classifi current term manag wai algorithm describ basic scope present paper investig heurist interact type reason problem consid complet prepar algorithm intend work case base cb possibl posit neg exampl underli fed current unclassifi classifi case correctli date case recal hand pure syntact left forthcom investig background knowledg account algorithm plai role unif theori unif autom deduct interest problem partial turn gener begin unifi begin return classifi fi begin fi end end cb unifi begin return classifi fi begin cb fi cb cb cb end end cb unifi begin comput comput cb ft form oe begin return classifi begin end end oe begin return classifi cb begin cb cb cb end end oe oe automat classif imposs begin user classifi user input cb cb cb end end end algorithm strong induct similar comput design algorithm discuss version algorithm make relationship unif explicit part dealt user interact skip algorithm fit text algorithm space comput left reader enjoi begin comput maxim subset satisfi index tree domain ae ae user interact begin assum index larger tree domain jp jp jq jp jq exist substitut fi satisfi fi return classifi jp jp jq jp jq begin jp jq jp jq begin term jp jp jq variabl occur repeat jq end cb cb end jp jp jp jp jp jp jq jp jq term unifi variabl begin comput gener unifi fi fi cb cb end jp ffl ffl ffl ffl ffl ffl term unifi ffl ffl ffl end end case base cb assum separ cb induct similar express cb current term process aim classifi updat case base similar technic conveni notat tree domain term cb explicit underli tree search start implement algorithm investig illustr present characterist part algorithm detail part left algorithm draw advantag unif process fourth case standard unif consid term unifi upper part term common tree domain process unchang remain work unif resp approach structur similar natur gener approach formula unif unchang reason adopt approach set logic formula knowledg explicitli excit investig yield deeper insight relationship deduct similar formula introduc induct similar introduc author develop approach algebra framework gener logic framework structur occur applic domain frequent suggest point view hierarch graph structur pin graph chapter aim briefli introduc approach structur similar pin graph intend widen reader view similar initi depth discuss pin graph finit collect graph distinguish properti special node replac complet individu graph collect technic concept replac drop technic interest reader direct detail elementari pin graph flatten replac result ordinari graph pin graph structur present ordinari graph offer tool case reason favour pin graph structur natur close technic object system repres reason algorithm effici hierarch structur graph flat refer mention directli adopt idea develop chapter graph natur gener unif author nonstandard approach intend set stage reason flexibl express requir combin formal concept sophist heurist interact paper hand deal problem complex applic requir combin concept techniqu imagin term structur leav graph pin usual summari approach similar exhibit number deeper relat research area point difficulti problem formal similar suitabl comput exploit similar found huge amount knowledg remark number result util reason approach introduc provid larg number continu extens excit open problem author singl distinguish approach similar reason power reason approach select coupl integr approach main intent present paper propag nonstandard idea set stage research direct acknowledg author work present origin stimul michael richter summer excit question relationship induct infer learn colleagu contribut discuss symmetri similar concept tend defend standard approach excit author investig approach detail joint ventur kati engag find structur approach similar guid work analog reason investig contribut author work present part work support german ministri research technolog joint ventur grant iw joint ventur grant iw refer helmut alt johann resembl symmetri geometr pattern burkhard thoma data structur effici volum lectur note comput page david aha learn algorithm rai darpa workshop case base washington page morgan david denni marc albert learn algorithm machin althoff ein al der zur technisch volum zur intelligenz dana angluin find pattern common set string journal comput system dana angluin carl smith survei induct theori method comput mark gold languag identif limit inform jan klau helmut grundlagen der page franz thoma process hierarch defin graph graph famili burkhard thoma data structur effici volum lectur note comput page digit build extens comput support manag build proc page integr build model base proc page mode analog klau analog induct volum lectur note artifici page role interpret analog learn gener klau jantk algorithm learn incomplet principl problem lectur note comput page klau jantk case base learn induct infer report technisch fb mathematik februari klau jantk case base learn induct infer proc acm workshop comput learn juli page acm klau jantk combin postul natur induct infer yve kodratoff introduct machin learn janet robert simpson katia process model reason problem solv proc intern joint confer artifici april lo page morgan kaufmann reinhard rolf wiehagen research theori induct infer mathematician survei inform georg lakoff danger thing chicago martelli montanari effici unif algorithm acm transact program languag analog gener intern confer gener comput june volum page institut gener comput technolog gordon plotkin note induct gener meltzer machin intellig page american christian michael kd proc von fallen june page universit fb seki work paper ms mn linear unif journal comput system michael richter classif learn similar measur proc von fallen june page universitat fb seki work paper ja robinson logic base resolut principl journal rosch cognit refer point cognit jorg unif proc confer autom volum lectur note comput page philip summer program construct exampl phd yale dept comp philip summer methodolog lisp program construct exampl journal amo tverski studi similar rosch bb cognit page lawrenc erlbaum
DB/633 3 queri revisit lane daniel mirank depart comput scienc appli research laboratori texa austin taylor hall tx abstract present architectur perform assess extens queri optim written venu venu rule languag develop extens queri form optim written optim avail advantag venu modular structur step provid extens search defin search compon declar form addit effect integr heurist optim compar optim develop venu venu optim compil yield code perform compar volcano smaller queri abil introduc addit prune heurist yield scalabl larger queri evalu system quantit softwar metric support claim optim easili maintain extend predecessor introduct abil express queri optim extens ongo goal research current extens optim manifest extens relat manag system arbitrari adopt distribut queri adapt optim main goal extens optim research provid optim encapsul compon optim rewrit search modifi interchang independ declar state written highest level program abstract easili modifi heurist search space larger domain specif heurist shown perform search algorithm exploit queri optim effici accomplish sacrif perform gener research number queri optim attract close semant gap specif optim implement paradigm express algebra rewrit transform queri directli rule domain specif heurist easili ad rule system optim easier extend predecessor research partial fund contract appli research intern research develop program earli optim effort consid exist languag basi system execut speed rule languag render unsuit queri optim project develop special rule languag execut environ singl develop optim speed gain rule resolut strategi control construct develop optim elabor knowledg rule languag underli execut engin optim success respect cope oper algebra extens search strategi limit small librari singl strategi abil heurist rule enforc search sequenc limit drastic contrari similar program ai plan queri optim connot absenc cost model cite subsequ develop exploit paradigm system modular structur environ defin optim compon class object introduc oper simplifi dynam dispatch function invoc optim effect provid extens express tree objectori optim fail attempt properli encapsul declar defin queri rewrit search strategi compon procedur state element respect oper yield implement distribut code local limit optim interest optim venu rule languag address defici previou rule languag construct suit extens queri optim applic venu includ diagnost system telephon equip solut mortgag pool alloc problem face institut venu unifi extens famili rule languag extens includ event data abstract mechan direct execut content applic includ schema integr heterogen detect militari network venu ideal engin extens queri optim rule obviou syntact deriv class definit venu languag critic featur venu carri research queri optim optim compil yield fast execut speed method encourag structur program recal primari advanc oo optim extens abstract express tree class definit venu data definit advanc incorpor optim modif model express tree cost function optim easili incorpor rule languag environ modif present creat flat set structur rewrit express declar rule control structur iter express tree demonstr abil appli rewrit data structur express rule organ structur effort organ rule venu modul semant nest modul venu close model nest transact model lead execut consist procedur intuit declar modul structur basi extens search compon optim previou work rule group declar defin control move modul modul procedur support paramet section detail introduct venu rule languag primari contribut adapt express program compon rewrit search encapsul declar express modul queri rule existenti cursor cursor select call venu modul rewrit figur search venu set rule modul sacrif perform modular structur enabl architectur similar demonstr ad benefit structur integr heurist optim gener organ emerg substanti overlap code segment expect defin librari design pattern extens set search strategi refin identifi pattern encompass implement depth breadth hill climb system volcano search strategi describ core organiz element report optim develop sampl optim provid volcano optim section present perform number optim compar volcano optim head head comparison show equal execut time small queri due addit prune venu optim shown scale larg queri difficult compar system written program languag section present quantit result softwar metric speak extens optim venu defici earli rule languag mention uniqu applic queri engin addit slower implement system lisp data structur make difficult emb larger system venu number rule languag develop address issu featur make venu excel engin queri optim develop embedd embedd system venu data definit languag oo benefit optim develop respect oper tree cost model exploit ident structur rule environ oper semant venu main execut unit modul rule modul shown provid benefit commonli understood procedur languag optim compil yield time faster execut speed compil time earlier queri optim work ident familiar syntax syntax venu rule organ group call modul figur modul design keyword modul list formal paramet local variabl formal paramet local variabl list made primit variabl venu set data type rule inferenc distinguish squar bracket element defin class instanc primit variabl infer object semant treat size present similar perform evalu optim shown perform compar volcano venu rule made action header keyword rule rule option prioriti declar section declar section begin keyword list quantifi cursor declar cursor declar quantifi existenti existenti quantifi cursor repres squar bracket quantifi cursor repres squar bracket select satisfi rule make program difficult conveni venu includ procedur construct detail scope paper construct admit languag clear obviou slow nondeterminist program critic procedur construct rule prioriti declar rule header event append declar section rule higher prioriti rule lower prioriti satisfi rule prioriti select event typic rule introduc refin execut behavior action rule defin event trigger reevalu rule event specif default event event optim techniqu optim rule condit boolean express function method call execut rule condit provid return boolean execut side effect free rule action list possibl includ venu modul actual paramet statement function call made modifi data element explicit notif rule system figur illustr concept modul rule declar existenti cursor subqueri cursor rule iter order cost select minimum cost element delet element modular semant rule fire execut action rule select evalu condit satisfi entir action venu rule defin singl atom transit rule fire fair polici control remain venu modul fix point reach modul list action rule nest arbitrarili deep rule fire action list modul rule nest modul achiev fix point action rule commit venu semant nest transact model close relat conveni condit rule list modul conjoin condit rule nest factor common condit incorrect singl rule rule modul fire fix point condit call rule definit rule introduc structur limit spuriou interact rule result execut correspond depth declar consist procedur intuit declar modul semant figur figur present modul primit variabl modul priorit rule test primit variabl subqueri determin join oper test modul activ rule test oper logic point merg physic join hash index segment predefin abstract class dbi defin class figur sampl oper tree primit variabl subqueri determin join oper test modul activ rule execut proce modul highest prioriti rule evalu rule condit modul activ modul continu queri heurist queri transform place newli rewritten queri fix point reach control move back modul action commit state occur subqueri rule evalu note event turn monitor optim elimin evalu rule modif rule exhaust evalu rule evalu rule condit modul activ queri join transform modul reach fix control return modul state occur subqueri rule evalu rule execut continu bounc back nest modul call rule modul exhaust fix point reach queri optim basic part queri optim consist oper cost search strategi oper tree machin queri cost model estim effici queri execut search space defin space algebra transform defin rewrit search strategi method find optim plan search space estim cost model optim separ encapsul element data model due connect optim oper tree cost model defin term object close resembl oper tree definit develop exploit api turn data model addit modif algebra oper complet isol modul present space limit code venu applic venu code repositori locat modul queri queri rule prioriti event rule prioriti event figur sampl venu modul modul call system legaci rewrit rule search routin extend advantag capabl oper tree oper tree implement abstract class hierarchi repres algebra oper abstract method attribut defin logic physic descript oper convent defin logic oper algebra oper oper input physic oper logic oper assign implement algorithm figur illustr basic class hierarchi relat oper tree shade area illustr class predefin optim base class oper repres oper class logic physic deriv repres logic physic oper pointer slight differ oper tree literatur follow factori design pattern present creation logic oper turn creat physic oper assign default oper implement spine oper tree maintain logic oper studi found separ logic physic algebra benefici structur oper shape includ number operand oper map area shade figur illustr class written implement illustr optim logic oper join deriv logic class deriv physic class join algorithm implement choic merg hash implement choic index segment scan cost model cost model venu optim defin term abstract method physic oper physic oper refin set implement algorithm implement algorithm refin method defin abstractli rule system calcul cost algebra oper estim cost oper implement algorithm optim extens search system rewrit search compon segreg separ modul modular structur enabl extens set search routin defin independ set algebra rewrit ad benefit structur declar integr heurist optim modul call graph rule compon illustr figur venu optim search strategi cost estim sequenc prune search space search strategi search strategi venu optim implement complet rule system coupl defin search strategi assign default oper venu order logic physic rewrit cost estim search strategi system post condit search subqueri optim heurist appli transform transform implement modul group algebra oper ensur consist assist search mechan figur rule system architectur repres search strategi box figur pass rewrit system base cost post condit updat search strategi search hill climb simpl search strategi appli rewrit queri retain cost rewrit search continu rewrit cost rewrit complet rewrit yield improv search repres direct graph root design start node node graph repres state search space arc connect pair node repres applic oper search routin search process graph expand node applic oper compar goal criterion search repres open close list open list node expand search close list node expand search routin encod search optim root search graph queri optim open list algebra oper queri expand repres close list store log expand rewrit search method modul pick open list rewrit system expand queri modul place improv rewritten queri open list move close list optim continu fashion rewrit longer provid cost improv search strategi modul search illustr figur shown entireti demonstr simplic experi search algorithm venu rule environ figur condit rule select order optim cost estim rule action insert select remov pass illustr figur attempt queri transform postcondit flush rewrit improv queri cost estim place make improv queri transform search continu empti optim plan lowest cost queri notic modul line code illustr reason modul similarli compact experi modifi search optim greatli limit scope compar previou effort written form similar english statement consequ modular structur rewrit system complet decoupl search strategi design lead implement search method structur form design pattern design pattern similar object structur physic encapsul object form base pattern special search result ai plan gener problem solv demonstr small number design pattern start point encod virtual form search aim step develop compon enabl plug plai approach search techniqu implement date encompass hill system style hybrid strategi volcano converg architectur algebra rewrit encapsul rule modul definit independ search strategi identifi mention modul queri queri rule outer join fit main memori rule scope variabl declar queri appli rewrit call venu modul figur commut rule design pattern remain constant varieti search strategi primari unknown conclud system satisfi librari exampl rewrit system search space defin space algebra rewrit present rewrit system implement venu figur present abstract modul rewrit system rewrit system appli transform implement rewrit exploit procedur heurist constrain algebra precondit condit rewrit oper appli pass postcondit modul evalu updat appropri type rewrit gener transform oper map logic algebra logic algebra implement oper map logic algebra physic algebra figur displai commut oper written venu rule state outer join join oper fit main commut oper evalu oper postcondit modul notic english statement commut rule venu implement rule venu avoid syntax common classic rule classic optim effort significantli reduc learn curv begin build rewrit rule venu earlier effort heurist queri optim benefit domain specif knowledg form heurist depend search heurist provid prune search jump search path unreach worth note heurist ad simpli ad modul step optim process commut rule present figur implement commonli heurist elimin applic commut rule substanti heurist combin rewrit logic algebra assign implement heurist roll rewrit macro oper illustr power heurist figur figur present graphic classic branch bound search algorithm branch bound search algorithm bound search lowest cost plan encount multipl path investig bound point order cost estim search continu reset bound point plan abort current path path root bound point threshold multipl bound point search stop accept plan found path bound point improv figur classic applic branch bound search encount plan optim search path applic heurist allevi problem jump path heurist oper combin logic rewrit physic rewrit easili structur ad optim addit rule rewrit system macro heurist rule ad modul activ modul illustr figur applic heurist prune larg portion optim plan high estim cost low estim cost accept origin plan optim path branch bound path bound point heurist applic search space figur path branch bound search space search jump forward search avoid rewrit similar commut rule present figur analysi measur effect optim wai exploit quantit softwar metric object support claim optim support level extens present set execut time result demonstr effect optim absolut term respect extens search evid improv optim respect scale queri size softwar metric evalu compar optim volcano measur line code complex line code volum metric system complex complex control flow metric complex control path program complex simpl sequenti procedur branch receiv rate code consid unmanag rate higher complex develop context fortran case excess accessor function significantli reduc averag case rate program decid analyz procedur rate greater effect factor design construct complex relat complex develop simpl procedur model rule execut figur summar result measur aspect venu compil develop optim semant languag understand intern implement strategi detail intern prolog engin chosen prolog implement languag venu volcano comparison evalu perform sampl relat optim present volcano distribut function venu optim chose volcano optim gener includ volcano rule engin metric experi insepar search develop optim system requir knowledg work search engin code volcano relat relat objectori line total code uniqu optim oper tree cost model compon ua search compon averag uniqu optim complex oper tree cost model compon search compon unavail compon distribut unavail quantifi line counter tool includ search compon rule figur quantit softwar metric avail exist relat optim oper sort join figur optim implement code volcano optim primarili due search compon implement declar rule languag yield order magnitud code code volcano rewrit compon code uniqu relat optim optim closer inspect reveal rewrit rule volcano optim extrem compact due special natur rule languag posit effect amount code penalti special reveal high complex rate lessen flexibl due fix search strategi averag complex volcano optim calcul complex number individu program compon search volcano complic complex number element constitut sampl optim rate volcano develop deal program highest rate optim receiv averag aggreg number search compon group averag element constitut sampl optim rate system similarli receiv low complex rate respect rewrit compon emploi program methodolog larg differ system measur due oo structur oper tree declar implement search venu optim net result system roughli complex volcano optim comparison compar optim optim model objectori develop shore project implement optim extend optim previou section optim roughli half line figur tool accur measur rewrit system discrep attribut rule compon optim demonstr code implement search compon oper tree cost model equal emploi program methodolog measur yield averag complex optim venu unexpect differ due optim adorn tree significantli search rewrit relat inform counterpart unexpect rewrit system search compon optim rate complex slightli counterpart complex measur code local search rewrit modul locat encapsul written declar fewer line code implement function search rewrit compon written procedur distribut object code perform evalu perform evalu execut volcano relat optim ran optim set randomli gener queri set target queri twelv join tabul optim execut time return estim plan cost random queri gener queri gener larg data set queri gener emploi techniqu render queri consist real applic pure random behavior set gener paramet produc balanc mix perform perform evalu optim shown execut volcano foreign kei join complement experi perform mhz processor sun ultra mb cach mb main memori figur present total estim cost plan produc figur present execut time optim cost plan produc venu volcano ident trend venu optim scale volcano respect reason trend abstract optim easili defin prune illustr figur heurist excel larger problem size appar overhead calcul heurist outweigh success prune queri join stem anticip applic venu compil integr rule evalu techniqu scale problem size repres bui build respect rule substanti advanc rule optim effort question hypothesi execut speed languag compar special search engin reflect volcano search examin total optim time suggest finer grain number plan gener evalu definit simpli align implement close instrument result relat work cite context effort optim rule excel queri rewrit system develop algebra set queri transform address extens limit express optim error prone natur previou rewrit algebra uniqu variabl free enabl rewrit verifi theorem prover express extern written code compil develop formul rewrit algebra plan system enabl heurist rewrit phase work complement algebra integr approach rewrit express implement rule success explor queri rewrit implement venu avoid develop rule execut environ result confirm hypothesi languag definit implement techniqu rule languag improv point build effect queri optim larg portion code special measur volum impact omit develop extens queri optim ongo experi system necessarili dimens flexibl expect net higher result demonstr longer case join data point venu volcano figur optim time venu volcano figur estim cost attain extens dimens introduct execut speed advantag gain special environ venu structur program semant deriv nest transact form basi extens program search integr heurist net result extens optim scale predecessor refer jr evalu automat measur softwar develop workshop quantit softwar octob dp mirank process queri answer confer inform knowledg novemb jc al approach modular program intern confer tool artifici ieee km misra parallel program foundat publish stanlei zdonik rule languag intern algebra optim acm sigmod intern confer manag stanlei zdonik chang transform optim acm sigmod intern confer manag rule specif framework queri optim intern confer data march design element reusabl softwar publish read dewitt exodu optim gener acm sigmod intern confer manag san mckenna volcano optim extens effici search intern confer data david dewitt implement extens queri optim unpublish paper locat shore paper home david dewitt effici queri execut plan acm sigmod intern confer manag laird phd je ps rosenbloom architectur gener intellig artifici elsevi scienc publish bv patrick valduriez extend search strategi queri optim intern confer larg septemb complex measur ieee transact softwar decemb mcdermott ag lesson elementari school achiev artifici stanlei zdonik control extens queri approach larg ireland bj perform lazi match product system nation confer artifici juli architectur integr heterogen data krdb workshop august dp mirank overview venu activ system intern symposium cooper system advanc applic decemb extens queri optim manag system intern confer inform knowledg ed workshop product system technic report laboratoir form intellig institut pascal dec pearl heurist intellig search strategi comput problem solv hasan base queri rewrit optim starburst acm sigmod intern confer manag san june livni case enhanc abstract data type praveen intern confer larg vldb jensen assess maintain cope problem larg associ artifici nation confer artifici intellig august unit order battl project appli research laboratori texa austin wang hanson perform comparison rete treat algorithm test rule condit eighth intern confer data lane daniel mirank case studi venu declar base rule modul confer inform knowledg novemb lane al monitor network log activ appli research laboratori texa technic report
DB/634 3 linear data michael yanni manolopoulo data engin lab depart aristotl greec abstract research larg extens access method proper handl time chang spatial inform present linear access method base idea linear region store independ numer data consecut imag store group codeword share codeword repres spatial subregion structur index mechan store access evolv raster imag conduct sequenc real synthet raster imag examin time perform tempor window provid result varieti paramet set introduct spatial store manipul spatial volum space numer applic requir effici retriev spatial geograph inform system imag multimedia urban design rule index expert tradit index method suitabl store spatial data inabl implement total order object space preserv time refer extens survei detail methodolog algorithm plethora techniqu spatial data tempor support mainten data special queri convent suitabl handl continu chang store version applic present time piec data valid delet physic level research perform european tmr chorochrono contract number al lnc pp berlin heidelberg manolopoulo concept time consid valid transact time valid time time fact true real world transact time time piec data record relat notion time start time point end time point interv specif properti tdb handl valid time call valid histor handl transact time call transact rollback handl notion time call number access method tempor data method achiev accept perform applic recent field tempor spatial remain separ world modern applic analysi anim demand effici manipul spatial inform chang time spatial data object chang spatial locat shape time interv special implement techniqu develop effici storag access spatial geometr characterist refer excel survei advanc made research fundament object studi present effici access method store access evolv raster imag effici consid term space requir time perform queri process index structur base transact time call linear motiv access method method differ number reason store independ numer data consecut imag store group codeword share codeword repres spatial subregion algorithm delet updat process significantli algorithm due fact batch oper delet updat data record specif polici node split merg analog function significantli structur overlap linear structur linear region store codeword present modifi appli techniqu overlap sequenc articl present initi studi time perform tempor window provid result varieti paramet set conduct sequenc real synthet raster imag comparison research activ progress linear data rest paper organ section descript structur section discuss queri process section present result space requir queri perform section conclud paper idea research structur framework assumpt discuss assum sequenc evolv raster imag store imag repres arrai pixel order posit integ pixel color black white imag binari stand black white color imag uniqu timestamp total number imag tempor attribut express transact time transact time implicitli associ time interv record repres spatial object record insert time time interv set equal delet time point implement logic delet chang timestamp time interv linear region data region base success decomposit binari raster imag quadrant pixel part imag cover black subdivid binari raster imag arrai pixel region fig region main memori structur repres imag larg store main memori inform leav correspond black imag insert version method call linear region black node repres pair number number term locat code denot correct path root till leaf digit quadrant sw timestamp time attribut symbol refer special tdb usag mean respect object valid time point manolopoulo fig similar binari raster imag region linear region number pair level node locat linear call fd length linear implement interest reader find linear implement fl vl reason explain choic linear black node fd length implement part fig present linear obtain middl figur fd locat code black node linear level node shown linear sequenc imag store linear imag label uniqu timestamp ti updat overwrit version insert imag retain applic spatial queri refer success version structur access convert linear persist data structur past state maintain coupl time interv spatial object node data record resid leav record form fd code black node region repres time interv black node imag sequenc node entri form tr ptr pointer descend linear data smallest record descend node time interv express lifespan node ad call hold time instant creat field modif process examin leaf ad extra field call regist transact time specif leaf histor structur accompani addit main memori built top host number version tree number root root stand interv record tabl repres root obei form lifespan root ptr pointer physic disk address depth insert usag track black insert black quadrant ident imag fd code delet updat compact arrai repres imag preorder claim earlier basi access method algorithm delet updat process significantli algorithm insert time point target leaf node overflow occur depend starttim field structur chang trigger wai kei split occur leaf split assum node kei split entri origin node node rest move leaf im copi origin leaf accept chang past state structur remov version copi node oper call version split number present version version split rang constant version split lead merg attempt sibl copi sibl present version choic depend starttim field version split lead kei split perform manolopoulo delet delet time point implement depend starttim field leaf entri form remov leaf physic leaf check hold entri number entri delet complet number node handl classic differ sibl exist check starttim field merg kei redistribut im tj delet handl logic updat tempor inform entri tot ti insert time entri logic delet leaf present version occur version split copi present version node number present version version split merg attempt sibl copi sibl updat updat chang level fd code leaf entri time point tj implement logic delet entri insert version version entri level consecut imag respect timestamp left fig structur insert imag fig level store simplic code structur consist root leav node capac equal paramet equal version structur construct base insert fd code form delet insert delet fd code figur show intermedi result insert fd code delet insert fd code attempt insert leaf fig leaf overflow leaf creat version split present version leaf copi leaf parent updat structur chang leaf hold entri kei split perform produc leaf parent updat final statu insert imag illustr fig delet leaf fig node occur number entri resolv merg starttim starttim linear data starttim starttim starttim starttim starttim starttim starttim starttim starttim starttim starttim starttim fig structur insert preliminari result insert final result insert imag node sibl copi present version find starttim field leaf smaller version split leaf merg leaf leaf leaf process termin physic delet leaf final number entri leaf equal version fig root root exist face insert imag stage stage sort imag compar sequenc set insert binari tabl cost black quadrant ident success imag stage tabl locat root correspond insert imag idea approach build tree version perform updat delet batch perform time follow approach manolopoulo fig simplic obviou batch oper delet updat specif time conceptu node split merg specif leaf split node similar sibl leav merg fd code delet window queri process structur base transact time extens linear data support spatial queri spatial nearest neighbor similar spatial select account notion time major featur effici handl special type window queri detail window queri primari import basi number oper execut window sequenc binari imag store uniqu timestamp ti consid satisfact queri strict window queri border intersect window queri gener border intersect window queri cover window queri fuzzi cover window queri definit algorithm process queri appli slight modif descript modif includ report order improv queri process raster ad pointer leaf pointer introduc adapt spatiotempor data consecut tree instanc search histori specif fd code excess page access avoid pointer role function altern naiv approach answer queri easi respect algorithm perform suitabl rang search version correspond time interv separ store start respect root altern approach account horizont pointer result significantli perform experi preliminari linear data structur implement experi perform paramet valu assum page size size time interv size fd locat code size pointer byte size level fd code conclud intern node accommod tr leav record format node capac time complex larg small good space util larg prove maximum equal paramet inequ hold leaf node capac equal valu paramet evolv imag synthet real raster binari imag pixel experi synthet number evolv imag size imag imag kbyte worst case case small store main memori insert imag convert raster linear fd algorithm optim build perform extens respect storag perform includ result interest reader find addit detail result queri process sophist algorithm window queri execut time window size random window posit time respect naiv algorithm execut perform independ search multipl root track averag number disk read perform queri time point effect comparison algorithm exclud measur number disk read spent imag sequenc imag reason algorithm perform rang search tree start root access number disk page interest cost profit succe horizont pointer manolopoulo cost access independ search root search pointer independ search root search pointer aggreg coeffici cost access cost access kind fuzzi cover search kind fuzzi cover search kind fuzzi cover pointer aggreg coeffici independ search root search pointer window size fig effici strict cover fuzzi cover window queri experi synthet data set experi repeat time pair similar imag imag creat specif analog aggreg coeffici amount quantiti defin express coher region homogen color imag start random imag algorithm present imag analog higher aggreg includ larger region cover black creat insert imag creat randomli chang color percentag pixel imag fd code imag compar previou imag insert note random chang singl pixel extrem method produc evolv imag result deriv polici pessimist higher perform gain expect window size rang pixel queri time structur produc algorithm execut time perform sophist naiv algorithm illustr fig upper left part show cost strict linear data window queri function aggreg coeffici window black imag black imag aggreg coeffici equal lower middl part show cost fuzzi cover window queri threshold black function aggreg coeffici linear cost naiv algorithm strict fuzzi cover window queri explain fact imag larger aggreg form larger solid black spatial region linear hold number fd code interest remark horizont pointer lead remark high stabl perform window queri examin experi real data set provid result experi base real raster meteorolog view acquir anonym ftp imag correspond categori spectral reflect emit infrar imag pixel repres scale tone grai transform imag binari threshold achiev black analog rang total number evolv binari imag time point valu vari tn figur depict success imag visibl spectrum tabl show comparison consecut imag visibl spectral averag percentag pixel chang imag depend averag percentag analog differ imag imag confirm argu specif imag suitabl data test perform result produc pessimist larger imag differ percentag queri time perform sophist algorithm fig success black imag manolopoulo tabl valu paramet consecut imag visibl spectral channel averag valu imag black analog differ aggr coeffici che queri perform result obtain real imag encourag worst case environ window size rang pixel queri time structur produc import highlight interest cost profit achiev horizont pointer imag upper left part fig depict time perform strict window queri function black analog threshold window size lower middl part present gener perform comparison cost sophist algorithm window queri window size gener remark horizont pointer lead significantli higher effici window queri examin present version linear access method base transact time index mechan consecut raster imag effici algorithm process tempor window queri adapt imag organ demonstr structur support queri process evolv imag studi algorithm process strict border gener border cover fuzzi cover window queri present experi perform studi effici algorithm experi base real synthet sequenc evolv imag experi show pointer algorithm effici term disk activ plan compar space time perform plan develop algorithm spatiotempor queri advantag studi behavior plan investig possibl analyz perform algorithm consid import cost access linear data independ search root search pointer independ search root search pointer independ search root search pointer analog cost access cost access analog kind fuzzi cover search kind fuzzi cover search kind fuzzi cover pointer kind fuzzi cover search kind fuzzi cover search kind fuzzi cover pointer analog gener border intersect kind fuzzi cover strict border intersect fig effici strict fuzzi cover window queri perform comparison window queri function analog evolv imag examin perform context spatiotempor nearest neighbor queri acknowledg prof bernhard seeger kindli provid code refer abraham jf survei seeger asymptot optim vldb jr dd make data structur journal comput system effect repres commun access acm comput manolopoulo cs jensen consensu glossari tempor acm sigmod kawaguchi method binari pictur applic data ieee transact pattern analysi machin sd lang jr improv differenti file techniqu batch oper tree structur file ieee intern confer data engin lo gener aggreg random spatial intern confer inform knowledg manag washington design analysi spatial data read applic spatial data read comparison access method time evolv acm comput manolopoulo overlap implement tempor access data knowledg overlap linear access acm symposium advanc geograph inform system bethesda novemb process tempor queri imag confer advanc inform system pp septemb linear technic data engin depart aristotl thessaloniki address overlap linear window queri process submit papadopoulo specif effici index spatiotempor confer statist scientif manag system
DB/635 3 sourc coverag statist data integr abstract kambhampati depart comput scienc engin arizona state az recent work data integr shown import statist inform coverag overlap sourc effici queri process recognit effect approach learn statist kei challeng learn statist number statist low storag learn cost manag naiv approach quickli paper present set connect techniqu estim coverag overlap statist statist tightli control approach hierarch classif threshold base variant familiar data mine techniqu dynam decid level resolut learn statist describ detail present preliminari result show feasibl approach introduct vast number autonom inform sourc internet user access larg varieti data sourc data integr system develop provid uniform interfac multitud inform queri relev sourc automat restructur inform sourc data integr user interact mediat system mediat schema mediat schema set virtual effect store multipl potenti overlap data partial extens relat queri optim data integr requir abil figur sourc relev order sourc call queri optim access statist coverag individu sourc respect answer export overlap simpl mediat integr inform sourc export inform paper comput scienc relat global schema hundr internet subset paper global relat sourc inform artifici focu order answer queri find queri relev subset sourc user select answer queri coverag sourc £ respect queri ¤ coverag repres probabl answer tupl queri belong sourc £ rank sourc descend order access sourc rank rank complet order access true gener sourc highest coverag respect ¤ happen mirror content call sourc give inform call sourc access sourc £ maximum coverag wrt access sourc highest residu coverag maximum number answer provid access sourc £ maximum order comput overlap sourc £ £ wrt repres probabl simpl matter comput demonstr coverag overlap statist queri optim sourc tend autonom data integr gather coverag overlap statist pose challeng impract assum sourc export statist data integr system learn coverag sourc previou work address issu model statist part queri optim work effect learn statist formula gener comput number select ¤ refer queri place issu learn coverag overlap statist sourc kei challeng problem number statist low storag learn cost manag naiv approach quickli assum avail coverag statist respect overlap inform subset sourc respect set connect techniqu estim coverag overlap statist statist tightli control basic idea approach learn coverag statist respect individu queri respect queri class develop hierarch classif queri start hierarch classif valu kei attribut global relat class hierarchi approxim coverag sourc respect class term coverag respect gener class select decid level gener class respect coverag statist tightli control number statist loss loss accuraci critic issu rel absolut valu coverag statist import rank sourc statist learn variant associ rule mine techniqu threshold decid learn statist respect class gener threshold support dynam identifi learn coverag statist respect class resolut learn statist control adapt manner interest adapt approach identifi class high macro focu area mediat rest describ approach provid empir evalu feasibl paper organ give overview approach defin terminolog discuss sourc probe gener train data mine statist describ algorithm learn coverag overlap statist empir evalu approach end discuss relat work summari contribut framework section give overview approach defin terminolog paper order illustr aspect associ rule mine limit queri project select queri construct queri class approach consist group queri abstract class select classifi queri term select attribut valu abstract class assum mediat access socal subset attribut mediat relat note hierarchi exist attribut queri classifi call attribut attribut domain repres multipl attribut attribut valu differenti sourc number decid base tradeoff predict perform versu comput complex learn statist attribut mediat system sourc £ paper confer paper confer paper confer sigmod order rank access attribut domain attribut attribut hierarchi av hierarchi attribut attribut hierarch classif valu attribut leaf node hierarchi correspond specif concret valu node abstract valu correspond union valu term featur describ node av hierarchi attribut refer attribut av hierarchi mediat continu section assum mediat av hierarchi figur attribut queri class class descript subset queri set primit class set queri set leaf class set primit queri attribut attribut bound interest defin abstract class cover multipl queri denot set leaf node node featur av hierarchi mediat assum special featur correspond root hierarchi set abstract class cartesian product call mediat av hierarchi induc subsumpt relat abstract class class subsum class featur equal special dimens featur ¤ queri belong class valu attribut ¤ equal special featur defin mediat simpl featur mediat ¢ ¢ ¢ class refer class refer ¢ paper publish year subsum class multipl distinct av hierarchi class class singl featur select attribut mediat design autom techniqu tree learn techniqu learn inform gain classifi ¢ cs paper ai db os aaai ijcai sigmod vldb icd overview approach show learn coverag overlap statist associ rule mine map queri abstract class statist coverag overlap coverag data sourc class refer sourc cover class notat denot coverag sourc £ class assum union content sourc system cover class coverag measur rel sourc overlap sourc class refer sourc cover part data class formula denot overlap sourc £ £ class mine associ rule order defin term associ defin term sourc set £ set sourc mediat subset refer sourc set sourc set sourc £ associ rule repres strong associ class implic £ form notic class defin singl leaf node singl node featur combin featur associ rule rule support confid measur support class refer percentag tupl global relat belong class support rule £ refer percentag tupl global relat common sourc £ set belong class confid ¢ ¢ time figur attribut hierarchi rule refer percentag tupl class common sourc £ discuss section prohibit learn store coverag overlap statist class order number associ rule prune class sourc set discov larg threshold support class discov larg class class support higher prune small class paper present algorithm effici discov larg class properti set pass superset fail test discov strongli correl sourc order member small number overlap store overlap statist strongli correl sourc set uncorrel sourc assum sourc follow independ discuss apriori discov strongli correl sourc set larg class discov larg class strongli correl sourc comput coverag overlap statist gener £ £ rule confid denot coverag singl sourc £ class larg class gener rule £ confid denot overlap sourc £ class confid mean £ sourc overlap ai paper larg class strongli correl £ map queri abstract class order learn coverag overlap statist larg map queri discov larg class coverag overlap statist class predict coverag sourc overlap sourc queri map algorithm attribut bound find lowest ancestor abstract class statist featur attribut bound check learn associ rule featur queri featur featur featur queri step sourc £ probabl tupl present sourc £ independ probabl tupl present multipl ancestor lowest ancestor class statist mean ancestor class lowest support count discov larg class order simplifi discuss kind associ rule mine typic associ rule mine problem simpl learn rule high confid support present discov class feedback select root hierarchi class queri rank sourc class section discuss rank sourc map class statist learn select sourc highest coverag overlap statist comput residu coverag rest sourc find plan util discuss overlap statist highli correl sourc set sourc set overlap statist independ assumpt estim overlap inform £ sourc export tupl class learn coverag learn overlap statist independ easi estim overlap sourc comput independ highli correl subset case begin maxim overlap maxim overlap £ assum independ £ comput overlap sourc estim product overlap maxim overlap sourc coverag remain sourc gener dataset probe order associ rule mine approach learn coverag overlap collect input dataset mine data integr data sourc directli autonom natur extract featur autonom sourc probe sourc section discuss gener probe queri store probe result probe queri design global schema av hierarchi data integr system set probe queri gener probe queri gener includ featur leaf node singl av hierarchi note multipl featur serv probe leaf node featur probe queri queri sourc bind leaf node featur attribut give relat repres subset relat motiv sourc queri give confer probe queri select queri confer leaf node av hierarchi dataset rank sourc base combin util qualiti paramet fresh detail discuss rank sourc cid confer year count icd icd icd tabl tupl tabl cid sourc count tabl tupl tabl list probe queri sourc queri queri list answer back union result delet overlap result result dataset dataset input associ rule mine algorithm specif result dataset consist refer attribut leaf class tupl sourc class cid total number distinct tupl leaf class enter separ tabl track tupl sourc multipl sourc tupl leaf class rememb total number common tupl overlap sourc set worst count subset number continu section assum queri probe updat tupl tabl tabl tabl attribut cid id attribut confer year attribut attribut count total number distinct tupl class tabl attribut cid id attribut sourc overlap sourc attribut count number overlap tupl sourc leaf class class subset overlap sourc export total tupl sourc set export tupl sourc set export tupl singl sourc export tupl practic worst case result singl scan mine section count queri queri rememb result current rememb count higher level abstract rememb overlap count upto predefin algorithm lc algorithm av min minimum support learn discov larg begin leaf class class sourc end end end total number tupl sourc £ class remov rule low support class end rule end return end procedur number leaf av featur hierarchi includ ancestor end cartesian product gener featur prune procedur implement insid product class class subset featur class delet end end return algorithm learn ag overlap discuss associ rule learn coverag overlap statist introduc effici discov larg gener associ rule class comput confid rule input dataset show apriori algorithm appli learn overlap statist lc algorithm lc algorithm algorithm requir av minimum support dynam discov larg class side mediat system mention order avoid small set support count threshold prune class support count threshold uniform minimum support class properti mean set pass superset fail test improv effici algorithm lc algorithm make multipl pass data find larg class find larg class featur previou result properti effici prune class start continu larg class featur tupl find set featur class fall count class count £ sourc tupl prune class total support count minimum support count identifi larg easili comput coverag £ sourc larg class function find candid class featur leaf class procedur procedur prune small class larg class set found pass explain procedur assum leaf class extract featur valu leaf class gener featur set includ ancestor featur featur ¢ larg class previou class featur larg class properti prune featur candid class set leaf class class singl featur ¢ singl versu multipl scan data lc assum number class high order avoid larg number prune class count scan dataset multipl time number class small cost scan dataset pass algorithm leaf class probe algorithm gener candid class set count class set rememb count class rememb probe queri result learn overlap sourc discov larg class learn overlap sourc larg class section discuss learn overlap inform sourc class order improv effici prune small class cartesian product procedur tabl classifi leaf class larg class learn previou section leaf class classifi multipl class leaf class paper classifi class larg class mediat classifi leaf class discov larg class descend leaf gener tabl select rel tupl descend leaf class appli apriori algorithm find strongli correl sourc set candid sourc set includ combin total number sourc order decid minimum support prune uncorrel sourc set frequent sourc set tabl straightforward calcul overlap statist combin strongli correl sourc comput overlap probabl correl sourc £ class total number tupl tabl empir evalu section present result experi conduct studi variat prune power accuraci algorithm class size threshold set sourc probe aim show threshold larg time identifi larg space larg class usag reduct accuraci learnt estim implement prototyp statist learn system algorithm paper system implement lc algorithm learn coverag inform sourc design data integr system mimic simpl mediat provid earlier section sourc coverag statist learnt statist learner system written java experi present conduct linux system main memori run red hat linux gener set data sourc export mediat relat sourc public lead research group artifici intellig research assum bind restrict sourc implement tabl perform experi sourc size rang tupl confer year tribut mediat relat learn approach highli depend av assum system design start simpl hierarchi reflect level abstract small number featur level base effici statist add addit node hierarchi good algorithm work design set attribut hierarchi small add actual number count tupl stead add class count threshold larg hierarchi small hierarchi figur lc learn time threshold threshold larg small hierarchi figur prune class lc call larg hierarchi small hierarchi base figur hierarchi level abstract leaf root differ number node level shown figur figur time space usag learn coverag statist data sourc leaf node featur av hierarchi attribut probe queri evalu perform statist vari threshold larg class measur number larg class amount time learn sourc coverag statist error estim threshold figur error induc coverag estim cs paper ai db aaai ijcai sigmod vldb ai cs paper year figur small hierarchi db aaai ijcai sigmod vldb aip ecai kr cikm ride kdd larg class assum result probe queri materi lc start learn rule acknowledg fact actual learn time involv time probe gener high latenc involv internet probe time vari base number probe number sourc queri time queri variat threshold valu necessit chose ignor probe time figur compar time lc learn rule threshold valu threshold note averag time lc gener rule set probe queri figur compar number prune class threshold valu figur lower threshold lc time learn rule lower valu support lc prune number class end learn number rule mediat turn explain learn time lower threshold valu contradict support threshold lc time learn rule threshold explain note threshold call prune routin higher test prune abstract class gener cartesian product featur av hierarchi threshold valu leaf node featur lead lesser number abstract class gener cartesian product reduc time prune lead reduct learn time lc threshold compar figur figur hold intuit threshold number small class prune reduct number larg class threshold greater support largest abstract class lc return root class rememb figur larg class threshold small larg hierarchi figur show lc perform uniformli small larg hierarchi lc gener larg number class small threshold valu requir learn time case threshold lc show contradict explain figur larg hierarchi lier year accuraci estim statist calcul error coverag make prototyp data integr system subset probe queri test queri integr engin map lowest abstract class coverag statist learnt engin issu queri sourc descend order coverag map class test queri statist class class prune lc figur lowest abstract class queri coverag statist identifi sourc call answer test queri tupl return sourc materi coverag statist learnt sourc map class call newli learnt statist real coverag sourc calcul accuraci estim coverag class real coverag £ sourc £ ¤ queri number queri learn coverag class comput absolut error error estim learner averag absolut error test queri interest rel order sourc method calcul accuraci estim tighter control requir figur error estim support threshold threshold number class prune queri map high level abstract class leaf node class belong estim error maximum fact rank sourc real estim coverag absolut error high low absolut error huge differ rel rank graph figur lc degrad gracefulli altogeth experi show lc algorithm associ mine base approach effect control number statist requir data integr sampl ideal threshold lc lc effect prune larg number small class high estim error relat work util quantit coverag statist rank sourc explor florescu al primari aim work coverag discuss coverag statist learn main aim paper provid framework learn requir statist share goal set statist compact florescu al achiev compact assum sourc identifi singl primari class queri export coverag sourc respect arbitrari class term coverag sourc respect primari class statist overlap learn statist coverag respect arbitrari queri class achiev compact dynam identifi queri coverag statist respect class learn point approach make overlap statist learn directli work al consid mine time statist sourc inform gather scenario coverag time statist import queri work complementari describ framework coverag time statist jointli optim cost coverag queri plan data integr work rank text context kei word queri submit engin recent work consid problem classifi text topic hierarchi approach involv estim relev textual natur preclud sophist estim coverag overlap paper motiv automat learn coverag overlap statist sourc effici queri process data integr scenario present set connect techniqu estim coverag overlap statist statist tightli control specif contribut model support hierarch classif set queri approach estim coverag overlap statist associ rule mine techniqu estim term statist coverag queri class overlap statist statist thought factor statist learn framework modif mine techniqu dynam control resolut learn statist detail present preliminari result show feasibl approach mine algorithm present paper integr prototyp system call develop support queri process data integr system intend support queri flexibl execut strategi parallel mine strategi learn sourc statist acknowledg anonym previou version paper comment suggest research support part nsf young investig award nsf grant refer subrahmanian queri cach optim distribut mediat system rakesh ramakrishnan srikant fast algorithm mine associ rule widom tsimmi integr heterogen inform sourc doan levi effici order plan data integr workshop intellig inform levi probabilist inform data integr intern confer larg data base vladimir tao learn time queri feedback applic queri optim vldb journal jiawei han data concept techniqu morgan sahami categor hidden web kambhampati optim inform gather plan intern joint confer artifici intellig ordil queri heterogen inform sourc sourc descript vldb freytag integr heterogen inform system vldb confer kambhampati joint optim cost coverag queri plan data integr acm novemb rachel alon levi scalabl algorithm answer queri view proc int conf larg data yu concept hierarchi base text categor metasearch engin environ june
HCI/636 4 bring robust program ieee comput languag environ pp bring robust program patrick girard laboratoir rue abstract program design applic exist approach concern safeti aspect program heavi techniqu exist develop safe domain involv softwar engin formal method techniqu idea part connect program safe convent develop start exist function built interact program environ call design interact applic verif properti step develop safe program introduct develop tool expand rapidli lot research commerci develop standalon applic main characterist context program knowledg program import part activ experienc comput experienc convent program java program assum develop visual program program author fast design applic permit autom repeat fact techniqu reduc complex interact applic necessarili ensur correct result applic work program focu express power intuit simplic concern safeti aspect develop result program ensur answer question difficult gener research program concern give order program correct applic program deal highli interact program major assumpt program field user thing program optim interact applic usag interact separ interfac function core consid basi good design split applic develop function interact perspect program approach heavi techniqu exist develop safe domain involv softwar engin formal method techniqu idea part connect program safe convent develop start exist function built interact program environ design interact stand applic contribut show program incompat safeti requir summari paper section defin properti concern safeti interact applic section deal tool develop present creat domain connect modul build interact complet applic section permit compar work product research laboratori commerci product give perspect work bring robust program ieee comput languag environ pp safeti interact applic softwar critic safeti defin collect properti relat softwar design interact system safeti defin differ specif interact system function core gener separ user distinguish aspect safeti function core safeti user interfac safeti secur properti concern function core ensur function core primit execut requir result execut conflict secur properti find link system insist honesti system make pertin inform potenti dialog structur ensur inform dialog structur ensur user correctli interpret perceiv properti elect interact system set properti consist restrict analysi main idea separ applic program expert domain show section method ensur properti tool realiz applic call mean main goal build interact applic exist function respect safeti opt separ applic call call made choic distinguish safeti aspect applic function core safeti aspect interfac applic separ permit distinguish actor tool knowledg actor domain expert understand convent program implement aspect softwar design actor prior experi program final user comput habit person work uniqu interfac softwar behavior philosophi lead definit pleasur learn concept work domain expert tool write function core high level safeti automat stage gener tool extract inform function core order gener file stage interfac function core interact build environ figur architectur modul call result compil function core interfac file gener modul fact interfac realiz final interact applic builder user test function core default altern stage design test final interact applic figur architectur place expert programm defin gener modul gener standard interact interfac function core build interact explain reason chose domain expert develop function core write part classic languag detail target game deal gener domain step consist design function core classic languag languag java classic languag made choic function core robust reason classic languag import express power visual easili describ requir model bring robust program ieee comput languag environ pp import ensur function core basi interact develop defin model interfac function core exploit descript gener standard good basi develop function order illustr describ concret reli chose simpl game involv competitor plai turn win consist align symbol grid restrict domain interact game human player figur show potenti interfac final applic figur interfac game game area place symbol player plain squar user plai mean method consist click directli squar player put piec consist move directli piec fact direct manipul applic state repres textual messag button modifi state function core button put applic back initi state button consist user cancel oper made undo case matter cancel action select grid squar concentr function core function good polici develop independ hci perspect find function applic chose classic popular languag creat class defin complet game defin subclass order model decomposit criteria class constructor initi defin respect rule automat administr player player repres integ valu game altern end game number turn administr function core function game consist plai squar function int permit modifi function core activ result action squar activ player piec function return state function core function result content grid squar cancel implement systemat cancel action function limit number undo function core specif model figur specif return state squar defin int int initi figur specif line show belong order ensur valu field notic syntax conform languag syntax boolean express written builder tool method initi check good result control stand piec stand piec appli formal descript method function core element verifi correct interfac function core assum respect condit valu bring robust program ieee comput languag environ pp interfac modul gener interfac file repres standard interact interfac function core class specif modul interpret inform interfac manipul core function interfac gener complet extract data function gener lex yacc tool specif gener extract inform written domain expert start extract inform connect function core class function retain syntact data type eventu inform ensur safe level core made choic repres inform visual shown figur interfac result compil interfac file function core find builder modul window call inspect window function activ interact button set left function insid column type return function type function determin function modifi function core function function core state identif classifi action state type action function function modifi function core state call dialog control user act final applic action function boolean return feedback inform call state function final applic state function inform state return valu state function evalu final applic action function call gener modul determin function type presenc absenc specif function figur state function descript postcondit distinct action function state function fundament analysi give inform function core interact applic permit activ function usabl state function core gener automat function activ simpl push button provid call function reason gener build function paramet dialog box give paramet interact specif gener check valid condit call function tool test function core check correct tool complet automat gener gener tool specif import safeti level part domain expert finish test function core fear enhanc applic builder modul studi builder role offer tool develop easili interact applic applic interfac file gener gener modul appli program demonstr visual program techniqu part describ modul firstli explain choic develop tool builder applic deal tool give detail part explain interfac program game final give mechan permit safeti realiz builder tool adapt toolbox strong interact featur creat interact object hold direct time direct activ function core action toolbox author cancel stage compil test final applic chose amulet toolbox amulet dynam administr object fact repres object dynam slot slot type chang dynam type add cancel slot object advantag administr direct manipul associ oper correspond typic direct manipul action action repres object call interactor amulet realiz design easili highli interact interfac unix macintosh system bring robust program ieee comput languag environ pp develop system test system unix system figur tool bar inspect window work zone tool box view window evalu window state window program window builder modul builder bring tool easili gener interact applic code gener gener modul gener model permit test standard avoid compil stage tradit tool approach simplifi applic design program correct error occur compil directli test applic method test applic program finish leav automat realiz modifi chose furnish design space independ inspect window solut permit visual model state design tool run context test reiniti lost user switch design mode easier understand state applic builder graphic design friendli graphic work environ main toolbar inspect window remain activ work zone design reserv interfac design put bring robust program ieee comput languag environ pp object tool palett window design mode design modifi widget size posit program object displai popup menu button tool palett tool manipul amulet widget select arrow control work zone object amulet object widget design put insid work zone button classic object modifi user click label text object show text rectangl graphic object repres rectangl dialog button simpl button confirm dialog visual window repres final applic design phase object creat work zone connect move exist object work object move time visual window switch design stage test stage click execut button tool palett work zone modifi applic anymor execut stage visual window connect inspect window transform transmit inspect window back design user push execut button version builder tool usual permit builder order develop kind applic creat applic screen applic screen focu program order techniqu develop safe interact applic applic program made work zone put widget work zone aspect program result repres state object interact associ function core function program program visual program direct manipul run visual window effect program import characterist dynam administr object ad cancel slot program consist modifi slot ad slot object interact program visual program builder interact object input direct input keyboard program consist interact associ action function function core indic develop visual program techniqu repeat task establish program techniqu demonstr order program easili interact interact program program demonstr order explain techniqu program demonstr game construct program move piec grid element direct manipul behavior program element techniqu duplic simpl action design put rectangular object repres grid creat rectangular object assign player piec program demonstr mode close window design window window control program demonstr process control button textual inform button call record wait state record state cancel program demonstr process push stop button close button return classic program record intellig interact design realiz design demonstr system move piec grid system detect warn design confirm box interact found interact design demonstr user builder inform function paramet associ interact intellig interfac program complet game consist duplic time behavior action result program final program visual action depend call result state function dialog box group inform modifi fact procedur method interact program bring robust program ieee comput languag environ pp state function amulet object state function function function core return object slot modifi design associ type token function grid object express type piec displai element grid firstli type token function paramet return modifi slot establish descript obtain complet program safeti deal safeti aspect applic develop secur permit safe applic develop lead function core defin function call error insist properti check function usag function paramet inspect prevent bad call test aspect descript result modifi slot inspect window builder environ color feedback function usag easili check function core function interfac interfac properti import permit interfac made correct point deal honesti observ properti relat work tool creat interact applic focu tool design applic simul game complex result firstli product share game factori tool design applic consist put object set defin behavior object send fix number event design event account associ modifi interfac state tool laid fix set object action user program set exce tool solut program game factori ad object call object written classic languag game maker similar game factori environ creation interfac approach object creat frame fix number event action action associ event action action variabl function insid system improv program creat function classic program languag interest ad classic languag function kind applic product origin fix number object permit build applic concept lack express power handicap ad code valid safeti solut compar main differ found fact mechan order understand valid extens usag system semiform descript design solv problem explor tool confin interfac program visual program classic languag creator system design creat game small simul user creat world object rule rule defin start final context program consist group rule system check rule appli rule match current context system suffer problem difficult creat larg applic mainten quickli complex fact simpl modif visual program impli modif part code program visual harder harder program size type applic applic develop place plai make applic visual zone develop environ person tool real construct tool simplifi kind applic elabor high level interfac safeti reli rule variant pre postcondit main differ rule express program part system ad simpl object coupl enrich larg program possibl gamut environ develop author complet design applic techniqu program demonstr program infer aim gamut provid tool complet develop interact applic program demonstr infer larg bring robust program ieee comput languag environ pp strength weak infer find option offer user reli limit infer system deduc program direct manipul address problem main interest safeti system gener prevent user make wrong action chain problem focu devot game relat goal gener complet standalon graphic interfac edit scientif data file analysi analysi class gener interfac access navig modifi aim program access save modifi data file view step work goal deal applic semant applic fix system examin member function oper limit action data perspect present permit develop safe interact applic stage work limit experi feasibl futur plan extend applic case process control domain distinct modul gener special tool develop domain expert set safe function core studi eventu lead complet formal specif realiz gener studi formal languag develop prove function core prevent user break applic rule builder modul pure interact tool develop complet interact applic exist function core verif properti step develop safe program improv task analysi usabl check pai attent pure system gamut examin infer account approach obviou pre infer mechan case refer repetit procedur pp de programm par de université de pp gram design principl interact chapman le base de la programm du troi servic du à present sur de amulet model effect user interfac softwar ieee transact softwar vol pp game factori maker program pp cypher end user program present human factor comput system smith child construct present analog pp program creat work pp program present human factor comput system gener user interfac data structur specif applic present linz
ML/637 6 learn languag collect case tune paramet yasubumi sakakibara klau jantk steffen lang institut social inform fujitsu laboratori japan htwk leipzig fachbereich germani abstract investig problem learn formal languag reason learn area artifici intellig formal framework learn languag recent develop induct infer manner show index class languag finit decid class languag includ class regular languag learnabl fix similar posit neg exampl present framework learn learn algorithm learn similar avoid trivial encod carefulli examin extent similar measur learn learn paramet similar show index class languag finit problem decid learnabl impli languag learnabl collect case learn paramet similar measur introduct reason deem import technolog widen bottleneck knowledg acquisit ai knowledg repres form case similar measur form rule enorm amount approach applic learn investig natur design learn procedur main task learn collect good case store case base describ knowledg classifi unknown exampl learn algorithm construct explicit gener exampl learn algorithm deriv investig power limit learn algorithm work manner introduc appli formal languag formal framework learn recent develop induct infer manner induct infer theori learn incomplet inform learn algorithm architectur behavior motiv artifici intellig research relev theori induct infer ai applic dealt induct infer exampl counterexampl learn formal languag studi area induct infer remark amount work induct infer index class formal languag index class effect formal languag admit uniform procedur decid membership formal languag accept list investig consid index instanc chosen languag target object tailor knowledg process kei reason prototyp case occur constitu list describ area gain insight fundament phenomena learn research focuss effect learn similar concept tune defin paramet section show index class languag finit decid show assumpt underli similar measur fix learn learn class languag includ class regular languag posit neg exampl shown interest class formal languag learnabl assumpt section framework learn learn algorithm learn similar avoid trivial encod carefulli examin extent similar measur learn interest import method learn similar measur adopt weight scheme case weight nearest neighbor algorithm accomplish weight similar reliabl case larger make closer word domain learn paramet weight similar show index class languag finit problem decid learnabl section appli theoret result learn list learn formal languag give formal definit learn formal languag introduc show gener formal languag framework index class languag finit problem decid learnabl fix similar measur definit learn finit alphabet finit set denot set string denot set string languag set string languag denot complement denot empti string similar measur oe defin similar string comput function real interv case base cb finit subset call case cb posit case neg case standard semant compet consid resolv conflict classif adopt standard semant standard languag repres similar measur oe finit case base cb defin restrict posit case target languag neg case complement languag case base cb describ finit subset natur requir learn induct infer manner definit learn similar measur priori fix target class languag problem learn problem collect case base learn similar measur learn denot set posit natur number target languag learn inform infinit sequenc element fs ing fs fs element form call posit element form call neg denot set inform inform natur number denot initi segment length denot segment nth element languag call consist posit exampl neg exampl learn algorithm input larger larger initi segment inform output sequenc converg limit element natur number natur number abbrevi lim class languag learnabl inform learn algorithm similar measur oe exist case base cb lim case base cb finit subset set label word write cb fin formal languag prove index class languag finit problem decid quot lemma proof straightforward theorem lemma index class languag singleton languag infinit languag similar measur oe repres languag case base consist posit case order prove encod techniqu develop effect word repres languag relat word languag artifici effect languag index class languag membership uniformli decid wrt total function decid string theorem index class languag finit problem decid similar measur oe languag repres oe finit case base cb posit neg cb fin proof defin similar measur oe satisfi desir fc denot set finit languag belong pc denot set infinit languag fc pc languag finit problem effect languag effect languag order repres finit languag fc result lemma requir counterexampl denot complement construct word word member word belong assum word construct proce step collect word denot minimum set ith step defin fu fu fu similar measur oe defin standard definit addit ae ae ae membership problem languag uniformli effect defin oe effect comput infinit languag case base finit fw case base wrt oe case repres finit languag neg case complement satisfi requir posit case target languag neg case complement languag corollari class languag proof finit problem languag decid result theorem result gener neg answer learnabl formal languag theorem class finit languag learnabl inform proof assum learn algorithm work wrt similar measur oe deriv contradict start observ learn inform cb easili defin inform actual case base infinit time fail infer inform notic cb posit case behavior fed inform finit languag fw initi segment learn cb cb cb string cb cb counterexampl case base cb belong meet cb obtain contradict assum string satisfi requir finit sequenc defin initi segment inform languag fvg cb due choic conclud cb element cb fail learn inform initi segment fed add posit case actual case base cb accumul case base repres oe assum inform finit languag initi segment neg exampl past point cb cb obtain subsequ add neg case actual case base cb produc case base cb oe cb fail infer finit languag fug contradict prove theorem corollari class regular languag learnabl inform proof clear class regular languag finit languag languag learn similar measur tune paramet consid similar measur fix target class languag learn develop case base fix similar measur restrict learn similar measur learn target languag class class similar measur oe finit case base cb account class comput similar problem reduc defin learn similar measur interest view point learn carefulli class similar measur consid introduc paramet similar measur learn interest class similar measur adopt weight scheme case weight nearest neighbor algorithm scheme base idea store case reliabl classifi accomplish weight similar reliabl case larger make closer word domain class languag assum fix base measur oe weight similar measur oe base oe defin ff oe ff comput real valu number construct weight similar measur oe defin languag finit case base cb ff simplifi concept weight similar measur oe base oe ff oe cb oe cb denot class weight similar measur oe base oe weight similar measur simul forget case simpli set weight ff class languag class similar measur learnabl inform wrt learn algorithm exist case base cb similar measur oe oe oe cb lim problem learn similar measur problem tune paramet ff ff learnabl wrt weight similar measur show index class languag finit problem decid learnabl inform wrt class weight similar formal languag shown theorem fix similar measur theorem index class languag finit problem decid learnabl inform wrt class weight similar measur proof denot target class languag learn order repres finit languag complement finit languag pc denot set infinit languag fc denot set finit languag pc finit languag fc denot result element odd indic pc fc natur number achiev infinit sequenc repres word languag pc complement finit languag fc construct effect member belong construct complet similar skip short base similar measur oe defin oe ae oe ae note infinit sequenc repres infinit sequenc repres weight similar measur oe defin ff oe case paramet ff construct learn algorithm assum consist induct infer algorithm base identifi limit produc output indic induct infer algorithm realiz identif principl wrt behav requir construct simul base inform target languag base denot index gener base fed sake write base shorthand languag guess base algorithm input figur assum cb flag algorithm begin read dx dx finit languag ff sy dy infinit languag sy ff sy finit languag sy ff sy ff sy end fig learn algorithm formal languag note algorithm effect comput halt produc base assum output indic decid base finit start observ immedi definit oe definit observ base describ infinit languag flag base oe cb denot actual case base oe actual weight similar measur guess cb repres oe definit oe obtain ff exampl cb ff sy base oe order show behav requir distinguish case case infinit languag base infer base base base cb repres converg final case base cb cb weight similar measur oe oe construct flag obtain observ infinit repres case converg final case base cb cb similar measur oe oe flag case finit languag inform base infer base base appli argument conclud converg case base cb repres case complement base oe denot weight similar measur converg definit cb fw cb cb impli assum cb ae string cb order show suffic show cb due definit oe oe choic definit prevent store posit case actual case base cb requir base base flag fulfil base infinit languag observ made conclud base oe base consist induct infer algorithm base base impli base base base oe cb oe due choic oe oe cb class regular languag languag learnabl inform wrt class weight similar measur gener learn algorithm figur full set exampl present point requir collect case base start empti case base correspond condit definit type learn call increment usual increment learn defin induct infer infer algorithm back histori inform present learn process formal definit increment learn chang condit definit oe dn oe cb empti case base oe assum initi similar measur learn algorithm figur simul base algorithm base index class languag finit problem decid exist increment consist induct infer algorithm increment learnabl inform wrt class weight similar measur increment learn import reason learn intend model human expert learn behavior consid learn process long time period mean updat theori process recent recogn histori theori develop adequ learn model essenti increment applic learn list introduc class formal appli theoret result learn list introduc studi effect learn languag pac learn framework learnabl studi class list simpl class defin formal languag base list class languag defin subclass regular languag definit list simpl defin relat string uw list list pair dn string label list defin denot string label equal index item ff true ff aa true ff ccc true fig diagram list list rule list diagram figur cg pair list theorem conclud class languag accept list wrt fix similar measur class finit languag repres result list deriv theorem class list learnabl inform gain class tunabl similar measur base defin simpl natur similar measur oe cont string oe cont list weight similar measur base oe cont class list list repres weight similar measur oe base oe cont finit case base oe defin ff oe cont real ff proof dn list repres case base cb weight similar measur oe base oe cont defin cb dn oe cont oe cont string length clear shown class list learnabl increment appli class similar measur defin theorem reflect order repres case case base adopt idea obtain statement class list learnabl inform wrt cont proof properli sequenc expon kn defin list kn kn assum inform initi segment continu sequenc case form exce kn sequenc learn suffici larg put current case base stabil learn process inform complet provid inform case occur learn algorithm investig necessarili fail kei reason normal form result list develop gener suffici list node kn kn similar normal form result built cont learn algorithm drop case collect case base case present fail natur similar measur introduc learnabl seemingli unnatur approach invok prove theorem properli greater learn power yield result theorem class list learnabl inform wrt class weight similar measur proof languag repres list invok decid finit regular languag proof straightforward theorem determinist approach list shown learnabl pac learn model algorithm present theorem naiv simul identif strategi effici learn learn essenti base collect case tune similar measur appropri attempt natur formal area tailor reason result exhibit enorm power learn similar class similar measur account approach fix similar concept assum coincid result learn function methodolog discov import similar concept learn seemingli natur class similar measur admit learnabl concept nice illustr limit reason autom learn stress import approach firmli base theoret comput scienc result cognit scienc idea formal approach reader consult coupl similar result respect detail inspect construct proof exhibit import distinguish case repres target languag learn fashion question formal cognit scienc concept prototyp acknowledg work author partial support deutsch forschungsgemeinschaft worth mention origin present investig fujitsu laboratori author opportun collabor refer david denni marc albert learn algorithm machin dana angluin induct infer formal languag posit data acm comput dana angluin carl smith induct infer theori method inform scott cost steven salzberg weight nearest neighbor algorithm learn symbol featur machin mark gold languag identif limit inform john hopcroft jeffrei ullman introduct automata comput klau jantk learn induct infer workshop comput learn theori page acm klau jantk type increment learn work aaai spring symposium train issu increment page stanford klau jantk steffen lang learn pattern languag workshop algorithm learn theori lectur note artifici intellig page ronald rivest learn list machin yasubumi sakakibara siromonei model learn set string workshop comput learn theori page acm articl process macro packag llnc style
AI/638 2 build behavior formal brian scassellati mit artifici intellig lab technolog squar usa abstract paper advoc approach build complex interact behavior robot system methodolog advantag structur decomposit complex facilit gradual task complex approach structur mean divid task research metric evalu progress task initi work model hint skill decomposit make task easier accomplish knowledg gain precursor report project build behavior humanoid robot robot learn reach visual target progress similar observ infant project outlin build social skill introduct main task field develop method understand complex interact behavior build integr system util multitud behavior surviv real find methodolog scale behavior system easili earlier base model adult biolog system comput fail provid structur facilit scale simpl behavior adapt behavior altern methodolog approach design robot system approach divid task behavior approach deal directli scale exploit exist structur facilit learn sophist group construct humanoid robot call cog figur part explor build behavior overcom scale problem robot built roughli approxim motion roughli approxim sensori capabl examin potenti benefit methodolog provid exampl methodolog appli robot system advantag methodolog methodolog advantag structur decomposit complex facilit gradual task complex explor draw exampl biolog develop implic insight develop robot system focu primarili human phenomena observ virtual anim develop structur decomposit difficult aspect build integr system simpli divid problem set manag behavior wai problem greatli influenc difficulti implement piec decomposit break problem manag piec overlap integr unnecessarili duplic effort decomposit piec combin desir behavior studi give insight decomposit complex skill effect develop increment process figur humanoid robot cog freedom approxim human auditori approxim human percept form behavior situat context earlier behavior provid precursor provid task decomposit necessarili minim set requir suffici set decomposit larger behavior task divid set research member research group decomposit set stabl behavior precursor evalu metric difficult evalu progress robot presenc set precursor behavior demonstr mean evalu progress system evalu system set behavior capabl compar result base standard observ techniqu cognit scienc develop facilit learn insight develop robot design identifi strategi infant exploit promot learn complex environ human develop fundament scale rang behavior human infant acquir year life easili dwarf complet rang behavior current robot system offer approach make explicit flexibl robot system offer insight simpler behavior bootstrap complex behavior obviou insight develop increment process stage prior structur behavior manifest place import constraint structur profici knowledg gain learn precursor behavior recruit complex behavior simplifi learn simpler behavior serv construct block behavior earlier form bootstrap structur provid knowledg learn difficulti stage minim develop gradual complex kei insight disadvantag start immatur uncalibr system system begin simpl gradual complex effici learn infant born low vision simplifi visual input process infant visual perform develop step abil process stimul true motor system newborn infant independ control freedom gradual granular motor control learn coordin full complex bodi process sensori motor system gradual significantli reduc difficulti learn problem develop consist gradual intern gradual complex extern world complex infant extern world carefulli structur caregiv carefulli control caregiv bia learn proce approach stark contrast machin learn robot learn hostil robot interact includ design gradual complex learn made robust learn improv exploit gradual complex intern structur inform gain learn hope learn increasingli sophist behavior method construct system scale autonom exampl system group explor build complex behavior studi human develop section detail exampl studi human develop build interact behavior common hardwar platform studi humanoid robot call cog figur robot approxim human waist varieti sensori system cog torso dof torso dof neck dof joint power motor seri exhibit natur compliant behavior similar human arm head assembl consist dof activ vision system activ ey wide narrow ccd camera head rate gyroscop auditori system microphon crude robot heterogen parallel processor network dedic sensori visual auditori gener processor motor control higher level comput local motor control handl dedic control faster addit full humanoid develop activ head similar mechan design cog ident comput code run platform section work develop test system point strictli engin approach problem task formul locat interest stimulu imag desir move arm extend postur intersect posit follow classic robot approach posit object imag plane convert trajectori eleven freedom determin kinemat dynam system comput requisit function solut incap adapt configur insight gener coordin task infant develop exampl build behavior diamond shown children ag month undergo number distinct stage ag infant gain amount motor control ey begin arm reach object step progress stereotyp reach visual axi directli object interest infant reach reach trajectori modifi infant contact object children stage begin reach rest posit front bodi miss return rest posit achiev point humanoid construct system learn foveat visual orient final reach target learn complet robot attempt reach target origin work conduct neck fix elimin freedom problem train place system learn saccad visual target imag correl algorithm construct saccad map relat posit camera imag motor command foveat ey locat system learn ballist reach angl gaze motion feedback move system learn ballist map ff posit ey head arm motor command move arm locat ff progress simplifi step inform project found williamson learn saccad system simpli attempt foveat object learn mistak map implement interpol lookup train initi linear map obtain randomli select visual target saccad current map find target imag correl updat saccad map base error step system converg averag pixel error saccad trial learn ballist map face fundament problem requir error signal accomplish motion detect routin find end hand reach ey point error simpli vector center imag project hand imag plane problem face error signal coordin imag plane solv saccad map learn previou step convert error vector imag coordin ey motor coordin saccad map determin posit order foveat hand saccad map transform error metric coordin system ballist map problem error signal coordin frame input coordin output train system learn techniqu similar distal learn rumelhart train forward map system ballist map forward kinemat model expect find arm gener window attent filter distract motion detect map implement radial basi function consist gaussian node distribut evenli input space node ident output vector learn routin initi map randomli select visual target saccad target learn saccad map attempt reach target current ballist map arm track end arm visual motion detect arm finish comput visual error signal center visual field arm posit transform visual error imag coordin ey motor coordin saccad map backpropag forward map gener error signal term arm coordin backpropag error arm coordin ballist map return arm rest posit step system train reach reliabl approxim requir minut train system capabl gener progress model insight gener skill framework task greatli simplifi comput ballist reach task accomplish approach current technolog resort approach task adequ address current enabl machin interact naiv human natur build social skill examin social interact perspect research program implement earli precursor social share attent mechan share abil select attend object mutual part larg repertoir social gaze point postur human easili master primari focu research investig individu develop skill recogn produc social cue implement model progress humanoid robot detail account project found interest share attent precursor social commun reason program build social capabl achiev wide rang natur interact untrain observ scassellati williamson construct machin recogn social cue human observ natur interact creat possibl machin learn directli observ untrain human instructor build model model provid test bed manipul behavior progress implement test altern learn abnorm progress investig share attent question develop origin complex commun skill human easili progress skill human acquir engag share wrong problem hope correct part complex interplai learn basi commun model share attent mechan share attent human singl monolith system evid childhood develop show mechan share attent present birth affect share attent begin model model coher account observ stage share attent behavior normal blind observ defici share attent partial explan observ abil primat share attent task model provid decomposit skill mechan provid transit stage current work identifi implement account skill decomposit skill decomposit pursu broken gaze interpol identifi util point step produc mechan share attent gaze tendenc monitor caregiv human infant innat prefer human face robot prefer human face ey simplest skill abil requir great deal perceptu motor control step engag share attent interpol gaze report great caretak move gaze child move gaze locat basic form imit serv focu child attent object caregiv attend function imit involv separ section step account engag share attent point gaze direct request share point gestur request observ deficit cover area perceptu cognit research miss mechan share attent critic defici comparison mental disord william defici area specif grant tend distal object understand point mechan share attent requir abil recogn postur gestur cue abil extrapol postur distal object singular complex gaze includ skill part program make task infrastructur extrapol bodi cue present appli domain final step enabl robot request share attent point object step add complex comput motor control requir skill stage combin imit achiev request share attent imit success point gestur robot learn make similar gestur robot learn coordin point visual target previou ad abil imit point request requir abil perceiv relev map perceiv gestur gestur robot capabl produc gestur time current result hardwar platform vision activ vision system shown figur camera captur view peripheri ffi field captur view central area ffi field view implement stage requir find face ey strategi identifi potenti face locat imag base face detector identifi target face saccad target learn map convert locat imag locat learn map extract imag ey imag detail method found identifi face imag convert grayscal pass stage search locat addit copi platform exist desktop develop platform minor differ import work report result section obtain platform greatli improv speed detect step select locat potenti target motion detect face evalu combin optim run face detect hz accuraci loss face detect method call design recogn frontal view face vari light condit ratio templat number region number shown figur overlai templat grayscal region convolv grayscal imag give averag grayscal region relat comparison region left forehead brighter left figur arrow head arrow denot lesser match metric number satisfi relat higher probabl face figur ratio templat face detect templat region grai relat face face locat convert motor command saccad map learn part ballist reach task detail previou section activ vision system saccad face ey locat templat camera map camera learn map map pixel locat attempt find differ scale imag differ pixel offset estim row column scale factor appli imag match scale row column offset appli imag imag map learn step scale factor estim activ vision techniqu move motor constant measur optic flow camera ratio flow rate ratio imag size correl find offset imag scale discov scale correl imag find match locat map face foveat extract imag ey imag extract imag readi process figur show result face detect routin typic grayscal imag saccad figur show extract imag ey obtain saccad target face figur face detector grayscal imag captur activ vision process ratio templat detect routin face found shown outlin work progress accomplish gaze process ad capabl detect ey contact extrapol angl gaze orient head neck locat pupil ey structur interest addit imit capabl ad track mechan output face detector classifi system mimic head nod caretak caretak shake head robot shake head simpl form highli select produc horizont vertic movement suffici head mimic action movement figur extract imag ey imag ject video clip imit html paper advoc approach build complex interact behavior robot system reason methodolog structur decomposit complex facilit gradual task complex motiv deeper explor methodolog exampl humanoid robot project learn reach visual methodolog provid structur system knowledg limit complex task build mechan share begin mean complex social skill set manag task facilit bootstrap advanc skill perspect enabl group tackl complex task domain formal methodolog refer mit press altern essenc american associ artifici intellig submiss develop neural base higher cognit vol york academi chapter time human infant infant neural inhibitori control pp explain basil blackwel develop erlbaum constraint cortic develop pp learn distal cognit scienc social modul face theori mind individu william journal cognit neurosci point humanoid anim proc societi adapt societi adapt behavior evolutionari histori cognit special trend neurosci mechan share attent humanoid cognit paper aaai fall symposium aaai press foveat activ vision technic mit artifici intellig lab submiss find ey face foveat vision american associ artifici intellig submiss perceiv recogn phd massachusett institut technolog system approach develop pp seri elast master mit depart electr engin comput scienc
Agents/639 1 direct comput robert janet ben eric adam steven tom brian steven david washington abstract focu user task comput devic attract vision futur comput hardwar network infrastructur realiz vision preciou applic run infrastructur lack applic stem larg fact hard deploi applic comput space argu exist approach distribut comput flaw ax appli sketch altern suit space applic data function evolv gracefulli global comput infrastructur applic acquir resourc continu provid servic highli dynam environ comput requir common system applic run rang devic automat distribut instal introduct comput comput infrastructur seamlessli ubiquit aid user accomplish task render actual comput devic technolog larg basic idea comput deploi wide varieti smart devic work live space devic coordin provid user access inform support user complet task hardwar devic network infrastructur realiz vision increasingli preciou applic run infrastructur notabl tion email commun world wide web medium electron publish client interfac applic lack applic directli relat fact difficult deploi applic comput environ comput space map combin mobil stationari devic draw power servic network achiev task result distribut ten thousand devic servic kei challeng develop build applic continu provid devic roam infrastructur network limit part research build system architectur comput base experi exist distribut comput technolog meet challeng discoveri servic adapt comput environ benefici comput applic suffici successfulli deploi applic comput space argu current approach build distribut applic deepli flaw express depth call fault line rest explor fault line summar tabl section make case distribut object outlin approach integr applic data function section discuss write applic continu adapt highli dynam environ section argu common comput platform span class devic conclud paper section problem solut object scale distribut system avail applic servic limit intermitt program distribut applic increasingli unmanag encapsul data function singl abstract transpar highli dynam environ heterogen devic system platform data function separ program applic acquir resourc time common system platform integr api singl binari format tabl overview fault line discuss list solut fault line data function fault line concern relationship data function repres distribut legion globe target global comput environ explor object unifi abstract data function skeptic object distribut comput reason object encapsul mechan base implement data layout chang frequent design interfac accommod implement hold system evolv assumpt hold global distribut comput environ common data html industri group standard notabl world wide web evolv slow pace applic vendor compet lead differ applic interfac implement faster pace innov prefer store commun data gener easier access passiv data activ object safe access activ object distribut system import notabl system secur resourc difficult address access passiv data reflect access regular html pdf document work activ content result continu string secur breach base argu data function separ encapsul object data function depend data storag mobil code data manag system readi reli mobil code servic bayou propag updat procedur simpli data support sql store includ fulli featur java virtual machin mobil code system limit success absenc standard data model data manag solut project explor mobil agent wide part lack storag manag origin market mobil code platform success access result tension integr data function tightli form object integr tightli resolv tension data function separ introduc abstract group data repres essenti record option type function provid implement unit environ serv unifi store provid combin role serv file system directori nest process tradit oper system environ make group data function data function evolv separ applic store exchang avoid problem object discuss argu data function support equal larg distribut separ argu program implement java make liber orient languag featur inherit provid function architectur separ data tupl repres data compon express function program chang fault line transpar access remot resourc build distribut file system remot procedur call exist distribut system mask remot resourc local resourc transpar simplifi applic develop access remot resourc simpl local oper cost failur resili servic avail network connect remot server fail servic environ remot servic inaccess distribut applic provid written expect chang transpar mislead comput encourag program style failur unavail resourc view extrem case environ ten thousand devic servic unavail resourc common case advoc program style forc applic explicitli acquir local prepar resourc time applic explicitli bind resourc includ storag commun channel control bind forc applic period renew provid timeout unavail resourc distribut jini control access remot step requir resourc explicitli bound resourc discoveri late effect bind resourc reduc exposur failur environ style program chang strict disciplin applic develop program chang present opportun enabl system servic make easier build applic support save restor applic checkpoint migrat applic includ implement inherit multipl dispatch provid java provid match singl inherit singl dispatch method data node checkpoint migrat primit build failur resili applic improv perform distribut system migrat attract applic follow user move physic world checkpoint migrat affect environ includ nest environ checkpoint captur execut state compon environ tree save state form make restor save state migrat move environ includ compon store devic applic dynam acquir resourc checkpoint migrat transpar limit resourc environ tree checkpoint migrat implement avoid complex typic full process checkpoint migrat migrat wide area practic main idea program chang forc develop build applic cope highli dynam provid primit make easier implement applic common platform fault line root inher heterogen devic comput environ comput devic cover wide rang comput storag form user interfac expect heterogen time class devic pad car comput wide applic typic develop specif class devic system lead separ version applic server applic typic distribut instal separ class devic processor famili heterogen develop applic run platform exceedingli difficult number devic explicitli distribut instal applic class devic processor famili face migrat wide area argu singl applic program interfac singl binari distribut includ singl instruct implement rang devic comput environ common api make develop applic common binari format enabl automat distribut instal applic import note java provid common platform java virtual machin attract virtual execut platform java applic platform meet comput space platform librari target convent comput fail separ data function encourag program discuss section current hardwar trend advanc virtual execut java virtual machin common languag runtim expect devic implement comput platform devic capac implement full small sensor interact proxi emul network protocol legaci applic integr commun standard network http soap exchang data standard xml comput platform run wide rang devic common denomin core api applic assum servic defin core implement basic function framework common platform prevent individu devic addit servic applic simpli demand addit servic treat option dynam discov applic part research explor scale common platform rang devic cue research project successfulli asynchron event point devic architectur reli asynchron event express control flow system interfac applic compon interact exchang asynchron event hope design aid scalabl architectur implement run window linux port ipaq handheld comput outlook argu current approach distribut comput comput space identifi fault line exist distribut system program continu provid attract paradigm applic data function separ comput applic typic evolv independ applic explicitli program gracefulli handl chang style program strict disciplin applic enabl system checkpoint distribut system scale comput requir common system applic run devic infrastructur automat distribut instal explor address fault line system architectur comput effort understand applic taught undergradu leverag basi project build applic architectur collabor research depart implement addit infrastructur servic top inform includ sourc acknowledg david refin observ macmillan anonym review comment earlier version paper refer design implement intent system acm symposium oper system page island south dec wollrath jini specif simpl object access protocol world wide web cook inherit acm confer program applic page oct hansen nucleu multiprogram system commun apr borriello integr design framework distribut system design autom page june modular open class symmetr multipl dispatch java acm confer program applic page oct katz architectur secur servic discoveri servic intern confer mobil comput page aug futur comput scientif aug borriello centuri network comput intern confer mobil comput page aug guid featur oct meet virtual machin usenix symposium oper system design page oct culler distribut data structur internet servic construct usenix symposium oper system design page san oct system architectur comput acm sigop european page sept system architectur direct network sensor acm intern confer architectur support program languag oper page nov lewi core legion object model ieee intern symposium high perform distribut page aug mcgraw secur busi mobil code wilei comput john wilei editor agent acm press feb walker agil adapt mobil acm symposium oper system page oct effici portabl web server usenix annual technic page june rad java emerg standard richter microsoft net framework deliv platform web sept manag updat conflict weakli connect replic storag system acm symposium oper system page copper mountain dec nest java os structur mobil code acm sigop european page sept van tanenbaum distribut system ieee weiser comput centuri scientif sept
HCI/640 4 mix merg real virtual world tamura pp isbn challeng make augment realiti work outdoor ronald azuma laboratori canyon road ms ca usa background augment realiti make augment realiti system work outdoor natur step develop ar ultim goal ar displai oper environ place section overview develop contribut current research program laboratori augment realiti receiv amount attent paid virtual environ virtual fact field share common ancestor forgotten origin hmd system optic displai creator system explicitli attempt regist virtual object combin virtual real motiv user issu command problem graphic engin suffici power draw menu command virtual interact rate physic put larg sign command real user virtual select real sign point hand control common effort virtual environ late earli research augment realiti began problem build augment realiti research effort registr problem proper align virtual difficult problem sourc small amount error tracker provid requir perform good ar applic accept research histori tackl area contribut optic track system hmd built analyz optic hmd system predict techniqu greatli reduc registr error wrote survei paper summar work field current registr prototyp system demonstr displai applic typic track approach imag shown video displai aid correct remain error ensur virtual properli align real object captur video imag good ar applic requir effect demonstr prototyp system built manufactur mainten aircraft part entertain current effect prototyp system exist close actual factori floor progress registr solv problem ar reli requir carefulli control environ user walk system work specif limit rang viewpoint constrain problem registr problem greatli restrict flexibl system make difficult build effect ar system expert knowledg symptom unavail commerci system choic virtual environ offer augment realiti system contrast situat todai ideal put ar displai walk restrict ar displai work environ prepar room object ahead time investig ar system work indoor outdoor work direct reduc calibr requir geometri observ object start continu make explor difficult problem domain explor ar outdoor indoor applic domin field explor outdoor ar system applic current research direct ar personnel laboratori fund provid darpa grant project call geospati registr inform soldier primari personnel involv project bruce howard ron mike daili collabor research partner north carolina chapel hill greg southern california neumann system compani nichol jim initi user project technolog suit varieti civilian user applic chapter outlin motiv potenti applic ar outdoor situat analyz problem face build outdoor ar area track conclud suggest gener approach motiv outdoor augment realiti augment realiti system provid accur registr outdoor interest make applic area provid natur interfac wearabl area grow interest academia industri user walk outdoor spatial locat inform directli displai view navig identifi featur interest wood pull gp convert gp compass read locat mental align inform map environ outdoor ar system perform task automat displai trail path landmark locat directli view surround cognit load soldier locat danger area readili appar ey outdoor ar system group user work user wide difficult establish common frame refer describ spatial locat inform instruct team member white build left red useless listen world vantag point speaker person ar displai provid unambigu method share inform person outdoor ar displai natur interfac wearabl standard wimp interfac map wearabl desktop metaphor user walk outdoor hand free alloc complet attent comput augment realiti approach applic applic area visual locat event past futur perform tourist visit histor civil war battlefield locat due time difficult modern visitor imagin site past histor site stage event volunt wear cloth time period histor event tourist equip outdoor ar system version live histori hmd cover modern build monument background directli ground union moment charg gut interior modern fill includ gold statu athena middl tourist student walk ground ar displai gain understand histor site import event place ar displai show architectur carri urban design show client politician build walk adjoin understand affect nearbi resid effect outdoor ar displai applic view indoor applic find role outdoor situat mainten repair vehicl field user stuck tradit repair facil aircraft technician displai work aircraft termin combin displai portabl scanner provid field possibl ar outdoor entertain applic unexplor outdoor ar applic offer interest attempt build augment realiti system work outdoor steve group columbia demonstr tour user view inform link specif build columbia campu walk wearabl cmu vehicl mainten applic outdoor set previou work achiev accur registr wide varieti outdoor offer perform requir outdoor applic analysi problem area difficulti prevent outdoor ar system deploi ergonom issu face wearabl pc system appli outdoor ar system displai suffici contrast work outdoor set requir biggest challeng li accur track determin posit orient suffici accuraci avoid registr error section analyz problem area weight power issu major differ outdoor indoor ar system amount infrastructur resourc indoor system work luxuri condit resourc limit budget ergonom constraint indoor applic worri user wear user carri comput power suppli extens infrastructur wider rang track technolog practic outdoor situat dramat outdoor user comput power budget larg user walk outdoor carri weight power issu concern amount gear user carri depend type person applic helmet militari pilot typic weigh pound civilian applic support wider user base weight limit minim weight head critic minim weight backpack weight concern develop wearabl upcom portabl devic provid improv outdoor ar system leverag displai indoor control light match displai outdoor ar displai work wide varieti light bright sunlight night contrast condit displai devic close bright requir match rang laptop owner read displai bright sunlight optic displai big problem user real world directli displai upcom bright visibl bright sunlight provid shade devic cut amount light enter displai pair video avoid problem set exposur camera match input price dynam rang real world compress rang output gener smaller resolut displai monitor lower resolut human ey combin loss detail accept applic primari motiv video track approach opportun track reduc modifi environ place fiduci marker desir video displai lower outdoor applic video demand greater amount comput power limit outdoor applic track accur track indoor hard accur track outdoor daunt main differ situat control environ fewer resourc differ solut indoor ar directli appli person outdoor ar system indoor ar system achiev accur track registr carefulli measur object highli constrain put color dot track dot video camera approach violat constraint outdoor situat control outdoor environ reli modifi fit system militari applic realist friendli wear color dot aid track system expect measur object environ approach requir comput resourc practic singl outdoor user system sgi workstat capabl suffici bandwidth process captur frame interact rate initi outdoor ar system accur registr outdoor applic stringent requir indoor counterpart doctor perform needl requir virtual marker accur walk angular error accept cue user landmark environ ultim goal registr circumst analyz problem examin individu track technolog outdoor includ closer examin data outdoor orient sensor global posit system worldwid coverag measur posit typic meter regular gp meter differenti directli measur orient differenti accuraci suffici view distant nearbi meter rang meter posit error result registr error typic updat rate differenti gp receiv claim hz suffici distant object nearbi object gp receiv establish suffici baselin recov vehicl orient user walk practic baselin requir larger user support gp receiv claim accuraci centimet achiev accuraci interact rate difficult due avoid requir antenna highest object surround practic circumst startup delai gp unit vari depend unit good initi guess current locat time gp requir direct suffici number work open area insid urban hill gp block militari gp easili jam inerti dead inerti sensor immun disturb main problem accumul error time recov orient rate easier posit linear requir integr requir ship aircraft inerti measur unit drift fraction hour orient mile hour posit sensor singl user walk due cost weight rate gyro form factor human exist suffici shorter time interv acceleromet exist provid perform desir drift long time requir acceleromet bia accuraci order magnitud commonli todai dead reckon tracker solut individu user walk activ set activ transmitt receiv ultrason commonli indoor virtual environ system modifi environ manner outdoor feasibl outdoor mainten applic approach tether user area outdoor activ requir infrastructur support structur hold sourc easi construct outdoor outdoor practic modifi environ rang oper passiv video sensor track user locat base visibl view surround abil track approach video sensor lose lock view obscur comput vision techniqu robust provid complet sole landmark track solut rel absolut track base featur scene difficult yield brittl result track fiduci indoor ar system video process intens feasibl real time wearabl pc system figur turntabl measur distort electron compass navig turntabl made avoid creat addit sourc distort electron compass tilt common tracker virtual environ head tracker consist electron compass tilt sensor tracker small unit claim yaw accuraci smaller error roll pitch sensor attract potenti provid orient measur support infrastructur experi navig updat rate approxim hz main limit encount delai sensor output compass highli sensit disturb magnet field magnet field weak signal figur show equip measur distort field mechan turntabl made avoid place sourc distort compass measur compass output devic locat time compass sampl interv compass appar sourc compass measur error distort pattern vari significantli time shown figur measur sourc distort realist ar difficult complet avoid sourc magnet distort realist distort error typic distort make difficult sensor ar system calibr strategi curv figur radic shape develop adequ model distort challeng magnet distort significantli geograph time locat compass tabl turntabl figur distort data shown figur axi yaw orient compass axi rel error initi orient output sit user move sensor sit output typic visibl insid ar displai recal appar width full moon move order partial due motion translat motion chang measur orient true orient chang basic limit tilt sensor small motion impart casual walk wind render output inaccur expect sensor walk ride ar system sourc output delai time millisecond due settl time affect comput yaw read serial line commun slow sensor lag magnitud ar applic system delai singl largest contributor registr error system problem reduc switch compass tilt orient sensor technolog magnet distort locat accur sensor chang fact distort introduc move occur sensor orient sensor type interest start point outdoor ar suffici achiev ultim goal approach analysi track technolog find singl technolog complet solut singl technolog project provid perform requir meet goal combin track hybrid feasibl approach term hybrid approach system complex cost provid robust result hybrid approach weak individu technolog cover result system behav robustli sensor appli individu area outdoor track critic attack answer examin contribut registr error simpl system similar current person outdoor ar track system measur posit differenti gp orient compass tilt sensor similar perform discuss section assum object view meter user rotat head moder rate note heavi measur peak head rotat rate minim peak rotat rate exce assumpt conserv assum sensor millisecond delai rest system add millisecond ms peak error differenti gp measur peak error compass expect contribut registr error shown tabl contribut rang error registr error posit error static orient error dynam orient error tabl quantifi contribut registr error largest individu contributor dynam orient import tackl initi sourc attack reduc sourc latenc system remain predict mean sourc larger accur track outdoor difficult worthwhil challeng develop track technolog work outdoor realm lead improv ar virtual environ system research direct push ar system highli prototyp system todai portabl system deploi improv area made ar system commerci wide hope enabl applic earlier imagin acknowledg work area fund darpa contract darpa visual program refer ronald track requir augment realiti commun acm ronald gari bishop improv static dynam registr optic hmd siggraph juli comput graphic annual confer ronald gari bishop analysi predict siggraph august comput graphic annual confer ronald survei augment realiti virtual environ michael ulrich neumann dynam registr correct augment realiti system ieee comput graphic applic gari person commun blair tobia höllerer tour prototyp mobil augment realiti system explor urban environ intern symposium wearabl comput octob richard registr error analysi augment realiti virtual environ kevin regist perspect contour object correspond orthogon polynomi vrai march april elliot understand gp principl applic artech isbn jame augment realiti ieee transact visual comput graphic march jim wire jet set wire yamamoto tamura ar case studi collabor augment realiti ieee vrai march bradlei wimp interfac consid fatal posit paper ieee vrai workshop interfac wearabl comput march mark william mari henri fuch techniqu realiz guid needl siggraph august ronald robert stefan henri fuch demonstr optic tracker scalabl work area displai system symposium interact graphic march april
DB/641 3 integr framework beneventano £ bergamaschi £ vincini università di modena reggio dsi modena bologna bologna abstract electron commerc peopl good exchang inform busi transact main challeng design infrastructur inform retriev data locat sourc obtain integr view overcom contradict redund virtual catalog approach conceiv instrument dynam retriev inform multipl catalog present product data unifi directli store product data catalog paper support tool integr data structur data develop momi environ multipl inform project introduct web internet intranet transform electron inform system singl isol node entri point worldwid network inform exchang busi transact busi commerc opportun technolog defin activ electron marketplac repres virtual place buyer seller meet exchang good share inform obtain hypertext catalog compani compani equip data store system build inform system data relat heterogen substanti problem face field due structur applic lack common semant differ inform sourc semant differ kind rang simpl contradict research partial fund italian murst project wareh mine di sourc structur conflict repres main challeng design infrastructur inform retriev data locat sourc obtain integr view overcom contradict redund virtual catalog approach conceiv instrument dynam retriev inform multipl catalog present product data unifi directli store product data catalog interact multipl heterogen interact uniform virtual catalog paper design support call inform integr develop momi project momi project environ multipl inform beneventano bergamaschi aim integr data structur semistructur data sourc support tool semiautomat integr heterogen sourc schema xml carri integr semant approach descript cluster techniqu extend model repres extract integr refer describ sourc support design gener integr view sourc virtual express xml standard xml definit global virtual view momi infrastructur open integr inform system interchang xml data file outlin paper section present momi system architectur relationship run remaind paper section momi approach data integr focu common thesauru analyz relationship automat extract momi section present framework repres unifi solut integr process section make comparison relat work give remark system architectur refer integr project roth momi inform integr base conceptu inform architectur figur system function element commun corba common data defin describ sourc schema integr defin momi subset standard mediat languag develop work group introduc constructor support semant integr translat metadata descript sourc common translat global queri express queri languag queri express sourc languag export queri result data queri manag design modul process integr descript receiv wrapper deriv integr inform sourc qm modul perform queri process optim qm gener queri wrapper start queri pose user global schema qm automat gener translat queri set subqueri sourc unifi global answer user origin contribut momi relat avail set techniqu design face common problem integr inform semistructur structur data momi capabl explicitli introduc kind knowledg integr design suppli domain knowledg common role share ontolog sourc built common thesauru set intra describ knowledg class attribut sourc base refer identif class candid integr subsequ deriv global subset figur momi system architectur momi support inform integr creation integr view sourc virtual autom perform valid kind knowledg integr momi combin reason capabl descript logic cluster exploit common ontolog sourc construct lexic knowledg wordnet valid integr knowledg global virtual view express xml open integr system prototyp relationship semant rich sourc schema inter relationship introduc relationship relationship express intra knowledg sourc schema relationship syn defin term consid synonym eri consid sourc sourc denot bt defin term gener mean bt relationship symmetr opposit bt nt rt posit defin tween term gener context consid sourc relationship implic structur involv class compress fuel cod drive citi km highwai km cod figur relationship relationship bt nt class establish relationship relationship defin mean instanc mean instanc instanc mean instanc subset instanc mean instanc joint instanc wrt introduc overlap relationship assum default overlap relationship class relationship relationship structur class semant relationship run order illustr momi approach integr car manufactur involv collect inform vehicl fiat semistructur xml inform car italian car factori relat inform kind car schemata built analyz web site factori integr process momi approach intellig schema integr articul gener common thesauru common thesauru set terminolog describ intra knowledg class attribut sourc schema express knowledg form terminolog relationship hypernymi class attribut extract lexicon deriv relationship wordnet affin analysi class relationship common thesauru evalu level affin class intra perform figur fiat inter sourc concept affin introduc formal kind relationship occur class integr point view affin class establish mean affin coeffici base class class structur relationship common thesauru cluster class class affin sourc group cluster hierarch cluster techniqu goal identifi class integr describ semant relat inform gener mediat schema unif affin cluster lead construct predict schema class defin repres class union attribut global schema analyz sourc class deriv basi pose queri sourc introduc gener common thesauru start lexicon relationship definit wordnet wordnet wordnet lexic develop princeton cognit scienc laboratori wordnet inspir current psycholinguist human lexic memori connect theori regard import resourc field comput textual analysi relat area lexic wordnet current version lemma organ synonym set start point lexic semant deriv observ exist convent associ word form pronounc associ give rise synonymi properti express word synonym group synset note synset exist synset synset set polysemi properti singl word mean correspond word form figur mean mean call lexic word mean report row row repres column repres word form matrix element base form mean refer address person organ refer comput address informat sphere base form mean element matrix null indefinit row row indic word null element repres element column base base form column index semant relationship schema term concept term associ definit class attribut term form class attribut definit class attribut qualifi class qualifi sourc schema class attribut qualifi class belong class attribut set set word relat synset defin wordnet start point defin semant relat word relat obtain wordnet singl word synset context relat correl relat hypernymi set relat synset synset set relat function insert give synset set correl relat link synset share synset synset set set defin basi lexic set word synset obtain relat word relat exist synset word set word set relat word defin relat deriv semant relat insert common thesauru synonymi correl rt basi algorithm develop input term relat schemata output detect semant input output syn bt start schema design fix set word chosen choic involv base form choic design support choic system base form wordnet morpholog processor figur select obtain base form morpholog processor base form design directli introduc mean choic design relat mean choic relat mean made concept complex express word fuel belong gener relat substitut add knowledg cod foreign relat extract relat schema structur design select mean found wordnet start base form chosen step word relat share base form figur mean wordnet relat base form obtain select word obtain suitabl examin context shown base form figur slim hypernymi hierarchi note relationship strang true context resolv mean ambigu coupl mean suppli wordnet concept sourc design choic coupl mean syntact categori verb adject adverb figur approach reduc complex design problem find relat divid mean list practic word work time read remain occupi choic similar mean speed part select coupl mean figur symbol denot mean chosen design show gener hierarchi mean order design difficult choic figur case inherit agent wheel vehicl concern railwai inherit select end show relationship deriv wordnet figur design figur relationship extract slim delet show relationship add gener common thesauru common thesauru set terminolog describ knowledg class attribut sourc refer defin identif class candid integr subsequ deriv global common express knowledg form terminolog relationship relationship class attribut common thesauru construct increment process relationship ad relationship hold level relationship extract sim modul analyz schema separ rt relationship extract specif foreign kei relat sourc schema foreign kei primari kei origin referenc relationship extract show relationship automat gener relationship hold schema level extract slim modul analyz sourc schema wordnet suppli ontolog fiat sourc lexic relationship deriv wordnet ratio syn relationship suppli directli captur specif domain knowledg sourc schemata model entiti consid special vehicl entiti relationship automat extract lexic structur suppli nt crucial relationship forc belong common thesauru gener global integr schema mean wrong relationship subsequ integr process produc wrong global schema system design detect wrong relationship perform relationship valid step valid base compat domain attribut valid invalid terminolog relationship distinguish check execut terminolog relationship defin attribut syn relationship mark valid special bt relationship mark valid nt relationship mark valid attribut domain defin union valid relationship recogn domain compat refer common thesauru result show relationship control denot valid invalid consumpt rt km infer hold infer exploit infer capabl examin domain infer relationship ad common thesauru consid subsequ phase construct global schema detail descript process terminolog relationship defin step hold level definit step design terminolog relationship bt nt class establish hold defin relationship specif impli insert relationship common thesauru enabl subsumpt comput infer consist check class note infer relationship show paper simpl comput inherit mechan descript logic infer comput subsumpt check consist complex schemata presenc interschema relationship global class map tabl start output cluster global class repres mediat view class cluster global class set global attribut map local attribut attribut local class belong global attribut obtain union attribut class belong fusion step redund elimin account relationship store common thesauru global class persist store map tabl column repres set local class belong cluster row repres global attribut element repres global attribut map local class element tabl assum figur common thesauru relationship detail descript map select tool assist design integr phase global attribut map local attribut attribut concaten valu assum set attribut belong local class case situat occur global attribut assum set belong local class choic depend act selector case global attribut refer local attribut constant set design rank case attribut class correspond global attribut qm compon exploit map tabl inform rewrit user queri set subqueri submit local sourc framework integr process step implement separ modul design framework repres unifi solut integr process design graphic interfac reach global virtual relat integr step specif interact softwar modul modul involv corba object interact interfac perform sourc phase user select sourc integr wrapper perform translat sourc descript model descript model step involv sam modul relationship schema interact sim modul system lexicon interact net lexic design suppli ad common thesauru figur relationship involv relationship defin interact integr design relationship exploit detect overlap class base knowledg ri common thesauru global class creat figur obtain cluster includ car data cluster motor engin inform map tabl global class gener previou user modifi global virtual view automat system figur cluster definit final step integr process export global virtual view xml ad xml tag repres map tabl relationship xml definit global virtual view momi infrastructur open integr inform system interchang xml data file common thesauru translat xml momi share ontolog semant ontolog languag relat work area heterogen inform project base mediat architectur develop popular tsimmi project approach model repres heterogen data msl specif enforc sourc integr pattern match techniqu perform predefin set queri base queri templat differ momi tsimmi predefin queri execut sourc modif manual mediat rule rewrit perform garlic project build complex wrapper architectur describ local sourc oo languag definit garlic complex object manual unifi local sourc defin global schema sim project creat global schema definit exploit descript logic loom describ inform sourc global schema garlic sim project support user queri schema predefin subset inform manifold system sourc independ queri independ mediat input schema inform manifold set descript sourc system creat plan answer queri underli sourc descript algorithm decid inform sourc gener queri plan implement integr schema defin manual approach paper approach inform extract implement momi system convent architectur tool interfac emploi modul goal interact custom momi techniqu base specif requir integr process approach descript logic modul provid infer capabl gener common thesauru terminolog relationship futur research devot develop queri manag compon momi queri optim base definit axiom integr constraint defin global class problem literatur queri rewrit queri answer studi activ recent year origin aspect queri manag consist emploi descript logic base compon perform semant optim step global local minim number access sourc volum data integr result execut refer cy knoblock retriev integr data multipl inform sourc int journal intellig cooper inform hsu queri process sim inform mediat advanc plan tool intellig integr inform intern confer system scienc januari vincini tool semant queri optim oodb int confer data engin vincini inform momi project demonstr vldb intern confer larg data septemb page morgan vincini semant integr semistructur structur data sourc sigmod march vincini integr heterogen inform sourc journal data knowledg ullman mediat languag april catarci lenzerini repres interschema knowledg cooper inform system journal intellig cooper inform editor object odmg morgan kaufmann san garcia widom tsimmi integr heterogen inform sourc ipsj daml joint daml van klein oil nutshel european knowledg acquisit confer eurowordnet multilingu semant proc spring symposium text speech hull king al arpa refer arthur keller smart catalog virtual catalog intern confer frontier electron oct ordil queri heterogen inform sourc sourc descript proc vldb page ag miller lexic english commun omg object manag group mt roth scrap wrap wrapper architectur legaci data sourc proc int conf larg schmitt increment approach schema integr refin relationship int conf inform knowledg manag acm page acm press
AI/642 2 coastal navig mobil robot navig uncertainti dynam environ nichola roi wolfram burgard dieter fox sebastian thrun school comput scienc comput scienc depart carnegi mellon bonn pa germani septemb abstract ship coast contin navig absenc tool close land determin high accuraci similarli mobil environ global accur local feasibl environ lack dynam obstacl peopl block sensor demonstr techniqu gener trajectori account inform content densiti peopl environ trajectori reduc averag posit certainti robot reduc likelihood robot lost point method successfulli implement mobil robot museum week period nation museum american histori introduct essenti compon oper mobil robot system abil robot local determin posit space consist accur sensor data dead reckon odometri data solv small error odometri build eventu dramat error robot belief posit distanc longer robot inform environ track success local method determin robot posit rel map laser camera data local method fail common condit proxim sensor laser sonar finit mean suffici refer point sensor fool dynam peopl move robot good dynam obstacl camera fail region lack suffici visual blank wall ceil condit mobil robot navig reliabl real world potenti failur local method solut problem inspir tradit navig ship ship coast contin navig absenc tool close land determin high accuraci success method result coast line inform structur accur local navig suffici close area map high inform likelihood lost minim coastal navig techniqu consist ffl model inform content environ model account sensor limit dynam obstacl ffl plan trajectori account inform content model environ obstacl inform respect local uncertainti develop coastal navig model inform content start sensor limit account dynam obstacl develop method term navig suggest thoma privat commun work report combin inform content path planner gener plan reduc expect local error final show result framework navig probabilist figur show overhead environ map probabilist occup grid cell probabl occupi black cell high probabl cell insid wall white cell cell free space figur map nation museum american histori white area correspond open black area occupi space size map map nation museum american histori learn robot part demonstr robot technolog descript previou figur show week period museum figur robot experi present paper sensor gener map sick laser rang finder provid ffi field view robot angular resolut ffi resolut map figur consid good testb idea navig featur relev develop coastal larg area minim dynam obstacl idea test robot week encount approxim peopl travel km total environ area museum oper primari result paper reduc averag posit uncertainti real open extrem dynam environ show result trajectori includ detail case specif trajectori coastal navig fact success oper condit period week previou work develop motion plan algorithm base posit uncertainti idea erdmann develop motion plan strategi uncertainti probabilist strategi nourbakhsh colleagu develop probabilist navig techniqu robot similar respect work field partial observ markov process mobil robot model posit uncertainti explicitli drawback tradit pomdp intract larg number state markov successfulli multipl robot platform work trajectori gener respect posit takeda al local process gener posit uncertainti gener probabl distribut base explicit model sensor environ assum effect dynam obstacl local model model inform content motiv coastal navig gener trajectori mobil robot reduc likelihood local error local error mobil robot path larg crowd room refer point rang block likelihood robot lost move open crowd space high solut robot identifi good region space alter path plan develop planner map cell map notion inform content point correspond abil robot local higher inform local abil develop gener principl local method inform model statist present actual implement algorithm statist framework robot locat direct defin space local method implement markov local method repres robot belief current posit grid discret approxim arbitrari probabl distribut probabl robot pose probabl markov local robot posit initi probabl px defin robot acquir sensor measur set rang data laser sensor local process px sensor return posterior probabl distribut defin space pose probabl posit comput sensor model robot map environ term likelihood observ sensor data comput prior posit sensor model map entropi comput probabl px good measur certainti robot local entropi probabl px comput space pose defin dx measur consid probabl distribut distribut highli singl pose entropi low distribut spread wide entropi high effect set data robot belief posit measur combin equat entropi posterior distribut dx log dx equat entropi posterior set sensor measur recal prior posit probabl sensor measur condit comput sensor model map prior distribut sensor equat locat environ sensor measur entropi averag sensor term weight likelihood sensor measur equat comput expect entropi posterior distribut log log expect entropi fire comput sensor initi posit distribut px pose comput inform robot current posit comput differ expect entropi posit probabl condit sensor entropi prior posit note equat invert intuit inform higher quantiti lower inform content recal goal measur inform content construct map area environ low high inform algorithm construct map posit initi probabl distribut px gener sensor equat sensor measur comput entropi posterior probabl distribut markov local equat comput expect entropi equat differ initi equat issu prior probabl distribut robot posit entropi comput heavili depend robot prior belief model robot navig partial observ markov method handl depend pomdp requir examin prior probabl belief path lead prior probabl belief process extrem accur uncertainti comput exponenti size environ made simplifi assumpt implement algorithm dramat reduc complex simplif ignor problem prior posit distribut implement simplif make immedi track assumpt mobil robot intern odometri insuffici posit estim reason estim bound type uncertainti robot posit robot track posit fact assum gaussian prior probabl distribut center assum locat limit small region environ gaussian natur distribut result kind error accumul odometri simplif make approach tractabl initi distribut point comput chang entropi equat simpli comput entropi estim simul sensor measur sampl sensor sensor data set posit sampl sensor simul map sensor cell squar center assum locat robot sampl method effect attribut sensor error posit error robot assum sensor measur correspond correctli featur environ fact continu distribut posit discret grid gener sensor sampl sensor measur space reduc integr summat equat fact robot ffi field elimin depend robot posit certainti depend orient orient locat entropi independ longer integr import note robot coastal navig ship point sea simplif chang inform content log figur show map inform content museum darker area inform notic area center larg open space lowest entropi close wall dynam environ entropi determin inform content point model assum static environ dynam data gather sensor peopl block figur map inform nation museum american histori darker area inform content area map wall proxim sensor account likelihood inform corrupt laser rang probabl laser rang measur corrupt person model geometr distribut length longer corrupt corrupt fl rang length fl fl probabl point environ occupi dynam case simpli number peopl divid area free space museum length laser beam cm probabl laser measur corrupt probabl base densiti peopl figur probabl corrupt laser function measur peopl museum figur show distribut probabl measur function measur distanc distribut assum evenli distribut space size order alter inform content comput account corrupt alter effect individu sensor measur total inform content approach integr inform content distribut peopl weight inform likelihood distribut approach disadvantag intract make simplifi assumpt compon sensor measur fs independ comput expect averag inform compon measur make independ assumpt sake comput speed equat inform base data set typic laser rang measur data individu success inform content comput give comput equat measur weight measur probabl measur corrupt corrupt inform content equat base sensor read probabl corrupt probabl sensor read comput distribut equat laser rang measur angl robot comput entropi prior distribut center rang measur effect model peopl discuss longer laser measur corrupt shorter inform content longer laser measur lower inform content shorter beam point environ close wall worst point environ featur extrema posit compar posit map reliabl inform rang obstacl direct highli correl rang environ make reason inform content posit map method advantag fast figur depict stage inform content initi inform content base static inform content base dynam environ environ deutsch museum germani size environ discret cell comput environ minut gener pentium ii mhz machin comput map depict figur hour machin museum map inform content static environ inform content dynam environ figur stage inform content map construct deutsch museum germani black obstacl visibl laser rang region obstacl visibl robot path plan comput inform posit path planner secondari map gener trajectori greater posit certainti tradit path planner trajectori optim criterion minim power maxim distanc obstacl quantiti minim convent planner sum convent trajectori coastal trajectori figur trajectori convent coastal nation museum american start goal posit note motion robot wall coastal planner path list cell start cost cost cross cell probabl cell minimum cost travel minimum found dynam program viterbi dijkstra trajectori shown figur trajectori robot line larg open start posit left end goal end peopl depict visitor museum occupi space side effect blind reduc substanti main sourc local inform coastal minim sum convent cost inform expon chosen figur show coastal plan start goal figur robot travel directli open move travel preserv abil gather sensor data side left comput inform map oper environ inform content comput path planner construct singl static cost function cost function dynam program typic path museum american histori comput result robot gave tour exhibit nation museum american shown figur coastal planner gener trajectori exhibit robot oper daili dai total distanc robot cover averag speed major time spent interact approxim peopl pass museum period main motiv develop coastal navig techniqu larg open space main oper area peopl gather robot time sensor local data record oper statist gather compar perform coastal planner convent planner convent planner part order comparison navig method statist averag entropi probabl distribut robot travel trajectori coastal convent tabl comparison averag entropi trajectori convent coastal planner convent trajectori coastal trajectori figur coastal convent start goal robot trajectori measur lower averag success coastal navig tabl show result laser rang finder max rang trajectori figur start goal convent coastal planner robot travel start goal posit gener trajectori length figur show perform coastal navig sensor static environ sensor rang sensor entir field view local point convent planner gener path equal local abil coastal planner sensor scale illustr condit coastal navig graph museum typic outdoor coastal navig import maximum rang laser sensor meter averag entropi trajectori coastal planner convent planner figur graph show trajectori nation museum american histori present method gener trajectori environ posit uncertainti accru local method fail environ lack refer space wall rang sensor local fail sensor obstruct dynam peopl solut gener trajectori minim probabl robot fall victim lost method draw ship lack reliabl global posit estim stai close landmark shore algorithm oper part part gener map environ inform content posit environ includ likelihood sensor data corrupt dynam obstacl path planner gener trajectori optim distanc chang posit certainti path planner navig highli dynam environ larg open space nation museum american histori successfulli week solut special case gener class pomdp problem pomdp problem intract system larg number state reduc complex make number assumpt abil robot track kind posit error accru strength framework coastal navig gener probabilist local modul base ceil imag gener path planner gener trajectori stai close obstacl path planner gener trajectori robot visual structur ceil notabl ceil light avenu futur research li path planner dynam program techniqu find trajectori demand monoton integr entropi model action reduc uncertainti direct futur work li determin planner paramet appropri weight set paramet geometr distribut describ environ planner paramet base perceiv coastal trajectori highli crowd direct trajectori environ acknowledg author tom mitchel advic support research assist frank dirk chuck dirk schultz invalu oper act dynam obstacl center innov nation museum american histori space experi research support part le pour la format de laid la recherch research sponsor part darpa number number rome lab number addit support receiv research andi gratefulli acknowledg refer wolfram armin dieter gerhard dirk dirk walter sebastian thrun interact museum robot proc nat conf artifici anthoni lesli pack michael littman act optim partial observ stochast domain proc nat conf artifici gregori dudek chi zhang robot local explicit object model proc inter conf robot ieee press alberto elf autonom robot chapter map navig michael erdmann motion plan uncertainti technic report ai michael erdmann backproject fine motion plan uncertainti intern journal robot spring thrun activ markov local mobil robot robot autonom howard dynam program markov process mit lesli pack anthoni jame kurien act discret bayesian model navig proc int conf intellig robot koenig rg simmon effect knowledg explor reinforc learn algorithm machin learn paul mackenzi gregori dudek posit map proc int conf robot san ieee press han moravec alberto elf high resolut map wide angl sonar proc ieee int conf robot page robot ai robert sim gregori dudek mobil robot local learn landmark proc conf intellig robot system latomb plan motion mobil robot sensori uncertainti field ieee tran pattern analysi machin octob sebastian thrun learn map indoor mobil robot navig artifici
Agents/643 1 kraft architectur knowledg fusion transform kit hui depart comput aberdeen uk alex philipp marti depart comput uk dean jone depart comput liverpool uk cui intellig busi system advanc commun research bt uk abstract paper describ kraft architectur support fusion knowledg heterogen sourc architectur constraint common knowledg interchang express common ontolog knowledg held local sourc common constraint fuse knowledg sourc fuse knowledg solv problem deliv inform user kraft typic exploit constraint solver kraft open flexibl agent architectur knowledg knowledg fuse user repres independ kraft commun messag protocol facilit agent perform matchmak brokerag servic kind agent kraft appli applic domain network data servic design introduct motiv modern number knowledg distribut node inform system network exploit knowledg sourc combin knowledg dispar sourc highli dynam call knowledg fusion enorm amount work distribut inform manag topic distribut queri import featur system kind integr schema provid common entir distribut system individu data sourc map local schema integr schema order combin inform common form distribut queri retriev data knowledg fusion combin inform data instanc knowledg interpret kind knowledg thought typic express form constraint distribut design system person comput resourc inform pc oper system distribut discov os call os instanc pc nt requir minimum knowledg fusion inform instanc constraint map common fusion requir common languag repres instanc common set definit terminolog knowledg share ontolog small print pc oper system call constrain constraint express serv common constraint languag terminolog concept pc mean pc oper attribut memori defin share ontolog pc design domain note data instanc share ontolog inform addit definit ontolog defin concept pc os pc turn softwar defin pc os repres string data structur inform permit instanc pc os transmit network constraint gener store form individu resourc integr rule slot constraint constraint languag terminolog individu resourc gener conform share ontolog knowledg individu resourc transform common languag share fuse oper knowledg fusion system main kind oper user perform distribut knowledg fusion knowledg user simpli find knowledg fusion system extract relev instanc constraint deliv common form user pc design user pc includ constraint user system fuse fuse knowledg solv problem system extract relev instanc basi constraint satisfact problem pc design user pc video system extract candid solut compon attach solv construct suitabl pc configur servic knowledg fusion system clear knowledg fusion system knowledg locat mechan locat relev knowledg network knowledg transform mechan transform knowledg individu resourc common languag ontolog knowledg fusion mechan combin process find solut satisfi constraint servic basic requir architectur build knowledg fusion system implement softwar compon provid develop bring knowledg sourc announc presenc commit provid inform common languag creat facil add knowledg construct queri interfac user give readi access rich servic knowledg fusion system kraft project aim provid architectur section present overview kraft subsequ section examin oper individu compon architectur overview kraft architectur kraft system knowledg process compon softwar agent architectur chosen kraft agent architectur design softwar process commun knowledg commun constraint import featur kraft agent architectur highli dynam agent locat agent discov capabl form cooper kraft concern fusion knowledg featur great design kraft consist emerg agent notabl de facto kqml standard de fipa standard agent agent commun agent acquaint agent acquaint regist network capabl specif type agent call facilit intellig yellow page agent request servic facilit recommend agent provid servic facilit attempt match request servic capabl agent acquaint match facilit inform agent network capabl servic provid agent agent commun directli worth model superfici similar distribut object architectur corba import differ semant level interact distribut object object presenc regist method signatur registri commun remot method invoc capabl express declar knowledg commun protocol built primit action recommend distribut object architectur fact highli suitabl implement architectur adept system corba true conceptu view kraft architectur shown figur kraft agent shown oval kind facilit entiti wrapper agent act proxi extern knowledg typic system legaci task wrapper provid bridg legaci system interfac kraft agent interfac legaci interfac relat ua ua ua ua user agent resourc wrapper facilit mediat kraft facil compon kraft domain figur conceptu view kraft architectur typic kraft wrapper accept incom request messag agent kraft agent commun transform sql run transform return result outgo messag kraft agent commun languag wrapper provid kraft system user agent user agent access kraft knowledg process system user agent offer kind user user present queri kraft network user agent transform user queri intern knowledg languag kraft interact kraft agent answer queri user agent typic local process transform present mediat intern agent kraft mediat add knowledg obtain agent typic mediat task includ fuse knowledg obtain agent facilit mention agent agent acquaint commun facilit process establish servic request servic requir reason declar request kraft agent commun messag nest protocol stack kraft messag implement charact string transport suitabl underli protocol corba iiop tcp simpl messag protocol encapsul messag header inform includ timestamp network inform bodi messag consist nest outer protocol agent commun languag command queri subset knowledg queri manipul languag nest messag express protocol straint interchang superset constraint languag shown section kraft messag implement prolog term structur messag shown outermost kraft msg structur context header messag agent call os vendor agent call pc design structur content encod express express transmit compil intern sender receiv ontolog languag content constrain prolog term structur compon written prolog prolog term structur easili kraft compon implement explain section term part messag defin share ontolog support transmiss data ontolog inform addit definit remaind paper section explain kraft facilit agent section role wrapper agent common section mediat perform knowledg fusion section discuss kraft system telecommun design applic section conclud paper facilit agent introduc facilit provid rout servic kraft network definit facilit literatur rang servic provid facilit vari section detail facilit kraft kraft facilit rout function agent queri basic function handl facilit receiv process store inform capabl resourc commit provid capabl defin formal common facilit resourc section facilit action find resourc compli satisfi criterion action find resourc capabl match requir deriv queri satisfi criterion depend search strategi adopt resolut queri spectrum bound exact hand set approxim hand satisfi criterion tradeoff correct complet set solut facilit perform state section subset kqml main function previou section support resourc capabl regist facilit send regist messag refer locat send messag formal descript capabl section repli issu origin messag error occur facilit protocol encapsul facilit mechan receiv queri recommend recommend facilit repli agent origin singleton match refer repli forward messag receiv queri broker broker facilit send queri relev resourc answer queri brought back turn forward repli origin queri express capabl resourc capabl repres abstract characterist resourc network inform locat queri wrapper perform wrapper intent content resourc subset abstract function resourc basic data structur commun characterist term bodi defin share ontolog compon list list servic defin share list domain deal domain defin share specif subset delimit express resourc queri languag facilit encapsul receiv facilit oper implement queri messag kraft messag header wrapper pc softwar vendor call os facilit call yellow page content handl express subset sql queri servic defin share ontolog concept pc os oper pc util util sender receiv ontolog languag content wrapper agent share ontolog level heterogen inhibit inform store resourc connect kraft knowledg sourc interact system user pose queri system user knowledg sourc variat terminolog knowledg sourc outlin section interact syntact heterogen address protocol kraft network provid wrapper agent translat messag protocol focu level overcom problem semant share ontolog formal defin terminolog problem domain content messag kraft network express term defin share ontolog knowledg local ontolog knowledg sourc local ontolog defin term schema local ontolog share number ontolog instanc semant heterogen includ term refer concept term refer concept overcom knowledg sourc ontolog map defin ontolog map partial function specifi map term express defin sourc ontolog term express defin target ontolog enabl bidirect translat kraft network knowledg ontolog map defin describ format ontolog map defin ontolog begin set order pair ontolog correspond ontolog correspond specifi term express target ontolog repres close mean sourc ontolog term express term sourc identifi term target ontolog directli map sourc ontolog term target ontolog term term sourc ontolog map includ ontolog map defin correspond compound express lead classif ontolog map sourc ontolog class target ontolog class map set valu sourc ontolog attribut set valu target ontolog map sourc ontolog attribut target ontolog attribut map sourc ontolog relat target ontolog relat map compound sourc ontolog express compound target ontolog express local share ontolog repres format semant transform express wrapper base directli ontolog map relev ontolog map part specif wrapper directli wrapper develop complet autonomi implement wrapper current kraft prototyp section implement transform express rewrit rule pair term express ontolog correspond necessarili semant wrapper translat ensur target express semant sourc express constraint pass mediat term defin share ontolog express knowledg origin constraint express term defin local ontolog ensur semant express maintain defin ontolog correspond wrapper implement ontolog map ensur condit satisfi translat term express sourc target ontolog mediat agent constraint fusion constraint fusion applic problem kraft constraint fragment distribut resourc constraint part conjunct statement describ applic problem constraint satisfact problem pc hardwar configur problem solv knowledg user restrict attach hardwar compon gener design knowledg govern workabl configur constraint user agent specifi pc processor constrain pc compon fit satisfi constraint size os smaller equal hard disk space proper constrain pc candid compon vendor instruct attach constraint vendor oper requir memori constrain pc kraft approach task emploi mediat extract combin constraint distribut sourc problem solv constraint abstract mobil object transport transform constraint satisfact problem solv combin distribut queri constraint logic program approach tailor execut plan dynam depend capabl avail activ onlin resourc sampl constraint give fuse describ requir variabl constrain pc true reason fuse constraint fragment provid basi explor csp divid distribut queri singl piec constraint insuffici solv csp hope combin inform multipl constraint fragment arriv solvabl solut fusion process inform infer captur problem solv csp solv constraint fusion process concret descript csp declar form solv csp mediat feed problem extract select inform csp descript gener distribut remain constraint form smaller mediat send queri multipl messag wrapper retriev candid data valu queri gener constitut import phase shift part problem solv process distribut data filter queri prevent unnecessari transport irrelev data kraft domain reliev network traffic distribut system data filter queri suffici resolv constraint amount select inform repres queri depend express queri languag remain resolv power constraint solver stage final stage problem solv process feed data constraint constraint solver solut csp obtain current section finit domain constraint solver constraint logic program system form initi domain variabl clp candid data retriev previou stage compil clp data structur form problem compil clp program code constraint variabl mediat send clp program data constraint solver wait result return kraft applic kraft architectur test realist applic domain telecommun network data servic applic provid bt network data servic design problem consid kraft phase network configur viewpoint custom singl bt network design select meet custom suitabl point presenc connect bt network suitabl custom equip servic connect includ decid focu initi sole router conceptu view applic architectur shown figur note detail descript network data servic design applic current kraft agent implement prolog user interfac agent messag java applic resourc manag independ instanc dbm local schema constraint solver commun implement asynchron messag pass linda model prototyp applic emploi sourc pop compet router vendor inform sourc consid legaci simplifi version care ensur inform creat ensur realist heterogen popul data vendor popul data vendor constraint defin valid usag product main aim creat resourc test feasibl creat wrapper agent transform intern knowledg kraft languag task identifi potenti pop mediat task independ practic pop db vendor db vendor db solver ua design db pop mediat mediat network servic scenario conceptu architectur pop db vendor db vendor db solver ua design db pop mediat mediat network servic scenario interact locat pop pop db vendor db vendor db solver ua design db pop mediat mediat network servic scenario interact locat figur conceptu view kraft architectur select basi custom lan wan pop vice decid provid separ mediat task user agent serv test graphic user interfac bt network design enter custom launch kind queri kraft pop user specifi locat custom custom requir network servic frame relai user agent formul pop queri kraft attempt locat agent answer queri contact turn put contact pop mediat receipt user agent pop mediat obtain list pop pop filter user requir send repli user agent suitabl pop found displai rank order proxim custom site interact shown figur user specifi addit constraint type equip includ support lan protocol custom site base support requir wan servic determin choic pop acquir user agent issu queri kraft network mediat interact vendor select constraint fuse constraint custom mediat call constraint solver identifi product relai back user agent interact shown figur prototyp applic construct evalu detail prototyp paper kraft architectur knowledg fusion transform gener framework architectur reusabl wide rang knowledg fusion system addit network data servic design applic previou framework kraft architectur test prototyp system student option transfer health care drug therapi specif softwar compon kraft system includ messag wrapper mediat compon evalu kraft architectur refin continu made acknowledg kraft collabor research project bt project fund epsrc bt mike comment earlier draft paper refer refer architectur intellig integr technic darpa advanc research project august function constraint languag data knowledg architectur digit librari juli inform gather network public proc int conf practic applic intellig agent multiag page april carriero linda commun fipa agent technolog achiev agentlink applic kraft data servic network bt technic press evolv role constraint function data journal intellig inform busi process intern journal cooper inform technolog collabor journal concurr applic semant agent commun phd baltimor enabl technolog knowledg ai reusabl compon kb db workshop intellig inform distribut anonym knowledg share approach softwar intern journal cooper inform assess heterogen classifi ontolog proc intern confer formal ontolog inform system io mediat architectur futur inform ieee march
DB/644 3 nonmonoton inherit deduct languag wolfgang kandzia technic report institut fur informatik germani januari nonmonoton default deduct abstract deduct framework integr logic rule inherit specif problem due combin deduct deduct place depend inherit indirect class hierarchi subject deduct point investig applic extens semant default logic deduct languag restrict problem horn program special type default tailor semant construct extens construct compar solut implement system florid base combin classic deduct fixpoint mechan point main contribut report investig relationship model defin classic ai show semant defin implement coincid standard semant default logic inherit network restrict scalar method preliminari version technic report publish workshop octob content introduct inherit inherit network inherit context inherit strategi languag basic concept default logic inherit default framework inherit default logic global semant default theori extens forward chain evalu horn case applic inherit inherit inherit trigger comparison model inflationari cautiou inflationari extens inherit model cautiou extens miscellan applic default theori horn posit program posit precondit inherit inherit trigger classif implement exampl disjunct inform conflict detect class level gener class plai preemption unsupport model dynam inherit trigger refer introduct deduct class hierarchi nonmonoton inherit model applic domain fact deriv classic assum object instanc class instanc properti consist assum hold ad model exact notion defin paper combin deduct rule inherit significantli complex pure deduct pure inherit concept descript effici implement exist studi restrict case reason concern inherit combin interest deduct objectori ai viewpoint ai framework nonmonoton reason present implement notion default nonmonoton reason integr logic program program evalu wrt semant stabl semant extend logic program negat rule head provid type negat failur strong evalu extens stabl semant circumscript syntax logic classic logic augment special predic abnorm intend model minim abnorm predic default logic reason express denot assum conclud default logic present detail section inherit network provid framework typic atyp properti inherit network consist link strict repres knowledg repres condit approach inherit frame system base circumscript present semant preferenti model provid gener formal nonmonoton reason inherit approach base syntax deduct rule incorpor consequ relat default rule deriv support class repres extend logic default nonmonoton reason restrict includ gener due credul skeptic inherit semant defin pure complex depend exact definit rang polynomi mix complex issu solv default theorist system default reason implement empir studi approach full extent practic system semant network formula successfulli commerci applic dood situat deduct nonmonoton featur strict rare paradigm deduct languag conceptu includ nonmonoton integr exist languag implement structur inherit denot fulli overrid inherit signatur signatur class method result type result subtyp inherit denot concept nonmonoton inherit ai earli logic focuss complex lack inherit class hierarchi structur inherit introduc iql rol nonmonoton inherit found class hierarchi class membership inherit conflict detect priori consist wrt scalar method enforc condit ground method rule instanc possibl defin program satisfi condit call result restrict languag support nonmonoton inherit overrid class hierarchi defin rule successfulli appli ai techniqu system florid oper evalu classic logic part trigger mechan handl nonmonoton inherit implement semant investig section paper structur section introduc concept inherit ai point view relat requir inherit deduct area section present syntax semant paper illustr problem combin inherit deduct section default logic semant inherit default section global semant default theori extens investig section adapt result default theori consist horn program special default result extens section consequ previou section special type default inherit investig section present semant defin implement semant base logic inherit trigger model section show relat present concept wrt problem inherit show correct solut section remark classifi properti implement complex issu section give classic exampl illustr approach show model concept obtain intend behavior concept appli implement dynam frame problem solv lead eleg solut ramif problem inherit idea inherit set inform assum object instanc class instanc properti consist assum hold ad model inherit network formal direct inherit reason inherit inherit network provid intuit express framework direct mean reason inherit network term network approach stand contrast translat theori consequ network interpret standard syntact nonmonoton formal default autoepistem approach discuss present concept motiv semant formal implement target formal inherit network gener inherit objectori node correspond individu outgo properti individu link describ connect node link plai main link properti properti mean typic object satisfi satisfi bird neg link denot typic object satisfi satisfi bird swim atyp penguin fly swim link individu properti form bird strict link extens basic inherit lead mix inherit network ch strict link denot object satisfi satisfi penguin bird penguin mammal map model inherit network result type properti encod strict link encod strict link object inherit properti encod link class properti fact rule singl class object encod strict link type node combin deduct rule inherit result mix network classic illustr central concept inherit inherit network figur nixon republican typic republican polici typic polici direct conflict nixon polici typic bird fly tweeti bird penguin bird tweeti penguin typic penguin fly penguin specif bird conclud tweeti typic typic bird hawk lai egg bird fly rep penguin nixon tweeti figur inherit network nixon tweeti reason inherit network base path network path sequenc link link neg path figur path nixon republican hawk argument nixon believ polit hawk path nixon argument hawk path nixon republican hawk nixon conflict follow notion mix cf ch equal lead solut tweeti path tweeti penguin bird fli argument tweeti believ path tweeti penguin fli argument path conflict tweeti fly prefer ground specif fact tweeti penguin path tweeti penguin bird fli preempt path tweeti penguin infer path tweeti penguin bird lai egg preempt basic concept conflict preemption clear case mix network semant inherit network defin term extens set path ideal reason accept conflict preempt path formal definit involv deal intuit decoupl inherit network fig note network show similar nixon diamond conflict path argument equal reason left network extens path typic satisfi satisfi typic satisfi path call decoupl properli coupl typic ns typic satisfi satisfi net ident inform prohibit decoupl lead intend result typic ns behav typic behav net fig extens path conflict solv favour typic satisfi believ satisfi knowledg typic ns fact disjunct inform typic solv individu section show disjunct inform handl approach figur decoupl preemption preemption investig addit mode occur link net shortcut overlook specif inform preempt link direct link tweeti bird figur advoc conclud tweeti give formal obviou detail idea understood differ applic area inherit network formula commerci morgenstern advoc strategi applic point view uniform inherit strategi intend semant case inherit context reason inherit larg part form typic satisfi gener individu satisfi satisfi concern reason satisfi appli inherit concept deduct focu gener nonmonoton consequ instanc properti individu object gener form typic satisfi individu satisfi satisfi subject applic data mine algorithm instanc focuss object instanc properti reason abstract typic problem approach inherit network conflict natur occur reason properti reason typic properti class problem decoupl strongli relat approach set disjunct inform section properti defin inherit member object conflict inherit conflict altern limit instanc level statement properti typic section shown situat fig solv preemption natur solv approach systemat propag knowledg class hierarchi concept class hierarchi inherit properti induc special structur ffl disjoint type ffl class hierarchi repres strict link object ffl fact repres strict link class object strict symmetr neg link conflict ffl inherit properti repres link class properti subclass chain link distinct class object class repres simultan typic member class regard object complet conflict handl separ class level object level remark inherit network defin class hierarchi inherit properti class properti object extens path intermedi class inherit properti believ inherit properti path result believ inherit properti deduct rule gener inherit network inherit net suitabl formal inherit deduct nonmonoton formal emploi meet requir logic program decid default logic effect deduct rule inherit ffl conflict due deduct deduct closur inherit check rule singl object class encod introduc conjunct properti rule bodi ffl deriv class hierarchi class deriv membership intermedi class lead preemption inherit strategi inherit base reason path encod translat approach default logic formal default logic requir strategi express formula rule adopt inherit mechan program inherit class object place direct superclass inherit direct superclass problem decoupl solv natur subclass object inherit properti inherit direct superclass note contrast class hierarchi program requir uniqu minim superclass remark long coupl local strategi concept inherit ffl path sequenc inherit step class hierarchi deduct step ffl path path preempt path inherit class inherit stop step ffl conflict path result conflict node common chang conflict decid class level class object level receiv object section languag basic concept report motiv problem integr inherit deduct languag florid prototyp section implement florid definit syntax multivalu method schema defin ffl alphabet consist set object plai role function set auxiliari symbol object constructor denot letter variabl ffl object constructor variabl interpret element denot ffl atom express form isa member class subclass class ffl object appli scalar method object result class inherit scalar method member isa inherit result subclass inherit result analog method ffl formula built atom logic connect ffl rule logic rule atom ffl program set rule note distinguish object uniformli denot variabl occur arbitrari posit atom semant extend semant predic logic formula interpret semant structur restrict discuss consist ground set ground atom describ object satisfi closur axiom relat gener definit set ground atom condit hold arbitrari ground um occur ffl ffl ffl ffl isa isa ground stand scalar set ground denot closur wrt constraint violat fl denot theori set formula mean closur wrt complet set axiom logic isa origin default axiom isa isa stand truth atom formula usual posit program evalu oper includ provid minim model definit program fh ground instanc rule ng ae lim sequenc note lead result deal inherit inherit model base inherit trigger extend fixpoint semant procedur flavor definit investig section give introductori exampl show logic deduct combin inherit lead semant difficulti contradict simpl program nixon isa nixon isa nixon diamond deriv classic deduct polici argu inherit inherit make augment mr mr nixon isa ffl nixon inherit classic deduct deriv mr mr inherit atyp ffl nixon inherit case classic deduct deriv mr slight show conflict nixon version nixon fr nixon isa mr mr direct conflict inherit logic consequ requir mr lead inconsist semant inherit leav polici nixon undefin relat inherit net care indirect conflict notion mix conflict default logic incorpor notion justif default appli justif consist result structur circumscript result fact nixon abnorm program satisfi restrict welldefin program tweeti lai penguin tweeti isa isa tweeti inherit bird potenti inherit bird preempt intermedi class properti inherit bird motiv strategi appli properti inherit class hierarchi result section applic inherit deal kind check superclass inherit requir method inherit fact inconsist inherit reject provid encod logic rule section shown framework default cover mean inherit integr classic logic program idea underli similar deduct languag default logic inherit default framework default logic reason express default ff fi fi consist precondit justif fi ffi fi consequ set analog fi assum conclud fi default logic rule ff long consist interpret consid default theori pair set default set formula applic default deal gener kind precondit repres explicitli requir justif list fact consist necessarili belong knowledg inherit default logic inherit superclass condit belong check inherit preempt inherit consist knowledg logic rule fall special form default call default default form precondit conjunct consequ atom hold translat concept inherit inherit syntax default form isa oe path oe preempt oe path state path oe preempt state inherit path consist intermedi class path due fact variabl class method instanc inherit inherit scalar method denot instanc default schema assum consist remark inherit path split sequenc smaller step inherit place requir isa isa definit program denot horn default theori default schema ariti method inherit subclass max maxim ariti method occur max default isa isa sc isa global semant default theori extens semant default theori defin term extens set denot theori definit base default theori set fd instanc default consist fi wrt respect sequenc set formula st extens call extens base definit set default set formula ffl set applic default ffl gd fd set applic default add knowledg remark note gd default applic consequ term step fi requir consist assumpt futur stage made evalu ff note depend assumpt extens definit term belief set definit default theori theori ffl formula wrt finit sequenc condit provabl logic instanc fi default fi consist ffl denot set formula wrt ffl theori extens guess prove check result fixpoint process satisfi equat forward chain evalu motiv fixpoint semant posit logic evalu logic program inherit base guess definit inflationari strategi defin replac evalu default current belief set contrast def applic default section proven make differ long posit program default posit precondit definit default theori ad sequenc set formula ad ad fd gd gd definit gd def call inflationari extens call inflationari extens base remark note gd approach investig section def shown method gener theori extens proposit inflationari default theori extens inflationari extens inflationari extens comput algorithm definit fi fi consist extens proof cf cor cf strategi inflationari default appli undon requir undo logic step justif turn wrong test criterion proposit remark altern deal forbid applic default justif falsifi forbid applic default logic consequ falsifi justif default appli earlier notion extens includ easier implement lead theori default applic lead structur default applic hand structur structur satisfi exist weaker differ control case inherit default theori fd fd inflationari extens extens extens justif falsifi applic inflationari extens gd strategi result accept structur cautiou inflationari extens defin similar definit strategi avoid previou definit inflationari default theori set formula set ad ground instanc gd fd instanc default consist fi ad sequenc set formula ad ad fd gd gd call cautiou inflationari extens call cautiou inflationari extens base remark note gd applic default lead justif appli gd notion defin strictli notion extens default ae oe qg gener qg inflationari extens cautiou inflationari extens appli fpg lead sg extens gd qg subsequ applic qg result qg inflationari justif appli default invalid cautiou inflationari extens gd extens default appli construct extens inflationari strategi appli default gd run garden path reach valid extens cautiou strategi run garden appli default reach extens garden path cure backtrack proposit inflationari inflationari default theori ffl comput cautiou inflationari extens maxim prefix comput inflationari extens justif appli default falsifi ffl cautiou inflationari extens inflationari extens gd ffl inflationari extens satisfi criterion proposit cautiou inflationari extens note inflationari extens necessarili cautiou inflationari inflationari inflationari default theori fd fd fd consist inconsist extens cautiou inflationari inflationari extens satisfi proposit cautiou inflationari extens proposit cautiou inflationari default theori cautiou inflationari extens extens gd proof proposit cautiou inflationari extens gd inflationari extens cautiou inflationari extens satisfi addit criterion state proposit extens horn case default theori consist set horn formula set default definit result base horn semant herbrand style similar minim model logic program case program restrict finit extens definit program extens base def call cautiou inflationari approach definit comput inflationari program manipul set proposit program default theori gd fd ground instanc default fl consist fi hg sequenc ad ad fd gd gd inflationari inflationari comput sequenc proof proof fact biject comput definit proposit instanc default case fl recal default conjunct atom atom formula note def includ closur induct fl fl fl fl consist requir ident case gd gd chosen fl consist sequenc criterion prop carri proposit inflationari comput algorithm fi fi consist applic inherit default form incorpor design higher prioriti preemption refin argu discuss defend section class hierarchi complet comput fragment check consist justif justif step path chosen preempt turn preempt step due class intermedi class turn inconsist solv fix intermedi class remaind intermedi isa path deriv inconsist avoid cautiou comput obtain state proposit cautiou inflationari extens extens garden gd exampl solv simultan solv problem decoupl observ state remark inherit place fix visit class restat remark default proposit extens isa instanc inherit default form appli construct sequenc superclass proof justif requir consist assum intermedi class consist default applic consequ inherit strategi class hierarchi avoid definit isa isa program defin schema proposit program set ffl set inflationari extens ffl set theori comput prefix comput inflationari extens occur proof applic default intermedi class receiv subclass object split elementari inherit subclass target object condit fix intermedi class exclud proposit intermedi class corollari program set ffl set inflationari extens comput ffl set extens avoid valid step correct inflationari strategi inherit avoid introduc garden path inflationari strategi implement deviat semant intermedi deriv preempt path proposit class program static class set extens set inflationari extens coincid class garden path consid section note design inflationari part justif potenti intermedi class drop justif check current fragment intermedi class preclud precondit set extens strong exist intermedi subclass exclud condit state final theori illustr relationship wrt inflationari intermedi subclass membership deriv inherit isa isa isa cg extens isa extens base set ground fact isa isa comput isa cg fo isa isa isa cg fc gd fl default isa applic intermedi class default applic class exist inflationari strategi comput sequenc gd fo isa intermedi class justif check current theori cautiou strategi make prohibit deriv intermedi path inherit place describ inherit mechan defin implement florid system mechan implement inflationari strategi shown theorem inherit inherit trigger deduct part program evalu wrt inflationari fixpoint semant def stratif support inherit implement trigger mechan deduct inherit evalu program defin comput classic deduct fixpoint carri amount inherit strategi formal base inherit definit ffl inherit trigger pair cg stand isa ffl inherit trigger isa activ ffl denot set activ inherit trigger ffl inherit trigger isa block note definit depend program method inherit class object subclass method deriv object inherit classic lead altern sequenc fixpoint comput inherit step definit activ trigger isa fire defin fc accord activ trigger denot step inherit transform proposit program model rule model note def includ closur note notion model program requir closur wrt inherit exist model close wrt model program defin origin definit definit model program model sequenc ff ff ff activ fl fl activ trigger fl limit fl fi program model relat concept reformul definit finit comput definit program sequenc model sequenc activ trigger proposit program ffl finit definit coincid ffl model comput process stop activ trigger comput stop trap inconsist correspond default precondit satisfi method inherit result inherit final consist interest suggest extend terminolog definit consist program final consist inherit model exist set final consist model corollari program model final consist model final consist model fire trigger lead illustr trigger mechan propag properti class class program penguin tweeti isa start ae tweeti isa isa penguin oe note applic default inherit directli tweeti intermedi class penguin appli ae penguin oe appli ae tweeti isa isa oe extens base start isa fire result isa comparison relationship concept inflationari criteria isol class anticip result concept compar shown figur inflationari cautiou inflationari inflationari inflationari final consist model final consist model prop prop prop prop theorem theorem theorem prop oe prop cor oe prop cor oe denot extend figur comparison concept model inflationari comput model implement process proposit comput inflationari default theori proposit program set ffl set definit ffl set prefix sequenc proposit inflationari proof induct length sequenc length sequenc length isa isa gd ffl fo isa ffl fl isa ffl fl ffl isa fire result consist gd ground default appli step valid inherit step continu wrt proposit sequenc isa st ffl fo isa ffl intermedi class fo isa cg fl isa ffl ffl fl consist ground instanc default schema gd continu prefix comput prop direct analog inherit theorem inflationari program set final consist model set inflationari final consist model occur proof shown definit trigger fire lead consist condit gd proposit inflationari immedi proposit stop criteria proposit corollari proposit extend final consist theorem class program static class isa occur rule set final consist model set coincid cautiou inflationari extens inherit relationship extens inflationari extens clarifi proposit give criterion identifi inflationari extens inflationari extens extens justif default appli comput consist concept cautiou inflationari extens properti enforc construct default form occur default theori justif invalid step path inherit turn preempt section split requir subclass time default intermedi deriv subsequ step solv default schema inflationari strategi proposit presenc class term program insert intermedi inherit isa isa comput sequenc fx isa isa fx isa isa contrast inherit appli due intermedi class yield inflationari inherit intermedi class justifi trigger model inherit place note logic inconsist prohibit inherit similar cyclic inherit network sec network extens cautiou inflationari comput enforc augment consequ forc newli deriv intermedi provid inherit definit isa isa isa program defin note consequ longer set gener extens base horn formula form isa repres explicit knowledg intermedi class inherit place extens base denot formula formula comput avoid preemption fact induc extend proposit avoid invalid justif proposit program set ffl set inflationari extens base ffl set theori comput prefix comput inflationari extens occur corollari program set coincid set proposit ffl set theori comput prefix comput inflationari extens ffl set cautiou inflationari extens proof immedi prop prop note theori garden path avoid criterion proposit appli turn good approxim comput theorem program set ffl set inflationari extens base gd ffl set extens proof proposit proposit proof altern concept proposit proof proof divid extens base extens base cor extens base gener sequenc applic default satisfi criterion prop cautiou sequenc extens base gener sequenc extens gd extens base gener sequenc applic default set formula gener sequenc construct cautiou inflationari extens base gd proposit extens base remark part proof assum gd gd gd inconsist inconsist due addit knowledg ad justif appli intermedi class insert inherit place consequ longer set directli translat model notion integr extend program appropri model cautiou extens intend semant program set restrict sequenc result cautiou inflationari horn formula ad consequ step implement ad rule program inherit trigger fire requir slight modif concept definit program sequenc set exist proposit program model prefix proof construct occur step theorem program ft inflationari extens base proof analog theorem theorem cautiou program set cautiou inflationari proof proposit induct argument proof proposit investig discrep cautiou inflationari due garden path proposit theorem program statement ffl ffl proof fact comput augment program fire trigger rule avoid garden path introduc intermedi class respect default fire trigger garden path lead inconsist due trigger applic consist wrt origin program garden valid trigger garden gd claim proposit appli gener decid garden path comput extens comput discard garden path criterion strategi semant caution inflationari extens implement inflationari mean applic default undon miscellan applic compar definit applic default appli step individu default chosen section follow strategi investig situat arbitrari subset applic default appli arbitrari set activ trigger default theori proposit default theori definit ad ad gd set comput sequenc superset set inflationari extens proof sequenc result fd inflationari gd fd inconsist inflationari extens fd inflationari extens satisfi criterion prop extens comput sequenc obtain satisfi criterion prop proposit proposit set comput sequenc satisfi criterion proposit coincid set inflationari extens satisfi criterion proof unari set arbitrari set trivial sequenc sequenc obtain applic fd fd fd fd comput sequenc satisfi ffl ffl applic consist fi comput satisfi criterion prop consist fi hold ffl ad ad satisfi criterion prop criterion prop test appli default time appli arbitrari default time yield set accept structur applic default lead result reject criterion horn posit program posit precondit horn herbrand structur consid gener explicit knowledg neg liter applic rule default applic depend neg applic stage result previou section gener hold posit program default theori proposit program default theori defin proposit ad ad gd set ffl set comput sequenc satisfi criterion prop ffl set inflationari satisfi criterion proof proof analog proposit corollari program default theori set comput sequenc coincid set inflationari proof corollari special proposit claim proposit corollari suffici appli ground instanc applic default time inherit inherit trigger coincid hold applic default formal proposit program defin definit set coincid set proof proof analog proposit enforc augment logic program proposit yield theorem corollari program defin definit set cautiou inflationari posit suffici strategi appli trigger time negat logic program combin default defin semant combin stabl semant default current semant implement evalu program present classif semant nonmonoton framework classifi structur regard model input sceptic perspect accept fact true credul perspect accept fact true choic perspect simpli yield model approach circumscript normal default union model credul semant yield inconsist structur hold logic program inherit case logic program negat sceptic perspect yield model case negat choic perspect yield nondeterminist repres choic strategi explor state space comput sceptic credul semant implement compar element local sceptic credul strategi implement compar inherit definit skeptic ffl trigger credul applic subsequ deduct fixpoint consist scalar method assign ffl trigger skeptic applic subsequ deduct fixpoint consist trigger activ block compar transit measur number block trigger activ block gj activ gj number object wrt object properti differ typic object class trigger isa st st isa mean explicitli default hold note trigger introduc intermedi class inherit method intermedi class block trigger member object gener wrt credul abnorm implement current florid indirect conflict due multipl assign scalar method handl equat object result scalar method applic notion inconsist semant defin set state reachabl inherit trigger activ strategi implement intern version florid activ trigger fire long object creation comput polynomi number potenti trigger comput polynomi time object comput infinit implement default gener trigger activ approach extend default justif conjunct atom exampl exampl section show class hierarchi handl class inform carefulli design cover intend mean applic semant encod behavior inherit show inherit mechan implement state sequenc frame semant disjunct inform nixon diamond exampl nixon famili fact nixon republican repres disjunct inform polici inherit nixon inherit polici hawk turn polici inherit abstract class republican introduc hawk hawk rep rep nixon ampl nixon ampl figur inherit network republican ffl republican introduc subclass republican left figur similar network fig rep rep nixon isa rep ampl isa rep method rep undefin inherit rep rep inherit defin inherit polici republican solv conflict class level intend nixon ampl inherit polici rep inherit inconsist nixon nixon inherit inherit nixon preempt rep ffl version introduc republican conjunct republican subclass figur model disjunct inform publish isa isa rep isa republican isa rep nixon isa rep ampl isa rep fr nixon isa nixon isa ampl isa ampl isa inherit polici inherit individu nixon ampl conflict detect class level illustr mix inherit net depict fig born usa born penn born germani sp penn dutch hermann figur mix preemption hermann nativ speaker pennsylvania nativ speaker german nativ speaker pennsylvania dutch born pennsylvania born usa nativ speaker german typic born usa concept mix preemption interpret combin link strict link specif hermann believ born usa class hierarchi isa nativ sp penn nativ sp penn dutch nativ sp nativ sp penn nativ sp isa nativ sp activ trigger isa nativ sp penn born sp penn dutch nativ sp born inherit result nativ sp penn wrong conflict preempt path hermann pennsylvania dutch german semant locat class level forgotten defin nativ sp penn rule clean altern lift rule class sp penn activ trigger isa nativ sp penn born isa nativ sp penn born inherit depend chosen trigger intend model obtain gener class problem chain strict class object satisfi strict object belong class believ satisfi properti classic network figur lawyer ambiti accomplish figur chain lawyer lawyer ambiti social useless peopl ambiti tend accomplish accomplish peopl social class hierarchi simpli ambiti peopl accomplish note network consist chain repres state section chain map immedi network requir set footnot node label adapt earlier ginsberg displai similar attitud appli abstract class lawyer subclass peopl ambiti ambiti peopl ambiti subclass peopl potenti accomplish accomplish accomplish peopl social hypothesi assum peopl assum accomplish dot line ambiti accomplish repres hard fact dash path lawyer preempt path lawyer dash path accomplish simpli conflict lawyer focu class peopl satisfi fy isa lawyer supp supp supp supp acc supp supp class fact supp fact supp intend previou model class peopl accomplish member class virtu inherit preempt model simpli neglect fact class peopl peopl social fo isa acc fy isa trigger isa isa activ result plai preemption unsupport higher prioriti preemption refin conflict theoret occur inherit default appli path enabl applic default refin introduc altern intermedi subclass preempt refin path emerg decid accept refin case present slightli version scenario argu strategi reason version program inherit preempt bypass preemption isa isa isa isa cg inherit reason fo isa isa path preempt argument inherit preemption bypass path path preempt path exist inherit assum argument accept extens refin preempt path valid motiv slight variat program inherit exist due isa isa argu isa isa isa extens isa isa cg argument previou accept path exist result inherit inherit fo isa accept extens unintuit model dynam inherit trigger trigger mechan insert atom deduct fixpoint reach suitabl class hierarchi evalu logic program defin state sequenc sequenc deduct fixpoint comput inherit implement solut frame problem eleg state made successor linear uniqu subclass control evolut class comput perform make successor state subclass current state inherit frame knowledg singl step explicit deduct provid frame method applic defin state determin subsequ state action perform transit ramif inherit subsequ inherit step make path express object creation path express denot object result appli object creat object atom classic pull plug fill plug pull run empti start set fact describ state fill fx isa state sequenc formal os effect pull plug axiomat isa effect pull plug axiomat local rule assum state plug applic comput state fx isa method undefin subsequ inherit step fire activ lead applic deriv block inherit ramif clear deriv obtain consist inherit credul inherit step lead subsequ shown strategi provid effect stratif oper method model implement dynam deduct shown inherit integr deduct objectori languag horn fragment logic program restrict default notion tailor semant requir area program present algorithm comput structur repres extens default theori shown semant defin implement florid system coincid standard semant default logic inherit network acknowledg current team member freiburg georg jurgen rainer christian heinz fruit discuss refer abiteboul kanellaki object ident queri languag primit build system stori chapter pp morgan bidoit negat default logic program theoret comput brewka logic inherit frame system intl joint confer artifici pp brewka nonmonoton logic foundat cambridg zicari integr data model program paradigm acm intl confer manag data pp dix semant logic intuit formal properti fuhrmann action inform de topor declar procedur semant deduct system journal intellig inform schlepphorst prototyp intl confer data engin florid homepag robinson handbook logic artifici intellig logic program oxford scienc gelfond lifschitz stabl model semant logic program kowalski intl confer logic program pp gelfond lifschitz logic program classic negat intl confer logic program pp mit horti direct theori nonmonoton inherit handbook logic artifici intellig logic program kandzia nonmonoton reason florid intl confer logic program nonmonoton reason number lnai nonmonoton preferenti model cumul logic artifici wu logic foundat objectori languag journal juli kandzia schlepphorst dood dl workshop knowledg meet lifschitz circumscript handbook logic artifici intellig logic program liu deduct object base languag inform makinson gener pattern nonmonoton reason handbook logic artifici intellig logic program mcdermott logic ii journal kandzia nonmonoton inherit deduct languag workshop pp technic report institut fur technic lausen semant deduct languag intl confer deduct number pp springer morgenstern inherit appli nonmonoton techniqu problem industri artifici lausen integr dynam aspect deduct intl workshop rule system number marek truszczynski nonmonoton logic logic reason system default diagnosi knowledg essai pp pool default logic handbook logic artifici intellig logic program przymusinski stabl semant disjunct program gener reiter logic default reason artifici shoham reason chang mit touretzki mathemat inherit lo van schlipf unfound set semant gener logic program acm symposium principl system pp
Agents/645 1 ercim workshop interfac long paper web perspect adapt alessandro alberto patti dipartimento di informatica università degli studi di torino torino tel fax abstract recent year wit rapid growth multimedia technolog offer inform servic internet problem face context great varieti user consequ adapt present inform interact specif user characterist gener agreement adapt web system model user research adapt web system base idea associ user dynam build web base profil model sake complet adapt navig give greater import user intent begin interact system view aspect adapt underestim achiev dynam site gener guid user system track intent evolut plan dynam person navig rout topic current main line present articl introduct recent year wit rapid multimedia web commerc distribut servic exampl problem due varieti user find adapt present person request advanc solut de de start assumpt adapt focu user associ user refer prototyp adapt present prototyp associ user fill induc prefer interest user choic project al hybrid solut priori model built refin exploit user choic select solut lack import user system user invit write inform system build user model adapt present user model lack compon devot user chang connect case system build model base choic complet adapt access onlin newspap search sport heard terribl accid foreign access newspap itali octob inform system induc interest difficulti inform im interest present shallow level respect current real interest system interact model intent kind inconveni happen system captur goal current connect limit reason gener interest adapt present research aim address build web system interact adopt user goal order achiev complet fundament characterist approach actor user solut problem system extend user compet relat applic domain studi implement web site depend shape singl user structur web site depend interact user agent interact final satisfi user user connect site kind access fix graph page link interact program softwar start knowledg base specif site data request build ad hoc structur differ respect current dynam web page dynam construct site structur structur correspond plan aim pursu user goal user goal bia orient present inform video knowledg base approach base user wide studi literatur approach bring innov interact user fill form piec inform feel explor site request system restrict answer user model fix advantag expect process web site order modifi classic web chang content page link site exist exist data data mainten exist program agent chang relat data structur structur built approach fast prototyp site valid inform similar program seller comput multimedia seller configur huge kind kind modem compon list seller list fast cpu seller limit euro seller ram modem plan budget current avail compon store seller configur satisfi list ram prefer prefer ram seller configur tabl dialogu client seller approach case studi tackl construct web case construct virtual comput seller comput assembl good applic domain world hardwar compon rapidli continu evolv classic web site client equal technic characterist comparison literatur domain client comput desir belong categori world process internet peculiar relat specif job cad system real shop choic dialogu client seller tabl dialogu understand function client interest proper configur accept detail constraint piec inform seller converg optim case reason offer similar interact seller client common build specif case join case seller technic case client relat reason kind object constraint seller lead pursu appli plan aim sell goal plan find configur satisfi constraint observ final varieti situat wide conveni build complet plan contrari build plan depend current condit virtual seller implement softwar program creat site base knowledg base user intent formal repres reason intent studi field natur aim build cooper automat dialogu recogn intent human interlocutor guid answer instanc focu recogn infer user intent user input softwar gener goal drive behaviour novelti approach stand exploit plan capabl dialog act build web site present plan guid user goal perspect structur site build system condit initi user constraint execut plan system correspond navig user system cooper build configur satisfi user execut choic branch condit plan determin mean interact user agent program languag notion comput agent central artifici intellig suppli power abstract tool complex situat dynam mentalist notion desir describ system term belief capabl system autonom plan execut action sequenc achiev reason effect action dynam chang world main problem face intellig agent intern dynam agent updat belief regard result execut action mental state briefli describ languag program agent base logic theori reason action chang logic program refer extens deal complex action action show order develop web applic requir plan capabl virtual seller softwar agent agent behavior defin set simpl action agent appli defin term precondit set complex action built simpl fundament characterist make languag interest agent program base formal theori deal reason action effect dynam chang environ support plan explain point section languag base modal action theori develop nonmonoton solut frame problem make abduct assumpt deal ramif problem introduc oper adopt dynam logic modal logic deal problem reason action chang common instanc al de giacomo lenzerini al motiv fact modal logic natur action state access relat kripk structur intent notion describ repres modal action theori suit incorpor attitud interpret address implement sicstu specif execut interpret interpret straightforward implement proof procedur languag paper languag build web applic requir plan capabl aim abil cognit agent autonom reason behavior order deal adapt navig dynam gener site guid user goal explicitli adopt interact import aspect defin navig possibl user determin page base dynam situat interact user primit action action languag primit action repres modal mean formula α hold execut action mean formula execut action α hold introduc modal denot formula hold action sequenc state consist set properti true chang time gener assum fluent state repres fact fluent unknown reason execut action incomplet state repres explicitli unknown introduc epistem level languag introduc epistem oper repres belief agent bf fluent fluent fluent undefin case hold write implement explicitli epistem oper fluent negat present intend unknown fluent unknown notat test fluent unknown test present simpl action law rule describ direct indirect effect primit action state simpl action consist action precondit causal action law defin direct effect primit action fluent action condit effect repres form primit action fs fluent mean action effect execut state fluent precondit fs hold precondit law action condit make action execut precondit law form mean fluent conjunct fs hold execut action state causal law express causal depend fluent describ indirect effect primit action form mean fluent hold fluent conjunct fs hold adopt readabl action law form precondit law form causal rule form seller fulli section action sell agent add monitor current configur true logic program context repres causal implic gener make modal provid true rule state action execut action law describ effect action ad monitor type monitor configur construct shop cart updat current credit sum monitor price defin seller primit action ad configur action execut state precondit action hold execut action modifi state action causal law assum fluent persist state action fluent chang execut action effect move robot show web page user associ primit action prolog code implement effect action world case web server request send web page agent execut action commit backtrack retract effect action main differ respect languag reason agent hypothet reason sequenc action explor altern interact suggest action interact agent user model languag mean action gather input extern world studi repres kind inform call agent gather knowledg environ fluent direct effect action interpret input agent control repres knowledg form mean action hold applic domain interest input user user result action execut request user enter fluent case ordinari domain case fluent finit user answer precondit indirect effect action express precondit law causal form defin run introduc action user monitor type specif applic defin special subset call suggest action differ wrt normal action offer altern valu fluent suggest action offer subset valu lead fulfil goal repres effect action notat suggest mean action suggest possibl select set valu fluent virtual seller perform suggest action offer user choic kind translat knowledg law modal languag true suggest result interact user gener goal guid sell agent behavior order build comput satisfi user model causal describ adopt goal indirect effect request user prefer answer agent suggest action kind comput request section indirect effect gener goal comput agent assembl comput multimedia causal rule gener goal main goal gener set compon built request mean instanti causal procedur procedur defin behavior complex action complex action defin basi complex primit action test action test action test fluent hold current state express condit complex action written fs fluent conjunct procedur defin collect procedur form pn procedur primit test procedur procedur procedur execut goal direct similarli standard logic program logic point view procedur regard axiom schema logic procedur regard axiom schema mean state execut execut state execut procedur describ behaviour agent assum behaviour ration agent driven set goal agent set procedur call achiev goal behaviour sell agent give collect procedur guid interact user achiev goal agent behaviour driven fluent form gener interact user mean causal rule adopt goal agent act achiev believ goal fulfil reach state correspond adopt blind commit strategi agent assembl comput procedur assembl comput believ assembl achiev goal miss compon assembl prolog goal axiom form rewrit rule grammar logic decid result subclass grammar logic regular grammar logic prove decid assembl assembl note goal compon main goal comput user reach comput consid assembl section causal rule goal comput consid assembl procedur agent select goal ad compon ram specif comput built agent goal gener interact user decid specif compon add user prefer point interpret execut commit backtrack procedur implement kind dont care determin formul behaviour similar agent program languag base bdi paradigm dmar plan trigger goal express sequenc primit test goal plan assum procedur behaviour agent execut interpret usual program languag ration agent cope complex unexpect reason effect procedur execut plan problem amount initi state goal sequenc action execut initi lead state fs hold complex action express specif instanc plan problem execut procedur lead state condit fs hold case execut sequenc arbitrari sequenc atom action execut formul queri termin execut finit action lead state fs hold execut queri return answer execut trace primit action sequenc initi state final repres linear plan achiev fs goal sequenc primit action procedur plan extract sequenc primit execut lead state fs start current state procedur plan work execut interpret main primit action execut effect extern backtrack simpli obtain procedur plan extract optim criterion plan iter deepen find plan minim number modifi make domain depend heurist procedur outcom unknown plan altern account appli plan predic procedur action obtain condit plan branch correspond outcom top level describ behavior sell report make interleav plan plan init figur result plan process user compon budget euro agent start interact user adopt kind comput user interest check user compon assembl comput characterist inform budget limit start plan reach assembl miss compon predict futur interact guid user prefer assembl process plan find configur account interact goal assembl comput satisfi user goal configur afford user budget agent execut condit plan result plan process assum execut case user request comput multimedia figur show result plan specif user budget virtual comput seller implement program creat virtual comput seller simpl comput repres term bui kind cad multimedia word process configur finit domain specif domain domain domain domain domain domain domain knowledg base applic domain main procedur behavior sell agent main report suggest action suggest action acquir inform user budget limit user kind comput user bui kind compon user prefer offer set maximum budget true suggest offer kind comput prefer request comput true suggest offer monitor prefer monitor type true suggest offer ram prefer ram type true suggest offer cpu prefer monitor type true suggest action action program user compon seller assembl comput satisfi user answer queri set goal seller achiev satisfi account inform user case posit seller updat goal user user monitor type user cpu type user ram type causal rule knowledg comput obtain interact gener main goal form main goal gener set compon goal abandon agent reach state believ compon main goal comput user reach comput consid assembl goal comput consid assembl assembl achiev goal agent behav assembl comput procedur assembl comput believ achiev goal miss compon assembl assembl assembl atom action simpl action law defin primit action add singl compon ram current configur true true true true true true true true true implement section describ virtual seller implement order work environ client commerci web browser basic idea web site plan satisfi user intent plan condit node set altern action path correspond comput configur configur condit plan satisfi user intent plan built agent case comput seller report section plan execut execut condit plan impli path part site path built execut action path affect data base inform compon store processor select agent number processor kind correspond branch requir dialogu user handl situat client connect server start parallel client serv dedic sell agent client build condit plan start client express intent node plan correspond foreseen altern state action interact start express client client comput intent belong set altern defin priori queri web web server case server machin web server properli dispatch request sell agent run sicstu prolog environ pass java work interfac java servlet directli emb sicstu prolog web server session left open browser problem partli mention agent simpli send result comput condit client send step step partial result singl page choic part site build explor user manag situat client paral carri prolog agent action execut gener case set altern compon applic domain choic shown html page altern item auxiliari page technic characterist user made awar detail make mind inform servlet compon data base agent send servlet command kind servlet produc html code inform relat cpu identifi data base request make choic answer return pass agent execut agent action consist produc html code relat show code wait feedback user agent perform action transpar consist ad fact knowledg base account pass send servlet inform page show unselect altern forgotten futur work paper present perspect interfac adapt tackl problem construct adapt web site base user intent approach orthogon classic approach user model opinion real adapt system encompass aspect shown modal logic program languag defin behavior agent build web site client work present progress start applic agent program core wider project agent suppli replan capabl replan useless system return plan fail account fact user unabl fulli express intent awar dialogu consequ initi choic chang case client alert system interest option suppli fact account refer tailor interact user electron intern confer user configur system construct virtual world wide web pp abduct proof procedur reason action modal logic intern workshop extens logic dix pereira przymusinski lnai pp modal program languag repres complex workshop transact chang logic joint int confer symposium logic technic report pp tableau calculu multimod logic de pp reason complex action incomplet modal approach technic report dipartimento di ration agent kernel cooper spoken dialogu implement logic theori workshop agent languag lnai intellig agent modal tableaux reason action european confer plan steel pp bn de introduc reactiv adapt hypertext conf de de evalu hypermedia european workshop natur languag giacomo lenzerini de framework reason topic artifici pp formal specif dmar pp deal concurr action modal action pp ramif causal modal action journal logic descript configur complex technic product virtual workshop user model adapt comput survei recent journal artifici intellig pp reason action chang dynam logic journal pp mp model ration agent morgan pp logic base framework action logic csli pp user model dialog
AI/646 2 algorithm evalu quantifi boolean formula evalu marco marco andrea dipartimento di informatica sistemistica di roma itali march technic report march dipartimento di informatica di roma itali url abstract high comput complex advanc reason task reason knowledg plan call effici reliabl algorithm reason problem harder np paper algorithm evalu quantifi boolean languag extend proposit logic advanc form proposit easili formul evalu algorithm evalu suitabl analysi wide rang complex properti easili found formal evalu base gener procedur work polynomi space present discuss abstract properti singl make effici discuss option investig heurist data report main result analysi evalu order magnitud effici nest backtrack procedur resort algorithm handl innermost set quantifi experi show randomli gener exhibit regular pattern distribut show reason problem frequent knowledg model evalu part work preliminari form introduct interest algorithm sat problem constant ai commun sat relev prototyp challeng abil cope larg knowledg base usag algorithm sat reason task classic proposit reason recent literatur problem plan encod sat theorem prover modal logic sat solver black box optim algorithm sat goal knowledg theoret analysi show advanc form reason belief reason comput complex higher complex cf show reason problem call effici reliabl algorithm reason problem harder np paper algorithm evalu quantifi boolean formula extend proposit logic similar extens proposit variabl quantifi mean truth assign exist truth assign true assign assign case true evalu problem decid true harder cope pure proposit logic advanc form reason reason knowledg modal tempor descript easili formul evalu evalu similar sat prototyp problem complet import complex pspace reason satisfi modal formula system syntact restrict offer complet problem complex class relev kr algorithm evalu suitabl analysi wide rang complex properti easili found gener instanc problem satisfi modal formula system fix modal depth integ make problem publish algorithm evalu base resolut algorithm restrict form evalu base gener procedur work polynomi space implement dp effici complet algorithm sat evalu shown exploit idea perform unit propag resort branch simplifi rule fail natur evalu sat forc specif rule design variabl bound extern quantifi dealt rule affect sound effici algorithm liter implement algorithm perform extens analysi perform evalu randomli gener report kind experi show evalu order magnitud effici simplest algorithm nest backtrack procedur resort dp handl innermost set quantifi find pattern shift crossov point point half instanc evalu phase transit differ instanc close crossov point instanc distribut result gener shown richer structur possibl analyz behavior paramet counterpart proposit case number quantifi altern structur paper section quickli remind basic notion prove properti formula design algorithm evalu algorithm shown section basic choic heurist data structur result complex basic discuss section analysi shown section perform algorithm analyz regular pattern randomli gener formula highlight section deal reason evalu relat work discuss section extens research report section quantifi boolean definit properti subsect remind syntax semant introduc result design effici algorithm evalu formula syntax semant form proposit formula involv proposit variabl existenti quantifi express oe abbrevi exist truth assign oe oe abbrevi truth assign oe invert quantifi chang truth invert quantifi cf section yield gener group set consecut variabl quantifi quantifi appli set variabl singl proposit variabl sequenc quantifi existenti quantifi quantifi constant quantifi appli disjoint set variabl sequenc quantifi add subscript denot type extern quantifi formula mutual disjoint set proposit formula sat coincid evalu problem evalu inher difficult decid satisfi proposit evalu problem plai role prototyp problem class problem evalu problem evalu class level polynomi hierarchi rest paper refer conjunct normal form form boolean formula conjunct disjunct liter negat variabl case call matrix formula liter tautolog liter negat cnf problem evalu formula respect evalu problem complet complex class gener case intern quantifi existenti form intern quantifi existenti sequenc quantifi altern fix type intern quantifi make subscript useless form form rule simplif evalu easi design algorithm evalu appli semant nest select variabl outermost set reduc appli algorithm sat show properti make algorithm make defin partit variabl occur definit form defin set union set existenti quantifi collect quantifi variabl small liter belong variabl fw fz partit set matrix definit form partit matrix variabl variabl remain rewritten refer partit obtain simpl suffici condit lemma falsiti form obtain delet tautolog proof assum exist tautolog liter truth assign make variabl liter notic formula trivial empti simpl check requir lemma accomplish time linear size matrix interest case assum case gener form base gener show suffici condit evalu lemma falsiti form unsatisfi proof truth assign existenti quantifi variabl make matrix true corollari lemma unit occur useless falsifi unit propag rule algorithm applic appli variabl unit propag rule variabl lemma exist unit variabl belong show applic lemma satisfi true unit propag true simplifi exist variabl lemma lemma form true obtain delet variabl proof obtain delet model model assum model make true truth assign variabl true show applic lemma trivial true satisfi assign satisfi lemmata present suffici condit true unsatisfi notic verifi condit lemmata requir perform satisfi test analysi shown case applic lemma make algorithm evalu effici section condit simplifi terminolog call liter monoton complementari liter matrix monoton liter import immedi assign branch truth assign function set shown lemmata lemma liter form monoton liter true obtain replac true proof variabl proof induct index set variabl belong case belong extern existenti quantifi obtain replac true true subset true true case cardin denot matric obtain appli substitut truth valu variabl assum true true set induct set true set true obtain replac true set true true proof similar set true lemma liter form monoton liter true obtain replac proof variabl proof lemma prove statement induct index set variabl belong case belong extern quantifi obtain replac true true subset true true case proof obtain techniqu case lemma show applic lemmata liter monoton lemma true formula assign true monoton defin assign true lemma true true monoton defin assign monoton assign true result empti origin true condit lemmata check polynomi time lemma gener idea unit propag liter occur liter occur condit check polynomi time assign truth implicitli assign opposit truth complementari lemma assign form exist liter liter belong set formula true formula obtain substitut occurr true proof ffl thesi lemma ffl liter lemma assign preserv truth formula simplifi true iff assign true ffl case liter includ disjunct liter assign truth liter assign simplifi liter lemma true iff assign true note condit lemma requir liter belong extern set quantifi variabl lemma appli lemma present suggest result experi perform gent walsh lemma form condit ffl ffl liter argument ffl ffl ffl condit true liter proof case consid separ assum condit lemma assign true simplifi liter belong lemma unit lemma assign simplifi liter belong similar lemma proven variabl assign variabl assign make assign exist liter prove suffici show formula assign lemma appli assign simplifi liter belong unit lemma assign simplifi liter belong similar lemma proven show applic lemma refer notat lemma form pair condit tabl summar rule evalu simplif obtain complex natur algorithm section appli lemmata shown design evalu algorithm evalu form algorithm evalu shown figur solv evalu perform success simplif origin techniqu propag perform partial evalu obtain matter evalu make procedur evalu evalu interact cooper evalu input formula evalu procedur work extern quantifi existenti evalu work formula extern quantifi matrix cnf main procedur evalu input return truth matter perform simpl tautolog remov notic elimin tautolog complex effect condit trivial falsiti evalu suffici trivial falsiti evalu suffici trivial truth evalu suffici true monoton liter simplifi suffici monoton liter simplifi suffici forc assign simplifi suffici falsiti evalu suffici tabl summari rule evalu algorithm evalu cnf formula form true boolean evalu tautolog remov return return figur evalu algorithm perform success manipul algorithm make input formula creat tautolog evalu invok evalu evalu figur show procedur evalu procedur input return truth time iter work base evalu check input formula form existenti quantifi evalu suffici invok procedur sat line algorithm implement evalu verifi trivial true lemma comput obtain remov quantifi variabl check satisfi input formula evalu stop return true iter forc trivial algorithm proce gener formula simplifi mean truth valu assign variabl assign made evalu forc forc assign variabl simplifi true true forc assign simplifi evalu process make backtrack assign perform variabl belong extern set variabl input formula input assign gener requir turn back simplif perform case simplif made variabl instanti case evalu evalu invok evalu procedur simplif made matrix empti mean true algorithm stop return true simplif made matrix empti case trivial algorithm stop return simplif made matrix form quantifi variabl lemma formula algorithm stop return procedur evalu true boolean evalu variabl existenti return remov quantifi obtain formula return uninstanti variabl empti set return empti return made quantifi variabl return unit form liter assign true simplifi monoton liter assign true simplifi monoton liter assign simplifi includ liter liter assign true simplifi satisfi condit lemma return liter assign simplifi return assign true simplifi return return figur evalu procedur case evalu check perform forc assign variabl lemmata unit propag lemma situat forc assign perform line note lemma fulli justifi unit propag lemma appli note condit lemma lemma appli condit correct answer return iter lemma appli proof lemma sequenc applic lemmata decid criterion effect branch forc assign evalu simplifi input formula mean assign made liter line exclud true evalu split evalu subformula obtain assign true correspond quantifi true subformula true instanti branch evalu process call branch liter heurist branch liter section chosen branch liter actual structur save futur backtrack evalu invok formula obtain assign branch liter result call evalu procedur stop return evalu backtrack restor structur formula simplifi assign true branch liter procedur return result obtain appli evalu procedur evalu similar omit matter evalu differ evalu case set existenti quantifi variabl evalu logic call evalu perform logic implement issu section show main heurist data structur implement evalu heurist algorithm sat choic branch liter evalu line crucial import perform literatur heurist specif design inspir larg bodi work sat work implement list ffl fix liter chosen order ffl heurist sat basic idea select liter occur shortest number occurr complementari liter account weight sat ffl heurist sat base idea maxim number matrix simplif ffl simplif criterion lexicograph restrict attent binari ignor number occurr complementari liter heurist work comput set liter occur binari select liter make lot unit refin select liter occur select liter variabl occur frequent ffl heurist previou ignor distinct variabl liter select belong refin select liter occur quantifi result result problem intuit easi deal choic branch liter deal face choic heurist underli sat problem line algorithm solv implement heurist sat heurist lexicograph lexicograph tabl heurist instanc satisfi problem case pure adopt mention heurist choic branch liter fix combin heurist experi report tabl result obtain summar compar implement refin make perform term number term execut time effici implement show design heurist sensit type liter difficult task compar implement evalu case number long long sat lexicograph show good heurist sat necessarili good evalu compar implement heurist case procedur lexicograph time faster number small amount shown section procedur call modest case call sat line implement suffici condit lemma sound check satisfi polynomi matrix incomplet algorithm idea give posit impact perform evalu result obtain implement improv paid term implement lexicograph heurist special data gener time higher data structur choic data ffl verifi condit applic lemmata effici check condit applic lemmata exponenti ffl implement effect lemmata unit effici effect lemmata simplif ffl select branch heurist present subsect effici chose redund repres kind liter variabl set arrai fl ffl fl set liter belong ffl fl set liter belong ffl arrai ffl arrai ho jo jo identifi occur posit occur neg flg size formula variabl assign disappear satisfi assign made line arrai automat resiz auxiliari data structur matrix lexicograph number posit neg occurr variabl length rule verif effect lemma lemma lemma lemma lemma heurist select lexicograph tabl complex procedur implement main oper worst cost report tabl remind effect lemmata unit propag liter variabl variabl fl entri account term cost function term number occurr number distinct variabl variabl occur averag jo jo cost unit propag note experi section linear claim chosen data structur room improv code implement methodolog obtain high level modular reusabl result section present import result obtain appli evalu algorithm randomli gener instanc show model gener analyz cost benefit rule shown section final highlight regular pattern exhibit formula true randomli gener formula consid section model gener test gener instanc fix length model model ffl number distinct set proposit variabl formula ffl cardin jx jx ffl number ffl number liter model formula gener liter set produc randomli distinct variabl negat probabl model directli extend model sat test ensur includ liter complement avoid gener trivial instanc lemma disallow quantifi variabl gent walsh note model probabl gener instanc statement lemma quickli instanc decid investig model call remov replac similar model investig differ select criterion model existenti variabl disallow consid constant densiti model paramet repres case averag number liter formula formula produc includ variabl fix probabl negat probabl prove averag number liter jv easili determin probabl averag length cd discard empti unit presenc make evalu process easier consid paramet set ran record data truth randomli gener cpu time number number paramet give idea size portion search space explor algorithm number increment unit happen procedur implement number increment call evalu depend number call evalu unit propag adequ small larger number gave qualit result data success process obtain median valu split result separ data true instanc perform test equip processor mb ram impact rule perform aim analysi evalu impact effici algorithm lemmata heurist analyz section result shown figur set true instanc evalu dumb figur perform evalu disabl lemmata progress figur refer instanc kind gener model set variabl vari set ratio step logarithm averag number true instanc figur show curv number true perform evalu version algorithm lemmata disabl mean lemmata mean lemmata disabl branch liter chosen heurist appli figur show disabl lemma impact remind filter perform significantli lemma disabl elimin lemmata remov lemmata remov number order true instanc gain evalu wrt version order magnitud high percentag true low percentag data cpu time similar set evalu figur perform evalu disabl lemmata separ figur refer except lemmata disabl separ lemma consid appli result confirm effect rule lemma lemmata impact lemmata invok frequent situat lemmata effect lemma lemma disabl make number instanc consid figur lemma make perform set evalu figur perform evalu disabl lemmata separ sum evalu algorithm extrem effici algorithm adopt simpl strategi backtrack higher level resort procedur outer variabl elimin problem reduc instanc gain order interrupt experi lack resourc rule section merit perform posit neg lemmata simplifi fact invok time instanc lemma appli time instanc variabl lemma appli time instanc variabl set applic degrad cpu time verif applic polynomi situat lemmata evalu lemmata ffl lemma appli rare appli frequent appli time averag instanc variabl set lemma prove obtain simplif cost impact cpu time posit ffl lemma order appli lemma mean instanc call procedur made case instanc appli solut incomplet method ffl lemma appli rare model number lemma instanc number call made condit statement line rare typic settl extern quantifi elimin variabl call maximum instanc deeper instanc chang variabl call line compar analog figur lemmata appli time lemmata settl lemmata formula appli phase transit pattern goal analysi understand comput phenomena observ analysi polynomi problem context evalu import pattern phase transit abrupt chang global due small local chang sat problem observ exist crucial small larg chang probabl formula satisfi phenomenon occur paramet close point probabl formula satisfi observ phase transit relat comput resourc solv problem instanc phase transit simpl instanc close phase transit demand pattern rest subsect show result analysi model introduc subsect model result formula kind gener cardin set variabl jx jx test execut vari number variabl set step variabl note variabl set variabl number variabl vari set ratio step set true instanc var var var var var set var var var var var figur true instanc number fig report percentag true instanc function set variabl set curv show phase transit occur phase transit steeper steeper number variabl crossov point move left curv fig case fig show median number function set ratio curv follow number initi ratio success settl constant valu notic correl hard evalu instanc crossov point gent walsh explain depend high probabl gener instanc statement lemma section confirm show pattern occur model matter evalu algorithm perform evalu kind formula fig displai difficult test evalu averag evalu variabl set instanti variabl cpu variabl set evalu averag evalu lexicograph averag variabl close crossov point result result obtain similar verifi case exist phase steeper steeper number variabl comput effort evalu instanc variabl averag number greater number similar case fig crossov point variabl close analog paramet set set var set figur true instanc number var interest phenomenon observ number variabl phase transit steeper phenomenon shown fig formula variabl slope phase transit progress formula type correl tabl constant correl coeffici crossov point crossov point fact phase transit steeper explain observ number satisfi constraint phase transit steeper case set variabl extern satisfi constraint due variabl number variabl set set percentag true instanc higher case case fig show averag number evalu formula variabl case slightli harder easier explan fact obtain high percentag instanc small valu set ratio fig verifi instanc easier true solv number interest result obtain concern relat number crossov point number variabl set type formula consid determin crossov point number interpol function av linear function case cf number crossov number variabl set step constant depend type formula consid valu case list tabl note valu close suggest number crossov point proport squar root number variabl set analyt explan result hard evalu sharpli matter wide rang number variabl type formula evalu process instanc variabl set mean collect data variabl set requir dai set true instanc set figur result var consid variabl ran experi formula variabl obtain qualit result fix number variabl vari set ratio increment fig show result obtain variabl set result variabl curv percentag true averag number averag number function set ratio usual phase time observ pattern number number peak curv locat correspond set ratio percentag true instanc crossov point crossov higher previou number evalu kind formula remark higher wrt formula consid evalu averag evalu variabl peak evalu variabl set liter drastic reduct assign evalu algorithm fig number evalu variabl set split true instanc separ hard true instanc ratio difficulti instanc remain modest ratio pattern number due true set ratio hard influenc averag valu absenc pattern number due fact phase transit sharper number true instanc influenc significantli averag number unbalanc existenti variabl previou result obtain cardin set variabl interest question result chang modifi proport number variabl formula number number order understand proport number variabl impact ran group consid call kind formula var consid var kind formula total number result compar variabl set fig show percentag true instanc averag number obtain var var repres ratio number averag number variabl case compar fig notic evalu var formula easier evalu formula variabl case observ case highest number case drastic reduct number explain number respect number reduct number true phase transit steeper number variabl set number variabl set true instanc figur result var var var variabl set true instanc hardest fig reduct averag number fig show opposit phenomenon formula type harder variabl set case number peak point case fact explain number variabl number number true averag number slope phase transit result evalu random harder ran test variabl set vari set ratio step fig show averag number evalu solv kind percentag true repres set ratio aim make clear shape curv number plot data polynomi sixth order number time peak occur instanc crossov point curv averag number show analog pattern omit number peak point high peak cf fig verifi hardest instanc true rare true instanc occur set ratio requir solv set true instanc reg figur result var result group experi consid variabl set kind vari number step set true instanc set figur result var fig report percentag true averag number averag number function set ratio curv number number hardest instanc crossov point number peak point formula kind harder number variabl set compar fig fig notic phase transit crossov shift respect fig split number true instanc separ interest notic hardest instanc result obtain cf kind consid hardest instanc true phenomenon explain extern quantifi evalu stop run find assign variabl extern set make formula easiest instanc odd extern quantifi easiest instanc true evalu stop run find assign variabl extern set make formula true model model main compar ffl pattern case figur analog figur show median number peak close crossov move instanc moder harder worst case ffl situat instanc exhibit pattern differ crossov point model experi case longer deeper find cost nest crossov point set move slightli slightli left odd cd model result model appli instanc easili evalu aim verifi case ran evalu algorithm randomli gener instanc variabl set averag liter test execut vari number step set var var var var set var var var var figur true instanc number set true instanc figur result var fig report percentag true instanc number function set ratio curv number show peak point crossov point compar result fig notic remark differ number peak result confirm instanc gener model harder instanc gener mean cd model short simplif evalu process predomin respect complic due long applic great theoret usag knowledg formal limit claim algorithm practic mechan reason task reason servic knowledg formal easili translat comput truth upper bound comput complex problem polynomi hierarchi establish reduct reduct translat instanc problem check truth subsect sketch reduc reason problem valuat formal mention reduct modal descript logic focu reason problem express term mention ffl skeptic reason default logic reduc evalu ffl formal plan la deduct task complex belong class polynomi hierarchi express term work kautz selman ffl recent lang marqui introduc notion control defin proposit formula easi show control problem reduc evalu ffl abduct easili express term detail complex abduct refer work eiter gottlob circumscript basic proposit case proposit semant circumscript interpret model proposit formula denot set variabl map notat denot formula occurr variabl replac variabl notat gener order denot formula occurr variabl set simultan replac element order set variabl order set variabl cardin formula fx fy formula formula ff circumscript knowledg base kb kb circ true minim model model kb minim model kb strict subset variabl problem decid kb circ ff express evalu fx alphabet kb set variabl variabl evalu true kb circ ff shorthand shorthand denot size kb size size result show reduct short kb ff fx fy notic ff true uniqu minim model fx easi assign variabl formula disjunct line satisfi remain case assign true make disjunct suffic set true order make true reduct extend complex form vari fix predic result de kleer konolig gottlob reduc gener problem decid entail proposit circumscript evalu notic result formula cnf algorithm immedi applic result reduct issu discuss section modal descript logic activ area research year definit reason algorithm proposit modal logic descript logic result ladner infer modal system correspond present schild satisfi check descript logic alc ladner defin reduct modal logic reduct ongo research develop number reduct formula modal logic reduct number variabl factor depend modal depth modal formula modal formula variabl modal depth result altern quantifi variabl experi reduct encourag result preliminari experi suggest pattern preserv reduc cnf common problem reduct outlin format result turn cnf wai bypass problem moment implement rewrit mechan rewrit cnf wai accomplish ffl de morgan law rewrit proposit formula cnf size exponenti ffl exist algorithm rewrit proposit ff fi ff satisfi fi satisfi rewrit add variabl alphabet ff subset alphabet fi method directli appli care reduct satisfi relat comput cnf matrix size linear size true true rewrit cnf size linearli variabl existenti quantifi innermost quantifi relat work work defin algorithm paper present algorithm author defin variant resolut call shown sound complet algorithm interest led paper defin algorithm base procedur compar approach author address reason problem harder np year system decid satisfi modal formula concept work giunchiglia sebastiani algorithm defin algorithm problem instanc satisfi test suffici condit approach work fine problem consid giunchiglia analysi show instanc evalu limit number call satisfi solver algorithm implement system horrock work show satisfi express terminolog complex higher check reason amount time special heurist approach difficult compar result clear counterpart terminolog logic set techniqu algorithm complementari classif optim list algorithm techniqu constraint guid techniqu direct backtrack set suffici condit greatli reduc search space explor techniqu integr framework conclud section note advantag kind logic formula difficult gener random fashion modal formula fix modal depth integ make problem shown halpern futur work paper present algorithm evalu quantifi boolean formula algorithm larg instanc problem belong class captur level polynomi discov properti exhibit randomli gener formula claim evalu conceiv effici main result obtain list ffl evalu extrem effici applic rule section heurist rule merit impact gener except lemma danger satisfi implement invok typic settl evalu extern set variabl import strive optim phase evalu process smart implement make data structur complic ffl heurist choic branch good heurist safe pure proposit perform found difficult find heurist heurist evalu rule sensit type subject current research ffl regular randomli gener analyz gener obtain result phase transit phenomena exist investig case pattern observ observ true pattern observ instanc gener model difficult gener model adequ short exhibit qualit result longer instanc gener cd model easier gener mean model consid odd true instanc easier unbalanc number variabl remark effect difficulti instanc variabl instanc harder opposit phenomenon occur sum singl case practic requir comput made step develop algorithm effici averag case develop algorithm step goal point wide accept kr formal order substanti experi usag algorithm solv problem satisfi modal formula aim perform test proposit modal formula class paper interest number altern linear function number variabl input interest question concern function bind number number variabl crossov model optim algorithm includ incomplet algorithm sat perform test requir lemma brand cach depend direct backtrack acknowledg work support asi space murst ministri scientif technolog cnr research refer tarjan linear time algorithm test truth quantifi boolean formula inform process boi de la tour minim number renam tenth intern confer autom deduct page resolut quantifi boolean formula inform klein report sat competit gottlob effici method elimin vari predic circumscript artifici marco andrea marco schaerf analysi comput cost evalu quantifi boolean formula confer italian associ artifici intellig number lectur note artifici page marco andrea marco schaerf algorithm evalu quantifi boolean formula fifteenth nation confer artifici intellig page crawford result crossov point random artifici crawford result crossov point satisfi problem eleventh nation confer artifici intellig page de kleer konolig elimin fix predic circumscript artifici eiter gottlob complex proposit knowledg base updat counterfactu artifici eiter gottlob complex abduct journal gent walsh phase transit ap technic report juli giunchiglia sebastiani build procedur modal logic proposit procedur case studi modal thirteenth intern confer autom deduct lectur note artifici giunchiglia sebastiani procedur alc intern confer principl knowledg reason page joseph halpern effect bound number primit proposit depth nest complex modal logic artifici ian horrock express descript fact sixth intern confer principl knowledg reason page ian horrock peter patel schneider proposit modal satisfi descript logic subsumpt kautz selman push proposit stochast search thirteenth nation confer artifici intellig page ladner comput complex provabl system modal proposit logic siam journal lang marqui form independ proposit control defin fifteenth nation confer artifici intellig page lifschitz comput circumscript ninth intern joint confer artifici intellig page mccarthi circumscript form reason artifici reiter logic default reason artifici schild correspond theori terminolog preliminari report twelfth intern joint confer artifici intellig page mitchel method solv hard satisfi problem tenth nation confer artifici intellig page levesqu gener hard satisfi problem artifici hierarchi theoret comput meyer word problem requir exponenti time acm symposium theori comput page
Agents/647 1 motion control lifelik refin approach abstract paper oper model automat gener lifelik gestur anthropomorph virtual agent biolog motiv approach control movement highli articul figur transform spatiotempor gestur specif analog movement anim directli render comput anim techniqu combin method trajectori format articul figur anim introduct nonverb modal commun behavior virtual agent move focu interfac research human figur lifelik nonverb behavior displai addit speech enabl social commun attribut artifici advantag natur effici commun link human machin gestur facial integr part dialogu ingredi practic commun candid extend commun capabl virtual agent core part anim tempor coordin lifelik human sensit observ motion convei mean gestur discuss find field relev product gestur human base hierarch model plan gener lifelik gestur multimod stefan artifici intellig group faculti technolog bielefeld germani agent approach base comput anim techniqu encapsul motion gener enabl abstract control structur higher level discuss relat work synthet gestur virtual agent present model provid descript plan focu lower level gestur movement articul figur explicitli form execut present techniqu conceiv drive kinemat skeleton virtual agent freedom joint main bodi dof hand figur articul structur virtual agent joint includ hand relat work synthet gestur automat gener lifelik gestur virtual agent work present agent reli complet predefin gestur anim system anim develop cassel al gener gestur virtual agent interact gestur produc run predefin finit state machin transit issu gestur request anim system arm wrist motion target posit orient hand motion term expand librari base american sign languag alphabet gestur movement appar predefin parametr term alter singl gestur relax phase gestur time exce actual time constraint mean coher modifi gestur movement preserv natur movement typic veloc profil perlin goldberg creat lifelik motion virtual actor mean anim subject rhythmic constraint stochast function yield slight perman alter present restrict hand model attach gener natur movement basi success target annot addit synchron properti natur produc motion achiev incorpor heurist knowledg movement format process mean minim cost function kinemat presum veloc profil scale order fit durat estim approxim human movement studi recent emot model zhao al form execut qualit aspect movement order natur independ motion base effort shape compon movement oper model express arm torso movement present provid intuit control manner movement appar conveni techniqu gestur product virtual humanoid approach current system produc movement extent reli predefin motion sequenc model automat gener lifelik gestur flexibl symbol descript base spatiotempor featur lack model gestur gener gener goal research oper model enabl convincingli lifelik gestur anim adequ spatiotempor gestur edg model provid suffici mean motion control produc multipl kind gestur movement highli articul figur shown flexibl gestur parametr respect veloc profil shape properti relev find relat disciplin quot hierarch model present comput step gestur plan movement execut overview emploi techniqu repres plan movement reader refer detail descript gestur human process gestur product perform human complex process abstract gestur gener spatiotempor work memori cognit higher transform pattern control signal directli interpret motor system result gestur exhibit characterist shape dynam properti enabl human distinguish subsidiari movement recogn gestur movement consid distinct movement phase form hierarch structur case stroke effort part tightli coupl accompani speech yield tempor synchroni modal model motor control commonli conceiv hierarch structur highest level global aspect movement repres form abstract goal control pass progress lower level choic made motor unit control resid level process occur parallel level gener scheme motor control incorpor level found approach scheme account current view plan voluntari movement perform directli term kinemat extern complex joint rotat signal basi knowledg initi arm posit target suggest gestur product primarili locat postur repres intern intermedi movement gener motor control system ical plan constitut step inform goal movement express term properti trajectori perform intern simul account actual condit movement function gener reflect desir trajectori physic movement step translat simul trajectori motor variabl drive lower structur result virtual trajectori consid reflect gener motor suggest motor program partial encod properti includ pattern transit initi final posit execut command lowest level lead movement ideal simul trajectori gestur plan quot find suggest perform movement plan principl smaller complex configur articul figur eventu joint angl major stage control scheme shown execut motor map movement specif eventu set motor program movement directli render gestur request gener execut motor command hand motor system gestur planner bodi alloc gestur select movement plan motor program motor planner arm motor system trajectori format kinemat model anim render figur schemat overview gestur gener process gestur plan imag movement creat intern form arrang constraint repres mandatori spatial tempor featur gestur spatiotempor descript previou stage gestur locat refer deictic retriev common knowledg gestur hand shape point model lexicon abstract descript gestur movement inform usag transfer commun intent entri consid defin map commun function explicit movement descript gestur term postur featur movement phase featur defin independ symbol gestur notat system determin individu gestur descript accommod entri uniqu refer specif valu content gestur quantit paramet deictic icon gestur time defin arrang constraint definit tree parallel sequenc node option nest detail descript found gestur planner decid limb perform gestur choic partial resembl choic specif gestur planner collect gestur fulfil requir commun function account inform origin sourc propriocept feedback current bodili planner suggest gestur suit actual movement condit individu movement complet deriv concret valu variabl movement constraint schedul constraint gestur stroke appli extern tempor constraint onset time durat due constraint tree gestur planner form movement tree tempor order set movement retriev gestur specif adapt individu gestur qualifi movement constraint extent tempor integr extern time constraint motor plan motor plan motor control simpl modul distinguish ment constraint affect bodi part reli assumpt movement distinct motor system synchron discret time relat constraint order preserv tempor pass dedic motor hand adopt subsequ hand control sole special hand model interpret descript hand shape translat directli hand pose appli stereotyp transit alter hand locat orient arm movement transfer control hand interpret convert posit orient constraint respect egocentr frame gener movement follow trajectori movement format execut form trajectori redund manipul arm model includ satisfi set tempor constraint preserv smooth natur human motion difficult task arm model emploi biolog motiv format section simul human movement field motor kind human movement distinguish ballist movement conceiv complet prepar advanc run amend motor fast movement movement case exhibit symmetr veloc profil work point control movement hand perform moder speed subject continu amend movement feedback inform result control process reflect movement veloc peak profil perform spontan execut ballist control visual feedback inform requir deictic gestur refer small size case composit movement human sequenti corrobor observ human gener complex movement piec shorter simpler commonli refer observ natur human movement result multipl human perform attempt achiev high accuraci unpredict movement condit trajectori smooth simpl movement consist condit assum gestur product virtual agent figur point gestur observ studi movement direct plot time huge number experi human movement circumst found literatur overview report major trajectori effector directli relat motor task trajectori individu joint simpl scale procedur permit task due larg power reserv implement strategi complex movement consist elementari unit glu speed drop connect point frequent correspond point maxim curvatur trajectori experi carri lab peopl great varieti movement perform gestur tend anticip pend gestur move arm preliminari rest posit elbow flexion prepar retract movement start end rest posit exhibit significantli stereotyp charact format arm trajectori find draw major format complex trajectori part cartesian coordin spatiotempor featur coordin gestur movement defin sole distinct time natur lead interpol problem hand trajectori extern coordin reason interpol joint angular space mutabl alter tangent mean produc proper extern limb trajectori due map cartesian coordin joint angl valu simpl prepar retract joint angl base format lead result effici provid suffici number control point order gener intermedi point deviat stai prespecifi error kinemat appli scheme algorithm frequent robot straight line path due invari movement shape movement durat shape defin independ global kinemat detail veloc profil depend shape slow turn point symmetr phase path format method hand relat movement shape veloc flexibl mean adjust gestur time preserv shape human movement requir format method ensur continu consecut curv segment suffici local control properti order fulfil extend trajectori format method base parametr curv composit notion subsequ linear curv veloc yield realist veloc profil curv movement control point defin ¢ ¢ ordinari blend function order ¢ note defin sole term curv guid simultan combin consist curv linear stroke easili base classic tend approxim control point achiev gener subsequ stroke goal result discontinu due control point altern formul interpol spline provid addit local control paramet shape evalu kinemat model explicitli defin veloc curv spline distanc time obtain absolut tangent vector simpli applic ifi stereotyp veloc profil observ ment movement approach adapt doubl interpol method high flexibl regard adjust movement kinemat gestur abrupt halt durat gestur order satisfi tempor constraint sequenc trajectori constraint posit curv gener determin start condit movement case time movement constraint satisfi due extens transit achiev start end time constraint gener movement preserv tempor structur feasibl solut trajectori form method typic retract movement append limb subject motor program control smooth transit gener posit curv parametr continu render anim motor program motor system creat motor program fed central anim control execut strictli time manner motor program creat hand motor system directli affect kinemat model modifi joint arm movement defin term trajectori cartesian coordin control veloc standard techniqu increment alter limb posit kinemat problem solv extens jacobian method algorithm translat composit appli joint angl account limit human biomechan heurist form cost function subject prefer adopt postur minim superposit cost function rotat appli polynomi cost base observ ¢ ¢ absolut valu deviat rest posit individu ¢ addit weight neglect effect yield simplifi equat motion ¤ ¤ jacobian option stiff matrix integr equat method converg stabl state geometr correct solut iter process track posit curv summari paper present model synthesi lifelik gestur kind model incorpor method repres spatiotempor gestur featur plan individu gestur biolog motiv techniqu format arm trajectori enhanc method render anim execut result motor program includ target enabl gestur perform anthropomorph articul figur achiev higher lifelik synthet agent gestur plan includ hand motor system complet method trajectori format track elabor model conceiv enabl natur integr account tempor synchroni goal includ integr techniqu extract tempor constraint control coordin gestur speech refer cassel embodi paradigm studi gestur interfac mess chapter page oxford badler emot model effort shape siggraph dress cost function control human arm movement biolog gestur speech product phd mpi seri psycholinguist serial process human movement product neural model interact speech gestur sixteenth annual meet cognit scienc kendon current issu studi gestur biolog foundat motor semiot page lawrenc erlbaum interpol spline local continu bia control comput proc siggraph approach lifelik gestur anim ecai european confer artifici io press control human movement human kinet synthesi gestur progress gestur gestur workshop mcneill hand gestur reveal thought chicago trajectori format human movement understand elsevi scienc publish perlin goldberg system script interact actor virtual world siggraph annual confer comput page hen version hamburg notat system sign introductori volum intern studi sign languag commun deaf plan control simpl movement smyth psycholog human chapter page academ badler parametr keyfram interpol incorpor kinet adjust phrase control comput taylor plan execut straight line manipul trajectori ibm zu im faculti novemb watt watt advanc anim render techniqu acm elliot comput techniqu kinemat confer decemb
IR/648 5 integr automat genr analysi digit librari andrea alexand depart softwar technolog vienna technolog abstract number type document digit librari system tool automat organ present content found approach focu organ system incorpor automat structur analysi genr inform form distinguish featur convent librari inform search paper present approach automat analyz structur document integr inform automat creat organ result document similar repres di erent depict book di er color support user intuit locat relev inform present relev form keyword genr map document metaphor graphic introduct question document recogn crucial present relev inform question piec inform present larg neglect present electron inform system type inform unconsci contact inform everydai life person letter treat di erent short stori read di erent occas long popular scienc literatur address di erent dissert scienti provid highli similar inform di er level detail audienc speci execut summari technic make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee june usa copyright acm ical design satisfi inform provid inform di erent wai issu form import distinguish featur convent base inform ag fact frequent remain untouch long period long digit librari care similar convent librari type inform carefulli captur form metadata provid albeit intuit textual form inform wai intuit di erent situat encount digit librari piec inform di erent sourc mere amount inform ad repositori ectiv prevent manual index set automat analysi structur piec inform essenti user quickli correct term content respect content present paper present provid automat analysi structur text document analysi base combin surfac level featur word punctuat occurr special charact tag captur hyperlink similar inform base structur descript map popular neural cluster document structur similar inform incorpor digit librari system organ document map group document content interfac system depict document digit librari sort content label automat extract content descriptor techniqu integr result structur analysi document color sort subject structur make complex descript stand summari legal explan subject interview topic depict di erent numer tabl result list demonstr bene ts automat structur analysi document combin classi cation collect articl austrian weekli monthli magazin remind paper structur section introduct principl genr analysi present review relat work area proce present architectur train procedur map section applic som document classi cation present section includ overview modul digit librari system special focu base interfac present approach structur classi cation document integr provid system section section present result collect newspap report structur classi integr futur work list section genr analysi genr analysi long histori linguist literatur genr term short scienc de nition genr vagu webster dictionari english genr de ned categori literari composit content di er definit main goal genr analysi identifi subgroup set object share common form properti term genr appli form frequent restrict scope literari exclud music lm genr common interpret genr refer literari automat analysi genr slightli di erent structur analysi surfac level cue main structur similar inform deduct approach evalu structur readabl text result numer di erent measur grade text automat base surfac featur featur readili implement unix style command measur includ packag target technic develop navi train manual flesh read easi formula stem base english school text cover grade similar measur develop speci calli german text measur basic comput score combin inform number word syllabl sentenc charact word weight obtain grade complex stylist found semin work metric pronoun count gener text statist cluster text order underli dimens variat detect gener properti genr classi cation text document genr analyz karlgren al number di erent featur describ structur characterist document standard surfac addit featur requir syntact tag requir noun present participl count includ discrimin analysi obtain set discrimin function base train set line research continu report detail featur stylist analysi stylist variat document visual scatter plot base combin featur speci area assign special descriptor user analyz cluster document found scatter plot recogn import integr genr analysi inform retriev interfac incorpor classi cation base tree cluster hierarch agglom cluster algorithm document repres row repres topic cluster found document column organ document number genr tree train recogn di erent approach describ document number facet directli assign genr report facet properti distinguish class text answer practic characterist set comput structur linguist properti princip categor facet analyz brow text respect intellectu background requir understand subdivid high binari narr facet decid text written narr classi es text ction set deriv cue describ logist regress creat classi er base train set manual classi ed text ri appli genr classi cation spontan spoken includ featur histogram number neural network subsequ analysi interest method frequent analysi current research work turn model analysi genr due peopl tend term ned term structur similar document document frequent exhibit characterist di erent genr di er genr strict set criteria make strict classi cation imposs task strict classi cation similar document cluster analysi document descript captur structur similar map map cluster analysi produc map input data output space preserv topolog relationship input data item faithfulli model consist set arrang topolog common choic grid unit assign weight vector dimens input initi random valu learn unit highest activ winner respect randomli select input pattern adapt exhibit higher activ level futur present speci input pattern activ level unit base euclidean distanc input pattern unit weight vector unit show lowest euclidean distanc weight vector present input vector select winner select winner written express jjx jj min adapt place learn iter perform gradual reduct di erenc respect compon input vector weight vector amount adapt guid learn rate gradual time natur adapt strength ensur larg adapt step begin learn process weight vector tune random initi actual requir input space smaller adapt step end learn process enabl input space extens standard competit unit gradual neighborhood winner pragmat learn step map set unit winner tune present input pattern enabl spatial arrang input pattern alik input map region close grid output unit train process map result topolog order input pattern neighborhood unit winner implicitli mean ci account term output unit unit winner current learn iter assign scalar rang determin amount adapt ensur nearbi unit adapt strongli unit farther winner common practic begin learn process select larg cover wide area output space spatial width input space output space figur som architectur train process reduc gradual learn process end learn process winner adapt strategi enabl format larg cluster begin input discrimin end learn process combin principl map write learn rule express note make discret time notat denot current learn iter part express repres learn ci repres repres present input denot weight vector assign unit ci simpl graphic map architectur learn process provid figur gure output space consist squar depict circl input vector randomli chosen map grid output unit step learn winner show highest activ select winner unit depict black unit gure weight vector move current input vector movement symbol input space figur consequ unit produc higher activ respect input pattern learn unit weight nearer input pattern term input space adapt perform neighbor unit subject adapt depict shade unit gure shade unit correspond amount adapt spatial width unit close vicin winner adapt strongli depict darker shade gure system featur extract order util som organ document topic descript content document creat manual semiautomat extract content descriptor research result shown simpl word frequenc base descript sucient provid inform stabl word frequenc base vector structur creat consist word document collect list word clean socal word contribut content topic discrimin document manual craft list simpl statist remov conveni word half remov risk content content convei word gener word minimum number document omit classi result granular small form topic cluster situat di erent inform retriev speci term index facilit retriev speci subset document organ document constitut conceptu di erent approach access interact document archiv topic hierarchi supplement search includ inform retriev capabl realiz system document result featur space commonli distinct word made basic binari index describ content document simpli state word document sophist tf idf term frequenc time document frequenc provid content weight scheme assign higher valu term frequent high term rare complet low document frequenc document vector normal unit length make length di erenc document organ result vector fed standard map cluster analysi document similar topic locat neighbor unit map displai simplest document collect repres rectangular tabl similar document map cell user document collect automat structur content similar document organ shelv convent librari due capabl automat structur document collect chosen som basic build block digit librari system enhanc model grow hierarch map automat detect topic hierarchi creat layer structur independ som adapt size label som found wide appreci eld text classi applic limit fact topic cluster evid result map order topic cover area actual articl read descript keyword cluster counter develop train som automat extract set descript unit attribut show low quantiz error high weight vector compar low varianc high input vector map speci select label unit keyword describ topic document map visual spatial organ document map combin automat extract concept label support orient understand unknown document inform document told result inform size underli date access time access languag provid intuit interpret user requir read abstract textual infer amount inform provid document compar size date inform develop base interfac digit librari document longer repres textual graphic object di erent type metadata inform convei addit metaphor spine di erent highlight posit shelf base metaphor de ne set map metadata attribut easi understand similar usag face space figur visual document digit librari interfac document depict di erent document type addit metadata convei spine logo textual inform depict dust highlight bind metadata inform document easili interpret compar larger amount inform repres compar standard textual descript structur genr analysi structur featur organ visual document provid system greatli support user interact digit document creat provid manual size figur visual digit librari date date author consist provid electron document collect high volum document ad frequent manual classi cation type inform import user pick document similar task automat organ categor document structur stylist featur basic type fuse inform organ provid system interfac limit introduc process tediou task produc accur train set manual follow approach similar chosen document organ creat featur vector document captur stylist characterist document cluster document similar convei structur featur reveal basic type genr surfac level cue set featur restrict featur automat extract document accept comput cost similar classi process domain independ exibl applic system di erent set distinct type featur text complex inform text special charact punctuat characterist markup text complex measur text complex measur base word statist averag number word averag word number sentenc similar format inform simpl complex construct turn captur combin characterist punctuat mark extens measur analyz nest depth sentenc integr experi present basic deriv measur exist readabl grade flesh formula base basic measur transform obtain grade stylist evalu paramet refrain initi consid evalu special charact punctuat count wealth stylist inform obtain speci charact count promin punctuat characterist text genr presenc mark highli indic emot text pure fact report magazin set interview exhibit high count question mark high count comma indic complex sentenc high sentenc length short sentenc attribut list inform item analyz occurr quotat slash bracket complex punctuat inform worth feasibl extract ellipsi di erenc singl doubl quotat usag dash versu semant context deduct complex featur extract text base integr di erent sourc refrain repres level structur inform experi charact worth incorpor stylist analysi nancial symbol euro number mathemat copyright paragraph sign worth includ hint special categori technic price legal simpli exampl clarifi expand topic stopword keyword contrari principl content lot convei pronoun adverb list characterist word ad list word note list languag easili adapt languag adapt complex speci languag word ection speci keyword characterist sentenc depend speci document collect consid desir focu genr addit keyword ad list recognit versu separ specul articl tag fourth group featur form speci tag extract inform document inform amount imag present number tabl extract includ genr analysi adapt actual format sourc document consist map tag imag count featur latex html document parser recogn di erent speci calli gear speci le html gener applic depend goal structur subset attribut select analysi result document descript fed map train result train process document similar stylist characterist locat close neighbor unit som longer document complex sentenc area area shorter sentenc high count colon quotat mark locat map serv kind access document integr librari support user inform nding process integr content structur base classif possibl er integr organ system chose semiautomat approach assign speci document type region assign document upper area map type document area lower left part map depict document approach intuit document assign genr identi ed map type de ned approach shown de cienci appli larg unknown document collect number type limit number di erent document type present collect total number type system supplement addit object type addit total number limit type strictli distinct gradual shift type document forc document de nite genr provid subtl inform gener speci highli prefer high manual ort requir analyz actual genr identi ed som provid map genr area map respect graphic metaphor map crucial usabl classi cation result user associ speci type inform metaphor assign wrong templat turn highli inform locat favour automat approach integr inform provid genr map visual document similar structur assign similar color intuit recognit interpret structur similar metaphor turn perfectli suit convei desir inform transport speci mean set realist document intuit kind inform map posit speci color realiz map rectangular map area plane rgb color similar techniqu cluster identi cation som document map neighbor unit genr map depict similar easi recognit similar style depict gradual transit structur cluster document di erent region genr exhibit distinct depict di erent color visual experi data set seri experi perform includ technic document web site analysi experi present creat collect report download monthli austrian newspap print magazin set exhibit typic digit librari tender manual carefulli inform di erent sourc di erent intern classi cation schemata integr major document stem daili number articl organ larg manual classi cation topic cover sourc perspect issu present di er larg attribut gener genr newspap magazin special econom larg style report chosen situat topic cover report interview issu cover gener econom section paper procedur implement data sourc automat remov characterist format structur sourc navig undu stylist analysi di erent html encod special charact convert uniform result report base subset entir collect consist articl march system exibl gener applic stem speci perform articl creat descript fed separ map cluster analysi due space restrict provid detail map select repres cluster detail discuss organ som topic organ articl base featur vector main topic cluster identi ed collect econom consist domin group articl relat telecom privat austria cluster locat lower left corner result som upper corner articl cover polit discuss format govern elect polit cluster basic cover left area move initi discuss polit topic promin cluster form sport report cover formula smaller cluster address di erent area promin devot internet technolog method label automat describ topic cluster keyword translat english discuss cluster repres articl austria freedom parti label list parti abbrevi polit leader label unit demonstr weak crude index approach chosen appli stem trail term form distort result content adapt improv result classi albeit sacri languag domain independ unit locat unit label minist bottom list freedom lead peter austria thoma ident import characterist som make suitabl organ document collect interact shift topic unit econom cluster lower corner label telecom mention cluster privat austria steel lead involv privat christoph unit similar privat austrian postal label nice show topolog order map label sport cluster mention cluster formula label wm manual design remain list index term show label form promin common featur articl cluster label fridai label sport cluster approach provid remov sacri domain languag independ current approach appli document collect cluster repres document soccer label list import soccer club plai group tournament neighbor unit unit time label champion porto map serv index digit user read topic cover section librari document repres locat html tabl label provid text tabl cell transform graphic sourc magazin titl provid logo spine inform result document result list inform provid articl incorpor genr inform genr map som organ articl genr som analyz structur featur document group document domin cluster repres form move report quotat long interview subject label extract techniqu identifi distinct characterist cluster interview characterist attribut number open close quot colon distinct made averag length sentenc frequent set interview articl longer citat cluster document high colon complet di erent sentenc length structur special charact occur frequent open close break form sport articl provid result list document exhibit high count number short report separ longer articl due number text length distinct short report cluster higher count sport result articl report announc radio tv special documentari sport transmiss larg cluster document consist legal set frequent usag paragraph charact internet articl integr genr inform topic organ label extract techniqu user interpret understand som sucient user intuit cluster document correspond speci genr extract featur correspond casual user attribut characterist interview sport result list assign unit speci map genr som document locat upper left corner color upper corner assign lower left corner lower corner yellow unit automat assign intermedi color document assign color base locat genr som color repres document expect document locat shelf colour di erent exhibit di erent structur figur show shelf upper area som repres articl soccer sport section gener topic unit shelf label told document unit stem daili newspap die articl daili newspap averag length articl unit document short depict minimum spine width di er color distinct type document locat unit rst articl color repres short result list outcom match color bright emot transcript live report explicitli green document provid factual report match complic style color longer report list short descript section match figur sport economi section fact report nancial situat soccer color di erent soccer result report di erenc partial membership econom articl attribut frequent occurr euro currenc symbol shelf beneath soccer report document report nancial interest repres articl di erent daili monthli magazin weekli magazin gener public shelf strong focu econom issu label interest rate distinct type articl distinguish color dark brown rst shade dark brown extens report interest rate green document written inform style made short sentenc list import issu tabular form complex explan complex articl wider spine width figur depict shelv continu econom section map number articl stock exchang upper lower shelf report econom data print magazin die rst document lower shelf color provid detail list magazin subscrib averag incom green document report repres short overview articl describ gener figur result market studi simpl term similar structur green document discuss number green document upper provid short descript bui insur polici base document describ seri issu relat stock market transact complex expect document exhibit color rst depict broad di er report describ compani perform cite expert short characterist featur separ neighbor darker lengthi descript evalu actual genr document intuit told color repres di erent structur characterist document automat translat small set distinct repres intuit metaphor paper book lengthi report simpler map principl assign di erent metaphor di erent area genr prefer automat map structur posit document genr som simpl color space learn interpret ort requir understand structur shown small chosen approach gradual genr usabl studi rst test small set turn encourag result visit document respect area peopl feel expect document speci describ term featur classi cation map user expect yellow document black simpl approach structur analysi provid genr captur ne di erenc type inform involv linguist analysi provid present system de nite fail separ factual inform perform genr analysi strict captur structur characterist similar uncov speci genr inform set lead misunderstand imposs factual inform provid support user satisfi inform true util map produc map captur gradual di erenc structur concept manner futur work provid structur inform document essenti user decid relev document digit librari document collect convei inform carefulli design metadata describ genr resourc case uniform descript document provid manual true digit librari integr document di erent number document ectiv prohibit manual classi cation paper present autom approach structur analysi text document characterist featur averag length count punctuat mark special speci word pronoun describ structur characterist document selforgan popular neural cluster document similar document color locat result structur similar document color similarli result structur analysi incorpor organ digit librari provid system document provid di erent perspect report complex short shown book di erent color result graphic provid interfac initi experi shown encourag result step ne map posit structur som color mutual similar distanc unit ect perceiv distanc color assign document structur similar di erent type evid assign similar color document part larger cluster consist improv map achiev distanc inform provid weight vector unit map suitabl color space term human percept chosen perceiv similar dissimilar closer addit featur er genr analysi experi distinct articl versu articl includ addit keyword list featur refer variat speech write cambridg typolog english text karlgren genr visual proc webnet novemb internet categor approach journal visual commun imag face repres point space graphic journal american statist write style program technic report bell murrai republish part user supplementari document oreilli som base cluster visual applic color proc intl joint conf neural network juli ieee comput societi karlgren stylist experi inform retriev natur languag inform retriev iter inform retriev fast cluster genr proc eighth delo workshop user interfac digit page octob karlgren cut recogn text genr simpl metric discrimin analysi proc intl conf comput linguist automat detect text genr proc conf europ chapter associ comput linguist page kohonen format topolog correct featur map biolog kohonen map massiv document collect ieee transact neural merkl rauber document classi cation neural network crestani soft comput inform page physica rauber label map proc intl joint conf neural network juli rauber digit librari system base neural network fox proc acm conf digit librari page august acm rauber visual electron document draw book paper digit librari advanc visual proc ifip work conf visual page kluwer academ publish rauber merkl digit librari system europ conf research advanc technolog digit librari lnc page septemb springer merkl automat detect organ document topic base approach bookshelf creation arrang proc europ conf research advanc technolog digit librari lnc page septemb springer ri detect descript textual mean indic spontan proc europ conf speech commun technolog septemb salton automat text retriev inform comput andrea alexand integr automat genr analysi digit librari cl joint confer digit librari june
Agents/649 1 automat select landmark panoram imag simon thompson alexand zelinski abstract visual landmark robot field appar success visual landmark depend landmark chosen good landmark remain reliabl time posit orient paper describ system learn place automat select landmark panoram imag task adapt biolog inspir turn back behaviour evalu potenti landmark correl overcom affect illumin environ result real robot experi show success meter learnt posit introduct visual kei problem make success autonom robot vision sensor sourc inform mobil environ inform vital solv problem limit visual narrow field view offer normal monocular camera system greater field view camera inform environ extract visual process intellig system laboratori ibaraki japan robot system laboratori depart system australian nation act australia figur panoram imag problem vision inform fact main task vision scienc work part inform job discard put panoram imag panoram imag solv problem mention convex mirror shape greater field view achiev panoram mirror give full horizont visual field vertic field shown figur visual field cost resolut part pictur captur camera normal field view full horizont field view inform achiev navig task path plan path panoram pictur navig robot corridor view sequenc robot sequenc panoram imag acquir imag current view drop set correl threshold imag work corridor environ chang suffici warrant view meter environ rate acquisit dramat panoram imag chang dramat small distanc natur landmark navig attract solut problem landmark task landmark requir part environ store contribut accur aid triangul techniqu landmark overcom acquisit rate problem requir entir visual field remain area set landmark success landmark depend choic landmark describ monocular system landmark chosen basi reliabl landmark displai uniqu surround abil remain reliabl robot move environ end system monitor reliabl landmark seri small arc back behaviour inspir observ bee flight pattern applic panoram camera system visual landmark investig light field view landmark select strategi procedur adjust thompson al describ system goal learn place environ associ area set visual landmark mobil robot locat set landmark denot place ultim landmark home navig place paper detail implement system report initi result experi real robot system system setup system implement mobil robot platform nomad technolog ical mirror mount upward point camera top robot achiev panoram vision imag captur captur card softwar produc greyscal imag imag process advantag technolog speed correl comput learn place process landmark select aim navig abil mobil robot subsequ exposur environ mean landmark strongli distribut imag error navig calcul withstand distort due tempor translat distort end zelinski select number landmark section static environ base reliabl reliabl test dynam environ move robot origin posit static reliabl landmark static reliabl landmark determin uniqu landmark local region imag local uniqu defin landmark templat differ area imag immedi surround landmark approach base vallei mori al gener attent token turn instanc moravec interest oper appli featur track zelinski adapt method present task automat select landmark shown figur figur show correl result obtain match templat search window center origin templat vallei imag templat match high correl compar minimum match distort result match landmark sixteen surround shown grei bottom local uniqu landmark found reliabl distort landmark match minimum match distort surround circl pixel result distort due higher distort minimum surround steeper figur vallei distort matrix reliabl landmark figur vallei distort matrix subsequ uniqu local templat figur panoram imag divid sector roughli left landmark sector select divid visual field equal distribut landmark ensur sixteen landmark evalu dynam reliabl dynam reliabl landmark good navig landmark reliabl chang environ remain strongli identifi small light shift perspect end zelinski test reliabl static select landmark seri small arc turn back phase inspir observ wasp bee flight hive figur show path robot phase robot move posit camera orient panoram scene potenti landmark phase test reliabl landmark movement direct stage basic movement implement shape cross shown figur cover movement plane determin elabor movement effect perform potenti landmark track path reliabl measur evalu approxim step dynam reliabl averag reliabl measur entir path landmark highest dynam reliabl measur sector chosen repres place figur phase dynam landmark select figur modifi phase dynam landmark select panoram vision simpli matter match set current visual scene brute forc search landmark entir imag undertaken set landmark robot assum place set landmark highest averag correl current scene experi experi carri determin perform system varieti condit experi place intellig system environ corridor meter width meter length experi consist initi phase learn place guid robot desir place initi automat landmark select softwar subsequ phase guid robot posit attempt locat learnt landmark gave perform result result correl valu repres perfect correl desir perform achiev high correl result largest discrimin place landmark cover wide system cut back amount storag process time correl static landmark dynam landmark figur perform static dynam select landmark high correl area accur posit landmark lead navig behaviour home move place static landmark dynam landmark establish turn back phase automat landmark perform place made landmark select static landmark select static dynam select place learn phase reliabl static landmark store addit dynam landmark meter section corridor center place learnt measur interv result static landmark shown plot figur sharp peak evid peak fall maintain edg graph plot figur show result dynam landmark peak center sharp drop rapidli peak correl valu slope graph eventu fall approxim edg graph compar graph show dynam landmark result higher correl measur greater area learnt place static landmark slope observ dynam graph attribut higher distort landmark locat side corridor compar end corridor correl figur sampl panoram imag captur figur sampl panoram imag captur distanc measur graph dynam landmark approach observ result place discrimin experi illumin affect illumin perform investig place learnt select landmark store phase carri immedi learn set learnt landmark result meter section corridor center learnt measur interv sampl imag robot run run shown figur demonstr varianc illumin trial figur show result experi conduct differ level illumin peak posit graph similar valu follow step slope previou valu edg graph figur show good robust templat match routin landmark track successfulli rapidli diminish illumin correl figur perform differ light test perform figur landmark track chang illumin correl correl place discrimin landmark set landmark set landmark set path imag number figur place discrimin learnt landmark set landmark learnt place robot meter path place learnt posit imag number set place discrimin final abil system correctli discrimin place test place learnt site roughli meter center corridor measur continu learnt place robot move straight path meter length middl corridor correl result set landmark figur robot progress path landmark set nearest learnt place highest correl deterior perform landmark set set attribut robot wander center corridor major meter robot approxim achiev pure visual reli past observ odometri process benefit knowledg previou posit model ad system enhanc perform robust expect encount place due past observ significantli reduc search time evalu potenti place add system work system paper demonstr automat select landmark panoram imag mobil robot turn back phase landmark select result landmark reliabl greater area environ landmark locat dramat due correl routin implement final system demonstr robot number learnt place meter trajectori obviou extens mention introduc probabilist model past observ influenc outcom observ associ landmark measur reliabl correl observ scene lend approach number posit landmark desir repres place interest question experi minim number landmark hardwar greater number landmark track frame rate physic posit landmark relat robot pose problem gross landmark chang move visual desir accur navig landmark move slightli visual field ego provid robot reliabl inform rel posit landmark lie direct motion robot desir number posit landmark navig investig navig algorithm home place navig place develop refer zelinski biolog inspir visual landmark learn navig mobil robot intern confer intellig robot system volum page ts collet flight learn journal american psycholog page bee turn back journal compar inou navig sequenc int conf field servic page moravec automat visual obstacl avoid nation joint confer artifici volum page inou attent point gener base classif correl distribut annual conf robot page automat landmark select navig panoram vision australian confer robot autom thrun bayesian approach landmark discoveri activ percept mobil robot navig technic school comput scienc carnegi mellon omnidirect imag sensor navig ieee transact robot
AI/650 2 techniqu detect system daniel inform technolog oper unit state militari academi curti jeffrei udo depart comput texa abstract paper examin techniqu provid adapt detect system attack comput system increasingli numer grow detect system dynam adapt detect respond attack adapt hierarch detect system detect adapt adjust amount system resourc devot task detect activ accomplish dynam invok combin lower level detect agent chang circumst adjust confid agent adapt system adapt weight success past techniqu success success success techniqu adapt base system belief detect report valid adapt detect system provid robust protect system introduct number inform warfar attack increasingli sophist annual report comput emerg team number comput secur incid year figur depict rise comput secur incid report report attack sophist cert annual report report grow attack script tool control collect exploit cert distribut denial servic workshop report grow autom script launch control ten thousand attack target attack comput limit inform initi attack attack origin threat sophist comput attack grow detect system threat previou work detect past twenti emphasi great deal research devot support design construct effect detect system system research advanc increasingli import area research prototyp commerci id ir built period number notwithstand effort obviou benefit limit research devot support adapt detect capabl system research system support form adapt focu primarili issu learn discov pattern state indic behavior secur adapt manag provid higher adapt sam adapt protect postur base current state system sam determin protect calm state configur minim resourc usag system attack panic aggress detect postur maintain research conduct support design autonom agent research perform purdu center research educ inform assur secur primari sourc inspir research present paper detect adapt negoti project support adapt provid protocol id compon dynam negoti modifi agreement id compon set research implement prototyp distribut assess system support dynam base perceiv threat postur individu system network commerci secur system internet secur system claim lead provid adapt network secur solut iss product wide arrai secur servic adapt servic base frequent conduct risk assess iss detect capabl detect wide arrai support limit adapt detect capabl oper year detect past twenti number system provid action develop system categor notif manual automat system tabl major detect system notif system system gener report alarm system provid addit capabl system administr initi figur cert report incid year manual limit preprogram set capabl notif time gap detect initi automat system immedi respond automat system simpl tabl attack attack preprogram execut preprogram consist predominantli execut singl command action invoc seri action order limit effect attack except cooper secur manag event monitor enabl live disturb system provid adapt system expert system determin classif system notif manual automat total tabl classif system march incid suspicion ongo attack suspicion level system adapt base suspicion emerald system sever metric determin exist system adapt comput attack base belief valid report gener detect system system adapt base actual success rate paper address open research issu adapt detect methodolog overview adapt hierarch detect system emploi fulli multiag framework major compon framework director manag tool surrog agent base agent architectur develop director agent detect action collect system network segment multipl level director exist level hierarch director subset system supervisor director agent surrog agent surrog resid part role assum event director fail surrog partial mitig inher shortcom hierarch arrang exist singl point retain inher advantag hierarch arrang director agent set manag detect activ possibl overlap subset system director manag agent detect activ system emploi dynam changeabl set tool agent tool agent fulli detect system manag suitabl number type tool agent import manag agent tool agent encapsul function vari emploi wide varieti method analyz data wide arrai sensor individu tool agent specif system network segment tool agent high autonomi function independ agent system agent framework commun collabor peer subset agent commun languag knowledg queri manipul languag agent commun supervisor surrog commun agent enabl special detect common specif languag event tool agent detect activ prepar send kqml perform messag surrog messag includ tool agent render report presenc uncertainti supervisor maintain continu updat threat level exist system determin agent account inform subordin supervisor supervisor agent prepar send kqml perform messag solicit inform make determin adapt support id framework detect adapt specif area support adapt adjust amount system resourc devot task detect activ tradeoff amount system resourc devot perform work devot secur system period due perceiv low small proport system resourc devot detect activ period perceiv high significantli resourc devot task direct support id framework reason process determin level system resourc accomplish detect task id adapt dynam invok combin detect agent chang circumst condit network result resourc level vari type tool rate specif type attack expect id tool design detect type attack id framework explicit support form adapt id adapt adjust confid metric associ detect agent id gener posit neg rate priori improv id tool track perform low level tool maintain confid metric id framework incorpor form adapt adapt methodolog overview tactic toolkit detect system interfac master analysi analysi adapt system methodolog summar figur multipl monitor comput system gener alarm interfac agent maintain model id base number gener model gener attack confid metric pass metric report master analysi agent master analysi agent classifi incid continu exist incid attack master analysi agent creat analysi agent develop plan attack incid continu exist master analysi agent pass attack confid metric monitor system system admin tool polici specif taxonomi figur methodolog logger report exist analysi agent hand attack analysi agent analyz incid resolv gener abstract action resolv incid gener analysi agent invok taxonomi agent classifi attack polici specif agent determin goal limit base resourc constraint analysi agent pass select action tactic agent tactic agent abstract action specif action invok compon toolkit analysi tactic agent emploi adapt base success previou logger record analysi tactic agent system administr review adapt support methodolog adapt tactic agent interfac agent adapt modifi confid metric id perfect gener posit neg alarm tailor system believ report incid real attack alarm confid metric ratio posit report actual report number posit gener feedback loop interfac agent system administr tool system administr incid real attack alarm result updat confid metric report id adapt incid gener high number posit sever report seldom gener alarm analysi tactic compon provid adapt analysi compon receiv addit incid report lead type attack type attack lead formul plan chang goal accomplish analysi compon chang plan step accomplish goal altern step substitut plan analysi compon request tactic compon perform adapt tactic compon multipl techniqu implement plan step chang techniqu system adapt approach attempt stop intrud analysi tactic compon maintain success metric plan action plan action success resolv weight frequent plan step techniqu success summari current detect system system limit abil adapt detect capabl increasingli sophist attack paper id prototyp system adapt capabl improv detect effect abil system robust resist attack refer cert coordin statist cert coordin coordin center cert coordin intrud tool detect system gener detect expert system tech report sri menlo lee mine approach usenix secur san januari pp design detect depart comput neural network nation inform system secur crystal octob pp neural network classif detect ieee transact neural vol pp genet algorithm altern tool secur audit trail intern workshop recent advanc septemb dave steve aaron perri automat adapt detect prevent usenix secur san januari secur adapt annual comput secur applic architectur detect autonom tech report coast depart comput purdu west comput system autonom coast depart comput purdu west detect adapt raid recent advanc west septemb fred tim stefan scalabl network june internet secur engin market strategi damag control taxonomi implement autom phd texa colleg secur detect ieee vol pp porra event monitor enabl live nation inform system secur octob pp neumann emerald usenix workshop detect network santa april metaphor phd massachusett institut specif kqml agent commun intern confer inform knowledg novemb decemb pp common specif languag methodolog intellig agent provid autom ieee cybernet inform assur secur west june pp carver taxonomi role automat ieee cybernet inform assur secur west june pp rom
IR/651 5 measur structur similar xml document dtd bertino dipartimento di scienz dellinformazion degli studi di milano itali dipartimento di informatica scienz dellinformazion degli studi di genova itali abstract sourc xml document web document frequent exchang sourc exploit tool manag kind data import novelti xml inform document structur web document content inform improv document handl achiev effect effici search document heterogen environ reason assum xml document enter sourc conform predefin dtd present sourc paper metric quantifi structur similar xml document dtd metric emploi document classif document cluster metric select structur similar structur document aim group document similar structur similar dtd high group structur cluster dtd introduct xml recent emerg relev standard effort document exchang web offer possibl defin tag model nest document structur xml semant advent inform document structur tag web knowledg document structur order improv document retriev element flower determin term queri xml offer possibl defin document type dtd type describ structur document xml dtd essenti grammar constrain tag structur document document structur conform dtd call valid xml terminolog presenc dtd advantag knowledg document structur index set document refer xml data standard data interchang start fact heterogen flexibl environ assum document relat structur fix set predefin dtd handl xml document valid dtd set aim develop search engin capabl extract web document portion document deal semant structur express user queri retriev document valid dtd address problem match document set dtd document fulli conform dtd set attribut subel element dtd miss element document addit attribut subel dtd document follow order wrt dtd document tag document dtd provid stem similar thesauru match document dtd goal similar document dtd obtain measur emploi document classif document cluster case document scenario refer consist number heterogen sourc xml document exchang document sourc store index local document set local dtd xml document enter sourc match dtd sourc dtd exist sourc document conform usual document accept valid dtd metric select describ structur document approach support structur cluster base idea group document similar structur similar dtd high group structur cluster dtd cluster assembl document similar structur cluster assembl document similar structur express user queri structur cluster find formul case cluster case document start set dtd dtd deriv user infer sampl set document exist dtd infer xml document match dtd set dtd exist set document conform usual document structur similar document assign structur cluster dtd match process perform tree document dtd easili obtain declar techniqu handl featur xml sake focu core restrict subset xml document tag equal discuss approach gener arbitrari xml document handl tag similar address issu measur structur similar xml document relev potenti applic structur cluster document document retriev base condit document structur work benefit previou work develop context automat object classif heterogen inform integr data schema approach develop account tag structur similar remaind paper structur section present tree figur xml document xml document dtd section discuss basic idea evalu structur similar document section similar function match process discuss detail section discuss extens applic present result section conclud work appendix match algorithm document dtd tree figur show xml document describ softwar product figur show dtd show subel option occur time subel altern respect anticip focu subset xml document element nest descript author vendor version download homepag fname figur dtd disregard attribut case disregard nonempti element interest disregard order subel match repres dtd xml document label tree section discuss tree document xml document repres label tree reli inform determin structur document definit base classic definit label tree set node set label tree defin induct label label label tree document node repres element label edg incom node repres tag label label tree belong set element tag set valu data content element assum tree repres xml document singl edg outgo label edg belong en document edg label valu incom node leav tree call termin definit introduc xml document definit en set element tag set valu xml document label tree en en label edg incom en label edg incom sake graphic omit explicit direct edg edg orient downward figur show tree xml document present figur tree dtd repres label tree tree order repres option repeat altern download homepag fname descript version product url author figur tree xml document figur set oper op introduc oper repres sequenc oper repres altern oper repres option oper repres repeat element remark introduc oper element type declar replac match process element declar dtd edg correspond element element oper tree repres dtd singl edg outgo label edg belong en main element document edg outgo edg incom node label edg label type incom node leav tree set basic type element definit formal specifi notion dtd definit dtd tree label en op en label edg incom en label edg incom label edg incom en label edg incom figur illustr tree dtd obtain grammar rule xml dtd figur show tree function tree denot tree element compon figur show tree product dtd figur remark introduct oper op repres structur kind dtd introduct oper requir order elem tn elem tn elem elem elem figur tree dtd distinguish element altern sequenc element altern element sequenc tree shown figur document figur valid wrt dtd valid wrt dtd vendor descript homepag download url fname version author product figur tree dtd figur figur dtd motiv introduct label edg note final tree state element document element document figur correspond leftmost root node reach product label edg figur instanc dtd presenc option dtd describ set document structur instanc dtd dtd describ singl document structur dtd formal state definit definit instanc dtd dtd definit label belong en document conform instanc dtd structur differ valu data content element set instanc dtd describ structur document valid figur instanc dtd set instanc dtd dtd infinit dtd oper dtd figur exampl instanc dtd dtd figur fl dtd tree repeat identifi repeat path root root edg label edg label element definit list label edg path root root repeat label en dtd tree shown figur edg path root root dtd label edg path root figur repeat element dtd root dtd label element correspond intuit element repeat arbitrari number content element element fl note tree termin edg repeat requir similar measur section introduc exampl requir metric measur structur similar document dtd minu element similar measur element document refer common element document refer element dtd refer figur tree document dtd minu element achiev minu element minim common element maxim document dtd tree shown figur document figur dtd figur tag document element subel document dtd share element document dtd document common minu element document figur dtd figur document dtd share element document dtd document common minu element evalu absenc element presenc addit document similar dtd figur common element fl repeat element discuss section wai document match dtd altern repeat dtd describ document structur match document adequ document case repeat similar measur identifi number maxim common element minim minu element note higher number repetit element document match element dtd number unmatch element dtd document dtd tree shown figur possibl repeat arbitrari number time sequenc element map element document element dtd document sequenc figur tree document dtd dtd repeat result total present document miss document repeat sequenc obtain common element minu element situat summar tabl fl repetit common minu tabl measur similar document dtd level element till consid element document element higher level document structur relev subel deepli nest document structur similar measur catch intuit element figur tree document dtd higher level document relev element lower level document dtd tree shown figur element subel element miss document figur element subel element miss document figur document figur similar dtd figur fl introduc notion level relat depth tree tree tree repres level depth number edg longest maxim path path root tree tree repres level number label longest maxim path edg label oper dtd tree influenc breadth document depth notion formal definit definit document dtd function level defin max op denot tree figur fl assign weight element level tree level tree children root weight fl weight divid fl level gener level weight fl fl paramet relev inform higher level document respect inform lower level fl inform consid equal fact element level nest structur account fl weight element similar measur account fact element complex structur document simpl data element declar element document structur simpler element dtd document dtd tree shown figur match document figur dtd figur document lack element match document figur dtd figur document lack element lack element evalu case simpl data complex substructur document figur dtd figur dtd specifi content element document element complex substructur fl show similar measur structur minu element case minu structur fix element figur present option subel tag altern subel tag element tag idea structur minu simplest instanc dtd portion dtd measur account option repeat element case measur account altern element simplest introduc function weight evalu document dtd function measur match process document weight function weight multipli number element level weight level result valu sum dtd weight function weight work account mandatori element dtd function option element repeat element case label weight altern evalu minim chosen choic minim correspond select simplest structur definit document dtd weight level function weight defin figur tree document dtd min fl denot tree figur recal fl note weight number level dtd fl measur similar previou section outlin requir similar measur meet order properli evalu similar xml document dtd section present similar measur address requir describ evalu function present match final defin similar measur evalu function order evalu similar document dtd set instanc dtd select maxim evalu function select similar instanc similar document measur move top level document tripl determin repres number common element level wrt instanc dtd note element found level subel minu tripl determin step multipli level weight singl tripl obtain sum tripl obtain step similar comput mean base tripl obtain step definit tripl natur number fi real number st fi function defin ff fi function defin ratio model base paramet fi return depend assign function relev element wrt minu ff fi function account element measur similar document extra element wrt dtd similar measur equal ff fi evalu function account minu element similar measur exampl assum ff fi give relev minu element discuss ff fi fact result evalu tripl relat valid document wrt dtd document dtd tree shown figur figur show instanc dtd gener start dtd level weight shown tripl repres number common element multipli level weight sake simplic omit label edg level weight figur evalu similar ing function sum tripl level obtain repres highest similar document dtd fl outlin section set instanc dtd dtd dtd repeat element account document dtd restrict finit set instanc refer instanc dtd dtd document intuit repeat dtd repeat element document match repeat useless note set huge dtd complex structur match algorithm naiv solut evalu similar document instanc dtd dtd select algorithm determin similar comput set instanc dtd develop algorithm base idea local determin structur dtd element altern inform structur subel document algorithm gener handl case sake remaind section simplifi version algorithm present simplifi version base assumpt declar subel tag forbidden element declar handl section show assumpt remov implement function associ tripl document dtd function shown appendix input document dtd level weight flag rp indic repeat level weight initi maximum number level document divid fl time function move level ensur similar evalu properli assign level weight level structur idea behavior function visit document root match common element distinct phase move tree part tree visit call evalu termin case return call altern evalu select describ main idea discuss base case termin phase start pair form behavior function sequenc depend call pair present call pair mark repeat form call pair en reach edg label comput ft set common element call pair move level document element dtd call function identifi common element structur part element present repeat note evalu common element perform phase base case tripl comput termin edg dtd reach element dtd match element document found tripl repres evalu common element base case termin edg label match termin edg tripl fact minu common element weight level weight phase start evalu base return call minu common element intermedi pair account label edg outgo repeat tripl pair comput singl tripl evalu intermedi pair case list tripl comput list gener repeat number repetit level postpon higher level cardin list pair depend repeat label edg outgo root cardin list repeat fg greater repeat en due space limit discuss tripl gener case depend label focu interest pair label element outlin set ft children label comput set element dtd tag miss tripl determin depend repeat mean requir valid miss function weight call order determin weight miss element tripl return repeat real evalu stage dummi tripl return element miss detect evalu outer set ft element tag call children return tripl repres evalu element found case depend repeat tripl repres tripl maxim function select tripl return determin ffl repres evalu minu element select ffl repres evalu common element select level weight ad current level common element ffl repres evalu element select add common compon tripl level child select evalu weight match label label level consid repres compon level level weight compon tripl list tripl obtain order base function optim number occurr element establish evalu outer similar measur base function similar measur document dtd defin definit document dtd maximum level similar measur defin fl figur show function work document dtd shown edg tree bold call function made root edg bold label tripl obtain evalu edg label tripl repres evalu minu element tripl document dtd obtain naiv algorithm fl note case tripl repeat figur execut function proposit state relationship notion valid similar measur proposit fi paramet function ff fi properti ffl valid wrt ffl valid wrt disregard order element discuss section discuss techniqu handl arbitrari xml result obtain extens arbitrari xml document present algorithm work subset xml approach handl arbitrari xml document discuss issu cover till element tag level tag similar tag equal attribut attribut handl dtd document repres tree kind attribut element edg algorithm handl attribut handl element data content empti element handl tree special label edg data content empti element handl simpl element content issu attribut match subel text choic attribut element model short string text depend develop skill experi distinct element attribut match attribut data content element consid fl paramet measur subel tag discuss section algorithm present base assumpt declar element dtd subel tag assumpt simplifi occurr element figur tree document dtd ment match element dtd previou assumpt match element document match consid lead highest select document dtd figur match element document match match bs lead perfect match match bs fl algorithm handl evalu match matrix built element dtd direct subel tag matrix column subel element row wai element tag level document match similar measur evalu select note match comput similar element document document constraint element content element tag content singl definit element element dtd element document match tripl obtain repres similar definit element dtd similar evalu visit tag similar consid tag equal discuss tag similar consid weaken notion conform concern document requir tag equal weaken tag similar evalu reli thesauru thesauru refer store main terminolog dag dtd sake simplic refer tree introduc section relat term consid ffl defin term consid morpholog variant acronym term differ spell version singular term plural ffl syn defin term consid synonym term denot categori real world object term translat languag belong relationship affin valu ffi assign terminolog relationship ffi sy ffi denot valu ffi sy ffi typic valu refer ffi ffi sy consid similar match element ffi ad compon evalu captur miss tag equal tag similar handl extend approach dtd element tag level match element tag document match consid lead highest select dtd separ relationship tr consid affect approach subel tag structur element tag synonym tag document match result document visit time document dtd figur synonym match element document match match lead perfect match match fl complex algorithm present section number node document dtd node document node dtd visit node worst oper quadrat number node document perform gener case discuss algorithm exponenti obviou effici match process strict similar requir result algorithm extens discuss implement figur tree document dtd dom librari valid techniqu perform experi gather randomli gener space briefli report experi detail descript experi result found remark lack larg xml gener sourc xml data evalu develop evalu method mention research issu address case start html document extract xml document data sourc relat document web sourc html document describ softwar product featur mean structur extract tool obtain xml document sourc randomli built group xml document group gener dtd describ structur document obtain dtd document dtd figur excerpt document extract sourc dtd develop method outlin synthet data gener mean random gener develop gener document element arbitrarili dublin core element set repres inform resourc order refin mean creator element subel creator dtd subset dublin core element set match document sourc obtain ffl time document valid match algorithm correctli return ffl document pair dtd valid similar experi emerg dtd obtain close similar valu document correspond class belong singl structur cluster previou experi carri fix ff fi fl addit experi carri fix ff match process method evalu structur queri retriev document element dtd document similar equal element requir potenti addit element similar measur rank document base structur similar appli idea rank queri document structur experi develop compar result obtain techniqu valu altern definit function paper measur evalu structur similar document wrt dtd measur classifi document set dtd document highest similar measur structur cluster xml result effect effici search document approach complement ing techniqu obtain set xml document set dtd describ structur work paper extend direct investig feedback inform match algorithm obtain set dtd describ accur structur consid xml document cluster correspond cluster maxim similar minim similar classif sort schema evolut process structur inform sourc ration direct investig integr retriev classic retriev goal express evalu queri filter document structur document content plan investig structur cluster integr cluster techniqu refer denni proc acm intl conf manag page modern inform retriev approach classifi object proc european conf objectori lnc page measur structur similar xml document xml xml inform sigir workshop sigmod march de pernici conceptu schema techniqu applic acm transact sept shim system extract document type descriptor xml document proc acm intl conf manag volum page dublin core initi han wrapper construct system web inform sourc intl confer data page miller lexic english commun nov milo schema match simplifi heterogen data translat proc intl conf larg data page motwani extract schema semistructur data proc acm intl conf manag page yu theori term import autom text analysi journal amer societi inform tverski featur similar journal psycholog document object model extens markup languag match algorithm tabl show notat algorithm handl list tripl tree document function kid return set element children function kid jl return subset children reach edg label tree document function fffi return list tag subel note function fffi appli node return subel independ oper element type declar function fffi return empti set appli tree edg label element denot tree figur figur show algorithm comput similar document dtd figur figur show auxiliari function algorithm function combin result evalu tree label repeat identifi repetit oper function analog previou function tree label oper function descript mn cn cardin posit sort order base function max st max mn cn tabl notat algorithm algorithm dt rp list begin form case correspond termin return return return en ft kid jl begin fl return sort begin max ft jt kid fl return end end return return fl form en return return return form return return form begin hl tn hl return end form return begin max mn return end end figur algorithm function list en list list begin tn return list begin begin case op en end case end list end return end figur algorithm function list en list list begin return rip max tn begin end rip max begin fr ng list st max list list end return end figur algorithm
DB/652 3 schedul queri data technic report center parallel distribut comput januari center parallel distribut comput depart electr comput engin northwestern technolog institut evanston schedul queri data depart electr comput engin northwestern abstract advanc storag technolog made tertiari storag viabl altern data system tertiari storag system emploi case secondari storag satisfi data handl requir tertiari storag cost effect option tertiari storag devic archiv storag applic domain requir retriev data devic paper investig issu optim time queri data resid autom tertiari storag multipl storag devic model problem limit storag parallel schedul problem addit constraint establish upper bound number storag devic optim schedul provid proof queri access small amount data multipl deriv optim schedul analyt queri access larg amount data deriv heurist base schedul algorithm analyt prove result discuss practic aspect theoret result real environ demonstr applic work accur robot tape librari simul introduct advanc storag technolog made tertiari storag viabl altern data system tertiari storag system emploi case secondari storag satisfi data handl requir amount data tertiari storag cost effect option nasa earth observ system data inform system collect terabyt data daili run year larg amount data store secondari storag tertiari storag cost effect secondari found data wareh applic show substanti monetari save achiev hierarch data storag compar small amount secondari storag vast amount tertiari storag save gain sacrif gain perform tertiari storag devic archiv storag applic domain requir retriev data devic applic access slice dataset data belong slice store contigu singl media contrast data archiv applic access larg chunk contigu data data applic li scatter multipl correct schedul data retriev request import queri access data media singl robot arm tape drive total time queri minim tape time read load motiv applic domain tertiari storag access dataset data item occupi uniqu posit queri select subset data item select subset domain dimens wide varieti expect queri store data access queri contigu high amount data replic queri dataset store tertiari access data multipl media answer set queri consist set media id block number insid media time queri determin amount data locat data time read queri data media depend amount data locat data insid media autom tertiari storag robot tape total time queri influenc order media access issu tertiari storag manag address commun evalu issu extend technolog data tertiari storag architectur hierarch storag examin issu queri process data resid tertiari storag data stripe tertiari storag evalu tertiari storag space organ issu address paper investig issu optim time queri data resid autom tertiari storag multipl storag devic model problem limit storag parallel schedul problem addit constraint establish upper bound number storag devic optim schedul provid proof queri access small amount data multipl deriv optim schedul analyt queri access larg amount data deriv heurist base schedul algorithm analyt prove result discuss practic aspect theoret result real environ demonstr applic work accur robot tape librari simul rest paper organ section introduc problem section analyz problem theoret result problem section discuss import practic problem section present perform evalu approach present section background system model system consist robot arm tape drive queri data tape read data tape consist load tape load tape put back load tape fetch tape load tape search read data insid tape oper robot arm rest carri tape drive tape time arm oper denot time drive oper denot consist time put tape fetch tape tape denot consist search read data tape tape drive assum fairli accur estim section discuss practic aspect estim valu problem statement set tape block tape find order tape read minim total time minim problem cast special case schedul problem arm oper denot machin drive oper denot machin job schedul tape data answer queri distinct featur problem contrast tradit schedul multipl instanc machin common system configur singl robot arm servic number tape drive case instanc machin multipl instanc machin buffer bound job shop simultan number tape drive system tape read simultan job start time schedul finish impli machin idl time job schedul machin process job mandatori idl time accommod behavior tertiari storag system drive empti tape unload remain empti robot arm load tape practic prevent schedul algorithm compar valu johnson algorithm optim tradit perform comparison split workload workload section studi behavior system relat workload characterist number machin stage workload base compar valu time job machin machin job job job govern inequ workload defin max deriv upper bound number instanc machin base back proof result result suggest tighter bound number instanc machin exist final result job job number instanc machin system theorem max number instanc machin improv schedul proof trivial job start machin time job start machin earlier min equal job start machin earlier job start time conclud number instanc machin improv schedul valid verifi theorem simul set vari td randomli gener workload job td valu vari workload consist job workload randomli creat distinct instanc type workload averag result instanc rest workload refer set random workload type workload mean averag multipl random instanc workload number instanc machin vari number instanc machin fig plot result curv correspond workload distinct note result job bigger valu td workload higher bigger job curv remain flat number instanc machin exce number instanc machin figur result reveal workload show improv number instanc machin exce suggest scalabl term number instanc base result simul valu number job workload number random instanc type workload differ qualit result present observ hold result random workload present paper hypothesi number instanc machin improv schedul categor job result interest insight problem number robot arm tertiari storag system number tape drive uncommon find singl robot arm servic tape drive number instanc machin equal number robot result machin bottleneck system workload valu equal constrain idl time introduc machin machin busi job kind workload execut time machin bound number instanc machin job workload small job execut time machin larg job workload consist small job small job execut time machin bound repres situat load media drive finish read data media robot arm finish load media drive find robot arm busi time end media irrespect order media load case occur data layout conform access pattern exhibit queri retriev smaller piec data larg number media prove optim schedul schedul job order execut time machin valid result theorem schedul optim proof schedul sort job order time machin optim schedul differ exist job td td job start time irrespect valu job swap affect legal schedul job finish swap reduc td td process continu arriv schedul ident valid experi test effect schedul naiv schedul strategi chang order job number instanc vari set gener random workload set number set workload job workload higher bigger job result shown figur graph consist naiv schedul algorithm schedul algorithm point curv plot schedul gener algorithm workload type naiv schedul workload naiv schedul algorithm size job addit instanc machin schedul gener algorithm maintain scalabl make effici addit instanc machin schedul gener algorithm affect number instanc machin perform higher conclud optim scalabl algorithm workload queri access small amount data tape number instanc machin unoptim figur workload consist big job access larg amount data tape tape machin bottleneck lead elimin idl time machin lead optim schedul lemma schedul optim term idl time machin proof job start machin time irrespect schedul algorithm job schedul time min min note job schedul instanc machin job schedul job schedul immedi job job schedul immedi job instanc machin instanc machin idl long job process schedul necessarili produc optim schedul idl time length head tail schedul determin optim schedul schedul execut machin start produc idl time machin length idl time depend execut time job number instanc machin problem length head independ schedul algorithm machin finish process machin busi requir time finish process job length tail big execut time machin job schedul schedul put job largest machin time result higher length produc suboptim schedul gener algorithm hand produc idl time machin success reduc length tail algorithm put smallest job end schedul reduc tail optim schedul start show schedul job instanc machin lead optim schedul number job equal number instanc machin lemma exist optim schedul schedul job instanc machin proof optim schedul job schedul instanc machin impli instanc machin job schedul entir job schedul idl machin maintain legal schedul job finish origin schedul shorter contradict assumpt origin schedul optim job finish origin schedul schedul equal instanc machin job schedul job schedul schedul equal origin schedul process repeat job schedul instanc machin lemma algorithm schedul job instanc machin proof trivial show produc optim schedul number job equal number instanc machin lemma schedul optim proof exist optim schedul schedul job instanc machin schedul job instanc opt schedul job order optim exist job schedul job time job start hold note job finish job job schedul distinct instanc swap job maintain legal schedul schedul opt repeat applic process transform opt schedul necessarili produc number job exce number instanc machin number drive unoptim number drive unoptim figur lemma schedul suboptim proof prove give counter job number schedul job order schedul order result order job schedul chang turn heurist approach earlier produc schedul optim term idl time machin optim number job equal number instanc machin suggest schedul simultan exhibit properti schedul perform base sort job strategi start end pick instanc job sort place repeat step move start schedul evalu heurist result shown figur estim drive oper time paper assum valu job turn schedul algorithm valu gener schedul hard imposs calcul td accur set block tape read requir accur model tape tape drive manufactur provid perform number number includ search rate read rate valu estim schedul algorithm compar valu make absolut valu denot estim estim number drive unoptim number drive unoptim figur number drive unoptim number drive unoptim figur number drive unoptim number drive unoptim figur number drive unoptim figur forward seek past block seek past block seek start tape extra read block forward seek read block seek tape fetch tape librari load tape tabl analyt model tape drive tape librari dk estim estim dk hold evalu scheme comput estim maximum offset estim tape find offset farthest block read insid tape tape estim maximum offset approxim proport time tape tape drive model section data volum estim tape estim number block read tape approxim proport time read block tape full estim estim method combin estim method estim seek rate maximum offset read rate block read seek rate offset block term estim term estim time read tape term estim time forward seek insid tape search block read experi reveal data volum estim full estim schedul algorithm perform maximum offset estim found schedul algorithm perform equal data volum estim full estim data volum estim schedul algorithm lower comput requir perform evalu describ analyt tape model present result section evalu schedul algorithm synthet workload describ sequoia benchmark evalu schedul algorithm benchmark analyt model tape librari literatur linear approxim locat time tape drive found linear approxim inaccur analyt model tape drive tape librari model logic block size tabl sort algorithm schedul fetch data tape random workload figur show averag perform schedul algorithm set randomli gener workload analyt model tape drive tape librari section tape experi algorithm heurist job schedul limit environ algorithm gener list algorithm schedul job end list figur plot schedul algorithm percent opt opt lower bound optim schedul calcul opt tape data comput time load read tape place back librari opt sum time access tape divid total number drive system note set workload data point figur opt proport number drive system find perform schedul algorithm constant factor opt expect rang number drive function number drive system compar perform find length tail schedul import amount idl time schedul reduc outperform algorithm perform slightli unoptim case number drive system compar higher heurist base algorithm perform due care balanc idl time length tail achiev algorithm perform algorithm approach perform algorithm number drive system low high reason unoptim case perform par algorithm number drive small scope optim case due limit choic schedul algorithm due limit number tape drive number drive number tape load close number drive optim small job optim larg job number instanc machin equal greater number job algorithm outperform number drive system moder note rang valu number commonli found typic data manag system handl larg amount data verif sequoia benchmark evalu techniqu sequoia storag benchmark provid descript relev portion benchmark queri describ workload experi give result descript sequoia benchmark base experi sequoia storag benchmark result present section benchmark separ world nation dataset period slightli year size spatial resolut dataset schema tabl queri creat locat time band data time byte integ denot raster data accumul data set data valu locat attribut specifi bound box raster data repres coordin corner repres integ band specifi wavelength band data valu rang data arrai size point byte integ opt number drive unoptim figur figur show perform schedul algorithm random workload tape drive tape librari section number robot arm dataset dimens dimens raster imag raster imag store chronolog captur raster imag sort order workload descript queri repres access pattern dataset gener multipl access pattern observ typic dataset access pattern execut frequenc order captur defin varieti access pattern dataset creat workload queri manipul number queri workload queri type queri ffl queri type select imag belong band data interest spread entir set tape store dataset ffl queri type select imag belong data interest local tape set tape store dataset queri type actual set queri defin access pattern queri set instanc queri type queri retriev imag belong band instanc queri type workload gener workload gener ffl number queri denot total number queri workload consist number drive heurist workload unoptim number drive heurist workload figur result sequoia storag benchmark ffl queri type percentag repres percentag queri instanc belong queri type number queri determin accuraci workload gener process queri instanc result queri type workload rule queri number distinct queri instanc belong queri type queri type percentag workload queri assur expect number occurr queri instanc queri type evalu ffl workload consist major queri queri type ffl workload equal mix queri queri type queri type perform evalu figur show perform result heurist algorithm algorithm time execut workload algorithm plot percent time naiv scheme schedul result show algorithm perform consist note drive number tape data read queri number drive system prove optim perform equal compar algorithm number drive system algorithm outperform gain perform due balanc optim drive idl time size tail schedul paper investig issu optim time queri data resid autom tertiari storag multipl storag devic model problem limit storag parallel schedul problem addit constraint paper present analyt result provid insight problem present heurist algorithm schedul data tape librari perform result show impress gain synthet real workload refer ling toni ari shoshani effici organ access dataset tertiari storag system inform michael laura livni tape hold challeng tupl tertiari storag acm sigmod intern confer manag page acm ann randi katz stripe larg tape librari supercomput san usa ieee comput societi nasa integr system dissemin earth scienc imageri product technic report space flight juli richard richard watson analysi stripe techniqu robot storag librari fourteenth ieee symposium mass storag page ieee comput societi bruce rajeev avi silberschatz schedul data replic improv tape perform intern confer data page bruce avi silberschatz model perform characterist tape drive acm sigmetr confer measur model comput page bruce avi silberschatz random schedul onlin tertiari storag system acm sigmod intern confer manag page acm bruce avi silberschatz schedul tape retriev sixth nasa goddard confer mass storag system technolog fifteenth ieee mass storag system colleg bill inmon role storag data extend grow infin technic white paper johnson optim product schedul setup time includ naval research logist march ben john architectur design storag data manag nasa earth observ system data inform system fourteenth ieee symposium mass storag page ieee comput societi tertiari storag organ larg dataset technic report center parallel distribut northwestern novemb livni synchron disk tape access acm sigmetr confer measur model comput page elizabeth effici sequenc job eighteenth acm symposium principl page acm olap novemb olap council sunita sarawagi system effici access tertiari memori fourteenth ieee symposium mass storag page ieee comput societi sunita sarawagi queri process tertiari memori intern confer larg data page morgan stonebrak sequoia larg capac object server support global chang research technic report sequoia technic report electron research march sunita sarawagi michael stonebrak reorder queri execut tertiari memori intern confer larg data mumbai page morgan michael stonebrak manag persist object storag acm sigmod intern confer manag colorado page acm
ML/653 6 evolutionari approach rout backbon commun network joshua knowl david corn depart comput uk abstract rout backbon commun network import combinatori problem main rout refer benchmark result dynam rout strategi rout investig emploi quickli find significantli improv rout live network network offer net improv qualiti servic network bandwidth book advanc paper introduc investig number heurist techniqu applic rout problem iter search result present heurist significantli improv search perform consid investig comput time reduc solut simul anneal advantag genet algorithm problem techniqu applic genet algorithm emploi standard crossov oper introduc crossov oper enabl genet algorithm exploit effect problem compar perform genet algorithm emploi crossov oper genet algorithm find perform significantli result heurist simul anneal perform outperform genet algorithm rang problem size difficulti find lead investig local search approach multiobject formul rout problem local search multiobject perform rout problem compar multiobject ea base nich pareto ga find experi import role local search search method address multiobject form problem genet simul telecommun multiobject introduct data transport commun network rout seri sourc data destin call call basi distribut system call rout emploi strategi offer greater opportun path result effici network resourc qualiti servic rout applic call partli collect exist call rout strategi run potenti find rout exist network call current work investig idea context adapt distribut client server base chang access pattern base network commun speed found investig tradeoff speed rout qualiti relev solut possibl chang network short delai context standard telecommun rout rout investig mann smith topic major industri project involv nortel commun plc detail entitl gener fast network simul packag explor impact live network rout involv find set rout tion commun cost congest introduc investig number heurist applic stochast iter search rout begin reduc space path combin techniqu introduc mann smith pair shortest path consid algorithm due yen solut rout problem reduc find set path subset main contribut show mutat oper improv perform problem made emploi achiev order path choic pair select list smaller allel valu gener frequent investig method order path length order shortest path algorithm make heurist estim congest rank combin previou achiev effect method chromosom emploi includ inform instruct interpret gene gene interpret select evolut process chromosom similar flavour employ genotyp consist multipl chromosom domin mechan construct chromosom interpret indic gene posit earli discuss work emploi recent exampl variant dasgupta structur genet algorithm chromosom gene higher tree potenti allel repres leav tree heurist compar standard oper simul anneal evolutionari algorithm heurist improv perform term final solut qualiti qualiti solut found small number iter consid result present multipl run eighteen test problem vari network size traffic level baselin shortest path rout algorithm place perform algorithm context quickli calcul fit candid solut fit knowledg genotyp differ method depend greatli natur fit yield speedup applic base molecular model problem fit base fit mutant posit atom chang calcul fit parent distanc involv singl move atom base chang angl typic lead extens chang harder manag effect major solut slightli chang emploi simul anneal speedup provid degrad sharpli children recombin mutat oper rout problem appli note comput evalu requir simul anneal problem greatli reduc emploi larg problem consid mean solut evalu significantli give simul anneal algorithm major advantag problem domain introduc crossov oper effect problem show oper fast evolut good solut achiev compar ga emploi crossov oper ga verifi util comparison genet algorithm simul emploi simul anneal advantag rout problem result agreement work mann smith investig recast problem multiobject task separ term origin object investig local search retain superior multiobject case local search algorithm multiobject call pareto archiv evolut strategi develop perform problem compar multiobject ea base popular nich pareto ga horn result statist method put forward fonseca fleme multiobject version problem local search advantag rest paper section background telecommun network rout definit problem includ object function evalu solut section approach mann smith rout problem includ descript yen shortest path algorithm heurist emploi underli section incorpor report section introduct descript local search multiobject section outlin method multiobject result present outlin techniqu gener problem section result present section work section background problem definit tradit telephon connect request network attempt assign circuit fix bandwidth sourc destin circuit assign connect durat call caller receiv engag signal access network deni call circuit switch ensur qualiti servic call connect effect circuit disadvantag circuit switch potenti wast network resourc time circuit transmit inform instanc word ordinari potenti effici call packet work split stream inform small packet packet small header indic destin packet rout destin cabl share call inform mean call accept network call space averag circuit switch scheme disadvantag packet switch packet switch network packet arriv switch header read packet output line switch process read header move packet correct output line finit amount time packet arriv switch simultan buffer wait switch free process buffer packet mean variabl delai introduc flow inform sourc destin open possibl packet lost complet buffer finit capac overload problem rout call reduc congest encount rout algorithm packet switch network concern delai packet varianc delai probabl packet loss due link rout call undertaken distribut rout concern rout connect request moment moment basi modern model rout node local congest inform updat rout tabl select node connect rout work slower larg amount data transfer domain advantag network provid user connect book advanc network provid traffic profil find set path traffic mean qualiti servic network provid profit make fewer call turn rout synchron digit hierarchi network data mean rout futur asynchron transfer mode network requir dynam rout advantag rout ensur part plai network manag system futur depend good rout solut found faster set path inform custom book connect network provid stand gain fast load network profit whilst qualiti servic paper rout problem attempt develop simpl heurist appli stochast iter search method reduc number evalu find solut level qualiti adopt problem definit mann smith minor includ object function evalu solut complet telecommun network rout multipl traffic request manner achiev feasibl rout link primari object secondari object link fix target rout assign attempt commun assum cost link network set node set edg edg network singl type rang lie link type capac unit type capac unit distinct amount network rout network traffic rout path determin total edg exce bandwidth achiev deviat long object find minimum cost alloc traffic satisfi constraint cost rout sum pair yield object bear mind bidirect constraint sum pair final object deviat target maximum percentag bandwidth capac link max ae oe long link exist pressur process find balanc solut experi set full final object max ae oe weight appli term evalu function adjust object mann smith report extens test found valu gave feasibl rout strategi valu multiobject version problem approach space feasibl solut rout task larg network larg number call rout enorm small fraction solut meet constraint link requir reduc space search exclud rout predict lead poor solut main object rout call request link network reduc total link usag solut includ extrem long path lead solut meet object longer path lead congest link ultim push link mark path greater rule path creat shortest path approach smith mann basi work present shortest shortest appli cost path hop number cost edg network proport euclidean distanc incid gener short path fewer hop true network gener link span node separ larg gener section shortest path sourc destin reduc search space greatli comput lead simpl solut mann smith length pair approach repres call rout length element element chromosom point element tabl rout refer tabl algorithm due yen yen algorithm requir calcul requir path network consid paper requir upper bound sourc destin path tabl part tabl path creat shortest path algorithm figur typic solut vector end run simul anneal algorithm mate oper pair algorithm work calcul shortest path suitabl success set edg cost path time appli standard shortest path algorithm find path exist path gener shortest requir path length describ heurist appli speed converg qualiti solut achiev step make arrang vector repres list call order bandwidth requir call appli heurist rout call depend posit chromosom figur show typic solut vector end run simul anneal mutat function note solut consist denot shortest path chosen rout call repres element larg allel valu lie extrem remain broadli true problem call rout congest high problem fewer call pertin bia mutat function search algorithm statist likelihood solut observ good scheme vector element exponenti function random variabl form tune paramet function shown figur function effect introduc bia gener low allel valu distribut alter length chromosom strongli gene repres high bandwidth call low bandwidth call link tune paramet bit posit heurist emploi import high bandwidth call rout shortest path contribut congest low bandwidth call rout path point term chromosom gene refer simul anneal genet algorithm solut random variabl figur exponenti function mutat gene congest contribut seek method time appli explicit congest path contribut achiev list shortest path cost distinct congest calcul natur lead high cost long path path includ edg capac cope bandwidth call rank carri shell sort techniqu work slightli shortest cialli term speed problem challeng meet constraint heurist address half rout problem lowest cost congest scheme combin approach bia choic term object doubl chromosom combin scheme weight previou score rank path choic sum weight score method unsatisfactori choic weight made arbitrari path shortest list longer difficult obtain rank measur object approach emploi doubl chromosom solut repres choic path chromosom binari repres interpret chromosom choic shortest path rank congest score rank individu gene interpret choic term shortest path term congest score chromosom inform chromosom subject random mutat case genet recombin chosen process attract style find simul anneal figur doubl top line path choic call bottom line path shortest path rank tabl congest cost rank tabl genet faster evolv good solut earli stage run gener final solut previou doubl chromosom similar ga structur ga gene gene activ paradigm aim improv converg properti ga genet materi gene pool longer extra chromosom wholli reason mean interpret redund genet materi gener path list order congest combin design gener popul subsequ mutat state figur addit member popul gene investig found perform ea improv slightli earli stage run qualiti final solut found affect strategi ea perform initi disregard simul anneal experi discov improv perform simul anneal strategi includ experi carri encod simul anneal solut rout problem order process evalu complet simpl chang evalu result small chang chromosom path singl connect chang procedur perform stage updat link congest penalti updat commun cost equat page stage requir contribut path calcul subtract relev part complet evalu contribut path calcul ad comput involv evalu solut reduc significantli mann smith note simul anneal advantag problem genet algorithm emploi recombin introduc recombin oper retain util recombin great extent state chromosom encod good solut problem consid small number gene allel valu middl top rang find allel mutat requir longer time true mutat approach design recombin oper retain speed allel valu combin retain effici oper select parent cross allel ensur good chanc parent chromosom element valu smallest absolut differ median gene achiev emploi tournament select strategi gene remain reduc surrog gene randomli select part tournament evalu jk gene lowest select ti gene compet tournament broken randomli tournament size size reduc surrog element fewer method gener chromosom gene chang retain effect crossov combin rare allel valu quickli earli stage process recombin oper shown graphic figur section present result indic qualiti solut found speed converg heurist method outlin give paramet set simul anneal genet algorithm figur select gene parent gener offspr parent parent parent reduc surrog tournament select winner break ti offspr multiobject rout heurist previou section found simul local search displai superior perform rout judg weight sum object function section natur cast rout problem multiobject problem exist number nondomin solut trade object defin effect local search origin formul pertin investig effect local search reformul problem multiobject task introduc local search pareto call pareto archiv evolut strategi investig perform task comparison tradit base popular nich pareto genet algorithm descript algorithm detail descript found algorithm design meet specif criteria algorithm strictli confin local search small chang oper move current solut nearbi neighbour criterion algorithm true pareto treat nondomin solut equal satisfi criteria major compar pair solut domin problem overcom maintain archiv found nondomin solut archiv mean estim true domin rank pair solut structur shown figur algorithm begin singl chromosom current evalu multiobject cost function copi made mutat oper appli copi mutat copi evalu form candid solut current candid solut compar accept simpl solut domin case solut candid solut compar refer popul archiv nondomin solut comparison popul archiv fail favour solut tie broken favour solut resid crowd region space gener random current solut evalu add archiv termin search mutat current solut gener candid solut evalu candid solut current candid domin compar candid solut archiv member updat archiv select current solut candid current solut stop figur pareto archiv evolut strategi archiv serv separ store updat nondomin solut readi present end run aid accur select current candid solut vector act approxim current nondomin front select push process find solut algorithm unabl differenti good bad solut result wander search space archiv process similar pool select archiv maximum set user reflect requir number final solut desir candid solut gener domin parent current compar member comparison set domin ad archiv select current solut domin member archiv join archiv member archiv domin remov current solut domin domin member archiv select basi crowd area resid reject resid crowd area phenotyp space current solut resid crowd area phenotyp space current solut select current solut iter join archiv provid archiv full archiv full join membership phenotyp archiv solut crowd region nondomin front select remov multiobject ea denot extens ea origin formul problem base nich pareto ga differ nich pareto ga steadi state replac offspr gener crossov replac worst member popul algorithm emploi doubl chromosom mutat solut comparison multiobject proper comparison result multiobject complex issu discuss issu power fonseca fleme fonseca fleme notion perform statist comparison pareto front achiev algorithm rout problem good appreci comparison method support proper interpret result present section includ descript heart method put forward fonseca fleme call attain surfac dm return algorithm figur illustr algorithm return point pa set nondomin solut found attain da return algorithm line join point da set worst mean solut comparison set domin member comparison set point line notic da divid phenotyp space region point region domin result nondomin point region domin result improv region region improv object figur set nondomin point divid phenotyp space compar pa pb compar surfac da db notion coverag address figur attain surfac drawn set result singl trial run singl trial run suitabl collect line origin sampl pareto frontier region line intersect da point intersect db figur place distant origin line intersect da db da intersect closer origin suitabl collect line cover entir figur sampl pareto frontier line intersect compar algorithm region pareto frontier compar intersect line long comparison surfac return number line da intersect closer origin domin db similar number db notic number line figur region line pick sampl good statist comparison multiobject step simpli note trial run trial run gener surfac find intersect algorithm algorithm defin distanc origin line simpli provid univari distribut statist test distribut intersect usual verdict algorithm region space repres back confid measur gener rout problem order test heurist set rout problem size difficulti rout problem consist network includ specif edg traffic matrix pair connect rout bandwidth requir real wan telecommun network design meet requir node access reliabl regard node link pai regard parsimoni delai constraint exist number link connect lead construct base minimum span tree minimum span tree achiev reliabl extra edg ad ensur node reachabl path node edg fail good chanc traffic accommod random network gener base suboptim minimum span tree construct algorithm due ho edg backbon span tree edg bandwidth traffic distal node set local edg bandwidth unit algorithm begin gener point node backbon network euclidean distanc pair calcul minimum length span tree edg assign bandwidth point gener remain network node algorithm continu node edg bandwidth tree network close edg meet constraint extra edg ad give altern rout node pair add reliabl load network spread reduc origin aim extra edg ad pair node connect ensur continu parsimoni edg length order ensur point make origin backbon network spread evenli plane span width point fall fairli evenli sequenc find mont carlo due node network randomli plane chang condit sequenc gener network random figur show node network gener method larger circl repres node connect bold repres unit bandwidth link smaller circl repres remain connect edg repres unit bandwidth link figur node network gener traffic matrix simpli requir randomli pair assign bandwidth randomli bandwidth requir rang network traffic size gener eighteen problem network traffic matric size traffic matric challeng size slightli traffic rout violat bandwidth constraint link result implement detail basic simul anneal algorithm emploi geometr cool schedul transit accept jg exp jg probabl accept solut current solut respect cost solut control set high initi begin run simul anneal transit occur decrement fewer fewer transit algorithm termin final control paramet choic initi final valu control paramet rate decrement collect cool schedul cool schedul simul anneal algorithm calcul produc upward transit size upward transit size number evalu cool schedul deriv empir perform basic genet algorithm emploi steadi state ga popul size gener crossov mutat carri requir evalu gener ga iter simul anneal algorithm tournament select tournament size select chromosom mutat select parent crossov mutat chromosom replac evalu offspr creat replac worst current member popul mutat oper small chang oper simul anneal appli bit select chromosom probabl length averag bit chang bit mutat replac distribut recombin achiev standard uniform crossov ga reduc surrog singl gene earlier crossov oper appli probabl cross mutat probabl cross cross begin reduc remain termin except ga cross start reduc gener total number solut evalu includ initi popul simul anneal algorithm simul paramet set deriv empir baselin result compar result approach standard shortest path rout algorithm show valid cost algorithm present compar link solut gener shortest path rout genet algorithm emploi congest cost rank inform figur show percentag link node network problem upper histogram produc shortest path algorithm lower histogram produc ga emploi doubl chromosom evalu ga link shortest path algorithm result link link spread load effici cost solut gener shortest path rout gener ga object function qualiti final solut perform algorithm judg cost final solut gener algorithm compar label ffl ga standard ga mutat ffl bia ga ga mutat shorter path ffl con ga ga mutat path congest ffl doubl ga ga doubl chromosom ffl sa standard sa small chang oper ffl bia sa sa small chang oper shorter path link number doubl ga link number shortest path figur link node comparison solut gener genet algorithm shortest path rout ffl con sa sa small chang oper path congest ffl doubl sa sa doubl chromosom ffl init sa sa doubl chromosom solut vector allel gener chromosom begin note run evalu final solut found algorithm ga sa bia ga bia sa con ga con sa doubl ga doubl sa init sa tabl cost solut gener algorithm size network anneal averag percent lower cost genet algorithm problem size type heurist term final solut cost emploi doubl encod congest cost rank tabl present result result run evalu problem network size cost percentag solut found problem perform limit number evalu perform algorithm fewer evalu consid wai algorithm left converg solut measur qualiti solut evolv run method investig algorithm compar situat rout strategi requir urgent algorithm stop prematur tune algorithm converg smaller number evalu measur qualiti final solut shorter run figur show cost solut found point algorithm test algorithm tune run result run node network problem data plot show result typic result gather complet set problem vari size network congest level tabl plot success heurist number evalu requir reach solut level qualiti case simul anneal algorithm genet algorithm doubl chromosom init sa lower cost solut algorithm entir evalu order present summari cost evalu establish rank algorithm number ten level ev rank level ev calcul raw cost repres solut averag eighteen convert percentag cost found problem eighteen cost algorithm level ev compar cost carri pair algorithm number draw loss rank differ greater confid requir evalu ga sa figur converg speed algorithm node network win loss rank calcul entir data set interv evalu evalu result tabl init sa shown effect evolv solut entir evalu result show reach cost cost found averag compar ga standard simul anneal algorithm compar perform init sa doubl ga shorter run run evalu evalu algorithm tune converg number evalu final algorithm ev ga bia ga con ga doubl ga sa bia sa con sa doubl sa init sa tabl rank algorithm respect perform evalu tune converg evalu solut compar number test run carri algorithm find choic paramet shorter run case doubl ga popul size tournament select size adjust select pressur faster converg case init sa cool schedul result present tabl case evalu doubl ga version similar perform init sa version case evalu run singl init sa algorithm case init sa algorithm found perform doubl confirm result solut present result show perform ga figur show delta ga compar doubl ga term cost evalu result plot algorithm varianc doubl ga doubl ga init sa init sa tabl version init sa doubl ga evalu run sixti node rout task doubl ga init sa init sa doubl ga doubl ga init sa tabl version init sa doubl ga evalu run compar requir confid magnitud confid repres confid distribut algorithm row superior distribut algorithm column neg confid true algorithm varianc doubl ga doubl ga init sa tabl version doubl ga singl version init sa evalu run sixti node rout task doubl ga init sa doubl ga doubl ga tabl version doubl ga version init sa evalu run compar requir confid magnitud confid repres confid distribut algorithm row superior distribut algorithm column neg confid true evalu type processor time full sec delta sec tabl processor time shown evalu object function call rout node network time carri mhz sun ultra workstat run delta ga effect standard ga recombin oper cross singl allel parent lead compar fulli evalu ga tabl differ runtim delta ga delta creat initi popul ga requir comput multiobject result result present traffic scenario singl node network paramet set method present result discuss result present local search multiobject paramet set archiv number space grid encourag nich paramet found paramet easi set problem archiv set archiv rare fill run evalu evalu cost figur rel converg speed delta genet algorithm node network set perform algorithm begin tournament select comparison set investig number set popul nich comparison set tournament size found set problem shown popul tournament size comparison set size oe share rang object scale lie emploi steadi state replac worst facil archiv solut final solut present simpli member popul standard reader remind method put forward fonseca fleme process result section import fonseca fleme method line intersect line statist techniqu compar univari form present result find good present result comparison form pair percentag space percentag algorithm found statist superior similar percentag algorithm result percentag space result statist present result form case present result plot median divid surfac algorithm illustr simpli comparison code return algorithm median intersect point line fonseca fleme note unlik simpl plot median surfac easili problem dimens tabl gener greater percentag space found give statist result statist confid level base rank sum test trend perfect sampl superior situat space give result sampl space approxim time place space return result sampl scenario scenario scenario tabl coverag space achiev rout scenario number line intersect vari affect result variat chang number line explain kind situat figur db da line small relat distanc singl line line captur featur eventu result promin deserv greater number sampl region reveal suitabl lead reduct effect result object object object figur combin attain surfac obtain scenario object object object object object object object object object figur median attain surfac obtain scenario object object object object pareto archiv evolut strategi nich pareto evolut algorithm object object figur nondomin surfac obtain singl run scenario method surfac gener algorithm discuss merit drawback point run algorithm separ collect nondomin point plot combin nondomin surfac algorithm scenario plot shown figur import lesson learn statist superior perform combin distribut show combin twenti run found solut underlin danger blindli techniqu isol method emploi twenti surfac gener twenti run algorithm statist intersect line drawn give algorithm median distribut plot algorithm view result plot shown figur scenario plot agreement result statist test present tabl plot surfac li closer origin surfac major cover phenotyp space surfac gener singl run algorithm shown figur techniqu power previou case shed light statist test result present tabl plot show cover phenotyp spread solut larg rang object larg portion surfac li surfac gener result difficult algorithm rout task competit traffic scenario perform traffic load superior summari find rout traffic congest network standard combinatori problem suit method simul anneal genet algorithm paper shown iter search method enhanc mutat function reflect statist distribut allel valu found chromosom lead good solut incorpor addit heurist number iter requir reach solut level qualiti doubl chromosom choic interpret gene found combin separ heurist singl superior heurist method found equal applic simul anneal genet algorithm speed solut evolv solut consid problem domain perform simul anneal search method base small chang oper improv dramat solut genet standard crossov oper advantag larg disrupt genet materi recombin introduc test crossov oper select singl allel parent cross parent produc offspr small chang find crossov oper superior mutat slightli effici uniform crossov combin genet materi earli stage evolut genet algorithm crossov oper evalu solut compar time simul anneal test examin small chang crossov oper compar standard crossov term abil combin genet materi problem mutat allel valu rare except allel valu confer advantag chromosom propag popul speed good solut evolv simul anneal found superior evolutionari term qualiti final solut found aggreg object function multiobject formul result local search found superior rout scenario consid scenario found solut domin found portion space shown local search multiobject competit tradit capabl find set solut futur work elitist found perform problem rout problem investig refer hs compar genet algorithm greedi heurist adapt problem ieee intern confer evolutionari ieee neural network pp improv search genet algorithm genet algorithm simul ed lawrenc erlbaum mp atm principl john wilei son ieee intern confer evolutionari ieee neural network pp dr structur genet model result tr dept comput uk ew note problem graph pj perform assess comparison stochast multiobject parallel problem solv natur hm schwefel parallel problem solv natur ppsn springer lnc volum pp pj overview evolutionari algorithm multiobject comp pp nonstationari function optim genet algorithm domin intern confer genet morgan kaufmann de genet algorithm machin learn de nich pareto genet algorithm multiobject ieee confer evolutionari ieee world congress comput volum ieee servic pp multiobject nich pareto genet algorithm illig report illinoi genet algorithm champaign dw pareto archiv evolut strategi baselin algorithm pareto multiobject accept public congress evolutionari washington juli dw approxim nondomin front pareto archiv evolut strategi submit ieee transact evolutionari march van simul theori applic reidel publish netherland gd comparison heurist telecommun traffic rout publish modern heurist search editor john wilei son rj introduct probabl statist ed intern thomson publish adapt network rout algorithm emploi path genet oper pp ca minimum span tree comput oper research pp ga paramet select autonom manag distribut inform system european confer artifici pp investig evolutionari approach adapt manag qualiti servic metric schwefel parallel problem solv natur pp select breed multiobject genet algorithm parallel problem solv natur intern confer eiben springer bp numer recip art scientif comput copyright cambridg press uniform crossov genet algorithm proc int conf genet pp comput network jy find shortest path network manag scienc juli jj introductori discret mathemat john wilei son genet algorithm preserv popul ga manner parallel problem solv natur pp
DB/654 3 optim object queri effect calculu fegara depart comput scienc engin texa arlington yate po box tx david maier depart comput scienc engin oregon graduat institut scienc technolog nw walker road po box abstract provid power data abstract model facil gener lack suitabl framework queri process optim kei factor oodb system successfulli compet relat system meet perform requir applic develop effect queri optim effect framework solid theoret basi optim oodb queri languag call monoid captur featur odmg oql good basi express optim algorithm paper concentr queri optim improv perform treat properli oodb system framework gener unnest techniqu recent literatur capabl remov form queri nest simpl effici algorithm simplic method due monoid calculu intermedi form oodb queri monoid calculu treat oper multipl collect quantifi similar result uniform unnest type nest introduct reason commerci success relat system offer good perform busi due sophist queri process optim techniqu applic requir advanc data structur express oper provid relat model major approach address applic extend relat model objectori add capabl program languag oodb provid power data abstract model facil lack suitabl framework queri process optim earli oodb system lack declar languag associ access data simpl pointer chase perform object leav opportun optim number commerci oodb system support queri languag interfac line oodb call support declar object queri call oql kei factor oodb system successfulli compet relat system meet perform requir applic develop effect queri optim aspect oodb queri optim problem benefit proven relat technolog kei featur oodb languag present difficult problem adequ address technolog featur includ object subtyp type larg multimedia multipl collect arbitrari nest nest queri express effect framework solid theoret basi optim oodb queri languag chosen concentr oql languag close resembl queri languag oodbm chose oql main reason essenti oodb compani commit support oql interfac system term small easier languag featur show object queri languag relat handl oql full work wide applic queri languag oql queri framework translat calculu format serv intermedi translat version nest relat algebra calculu algebra intermedi form calculu close resembl current oodb languag easi put canon algebra directli translat execut algorithm support system calculu call monoid calculu demonstr calculu captur featur oql good basi express optim algorithm base gener templat data captur collect aggreg oper relat monoid similar set notat applic type set give uniform express queri simultan deal collect type natur mirror queri nest oql express permit easi integr function subexpress demonstr express power calculu show map major featur oql monoid calculu show paper monoid calculu amen effici evalu give initi evid exhibit simpl normal system put express canon form main contribut paper descript framework optim monoid focu import optim queri unnest call queri gener solut method gener unnest techniqu recent literatur framework capabl remov form queri nest simpl effici algorithm simplic method due monoid calculu intermedi form oodb queri monoid calculu treat oper multipl collect quantifi similar result uniform unnest type nest unnest algorithm translat queri depend context subqueri translat translat form final unnest queri properti make sound complet algorithm easi prove unnest algorithm easi easili adapt handl relat queri paper organ section describ monoid calculu section translat oql queri monoid section describ simpl normal algorithm unnest simpl form nest requir group section extens basic framework allevi restrict idempot oper captur advanc list arrai section describ version algebra support handl null valu semant oper term monoid calculu section present transform rule unnest oodb queri section report prototyp implement queri optim section compar work relat work section list extens improv framework plan investig futur monoid calculu recent includ support multipl collect arrai approach defin languag frequent fail provid concret semant join list set result type semant queri multipl collect answer question form theori gener collect type oper natur theori captur differ collect type inconsist abstract similar abstract common semant deriv framework treat collect uniformli simpl extens languag primari focu framework bulk manipul collect type bulk oper sourc express basi effici execut list set semant properti make list exchang element set insert set element set chang set properti hold list formal set list construct properti set list constructor construct set union number singleton set construct set construct list append singleton list construct list list append associ commut idempot commut idempot properti make set list set list constructor ident empti set fg ident empti list ident terminolog abstract commut idempot monoid primit integ repres monoid possibl choic monoid integ monoid boolean monoid appar monoid oper choic monoid depend interpret primit type queri call monoid primit type primit monoid contrast primit collect set parametr type captur homogen collect object type ag exampl collect type call monoid collect type collect monoid collect monoid unit function element type input construct singleton collect type list unit function element construct singleton list list construct list monoid empti list list unit list append type repres queri framework map monoid monoid map call monoid homomorph monoid homomorph list set framework captur oper form list function element return set monoid homomorph perform result foreach result result return replac singleton list list gener result set monoid homomorph captur comput list divid list oper monoid homomorph set convert unambigu list nondetermin semant restrict pure syntact framework depend static properti monoid involv commut idempot properti queri result homomorph monoid homomorph form bulk manipul collect type support framework monoid homomorph express small subset monoid homomorph set captur nest relat algebra set extens oper shown captur nest relat algebra monoid homomorph algebra captur oper multipl collect join list bag return predic aggreg existenti predic set monoid homomorph set monoid boolean monoid sum element monoid homomorph list monoid numer monoid defin calculu call monoid captur oper involv multipl collect type declar form monoid defin term monoid monoid homomorph express monoid program express calculu easier understand manipul algebra form monoid resembl tupl relat queri variabl rang multipl collect output collect type monoid join list bag return set set tag merg function monoid add integ express return sum list element greater equal rest section formal definit monoid monoid oper monoid definit monoid type pair associ function type left ident type definit denot type binari function valu type input return type function call merg function call element monoid element satisfi monoid commut monoid idempot monoid monoid reason discuss section commut commut idempot monoid merg function uniqu identifi merg function monoid notat repres type monoid merg function tabl present exampl monoid column monoid commut idempot monoid monoid tag tag idempot captur vector present section monoid tabl call primit monoid construct valu primit type monoid tabl captur collect type type int int int max ci bool ci bool true ci primit monoid type fg fag ci collect monoid tabl exampl monoid linear list addit union call collect monoid collect monoid addit definit unit merg construct valu monoid type unit function set monoid express denot function set unit function input construct singleton set fxg output collect monoid tripl correspond parametr type ff type paramet bound type includ collect type shorthand ng repres construct collect monoid shorthand fe gg list defin map monoid set ig commut idempot partial order monoid defin commut commut commut idempot monoid homomorph defin algebra input output monoid main oper give formal semant monoid discuss section monoid calculu defin term monoid definit homomorph collect monoid monoid defin induct terminolog abstract free monoid natur transform ident functor satisfi map properti uniqu properti ff uniqu function definit ffi function call homomorph extens interest reader refer book pierc formal treatment monoid monoid homomorph collect type type function express replac definit list comput set fx fa condit definit import collect monoid commut idempot bag cardin function express similar function set commut restrict tannen al restrict prohibit set list definit justifi restrict monoid monoid monoid satisfi true arbitrari monoid observ gener theorem theorem monoid homomorph preserv properti prove valid monoid valid instanc idempot commut handl similar mean true impli idempot idempot impli necessarili conflict exampl monoid map function element set comput cartesian product set select element set satisfi predic monoid queri calculu express term monoid monoid monoid form merg function call accumul express call head term term sequenc call ffl gener form rang variabl express gener construct ffl filter pred predic monoid defin term monoid definit monoid primit collect monoid defin induct collect monoid express possibl ae collect monoid primit monoid pred monoid output collect express infer type rule section main definit give semant monoid suggest implement monoid effect translat effici physic show section note translat homomorph gener monoid commut idempot accumul commut idempot monoid condit check commut idempot properti monoid explicitli monoid defin section relat join repres directli join set join predic function construct output set element element record ad rule definit translat algebra form fh ig evalu resembl nest show section similar effect translat join join collect type equal info gi xg similar nest oper nest bit gener output form depend join collect gener depend element relat depend join conveni nest collect exampl xg xg maxf xg xg xg xg express add element monoid express count number occurr bag recal monoid commut collect type theorem monoid monoid homomorph express power definit express term monoid homomorph prove monoid homomorph express term monoid prove equat collect monoid primit equat monoid calculu treatment queri type definit monoid type class refer primit int parametr ha record monoid type null null constant variabl record project ha record construct statement op op primit function abstract function applic element singleton construct merg figur monoid calculu monoid type freeli nest oodb schema set potenti mutual class definit class definit class class type extent extent type monoid type extent option collect instanc class wai access instanc class extent persist variabl persist variabl part oodb schema defin var type initi oodb schema languag class person person class hotel int class citi place string var citi citi persist variabl monoid calculu consist number syntact form oper monoid type syntact form construct complic term combin syntact form express detect term assign uniqu type type set type rule present monoid calculu type rule calculu definit monoid calculu consist syntact form figur term monoid monoid qualifi form hname hl oe type constant oe null ff oe oe tn oe oe oe en tn oe oe oe oe oe oe oe oe oe collect monoid oe oe oe primit monoid oe oe oe collect monoid oe oe oe oe primit monoid oe oe collect monoid oe oe oe oe oe oe figur type rule monoid calculu previou oodb valid express calculu return hotel arlington room bed citi bag return hotel citi result bag type variabl hl rang result bag type hl variabl rang type hotel captur existenti return true room shorthand repres bind variabl mean construct reduct express substitut free occurr shorthand pair record yi syntact pattern place lambda rang variabl bind function program languag pattern variabl tupl consist pattern pattern compil standard pattern decomposit techniqu figur type rule term monoid calculu figur variabl start attribut start repres term ff type start repres type notat oe term assign type substitut oe type equat numer denomin consequ equat tupl type ha type ith compon tupl substitut list oe bind variabl type return bind oe extend oe bind equat annot annot omit exampl infer context case equat type assumpt type type function equat check valid test note type term type int tabl type correct translat oql monoid calculu oql express direct translat monoid except index oql collect section present monoid index collect syntax captur complex vector arrai illustr translat main construct oql monoid calculu oql statement select xn pred translat xn pred note pred nest support capabl oql nest queri nest oql select hl citi hl express syntax hl oql statement translat set similar queri previou oodb schema find hotel arlington interest place select distinct hname visit queri translat hname oql oper form simplest form group oper partit collect partit function combin valu creat partit element map valu form translat ha partit gi oql queri group citi partit citi gener form group bm um part form list number function um perform group form translat ha bm um partit gg queri partit set hotel price rang rang rang base averag room report averag price hotel group hotel result set price price rang averag price queri price rang avg price tabl translat oql express monoid intersect pred pred exist pred pred oql queri find hotel arlington room select distinct hname hl citi hl exist queri express syntax hname hl restrict monoid relat idempot commut monoid involv turn limit translat oql select statement return set explicit function collect calculu program normal monoid calculu put canon form effici rewrit call normal algorithm evalu canon form gener produc fewer intermedi data structur initi unnorm program normal algorithm improv program perform case gener optim techniqu relat push select join fuse select select normal perform provid good start point figur normal rule rule appli gener domain possibl empti sequenc gener normal valu gener variabl rule flatten nest gener domain rule unnest existenti quantif case queri handl section advantag normal algorithm calculu express express shown correctli preserv mean prove rewrit transform correct theorem normal rule figur mean preserv beta reduct ha commut empti commut empti idempot primit monoid figur normal algorithm proof sketch theorem appendix plan show futur rewrit system termin confluent satisfi matter sequenc rule appli result canon form end rule requir variabl renam avoid conflict gener gener variabl renam renam variabl normal rule filter predic conjunct nest oql select distinct rb distinct sd express monoid calculu sd normal sd rule oql select distinct sd rb present section find hotel arlington room hname hl queri normal hname hname rule path identifi bound identifi persist class express attribut record commut gener domain normal path monoid put canon assum predic push end form conjunct pred vn pred path proof statement easi easi previou form canon form normal normal rule reduc gener path domain gener monoid form domain reduc simpler form normal algorithm appar form form normal leav form path normal algorithm unnest type nest queri rule import normal improv perform term queri term normal perform comput normal form origin term case occur frequent lazi function languag function applic evalu beta reduct implement naiv term repeat comput avoid situat evalu languag graph reduct techniqu occurr share term point memori form acycl graph term reduc term replac avoid comput appli techniqu normal normal form repeat evalu pointer copi term graph reduct naiv cost function normal improv cost necessarili true realist cost function physic algorithm assum size set reach path size averag set cost function assum naiv ae collect rough estim size select predic cost equat assum graph comput join cost cost function satisfi cost prove normal rule improv cost rule ae ae select predic cost normal algorithm unnest form nest form queri unnest queri exampl set unnest normal algorithm comput set result iter outer set quantif aggreg unnest normal algorithm case type ja nest queri requir group treat properli section model extens handl inconsist due idempot section show homomorph idempot set semant inconsist result reason monoid homomorph comput set impli equat valid count element common correct equat observ gener monoid equat definit function defin ae idempot collect theorem fw fw fw hold similar proof hold idempot primit addit rule normal algorithm modifi ae commut note altern commut commut idempot normal equal advanc list oper primit monoid list function composit function defin equat ffi associ commut idempot type ffi ff primit monoid list equal ffi ffi ffi comput list element function composit monoid offer enorm express power list oper function propag state list iter element list counter state propag iter complex sort element list total order list form list fold list captur list primit defin simpl syntact restrict appli list primit function polynomi time space express power gain function composit monoid high cost form difficult normal unnest vector arrai vector arrai import collect type scientif applic contrast collect obviou monoid captur vector effect vector oper provid random access index bulk manipul effect form vector describ monoid captur vector manipul vector comput vector size function xg anticip monoid vector note access index vector order access gener access pair unspecifi element set retriev gener construct element vector mean store element posit result vector vector element access bulk fashion pair vector construct random fashion store place problem valu store place perform merg oper vector solut merg vector element individu element store place result vector comput merg element adopt valu overwrit previou valu formal observ introduc collect monoid repres vector type vector type repres type specifi partial map posit integ vector valu type monoid unit function function languag function unari function appli xy vector element merg vector element result union element index monoid idempot commut integ index compon pair int kei vector merg reflect common knowledg vector assign overwrit vector monoid provid mean vector suggest vector implement set correspond vector set merg set correspond vector construct set correspond exampl vector manipul make repres pair form sum xg ng return vector return vector return product vector matrix repres vector syntax bit xg function map function element matrix matrix vector head vector vector approach matric monoid type index type equal simpl int actual type index infer compil time exampl matrix oper shorthand xg xg return row matrix return column gener matrix multipl gener index function haskel approach vector adopt vector index gener integ domain access intuit matrix tile matrix partit tile tile replac sum valu optim vector arrai oper normal oql treat arrai list provid conveni random bulk provid vector oql extend syntact construct support vector express syntax select vector intermedi object algebra section express term homomorph homomorph implement iter evalu fashion gener translat nest case research relat queri optim address relat problem effici evalu join queri join access path join algorithm effect adapt technolog handl express term algebra map physic execut found system merg hash section describ framework translat term calculu effici algorithm translat stage queri framework translat monoid section serv intermedi translat version nest relat algebra support algebra term translat execut plan algebra call intermedi object algebra calculu algebra intermedi form calculu close resembl current oodb languag easi algebra directli translat execut algorithm support system prove oe path gg path gg figur semant intermedi algebra oper algebra algebra oper express term monoid calculu term calculu translat algebra form import result queri process conveni notat semant algebra defin commut idempot gener commut gener figur defin algebra oper term monoid calculu oper gener oper nest relat algebra choic algebra oper target queri unnest algorithm section straightforward ffl join collect join predic join necessarili list equat output bag ffl oe select element satisfi predic ffl path return collect pair satisfi predic ffl collect satisfi accumul ffl left join predic domain gener gener equat empti element join condit test domain singleton null qualifi element join ffl path path empti pair output ffl combin function nest relat function reduc equat nest oper function valu set equal imag group group group reduc accumul pair result reduct group return function null convert group input consist pair depart convert null es empti set result nest set pair associ depart set section present rule translat form monoid calculu effici algebra form queri unnest oper oper queri unnest intermedi algebra express power monoid calculu translat intermedi algebra translat algebra form algebra form displai oper tree tree leav collect object class output tree root output algebra form previou algebra form oper function algebra form understood interpret stream tupl flow leav root tree algebra form gener stream tupl type extent variabl rang type unnest accept stream tupl type construct stream tupl type person connect children reduc top algebra gener relat evalu express input element construct set tupl queri unnest recent oodb queri optim unnest nest queri queri nest oodb queri relat oodb queri languag complex express point queri oodb type nest lead natur nest queri current oodb system typic evalu nest queri leav opportun optim unnest techniqu oodb queri base similar techniqu relat queri trivial nest techniqu requir prevent loss accumul data remov null valu introduc consid queri unnest result perform improv make choic evalu nest queri naiv step outer step queri execut queri unnest promot oper queri oper outer queri oper mix optim techniqu rearrang oper minim cost free movement select predic outer enabl oper select earli unnest techniqu transform sql due lack oper relat algebra express group absenc formal theori form algebra express transform result number bug count bug eventu detect correct oodb queri complex relat crucial express unnest transform formal algebra prove sound complet transform work goal mind cluet moerkott cover case includ nest aggreg valid transform section describ queri unnest algorithm subset monoid calculu idempot monoid freeli nest form unnest algorithm extend previou work wai complet framework capabl remov form nest unnest algorithm easier understand implement earlier due monoid calculu intermedi form oodb queri monoid calculu treat oper multipl collect quantifi similar result uniform unnest type nest form nest queri unnest normal algorithm monoid remain form requir depart true transcript student tid sid true true student true true tid sid transcript true true figur algebra form oodb queri introduct group algorithm requir rewrit rule unnest queri handl normal algorithm exampl unnest oodb queri unnest nest calculu queri depart return depart nest inher queri avoid combin group shown figur nest group input rang variabl construct set es set rang variabl nest oper read stream tupl type gener stream tupl type join nest figur left predic depart result join null rang variabl null nest oper convert null empti set introduc null nest oper convert null interest express express calculu queri true captur existenti check written algebra form queri unnest shown figur match null nest oper convert null element reduct root test ms true equal challeng queri comput number children older oldest child manag algebra form queri shown figur introduc rang unnest set set pad null nest pair top nest oper group input stream gener number children note oper algebra assign predic predic top nest restrict input data nest oper group input stream tupl evalu predic extend output stream attribut bound conjunct predic find student predic pattern queri true algebra form queri shown figur queri evalu effici switch shown figur result assign equal make effici optim justifi queri unnest queri unnest method figur show unnest algorithm unnest queri normal translat algebra form consist regular root algebra form translat straightforward outermost output result input stream dash box figur repres outer queri shade box reduct repres nest queri algebra form insid input stream output input stream stream tupl oper form output result form dash box figur repres quantifi accumul input box input stream reduct box stream box predic reduct output true student true transcript tid sid true true transcript student tid sid true true figur unnest queri box predic reduct box existenti quantif accumul translat box unnest algorithm box correspond nest queri box current convert reduct join unnest emb result box point immedi box reduct box output box result innermost form box immedi output box simpl explan algorithm correct formal proof appendix nest queri repres box consum input stream oper comput queri splice box stream queri thing box block input stream remov tupl stream condit achiev convert join unnest extend stream box reduct box manipul convert reduct box main differ nest reduc reduc return reduct stream nest emb input stream nest oper convert null valu stream output splice box splice import detail omit present describ unnest algorithm detail import null convert convert null cs nest oper final unnest form figur nest convert null ts nest convert null cs true differ extra paramet nest oper shown unnest algorithm work idempot outer nest bag list approach work correctli nest capabl reconstruct input stream extend depend gener figur rule translat unnest rule due bag extract correct number duplic extend stream queri unnest choic evalu list join correctli bag queri unnest import set plan extend method unnest bag queri futur queri unnest algorithm queri unnest algorithm express figur term set rewrit rule assum queri put canon form vn pred algorithm appli gener domain reduc path predic collect pred set true predic translat monoid accomplish translat compil qualifi left term seed grow step term algebra tree deriv point compil variabl variabl encount translat variabl convert nest null situat variabl compil outermost nest rule compil outermost rule compil rule actual unnest includ necessarili monoid rule step unnest outermost gener extent seed select notat specifi part predic refer rest predic denot satisfi decomposit push predic oper rule rule gener compil rule convert gener extent join split predic refer refer rest predic note predic assign unnest detail predic split part section present unnest algorithm oper form rule compil gener path domain unnest rule appli similar rule differ reduct join left unnest notat variabl variabl attribut group attribut convert rule perform actual unnest figur box result translat outer rule unnest nest predic appli earli immedi gener affect free variabl depend gener variabl rule unnest nest head unnest perform gener outer reduc queri compil true true true true rule ignor select true rule mi true true handl rule mi true true translat unnest mi true true mi true true mi true mi true algebra form shown figur figur pseudo code present unnest rule figur oper function call correspond translat term algebra form term data structur repres calculu algebra term pattern binari tree structur repres empti pattern variabl pair pattern central program function split term pattern pattern return tripl term term conjunct simpl predic hold simpl predic refer pattern variabl hold predic refer pattern variabl left hold rest predic note predic refer pattern variabl left predic assign oper previou step simpl predic queri assign order unnest line figur check rule appli case outermost predic depend rang variabl gener case appli empti line implement side rule notat copi term creat substitut variabl line check rule appli line appli rule rule rule depend line appli term term pattern pattern term outermost subterm depend pattern return pattern find outermost term term found return return return split return oe variabl return return variabl return return figur queri unnest algorithm gener path variabl line captur rule easili prove unnest algorithm figur theorem rule figur unnest nest place find nest queri predic head case handl rule rule eventu appli unnest nest queri predic worst appli gener outer compil sound unnest algorithm consequ theorem rule figur mean preserv proof theorem appendix corollari illustr valid theorem appli rule figur queri hd prove algebra form origin tool proof oper definit figur normal algorithm rule figur algebra form equal hd mi hd mi gg hd gi hd gi gg normal hd gi hd gi hd gi term remov gener contribut result work idempot safe remov gener final form hd origin simplif larg class nest queri improv unnest sql queri find total salari depart older cz aa bm bm cz aa figur simplif select distinct group queri nest translat monoid calculu fact unnest algorithm gener algebra form figur prefer form figur effici simplif easili accomplish transform rang variabl materi view handl form uncorrel nest queri hc gi translat view hc oper creat materi view case uncorrel nest queri handl global view requir special treatment framework queri ha ha gi unnest algorithm gener algebra form shown figur easi task optim transform algebra form form shown figur pull oper number queri queri unnest figur perform improv queri unnest perform evalu evalu perform queri unnest algorithm program produc perform result report fix number benchmark research evalu perform random schema random queri good indic effect unnest algorithm concentr fix infinit wai nest oql queri gener random consid object tupl element type set compon tupl random type perform gener schema random type gener random queri schema gener queri constrain cartesian product permit queri graph connect queri normal goal experi test unnest algorithm queri normal random queri gener maximum number gener maximum number depend gener gener domain depend variabl maximum number gener maximum number set cardin pose limit nest level queri optim perform translat algebra oper push predic queri implicitli algorithm figur queri predic outer queri promot insid queri cost improv gain queri unnest predic move freeli outer queri expect improv result optim consid join permut simplic naiv cost function algebra cost function join figur present result experi number relat estim cost result run queri test queri queri compar cost queri plan queri unnest permit queri plan queri unnest permit figur present scale cost cost queri plan unnest cost queri plan unnest scale cost improv point figur repres averag experi cost improv exponenti number due larg number cartesian product produc translat queri unnest predic outer queri promot implement built prototyp oql optim base framework paper detail oql optim express power optim specif call implement flexibl optim call extend earlier work optim gener languag queri optim captur larg portion optim specif inform declar manner extend number term manipul construct rule languag queri transform preprocessor map specif execut code oql optim proce type oql translat calculu check type error form nest queri unnest normal algorithm gener domain reduc simpl path translat intermedi algebra form queri translat intermedi algebra nest section materi path path object refer translat join extent dereferenc object physic plan phase consid access path physic algorithm gener plan plan select execut oql optim line code produc code line normal line normal predic line queri unnest algorithm line materi path express line algebra optim permut line translat algebra form physic plan rest optim code support function properti oql optim produc physic plan evalu plan connect shore object manag system sourc code manual oql optim relat work object queri algebra contrast algebra support multipl bulk oper demonstr express power monoid homomorph support small number oper highli bulk oper algebra transform rule harder optim task framework base monoid introduc effect captur queri al form monoid homomorph call structur union present express oper requir valid idempot properti monoid output oper properti hard check compil make oper impract recogn special case condit automat oper collect monoid inconsist program detect form oper captur complic queri optim normal algorithm form gener form put canon express captur oper involv collect type express predic aggreg monoid express subset inconsist detect compil program put canon form monad introduc wadler gener list monoid relat monad express monoid mix input collect type return output type mix monad restrict input output type monad conveni languag wadler present algebra transform form method convert join monad syntax adopt al altern syntax monoid homomorph syntax captur oper involv collect structur express rest oper convert collect type normal algorithm influenc wong work normal monad present power rule flatten nest canon form gener simpl path canon form canon form monoid work address queri unnest complex queri queri part predic unnest group number recent oodb queri optim handl nest collect convert path express join unnest nest queri handl encapsul method queri unnest algorithm influenc work cluet moerkott cover case nest includ nest aggreg valid transform work extend al includ quantif work rewrit system complet work consid algebra equal form unnest work lin ozsoyoglu address nest queri nest oql queri approach translat gener path express express power captur group translat ineffici begin due larg number redund optim phase exist path express translat join redund elimin proof provid show unnest method avoid redund form gener qualiti plan unnest techniqu proof correct complet method issu address techniqu turn effect practic work queri unnest goal zdonik contrast automat theorem prover prove sound unnest rewrit rule theorem prover highli desir extens make queri optim flexibl theorem optim requir valid form formal proof time algebra oper rewrit rule introduc futur work basic framework queri unnest issu plan address futur research import queri unnest presenc method problem handl method invoc queri case handl effect unnest framework problem method bodi queri number handl case break encapsul unfold method bodi place call approach appli method support separ compil requir queri recompil method approach attach optim rule class requir substanti effort programm approach method view materi tabl memoiz program plan investig approach fit unnest algorithm futur work queri plan extend unnest algorithm support vector fundament difficulti prevent easi group capabl reconstruct input stream extend collect type idempot obviou extract correct number duplic extend stream develop formal framework optim queri presenc side effect queri object updat place form languag extens monoid calculu express featur formal mean extens method base denot give formal mean imper program languag semant languag extens express term monoid fundament chang basic framework initi result suggest method maintain referenti queri practic optim oodb queri optim techniqu appli regular queri minim oodb queri present uniform calculu base captur advanc featur found modern oodb languag demonstr calculu easi manipul present normal algorithm unnest form nest main contribut paper present effect framework optim oodb queri queri framework translat algebra reflect relat dbm physic algorithm algorithm translat calculu algebra unnest form queri nest report implement queri optim base power optim specif framework work support part nation scienc foundat grant refer cook polynomi time annual acm symposium theori british page kanellaki build stori morgan august collect object vldb page august beeri algebra optim queri languag intern confer page decemb lnc wong syntax sigmod march naqvi structur queri languag intern workshop program bulk type persist page morgan kaufmann august wong natur queri languag intern confer page octob lnc logic comput aspect program intern colloquium languag page juli lnc cattel object morgan cluet delobel gener framework optim queri intern confer manag san page june carei dewitt object decad vldb septemb shore persist applic acm sigmod intern confer manag page optim queri quantif vldb page septemb cluet moerkott effici evalu aggreg bulk type technic aachen octob technic report cluet moerkott nest queri object base intern workshop program septemb colbi algebra queri optim nest relat intern confer manag page chan object queri notat twelfth british confer unit page morgan kaufmann juli lnc zdonik chang transform optim acm sigmod intern confer manag june zdonik infer function semant optim queri vldb york august deux stori acm transact knowledg data march queri optim overview ieee data eng june valduriez data intens applic acm transact knowledg data februari fegara effici optim iter queri fourth intern workshop program york page workshop august fegara optim oql texa arlington technic report fegara optim queri object updat submit special issu function approach intellig inform juli fegara queri unnest acm sigmod intern confer manag june extend version fegara maier effect calculu object queri languag acm sigmod intern confer manag san page queri optim reflect framework deduct page decemb lnc wong optim nest sql queri revisit acmsigmod intern confer manag san page kim optim nest queri acm transact septemb kemper moerkott advanc queri process object base access support relat sixteenth intern confer larg page morgan kaufmann august stratifi function program comput complex twentieth acm symposium principl program south page januari zdonik data model algebra fourth intern workshop program york page workshop august wong queri languag optim techniqu acm sigmod intern confer manag page lin ozsoyoglu process oodb queri intern confer inform knowledg manag novemb ozsoyoglu complet solut reduc oodb nest queri improv unnest algorithm join aggreg sql queri proc intl conf larg data page august maier call order acm symposium principl page ozsoyoglu wang kei method nest relat manag system proc ieee intern confer data februari pierc basic categori theori comput scientist mit simon peyton jone implement function program languag languag tabl inform optim nest queri complex object model advanc technolog edbt page lnc price access path select relat manag system intern confer manag page queri notat dbpl intern workshop program bulk type persist page morgan kaufmann august wadler improv list queri page novemb wadler comprehend monad acm symposium lisp function page june wong normal form conserv properti queri languag collect type acm symposium principl page wong queri nest collect phd march pennsylvania technic report irc report proof theorem theorem normal rule figur mean preserv prove correct rule difficult rule similar proof rule proof rule assum correct circular rule prove refer rule defin sequenc qualifi term pred equat collect monoid note function valu function term calculu sequenc qualifi term input return term output easili prove equat definit prove induct number gener structur induct domain gener gener equat true qualifi move predic end gener assum equat true gener prove collect monoid fi fi fi fi fi side equat equal fi fi rule rule induct hypothesi fi rule conflict assum equat true prove fi fi rule rule induct hypothesi fi rule left part rule equat theorem rule figur satisfi ug equat renam variabl prime variabl comparison notic equat restrict equal outer gener safe remov prove equat structur induct assum subterm term satisfi theorem prove term satisfi theorem induct basi term subterm rule figur mean translat term express term translat subterm structur induct follow pattern rule figur prove theorem rule proof rule similar proof rule rule equat proof rule rule hypothesi fv eq normal proof rule rule equat ug proof rule rule ug hypothesi equat ug ug normal ug null ug ug equal true contribut result work idempot rule rule hypothesi hypothesi normal rule ug hypothesi ug hypothesi ug normal corollari rule figur mean preserv corollari consequ eq theorem
Agents/655 1 australian artifici intellig institut la street melbourn victoria australia telephon unifi view plan recip technic note anand rao australian artifici intellig institut paper contemporari action theori editor tuomela kluwer academ abstract plan recip abstract plan mental attitud guid agent plan process enthusiast embrac philosoph ai plai central role class ration call agent dual view plan effici recogn plan coordin action achiev joint intent member larger collect final recogn collect plan intent team start simpl notion execut plan discuss oper semant progress extend notion plan recognit joint execut joint recognit plan primari contribut paper provid integr view plan facilit individu collect plan recognit introduct reason action plan activ area research artifici intellig classic plan deal reach desir state affair current state chain set plan oper base ffl static world world chang plan ffl infinit resourc world agent plan faster rate world leav plan ffl agent complet inform ffl agent aid thwart plan past coupl restrict assumpt relax focu shift classic plan situat reactiv plan reactiv plan relax assumpt lead develop architectur techniqu interleav synthesi execut plan guid agent process limit resourc techniqu agent commit late stai commit long ration bound call ration agent view comput entiti situat dynam act fulfil desir react chang situat continu receiv perceptu input chang environ base exhibit reactiv behaviour perform action import subclass agent view intent agent refer agent plan plai import role agent plan abstract structur recip achiev state plan complex mental attitud intertwin complex web relationship mental attitud belief desir plan recip guid agent search space solut classic plan plan mental attitud constrain agent futur commit call intent assumpt explicitli address system distribut problem solv research aspect assumpt address plan recognit research techniqu infer plan mental state agent studi recent dual view recip abstract mental impact build system capabl coordin collabor infer mental state agent environ plan recip mental guid constrain recognit agent intent plan introduc earlier call reactiv recognit restrict form reactiv call recognit studi paper type recognit integr reactiv plan capabl team agent notion plan recip plan mental attitud collect agent joint introduc work integr recognit aspect discuss earlier bring relat unifi framework reactiv plan call execut plan plan adopt singl agent call execut intent plan reactiv recognit call recognit plan plan adopt singl agent call recognit intent execut plan extend call joint execut plan intent joint execut intent joint recognit plan joint recognit intent type plan describ syntax abstract structur plan oper semant oper semant deal complet intent extend languag agentspeak introduc address syntax semant plan simplest view abstract implement distribut reason system dmar execut plan proce detail execut worth examin class agent architectur mind agent architectur agent consist attitud intent attitud belief plan repres inform state captur declar state agent environ includ captur procedur achiev desir belief condit attitud desir intent captur motiv state agent major process oper reason involv agent process perceptu input extern motiv input agent gener option agent option instanti plan applic current situat process decid current agent commit intend achiev variant theori process process place background set current intent intent captur state past elimin option consid reject constrain process place involv agent current intent light option gener opportun infer agent chang desir process result reconsid intent surviv replac option notion recip abstract structur mental attitud intent crucial process bdi agent rest notion plan describ oper semant execut plan introduc languag write plan agent alphabet formal languag consist function predic action punctuat symbol standard definit close free bound occurr variabl definit predic term belief atom belief atom negat refer belief liter ground belief atom call base belief belief belief belief atom negat refer belief liter ground belief atom call base belief adjac lane car lane move lane north south wast paper lane robot pick wast paper place bin robot lane run risk run car write execut plan robot agent program requir negat ground evalu convent variabl written constant belief agent repres configur lane locat bin base belief agent ground instanc belief atom goal state system agent bring achiev goal type goal test goal test formula true belief mainten goal maintain state wait goal wait state achiev scope paper achiev written state agent achiev state true belief clear road wast state achiev definit predic term goal agent acquir goal notic chang trigger addit delet goal belief refer event trigger event trigger event addit denot oper delet denot oper definit belief atom trigger event agent observ base observ execut action action chang state environ move action robot move lane lane written action action result state robot lane longer lane definit action symbol execut action definit goal action collect refer simpl activ type complex activ activ activ consist set achiev goal complex activ succe achiev goal succe activ similar succe member succe note achiev goal scope arbitrari sequenc activ abstract achiev goal activ definit activ defin ffl simpl activ ffl simpl activ ffl activ sequenc activ agent plan mean agent satisfi end plan consist head bodi head plan consist trigger event separ trigger event specifi plan addit delet belief goal context plan specifi belief hold agent set base plan trigger bodi plan sequenc activ definit plan definit trigger belief activ plan write express left arrow refer head plan express arrow refer bodi plan express colon head plan refer context rewrit empti bodi empti context express true discuss desir goal view adopt desir robot goal clear road plan illustr number plan emploi robot context plan conjunct locat bodi plan sequenc achiev goal locat pick locat drop plan written plan robot chang locat acquir goal move locat locat bodi true context desir locat find adjac lane car move lane true oper execut plan agent consist set base set set set set select agent notic chang environ extern user system adopt trigger event gener event correspond extern event agent gener intern event intern asynchron ad set event select function select event process set event event remov unifi trigger event plan set plan trigger event unifi call relev plan unifi call relev unifi relev unifi appli context condit correct answer substitut obtain context logic consequ set base plan call applic plan option composit relev unifi correct answer substitut call applic unifi event applic plan option select function plan appli applic unifi chosen option yield intend mean respond trigger event intent tree partial instanti plan goal case extern event intend mean creat ad set intent case intern event exist intent expand applic plan select function select leaf intent execut agent execut execut goal action bodi chosen leaf intent tree execut achiev goal gener intern event add goal current intent execut action result action ad set action agent receiv success action event event queue action remov bodi plan process continu end plan reach action goal fail end plan activ successfulli execut plan success event gener success plan result goal success event gener achiev goal trigger plan process continu root node succe fail process continu event runnabl intent formal process state agent instant time formal defin definit agent tupl set set base set set set action select function select event set select function select option applic plan definit set applic select intent set leaf node intent set defin straightforward describ set definit set set intent intent tree root trigger event result creation child root partial instanti plan variabl instanti achiev goal definit set consist event event tupl trigger event leaf node intent true event call extern intern event formal defin notion relev applic plan unifi trigger event set unifi trigger event plan set gener unifi unifi event call relev unifi definit ffl ji plan relev plan respect event ffl iff exist gener unifi oe doe oe call relev unifi ffl relev plan applic exist substitut relev unifi appli logic consequ set base belief context condit relev plan logic consequ applic plan definit plan denot applic plan respect event ffl iff exist relev unifi oe ffl exist substitut logic consequ composit refer applic unifi ffl refer correct answer substitut creation execut intent extern event form agent achiev goal event process result creation intent intent repres tree root tree end agent reach achiev children end altern mean achiev end mean achiev end applic plan trigger event match trigger event extern event discuss type trigger addit delet goal belief semant intent creation defin definit execut applic plan respect applic unifi respect event ffl event ffl result creation intent child figur execut intent intent execut time futur actual time execut intent depend event select intent select execut intent execut children intent tree child partial instanti execut bodi plan requir execut activ bodi figur show intent tree robot achiev goal clear road root tree trigger event result adopt intent applic plan mean achiev goal expand tree root node node partial instanti plan applic unifi appli plan execut achiev goal case activ bodi plan execut achiev goal execut achiev goal involv gener event add achiev goal current intent write execut achiev goal definit achiev intent tree jth leaf form gener event ji execut type follow thread execut agent process event event result agent expand intent tree event jth leaf ith intent expand applic plan match definit expand exist definit execut applic plan respect applic unifi respect event ffl ji result intent child back robot execut leaf node intent execut achiev goal result gener event intent tree node shown figur figur show event node applic plan achiev goal execut action activ bodi plan action execut action involv gener event add action action queue write execut action definit intent tree jth leaf form add ji action queue step agent physic execut action effector result action convei agent action success event action failur event action success event receiv action remov bind reflect rest action failur event receiv plan fail result plan failur event gener definit success ffl ji intent tree jth leaf form replac gener unifi definit failur ffl ji intent tree jth leaf form gener event hn ji figur show execut move action action action queue robot receiv success action event event queue process robot result replac node node activ bodi node execut result applic plan ad child node execut activ activ bodi plan activ execut activ involv spawn multipl end end execut true activ differ due wai process result execut write execut achiev goal definit intent tree jth leaf form hn execut result intent child gener event similar definit hold activ goal expand applic plan satisfi goal execut plan final gener plan success plan failur turn gener goal success goal failur event case goal success success goal fail definit goal success ji intent jth leaf form hn gener event ji gener event ji case goal succe execut fail definit goal success ji intent jth leaf form hn gener event ji gener event ji success result tree composit unifi appli rest remov bodi sequenc activ execut definit activ intent tree jth leaf form children event ji result children remov jth node replac similar definit appli failur activ result failur plan gener plan failur event case bodi plan activ successfulli execut plan success event gener applic plan fail goal failur event gener applic plan succe goal success event case give definit hope reader clear understand oper semant execut plan gener goal plan success illustr robot execut node plan node succe result plan success event gener result node remov goal requir applic plan succe goal success event gener goal result plan success event gener event process node remov goal success event gener event process result creation node shown success goal remov action pick wast execut process continu till goal success goal failur event gener root node intent recognit plan case reactiv extend notion plan recip recognit plan oper observ execut primit action recogn achiev goal notion plan agent result intent recognit recognit intent execut recognit intent lead agent recogn achiev belief agent environ recognit plan plai role execut plan reactiv guid agent search space explan classic recognit recognit intent plai similar role execut intent constrain recognit process commit made ration term action event observ integr reactiv plan recognit execut plan determin recognit recognit determin execut plan integr system base import agent correct complet knowledg plan fulfil agent correct complet knowledg plan agent situat agent small set plan recognit execut recogn total number plan small plan specif situat small number recognit plan introduc oper recognit plan observ primit action denot recognit goal denot case execut agent execut action achiev agent argument simpl activ implicit case agent ff execut action achiev goal agent ff observ execut ff achiev goal ff requir alphabet agent constant agent variabl extend previou definit execut action achiev goal recognit achiev goal recognit simpl activ bodi trigger event mean agent receiv event achiev goal agent redefin notion simpl activ trigger event previou section definit predic action ff ff term short denot ffl belief ffl achiev goal recognit ffl execut action observ ffl trigger ffl achiev recognit execut observ action refer simpl activ definit complex activ plan remain trigger event plan addit delet achiev goal addit delet recognit goal refer execut plan recognit plan type bodi plan execut recognit execut observ action robot wash wast locat earlier clear road cheaper robot plan depend situat call dirti road execut plan dirti road bodi plan requir robot clear road locat drop wast recognit plan observ robot wash wast wast addit execut plan recognit plan true true true true true true true figur recognit intent oper recognit plan definit agent extend observ queue denot set agent system set agent tupl earlier note set plan includ execut plan recognit set intent includ intent tree root achiev goal execut achiev goal recognit select function oper execut observ entiti make architectur uniform agent mental state agent arriv model agent behaviour action goal incomplet inform agent commun execut action observ action order fulfil goal extend execut model collabor reason creation recognit intent creation recognit intent creation execut intent extern event form event queue agent ff intent tree root recognit goal children applic recognit plan creat event receiv agent ff applic plan recognit intent creat agent agent accomplish goal execut recognit goal execut intent involv execut activ bodi applic plan form leav intent tree activ achiev goal recognit achiev add event achiev goal achiev process event result intent tree applic plan achiev goal achiev goal execut observ action activ bodi applic plan leaf intent tree observ agent ff observ execut action agent ff execut observ action result action ad observ queue definit intent tree jth leaf form add ji observ queue case execut action agent physic execut action effector case agent physic observ action perform respect agent result observ convei agent action success event action failur event main differ execut action observ action time action execut action observ action depend execut action agent agent wait indefinit make observ practic implement drop agent commit observ action success event receiv observ action remov bind reflect rest action failur event receiv plan fail result plan failur event gener definit success ffl ji agent ff intent tree jth leaf form replac gener unifi definit failur ffl ji agent ff intent tree jth leaf form hn gener event hn ji execut complex activ recognit plan intent expand activ node event achiev goal achiev goal gener process success failur complex activ primari differ execut recognit manifest behaviour select function case execut goal select function select applic plan applic plan satisfi achiev goal agent achiev goal agent intend applic plan potenti achiev goal agent execut recognit goal select function return applic recognit plan earlier robot goal creat mess road figur show event goal root node applic plan creat child node root node robot execut leaf node gener event achiev goal clear road robot applic plan achiev goal ad children node robot observ primit action wast wash wast success observ result recognit achiev goal base recognit robot carri action creat mess road illustr agent combin recognit execut plan enrich reason capabl joint execut plan plan abstract structur previou section assum belong singl agent consist activ meant perform agent plan abstract structur adopt extern intern desir individu intent extend execut plan joint execut plan belong number agent consist activ perform number agent act team joint execut plan adopt agent form joint intent intent collect cooper achiev joint goal collect react extern chang extend languag discuss earlier joint execut plan multipl agent oper semant extend languag joint execut plan earlier definit team extend alphabet includ team team variabl team set agent team definit team hierarch team modifi syntax goal joint goal introduc team variabl joint achiev written state exist team achiev state true belief trigger event appropri modifi includ joint achiev goal joint action written denot team execut joint action agent commun agent send receiv messag result addit type simpl activ commun activ model commun activ extend alphabet includ messag symbol messag symbol term messag goal messag receiv direct messag captur sourc destin team messag send messag team team written receipt messag written messag trigger event addit messag receiv note make delet assum messag messag queue agent control messag reflect common softwar world definit plan express due introduct team variabl action extend earlier robot collabor car coordin action car occupi lane robot drop wast middl lane oper joint execut plan extend notion agent messag queue outgo messag incom messag directli event queue introduc select function select team list team creat joint intent situat agent ff form team jointli achiev goal extern event form case individu plan agent receiv extern adopt execut case joint plan agent form team adopt make team joint execut make team joint plan paper assum agent select function select team execut goal team agent ensur team form joint intent execut goal involv commun member team perform joint goal singl step creat intent evalu applic plan process step send messag case system defin adopt joint goal express definit goal event receiv agent ff ffl fff ff result messag ad messag queue ff ff agent team accept subsequ messag agent adopt joint goal model commit protocol step joint goal adopt team definit acknowledg adopt joint event receiv agent ff ff agent ff ffl send messag team member ff ff ffl creat intent ff ffl send messag team member ff ff applic plan joint goal applic unifi process continu team member send acknowledg back agent ff send repli agent ff ff adopt plan agent ff form intent child joint plan achiev joint goal messag receiv team member form ident joint intent extend singl agent plan model multipl agent adopt joint goal form joint intent similar mechan emploi extend intent execut joint joint complex activ bodi joint plan argument joint goal joint action agent direct mechan earlier intern event extern messag result team member satisfi plan failur messag agent team singl agent case failur trigger altern joint recognit plan clear reader extend recognit plan discuss earlier joint recognit plan syntax agent argument recognit goal observ action replac team team variabl trigger event addit delet achiev joint achiev recognit joint recognit goal bodi plan extend includ type simpl activ oper semant extend adopt joint recognit intent occur manner adopt joint execut commit protocol team adopt joint recognit joint recognit plan agent execut part success fail inform result lead infer agent team environ extend view mental recognit mental state coordin action achiev joint goal collabor recognit agent action goal present formal languag oper semant enabl reason type plan recip joint joint recognit type plan mental attitud execut recognit joint execut joint recognit intent success execut plan execut intent substanti class problem domain manag space shuttl diagnosi manag model earli trial recognit plan joint execut plan model offer hope unifi view plan substanti impact design system dual view plan limit class problem environ chang rapidli suffici knowledg resid human expert encod plan refer allen perrault analyz intent utter artifici bratman practic reason harvard pollack plan practic reason comput burmeist cooper guid intent percept werner decentr ai north holland cohen levesqu intent choic commit artifici georgeff lanski procedur knowledg ieee special issu knowledg volum page mp georgeff plan annual palo haddawi hank issu symbol goal numer util darpa workshop innov approach rao architectur reason system control ieee kautz circumscript theori plan recognit intent commun mit werner plan team activ fourth european workshop model autonom agent maamaw australian artifici intellig institut technic note nune act eighth nation confer artifici intellig page litman allen process plan intent commun mit magnu ljungberg andrew luca oasi manag system pacif rim intern confer artifici pollack plan complex mental attitud intent commun mit murrai execut team tactic air combat model adam australian joint confer artifici page world novemb rao plan theori reactiv recognit fourth intern confer principl knowledg reason rao bdi agent speak comput languag walter van de veld john agent break seventh european workshop model autonom agent volum springer rao georgeff asymmetri thesi problem linear time branch time intent logic twelfth intern joint confer artifici intellig rao georgeff model ration agent intern confer principl knowledg reason morgan kaufmann san rao georgeff abstract architectur ration agent intern confer principl knowledg reason morgan kaufmann san rao murrai mental state recognit applic model intern distribut artifici intellig workshop aaai technic report russel subramanian provabl ralph comput learn nec research symposium siam tuomela miller philosoph
DB/656 3 make ldap activ case studi provid telecom integr enhanc servic robert daniel joann ordil bell mountain murrai nj abstract ldap directori access directori rapidli deploi web store data white page user network devic descript directori offer number advantag current technolog provid support heterogen scalabl lack basic function crucial directori enabl network task provis network alloc manag offer mobil user custom featur follow order address limit simplic perform featur ldap portabl solut paper discuss ldap limit face build ldap integr data legaci telecom trigger access portabl gatewai add activ function ldap overcom limit kei activ data directori enabl network lightweight directori access protocol lightweight trigger access process portabl telecom introduct motiv ldap directori access directori rapidli deploi web store data white page user network devic descript compar current ldap directori support handl scale heterogen lack support standard function trigger concurr control hamper sophist directori enabl network servic den enabl technolog wide varieti includ manag offer mobil user custom featur follow technolog limit ldap directori frequent effort equip softwar vendor standard ldap schema support directori enabl network den standard singl logic sourc inform encourag storag data standard format enabl ad innov part lucent den built system integr data multipl devic user inform modifi directori ldap protocol directli legaci defin fl voic messag system order prevent data updat system reflect appropri system hire inform ad varieti devic made automat provid unifi interfac data store telecom greatli simplifi access reduc manual data multipl reduc data inconsist repositori order provid requir directori server trigger identifi relev directori updat time manner poll discov updat resourc requir updat identif reduc discoveri larg amount work area standard ldap schema provid crucial area support trigger standard challeng solut portabl work ldap effici exist approach add trigger function directori server requir ffl modif system intern ad trigger system associ directori ffl knowledg proprietari log ffl period poll state trigger access gatewai add activ function ldap server requir method add activ function ldap requir proprietari extens kei advantag improv portabl advantag user trigger function pai ad overhead replica ldap directori describ experi ldap limit approach overcom paper organ section overview ldap protocol section describ architectur section describ gatewai function extend base trigger section summar experi build implic gatewai approach ad miss function ldap experi kei lesson learn paper valuabl build similar system section relat futur work section ldap directori access overview ldap wide deploi directori access protocol implement larg number vendor refer partial ldap thought simpl queri updat protocol ldap benefici deal ietf ldap extens work standard ldap trigger persist search group suppli continu poll state effici persist search provid attract platform implement trigger fire updat execut persist search build trigger fire updat execut download person oid superior top requir cn figur definit person heterogen highli distribut data manag data conceptu unifi ldap server typic fix schema start time directori entri tupl relat type call entri multipl type ad delet entri run time person class figur person inherit top class note field person sn cn common option attribut string special kind tel assign type check perform assign system compar tel compar expect consid equal common case insensit string compar case attribut person multipl directori entri store tree forest figur typic simplifi remov attribut entri entri tree identifi distinguish path root tree entri dn produc concaten rel distinguish entri path entri set creation time consist attribut pair complic collect pair connect oper entri uniqu children parent entri figur assum pair figur dn john doe note order unix file url updat command creat delet singl leaf node modifi singl node kind modif command modifi field chang pair individu updat command group updat command larger atom unit atom chang person telephon number part person telephon number addit provid limit updat ldap queri facil base structur tree queri dn base search start entri type field separ schema attribut type doe lu smith studi group figur sampl ldap tree queri type differ ffl queri base scope examin entri dn base scope queri dn examin lucent record examin record constrain pass discuss ffl queri scope examin entri children entri dn scope queri examin entri entri level tree ffl queri scope examin entri root dn queri examin entri tree figur entri john user constrain examin entri queri return similar sql queri filter elimin organ lucent person elimin peopl begin pat filter gener limit examin field singl entri user constrain attribut return featur analog sql select telecom great deal corpor data buri network devic data network hard access modifi data devic intern administ proprietari interfac standard protocol proprietari schema data multipl devic applic corpor directori provis manual partial replic devic format data hard great deal involv perform updat risk inconsist devic system part lucent den initi integr data multipl devic user inform modifi directori ldap protocol directli legaci devic order prevent data updat system reflect appropri system messag platform defin ldap filter ldap server mp filter filter updat updat updat updat manag directori trigger figur architectur maintain consist pose data integr perform system trigger extrem weak type transact support infrastructur solv provid featur lock catch ldap updat filter provid consist give overview applic enabl detail descript reader refer architectur featur prototyp integr user data legaci defin fl messag platform shown figur implement user data modifi wai data modifi ldap directori materi data legaci devic user continu modifi telecommun devic directli exist proprietari interfac offer multipl path modifi paramet crucial telecommun devic preserv experi base administr reliabl avail system updat made directli devic directori inaccess figur show compon updat manag central compon system ensur data devic ldap server consist note consist matter appli updat data repositori global transact repositori lack basic transact techniqu ensur repositori converg valu delai techniqu includ updat repositori ensur serializ recoveri catastroph commun storag error repositori maintain consist repositori requir semant data properli reflect repositori filter wrapper repositori messag platform filter ldap depict figur filter protocol convert commun repositori mapper translat updat command schema repositori schema translat integr mapper realiz semant characterist data simplifi data integr data depend propag data global devic partit constraint translat schema updat correctli rout proper repositori repositori legaci devic ldap directori notifi um chang occur modul add activ function ldap server notifi um data ldap directori main thread um respond updat synchron request propag updat command filter mapper compon filter analyz request ensur updat properli forward data repositori shown figur integr administr applic singl point administr telecom devic worth point ldap tool ldap enabl web contact administ telecom devic trigger lock gatewai ldap server accept ldap messag return standard ldap repli ldap server perform queri request determin request relev trigger request relev simpli forward ldap perform requir trigger process action integr schema extend standard class describ peopl auxiliari class repres devic specif inform materi view integr inform store ldap server trigger attach portion schema repres data share ensur notifi relev data lock capabl provid section depict figur updat request origin devic translat ldap command updat global schema ldap server forward ldap filter mp ldap server lack lock translat updat entri lock updat forward um lock updat devic ensur proper serial order detail descript function section applic enabl modif set ldap tool varieti gui interfac ldap commerci ldap product easili gener intuit web interfac author easili redirect telephon extens port room highli train worth point devic directori temporarili converg common base order appli um applic inform updat person possess workspac telecom resourc hotel call interact poorli caller lead caller identifi uninform descript map extens port easili chang tool assign workspac fix map ldap tool find person requir proprietari tool make phone light phone develop servic statu includ demo interop portabl advantag demonstr prepar demo chang directori brand easili lucent announc product technolog directori synchron technolog press control defin fl ldap directori technolog transit commerci gatewai standard model trigger fire directori entri read written oper user event condit action perform event occur condit hold user instanti java trigger object regist system event monitor progress ldap event set trigger ldap modifi ldap delet condit satisfi entri affect oper condit affect entri type involv modif attribut action implement send messag trigger action server inform trigger oper fire trigger ta handl action user provid applic ad function program shell section detail give illustr basic trigger featur full detail found user manual base trigger section notifi person entri delet illustr creation execut trigger modif alert similar featur requir add delet trigger creation trigger creation involv defin trigger action trigger action server defin trigger trigger action action string machin contact integ port number paramet ta construct trigger figur paramet ffl specifi trigger kei trigger trigger frequent offic share pool workspac reserv workspac offic trigger trigger modifi trigger fire trigger fire return modifi execut action trigger base type trigger person entri figur trigger definit monitor read lu directori entri ffl specifi ldap case trigger fire paramet combin defin event ffl specifi trigger fire place relationship ldap oper action execut modifi attempt paramet trigger fire ldap oper successfulli complet oper fail ffl fourth specifi action execut event occur condit hold ffl specifi ldap search scope search scope portion object trigger event monitor entri return ldap search scope paramet dn sixth ffl sixth dn paramet paramet combin sixth trigger fire modif person entri figur illustr mandatori part event action condit option list field ldap filter trigger specifi trigger action execut field monitor list involv ldap command fire explicitli list field modifi construct trigger monitor field mention map filter filter convert ldap field devic control section detail addit prevent trigger fire uninterest field serv secur function fire trigger trigger writer author read monitor field involv oper part ldap constrain trigger fire object satisfi object attribut trigger fire search request trigger writer root filter return entri continu care modif person entri field set add optim system rule person creat telecom access servic ad list field includ trigger notif messag abil access valu field valu ta interest field default inform field modifi valu order properli updat control devic add construct instal trigger gatewai includ handl creat updat manag connect trigger process step figur perform basic trigger process time discuss user manual describ trigger facil failur case server trigger action server trigger action server ldap client ldap command send forward request trigger receiv trigger return return updat read trigger send trigger messag return proce stop indic trigger messag proce read perform updat read return send return figur interact trigger process receiv ldap command user entri read trigger inform trigger note instanti cach trigger entireti main memori process read inform requir process match pass relev inform ta simplic figur similar comment appli exist note trigger creator requir author reason requir detail section secur previou work trigger return valu ffl instruct execut command receiv step ffl instruct execut return failur ffl instruct execut return success updat view origin command execut underli send fail ta rewrit updat issu rewritten updat rewritten updat ta return discuss section ta return step return failur return success execut ldap command receiv step read updat inform trigger creator inform author trigger execut author trigger return statu ldap command receiv step note ldap command failur chang step step execut fail trigger author execut return result receiv step lock write lock requir protect integr updat directori entri trigger process entri progress prevent ldap updat command arriv step figur write lock acquir lock held trigger step figur read request ignor lock write singl entri read intern consist standard ldap read depend lock facil maintain consist directori telecom devic user afford oper block due lock support lock turn configur file trigger action server support version trigger action contact port ta ta execut code contact ta return trigger request ta simpli return proce indic simpl ta program easili updat return proce tailor defin function class user compil ta start machin trigger ta number item includ messag author field trigger invoc ta request field packag store happen note updat trigger creator arrai valu field ldap detail descript valu ffl affect action illeg trigger ffl affect action illeg trigger ffl affect action action attribut add delet exist modifi attribut content attribut delet attribut modifi note illeg trigger addit valu affect field messag ffl distinguish affect directori entri trigger fire ffl valu member creat trigger fire correspond paramet trigger constructor ffl structur login password user action trigger fire inform fill trigger written server configur start time deliv inform inform provid case rewrit preserv secur author request ta pretend request execut rewritten command note send inform turn configur file ta instanti task regard process trigger action servic request write member function provid server code incom servic request request server call member function return return call server call return proce call complet fail server code pick proce arbitrarili send back synchron gatewai ta handl trigger figur construct defin figur reformat imag intern reformat imag creat command updat messag ldap return log error return figur ta code updat experi section discuss past futur extens base experi build describ trick develop exploit interact conclud section discuss gatewai model provid advanc function directori extens persist connect synchron featur synchron synchron initi load data devic global integr ensur consist devic catastroph failur occur order provid synchron synchron request ldap devic devic share data ldap server devic consist synchron request thought sequenc individu set updat appli updat concurr requir modif ffl origin singl updat connect ta differenti synchron request individu persist connect ad sequenc updat ffl order synchron request execut updat disallow synchron request process support facil ad monitor field origin construct provid construct combin function current system user insist separ reduc amount work process trigger applic notif field chang suffici person telephon number applic person distinct monitor field field ship ta made distinct import reason field chang handl chang rewrit lose part updat modifi descript field um alert field rewrit ldap semant updat preserv auxiliari class ad exist object practic explicitli list field field belong entri ship ta return valu develop discov support return valu trigger action server updat proce origin valu adequ server approv reject oper implement simplifi updat devic deal failur ldap command easili deal fail state devic updat ldap command lead garbag collect problem exploit featur handl anomali rewrit updat ta return valu led unanticip benefit origin ldap updat trigger event approv underli devic chang determin devic accept updat attempt updat oper syntact semant accept reject arriv crucial resourc unavail devic oper ldap updat command trigger reject enabl rewrit ldap updat appli origin ldap command rewritten lu sn chang cn chang ldap enforc simpl oper rewrit um rewrit oper devic return inform reflect directori entri mailbox creat messag platform id gener mp id ldap mp pass id um rewrit origin ldap command set field ldap directori um send rewritten ldap command ldap directori directli um return return reduc number trigger origin design anticip user set trigger type highest lattic modif field belong type ta turn applic differenti field monitor field includ trigger notif section develop notic advantag fact updat interest updat person entri updat field belong auxiliari class hung modifi entri includ person type place trigger high class hierarchi advantag trigger field whatsoev person interest trigger delet person singl trigger handl alert part system paper extens requir trigger sort class addit field mention field cn implicitli chang chang sn section form trigger extrem similar section trigger interest monitor set field field um differ uniform paramet trigger constructor modifi field specifi trigger add result realiz add trigger type futur version initi decid receiv access kei updat devic kei updat devic attribut distinguish ldap object kei kei updat target devic kei modifi requir move user constraint process determin object modifi resid target devic compar determin produc updat target attribut chang time valu sourc attribut chang creat valu target attribut creat composit target attribut multipl sourc attribut composit attribut contribut sourc attribut chang creat composit attribut requir valu sourc chang unchang field offer extend ldap function gatewai gatewai add function ldap directori repositori speak standard valid experi gatewai offer portabl advantag prepar demo interop chang directori brand easili reli proprietari trigger port harder advantag gatewai approach make collect applic piec function pai exist function simpler applic suit directli directori gatewai techniqu replic materi view stronger secur techniqu built gatewai present provid ensur direct path directori gatewai hand trust server attract similar idea provid simpl mechan built creat special messag gatewai transact begin end treat interven request step inform undon oper return support gener transact model underli repositori commit support relat work detail gatewai focu system benefit system relat previou work data integr data view unlik paper experi build featur exploit extens netscap directori work close relat directori oper trigger similar structur associ action time immedi perform ldap command run function call directori server perform avail problem microsoft cisco plan add trigger capabl activ directori capabl exist trigger capabl ldap product support ldap viabl choic trigger techniqu user specifi event pattern interest system condit check action event detect condit hold system perform action novelti work support fail cope weak transact proxi provid trigger support previou techniqu ad trigger detect event ad event detect core code signal system add eca trigger corba environ event wrapper data sourc write special data wrapper data advantag standard vocabulari ldap requir support arbitrari ldap data sourc recent ldap trigger suggest persist queri queri stai activ find modifi ldap directori match search condit persist correspond trigger mechan scalabl problem maintain open connect persist queri trigger process requir open connect persist build tool provid gener trigger scalabl tool provid subset function tool elimin scalabl singl connect tool requir fail trigger support tool alert success modif place tool provid valu copi directori limit make harder write applic tool work extend ldap advantag technolog aim ad queri languag ldap share aim move techniqu deal trigger queri architectur librari version similar add flexibl list manag ldap queri ldap locat client librari ldap directori librari trigger provid ldap queri updat librari trigger process pass command ldap directori gatewai interfac code convert gatewai approach futur work trigger basic function ldap server support applic directori enabl network task lack standard trigger facil barrier progress user begin ldap task provis network alloc manag offer mobil user custom featur follow current ldap server lack trigger facil provid proprietari trigger tation gatewai portabl add trigger ldap telecom integr project alert lock facil provid valuabl glue combin project defin fl messag platform integr packag result platform support telecom applic section experi gain function unanticip wai solv problem extend experi kei lesson learn paper valuabl build similar system base gatewai technolog good choic provid facil directori portabl incorpor project find enhanc system extend function integr telecom product technolog transit commerci suggest explor den area qian ye build test valuabl comment mike hector venkatesh colleagu project luke tucker andi liao provid java ldap parser replac ldap parser michigan refer lieuwen trigger gatewai ldap directori ja fw effici updat materi view proc page build integr activ design proc data page march ceri widom deriv product rule increment view mainten proc page kim composit event activ context detect proc page august olga srivastava ldap directori cach proc combin activ time constraint sigmod march terri epidem algorithm replic mainten proc acm symp principl page august telecommun submit widom tsimmi approach data model languag journal intellig inform proc persist simpl ldap chang notif mechan griffin libkin increment mainten view duplic proc page directori enabl network ad hoc work group smith program applic lightweight directori access protocol macmillan technic ldap world implement survei vista queri network directori proc vista flexibl list manag directori proc kramer configur event trigger servic system proc intern distribut object comput novemb jj ordil queri heterogen inform sourc sourc descript proc page gehani trigger gatewai ldap directori submit od activ trigger semant implement proc data page lucent ordil system technic bell laboratori lucent qian wiederhold increment recomput activ relat express ieee tran knowledg data septemb kerschberg mediat approxim support materi view journal intellig inf hong design postgr rule system proc data page trigger search control kill lightweight directori access protocol decemb lindsai implement product rule extens starburst proc page septemb
DB/657 3 textur featur imag retriev robert haralick intellig system laboratori depart electr engin washington wa abstract paper present featur extract method method retriev imag section user input imag featur varianc grai level statist constitut histogram angl intersect line ratio grai level insid region span angl method involv associ pair imag class gaussian classifi nearest neighbor classifi protocol translat frame imag automat defin pair imag relev class irrelev class discuss experi grai scale imag imag pair show classifi assign imag pair relev class correctli actual retriev accuraci greater lower bound introduct recent year imag retriev receiv attent due advanc comput storag world wide web imag retriev scenario address begin queri express imag user input imag section imag desir retriev imag section user input imag textur import characterist classifi recogn object copyright ieee publish ieee workshop access imag video page june santa california scene research textur find similar imag discuss textur featur extract method repres imag retriev textur defin statist distribut spatial depend grai level properti varianc grai level matric extract inform consist haralick al matric classifi aerial satellit imag compar studi show grai level spatial depend power method method spatial relationship line properti surround motiv fact line content imag repres textur imag easi comput textur histogram method assumpt imag line content introduc protocol automat construct imag pair evalu perform algorithm discuss paper organ textur featur discuss section method similar measur section experi result present section discuss section featur extract varianc grai level spatial depend defin textur statist distribut spatial relationship grai level properti textur distribut slightli fine textur distribut rapidli distanc inform summar grai level matric matric rel frequenc neighbor pixel separ distanc orient occur grai level grai level result matric symmetr normal divid entri matrix number neighbor pixel comput matrix order inform grai level matric haralick defin statist measur distanc orient result larg number comput matric extract featur imag retriev applic requir fast comput decid varianc differ moment measur contrast imag rosenfeld call featur moment inertia larg imag larg amount local variat grai level smaller imag uniform grai level distribut comput featur ffi ffi ffi ffi orient constitut featur vector detail work found statist experi type imag show strongest spatial featur imag relationship line segment imag roughli repres line extract featur imag process offlin edg edg line select oper line group oper detect line pair goal line select oper perform hypothesi test elimin line differ grai level distribut goal line group oper find intersect line featur pair intersect line segment consist angl line ratio grai level insid region span angl grai level region region convent figur featur extract imag form space angl ratio featur space partit fix set space cell featur vector vector compon number pair fall cell pair intersect line region calcul figur exampl region convent calcul light dark shade region show region form textur histogram detail work found goal find section relev input imag divid overlap protocol discuss section textur featur comput method decid imag relev retriev relev result queri experi type likelihood ratio approach gaussian nearest neighbor rule base approach likelihood ratio likelihood ratio defin relev class irrelev class featur vector pair imag assign relev assign irrelev class determin protocol construct determin paramet likelihood ratio classifi involv make set imag set begin row column partit imag partit overlap half area partial subimag group column row make set shift version set begin row column partit imag construct record relationship shift comput imag shift subimag strongli relat overlap area pair calcul shift constitut relev class assum overlap relev shift overlap randomli select pair constitut irrelev class overlap concept figur note shift overlap half area properti evalu perform algorithm section test figur shade area show overlap subimag relev shift irrelev order estim distribut relev comput differ dimens featur vector featur vector assum differ normal comput sampl sampl comput differ sampl sampl irrelev class make moment user queri imag featur vector determin search featur vector featur vector pair differ comput probabl input imag featur vector subimag featur vector relev probabl irrelev assum prior probabl likelihood ratio defin ratio greater consid relev input queri imag natur logarithm elimin measur defin find relev input queri rank likelihood valu highest valu retriev relev nearest neighbor rule nearest neighbor approach assum subimag repres featur vector featur space featur vector input goal find ys closest neighbor neighbor retriev relev distanc metric ae euclidean kx infin max jx popul imag fort hood suppli radiu program imag visibl light imag fort hood area texa construct partit imag varianc statist result featur vector combin featur vector vector append test classif effect likelihood ratio classifi pair shift pair assign class class test check pair classifi class classifi class correctli tradit measur retriev perform recal percentag retriev imag correct recal percentag correct imag retriev note comput measur requir prior automat gener requir measur directli modifi version evalu perform algorithm manual group smaller set evalu perform recal test retriev procedur input queri imag size imag retriev descend order likelihood ratio ascend order distanc nearest neighbor rule correct imag retriev consid success averag rank correct imag comput state nearest neighbor classif problem relev class defin match irrelev class rest imag comput case perform shift comput worst case perform call worst case shift overlap half area overlap half area procedur problem retriev imag section user input imag result classif experi shift consist relev irrelev shift make total pair tabl approxim pair assign success pair assign pair split assign assumpt overlap relev nonoverlap irrelev assign count incorrect fact incorrect relev class identif rate lower bound retriev result retriev perform experi present tabl experi success mean correct imag tabl classif effect test varianc assign assign success tabl classif effect test statist assign assign success tabl classif effect test combin featur assign assign success match total case perform test featur success nearest neighbor approach perform likelihood ratio worst case perform test statist success varianc method perform equal illustr bound found queri randomli extract section imag statist perform varianc experi size show smaller give result measur micro textur homogen larger favor featur includ line inform euclidean distanc perform slightli rest retriev correct imag higher rank averag worst case combin featur perform featur domin distanc comput perform tabl show ad featur classif effect solut problem sort individu compon featur vector distanc compon measur tabl retriev perform test varianc origin likelihood euclidean infin ratio distanc norm success success avg rank shift likelihood euclidean infin ratio distanc norm random likelihood euclidean infin ratio distanc norm tabl retriev perform test statist origin likelihood euclidean infin ratio distanc norm success success avg rank shift likelihood euclidean infin ratio distanc norm random likelihood euclidean infin ratio distanc norm tabl retriev perform test combin featur origin likelihood euclidean infin ratio distanc norm success success avg rank shift likelihood euclidean infin ratio distanc norm random likelihood euclidean infin ratio distanc norm present featur extract method method user input imag section imag retriev imag section user input imag featur extract method varianc grai level spatial depend comput cooccurr statist constitut histogram angl line ratio grai level insid region span angl likelihood ratio defin measur relev imag queri imag imag imag pair high likelihood ratio classifi relev lower likelihood ratio classifi irrelev neighbor rule retriev imag closest featur vector featur vector queri imag high featur space evalu discuss protocol translat frame imag automat construct imag pair relev irrelev class result classif effect test show algorithm assign pair relev class correctli total queri show method retriev correct imag successfulli percent total experi worst case analysi nearest neighbor classifi method perform plot classif success function number imag retriev refer haralick imag retriev varianc grai level spatial depend proc iapr intl workshop multimedia inform analysi aug haralick imag retriev base statist technic intellig system nov malik imag queri proc ieee workshop access imag video theoret textur analysi imag proc ieee confer page flickner al qbic queri imag content textur shape spie storag retriev imag video textur featur imag classif ieee tran nov ma manjunath toolbox navig larg imag proc pentland al manipul imag spie storag retriev imag video page feb rosenfeld troi visual textur analysi conf record symposium featur extract select pattern page oct rosenfeld compar studi textur measur terrain classif ieee tran april
AI/658 2 learn similar space middl east technic depart comput abstract suggest method adapt imag retriev system configur origin featur space retriev system nonlinearli transform distanc featur vector adjust learn transform realiz artifici neural network architectur cost function defin learn optim simul anneal method experi textur imag retriev gabor filter featur result configur imag retriev system significantli origin system introduct imag retriev system design fix set featur similar metric restrict perform human prefer specif task design gener featur linearli imposs practic problem roughli glanc literatur publish signal imag process featur extract method preprocess step order repres imag expect extract featur reduc problem data discard valuabl inform repres origin imag successfulli effect space determin case class separ exist singl imag select set imag point vector research make assumpt metric space featur space assum euclidean select metric distanc function mahalanobi citi order measur distanc featur vector smaller similar imag queri expect featur vector similar imag close close measur distanc function similar metric critic imag retriev system imag similar comput exist mathemat metric consist human percept euclidean distanc effect preserv perceptu due subject perceiv similar respect relat task similar measur base nearest neighbor criterion featur space unsuit case true imag featur correspond imag attribut color shape figur show problemat exampl featur class euclidean distanc nearest neighbor search retriev pattern perceptu relev origin queri figur problemat featur space circl squar featur valu class featur inadequ distinguish class featur highli correl boundari curv distinct subclass exist data featur space complex order overcom bottleneck euclidean metric discuss effort spent context imag retriev ma manjunath present learn base approach retriev similar imag pattern map process learn vector quantiz jain develop similar measur base fuzzi logic minka picard report learn group similar imag posit neg exampl provid user queri session zhang li defin metric call support vector machin measur imag similar basic idea boundari separ imag dissimilar concentr textur base imag retriev queri imag user target select imag draw sketch retriev similar imag basic oper order portion imag respect similar metric imag retriev system retriev process depend content method enabl make system configur chang underli featur extract mechan task achiev nonlinear transform featur vector transform domain call distanc featur vector trainabl transform scheme artifici neural network emploi simul anneal optim predefin cost function experi brodatz perform similar space compar origin featur space transform featur space similar space search space call select distanc measur euclidean pattern adjust distinguish pattern class assign visual similar pattern class space class varianc larg class varianc small map origin featur space similar space highli subject task depend featur space map similar space featur featur vector vector figur block diagram transform nonlinear transform accomplish neural network figur typic ann shown figur output ann similar space bound number input neuron equal dimens origin featur space determin number hidden neuron output neuron dimens similar straightforward goal neuron layer note reduc number output layer reveal reduc number dimens similar space number output neuron chosen number input transform work nonlinear dimens reduct system select number hidden output determin similar space algorithm time standard backpropag algorithm train input versu output note backpropag algorithm minim squar error gener actual output magnitud error success ann separ class identifi output fz hidden layer input layer featur vector figur ann architectur transform due train handl cost function order measur good similar space algorithm search optim paramet cost function emploi ann train global optim problem learn algorithm hill genet optim cost cast train ann problem global optim simul anneal method mathemat set feasibl solut real valu cost function global optim formul search neural space connect weight vector includ bia term cost function simul anneal requir notion neighborhood structur neighborhood current solut set solut gener consist slight perturb weight vector perturb ad random vector number connect weight simul anneal figur iter algorithm escap local minima error surfac probabilist accept downhil move move begin process temperatur end temperatur lower random solut repeat time repeat time begin random element probabl end figur code simul anneal algorithm textur imag retriev nonlinear transform schema previou section imag retriev search studi suffic appli textur imag retriev problem due popular context similar base retriev system point cost function design optim improv separ similar space wai defin cost function depend natur problem characterist imag defin cost consid full user determin order retriev subimag studi cluster similar textur close separ distinct class cost function repres distanc class center farthest point class repres distanc class center nearest neighbor class center figur aim minim maxim class cost function defin class repres number weight vector ann distanc class center om class center point nearest class center class figur sampl similar space unbalanc significantli cost function price disturb separ rest class situat maxim cost poor separ cluster order overcom scale sigmoid function shown figur depend imag dimens similar space cost function figur sigmoid experi studi literatur brodatz consist imag size grai valu divid imag nonoverlap total imag obtain perform descriptor measur term averag retriev defin averag percentag number pattern belong imag queri pattern top match match subimag similar subimag search subimag expect queri retriev subimag part imag effect measur averag retriev rate popular featur extract method gabor report manjunath ma gabor filter scale orient orient scale gabor filter relev textur primit captur order statist gabor filter scale orient textur textur descriptor imag repres real number construct output correspond reduc space space dimens number hidden output neuron chosen trial error input normal gabor filter descriptor valu order train select subimag randomli run simul anneal code order maxim cost function order avoid wast comput select averag accept move begin select scale paramet chosen experi repeat time figur summar result averag retriev clear similar space effect repres imag compar normal origin featur space due dimens retriev cost comput save studi attack separ problem featur design imag search retriev system method concentr similar metric textur descriptor nonlinear transform scheme map origin imag similar pattern separ distinct textur close cluster similar textur nonlinear transform optim respect predefin cost function reduc dimens similar space result similar space success origin space retriev similar textur imag note nonlinear independ natur problem appli wide rang pattern recognit face fingerprint recognit chang cost type problem handl dimens reduct similar space explor test train retriev similar subimag imag imag retriev similar imag mage figur result brodatz album gabor filter descriptor shown averag retriev rate calcul refer simon ramesh lectur note comput pw pattern yong rui thoma current direct open journal visual imag vol april simon ramesh sep stan metric textur imag proc david mcg distanc measur imag organ human partit imag ieee octob bs retriev retriev imag vol aug duda classif scene stan luk similar textur proc european conf comput june robert neural robust approach softwar reliabl int symp soft rel nov textur descriptor imag icip octob greec
DB/659 3 histogram abstract nicola bruno £ columbia òóø ù áò øó øó çùö øó ôöó introduct ø áò ôöó øó øó óò øó ô ô øó ý øó øó øó £ permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee acm sigmod santa usa copyright acm surajit chaudhuri microsoft research lui gravano £ columbia øó ø øó óò óòðý ø áò øó ôöó øó ý øó øó áò øó øó óùö ôöó óùö øó øó çùö óùö óòðý queri plan select estim queri optim histogram queri plan histogram modul execut engin result stream øó ôöó relat work øó óò ñù óò î ý øó ø óòðý øó ø øó î ú ý î ú ç æ æ øûó î ú øó òùñ óò ú øó ôöó ú ëù øûó øûó øó óòðý øó óò ø øó áò óùö óòðý øó øó óö óö ý òó øó óò òóø øó óùö øó òùñ øó ý ý øó øó ðó ø ý òóø áò óùö ý analysi exist histogram øó áò ý øó òóø øó øó øó ø øó óò øó áò é øûó òó óò áò øó òóø óò øùöò øó øó øðý øó òó øó óùö ú øó øó ý øó óòðý óò ú øó øó óö áò øó øó ëù øó ý óòðý óò øó øó øó øó øó áò ø òóø óö øó óò òóø øó óö øó òóø áò øó øó óò óò ú ìó øó øó òóø òóø øó áò øó øó histogram histogram definit øó óñ ý áò òó áò óùø óò ú à õ õ ú õ ú à ú õ õ òóø áò øó ý áø øûó ý ý øó ý áø øó øðý óùö óòðý òóø histogram construct øó øó ý ìó òó óùö ùô õ óùòø õ óö õ óö òóø óùö à òó õ ï õ à à à à identifi candid hole áò õ øó ëù øó øó ý øó áò õ óòðý ø õ õ õ óö õ øó õ øó óùö ý õ óùòø õ õ ý øó õ queri drill hole bn bp bp øó õ ø õ ôöó òóø øó øó õ òóø ø óò õ ä øó óùö òóø øó õ òóø õ øó òóø ø õ õ ì ú ú õ ø òóø ø òóø ø òó exclud exclud õ õ ôöó õ õ ø ì ú ú õ ý ý ì áò õ óùö øó õ õ drill candid hole histogram bucket áò øó ý ì õ òóø ø øó øðý áò ì òóø ý ì øó øó øó øó òó ìó bp drill hole bn òó øó øðý ý øó ý ì ø ì øó ôöó ì ý òóø ø ë ú ë ì ë øó ì merg bucket øó áò óùö øó à øûó øó à à ý à ý óùö bp à øó à à áò ø à à à áò à à óòðý à bn histogram histogram bn histogram øó øó ý calcul penalti øó øûó à à à ô à áò øûó ý øûó ù à ôöó øó óò øûó øó øûó øó øûó øó øó óûò ôöó ô à ôöó çò øó ý øó øó øûó merg øó ú ú óòðý áò óò ú ú à ú ú à à à ô à òóø øó merg òóø ø òóø ø áò øó øûó á áò ý è á ú ý ú ìó á ú ú ú óòðý øó ú ú à ú ú à ú ú à à à ô à òóø øó øó à òó õ ï õ òóø à à õ õ õ à ì ì à à set data set øûó øù óùö ô þ ú ø øó øó ý ø ú þ ô ú ø histogram óùö óò ú øó ý ý øó øó øó workload øó ê ú ê ìó óùö òóø óùòø óòðý óùö ú ø ú ø ú ø øó øûó metric ìó óùö ø øó à ï ï ï õ ï ø õ õ à ø õ õ ý øó óö áò ùðø øó è õ ï ø õ òó øó evalu áò comparison histogram techniqu accuraci histogram óò ý áò çò óñ ý òóø øðý ø óòðý ý øó óòðý óò øó øó áò øó áò ù robust workload òóø ù óòðý çùö òóø ø óò óò normal absolut error normal absolut error arrai gauss normal absolut error arrai gauss normal absolut error arrai gauss arrai gauss normal absolut error arrai gauss normal absolut error arrai gauss áò ù óùö ý áò øó òóø øó øó áò óò ðù ø effect vari storag øó øó experi specif histogram refin converg çùö ìó óòðý øó effect updat óùö øó øûó ø øó áò øó áò øó òó normal absolut error normal absolut error normal absolut error spatial select cv normal absolut error spatial select cv normal absolut error spatial select cv tupl select ct normal absolut error tupl select ct normal absolut error tupl select ct ú ø byte normal absolut error byte normal absolut error byte òóø futur work áò òóø øó øó øó øó ý óùö øó øó øó óñ refer ë áò èöó æ ë ä óñ øö øö å æ áò èöó óò normal absolut error gauss arrai queri normal absolut error gauss arrai queri normal absolut error percentag swap ê áò èöó óò è î áò èöó î â áò èöó áò ë î áò èöó óò î áò èöó ë à î æ ë î ã ì áò èöó â à à ï óò â ë å áò èöó óò å â áò èöó óò normal absolut error percentag swap å â áò èöó óò ë î ì çò øûó áò ë í à ï à è áò èöó óò áò èöó î î øó óò áò óò ë èöó î áò èöó óò î è â â áò èöó óò ë à è ï ì
HCI/660 4 twist mobil interact session transfer thoma richard jing california lo angel comput scienc depart lo ca abstract ubiquit comput resourc daili product goal present remain converg desktop mobil applic seamless comput experi provid strong motiv futur paper describ converg capabl perform handoff applic session heterogen platform network conduit addit discuss architectur protocol facilit paper provid taxonomi describ varieti session handoff scheme identifi import interact session transfer behaviour commun heterogen client server demonstr implement handoff capabl twist semant applic serv teach tool radiolog clinician data show handoff mechan incur delai transfer larg session introduct integr mobil comput ubiquit everydai remain goal reach ultim target user perform daili comput activ machin time locat vision continu cloud platform heterogen issu satisfi common denomin comput platform impair limit cpu storag displai internet softwar interfac posit addit lack converg desktop mobil devic softwar form hitherto consolid applic session dispar platform uninterrupt comput experi motiv public migrat sophist mobil comput behaviour mobil comput public sector gener form specif applic domain investig part interact mobil applic support heterogen client research project investig complex relat converg applic run desktop mobil platform connect network internet project collabor effort gear develop wireless comput infrastructur aid physician staff ucla clinic work fund nation scienc foundat award research hospit built millennium work intend enabl mobil flexibl augment wire servic facet includ qualiti servic system paper focu core aspect applic session handoff platform session handoff physician staff run typic applic continu client platform commun applic server act data repositori client set desktop displai handheld pocket person digit assist comput characterist client machin user seamlessli move applic session machin machin run version applic session transfer network session suspend restor locat system shield user complex uninterrupt comput converg platform facilit place middlewar server layer client applic server paper describ design architectur protocol enabl session handoff capabl research identifi taxonomi vari session handoff scheme isol behaviour requir bidirect interact end client applic server complic matter term handoff face complex interact session transfer crux paper type oper perform client differenti natur oper object data type demonstr feasibl implement twist capabl internet applic call teach file pedagog tool clinic professor experi perform protocol incur perform overhead due commun api chose implement solut oper larg data set handoff function typic complet rest paper manner discuss work bear explain detail interact session transfer describ implement twist teach file applic show result work suggest futur direct figur physician alert clinic inform part applic session pda figur physician session move pda desktop figur session laptop relat work notion session transfer platform partial mirror concept process migrat found context process migrat requir entir address space move homogen client handoff move subset address space heterogen client middlewar server capabl perform filtrat data content occur varieti origin data reduct resolut colour imag reduct entri access log filtrat reduc data bulk aid devic explor research gener effort stop short semant impact distil guid tenet architectur ubiquit comput devic parallel goal research uniqu princip provid seamless session handoff capabl project facilit comput servic distribut comput research tackl issu scalabl secur servic program rich environ interact wireless handheld devic delv transpar session transfer interact session transfer begin discuss interact session transfer describ mobil comput facil augment facil architectur session handoff concept incorpor transfer semant conceptu mobil physician proce describ arm comput platform enabl perform daili activ figur illustr clinic scenario research project expect oper physician requir clinic data access numer locat varieti machin exhibit bandwidth characterist figur physician alert inform clinic data small pda modest bandwidth displai capabl typic inform displai patient symptom medic treatment multimedia data physician decid investig inform power desktop workstat transfer activ applic session pda shown figur state data render textual user automat function similar applic workstat result call applic session handoff user experi disrupt program usag continu present similar data locat note user explicitli save data intermediari destin physician sole duti serv migrat indic system make simpl push continu action machin runtim system mechan perform action seamlessli automat figur physician decid move time class machineri consult physician locat system provid capabl move data platform applic session handoff identifi comput entiti involv cast assum data origin applic server driven manag system note system commonli legaci machin program interfac remain user system access varieti client cn differ characterist order applic client interact insert small portion code requir applic modifi client applic server import hardwar portion architectur distribut middlewar server layer client mw tier plai varieti role context paper concentr sole middlewar server action enabl applic session handoff describ behaviour applic session handoff provid user begin applic client retriev data client applic contact mw provid servic receiv request mw contact receiv data return data cach data object copi request client depend characterist client connect data object filter mw reduc size user interact data period time user interact data impact behaviour system shortli discuss user decid move session activ handoff mechan client softwar suspend session explicitli launch session immedi target platform assum time user perform modif data object specif case gener behaviour mw receiv ash request client proce send cach origin object send unmodifi data back mw filter cach object perform meet bandwidth comput limit applic receiv data user continu work disrupt data object scenario case applic session simpli state crucial data structur applic act posit case applic session entir address differenti approach gener process migrat save byte strict subset address space order magnitud handoff applic data gener process migrat reli heavili os architectur homogen vari type applic session handoff function user interact client data session data initi deliv client express understand user modif data client propag simpl client send data request act data sink simpl behaviour data present current mobil devic user stock portfolio inform yahoo mobil client move client view stock move devic client strictli handoff inform origin yahoo data deliv client wide form data mobil incur extra delai invok time categori session handoff interact session transfer data deliv user make interact modif portion data origin client applic modifi user secondari data transfer applic session client mechan shown implement session transfer web browser data deliv typic set webpag user free make modif import bookmark user url transfer session handoff note modifi data reach client mw part session handoff propag back categori session interact session crux paper type handoff data modifi client includ data meant save back capabl import issu perform address section handoff twist interact session transfer involv handoff possibl modifi data client transfer data origin case handoff mechan semant data modifi handoff data immedi save back order state deliv send shield handoff detail duti perform mw grant import modifi legaci alter implement handoff mechan prohibit maintain api perform oper deal addit complex support handoff clear system implement semant superior similar system user save session order move platform user save intermedi medium send data explicitli storag point user make explicit effort perform tediou slow action option save data back implic choic user save incomplet form back possibl data storag point overwrit origin data object move recal data object activ incur access scenario session transfer simplist twist semant session transfer state complet access user physic return user explicitli save back time user deem data fit storag research dealt issu transfer modifi applic session heterogen client expedit discuss lend quantit flavour introduc notat behaviour system note system design content data mw client client characterist devic profil made mw case filtrat mechan ident origin data object filtrat mechan appli suit bandwidth comput limit client result data object filtrat occur note data object deliv applic accept data provid user mean modifi data modif includ basic graphic delet user modif perform data object result data object user modif occur twist express term shown figur session return data object immedi cach mw filter suit limit appli filter function client receiv mw user proce modifi data appli oper result point user perform applic session handoff machin interact result oper made visibl session modifi form data made mw note back mw explain mw deliv result pass content filter deliv make import observ affect perform data consist note mw act natur proxi act behalf client state mw perform data filtrat data match limit client mw perform process client pass result onward situat mw provid mean form execut object observ involv critic pathwai client mw time expect data form repres filtrat data modif data filtrat origin object shortli pattern receiv mw order perform object order perform send entir back mw suffic send back sole oper mw cach fetch priori devic profil client applic server client middlewar server figur handoff applic session strict sequenc mw reappli pass result send object issu note assum oper isol back mw research type oper repres xml order magnitud smaller binari object repres assum code appli exist mw dynam ship mw assum time transmiss network mw assumpt typic valid assum comput power mw dwarf client network bandwidth client mw finit limit observ session hand question natur principl expect receiv express previou paragraph term strict sequenc method flow execut shown figur altern seri impli deem filtrat unimport final result critic modif transfer case origin data object colour imag result nuclear scan patient user work client requir instanc imag reduc imag pda receiv physician determin patient cancer growth draw circl portion imag graphic annot oper perform doctor decid scan typic determin bodili abnorm result cancer move session client requir filtrat client receiv simpli omit suffic annot oper filtrat oper doctor graphic annot filtrat qualiti imag result appli imag close origin case result imag filtrat filtrat lossi note pattern accept due natur oper perform explain make oper perform client oper appli domain operand oper involv bit imag black white vice case oper valid imag clear analogu colour imag oper syntact depend characterist operand oper appli operand filtrat perform operand imag rotat translat exampl function oper semant depend filter imag case origin imag colour client machin colour displai user annot imag simpl make note blue user fulli capabl determin imag shade transfer session blue case modif semant depend filter chang syntact semant lost oper semant mean chang filtrat system handl issu syntact depend manner client applic user modif conserv label syntact depend independ task tractabl provid api develop applic modifi exist applic perform scope result oper perform user visibl handoff client oper visibl user free perform client due fact send object discuss warn user perform modif reflect session state handoff deal semant depend complic issu handl system provid user inform pertain natur data filtrat occur mw user alert imag view reduc colour resolut caveat user free make modif discret oper visibl handoff leverag xml architectur advantag extens markup languag xml express data descript capabl de facto standard industri textual markup design describ data object arbitrari detail xml repres client data oper appli object extens usag contrast research xml sole metadata provid version inform object motiv xml client machin characterist mw mw capabl filter data base client comput capabl xml easili express factor defin set markup tag state item network interfac screen resolut instal runtim cpu speed client initi assign static xml descript user option dynam chang emul data object express xml form abstract data type languag support binari descript data includ pointer metadata describ state data imag describ data tag annot text data express xml simpli pointer tremend advantag approach describ data pass xml filter content adapt advantag extens stylesheet languag languag provid arbitrari set rule manipul xml xsl mean action alter xml xsl filtrat function earlier xml flexibl express user oper data object oper function mention describ oper imag arbitrari state chang expect benefit architectur discuss section varieti applic exhibit behaviour benefit reap architectur handoff capabl hitherto handoff mechan act subset applic address smaller amount data transfer respect process migrat approach handoff process migrat handoff capabl implement modifi sourc code client applic interfac applic server remain varieti handoff base level interact perform user direct natur data applic server client identifi type oper perform client differenti natur oper object data type handoff design perform varieti perform cach object data applic benefit client implement twist section turn attent implement twist enabl applic advantag environ medic imag displai applic pedagog dissemin inform ucla augment session handoff platform implement result comput due restructur applic softwar architectur result implement handoff session platform interrupt work session left result user interfac function shown figur successfulli move session varieti client machin includ desktop machin run window nt run window technolog qbe person comput tablet run window laptop run window desktop machin connect network mbp ethernet qbe laptop connect mbp wavelan card teach file applic teach file program java applet develop ucla displai medic creat electron instruct file call retriev exist teach enabl access teach file internet major goal teach file program provid advanc effici method improv radiolog teach clinic professor ucla work tool gather relev patient rearrang present data student report find physician clinician intend run desktop workstat sport displai retriev teach file teach file applet cull piec origin graphic imag teach file state save origin author tool prepar state consist present appli imag imag decod proprietari format call pac manipul appli teach file state includ simpl text annot provid user imag present applet provid compress figur teach file applet handoff capabl teach file data encod xml teach file applet perform xml encod teach file author transmit applic server applet execut xml decod retriev teach file applic extract restor present teach file user origin architectur teach file shown figur system consist number client run java browser execut teach file applet download webserv applet definit commun origin server maintain teach file commun applet server http server execut java servlet code client request start user typic request list teach file server select open server subsequ return graphic imag pac descript teach file state express textual separ java output stream teach file applet receiv convert pac data object standard java imag appli state present result imag textual annot user point user free modifi annot text fit save work back server applet send back annot descript imag encod server storag applic augment design particip environ select suitabl subject research reflect goal provid mobil comput technolog medic facil ucla goal modifi teach file webserv dbm pac teach file state client tf state teach file object figur origin architectur teach file applic server pac teach file state client client middlewar server tf state teach file object figur architectur teach file number action parallel figur enabl session handoff twist discov perform bottleneck fix condit teach file support client enabl teach file step chang origin architectur figur architectur middlewar layer support handoff result redesign shown figur kei differ mw serv role aid environ sampl middlewar server sun sparc workstat applic server sparc run suno initi client applet time mw origin server free true applic server handl transact addit duti deliv java applet client interact mw remot method java version remot procedur mw commun http note interfac commun http modifi client mw act proxi behalf teach file applet offload comput mw user request teach respond http pac imag file descript time mw client implement kei mw perform imag assembl behalf includ proprietari pac imag java imag manipul imag teach file state descript result imag accompani textual annot ship client rmi chose rmi familiar remot procedur call semant implement perform enhanc primari goal implement handoff capabl twist user perform session decid handoff conduct respect recipi user select session save back applic time session teach file applic run target machin approach mechan target explicitli retriev session state mw user select hostnam target list handoff mw contact daemon run target machin immedi launch teach file applet automat retriev session state mechan applet client termin state fulli client provid static hostnam target client run session instanti plan leverag dynam resourc discoveri mechan technolog discuss implement teach file applet mirror discuss interact session transfer discuss mw natur mw act intermediari client applet configur retain program interfac mw perform oper behalf client applet send oper entir data object client teach file applet user modifi annot teach file user perform annot encod back mw entir teach reduc network disregard initi content filtrat content filtrat teach file applet unabl obtain colour imag clinic testb cientli similar power client platform clear incorpor send classif user note textual classifi syntact independ semant depend content filtrat annot made content adapt appli annot semant semant depend adapt modif teach file client applet code minor simpl approach replac http connect rmi connect mw term minor addit client code middlewar awar remot marc portion code essenti act local proxi connect client code mw move portion code relat imag assembl pac imag appli teach file state client mw mention earlier mw implement java rmi server perform analysi section describ varieti experi demonstr perform teach file applic system architectur assert princip benefit applic session handoff mechan inher qualit abil move applic session machin user greater conveni easili measur experi design identifi basic perform behaviour newli introduc includ overhead perform perform trial middlewar server sun workstat run mhz mb ram applic server sun run mhz mb ram test client intel mhz pentium ii desktop pc mb ram run window nt intel mhz laptop mb ram run window specif platform testb chosen due avail conveni factor desktop connect network mbp laptop connect lucent wavelan card note perform result client cpu bandwidth characterist similar breviti show result desktop system client applic teach file applet run internet explor sun java teach file session includ graphic imag textual annot figur show time perform session sourc client recal implement user suspend session time locat note java rmi remot procedur call servic time server part client time experi control applic state size vari size textual annot provid user annot control variabl accord vari size user modif ship sourc client mw explain previou section intuit expect size modif time perform session suspend data network figur case modif size latenc experienc client case modif data smaller applic user modif textual annot type program modif succinctli express figur show time restor suspend session target client time perform size data note time restor time slower time suspend recal disk access penalti incur suspect time accompani write faster due write buffer mw mw softwar written api provid disk control show overhead teach file program respect origin version interact applic time data save open metric ad complex figur show time save data client figur show total time spent origin client recal show interact origin client interact mw environ similar due basic tenet leav interfac unchang mw act proxi behalf client figur unmodifi client mw ident perform result commun expect mw servic time includ delai time surprisingli larg size delai client due pass data mw assembl data decod pac imag appli imag discuss earlier time count part delai origin client java rmi commun protocol client mw choic rmi base familiar perform lack figur graph delai incur save data client end pattern time mw origin client client incur addit due rmi overhead born measur rmi delai remot method return averag ms byte ms byte reduc delai experienc client creat separ thread mw perform interact remov mw servic time client delai time effici implement rmi program approach note time perform save time perform read figur differ attribut write buffer assembl teach file perform read time millisecond session size byte time perform session suspend delai time sourc client servic time mw figur delai incur suspend session sourc client client time includ mw servic session size byte time perform session restor delai time target client servic time mw figur delai incur restor session target client client time includ mw servic time millisecond data size byte time retriev data applic server client middlewar server origin client figur latenc incur retriev data applic server client time includ mw data size byte time save data applic server client middlewar server origin client figur latenc incur save data applic server client time includ mw servic quantifi benefici result handoff mechan state outset section conveni util system larg perform result show session handoff explicitli save data client back applic server express restor note approach immedi violat semant session handoff discuss user invok perform activ burden server handl current state satisfactori complet quantifi simpli add time origin teach file applet interact perform result summat data figur expect session size comput size approach incur delai penalti ms save ms total ms mention includ time assembl data time handoff mechan comput figur ms session suspend ms total ms time includ labour assembl data session combin seamless transpar natur autom result distinct advantag larg session size sum ms compar favour client latenc includ data assembl cost incur target client handoff futur work current research work lend nice varieti futur extens plan incorpor heterogen testb util broader rang client window ce palm pda machin offer wider spectrum comput characterist devic work necess content adapt imag data fit limit displai found current testb begin ramif limit bandwidth connect cellular data extend period disconnect explor issu scalabl simul model network simul tool devic myriad differ ubiquit comput present larg obstacl lack integr similar applic run machin paper made argument provid converg dispar platform creat seamless comput experi made contribut field mobil internet comput develop applic session handoff capabl seamless transfer applic data multipl os platform implement design enabl handoff teach tool clinic ucla medic facil identifi famili session handoff base level interact perform user direct natur data applic server client point interact session transfer behaviour demand interact applic server client type oper perform client differenti natur oper object data type implement handoff mechan perform varieti perform cach object data applic oper util data descript capabl xml acknowledg georg daniel contribut refer zhang nomad ucla technic report inform model nomad ieee ninth intern workshop expert system henderson network architectur heterogen mobil ieee person octob brewer network client variat infrastructur lesson ieee person august winograd inform applianc interact ieee comput graphic xml prentic von rh zm zhao architectur robust system special issu comput network comput hunter idl intern confer distribut comput june van effici implement java remot method seventh acm sigplan symposium principl practic parallel zhou migrat acm comput june walker adapt acm symposium oper system applic session time ieee intern confer commun june sun page technolog baker roma person metadata ieee workshop mobil comput system decemb html perform detail wireless network submiss acm transact model comput simul implement confer pac waldo jini architectur commun vol stylesheet languag www
HCI/661 4 model hci task centr de la navig avenu cedex franc abstract navig draw move common task modern comput interfac perform task successfulli model law appli point task explor exist robust regular task paradigm repres found simpl exist paper present seri applic steer law keyword human path task motor input techniqu interact introduct argu advanc hci li field model quantit tool user interfac research develop rare except law extend inform theori human paul fitt found formal relationship model tradeoff aim movement predict time £ point ¤ ¥ target width distanc logarithm relat spatial rel error empir determin factor log ¥ ¤ zhai input research group toronto canada call index difficulti describ difficulti achiev greater difficult task ibm almaden research center harri road san ca usa due accuraci law popular research topic numer studi conduct explain extend appli law domain law interact research readili appreci input devic research imposs compar devic perform result studi law model appli perform score set specif condit size score translat perform index independ detail law reveal intuit tradeoff human faster movement vice sever constraint slower move paul fitt formul tradeoff task strip disk nail essenti hit target distanc paradigm correspond frequent element select obviou law address type movement comput input devic point target produc steer space vrml law adequ model task simpli write realiz mark differ pen formal studi law paradigm show perform differ type devic user interfac input devic studi carri law paradigm suffici practic long addit point pursuit constrain motion consid test task input devic evalu tremend success spirit fitt simpl quantit relationship task constraint movement appli type task regular human movement model simpl mathemat richer set quantit tool motor control research user interfac evalu current work step goal order address paradigm focu steer boundari call constrain motion task taxonomi simpl task illustr figur draw line side figur pass amplitud variabl time perform kind oper depend directli amplitud path accord formal model figur movement normal constraint earli studi analyz handwrit freeman notic time write charact script larg small charact written larger script size term absolut charact smaller rel accuraci remain time produc trajectori set rel larger result explain artist spend lot time draw figur contour finish draw tradeoff hold larger scale faster drive control narrow slower drive simpl explan movement small deviat standard trajectori result constraint feedback analysi complet movement correct due fact time human process visual feedback inform move lower bound step deriv valid quantit relationship time movement constraint task studi establish quantit formal model predict difficulti result provid theoret basi note smooth conduct experi complex deriv theoret model quantifi difficulti gener path steer task apparatu experi perform silicon impact monitor pixel equip tablet domin subject held move stylu surfac produc draw comput monitor experi background color set black entir tablet area map centimet tablet correspond pixel screen experi goal pass investig steer task constraint end illustr figur call task subject pass goal goal quickli movement time goal goal record analyz figur goal pass task procedur design repeat measur ten subject particip experi independ variabl movement amplitud path width subject perform consecut set ¥ ¤ condit set consid practic session data collect session condit present random order session subject perform trial condit begin vertic target segment present green color place stylu tablet left goal appli pressur subject began draw blue line show stylu trajectori cursor cross left line turn signal task begun time record cursor cross left draw turn signal end trial pressur stylu cross goal cross result invalid trial subject minim error beep emit condit result result show goal pass task law tap natur movement constraint graph present movement time id show linear relationship high correl movement time ¥ ¤ log ¥ ¤ amplitud movement width vertic variabl error rate higher rate small width time index difficulti figur graph relationship goal pass task experi constraint experi show steer task constraint end logarithm law tap task serv step stone formul relationship movement time continu constraint steer task time pass goal width ¤ distanc ¥ place law place infinit number result task straight tunnel steer task introduct note analysi formul hypothet relationship steer offer explan understand steer control process illustr figur defin step shown figur task experi pass experi show index difficulti move goal goal ¥ log ¤ step step divid ¥ amplitud ident amplitud shown figur part task model step amplitud logic assum index difficulti move goal goal goal log ¥ step log step log goal goal goal goal goal step log start line end line ln figur defin goal pass task amplitud ¥ step divid amplitud ident shown figur difficulti move goal goal goal ¥ log ¥ ¤ interest constraint bigger care subject order pass goal task task tunnel length width determin index difficulti limit task determin limit index difficulti order taylor seri log lim ¥ ln ¤ analysi predict difficulti achiev tunnel travel task relat logarithm lead equat ¥ ¤ empir determin constant defin ln order verifi ran experi figur procedur design thirteen subject particip experi design experi previou factori design repeat measur movement amplitud path width test random order similarli experi experi includ session data collect session combin amplitud width test trial begin present figur present green color press stylu tip result blue line drawn line color turn red cursor cross left side rectangl line turn yellow task stylu cross side rectangl beep emit chang condit cross left side rectangl account left cross path result cancel trial error record result model success describ difficulti task found strong correl model data collect regress analyz successfulli complet perform error rate significantli task averag error rate time index difficulti figur relationship relat fit note subject minim error error rate higher typic found law studi steer narrow tunnel boundari point trial difficult tap small target model error rate function task difficulti conduct futur studi experi narrow tunnel experi test method appli linear trajectori path width simplest configur satisfi properti narrow shown figur subject draw line tunnel quickli start line figur narrow tunnel end line task set element goal pass calcul index difficulti method result express index difficulti infinit complic compar simplic tunnel shape appli simpler method comput index difficulti task approach consid narrow tunnel steer task sum element linear steer task experi figur show decomposit start line dx figur decomposit narrow tunnel end line elementari path situat length index difficulti steer elementari note experi ¤ width path obtain id entir sum ¤ ¤ ¤ index difficulti narrow tunnel nt ¥ ln ¤ ¤ ¤ prove steer task elementari steer task elementari goal pass task result id conveni depend shape path true experi discuss paper procedur design ten particip experi design procedur experi experi paramet set ¤ ¤ ¥ result shown figur complet time success trial index difficulti narrow tunnel steer task form linear relationship due high constraint end high error rate occur condit averag error rate close time index difficulti figur relationship narrow tunnel task gener defin global law narrow tunnel studi brought concept integr path width trajectori approach extens method complex path shown figur ds figur integr curv establish gener introduc integr curv defin index difficulti steer path sum curv elementari index difficulti obtain gener express ¤ hypothesi time steer linearli relat ¤ constant formula gener case present deduc horizont steer task experi ¤ constant equal ¤ equat equat found experi £ ¤ ¥ ¤ experi spiral tunnel order test method complex studi spiral shown figur subject draw line center end spiral figur instanc spiral defin set spiral vari paramet influenc width stand number spiral figur show equat polar coordin set spiral chosen width path vari significantli goal predict difficulti steer spiral appli previou determin function width path good approxim width path angl proven ¤ appli equat make summat elementari procedur design factori design repeat eleven subject particip experi factor spiral number width factor subject perform set time practic session real experi condit present random order subject perform trial condit procedur similar previou experi begin illustr figur present screen task start cursor cross small end stylu cross outer long complet spiral steer cross spiral boundari result trial cancel result experi confirm predict difficulti steer task valid complex task shown figur time steer spiral path linearli relat index difficulti defin equat fit equat averag error rate task time index difficulti figur spiral steer deriv local law shown equat law predict total time perform steer task local law model instantan speed express ¤ veloc limb point ¤ width path point empir determin time constant local law predict instantan speed steer movement point proport variabl width path point justif relationship veloc path width calcul time steer path veloc defin local law £ ¤ express £ close equat intercept observ real data experi experi experi small compar total trial time random variat subject perform intercept equat includ variat account order check valid equat data previou experi plot speed versu path width check linear relationship experi width calcul averag speed steer figur repres result scatter plot built move event receiv show linear relationship path width stylu speed exclud point discuss found ¤ small intercept coher equat deriv speed path width figur speed path width experi experi width directli extract averag speed path width figur present scatterplot speed path width case narrow spiral tunnel steer base move graph show linear relationship path width hand speed narrow path width found ¤ case narrow close speed path width figur speed path width experi spiral path width ¤ deduc close speed path width figur speed path width experi discuss due space leav detail variat law verifi point limit simpl law due human bodi limit upper bound limit path width correctli model simpl law limit lead satur law limit reason remov greatest width analyz linear relationship speed path width local law local law modifi path curvatur account local law compar law introduc al argu tangenti veloc radiu unconstrain al show law valid constrain definit constraint constraint pure mechan consist move pen border object law directli applic case gener steer law start posit difficulti steer task perform experi steer perform left experi counter direct steer steer relat design implic model interact time menu interact current implicitli perform path steer task menu shown figur step menu select linear path steer similar experi menu item item figur interact menu select item hierarch menu involv linear path steer vertic steer select parent horizont steer select appli result experi model time select sum vertic stand time horizont steer task £ select £ vertic horizont deduc £ minim assum half number item greater number item greater quotient studi mean compar model differ linear hierarch menu hierarch pie menu step model interact evalu mark interfac assum horizont steer vertic steer driven law studi plan prove assumpt coeffici involv law order magnitud calcul perform consid approxim perform evalu analog ip equat equat index perform comparison devic limb comparison index perform point task steer law quantifi perform function function bodi function design paramet control gain transfer function appli steer plan studi perform differ input devic trackbal law robust quantit law appli interact research design great number studi conduct verifi appli law carri spirit law step forward explor exist robust regular movement task demonstr logarithm relationship movement time tangenti width target tap task exist movement time normal width target task thought experi place infinit number goal movement trajectori lead simpl linear relationship movement time width steer task confirm relationship type correl greater gener relationship integr local form integr form state steer time linearli relat index defin integr width local form state speed movement linearli relat normal constraint regular present studi enrich small repertoir quantit tool hci research design devic comparison menu design potenti hci applic acknowledg research undertaken input research group direct bill buxton made substanti contribut develop paper work support centr de la navig inform technolog research center ontario natur scienc engin research council canada ibm almaden research center indebt member group input corpor contribut project thoma chatti william hunt toronto comment project refer haptic channel chapter read comput interact morgan kaufmann evalu step kei text kei text select crt gg morpholog analysi design space input devic acm transact inform lg process visual feedback inform movement control journal human percept pj feedback control law quarterli journal pm inform capac human motor system control amplitud movement journal fn teach handwrit houghton sw mi process visual feedback rapid movement journal user learn perform mark menu acm confer human factor comput db ja investig law wide rang movement amplitud journal motor comparison input devic element point drag task acm confer human factor comput system extend law task acm confer human factor comput law research design tool interact comput newel sk prospect psycholog scienc interact ca trajectori determin movement dynam rapid visual feedback process movement journal motor
DB/662 3 index semistructur data jason mchugh jennif widom serg abiteboul luo anand rajaraman comput scienc depart stanford ca abstract paper describ techniqu build exploit index semistructur data fix schema irregular incomplet present gener framework index valu presenc automat type coercion base dbm semistructur introduc type index illustr queri process techniqu index structur fulli implement integr lore prototyp introduct call data irregular exhibit type structur heterogen conform predefin schema data frequent integr inform heterogen sourc semistructur data store queri relat manag system easili effici develop lore manag system design specif semistructur data build lore scratch explor semistructur data affect compon manag system paper focu index tradeoff effici queri perform versu space updat cost consid index fast access data essenti replic portion structur structur date chang base data reflect applic index cost index ad ad complex queri index shown integr part system involv index similar system semistructur administr build index exploit properli queri queri process time consist index structur data maintain applic semistructur data queri web integr tend work support air forc rome laboratori darpa contract lightweight object grown system object dbm case balanc fall maintain extens index structur speed queri process lore applic find approach choic semistructur data introduc problem actual mechan index index relat system creat set attribut collect type attribut defin advanc data essenti arbitrari label direct graph difficult isol attribut collect type object advanc lore automat perform type coercion compar object essenti featur deal semistructur data tradit index techniqu modifi order presenc coercion index atom valu data model queri engin quickli locat specif leaf object queri explor data label introduc addit index effici locat edg path data lore includ simpl index system effici support inform retriev style predic lore queri languag describ lore queri optim piec index creat effici queri plan index creation index queri plan paper implement fulli function lore relat work descript lore architectur queri execut engin found lore queri optim introduc focu optim find effici queri plan lore dataguid dynam structur summari serv tool simpl path index preliminari version lore queri introduc detail current version lorel needless amount work index work depend fix schema base class hierarchi environ approach fix compar object type relat work includ recent research effici evalu gener path express algebra framework transform present optim evalu gener path approach index notion introduc path express evalu similar spirit dataguid path index explicit storag mainten state integr queri plan consid index tradit movi movi movi titl writer year price amount currenc titl price actor charact titl price actor charact db actor charact refer origin aka movi year figur oem paper outlin section introduct data model queri languag lore motiv lore queri execut strategi detail foundat index valu presenc automat type instanti section index type implement lore system section queri oper plan index structur section preliminari motiv set stage discuss index semistructur introduc lore data queri queri execut strategi detail object exchang model object exchang model design semistructur data data model thought label direct graph oem graph shown figur depict tini portion inform movi oem lore permit arbitrari vertic graph object uniqu object identifi atom object outgo edg basic atom type object outgo edg call complex object object complex subobject object atom special label serv object entri point figur db denot object oem notion fix schema schemat inform includ chang dynam oem regular data model design handl incomplet structur type heterogen exhibit observ figur movi price complex object oem object label express denot set subobject atom outgo label empti set lore queri lorel queri languag introduc lorel queri languag exampl full specif extens highlight featur languag design specif queri semistructur data relev index scheme featur lorel inherit oql cover queri introduc basic build block simpl path sequenc label simpl path express denot set object reach start db edg label edg label actor rang variabl assign path specifi rang movi subobject db simpl lorel queri execut figur return titl movi harrison ford act queri indent repres graph structur select result titl titl origin aka figur present number respect simpl queri guid principl lorel write queri worri irregular movi structur object structur bother type automat coercion atom valu type complic index lore queri processor rewrit queri oql style translat queri user free enter form queri lore system build queri execut strategi base translat queri select exist exist user omit notic rewritten version queri introduc notic comparison subpath transform existenti condit user write unknown lorel offer richer form oem simpl path gener path express user specifi desir pattern label pattern path match sequenc pattern label match sequenc pattern atom valu path pattern shown select result price subpath path express select match queri return price amount subobject movi year product movi titl refer futur movi produc lorel comparison return valu compar coerc atom type coerc compar comparison return true object satisfi queri price subobject return detail formal atom type coercion implement lore section queri execut strategi queri execut strategi repeat select exist exist straightforward approach find object path exist path call execut strategi begin object db evalu path express forward manner queri execut strategi result graph requir index execut queri identifi object satisfi index structur locat atom object object satisfi backward match path express lore object store support parent addit index structur locat parent object call queri execut strategi identifi atom object attempt work back object outperform depend queri found good strategi practic applic strategi evalu necessarili fashion creat set object directli identifi atom object satisfi index index point explor intersect set object combin path obtain result queri call approach hybrid oper meet middl path express queri execut strategi work identifi portion graph match middl path parent children match remain portion path express index identifi object match middl path addit index upward execut strategi give reader flavor queri process index lore return detail lore queri plan cover index valu describ concret term index lore index valu automat coerc valu type comparison import featur semistructur user type atom data type relat atom data vari made attempt coerc movi integ real string ascii postscript figur partial order type integ compar product year queri compar movi price requir coercion price store varieti type automat type coercion make index valu lore complic tradit system discuss specif implement lore present gener framework index valu type coercion set type partial order oe type oe specif type relationship necessarili valu type coerc type figur integ specif real real specif string call ancestor oe note oe transit upper bound type denot common ancestor exist type set valu type denot set valu type pair type oe coercion function ji partial function assum coercion function ij jk defin iff ik defin coerc valu equal ii denot ident function type figur type point coercion function true partial string coerc real real coerc integ coercion function gener string coerc real number integ figur show nonlinear partial postscript ms word document coerc ascii document flexibl comparison develop theoret oem collect object type object repres tripl type basic object lookup problem find atom object comput set fo vg object lookup oper execut directli locat object satisfi equal condit queri predic extend gener comparison oper semistructur similar concept repres type number repres place integ place string perform object lookup match object integ object string formal idea defin notion flexibl equal small distanc partial order compar import limit distanc promot function partial function oe oe defin vice versa type specif equal flexibl written partial order shown figur upper bound integ string coercion type integ result case upper bound string string string gener flexibl equal flexibl comparison fi binari comparison function defin type valu fi true fi standard arithmet comparison oper defin flexibl comparison oper fi fi fi type fi fi type type fi definit flexibl comparison oper fi preserv commut fi transit fi fi fi fi gener transit preserv transit elimin optim opportun queri feel notion flexibl comparison semistructur data string real int string string real real real string real int real int real int real tabl coercion string type flexibl index develop theoret index type set object effici support index lookup oper oper fo fi vg goal construct set index algorithm object lookup form fi base index lookup describ set index subsect actual lookup algorithm denot set object type type ancestor creat index ij ij fh ij ij ij index type object ij ij index valu type coerc type coerc valu store index special case valu type index partial order figur denot type string real integ ss index string valu sr index string coerc real si index string coerc integ rr index real ri index real coerc integ ii index integ easi comput number index partial order figur index top index number index number index number nonlinear partial order type index figur reduc number index properti hold type oe exist coercion function pair valu exist fi iff fi case index index type integ real satisfi condit oper fold integ index real index reduc total number index item integ coerc real full set coercion rule summar tabl approach index lore index lookup algorithm type oper fi algorithm displai figur recal lookup oper index oper fi set return set object flexibl comparison oper fi interest point partial order index lookup type index lookup occur type upper bound procedur type oper foreach type ik defin jk ik return figur index lookup algorithm match string partial order shown figur optim discuss section procedur gener index lookup ss lookup rr lookup ii match real number partial order shown figur optim discuss section procedur gener index lookup sr lookup rr lookup ii theorem end execut procedur set object match fi union line disjoint result lookup jk ik fo jk fi ik fact set object match fi directli definit union disjoint exist return index xy recal st index object type coerc type object singl type imposs line singl impli upper bound contradict fact comput disjoint union show work obtain match object index lookup reduc complex algorithm disjoint union easier comput gener union index lore describ type index built lore describ queri plan oper index descript queri plan speed queri process lore build type index structur identifi object specif effici graph locat atom object valu base index scheme introduc section built select object incom label text locat string atom valu specif word group word text index simplifi version style invert index built select object incom label current implement oem support parent link locat parent specif object path fast access object reachabl label path choic index build maintain made administr base expect queri updat describ type index detail index lore built atom object base type string incom edg label queri engin quickli locat object reachabl edg match comparison predic chosen support singl specif desir incom label queri process time section partit label approach administr build select frequent label queri oper label case search exist label index scheme section optim outlin section administr request label creat real integ coerc string coerc real index implement support inequ equal lookup lookup procedur similar procedur figur extend slightli accept label creat incom label price figur perform lookup valu incom edg result text index find valu satisfi basic comparison string valu style keyword search string amount text power index text index lore implement invert map word label list atom valu incom edg word creat administr reason outlin label omit full search lookup return list post form post object nth word incom edg label invert list store hash tabl disk kei lookup object atom string word incom edg perform figur result fh ig lore support index type section queri plan oper oper queri support addit text search featur link index support pointer oem mechan retriev parent object label lookup object label return parent edg support lookup case parent label return implement extend hash equal lookup support select creation creat entir graph locat atom object word lookup parent subobject connect label lookup object return parent object lookup object return object section queri plan oper support find ancestor object reach compon gener path express includ regular express oper path index find object reachabl label path import part queri process lookup path return set object reachabl lore index path begin object regular express easili store set reachabl object path lore dataguid dataguid dynam structur summari path point time addit provid kind dynam user dataguid store oid statist object reachabl path begin algorithm comput increment maintain dataguid queri simpli appli figur explor directli locat object reachabl lookup oper return queri path addit limit queri obtain object path addit end path detail db exist figur object assign queri plan index queri plan lore system tree queri oper describ specif sequenc step answer queri iter approach queri execut begin top queri node plan request tupl time children perform oper node complet pass result tupl parent oper object oa oa simpl data structur slot rang variabl addit slot depend form queri slot oa hold oid node data path consid queri engin figur oa detail point queri slot current oa necessarili valid goal queri execut build complet oa valid oa reach top queri oid slot construct compon queri result queri oper briefli explain kei queri oper queri relat index oper number argument oper produc result argument oa slot result oper produc result affect flow control execut plan index structur introduc section queri oper support lookup oper queri execut oper simpl index structur discuss oper detail add addit capabl index support data queri plan oper find parent object oper find ancestor object reach match path compon gener path express find ancestor reach path match path label edg oper stack object visit order match sequenc edg support full regular complet automaton oper data add power simpl search oper text pattern destin oa slot oid match string atom object incom label pattern defin ffl word phrase match string match word phrase iff word phrase oper support match ffl match string match iff match match phrase string word ffl oper string match iff match ffl oper string match iff match ffl oper string match iff match function simpl subset offer web search found practic speed larg class common queri string text valu addit index oper perform standard task queri process complet detail scan oper return oid subobject object path express accept object compon path return set object reachabl start match scan oper match path regular express oper simpl stack select oper ident relat oper relat join oper coordin left children partial complet oa left child child call exhaust oa left child instruct retriev oa iter continu left side produc oa project oper limit object return set oa select oper appli predic object identifi oid oa slot aggreg oper implement standard aggreg oper existenti quantif high aggreg oper call child store result temporarili comput aggreg increment child produc valid object creat final object identifi target oa slot aggreg exist oper add true existenti quantif satisfi filter oa quantif true occur select oper immedi aggreg node note exist aggreg oper find satisfi aggreg oper oa queri plan present lore queri plan exampl numer plan lore includ tradit queri optim plan select select aggr scan scan select project scan join join scan join scan join select aggr figur plan queri detail focu describ queri plan exploit index recal queri introduc select exist exist oa structur queri shown figur notic result aggreg oper specif oa structur creat queri plan oa figur work queri plan explain queri plan strategi introduc section queri exploit index attempt match path provid bind handl similar final result return execut strategi reflect queri plan shown figur left top join node handl scan object db result object scan scan oper movi subobject place result scan retriev movi titl subobject actor subobject current scan select oper find subobject object satisfi existenti queri plan section note project join join join scan join figur plan queri queri plan test existenti condit actor subobject exist satisfi existenti condit queri plan perform poorli movi case path unnecessarili queri plan queri plan lore index structur index oper refer figur plan left join oper satisfi oper find atom object incom edg oper attempt match backward edg actor start object identifi oper oper existenti ensur object pass parent match movi edg oper confirm parent movi object object accomplish oper queri request titl subobject scan oper obtain titl queri plan perform poorli object incom edg reachabl path hybrid queri plan advantag combin techniqu singl hybrid plan benefici locat object satisfi oper continu join scan scan join project intersect figur hybrid execut strategi prefer hybrid queri plan identifi object satisfi fashion simpl select ab exist xc queri plan figur strategi visit leaf singl satisfi predic strategi identifi singl object satisfi unnecessarili visit node upper portion hybrid plan execut find object satisfi execut obtain set ab final intersect good queri execut strategi hybrid queri plan shown figur notic intersect oper split execut full text path index illustr text path find movi titl descript subobject word word queri written lorel queri oper function text index select figur present hybrid queri plan left subplan intersect oper identifi parent object connect edg titl descript child word word child intersect oper identifi object reachabl project join intersect figur queri plan oper path found oper intersect result gener subplan produc answer queri paper present manag index dbm semistructur data provid gener framework index valu presenc automat type coercion lore structur introduc queri plan lore make index index index queri queri plan paper fulli implement lore system preliminari perform result order magnitud improv observ wide class common queri index queri process refer wiener lorel queri languag semistructur data intern journal digit april bertino optim queri path indic intern workshop research issu data page februari moerkott evalu queri gener path express acm sigmod intern confer manag page june time constraint prevent includ full perform studi conduct studi result ad final publish report yu index select scheme nest object hierarchi twentieth intern confer larg data page septemb strong extend hash fast access method dynam file acm transact septemb fernandez suciu optim regular path express graph fourteenth intern confer data februari graef queri evalu techniqu larg acm comput goldman widom enabl queri formul optim semistructur intern confer larg data page august dale index techniqu kim fh chapter kemper moerkott access support index method object base inform widom manag system semistructur data sigmod septemb mchugh widom queri optim semistructur data technic stanford widom object exchang heterogen inform sourc eleventh intern confer data page march widom queri semistructur heterogen inform fourth intern confer deduct page decemb ramaswami kanellaki oodb index sigmod june gerard salton automat text retriev inform comput stonebrak postgr manag system commun octob seshadri effici index structur object orient twentieth intern confer larg data page septemb xie han join index hierarchi support effici navig objectori twentieth intern confer larg page septemb
AI/663 2 discov interest associ rule medic data carlo cesar de colleg comput radiolog depart colleg comput georgia institut georgia institut technolog hospit technolog abstract present explor idea discov associ rule medic data technic aspect make problem challeng case medic data set high inform content exist time imag attribut data record gener noisi explain map medic data transact format suitabl mine rule combinatori natur associ rule match current algorithm unsuit introduc improv algorithm discov associ rule medic data incorpor import constraint interest result obtain program discuss explain program paramet set problem domain introduct data mine activ research area popular approach data mine discov associ rule associ rule gener censu data medic data gener analyz classifi regress excel survei techniqu consult work explor idea discov associ rule medic untri approach import featur associ rule combinatori natur discov pattern subset attribut pattern discov current work support grant lm nation librari medicin algorithm redund irrelev describ trivial knowledg goal find rule medic interest minimum support confid research project discov rule valid rule expert system aid heart diagnosi discov rule relat heart enrich expert system knowledg moment rule expert system discov valid group domain expert paper continu previou joint research georgia tech discov knowledg medic data predict heart associ rule preliminari result justifi medic point view neural network predict imag base stress imag paper provid gener framework understand approach problem face domain work isol problem interest commun research associ rule contribut paper outlin main contribut work includ explain mine medic data associ rule interest problem justifi associ rule medic domain phrase problem gener manner work appli domain explain rule discov straightforward approach redund complex simpli make medic identifi constraint make associ rule medic domain algorithm discov constrain associ rule low support fairli high confid identifi open problem requir research paper outlin section state definit associ rule address problem map medic data binari attribut treat item small motiv associ rule medic field explain kind rule section outlin classic algorithm mine associ explain main difficulti encount associ discuss constraint present improv algorithm theoret result relat work briefli explain result medic data set section section paper data map interest rule associ rule give classic definit associ rule ft set set fi associ rule implic form ae call call consequ rule set consequ call itemset itemset measur statist call support itemset ae fraction transact rule measur strength call confid defin ratio problem mine associ rule gener rule support confid greater equal prespecifi minimum support minimum confid gener descript medic data medic data set mine describ profil patient hospit treat heart record correspond relev inform patient profil person inform measur patient heart blood includ preexist exist store diagnost made medic doctor technician includ time attribut involv medic histori date complex set measur estim region healthi region qualiti number summar patient heart effort stress relax condit final imag inform region heart store binari data imag data summar heart divid number region vari type data rich inform content map attribut medic data transform transact format suitabl discov associ rule medic data time imag attribut make problem simpler treat attribut categor numer fr ng relat tupl valu categor numer data set size process attribut time map seri consecut integ treat item explain miss inform manag reserv integ miss inform categor numer valu import creat item miss inform medic variabl miss valu common map incorrect interest doctor analyz miss inform track error treatment miss inform complet case miss person case record field miss inform challeng reliabl rule involv attribut equal miss inform data set small import account sampl discard record miss valu conduct research find rule involv miss valu data tabl categor attribut easili map item associ integ categor categor good candid rule problem cardin attribut domain uncommon medic data binari attribut special case occurr interest interest assum medic doctor decid categor valu relev import type attribut numer simplifi problem time imag attribut uniformli treat numer attribut associ rule numer data attribut partit interv index index gener rule import work deal problem author prove partit minim gender ag smoke tabl origin medic data ag ag tabl map tabl inform loss case techniqu medic doctor tend idea partit rang interv semant gener cutoff point weight classifi adult patient similar manner convent person adult respect ag rang manipul domain expert prefer partit quantit attribut interv make result interpret easier automat partit discard task autom relat back domain knowledg assum domain expert map attribut seri item categor attribut relev categor valu item includ miss inform numer attribut partit number interv map item map algorithm discret problem data provid small medic field patient tabl tabl map medic data item origin tabl medic attribut map item tabl data convert item transact format refer map tabl translat tabl note identifi attribut ssn includ irrelev mine exist privaci polici restrict access ag numer attribut gender smoke categor attribut column store percentag heart specif obtain complex measur mean mean left anterior descend stand commonli accept cutoff point equal import case import divid rang analyz greater detail map procedur map tupl origin data tupl transact item result tabl number column origin column integ correspond index map process stress binari vector ineffici data high potenti high number categor valu categor attribut number interv numer attribut discov interest associ rule reader read subsect carefulli motiv algorithm describ section medic import associ rule discuss rule interest previou column origin tabl inform heart reader guess relat absenc presenc heart ag smoke gender interest rule support confid detail profil peopl problem rule ag smoke medic interest doctor relat ag smoke habit rule impact factor heart rule irrelev rule smoke irrelev make medic relat viceversa associ irrelev medic doctor trivial heart region adjac region high likelihood rule rule includ item interest rule male ag smoke interest reason involv heart region extrem select involv item patient data high rule discov current algorithm involv medic field experi shown rule medic variabl hard interpret slow mine task potenti relev medic doctor discov rule medic data present import contribut outlin wide algorithm find associ describ problem face final improv version algorithm algorithm mine associ rule problem mine associ rule gener rule support confid greater equal prespecifi minimum support minimum confid classic algorithm ffl phase itemset support user minimum support gener itemset call frequent itemset infrequ refer itemset element gener candid turn frequent comput support gener check support gener test size itemset increment iter iter requir scan transact phase stop frequent itemset ffl phase frequent rule minimum confid gener frequent itemset ae minimum rule valid rule problem associ rule summar main difficulti isol discov interest associ rule medic domain problem solut gener constraint describ problem abstract manner mention word refer map medic field previou section map record medic inform patient complex impli associ rule interest domain expert item consequ note interest rule matter item associ frequent item prune uninterest rule support prune uninterest associ confid prune uninterest rule rule high confid forbidden item consequ item constrain specif part rule associ size associ rule involv item hard interpret potenti gener high number rule slow interact process user default threshold associ size approach exhaust find rule threshold domain produc huge amount rule biggest size found associ practic bottleneck algorithm perform support frequent st ae frequent frequent itemset includ easi matter effici algorithm approach slow larg case produc rule render result useless reason limit size rule st ae rule interest simpler higher support ae rule higher confid lower support associ uninterest combin item case combin trivial high support data set item associ fi interest associ st ae interest item group domain expert discard uninterest associ group mean item relev matter item assum small group identifi automat run straight associ rule algorithm previou knowledg maxim frequent itemset scheme effici search longest frequent itemset subset case limit size associ automat discard possibl find longest subset search domain low support support perform bottleneck associ rule desir run algorithm low support repeat run support avoid desir algorithm run support constraint prune search space avoid find rule involv transact noisi data problem tackl associ rule program run transact data assum complet correct case transact miss inform algorithm avoid cost return predict rule involv miss inform justif rule reliabl interest track error mine tupl miss investig problem high support algorithm prune rule work high data lot rule involv item high support problem identifi quantit associ basic high number combin partit interv idea algorithm maximum support threshold theoret result proof omit breviti extend item attribut constraint fi set item mine fc set consequ constraint item constraint item consequ defin function ac make refer constraint fg gm set group constraint posit integ item constrain belong group item group defin function group note make simplifi assumpt item belong group face case item belong group complic algorithm obscur user aspect requir research fi lemma itemset constraint lemma constraint prune associ rule gener phase improv associ rule algorithm requir algorithm basic notat definit section maximum number item rule xm frequent itemset obtain phase ffl phase gener candid make pass tn comput support extend frequent item belong frequent candid check support candid make pass transact itemset st input iter frequent itemset stop phase ffl phase xk valid lemma frequent itemset assum prune associ lemma valid rule item constrain discard rule lemma prune associ base constraint lemma state algorithm advantag constraint phase lemma number prune associ maxim frequent itemset big case produc speedup make comput interact lemma idea number discard tight bound relat work literatur associ rule extens introduct semin paper space constraint imposs compar approach approach basket data medic data set complex present challeng paper incorpor idea previou work mine rule segment imag paper publish literatur concentr optim phase problem improv rule gener algorithm summar associ attack problem insert transact mine set algorithm increment maintain associ scheme identifi true correl metric call convict identifi strong find approach interest work share similar author algorithm constraint includ exclud item associ gener focu type item constrain hierarchi associ includ item approach limit hierarchi item mine medic rule work address constrain problem gener approach base constraint queri orient deal rule rule noisi data author support idea find complex rule discard simplif frequent itemset effort improv rule develop bayardo al give good overview theme show support confid fundament metric develop metric decid constrain associ rule maintain simplic improv easi incorpor essenti chang basic framework evalu work preliminari present extens experi assess qualiti result perform space constraint present experi result tabular form graph experi run sun multiprocessor comput sparc run comput mb main memori disk arrai gigabyt storag space algorithm implement languag medic associ rule goal experi relat measur vessel valid actual diagnosi rule expert system case find rule confirm valid medic knowledg data set consist patient attribut import medic select mine attribut includ measur region heart heart vessel vessel measur quantifi deviat heart region region normal heart normal valu region mean deviat comput vessel identifi acronym mean left anterior descend stand left numer attribut measur percentag vessel numer attribut refer vessel partit mention finer partit import case requir constraint associ rule mine program set region constrain heart constrain consequ studi vessel separ group constrain attribut belong group group pair rule size set simpl rule singl item consequ data set small find associ involv patient set find confid rule set rule confid lower consid irrelev rule confid greater consid reliabl note valu threshold low constraint imposs set threshold low valu number potenti associ ran associ rule program paramet program er associ rule rule interest equal import explain detail relev rule order rule relat vessel import rule rule normal support high confirm medic opinion heart defect anterior region rule lower support equal lower equal rule confirm expect relationship region heart vessel rule rule higher support confid confid lower medic doctor expect open set question program discov rule consid import rule confirm predict rule store expert system support confid measur close expect rule higher support lower confid expect rule medic doctor challeng confid factor specif rule expert system data mine valid knowledg perform evalu medic data set record dimens work project data subset medic attribut previou subsect experi perform pessimist condit domain expert opinion tent set valu long describ ran experi threshold associ size vari minimum confid minimum support measur execut time program run constrain number associ low support grow exponenti report tabl note valu number show rule low support high confid note number associ point optim phase perform result larger data set set paramet result summar tabl assoc rule time sec tabl result medic data time sec tabl time larg file access medic data set difficult number reason moment patient file record decid replic time larger file problem complex constant medic data typic transact file benchmark associ rule program gener synthet data benchmark approach worthi futur research case fairli larg medic data set exist interest appli idea domain larg complex data set research effort make associ rule medic data scheme mine main appeal associ rule simplic improv simpl associ rule combinatori spirit isol combin interest domain briefli address problem map complex medic data item constrain associ exclud combin item constrain rule item item consequ limit rule size higher confid higher support rule modifi algorithm faster find fewer rule tend relev aspect deserv research autom map attribut relat partit back domain examin problem noisi data close identifi constraint group consequ extend group contraint includ group manner run support prune strategi report support confid optim rule gener phase associ rule domain transact data present case medic domain associ rule expect research issu complex real life domain refer rakesh tomasz swami mine associ rule set item larg acm sigmod page rakesh agraw ramakrishnan srikant fast algorithm mine associ rule larg roberto bayardo effici mine long pattern acm sigmod roberto bayardo rakesh agraw mine interest rule acm kdd roberto rakesh rule mine ieee icd sergei rajeev lawrenc terri winograd market basket gener associ rule correl acm sigmod david jiawei vincent wong mainten discov associ rule larg increment techniqu ieee icd david carlo edward russel cesar de data mine larg improv diagnost make journal nuclear de garcia analyz predict imag neural network approach proc visual rakesh expert system interpret expert system fayyad data mine knowledg discoveri mit jiawei han fu discoveri associ rule larg vldb page swami mine associ rule technic report rj octob bing yime ma prune summar discov associ acm kdd raymond jiawei han exploratori mine prune optim constrain associ rule acm sigmod carlo edward omiecinski discov associ rule base imag content ieee adl edward navath effici algorithm mine associ rule vldb page septemb rajeev motwani sergei jeffrei shalom tsur dynam itemset count implic rule market basket data acm sigmod ramakrishnan srikant rakesh agraw mine gener associ rule vldb page ramakrishnan srikant rakesh agraw mine quantit associ rule larg relat tabl acm sigmod ramakrishnan rakesh agraw mine associ rule item constraint acm kdd
IR/664 5 flexibl feder digit librari marco andré robert franc edward fox depart comput scienc virginia tech va usa abstract feder digit librari heterogen inform servic provid user integr view collect inform paper discuss feder system network digit librari dissert intern consortium support institut electron dissert feder requir deal flexibl differ data format respect inform autonomi solut involv adapt digit librari system marian serv mediat middlewar feder collect compon solut integr harvest architectur base objectori ontolog search modul reconcili harvest data join singl collect view integr framework address question data flexibl effici scalabl introduct network feder digit librari possibl heterogen inform distribut internet goal feder provid user integr view sourc inform challeng face includ digit librari resourc discoveri site issu data fusion result uniqu rank paper focu challeng field digit librari heterogen occur inform address basic semant feder digit librari heterogen major problem network digit librari dissert intern feder support institut effort relat electron dissert characterist complic member member manag servic scholar member report collect updat metadata central coordin minim sourc provid uniqu urn metadata record store support standard protocol member differ repositori charact natur data semi user capabl massiv amount data member eventu aim support produc member constantli ad continu flow data dissert submit due natur site select process found system small number candid import queri result mathemat retriev inform member feder remot search local union transpar involv reconcil heterogen integr inform sourc level common architectur deal problem mediat wrapper mediat export common data model provid common queri interfac wrapper overcom barrier heterogen produc queri wrapper translat result sourc mediat data model mediat architectur approach system integr union archiv feder search union archiv approach inform period extract merg inform load central data store union archiv queri pose local data interact origin sourc main advantag approach adequ perform queri time union archiv deliveri current inform user concern data qualiti consist address feder search data remain sourc queri integr system run time queri sourc data replic fresh queri time sophist queri optim fusion techniqu requir perform drawback factor consid network latenc amount data perform bound situat paper present digit librari demonstr modular flexibl data power search mechan creat feder system address problem due poor inconsist network connect global variabl server load complex queri translat heterogen chosen union archiv architectur integr system compon solut integr harvest mediat union archiv collect base ontolog search modul collect view mechan network compar integr framework address question data flexibl effici scalabl uniqu characterist system build common integr solut insid unifi framework marian digit librari system marian search system digit librari origin design librari successfulli collect vari size enhanc support digit librari semant web applic marian data model combin power concept structur relationship marian collect captur form inform network explicit node link similar model proven effect repres data web document translat dl system marian expand model insist node link collect graph member class class organ method similar link label semi strictli power form full lattic subset support inherit node collect graph instanc inform object support complex behavior support approxim match sort pioneer inform retriev system node link weight repres suit descript fulfil role marian special search distribut larg graph inform object output search oper weight set object relationship extern proposit encod weight set weight probabilist reason fuzzi set theori model ground firmli framework weight set oper extend entir marian system data process abstract marian achiev physic logic independ common concept field neglect ir current ir system physic level term index weight make difficult integr system conceptu level flexibl data model semistructur knowledg ir power smooth combin number success concept field program languag artifici intellig harvest approach union archiv approach mechan gather harvest data combin gather data section cover harvest section describ architectur combin harvest data electron dissert archiv form file author includ multimedia materi difficult imposs includ print public de facto standard emerg site requir structur titl page serv directori document file conveni point collect publish metadata titl page metadata creat minim site addit metadata ad train catalog harvest metadata control uncontrol creat imag site union archiv current work feder dl assum homogen structur protocol singl mean harvest html document work paradigm harvest data heterogen includ paradigm open archiv initi harvest tm varieti data harvest approach approach differ support requir sourc archiv open archiv initi project address archiv digit librari defin simpl protocol exchang metadata current technic infrastructur express metadata harvest defin mechan archiv export metadata framework promot effect partial solut archiv implement protocol export metadata support creat solut distinct data provid servic provid manag resourc act behalf author submit document creat servic base data archiv harvest tm system set integr tool harvest inform repositori build content index architectur system base main gather broker gather act direct crawler collect extract index repositori extract summari content specif proprietari format broker provid index queri interfac gather inform retriev inform gather broker increment updat index metadata standard extern metadata standard dublin incorpor face situat specif wai gather data sourc exist sourc specif combin servic harvest data obviou drawback ad hoc requir develop specif solut strongli depend sourc union archiv prototyp union collect harvest metadata format tabl summar characterist collect harvest protocol record metadata format harvest marc tabl collect prototyp union archiv characterist differ institut particip differ document format access protocol standard format access protocol document metadata adopt standard encourag time complet standard place current union collect cope multipl protocol collect support document attribut repres attribut structur data similar structur structur similar semant marc record vt collect make strong distinct person corpor field dublin core record document collect repres dublin core includ describ subject list automat extract keyword heterogen dimens induc level concern involv differ harvest includ aspect data involv complex relat present uniqu characterist marian build architectur attack level sourc descript wrapper gener harvest protocol wrapper german collect marian mediat middlewar wrapper dublin wrapper wrapper core open archiv protocol marc protocol protocol vt search servic recommend analysi index link collect local data store queri result greek dissert collect fig union archiv architectur architectur librari user mit collect architectur system present fig marian mediat middlewar tool structur semant system syntact differ address wrap sourc special softwar modul languag declar specif digit librari describ capabl remot collect intern document structur inform feed data structur insid mediat gener wrapper harvest sourc extend servic visual built top middlewar system syntact harvest process serv devic suppress differ sourc system index system syntact homogen textual inform languag encod local homogen standard unicod harvest metadata remot collect built local imag treat local data unifi set text index retriev tool document text field bodi reduc individu term set match queri search algorithm rank formula ensur smallest atom text receiv uniform treatment bodi titl abstract individu head keyword set person subject titl note titl person corpor subject entri individu subject keyword set confer composit subject figur imag mit vt marc vt repres class network link downward link structur mediat map heterogen data sourc common data model current approach data network overcom structur captur structur remot collect faithfulli figur repres document structur collect contrast network node link give major advantag singl global searcher entir node link partit class manag mark search complex index search regard function aspect capit regular class hierarchi class search mechan provid basi phase resolut semant semant semant heterogen solv exploit marian semant function collect view ontolog node marian inform network simpl atom scalar complex inform object inform object support method proper class inform object marian support method approxim match queri marian treat titl text special sort natur languag rule sentenc treat sequenc atom string match method vari class class function object descript calcul close match descript return weight class manag draw method provid search function object return weight set object class match descript marian stock match function searcher number common inform object sampl shown figur part hierarchi class marian step bring document collect semant match function searcher object collect class manag searcher special version easili creat inherit inform object match function case stock searcher algorithm provid method follow api object descript weight weight set object local imag defin member collect view construct involv defin map member collect class support view map combin inherit weight remaind paper concentr mechan proven power creation synthet weight superclass fortun complementari effort develop metadata standard electron dissert map inform network standard stabl view world union collect subset view present figur thing simpl show attribut descript view ontolog consist class object individu link individu class subsum person corpor subject class cover treatment map view underli structur modifi seamlessli titl descript bodi subclass subject subclass head keyword set individu subclass individu figur collect view abstract data retriev usabl case view collect shown figur map make weight superclass construct construct assert member specif class member view extent count class member subclass case subject subclass relationship weight reflect author descript section discuss weight address data qualiti issu simpl construct synthet superclass weight subclass handl found strikingli effect combin heterogen collect merg ontolog direct approach combin collect imag union collect depict figur solut involv fair amount redund sourc imag includ class individu subject redund design ontolog union titl descript subclass head keyword set individu person subject subject subclass subject keyword set individu subclass individu subject entri composit subject corpor figur direct approach union collect relat view imag figur embodi extrem imag complet separ relationship tie object class approach disadvantag data object subject head class redund wast storag space class retriev time multipl class search immedi forc harvest data collect view process incom document structur singl titl singl descript type individu singl type subject keyword list class subject string disadvantag forc person confer combin field unlik bodi field singl loss index specif lose inform individu subject head control vocabulari pre incom data collect view ontolog give abil adjust chang circumst imag remot collect longer reconstruct raw state mo origin structur react origin addit semant requir vt titl descript mit vt vt subject individu subject entri corpor individu person keyword set composit subject figur sensit approach union catalog semant similar object class overlap extrem li merg imag class suffici similar class separ semant figur show approach imag union collect document hierarchi individu class analyz class person corpor dublin core author field marc requir human map link person marc field produc link corpor class class imag format make uncontrol author field collect similar breakdown subject superclass individu subject composit string multipl set keyword imag class type subject field union collect approach simplifi union collect benefit administr time effort save string storag retriev time add function solut analysi combin class structur enabl respect data harvest provid simplifi virtual collect view user make easi chang collect ontolog underli data chang view present chang view present user restructur underli data unifi framework enhanc retriev effect union archiv system provid flexibl configur prioriti underli data properti essenti solut data qualiti issu data qualiti issu correct anomali occur insid integr union archiv improv effect servic exampl anomali includ error multipl weight scheme mitig data qualiti discrep collect good weight enhanc data qualiti text class view correspond class underli dublin core class uncontrol class observ data dublin core text qualiti uncontrol text superclass searcher capit give weight dc subclass descript superclass depend heavili bodi attribut dc uncontrol descript observ bodi text document content weight tune experi union collect empir experi effici marian class manag function searcher object class searcher union archiv standard superclass text structur document weight absolut link searcher searcher design optim effici inform search costli oper inform incom set achiev perform capit observ link text digit librari object network follow distribut marian searcher design run effici input follow distribut searcher marian commun design work requir return element request design element develop searcher highest weight lazi evalu greatest simpl search author human interest digest dozen object marian searcher collect million object ten million notic virginia tech academ librari time simpl queri collect size compar net remain accept complex queri research measur perform collect hundr million verifi model implic searcher effici scalabl abil transpar effect grow major concern platform base integr ext sourc import larg capac scalabl queri process abil incorpor sourc analyz object repres marian queri repres relax graph process structur element marian queri distribut govern class manag class manag disassembl portion queri part handl pass author titl search entir collect begin dissert class titl portion queri handl author portion pass link class manag pass oper find match peopl corpor individu class manag queri process avoid evalu bottleneck easili extend easi incorpor sourc achiev mechan gener wrapper harvest tremend facilit creat wrapper commun mediat contrast wrapper dl queri process wrapper orient schema ontolog languag formal basi design automat gener digit describ extern capabl harvest describ extern sourc metadata structur correspond harvest protocol scenario sequenc occur sourc templat wrapper configur period addit mirror maximum number harvest act wrapper union origin craft successfulli gener automat descript refer data relat semistructur data xml morgan integr digit commun pp harvest inform discoveri access comput network isdn pp specif web site vldb journal rk modern proc int acm sigir pp rk axiomat approach similar intern virginia lt ea ra usabl digit librari search corr techniqu sigmod record pp probabilist relat algebra integr inform retriev transact inform vol pg approach select network acm transact inform system data abstract network inform retriev inform process manag rank heterogen internet proc intern confer larg pp scenario formal model digit digit librari connect collect acm digit lagoz open archiv proc joint confer digit inform retriev standard part strateg view present april mediat infrastructur digit librari proc acm digit san migrat wrap applic schema transform er global inform introduct research sigmod record digit librari commun acm pp digit librari recent progress proc acm digit pp al jc server avail ncstrl digit proc acm conf digit librari june pp data chang inform commun pp semant web small dynam network order princeton univ architectur futur inform pg
HCI/665 4 mit media laboratori perceptu comput section technic report ieee iswc visual contextu awar wearabl comput thad bernt alex pentland media massachusett institut technolog ma abstract video camera enabl style wearabl comput interfac process power wearabl comput spend time observ user provid serendipit manag interrupt predict futur directli command user paper introduc assist plai game patrol assist track wearer locat current task comput vision techniqu infrastructur paper continu augment realiti start bind virtual data physic locat introduct comput virtual realiti techniqu mean input directli user wearabl comput offer uniqu opportun technolog recov gener user context wearabl comput potenti user user experi life user contextu user inform lead intellig fluid interfac physic world part interfac import context commun interfac physic time mental model particip critic convei inform mood anecdot nichola book illustr walk mr famou outdoor art doubl open air museum dinner mr mr join mr privat male secretari spoke perfect spoke start express great interest work alexand calder told mit person experi great artist secretari listen stori translat begin mr listen attent mr emit male secretari impress work calder mr recent acquisit circumst wait minut continu meal translat repli translat lengthi explan build person good mr secretari expand contract signal function environ intim liter redund occas subtleti stori physic locat parti object work calder agent translat english spoken augment mr abil agent predict mr repli base model tast person histori mr agent fill detail base model interest knew imagin mr secretari model employ perform function prevent attend complic detail priorit inform base relev knowledg social grace mr interrupt concern phone call upcom meet comput interfac long term goal address paper section show comput interfac contextu awar machin vision techniqu section describ import object identif combin virtual environ wearabl comput physic environ user section detail locat user provid salient cue current context section describ implement determin locat infrastructur context game patrol mean determin user current task patrol discuss section identif relev object distinct advantag wearabl comput coupl virtual environ physic world determin presenc locat physic object rel user import problem object uniqu user wearabl comput note presenc assign virtual properti object hypertext behavior assign object base physic locat form ubiquit comput concentr infrastructur wearer reduc cost avoid privaci issu object identifi number wai radio frequenc identif transmitt tag uniqu id attach object track uniqu id read special devic rang inch mile depend type size tag method requir amount physic infrastructur mainten place read tag comput vision advantag rfid obviou obviat tag object track advantag comput vision adapt scale rang hardwar softwar recogn build depend distanc camera object comput vision direct comput identifi object field view camera align field view camera field view comput observ object focu user attent figur multipl graphic overlai align visual tag track mit wearabl comput project comput vision identif creat hypertext demonstr platform shown figur system process power maintain feel wearabl comput send video sgi wirelessli visual uniqu identifi activ object tag consist red squar bound pattern green squar repres binari number uniqu room similar identif system demonstr nagao rekimoto system visual pattern robust presenc similar background color distinguish visual field object textur map movi render top user visual field displai shown figur visual tag height visual track code recov orient provid inform graphic process graphic object rotat zoom match counterpart physic world result thought extens world wide web system give media lab activ led passiv tag past camera detect comput small red arrow top object indic hyperlink user interest link turn object label text user approach graphic textur map movi render object demonstr function user overwhelm walk room explor interest object leisur idea continu develop system demonstr visual tag unnecessari sophist object recognit system section gestur emploi determin user locat head orient locust indoor locat system inerti strong prior establish object visibl similar methodolog gp lessen burden vision system distinguish potenti object user dai hand visibl hypertext system tour citi museum creat commun provid mean share annot physic world asynchron peopl similar architectur student high school biologi class reliabl access wireless network system mainten hidden physic electr wire ar system navig guid task remind mental handicap recognit perform hardwar cost applic found comput patrol task attempt test techniqu laboratori constrain environ patrol game plai mit student weekend campu build particip divid team denot color head band particip start rubber dart gun small number dart floor team converg floor hunt shot particip remov head wait fight proce floor replac head band return formal goal shoot member player maintain number player shot versu number time shot team hold patrol provid entertain test robust wearabl comput techniqu apparatu hand track sign languag recogn quickli appar gestur action patrol provid defin languag goal structur harsh environ patrol project section discuss current work determin player locat task apparatu apparatu patrol task perform camera larger camera point watch hand bodi smaller point forward observ user camera fit widest angl len figur show sampl imag hat camera requir attach control backpack video video combin channel video signal map channel quadrant screen output record provid comput run featur detect refer video tape result backpack larger desir wearabl comput hour patrol session figur camera patrol hat extend version apparatu test ident hat hand player channel addit video wirelessli player record spare channel video instrument player fit microphon provid channel audio perspect figur patrol view provid interest data player harsh rf environ amount system locat user locat valuabl clue user context user supervisor import meet interrupt phone call emerg gather data user motion dai model model predict user locat long inform invalu network cach case user wireless network provid coverag campu outdoor posit perform relat global posit system differenti system obtain accuraci updat rate common indoor system requir method current system activ badg beacon architectur requir infrastructur higher accuraci infrastructur impli instal mainten patrol attempt determin locat base sole imag provid patrol hat equip patrol environ consist room defin strateg import player room boundari chosen simplifi vision task base long stand convent game plai plai area includ mirror imag copi classroom similar decor make recognit task difficult room distinct color lumin travel hidden markov model chosen repres environ due potenti languag structur excel discrimin abil vari time domain process room distinct region light model state hmm previou locat user limit current locat observ video stream minut physic layout path probabl chosen base observ data prior knowledg time spent area weight probabl hypothesi hmm fulli exploit attribut full review hmm reader hmm implement detail tutori color video patch construct featur vector realtim patch approxim center imag forward camera mean lumin pixel valu creat element vector patch vari significantli due continu head motion player patch deriv downward camera area front player rang averag hand foot motion patch repres color floor nose place rel downward patch sampl nose patch hint light variat player move room patch provid element featur vector approxim minut patrol video analyz experi process occur frame sgi miss frame fill simpli repeat featur vector point video subsampl frame creat manag size hmm analysi video hand annot system provid train refer transcript test player step video frame number area record data transcript convert entrop htk format train test minut area train hmm part statist grammar gener test weight room consid base current room independ minut area test note comput segment video area transit label area properli tabl demonstr accuraci method test inform accuraci rate report test train data independ test set accuraci calcul acc total number area test number area number area number area transit detect note error count accuraci larg neg accuraci shown entri tabl tabl patrol area recognit accuraci method train set independ test set hmm hmm hmm hmm hmm nearest simplest method determin current room determin smallest euclidean distanc test featur vector mean featur vector room exampl train set video frame surround point time compar room classif averag time spent area approxim video frame window smooth data result classif shouldnt chang due small variat frame insert larg neg accuraci shown tabl nearest neighbor method easi time durat contextu properti hmm improv recognit tabl show accuraci hmm test train improv state hmm result hmm overfit train data test independ test set show model achiev accuraci topolog hmm shown figur case accuraci test data train data effect due grammar limit transit area wrong turn system pass area converg correct path longer test higher potenti misl extend period time figur hmm topolog patrol accuraci evalu method import attribut system determin player enter area figur compar hmm nearest neighbor method video room design letter identifi conveni hmm system correct transit boundari nearest neighbor system oscil chang size averag window improv accuraci nearest neighbor system constantli chang pace patrol player necessit dynam chang window constraint significantli complic method larger window result distinct transit boundari area fs bs ms lb mz bh mz bh nu bh mz lb mz ms bs fs bs ms fs mz ms frame refer fs mz ms hmm nearest neighbor method figur typic detect patrol area transit mention strength hmm system collect evid time player path area differ incorpor context make determin test set segment area present isol hmm system face easier task system segment area recogn system achiev accuraci test data accuraci train data result strike evid import context task hint import context user activ current accuraci rate improv made optic flow inerti sensor limit frame process time player move forward elimin exampl move room current system combin optic flow drift inerti tracker window test data size averag room improv hmm accuraci averag color video color histogram featur vector techniqu appli creat automat map build patrol player explor user task identifi user current comput assist activ task displai time inform automat reserv resourc wearabl comput passiv simpli determin import potenti interrupt present interrupt social grace manner drive system alert user spoken summari wearabl comput present potenti caller user displai patrol task includ reload user action scan environ consid task execut simultan previou task section describ comput vision system recognit user task system base gener object recognit system recent schiel crowlei major result work statist base local object descriptor reliabl mean recognit object context patrol data system recognit imag patch correspond motion portion part background feed calcul probabl featur vector set hidden markov model recogn user task aim reload preliminari result section probabilist imag patch recognit schiel crowlei present techniqu determin ident object scene histogram vector local neighborhood oper show match histogram determin probabl independ scale rotat show robust approach viewpoint techniqu extend probabilist object recognit order determin probabl object imag base recept field histogram experi show small portion imag order recogn object correctli describ briefli local characterist techniqu probabilist object recognit system run approxim silicon graphic machin opengl extens imag convolut local characterist base gaussian recept field histogram construct vector linear filter schiel compar invari properti number recept field includ gabor filter local deriv oper experi show gaussian deriv provid robust recognit result work paper filter base gaussian deriv gaussian distribut deriv oe oe laplac oper calcul xx oe oe yy oe oe xx yy probabilist object context probabilist object recognit interest calcul probabl object local measur probabl jm calcul jm jon priori probabl object priori probabl filter output combin jon probabl densiti function object differ histogram object normal factor independ local measur mk calcul probabl object jm jon context local measur correspond singl recept field vector local measur correspond recept field vector typic region imag independ local measur minim distanc measur suffici larg experi minim distanc experi assum object probabl number object equat simplifi jon jon assum priori probabl jo calcul priori probabl probabl jon directli recept field equat show calcul probabl object base recept field histogram object tempt properti equat correspond mean probabl calcul arbitrari point imag equat appli object experi test imag object includ scale arbitrari imag plane rotat view point figur show result obtain filter combin dx dy lap scale figur compar probabilist object recognit recognit histogram visibl object portion approxim suffici recognit test imag result provid histogram visibl recognit rate error object portion histogram histogram inter probabilist object recognit figur recognit result object object recognit rate recognit rate visibl object task recognit hidden markov section shortli gener object recognit system basi comput vision system recognit user task mention recognit system recognit imag patch correspond portion arm part background order recognit system defin librari imag imag action chosen arbitrarili patrol imag split imag patch experi defin imag action appli incom video stream system calcul probabl probabl vector featur vector set hmm train recogn task user preliminari describ preliminari result recognit user task shoot reload aim shoot similar task action train separ hmm state order train hmm annot minut video data minut action reload action aim shoot model class sequenc action reload separ train set aim reload action sequenc train hmm interestingli action length tween remain action test set tabl show matrix action class aim reload aim reload tabl matrix task aim distinct respect reload arm stretch reason perfect recognit aim sequenc reload difficult reload action small region imag bare visibl preliminari result obtain perfectli segment data small set action properti hmm deal unseg data task vocabulari enabl languag context model appli level recognit singl task patrol context system suggest interest interfac player track locat deploi team maintain territori aim reload gestur recogn comput automat alert nearbi team member aid contextu inform subtli comput recogn wearer middl inhibit interrupt possibl person user aim simpl optic flow algorithm determin player scout area interrupt inhibit user comput provid inform prepar user rejoin game model creat hmm locat system predict comput weight import incom inform depend believ player move encount player room relev player move rapidli direct player comput predict area enemi visit alert player team inform invalu situat futur work bodi center camera machin vision exampl contextu awar interfac present observ comput aid task interrupt provid make predict futur behavior larger annot data set test techniqu patrol preliminari result addit method optic flow motion differenc ad determin user visual scan stair apparatu analyz video audio simultan player interact model system observ model everydai user task human human interact acknowledg jeff levin extend earli ar system shown part meng steve mann demonstr advantag wireless video prototyp interfac ken russel wrote origin ar open inventor graphic subsystem hall figur earli proof read refer augment realiti commun jack hidden markov model speech recognit edinburgh pentland dynam person enhanc realiti system number lam flynn intim comput support human memori inter symp gener human page levin target pose recognit graphic overlai master atkeson rapid prototyp mobil cyberguid case studi mobicom acm mann smart wearabl comput person march volum issu nagao rekimoto ubiquit spoken languag interact real world object proc inter joint conf artif intellig page machin learn user model master media septemb bit user cheap user model ibm system rabin tutori hidden markov model select applic speech recognit feb schiel object recognit recept field histogram phd juli english translat schiel crowlei recognit correspond recept field histogram technic report mit media perceptu comput decemb schilit system architectur mobil comput phd columbia schmandt voic commun comput van nostrand sharma comput augment realiti guid manual assembl starner visual recognit american sign languag hidden markov model master media februari locust locat messag system technic report mit media perceptu comput april present pentland augment realiti wearabl comput winter pentland american sign languag recognit desk wearabl video ieee tran patt anali mach hopper activ badg person interact comput object ieee tran consum feb weiser comput centuri scientif septemb young hidden markov model toolkit cambridg univ eng dept speech group entrop research lab washington
Agents/666 1 task agent commun lectur note artifici intellig pacif rim confer ai springer berlin task agent polici haddadi singh comput alberta ag germani abstract defin commun dialogu base strictli messag perform follow approach practic protocol support lengthi messag exchang requir infrastructur lend recognit agent intent joint task essenti global mechan ensur local global coher jointli maintain paper present gener practic approach engin agent simpl intent recognit creat complex protocol approach promot develop abstract task model design polici term model implement agent assist base idea briefli introduct interest agent polici speak rang matter manag lengthi messag messag convent respond dynam constraint environ concern research claim crucial function constrain messag argu map agent intent specif agent commun languag primit convei intent call polici stem belief solut matter found level individu messag primit perform agent commun kqml fipa acl semant perform constrain respect full illocutionari forc commun act interpret turn rise protocol orient view acl specif semant elev level analysi individu perform protocol crucial move set problem back level consensu primit protocol semant matter principl protocol maintain call local uniti short sequenc messag protocol specifi dialogu sequenc predict suffici respect specif goal task dialogu expand messag ensur global coher short messag sequenc crude patch fulli semant crucial individu perform full illocutionari forc messag sequenc constrain appeal call abstract task model compon publicli post abstract task model address element polici specif goal achiev polici manag polici paper primarili explic posit pragmat import realiz idea present implement simpl agent assist bdi architectur abstract task type intent abstract task type similar notion gener task support domainindepend methodolog architectur develop system explor notion agent begin commun exchang joint task agent explicitli share ontolog abstract task jointli ontolog ontolog actual domain medic diagnosi fault ontolog abstract task defin solut state defin movement state accomplish agent recogn begin exchang protocol initi progress task messag exchang stop adopt pragmat perspect intent commit specif goal pursu goal abandon intent move agent act impetu engag dialogu collabor agent order act intent drive intent make sequenc task global coher abstract task model support coher singl protocol defin intent goal gener strategi method achiev goal defin abstract task model serv constrain content individu messag defin messag call messag object legal intent agent progress task task complet address call local coher protocol unlik protocol restrict pair definit includ option messag type context underli intent unexpect context abstract task model jointli held agent agent design notion protocol mechan recogn intend abil evalu implic context resumpt current protocol notion crucial cooper argu theoret perspect solut impli work requir system sophist reason engin implement illustr handl flexibl pragmat limit enabl abstract task model methodolog motiv success refin search motiv applic call agent assist human driver varieti includ locat retriev inform entiti defin tupl applic suffici challeng assumpt larg human agent simpl queri singl human agent necessarili definit set constraint mind start search chang constraint messag multipl search interfac visual requir direct manipul present distinct term gener issu intent resolv unexpect shift initi gener relev commun dialogu english dba design agent design user food san francisco hundr restaur san francisco type food ethnic type hungarian french italian leav san francisco moment italian restaur concern analysi task level abstract gener support specif jointli held abstract task model includ dialogu illustr task model deriv dialogu analysi serv start task analysi pragmat specif task semant flow directli tradit view movement state state direct indirect correspond problem state formul requir goal test state path constitut problem specif initi specif oper function perform state produc successor state task action oper realiz inspect precondit match featur state inspect defin transform state successor state abstract task model success refin search formul messag object defin task domain entiti defin featur featur assign search set entiti satisfi set entiti search space object restrict comput action intent agent analysi action limit load defin initi search reduc search space addit constraint member expand search space relax describ inform member search search space set tradit oper augment capabl uniqu agent agent comput featur search gener oper legal action agent defin complet set task action agent commit correspond complet set task intent satisfact intent movement state comput problem contextu featur current task state partial order plausibl intent turn implic task oper crucial point task intent defin task oper execut object task state messag provid answer question pose messag shift direct task handl case protocol addit transit arc solut anticip adjac repres adjac condit arc defin semant complet protocol altern path protocol exit state reach present protocol shift part burden anticip recognit intent agent task express messag limit object crucial pragmat flexibl approach post recogn object serv circumscrib set task intent abstract task specif defin intent commit perform commun act servic task intent simplest agent inform agent recogn advanc task satisfi task task oper precondit delimit set object intent set intent defin task defin successor state agent form intent commun agent direct access fulfil role joint task task task action share specif particip agent part abstract task model abstract task model defin protocol level intent held agent part share polici messag content semant underli languag primit base number pragmat principl discuss primari concern syntact form messag content schemat format acl messag syntax addit paramet emploi outermost messag repres gener class messag make class inform tabl paramet refer sender gener actor refer receiv gener agent effect perform discuss constrain perform messag special class suppli inform relat result task action task action speaker hearer perform column tabl immedi expect perform dialogu initi perform column put inform tabl defin basic definit tabl perform combin outer perform perform immedi expect repli request provid inform suggest queri provid inform confirm inform suggest inform inform confirm reject request view request level commit request perform tightli coupl advanc task object request system action enabl search task begin load search specifi vector entiti identifi request perform concern constraint request made agent make progress search task accomplish prompt user agent inform order request agent suggest perform suggest refer task strategi accept reject agent suppli inform user commit comput request made user user simultan commit comput search space deliv inform execut user request provid perform accompani suggest provid domain featur search space set entiti current set tabl exampl agent agent request english tabl request queri messag restaur dba search dba dba locat dba dba restaur dba dba open hour dba dba queri queri advanc task exchang inform object agent domain knowledg includ rang valu includ queri avail inform entiti inform relev current state task queri confirm perform confirm express truth respect properti confirm deni queri user agent respond inform perform accompani perform queri domain current search member current search space inform inform messag outer content occur request queri dialogu complet crucial aspect analysi realiz messag object messag object content defin commit abstract task part polici protocol oper task intent concern advanc goal intent concern advanc inform support task intent import model task intent intent distinct state space agent proce task adopt intent send queri messag gather transfer control space suffici inform gather agent proce task space agent proce space answer receiv task intent form comput inform state transit task order satisfi intent transit state share inform protocol realiz oper space protocol defin structur exchang inform agent task protocol correspond task oper comput task successor state task protocol defin set input includ set output fulli defin successor state protocol similarli repres tempor contextu condit messag perform follow tabl task space distinct theoret practic import agent design support clean separ semant agent knowledg space satisfi semant progress task progress task space satisfi task implement assist built success refin search base abstract task model distinct outlin bdi style architectur put forward groundwork opportun provid implement detail abstract task specif support pragmat flexibl handl sanction immedi expect run protocol gener bdi architectur consist dynam memori hold current goal belief plan librari hold method action achiev intent structur correspond plan state execut activ due space assum reader familiar execut cycl architectur function partit dynam memori task space space task task protocol messag implement plan type plan invoc resumpt influenc prioriti scheme defin type plan invoc resumpt satisfact condit invoc condit condit trigger plan form instanc constitut goal adopt plan repres task intent trigger intent immedi pass control task protocol satisfact condit satisfi inform foreign agent intent give rise task intent pass control protocol initi messag exchang user plan bodi protocol protocol formul send messag post expect repli dynam memori protocol id suspend messag messag handler plan determin protocol wait suspend thread recent suspend protocol expect messag type receiv resum execut success complet updat space resumpt intent complet transfer inform current state task intent resum check satisfact condit met plan bodi set intent incom messag recogn expect messag wait messag handler dynam memori arriv messag unexpect local context execut protocol resolv global level intent task plan plan librari trigger agent handl flow illustr sampl multipl dialogu turn shift task applic domain admittedli intent plan librari task protocol relat work discuss research semant realiz complet condit correspond idea semant abstract task intent task intent concern advanc belief current task protocol call servic intent separ commun semant task semant argu clean separ task believ clarifi effect messag exchang local effect complet messag exchang protocol effect space acl semant base joint intent mutual belief theori axiom intent belief jointli messag exchang model post condit satisfi intent accomplish complet protocol extend effect successfulli execut space task task space pitt mamdani present semant includ call agent procedur comput chang inform state content incom messag perform utter context protocol pragmat realiz aspect semant current implement abstract task design relationship task commun act suitabl present abstract task specif download polici examin matter agent role function abstract task specif numer control difficulti result repres intent protocol reactiv recognit intent balanc sequenti reactiv element system architectur soar problem space spawn problem space oper architectur support clean separ task semant problem solv approach intent advoc pragmat approach determin intent base task specif agent jointli share approach serv constrain messag agent send task level reduc burden constraint individu perform protocol level step coher messag base directli trace global task part public polici specif acknowledg work support part nserc research grant refer gener task level abstract knowledg engin int studi commun action artifici agent bradshaw softwar aaai menlo park bradshaw implement polici autonom agent workshop implement autonom agent commun cooper agent pragmat theori lectur note comput berlin york semant agent commun languag read agent morgan san ps architectur gener intellig artifici intellig polici except bradshaw implement polici autonom agent workshop procedur approach control proc int conf ai plan aaai menlo park commun protocol system bradshaw implement polici autonom agent workshop bdi theori practic tech rep australian artifici intellig design polici joint intent theori proc int conf franc ieee artifici languag collabor proc int conf art intel aaai menlo park
Agents/667 1 model state art depart inform school busi administr pob yugoslavia abstract major characterist develop broad field artifici intellig integr ai disciplin number comput scienc field technolog develop intellig start tradit inform system modern distribut system internet paper survei knowledg model techniqu receiv attent recent year develop intellig ai research techniqu theoret practic part paper present major theoret architectur design research issu part discuss practic ongo project implement techniqu part paper briefli cover recent result field intellig manufactur intellig tutor ontolog introduct major technolog stream comput scienc engin decad deep impact develop intellig system form context modern knowledg model techniqu discuss stream includ softwar design layer softwar architectur develop hybrid system multimedia system distribut system internet discuss knowledg model includ refer kind knowledg repres knowledg base intellig basic design techniqu kb figur knowledg base content knowledg base aggreg object constitu part knowledg kind repres figur stand domain refer applic domain heurist stand control knowledg describ system problem solv strategi function domain independ denot explanatori knowledg defin content explan justif system reason gener system knowledg describ content structur knowledg pointer knowledg base build provid valuabl inform exampl program applic simul intellig system knowledg defin user model strategi system commun user kind knowledg specif kind knowledg knowledg base knowledg specif truth knowledg specif capabl commun integr kind knowledg knowledg base repres knowledg techniqu techniqu interrel knowledg element knowledg element rang primit form logic complex element complex knowledg element repres simpl aggreg knowledg conceptu techniqu base knowledg primit combin design entir knowledg knowledg element classifi type group homogen collect collect knowledg element type rest paper organ section survei knowledg model techniqu receiv attent recent year develop intellig ai research section discuss practic ongo project implement techniqu paper briefli cover recent result field intellig manufactur intellig tutor ontolog techniqu gener major trend comput engin mention research model effort specif field lai ground develop advanc practic intellig system field includ intellig ontolog knowledg knowledg intellig knowledg discoveri data distribut knowledg user model intellig agent intellig agent program map percept action acquir inform environ decid action perform real consensu definit intellig adapt intuit clear essenti describ gener concept gener figur specif intellig agent deriv concept environ percept action sensor effector agent figur gener agent intellig softwar autonom adapt person network minor differ denot intellig agent adopt term definit autonom softwar entiti perceiv environ act knowledg enabl perform capabl navig commun agent intellig agent user integr inform heterogen coordin inform acquisit unlik kind intellig intellig agent categori end user user hide complex difficult perform task behalf teach end monitor event procedur interest user collabor agent abil collect resourc optim perform independ rapidli chang condit user doesnt necessarili agent intellig agent model human agent interact user cooper user manipul tradit program act autonom commun interfac human agent comput agent program capabl autonom oper properti learn capabl concept intellig agent absolut divid world agent architectur point agent fall categori agent agent make action logic theorem prove intern state agent assum formula classic predic logic inform agent agent process model set deduct rule agent action attempt prove formula deduct rule agent succe prove action return action perform reactiv agent implement form direct map situat set task accomplish behavior behavior thought individu action function map perceptu input action perform behavior fire mechan action select multipl behavior agent simpli react reason agent agent intern repres make base bdi architectur appli practic process continu decid action agent perform order closer goal process repres figur belief function sensori input agent current basi determin set belief option gener function determin option agent basi current belief environ current intent filter function determin agent intent basi current action select function determin action perform basi current intent sensor input belief gener option desir filter intent action figur bdi agent architectur action output layer architectur agent layer architectur make softwar layer layer correspond level abstract layer support explicit reason environ horizont layer figur layer directli connect sensori input action layer agent vertic layer sensori input perform action output typic version vertic layer architectur shown figur agent sensor effector shown figur lai api layer program api layer link agent physic realiz resourc skill definit layer agent reason learn mechan descript agent knowledg resourc perform task organ layer specifi agent behavior group group agent belong agent role agent agent coordin layer describ social abil techniqu coordin techniqu collabor techniqu exchang knowledg techniqu group effici collabor work commun layer charg direct commun agent handl detail involv commun sensori input layer layer layer action output agent commun layer coordin layer organ layer definit layer api layer figur layer architectur intellig agent horizont layer architectur vertic layer architectur commun layer figur bring issu agent commun agent physic logic distinct oper isol agent typic commun exchang messag repres standard format standard agent commun languag acl support common syntax agent common semant domain ontolog backbon knowledg commun common pragmat agent find agent talk identif initi maintain number acl frequent kqml queri manipul fipa acl kqml languag set protocol agent commun support architectur type agent support commun agent client server kqml standard protocol inform exchang mode commun figur illustr layer organ kqml figur show kqml messag messag content languag descript messag content underli domain ontolog outer wrapper messag commun mode sender receiv commun mode commun shell messag messag content content attribut underli messag figur layer organ kqml messag queri kif snow knowledg encod desir languag sync queri kif snow figur kqml messag messag content attribut messag commun packag kqml support facilit agent provid mediat translat servic agent commun forward messag inform provid maintain registri servic unlik commun facilit mediat serv kind commun agent regist agent subscript interest notifi collect agent serv broker agent facilit mediat agent establish direct commun provid negoti servic matchmak identif agent commun languag superfici similar kqml base messag commun act fipa acl specif consist set messag type descript set interact includ request contract kind auction fipa acl syntax ident reserv primit separ messag outer languag languag outer languag defin intend mean specifi content languag semant sl reli idea bdi agent sl formal languag defin fipa semant base multimod logic modal oper uncertain intent sl repres action agent act form multiag system agent huge knowledg creat process suffer inform overload multiag smaller agent divid complex task special perform part complex task multiag system achiev higher adapt individu agent system higher flexibl user typic role agent multiag includ interfac agent receiv task user return task agent perform task receiv interfac inform agent tightli coupl data inform agent facilit match agent agent run inform sourc agent cooper perform creat system agent repres share resourc user perform degrad multiag system grace agent agent system carri task problemat agent mobil agent unit execut comput migrat machin concept mobil agent base remot program distribut remot procedur call rpc figur client program issu call network remot server rp client program send agent remot agent issu local call order obtain desir servic complet task remot back client machin deliv result client program client program client program rpc network client server rp network client agent client server servic local procedur call figur remot procedur call remot program servic mobil agent todai base java applet mobil java rmi protocol agent transport number sharewar tool mobil agent ibm aglet tool make delet mobil agent direct code technic secur deploi mobil agent practic requir agent server instal machin visit mobil agent creat specif tool agent server mobil agent machin agent work migrat server carri state mobil agent move prespecifi decid dynam migrat server term agent meet denot collabor work mobil agent agent server agent negoti collabor mobil agent act bring result agent meet home machin spite widespread mobil agent task typic perform manual automat network configur give concept mobil agent critic import constraint constraint includ restrict meet collabor mechan agent agent server develop critic data secur mobil agent steal data server steal data mobil agent complex implement agent commun protocol languag case mobil agent concept intellig agent tool system analysi design fact led grow adopt intellig agent softwar engin term program softwar engin middlewar quickli coin kei idea program directli program agent term agent agent express commit rule set commit rule messag mental action match mental condit commit rule belief agent messag condit messag agent decid rule satisfi agent commit action action intern execut send messag messag type defin start speech act theori messag modifi chang belief import idea program program languag includ provid support issu clean factor system applic compon infrastructur implement agentori program low level requir entiti commun primit agent agent migrat asynchron messag commun agent high repres commun agent provid infrastructur translat primit softwar engin draw justif fact intellig agent repres power power procedur abstract data program softwar system model collect interact passiv object softwar system understood model collect interact autonom agent agentori approach complement softwar engin agent typic implement fewer agent system object system system natur model agent softwar engin build system agent metaphor natur deliv system resourc number legaci system includ cooper part larger system order gain wider accept softwar extens uml model diagram recent express agent interact protocol issu model agent system agent interact protocol describ commun pattern sequenc messag agent constraint content messag commun pattern model specif sequenc activ state chart possibl adorn notat element variat exist denot commun act agent kei idea treat agent interact protocol entiti uml packag entiti order support easi adapt special figur illustr minor extens uml express agent commun syntax extens part syntax part uml arrow line label agent commun act messag extens support concurr thread interact agent plai multipl packag involv diagram agent extens includ specif uml stereotyp figur basic format agent commun suggest softwar engin includ agent design implement simpl easier custom easier agent develop start copi code fragment similar agent custom user middlewar defin entiti client peer applic middlewar provid servic applic system dynam bind agent hardwar run includ handl locat find agent commun directli task request servic facilit agent interact facilit mediat agent applic agent provid locat applic includ dynam commun agent registr manag servic applic servic provid agent server middlewar distinct agent agent open problem resolv practic design middlewar thin abstract common function maxim separ middlewar compon middlewar fat autonomi maxim common function deleg middlewar minim tendenc sophist agent intellig system move distribut knowledg intellig agent essenti turn middlewar function agent ontolog knowledg share build develop construct knowledg base scratch difficult process hard share knowledg encod knowledg base system reason larg heterogen knowledg formal singl famili knowledg difficult share knowledg system order provid knowledg share multipl knowledg standard protocol provid system convent problem import barrier knowledg share knowledg level terminolog mismatch belong applic domain research grow field ontolog engin offer firm basi solv problem main idea establish standard vocabulari domain develop knowledg reason modul modul act reusabl compon assembl system build system exist share declar reason techniqu explicit domain provid basic structur knowledg base built ontolog explicit specif formal declar subject area specifi concept express knowledg subject area knowledg encompass type attribut relat constraint ontolog vocabulari refer term subject logic statement describ term relat relat ontolog provid rule combin term relat defin extens problem semant independ reader context ontolog enabl knowledg share knowledg agent ontolog describ concept relationship exist agent commun agent descript formal specif program common ontolog defin vocabulari queri assert exchang agent ontolog state axiom constrain interpret defin term ontolog interpret ontolog provid taxonom hierarchi class subsumpt relat hierarchi lesson topic object class develop ontolog lesson ontolog subsum ontolog ontolog make defin infrastructur integr intellig system knowledg level knowledg level independ implement defin adequ primit express knowledg conveni knowledg primit regard ontolog concept relat suitabl defin knowledg languag ontolog defin term languag form ontolog broad collabor ontolog provid knowledg share member interdisciplinari team ontolog facilit inform distribut educ ontolog public medium sourc model ontolog repres reusabl build block model system knowledg level ontolog expect plai major role semant web semant web web enabl automat knowledg process intellig servic search inform inform filter requir defin standard syntact form semant order facilit semant xml markup rdf descript current world wide web consortium standard establish semant web xml successfulli repres syntact address document structur describ recogn semant unit domain rdf data model extend address sophist ontolog facilit rdf design standard definit metadata descript resourc equal suit repres data basic build block conveni repres concept ontolog domain model defin object relationship repres natur rdf defin ontolog rdf mean defin rdf specifi concept relationship languag rdf schema mechan defin element ontolog infer languag knowledg process defin knowledg processor abstract mechan start set fact set knowledg element produc set fact concret exampl knowledg processor includ limit blackboard control heurist infer lowest level singl neuron neural network illustr blackboard architectur figur model solv complex problem cooper coordin number call knowledg sourc knowledg sourc special perform task contribut knowledg sourc share partial result process share call blackboard knowledg sourc independ work larg knowledg resid local knowledg base fact local knowledg sourc knowledg sourc global blackboard control mechan coordin work individu knowledg sourc synchron access blackboard ks ks ks blackboard figur blackboard architectur import line develop ai knowledg process emerg decad develop kind knowledg processor start softwar design practic softwar pattern common global architectur mechan softwar pattern attempt describ success solut common softwar problem softwar pattern reflect common conceptu structur appli produc applic context figur show structur knowledg processor pattern particip mean knowledg processor defin interfac knowledg knowledg examin updat fact fact object knowledg fact object gener aggreg collect knowledg element collect knowledg put collect knowledg make repres knowledg base make fact object repres work collect work memori rule frame knowledg processor pointer instanti abstract interfac class develop subclass interfac order implement interfac knowledg processor concret knowledg processor knowledg processor specif type infer defin applic design interfac knowledg processor concret knowledg processor ks ks ks figur knowledg processor pattern fact knowledg import line develop ai knowledg process line integr tradit program languag capabl exampl includ architectur environ architectur extend languag cope perman object product rule uniform interfac environ emb pattern match base famou rete algorithm intellig make data access manipul complex simpl effici integr manag system knowledg process capabl design creat intellig featur queri intellig navig huge amount raw automat translat queri sequenc sql possibl make automat discoveri intellig evolv merg includ tradit expert system automat knowledg discoveri result architectur intellig figur intellig engin tool perform autom knowledg discoveri intellig data qualiti integr control user directli interact user interfac creat model task environ intellig engin system base level incorpor model deduct multimedia inform express oper wai intellig tool user interfac intellig engin figur architectur intellig typic concret wai merg technolog intellig system coupl integr dbmss intellig system coupl weaker merger consist rule data updat intellig difficulti bring conform rule knowledg base spite success commerci applic coupl intellig system applic intellig system plai role intellig frontend integr dbmss intellig system consist rule singl dbm administ kind object integr bring perform mere coupl exampl integr rule data commerci ingr knowledg discoveri data mine knowledg discoveri process automat discoveri unknown regular content implicitli present larg volum data data mine denot discoveri pattern data set prepar specif dm synonym kdd strictli speak dm central phase entir process kdd knowledg discoveri kdd system user action run assumpt constraint figur illustr environ kdd process assumpt exist data user discov pattern exist applic user select prepar data set adjust dm start run kdd access manipul discov pattern system user kdd method method enabl data set prepar search order pattern evalu term certainti kdd method make domain knowledg guid control process evalu pattern case domain knowledg repres knowledg techniqu discov knowledg directli queri includ program expert system user save desir form discov pattern repres unknown fact domain knowledg combin exist repres domain knowledg order support subsequ run kdd process data dictionari kdd method search evalu domain knowledg applic user discov knowledg figur environ kdd process figur show typic data kdd process kdd entir repres target data set gener larg select procedur preprocess target data order elimin except resolv ambigu target data possibl prepar target data term gener specif data sequenc result set preprocess data select target data preprocess data transform preprocess dm transform data figur phase kdd process interpret evalu pattern knowledg phase transform preprocess data suitabl form perform desir dm task dm task specif kind activ carri set transform data search guid kind knowledg discov exampl dm task cluster mine associ mine chang deviat sequenc analysi output dm phase set pattern pattern goal interpret evalu pattern discov pattern interest user discard rest pattern remain repres discov knowledg kdd process run smoothli iter process repetit feedback loop figur individu phase repeat entir process repeat data set discov pattern repres knowledg includ infer analyt infer rule frequent techniqu tree suitabl machin learn algorithm concept program learn repres form tree transform tree infer rule easi straightforward rule depend discov knowledg form causal chain network rule kdd system appli probabilist techniqu repres uncertainti discov pattern form certainti factor infer rule probabl distribut easi comput kdd system start suffici larg probabl distribut suitabl model data fuzzi set fuzzi logic import note import factor model uncertainti effort elimin sourc uncertainti noisi miss earli phase process techniqu repres discov knowledg depend goal discoveri process discov knowledg user natur languag rule graphic rich form suitabl discov knowledg knowledg base intellig expert system domain discov knowledg translat form applic discov knowledg domain knowledg guid cycl kdd process requir repres discov pattern domain knowledg repres kdd system distribut intellig system distribut ai system concern interact group intellig agent cooper solv complex problem distribut problem subfield deal strategi decomposit coordin comput distribut system match structur demand task domain distribut intellig system model number inform process phenomena occur natur world phenomena sourc number metaphor distribut process distribut problem solv recent develop distribut system contribut import distribut intellig system inform technolog capabl due develop internet world wide web made develop power wide intellig system system implement ai problem ident technolog intellig knowledg virtual knowledg manag tightli coupl open field applic practic ai decad intellig agent knowledg manag cover detail dedic section section cover knowledg server virtual organ extens knowledg server entiti comput network servic expert heurist search adapt inform automat data portal knowledg share intellig expert system internet perform task remot thought knowledg server user access system distant locat expert problem solv internet view intellig agent server knowledg conveni recal intellig agent poss knowledg capabl deploi agent work behalf commun agent network interpret assist remot user commun knowledg server remot comput necessarili requir softwar nowadai interfac figur illustr knowledg server applic oper essenti manner divid integr intellig system client server order oper network difficult import reason minim commun client server ensur accept time figur solut client perform knowledg server store knowledg base perform task local mobil agent deploi provid interact client server ensur support applic java virtual machin rescu end user client front end network connect knowledg server problem knowledg base figur architectur knowledg server multipl knowledg server cooper solv complex architectur complex call knowledg share multipl server problem field intellig system stress ontolog foundat practic problem knowledg server network network server avail instal mirror site knowledg server server robust avail virtual complementari resourc exist number cooper compani left integr support busi process product effort resourc select assign virtual organ resourc virtual organ quickli assembl integr busi domain virtual organ internet select order creat assembl product resourc frequent concurr product resourc includ learn ai successfulli number virtual includ virtual virtual offic concurr engin virtual virtual environ train virtual organ comput network global special knowledg independ geograph constraint restructur commun build organiz principl knowledg accumul distribut teamwork appli intellig agent set enabl collabor user resourc agent virtual knowledg exchang facilit user interact resourc virtual organ intellig plan human limit abil track broad rang virtual organ tight time constraint limit resourc requir virtual organ frequent interrupt receiv commun minut agent ai technolog virtual organ mitig limit constraint human make monitor control substanti resourc time constraint inher human organ knowledg manag knowledg manag process convert knowledg sourc organ connect peopl knowledg involv identif analysi requir knowledg asset knowledg asset relat subsequ plan control action develop asset process fulfil organiz object artifici intellig applic institut defin knowledg asset knowledg technolog busi enabl busi process gener add knowledg manag involv knowledg asset process act develop preserv assess appli updat share transform knowledg transfer knowledg manag facilit typic advanc world wide lotu intranet system numer knowledg numer qualit data knowledg searchabl web import ai intellig knowledg discoveri import part system formal manag knowledg asset process reason fast chang busi knowledg evolv assimil fast due competit pressur number peopl hold knowledg knowledg time experi time retir leav compani undergo chang strateg knowledg lost import knowledg repres common vocabulari knowledg properli understood order share knowledg differ applic compani type share compani exist knowledg verifi maintain futur knowledg asset everydai compani access locat stress model busi role commun agent control process knowledg model knowledg engin practic achiev object figur illustr technolog major knowledg manag enabl data mine browser intellig agent support ontolog knowledg manag xml document retriev pointer peopl groupwar intranet system figur kei formal knowledg manag numer km applic develop enhanc research busi group collabor design typic architectur start inform knowledg sourc bottom electron document infrastructur layer top base file adjac upper layer knowledg repositori content manag knowledg defin corpor knowledg manag servic layer top kind discoveri servic collabor servic beneath knowledg portal applic interfac knowledg manag system applic layer top specifi compani applic knowledg manag system includ competit product develop applic knowledg manag singl technolog collect technolog coupl methodolog design achiev result desir user convent approach knowledg manag data schema context data approach suffer poor scalabl conveni altern xml markup xml context turn data set knowledg manag tool manag inform xml markup languag html deeper insight show xml famili languag provid semant manag inform html design publish world wide web consortium standard mean describ data unlik xml tag predefin xml xml document type definit formal describ data xml languag data web develop deliv content wide varieti applic desktop xml standard inform search adapt person content author freed defin style xml document content separ present document extens stylesheet languag displai inform wai form bullet pie languag context knowledg xml thought set rule defin data structur kei element document categor simpli present browser search engin select document list search engin scan entir document xml tag identifi individu piec text imag defin object tag identifi detail data increasingli popular compani leverag structur data relat unstructur data found internet sourc knowledg manag bring data xml categor data model produc xml repres domain data model programm provid knowledg manag tool reusabl xml parser code commun member easili interact model knowledg manag tool pass inform move knowledg repositori km tool data context tag export data xml syntax interpret data creat domain dtd knowledg repositori store data flat file schema consist domain dtd data separ context accur repres domain data model fundament build block knowledg manag infrastructur architectur knowledg portal portal larg door gatewai reach indic portal final destin web portal web provid link site access directli click design part browser found organ sequenc relat categori knowledg portal distinct knowledg produc support knowledg map knowledg worker job ad share inform knowledg knowledg consum interfac facilit commun product knowledg worker dissemin improv knowledg portal facil inform catalog collabor manag knowledg catalog knowledg knowledg catalog metadata store support multipl wai organ gather content taxonomi practic includ wide taxonomi defin user model user model explicit properti system adapt aspect perform individu user adapt definit user model thought construct qualit call user account user behavior term background knowledg user user background knowledg essenti element user model techniqu user model develop evalu research number includ artifici interact matter field user model result amount theoret practic develop applic user tradit area interact tutor system impact recent develop area inform adapt present interfac agent user user behavior user observ stimulu applic maintain student model user behavior typic action complet form result action complet user adapt user action regist base user model system maintain model user knowledg domain model concept case adapt domain model concept user model track user concept user read concept user model system construct user model singl piec requir multipl behavior accomplish task background knowledg correct misconcept held error made popul user domain background knowledg includ histor knowledg user past qualit model quantit measur user prefer stereotyp knowledg user popul domain output user model user mo del primarili qualit user knowledg process user model describ object process term causal relat tutor user model process detect mismatch actual desir behavior knowledg term incorrect inconsist knowledg miss incomplet knowledg intellig analysi user action decid action correct find wrong possibl identifi miss incorrect knowledg error function refer knowledg intellig analyz provid user extens error feedback updat user model conveni approach interact intellig support intellig advic user step interact applic level vari signal wrong give execut step user user model system watch action understand understand provid updat user model field user model popular constantli grow recent year number interest research construct user goal cognit user model agent exploit user model adapt inform filter tailor inform transfer task perform user select instruct interfac integr activ intellig agent user model order activ intellig agent guid assist individu user attempt account current progress user applic domain specif specif user commun perceiv mental model user chart person appli user model agent collabor environ work integr idea interact learn collabor distribut open cooper user mo construct user model collabor statist techniqu predict user abil updat user model base number hint user requir point interact infer techniqu user includ neural numer uncertainti epistem logic logic stereotyp task creat maintain user model adapt integr individu user model collabor work environ order creat multipl user model group applic user model techniqu adapt learn interfac explan system adapt hypermedia multimod support user special practic issu user standard applic number practic ai applic develop project emploi knowledg model techniqu survei part paper section part present concret exampl applic program stand intellig integr inform darpa research develop concern develop distribut intellig applic specif scienc objectori softwar descript build earlier work establish darpa knowledg commun standard main idea project set transform collect heterogen data sourc virtual knowledg base sourc data includ knowledg subsystem simul scatter server internet intranet virtual knowledg base integr semant content dispar sourc provid integr inform applic level figur famili intellig agent charg mediat process agent hierarch organ coordin group translat user access data sourc desir abstract inform worri underli translat mediat process distribut natur famili agent elimin number human machin resourc intermediari inform translat processor abstract inform mediat detail inform integr servic human comput user user facilit mediat mediat wrapper wrapper sql orb imag legaci relat heterogen data sourc figur process object knowledg base integr agent coordin semant integr translat wrap turn figur insid servic reveal detail figur servic layer isol applic dynam environ rigid legaci data servic intend research applic commun design integr compon framework defin set essenti object protocol servic inform request repositori ontolog inform servic form base level inform process interact client compon repositori servic manag storag mediat servic handl queri data access protocol specif data integr object multipl inform sourc possibl domain depend wai exampl kind integr includ unit data defin ontolog specif knowledg model servic includ ontolog domain model merg infer classif dedic work group program concern develop ontolog metalanguag construct sentenc ontolog compon domain model ontolog object relat servic user profil gi stream servic repositori servic text imag servic queri servic inform subscrib figur servic layer sourc servic simul base design system mediat servic integr transform distribut intellig design engin develop martin system call implement concurr engin framework fundament engin process process includ product process collabor design process assembl visual interact product integr extern applic system support process concret architectur servic attribut virtual organ virtual develop environ commun system applic product lifecycl due distribut heterogen comput environ support develop virtual prototyp product evalu prototyp synthet environ repres entir lifecycl product adapt specif product domain architectur system shown figur kind servic match gener servic individu servic multipl agent data servic deal product process approach model link compon descript behavior interact servic charg advanc visual product process provid collabor mean spatial manipul product simul integr servic support system tool collabor assembl collect tool integr human commun share electron notebook applic servic manag static applic perform specif role user anim spreadsheet applic product integr servic servic data servic inform share object manag comput commun intellig inform bu figur architectur system applic servic lower part figur intellig inform bu support commun higher level agent layer architectur inform share layer support higherlevel commun entiti system duti includ public subscript interest specif event object manag layer id complex commun user applic high perform comput commun network interfac layer isol underli hardwar commun detail object manag layer higher level agent incorpor legaci code environ enabl mean wrapper input output call data translat method smart data object determin translat requir work small set interchang librari translat convert parka parka popular ai specif featur capabl scale extrem larg size applic parka massiv parallel knowledg parka frame knowledg properti link encod ontolog properti valu numer special data structur knowledg base screen access huge semant network parka enabl inferenc knowledg base million assert tool dbm technolog support inferenc data manag significantli primari memori requir wrt tradit knowledg retain infer capabl due integr dbm technolog dbmss extern storag enabl inferenc complex queri evalu reli primarili cheaper disk consum intern memori develop run singl processor system process extrem complex conjunct queri support automat knowledg discoveri data verifi find relev relationship taxonom knowledg knowledg base applic parka system reason format logist plan set medic inform system exampl agent system applic practic intellig agent popular ai technolog recent year agent system applic softwar engin open wide door analysi design softwar system intellig agent applic domain agent appli electron person digit assist limit inform gather interfac network monitor air traffic busi process industri system distribut space shuttl fault factori process system applic recent exampl illustr characterist applic domain core framework distribut access system base mobil agent framework underli idea avoid client machin download remot sql initi jdbc handl complex set jdbc interfac creat fire mobil agent capabl dbm aglet migrat remot sql server initi local jdbc driver access perform queri work assign owner client complet dbm aglet return client machin result note full remot program approach searcher agent searcher agent applic typic send mobil agent remot internet site analyz html page extract requir inform transfer page network searcher agent find return url page specif keyword coordin agent agent resourc execut environ fundament import mobil agent reactiv space coordin develop modena reggio coordin model model base blackboard memori exchang messag empow organ inform tupl retriev associ mechan coordin problem avoid duplic work agent searcher agent dynam creat spatial unawar agent searcher agent arriv site work leav tupl tupl space marker tupl form searcher agent applic subsequ arriv site check local tupl space marker arriv agent termin duplic work mobil middlewar base mobil agent middlewar mobil comput provid suitabl support tool realloc trace mobil user termin dynam enabl commun coordin mobil entiti mobil agent conveni address issu continu network connect connect long inject agent mobil termin fix network termin agent continu work deliv result user reconnect mobil middlewar architectur base mobil agent typic organ layer servic lowest layer support commun heterogen distribut system adjac upper layer java virtual layer core mobil agent servic built includ qo adapt servic top layer mobil comput servic base mobil user virtual environ uniform view work environ independ user current locat specif mobil virtual termin termin execut state restor includ activ process subscrib virtual resourc manag access resourc fuzzi intellig agent web essenti machin intellig develop intellig agent target web market commerci web site collect provid intellig agent resid monitor current decid interest servic behalf agent determin bid ad visitor point agent receiv inform visitor simultan agent process inform knowledg base bid ad bid convert probabl distribut determin ad visitor pai web site fix number proport bid fuzzi rule agent knowledg variabl correspond characterist describ site visitor consequ variabl correspond bid exampl fuzzi valu fuzzi variabl shown ag young incom ag middl incom exampl system applic system system support kdd process develop intens tabl show import applic domain typic problem system domain tabl applic domain typic problem domain problem medicin discov genet sequenc treatment cost analysi financ stock market fraud unauthor account access invest select social scienc demograph data predict elect vote trend analysi astronomi analysi satellit imag law tax fraud identif fingerprint recognit market sale identif consum product pattern engin discov pattern vlsi circuit predict failur insur detect extrem high chain claim agricultur classif plant publish discov reader profil special issu journal magazin descript illustr varieti current system applic recon martin research center develop advisor analyz success compani data store quarter date compani data chang data record stock price trend price profit number analyst monitor compani recon predict return invest month bui stock recommend stock result analysi pattern form rule classifi stock except recon recommend stock return invest classifi except user comput recon graphic user interfac pattern evalu user analyz manual rule detect analysi huge amount scientif literatur web web make easi quickli find relev literatur gener perform inform filter kdd function user relev research download web public gener research area comput creat specif digit extract featur sourc automat discov public match user jam grow number credit card transact internet risk credit card number subsequ commit fraud jam agent system distribut dm capabl analyz huge number credit card transact process internet search fraudul transact transact legitim fraudul jam divid larg data set label transact fraudul smaller subset appli dm techniqu gener classifi subsequ gener varieti learn algorithm gener classifi search graph discov common substructur basi system develop perform substructur discoveri dm repres graph perform kei dm call pattern discoveri concept learn exampl system successfulli discov substructur cad circuit structur protein program sourc aviat data expert domain rank substructur discov highli advanc scout system advanc scout discov pattern game coach team analyz brought game advanc scout coach transform data common game current access coach huge amount data time show individu shoot coach domain knowledg game advanc scout shoot optim pattern advanc scout discov price william shoot score video record game facilit interact pattern evalu process recent result due research success project current trend knowledg number import ai applic domain undergo kind constant revisit recent year ai integr softwar disciplin section briefli review recent result framework build intellig manufactur system techniqu trend softwar engin achiev pave ground develop systemat approach design softwar intellig manufactur system approach base gener model intellig call develop start observ current method softwar design develop tool intellig manufactur system method tool stress compon intellig domain learn fuzzi domain depend monitor control difficult make extens method easi compon develop intellig manufactur system effort dedic develop softwar distribut object flexibl scalabl applic overcom problem framework start softwar engin make clear distinct intellig softwar highlevel compon intellig manufactur system kei idea illustr figur softwar compon intellig manufactur system defin belong level abstract level abstract defin primit level compon logic frame rule unit level neural fuzzi set block level system level robot integr level intellig distribut manufactur figur compon level knowledg knowledg figur compon level built compon adjac lower level planner defin block level term neural compon experi show optim draw strict divid line level abstract easi lead inflex knowledg problem experi distribut tool level close correspond todai intellig manufactur system make process build intellig manufactur system easili adjust level abstract object level integr multipl agent system level system singl agent system level block system build block level unit unit primit level primit part unit semant level abstract level level level level level figur model level abstract dimens dimens dn ontolog intellig tutor system ontolog nowadai hot topic domain intellig tutor system approach develop ontolog domain call tool build heart ontolog hierarch scheme composit constitu part compon agent scheme model primit comp plain logic attribut numer valu unit util function part build block exist lesson teach strategi system system agent explan student model learn build block integr level collabor learn distribut learn tutor system integr concept ontolog split number separ interrel ontolog constitu part system domain knowledg pedagog knowledg interfac ontolog ontolog defin small modul level abstract knowledg assembl ontolog start point root defin abstract knowledg element ontolog assign higher level abstract includ taxonomi lower form set lattic ontolog ontolog softwar pattern softwar pattern solut recur specif problem softwar analysi softwar organ softwar project pattern provid common vocabulari softwar engin explor engin altern knowledg experi underli redesign recod effort develop struggl achiev greater flexibl softwar design pattern ontolog recent research result show overlap extent concept describ thing knowledg level ontolog softwar pattern concret pattern thing softwar abstract activ organiz pattern analysi pattern draw analog librari ontolog catalogu softwar pattern catalogu pattern build block ontolog attempt make block doesnt hard mental shift view ontolog abstract knowledg skeleton domain fact support possibl softwar pattern sourc ontolog design modern knowledg model establish hot topic domain stem advanc domain model result develop comput engin decad adopt practic softwar layer softwar hybrid multimedia distribut research model effort specif field ai knowledg knowledg intellig knowledg data intellig virtual interest observ analysi knowledg model number system develop import ai applic domain revisit achiev knowledg model softwar engin observ notabl integr ai softwar disciplin advanc knowledg model fact research develop commun gradual realiz ai softwar system softwar system model world model repres knowledg world refer artifici intellig applic knowledg mobil agent middlewar mobil ieee comput march extend xml ieee internet comput advanc data mine knowledg discoveri data mine knowledg discoveri kd lee discov relev scientif literatur ieee intellig system de adapt system acm comput survei decemb adapt intellig technolog intelligenz special issu intellig system programm coordin architectur mobil ieee internet comput java tutori program pk sj distribut data mine credit card fraud ieee intellig system jr josephson vr ieee intellig system dj cook lb data ieee intellig system jh xml set stage effici knowledg ieee cf integr data ieee expert februari integr inform ieee internet comput van semant role xml ieee internet comput borrow softwar acm intellig magazin fall framework build intellig manufactur ieee transact part applic review lj innov model techniqu intellig tutor innov teach lc crc pp kdd process extract knowledg volum commun acm novemb kqml agent commun softwar jm mit pp fipa intellig physic fipa part agent commun ej jc multimedia vehicl knowledg model expert expert system applic reason white paper octob rager scalabl knowledg system huhn read morgan san nr jen jr social level social iee softwar special issu februari gh stock select rule ieee expert octob ea role model agent system ieee concurr benefit virtual organ distribut commun acm novemb agent commun current ieee intellig system appli uml pattern introduct analysi upper saddl lassila resourc descript framework model syntax recommend knowledg readi prime ieee comput februari ieee intellig system kuokka artifici intellig virtual commun acm januari kei servic work knowledg learn knowledg crc boca mamdani agent distribut comput ieee internet comput cj pc system knowledg discoveri ieee transact knowledg data engin lr hybrid intellig kluwer academ agent system ieee concurr step ontolog nation confer ai june jp mj wooldridg nr intellig springer dt ndumu hs research develop challeng iee softwar engin februari senat wr enabl technolog knowledg ai fall knowledg artifici intellig object manag omg xml metadata interchang odel suggest uml extens omg analysi design task forc uml request mobil agent world wide web distribut ieee transact knowledg data engin intellig deduct hypermedia john roi ieee russel artifici intellig modern englewood softwar commun acm octob defin characterist intellig tutor system intern journal artifici intellig educ shaw softwar perspect emerg englewood artifici intellig student model machin intern journal artifici intellig educ swartout ieee intellig system pt nomad languag infrastructur design mobil ieee concurr mobil commun acm march reason ration mit intellig multiag mit pp mj wooldridg nr softwar engin pitfal ieee internet comput rr target market fuzzi intellig ieee intellig system
HCI/668 4 problem wireless sensor network mani srivastava comput scienc lo angel electr engin lo angel abstract wireless sensor network recent emerg research topic great longterm econom abil transform pose challeng sensor network pose number conceptu optim problem fundament applic reli inform address fundament coverag coverag answer question qualiti servic provid sensor network defin coverag problem point view includ worst present exampl domain combin comput geometri graph theoret specif voronoi diagram graph search establish main highlight paper optim polynomi time worst averag case algorithm coverag calcul present result discuss futur research direct relat coverag sensor network introduct person comput era evolv ubiquit comput world fulli connect devic wireless network improv wireless network technolog interfac emerg base mem technolog sophist commun capabl everydai physic world web server connect physic world sensor actuat virtual world inform util servic research activ recent commenc sensor network wireless sensor network sensor technolog physic law govern energi requir perform wireless commun limit feasibl devic past benefit capabl sensor node abil build implement sophist reduc amount commun requir perform task distribut local implement complex power save mode oper depend environ state network due advanc sensor network practic applic wireless sensor network continu emerg million lost due forest fire year earli warn critic prevent small harmless brush fire deploi special wireless sensor node strateg select detect time disast drastic likelihood success earli effort node constant cost minim compar huge loss incur larg blaze addit wireless sensor network provid viabl altern exist technolog larg build hundr sensor wire central air condit system wire cost limit complex current control reconfigur system replac monitor unit wireless sensor node improv qualiti energi effici system unlimit reconfigur custom futur save wire cost justifi wireless sensor node research sensor network coverag fundament issu sensor addit locat coverag due larg varieti sensor coverag subject wide rang interpret coverag consid measur qualiti servic sensor network previou fire detect sensor network network observ area chanc fire start specif locat detect time frame coverag formul find weak point sensor field suggest futur reconfigur scheme improv qualiti servic sensor seemingli relat viewpoint coverag worst case coverag attempt made quantifi qualiti servic find area lower observ sensor node detect breach region find area high observ sensor identifi support guidanc region primari concern main object design effici scalabl algorithm wireless integr conceptu algorithm point main contribut provabl optim polynomi time algorithm coverag sensor network combin exist comput geometri techniqu construct voronoi graph theoret algorithm techniqu voronoi effici loss transform continu geometr problem discret graph problem enabl direct applic search techniqu result graph studi asymptot coverag behavior random wireless network paper organ remind paper organ section summar relat work section survei kei technolog fundament studi coverag section iv overview determinist sensor coverag section present formal definit worst coverag optim algorithm solv case section vi wide arrai result discuss futur research direct ii relat work trend research effort area refer smart space comput directli relat problem sensor network research sensor network area mention critic notion coverag knowledg time algorithm approach combin comput geometri construct adopt sensor network identifi import comput geometri voronoi diagram sensor network coverag refer describ gener systemat method develop advanc sensor network monitor complex system found nuclear power plant present gener coverag algorithm art galleri problem deal determin number observ cover art galleri room point observ found applic domain optim antenna placement problem wireless commun art galleri problem solv optim shown case refer heurist solv case delaunai triangul sensor coverag detect global ocean color sensor observ distribut abund ocean approach assembl merg data satellit orbit relat work attempt coverag initi unknown environ mobil robot geometri environ coverag special case path plan problem solv gener voronoi diagram radar sonar coverag present relat challeng radar sonar net optim great import network technolog optim distribut detect track surveil area base measur radar cross section coverag diagram method optim locat radar achiev satisfactori surveil area limit radar resourc coverag studi maintain connect focu studi calcul optimum number base station requir achiev system oper servic object connect achiev mobil host attach base station connect coverag import case wireless network connect refer show improv network coverag due rout featur optim coverag constraint limit path length coverag studi aim wireless sensor class problem due geometr algorithm approach iii preliminari topolog network sensor model wireless sensor network target extrem power save requir network infrastructur small physic low power low turn limit commun proxim node exist model sensor behavior vari complex model share thing common abil directli depend distanc subsequ assum sensor coverag distanc sensor enabl sensor locat technolog algorithm idea smarter environ foster grow interest locat awar system servic obtain reliabl locat inform enabl compon basic task sensor network track mobil manag gp posit solut due accuraci constraint coverag algorithm reli implement locat procedur initi step coverag algorithm approach sensor node call beacon coordin satellit inform scheme reli signal strength inform inher radio frequenc commun capabl node approxim neighbor distanc node hear minimum beacon neighbor determin locat beacon iter locat node develop heurist error initi beacon locat distanc inform initi analysi percol simul show node initi node locat end locat process discuss coverag node valid locat inform enabl comput geometri voronoi diagram delaunai triangul voronoi diagram studi domain believ voronoi diagram fundament construct defin discret set point voronoi diagram set discret site partit plane set convex polygon point insid polygon closest site construct effect produc polygon edg equidist neighbor site figur show voronoi diagram set randomli site refer present detail survei voronoi diagram applic structur directli relat voronoi diagram delaunai triangul delaunai triangul obtain connect site voronoi diagram polygon share common edg shown delaunai triangul maxim smallest angl triangl neighborhood inform extract delaunai triangul site close connect fact delaunai triangul find closest site shortest edg triangul properti voronoi diagram delaunai triangul solv worst case coverag figur voronoi diagram set randomli point plane central distribut commun main enabl reduc power consumpt sensor network energi requir commun arbitrari node strongli depend distanc node path loss expon depend rf environ constant describ overhead bit super linear relationship energi gener short intermedi hop send bit energi effici longer hop incorrect infinit number hop smallest distanc impract number intermedi hop limit number node energi limit energi radiat antenna energi dissip radio receiv bit readi bit retransmiss applic coverag energi comput node compon energi metric import note technolog scale gradual reduc process transmiss cost remain constant compress reduc number transmit reduc cost transmiss comput core idea low energi sensor network discuss appar good algorithm design wireless sensor network requir minim amount commun sharp contrast classic distribut system goal gener maxim speed execut render classic distribut algorithm irrelev develop wireless sensor network algorithm relev metric wireless network power measur commun cost wireless network order magnitud higher comput cost term consum power note coverag problem global lack knowledg locat singl node impli problem solv correctli algorithm aim provid correct solut inher locat data iv determinist coverag order achiev determinist static network deploi predefin shape predefin locat sensor uniform area sensor field weight critic monitor area uniform determinist coverag sensor node locat intersect point grid problem coverag sensor field reduc problem coverag cell neighborhood due symmetr period scheme weight predefin secur sensor system museum valuabl exhibit item equip sensor maxim coverag monitor scheme determinist scheme found art galleri problem heurist solut discuss coverag algorithm predefin scheme determin coverag sensor field stochast coverag determinist feasibl practic option cover sensor field sensor randomli distribut environ stochast random distribut scheme poisson distribut base applic hand simul studi gener assum uniform sensor algorithm applic scheme sensor node worst case maxim breach path coverag discuss earlier formal state field instrument sensor sensor locat area initi final locat agent identifi maxim breach path start end pb case defin path field properti point path distanc closest sensor maxim region arbitrari region determin task hand locat insid sensor field line segment voronoi diagram maxim distanc closest maxim breach path lie line segment voronoi diagram sensor point path pb deviat voronoi line closer sensor step obtain solut gener voronoi diagram appli graph theori find pb search line boundari voronoi diagram extend infin deal finit area clip voronoi diagram boundari travel bound sensor field constitut valid introduc extra edg voronoi diagram bound subsequ refer voronoi refer bound voronoi diagram part algorithm detail figur gener voronoi diagram sensor undirect graph construct creat node vertex edg line segment voronoi diagram edg graph weight equal minimum distanc closest sensor algorithm perform binari search smallest largest edg weight check exist path edg weight larger search criteria call path restrict edg consid search iter path lower relax constraint search algorithm found maxim breach path highest weight edg gener bound voronoi diagram vertex set line segment set initi weight undirect graph vertex creat duplic vertex creat edg distanc sensor min edg weight max edg weight rang rang initi graph creat vertex insert edg rang rang success rang rang end figur maxim breach path algorithm note maxim breach path uniqu path qualifi maxim breach path edg weight larger equal determin binari search phase edg weight equal found algorithm minimum distanc sensor agent travel path field encount sensor deploi exist sensor move coverag improv case maxim support path similar coverag coverag state field instrument sensor sensor locat area initi final locat agent identifi path maxim support start end ps case defin path field properti point path distanc closest sensor minim delaunai triangul produc triangl minim edg length ps lie line delaunai triangul sensor move minim distanc attempt travel straight line connect sensor node algorithm solv ps similar breach algorithm figur voronoi diagram replac delaunai triangul underli geometr edg graph assign weight equal length line segment delaunai search paramet replac paramet maxim support path uniqu found binari search phase algorithm indic coverag network maximum distanc closest sensor agent travel path field encount addit sensor deploi exist sensor move coverag improv complex algorithm gener voronoi diagram log complex graph weight assign accomplish linear time add overhead comput bf complex number edg graph realist case deal network actual complex high binari search accomplish rang limit worst case complex algorithm log practic network complex log domin voronoi procedur larg constant factor complex vi result platform sampl result coverag algorithm present implement studi includ simul ns packag present sampl result provid overview analysi applic figur show instanc coverag problem sensor deploi random maxim breach path edg depict breach place field maxim support path edg shown figur show underli bound voronoi diagram problem instanc extra edg weight connect region structur path consid search algorithm figur show delaunai triangul extra edg introduc connect closest sensor structur figur sensor field maxim breach path maxim support path figur sensor field weight voronoi diagram maxim breach path figur sensor field weight delaunai triangul maxim support path sensor heurist edg section guid futur sensor correspond edg breach path pb closest deploi addit sensor edg improv coverag figur show averag improv breach coverag addit sensor introduc network heurist note addit sensor algorithm repeat find breach region result repres averag improv random interest deploi breach coverag improv deploi sensor edg delaunai triangul heurist deploi addit sensor improv support coverag shown figur improv achiev support coverag ad addit sensor node breach improv add add add add number sensor figur averag breach coverag improv addit sensor support improv randomli deploi deploi random averag support coverag improv expect heurist deploi sensor asymptot behavior add add add add number sensor figur averag support coverag improv addit sensor graph figur show coverag randomli sensor node field vari number sensor chang result shown graph repres averag field breach support coverag random sensor placement uniform random variabl determin coordin sensor si unit squar field breach lower valu coverag sensor field figur demonstr asymptot natur metric sensor field oper point view minim breach maxim support figur show normal plot function number sensor unit squar field distanc base sensor model deploi addit random sensor improv coverag significantli asymptot natur breach support coverag suggest analyz field select proper number sensor level coverag expect sensor perform exact plan vii futur research direct coverag scheme present fundament task emerg area sensor larg horizon possibl futur research subject solut obtain ubiquit context assembl inform combin relat servic inform fusion similar intent area sensor fusion context negoti resolut strategi integr inform stage relat context track mobil object network handl obstacl algorithm develop wireless adhoc sensor assum central control node connect gatewai control strategi distribut control system feasibl solv problem present paper decentr approach natur studi compar central coverag algorithm distribut term power perform assum ident sensor sensit coverag depend geometr distanc sensor factor influenc coverag addit sensor model deal sensor sensor sensit direct integr multipl type sensor network platform studi coverag system present interest challeng viii interpret formul coverag wireless sensor network present optim polynomi time algorithm graph theoret comput geometri construct solv worst case coverag result show applic theoret coverag formul algorithm specif solv maxim breach maxim support addit sensor heurist improv stochast field coverag coverag breach support number sensor node figur normal breach support coverag function number sensor node acknowledg john agr rockwel scienc center provid initi insight voronoi diagram coverag sensor network comment kei enabl factor lead develop optim breach support path base coverag algorithm research support part rockwel scienc center darpa refer proactiv commun pp gj wj integr network commun pp comput meet world wide commun pp gs mj robot commun pp diagram survei fundament geometr data acm comput survei pp zj aa rl coverag ieee intern symposium intellig control intellig system pp sept ww gc sb cr rh opportun global ocean color ieee transact remot pp sept comput introduct random zj relai capabl reconfigur wireless ieee technolog pp plan guidanc techniqu autonom mobil clean robot autonom pp cw mw integr method sensor network develop complex power plant reliabl engin system pp jan ba ra place observ polyhedr terrain polynomi imag vision pp dec ge ar automat locat cellular combinatori ieee technolog pp coverag optim genet ieee intern symposium indoor mobil radio pp sept gf van air surveil radar net radar journal pp april mb discoveri wireless sensor ucla ee cs depart person commun rockwel center darpa program review feb nanci distribut morgan kaufman
DB/669 3 detect parallel distribut applic applic beth colleg comput georgia institut technolog georgia submit intl conf distribut comput abstract system interest runtim understand dynam behavior possibl control paper describ complex distribut parallel applic attain scalabl improv respect amount complex data share applic compon improv deriv techniqu manipul data stream relat model data filter constraint stream express form queri evalu data event stream stream filter runtim optim techniqu deriv queri optim method paper present term offer mean dynam creation queri applic distribut data permit implement runtim multipl optim support dynam queri base stream dynam behavior depend tempor system introduct background interest detect techniqu distribut system grow larger complex detect appli distribut system enabl analysi system dynam ffl evalu system ffl recognit current system state futur ffl valid system correct term runtim oper detect adapt target system correct inappropri behavior adjust oper improv perform meet futur goal perform measur tool detect provid inform program perform resourc includ measur predetermin quantiti system util program execut analysi quantiti execut time procedur collect complex inform detect evalu critic execut path parallel method emploi network manag tool gather inform understand network behavior forecast futur perform onlin valid techniqu hazard detect shown safeti critic applic techniqu gather analyz data identifi behavior deviat definit correct behavior report correct runtim correct behavior system adapt exampl includ algorithm parametr system manag time behavior presenc unpredict program extern includ autom adjust distribut high perform system improv usag scarc includ system typic term program steer steer system exampl includ falcon moss steer program control system approach detect techniqu develop intend distribut parallel applic specif present paper detect hazard continu applic ongo work appli techniqu high perform applic run multiprocessor cluster context distribut laboratori project approach runtim detect relat model data arriv applic view data applic observ analysi stream event event extract receiv receiv signal sensor model context relat event event type member relat membership distinct tupl belong relat model detect reduc problem queri evalu queri languag express describ data retriev event stream replac data sourc event flow queri evalu pipelin fashion set event queri condit queri satisfi set event appli correct assum constraint repres singl satisfi queri equat constraint result action appli event satisfi queri mean event set event met criteria condit trigger action perform forward gener event discuss advantag deriv relat approach describ manipul event stream rich semant queri languag permit specif complex condit base event event stream manipul interest runtim optim event stream deriv queri optim techniqu result solut detect scalabl respect size complex problem offer mean adapt applic execut ffl straightforward detect condit multipl event stream event ffl condit state spatial time properti ffl event type creat runtim queri chang ffl action routin execut condit permit execut comput part event process scalabl adapt import reason violat involv multipl sourc constraint violat system involv pump pressur temperatur water valv sensor abil handl condit involv larg number event type differ work compar past approach violat detect emb assert sensor automat code approach restrict condit attribut singl task singl event type violat occur distribut system involv time scalabl term address complex event stream serv queri languag support rel time logic physic time timestep distribut approach detect handl larg number stream natur fashion adapt realist applic typic includ runtim creation delet applic dynam migrat compon underli altern intern solut data approach support dynam applic behavior wai concept view extend event stream permit runtim creation event type serv input queri event type coupl abil chang rule dynam support runtim adapt queri evalu event stream perform semant queri languag present paper permit action routin appli condit satisfi action routin access event violat perform test effect relat approach data stream analysi develop queri evalu tool event stream initi design languag present paper dynam capabl tool perform result obtain appli tool implement safeti critic applic hazard detect perform contrast critic path detect deriv set constraint formal specif system overview remaind paper organ section provid overview cnet tool section discuss applic work defin queri dynam constraint optim discuss section perform result section relat work follow section detect model runtim environ model model system perform detect set queue dispatch control system execut node collect join oper oper node gate oper gate oper control activ deactiv trigger statist delet node node connect dag arc exist node node requir input event type gener shown figur user enter sql queri sensor sensor specif describ event sourc sensor specif transform code link safeti critic applic access instrument point insert applic queri optim transform call cnet librari state defn sensor tcl interpret optim gener sql queri sensor spec ast ast sensor spec startup command tcl script parser cnet librari dispatch gener sensor event info sensor script user interfac code defn compil app figur system architectur user interfac shown grei figur user issu command dispatch includ tcl script specif queri dispatch invok tcl interpret execut instanti oper node form execut queri regist exist dispatch dispatch primari function control cnet execut link maintain inform current set activ node relationship activ node dispatch servic event stream eman applic user gener event process system order initi instanc environ commun cnet analysi tool applic shown figur applic work thread robot thread simul oper singl robot instrument point part thread invok sensor write event data share buffer falcon monitor run separ extract event data buffer forward binari encod binari messag format commun infrastructur monitor event arriv commun interfac decod pass event dispatch dispatch forward event constraint requir violat occur constraint result steer command constraint notifi dispatch turn gener control event commun infrastructur falcon receiv decod event invok steer function applic code approach instrument emploi falcon replac dynam instrument techniqu binari edit emploi moss network layer network layer robot applic robot thread dispatch falcon steer invoc figur commun infrastructur autonom robot parallel applic work multiag reactiv robot system simul set autonom robot navig goal stimuli environ control scheme evalu applic test physic robot field applic robot group robot wander attractor encount move attach return object home base hazard applic queri cnet rule languag rule languag incorpor featur activ rule languag starburst meta relat tempor queri languag constraint condit sampl constraint figur user violat occur robot transit acquir state subsequ transit deliv timestep constraint queri gener deriv event robot transit wander state acquir state receipt event nest queri evalu notic incorpor negat quantifi exist nest queri fail time arriv deliv event receiv fail nest queri yield satisfi outer queri gener steer action execut goal gain forc robot identifi extens descript robot applic languag adapt queri evalu adapt capabl cnet make dynam long run applic adapt report paper replac rule effici rule rule surfac user gain deeper understand system observ write detail queri replac exist creat rule select wander acquir meet creat rule select exist select acquir deliv meet steer figur robot transit acquir transit deliv timestep effici queri occur algorithm control trigger statist data gather event stream optim queri base statist data yield reduct number event process queri statist data applic data consid order queri select simpl swap select oper dramat reduc number event process node user control adapt provid extern user interfac user deactiv queri algorithm call dynam constraint detail section dynam constraint optim tradit queri optim involv step ffl find intern queri ffl appli logic ffl map queri altern sequenc elementari oper ffl comput cost access plan select lowest cost intern relat algebra queri graph transform includ simplifi queri avoid duplic effort standard queri conjunct normal form optim differ optim applic differ plan gener cost comput plan select plan gener appli heurist push select gener multipl plan base indic order critic factor determin cost plan select select condit select defin fraction tupl satisfi condit select condit comput plan select scan tabl relev attribut event stream address select estim perform runtim import part research involv adapt select estim model select estim complic fact constraint violat occur spike implic assum uniform distribut data event stream prevent simpler select estim assum distribut implement select estim involv discuss ffl random sampl comput select ffl build support queri runtim swap queri optim cousin select estim select estim obtain earlier simpl statist minimum maximum valu accur attribut valu uniformli distribut obtain histogram number element bucket vari suffer limit shown provid accur estim distribut data fix height bucket built sort record partit record bucket sort record adopt sampl techniqu approxim distribut valu kolmogorov statist analysi estim error kolmogorov statist state relationship confid sampl size sampl size tupl fi fraction tupl sampl attr confid fraction tupl entir relat attr interv fi sampl size depend number tupl relat queri dynam constraint optim achiev number cooper compon shown figur execut node collect statist data relev attribut histogram trigger initi histogram establish period basi node trigger send request optim paramet wait separ retriev abstract syntax tree base node point includ select data algorithm figur invok algorithm compar cost factor parent select node child select estim parent parent child swap posit tree complet optim gener save syntax tree issu command dispatch alter exist node dispatch notifi node delet save accumul state prevent miss violat invok tcl interpret add node bind save histori dispatch cnet optim histogram script abstract syntax tree figur flow control dynam constraint optim push parent child return child parent parent child swap posit return parent chang tree figur optim algorithm cost data evalu time individu oper time comput total execut time queri valu predict execut time queri highlight analysi overhead benchmark number obtain set twelv set composit vari depend oper measur measur gate constraint consist singl gate oper accept singl primit event gate oper serv node test oper simpli dequeu event return measur remain constraint consist gate oper oper type measur twelv constraint select select oper accept primit event accept deriv event result shown tabl result obtain set event gener robot applic run sun ultrasparc time shown gate oper mislead gate oper fact time shown oper execut time gate project select join tabl result figur cnet typic mix includ overhead dispatch project costli oper respect cost reason project creat event event receiv verifi reason benchmark compar comput time versu measur time typic mix realist queri individu queri mix set accept multipl event sensor queri structur typic mix shown figur queri accept input sensor remain queri accept deriv event shown tabl typic mix result oper number time singl oper measur execut time greater comput execut time activ analysi tool benchmark valu unabl account suspect cach effect benefit optim evalu criteria measur benefit optim total time execut measur time event event receiv queri execut action result includ total execut time number oper total op measur execut comput execut time time tabl typic mix perform constraint optim unoptim form constraint appli event stream event optim optim unoptim execut time number op op tabl optim complex constraint queri shown tabl accept input event type optim push select yield reduct time reduct number oper breakdown unoptim version oper attribut number join reduc optim version optim polici push select effect reduc number event reach join optim node greater gain optim achiev optim consid factor factor subexpress common tabl illustr effect result benefit accru result factor total number oper reduc half filter execut time drop insight problem gain oper percentag attribut project project make total time total oper filter project account total time total oper time gain substanti filter place evid number partial lost addit project oper costli benefit depend number filter capac select condit weigh cost introduc project filter capac determin select factor defer factor locat filter filter locat closer cost filter weigh filter filter filter execut time number op op tabl effect factor benefit lower latenc lessen network demand relat work al monitor control system observ progress parallel system simul steer simul monitor data obtain simul watchdog process forward analysi compon analysi perform expert system satisfi rule trigger steer command expert system hazard detect continu applic reason cnet analysi easili expert approach rule encapsul knowledg requir setup time knowledg potenti violat incorpor monitor assert check tool toolset monitor assert check perform trace data symbol execut specif written languag specif assert assert includ tempor user base provid class assert execut origin specif gener execut trace highlight violat assert similar support tempor complex directli appli hazard detect liu pu work continu queri client specifi continu queri inform store distribut environ internet object comput queri return entir result relat trigger subsequ chang inform return primari object minim amount inform effect met return relat larg contrast primari goal hazard fast event constraint violat fast requir queri reevalu event data arriv constraint infrequ return singl event object approach snodgrass develop inform base approach model program behavior treat monitor inform state state relat program state activ observ monitor queri languag call tquel refin relat approach origin al explor monitor parallel distribut applic refin approach monitor request explor idea integr compon parallel program environ uniform inform model prior applic formal gear perform evalu focu perform evalu collect organ inform hazard detect orient discard inform earli event violat work complet path evalu tree shift focu make techniqu tractabl earlier work prior approach monitor requir constraint compil time exploratori potenti safeti applic relat model hazard detect accompani adapt techniqu work earli earli recognit check hazard prevent synchron requir constraint applic cnet architectur synchron asynchron check futur work paper present result research detect achiev relat model event stream detect techniqu develop broadli applic distribut parallel specif domain appli work context paper safeti critic applic exist approach base formal provid requir assur safeti detect approach complement formal techniqu provid greater level assur ongo work appli formal high perform comput run multiprocessor cluster workstat queri evalu usefulli appli distribut laboratori data stream filter constraint check data stream optim consid agent oper data sourc sink appli optim techniqu entir flow enabl optim multipl comput instrument data scalabl techniqu emploi relat approach offer benefit rich queri optim techniqu make detect scalabl respect size complex problem address solut offer mean adapt applic execut environ abil creat event type rule specif ongo work includ distribut analysi enabl commun constraint irrespect constraint locat measur perform select optim algorithm research continu fruit select estim statist offer interest potenti make statement select entir queri appli filter distribut laboratori environ tempor aspect languag richli exploit applic actual applic refer develop intellig monitor control system heterogen numer system simul proc annual simul april tucker balch ronald arkin commun reactiv multiag robot system autonom thoma dynam adapt softwar acm transact comput monica bruce approach monitor real time specif workshop parallel distribut april dixon introduct statist analysi book greg portabl binari data stream technic report colleg georgia institut report greg beth high perform commun distribut laboratori ninth iast intl confer parallel distribut comput octob greg infrastructur program monitor steer sigmetr symposium parallel distribut tool greg jeffrei vetter monitor steer parallel program practic aug matthia jark jurgen koch queri optim system comput june carol david languag analysi displai perform inform parallel distribut applic intl confer program jeff kramer jeff mage dynam configur distribut system ieee transact softwar april nanci timothi safeti assert system intl symposium fault toler page june ling roger tong zhou differenti evalu continu queri technic report depart comput barton mark jonathan jeffrei bruce karen krishna parallel perform measur tool ieee novemb david dewitt histogram estim select factor queri acm sigmod page june katia perform servic applic sigmetr symposium parallel distribut tool david richard snodgrass dynam monitor distribut parallel system ieee transact parallel distribut juli sg parker cr johnson scientif program environ comput steer proc supercomput page gregori charl connel accur estim number tupl satisfi condit acm sigmod page june beth greg jeremi jeffrei vetter interact applic distribut laboratori ieee beth approach constraint analysi technic report colleg georgia institut report pratt data flow analysi sigmetr symposium parallel distribut tool daniel roger keith bradlei schwartz overview pablo perform analysi environ depart comput west illinoi novemb randi daniel reed autopilot adapt control system futur gener comput special issu data submit novemb daniela rakesh jha adapt resourc alloc complex applic ieee system symposium decemb beth softwar approach hazard detect analysi safeti constraint symposium reliabl distribut page ieee comput octob richard snodgrass relat approach monitor complex system ieee transact richard snodgrass relat approach monitor complex system acm transact comput richard editor tempor queri kluwer academ richard michael christian andrea steiner ad valid time dbl novemb jennif widom stefano editor activ system morgan rich dynam forecast network perform support dynam schedul network weather servic distribut comput august yu meng principl queri process advanc applic morgan
DB/670 3 wim bern danni de de depart comput belgium abstract present program transform base bottom evalu logic program explain program wrt set unit queri exampl excel obtain bottom transform combin tradit top result conceptu cleaner techniqu requir complic control approach introduct logic program evalu top build search tree queri bottom start fact fact deriv subsequ success set program comput strategi merit gener top evalu consid effici prefer evalu techniqu logic lot program evalu termin bottom complet termin class program make suit deduct evalu strategi kind program queri equal top evalu program logic program set call partial import transform techniqu capabl remov ineffici program basic idea program part evalu program part depend gener program comput result remaind input program comput effici achiev partial deduc essenc evalu extra control compon assur termin process gener partial deduc logic program top evalu program respect partial instanti queri repres input part techniqu suit inform respect flow top fashion program tion resid flow bottom program account hard automat top start gener requir sophist control mechan reach interest inform obtain satisfactori section paper give exampl program wrt set unit partial instanti queri discuss basic problem top section develop dual transform techniqu base bottom evalu logic program capabl achiev section show techniqu integr top demonstr combin requir sophist control mechan top part order achiev amount possibl open involv program comparison work direct futur research found section definit program goal motiv top motiv exampl implement abstract data type repres list append program gener program run varieti specif repres set unit softwar engin point abil give adt part program worthwhil develop point fix gener append program wrt specif yield version append answer queri previou version classic longer run list form adt input meta interpret wrt object program vanilla meta interpret aim wrt object repres number origin predic expect top kei idea automat partial deduct consist build number cover complet comput goal program program control partial deduct conceptu divid level refer local control deal construct possibl incomplet atom obtain unfold guid input provid root atom input part propag tree unfold criterion decid atom goal unfold endang termin process base compar atom atom encount deriv built atom unfold argument grow wrt unfold atom case relat hold definit relat atom finit alphabet call whistl iff infinit seri atom alphabet atom sequel gener notat whistl denot whistl relat exampl remaind paper relat eleg instanc whistl relat terminolog whistl relat give good result section definit rang predic oe denot strict instanc defin term shown properti proposit finit whistl relat global control concern set atom built ensur correct produc maxim partial atom leaf construct fresh tree built variant atom root set partial deduc atom produc set expand infinit appli base whistl replac atom specif construct predic branch root tree head leav bodi detail correct control partial deduct found note partial deduct autom subset transform comment relationship found problem unfold criterion base partial built work inform unfold deepli endang termin present tree build deriv atom unfold criterion stop deriv prematur subsequ atom argument shrink size admittedli predic make creat list fix length element result return ill ill ill make ill repres class predic build structur call base predic depend structur built unfold techniqu problem deriv built unfold call eventu termin figur partial make depict argument atom fail figur make atom grow wrt potenti unfold eventu lead success deriv instanti reconsid aim remov call propag concret list append predic queri start top absenc instanti argument queri reflect fact inform suppli due simplic top difficulti obtain requir longer true shown fulli gener automat top vanilla meta interpret requir sophist control mechan interact local global control fact uninstanti queri achiev system tune exploit inform queri imposs reconsid adt program defin librari distinct predic adt list program wrt adt imposs singl queri remaind develop techniqu program outlin partial inform queri queri elabor propag inform bottom fashion show result transform techniqu integr good effect top bottom ground consequ logic program defin oper start set calcul atom arrang direct acycl graph dag section subsequ show transform program extract dag lack proof omit bottom evalu definit annot dag dag atom connect carri substitut node activ passiv addit node node dag basi dag node passiv comput activ node node annot atom deriv consequ consequ defin oper definit program oper dag defin variant lm set activ atom fb fc cm set atom fl fl fresh variabl renam oe lm cm oe consequ oe enter fl edg fl oe oe ad oper build annot dag edg leav atom activ oe enter substitut label edg fl oe oe restrict variabl variabl renam fl label edg fl oe oe discard deriv oe exampl atom dag simplic reason renam strictli edg label relev part program dag unconnect unit result depict figur definit figur result appli definit dag node path denot edg exist node edg exist path definit consequ node dag denot node path gg edg connect node consequ denot part atom deriv consequ dag figur depict figur figur top care structur build process naiv appli produc infinit dag abstract call replac possibl infinit number atom deriv singl gener make node activ produc dag definit node annot dag dag obtain ffl node remov edg remov ffl passiv activ node enter dag annot edg oe edg fg ad algorithm annot dag annot dag repeat path activ node path substitut make proposit algorithm termin input dag dag depict figur whistl hold atom result depict figur passiv node node annot figur result appli abstract dag figur bottom algorithm consist altern abstract fixpoint reach algorithm program fg repeat theorem algorithm termin program appli algorithm program yield dag depict figur transform program gener residu program annot dag straightforward atom deriv step node occur path fact gener atom dag true iff instanc node consequ proven program gener figur appli algorithm program definit node dag path nearest node substitut path definit dag node set predecessor defin gp exist path annot annot oe observ node dag predecessor incom path bodi atom fresh dag definit residu program dag defin fh oe oe annot gp oe oe theorem program program extract definit dag built algorithm ffl comput answer substitut ffl ca ca fl exist substitut oe empti ffl finit fail sound complet transform render addit specif answer theorem state bottom transform preserv finit convert infinit failur finit show queri fail infinit origin program fail finit transform program techniqu achiev effect dag figur set predecessor gp fg gp fg gp fg gp fx gp fx fx gp fx gener program queri interest result program queri solv definit predic remov kind inform top natur combin bottom transform tradit top phase integr top control bottom whistl relat detect infinit path consecut fact predic deriv long structur grow wrt earlier deriv fact program fragment hard automat unfold ill argument grow success argument shrink success consequ deriv bottom fashion start base case ill bottom transform end unit make make logic program predic process structur shrink success call vanilla meta kind round bottom deriv argument newli deriv instanc head grow wrt argument atom unifi mean deriv solut problem design bottom control structur grow bound structur atom grow result atom bodi rule problem top techniqu deal possibl integr bottom transform top partial deduc mix bottom top section program set unit queri interest denot set bodi atom work extend program reconsid vanilla meta interpret type check accumul queri interest residu program creat dag gener algorithm origin definit result bottom head residu instanti head origin atom instanti node carri interest structur worthwhil atom top inform propag upward unfold atom sophist reach amount inform unfold atom origin program queri simpl unfold strategi atom unfold match singl head program unfold produc depict figur figur determinist bodi atom predic residu program remov useless consequ instanti made bottom transform program structur filter predic definit definit structur renam structur solv solv solv solv solv solv solv solv bottom transform step propag definit lead remov superflu call result object program overhead due origin meta interpret suggest transform phase altern obtain program inform maxim propag fulli automat control altern program deriv program transform cycl continu long significantli determin program qualiti open cost analysi direct futur research discuss work bottom evalu logic program studi field deduct basic idea propag object bottom bottom evalu program relat standard unfold techniqu control adapt top scheme base bottom evalu present excel obtain combin tradit top approach import bottom compon enabl evalu program fragment obtain inform obtain unfold due bottom inform flow structur inform propag top compon unfold deepli order reach inform case propag result concentr built complic unfold rule divid bottom top phase result conceptu complic techniqu result obtain gener requir complic control concret meta interpret demonstr ground meta interpret complet gener fulli automat top techniqu trivial task sophist approach base extend local unfold rule global inform result techniqu complet gener spite turn suffici effect involv meta interpret hand shown result obtain trivial unfold rule combin basic bottom transform phase ongo research show work present paper eleg power basi handl gener meta program meta program term object inform propag ad bottom phase improv pure top top partial deduct combin specif program transform base abstract ground version deriv success inform residu predic techniqu correctli deduc answer substitut fx ag due gener abstract domain msg deriv consequ extend base algorithm deriv answer approach consequ comput order program gener structur independ top atom perform atom consequ success inform deriv dag case case techniqu deduc techniqu achiev result futur tune transform preserv comput answer substitut plan investig refin bottom guid search atom avoid unnecessari integr magic templat techniqu direct bottom search top inform impact bottom transform phase requir control top finer integr present techniqu apt meta effect involv program studi detail impact power top control acknowledg anonym remark wim support grant flemish institut promot research industri belgium bern marten partial support applic abstract danni de senior research associ nation fund scientif research refer bancilhon ramakrishnan amateur introduct strategi acm sigmod intl conf manag page transform sketch bolei intern workshop process declar knowledg volum page springer de conjunct partial algorithm experi submit public de marten tutori program jw page decemb mit press lin cost analysi logic program acm transact program languag gallagh logic tutori acm sigplan symposium partial evalu program page june acm press gallagh bruynoogh sourc transform logic program page april gallagh bruynoogh deriv algorithm program gener synthesi program partial deduct framework michael lowri robert autom softwar page aaai de control partial deduct normal logic program acm transact program languag de logic program specif intern symposium program logic program page septemb springerverlag lnc lloyd foundat logic program lloyd partial evalu logic program journal logic specif logic program joint intern confer symposium logic page mit press marten de automat finit unfold measur journal logic marten gallagh ensur global termin partial deduct flexibl page villag june mit press transform logic foundat techniqu journal logic algorithm gener posit jw page decemb mit press tamaki sato transform logic program page juli ullman system comput scienc bottom inform propag partial deduct intern workshop special declar program page port long island ny octob report dept comput belgium marten juli note comput scienc seri
ML/671 6 framework fuzzi lattic vassili dept electr comput engin aristotl thessaloniki greec abstract theoret framework delin learn call framework fuzzi suggest mathemat sound tool deal separ jointli dispar type data includ vector fuzzi specif scheme cluster classif capac deal miss care data scheme question implement neural network learn scheme emploi pattern recognit data set includ benchmark data result compar learn techniqu literatur aim mutual establish theori learn includ probabl fuzzi set bayesian theori adapt reson theori introduct intensifi develop complex system industri servic call compar tool context employ effici learn techniqu learn major advantag autom develop model applic learn typic carri endow kind comput intellig learn effect collect enhanc pertain specif applic number learn decisionmak scheme context older approach intellig base optim control applic robot shown neurobiolog motiv algorithm call featur map linear vector quantiz emploi learn statist learn consid comput approxim correct learn consid support vector machin emploi bayesian emploi occas convent machin learn reason consid machin learn methodolog process natur languag present method learn cluster space heurist function neural network paradigm learn fuzzi learn fuzzi logic emploi public includ neural fuzzi learn consid jointli combin includ learn fuzzi system model scheme learn involv singl type vector vector real number wide statist learn interv featur dealt predic emploi rule artifici intellig techniqu learn potenti emploi jointli dispar type data made establish techniqu learn note order improv common applic fuse dispar type data transform dispar data question singl data type face imag integr fingerprint vector numer featur extract enhanc person identif similar practic common robot fuse data stem assort sensor numer data convert nomin data fault diagnosi problem type data arbitrari symbol data sequenc binari number pattern recognit applic involv neurocomput worthwhil mention attempt fuzzi set theori base comput word vein linguist data triangular fuzzi membership function emploi jointli numer data identifi linear system fuzzi number interv support neural learn base expert knowledg note underli typic fuzzi model invari total order set real number joint accommod instanc proposit facilit context convent fuzzi set theori applic compet theoret foundat enabl learn involv jointli dispar type data chapter delin demonstr capac framework learn cluster classif base jointli dispar type data call framework fuzzi base theori mathemat lattic employ lattic data type practic interest includ fuzzi proposit lattic order dispar type data comput scheme due properti cartesian product lattic dispar type data treat jointli member lattic note notion defin lattic interv lend demonstr learn scheme work histor develop lattic theori outlin sequel gener interest lattic emerg spin work formal proposit logic half nineteenth attempt formal proposit logic led concept boolean algebra investig axiomat boolean algebra end nineteenth cs peirc found introduc lattic concept research ideal algebra number led concept work start gener develop lattic theori demonstr import lattic theori show unifi framework hitherto unrel develop mathemat disciplin util lattic proposit calculu set real number lattic element total partial order lattic theori emerg tent ground unifi applic logic numer comput techniqu import argument employ lattic underli order relat note numer problem involv made boil order relat measur similar shown tool exist note impli potenti extend learn techniqu specif data domain gener lattic domain potenti demonstr section convent learn algorithm applic domain unit enhanc applic domain gener lattic context lattic emploi rigor sound cluster classif involv dispar type data remark rigor necessarili util eleg probabl theori rigor treatment uncertainti found numer applic fuzzi set theori appli wide theoret sound treatment ambigu work chapter omit mathemat detail proof theorem emphasi util concret learn techniqu refer mathemat proof interest reader layout chapter section delin mathemat platform learn section review notion tool section learn scheme scheme cluster scheme classif scheme emploi learn section data set includ vector linear fuzzi crisp set section connect shown establish theori learn includ probabl fuzzi set bayesian theori adapt reson theori section summar princip achiev work delin potenti futur work exampl appendix illustr geometr plane util techniqu suggest platform learn pursu capac process dispar type data partli order consid definit partli order set set binari relat satisfi condit upper bound subset poset element upper bound upper bound upper bound notion lower bound greatest lower bound defin dualli lattic type partli order set definit impli definit lattic partli order set element greater lower bound denot upper bound denot lattic complet subset lub work chapter deal sole complet lattic set previou definit complet lattic element greatest element ol il partial order relat crisp lattic denot join meet oper crisp lattic call incompar symbol dual crisp lattic underli set partial order work dual lattic denot specif exampl lattic shown sequel set real number meet join real number defin minimum maximum note symbol subscript refer set real number appar relat call total order chain lattic complet exist lub set close interv complet lattic complet lattic power set set lattic impli partial order relat convent set relat note complet lattic greatest set real function complet impli lattic order relat defin impli collect convent fuzzi set membership function defin real constitut complet lattic membership function bound function applic notion similar piec data notion complet lattic notion defin definit complet lattic measur σ map condit ol element consist properti il denot greatest element complet lattic measur shown argu notat emploi interchang applic notion proxim distanc defin rigor quantifi proxim definit distanc real function set satisfi triangl note function satisfi condit definit distanc call function rest chapter attent framework fuzzi lattic review section framework fuzzi lattic framework fuzzi introduc section summar terminolog tool chapter orient applic rigor mathemat substanti theoret result present proof concept fuzzi lattic introduc order extend crisp lattic order relat pair crisp lattic extend relat regard fuzzi set note work fuzzi set denot pair μ membership real function definit fuzzi lattic pair crisp lattic fuzzi set fuzzi lattic dual fuzzi lattic defin μ μ collect fuzzi lattic refer framework fuzzi lattic short definit crisp element element note fuzzi lattic necessarili impli transit fuzzi lattic note convent transit properti hold jointli impli number definit measur enabl fuzzif crisp complet lattic defin measur crisp lattic real number attach element type function suitabl definit measur crisp posit valuat function section deal posit valuat function conveni remind valuat crisp lattic function satisfi valuat monoton impli posit impli posit valuat function lattic render lattic question metric space metric proof theorem shown theorem exist posit valuat function crisp lattic suffici condit function measur lattic note emploi sequel denot remark function equal posit valuat function complet lattic pair impli fuzzi lattic effect procedur handl lattic lattic interv defin set lattic word interv cluster interchang function map lattic collect interv includ empti set interest subset includ trivial interv note regard function map lattic collect singleton atom result learn proposit complet lattic set interv impli complet lattic element denot impli lattic relat la interv lattic join lattic meet proof proposit term coin collect interv lattic definit lattic famili lattic denot collect lattic index set finit cardin famili call constitu famili collect famili lattic lattic denot interest notion stem member famili term class categori reserv interchang denot member famili interv definit lattic class defin famili union oper set class lattic denot note class decomposit finit lattic famili interv class famili interv hold wk famili interv repres distinct decomposit class shown class uniqu quotient class denot includ famili repres class class activ function respect concret measur σ defin definit class activ function respect measur σ real valu function max class quotient note specif class impli fuzzi set membership function class activ function specif thought activ class presenc interpret interv class previou analysi measur lattic measur impli suffic exist posit valuat isomorph detail interest reader refer analysi section carri lattic point product lattic call constitu lattic line notat constitu lattic dispar lattic lattic impli domain dispar data process proposit show valuat function impli product lattic valuat function constitu lattic proposit valuat lattic function valuat product lattic note valuat monoton valuat monoton valuat posit valuat posit valuat simplifi notat convent made element lattic product lattic specif element lattic denot element lattic denot size lattic defin section definit size lattic interv respect specif posit valuat lattic defin function note size lattic interv regard type ham distanc atom size atom specif applic note care includ data dealt suggest interpret note terminolog valu valu constitu lattic product lattic interpret unknown interpret attribut valu valu dealt replac valu dealt replac constitu lattic illustr geometr plane util tool techniqu complet lattic unit squar plane lattic consist ident constitu chain real number note complet lattic element greatest element concret number repres complet lattic interv atom place interv place greatest interv posit valuat function emploi constitu lattic isomorph constitu lattic valuat defin product lattic isomorph defin box unit squar shown figur box repres box repres consid figur figur figur input box calcul sequel singleton consid figur figur demonstr util measur capac handl data data complet lattic compon compon figur assum attribut attribut figur xm xm figur assum attribut attribut figur xd xd xm case datum expect consist properti definit note exist data membership exist data membership xd specif hold section tool emploi scheme scheme learn scheme scheme cluster classif neurocomput implement scheme stress past term fuzzi lattic coin implement neural implement fuzzi algorithm implement convent digit section neural implement kind implement scheme cluster introduc decid switch adher terminolog establish subsequ letter show measur σ initi denot scheme applic initi signifi neural implement note measur measur theorem valid scheme train techniqu maxim simplif refer illustr geometr appendix chapter note aim techniqu maxim interv class repres class quotient learn phase input memor learn proce instant exist learn class ck present input initi class exist class class ck calcul activ presenc δ competit class winner competit class cj largest index winner class wl denot interv class cj correspond max winner select largest broken select winner smallest assimil test size respect select posit valuat threshold size wl defin previou step assimil condit replac wl cj replac class quotient assimil condit fail cj class winner found memor interv provid suffici system memori memori turn accommod interv δ end train data label attach unlabel class interv assign categori train data constitut major train encod interv question previou scheme continu input learn achiev singl pass train data input assign activ provid size step threshold occur quest winner resum class winner found input δ memor memor mean input δ learn emploi learn capac disengag sequel test effect test input categori label calcul activ class ck presenc calcul membership fuzzi set assign δ winner competit assign δ fuzzi set largest membership class assign index class δ note number mf constant competit learn scheme emploi lattic measur σ aim crisp set identif interv defin cluster total number learn number learn total number learn interv partit class mf class extern teacher shown scheme scheme reason carri rapidli singl pass train data disadvantag cluster learn total depend order train data model present remedi defici price polynomi learn time complex scheme cluster scheme ensu previou cluster measur σ distanc function note regard convent radial basi neural network scheme classif letter show train phase test phase carri emploi distanc function measur remark scheme introduc appli surgic procedur recognit soft tissu train cluster carri consist interv lattic element assum train data cluster distanc distanc threshold td contradict occur data class put td trigger cycl repeat cycl occur homogen cluster data singl class cluster conclud join oper lattic data cluster element lattic interv defin lower level cluster cluster conduct attach label lower level cluster label attach extern teacher note cluster assign label train phase scheme base make metric order test capac gener test phase base make measur σ test data fed scheme calcul class class largest lattic select provid threshold class assign current input data input data class classif scheme effect found requir pass train data note finit number train data train phase termin case train data class trigger repetit td homogen cluster includ singl datum scheme classif tightest inspir approxim correct statist learn rectangl learn game neural network carri learn find collect tightest defin train data test affect emploi measur σ lattic interv function categori function sequel set interv lattic set finit cardin categori label interv function assign lattic interv categori label finit number label definit fit set categori interv satisfi condit ä subset hold fit call tightest fit satisfi condit addit hold condit specifi fit lattic join number train lattic interv belong categori condit requir contradict fit train meant exist pair condit determin fit datum categori accommod contradict train datum figur show collect point partit categori label unit figur show tightest fit correspond point note definit impli train data tightest fit ä figur atom distinct categori collect tightest fit correspond atom figur sequel assum system alloc partit modul detail architectur learn pair copi perman pair categori copi memori copi temporarili tightest fit memori memori contradict condit tightest fit copi memori datum input buffer interv resid calcul lattic potenti train data categori includ root exist delet memori potenti leav contradict train datum insid tightest fit potenti leav specif root root question tightest fit move memori step manag topdown acknowledg memori train data insid contradictori tightest fit train data includ sole contradictori tightest fit delet contradictori tightest fit replac content memori content memori halt extern sequenti data train data find quotient tightest fit memori step order present specif train data pair yield collect tightest fit collect tightest fit resid memori replac quotient order maxim interv class quotient famili uniqu quotient tightest fit independ order present train data learn scheme memori base train set store upper bound process time complex calcul number train data test test phase end section repeat possess advantag identifi data order independ recognit error train maxim test data class due employ quotient deal dispar lattic element experi data set emploi evalu learn capac cluster classif data type result altern learn method cite sequel compar data set scheme emploi explain sequel vowel benchmark data set data set carnegi mellon collect neural net benchmark consist vector linear predict coeffici eleven steadi state vowel british english train set test set consist vector aim correct classif test data eleven steadi state vowel tabl show classif result method entri tabl insert reduc order method achiev larger test data put achiev smaller author experi scheme cluster tabl perform includ classifi eleven vowel british english vowel benchmark method displai order success achiev learn singl pass train data uniqu potenti applic euclidean space method hidden unit correct grow cell structur gaussian gaussian nearest neighbor squar node network gaussian node network radial basi function fuzzi squar node network fuzzi perceptron modifi model squar node network gaussian node network perceptron perceptron modifi model perceptron result shown tabl grow cell report train epoch carri order achiev result result gaussian fuzzi vote report rest entri tabl report research relev inform found document accompani benchmark common featur share gaussian fuzzi rapid train pass train data note emploi learn involv element lattic accommod illustr experi sequel behavior perform experi note perform fairli stabl drastic variat perform note wide rang valu note total number learn experi function size instanc number learn size benchmark data set benchmark emploi california irvin repositori machin learn aim correct identif radar return signal class base vector measur attribut class radar return show evid type structur radar return instanc train instanc test tabl summar classif result method author chapter experi scheme classif result linear nearest ross david instanc base report document accompani data set multiresolut algorithm variant neural cluster classif method report data approxim data emploi learn sonar benchmark data set sonar benchmark emploi carnegi mellon collect neural net benchmark data vector correspond sonar signal bounc metal cylind cylindr rock vector provid train test aim correct classif sonar test signal tabl summar result method back propag nearest neighbor result report document accompani sonar data result neighbor fuzzi adapt reson associ map vote simul data set classif emploi tabl recognit result benchmark method includ method test cluster backpropag multiresolut algorithm nearest neighbor perceptron linear perceptron tabl recognit result sonar benchmark method includ method train set test set fuzzi neighbor nearest neighbor angl depend data order angl independ data order surgic drill laboratori data data set origin laboratori measur england peter brett dave baker surgic procedur specif technic problem estim bone thick drill data estim problem treat classif problem approach learn associ previou drill profil specif thick valu order assign pair drill profil thick shown combin forc torqu featur locat cluster drill data thick shown cluster feasibl linear map forc featur torqu featur detail interest reader refer twelv group drill data obtain combin valu thick valu stiff typic thick valu mm dealt stiff valu group data includ pair drill result total pair data profil scheme treat group drill measur class class class label stiff sequel capac infer stiff drill data classifi class correspond thick mm learn experi carri scheme emploi profil class drill profil train data select learn homogen cluster homogen cluster group drill profil figur show typic result classif thick scheme data figur correspond thick mm mm mm exampl figur train set curv shown figur correspond thick mm mm mm curv regist profil thick versu displac note behavior classif drill progress figur dot line lead dash line solid line time bone denot figur vertic assign thick drill figur measur thick shown mm mm mm maximum measur time denot figur vertic determin determin thick drill experi misclassif record occur train datum class emploi pair profil misclassifi class classifi correct class misclassif attribut small number data train number train data perform improv correct classif note experi train data classifi correct class benchmark data set data california irvin collect benchmark data set includ inform readili encod lattic euclidean space data gender physic measur marin exist record train test data record entri entri gender physic measur data input ninth entri ag group output question learn predict ag uniqu benchmark input entri inform gender receiv valu stand femal research encod input entri input neural network reach perform tabl valu encod vector note encod decid arbitrarili user emploi implicitli boolean lattic hand encod total number input author chapter emploi product dispar lattic denot encod input entri singl input lattic figur shown figur lattic dimens encod remain input entri symbol treat symbol question treat lattic symbol symbol figur introduc author order make lattic question complet figur show valu emploi posit valuat function isomorph function θ emploi tabl scheme achiev margin perform due treatment data lattic scheme reduc total number input method correct hidden nearest neighbor hidden linear discrimin analysi figur symbol input entri benchmark consid lattic order symbol introduc author make lattic complet valu emploi posit valuat shown tabl show classif result method entri tabl insert reduc order perform author experi scheme remain entri tabl report document accompani benchmark perform scheme margin introduc addit overhead number input pass train data suffic stabl expect scheme teacher attach label learn correspond major data encod lattic interv categori consist number lattic interv total number cluster function threshold size size yield cluster experi size step averag classif correct rate test data standard deviat perform peak report tabl threshold size peak perform cluster locat data addit experi carri expect perform function train data order present result record order data uci collect data emploi lattic order posit valuat input entri result record lattic order posit valuat shown figur note addit experi perform deterior percentag point shown effici applic scheme learn recognit symbol conjunct real number input entri data set treat convert symbol real number scheme score high shown tabl learn rapid addit advantag scheme lattic order total number input synthet data fuzzi interv number convex fuzzi set interv support maximum membership equal dealt experi consid close interv real number denot set shown complet lattic order appli measur σ requir measur σ introduc posit valuat function posit valuat exist defici introduc measur real defin complet lattic satisfi ol element impli measur complet lattic area fin shown easili posit valuat function scheme cluster illustr geometr fuzzi number enter shown figur size threshold defin replac techniqu maxim appli expand maxim defin fuzzi number fuzzi set shown figur form fuzzi number discern figur figur fuzzi number enter figur show calcul fuzzi number incorpor defin class note lattic fuzzi number consid jointli dimens cylind band benchmark data set cylind band benchmark data set consist data record creat bob evan rr son exist numer nomin attribut data vector class attribut includ nomin data specifi class class exist data record data attribut denot data set train set explicitli figur fuzzi number enter replac expand maxim measur calcul measur calcul qualit descript result obtain process similar data tree induct mechan knowledg acquisit system call report detail perform quantit instanc cite rule predict eleven band incid septemb uci benchmark experi note numer data convert nomin data interv cylind band data set uci collect benchmark process scheme numer attribut valu treat number nomin attribut valu treat element abstract space probabl space detail techniqu section constitu lattic nomin featur defin probabl space abstract set valu nomin probabl measur power set underli abstract defin frequenc occurr attribut valu train data set cylind band data partit pair data set wai result report line tabl pair data set obtain select datum data cylind band benchmark train leav rest data test pair data set obtain select datum data train sixth pair data correspond line tabl obtain select datum data train leav datum test final line tabl correspond learn data emploi train experi reason run experi identifi categori cylind band data train data find tightest lattic interv consist numer nomin data tightest fit interpret hybrid datum largest conclud hybrid datum categori categori train data rise tabl line show test success percentag partit cylind band benchmark train set size test set line confirm expect data emploi train column show number found train data test data misclassif success cluster train test line tabl report result part data train line confirm capac gener note test datum insid tightest fit order assign categori verifi test datum tightest fit assign correct categori demonstr good capac gener number train data shown tabl format train data independ order train data present report tabl total number experi note number cluster number train data total number fairli small compar number train data experi connect establish theori learn section show establish theori techniqu learn includ probabl fuzzi set bayesian theori adapt reson theori connect probabl theori probabl space defin tripl ω abstract subset probabl measur note probabl measur set function defin satisfi sequenc disjoint set addit properti en en element call event probabl space impli lattic convent relat lattic meet correspond convent lattic join correspond convent note complet denot element empti ω denot greatest element boolean exist uniqu complement denot probabl measur constitut monoton valuat set event strict superset event differ set measur remark definit section function defin lattic note emploi uncertainti logic defin measur proposit ultim postul negat proposit space standard procedur construct metric space construct question effect defin relat space condit detail class call collect denot shown author set lattic probabl measur impli posit valuat lattic measur lattic fuzzi lattic note measur emploi previou section addit note scheme probabl space measur distanc function defin triplet metric probabl space connect fuzzi set theori fuzzi set theori introduc gener logic fuzzi set theori regard altern probabl theori deal uncertainti stem ambigu statist occurr begin fuzzi set theori develop recogn collect fuzzi set constitut lattic employ lattic order relat fuzzi set common applic scheme learn make explicit lattic order relat fuzzi set demonstr section note practic employ fuzzi set fuzzi system base fuzzi set emploi applic typic convex membership function interv support recal fuzzi set dub fuzzi interv number section author chapter fuzzi set theori defin suitabl algebra structur solvabl equat involv drawn impli arithmet advantag enabl regress involv potenti import benefit stem reduc complex larg number fuzzi rule order capac expect fuzzi system model gener incom data domain exist fuzzi rule synergi fuzzi set theori probabl theori applic tool blend smoothli probabl theori fuzzi set theori probabilist distribut fuzzifi valu paramet involv probabilist model detail exposit topic futur public connect bayesian metric probabl space defin section recal exist event measur empti set section function defin measur roughli function real number set includ set note number produc compar probabl measur probabl measur smallest set function interpret show subset note crisp relat function interpret show event impli event truth implic previou formula produc formula involv priori posteriori event probabl space express bn interpret event number bn express certainti event bn bold face word signifi conjunct bn bn bn bn bn bn bn bn bn bn bn bn bn bn bn mutual disjoint event ù previou equat bn bn bn bn bn bn bn bn notic formula reminisc formula involv condit bn bn denot impli event denot conjunct formula written bn bn bn order appli equat metric probabl space difficulti practic estim probabl measur estim practic measur rel frequenc occurr event connect theori evid probabl theori shown defici practic instanc treatment ignor absenc evid probabl theori appli principl assign probabl equal event assumpt easili lead appli theori evid introduc order overcom problem convent probabl theori includ principl theori question base work origin attempt model uncertainti rang probabl singl probabilist number work extend refin shafer rule combin proven applic base fusion multipl sensor gener theori base fuzzi set theori theoret point view note theori fewer axiom instanc basic probabl assign function obei addit properti probabl measur difficulti theori stem normal lead result contrari common expect order enhanc theori combin fuzzi set base theoret fact belief function posit valuat function straightforward arithmet manipul equat section formula impli qn qn qn qn denot event denot fuzzi lattic potenti applic area includ detail theori applic futur public connect adapt reson theori adapt reson theori introduc solv problem sensori code neural comput number origin art order model varieti neurobiolog behavior data accommod binari accommod binari analog input properti learn variant report consist layer node layer layer input layer categori instrument choic function match function ρ user defin constant vigil paramet shown author chapter choic function match function singl fuzzi measur shown constitut extens lattic data domain note oper choic function match function min oper real number point euclidean space min oper coincid lattic meet oper role small paramet denomin choic function break ti order select node smallest size result effect doubl test calcul number node layer select node largest break ti select node smallest size note emploi explicitli order select winner node measur σ impli interpret oper shown author chapter rigor input singleton atom competit place node order identifi node includ current input maximum winner accept includ insid input code implicit vigil paramet lattic measur σ signifi deep interpret winner choic winner match art detail enhanc insight oper futur public discuss work chapter dealt learn involv jointli dispar type data type data treat theoret framework fuzzi lattic introduc author chapter tool techniqu emploi learn demonstr compar effect scheme arrai recognit problem includ benchmark data data stem laboratori artifici construct data data treat vector linear fuzzi crisp set connect shown establish learn includ probabl fuzzi set bayesian theori adapt reson theori applic futur plan includ develop tool effect involv dispar type data investig refer section deal issu system stabil involv dispar type data note stabil system involv sole fuzzi set studi public includ emerg tool rigor unif numer analysi artifici intellig techniqu detail futur public appendix illustr techniqu maxim geometr interpret plane learn demonstr techniqu maxim specif show maxim explain techniqu maxim maxim class assum store distinct class input rectangl gener present system shown figur class compet compar measur winner class assum class reset search winner class class test satisfi replac note rectangl overlap assum famili lattic interv defin singl trigger techniqu maxim techniqu consid intersect expand maxim dimens singl class emerg consist rectangl shown figur rectangl corner rectangl corner rectangl rectangl collect maxim rectangl famili overlap figur figur quotient class input class shown figur note input trivial atom class class class class class class figur illustr techniqu class compet input class winner larger reset satisfi class select winner satisfi rectangl replac overlap rectangl defin enhanc rectangl produc techniqu maxim explain text input rectangl learn cycl resum illustr learn conveni simplifi box includ figur class enhanc datum shown figur replac consist properti definit datum box redund simplifi class class figur illustr learn input present class box updat note box enlarg box box word class consist singl box class refer dw reason scienc vol pp support vector machin classifi modifi kernel neural vol pp tool ear surgeri case studi design vol pp runtim analysi activ ieee tran knowledg data vol pp local minima radial basi function ieee tran neural vol pp lattic american mathemat colloquium vol ri gener properti radial basi function neural neural vol pp mk journal vol pp pl reason applic multisensor target identif ieee tran vol pp qualit discrimin approach gener quantit belief ieee tran knowledg data vol pp dm target identif comparison bayesian multisensor ieee tran cybernet vol pp learn algorithm neurocomput ieee tran vol pp ga massiv parallel architectur neural pattern recognit comput graphic imag vol pp db fast stabl learn categor analog pattern adapt reson neural vol pp base hybrid architectur ieee tran knowledg data vol pp system model competit learn adapt fuzzi infer ieee tran man cybernet vol pp pm squar learn radial basi function ieee tran neural vol pp ba ha introduct lattic cambridg great britain ap lower probabl induc multivalu annal math vol pp theori independ fuzzi probabl system ieee tran fuzzi vol pp process delai tree ieee pp se carnegi mellon repositori neural net benchmark introduct probabl theori john wilei ny rp modifi approach ieee tran cybernet vol pp cell structur network neural pp br probabl uncertainti inform vol learn fuzzi art neural vol pp rilei expert system principl pw publish ma lee yc extract finit state automata recurr neural neural vol pp lattic wh san ca mj topolog semant rule extract neural connect vol pp mj tp rule set product learn logic neural ieee tran neural vol pp face fingerprint person ieee tran pattern analysi machin vol pp rule pattern classif integr interv featur ieee tran pattern analysi machin vol pp statist approach uncertainti belief spread ieee tran man cybernet vol pp tanaka network learn fuzzi ieee tran fuzzi vol pp jl appli contextu constraint sentenc artifici vol pp jr machin statist pattern recognit ieee tran neural vol pp vg adapt reson theori learn larg phd dept electr vg lattic neurocomput connectionist scheme versatil learn make intern journal comput vol pp vg unifi framework hybrid inform intl conf intellig system pp linear associ drill profil ieee intl conf robot autom pp mj uv introduct comput learn mit ma object paradigm multipl sensor ieee robot autom pp gj ta fuzzi intern uk gj fuzzi fuzzi hall india berlin heidelberg stabil gener addit fuzzi ieee tran cybernet vol pp parallel fuzzi infer model distribut predict scheme reinforc ieee tran cybernet vol pp adapt learn control network neural fuzzi set vol pp bn shafer ieee tran fuzzi vol pp rc mg integr fusion intellig ieee tran vol pp eh experi linguist synthesi fuzzi logic intl vol pp jm multivari academ uk order mathemat dover ny gj discrimin analysi statist pattern john wilei ny cj pm uci repositori machin learn dept inform comput irvin rr theori sensor fusion autonom mobil ieee tran robot vol pp ht ea fuzzi crc press ny random stochast ny ps method transact trim mine associ ieee tran knowledg data vol pp level fuzzi lattic method soft tissu identif pp vg lattic neural network hybrid model ieee tran neural vol pp vg framework fuzzi ieee tran fuzzi vol pp vector machin object ieee tran pattern analysi machin vol pp rs dl econometr model econom ny de introduct lattic oliv boyd great britain gn robot ieee tran automat vol pp framework learn ieee tran knowledg data vol pp van hr measur fuzzi rule base ieee tran man cybernet vol pp mathemat theori princeton press pk neural network ieee tran neural vol pp pk neural network ieee tran fuzzi vol pp combin evid transfer belief ieee tran pattern analysi machin vol pp reson associ neural vol pp lg theori commun vol pp vn ya uniform converg rel frequenc event theori probabl vol pp theori learn england benchmark phd dept comput jr neural network fast increment learn noisi neural vol pp belief model make ieee tran man cybernet vol pp rr aggreg priorit belief structur belief ieee tran cybernet vol pp la inform vol pp la mathemat theori ai pp la logic comput ieee tran fuzzi vol pp mg bound method identif linear ieee tran cybernet vol pp hj fuzzi set theori kluwer academ ma lm rule paramet ieee tran man cybernet vol pp mark editor comput intellig imit ieee ny
AI/672 2 aachen technolog research group theoret comput scienc descript logic vagu knowledg christoph tresp ralf version paper publish biennial european confer artifici intellig rwth aachen informatik aachen germani descript logic vagu knowledg cb tresp theoret comput scienc germani abstract work introduc concept languag extens alc logic express vagu enlarg small realiz extens classic notion satisfi subsumpt modifi appropri longer satisfi satisfi main contribut paper sound complet method comput subsumpt introduct work motiv occurr vagu concept descript applic area inform high vagu inform system process kind data system solv problem due lack power basic method comfort base inform system obtain terminolog knowledg system origin brachman schmolz underli knowledg formal user concept languag formul solv problem advantag symbol transpar acquisit process inform lack possibl repres vagu concept definit manner current approach incorpor uncertainti calculu formal uncertainti calculi deal assumpt base previou observ assumpt lack featur definit evid complet vagu address problem inform complet vagu exist knowledg area concept clear demarc borderlin definit concept medic statement connect patient temperatur linguist categori high medium base concret measur valu question determin membership valu infer knowledg vagu concept provid method disciplin logic open gatewai vagu inform process articl structur concept languag base fragment order predic calculu underli order logic extend logic syntax semant concept languag defin subsumpt algorithm languag introduc main properti prove work conclud note extens logic basi signatur defin usual sort symbol set fs constant symbol set ps predic symbol jm fix set connector min max unari connector negat correspond unari connector qm fix set quantifi inf express defin denot infinit set variabl term variabl express introduc connector jm form express order predic logic quantifi replac inf weight express express truth unit written definit tupl call interpret satisfi sort symbol interpret set individu singl individu denot map map constant fs map map predic symbol ps total function definit oe map oe variabl element element connect term alloc oe fs oe fix variabl fix individu denot oe defin arbitrari oe ae realiz connector jm map min realiz function min realiz quantifi map set subset inf realiz infimum set truth valu state connector call manipul realiz function formal defin section definit weight pt tn iff cn iff exist iff ft exist dg notion valu cn set cn satisfi exist oe fix signatur notion semant consequ definit entail iff interpret oe precondit truth reason infer vagu knowledg valid satisfi entail analog consequ relat classic order logic descript languag intend built concept induct concept form call constructor concept denot atom unari predic constructor syntax logic correspond conjunct min disjunct max manipul inf max existenti min tabl languag alc fm serv start point form complex concept role denot correspond binari predic symbol crucial properti vagu terminolog modif appli verb noun research area fuzzi logic encompass linguist hedg mathemat descript modif subtyp gener notion call manipul manipul triangular function support languag call alc fm consist constructor tabl mean index fm languag deal infinit set manipul definit manipul surject continu function exist gener relat yield relat function structur manipul decomposit relat function function ae domain domain figur show realiz manipul membership complet match semant manipul total complet truth function denot deriv figur membership manipul alc fm interest concept special case procedur comput call subsumpt algorithm field medicin vagu notion unusu interest concept special case concept enlarg subsumpt alc fm defin td denot logic express induct defin tabl section introduc subsumpt algorithm reason algorithm properti algorithm comput subsumpt concept work special data structur introduc set infinit variabl arbitrari alc fm arbitrari role set truth design satisfi form resp map call evalu variabl role alc fm call weight assert inequ form op op op op oper id defin denot manipul definit model extend abox pair finit set weight assert finit set inequ pair call model extend abox interpret condit exist oe set occur variabl solut variabl map inequ satisfi extend abox call exist model subsumpt algorithm comput subsumpt correspond notion semant consequ definit idea problem subsumpt reduc problem determin adequ evalu extend abox yield solut system inequ subsumpt determin minimum valu obtain specif variabl sound reduct shown oe arbitrari interpret entail arbitrari counterpart form model extend abox found lemma lemma valu set satisfi iff extend abox ft gg consist oe defin inequ solut inequ satisfi model ft gg definit exist model oe readi prove main theorem paper theorem subsumpt alc fm subsumpt td comput theorem prove introduc algorithm comput subsumpt alc fm algorithm similar classic tableau method base complet rule definit precondit ft precondit ft precondit ft ft existenti precondit exist propag variabl ft supremum precondit ft ft precondit exist propag variabl ft infimum precondit ft formul algorithm properti requir prove theorem notion extend abox clash solut system inequ call extend abox call complet rule applic algorithm consist algorithm alc fm subsumpt algorithm input alc fm comput subsumpt td work tree node label extend abox start tree consist root label fa ft appli complet rule definit leav leav label complet extend abox appli rule leaf lead creation successor label extend abox optim method appli complet extend abox solv system inequ system inequ algorithm answer answer minimum comput valu remark alc roughli spoken crisp base languag alc fm manipul arbitrari truth valu concept tableau algorithm alc encompass singl rule singl alc fm base supremum valu obtain fix variabl role successor exist restrict imper valu obtain role successor smaller supremum resp larger infimum infimum restrict complet extend abox encompass system inequ lowest determin obtain minim valu complet extend procedur domain optim method select proof lemma import notion extens definit system inequ evalu call extens evalu iff lemma complet rule appli complet extend abox extend abox clash arbitrari consist algorithm termin prove complet rule model model model appli uc defin extens yield model model exist oe definit valu solut obtain extend model model model appli defin extens yield model ft model exist oe definit valu solut obtain extend model model model appli show exist extens model model exist oe definit definit manipul exist uniqu case defin extens case model model existenti model model model appli show exist extens yield model variabl model express valid exist oe individu variabl oe extend oe model supremum model model model appli defin extens model ft model exist oe semant alc fm tabl min determin model impli defin extens yield model model model model appli show exist extens yield model variabl ft model express valid exist oe individu variabl oe extend oe max model consist infimum model model model appli defin extens model ft model exist oe semant alc fm tabl inf max determin model impli defin extens yield model exist evalu solut defin interpret ffl set variabl ffl role defin ae ffl concept defin ae oe show model complet extend abox satisfi weight assert solut proof induct structur base weight assert form claim definit induct uc longer applic solut longer applic solut longer applic case ft ft case impli case impli existenti applic exist variabl solut definit remain show exist min interpret show applic arbitrari solut applic exist variabl solut definit remain show exist max interpret show applic arbitrari solut obviou termin proof similar tableau introduc idea defin map extend abox tupl fix length nonneg integ complet rule denot lexicograph order tupl lexicograph order impli termin algorithm extend abox consid obtain appli complet rule fx denot root node extend abox jcj concept defin number occurr disjunct manipul constructor jc uc jc tc jc jcj maxim role depth concept defin maximum role depth observ direct consequ definit complet rule variabl extend abox access uniqu role chain variabl uniqu level level defin access role chain length assert maxim role depth bound bound level variabl integ map extend abox nonneg integ defin ffl sum jcj assert disjunct manipul rule applic ffl sum number assert number assert existenti restrict rule restrict applic ffl sum number pair assert number pair assert supremum restrict rule restrict applic part termin complet rule shown impli assum rule appli assert tupl level valid jc replac number equal jc jc jc tupl compar lexicograph compon irrelev tupl compon chang analog conjunct rule existenti assum rule appli tupl level variabl introduc rule compon remain unchang compon existenti restrict rule applic compon consid compon remain supremum assum rule appli assert tupl level compon chang compon pair longer count tupl irrelev compon remain analog existenti restrict rule infimum analog supremum restrict rule lemma appli optim method determin minim solut complet rule gener system inequ base valu treatment max method domain linear simplex method solv inequ determin smallest solut method remov equat simplest split set occur min max case equat substitut ft ft max treat manner eleg directli express oper equat split set remain singl divid treat hand definit optim method linear function function equat easi comput theorem prove lemmata proof theorem due lemma algorithm termin satisfi case exist solut output definit output show entail lemma exist model assum exist model lemma obtain complet extend abox exist optim method yield solut obtain contradict assum output algorithm summari articl present step reason vagu concept crisp boundari major featur incorpor membership manipul catch semant adject major impact disciplin applic imagin base present reason method concret applic medic domain combin medic terminolog process tutor system teach find radiolog main problem address comparison vagu concept similar find student expert preprocess singl statement find translat concept definit number length defin concept small strongli intermix manipul alc fm good tool compar captur inher semant underli medic problem detail work natur languag preprocess method found open time remain question incorpor concret fuzzi set applic compar statement enlarg approxim defin fuzzi set atom concept attach fuzzi set work area reason vagu medicin deal concret case data extens appli heurist method present paper base logic foundat sound complet infer extend infer task alc fm consist arbitrari alc fm investig method sound complet equip work larg knowledg base question complex studi work refer baader sattler number restrict complex role descript logic intern confer principl knowledg reason morgan brachman schmolz overview knowledg system cognit prade possibilist logic handbook logic artifici intellig logic program vol nonmonoton reason uncertain reason clarendon press ao rc measur valuat fuzzi mathemat model medic diagnosi fuzzi set system meyer fuzzi expert system medic diagnosi acut pain method inform ein hybrid ansatz zur von zur probabilist inherit reason hybrid knowledg system german workshop artifici intellig probabilist reason terminolog logic principl knowledg reason morgan engin optim method chapter smolka attribut concept descript complement journal artifici tresp medic terminolog process tutor system intern confer comput intellig multimedia applic la zadeh interpret linguist hedg journal
Agents/673 1 robust team agent gal kaminka michael bowl novemb school comput scienc carnegi mellon pa abstract agent deploi system monitor agent coordin collabor robustli number agent monitor scale kei challeng number monitor consid grow exponenti number agent physic logic unconnect peer paper examin challeng team cooper monitor task import robust detect disagr present highli scalabl algorithm sound detect time linear number agent exponenti number present upper bound number agent monitor team disagr detect bound explor analyt empir thousand monitor scale thousand agent artifici distribut artifici coher coordin introduct agent domain monitor agent accomplish detect collabor import agent monitor deploi system long recogn theori rang industri system virtual environ train research interact robot agent monitor infrastructur import team cooper correct execut teamwork mandat task jointli execut manag interdepend number agent system monitor agent monitor activ agent time previou work explor approach reduc monitor activ accommod bandwidth target reli commun infer agent state base observ behavior monitor share environ kei challeng number monitor agent remain larg bandwidth inform monitor uncertainti state monitor task teamwork comput complex reason multipl agent interact exponenti number limit uncertainti previou monitor approach monitor agent commun observ monitor agent number agent agent physic logic monitor agent observ commun agent monitor call challeng limit connect paper address difficulti context import monitor task robust detect disagr teammat theoret empir research teamwork synthet agent stress agreement cornerston effect teamwork literatur differ term ground agreement theoret practic disagr sourc great concern investig section present set contribut present monitor navig space monitor repres agent agreement repres relev state monitor agent singl highli scalabl structur monitor exploit knowledg social relationship monitor team base earlier work visual differ wai section set result tackl challeng limit connect provid bound number agent monitor team detect disagr previou work shown analyt disagr detect monitor kei agent team limit connect restrict kei agent observ commun address show analyt sound complet detect practic monitor agent monitor kei agent show potenti limit number monitor agent exist central worst case requir monitor agent team result motiv practic concern applic monitor set realist number agent scale techniqu monitor agent detect disagr larg involv thousand perform specif monitor task condit limit connect addit analyt present empir evalu thousand monitor scale thousand agent paper organ section present motiv exampl background section present overview monitor task section present algorithm section present bound number agent monitor section address relat section conclud motiv background teamwork address human synthet import agreement featur belief teamwork theori defin agreement state mutual agent reason infinit belief belief belief proposit sharedplan theori requir mutual share recip plan execut phase joint intent framework mutual belief team goal belief goal achiev relev investig agent team agreement team plan jointli execut hierarch team oper task execut collect investig human teamwork agreement joint agreement featur environ import task carri team literatur recogn achiev maintain agreement difficult teamwork theori recogn attain agreement mutual belief undecid approxim practic approxim frequent involv assumpt trustworthi commun observ environ case fail practic due commun literatur address critic featur teamwork agreement agreement repeat theme recent work find disagr disagr due uniqu import agreement collabor critic team monitor detect disagr monitor agent identifi state compar state detect differ state featur design number monitor agent scale challeng monitor algorithm complex due uncertainti state difficulti observ commun agent realiz address challeng work develop robust team virtual involv develop synthet helicopt pilot agent carri varieti mission robocup soccer dynam simul requir teamwork involv develop agent coach agent monitor algorithm complex discuss agent continu commun monitor agent state monitor agent uncertainti state monitor monitor agent entertain multipl state individu agent detect monitor agent compar state agent state multipl state monitor select combin serv basi disagr occur number combin individu grow exponenti number agent exponenti number pick monitor borrow helicopt execut fly enemi teammat land scout identifi radio back agent switch scout attack fly forward join due radio equip attack fail receiv messag continu wait state disagr occur agent attack monitor teammat observ action infer execut scout start respond command land immedi fly execut role complet plan fly individu monitor state team size team number exponenti monitor attack attack scout fly fly tabl state team limit connect number agent agent logic physic maintain continu contact term limit connect gener denot limit abil observ agent action physic limit commun due reliabl robocup agent switch game trigger messag interrupt plan call begin requir player place home stand plai plan requir player plai soccer freeli due failur agent percept player fail hear fail switch plan disagr peer hear perfect player commun teammat stand detect disagr player commun rang bandwidth limit field view commun teammat face difficulti detect disagr previou work shown kei agent monitor detect agent monitor kei agent worst agent kei requir full connect case disagr detect disagr detect involv kei step repres state monitor state agent compar detect disagr section briefli describ gener monitor agent basic infer algorithm monitor infer disagr detect discuss detail infer contemporari theoret empir work teamwork synthet agent agreement hierarch midfield defend forward goali interrupt plai attack defend midfield figur robocup domain box plan denot kei effect focu monitor kei repres agent term execut plan monitor agent mark plan execut jointli member team constraint give rise structur monitor team organ hierarchi fulli provid overview repres monitor agent plan defin direct connect vertic plan edg signifi hierarch decomposit plan vertex parent incom hierarch decomposit plan conceptu parent compon decomposit parent repres vertic multipl outgo edg signifi altern subplan execut graph form tree hierarch decomposit plan descend vertex children edg denot atom step figur present portion monitor robocup simul team select player join game interrupt assum select agent game interrupt interrupt order select game plai interrupt plai follow end game servic player plan base role decomposit continu forward monitor engag execut path root plai attack make monitor agent associ inform agent path repres monitor agent state algorithm call present design monitor system associ plan set condit monitor tie sensor read receiv commun plan hierarchi condit monitor match sensor read messag receiv consist plan action plan tag plan match observ fail plan tag infer state unobserv plan children untag parent child tag tag fail match untag child parent tag children tag fail match plan hierarchi tag match observ multipl match sibl denot multipl process size plan hierarchi monitor multipl agent construct separ monitor agent specif agent state updat hierarchi repres method successfulli monitor agent deploi robocup civilian evacu schedul monitor agent behavior control hierarch hierarch behavior soar hac gener deriv monitor execut control avoid detail determin actual agent made prefer decomposit organ track fact detect disagr order detect monitor agent plan ideal plan hierarchi mark team plan assum team plan mark monitor instanc base execut teamwork model steam execut team plan team plan monitor agent team plan explicitli figur team plan interrupt execut member robocup team execut jointli member monitor state agent match team plan member agent agreement select team agent agreement team disagr announc note agent agreement plan mark team plan agent team facilit monitor agent discuss gener multipl exponenti number team evalu previou work formal defin coher hypothesi ratio number agent number select team plan coher measur agreement team tabl row coher level hypothesi coher level unlik agent agreement optim coher agent shown long monitor process complet formal definit section agent detect result select detect real failur theorem failur detect sound import monitor prevent alarm task agent needlessli difficulti emerg appli result monitor number agent singl hypothesi process find hypothesi potenti requir exponenti number rank base coher space requir monitor multipl agent arrai previou number size sort demonstr scale monitor address challeng time space complex present algorithm util knowledg team organ carri disagr detect linear time intuit repres coher recogn disagr case fail base earlier work visual algorithm differ import wai depth section kei idea repres agent singl share plan hierarchi share fulli expand plan transit annot determin execut plan tag successfulli repres hypothesi agent team execut observ agent match share process detect proce team member execut execut plan assum observ differenti mark match disagr occur member execut plan design differenti case member team select plan case member team select exploit knowledg social structur monitor form structur encod knowledg relationship node correspond monitor organiz unit top team repres entir monitor team team split leav hierarchi role individu role exist figur present robocup team root node entir node pointer node plan node share plan point coher plan monitor multipl pointer singl node pointer point plan consist execut team question robocup player execut plai plan member agreement teammat plan chosen player observ teammat figur pointer node team hierarchi plai plan node pointer plan execut forward pointer signifi member execut plan maintain pointer repres coher time mean team state unambigu disagr exist oper observ made agent updat pointer pointer parent pointer point plan coher state focu pointer agent part focu sibl move pointer agent point plan coher plan focu initi set pointer agent plan found plan team tag match state disagr detect player execut interrupt plan defend observ forward player run oppon goal execut attack servic defend tag interrupt plai match select monitor creat pointer observ attack point attack plan tag interrupt enter loop line propag success tag plai plan creat pointer root node team repres team root figur team execut plai team parent forward climb hierarchi algorithm hierarchi observ time plan condit test agent observ match execut tag successfulli match creat pointer node tag match plan tag match match null propag tag tag untag plan creat pointer team point plan match match disagr occur begin iter process repeat interrupt plan interrupt plai point node repres team disagr detect requir slightli modifi infer procedur children care path legal team question plan transit team execut make assumpt transit plan hierarchi mark tag observ arriv simultan process detect disagr overwrit effect monitor defend observ forward execut forward execut infer process observ tag plan match disagr detect evalu part match plan observ number agent size nest loop potenti entir team grow denot propag line entir theoret worst process disagr detect team plan worst complex kei complex maintain coher disagr averag cpu detect number agent simpl robocup robocup simpl simpl robocup robocup simpl figur compar axi mark number agent axi denot comput time cpu note rang axi repres underli hypothesi time complex contrast space complex compar addit space requir grow node repres agent addit copi entir plan hierarchi addit agent provid empir perform compar number monitor agent scale trial carri robocup smaller involv uncertainti intend explor perform boundari number monitor agent monitor problem observ monitor randomli gener monitor problem input execut time disagr record trial fix number agent figur summar result project averag comput time number agent figur show comput time robocup domain nonlinear predict monitor problem agent cpu domain domain curv linear uncertainti domain number consid grow factor complex observ match infer contrast complex curv roughli linear random monitor solv problem quicker averag form perfect linear execut time measur note monitor half complet task differ perform function mainten singl structur structur maintain fact consid coher linear number size plan exist scalabl abil repres failur disagr identifi agent extent disagr advanc monitor diagnosi augment mechan monitor agent reconstruct underli disagr facilit explicit reason agent separ teammat case complex domin kei number observ monitor long simultan observ process full arrai approach address wai reduc number agent requir observ section limit connect number monitor increasingli difficult monitor monitor algorithm domin number monitor effici algorithm kei question detect result limit number agent monitor section provid bound number agent monitor disagr detect begin short overview kei introduc import role disagr detect show central monitor requir monitor kei agent sound detect role kei agent distribut monitor set previou work shown sound complet detect place agent monitor kei agent provid stricter bound show agent monitor singl kei agent kei agent monitor kei agent disagr detect abstract underli monitor provid notat discuss agent state agent bs state plan select denot set construct base commun infer base bs observ behavior set bs bs state select note monitor direct access state make definit ground assumpt underli monitor process implement definit monitor agent monitor agent monitor complet plan execut monitor team agent bn team complet monitor bn complet monitor complet commonli assum individu gener hold applic mean set includ correct hypothesi typic includ match formal explor role kei agent disagr detect kei agent properti behavior execut plan suffici agent monitor execut plan identifi certainti disagr exist kei agent agent plai import role limit number agent observ disagr detect repeat formal definit kei agent definit team plan agent monitor agent agent role call kei agent assum symmetri plan observ fp attack scout role plan execut attack land fly scout fli land note behavior impli complet disambigu scout observ hypothesi execut permit fly basi condit detect disagr hypothesi detect disagr kei agent plan lemma execut execut notic disagr exist act observ execut alert bound number observ agent previou section agent detect disagr focu attent kei agent team central monitor monitor teammat focu attent expect detect disagr behavior ambigu monitor sound central set theorem central kei agent monitor case distribut monitor monitor previou work shown singl kei agent exist pair plan team emploi set team monitor kei detect complet theorem detect disagr detect place result interest build practic robust fortun condit easi team agent role role observ differ exampl set comput design identifi kei agent team prior agent simpli commun state monitor agent elimin team commun detect requir monitor prohibit size team limit connect agent physic logic distribut kei visibl effici algorithm present domin process observ agent reduc number observ agent improv monitor practic formal address defin monitor graph team definit monitor graph team direct graph node correspond edg correspond monitor agent monitor agent visual commun edg exist graph monitor graph underli undirect graph connect monitor graph team agent monitor monitor agent disagr undetect isol agent plan undetect fact monitor graph connect agent monitor agent necessarili detect disagr agent previou work shown agent monitor kei sound complet detect case exampl translat unrealist requir kei agent monitor team difficult instanc due commun rang restrict limit abil observ kei agent case experi shown player time theorem step address issu provid relax condit connect natur monitor respect connect node repres kei agent condit agent execut plan monitor singl kei agent pair plan involv pair plan monitor graph kei agent pair plan cliqu kei agent fulli connect theorem team execut plan kei agent monitor kei agent kei agent pair plan monitor kei agent bidirect cliqu underli monitor team emploi set monitor carri disagr detect sound complet proof induct number agent full proof stretch number present appendix theorem team overcom connect sacrif detect qualiti theorem translat freedom design agent monitor agent agent monitor agent monitor singl kei kei agent pair theorem gener glanc refer plan fact result discuss previou section theorem hold state featur share design pick monitor techniqu acquir inform construct monitor theorem depend method monitor commun observ connect monitor graph maintain visual edg monitor graph correspond commun link agent theorem repres advanc lower bound number agent kei agent monitor critic constraint reconstruct visual monitor graph thousand robocup game find sound complet disagr detect commun small percentag robocup player kei agent figur show monitor graph team overlai actual game situat monitor graph sound complet disagr detect bound empir constraint bar challeng find number agent monitor detect strong evid lead fact lower bound remain sound complet detect case kei agent monitor monitor singl kei agent translat failur detect figur monitor graph actual game situat thousand robocup monitor case examin present formal conjectur conjectur team execut plan monitor kei agent pair plan monitor monitor team emploi set monitor carri disagr detect sound complet relat work close relat earlier work visual algorithm deploi domain differ predecessor import util util probabilist disagr fact poorli visual task perform includ explicit check failur detect reveal potenti tradeoff express scalabl visual detect result full arrai approach team scheme implicitli coher kei constraint team repres singl coher repres coher team reason assign agent assum knowledg bobick reli coordin constraint footbal player recogn ram recogn militari maneuv huber automat built bayesian network agent coordin commun contrast approach util probabilist detect explicitli address scalabl discuss heurist method reduc amount knowledg agent coordin method includ prune nest commun allevi hierarchi work complement focu monitor team cooper exploit provid bound number agent work reduc comput load monitor singl work demonstr save achiev monitor agent klein present complementari failur detect techniqu protocol central monitor scheme monitor agent techniqu complement address limit scalabl concern discuss futur work literatur agent monitor agent order carri task number agent deploi team scale kei challeng number monitor agent peer exponenti number larg team monitor agent physic logic visibl monitor agent agent monitor paper begun address context critic monitor critic disagr teammat present sound disagr detect exploit organiz structur monitor team monitor number agent singl structur address challeng limit connect agent show bound number agent monitor team sound complet disagr detect distribut central monitor set result distribut case show fact detect situat agent monitor monitor empir analyt evalu demonstr result constitut advanc practic monitor larg team acknowledg milind jeff georg victor david dan discuss refer marc gari david hierarch agent framework defin agent behavior intern confer autonom agent tucker balch behavior learn robot team phd georgia institut john jani team mental team model trainer advanc integr deliveri philip cohen hector levesqu teamwork mark klein evalu domainindepend servic open system fourth intern confer multiag system page ieee comput societi mark ram needl plan recognit larg spatial domain involv multipl agent fifteenth nation confer artifici intellig page edmund coordin intern confer multiag system page barbara grosz krau collabor plan complex group action artifici halpern mose knowledg common knowledg distribut environ distribut marcu huber edmund decid commit action coordin intern confer multiag system page stephen aaron bobick framework recogn action visual evid sixteenth nation confer artifici intellig page aaai juli nichola jen control cooper problem solv industri system joint intent artifici gal david milind tamb monitor deploi agent team intern confer autonom agent gal kaminka milind tamb robust team monitor journal artifici intellig philip hector levesqu adapt agent achiev persist broker team fourth intern confer multiag system page ieee comput societi neal charl candac sidner plan recognit collabor seventh intern confer user model allen newel unifi theori cognit harvard lynn parker architectur fault toler multirobot cooper ieee transact robot april milind tamb track dynam team activ nation confer artifici intellig august milind tamb flexibl teamwork journal artifici intellig milind lewi randi frank john paul karl intellig agent interact simul environ ai spring milind gal ion taylor rain field team robocup challeng intern joint confer artifici intellig volum page august milind david nichola gal kaminka adapt agent integr architectur heterogen team member fourth intern confer multiag system page proof appendix present full proof theorem proof reli lemma coupl theorem reprint provid reader context theorem theorem monitor agent monitor simpl team maxim hypothesi teamwork failur detect result sound proof show failur failur detect fact failur agent member agent execut plan group execut pn failur agent execut plan correct hypothesi set maxim hypothesi coher level select hypothesi coher level correct impli failur detect detect procedur sound lemma lemma agent monitor teammat maxim heurist assumpt execut detect disagr agent execut plan observ role kei agent proof execut monitor observ role execut observ perspect case assign hypothesi execut execut plan perspect differ detect lemma agent kei agent kei agent kei agent proof kei agent observ observ qg kei agent rg fpg kei agent base theorem lemma proce main theorem theorem page team execut plan kei agent monitor kei agent kei agent pair plan monitor kei agent bidirect cliqu underli monitor team emploi set monitor carri disagr detect sound complet lemma agent exist pair plan kei agent theorem hold proof monitor complet monitor result sound show monitor result complet monitor graph team partit partit hold vertic agent execut plan show agent execut plan assum contradict pick mark plan select agent partit connect necessarili partit connect connect partit show kei agent assum contradict exist agent kei disagr detect agent pick agent kei agent case monitor kei agent monitor detect disagr contradict kei agent monitor kei agent kei agent monitor monitor disagr execut execut plan kei agent kei agent base lemma kei agent contradict kei agent pick agent kei agent pair plan kei agent pair partit connect kei agent kei agent kei agent kei agent contradict case assumpt lead necessarili agent agreement case agent detect failur monitor sound begin theorem hold agent kei agent lemma prove theorem proof show disagr detect complet induct number agent idea show agent select plan member team detect failur show complet show disagr detect induct agent disagr begin case select plan disagr singl kei agent exist team emploi set plan loss assum kei agent monitor kei agent detect disagr induct assum theorem hold team agent show hold team agent case agent pair plan examin gn direct monitor graph definit monitor graph kei agent agent monitor kei gn connect examin incom outgo edg vertex repres gn incom monitor edg monitor outgo monitor edg monitor remov graph agent pair plan remov result reduc graph gn satisfi condit reduc team agent continu monitor kei agent modifi monitor edg agent kei agent continu monitor kei team emploi set remov chang set kei agent set monitor complet maxim left team agent agent disagr detect induct disagr induct hypothesi disagr exist includ loss assum execut agent reduc disagr execut origin graph gn reintroduc team put back origin incom outgo edg monitor kei agent execut detect disagr case agent agent pair plan agent kei agent pair plan hold agent base lemma failur detect disagr failur detect complet monitor failur detect sound
ML/674 6 intellig techniqu industri crc intellig telecommun technolog gari john weiss network comput servic lab corpor unit state telecommun network extrem complex system requir high reliabl avail effect manag network task telecommun industri heavili invest intellig technolog chapter describ intellig technolog applic telecommun industri section describ expert system data mine technolog section describ intellig telecommun applic intellig technolog emploi section provid detail descript repres modern telecommun applic section describ answer expert monitor maintain switch element network system noteworthi fact combin object gain advantag section describ data mine predict extrem rare telecommun equip failur telecommun earlier highlight data mine technolog telecommun industri automat acquir knowledg larg quantiti data routin intellig technolog year telecommun industri reli intellig solut manag telecommun network build applic involv acquir valuabl telecommun knowledg human expert appli typic expert system knowledg acquisit process refer acquisit data mine techniqu appli industri applic break replac manual knowledg acquisit process autom knowledg discoveri telecommun routin gener tremend amount ideal candid data mine section describ expert system data mine technolog evolv solv complex industri problem expert system expert system program repres appli factual knowledg specif area solv problem expert system appli extens telecommun problem earli expert system requir knowledg engin acquir knowledg domain expert encod knowledg expert system rule number rule expert system difficult understand modifi expert expert system gener expert system attempt solv problem stronger function reason reason interest telecommun industri approach repres structur behavior telecommun network compon declar reason principl expert system prefer gener level commerci success field difficult behavior function model suffici high level make model practic design telecommun expert system recogn virtual telecommun equip incorpor capabl fulli model telecommun network return previou approach write rule reason base result test section describ hybrid approach relat technolog defin abstract model model devic relat data mine automat build network explain telecommun network behavior knowledg discoveri data mine overview knowledg discoveri field emerg includ artifici machin statist knowledg discoveri process involv identifi potenti ultim understand pattern data data research topic involv find interest pattern data data analysi discoveri algorithm knowledg discoveri detail recent paper data clean preprocess data fill miss transform suitabl data mine data find pattern data interpret interpret evalu pattern produc data mine kei motiv knowledg discoveri replac minim process manual acquir knowledg domain expert knowledg discoveri attract telecommun industri telecommun network typic complex build complet simul model huge quantiti data routin domain expert awar subtl pattern data autom knowledg discoveri acquir knowledg applic chapter util knowledg discoveri step knowledg discoveri process typic requir work telecommun applic transform involv identifi featur repres data step complic fact telecommun network produc sequenc individu alarm import behavior time network data mine method directli oper tempor sequenc transform method scout applic section forecast applic section approach altern approach develop data mine method reason tempor relationship telecommun network alarm sequenc section data mine data mine find interest pattern data induct base gener past instanc typic data mine applic telecommun industri predict failur network compon base past alarm histori data mine solv includ learn map class partit exampl categori predefin depend find model explain depend variabl sequenti tempor pattern discov sequenti tempor pattern exampl task real telecommun problem applic chapter consid classif task network element faulti troubl locat section build depend model applic section lesser forecast applic section exampl tempor pattern detect cluster target direct mail market tailor sale messag produc maximum impact data mine method solv data mine task method vari time requir toler expect format data concept capabl express rule induct network data mine method extens telecommun industri applic chapter rule induct system gener rule set capabl classifi bayesian network learn probabilist concept account observ data rule induct system bayesian network telecommun applic rule induct system rule easi understand easili incorpor exist expert system rule induct system applic chapter bayesian network telecommun isol faulti hardwar handl due lack complet simul model data mine tree neural solv data mine task intellig applic section describ repres intellig telecommun applic intellig techniqu emploi descript found network manag applic network manag involv mainten telecommun import applic telecommun industri applic section max locat problem local loop max administr system develop custom report telephon problem local final segment telephon network connect custom central offic max expert system problem base result electr test custom phone specif knowledg custom phone line gener equip knowledg max determin troubl li select type technician solv problem max deploi reduc number incorrect technician dispatch previou method problem max perform affect local characterist site numer rule paramet tune optim perform tune process time consum reason system call creat automat tune paramet valu input set train includ problem descript diagnosi assign hillclimb search find set paramet valu perform exampl perform type autom knowledg discoveri troubl locat cabl network troubl pacif bell intellig system determin locat troubl local telephon cabl network system data gener autom test narrow potenti cabl network equip test result suffici determin exact troubl locat bayesian network bayesian infer solv problem system begin gener local plant topolog graph gener bayesian node network state inform plant compon network account histor inform compon data test belief failur propag network equilibrium point rank list faulti compon gener system prevent mainten analyst support system find frequent occur alarm episod telecommun network alarm sequenc analyz system extract knowledg behavior network telecommun network alarm goal system locat regular alarm sequenc order filter redund locat problem network predict futur fault oper phase special algorithm find rule describ frequent occur alarm episod sequenti alarm data episod describ set alarm sequenc time period set includ alarm sequenc specif order alarm matter rule describ alarm episod alarm type occur alarm type occur probabl collect episod interact manipul user interest episod origin set found support process provid oper prune uninterest order set episod group similar episod prune order rule accomplish valu attribut rule type sever alarm confid frequenc test telecommun alarm data interest rule found incorpor exist alarm handl system identifi network fault data mine scout system proactiv identifi recur transient fault oper mine histor telecommun data machin learn correl techniqu scout identifi pattern chronic problem directli data examin network behavior period dai week featur summar histor data extract data standard machin learn algorithm algorithm capabl explicit tempor featur accomplish fix consecut time object measur predict problem summar measur count number time featur occur window scout learn rule predict recur transient fault version scout topolog map network order improv perform addit topolog knowledg scout learn time interv minut hour dai extrem import acut failur predict knowledg scout effect identifi problem root scout deploi network servic center successfulli technician product identifi root problem recur transient problem network manag switch switch capac domest long distanc traffic network provid switch expert manag monitor run diagnost test filter alarm gener expert implement version popular languag consist shallow rule acquir period year domain expert suffer problem gener difficult modifi maintain system redesign detail section intellig applic addit network manag telecommun industri develop type intellig market product configur applic fraud applic applic uniqu telecommun singl applic predict debt telecommun industri incur billion dollar debt year advanc pattern recognit identif system develop consum laboratori predict probabl debt base histor includ data past output fed support system varieti includ block call complet automat construct bayesian network model classif problem extrem larg bayesian network chosen problem due inher probabilist natur predict problem due highli unequ misclassif cost cost mistakenli label account mistakenli label skew class distribut hybrid approach network manag section describ answer network surveil expert oper support system maintain switch long distanc network system replac expert system section answer noteworthi fact util emploi extens program languag object orient technolog facilit design implement answer provid principl model hierarch collect devic section organ section function overview answer section describ object model answer model switch section descript extens implement expert system compon answer section discuss type reason perform answer illustr exampl section summar contribut approach answer function overview surveil technician network control center answer monitor maintain handl major call long distanc network goal minim number servic affect incid number block lost call answer achiev goal observ thousand alarm messag notifi technician condit requir human answer complet telecommun oper support system includ compon central import compon knowledg answer intellig behavior basic function perspect knowledg shown figur alert ticket alarm cmd knowledg base user figur function view answer kei input knowledg base alarm messag switch alarm messag provid inform condit occur specif devic messag provid statu inform result diagnost request knowledg base kei output knowledg base command request diagnost notif technician problem requir attent notif form alert ticket alert surveil technician network control decid action ignor defer process alert pend addit manual creat ticket dispatch work forc member work forc locat switch make physic equip repair replac faulti circuit pack case physic human knowledg base autonom creat ticket directli dispatch work bypass central surveil technician main task knowledg base decid gener alert ticket notif gener alarm receiv knowledg kei function knowledg base perform alarm filter case alert ticket gener threshold number alarm period time knowledg base part answer addit input output knowledg base connect graphic user interfac answer provid persist storag alert knowledg base part system user interact knowledg base graphic user interfac retriev inform set option custom behavior knowledg base object model overview kei advantag distinguish characterist answer knowledg base addit technolog widespread industri applic object orient technolog knowledg base model collect object object model shown figur rumbaugh object model techniqu devic unit prc alert ticket send send state alarm receiv standbi subpart figur object model readili view collect devic devic central object object model object model relat devic devic view hierarch collect devic relat devic specifi devic devic fail state devic time enter state devic order list alarm gener behalf devic alert object devic creat knowledg base decid devic requir human figur specifi inherit hierarchi devic class devic intend repres abstract object devic class subclass unit repres gener devic unit class shown figur subclass repres specif hardwar compon prc repres main specif class equip share common characterist inherit share special devic languag integr inherit method data member function behavior answer prc class rule behavior uniqu processor devic behavior inherit unit devic class devic model model instanti devic kei object model import understand object creat kei requir model dynam built inform reason flexibl effici flexibl dynam model fact configur inform essenti switch uniqu compon continu ad remov advantag dynam model permit model compon abnorm reduc size model realiz time space save knowledg base driven primarili type alarm timer tick alarm refer devic level devic inform devic hierarchi level exclud level devic type devic ensur devic switch uniqu timer tick updat expert system intern clock drive behavior devic view devic object model instant shown figur figur describ devic creation process dif tsi mp dt standbi dt figur devic model knowledg base receiv alarm devic alarm doesnt exist creat class devic object determin tabl lookup devic object class creat model requir devic devic present exist model creat knowledg base receiv alarm devic attempt creat object part exist creat devic data driven rule check relat creat model exist creation standbi relat form object devic delet driven timer devic delet state state period time extens order answer make effect object model infer implement implement languag support program paradigm tight integr rule object rule trigger base data member evalu exist program languag satisfactori languag extens object orient develop rule consid type member function share objectori properti member polymorph dynam bind implement preprocessor run compil invok figur show declar answer devic class note devic standbi devic set devic pointer option monitor keyword class declar identifi data member trigger rule evalu declar includ declar ensur standbi relat class devic string type devic int identifi devic uniqu monitor state ptr devic state inform monitor alarm ptr newest alarm receiv monitor devic point devic part monitor set devic monitor pointer set standbi devic rule figur declar class rule special part separ arrow rule figur translat alarm devic state standbi devic send alert abil write rule oper set list featur call rule appli element rule figur reli fact list call devic devic model familiar variabl refer object case rule figur devic perform rule figur translat devic dev set check dev standbi devic consequ updat standbi field devic reflect standbi relationship alert alarm standbi servic link standbi devic rule rule devic devic devic standbi state figur rule answer kei differ rule ordinari member function data member rule automat rule evalu evalu consequ execut rule figur alarm receiv devic state standbi devic rule automat reevalu kei differ rule rule languag rule mean rule includ data member class access typic pointer refer rule express rule languag refer arbitrari advantag ensur rule respect object model interest understand reason model object model principl reason failur switch implicitli inform structur behavior standbi relationship exist devic devic standbi field point devic vice versa reason answer accomplish affect relat affect relat defin highli abstract model devic fact compon affect diagnost import relat weak simul devic serv organ domain knowledg coher adhoc heurist replac smaller set gener principl base affect relat affect relat express aspect design level abstract expert troubleshoot link symptom easili acquir import affect relat answer standbi relat relat gener potenti appli devic rule maintain standbi relat shown earlier figur rule figur show standbi relat import monitor state rule alert alert devic standbi relat import isol fault answer rule devic failur devic worthwhil compar reason answer reason base affect due lack gener model reason system base special rule case singl gener rule adequ due small differ devic behavior solut problem complet rule solut answer singl gener rule special inherit devic requir special handl discuss answer hybrid approach technolog proven highli effect provid abstract devic object diagnost motiv affect simpl form reason appli domain complex method approach led reason heurist expert system object orient technolog provid principl approach implement organ expert answer maintain system advantag approach slight extens program languag implement knowledg entir answer system essenti implement singl languag permit tight integr knowledg base rest answer interfac routin written knowledg base code commun rest system prevent rule trigger part led artifici architectur design answer fulli deploi monitor maintain switch addit oper support system implement approach design implement work answer project forecast telecommun equip failur time seri data previou section combin technolog improv develop maintain expert system section show data mine improv qualiti domain knowledg incorpor system minim manual effort requir acquir knowledg reliabl critic factor design telecommun network error occur transmiss data error detect data rerout altern path effect failur singl compon limit due redund modern telecommun network failur major entir switch major compon catastroph event order prevent problem modern telecommun equip test capabl test alarm messag central handl human expert system answer expert system previou alarm messag temporari transient problem main object data mine effort section identifi pattern alarm predict catastroph equip failur rare event forecast effect identifi risk failur great describ gener approach transform data classic standard machin learn classif neural net appli transform data predict perform maxim vari sampl period window predict period window data transform appli techniqu data featur ten thousand goal forecast rare catastroph failur occur massiv commun network mine time seri data data mine techniqu successfulli appli classif task classif techniqu research past twenti result algorithm find predict pattern data data classif task model standard case includ set featur variabl singl class variabl predict task predict class variabl base featur variabl advantag exist model data data set task natur express standard format time seri natur express standard format trivial convert format time seri telecommun alarm time seri discuss section simpl time seri present figur singl variabl time messag figur prototyp time seri data time seri figur number repres time captur order posit datum continu time line messag occur time uniqu identifi messag letter gener goal effort discov pattern alarm identifi pend arriv distinct event distinct event network equip alarm gener goal identifi pattern alarm identifi pend arriv target alarm predict figur target alarm repres letter pattern alarm thought precondit consequ rule predict target event simpl rule induc data figur occur real world time seri predict seldom simpl obviou rule great deal process data model machin learn requir induc rule time pattern messag strongli predict back time search predict pattern futur successfulli predict occurr interest event techniqu systemat vari window size order maxim predict perform rule uncov classif method techniqu describ appli larg time seri data repres alarm messag emit equip larg telecommun network messag type million separ messag object predict extrem network critic failur model repres time seri data standard model repres data classif task shown figur spreadsheet row repres singl case column repres valu data shown figur nomin categor featur true task predict network equip featur categor includ featur type alarm equip report problem final column special class classif task attempt predict multipl valu numer rang ag class variabl binari fault occur fault figur standard format classif task goal model data standard classif format shown figur area research successfulli dealt time order data time seri analysi figur show typic analysi problem involv unit sale data fictiti product figur show unit sale todai show sale product previou todai dai figur order time seri unit sale fictiti product analysi unit sale attempt predict unit sale tomorrow prior unit sale hypothet equat forecast futur equat analysi equat forecast sale equat show tomorrow unit sale weight function current sale averag previou dai weight number previou dai approach classic forecast method classic approach readili appli complex datamin task figur measur sale continu interest predict class event catastroph failur switch equip featur make field alarm categor classic analysi requir numer featur analysi success measur variabl univari sale unit sale dai equat suggest todai sale strong indic tomorrow sale situat raw data messag forecast rare catastroph event event occur data involv variabl fascin analysi repeatedli data make predict approach borrow concept classic linear analysi learn rule forecast futur event point backward fix unit time observ count messag type forward fix unit time observ crucial event occur simpl type messag messag predict shown figur back point time determin frequenc messag possibl forward futur determin messag occur past current futur monitor window predict window figur past predict futur case repres monitor predict monitor window messag monitor order make predict futur predict window scan alarm predict determin class figur demonstr process gener case time seri repeatedli shift window forward predict window top figur show alarm continu time line separ figur sampl monitor predict window time time seri gener data messag type correspond featur figur featur frequenc count messag monitor window classif variabl column figur frequenc count target alarm predict window presenc target alarm predict window chapter encod class concern target alarm occur data figur shown row figur sampl figur shown line entri figur messag type messag type monitor alarm monitor window target occur predict window method model data gener appli data number window size period time figur data time explor window size select monitor window size difficult predict occurr rare event commun network messag domain track domain suggest decid back past pattern messag problem discov time critic inform li upcom catastroph event import monitor messag occur previou fifteen previou special understand domain priori size monitor window data mine explor size monitor window fix size predict window time forecast predict event useless futur event occur domain case event eventu occur event occur time unit mine data explor discov predict window work task priori size window forecast desir characterist window size monitor prefer window small simpler track messag previou fifteen minut previou hour predict window requir balanc act short predict window lead predict predict failur telecommun predict failur advanc time repair rerout failur predict window predict meaningless predict failur occur year typic amount time execut learn algorithm larg amount impract explor window size figur describ reason procedur mine data list window size figur algorithm data mine window size test model larg massiv commun network made commun link connect telecommun switch total number switch surprisingli fewer network span entir unit state complet failur switch potenti catastroph event strategi minim effect complet switch failur network traffic network traffic immedi automat rout switch sophist softwar observ network traffic flow rerout occur excess network capac window window appli data model appli learn algorithm evalu rule monitor window size predict window size select window size specif provid handl congest problem year experi design build fault toler control softwar switch result catastroph switch failur extrem effect handl excess network capac loss network call traffic minim failur switch occur consequ forecast occurr failur correct occur minim effect rerout call prior failur studi histor alarm messag switch period month switch gener alarm messag week filter million alarm messag fewer failur failur bunch indic singl failur goal forecast catastroph case failur event requir extrem strong predictor achiev high accuraci forecast altern strategi identifi pattern highli forecast subset catastroph event recal higher experi perform vari time period monitor predict window rule induct system learn predict rule occur monitor failur occur predict result achiev monitor predict window set minut failur predict pattern identifi occur prior failur prior normal period result studi warrant studi data obtain case problem isnt lack scarciti failur data chapter intellig telecommun technolog applic technolog expert system technolog data mine technolog expert system technolog matur commerci success past decad chapter descript answer show object technolog enjoi great commerci integr technolog make easier develop maintain expert system expert system data mine technolog telecommun industri deal larg quantiti data answer expert system process thousand alarm messag daili equip problem knowledg expert system manual acquir domain expert data mine knowledg automat acquir directli data demonstr applic section data mine applic section attempt supplement manual acquir rule answer rule automat acquir data mine data mine total elimin acquir knowledg human data mine technolog make contribut telecommun industri expect contribut advanc made technolog refer predict data practic morgan san francisco ed build expert read ma devic reason affect fourteenth intern confer artifici intellig pp canada data mine knowledg advanc knowledg discoveri data mit pp process knowledg discoveri advanc knowledg discoveri data mit pp optim rule ieee vol pp ai impact ieee vol pp telephon troubl screen innov applic artifici intellig aaai menlo pp tune numer paramet troubleshoot ieee vol pp local troubl telephon cabl innov applic artifici vol aaai menlo pp probabilist reason intellig network plausibl morgan san francisco knowledg discoveri telecommun network alarm twelfth intern confer data engin louisiana discov frequent episod intern confer knowledg discoveri data mine pp aaai press data mine forecast telecommun ieee vol pp program morgan san ca construct bayesian network predict telecommun ieee vol pp prentic hall home model base reason approach network acm workshop activ real time system pp rule program applic
Agents/675 1 interact pedagog drama lewi johnson catherin labor center advanc research technolog educ southern california inform scienc institut suit marina del ca usa paper describ approach realiz interact pedagog drama charact action director agent manag action present order maintain stori achiev pedagog present dynam stori achiev dramat effect artist standard maintain permit substanti variabl stori scenario achiev script dialog element portrai agent emot model learner influenc drama unfold control intent behav accord intent interact charact creat opportun move stori pedagog autom director exploit approach realiz multimedia titl bright interact health design improv problem solv skill mother cancer patient keyword interact human lifelik model behavior model synthet agent introduct peopl face difficulti dai life requir sophist problem solv skill children school effect skill avoid pressur peer engag riski behavior mother sick children face tremend physic strain extra demand time problem work children teach skill cope problem goal style instruct call interact pedagog compel interact stori didact interact pedagog learner interact believ charact believ stori learner charact face resolv difficulti similar learner experi learn skill appli problem learner identif charact believ problem central goal learner fulli interact efficaci skill emploi subsequ appli skill life interact learner involv identif stori tailor problem determin charact thought tailor drama paper describ approach realiz interact pedagog drama charact drama action autonom direct learner director agent director agent manag action present order maintain stori achiev pedagog present dynam stori achiev dramat effect multimedia present make stori learner languag literaci problem goal ensur result present dramat effect achiev high artist pedagog permit learner control dynam interact object approach goal realiz multimedia titl bright interact health design improv problem solv skill mother cancer patient pedagog goal titl teach specif approach social make problem solv call bright idea mean optimist attitud problem solv letter idea refer separ step problem solv identifi solvabl develop evalu act plan work bright idea method taught clinic seri session train bright idea mother learn time reli session creation interact explicitli pedagog face challeng good drama requir good stori strong narr believ structur maintain world inhabit agent suggest form dynam direct agent agent cast inhabit believ present dynam choic camera charact support believ maintain engag introduct pedagog object pose addit challeng seek design learner explor stai pedagog space reason expect lesson learn lesson intend teach agent problem solv stori entertain posit learn result pedagog constraint charact behavior plot impact believ learner empathi charact suggest pedagog awar direct subtli realiz interact drama audienc member plai role comput interfac act separ action audienc number interact drama adopt approach work al adopt present approach learner influenc action directli particip stori charact clinic technic reason choic learner maintain separ learner charact overcom learner assum burden problem permit freedom stori direct present drama narr devic convei techniqu camera shot cross cut present drama genr familiar make easier talent drama contrast limit restrict stori linear time progress restrict point view singl stori charact stori bright idea develop jonathan consult clinic develop administ bright idea method build believ social agent behavior felt essenti focu ensur engag effect stori conceiv necessarili immedi lend nonlinear task dramat direct bright idea permit varieti retain engag narr drive origin stori design agent answer cast call address concern agent provid convinc human face discuss difficult person social problem wai model person wai portrai model commun gestur charact rich present give ad depth motiv highli stress event pedagog goal teach social problem solv agent architectur heavili influenc emot person model work human stress cope commonli model agent design cognit linguist view gestur model influenc work commun gestur work reveal behavior clinic studi model provid rich state charact express enhanc agent architectur model emot reaction confin onscreen action impact action basic question interact present control direct action directori share learner autom director learner direct thought emot main charact manipul learner control intent thought feel current situat thought feel incorpor mental act charact autom director control action charact interact subtask handl cinematographi pass cinematographi agent handl camera revel stori term chose approach maxim express test ensur intend effect achiev creat voic charact chose record voic actor speech synthesi steve adel ensur dialog suffici emot impact break voic record individu sentenc assembl real support amount variabl gener dialog task creat effect interact pedagog drama pose payoff unlik relat work anim pedagog agent agent drama act stori build drama agent effect stori enhanc believ charact enhanc effect impact interact experi techniqu develop applic educ broader realm interact entertain bright idea bright idea relat problem stress woman son daughter discuss problem suggest bright idea find solut initi step bright complet remain step stori organ act learner present sequenc situat dramat problem show interact doctor charg daughter member famili provid encourag learner relat point situat tradit linear flow narr time act place offic discuss problem select problem focu develop evalu solut discuss action flash back recal event occur flash forward imagin outcom action final act carri action decid observ consequ figur offic figur depict shot scene offic human mother interact drama make choic problem work thought critic figur depict interact displai mother select thought impact emot turn impact behavior task social problem solv track effect respond motiv dialog gestur dynam manipul camera figur choic thought amount interact nonlinear stori vari greatli act act act present fix sequenc mother requir thought emot reaction action scene intend engag learner quickli stori develop model mental state guid futur action interact nonlinear consist major scene phase bright set event scene time transit scene fix mother select act immedi thought turn prompt part agent adjust camera decid progress scene continu act stori act present linear sequenc choic scene depend made earlier solv problem stori design learner assum kind relationship stori charact identifi feel wai front choic case stori charact adapt fashion ensur stori charact retain believ pedagog goal achiev basic pedagog model involv learn passiv observ learner plai construct role drama observ realiz autonom agent open door addit interact current design learner interact select plai direct role elect control script basic design interact pedagog main cast autonom charact puppet physic manifest learner impact behavior director agent manag interact drama onscreen action present ensur dramat pedagog goal present director model potenti unpredict turn variabl onscreen activ term desir direct action give director knowledg start script achiev dramat pedagog goal systemat order determin wai variabl enter drama fundament process determin variat dramat avoid manag variat undesir script hierarch narr variabl introduc level hierarchi highest stori presum fix sourc variabl script sequenc scene variabl ad wai altern scene order turn linear sequenc graph scene achiev goal move grain altern realiz scene consid pattern event achiev scene goal finer grain analysi goal charact rel event scene charact event occur hierarch critic seek pattern similar charact activ situat pattern suggest gener class behavior includ behavior repertoir differ similar behavior identifi make charact distinct interest process identifi desir variabl enter script wai achiev simplifi design agent limit detail built preliminari step made natur attitud director imagin director make easier charact problem determin director achiev directori control charact bright idea applic techniqu bright idea script lead design detail made make onscreen director essenti pedagog role respect make director assum similar role learner role essenti suggest directori attitud respect accommod manag thought balloon shown earlier made insur critic goal drama achiev insur address step provid kind direct control essenti coerc behavior role drama work problem solv subtl challeng approach motiv onscreen activ onscreen consist scene role charact act motiv dialog gave access emot state special motiv onscreen activ interest impact drama dialog motiv learner interact influenc thought emot creat tension attempt motiv possibl attitud pair learner plai role determin assum relationship empathi onscreen action empathi activ engag appli bright idea techniqu posit potenti win give posit attitud learner vivid demonstr appli techniqu design turn script term act level main variabl ad includ problem chose work act follow variabl ad learner determin choic impact interest potenti variabl enter level pattern activ act act structur step applic bright idea methodolog problem pedagog goal step altern path stori cover step pedagog inappropri specif strategi address step suggest isol featur problem answer question problem part time start suggest simpler strategi explicitli guid develop solut brainstorm solut start throw idea idea strategi gener featur answer fix set question strategi differ explicit guidanc provid base choic strategi assess state imagin altern strategi achiev step sourc choic strategi strategi base step idea work assess guidanc strategi doesnt note result pedagog techniqu suggest strategi finer grain consid agent interact realiz strategi charact role achiev solut begin strategi directli specif prompt address substep strategi manag prescrib singl gener model agent interact drove solut strategi step kei consist goal step motiv address current step forc appli strategi dialog main tool struggl charact consist dialog figur depict part dialog model agent result step idea model consist set dialog act spirit specif tailor captur charact implicit transit dialog act govern appropri respond emot state sequenc subproblem address answer subproblem ws strategi offer answer decid reassur depend emot state reassur answer prompt involv prompt answer depend manag address subproblem emot state figur part dialog model dialog act connect dialog answer question complet strategi dismiss topic limit wai dialog act impact agent initi requir subproblem strategi posit impact emot state engag problem solv explicit prompt step interact impact emot state impact reassur accommod variabl dialog typic set express low turn express turn dialog preempt lowest level script analysi agent action achiev variabl analyz action term effect drama major action dialog act realiz record speech segment achiev segment index applic includ dialog act act address specif step strategi problem topic diana point dialog dialog segment index emot state speaker listen agent set applic dialog segment base specif applic condit recenc effect specif dialog segment tend applic segment recent prefer dialog default move applic dialog segment annot model agent includ segment topic term dialog act model segment answer question daughter diana simpli dismiss annot includ time inform speaker listen behavior point abstract deictic refer main point note repres actual behavior determin dynam agent reaction annot agent architectur detail touch aspect agent architectur pertain interact pedagog drama underli architectur agent base situat space agent model onscreen distinct layer problem dialog physic focu emot case problem solv layer model dramat includ idea step strategi realiz current step earlier portion dialog drive execut strategi reactiv simpler problem solv dialog respond dialog physic focu manag behavior emot emot model bright process agent dialog annot reveal mean time event agent experi annot intern state flux dialog segment event behavior gener pass puppet simpl illustr layer process dialog diana temper feel judg bad mother cope solv dismiss answer annot dialog emot state bia physic focu gener relev behavior annot lead emot feel child physic displai feel process accept dismiss answer fail address construct fashion behavior gener physic focu mix behavior exhibit agent point agent mode base emot state behavior fashion behavior agent categor subset mode consist specif nonverb nod exist mode type head nod realiz differ mode transit mode base emot state current delin strong transit commun work focu mark behavior depress tendenc gaze inhibit verbal activ hand bodi stimul rhythmic stroke squeez scratch bodi focu moder withdraw agent physic hand hand continu transit divid part conflict problem solv closer relat listen mark hand object plai pen commun full engag dialog problem solv mark full rang commun gestur beat deictic gaze turn emot kei part design gestur gaze determin engag problem impact dialog mean motiv larg bodi research emot model emot roughli event world respect goal physiolog form disposit action tendenc model differ constitut basic process tightli emot coupl agent plan physiolog consid constitu part emot factor deepli agent charact design posit requir emot model pedagog drama emot model provid believ render relat emot cope strategi essenti problem solv skill develop model requir dynam thought memori relat charact problem impact current emot problem depress son affect hope resolv problem success failur agent problem solv impact emot state emphasi stress base model work smith lazaru work posit process primari establish event relev agent motiv congruent motiv secondari evalu cope potenti cope potenti account establish blame event agent suffer expect establish hope matter cope potenti assess effect agent cope agent effect chang world make congruent adjust psycholog turn establish emot state model effect captur factor sought model pedagog drama simpl dynam control turn control emot state behavior agent motiv congruenc binari motiv expect cope potenti scale agent emot set valu analyz spoken heard dialog annot problem solv activ success problem develop plan confid problem direct cope expect problem turn impact engag problem shift physic focu reassur impact problem situat face memori valu problem current valu directli case cope averag current state weight sum base motiv relev thought balloon interact learner base model gener thought balloon request critic junctur step learner present altern thought select larger pool repres chang emot neg chang posit chang learner select emot state modifi emot physic focu design gener agent realism requir incorpor knowledg individu human behavior mother kei part emot rule repertoir gestur incorpor individu differ creation differ benefit script cinematographi set film onscreen agent call alain task manag shoot drama dynam assur dramat impact alain film descript onscreen agent singl dialog turn descript action place dialog includ nonverb tempor synchron behavior thought balloon occur film descript includ emot state agent agent turn dialog alain set rule decid shot ad descript agent spoken line long shot chang show agent shot chang favor strong emot behavior kei pedagog point thought balloon requir focu charact alain translat film descript form includ verbal behavior specif bodi part time detail anim puppet behavior request puppet sequenti prop elbow lean head hand simultan move bodi lower ey alain turn descript seq par marker establish anim request perform sequenc parallel anim request specifi puppet bodi part action frame number sequenc alain pass descript puppet architectur figur piec anim request current camera dynam deriv lip sync speak part anim puppet architectur present style bright idea critic concern flexibl order support suitabl target audienc due natur high qualiti speech consid anim approach chosen record voic anim thing creat stori adult adult target ag grew saturdai morn fritz cat anim style chose style saturdai morn anim style produc quickli style consid richli express charact requir graphic tend artifici charact requir realism style permit vector graphic vector graphic file small compar bitmap graphic kei concern puppet hundr layer frame vector anim resolut independ provid alain reason varieti focal length frame featur actor bitmap graphic visual contrast reminisc tradit greater latitud visual express disadvantag procedur context larg repertoir behavior puppet stage due amount requir puppet interact prototyp accept rang behavior narr dyadic limit puppet structur built imag transpar background agent pull puppet string send track combin frame sequenc dramat charact put behavior space term agent puppet manifest behavior fragment agent coordin behavior fragment visual segment librari gestur express differ tradit approach maintain fix present approach statu result test conceptu prototyp small group mother cancer patient kei issu investig viewer identif situat believ charact valid tester scenario tester believ abil cope problem found solut believ tester found present bright idea concept easi follow reinforc understand method interest mother felt stori held view program clinic prefer view stori comput read stori book posit receiv question mother comment found hospit environ distract read find comput anim relief anxieti wait treatment conclud result focu test respect track structur present present prototyp assembl test clinic set program includ situat outcom artist anim creat anim background actor emploi portrai charact voic sound mix code ambient creat bring background set life sampl situat mean constitut full librari hope eventu provid variabl test program design clinic trial interact prototyp join learn materi prepar bright idea clinic round clinic begin mid incorpor program current train program set substitut meet learner teach bright idea remain group learner receiv tradit set person futur work approach develop interact pedagog drama draw creativ influenc scienc start point engag linear script order guid design autonom agent realiz interact drama add result agent model reli research human behavior dialog agent control behavior lifelik interact charact frame present directori share user autom director current round clinic trial bright idea prototyp plan extend titl includ wider rang problem scenario outcom plan incorpor greater scene adapt learner characterist desir give learner option defin problem decid solv varieti charact person background insert order appeal individu stori approach stori deliveri engin appli approach pedagog stori approach applic health educ applic involv problem solv social situat acknowledg credit author clinic psychologist oj jame karin charact design lead anim tom background artist voic student zhang discuss jeff jon gratch pearc invalu work fund nation cancer institut grant refer wh jc intellig visual interfac dynam world intl conf intellig user interfac jan acm direct autonom creatur virtual environ comput graphic acm live hand psycholog theori speech gestur interact dialogu system aaai fall symposium narr code dialog annot scheme aaai fall symposium commun action human interact storytel tool writer wv repertoir nonverb usag code analysi movement behavior clinic interview studi dyadic emot cambridg univ van act charact trappl petta creat person synthet jc anim pedagog interact interact learn environ intern journal artifici intellig dramat presenc journal virtual winter mit press believ anim pedagog agent intl conf autonom del feb acm believ charact stori creation environ workshop anim pedagog agent juli sc wl assist team train dynam world intl confer intellig tutor hand mind chicago chicago person paramet program trappl petta creat person synthet pn cognit theori emot cognit wl anim agent procedur train virtual motor control appli artifici intellig methodolog build believ social agent intl conf autonom del feb acm ca rs emot adapt handbook theori pedagog agent web annual confer autonom agent acm matern therapi cancer journal
HCI/676 4 johnson io edinburgh classif space augment augment realiti case studi duboi olivi laboratoir clip bp grenobl franc laboratoir de la franc cardiac surgeri depart hospit grenobl franc abstract recent design goal human comput interact extend capabl comput system combin real virtual order assist user environ system call augment realiti ar system preval clear understand interact paradigm paper gener framework classifi exist ar system comput assist medic ad ar demonstr discuss light illustr casper assist system assist surgic procedur augment augment classif space introduct term literatur conjunct term differ ar vr involv system vr system strive total virtual environ user perform task ar system combin real virtual order assist user perform task physic set recent augment realiti subject grow interest consensu definit ar design space difficult compar exist ar system explor design paper present classif provid systemat classif process augment realiti system approach draw studi comput assist medic system augment realiti system section describ system goal describ compon classif space illustr system casper assist final notion adapt real virtual show classifi exist ar system johnson io edinburgh comput assist medic applic domain augment realiti includ architectur surgeri taylor varieti applic domain make difficult arriv consensu definit distinct goal term applic domain augment surgeri system main object system surgeon defin execut optim surgic strategi base varieti data input object aim improv qualiti make intim link simul accur object defin basic challeng guid surgic tool robot local arm optic perform real time track surgic tool drill augment realiti plai central role domain kei point system physic world surgeon oper tool provid inform includ strategi inform transmit real world comput world comput track laboratori work develop evalu system progress technolog grow possibl real clinic improv comput augment realiti system enter surgic specialti system vari form class system identifi passiv system surgeon compar execut strategi plan activ system perform subtask strategi autonom robot system synergist system materi surgic strategi surgeon charg execut system surgeon work synergist golden rule guid project design system clinic defin develop gener system appli clinic applic provid effect collabor surgeon system effici interfac approach design base encompass medic domain clinic requir safeti critic system human comput interact paper focu interact surgeon comput point panel hci health design plai central role design system system numer surgic specialti attent paid technic issu relat imag data fusion surgeon assist stem clinic specif problem effort appli model interact surgeon system design approach project technolog driven approach ar system gener technolog driven definit ar quot session form virtual realiti displai clear view real augment realiti user reli forc aural reflect milgram definit adopt complementari approach provid classif space augment realiti system space classif dedic interact system includ ar explain compon relationship target task support system type augment final demonstr appli system casper johnson io edinburgh compon model interact user interact system identifi adapt system compon call system retriev transform data real object includ pen sheet paper manipul user robot order perform task object compon includ human provid involv process interact directli system case patient system person system user object belong real world system compon belong virtual synthet world order establish bridg introduc fourth compon call adapt obviou exampl adapt keyboard screen exampl adapt system ultrason local embodi user interfac user comput devic physic manipul adapt pressur sensor tilt sensor compon defin main difficulti distinguish adapt object common adapt dedic transform physic movement user movement virtual world displai screen user emploi object link compon interact system compon exchang inform exchang data repres diagram system flow data surgic tool local local perform track surgic tool li ea data flow adapt definit flow adapt system compon adapt user object target task world belong import user perform task order modifi real world order modifi state inform maintain comput ps task term target oper real world world comput system target real world medic clinic inform system target comput state medic target real world correspond term present realiti design real world user virtual correspond virtual world creat comput appli concept interact interact real world augment comput interact comput augment object action real world real world virtual environ keyboard ui graphic ui augment realiti augment virtual gestur ui tangibl ui virtual environ embodi ui real world figur parallel base continuum posit interact paradigm present concept ar av present belong continuum order classifi johnson io edinburgh displai interact requir distinguish parallel present figur ar av appli interact meet point target task continuum figur dedic world interact continuum interact type augment augment provid system number form ar system task real action augment real world percept augment real world enhanc refer theori action augment dedic execut phase evalu phase shown figur type augment appli type target task world comput illustr point subsect real world comput augment execut augment evalu goal task figur type augment execut augment evalu appli augment realiti task real augment virtual task augment realiti digitaldesk ar system enabl user cut past draw made real paper real pen action directli real execut phase augment comput system automat open door person wear activ badg front case augment execut task real world execut activ system ar system augment evalu phase displai situat sensit inform messag video screen applic augment visitor pictur obtain textual descript screen augment audio aura system audio aura system background auditori ti user physic action workplac visitor discov empti audio aura hear auditori cue convei person left offic long time ago visitor miss scenario present hear cue convei number email messag receiv enter exampl augment realiti exampl augment virtual target task comput augment virtual topic subsect ar augment execut augment evalu digitaldesk activ open door augment museum audio aura augment virtual exampl augment execut humancomput interact involv input modal base real al brick ishii ishii ishii interact paradigm tangibl user interfac augment execut defin recent approach call embodi user interfac user execut task comput physic manipul comput exampl augment evalu humancomput interact refer realist graphic screen output modal mimic real world feedback audio tactil av augment execut tangibl embodi ui augment realist graphic evalu tactil case system augment execut evalu phase johnson io edinburgh digitaldesk augment execut phase servic evalu phase mix real draw made real paper displai graphic model casper describ model casper applic develop collabor grenobl hospit clinic problem remov build fluid region heart effect compress heart procedur perform minim access chest casper assist acquisit model stabl region target select safe trajectori plan success plan strategi surgeri markedli enhanc screen guidelin surgeon shown figur casper assist surgeon provid real time posit needl plan strategi user interfac casper design multidisciplinari team includ surgeon fulli figur show compon casper figur casper applic action descript system compon transform signal needl local graphic posit orient needl window current posit orient needl repres mobil stationari cross repres plan trajectori cross execut trajectori correspond plan adapt screen displai guidanc dedic track needl posit orient diod firmli fix needl camera mount rigid bar object involv task needl patient surgeon handl link surgeon needl final casper system target real world addit casper augment realiti surgeon provid inform casper augment evalu phase world interact surgeon execut needl needl surgeon screen local part figur model casper present illustr classif defin augment realiti system system enabl user perform task target real world task real focu adapt ar system studi ergonom properti continu boundari real virtual adapt kei compon establish bridg real virtual world adapt determin type johnson io edinburgh boundari world turn ar system adopt distinguish input adapt system output adapt system ia oa keyboard pressur sensor input adapt projector headmount displai output adapt addit match adapt provid continu task shift real virtual world perform task identifi concept relev cognit cognit repres level abstract continu defin level cognit gap real virtual world cognit gap real world defin virtual world screen oa provid surgeon shift screen patient needl cognit surgeon shift posit needl graphic screen show level casper screen discontinu output adapt modifi casper displai hmd provid continu cognit level digitaldesk perspect digitaldesk includ projector continu model figur digitaldesk user draw real paper inform displai projector addit input adapt digitaldesk camera top desk recogn camera continu input adapt continu action level perform place cognit level action casper local serv continu input adapt modif action surgeon conclud main differ casper digitaldesk output adapt continu figur discontinu adapt figur establish casper digitaldesk domain kind interact induc paper desk user cia camera projector part figur model digitaldesk paper introduc approach classifi augment system present conceptu place aspect interact augment realiti system augment virtual system enabl differenti system belong passiv system class augment abil classifi exist system great light rapid technolog progress experienc identifi organ aspect framework design address design question futur system goal establish complet design space ar system specif system work primarili involv link ergonom criteria model order identifi design principl develop version casper repres trajectori form cone displai order address discontinu problem current version acknowledg work support french nation johnson io edinburgh scientif research center grenobl hospit influenc stimul discuss tacit partner research georg leon watt review paper refer gener visual assist surgic comput biologi comput assist anim feasibl van leeuwen springer comput assist medic ieee engin medicin biologi interact health summari human factor comput acm pp user embodi user lai foundat graspabl user human factor comput acm tangibl seamless interfac bit human factor comput taxonomi mix realiti visual ieic transact inform design audio human factor comput acm gener platform address multimod challeng human factor comput acm cognit norman draper user center system perspect comput lawrenc erlbaum world comput augment interact real world acm symposium user interfac softwar acm human innov technolog biologi medicin special issu robot surgeri robot synergist devic van leeuwen springer activ badg locat acm transact inform macintyr augment realiti architectur comput civil paper commun acm special issu comput augment environ johnson io edinburgh
IR/677 5 inform discoveri filter multiag evolv ecosystem mouka mit media ma abstract agent program assist user perform repetit task inform discoveri inform filter suitabl domain appli agent technolog idea drawn field autonom agent artifici life combin creation evolv ecosystem compet cooper agent model inform filter agent adapt user interest inform discoveri agent monitor adapt inform sourc analyz result number experi present discuss inform introduct exponenti comput system interconnect network result exponenti amount inform inform distribut heterogen sourc unstructur difficult user cope amount tool agent assist deal inform overload comput increasingli assist handl repetit task order agent real user learn user interest habit machin learn maintain compet adapt user interest chang time time explor domain interest user wit paradigm shift interact direct manipul comput system indirect manag agent plai import role domain focu person inform filter inform discoveri introduc person system discov inform distribut sourc interest user present form digest amalthaea learn user interest examin histori direct feedback form keyword resourc locat string system autonom collect relat document url collect data domain ffl document data discoveri amalthaea search www launch multipl agent util exist index engin perform order discov inform broadli interest user system analyz retriev document weight keyword vector techniqu order select closer user prefer ffl continu flow inform environ inform filter case mit media laboratori press multipl agent analyz articl select proper ffl monitor frequent chang inform resourc user monitor url updat fix random instanc formula motor race result updat sundai articl journal cd artist url monitor regular interv exist user notifi amalthaea oper requir presenc attent user inform present user form url notif materi site user follow give feedback good bad item rate relev item keyword idea system adapt user follow interest evolv time implement amalthaea creat artifici ecosystem evolv agent cooper compet limit resourc environ gener speci agent inform filter agent inform discoveri agent inform filter agent person system track adapt interest user inform discoveri agent inform resourc adapt inform find fetch actual inform user interest evolv multiag solut suit domain util exist solut problem case match user abil quickli adapt situat instanc user interest adapt time system continu explor search space solut evolut techniqu mutat crossov refresh special agent popul approach creat ecosystem influenc belkin croft approach inform filter inform filter retriev fact side coin combin maxim effici inform manag task work appli artifici intellig techniqu inform filter work inspir artifici life approach result fulli distribut learn mechan order understand system global behavior filter inform filter agent special filter appli narrow sector domain user filter assign interest eventu destroi creat interest evolut natur select intrigu issu multiag system find wai system reach equilibria continu adapt user interest background relat work search engin tool search engin built coupl year focu index provid easier find document common problem www index engin frequent return document irrelev user interest poor choic keyword user poor index document engin process inform discoveri greatli assist make person instanc person agent form exact queri role agent set advantag exist search creat person layer local suggest person inform central search engin level decentr user level user inform creat number agent search document result disastr network user reli search engin result queri start point agent todai dozen search engin exist produc result queri agent inform filter past year attempt made develop agent assist deal larg inform landscap domain indic yahoo stanford supplement index engin wwww lyco cmu metacrawl agent oper higher abstract level util exist www index search engin develop washington metacrawl agent index document common interfac number search engin user post queri metacrawl forward search collect result return unifi list easi extend approach higher level abstract agent filter inform consult agent discov turn consult search engin index inform creat process level actual inform greater flexibl util form filter form discoveri similar product direct search index enabl user gener queri search www present result time multiag system develop built top central planner gener pursu group cooper standard languag interag commun negoti similar system develop ibm system framework knowledg domain electron newsgroup inform develop introduc idea associ network keyword inform retriev categori www agent includ cmu webwatch mit media laboratori letizia agent design assist provid person user www perform search link ahead provid navig recommend similar work term applic domain system build balabanov shoham introduc system www document filter util weight keyword vector term evolutionari filter develop multiag system evolut relev feedback inform filter applic domain structur newsgroup document system adapt dynam environ main differ amalthaea applic emploi kind special inform system present introduc type agent base relationship simpl econom model amalthaea architectur amalthaea basic part figur ffl user user present retriev inform feedback relev ffl distinct type agent inform filter agent inform discoveri agent ffl www interfac engin retriev document ffl keyword extract weight keyword vector gener engin ffl retriev document distribut inform sourc interfac user interest cluster inform retriev agent discov monitor flow inform filter agent feedback credit document inform filter close economi digest credit keyword extractor figur overview architectur object retriev engin sourc inform system access worldwid main engin retriev document base www organ librari effect access retriev inform www easili interfac applic top librari url store section document keyword vector amalthaea intern document base standard inform retriev weight vector document sourc www gopher ftp inform newsgroup altern wai creat http connect explor amalthaea beta java server www organ librari process weight keyword vector gener transform document weight keyword vector html document convert text filter link html document retriev treat special type keyword import html featur header mark creation weight keyword vector newli creat text file pass remov suffix word root instanc word stemmer algorithm modifi version introduc porter good overview stem algorithm found output stemmer filter english languag word instanc keyword weight produc tfidf measur acronym stand term frequenc time document frequenc standard inform retriev weight idf frequenc keyword current document header idf formal defin idf log df total number document retriev system df document frequenc term term idf frequenc keyword collect document case collect document set weight keyword intern retriev document header constant equal keyword found document bodi text hand keyword part weight multipli constant titl keyword weight plain bodi keyword process creation vector complet augment weight vector addit field canon url document server author augment weight keyword vector repres genotyp inform discoveri agent relev feedback user interfac role user interfac present inform retriev amalthaea user inform view browser structur section document retriev cluster inform filter agent user section follow hypertext link user amalthaea feedback relev document feedback system support credit alloc mechan inform filter agent select document feedback mechan user user pick number keyword document vector describ document weight keyword reinforc relev feedback user alter dynam system system bootstrap user abil introduc agent feasibl provid passag text user interest provid url document document inform filter agent creat base user url option amalthaea window agent creat user directli consid agent purg easili perform agent advantag present document user agent user tailor amalthaea modifi paramet amount document system amount document number inform filter inform discoveri agent system paramet evolut mutat rate system directli relat abil adapt user feel interest chang lot system instanc job user evolut system directli normal circumst system adapt user chang interest calcul total posit feedback user diminish evolut automat evolut evolut agent control individu fit fit system variabl number top rank popul produc offspr rank agent base sole fit number agent produc offspr linearli relat number agent purg poor perform number constant relat fit system fit diminish evolut search quicker adapt user interest fit evolut constant configur rate system slowli explor search space solut agent creat crossov mutat oper appli evolv part genotyp part phenotyp inform instruct handl evolv part point crossov agent return agent inherit part keyword vector parent oper randomli select point keyword vector exchang field parent lie point creat agent genotyp point crossov oper formal defin algorithm return crossov point work rand rand genotyp inherit part keyword vector parent li number variabl repres weight keyword mutat method creat offspr agent mutat oper genotyp agent argument creat agent randomli modifi version parent weight mutat keyword modifi randomli keyword randomli select keyword agent belong cluster econom model ecosystem agent ecosystem oper support notion assign indirectli user depend system perform user give feedback suitabl item digest system relat feedback filter agent item discoveri agent retriev assign credit credit serv fit function popul evolv separ higher credit agent chanc produc offspr user feedback posit inform filter agent item award amount credit directli relat confid level agent confid user item receiv posit confid hand confid document interest user feedback neg receiv lot neg bad fit inform filter agent fix percentag amount credit receiv inform discoveri agent output evid filter agent present digest document agent rank confid level top select present user agent present item repres top rest popul notic inform filter agent doesnt present user credit remain constant order destruct agent evolut introduc linear decai credit function type order agent inhabit ecosystem pai credit gain exce live remov creat agent document receiv penalti penalti function order discourag popul inform filter agent receiv rate directli user depend perform assign credit inform discoveri agent locat retriev inform rate user number agent purg system cycl fix base amount posit feedback user give system neg feedback current digest higher averag past ten digest percentag purg agent hand posit feedback number scenario posit percentag popul purg order explor search space user interest flow request inform amalthaea ffl filter agent send request post document discoveri agent form keyword vector ffl discoveri agent select filter agent request base phenotyp retriev relev document util www index engin assign ffl discoveri agent present filter agent set retriev document filter agent select match keyword vector ffl number filter agent includ select document user digest base confid document ffl user rate document present give feedback system worth note default flow inform inform discoveri agent present data inform filter inform discoveri agent instruct inform filter agent type inform search retriev case www domain case press domain flow inform inform filter agent inform filter agent base augment keyword vector major part deriv process vector assess similar document match inform filter agent document vector augment inform author document creat user explicitli interest field activ indic document agent treat favor inform filter agent special specif collect featur document genotyp inform filter agent essenti weight keyword vector phenotyp agent part agent interest field command enabl agent commun system essenti phenotyp resembl fix templat genotyp inform figur visual relat genotyp phenotyp inform filter agent execut code phenotyp genotyp keyword weight weight keyword weight keyword author fit interest figur inform filter agent genotyp phenotyp inform filter agent present document inform discoveri agent act document close weight keyword vector pass filter agent select document closest vector calcul confid specif document interest user decentr approach agent believ perfect model document match vector agent confid formula return distanc keyword weigh vector similar ak bk ak bk mention previou document introduc filter agent make digest system decid agent present user rank document formula document fit filter agent document top document select rank number amount item user interest includ digest inform filter agent issu stand longterm inform discoveri agent type document interest find discoveri agent select contract note expect inform filter agent higher fit alloc inform retriev agent happen inform discoveri agent inform discoveri agent base genotyp inform number keyword util queri www index canon url engin inform contact aim creat bodi agent document discov search engin phenotyp discoveri agent includ small histori transact filter agent filter agent perform transact depend histori creat rank list filter agent work highest order maxim fit discoveri agent figur filter agent base www index engin choic keyword queri inform discoveri agent monitor site oper bit differ discoveri agent special www steadi inform flow search engin mediat visit directli site interest analyz document discov chang url store distinct characterist inform discoveri agent includ search altern inform sourc remot comput case parasit util exist www search engin find inform dig type final receiv credit directli user inform filter agent url retriev url form weight keyword vector accompani checksum enabl discoveri agent specif url chang case monitor site list link url gener assist monitor site act internet explor final track url includ previou digest prevent present inform user bootstrap amalthaea amalthaea bootstrap gener number inform filter agent equal number discoveri agent gener inform filter agent relev user interest user explicitli state system interest form url system determin interest examin user histori project select user histori select frequent access url select group url system www retriev engin fetch actual process compon weight keyword vector gener engin inform discoveri agent genotyp gener randomli assign www index engin agent rest genotyp inform amount keyword provid discoveri agent filter agent queri queri form term logic oper keyword instanc queri form test methodolog result valid concept idea construct prototyp agent ecosystem order provid object consist evalu system perform fix point refer extern factor influenc system user interest result queri post www index engin gener system perform constant user interest figur user interest system converg present fit gener figur chang user evalu perform user profil compil user profil interest collect number html page user profil form number keyword weight vector compar item creat filter agent digest profil provid posit neg feedback base similar item agent present user profil select fix collect html document arrang directori resembl search engin local document provid quick time importantli constant refer frame evalu system begin constant user interest observ system converg behavior system shown figur converg varieti start scenario approach chang smoothli user profil time rate random interv time big random chang user interest random number gener configur alter user profil standard deviat averag chang half user profil interest random order test system adapt abrupt equilibrium posit context equilibrium perfect align user figur show system bootstrap learn great percentag user interest system follow sudden user interest sudden fit neg feedback big percentag user interest quickli adapt retriev document interest user curv lowest averag fit agent curv repres averag fit agent present document user curv exhibit gener present fit gener figur chang user evalu perform user profil curv repres fit agent smoother notic number gener figur big unrealist requir user rate digest conduct experi evolv system receiv user feedback cycl evolv system number step user feedback result step interv figur system converg fast receiv feedback gener approach requir effort user point view cost system converg bit slower result obtain prototyp encourag expect result model interact agent guid agent evolut cluster futur futur work import aspect design amalthaea separ inform filter discoveri agent hope extend experi multipl user domain user set filter agent share discoveri agent user train discoveri agent util exist train user separ filter discoveri agent abil support real oper user connect internet servic send request digest time reconnect filter agent inhabit user comput send request discoveri agent run server discoveri agent collect document request inform filter agent present user network user filter agent final filter gener digest system perform user feedback user feedback figur evalu system perform user provid feedback gener work enhanc user interfac amalthaea provid user complet view insid system work visual dynam evolut system behavior enabl user observ interest summari introduc ecosystem multipl agent applic person inform filter discoveri ecosystem simpl econom impli agent servic user agent run surviv agent remov result show dynam econom model describ interact inform filter inform retriev agent valid result show system converg user interest bootstrap adapt sudden user interest hope process emerg speciat speci special narrow speci cover major applic domain refer catalog internet metacrawl web search servic worm yahoo index balabanov shoham learn inform retriev experi autom web aaai technic report aaai spring symposium belkin croft inform filter retriev commun grosof al reusabl architectur intellig cikm workshop intellig inform decker lesser al architectur cooper inform gather cikm workshop intellig inform lie uniform librari common code www labrou finn semant approach kqml gener commun languag softwar agent confer inform knowledg manag acm lieberman agent assist web aaai pierc evalu conflat algorithm inform retriev journal inform page mae agent reduc work inform overload commun armstrong freitag joachim mitchel learn world wide web symposium inform gather distribut environ aaai porter algorithm suffix strip page intellig agent inform filter salton bucklei text weight approach automat text retriev cornel technic report sheth mae evolv agent person inform filter ninth confer artifici intellig ieee comput societi
DB/678 3 issn de recherch institut nation de recherch en informatiqu en automatiqu leverag mediat cost model heterogen data sourc hubert georg gardarin anthoni mar em leverag mediat cost model heterogen data sourc hubert georg gardarin anthoni rapport de recherch mar page distribut system requir declar access data sourc inform approach solv heterogen distribut problem base mediat architectur mediat accept queri process respect return answer wrapper provid access underli data sourc effici process mediat optim plan process queri classic base queri optim effect method optim heterogen distribut base queri optim difficult achiev underli data sourc export cost inform paper describ method permit wrapper programm export cost estim estim formula wrapper programm describ cost estim imposs due lack inform due amount inform wrapper programm leverag gener cost model mediat specif cost estim wrapper paper describ mediat languag cost algorithm blend cost estim queri result base combin analyt formula real measur object system heterogen distribut cost model work context joint ventur bull inria unit de recherch inria rocquencourt domain de bp le chesnai cedex telephon de pour de sourc de resum le distribu de sourc au de declar solut pour le li de sourc sur architectur base de dan le accept en de la trait laid la le aux sourc de pour de le le plan le de la de base sur du est aux base de pour le base de base sur le est en place car le sourc de pa de cet articl method au de estim de de le ne pa de estim de par ou si descript est vast nou la charg du en complet sa descript avec le de du cet articl du le langag pour specifi le estim de pour le inform de pendant de base sur de formul de sur de base de objet base de de leverag mediat cost model heterogen data sourc introduct declar access data sourc inform recogn kei issu heterogen system concept mediat good basi give integr view multipl heterogen data sourc declar queri view process effici mediat work paper part disco project inria disco mediat base architectur access heterogen distribut architectur consist data sourc provid raw wrapper provid interfac data mediat provid declar queri access multipl client provid queri mediat accept answer return mediat project follow similar architectur garlic inform manifold herm coin relat architectur framework declar access form queri data sourc freedom mediat determin plan execut queri declar mediat gener multipl access plan involv local oper data sourc level global mediat level plan differ wide execut time due vari local process commun mediat process cost method plan remain open issu classic queri optim gener implement search strategi cost model plan gener compar cost estim deriv statist cost formula comput cost oper plan approach easili appli heterogen multipl data sourc data sourc report statist inform html cost formula process oper vari radic depend implement wrapper underli data commun cost difficult determin vari time network system load solut cost estim problem past calibr approach introduc extend object system calibr procedur estim coeffici gener cost special class system approach implement pegasu project main problem calibr data sourc follow gener cost model system situat frequent heterogen environ herm record cost inform queri issu data sourc cost estim queri base histori queri issu data sourc interest uniformli approach limit data sourc queri dissimilar predic rare queri survei detail exist section describ approach problem evalu cost queri plan heterogen dbm multipl data sourc approach reli combin gener cost model specif cost inform export wrapper wrapper implementor specifi part cost inform data mediat implement gener cost correct inform import wrapper gener cost model mediat unknown data sourc wrapper cost model standard accur cost formula heterogen extens cost model implement disco valid section provid evid benefit approach support extens cost provid tool wrapper implementor export size cost comput rule statist reflect properti underli data sourc cardin collect size rule reflect chang result size due reduct cardin due select oper cost rule comput cost estim time scan oper specif cost inform import wrapper mediat data sourc regist queri standard cost comput function mediat overridden import cost function data sourc wrapper export triplet collect give number total size collect term disk averag size triplet attribut give number distinct valu presenc indic export cost formula wrapper oper export formula comput time comput time comput total work rr schema cost info catalog figur registr phase system interact term millisecond size rule integr cost includ oper formula comput cardin total size predict data sourc wrapper implementor easili provid accur cost estim difficulti estim network problem complic burden wrapper implementor amount cost inform requir dramat partial typic cost frequent oper cost test queri permit grace improv mediat gener cost model provid eleg framework integr heterogen cost model gener model framework extens wrapper provid partial inform underli provid specif inform queri extrem encompass calibr specif rule data histor queri cach specif inform past algorithm blend rule statist wrapper default cost model mediat benefit gracefulli extend gener cost model overrid statist cost comput method paper organ section present overview architectur mediat wrapper capabl detail queri optim process show import cost model section describ wrapper size cost comput rule provid languag express inform section detail overview cost comput modul mediat mediat dynam load cost inform wrapper cost comput modul concept overrid blend wrapper inform section valid approach studi benchmark top objectstor demonstr benefit compar classic calibr approach section compar approach relat work section summar paper sketch futur topic research architectur gener cost model project follow gener mediat architectur framework mention introduct section describ architectur disco describ overview phase step requir process queri introduc gener cost model mediat simplifi present suppress detail registr phase interact wrapper mediat occur registr phase queri process phase registr mediat contact wrapper upload inform requir includ cost inform figur show diagram step interact mediat wrapper registr phase mediat instruct mediat call wrapper wrapper return collect inform queri process collect schema wrapper schema underli data shown capabl wrapper set oper wrapper cost inform schema cost inform inria leverag mediat cost model heterogen data sourc figur queri phase system interact store mediat catalog natur schema capabl inform integr queri process consid paper assum wrapper execut administr interfac mediat wrapper wrapper interfac cost formula improv wrapper statist date queri process phase queri process phase typic multipl time registr phase figur show diagram step involv step client issu queri mediat wait answer mediat accept queri composit subqueri step mediat issu subqueri wrapper wait wrapper process subqueri consult data sourc gener return mediat step mediat combin composit subqueri gener final answer return client step note queri step written simpl sql languag subqueri step algebra extend relat logic oper accomplish translat step step mediat thing client transform written respect global queri local optim queri produc queri execut plan mediat execut result step subsequ step mediat estim cost oper entir plan mediat specif inform result regist wrapper discuss plan depend good cost estim subqueri wrapper mechan paper result good cost estim mediat construct plan optim queri plan consist tree algebra oper exist data sourc basic algebra oper typic includ oper classic object algebra mediat algebra cover common ffl unari oper includ ffl binari oper includ ffl aggreg oper elimin duplic comput aggreg function sum ffl oper submit model issu subplan wrapper mediat gener cost model role mediat optim select effici plan altern base cost estim specif inform mediat estim cost plan cost model major compon cost cpu io commun cost gener cost model separ cpu io buri global cost formula paramet cost model depend time paramet statist paramet assum paper uniform commun discrep commun cost subject futur research time paramet rr overhead requir start process time requir deliv tupl time tupl account queri start time sort oper averag time cost tupl time measur millisecond unari gener cost model mediat consid sequenti index scan cost formula establish calibr approach formula requir select select deriv number distinct valu restrict attribut select relev data sourc export presenc index attribut gener cost cluster consid binari gener cost model mediat consid case index nest loop sort merg join formula index index join formula chosen appli formula requir inform defin join cardin estim statist requir gener cost model true aggreg comput implement implement disco java common languag mediat process wrapper process cost formula export wrapper implement code gener compil cost formula languag result code ship mediat registr phase encapsul cost function yield fast evalu time function queri optim fast evalu time requir due comput intens queri optim cost formula ship registr load cost formula delai queri process ship code execut process space entir librari code mediat standard java wrapper implementor cost formula defin cost commun languag local wrapper export data oper sourc administr common object model base system solid select subset corba interfac definit languag data sourc interfac export statist includ object extend interfac bodi cardin section overcom limit gener cost formula mediat queri add cost formula section specif formula mediat cost formula section aim calcul cost algebra node queri tree section describ interfac wrapper mediat idl interfac extend order export statist cost inform export interfac defin object export data subset idl data sourc provid easili map interfac structur object definit languag close exist standard data sourc conform map straightforward interfac definit includ type except interfac declar includ constant type declar support inherit aggreg interfac plane elementari type built complex type construct tupl sequenc constructor relationship fundament local join oper hide figur simpl interfac descript defin interfac typic attribut oper export statist local data sourc export statist interfac statist paramet mediat cost model formula export statist describ data sourc collect calibr approach wrapper implementor express statist inria leverag mediat cost model heterogen data sourc interfac attribut long attribut string short figur interfac properti collect special method attach interfac descript distinguish method add keyword cardin front signatur method extent return number object size extent averag size object byte attribut attribut boolean index indic exist number distinct valu attribut minimum min maximum max valu attribut minimum maximum valu encod object special polymorph constant object figur show cardin method ad interfac definit interfac cardin long long long cardin string boolean long constant constant figur interfac extend statist extend interfac bodi bnf syntax includ cardin shown figur mediat call method extent attribut interfac store interfac statist catalog cardin section pure descript inform map idl interfac program languag show figur cardin implement interfac java function simpl export formula explain previou assum data sourc wrapper provid basic object algebra gener relax assumpt scope paper cardin cardin long long long string boolean long constant constant figur bnf cardin descript rr void extent void figur cardin method definit cardin collect size collect byte averag object size presenc index attribut count distinct valu attribut minimum attribut maximum attribut figur scheme statist formula implement standard local data sourc implement specif bit map pointer chase effici cluster algorithm gener cost model mediat optim valid data sourc overcom extend interfac definit option section give cost formula overrid gener cost model mediat cost formula collect orient oper orient cost formula includ insid interfac definit describ cost function oper collect cost formula interfac describ cost function special relat collect cost formula valid collect sourc collect specif cost formula focu kind cost kind express interfac explicitli collect cost formula syntax cost formula standard mathemat syntax bnf grammar figur wrapper writer collect simpli convent base path collect collect attribut attribut statist term refer statist attribut collect omit case figur list variabl statist formula wrapper implementor defin local variabl function formula defin variabl invok function standard java librari cost formula depend current date access java introduc cost formula give formula linear scan collect inria leverag mediat cost model heterogen data sourc figur rule comput time statist formula attach addit write wrapper implementor oper formula appli approach bind formula oper describ section mediat match rule rule describ cost oper rule divid head rule head repres oper argument argument bound collect free variabl rule bodi formula bodi formula depend cost provid wrapper implementor figur show rule scan oper collect select oper refer free variabl bound attribut free variabl bound refer function defin wrapper histogram statist variabl collect refer result formula plan salari rule match part plan rule match invok comput rule rule match salari repres result scan match match salari match invok comput formula comput previou result comput result note formula miss default formula gener cost case rule approach larg advantag wrapper implementor presenc free variabl rule head make easi adjust cost write rule specif drawback express cost rule slow cost estim process word cost rule overrid mechan induc workload mediat site standard overrid mechan implement effici base kind virtual tabl mention statist formula cost formula estim cost plan cost execut plan determin step algorithm section oper submit remot data sourc match rule head pattern oper match rule bind mechan unifi variabl pattern oper estim rule match unif collect unif attribut unif predic oper predic argument select specif bound paramet case multipl rule match select order wrapper implementor cost evalu algorithm section describ cost evalu algorithm algorithm execut mediat part queri process queri process wrapper regist mediat wrapper rule integr mediat cost model queri integr rule estim cost queri execut plan rr cost rule oper formula oper collect collect sel pred collect proj pred collect collect join pred collect sel pred attribut proj pred attribut attribut join pred attribut attribut attribut formula result math expr math expr paramet math expr op math expr function math expr math expr op function result figur grammar cost rule descript cost formula integr integr consist compil rule written wrapper implementor transmit result compil mediat step decoupl conveni wrapper implementor addit variabl wrapper cost store mediat compil head rule convert intern structur repres oper rule head intern structur similar oper queri tree rule bodi convert object code compil speed subsequ match queri tree oper rule head evalu cost formula rule group scope base applic rule appli collect predic sourc rule appli specif collect predic rule restrict appli specif collect specif predic group rule scope form special hierarchi mediat addit similar appli oper local mediat encapsul scope rule variabl oper specif rule rule eleg special match mechan oper scope cost estim rule integr queri processor mediat gener cost estim plan plan consist tree oper node estim cost plan tree root leav leav root phase cost formula node phase cost oper comput phase top node cost formula cost comput phase cost children oper comput cost oper comput algorithm shown figur describ detail step algorithm rule scope mediat process local oper physic algebra logic algebra inria leverag mediat cost model heterogen data sourc collect rule scope rule rule sourc sourc select select select rule salari queri specif rule figur hierarch cost formula tree associ cost formula node foreach child appli formula node figur cost estim algorithm step associ cost formula node step statist specif rule rule appli node select rule consist match node head cost rule cost rule node match scope special rule found match order formula import rule select oper order match salari salari salari rule match level match node node formula comput valu variabl node conflict multipl formula resolv evalu formula lowest step select list statist involv formula comput fill propag children child receiv list statist comput formula found scope hierarchi list mechan live step rr variabl match rule requir formula join rule comput scope hierarchi scan rule found process mediat default cost model formula found variabl node cope ambigu match scope investig sort criteria classifi case oper pattern match phase algorithm optim step node requir variabl depend form formula set requir variabl pass child step formula comput requir variabl node subsequ select variabl requir child call child cut save optim depend form formula root node formula constant tree perform step depth fetch child node call assign cost formula comput cost node optim call issu child valu requir child node step appli formula node formula invok variabl assign access parent node invoc formula case formula select comput formula invok lowest assign variabl extens dynam cost formula present section extens algorithm implement extens gener framework extens deal cost formula adjust base histor cost extens current estim avoid useless comput plan cheaper plan estim histor cost simpl accur cost extend scope hierarchi queri scope queri specif rule match wrapper subqueri formula ad subqueri execut formula real estim solut close herm approach base histor cost assum formula base real cost accur estim ident subqueri execut subqueri cost differ time solut formula restrict specif subqueri close relat subqueri subqueri vari constant plan investig modifi exist formula depend histori queri execut cost store formula solut exist formula adjust input paramet formula return cost close real execut cost store adjust paramet formula expect formula input paramet simultan adjust techniqu solv problem herm statist herm construct summari statist encod histori execut adjust input paramet avoid useless comput recal optim gener plan estim algorithm plan cost order make optim cheapest plan plan reject stop estim plan middl comput cost greater cost current plan add test step algorithm figur test compar current local cost current local greater current plan immedi reject plan investig impact heurist optim perform inria leverag mediat cost model heterogen data sourc result implement version algorithm section logic program languag implement understand detail special hierarchi implic determin formula oper implement algorithm disco studi impact improv cost estim studi data studi calibr cost access objectstor queri valid benchmark data studi goal tune cost model optim calibr approach invari coeffici cost formula isol set queri calibr local site run deduc cost formula coeffici coeffici benchmark run valid real execut time close estim calibr formula focu index scan experi work collect small object scan index scan size object collect cardin size page page fill factor byte figur time scan collect index attribut id distribut id uniform horizont vari paramet oper select rang calibr index scan linear time estim formula assum number page fetch proport select oper figur show real time linear accur estim base yao formula percentag page fetch process index scan total number object total number page collect cost estim formula index scan oper cost io cost read page io time process object ut figur show estim curv fit curv formula express wrapper implementor easili import insid mediat wrapper implementor simpli rule shown figur relat work earli work distribut queri process assum paramet system catalog collect number object jcj averag size object count number deriv number page number valu suffici deriv select equal restrict infer select greater system maximum minimum valu constrain attribut paramet handl commerci approach defin standard method paramet mediat wrapper case standard valu usual queri heterogen modern system assum estim cost plan formula local process cost commun cost cost garlic author mention local process cost wrapper data sourc estim cost model defin wrapper individu gener cost model valid wrapper data sourc fulli implement sophist blend cost model disco garlic assum calibr approach class cost difficult implement numer evolv data sourc calibr approach introduc logic cost model cost coeffici implement relat system pegasu coeffici repres averag cpu rr valid index scan experi calibr yao formula figur improv objectstor calibr id comput page count yao comput io figur cost formula select oper yao overhead involv queri result process calibr procedur estim coeffici relat includ oracl extens approach object system experi objectstor report approach implement project demonstr limit main problem data sourc follow logic cost model deriv extend relat system behavior data sourc file object object store behav differ predict logic cost model number varieti data sourc difficult integr class system mediat provid tool describ statist formula wrapper consist leverag mediat cost model inform nice gener calibr approach approach herm project idea record statist actual call sourc estim cost execut plan base record statist mediat cost vector maintain record inform data sourc call execut mediat cost vector regist time comput time comput cardin type predic valu correspond summari tabl gener avoid heavi burden inria leverag mediat cost model heterogen data sourc storag estim cost subqueri match cost vector kind regress appli approach demonstr effici sourc queri similar subqueri approach attract mediat capabl handl local record cost case mediat queri differ lot difficult infer statist previou queri cach statist approach good complement gener cost model adapt real sourc behavior mention specif queri record bottom heterogen cost model special make integr cach approach data sourc disco project develop research prototyp compon search integr inform distribut heterogen data sourc target applic project internet intranet typic requir integr larg number diver data sourc data sourc gener perform oper uniqu cost perform oper vari lot wrapper disco address heterogen cost model problem extens cost model integr mediat compon paper framework leverag gener cost model accur statist formula wrapper registr time framework gener captur integr gener cost knowledg declar rule wrapper writer specif inform deriv record past queri execut inherit hierarchi wrapper descript overrid cost integr heterogen cost mediat cost comput compon support wide varieti data sourc interfac languag export statist cost comput rule wrapper mediat languag bytecod effici wrapper mediat sourc registr time complement standard interfac descript languag odmg odl corba give input remot queri compon framework offer gener solut heterogen cost model problem approach implement disco project experi top objectstor system benchmark show good improv perform estim comparison classic calibr approach investig case easili captur calibr model experi bibliograph multimedia fulli demonstr capabl framework case sourc environ data sourc sourc behav specif abstract data type local collect problem cost evalu avoid process larg number imag select imag data sourc relat work area area heterogen cost model framework demonstr full export cost adt oper provid valuabl improv queri optim subject research intend address futur acknowledg author philipp bonnet comment previou draft paper refer malcolm david klau david stanlei zdonik system manifesto build objectori stori morgan yanni subrahmanian queri cach optim distribut mediat system acm sigmod int conf manag rr peter alan bing yao optim algorithm distribut queri ieee transact softwar serg abiteboul pari kanellaki object ident queri languag primit acm sigmod int conf manag philip nathan eugen christoph jame queri process system distribut acm transact system stephen schek open storag system acm sigmod int conf manag michael carei al heterogen multimedia inform garlic approach int workshop research issu data engin distribut object manag cattel object san michael naughton benchmark acm sigmod int conf manag chang heurist approach distribut queri process int conf larg data base mexico ravi shan queri optim heterogen dbm int conf larg du shan queri process pegasu solut advanc applic prentic introduct distribut queri process int conf distribut gardarin al collect select paper technic report laboratoir georg tang cost model cluster objectori int conf larg data base widom tsimmi project integr heterogen inform sourc meet inform process societi cheng stuart michael siegel context overcom challeng system dynam environ int conf inform knowledg manag georg fe tang calibr queri optim cost model feder system int conf larg data base mumbai yanni ioannidi poosala balanc histogram optim practic queri result size estim acm sigmod int conf manag san thoma alon divesh srivastava inform manifold aaai spring symposium inform gather distribut heterogen inria leverag mediat cost model heterogen data sourc olga anthoni patrick valduriez deal discrep wrapper function technic submit public ling liu pu distribut object model applic system int conf inform knowledg manag object manag group omg common object request architectur specif object manag yanni peter eugen shekita improv histogram select estim rang predic acm sigmod int conf manag rusinkiewicz al semant integr inform open dynam environ technic microelectron comput technolog corpor ann ross jame timothi robert charl ward heterogen reason mediat system submit jim kent william heterogen inform manag system modern object acm praveen ramakrishnan case enhanc abstract data submit public anthoni patrick valduriez scale heterogen design disco int conf distribut comput system hong gio wiederhold intellig integr inform acm sigmod int conf manag yao approxim number access organ comm yu chang distribut queri process acm comput rr unit de recherch inria de campu rue du jardin bp es nanci unit de recherch inria campu universitair de renn cedex unit de recherch inria avenu de st martin unit de recherch inria domain de bp le chesnai cedex unit de recherch inria rout de bp cedex domain de bp le chesnai cedex issn
DB/679 3 logic program paradigm urgen dix informatik universit institut ur rheinau koblenz logic program paradigm jurgen dix depart comput scienc koblenz rheinau germani detail report logic program intern meet place usa april april past current activ logic program futur field critic discuss futur logic reason introduct aim organ apt associ logic truszczynski david clear pictur current activ logic program role year organ aim meet present current research direct logic program futur research boost logic program north discuss relat logic program relat field regular schedul minut discuss chair expert topic present live stimul chair start discuss emerg addit past futur logic program devot idea found north american chapter associ logic idea found support eventu lead particip workshop north japan constitu total particip local cincinnati present meet view continu meet year ago lpnmr lpnmr narrow intersect logic program nonmonoton reason techniqu year broad area logic program wrong field main question hang formal consist articl relat talk contribut mention find wai detail paper forthcom talk lectur deliv bob kowalski chair jack logic program system bob start list success lp logic knowledg discuss case lp procedur logic chang state unclear concurr treatment relat object properti lp logic program versu singl agent integr constraint versu singl agent oper system versu chang state versu goal environ describ compon intellig agent view belief gener logic program order make reactiv environ ai commun issn io press jurgen dix logic program paradigm bob claim system distribut activ deduct disjunct integr constraint describ architectur system concurr interact agent achiev treat interact interact agent global environ concurr achiev manner blackboard architectur system concurr logic manner messag pass architectur gopal gupta gave talk horn denot applic mat carlsson discuss leader gopal claim logic program notat denot definit program languag lead syntax semant execut compil code program automat deriv denot partial program verif model check framework briefli spoke recent advanc group made parallel logic program stress import research parallel logic major complaint logic program languag lack effici exploit parallel logic program todai cheapli parallel hardwar improv execut effici mention ac parallel prolog system design implement recent parallel prolog applic larg line long gopal stress import build logic program base tool abstract partial parallel scale larg applic final point applic softwar engin semant filter speaker morn luc de raedt gave perspect induct logic program session chair furukawa gave nice overview rapidli evolv area induct logic program root machin learn success stori branch lp due fact nice balanc techniqu system applic induct logic program ingredi commerci data mine packag luc consid compound successfulli appli end relat data mine languag emb induct construct logic program similar constraint handl logic program afternoon start danni de talk assess issu program chair maurizio martelli argu area develop basic research comput logic reach object formal semant support softwar develop danni show integr level desir consid insuffici work methodolog softwar engin issu major weak point program tool discuss impact lp research paradigm mention optimist view achiev strive gener object specif applic field role respect languag sophist tool present ben mistak make monei sell languag tool sell applic base free talk dai manuel hermenegildo chair michael maher part talk manuel discuss challeng field mention success conceptu impact made program knowledg implement techniqu global practic system develop clp ilp area closest point major advanc made parallel abstract program jurgen dix logic program paradigm automat granular control mention meet expect opinion set program environ power emphasi attent deal chang practic issu challeng program develop theoret result issu educ develop killer applic intellig interfac advanc www search distribut softwar engin part manuel discuss abstract interpret program tradit applic optim present architectur tool task demonstr laptop program valid diagnosi system preprocessor chip base architectur show develop collabor linkop abstract interpret gener check assert prolog integr check uniform assert describ properti termin detect bug show system treat modul separ perform increment analysi finish compar view role type program assert logic function program result live discuss discuss talk peopl note lp impact comput scienc peopl point lp languag perceiv languag industri result view lp research argu peopl produc field applic program environ write paper dai end long discuss pro establish north american associ logic refer section dai began jacqu cohen talk comput molecular applic lp chair philipp jacqu introduc basic molecular explain process transform dna amino acid final protein consid detail step consid problem area molecular biologi great interest lp commun attract attent lp research excit area main reason lp plai import role comput molecular biologi success lp deal comput consid asset plai role facilit solut problem chair paul gave optim program main point applic written singl languag prolog issu relat multipl languag singl applic address issu interfac address detail perform issu current direct work post process execut file appli compil time discuss prolog develop link binari code gener form multipl languag flexibl compon base architectur express perform kei issu gener lp philip expert advoc function end morn lectur function languag chair frank work bell lab admit compar complet wrong function point half dozen function languag real world jurgen dix logic program paradigm hol resp implement ml function type import ingredi function languag design ericsson telecommun applic primit spawn process handl messag compress techniqu bandwidth respect java exampl phone written high level languag formul queri human genom natur expert system shell part function languag wide claim languag support inter languag possess extens highli stabl easi instal debugg profil accompani train note perform longer barrier function languag function languag factor rough estim fact java success significantli lower perform compar end talk discuss attempt function languag featur ad java live discuss mention difficult academ credit strongli viewpoint build applic cooper industri wast time work afternoon start donald loveland talk futur autom deduct discuss head fit don talk summar kei point report statu futur direct area autom deduct autom deduct adjac field logic program overlap experi expect don ad area time stronger face diminish support practic result autom proof unsolv problem verif correct network diminish support loss defenc fund verif research shift artifici intellig focu research support reason progress verif slow symbol comput paradigm longer central ai compet paradigm fund agenc seek focu term attent commerci applic applic domain don mention verif network program synthesi don state steadi fund produc progress evolv identifi grand challeng problem provid support list technic challeng provid includ interfac chair raghu deduct achiev challeng raghu complain talk lack applic note influenc real dbm techniqu languag enter commerci mainstream place sql mention achiev clear definit semant evalu magic area peopl stop write lot implement essenti genuin featur raghu consid rule extend support integr constraint point flight analysi softwar project strongli express real applic benefit ad featur fact broad applic ad capabl wai convinc raghu real compani reluct nonstandard tool implement techniqu matur jurgen dix logic program paradigm current statu prototyp finish commerci product raghu claim capabl sustain dbm product capabl ad exist relat dbm discuss turn import applic influenc theoret system design introduc import materi view uncertainti dai lectur vladimir lifschitz start repres causat logic veronica dahl talk logic languag final ueda lectur year concurr logic program vladimir chair teodor consid talk import knowledg task reason action causal depend involv point import work year plan problem cite work transform plan problem satisfi problem solv problem proposit theorem prover similar method invent map plan problem logic program negat stabl model translat correspond valid plan origin problem gener nonmonoton theorem smodel successfulli comput stabl model vladimir introduc discuss action languag action static law form dynam law form explain relat set law correspond extend logic program vladimir final suggest appli extend work nebel al appli smodel nonmonoton theorem prover teodor point plan problem discuss solv faster brute forc comput mechan peopl distinguish plan principl clean plan principl real approach underli methodolog veronica dahl chair dale miller argu talk logic insepar part languag plai import role natur languag process examin famili formal linguist comput draw connect logic consid linguist term program languag featur make task straightforward avoid left easi wai chang part regain nlp market prototyp lp benefit suggest speed prolog incorpor featur strongli industri applic program maintain larg turn difficult veronica final discuss assumpt logic program augment intuitionist present recent control virtual world robot natur languag discuss frank dale miller argu linear chang state nice repres linear logic ueda gave talk meet chair start give review year concurr logic concurr constraint program achiev argu power simplic concurr languag logic variabl commun channel failur problem area mention absenc good textbook difficult tediou learn foundat view concurr lp lp lp concurr impress lp commun concurr lp common origin stress case benefit technic compar role static analysi role great challeng find serv common platform comput distribut mobil develop type system logic physic properti jurgen dix logic program paradigm panel panel schedul panel panel panel logic program softwar chair apt consist minut contribut howard michael gelfond alan robinson ken cancel particip comment email howard start panel contribut ken bowen ken argu logic program fail carri logic direct basi logic develop power program system support evolut power tool develop stop short real system power analyt tool paper evolv actual program daili basi ken complain disappoint attempt iso prolog peopl unwil contribut invent languag system implement howard argu power algorithm work nontrivi mathemat organ fast fourier transform twenti year ago expect lp draw deepli classic mathemat logic import method enabl power program power algorithm partial success lp draw connect oper constraint logic applic program techniqu lp drive understand nonmonoton reason wai draw classic logic sit lp yield algorithm leagu rsa point resolut repres culmin line research stretch back prior work thread skolem final reach fulfil robinson repres persist stretch year comput scienc gener lack spirit current era howard strengthen connect mathemat oper research method establish conduit lp mathemat world congress athen excess lot power algorithm point interest applic design hybrid system speaker morgenstern ibm appli nonmonoton reason techniqu commerci problem develop expert system benefit inquiri insur system extend nonmonoton inherit network horti al attach formula node gener nonmonoton reason nice comput behavior discuss research industri academ industri focu toi problem tweeti specif busi problem gap prototyp develop academ tool solv busi problem requir solv hard problem nmr formul busi rule run kr bottleneck logic student peopl busi understand academ market public relat toi problem part augment commerci problem point work bore commerci problem commerci problem relationship academ industri mutual academ offer solv examin problem industri open interest area lead result michael gelfond build knowledg base default epistem oper modern softwar system combin abil repres knowledg system domain abil implement procedur algorithm requir access knowledg ten year michael claim substanti progress make logic program suitabl task evolv exist express logic languag defin solid mathemat foundat prove import properti logic program languag capabl jurgen dix logic program paradigm default epistem statement sophist form knowledg progress made develop methodolog repres knowledg work direct care analysi simpl repres exampl respect find eleg wai accomplish simpl count number element satisfi properti moment clear semant effici implement aggreg type problem michael complain attent paid past clear separ procedur declar aspect logic system cleanli combin constraint satisfact michael believ compar small group peopl work logic program deduct achiev final alan entertain gave percept develop program languag person year start assembl switch fortran small lisp mccarthi convinc lisp implement resolut procedur hour alan admit written prolog program ad bob led bob conclud present wrong immedi relativ statement told peopl strong believ freedom type state fix discuss lack public domain standard prolog point main block prolog commerci project lack work modul type logic program framework mention refut point work dale point speed nowadai cite java time slower paul tarau frank argu program larg address lp methodolog program increment current system panel futur lp place speaker jurgen van rai reiter furukawa chair marek jurgen dix start complain lack real applic lack system point similar meet year argument happen fact home page lp nmr relat implement system establish year dozen system system usabl real applic jurgen point applic plan diagnosi recent work show clever encod plan problem normal logic program diagnosi problem posit disjunct logic program exist gener nonmonoton prover koblenz compet dedic plan resp diagnosi system point applic lp intellig system kernel mediat implement extend logic program subrahmanian herm system annot logic disjunct logic recent applic prover program fixpoint engin model checker base van emden recal expect logic programm late logic program unifi comput scienc expect found observ logic program good framework topic formal relat program term function dataflow program advantag area acquir common techniqu true argu opposit happen logic program time logic programm plenti interest common logic program branch applic machin learn induct logic knowledg abduct logic jurgen dix logic program paradigm ing logic compil abstract oper research constraint logic numer analysi interv logic programm applic point contact logic program part research interest applic arbitrarili pick logic programm common research interest twenti year ago seemingli fragment worth common approach applic argu answer set prefer principl fundament approach logic approach subject hand common worth identifi worthi son logic program furukawa consid induct logic program import research area logic program give histor overview main highlight achiev illustr ilp induct aspect logic deduct aspect comput point school repres stephen develop procedur perform induct deduct comput simplifi induct comput argu futur research extend broad field logic program ilp includ constraint logic integr abduct logic program event calculu ilp rai final made heurist observ nonmonoton logic contribut improv effici reason earli argument favour nonmonoton logic fill gap knowledg base make default augment knowledg base make reason effici reduc proof nonmonoton formal high wrong argument case nonmonoton theori compil monoton logic solv circumscript result definit definit support effici reason nonmonoton reason lead effici reason discuss panel fell short audienc tire addit david pearc bottl wine dai meet devot discuss possibl form kind organ north american logic programm question organ intern logic program symposium serv focal point logic program north america feel organ import build research north american lp research goal includ mutual knowledg research research direct group north america joint fund student feel organ spend time reach commun david warren form coordin steer put proce organ dai inform schedul north american research provid broad overview research direct goal david network coordin net mention net academ exposur vast number power practic contribut technolog make industri scienc drew attent current success stori volunt collect pointer system net dai industri confer manchest describ work clp ilp applic dai provid mix applic area site provid jurgen dix logic program paradigm tion strateg plan workshop boost comput logic addit ken bowen recent compil list industri lp visit click applic similar list consist applic function maintain philip success uniqu infrastructur role gopal gupta work put forward net europ structur interest peopl refer year workshop site larg outdoor museum gentl hill dix river nice admir possibl lodg uniqu centuri environ truszczynski deborah matt levi job organ drop cold dai dozen pictur workshop access america home page locat jacqu cohen digit camera enrico put pictur refer editor logic program current trend futur springer jurgen dix detail report lp nmr ai vol comput vol page research report urgen dix logic program paradigm stefan urgen burkhard ulrich zukowski comput model manfr kamp greql ein ur da peter urgen angelika manfr andrea winter und formal grundlagen peter da org thoma marx workflow model wfmc dieter obel schedul criteria ag constraint process hard system ulrich furbach disjunct logic program horn program control program andrea schmid solut count infin problem distanc vector rout ulrich michael frieder stolzenburg proof debug peter sch model elimin simplif applic softwar verif bernt andrea peter urgen ebert program system urgen jorg lobo logic program nonmonoton reason kurt carlo jan technischen anwendungen manfr kamp manag softwar repositori program tool gener approach peter baumgartn hyper tableaux gener jen agent architectur model ma social scienc marcel softwar global illumin research marcel de urgen bernt andrea cycl step jose urgen mauricio osorio confluent rewrit system logic program semant lutz note nondeterminist comput stephan system model lutz mauric finit test tube predict peter baumgartn der der ag jen thoma marx angelika franzk object orient system angelika franzk recommend improv urgen lui moniz teodor przymusinski logic program knowledg ilp lutz uniform approach interleav semant petri net ulrich furbach workshop model base autom reason urgen frieder stolzenburg framework incorpor reason constraint logic program carlo thoma marx petri net tool andrea winter doctor consortium advanc inform system june urgen roger omt metamodel stefan urgen teodor przymusinski super logic program urgen mauricio osorio semant suitabl aggreg peter baumgartn ration effici algorithm view delet wolfgang dieter obel integr fix prioriti static schedul maintain extern consist urgen alexand oper semant visual notat thoma marx april der urgen manfr andrea winter gener system support understand heterogen softwar roger urgen ebert booch metamodel urgen lui teodor przymusinski logic program reason angelika franzk gral refer manual ulrich furbach view autom reason artifici intellig urgen ilkka niemel research project disjunct logic program wolfgang albrecht ur oder kurt lautenbach action logic correct prove frieder stephan ulrich martin constraint logic program comput linguist kurt ridder die linear algebra der ein peter ulrich furbach refin restart model elimin peter peter fr ulrich wolfgang nejdl tableaux diagnosi applic urgen roger uh case lutz algebra petri net semant lu minim model gener base tableaux frieder stolzenburg flexibl system constraint disjunct logic program ilkka niemel workshop integr nonmonoton autom reason system urgen lui moniz teodor przymusinski extens logic implement applic workshop aravindan disjunct logic program system base protein theorem prover urgen gerhard brewka knowledg logic program lutz applic composit petri net semant peter ulrich furbach calculi disjunct logic program klau physic base volum render object graph base model implement angelika franzk queri graph structur ql aravindan abduct framework negat disjunct logic program peter ulrich ilkka niemel hyper tableaux ilkka niemel simon effici implement stabl model semant ilkka niemel implement circumscript tableau method ilkka niemel tableau calculu minim model reason stefan urgen teodor przymusinski implement static semant disjunct program urgen manfr andrea winter gener support understand heterogen softwar stefan urgen ilkka niemel teodor przymusinski comparison static semant ebert altern ur und bad dix furbach mit negat und composit petri net semant engel specif object life cycl definit marek reduc disjunct semant sch stolzenburg und lutz abstract fair semant volker workshop frieder bernd thoma rule set calcul bank fee theorem prover constraint frieder stolzenburg complex logic program set stefan urgen dix confluent calculu thoma marx petri net base method applic design gener kurt ridder complet techniqu mean fix point algorithm christian thoma stephan integr integr constraint schema christoph andrea model timeout protocol design urgen vossen gener correct environ br disjunct posit refin model elimin applic subsumpt delet implement restart model elimin theori model elimin top lutz jen volker rainer mit dem color structur code ein lutz class fulli abstract semant workshop theorem prove analyt tableaux relat method poster session short paper stolzenburg model logic program comput answer
DB/680 3 florida technic report fl inform integr wizard project problem statement report work progress joachim hammer dept comput inform scienc engin florida fl usa integr heterogen data sourc motiv research project year paradigm shift central distribut multipl autonom sourc produc manag creat great demand data system integr order combin inform independ manag data integr system overcom discrep sourc data model queri aspect heterogen data sourc due hardwar softwar platform manag distribut emerg standard protocol middlewar simplifi remot access standard sourc system research initi integr heterogen data sourc focu overcom schemat semant discrep exist cooper data assum reliabl effici access integr system protocol main problem relat integr sourc schema data semant identif solut conflict schema data illustr integr heterogen data scenario consum product site make gather inform order make process consum access product inform accessori check avail price inform user access onlin sourc relat background inform consum press situat depict figur sourc tool data model techniqu creat manag data entiti term set attribut sourc restrict underli data model store retriev sourc data catalog tabl relat persist object xml document publish flat file legaci possibl data consequ usag data model system repres inform fact sourc provid queri capabl onlin shop user issu queri awar sourc repres individu queri user prefer data retriev repositori integr system restrict sourc creat manag built provid user integr access wide varieti heterogen data order accomplish integr system deal complex issu relat discrep result joachim hammer florida technic report fl data repres sourc catalog list comput book repres singl charact sourc repres distinct price book sourc includ sale sourc separ base price tax attribut goal project figur integr data heterogen inform sourc develop build integr system hybrid data approach system integr access heterogen data common interfac view integr data compon store frequent access data faster retriev mediat compon support queri underli sourc case desir data due rapid growth internet sourc data onlin digit onlin portal special interest project achiev establish develop algorithm inform integr autom effect exist focu simplifi task remov structur semant discrep merg overlap data carri research context xml languag fuel current web revolut open excit possibl inform share xml hierarch data structur common data model goldman al argu xml consid true data model specif defin translat xml document data structur demonstr viabil algorithm work prototyp system base data wareh approach refer system user access retriev inform heterogen sourc knowledg underli sourc provid data repres research goal prototyp implement build testb analyz algorithm provid opportun student experi work integr system joachim hammer research issu florida technic report fl investig common data model import issu face research project choic data model algorithm compon data model suitabl repres inform integr object exchang model tsimmi project object model garlic ibm almaden system kif xml markup document format exchang data web advantag xml clear separ schema abil defin metadata data type type definit present rule stylesheet languag xsl close connect web html present number xml program tool support grow xml recent enter final approv standard industri support gener xml specif format quickli make xml tool ubiquit html xml document abil map inform true data model close model abil store object combin xml data object model intern data base initi opportun xml make data integr research project realiti decid xml common data document object model intern data model store manipul xml data dom lack featur found true data replac real oo data model simplifi integr oodbm defin global schema inform share data wareh approach begin global schema underli sourc data origin resid global schema provid relev data tailor global user henceforth refer indirectli formul queri underli sourc understand actual sourc schema issu involv creation global global view reflect inform defin term view data view independ underli sourc extern control data sourc defin term global schema data integr follow approach approach local sourc defin global approach simplifi delet addit sourc updat exist sourc global view exist map sourc remain map sourc global view schema gener underli sourc complet provid data aspect global schema user queri produc answer care ensur global view extran inform typic found sourc global view correct complet specif underli includ data format entiti correct complet metadata requir correct data integr joachim hammer florida technic report fl semant heterogen inform integr share refer process retriev relat inform multipl inform context combin inform context share inform hurdl understand mean sourc relat global translat valu sourc context target merg relat data hurdl heterogen sourc exist level abstract face heterogen system level differ underli hardwar network oper data manag level differ data access semant level differ relat similar data repres progress made overcom heterogen system data manag level translat adapt overcom heterogen semant level goal reliev user burden understand inform repres sourc decid map target context familiar simpl shown figur outlin issu involv overcom semant heterogen cost comput discount price quantiti global schema sourc warranti sourc joachim hammer figur semant heterogen upgrad continu introduc comput assum label inform comput technic specif small subset global schema assum schema repres gener object data entiti depict white attribut relationship repres arrow start sourc notic entiti comput sourc sourc complimentari inform relationship entiti express match kei valu store attribut label sourc sourc user relev technic specif entiti comput sourc global schema repres real world concept similar direct entiti sourc global schema notic attribut repres sourc global schema sourc repres price spec florida technic report fl inform attribut global schema price recommend retail price assembl date comput repres date code sourc calendar date global schema restructur merg sourc global figur entiti properti transform appli data valu semant heterogen shown figur occur data type arithmet unit accuraci part gener exhaust classif semant commit xml intern specif semistructur data sourc topic worth investig import differ number type occur relat schema receiv attent occur schema repres semistructur data model inform transform order overcom semant creat map transform data sourc specif global view set map convert request global schema request understood underli sourc distinct step involv gener map process input metadata previou step process specif instruct gener map process gener set map describ input schema map output schema call schema elimin syntact semant inconsist sourc schema respect global schema semant inform sourc data model made explicit unit perform unit measur integr refer semant schema enhanc inform sourc context schema particip sourc terminolog relationship global view process call schema merg combin align schema previou step integr view schema defin begin activ schema merg includ remov fill miss remov inconsist gener creat program transform data sourc context integr target context make inform transform integr algorithm knowledg order creat basi reason mean relationship common metadata gener understood standard mean concept call ontolog ontolog applicationspecif commonli term definit domain dynam grow updat term ontolog exist year rule guidelin work standard exist support tool share ontolog ontolog editor ontolog base order make power vehicl reason relationship definit resid singl ontolog algebra manipul content ontolog work ontolog algebra stanford knowledg share group excel sourc ontolog applic share ontolog dai commonplac exchang document joachim hammer approach florida technic report fl describ approach restructur merg data briefli highlight architectur architectur base data wareh approach inform integr mean data extract clean user access data goal build system user design gener global schema applic environ system popul schema relev data sourc integr rule gener global schema data store effici queri view system support gener materi global view quickli effici extrem situat interest data found sourc support queri interfac web electron integr step complet autom user input semant global view ontolog verifi updat restructur specif automat gener restructur algorithm verifi updat merg specif gener merg algorithm overview integr system shown figur user data access wizard extractor extractor view manag manag sourc manag data merg engin metadata extractor sourc sourc sourc figur architectur compon distinguish major compon function interact briefli highlight detail descript compon includ design implement section document provid start form bottom joachim hammer florida technic report fl data sourc sourc begin assum data repres sourc repres xml document dtd investig issu relat gener xml document case sourc explicitli defin data restructur engin task transform structur syntax xml document repres sourc semant xml document conform structur outlin target schema data subsequ version add extractor monitor function compon sourc repres xml data merg engin fuse restructur data individu sourc restructur xml global target schema import part fusion step reconcili conflict typic exist overlap data multipl sourc sourc manag manag modul interact close implement compon sourc manag sourc manag evolv mediat process queri multipl sourc task sourc manag maintain catalog sourc includ descript data store queri schema inform inform locat sourc contribut data target schema metadata repositori make sourc info persist task manag maintain content global schema store incorpor restructur fuse xm document data belong multipl manag track content load mainten overrid exist content append data xml document exist data merg initi plan implement simpl load approach mainten reduc period refresh content relev data stage implement sophist mainten load oper append merg load combin increment manag interact sourc manag track commun sourc provid data sampl interact forward global dtd case sourc exist sourc schema send mainten queri sourc notif data schema sourc sourc sourc manag evolv mediat compon virtual system tsimmi mix user queri sourc directli requir sophist queri process capabl insid mediat data store data target schema applic ontolog describ term data user view joachim hammer florida technic report fl metadata target sourc main requir data persist support xml effici queri process relat dbm xml support top persist store support xml nativ repositori system support xml nativ promin lore system xql queri engin persist process examin analyz pro con option serv persist repositori store specif auxiliari data structur process sourc tabl view manag task view manag creat manag user view data access wizard user view data fashion graphic write user view manipul data fashion data manipul includ global schema support applic domain health comput onlin scientif ontolog defin concept term definit view base global queri user view base distinguish phase gener restructur integr phase move data form sourc support queri restructur merg goal restructur merg phase gener set rule convert sourc data nativ integr format global sourc restructur specif carri schema singl integr specif carri merg rule set activ gener subsequ step input restructur engin data merger phase popul global target schema relev data step make approach similar wareh approach advantag disadvantag merg data time resourc consum activ quickli effici goal avoid step altogeth speed merg phase system begin restructur merg xml assum exist global schema describ applic area interest assum interest provid access comput softwar assum schema model comput softwar hardwar gener term global schema refer target schema restructur merg process creation target manag initi load process pass repres target schema sourc manag sourc manag determin data fetch relev target sourc manag invok pass target dtd determin exist set restructur rule convert sourc xml doc format target dtd exist set updat due schema underli sourc joachim hammer florida technic report fl restructur process start restructur xml doc return sourc manag rule gener process start restructur xml doc receiv sourc merg process initi merg engin restructur xml doc merg singl pass manag load sourc data restructur input step xml document dtd repres inform sourc descript global schema ontolog describ concept term global schema output set rule repres xsl direct convert origin sourc xml document xml document correspond global schema rule transform data xslt processor gener rule convert input xml xml document adher structur integr schema version restructur engin part wrapper compon provid queri translat process data model capabl assum sourc data transform xml document explicit dtd describ schema assum relev sourc data push approach metadata restructur restructur specif specif restructur data transform xml doc xml doc dtd manag sourc manag xml doc xml doc merg restructur data transform xml doc dtd xml doc dtd sourc sourc sourc joachim hammer data merg merg specif specif xml doc restructur data transform figur restructur merg architectur metadata data merg input step restructur align sourc data output merg specif repres set xsl direct data merg process consist fusion step pull data individu xml doc clean step reconcil conflict overlap similar relat data sourc florida technic report fl overview interact restructur merg process phase depict figur data access data access phase user access integr data store persist data distinguish architectur version compon capabl simpl version queri capabl sourc data sophist version support distribut queri process mediat goal eventu build version version serv earli prototyp evalu viabil kei restructur merg view data access wizard version access inform refresh main compon phase data access metadata repositori data store begin phase underli data sourc refresh requir execut step discuss phase mainten queri mainten limit complet refresh extrem simpl manag multipl manag track schema updat user queri support data repositori lore user queri global schema directli view view queri defin formul data access wizard graphic interfac architectur depict figur data access wizard queri xml doc data metadata schema ontolog figur access inform refresh note approach repres simplist data scenario support mainten queri support joachim hammer florida technic report fl inform push inform data predefin sourc data chang access inform usag case approach version access sourc differ version previou version actual merg data delai data request user order provid accept queri merg process separ part restructur gener merg specif repres train set actual data merg process merg specif develop user request conjunct manag determin data request servic version invok restructur merg sourc data item relev request materi entir user view move part involv movement data architectur architectur load refresh activ overview architectur depict figur merg merg specif specif xml doc merg data access wizard queri xml doc data xml doc manag sourc metadata request data schema ontolog global schema figur access sourc version data access support goal provid architectur store answer frequent queri queri sourc case desir inform version enhanc exist compon distribut queri function integr mediat distribut queri process restructur engin wrapper queri data translat start joachim hammer florida technic report fl version compon limit capabl manag serv dual rout queri mediat answer mainten tradit capabl provid stage move function architectur architectur order provid mediat capabl integr specif map wai previou version main focu find wai enhanc exist map gener map preliminari overview compon interact shown figur data queri translat restructur specif extractor data queri xml doc xml queri xml doc xml queri manag xml doc ir xml queri xml doc extractor xml doc mediat joachim hammer mediat specif extractor xml doc sourc sourc sourc figur data access support refer florida technic report fl inform mediat intern confer manag pp tsimmi integr heterogen inform tenth anniversari meet inform process societi pp whirl approach data ieee intellig markup languag web ontolingua tool collabor ontolog knowledg system stanford technic report septemb inform integr sigmod record special interest group manag pp semistructur data migrat lore data model queri intern workshop web translat approach portabl knowledg pp queri data stanford data wareh bulletin technic data pp inform manifold approach data ieee intellig manag system semistructur sigmod record special interest group manag pp exchang heterogen inform eleventh intern confer data pp papakonstantin rewrit semistructur acm sigmod intern confer manag pp object model level novemb architectur futur inform ieee pp integr acm sigmod intern confer manag pp knowledg composit joachim hammer florida technic report fl world wide web markup languag world wide web world wide web stylesheet languag world wide web integr wareh bulletin technic data pp mainten wareh sigmod record special interest group manag pp joachim hammer
AI/681 2 erlangen spoken dialogu system inform retriev system haa huber dept pattern recognit research centr system germani abstract present overview spoken dialogu system develop erlangen januari access telephon line answer inquiri german languag german train connect continu improv includ uniqu process word flexibl dialogu strategi adapt qualiti recognit user input version system subwai inform train flight inform system integr multilingu system cover german addit languag parallel current research introduct stochast model semant direct integr prosod inform word recognit detect user multilingu introduct spoken dialogu system develop erlangen period year system architectur implement intens research perform area word linguist knowledg dialogu prosod analysi spoken dialogu system german languag made gener public connect telephon line januari phone corpu approxim spontan dialogu train timet research fund dfg research contract number ec framework project german feder ministri research technolog framework project grant iv content articl li author inform involv naiv user familiar speech recognit understand technolog dialogu constantli transcrib evalu system compon design research current develop implement evalu real speech data collect dialogu strategi adopt strict case system intend commerci collect actual spontan speech data import optim dialogu success rate word semant dialogu success rate partli due improv algorithm dialogu partli avail train data overview system architectur section descript provid word linguist dialogu speech synthesi www interfac number uniqu featur outlin section explain dialogu strategi adapt acoust channel cooper user section explain word detect classifi word recogn inform gener system reaction section briefli report evolut multilingu system automat detect languag domain subsequ section focu recent develop integr stochast method semant analysi discuss section complement enhanc tradit linguist method approach involv integr recognit word prosod boundari present section implicit detect syntact structur word recognit process outlin current research detect user essenti issu dealt spoken dialogu system applic system architectur architectur depict figur user utter digit convert word recognit perform word chain altern word hand linguist processor linguist processor extract set semant concept word recogn result forward dialogu manag dialogu manag check paramet send queri applic depend dialogu histori current dialogu user confirm paramet paramet request time result search verbal gener messag modul plai user convert connect telephon line gener linguist analysi figur basic architectur word recogn word recognit modul base hidden markov model languag model basic architectur recogn depict figur detail recogn found hmm word model consist subword model introduc size phonet context cover model depend amount train data phone common word automat viterbi word chain forward search backward beam search forward viterbi lexicon hmm word word graph graph featur extract bigram figur architectur word recogn repres model improv version subword unit call combin basic concept structur phone context size tree hierarchi phone superclass lead reduct word error rate recogn set stochast languag model activ predict forward dialogu manag dialogu manag expect departur probabl user leav hamburg simpli stochast languag model accept ten adequ confirm paramet paramet singl dialogu leav twelv leav stochast languag model train automat subset record user label dialogu manag predict linguist processor linguist process compon parser linguist knowledg base parser oper accept output speech recogn task build semant user utter forward dialogu modul interpret semant formal emploi semant interfac languag chart parser achiev robust mean island techniqu render select partial result global result comput parser oper graph word se recogn word depend word recogn emploi mean case word parser grammat correct path graph build semant case word syntact semant analysi directli carri analysi base syntact semant knowledg store linguist knowledg base linguist knowledg defin term unif categori grammar formal combin unif categori approach grammar categori number rule emploi restrict basic rule word encod lexic categori lexic entri repres complex featur merg mean simpl unif speech synthesi modul involv simpl concaten phrase word lead good intellig longer fragment natur effort requir chang domain dialogu strategi larg speech signal slightli warp order make sound assur caller talk machin qualiti speech synthesi proven impact speak style user simpler concaten method notic silenc period word user imit speak unconsci mean speech corpu compil spoken dialogu system reflect speech synthesi algorithm chosen modif modul result declin word recognit accuraci true word system impact actual formul user utter dialogu manag role dialogu manag interpret semant user utter forward linguist light specif dialogu histori plan content formul task carri independ close collabor submodul linguist interfac interact directli parser isol inform relev paramet access place time departur dialogu marker determin state dialogu dm linguist histori knowledg belief histori dialogu cation input output speech li mp bm tm figur dialogu manag process flow influenc progress belief modul underspecifi semant place base predict develop dialogu isol citi ellipt user utter interpret goal sourc locat user requir profil anaphor rel express place time clarifi central compon dialogu modul track progress dialogu term system user dialogu translat system goal satisfact augment transit network descript transit dialogu state gener expect continu term user system act task modul interfac domain hold inform ident number task paramet user case train messag planner determin system utter basi report provid dm state dialogu gener request inform valu paramet miss present user entri match suffici specif suppli initi search www access vision evolut multimod imag process integr phone internet step direct develop search engin pose user queri multipl travel inform www search engin constitut interfac dialogu system www german railwai swiss railwai number dynam html document creat access hold intermedi result collect temporarili save local cach continu updat search end engin facil number local data retriev entri filter paramet user constraint initi queri match store data flexibl adapt dialogu strategi distinct trait adopt dialogu user freeli formul queri carri transact flexibl user initi order task paramet specif place chang current subgoal correct paramet dealt time system expect inform paramet contrast common approach present user menu compli answer intellig possibl content user probabl misunderstand remedi system confirm task paramet user strategi safeguard correct entri retriev interact speed confirm explicit depend histori failur current dialogu potenti correct user initi clarif contribut repair crucial error success complet task case effect user repeat confirm paramet spell worst restrict user usual freedom user expect confirm paramet indirectli conjunct specif contribut greater user satisfact dynam modifi commun repair strategi emploi user reaction dialogu guid frequenc conflict system belief user goal word process import failur spoken dialogu system problem word cover system vocabulari improv understand relax degrad understand restrict initi confirm multipl confirm multipl spell singl confirm figur flexibl dialogu strategi word recogn recogn word similar acoust profil unknown result possibl misunderstand user system due fact user rare cross boundari system notic suddenli behaviour desir system detect unknown word inform user correct error dialogu success rate accept system user detect classif word present approach detect word implicitli inform word categori involv integr detect classif word directli recognit process word recogn acoust languag model inform classifi word word categori acoust model languag model inform contribut assign categori basic idea approach build languag model recognit word base system word categori emiss probabl word estim word categori includ vocabulari word categori observ train probabl observ word categori independ test sampl futur utter probabl estim train sampl detail calcul emiss probabl word probabl describ finit set word timet inquiri word categori practic infinit categori defin rare word fall categori probabl garbag word probabl integr probabl languag combin acoust model word simpl acoust model enhanc model base acoust model construct averag acoust distribut phone model train corpu experi encourag word accuraci semant concept accuraci achiev error rate drop word detect word recogn correctli classifi case extens linguist processor word string deliv recogn inform word detect order make inform access dialogu lp includ semant pass dialogu manag system capabl react appropri word detail linguist process word found extens dialogu manag extens word recogn lp occurr word led design dialogu strategi extra inform account adopt line presenc word dialogu state incorpor atn descript dialogu accommod altern state transit repeat param ascertain word order avoid alarm warn user problem repeat paramet involv warn default repair mode spell involv notif user failur hang pose queri illustr inform requir cover repeat citi spell inform train connect citi cover german citi proce evalu success evalu metric context dialogu system refer user inform effortless manner complet metric relat smooth close respect task carri successfulli studi protocol major dialogu collect extend inform show ts dc rate establish system version rate version emerg correct treatment complet success justifi incorpor function system multilingu ec extend respect multilingu current handl languag czech train german train train system start german german open user free implement languag languag identifi implicitli multilingu word recogn recogn beam search path relat languag elimin overhead low compar run monolingu recogn parallel complet recognit recogn pass linguist processor ident languag spoken match word chain recognit result multilingu recogn good monolingu version run languag spoken languag identifi word call task paramet domain accommod gener concept ontolog ontolog cover concept sourc goal departur arriv time date travel exist number state insid beam time frame monolingu recogn multilingu recogn figur implicit languag identif word recogn languag spoken identifi approx time multilingu recogn start function monolingu recogn unit meant port system languag involv develop grammar analysi gener phase word extens restructur interpret process dialogu manag dialogu manag suffici flexibl switch applic languag domain stochast method semant analysi motiv statist method speech process task improv effici analysi data reduc amount expert knowledg incorpor system result fast straightforward adapt task domain major research area focu introduct statist method level semant linguist analysi method linguist analysi basic assumpt stochast method semant analysi analysi effort greatli reduc oper restrict domain train timet inform carri complet linguist suffic system locat understand part utter influenc queri part influenc dialogu structur essenti citi departur complet irrelev travel connect part import dialogu system call semant attribut analysi limit concept introduc stochast model semant analysi idea avoid grammar describ import part write small partial cover special grammar time express utter includ semant stochast method predict occur attribut current partial grammar semant analysi predict attribut advantag partial grammar easi maintain system task analysi carri faster accuraci state develop method semant attribut predict languag model decid specif attribut includ current utter divid corpu subset attribut consist sentenc made utter languag model train signal occurr analysi probabl recogn word sequenc calcul respect languag made higher probabl languag model denot occur attribut partial grammar activ experi detail show predict rate approxim averag attribut date citi approach stochast semant analysi base standard higher order hmm basic assumpt underli word word chain assign semant attribut formal manner defin assign function word chain input produc word attribut illustr munich hamburg nil nil nil nil sourc sourc goal goal nil mark word irrelev sourc marker citi goal citi arriv rest basic ti statist process describ occurr attribut relat word attribut assign function unknown train set attribut utter includ annot em algorithm deriv estim formula discret densiti function involv estim formula version formula detail discuss cf obtain detect rate date citi express integr recognit word prosod boundari wide recogn prosod inform sourc inform speech understand exist system make probabl reason system handl fairli short simpl utter restrict prosod function mark sentenc phrase believ import effici linguist process prosod inform structur prosod mark sentenc mood accentu redund accept system perform prosod inform total case domain move complex spontan speech translat prosodi import issu utter tend longer averag number word utter dialogu averag word averag utter made word make import identifi prosod phrase boundari spontan prosod boundari crucial understand utter punctuat mark written languag word viewpoint mean group prosod wide close correspond prosod syntact phrase boundari system prosod classifi determin phrase boundari base word recogn output speech signal word graph comput spontan speech data number tree reduc automat determin prosod phrase boundari direct integr classif phrase boundari word recognit process hmm model phrase integr stochast languag model word recogn determin optim sequenc word boundari addit prosod obtain phrase boundari recognit rate compar achiev separ prosod classifi introduc word error rate reduct attain comput effort approach phrase boundari classif render prosod inform word recognit process integr prosod boundari inform recogn sundai mondai observ corpu boundari semant attribut mark conduct experi type boundari label corpu confid similar improv effect domain investig prosod boundari inform linguist processor user emot peopl kick soda machin dont observ speech corpu user angri spoken dialogu dialogu system wrong context import identifi situat initi refer custom human oper start clarif lose potenti custom forev detect emot adequ reaction angri user lead higher accept system emot express human speech fear interest distinct anger normal speak type emot relev implement emot detector spoken dialogu difficult distinguish joi anger emot verbal wai addit cue bodi lexic inform carri word acoust prosod sharp loud fundament frequenc speech durat valu occur singl utter place conjunct earlier utter dialogu emot express mean combin paramet concentr acoust prosod cue locat emot lexic inform word classif emot prosod featur base durat cue fundament frequenc energi contour artifici neural network classifi train set utter test set attain rate recal rate detect angri normal speak style futur work commerci spoken dialogu system train timet inform begin run public telephon line valuabl opportun assess newli develop techniqu user present uniqu main research area directli relat develop ambiti goal merg approach integr recognit word phrase boundari stochast semant analysi classif phrase semant attribut subject singl integr search emploi sourc statist languag model word boundari statist model semant statist languag model sequenc thereof replac pass word recogn search sourc inform made earli stage recognit process result search graph word syntact semant interpret word sequenc refer multilingu dialogu system int conf spoken languag multilingu spoken dialogu system travel inform access speech semant process word spoken dialogu system proc european conf speech commun volum page statist prosodi guid parser proc workshop artifici intellig page bericht au der informatik german inton pattern integr recognit word phrase boundari int conf spoken languag categori base approach recognit word int conf spoken languag volum page integr larg context languag model real time word recogn page faculti electr comput probabilist semant analysi speech page detect mean proc workshop inform retriev page west beep machin emot automat speech understand system proc workshop speech dialog page prosodi speech understand system lectur note artifici intellig block improv spontan speech prosod boundari proc int conf speech signal volum page technic cap siemen esprit robust parser continu spoken languag prolog workshop natur languag understand logic program page prosod process proc int conf speech signal volum page ration interpol maximum likelihood predictor stochast languag model proc european conf speech commun volum page speech recognit spoken dialogu system de progress prospect speech research proc pai page sankt infix steedman inton inform informatik page die von volum der forschung verlag wahlster translat dialog proc european conf speech commun volum session page price segment durat vicin prosod boundari journal acoust societi combin categori grammar unif natur languag linguist page reidel
HCI/682 4 smart devic everydai thing albrecht schmidt michael beigl karlsruh germani phone albrecht abstract mobil abil system obtain inform aspect system environ implement mobil system compon augment abil captur aspect environ recent work consid augment mobil artifact local paper discuss augment mobil artifact set sensor percept techniqu awar context locat report experi augment mobil phone awar awar technolog everydai artifact introduct wide acknowledg awar context mobil system produc ad foster innov applic domain mobil notion context gener refer aspect environ mobil system oper system adapt respond behavior context commonli straightforward aspect mobil system environ locat whereabout system local avail resourc facilit awar context mobil system compon augment abil captur aspect system commun person mobil devic applic system mobil physic object locat tag assert system context piec context enter distribut mobil system appropri augment system compon concern paper system compon augment ad mobil devic artifact research report base context primarili devic discuss context user mobil applic run devic distribut mobil system mobil system discuss date locat perspect base ad system compon gener approach distinguish system compon util mobil commun infrastructur obtain locat commun guid system tourist lancast emploi mobil comput deriv locat wavelan network compon equip explicit locat receiv specif locat gp system inform access base palmtop augment gp receiv compon augment wai surround infrastructur assert locat compon strictli speak awar augment enabl awar exampl tag activ badg system parctab termin augment infrar diod emit signal transceiv infrastructur deriv locat locat rich locat inform locat exploit mobil system argu context captur focu paper augment mobil system compon awar context locat investig set sensor mobil system compon contextawar report experi research project tea tea project investig technolog enabl awar applic mobil telephoni project studi captur commun context everydai environ issu investig project integr sensor percept autonom awar mobil artifact set sensor percept techniqu integr end shift complex contextawar algorithm level architectur level simpl sensor featur extract method hardwar algorithm advanc achiev fusion inform obtain emploi suitabl architectur approach contrast approach tend gear implement technolog issu highlight work report autonom awar mobil artifact straightforward add awar technolog sensor percept algorithm gener comput platform person digit assist wearabl comput tea project investig ad awar technolog artifact provid platform readi extens hardwar softwar case artifact consid mobil base digit technolog open extens project challeng ordinari repres everydai artifact artifact augment studi test environ subsequ briefli discuss relat work mobil report experi tea project work discuss sum experi ad mobil point issu direct research relat work wide rang project mobil artifact augment enabl awar locat gener approach distinguish discuss artifact fall group artifact comput platform rang instanc wearabl pc artifact explicitli design locat activ badg infrar activ bat ultrasound emitt work tea contrast concern augment artifact comput platform nonfunct support local handheld relat work ad sensor technolog locat person mobil devic rekimoto ad tilt sensor handheld obtain context handl devic explor integr orient sensor handheld comput line context obtain sensor user interfac extens distinguish mobil comput context relat mobil devic surround environ handheld comput gener remain shield stronger interest situat devic pursu wearabl comput develop kei motiv wearabl comput support user improv proactiv wai ground perman user precondit suitabl understand context rang project investig sensor integr obtain inform user environ camera comput vision integr wearabl comput visual research vision assum suitabl power comput platform sensor explor rang wearabl comput applic oregon wearabl equip sensor object presenc collabor field engin applic applic emploi end recogn extrem user situat applic task sensor integr gener wider applic wearabl project close spirit work investig sensor integr rang applic project primarili concern enabl shoe express user relat work augment artifact express approach obtain inform ordinari express gener inform user move gener inform ordinari cup wai close work gold investig integr sensor altern locat techniqu indoor navig tea integr simpl sensor data tea gener notion context locat tea devic contextawar gener motiv underli tea project make person mobil devic smarter assumpt devic environ situat provid assist object tea arriv gener solut make devic approach integr awar technolog hardwar softwar devic conceiv person applianc tea perspect call host cornerston tea devic concept integr assembl acquisit data independ applic associ data situat host devic instanc meet implement sensor process method comput situat context sensor devic specif object underli sensor integr address kind context deriv locat inform situat occur obviou context infer locat work serv show rich context deriv locat provid locat semant specif posit specif issu investig tea sensor fusion aim deriv context group sensor sum deriv individu sensor tea architectur tea base layer architectur comput context illustr figur separ layer raw sensor featur extract individu sensor context deriv cue sensor layer defin open arrai sensor includ sensor percept real world logic sensor monitor condit virtual instanc logic state host devic data suppli sensor rang form slow sensor suppli scalar temperatur fast complex sensor provid larg amount structur data camera updat time vari sensor sensor cue layer introduc cue abstract raw sensor data cue featur extract data stream singl cue deriv sensor abstract sensor cue independ specif applic process preprocess sensor data refer cook sensor serv reduc amount data substanti abstract architectur prescrib specif set prescrib specif method featur extract layer accord philosophi shift complex algorithm architectur assum cue calcul base compar simpl method calcul cue sensor valu instanc base simpl statist time averag standard deviat quartil complex map algorithm calcul main frequenc audio signal pattern movement base cue layer hide sensor interfac context layer smaller uniform interfac defin set cue describ system environ cue layer strictli separ sensor layer context layer mean context model abstract sensor technolog properti specif sensor separ sensor cue mean sensor featur extract method develop replac independ context layer introduc set context abstract real world function cue level featur extract data reduct cue inform sensor fuse process calcul context cue assum context consid close relat host devic specif situat architectur prescrib method calcul context statist method neural network instanc context calcul context cue sensor figur tea base layer architectur abstract raw sensor data context cue rule set cue irrelev simpli neural network weight reduc context reason cue deriv cue relev indic real world implicitli method learn context data context layer hide lower interfac base context interfac context reactiv behaviour initi explor approach studi tea develop gener prototyp devic explor valid tea devic mobil phone parallel develop prototyp conduct requir analysi investig assumpt context person mobil devic deriv locat input rang scenario develop mobil phone person digit assist found potenti context locat higher scenario typic pda applic led focu studi domain mobil telephoni tea devic develop gener gener devic develop explor wide rang sensor contribut contextawar common sensor light sensor acceleromet figur current implement tea awar devic size mobil phone batteri pack sensor air ga concentr implement larg amount raw sensor data collect independ site analysi fusion analysi contribut sensor group sensor percept specif studi number situat consid relev person mobil devic defin user user peopl user drive data collect independ data collect site data subject statist analysi determin sensor sensor group probabl recogn situat analysi cluster collect strategi carri devic longer period time accompani user situat period raw sensor data record analyz identifi cluster situat occur record situat user sit walk walk engag phone process aim identifi sensor relev develop cluster algorithm support awar situat interest prototyp implement valid initi explor sensor contribut awar typic situat serv inform develop gener devic optim smaller shown figur devic integr light skin conduct sensor temperatur sensor sensor read calcul cue applic context system design minim energi consumpt compon number analog digit input commun serial line host devic calcul cue context restrict due limit microcontrol program fit byte ram featur extract algorithm gener cue design accomod limit data read high speed audio directli analyz store typic cue audio calcul fly number cross signal time number direct signal cross indic audio light basic statist method estim deriv calcul slowli chang valu temperatur skin conduct process cue layer cue function context calcul base rule extract data record sensor board situat prototyp independ specif host conjunct palmtop wearabl comput mobil phone primarili prototyp appli area mobil telephoni state art mobil phone support profil group notif input output reaction incom messag call user defin profil situat behavior desir situat tea devic ad mobil phone autom activ profil activ manual user approach valid tea devic control small set typic profil applic mobil telephoni interest applic domain mobil phone enabl tea share context caller context instanc assess good time call good time commonli phone assess import incom call import phone back common question accept studi implement applic call initi enter number applic establish call context inform caller caller prompt decid proce voic servic short messag servic detail discuss applic provid discuss tea experi experi gather tea project support case investig context fusion sensor approach obtain context approach obtain strictli context deriv locat inform sensor analysi collect data show approach context deriv sum obtain individu sensor initi experi suffici deriv methodolog systemat applic sensor fusion applic find generaliz layer approach percept abstract sensor cue cue context prove suitabl strategi percept process addit support architectur qualiti modular separ concern extens experi gain wide rang sensor integr experi deriv indic sensor interest object captur real world situat found sensor movement light provid contribut awar set sensor specif applic valuabl addit found percept improv sensor multipl sensor microphon light sensor orient found placement substanti influenc contribut sensor base awar challeng approach tightli pack sensor context augment person mobil altern distribut sensor instanc bodi assum bodi area network data collect note experi extend explor practic applic commerci prospect context call briefli discuss commun debat killer applic base research suggest killer applic area interperson commun awar technolog everydai artifact project conduct parallel investig awar technolog motiv differ tea make artifact improv function artifact offer user project artifact collect context inform chang function artifact core idea awar technolog everydai thing peopl obtain context everydai activ speak sourc approach assum distribut system artifact augment collect context artifact augment context awar artifact model model investig project base artifact augment awar local context end artifact equip sensor process environ softwar autonom calcul context sensor data artifact broadcast context local environ end awar artifact augment basic commun capabl presenc awar context broadcast establish context inform space local scope applianc inform artifact environ local knowledg artifact context origin awar cup explor awar artifact model augment cup repres everydai artifact awar technolog call augment hardwar softwar process commun state cup context inform figur ordinari cup process commun base current implement shown figur result design iter carri year goal hardwar develop provid ordinari cup process commun design challeng provid addit featur chang basic properti cup notic everydai current version hardwar digit sensor metal ball switch detect switch detect cup infrar diod microcontrol process unit power store wirelessli charg reson circuit laid circular cup base board compon mount high softwar control acquisit raw data sensor top comput context process sensor read abstract design minim energi consumpt movement paramet chang fast case cup move detect movement sensor poll requir read avoid motion detector connect interrupt pin trigger read occur detect movement record short histori event heurist detect abstract event cup cup drink cup contrast temperatur paramet chang slowli real world adapt speed sensor read track temperatur inform conjunct motion inform comput fill cool current temperatur broadcast context uniqu id ip infrar led face overhead commun rang meter angl cup inform collect overhead transceiv infrastructur instal usag environ room offic environ transceiv base irda chip footprint connect bu area gatewai local collect context broadcast udp packet experi design project serv gather extens experi awar tea primarili provid insight issu surround sensor fusion context percept substanti experi awar technolog issu surround transpar paradigm shift sensor technolog artifact power issu power manag experi iter design power concern central issu influenc wide rang design process microcontrol run reduc clock speed reduc power consumpt process mode processor switch sleep mode consumpt motion detect earli version cup acceleromet reduc power consumpt make feasibl wake electron sleep mode cup move activ poll acceleromet replac ball switch switch connect extern interrupt input microcontrol make feasibl put microcontrol time sleep mode lose inform cup move temperatur dalla chip measur temperatur consum standbi mode short read cycl recharg chang batteri cup plug cup recharg everydai design option fit batteri run live time cup recharg cup addit attent user approach provid cup tabl connect power line user put cup cup wirelessli recharg electron run hour capac commun commun infrar diod includ statu cup commun environ layer code irda code softwar microcontrol save addit compon data rate set maximum feasibl implement softwar current design reduc time diod power explor gave insight issu transpar artifact augment wai common suffic minim hide technolog requir free line sight artifact transceiv infrastructur transpar design ensur common free line sight experi earli power provis transpar observ user care check make recharg expect fact batteri ran flat design influenc artifact effect visibl user current prototyp issu address introduc wirelessli gold charg cup augment practic transpar awar technolog everydai earli experi paradigm shift perceiv design awar applic tradit view sensor applic place make collect data awar artifact model explor notion sensor peripheri replac notion call sensori applianc make sensori data decentr shift sourc data notion applic embodi sensor integr environ explor project applic explicitli input set sensor sensori small applic applianc consum context digit door plate origin built leav note augment meet place fill cup deriv context local environ import reach applic indic kind servic emerg framework collect provid context inform place discuss tea project gather substanti experi contextawar awar technolog mobil artifact gain import insight sensor fusion awar situat architectur design awar perspect environ applic shown integr sensor viabl approach obtain context repres complex context captur interact everydai artifact extend investig gener approach deriv context sensor experi suggest calcul implement independ specif applic expect futur gener sensor provid cue raw sensor data work sensor experi limit attempt gener gener fusion method work date specif focuss architectur issu tea architectur awar artifact model explor issu separ coupl context acquisit context consumpt import futur work investig issu develop principl architectur design multisensor system design awar technolog rise discuss trade perform critic cost power consumpt experi highlight substanti challeng percept techniqu perform comput environ carefulli craft sensor control meet requir import research direct area base percept embodi sensor control embodi adapt chang sensor properti scalabl percept techniqu perform robustli conjunct sensor dynam power introduc notion qualiti servic perceiv expect import research direct work contribut develop perspect applic acquisit context dissemin everydai activ awar artifact model explor studi shift applic sensor peripheri dynam system special applianc augment captur context augment context refer collabor wearabl system remot intern symposium wearabl octob hw experi design everydai object comput elsevi publish role connect support applic intern symposium handheld ubiquit comput sept lectur note comput scienc hw ambient colleagu awar smart environ manag interact smart environ decemb indoor navig set cheap wearabl sensor ieee intern symposium wearabl comput san octob distribut locat system activ offic ieee network cybernet wearabl camera intern symposium wearabl octob pp interfac apparatu applic chi extend april acm dr ns develop person technolog field person technolog march tilt oper small screen interfac acm symposium user interfac softwar technolog ak gd context aid develop applic confer human factor comput system nl comput applic workshop mobil comput system santa dec van van de advanc interact context intern symposium handheld ubiquit comput sept lnc hw context locat comput graphic awar telephoni wap person technolog verlag issn visual contextu awar wearabl comput int symposium wearabl comput oct pp
HCI/683 4 peter softwar infrastructur ubiquit comput support synchron collabor heterogen devic ubicomp ubiquit comput springer lnc pp softwar infrastructur ubiquit comput support synchron collabor heterogen devic peter gmd german nation research center inform ipsi integr public inform system ambient workspac germani abstract ubiquit comput multipl user work wide rang devic user interact collabor multipl heterogen devic time configur devic chang frequent due highli flexibl mobil natur work practic produc requir architectur softwar infrastructur architectur design meet requir test architectur basi implement softwar infrastructur ubiquit comput environ function synchron cooper interact room element integr inform technolog experi current implement present introduct ubiquit comput environ offer wide rang devic size shape situat tight collabor user work synchron inform share devic due heterogen natur ubiquit comput softwar infrastructur provid user interfac advantag properti enabl tight collabor user work diff rent devic share devic develop softwar architectur offer flexibl extens devic part ubiquit comput environ architectur creat softwar system call basic environ activ collabor hypermedia beach softwar infrastructur environ support synchron collabor devic offer user interfac fit devic peter marriag summer peter requir form interact synchron collabor beach build share document access multipl interact devic concurr requir softwar infrastructur ubiquit comput environ support synchron collabor point relat work base architectur present set implement architectur show paper close overview experi idea futur work requir softwar infrastructur softwar infrastructur ubiquit comput environ multipl heterogen devic addit requir compar collabor softwar run distribut standard pc section explain requir organ interact devic form interact collabor user support wide rang devic integr devic environ support task hardwar configur give concret descript compon room element integr inform technolog compon mention develop context project similar environ meet context applic scenario interact devic ubiquit comput varieti interact devic compar desktop pc equip devic form support style aim provid requir form interact import softwar infrastructur open style interact extens futur develop current oper system platform offer direct support interact techniqu softwar infrastructur ubiquit comput environ integr devic driver interact style requir introduct interact model pen input dispatch singl point displai affect wide area speech gestur requir process level higher level influenc recognit step made lower awar ambigu type abstract defin easili map invoc function pen event type concept adequ interact techniqu hardwar button found offer similar function compar softwar button widget interact model kind event trigger directli devic driver flexibl map softwar function requir adapt visual due interact devic ubiquit comput displai broad rang size orient differ size devic scale select object user overview part document edit devic harder similar interfac devic interfac metaphor concept problem interact tabl orient output necessarili common user work user surfac posit tradit user simpli rotat sheet paper show interact user view object orient object prefer orient requir output analog input techniqu output devic visual displai found ubiquit comput environ rang output ambient displai visual common interfac provid low level describ visual approach idea separ model abstract physic ui depend output devic gener physic user interfac automat gener element interact model common interfac underli function collabor user support devic characterist properti ubiquit comput environ presenc collabor commun user devic requir interact ubiquit comput user access comput user leav interact chair walk larg public present surfac give present softwar detect quickli chang assign current user devic give user access privat instanc prepar materi present continu scenario bring case user give present access devic parallel public displai view privat annot addit electron devic simultan inform displai devic context influenc result view level privat relat adapt visual context defin devic contrast usag devic exampl devic digit concurr digit pc literatur pda access addit inform function wast space main displai public pda privat inform function relev user devic show inform offer function requir collabor devic situat complic case multipl user work standard method share edit wysiwi requir collabor user coupl workspac size devic cover displai size small larg fig interact remot document displai privat workspac access softwar tightli coupl compon view ensur user fit current work mode user work share workspac user overview workspac content zoom view work locat directli front user overview overview displai shrunk navig requir devic devic interact tabl wall offer challeng peopl devic interact simultan singl devic call singl displai groupwar addit multipl user displai collabor multipl user displai lead relat collabor user devic softwar run devic receiv event recogn input track concurr event sequenc exampl event sequenc draw stroke drag window technic user interfac design interact multipl user integr devic environ import area requir integr devic softwar work environ work context requir context awar softwar awar context act depend state surround environ common exampl context current locat devic specif user kind devic softwar applic run physic contextu inform current task project influenc behavior softwar softwar infrastructur maintain current context updat interfac sensor collect context inform context mechan exist inform applic similar input data collect sensor preprocess order gener inform layer abstract applic requir physic interact configur physic object meet room strongli depend current work mode made object trigger action softwar reflect adapt made user set due current collabor mode case state chang softwar essenti maintain consist part world small interact tabl assembl quickli yield larger homogen interact area desir support flexibl split subgroup softwar capabl dynam size format visual interact reflect possibl conceptu design user interfac support task interview studi carri found creativ team recur task softwar offer dedic select set extens meet futur requir gener function function common wide rang applic scenario function reusabl requir tailor function import exampl typic group task support creativ meet project task manag provid tailor modul concept capabl extend gener function chang exist code modul requir captur access inform recur task gain access gener inform ubiquit comput lot inform captur automat addit gener manual captur access dedic support hardwar configur restrict hardwar place requir softwar requir devic user perceiv devic consist individu hardwar compon compon fig run separ pc due limit hardwar smart board recogn singl pen posit configur segment receiv pen input user support user simultan give user impress homogen interact segment coupl softwar enabl multipl user collabor visual interact area spite limit hardwar physic space requir dynam configur meet independ problem identifi solv parallel team divid set solv problem defin amount team form solut present scenario show kind collabor mode support ubiquit comput demand configur devic dynam meet reflect design flexibl give team freedom work effici architectur softwar infrastructur respect requir previou architectur develop offer flexibl support heterogen devic ensur extens futur devic section overview layer model discuss layer duti detail architectur overview order provid reusabl compon hand hook adapt devic architectur organ horizont layer defin level abstract orthogon architectur structur model separ basic concern layer modul layer gener layer model layer core layer interact model physic model model tool model document model space fig softwar architectur horizont organ layer defin level abstract vertic model separ basic concern crucial synchron collabor space provid core layer enabl distribut access object level abstract architectur organ layer defin level abstract modul layer specif modul provid tailor function distinct task extend function defin gener layer gener compon provid basic function teamwork meet situat top layer consist compon perceiv lower layer introduc structur applic ensur extens model layer specifi basic structur top layer defin interfac user physic interact style common abstract devic implement basic concern separ architectur core layer offer special infrastructur make implement higher layer easier share object crucial distribut access multipl comput basic model ensur clear separ model user physic environ distinguish interfac abstract class implement basic model defin model part core layer structur concept document model defin base class function object part document tool model describ element directli attach user provid addit function document tool control work mode coupl user interfac model defin altern user interfac concept suitabl devic devic requir user interfac element part space enabl user interfac element distribut comput physic model relev part world top layer defin physic model interact devic object monitor adapt dynam sensor recogn support style interact interact model specifi interact style defin term describ part softwar describ user interfac conceptu level defin user physic model implement share object give user devic possibl access object interact model object local machin client adapt interact style local physic environ interact capabl exampl section connect interact model object architectur constraint mechan extens discuss model model basic separ concern aim model layer provid implement basic model basi implement higher layer import ensur extens gener compon modul interact model defin layer concept separ handl input output model layer base class view code updat view dispatch event specif control beach adapt version concept section document model separ domain model call domain applic model domain model repres entiti domain world applic model describ applic aspect present manipul domain object domain model includ string describ text text attribut font size applic model add edit state cursor posit select share edit state abil provid displai cursor user specifi coupl part edit state share user privat valu workspac applic model instanc rotat workspac user work interact tabl req properti tightli coupl gener gener collabor support import goal softwar system provid gener compon situat task illustr gener compon exampl beach elabor section basi document creat beach hypermedia data model gener document element includ input link basic object constitut inform workspac structur inform tool realiz gener layer beach toolbar document browser document browser special role defin connect user interfac part document shown offer possibl navig document workspac main element user interfac beach segment overlai complet visual interact area compon partit defin space document browser resid front segment background posit freeli similar window popular oper system toolbar smaller tool hand user time import part physic environ configur compon refer comput run beach client combin station composit compon current set share shown figur compon consist station station displai displai station belong compon combin displai repres complet interact area complet area fig displai ad remov displai view show immedi adjust size area due depend physic model view station displai fig displai area combin displai station homogen interact area provid adequ interact tradit interact extend support gestur written pen support audio output implement gener gestur event handl pen stroke drawn gestur recogn check similar set support gestur shape gestur event gener dispatch contrast refer specif gestur event stroke cross bound multipl view object dispatch gestur event implement capabl select control modul tailor support task gener element provid beach situat task specif support architectur modul modul add model element extend function exist compon provid hook core layer add toolbar modul plug beach chang exist code beach modul support creativ team collect idea brainstorm session idea gener session collect pda transfer public compon meet core special infrastructur aim core layer provid function make develop higher level conveni includ synchron access distribut automat updat depend event view devic sensor modul servic interfac focu main interest scope paper space order provid comput support synchron collabor platform distribut access share object section discuss properti groupwar framework highlight import featur softwar infrastructur ubiquit comput environ beach replic compon connect wireless network low bandwidth mbp share connect client initi increment share object reduc commun server synchron replic share object ensur persist minim coordin object group atom element replic transact consist spite concurr object ubiquit comput environ highli import ensur fast user interfac avoid delai wait optimist transact offer speedup conflict action harmless automat updat depend detect share object initi arbitrari comput varieti import mechan provid trigger updat automat state share object declar descript view kind output depend view attribut share object calli detect trigger attribut chang attribut workspac set view workspac open view chang devic similar constraint system amulet work distribut set beach client beach client beach cooper support beach client beach client wireless network network interact beach client beach client beach server persist store fig beach client run compon server event handl devic provid interfac hardwar capabl handl multipl user time devic multipl devic driver send tag identif beach altern standard event support adapt user interfac compon equip event gener devic driver assembl higher level event intuit draw stroke pen click pen event combin stroke gestur event gener depend shape drawn pen circl kind event strategi event dispatch strategi event receiv control keyboard event dispatch view pen posit event directli discard effect event track concurr event concept extend tracker object receiv event view hierarchi dispatch mechan interactor beach capabl handl tracker time map input devic id event devic view transform view orient size depend current core model replac standard handl adapt version support transform transform object respond messag transform point graphic primit imag transform appli wrapper object insert view hierarchi view transform chang similar idea introduc portal intern camera jazz devic configur illustr architectur devic configur section exampl exampl experi implement develop base architectur beach softwar infrastructur comp built characterist determin focu beach compon support pen finger main medium input beach direct visual interact compon perman part fig network connect aim support synchron cpu impli beach small devic pda devic perman connect network exampl show element gener layer layer defin concret class implement gener support compon devic collabor larg public smaller privat devic shown case conjunct tabl demonstr devic multipl user view prefer exampl focu share leav interact model configur show relationship share model interact model connect present combin multipl comput interact devic mention consist comput req attach smart board physic model defin compon fig consist station displai combin larg displai area smart board lab mount wall softwar chang set dynam board mobil equip sensor connect displai area divid segment displai larg workspac document browser mention applic model defin edit state function workspac physic model ui model displai show part displai area tool model document model fig consist combin form homogen displai area complet area show larg workspac tight collabor devic connect previou interest tight collabor implement show displai area separ segment public privat workspac displai consist displai case fig split segment segment show document browser privat workspac connect document browser shown enabl tight share browser result coupl navig applic model edit state share provid awar inform size segment interact model shown figur provid mechan displai public workspac techniqu scroll zoom physic model ui model tool model document model connect public workspac privat workspac fig split displai area segment connect document browser shown show privat workspac multipl user collabor devic combin enabl collabor user interact aim support user devic horizont displai requir orient user orient displai realiz approach user open overlai freeli move displai similar window fig overlai document browser workspac applic connect workspac interact model open view show workspac user rotat workspac prefer rotat workspac applic model physic model ui model tool model document model interact rotat rotat fig user work interact workspac separ browser separ applic user workspac prefer orient current state experi implement beach base architectur show provid function softwar infrastructur exist compon beach implement smalltalk space coast framework chosen version framework dolphin system experi current version beach prototyp intern comput fair march give interact present explor visitor instal environ special version beach german occup safeti health exhibit dortmund open public visitor experi work work ambient beach intern extern present discuss design meet coast open sourc requir identifi interest influenc design softwar architectur support form interact event dispatch adequ strategi offer flexibl free develop task defin action trigger control event extend event dispatch mechan good basi support multipl person devic concurr implement cooper applic top coast framework success conflict detect handl concurr action updat multipl distribut view carri automat framework case network queu transact transmit connect restor multipl user continu chanc rollback due inconsist time adapt visual rang devic similar characterist factor call user interfac import note adapt chang dynam enabl depend mechan gener visual share object space provid coast consequ separ applic domain model kei interact composit compon model implement share object store client easili restart crash resum stop combin share object space depend mechan model dynam collabor devic integr contextu inform provid sensor flexibl sensor attach local connect arbitrari comput sensor part state monitor state trigger action possibl includ modul ad function beach offer special task futur work develop beach navig access creat integr audio output issu integr mobil devic connect server devic restrict cpu memori pda approach realiz connect pda provid interfac system asynchron work long group work nonoverlap part feasibl practic unconnect essenti deal inconsist solut automat creation version object chang connect latest inform beach found acknowledg author colleagu student ambient discuss support time consum implement work norbert richard thorsten improv paper refer al teach learn multimedia classroom project acm confer multimedia pp chart futur research ubiquit comput acm transact vol march pp gd softwar engin issu ubiquit comput intern confer softwar engin acm pp instrument interact model design user interfac acm confer human factor comput system acm pp al zoomabl graphic sketchpad explor altern interfac physic journal visual languag pp extens zoomabl user interfac graphic toolkit java user interfac softwar technolog acm press user interfac architectur share editor singl screen acm siggraph symposium user interfac softwar pp homepag integr inform applianc interact ieee pp gener icon intern confer interact pp pda share public make person inform public inform person person pp march elsevi architectur implement java packag multipl input devic tech report comput scienc colleg md tangibl seamless interfac peopl bit atom acm confer human factor comput system acm pp user interfac paradigm smalltalk journal object orient program pp manag interfac design humanoid acm confer human factor comput system pp für die mobil für comput bad pp abowd provid integr support ambigu interfac acm confer human factor comput system acm pp van tailor domain object meet tool electron whiteboard acm confer comput support cooper work acm pp commun exampl mobil compon chi summari suit real integr architectur inform audio enhanc collabor electron white board intern confer auditori displai finland implement architectur support groupwar technic report human comput interact school comput carnegi mellon pa al collabor multipl pda connect pc acm confer comput support cooper work acm pp al amulet model effect user interfac softwar develop ieee transact softwar pp hudson pausch futur user interfac softwar tool acm transact vol march pp al design audio aura acm confer human factor comput system acm pp user interfac support creativ teamwork environ diploma darmstadt technic depart comput scienc multipl devic approach support interact acm confer human factor comput system acm pp user cooper environ consist multipl digit devic cooper build integr organ architectur tional workshop cooper build februari lectur note comput scienc pp context aid develop applic acm confer human factor comput system acm pp design objectori synchron groupwar coast acm confer comput support cooper work acm pp model collabor share object intern acm confer support group novemb pp coast ein für synchron groupwar present germani smart technolog homepag wysiwi earli experi interfac acm transact inform system pp singl displai model present collabor human factor comput system acm pp al interact landscap creativ innov acm confer human factor comput system pp integr meet support local desktop environ cscw acm pp cooper integr design architectur space inform space al cooper build integr organ architectur intern workshop cooper build februari lectur note comput scienc pp für und der pp gener interact base integr design real virtual world carrol interact addison pp facilit explor interfac design altern humanoid model interfac design acm confer human factor comput system pp model groupwar support synchron collabor heterogen devic sep ieee cs press al dynam coupl displai flexibl creation share workspac user interfac softwar technolog nov acm press plastic user framework research agenda interact pp comput scienc issu ubiquit comput commun pp
Agents/684 1 dynam user model construct bayesian network intellig inform queri eugen santo jr dept comp sci eng connecticut ct scott brown air forc research laboratori crew system interfac div grace dept comp sci eng connecticut ct sheila bank martin calcul insight fl abstract complex current softwar applic overwhelm user exist intellig interfac agent address problem overwhelm human user interfac agent allevi user extract analyz relev provid inform abstract provid benefici assist user central provid assist user issu correctli determin user intent project build intellig natur languag queri inform manag system maintain dynam user model relev concept user inquiri relat inform sourc primari goal autonom react user intent inform dynam construct queri rel identifi discuss problem issu achiev ascript dynam user model construct bayesian network introduct goal interfac agent reduc inform overload collabor user perform task user behalf exampl interfac agent includ offic assist portfolio manag agent sycara al tutor coach agent al assist word present softwar horvitz al agent pedagog narrowli reduc user task load involv provid intellig assist user provid intellig assist perform task user behalf requir understand goal user motiv pursu action achiev goal term user intent denot action user intend perform pursuit term user intent ascript attribut action user pursu user intent ascript process determin action attribut specif goal goal interfac agent assist user pursu agent capabl ascrib user intent offer benefici assist accur user model consid effect ascript user intent user model concern repres user knowledg interact system adapt system user benefit util dynam user model system system adapt time specif user work realiz user model effect repres user knowledg intent system accur predict adapt system project build intellig natur languag queri inform manag system maintain dynam user model relev concept user inquiri relat inform sourc primari goal autonom react user intent inform dynam construct queri rel identifi discuss problem issu achiev ascript dynam user model construct bayesian network user intent ascript goal action ascrib user interfac agent design identifi salient characterist domain environ specif determin goal user reason pursu action achiev goal al approach base belief user intend environ result event stimuli occur environ goal obtain reaction event stimuli reason user perform action achiev goal pursu result stimuli term task intent level describ compon user model knowledg user goal murrai task level knowledg infer goal user pursu recogn intent underli user action result satisfactori interact result fail recogn pursuit goal versu achiev goal user perform action goal multipl action directli observ event environ precondit user pursu goal affect goal user pursu factor affect goal user pursu action user achiev goal human factor work affect user pursu goal perform action pursuit goal factor directli observ skill dynam user interact work load direct acycl graph show causal action action perform achiev goal action achiev goal goal present present relationship exist xor relationship repres case action goal advantag repres user intent goal repres direct acycl ffl goal abstract design detect higher level pursuit lower level goal ffl plan recognit made easier explicitli atom action goal al ffl natur languag explan action base predict goal easili gener structur core interfac agent architectur core interfac agent architectur multiag system interfac agent collect correct adapt agent architectur provid assist user accomplish maintain accur model user interact target system environ user model ascrib user intent task ascrib user intent deleg interfac agent compon continu adapt interfac agent user model task share interfac agent collect correct adapt agent user interact target typic direct manipul interfac interact menu button text type target system environ stimuli spell arriv commun cia architectur observ observ interfac agent infer user environ ascrib user intent plan recognit approach human unawar user intent ascript process base knowledg environ interfac agent possess user interact interfac agent determin goal highest expect util offer suggest user target system interfac agent determin user model begin bid process correct adapt agent correct adapt agent offer modifi interfac agent user model interfac agent correct adapt agent offer bid modifi user model target system observ stimuli user commun agent kqml messag pass api finin observ store agent evalu histori stack recent observ top observ agent evid bayesian user model evid essenti interfac agent past observ architectur support uniqu fade function observ type fade function support includ fade function relev fade function newest observ user model bayesian network user util user profil bayesian network user model captur causal relationship action util model util function attribut human addit util function combin util function util function captur user util interfac agent perform action user behalf achiev goal user profil captur knowledg user includ gener knowledg user typic static user defin offer assist autonom perform action user behalf obtain user determin interfac agent offer assist approach present base threshold statist probabl research base expect util function user profil valu static human factor spatial normal valu human factor determin chang user interact target system detail descript cia found al santo bank respond user natur languag inquiri form intellig queri potenti heterogen inform sourc maintain dynam user model relev concept user inquiri relat inform sourc user model determin relev concept order properli address user inquiri capabl proactiv retriev relev inform user base current inquiri user previou histori inquiri system architectur shown figur system consist main compon human languag interfac compon commerci voic recognit system natur languag parser voic recognit system transform spoken utter user natur languag sentenc natur languag sentenc predic logic user queri natur languag parser compon formula queri pass interfac agent utter wff result user model shown figur interfac agent process queri discuss queri pass retriev engin engin queri wff transform queri possibl dynam inform sourc queri retriev engin inform sourc present user homogen inform sourc result pass back interfac agent data visual result queri result interfac agent request produc part speech gener altern utter queri cia architectur kei function inform filter proactiv queri occur result ad context spoken queri occur result combin relev piec previou queri user system return knowledg unifi medic languag system librari wide knowledg sourc activ voic user nlp interfac agent retriev engin inform sourc human languag interfac fig system architectur tion deer tick user queri treat system repli inform user model inform concept user make inquiri interfac agent compon cia architectur retriev inform causat proactiv queri treatment cancer proactiv construct queri discuss section user model construct ascrib user interfac agent design identifi salient characterist domain environ specif determin goal user reason pursu action achiev goal figur user repres hierarch structur bayesian user model leav graph action rest node queri goal node construct proactiv queri base relev concept user interfac agent rank order featur cia architectur time slice cia architectur rank node user model user utter interfac agent correct adapt agent receiv notif queri ad user model wrapper agent correct adapt agent design proactiv gener queri base user current inquiri past inquiri concept rank order node compil nation institut health queri exist exist isa isa entiti action actor target fig user model spoken queri utter transform wff recent time correct adapt agent perform previou queri determin candid proactiv queri agent select queri expect util greater user autonom result proactiv queri expect util greater user autonom threshold approach insur interfac agent make queri autonom candid queri children queri consid proactiv queri chosen children process determin children process gener proactiv queri parent select proactiv child expect util ad normal node maximum expect util child select node discuss develop earli prototyp number issu arisen predict issu occur relev issu interfac agent user model cia architectur approach offer framework determin subqueri relev combin make proactiv queri behalf user expect util concept interfac agent combin subqueri high expect util approach agent combin concept method fashion situat inform highli specif user model construct method cia architectur begin domain knowledg increment construct user model user interact unanticip side benefit design mitig classic knowledg acquisit bottleneck problem feedback user integr part system user intent current approach posit altern queri result user cumbersom theori model captur user desir potenti lengthi trial error approach agent interact heterogen inform dynam interfac agent compon free autonom fetch reason present updat result user issu autonomi agent dynam inform sourc unlik current present possibl massiv inform sourc approach user model construct feasibl relev approach offer altern declar approach statist learn approach system attempt construct intellig natur languag queri inform manag system deal issu dynam user model accur user intent ascript approach larger inform process order bigger role interfac agent plai futur inform intens system refer bayesian model plan recognit larg domain user sixth intern springer wien york adapt intellig tutor autonom agent system concept featur intellig email agent intern confer autonom agent acm press santo explicit requir metric interfac agent user model correct intern confer autonom agent santo intellig interfac agent intellig environ aaai spring symposium intellig environ santo util user model intellig interfac agent twelfth canadian confer artifici intellig intellig interfac agent intellig user interfac york student model coach problem solv bayesian network user sixth intern springer wien york lumier bayesian user model infer goal softwar user fourteenth annual confer uncertainti artifici intellig san morgan kaufmann publish agent reflect bayesian method user model user sixth intern springer wien york agent reduc work inform overload commun acm evalu kqml agent commun languag intellig agent agent springer behavior variabl research symbol interact distribut intellig agent ieee expert human issu plan recognit interact phd royal institut technolog
IR/685 5 weight scheme multimedia inform retriev £ jame wang ý school inform scienc technolog pennsylvania state usa abstract approach popular research trend field multimedia retriev present region frequenc pictur frequenc measur develop unifi multimedia retriev system inform retriev system weight measur highest weight region occur small number imag region consid discrimin weight blend imag retriev techniqu text retriev techniqu web applic weight implement part simplic imag retriev system test imag experi shown techniqu effect discrimin imag semant similar approach enabl simpl queri interfac multimedia inform retriev system introduct imag retriev retriev relev imag imag base automat deriv featur effici imag retriev tremend applic area crime £ work support part nation scienc foundat grant endow foundat author jia li gio wiederhold demonstr provid ý wang depart comput scienc pennsylvania state research start wang depart informat comput scienc stanford þ du cisco du þ depart electr engin pennsylvania state usa web imag classif search imag search engin commerci ibm qbic earliest develop system addit system develop ibm tj watson nec research lab bell laboratori mit photobook earliest berkelei blobworld columbia visualseek webseek cmu informedia uiuc mar ucsb netra stanford stanford simplic recent system earlier imag retriev system color histogram color layout index content imag approach recent popular research trend retriev system attempt overcom defici color histogram color layout search repres imag retriev system appli imag segment imag correspond object decomposit ideal intend close percept human visual system retriev system includ netra system blobworld system queri system color region templat recent develop simplic integr match pictur simplic semant type classif integr region match scheme provid effici robust imag match imag match difficult problem inaccur segment measur develop li al stanford similar measur imag base region incorpor properti segment region inform imag fulli match perform similar approach reduc effect inaccur clarifi semant enabl simpl queri interfac imag retriev system experi shown compar effect robust exist retriev method figur visual similar impli semant similar view patholog slide outdoor photo visual similar photo semant similar photo figur visual similar impli semant similar view patholog slide patholog slide visual similar slide semant similar slide exist imag distanc discrimin power measur limit measur distanc imag base inform imag figur show pictur peopl larg area sky pictur similar pictur peopl small area sky background pictur librari outdoor peopl imag closer semant imag imag imag imag retriev system make distinct reli visual similar problem retriev imag figur show patholog slide base global visual imag closer imag find imag retriev system return imag closer imag present region frequenc pictur frequenc simpl weight measur develop enhanc discrimin effici base characterist entir pictur librari definit close definit term frequenc document frequenc weight highli effect techniqu document retriev combin effect varieti imag retriev applic weight measur unif imag retriev imag retriev remaind paper organ section similar measur base segment region defin section describ experi perform provid result conclud section similar measur focu similar measur develop briefli describ segment process relat notat section featur space analysi process section section give detail weight imag match scheme section describ combin scheme imag retriev imag retriev section region segment imag segment extrem difficult open problem comput vision attempt develop robust match metric reduc effect inaccur segment segment process system effici essenti fast statist cluster process block pixel segment simplic partit imag block ø ¢ ø pixel extract featur vector block algorithm cluster featur vector class class region segment imag featur segment averag color compon ø ¢ ø block repres energi high frequenc band wavelet transform squar root order moment wavelet coeffici high frequenc band color encod encod color inform color space good percept correl properti chose block size ø textur detail comput time æ denot total number imag imag denot obtain set featur vector region segment process featur vector repres domin visual featur color shape rough locat statist featur obtain region featur space analysi definit weight depend entir pictur process analyz characterist featur space featur vector featur space number region pictur librari ä æ goal featur cluster algorithm partit featur group centroid minim averag distanc featur vector group nearest centroid minim condit group featur vector partit cluster nearest centroid centroid cluster vector minim averag distanc featur vector cluster special case euclidean centroid vector featur vector cluster requir featur group process requir algorithm euclidean distanc algorithm result cluster boundari featur space ê cluster boundari space ê initi process stop criterion critic process initi algorithm adapt number cluster gradual stop criterion met start algorithm termin featur vector chang class prove algorithm base fact step assign vector nearest centroid comput cluster reduc averag class varianc run complet requir larg number iter cost iter ç stop criterion stop averag class varianc smaller threshold reduct class varianc smaller threshold weight weight consist region frequenc pictur frequenc region featur vector imag find closest group centroid list centroid comput featur analysi step find denot æ number pictur region featur closest centroid imag group defin æ æ pictur frequenc featur denot total number pixel imag imag pictur constant denot area percentag region imag defin region frequenc region pictur rf measur frequent region featur occur pictur assign weight region featur pictur weight imag defin £ definit close frequenc time document weight text retriev imag match comput weight ä region æ imag imag store weight imag match process defin similar measur set assum imag ê imag ê repres region set ê ê ö ò ö descriptor region denot distanc region ö written short comput similar measur region set ê ê ê comput distanc imag match scheme aim build correspond region consist percept robust segment region match region imag match ö assign credit credit import match determin similar imag matrix ë refer matrix distanc region set summat weight match ê distanc integr region match distanc defin combin distanc weight process matrix ë natur issu constraint put admiss match yield good similar measur properti expect admiss match properti enforc fulfil comput imag ê imag ê requir ñ ò fulfil constraint ensur region plai role measur similar algorithm combin multimedia retriev multimedia web page document imag text combin metric gener framework match multimedia document distanc imag ê imag ê comput ê ê ê text distanc imag convent text retriev method experi weight implement compar version simplic imag retriev system test system imag includ store jpeg format size ¢ ¢ conduct fair pictur featur retriev process speed pentium iii pc linux oper requir approxim hour comput featur vector color imag size ¢ imag segment imag comput featur region fast index provid capabl handl queri sketch queri match speed fast queri imag cpu time averag sort imag similar measur queri extra cpu time spent process queri accuraci imag categor conduct extens evalu system experi base subset corel form imag pictur categori food imag categori retriev imag consid match categori queri assumpt reason categori chosen depict distinct semant topic imag test retriev rank rest imag record comput retriev imag queri recal retriev imag comput proport special case total number semant relat imag queri fix carri similar evalu test color histogram match color space match metric similar emd extract color histogram featur match categor imag color bin averag fill color bin evalu call fill color bin color histogram system color histogram system figur show perform compar simplic system color match system perform system imag categori perform color histogram system color histogram system due detail color separ obtain fill bin color histogram system slow imposs obtain match larger simplic run speed faster color histogram system search accuraci slower color histogram system perform system close origin system area percentag segment region constraint system return result individu queri design semant imag suit applic imag futur work region frequenc pictur frequenc weight measur design combin multimedia retriev system inform retriev system weight measur implement part metric simplic imag retriev system test techniqu demonstr high effici robust evalu method special imag larg multimedia document refer system imag index proc int conf visual inform wm june ten lectur capit citi queri imag journal intellig inform integr artifici intellig vol pp juli inform commun vol pp cluster appli vol pp ak rm textur pattern vol pp classif document imag wavelet coeffici ieee tran imag vol pp septemb imag classif hierarch model hidden markov ieee tran inform vol pp august integr region match imag proc acm multimedia lo toolbox navig larg imag proc ieee int conf imag pp ts queri imag proc ieee int conf multimedia comput pp canada june averag categori id figur compar color histogram method averag ô color histogram averag fill color bin color histogram averag fill color bin imag simplic partit imag averag region world wide web imag retriev world wide vol pp similar retriev algorithm imag proc qbic queri imag content proc pp san tool manipul imag proc vol pp san februari similar pattern larg imag proc ieee vol pp earth imag proc arpa imag understand pp introduct modern inform cut imag proc ieee conf comput vision pattern pp san puerto imag video search engin proc vol pp classif queri composit region journal vol pp academ improv access digit pp multiresolut segment imag low depth ieee tran pattern analysi machin vol short version integr match pictur ieee tran pattern analysi machin vol imag index search intern journal digit vol pp
Agents/686 1 design implement mobil agent platform antonio vita istituto di informatica di catania vial catania itali abstract recent develop telecommun network contribut success applic inform retriev electron servic advantag commun distribut system emerg technolog mobil agent interest mobil agent applic move network carri task behalf user work present platform map agent develop manag mobil agent languag develop platform carri agent java platform user basic tool creat applic base agent enabl reactiv local stop make commun migrat mobil distribut network manag introduct develop telecommun contribut success distribut observ comput longer consid devic access commun part global environ local remot resourc share develop telecommun network encourag develop servic access remot electron gener applic advantag commun distribut environ develop mobil agent interest mobil agent softwar modul move network order carri task user word agent entiti act behalf user run specif commun user launch environ main aspect contribut success agent abil oper autonom abil migrat agent applic carri task creat move node network order obtain inform speak mobil agent carri state time set valu variabl insid agent agent system develop base languag wide produc environ academ research commerci agent system telescript gener develop languag develop environ agent java favour design creation platform agent mobil agent system develop java aglet odyssei gener voyag system produc research mole refer work review platform main featur common system includ agent server creat environ execut agent server suppli basic servic agent agent system move server carri part state work present map agent platform develop manag mobil complet develop java platform user basic tool creation applic base agent enabl reactiv local stop make commun migrat java independ hw sw enabl develop platform oper heterogen environ java equip mechan facilit dynam execut part code download network remot node agent move node part state mechan object serial present latest version java develop kit rest paper organ section make comparison tradit techniqu distribut comput program paradigm base mobil examin advantag introduc section describ architectur kei concept design describ manag mechan system section present note implement system applic distribut network manag present section section present futur work direct develop platform creat mobil code paradigm versu tradit distribut comput tradit distribut comput base paradigm mechan paradigm base rpc procedur mechan extend tradit procedur enabl process comput call procedur commun channel client applic server process channel client send request includ paramet procedur call send result back client client server procedur access argument return result interact client server requir messag mean connect open interact code procedur execut machin run altern tradit mechan recent base environ give sort term possibl chang dynam bind softwar compon applic physic locat network comput research code mobil total possibl appli mechan distribut environ wide interest level mobil consid make distinct code mobil agent mobil paradigm includ mechan remot execut code demand case remot code transfer remot run result return node code transfer inform includ code run paramet node code run defin start oper program remot mechan activ execut applic model lead tree process structur case code client code run requir specif softwar modul remot server java applet common type technolog code transfer activ agent mobil possibl transfer softwar modul start execut agent start execut stop move machin continu execut agent move time unlik mechan code mobil start execut remot longer move level agent mobil distinguish literatur strong migrat weak migrat agent execut consist code content variabl stack strong migrat highest level compon state captur transfer destin state restor agent continu execut exact point stop featur power interest programm point system implement complet strong migrat work heterogen agent system adopt state move architectur oper difficult carri system implement strong migrat carri homogen environ specif creat agent system deal oper reveal common oper agent system call weak execut state transfer mean reach node continu execut point start state variabl transfer scheme programm save inform correct restart execut variabl part data state examin agent reach node restart execut correctli agent unlik system migrat process migrat load balanc agent migrat programm oper prepar migrat agent load programm balanc fact state inform transfer smaller case strong migrat approach carri distribut advantag tradit solut develop distribut interact compon gener consid depend locat fix programm implement phase distribut object system corba locat compon hidden servic requir environ distinct interact object resid host object host phase exist locat resourc locat report hide interact softwar compon greatli depend mutual locat lead unforeseen problem perform reliabl applic scheme base agent resourc strictli connect machin agent move site agent fix resourc oper requir gener traffic local commun typic case concern applic client retriev data server oper complex filter oper move agent procedur deal data concern client reduct commun cost perman connect client server site continu oper commun result client connect network mobil agent field applic requir mobil applic run exist technolog mobil agent contribut build distribut applic simpli time area technolog give posit ffl inform mobil agent effect tool retriev inform distribut agent user queri migrat inform agent oper research give user inform ffl electron electron commerc increasingli develop area mobil agent user research product meet search conveni ffl mobil mobil agent effect tool mobil user access network resourc notwithstand band limit due present wireless technolog user submit request run request enabl user obtain result moment user remain log wait enabl exploit fix calcul resourc avoid mobil calcul power oper autonomi limit ffl distribut mobil agent enabl deleg manag function central station remot reduc workload central improv exploit band ffl distribut possibl pilot node mobil agent paradigm parallel calcul distribut network workstat ffl collabor grow area mobil agent effect support share data kind give flexibl architectur enabl user work share network resourc mobil agent platform section introduc agent system map develop implement map platform develop manag mobil agent primit refer architectur map basic consist agent move node server constitut environ agent run architectur map shown fig constitu part point agent daemon agent agent instanc instanc context server network classload messag figur map architectur node belong platform map consist object call server entiti oper platform host identifi dn address host tcp port number server listen accept agent messag network map web server server main object map entiti daemon context local agent instanc presenc server node belong platform map activ enabl node accept agent network activ agent local daemon daemon entiti map listen wait agent node messag deliv local agent messag agent travel serial form time stream arriv daemon creat specif entiti call task instanc serial agent messag pass task make run send receiv agent context context basic object map server agent present save user function manag put method enabl creat make server code suspend deactiv resum kill context agent run specif server possibl obtain inform agent run server remot server context element map manag commun agent place synchron asynchron agent resid map server map server object network serial pass instanc instanc object context initi give refer start updat list local agent object context make deliv receiv check agent avail receiv actual presenc server platform map enabl agent run specif map class present exchang object class defin local order class stream data creat instanc object load object instanc refer automat instanc class agent messag refer present search list map server fix context class load remot site save cach memori manag access agent server intern entiti dynam context platform instanc object time request class local remot tabl context class platform save import featur platform map possibl make agent migrat send messag network server class object refer present order permit time specif object reach daemon load instanc object deal load class interrog remot site save vector context updat search class requir find load remot site save local tabl access agent present server agent structur agent repres entiti platform map move network carri task assign user creat agent ffl suspend suspend agent mean stop execut refer agent ffl resum suspend wake agent mean resum execut point suspend ffl deactiv deactiv deactiv agent mean stop download agent disk serial delet refer ffl reactiv mean deseri agent deactiv give refer back restart execut ffl creat creat agent mean instanc agent object set make ffl kill mean stop execut delet refer cancel entri list agent ffl migrat migrat agent mean move start execut ffl commun synchron asynchron implement point agent object obtain instanc class deriv agent class suppli platform enabl agent advantag method put class manag platform platform map enabl user advantag graphic interfac fig permit easier manag agent map server graphic interfac show window agent run local inform ffl identifi agent ffl class agent ffl current state select agent oper button present upper toolbar button make agent run specif map necessarili map class agent absent figur explain featur user activ map user interfac machin make agent run node map server activ class implement figur map user interfac agent desir case url node make run class implement agent resid node user agent run node map server activ user sourc url figur platform present enabl paradigm base remot evalu code demand map server map server map server map user interfac execut figur run agent machin button server enabl obtain inform map server activ agent execut server window divid show list activ map server system select column show agent select server state column class select server agent move node user add server list button add server figur list map server architectur implement note section describ main function platform map implement detail describ fundament design issu implement serial mechan agent load class network commun issu agent describ basic mechan provid map implement implement languag fundament featur system possibl agent move run architectur choic environ develop platform import design implement phase tradit compil languag conveni gener suitabl heterogen environ compil effort requir carri platform code move node network dynam link code modul languag suitabl develop mobil agent interpret script run provid interpret instal script languag belong categori give power flexibl requir develop complet effect platform chose java develop architectur java multithread portabl success possibl build small applic integr web execut client machin browser potenti java higher simpl main characterist make good languag develop platform mobil ffl modular develop code user write agent limit start class provid ffl portabl number ffl presenc mechan dynam load class sourc dynam link current ffl possibl serial object enabl transfer agent migrat platform implement weak migrat reli mechan object serial present version java object serial mechan enabl repres object stream byte variabl object store serial refer object previou section point main reason strong migrat implement heterogen environ case transfer restor execut state problem java interpret part execut state includ state captur state practic imposs chang interpret modif lead loss fundament featur agent system agent serial stream byte obtain destin node network stream execut agent restart store state load class network serial code class object belong refer store system class arriv advantag featur possibl load class dynam runtim sourc task load class execut agent class present search node list configur startup platform updat inform brought agent mechan permit exploit network transfer bytecod class occur requir case migrat instanc transfer transfer necessarili departur node agent mechan dynam load class present paradigm code demand remot execut integr platform mechan chang behavior class load node design integr paradigm mobil suitabl specif work environ commun agent abil agent commun agent basic characterist system commun mechan map commun agent place exchang messag synchron asynchron solut mechan base flexibl enabl implement scheme commun synchron agent platform basic mechan advanc scheme commun implement primit suppli encod messag place migrat agent mechan select transfer messag object order permit send complex object agent case synchron obtain behavior similar rpc agent sender invok give messag identifi agent wait repli messag case asynchron agent sender invok primit send continu execut detail mechan section basic mechan inform agent obtain inform agent instanc node recal method give list identifi agent local server list inform element list consist refer identifi agent introduc attribut search find agent platform agent deactiv case refer agent set class short owner boolean agent suspend creation agent creation agent carri method context class url coupl consist host listen map server class found url map server agent run sourc url destin url url local map server class search local directori agent global cach run sourc url local url destin url agent instanc local migrat destin url sourc url system call launch automat migrat sourc url reach recal method local sourc url home destin url previou graphic interfac method context recal press button run enabl paramet agent platform map enabl suspend execut agent resum point suspend agent suspend recal primit suspend search agent suspend list agent primit find stop method suspend agent updat state point agent suspend suspend act resum agent primit resum enabl wake agent continu execut exact point stop method resum search agent interest stop search wake thread execut agent updat state resum agent act deactiv agent agent deactiv method deactiv deactiv agent mean download disk serial form cancel refer entri agent list method deactiv work method suspend reactiv agent method activ enabl reactiv agent deactiv method similar method case agent load stream run begin refer agent cancel deactiv adequ reassign kill agent continu execut kill method stop execut cancel entri delet refer agent migrat agent import aspect platform enabl applic deriv class agent migrat network mechan migrat agent implement primit context agent user recal context check agent migrat node context find serial send stop thread delet entri vector agent agent reach daemon receiv node instanc instanc read stream recal method instanc agent case agent migrat deactiv entiti act commun synchron agent commun agent place messag pass travel serial form receiv stream distinguish agent messag boolean insert begin true agent messag case read boolean stream enabl make distinct synchron asynchron messag request class exchang messag agent manag context case asynchron agent recal method sendmessag context belong pass messag identifi receiv agent paramet context check receiv agent local local context insert messag queue messag agent receiv agent extract time messag queue agent context send messag remot platform address messag messag insert queue receiv agent method case synchron agent method context mechan previou case differ sender case agent wait repli messag receiv agent receiv agent manag messag method applic network manag section show map platform successfulli network overcom limit typic central approach current network manag system adopt central paradigm protocol requir manag applic period access data collect set softwar modul locat network devic larg number circumst adopt distribut paradigm assign part control manag function network node basic idea logic data produc network devic period transfer central network manag station manag applic encapsul port network perform seri oper local reduc workload network manag station overhead network reason spread network devic equip increasingli power local resourc reach high manag outperform refer model paradigm basic compon current network manag system ffl manag station manag station ffl number run modul call monitor collect data ffl manag transfer manag inform agent manag station execut manag applic monitor control network element termin server access manag collect manag store manag inform base set correl object defin mib subset standard osi notat abstract syntax notat defin structur manag inform internet simpl network manag protocol standard protocol network manag network manag protocol provid primit exchang inform manag station set snmp primit simpl offer type oper control set oper set read variabl oper examin variabl mib simpl structur commun request variabl store mib perform manag action local data central paradigm adopt snmp network manag rapid size network pose question scalabl central model calcul power network node make distribut function central gener applic distribut control frequent poll mib variabl requir small amount inform classic monitor view mib variabl statu router statu link entail queri view small number mib variabl central manag suitabl extrem applic requir frequent poll larg number mib perform calcul vast amount inform calcul function indic level function requir frequent detect variat larg number mib variabl case monitor control perform close devic question map distribut manag function model resid static migrat dynam execut node involv oper order map network manag addit modul develop assum platform integr current manag node standard snmp agent monitor node data record set class implement snmp commun protocol class local remot snmp agent class present manag applic construct implement agent system obtain easi introduc manag function specif suffici develop agent readi execut node belong map applic network manag base vast amount data relat data suitabl combin give system administr inform function network form order evalu effect approach valid support manag made system simpl applic calcul function literatur health function implement gener term health function refer linear aggreg number manag measur devic snmp environ function typic linear combin mib variabl rate exchang variabl function effici integr network manag model snmp flexibl decentr requir implement examin approach base mib aim function calcul foreseen static priori aim insert kind function devic monitor function condit function suitabl devic limit period function function present node execut continu map execut function directli meet main requir compress amount data process directli sourc approach function process avoid collect vast amount mib variabl complet function repres total number byte receiv nomin speed interfac time interfac start work function repres measur averag util network interfac calcul interv measur time interv minim instantan util interfac monitor function network system administr gain pictur traffic gener node specif node remain threshold long period presenc congest network analyz administr understand phenomenon action function consid applic clear complet manag applic requir complet set function kind compar classic approach approach gener natur depend function approach base calcul manag function perform continu poll mib variabl involv traffic gener station ffl repres number mib variabl present function ffl repres averag length byte snmp packet valu mib variabl requir ffl variabl sampl depend type function tradeoff valu calcul avoid satur network excess frequent poll observ measur shown valu involv express typic fall ffl ffl ffl worst case network traffic refer singl station singl manag neglig extrem valu rare examin frequent valu magnitud function monitor station traffic gener manag messag significantli high node averag traffic due manag process approach elimin agent applic transfer remot actual calcul perform local commun central control station interact agent remot node agent manag station occur specif situat function calcul exce threshold long period time notif messag manag immedi examin store order creat histor file network event traffic gener approach due transfer agent code node execut size code applic implement bytecod transfer kbyte small size code fact transfer made function execut remot node cost term util comput resourc network consequ remot execut manag function map server activ platform node execut background daemon resourc consum sleep period memori activ receiv agent messag deliv local execut agent measur process involv platform tabl refer sun sparcstat solari oper system column cpu percentag system memori resid set size fourth total size process size map server map agent typic applic tabl calcul resourc process applic execut cpu workload fluctuat peak reach size memori grow type high compar common applic subsequ applic node execut applic execut thread process mean subsequ applic requir execut interpret reduc amount calcul resourc consum futur work work present design implement platform develop mobil agent discuss main design issu mobil commun gave implement detail languag develop program java chosen featur portabl dynam possibl dynam load class show function platform implement fulli distribut network manag servic comparison classic central approach provid tion creat manag agent distribut system easili creat suspend run remot check state agent remot server work equip map adequ mechan secur access control context agent requir servic agent map pass context access system check singl action agent agent owner list author resourc agent set standard author limit agent action endang integr system unauthor access remot inform refer lf mb distribut comput autonom object ieee august levi mobil emerald system acm transact comput februari agent mobil comput ieee person octob dm cg kershenbaum mobil good technic report ibm tj watson research march gp vigna design distribut applic mobil code paradigm proc int conf softwar engin case al simpl network manag protocol rfc etzioni weld interfac internet commun juli etzioni ds weld intellig agent forecast ieee august kqml inform knowledg exchang protocol int conf inform knowledg manag novemb genesereth ketchpel softwar agent commun juli goldszmidt distribut system manag ifip intern symposium integr network gosl java languag white paper technic sun vigna mobil code paradigm case studi int workshop mobil agent april goldszmidt distribut manag deleg proc intern confer distribut comput decentr control intellig network manag proc intern symposium integr network hamilton java shift comput ieee august van schneider introduct distribut system technic report cornel june java mobil agent ieee internet juli ww li dg comput java septemb db lang oshima program mobil agent java java aglet api technic ibm tokyo research gener magic agent gener magic odyssei sun microsystem java object serial specif rose manag inform base network manag rfc intellig emerg technolog gener telecommun san march objectspac voyag core technic overview vita distribut network manag architectur intern confer comput scienc march marshal rose network manag framework ifip intern symposium integr network hohl mole java base mobil agent system ecoop workshop mobil object juli jw dk gifford remot evalu acm transact program languag octob java execut content ieee june tj essenti system integr distribut object john wilei agent public domain agent technolog ap je white telescript foundat electron marketplac technic gener white mobil agent white paper technic gener octob infrastructur collabor mobil agent int workshop mobil agent april distribut comput ieee page june kendal note distribut comput technic report sun microsystem novemb
Agents/687 1 java framework distribut mobil applic bettini de nicola rosario dipartimento di sistemi di itali tel fax abstract highli distribut network common infrastructur kind distribut applic kei design principl network abil deal dynam network environ comput call program languag exploit mobil paradigm basic interact mechan paper present architectur java framework distribut applic code mobil explain implement code mobil reli java show distribut applic exploit mobil code program code distribut network languag middlewar tupl java introduct introduct highli distribut network common infrastructur applic network facil access remot resourc servic internet world wide web contribut make network connect con ned research laboratori larg programm user deal kind distribut applic kei design principl network abil deal dynam network environ mean applic awar physic site locat fact remot oper time cross move locat comput call program languag paradigm support applic model interact client server mobil softwar remot site execut advoc basic paradigm support program literatur term mobil denot di erent rang simpl suppli abil download code execut sophist support migrat entir comput mobil agent softwar object data code autonom migrat remot comput execut automat special case mobil code paper present base distribut applic code mobil interact place multipl distribut tupl space java chosen implement languag framework suppli mean program distribut applic mobil code java introduct suppli architectur portabl class librari network tool dynam class load customiz secur mechan top implement tupl space base coordin model program model suitabl program permit full space uncoupl commun object requir singl oper tupl space approach call method requir interfac oper suppli remot object linda asynchron commun model permit time make tupl life time independ produc process life destin creator tupl requir futur destin tupl messag select associ mean pattern structur messag rest paper organ section present basic concept architectur java packag section focu featur speci calli relat code mobil section show exampl implement section describ simpli ed gather exploit mobil agent retriev inform remot section present sort load balanc system dynam redistribut mobil code section describ simpl chat system section draw comment relat work basic concept architectur basic concept architectur describ detail packag brie illustr basic concept reli linguist abstract framework inspir languag agent interact languag speci calli design program distribut system made compon interact multipl tupl space mobil code stand reli concept tupl space tupl space multiset sequenc inform item handl multipl distribut tupl space node net node access local singl tupl space process execut process activ comput execut concurr node di erent exchang commun rst class data process perform basic oper tupl space tupl tupl send process execut creat node tupl retriev tupl tupl mechan rest present class packag detail notion class class special inherit method overrid class tupl tupl inform item call eld kind tupl actual eld identi formal eld basic concept architectur class tupl includ method handl creat ad element element tupl creat pass vector tupl tupl vector tupl rst creat empti tupl ad element method make tupl construct limit number overload constructor public object public object object creat tupl simpli tupl express formal class object creat tupl formal eld type string actual eld type integ write tupl tupl note pass class object actual rst deriv class class tupl anonym select tupl tupl basic concept architectur tupl match number eld eld match valu formal eld match type actual eld match ident formal variabl formal eld eld match implement method match class tupl match tupl paramet check match current tupl previou tupl match tupl test call method boolean method match perform bind bound formal eld retriev method object start string interfac handl tupl eld declar start end public interfac extend public boolean public void updat public boolean method match algorithm speci calli test tupl eld updat formal eld actual equal test actual eld match basic concept architectur semant method speci ed class implement interfac packag make wrapper class standard data type implement assum object class implement creat default constructor formal method inconsist formal declar formal declar tupl tupl true notic retriev formal valu automat updat mean method type method match string tupl space class includ method place tupl retriev tupl tupl space method public boolean tupl public boolean tupl public void tupl correspond basic oper tupl space evalu tupl match tupl match tupl remov tupl space valu basic concept architectur assign formal eld oper termin match tupl oper suspend di er match tupl remov tupl space add tupl result evalu tupl space method class implement oper tupl space public boolean read tupl public boolean tupl act read block process match tupl found simpli return variant search match tupl tupl space block instanc test tupl present tupl space version linda introduc call inp object ts formal formal tupl withdraw rst tupl read due network latenc network commun retriev inform requir time wait absenc tupl block process execut oper put upper bound wait version block method basic concept architectur public boolean tupl long timeout throw public boolean tupl long timeout throw speci ed timeout expir oper except thrown handl block local distinguish kind physic local identi er node uniqu identi ed logic local symbol node reserv logic process refer execut node physic local absolut mean logic local rel mean depend node interpret thought network resourc class handl local abstract class local base class class deriv base class variabl repres local declar local polymorph extens physic local ip simpli node object regist net object addit abstract level node independ ip address ip address net server implement real ip address url object local relat class implement interfac local tupl basic concept architectur node class node implement execut engin process node object singl tupl space export method access tupl space method redirect oper method tupl space node local node pass method public void tupl local public boolean tupl local public boolean tupl local process explicitli address tupl space oper execut mean tupl result form evalu tupl tupl space locat class node includ method public void local loc throw public local throw correspond basic spawn process execut node creat node net return physic local node consid node access node creator commun node local node alloc sort partial function map logic local physic local alloc environ node associ physic local node environ node speci ed method void string node class class basic concept architectur repres physic local node net alloc environ close process exchang commun tupl express comput logic local translat physic evalu process impli substitut closur process environ node evalu di erenc add closur tupl space locat eval send execut mean evalu logic case static scope case dynam scope node object log net exact ip address port physic case local part net server regist node worth note node machin long node refer di erent physic physic local internet address node commun mean messag deliv stream class implement messag exchang system structur content messag serializ public class implement public sourc loc sender public dest loc target public string send process public int oper op code public object content content basic concept architectur process class abstract class special creat process deriv class implement method execut declar abstract public void throw method invok process execut run process execut make execut environ er method access tupl method transpar call homonym method class node order make program overload version method necessarili creat eld put creat explicitli net class net implement server manag net net object track physic local node part net multithread server coordin node enabl commun registri server net server net part node log net server physic uniqu identifi node address net net object receiv login request thread spawn handl connect net server tabl refer proxi node net care regist node net execut basic concept architectur node physic local node part check local exist thread commun node node net enter nite loop wait messag node handl deliveri node messag form commun place node send messag inspect messag destin eld net server refer receiv node dash line figur repres messag insert messag queue destin node destin care deliv messag node manag scenario commun place net server direct connect permit mean ag class node net server ip address node accept direct establish direct connect case messag deliv receiv node directli note case network restrict access remot node permit net server applet open network connect comput download comput net server applet code mobil mess mess mess node node node bs net figur inter node commun node applet part net code mobil process messag execut destin java unknown make code execut remot basic algorithm collect inform class process dispatch java class remot comput receiv process request server send process follow rst approach compli mobil agent agent bring inform applet applet code mobil tion choic advantag simplifi handl disconnect oper agent owner stai connect send agent connect check agent termin remot host class process class binari class code object process code user de ned class code java common applic avoid load class belong java sourc class access privileg node accept remot process secur node accept remot process custom class loader suppli packag process receiv node add class binari data class loader tabl process class code class loader code local local tabl class binari data user de ned class retriev mean class introspect ection api dispatch process remot procedur call collect class process data object return pass except thrown interfac implement base class class procedur implement method class present list simpli ed form notic procedur call code mobil mutual depend handl check class class inspect detail avoid error extend error place remot site hard java ection api unabl inspect local variabl method impli process class declar variabl class collect algorithm process execut method remot thrown class ad collect explicitli limit due speci implement java ection easili cope programm awar problem class byte code gather rst server process pack process object notic process written arrai byte eld type packet receiv remot site read process deseri error peculiar class class packet byte code process class read packet store class loader tabl receiv process read byte process class class loader tabl node receiv lling class loader simpli deseri explicit instanti point class store class loader link code mobil protect void class null jj return field eld constructor method int eld length eld protect void class class length list method collect class process code mobil protect boolean class string classnam classnam classnam classnam return true return nal protect boolean string classnam boolean result result jj jj jj base type jj return result list method collect class process byte code class migrat process retriev method class loader shown list server process rst byte code retriev local le process remot site remot byte code class obtain class loader tabl node send receiv similar page mechan oper rst class loader tabl lled code class remot process class class loader load class code tabl due secur java permit dynam inspect byte code make imposs save execut state permit weak mobil mobil agent migrat start code mobil execut begin mobil mobil agent automat resum execut point remark support agent code code made remot local mean local code retriev mean execut local note code evalu remot site section avoid spawn process execut charg put code execut code procedur download code net execut machin secur code execut danger oper malici due program tamper process system cope implement activ process download net remot node execut oper critic system resourc implement secur mechan reli java secur model type system express forc polici control access resourc data progress exist mobil agent system implement strong mobil telescript agent tcl ara system mole aglet system base java implement weak mobil detail descript form mobil found exampl exampl section present simpl realist exampl reli mobil distribut rst gather exploit mobil agent retriev inform remot load balanc system dynam redistribut mobil code simpli ed chat system gather section show program gather reli mobil agent retriev inform remot site borrow assum data distribut node net node inform search local node visit net implement report list agent timeout test presenc tupl found local node visit retriev instanc agent remot spawn mean eval inform agent commun result owner termin depict figur notic spawn process remot suce invok eval underli system care serial process network code class valu eld screenshot show agent visit node nding item exampl class extend protect protect item protect local public local item public void throw item catch local eval list implement gather applic ng ng ng figur gather gather exampl screenshot gather agent visit node load balanc remot client send process execut server node distribut receiv process group processor determin bucket credit pattern enter processor send number server number correspond processor avail perform comput behalf server store number credit processor highest number credit credit number server exhaust case wait noti ed credit arriv processor receiv immedi start execut process parallel send credit back server local implement code fragment list show process processor node care receiv process execut pattern base heurist processor send credit send immedi exampl client client client server processor processor processor processor figur load balanc system process simpli wait tupl form formal obtain creat brand mean spawn receiv process execut current site credit server mean receiv process deliv receiv process shown list tabl processor pass constructor process updat concurr process shown receiv tupl form processor node local process comput method shown case credit processor block execut credit arriv point main structur applic repres permit process share distribut environ process packag class execut remot site screenshot show exampl class extend public void throw execut credit execut eval credit list class extend protect hashtabl processor public hashtabl tab processor tab public void throw execut local loc true tupl loc loc list exampl screenshot chat system chat system present section simpli ed implement basic featur common real chat system extend implement deal mobil show implement distribut applic commun distribut locat tupl space system consist client enter chat log net regist chat server server track regist client client send server deliv messag connect client messag privat deliv client list speci ed messag class deriv class node rede ne method call node perform shown list rst eld tupl handl server command client enter chat leav send messag exampl list peopl remain eld depend content rst eld tupl di erent format implicitli discard advantag approach respect altern base dynam creation handler process implement reaction presenc speci tupl public void messag instanceof tupl tupl instanceof command list rede nition method class deriv abstract class implement method execut enter continu tupl messag client server displai messag user graphic interfac user enter messag graphic interfac send messag chat shown list screenshot show remark server client reliev detail send retriev messag tupl oper suppli exampl public void throw regist regist frame regist return true messag show messag show person messag messag enter messag list method execut implement class exampl public void string string client client length int client length list send messag server screenshot node present framework implement distribut applic exploit mobil code run heterogen network environ framework inspir program architectur gener exploit implement system deal distribut applic mobil code packag line extend linda coordin paradigm multipl distribut tupl space underli model enabl space time uncoupl destin associ anonym commun program model suitabl distribut mobil mobil code suppli mean move process code execut remot site interest approach base formal properti system formal establish modal logic studi system automat prove system properti develop system program languag obtain extend kernel languag program construct variabl oper sequenti iter process composit line includ compil translat program java class structur framework illustr figur number extens made origin comput model model enrich order transform underli model packag java program java program program compil compil java applic java interpret figur framework permit model structur node connect made explicit plan implement featur futur relat work number java system librari implement function program distribut mobil base linda commun model coordin toolkit java coordin commun distribut object achiev share implement tupl space remot access objectspac achiev complet ip address port local abstract privat objectspac dynam creat class repres tupl similar code mobil suppli aim provid coordin kernel implement complex internet languag architectur mar coordin tool mobil de ne tupl space programm react access agent mechan control access speci tupl obtain dynam creat privat tupl space type system present jini connect technolog enabl devic plug form commun network scalabl human devic de ne servic devic commun driver download jini develop top javaspac framework commun javaspac introduc extens linda origin event noti process regist interest futur occurr event receiv commun event block oper timeout presenc tupl tupl noti cation grant period time mean includ process sleep period time tupl tupl space javaspac transact program mean dedic repres transact life separ privat tupl space tupl instanc class deriv common base class xed con gurat eld tupl instanc class tupl xed con built scratch method class tupl ad eld javaspac tupl match instanc class tupl match eld instanc class match mechan object object subtyp appli check eld match javaspac permit match subtyp featur easili ad match reli java time type decid add exact match enforc stronger form data exact class eld code order match check weaken javaspac due possibl match entri null refer accept system speci calli orient mobil javaspac aim provid distribut persist object exchang mechan code written java ibm space network middlewar packag suppli tupl network commun implement java reli portabl space basic messag fact client view space messag center messag space extend linda notion exact type pattern match algorithm notion subtyp dbm implement mean process listen request sql pass tupl mobil code implement mobil class basic class migrat code mobil ecienc problem move code due class mobil requir di erent design speed kei concept ner grain mobil obtain deriv class class repres singl mobil explain section lime exploit multipl tupl space paradigm coordin mobil agent add mobil tupl process privat tupl space transient share tupl space bound node node process object class data member process object move object share merg automat extens java support mobil refer includ mean monitor avail qualiti demand continu monitor easili perform standard advantag implement synchron asynchron monitor implement strong mobil modifi java virtual save restor execut state solut desir advantag portabl platform run modi ed version jvm order agent prefer includ strong mobil implement top mean precompil phase featur present system abil react event insert tupl program mean process wait implement reaction due select process wait tupl approach shown chat system sucient special method react instanc special react presenc tupl tupl space spawn procedur handl special avoid tupl remov tupl possibl transform oper read node react event happen site refer saltz languag mobil program vitek tschudin page refer telecommun system pattern vlissid pattern languag program design page javaspac pattern practic java program languag wollrath jini speci cation bettini de nicola translat strong mobil weak mobil proc ieee int conf mobil agent de interact mobil agent ciancarini proc int ieee workshop enabl infrastructur collabor page ieee comput societi structur net proc acm sac special track coordin languag volum page acm model node connect dynam evolv network proc int workshop concurr volum refer infrastructur languag open net proc acm sac special track coordin languag thread state java system proc technolog languag system zambonelli reactiv tupl space mobil agent coordin rothermel hohl page cardelli mobil comput vitek tschudin page carriero gelernt write parallel guid perplex acm comput vigna design distribut applic mobil code paradigm proc int conf softwar engin page acm ciancarini rossi coordin commun java agent vitek tschudin page vigna analyz mobil code languag vitek tschudin de kernel languag agent interact mobil ieee transact softwar de type speci cation access polici vitek secur internet secur issu refer distribut mobil number page de type access control theoret comput de nicola modal logic proc algebra methodolog softwar int conf number page space ibm system page august gelernt gener commun linda acm transact program languag gelernt multipl tupl space linda volum page gong insid java platform api implement kershenbaum mobil good research report ibm research yee migrat agent reness taught mobil agent process migrat edit collect refer lang oshima program deploi java mobil agent aglet levi ousterhout safe tcl toolkit electron meet place usenix proc usenix workshop electron page usenix park person disconnect oper mobil agent proc workshop person wireless architectur ara platform mobil agent rothermel proc intern workshop mobil agent number page picco lightweight flexibl mobil code toolkit rothermel hohl page roman linda meet mobil proc st int confer softwar engin page acm saltz mobil program proc usenix annual technic page rothermel editor proc int workshop mobil number lnc hohl mole java base mobil agent system proc ecoop workshop mobil object refer program languag mobil code technic report renn march acm comput septemb vitek editor mobil object system programm number lnc white mobil agent softwar agent aaai press mit
DB/688 3 optim larg join queri mediat system chen jeffrei hector depart comput scienc stanford abstract data integr queri pose mediat translat sequenc queri underli data sourc heterogen sourc limit queri translat feasibl studi problem find feasibl effici queri plan mediat system conjunct queri mediat model sourc capabl adorn simpl cost model major cost mediat involv send queri sourc answer back develop algorithm sourc queri sequenc base simpl greedi strategi base partit scheme algorithm produc optim plan show linear bound worst case perform miss optim plan algorithm gener optim plan bound margin miss optim plan report result experi studi perform algorithm introduct integr system base mediat architectur provid user seamless access data heterogen sourc exampl system tsimmi inform manifold garlic disco mediat defin integr view base data provid sourc translat user queri integr view sourc queri postprocess oper sourc queri result translat process challeng integr larg number heterogen sourc import challeng integr system deal capabl sourc answer queri problem due heterogen sourc rang simpl file system relat problem address paper gener effici mediat queri plan respect limit capabl data sourc focu attent kind queri mediat larg join queri effici algorithm find good plan queri cost model cost queri process mediat system domin cost interact sourc focu cost issu queri sourc result state simpl cost model count total number sourc queri plan cost spite simplic cost optim problem deal remain show extend main result complex cost model charg fix cost queri variabl cost proport amount data transfer plan gener mediat user pose conjunct queri integr view provid mediat queri translat conjunct queri sourc view arriv logic queri plan logic plan deal content descript sourc mediat sourc provid relev data postprocess oper perform data logic plan translat physic plan detail order sourc contact exact queri goal paper develop algorithm translat mediat logic plan feasibl exce sourc physic plan illustr process translat logic plan physic plan sourc provid inform mediat integr sourc content bind studio titl titl titl mediat column attribut sourc queri provid titl studio user titl movi produc paramount gregori star mediat translat queri logic logic plan state inform mediat obtain sourc postprocess inform mediat join result sourc queri titl attribut physic plan correspond logic plan join order join plan feasibl physic plan logic ffl plan send queri send queri send queri join result sourc queri titl attribut return titl valu user ffl plan titl movi produc paramount sourc return titl send queri year check send queri star movi set star return user ffl plan plan similar queri titl paramount star star send queri year movi year return titl user physic feasibl queri sourc provid bind titl plan feasibl plan effici plan mediat execut plan illustr solv logic plan descript sourc find feasibl physic plan logic plan central problem determin evalu order logic plan attribut appropri bound feasibl physic pick effici relat work problem order subgoal find feasibl sequenc view problem assign infinit cost sequenc find join order problem extens studi solut solut perform exhaust scale interest internet scenario sourc scheme solut reduc search space techniqu simul random heurist approach gener effici plan perform term qualiti plan gener plan gener arbitrarili optim techniqu fail gener feasibl user queri feasibl plan remain solut specif cost model clever techniqu exploit produc optim join order effici solut good problem cost model hard adopt context difficulti clear model feasibl mediat queri plan framework direct applic algorithm problem studi end gener feasibl plan exist difficulti cost model main cost mediat optim algorithm hold solut simpl cost model major cost mediat queri relev data sourc cost develop algorithm find good feasibl plan rapidli algorithm run number subgoal logic plan provid linear bound margin algorithm miss optim plan algorithm optim plan scenario bound optim plan algorithm find feasibl user queri feasibl plan show experi algorithm excel run time profil varieti find optim plan combin scalabl algorithm gener provabl good plan achiev approach paper organ paper organ section introduc cost model notat present effici algorithm chain section prove bound section describ call discuss abil find optim feasibl plan result perform analysi algorithm report section section discuss main result paper extend cost model introduc section preliminari introduc notat paper discuss cost model optim algorithm sourc relat logic plan sm sourc integr system simplifi assum sourc provid data form relat sourc data wrapper creat simpl relat view data sourc assum provid singl relat sourc multipl model framework set logic physic sourc show sourc provid relat queri sourc specifi atom valu subset sourc relat attribut obtain set tupl sourc support set access templat relat bind adorn requir sourc queri sourc access bf sourc bf fb bf adorn pattern distinguish bound free argument posit techniqu develop paper emploi solv problem mediat queri plan sourc capabl descript languag user queri mediat conjunct queri integr view provid mediat integr view defin set conjunct queri sourc relat user queri translat logic set conjunct queri sourc relat answer user queri union result set conjunct queri show user queri conjunct queri movi translat conjunct queri sourc relat order find feasibl plan user assum mediat process logic plan conjunct queri time reduc problem find feasibl plan user queri problem find feasibl plan conjunct queri logic plan assum loss gener logic plan singl conjunct queri sourc relat logic plan call subgoal subgoal specifi queri sourc relat bind subset attribut sourc relat refer attribut subgoal logic plan variabl logic plan subgoal bound bind relat sourc queri sequenc subgoal defin sequenc bind relat schema set variabl bound logic singl denot bind logic plan schema union schema schema sourc relat instanc join sourc relat defin term sourc relat answer conjunct queri defin project oper order comput bind relat evalu wai send queri sourc bind subset perform join result sourc queri mediat obtain send set queri sourc relat bind subset union result sourc perform join union relat obtain call kind sourc queri block queri kind queri answer method singl sourc answer method sourc queri main reason queri answer subgoal logic plan block queri access templat sourc relat requir bind variabl logic plan order answer queri execut subgoal collect bind requir paramet plan space space plan user queri defin sequenc subgoal logic plan decid choic queri subgoal set block queri queri call plan space feasibl queri answer sourc note number feasibl physic number logic plan exponenti number subgoal logic plan note space plan similar space execut join queri state miss feasibl plan execut theorem miss feasibl plan execut subgoal feasibl execut logic plan base bushi tree construct feasibl execut base tree subgoal construct tree leaf order bushi tree feasibl plan base bushi tree subgoal deriv feasibl plan tree construct subgoal answer block queri answer block queri answer queri answer queri note execut cumul bind variabl subgoal left subgoal observ similar assumpt conclud bushi tree subgoal feasibl find feasibl plan execut formal cost model cost model defin cost subgoal feasibl plan number sourc queri answer subgoal cost feasibl plan sum cost subgoal plan develop main result paper simpl cost model present section show extend result complex cost model note simpl cost model count number sourc problem find optim feasibl plan hard theorem problem find feasibl plan minimum number sourc queri reduc vertex cover problem problem vertex cover problem problem graph vertic vn construct logic plan vertex defin relat connect edg includ attribut ij defin special attribut special relat total number edg special attribut schema relat special relat attribut ij attribut attribut relat tupl attribut relat includ tupl attribut relat singl access bind rn requir attribut requir attribut bound logic plan consist variabl bound obviou construct logic plan time polynomi size show vertex cover size logic plan feasibl physic plan requir sourc queri vertex cover size loss physic plan answer subgoal block answer rn queri feasibl plan bind bound bind variabl vertex answer singl sourc answer sourc queri rn answer sourc queri total sourc queri plan vertex cover size feasibl plan sourc queri feasibl plan sourc queri relat subgoal answer block queri logic plan bind subgoal answer queri set subgoal answer answer size set subgoal attribut union schema subgoal entir attribut set vertic subgoal form vertex cover subgoal sourc rest subgoal rn sourc queri find vertex cover size vertex cover size feasibl plan sourc queri reduc problem find minimum vertex cover graph problem find feasibl plan minimum sourc queri recal space plan includ execut set subgoal turn cost safe miss optim restrict attent plan base execut set subgoal theorem miss optim plan execut logic plan base bushi tree subgoal proof similar theorem physic plan base bushi tree construct physic plan base tree subgoal leaf good subgoal answer block queri answer block queri plan subgoal cost plan subgoal answer queri answer queri plan note cumul bind relat reduc number distinct valu paramet subgoal cost subgoal plan equal plan plan base construct tree cheap plan base bushi tree tree miss optim plan subgoal sequenc physic plan extend notion cost feasibl physic plan sequenc subgoal logic plan sequenc associ set physic plan make choic sourc queri queri subgoal sequenc subgoal feasibl feasibl plan set physic plan sequenc cost sequenc subgoal cost cheapest physic plan sequenc cost subgoal sequenc cost subgoal physic plan sequenc sequenc subgoal satisfi interest properti state lemma lemma sequenc ascertain feasibl number subgoal lemma sequenc find cost number subgoal lemma sequenc find physic plan sequenc number subgoal lemma postpon process answer subgoal sequenc make lemma postpon process answer subgoal sequenc cost problem statement problem address paper find feasibl physic plan logic plan note sequenc easili comput plan sequenc easi sequenc subgoal refer problem find sequenc subgoal algorithm section section find sequenc subgoal translat physic plan chain algorithm present chain algorithm find feasibl queri plan algorithm base greedi strategi build singl sequenc subgoal feasibl effici describ algorithm formal analyz complex abil gener feasibl plan chain algorithm logic plan subgoal bound variabl feasibl physic plan ffl fc subgoal logic set bound variabl logic plan oe start empti sequenc ffl construct sequenc oe subgoal find cheapest subgoal answer cost subgoal sequenc answer declar feasibl plan feasibl plan add subgoal plan ffl return feasibl construct plan sequenc figur algorithm chain algorithm shown figur essenti idea chain chain find subgoal answer initi bind logic pick cost comput addit variabl bound due chosen subgoal repeat process find answer pick cheapest updat set bound subgoal left subgoal left answer subgoal left chain declar feasibl plan output plan construct feasibl plan gener lemma logic plan feasibl physic chain fail gener feasibl plan chain fail gener feasibl left subgoal logic plan initi bind variabl subgoal suffici bf bf tabl proof lemma data sourc feasibl physic plan logic plan subgoal feasibl physic plan left subgoal chain subgoal subgoal feasibl plan accumul sequenc built chain gave subgoal deem answer chain left subgoal feasibl physic plan exist complex chain lemma chain run time number subgoal logic plan iter chain iter add subgoal plan construct iter time examin subgoal find cheapest answer subgoal chain total time optim plan gener chain lemma result user queri number subgoal logic plan chain find optim plan chain find optim plan consist lone subgoal execut block execut block queri cost plan chosen chain cost optim plan feasibl sequenc chain end optim plan lemma chain miss optim plan number subgoal logic plan greater construct logic plan subgoal instanc result chain gener suboptim plan logic plan instanc shown tabl logic plan chain gener total cost assum find cost subgoal partial sequenc time observ cheaper feasibl plan total cost chain miss optim plan case difficult find situat chain miss optim plan linear upper bound plan optim prove stronger result lemma lemma plan gener chain logic plan optim cost subgoal max cm cm cm cm cm figur proof lemma loss sequenc subgoal cn shown figur subgoal prefix chain subgoal answer impli cost equal cost process subgoal remain answer lemma cost process lemma chain chosen subgoal conclud cost greater cost end process note cost cost cost subgoal equal cost call pivot defin pivot subgoal defin subsequ subgoal cost subgoal equal cost continu find rest pivot subsequ base cm jg cm theorem chain plan gener chain time optim number subgoal lemma observ cost cost plan gener chain arbitrarili close cost optim plan multipli number subgoal linear bound optim chain tight situat chain yield optim plan plan cost close optim plan section studi qualiti plan gener chain wide rang scenario partit algorithm present algorithm call partit find feasibl plan partit approach solv plan gener problem gener optim plan scenario chain run time formal present partit algorithm discuss abil gener feasibl plan end describ variat partit specif target gener optim plan effici plan gener process partit partit organ subgoal cluster base capabl sourc perform local optim build feasibl plan merg subplan cluster shown figur partit phase phase organ set subgoal logic plan list cluster properti satisfi cluster subgoal cluster answer block subgoal subsequ cluster answer queri attribut bind subgoal earlier cluster partit find subplan cluster subgoal combin subplan arriv feasibl plan user queri describ algorithm detail denot list cluster set subgoal empti subgoal logic plan smaller subgoal remov denot cluster gener round ad feasibl subgoal denot cumul set bound variabl process find cluster set variabl bound logic plan partit find set subgoal answer collect subgoal answer stage ad cluster ad bound variabl subgoal ad subgoal feasibl put cluster process repeat case subgoal left end complet list cluster subgoal left cluster form case partit declar feasibl sequenc logic plan case algorithm logic plan subgoal bound variabl feasibl physic plan ffl fc set subgoal logic plan set bound variabl logic plan oe start empti list ffl phase construct list cluster oe subgoal answer fc fc declar feasibl plan add cluster list cluster variabl subgoal ffl phase construct sequenc subgoal oe start empti sequenc cluster subsequ subgoal jj ffl return feasibl construct plan sequenc figur algorithm partit partit perform phase gener feasibl plan cluster algorithm perform local optim permut subgoal combin local subplan creat global plan user queri logic plan assum attribut queri bound sourc relat answer ff bf bf bf subgoal refer predic subgoal phase partit answer cluster subgoal variabl bound subgoal put cluster variabl subgoal feasibl subgoal cluster cluster gener partit fug partit consid feasibl subsequ pick lower plan output partit partit consid feasibl plan gener lemma feasibl physic plan exist logic partit find feasibl plan partit fail find feasibl subgoal logic plan answer respect set variabl initi bound occur subgoal feasibl physic subgoal logic plan partit fail find feasibl plan feasibl plan exist lemma number cluster gener result queri partit find optim plan proce simpl case analysi case case cluster partit find sequenc permut subgoal subgoal logic partit find sequenc case cluster optim feasibl plan show transform plan plan space partit good subgoal answer block answer queri answer block make chang modifi result queri cost subgoal answer block queri modifi replac queri block queri cost block queri modif cost plan subgoal repeat transform plan subgoal answer block queri appli transform respect subgoal subgoal answer block queri move begin arriv plan move subgoal ahead subgoal preserv feasibl plan lemma true transform cost plan chang cost cost subgoal sequenc lemma plan good optim plan note plan space plan gener partit plan found partit good optim plan lemma number subgoal logic plan exce result queri partit find optim plan number subgoal logic plan exce number cluster gener lemma prove number cluster partit find optim plan show case cluster subgoal partit find optim plan loss cluster gener fc fc fc feasibl sequenc subgoal partit output true partit gener optim plan case construct logic plan subgoal lead algorithm gener suboptim plan note partit miss optim plan margin unbound queri paramet lemma exist logic plan partit gener plan time optim plan tabl sourc shown tabl partit essenti consid cost cost cost cost cost plan cost cost cost cost cost plan partit pick plan final physic plan cost notic subgoal feasibl answer tupl dont answer subgoal base defin cost cost cost cost total cost partit miss plan ratio cost partit plan optim cost make ratio arbitrarili larg number tupl partit gener plan time optim ff bf bf bf tabl proof lemma data sourc lemma partit algorithm run number subgoal logic number cluster found partit number subgoal cluster phase partit time gener cluster round phase round time cluster partit permut subgoal time total run time partit variat partit partit algorithm miss optim plan worst case run time exponenti number subgoal logic plan attempt strike balanc run time abil find optim plan naiv algorithm sequenc subgoal find optim longer partit partit cut run abil find optim plan extent variat partit highlight call variat filter variat base observ lemma filter find optim plan long queri result run time partit effici naiv algorithm plan filter phase partit mimic partit arriv cluster end cluster cluster cluster end phase filter ident partit lemma user queri nonempti filter gener optim plan prove lemma prove lemma lemma run time filter queri result partit sequenc cluster queri result filter sequenc cluster filter time gener cluster addit time merg cluster cluster subgoal subgoal filter permut subgoal permut subgoal total run time filter variat partit call scan variat effici plan gener main idea simplifi phase partit run effici penalti scan gener optim plan case partit scan phase process phase ident partit scan pick order cluster search order lead phase run time note search space subsequ scan gener plan inferior partit lemma scan run number subgoal logic plan phase scan phase partit phase time run time complex scan perform analysi address question perform chain chain partit find optim miss optim expect margin attempt answer question perform analysi algorithm simul environ simul paramet test bed particip integr view user queri pose sourc size distribut medium larg sourc test bed access requir attribut bound emploi randomli gener user queri creat logic plan subset sourc test bed vari subset size comput plan gener chain algorithm partit algorithm exhaust search optim plan queri cost plan comput base model section result experi number subgoal logic plan gener user studi perform algorithm queri figur plot number queri subgoal number subgoal chain partit figur averag cost number subgoal chain partit fraction plan number subgoal partit chain worst case miss figur optim algorithm horizont averag margin gener plan miss optim plan vertic chain partit found plan entir rang input total randomli gener miss optim plan figur show averag cost plan didnt necessarili bit realiz subgoal logic plan mean chanc subgoal low cost subgoal conduct experi measur fraction queri algorithm found optim maximum margin algorithm miss optim plan result experi shown figur figur show chain partit found optim plan entir set queri rang chain found optim plan partit found optim plan time result prove section logic plan subgoal lead chain miss optim logic plan subgoal lead partit suboptim plan figur show largest margin chain partit miss optim plan worst chain gener plan time optim worst case miss partit plan time optim plan result theoret result predict chain gener plan cost time optim plan prove partit miss optim plan margin experi show partit algorithm excel practic theoret chain algorithm good theoret prove section compar observ partit consist outperform chain find plan cost model discuss algorithm minim number sourc queri complex cost model sourc queri cost simpl extens cost queri sourc queri sourc cost amount note charg amount data transfer strictli gener model discuss section result present hold model theorem cost model theorem hold chain algorithm number subgoal theorem cost model lemma hold partit algorithm find optim cluster user queri nonempti result complex cost model data transfer cost factor cost queri sourc queri note cost model strictli gener theorem cost model theorem hold chain algorithm number subgoal theorem cost model lemma hold partit algorithm optim cluster cost model complex present section note problem find optim feasibl plan remain clear chain partit gener feasibl plan irrespect cost model consid issu hand abil algorithm gener optim plan observ chain hold cost model cost subgoal plan postpon process time plan properti chain model note partit algorithm cluster find optim plan queri nonempti block queri cost queri properti model model consid cost model discuss properti note hold model chain partit yield good result properti strategi emploi algorithm act good heurist gener effici plan cost model partit gener optim plan cluster simul experi studi perform partit cost model found continu find plan close optim consid problem queri plan heterogen data integr system base mediat approach emploi cost model main cost mediat system cost develop algorithm gener feasibl plan show problem hand algorithm run polynomi time gener optim plan case case linear bound worst case margin miss optim plan algorithm find optim plan bound margin miss optim plan bad scenario analyz perform algorithm simul experi extend result complex cost model refer yao optim algorithm distribut queri ieee tran softwar queri process system distribut acm tran widom tsimmi integr heterogen inform sourc moerkott complex gener optim process tree cross product icdt stonebrak analysi distribut strategi vldb kersten random join order select vldb johnson comput guid theori npcomplet san el yang optim queri data sourc vldb vassalo wrapper tsimmi system sigmod optim nest order comput join acm tran kang random algorithm optim larg join queri sigmod wong queri optim simul anneal sigmod zaniolo optim queri vldb ordil queri heterogen inform sourc sourc descript vldb capabl base mediat tsimmi sigmod morri algorithm order subgoal acm lohman measur complex join queri optim vldb combinatori algorithm complex haa queri rewrit mediat system pdi kersten complex join vldb moerkott complex gener optim plan cross product pod access path select distribut manag system read system edit stonebrak kemper heurist random optim join order problem vldb swami optim larg join combin heurist combinatori techniqu sigmod gupta optim larg join queri sigmod valduriez scale heterogen design disco int conf distribut comput ullman principl volum ii comput scienc rockvil md vardi complex order subgoal acm maier rapid bushi optim cartesian product sigmod papakonstantin describ queri capabl heterogen sourc vldb wiederhold mediat architectur futur inform system ieee
ML/689 6 compar evalu strategi larg distribut data set andrea prodromidi stolfo columbia comput scienc ny usa abstract interest recent approach scale machin learn system larg distribut data set studi approach base parallel applic multipl learn program distribut stage combin multipl model principl fashion empir determin data partit scheme select data set subset evalu compar stack stack correspond analysi combin classif model train subset seek find wai scale larg data set maintain improv predict perform measur error cost spread multipl correspond data partit email address contact phone number contact electron postscript email research support detect program darpa nsf support part ibm fellowship introduct induct learn classif techniqu appli problem area good success field machin learn made substanti progress past empir challeng develop induct learn techniqu scale larg possibl physic distribut data set current gener learn algorithm complex requir data resid main memori realist problem mean address problem appli induct learn program distribut subset data parallel integr result classif model classifi principl fashion boost predict accuraci approach serial code learn multipl site process write parallel program learn process small subset data fit main memori data reduct object work examin evalu approach combin subset classif model learn separ form data subset describ combin method stack class combin combin stack correspond compar predict perform scalabl experi perform actual credit card data provid institut learn train predict model detect fraudul transact partit data small neg impact perform final classif model empir studi chan stolfo compar robust vote number data partit size separ train set show train set size factor predict perform combin method studi caution data partit mean improv neg impact size train set small part work empir determin guidelin scheme partit select data set subset larg system resourc small yield inferior classif model exhaust experi combin appli larg real world data find specif definit strategi work case time scalabl machin learn remain art remark stack good demonstr properli engin system scale consist outperform singl learn algorithm remaind paper organ section present overview combin method studi section introduc credit card fraud detect problem evalu criteria section describ experi partit data set section detail experi compar perform combin approach integr classifi section summar result conclud paper model combin techniqu method examin aim improv scalabl execut number learn process number data subset parallel combin collect result learn call base comput base model underli data subset train set separ integr independ comput base classifi higher level classif model detail combin introduc notat denot base classifi comput sampl train data number class instanc classif ck predict classif base separ valid set size gener predict base classifi vote vote denot simplest method combin predict multipl classifi simplest call plural major classif model contribut singl vote collect predict decid major class vote final predict weight classifi vari influenc collect predict rel predict accuraci model specif weight determin perform cost valid set final predict decid sum weight vote class highest aggreg binari classif classifi weight cast vote class vote class aggreg threshold distinguish class weight vote method classifi unlabel instanc randomli approach extend classif problem map problem binari classif problem associ class separ classifi instanc gener confid indic prospect classifi versu classifi final class select correspond highest confid weight set perform respect select evalu classifi separ valid set weight major wm determin weight classifi weight wrong classifi collect predict stack main vote stack combin base classifi fashion combin call meta integr independ comput base classifi higher level call meta learn train set train set base classifi predict valid set attribut true class target learn characterist perform base classifi comput model data set classifi unlabel base classifi present predict make final classif approach includ arbit strategi variat combin emploi judg predict select particip classifi reach consensu arbit deriv learn algorithm learn arbitr predict gener base classifi combin strategi adopt polici train set approach merz correspond analysi nearest algorithm combin multipl model mean improv classif perform combin task integr independ comput base classifi fashion train set base classifi predict valid set attribut true class target predict correct class repres form emploi correspond analysi princip compon geometr explor relationship valid model predict true class map true class label predict classifi scale space cluster similar predict behavior nearest neighbor learn algorithm appli space transform predict individu classifi classifi unlabel map space assign class label closest class point sophist combin method seek geometr uncov posit classifi rel true class label reli singular decomposit techniqu comput scale space captur space number exampl number train set matrix row column column assign classifi column correct class classifi column assign rest column base classifi time complex set qualiti classifi depend includ learn learn task qualiti quantiti train set provid factor discuss section topic section studi emploi induct learn cart ripper implement naiv bayesian learn algorithm successor cart tree base ripper rule induct algorithm obtain larg chase union member servic technolog record sampl credit card transact data span year septemb schema develop year experi continu analysi bank personnel captur import inform fraud detect record fix length byte numer categor attribut includ binari class label reveal detail schema chase bank data consist fraud legitim union data consist versu distribut learn task comput classifi correctli discern fraudul legitim transact evalu compar perform comput model combin strategi adopt spread true cost model fit credit card detect problem accuraci express abil give correct denot abil catch fraudul transact minim cost model captur perform classifi respect goal target applic loss due spread inform simpl metric perform classifi compar replac defin famili curv roc metric complet analysi roc space credit card compani fix overhead serv threshold challeng credit card transact transact amount author transact automat transact predict fraudul requir referr fee author personnel decid final disposit cost typic call accur predict identifi fraudul amt produc loss calcul save classifi contribut due stop fraudul cost model predict transact author transact investig transact save amt save data partit size train set constitut factor perform train classifi qualiti comput model improv size train set size train set limit main memori constraint time complex learn algorithm determin good data partit scheme credit card data set appli learn algorithm train set vari size object comput base classifi good perform amount time construct train set vari start exampl exampl credit card data set spread save report figur averag base classifi experi top row correspond classifi train chase data set bottom row union data set train set larger exampl larg fit main memori mhz pc capac run solari train base classifi exampl size train file averag accuraci chase classifi cart ripper size train file averag spread chase classifi cart ripper size train file averag save chase classifi cart ripper size train file averag accuraci union classifi cart ripper size train file averag spread union classifi cart ripper size train file averag save union classifi cart ripper figur accuraci save chase union classifi function size train set requir cpu hour prevent experi larger set learn algorithm perform evalu metric train set size notabl exampl includ algorithm comput good tree union data bad tree chase naiv gener classifi spread cost model chase perform respect accuraci ripper algorithm rank perform graph show larger train set result classif verifi catlett result pertain neg impact sampl accuraci learn algorithm show perform curv indic reduc benefit data learn amount train data point necessarili provid perform improv justifi addit system resourc learn larger data set relat oat jensen find amount train data build classif model result linear size model improv accuraci empir evid suggest cient train train classifi base curv data learn turn point li exampl predict perform improv decid partit credit card data set record scheme correspond partit transact data month evalu strategi comput base classifi step involv train base classifi distribut data set data site site store appli learn algorithm subset creat classifi classifi data data site import base classifi test data classifi evalu subset figur present averag result chase union credit card left plot show center plot depict spread plot displai save base classifi cost model repres base vertic bar correspond singl model set bar denot bayesian set bar denot classifi bar adjac group bar correspond specif subset train classifi bar left plot top row figur repres accuraci bayesian classifi train data bar repres accuraci bayesian classifi train data subset bar base classifi averag accuraci chase base classifi cart ripper base classifi averag tp fp spread chase base classifi cart ripper base classifi averag save chase base classifi cart ripper base classifi averag accuraci union base classifi cart ripper dec oct mar aug jan jun nov apr sep feb jul dec base classifi averag tp fp spread union base classifi cart ripper dec oct mar aug jan jun nov apr sep feb jul dec base classifi averag save union base classifi cart ripper figur fraud accuraci spread save chase union data plot group adjac repres accuraci classifi train subset maximum achiev save perfect respect cost chase union data set learn algorithm suitabl problem evalu metric naiv chase data metric accuraci naiv classifi chase problem naiv union train set similar natur learn algorithm perform union data set chase data set note fewer fraudul transact union data higher baselin accuraci classifi success tabl perform chase union algorithm accuraci save accuraci save major weight cart ripper detect fraudul transact combin separ learn classifi strategi hope gener improv fraud detect capabl combin base classifi site popul classif combin base classifi site local data subset valid set subset test avoid base classifi ensur classifi predict train data appli method vote strategi stack strategi learn algorithm site base classifi set experi correspond cross valid fold execut parallel perform result averag site report tabl base strategi outperform rest case identifi ripper accur perform spread cost model result categori depict unexpect outcom experi inferior perform weight vote strategi respect spread cost model stack disadvantag combin method train classifi distinguish fraudul transact direct approach maxim save tradit learn algorithm unawar adopt cost model actual design reduc misclassif error accur classifi necessarili cost demonstr figur bayesian base classifi accur ripper base cost model stack train maxim accuraci examin save dollar reli predict plot top row figur reveal chase base classifi inclin catch fraudul transact exhibit low save score train trust wrong wrong trust base classifi accur classifi accru highest save weight vote combin classifi unawar cost stage independ learn algorithm assign influenc base classifi perform collect predict gener trust classifi determin chosen evalu metric valid set deal problem algorithm emploi cost model guid learn strategi approach disadvantag requir chang gener algorithm techniqu alter class distribut train set tune learn problem adopt cost model credit card fraud transform binari classif problem problem multiplex binari class continu amt attribut quantiz complementari prune discard base classifi exhibit desir properti improv perform approach address problem late base classifi advantag treat classifi tabl perform prune chase union algorithm accur save accur save cart ripper major weight black box prove invalu memori algorithm classifi larg valid exhaust resourc pc main memori swap space discard classifi prior prune reduc size matrix natur simplifi problem prune determin optim set classifi combinatori problem base classifi data combin base classifi select search space potenti prune algorithm emploi evalu function base evalu metric adopt cost heurist method base perform properti set base classifi high accuraci specif tabl displai perform result prune size constitu base singl result depict depend evalu criteria learn size perform select base prune address problem spread problem perform directli relat properti characterist constitu base classifi recal plot top row figur base classifi chase abil catch fraudul transact combin exhibit substanti improv perform save column chase data tabl characterist appar union data set major union base classifi happen catch fraudul transact plot bottom row figur lesser hold spread conclud remark integr multipl learn classif model comput larg distribut data set approach scale induct learn techniqu paper compar predict perform scalabl stack correspond experi perform actual credit card learn task fraud detect evalu method predict perform scalabl experi credit card transact data reveal singl algorithm stack naiv stack ripper edg vote method scale stack method depend scalabl algorithm algorithm combin opposit main memori time complex number number base make scalabl combin outperform base classifi train largest sampl data manner origin data set partit constitut paramet success method acquir base classifi size subset larg learner converg good model small train reason time space constraint extens analyt research comput learn bound sampl complex pac model vc dimens inform theori statist physic studi problem perspect order determin consist pattern compar theoret predict report result demonstr specif indic partit strategi requir find partit scheme perform scale experi highlight research import practic issu acknowledg debt chri merz provid implement algorithm refer anthoni comput learn introduct cambridg stone classif regress tree catlett test flight proc eighth intl work machin page catlett machin learn larg phd dept comput univ chan stolfo multistrategi parallel learn proc intl work multistrategi page chan stolfo compar evalu vote partit data proc twelfth intl conf machin page chan stolfo scalabl learn class cost case studi credit card fraud detect proc fourth intl conf knowledg discoveri data page editor work note workshop integr multipl learn model improv scale machin learn aaai cohen fast rule induct proc intl conf machin page kearn haussler bound sampl complex bayesian learn inform theori vc dimens machin michael theori applic correspond analysi academ kearn uv introduct comput learn theori mit littleston warmuth weight major algorithm technic report comput research univ santa merz correspond analysi combin classifi machin papert introduct comput geometri mit prodromidi stolfo distribut learn appli fraud detect sixteenth nation confer artifici intellig submit public prodromidi stolfo prune distribut data mine system proc nation confer inform page octob provost fawcett analysi visual classifi comparison class cost distribut proc intl conf knowledg discoveri data page provost fawcett robust classif system environ proc aaai provost scale induct overview proc intl conf knowledg discoveri data page quinlan induct tree machin quinlan program machin learn morgan san tishbi statist mechan learn exampl physic jensen oat larg dataset lead overli complex explan solut proc fourth intl conf knowledg discoveri data page aaai turnei empir evalu genet tree induct algorithm journal ai valiant theori learnabl comm vapnik chervonenki uniform converg rel frequenc event theori probabl wolpert stack gener neural
DB/690 3 linearli bound reformul conjunct rada michael genesereth stanford stanford ca usa stanford abstract reformul process rewrit data rule deduct function manner focu problem automat reformul reduc queri process time satisfi strong storag space constraint previou work investig reformul case unari paper extend work arbitrari concentr conjunct rule main result paper reformul problem decid conjunct introduct life cycl recur problem tion involv transform schema queri defin schema promin exampl data model schema view integr problem regard aspect problem theoret framework proce describ abstract transform problem input problem schema rule deduct set elementari queri form queri languag object transform build structur respect requir constraint provid input transform schema rule perform result satisfi condit extract transform mean input queri inform origin result satisfi input minim queri process cost result satisfi input constraint upper bound disk space store transform notic input includ specif condit hold instanc input transform call problem reformul approach formal definit problem contribut paper reformul process rewrit data rule deduct function input schema rule queri produc output schema rewrit elementari queri queri languag term schema rule notic unlik queri rewrit multipl amort queri input requir reformul problem translat transform problem mention focu reformul input requir minim comput cost process elementari strong storag space constraint linear size reformul framework suitabl deal problem view materi integr paper treat base case rule reformul input conjunct show reformul narrow describ algorithm output solut exist satisfactori reformul input result contribut paper previou work solut reformul problem unari notic solut paper work deduct relat arbitrari ariti object extend research reformul deduct queri view formul progress gener standard queri languag integr constraint extend proof omit proof main result addit exampl found appendix preliminari terminolog domain includ set set attribut relat call relat schema collect relat schema store relat horn rule express form pn relat tupl variabl constant variabl conjunct queri singl horn rule conjunct queri relat relat defin conjunct queri queri queri call rewrit term set view relat liter defin term queri relat defin term set tv set definit view relat term queri obtain bodi occurr view liter vi bodi suitabl variabl renam paper notion respect gener follow terminolog substitut form vi distinct ti variabl constant map queri queri map variabl variabl liter bodi map liter head map head conjunct exist map suffici condit result call map theorem conjunct queri minim conjunct queri subgoal queri minim conjunct queri shown concept reformul section definit formal specif reformul problem gener case rule necessarili conjunct reformul process rewrit data rule deduct function word process output focu problem automat reformul reduc process time prespecifi set queri satisfi strong storag space constraint prespecifi set queri set elementari queri input queri introduct detail describ input output reformul cess set relat consist schema tion input schema set term relat set rule input set elementari queri relat definit relat consist schema relat output set scheme store relat materi process reformul tv set view defin term tv set rule output definit tripl tripl reformul queri relat definit rewrit ds arbitrari schema dv consist tabl start view relat defin fix schema fix set definit view relat term ds size definit reformul input linearli bound paramet posit pair storag space dv linear idl linear bound bound restrict applic view bound definit length object autom reformul process gener queri languag strive design reformul algorithm class queri potenti search space reformul transform finit valuabl reformul make search space reformul tractabl restrict number view relat gener rewrit input queri paper focu term conjunct deduct rule remaind paper denot conjunct queri simpli conjunct restrict number view set upper bound number subgoal view show rewrit arbitrari conjunct particip view relat defin conjunct fix number subgoal hypothesi problem find reformul input reduc feasibl problem combin yield procedur notic number subgoal cost measur execut queri schema set view set tv definit relat term queri term queri term term tv view liter vi bodi denot ri bodi vi map map call ri map subset bodi map preserv head variabl view involv theorem definit fewer map exist set definit view relat definit subgoal theorem state view defin exist definit view subgoal origin queri set appli procedur gener view rewrit input queri result state theorem hold extrem limit set desir make similar claim gener case show queri exist set definit view relat definit subgoal qs notic formul similar theorem longer requir minim exist map remov map requir invalid claim counterexampl schema consist binari relat schema queri graphic depict figur set view relat definit form set graphic depict view figur fig graphic depict queri vl fig graphic depict view easi show queri construct map term number subgoal made arbitrarili larg vari paramet clear redund upper bound relat length establish number subgoal definit formul theorem definit fewer true conjunct queri rewrit view altern definit subgoal failur conjectur formul make gener claim theorem answer gener result section shorter view longer view main result previou section rewrit view arbitrari formul view subgoal queri section show conjunct view arbitrari rewrit arbitrari conjunct queri reformul process output view necessarili origin constitut rewrit queri subgoal queri show input queri linearli bound paramet definit section reformul queri linearli bound paramet recal introduc defin defin view relat appli substitut bodi vx trivial substitut appli subgoal substitut appli bodi notic queri qs isomorph queri qs remov duplic easi schema reformul queri interest comput faster schema schema tabl store relat view relat instanc schema data tabl instanc tabl tabl show result materi view relat vl vl notic size tabl vi larger size tabl true instanc schema explain shortli reformul rewrit linearli bound paramet reformul rewrit linearli bound paramet notic vi comput reformul addit improv comput satisfi bound compar origin schema formul main result reformul notion definit queri queri bodi result appli substitut subset bodi schema set view relat defin term queri defin term queri defin term main result hold theorem view liter vi necessarili view relat vi queri obtain vi vi materi schema size tabl larger size tabl vi theorem state rewrit queri find altern rewrit special properti view subgoal properti vi clear proof theorem view relat rewrit tabl view relat defin space requir store tabl view relat defin main tabl larger tabl vi instanc schema notic theorem true independ input queri minim reformul algorithm section describ reformul algorithm deduct rule conjunct algorithm base result previou rewrit queri exist defin term view view subgoal queri idea algorithm input examin view finit number struct rewrit queri combin view success rewrit undergo storag space check decid belong reformul rewrit found rewrit queri exist reformul algorithm input schema set view definit term set elementari queri relat definit paramet linear bound queri relat definit algorithm gener set ing produc definit section view combin view conjunct definit test result conjunct qs rewrit input queri algorithm gener candid reformul combin candid tion rewrit input queri candid reformul linearli bound belong output algorithm theorem input posit number reformul algorithm output reformul linearli bound paramet definit subgoal number subgoal longest queri longest queri queri subgoal theorem true construct algorithm theorem input posit number output reformul algorithm empti reformul input term conjunct view linearli bound paramet result immedi theorem section reformul algorithm present section proof reformul problem decid conjunct notic algorithm gener reformul suffic notic step algorithm involv test pair conjunct queri solv problem relat work schema evolut integr part data model schema tal problem notion schemata definit schema schema studi rel inform capac introduc fundament theoret concept encompass schema domin work rel inform capac includ tutori survei number framework rel inform capac deal issu semant heterogen integr practic design frequent introduc detail paper survei method issu integr queri transform aspect transform queri rewrit method complement schema transform method appli oper queri rewrit import queri deduct queri complex amount data access ing survei implement techniqu implement project deduct extens bodi work theoret aspect queri rewrit overview queri rewrit method datalog extens applic data wareh integr promot studi view paper survei queri view discuss complex answer queri materi view refer major result area queri view materi paper describ approach view materi treat problem materi view queri evalu result literatur concern rewrit singl notic reformul approach involv simultan rewrit set queri transform schema queri consid reformul logic theori theoret foundat theori work gener transform logic theori descript basic method paper futur work contribut paper introduc notion reformul process rewrit data rule deduct function manner focu problem automat reformul reduc queri process time satisfi strong storag space constraint contribut paper proof decid conjunct deduct rule presenc strong storag space constraint shown rewrit conjunct queri rewrit view subgoal origin queri reformul algorithm return queri rewrit view subgoal longest queri input notic result automat hold queri sql direct futur research reformul press research problem issu updat complex reformul desir develop criteria compar output produc reformul criteria optim output potenti multipl answer challeng examin interact view chosen support queri understand interact influenc qualiti storag space requir plan studi complex reformul problem object extend research reformul deduct queri view formul progress gener standard queri includ disjunct integr constraint acknowledg author jeffrei ullman point problem queri fold ultim led reformul problem vassalo read extens discuss paper refer serg abiteboul oliv duschka complex answer queri materi view page serg richard victor vianu foundat fn tg answer queri materi view disjunct page av jd ullman relat express siam ramakrishnan conjunct queri kei relat schema page relat schemata theoret comput sb navath compar analysi methodolog schema integr acm comput ao jd ullman relat scheme siam chandra philip merlin optim implement conjunct queri relat data base page ef codd relat model data larg share data bank comm june ef codd normal data base relat model page prentic hall englewood oliv duschka michael genesereth answer queri view page oliv duschka michael genesereth queri plan disjunct sourc workshop ai inform herbert mathemat introduct logic academ giunchiglia tobi walsh theori abstract gupta select view materi data page gupta singh mumick select view materi mainten cost constraint page richard hull manag semant heterogen theoret perspect page richard hull rel inform capac simpl relat schemata siam august won editor modern system acm yanni kotidi nick roussopoulo dynam view manag system data alon levi nayak semant theori abstract page ay ao srivastava answer queri view page john lloyd foundat logic program rj ye ramakrishnan inform capac schema integr translat page rj ye ramakrishnan schema bridg theori practic inform jack minker logic year retrospect pedreschi logic page intern raghu ramakrishnan jeffrei ullman survei deduct system logic rissanen scheme page ka sudarshan materi view mainten integr constraint trade space time page subramanian theori reformul phd stanford jeffrei ullman inform integr logic view page jeffrei ullman principl volum comput scienc jeffrei ullman principl volum ii comput scienc exampl proof reformul illustr power reformul deduct rule problem invent store relat father mean father view defin shown ancestor relat hold peopl father person child ancestor relat hold peopl common ancestor definit determin peopl famili involv comput ancestor intersect fairli oper improv queri process materi relat tabl schema father storag space worst quadrat number peopl larg materi impract perform gain space growth whatsoev definit show person found father famili person ancestor person father stand relat defin term peopl famili found father definit materi interest queri father relat reformul perform improv target queri materi relat amount space requir reformul requir input reformul satisfi bound reformul good defin relat singl repres class conjunct reformul simpl reformul conjunct deduct store parent gender male elementari queri interest imagin plan queri grandpar relat defin term parent relat obviou grandpar parent parent materi grandpar parent relat interest queri relat relev inform gender process cost queri interest reformul linearli bound proof theorem section prove notion definit map conjunct queri call map queri arbitrari conjunct queri queri exist map preserv head variabl queri composit notic construct easi show lemma imag proce prove main result formul theorem section proof tv set definit view relat term term tv transit map mean map map map preserv head variabl queri composit satisfi condit lemma imag qn arbitrari view liter vi bodi ri definit vi imag ri ri ri subset bodi notic construct ri defin depend choic head definit section ri bodi definit view relat head variabl vi head variabl vi built relat base vi definit view conjunct queri easi show exist transit view liter vi bodi counterpart vi bodi notic vi construct properti map map vi preserv head variabl assum vi number head variabl head variabl vi unifi instanc schema tabl vi storag space tabl vi
ML/691 6 bayesian comput vision system model human interact oliv barbara rosario alex pentland vision model media ma usa abstract describ comput vision machin learn system model recogn human behavior visual surveil task system concern detect interact peopl classifi type interact exampl interest interact behavior includ alter path meet system combin inform close feedback compon emploi statist bayesian approach compar learn hmm model behavior interact model shown work effici accur deal problem limit train synthet train system develop flexibl prior model recogn human interact demonstr abil priori model accur classifi real human behavior interact addit tune train introduct describ comput vision machin learn system model recogn human behavior visual surveil task system concern detect interact peopl classifi type interact decad grow interest comput vision machin learn commun problem analyz human behavior video system typic consist comput vision system detect segment move object human higher level interpret modul classifi motion behavior point gestur car turn left effort understand human behavior substanti extent involv interact peopl level interpret goal intent build system deal complex pedestrian highwai scene comput task combin element learn comput present challeng problem comput vision requir accur robust detect track object interest unconstrain machin learn artifici intellig perspect behavior model interact agent interpret set perceiv action detect eventu behavior potenti danger situat process modul integr consist approach model interact statist learn techniqu teach system recogn normal behavior common interact major problem statist model rare limit number exampl behavior train model major emphasi effici bayesian integr prior knowledg synthet prior evid data paramet goal successfulli appli system normal interact situat addit train potenti problem complet pattern behavior present system system train unobserv behavior rare unusu account behavior system recogn build model behavior singl pursu bayesian approach model includ prior knowledg evid believ bayesian approach framework cope small data set behavior graphic model hidden markov model coupl hidden markov model model classifi human behavior offer dynam time train clear bayesian semant individu interact coupl gener process prior develop framework build train model behavior interest synthet agent simul agent yield synthet data train prior model prior model bayesian framework fit real behavior data approach straightforward flexibl techniqu design requir strong analyt assumpt made form prior experi found combin synthet prior limit real data easili achiev high accuraci recognit interact system robust case exampl behavior interact type section note prior form markov model exampl paper structur section present overview section describ comput vision techniqu segment track statist model behavior model recognit section section result synthet agent data real video section summar main sketch futur direct research final summari formul present appendix system overview system emploi static camera wide watch dynam outdoor scene extens activ camera straightforward plan comput vision system segment move object learn scene scene descript method variat learn accur discount move object descript track temporari meet kalman filter track object color veloc tempor order stream data obtain behavior descript detect interact object figur depict process loop main function unit ultim system comput vision input modul detect track move object move object output featur vector describ motion spatial relationship nearbi move object featur vector constitut input stochast behavior model hmm vari structur depend complex classifi perceiv behavior note stream inform continu manag combin move object scene bayesian approach offer mathemat framework combin observ complex behavior prior provid expect fed back perceptu system segment track step system reliabl robustli detect track pedestrian scene blob featur model pedestrian notion imag featur long histori comput vision mathemat visual evid pedestrian detect track focu attent model expect expect imag track interact detect recognit detect foveat input model percept select attent predict predict attent model expect vector featur visual input learn fig process loop definit usag compact set pixel share visual properti share surround pixel properti combin salient properti deriv signal imag segment subtract system main cue cluster pixel blob static background move object detect move object adapt build eigenspac model background eigenspac model describ rang light variat weather observ eigenspac gener site model standard comput graphic techniqu eigenspac model form sampl imag comput background imag covari matrix covari matrix diagon eigenvalu decomposit eigenvector matrix covari data diagon matrix eigenvalu order reduc princip compon analysi eigenvector largest eigenvalu give matrix princip compon featur vector normal imag vector note move dont locat sampl imag typic contribut model portion imag move object eigenspac model unusu static portion imag accur sum vector eigenspac robust model probabl distribut function move object imag matrix call project input imag space expand imag model static part pertain background comput threshold euclidean distanc featur space dff input imag project imag detect move object present ji threshold note easi adapt perform order big shadow motion mask input connect compon algorithm produc blob descript person shape experi model background mixtur gaussian distribut pfinder final opt method offer good result comput load track trajectori blob comput save dynam track memori trajectori order kalman filter predict blob posit veloc frame recal kalman filter linear estim squar gaussian kalman filter equat correspond optim estim order handl solv correspond blob blob model gaussian pdf rgb color space blob trajectori blob spatial pdf gaussian color pdf combin form joint imag space color space pdf subsequ frame mahalanobi distanc determin blob ident behavior model section develop framework build appli model individu behavior interact order build effect comput model human behavior address question fig background blob segment imag input imag blob bound box knowledg map comput dynam deliv consist interpret strict comput viewpoint kei problem process continu flow featur data stream input manag comput load examin agent interact number interact agent set agent naiv manag load easili larg moder load small agent instantan behavior problem manag inform time statist direct acycl graph probabilist infer network provid effici solut problem hmm view simpl case tempor pin dag pin consist set random variabl repres node direct edg link defin mathemat form joint condit pdf random variabl constitut simpl graphic repres causal depend variabl absenc direct link node impli condit independ famili transform perform graphic structur direct translat term mathemat oper appli underli pdf final express joint global pdf product local condit pdf pin present import advantag relev handl incomplet data trainabl easi avoid encod causal natur algorithm predict probabilist offer framework combin prior knowledg final modular paralleliz paper behavior examin gener pedestrian walk open outdoor environ goal develop composit analysi observ behavior term state transit state time manner state correspond common notion human immedi applic wide rang site view situat figur show typic imag pedestrian scenario fig typic imag pedestrian plaza visual understand graphic hmm hidden markov model popular probabilist framework model process structur time clear bayesian effici algorithm state paramet automat perform dynam time warp hmm essenti quantiz system configur space small number discret probabl transit state singl finit discret variabl index current state system inform histori process futur infer reflect current state variabl graphic hmm depict time figur observ state state observ fig graphic hmm time interest system multipl interact merit composit variabl typic case system structur time space singl state markov model problem order model interact complex architectur extens basic markov model gener memori system provid composit state time interest system composit state simultan state variabl exact solut extens basic hmm chain intract case approxim techniqu exist exact solut case interact case coupl hidden markov model model interact case correspond individu human architectur state chain coupl matric condit probabl model causal influenc hidden state variabl graphic shown figur graph state time depend state time chain influenc chain causal link appendix summari formul paper compar perform hmm maximum posteriori state estim comput sequenc state model observ sequenc fo ong sequenc obtain argmax case hmm posterior state sequenc probabl js fa set discret correspond state time js transit probabl probabl state time system state time write js prior probabl initi state final output probabl probabl observ state time case introduc set js correspond probabl state time chain chain denot superscript state time probabl express causal influenc chain posterior state probabl js js js js denot state observ markov chain direct reader detail descript map estim back problem model human person model gener interact wholli determin behavior intern dynam influenc weakli probabl js js describ kind interact intend model effici manner result goal system accur interpret behavior interact pedestrian scene train critic gener model captur prior knowledg human behavior select prior controversi open issu bayesian infer address problem creat synthet agent model packag build flexibl prior behavior model synthet agent behavior develop framework creat synthet agent mimic human behavior virtual environ agent assign behavior interact gener interact behavior kind individu behavior paramet virtual environ model basi real pedestrian scene obtain measur typic pedestrian movement main motiv construct synthet agent abil gener synthet data determin markov model architectur recogn behavior difficult collect real exampl rare design synthet agent model gener invari properti obtain flexibl prior model transfer real human behavior addit train synthet agent gener robust behavior model real behavior exampl special import visual surveil typic behavior greatest interest rare experi report consid interact reach walk meet separ meet chang direct order meet continu chang direct order meet separ note assum interact happen moment time provid interact satisfi agent orient veloc data featur vector construct consist deriv rel distanc ff align magnitud veloc note featur vector invari absolut posit direct agent environ figur illustr agent trajectori featur vector interact meet continu separ behavior rel distanc deriv rel distanc veloc magnitud align fig trajectori featur vector interact meet continu separ behavior comparison hmm architectur built model interact hmm state chain case state case hmm complex architectur correspond physic encod spatial coupl time agent hmm model data stationari process sequenc train depend avoid overfit optim number train state interact optim model paramet obtain process model set full connect train algorithm determin state structur train data featur vector case case agent model featur vector compar perform architectur train model classifi unseen sequenc order find viterbi algorithm hmm dynam program propag algorithm tabl illustr accuraci architectur interact note superior versu hmm classifi interact identifi case interact present test data tabl accuraci hmm synthet data accuraci recogn interact occur accuraci classifi type reach walk meet meet continu chang direct meet chang direct meet separ accuraci synthet data inter hmm complex time space import issu model dynam time seri number freedom probabl largest model hmm perform analysi accuraci model architectur respect number sequenc train figur illustr accuraci case interact direct stop continu effici term train data special import case learn system ultim special domain collect clean label data difficult hmm result incorpor gener process state space requir sequenc train larger number paramet result accuraci ceil amount train number sequenc train accur singl hmm coupl hmm roc curv synthet data alarm rate detect rate accuraci roc curv synthet data hmm fig accuraci hmm interact dash line accuraci test case dark line includ case roc curv synthet data reach approxim accuraci small amount train result coupl gener suit problem behavior interact agent gener process encod singl hmm visual surveil system alarm rate import classif accuraci ideal automat surveil target behavior detect alarm alert human oper examin analyz aspect system calcul system roc curv figur show achiev low alarm rate maintain good classif accuraci pedestrian behavior goal develop framework classifi learn gener model behavior visual surveil situat import model applic tune view site main motiv develop virtual agent environ model behavior synthet agent behavior model train synthet data directli applic human data section describ experi perform analyz real pedestrian data synthet model train data site data collect preprocess person detect track system section obtain blob featur person hour video exampl type meet behavior detect process featur vector comput vision process modul consist centroid person kalman filter state instant consist repres filter compon gaussian fit blob color space vision system hz sgi comput filter data cutoff filter comput pair nearbi person featur vector consist deriv rel distanc jv norm veloc vector ff align trajectori person typic trajectori featur vector meet continu separ behavior shown figur type behavior displai figur synthet agent note similar featur vector case fig trajectori featur vector interact meet continu separ behavior behavior model result model meet continu meet split follow interact versu interact detect test perform hmm perform omit report result model train type behavior model learn synthet agent environ directli appli real data addit train tune paramet posterior behavior model train start point synthet model exampl interact data specif site recognit accuraci summar tabl noteworthi train recognit accuraci real data result demonstr abil accomplish extrem rapid refin behavior model initi prior model tabl accuraci priori model test real pedestrian data entri row interact detect remain entri classif accuraci interact behavior interact reach walk meet meet continu test real pedestrian data prior posterior final roc curv posterior displai figur interest result experi high accuraci obtain test priori model obtain synthet agent simul fact priori model transfer real data demonstr robust approach show synthet agent train develop model type behavior avoid problem limit amount train data appli model real human behavior addit paramet tune train paramet sensit order evalu sensit classif accuraci variat model train set model chang paramet agent dynam factor perform alter model turn virtual case sensit peopl rel rate movement roc curv pedestrian data alarm rate fig roc curv real pedestrian data futur work paper comput vision system mathemat model framework recogn human behavior interact visual surveil task system combin inform close feedback compon emploi statist bayesian approach statist learn hmm compar model behavior interact superior formul demonstr term train effici classif accuraci synthet agent train system creat order develop flexibl interpret prior behavior demonstr abil priori model accur classifi real behavior addit tune train fact special limit amount train data acknowledg sincer michael toni jebara matthew brand insight comment refer rk bajcsi activ percept passiv percept page bobick boll space paradigm concurr evolv object descript page februari af bobick comput action volum page matthew brand coupl hidden markov model model interact process submit neural novemb matthew alex pentland coupl hidden markov model complex action recognit ieee wl buntin oper learn graphic model journal artifici intellig wl buntin guid literatur learn probabilist network data ieee transact knowledg data buxton gong advanc visual surveil bayesian network intern confer comput june high level interpret sequenc imag workshop conceptu descript page darrel pentland activ gestur recognit partial observ markov process page jh ag dc hogg build qualit event model automat visual input page ghahramani michael jordan factori hidden markov model david michael volum david heckerman tutori learn bayesian network technic report microsoft june weber automat symbol traffic scene analysi belief network page nation confer thoma cluster approach spatial preprocess mss imageri intl symp remot ann harbor moghaddam pentland probabilist visual learn object detect page hh imag sequenc conceptu descript pentland lip face track ieee intern confer comput vision pattern recognit puerto june pentland graphic model recogn human interact novemb pentland classif cluster ieee symp machin process remot pentland liu model predict human behavior page lawrenc rabin tutori hidden markov model select applic speech recognit lawrenc saul michael jordan boltzmann chain hidden markov model gari david tk volum david michael jordan probabilist independ network hidden markov probabl model ai memo feb william hinton field network learn discrimin tempor distort string connectionist model summer page san morgan kaufmann pentland track human bodi volum wa cr pentland track human bodi ieee transact pattern analysi machin juli forward backward express determinist approxim maximum posterior state estim introduc enabl fast classif paramet estim expect obtain upper bound cross entropi full posterior minim subspac linear number state variabl dynam program algorithm sampl highest probabl path compact state complex chain state observ data point interest case limit coupl complex fall hmm algorithm express ff fi product lead likelihood sequenc instant time case time path correspond head subscript correspond subscript head algorithm express comput ff fi variabl incorpor probabl head chain chain illustr effect maintain multipl path tradit express ff variabl singl ff ff transform pair full posterior ff margin posterior ff ijk jh jk ff ff ijk jh jk ff fi variabl comput similar trace back path select forward analysi collect statist dynam transit matric chain convent hmm express coupl matric ff jj jj ff fi articl process macro packag llnc style
HCI/692 4 krueger explor camera control hci intern confer pp explor camera control morten fred martin bichsel helmut krueger institut appli physiolog institut design construct method swiss feder institut technolog zurich introduct plan tool base comput vision capac complex plan composit task al system enabl group interact virtual real brick select manipul object scene plan view scene project tabl perspect view call side project wall plan view storag space user select object object select put brick object posit object rotat fix simpl brick manipul stai brick cover remov object brought back storag space delet figur offer plan view combin action side view perspect situat project object posit rotat brick krueger explor camera control hci intern confer pp camera control basic issu interact explor bimanu camera control object manipul graphic interfac explor balakrishnan kurtenbach screen keyboard innov featur object part scene multimedia framework full includ tilt roll planar interact brick posit rotat inform bridg gap planar interact view control explor import rang composit plan design product architectur industri design explor virtual essenti assum point overview thing detail call direct control rotat zoom view strategi consid control side view camera requir extend properti comput vision input explor softwar approach pursu activ virtual object introduc al activ object featur intellig behaviour support complex oper emploi activ side view control implement altern method plan camera window side view base scene handl base call observ handl krueger explor camera control hci intern confer pp plan view brick offer shift brick add zoom zoom brick movement connect movement give shift rotat updat scene user action quit remov brick updat frame interest user action brick scene adjust frame object realworld analogu tabl shift rotat zoom ground frame user action scene user action scene zoom figur remov brick figur remov brick krueger explor camera control hci intern confer pp side view window camera brick offer shift brick add zoom camera set virtual camera side view handl distanc set zoom window set side view border scale set zoom tabl camera window shift rotat zoom camera window figur camera zoom figur window zoom zoom krueger explor camera control hci intern confer pp usabl studi inspect conduct gener user offer side side altern control method task complet time give quantit data subject particip rate prefer method experi conjectur method base scene handl method base observ handl composit task plan discuss perspect rotat brick requir orient brick form brick reli brick orient interest fit form emploi rectangular circular brick zoom control topic asymmetri appli factor tilt roll al combin relat explor futur research found concept input refer develop multimedia softwar verlag für explor bimanu camera control object manipul graphic interfac proc acm graspabl user interfac phd ch camera control graspabl interfac proc iast asymmetr labour human skill bimanu kinemat chain model journal motor gestur base interact techniqu plan tool construct design proc ieee
HCI/693 4 human comput interact context introduct albrecht schmidt offic karlsruh germani analyz peopl devic digit smart mobil handheld wearabl appar period interact shorter tradit mobil set notebook comput temporari stationari notebook meet note salesman mobil comput custom present scenario time applic temporari stationari minut hour usag devic interact period shorter address make note pda rang minut impli time set applic significantli smaller tradit mobil system fact applic fulfil task tool real creat reduct explicit interact creat shift explicit implicit hci context situat locat state addit input system situat interact process simplifi system user respect inform context wide spread standard applic context devic real world situat suggest extent notion context includ inform real world environ context build applic knowledg situat context import gain understand context current research show strong focu locat architectur base smart environ schilit al scenario gp rf determin user point context locat term context gener suggest describ context number illustr context surround languag unit determin interpret linguist context set fact circumst surround situat histor wordnet mean free dictionari synonym depend applic context knowledg context primari interest applic adapt context approach context point view applic observ applic run specif devic input screen network time time class time user physic environ type condit social set social solv task group gener hold mobil stationari set alik item basic dimens locat mobil applic major interest mobil set physic environ applic execut make phone call walk offic desk car context applic context inevit specif languag describ context link occur applic context recent work found notat human readabl easili process comput decid markup languag xml extend sgml base descript model introduc brown ad concept group context match attribut trigger attribut make descript express suitabl project depend platform context modul implement languag context number compon found mechan bundl contextu variabl group select match semant group descript match group provid context descript variabl variabl variabl discrimin enter leav context enter leav trigger time specifi time action trigger context stai stabl time context trigger time interv trigger fire descript context action shown context descript consist group contextu variabl group match semant variabl case devic touch state devic group match semant mean contextu variabl true user put pen screen paramet indic time action perform context action posit futur situat predict drive car context walk neg make context evalu true action trigger semant context enter stabl action perform complet descript mean devic user hand user pen screen displai hidden imag depict figur context wai context basic approach input applic run calendar activ environ badg context sensor sensor badg paper concentr scenario combin case choic approach collect data situat context low level sensor project built context recognit devic equip light passiv infrar touch temperatur sensor touch sensor standard sensor produc analog voltag level touch sensor recogn human bodi capacitor suppli digit heard devic microcontrol read physic input channel offer analog digit convert number digit statist method appli recogn context board depict figur commun pda devic physic realiz serial line connect run commun protocol protocol time applic updat contextu inform applic catch devic devic repli string encod current figur context devic palmpilot contextu inform process applic hci benefit hci mobil devic concern gener devic qualiti small energi demand optim capabl output context recent year output system mobil devic featur stereo audio high resolut color screen pda upcom mobil phone displai system wearabl comput notif mechan wide phone pda situat context adapt output current situat privaci find good time interrupt reduc interrupt remind meet input context small applianc space keyboard limit result bad usabl input handwrit recognit develop lack speed accuraci advanc voic recognit made recent offic set crowd share room industri recognit perform poor privaci accept issu major concern context solv problem gener adapt input system current situat audio recognit limit input inform provid context reduc select space offer option current palmpilot explor wai implicit commun user environ mobil devic built context awar notepad applic applic function notepad applic palmpilot applic adapt current situat context react implicit interact applic behavior situat context adapt implement user devic hand case applic switch user put devic hand switch time assum user devic hand work devic devic move walk font size read devic stabl posit devic stationari hand font made smaller displai text figur screenshot made pilot simul pc easier good qualiti imag figur adapt context small larg privaci adapt straightforward build current pda monitor light condit applic switch light level threshold brighter light switch figur privaci set write touch content displai hidden figur walk passiv infrar sensor deploi size devic make feasibl plug pilot proper user studi work paper motiv broad view context suggest applic centric approach descript context current project learn simpl specif languag context markup languag support trigger semant basic mechan acquir context knowledg devic introduc analysi potenti benefit hci context implement demonstr feasibl concept introduc earlier phase extend recognit complex includ simpl audio process develop compon plug small mobil devic contextu inform user context bio open door applic guess user inform implicit commun hint refer locat awar mobil comput proc ieee intl confer april laboratori marketplac ieee person octob pj creat applic proc palo ca vol pp cheverst blair davi fridai support collabor groupwar person vol march esprit project technolog enabl awar locat servic mobil comput environ comput graphic special issu mobil comput volum numer nokia mobil phone mobil interfac work art interfac design laurel touch portabl input interfac mobil user chi usa distribut locat system activ offic ieee vol comput hci workshop human comput interact mobil unit gist technic report chri spatial audio environ wearabl intern symposium wearabl octob comput applic proc workshop mobil comput system santa decemb ieee comput societi context locat proc intl workshop interact applic mobil comput novemb comput scienc problem ubiquit commun juli
AI/694 2 probabilist roadmap method parallel nanci amato dale technic report depart comput scienc texa novemb abstract paper report experi parallel probabilist roadmap motion plan method show scalabl speedup obtain effort part develop experi limit outlin gener techniqu parallel type comput commonli perform motion plan identifi potenti difficulti face effort parallel sequenti motion plan method research support part nsf career award reu nsf grant reu texa higher educ coordin board grant ncsa illinoi dale support part depart educ fellowship introduct automat motion plan applic area virtual realiti design motion plan method practic restrict robot freedom strong evid complet planner find solut determin requir time exponenti number dof robot attent focuss random probabilist method notabl random potenti field method random path planner latomb random walk attempt escap local minima random probabilist roadmap method gain attent problem involv exist import applic solv current solv accept time constraint problem requir extrem anim virtual realiti applic motion plan parallel sharp contrast great amount attent sequenti motion effort spent develop parallel planner high complex typic motion plan frequent solut awar studi parallel method appli higher give parallel algorithm comput discret link freedom manipul method free space arm configur consid sequenti search algorithm al formul parallel version random path planner latomb parallel processor independ run sequenti algorithm processor find notifi processor stop search straight forward speedup report work awar specif relat motion parallel method detect relat geometr problem result illustr reduct plan time obtain parallel method mention motion plan method parallel parallel search expect yield scalabl speedup expect run time proport number processor fastest solut hope time requir fast sequenti execut order consist obtain scalabl speedup approach partit work perform set parallel probabilist roadmap method class motion plan probabilist roadmap method gain attent prm interest amen parallel implement prm random construct graph roadmap roadmap node correspond configur robot node connect edg path configur found plan method queri process connect initi goal configur find path roadmap connect point probabilist roadmap method roadmap construct node gener connect node form ii queri process connect roadmap find roadmap path connect node roadmap construct time vari note preprocess time build adequ roadmap problem justifi abil satisfi quickli number vari queri roadmap probabilist roadmap roadmap stand benefit greatli parallel roadmap node gener depend roadmap node produc independ processor parallel minim costli overhead commun drag perform parallel algorithm connect cost detect natur paralleliz parallel implement acknowledg literatur awar specif implement empir studi result paper report experi parallel probabilist roadmap method class motion plan method select suit parallel show planner parallel parallel comput commun parallel effort obtain scalabl speedup studi show class planner parallel ffl show scalabl speedup obtain motion plan method effort part ffl outlin gener techniqu parallel type comput commonli perform motion plan ffl identifi potenti difficulti face effort parallel sequenti motion plan method point refer potenti difficulti face transform exist motion plan method parallel execut import motion plan algorithm make librari implement common comput task parallel planner requir underli librari parallel applic limit studi identifi gener true reason librari make frequent global data structur static variabl optim perform safe optim parallel code requir make copi error prone memori requir workstat multipl processor commonli similar problem encount method develop librari address awar potenti problem explicitli parallel version requir platform parallel machin studi sgi machin memori set processor connect form set node connect hierarch fashion interconnect fabric built link processor mhz microprocessor support singl global address space memori physic distribut share address space share memori program greatli simplifi program task deal complic messag parallel prm sequenti solut slow practic provid start point parallel solut true prm object studi roadmap node prm correspond configur robot roadmap construct proce gener connect node form roadmap previou note gener node connect execut time spend gener bulk remain spent connect reason detect call necess place biggest benefit achiev parallel node connect easi wai parallel node gener node gener repres small percentag effort spent parallel wast small amount afford spend time gener node qualiti turn thing connect phase initi method sophist advantag inher parallel phase implement phase node connect effect produc result work addit node gener parallel node gener phase basic prm method trivial node simpli processor gener prm processor gener random free save endif endfor sophist node gener algorithm prm number obstacl processor collid robot cfg random direct eman free cfg direct find contact binari search save endfor endfor connect effect parallel roadmap connect phase essenti obtain scalabl speedup phase typic account preprocess time phase due larg number detect check made node goal gener node free satisfi constraint surfac contact requir simpl find gross adjust made current node quickli converg refin binari search node connect involv check small increment path roadmap node increment robot configur free roadmap node mark connect roadmap built formul effect parallel solut connect problem difficult intuit parallel connect phase effect massiv inher parallel prm simpl sequenti algorithm connect node closest constant effect parallel solut prm processor uniqu cfg index closest neighbor cfg local planner connect save endif endfor endfor sophist node connect algorithm algorithm closest pair node connect compon exist roadmap consid effect local planner attempt connect goal reduc number connect compon merg smaller compon larger implement issu softwar platform code written compil version nativ sgi compil parallel task accomplish provid fork parallel librari task creat processor current save task gener connect phase algorithm sequenti code detect voronoi clip code processor provid hash tabl track closest featur object hack code code parallel method basic parallel group sequenti prm planner parallel node gener roadmap connect phase outlin section node processor independ gener set roadmap node connect roadmap processor attempt assign connect unlik node gener processor gener connect simplist parallel strategi duplic work note multipl processor read roadmap candid node time requir add node edg roadmap graph data structur compar rest elect serial access data structur node gener connect processor collect list addit make evolv roadmap graph parallel portion phase singl processor ad node edg graph measur impact speedup obtain section addit benefit serial modif roadmap graph graph trivial remain import concern modifi share data structur parallel note parallel node gener algorithm adher commonli parallel comput literatur parallel connect algorithm belong model detect librari case motion plan sequenti planner librari code detect allud section difficulti encount detect librari parallel underli reason librari optim perform sequenti machin global auxiliari data structur exploit spatial coher subsequ detect static variabl frequent access valu multipl processor execut detect call optim repres problem parallel implement solut adopt make separ copi data modifi detect call activ processor simpl processor separ copi hash tabl record closest featur object pair previou detect call modif requir toolkit extens note replic data good solut prove overli costli term memori requir result section report perform parallel node gener connect algorithm measur made heavili util interact mode consist obtain measur speedup problem size larg measur small task unstabl node gener typic repres total roadmap construct time elect measur node gener connect phase problem size algorithm run processor experi run result report averag noisi data point thrown summari result tabl motion plan environ consid environ ident parallel dimens smaller block bare fit corridor parallel block environ fairli note similar speedup expect environ depend problem parallel implement prm method node result report problem instanc method gener node larg problem obtain run time larg system result prm gener shown figur result gener shown figur good speedup obtain heavili util system tabl detail includ number node successfulli gener node result report problem instanc node gener phase gener gener yield approxim node connect phase connect algorithm connect attempt node node closest result connect phase shown figur show similar result node gener algorithm tabl detail includ statist roadmap gener number connect compon result size largest connect compon speedup scale number processor grow note measur execut time small fall region measur noisi system expect phenomenon reduc collect final measur dedic mode futur work base experi experi parallel probabilist roadmap motion plan scalabl speedup obtain develop effort prm method massiv inher parallel easili optim exploit simplist parallel strategi intend implement sophist algorithm gener qualiti roadmap node gener phase sophist algorithm select roadmap node appli bound local plan method connect phase expect continu benefit parallel prm motion plan techniqu final stabl measur made dedic mode includ result multiprocessor run time gener phase number process figur sgi origin run time gener run time gener phase number process figur sgi origin run time gener run time connect phase number process figur sgi origin run time connect phase sgi origin gener phase connect phase prm proc sec sec sec tabl preprocess comput time statist gener connect phase roadmap build request node work problem request node noisi data point thrown acknowledg robot group texa refer parallel comput geometri gupta motion plan base approach kinemat redund kinemat roadmap proc ieee int conf robot autom page good distanc metric local planner probabilist roadmap method proc ieee int conf robot autom page prm workspac proc int workshop algorithm foundat robot parallel algorithm convex hull proc ieee symp foundat comput page pp amato wu random roadmap method path manipul plan proc ieee int conf robot autom page april latomb robot motion distribut approach int robot kumar parallel formul inform random search robot motion plan problem proc ieee int conf robot autom page kumar parallel search algorithm robot motion plan proc ieee int conf robot autom volum page motwani captur connect geometr space paralleliz random sampl techniqu proc ieee workshop random parallel motwani path plan configur space proc ieee int conf robot autom page hwang ahuja gross motion plan survei acm comput introduct parallel algorithm latomb random preprocess configur space fast path plan proc ieee int conf robot autom page overmar probabilist roadmap path plan configur space ieee tran robot august latomb robot motion plan kluwer academ parallel robot motion plan proc ieee int conf robot autom page del fast detect practic motion plan part spatial proc ieee int conf robot autom del fast detect practic motion plan part parallel algorithm proc ieee int conf robot autom fast robust polyhedr detect technic report mitsubishi electr research overmar random approach path plan technic report comput utrecht overmar probabilist learn approach motion plan proc workshop algorithm foundat page reif complex piano mover problem gener proc ieee symp foundat comput scienc page silicon perform tune xavier configur space toolkit autom spatial technic result project final report technic report sandia nation
ML/695 6 neural network model monoton diagnost problem solv xu zhang school mathemat comput scienc england nsw australia abstract task diagnosi find hypothesi explain set manifest find hypothesi number potenti exponenti larg effort made find parallel process method solv difficulti neural network model diagnost problem solv diagnost problem treat combinatori problem featur model causal network directli network featur error observ current activ manifest node guid network comput find optim diagnost introduct set diagnost infer find plausibl fault disord explain manifest present individu disord explain portion manifest composit hypothesi consist individu disord found composit hypothesi explain manifest find composit hypothesi reason number combin individu disord exponenti larg approach made solv difficulti approach develop tradit ai algorithm focu diagnost reason restrict diagnosi space combinatori exposit larg avoid approach develop problem solv algorithm involv larg amount parallel process neural network approach base highli parallel local strong solv difficult task neural network massiv parallel distribut processor gener neural network diagnosi includ network activ rule calcul node network equilibrium stop condit network comput probabilist causal network directli adopt network architectur activ rule network equilibrium vari model set node activ calcul activ rule repeatedli network equilibrium reach set disord determin activ disord node neural network diagnosi difficulti mention allevi mean highli parallel local comput neural network gener connectionist diagnosi model diagnost problem treat combinatori problem error observ current activ manifest node guid network comput find optim diagnost observ neural network model find composit hypothesi error observ manifest activ result show averag correct rate composit found model remaind paper section diagnost task causal network repres diagnost knowledg section present neural network model includ network activ network comput procedur section result demonstr effici model section paper formul diagnosi firstli gener diagnosi task describ constrain class causal network repres constrain diagnosi task diagnosi task diagnost task ffl fd ng finit set individu disord node ffl fm pg finit set manifest node explain ffl map denot power set set specifi subset explain ffl specif observ set subset repres jj pg chang time ffl explan observ input relationship network task diagnosi deriv base type interact individu incompat cancel diagnosi problem nonlinear incompat interact exist nonmonoton cancel interact exist prove gener diagnosi task np constrain class monoton diagnosi diagnost problem monoton composit explan fd explain addit data explain formal monoton diagnosi problem formul causal network causal network consist direct acycl graph condit probabl distribut graph triplet ffl finit set fh ffl set link element pair node ffl set probabl link condit probabl accompani link call causal strength repres strongli causal link assum class simplifi causal network disjunct relationship disord receiv disjunct conjunct relationship simpl version causal network involv simpl causal network includ layer node causal network divid disord set fd manifest set fm manifest node interact node disjunct conjunct compound relationship order distinguish node node type ty ty ty relationship node ir fd ir ty relationship ir diagnost problem causal network restrict monoton diagnosi restrict limit compound relationship basic assumpt underli causal network ffl independ assumpt disord independ dn ffl knowledg assumpt disord prior probabl ir condit probabl ik ir condit probabl ir notat ij abbrevi neural network model monoton diagnosi task neural network consist set node connect direct link numer connect call link link node numer call time neural network activ updat activ rule describ neural network model solv monoton diagnost problem describ network energi function rule updat node activ final comput procedur complet diagnosi task network architectur causal network section directli network architectur node set network activ disord node repres possibl element solut diagnosi problem activ manifest node measur possibl disord causal strength repres link weight link connect node probabilist causal strength ij updat activ node diagnost input data observ diagnosi manifest observ mi initi mark real world present manifest clear manifest present present weakli repres real initi valu manifest longer mi demonstr strongli manifest present energi function real world peopl find observ manifest effect found diagnosi similar observ manifest fm final manifest activ deriv diagnosi model neural network mi observ idea smaller differ infer diagnosi model work equat measur error time smaller closer access activ calcul activ node function node express ij ij function disord node equat express dn diagnost problem model neural find solut set manifest deriv set disord activ equat subset repres vector xn consid corner hypercub diagnost problem view discret find corner hypercub equat continu interior diagnost problem find equat transform continu problem equat energi function minimum desir neural network problem perform repeatedli updat activ rule reach minimum equilibrium neural network order reach minimum energi updat base current error updat error smaller smaller network approach ae disord consid element reject solut disord ae form subset disord fd consid solut observ activ rule manifest activ motiv result develop activ rule calcul theorem theorem calcul probabl conjunct disjunct independ proposit definit oper express formula formula en en en fd defin activ rule ty ty ij refer current activ time formula activ rule express formula ty ty neural network causal strength ik assign ik disord activ activ disord node determin activ node chang time express approxim ffi dd dt ffi ffi small posit number chang amount dd dt deriv rate chang activ time ffi determin ffi dd dt ffi defin dd dt dd dt ff dd dt ff dd dt ae ij equat activ calcul current activ link strength observ network comput procedur network comput procedur consist seri iter comput base observ data activ updat equat comput repeatedli energi function reach equilibrium refer time iter comput iter consist initi updat equat updat activ equat determin network reach determin assign comput step comput stop ae form solut observ step determin network equilibrium observ close observ call deriv subset equal longer chang reach stabl stop network comput ghost solut observ equat close question stop solut found experi conduct number experi test neural network model make comparison model experi perform neural network simul call neural network effici flexibl simul environ neural network research activ rule comput procedur implement program function insert mean parallel comput neural network model implement exampl borrow test neural network call exampl exampl causal network disord manifest detail causal network tabl ij tabl network detail exampl causal network disord potenti subset disord exampl construct potenti case basic experi includ step observ hypothesi gener correct judgement observ gener observ case gener neural network model disord subset instanti disord node observ effect disord subset ob repres set hypothesi gener observ ob input composit deriv model network comput set composit composit hypothesi hy explain observ ob order judg composit correct manifest composit compar observ manifest close observ mean observ composit composit correct solut explain observ hy manifest set hy hyp hy ob hyp fm hyp hyp ob fm ob ob averag error hyp ob defin jm hyp ob averag error hy ob defin mention section effect found diagnosi close observ consid explain observ manifest closer effect observ plausibl form correct solut explain manifest error manifest effect found neural network model criterion judg form correct ffl composit hypothesi hyp consid correct solut explain manifest ob result show averag correct rate exampl result tabl case criterion mention composit case correct averag correct rate exampl total number case number case number case hyp tabl result neural network model neural network diagnosi model present paper featur model unlik neural network causal network directli neural network transform author neural network diagnost model causal network directli neural network model peng causal network model independ interact involv network kind network repres independ diagnost problem compar model peng model repres perform monoton diagnost problem gener independ diagnost problem featur model error observ current activ manifest node guid network comput result show correct rate diagnosi method high refer de probabl pp de pp xu improv critic diagnosi reason pp franc abduct infer model diagnost problem connectionist model diagnost problem ieee tran man pp neural architectur class abduct ieee transact system man pp comput complex artifici pp civil engin pp pearl probabilist reason intellig network plausibl morgan kaufmann san
Agents/696 1 secur object space coordin model agent manuel jan vitek abstract coordin languag base share data space suit program parallel applic cooper softwar compon secur object space extend model support composit independ mutual softwar compon flexibl effici secur facil base cryptograph object type discuss implement secur object space context mobil agent system introduct coordin languag base share data space fifteen year research advoc structur distribut concurr system mode commun provid call gener anonym process interact read write entri share space uncoupl process ti commun partner characterist make straightforward program resourc discoveri protocol match client server base respect offer program style dynam reconfigur run system featur import distribut system practic applic coordin languag remain limit parallel program made cooper compon sourc make good coordin languag support composit independ develop softwar compon multipl sourc mutual suspici compon requir structur commun primit secur mechan lack exist model shortcom gener commun inher model gener commun process access share design carefulli mistak easili simplest read entri part protocol prevent malici process spy corrupt data exchang common space paper present secur object space coordin argu model solv mention difficulti entri share space protect kei symmetr queri data space protect content data space entri contribut formal present model process relat type cryptographi permit encrypt favor dynam descript implement java program languag outlin paper shortcom gener commun goal provid tool mobil agent applic section background mobil agent list term coordin section present introduc calculu give oper formal relationship type cryptograph primit section present implement java exampl relat requir section section present relat work coordin mobil agent spur success number project experi approach construct distribut system mobil agent softwar compon code data agent carri distribut comput move network run agent site resourc interact agent locat site mobil agent applic program style clear separ local remot local interact place remot interact obtain move agent kei issu agent program structur regul commun agent agent commun essenti point move desir facilit express commun protocol provid primit end obviou secur commun regul structur mobil agent system agent commun messag pass interfac commun regul strong agent hierarch structur commun direct parent filter control commun agent parent disallow commun agent secur level simpli transfer messag messag base commun form cumbersom true case interact agent rout rout code user goal extend form gener commun simplifi code common pattern interact agent break secur model gener commun attract simplifi task introduc agent reconfigur link agent import aspect agent program led addit share data space mechan main weak linda lack access control mechan absenc support structur commun multipl data space solut access control problem data space consid protect grant access data space agent impli agent trust manipul data space interact agent access space disadvantag approach highli dynam environ high migrat rate agent agent task manag data space grant space access difficult pose effici problem multipl space solv part problem agent protect valu store data space protect data space agent plai role garbag collector retriev entri common access content entri treat opaqu valu lack structur commun show program logic channel logic channel structur commun client read server repli group messag address member group arbitrari process emit match request structur increasingli import run independ applic top data share exist basic servic place requir mobil agent coordin ffl privaci secret data field entri preserv commun password bank account number fear disclosur implic privaci access field data space entri restrict privaci preserv agent platform includ network disk storag format ffl layer secur polici layer compon environ formul restrict oper agent sandbox agent agent execut agent specifi commun sandbox rest system permit ffl garbag share resourc target denial servic attack agent flood data space useless entri sole degrad perform data space cut criterion decid entri anymor garbag collect algorithm applic specif implement user level possibl garbag collector agent work parallel space typic polici includ coordin envisag differ sun javaspac space goal coordin agent platform remov entri agent migrat associ entri ffl logic support flexibl notion logic channel requir ffl data space oper comput overhead low secur object space introduc coordin model meet mention requir essenc view object space manipul cryptograph primit term secur object refer model actual share data structur secur object space rel linda process write order sequenc data common retriev tupl queri partial tupl call templat role associ templat process call match multipl candid match chose entri object set field field label object hx integ charact label write object space view encrypt oper object encrypt label symmetr kei asymmetr kei pair object insert hk match perform oper match procedur templat label decrypt kei valu comparison templat singl label special hx templat match object present semant match decrypt field object space success decrypt mean match case multipl match return object return space reveal content encrypt kei learn templat match hz decrypt kei order field relev note field valu match reader familiar overhead cryptographi effici implement kei semant outlin inform reason provid implement encrypt match implement program languag level dynam type check encrypt requir valu leav control languag store disk ship network present model set process calculu inspir minim set highlight uniqu featur model give semant oper calculu multipl object featur ad make exampl clearer syntax basic definit assum infinit set rang set label pair rang label defin function assum distinguish void denot sole inhabit set set basic rang disjoint union state type subtyp relat basic valu order relat full fledg expect richer type system interest subtyp suffic object xn possibl empti sequenc field label field label assum set object variabl rang ff set rang object rang field rang express rang defin process express inact composit replic input output restrict label select field object extens ff variabl denot process denot parallel composit denot replic process synchron input primit bind ff object match templat space proce asynchron output primit place object space denot creation fresh express includ select field object extens object field notat notat convent abbrevi possibl empti sequenc field trail process notat captur avoid substitut pf ff convent abbrevi label form ambigu write xn relat type cryptographi object type relat cryptograph oper present relev fact cryptographi symmetr scheme share kei encod data ciphertext kei decrypt data write denot encrypt note asymmetr cryptographi kei pair kei encrypt decrypt pair denot encrypt remaind make standard assumpt cryptographi ffl decrypt kei ffl encrypt packet reveal kei encrypt ffl suffici redund messag decrypt algorithm detect ciphertext encrypt kei object made field oper treat label kei syntax write denot public kei privat kei relat symmetr public kei encrypt decrypt write denot share kei cryptographi notat explicitli write impli encrypt note slight calculu pair kei practic kei pair present discuss object xn store encrypt space hk retriev present subset ng object space possess kei grant access valu turn object type subtyp discuss lead definit notion theori subtyp view type type provid relat subtyp object field defin type field hidden object view object type protect hidden field view type kind control access object push analog extend cryptographi cryptographi introduc asymmetri lead definit relat relat significantli mathemat properti definit object object type tn written iff xn defin subtyp order field disregard choic multipl independ extens objet return definit object subtyp relat relat object iff exist immedi partial order relat object type introduc relat check templat object candid object definit match relat relat iff exist field match type subtyp field field specif give properti lemma proof point follow straightforward applic definit point definit tn applic definit iff exist iff exist mean label object field tn point definit iff exist symmetr relat transit entri equal lemma impli note properti hold comment properti state lemma properti form transit properti state type match properti sort modifi properti establish equal type properti composit tradit subtyp match type exampl exampl illustr empti type match provid access field smaller type match longer ha li ha li type match specif ha bi ha li type match ha li hb li proce give definit match procedur templat object candid object establish candid meet specif templat definit defin requir cryptographi definit match relat relat impli templat match candid type templat match type candid field match label equal valu equal exampl fact collect object content yi yi xi yi yi yi zi zi zi zi ad field object restrict potenti xi xi extend field match fail definit extens deal encrypt access decrypt introduc oper test object lemma result carri object match object ahead show ensur object hidden inform process execut semant calculu present notion match reli properti object type implement object match definit provid kind protect symmetr asymmetr cryptographi primit safe languag environ reduct semant reduct relat defin process repres step comput reduct defin mean auxiliari structur congruenc evalu structur congruenc process satisfi axiom rule figur handl renam bound variabl silent perform evalu relat yield result express involv field select object extens reduct relat relat process satisfi axiom figur term fi erron syntax calculu extent term prevent type system paper prefer comput proce term express reduct pf ff evalu fi structur congruenc fi xi fi figur reduct semant proce exampl demonstr express calculu show meet requir outlin section synchron process synchron object process reduc step pf ff empti object repeat process read object write back case match rule repeat retriev object write back immedi multipl object space expand calculu multipl object space process read object space term proce output ff parallel space simplic abbrevi space identifi templat unlik templat object queri process object space queri space ff process parallel term reduc pf ff dynam reconfigur commun pattern process easili chang commun partner acquir identifi comput term process start retriev object encrypt symmetr kei proce write object back space identifi select decrypt field label ff commun partner term bulk encrypt differ run time public kei encrypt share kei encrypt advantag encrypt larg volum data share kei encrypt share kei privat kei code process send symmetr kei encrypt asymmetr kei encrypt process partner space identifi evalu rule state hb hb garbag collect implement garbag collector agent process mediat access object space output request add gc specif inform object insert space garbag collector inform simpli field code calculu assum denot space insert request denot actual commun time stamp evalu rule extens express ff return object share kei assum time stamp process collect garbag match rule extract object stamp time interest point user level agent gain knowledg content object manipul polici mediat space gc inform visibl normal commun process retriev time stamp object access inform find inform attach linda straightforward model linda linda posit notat match valu tupl encrypt primit linda tupl zi translat object zi global scope stand posit obviou linda output oper translat linda queri translat occurr replac asynchron encod asynchron obtain space channel restrict match trivial case roughli encod write xy translat output input prefix form xy translat input oper translat occurr variabl replac conclud present calculu secur object space implement model remark introduc label model abandon posit notat linda system independ cryptograph label model add structur gener commun linda program reli agreement mean field tupl posit notat easi error prone tupl ariti easili mix lend extens label make agreement explicit make code robust implement model exampl previou section demonstr express power model section implement context base mobil agent system argu implement effici semant encrypt emul encrypt place long agent remain type environ java virtual machin encrypt requir tupl transfer network disk implement integr kernel mobil agent platform mean oper kernel control runtim system enforc access control restrict languag base protect mechan access control check primit outlin agent gain access object store entri possess proper kei encrypt object back agent object migrat object leav control runtim reason longer protect program languag techniqu case resort encrypt remaind section outlin implement integr java start section java api implement addit helper class requir final paragraph aspect java program languag potenti undermin secur control inherit object class model reli kei access field object abstract kei final subclass repres asymmetr symmetr kei kei class defin common attribut kei kei field store actual kei real cryptographi object guard transfer jvm match method compar kei instanc actual encrypt decrypt encrypt decrypt method object object guard kei object share space paramet oper object store serial form encrypt decrypt method call agent transfer code transfer object network abstract class kei implement serializ privat public abstract boolean public abstract object public abstract object repres share kei match method expect argument kei actual encrypt decrypt public final class implement serializ public public boolean public object public object repres asymmetr kei class dual kei match note constructor protect asymmetr kei indirectli creat user creat helper creat asymmetr kei asymmetr kei dual kei encrypt decrypt method kei field encrypt decrypt mean object encrypt asymmetr kei context encrypt transfer network decrypt match asymmetr kei object destin agent platform public final class implement serializ privat protect public boolean public object public object class implement behavior entri share object space recal notion subtyp type match defin reli notion structur subtyp differ java type system structur subtyp requir explicit type hierarchi hierarchi java explicitli defin extend structur subtyp natur multipl supertyp type implement match dynam method final method null plai role instanc creat set pair kei check type kei type automat reject select oper method kei paramet return object kei correct null match object found extend return object obtain extend pair oper fail pair present match method return true argument match requir kei valu match explain valu match secur implic normal java object compar public final class implement serializ public public object public boolean public object public object class repres associ address method read version atom execut block oper synchron mutual repres object serial form serial compon read deseri public final class implement serializ public public synchron void public public difficulti inherit match share space impli compar field type altern implement function approach object defin match method advantag approach mean match defin class programm decid link list object match list simpli basi list match list element requir flexibl main reason inherit exist languag place introduc class defin match method pose secur risk attack program match class execut method object match aim steal state object program match method subject system denial servic attack approach class defin match javaspac programm defin match behavior class defin match function defin equal method method match object implement interfac match function fix object written share space transform serial equal method user possibl overwrit adopt javaspac solut secur risk pose inherit oper class serial field store serial form serial form object comparison interpret instanc emploi equal method object comparison difficulti due refer fact life system kei dynam inform pretti unavoid object java except refer default paramet pass mode main problem context model undermin role sole commun mechan commun top secur polici enforc import ensur object possess back pointer agent ensur tupl agent inadvert give pointer access object agent goal central share secur level undermin logic consequ refer object mean consecut object creat copi object serial function java creat copi semant select field object satisfi constraint perspect featur implement code save kei object disk extens integr implement calculu queri class place ensur return object subclass class field match kei coordin present exampl model commun agent environ layer secur implement share object space root level servic basic architectur depict figur interact follow gener agent creat entri object send object messag messag messag messag case messag agent expect entri match templat messag forward upward trough hierarchi root point actual object space oper perform level secur polici level appli entri mpi mpi java virtual machin object space figur system polici restrict commun agent secur level extend templat object field secur level sender show class fragment method systemat restrict match secur process string low public request low return public request low return level restrict layer request level interest point client match logic channel kei creat logic commun channel show server special demand task comput factori protocol interact server send request number repli kei server job await request comput factori repli kei includ request return answer client written pair content pair content templat nil repli templat server written templat nil queri templat pair integ content content request repli object pass process hide fake repli replai attack prevent ad nonc relat work work gordon abadi inspir aspect theoret treatment spi extend emploi cryptographi messag channel abadi equat secur protocol messag type correct applic direct relat dynam type languag approach secur process requir access tupl space access repres static type analysi suffici determin process attempt read write tupl space possess approach complement dynam check mobil agent import investig class secur properti verifi static approach role type match process receiv attent recent laura wan servic architectur base share space model reason share space paradigm exploit servic join leav system dynam servic place offer space match request offer request interfac form match type servic subtyp alic type system emploi match interfac investig type infer gener commun implement share object paradigm cite javaspac section mention approach system implement match function share space paradigm coordin mobil emploi agent architectur javaspac design secur issu mind kei emploi protect item tupl encrypt agent execut jvm ineffici gener share space linda integr prolog smalltalk eiffel paper treat languag consid secur issu pose inherit user defin match consid support multipl independ softwar compon cooper mean share object space present model integr notion kei share space model secur enforc suffici emul encrypt semant found model implement java provid care respect inherit show java encrypt object leav environ virtual transfer network store disk refer abadi secreci type secur protocol theoret aspect comput page septemb abadi gordon calculu cryptograph spi calculu fourth acm confer comput commun april acm long version technic report cambridg cardelli abstract mobil comput microsoft linda model languag concurr volum lectur note comput page ciancarini distribu program logic tupl space technic report technic april ciancarini rossi coordin commun java agent vitek mobil agent programm volum lectur note comput page type infer subtyp gener commun object page coordin mobil agent blackboard access garlan proc int conf coordin model volum lectur note comput page septemb berlin calculu mobil agent page gelernt gener commun linda acm tran prog lang jan gelernt multipl tupl space linda proc conf parallel architectur languag europ volum lectur note comput page linda multipl tupl space technic report rr dept comput yale eiffel object orient linda dialect acm sigplan decemb reconfigur hierarch tupl experi technic comput scienc depart institut advanc comput colleg md tupl space commun distribut object orient languag proc acm object orient languag applic page acm walker calculu mobil part ii journal inform sept standard data encrypt standard technic report public feder inform process januari object space decoupl commun proc technolog languag system page method obtain digit signatur commun sun microsystem javaspac specif technic sun microsystem juli activ network symposium oper system design implement octob page oct usenix tolksdorf alic basic model subtyp agent technic report technic tolksdorf coordin java agent multipl coordin languag platform proc ieee workshop enabl infrastructur collabor page june ieee comput societi press tolksdorf coordin languag scienc comput vitek secur mobil experi submit binder design make java safe agent electron commerc object vitek calculu secur mobil comput ieee workshop internet program
HCI/697 4 intern confer pattern recognit interfac visual comput environ molecular biologist rajeev thoma vladimir stephen klau andrew jim michael william humphrei beckman illinoi mathew il abstract recent progress displai virtual realiti technolog made excit interact visual complex scientif data fulli exploit potenti interfac manipul displai cumbersom attach paper describ visual hand gestur analysi speech recognit develop interfac control displai interfac enhanc exist vr visual comput environ molecular biologist free hand gestur manipul graphic displai set speech command describ visual gestur analysi speech analysi techniqu develop interfac dual modal found greatli aid interact capabl introduct tremend progress recent year displai virtual realiti interact technolog lag current interfac involv heavi vr devic deter distract user vr facil fulli exploit potenti vr offer mean visual interact complex import develop mean interact virtual displai commun mode relev manipul physic object hand call hand gestur act grasp explor express idea virtual unlik physic comput control manipul human prefer emploi hand gestur speech psycholog peopl prefer speech combin gestur virtual user interact special support nation scienc foundat electr nation institut health depart energi comput scienc graduat fellowship roi carver trust gratefulli acknowledg train special apparatu user concentr virtual object task hand explor multimod natur hci involv manipul virtual object speech gestur interact desir devic attach user motiv develop techniqu enabl spoken word simpl gestur interact graphic object virtual environ voic command monitor microphon recogn automat speech recognit techniqu hand gestur detect pair strateg posit camera interpret set comput vision techniqu term automat gestur recognit comput vision algorithm extract user hand extract posit distinguish gestur unintent hand movement context context virtual environ place constraint make analysi robust develop command languag attempt optim combin speech gestur input virtual environ testb virtual environ built structur biologist theoret group illinoi call environ simul visual system structur graphic call project system permit multipl user visual interact manipul complex molecular structur process develop understand import properti view simul molecular combin molecular structur potenti benefit system reduc time discov research drug older version system keyboard magnet track pointer interfac inconveni system typic multipl interfac hinder interact natur visual system incorpor voic command control enabl user free keyboard interact environ natur manner hand gestur permit user easili manipul displai model figur visual facil structur research discuss structur complex spatial combin molecular structur integr speech hand gestur interact mechan power mode motiv develop interfac goal minim modif exist program incorpor interfac prototyp built speech hand gestur analysi requir addit environ softwar order reduc complex flexibl program commun layer ad extern program written maintain independ code text languag queri inform send command text languag base tcl script languag capabl script extern program control asr agr program interact method simpl voic left asr convert phrase text command send agr point send command chang current posit vector graphic pointer setup visual gestur analysi facilit develop agr design platform shown figur gestur recognit experi addit uniformli black light arrang shine red light hand distract user main displai setup addit advantag transport easili setup speech analysi prototyp asr system implement integr system consist record recogn unit record emploi memori implement record send output recogn unit block digit volum meter accompani provid feedback user indic accept rang loud recogn develop modifi htk softwar unit perform featur extract figur setup camera gestur recognit synchron viterbi decod input send decod speech directli command sgi workstat process resid command languag order effect util inform input user form spoken word simpl hand design command languag combin speech gestur command languag basic syntax action object modifi action compon spoken object modifi combin speech gestur speak modifi clarifi point speak move hand desir motion desir capabl voic command queri molecul nearest tip pointer make molecul blink select save refer molecul futur voic command convert gestur command rotat chosen command convert translat command deselect molecul user manipul molecul asr agr techniqu made interact speech input asr background integr speech gestur decod user command requir order pace hand gestur defin task detect vocabulari word unconstrain continu speech differ convent continu speech recognit system seek determin optim sequenc word prescrib vocabulari direct map spoken utter recogn vocabulari impli leav room accommod word form extran speech unintend background basi word term keyword spot dictat real world applic real user spoken languag system command support phrase issu absent valid command natur languag dialogu implic robust standard csr system convert simpli ad filler garbag model vocabulari recognit output stream consist sequenc keyword filler constrain simpl syntact network recogn oper mode earli techniqu dynam time warp current approach typic arm statist hidden markov model recent discriminatori abil neural network typic network keyword model parallel garbag model prototyp result keyword tabl list keyword phonet transcript chosen experi command keyword transcript translat rotat engag pick tabl keyword user manipul molecul structur select hand gestur model acoust hmm system base phone word larg vocabulari flexibl environ invari easier inconveni retrain vocabulari chang filler filler model vari filler repres explicitli portion word built parallel combin keyword phonem twelv filler garbag model model extran speech experi state keyword model prior experi model cover broad class basic sound found american english list tabl model provid good coverag english languag amen train thing note class due breviti occurr prescrib vocabulari train data observ vari number model gain spot perform model background silenc includ addit twelv garbag model list model remov explicit endpoint detector model incom signal note descriptor vowel class correspond posit tongu produc vowel sound class symbol vf vm vb cn cw tabl broad sound class garbag model grammar scale factor transit prob factor ae ey ow ey eh ey jh ih ih vf vm vb cn cw exit entri figur recognit network recognit network recognit syntact shown figur keyword parallel set garbag model includ model silenc model null mean model succe model global grammar scale factor transit probabl factor optim recognit accuraci adjust oper point system featur train sampl speech filter prevent speech sampl order digit filter factor block frame ms length shift frame ms frame speech weight ham cepstral coeffici sixteenth order deriv weight factor cepstral coeffici chosen shown robust discrimin linear predict code coeffici log area ratio coeffici normal log energi order tempor regress coeffici includ featur vector topolog hmm garbag model consist intern state emit state state mixtur continu densiti gaussian diagon covari matric iter procedur train train set fifteen forti sentenc develop keyword individu pair remain doubl provid suffici number train token sentenc pair keyword arrang order keyword spoken sixteen time user short record session train garbag extens train sentenc requir provid adequ amount train data twelv broad class cover entir spectrum standard phone subsequ emploi provid initi set bootstrap model retrain perform user record set sentenc commonli command sentenc span scope includ detail set modifi provid data normal exist comput environ note garbag model train experi user short train procedur detail perform test system fifti test sentenc keyword bodi accuraci rang train speaker train speaker refer user train train garbag model consid user support techniqu alarm occur situat user valid keyword word recogn command discuss standard csr convert oper chosen effici proven success pure pass requir spot complet decod task stretch envelop constraint tradeoff resolut model speed execut system balanc alarm rate miss rate garbag model provid resolut opposit occur transit weight individu model posit oper point desir locat note global paramet test emploi defin set weight control oper point addit weight transit garbag research provid effici train procedur discrimin model exist valid keyword handl hand gestur input agr gener agr problem involv analyz human hand high freedom hand gestur understood survei context virtual environ develop set gestur gestur recognit analyz sequenc imag pair camera posit facilit robust analysi hand imag background set uniformli black analysi special hardwar finger pointer agr system consist level subsystem figur level subsystem extract point direct singl camera imag level subsystem combin inform obtain output level subsystem point direct obtain point level subsystem point direct subimag moment centroid major axi tilt imag moment finger segment threshold moment imag segment finger subimag moment major axi tilt centroid figur overview agr system form sequenc oper input imag data imag threshold order extract silhouett user lower arm background imag moment calcul form bound box extract index finger finger segment set imag moment time finger base finger centroid finger direct found point direct final determin level subsystem knowledg setup geometri centroid point direct inform forward central displai manag displai cursor screen posit implement produc track rate frame limit inabl digit hardwar properli handl multipl video signal special hardwar easili improv perform low sampl user achiev reason control displai gestur manipul displai addit recogn point develop hidden markov model base agr system recogn basic set manipul hand gestur figur exampl gestur develop gestur command languag concern manipul control displai molecular structur gestur command categor dynam move move static system imag geometri paramet featur describ hand postur hand transform imag extract forward back grab stop left static gestur dynam gestur figur exampl hand gestur manipul virtual object interpret agr featur transform imag defin sin sin imag geometri moment order denot transform normal respect imag order moment center mass imag higher order moment provid addit inform imag shape set gestur consist static dynam gestur figur recognit system built train hidden markov model specif gestur run gestur vocabulari model singl observ model gaussian mixtur size diagon covari matrix train sequenc perform recognit system good correct recognit perform expect improv model hand exploit multimod discuss discuss interfac report part gener multimod modal exploit make interfac natur effici problem visual gestur interact exploit improv gestur recognit process multimod interact gestur interact gestur virtual interact gestur gaze interact gestur graphic displai interact discuss detail form basi futur work result gestur recognit show simpl imag moment hmm base approach yield reason perform approach significantli effect recognit perform reliabl speed gestur recognit level approach hand motion analysi agr class motion call articul motion analysi track hand predict base articul motion reliabl deriv minim descript hand imag detail hand model predict made hand posit gestur model develop suitabl vector gestur classif recognit aim replac simpl imag moment current implement featur vector defin complic set hand gestur manipul virtual environ paper describ applic comput vision speech recognit techniqu build natur interfac vr spoken word free hand gestur vr setup structur biologist consid develop multimod interfac defin gestur recognit speech recognit problem prototyp interfac present scientist easili natur explor displai inform interfac offer level interact visual incorpor voic command control enabl user free keyboard interact environ natur manner hand gestur permit user easili manipul displai model spatial combin molecular structur integr speech hand gestur interact mechan prove power mode refer hauptmann gestur speech graphic manipul int feb visual molecular dynam journal molecular huang visual interpret hand gestur review technic report univ dec jr continu hidden markov model word spot proc page rc rose db paul hidden markov model base keyword recognit system proc page pavlov multimod framework interact virtual environ human interact complex system kluwer academ imag analysi gener theori moment optic societi jg lr goldman automat recognit keyword unconstrain speech hidden markov model ieee tran
IR/698 5 access inform servic web jerri david richard sri intern menlo usa darpa agent markup languag program aim mark web page mean intend result deliv browser close match intent user syntact orient search engin paper present vision search architectur present set queri complex answer effici semant web describ scenario illustr queri identifi main softwar compon facilit search examin issu infer address procedur servic enabl daml queri languag find web site capabl kei semant web process model introduct queri web todai frustrat activ result deliv syntact orient search engin match intent user problem lack semant structur exploit search process daml program aim overcom problem darpa agent markup languag intend annot web page mean content search engin support appropri web page answer queri extract inform daml ontolog annot web content respect ontolog queri daml annot intend improv search internet paper present vision search architectur outlin softwar compon support advanc research project agenc air forc research laboratori contract permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss author semant web workshop china copyright author enc declar capabl servic procedur web daml queri illustr desir semant present set queri complex express natur answer effici framework concern gener area search obtain public illustr roughli complex requir search process find inform research accomplish keyword common search engin return hit filter find refer paper shoe hendler part web search turn site shoe daml restrict search refer public find refer recent paper shoe jame hendler search engin find refer search find pick recent structur refer date request stanford librari hold copi daniel book search engin deal servic procedur aspect web page password log search book web site execut process request bui copi daniel requir execut addit involv secur concern send credit card exampl motiv concern long term paper illustr requir handl section describ scenario illustr queri process identifi main softwar compon facilit summar softwar architectur search outlin main function compon section examin issu infer search daml process defin queri languag implement infer scenario logic automat theorem prover daml defin map notat final section address issu procedur servic daml term exist model complex process enabl daml queri languag find web site specif capabl architectur queri web queri scenario present flow data control daml queri queri previou section daml ontolog topic built present part process queri detail found properti type type topic declar properti lastnam firstnam type string properti subtop properti fig summar class relationship properti list form list research author lastnam firstnam topic string topic list subtop figur ontolog ad hoc notat daml queri suggest queri identifi concept support search inform research jame formal sri find hendler jame end queri specifi ontolog search inform research cite ontolog firstnam mean expect queri return object properti defin restrict result research object hand search engin queri process queri written daml queri languag search make ontolog inform part queri figur scenario assum web page illustr fig select web page inspect ontolog cite queri match ontolog list namespac web page declar obtain namespac identifi sequenti content web page queri find object search tag select object satisfi criteria note capabl recogn notat hendler queri result research object defin web page illustr fig slightli complex situat web page refer ontolog state queri relat ontolog mean assum web page declar ontolog search web page show ontolog defin term sri research ontolog declar add properti class origin sri ontolog infer web page fig match queri extract ontolog sri figur scenario class tag search properti tag place burden search web page direct indirect refer ontolog queri effici implement map servic call servic ontolog set class properti return map ontolog class properti declar knowledg system lab stanford declar properti declar class contact queri return inform indic web page refer ksl ontolog content mark object answer queri fig illustr situat research person firstnam lastnam figur scenario obviou task map class properti nontrivi simpl map properti daml suggest ontolog defin standard interfac ontolog map ontolog provid complex map oper map kind combin properti class ontolog map softwar modul collect map inform site map ontolog trust issu search engin prefer inform specif site proven reliabl respect map assert trust secur issu orthogon part queri daml queri languag support specif requir complex introduc daml queri user awar refer formal queri leav specif suggest altern consid queri inform research jame formal sri find jame jim end exact believ similar assum exist internet servic deliv commonli consid nicknam abbrevi servic return queri open reli servic sri find hendler jame end intend mean ad hoc notat make servic order determin servic consult paramet jame servic deliv set process queri servic specif kind kei foci research greater detail scenario situat servic web store specialti daml special provid inform specif topic exist servic cach link home page research specif cach relev inform research local public servic obtain inform manipul store high throughput queri infer queri shown differ wai inform repres web call success complex simpl queri complex true initi list sampl requir infer capabl part kind infer answer plausibl queri perform typic task document servic construct languag design web site servic investig background knowledg web site suppli answer theorem prover vehicl experi infer incorpor daml search studi kind process suffic handl daml queri automat theorem implement common tune special exhibit high perform subject domain highli evolv sort structur enabl repres taxonom inform infer consequ quickli facil fast tempor reason answer question prove theorem facil develop deduct program synthesi appli queri answer make link symbol logic symbol emploi procedur execut enabl invok includ web proof progress exampl section express intend languag logic languag daml experi document search kind infer requir answer queri search document phrase queri term ontolog theori develop bibliograph date find base theori develop area read distinguish entiti person refer uniqu individu share peopl distinct ignor troubl relat relat person person variabl rang rang peopl paper refer paper refer kind paper concept explain context queri section find refer recent paper shoe jame hendler queri phrase languag prefer find refer analog relat public refer public author author topic topic ontolog subtop paper subtop accept publish natur year paper found satisfi prefer latest relat relat time interv hold start execut queri find singl paper refer meet criteria public date latest give search time return latest paper found time assum access public descript paper shoe hendler web agent intern confer autonom agent comput repres notat author titl web intern confer autonom agent year publish comput address topic public list logic function make proof trace easier follow refer logic deriv develop mesegu refer paper confer titl titl date address topic notat refer theori base bibtex assum refer shoe paper author titl web intellig web search paper aaai year publish number address topic follow step infer process answer found begin logic sentenc obtain queri answer note refut queri infer proce contradict obtain note logic accompani express indic answer expect obtain proof prefer base includ year public part answer intern notat sort natur number formula answer call omit detail proof public obtain answer answer author titl web intern confer autonom agent year publish comput address topic note refut obtain row proof complet latest begin find public answer queri start addit insist public find recent refut proce similarli time find aaai paper tempor reason base allen tempor check tempor directli queri consequ prefer determin year paper recent paper discrimin basi public month aaai paper satisfi constraint answer author titl web intellig web search paper aaai year publish number address topic continu hendler shoe paper recent time limit return refer paper found obtain list order recent return infer combin capabl multipl web site forgotten rememb work maryland phrase queri prefer infer process consult maryland web page paper find bibliographi emploi limit logic special facil combin theori work jose mesegu connect languag metalog make present theori simpler eleg separ peopl similarli separ citi citi map sort give flexibl syntax abil develop theori modular instanti combin defin access web servic discuss mechan daml facilit discoveri object inform web turn servic basic mechan repres discov interleav relationship make servic web queri section request inform servic web creat human interfac intend softwar agent human consumpt make softwar agent citizen full servic number varieti servic offer effici continu dramat rate web servic includ limit type familiar human queri digit type inform search classif servic provid worth note web servic limit approach commonli servic involv number complex pattern interact transact involv make web softwar agent formal descript mean access import goal establish framework descript made share logic servic author web page provid suffici inform link servic provid web page concept theori ontolog exact match servic symbol author describ logic relationship servic concept theori web site function defin concret data string real function relat theori defin abstract citi independ repres queri necessarili phrase term select web site peopl concret function relat comput web site site comput function return airport local respect distanc citi assum user servic ontolog defin relat hold citi local abstract entiti servic find local airport logic axiom determin airport local citi relat implement ontolog relat abstract relat citi local concret relat comput web site find airport local distanc mile citi appli citi abstract appli concret string real abstract entiti relationship concret string number abstract entiti express function relat ontolog chose repres citi state function citi map abstract entiti abstract entiti york citi map code airport airport servic provid term concept ontolog assert distanc web site citi local airport inform provid addit assert determin distanc citi local abstract distanc independ unit map concret real number abstract distanc mile identifi number web site deal mile commun web site deal exampl show import logic power servic web site sort logic equal phrase assert unsort logic unwieldi write ineffici reason sort prefix assert awkward reason express uniqu valu addit link assert background link queri web site link web site assert time requir travel place limit distanc speed person distanc point equal product differ time speed assert directli refer web handl queri invok web site book flight book determin time requir travel airport ultim destin citi express background assert daml invok assert handl queri import peopl write web page find easi write declar statement describ servic offer web page relat theori write logic write tool translat logic logic languag translat difficult true express languag give effici infer assert equal result effici ontolog describ servic web site emploi set basic class properti declar describ ontolog structur mechan daml provid framework sketch initi basic class properti note refer softwar state softwar act behalf human gener principl daml ontolog servic fundament class properti provid backbon daml servic ontolog refer fundament class properti class expect form coher layer daml gener upper ontolog servic taxonomi servic neutral great concern provid mechan concept number hierarchi construct natur class servic categori taxonomi servic subclass class structur domain applic web site make toplevel subclass thing search recommend fundament properti servic structur ontolog servic motiv provid essenti type knowledg intuit resourc present servic impl ment support lw figur top level servic ontolog wr lw servic requir user provid shown fig type knowledg captur properti class servic properti rang class import properti defin substant properti left defin subclass descend class exist properti appropri repres requir inform class import note logic rule emploi subclass support inferenti reason discuss earlier paper servic profil specif servic requir call view give thing precondit hold servic requir effect expect cost access accept form servic profil meant provid essenti inform potenti user servic matchmak determin servic meet role servic profil analog procedur declar type program schema relat servic profil essenti procedur header servic model specif servic work call view servic type displai inform vari natur servic web site involv number step desir give ship secur input credit card verif credit card final servic model describ share knowledg requir servic provid coordin activ process model essenti describ knowledg expect import subclass base process model develop section servic ground servic support servic spell detail user commun messag transport servic ground typic set specif exchang plai role plai todai standard http form corba ground abstract type exchang data element type servic marshal serial techniqu likelihood result market small set ground wide conjunct daml servic ground declar document detail uri relationship fundament class servic descript semant descript servic servic model varieti servic access wide vari ground spell data type requir servic format commun specif instanc servic object servic give inform agent make newli discov servic servic profil summar servic give extern view provid addit inform determin appropri servic potenti user gener potenti user servic matchmak examin servic profil determin user provid input make examin ground determin compet interact servic provid servic discuss servic model facilit interact sequenc wide varieti typic web site model servic process ontolog content oil base static featur structur arrang taxonomi ideal describ repres complex object bibliographi manner support structur queri queri miss piec ontolog content dynam content servic behavior web provid servic reserv interact secur make appoint doctor servic distinguish object requir repres state world dynam interact servic verb action noun repres servic requir tap process event core theori process event exampl queri queri inform request result action chang state world specif result bui action place librari hold order queri web agent paramet interact ship dynam interact involv intern tempor structur specif action book result shop resourc consum produc lock wai control short cut store profil interrupt cancel interact cancel order continu note bui isol concept integr cluster concept call commerci transact frame commerci transact frame involv concept chang possess exchang parti exchang accept expect commun accept result monei basic includ good good buyer person monei exchang seller person good exchang describ term involv detail identifi ratio quantiti monei quantiti good receiv dollar tempor featur exchang payment spread period differ tender price elabor separ owner good owner monei actual particip exchang arrang develop model structur event support tool agent commun type detail event model control abstract theori event structur major compon tempor structur evolut event set kei state partial order direct graph repres evolut trajectori transit kei state transit stochast hierarch process primit event event ballist continu thai comparison hybrid system model extend treatment semant verb describ resourc interact relat consum destroi support oper shift granular enabl profil frame specif part particip rich theori relat sequenti concurr modifi relat exampl includ abort termin relat semant term structur interact event daml encod process preliminari daml implement aspect core theori process event develop core daml ontolog servic larger collabor effort stanford nokia part daml servic specif languag effort aspect core ontolog basic class implement inform appropri term event class event specif inform includ paramet document read written part execut properti refer noun ontolog ontolog document ontolog ontolog simpl event process effect precondit effect properti event left unrestrict level rang collect unrestrict bag shown illustr sampl exist ontolog complet version found paramet type output particip theori event link theori time develop fairli rich theori time includ theori time interv theori time point vari densiti daml encod start time process point theori durat process interv theori start time process durat process process complex event addit properti respect order condit execut individu event attempt minim set process class special varieti web servic process composit event fundament relat event process pertain expand event underli process correspond process atom event defin oper multiset process involv simultan transfer monei credit card bank good seller defin process bag class subclass rdf bag class multiset event defin complic process process list concurr process multiset subprocess implement algorithm construct execut process model type daml descript dynam content servic model construct automat agent encount specif servic agent model track execut servic request monitor request task perform plan schedul specif servic relat task detail construct algorithm process model environ scope reader obtain detail rich structur core theori servic automat construct algorithm compil execut model provid motiv constraint design interfac servic provid describ servic high level domain specif vocabulari interact environ guid base graphic natur languag dialog build semant ground servic author environ current focu work ongo project address correl set essenti miss compon current state languag author environ describ dynam content servic model requir rich ontolog theori event process crucial enabl coordin activ autonom agent hold true underli context control carri complex obtain inform web enabl intellig context intertwin statu ontolog develop daml declar fundament class properti mention describ servic process latest version found url present vision search describ scenario queri process identifi main softwar compon facilit search examin issu infer address issu procedur servic enabl daml queri languag find web site capabl critic compon languag requir enabl semant web refer specif program rewrit logic sri comput scienc menlo januari green applic theorem prove problem solv intern joint confer artifici page heflin hendler search web shoe artifici intellig web search paper aaai number menlo aaai press theori hybrid automata lic page hendler web agent intern confer autonom agent associ comput machineri manna deduct approach program synthesi acm transact mobil semant web web servic intern workshop semant web semant web servic ieee intellig narayanan action metaphor aspect phd comput scienc eec california narayanan reason action narr understand sixteenth intern joint confer artifici intellig morgan kaufmann chaudhri guid sri artifici intellig menlo
DB/699 3 algebra process semant contextu net roberto dipartimento di universita di dipartimento di universita di abstract show net monoid approach initi mesegu montanari extend ordinari petri net contextu net suitabl monoid place algebra net concurr comput provid cover collect individu token uniformli coincid classic petri net absenc introduct basic featur common petri net essenti state abstract action involv coordin local part consum resourc fresh resourc comput abstractli partial order event event causal depend execut resourc provid concurr happen affect independ subsystem featur make net model suitabl repres satisfactori concurr distribut system interdisciplinari applic mesegu montanari success recast fact algebra term properti net comput concurr net model underli idea net monoid approach lift algebra structur state level distribut resourc reflect perform analog rewrit logic structur transit system tile logic case ordinari petri net state multiset element free commut monoid set place comput comput origin state yield comput concaten research support cnr integr project la la di sistemi di esprit work group murst project ordin superior comput possess natur oper composit rise categori arrow ident repres token lift monoid structur state categori comput result monoid categori law monoid tensor product express basic fact true concurr model comput rel order concurr action execut immateri comput origin lead id id tensor product concurr composit origin multiset union oper sequenti id id idl compon id id extens pt net rise school thought semant interpret main distinct drawn collect individu token philosophi collect token philosophi interest distinguish token place instanc token token origin carri causal inform consum instanc make differ causal depend previou event point view individu token philosophi causal depend form essenti inform discard flow analysi concern causal depend influenc concurr abstract lead concurr semant ordinari pt net algebra approach pursu kind net rang devil commut process support concaten process strongli concaten process support note reli tensor product commut monoid natur isomorph algebra approach requir special mechan order accommod lift monoid structur state worth mention algebra approach complet straightforward recent state base string multiset point approach initi mesegu montanari complet gener appli gener net model token kind complex data extens basic pt net paradigm consid literatur express power give exist phenomena paper extend net monoid approach contextu net motiv idea read resourc consum provid model multipl concurr access resourc ordinari pt net read render figur unwant sequenti concurr read contextu pre transit resourc enabl affect fire contextu net found applic transact serializ concurr constraint program asynchron system independ contextu net approach differ context read net figur place repres token black transit direct weight context undirect weight unari weight semant interpret transit fire concurr basic assumpt token read consum step concurr step basic assumpt start read context action place find interpret fulli convinc end state reach fire sequenc basic assumpt fire durat lead explicit event fire start concurr step ft hypothesi start context transit consum concurr step forbidden follow interpret fit understand context contextu net collect token philosophi algebra theori pt net develop relationship algebra logic interpret clear start classic comput model petri net follow commut process devil reconcil fire step express nice concurr model admit exact algebra mean construct yield strictli symmetr strict monoid categori categori pt net pt net object mark arrow correspond commut process semant contextu net receiv poor attent concern algebra treatment problem simpli address discrep semant ordinari pt net easili extend diamond fire sequenc contextu formal good algebra model straightforward inspir suggest made mesegu give satisfactori treatment issu idea monoid categori commut tensor product differ case pt net monoid place regard token atom lack emit particl track assum repres atom particl environ replac context arc arc give axiomat construct monoid categori arrow standard mark neg concurr comput net kei ingredi result hold maximum share axiom express concurr read share fundament idea contextu net individu token philosophi build notion process introduc author shown semant net understood term symmetr monoid tensor time denot commut monoid natur isomorph call symmetri strictli symmetr monoid categori transform simpl variat process call concaten process introduc admit sequenti composit yield symmetr monoid categori net note commut object refin version concaten process strongli concaten process origin destin total order order origin destin concaten process index unfold semant give denot interpret interplai causal nondetermin contextu net process unfold approach studi give satisfactori understand comput model introduct asymmetr event structur algebra pursu recent paper montanari categori basic idea addit auxiliari constructor duplic token match place auxiliari arrow ad comput model suitabl figur id id ident arrow symmetri swap token replac transit consum read produc consid deriv transit read consum model duplic fire transit concurr idl copi match idl copi produc token arrow id illustr figur multipl concurr access achiev produc duplic absorb match copi context suitabl axiomat duplic matcher introduc prove repres faithfulli basic fact concurr step share execut concurr interleav order notic differ notat term id id illustr figur consum read produc id id figur admit normal form subterm execut illustr figur main drawback approach initi model arrow order obtain biject contextu process carv suitabl subcategori arrow subcategori inspect lack global correspond weaken framework aim improv approach start observ unwant arrow due redund inform model context token read transit token connect duplic appli match express concurr add inform introduc inconsist behavior token place duplic match copi token copi evid result arrow id meaningless comput token repres context overcom problem extend approach part paper kei regul symmetri mark forbid swap adjac prevent migrat electron atom happen absenc electron migrat sort dual maximum share call exact share hypothesi restrict simpli omit symmetri model reintroduc fact result redund framework perfectli analog provid categori observ yield monoid categori formal symmetr select commut explicitli includ select symmetri symmetri standard mark token exclud lead causal histori token main result arrow standard mark biject slight refin contextu call concaten contextu process crucial model treat particl wai depend context distinguish similarli identifi particl gener content exact share formal axiom call origin structur paper paper build work report extend loc cit detail exampl proof main improv treatment respect reli distinct forward backward realiz kind addit differ result phrase term strongli concaten contextu process axiom instrument introduc section recal basic contextu net algebra semant pt net section defin algebra semant contextu net provid origin result commut concaten contextu process remark absenc semant coincid classic preliminari contextu net contextu net introduc extend pt net consum oper state contextu net call mark repres distribut resourc type repositori set place mark multiset denot number token place carri set finit multiset free commut monoid denot multiset differ union defin natur number multiset denot underli set multiset definit contextu net tupl set set pre context function usual assumpt disjoint transit assum set minimum amount resourc requir enabl retriev read left repositori accomplish return fresh token context point transit consum token context concurr definit finit multiset transit contextu net evolv step symbol transit concurr enabl step sequenc sequenc execut step requir mark token precondit transit token place context transit match intuit token context transit time point view fact transit execut step mean execut order ordinari pt step sequenc contextu net consid induc diamond transform relat defin step suitabl diamond transit sequenc concaten closur relat definit contextu net strictli symmetr strict monoid categori contextu commut process ct mark step modulo diamond composit sequenc concaten figur situat comput commonli term structur repres causal relationship event occurr case fruitfulli formal notion process remark notion conserv extens notion ordinari pt reduc absenc relat montanari nondeterminist contextu process refer definit preorder written figur figur definit contextu process net acycl wrt contextu net set pair remark argu contextu process net illustr figur transit fire inhibit case net descript determinist interpret execut causal depend tempor mean causal tempor transit determinist occurr net call concurr relat causal tempor depend remark definit appli nondeterminist concurr relat defin arbitrari set transit pair definit contextu process contextu net consist contextu process net pair function hp sn respect target contextu process consid isomorph denot compon petri net monoid paper built monoid structur mark provid algebra concurr comput net basic idea lift structur state level provid algebra concurr fire step sequenti concaten order express complex comput sequenti composit endow comput categor structur mark comput idl token ident parallel composit yield tensor product interplai parallel sequenti regul tensor model basic fact concurr transit occur rel order tensor product simpli commut pt net freeli gener strictli symmetr strict monoid categori arrow biject commut process situat complex model causal multiset transit mesegu montanari simpl mark tensor product commut collect arrow explicitli chang order transit fetch produc token collect compon natur turn classic notion symmetri categori lead construct symmetr strict monoid categori net arrow defin concaten process concret introduc order remov defici previou approach main featur captur strongli concaten object string multiset token reader briefli recal definit monoid categori relat concept denot ident arrow object id composit arrow oper diagrammat denot object arrow denot ordinari cartesian product categori definit strict monoid categori tripl hc underli functor call tensor product object call unit tensor product satisfi associ law constant functor neutral id id monoid associ unit law satisfi suitabl natur isomorph strict monoid adject omit simplifi terminolog tensor product commut suitabl natur monoid categori call definit symmetr monoid categori hc hc ei monoid categori natur isomorph satisfi coher axiom express id id id object note equal id fact axiom ident natur tensor product commut categori call symmetr arrow symmetr monoid categori obtain sequenti parallel composit ident symmetri call permut rang definit hc ei hc monoid categori functor call strict monoid omit term monoid functor categori monoid categori monoid functor commonli denot full subcategori strictli symmetr monoid full subcategori consist monoid categori set object freeli gener commut monoid ct belong definit hc gi hc symmetr monoid categori monoid functor hc ei hc symmetr denot subcategori object symmetr monoid categori arrow symmetr monoid functor full subcategori consist monoid categori set object freeli gener monoid commut collect context mesegu suggest repres context rewrit logic theori kind entiti copi record number copi counter copi access context rewrit retriev counter copi counter copi case contextu data type place modifi figur term form place natur transit precondit context postcondit rewrit rule copi fit approach algebra structur basi mesegu encod successfulli extend deal explain build algebra theori monoid place commut monoid oper unit oper axiomat figur omit usual commut unit axiom monoid homomorph law observ call rang element algebra set denot set molecul gener law elimin consecut applic sequenc write shorthand appli time omit assum remark gener lemma molecul proof induct appli law proposit molecul proof law lemma corollari molecul interest molecul gener comput point basic context carri nucleu produc token ticket roll unbound number ticket reader ticket return consum retriev entir includ ticket definit contextu defin categori object molecul arrow gener rule figur modulo axiom strictli symmetr strict monoid categori figur id figur id id id figur contextu commut process algebra theorem categori ct isomorph monoid full subcategori object import properti proof call maximum share express proposit core contextu show token place find comput token context token place complet interchang context proposit molecul proof corollari commut appli time proposit result prove theorem technic lemmata lemma molecul factor uniqu hm distinct place proof normal form observ monoid homomorph distribut law reduc molecul place electron nuclei proposit simplifi express form nucleu present present simplifi express nuclei electron refer place lemma corollari corollari appli corollari lemma sourc arrow factor lemma proof straightforward observ invari gener rule figur lemma arrow id id id transit proof structur induct express denot complex case appli sourc target appli induct hypothesi readi prove main theorem proof theorem start defin functor gener step sequenc length gener arrow ct defin assum place step enabl notat id id id id note token context place yield idl nucleu notic result ident figur show map show respect diamond uniqu determin easili definit tensor product show faith suffic observ axiom potenti break properti induc equal tensor product correspond diamond show full full subcategori object gener arrow show exist step sequenc ct map lemma sequenti composit transit parallel show obviou fire sequenc execut emploi lemma fact observ construct defin net figur basic arrow repres commut contextu sourc target element remedi put environ instanc id id concurr execut share context written id electron idl nucleu id id id id id id execut order interest observ causal inform token consum read read fact id id appli id id id commut appli opposit direct equal id id id id proposit commut id id execut concurr fashion possibl distinguish case causal depend pt net contextu net case commut contextu process ordinari commut process theorem obtain corollari corollari pt full subcategori remark construct shown easili extend deal multipl case multiset individu context maximum share hypothesi creat obviou problem deal entir point recogn electron emit token ordinari pt inform causal recov algebra set symmetr strict monoid introduc symmetri control rearrang token process sequenti composit level state view standard mark index collect order token resort state element free monoid string level comput tensor product commut interpret canon correct flow causal token histori attempt uniform extens treatment previou section view introduc symmetri molecul problem solv context model transit context concaten depend execut spuriou causal depend rise wrong semant model follow molecul electron inform electron figur axiom consum molecul canon interpret molecul respect intuit fix initi commut monoid oper molecul molecul view interpret connect electron invari comput origin composit molecul form larger state idea associ electron incomplet nucleu present electron ion electron rightmost interpret electron leftmost ion good explain view ion open electron close ion open interest balanc unbalanc express complet parallel composit yield balanc term complet order nuclei electron kind place express relev monoid oper commut situat particl term nuclei state give rise causal histori transit read particl call rang mark algebra illustr includ set axiom formal ident figur extra axiom deal restrict commut set write set complet axiomat shown figur note law analog molecul appli nucleu immedi left final kei ingredi construct abandon symmetri monoid categori involv step similar brought strictli symmetr symmetr monoid categori adjoin symmetri omit symmetri migrat electron atom atom build construct intermedi id figur id id id id id figur pt net commut monoid commut mark symbol monoid oper definit contextu monoid categori object arrow gener rule figur symmetri arrow modulo axiom strict monoid categori figur gs id id id id id transit permut id id note introduc symmetri particl flow nucleu start appli hypothet arrow id reach nuclei exchang problemat appli arrow id token nucleu forc ident electron natur leav free electron migrat invari electron nucleu determin disciplin proper nest open close absenc symmetri maintain invari law classic law slightli gener deal nuclei electron law analog axiom pt net law electron freeli move atom kind law origin central develop symmetri distinguish electron nucleu obtain notion comput concret captur algebra notion contextu process axiom care identifi illustr establish result refin contextu process order concaten similar case lead introduct order token sourc target process yield notion concaten contextu process definit contextu concaten contextu process tupl contextu process underli contextu process net partial order minim maxim place impli minim place maxim concaten process isomorph condit definit ensur order place instanc place place order total contextu net figur basic arrow transit arrow built arrow ident symmetri arrow id analog arrow id prove arrow identifi id id id id law id symmetri ident id replac id express id id id id law id note fact concaten contextu process start involv fire fire repeatedli appli law id id id id mean order electron read import provid origin nucleu concaten process pt partial oper sequenti composit defin provid target process coincid sourc process merg maxim place minim place order definit concaten contextu process contextu net set minim place set maxim place iff concaten union composit defin hypothesi merg place parallel composit process consist disjoint union extend order minim maxim place belong shown oper concaten contextu process form arrow strict monoid categori cp symmetri defin process place suitabl order place minim maxim symmetri make cp symmetr monoid categori definit concaten contextu process call elementari transit definit contextu net transit elementari concaten contextu process ki iff ki iff note place minim maxim order reli basic assumpt set proposit elementari concaten contextu process obtain suitabl elementari concaten contextu process transit proposit concaten contextu process contextu net obtain sequenti composit elementari concaten contextu process proof analog statement ordinari pt proof induct number transit process net proposit theorem categori cp isomorph symmetr monoid full subcategori object element prove main theorem technic lemmata state properti arrow start extend properti molecul framework lemma proposit place proof proof proce induct base case directli law induct assum properti valid prove induct law law conclud proof corollari place lemma form lemma proof suffic prove properti simpl case exploit provid lemma appli law note previou gener necessarili mark state invari decomposit properti arrow lemma id id proof simpl case symmetri lemma id id proof lemma proposit id id id permut sequenti parallel composit symmetri transit proof structur induct complex case id induct hypothesi id id id id id id id id id id id id id id id id id id hypothesi trivial id id id main law extend gener arrow rightmost electron belong nucleu arrow corollari id id id corollari proof consequ proposit lemmata lemma id id transit id permut mark proof decomposit lemma fact sourc electron belong closest ion left electron nucleu type greatest index electron type attach nuclei appli law id id read argument sum natur id id id fact symmetri express defin involv swap token electron natur id id id id id id id id thesi proposit id id id transit proof proof exploit decomposit provid proposit appli time result lemma readi prove main result section proof theorem start defin monoid functor ident object proposit functor complet determin defin map elementari map classic elementari process transit id remain prove full full subcategori object faith fact defin mean decomposit process term elementari process map arrow correspond show order event process consist order event yield arrow suffic show decomposit process concurr event execut consecut order fix decomposit concurr event execut order map arrow proof easi tensor event share context axiom process ident process mark process permut id id ident process mark occurr share context necessarili set token read process suitabl permut id id idl process id id idl process id id prove decomposit map arrow show complet proof shown figur briefli comment critic step exploit axiom fact symmetri electron token ident transform step appli natur symmetri subexpress order match sourc target compon observ id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id figur proof step axiom transform step appli tensor product step appli tensor product subexpress order previou step axiom reduc step appli natur symmetri expand step axiom fact symmetri electron ident transform subexpress fact full proposit id term repres simpli inspect axiom defin choic number transit transit occur term obtain rewrit axiom definit correspond transit proce induct number transit prove isomorph process base equal simpli permut induct fix decomposit proposit id id id argument similar emploi establish work opposit prove step transform normal form select mimick written induct conclud isomorph process easi prove fact arrow comput advantag present approach respect categori arrow model categori pure concaten process distinguish sourc inspect construct conserv extens ordinari concaten process semant corollari pt full subcategori present axiomat improv sensibl construct present monoid object make redund idea instanc transit relat axiom exact share hypothesi found satisfactori formul term law particl conclud remark futur work build import suggest mesegu shown extend algebra semant pt net contextu collect token individu token interpret construct reli choic monoid element call molecul case collect token work extend mesegu identifi maximum share hypothesi fundament law collect contextu process kei transport idea individu token philosophi symmetri monoid select symmetri consist comput interpret term concaten contextu process axiom exact share provid regul interplai ingredi work level singl approach extend construct categori net restrict analog literatur acknowledg jose mesegu paolo interest discuss topic read preliminari version work refer model concurr contextu petri net graph grammar phd dipartimento di universita di montanari event structur semant contextu asymmetr event structur proc foundat softwar scienc comput vol lect note comput pp devil sequenti concurr behaviour petri net theori theoret comput tile logic synchron rewrit concurr system phd dipartimento di universita di comparison petri net semant collect token philosophi proc asian comput scienc vol lect note comput pp semant petri net individu token philosophi proc confer categori theori comput vol elect note comput page elsevi algebra model contextu net int coll languag vol lect note comput pp busi sequenti semant contextu net applic theori petri vol lect note comput pp busi petri net read analysi applic process calculi phd dipartimento di universita di christensen hansen colour petri net extend place test arc arc int conf applic theori petri vol lect note comput pp montanari algebra semant structur transit system applic logic program theoret comput montanari axiomat net comput process proc symposium logic comput pp ieee comput societi montanari axiomat algebra net comput process acta process semant petri net partial algebra proc int conf applic theori petri vol lect note comput pp uniform approach petri net proc foundat comput vol lect note comput pp montanari axiom contextu net process proc intern colloquium vol lect note comput pp montanari tile model languag essai honour robin mit behaviour petri net inform semant net inform condit rewrit logic unifi model theoret comput mesegu rewrit logic semant framework progress report proc intern confer concurr vol lect note comput pp mesegu montanari petri net algebra foundat net theori proc symposium logic comput pp ieee comput societi mesegu montanari petri net monoid inform semant petri net math struct comput pc rewrit logic unifi framework petri net submit volum montanari rossi contextu occurr net concurr constraint program graph transform comput vol lect note comput pp montanari rossi contextu net acta ca petri mit phd institut fur petri introduct monograph theoret comput scienc model system share resourc petri net phd dipartimento di universita di axiomat algebra petri net concaten process theoret comput axiomat categori petri net comput math struct comput rj van gd plotkin configur structur proc symposium logic comput pp ieee comput societi vogler effici asynchron system read arc petri net proc intern colloquium vol lect note comput pp vogler partial order semant read arc proc int symp mathemat foundat comput vol lect note comput pp event structur proc advanc petri vol lect note comput pp
Agents/700 1 negoti incomplet uncertain approach model oppon vassileva depart comput canada abstract applic softwar agent made radic chang busi consum consum transact place agent negoti import aspect bring satisfactori agreement busi transact approach negoti context distribut multiag peer support student person agent model student prefer negoti behalf acquir resourc agent model negoti person agent mean influenc theoret tool cope uncertainti inher dynam market agent creat model oppon predict oppon action carri experi compar negoti mechan influenc addit model oppon simpl heurist approach base result show advantag disadvantag negoti mechan introduct advent onlin busi popular place onlin make payment electron find inform product vendor easier comfort brought human involv import process make phase bui sell negoti kei factor commerc involv lot make tradeoff factor agent technolog consum support negoti strategi practic applic assist user negoti busi transact involv negoti settl suitabl price parti negoti individu organ make vari natur attain object benefit dynam negoti price resourc alloc consum valu fix price advanc negoti vari durat complex depend domain applic negoti protocol extend long period disadvantag consum basic ingredi negoti process correct anticip side action open multi agent system system agent ad hard predict state environ system element uncertainti particip negoti mechan util element human behavior process negoti anticip parti action risk attitud monei negoti mechan paper develop part peer system call negoti find deal user independ requir topic plai role helper topic onlin multiag system student matchmak servic find onlin human time consid differenti trade monei student class agent contact central matchmak agent onlin requir resourc rank list potenti helper standard mark price calcul base difficulti topic number knowledg user topic line moment agent person request start negoti agent potenti helper list price case payment rate unit deal made agent inform user knowledg user chat window open side session start agent fail achiev agent person seek start negoti agent list similarli kasbah negoti problem model seri disconnect negoti problem person agent form econom societi design motiv student knowledg fellow student receiv payment cyber evalu trade term gift certif mean agent make behalf user price offer price strike deal depend user urgenc current import monei risk behavior agent negoti reduc burden user case concentr work make deal order make reason user agent consult user prefer model model initi user updat receiv feedback agent success rate negoti negoti mechan paper restrict intang good gener market domain approach base agent make ration choic show agent benefit theoret approach system environ dynam agent repres real hard predict action oppon agent basi past behavior user prefer chang model oppon behavior predict oppon reaction relat work earlier work negoti dai concern bring cooper coordin distribut node improv global effici system goal inform system central applic area negoti includ meet task resourc alloc subcontract network search techniqu improv effici negoti research studi negoti theoret perspect find agent react interact game theoret approach negoti mechan base human negoti case base argument techniqu work agent negoti behalf market place consum consum negoti focu negoti studi market perform search negoti strategi save user time lift burden inform studi impact negoti mechan outcom negoti focu autom negoti success negoti essenti negoti parti awar move past research histori negoti learn oppon approach work agent interact static particip histori negoti learn oppon effici environ dynam approach model learn oppon strategi model environ system studi effect negoti bayesian belief updat mechan appli updat belief agent environ oppon agent negoti determinist finit automata model oppon strategi game theoret approach stochast model markov chain captur environ factor influenc expect util negoti agent model approach base reinforc learn model agent order adapt market system agent repres real user negoti behalf requir negoti transpar user word denot agent dont impli necessarili adversari strongli competit negoti account prefer approach appli payoff matrix size grow exponenti number hard find equilibrium point strategi game theoret approach appli theoret research strategi work area appli practic market base system game theori assum aim situat negoti mechan base sequenti make agent util prefer model user user prefer model built assess util function incorpor user risk attitud deal risk attitud import featur make research account risk attitud work util principl game theoret situat determin person make concess util risk attitud discuss section work make negoti process model influenc diagram influenc diagram bayesian network extend util function variabl repres influenc diagram solv comput action yield highest expect util influenc diagram appli model make process context agent negoti chose influenc diagram negoti bayesian network flexibl tool construct consid causal impact event suit forecast influenc diagram develop make view negoti problem requir weigh prefer perform action maximum util influenc diagram serv good tool problem solv intuit understand user bayesian agent repres human understand import factor unlik influenc diagram grow suppress minut detail ideal overview complex problem model oppon action probabilist influenc diagram model oppon negoti game theori dai agent carmel learn explicit model strategi gener expect behaviour vidal studi impact agent model inform economi agent reinforc learn model agent probabilist influenc diagram infer prefer oppon negoti mechan negoti iter process agent make offer base prefer user model negoti model base sequenti make base provid effect method organ domain problem structur structur tool influenc diagram effect effici repres negoti context model mean captur natur identifi import object gener altern action model account uncertainti repres quantit inher uncertainti practic environ model support dynam situat model deal multipl object tradeoff area cost model chang belief likelihood uncertainti chang prefer negoti protocol straightforward iter process make offer negoti agent offer state repeatedli final state accept reject similarli denot agent iter depend prefer model model agent final back order negoti process start negoti mechan account prefer depend domain negoti context prefer maximum price buyer urgenc demand resourc urgenc seller current work interrupt order import agent attach user risk behavior incorpor util order model valu outcom object agent system buyer seller util buyer seller action reject vari risk behavior import note agent risk behavior consid paper overlap monei import literatur entiti consid tightli case necessarili true monei import entiti set independ user user prefer risk behavior user instruct person agent price offer made person offer accept price offer person accept minimum price offer paper refer person agent user refrain counter fear lose calcul util valu action altern agent time negoti util action depend monei seller buyer pai util action vari risk behavior user shown figur util accept offer buyer slower differ offer price prefer price mean long price oppon closer prefer price accept growth util continu util continu grow fast risk hope price lower prefer price fig variat buyer risk behavior affect increment decrement buyer seller urgenc current task high import monei start offer price low compar maximum price user pai buyer start low price lowest price seller util accept offer monei minimum price function agent offer buyer seller defin buyer offer price δ offer price δ util prefer seller offer price δ offer price δ market price provid matchmak calcul base current situat market topic difficulti provid measur actual worth resourc buyer seller valu δ exce prefer δ determin offer buyer urgenc urgent risk seek δ risk δ seller urgenc urgent risk seek δ risk δ log influenc diagram condit node repres uncertainti parti figur outcom node probabl oppon state reject agent environ agent state oppon equal step agent reject calcul maximum expect util repres choic node influenc diagram practic applic negoti multipl object involv tradeoff made factor affect account affect action made node oppon action consid condit experi treat outcom oppon node equal experi replac equal likelihood oppon action outcom model oppon probabilist influenc diagram monei import model oppon urgenc util fig influenc diagram model risk attitud oppon action ideal assum cooper environ negoti parti full knowledg oppon case agent trade commerc hidden intent assumpt user share prefer user order deal situat oppon deploi model oppon probabilist influenc diagram model oppon dynam environ market place situat chang time buyer seller enter leav costli agent creat maintain model particip environ agent prior knowledg round offer made agent start oppon move predict reaction make import note agent model figur show probabilist influenc oval node condit node determinist condit probabl distribut condit node outcom assess basi offer probabl distribut oppon action node calcul perform reduct node perform arc monei import node oppon action make monei import node remov diagram condit probabl distribut calcul condit predecessor node inherit similar diagram simplifi arc oper node final probabl distribut oppon action node move oppon match predict updat rule updat inform inform probabilist influenc diagram refer urgenc price fig probabilist influenc diagram oppon action evalu influenc diagram probabilist influenc diagram case number node small complex problem number node negoti ineffici experi compet oppon action risk attitud monei import goal evalu test perform negoti mechan term qualiti deal agent make user model oppon bring benefit negoti order answer compar deal obtain agent approach theoret model deal obtain agent ident circumst negoti approach negoti behalf account prefer number prefer combin combin user prefer helper test combin prefer prefer price interv negoti overlap wide session denot prefer price overlap wide overlap prefer price experi carri simul setup assumpt relat issu negoti price unit time session occur matchmak parti standard price calcul central compon base difficulti topic agent user begin negoti agent user top list helper agent agent system start negoti process agent make offer depend user risk attitud decai function function depend monei import urgenc work agent offer price agent stai rigid increment decrement seller price greater previou offer buyer price previou negoti session agent ensur exce prefer price limit set user maximum price buyer minimum price compar negoti approach approach agent dont theoret approach negoti parti make offer make increment decrement fix amount base differ prefer price correspond case fair trade agent reveal prefer price strategi agent immedi price averag prefer price agent agent win approach agent influenc diagram model chanc node oppon action probabl oppon action equal model oppon approach agent account model oppon explain section experi show negoti parti percentag reject negoti tabl interpret neg percentag fail negoti view mean agent reject deal accept expect reject happen session overlap prefer price interv negoti seri experi made investig influenc negoti mechan qualiti deal achiev prefer helper constant configur session negoti approach agent chang negoti approach experi carri set user prefer session depend prefer price deal point view helper seller depend agent negoti result tabl show theoret approach model oppon bring qualiti deal case larg prefer price overlap approach scope negoti agent approach advantag posit step model oppon agent start negoti disadvantag posit tabl reject configur column describ negoti approach agent mean seller buyer approach total reject reject helper gurat reject tabl comparison percentag deal achiev strategi left part tabl show deal achiev switch part show percentag deal achiev helper seller switch strategi case comparison viewpoint deal deal deal case comparison viewpoint deal deal deal open environ approach negoti model oppon proven yield good deal paper present negoti mechan util model account prefer risk behavior user model account handl tradeoff factor affect negoti appli domain extend negoti mechan creat model repres probabilist influenc diagram result show mechan find deal agent space negoti implement negoti mechan person agent repres human user virtual market environ peer work partial support nserc project refer learn model intellig agent intern confer multiag negoti task decomposit alloc partial global plan distribut artifici intellig morgan san california ration behaviour bargain equilibrium game social situat cambridg agent bui sell commun acm learn model agent influenc seventh intern confer user advantag strateg multiag contract intern confer agent system commod trade iter doubl auction annual confer autonom fox constraint direct negoti resourc alloc distribut artifici volum morgan san ca probabilist infer influenc diagram oper research evalu influenc diagram oper research resolv goal conflict negoti seventh nation confer artifici deter grant approach design le line impact nest agent model inform economi intern confer system benefit learn negoti fifteenth nation confer artifici cooper conflict resolut negoti autonom agent cooper domain ieee transact man negoti task share autonom agent cooper domain eleventh intern joint confer artifici intellig
AI/701 2 pe ua intellig switzerland phone fax internet em algorithm appli kernel pca perri septemb research report em algorithm appli kernel pca perri septemb abstract kernel princip compon analysi recent method featur extract appli kernel pca data set pattern requir store nding eigenvector kernel matrix paper describ algorithm standard pca adapt kernel pca store kernel matrix result em kernel pca extract featur data set exampl extract featur lead good perform data linear classi er em algorithm pca present shown speed learn process introduct princip compon analysi popular techniqu featur extract pca featur extract amount linear project data princip subspac natur motiv develop variant pca local approach tip bishop mixtur princip compon analyz combin number local pca model global approach develop perceptron minim reconstruct error kung princip curv stuetzl disadvantag mixtur global approach requir optim techniqu object function local minima pursu di erent approach make pca kernel function pair point data space kernel function satisfi mercer correspond map data featur space map dot product space mean linear algorithm data form dot product made replac dot product kernel function calcul crux enabl work featur space map data kernel trick appli fisher discrimin analysi al pca al coin kernel pca base formul pca term dot product matrix covari matrix make extract featur kernel function solv eigenvalu problem pca interest properti kernel pca number extract compon exce dimens data space bound number exampl kernel pca appli al charact recognit problem featur extract input linear support vector machin obtain result competit result obtain svm illustr kernel pca capabl extract interest featur idea kernel pca brie recal section standard method solv eigenvalu problem store entir kernel matrix larg number exampl increment em algorithm pca allevi store kernel matrix make kernel pca tractabl larg data set em algorithm pca brie section applic em algorithm kernel pca involv adapt standard formul kernel pca section develop independ similar approach goal appli hebbian learn rule pca kernel result enabl obtain rst result kernel pca data set section kernel pca illustr extract featur train simpl linear classi er result data set obtain model em algorithm pca part data build gener approach neal hinton em applic pca experi section illustr algorithm give factor paper conclud discuss relat work reader refer detail result em kernel pca kernel pca standard formul pca covari matrix data pca carri dot product fact literatur sirovich al fx data set exampl dimens map featur space map data matrix repres data compact standard pca base nding eigenvalu orthonorm eigenvector covari matrix featur xx interest dot product matrix size call kernel matrix ij kernel pca base fact correspond eigenvector fv eigenvector fu eigenvalu xu scale normal eigenvector princip eigenvector covari matrix map data lie span train data short proof appendix direct consequ correspond perform kernel pca featur extract term kernel function requir determin orthonorm eigenvector eigenvalu project point princip eigenvector featur space de ned kernel pca correspond linear pca featur space properti pca map featur extract data space contour line constant project princip eigenvector data space illustr toi origin paper al consist gaussian cluster figur polynomi kernel extract rst princip compon linear pca polynomi kernel contour line straight higher give idea structur data region data point found kernel pca requir solv eigenvalu problem kernel matrix show increment em algorithm pca kernel pca store entir kernel matrix gener case calcul reformul includ center data calcul explicitli al eigenvector eigenvalu di erent figur toi gaussian cluster data point gure show rst princip compon order eigenvalu extract kernel pca polynomi kernel contour line level constant princip compon toi data al script gener found linear pca contour line orthogon eigenvector increment em algorithm pca simpl ecient em algorithm pca deriv tip bishop root algorithm lie probabilist interpret pca speci linear latent variabl model close relat factor analysi latent variabl model speci es probabilist latent variabl relat observ variabl assum data paramet denot multivari gaussian distribut covari matrix tip bishop show model solut global maximum likelihood exist stabl maximum likelihood surfac maximum likelihood solut gener matrix span princip subspac model coin probabilist pca lead proper densiti model solut involv comput sampl covari matrix ecient em algorithm updat paramet comput complex em iter eigenvector recov explicitli bishop interest featur extract densiti interpret densiti model make varianc end em kernel pca em algorithm standard pca wx extract princip eigenvector linear project data current guess princip valu latent variabl correspond solut problem minim reconstruct cost data formul em algorithm easili transform increment version store entir data set accumul sum cycl data set updat gener matrix data set storag requir result algorithm algorithm ecient term comput complex term storag gener converg fast princip advantag respect method increment pca base neural network model converg slowli learn rate paramet speci ed adapt kernel pca prerequisit em algorithm pca appli data set covari case kernel pca data set time calcul explicitli kernel trick rst problem idea empir kernel map al empir map map data featur space space size motiv fact eigenvector lie span map train data empir kernel map project data point subspac span enabl calcul relev subspac form orthonorm basi dot product space ordinari dot product nice thing case kernel pca ignor argument show idea perform linear pca empir kernel map diagon covari matrix matrix de nition kernel mean covari matrix empir map data nk diagon nk kernel pca show matric eigenvector fu eigenvalu relat eigenvalu nk normal eigenvector fv covari matrix data divid figur illustr di erent wai kernel pca fx diagon diagon fu fu fu princip figur schemat overview kernel pca upper halv describ standard kernel pca section lower halv describ empir map solut section diagon covari matrix increment em algorithm pca appli directli map data easi adapt algorithm kernel pca correctli account center data increment mean appli empir map data point time store kernel matrix comput complex increment em kernel pca extract princip compon add calcul map data iter compar standard kernel pca extract princip compon extract limit number compon huge data gain comput complex experi toi data rst compar algorithm kernel pca toi data set figur experi toi data set consist investig complex method kernel pca scale size data set figur complex measur oat point oper matlab flop function number data point gradual method kernel function radial basi function kernel standard kernel pca scale number data point due diagon matrix consid upper bound method extract compon method cubic method scale quadrat similar complex increment em implicitli restart batch em algorithm ecient increment variant kernel matrix calcul increment method time empir kernel map calcul main advantag increment em respect reduct storag requir method kernel matrix increment em storag requir concern respect converg em algorithm kernel pca converg global minimum number iter number data point figur rst princip eigenvalu eigenvector monitor eigenvalu found method dot product eigenvector expect orthonorm vector data typic applic standard pca includ data compress reconstruct applic kernel pca problem activ research topic al problem outcom kernel pca featur extract lie featur space data space limit simpler evalu em kernel pca em em kernel matrix number data point number flop figur comparison method kernel pca toi data figur vari number data point number op calcul rst eigenvector eigenvalu method compar standard kernel pca matlab function princip standard kernel pca matlab function princip compon iter implicitli restart em algorithm kernel pca increment variant extract princip compon em calcul kernel matrix includ lower bound method featur extract kernel preprocess step classi cation algorithm kernel pca featur train simpl linear classi er nist data data set subset nist special handwritten digit wilkinson data smooth obtain imag valu scale interv train set consist digit writer test set digit writer overlap train increment em algorithm pca framework section perform kernel pca train data standard batch method kernel matrix question size nist data set number iter increment em algorithm chosen polynomi kernel polynomi kernel vari number extract featur vari linear classi er train extract featur simpl neural network softmax activ function desir output base code scheme output class nist data xed train test mcnemar test determin di erenc perform method statist signi test involv singl train run earli stop valid train avoid tting neural network train scale conjug gradient algorithm result nist data tabl princip compon systemat lead result number linear princip compon result obtain polynomi kernel featur result obtain nist data varieti model mixtur classi er mixtur latent variabl good perform con rmed experi data set uci machin learn repositori merz tabl percentag correct classi cation nist test set perceptron train featur extract kernel pca polynomi kernel underlin score con denc mcnemar test detail brute forc approach handl larg data set al idea perform kernel pca train exampl extract princip compon exampl subsequ train linear classi er compar approach kernel experi nist data perform polynomi kernel featur train exampl test data classi ed correctli tabl part data kernel pca score equal test con high exampl surprisingli good result obtain result perceptron correctli classi es test data interest perform systemat comparison brute forc method data set possibl improv method select subset data randomli start data point found cluster em pca kernel pca algorithm increment pca advantag store entir data set algorithm rst data paramet updat expect algorithm converg faster base part data sound shown neal hinton gener em algorithm consist partial posterior hidden variabl determin singl pattern version converg local maximum data likelihood data point regularli chosen simpl case select data point cyclic requir data set neal hinton point partial suce summar sucient statist directli appli em algorithm pca depend sucient statist requir store sucient statist data point iter obtain sucient statist partial data point iter de nition notion weak assum xed train set chang time em kernel pca reconstruct error number block number pass figur illustr uenc number block kernel pca em toi data figur data point result averag experi simpli replac sucient statist newli comput data point select current sucient statist updat paramet appli idea em algorithm pca transform algorithm algorithm cycl data set xed drawback algorithm pca rst algorithm requir store sucient statist oner case requir store matric size matric size involv calcul updat perform data point separ drawback handl cycl block data point individu point similar idea appli train gaussian mixtur model em algorithm hinton heckerman demonstr lead factor respect batch em data set small experi em algorithm pca perform kernel pca toi data figur data point princip compon extract algorithm vari number block data point partit number block vari correspond increment em data point data point block result shown figur reconstruct error train set function number pass entir data set illustr partit data ve signi cantli lower number pass converg split data block make di erenc experi data set led similar result algorithm block converg time faster increment em worth ort depend addit comput time algorithm speci context kernel pca cost increment em algorithm addit cost algorithm due repeat calcul larg matric block data mean partit data comput cost neglig reconstruct error de ned squar distanc reconstruct project rst princip compon express term kernel function calcul increment store entir kernel matrix discuss discuss recent approach make kernel pca ecient larg data set rst approach close relat work present current paper advantag simplic ecienc em algorithm pca make kernel pca ecient directli express em algorithm section term kernel function lead algorithm comput complex iter algorithm batch method resolv problem store entir kernel matrix approach al overcom problem calcul term kernel reduc set method al obtain smaller pattern kernel featur analysi al put penalti coecient ju lead requir kernel function comput extract rst featur basic algorithm store kernel greedi variant algorithm featur extractor algorithm work random subsampl size data reduc memori requir extract featur toi data figur increment algorithm pca make kernel pca feasibl larg data set pattern extract high number featur subsequ train simpl neural network perform exact version em algorithm pca algorithm shown speed extract princip compon toi data set em kernel pca show rapid converg practic open question numer superior techniqu exist avoid store kernel matrix acknowledg research fund swiss nation scienc foundat hardwar problem nal stage work appendix relat eigenvector covari matrix eigenvector kernel matrix shown eigenvector covari matrix eigenvalu xx xx eigenvalu kernel matrix eigenvector provid xx eigenvector account symmetri conclud eigenvector kernel matrix correspond eigenvector xu covari matrix eigenvalu correspond state straightforward normal eigenvector normal em kernel pca eigenvector kernel normal eigenvector covari xu round refer merz uci repositori machin learn depart inform comput scienc kung princip compon neural theori applic john wilei approxim statist test compar classi cation learn algorithm neural comput wilkinson nist special handwritten segment charact technic nation standard technolog stuetzl princip curv journal american statist associ learn graphic model adapt comput machin learn mit press sirovich applic procedur human face ieee transact pattern analysi machin intellig nonlinear princip compon analysi neural network journal zur master technisch berlin fisher discrimin analysi kernel dougla neural network signal process pp ieee mixtur model learn ph ecol polytechniqu de comput scienc switzerland scale conjug gradient algorithm fast learn neural network hinton view em algorithm justi es variant jordan pp simpli ed neuron model princip compon analyz journal mathemat biologi expect maxim approach nonlinear compon analysi submit em algorithm pca solla advanc neural inform process volum pp mit press optim learn linear feedforward network neural network nonlinear compon analysi kernel eigenvalu problem neural comput smola input space featur space method ieee transact neural network em kernel pca kernel featur analysi technic report data mine madison heckerman em larg technic report microsoft research bishop mixtur probabilist princip compon neural comput natur statist learn theori
Agents/702 1 design bdi agent object yun yang school inform technolog vic australia csiro mathemat inform scienc vic australia abstract current research identifi architectur virtual move inform model role model high level autonomi result distribut knowledg busi unit virtual design stage current trend tend technolog effect abstract system design implement methodolog argu appli softwar agent paradigm virtual advantag design oper level show belief desir intent agent architectur addit abil map real world busi unit autonomi interact introduc belief desir intent agent paradigm capabl facilit highli flexibl design implement introduct enhanc transact provid emerg inform technolog establish paradigm defin design implement polici realiz capabl maxim util wai virtual paradigm emerg order address produc effici procedur deal requir clear standard definit gener agreement definit project defin ve temporari consortium allianc compani form share cost skill exploit market walton virtual consist seri cooper node core form suppli chain order address specif opportun market virtual organ share resourc work cooper achiev mutual benefit term suppli chain virtual corpor correspond close relat concept central hierarchi manag level cooper unit result converg welfar outlin problem current virtual implement approach section present overview agent technolog agent architectur section discuss problem current approach design virtual approach section outlin major advantag agent approach section introduc specif capabl belief desir intent agent model implement virtual show bdi approach correspond set agil design guidelin section number futur research outlin virtual problem great organ busi compani busi process ontolog repres busi document tool model strategi plan aspect explicit coordin strategi adopt workflow execut coordin strategi cooper system organ coalit repres major issu resolv behaviour compani particip ve explicitli configur state plan gener profil characterist workflow process definit languag workflow refer architectur workflow manag coalit approach repres dynam behaviour base explicit workflow busi process except handl method repres dynam behaviour ve node petri net problem approach detail level explicit cover case introduc scalabl problem make except handl modul design extrem complex ve context incorpor agent technolog order creat dynam ve system reduc complex configur process explicitli situat handl elementari design process design autonom unit capabl solv intern problem unit provid coordin dynam natur system emerg system oper phase assum workflow view establish ve problem dynam expand integr workflow autonom interact workflow system workflow techniqu suit implement abstract busi process model describ process step perform achiev specif busi goal defin busi rule respect process particip process step realiz intellig busi compon intellig softwar perform specif busi transact softwar agent model agent comput consid revolut definit adapt definit agent softwar system system situat capabl autonom action environ order meet design jen wooldridg intellig agent agent capabl flexibl autonom flexibl perceiv environ respond time fashion exhibit behaviour initi social human agent point term agent refer intellig agent interest import aspect agent facilit cognit model behaviour aspect fulfil role model sole defin framework describ interact environ achiev contribut abstract system gain map real world problem solv comput system autonomi agent facilit system entiti action central control advantag agent approach discuss section number made describ intern architectur agent implic perform agent system reactiv agent reactiv behaviour modul finit state machin behaviour implement rule situat action delib agent delib agent explicit goal reason achiev delib agent intern histori behaviour hybrid agent hybrid agent combin reactiv delib featur bdi discuss hybrid agent belief desir intent model combin reactiv delib approach uniform bdi agent intern mental state mental state inform agent believ true inform agent intern state environ differ knowledg belief knowledg assum belief consid true possibl captur dynam natur inform environ desir desir futur state commit action notion intent close notion plan situat agent number plan select commit action intent intent instanc plan control cycl bdi agent figur event goal select process agent find plan applic current situat plan result creation intent agent execut enabl start step result action event invok extern event action post intern event unprocess event list intent execut post metalevel event match execut modifi intent structur figur bdi control cycl plan librari intent structur intend plan due highli abstract philosoph bdi approach prove valuabl design agent oper dynam respond flexibl chang circumst incomplet inform state world agent bdi reason model resembl kind reason everydai live major attract model clear function similar uniform provid hybrid layer architectur ongo argument repres gener plan agent model argu explicitli provid librari plan agent implicit plan emerg run time rule bdi cycl spectrum behaviour rang pure highli depend structur plan provid account environ execut bdi model highli flexibl paradigm develop intellig softwar agent configur level intellig accommod natur problem paper context facilit inher necess multipl agent system reason autonom effect achiev local gain benefit interact agent ve interact protocol structur commun agent interact protocol consist set messag encod agent commun languag set rule govern approach virtual problem enabl ve requir adopt technic effect design methodolog system scale complex design highli abstract abil directli implement domin methodolog adapt system design principl methodolog provid higher level abstract problem system possibl object interact predefin interfac interfac describ servic invok object object passiv system compon respond predefin request react object system govern central coordin object flow control achiev desir result drawback object relat level abstract provid busi object make major contribut model inform busi agent extend capabl model behaviour fact mean behaviour agent modifi due learn influenc agent environ agent dynam cooper solv problem import differ object agent paradigm relat level autonomi object paradigm notion encapsul give object control intern state object declar instanc variabl privat intern public intern object exhibit autonomi make instanc variabl access method exhibit autonomi behaviour method declar public design object control method execut object invok method agent request action perform agent invok action request accept serv agent li hand serv agent client depend factor current domain state ident object consid provid good map problem solv limit affect map capabl actual problem descript conceptu modifi accommod limit capabl object offer major reason appar failur object orient deliv insuffici attent issu domain understand understand unambigu oo paradigm intend implement softwar system rich busi concept goal goal seek polici trust concept natur fit comput object model base wood al show convent object model construct suffici model mention previou passiv object requir avail coordin control object size oo system number messag object grow control object coordin perform import denot advantag agent mention implement object tool argument base fact attribut compon basic object model gener agent approach definit ve mention ve creation view cooper system design problem cooper system system set autonom agent interact share make capabl distribut workload order achiev common complementari appar similar definit ve cooper agent system problem approach adopt solv object agent paradigm address chang complex level wide distribut object foundat agent technolog built top distribut object infrastructur provid natur merg object orient technolog abil provid reason capabl primit applic compon logic facilit direct map encapsul busi rule organ motiv agent solut summar point adapt design capabl map effect real world problem solv capabl approach actual problem descript conceptu modifi accommod limit capabl approach domain involv inher distribut problem solv maintain autonomi organiz busi unit subcompon accommod complex inform share call sophist social skill provid agent fact detail solut problem design start busi environ highli unpredict rigid design accommod gener workflow definit busi process adapt compon deal specif busi transact intern problem advantag bdi agent approach addit advantag agent paradigm mention previou bdi agent featur central argument show element bdi model offer advantag scope captur aspect virtual back object agreement benefit encapsul inform object advantag realiz bdi agent model belief current knowledg bdi architectur offer higher level abstract explicitli belief direct impact behaviour behaviour dynam modifi knowledg domain concept natur fit comput object model specif polici govern behaviour object set includ specif abil accommod polici part natur rise captur goal direct behaviour busi unit coordin process base specif dynam chang coordin failur captur intent inform higher level busi object process map specif activ object dynam chang system maintain coordin rang situat activ strategi constitut busi unit task autonom evolv requir local domain intent reflect reason abil agent pursu action plan commit abil plan map busi strategi achiev task plan plan error report coordin process servic requir strategi consum success agil design previou show bdi agent architectur interest capabl model behaviour busi unit step show bdi agent paradigm provid power facilit highli adapt design set agil system design principl order show bdi agent paradigm support attribut central descript agil broadli agil manag appli knowledg order accommod chang advantag strategi effect implement emploi common set principl promot profici chang design agil entir critic element busi oper product requir design sustain profici chang natur system identifi ten kei design principl high adapt number industri applic principl emerg observ natur system tabl show principl bdi agent architectur featur facilit design applic principl tabl correspond bdi agent mode agil design principl design principl bdi agent model featur system separ unit intim integr intern work import extern plug system unit share common interact interfac easili insert remov facilit unit inventori modif design mainten agent unit capabl perform task proactiv independ interact agent central control agent encapsul capabl implement result servic abstract agent interact protocol implement agent commun languag kqml enforc messag syntax messag semant realiz industri standard agent belong class number agent instanti modif chang state replac agent sophist model support extra effici function direct interfac system unit defer relationship transient fix bind postpon immedi distribut control unit respond made point data retain local access global dynam unit allianc open behaviour flexibl unrestrict unit popul larg total unit popul unit duplic unit type capabl provid capac fluctuat option fault toler evolv open system capabl accommod complet unit agent interact central control direct messag negoti bid intern job group provid granular interact bdi agent introduc notion sophist negoti collabor techniqu incorpor busi unit individu busi unit agent assign job fulfil real time complet detail workflow system process interact agent situat heavili central agent easili ad system facilit unsupport system grow dynam level defer commit present fact agent perform onlin plan situat agent privat object direct system perform enabl agent local real inform distribut advantag similar object model belief notion bdi agent flexibl knowledg true belief bdi agent cognit modif belief chang behaviour plan depend agent dynam model environ autom coalit format static dynam format bdi team coalit format wai enabl achiev mutual goal exchang benefit instanti number agent agent ad perform busi function repres busi unit agent resid machin mobil order achiev scalabl agent system easi recoveri consum agent fail achiev report agent capabl deal situat find perform task altern task agent design interact legaci system technolog integr object system upgrad agent version enabl system evolv research autom virtual step effect design implement virtual offer capabl direct map behaviour natur busi unit fulfil exist object mutat problem order fit limit design capabl paradigm offer softwar agent offer advantag design implement scalabl virtual belief desir intent agent architectur natur accommod rich busi strateg plan facilit highli adapt design attribut central agent architectur paper step incorpor agent technolog electron commerc virtual investig capabl offer addit featur function point negoti dynam plan capabl negoti collabor effect choic made effect model real world busi practic work methodolog design analysi agent system special david kinni valuabl contribut made discuss surround softwar agent comment refer refer www virtual myth realiti control cooper system challeng virtual intern comput engin system applic april workflow manag workflow manag workflow refer model document number issu nov establish virtual mean mobil agent build workflow busi object oopsla workshop busi object compon design implement report intellig revolut softwar intellig agent weiss multiag system mit press applic intellig agent wooldridg agent market bdi theori practic intern confer system san social sophist bdi agent fourth intern confer multiag usa interact protocol boa icma compet futur intellig agent distribut object part oct part nov describ virtual object role role object oopsla workshop compon virtual vancouv approach busi process manag record intent inform coordin workflow oopsla workshop busi object compon design implement agil refer model case studi engin decemb report design principl highli adapt busi tangibl manufactur exampl industri handbook mcgraw coalit format bound ration agent intern joint confer artifici intellig pp
IR/703 5 discov unexpect inform competitor web site bing liu school comput nation singapor scienc drive singapor yime ma school comput nation singapor scienc drive singapor philip yu ibm watson research center yorktown ny usa abstract begin find inform web import problem exist approach includ inform web queri user prefer approach essenti find inform match user explicit specif paper argu insuffici type inform great unexpect unanticip user find unexpect inform applic compani find unexpect inform unexpect servic product competitor offer compani learn competitor design counter measur improv competit number page typic commerci site larg relev site difficult human user view page discov unexpect inform autom assist number method user find type unexpect inform competitor web site experi result show techniqu practic effici keyword inform web web mine introduct web increasingli import channel conduct dissemin commun peopl global scale true true individu individu publish inform web inform publicli natur compani individu find inform web page exist research approach web inform find wide approach includ manual inform web user prefer search search alta popular method search engin user system find web page keyword manual web browser netscap internet explor user specif web page manual find interest inform approach enabl user extract specif piec inform target web page web queri languag give user opportun queri web user prefer approach inform user prefer approach base explicit specif user find inform match user specif drawback approach hard user find unexpect inform user find anticip inform user specifi deriv exist knowledg space argu find user explicitli specifi suffici piec inform user great interest user forgotten inform unexpect great import practic import compani unexpect servic product competitor offer compani learn competitor design counter measur improv competit busi intellig inform increasingli crucial surviv growth compani exist web inform extract techniqu find unexpect idea find inform user manual web page competitor manual web page time consum typic commerci web site hundr page relev site analyz autom assist seventh acm sigkdd intern confer knowledg discoveri data mine august san usa comput system find unexpect inform web page simpl task piec inform unexpect compani unexpect piec inform unexpect essenti subject depend current oper compani interest competitor problem analog problem data mine data mine algorithm gener larg number rule rule interest user due larg number difficult user inspect manual identifi interest context situat similar larg number web find interest unexpect inform manual difficult task approach user find unexpect inform competitor web site inform context piec inform defin piec inform unexpect relev unknown contradict user exist belief expect note condit import piec unknown inform interest piec inform relev user user market capac interest piec inform plant piec inform unknown piec inform market strategi interest relev unknown summari approach approach aim find inform web compani site site person home page web site suppli relev user call site competitor site definit find unexpect inform web user expect exist site system find unexpect inform site inform user web site compani site user home addit knowledg user competitor exist knowledg expect task find interest inform competitor site problem compar site find similar inform user site repres part user exist knowledg expect find similar inform exist competitor interest basic idea approach user site competitor site exist knowledg expect competitor system analyz extract kei inform analyz compar inform find type unexpect inform textual inform web page scheme repres inform page vector space commonli inform retriev commun assumpt differ main content text document repres keyword call index document combin keyword occur frequent sentenc web page word combin repres inform owner design number method compar web site user find type unexpect inform techniqu gener domain applic implement system highli interact due effici number experi applic test perform shown techniqu practic relat work exist techniqu find inform techniqu find unexpect inform exist approach find inform web focu user specifi explicitli approach includ inform user prefer web xml resourc discoveri user specifi search engin alta find web page rank measur web inform extract wrapper specif extract procedur built automat manual web page extract specif piec inform request extract price product user prefer base approach commonli push type system user specifi categori inform interest system type inform prefer categori web queri base queri languag sql extend modifi queri inform xml document web page web resourc discoveri aim find resourc relat user request approach techniqu link text extra metadata hyperlink studi futur work method show result classif algorithm find relev page page group authorit hub exist approach essenti view process find inform web queri search inform extract prefer xml data resourc queri approach suffer problem hard find unexpect inform find anticip inform queri deriv user exist knowledg space lot inform meet user requir queri interest user piec inform unexpect user unabl complet interest approach activ perform task return request inform approach piec unanticip inform serv remind user stimul thought techniqu user identifi requir find type unexpect inform user interest aspect web page current interest complet work relat research data mine issu discov rule long identifi import problem due fact data mine algorithm produc rule interest user number approach user deal problem approach suitabl web reason rule structur clear syntax inform web method find inform web page vector space textual inform web page find interest inform page treat text document scheme emploi wide vector space model review model vector space document set keyword call index term simpli index term simpli word semant rememb document main theme index term weight number index term collect index term set index term weight term document term document document repres index term vector inform object find set relev similar document queri document repres queri vector similar comput popular cosin measur number scheme assign weight index term wide weight scheme scheme tf term frequenc idf document frequenc total number document system number document index term raw frequenc term document normal frequenc tf term document maximum comput term document term tf idf document frequenc term weight scheme queri term salton bucklei suggest raw frequenc term queri document techniqu readi present method vector space model keyword combin repres text web page discuss comparison method base describ user previou knowledg incorpor comparison process compar web site design method compar user site competitor site user find type interest unexpect inform competitor site set page user web set page competitor web site method discuss find user interest find page similar page user perform detail analysi specif topic newspap site publish articl topic publish competitor site topic sim tf max idf log log max tf log comparison page cosin measur comput similar page page rank similar descend order page page shown figur number pair raw frequenc count keyword figur page page find obtain rank rank shown rank similar time comput consist step step comput weight term page maxim number term comput weight size set step similar time final store term weight page hash tabl reason assum access term hash tabl time oper time find unexpect term page respect user unexpect term similar page page page method term user obtain kei differ page differ decid page find detail page page compar term weight document obtain unexpect term respect term term respect denot comput tf tf rth term tf tf term set tf interest term unexpect respect note idf cancel algorithm comput discuss term term rank valu descend order note top rank term expect term continu interest unexpect term respect note method identifi page similar unexpect term obtain rank classifi term classifi term data predict shown rank term valu time final comput linear number term note method perform subset page subset page user interest comparison product relat page site perform combin term term combin term sum count term page appli formula find unexpect page respect aim method find page unexpect respect site page user competitor site page user site combin page form singl document page form singl document comput term respect page respect denot defin amount term set term comput import note satisfactori comput term base individu page inform topic web site concentr distribut set page measur term aggreg content web find unexpect page valu rank page valu page figur obtain rank rank rank unexpect respect page studi formul comput work satisfactori result tf tf tf tf comput consist step step combin term page page form maxim number term page maxim number term page time complex comput step comput time complex comput final comput complex oper assum term page store hash tabl find unexpect concept page respect keyword reveal import inform web page combin word concept inform page find keyword word word word separ notic interest word occur frequent reveal worth investig concept set keyword occur sentenc page minimum support word sequenc sentenc matter word definit advantag find interest keyword combin basic express concept make exist algorithm associ rule mine discov frequent word combin page associ rule mine defin set set transact transact consist subset item associ rule implic form rule hold confid transact support support rule support transact problem mine associ rule gener associ rule support confid greater minimum support minimum confid typic associ rule algorithm work find frequent itemset set set term data satisfi minimum support requir itemset concept applic gener rule frequent itemset applic interest frequent occur keyword term apriori algorithm associ mine discov concept keyword sentenc page form transact set sentenc page dataset keyword occur concept comparison method perform simpli treat concept term keyword concept individu find unexpect page respect similar formul method worth note mine frequent itemset page separ concaten page dataset mine concept reason page web site typic specif topic mix find interest concept page minimum support requir concept frequent frequent combin page minimum support percentag find unexpect outgo method find outgo link site link resourc addit custom travel compani link site provid currenc exchang site offer intern weather inform outgo link collect crawler crawl section set outgo link set outgo link set unexpect outgo link respect link occur incorpor user exist knowledg user exist knowledg applic domain competitor system express comparison user exist knowledg serv system discov unexpect inform user check expect correct user expect data mine compani provid cluster tool turn compani tool user knowledg express hypertext link set concept link consist gener item concept domain user rank high specif item site user rank high note common item user rank high comparison site applic domain travel common rank high situat put case user item rank high user put user travel compani offer put compar site put compani offer user applic page site item ad set item keyword method concept method outgo link method weight maximum rank lowest comparison note method similar comput object reflect subject knowledg user system architectur implement web site comparison system base method system call code visual window environ consist main compon system architectur shown figur inform crawl web site download page record outgo link built user page comparison keyword extractor associ extract keyword web perform standard oper elimin word stem smart system keyword extract associ miner execut find concept page comparison function discuss section analyz page user site competitor site user find type unexpect inform unexpect term concept finder combin user user interact system run run show work system compar data mine sgi data mine crawl interfac system shown figur upper part start page lower part inform click link site comparison delet irrelev link comparison user site competitor site start select site user competitor site obtain screen shown comparison function discuss section click button comparison system connect microsoft excel report comparison result start compar site note exist knowledg data mine find unexpect page respect find unexpect page respect result rank page tabl top page page document page interest html document system plan add page site user find page focu specif topic detail analysi interest technolog comparison technolog page research project figur system architectur unexpect term concept finder comparison compon unexpect page finder page finder unexpect link finder link inform collector keyword extractor associ miner link page page user interfac web technolog page obtain rank page tabl top page url similar shown top page describ technolog job page personnel reflect technolog page rank describ technolog page unknown show system user quickli focu interest page find unexpect term concept page respect find page user typic unexpect term concept decid perform analysi page continu unexpect term concept page tabl respect page top rank keyword concept found tabl top keyword full word hard understand case term concept exist rank base frequenc count scan list shown tabl found familiar topic page compar page found concept top rank keyword concept tabl knew good visual visual scatter visual unexpect page warrant analysi found interest featur capabl awar note frequent report longest subset longest itemset defin frequent itemset subset frequent itemset longest itemset call border associ rule mine longest itemset summar subset longest itemset report subset subset frequent reduc number facilit user inspect awar algorithm find long itemset directli data implement futur figur crawler interfac find unexpect outgo found outgo link awar tabl list decid includ link web site longer site lot data mine relat inform site interest standard benchmark data set classif research knew site point data set compar accuraci system exist system point site tabl unexpect page tabl page similar tabl unexpect keyword concept tabl unexpect keyword concept url url sim keyword concept custom custom custom profil manag telecommun compani high perform analyst referenti integr inform segment base technolog model visual consist format relat cost effect telecommun effect manag understand hidden pattern trend time high custom larg hundr million profil larg volum trend long distanc keyword concept visual click voic annot tree option tree map pie chart anim size color displai visual movi dimens visual tool bar bar chart color height color evid peopl earn relat record view analysi visual scatter show unit state inform add tool analysi point anim control panel show variabl anim control panel evalu techniqu deal subject difficult object measur perform exist system perform task comparison carri number experi involv domain user check system practic discuss applic experi report experi result time effici system applic experi user travel privat educ dive compani compar compani site competitor site user knew competitor web page system find lot inform find main reason competitor site larg number page competitor site travel compani page user system find interest page page describ tourist attract number countri heard newli system find unknown educ travel destin interest link tourist inform entertain compani small hotel destin uncov user find competitor guid custom medic care group number small destin inform immedi user compani case educ dive piec unexpect inform discov system user perform analysi due quickli focu potenti interest term concept tediou page fish interest due difficulti manual user gave page anchor text guid decid visit deeper page heurist frequent result interest page visit system perform complet analysi site page user read miss inform system summar page keyword smaller number easier inspect manual system attract user peopl curiou unexpect thing effici assum length number web page algorithm essenti linear number page involv reason assum length web page constant averag length page vari great deal site perform experi number web site experi run pentium ii pc memori tabl show run time comput valu web site time associ mine page final column note associ mine perform page begin result subsequ comparison time complex algorithm basic linear number tabl averag run time page comput valu column list url site site site number url number page site link experi column averag execut time page comput cosin similar measur find page page column averag time comput page page keyword concept comparison column averag time comput page final column averag execut time mine concept page tabl unknown link associ mine minimum support set small page fewer keyword combin form frequent itemset minimum count threshold experi set frequent itemset page time note experi site site averag execut time page roughli tabl observ comput effici system easili handl larg number page short time time crawl report effici depend number understood keyword smart system outgo link site record crawl compar outgo list site straightforward fast argu find inform match user specif insuffici web inform discoveri find inform user idea great import paper number method user find unexpect inform competitor web site experi result applic show techniqu practic effici futur studi metadata ontolog provid inform relat keyword creat intellig system studi link infer unexpect inform research extend methodolog monitor competitor web site treat web page site exist knowledg unexpect page competitor report user refer agraw srikant fast algorithm mine associ rule ashish knoblock wrapper gener semistructur internet sourc sigmod modern inform retriev addison bayardo effici mine long pattern page anatomi larg scale hypertextu web search engin tanca complex queri sac van den dom approach web resourc discoveri cohen integr heterogen common domain queri base textual similar dipasquo nigam slatteri learn construct knowledg base world wide web artifici dean find relat page world wide web core home mendelzon techniqu survei sigmod record framework explicit bia approxim inform extract rule raghavan infer web commun link topolog proc acm confer hypertext wong kp web inform mine algorithm kleinberg authorit sourc hyperlink environ symposium discret hsu learnt rule chen gener impress analyz discov classif rule milo queri world wide journal digit librari tuzhilin small discov minim set unexpect pattern deviat resourc descript framework schema recommend salton mcgill introduct modern inform retriev salton bucklei approach automat retriev inform process make pattern interest knowledg discoveri system ieee tran data maglio barrett push time inform deliveri tabl execut time sim assoc mine
IR/704 5 entiti recognit text type diana maynard cristian cunningham wilk dept comput scienc sheffield st uk abstract current research inform extract system tailor domain muse system entiti recognit system aim reduc costli adapt system capabl process text wide differ domain genr system preliminari result show degrad process text lower qualiti unusu type system averag recal varieti text type introduct inform extract system design extract fix type inform document specif languag domain suitabl system easili domain driven muc competit work entiti recognit larg narrow newswir terrorist attack report air vehicl launch type document domain system requir process type document tune exist system successfulli tune domain applic manual advanc tackl problem make singl system robust forego adapt exist system domain hinder ontolog rule bottleneck substanti amount knowledg acquisit applic task system deal successfulli unknown multipl type sourc cope genr form media transcrib spoken written web output ocr text type structur layout genr text influenc number intend audienc formal formal text follow standard punctuat spell format muse project aim identifi paramet relev creation recognit system robust type variabl entiti type muse system identifi type entiti detail muc addit address identifi entiti locat time percent ip identifi larg guidelin definit markup entiti made order remov anomali make entiti found practic applic includ titl person annot john dr combin entiti combin date time occur consecut annot muse system base gener architectur text engin cunningham framework develop environ languag process gate instanc softwar architectur languag engin process resourc system requir main process gazett finit state transduct grammar resourc commun annot direct graph arc bear arbitrari node root data document content case split text simpl word type initi upper aim limit work enabl greater flexibl place burden analysi grammar mean modifi applic text type gazett consist list dai consist typic compani design gazett list compil finit state match text token grammar consist rule describ pattern match annot creat result pattern describ specif text annot attach token annot creat document format rule prevent multipl assign annot text string section describ grammar rule adapt deal text type implement process resourc implement process resourc centr usabl clear distinct declar data finit state algorithm behaviour processor complet control extern resourc grammar rule set make easili modifi user familiar program languag implement finit state machin class charact defin unicod specif input output annot document process categori process text virtual languag successfulli test western project process indic languag gazett implement built time start list phrase run directli text depend process resourc gazett capabl handl unicod make usabl text languag type process resourc annot pattern engin handl workload entiti recognit system implement cascad finit state transduc transfer temporari result phase gate document data sourc share phase advantag approach result phase number subsequ constitut output system transduc work regular express match mechan direct graph annot input successfulli entiti recognit sentenc intend experi field shallow syntact phase transduc independ mean applic execut parallel depend result process transduc capabl handl unicod input domain format type scienc written book email mail list comput email mail list written period spoken educ spoken world affair written misc social scienc written misc spoken dialogu imagin written misc art written misc tabl composit corpu moment hand craft applic learn rule automat transduc manner similar rule verifi human human readabl fact process resourc emploi fsm technolog make power term execut time initi experi show full entiti recognit system capabl process kb text size input process requir linear relat text hope improv figur futur data train test compil corpu text term style genr aim ensur system cope adequ kind futur limit text type data subset nation spoken written set email medic mail set email comput corpu subdivid shown tabl spoken written data million medic mail list comput data word process text type muse entiti recognit system design process multipl type text robust minim adapt hard gener kind robust system sacrif specif overcom system design adapt situat set resourc oper linguist featur text inform domain text system turn specif set gazett list relat domain inform text format requir grammar rule order preserv ignor layout text address letter tabl give featur text format impact core ne recognit system adapt resourc text type identifi number featur text type requir adapt process resourc grammar gazett adapt requir grammar gazett list design manipul wai grammar call entri found broader narrow depend requir militari titl includ exclud part set gener correct resourc set text type manual intend autom facil mean lookup tabl associ textual characterist specif grammar outlin switch deal type text format domain requir email tend predict type text structur structur depend email program produc written spoken email line break control char replac space control char replac space control char addit space space extra space extra space extra space space type repli separ spell error error error word punctuat correct miss frequent spuriou miss correct miss capit miss extra capit number figur word figur abbrevi space origin text line break forc wildli term impact featur correct spell clue email header inform assist process grammar email vari import wai type text flexibl permit email space control charact includ repli separ extra grammar process header inform inform hostnam specif found header email spoken text requir email spoken text consid necessarili conform correct usag english punctuat spell norm obei punctuat spell issu fulli tackl grammar email spoken text switch turn fire question ambigu common overridden tabl featur text format case context make clear word letter scientif text scientif singl initi refer point closer ad trajectori closer point attempt order prevent identifi part person analysi sampl find unknown proper noun set default unknown switch person religi text intuit religi text requir special tend involv set commonli mean found text real refer religi text fairli repres peopl switch religi text turn specif gazett list peopl place view peopl larg origin author evalu system test text drawn test minim train similar text test standard core set resourc provid baselin evalu genr adapt specif resourc set domain text type test text split medic email spoken miscellan text written scientif text spoken religi text group consist randomli chosen text sampl text evalu formula half weight accord partial correct answer entiti type correct span weight equal prefer recal recal correct correct spuriou correct correct miss measur result gener automat tool result result depict averag group text figur show recal entiti type group result consist percentag address achiev perfect score line muc system achiev recognit high figur depict averag recal group text email text score highest miscellan spoken text achiev slightli lower religi text score lowest time spent tune resourc time train religi unexpect figur show vari specif grammar set standard set default grammar set data email small number test text expect find greater differ email text religi text slight person entiti scientif text mark larg person entiti figur averag result entiti type figur averag result text type discuss detail result entiti type found type text busi spoken text gener domain system score produc error entiti type person date figur averag measur grammar religi system score religi set fall slightli person due wrongli spell word space error space text test core grammar fell slightli recal drop coupl point larg due religi standard grammar scientif book result scientif book slightli lower religi person score low recal larg surnam contextu clue mark improv recal text process standard set discuss earlier medic email email text perform achiev recal fell slightli recal locat typograph differ standard grammar expect differ notic text make stylist featur address layout work system entiti recognit text wide differ format genr result achiev high recal score minim alter process resourc clear alter import success system major step autom process determin set process resourc plan improv scope system time spent develop rule investig method learn detect contextu inform automat refer appelt introduct inform extract artifici intellig cowi lehnert inform extract commun wilk softwar infrastructur natur languag process confer appli natur languag process march java annot pattern engin research depart comput novemb cunningham definit short histori languag engin journal natur languag cunningham inform user guid research depart comput cunningham softwar architectur languag engin phd sheffield cunningham gener architectur text engin accept public comput develop languag process system confer appli nlp system messag understand confer score softwar sw cd entiti recognit greek project advanc intellig tool page kluwer academ publish cunningham build corpu south asian languag quarterli artifici beth editor sixth messag understand confer md morgan kaufmann beth editor seventh messag understand confer morgan kaufmann
Agents/705 1 public agent agent solv approach abstract autonom agent approach applic suppli web support manag integr control process lead problem common autonom agent design model complex behavior entir compani paper present innov approach model intellig agent context agent architectur conflict interest explicitli determin behavior discuss applic ebusi keyword agent conflict agent introduct autonom agent approach applic suppli web support manag integr control process lead problem common autonom agent design model complex behavior entir compani deal lead mutual conflict interest meet requir agent architectur introduc featur conflict balanc reactiv delib scalabl social suppli web handl critic bottleneck risk failur realtim integr highli complex autonom repres autonom agent address problem ingo center comput technolog bremen frame develop design methodolog agent architectur agent agent control architectur extend bdi approach integr delib reactiv compon explicit conflict resolut scheme framework ebusi applic mandatori transpar robust multiag behavior theoret agent architectur formal specif bdi agent introduc rao georgeff refin wooldridg suffer undecid select process respect set goal consist base logic agent implement gener problem solver problem deriv model design process concret agent system introduc model design approach technic aspect select design agent architectur standard effort agent commun fipa aspect domain field electron commerc specif knowledg busi stai section introduc agent architectur design methodolog ebusi applic overcom difficulti design agent ebusi main reason miss commerci applic agent technolog ebusi locat miss specif design process develop design methodolog agent emerg agent standard common knowledg formal esp ecommerc methodolog accept public agent integr specif behavior rule busi domain specif vocabulari explicitli design process subdivid model individu figur result process system task role specif agent figur design methodolog agent adapt adapt step focu paper combin domain specif requir behavior effort intern standard intern standard foundat intellig physic agent dedic specif agent system vision pretend incompat system solut ensur extens implement effort crucial accept multiag system commerci main object fipa standard support agent multiag system interact heterogen develop agent commun protocol behavior fipa aim servic concept implement integr agent multiag system specifi agent platform introduc mandatori messag transport directori agent manag standard servic agent commun languag implement multiag commun interact agent platform adapt step lead refer architectur incorpor mandatori behavior ebusi applic design scratch basi fipa standard fipa compliant toolkit softwar basi fipa specif consist interfac languag definit leav specif control behavior domain specif develop architectur enrich behavior aspect identifi crucial compon electron conflict base agent control strategi adapt commun compon ensur explicit handl conflict agent behavior environ adapt experi compon implement dynam strategi long run behavior adapt explicit strategi agent continu check assess outcom inappropri outcom lead strategi adapt interact heterogen environ agent adapt commun protocol due experi effici model domain domain specif model gener toolbox formal concept concret instanti agent concept relat knowledg base goal agent formal construct knowledg base integr domain vocabulari ontolog languag determin express proposit formal construct center design applic accept agent technolog industri applic transpar goal formal person compani definit goal toolbox base formal exist busi rule special interest domain ebusi model busi rule reformul consist formal vocabulari definit individu step design agent instanti agent refer architectur provid agent gener behavior combin knowledg provid model domain step toolbox formal goal serv concept desir concept agent architectur individu agent configur accept public agent specif collect goal knowledg refer behavior detail refer architect paper agent order creat refer architectur adapt step concept agent introduc agent architectur specifi gener requir aspect agent knowledg infer applic field ebusi special respect suppli busi busi cooper basic approach strictli separ intern extern aspect due secur issu layer architectur consist work realiz speech determin gener agent interfac exist resourc plan system inform sourc control execut layer construct straight forward design control layer sophist implement innov conflict base agent control strategi adapt commun control layer determin state agent mean agent behav function procedur control decid learn experi acknowledg control architectur present base delib agent architectur bdi formal remark agent refer architectur individu specif concret agent individu architectur base formal foundat agent system singl agent multiag system logic wooldridg lomuscio logic restrict proposit agent due visibl percept knowledg agent introduc global state agent perceiv process subject local state agent formal basi agent specifi local state approach local state agent consist tripl express agent defin definit definit symbol set belief defin set current belief understand start introduc concept action level system differenti gener commun action execut action definit set gener action set gener commun gener execut action defin true agent set predefin gener commun action type set gener execut action type instanc gener action type activ commun execut definit level abstract unifi commun execut behavior executor action sequenc commun action sequenc integr dialogu diag dialogu concept consist set gener set current belief framework subset current belief map set implement dynam belief network action select definit diag isa dialogu seq diag map diag seq current dialogu agent symbol di subset dialogu di di dialogu subset current belief agent inform state support select action content knowledg content paramet method support level definit concept slightli accept public agent compar concept partial plan consist subset current belief set select map dialogu activ subset belief complex repres dialogu definit set symbol set implement agent defin con con pre post con map select map select match dialogu con believ con design con con introduc repres activ instanti case subset current belief agent case dialogu subset belief activ creat basi concept defin auxiliari concept definit aim subset set belief subset post condit desir host concept goal desir definit consist set aim set altern aim map determin prefer chosen prefer definit set desir agent current set desir agent desir defin aim alt map alt bdi approach intent defin commit desir activ desir set altern basi achiev goal select chang activ desir definit intent reduc select extend statu determin current process aim satisfact definit definit defin intent aim set con activ map determin complet definit local state bdi approach main differ lai state transit function introduc wooldridg logic describ execut continu symbol set percept defin singl action present manner explain natur languag belief updat knowledg agent due current percept initi state system gener belief set step bdi algorithm creat option action approach bdi explicitli defin set set goal set desir inconsist case set goal consist subset set desir defin set consist subset content set goal depend current state set intent step filter map creat set intent state import step bdi algorithm determin action select intent call filter step activ intent retract achiev current condit accept public agent step bdi algorithm initi select action current set intent agent control major drawback convent architectur set assumpt set desir goal conflict futur usual formal method introduc branch time structur field agent applic level theoret background agent deriv tautolog knowledg model tempor logic effici finit algorithm detect consist set desir hand explicit conflict behavior manag crucial transpar accept plai import role practic applic situat ebusi domain agent control explicitli consid problem implement iter algorithm handl conflict formal specif action execut cycl bdi express gener filter action execut section action execut cycl extend filter step formal specif algorithm present step illustr figur figur algorithm gener main step gener set desir commit transform desir commit intent uniqu format element result set call object definit definit set object object defin con alt aim pre post map statu prioriti transform desir intent object base tran map def definit tran map defin intent desir separ pred con con applic map lead set consist point time filter conflict filter paper algorithm consist main assess object assess conflict synergi object select object assess scheme integr reactiv relev factor factor defin map current believ agent object real number definit concret map part custom agent system determin gener weight design goal consid conflict manag step intuit approach introduc map present definit reactiv factor determin risk expect cost aim pursu requir concept alloc resourc accept public agent definit map γ integr assess map δ ω defin ℜ oi assess map defin oi contrast assess reactiv aspect delib evalu aim estim util goal yield maximum util current circumst agent integr current statu commit intent lead adequ goal pursu complet intent simpli discard aspect object assess determin relev relev express dynam weight depend state agent evalu commit desir intent assess conflict synergi deal conflict desir approach detect assess conflict pair object present algorithm level neutral desir post condit precondit account figur conflict resolut scheme definit assess conflict synergi defin σ cartesian product ℜ neutral pair object defin stop criterion effici defin weight number conflict oi post condit oj aim vice versa defin weight number support post condit oi pre condit oj vice versa evalu introduc ψ concret algorithm map central featur implement architectur object select process main conflict resolut phase incorpor conflict resolut step document figur scheme motiv research social psycholog level conflict synergi potenti individu assess object lead specif type conflict resolut direct fight strategi object strong domin assess accept public agent object remov object chang assess aim object fruit approach agreeabl goal creat object partial subsum conflict goal implement conflict resolut type part custom process agent domain result subset set object updat assess action action execut consist activ object object highest evalu result intent object activ prefer altern due definit object select respect initi start dialogu select due aim conflict synergi potenti involv agent intent object activ respect dialogu continu discuss futur work cope conflict main demand practic ebusi applic algorithm introduc solv problem explicit manner formal framework adapt extend context refer project partial fund deutsch forschungsgemeinschaft agent architectur appli spectrum applic spread inform logist manag product engin domain transport logist suppli chain configur construct domain refer architectur agent applic suppli refer ij al agent technolog applic scenario logist european confer artifici intellig workshop note ij multiag system appli tempor logist ks logist inform ag intern symposium logist juli pp rao mp georgeff ration agent allen al intern confer principl knowledg reason morgan kaufmann san wooldridg reason ration agent mit jp müller design intellig agent fipa architectur foundat intellig physic agent ij hk woelk der und und institut für technisch universität ij hk woelk adapt multiag commun protocol product engin intern workshop emerg synthesi march pp wooldridg lomuscio seventh european workshop logic artifici intellig van de complex interperson conflict behaviour theoret frontier essai social psycholog psycholog press east
HCI/706 4 ed juli page evalu recommend algorithm internet inform broker base simpl associ rule theori andrea michael universität karlsruh abstract associ rule wide techniqu gener recommend commerci research recommend system web offer automat recommend servic web usag evalu recommend algorithm increasingli import paper present framework evalu aspect recommend system base process discov knowledg fayyad al focu comparison perform recommend algorithm base frequent itemset recommend algorithm associ recommend algorithm base theori market research evalu concentr pattern extract usag data match concept recommend user month usag data educ internet inform broker compar recommend identifi user target group broker result recommend algorithm result evalu present paper suggest frequent itemset histori match concept recommend express user satisfactori accuraci evalu suggest algorithm studi paper perform similar data tune properli introduct recommend system wide retail web site barn care evalu perform increasingli import recommend system complex applic base combin model algorithm heurist complex make evalu effort difficult result appar literatur recommend evalu paper improv recommend evalu develop systemat approach respect evalu develop section framework systemat evalu recommend system principl base process knowledg discoveri fayyad al expect benefit evalu aspect recommend system separ properli target stakehold introduct system suitabl continu process improv area improv section review common perform measur recommend system evalu recommend system literatur rest focu specif aspect knowledg discoveri process comparison data mine method gener recommend sourc gener recommend includ express opinion characterist peopl recommend servic inform sourc combin provid recommend perform evalu paper aim present complet recommend neglect question pattern extract usag data match concept recommend human expert restrict investig mine usag data section give introduct data mine algorithm paper kdd societi algorithm base theori origin market research section describ setup data set section present discuss evalu result conclud short summari find open research question section framework evalu recommend system recommend system complex applic perform process knowledg discoveri fayyad al give overview step kdd process applic model recommend system straightforward order separ influenc user interfac effect choic data mine method add present addit step process model fayyad al figur major step data set produc recommend stem sourc sourc exist transact log point sale web server data collect special gener recommend rate preprocess step data set clean inconsist data remov miss data infer treatment clean data transform suitabl data mine collabor filter data consist explicit rate user collect creat recommend music prepar involv discov remov inconsist rate web usag mine data collect observ behavior user web site observ effort put data clean transform problem involv identif dynam session miss data due proxi server system request web robot data object step find interest pattern data set recommend output data mine recommend system group user similar item frequent sequenc extract pattern mean learn paramet model data set interpret order build found pattern model understand human properti process kdd process evalu method select data preprocess transform data mine interpret evalu present ml hci perform evalu paper web usag mine util evalu recommend system ml machin hci human comput interfac design fig map evalu method step kdd process call knowledg discoveri result interpret recommend system interpret found pattern user final valid valid novelti find lead understand pattern evalu recommend system present interpret suitabl form recommend recommend list recommend item list item similar item user consist inform user similar interest rate specif item complex recommend choic step knowledg discoveri process detail evalu aspect process necess figur map evalu method recommend system step kdd process provid systemat refer framework summar evalu method evalu util recommend system target stakehold organ evalu util process shown figur practic util recommend system evalu impact recommend system perform process recommend support process support process impact measur compar sale product recommend test market approach lawrenc al evalu person product recommend person digit assist supermarket chain perform measur evalu revenu sale volum trigger recommend lawrenc al report observ revenu introduc recommend store line estim percent sale volum measur compar impact random product list versu recommend product list bui behavior consum perform measur contact task achiev web usag mine cover step kdd process addit evalu data mine method evalu data select preprocess step import web usag mine correctli observ user behavior web requir automat handl difficulti filter automat web robot detect session path complet evalu session identif heurist coolei recommend compar result log file session identif result analyz log file strip pp evalu heurist requir instrument web browser log user data collect instrument web browser compar result algorithm appli server log evalu method test preprocess statist synthet data episod identif approach coolei altern experi usabl lab behavior user manual analyz research recommend system focu evalu mine algorithm method machin learn common machin learn compar perform algorithm prepar data set divid set train set evalu approach account pattern data set learn pattern recommend underli theoret framework algorithm evalu respect consist associ rule recent discuss found pp approach correspond model realiti evalu statist model test underli behavior assumpt theori model comparison perform notabl sensit comput understand evalu present recommend dealt area interfac research includ method usabl lab connect recommend system herlock al compar recommend movi find similar previou work expert suitabl explan recommend user accept recommend system paper focu evalu perform simpl associ rule algorithm base algorithm main research question pattern extract usag data algorithm match concept recommend user question recommend algorithm base observ frequenc similar recommend human perform evalu present paper combin data mine step part interpret step kdd process shown figur perform data mine algorithm evalu regard output correspond concept recommend actual predict neg posit neg posit tabl matrix perform measur recommend algorithm measur perform recommend algorithm measur origin machin learn inform retriev give definit perform measur defin mean term recommend recommend list item product custom item recommend list list recommend item singl recommend relationship item recommend recommend list consist recommend specif item measur similar lead back call matrix depict tabl correspond outcom classic statist experi matrix show recommend predict recommend algorithm predict correct recommend matrix show recommend algorithm reject predict correctli reject recommend statist cell type error probabl α cell type ii error probabl β perform measur machin learn data mine task recommend system perform algorithm depend abil learn pattern data set perform measur evalu algorithm root machin learn commonli measur accuraci coverag accuraci fraction correct recommend total recommend formula coverag measur fraction item system provid recommend formula defin coverag directli matrix repres inform level recommend level individu item recommend list correct recommend accuraci total recommend coverag item recommend total number item common measur absolut error shown formula length learn pattern train set number item produc recommend item recommend formula ¢ ε absolut error compon incorrect classif recommend list pattern compar evalu set mae ¢ perform measur inform retriev recommend system find item interest set item retriev task inform retriev standard inform retriev perform measur frequent evalu recommend perform recal measur inform retriev formula correctli recommend item total recommend item correctli recommend item recal total ul recommend number total recommend recal unknown collect inspect actual total recommend total number recommend estim recal conflict high mean low recal vice versa find optim recal measur defin harmon recal formula recommend evalu literatur refer measur measur recal recal ¢ ¢ recal special case place weight recal defin formula paramet α control recal measur perform measur recommend system measur literatur receiv oper characterist measur signal detect back swet model plot system sensit true posit speci true neg compar effici system compar size area bigger area perform mobash al introduc measur call obtain divid coverag size recommend set favor smaller recommend set tabl summar recent paper evalu recommend algorithm present measur recommend associ rule ¢ £ ¢ recommend base associ rule threshold minimum support minimum confid framework problem find associ rule market basket data satisfi minimum support minimum confid present agraw al associ rule algorithm requir model paper domain algorithm measur shardanand music rate predict algorithm base similar mae mae tween user profil herlock al movi rate neighborhood base predict algorithm coverag sarwar al movi reduct measur mobash al usag aggreg user profil user accuraci action movi rate regress base relationship roc yu al movi rate instanc select collabor filter mobash al usag aggreg user profil user action lin al movi rate associ rule mine recal tabl recommend algorithm evalu paper assumpt make approach attract check model assumpt met requir problem formal im set item set set item transact associ rule implic form call call consequ rule rule support transact set transact rule hold transact set confid con con transact formula formula support confid defin probabl con £ agraw srikant present apriori algorithm effici comput associ rule item rule pass algorithm add item larg itemset prune itemset suffici support algorithm stop larger itemset produc fall minimum support larg itemset produc associ rule simpl recommend system paper associ rule singl item rule item rule item consequ recommend number recommend produc vari chang support confid threshold recent support confid subject critic main point critic confid ignor frequenc consequ data set spuriou rule item consequ data set separ accur rule lift interest altern measur confid frequenc consequ account implic measur symmetr measur lift defin deviat item assumpt occur independ definit lift rule formula £ £ li li con altern measur confid convict convict measur deviat implic assumpt occur independ deriv implic logic reformul divid individu probabl invert ratio negat reach definit convict formula literatur convict superior confid paper framework extens survei variant associ rule algorithm discuss report result lift convict paper associ rule algorithm requir specif support confid lift comput complex gener exponenti simpl associ rule comput complex quadrat order product recommend system organ requir period updat associ rule awar associ rule algorithm design increment updat updat confid support associ rule requir complet updat support confid valu quadrat order number item recommend theori £ con recommend algorithm base theori introduc context bui item mean idea theori stationari situat item independ bui behavior process produc specif distribut number repeat neg binomi distribut statist model base strong behavior assumpt consum behavior invit critic model author empir show model hold consum market show appli simplifi form model logarithm seri distribut special case gener recommend internet inform broker paper set formula probabl observ pair independ item period time total time pure chanc paramet distribut easili estim calcul observ usag frequenc item pair specif item estim relationship state formula ¢ ¤ £ show model fit inform product inform broker model applic item strict assumpt independ usag item assumpt valid item depend usag item cover topic complement inform sourc depend recommend system depend item violat strict assumpt model produc outlier follow fit pair item calcul probabl model divid observ number predict number estim type ii error recommend foral item transact begin gener frequenc distribut transact includ item estim paramet distribut frequenc distribut expect type ii error rate set threshold begin add item highest number list recommend comput expect type ii error rate list end end tabl algorithm comput recommend base algorithm tabl produc item recommend list expect type ii error rate predefin threshold chang recommend list higher lower expect β potenti recommend produc algorithm algorithm produc similar result associ rule variabl confid support threshold set support order associ rule confid set calcul confid preserv rank order number select recommend item made sequenc algorithm associ rule rule set minimum support confid algorithm set rule select total expect type ii error rate set threshold simpl associ rule algorithm paper comput complex algorithm quadrat order increment updat version develop comput complex quadrat order number item total amount item updat recomput advantag simpl associ rule algorithm pronounc ratio total number item number item updat differ matter comput recommend user larg research onlin public access catalog million item number list list size setup size list number proport fig evalu data set size list compar recommend algorithm data set virtual inform system vienna econom busi administr inform system educ internet inform broker access onlin inform product research enrol student research inform product set defin set web page media word processor present logic unit inform specif web site softwar develop gener recommend inform system provid recommend algorithm data set market basket data obtain observ consumpt pattern anonym user market basket item singl transact month usag data june transact item transact item item recommend evalu produc item list item item transact select randomli list student research recommend item person interest answer total evalu recommend interview person recommend figur show distribut list size item select averag proport item list evalu recommend interview person list size smallest size list size larger line characterist dataset zheng al proport good item list independ size list averag £ proport good recommend list size support confid support confid support confid support confid recal support confid support confid support confid fig plot associ rule minimum support evalu result section present discuss evalu result recommend algorithm algorithm data set input produc recommend evalu recommend identifi user find support valu associ rule base vari minimum confid plot recal support threshold figur depict plot perform support threshold data set short transact minimum support threshold chosen small obtain reason recal compar perform confid altern measur lift convict recommend system recommend list low problemat recommend unrel item annoi user reason start minimum support figur comparison figur show plot select minimum support plot vari lift convict lift convict perform significantli confid data framework investig figur compar perform associ rule algorithm algorithm term accuraci coverag algorithm vari threshold includ plot recommend recommend randomli list probabl vari recommend algorithm perform significantli predict item user qualifi recommend support confid support lift support convict recal support confid support lift support convict fig plot lift convict recal random support confid support confid support confid fig plot accuraci coverag random support confid support confid support confid support confid support confid fig accuraci coverag avg error coverag random support support support support support fig averag error coverag avg observ beta set threshold algorithm fig β threshold algorithm randomli recommend perform similar associ rule algorithm framework figur show reason recal algorithm reach accept applic algorithm provid accuraci figur framework brittl respect minimum confid optim minimum support figur show averag error recommend coverag produc algorithm paramet framework perform deterior significantli small confid threshold algorithm show robust behavior respect threshold repres maximum expect type ii error rate β produc recommend list contrast minimum support minimum β independ structur properti analyz data conveni paramet interpret proport incorrect recommend recommend list figur show depend averag observ β threshold algorithm except threshold valu list averag observ β expect threshold maximum expect evalu import part knowledg discoveri process data mine part recommend system question found pattern match concept recommend neglect paper studi question compar recommend human expert result recommend algorithm summar result remain research result present evalu support wide kdd societi accept assumpt frequent itemset histori web usag data repres recommend algorithm accuraci reach studi evalu studi data set plan associ rule free model algorithm requir strong model assumpt user behavior hard verifi invit critic valid model assumpt tend hold approxim wide rang applic consum product investig model consum good appli inform product web site plan result algorithm properli tune similar algorithm paramet independ data set simpl associ rule algorithm paramet strongli depend properti data set algorithm robust regard associ rule algorithm flexibl fine tune algorithm studi paper comput complex quadrat order increment algorithm comput complex quadrat order number updat simpl associ rule algorithm quadrat complex item applic million item possibl perform effici increment updat vital strategi increment updat associ rule develop data set applic addit studi data set confirm find refer data mine associ rule sequenti pattern aggarw yu framework itemset gener pod symposium principl page swami mine associ set item larg proc acm sigmod confer manag page washington rakesh agraw ramakrishnan srikant fast algorithm mine associ rule jorg matthia carlo proc int conf larg data page sept gunopulo rule mine data mine knowledg sergei rajeev jeffrei shalom tsur dynam itemset count implic rule market basket data sigmod acm sigmod intern confer manag page robert srivastava data prepar mine world wide web pattern journal knowledg inform robert walker coolei web usag discoveri applic interest pattern web data ph graduat school theori applic charl griffin compani gregori smyth data mine knowledg page mit andrea michael custom incid model appli recommend system acm workshop mine web log data custom touch jonathan joseph al john riedl algorithm framework perform collabor filter confer research develop inform page jonathan joseph al john riedl explain collabor filter recommend acm confer comput support cooper page decemb ron kohavi foster provost glossari term machin richard georg vladimir sastri person supermarket product recommend data mine knowledg carolina ruiz effici associ rule mine recommend system data mine knowledg srivastava automat person base web usag mine commun discoveri aggreg usag profil web person acm web mine nakagawa tao luo discoveri evalu aggreg usag profil web person data mine knowledg andré im universität karlsruh salton mj mcgill introduct modern inform retriev riedl applic reduct recommend case studi acm web mine shardanand mae social inform algorithm autom interact confer spiliopoul web usag mine web site evalu commun tan kumar discoveri web robot session base navig pattern data mine knowledg van rijsbergen inform retriev approach person recommend system acm web mine kai martin kriegel select relev instanc effici accur collabor filter page acm ron mason real world perform associ rule algorithm intern confer knowledg discoveri data mine acm
HCI/707 4 year report manuel borg group comput depart lancast england prof thoma rodden group multimedia resourc centr fernando portug local prof ribeiro introduct end year report manuel borg group comput depart lancast england prof thoma rodden septemb section introduc context structur base assumpt work report report prepar year assess context phd studi comput lancast main goal report describ work deliv initi literatur submit project base year start project outlin structur research undertaken work year main area interest collabor virtual inform educ applic technolog support knowledg titl ongo work virtual environ inform issu integr work studi inform system aim servic set base multimedia facil assum inform manag inform flow critic success factor base hypothesi factor handl conveni chang dramat product human resourc order obtain kind inform system improv technolog enabl inform flow integr actual keyword appendix emerg inform offer technolog improv human perceiv larg complex manipul inform stuart card introduc process transform knowledg visual form make natur visual capabl provid interfac human mind comput virtual realiti technolog offer great potenti repres inform paradigm repres inform virtual realiti consid deliveri human convinc realiti realiti exist digit electron format memori comput relat term virtual realiti artifici realiti cyberspac virtual synthet virtual environ relat virtual realiti technolog goal repres data wai make engag human sensori system artifici realiti make easier interact user presenc natur possibl manipul imag open user interact directli multipl user interact simultan serv environ support interact text divid specif gener context structur document aim explain aim motiv underli work relat area introduc topic chosen research consid valid motiv work enabl approach technolog implement idea section introduc inform concept technolog literatur outlin literatur review conduct select topic studi research area project present describ posit action relat undertaken research problem aim motiv section explain aim motiv underli work impact vr technolog knowledg educ environ possibl support knowledg intend subject studi approach educ system base convent techniqu suffer limit due complex result larg amount unstructur difficulti pace author inform affect larg human comput solut sight solv problem complex inform sourc move distribut solut reduc problem easili user interact problem remain untouch shift inform content pure data knowledg fit convent system knowledg evolv continu repres support dimens approach work free inform knowledg convent support user inform manag vr technolog start cost vr technolog afford small vr visual qualiti vr system compet tradit drawback context user interact present possibl extend routin appar loss product vr technolog offer possibl build system applic improv modifi radic product improv vr valid comput support cooper work system goal cscw discov wai comput technolog enhanc group work process support time place focu cscw goal social interact technolog vr enabl technolog cscw enhanc focu user attent issu user inhabit common world problem avoid creation virtual environ user collabor vr technolog cscw introduc user embodi enhanc interact refer collabor virtual environ bring essenc make interact inform space individu discuss make visual inform emphasi work put inform knowledg space potenti form modif inform knowledg visual world product issu relat system educ set learn prototyp system test todai educ system chang appendix unpublish paper great opportun appli concept ongo research real set recent european commiss document confirm state access inform answer learn train skill tool enabl user turn inform knowledg document conclud begin wit evolut inform societi knowledg base relat area research section justifi studi problem studi research wai repres inform deal complex volum inform user group user topic constitut central issu research project part expect outcom project augment human intellect research stanford research set explor form comput interact form dialogu user comput graphic dialogu perform medium focu live manipul text graphic laurel add physic emot aspect direct interact worthwhil examin role contribut graphic design interfac tuft introduc role graphic visual inform convei mean book specif book introduc graphic histori languag discuss graphic practic theori data graphic statist book treat principl inform design book escap ad dimens repres discuss repres rich visual world experi measur world dynam book deal design strategi present inform effect word coin book describ creatur flat shape book offer demonstr difficulti break mental structur make serv reflect model facil actual comput system comment book squar make world occupi strang sphere creatur experi circl make larg disappear similar perspect spatial demonstr appendix deal visual inform human issu human perceptu limit understand visual norman defin human interpret social hutchin state cognit social distribut author add cognit activ context fix set surround condit wider dynam process cognit individu part mean cultur factor explic effect intern individu pp introduc perspect concept space present studi human cognit adapt natur surround potenti interact environ rich resourc human cognit cognit compar primarili cultur phenomenon hutchin refer kind physic social space conceptu space conceptu space focu present studi main materi individu commun knowledg system system present essenti featur associ index introduc concept creat inform space materi activ link exist materi individu applianc access inform ted nelson coin term hypertext introduc project extend system type publish creation link exist includ modif turn creation mean interpret elabor dynam structur system collect applianc system pp project exist virtu link link constantli forg broken reader text contribut mean particip creation structur place implement inform annot link system function achiev project distribut hypermedia system world wide web architectur global system access inform web complet unstructur continu chang content link huge amount inform time web characterist make studi challeng current inform inform inform dynam huge amount web inform origin scale consid partial web import concept interfac strategi direct manipul coin shneiderman list criteria direct manipul continu object physic action label button press complex rapid increment oper impact object interest immedi visibl shneiderman argu goal direct manipul creation environ user comprehend feel system state futur direct direct manipul inform focu remark human capabl visual current design time space abil detect pattern relat issu inform field import issu current research interact share individu deal inform share vision virtual realiti system plai import role give form interact inform deal dynam characterist inform import issu context inform share introduc concept collabor issu treat cscw system function combin vr cscw offer environ user involv inform space inform exist remain compon topic literatur survei share inform deal common languag specifi enabl basic commun oper share mean abstract rise question symbol commun issu hutchin manipul symbol cognit process activ person manipul symbol model origin sourc domain languag thought highli elabor cultur specif world human formal symbol system boundari insid boundari abstract symbol world phenomena symbol hutchin defend process symbol intern symbol insid human creat distinct cognit perceptu human hutchin add symbol apparatu fell apparatu support interact symbol symbol put hand manipul symbol materi abstract base distinguish task person face manipul symbol token task accomplish manipul symbol token author present human good detect regular environ construct intern process regular human spend time produc symbol structur conclud symbol world give multidisciplinari natur inform area import defin problem studi inform work raw materi main area studi visual inform main problem visual comput mediat understand commun deal obviou enhanc understand level problem form make dramat differ task proper choic depend method appli problem simpl comparison game tic tac share spatial user percept game complet descript appendix inform main research tool deal complex data dynam inform set actual system deal commun understand learn inform visual natur human improv percept learn aid search comput give influenc inform displai offer visual clue user descript power visual compar word common popular phrase imag thousand pyramid provid start point research discuss higher symbol abstract similar pyramid collin design educ inform level refer idea level author give descript educ educ student data inform data mind combin inform inform relat inform produc idea mind concept explain world student combin idea produc wisdom understand life truth aim educ move figur pyramid lower data consid base raw materi repres inform formal data instruct manner suitabl process human automat mean inform base data aggreg consid materi support action formal definit mean human assign data mean convent appli data inform product filter process raw data potenti form knowledg level add context orient inform level knowledg manag actual research topic inform cscw area knowledg stem analysi inform expert frame refer attribut actual mean illustr progress figur progress top pyramid higher level wisdom long term materi high order structur model realiti wisdom social construct knowledg problem domain transform wisdom base gener action activ coolei data wisdom base relat data combin inform form knowledg combin judgement rang wisdom figur data wisdom transform norman extern part workspac share requir sort construct devic support artefact add thought concept essenc reflect thought gener find consist pattern readili notic world step higher level cognit artefact notion artefact part basic class augment mean methodolog cognit artefact differ notion artefact physic object cognit artefact languag class conceptu defin individu classifi pictur world concept mind model symbol attach concept manipul concept import notion consid access learn cognit perspect human access inform wai amount inform inform distinguish access read search type concept kei concept occur inform space import concept relat part inform relev read user inform space match requir concept definit retriev inform recal retriev inform relev versu relev amount criteria evalu inform access search access part inform space perform system high recal medium access part inform high recal medium access greater part inform space correspond understand task understand problem recal low larg amount inform access type work small medium inform space dimens correspond structur concept greater number relat perform search task inform understand task perform order learn inform space map amount recal valu understand search amount inform figur criteria evalu inform access type understand problem filter abstract inform scheme import understand case paper attract inform base portabl altern laura defin navig cognit process acquir knowledg strategi move chang furna definit concept relat navig distinct task tactic made search consid task target task world queri tactic consist submit descript object sought search engin return relev content inform navig present move sequenti decid step base task environ furna present map build navig subtask describ construct mental physic spatial structur aid multipl rout find task level structur navig design user cognit map base previou experi view structur figur level structur navig design recal gener cognit map interest suggest concept map function learner interpret person knowledg author concept map knowledg applic support learner extern learn space learn cognit experi result kind cognit norman mode relev discuss cognit artefact made human centr mode experienti reflect experienti mode lead state perceiv react event effici reflect mode comparison make mode relat expert behaviour effici creation idea human cognit involv intern activ extern norman categori human cognit design human centr system norman experienti thought automat driven pattern inform arriv depend larg reservoir experi involv reflect mode plan requir aid extern support aid extern norman suggest environ aid cognit design extern tune task hand maxim support cognit reflect quiet materi save relev task continu present environ environ lead experienti drive cognit percept event driven leav suffici mental resourc concentr requir reflect term cognit reflect cognit conceptu process focu design action laurel add perform task person focu attent tool tool feel directli work task rumelhart norman kind restructur extend experienti reflect cognit accumul ad knowledg proper conceptu facilit effici tune base massiv practic tune shape knowledg structur thousand wai skill earli stage requir reflect thought carri mode thought tune thought tune reach expert level essenti maintain form conceptu structur tune primarili experienti mode restructur reflect learn conceptu skill acquir tool integr figur learn main learn activ gener knowledg transform repres artifici intellig perspect view learn activ path knowledg handl possibl obtain solut knowledg actual situat hutchin learn conceptu chang kind adapt larger dynam system state scale learn chang cognit system opportun develop knowledg context practic artefact provid mediat mind world reflect artefact ignor real world concentr repres world figur learn triangl research applic state facil improv inform provid share workabl knowledg share collect cognit map base individu filter potenti educ learn train mediat comput select applic studi research activ conduct year effort direct relat comput mediat set learn classroom extend classroom physic time restrict paper publish intern nation confer deal issu impact web network classroom group mediat comput virtual environ support interact support issu rich technolog form evalu assess role rich technolog environ appendix complet list publish main problem intend research deal problem put class problem consid mean restrict appli order model workabl set paramet repres knowledg inform extend concept map facil account learn develop usabl set symbol serv demonstr concept map enabl set technolog implement space individu control share user select applic idea test base background learn space model answer problem model setup learn gener workabl knowledg inform main goal recur inform enhanc direct manipul interfac perspect laurel enabl technolog section introduc technolog direct impact contribut develop test applic relat studi www develop lab world wide web world wide web www start august tim robert web author submit cern european laboratori particl comput scienc depart particl physic research involv collabor institut world idea enabl research remot site world pool inform simpli make larg number research document file suggest link text file read research quickli displai part paper held directli relev text diagram document scientif mathemat natur repres inform held electron form comput world web larg scale distribut hypermedia network base wide rang servic standard global inform system coordin form octob world wide consortium head tim web gain accept dai peopl world publish work inform system hypertext transfer protocol hypertext transfer protocol protocol design fast effici search resourc hypermedia inform system http work model shown figur figur http protocol stack http commun typic run protocol default tcp port port protocol http protocol implement assum reliabl transport protocol network http commun initi user client applic web browser client establish connect server send applic layer protocol data unit request chain server respond applic layer chain protocol design multipl request chain consist request request header possibl data request line consist request uniform identifi http version method token specifi method perform resourc identifi request uri type method server client retriev resourc identifi request head test valid access post destin server accept data request web form request uri identifi locat hypermedia resourc http uniform resourc locat absolut path origin server messag pass scheme similar internet mail internet mail extens detail descript http descript gener inform structur access inform hypertext transfer protocol version obtain inform http relat protocol present hypertext markup languag document web store transmit html html stand hypertext markup languag simpl languag suit displai small simpl document html base standard markup languag standard system defin document format format tag symbol identifi element html demonstr html public html inform world wide web line document type definit defin sourc html version give detail type mode code cascad style cascad style frame partit browser html tag html initi finish code tag repeat close slash insid page code divid head element page window bodi rest page code head link made element insid tag refer link symbol tag finish hr imag browser shown figur inform bottom indic url select exampl html page form facil paper detail discuss person fernando includ structur motiv object html page graphic turn hypertext imag visual integr web design inform current state relat activ reach current html version includ support style access web page peopl richer tabl form inform html standard histori figur render html page html implement part function concept hypertext system simplest form link support link hypertext link mechan link manag document hyperlink ring multipl aggreg link link target document part link sourc attribut link complet discuss hypertext author defin hypertext approach inform manag data store network node connect link node sourc code form claim html turn present languag netscap vendor user markup present semant cascad style sheet style sheet cascad style sheet separ structur content present appli web css present featur illustr html html css attach separ style sheet element tag present specif pass style sheet html document css actual version level address present issu handl html css provid simpl mean style html control visual aural characterist css tutori obtain browser appli style sheet document account style employ style base strict prefer conflict style sheet occur support navig browser extens markup languag xml stand extens markup languag simplifi form defin syntax markup languag html xml metalanguag defin formal syntax nest rule element world wide web consortium summer develop xml address requir elabor web publish enabl web technolog domain distribut document process main goal system resolv html problem extens user structur support valid support check structur valid import simpl definit markup languag xml faq faq system xml lui sgml light markup languag shown dtd faq element info element subject element author element email element version element date element part element element element part cdata titl cdata cdata tag element defin element structur label content describ element insid element defin mean part symbol element mean mean includ symbol skip includ time ordinari plain element xml content img br written slash final mean program read document img end img insid element defin attribut element part titl plain text skip element attribut call plain text skip differ xml html user defin tag attribut document structur xml document option descript grammar applic perform structur valid xml languag exist html document document conform html specif convert xml sgml document document gener document peopl defend css xml replac discuss made standard document style semant specif languag creat subset xml stylesheet program languag extens stylesheet languag xsl displai public dtd style stylesheet constant element style faq info paragraph subject paragraph version paragraph sequenc part paragraph sequenc xml provid foundat manag document inform compon document document independ document file physic logic structur distinct inform inform xml document object model document object model applic program interfac support xml html browser api make make java applet javascript chang displai xml encod inform web browser inform document object world wide web consortium dom level dom potenti vrml redefin xml vrml viewer written java applet dom vrml html extra softwar client side applet instal remov common gatewai interfac common gatewai interfac agreement http server implement integr script program gatewai legaci inform system document specif actual cgi consult cgi specif maintain ncsa softwar develop group plain html document mean exist constant state text file chang edit file make cgi dynam cgi execut real request user run server side shown figur figur cgi program execut server side give access server file web cgi program web daemon execut access file transmit inform receiv result back displai client interact web server local gatewai develop cgi program program languag script languag perl tcl appendix list complet program cgi invok url resourc html form tag method protocol html code workabl form render figur form html element user input part postprocess form languag method input data html form cgi post method similar similar post case html code form figur page displai mail technic support field support product support engin enter email enter form action url locat server execut normal complet form html web page submit form button option form line inform form pass method case mean inform pass cgi program inform form encod standard url format chang space encod special charact encod list program decod url format figur show inform receiv give variabl valu displai origin url line html page result cgi data form figur result format output http server program appendix cgi return document type html audio clip cgi program place short header output header ascii consist line separ singl blank line output bodi nativ format figur render input html page cgi figur render output html page cgi cgi program full document mime type ascii adob pdf format imag gif format altern full document refer line start word locat url refer intend line empti java languag java portabl program comput includ web browser understand decod java applet develop applic tradit environ java develop small size program execut client side applet download server browser understand java java languag develop normal applic code figur applet execut client side compat sort web applet compil special binari code understand machin bytecod bytecod compil run virtual machin java virtual machin implement java virtual machin specif platform permit execut java bytecod machin overview java languag environ gosl secur issu relat java discuss support develop sun offer java develop jdk version window download work environ environ util java compil debug applet viewer product api java develop kit download java applet import public class extend string int public void public void program receiv paramet html page call perform report paramet make loop print paramet number time paramet render imag shown figur html applet program pass paramet give text replic number paramet java platform document primari sourc inform gener overview java languag discuss impact java languag emerg type softwar develop figur render java applet virtual realiti model languag virtual realiti model languag standard file format multimedia share virtual world internet state vrml consortium discuss forum manag vrml html popul internet implement graphic vrml add level structur extra dimens onlin experi applic vrml educ share virtual world vrml consortium add vrml intuit human space time user interfac interact program languag comment evolut web movement command line emerg defin stage vrml intern standard standard function specif access iso intern standard establish record specif month histori evolut vrml vrml enabl interact graphic sophist virtual environ standard includ rule incorpor java insid vrml scene open potenti implement virtual world hardwar portabl permit share world comput network connect web browser vrml languag descript specif space view browser browser act ascii file interpret vrml scene capabl scene render user point view textual descript scene vrml ascii file format design platform extens suffici compact work connect vrml develop virtual world format consid graphic extens languag object orient approach vrml file number element call node discret scene repres group event rout statement creat behaviour space object node common properti type default field capabl send receiv messag set field valu deriv class overrid default benefit vrml instanti gener obtain visual tangibl result vrml offer predefin librari object scene element inherit enabl deriv node prototyp vrml abil refer standard web html document scene demonstr vrml scene figur vrml file list list complet descript scene repres figur browser vrml commun soni complet list def trunk transform father node translat son node shift meter rotat son node suffer rotat children def transform node trunk transform translat sphere move unit children shape materi materi geometri sphere radiu def anchor url children shape geometri box size figur render vrml scene soni work group vrml consortium special interest present world group work group goal live world work group defin set vrml iso convent support applic interperson interperson mean support virtual presenc peopl scene peopl interact peopl object scene mean creat applic assembl librari compon develop independ multipl supplier client system conform vrml standard group intend defin conceptu framework set interfac support creation evolut applic vrml draft live includ interfac posit state share object inform exchang object person system secur vrml librari util overcom vrml identifi integr interact capabl implement vrml script work group develop free softwar written java di vrml distribut interact simul protocol commun state inform veloc multipl entiti particip share network environ group implement virtual environ call technolog collabor di essenti behaviour protocol tune interact java program languag implement di perform math commun network commun vrml scene vrml graphic model render local remot entiti share virtual world world wide web issu world wide web major inform base consid digit librari huge hypermedia repositori document inform lack context trust navig problem web grow fill transient inform estim million page averag page onlin dai turnov number page report doubl year web site estim total data gb chang rate gb month effort made introduc semant web page retriev inform metadata initi educ field web refer nielsen state origin main problem motiv work support wai group peopl work add vision web channel interact sea share issu inform address present studi stai resolv servic web ideal environ test research idea due minim invest technolog opportun real user data avail set complement document protocol reliabl technolog support develop list web develop share knowledg notif chang built structur access control trust integr audio video enabl group editor distribut simul environ object manipul capabl web servic user easili publish inform web technolog integr classroom educ web instruct tool aspect consid web interfac issu consid adapt medium narr structur list top ten mistak web design gener issu list web design success web build web vision kei internet author methodolog web develop decemb internet medium add medium medium medium word worthi watch mean produc inform make impact futur commun format system intersect cscw vr system bring work year group potenti interact merg result obtain research cscw area virtual realiti technolog collabor virtual environ global concept frequent cyberspac term coin virtual scienc fiction book lead concept influenc theorist design virtual realiti system cyberspac work environ predic hardwir commun interfac direct total sensori access parallel world potenti work definit global comput access realiti comput heard object physic physic object charact made pure cyberspac lead design potenti project advantag environ fernando actual inform technolog servic evolv potenti project focu inform knowledg virtual object manipul user laurel definit adject virtual thing feel realiti lack tradit physic substanc virtual object respond research area relat collabor virtual environ opportun implement assess valid concept term todai technolog evolv applic system defin benford meet peopl interact comput order obtain common goal involv distribut virtual realiti technolog support group work condit present order system consid provis simultan access virtual realiti system explicitli support user work import aspect kind system exist virtual space defin immateri world distanc interact user set network comput state interact accomplish exchang written idea space possibl movement voic exchang open system system internet relai chat includ mud irc system discuss social implic perspect share point user awar user benford state essenc user explicit repres share space state share space exist inhabit user space number stabl technolog mud distribut vr main reason develop support natur spatial social skill offer natur human inher address interact larg number user applic spatial current offer design support extend support collabor short introduct work progress web page method usabl evalu design issu descript type issu collabor work virtual environ present discuss user embodi made state user embodi mean provis user bodi imag repres share space concept form overlai comput gener world set augment realiti includ open share workspac paradigm author describ pilot studi impli wearabl support collabor user perform interfac collabor environ smith extend wysiwi abstract share present model manag subject view churchil report studi impact usag virtual environ semant structur inform space mean collabor user inform system conclud preliminari result virtual environ present metaphor instanti inform resourc inform retriev facilit virtual environ experi set network result state time inform perceiv head coupl stereo view view issu consid popul inform terrain awar spatial model presenc network place mix cover collabor virtual environ tutori comput support cooper work import contribut area develop comput support cooper work state cscw emerg identifi research field role comput group work primari cscw characterist point interdisciplinari research involv peopl comput human scienc cscw system provid mean give answer question group peopl collabor peopl plan work comput group work redefin advantag focu peopl work unifi theme cscw de mich gener requir cscw system meet complet multimedia integr commun action ad select workspac interfac wexelblat defend principl separ mean comput support fit normal user work pattern principl cscw applic peopl cooper overcom barrier space time peopl lead function discuss import factor cscw applic collabor wexelblat defin knowledg support activ design specif applic wexelblat virtual technolog enabl technolog cscw cscw studi broader field inform system comput support comput work system expect extend studi learn environ work environ keynot address confer state cscw system impli group context kind technolog support group activ core cscw figur inform technolog enabl role envisag form action individu group note inform system process relev data order support peopl undertak action enabl support figur cscw paper introduc collabor desktop number tool design support collabor present make direct manipul interfac tool team map overview member telephon exchang establish connect answer machin real world answer whiteboard exchang draw graphic tool asynchron synchron collabor write document author demonstr collabor environ design implement base tool room metaphor electron hallwai metaphor paper describ cscw environ distribut design model base layer knowledg basic commun cscw combin tool excel refer cscw tutori note tutori grudin web resourc give updat inform cscw survei report cscw bibliographi cscw global directori acm special interest interest topic relat system team group impact workplac set usabl web find inform cscw groupwar issu paper overview import issu cscw present interview grudin roger earli discuss requir cscw platform made schmidt rodden cscw system extend deal coordin issu report maurer paper result wet ic applic present rodden present notepad support tool collabor dialogu report influenc interfac system short text fragment posit support graphic notat shape colour design cscw system offer support develop studi path gather inform field studi work analysi project report cscw symposium framework method design cscw system al summari approach cooper softwar develop support group group coordin greenberg make real time distribut defin term present concept map groupwar applic refer import issu kind system virtual realiti virtual realiti enabl technolog system treat vr gener solut address direct abil visual program process introduct paper virtual realiti describ vr technolog mix hardwar devic softwar techniqu short introduct made vr michigan introduct paper paper site section inform market observatori introduct paper vr applic descript vr interfac vr classic paper vr bring chang strateg emerg virtual implement chang work virtual tactic interact graphic plai import role artifici intellig artefact object orient vr displai control technolog envelop person interact virtual author vr technolog artifici world sensori user real spatial environ inaccess virtu physic incompat user present idea human interact machin comput repres realiti medium human interact realiti user invok environ interact directli result interact accomplish comput interact perspect repres schema figur essenc virtual realiti multimedia environ user reach harrison vr deliveri human convinc realiti exist digit electron form memori vr enabl technolog bring metaphor interact human machin metaphor inform creat thing peopl machin understand vr metaphor real spatial inform analysi handl requir cognit pictori ve enhanc user abil explor data geograph inform system potenti applic vr educ inform report import biggest applic educ figur human machin project defin distribut virtual realiti state interact distribut simul interact manipul interfac unit freedom convent keyboard practic author comment system object process obviou visual abstract thing visual great potenti combin technolog convent data virtual environ defin set user presenc navig comput gener interact environ defin user transpar interfac ve virtual cyberspac artifici realiti comput support collabor learn dimens preserv context open distanc learn gener educ learn interact student essenti learn requir technolog prove potenti deal requir interact orient comput support collabor learn gener cscw discuss defin social pursuit share joint simpli refer central everydai live cooper learn process definit state human group collect interdepend perceiv group member group member interdepend relat group role group function expect present complet discuss natur cooper system conclud reason peopl work cscl environ work group group work complex wai open learn situat simultan influenc group includ distribut system virtual technolog augment group environ add influenc social structur group work produc inform product inform oper finer level detail make clear distinct collabor work particip part collabor base agreement particip resolv problem unifi outcom state learn posit effect student work learn behaviour listen addit competit learn goal relev learn justifi introduct ict support enhanc cscl principl adapt advantag refer outcom internet ict base odl rapidli gain popular import mean provid learn technolog cscw vr enhanc foster knowledg develop system provid experi mean augment teach learn skill user creat form dynam inform relat learn commun multipl altern shneiderman discuss emerg pattern electron base experi web network support assess collabor format discuss impact telemat collabor learn relat educ situat distribut knowledg studi educ field shown student learn manipul inform expect appli implement issu classif tool classif user interfac perspect histor list text base interfac virtual realiti interfac exampl type tradit mud irc system system consid strictli pure defin exampl virtual realiti interfac distribut interact virtual environ gener develop environ nottingham process discuss relat project manag issu develop virtual environ learn set discuss multimedia user virtual environ ubiquit comput made advantag discuss order support link part commun group member depend exist potenti link link includ mechan messag electron meet discuss forum approach support commun identifi approach base share workspac share workspac particip share common area express idea build product share workspac resourc interact support refer inform share model support collabor involv conferenc conferenc desktop multimedia conferenc electron meet system benford classifi share space media spatial orient video collabor virtual system altern classifi exampl comput game vr design support medium larg number user virtual virtual world user repres exist autonom agent behaviour control comput program gener classif refer exist system challeng higher educ ad platform manag set servic campu build facil detail discuss implement issu virtual environ present earli introduct discuss softwar requir develop virtual environ sourc zyda al paper protocol implement network commun distribut virtual kessler hodg updat queue earli project distribut collabor studi virtual world potenti interfac classif gener collabor task includ exchang experi knowledg team idea problem includ activ synchron asynchron inform exchang document kind inform structur coordin includ assist virtual space tool softwar rapid construct object virtual environ model save format massiv dive inform tool technic issu develop cscw system support discuss rodden smith rodden present develop simpl mechan enabl dynam support tailor user interfac share interfac chen gain develop model virtual interact web make comparison groupwar develop groupwar system web made research describ interconnect exploit interfac connect problem difficulti interact web browser system browser bookmark facil base inform share system web browser combin textual creat inform rich spatial system web support constructivist model case project extens normal web page made recur cgi creat workspac tool workspac connect web distribut medium author environ support interact present distribut audienc web guidelin web interfac design made base usabl studi paper present field studi valu collabor set system enabl collabor web basic support cooper work develop germani actual version server softwar platform unix window nt system inform system collabor framework set applic call framework develop method develop creat convert exist applic collabor applic system written java support jdk version beta descript present inform system comput richard ham data provid inform subject abstract displai inform recent invent andrew defin inform visual present inform space structur facilit rapid assimil understand author give collect inform pointer complet document inform andrew report inform report techniqu survei research system web resourc inform oliv inform environ stanford al defin inform transform symbol geometr inform intellig find artifici memori support natur mean percept main goal inform relat human aid reason inform offer support structur spatial graphic aid pattern chang visual cue reason larg dataset multipl heterogen inform sourc factor reason develop cognit artefact inform techniqu vision highest bandwidth human human good recal imag inform advantag human perceptu abil dictionari definit word number definit relat inform gain human ey na altern dictionari suggest mental imag dictionari definit power process form mental pictur vision present definit open result input combin human restrict imag make larg dataset coher present huge amount inform present inform present inform level detail gener overview fine support visual turn visibl data stori data research system popul inform terrain pit concept aim provid inform system kei idea vr technolog pit defin virtual data space inhabit multipl user characterist user work data present prototyp pit approach comput facilit access larg rang elimin tediou method displai process repres figur step adapt figur process state extend graphic paradigm expand input data analysi process reduc larg amount inform short summari remain accur descript total data overview graphic made main issu techniqu list base hierarchi notion paper present overview classic techniqu multipl map view techniqu hyperbol intellig magic introduc approach discuss strength limit techniqu approach taxonomi inform north graphic statist yu framework understand graphic base idea balanc summari raw ten method multivari data author conclud colour statist graphic long neglect chang due hardwar chang type graphic creat process adjust smooth understand facilit extens graphic concept interact displai inform interact graphic method defin class techniqu explor data user manipul graphic data interact graphic refer direct manipul graphic dynam graphic list number reason interact significantli improv static possibl interact graphic displai graphic element encod data make pattern appar invit explor understand data manipul gener discuss interact graphic made make good requir characterist user knowledg human percept graphic design relev good displai obviou focu attent give indic scale locat data cleveland order difficulti decod visual start easiest posit common posit colour colour densiti applic area inform scientif appli comput scienc method produc output huge amount produc data requir high bandwidth human visual system speed sophist pattern interact add power system provid singl context activ involv debug explor commun result applic area softwar defin craft graphic cinematographi modern interact technolog facilit human understand effect comput comput author intend includ softwar design process plan implement small present taxonomi system involv comput softwar research point interact tool map data visual kind automat select data map report inform method evalu intellig collabor program aim enhanc collabor team distribut inform main kei challeng develop softwar share abstract space report research challeng map real object data method augment real space inform add difficult problem develop techniqu abstract research develop method repres abstract inform space navig space turner al describ symbol battlefield data sensor simul posit terrain literatur survei section present direct literatur survei relev area ongo research work work focu inform issu virtual collabor virtual environ order gather inform topic focu intens research constant survei result expect book inform research area edit shneiderman preview inform addit literatur survei conduct order collect data base import issu deal actual main theme research question inform consid good relev find cognit human factor contribut good textual form multimod imag issu relev question area studi technolog system support constitut deliveri project work year project continu research orient obtain achiev result remain work time outlin work develop present develop idea system share inform space visual user lead dynam model altern set share give visual inform space studi element augment user percept inform consid main applic test research idea educ area work prototyp test idea concentr issu intend address inform share inform space support technolog studi intend model advantag inform enabl user share inform space wai system achiev result gain insight deal project develop test metaphor inform knowledg educ creation interact inform space context goal start point motiv project attempt tradit access content inform system class fernando descript electron resourc project advantag technolog environ student laptop comput access network potenti environ idea implement project technolog virtual realiti system technolog educ set reveal disadvantag bring clear ad challeng creat inform inform system open form present simultan interact facil educ set learn student teacher interact contribut activ form construct knowledg project work web access multipl inform resourc mean inform consid part system metaphor sum main goal metaphor facilit student build person live fall back start group inform type normal class suppli teacher content ad multimedia student constel result relat space teacher access space inform constitut student constel construct inform adapt correct posit teacher wrong data activ punctuat activ turn visibl connect constel element star student element star develop correct visibl global access stage internet area built enrich student import consid work consult develop pick inform work part start construct student goal move insid grow ad star student reach knowledg level contribut creation guid offer perspect conduct thread space inform linear introductori studi knowledg area import advantag system group work sum learn open format orient collabor final phase work develop group gather learn part school thought valid differ integr individu learn converg group work inform knowledg group part structur result work servic expect result project strang option easier closer habit file folder link fact remov side characterist physic world characterist real facil repres real world inform remain unknown present knowledg data difficult percept relationship turn clearer hierarchi inform interact virtual world user deeper manipul compon simul question remain answer type motiv learn fundament order learn effect manipul control user reinforc refer motiv student feel domin understand easili space student creat multipli develop teacher begin quickli share element contribut goal collect work constitut ad result reach human develop work outlin research work develop year follow gener line present report focu gain insight present practic educ environ platform test start novemb septemb deliv literatur survei inform area virtual environ explor question set present section year report end januari work develop practic model repres inform knowledg issu end juli develop implement web applic end septemb give group task defin manag project timelin group activ literatur model prototyp usabl holidai time write year report figur project figur chart literatur survei facil prototyp implement usabl test figur chart year figur chart year year report appendix synopsi master dissert faculti engin msc electr comput telecommun specialti inform manuel borg abstract work describ studi inform system aim servic set base multimedia facil multimedia facil afford comput system capac kei factor boost creativ product multimedia chang relationship user inform system present work assum inform manag inform flow critic success factor factor handl conveni chang dramat product human resourc order obtain kind advantag inform system improv technolog enabl inform flow contribut multimedia telecommun applic determin impact inform system work introduc type applic meet requir identifi studi applic support technolog serv base specif develop applic data commun ad data inform inform multimedia applic appendix learn bring window wall exist technolog global polit impact manuel borg phd comput lancast abstract turn centuri troublesom common system histor question challeng valu world work real effect evolv educ system bring societi polit global balanc institut model power relat success bring educ predomin form interact common interest combin emerg complet easi answer import factor role technolog break tradit continuum natur impact societi gener introduct difficult doubt danger manag creation system initi profit preserv defend gain learn train move dai sign differ student societi institut teacher lost pace chang lack interest student make thing work tradit educ environ great major student kei futur tradit learn specif content order leverag import diploma certif major market share visibl inform eventu cover includ undergradu situat introduc differ regular educ easili handl chang innov difficult older bigger system regul base recommend insid place celebr differ situat occur year educ excel thing drawback fast transform number professor number student factor chang practic class role inform technolog state regul technolog balanc qualiti quantiti return situat teacher termin output devic regular educ system make chang educ expert coin term ict inform commun technolog studi ict system deliv odl distanc system relat odl tradit relat analysi show trend adopt grow year trend applic classroom widespread trend distinguish educ onlin educ import estim cent colleg offer act educ distanc educ similar situat countri close educ peopl cope common answer life long learn peopl return learn train situat time life educ wai discuss concern continuum chang technolog reinvent time space student access inform teacher comput network commun peopl gather share problem solut part inform sea consum produc mean real differ strong impact educ system mean thing pass pass situat knowledg cumul activ base orient line thought gather relat situat interact discuss bring definit structur base knowledg futur connect classroom form interact regular lectur altern form lectur student activ role make individu belong potenti group influenc modifi form knowledg basic skill relat inform strong compet inform technolog knowledg paper pencil hardwar languag softwar order cope strong connect store creat asynchron synchron connect time reinvent physic percept start technolog combin place time make relat peopl artefact cellular telephon electron internet version newspap make role put peopl connect relat believ creat notion commun year belong correspond post travel lot citizen world grown number peopl bring realiti physic place longer import easiest bui book internet expect arriv faster bui normal bookstor contract peopl place commun problem problem local aspect import distinguish modern system predomin interact mode dynam characterist repres inform make differ capac abil advantag technolog offer cope knowledg commun skill prepar futur educ system technolog innov kind wait educ import industri sector figur time space dimens technolog support social interact refer em ao ninth colin lectur imperi june june opportun student threat develop intern march educ impact educ technolog teacher de decemb appendix influenc form task adapt game digit turn digit player digit sum win plai game rule tic tac toe tabl line cell mark mark player put mark free cell player mark straight win plai game rule compar game turn arrang game spatial make game easier player player player player player appendix illustr pitfal inform displai major task user perform find relev inform comput desir problem point surfac displai grid pass dot straight line pen surfac solut straight fourth straight cover inform problem easili solv start grid point problem point consid repres symbol appendix map point project point common test prove mental misinterpret align point problem perspect align point challeng make surfac peopl fail form surfac align point sheet paper work project project point surfac figur paper perspect end point align project xz consid space permit gener repres imag point project xz surfac repres point give surfac appendix paper publish period novemb septemb technolog relat discuss potenti chang learn technolog higher educ portug intern para de de da web em de de de softwar universidad de portug nation de de ao de softwar portug nation role teacher rich technolog workshop current base odl porto portug person invit discuss collabor virtual find altern wai member twelfth biennial confer commun millennium sweden intern support teacher teach current experi internet facil virtual inform technolog educ intern confer portug intern altern form evalu student journal vol pp portug issn nation da pp portug isbn intern move action electron learn bring inform technolog intern confer netherland intern titl paper written paper english list present date earli date paper access web appendix lui manuel borg april de um da para statement formal program work class process input stream html form class cleanup routin int char char int inlin null class cut doubl space int char class chang separ variabl int char class chang space int char class chang decim char int char msg class convert string dec string int int int class clear extra messag char routin class subroutin obtain variabl int int int int int char return true class check input int return return color code white black grei red green blue yellow cream magenta grei html standard class program deal cgi class standard standard part char void void void void void void header void background header void void void imag void void int void inform http server send html color live void add classic html begin page void inform http server send html code void give color void add html close tag void add comment void add imag void add imag altern text void add link void main program receiv input http server comput form variabl give feedback web user html void char standard char char char input http cin obtain form includ access file task made program give html page glossari cgi common gatewai interfac cscl comput support collabor learn cscw comput support cooper work css cascad style sheet collabor virtual environ di distribut interact simul dom document object model document style semant specif languag dtd document type definit html hypertext markup languag http hypertext transfer protocol ict inform commun technolog inform system inform technolog life long learn larg scale virtual environ odl open distanc learn sgml standard markup languag ve virtual environ vr virtual realiti vrml virtual realiti model languag www world wide web xml extend markup languag xsl extens stylesheet languag refer para sistema de da master decemb march volum virtual butterworth short virtual realiti laboratori realiti data visual problem virtual applic explor academ pp manag virtual virtual applic explor academ pp pfeifer domain goal realiti virtual realiti virtual applic explor academ pp virtual tutori european confer comput support cooper septemb european commiss research develop technolog educ european inform market exploit research research center augment human ed cooper book read morgan pp graphic commun spring joint comput pp perform medium work group ed cooper book read morgan pp edit addison weslei visual displai quantit graphic press graphic press graphic press penguin penguin make defend human attribut ag addison weslei mit press ed cooper book read morgan pp user strategi effect addison weslei manipul interfac excerpt debat iui chi novemb volum world wide commun pp perspect ed learn interact develop multimedia tool pp american nation standard nation dictionari inform process blackwel ao de skill ed skill ai realiti search futur wilei inform success manag inform pitman publish conceptu framework augment ed cooper book read morgan pp inform retriev american vol pp write framework explain differ commun vol pp septemb electron workshop report workshop issu navig electron inform environ role concept map portug septemb human activ approach user pp digit knowledg confer toronto februari scientif american issu darpa meet world wide web establish access expand annual pp pyramid alert sun magazin collect talk bush ten mistak web alert sun magazin success web build web vision kei internet decemb comput volum number futur sun art review hypermedia issu rutger jersei introduct document inform sun microsystem electron publish world wide resourc rfc octob internet close book electron prentic hall shift comput societi august softwar comput societi august java languag white sun microsystem gatewai world wide web consortium vrml rider ac book literaci ag alan ed virtual realiti applic academ pp de passag william gibson cultur model ed mit pp step mit pp experi move action electron learn bite intern pp spatial model interact larg virtual european confer cscw itali septemb internet method ict base bite intern pp classroom web page captur onlin parti object spatial model al european confer comput support cooper kluwer academ pp virtual campu workshop higher educ virtual nottingham juli ed cooper book read kaufmann pp de cscw architectur european confer comput support cooper john al kluwer academ pp hypermedia vr field educ bite intern pp context realiti match invit lectur lancast england practic applic busi prentic hall realiti planetari ed virtual realiti applic academ al mit press de integr train strategi higher educ bite intern pp basi london comput support cooper london collabor inform octob research borg framework classif comput support collabor design iii intern workshop groupwar octob support ed cscw na introduct case verlag artifici comput support cooper work pp al softwar requir comput gener virtual virtual vol mit cambridg pp infrastructur requir virtual vrml san decemb al explor al confer supplement european confer comput support cooper lancast pp support teacher teach current experi internet facil virtual extend abstract accept intern instituto piaget realiti technolog work paper virtual engin ed report virtual cec dg xiii european commiss embodi collabor virtual augment realiti approach comput support collabor washington comput washington collabor inform retriev virtual nottingham guid develop virtual project washington multimedia user multimedia virtual lesson multi user technic lancast graph virtual realiti displai time good ieee confer visual languag st pp silva space solut interact spatial lisbon ben shneiderman inform morgan kaufman pattern electron work usa learn support potenti collabor learn paradigm conceptu european confer ai educ septemb altern form evalu student vol pp realiti multicast network architectur virtual ieee pp network commun protocol distribut virtual environ ieee vrai groupwar state art futur tutori european confer comput support cooper septemb cooper person web page lancast cscw present futur sigchi bulletin vol april tool support collabor dialogu graphic technic report lancast requir cscw technic report lancast support project workshop enabl infrastructur collabor june stanford usa control system research report lancast develop method project report cscw march workplac studi technic report lancast framework classif comput support collabor design iii intern workshop groupwar octob time distribut ed encyclopedia distribut comput kluwer academ publish intern confer futur commun octob metadata intern confer world wide web juli commun acm vol number support cscw research centr lancast cooper posit research report lancast access model share research report lancast support virtual cooper interact ed network virtual group internet web base cooper interconnect intern report universidad feder rio de brazil share system www interact intern confer world wide web juli www interact textual virtual environ framework experi navig intern georgia institut collabor www learn environ world wide web confer al environ support interact present distribut audienc world wide intern workshop web interfac realtim web confer research program distribut multimedia applic network ieee network decemb sweden collabor interfac sweden comput natur talk american associ advanc scienc annual meet februari principl taxonomi softwar journal visual languag comput pp collabor techniqu interact bell draft comput introduct cognit edit press sim uc berkelei al armi research laboratori technolog inform comput scienc technic durham support cooper research lancast inform virtual environ share research lancast method scientist tabl content introduct aim motiv relat area research enabl technolog www develop lab world wide web hypertext transfer protocol hypertext markup languag cascad style sheet extens markup languag document object model common gatewai interfac java languag virtual realiti model languag world wide web issu system intersect cscw vr collabor virtual environ comput support cooper work virtual realiti comput support collabor learn implement issu inform system literatur survei project context goal metaphor expect result project work outlin appendix appendix abstract introduct technolog reinvent time space refer appendix appendix appendix appendix appendix glossari refer tabl figur figur pyramid figur progress figur data wisdom transform figur criteria evalu inform access type figur level structur navig design figur learn triangl figur http protocol stack figur render html page figur cgi program execut server side figur render input html page cgi figur render output html page cgi figur applet execut client side figur render java applet figur render vrml scene soni figur cscw figur human machin figur process figur chart year figur chart year
IR/708 5 learn visual track recognit human hand ying thoma huang beckman institut illinoi il abstract proc due larg variat rich visual statist learn concern practic visual process visual track recognit statist model train larg set train data trivial obtain larg label repres train data difficult obtain satisfactori gener difficulti automat select good featur combin label unlabel train paper learn investig issu learn bootstrap model transduct induct learn transduct learn main case specif learn techniqu gestur interfac emploi testb research introduct current virtual environ convent interfac wand inconveni unnatur recent hand gestur human comput interact serv motiv forc research hand track gestur recognit hand gestur complic model mean hand gestur depend peopl set specif hand gestur vocabulari predefin ambigu limit hand track postur recognit main compon gestur interfac goal hand track locat hand region video sequenc skin color offer effect effici segment hand region color distribut color current techniqu color track classifi gener ballard jone rehg huang parametr gong color current research copyright american associ artifici intellig reserv techniqu plagu special difficulti larg variat skin unknown light condit dynam scene solut make gener statist skin color model collect huge train data set rehg gener color model work user case collect label huge trivial good gener color model skin color light condit color constanc problem trivial color track dynam scene chang light color distribut time statist color distribut chang time color classifi train specif work scenario gestur simpl command manipul gestur defin fulfil natur interact hand postur recognit recogn hand sign view direct approach hand configur estim advantag hand model shah heap hogg huang lee rehg kanad wu huang hand configur independ view method directli achiev recognit classif hand postur applic command altern approach approach weng quek zhao von de malsburg classifi learn set imag sampl easier approach achiev major difficulti automat featur select train data collect good gener requir larg repres label train data set manual label larg data set tediou scheme cluster jacob hard pure approach achiev accur classif color track formul tive learn postur recognit formul induct learn problem learn problem unifi framework learn train data emploi problem formul unlabel data featur extract select independ design classifi discrimin analysi techniqu offer mean automat select weight put harsh requir train data larg label data set expect discrimin analysi output good label data sampl label learn interest result theori support vector machin classif boundari relat support data set identif support vector motiv role vector easier collect unlabel data issu combin unlabel data learn begin receiv research effort recent research problem infanc assum parametr probabilist method base svm bennett joachim size unlabel data method formid comput resourc mathemat program difficulti method select kernel function heurist altern method fit problem em framework emploi parametr model nigam al applic text classif em offer systemat approach method larg depend priori knowledg probabilist structur data distribut probabilist structur data distribut paramet probabilist model estim learn imposs assign class label label data hart fact suggest label unlabel train data label data label class unlabel data estim paramet gener model learn hybrid train data set consist label data set featur label size unlabel data set size set make assumpt distribut classif problem repres arg max subset data number class learn special case induct problem learn induct learn classif repres arg max convent learn induct learn depend data set data set pure learn pure learn larg unlabel train set small label set transduct problem learn transduct learn classif repres arg max classifi obtain induct learn highli huge label train set requir achiev good gener requir gener relax subset data space gener transduct learn defin unlabel train set data illustr color color pixel label color classifi model transduct color classifi time frame classifi pixel current specif imag featur data set specif classifi simpler imag time specif classifi transduc classifi work imag classif arg max label number class care perform classifi transduct learn transduc classifi figur show transduct color classifi transduct feasibl joint distribut joint probabl gener unknown priori knowledg transit color space time assum classifi time give label sampl data divid figur illustr transduct classifi label data set unlabel set distribut transduct classif written specif classifi transduc classifi combin larg unlabel data set gener model assum hybrid data set drawn mixtur densiti distribut compon mixtur model repres sampl drawn hybrid data set make assumpt compon mixtur densiti correspond algorithm describ em framework algorithm learn problem em framework label unlabel data treat miss approach appli transduct learn problem train data set union set label data set set unlabel set assum sampl model paramet estim maxim posteriori probabl maxim introduc binari indic ic ij iff ij ij em algorithm estim paramet iter hill climb altern calcul expect valu unlabel estim paramet em algorithm gener reach local maximum consist iter set set arg max denot estim iter probabilist number compon mixtur em estim true probabilist model paramet perform bad gaussian distribut assum repres class assumpt invalid practic algorithm gener probabilist structur data em fail structur assumpt hold approach problem structur select comput resourc altern find map data cluster map data probabilist structur simplifi captur simpler gaussian mixtur multipl discrimin analysi techniqu offer relax assumpt probabilist em suppli mda larg label data set select discrimin featur mda natur gener fisher linear discrimin case multipl hart basic idea mda find linear transform map origin data space space ratio scatter scatter maxim detail found hart mda offer mean catch major differ class discount factor relat classif featur relev classif automat select combin linear map featur substanti physic mean advantag mda data cluster extent project make easier select structur gaussian mixtur model appar mda statist requir label sampl estim statist covari combin mda em algorithm combin paradigm basic idea enlarg label data set identifi sampl unlabel data techniqu made enlarg label set begin weak classifi learn label set expect weak classifi unlabel sampl classif confid jk base probabilist label jk assign weak classifi jk jk heurist weight unlabel data choic mda perform weight data set data set linearli project space dimens unchang label paramet probabilist model estim probabilist label bayesian classifi algorithm iter descript dem algorithm algorithm label set unlabel set classifi paramet begin number compon iter weight return end note simplif probabilist structur mda compon data distribut mix find linear map nonlinear map found simpl probabilist structur approxim data distribut map data space gaussian gaussian mixtur experi show work pure em experi color track formul transduct problem hand postur recognit treat induct problem investig effect effect report color track compact color space substanti physic found give satisfactori color invari light condit hsv color space linear transform rgb higher color space combin hsv rgb space evalu algorithm color assum segment calcul classif error real applic segment color distribut transform shift element pixel ad red filter color classifi learn error rate simpl color classifi fail correctli segment hand region skin color error rate iter error rate em confid level unlabel data unlabel data unlabel data figur show comparison em show effect number label unlabel data figur show comparison em lower classif error rate feed algorithm number label unlabel sampl number label data control confid level confid level size label set combin unlabel data larg reduc classif error label data unlabel lowest error rate achiev unlabel lowest error rate drop transduc color classifi shown figur figur hand local perform real experi implement track run singl processor sgi workstat figur show hand local typic lab environ figur skin color part hand camera move upward light condit hand hand darker shade light sourc frame hand postur recognit gestur vocabulari gestur interfac hand local system emploi automat collect hand imag serv unlabel local system output bound box hand hand postur larg unlabel easili construct unlabel hand imag note bound box imag introduc train data set postur sampl manual label investig effect unlabel data compar classif construct test data consist label imag physic mathemat featur hand experi gabor wavelet filter level orient extract textur standard deviat wavelet coeffici filter coeffici fourier descriptor repres hand shape statist hand contour total edg moment edg distribut imag featur total resiz imag mathemat featur extract pca feed algorithm number label unlabel sampl unlabel sampl label mathemat featur extract pca princip dimens mda set shown figur combin unlabel data reduc classif error number unlabel data error rate unlabel data unlabel data unlabel data unlabel data unlabel data dimens pca figur show effect label unlabel data show effect dimens pca mda figur studi effect dimens paramet pca mda princip compon pca minor import discrimin featur neglect princip compon insuffici discrimin class princip compon pca includ number princip compon pca import paramet pca dimens mda rang number class interest lower space class classifi label data unlabel find good dimens paramet pca mda classif algorithm compar experi number princip compon pca set set label data perform mda dimens label train perceptron experi hidden layer node experi scheme nearest neighbor classifi label label sampl bootstrap classifi grow newli label sampl ad classifi label label unlabel data em tabl show comparison algorithm perceptron nearest neighbor nearest em tabl comparison algorithm shown tabl algorithm outperform method perceptron trap local minima experi poor perform nearest neighbor classifi partli due insuffici label data grow scheme reduc error automat expend store templat problem scheme affect order confid measur grow error label accumul pure em algorithm converg satisfactori classif experi end pretti good result paper present studi learn emploi train data set induct learn transduct learn treat special case learn paradigm approach learn base em framework integr discrimin analysi em algorithm offer mean relax assumpt probabilist structur data distribut automat select good classif featur gestur hand track hand postur recognit offer applic learn experi show algorithm outperform learn potenti applic futur research direct approach explor nonlinear case mda nonlinear kernel function studi converg stabil analysi perform futur research model transduct label unlabel data interest research investig acknowledg work support part nation scienc foundat grant grant author anonym review comment refer cluster object proc ieee intl conf comput vision pattern recognit support vector machin proc neural inform process system hand sign recognit intens imag sequenc complex background proc ieee confer comput vision pattern visual gestur recognit signal process pattern classif scene analysi wilei learn transduct proc conf uncertainti artifici hand track deform model proc ieee intl conf automat face gestur recognit transduct infer text classif support vector machin proc intl conf machin learn statist color model applic skin detect technic report crl compaq cambridg research lab find skin color imag intern confer automat face gestur hand model track virtual teleconferenc proc ieee intl conf comput analysi hand postur ieee comput graphic applic role unlabel data learn proc sixth intl colloquium cognit scienc text classif label unlabel document em machin learn induct learn hand pose recognit proc ieee intl conf automat face gestur recognit colour model select adapt dynam scene proc european conf comput vision track articul object proc ieee intl conf comput color index int comput vision von de robust classif hand postur complex background proc intl conf automat face gestur recognit natur statist learn theori captur articul human hand approach proc ieee intl conf comput adapt selforgan color segment algorithm applic robust human hand local proc asian confer comput
HCI/709 4 intern workshop cooper build februari springer ambient turn architectur space interfac peopl digit inform craig hiroshi andrew matt scott paul tangibl media group mit media laboratori ma usa abstract architectur space inhabit form interfac human onlin digit inform paper discuss ambient approach interfac peopl onlin digit inform ambient displai present inform space subtl process background awar describ design implement ambient ambient fixtur discuss applic ambient displai theori design interfac base initi experi introduct ambient environ english dictionari displai open manifest dictionari natur fill beauti express ambient displai engag sound rain feel warm wind understand enjoi weather engag activ awar activ neighbor pass sound shadow peripheri attent cue open door light offic understand activ peopl commun activ avail current person comput larg ignor rich ambient resign vast amount digit inform small rectangular window inform present flat screen center focu process ullmer ambient displai interact peopl digit inform confin convent gui user ambient displai broader view displai convent make entir physic environ interfac digit inform inform sourc compet small amount real estat inform move screen physic manifest subtl light ambient displai suit mean user awar peopl gener state larg network traffic weather approach critic step move current interfac limit physic world ambient displai suit home environ everydai life peopl feel connect digit world love ambient displai aid connect suit space includ highli special environ stream inform constantli monitor exampl includ aviat fig person atom power plant control car ambient media small window stretch everydai incorpor futur vision wearabl comput peopl bodi project explor ambient displai concept ambient fixtur discuss attempt lesson learn creation relat work tangibl bit ambient displai part broader vision blur boundari physic digit world creat human digit inform cyberspac turn state physic matter solid liquid everydai architectur space ullmer kei idea concept graspabl media ambient media develop wai ullmer ambient displai user grasp manipul bit hand center enabl user awar background bit peripheri percept ambient media awar human comput interact awar state environ presenc activ awar essenti collabor coordin activ share workspac awar support discuss comput support cooper work commun state collabor geograph distribut context technolog devic background awar ambient media physic space graspabl media physic object foreground cyber space fig tangibl inhabit digit augment architectur space remot multipl scroll audio low video support awar remot activ dourish porthol project awar support system low low video notion ambient media inspir field threshold work dunn live wire brown project explor theme awar extern activ attribut peopl project investig idea awar research share respect subtl abstract displai present kind awar support limit activ extend includ dynam inform stock network traffic cognit scienc theori relat ambient displai design interfac human access fundament human issu mental plai factor central human interfac field cognit build remain mysteri design ambient bodi research human put psychologist ullmer ambient displai jj gibson gibson written extens human natur world percept activ task human engag environ gibson introduc theori central discuss physic control bodi literatur driven design draw attent studi psycholog relev notion parti abil person select move attent busi environ goal design ambient environ exploit human capabl examin divid attent studi work show inform foreground person attent systemat explor attent effect percept scene made understand basic wai attent result easili appli chaotic environ base person product instal surround user augment environ user insid provid cognit background augment activ conduct room develop platform support express onlin digit inform ambient physic motion displai background user attent human activ awar peopl feel connect peopl care peopl argu person fig base person comput isol peopl ambient media creat connect love bring peopl commun share awar ullmer ambient displai prototyp center kind inform connect peopl power applic network technolog shown form telephon work extend idea connect peopl physic environ water rippl displai user awar activ distant love express activ resid light wheel motion instrument displai web page motor configur vibrat wheel rotat type displai prove altern displai map explor grasp user point ceil room action vibrat motion shallow water tank lamp reflect water produc rippl shadow ceil activ displai awar physic presenc electr field sensor measur level human activ work area activ repres pattern illumin patch project wall activ movement spot activ level motion provid visual displai remot activ water rippl light patch bottl natur ambient sound auditori displai implement activ digit whiteboard workspac board sound pen board transmit room subtl inhabit room awar activ central workspac exampl concern awar local event interest relat global event local space clock fig ambient media displai control ullmer ambient displai global system awar applic extend monitor larg system behavior larg system ambient displai suit displai gener trend stock valu network traffic inform system interest applic displai inform natur geograph event displai give peopl indic state world subtl audibl bird sound volum densiti modul conjunct variat room light approxim quantiti monitor number unread email messag level stock portfolio light room time dai note gui interfac ambient interfac dichotomi function background ambient displai meant foreground task background displai move vice versa user control person state physic control control provid mean control ambient activ activ control deploi small physic bottl emploi graspabl digit open bottl inform room bottl inform load comput data repres room sound traffic activ larg clock navig tempor event user recent absent room review activ displai past skim forward time anticip event manipul prototyp shift ambient sound light displai past hour build control gestur open close bottl simpl access inform physic rotat clock hand equal simpl power physic control widespread futur incorpor gestur interfac found implement implement design support quick prototyp room enabl host product ullmer ambient displai softwar easi synchron media element displai coordin max softwar run macintosh adjust room manag sound rotat electr contact sensor monitor manipul clock bottl electr field unit monitor human movement surround space video projector augment desk surfac ambient fixtur ambient fixtur standalon ambient media displai concept develop move open inhabit peopl user ambient fixtur extern displai distribut architectur space implement ambient water lamp water lamp extens ceil water rippl explor idea physic movement displai medium water lamp ambient fixtur develop water lamp light shine upward pan actuat chang inform action produc chang pattern light project ceil room water lamp wooden support tube water trai small mount water trai control singl circuit board actuat tap surfac water rippl light shown pattern ceil ambient fixtur base common control pic microcontrol board design mit media lab robert poor board accept command serial input line comput control fixtur distribut fixtur research space tcl base softwar send command fixtur inform relai internet network inform sourc rout fixtur fig design sketch water lamp ullmer ambient displai evolv idea found flow air difficult problemat tool convei inform found visual spin speed base inform sourc input made fold mount shaft small dc motor connect control board width modul control speed motor spin fig arrai ambient fixtur suit displai inform natur geograph event scientist map pattern solar wind pattern flow room user awar tension give indic earthquak activ repres arrai water lamp wai ambient media provid mean peopl feel connect world discuss explor insight research issu design ambient displai discuss issu map inform sourc present ambient kei element modal chosen present sourc inform inform present choic time kei choic design interfac choic modal background media consid foreground task mind person offic perform visual intens foreground write visual base ambient displai wall person effect auditori displai person perform intens auditori talk ambient inform present visual wai shadow wall modal spatial configur ambient displai ullmer ambient displai substanti alter peopl displai map emploi map data inform sourc ambient displai kei challeng ambient media sensor pick activ stream data dynam natur base sourc inform repres comput stream number design ambient media transform data displai successfulli map inform form design decid sourc map locat map audio expect style map effect peopl report loop sound water annoi month repetit sound loop kind discern tend annoi quickli mit media lab research tom white david small creat project call emploi real stream water flow bed rock physic project creat kind acoust peopl prefer choic made abstract liter displai fuzzi spot repres movement peopl experi place camera space project imag wall room peopl thought displai felt map liter privaci respect issu abstract displai map recogn displai abstract user infer mean threshold transit background foreground ambient displai larg unnot unexpect thing displai make foreground attent depend state exist threshold background foreground transit made case design appar time displai run room full peopl difficulti maintain concentr foreground task media element displai exhibit lower threshold background foreground creat effect effort control output experi test threshold design chang conjunct experi examin chang modal background inform base foreground task ullmer ambient displai learn effect ambient media learn drive percept base familiar environ car driver switch ga brake turn radio expect person ambient environ learn inform length time person spend environ influenc facil studi quickli person kind ambient environ ambient media fulli assimil futur applianc kind chang enabl chang flow air convei inform lamp base hold light bulb processor motor light displai medium function common applianc extend connect peopl inform easi fashion intend distanc peopl environ ambient media coincid human seek determin kind interact ambient media design media promot human detract discuss applic ambient displai attempt identifi lesson learn work studi solid theori work guid pursuit acknowledg lou seed undergradu research support refer ec experi recognit speech ear journal acoust societi support awar distribut work group chi acm press pp field threshold present door percept ullmer ambient displai gibson jj ecolog approach visual percept lawrenc erlbaum associ ishii tangibl seamless interfac bit atom chi acm cognit realiti freeman abstract presenc support mutual awar chi acm clark jj attent perceiv scene psycholog verbal mean select attent quarterli journal js design calm technolog stream
HCI/710 4 present de content report sole gather user interfac design requir social comput antonio da silva han kurt de gather user interfac design requir social comput antonio da silva han kurt institut comput state abstract design cooper challeng design note move final year area achiev breakthrough easi perceiv area comput telecommun impact paramount import societi technolog integr research peopl background abil made interact cultur live internet era larg number web site queri plai constitut call social comput applic exampl digit health care inform physic entertain interact web game concern user interfac design requir gather system present approach captur user interfac design requir social user interfac hci introduct final year millennium led societi digit due breakthrough achiev area comput telecommun time face converg technolog integr made tradit comput user work machin todai tradit comput give social comput interact research peopl background abil cultur social comput offspr internet era larg number web site queri plai identifi number applic digit librari health care inform system physic collaboratori entertain web game call social comput player site plai network web game collabor digit watter al system aim provid support activ learn social scienc user system typic faculti institut exampl illustr scenario perform act cooper share work environ research partial support brazilian council research assist professor depart informat state avail network infrastructur comput resourc made dream realiti common make electron network web digit librari popular internet demand interact system design concern improv usabl level system network system specif usabl problem found earlier machin internet browser hide detail underli network user lead unpredict kind inform difficult determin retriev command success remot site failur prevent request inform deliv user commun bottleneck delai data transmiss browser remot server concern design gather user interfac design requir tackl kind present approach order captur high level aspect user interfac design background issu user interfac design approach social comput provid section approach user interfac design requir gather section section illustr approach web game conclud remark present section background issu comput system intend aid peopl perform work system built fit user system work user group cooper deep understand user group comput technolog act direct aid peopl task carri work activ comput make larg signif differ peopl life work style import point comput simpli replac manual oper comput oper dramat pattern work commun workplac aim show comput technolog provid answer deal human activ social individu human essenti compon comput tool fit seamlessli result failur design issu account observ note transform brought close relationship drive cost commun drive amount inform exchang present design gather user interfac design requir social comput includ system mention earlier discuss firstli relat approach design process inspir approach participatori design design participatori design participatori design approach futur user comput system particip directli design design process approach pioneer wide accept europ attent usa clement give histor review pd approach ingredi pd project identifi clement ffl access relev inform ffl independ voic make ffl ffl develop method ffl flexibl top reason pragmat theoret polit perspect pragmat state gener acknowledg approxim problem trace poor inadequ requir specif comput system suit peopl work practic work involv design system work experi earli project basic design choic polit argu system develop oblig provid peopl opportun influenc live build system improv qualiti work design techniqu origin develop spend long period time foreign societi aim understand social mechan context major object understand work practic order support comput system design approach receiv interest start point anchor social scienc bring provok relev perspect design focu detail analysi current work view peopl work main principl guid ethnograph work ffl hand commit studi activ peopl everydai set ffl belief behavior understood everydai context occur ffl descript describ peopl behav ffl member describ behavior term relev studi particip principl entail design conceptu framework design expect captur social structur order support cooper work work social organ actual behavior differ mandatori reli interview observ everydai activ workplac technolog insert similar contextu design approach beyer cd gather design data design watch peopl reconstruct past event section present approach aim design process user interfac design requir gather design section approach gather user interfac design requir present concern interfac compon interact system interest li peopl interact control aspect myer al defin interact studi peopl interact comput system comput affect myer point set difficulti design user interfac ffl difficulti task ffl inher complex task ffl varieti aspect ffl theori guidelin ffl difficulti iter design order tackl difficulti support process gather user interfac design task carri compon plai role interact scenario system compon compon view softwar compon major function role concern task carri human util comput carri task task guid element uid requir gather approach uid requir gather due user knowledg level varieti interact style implement technolog greater social comput scenario discuss earlier paper due inher complex interfac technolog gradual migrat interfac point nielsen note human interact comput easili interact base metaphor daili activ task descript requir reflect user metaphor advoc start requir gather high abstract level user intent captur make process requir gather easier handl upgrad refin process proce detail requir obtain implement made user involv earli design process provid metaphor relat daili task metaphor process augment integr user design commun common languag deriv metaphor user intent task abstract level goal exist user conceptu model system user intent reach goal high abstract level refer system present featur file system delet file repres user intent task abstract level drag file icon destin type command rm file utter command remov file descript user intent natur languag interfac perform intent note abstract kei principl engin disciplin softwar engin except concept modular design guidelin approach uid requir gather base metaphor domain context aim facilit user involv design process present step approach system descript obtain system descript system develop system identif user system compon depend part work process carri automat action notat develop interact scenario involv system design describ scenario order identifi task system architectur model identif seek system descript term architectur model system task defin task set task coordin model present main step uid requir gather approach support illustr section carri uid requir gather web game web game section present social comput relat entertain applic system simpl web game start provid background issu game game theori underli present case studi illustr approach describ interact aspect game game run multipl machin network mean game capabl enabl multipl player plai interact top network case network web commun player mediat internet network web game involv player plai game interact web connect concurr manner commun design affect game plai determin type game game fall ffl game game action game base player ffl game game pace input event occur time game player make move turn game theori game theori research area devot studi make conflict situat shed light peopl interact comput game scenario game theori design figur creativ approach game strategi situat exist differ object act system share resourc game theori underli process select optimum strategi depend move oppon strategi game assumpt ffl player choic sequenc choic call ffl combin move player lead end state termin ffl payoff player end ffl maker perfect knowledg game full detail rule game payoff ffl maker select yield greater payoff gener scope origin direct comput game theori touch concern strategi comput game design player network game thought pattern peopl engag verbal conflict game theori appli equal scenario detail game theori russel design web game major goal establish sequenc piec present full game descript approach gather uid requir system descript game descript plai rectangular board arrai posit shown figur board stand vertic posit column correspond set slot move consist select column drop round piec graviti care rest player push piec board win game player establish sequenc piec vertic diagon note game oppon make move turn requir player game commun player plai act commun mediat player envisag pair player plai game pair player assign chair detect exist interest player chair assign game player chair wait coupl player show order assign interest player assign process proce long player show figur show scenario part note pair player assign chair assign mediat commun establish pair player shown request part game word player part make request chair wait player show chair pair player assign mediat game grai node figur illustr interest player wait oppon figur board player chair player player player player figur obtain system descript identifi system shown figur present system compon illustr architectur model identif system compon plai role interact scenario system system compon view softwar compon major function role order carri interact occur captur user action action notat captur user action constitut hindranc user interfac design design notat captur interact pictur player interact player interfac compon notifi move assign turn remain chair figur show identifi pan notat provid design high abstract level notat document requir gather particip request particip game request game move move game state game state chair assign game figur scenario illustr assum player assign mediat game capabl perform task present task descript identifi architectur model system develop interact scenario involv develop interact scenario high abstract level interact scenario shown figur abstract interact detail kind inform exchang focu interact deal specif action figur interact scenario identif system architectur model system descript term worth point user softwar compon plai role figur gave idea architectur model system figur suggest act commun stream manag act server player interfac compon client identifi model system task descript identif interact high abstract level architectur model identifi identif deriv smoothli base adopt interact scenario capabl perform task task wait start draw notif game finish exist request player plai accept request exist player wait start game pair assign enabl player start game exist request accept dismiss game win detect notifi inform player part game game dismiss figur illustr chair worth observ figur show task chair reveal relationship task coordin place figur repres task relationship pan describ task coordin chair end request particip wait player request win detect plai accept request plai notifi player accept player exist game request dismiss win draw draw dismiss accept accept draw player assign start pair enabl player start game figur chair design conceiv model identifi task relat final stimuli navig task termin task motiv navig action task navig chair receiv request player draw game direct edg label stimuli event gener event pass event carri data reader note chair game charg detect player request draw pair player dismiss task note plai role commun mediat coupl player plai game plai role intermedi move player oppon task wait move enabl player inform move updat state case notifi winner loser notifi chair win wait win enabl oppon player realiz recent move exist request draw oppon acquaint notifi chair wait dismiss figur show task relationship stimuli motiv task navig win wait move player move updat game state receiv move state updat enabl player player acquaint game state commun chair end game dismiss draw request draw figur player player compon repres user interfac modul receiv action user map move task player task make request chair plai game request chair wait stai wait turn win ffl plai game make request ffl draw game chair wait perform move base state game acquaint receiv move updat intern notifi user state game note basic task player inform chair intent plai commun move assign player acquaint state game updat player reason game order carri move figur player win move move state game game start accept abandon notifi inform move turn updat move make particip accept request particip game request draw draw wait turn wait oppon figur player conclud remark paper present approach gather user interfac requir base task target applic social comput context emerg class applic product internet era user interact style requir design major concern find identifi social scenario comput technolog provid support task facilit motiv user particip tackl difficulti effect user particip design process common languag base task enabl clean commun design social comput reflect design understand activ provid comput support everydai work societi illustr approach web game scenario describ complex activ manag entir game number user great expect pair order plai care system assign mediat game ongo game small convei difficulti inher social comput applic discuss section work present paper part project aim map hci design interfac softwar design provid interfac develop methodolog address deriv interfac softwar design hci design interfac softwar design major activ interact system develop specif languag design interfac softwar detail languag environ found acknowledg author support cape refer johnston realiti collaboratori comput physic ethnograph field method relat design participatori principl lawrenc erlbaum page clement van den retrospect pd project commun june ieee comput special issu digit librari initi ieee person statement commun june beyer contextu principl practic field method softwar wilei comput page beyer contextu defin custom center system morgan kaufman um de de de phd institut state dec oper semant extend statechart workshop inform artifici structur strategi complex problem solv publish myer interfac difficult design technic report comput scienc carnegi mellon juli myer al strateg direct interact acm comput dec nielsen user interfac commun april comm acm special issu health care inform system commun aug comm acm special issu digit librari commun april criteria system modul commun dec weiss modular structur complex system ieee transact softwar mar russel norvig artifici modern approach prentic silva captur interact design action notat brazilian comput societi annual aug yahoo web site interact web game web ti user alexand digit technolog learn social scienc commun jan
IR/711 5 machin learn base text understand system abstract text understand system approach point practic technolog long system train narrowli defin domain machin learn statist approach minim effort involv adapt text understand system domain paper present system goal deep limit necess design formal target concept relev domain system advanc previou machin learn base system richer output advanc equal express text understand system extens machin learn inform extract free text varieti system develop recent year extract inform text attempt focu narrowli defin inform domain defin collect document clear definit target concept domain system fairli simpl type inform scan seminar announc speaker job post posit skill salari rental ad number neighborhood document irrelev inform system aim deeper understand seri darpa sponsor messag understand confer system adapt domain richer inform relev domain terror domain confer consist stori latin american terror repres target concept output templat specif event detail physic target joint ventur domain stephen soderland depart ucla lo ca confer domain consist stori joint busi ventur target concept detail compani busi ownership joint ventur work medic text understand system aim deep understand exampl work friedman al soderland group initi develop system domain radiolog report target concept find mention report detail clinic interpret assumpt radiolog report relev output deep captur detail nuanc figur show portion radiolog report output find mass lesion upper lobe lung properti extract exist size trend note field shown capit convert normal anatom locat replac prefer term medic control vocabulari close call deep understand limit system primarili explicitli design output advanc system map free text formal extent express concept text text necessarili terror stori mention color car polit affili kidnap joint ventur compani concept consid system design includ part output main challeng automat text understand creat suffici express output target concept acquir knowledg concept repres free text knowledg includ figur portion radiolog report semant frame extract glossari word pattern syntact word semant pattern wai target concept express effici method knowledg acquisit text understand system practic human effort minim domainindepend system machin learn statist techniqu acquir knowledg system develop end user creat set train exampl system automat deriv syntact semant pattern labor intens creat complex rule hand captur subtleti wide variat found natur languag shallow extract system machin learn base freitag combin machin learn califf moonei soderland freitag kushmerick varieti rule learn freitag mccallum hidden markov model system find extract pattern singl step explicit syntact oper text free narr obtain good result learn set augment correct rule system medic text understand system friedman al manual construct semant grammar specif design domain radiolog report system develop muc confer hand code domain extract pattern muc system machin learn massachusett deriv extract rule train bbn step train statist model handl full syntact identifi semant relat constitu tree system code format output machin learn system work present combin extens machin learn express output move inform extract direct deep understand remaind paper describ system discuss issu design output learn semant interpret rule map free text step text analysi text understand system main structur analyz lexic analyz syntact parser semant interpret frame builder resolut structur analyz maximum entropi classifi determin sentenc boundari divid document section base page layout cue lexic analyz word sentenc glossari assign syntact semant featur word parser semant interpret glossari entri manual construct domain radiolog report addit glossari lexic analyz rule interpret date numer express syntact parser creat depend graph arc word word modifi statist parser similar collin probabl arc pair word estim train sentenc dynam program comput graph maximum joint subject constraint graph step semant detail learn set semant rule train exampl cover algorithm clark rule node test semant syntact featur rule creat semant relat pair phrase sentenc figur show depend graph sentenc approxim cm semant relat deriv sentenc arc interpret relat present arc arc relat approxim figur semant relat deriv graph step frame builder set semant relat pair word assembl semant frame domain topic frame medic find list properti figur show semant frame size trend step resolut track refer frame topic sentenc probabl estim mention find base semant featur lexic cue current version modul rule comput intend deriv probabl train futur resolut found figur sentenc equal sentenc sentenc semant frame shown figur merg frame individu sentenc refer output repres mean unambigu target concept domain essenti text understand system output express captur import detail handl full rang relev inform domain medic domain import make distinct note qualifi chose repres output semant topic list properti topic properti turn field radiolog topic find properti exist field properti shape system design anticip field output symbol actual phrase text field actual phrase retain give evid set field actual phrase text serv field structur practic suffici express captur detail find typic report flat list frame slot deepli nest structur add unnecessarili comput complex properti highli specif lung mass extern intern architectur intent system properti field hard code system develop declar frame definit list properti creat properti field fly tag train exampl design semant rule learner intermedi step creat semant system creat local fragment mean call semant relat semant relat label relat pair phrase sentenc semant relat relat head phrase modifi phrase set semant relat frame properti field ty relat frame properti system build frame automat set semant relat code semant relat ground firmli actual text head phrase modifi repres pair indic sentenc start end word phrase option set predefin set symbol valu semant relat figur show semant relat involv locat find relat upper upper lobe modifi give set mass upper lobe semant upper figur semant relat deriv sentenc tag train exampl semant rule learn level semant frame individu semant relat reason semant relat intern intuit end vital semant relat tightli connect frame produc field train set ground refer except default present system deriv train exampl semant relat automat semant frame refer phrase field multipl semant relat creat present refer semant relat refer modifi phrase experi report hour tag sentenc system deriv set rule assign tag automat hour edit hand wide number machin learn algorithm creat semant relat set train exampl rule learn task machin learn classifi pair phrase classifi preliminari step decid candid pair phrase decid candid constitut semant relat semant interpret graph creat syntact parser syntact semant tag assign individu word lexic analyz semant rule test constraint syntact semant featur figur show train sentenc mass tag present semant rule shown oper correctli rule graph word syntact featur semant featur follow forward arc word left sentenc syntact featur semant featur figur semant rule train rule requir featur word specif broadli applic rule fit drop constraint drop constraint rule appli exampl tag present goal rule learner find gener rule oper properli entir train set type rule learner call cover algorithm resembl foil crystal train select seed rule learner search gener rule match seed test version rule entir train set rule exampl cover rule mark cover rule learner continu select seed exampl deriv rule uncov exampl remain algorithm outlin figur cover select seed rule save rule mark exampl cover rule rule gener rule seed initi rule test rule rule return rule empti rule found special rule rule rule test rule rule return rule figur rule learn algorithm search gener algorithm start gener initi rule syntact constraint gener semant constraint word beam search special initi special add constraint rule special good metric laplacian expect error beam size experi report search time number train beam number featur rule accommod search halt rule found error rate error toler overli simpl mean handl noisi data principl hold separ tune set learn set rule train set error test effect tune set gener elimin individu rule challeng design fulli autom semant interpret problem conflict rule figur rule appli sentenc give contradictori semant relat rule word similar modifi word similar present rule word modifi assign absent rule appli solut code handl violat goal domainindepend system machin learn domain knowledg pernici problem rule learner unabl learn rule rule oper incorrectli exampl error rate solut data file list set valu field order provid part target output definit system ignor semant rule lower case conflict rule learner learn rule figur learn rule semant relat order time learn present learn rule output rule count error figur conflict rule appli conflict result empir result experi conduct set chest radiolog report cancer patient train set report sentenc parser train semant interpret train full set divid ten equal sentenc partit test parser statist semant rule learn report partit target concept learn semant frame clinic find gener refer refer find semant frame list properti find mention phrase modifi qualifi properti train sentenc produc semant relat evalu semant interpret compar semant relat produc system answer kei deriv train evalu metric recal recal number correct divid number correct divid total semant relat report system match answer count error partial match answer kei refer phrase word common ident lung count half half error experi report give partial credit make differ recal point call case error semant relat merg set differ modifi phrase gave evid set relat head phrase set modifi phrase modifi phrase count singl semant relat semant relat system match answer kei set modifi count correct tabl show result semant interpret paramet set error toler paramet rule learner creat gener rule error rate threshold minimum coverag paramet higher system ignor rule appli fewer number train exampl tabl result semant interpret cross valid paramet set balanc recal recal error toler error toler paramet smaller impact expect small train set small fraction rule cover train exampl half rule cover singl train error toler rule cover exampl make error set minimum coverag paramet greater elimin low coverag appli test sentenc effect drop recal highest set error toler discard highest coverag rule drop low coverag rule rule drop distinguish longer except gener rule parser make error sentenc conjunct parser recal sentenc conjunct recal sentenc conjunct column tabl show semant interpret result sentenc recal gener point higher sentenc hard make comparison text understand domain difficulti task vari seminar announc system found correct speaker time correct start time time califf moonei report recal job post domain perform report subsequ system test data set freitag mccallum measur recal speaker slot seminar announc report recal seminar speaker recal job post data set system muc confer recal full templat creation task score higher simpler tr task muc bbn al tr recal result shown tabl semant relat word phrase combin templat merg sentenc result expect degrad merg semant output base imperfect resolut text understand progress made recent year system focu extract inform narrowli defin domain adapt system system develop creat definit target concept domain close system understand limit primarili coverag level detail output domain radiolog express captur detail properti clinic find report goal text understand system domainindepend code reli machin learn statist techniqu bulk domain knowledg creat train exampl arguabl labor intens creat complex rule set trivial labor cost present system deriv parser statist semant interpret rule train probabilist modul adapt machin learn perform par system extens rule area knowledg glossari syntact semant featur individu word work streamlin glossari creation radiolog small amount code remain replac anatom phrase prefer term medic control vocabulari code reformat size express code assembl semant frame automat learn semant relat acknowledg work support grant nation cancer institut system develop jointli ashlei warner refer mari elain califf raymond moonei relat learn rule inform extract work paper workshop natur languag page fabio learn tag inform extract text workshop machin learn inform peter clark tim niblett induct algorithm machin learn michael collin statist parser base bigram lexic depend annual meet associ comput page jason probabilist model depend explor page dayn freitag multistrategi learn inform extract fifteenth intern machin learn page dayn freitag nichola kushmerick boost wrapper induct workshop machin learn inform dayn freitag andrew mccallum inform extract hmm structur learn stochast optim seventeenth nation confer artifici intellig al gener natur languag text processor clinic radiolog journal american medic informat associ carol friedman medic languag process method issu page wendi lehnert al descript circu system messag understand morgan san page scott michael lanc richard rebecca ralph weischedel descript sift system seventh messag understand morgan san fourth messag understand morgan san messag understand morgan san quinlan learn logic definit relat machin ratnaparkhi maximum entropi model natur languag ambigu resolut phd dept comput inform stephen david jon wendi lehnert induc conceptu dictionari fourteenth intern joint confer artifici page stephen soderland learn text analysi rule natur languag process phd stephen soderland learn inform extract rule free text machin stephen automat structur radiolog free text report
DB/712 3 cach search engin result institut comput scienc foundat research technolog greec technic report abstract paper explor problem cach search engin queri result order reduc comput requir support function search engin web base trace search engin show local queri queri submit user simul show cach hold queri evalu cach replac algorithm account frequenc recenc access page make replac introduct search engin popular find inform web peopl interest send queri topic search engin base return url start inform find process recent survei media suggest user reach web site search engin web individu site difficult percentag user reach web site search engin comput routin access search engin web agent period inquir search engin inform specif subject paper explor problem cach search engin queri result order reduc comput requir support function search engin queri perform search find return number url summari match queri depend complex queri search make access resid secondari consum comput resourc queri cach result result perform queri result calcul queri submit time argu cach desir cach queri result long time result stale data useless person submit queri cach queri result hour achiev benefit cach cach queri result dai significantli contribut stale search engin routin return url month spider popular search engin visit site index impli result return search engin queri cach includ data month cach queri result hour influenc return data stale paper show cach viabl improv perform search engin contribut paper ffl studi trace popular search engin show local queri queri submit user ffl simul show cach hold result repeatedli submit queri ffl cach replac algorithm lru combin frequenc recenc access page make replac show perform compar algorithm file system buffer cach time retain effici simpl lru cach replac algorithm previou work cach document reduc access latenc extens web web browser cach document client main memori local disk wide form web rare result larg hit rate improv cach hit cach proxi proxi emploi larg cach serv stream request larg number user larg cach eventu fill cach replac polici subject intens recent research cach replac polici consid lru recent variat lru base heurist document recent request futur studi access pattern web realiz small document request larg document lru extend heurist favor cach small preclud cach larg document eagerli remov larg document client experi latenc server cach replac polici network latenc order avoid replac document lot time download polici aggreg factor cach document largest valu approach develop hierarch cach cooper order provid higher hit rate capit larger number client larger cumul amount storag cach emploi intellig prefetch method improv hit rate spink al analyz transact log queri pose user major internet search engin user search search web present larg number find interest user short queri view page result exist sourc find statist search pattern web user find popular keyword search engin time queri search engin inform knowledg previou studi exist local search engin evalu perform cach result exist amount research buffer replac file system wide replac replac buffer recent lru favor recent page significantli favor frequent page robinson algorithm account recenc frequenc access page algorithm summar block cach total order fashion cach lru cach divid section section middl section refer count increment block block smallest refer count section replac block select oneil al replac replac page penultim access recent penultim access gener replac page access recent access johnson shasha buffer manag replac algorithm achiev similar perform significantli faster execut work cach divid section frequent buffer move head section belong buffer put head algorithm run space page tail case page tail cach replac polici account frequenc recenc access make replac hit rate comput logarithm time lower hit rate comput faster constant time lru algorithm combin comput constant achiev close hit rate experi environ trace trace excit search engin trace million search queri rest request document queri request page result queri user request page result queri repres trace record log file user request page result request written separ trace record log file page result queri size page result long roughli correspond local refer experi set find exist local refer queri queri submit figur plot number access popular queri result suggest queri popular queri submit time exist larg number queri access time excel candid popular queri submit time figur suggest queri submit quantifi tempor local queri queri repeatedli submit small time quantifi tempor local queri submit measur time success submiss queri time measur queri interven success submiss result round nearest hundr plot figur instanc time success submiss queri cach size hold result queri result descript work state replac block brought eventu block cach posit penultim access newli access block penultim access lead replac avoid oneil al suggest block brought memori buffer stai number implement block cach lru access time replac buffer block chanc grow posit penultim access time excit user abil find document url return number repeat access queri queri id figur number access popular queri graph displai number request popular queri trace studi popular queri submit popular queri submit time hit figur show exist number queri success fact impli sophist cach replac algorithm make result frequent submit queri stai cach replac result queri infrequ resubmit cach preliminari result suggest exist tempor local queri worthwhil save result queri subsequ submiss queri servic cach cach queri result save ffl execut queri execut ffl temporari storag intermedi result queri gener ffl access cach queri result main memori secondari depend cach size lru cach replac algorithm lru work block cach total order fashion cach lru cach divid primari section secondari block secondari section block put head secondari block move head primari section block secondari block primari secondari section figur present snapshot state queue number queri time success submiss queri figur distanc submiss queri graph displai histogram time submiss queri user larg number queri time success submiss queri distribut heavi tail impli exist larg percentag success submiss initi state primari secondari access access access access access figur block queue part queue frequent access block part infrequ access block access hit cach move block head primari miss put newli access block head secondari queue queue initi block access block move head primari block move posit back effect move block primari queue secondari queue wai similar previou algorithm partit cach section separ frequent block infrequ emploi counter emploi simpler data structur similar partit cach section replac buffer replac buffer secondari section block long time section access eager promot block section inform block present cach replac matter size cach bound fill queri result replac result cach cach replac algorithm plai import role exact perform cach studi cach replac ffl lru ffl ffl ffl perform metric hit percentag queri result found cach figur plot hit rate function cach size perform algorithm cach size cach larger gbyte algorithm perform close small cach perform lru similar perform lru larg cach algorithm similar perform figur present hit rate achiev order focu differ small cach size perform cach size requir hold result queri submit gbyte hit rate cach size lru figur hit rate function cach size larg cach perform perform close figur suggest maximum hit rate achiev larg cach experi percentag time spent warm time hit rate low hit rate system warm cach measur hit rate interv success queri lru replac polici figur plot hit rate function time cach size equal gbyte maximum cach size begin hit rate time simul reach point continu stabil area experi suggest cach warm effect reach close put queri submit serv cach perform tune section explor sensit rang paramet cach configur figur plot hit rate percentag primari region figur plot result cach replac polici displai notic perform differ thing notic perform differ version impli good choic paramet improv bad choic result perform small cach size hit rate size primari region expect primari region frequent access queri amount highest percentag hit medium size cach perform initi size primari case studi fix primari region total cach size result close perform deviat percentag notic hurt perform primari region set larg perform practic hit rate cach size figur hit rate function cach size hit rate time queri cach size mbyte lru figur hit rate function time polici start low hit rate warm hit rate reach figur plot hit rate function size primari section figur wider rang paramet perform flat entir rang paramet notic reduct perform extrem valu higher perform sensit reason cach size primari secondari section figur plot hit rate percentag middl section easili robust bad choic paramet significantli affect perform small cach size configur larg section tend perform frequent access document hit rate medium size perform stabl paramet chosen execut effici clear experi algorithm achiev similar hit rate rang cach size reason emploi cach case depend factor includ effici fast algorithm execut replac made replac page penultim access time oldest penultim access time page find page requir mainten prioriti queue time page penultim access time posit prioriti queue chang replac page oldest penultim access remov prioriti queue queue prioriti queue oper time number block cach thousand implement access time prioriti queue sort valu refer counter implement constant access time fifo access count replac queue scan lower higher scan stop queue hold lru block found queue correspond low access count block algorithm execut fast constant time easili implement constant time singl lru queue tail middl head point head primari middl tail primari queue head secondari tail tail secondari queue block block move front primari queue constant block block front secondari queue constant replac block secondari queue evict constant tabl show data structur time complex replac algorithm data structur time complex prioriti queue prioriti queue fifo queue fifo queue simplest algorithm fastest time achiev perform compar paper explor problem cach search engin queri result order reduc comput requir support function search engin queri trace excit search engin find local exist queri submit evalu perform cach replac algorithm base simul cach size lru figur hit rate configur mean cach size hold primari section rest hold secondari section hit rate size frequent section fraction cach size figur hit rate configur line graph cach size line repres cach size max cach size extrem valu paramet larger smaller cach size figur hit rate configur mean buffer middl section section ffl exist amount local queri submit popular web search engin experi suggest queri submit submit user ffl cach hundr mbyte easili exploit local found serv percentag submit queri cach experi suggest medium result hit rate rang warm ffl effect cach replac polici account recenc frequenc access replac result suggest perform simpl lru frequenc access account ffl replac polici perform compar cach replac polici maintain low execut cost experi compar perform small larg cach close acknowledg work support part project deepli support experi run center comput crete pei cao provid initi version simul paper spink jim larsen point excit trace question refer ea fox cach limit potenti fourth intern www bestavro specul data dissemin servic reduc server network traffic servic time distribut inform system intern confer data march bestavro specul reduc server load servic time www fourth acm intern confer inform knowledg novemb pei cao irani www proxi cach algorithm usenix symposium internet technolog peter chuck michael kurt hierarch internet object cach technic report comput scienc southern lo march seltzer case geograph workshop hot oper bj saracev subject studi larg sampl excit search webnet replac polici proxi jacob david berg make world wide web cach server cooper fourth intern www ep main memori cach web document comput network isdn ep approach prefetch web inet effect resourc discoveri world wide web webnet page ej pe weikum page replac algorithm disk buffer proc acm sigmod conf manag page je pitkow robust cach algorithm base dynam access pattern intern www john robinson murthi data cach manag replac proc acm sigmetr page case cach web document intern world wide web bj bateman user search behavior excit web search engin webnet denni shasha johnson low overhead high perform buffer manag replac algorithm proc larg data page joe touch defin high speed protocol challeng surviv challeng ieee june stuart thoma wong fast web cr ea fox remov polici network cach web document proc acm sigcomm roland marc abram proxi cach estim page load delai intern world wide web
AI/713 2 proof method tempor logic knowledg belief michael wooldridg depart electron engin queen mari westfield colleg london london unit kingdom dixon michael fisher depart comput manchest metropolitan street manchest unit kingdom abstract paper defin present procedur tempor logic knowledg addit usual connect linear discret tempor set unari modal connect repres knowledg possess agent logic tempor logic connect repres belief agent addit complet formal definit logic paper includ review applic ai mainstream comput correct proof number work exampl illustr pointer work logic knowledg theorem tableau introduct paper present call procedur logic tempor logic knowledg addit usual connect linear discret tempor logic index set unari modal connect repres inform possess group agent work support epsrc research grant connect satisfi analogu axiom modal system wide logic knowledg reason call tempor logic knowledg logic ident tempor logic connect repres inform possess group agent agent modal satisfi analogu modal axiom system wide accept logic belief tempor logic belief logic number mainstream comput scienc artifici intellig applic briefli review subsect notat convent introduc section complet formal definit syntax semant logic present procedur logic present section procedur repres tableau method underli tempor logic modal system agent modal case case number work illustr present section improv algorithm discuss section area futur work identifi section note intent work primari concern comput effici algorithm develop conceptu simplic leav effici futur work applic relat work tempor logic knowledg increasingli import mainstream comput scienc ai distribut system specif verif protocol idea design distribut make statement agent agent receiv messag eventu send messag tempor logic knowledg kind knowledg term state process tempor logic belief knowledg formal specif verif distribut intellig system tempor logic knowledg belief studi complex valid problem variant logic call shown simplest variant logic problem shown simpl variant valid problem undecid proposit case tableau method tempor logic develop tableaux modal logic studi procedur logic variant studi procedur simpl tempor belief logic present result achiev greatli simplifi semant separ semant belief tempor dimens procedur deal axiom ultim import belief obviou procedur extend determinist deal axiom method intent logic rao georgeff note resolut base proof method tempor logic knowledg belief present notat logic write set formula greek letter rang formula logic languag greek letter rang set letter denot set set formula binari relat write reflex transit closur domain rang write powerset tempor logic knowledg belief formal present syntax semant tempor logic tempor logic knowledg logic share common call languag preliminari note quantifi languag build formula set primit proposit languag classic proposit standard proposit connect remain connect assum introduc abbrevi usual respect tempor primit interpret connect flow time bound infinit futur obviou choic flow time natur number order usual relat respect assum set ag ng agent build index set unari modal connect formula read believ syntax formal present syntax definit alphabet languag set primit connect binari proposit connect unari proposit connect set ag ng open close squar bracket symbol open close unari tempor connect binari tempor connect definit set formula defin proposit connect true ag semant semant complex syntax introduc notion state assum world set state gener denot state intern structur state issu consid discuss interpret linear tempor natur introduc idea repres histori system definit infinit discret sequenc index natur number defin timelin function set timelin find conveni view timelin infinit function notion interchang note timelin correspond run halpern vardi idea ultim tempor logic knowledg reason program run correspond histori trace program execut reason explicitli introduc timelin model structur altern replac timelin state binari relat slightli complic semant tempor connect interchang deal linear tempor agent timelin kei underli semant structur languag includ semant term world semant captur idea agent state world addit timelin obviou defin agent access relat captur agent tempor uncertainti uncertainti time introduc point definit pair timelin tempor index point uniqu identifi state state occur timelin set point agent knowledg belief access relat hold ag captur idea agent uncertain timelin timelin valuat function point proposit true point definit function ft fg defin model definit structur rn ffl tl set ffl agent access relat ffl ft fg valuat defin semant languag satisfact relat relat hold pair form model formula rule defin satisfact relat figur satisfi valid true iff iff iff iff iff iff figur semant defin usual definit formula satisfi iff unsatisfi formula valid model iff point class valid iff valid model notion satisfi respect class model defin similar valid iff valid class model state proof tautolog proposit logic formula valid underli proposit tempor underli normal modal logic agent deriv tempor connect standard tempor connect introduc term def true def def inform mean tempor connect basic connect mean time satisfi time satisfi time connect mean satisfi time satisfi time time satisfi time time satisfi deriv mean time futur satisfi time satisfi time connect mean futur time satisfi time satisfi time time binari connect mean satisfi time satisfi time satisfi note similar weaker reason call model knowledg belief defin class model model model model belief definit model rn model iff ag clear agent access relat model axiom normal modal system valid class model theorem axiom call system wide logic reason tempor logic knowledg logic fact correspond halpern vardi logic kl defin belief model definit model rn model iff transit axiom normal modal logic valid model access relat satisfi properti definit axiom axiom gener axiom distinguish knowledg agent true axiom tempor logic belief proof method present procedur logic present algorithm determin formula satisfi procedur form procedur show formula show unsatisfi assum reader familiar fundament theorem prove procedur similar basic idea case systemat search model input formula modal search carri dimens gener tempor gener agent access relat tempor dimens involv unwind time model time node correspond state predecessor successor interleav unwind relat unwind agent access relat fulli structur modal begin systemat remov state simpl check requir origin input formula satisfi begin defin type formula definit form agent atom proposit negat atom agent atom form formula defin def identifi set formula deal finit make present easier tabl tempor formula push negat atom ad formula set perform membership test add formula negat push perform membership test formula negat push atom relev rule classic connect formula formula negat push figur negat procedur reli alpha beta defin figur omit rule classic standard ff ff ff fi fi fi figur alpha beta differ algorithm addit alpha rule requir rule procedur ff ff ff rule correspond reflex condit agent true current state note care rule appli algorithm termin give definit relat construct proposit subformula complet tableaux involv applic alpha beta formula ad subformula negat case agent atom requir kl formula ensur construct model structur result appli tableau algorithm definit proposit tableau set formula alpha beta rule appli definit set subformula fg true definit set formula subformula complet iff definit proposit subformula complet tableau set formula proposit tableau subformula complet intern consist state tableau gener establish check proper definit improp set obviou properti lemma unsatisfi describ construct set set formula set essenti structur gener tableau method classic logic extra alpha beta rule deal addit tempor requir set subformula complet appli rule modifi structur dont appli alpha rule formula construct set set formula set construct appli rule appli form proposit tableau formula alpha beta rule appli alpha formula compon ff ff replac ff beta formula beta compon fi fi ffi gg ffi form subformula complet tableau delet improp set delet step correspond analyt cut rule formula ad set construct subformula exist formula lemma set fg empti unsatisfi algorithm construct set gener classic tableau extra alpha beta rule tempor connect extra alpha rule simpli note alpha beta rule sound set delet label improp set lemma unsatisfi construct algorithm termin empti set obtain rule appli procedur termin move structur gener tableau algorithm note state set state definit tupl rn ffl state set ffl binari relat ffl repres access relat agent ffl label state set formula definit form eventu rn reflex transit closur resolv rn rn iff eventu tableau algorithm expand structur contract construct structur model possibl delet state structur label formula satisfi structur formula label state build successor alpha beta rule appli split formula relat current relat moment agent atom tempor successor state construct set formula label main connect remov outermost label state set exist ad correspond part wolper graph construct algorithm page successor slightli complic recal axiom normal modal logic axiom normal modal logic valid label state formula formula satisfi build successor formula label successor satisfi semant modal satisfi axiom formula order satisfi axiom label condit correspond step halpern mose page note formula form formula build successor satisfi serial condit axiom tableau axiom incorpor extra alpha rule built state delet part model tempor state unresolv eventu delet state formula successor delet wolper elimin rule page modal dimens ensur state label formula form successor modal state successor successor correspond opposit mark node satisfi halpern mose page part tableau algorithm formula shown perform step set rn construct set creat state fs repeat step appli appli step creat successor state label formula proper formula form creat set formula formula exist construct set formula construct set member add add state label add part rule requir valid requir state creat successor state label formula proper creat set formula construct set member add add state set label add contract continu delet state rn form form form delet note interleav step delet step determin eventu structur fulli state wrongli delet tableau algorithm success iff structur return state claim formula satisfi iff tableau algorithm perform success extra alpha satisfi iff tableau algorithm perform success extra alpha rule prove claim correct oblig show algorithm present determin satisfi total correct prove total correct algorithm case total correct requir ffl algorithm claim formula satisfi formula ffl algorithm accept input begin defin mean structur tableau formula definit rn tableau alpha formula alpha compon ff ff ff ff beta formula beta compon fi fi fi fi iff rn note remov replac ffl ffl ffl condit correspond euclidean condit condit correspond transit part proof partial correct involv show formula formula satisfi theorem rn tableau satisfi proof construct show rn tableau formula extract model satisfi show construct set tl timelin basic idea unwind path relat arbitrari loop lead path unresolv eventu unwind fulfil eventu resolv path timelin formal defin fulfil prove lemma show fulfil path construct definit relat connect linear relat ae definit rn ae path ae fulfil iff rn lemma rn structur return tableau state fulfil path root start unwind path systemat fulfil eventu start creat list empti list eventu encount whilst satisfi eventu find state note delet condit tableau algorithm remov eventu encount path list eventu add occur repeat eventu pick state repeat process list eventu empti empti fulfil path empti call state occur set begin fulfil eventu structur finit eventu reach fulfil eventu weve reach infinit unwind path construct node fulfil eventu encount path trace process fulfil path root set path obtain method set timelin timelin infinit turn finit fulfil path simpli continu unwind simpli gener append fulfil procedur reach end append infinit sequenc state true gener infinit timelin eventu constraint tl set sequenc obtain recov agent access relat map relat tableau structur requir model state tl set denot set point tl state def tl sg view timelin infinit sequenc function actual transform access relat access relat achiev def iff relat empti iff empti note reflex symmetr transit closur access relat requir note case slightli ensur proce formula form delet contract stage formula ensur serial creat state set ad euclidean transit closur model obtain note procedur preserv properti corollari note arc ad gener euclidean write relat obtain relat recov valuat function straightforward point defin def ae complet recoveri model show origin input formula satisfi prove slightli gener show point proof induct structur base case primit proposit negat primit proposit construct semant construct semant induct assumpt assum point induct step form proof main leav remaind deriv tempor reader form definit induct semant form definit induct semant form semant rule definit state member induct form show proof sequenc definit easi kg definit kg induct proof state point state creat exist sequenc creat euclidean closur procedur show easi induct achiev induct assum construct ad gener euclidean closur form show easili definit induct hypothesi form show show part easili fact eventu resolv definit induct note beta rule formula requir fg induct finit number step reach situat conclud proof theorem claim structur return success invoc tableau algorithm fact tableau structur input lemma output tableau algorithm rn rn tableau assum tableau algorithm construct structur rn check part definit hold hold assumpt state improp state delet step construct set state alpha formula alpha compon ff ff construct set step ensur ff ff state beta formula beta compon fi fi construct set step ensur fi fi state step construct set ensur state step tableau algorithm ensur state step tableau algorithm ensur construct successor delet contract phase tableau algorithm step ensur delet state addit alpha rule appli construct set mean state appli step tableau algorithm ensur state ad subformula step construct step tableau algorithm assumpt state proper state appli step tableau algorithm construct successor state state appli step tableau algorithm successor construct reason state delet delet step exist state rn step tableau algorithm delet state rn condit observ creat step tableau algorithm case state creat observ delet contract observ creat applic step tableau algorithm lemma theorem import proof theorem tableau algorithm return structur rn satisfi show invoc tableau algorithm input formula invoc unsatisfi theorem tableau algorithm return structur rn unsatisfi state creat algorithm attempt creat fail set empti lemma unsatisfi state subsequ delet step contract part tableau algorithm state creat sequenc state lead remov final delet easi induct sequenc show case unsatisfi theorem lead immedi partial correct theorem satisfi tableau algorithm appli return structur rn remain total correct show termin theorem tableau algorithm appli termin note algorithm gener set formula appli alpha beta rule fill set subformula negat number applic gener set set formula atom formula care appli beta subformula appli rule formula stage tableau ffl stage build set step termin ffl immedi obviou step tableau creation state introduc spawn input formula finit set formula state finit duplic state label algorithm termin analyt properti ffl final part algorithm involv remov state structur remov state reach point state step termin theorem impli complet correct work exampl demonstr algorithm number work exampl procedur show formula unsatisfi start construct set appli alpha rule conjunct obtain formula alpha rule appli give subformula rule appli obtain label belief tempor successor construct belief state construct pg alpha rule appli give rule appli state tempor result state creat appli figur structur return alpha rule obtain give set label arc ad relat ad relat agent atom construct successor state form construct pg appli alpha rule obtain rule appli successor add tempor successor construct pg appli alpha rule obtain rule appli set arc ad belief successor doesnt formula form add agent state arc creat pg turn arc ad state structur contract begin state delet structur return figur pg pg state label satisfi formula gener appli alpha rule conjunct formula gener appli alpha rule knowledg modal formula gener alpha rule appli formula gener alpha rule appli formula set improp construct proce structur return unsatisfi procedur prove schema valid unsatisfi instanc show refut show directli satisfi begin show valid negat gener set appli alpha rule conjunct push negat oper formula obtain appli beta rule gener appli alpha rule conjunct obtain alpha beta rule appli set obtain state appli tableau algorithm state begin state agent atom construct successor construct appli alpha rule obtain obtain set formula pg set formula proper delet tempor formula creat state result phase contract member successor delet empti structur return appli tableau algorithm attempt construct belief successor agent modal construct pg appli alpha rule obtain state label pg add tempor gener set proper state arc ad continu process successor add successor pc tableau form pg state pg add process negat agent gener set result singl state arc ad tempor begin successor state agent atom construct state creat pg figur structur return ad tempor turn arc ad state process agent modal edg ad tempor successor pg successor ad state belief successor tempor successor ad state structur stage contract state delet structur return figur pg pg pg state impli schema valid show prove satisfi interest give detail construct simpli note stage termin gener structur pg state structur remov state expand gener satisfi spirit procedur show schema valid unsatisfi proce show turn instanc valid unsatisfi show negat show result satisfi start gener set lead creation state begin process state set agent modal construct lead creation state arc ad tempor lead singl state arc ad state agent modal construct end creat simpli add arc tempor construct set lead creation state arc ad state agent modal creat state pg add tempor gener set found label arc ad process state arc made state creat state agent tempor begin found arc ad state process successor add successor structur contract state remov final state structur built figur op op figur structur return pg valid show show satisfi set gener state shown state pg state agent atom construct set result state label pg arc ad tempor begin tempor successor state process agent atom state successor ad pg construct set creat state pg add state process agent atom state ad arc successor add conclud stage leav structur pg pg state delet satisfi refin algorithm present greedi obviou wai algorithm improv respect identifi obviou delet set number set reduc ad step end algorithm set gener stage subsequ reduc amount comput effort requir algorithm delet set delet exist ae justif step outlin tableau algorithm includ step call reduc tableau algorithm lemma tableau algorithm formula return tableau structur reduc tableau algorithm formula return tableau structur satisfi tableau algorithm construct tableau structur set construct ae tableau algorithm return structur structur structur delet make differ algorithm return structur structur return mean conjunct set formula satisfi conjunct subset formula subset make tableau construct structur delet make differ unsatisfi formula tableau algorithm return empti structur set delet conjunct formula unsatisfi subset conjunct subformula unsatisfi delet make differ construct successor tableau tableau algorithm construct successor state formula construct set formula tableau ensur serial tableau reflex requir model formula captur addit alpha formula construct model tableau reflex transit closur ensur state formula form successor note refin adopt tableau delet step tableau algorithm creation algorithm creation set set formula applic step order appli alpha beta rule final fill subformula negat fewer set creat delet number state construct algorithm worst order number consist subset larg number state construct type verif consid led work verif number state creat reduc case applic type verif close remark defin tempor logic tempor logic present prove correct basic procedur logic implement written wai hope extend work undertak systemat analysi interact interact time extend procedur deal implement develop investig effici extend procedur develop proof techniqu translat compar method acknowledg author ian elliot anonym comment paper refer effici model check intern confer logic comput scienc page ieee comput societi normal multimod logic seventh nation confer artifici intellig page st chella modal introduct cambridg elliot implement procedur tempor logic knowledg belief master depart manchest metropolitan octob emerson tempor modal logic van handbook theoret comput page elsevi scienc publish vardi reason knowledg mit vardi machin properti knowledg distribut system journal dixon proof method tempor logic knowledg belief gabbai intern confer formal appli practic reason june fit proof method modal intuitionist logic reidel publish librari volum sequent system proposit normal modal logic phd comput june report tableaux method modal tempor logic technic report australian nation chapter handbook tableau method procedur tempor logic master depart comput manchest oxford manchest octob halpern reason knowledg analyz distribut system annual review comput halpern mose guid complet complex modal logic knowledg belief artifici halpern vardi complex reason knowledg time lower bound journal comput system krau lehmann belief time theoret comput manna pnueli tempor verif reactiv safeti meyer van der hoek epistem logic comput scienc artifici volum cambridg tract theoret comput scienc cambridg vardi wolper simpl automat verif linear tempor logic intern symposium protocol test rao georgeff formal model procedur system technic report australian artifici intellig june shoham reason time causat standpoint artifici intellig mit analyt cut journal symbol logic van der meyden axiom knowledg time distribut system perfect recal ninth ieee symposium logic comput page wolper tableau method tempor overview wooldridg logic model comput system phd depart octob technic report depart manchest metropolitan wooldridg fisher procedur tempor belief logic gabbai tempor logic intern confer volum page juli
ML/714 6 step program matthew ginsberg oregon abstract paper describ box program approach level human expert give basic overview algorithm describ strength present result experi compar human oppon earlier program introduct classic game card game comput challeng game fundament pattern recognit techniqu success develop program fail deal huge branch factor arguabl strongest program world kim hall champion kim program monument stone handicap card game game imperfect exist poker bridg program extrem weak world poker champion howard expect beat exist poker program minut plai world bridg champion bob summar commerci program improv reason system pfeffer produc comput player strength reduc poker larg linear optim problem solv gener strategi optim game theoret citat result person commun commun simpli presenc accompani text author world champion checker program report success domain situat bridg american contract bridg leagu rank bulk player difficult compar strength compet program player perform bridg measur plai deal card held pair player pair replai result compar bridg match typic consist pair plai card tabl pair plai card tabl result obtain pair sum team win deal lose numer sum result obtain pair convert intern match imp diminish impact singl deal abnorm result hand unduli larg impact result entir match jeff report standard deviat singl deal bridg roughli equal pair plai team beat measur perform player accumul master point tend measur skill undoubtedli sound market organ averag member ag inform plai strength space restrict prevent describ rule bridg descript found ai paper deal excel text articl program describ bridg treat similarli regular topic ai research amount differ averag club player world class expert imp deal strongest bridg plai program slightli weaker averag club player progress comput bridg slow recent applic plan techniqu bridg led perform increment approxim imp deal al modest improv leav bridg baron shy suffici win world comput bridg albuquerqu exist program attempt duplic human methodolog goal recogn class deal end smith work plan extend plan continu construct human bridg techniqu expect approach limit program attempt mimic human methodolog fare poorli work differ attempt techniqu similar search analyz situat find mont carlo techniqu suggest plai combin result analyz instanc bridg variant card plai half bid techniqu escap fact larg bid mean program commun mean bid success approach technic reason unusu vulner gap inaccuraci bid bridg baron world beat bridg baron imp deal plai lose strong human player similar amount unlik previou improv straightforward addit enhanc perform substanti outlin paper begin section describ mont carlo approach card outlin strength provid detail perform section describ similar approach explain vulner error describ wai vulner end summari includ detail time line suggest futur work card plai order understand card plai phase bridg bridg perfect inform game player plai card player hold game tree fairli straightforward minimax minim node minim player plai trick plai raw branch factor tree prune introduct transposit tabl bring augment move order heurist exploit narrow reduc branch factor approxim search space node deal partit search reduc space node report similar result care implement killer heurist proce realist situat deal unseen card deal consist bid card plai analyz result deal doubl dummi decid plai strongest averag larg number mont carlo sampl deal imperfect natur bridg inform algorithm carlo card select move candid set construct set deal consist bid plai hand move deal evalu doubl dummi result make move deal denot score obtain make move return maxim mont carlo approach drawback point varieti includ narrow heurist suggest place earli move order move oppon legal size game tree small heurist appar chess commun poorli cite academ literatur recent paper al suggest idea root search koller basin obviou approach suggest make gather variant base invari assum inform time spite perform card player level human expert perform measur bridg master commerci program develop bm hand level difficulti deal level problem declar plai bm move defend card ensur defeat bm test randomli dealt hand signal ratio good plai gener reward bad punish hand lesson complet uninterest hand line plai irrelev obviou drawback test perform dealt bm deal repres problem bridg player encount tabl test run microsoft window mhz pentium pro bridg baron version test hand hardwar bb select plai entir deal mont carlo sampl size number approxim equal comput resourc bb theori deal practic substanti auction facil bb inform critic small number deal system level bb total entri number deal plai successfulli program question current version bridg baron discuss expect perform test bridg baron includ smith enhanc mistak illumin sort mention gather good identifi specif possibl contract made defeat weak combin possibl plai hand line bank specif distribut card line simpli defer guess fourth line clever succe independ oppon hold randomli fourth possibl assum defer make correctli doubl dummi pattern account virtual bm deal involv combin varieti possibl win option perform fall level higher bm typic involv success develop complex end perform happen bb lesser extent discov complex end posit bm deal wit recent discoveri maneuv hitherto identifi bridg literatur perform situat level human expert experi extrem tediou text interfac commerci program bridg master bridg baron inform sensit perform paramet anecdot solv addit problem total addit resourc form extra time time rare larger mont carlo sampl deal explan oppon bid open lead factor contribut equal improv perform report card plai sampl size reduc deal author report compar level perform work similar benchmark report post william forrest juli solv problem hand human expert topic ongo seri articl dutch bridg magazin imp regularli compar line plai bridg newsgroup assist commentari world program consid import technic remark made mont carlo algorithm note simpli set deal consist bid plai hand construct deal consist simplifi auction build constraint describ hand tabl deal hand consist constraint deal gener deal hand restrict number card held player suit set deal test remov element satisfi remain remain deal pass bid modul identifi observ bid made player question process typic gener full set deal algorithm conform card plai impract test hypothet modul exist identifi mistak oppon make plai analysi time player hold mistak west plai west fact plai rule adjust probabl west hold adjust probabl bia mont carlo sampl algorithm technic point algorithm involv fact run quickli termin analysi complet varieti greedi techniqu ensur move consid show algorithm iter broaden harvei ensur answer search fail termin time algorithm requir deal mont carlo sampl result search combin time expir ble evalu result posit simpli move good move deal compar quantit approach aid substanti partit search entri transposit tabl correspond singl posit evalu set posit valu fall entri partit tabl long bid bid bridg twofold primari share inform card partner cooper select optim final contract secondari disrupt oppon attempt order achiev wide varieti bid develop suggest club mean lot suggest temporari inform convei mean assign wide varieti bid default rule assign mean bid specif assign mean comput bridg player similar understand bid interest mean frequent bid suitabl set card exist comput program simpli find bid match card machin world champion chip report human expert approach expert bid base exist close made simul result candid action involv project bid proce evalu plai varieti final contract expert mont simul result refer commun simul similar approach algorithm select bid candid set frank suggest exist machin approach capabl reach expert level perform true earli modern expert bid practic begun highlight disrupt aspect machin perform longer competit bid construct set deal consist bid bid deal project auction continu bid made bid suggest player question assum comput doubl dummi result eventu denot return maxim mont carlo approach card approach account fact bridg plai doubl dummi human expert make bid convei inform oppon order make defend task difficult miss algorithm problem conserv action player conclud pai aggress partner assum bid conserv player end omiss kind time bid suggest action rare bid system match bid directli encount problem infrequ bid ground oppon make mistak bug replic oppon attempt exploit gap appli attempt heurist model adversari difficult distinguish good move success oppon win option bad move success heurist fail identifi option varieti wai problem perfect obviou simpli aggress tendenc bug gap bid fix larg slow process approach identifi bug situat bid simul distribut commerci product oppon achiev result achiev evid gap evid simpli effect disrupt oppon effort bid accur restrict requir make bid bid suggest ground bid reflect improv judgment highlight gap techniqu bid slightli bridg expert remark compar mention direct comparison commerci program difficult interfac handl manual recent match compar recent version bridg baron current version won imp deal standard deviat deal averag nineti hand minut tournament bridg baron compar plai crash higher plai internet bridg club member plai hand human lose rate final depend analysi mean lack abil oper decept bid card plai difficulti practic remain timelin futur work short chronolog project main mileston tabl page matur point idea test plai deal chess commun observ easi approach evalu featur approach question mont carlo simul bid short period understand propel gap bid program exhibit behavior refer tabl simul bid beat imp deal date event work begin doubl dummi engin solv complet deal node averag make dummi plai plai machin card club finish solv bridg master deal face world champion retract celebr million bet plai club finish averag world champion chip predict outperform exist program expert finish tournament plai world champion lose imp deal finish world comput bridg plai world champion lose imp deal discov card plai end varieti straightforward extens improv perform substanti princip possibl signal figur partner simpli construct hand observ plai make signal effect achiev goal extend deal form bridg score oppon time modif requir substanti technic simpli matter prospect expert level comput bridg player time frame suggest fairli bright acknowledg work support receiv invalu member bridg comput scienc commun indebt chip rod alan han fred bob eric david bart member jonathan rich jeff thoma andrew member commun refer plai hand sensat breakthrough bridg softwar ian frank david basin search game incomplet case bridg card plai artifici ian frank bridg technic matthew ginsberg william harvei iter broaden artifici matthew ginsberg partit search thirteenth nation confer artifici matthew ginsberg comput discov daphn koller avi pfeffer gener solv imperfect inform game fourteenth intern joint confer artifici page bid system david mcallest number search artifici jonathan wim ari de exploit graph properti game tree thirteenth nation confer artifici page jonathan jump challeng human checker alfr week win bridg pocket stephen jj dana tom plan contract bridg thirteenth nation confer artifici david wilkin pattern plan chess artifici
ML/715 6 activ learn natur languag inform extract thompson mari elain califf raymond moonei februari stanford ca depart appli comput illinoi state il depart comput tx abstract natur languag difficult gather annot data unannot data fairli plenti activ learn method attempt select annot train inform potenti natur languag applic exist result activ learn consid standard classif task reduc annot effort maintain appli activ learn task natur languag semant inform extract show activ learn significantli reduc number annot exampl requir achiev level perform complex task activ natur languag learn learn inform extract email address contact phone number contact electron postscript email introduct activ learn emerg area machin learn explor method reli benevol teacher random activ particip collect train exampl primari goal activ learn reduc number train exampl achiev level perform activ learn system construct request type determin set exampl usefulli label select sampl attract abund annot inform sentenc languag learn annot requir complex output categori reduc number train exampl requir greatli util learn number research successfulli appli machin learn natur languag process brill moonei util activ address part speech tag text categor lier fundament classif task semant inform languag learn task requir annot natur languag text complex semant fill templat applic activ learn task requir complex output studi research show activ learn method appli problem demonstr significantli annot cost import realist task remaind paper organ section present background activ section introduc system appli activ learn section describ applic activ learn parser acquisit result section describ applic activ learn learn inform extract rule present result task section suggest direct futur research section describ relat section present background activ learn rel obtain focu select sampl method activ learn learn begin small pool annot exampl larg pool unannot learner attempt inform addit exampl annot exist work area method method lier dagan cohn system train small number annot exampl learn initi classifi system examin unannot attach certainti predict annot exampl exampl lowest certainti present user annot retrain method attach certainti typic attempt estim probabl classifi consist prior train data classifi correctli classifi small number exampl member attempt label addit exampl exampl annot result disagr member present user annot retrain consist prior train produc highest disagr exampl label uncertain respect classifi obtain train data figur present abstract pseudocod select sampl ideal batch set make intellig futur effici reason retrain batch learn frequent set higher result number classif task demonstr gener approach effect reduc label exampl citat current work explor approach task learn parser inform extract rule topic futur research appli learner bootstrap creat classifi exampl annot unwil label recent learn annot unlabel instanc find instanc lowest annot disagr member annot instanc train learner bootstrap exampl exampl annot point figur select sampl algorithm natur languag learn system parser acquisit system set train sentenc pair mean learn parser map sentenc semant form induct logic program method lavrac learn determinist parser written prolog solv parser acquisit problem learn rule control step step action shell initi train exampl exampl ilp system posit neg exampl state parser oper appli exampl automat construct analyz sequenc oper applic shift lead correct learn task user feedback provid classif task paper focu applic learn interfac geograph learn parser map question directli prolog queri execut produc answer sampl queri geographi pair prolog capit state biggest state locat suffici corpu learn parser correctli sentenc logic queri inform extract develop learn rule inform extract goal system find specif piec inform document specif inform extract gener form templat list slot fill substr document obtain structur unstructur document grow number web internet applic rapier relat acquir rule form sequenc pattern identifi relev phrase document pattern similar regular express includ constraint semant class extract phrase surround result simplest version system make word found tag word provid power semant classif map seri classif subproblem rapier approach problem annot provid user form fill class label activ learn task rapier extens extract inform job netnew post figur show part fill templat task extract inform slot develop job post newsgroup telecommun solari system administr lead telecommun firm energet individu fill posit atlanta solari system administr full benefit atlanta reloc assist provid fill templat solari system administr georgia atlanta solari telecommun figur sampl messag fill templat slot vari applic post post provid salari provid inform job locat number slot slot prospect activ learn semant appli sampl select system requir determin certainti complet annot potenti train fact individu learn rule perform part annot task gener approach comput certainti individu made process combin obtain certainti system learn rule explicit uncertainti simpl metric base coverag train exampl assign certainti approach complic slightli fact current learn parser complet potenti train happen control rule learn oper overli prevent correct oper requir sentenc train parser includ sentenc annot uncertain good candid select sentenc batch size distinguish count maximum number sequenti oper successfulli appli attempt sentenc divid number word sentenc give estim close parser complet sentenc lower metric prefer annot number exampl remain exampl select annot chosen certainti potenti train obtain sequenc oper appli produc recal control rule oper induc posit neg exampl context oper appli simpl number exampl induc specif control rule select oper measur certainti reason certainti measur rule shown porter small disjunct correctli classifi error prone larg averag certainti oper sentenc obtain metric rank exampl includ includ sentenc vari constant citi chosen sentenc subset word present chosen sentenc semant result gener methodolog random set test exampl system train subset remain exampl bootstrap exampl randomli select train step activ exampl remain train exampl select ad train set result learn set evalu round compar random exampl round chosen randomli initi corpu evalu parser acquisit question pair prolog queri domain chosen due avail exist natur languag interfac simpl geographi fact origin suppli prolog question collect uninform undergradu map logic form expert exampl corpu section parser learn train data process test result queri submit answer compar gener correct percentag correct answer record test test exampl chosen independ trial bootstrap exampl batch size result shown figur refer random refer sampl refer benchmark train exampl figur activ learn advantag insuffici inform make intellig choic advantag clear train set activ learner choic pick remain approach full train set converg perform number exampl requir reach level significantli reduc activ learn final accuraci requir select exampl random save surpass perform requir select exampl versu random save differ activ random choic train exampl statist level ran experi corpu geographi addit exampl collect undergradu student introductori ai set question previou experi collect student introductori instruct complex queri desir ai student tend complex task give interest question logic form homework assign total data split train train exampl figur activ learn larger geographi corpu sentenc test random split result shown figur save activ learn exampl reach accuraci close annot save curv select sampl reach exampl elimin sentenc vari subset word present chosen sentenc difficult activ learn exampl save annot cost activ learn inform extract similar approach sampl select rapier simpl notion certainti individu extract rule base coverag train po po number correct filler gener rule neg number incorrect account exampl deem rapier prune rule prevent gener spuriou filler train penalti includ error notion rule rapier determin certainti fill slot evalu annot certainti case singl rule find filler certainti slot certainti rule fill certainti slot defin minimum certainti rule produc filler minimum chosen focu attent rule find exampl confirm deni final determin certainti empti slot slot empti larg percentag time job salari present half time slot absenc filler slot confid exampl label record number time slot train data filler count confid slot filler found confid slot confid found sum confid slot order desir option activ select singl time increment version rapier creat version requir rememb train exampl updat exist rule exampl ad result system increment incorpor train exampl chosen immedi effect result choic inform extract corpu test activ learn consist post local newsgroup illustr section train test set gener learn curv gener train random activ select subset train data trial activ bootstrap exampl subsequ exampl select time remain exampl train exampl rapier figur result select sampl versu random select exampl inform standard measur perform percentag item system extract recal percentag item system extract order combin measur simplifi common weight prefer recal weight equal activ learn measur perform interv result random sampl measur frequent figur show rapier random sampl select sampl exampl consist outperform rapier differ curv repres larg reduct number exampl requir achiev level perform averag averag random exampl repres save differ perform exampl level pair curv select sampl perform randomli chosen exampl inform data set curv level exampl ad futur work experi addit semant inform extract corpora test abil approach reduc annot cost varieti domain interest explor activ learn natur languag process problem syntact machin translat current result involv propon approach convinc argument theoret advantag initi attempt adapt approach system addit research topic critic problem obtain properli sampl version space work certainti metric rapier simpl ad hoc principl approach base learn probabilist model inform extract result estim certainti improv sampl select intellig method batch size initi inform experi observ optim batch size vari total amount train data small batch larger batch convert increment version rapier issu effici learn step increment relat work cohn al discuss activ learn method detail focu neural network approach activ search concept lier tadep appli activ learn problem text categor show improv activ learn similar learner tradit classif task dagan engelson appli learn tag hidden markov model select exampl annot lewi catlett heterogen simpl classifi select exampl annot present power classifi method appli text classif research recent appli activ learn inform extract soderland whisk system unusu form select sampl certainti whisk divid pool unannot instanc cover exist miss cover rule system randomli select set exampl class add train set soderland show method significantli improv perform manag success domain unclear tradit sampl select method perform comparison activ learn area machin learn appli classif task demonstr success applic complex natur languag process semant inform extract wealth unannot natur languag difficulti annot make select sampl potenti invalu techniqu natur languag learn result realist corpora semant inform extract save high achiev emploi activ sampl select simpl certainti measur predict unannot data improv sampl select method applic import languag problem hold continu progress machin learn construct effect natur languag process system acknowledg research support nation scienc foundat grant refer learn tag multilingu text observ confer empir method natur languag pp borland intern prolog refer guid borland scott ca overview empir natur languag process ai relat learn techniqu natur languag inform extract phd tx improv gener activ learn machin sampl train probabilist classifi twelfth intern confer machin pp san ca morgan kaufman learn inform extract fifteenth intern confer machin pp select sampl queri algorithm machin concept learn problem small disjunct eleventh intern joint confer artifici pp mi induct logic techniqu applic elli horwood perform evalu technolog ai heterogen uncertainti sampl learn eleventh intern confer machin pp san ca morgan kaufman activ learn text categor fourteenth nation confer artifici pp ri induct logic program academ ny learn inform extract rule free text machin learn queri induct logic program thirteenth nation confer artifici intellig
AI/716 2 logic natur languag understand reason chapter natur languag process knowledg languag knowledg knowledg languag edit stuart shapiro publish aaai mit press stuart shapiro april abstract logic knowledg reason system controversi wai standard order predic logic inappropri model natur languag understand reason logic design chapter present aspect logic introduct engag project build natur languag intellig agent approach natur languag understand reason thought logic develop design suit csr current version logic constitut formal languag infer mechan knowledg implement constantli evolv system implement evolv theori build natur languag ration agent reason survei wai logic design csr standard order predic logic present reason problem english discuss difficulti involv repres solv problem show repres solv subtl show solut reveal difficulti present solut exampl shapiro implement chapter user interfac chapter logic repres entiti relat import csr peter peter shapiro proper belief knowledg belief chapter refer order predic standard syntax repres kr formal view project develop natur languag intellig tend refer shapiro point materi repres constitut content mind interest repres interest mind result understand natur languag utter context read book articl discuss interest logic belief result understand utter wai sentenc cite understood differ context point claim context natur languag understand understand utter case logic repres understand standard transduc english utter input entir relev state mind modifi mind regist understand utter subject chapter shapiro neal neal neal shapiro type express denot individu proposit sort entiti agent proposit express repres proposit believ rule express proposit express syntax recogn infer routin proposit assert rule infer routin assert act sort entiti agent perform act express syntax recogn ration engin implement chapter scope chapter kumar individu express term argument function logic connect miner squash veget squash marbl anim veget marbl statement ffl human ffl ffl ration anim socrat human socrat ration ration formal problem wff wrong conclud squash anim miner satisfi miner utter form pn understood pn understand easili formul implement logic connect similar problem pp shapiro shapiro implement section wff png true wff set fp pn true problem solv shown prompt input shown prompt mix case output shown upper case logic constant input termin period store rest echo shown conserv space enhanc readabl termin mean store perform forward infer output line infer command report wff infer store result infer interact edit conserv space fit format chapter charact string actual input serv gener problem solv repres version wff novic logician formal problem correct satisfi ration anim correct formal argu problem background knowledg categori miner mutual disjoint background knowledg captur correctli wff captur style simpli assert relat proposit problem nest proposit true fail captur simpl relat proposit connect includ wff pn true fewer wff set fp pn true true problem solv shown previou suggest english mean common sentenc boston kathi la ev infer block boston kathi la vega cite evid sentenc logic form sentenc step reason introduct elimin rule introduct rip studi reason subject train formal logic assess logic rule infer found rule introduct virtual rule modu notic longer make make claim mean word claim previou section pragmat understand utter rule subformula truth assess singl proposit connect rule infer includ gener connect call wff fp pn fq qm true elimin rule connect gener disjunct modu infer turn infer trace reader fire gener disjunct modu ponen rule uniqu variabl bind rule set philosophi professor vote vote close formal understand sentenc interpret wff fa fc cm mean conjunct fa impli conjunct fc cm complet note vote winner rule specif deborah depart depart comput state york march variabl queri prefix termin punctuat start backward infer queri consist posit neg instanc queri elizabeth isnt aspect instanc statement specif problem replac quantifi variabl normal understand nl utter assum noun phrase sentenc refer entiti noun phrase mark anaphor refer nl utter requir judici predic make formal statement transduct process present definit brachman type object explain structur specifi upright touch actual figur sentenc attach satisfi touch upright touch approach issu modifi rule instanti variabl wff replac term restrict call variabl bind statement formal understand quot set argument salli usual formal statement sister symmetr transit cumbersom formal compar english introduc set argument predic form ft impli predic form ae ft predic form version call shapiro implement chapter impli admittedli peculiar set argument infer salli notic combin instanc avoid due logic relat relat relat statement express requir quantifi predic user express logic user languag formal order predic store varieti eleph rule transit relat store rule abil express rule languag aspect logic abil quantifi formula wff function term denot proposit argument quantifi order logic bob believ true bob believ bill believ bill believ kevin favorit proposit method restrict implic includ implement kevin favorit proposit john mari john notic quot head section wff section underli logic order natur languag sentenc opaqu denot phrase necessarili substitut denot object due russel iv scott author publish anonym replac author sentenc scott fact author verb put complement opaqu context standard terminolog denot phrase author denot extens term repres intens shapiro entir network consid opaqu context equal predic term denot entiti uniqu ai literatur due mccarthi mean phrase telephon sentenc mike telephon concept mike telephon mean sentenc mike telephon number telephon number mike telephon mari telephon mari telephon ital notic creat opaqu mccarthi make point telephon replac telephon sentenc mike telephon sentenc mari telephon equal predic introduc entiti extens explicitli context opaqu appli techniqu mccarthi telephon problem set argument order predic call equiv previou paper numer quantifi mother jane john mother mari john member member women lesli men pat man facilit process logic includ numer quantifi mean individu satisfi satisfi elimin rule infer numer individu satisfi infer individu satisfi satisfi individu satisfi infer individu satisfi satisfi expect rule abbrevi form interact show problem solv numer quantifi elimin rule count decid count current version count distinct term possibl futur version term count context kind context mechan domain separ read fiction import background knowledg real world understand accept fiction inform contradict belief context mechan part belief system section context defin context set assumpt assert user hypothesi ad exist element ad defin context structur set assumpt sampl run assumpt ad defin command context option argument command refer default default run demonstr reason overlap world creat context empti set assert make default context anim partit bird pegasu rider travel ground air depend ride wing ride pegasu show context set restrict belief creat initi real bird bird wing chang default context pegasu wing travel list belief context list belief context notic believ travel air world ground real world belief ai system input normal peopl programm knowledg contradictori inform deal system abil recogn trap explicit contradict abil retract store inform infer inform retract includ belief system abil proposit enter infer directli contradict open dialogu contradict detect context contradict involv newli deriv exist contradict exact run context run altogeth type user option system identifi remov contradict system track underli infer proposit hypothesi proposit told system hypothesi system retract infer proposit deriv contradict detect context contradict involv proposit exist continu contradict inconsist part context discard contradictori assert context type order make context consist delet hypothesi set order make context consist delet hypothesi set list inconsist set support support support support support enter list number hypothesi examin discard hypothesi full quit instruct type number enter list number hypothesi cancel quit set consist set support support support support enter list number hypothesi examin discard hypothesi full quit instruct type number set part context contradict inspect discard add notic retract proposit infer remov user proposit support hypothesi case remov hypothesi make minim chang knowledg base assum definit remov hypothesi made minim chang relev logic contradict impli peopl doesnt reason total unrel earth flat logic version relev logic anderson logic valid contradict detect context contradict involv proposit exist continu contradict inconsist part context discard contradictori assert context type contradict detect context contradict involv newli deriv exist contradict exact run context run altogeth type contradict detect context contradict involv newli deriv exist contradict exact run context run altogeth type question deriv store print case shown contradict system infer relat contradictori specif irrelev inform paradox implic whatsoev impli notic deriv implic deriv circular rule normal peopl give contradictori inform tend give circular formal rule infer mechan design work infinit loop face rule regard order entri rule ground order predic rule predic ground proposit mckai circular definit tradit rule infinit loop forward chain rule form form summari design system natur languag reason ration agent found logic design specif support natur languag process reason aspect logic summar chapter categor ffl differ syntax set argument logic connect numer quantifi logic ffl differ infer uniqu variabl bind rule relev logic ffl differ ffl reli infer context belief circular rule recent incorpor featur ali simul reason reason belief agent acknowledg chapter version stuart formal intern journal expert system previou version present golden west intern confer intellig system la june aaai fall symposium knowledg natur languag process implement develop chapter carri conjunct william donald member research group depart comput scienc state york buffalo dialogu shown program franc johnson modif previou version author appreci provid comment sy ali earlier draft gener intellectu support ub center cognit scienc research group narr work report support part equip grant sun microsystem comput part nasa contract na part armi contract technolog refer logic theori partial meet contract function journal symbol structur noun phrase anaphora fifteenth annual confer cognit scienc page nj lawrenc erlbaum natur languag process knowledg phd technic report depart comput state york ny natur languag process proposit semant network structur variabl mind time narr deixi cognit scienc page lawrenc erlbaum nj volum princeton princeton volum ii princeton princeton epistemolog statu semant network associ knowledg page academ york editor read knowledg morgan san ca belief ascript simul reason phd technic report depart comput scienc ny logic belief sixteenth annual confer cognit scienc nj lawrenc erlbaum reason incomplet agent intl conf user model implement possess phrase technic note depart comput scienc ny editor read philosoph analysi york introduct van nj bdi architectur support act servic infer vice seventh florida ai research symposium page florida ai research societi editor semant network artifici intellig pergamon oxford concept proposit semant network cognit reprint pp model belief artifici order theori individu concept proposit machin intellig page elli horwood england reprint pp activ connect graph reason rule seventh intern joint confer artifici page morgan san ca natur languag page berlin intellig interfac technolog intellig user page ma multimedia system multimedia page acm ma basic level categori memori context annual confer cognit scienc societi lawrenc erlbaum nj natur categori system tenth intern joint confer artifici page morgan san ca flexibl natur languag process categori theori tenth annual confer cognit scienc page lawrenc erlbaum nj cognit fiction deixi cognit scienc page lawrenc erlbaum nj knowledg report cognit cognit process proposit reason psycholog denot reprint numer quantifi reason neg inform sixth intern joint confer artifici page morgan san ca semant network process system associ knowledg page academ york gener augment transit network grammar gener semant network american journal comput symmetr variabl bind approach natur languag compet confer artifici intellig lectur note artifici intellig page berlin path reason proposit semant network principl semant explor page morgan lo ca relev logic comput scienc volum page princeton princeton belief space set proposit journal theoret artifici intellig formal english intern journal expert embodi cognit paper aaai fall technic report page aaai menlo california infer rule annual nation confer artifici page morgan san ca logic program languag technic note depart comput suni buffalo present workshop logic program intellig rm queen long consid fulli proposit semant network knowledg essai page york model knowledg compet philosophi essai page mit ma famili comput mathemat reprint pp introduct comput reader narr deixi cognit scienc page lawrenc erlbaum nj implement group user manual depart comput suni ny
AI/717 2 diagnosi make norm reason wn van der torr max institut comput scienc im saarbrucken tan po box dr accept final form abstract diagnosi theori reason incomplet knowledg consid past distinguish violat qualit theori reason variabl consid futur distinguish fulfil goal goal paper formal norm special formal extens deontic logic pdl diagnost framework deontic reason formal reason violat distinct norm diagnosi theori theori extens deontic logic pdl show norm diagnost reason reason violat fulfil formal extens deontic reason introduct ai law literatur discuss deontic logic formal legal reason norm reason jone sergot jone argu deontic logic knowledg languag model formal reason violat oblig result oblig mccarti observ main featur deontic logic fact actor obei law forbidden act obligatori action machineri deontic detect violat action claim argu includ wide discuss imperi colleg librari regul norm worst mislead van der torr tan discuss deontic logic formal legal reason extend cover theori norm reason discuss formal norm diagnosi theori special formal formal distinct norm diagnosi theori advantag formal conceptu diagnosi theori clear logic relat norm account deontic logic pdl addit principl show norm diagnosi theori formal extens suitabl deontic logic advantag formal previou abil gener form norm reason norm conflict detect resolut paper diagnost framework deontic reason discuss distinct diagnost reason repres figur illustr ration agent time diagnosi theori theori figur reason norm ori tempor perspect diagnosi theori reason check system principl reason past incomplet knowledg diagnosi complet diagnosi theori formal hypothet reason judg public check legal system legal principl qualit theori describ norm influenc behavior base concept agent ration contrast diagnost theori reason futur main characterist qualit theori goal orient plan reason base applic consid qualit version util criterion built principl main ingredi violat formal reason violat diagnost framework deontic reason diod van der norm tan van der reiter theori diagnosi appli norm system fulfil make formal reason goal paper deontic logic pdl show deontic logic compon norm diagnosi theori qualit theori norm reason deontic deontic logic oblig deriv set oblig logic relat oblig deontic logic conjunct pq oblig logic relat oblig formal explain effect norm behavior diagnost reason reason formal ad assumpt pdl approach green traffic light car approach left light assum car stop assumpt explain deontic logic mccarti observ assum actor obei law call causal enabl predict action occur reason action occur mccarti conclud adopt causal machineri deontic logic reason physic world show formal norm pdl close relat formal pdl addit assumpt basi knowledg languag support system formal model legal practic argument theori debat system formal formal legal context featur actual norm diagnosi law process consist check legal context potenti crimin law leav option civil parti focu debat issu describ type reason suffici modul oblig check deriv theori provid support system base select civil parti support system select claim focu debat formal discuss paper applic van der torr tan section discuss diagnost framework deontic reason illustr exampl diagnosi theori discuss diagnosi theori theori formal norm reason reason approach diagnosi studi year numer applic diagnosi physic devic basic paradigm interact predict observ predict expect output assumpt compon work properli discrep output system predict diagnosi procedur search defect compon system diagnost framework deontic reason diod introduc van der tan van der formal deontic reason kind diagnost reason notic diod deontic logic describ oblig follow set consid diagnosi reason violat deontic logic model situat violat import make deontic framework diagnosi diod framework treat norm compon system system descript norm descript contribut reiter diagnosi theori wide accept approach model reason approach diagnosi main goal elimin system inconsist identifi minim set abnorm compon repres abnorm predic ab reason base assumpt diagnost reason principl parsimoni conjectur set faulti compon minim respect set relat diagnosi set predict assumpt compon work properli definit system pair system finit set constant denot compon system set sentenc observ system finit set sentenc system written system observ ob diagnosi minim respect set set comp context sd ob comp norm consist diagnosi predict measur context refer base logic diod fragment violat constant write entail definit minim set analog definit diagnosi multipl respect multipl minim set respect minim violat reflect situat ideal observ norm diagnost reason reiter theori diagnosi minim set violat argu underli assumpt proven constraint manag process model oblig assumpt proven innoc reason crimin defend argu violat procedur norm distinguish potenti subset norm context minim maxim call benevol definit norm system tupl ns finit set constant fn denot norm set sentenc denot oblig norm system tupl ns norm set sentenc describ fact potenti diagnosi subset norm context fact fv norm consist minim diagnosi minim respect set subset norm context consist set contextu oblig minim diagnosi norm system fff ff context ffg diod formal logic relat deontic logic der torr discuss relat diod anderson reduct standard deontic logic modal logic discuss relat diagnost reason deontic logic paper aspect diagnost approach explicitli distinguish diod aspect concern violat detect backward perspect aspect van der torr tan principl reason strategi deal incomplet inform violat detect principl formal minim formal proven assumpt differ aspect correspond judg view lawyer view norm system judg check norm lawyer argu minim set violat burden proof adapt illustr diod norm system deliv time parti deliv give notic parti deliv give notic parti deliv time norm fn fact easili check context impli ng potenti fn fn minim set maxim context impli context impli minim set impli assum parti notic norm maxim set assum norm qualit theori usual approach plan plan agent robot provid descript state goal charg task discov sequenc action achiev goal goal formal object face robot reflect grade time fill tank amount fluid spill realist plan situat robot object satisfi vari agent frequent encount goal achiev goal formal basic concept provid theori doyl reason goal formal diagnost theoret framework deontic reason extend diod crucial aspect goal formal diod goal fulfil formal languag predic formal fulfil goal norm fi formal formal show fulfil goal goal knowledg refer fulfil goal express diod theori norm diagnosi diod base distinct violat theori base distinct fulfil combin reason violat fulfil norm combin reason past versu reason futur fulfil versu illustr figur combin diagnost reason judg plan reason ration agent comparison der torr definit order pair norm order potenti determin activ norm forc minim element order order minim maxim compar pair norm similar compar diod definit norm system tupl ns norm set condit oblig norm system set pair subset norm context fact ff norm fv norm consist order set defin relat potenti diagnosi set minim order order potenti minim diagnosi potenti diagnosi minim order adapt illustr norm system oblig deliv good parti deliv give notic expect arriv date parti advanc fact parti give notic norm fn ae oe fact van der torr tan potenti fn fn context impli potenti minim paragraph section observ goal semant formal goal violat doyl obviou formal introduc set violat violat discrimin type insult privat insult van der ignor except articl formal extens norm system oblig forbidden insult wai violat privat public norm extens introduc addit complex illustr formal articl introduc norm violat norm system norm fn ae oe fact fig potenti diagnosi fn fn minim maxim context minim diagnosi impli insult occur privat context maxim impli insult occur public previou illustr formal norm diagnosi legal code refer categori categori deontic make explicit behavior classifi categori exampl categori insuffici care prohibit state legal consequ attach punish crimin civil appli regul observ behavior translat deontic leav open question feasibl practic harder case insuffici care case simplif legal practic insult case norm norm diagnost reason extens deontic reason van der torr show diagnost reason formal extens deontic reason ad principl suitabl deontic logic deontic logic logic relat oblig explain norm affect behavior ration agent op infer perform critiqu deontic observ deontic logic intend explain effect norm behavior explain aspect norm formal deontic logic observ commonli ai law logic model analog procedur model spot issu heurist disput gener ai wide accept reason deduct logic formal deontic logic pdl illustr norm diagnosi theori qualit theori view extens deontic logic formal illustr logic relat oblig formal explain effect norm behavior case formal extra principl ad deontic logic basi case diagnosi theori principl ad deontic logic parsimoni assumpt oblig violat paradox claim hand formal explain aspect norm behavior deontic logic deontic logic essenti compon theori physic explain phenomena mathemat mathemat essenti compon physic note formal diod base deontic show norm diagnosi theori formal extens deontic logic deontic logic modal prefer semant access relat interpret prefer relat read good world problem prefer logic defin oblig op strict prefer oblig op op conflict oblig op world satisfi prefer world satisfi oblig op vice versa prefer statement contradictori motiv weaker van der torr tan oblig absenc prefer van der van der torr definit kripk model consist set binari reflex access relat interpret prefer valuat proposit world world ff fi world logic oblig previou definit conflict op consist van der van der torr discuss oper make conflict inconsist consist set oper induc prefer order oper discuss paper distinct irrelev definit illustr modal logic pdl basi norm diagnosi theori definit consist step deontic logic determin activ oblig set activ oblig defin minim maxim definit oblig system tupl finit set modal sentenc denot condit oblig finit set proposit sentenc activ oblig set ao set ao fact pdl fig minim activ oblig set mao subset ao mao pdl ao subset mao pdl ao potenti diagnosi subset minim activ oblig set mao context fact fff mao consist set context relat set violat norm set fff mao relat set fulfil norm theorem state oblig system norm system prefer order induc pdl world correspond prefer order induc model norm theorem defin kripk world order potenti defin map pdl relat model fact potenti diagnosi context context mk kripk model order ident valuat preserv order map norm system oblig system norm norm norm descript formula ff ff oblig assum norm norm model model mao model mao ae proof norm norm iff map oblig ident valuat theorem directli mao assumpt map proof model mao model pdl pdl ao fact order world find set illustr theorem case oblig system oblig tautolog theorem directli assumpt map illustr logic deriv pdl translat base map theorem oblig system norm deliv good parti deliv give notic expect arriv date parti advanc fact give notic fact logic pdl deriv oblig logic set activ oblig minim activ set potenti diagnosi context van der torr tan impli compar analysi pdl analysi diagnosi correspond fn correspond fn context impli factual fragment pdl minim maxim minim theorem gener valid assumpt satisfi illustr distinct treatment activ oblig norm system norm fn ae oe fact map fact logic pdl deriv oblig minim activ oblig set model mao distinguish world order potenti diagnosi prefer diagnosi incompar fn fn relat order model distinguish world norm system norm fn ae oe fact map fact logic pdl deriv oblig tautolog minim activ oblig set empti model mao distinguish world potenti fn fn wai formal norm diagnosi special formal deontic logic pdl addit principl end small comparison perspect knowledg advantag formal pdl potenti gener account norm reason special norm determin norm aspect norm problem detect resolut norm deontic logic permiss conflict oblig detect resolv applic norm diagnosi requir full legal includ deontic formal advantag deontic logic pdl fragment deontic negat disjunct nest oblig make formal system complex diod simpl effici algorithm base conflict formal predic conceptu clear deontic built principl violat violat predic easili intuit formal deontic give rise formal read counterintuit articl formal insult insult privat van der relat research relat qualit theori deontic logic observ pearl investig account condit statement argu result account form sound basi qualit provid framework qualit plan uncertainti boutili develop logic qualit theori basic concept interest notion condit prefer boutili write read ff truth ff fi hold ff true prefer world satisfi fi boutili observ practic point mean agent truth fi fix agent ensur ff agent end desir boutili observ statement roughli interpret ff boutili observ condit logic prefer similar deontic logic put hansson conclud simpli express condit oblig ff hold fi thomason horti lang observ relat qualit van der torr tan theori deontic logic develop foundat qualit theori observ qualit theori reason consid extens deontic reason simplest definit goal accord gener maxim thing consist knowledg maximum view strategi ration agent behavior determin norm maximum extra principl top deontic logic explain norm influenc behavior boutili dub goal ck correct agent complet knowledg world uncontrol paper discuss diagnost framework deontic reason framework illustr distinct diagnosi theori theori crucial distinct theori perspect time diagnosi theori reason incomplet knowledg consid past distinguish violat qualit theori reason variabl consid futur distinguish fulfil oblig oblig paper deontic logic pdl show deontic logic compon norm diagnosi theori qualit theori acknowledg work partial support esprit wg anonym comment earlier version articl note der torr van der torr subtl distinct present framework discuss idea observ research show incorpor version framework diagnosi norm system formal repres norm addit assumpt principl diagnosi norm plan special formal repres norm addit principl plan reiter diagnosi basic minim principl principl qualit theori formal repres norm addit assumpt principl reason interest address paper special formal deontic stand test paradox gentl problem repres problem conflict structur similar distinct norm norm social moral behavior regular spontan member group norm sanction behavior minor legal norm norm social moral norm protect interest spontan norm qualit theori base concept prefer prefer kind endogen motiv mechan agent natur candid deal norm norm definit agent interest discuss paper agent work norm term gain gain observ learn effect norm reason rule ingredi enabl agent make norm norm maker differ ordinari goal serv dual role plan captur aspect intent desir express desir adopt goal repres commit pursu state accept proposit achiev task commit agent find accomplish requir adopt subtask correspond desir proposit semant concentr role express recogn result partial account goal plan system activ oblig set defin languag deontic logic pdl factual detach deriv fi der torr defin set monad oblig call actual oblig dyadic oblig activ oblig set definit flaw activ oblig set oa deriv undesir distinct model world explain distinct pdl ff impli ff contextu oblig pdl counterpart theorem logic pdl previou exampl illustr deontic logic add addit principl logic deriv reason set actual oblig standard deontic logic sdl theorem introduc infinit set oblig singl base difficulti defin discuss van der torr refer reduct deontic logic modal logic mind deontic workshop norm reason eleventh artifici intellig logic qualit theori fourth intern confer principl knowledg reason san morgan kaufmann plan control san morgan kaufmann preferenti semant goal nation confer artifici intellig model action introspect technic report mit ai laboratori gentl journal philosophi game artifici intellig model procedur justic kluwer van der torr tan theori legal logic match artifici intellig law analysi deontic logic deontic systemat read reidel publish compani deontic logic methodolog artifici intellig law law comput norm system perspect deontic logic comput scienc john wilei son condit desir util altern approach qualit theori tenth european confer artifici intellig modal model theori fourth intern conferenceon principl knowledg san morgan kaufmann condit qualit theori ninth conferenceon uncertainti artifici intellig san morgan kaufmann system prioriti artifici intellig law diagnosi process design technic depart faculti lisbon deontic logic diagnosi process design fourth intern workshop deontic logic comput scienc theori diagnosi principl artifici intellig legal expert discuss theoret assumpt phd utrecht van der deontic logic base diagnosi principl workshop norm reason eleventh european confer artifici intellig van der multi prefer semant deontic logic legal system relat legal theori van der repres deontic reason diagnost framework workshop legal applic logic program eleventh intern confer logic program van der combin order minim deontic logic base prefer deontic agenc norm system workshop springer verlag nondeterminist action foundat plan qualit sixth confer theoret aspect ration knowledg morgan kaufmann van der distinguish role norm reason sixth intern confer ai law acm press van der deontic logic qualit theori aaai spring symposium qualit prefer practic reason van der role diagnosi theori norm reason workshop formal model agent von practic reason blackwel
Agents/718 1 appli copyright taylor franci autonom agent busi process manag faratin dept electron queen mari westfield uk bt research uk tradit approach manag busi process inadequ dynam set internet intranet technolog number busi process exhibit properti approach describ implement base busi process manag system kei advanc system enact compon busi process deleg number autonom solv agent enact agent typic interact negoti agent order coordin action bui servic requir approach lead system agil robust tradit counterpart demonstr companion paper describ applic system world problem face british telecom success compani organ run busi activ effici manner core activ complet time resourc constraint stai competit continu improv busi activ complet higher qualiti lower cost awar potenti advantag design busi process manag system provid system substanti improv effici ensur busi activ adept collabor project intellig system integr project partner bt ici queen mari colleg address correspond professor nick dept electron comput southampton jen al design implement wide busi manag system complex activ softwar support distribut design oper concurr activ highli activ time requir abil access legaci depend execut oper depend state previou activ reactiv system busi manag demand domain requir art softwar solut decid ment busi process manag system base approach project adept environ process busi process view collect autonom solv entiti negoti mutual accept agreement coordin interdepend activ main advantag approach tradit counterpart manag inform integr greater adapt contribut work main busi process manag system base system work repres mean conceptu implement softwar solut insight gain work assist design busi process manag system evalu appropri agent identifi potenti guidanc structur applic work repres applic multiag techniqu world problem major shortcom disciplin date work make contribut autom negoti previou work made assumpt unrealist practic implement fail adequ captur rich negoti requir practic applic remaind paper structur section describ domain busi process outlin base kei abstract mechan section entitl realiz agent function detail system structur agent architectur section relat work place work context describ approach busi process manag relat work agent system section recommend agent busi process manag highlight open issu fulli address companion paper demonstr concept appli british telecom busi autonom agent busi process manag process provid quot instal network busi process manag section introduc domain busi process present case base kei conceptu compon build base solut basic busi process manag mora al categor process organ materi process assembl physic compon deliveri physic inform process autom autom task provid busi process center descript implement inform process materi busi process split number constitu compon busi process branch figur activ particip perform figur constitu compon busi process jen al interdepend exist languag vari greatli conceptu level broadli provid set concept describ depend requir role perform task activ process descript autom involv human interact comput busi process execut manag branch figur softwar system capabl ensur process descript realiz practic system human manual activ assign provid access softwar tool design requir complet ensur depend task softwar transpar support multipl invoc process task type busi process manag system vari ad hoc interact set path set pattern predict process simpl wire coordin deal predominantli orient activ groupwar ted activ georgakopoulo al detail survei interest scale wide busi process analysi kei characterist class applic process dynam unpredict imposs give complet priori activ form order detail time plan produc disrupt unavoid delai unanticip event peopl ill task longer nation task handl similarli manner process involv mixtur human activ autom task exact ratio vari applic issu relat role interact human system dealt companion paper multipl organ involv process organ attempt maxim activ process physic distribut contin decentr ownership inform resourc involv busi process autonom agent busi process manag group organ control resourc time frame inform idiosyncrat manag resourc high natur interrel task run point busi process requir monitor manag busi process control resourc constitu subpart place constraint entir process total total case solut tradit approach busi process manag involv describ entir process central perspect complet list activ path criteria path order constraint action complet busi process manag system compar straightforward task execut approach work simpl busi process led rang commerci product concert action estim market size billion class busi process inher shortcom tradit approach lack manag system requir priori tation busi process potenti deviat process ii manag system lack appreci content busi process make base natur inform gener iii system extens iv resourc manag system control resourc busi process reli process fulli dimens manag system tend central view singl manag engin oper server platform client oper system overcom fundament approach approach enact busi jen al process activ constitu maintain make compon activ busi main activ assign solv entiti ensur activ constraint mean activ perform left entiti determin entiti servic achiev interact involv deleg continu level nest mean busi process manag system sophist tradit counterpart made process descript design time move execut system mine run time execut fulli process execut system determin activ resourc activ perform resolv natur design implement busi process manag system make entiti autonom agent agent goal achiev interact manag interdepend agent view encapsul problem solv entiti exhibit properti agent perform major solv task direct human control action intern state social agent deem agent order complet solv activ agent initi exploit unexpect opportun agent perceiv environ respond time fashion secondari factor point agent suitabl solut domain involv inher distribut solv basic model solv autonom agent busi process manag ii integr exist organiz structur autonomi subpart maintain autonom natur iii interact fairli includ inform coordin complex social skill iv problem solut prescrib start problem solver ment unpredict process proactiv opportun domain includ number legaci incorpor busi process exist code autonom agent interact social rang applic jen main base approach tradit view greater action base current prescrib ii greater agil servic ad minim iii greater adapt choic guid feedback receiv previou invoc path busi process rel drawback base approach fragment view process difficult ensur wide constraint felt outweigh drawback conceptu framework main compon adept conceptu framework autonom agent perform activ term denot activ agent manag servic correspond conceptu unit solv activ busi process ple servic includ design provid insur quot review paper journal servic function undertak comput simpl design jen al figur conceptu architectur adept system chemic produc output servic detail ii determin agent execut servic term iii execut servic line term dition simplest servic call task repres atom unit solv adept system perform human autom program atom unit combin form complex autonom agent busi process manag servic ad order constraint condit control servic descript languag develop servic languag correspond adept process languag agent control depend agent requir servic manag agent simpli instruct start servic servic provis requir agent mutual accept agreement term condit desir servic perform contract call servic level agreement mechan make interag process parti verbal contradictori demand move agreement make search altern basic context form adept negoti ident involv connect agent requir servic provid term negoti orient perform agent protocol role current messag agent make respond accept reject agent mean describ refer domain term involv agent describ servic repres manner heterogen inher depart typic model inform resourc agent number semant map transform perform creat mutual inform share guag busi process applic organiz structur model process ing behavior solv compon rang applic type relationship peer organiz hierarchi relationship adept notion agenc al agenc consist singl possibl empti set task agent possibl empti set subag agenc singl agent distinct task subag agent repres interest agenc peer commun agenc agent subag agenc subag agenc typic behav cooper manner agent repres interest agenc wider commun jen al relationship subag agent view type social commit mean agent request servic request good reason subag routin retain local autonomi manag design depart request design engin work project engin perform request condit request met open tion relationship peer agent agent oblig accept request peer agent agreement peer agent interest agenc structur mechan encapsul abstract servic agenc illustr figur diagram repres structur ation design depart agenc agent repres depart manag agent depart contact design subag repres singl design engin capabl perform distinct task atom agenc repres team surveyor depart manag regist design servic provid design depart agenc organ depart manag regist provid servic agent commun condit manag provid design design engin provid servic engin figur logic hierarchi agenc autonom agent busi process manag collabor surveyor ensur design consist geograph requir network site manag regist design design engin regist peer agent servic agent repres team surveyor regist servic subject negoti depart manag cost design network instal characterist locat agent note agent requir design servic depart manag design network survei geograph requir site mechan agent repres reason servic level abstract servic agent regist commun task perform servic construct task servic subag unusu circumst agent servic provid peer combin servic construct lifetim agent regist servic withdraw servic due agent task build busi process applic adept adept system reliev engin burden build busi process applic autom execut manag level figur design time tradit system section detail activ built function enabl design engin concentr applic layer adept implement process involv number constitu activ servic adept sdl determin distribut agent agenc templat servic issu settl orient tion templat servic client price time servic provid requir slot templat servic qualiti volum relev issu provid accept rang slot determin interag negoti maximum jen al figur adept implement system minimum price paid shortest time servic maximum number concurr invoc servic reserv valu repres domain knowledg constrain process servic provis inform model agent inform share heterogen present local templat provid reserv valu servic fairli simpl knowledg acquisit task case companion paper sdl servic realiz inform model relat complex consum activ issu dealt length section discuss remaind section servic agent sdl descript ed descript consist set set bodi input tion servic input mandatori option mandatori input provid invoc servic option input inform servic enabl servic perform quickli input categor vide input autonom agent busi process manag servic prepar tabl mandatori input provid client provid server provid option input provid client server distinct output servic assign output inform object home seat alloc input output term inform model agent servic inform object prepend inform model input output prepar tabl servic inform object home inform model guard boolean condit relat state world servic execut evalu servic invok evalu servic fail bodi servic process servic prepar tabl requir number guest equal number peopl accommod guard evalu agent start cute bodi bodi servic descript servic consist restrict order compon servic atom condit servic deem inform compon servic bodi singl block nest subblock block â type font perform perform loop iter tion figur consist sequenc figur exemplar servic prepar tabl jen al figur exemplar servic meal subblock block refer complet state block block prepar subblock block complet condit meal true block refer successfulli unknown process execut comma separ list block execut list block meal sequenc block para subblock singl servic eat subblock clean execut list includ condit statement statement test piec inform subblock test friend meal set friend friend evalu condit complet state evalu unknown complet state express condit complet successfulli block complet state unknown loop block type return unknown unknown block execut condit return unknown reli inform object attribut inform object unknown servic execut inform valu complet state chang complet express autonom agent busi process manag block meal state block successfulli complet meal clean compon block fail servic call refer provid suffici paramet execut servic prepar tabl call singl paramet paramet choic output plan syntax plan keyword servic refer servic block tion friend input applic layer busi process execut manag function adept agent realiz agent function section describ adept conceptu framework realiz section describ function architectur adept agent section deal interag commun issu descript architectur commun infrastructur support kei activ servic provis servic ment undertaken function architectur adept agent consist number distinct function modul handl interag negoti action manag modul assess current solv situat situat assess modul execut servic servic execut modul modul util persist inform agent environ store acquaint model inform store model agent send receiv commun modul cm acquaint model model tori knowledg environ agent maintain inform servic provid reserv resourc jen al figur function architectur adept agent current schedul activ acquaint store inform exist capabl histori past encount knowledg model inform interact manag modul imm provis servic negoti procur servic agent requir decid servic agent provid term condit servic sion mode depend client intend pattern usag server schedul servic provis time agreement cover servic invok autonom agent busi process manag client basi time frame maximum volum process obtain servic agent initi sam sam desir mode provis imm determin agent agent negoti strategi imm make port type inform schedul constraint eman sam knowledg agent prefer servic reserv valu issu negoti knowledg capabl agent knowledg negoti imm gener initi evalu incom produc intent reach mutual accept agreement provis requir servic process decid servic suppli initi receipt agent term feasibl made process expand section servic provis situat assess modul sam assess monitor abil meet assess abil meet negoti involv main schedul servic task ling level except occur servic task execut schedul maintain record solv resourc agent control task negoti indic resourc commit resourc inform coupl grain schedul algorithm determin pose servic provis grain schedul algorithm determin servic cute time servic manag phase grain ul initi server imm receiv agent aim decid request feasibl ascertain imm sam schedul accept advanc sam provid estim circumst chang point check made time servic requir execut sam current resourc commit commit jen al follow ongo negoti gener ing schedul agent satisfi schedul servic dict altern fine grain schedul place relat time servic execut set resourc deploi execut resourc reserv execut client servic provis demand sam volum invoc predict futur demand resourc agreement level except handler servic execut except occur formul set recoveri action prevent servic fail execut sem realiz requir subsidiari servic subsidiari servic path busi sam request imm arrang servic made servic sam decid local achiev violat exist request imm attempt schedul consum exist termin altogeth pai penalti servic execut modul sem manag servic tion involv main activ servic execut manag involv sdl constitu subpart logic complet condit schedul sam requir termin task servic manag enact task servic execut instanc assign process thread multipl servic execut singl agent time sem main activ inform involv rout inform agent execut sdl sem perform level except handl involv monitor tion task servic unexpect event react event task sem recov attempt restart task present schedul autonom agent busi process manag refer problem sam sion commun modul cm packag messag destin agent share commun languag inform receipt interpret messag agent task task manag resumpt messag rout sem task manag agent servic execut manag initi termin servic provid agent exist messag rout sem servic agent messag rout imm agent negoti addit cm check valid incom messag ensur correct present context agent receiv agent negoti error messag translat content messag share inform model local inform model interag commun agent commun agent commun languag acl consist messag limit number primit messag ident recipi agent thread servic inform model refer content messag understood altogeth messag type negoti servic execut addit requir agent share common messag syntax interpret messag type uniform inform share agent common semant interpret problem interact agent necessarili model inform consist network design depart agent cation compani interpret locat site postal address team surveyor understand symbol refer grid refer standard ordin survei map design depart requir survei agent model inform understand tabl agent commun languag action content mean context empti sender recipi messag provid servic agent time empti inform incap perform action capabl empti inform capabl perform action singl inform object perform capabl condit perform nonempti list servic provid perform action type condit tabl list accept empti accept commit perform tabl reject empti reject tabl termin negoti action type confirm empti commit tabl action accept tabl continu action content mean context deni empti withdraw tabl circumst action accept action consequ agent pai penalti commun act intend commun exist interpret negoti messag context deni agent exist agreement request instruct request agreement messag servic provid refer start provid perform action instruct accept respect servic scope agreement suspend termin report report state report state servic messag servic perform execut refer instanc servic execut inform inform object inform relev messag execut servic refer inform relev output execut servic jen al approach common inform agent share inform inform model built number basic inform object class adept adept adept integ adept class prepend inform case â class adept inform model number slot ing adept inform object object type adept time adept time integ string integ integ integ integ inform model creat tation model nativ languag agent adept common inform model built inform object class includ contact concret inform object bt applic companion paper event busi process manag system develop agent design model domain task case busi process task involv legaci softwar custom built model inform agent repres interest compani common inform model inform share organ extrem ident model intern agent abil manag heterogen inform transform inform express model common inform model transform inform intern common simpl schema translat map object model agent provid function transform intern time point inform object class adept time illustr schema translat advantag basic tabl map costli produc maintain translat agent system requir inform model highli applic depend requir schema translat agent commun inform requir altern deep autonom agent busi process manag intern common inform model refer ontolog takeda search transform inform object model initi product ontolog solut costli schema advantag potenti reason ontolog design hybrid approach speed schema translat approach ontolog base approach adopt agent maintain set model map descript declar procedur requir form inform object model map agent transform inform object requir line figur map agent search map ontolog descript map store line figur typic agent provid initi set schema updat set map found servic provis perform adept system holder consum servic intim relat effici interag negoti process agent make agreement reason time resourc relat negoti enact decentr fashion arbitr parti process creat bottleneck suscept failur agent negoti imm cope varieti negoti situat agent imm number negoti strategi tactic vari behavior rang behavior negoti peer negoti subsidiari negoti agent extern organ negoti agent negoti requir rapid agreement negoti time number requir orient negoti emerg busi process applic studi adept servic provid agent servic ident characterist vari dimens jen al individu agent client server servic negoti context negoti rang number quantit qualit type report polici natur issu success negoti requir rang issu resolv satisfact parti agent requir make issu faster complet time lower order agreement social context interrelationship particip agent negoti negoti involv entiti organ depart gener cooper natur negoti competit group agent negoti negoti infrequ agent factor negoti stanc behavior privat oppon agent util oppon place reason model ment outset particip sect rang commun channel negoti agent privat agent compet provid servic check behavior oppon time import negoti time import distinct time reach agreement time negoti servic cute import case crucial mean agent involv unnecessarili complex consum negoti time spent negoti respect servic mean agent hard deadlin agreement place occur multipl servic combin close order satisfi number constitu ponent design protocol indic messag ii structur repres issu negoti autonom agent busi process manag iii reason model determin behavior negoti negoti protocol agent adher adept negoti protocol servic provis state transit arc repres server client negoti initi client utter state server capabl server acknowledg capabl client capabl inform client send server reject accept server client deni contract server contract server client accept contract reject contract transit state client eventu accept contact server decid award contract client deni client negoti issu structur agent negoti repres bid tabl negoti contract figur adept negoti protocol number oval repres state negoti process oval repres state outcom negoti shade oval repres unsuccess negoti state arriv edg reject deni oval repres success negoti state arriv primit confirm refer tabl detail individu primit jen al figur sampl servic level agreement end success negoti structur deriv type legal contract regul current busi action valu slot repres condit vide consum servic server client agent negoti multipl issu time servic servic agreement refer id uniqu case multipl agreement server agent client agent repres agent parti agreement deliveri type servic provis schedul inform sam sem servic execut manag durat repres maximum time server start time end time resent time agreement valid ment agent invok agent cost design network requir servic execut minut agreement tain inform volum invoc permiss autonom agent busi process manag start end price paid penalti server incur violat client info inform client provid server servic invoc case provid custom report polici inform server return complet negoti reason model reason model determin behavior tion context initi negoti obtain desir respond determin accept determin made counter reason undertaken imm imm reason compon sierra al formal support inform tain agent model work memori evalu reason agent determin gener control hand strateg tactic reason produc strateg reason level agent approach negoti cooper time resourc primari tactic reason slot enact chosen strategi figur intern architectur imm jen al inform negoti reason compon main repositori work memori agent model repres inform relat ongo repres persist storag stabl inform inform store work memori structur notion negoti thread thread essenti record histori utter relat negoti server includ messag agent messag agent strategi tactic agent current statu negoti thread case agent manag multipl thread negoti earliest start latest end time context support agent model repres belief environ agenc uniqu individu member agenc relationship subsidiari commun member agenc agent organ agenc agent provid servic agent negoti protocol interact persist record negoti thread sm servic descript servic agent perform indic number concurr invoc commit agent made reserv valu servic consum prefer issu negoti score evalu reason evalu reason activ agent receiv agent receipt agent comput util attain addit score function slot slot assign weight repres rel import issu agent case depict figur agent receiv slot assign measur desir util rate raw util valu multipli weight factor rel sum slot process produc singl util agent send receiv cal reason agent produc current strategi tactic return evalu autonom agent busi process manag reason rate score function util agent equal util accept meet schedul constraint accept involv condit server execut servic term condit commit condit client deni contract assum client termin negoti thread servic instanc evalu reject occur deadlin reach agreement reach agent select perform servic evalu outcom accept reject agent gener counter counter evalu reason make assess negoti behavior current thread evalu current incorpor relationship previou thread agent behavior oppon mutual util recipi greater previou receiv agent util recipi previou receiv agent util recipi previou receiv agent direct agent negoti thread histori determin rate chang state agent calcul constant piec inform pass strateg reason determin present strategi success chang strateg reason strateg reason invok ation reason case ongo negoti sam negoti reason level set broad guidelin agent behav tion context current guidelin relat mine rel import class behavior behavior primari basi time import negoti deadlin resourc consid agent expend amount contract behavior sider ensur agent exploit negoti tive import class express assign seri jen al weight altern agent receiv inform sam servic requir tion number supplier servic inform relationship potenti servic provid set strategi strateg relat logist negoti negoti agent agent negoti negoti proce sequenti parallel servic provid agent real choic make level agent heurist manag aspect process decid agent determin behav rule set shown figur addit set agent record expect negoti develop term speed converg oppon inform monitor progress ongo negoti ongo role strateg reason mine current strategi success term predict develop util agent obtain negoti object monitor world agent oper subject figur negoti logist rule autonom agent busi process manag figur set negoti strategi chang agent requir servic estim provid servic unchang strategi mean agent open ation oppon behavior easier strategi trigger type event chang intern state time agreement place oppon ing jen al rule illustr strategi figur tactic reason role tactic reason enact level behavior set strateg reason output level valu slot tactic function act line set set slot slot tactic select minimum maximum issu qualit tactic discret rang process achiev map qualit valu quantit score function tactic comput slot main wai detail oper varieti tactic found figur monitor modifi negoti strategi autonom agent busi process manag section companion depend famili tactic base behavior time remain agreement place negoti deadlin tactic put forward reserv valu reach valu broad pattern maintain time exhaust begin reserv move rapidli reserv depend famili tactic base behavior amount resourc remain properti tactic model urgenc deal resourc parti negoti length negoti comput load agent actual relationship quantiti time left negoti proport number agent negoti proport length negoti thread agent potenti perform longer agent negoti longer durat urgent agreement depend famili tactic base behavior oppon behav ongo negoti thread tactic famili aspect behavior wai behavior rel tat absolut tat averag imit ag fashion famili comput negoti issu base perspect valu issu rel weight set strateg provid singl put forward issu servic manag made agreement provid agent attempt honor process involv princip ul servic constitu accord term condit execut servic jen al figur negoti tactic rule agent provid servic acquaint sam perform line grain schedul determin constitu compon execut solv resourc deploi sam niqu proactiv schedul task servic requir sequenti schedul ahead schedul associ demand provis demand task servic servic schedul servic descript servic execut time schedul compon part task servic execut compon process tive schedul execut sdl step ahead step schedul previou autonom agent busi process manag sequenti ahead sam set sem actual execut servic task reserv princip associ task instanc servic uniqu sam set reserv provid suffici resourc compli compon volum invoc permiss concurr agent schedul methodolog link gener legaci schedul reserv process wai servic demand sem invok resourc set grain schedul phase complet inform sam end result sam remov reserv free resourc number reserv volum initi set note impli resourc prioriti sem reserv set bar process instanc reserv reset embark readi demand complet sam inform reserv remov resourc freed due dynam natur except servic execut sem monitor execut task detect wrong except handl sem sem inform sam problem except function resourc relat tional except activ perform resourc state error sam attempt reschedul task instanc task schedul instanc task type option consid sam decid situat quicker spare resourc immedi reschedul requir resourc consid relat except failur occur underli resourc task task instanc dealloc task provis instanc fail task instanc back sem inform sam locat task instanc make subsequ ul activ sam handl except instruct imm agreement version agreement reach servic fail server pai penalti jen al relat work number research area impact relat work articl section close relat adept kei extant autom negoti autonom agent techniqu agent heterogen inform model area dealt turn extant system time commerci system support busi process manag notion agenthood exist manag system limit support minim process enact situat busi process fulli resourc conceiv outcom sider convent distribut comput techniqu tradit system adequ system cope error dynam adept approach robust core function tradit system autom execut sequenc task support busi process system consist engin execut busi task order script adept system subsum function sdl sem execut servic descript unlik manag adept perform resourc manag sophist tion handl adept agent abil perform explicit resourc manag control reason peopl make organ busi process system provid capabl direct resourc manag process resourc sion prior enact adept approach mean system unexpect unusu pattern resourc avail present except handl manag repres altern path busi process agent dynam attempt process task order resolv except approach agent autonom agent busi process manag react context depend manner circumst type correct action vari depend avail resourc critic process manag system tend oper central engin monitor event system type architectur limit busi process span larg adept robust scalabl dispar compon busi process repres agent agent distribut logic physic organ limit current gener number research consid multiag system aspect busi process manag hall agent enabl expert manag busi process user involv busi process design process languag present descript process task enabl automat reason oper busi facilit exist process task repres role execut set task set stop condit similar structur servic descript adept mandatori input servic precondit execut descript process involv execut servic provid complet condit similar role stop condit rigor descript process task base busi process manag system potenti modifi busi process refer chang circumst agent technolog enabl busi process complimentari base busi process manag system adept type architectur takeda tenenbaum altern method organ multiag system manag busi process agent organ group singl agent autonomi serv identifi agent join leav system manag direct commun particip function similar provid dai orb anonym commun agent inform event regist interest refer origin translat messag content jen al tion problem decomposit distribut subproblem agent origin delai commun event agent temporarili line architectur enabl agent commun concern syntact semant requir recipi agent send messag base rout messag perform facilit particip agent requir secur direct commun enabl manag facilit facilit repres est agent facilit manag direct commun negoti agent trust act interest interest resent feder architectur pure cooper agent team level organ shade secur issu address architectur emploi busi process manag organ involv addit difficulti feder architectur support encapsul servic abil model peer hierarch structur adept found organiz model logic divid collect servic agenc concept adept draw principl group vice system make pragmat feder architectur mobil agent approach ment busi process merz al argu technolog mean organ requir servic requir implement mobil agent organ accept arriv mobil agent handl organ particip passiv activ manner mobil agent autonom function negoti reli type advantag feder advantag mobil agent claim reduc commun shown sophist mobil agent time transmit network problem mobil agent technolog manag busi process lack secur particip mobil base busi manag organ cate program possibl compet organ execut local machin mobil agent good choic secur issu address autonom agent busi process manag autom negoti interest design build engin coordin techniqu effici task alloc approach adopt adapt tool techniqu game theori social enc central aim game theori ration behavior multipl agent interact rosenschein zlotkin game theoret model obviou sourc inspir work model desir properti model altern passag time respect negoti shown game agent simpl stabl negoti strategi result effici agreement delai game theoret techniqu answer question consid basic assumpt game theoret model make involv appli techniqu adept context game theori model rest assumpt negoti agent interest tional commun ration agent assum set altern agent risk attitud util function agent involv make order appli model design strateg bargain map applic problem chosen identifi equilibrium develop simpl search techniqu provid util function strateg bargain model map applic difficult game theori clear design implement equilibrium adept agreement game theori requir agreement advanc equilibrium strategi tion game theoret model commun complex import practic applic util set risk attitud privat inform inform publicli intract larger game adept negoti model social scienc model negoti model make restrict jen al assumpt game theori attempt identifi describ behavior achiev satisfactori outcom krau prescrib behavior game theori negoti behavior adept heurist agent search oper prune set action model inspir success human negoti fact behavior easili predict requir simul empir negoti mechan design lead stabl predict system show adept negoti model coverag major circumst commun comput overhead accept applic sequent theoret analysi demonstr valid result subset adept scenario element game theoret negoti util function ration basi imm make function augment work eman social model provid negoti heurist guid imm process set gener monitor modifi strategi time inform interchang common number relat integr project takeda tenenbaum adept agent share inform express common tion model refer ontolog ment ontolog import research area distribut system develop gener accept nech ontolog written scratch fusion exist ontolog inform number ogi develop domain integr relat activ ning ontolog intend system work tool stanford ksl ontolog serv reduc time consum develop ontolog applic reduct explicit ontolog inform code schema attract motiv advantag disadvantag outlin number method build schema translat autonom agent busi process manag simpl initi mechan emploi hybrid approach advoc potenti advantag schema format schema requir research techniqu requir carnot project cyc global ontolog schema input user driven model tion softwar tool produc articul axiom schema articul axiom map local schema cyc cyc global ontolog function share inform model restrict domain busi total autom tion schema translat ontolog feasibl agent commun inform exist schema translat greater agent advantag servic slightli inform system exist ontolog automat refer domain gener schema disadvantag explicit ontolog interact agent paper conceptu implement base system manag wide busi process adept philosophi found kei develop provis manag make solv compon reactiv proactiv respond unexpect situat work view repres support tion busi process manag softwar adept design adept method approach structur design develop busi process manag system kei concept view servic servic level resourc inform share view readili appli busi process applic ti detail realiz adept ii adept implement identifi adept system languag implement structur reimplement program ment develop agent system busi process jen al iii adept solut adept program ment busi manag applic adept design methodolog structur tion adept softwar implement autonom agent advantag tradit approach potenti drawback approach difficult attain coher view entir busi state distribut combat expend suit visual tool enabl busi process manag view reconstruct state constitu compon jen al companion paper autonom natur solv greater chanc busi process fail meet overarch straint oper busi process construct preset rout minim negoti strategi tactic agent carefulli engin maxim chanc make agreement empir work analyz properti rel merit combin strategi tactic report faratin al theoret work subset scenario report jen major technic advanc achiev adept relat techniqu develop autom negoti techniqu inform share agent heterogen inform model approach agent exhibit rang tion behavior depend context hybrid solut combin speed schema map work ontolog adopt adept solut technolog real world applic appli bt busi process provid quot instal network detail applic companion paper paper serv main illustr concept insight adept approach appli practic ation note import aspect success busi process manag optim process step endeavor understand process oper typic autonom agent busi process manag system analysi activ involv interview peopl expert knowledg process studi relev system step explicitli reconsid redesign process busi process engin typic carri order improv effici busi process qualiti reduc meet busi challeng opportun chang exist servic introduc step encod busi process descript busi process languag adept deal step assum process engin place major featur distinguish agent system orient system tradit form distribut comput agenc task subag peer agenc agent commun cross agenc boundari figur agenc peer agenc agenc peer agenc agenc peer agenc negoti contract servic requir design servic arrang run time choic system design manag applic layer support agent basic capabl heterogen distribut ponent busi process manag system current ture base dai compliant object request broker distribut platform adept system restrict corba platform distribut platform provid map converg layer layer technolog neutral ture procedur languag languag typic requir rigor control bodi execut autonom agent unpredict felt control left agent determin runtim dictat design compil adept bodi partial control restrict order concurr execut complet express suppli agent complet logic block term agent complet servic mean current circumst agent architectur base archon inform model understood symbol agent make drawn busi process subsequ work network manag part led applic orient negoti gener legal enforc actual payment penalti handl adept system time note weight agent renorm valu agent solv resourc dynam determin agent knowledg resourc task sam form resourc list instanc task type task instanc provis task instanc remov task resourc list provis futur agreement task run busi sam initi search incomplet agreement resourc ad resourc list anticip futur takeda al refer architectur unit perform function facilit feder architectur genesereth ketchpel stanford ksl ontolog editor tool support collabor creation ontolog repres ontolingua languag design jen al ontolog id alien refer evolut cooper york basic book platform build icl corpor system version jen negoti function autonom agent int robot autonom system ontolog integr proc conf cooper inform toronto canada part network manag provis foundat intellig physic agent http uri negoti agreement give houghton ketchpel softwar agent comm acm sheth overview manag int journal distribut parallel translat approach portabl ontolog knowledg acquisit lenat mid term report ai magazin intellig agent architectur support process manag system proc int conf practic applic intellig agent agent ration behaviour bargain equilibrium game social situat cambridg press refer model manag coalit al global inform manag local autonom agent proc int dai logic chicago press cooper industri agent system london world control cooper problem solv industri agent system joint intent intellig al base busi process manag int journal cooper mation system al manag busi process intellig agent proc bc expert system confer system integr programm al archon develop world dai applic ieee expert al transform expert system commun cooper agent int journal engin applic ai lehmann design build negoti autom agent comput intel zlotkin agent negoti time constraint intellig negoti cooper agent environ intellig current statu conceptu catalogu sal proc int workshop conceptu graph workbench colleg maryland june transact bulletin technic data ieee comput societi novemb kind softwar autonom agent busi process manag flore action integr technolog bulletin technic data engin ieee comput societi flore action approach ment proc conf comput support cooper work mobil agent proc int conf practic applic intellig agent agent essenti corba system integr distribut object john wilei object manag group negoti principl foundat distribut ed jen wilei wilkin reason locat theori practic comput intellig al enabl technolog knowledg share ai magazin jen gener state cooper autonom agent proc australian workshop distribut al design implement agent architectur busi process manag intellig agent ed jen lnai develop reactiv system inform process elsevi negoti behaviour academ press art scienc negoti harvard press zlotkin rule encount mit press perfect equilibrium bargain model econometrica fox constraint direct negoti resourc alloc distribut intellig ed gasser huhn jen orient negoti model agent proc european workshop model autonom agent agent agent organ multipl ontolog int cooper inform system april fear byte gruber lesson shade proc int conf integr jen effici mechan suppli servic agent support system base softwar engin iee softwar engin jen intellig theori practic knowledg engin review
HCI/719 4 error locat model ubiquit comput jeffrei hightow borriello comput scienc engin box wa octob abstract matter technolog techniqu ubiquit locat system measur amount quantifi error error inform convei arbitrarili simpli perform evalu onlin characterist system behavior term resolut overload mean short argu error distribut provid quantit summar system accuraci sensor fusion introduct advoc ubiquit error distribut summar locat accuraci indoor factori floor system locat tag object error margin defin gaussian distribut center true locat σ summar minimum perform level built empir studi locat system fundament compon locat system built infrastructur densiti number infrastructur element area volum space locat rate number object locat rate limit protocol overhead amount wireless spectrum error characterist gross summari function maximum locat error occur locat object summar system behavior valu assign ambigu term resolut behavior locat system standard method captur commun error distribut section explor type error relat common framework section illustr error inform section suggest path adopt standard error inform ubiquit comput applic section conclud error sourc locat error error vari dynam moment moment depend state mobil object identifi measur error encount ubiquit locat system signal propag locat system wireless technolog detect proxim measur distanc wireless transmiss subject reflect absorpt factor physic materi infrar attenu brick depend radio emiss attenu wall reflect properti similarli locat system account dynam signal propag error environ model model empir measur dataset microsoft research radar locat system parametr indoor propag equat model effect floor ceil radio signal result environ propag varieti assign probabilist uncertainti individu distanc combin comput locat measur uncertainti repres statist distribut gaussian expect equal measur quantiti σ deriv propag model time variat distanc measur proxim read requir agreement time perfect synchron time variat introduc error measur comput locat time variat error model distribut signal propag receiv synchron satellit transmitt measur time signal reach ground space gp satellit synchron transmit local time signal receiv comput differ quantiti call measur satellit receiv linear solv system equat unknown incorpor time error directli total error model refer summari gp theori misra al theoret discuss error combin effect locat accuraci gp system individu signal time measur uncertainti assum proper assess uncertainti assum gaussian error uncertainti comput equat mi locat comput geometr final locat measur uncertainti deriv propag time model magnifi quantiti summar qualiti aggreg geometr measur gener form geometr proport root squar time uncertainti comput equat σ assum measur mn uncorrel common varianc case locat shown function spatial arrang mobil unit sensor volum shape form object measur point proport magnitud higher impli uncertainti comput locat figur illustr low high situat hypothet locat system oper geometr incarn radar vision system emploi abstract scene analysi rf visibl dataset quantiti figur hypothet locat low occur measur point good separ rel object locat area uncertainti intersect small locat system base distanc measur detail discuss comput valu formal method comput mention section arrang fix probabl distribut estim comput mobil unit regular locat environ find configur highest yield locat appli error inform error distribut inform valuabl wai applic context awar applic benefit error inform applic rout phone call user behav differ locat uncertain uncertainti case close phone system messag figur hypothet locat high occur measur point poor separ rel object rang distanc measur error figur locat uncertainti larger simul trace log error distribut part input prototyp ubiquit applic locat system simul rigor test environ potenti avoid monetari cost configur hardwar infrastructur goal simpli evalu suitabl system build applic preliminari work idea begun built simul system quak iii game arena sensor fusion sensor fusion multipl locat system simultan form hierarch overlap level accuraci individu system error inform piec fuse inform convolut error distribut approach similar collabor robot local techniqu fox al path implement adopt method convei error inform benefici varieti ubiquit applic issu deserv standard commun error inform featur navig system protocol nation marin electron associ standard voluntari standard adopt devic manufactur interfac navig devic chart gp equip modern gp unit includ unit support serial messag pass protocol consist asynchron commun varieti navig inform control instruct sentenc locat error inform time drift reason similar voluntari commun standard adopt indoor domain locat system ubiquit comput data protocol ubiquit comput system built asynchron messag pass architectur decentr oper scalabl frame refer locat system adopt frame refer gp marin navig devic emploi world system model shape coordin system ubiquit comput applic ad hoc refer frame defin administr boundari ubiquit locat system adopt standard complex method referenc convert refer frame symbol locat ubiquit comput applic interest symbol locat wall exact physic posit symbol inform event gener physic arrang proxim situat occur symbol locat odd describ comput locat geometr properti realtim error distribut xerox parctab infrar beacon high locat uncertainti great oper solut easyliv team microsoft research abstract layer merg error distribut extern room volum geometr servic region object obtain relev symbol inform distil error elimin deem irrelev shown error distribut effect summar locat system accuraci sensor fusion current work involv incorpor error inform fuse locat system includ proxim rfid infrar ad hoc locat system work method queri fuse locat model spatial tempor object arrang applic area investig includ artist experi captur biologi laboratori explor larg number stationari autonom robot sensor refer larri stefan robert ubiquit comput biologi laboratori journal lab autom march padmanabhan user locat track system ieee volum page march barri john shafer ubiquit comput role geometri special issu smart space volum page ieee person octob marku fredrik quak iii arena simul sensor actuat evalu test mobil servic chi extend page short talk peter dana global posit system overview dieter wolfram sebastian thrun probabilist approach collabor local autonom june robert janet eric adam steven steven tom brian david program comput environ depart comput scienc june jeffrei hightow borriello locat system ubiquit comput august jeffrei roi borriello indoor locat technolog base rf signal strength depart comput scienc februari brian michael pratt gp perform navig ieee issu januari shankar brian armando pat terri winograd servic framework ubiquit comput environ ubicomp septemb scott rapport mhz path loss predict model indoor wireless commun build ieee transact antenna februari roi bill norman rich karin david john mark weiser parctab ubiquit comput experi tomasz mobil chapter page kluwer februari isbn
ML/720 6 intl confer pattern septemb learn face space recognit liu dept math comput scienc missouri st loui st mo harri wechsler dept comput scienc georg mason va abstract paper advanc integr learn evolutionari comput methodolog approach task learn face space methodolog gear provid framework enhanc robust face code classif scheme deriv evalu machin human benchmark studi interdisciplinari draw accumul vast knowledg comput vision psycholog describ evolutionari comput statist learn engag mutual benefici relationship order defin exemplar code face space successfulli cope chang popul leverag past experi increment face space definit introduct challeng task visual form analysi object recognit understand peopl process recogn develop comput model autom face recognit system enorm problem involv hundr scientist interdisciplinari research ultim solut remain face space metaphor start point paper goal advanc integr learn evolutionari comput methodolog approach task learn face space methodolog gear provid framework enhanc robust face code classif scheme deriv evalu machin human benchmark studi interdisciplinari draw accumul vast knowledg comput vision psycholog describ evolutionari comput statist learn engag mutual benefici relationship order defin exemplar code face space successfulli cope chang popul leverag past experi increment face space definit evolutionari akin stochast search instanti genet algorithm comput effici sift huge number face space question cognit concern knowledg categori acquir encount exampl reason support view categor concept implicitli defin term exemplar encount call store abstract prototyp squir view knowledg special statu emerg natur item probe belong categori function similar item exemplar categori store memori categor effect found affect percept face beal keil shown discrimin accur appar categori boundari continuum morph reason lead directli face space term face label code driven cluster densiti abc consid depend local densiti surround compet altern face space code defin typic term face distanc prototyp abstract face recent experi report rhode al suggest abc model compar favor provid complet account ethnic effect recognit question beg answer fine face categor measur similar answer question exemplar refer earlier repres face dimens evolv time spatiotempor statist face space encount gener solut advanc paper unifi code code altern code strategi compet defin face exemplar encod share dimens natur dimens face space bridg imag process imag combin perceptu cognit face recognit abil discuss burton al support interact activ competit model face recognit specif object criteria address paper face space relat face recogn discrimin face possibl categor gender ethnic kind preprocess face imag subject prior encod classif criteria correspond cognit perceptu process refer model fundament undertak find optim mix perceptu cognit process defin face identifi specif characterist robust encod basi preprocess face imag project background idea learn face space motiv natur scene encod encod natur scene advantag imag statist seek deriv natur basi deriv basi function found close approxim recept field simpl cell primari visual cortex recept field resembl spatial orient barlow argu recept field subject redund reduct minimum entropi code field deriv local orient recept field base criterion bell sejnowski independ criterion deriv qualit similar result natur basi basi complet low effici deriv suitabl imag structur sensori signal structur essenti process imag retriev object recognit natur basi addit train train imag futur task repres term natur basi natur gener properli encod specif task face class object repres human face possibl index ethnic seek learn face encompass natur basi observ fit knowledg dilemma circumv introduc make elimin varianc reduc learn low visual object extens prior knowledg recent suggest edelman claim task similar judgment tend perform low sensori data low import number exampl requir attain level perform grow exponenti underli popular techniqu capabl deriv princip compon analysi appli extens face recognit kirbi sirovich show face econom repres coordin face approxim reconstruct small collect project appli pca techniqu face turk pentland develop wellknown eigenfac eigenfac correspond eigenvector domin eigenvalu face covari matrix eigenfac defin featur drastic reduc origin face detect identif carri reduc space pca shape textur code recent promin encod face imag order encompass concret inform face shape textur conjunct norm base process face locat code start annot face import intern face boundari point control point align scale rotat transform shape deriv stage triangul annot face warp face shape stage yield stage yield textur correspond full face classif robust index retriev encod scheme requir low featur data compress faith reconstruct enhanc discrimin abil subsequ imag retriev complementari requir address approach similar constrain unifi theme lower subspac dimens subject fit discrimin index candid code scheme recent develop found probabilist reason model enhanc fisher model enhanc independ compon analysi lower subspac dimens code scheme possibl whiten code scheme manipul discrimin index specif pca fisher linear discrimin independ result imag pca data prm method emploi yield minimum error underli probabl function carri recognit task compress subspac map criterion model implement reduct goal balanc select pca eigenvalu account spectral energi raw data requir eigenvalu scatter matrix reduc pca subspac small success face recognit methodolog depend heavili preprocess featur extract recent shown integr shape textur preprocess method compar favor exist method shown integr shape textur preprocess method success coupl classifi refer earlier shape encod featur geometri face textur normal imag warp origin face imag averag align shape shape textur space reduc pca reduc shape textur featur integr normal procedur form augment featur reduct constrain enhanc maintain proper balanc spectral energi pca adequ discrimin eigenvalu scatter matrix includ small trail valu reduct denomin independ compon analysi emerg recent power solut problem blind sourc seek linear transform express set random variabl linear combin statist independ sourc variabl search criterion involv minim mutual inform express function high order cumul pca consid order moment uncorrel ica power data account higher order statist identifi independ sourc compon linear mixtur pca eigenfac probabilist reason model pca optim signal criterion offer reduct larg set correl variabl smaller number uncorrel compon deriv orthogon project basi directli lead reduct possibl featur select pca commonli appli repres recogn human face recognit method eigenfac method eigenfac method defin face space span eigenvector lead eigenvalu face covari matrix featur deriv eigenfac repres origin face imag deriv project matrix consist eigenfac pca deriv eigenfac base observ variat train enjoi good gener abil imag reconstruct test imag train pca optim signal criterion pca inspir featur necessarili provid good discrimin solut integr optim optim classif criterion integr lead prm method prm method appli pca reduct goal signal util scatter estim covari matrix class order estim condit pdf appli map rule classif map rule optim class separ error improv pca base method appli criteria relat error linear discrimin analysi fisherfac enhanc fisher model similar fisher linear discrimin commonli criterion pattern recognit recent face recognit lda deriv project basi separ class compact class close repres base method fisherfac method fisherfac method specifi face space combin pca rs pca project matrix similar eq project deriv maxim ratio scatter transform space featur defin unlik differenti scatter deriv class specif featur space discrimin featur superior eigenfac encod express featur space face train imag repres rang face imag perform differ mdf implement high pca lead overfit overfit occur small train sampl size typic face recognit remedi drawback artifici gener addit data sampl size analyz reason overfit model improv gener led method method address rang princip compon affect reason overfit avoid specif model improv gener balanc spectral energi criterion suffici eigenvalu spectral requir good gener requir select pca eigenvalu account spectral energi raw eigenvalu scatter matrix reduc pca subspac small rang princip compon eigenvalu spectrum prm util total princip compon shape textur featur geometri shape set control point underscor import face featur bridg contour face shape train face imag align respect transform rotat shape defin averag align shape textur deriv warp origin face imag shape constraint shape textur featur integr normal procedur form augment featur augment featur encod shape textur inform defin lower shape textur featur deriv pca constraint enhanc gener perform comparison comput shape imag mask imag shape imag undergo align procedur shape preserv intens inform outlin face mask imag deriv center ey control point put mask compar studi show augment shape textur featur carri discrimin inform order shape mask shape imag show shape textur base enhanc fisher classifi model perform eigenfac method distanc mahalanobi distanc classifi common covari matrix class pool covari matrix enhanc independ compon analysi ica compon restrict order statist result reduc statist depend produc code subsequ pattern discrimin associ recal role ica plai seek featur code analogu goal sensori system detect redund featur form redund reduc independ featur object repres ica random vector factor covari diagon real posit transform origin random vector compon random vector independ independ deriv ica transform comon develop algorithm consist normal compar assess ica sensit dimens space carri led develop method result sensit analysi enhanc ica carri compress whiten pca space small trail eigenvalu discard experi total princip compon reason aspect whiten eigenvalu covari matrix denomin small trail eigenvalu encod consequ whiten uncompress imag fit mislead variat gener poorli data assess perform combin discrimin criteria bayesian framework discrimin analysi shown ica carri properli compress whiten perform eigenfac fisherfac method face perform deterior augment addit criteria map rule classifi reason find mahalanobi distanc map classifi duplic extent whiten counter independ criterion exploratori pursuit problem address learn face larg popul evolut drive forc dimens face evolv enhanc driven classif factor refer interplai cost densiti face space tradeoff faith face reconstruct expect classif accuraci face hand qualiti face space driven encount learn face space characterist coevolut activ learn challeng train sampl boost extra weight assess fit face space fundament find proper mix cognit perceptu process deriv optim project basi face address evolutionari pursuit analog pursuit method ep seek learn optim face space dual data compress pattern classif challeng ep successfulli met limit popul characterist function approxim statist learn theori ep gener abil face recogn result handl minim empir risk encount train narrow predict risk reduc risk futur test unseen probe imag predict penalti factor regular measur gener abil object driven regular index class separ ep implement strategi characterist genet algorithm search space solut order determin optim project basi ep start project origin imag lower whiten pca space direct random rotat basi vector space search ga evolut driven fit function defin term perform accuraci class separ evolutionari comput repres emerg methodolog motiv natur select evolut place maintain popul candid compet limit resourc term place offspr futur gener competit implement select mechan dynam chang popul due birth death individu select mechan evalu fit individu base fit criteria popul evolv genet oper reflect concept inherit resembl fit function lack analyt form suitabl gradient descent comput involv prohibit case solut space larg search altern stochast search method nonlinear optim variabl select uniqu explor farther exist exploit variat fit abil evolutionari comput guid fit valu made analyz complex search space learn face space requir ep search larg number subset rotat ax properli whiten pca space rotat angl string axi indic ax chosen constitut form search space size power length larg search exhaust number choic ax subset angl rotat evolv genet algorithm ga work maintain popul candid solut individu power genet algorithm li abil highli effici inform larg number individu search underli ga breadth depth explor exploit balanc observ perform individu evolv alloc reproduct occurr averag individu effect popul averag fit evolut driven fit function formul encompass paramet number ax angel rotat defin chromosom subject term record perform empir term gener predict posit constant import term rel accuraci extent learn success gener index indic expect fit futur trial combin term proper weight factor ga evolv balanc result good recognit perform gener abil fit function similar form cost function regular theori cost function code cost function method exploit regular paramet control term solut close data term indic regular cost function method posit constant achiev balanc term inform preserv term assess deriv code applic ep method learn face space face recognit data consist feret subset imag subject frontal imag subject varieti subset subject imag acquir low remain subject face imag acquir photo session acquir imag refer duplic imag subject train remain imag test train set includ imag test set imag imag crop size ey coordin manual detect background uniform face imag mask reason mask face imag process perform visual system judg ident recognit mask implement delet face effect delet recognit perform discuss recent paper face recognit method avoid problem shape outlin encod number control point subsequ align normal start pca ep method deriv vector optim basi learn face space note pca basi vector natur case project basi deriv ep due rotat involv evolutionari process natur order characterist princip compon reflect aspect pca relationship spectral decomposit princip compon encod global imag analog compon procedur gear primarili recognit gener worth point pca deriv orthogon basi ep basi vector orthogon orthogon constraint optim signal requir pattern recognit great function biolog sensori system recognit ep face space learn basi yield test unseen face unavail compar favor popular face recognit eigenfac fisherfac method assess statist implement mcnemar test determin strong statist evid ep method improv face recognit perform eigenfac fisherfac method base statist test found ep method significantli improv face recognit perform eigenfac fisherfac paper review recent develop face classif analog exploratori pursuit seek interest project project high advoc evolutionari pursuit evolutionari framework object retriev shown applic learn face deriv system coordin ep type statist method updat dictionari choic simultan neural network criterion ep exploit similar form cost function regular theori cost function code criterion underscor recognit perform gener abil deriv ep basi pursuit method develop chen criterion base signal approxim minim norm coeffici interest note analog statist learn theori gener index encompass criterion conceptu similar capac classifi prevent overfit ep methodolog function approxim pattern classif problem import dimens explor abil face space accommod invari facial express invari aspect address develop face space suitabl face index retriev real possibl face space face classif semant load attribut relat determin characterist face space relev question address futur extent form motion inform augment benefici face space classif deriv face provid understand face space metaphor defin typic densiti correl space interplai complex train perform paramount import pattern recognit address ep approach concept format categor interest face ep correspond model select problem term expect number project ax specif characterist model select consid robust mixtur decomposit function approxim larg search ep candid choic function approxim deriv local kernel approxim kernel method recent shown recent support vector machin find kernel method basi pursuit rel merit subject futur research refer editor categor data analysi john wilei barlow learn neural beal categor effect percept face kriegman eigenfac recognit class specif linear project ieee tran pattern analysi machin bell sejnowski approach blind separ blind deconvolut neural vector face imag interleav shape textur comput ai memo artifici intellig hancock pixel model familiar face recognit cognit burton typic understand metaphor quarterli journal chen basi pursuit technic depart stanford comon independ compon signal taylor activ model proc european confer comput june kato repres face automat ieee tran pattern analysi machin comput understand face bruce process imag face ablex publish view analog striat cortex comput page mit edelman learn extract mechan perceptu learn academ taylor face recognit activ model proc european confer comput june est psycholog scienc psycholog chellappa discrimin analysi recognit human face imag opt soc form local learn biol girosi approxim support vector machin neural smith princip compon natur imag haykin neural network foundat macmillan colleg publish kirbi sirovich applic procedur human face ieee tran pattern analysi machin squir learn parallel brain system item memori categori knowledg coot automat interpret code face imag flexibl model ieee tran pattern analysi machin liu wechsler enhanc fisher linear discrimin model face recognit proc intern confer pattern august liu wechsler face recognit evolutionari pursuit proc european confer comput june liu wechsler probabilist reason model face recognit proc ieee comput societi confer comput vision pattern santa june liu wechsler compar assess independ compon analysi face recognit proc intern confer biometr person washington march liu wechsler face recognit shape textur proc ieee comput societi confer comput vision pattern fort june liu wechsler robust code scheme index retriev larg face ieee tran imag field emerg recept field properti learn code natur imag face higher dimens face space journal optic societi america local featur gener statist theori object comput neural phillip match pursuit filter appli face identif ieee tran imag koch comput vision regular theori code spatial variat face simpl test model vision sinha poggio face swet weng discrimin imag retriev ieee tran pattern analysi machin turk pentland eigenfac recognit journal cognit unifi account effect race face recognit quarterli journal vapnik natur statist learn theori editor face theori applic
DB/721 3 express modal languag holger sturm frank wolter institut fur universitat leipzig germani introduct wai languag sound respect everydai consid insight area appli logic talk domain formal option search adequ balanc aspect express power languag strong express express viewpoint comput complex languag simpl languag valid formula form set formal languag offer express thing fairli natur point appli formula translat natur languag sentenc choic situat kind modal languag pure basic modal proposit languag languag obtain boolean languag ad shown hintikka ml interpret ordinari relat structur regard rival languag suitabl talk kind languag ml form fragment languag ml express languag proper strong express power speak favor languag strong express power high complex reflect fact contrast logic undecid count ml natur express modal statement mean modal oper quantif world philosoph corrupt translat harmless phrase world express power languag understood usual class structur semant express power measur properti structur express altern measur express power consid sentenc fragment natur languag translat gener remark modal languag counterpart affair order understand express power modal languag compar counterpart case proposit logic initi import line label theori identifi pillar theori modal logic express power modal proposit languag investig detail level model level frame relationship express languag pass situat modal predic logic complet relat modal languag counterpart time languag variabl individu world wait explor specul reason omiss observ number result proof easili transfer proposit case exist gener agreement formul semant notion involv semant mutual interact offer great number altern overview possibilist interpret constant vari rigid recent year research modal predic logic investig gener semant express notwithstand paper carri convict high time chang situat fact modal languag occur philosoph disciplin import technic instrument promin theori intend tool explic depend relat theori famili weaker ordinari notion introduc fruitfulli appli philosophi scienc mind make nice point view fact notion formul type modal pure languag satisfi comparison easili found area philosophi linguist comput scienc worthwhil make start investig detail paper prove result express power standard modal languag compar counterpart restrict attent case modal languag interpret decid deal constant domain model domain world worth method appli logic base vari domain model describ result paper add exist work author result relat fine number preserv result modal formula relev philosoph distinct semant de formula investig condit de formula elimin extens shown remark portion classic model theori transfer domain modal logic close relat work discuss number formula languag express modal languag exampl provid insight express power gener result miss remark appli work express power tempor proposit logic investig framework tempor prove tempor proposit interpret ration natur number class finit discret linear properli express languag result prove show formula express tempor languag mention proof main result inspir altern proof result found hodkinson concret paper introduc modal languag languag shown faithfulli translat provid section semant formula modal translat term preserv result proof obtain standard method section defin class formula show closur respect world domain member class formula subformula form free class formula deriv formula page regard linguist formul predic properti fact predic strongli set fp obtain formula form set formula close formula form turn quantifi restrict monad main result section gener criterion formula form result cover formula similar investig make interest criterion form effect procedur paper conclud suggest futur research unlik consid outer domain domain languag sort quantifi account distinct outer quantifi make context semant base vari domain model domain approach domain variabl rang object respect actual outer domain approach rang domain modal languag equip exist languag outer quantifi express languag properti list express modal languag outer domain quantifi concept introduc prove tempor predic languag oper express complet fragment languag rel flow time natur modal logic modal alphabet oe consist set fr predic equal symbol countabl set individu boolean quantifi modal oper assum predic symbol posit natur ariti set modal formula defin ffl atom formula predic symbol atom atom formula ffl ffl formula formula ffl paper number abbrevi defin standard manner paper modal formula interpret defin tripl disjoint set function predic symbol modal point kripk model access relat coincid relat drop note constant domain model account assign function set variabl truth modal formula defin respect point point model pair world model modal formula ff true point model assign abbrevi defin ffl iff ffl iff ffl ffl iff ffl iff ffl iff assign differ respect ffl iff model clear write logic modal languag base alphabet defin sort firstord languag sl domain world base ffl infinit set individu variabl domain ffl infinit set individu variabl world ffl predic symbol sort variabl sort domain call domain variabl sort world call world variabl formula sl defin ffl formula variabl domain ffl formula variabl world ffl predic symbol sort domain world domain atom formula ffl world domain formula tripl disjoint function map pair predic symbol ariti subset assign function associ domain variabl element associ world variabl world truth relat defin induct ffl iff ha ffl iff assign differ ffl iff assign differ standard boolean assign variabl free write wm understood formula set formula assign set formula ai bi claim observ fail syntact level obviou variabl restrict influenc express power languag modal languag languag sl straightforward predic symbol modal languag predic symbol languag world variabl defin translat sl mean translat explain definit assign assign ai bi write ai note ai exist uniqu bi ai bi lemma ai bi ff world wi iff ff proof easi induct ff neglect harmless differ kind call model regard sl languag talk thing variabl sort world sl consist formula sl variabl sort world observ ff formula ff belong sl formula sl form ff ff world variabl sl modal predic languag express power fix term definit formula sl formula ff iff exist variabl sort world ff formula sl iff exist formula remain part paper explor field formula semant definit model partial isomorph defin biject function ffl domain finit subset element uniqu world design ffl rang finit subset ffl iff ffl predic symbol hd iff definit potenti abbrevi iff set partial ig ig definit formula sl arbitrarili domain variabl free preserv potenti satisfi set partial isomorph fulfil requir state definit make lemma easi prove formula modal translat preserv potenti obtain model potenti respect sl respect proof main result section theorem preserv potenti modal fragment sl theorem formula free arbitrarili domain world variabl modal formula ff ff preserv potenti proof direct prove routin induct proof direct fairli standard content sketch formula preserv potenti defin ff suffici prove model assign compact argument find model assign pair ai bi sl modal formula ff ff ff note set modal translat close elementari extens hm ai hn bi sl show potenti defin set partial isomorph prove meet condit state definit put biject function satisfi definit modal formula dm ff dm ff set partial isomorph remain prove satisfi requir definit remain part proof omit subscript fd dm individu defin ff dm ff ff ff dm ff dm note ff ff definit ff mean find individu ff set finit satisfi util fact find individu defin ig requir condit shown similar argument leav reader shown potenti complet proof argu elementari extens defin member ng shown potenti obtain assumpt infer formula definit formula sl formula iff subformula form free world variabl proof assum reader familiar basic notion result model theori inform note formula world variabl standard translat modal formula formula world variabl bit result show equal rewritten theorem formula equal world variabl variabl sort world occur free proof ff proof theorem consist step step show formula equal world exist formula boolean combin formula variabl variabl claim prove induct complex basic case px clear boolean case hold induct hypothesi assum boolean combin loss gener assum disjunct normal mean disjunct form set uniqu free world variabl world variabl set free occur boolean combin properti uniqu world variabl translat modal modal formula fi fi rest clear argument prove case argu similar case induct hypothesi boolean combin variabl variabl assum disjunct normal form restrict attent build set consist conjunct remain free world variabl appli argument similar find modal formula fi case prove analog complet proof claim part proof show boolean combin modal formula fl boolean combin restrict assum fl conjunct normal form fl fl disjunct ffi member easi ffi free world variabl ffi ffi modal formula fi ffi infer ffi ffi vn easili shown argument appli fl set modal formula close shown start formula fl modal formula complet proof claim theorem straightforward consequ claim note formul restrict formula equal world variabl formula relat world defin section prove formula defin result formula section start explor larg field simplest class form violat condit occur free obtain effect criterion condit simpl syntact form fix finit set fp relat symbol place occupi domain variabl world variabl state prove main result section preliminari remark definit world variabl domain variabl design set formula fp xv lg set formula denot set boolean combin formula clear formula denot set cardin formula theorem condit proof implic easi formula variabl sort world replac direct notat fv set variabl sort world fix variabl sort domain type set formula xv xv model world individu design realiz model clear drop upper index prove implic contraposit assum follow model world individu put member disjunct normal form restrict assum fw world suffici work restrict attent interest situat world obtain analog claim easili infer model world individu realiz falsifi realiz falsifi omit superscript element pair realiz realiz proof make assumpt formula satisfi defin model world individu domain individu hold easi pair satisfi hold satisfi lemma plai import role main part proof assum model satisfi lemma assum exist realiz true assign proof lemma prove claim case similar left reader satisfi contradict fact model ffl ffl realiz assum defin model put ffl ffl ffl relat symbol ffl ffl realiz ffl realiz realiz lemma prove assum lemma denot set individu satisfi readi prove claim theorem order construct model potenti definit theorem shown denot disjoint countabl infinit set put equal symbol assum domain chosen countabl infinit equal achiev ad individu domain reason assum type realiz infinit time biject function set defin union set ffl ffl set pair ii exist finit set xv xv defin model case set fw defin wm set satisfi pr pr xv pr pr pr pr xv pr pr xv pr pr xv xv satisfi condit pr xv satisfi model set fw defin wm set satisfi condit satisfi pr satisfi pr pr xv complet thing show hold easi world wm coincid check satisfi easi wm member set distinguish case pr pr definit hold wm realiz realiz impli wm realiz infer wm prove case pr pr argu show potenti defin set partial isomorph prove meet requir condit definit close proof theorem pair put defin set partial isomorph wm pr pr set satisfi condit defin set ig member prove wm pr case argument definit infer realiz member distinguish case pr rang appli infinit set ig case pr realiz rang exist type assum realiz infinit time close proof condit prove similar argument wm find assum pr wm satisfi type pair ii satisfi wm wm set ensur member proof similar proof shown potenti result complet proof theorem theorem effect procedur decid proof suffic show algorithm construct formula decid exist algorithm follow finit model properti set satisfi claim formula construct quantifi satisfi satisfi model jw jdj exist model jw jdj prove part part similar left reader pick defin relat put denot class gener put fw defin put readili check claim prove base result left reader construct requir algorithm outlook paper start explor class formula result interest regard start point hope initi research close list open ffl theorem gener formula form ffl theorem gener formula form predic arbitrari ffl result gener modal predic logic neg result defin inherit logic weaker observ class model logic modal logic formula express ffl investig languag express power modal languag interest candid extens obtain ad nomin differ oper languag ffl explor detail relev defin result obtain paper theori refer van den bussch tempor connect versu explicit timestamp tempor queri languag clifford recent advanc tempor page nomin logic notr dame journal formal ka bowen model theori modal logic av mv zakharyaschev modal logic clarendon cc chang hj model theori mj cresswel note de modal de rijk modal logic inequ journal symbol fine model theori modal part de distinct journal philosoph fine model theori modal part elimin de modal journal philosoph fine model theori modal part exist predic journal philosoph forb languag possibl basil jw quantif modal logic gabbai handbook philosoph vol page incomplet result kripk semant journal symbol express complet modal languag journal philosoph hode theorem express limit modal languag journal philosoph zakharyaschev decid fragment tempor logic annal pure appli ge hugh mj cresswel introduct modal logic elimin de formula journal philosoph kamp formal properti kim mind cambridg lewi plural world basil bp varieti page cambridg great editor essai cambridg dp vb maxim semant modal predic logic annal pure appli van benthem correspond theori gabbai handbook philosoph vol page
ML/722 6 transact neural vol septemb web mine soft comput state art futur direct student student ieee paper summar characterist web basic compon web mine current state art reason web separ field data explain limit exist web mine method tool soft comput fuzzi logic artifici neural network genet algorithm rough set highlight survei exist literatur web provid commerci system prospect area web mine applic soft comput attent outlin justif scope futur research develop web system explain extens bibliographi provid index neural network data fuzzi logic genet algorithm inform retriev knowledg pattern rough set search engin introduct wit growth inform world wide web web browser provid easi access myriad sourc text multimedia data page index search find desir inform easi task resourc prompt develop automat mine techniqu give rise term proce web obviat human incorpor emb artifici intellig web tool necess creat intellig system effect mine knowledg internet web local draw attent research domain inform knowledg machin artifici intellig problem develop autom tool order evalu user desir inform heterogen web data solv handl characterist overcom limit exist manuscript receiv juli januari pal mitra machin intellig indian statist india depart comput institut india publish item identifi ieee soft comput good research area combin term web soft comput consortium methodolog work synergist form flexibl inform process capabl handl ambigu situat aim exploit toler approxim partial truth order achiev close resembl make guid principl method comput lead accept solut low cost seek approxim solut formul problem princip soft comput tool includ fuzzi artifici neural network genet algorithm rough set theori fuzzi set provid natur framework process deal uncertainti neural network wide model complex provid learn gener capabl ga effici search optim tool granular comput knowledg discoveri object articl provid outlin web give perspect research commun potenti appli soft comput techniqu compon review exist lai emphasi enhanc tool soft comput framework relev fuzzi logic illustr exampl mention commerci system broad guidelin futur web mine outlin note soft comput field paper junctur evid rest paper organ section ii deal characterist web compon type web mine limit exist web mine method discuss section iii section iv introduct soft comput relev section vi fl nn phase web mine prospect area applic section vii viii give outlin applic ga web mine section ix scope futur research area soft web mine ieee transact neural vol septemb fig web mine subtask ii web mine web vast collect complet uncontrol heterogen document issu due make web fertil area data mine research huge amount inform onlin data mine refer nontrivi process identifi potenti ultim understand pattern data web mine broadli defin discoveri analysi inform www web mine data collect server client proxi obtain depend locat type collect data differ extrem variat content meta make techniqu task web mine wide vari characterist web data heterogen time high web mine basic deal mine larg inform base characterist interact human interfac kei compon web applic issu concern handl context sensit summar person learn web consid applic data warrant separ field characterist data human relat issu web mine compon methodolog web mine view consist shown fig etzioni task survei exist task inform retriev resourc discoveri ir deal automat retriev relev time ensur nonrelev fetch ir process includ document search document tabl show techniqu author document ir web content mine explain detail section semistructur document index collect term pointer place inform document found index web page facilit retriev complex challeng problem compar classic straightforward techniqu suffic enorm number page frequent updat make index techniqu seemingli imposs approach index document web human manual automat intellig index search engin program written queri retriev inform store html page free text web popular index creat web robot altavista webcrawl scan million web document store index word document dozen index activ uniqu interfac cover fraction web metacrawl present level inform food chain provid singl unifi interfac web document search submit queri index collat result prune tackl web metacrawl mine searchabl index futur resourc discoveri system make automat text categor technolog classifi web document categori technolog facilit automat construct web directori yahoo discov document fit yahoo categori technolog filter result queri searchabl index queri product review discoveri system document word found queri searchabl index identifi subset correspond product review agent combin structur base organ hypertext document content base ir techniqu number ir agent characterist open hypertext web document automat categor bookmark organ combin hierarch cluster techniqu user interact organ collect web document base conceptu inform research ir includ develop user data filter detail survei ir web inform document retriev challeng automat extract knowledg requir inform human interact inform extract task identifi specif fragment singl document constitut core semant content major method involv write wrapper map document data model inform integr system oper interpret site knowledg sourc extract inform pal web mine soft comput framework system process site document extract relev text fragment librari wrapper wrapper system custom internet site method hypertext page approach set standard question reduc identifi text fragment answer specif question slot fill text fragment call aim extract knowledg retriev document capit document structur ir expert view document text bag word pai attent structur document scalabl biggest challeng feasibl build system scalabl size dynam web system extract specif site focu defin area give survei system aim dynam extract inform unfamiliar resourc intellig web agent develop search relev inform characterist domain possibl user organ interpret discov inform agent harvest inform manifold occam parasit reli prespecifi domain specif inform type model inform sourc retriev interpret document harvest system reli semistructur document improv abil extract inform find author titl inform latex document strip posit inform postscript file harvest discov document learn model document structur extract answer frequent question faq file web shopbot internet learn agent attempt interact learn structur unfamiliar inform sourc shopbot retriev product inform varieti vendor site gener inform product domain learn model inform sourc translat concept hierarchi ila learn extract inform unfamiliar resourc queri familiar object match return output knowledg queri object built carnegi mellon extract email research tabl ir gener techniqu algorithm page faculti member comput scienc depart robust preprocess system requir order extract kind knowledg medium size user request web varieti file execut cgi access server log entri redund irrelev mine task remov preprocess techniqu latent semant index seek transform origin document vector lower space analyz correl structur term document collect similar document share term categori preprocess reduc input featur size stem word inform root inform pattern recognit machin learn techniqu extract inform machin learn deploi learn interest web major obstacl learn web label data abund web unlabel data mine techniqu requir input label posit neg exampl respect concept larg set web page label posit neg exampl concept easi design classifi predict unknown web page home page web page unlabel techniqu uncertainti sampl reduc amount unlabel data elimin label problem approach solv problem base fact web link collect interact medium input attempt locat user label answer correct incorrect cluster techniqu requir label input appli successfulli larg collect document web offer fertil ground document cluster research tabl show task perform method gener web content mine associ rule mine integr part phase associ rule express type set item express transact probabl rule confid defin ieee transact neural vol septemb percentag transact addit compar transact idea mine associ rule origin data rule custom bui product bui product probabl found machin process document led develop concept inspir fact inform web design human deriv mean structur data evid robot web leav ai problem train machin behav semant web develop languag express inform machin process form analysi problem presum suffici data potenti inform extract analyz human plai import role inform knowledg discoveri process web web interact medium import valid interpret mine pattern place phase pattern analyst tool system interpret pattern onlin analyt process techniqu data cube simplifi analysi usag statist sever access log system structur queri languag queri mechan queri discov knowledg form associ rule sequenti cohen natur knowledg deriv web base phase web mine view data mine techniqu automat extract evalu inform knowledg discoveri web document servic evalu includ web mine categori web mine web structur mine web usag mine describ deal discoveri inform web mention tabl describ kind document task perform web content encompass broad rang data hyperlink data research present center text hypertext content web text data unstructur data free semistructur data fulli structur data tabl mine term knowledg discoveri text text data mine text mine text mine subject full coverag scope fig googl architectur survei refer mine symbol knowledg extract refer knowledg discoveri method extract analyz word attribut concept extract content text document present approach suggest restructur document content exploit machin techniqu lexicon content interpret hypertext mine involv mine semistructur html page text hypertext learn classif plai kei newsgroup maintain web directori good tutori hypertext refer due larg number servic digit mail list mine servic gain import work mine digit librari found note web content mine ir separ claim ir web instanc associ intellig ir strategi directli mine content document page content improv content search tool search engin result task search engin close fig architectur popular googl search engin approach approach approach web mine involv develop sophist ai system act autonom semi autonom behalf pal web mine soft comput framework fig web structur mine discov organ inform web mine approach organ intellig search inform person web agent approach techniqu organ semistructur data web structur collect queri mechan data mine techniqu analyz levi al discuss gener intellig internet system respect user analysi remot inform inform manag pertain mine structur hyperlink web document structur unlik pertain intra document structur repres graph link site site fig show sampl link structur level site reveal inform inform document link point document popular link document rich varieti topic cover document highlight hit algorithm analog bibliograph citat paper cite import link topolog web exploit develop notion hyper link commun analysi show commun view core central authorit page link hub exhibit natur type hierarch topic gener infer directli pattern linkag show notion commun surprisingli clear perspect view seemingli develop web infrastructur page rank clever method advantag inform convei link find pertin web page crawl enhanc field hypertext resourc discoveri system goal crawler select seek page relev predefin set topic topic exemplari document collect index access web document answer ad hoc crawler analyz crawl fig architectur boundari find link relev avoid irrelev region web lead save hardwar network crawl content mine structur mine util real primari data usag mine mine secondari data gener interact web web usag data includ data web server access proxi server browser user registr user session user bookmark data gener interact user web work user user access mine navig path heavili compani track custom behavior site plai kei role person hour satisfi user tool extrem learn user access path pattern individu web site learn access list user similar interest collabor recommend system person exploit similar dissimilar prefer algorithm suggest specif cater associ rule mine collabor recommend system framework appli machin learn algorithm featur reduct singular decomposit collabor recommend featur reduct techniqu reduc dimens rate data nn appli simplifi data make model collabor recommend discoveri pattern usag data suffici perform person task deriv good qualiti user pattern suggest evalu techniqu base cluster user transact cluster page order discov overlap aggreg profil effect recommend system person framework web mine pattern discoveri www transact fig show architectur bring integr registr data transact pattern discoveri techniqu appli discov associ sequenti pattern classif rule ieee transact neural vol septemb iii limit exist web mine method web creat challeng compon task web mine amount inform web chang rapidli control exist system find difficulti handl newli emerg problem gener analysi inform retriev difficulti encount task aim ir system estim relev document inform express mean queri hard complex task exist ir system find difficult handl due inher uncertainti relat user queri exist ir system offer simpl model privileg effici accuraci queri process search import part ir simpl blind keyword match account context relev queri respect import effici machin learn current search engin deduct capabl satisfactori queri comput scienc graduat produc european soft current queri process techniqu follow principl hard reject determin relev retriev document respect queri correct properti document crisp page page rank import human find difficult scan entir list document return search engin queri sift desir document page rank respect user queri definit formula reflect relev document scheme determin page rank incorpor weight paramet hit weight reput link carri higher weight link popular rank rel user ir system tailor retriev document set histori natur exist system limit problem definit gener methodolog effort direct made cluster log similar metric cluster principl deriv clear ir system find difficulti deal problem heterogen web document ture web data document return search engin unavail user queri index time satisfactori scale etzioni studi effect data size result obtain search engin current ir system index document present web lead problem heterogen natur web document demand separ mine method type data algorithm tool base techniqu wrapper procedur extract inform web resourc biggest limit wrapper system custom site applic sourc document design peopl site provid machin readabl specif format convent ad hoc format rare relev harvest faq discuss section kei limit system focu web document ignor servic perform custom relationship manag reli prespecifi descript fix class web document gener difficulti ir commun explor document cluster altern method organ retriev cluster deploi major search engin googl effect search engin support simpl cluster problem effici cluster natur web data mention section data high overlap exist convent cluster techniqu find difficulti handl characterist web log data user outlier includ vagu data due reason inher web log outlier small percentag user follow easili promin web log server data user end path accord interest inform web distribut spot outlier difficult cluster data associ rule associ rule current techniqu appropri mine linguist associ rule human understand algorithm convert linguist rule numer suffer problem reject sharp boundari interv intuit respect human percept interv method classifi person pal web mine soft comput framework young ag greater year correspond human percept consid boundari analysi biggest problem face step point view knowledg discoveri model discov knowledg inform web challeng output knowledg mine algorithm suitabl direct human interpret pattern discov mathemat form iv soft comput relev soft comput consortium methodolog work form flexibl inform process capabl handl ambigu situat aim exploit toler approxim partial truth order achiev close resembl make foundat concept design high machin iq form basi futur gener comput system ga princip fl algorithm deal uncertainti vagu rs handl uncertainti limit discern ann machineri learn ga optim search relev soft comput pattern recognit imag process extens establish literatur applic soft comput data mine problem drawn attent research recent review regard fl handl issu relat approxim human interact understand pattern mix media inform nn model highli nonlinear gener learn rule pattern discoveri ga predict effici adapt evolutionari optim complex object function dynam environ rs theori obtain approxim descript object granular term core attribut algorithm extract domain knowledg form logic rule combin tool made soft comput integr visibl mention comput theori percept explain recent zadeh basic theori perform task drive car cook summar dai dai life comput natur web inher good candid mine soft comput framework human interact kei compon web mention section issu approxim summar person learn import soft comput paradigm provid effect solut realiz drawn attent soft comput commun develop web system parallel convent incept discuss applic soft comput tool fl web mine applic web mine task fall ir gener attempt commerci system prospect area attent outlin inform retriev yager describ framework formul linguist hierarch queri describ ir languag enabl user interrelationship desir attribut document sought linguist quantifi exampl linguist quantifi includ linguist express quantifi repres fuzzi subset proport belong satisfi concept quantifi deal problem automat index retriev document user queri includ actual word occur document retriev fuzzi toler similar relat notion defin introduct hierarch categori word document fuzzi set theori extend boolean inform discuss methodolog semistructur document retriev model concept gradual document user queri document repres fuzzi binari relat document set archiv document set index membership function dynam function express term section document base semant section section text author singl occur term make fulli ieee transact neural vol septemb boolean function section textual comput function normal term frequenc document frequenc term normal term frequenc defin number occurr term section document normal paramet depend length obtain term comput aggreg scheme order weight averag paramet determin user rel weight section queri repres term weight queri evalu function aggreg oper result queri evalu repres fuzzi subset archiv bring light fuzzi boolean ir model flexibl repres document content inform gener etzioni list kei requir web document cluster measur browsabl abil handl overlap snippet speed increment characterist fuzzi fuzzi trim cluster web document snippet fuzzi cluster techniqu web log data mine algorithm call competit relat data cluster user session consid structur site url comput similar user session approach requir definit comput session form similar fuzzi relat prior cluster data web session involv access method transmiss protocol correl user session handl fuzzi set approach techniqu cluster web data includ cluster associ rule algorithm mine associ rule fl techniqu suggest deal problem mine fuzzi associ rule understand human quantit categor attribut associ rule attribut fuzzi mine develop learn algorithm creat mix fuzzi rule involv categor numer attribut commerci system list commerci system characterist search engin base complet fl consid entir phrase individu word match paramet chosen dn fl find closest dn entri type url mistak type system suggest close url displai suitabl match queri unlik exist search engin displai exact match queri finder simpl queri engin sql finder score modul design data type car ignor entri give lower score search engin element score score modul fuzzi infer data environ build smart intellig java applet softwar packag rich set function build fl expert autom adapt softwar convert applic program fuzzi infer languag assembl code prospect area applic search scope appli fl improv web search point view add deduct capabl search fl necess probabl approach difficult achiev due million web retriev document expand domain retriev document cluster filter client concept linguist variabl membership function keyword match page rank close hit document comput variabl repres distanc hit pal web mine soft comput framework document queri similarli fuzzi variabl attach url referenc calcul page rank fig show ir match paramet subject queri found fuzzi set popular googl search consid highli effect exist schemat diagram technolog googl explain lexicon word queri match queri quantifi blindli page base smoother transit base membership option fuzzi queri queri text includ linguist variabl provid relev document give grade membership result greater weight document queri word closer similar question distanc url request user common interest request similar handl fuzzi set theoret framework answer question crisp area fl appli includ match recognit content inform aggreg custom profil vi nn learn system web mine nn formal defin massiv parallel interconnect network simpl process element intend interact object real world biolog system nn design network connect strength pair neuron node statu updat rule object function defin repres complet statu network set minima correspond set stabl state network system reput enjoi major gener adapt speed due massiv parallel robust capabl model nonlinear boundari nn task cluster web person summar exist literatur line prospect area attent discuss fig map advic network ir ann provid conveni method knowledg ir applic learn abil achiev goal implement adapt system shavlik suggest wisconsin adapt web assist nn reinforc network learn form advic user system nn knowledg base encod initi knowledg user refin agent perform initi util prior knowledg prior knowledg correct refin learn inform deriv extract rule order map larg size web page concept slide window page word html tag act window breaker gener train exampl act tune agent rule extract action type show strength determin weight link layer nn fig show map rule show page part slide window give true weight sum exce bia produc activ sigmoid hidden unit addit link ad hidden unit subsequ chen al implement search method java base nn genet search internet ir base document retriev spread activ process queri optim relev backpropag model consist input repres user inform term neuron ieee transact neural vol septemb document neuron output layer repres result queri evalu lim develop concept visual keyword abstract extract visual document soft comput techniqu visual keyword repres nn soft cluster center merkl rauber shown hierarch featur map repres content document archiv produc map document space system hierarch view underli data collect form atla model user easili region interest gener map orient hybrid web text mine system system learn fall relat learn learn group learn paramet hidden markov model extract inform wrapper induct techniqu combin adaboost algorithm call boost wrapper induct system outperform relat learner competit hmm view learn system web content refer tabl emerg field text mine appli method data mine exploratori data analysi analyz text collect convei inform user intuit manner visual displai provid power fast medium portrai inform larg collect text relationship text item commun natur spatial color websom map algorithm automat organ larg collect text document map displai map form document landscap similar document close point regular map grid landscap label automat identifi descript word convei properti area act landmark explor interact tool order landscap document collect perform search map organ map offer overview unknown document collect user familiar oneself domain map displai familiar visual frame refer convei properti unknown text item themat arrang static document landscap provid background dynam visual properti mathemat basic numer applic map recent book person person mean content search result tailor user interest habit nn learn user profil train data collect user system user profil highli nonlinear nn effect tool learn agent learn user profil bayesian classifi user profil determin user interest page made analyz html sourc requir page retriev avoid network user prefetch page access index page store local syskil webert learn profil make suggest page visit quickli html annot link page icon indic rate predict rate estim probabl user page note rate predict specif user reflect user rate page agent limit make suggest link follow singl page collect set link topic similar system assist user softwar librari built drummond prospect area applic person page mention section page rank import human find difficult scan entir list document return search engin queri page rank respect user queri desir document scan page case popular search engin googl comput rank page damp rank page page point number outgo link page note popular page incom rich inform content outgo care import factor user link match prefer establish link valid page interest user pal web mine soft comput framework fig neuro fuzzi ir system reflect comput page rank capabl ann exploit determin user prefer user prefer incorpor train user histori ann model nonlinear function learn good candid comput page organ nn filter invalid page dynam ann comput page rank combin paramet user prefer weight assign user refin network person interest factor fuzzi variabl variabl repres distanc hit document queri fuzzi variabl attach url referenc page unlik variabl consid crisp signifi import integr synergist ann fl paradigm comput page rank paragraph describ detail ir system schemat diagram ir system shown fig show total relev document combin respect respect total combin document reflect googl give gener page rank dot link repres area address exist algorithm mean comput respect respect mention relev fl comput match paramet handl subject queri approxim match model structur document handl effect framework fl literatur section address task relev respect literatur area scarc exist approach belong learn user cluster user homogen relev feedback ann learn nonlinear user profil previou histori reflect document interest paramet rich paramet reflect exist page rank system effici comput page rank open research issu nn cluster nn classifi web page user mode abil model complex nonlinear function exploit area nn build deduct capabl web mine system mention complex nonlinear function learn nn logic rule extract train network rule extract algorithm logic rule human interpret gener deduct vii ga web mine biolog inspir random search optim techniqu guid principl evolut natur genet adapt robust search produc optim larg amount implicit parallel ga execut iter set code solut call basic mutat payoff inform probabilist transit rule move iter literatur explain ga web mine poorer fl nn ga descript describ attempt search search find relev implement web document retriev genet learn import factor html tag method learn import tag train text set ga appli featur select text mine queri al develop queri reformul techniqu ga gener queri explor area document space determin optim yang al present evolutionari algorithm queri optim reweight document index queri kraft al appli genet program order improv weight boolean queri formul document gordon adopt ga deriv descript document document assign descript descript set index term genet oper relev judgement ieee transact neural vol septemb appli descript order determin term classif perform specif queri automat web page categor updat perform ga distribut gene express messi ga highli parallel evolutionari search special found suitabl distribut data mine applic includ web foundat laid principl black box search iter construct partial order perform select oper sampl space design base altern perspect evolutionari comput search framework role gene express flow genet inform research distribut data mine grow fast deal problem find pattern data environ data comput resourc distribut gupta suggest approach distribut data mine heterogen site point naiv approach distribut data analysi heterogen environ lead ambigu situat process inform local build global model situat case collect data common data process prospect area applic case adapt web site site automat improv organ present learn visitor access pattern problem index page synthesi index page page consist set link cover topic basic approach analyz web access log find group page occur user visit repres coher topic convert page ga predict user dynam evolut web page viii web mine abil granular comput rs theori concept approxim defin respect indiscern relat rs theori knowledg discoveri rule mine wide acknowledg current literatur applic web genet web mine task rs theori mention ir granular ir import applic inform rs inform granul refer homogen document set featur vari cluster approach effici document retriev task document cluster homogen group retriev document repres larg number featur word reduct perform cluster repres cluster set featur granular ir rs theori cluster repres featur set closer realiti word set import document class wong al suggest reduc term construct term hierarchi parallel document hierarchi handl heterogen rs hybrid system handl multimedia data inform fusion system retriev multimedia object document cluster mine web usag pattern variabl toler relat import regard addit area appli rough abil handl complex potenti tool mine multimedia object complex web semant structur multiag system collabor mine comput mean comput word plai import role natur languag queri formul rs theori approxim inform set relev document rough repres approxim lower approxim refer set relev upper approxim denot maxim set possibl relev dynam exploit develop effici ir system ix discuss web mine grow rapidli incept methodolog develop classic soft comput approach concurr potenti applic soft comput web paper time summar type web mine basic current state art limit exist web mine explain relev soft includ integr constitut illustr exampl diagram applic web mine task commerci system futur direct task detail pal web mine soft comput framework discuss aspect web soft comput plai kei present web content mine algorithm orient develop text mine framework web increasingli gain multimedia charact page web mine algorithm capabl handl multimedia data develop futur attempt direct queri form advanc search engin support visual queri research cbir soft comput framework potenti search engin perform search english text languag increasingli multilingu search engin ir system identifi perform themat provid summari automat recent develop soft comput effici system collabor mine automat interact site constitut recent research area net paradigm web queri mean obtain requir answer queri automat obtain distribut web resourc text sourc plan problem solv task agent web make travel plan appli soft comput task explor task relat internet system handl soft comput access task system prioriti devic bug failur distribut control electron product import applic area soft comput impart human interact portal interest model function price fuzzi set theori develop knowledg visual techniqu effect user interfac soft comput reason popular ai problem solv soft comput recent draw attent research solv web mine state mention made comput theori recent explain zadeh concept percept refer world wide gold commun vol pp mine research sig kdd vol pp juli inform food deploi softbot proc nat conf pp konopnicki queri system world wide proc vldb pp punch salient featur person web page comput network isdn vol pp cluster proc int www pp organ bookmark proc int www modern inform retriev kobayashi retriev acm comput vol pp ieee intel vol pp extract applic gener machin learn proc conf artifici intel pp harvest inform discoveri access proc int www conf distribut pp case base approach knowledg present work note aaai spring symposium inform gather heterogen distribut inform present aaai spring symposium inform gather heterogen distribut kwok gather proc nat conf mine structur inform present proc www scalabl comparison shop agent world wide univ dept comput tech rep tr etzioni learn understand inform proc int joint conf artifici pp extract symbol knowledg world wide proc nat conf ai pp homepag present proc www santa apr cluster base approach larg document proc int conf develop inform june pp assoc rule mine gener survei acm sigkdd vol pp juli search reliabl usag data proc int www santa pp pattern www dept comput univ tech rep mar learn proc int conf machin learn pp mladen grobelnik effici text categor present proc text mine workshop european conf machin learn mine symbol knowledg extract proc int conf knowledg discoveri data mine workshop text aug pp base knowledg discoveri text extract acm sigkdd vol pp juli ieee transact neural vol septemb mine acm sigkdd vol pp ieee comput issu digit vol brin anatomi larg scale hypertextu web search proc int www apr pp inform pattern discoveri world wide proc ieee int conf tool artifici pp nov levi internet artifici vol craven neural network data futur gener comput syst issu data vol pp discoveri ieee intel vol pp structur inform text classif proc advanc intel data anal int pp tour guid world wide proc int joint conf pp wrapper induct semistructur inform autonom agent multiag vol pp induct semistructur web base inform proc int conf kdd data pp inform extract rule semistructur free machin learn issu natur languag vol pp web commun link present uk conf van den approach web resourc present world wide web ruiz collabor recommend adapt associ rule mine present int workshop web mine pazzani collabor inform present proc int conf machin pp aggreg usag profil web present proc workshop web mine aug notion relev inform vol pp etzioni document feasibl proc annu int acm sigir pp neural soft commun vol pp soft comput imag process pal pattern method soft comput mine soft comput ieee tran neural vol pp jan direct comput theori ai vol pp framework linguist hierarch queri document soft comput inform techniqu crestani vol pp model intellig inform retriev fuzzi toler relat base hierarch soft comput inform techniqu crestani ed vol pp fuzzi set theori extend boolean inform soft comput inform techniqu crestani ed physica vol pp fuzzi rel algorithm applic document snippet proc ieee int conf fuzzi joshi fuzzi cluster method support web proc workshop data mine knowledg pp cluster high space hypergraph model univ tech rep fuzzi approach mine quantit associ univ dept comput tech rep mar symbol data proc june pp shavlik system build intellig agent learn retriev extract int user model user adapt interact issu user model intellig apr shavlik artifici neural artifici vol pp java search agent soft comput inform techniqu crestani ed vol pp present proc int conf text pp text retriev multimedia soft comput inform techniqu crestani ed vol pp merkl classif artifici neural soft comput inform techniqu crestani ed vol pp text mine hybrid proc brazilian symp neural pp freitag extract present proc workshop machin learn inform algorithm learn machin learn issu natur languag vol pp freitag wrapper proc pp organ map larg ieee tran neural network issu data vol pp june identifi interest web proc nat conf pp learn agent assist softwar univ tech rep mitra inferenc rule ieee tran neural vol pp jan crestani soft comput inform techniqu applic vol kim document retriev genet learn import factor html proc int workshop text web aug pp survei genet featur select mine proc comput pp genet approach inform soft comput inform techniqu crestani ed vol pp yang modif genet algorithm vector space dept univ pal web mine soft comput framework genet program build queri inform proc ieee symp genet algorithm document commun vol pp evolutionari approach automat web page categor web research vol lnc pp gene express messi genet proc ieee int conf pp data perspect distribut data advanc distribut parallel knowledg discoveri etzioni web ai present proc int joint conf artifici intel juli pp skowron rough set knowledg discoveri fuzzi modular rule gener ieee tran knowledg data publish fuzzi knowledg encod ieee tran neural vol pp inform soft comput inform techniqu crestani ed vol pp pal rough fuzzi trend framework retriev multimedia object base fuzzi descript soft comput inform techniqu crestani ed vol pp ho hierarch document cluster base toler rough set model present proc int conf knowledg discoveri data mine workshop text mine variabl rough set model web usag present proc conf web intel oct paradigm approxim int approxim vol pp sound retriev web web research vol lnc pp fast system world wide web pc web research vol lnc pp lee adapt search engin web mine proc int conf inform code pp soft comput case base pal receiv phd radio physic electron india receiv phd electr engin imperi professor distinguish scientist indian statist found head machin intellig unit colleg postdoctor visit nasa johnson space guest investig senior research hong kong polytechn hong visit professor serv distinguish visitor ieee comput societi region research interest includ pattern imag data soft neural genet fuzzi system ten book includ fuzzi mathemat approach pattern recognit pattern method soft comput research public dr pal fellow world academi intern associ pattern nation academi india receiv research nasa tech ieee transact neural network outstand paper nasa patent applic gold om foundat award scientif intern award republ sy indian nation scienc award engin technolog feder indian chamber commerc industri associ ieee transact neural network editor ieee ieee transact pattern analysi machin pattern recognit intern journal pattern recognit artifici appli inform fuzzi set fundamenta member execut advisori editori board ieee transact fuzzi intern journal imag intern journal approxim guest editor includ ieee comput receiv comput engin institut pursu ms comput scienc institut technolog allianc nation singapor paper written work project soft comput web mine research machin intellig indian statist india primari research interest relat data web mine mitra receiv electr engin indian scientist center artifici intellig india senior research fellow indian statist research interest area data mine knowledg pattern learn soft comput
ML/723 6 activ percept map learn robot navig david meyer rue du scott pari david abstract paper describ simul map system robot navig system autonom creation topolog map enhanc metric inform provid intern extern sensor robot posit repres calcul probabilist algorithm inspir hidden markov model visual system simpl reliabl recognit speci place jointli sonar record activ percept reliabl local robot start explor passiv translat place advantag drawback current system mean remedi introduct order navig autonom robot store spatial inform gather explor inform deriv intern extern percept lead type map metric topolog metric occup grid navig straightforward give robot posit euclidean space distanc direct easi calcul directli guid robot goal intern percept gain odometri devic subject cumul reliabl long period time store inform environ extern percept identifi distinct place place store topolog map mean place kind map su er perceptu problem fact larg place robot point view obviou solut reliabl navig sourc inform creat map environ perceptu ident place distinguish odometri point biolog system provid inspir place cell found rat respond perceptu shown remain oper suggest ring depend odometri fusion kind inform realiz straightforward navig system base partial observ markov process movement percept updat probabilist posit major drawback approach map repres environ creat prior util extend robot discov part environ figur pioneer mobil robot navig system draw inspir biologi pomdp model base topolog map addit data odometri vision store activ level node map repres robot probabl place activ updat techniqu drawn pomdp model map creat util separ learn system call activ percept strategi control robot camera order enhanc map accuraci posit estim navig system design futur implement pioneer mobil robot manufactur mobil robot equip sonar orient camera compass provid absolut refer direct paper report simul result obtain map learn realist simul provid pioneer robot markov model navig navig system base develop simmon koenig thrun al reli discret space nite set state cover locat robot reach robot posit repres probabl distribut action percept model set action transit probabl de probabl state robot perform action state set percept probabl de probabl acquir percept state updat wai robot act perceiv present act mean move updat equat percept updat equat robot probabl state time normal factor ensur probabl sum pomdp reli assumpt world markovian behav real world track robot posit reliabl learn action percept model learn pomdp structur current implement set state pomdp modi ed deal environ robot discov increment current model work inspir markovian model make simul robot repres estim posit topolog map augment metric increment built explor environ node perceptu data record robot locat place environ link node store distanc absolut direct robot move node measur robot compass odometri devic kind map combin advantag topolog metric map topolog inherit space extens robot initi lost robot problem tackl metric draw easi odometri data abil calcul path place area remain unexplor activ node map assess robot probabl place environ map learn algorithm iter step time robot move xed distanc calcul activ node map recogn current node creat updat sonar visual data store recogn node current data updat connect paramet previou current node odometri data set approxim robot size experi map structur success step algorithm detail section map input sonar data data perceiv sonar aggreg virtual sensor give distanc obstacl absolut direct data calcul compass inform valu sensor averag store map node current place store data repres environ place node map mean valu record success recognit node match measur estim similar robot current locat locat store map simpli corr constant ensur remain perceiv memor obstacl distanc direct match measur maximum di erenc visual system current percept node node node figur exampl match measur perceiv visual data data store di erent node pair number landmark categori head arc direct visual data record node match current percept node visual system ultim implement real pioneer robot inspir gaussier call speci landmark corner extract imag robot camera classi ed prede ned number categori implement node current list landmark categori number direct landmark detect landmark detect place newli perceiv landmark search list memor landmark landmark categori found direct di er consid recogn landmark ad landmark list attach node camera pictur cover real robot pictur gain inform environ movement full panoram imag direct camera point record node inform subsequ recognit order gradual obtain full environ strategi implement activ percept procedur orient visual system speci robot data chosen direct simpli direct record data current node robot obtain local chosen direct direct number recogn landmark maximum choic head visual system direct landmark numer easili recogniz choic altern made detect node highest activ map activ local consid inform sought rst procedur activ procedur improv qualiti local match measur assess similar perceiv store visual data corr min class landmark direct landmark gaussian varianc function common landmark perceiv store data number similar common landmark activ updat activ updat map rst step account robot step account robot percept pre pre pre pre pre pre pre od od od od rel posit neighbor node odometri record rel current node figur propag activ map odometri data grai level node belong pre show activ node time step earlier point od show robot posit time step earlier rel updat rule account past activ neighbor node posit rel current node text activ current node updat node time step multipli gaussian transform distanc recent inform odometri local procedur account past node rel posit neighbor node calcul odometri data store connect rel posit calcul activ act max max od od robot rel posit time step earlier record rel posit node rel current pre set map node reach gaussian varianc di erenc rel posit set half distanc node procedur seek determin recent visit node robot closest record odometri activ node set modul function di erenc record odometri posit rel calcul map data function posit ident converg di erenc updat rule advantag capit past inform avoid propag temporari wrong place identi cation robot reactiv avoid move obstacl current odometri record correspond global direct earlier record good activ propag corridor sonar data modul current node activ similar current percept record act act sn corr sn equat cs maximum corr map current sonar data sn data memor node procedur section order recogn creat node node activ percept procedur camera direct landmark detect visual system modul node activ equat corr sn replac function corr ln equat node recognit highest activ map activ node consid recogn current activ recent odometri determin current node achiev calcul robot posit rel node rel rel rel rel rel od od od rel posit rel posit robot estim rel posit rel posit map node figur gure show estim posit robot rel recogn node robot current odometri record odometri record time step recogn node odometri record time step recogn node posit rel posit reach odometri record od posit robot time odometri rel posit node recogn time rel node recogn set rel posit verifi node exist map distanc smaller node consid node creat rst recognit current node activ percept procedur camera head imag landmark extract updat node activ map perceiv landmark activ node di erent current activ node chosen current node map paramet updat sonar landmark data attach current node updat current percept section connect recogn node updat exist paramet chosen ensur map consist map consid consist di erent path link rel posit calcul sum connect figur procedur updat connect paramet robot odometri suggest robot posit distanc smaller recogn connect modi connect creat procedur ensur map consist text data ident result setup experi report section conduct pioneer robot provid simul call realist error estim sonar sensor odometri wheel encod valu corrupt maximum percent compass direct corrupt random maximum sonar sensor corrupt gaussian sensit specular ection angl sonar beam obstacl small visual system simul program robot categori direct landmark posit visual system orient simul world landmark randomli posit environ determin categori direct landmark determinist node map repres small area environ singl di erent pictur area surround point consid introduc perceiv landmark direct robot control navig randomli explor environ reactiv avoid obstacl map creation figur show map creat environ map exhibit figur exampl map creat robot environ number categori landmark posit environ odometri map estim figur evolut time distanc real locat locat estim odometri map hand environ map figur environ size distanc distanc robot diamet arbitrari unit odometri error map system error restrict slightli greater robot size link cross wall inconsist result erron node recognit begin period visual environ node accur ensur good discrimin note map creat gener perceptu similar di erent place longer problem matter stabil individu percept import newli creat activ propag robot move ecient make local process resist temporari lack perceptu inform rel number inconsist compar total number observ low compar total number connect robot local accur begin explor process activ propag map coher respect robot actual move map system robot local knowledg initi remain ecient robot passiv transport place environ figur odometri map error evolv experi figur show activ propag map transport episod demonstr wrong place identi robot succe correctli map prune drawback current map system tendenc number node grow robot explor explor entail pass place number node prove problem larg complex dedic procedur detect prune redund node design implement figur activ updat map robot move success place environ label actual posit robot map activ grei level small node map rang white node black node larger black dot successfulli recogn node map estim odometri figur evolut time odometri map estim error odometri error map system estim temporari experi report figur place environ visit approxim time number node creat map system attain result map shown top figur map exhibit erron node connect connect cross left part creat begin map erron useless map gure creat map addit procedur map number node quickli stabil procedur elimin node current node visit recent time step ago procedur elimin node visit time step implement detail determin empir examin rst depend environ size suggest adapt procedur set map system stabil automat discuss current simul system exhibit similar navig implement real robot share procedur work simmon koenig posit estim inspir pomdp model present work advantag map built increment explor made procedur add node map time environ ned map procedur highli reminisc figur activ updat map process robot move passiv place place environ wrongli recogn posit robot correctli recogn actual posit navig system meyer al fundament di erenc activ node present system code robot probabl place environ node work place cell determinist activ depend robot locat place probabilist approach make easili fuse vision seldom case tradit model fusion enhanc robust current system respect sensori probabilist approach question tradit view spatial suggest sort popul code repres anim probabl place current system cope chicken egg problem tackl al robot simultan build map estim posit robot posit order build map estim posit research problem solv continu correct robot posit estim speci procedur system reli topolog problem avoid account recent odometri inform robot evid current estim wrong current system share matar kuiper byun meyer manag metric inform node link inher topolog map system robot wander freeli arbitrari matar kuiper byun system intend work control underli explor procedur meyer system cope environ obstacl system exhibit interest properti local procedur depend inform acquir underli system inform easili ad vision data account activ updat map enhanc robust current system procedur evalu robot posit odometri decid robot place section show similar present number node time figur gure report experi robot explor environ figur approxim time map top exhibit wrong node link map obtain procedur suppress useless node text accur chart bottom gure show evolut number node map versu time map system map system prune procedur creat topolog map larg environ sensor provid inform merg data order disambigu place robot posit repres singl point map system accumul evid time step unabl recogn robot posit start posit implement di erenc current system compar respect function share meyer al capac explor map unknown environ maintain accur estim posit time error real estim posit robot perman maintain roughli equal robot case result size evolut error deduc inform capac current system accur local extend case robot passiv place environ similar capac evidenc work balakrishnan al requir motion step accur posit robot move place systemat comparison system assess rel merit accur actual system favor compar subject limit call visual landmark prede ned categori direct good reason robust procedur ord function implement real landmark detect categor call autonom tani depend methodolog base mixtur expert procedur ord adapt de nition landmark mention section map system tendenc number node grow procedur test solv problem adapt criteria work environ design implement simul map system creat topolog map unknown environ system track robot posit reliabl error exce roughli robot odometri error larg system reli activ percept mechan enabl robot gradual ne environ improv posit estim improv aim introduc mechan adapt prune map remov useless node order prevent map continu grow environ fulli repres procedur plan trajectori place implement futur simul pioneer system implement order check abil deal real navig problem refer pioneer mobil robot manual neurocomput system relat navig visual environ robot autonom spatial learn local comput model implic mobil robot adapt spatial map anim animat fourth intern confer simul adapt behavior mit press experi evid base mobil robot aisb workshop spatial reason anim robot springer neural architectur control arti cial anim robot autonom neuron popul code movement direct de son par robot mobil intellig arti plan act partial observ stochast domain arti cial robot explor map strategi base semant hierarchi spatial robot autonom autonom vehicl learn basic skill construct map navig robot autonom high resolut map wide angular sensor ieee intern confer robot autom ieee comput societi press motor action locat recognit practic autonom system mit press ring place cell dark depend rat recent experi journal probabilist navig partial observ environ morgan kaufman publish learn perceiv world approach hierarch learn system anim animat confer simul adapt behavior mit press learn map map indoor mobil robot navig arti cial integr topolog metric map mobil robot statist approach mit press navig model strategi animat ai arti cial navig review prospect progress learn perceiv act trial error machin integr explor local mobil robot adapt
ML/724 6 algorithm architectur present oral address regular adaboost takashi klau muller gmd germani abstract boost method maxim hard classif margin power techniqu exhibit overfit low case noisi data boost enforc hard margin give weight lead dilemma fit overfit algorithm soft margin classif introduc regular slack variabl boost adaboost reg regular version linear quadrat program adaboost experi show algorithm comparison soft margin support vector machin introduct boost ensembl method success ocr low case line explan candid explain function boost method breiman boost place reduc varianc effect limit capac system freund al show boost classifi larg error function boost written function margin boost step minim function maxim studi noisi pattern shown boost overfit noisi hold boost tree rbf net kind classifi myth boost method overfit fact boost maxim argument understand boost necessarili overfit noisi pattern overlap distribut give asymptot argument statement section hard margin plai central role relax hard margin classif misclassif soft margin classifi concept appli support vector machin perman commun inform research lab tokyo japan view margin concept central understand support vector machin boost method clear optim margin distribut learner achiev optim classif noisi case data hard margin choic noisi data believ data data point outlier gener neural learn strategi lead introduct reflect prior problem introduc weight boost strategi slack variabl achiev soft margin numer experi show valid regular approach section final adaboost algorithm fh tg ensembl defin input vector weight satisfi jcj binari classif output class ensembl gener label weight major sgn order train ensembl fh algorithm weight simpli weight scheme complic give descript algorithm special form adaboost binari classif case defin margin pair jcj correct class margin posit posit margin correct larger adaboost maxim margin minim function margin exp ae jbj oe jbj note unnorm weight hypothesi simpli normal version order find hypothesi learn exampl weight iter bootstrap weight sampl train altern weight error function weight weight comput exp exp train error ffl comput ffl hypothesi find weight minim optim paramet line search directli analyt minim ffl log ffl direct comput weight updat rule adaboost write gradient respect margin give hypothesi approxim hypothesi obtain minim directli note weight minim weight necessarili give ffl minim adaboost approxim gradient descent method minim asymptot hard margin predominantli achiev improv margin margin error big amplifi jbj adaboost neg margin effici improv error asymptot number iter jbj larg valu valu small differ amplifi strongli function asymptot sensit small differ margin margin converg fix stabil asymptot train pattern margin area area asymptot stabil eq jbj big adaboost learn pattern smallest margin high pattern effect neglect learn process order confirm reason fig show margin distribut adaboost iter toi level gener uniform distribut oe appar margin distribut asymptot make step fix stabil train pattern margin area previou studi observ pattern exhibit larg overlap support vector support vector machin numer result support theoret asymptot analysi properti adaboost produc big margin area pattern hard lead gener abil train pattern classif stabil cumul figur margin distribut adaboost level fix number base hypothesi typic overfit behaviour error function number iter typic line gener adaboost rbf network case center oe input experi noisi observ adaboost made overfit high number boost fig show typic overfit behaviour gener error boost iter perform achiev quinlan grove al observ overfit gener perform adaboost singl data classif reason overfit noisi pattern bad asymptot influenc line lead overfit eq reason classif hard mean train pattern asymptot correctli classifi capac presenc line give train error achiev larg hard margin noisi data produc complex problem soft margin chang adaboost error function order avoid introduc slack similar support vector algorithm adaboost train pattern stabil iter fig ae ae minimum margin pattern due adaboost produc high weight difficult train pattern enforc margin ae pattern includ properti eventu lead observ fig introduc variabl slack variabl ae posit train pattern high weight previou forc outlier classifi possibl wrong error margin import pattern train process constant eq origin adaboost algorithm retriev chosen data adopt prior weight punish larg weight analog weight decai sum cumul weight pattern previou iter adaboost chang easi classifi chang difficult pattern eq deriv error reg jb exp ae jb oe error control pattern achiev margin weight pattern comput deriv eq subject eq exp jb exp jb tabl pseudocod descript algorithm run adaboost dataset weight construct loss matrix ae minim minim minim st ae st ae st updat rule weight train pattern jb jb difficult comput weight hypothesi hard deriv weight analyt line search procedur eq uniqu solut reg satisfi line search implement effici optim ensembl grove al shown linear program maxim minimum margin ensembl algorithm maxim minimum margin train pattern achiev hard margin adaboost asymptot small number iter reason hard gener introduc slack variabl algorithm lp reg adaboost modif pattern lower stabil ae lower make stabil bigger ae maxim ae control constant formul optim problem deriv support vector algorithm optim object svm find function minim function form norm paramet vector measur complex hypothesi ensembl learn measur complex norm weight vector jbj small element approxim equal high strongli found larger complex hypothesi appli optim principl svm adaboost algorithm qp reg experi order evalu perform make comparison singl rbf origin adaboost adaboost reg rbf reg support vector machin rbf ten artifici real world dataset uci delv benchmark breast imag waveform problem origin binari classif partit class gener partit train test set partit train classifi test set error perform averag entri tabl toi dataset tabl comparison singl rbf support vector estim gener error dataset method bold perform explan text rbf ab svm cancer imag splice titan waveform winner rbf net adapt center conjug gradient iter optim posit width base combin number adaboost optim earli stop adaboost reg paramet regular version adaboost paramet svm optim train dataset train set valid find model dataset model paramet comput median estim estim paramet make comparison robust result reliabl line tab show line comput dataset averag error rate classifi type divid minimum error rate subtract result number averag dataset line show probabl method smallest basi experi ten experi noisi data show result adaboost case singl classifi overfit result adaboost reg case adaboost singl classifi singl classifi win reg improv result adaboost reg win reg improv result adaboost case due establish soft margin result good result adaboost reg gener adaboost construct hard gener good soft margin observ quadrat program slightli result linear program due fact coeffici gener lp reg bigger ensembl gener abil reduct varianc perform svm compar adaboost reg unexpect tie svm rbf net explain fix oe model error function sv algorithm adaboost low class separ shown adaboost reg extend applic boost case data noisi paramet valu paramet test introduc algorithm allevi overfit problem boost algorithm high direct incorpor regular term error function linear quadrat program constraint slack variabl essenc introduc slack variabl regular order soft margin classif contrast hard margin classif slack variabl basic control trust permit ignor outlier classif spirit support vector machin maxim margin minim classif error slack variabl adaboost reg show gener perform algorithm includ support vector machin conjectur unexpect result due fact svm oe scale inform adaboost limit balanc trust data margin maxim cross valid knew margin distribut achiev classifi noisi balanc error margin size optim futur plan establish connect qp reg interest analog sv algorithm kernel dictionari valuabl discuss schuurman partial fund ec storm project grant number acknowledg breast cancer domain obtain medic inst yugoslavia provid data refer bishop neural network pattern recognit breiman bag predictor machin breiman arc classifi berkelei breiman predict game arc algorithm berkelei vapnik support vector network aj schuurman boost maxim margin learn ensembl proc nat conf lecun al learn algorithm compar handwritten digit neural page muller asymptot analysi adaboost binari classif case proc april quinlan boost learn proc internat workshop algorithm learn springer ensembl learn method classif april diploma thesi lee boost explan effect vote method bengio adaboost neural applic onlin charact recognit springer vapnik natur statist learn theori
ML/725 6 case accuraci estim compar induct algorithm foster provost bell atlant scienc tech avenu white ny tom fawcett bell atlant scienc tech avenu white ny ron kohavi silicon graphic mountain ca abstract analyz critic classif accuraci compar classifi natur data provid investig roc standard machin learn standard benchmark data set result concern accuraci compar classifi draw question drawn studi describ demonstr proper roc analysi compar studi machin learn research argu methodolog prefer make practic choic draw scientif introduct substanti research devot develop analysi algorithm build part research involv compar induct algorithm common methodolog evalu perform statist comparison accuraci learn classifi suit benchmark data set question statist test question accuraci estim primari scientif methodolog fifteenth intern confer machin learn import scientif cast critic ey reason justif compar accuraci natur data set requir empir verif argu form roc analysi proper methodolog provid verif provid analysi classifi perform standard machin learn algorithm standard benchmark data set result concern practic comparison draw scientif predict perform concern contribut paper analyz critic common assumpt machin learn provid insight discuss implic describ superior methodolog evalu induct algorithm natur data set roc analysi machin learn research appli principl manner gear specif machin learn research draw hope work make progress goal justifi accuraci comparison induct problem intent appli machin learn algorithm build exist data model classifi unseen exampl limit predict intent machin learn issu comput perform assum true distribut exampl classifi appli advanc make inform perform estim data methodolog arriv estim commonli perform metric classif accuraci care comparison accuraci benchmark data induct algorithm algorithm superior induct problem tacit reason compar classifi natur data set data set repres problem system face real superior perform benchmark translat superior perform task field admir collect data set wide varieti classifi applic countless research result publish base comparison classifi accuraci benchmark data set argu compar accuraci benchmark data set classifi perform task accuraci maxim goal task natur data set classif accuraci assum equal misclassif cost posit neg assumpt problem type classif error fact primarili field medic pattern recognit machin learn fraud cost miss case fraud cost alarm accuraci maxim assum class distribut target environ benchmark data exist distribut natur stratifi iri data set instanc class splice junction data set acceptor site natur class distribut dna code human gene knowledg target class distribut claim maxim accuraci problem data set drawn accuraci maxim accuraci estim compar induct algorithm data candid justif classifi highest accuraci classifi minim classifi tradeoff true posit predict posit tune learn model produc probabl combin prior probabl cost estim classif model high classif accuraci produc good probabl low cost target scenario induct algorithm produc highest accuraci classifi produc classifi train differ breiman al suggest alter class distribut effect build tree work classif critic practic compar machin learn algorithm base suffici point accuraci metric perform measur analyz candid justif found justif discuss commonli cite special case argu make assumpt present result empir studi lead conclud justif question defin problem class base target cost class distribut maxim accuraci transform data correspond minim cost target data strategi conduct empir research base benchmark data set transform valid problem approxim effect multiclass problem open question cost data set note appli research provost assign cost virtual imposs gener class distribut natur data set target class distribut uncertainti claim transform problem problem case target condit virtual imposs domain target cost class distribut chang time place situat situat abil transform cost minim accuraci maxim justifi limit comparison classif accuraci class distribut comparison base classif accuraci indic broader notion perform roc analysi domin model investig algorithm gener classifi gener produc classifi target cost scenario target cost class distribut order conclud classifi higher accuraci show perform reason assumpt limit investig problem analysi straightforward evalu framework receiv oper characterist analysi swet classic methodolog signal detect theori common medic diagnosi recent begun gener ai provost briefli review basic roc analysi roc space denot coordin system visual classifi perform roc typic true posit tp plot axi posit fp plot axi classifi repres point roc space tp pair model produc continu output estim posterior probabl instanc class statist vari threshold output vari threshold defin classifi result call roc illustr error tradeoff model roc curv describ predict behavior classifi independ class distribut error decoupl classif perform factor crucial notion model domin roc mean roc curv beneath equal domin model model nb figur good model cost class distribut domin model consid model term predict perform domin model exist figur model repres target exist scenario model maxim accuraci minimum cost figur show roc curv uci domain studi note roc curv figur largest domain roc typic induct studi roc curv gener test set accuraci estim base singl roc curv mislead observ variat due partit difficult draw strong expect behavior learn model conduct roc analysi bradlei produc roc curv cross similarli bradlei gener curv techniqu pool ith point make raw roc curv averag discuss swet pool assum ith point curv estim point roc doubt bradlei method gener curv bradlei acknowledg german posit true posit nb adult posit true posit nb figur raw roc curv uci domain studi import good approxim expect roc curv gener result call averag averag procedur recommend swet assum roc curv roc averag roc curv manner roc curv fold treat tp linear interpol point roc space multipl point fp maximum tp averag roc curv function plot averag roc curv sampl point regularli space fp comput confid interv tp common assumpt binomi distribut standard method produc domin state basic hypothesi standard learn algorithm produc domin model standard benchmark data studi problemat note classif perform line segment connect roc point achiev randomli select classif interpol classifi defin endpoint set hypothesi true conclud algorithm higher accuraci gener target cost prior hypothesi reli justif provid studi design uci repositori chose ten dataset accuraci tree roc curv difficult read high induc classifi minor class road chose class select induc tree learner naiv discret neighbor valu similar probabilist predict made laplac correct leav nb discret data base entropi minim build model vote closest neighbor vote weight equal distanc test instanc averag roc curv shown figur ten domain problem accuraci comparison select classifi indistinguish point posit nb vehicl posit nb posit nb dna posit nb adult figur smooth roc curv uci domain absolut domin run perform data crossvalid fold domin classifi case adult case curv domin area roc space domin refut hypothesi algorithm produc domin classifi draw question claim algorithm base accuraci comparison order draw absenc target cost class roc curv algorithm domin algorithm obviou implic machin learn research practic weaker claim algorithm good choic good algorithm accuraci significantli clear type justifi curv statist indistinguish domin area space significantli domin practic situat typic comparison made wealth classifi classifi compar gener comparison case model pair region roc space draw question singl number metric practic algorithm metric base target cost class distribut inform standard method coerc yield domin roc justif accuraci compar algorithm subtli possibl coerc algorithm produc behavior scenario accuraci comparison justifi argu algorithm higher accuraci algorithm lower cost reason cost class distribut confirm refut justif complet scope coerc algorithm condit open question straightforward method stratifi sampl evalu satisfactorili roc framework outlin minor evalu question algorithm produc model cost class roc methodolog state adequ evalu perform individu model algorithm perform roc analysi produc composit curv set gener model convex hull roc curv produc set detail provost fawcett form hypothesi potenti standard learn algorithm produc domin roc curv standard benchmark data set confirm hypothesi import step justifi common practic ignor target cost class distribut comparison natur data confirm evid disconfirm evid result present naiv robust respect produc roc curv target cost class distribut shown tree surprisingli robust probabl estim gener laplac estim result hold result previou section disconfirm present hypothesi bradlei result provid disconfirm evid studi medic data set uci repositori bradlei plot roc curv classifi learn consist neural tree statist techniqu bradlei composit roc curv form train model differ cost distribut critic design studi answer question result replic current make strong statement data set domin classifi impli domain exist disjoint set condit induct algorithm prefer recommend limit design compar research clear draw result argu comparison algorithm base accuraci unsatisfactori domin classifi present case accuraci goal show comparison target cost class distribut qualifi singl number metric make strong inform rang cost class distribut classifi domin problem classif learn skew class distribut analyz knowledg target robust specif classifi perform made detail provost fawcett slope line tangent roc convex hull determin rang cost class distribut classifi minim cost specif target slope cost ratio time reciproc class ratio ten optim classifi target condit tabl road domain tabl local domin classifi ten uci domain domain slope rang domin domain slope rang domin adult nb pima nb nb nb breast nb cancer nb nb nb nb nb german nb nb waveform nb road nb dna nb vehicl ur tabl naiv classifi target condit slope slope greater perform equal admit eleg research practic domin classifi exist cost class distribut inform strong statement classifi superior made make statement superior specif region roc space posit error find algorithm superior edg roc space limit investig class affect result neg recommend analyt note extend work multipl dimens interest open problem complet satisfi method gener confid interv present interv observ maxim tp fp appropri question evalu minimum expect set cost contour roc space line slope area futur fundament drawback methodolog offer debat justif accuraci estim primari metric compar algorithm benchmark data set elucid top candid shown realist cost class distribut support evid draw work justif accuraci compar classifi question proper roc analysi appli compar studi machin learn research roc analysi simpl compar metric addit power deliv worth effort roc analysi gener posit neg situat gener roc analysi analysi conduct roc analysi machin learn research appli principl gear specif machin learn research draw hope work make progress goal acknowledg discuss justif comparison roc analysi appli classifi learn rob holt provid comment draft paper refer beck schultz roc curv test perform evalu arch lab brodlei prune tree misclassif cost page bradlei area roc curv evalu machin learn algorithm pattern stone classif regress tree wadsworth intern group breiman bag predictor machin catlett tailor ruleset cost confer ai page dietterich approxim statist test compar classif learn algorithm neural comput domingo pazzani condit optim simpl bayesian classifi machin sahami discret continu featur page morgan kaufmann signal detect theori roc analysi seri percept academ york fawcett provost adapt fraud detect data mine knowledg dougherti data mine machin learn librari intern journal artifici intellig kohavi studi bootstrap accuraci estim model select page morgan kaufmann merz murphi uci repositori machin learn provost fawcett analysi visual classifi comparison class cost distribut page aaai press provost fawcett robust classif system environ aaai press quinlan program machin learn morgan san california saitta learn machin salzberg compar pitfal avoid recommend approach data mine knowledg schaffer conserv law gener perform page morgan kaufmann swet evalu diagnost method signal detect theori academ press swet measur accuraci diagnost system turnei cost sensit learn bibliographi wolpert relationship statist physic bayesian vc framework mathemat gener addison weslei posit nb breast cancer posit nb posit nb german posit nb pima posit nb posit nb figur smooth roc curv uci
Agents/726 1 network comput framework etienn franc mt brazier depart comput faculti vrije universiteit amsterdam de boelelaan hv netherland abstract combin network comput perfect match agent cooper commun network typic support distribut system node equal role framework design support system pole extend framework comput combin facilit develop applic servic introduct emerg fast network move distribut comput area distribut resourc network close coupl provid singl integr platform comput data storag exampl grid comput har comput power host network make resourc user system distribut system node peer equal role node distribut system ident capabl commun symmetr system decentr larg extrem dynam oper environ system exchang file network distribut file network har comput power host similar elabor system grid comput environ interact pattern agent autonom agent observ environ reason act basi observ agent adapt adapt structur main goal integr function framework multiag system simplifi applic servic develop free programm detail includ schedul paper briefli describ framework pole extens framework basic network comput support support incorpor middlewar servic applic level api runtim section briefli introduc concept comput autonom agent framework present section integr network comput support explain section section conclud paper discuss futur work network autonom agent section present overview network autonom agent network comput offer compel intuit user find share resourc directli requir central author server applic primarili hint complet access internet deliv futur includ inform process share directli buyer seller match directli auction transact approach distribut grid environ comput enabl applic collabor leverag comput bandwidth found system connect network applic research project initi past chord applic share notion intend usag approach vari applic applic napster primarili exchang file peer approach inform search adher philosophi forward inform search request neighbor peer network recent introduc super node client node scalabl inform distribut inform storag system pool disk space potenti hundr thousand desktop comput creat collabor virtual file system distribut object locat rout infrastructur applic support varieti includ global data data group commun scalabl lookup servic effici locat node store data item chord support map kei node project sun microsystem work core network comput technolog provid set flexibl mechan support comput focu creat basic mechan leav polici choic applic develop behaviour network studi secur subject studi observ network organ network typic distribut edg major node local connect small number node larg set connect larg topolog enabl short path node provid shortcut network surprisingli resist random random failur elimin node poorli connect major node featur make immun accid make vulner attack node target autonom agent comput system perspect agent piec run code data state function agent term human predic intellig agent process autonom make interact object commun agent mobil agent interact object object passiv object invok order perform perform invoc receiv messag autonom decid agent influenc agent send possibl request agent free ignor react request messag deliveri subject level messag paradigm fipa prescrib reliabl order commun agent agent comput system mobil migrat autonom mobil agent abil migrat mobil agent mean overcom high latenc limit bandwidth problem tradit interact move comput requir resourc servic current evolut intellig activ network system network base technolog similar tendenc observ search filter global inform electron inform retriev world wide web distinct drawn base execut state migrat unit comput system provid option support strong system discard execut state provid weak mobil system support strong migrat complet transpar migrat weak extra program requir order save part execut state strong mobil found nomad ara requir entir state includ execut stack program counter save agent migrat locat strong mobil complic task typic implement function platform mention provid platform specif solut heterogen system realiz platform support weak mobil aglet agent system implement top java virtual machin object serial basic mechan implement weak mobil jvm provid mechan deal execut state secur great import agent electron monetari mobil agent gener current research secur agent system concentr protect host hostil mobil agent problem secur stem fact untrust code execut modern solut base notion protect domain secur polici access local resourc enforc system provid facil protect mobil agent hostil host scalabl infrastructur middlewar layer support agent system design provid platform agent support multipl code base oper agent platform consequ design respect agent secur servic present subsect section conclud note prototyp implement model model design philosophi middlewar provid minim suffici support agent size fit middlewar adapt reconfigur tailor specif applic oper platform agent object basic entiti locat agent object resid fig agent activ entiti locat middlewar solari agent middlewar linux middlewar object locat middlewar solari servic middlewar linux figur conceptu model middlewar interact commun agent migrat form weak mobil support object passiv entiti engag comput reactiv initi model defin servic servic provid inform activ behalf agent middlewar import principl underli design design includ design object secur agent platform scalabl agent object realiz distribut object distribut agent agent public distribut basic idea model core function provid agent interfac implement middlewar agent design perform basic function approach number advantag middlewar basic complex design middlewar manag qualiti robust secur middlewar easili assert addit function implement interfac implement fig agent interfac agent specif interfac implement simpl proxi wrapper locat kill suspend move os interfac agent specif interfac implement simpl proxi wrapper oper system kill suspend move figur interfac model linux interact commun asynchron messag pass good scalabl characterist minimum synchron agent agent migrat locat base weak mobil section state agent captur variabl referenc context agent stack pointer program architectur agent object support agent server object server agent server provid interfac access agent host agent server object server provid access object host object server servic made access servic access provid locat close relat collect agent object possibl host manag administr domain host run minim ao agent object servic access provid locat implement distribut ao agent object servic access provid depend polici resourc agent assign agent pool agent host agent server explicit agent server make aspect life cycl model agent clear activ agent assign run suspend agent assign agent server start newli activ exist suspend design agent life cycl simplifi agent object server transpar agent agent agent server belong model perform secur manag agent middlewar determin agent server agent run oper system form basic fundament middlewar overview architectur shown fig ao offer uniform transpar interfac underli resourc hide aspect network oper access api interfac middlewar agent servic resourc manag directori interfac ao middlewar api directori servic resourc manag os kernel secur modul tabl agent manag bind protocol locat modul servic agent server life cycl modul agent server migrat modul object server comm modul figur middlewar architectur design oper system modular ao kernel central activ entiti coordin activ middlewar modul ao middlewar provid basic function overview import modul modul creation delet agent commun modul implement number commun similar support agent mobil implement migrat modul locat servic associ agent identifi locat servic locat secur architectur essenti design integr part middlewar modul middlewar request authent author order execut task agent platform realiz wai conform standard fipa omg masif agent platform standard defin interfac protocol agent platform implement omg masif standard defin agent agent track agent transport fipa standard defin agent commun agent messag defin abstract architectur agent platform approach realiz reconfigur adapt mobil agent accomplish agent factori brazier al agent blueprint function compon agent platform prototyp prototyp implement architectur basic creation delet commun agent weak migrat agent oper system kernel basic servic implement program languag agent server implement java agent server program languag made forthcom distribut share object support globe system globe distribut system framework develop applic multipl program languag applic level build agent object program languag modul ao implement program languag multipl locat servic present implement languag specif implement locat servic base network section integr network comput section present softwar architectur network comput infrastructur network infrastructur call pole design approach pole li chord section similar chord pole implement overlai network rout messag store inform intend design pole includ servic complex coordin make servic applic similar project philosophi support intend develop varieti internet system global file file locat group agent coordin typic applic infrastructur distribut auction inform retriev applic put stringent requir agent coordin profit function provid applianc function instant messag peer conson build top pole applic inform retriev agent factori distribut file storag applic servic os kernel secur modul directori servic comm modul distribut auction servic modul figur architectur system resourc manag network pole softwar architectur roughli broken layer present ao kernel servic applic layer fig ao kernel layer deal commun manag rout servic layer deal file share top layer applic instant inform storag system os kernel support peer network os kernel basic support servic agent applic ao kernel extend function load startup modul middlewar fig modul middlewar implement os kernel function function provid modul layer built top ao kernel servic applic make secur modul implement secur polici encrypt messag ao kernel mechan peer group support creat polici creation secur current prototyp implement accomplish commun messag peer structur support transfer content code manner futur develop requir monitor behaviour activ order implement access prioriti traffic bandwidth balanc current kernel modul basic mechan realiz overlai network messag rout pole prototyp implement modul organ host overlai network circl host node circl topolog digest ip number host comput numer ip hash determin node posit circl topolog digest combin ip number port number introduc virtual multipl virtual node resid singl host improv load balanc server larg amount memori high bandwidth connect host multipl virtual laptop connect host index kei store network node direct successor relat hold numer index kei index kei data store node hash ip node import characterist hash secur hash function hash function map index kei ip port number case hash valu uniform distribut characterist ensur uniform distribut index kei node network search algorithm kei network make hypercub rout gener prefix circl topolog hash node prefix kei index search request node halv distanc destin node node tabl node distanc case address space overlai network base distribut hash tabl provid effici object load balanc basic protocol network proxim extens basic rout protocol simpl heurist measur proxim small number node result local properti rout messag reduc network usag chord reduc lookup latenc preferenti contact node nearbi underli network chord estim rout cost neighbor node base latenc observ build rout tabl similar approach adapt pole servic comput servic comput expand capabl ao kernel facilit applic develop facil provid layer includ mechan cach search capabl includ parallel search peer group note directori servic make servic directori servic typic data index distribut inform updat mechan specif servic develop environ locat servic base network locat servic map agent handl agent handl locat servic specif data structur effici map uniqu agent identifi support multipl locat base dn similar hierarch base network uniqu agent identifi regist specif locat locat servic specif agent handler return futur locat servic prototyp comput digest identifi agent handl kei search hash agent identifi store network section compar busi card state protocol refer contact address telephon email email ip port number agent contact agent handl locat return agent protocol contact remot agent peer servic layer support secur peer messag system built anonym authorship persist messag store peer servic layer mechan creat secur specif tool polici determin applic develop applic applic built peer servic ao kernel layer pole facil made applic develop runtim librari implement api servic ao kernel modul peer applic enabl core peer servic layer includ electron auction market link buyer seller directli resourc share applic built quickli easili interfac interfac provid minim program interfac file share system client side applic built top interfac develop defin interfac publish manag configur peer group client side applic interfac system summari futur work paper present pole softwar architectur extend framework comput facil comput function framework incorpor ao api runtim librari facil build block construct varieti internet applic distribut global file distribut inform retriev prototyp implement pole softwar architectur environ implement locat servic make pole system servic directori make technolog manag system alloc resourc balanc agent base comput dynam natur unavail dynam migrat requir scalabl robust mechan manag distribut system effect comput potenti offer solut futur work pole system includ kei data replic strategi search perform improv includ exploit network proxim messag rout order reduc commun latenc bandwidth acknowledg author wijngaard van steen valuabl discuss comment work support refer van wijngaard agent gener migrat mobil agent heterogen environ acm symposium appli comput page mar exploit network proxim distribut hash tabl intern workshop futur direct distribut comput june chen hu mobil activ network architectur intellig network control inform mar clark network jan wilei protect free express onlin ieee internet home page cooper storag cf acm symposium oper system principl page oct dale mamdani open standard system softwar spring foster editor blueprint comput infrastructur morgan san gong network program environ ieee internet gong implement protect domain java develop kit symposium network distribut system page san mar internet societi ru applic perform system practic inform retriev world wide web ieee internet van der van implement environ migrat pvm task oper system juli jen editor agent market model network topolog model power law ix telecommun forum nov karnik tripathi secur mobil agent system practic apr program mobil agent java worldwid comput volum lectur note comput page hunter idl workstat intern confer distribut comput page san june al omg mobil agent system facil intern workshop mobil volum lectur note comput page sept vassiliadi agent auction intern joint confer autonom agent system juli van brazier support grid manag symposium ai grid page apr applic program experi ara mobil agent system practic picco mobil introduct microprocessor apr global data storag ieee internet roth concept architectur mobil agent server intern symposium autonom decentr system page mar druschel decentr object rout system middlewar volum lectur note comput page balakrishnan scalabl lookup servic internet applic confer protocol comput commun page san aug sun project innov collabor white apr smith strong safe mobil agent system fourth intern confer autonom page singh mobil agent program intern confer distribut comput system page van tanenbaum distribut system ieee watt collect dynam network june van brazier support system data knowledg june wooldridg jen intellig theori practic knowledg engin june
Agents/727 1 result schedul decaf john michael keith decker depart comput inform scienc delawar abstract decaf softwar toolkit rapid execut agent achiev solut complex softwar system research commun decaf modular platform evalu dissemin result agent includ execut learn paper describ methodolog result build evalu execut schedul agent action decaf architectur descript decaf provid describ modular design test multipl schedul algorithm descript type agent demonstr capabl parallel thread natur architectur experi schedul algorithm util develop platform futur research agent schedul basic algorithm test simpl base previou work massachusett base basic oper system principl goal test determin basic paramet determin suitabl decaf type work assist develop effici schedul algorithm decaf java virtual machin scale presenc thread multipl processor softwar materi base work support nation scienc foundat grant john graham graduat research assist michael undergradu research delawar intellig parallel action system introduct decaf agent toolkit softwar engin approach build system toolkit stabl platform rapidli execut intellig agent achiev solut complex softwar system decaf architectur servic intellig agent execut eventu learn essenti intern softwar applic programm strictli limit access control program decaf agent provid gui call execut action treat basic build block chain achiev larger complex goal style htn task softwar program interfac desir properti compon autom chain activ involv tradit loop construct part decaf extens retsina tm task structur framework unlik tradit softwar decaf attach action perform profil updat intern decaf provid local schedul servic common agent behavior execut behavior depend specif construct task network dynam environ agent oper agent search result achiev applic agent execut behavior result time applic instanc construct level agent action build block part decaf base schedul work massachusett goal architectur develop modular platform suitabl research rapid develop domain provid mean quickli develop complet solut combin agent standard advantag object java program languag decaf distinguish agent toolkit shift focu underli compon agent build socket messag detail agent commun decaf program write line code includ system call nativ oper system decaf environ basic build block agent program agent action decaf agent oper system code action make call decaf framework send search agent implement formal coordin protocol interfac framework strictli limit set util remov understand underli structur programm understand java network program send learn java function attach intern knowledg base framework detail intern mechan decaf architectur found studi figur repres high level structur decaf architectur structur insid heavi black line intern architectur item line provid sourc incom kqml shown figur intern execut modul current decaf data structur queue focu result schedul modul schedul determin action execut execut order determin base provis agent action provis incom messag provis result action complet mean task queue structur check time provis action execut potenti method accomplish task schedul select set execut path accomplish agent goal idea execut path attach execut path kind estim perform user provid idea perform object agent architectur reason concept execut path goal experi determin paramet reason schedul order modular design decaf implement test number schedul algorithm input output schedul modul defin simpl matter chang algorithm run experi goal setup goal test decaf ffl determin scalabl decaf architectur platform ffl determin benefit thread natur decaf architectur ffl determin cost network overhead multiag system ffl develop basic methodolog futur test schedul algorithm ffl examin effect perform schedul algorithm build test scenario multiag system system execut path expect respond thread multi processor environ order baselin measur futur develop schedul algorithm system analyz determin path execut compar system featur larg volum messag pass measur network overhead messag pass detail test ffl run larg agent approxim execut path goal show decaf scale larg agent task network part programm refer result agent initi decaf task control structur plan file incom kqml messag domain fact belief kqml messag outgo action modul hashtabl action queue pend result queue action dispatch planner executor messag queue incom queue object queue task queue agenda schedul task templat figur decaf architectur overview ffl plan file translat tm syntax analyz schedul algorithm provid tom wagner result analysi schedul meet goal task schedul translat back decaf syntax execut ffl highli distribut system system food system emul oper work restaur includ hire make order send report govern agenc test determin overhead network kqml messag protocol decaf oper read plan file list task instanti architectur capabl perform plan file ascii hierarch task network detail action sequenc complet task actual syntax plan file extens retsina tm structur detail decaf read plan file determin action execut parallel wait enabl output previou action plan file tree repres approxim execut path complet task path elimin immedi result accept analysi schedul path accomplish task algorithm appli fifteen remain schedul tradit algorithm basic oper system word schedul list list run analysi fifteen schedul made schedul chosen idea determin algorithm umass fifteen schedul run parallel complet run hypothesi fifteen schedul thing common accomplish averag path length run action run action total number action long develop robust execut task task complet deadlin action select execut path fail execut abil recov made easier recalcul schedul anticip discret action ad overhead run extra action compar rework event failur baselin measur specif determin algorithm run compar time run action parallel execut expect singl time multipl processor machin time compar altern execut modul test decaf parallel thread execut requir larg amount synchron method time synchron compar version execut modul give measur benefit thread architectur result paragraph describ result test actual perform number summar tabl end section perform result repres averag ten separ execut test thread versu execut result easili definit run comput intens big agent thread execut modul faster mode total number action execut task request action task run parallel observ predict speed time thread improv multi processor versu singl processor result multi processor execut dramat consist processor processor show improv depend specif test anticip result attribut thing ffl intern work java virtual machin jvm run multi clear jvm advantag resourc ffl simul task actual process data put loop period time jvm detect simpli put thread sleep true speed gain singl processor test run thread activ task level action level action specif task run multipl task request agent run parallel gain test approach line expect result confirm issu list gain realiz test action work elig swap jvm time cpu fourteen cpu improv optim schedul versu complet schedul execut goal show comput result thread parallel execut outweigh extra process time recov event failur result bear hypothesi point test account qualiti result produc reason test qualiti result goal negat reason schedul qualiti assist determin parallel execut result confirm time comput singl optim schedul extra overhead comput multipl schedul work result abil comput schedul quickli lead effici robust schedul algorithm tabl show comparison thread execut schedul version differ dramat thread complet schedul optim schedul differ network intens execut compar execut virtual food court machin run machin prove interest multi agent system consist discret agent basic task unit meal enter negoti meal waiter restaur make prepar meal bui eat meal requir kqml messag exchang agenc memori intens applic agent check avail food resourc execut meal time run singl machin faster network seri agent network perform statist singl machin version issu affect perform agent ffl machin agent rearrang agent ran memori constraint chang result chang ffl local area network network time overwhelm amount time run test agent configur network close connect meal twenti meal local distribut chang futur work goal test met obviou improv perform due thread clear improv intern mechan decaf fulli advantag multiprocessor system network agent compar local execut agent system examin major goal test develop platform type test measur evalu agent perform measur time clear set agent develop make time virtual food court excel messag intens larg memori requir overshadow interag commun demonstr nice thread abil decaf realist action comput intens jvm swap task futur work focu develop complet set benchmark evalu decaf agent architectur goal test establish baselin comparison schedul algorithm achiev process establish valid structur decaf model prove simpl task exchang schedul algorithm interfac modul defin acknowledg primari develop decaf john graham extens improv mike develop virtual food court foster suggest assist test procedur david refer williamson internet fifteenth intern joint confer artifici page august keith decker victor lesser quantit model complex comput task environ eleventh nation confer artifici page juli keith decker katia sycara intellig adapt inform agent journal intellig inform alan marti victor lesser task interdepend schedul eleventh nation confer artifici page juli john graham keith decker environ center agent framework sixth intern workshop agent theori john graham keith decker agent framework nr jen intellig agent vi sixth intern workshop agent languag lectur note artifici intellig volum xuan diagnosi integr part adapt tech report zeng distribut intellig agent ieee decemb lesser complex goal criteria applic schedul fourteenth nation confer artifici juli thoma alan victor lesser task schedul intern journal approxim special issu version umass cs sycara unifi inform control flow hierarch task network workshop theori
HCI/728 4 mit media laboratori perceptu comput section technic report ieee pami submit american sign languag recognit desk wearabl comput base video thad joshua alex pentland room media laboratori massachusett institut technolog cambridg ma abstract present hidden markov system recogn continu american sign languag singl camera track user hand system observ user desk mount camera achiev word accuraci system mount camera cap worn user achiev accuraci unrestrict experi word lexicon gestur hidden markov wearabl sign motion pattern analysi introduct type structur set belong sign languag sign gestur assign strong rule context grammar appli make recognit tractabl american sign languag languag choic deaf unit state asl approxim gestur common word finger spell commun obscur word proper noun major sign full sign proce pace spoken asl grammar flexibl word order english redund emphasi sign exact english common spoken english widespread america asl describ thing point place space store object temporarili refer aspect asl asl eyebrow relax direct built system track facial featur sourc inform aid recognit task address relat work similar path earli speech previou attempt machin sign languag recognit concentr isol sign space permit review attempt reli instrument glove camera system form templat match neural net recognit current extens system begin emploi hidden markov model hidden markov model promin successfulli speech recognit handwrit recognit ideal visual recognit structur hand gestur found sign languag explicit segment word level train recognit languag context model appli relat develop technolog speech recognit commun author report project hmm found comput vision literatur continu densiti hmm begin speech continu gestur recognit gestur lexicon automat train uncommon result report standard accuraci measur accept speech handwrit recognit train test ident depend manner gestur recogn task literatur continu sign guag system demonstr submiss liang work sign languag show encourag result recogn system recogn motion primit constitu form lexicon word continu recogn accuraci vogler metaxa camera system achiev word accuraci word lexicon vision process electromagnet tracker interchang mutual orthogon calibr camera collect data task describ extens system color camera track hand real time interpret american sign languag hidden markov model track stage system attempt fine descript hand concentr evolut gestur time studi human sign reader suggest surprisingli hand detail human interpret sign languag movi shot waist isol al show movi retain full resolut intellig subsampl track process produc descript hand trajectori result inform input hmm recognit sign word scope work creat user full lexicon system recogn system extens goal sign languag recognit full sentenc demonstr feasibl recogn complic seri gestur recognit techniqu easier demonstr possibl commerci product simplifi archiv test data recognit sentenc form person recogn structur larg varieti sentenc gener randomli chosen word class shown tabl person twenti adject includ total lexicon forti word word chosen page al select word gener coher sentenc grammar constraint word chosen base distinct lack tabl asl test lexicon part speech vocabulari pronoun verb loan noun bowl adject yellow detail finger posit note finger posit plai import role sign food red hidden markov model due space reader encourag refer exist literatur hmm decod tutori relat hmm sign languag recognit provid author master thesi initi topolog hmm determin estim state involv sign fine tune topolog perform empir initi topolog state consid suffici complex sign handl complic skip transit topolog emul strictli state hmm topolog sign method train adapt hmm automat human test state hmm skip transit determin task figur state hmm recognit featur extract hand ambigu previou system shown strong constraint detail model hand recov video imag constraint conflict recogn asl natur requir unchang background requir carefulli label difficult run real time track hand singl camera aid glove mark natur color hand sign mount locat camera posit observ signer point view signer view thought train viewpoint rare instanc translat system worn hear person translat sign mute deaf individu system signer control dictat desktop comput case experi figur demonstr viewpoint experi figur view track camera imag analyz resolut system observ signer hand viewpoint signer figur show placement camera cap demonstr result viewpoint camera attach sgi current hardwar entir system cap wearabl comput camera front made good qualiti speaker line transduc thin stereo final batteri back head starner al mit wearabl comput site detail inform wearabl comput relat technolog figur point downward view wearabl comput system greatest util asl spoken english translat worn signer commun busi vacat provid signer view translat system feasibl provid translat system signer encount dai color composit video captur analyz pixel resolut lower resolut avoid video interlac effect silicon graphic indi workstat maintain hand track frame frame rate al found suffici human recognit segment hand algorithm scan imag find pixel determin priori model skin color pixel region grown check nearest neighbor color pixel check consid part hand perform simpl morpholog dilat result imag prevent edg light centroid calcul grow step store seed frame hand skin label simpli assign whichev blob leftmost rightmost note priori model skin color situat mobil light chang hand drastic imag figur clue address view bottom imag signer nose camera mount nose stai place rel imag signer nose calibr object gener model hand skin color track calibr system experi extract hand blob moment analysi perform blob sixteen element featur vector construct hand chang area angl axi inertia eigenvector length eccentr bound track skin analysi model situat hand ambigu implicitli hand occlud hand face nose case wearabl color track resolv ambigu face remain area posit determin discount hand move rapidli occlud hand system singl blob larger normal area significantli moment hand previou frame hand assign featur singl blob occur inform track hand method retain amount discrimin inform event implicitli combin posit moment inform retain combin time context provid hidden markov suffici distinguish sign hand occur person recogn situat explor person recogn experi sentenc sentenc elimin due subject error outlier sign sign long intent exist sign sentenc distinct test sentenc reserv test test sentenc portion train process sentenc divid automat equal portion provid initi segment compon sign initi estim mean varianc output probabl provid iter viterbi align train data recomput mean varianc pool vector segment entrop hidden markov model toolkit basi step hmm model train task result initi align program fed estim refin train ignor initi segment htk viterbi recogn grammar base form sentenc context requir significantli data train similar effect achiev strong grammar data set recognit occur time faster real time word recognit accuraci result shown tabl percentag word correctli recogn shown accuraci rate accuraci calcul acc total number word test number number number insert note error account accuraci larg neg accuraci error rate grammar insert delet error number class word error vocabulari substitut grammar accuraci percent assum random chanc result percent correct calcul averag likelihood correct recogn match observ vector number vocabulari word order number word produc recogn number sampl delet insert substitut error comparison random chanc irrelev absolut number error type list tabl insert error correspond sign repetit motion addit test provid result absolut posit remov featur vector recogn perform rel featur case daili signer place locat time system tabl word accuraci system experi train set independ test set featur rel featur featur unrestrict grammar word percent correct test strong grammar featur element test remov absolut posit featur vector test featur requir output word lexicon word occur time number time accuraci grammar show hmm topolog sound model gener subject variabl bodi rotat posit problem data set sign distinguish hand posit relat bodi absolut posit hand screen coordin measur rel featur absolut posit hand remov featur vector chang error rate demonstr feasibl subject vari locat room possibl remov constraint system error rate experi problem occur extend system sign repetit long gestur insert actual occurr insert error substitut sign recogn viabl hypothesi languag model practic solut problem context train statist grammar person recogn sentenc collect subject sentenc resign mistak made full sentenc anonym ftp subject care forward sign confound track head variat frame begin end sentenc data hand rest posit defer speech ad lexicon train includ calcul accuraci measur result word accuraci experi list tabl experi sentenc independ sentenc test grammar ad experi grammar simpli restrict recogn word sentenc regard part speech percent correct word expect chanc grammar delet insert grammar repeat word thought delet insert substitut tabl word accuraci wearabl comput system grammar train set independ test set speech sentenc unrestrict word percent correct grammar limit recogn output word select vocabulari grammar unrestrict accuraci essenti suggest sign lexicon distinguish featur set method previou repeat word repres error unrestrict grammar test simpl repeat word filter appli post process unrestrict grammar test accuraci restrict carefulli detail grammar test begin end pronoun restrict hurt perform strong grammar superflu task similar result case hmm train converg gener extrem task main result high accuraci harder task attempt wearabl system accur desk factor wearabl system face hand wearabl data set problem bodi rotat data set experienc data set creat verifi separ success data record method control factor requir section discuss futur work shown high accuraci comput method recogn american sign languag select word lexicon experi show system commun comput experi demonstr wearabl comput method part asl english translat experi argu hmm power method sign languag speech handwrit recognit experi suggest person view valid perspect creat wearabl asl translat argu sign evolv maximum intellig frontal thought reveal sign distinguish signer learn provid control feedback determin view superior begun experi nativ signer task complet task design encourag small vocabulari hundr encourag natur sign view signer record stereo pair view wearabl comput view track view compar directli head motion facial gestur role sign wearabl system troubl address head rotat significantli impair current system shown effect rotat issu viewpoint simpl belt letter track provid addit featur option wearabl system add inerti sensor head motion cap head band forehead analyz eyebrow motion discuss picard facial gestur inform recov system grow lexicon finger palm track inform ad simpl count finger visibl contour hand palm face context model statist grammar ad reduc error factor speech handwrit trend hold true sign improv address user independ make system understand subject variat languag involv collect data subject system hard estim number subject amount data suitabl train independ recognit place requir featur set modif mention initi develop process highli empir address problem finger spell featur vector address finger inform adjust context model import finger closer parallel made speech recognit context occur level grammar model occur word level odd context word sign context finger spell benefici switch separ mode finger spell natur languag techniqu address spatial posit issu answer question kei creat unconstrain sign languag recognit system acknowledg author hall edit document work support bt thing consortium mit media laboratori refer baum inequ maxim techniqu statist estim probabilist function markov process pentland invari featur gestur recognit intl conf face gestur page hand shape identif track sign languag interpret ijcai workshop pentland track facial motion proc workshop motion articul nov horn robot vision mit xd jack hidden markov model speech recognit edinburgh basic american sign languag silver liang continu gestur interfac sign languag submit picard agent recogn emot percept american sign languag dynam displai exp human perform rabin juang introduct hidden markov model ieee assp page januari rehg kanad human hand track school comput scienc technic report carnegi mellon decemb jain identif gestur input hidden markov model proc annual confer applic comput page decemb pavel intellig encod asl imag sequenc extrem low inform rate comp img starner visual recognit american sign languag hidden markov model master media februari chou cursiv handwrit recognit speech recognit method page pentland augment realiti wearabl comput winter starner pentland american sign languag recognit video hidden markov model technic report mit media perceptu comput earlier version pentland american sign languag recognit desktop wearabl comput base video technic report perceptu mit media juli vogler metaxa asl recognit base coupl hmm motion analysi wilson bobick learn visual behavior gestur analysi proc ieee intl symp comp coral novemb ishii recogn human action imag hidden markov model proc comp vi pattern page young hidden markov model toolkit cambridg univ eng dept speech group entrop research lab washington
IR/729 5 preprint conceptu annot approach index inform system bertino barbara catania gian dipartimento di scienz dipartimento di informatica scienz centr nation de la recherch scienti www object data heterogen characterist graph sound import problem context repres queri content www object specialist possibl ad multimedia www object sort conceptu annot describ inform content greatli contribut solv problem intellig index retriev associ www object nal conceptu simpl natur languag form short text repres neutral descript inform content nl caption convert conceptu annot knowledg make translat system implement context recent european project digit conceptu natur languag introduct electron commerc todai relev applic area www applic system tend involv wide rang servic product inform dynam product catalog supplier search electron digit signatur bertino al conceptu annot inf system requir tool support ectiv retriev inform www inform todai www di er larg extent respect inform manag convent data manag manag system inform www fact relev kei data unstructur text www site di erent term denot data larg number linguist di erenc media data increasingli convei inform www todai recogn ectiv retriev select larg bodi inform data term metadata term data piec knowledg order inform structur content collect data tradit librari catalogu metadata metadata synonym knowledg describ structur content larg repositori multimedia inform audio speech textual repres digit form note unlik tradit data repositori www total larg unstructur inform case made page encod html format languag conceptu inform page relev metadata function consist sort conceptu organ unstructur inform space proper digit order facilit intellig retriev origin page part cluster queri retriev type digit media execut directli metadata level note metadata approach implement gener solut access mean singl metadata queri retriev inform data pertain di erent media metadata basi support ectiv index inform www class metadata scienti metadata ect semant media object provid sucient gener bertino al conceptu annot inf system access semant content dicult materi access support keyword semant featur relat physic structur www object order overcom limit conceptu annot introduc describ depth context www object base descript limit term descript complex event automat automat gener annot adequ describ state relat real intend behavior typic industri econom context allevi paper di erent approach suggest associ interest www search index oper usual web engin execut precompil larg index nal conceptu simpl natur languag caption form short repres neutral descript content object case textual text repres nl caption nl caption convert nal conceptu annot task accomplish index oper strategi usual process user queri search rst set pertin www object collect repres nal conceptu annot knowledg term perform automat translat nl tool recent implement context european acquisit norm reason esprit knowledg base natur languag techniqu associ metadata inform www object describ rstly framework project carri collabor depart comput scienc milan centr de cam concern speci cation bertino al conceptu annot inf system prototyp www distanc learn environ techniqu core recent approv esprit queri retriev digit esprit aim project improv current techniqu queri retriev textual document store sort digit world wide web digit semant content document import remark main goal project gener conceptu annot narr document www object persist storag conceptu annot provid ecient mechan retriev conceptu annot document aspect cover approach describ paper remark idea index explor base multimedia object rst nl comment object bulk exist experi direct uctuat techniqu make elementari semant categori includ wordnet applic extrem complex machineri cyc approach repres accept extrem posit paper organ section rst discuss detail annot problem section introduc languag repres conceptu annot approach present section section present outlin futur work annot problem type recogn metadata provid sucient gener basi ecient index retriev www multimedia object call semant ect semant media object describ content structur real semant approach semant featur metadata concern bertino al conceptu annot inf system extern identi cation framework physic consid descript true mean evid document imag physic characterist motion scene camera pan trade true semant techniqu approach describ web natur languag document recent meta content semant dublin resourc descript framework accept qualifi semant inform obtain inform sucient provid full mean data full retriev rout kla sheth color distribut featur valu imag yellow imag show index semant content realiz attribut manual extract approach repres tradit provid metadata sort semant approach semant limit keyword techniqu rang discrep choic keyword build index real fact keyword describ complex tempor structur video audio inform narr textual problem logic imposs pure keyword rst man bite dog bite keyword concept consid isol research recent make implement plausibl semant sort conceptu annot describ depth inform content www object retriev project im inform manifold ontobrok project implement conceptu annot gener mean descript logic languag bertino al conceptu annot inf system project mention except repres inform relat model augment featur base gener frame approach annot insert knowledg base user consult emploi advanc retriev infer techniqu make ontolog import step true semant approach ontolog sucient fulli render semant content www object industri econom interest corpor norm legal intellig typic electron document consist textual video audio state relat real intend behavior actor simpl descript concept integr descript mutual relationship concept descript role di erent concept instanc framework global event ontolog suppli rigid vision taxonomi pin dead concept singl ontolog describ semant content www object di erent choic describ world linguist utter includ verb type critic concern diculti creat quickli cheapli mention gener bookmark descript logic style digit object pertain sucient larg approach adopt overcom diculti natur languag base approach sucient gener annot www object assum associ www object nl caption describ content translat caption conceptu annot repres languag sucient power languag repres concept event remaind describ achiev bertino al conceptu annot inf system solut extens literatur knowledg languag endow featur make suitabl repres descript mean proper conceptu annot rst describ gener characterist present exampl explain featur languag detail gener descript core consist set gener tool structur integr describ de nition enum compon de nition compon suppli tool repres import notion concept de nition data structur symbol label physic human citi concept nition individu repres essenti design tradit structur oid identi set characterist featur concept insert hierarchi histor call correspond usual ontolog term fundament assumpt organ class concern di erenti notion instanti directli physic notion instanti directli branch class concept label concept concept figur special chair citi european direct instanc pari special gold color admit white gold red direct instanc enum compon concern formal instanc taxi pari concept class formal individu bertino al conceptu annot inf system figur upper level class ital type style repres concept roman style repres individu gener concept belong upper level physic modal event repres insid catalogu assum invari figur extrem simpli ed upper level class descript factual compon event proper dynam process describ interact concept individu plai role context repres make descript factual compon descript compon concern tool produc formal gener class narr gener bertino al conceptu annot inf system present contrast binari structur concept templat format central piec relat exist argument introduc mean role gener format predic templat previou denot symbol label identifi templat denot gener denot argument role predic pertain set role set context templat structur inherit taxonomi event instanc predic speci event move domain factual compon basic gener object mention formal characterist modal basic templat perman languag basic templat pertain context main charact human social bodi mean proper special obtain basic templat deriv templat concret implement applic signi exampl introduc main featur present signi exampl describ express nl gener di erent imag textual document audio document conceptu annot www imag object figur reproduc semant annot bertino al conceptu annot inf system exist subj girl nice cardin modal ly posit girl instanceof girl figur annot www imag repres syntax nice girl ly www imag occurr instanc basic bring main characterist event repres exist role complex argument introduc subj girl individu instanc nice cardin concept ly introduc gener argument repres gener nice cardin detail peculiar case ly argument repres gener concept individu locat attribut list individu beach complex subj argument syntax repres properti assert rst element concept list cardin properti girl nice cardin properti cardin specif construct belong special construct structur argument includ bind disjunct oper distribut oper collect oper attribut oper addit detail back slot data explicitli individu girl instanc bertino al conceptu annot inf system exist subj paul begin figur annot www textual code tempor inform concept make clear individu refer realiti instanc girl individu girl collect axiom set equal hold girl girl includ necessarili consid ident creat di erent moment time context total di erent event conceptu annot figur girl sucient import se context caption justifi explicit speci girl girl girl note requir characterist basic principl suggest avoid unnecessari individu conceptu annot textual object sentenc present figur code inform march paul admit directli found textual document tempor inform repres tempor de ne time interv mean repres predic occurr hold interv reduc point time singl timestamp tempor attribut point repres begin event presenc begin tempor conceptu annot www audio object figur present interpret make orang bertino al conceptu annot inf system insid www audio document hwang schubert exempli es interest semant phenomena translat gener idea obtain predic figur instanc basic templat pertain behav branch templat hierarchi gener mean result occurr express act identifi subj tempor possibl predic figur di erent predic express result compon mark presenc uncertainti valid repres symbol bind figur link previou predic occurr label oper pertain taxonomi causal bind list element symbol label figur structur repres link exist templat occurr figur oblig ment modul pertain modal modul suggest oblig endur pertain deontic modul seri modul tempor figur construct express absenc modul behav occurr mean behav concret initi order ful ll figur concret action result ect desir approach approach base architectur present figur main modul identi bertino al conceptu annot inf system behav subj human cardin produc subj human cardin obj orang amount observ date figur intent acquisit modul aim acquisit modul provid interfac user acquir web interest www de ne static dynam compound multimedia object associ www object short nl annot acquisit modul base assum nl caption www object dealt set priori interest www object ordinari search engin annot modul compon annot document conceptu annot construct nl caption ed conceptu annot repositori manag conceptu annot store persist conceptu annot manag conceptu annot repositori manag queri modul compon appli sophist queri mechan order retriev document satisfi user conceptu annot construct store secondari storag bertino al conceptu annot inf system nl lexicon conceptu acquisit modul annot modul annot conceptu manag modul queri modul www object user queri www object www object conceptu annot nl caption conceptu repositori annot conceptu annot figur architectur annot www object softwar modul implement java describ detail compon introduc main scenario architectur annot modul annot modul charg translat nl caption format basic translat mechan de ned context esprit project dealt problem comput express input nl text version parser base independ morpholog syntact di erent phase semant make common perman data structur reserv perman data structur class temp hierarchi import share structur complex mechan entail nl lexic entri semant pragmat inform categori conceptu data structur repres bertino al conceptu annot inf system conceptu includ pragmat inform text grammar rule quick inform extract ignor irrelev element trigger evok lexic entri rule activ predic templat temp hierarchi data structur directli manag annot modul assum construct phase architectur previou usual implement make common lisp orient environ carnegi framework partner decid version develop rdf descript de ning process world wide web metadata develop speci work group implement xml markup make direct label graph repres web resourc part collect document basic attribut give properti resourc prede ned vocabulari dublin core style part valu attribut text resourc rdf gener tool box implement speci case recent develop rdf er basi realiz complex data structur present rdf special construct structur argument rdf higher order statement ful ll structur bind occurr rdf repres templat insid temp describ formal properti inform annot modul translat gener conceptu annot rdf store insid repositori import recal actual state art natur languag process theoret imposs systemat obtain automat conceptu translat nl bertino al conceptu annot inf system short situat pragmat improv separ techniqu admit presenc conceptu descript incomplet make techniqu adopt form control natur languag order induc import simpli cation translat oper adopt solut inform provid common data execut addit inform domain interest user provid interact session result translat system suggest conceptu annot user ne addit knowledg conceptu annot repositori manag result translat repres set conceptu annot store central knowledg repositori conceptu annot web project store locat origin www object possibl www object metadata queri retriev oper origin document execut directli conceptu annot mean central repositori figur conceiv standard knowledg base order provid ecient access metadata conceptu make manag system store conceptu annot document document conceptu repres bind occurr simpli predic occurr occurr document assum store conceptu annot document insid dbm store retriev unstructur document current commerci dbm provid support eld conceptu annot repres bertino al conceptu annot inf system tool ecient tradit dbm consid accept advanc oper deal structur assum perform special annot modul queri modul main goal conceptu annot repositori manag store updat conceptu annot document ecient queri conceptu annot simpl select mechan advanc capabl manipul xml document requir order ecient support conceptu annot addit attribut store repositori conceptu store list signi concept instanc store global search date addit attribut ecient execut index retriev oper repositori note repositori manag compon access knowledg base reason disk access perform special softwar compon queri modul queri modul user explor characterist preselect www object queri express term give rise data structur call search pattern search pattern data structur repres gener framework inform search ltere uni conceptu annot repositori search pattern data structur predic role make explicit indic tempor interv uni cation hold conceptu annot figur successfulli uni ed search pattern style paul hospit absenc neg situat assum persist tempor environ origin event figur illustr search pattern timestamp search pattern figur constitut search interv link limit search bertino al conceptu annot inf system exist paul figur search pattern uni cation slice time consid explor order queri knowledg base queri system power execut sort match match match found occurr correspond queri suppli inform search due formal manipul conceptu annot figur pose queri style pictur di variant exampl queri procedur characterist approach transform rule match algorithm develop context project user queri translat search pattern sequenc search pattern store conceptu annot directli unifi origin queri unifi search pattern obtain infer origin uni cation pattern conceptu conceptu annot obtain result present user format scenario architectur present figur main preprocess phase system gener conceptu annot input document submit www user associ nl interfac acquisit modul document annot annot conceptu annot repositori document repositori manag extract bertino al conceptu annot inf system conceptu annot document attribut valu requir index store repositori queri phase queri submit queri system form search pattern queri primit servic provid repositori manag sophist directli support retriev conceptu annot satisfi document document subsequ construct learn materi themat report dynam product catalog applic present approach index retriev www conceptu annot repres basic idea approach associ object nl caption conceptu annot gener approach basi recent project core tool develop previou european work present paper extend wai rst interest subject investig consist idea coupl conceptu annot icon visual languag media stream style conceptu descript document ordinari concept mix media stream icon primit primit group gener class media stream class exist hierarch classi cation integr residu concept hierarchi constitut dicult endeavor topic investig implement repositori approach support bertino al conceptu annot inf system execut larger number queri directli ecienc system refer weinstein automat extract fact press gener stori proc confer appli natur languag basili pazienza ir tool user proc workshop tool rocquencourt bertino ferrari conceptu tempor model multimedia data ieee tran knowledg data system speci cation gener multimedia present ieee tran multimedia sheth overview metadata manag multimedia data multimedia data page mcgraw york borgida live languag principl semant morgan san francisco bradlei xml companion read mohan index recogn visual shape ieee tran machin conceptu view web intellig access heterogen proc fourth knowledg meet davi media icon visual languag video annot proc ieee symposium visual lo dogac guest editor special section electron commerc acm sigmod studer enabl intellig access www proc knowledg acquisit system franconi treatment plural plural quanti cation base theori collect mind ontolog categori proc fourth int conf principl knowledg san morgan kaufman guha lenat enabl agent work commun bertino al conceptu annot inf system gupta issu present workshop web inform data manag washington web inform servic base descript logic proc workshop tool rocquencourt hwang schubert meet interlock organ approach gener proc int joint confer arti cial intellig page san morgan kaufmann ieee comput special issu imag retriev system ieee jacob extract inform commun jacob innov text interpret arti cial lassila swick resourc descript framework model syntax speci cation technic ordil queri heterogen inform sourc sourc descript proc int conf larg page miller lexic english commun object design xml data server build web white paper stonebrak retriev relat imag ieee finin kernel text understand system arti cial proc workshop control languag applic centr comput linguist katholiek universiteit augment knowledg base natur languag document proc special confer natur languag process knowledg base access inform world wide web proc workshop tool rocquencourt daniel metadata workshop report technic oclc onlin comput librari dublin bertino al conceptu annot inf system knowledg intellig inform retriev proc workshop intellig access digit semant model content natur languag document proc special confer natur languag process compon hybrid knowledg languag semant network arti cial intellig pergamon knowledg acquisit complex narr text technolog proc knowledg acquisit system knowledg tool encod mean complex narr text natur languag engin special issu knowledg natur languag process implement tempor knowledg potenti legal narr inform commun technolog law special issu model build make corpor knowledg repositori knowledg model proc springer verlag al environ queri retriev digit document lnc proc int symp page springer verlag structur retriev complex predic argument proper conceptu languag lnc proc int symp methodolog intellig page springer verlag automat partit video multimedia
HCI/730 4 commun system support commun system okamoto toru ishida depart social kyoto yoshida kyoto japan corpor san ca usa receiv februari manuscript receiv abstract opportun intern collabor commun peopl heterogen cultur import electron commun support support offer environ particip enjoi share background profil visual function show topic base profil cultur displai object show feel identifi discuss implement empir evalu system design support commun real world remot locat empir evalu conclud system add function support context languag skill type environ context keyword commun larg social interact okamoto al introduct electron commun support system studi develop support collabor compani research activ comput aspect system impact busi offic laboratori discuss extens groupwar research aspect consid cultur case peopl heterogen cultur interact aspect process interperson understand social actual examin number internet user east asia expect million internet bring great number commun true compani advanc foreign compani enter domest market opportun intern collabor commun peopl heterogen cultur manufactur subsidiari countri research work research commun intern import interest aspect electron commun support interact research area differ address enabl satisfactori commun studi kind commun commun comput approach inform commun earlier stage groupwar collabor compani research activ support commun larger research area commun comput factor commun comput share prefer knowledg gener consensu support everydai life assist social event support social encourag peopl factor commun comput support commun system research paper adopt theoret framework commun comput extend support commun common concept research environ present share inform topic peopl space heterogen usual system provid virtual space interest user trial provid implement aim provid support support mutual understand provid share content support mode commun nearer commun support provid environ particip enjoi share background profil visual satisfi system larg screen displai inform share particip paper describ design implement system deal commun real world remot describ evalu system system section describ gener featur commun environ larg screen section describ evalu support commun real section describ network support commun local remot place support commun larg screen gener concept design commun tool design tool support commun common ground common ground process partner creat share awar knowledg assumpt common okamoto al nonverb cue social interact nonverb cue express emot gener qualiti attitud person topic peopl attitud relationship situat role expect social interact characterist situat peopl understand social determin action role relev system paper enabl concept incorpor show share inform base profil cultur background interfac larg screen expect nonverb displai particip real imag shadow cue common discuss section compar system section section show share inform common featur share current commun system commun comput system support provid virtual confer desktop monitor larg screen desktop typic creat confer room displai particip screen virtual space casual meet larg screen connect locat creat confer room share peopl remot locat unlik system mention system paper focu support content approach support method enabl user understand tool interpret method present inform system provid read paper support commun system addit inform cultur characterist differ user partner share project topic relat import effect due share inform relat interact common inform earli stage peopl begin find kind common interest difficult find cue commun commun peopl cultur show share inform import order promot commun misunderstand recogn differ peopl intern project includ compani research organ peopl collabor place remot place troubl due misunderstand featur differ easili happen import cultur advanc interfac larg screen larg screen effect support cultur commun crt monitor user move freeli wider space system small user correspondingli narrow physic space larg screen user plai freeli system wider worri relat screen user project larg project space displai inform user screen front user provid inform relat posit real world natur provid inform locat tradit desktop interfac user inform glanc share view easier okamoto al larg screen share particip easili inform screen peopl screen draw join transmit nonverb inform easier meet remot requir transmit nonverb inform facial express gestur import system make gestur express legibl creat effect nonverb commun recent system provid peopl inform featur develop project aim support interperson interact share larg screen displai particip real imag shadow commun system support meet remot customari project imag screen clear show real imag particip case effect show user local order attract system implement form decid locat system support system discuss displai method attract engag particip local system displai shadow local particip screen front remot system displai real imag remot particip screen local particip transpar shadow project space remot particip shadow black shadow shadow network transpar mirror imag black shadow user link inform clear face mean particip share inform shown real imag local show inform user shadow natur support commun system real inform present screen shadow inform user directli present real video imag implement depend environ system local easier user understand shadow compar system chat system avatar icon avatar icon real user map icon relat avatar cumbersom addit ident shadow natur oneself physic interact correspond particip shadow natur intuit local interfac simpli displai mirror video particip user uncomfort particip time shadow subtl duplic interact place case black shadow problem person partner overlap stand front partner decid transpar mirror imag black shadow network implement system base common network system system aim differ system locat support local network support local remot commun share inform web page includ common topic share inform user network cultur experi design decid content larg screen base aspect section common topic common topic fundament factor commun network okamoto al misunderstand show background differ user shadow implement shadow black silhouett transpar imag network detail descript shown section select inform network select oper inform oper support comparison system shown tabl tabl comparison network network locat user local remot black shadow particip transpar imag local user video imag cultur experi share inform web page includ common topic select inform support support confirm effect point view empir system support commun real world section describ system find topic mon displai web page relat topic larg screen shadow system awar augment real enabl user awar user common interest make commun design featur import support augment larg screen displai profil common interest figur show concept figur show support commun system present topic user univ shadow user user univ profil user concept actual fig displai shadow particip object screen profil shadow identifi system enrich encount encourag present web page common topic connect line topic shadow show group interest topic implement figur show system configur consist sgi sgi connect ethernet connect larg graphic screen indi connect output video camera imag video camera process video process result main process main process gener screen imag profil store profil web data video process system work gener shadow user compar current imag background distinguish particip cloth color averag pixel chest area identifi particip store valu input system movement comput continu frame color locat reduc user system read profil method prototyp suffici applic peopl chang system work kind small activ badg system meme tag robust futur version okamoto al profil file main process video process indi user kyoto univ ski world wide web user human media experi room user kyoto univ tenni larg graphic screen www page video camera user user inform imag data fig system configur regist advanc web page topic common keyword user found string system search web page select keyword displai result page user screen system search page regist system manag advanc search gener search system size topic displai window reflect physic distanc user topic window small size approach topic window size encourag user approach idea confirm topic list support commun system evalu observ actual peopl countri section describ experi observ analysi happen thirteen peopl particip japan unit franc industri rest graduat undergradu student experi english person talk fifteen minut scenario student depart pair particip advanc particip involv experi prepar common topic pair questionnair web page repres singl common topic pair experi web page topic chosen common topic profil obtain feedback questionnair administ experi item report rate scale twelv thirteen particip smooth system relat talk topic present topic fig questionnair lowest figur user answer talk smoothli differ topic user talk topic system present user relat topic observ analyz video record total okamoto al understand differ encount exampl collect video begin user check profil screen particip face screen turn face user relat screen content occur pair extend includ topic user particip commun due languag talk profil web page shown system pair face screen talk face partner frequent turn face back screen talk topic long bodi turn pair japan unit pair japan case home page strong posit reaction individu page ensu user move case confirm featur commun environ inform directli relat home plai role initi topic frequent refer languag barrier partner displai inform topic concentr talk addit work start topic find appar effect shadow base observ short questionnair area futur work expand rang displai includ gener topic expand support user give feedback system displai support commun system support commun remot locat describ system call network video technolog network similar meet system make nonverb inform ey gaze facial gestur easier read particip mitig demonstr effect screen size percept partner commun environ recent develop aim support gaze user special system peopl commun system project local remot user screen video transmit kei network displai augment displai inform cultur background describ design implement network describ result system student japan unit state design network figur show concept network figur show imag system figur actual kei featur share view experi discuss share view network imag remot user displai larg imag local user overlap screen transpar mirror imag style commun environ benefit particip place map greater share environ compar user video confer gestur refer okamoto al background imag user user user shadow background imag topic select icon american user user user real imag cultur background inform topic select icon real imag overlap shadow cultur background inform concept imag fig network fig actual network screen commun verbal commun nonverb inform import compon success displai make nonverb cue enhanc aspect commun kind displai technolog suffer problem due person partner overlap stand front partner network particip behavior partner front imag transpar experi inform support commun system user network easili develop rapport touch inform background readili displai kind inform cultur languag knowledg includ languag train confid nativ languag foreign languag year studi confid speak cultur literaci experi includ experi live cultur understand wai long cultur affin ti includ inform friend ti cultur friend countri inform enter user web form start system cultur inform shown arrai particip nativ languag inform displai characterist color particip easili map inform user base locat color item select gestur screen special plate simpli recogn color item categori shown titl user select detail version observ particip understand particip find interest background particip figur easili understand remot particip chang kind inform displai screen implement network section describ implement network system figur show system configur devic chang robust devic gener applic okamoto al titl titl titl detail inform titl titl select titl detail inform fig content select fig chang kind inform screen system work client video process send input imag draw imag client local client screen imag client displai case local system detect differ imag background imag record cut creat mirror make overlai screen voic process simpli send input voic output voic client server server process inform cultur background data send client synchron content client video process process compon convert cultur inform obtain form data item manual convert content displai english piec inform shown particip locat content server client user select kind cultur inform specif piec point devic user support commun system speaker microphon audio output audio input client video input ccd camera projector video data voic data sgi voic process video process video output cultur background data synchron displai content server server process cultur background data file fig system configur sgi client voic process video process www browser sgi part cultur background data process convert hold flat plate system detect locat input imag ccd camera detect point place screen system kind cultur inform displai point locat piec system pop detail inform item user special techniqu user identif simpl method user select user assum implement client server run silicon graphic evalu network evalu system observ actual undergradu student japan unit state method pair student particip pair consist student japan student unit state student japan okamoto al countri studi english student unit state class japan studi month particip enter cultur inform web experi began network system tool support user instruct task network system evalu system particip told task work make student network system twenti minut task result obtain opinion questionnair administ experi item report rate scale fourteen particip trustworthi pleasant safe secur entertain american fig questionnair evalu network lowest impress partner network system partner rate system rate posit inform easi easili feel displai easi interest user wrote time twenti minut long introduc total support commun system interfac commun commun comparison american student answer posit american student student experi commun american student observ video log experi typic flow network system particip talk affili enjoi talk travel experi countri topic current environ particip live began pattern observ cultur inform particip read inform screen concentr speak particip talk stare inform case particip relat inform topic directli observ particip began chang content particip begin observ american student show finger partner partner hear sentenc bilingu particip spoke languag student spoke american student spoke system system problem imag latenc due system resolut machin complaint system perform confirm featur commun network environ user rate system posit user gestur environ special attent system transpar shadow user understand point okamoto al find appar effect feel exist discuss factor support real world remot discuss evalu system design support kind social actual empir confirm effect share inform common topic frequent refer languag barrier user experi commun frequent refer common topic appar effect cultur background found interfac movement gestur special attent system develop system aim natur mode nonverb function design enabl oper verbal voic commun displai shadow shadow handl inform onscreen experi network opinion shadow point devic find interfac feel exist effect identifi user confirm import speed interact system feedback imag latenc user incorpor user feedback displai complaint imag latenc user network user make point devic latenc larger problem system incorpor user feedback find effect cultur feel exist effect shadow system experi includ person point futur work support commun system discuss import tool support earli social collabor support present share inform base profil cultur background interfac larg screen repres particip intuit natur wai interact discuss evalu system system support commun present web page relat common interest particip locat place system show shadow larg attract particip displai common topic web page base profil observ actual found inform directli relat particip refer initi particip frequent refer content screen situat hard commun differ nativ languag network remot commun particip share environ displai screen encourag understand user show cultur experi background inform particip select examin detail inform background gestur point devic found user system transpar shadow point function result empir confirm share inform refer situat hard commun differ nativ user movement gestur natur interfac project system support collabor commun user aid promot discuss knowledg share structur visual topic system provid cue show profil section support commun differ support method okamoto al mobil agent inform manag mobil comput displai person displai share inform larg user feel share inform approach opposit interest approach combin mobil comput handl privat inform larg screen handl share public inform share differ profil enter user extract profil web page biggest differ handl movement user move freeli share web page relat user user acknowledg stanford japan center cooper experi student particip experi fill questionnair refer laboratori activ badg tag commun move confer intern confer comput support cooper work pp user interfac approach commun workshop design commun design commun network social interact ipsj vol pp gener vol pp intern confer exhibit practic applic intellig agent technolog pp commun collabor global inform john wilei collabor vol pp environ collabor concept commun support commun system collabor global inform john wilei pp video mediat commun intern confer comput support cooper work pp augment human interact enhanc person mobil commun comput support lectur note comput scienc pp nishimura support casual meet intern confer comput support cooper work pp system support commun knowledg commun comput support lectur note comput scienc pp ichikawa videoconferenc virtual social intern confer comput support cooper work pp cultur commun intern confer interact volum pp nishimura awar support commun comput support lectur note comput scienc pp media cambridg desktop conferenc intern confer comput support cooper work pp meet schedul desktop vision intern confer practic applic intellig agent technolog pp
DB/731 3 structur perform support algorithm activ disk acharya joel saltz dept comput scienc dept comput scienc dept comput scienc maryland california maryland colleg park santa barbara colleg park abstract growth usag trend larg support architectur scale process power dataset grow trend process demand larg support grow faster improv perform commod processor meet research recent activ architectur integr substanti process power memori disk unit examin util activ disk support answer question restructur algorithm common support task util activ perform activ disk compar tradit server activ disk integr softwar architectur support introduct growth usag trend larg support architectur scale process power dataset grow trend process demand larg support grow faster improv perform commod processor result winter larg survei document growth support support grew tb tb usag trend chang user expect larg primarili archiv storag frequent entireti patterson al quot observ greg processor doubl perform custom doubl data storag month data shape busi practic meet research recent activ architectur integr substanti process power memori disk unit architectur code download execut data read disk util activ applic partit compon compon kei idea offload bulk process processor host processor primarili schedul combin result individu disk activ disk present architectur direct reason number processor scale number architectur equip process requir rapidli grow dataset process compon integr process power evolv disk drive evolv similar evolut disk cach drive disk cach larger examin util activ disk support answer question restructur algorithm common support task util activ advantag activ partit algorithm process offload processor perform activ disk compar tradit server activ disk integr softwar architectur support address question wai present activ disk algorithm suit common support datacub oper extern datamin associ rule retail transact data materi view deriv algorithm effici algorithm literatur compar perform activ disk share memori multiprocessor server task share memori multiprocessor wide relat al estim machin sold handl relat show program model activ disk mesh softwar architectur relat activ disk provid introduct activ disk activ disk integr process power memori disk drive code download execut data read disk util activ applic partit compon compon kei idea offload bulk process processor host processor primarili schedul combin result individu disk figur present schemat activ disk architectur acharya al program model code dram dram dram dram interconnect host dram extern network figur schemat activ disk architectur interconnect fibr channel arbitr loop multipl loop connect note individu disk commun directli host interact extern client handl host interact peer disk host stream input gener stream output input stream output stream file rang repres stream stream access standard interfac deliv data buffer size priori initi function run instal process function run data scratch space alloc behalf instal automat reclaim set paramet custom final function run termin consum data input stream call initi oper oper initi program check valid advantag corrupt layer disk provid function initi skip subrang input stream notifi layer disk skip subrang deliv safe implement algorithm futur depend data previou algorithm index decid chunk data read implement input stream index file data file data deliv index stream decid part data stream read skip import featur model multipl stream merg buffer deliv stream merg interleav arbitrari order deliv singl stream destin larg number commun peer avoid needless poll individu stream alloc free memori memori manag layer disk memori access sandbox defin buffer input scratch space binari analyz softwar violat reject program model simplifi analysi defin natur sandbox commun environ restrict input output stream sourc sink stream program part instal determin input stream output stream advantag handl buffer schedul layer reduc complex heterogen environ activ disk convent process data convent disk transpar execut host dedic comput activ disk requir thin layer oper system support disk servic memori stream commun schedul model simplifi memori manag memori alloc contigu block size priori lifetim block model simplifi commun support requir stream buffer alloc manag depend amount memori alloc multipl buffer overlap data movement comput model simplifi schedul readi run data input stream algorithm present activ disk algorithm common support datacub oper extern datamin associ rule retail transact data maintain materi view describ share memori multiprocessor algorithm task smp algorithm compar perform activ disk smp start effici algorithm literatur adapt architectur program model activ adapt algorithm program model note overlap handl os multipl buffer stream adapt algorithm remot queue move data processor volum data transfer natur data remot queue suitabl task stripe file disk kb chunk size disk advantag aggress processor issu kb asynchron request request transfer kb note sort shuffl entir dataset write back partit disk separ read write group processor address priori partit input dataset processor maintain share queue block order disk processor lock queue grab block queue techniqu reduc seek cost disk sequenc request roughli order data laid disk priori partit dataset result potenti long seek request sql select simpl algorithm select filter tupl relat base predic aggreg comput singl aggreg tupl relat activ disk algorithm perform local forward result host data disk smp processor dynam select kb chunk input relat directli write result destin buffer select aggreg perform sql oper comput vector aggreg index list attribut partit relat disjoint set tupl base index comput aggreg set tupl graef show techniqu outperform techniqu implement oper algorithm start point algorithm activ disk algorithm perform step disk perform local long number aggreg comput fit memori run space ship partial result reiniti memori accumul partial result smp processor comput local version result processor merg end note gener significantli larger result select perform maintain aggreg datacub gener form aggreg relat comput aggreg index valu multipl aggreg datacub comput combin list attribut effici method comput datacub present call start point algorithm repres datacub lattic relat direct edg connect gener attribut edg sql aggreg avg count raw data abc ab abc ab bc ac bc ac ab bc figur search lattic pipelin algorithm bold line search lattic minimum span tree comput algorithm estim size individu hand side show pipelin data box bottom read disk weight reflect estim size determin set groupbi perform comput minimum span tree lattic figur schedul sequenc pipelin comput part singl scan data result pipelin store back disk input pipelin figur exampl individu techniqu activ disk algorithm partit memori disk proport estim size perform pipelin final combin oper partit rang valu attribut group disk combin result peer rang valu disk perform local long number aggreg comput fit memori run partit partial result ship partit disk rang valu smp algorithm perform batch manner similar result result written disk note datacub perform multipl singl perform comput byte read comput gener commun significantli data extern parallel start point sort algorithm base long histori extern sort research commun hold record fastest extern sort indi record activ disk algorithm form bucket number disk examin record append bucket destin disk buffer forward destin disk sort buffer partial sort write disk send output stream sort partit abc abc abc abc ad ac ab abc ab ac ad abc combin figur schemat organ datacub run activ combin shade box input stream alloc hash tabl scratch space size proport estim size pipelin complet execut run partit local base kei send partit combin destin disk contribut written disk note stream destin combin merg creat phase map stream attach merger input merger select lowest kei input stream copi output stream map output note data host merg local activ disk smp algorithm phase thread processor read data move tupl pointer bucket sort bucket sort write bucket phase thread processor merg sort partit creat phase reader read block sort partit set merg merger select kei current block partit copi write writer write buffer disk activ disk algorithm fulli pipelin overlap read send data peer sort write data smp algorithm overlap read write oper perform synchron al recommend oper overlap pass algorithm repartit entir input disk pass activ disk algorithm disk oper partit smp algorithm disjoint set disk read write phase divid total number disk group note pass sort requir commun repartit entir sort perform significantli commun datacub join algorithm task join partial sort make pass kei size cleanup buffer origin algorithm sort merg merger pass pass figur organ extern sort maintain bucket destin disk scratch space bucket forward combin tupl disk scratch space space tupl sort written disk creat run stream destin merg figur present structur merger merg multipl run disk sort file note pass local activ disk relat join perform join step partial sort relat pair loop base join algorithm pass algorithm pass pass repartit creat sort run pass relat pass algorithm similar pass maintain heap head sort run relat perform join pick element heap pass algorithm larg commun requir pass activ disk algorithm local disk oper partit smp algorithm disjoint set disk read write pass partit total number disk group note pass join requir commun sort join repartit entir commun requir similar focu determin frequent itemset mine associ rule retail transact data algorithm start point algorithm algorithm pass count distribut algorithm agraw al cluster candid itemset class class repartit input data set pass local requir commun processor perform remain comput singl scan partit unlik extern sort algorithm repartit fraction input dataset exact fraction depend paramet algorithm run algorithm origin share memori multiprocessor adapt activ disk revert count distribut pass origin smp algorithm perform creat view foo select line figur view grain modifi batch updat counter itemset origin algorithm built larg triangular arrai counter pass notic larg fraction element experi optim memori consumpt arrai note commun counter pass significantli reduc version input data pass commun smaller join datacub maintain materi view deriv relat defin term base relat store materi view view speedup queri support materi view cach version view increment view mainten cach view consist base relat base relat modifi mumick al effici algorithm maintain view figur borrow idea defer mainten view algorithm describ core algorithm parallel mainten view describ activ disk smp version relat partit disk partit attribut view defin figur relat line item partit attribut store sale item id item id auxiliari view creat base relat appli select project oper auxiliari view relat partit relat sort updat base relat proce immedi base relat consist time updat auxiliari view defer ad tupl delta updat auxiliari primari view propag refresh time algorithm propag updat join time illustr structur algorithm describ oper sequenc join input join sort auxiliari view delta creat sort run figur merg oper materi view algorithm oper execut pipelin concurr produc obtain union output pipelin note pipelin order pipelin execut creat sort run merg sort run sort run updat sort version recal input version assum sort detail merg oper shown figur partit tupl base buffer destin disk send buffer destin disk receiv tupl disk creat sort run write disk note step receiv oper overlap creat sort run merg sort run sort run updat activ disk algorithm perform oper disk algorithm oper sequenc phase phase perform join consist local sort run creat merg oper distribut part data join repartit delta subsequ join sort run arriv destin disk smp algorithm similar fc hub cpu cpu dram fc node node node node node network interconnect figur schemat share memori architectur assum experi evalu configur comparison configur ident disk configur equal number disk rest follow configur guidelin suggest expert defin configur disk understand impact scale individu compon identifi bottleneck resourc individu perform addit experi select scale individu compon assum disk similar seagat disk famili disk speed format media transfer rate averag seek time ms maximum seek time ms support scsi fibr channel interfac activ activ disk assum processor mb integr disk disk connect interfac bandwidth disk directli address commun commun client handl host mhz pentium ii gb ram identifi bottleneck resourc individu studi altern configur individu aggreg bandwidth serial interconnect memori integr disk unit mb mb softwar scale bandwidth serial interconnect advantag addit memori number buffer alloc stream configur toler longer commun latenc share memori multiprocessor smp guidelin configur support server quot put processor box amort cost enclosur put memori box avoid disk attach disk capac stripe data multipl disk quickli load inform memori assum smp configur similar sgi origin board mhz directli share mb interconnect board latenc engin sustain bandwidth subsystem node total similar connect network fibr channel interconnect disk figur illustr smp configur note amount memori scale number processor configur gb configur gb assum machin ran standard oper system irix provid asynchron interfac disk stripe individu file assum machin provid remot queue abstract suggest brewer al studi impact variat studi altern configur scale bandwidth serial interconnect simul conduct develop simul call simul architectur detail model network librari devic driver model processor interconnect model behavior disk control devic simul develop al detail disk model support zone spare segment defect prefetch bu delai control overhead valid disk drive publish disk specif scsi logic achiev high accuraci worst case figur averag time model simpl model paramet startup transfer speed capac interconnect model behavior user trace process time request individu task model variat processor speed scale process time acquir trace process time implement algorithm dec alpha workstat mb memori ran algorithm dataset request size experi algorithm amount memori explicit paramet datacub materi gener trace multipl memori size simul architectur amount memori model oper system behavior paramet repres time individu oper system context switch time queue request time servic interrupt obtain pentium ii run linux charg fix cost queue request activ model preliminari implement support schedul manag stream commun modifi version driven disk oper system layer written interact api addit paramet assum system call context switch cost charg initi disk request servic interrupt disk mechan execut protect domain cost reason model board connect low high bandwidth interconnect model sgi origin block transfer suitabl algorithm move larg volum data larg chunk synchron remot queue global barrier primit provid sgi origin cost model subsystem similar subsystem origin disk model driven stripe librari written top access librari dataset gb dataset task join gb dataset gb dataset describ structur dataset task dataset million tupl byte test singl field select aggr sum oper field field million distinct valu group attribut dataset million tupl tupl attribut attribut attribut remain aggreg attribut sum aggreg function number distinct valu attribut creat dataset scale dataset paper algorithm dataset tupl uniformli distribut kei total number tupl million creat dataset base standard sort benchmark dataset tupl uniformli distribut kei project oper extract field tupl relat gb million tupl output join mb dataset million transact total number item million averag length transact item gener dataset quest datamin dataset gener obtain ibm almaden gener frequent minimum support paramet materi dataset gb deriv relat million tupl size delta relat assum gb million tupl assum tupl deriv relat field join oper produc delta view gb result figur compar perform task compar configur architectur result task configur size normal respect perform task activ disk configur size make ffl activ disk configur perform smp configur note true task configur examin experi includ task small amount comput byte task substanti larger amount comput byte note spite fact activ disk mhz cpu smp configur mhz cpu ffl perform advantag activ disk configur size support task examin run time faster activ task run time faster activ disk largest perform differ fold task larg data reduct activ aggreg select task repartit part input significantli faster fold activ disk note perform activ disk scale configur due serial result collect host ffl task repartit part input perform advantag primarili due local natur subsequ process smp data access phase pass activ disk data pass interconnect repartit aggr select sort join cube normal activ smp aggr select sort join cube normal execut time activ smp disk configur disk configur aggr select sort join cube activ smp aggr select sort join cube normal execut time activ smp disk configur disk configur figur perform task compar configur architectur result task configur size normal respect perform task activ disk configur size note rang bar smp configur miss complet simul time figur show perform task scale architectur perform task satur earli smp configur task perform domin aggreg achiev benefit larger configur task perform scale activ disk perform activ disk satur earlier compar task select larg host bottleneck combin result individu disk note join achiev perfect scale architectur suspect due cach capac effect merg phase similar result report al run node experi run disk disk disk disk aggr select sort join cube ideal disk disk disk disk aggr select sort join cube ideal activ disk smp figur variat perform task configur size architectur result task architectur normal respect perform task configur architectur ideal curv refer perfect scale note join achiev perfect scale architectur suspect due cach capac effect merg phase figur examin impact vari interconnect architectur note doubl interconnect bandwidth larg impact perform smp configur task interconnect major bottleneck task smp configur activ disk join achiev albeit perform improv interconnect bottleneck activ disk point activ disk configur interconnect outperform smp configur interconnect time faster task aggr select sort join cube mb mb mb mb aggr select sort join cube mb mb mb mb configur configur figur impact vari interconnect bandwidth architectur result task configur normal respect perform task activ disk configur size stand activ disk stand smp discuss discuss issu discuss integr activ disk softwar architectur support give indic cost compar configur activ disk share memori multiprocessor relat long dataflow base architectur graef model oper implement schedul resembl close relat system oracl program languag exodu genesi starburst oper implement model call synchron similar commerci barclai al ideal suit dataflow commun adopt dataflow approach describ implement parallel program model activ disk close resembl base model relat close oper stream model oper attach stream perform oper iter function scratch space correspond state record iter graef type state record iter argument local variabl iter activ invoc oper scratch space close correspond expect program activ disk integr softwar architectur support rel remain vendor integr activ disk softwar al initi reaction activ disk industri expert suggest activ disk succe requir minim chang exist softwar initi reluct overcom reason program requir integr activ disk exist softwar extens situat requir modif exist vendor inflex exampl includ migrat server smp recent incorpor java virtual machin cite exampl oracl project plan integr java virtual machin engin java code call sql sql call java code schedul ship oracl ibm extens server java function store procedur function sql express comput complex function valu row queri creation tabl provid indic ratio architectur compar estim price architectur node configur estim price smp configur sgi origin project lo alamo lab quot list price sgi origin processor gb memori million estim cost gb memori estim cost configur studi paper million estim price activ disk configur seagat disk processor mb ram fibr channel interconnect premium compon assum dell host fibr channel host bu adaptor corpor price disk configur add activ fibr channel adaptor relat work idea programm processor disk processor ibm user download channel program make request behalf host program implement ibm channel program link list machin late level processor integr processor track processor head design share disk cach multipl processor multipl disk differ machin late todai activ disk unlik machin processor activ disk commod compon evolv disk evolv unlik interconnect todai serial interconnect fibr channel provid high bandwidth commod disk drive unlik limit repertoir oper perform activ disk advantag algorithm research architectur provid effici implement wide varieti oper activ disk perform oper data imag process process riedel al evalu activ disk architectur show activ disk provid scalabl perform nearest neighbor search multimedia frequent itemset determin datamin associ rule retail transact data algorithm result algorithm achiev gain activ disk base analysi technolog al architectur chip integr disk unit disk unit connect argu architectur offer potenti price perform advantag tradit server architectur support volum data process cost fetch data optim algorithm matter set effici pipelin stage perform process data read disk pass stage model research barclai al techniqu parallel load larg similar techniqu gamma volcano parallel al program model schedul task cluster main studi number activ disk configur perform smp configur wide varieti support task note true task configur examin studi includ task small amount comput byte task substanti larger amount comput byte spite fact activ disk mhz cpu smp configur mhz cpu point activ disk achiev perform small fraction cost share memori multiprocessor server perform smp configur limit interconnect larg configur interconnect sit processor data task pass multipl time result activ disk configur interconnect outperform smp configur interconnect time faster perform advantag activ disk configur size task examin studi run time faster activ task run time faster activ disk largest perform differ fold task larg data reduct activ disk task repartit part input significantli faster fold activ disk note ad memori activ disk limit advantag result mb perform disk disk configur disk configur stream natur support task note close correspond program model activ disk model relat system expect program activ disk integr softwar architectur support rel acknowledg greg simul moham zaki implement algorithm implement quest datamin group ibm almaden dataset gener ioana stanoi amr el abbadi discuss maintain materi view jim recipi continu support refer sussman tune perform parallel applic fourth acm workshop parallel distribut saltz activ program algorithm evalu asplo page oct agarw super scalar sort algorithm risc processor acm sigmod intern confer manag page sarawagi comput aggreg intern confer larg page swami mine associ rule set item larg acm sigmod confer manag page agraw shafer parallel mine associ rule ieee transact knowledg data patterson sort network workstat cluster make fast case common submit faq hsiao concept capabl comput acm tran dec load dataflow parallel sigmod wise extens manag system ieee transact softwar remot messag queue optim atom proc page algorithm defer view mainten proc page ibm java enabl dewitt direct multiprocessor organ support relat manag system ieee tran jun schneider perform analysi gamma machin sigmod gibson al file server scale secur disk acm intern confer measur model comput system patt simul environ version refer manual technic report dept electr engin comput feb graef encapsul parallel volcano queri process system sigmod graef queri evalu techniqu larg acm comput jun grai put storag devic talk workshop storag comput june grai sort benchmark home page pirahesh data relat aggreg oper gener intern confer data page februari shekita starburst dust clear ieee transact knowledg data jiang singh methodolog evalu sgi origin proc intl conf measur model comput system page june hellerstein case intellig disk sigmod sgi highli scalabl server proc intl symposium comput page june search processor manag system proc smith design rotat associ memori relat applic acm tran mar portabl tool perform analysi proc usenix technic jan melton simon understand complet guid morgan meyer oracl java virtual machin proc page panel crop java virtual lomet risc machin sort acm sigmod intern confer manag perform evalu relat associ processor acm tran jun futur comput unpublish talk juli patterson al intellig ram industri architectur intern confer comput patterson comput quantit approach morgan ibm quest data mine project quest retail transact data gener widom make view data wareh proc richardson carei program construct system implement exodu proc faloutso activ storag larg scale data mine multimedia applic confer larg wilk introduct disk drive model ieee march smith associ processor applic ieee tran seagat technolog product juli public number rev logic track devic advanc logic track devic acm tran sep trend share memori ieee su cellular system larg proc page graham effici fault isol acm symposium oper system page wang file system intellig disk talk june winter giant walk vldb survei program sep winter big vldb survei program aug li local algorithm parallel associ mine annual acm symposium parallel algorithm
DB/732 3 tempor queri oper xml depart comput inform scienc norwegian scienc technolog norwai abstract previou paper introduc queri oper order support xml queri languag support tempor oper queri oper make queri histor retriev document valid queri describ algorithm execut queri discuss document content index effici execut oper tempor queri queri execut introduct queri xml data perform directli store xml data xml data creat xml data collect web xylem content xml xml data seldom static document document document updat search histor retriev document valid queri order realiz effici tempor xml issu includ effici storag version xml effici index tempor xml tempor xml queri process concentr issu tempor xml queri execut base queri oper describ algorithm realiz queri oper organ rest paper section give overview relat work section give overview work present order put algorithm present paper context section describ algorithm execut oper section discuss bottleneck scalabl issu section conclud paper outlin issu research relat work model repres semistructur data languag queri present chawath al queri translat lorel languag queri semistructur view stratum approach work chawath al extend al work author ercim fellow group franc storag version document studi marian al chien al chien al access previou snapshot retriev approach relat work present introduc valid time featur xml present grandi mandreoli relev work includ work tempor exampl tempor document tempor object queri languag tempor object system tempor xml queri section give introduct tempor xml queri queri oper aspect present provid order make paper time element ident import issu pose addit difficulti context context xml document retriev web case xml data time ident issu discuss detail time xml discuss aspect time tempor common aspect transact time valid time context xml case queri point view similar transact local storag document system store xml exact timestamp xml storag copi xml document gener time xml time document retriev web note document retriev point result inconsist view document document refer document document updat version necessarili version document similar valid document includ document time document post concentr support note techniqu present equal applic addit oper introduc coalesc ident element version xml document xml document url gener element document ident persist version document impli queri difficult execut simpl exampl queri creat time queri previou version element element persist storag system support order make part data model queri languag system function xylem persist xylem call identifi element document time independ element delet conveni paper acronym eid concaten document id eid identifi uniqu element document tempor xml gener version element version element order uniqu identifi version base observ document web frequent move restaur price restaur price restaur price restaur price figur restaur list retriev januari januari januari timestamp element time updat element children timestamp eid denot identifi version element concaten eid timestamp assum data model document view forest tree advantag queri version document similar queri gener set xml view forest tree similar forest tree result return possibl tree assum element updat element impli updat element note logic appli document implement note distinct document timestamp element timestamp snapshot queri document version figur document version version restaur guid restaur guid exampl note physic storag version document store complet version previou version store delta version order reconstruct previou retriev process complet version number delta document detail section exampl tempor xml queri main section creat queri describ kind queri expect tempor xml queri languag base mix xylem queri languag element xpath xqueri queri oper algorithm present paper independ queri languag order retriev document valid time timestamp path filter element version valid select complex version keyword timestamp order retriev price histori restaur note xylem support histor special support queri languag select return timestamp predic time includ select includ delet creat time element algebra oper oper tempor xml queri describ term oper addit oper assum avail tradit project discuss oper extens oper scan oper input forest tree set xml document filter element xml pattern tree tree match pattern tree includ inform project defin oper ¢ ¢ forest tree pattern pattern tree algorithm origin oper inform word call lookup denot function retriev post index retriev document identifi relationship inform instanc join document identifi relationship detail oper refer overview oper tempor queri oper ad ¢ tempor snapshot oper similar oper oper snapshot document valid time output oper set section return match version document tion output oper set return version document valid interv short time interv includ upper output oper set root document return version element valid interv output oper set eid equal eid input return creat time element retriev element creat select creat note eid element delet eid element strictli timestamp element identif oper shown paper describ algorithm avail timestamp improv perform timestamp gener extra cost involv assum avail return delet time element return timestamp version element version timestamp current eid retriev version oper construct select distinct retriev current version element gener tempor select retriev previou version element reconstruct tree root eid version timestamp result oper previou version document store delta impli access process potenti larg number delta addit complet version except current version store complet previou version document store complet actual version read case queri version element conveni return eventu applic separ script edit script describ similar inform rc file edit script xml tree al chang repres set oper delet insert updat move node oper refer posit version note long edit script repres xml oper break closur properti queri version repres document element diff construct select support string equal string queri oper access structur paper access method queri gain provid addit access method string equal expect separ oper access structur equal gener method equal test queri order illustr give queri base restaur queri oper list restaur list select snapshot list version restaur element valid time version creat updat retriev number restaur select tradit aggreg note reconstruct document show case storag delta previou document version creat perform problem list price histori restaur select timestamp retriev version restaur note predic act current version element price histori restaur histori list oper execut section describ tempor xml queri execut describ assum physic storag storag manag delta document content give overview queri oper algorithm physic storag model assum document version store complet current version previou version store chain complet delta delta forward backward similar storag strategi xylem make queri tempor characterist base current version queri characterist restaur queri queri restaur list explain bottleneck partli handl primari index techniqu delta fact store separ xml document store distinguish delta document complet xml document xml document consist complet current delta document delta document index delta index simpl version store timestamp text index number store timestamp actual version delta index note good solut expect delta index resid memori store timestamp index document content index order similar document index index index index word includ element post word includ document identifi inform determin hierarch relationship element document denot function retriev post index retriev document identifi relationship inform instanc extens extend tempor domain extend order support tempor oper altern index content index content version impli index content version timestamp facilit search version search element delet costli index content delta object impli index move delet inform directli text index facilit search path problem result extrem instanc delta delet move effici access queri snapshot content index snapshot delta inform combin altern approach effici snapshot chang base result larger index higher updat cost base observ index content version note rule studi rel perform altern left topic futur research oper tempor basic tempor oper lookup current retriev post occurr word document valid version lookup snapshot time post occurr word document version valid time lookup post histori retriev post timestamp addit note index queri type costli access structur fact delta store make version reconstruct typic tempor queri problem delta case store delta document store result delta read involv disk seek worst case access structur consid basic addit index structur access method order achiev accept perform goal index reduc number delta work directli delta avoid reconstruct snapshot oper algorithm describ algorithm tempor assum avail tempor index oper extens oper xylem algorithm oper inform word call join document identifi relationship ¢ oper execut variant algorithm oper main differ entri valid time consid lookup access word call lookup join document identifi relationship execut retriev occurr test match tempor valid view tempor multiwai word £ ¤ call ¤ lookup join document identifi relationship time word pattern valid impli tempor reconstruct order reconstruct version delta timestamp appli complet current version current delta delta possibl snapshot version made snapshot version process start oldest snapshot timestamp greater equal intermedi version valid algorithm reconstruct version valid reconstruct oper reconstruct version snapshot note algorithm output document histori previou version algorithm ¢ ¢ forest tree set document ¢ filter root eid note optim desir delta read order retriev creat time element interest strategi delta backward version valid find delta element introduc reconstruct note reason assum avail timestamp timestamp start recent version element case current element addit index index eid timestamp note common index insert gener element insert document document updat index expect frequent element insert document averag cost insert item index high delta easili bottleneck frequent oper case altern addit index retriev delet time element base perform similar document element exist version delet time document delet time element element resid delta forward start time find delta delet addit index altern strategi store creat delet timestamp list version good addit space timestamp opportun repres list list rang delta version content index section retriev creat delet timestamp element drawback strategi oper evalu lookup delta index section document eid document timestamp current timestamp found lookup delta index note order access data version eid actual document version reconstruct diff order gener differ xml differ algorithm root element input algorithm al algorithm input return version xml section issu relat equal data model queri languag version compar match issu complic semant equal oper xml data model xml queri algebra equal oper exact semant complet compar compar ident node semant issu appli tempor context includ issu automat type shallow deep tempor ident node version difficult issu introduc relat problem creat delta version assum list restaur price select illustr gener compar price restaur restaur member restaur time restaur short order compar address restaur easier address store address part address store element base discuss equal approach compar compar assum comparison element semant deep true match element valu strict xml data assum element persist id comparison perform util persist node possibl syntax case make actual restaur element attribut object ad problem approach relat gener problem make diff equal version problem occur entri delet reintroduc version eid eid equal test fail entri restaur version ¤ introduc similar oper style approach weikum perfect solut combin shallow equal similar oper interest solut discuss tempor queri process gener context note potenti perform queri involv costli tempor scan queri involv necessit inform index xml storag access delta major bottleneck part reduc snapshot regular interv delta order complic process base snapshot store addit actual delta issu scalabl histor version significantli index size realist main memori strategi partial solv problem version categori make subset version queri ordinari user size subset small relev index structur fit main memori version retriev delta previou delta previou creat delta version delta version creat summari order achiev desir perform xml support tempor effici execut queri oper paper algorithm execut tempor xml base queri oper introduc futur work includ develop techniqu reduc cost execut queri oper main goal context develop techniqu reduc number delta version retriev import strategi achiev goal develop type index algebra rewrit techniqu futur work includ studi modifi framework oper algorithm easili top exist system acknowledg serg abiteboul suggest topic vincent benjamin nguyen discuss construct comment refer cluet pattern tree queri xylem technic report queri xml document xylem technic report tempor model digit librari document concurr practic widom repres queri semistructur data fourteenth intern confer data engin ieee comput widom manag histor semistructur data zaniolo compar studi version manag scheme xml document version publish webdb technic report zaniolo version manag xml versu scheme intern workshop research issu data document manag data intens busi scientif applic marian detect xml document intern confer data fegara elmasri tempor object queri languag intern workshop tempor grandi mandreoli valid time technic report grandi mandreoli valid infrastructur tempor manag web document advanc inform intern advi manag version xml vldb tempor queri oper xml acm symposium appli comput tanca tempor aspect semistructur data vassili tsotra effici manag document object referenc vldb steiner approach tempor data model implement phd swiss feder institut weikum ad relev xml webdb web consortium xml queri work februari recent version web consortium xml queri data work februari recent version web consortium queri languag februari recent version xylem dynam xml data web ieee data engin
IR/733 5 document cluster word cluster inform bottleneck method tishbi school comput scienc engin interdisciplinari center neural comput hebrew jerusalem israel abstract present implement recent introduc inform bottleneck method document cluster joint empir distribut word cluster obtain word maxim preserv inform document result joint origin inform noisi procedur cluster inform preserv find captur mutual inform set find document preserv inform word cluster test procedur document collect base subset standard corpu result assess calcul correl document cluster correct label document find experi show doubl cluster inform bottleneck yield significantli superior perform compar common document distribut cluster algorithm doubl cluster procedur improv distribut cluster method examin introduct document cluster long import problem inform retriev earli work suggest improv effici effect document retriev system group document cluster refer document cluster put forward import tool web search engin navig document collect distribut retriev type cluster studi context inform retriev cluster document basi distribut word cluster word distribut document occur paper method document combin approach singl inform theoret framework recent introduc term inform bottleneck method base simpl idea empir joint distribut variabl compress mutual inform preserv case variabl correspond set document set word find captur inform document extract document cluster captur inform word occur work combin altern approach problem stage algorithm extract captur inform document stage replac origin matrix document versu compact base document document reappli cluster procedur obtain desir document cluster main advantag procedur li reduct inevit origin due high dimens reduc base denser provid reflect inher structur document corpu main concern method discov inher structur evalu procedur effect ir system evalu method standard label commonli evalu text classif algorithm circumv bia specif ir system view label document object knowledg inher structur dataset specif collect lang articl evenli distribut usenet discuss group corpu gener subset measur cluster perform correl obtain document cluster origin newsgroup compar cluster algorithm includ inform bottleneck algorithm ward method standard term weight found inform bottleneck significantli superior examin algorithm procedur improv perform algorithm experi cluster document word inferior cluster inform bottleneck method cluster algorithm start point distort measur data point class centroid distanc matrix distort cluster task adapt wai optim problem consist find small number class low distort high connect main problem approach choic distanc distort measur arbitrari sensit specif accur reflect structur compon high data context document natur measur similar document similar word condit distribut set document set document defin number occurr word document roughli document similar condit word distribut belong cluster formul find cluster hierarchi member set base similar condit distribut wrt member set introduc call cluster issu select distanc measur distribut unresolv earlier work principl approach avoid arbitrari choic distort distanc measur empir joint distribut random variabl compact preserv inform relev variabl simpl intuit idea natur inform theoret find cluster member set denot mutual inform constraint inform extract mutual random variabl log consist statist measur inform variabl variabl compact determin qualiti measur fraction inform captur note definit prior document uniformli normal jxj avoid undesir bia due document length gener problem exact optim formal solut assumpt origin joint distribut solut term distribut cluster prior probabl membership probabl distribut relev membership assign probabl inform bottleneck principl determin distort measur point log diverg condit distribut formal solut equat solv exp normal singl posit paramet determin classif procedur inform compact cluster forc repres part wrt relat previou work import inform theoret base approach word cluster carri brown al time tishbi lee introduc earli version bottleneck tag word disambigu hofmann recent call probabilist latent semant index autom document motiv base earlier work procedur repres document semant space latent variabl defin scheme analog variabl import differ approach assum gener hidden variabl model data maximum likelihood estim latent inform bottleneck method make assumpt structur data distribut hidden variabl variat principl optim directli relev inform data extract model base latent variabl word document approach import advantag method complet analyt enabl understand result classif agglom inform bottleneck algorithm shown simpl implement inform bottleneck restrict case cluster case belong cluster correspond limit eq yield natur distanc measur distribut easili implement agglom hierarch cluster procedur denot specif distribut easili evalu mutual inform set cluster state object inform bottleneck method extract partit defin map maxim mutual inform function note role scenario switch extract cluster word captur maximum mutual inform find cluster document captur mutual inform word util symmetri procedur section gener framework appli agglom greedi hierarch cluster algorithm algorithm start trivial partit jxj singleton cluster element step merg compon current partit singl compon local minim loss mutual inform formal defin equat mutual inform due merger defin inform valu algebra dj function dj diverg defin dj case fp equal argument ident upper bound symmetr metric note interpret multipl merg dj introduc inform optim criterion result similar measur directli emerg analysi joint probabl distribut partit construct calcul jxj find indic jg minim merg updat gg updat cost wrt end figur agglom inform bottleneck algorithm algorithm step perform merg cluster minim figur provid pseudo code agglom procedur cluster method gener framework agglom cluster appli similar criteria construct algorithm comparison common natur distanc measur probabl distribut norm variat defin jp unlik norm distanc measur satisfi metric includ triangl inequ approxim close distribut cluster algorithm distribut similar measur note multipl cluster merg crucial strong bia assign object cluster motiv probabl comparison algorithm standard ward method base euclidean distanc similar measur algorithm addit implement algorithm convent tfidf repres document vector space model method similar pair joint probabl distribut find cluster replac compact find cluster figur procedur determin similar cluster min cosin angl vector repres document implement algorithm similar pair determin similar cluster result method significantli inferior algorithm strong tendenc cluster document huge report data doubl cluster procedur criteria essenti symmetr regard role prior requir variabl compress work suggest combin option order introduc cluster procedur stage repres word condit distribut set distribut cluster algorithm obtain denot jy stage replac origin document repres document condit distribut repres condit distribut defin compact distribut cluster algorithm extract desir document figur outlin doubl cluster procedur inform bottleneck method framework inform natur cluster obtain stage algorithm extract captur relev inform document formal stage algorithm find set cluster algorithm extract document captur relev inform obtain reduct dimens origin lose mutual design section describ experi present object method evalu document cluster procedur addit describ dataset base standard ir corpu evalu method measur cluster effect trivial issu standard measur averag distanc data point candid class centroid abstract clear distanc measur previou work document cluster perform cluster measur term effect inform retriev system cluster result reorder list document return ir assumpt user select cluster highest relev document densiti problem evalu method note empir test shown user fail cluster time gener document collect result obtain ir system wrt queri sensit specif ir system queri result unclear bia dataset evalu method measur directli inher structur document corpu reveal cluster provid indirect ir system perform overcom problem simpl essenti estim document cluster perform tool text classif task interest measur cluster process reveal inher structur document standard label text classif corpu construct label clear object knowledg reflect dataset inher structur adopt accuraci measur learn algorithm measur cluster perform accuraci tabl obtain cluster document categori dataset construct document subset corpu collect lang corpu articl evenli distribut usenet discuss emploi evalu text classif techniqu group similar topic group discuss issu point schapir singer document corpu present group peopl tend post articl multipl cluster inher fuzzi test randomli chosen subset corpu detail subset tabl includ ignor file lower upper case charact ignor word digit charact stem procedur includ standard featur select dataset select word highest contribut mutual inform word document formal sort word log select top dataset newsgroup includ total group scienc tabl dataset detail binari dataset randomli chose evenli distribut group result document consist document result document collect test cluster ib doubl procedur distanc measur deriv inform bottleneck method doubl procedur norm distanc measur ward doubl procedur ward distanc norm ib singl cluster document base origin matrix document versu distanc measur deriv inform bottleneck method singl cluster document base origin matrix document versu distanc measur ward singl cluster document base origin matrix document versu ward distanc measur complet tf idf cluster document base origin matrix document versu algorithm term weight similar document estim cosin angl vector repres document avoid bia due number test perform algorithm number specif test perform perform estim accuraci tabl obtain cluster real document categori tabl present tabl accuraci ib doubl algorithm measur qualiti obtain cluster mutual inform tabl measur highli correl graphic space tabl tabl ib doubl algorithm dataset accuraci dataset note accuraci obtain document label number document cluster evalu tabl gener set ident number categori binari dataset document cluster simplifi assumpt user approxim awar number categori document collect number document cluster prior knowledg data question model select scope work problem address standard techniqu detail result algorithm dataset figur tabl list result complet tf idf algorithm comparison includ averag result procedur result note inform bottleneck algorithm doubl cluster procedur algorithm ib doubl result superior perform compar algorithm specif averag perform dataset attain result accuraci complet tf idf accuraci measur work present averag result mutual inform qualiti measur figur gain perspect test perform rainbow softwar packag naiv classifi train set ib doubl ib singl doubl singl ward doubl ward singl complet tf idf scienc averag tabl averag result cluster procedur dataset algorithm result dataset averag number process algorithm test run run ib doubl perform superior algorithm doubl ward doubl improv perform distanc measur cluster process ib doubl doubl ward doubl superior ib singl singl ward singl improv inform bottleneck algorithm doubl versu ib singl procedur test run averag complet tf idf algorithm slightli ib singl significantli singl algorithm ward singl algorithm exhibit weakest perform dataset perform algorithm binari dataset scienc dataset perform similar weakest perform obtain consist dataset number categori result poorer algorithm discuss work paper present principl approach cluster outperform commonli algorithm combin ingredi contribut work inform bottleneck principl inform theoret approach distribut cluster object measur qualiti obtain cluster extract relev inform justifi distribut similar measur emerg directli inform theoret optim similar measur ingredi doubl cluster procedur distribut dataset set document test set ident list tabl averag averag perform data set attain accuraci specif rainbow averag perform attain accuraci ib doubl averag perform attain compar cluster amount cluster dimens word base document document base distribut demonstr procedur similar measur examin combin inform result method shown provid good document classif accuraci fulli train label argu result demonstr valid inform bottleneck method power procedur problem agglom procedur work time complex suitabl larg dataset techniqu deal emploi similar cluster procedur recent baker mccallum find word cluster text categor avoid high complex suggest fix small number step similar cluster join word ad cluster work point distribut cluster reduct featur minor classif accuraci present show document word cluster lead improv perform procedur stage process find obtain document cluster natur gener compress dimens origin matrix work direct addit agglom inform bottleneck algorithm special case gener algorithm yield perform data gener approach scope work present acknowledg discuss yoram singer fernando pereira greatli appreci research support grant isra ministri scienc foundat averag mutual inform result ib doubl doubl ward doubl averag accuraci result accuraci ib doubl doubl ward doubl accuraci scienc dataset ib doubl doubl ward doubl binari dataset ib doubl doubl ward doubl accuraci binari dataset ib doubl doubl ward doubl accuraci binari dataset ib doubl doubl ward doubl dataset ib doubl doubl ward doubl accuraci dataset ib doubl doubl ward doubl accuraci dataset ib doubl doubl ward doubl dataset ib doubl doubl ward doubl accuraci dataset ib doubl doubl ward doubl accuraci dataset ib doubl doubl ward doubl figur result procedur data set horizont axi correspond number cluster document top left figur present averag result term mutual inform tabl document cluster real categori note similar accuraci averag result refer cluster analysi applic academ baker mccallum distribut cluster word text classif acm sigir della lai mercer model languag comput page cover thoma element inform theori john wilei pedersen tukei cluster base approach larg document collect acm sigir page karger pedersen constant larg document collect acm sigir page tishbi agnost classif markovian sequenc advanc neural inform process page adapt increment expand queri effect acm sigir page hearst pedersen reexamin cluster retriev result acm sigir page hofmann probabilist latent semant index acm sigir page text comparison categori search strategi acm sigir page lang learn filter netnew proc int conf machin page lin diverg measur base shannon entropi ieee transact inform andrew toolkit statist languag text classif cluster harper cluster mediat access www acm sigir page harper tool mediat inform access acm sigir page lee distribut cluster english word annual meet associ comput page ramsei chen interact internet search automat empir studi acm sigir page salton smart retriev system englewood salton develop automat text retriev vol page schapir singer system multiclass text schutz silverstein project effici document cluster acm sigir page silverstein pedersen cluster arbitrari corpu subset acm sigir page tishbi agglom inform bottleneck proc neural inform process system page tishbi hard cluster limit inform bottleneck method fc pereira inform method proc confer commun van rijsbergen inform retriev willett recent trend hierarch document review inform process vol pp xu croft languag model distribut retriev acm sigir page zamir etzioni web document feasibl demonstr acm sigir page
DB/734 3 algebra model contextu net roberto dipartimento di di dipartimento di di abstract extend algebra approach mesegu montanari ordinari petri net contextu cover collect individu token philosophi uniformli interpret net behavior introduct model petri net introduc petri larg di interdisciplinari applic reason success net model resid simpl formal descript natur concurr distribut system state system consist distribut action consum resourc fresh ect local subsystem comput partial order event event comput causal depend execut resourc provid concurr happen ect independ subsystem extens basic net paradigm consid literatur express power give exist phenomena paper contextu net read condit test arc underli idea read resourc consum provid model multipl concurr access resourc ordinari pt net read render unfortun sequenti concurr read contextu pre transit resourc ect ring contextu net found applic transact serializ concurr constraint program asynchron system extens pt net rise di erent school thought semant interpret main distinct drawn collect individu token philosophi research support cnr integr project la veri ca di sistemi esprit work group murst project figur collect token philosophi distinguish di erent token place instanc token view disregard token di erent origin histori carri di erent causal inform select instanc make di erenc causal depend previou event piec inform point individu token philosophi causal depend uenc concurr lead di erent concurr semant independ contextu net di erent approach di er context read net figur place repres token black transit direct weight context undirect weight unari weight transit concurr basic assumpt token read consum step concurr step basic assumpt start read context action place interpret fulli convinc end state reach ring sequenc basic assumpt ring durat lead explicit event red start concurr step ft context transit consum concurr step forbidden follow interpret ts understand context collect token semin paper algebra approach analysi net behavior reli basic observ monoid structur pt net state lift level comput obtain algebra initi model concurr net behavior algebra net theori develop relationship algebra logic interpret clear start classic behavior model petri net follow commut process devil reconcil ring step express nice concurr model admit exact algebra mean construct yield strictli symmetr strict monoid categori categori pt net pt net object element free commut monoid set arrow correspond commut process semant contextu net receiv poor attent literatur problem simpli remov discrep semant ordinari pt net easili extend diamond ring sequenc contextu formal good algebra model straightforward inspir suggest made mesegu give fulli satisfactori treatment issu idea monoid categori commut tensor product di erent case pt net monoid place regard token atom emit particl track number electron assum shorthand appli replac context arc arc give axiomat construct monoid categori arrow standard mark neg concurr comput net kei ingredi result hold maximum share axiom express concurr read share fundament idea observ causal depend build notion process introduc author shown semant net understood term symmetr monoid categori simpl variat process call concaten process introduc admit sequenti composit yield symmetr monoid categori net unfold semant give denot interpret interplai causal nondetermin contextu net process unfold approach studi give satisfactori understand comput model introduct asymmetr event structur algebra pursu recent paper categori basic idea addit auxiliari constructor duplic token match read arc replac read consum model duplic ring transit concurr idl copi match idl copi produc token multipl concurr access achiev produc duplic absorb match copi context suitabl axiomat duplic matcher introduc prove repres faithfulli basic fact concurr step share execut concurr interleav order notic di erenc main problem approach initi model arrow order obtain biject contextu process carv suitabl subcategori arrow subcategori inspect lack global correspond weaken framework aim improv approach notic unwant arrow due redund inform model context token read transit token connect duplic appli match express concurr add inform introduc inconsist behavior token place rst duplic match copi rst token copi result arrow meaningless comput viewpoint overcom problem extend approach rst part paper introduc term place context arc replac put sourc target avoid context transit consum sort dual maximum share hypothesi introduc symmetri regul forbid swap adjac kei prevent electron migrat atom essenti restrict omit symmetri put arrow back model fact result redund framework perfectli analog categori main result arrow standard mark biject slight nement contextu call strongli concaten structur paper section recal basic contextu net algebra semant pt net section de ne algebra semant contextu net provid origin result commut strongli concaten contextu process remark absenc read semant coincid classic preliminari contextu net contextu net introduc extend pt net consum oper state contextu net call mark repres distribut resourc type repositori set place mark multiset denot number token place carri set nite multiset free commut monoid denot multiset di erenc union natur number multiset denot underli set multiset de nition contextu net tupl set set pre context function minimum amount resourc requir enabl retriev read left repositori accomplish return fresh token context point transit consum token context concurr usual assumpt disjoint transit assum set de nition nite multiset transit contextu net evolv step symbol transit concurr enabl step sequenc sequenc execut step requir mark token precondit transit token place context transit match intuit token context transit time concurr point fact transit execut step mean execut order ordinari pt step sequenc contextu net consid induc diamond transform relat de ned step suitabl diamond transit sequenc concaten closur relat de nition contextu net strictli symmetr strict monoid categori contextu commut process mark object step modulo diamond arrow comput commonli term structur repres causal relationship event occurr case fruitfulli formal notion process remark notion conserv extens notion ordinari pt reduc absenc read arc de nition contextu process net acycl preorder contextu net set pair de nition contextu process contextu net consist contextu process net pair function tn sn respect target contextu process consid isomorph petri net monoid paper exploit monoid structur mark provid algebra concurr comput net basic idea lift structur state level provid algebra concurr ring step sequenti concaten order express complex comput sequenti composit endow comput categor structur mark comput idl token ident parallel composit yield tensor product interplai parallel sequenti composit regul tensor product model basic fact concurr transit occur order tensor product simpli commut pt net freeli gener strictli symmetr strict monoid categori arrow biject commut process situat complex order model causal depend multiset transit mesegu montanari introduc commut tensor product mark object suitabl arrow exchang order transit fetch produc token arrow call formal categor compon natur isomorph approach lead construct symmetr strict monoid categori net arrow de ne concaten process concret introduc order remov de cienci previou approach main featur captur strongli concaten object string multiset token figur collect context explain build algebra theori monoid place commut monoid oper unit oper axiomat figur omit usual commut unit axiom monoid homomorph observ law elimin consecut applic sequenc write shorthand appli time omit assum remark gener call molecul element algebra set denot set molecul gener lemma natur number molecul proof appli law proposit natur molecul proof law lemma corollari natur molecul interest molecul center comput point basic carri nucleu produc understand token ticket roll unbound number ticket reader ticket return consum retriev entir roll de nition contextu net de ne categori categori object molecul arrow gener rule figur modulo axiom strictli symmetr strict monoid categori figur contextu commut process algebra figur figur theorem categori isomorph monoid full subcategori object import properti proof call maximum share express result core show token place comput token context proposit molecul natur number proof corollari commut appli proposit time result figur net figur basic arrow repres commut contextu sourc target element remedi put environ instanc id id concurr execut share context written id id id id id id id execut order interest observ causal inform token consum read read individu context maximum share hypothesi creat obviou problem deal entir point recogn electron emit token ordinari pt inform causal recov algebra set symmetr strict monoid introduc symmetri control rearrang token process level state standard mark level comput tensor product commut interpret correctli ow causal token histori rst attempt uniform extens treatment previou section introduc symmetri molecul problem solv context model transit context concaten depend execut spuriou causal depend rise wrong semant model introduc kind denot repres context transit consum forward copi context produc backward copi read transit call mark algebra includ oper subject set axiom formal ident involv figur set write set nal kei ingredi construct abandon symmetri monoid categori involv step similar brought strictli symmetr symmetr monoid categori adjoin symmetri omit symmetri migrat electron atom atom build construct pt net commut monoid object symbol monoid essenti amount string concaten string denot underli multiset de nition contextu net de ne categori categori object arrow gener rule figur symmetri arrow modulo axiom strict monoid categori figur de id symmetri transit note introduc symmetri electron ow nucleu di erent start appli arrow reach figur figur problemat invari electron nucleu string rst electron electron success nucleu occur absenc symmetri maintain invari introduc arrow linear sourc target transit law consid origin establish link instanc singl consist comput interpret arrow express collect instanc form natur transform suitabl functor reader refer discuss topic law make instanc electron nucleu indistinguish assert order immateri establish result ne contextu process order concaten similar case lead introduc order token sourc target process yield notion strongli concaten contextu process de nition net strongli concaten contextu process tupl contextu process underli contextu process net total order minim maxim place impli concaten partial oper sequenti composit de ned provid target process coincid sourc process merg maxim place minim place order parallel composit process consist disjoint union extend order minim maxim place belong rst process shown oper strongli concaten contextu process form arrow strict monoid categori symmetri de ned process place suitabl order place minim maxim symmetri make symmetr monoid categori due space limit give detail refer present categori strongli concaten process similar state main result paper theorem categori isomorph symmetr monoid full subcategori object element proof long requir introduct descript algebra kind process repres arrow sourc target involv nuclei electron suitabl insid minim maxim place order repres electron move nuclei atom movement vacuou process sourc target string place electron resort strongli concaten contextu process theorem net figur basic arrow concurr execut share context written id time di er id sourc target correspond process concurr execut di erent context written id id term id denot di erent fact arrow comput advantag present approach respect categori arrow model categori pure concaten process distinguish sourc inspect construct conclud remark futur work build illumin suggest mesegu shown extend algebra semant pt net contextu collect token individu token interpret construct reli choic monoid element call molecul treat individu token symmetri monoid select symmetri consist comput interpret term strongli concaten contextu process work level singl approach extend construct categori net restrict analog literatur acknowledg mesegu suggest refer montanari event structur semant contextu asymmetr event structur proc vol lect note comput pp devil sequenti concurr behaviour petri net theori theoret comput comparison petri net semant collect token philosophi proc vol lect note comput pp christensen hansen colour petri net extend place test arc arc applic theori petri vol lect note comput pp montanari axiomat algebra net comput process acta montanari axiom contextu net process proc vol lect note comput pp behaviour petri net inform semant net inform mesegu rewrit logic semant framework progress report proc vol pp mesegu montanari petri net monoid inform semant petri net mathemat structur comput montanari rossi contextu occurr net concurr constraint program graph transform comput vol lect note comput pp montanari rossi contextu net acta ca petri mit phd institut petri introduct monograph theoret comput scienc model system share resourc petri net phd dipartimento di di axiomat algebra petri net concaten process theoret comput axiomat categori petri net comput mathemat structur comput rj van gd plotkin con gurat structur proc pp ieee vogler ecienc asynchron system read arc petri net proc vol lect note comput pp vogler partial order semant read arc proc vol lect note comput pp event structur proc advanc petri vol lect note comput pp
ML/735 6 chain approach gener assign problem ibaraki glover depart appli mathemat physic graduat school informat kyoto kyoto japan colleg cb colorado tabu search algorithm gener assign repres combinatori optim problem algorithm featur chain neighborhood construct creat complex power move incorpor automat mechan adjust search maintain balanc visit feasibl region comput comparison benchmark instanc show method obtain solut optim deviat solut obtain exact problem small exact method handl larger method obtain solut problem obtain heurist test automat paramet gener assign local tabu search introduct metaheurist algorithm wide acknowledg power tool deal hard combinatori optim problem metaheurist base local design neighborhood crucial chain neighborhood construct compound simpl move creat complex power move chain gener altern path construct graph theori gener lin kernighan algorithm successfulli appli graph partit travel salesman problem recent applic chain approach includ chain approach framework tabu search gener assign problem hard gap seek minimum cost assign job agent subject resourc constraint agent heurist algorithm develop gap combin greedi method local search toth tabu search simul anneal approach genet algorithm chu vd method tabu search approach laguna al gener set partit heurist al relax heurist grasp ant system combin local search tabu search linear relax heurist trick exact algorithm simpler version chain approach gap chain base idea previou paper variabl depth search algorithm gap featur rst altern shift swap call subsequ probe shift neighborhood de ned set solut obtain chang assign swap neighborhood set solut obtain exchang assign job featur adopt principl underli strateg oscil compon tabu search penetr region allevi search sole feasibl encount instanc feasibl region small consist separ small region nding feasibl solut gap strategi induc search enter region embodi earlier tabu search gap approach base success previou featur incorpor algorithm sophist manner chain move consid paper sequenc shift adjac move sequenc share common agent chain neighborhood set solut obtain chain move length chain move number shift move sequenc shift swap neighborhood includ chain shift move chain move length size chain neighborhood exponenti intellig control special subset altern divid neighborhood call doubl shift long doubl shift move chain move length long chain move chain length size neighborhood suppress manag size heurist rule base lagrangian rel explain detail subsequ section size doubl shift long chain neighborhood log show expect size long chain neighborhood arbitrarili small posit simpli ed random model observ experi expect size accur repres realiti neighborhood altern form improv call ec probe paper previou search solut penal search balanc feasibl region control paramet penalti function preliminari perform algorithm signi cantli uenc manag paramet valu judici incorpor automat adjust mechan determin valu paramet extens comparison exist heurist conduct benchmark instanc type problem size rang handl exact ts algorithm obtain solut optim deviat obtain exact method larger method outperform method obtain solut problem instanc gener assign problem job ng agent undertak determin minimum cost assign subject assign agent job satisfi resourc constraint agent assign job agent incur cost ij consum amount ij total amount resourc agent assign map mean job assign agent problem formul minim subject ij gap simpler problem nding feasibl solut gap partit problem reduc problem basic compon algorithm basic compon tabu search algorithm develop call algorithm local search space basic neighborhood local search start initi solut oe repeat step replac oe solut neighborhood set solut obtain oe slight solut found result solut improv refer call local optim type shift neighborhood swap neighborhood swap foe oe obtain oe chang assign swap foe oe obtain oe exchang assign neighborhood ts approach complic explain search visit evalu solut object function penal max ij paramet assign posit xed constant adapt control search section detail local optim solut function probabl obtain feasibl solut larg local search procedur neighborhood swap evalu function cost start initi solut oe necessarili formal algorithm step solut oe set oe oe return step step step hold oe output oe stop implement step rst admiss move solut scan ed rst improv solut found immedi accept solut local search appli number randomli gener initi local optim solut obtain output call random local search chain explain chain neighborhood neighborhood divid neighborhood call doubl shift long chain shift neighborhood explain subsect neighborhood explain subsect long chain neighborhood long chain neighborhood oper rst job agent amount resourc agent avail result amount job shift pro tabl job satisfi avail pro de ned function job shift agent amount resourc agent job chosen similar rule shift step repeat stop criterion sati ed ij ij lagrangian rel cost vector lagrangian multipli explain subsect ij st max function de ne resourc made job di erent amount resourc agent mean explain subsect function de ne attract shift move job agent larger score set job enabl move made agent agent function maximum job assign agent resourc requir final set job attain wai de ne function avail test discuss subsect algorithm gener solut long chain neighborhood current solut formal set job chosen length current chain job chosen step pro tabl agent receiv found step chain move length start output repeat step step execut algorithm long step set step randomli set fj job step agent minim ij ij ij agent set step fj return step set proce step step randomli fj set shift move job set insert output set insert output step return step iter step stop smaller fj hold small job current long chain phenomenon discuss subsect set solut output step step denot long cyc long path set long cyc long path denot long solut long long chain move de ned set shift move execut gener length long chain move number shift move phase function lagrangian rel cost ij ij vector lagrangian multipli note function attract assign job agent ij direct cost ij rel cost ij reliabl inform cost current solut modi ed chang assign job agent explain rel reformul problem minim ij ij subject ij ij ij ij lagrangian relax min ij ij st ij ij ij problem reduc knapsack solv time linear time algorithm found lower bound object problem lagrangian dual problem maxim lower bound problem integr optim solut dual linear program relax max st ij ij optim solut lagrangian dual comput exact optim multipli vector solv larg scale instanc fast method nding multipli vector method base ij approach gener sequenc lagrangian multipli de ned arbitrari updat ub ub upper bound object problem step size paramet satisfi determin initi set halv lower bound fail sg consecut iter iter termin lower bound improv sg iter smaller sg valu sg sg program de ned lagrangian multipli vector lower bound attain iter algorithm phase call time current upper bound previou multipli initi rst call phase algorithm formal upper bound ub initi lagrangian multipli vector algorithm step smallest ij set set counter step set step set counter set counter counter step counter counter set step counter sg output set return step set sg sg sg experi implement algorithm long chain comput algorithm long chain calcul set function prepar begin algorithm long independ sequenc time complex implement naiv show import improv comput note rest long chain requir time reason time gener solut long evalu di erenc algorithm output entir sequenc time complex algorithm long chain exclud comput proport jn long size long worst maximum length long chain total number repetit step complet execut long chain con rm averag length long chain shorter mean jn long smaller practic comput result tabl left column tabl show length long chain benchmark instanc observ averag length smaller theoret show simpl random expect length long chain bound arbitrari small appendix impli jn long analysi intuit support result tabl adopt data structur speed comput hold de ne list de ned max ed largest job fj ij list comput time space note comput independ number updat small comput paramet max set comput algorithm step rst phase determin set step phase comput algorithm initi step set step exit step set step receiv largest hold step fh ig fjg return step step set step set fjg step receiv largest hold step receiv minimum fh ig hold set score step return step proce step step set return step time complex algorithm step execut time binari search valu ij sort tabl length long chain move number scan length max max long chain initi doubl shift type averag max averag max averag max requir log step execut increment fh ig execut step similar max iter job return step step time complex step max worst step step requir time proport number job assign agent experi time part comput shown middl column tabl show expect max assum ij ij random appendix valu tabl type larger analysi intuit support result tabl comput time algorithm initi log max worst case time complex expect time complex log correctli comput max set max experi section appar tabl valu correctli comput max set smaller recommend set max smaller instanc size larg memori comput store entir doubl shift neighborhood explain doubl shift neighborhood comput data structur subsect move neighborhood realiz shift move max paramet maximum number shift move job agent comput maximum satisfi assign job shift job insert agent agent minimum algorithm gener solut doubl shift neighborhood formal algorithm doubl step set random permut step set job step agent minim ij ij ij agent receiv largest set counter step counter return step set proce step step set return step proce step step set set insert output set insert output step set counter counter return step denot set solut output step step doubl cyc doubl path doubl doubl cyc doubl path call doubl cyc cyclic doubl shift neighborhood note doubl cyc swap gener max max set doubl cyc swap time complex doubl worst practic run time smaller number skip step step larg max return step step iter job column tabl show averag maximum max max ratio total number scan number scan show expect max max assum ij ij solut gener randomli appendix analysi er intuit support result tabl experi show doubl power swap set max log ng set max step algorithm doubl shift requir log time size doubl log expect time complex doubl shift log worst case time complex time complex scan solut swap worst case consid doubl swap algorithm ts ec probe ec doubl shift long altern solut improv rst ls shift ls doubl shift long chain rst admiss move strategi ec probe repeat improv found note ls long chain neighborhood check entir ls consid algorithm formal initi solut algorithm ec repeat step oe longer improv improv shift set oe improv doubl shift set oe doubl improv long solut oe long set oe oe solut obtain ec probe local optim respect doubl shift long chain neighborhood comment function avail score function avail test function job resourc requir job candid function repres amount resourc agent function oe larg long doubl result avoid combin adopt algorithm ts function test ve ij ij ij max ij ij function cost agent job account techniqu subsect applic function depend oe case function slightli function function work properli job cost smaller js occupi irregular overcom extent function adopt tabu search explain construct tabu search algorithm search start randomli gener improv ec probe solut obtain local optim respect doubl shift long chain neighborhood shift move solut shift solut improv rst cyclic doubl shift neighborhood doubl cyc ec probe step repeat comput time exce ed reason cyclic doubl shift neighborhood avoid short cycl return solut shift number job assign agent chang move doubl cyc combin motiv success procedur probe swap altern understand idea quot paragraph behavior local search neighborhood current solut close local shift move rare agent job shift penalti larg amount swap move chang number job assign mean number job agent fix earli stage search chang local optim solut reach local search neighborhood shift search power size jn swap fairli larg algorithm formal set repres tabu list consist solut move forbidden lagrangian multipli vector comput algorithm ts function ect behavior ec probe paramet penalti function automat control algorithm control section ts current prev solut found previou feasibl solut found cost algorithm ts step randomli gener initi solut set prev initi step initi paramet step set ec ec step comput time exce output proce step step updat paramet ff step prev set prev set prev return step solut minim set step set doubl cyc step solut long set step updat step return step return step explicitli execut feasibl solut found step feasibl solut sati es step set feasibl solut found skip step set set updat set step return prev prev hold intensifi search prev test strategi case step simpl search move shift iter random solut perform ts approach slightli variant automat control penalti weight explain automat mechan control penalti weight ff step step algorithm ts decid incorpor mechan ts perform depend intim paramet valu assum initi ff valu step ts determin solv quadrat program minim subject ij ff ij ff ff set de ned ij agent respect rel resourc requir job solv expect averag cost shift move balanc averag penalti qp solv simpl method complet time neglig experi optim solut qp sati es set small posit step algorithm updat paramet rule function dec case feasibl solut found execut step valu min fb step size max jq max jq size ed case rule updat case dec step size dec ed paramet satisfi step size dec step size mean rule explain function term divid normal agent feasibl solut found iter ec probe term weight overload maximum amount chang agent step size set posit small compar agent opposit case similarli explain preliminari found perform ts robust paramet step size step size dec section set step size step size dec comput result algorithm ts evalu benchmark instanc subsect algorithm code run workstat sun ultra model ultrasparc ii processor gb comput execut singl processor subsect ts appli small instanc exact optim valu subsect ts compar exact algorithm compar ts exist heurist algorithm subsect gener instanc ve type benchmark instanc call type type easi di erenc test algorithm instanc type gener type ij random integ ij random integ ij type ij random integ ij ij random integ ij type ij ln random number ij ij random number ij note type harder type ij ij correl test set problem instanc type instanc optim valu total instanc type type instanc type instanc gener www site total instanc type gener instanc www site url url www result problem set small appli instanc algorithm ts obtain optim solut instanc shown tabl ve instanc instanc solv ve time di erent random seed averag maximum result run shown tabl comput time ts problem instanc small optim solut obtain time type min averag max observ averag comput time reach optim solut suggest instanc small compar algorithm recent comput speed di erent comput present comput result section give rough comparison sun ultra model dell xp sun ultra model silicon graphic algorithm run tabl clock benchmark valu valu data dell xp row run show averag comput time algorithm ts obtain ed target time sun ultra normal comparison show data gatewai result row observ reliabl inform comput time ts approach di erent comput base give rough estim speed algorithm ts comput row speed sun ultra normal larger mean comput faster tabl comparison di erent comput sun ultra dell xp sun ultra silicon graphic gatewai model model cpu ultrasparc ii pentium ii ultrasparc pentium ii clock ts run estim data intel comparison exact algorithm compar algorithm ts exact algorithm develop problem instanc set medium exact method highli ectiv problem size opportun close optim ts approach problem challeng small result provid author run di erent comput dell xp tabl show averag maximum number run solut averag comput time solut run cost ve run algorithm ts run paramet set instanc algorithm appli time time limit run set previou run initi upper bound run strategi select ectiv total comput time total comput time algorithm stop con tabl comparison method algorithm ts run sun ultra model time limit algorithm run dell xp time limit ts cost time time time type lb min max cost con rm optim con rmed exhibit tabl mark cost attain algorithm show lower bound obtain solv lagrangian dual problem maxim variabl ij constrain addit integr properti lagrangian dual obtain lower bound obtain lp relax problem type algorithm obtain optim solut reason amount time singl problem set approach fail con rm ts algorithm obtain slightli outcom ts highli success nding optim solut class problem type instanc harder type algorithm algorithm verifi optim live reput highli ectiv problem size rang nding slightli solut ts approach ts approach found slightli solut problem method match solut greatest di erenc problem algorithm perform similar qualiti solut obtain method suggest ts approach obtain optim solut problem turn examin substanti larger problem scope method conduct remain test compar heurist method comparison heurist algorithm algorithm ts compar heurist random local search branch variabl depth search algorithm yamaguchi ibaraki variabl depth search yamaguchi ibaraki variabl depth search tabu search laguna al tabu search gener constraint satisfact problem ibaraki ant system combin local search tabu search vd ra code languag code ni rl author code ni written rl written fortran paramet vd set valu report neighborhood swap ra includ paramet paramet ni set default valu rl code includ type combin option chose option recommend paramet set default valu algorithm rst appli problem instanc set medium tabl show cost obtain algorithm state algorithm time limit short instanc comput state footnot tabl algorithm rl option set time ran rl stop comput time shown tabl run sun ultra model comparison includ tabl result genet algorithm cite chu comput report di erent workstat silicon graphic result cb type instanc denot tabl comput time cb shown tabl tabl show lower bound tabl mark repres cost mean feasibl solut found tabl show similar result larger instanc set time limit set test algorithm result similar ra rl competit result tabl tabl observ algorithm ts obtain cost instanc test instanc larger problem di erenc cost lb test impli solut qualiti ts high show detail result ts tabl di erent time encourag futur research gure error found number run ve cost attain tabu search algorithm gener assign problem incorpor chain neighborhood algorithm includ lagrangian rel cost reduc neighborhood mechan automat control balanc feasibl region visit search comput comparison method exact algorithm show ts approach obtain optim optim solut problem size rang exact method handl comparison exist heurist algorithm benchmark instanc size larg handl exact method ts approach obtain solut obtain method acknowledg author grate manuel laguna provid origin robert provid comput result grate valuabl comment research partial support scienti ministri sport cultur japan tabl cost obtain test algorithm type lb ts ml ra ni rl cb yy na yy na yy na yy na yy na yy na sun ultra model sun ultra model sun ultra model sun ultra model comput time tabl comput time tabl tabl comput time algorithm cb run di erent comput shown ts cb rl ultra graphic ultra time time time total time total type limit time time na na na na na na tabl cost test algorithm larger instanc time limit type lb ts ml ni tabl detail result algorithm ts time limit cost run time time type lb minimum averag maximum found limit tabl detail result algorithm ts time limit cost run time time type lb minimum averag maximum found limit refer mm hybrid heurist gener assign european oper berg theori graph dp nonlinear scienti dg ln van set partit heurist gener assign european oper pc chu je genet algorithm gener assign comput oper jj comput standard linear equat technic comput scienc tn mathemat scienc oak ridg nation oak tn match polyhedron research nation bureau ml lagrangian relax method solv integ program manag mr garei ds comput guid theori chain move gener assign held rm travel salesman problem minimum span part mathemat bw kernighan heurist procedur partit bell syst tech jp jl search multilevel gener assign european oper lin bw ectiv heurist algorithm travel salesman oper lan mg heurist gener assign european oper hr approach heurist gener assign technic depart econom algorithm gener assign proc knapsack algorithm comput wilei rm classic gener assign manuscript tabu search approach csp satisfact gener problem european oper special issu tabu ih gener assign simul anneal tabu search discret appl mm robust heurist gener assign ann oper parallel tabu search algorithm chain vehicl rout theori ed ih jp kelli tour path travel salesman european oper approxim algorithm gener assign oper ma linear relax heurist gener assign naval research yamaguchi variabl depth search algorithm gener assign advanc trend local search paradigm ed ih yamaguchi variabl depth search algorithm branch search gener assign optim method appendix argu length long chain move crucial ect perform algorithm long chain expect length long chain move simpl random consist job randomli chosen random variabl repres length chain show theorem theorem arbitrari small constant hold cientli larg prove lemma lemma function sati es hold proof lemma claim hold hold ln ln show result substitut proof theorem process grow chain long chain move job step process stop insert job includ fj hold occur probabl jj hold stirl lemma monoton hold arbitrari hold larg appendix show expect max step algorithm initi subsect assum ij ij random solut show expect max algorithm doubl max assumpt assum result clear lemma lemma sequenc bernoulli success probabl trial expect number trial success occur success probabl case number success max case statement immedi follow lemma
ML/736 6 map tree neural network rudi setiono wee school nation singapor lower kent ridg singapor singapor abstract exist method transform tree neural network method typic construct network directli map node rule neural unit network construct larger paper describ method map tree neural compress network remov unimport redund unit connect tree extract prune network simpler induc algorithm neural prune introduct tree wide nonparametr pattern classif task involv pattern class larg number featur input tree classifi perform comparison stipul node branch left base comparison result comparison made pattern featur valu specif constant classif result sensit featur measur sensit tree classifi research explor soft base probabl outcom comparison node approach transform tree neural network figur sampl tree induc depth node kubat neural network method interest construct neural network base discret binari tree permit network train pattern studi method reveal network construct tend complex method gener neural network call neural network base prune network train binari pattern gener tree method gener simpler simplifi tree process prune network remaind method briefli section method section exampl illustr strength method present section conclud remark section neural network illustr kubat method construct neural network tree tree shown fig induc pattern algorithm tree attribut class attribut valu divid interv base threshold valu node tree interv assign boolean variabl figur attribut interv deduc tree fig interv assign label boolean variabl attribut valu fall insid tree rule disjunct normal form construct assign input unit boolean variabl hidden unit implement conjunct term rule hidden insert connect input unit repres boolean variabl conjunct posit connect variabl neg connect negat variabl assign output unit class output unit implement disjunct conjunct term output insert posit connect hidden unit repres conjunct term rule actual valu connect weight unit select hidden unit implement logic output unit implement logic connect unit carri small weight figur show construct manner input unit number hidden unit equal number conjunct term rule close examin rule reveal redund boolean remov simplifi rule neural network shown neural network method produc simpl automat simplifi tree layer layer interv layer figur neural network construct rule eq solid line repres posit connect dash line denot neg connect connect unit carri small weight shown figur neural network neural network method construct neural network tree deriv attribut interv tree deriv rule tree attribut interv gener binari train pattern rule attribut interv train neural network binari pattern prune train network gener attribut interv rule tree similar method gener neural network rule map variabl rule directli neural gener binari train pattern rule pattern train network understand train pattern examin illustr section attribut interv deriv tree interv assign boolean variabl boolean variabl give rise binari train pattern input bia figur prune neural network obtain train binari pattern neg connect weight dash posit weight solid line target output class variabl correspond nonoverlap interv attribut binari variabl combin variabl variabl attribut contribut variabl contribut combin binari pattern binari pattern gener rule attribut interv target output valu pattern assign rule pattern satisfi condit membership class target valu train perceptron hidden layer number neural unit requir arbitrari long network unit method upper bound number unit requir layer network start input hidden output network train method train irrelev redund network connect remov appli neural network prune penalti function earlier shown effect result network shown fig hidden unit connect input unit hidden unit connect input longer present network redund valu determin remain input explain hidden unit hidden unit figur scatter plot hidden unit activ shade region repres class symbol denot hidden unit activ input pattern class prune neural network produc substanti fewer connect hidden unit network construct network hidden unit implement conjunct rule hidden unit connect input unit conjunct involv input variabl map conjunct hidden unit straightforward method creat neural result network tend larger network fig show understand network implement plot hidden unit activ input pattern fig show hidden unit separ pattern activ larger hidden unit distinguish pattern activ valu greater activ network implement class class class class figur tree neural network rule express term input variabl rule express term hidden unit activ term input variabl hidden unit activ determin weight connect input unit hidden unit weight input unit hidden unit weight input unit bia inform group input pattern activ valu knowledg input valu pattern recov origin rule larg hidden unit activ obtain impli conclud network rule convert involv hidden unit activ involv origin boolean variabl figur illustr rule depict tree inject rule neural network addit rule disjunct normal common type rule rule rule involv condit requir condit satisfi pattern rule intuit compact decid credit applic approv requir condit amount credit request applic monthli incom applic older year applic work current job year bia figur network implement rule neural due inher parallel process input easili construct implement rule tree method check attribut expect gener larg tree illustr compar perform pattern gener build tree gener neural network tree gener improv version node classifi pattern incorrectli neural network gener method hidden unit correctli classifi pattern previou network classif rule explain network hidden unit activ hidden unit activ defin hyperbol tangent linear combin input linear combin hidden unit pattern hidden unit activ activ greater belong class pattern activ valu neg hidden unit activ valu belong class posit activ valu belong class ffi hyperbol tangent function ffi comput ffi ffi pattern classifi hidden unit hidden unit figur scatter plot hidden unit activ network fig set rule simplifi obviou set rule origin rule paper present method construct neural network tree method advantag kubat method calcul fix set weight problem case method determin weight valu train input pattern due prune gener network smaller construct prune process compress intern network tree extract prune network smaller simpler induc algorithm gener appli gener network implement dnf rule refer adapt improv pattern recognit proc ieee intern confer initi neural network mean map linear tree classifi neural net proc ieee intern confer neural induct machin tree probabilist proc intern workshop machin theoret approach hierarch classifi pattern entropi tree neural proc neural implement tree ieee tran approach prune feedforward neural neural setiono method feedforward neural network construct ieee tran neural gg towel jw extract refin rule neural machin
DB/737 3 vol autom reconstruct topograph object aerial imag vector map inform christoph christoph swiss feder offic topographi switzerland institut switzerland work group ic kei data featur edg object build abstract project feder offic topographi eth zurich aim updat vector data road build roof outlin fit real improv accuraci deriv height inform repres height accuraci updat achiev imag analysi techniqu develop eth zurich digit aerial imageri procedur implement softwar import export data quasi import reliabl aim full autom complet plausibl paper present detail input strategi gener method present overview result achiev problem face build road reconstruct detail investig partial aspect build road present paper congress introduct period nation map agenc gener digit landscap model conform realiti includ map effect process integr addit object class inform compar tradit topograph map dimens demand digit build applic requir complet statu face top product usual shorter personnel restrict cope higher product product cut cost time autom tool product emploi aerial imag major sourc primari obviou autom aerial imag analysi lead benefit autom aerial imag analysi topic activ research decad includ aspect dsm aerial interior rel gener year research focuss detect reconstruct topograph build gener citi model good overview research al special issu journal journal april novemb juli autom method fail provid good qualiti result slow method develop successfulli project matur commerci system method requir substanti human case make priori inform plan focuss limit area object model high level detail sensor laser scanner sar henderson vol mercer hybrid sensor gener citi model build build model sensor process data complic fulli earli stage provid qualiti high resolut aerial check complet data digit camera gener surfac model citi problem face autom object reconstruct similar scan aerial film imageri autom aerial imag analysi priori inform includ data gi addit exist priori inform includ constraint object rule term coin difficulti exploit exist geospati data imag analysi accuraci complet unknown inhomogen mechan estim propag uncertainti input data develop exampl approach incorpor priori knowledg object extract build al brenner road van al de al de grow gener object urban scene site hwang janssen al al chellappa al al sti huang jensen koch al al zhang walter walter grow kunz al al clear tendenc aim autom improv result combin input data provid inform cue size object term fusion integr theoret foundat procedur commonli accept method perform aim project feder offic topographi eth zurich map product scale smaller gener gener digit colour product digit map raster vector form aim produc digit gi infrastructur topograph inform repres real landscap model cartograph import object infrastructur transport network build data requir public privat exist gener vector form topograph map procedur detail aim updat dataset fit real improv accuraci deriv height road repres height build build roof outlin detail repres height build characterist top flat roof topolog exist except error maintain updat achiev imag analysi techniqu develop institut eth zurich digit aerial imageri make previou experi project build road extract research make exist build focuss larg imag scale detail roof model procedur implement softwar import export data quasi import reliabl aim full autom complet plausibl result correct avoid check manual dataset envisag traffic light high reliabl red high percentag oper manual check possibl red object import aspect current imag data imag cm focal avoid addit cost topic project investig find gain respect colour cm focal length imag overlap colour big addit flight strip cm focal length concern input data vol major input data background nation softwar transport network forest limit bentlei manual area singl symbol automat extract plan pattern recognit vector softwar develop eth transport network exist switzerland vector format end rm error ca maximum ca empir includ topolog due partli autom error exist error size shape esp exist due figur show data overlaid aerial imag occur differ realiti includ object error top problem occur forest urban area car gener shape correct problem intersect case vector pass top tree spectral properti road vari left imag bottom row fig data deliv format exist class attribut object data map sheet form exploit full potenti vector data store gi main reason establish system spatial data engin oracl run unix ibm platform consist moment million object integr semant model model villag relat object select displai figur exampl data build input data grid space accuraci alp raster map colour layer digit imag deriv data dsm colour pixel gener op ts test dataset region repres topographi switzerland close colour imageri scale cm focal scan scanner region ground truth data road vol build measur analyt imag cover block characterist area agricultur water modern urban centr high build gener strategi methodolog figur exampl data road aim detect exist object exist anymor treat extract road build treat separ common input deriv final stage due complementar road build object result fuse success rate reliabl result strongli reli fusion multipl cue object exist exist inform sourc inform provid sourc redund account error incomplet result imag analysi basic cue dsm secondari motion vehicl context build road cue relev attribut exist model restrict search treat object subclass check plausibl multipl deriv reliabl criteria object class road rang attribut object rule road horizont vertic curvatur road cross highwai level knowledg data base automat updat refin inform gain imag analysi reliabl correct stage manual edit correct result road model includ topolog contextu attribut approach multipl object layer object layer divid object transport road railwai pathwai object layer divid object subclass terrain factor influenc abil object reconstruct road divid insid forest open rural urban area possibl citi terrain relief determin plausibl object paramet horizont vertic curvatur subclass layer vol respect process method process proce easiest subclass difficult result build detail part project cue build detect start approxim extract dsm blob classif classif inform approxim detect exist dsm blob deriv vector approxim refin sequenti rotat scale score solut search defin maximum error inform channel involv comput match score end solut reliabl comput traffic light principl test result comparison ground truth show detect build imag figur red vector green fit imag cue object separ object natur dsm edg gradient edg orient figur reconstruct build colour green yellow reliabl green build accept yellow manual inspect road vol detail project part zhang step road aim detect exist road exist anymor treat concentr ignor transport network object railwai mountain path contrast approach road approach multipl cue object emploi exist rule treat road subclass differ success rate reliabl result initi knowledg establish inform extract exist geograph data road design rule offer topolog contextu descript road network scene automat updat refin inform gain imag analysi colour express form colour region support stereo match improv perform group combin geometr cue procedur suffici solv problem road extract road network mutual interact procedur main step road extract knowledg base road segment find straight line search region defin classif imag extract combin cue guid knowledg find plausibl group road edg road segment refin updat knowledg gener strategi shown fig fig show detail result imag process deriv subclass vector attribut input data road design knowledg stereo colour aerial imag input data road network class road type road mark geometri info width length horizont vertic curvatur topolog info imag process partial result knowledg base cue combin result accuraci estim figur strategi road network extract featur extract imag match imag analysi subclass attribut deriv straight line road region shadow road road attribut slope figur detail imag process deriv subclass vector attribut control vol edg gener crucial compon procedur interest straight line promin correspond object interest build road segment detect imag provid great deal inform structur scene edg featur support point accur inform straight line determin correspond line segment imag edg deriv canni oper subsequ straight line fit develop method exploit rich line attribut line geometr structur inform rich line attribut includ geometr descript line inform region left line lab colour space orient epipolar constraint emploi reduc search space comparison candid edg made common overlap ignor length differ shift edg segment pair satisfi epipolar constraint rich attribut comput similar score similar score weight combin criteria score total similar score averag score similar score comput start longer short perform similar measur construct match pool attach similar score line pair problem determin match match local comparison line attribut necessarili give result consist neighbourhood local consist match achiev structur match neighbour edg probabl similar score serv prior inform structur match conduct left left step combin group straight segment inform space bridg gap combin segment space small gap edg broken multipl straight segment match segment length extend final posit comput origin edg pixel fit straight line straight line fit point method straight line match implement experi perform number area extract aerial imag test area cover terrain includ rural hill figur show line extract process result straight line left imag fig line left imag longer pixel match wrong match match result shown fig figur test imag pair figur extract straight line figur match result work straight line match line complet imag classif method find road region guid initi knowledg exclud line road buffer area area defin road estim maximum combin line classif relat road region attach line line slope differ slope local larger exclud outlook present scheme road build reconstruct aerial imag idea inform success rate reliabl result project work successfulli complet difficult combin disambigu conflict deriv reliabl qualiti li ahead imag made test vol road urban area heavili occlud extract fusion inform extract imag knowledg road model road class terrain relief major issu cue car road road mark extract confirm reconstruct result build extract urban centr investig addit difficulti stem fact data describ case outlin build block metric qualiti estim result evalu manual extract ground truth refer data refer forest map combin laser gi data proc int rem sen conf pp april process laser scanner data algorithm applic rem pp automat line match reconstruct build multipl view vol part pp road model base cartograph aerial imag interpret semant model acquisit topograph inform imag pp elev correct build extract sar imageri proc vol pp monitor aerial imag proc darpa workshop imag pp laser scanner data extract build roof detail standard elev deriv paramet vol part pp de interpret aerial imag updat road map phd delft univ faculti netherland vol pp semant model acquisit topograph inform imag map basel possibl extract structur object scan topograph map gi proc int cartograph pp integr high resolut imageri data urban analysi applic vol part pp knowledg base interpret multisensor remot imag vol part pp automat extract object aerial space basel automat extract object aerial space imag basel linear featur extract dynam program pp topolog gener citi model rem pp integr automat process build extract vol part pp brenner urban gi laser map data vol part pp brenner extract build tree urban environ rem pp vol sar applic human popul estim urban land pattern statu report ieee tran rem pp analysi imag structur color attribut similar relat phd report institut eth zurich project current statu futur work vol part pp approach autom build remot imag analysi gi data pp detect identifi topograph object imag laser data vol part pp van der integr topograph data remot classif pp knowledg base interpret aerial imag map digit landscap model partial interpret semant model acquisit topograph inform imag pp investig synergi effect satellit imageri digit topograph integr knowledg process vol part pp geometr model build base increment featur extract multipl vol part pp build detect fuse dem digit map vol part pp system knowledg base remot data proc int rem sen conf pp algorithm extract build model raw laser data rem pp cooper aerial imag map interpret urban scene automat extract object aerial space pp aerial imag understand system plenum dem urban area vol part pp reliabl reconstruct build digit map vol proc semiautomat street object vol part pp zur auf der basi von week hobbi pp road extract satellit imag vector refer data vol part pp structur approach aerial imag understand automat extract object aerial space imag ep pp interpret phd deutsch semant model extract object aerial imag automat extract object aerial space pp knowledg base interpret hybrid system imag analysi vol part vol high resolut digit surfac model telecom network plan week pp road build laser scanner data forest vol part pp descript urban area map aerial imag automat extract object aerial space imag ep pp approach extract area automat extract made object aerial space imag ep pp fusion satellit imag gi data classif proc scandinavian conf imag phd report institut eth zurich structur analysi aerial imag rem pp automat reconstruct roof map elev data vol part pp reconstruct object aerial imag gi vol part pp knowledg base road extract multisensor imageri vol part pp knowledg base interpret remot imag semant net pp van delin road structur satellit imageri techniqu pp de updat road map contextu reason automat extract made object aerial space imag ep pp map drag fit model pp automat classif remot data gi vol part pp autom gi data collect updat week pp automat verif gi data high resolut data vol part pp zhang imag analysi edg extract road reconstruct proc juli vol proc detect urban develop multisensor satellit data map vol part pp
IR/738 5 document classi cation base hyperlink document semant kuo wong depart comput scienc engin hong kong hong kong abstract basic web document set hyperlink point relat document hyperlink document provid inform relat web document analyz hyperlink document identi ed algorithm classifi web document subset base hyperlink document content repres document identi ed subset base similar de nition repres search relat document achiev introduct www grow decentr document web lack logic organ enorm number web document make manipul oper web document di cult size web document set analyz web document web document divid disjoint set base document content problem web document classi cation web document categor web document set hyperlink point web document set hyperlink provid inform web document algorithm partit set web document base network hyperlink structur present similar de nition document base document content measur similar document partit de nition similar prune document order maintain consist document subset paper organ algorithm preliminari classi cation hyperlink introduc section similar de nition document classi cation process present section author support part hong kong grant result section section document partit hyperlink algorithm web document organ pebl vsm categor algorithm base classi cation paradigm author classi er document classi cation concept mobil agent appli classifi web document page interest reader refer refer detail algorithm inadequ requir larg number featur learn improp distanc measur due variat document length word discuss web document categor algorithm base hyperlink analysi similar de nition comput discuss web document set hyperlink set web document node hyperlink direct set web page transform direct graph page correspond node hyperlink transform direct edg de nition de nition direct link de direct link node node base de nition de ne import classifi document di erent class de import document de ned de refer web document de ned import de ne import document set document document mean document import document high document refer document refer high refer import document high page low base de nition document classi ed di erent type document discuss topic partit subset de ne set node hypergraph di erent type document subset document classi ed relat document relat node set relat di erent type node identi center node termin node center node point termin node node direct edg node edg point node relat node hypergraph link subset speci topic type node unrel node de nition node base de nition de node refer node consid center node de node refer partit subgraph belong node consid unrel node de node consid node set center node set relat document gener manner set node center node edg point put set node ad subset termin node unrel set node node point ad subset algorithm termin unrel node node encount edg center node relat node di erent unrel subset combin base set center node subset potenti repres identi ed set potenti repres minim set center node point largest number document subset greedi algorithm center node largest number document subset select node center node point point set node potenti node set potenti similar comput focu document subset document retriev import center relat unrel fig gener hypergraph web document subset due unstructur properti emploi object exchang model data model manipul web document oem label tree structur refer detail oem web document construct web document follow basic de nition hypertext markup languag web document transform oem data record html document transform oem record gure hierarchi tag html document set tag html document identi cation document structur hierarchi ofth document content set repres import titl topic head structur tag tag set structur tag assign id level hierarchi html document assign id assign id larger higher level hierarchi base set structur document set node organ hierarch transform algorithm convert web document preliminari oem record shown gure tag edg label section head intern node content convert intern node content edg label remov origin edg label origin oem record gure gener similar de ned base oem record transform de ne document node edg label similar structur similar similar document linear combin similar node similar node oem record transform web page set word origin content document de ne individu simpl html page write html write html difficult html tag write html difficult simpl html page html tag write html fig transform html oem format oem format node similar node node similar individu node similar match word content node de ning individu node node similar oem record de ned base node similar de ned leaf node edg label similar comput edg label similar base edg label branch oem record branch de ned edg root leaf de nition edg label similar individu edg label branch label match label branch charact arrow edg label edg label similar note sequenc edg label comput edg label similar edg label similar edg de easi de ne edg label similar structur similar de ne similar base structur oem record simplest tree leav node intern structur similar tree structur similar cnt di erenc cnt cnt di erenc cnt cnt di erenc cnt di erenc cnt parent parent structur similar de ned node similar repres select base similar de nition de ned previou similar oem record de nition similar similar potenti repres member comput potenti repres maximum averag similar document subset select repres repres averag similar document higher inform select simpli repres result report result show ectiv algorithm compar algorithm classi cation algorithm set web document set data set web document gather base di erent topic set set document total unrel set document extract set word highest occurr document extract featur vector classi cation result compar base recal tabl result algorithm quiet set noisi set environ classi cation number comput recal classi cation set paramet yield di erent result note experi cluster center recal recal tabl result rst set document algorithm cluster center recal recal tabl result rst set document algorithm result tabl algorithm algorithm exist ect perform classi cation perform ect algorithm present algorithm classifi web document hyperlink document base de nition di erent type node identi ed partit hypergraph set document methodolog identifi repres subset document experi show algorithm ectiv classi cation refer hypertext markup languag speci cation html work group buneman semistructur data principl system cheeseman stutz bayesian classi cation theori result advanc knowledg discoveri data page cost salzberg weight nearest neighbor algorithm learn symbol featur machin duda hart pattern classi cation scene analysi john wilei jack edmond greedi algorithm mathemat david jon prabhakar raghavan infer web commun link topolog acm confer georg kumar text categor weight adjust neighbor classi cation technic report pearl reason intellig network plausibl infer jon kleinberg authorit sourc hyperlink environ proc symposium discret daphn koller sahami hierarch classifi document word proc int conf machin low similar metric learn classi er neural maarek ben shaul automat organ bookmark content proc intern world wide web introduct conjug gradient method pain ron mark peter david gi ord hierarch network search eng exploit hypertext cluster seventh acm confer vasant le miller mobil intellig agent document classi cation machin learn approach fourteenth european meet cybernet system research articl process latex macro packag llnc style
AI/739 2 causal model mobil servic robot behavior michael henrik dept comput scienc abstract tempor process predict happen robot execut essenti autonom servic robot successfulli plan mission paper describ causal model behavior exhibit mobil robot rhino run concurr reactiv plan perform offic deliveri job model repres aspect robot behavior repres action model ai repres tempor structur continu control mode kind uncertainti enhanc express enabl robot plan kind behavior flaw includ miss deadlin whilst exploit opportun causal model valid robot simul introduct tempor process predict happen robot execut essenti autonom servic robot successfulli plan mission project plan robot causal model repres effect action ai plan system fairli simpl model action restrict work plan partial order set action autonom robot control plan partial order set atom action thwart opportun improv robot behavior plan action robot extent space time inform plan defici action extent depend time requir plan system predict action long overlap concurr action inaccuraci sensor effector requir plan system comput flexibl plan reason likelihood priori unknown vari flexibl plan violat assumpt underli action model plan assumpt irrelev tempor structur action concurr action wide rang behavior flaw typic servic robot requir planner make model repres continu exogen concurr incomplet passiv sensor fig rhino paper describ model predict behavior gener robot control offic deliveri job control design robust effici execut deliveri plan autonom mobil robot rhino fig robot causal model repres kind tempor structur concurr execut continu control enabl transform plan system varieti behavior flaw predict execut scenario quickli scenario causal model continu control process gener tempor project process project algorithm causal model tailor surround plan state execut causal model predict state transit continu process affect plan execut rhino navig behavior principl concurr control process navig behavior advantag kind control difficult imagin sophist planner mobil robot applic adequ model navig navig understood capabl mobil navig suitabl mean valid causal model concurr continu process paper proce section describ plan offic deliveri robot project rule languag causal model action sketch subsequ section section model rhino behavior appli rule languag model base navig plan event occur environ give result accur symbol predict robot behavior plan offic deliveri robot structur reactiv plan deliveri robot respond sensori input order accomplish job written plan robot control languag local subroutin concept synchron parallel make plan structur reactiv deliveri plan illustr advantag plan concurr reactiv sketch plan specifi rhino fig deliv mail room planner robot perform deliveri order room close deliveri complet plan system plan robot accomplish deliveri opportun robot interrupt current deliveri deliv mail fig deliveri complet pass door estim door angl seq deliv mail dieter figur offic deliveri plan constraint robot pass door estim open angl door laser rang opportun deliveri room learn offic carri job construct mean primari activ execut satisfi polici polici concurr process run primari activ activ interrupt primari event requir rhino perform action handl program variabl signal valu enabl control thread react asynchron event statement endless loop execut fluent control block thread control fluent true deliveri interrupt robot detect door opportun side move robot offic interrupt deliveri plan replan continu implement navig routin loop gener execut base navig plan robot arriv destin interrupt handl termin current iter loop start iter navig plan start rhino posit gener base navig plan base navig plan concurr reactiv plan figur pictur navig automat gener destin navig planner plan consist compon specifi sequenc target point locat index number figur reach robot navig target point accomplish standard path planner dieter desk fig topolog navig plan compon specifi detail robot adapt travel mode navig path indoor environ advantag adapt drive strategi drive carefulli offic offic switch sonar drive doorwai avoid drive quickli hallwai part plan depict region textur travel mode robot cross boundari region travel mode set issu requir rhino receiv electron mail back move tabl room situat task tempor project modul deliveri plan fig predict conjunct plan project modul predict robot miss deadlin deliveri room opportun complet deliveri robot bump tabl enter room switch sonar sensor enter make predict requir robot plan system model ffl continu process base navig plan predict endogen adapt drive strategi pass door ffl exogen event open door room ffl concurr behavior deliveri plan make open door room deliv ffl incomplet inform includ durat sensor ffl passiv sensor obstacl avoid model predict read passiv sensor determin action tempor project event effect tempor project algorithm develop mcdermott plan project process current world structur reactiv rule gener exogen rule probabilist guess miss piec world model probabilist causal model basic control routin gener execut scenario plan execut scenario repres execut robot control environ structur reactiv control execut timelin linear sequenc event result timelin repres effect plan execut term time event time instant point time world due action robot exogen event occas stretch time world state hold describ time interv proposit true plan projector work plan execut plan interact real correspondingli project plan interact timelin place base navig projector guess result execut plan assert effect form proposit timelin mean causal model remaind paper summar ffl project rule form es routin start event es occur return complet outcom form routin complet successfulli statement specifi signal behavior modul behavior complet ffl effect rule event occur probabl creat clip state effect rule form occas hold time unit ffl exogen event rule rule gener interv gener random event averag space time unit mcdermott formal semant rule languag introduc show consist set rule uniqu prove algorithm build retriev timelin correct show averag perform robot plan improv base small number randomli project scenario model rhino behavior descript offic deliveri plan introduct rule mean repres action appli describ behavior execut deliveri list fig deliveri plan control dynam system robot rhino environ fig state variabl dynam system relev deliveri plan variabl repres rhino variabl repres open angl door robot control fluent store robot measur state variabl fluent steadili updat posit track process procedur estim open angl door action gener control veloc head robot effector sensor environ structur reactiv control deliveri plan figur state fig offic deliveri dynam system dynam system model plan execut describ state transit finegrain ai plan simpli make model point deliveri plan robot respond dynam state dynam system potenti chang action drastic resolv conflict requir predict relev event state gener project quickli repres constitut difficult problem appli ai plan autonom robot control approach satisfi requir construct part causal model continu process base analysi comput state plan execut start process model behavior gener base navig plan complex event qualit behavior adapt travel robot posit relev execut plan enter hallwai pass realiz continu process project analyz comput state extract condit process wait concurr branch deliveri estim condit true valu system variabl time gener causal model project plan project continu behavior effici reason process project continu process divid phase phase estim schedul endogen event effect process effect process schedul transform causal model tailor plan project phase project plan model endogen event construct phase phase account concurr event causal model situat assumpt precomput schedul violat project modul model dynam system specifi continu control process state variabl state variabl fluent measur state variabl base navig plan steadili chang robot posit variabl estim posit robot store fluent extract relev condit projector start project base navig plan comput set pend condit depend fluent measur state variabl dynam system chang base navig plan condit implement fluent network fig fluent network room fluent network digit circuit compon circuit fluent fig show fluent network output fluent rhino room input circuit fluent circuit updat chang structur reactiv plan set fluent network comput condit plan wait automat determin relat queri determin set fluent network network output fluent plan thread pend depend fluent measur state variabl chang base navig plan endogen event schedul class continu process provid endogen event schedul initi condit fluent network trigger process comput endogen event schedul endogen event schedul base navig plan section kind process base navig process paramet destin pend fluent schedul return sequenc predict endogen tripl form delai ith event valu state event place state plan true time instanc event trigger event model set fluent retriev valu state variabl measur appli sensor model set fluent causal model base navig plan project initi execut navig plan start event hypothet complet event infinit number time unit shown project rule effect rule start event base navig plan comput endogen event schedul assert schedul occurr endogen navig event occas timelin occas trigger endogen event remain condit determin paramet schedul event rhino posit effect rule event specifi thing endogen event occur time unit run follow path event finish sleep event occur model base navig plan present suffic long import carri plan exogen event object slip robot hand project time instant robot motion predict locat object projector predict locat robot time assert timelin qualit behavior robot adapt travel mode describ effect event rule specifi time instant event occur state hold state probabl persist event clip event event state hold adapt time endogen event schedul shown event project endogen event shown schedul construct section describ implement endogen event schedul base navig plan schedul predict effect base navig plan state variabl endogen event schedul assum robot straight path locat point kind event qualit physic chang trigger condit plan wait qualit event base navig plan pictur fig occur robot arriv locat robot travel mode arriv destin time instant occurr predict schedul trigger event work transform fluent network condit predict appli algorithm comput event occur condit base navig plan repres region environ condit true robot region elementari condit numer constraint rhino posit distanc rhino target point schedul assum fluent network chang execut plan complex network construct conjunct disjunct elementari condit fig initi predict endogen event endogen event schedul approxim region rectangular area order appli faster comput method region maxim distanc approxim surround squar step perform endogen event schedul transform fluent network union intersect rectangl step endogen event schedul overlai path intermedi goal point topolog navig path fig region comput previou step comput schedul endogen event navig path collect intersect region figur result schedul step sequenc tripl form hx fig modifi endogen event schedul reschedul endogen event problem tempor projector deal step execut base navig plan project robot enter polici open angl door pass trigger causal model comput endogen event schedul longer suffici fail predict event problem handl modifi endogen event robot start wait condit function robot interrupt project base navig adapt causal model base navig continu project case enter endogen event schedul comput endogen event pass doorwai updat schedul endogen event pictur fig project exogen event type exogen event event addit inform time event dieter back lunch kind event repres rule rule rule specifi event state hold persist time unit event trigger longer hold passiv sensor obstacl avoid avoid model situat robot told object move case endogen event schedul add region object region block destin robot move region gener effect rule bump event specifi robot activ sensor detect base navig plan fail failur descript bump event gener sonar sensor sensor tabl avoid modul avoid tabl sonar sensor activ predict projector determin long sonar sensor switch bump event occur result valid causal model base navig plan role offic deliveri plan respect comput qualit predict quantit result project plan list fig averag project gener timelin event long stack frame event gener reschedul endogen event robot sole concern project process slow offic deliveri spend time interact pick deliv mail planner adequ time debug deliveri plan fig project navig behavior behavior gener simul figur show predict endogen event number behavior gener navig plan robot simul qualit predict behavior relev plan debug perfect fig projector predict correctli robot exploit opportun locat locat scenario discuss projector perfectli predict relev qualit aspect robot robot bump tabl miss deadlin valid causal model compar symbol project behavior gener deliveri behavior gener robot simul behavior simul real robot shorter seri experi predict time perform singl navig task inaccuraci due high varianc navig behavior grain size time everydai activ peopl leav rang minut accuraci predict suffici relat work due space limit give detail account aspect relat work relat work research reason action probabilist numer qualit reason excel detail discuss import issu tempor complex concurr action event probabilist inform present framework repres probabilist exogen endogen event medic predict problem smaller problem gener causal model plan extend wai handl express action model kind uncertainti initi state occurr outcom plan algorithm comput bound probabl plan outcom abstract rich tempor structur event assum discret atom action ignor kind uncertainti partial observ markov process focu optim action uncertainti approxim algorithm pomdp appli state space larg work qualit reason research issu quantiz continu process focuss thing quantiz relev kind reason perform point limit discret event introduc limit notion process chang influenc multipl process state variabl repres event spatial tempor piec time histori intersect interact forbu qualit process theori techniqu call limit analysi appli predict qualit state transit continu event work simul address adequaci causal model rang predict issu neglect model ai plan improv robot action planner equip realist model robot behavior physic world paper causal model behavior exhibit mobil robot rhino run concurr reactiv plan perform offic deliveri job model repres tempor structur continu control mode kind uncertainti model plan techniqu high probabl execut failur base randomli project small number execut scenario detail model autonom robot behavior plan techniqu enabl implement control system servic robot perform averag possibl plan avoid categori behavior flaw avoid plan system futur work develop causal model robot behavior focu learn causal model interest process map search vision manipul action refer allen ferguson action event interv tempor logic technic report comput scienc cremer integr activ local control system submit robot autonom mcdermott improv robot plan execut kri intern confer ai plan page morgan mcdermott fast probabilist plan debug european confer page weld probabilist plan inform gather execut proc int conf ai plan system morgan dean plan control morgan kaufmann san thrun dynam window approach avoid ieee robot autom march forbu qualit process theori artifici naiv physic manifesto hobb formal theori page model simultan action continu process artifici probabilist tempor reason endogen chang confer uncertainti artifici page lesli pack anthoni jame kurien act discret bayesian model navig intern confer intellig robot weld algorithm probabilist plan artifici mcdermott reactiv plan languag research report yale mcdermott transform plan reactiv behavior research report yale mcdermott algorithm tempor project research report yale mcallest systemat nonlinear plan page parr russel approxim optim polici partial observ stochast domain proc fourteenth intern joint confer artifici map learn navig rhino rp mobil case studi success robot system mit
IR/740 5 boost rocchio appli text filter robert schapir yoram singer amit singhal lab research park florham nj januari abstract discuss learn algorithm text modifi rocchio boost algorithm call adaboost show algorithm adapt maxim gener util matrix associ cost pair machin predict correct label show adaboost significantli outperform highli effect text filter algorithm compar adaboost rocchio larg text filter task algorithm compar effect adaboost produc classifi rocchio train collect larg number relev document rocchio run faster adaboost introduct increasingli hard cope electron inform inform filter system automat send articl potenti interest necess inform ag typic user interest filter system exampl dislik system automat learn user profil classifi user articl exhibit substanti match user filter user text filter binari text classif categori problem text filter studi commun machin learn inform retriev algorithm text classif evalu bayesian nearest neural studi rocchio method algorithm ir commun relev feedback document comparison baselin classifi aim studi examin rel merit fairli ml algorithm call advanc version rocchio method develop text filter algorithm base freund schapir adaboost algorithm success famili boost algorithm main idea boost gener weak classif rule combin singl highli accur classif rule boost algorithm attract theoret shown perform standard machin learn task compar adaboost algorithm blum studi freund al appli text filter cohen singer algorithm shown effect current text filter algorithm show text adaboost definit superior previou studi text classif simpl version rocchio algorithm baselin comparison case version rocchio method text filter carefulli tune task hand develop effect version rocchio algorithm suit text filter compar perform algorithm adaboost previou studi text filter dataset evalu measur render rel comparison approach imposs evalu measur past evalu filter effect recent trec confer move util measur choic evalu text filter studi effort publish result util research comparison futur studi aim ffl develop algorithm text filter base show algorithm highli effect algorithm text filter ffl develop version rocchio algorithm suit text filter ffl studi merit classifi ffl present result base evalu measur research futur comparison rest studi organ section discuss evalu measur text filter section describ adapt adaboost text filter section develop modifi version rocchio algorithm text filter section describ dataset studi section describ experi discuss result give section evalu measur past studi text filter varieti measur evalu perform measur list short discuss problem measur evalu perform ffl recal averag fix rank measur intend evalu rank effect system binari classif effect binari classif effect system relat rank relationship strong rank evalu measur evalu text filter ffl lewi measur measur choic studi text categor roughli point point recal filter system point system recal system aim filter system obtain high point numer problem evalu filter system interpol score obtain point interpol valu achiev system point recal equal desir inform target user perspect point averag class averag set class hand class complet overshadow result rest class point evalu text categor ffl van rijsbergen singl valu measur depend rel import user assign recal pp main drawback measur directli interpret user hard user judg rel import recal user find hard recal import ratio big drawback measur depend recal recal test document measur evalu system comput measur portion document classifi rest classifi instanc user check end dai filter system face problem assess perform measur studi evalu measur dont suffer drawback mention simpli error rate classifi term util measur aim evalu binari classif report perform result fourth averag averag suit evalu filter report averag comparison research machin learn algorithm error driven minim train error made measur averag measur deem inappropri evalu perform learn algorithm classif error classif error simpli number mistak classifi sum number posit document classifi number document classifi posit classif error standard evalu measur machin learn task firm theoret foundat util problem classif error dataset relev classifi simpl strategi predict document achiev low error rate handl common specif reward classifi find relev document trec text filter evalu util assign unequ reward pair machin predict correct label number relev document classifi relev number relev document misclassifi irrelev number nonrelev document classifi relev irrelev pair human classif machin predict associ util denot util valu tabl perform classifi term util matrix largest matrix note minim classif error maxim util matrix learn algorithm maxim util minim classif error util matric paper tabl boost text filter describ adapt freund schapir adaboost boost algorithm text filter main idea boost combin test presenc simpl notat rank assign classifi document set relev document denot rel averag jd error machin machin tabl util matric experi word document predict document predict relev rule kind misclassifi document main idea gener combin rule principl manner produc singl highli accur classif rule call weak boost assum access algorithm subroutin gener call weak learner weak learn algorithm boost algorithm call weak learner time gener combin singl classif rule call final combin hypothesi main featur boost algorithm assign import weight train document weak learn algorithm weight correctli classifi document account greater import correctli classifi document assign greater weight algorithm train document hard classifi correctli increment higher weight document easi classifi lower weight forc weak learn algorithm concentr document misclassifi deriv final combin hypothesi classifi document comput predict weak document vote predict descript adaboost shown figur adaboost input train set pair document train label document mean document relev irrelev judg human adaboost call weak learn algorithm repeatedli seri round round adaboost set import weight train set comput weak hypothesi document classifi discuss weak learner experi import weight maintain formal distribut train document distribut denot distribut round weight train document distribut written maintain condit posit classif set weight equal initi procedur util goal weak learner find misclassifi document rel distribut weak learner attempt find weak hypothesi low weight error ffl error interpret probabl misclassifi document chosen randomli distribut sum weight relev document classifi irrelev irrelev document classifi relev obtain hypothesi adaboost updat weight document document classifi correctli lower weight misclassifi document higher weight adaboost multipli weight document correctli classifi weight incorrectli classifi document ff ff number comput discuss assum moment ff updat weight effect weight correctli classifi document weight correctli classifi document ff ensur weight form distribut renorm result updat rule shown ae classifi correctli ff classifi incorrectli normal factor note product equal rewrit updat rule succinctli figur process gener weak updat weight repeat round decid discuss section valu ff ff document classifi final fin sign ff predict weak evalu document predict combin vote weak predict document relev irrelev sum posit combin predict relev predict irrelev assign equal import predict weak weight vote weak valu ff updat distribut discuss exact choic ff ffl weight error weak hypothesi comput figur eq comput ff ff ln ffl ffl understand choic highli accur weak hypothesi found ffl small ff larg translat drastic updat distribut greater weight assign predict comput final hypothesi highli inaccur error ffl close ff updat distribut predict final hypothesi receiv low weight freund schapir complet motiv choic ff ff neg case weak hypothesi found error ffl greater discuss find weak weak learner gener hypothesi word pair adjac word potenti term implement capabl arbitrari long restrict word word bigram studi weak learner comput error distribut incur predict document relev term error mean term occur document rel mean document select term lowest classif error consist main aim select term maxim differenti relev nonrelev term lowest term highest discrimin relev document higher confid confid relev document select hypothesi term minim select term form hypothesi document ae mention select term high error hypothesi boost algorithm automat assign neg weight hypothesi mean word predictor presenc automat reduc score document boost gener util function remain describ modifi algorithm order maxim gain gener util matrix util matrix notat introduc section gain classifi make natur assumpt gain correct classif incorrect minimum gain classifi classifi document gain assign initi gain aim classifi maxim addit gain amount time classifi classifi relev document gain time document classifi gain misclassif account misclassif result util util matrix impli relev document irrelev document relev document worth factor set initi distribut exampl round boost reflect ratio posit neg exampl fairli straightforward show maxim util matrix minim error initi distribut weight relev document time weight irrelev document handl gener util modifi adaboost manner weight initi set ae normal factor ensur note rest algorithm unaffect chang initi distribut number round set number round theoret analysi number round boost weak set empir found procedur yield good result run boost algorithm train error reach minim number round reach minim train train error combin hypothesi uncommon boost proce reduct test error occur schapir al discuss error continu boost addit round total number round typic mean run round boost algorithm problem requir featur attain small train error put size result function number featur depend classif problem difficult problem larger classifi build rocchio text filter retriev document challeng problem field inform retriev earli research realiz hard averag user formul success aid good queri formul provid user automat queri formul relev feedback user mark document retriev initi relev success method ir feedback queri creation algorithm develop rocchio proven relev feedback algorithm rocchio algorithm develop framework vector space model rocchio defin optim queri queri maxim averag similar relev simultan minim averag similar document rocchio show optim queri vector differ vector centroid vector relev opt denot term weight repres document number relev total number articl collect neg compon result optim queri assign weight maintain focu research found includ origin feedback queri creation process coeffici introduc rocchio formul control contribut origin relev articl feedback queri modif yield queri reformul function ff fi fl develop rank document relev interact successfulli text filter inform filter document mark relev user inform creat rocchio formul articl similar user profil consid potenti user user text filter document mark belong formul learn fact document exhibit high similar weight vector form linear class techniqu improv effect rocchio method develop effect conjunct rocchio algorithm queri recent singhal al select set document relationship user queri class text rocchio method sampl document form queri zone dynam feedback bucklei al shown optim term weight rocchio formul train collect improv qualiti feedback queri test data assumpt rocchio definit optim queri vector similar measur experi techniqu version rocchio formul singhal shown enrich featur set usual word phrase ad word pair improv qualiti feedback queri word relev document inform exploit improv classif effect initi text classif factor eq ff system centroid vector relev document train corpu initi queri vector form queri zone step involv rocchio method text initi creat centroid vector relev document train data document weight tabl remov word fewer relev document phrase fewer relev document infrequ term influenc queri select highest weight nw word nw averag number word document initi queri initi weight train document form train select top rank max document initi queri document relev document train form feedback queri rocchio formul ffl document term weight ffl word word relev phrase occur relev articl consid feedback queri ffl top nw word weight rocchio formula retain feedback queri weight predict formula queri form step good recal queri enhanc add pair queri ffl nw queri word previou nw ffl occur fewer relev remov ffl add tool train top jrj document step jrj number train relev document ffl relev restrict set document tighter add queri step highest weight weight rocchio formula weight document comput weight lower constitu word tf consid pair tf pair idf comput fly comput true pair df intersect individu word invert list term weight queri includ nw phrase optim dynam feedback optim pass ratio optim feedback queri rank weight train document rank list train find similar threshold maxim evalu measur rate train data threshold classifi util number min po max po train set test set dataset check task size size tabl summari dataset experi test document weight test document similar higher threshold feedback queri classifi test corpora text corpora test test collect research pai special attent document variat origin topic text suppli user experi text categor test collect made publicli web page david origin compil collect document collect collect reuter newswir modifi apt split assign document date april train document date april test set nineti topic categori relev train document relev test document class experi list tabl number relev train test document test collect made document ap newswir includ trec disk document year train document year test collect document collect distinct titl field sgml tag distinct bodi field sgml tag bodi document experi twenti class collect tabl collect lewi al lewi al titl portion document studi note origin distribut data document year year make total train omit lewi al consist test skip detail document skip creation collect david lewi trec disk rout task text retriev confer train collect document trec disk test collect made document disk total train document test document fifti trec number individu class collect trec topic long word text topic text system relev judgment topic trec data summari collect experi shown tabl preprocess entir reuter collect train test long time run adaboost entir trec collect subset train collect train set select top document retriev train collect queri learn rocchio method idea ad relev document retriev procedur train set appli procedur collect test document classifi built adaboost test relev document test collect top test document retriev rocchio queri obtain sampl train collect rocchio mean train test collect includ document difficult classifi result obtain dataset good estim perform classifi experi result section describ experi discuss result adaboost compar sleep expert give result show adapt adaboost text filter achiev result effect algorithm text filter studi recent cohen singer compar perform adaboost reuter task figur show result comparison scatter plot left hand side figur show class function number relev document train collect point make error adaboost clear plot adaboost outperform benchmark similar indic adaboost outperform obtain hand side plot figur plot show cumul error differ move class relev train exampl class larg number relev document train set plot check rel perform algorithm depend amount train data cumul error differ adaboost monoton class size size class defin number relev train document adaboost gener outperform exact number experi list tabl figur show similar compar plot perform adaboost rocchio dataset left hand side scatter plot give differ error util adaboost rocchio function number relev train top scatter plot differ middl differ bottom point adaboost achiev point line rocchio outperform adaboost error slp exp adaboost number posit exampl cumul error differ cumul number posit exampl error slp exp adaboost number posit exampl cumul error differ cumul number posit exampl figur differ cumul differ error rate adaboost reuter scatter plot corner indic adaboost significantli rocchio class larg number relev document train collect raw number tabl find top class adaboost significantli outperform class highest number posit train gener observ class larg number relev document train adaboost achiev lower error rate higher util valu fact confirm hand side graph figur set plot show cumul differ error util move class relev train exampl class larg number posit train document point line adaboost accumul credit graph reinforc notic differ perform algorithm start class larger number posit exampl train set graph close reach ten largest problem reuter dataset result shown figur remark parallel result reuter twenti adaboost significantli rocchio evalu measur class class japan class relev document train set tabl averag inform measur text filter observ tabl class averag achiev rocchio margin averag adaboost rocchio make make classif error error adaboost make similar behavior observ class task tabl time algorithm task current implement adaboost averag minut class learn classifi current implement minut class averag differ run time make adapt rocchio text filter choic collect relev document trec observ figur notic differ perform algorithm queri queri zone hurt rocchio observ scatter plot point class relev train exampl line indic rocchio margin case task notic differ method individu class score found tabl task show filter relev document import hard job algorithm neg indic troubl classifi measur develop effect algorithm text filter adaboost base recent develop machin learn base rocchio method develop inform retriev competit find adaboost significantli effect text filter algorithm prior research adaboost significantli rocchio larger number relev document learn notic differ perform algorithm clear larg number relev document oper text filter system current rocchio significantli faster adaboost classifi base rocchio method viabl tool larg scale filter system order make adaboost attract larg problem relev algorithm improv significantli reduc comput time sought acknowledg david lewi prepar data experi comment refer fred weiss languag independ autom learn text method bruce croft cj van seventeenth annual intern acm sigir confer research develop inform page juli blum empir support winnow base result calendar schedul domain page leo breiman arc classifi technic report statist california chri bucklei gerard salton optim relev feedback weight edward peter eighteenth annual intern acm sigir confer research develop inform page associ comput juli william cohen yoram singer learn method text categor annual intern acm sigir confer research develop inform page yoav freund robert schapir experi boost algorithm machin thirteenth intern page yoav freund robert schapir gener learn applic boost journal comput system yoav robert yoram manfr warmuth combin predictor special annual acm symposium theori page harman overview text retriev confer text retriev confer page nist special public april david hull filter descript analysi harman sixth text retriev confer david jan hinrich schutz method combin document filter donna peter ross nineteenth annual intern acm sigir confer research develop inform page associ comput august david lewi person commun david lewi evalu phrasal cluster text categor task fifteenth annual intern acm sigir confer research develop inform page acm june david lewi evalu optim autonom text classif system edward peter eighteenth annual intern acm sigir confer research develop inform page associ comput juli david lewi filter track text retriev confer page nist special public novemb david lewi william gale sequenti algorithm train text classifi bruce croft cj van seventeenth annual intern acm sigir confer research develop inform page juli david robert jame ron papka train algorithm linear text classifi donna peter ross nineteenth annual intern acm sigir confer research develop inform page associ comput august ht wb kl low featur perceptron usabl case studi text categor nick peter twentieth annual intern acm sigir confer research develop inform page associ comput juli quinlan thirteenth nation confer artifici page jj rocchio document retriev evalu phd harvard comput jj rocchio relev feedback inform retriev smart retriev experi automat document page englewood prentic gerard salton automat text analysi retriev inform comput publish gerard salton chri bucklei improv retriev perform relev feedback journal american societi inform gerard salton mj mcgill introduct modern inform retriev mcgraw hill book gerard cs yang vector space model inform retriev commun novemb robert yoav peter wee sun lee boost explan effect vote method machin fourteenth intern amit singhal harman sixth text retriev confer amit chri bucklei learn rout queri queri zone nick peter twentieth annual intern acm sigir confer research develop inform page associ comput juli van rijsbergen inform retriev yime yang expert effect effici learn human text categor retriev bruce croft cj van seventeenth annual intern acm sigir confer research develop inform page juli yime yang reduct statist approach text categor edward peter eighteenth annual intern acm sigir confer research develop inform page associ comput juli error rocchio adaboost number posit exampl cumul error differ cumul number posit exampl adaboost rocchio number posit exampl cumul differ cumul number posit exampl adaboost rocchio number posit exampl cumul differ cumul number posit exampl figur differ cumul differ rocchio adaboost util adaboost vastli outperform rocchio topic acq earn visual show differ topic left hand side plot util error rocchio adaboost number posit exampl cumul error differ cumul number posit exampl adaboost rocchio number posit exampl cumul differ cumul number posit exampl adaboost rocchio number posit exampl cumul differ cumul number posit exampl figur differ cumul differ rocchio adaboost util error rocchio adaboost number posit exampl cumul error differ cumul number posit exampl adaboost rocchio number posit exampl cumul differ cumul number posit exampl adaboost rocchio number posit exampl cumul differ cumul number posit exampl figur differ cumul differ rocchio adaboost util adaboost vastli outperform rocchio queri visual show differ queri left hand side plot util number rocchio adaboost slp exp topic train test error error error acq copper corn cpu crude dlr earn fuel ga gold grain heat incom interest jet job lead lei oat orang rand reserv retail rice rubber ship silver soybean sugar tea tin trade wheat wpi yen tabl result reuter dataset number rocchio adaboost slp exp topic train test error error error bond budget bush german gulf ireland israel japan nielsen yugoslavia tabl result number rocchio adaboost topic train test error error tabl result document integ number iter initi classif call weak hypothesi calcul error ffl set ff ln ffl ffl updat ae ff normal factor output final fin sign ff figur adaboost algorithm binari text filter tf tf tf idf df length normal number uniqu word text averag number uniqu word document tf term frequenc text total number document train collect df number document averag number word document trec factor factor factor factor factor factor factor factor tabl term weight scheme
Agents/741 1 platform collabor agent khale robert maryland thoma technic vienna maryland interact maryland platform agent collabor softwar platform creat deploi autonom intellig agent dynam interact agent impact main goal formal defin softwar agent unlik previou definit ai definit structur behavior softwar program correspond augment code code structur agent program independ evolv softwar agent agent presenc servic offer infrastructur support multiag interact applic provid basic set servic agent access impact architectur achiev goal set special implement deploi server identifi agent provid servic similar request servic impact comput similar search queri successfulli test larg data set architectur impact architectur figur support interact set agent geograph network impact server infrastructur impact agent interact avoid perform multipl copi server replic scatter network impact agent impact agent consist softwar code wrapper code set special server facilit agent manner set data object repres wide varieti wai build select data structur support applic oper frequent definit agent support flexibl choic data agent extend arbitrari data agent consist bodi softwar code wrapper figur show architectur softwar code code consist set data structur data manipul agent build set data type consist set primit attribut record type construct attribut type set function manipul data type function typic ieee ieee intellig system function call support applic programm interfac softwar code function specifi type input output wrapper wrapper basic servic set servic servic agent facilit access servic agent human describ compon detail section figur show servic descript typic store impact server agent individu agent free store inform local messag box program multipl agent exchang messag agent manipul messag box messag box consist set data structur messag set oper modifi messag compon agent messag program state point agent consist data object data object belong data type messag messag box action base set action agent chang state action implement logic procedur code action descript precondit state satisfi action effect state clock send read messag action unlik ai plan action agent explicitli invok rout planner planner queri languag agent built top arbitrari data precondit action condit agent express term data structur agent queri languag express queri condit agent agent agent impact server figur architectur secur action base impact server network action constraint boolean arbitrari set data type queri heterogen data impact herm queri express arbitrari boolean queri arbitrari data type current implement access commerci special data structur softwar packag impact queri tsimmi sim queri multipl data structur concurr action mechan cam input agent state set return output singl action action member input complet composit action action precondit set action execut concurr set action specifi result concurr execut set state thoma eiter colleagu develop specif instanc execut shown ad stronger epistem properti comput complex execut action constraint constraint explicitli state agent state satisfi action execut concurr cam specifi result integr constraint constraint agent state legal robot integr constraint locat uniqu agent agent agent agent program yellow page impact server heterogen queri languag impact server detail function call action code data integr constraint type thesauru interfac messag box network concurr action mechan figur impact agent architectur grei box repres white repres legaci code figur servic descript web site servic find rout point map agent program specifi oper includ action agent principl describ agent condit appli impact specifi oper principl agent program languag creat agent agent legaci program consist associ program action set integr set action agent program extend definit agent state includ structur metareason structur languag code implement servic descript singl languag describ languag seri definit usual english servic descript consist servic express describ servic specifi servic travel plan describ servic sell car servic assum user provid input servic descript input expect input mandatori specif provid semant type specifi input call destin type citi output input servic attribut cost averag time request servic defin servic introduc noun definit noun empti noun term root noun term notat write noun term noun term noun term consid jointli verb defin servic verb constitut definit verb noun servic servic verb search defin input output mention servic expect client request provid input definit type τ set element call valu τ pair type hierarchi set partial order type variabl rang valu definit type hierarchi set symbol call type variabl type variabl rang string input requir invok variabl type usual definit variabl rang object type item valid assum type common imper program syntact object mean variabl assum valu drawn type input mandatori servic honor request servic input servic insist servic requir model field requir field fill user lead definit mandatori atom mandatori atom atom defin servic descript put definit sn servic mi mi mandatori sn mi mi servic descript web site provid travel servic servic descript figur describ rout servic find rout ieee intellig system point syntax describ wide varieti servic world wide rang travel bibliograph search mortgag servic impact server agent terminolog agent describ servic seek agent find agent provid car agent offer servic agent search servic term denot similar determin syntact express semant similar nontrivi facilit impact server includ compon registr type thesauru synchron modul server server maintain data term hierarchi agent tabl process request server emploi algorithm rang queri algorithm term hierarchi hierarchi noun hierarchi verb hierarchi node verb hierarchi set synonym node noun hierarchi set synonym noun term node ancestor node label gener verb provid gener noun car gener car weight edg denot larger similar node involv defin term start assum set σ element relat σ σ set repres synonym σ set verb synonym definit subset σ close class σ denot ordinari notion σ definit direct acycl graph sh vertex nonempti map indic posit distanc neighbor vertic requir satisfi metric sh tripl form denot edg figur show sampl verb figur show hierarchi edg graph direct figur edg node weight edg weight indic similar definit node sh sequenc length path path sum weight edg path readi defin notion distanc node hierarchi provid scan rent sell hire definit sh σ term distanc regard denot exist exist min sh distanc induc welldefin satisfi triangl inequ denot verb hierarchi σ hierarchi σ nt human agent access servic make find pair hierarchi agent exist identifi agent rang find pair agent exist identifi agent defin distanc σ σ nt notion distanc pair verb defin combin distanc function definit σ σ distanc function induc σ σ pair σ σ figur hierarchi noun tabl agent tabl verb agent rent rent rent hire rent sell rent composit distanc map entri definit space present proof agent tabl agent tabl relat tabl primari verb secondari agent agent id tupl tabl mean servic car tabl show agent agent provid impact implement agent tabl oracl relat implement verb noun term integ function search agent tabl find agent provid exact servic execut sql queri select agent verb return set agent set return fewer return entir set algorithm perform algorithm examin hierarchi thesauru determin close pair distanc word synonym tion verb function agent invok algorithm structur agent algorithm intern data structur todo list extend distanc pair request initi call algorithm todo maintain ascend order distanc necessarili complet tabl consist entri number agent point ble answer found distanc request servic algorithm list answer ascend order distanc pair integ return set agent provid servic number exce return select strategi random order agent tabl assum fix strategi discuss issu function track number answer function input todo pair todo consist pair relax nt pair list candid relax nt nt involv part neighbor verb nt nt neighbor nt nt function remov nt todo insert member nt tabl sampl impact thesauru explor investig vehicl truck toyota scan skim provid hand seek rent ensur todo ascend order distanc function return output member todo return special pair function call nt servic hierarchi return pair similar compon hierarchi thesauru includ word synonym tabl figur describ algorithm algorithm verb hierarchi figur agent tabl thesauru tabl function addit call request agent rent car pair todo initi σ σ algorithm execut return empti set agent servic algorithm relax call return todo set call return servic algorithm insert result find algorithm call call return pair car call result return ieee intellig system find agent offer servic closest output relax hierarchi end σ σ sol true true true sol end end middl end end outer search thesauru true return error return figur perform neighbor request request function termin return rang queri algorithm algorithm figur step find pair distanc step expand behav comput set def servic consid expand insert element set todo step execut select find agent offer servic distanc return todo todo nil element insert remov expand return search thesauru return error return end figur rang queri algorithm tion agent find agent offer servic identifi step nt relev verb rang queri algorithm call find similar pair belong registr server owner regist agent relat work agent matchmak match agent request servic exampl daniel kuokka larri present shade coin system matchmak shade logic rule support logic subset knowledg interchang format express coin assum messag document weight term retriev similar gerard smart algorithm keith katia mike williamson present matchmak store capabl agent exact match request servic retriev concentr architectur support load balanc protect privaci agent impact main differ approach main wai servic descript restrict languag similar html restrict articul match term nearestneighbor rang provid effici algorithm implement oper experi main articl user owner expand underli ontolog provid softwar tool explicitli encod servic descript independ develop program number address load balanc privaci respect agent michael genesereth steven ketchpel broadli classifi categori agent convert incom messag request form intellig agent transduc anticip agent send translat difficult categori wrapper code program impact architectur languag express accompani algorithm categori complet rewrit code implement altern fourth gio mediat assum agent commun turn send messag agent framework commun agent requir mediat research extens investig collabor problem solv negat multiag system hierarchi search server interfac user verb hierarchi word describ servic registr server support queri user honda hierarchi server displai part hierarchi includ honda facil owner modifi servic descript account exist expand exist vocabulari needlessli hierarchi user determin registr server insert word introduc user consult user author user introduc agent make hierarchi updat agent tabl approach support interag negoti built top architectur research complement refer kuokka inform intellig inform vol pp salton introduct modern inform agent proc ijcai joint conf artifici aaai menlo pp gasser dynam organiz architectur adapt problem proc aaai aaai pp environ depart proc ijcai workshop intellig wp birmingham distribut agent architectur michigan digit librari proc spring symp seri softwar mr genesereth sp comm vol juli pp integr proc acm sigmod conf manag acm pp se conri negoti distribut ieee tran vol pp nr jen cooper problem solv industri system joint artifici intellig vol pp cooper artifici intellig vol pp js rosenschein rule design convent autom negoti mit program environ applic distribut flow artifici intellig vol pp server updat agent tabl reflect servic offer agent type server server maintain type inform hierarchi type citi subtyp type τ compon item regist human user access type server graphic user interfac registr server type server offer user hierarchi search registr server offer ieee intellig system averag time number neighbor number neighbor figur request averag time averag time retriev answer agent access type server directli contact type server queri type τ subtyp type τ queri agent pipe inform type τ agent requir input type τ answer queri involv straightforward type hierarchi thesauru server server owner agent thesauru find word similar describ servic build top commerci thesauru system thesauru engin server support request word request synonym output thesauru server synonym verb hierarchi type human user access thesauru server graphic user interfac registr agent access directli synchron modul mirror impact server problem consist server solv synchron modul ensur server access data user agent access synchron modul time copi data structur maintain impact server modul updat propag server server incorpor updat server perform local updat incorpor remot modul perform classic impact data structur updat agent ad exist servic repertoir exist agent interact exist agent typic frequent agent servic updat burden system implement experi implement algorithm underli part impact synchron compon graphic interfac commerci oracl mention earlier evalu perform request algorithm number nearest neighbor request rang queri algorithm rang nasa hierarchi consist word hierarchi verb noun impact prototyp assum weight edg hierarchi function addit figur show perform consid gener randomli figur show averag time queri request back answer figur show averag time retriev vari rise linearli averag time retriev answer figur fluctuat figur show rang queri perform ran queri rang unit figur show averag figur show averag time retriev answer averag time queri stai constant number higher number retriev answer radial unit significantli larger averag time retriev answer rang queri approxim extend impact server design support host secur featur support scalabl interact varieti agent includ techniqu agent develop condit inform data servic offer agent includ develop method impact server priorit request agent attempt simultan comput multipl request queu made progress averag time averag time radiu queri radiu queri figur rang queri averag time averag time retriev answer design implement tool wrap agent acknowledg impact joint effort armi research technic vienna koblenz torino work support armi research offic grant armi research laboratori contract nsf young investig award darpa grant grant refer jp mj nr intellig agent workshop agent lectur note comput note artifici multimedia vol sept pp adali process distribut mediat proc acm sigmod conf manag acm lu mainten materi mediat proc acm sigmod conf manag acm chawath tsimmi integr heterogen inform proc anniversari meet inform process soc inform process soc averag time pp aren integr data multipl inform intellig cooper inform vol pp heterogen activ tech report univ colleg bonatti heterogen agent cooper inform pp meta agent submit logic program korth system khale softwar system engin advanc system technolog build commun protocol avion industri technic interest includ intellig inform network pursu phd model receiv bs comput scienc engin ms comput scienc alexandria egypt receiv ms comput scienc maryland colleg park member engin societi thoma eiter professor comput scienc technic head system group inform system depart research interest includ foundat artifici knowledg intellig agent receiv phd comput scienc technic vienna krau associ professor mathemat comput scienc adjunct associ professor institut advanc comput maryland work extens autom negoti cooper autom develop intellig inform distribut artifici logic receiv phd comput scienc hebrew jerusalem phd student comput scienc depart colleg park research interest includ integr heterogen inform queri optim msc comput engin middl east technic turkei robert ross faculti research assist receiv bs comput scienc psycholog area interest agent probabilist tempor geograph inform system subrahmanian associ professor comput scienc depart colleg park work extens knowledg bring techniqu artifici intellig intern workshop logic program monoton reason multimedia research issu direct introduct advanc system wrote principl multimedia system serv execut advisori council advanc logist program receiv phd comput scienc address correspond comput scienc av william univ colleg md ieee intellig system
IR/742 5 web form entri pda oliv hector andrea paepck digit librari project stanford abstract design displai manipul html form small pda screen form input widget shown user readi fill widget shown time form summar screen displai text label prompt user inform challeng design automat find match text label input widget prompt develop algorithm perform match algorithm base base common form layout convent appli combin algorithm simpl html form averag input field form experi achiev match accuraci develop scheme combin algorithm match system system complex achiev accuraci experi involv input field spread complex form keyword mobil wireless access introduct web browser design face special challeng enabl user web handheld palm pilot screen size limit inconveni input inform stand screen size limit issu html page design view desktop displai page layout assum user larg portion page smaller page excerpt displai handheld devic screen result scroll activ time consum input common handheld devic remain error prone time charact recognit improv year solut problem creation special web page small devic page laid optim view small screen approach wireless access markup languag solut requir inform prepar separ displai standard web handheld devic web site administr hard press maintain site standard browser ad addit mainten load approach present inform person digit assist automat miniatur standard html page system browser adjust imag work automat format page displai small screen requir mind approach work detail page drawback approach larg amount scroll action frequent scroll degrad navig phase web search previou relat work power browser web browser handheld devic browser approach support navig view page figur show screen shot system report refer displai entir link anchor page displai default vlsi link web page user tap link action displai text page pen gestur link descript list target link pda line figur link page line ad displai pen gestur notic link crespo page indent result nest navig level displai folder graphic file browser success level thin vertic bar indic level depth row displai text addit navig dynam creat invert index web site user web pda index provid keyword complet user write search keyword figur navig screenshot power browser pen user studi examin techniqu summar web page displai pda web proxi server prepar modifi pda view prepar inform displai afford comput pda show facil outlin effect search address displai manipul html form small displai paper form problem fill form pda screen html page user provid inform upload web server form small collect text input field search engin text input field enter search keyword web site explor compani product inform widget user product site complex form offer advic extens form includ check radio input mechan problem form pda input widget textual explan consum screen difficult user gain overview form inform request design form fill compon power browser show input widget power browser initi displai minim textual prompt field approach user scan understand form quickli user readi fill pen gestur textual prompt input widget displai widget remain hidden figur show displai work focu interfac underli technolog enabl type user interfac approach figur show web page find inform browser site figur show top label displai text label view visibl string label form item button identifi explicitli user tap text activ button link form handl normal hyperlink hyperlink page figur show top form expand user perform pen gestur telephon search input widget user fill pen gestur close form return displai state figur palm oper palm convert html text password input field dot line palm pilot text area similarli convert multipl dot line radio figur origin html page figur form widget reveal figur form widget reveal select widget palm os make input field difficulti gener displai figur origin web page algorithm find proper text label input widget easi human recogn top figur text label input widget make associ easi illustr piec produc portion screen displai figur line html produc text label text input widget render browser call express angl bracket input element input element includ type widget browser displai case attribut machin match task associ attribut input element surround string human easili recogn text label respect input element html clear human input element attribut intend match text label left make associ attribut text label match read left html automat match process perform string match human match extra space result success variat approach mechan test html design match attribut label case attribut input html design browser displai ident string match techniqu fail automat match algorithm make match blindli string left input element match approach work radio button checkbox form item figur excerpt web site figur word input widget label naiv algorithm associ widget label figur text label input widget figur illustr problem occur check box check box common label describ entir group figur label describ plant time season checkbox label turn common label form summar attempt detect displai label challeng sampl difficulti face render form label pda contend design mismatch lead incorrectli transmit form danger encourag includ origin textual inform pda page inconveni danger user long pda screen care prune text surround form widget screen design tension resolv make select text label input widget reliabl call process match text label input widget examin algorithm accomplish heurist form analysi algorithm html form input input element algorithm produc output string excerpt form explanatori label describ algorithm section section describ result experi conduct test perform discuss section explain remain failur plan address heurist match algorithm match algorithm proce step step common chunk entir html page broken chunk small piec html code delimit html text tabl input element result step order list chunk html page label input element chunk chunk text string neighbor chunk select match describ algorithm differ accomplish step describ chunk partit algorithm turn chunk partit chunk identifi find bound html tag paragraph text delimit tag consid chunk text string delimit tabl cell tag text header input horizont rule line simplifi chunk sequenc commerci garden express squar bracket constitut chunk initi string separ chunk string line break tag separ string html tag separ chunk string line separ chunk chunk follow notic chunk show browser screen check box label label describ check box group sequenc chunk introduc notion distanc form string chunk unit distanc chunk line distanc notion delimit scope match activ algorithm string chunk chunk input element chunk examin algorithm obtain empir chunk repres content chunk text content string input content includ attribut chunk input identifi form chunk local distanc begin form global distanc begin web page boolean indic chunk unavail candid match tabl membership chunk field pointer tabl list addit valu input element attribut addit chunk list html tabl chunk index maintain figur chunk tabl index list entri tabl list identifi rang chunk tabl notic tabl nest figur tabl tabl chunk tabl turn identifi tabl figur chunk point back tabl tabl arrai track chunk laid tabl arrai shown figur html layout arrai fill entri arrai point chunk chunk locat cell layout inform import algorithm page layout match heurist set chunk chunk partit algorithm discard make poor input widget commonli encount html form stop phrase includ asterisk mark option field elimin term chunk list term html consid determin notion distanc final pda screen layout manag decid includ stop phrase displai phrase sole label input field notic chunk strategi strategi partit web page displai chunk determin potenti label input element web page partit user screen goal rule partit match algorithm chunk tabl list step match procedur complet list pass match find input element chunk chunk attempt find good label match algorithm fall main categori categori algorithm find label textual variabl input element algorithm yield score measur similar string categori algorithm form layout search label displai close input element algorithm yield score label notic algorithm yield match score section describ algorithm combin reliabl match algorithm inform retriev call techniqu origin conceiv overcom unwant text comparison mismatch word compar differ small typograph error compar word divid overlap substr length procedur result set substr cardin intersect set serv similar score word techniqu gener result match score common notic perform string length divid score sum number typic found simpl number match predictor string involv length yield algorithm input element chunk obtain chunk chunk follow result step set chunk neighbor fewer neighbor input element closer distanc top bottom page element optim span empir determin obtain attribut chunk content neighbor chunk step string discard string content remov space charact perform match attribut step string content string content neighbor chunk highest score provid score greater equal constant threshold constant lowest score consid match empir method led set score meet algorithm report failur literatur suggest tend work success match algorithm algorithm variat algorithm differ li step remov space word chunk string content extract remain word string discard letter word concaten word string fewer algorithm applic develop notic contract frequent html design dual transform substr substr algorithm variat algorithm design match word word contract substr algorithm successfulli match modif algorithm occur step step replac procedur remov space charact neighbor length input element attribut ratio record input attribut neighbor string chunk compar algorithm obtain approxim ratio modifi step partit longer substr roughli length shorter word partit letter partit shorter partit compon letter substr algorithm test presenc letter substr continu presenc lead raw score tabl html form make heavi tabl visual layout tool visual layout form item page strong clue human user pai attent perform match task accomplish automat tabl forc element group visual stack top line neatli row html page tabl predict eventu human user tabl algorithm attempt emul human tend match text label input widget screen figur posit form element tabl recal tabl chunk list enabl match algorithm determin input element locat tabl match input element chunk locat tabl algorithm check string chunk locat tabl cell figur condit case text widget figur text widget intend enter password string chunk locat cell string chosen label string found tabl algorithm check string chunk locat cell immedi left input element match string chosen match string locat left reason cell cell left string tabl algorithm check cell cell final cell string find sequenc trial label algorithm yield score tabl algorithm report score previou text label match input element chunk previou algorithm examin order chunk string chunk string content chosen match string found span previou algorithm report failur algorithm similarli examin chunk follow result made match span null algorithm null algorithm simpli return input attribut input match algorithm return score task match text input element chunk enter electron mail null algorithm match text matter string found neighbor chunk find group label mention section group checkbox label entir label checkbox plant html snippet displai plant radio label text input box label radio button attribut common radio button properti identifi button group group ensur radio button check time render group button screen layout manag place close proxim notic algorithm easili identifi label radio button ensur group label pda displai discard question plant radio make user find individu label group checkbox radio button input system attempt identifi group label group algorithm find group label appli algorithm attribut button group attribut match label case plant score appli algorithm attribut case match label score match label button group correctli yield plant label button attribut notic group label respect text chunk subsequ identifi label individu input element text box bottom html snippet attribut match plant match disallow algorithm find match bottom text box previou algorithm find correct string regist chunk record includ boolean section set true chunk longer match perform experi initi test effect algorithm form form select random select random web page cach million page page page locat site select html design convent site bia perform studi form averag input element call form distinguish form experi input field simpl human manual match correct text label appli match algorithm input element maximum chunk span match threshold consid string chunk neighborhood candid input element requir score algorithm involv match match score input element match highest score set made attempt normal score mechan algorithm success algorithm score greater beat tabl algorithm maximum score scheme combin algorithm section compar winner correct answer found initi larg batch match success larg number form web fill pda simpl form match experi exampl search simpl order form high success rate simpl form encourag tackl complex form base data addit manual select web site fairli complex form element form collect includ input html tabl input text input password input select field list text radio checkbox input element manual found correct label ran experi complex form experi aim measur effect individu algorithm experi examin effect combin algorithm score maxim scheme experi section input element test set ran algorithm input element record time algorithm believ gener success match compar match record failur reason algorithm result tabl show result individu algorithm experi complex form row tabl describ perform algorithm form web site column summar statist number number form site number total number input element match form site test algorithm form total input field includ number show form spread html convent site influenc algorithm remain column result algorithm number tabl cell number time respect algorithm produc correct match number algorithm conclud match site ngram algorithm time match correct match site total input input element algorithm decid pass match pass condit occur match score match threshold bottom column show summari result respect algorithm result total column confront input element algorithm conclud found match case algorithm produc correct match case summari success rate respect algorithm measur entir collect ngram success translat success rate input element total failur rate show respect algorithm produc incorrect result process input algorithm produc incorrect result amount failur rate fourth rate show algorithm ventur match notic previou algorithm appli except occur input element string chunk left null algorithm applic applic algorithm reflect pass rate discuss tabl previou high success expect featur high failur rate featur lower success fail compar ngram stand ratio algorithm make mistak data time applic tabl algorithm match input field site substr tabl previou null total success failur pass tabl match perform algorithm combin input element site substr tabl previou null total total success failur appli analyz frequent failur thought algorithm combin form optim match system section discuss issu common breakdown main failur reason match scheme overli limit imag group label radio button check box overli limit scope occur case figur limit scope failur simplifi html john tabl algorithm note input element cell retriev chunk left element john separ break tag chunk partit procedur separ piec text chunk label chosen input field incorrectli chosen john desir correct match algorithm combin experi match fail due limit scope breakdown imag fault occur correct match text imag perform optic charact recognit imag algorithm find text match fail due imag fault radio button error occur group radio button common miss label individu button algorithm process radio button match attribut surround text chunk process attempt find group label label individu button radio button checkbox organ group group label group individu system produc mismatch insist find label figur show miss individu label algorithm find label label chose notic label instanc realiti user menu valu widget displai make select full displai figur miss individu label dual case occur text select field case html form input postal address figur show figur text field group group label text group label input field input field label pda displai filter group label leav user address request contrari group radio group text field identifi html code common input element attribut valu automat analysi easili miss group systemat address problem group label text field system special circumst produc good result detail case miss group label check box group common input element test set includ radio button check box miss group label text group miss match failur due group problem conclud discuss failur observ failur catastroph user label displai pda puzzl result obtain fill switch displai full html render intermedi plan provid progress disclosur text input field transmit full page scroll full time consum manipul option mind full html render error prone small displai complet form visibl user disori figur checkbox user label correspond checkbox left combin match algorithm observ tabl multipl algorithm correct answer total number success match row tabl significantli input field match find case algorithm perform significantli row algorithm featur match tabl algorithm successfulli match input element observ question combin algorithm match perform optim strategi combin empir develop order strategi observ simpl score maxim algorithm tabl input element algorithm produc match input select match winner algorithm produc attempt null pick match find isol previou algorithm high failur rate null algorithm applic abil discrimin recal label algorithm produc intern html input element intend displai screen gave lowest prioriti algorithm tabl show result combin strategi run full input element data set tabl organ similarli tabl differ column ad list total number input element successfulli match row row input element successfulli match combin strategi lower tabl total match result notic contrast tabl overlap success number algorithm success match distinct match report tabl algorithm input algorithm credit success match algorithm share success match tabl algorithm failur rate compar algorithm produc success rate small optim strategi work complex simpl open question strategi perform weight result depend ratio result algorithm carri vote vote process result algorithm plan continu develop strategi optim perform goal automat dynam web page displai small devic paper displai form devic shown strategi select descript label input element summar form experi show vast major case algorithm find label human make summar form displai feasibl attract wai improv result syntact structur featur analysi improv extend approach account occurr colon end text express favor text chunk trail colon chunk immedi input field lower match elig text chunk web page design grow label imag frequent report facil detect imag input field label alt tag substitut text imag alt tag word phrase imag link html page inform displai user imag load visibl screen alt plan examin perform optic charact recognit imag focu imag page layout posit occupi label refer hector andrea paepck summar pda cellular phone confer human factor comput rc ge willett automat spell correct trigram similar measur inform process hector garcia andrea terri winograd power effici web pda confer human factor comput hector andrea paepck web search pda ninth intern world wide web hector andrea paepck text summar web handheld devic tenth intern web
HCI/743 4 visual collect topic relat web resourc loren terveen hill brian amento virginia tech web page small unit interact analysi web site structur multimedia document consist user interest obtain evalu entir collect topic relat site collect user face challeng organ item report innov address user replac web page web site basic unit interact defin inform group set relat augment site site inform site structur content inform user evalu invent graph auditorium reveal import structur content properti site graph detail analysi user studi document util approach graph construct algorithm filter irrelev site discov addit relev item auditorium augment capabl explor site profil user find site site serv function categori subject interfac multimedia inform navig storag inform search model gener human factor addit kei word cocit collabor cooper inform social social network analysi park build room florham nj park build room florham nj park build room florham nj permiss make copi part work person classroom grant fee provid copi made distribut profit commerci copyright titl date notic copi permiss copi post redistribut requir prior specif permiss fee acm acm transact vol march page terveen al introduct web search navig difficult problem receiv search engin altavista directori yahoo widespread solut attempt user inform interest larger scope longer time satisfi altavista yahoo user manag persist interest broad topic comprehend collect multimedia document relat topic goal address user replac web page structur collect multimedia basic unit interact analysi site reason reason site coher bodi content topic song episod guid current weather divid page navig download time user singl page reason hyperlink site point link site index page analyz structur appropri correctli group page site defin inform repres collect connect site graph clear intuit motiv base concept social network social cocit analysi graph defin term set seed page construct hypertext link seed easi user bookmark index page found search engin graph construct algorithm toler seed affect qualiti graph algorithm add site construct site profil profil inform amount type content site link site profil data inform user evalu qualiti function site enabl user comprehend manag inform develop auditorium commun kei inform site structur central site content provid import intern structur site link figur discuss show auditorium visual system implement java built analyz graph dozen perform experi evalu iter interfac design significantli user feedback acm transact vol march topic relat web resourc fig phoak page ani previou phoak phoak terveen terveen al system creat address problem construct collect web page base effect find good item inform topic expert problem expert topic phoak usenet solut search messag thousand newsgroup mention web page appli set rule identifi mention recommend web page web page rank topic number individu recommend show usenet messag abund sourc recommend web recommend recogn automat high correl number recommend web page metric web page qualiti acm transact vol march terveen al reflect inform phoak identifi set dimens understand design space type system basic unit item phoak collect consist web page web page wrong basic unit individu organ creat web structur multimedia document consist page figur exampl illustr point item front page site item item front page site item group web page site basic unit present user lose obscur fact page site singl peopl found item inform ani tour worth peopl mention item home page book agenc handl ani collect item includ item goal relev item maxim includ irrelev item item includ phoak mention newsgroup categor rule classifi recommend identifi situat item limit relev mention fairli frequent item high relev item illustr common type relev newsgroup discuss carri internet mention discuss technolog occur discuss concern topic directli item illustr common gener public music articl topic interest ani public gener relev site recommend infrequ occur person site maintain newsgroup faq maintain post site regularli feel mention site maintain count phoak rule detect instanc recommend site observ case occur bob newsgroup item collect cluster question primari user concern locat acm transact vol march topic relat web resourc item locat item serv phoak collect order singl rank number distinct individu recommend item evid plausibl metric addit simpli manual examin topic familiar show posit correl number recommend url receiv likelihood url frequent question list faq maintain human topic faq evid relev qualiti url categori function item item good infer titl messag context surround item recommend titl commun page good make type inform pretti page front door site includ inform reinforc point basic goal construct profil site content structur make easi user evalu determin site qualiti function solv problem highlight analysi initi motiv work report articl describ analyz system find explor web discuss wide web research prototyp techniqu argu system suffer shortcom phoak relat web tool main tool peopl find inform web search engin gener directori directori bob index bob inform analyz method phoak dimens note effort involv construct collect summar chief strength weak search engin gener directori search engin offer includ relev item miss directori search result irrelev inform ambigu search result organ duplic page dead link user inform evalu qualiti function page acm transact vol march terveen al phoak recommend web page search engin tabl analysi search engin directori unit composit organ cost index page page recommend distinct individu includ composit depend page peopl mention qualiti phoak categor rule page match inform retriev term queri includ thousand ten thousand item return queri run index web creat web crawler composit depend web crawler ir algorithm page order number recommend titl messag context infer page function page order base similar queri comput ir user infer page function base page titl line text page comput cost process messag store data comput cost index store process queri directori yahoo edg give smaller item relev item select human specif relev topic includ inform user evalu item qualiti short textual annot explicit categori user consult hand make collect item fairli daunt task observ inform yahoo categori miss import page effort inform web found experi user find yahoo textual annot goal seek comput mean construct highqual collect item item organ augment inform user evalu qualiti function item effort research arena address challeng relat research extract visual structur web research sought defin structur extract web hyperlink collect pirolli al al term dimens work concentr acm transact vol march gener directori select page specif select directori page tabl continu unit composit organ cost human select page includ categori librarian seek page accept page submit public involv human librarian mean includ page relev item miss yahoo categori hundr page topic relat web resourc similar gener page item organ includ annot maintain directori discret select site maintain directori gener maintain care apt work harder find relev page typic size hundr page page major cost order human effort involv addit organ annot principl maintain categori collect divid subcategori textual annot includ user determin page function mean organ collect algorithm extract structur attent paid composit algorithm appli directli result return queri search engin consist simpl queri typic level link result page basic analyt unit remain web page addit concern great import research visual interfac techniqu user organ collect tool survei limit constraint html typic simpli present linear list research prototyp labor limit algorithm organ collect web page interfac techniqu explor main theme discuss section acm transact vol march terveen al algorithm organ collect kazman kleinberg build collect issu queri search engin augment result page link link page origin set result kazman argu page connect crucial resourc organ collect judg page qualiti webqueri system sort page class base total number page collect connect displai page seri concentr circl page equal kleinberg defin algorithm identifi authorit hub page hypertext author hub mutual good author page link good hub link author equilibrium algorithm identifi hub author hypertext collect kleinberg show algorithm cluster page effect disambigu queri gener collect queri return item footbal algorithm split page mean research experi improv origin algorithm interest develop relev work algorithm chakrabarti al bharat implicitli incorpor notion unit individu web page chakrabarti algorithm diminish weight assign link confer sourc target page understand logic websit part url system attempt move page basic explor concept base control organ cluster item base predefin vocabulari organ item outlin base properti number incom link spertu experi algorithm analyz link web page find page relat set page infer topic function page marchiori develop algorithm inform link content reorder result return search engin pitkow pirolli report cluster algorithm base cocit analysi intuit cite evid relat pair document stronger acm transact vol march topic relat web resourc relationship appli algorithm georgia graphic visual usabl center web site identifi interest cluster pirolli al defin set function role web page group relat develop algorithm hyperlink text user access data categor page role appli algorithm xerox web site categor page good accuraci mukherjea al botafogo al report algorithm analyz arbitrari split structur easier user visual navig interfac organ collect card al describ book metaphor group collect relat web page view interfac user view manag multipl book addit present set automat method gener collect relat rel link web link extract structur group page return search queri mackinlai al develop interfac access articl citat central ui object repres interfac make easi user articl relat group gener queri retriev articl stand relationship current articl research effort wai view navig inform structur navig view builder folei combin structur content analysi support view hierarch extens oper multipl elast window browser shneiderman effici overview current locat inform structur lamp al explor hyperbol tree visual inform structur al build collect url base text similar present result view furna present theori creat structur easi user navig research creat interfac support user manag collect inform resourc winograd support user contextu evolut interest topic attempt make easi evolv expand acm transact vol march terveen al oper limit appli filter al support larg collect user iter reveal topic structur locat desir document hightow al address observ user return visit page al implement browser companion softwar present zoomabl interfac histori discuss similar research effort structur analysi relationship pitkow pirolli kazman kleinberg bharat spertu maarek al work link page interest function role web page pirolli al kleinberg card al seed site system serv form basi type refer winograd retriev structur relat site card al interest citat document work import differ move page site basic unit system explicit make move work implicitli algorithm present chakrabarti al bharat interfac action card al group page determin boundari onlin difficult problem approach differ group page base context fix organiz unit present heurist problem defin inform graph formal composit collect item relat initi presum user obtain initi collect search engin directori algorithm seed set noisi incomplet gener exploit multipl seed achiev kind previou work collect web page root url defin collect augment result search engin interfac techniqu essenti leav construct collect user card al offer autom techniqu creat basic unit collect built singl web page result collect local singl site system build rich profil site includ link site amount type acm transact vol march content movi index site page phrase user exploit profil determin qualiti function site collect specif page work gather inform page webqueri kazman order page kleinberg link analysi categor disambigu page al organ page base text similar metric profil system build provid site level page site creat auditorium view exploratori interfac user quickli identifi site graphic thumbnail pick site central topic interconnect arrang site properti site explor profil inform site constitu page goal support user determin site function qualiti concept algorithm primari inform structur graph graph direct node repres content object edg repres citat refer content target node sourc node describ construct visual defin term terminolog topic relat web resourc graph link inform structur subgraph graph document similar topic ideal construct analysi structur similar content set seed subgraph graph node seed seed practic imposs construct entir local graph web fetch page site follow link site long web site web constantli local graph move target observ graph subgraph local graph observ attempt construct graph acm transact vol march terveen al fig local formal definit goal comput local graph set seed page defin mean seed notion nk local graph experi converg appeal definit build concept social network analysi scott cocit analysi social filter varian nk local graph seed set edg member edg graph node connect node path length connect path node interest primarili local graph box subgraph graph figur show larger graph graph kei construct product formal notion attempt justifi belief figur graphic depict type relationship interest relationship document infer base relationship cocit analysi document relat cite social filter document refer link similar sort item deal similar topic figur show limit interpret cite input system maintain site page system output term site intern includ role page site system clarifi subsequ discuss acm transact vol march topic relat web resourc fig motiv cite relationship minim illustr formal topic relat subgraph larger graph node intuit appeal interpret term document exist relationship node confid relat notic defin undirect connect link vice versa observ site topic central measur requir bidirect path node import site establish subsequ analysi account order identifi import structur sink sourc requir site relat number ensur find graph number seed particip assum seed deal specif stai topic effect mention earlier make larger simpl tightli connect graph mean site graph central topic optim depend part number seed pick larger seed set size size notic nk graph definit requir site seed start seed site seed site start subset size site particip make nk graph acm transact vol march terveen al construct observ graph defin local graph algorithm approxim comput observ graph design heurist algorithm algorithm produc complet nk local produc subgraph nk graph discuss role sketch describ score function site discuss site defin seed observ graph obtain depend properti seed page start experi user good seed good seed properti seed set seed outgo link link observ graph small empti impli seed particip subgraph graph seed cover poorli chosen seed set lead observ graph small subset topic subgraph case seed distribut compon topic graph seed seed graph site seed problem practic paramet plai import role site ad graph long fewer site site link make threshold algorithm type web fetch html link found induc site page page link fetch analyz store queue candid major algorithm make select page queue expand aggreg page site sketch algorithm webcrawl construct observ graph page queue element score threshold highest score page queue construct site ad page queue expand site add expand site observ graph merg page link expand site queue reorgan page queue end score page queue score metric estim likelihood page queue local graph seed metric acm transact vol march topic relat web resourc effici appli page queue typic thousand page score score page number seed link path length metric cheap comput reason page score seed process experi evalu heurist heurist point continuum site kei claim make web site basic unit web page describ site group page site site organ collect page specif topic maintain singl person group site page plai role tabl site thing thousand site host count site context depend survei research consid investig social filter individu site host proper unit observ suggest definit site suit build relev context set url link expand site intuit site graph link directori site url link url link assum root page site intern url rule appli url merg site root page intern page illustr return briefli ani url seed link notic notion site graph site defin term link graph construct link site acm transact vol march terveen al url select determin belong url set site root page addit system number includ gener convent tild charact user distinct specif heurist structur larg host site tripod mention rule heurist appli page select queue rule heurist url belong site merg common ancestor directori structur root link url distinct site merg link gener host gener site refin rule heurist base idea page link significantli root heavili intern page separ site heurist base idea distinct site point page part site decid link page site site classifi link base relationship root page site link directori root classifi classifi link extern site intern link ad queue candid page fetch page fetch mean expand site primari reason fetch page find link build block graph find index page yield stop expand site find index page sort page queue prefer page word import reason fetch build profil evalu site page accur site profil creat serv introduc paramet control page fetch site discuss site profil comput site profil inform user evalu graph consist collect typic argu user acm transact vol march topic relat web resourc gener addit inform user evalu qualiti function site role site profil fetch page gather type inform page page data aggreg construct site profil site profil includ root thumbnail imag root content page includ audio movi page count link page site identifi intern page topic commun found worth provid access intern page offer interest content count occurr index phrase titl bodi anchor text incom link music phrase includ primari user evalu function site page graph comput number site particip metric judg structur central site topic evalu nk graph verifi nk local graph construct begin set seed construct algorithm obtain relev irrelev site result depend page select seed site profil shown evalu site qualiti function initi inform inspect dozen graph made optimist condit satisfi number result topic user studi describ summar result user studi ani motiv graph idea identifi shortcom phoak ani newsgroup return ani data phoak investig item seed graph algorithm acm transact vol march terveen al tabl ii result appli graph algorithm phoak ani url titl link phoak rank ani tab fleme associ onlin ani ani itinerari dan bern dan bern tour itinerari simpl man ani page ultim band list ani biographi andi biographi quick ani expect ani web ring page ani page dirti magazin disgust dedic great caught tour ran algorithm set limit site crawler site comput delet site seed lead seed isol rest process iter site site remain final graph observ made item seed delet mail list uk time onlin ebai onlin auction site vanish interest relev qualiti site remain graph indic order site number link seed number link site break ti order real explor user experi multipl attribut site tabl ii show top site order top site ad algorithm site wholli dedic ani onlin presenc folk music magazin written ani relat artist number site multipl page link context ultim band list interest seed gener rock music site site graph link primarili gener ani area link page ani similar happen fleme site site book agenc handl folk music acm transact vol march topic relat web resourc gener page tour date page ani link gener tour date page dan artist ani tour produc graph algorithm remov initi seed discov addit relev group page site grate dead examin sensit graph construct algorithm initi seed set experi topic rock group grate dead url obtain yahoo start point experi randomli divid url set size seed set graph construct algorithm experi valu analysi result confirm intuit larger seed set tend result graph cover topic smaller seed set search engin directori yahoo make easi obtain larg set seed topic paramet result tightli lead accur graph quantifi effect remain topic futur research site larg number discov construct algorithm site seed set algorithm overli sensit choic seed rank site graph top rank site cite find broader initi grate dead site link electron frontier foundat site site grate dead part onlin grate dead commun consid import relev commun defin limit interest grate dead user studi carri user studi terveen hill shed light strength limit graph algorithm approach base link analysi invit subtl point claim seed link part topic obviou site point netscap site place download netscap part topic site part concern topic orient commun find algorithm make explicit interest commun acm transact vol march terveen al member laboratori suggest topic interest topic repres yahoo astronomi repres yahoo categori thirti peopl respond provid yahoo suppli directori page set site gather repres interest select yahoo categori random construct local graph analyz result wai comput structur properti graph present randomli select site graph person suggest topic site origin yahoo discov person rate relev qualiti site scale import result topic tightli interconnect topic domin commerci site commerci site tend link site topic link intermedi suggest approach work topic domin commerci site topic extens domin fan strike techniqu work topic site singl topic link site site vast major site reachabl link randomli select subset site conduct simpl experi determin site topic lie link small set seed appli test graph site gave select random subset size site continu site remain made set test count number site reach path length case test seed make detail result clear topic graph experi averag site isol select site random serv test meant site potenti reachabl percent site reach link test seed consid seed analysi reason posit site topic analysi dealt link algorithm add site graph link seed includ discov site skew result acm transact vol march topic relat web resourc tabl iii reachabl site percentag site number seed reachabl suggest vast major fairli larg set site topic includ yahoo reach link small seed set site correl human qualiti relev judgment subject rate connect site significantli relev higher qualiti site discov seed set directori slightli discov site judg high relev qualiti number recal site present user receiv benefit site profil data data prove number total number page prove subject identifi site visual graph structur graph observ web complic easi visual understand figur direct ani graph discuss draw produc sophist graph layout minim edg draw complic clutter edg edg local node constel divert visual attent graphic element viewer identifi node high low layout reveal pattern difficult visual discern central site grasp entir set relationship individu site particip reveal node simpli graph structur list node order imagin inform tabl ii present format acm transact vol march terveen al fig view ani graph displai easi produc make easi user compar node check hide import properti site graph list view easili commun dimens exploit graphic displai imag site commun site properti dynam hide reveal sort singl number acm transact vol march topic relat web resourc fig auditorium view graph user evalu site base inform user result graph analysi term graph result includ site pattern site rank term properti number download file auditorium satisfi design goal meet iter cycl design usabl arriv design call auditorium seat visual hill metaphor arrang seat row row curv center stage figur show auditorium seat visual ani graph thumbnail site page serv icon site auditorium seat visual dynam move acm transact vol march terveen al site user switch gener view graph view site figur show visual mode thumbnail site arrow arrow site site link unlink site drop shadow left note posit result user experi design larg number techniqu commun inform satisfi user discuss detail refer figur identifi graphic element discuss site group site class import properti site assign row base number occur structur central site directli repres displai central order origin design concentr circl user feedback show desir order site circl properti import order number link amount definit end suitabl import distinct user made index site content site dynam order site row properti number proport link amount content type make distinct appar order site row proport site bottom highest proport site top highest proport link site tend top content site tend bottom band aid interpret valu order properti site band grade bright red bright color break occur median order properti site order proport break point visual cutoff site serv indic site serv content repositori graph reveal fine structur link produc visual spaghetti figur user typic link singl site trace edg site design support visual task remov distract visual element site dynam present graph structur user move cursor site focu link site shown reduc draw complet link draw acm transact vol march topic relat web resourc user attent uninform cross edg angl repres link small arrow auditorium view link web click thumbnail drive browser web site revel greater site hold shift kei reveal intern page site link site page author link site found worthi special attent link text inform case click user access displai site profil data find amount type inform site access intern page reveal bit inform site design color scheme ratio text graphic front door page user expect site satur shape banner ad reveal presenc thumbnail user site thumbnail suffici identifi site earli user test highlight necess relev lead construct observ graph user judg site topic topic site ad origin seed site ad stop list user graph move closer ideal topic mind statu current work develop java applet user interact access graph web crawler applet user seed set control paramet crawler present result show thumbnail site profil data access site click user begin explor topic immedi carri design review detail user studi al terveen hill investig util interfac review studi show efficaci site profil data user identifi site identifi kei interfac led interfac design design retain make site profil data visibl techniqu user organ collect reflect understand group categor item begun comparison algorithm link analysi base algorithm chakrabarti al kleinberg preliminari result show comput acm transact vol march terveen al simpl count carri detail analysi make plan deploi system techniqu work topic area domin fan develop web site collect hundr topic area rock music softwar download view collect distribut softwar maintain investig social natur social role commun organ interest onlin inform resourc goal work report peopl find manag collect document relat topic care offer inform formal notion topic relat collect interlink document present algorithm construct graph set seed document algorithm tackl hard problem onlin aggreg individu web page site base context link document introduc illustr auditorium visual graphic overview import dozen site user explor structur relationship site intern structur individu dynam sort aid user understand structur role site plai commun relat site move inform formal evalu algorithm interfac move deploi softwar broad scale acknowledg larri josh peter ju system implement work steve lynn julia hirschberg design discuss review comment suggest refer empir evalu user interfac topic manag web site acm confer human factor comput system acm ny interfac support contextu evolut interest confer human factor comput system mar ed acm zoomabl graphic sketchpad explor altern interfac physic visual lang comput acm transact vol march topic relat web resourc improv algorithm topic distil hyperlink environ annual acm intern confer research develop inform van ed acm ny structur analysi identifi hierarchi metric acm tran inf syst web inform workspac web confer human factor comput system apr van der ed acm search visual web connect intern world wide web confer clara experi topic distil acm sigir workshop hypertext inform retriev web acm ny effect view navig confer human factor comput system mar ed acm citat index institut scientif pa graphic web studi hypertext acm ny public social filter confer work boston acm assess structur commun world wide web comput mediat commun elast hierarch web browser acm confer user interfac softwar technolog acm ny authorit sourc hyperlink environ symposium discret algorithm francisco acm ny techniqu base hyperbol geometri visual larg hierarchi acm confer human factor comput system ed acm publ organ user interfac search citat link acm confer human factor comput system ed acm publ ben system dynam tailor site map intern world wide web confer clara quest correct inform hyper search engin intern world wide web confer clara sand visual web navig view builder comput network isdn syst visual complex hypermedia network multipl hierarch view acm confer human factor comput system acm transact vol march terveen al ed acm publ law electron frontier confer human factor comput system mar ed acm silk extract usabl structur web confer human factor comput system apr van der ed acm commun topic structur larg text collect confer human factor comput system apr van der ed acm ed commun special issu recommend system social network handbook sage thousand ca mine structur inform web intern world wide web confer evalu emerg collabor web acm confer cooper work seattl acm lg find visual graph acm confer human factor comput system lo angel build interfac high volum data confer human factor comput system mar ed acm novemb januari februari acm transact vol march
ML/744 6 find counterexampl induct conjectur discov secur protocol attack graham alan informat edinburgh abstract present implement method find counterexampl quantifi conjectur logic method proof consist strategi guid search counterexampl standard theorem prover perform concurr check inconsist explain briefli theori describ evalu result achiev varieti incorrect conjectur sourc work progress appli method verif cryptograph secur protocol counterexampl secur properti attack method extract trace messag exchang order effect attack applic demonstr advantag complex side condit decid sequenc messag theorem prover natur deal earli result present discuss futur work introduct induct theorem prover frequent emploi verif algorithm protocol program algorithm protocol proof attempt fail hard interpret fail proof addit lemma prove made tool detect incorrect suppli counterexampl order user identifi bug potenti valuabl problem cryptograph secur protocol verif specif area incorrect conjectur great consequ secur conjectur turn attack protocol counterexampl user protocol attack incorrect conjectur automat induct theorem prover specul system encount problem specul formula theorem method detect requir proof consist techniqu autom induct proof logic origin develop prove correct techniqu properti refut refut finit time conjectur inconsist set origin techniqu limit applic comon drawn extend previou research show gener describ implement induct complet part system check refut consist implement check order ensur theorem automat refut incorrect conjectur implement system integr comon prover concurr check inconsist carri check refut incorrect conjectur case induct complet process fail termin parallel process commun socket abil techniqu prove complex induct theorem concern concern show effici effect method refut incorrect conjectur abil prove small theorem allevi problem report work disprov system termin depth limit case small unsatisfi leav user prove system earli result work appli techniqu problem cryptograph secur protocol verif protocol subtl flaw detect year version induct formal protocol verif appli refut detect flaw automat gener sequenc messag flaw induct model arbitrari number agent run finit model potenti parallel session replai attack singl princip requir plai multipl role exchang rest review literatur relat refut incorrect conjectur proof briefli examin method describ oper relat present evalu result obtain system test number exampl sourc includ work reif work progress applic system cryptograph protocol problem present describ work draw literatur review refut incorrect conjectur workshop proof mathemat commun address issu deal theorem work problem earli nineti present sound complet calculu refut faulti conjectur theori free constructor complet search counterexampl guid definit function symbol conjectur depth limit ensur termin counterexampl found reif implement method counterexampl construct integr interact theorem prover method increment instanti formula constructor term evalu formula produc simplifi rule made system proof attempt heurist strategi guid search result subgoal reduc subgoal search termin variabl gener sort instanti constructor term case user left model decid instanti found valid counterexampl minut discuss refut method model construct restrict free involv construct set suitabl send model gener prover approach gener find refut finit work aim address proof consist proof consist techniqu autom induct proof call implicit actual induct rule implicitli insid proof conjectur consist set recent version techniqu shown refut detect finit time proof consist techniqu develop solv problem equat involv set equat defin initi model version techniqu equat theori complet defin equal requir strong restrict applic method complet process deduc consist extend method theori free jouannaud extend requir converg rewrit system complet deduct system linear strategi induct complet restrict algorithm entail examin overlap axiom conjectur kei advantag restrict complet procedur abil cope equat refut complet procedur direct result techniqu extend case method prove consist set equal refut complet linear system extens condit lai foundat method implement spike idea proof consist techniqu induct cover set test set techniqu necessarili incomplet respect prove theorem godel incomplet theorem initi standard model minim herbrand model uniqu case pure equat specif cryptograph secur protocol cryptograph protocol distribut system agent commun secur assum present system traffic network send malici messag order imperson user gain access secret clark jacob anderson needham good introduct field secur protocol typic subtl flaw discov year research appli formal method techniqu find attack faulti prove correct protocol secur approach includ belief logic induct theorem approach advantag disadvantag logic attract found protocol miss model check approach find flaw appli finit typic instanc protocol mean attack attack larger instanc modern state machin approach find exhibit attack requir user prove lemma order reduc problem tractabl finit search space induct method deal directli infinit state assum arbitrari number protocol proof tricki requir dai week expert effort proof break autom facil detect attack method comon shown previou techniqu proof consist product minim herbrand model consist induct consequ satisfi properti defin induct proof reduc firstord consist problem solv satur base theorem prover give summari result case horn equat uniqu minim herbrand case perfect model respect total order definit set formula satur style theorem prove requir order set pure quantifi formula herbrand model isomorph normal pair distinct normal term approach produc clean separ part system concern induct complet inconsist detect complet carri satur base theorem infer step restrict produc conjectur restrict standard superposit rule overlap conjectur axiom consid deriv check consist theorem prover termin set formula produc fair induct deriv kei result theori theorem normal fair induct deriv iff fcg consist theorem prove comon shown concept proof consist extend earlier approach equal predic defin set free constructor ground reduc predic defin jouannaud form suitabl techniqu extend ground converg specif satur specif firstord requir previou relax condit condit equat ground converg rewrit system requir deduc inconsist conjectur prove refut constructor theori converg rewrit system extens theori larger theorem prove remain interest interest wider applic method investig abil proof consist techniqu root counterexampl realist incorrect conjectur implement figur illustr oper system input induct problem satur format normal definit version satur implicit induct hand box problem file proce pursu induct deriv fair induct deriv linda server standard satur refut control client satur problem file file problem file file file spawn satur gener induct complet figur system oper gener pass server refut control program leftmost program gener problem file spawn standard version satur check consist file spawn satur origin axiom theorem mean search inconsist prover design induct problem spawn satur check inconsist lead conjectur refut fewer infer step attempt conjectur standard prover axiom evalu section refut found spawn proof written file complet process spawn satur process kill complet reach induct commun refut control wait result spawn process termin theorem prove theorem advantag parallel architectur emploi refut incorrect conjectur induct complet process termin modifi main induct satur check result messi unwieldi program advantag easili devot machin sole induct complet case harder problem conveni test model deduct process ad consist check preserv attract separ theori deduct consist check process disadvantag implement launch satur process check gener overhead term disk access spawn prover reach satur clear refut control client exist socket mechan cut amount memori disk access requir reduc consist check burden advantag knowledg structur simpl case case free constructor consist inequ constructor term includ rule refer defin suffici limit consist check gener constructor variabl tabl sampl result number show number deriv induct complet number bracket number deriv parallel checker spot inconsist fourth column show number deriv unmodifi prover axiom problem counterexampl found deriv find refut deriv standard prover stuck loop tail graph acycl graph acycl imposs properti kei exchang protocol authent properti simpl protocol section evalu result tabl show sampl result achiev exampl reif work includ previou method proof consist refut conjectur comon show confirm method work conjectur properti secur protocol properti state trace reach end protocol refut proof possibl thing prove newli model protocol result refut authent indic attack protocol protocol simpl includ clark didact requir princip plai role protocol run detail section result reif al exampl requir user verifi model system work formula remain model condit run formula rise inconsist check run system stop deriv term constructor variabl consist formula design check valid term suggest autom model condit check system compar number deriv system number requir standard firstord prover proof consist strategi cut number infer requir evid larger exampl linear strategi cope commut standard prover loop element proof consist techniqu make save requir refut complet result linear overlap conjectur axiom separ theori axiom reduc number overlap conjectur axiom consid time result induct complet posit theori free appli exampl graph reif formal free constructor probabl reason system make larg save deriv restrict overlap conjectur axiom similar natur set support conjectur initi support set restrict method dont overlap formula set support set support strategi standard prover exampl tabl refut found deriv fewer requir standard strategi perform good free constructor case set support doesnt fix problem diverg commut effici method term deriv compar standard prover good actual time system longer standard satur prover design tool larg scale prove term index redund check extrem slow imposs properti minut refut deriv satur system implement proof consist strategi prover system give faster task test system number small induct theorem prove small theorem attack problem highlight candid counterexampl finder return result depth limit reach counterexampl system worth pursu prove small exampl allevi problem result gener exampl miss comon intend investig abil techniqu prove larger theorem futur detail result includ sampl run detail small theorem prove found applic cryptograph secur protocol describ work progress appli techniqu cryptograph secur protocol problem section main thrust research appli formal method problem research appli techniqu model theorem prove modal logic attent paid model abil spy model addit abil particip techniqu assum finit typic agent plai distinct rule possibl discov kind parallel session particip plai role protocol induct model discov kind attack induct model protocol protocol induct approach verifi properti protocol type logic set trace list event send messag formal isabel interact theorem prover properti secur protocol prove induct trace model assum arbitrari number agent part number concurr protocol run plai role discov flaw simplifi share kei give rise parallel session attack singl particip plai protocol role fail proof state difficult interpret circumst expert user unsur proof attempt conjectur fault appli counterexampl finder automat detect present attack exist formal logic concept unif object object set list model logic secur protocol problem model logic model assum agent model nonc detect kind parallel session attack model arbitrari number agent plai arbitrari number fresh nonc kei protocol model model aim close version formal nonc messag free data type defin function eq pure constructor term equal rule defin eq effect suggest instanti condit requir ident agent distinct model horn nonc uniqu identifi number ing function check side condit messag defin condit true eq function cut branch rate search intrud knowledg term set trace messag xt defin set includ xt close project decrypt kei accomplish rule defin messag intrud trace xt member set set includ agent close pair encrypt kei set defin model axiom trace messag model list specif gener requir axiom protocol messag axiom form rule inform xt trace messag address agent trace extend xa respond messag similar model illustr idea figur demonstr formal simpl protocol includ clark jacob survei demonstr parallel session attack protocol requir princip plai role initi respond assum share secur na denot nonc gener symmetr kei princip respond realiti moment model rule messag straightforward extend model give cleaner treatment symmetr kei set agent notic princip respond time formal figur show refut conjectur secur properti lead discoveri attack conjectur attempt prove tricki thought requir order ensur genuin attack refut conjectur detail model includ specif intrud found linda applic highlight strength refut order produc backward style system appli rule side condit refer uninstanti variabl rule appli inform spy extract trace messag break secur conjectur time rule uninstanti rule instanti part side condit satisfi found condit prune redund side condit influenc path search smaller formula prefer default heurist prover mean trace na iv counterexampl search find attract trace start princip send messag princip pursu unsatisfi side condit make formula larger work prioriti system carri experi larger conjectur complex secur protocol evalu techniqu goal parallel session attack discov system discov standard clark good set exampl test system protocol attack kei advantag secur model attack involv arbitrari number particip investig secur protocol involv particip singl confer kei protocol intend implement sophist heurist improv search domain knowledg secur protocol problem heurist includ eager check unsatisfi side condit formula condit discard redund idea vari weight ascrib variabl function make system inclin check formula predominantli ground variabl uninstanti variabl make path attack attract search care requir confirm techniqu remain restrict reduct relax notion reduc requir ground converg rewrit system natur requir function definit reduc model secur protocol problem reduct requir comon extend techniqu detect case price lose reason chanc prove maintain search guidanc proof consist techniqu involv protocol demonstr parallel session attack end assur bs accept nonc na identifi authent messag fj na fj na formula model messag protocol xt xa xb number nonc previou trace extend xa initi send messag protocol xb true true true true xt xb true formula messag formula make share kei symmetr xt trace messag protocol address agent encrypt kei share agent trace extend agent xb respond messag xb xt true true xb xt true true figur model protocol parallel session attack suggest clark jacob end believ oper absent longer cb fj na cb fj na cb fj cb fj incorrect secur refut rise attack inform valid trace start run nonc na receiv repli princip princip repli agent xb xt true true true final line output give attack figur attack discoveri low infer standard superposit conjectur superposit applic paper present work implement method investig induct view prove correct refut primarili concern abil system refut shown result test varieti exampl shown parallel induct complet consist check system requir fewer deriv standard prover tackl problem applic techniqu produc attack faulti cryptograph secur protocol system attack type finit secur model detect intend produc faster implement theorem pursu applic refer basi model comput free data type workshop model comput deduct search error free data type specif model gener anderson needham comput scienc recent trend volum chapter program page canon equat proof autom mathemat induct rapport de recherch april implicit induct condit theori journal autom needham logic authent acm transact comput februari gelernt linda context commun clark jacob survei authent protocol version comon induct consist inform dolev yao secur public kei protocol ieee transact inform march informatik zum von chapter induct theorem prove consist page kapur induct principl equat specif intern confer autom volum lectur note comput page proof induct equat theori constructor journal associ comput jouannaud proof induct equat theori constructor inform system cryptograph protocol analysi journal knuth simpl word problem algebra comput problem abstract page pergamon mechan induct reason aaai press mit american associ artifici intellig page juli low break fix needham schroeder protocol volum page springer prove induct properti abstract data type acm symp principl program page lc induct approach verifi cryptograph protocol journal comput disprov conjectur confer autom page june publish springer lectur note artifici reif approach softwar verif languag tool construct correct volum springer technic report fur universitat flaw detect formal specif page automat analysi secur protocol logic autom deduct intern confer autom lnai page juli
ML/745 6 machin learn research predict marcu depart comput scienc dc juli abstract discuss applic machin learn predict initi result motiv methodolog techniqu select applic involv unequ unknown error skew data evalu methodolog machin learn inadequ analyz perform frequent address problem discuss problem predict data present result motiv evalu learn algorithm rang error cost describ receiv oper characterist extens signal detect theori decad recent begun filter machin learn research revisit predict task present result contradict obtain tradit method evalu kei evalu roc error skew data set paper base present annual meet american societi held novemb dc introduct predict entail predict individu crime prison approach predict surviv analysi task attempt determin long individu commit crime approach predict detect task attempt individu crime approach schmidt witt describ extens comparison parametr nonparametr surviv model data set collect north carolina report result individu predict involv simpli predict individu crime prison individu predict data describ section select machin learn techniqu typic conduct compar evalu select perform method perform measur predict learn recognit concept emploi tradit evalu methodolog percent correct measur perform led incorrect schmidt witt proport hazard model outperform machin learn techniqu survei machin learn commun acknowledg provost skew data set present challeng algorithm abil learn predict minor class situat mistak minor class mistak major unequ distribut train exampl modifi learn method alter distribut exampl data set aim focu attent minor minim total cost mistak receiv oper characterist analysi evalu learn method result principl confront skew data unequ unknown error result appli roc obtain pictur perform classif method obtain tradit evalu methodolog section describ north carolina data set evalu set learn techniqu tradit percent correct briefli discuss issu unequ cost skew data set present roc analysi revisit problem predict perspect evalu learn techniqu roc analysi evalu perform north carolina data set data set deriv north carolina prison system juli june complet data sampl ultim consist individu randomli split train set estim analysi consist individu test set valid consist individu train individu test individu attribut individu tabl drop base level pp schmidt witt scale prior attribut valu divid evalu method origin motiv undertak studi compar varieti machin learn method schmidt witt proport hazard model individu predict data set tabl attribut individu attribut descript type time serv month continu ag ag month time continu prior number previou continu white individu boolean sentenc boolean individu record problem boolean individu record problem hard boolean individu sentenc crime boolean male individu boolean varieti machin learn techniqu construct classifi train set classifi predict class individu test set base perform comput true posit rate number time classifi correctli identifi true neg rate number time classifi correctli identifi ran naiv perceptron ran rule induct tree induct system commerci successor true posit true neg rate method schmidt witt proport hazard model tabl machin learn method proport hazard model problem discuss section explain machin learn method fare poorli unequ error cost skew data set mistak seldom equal neg cost posit encount skew data exampl class exampl stone point strong relationship number train exampl class classs error mitig bia minor class duplic train impli major class skew data set inher higher cost error minor class problem error cost impli data set run counter true error cost inher applic learn method construct classifi tabl perform predict task classif method true posit true neg proport hazard nearest neighbor naiv perceptron report schmidt witt true posit rate posit rate figur ideal roc curv predict major class error minor class wai cope problem alter distribut train exampl cardi freund kubat chang learn method treat instanc class error cost lewi learn method cost analysi construct classifi evalu measur cost error pazzani cost exist solut evalu method rang error standard methodolog machin learn insuffici evalu perform solut exist roc analysi receiv oper characterist analysi exist decad mean evalu learn method rang cost approach plot posit true posit rate produc classifi oper specif set cost paramet roc graph figur lower left corner repres situat posit maxim upper corner neg maxim vari set cost paramet extrema conduct learn sweep roc curv repres method accuraci point classif posit rate true posit rate curv corner tradit roc analysi area curv measur approxim appli trapezoid present analyt test prefer curv cover larger measur problemat curv area domin region space perform measur predict task revisit demonstr roc present result predict task data set distribut train exampl skew sever report data set cardi impact perform machin learn notabl perceptron algorithm inform notion error mistak posit class neg class design ran version naiv nearest neighbor gener roc curv figur accomplish run method true posit rate posit rate naiv nearest neighbor proport hazard origin naiv origin nearest neighbor figur roc curv predict rang error cost plot true posit posit rate cost paramet plot origin point tabl comparison find cost produc naiv bayesian classifi accuraci equal proport hazard model version proport anticip roc curv similar naiv conclud naiv perform task nearest neighbor roc curv cover larger contradict origin proport nearest outperform naiv naiv produc roc curv area produc curv area nearest neighbor produc area origin produc naiv simpli lower roc curv produc nearest neighbor explain perform specul method oper influenc inher unknown set cost induct bia naiv achiev perform rang perform method origin condit simpli inher cost paramet optim problem danger conclud proport hazard nearest neighbor naiv gener roc reveal clearer pictur perform discuss question studi section discuss proport hazard model affect skew data incorpor error cost proport hazard model affect skew proport hazard evalu model individu schmidt witt comput posit true posit rate rule state proport individu predict fail equal proport group expect skew distribut train exampl failur rate comput proport deriv neg true neg rate difficult appli analysi machin learn method failur rate naiv tempt interpret prior probabl class failur slightli failur rate proport hazard model correct prior probabl account inform characterist individu failur rate naiv achiev true posit rate true neg rate roc interior incorpor error cost proport hazard bradlei misclassif cost classifi data set defin cost cfp fn number cfp cost fn number cost neg fortun cost cfp measur cost singl cost select classifi minim cost mistak cost altern system perform term desir posit minim neg method vari threshold proport comput probabl individu fail time schmidt witt failur rate threshold vari threshold produc roc curv proport hazard interest direct futur work conclud remark gener roc effect find classifi error clearer pictur method tradit evalu method compel roc analysi prove reveal hidden aspect perform build system error cost select classifi roc analysi wai pick classifi select method produc roc curv largest provid area measur perform pick classifi achiev true posit rate classifi oper influenc specif set cost error cost desir hit argu classifi nearest apex curv classifi closest point perfect classif util roc analysi situat unequ unknown error cost skew data set evid conduct extens studi data set compil roc curv reveal behavior similar predict studi method oper inher cost paramet consist produc suboptim point roc profound implic evalu select machin learn techniqu bring question valid past studi predict accuraci sole measur perform acknowledg author pam pat eric stephani sage valuabl comment advic research conduct institut studi learn center studi languag inform stanford work partial support advanc research project grant administ offic naval sun gener equip grant author depart comput scienc support work refer area roc curv evalu machin learn algorithm pattern classif regress tree wadsworth improv minor class predict featur weight fourteenth intern confer machin learn san morgan kaufmann induct algorithm machin experi boost algorithm thirteenth intern confer machin learn san morgan kaufmann introduct statist pattern recognit academ press mean area receiv oper characterist curv machin learn librari mountain ca address train select fourteenth intern confer machin learn san morgan kaufmann heterogen uncertainti sampl learn eleventh intern confer machin learn san morgan kaufmann gener aspect locat detect fourth ieee workshop applic comput vision lo ieee press learn detect aerial imag imag understand workshop san morgan kaufmann reduc misclassif cost eleventh intern confer machin learn san morgan kaufmann analysi visual classifi comparison class cost distribut intern confer knowledg discoveri data mine menlo aaai press case accuraci estim compar induct algorithm fifteenth intern confer machin learn san morgan kaufmann program machin learn san morgan kaufmann predict surviv model springerverlag measur accuraci diagnost system
ML/746 6 induct tree faculti electr engin comput slovenia abstract context machin learn exampl paper deal problem estim qualiti attribut depend greedi search prevent current induct machin learn algorithm detect depend attribut kira rendel develop relief algorithm estim qualiti attribut detect depend attribut show strong relat relief estim impur heurist guidanc induct learn algorithm extend version myopic impur function reimplement system top induct estim attribut select step algorithm test artifici real world problem result show advantag present approach induct learn open wide rang possibl machin greedi impur introduct machin learn encompass algorithm learn task seri exampl subfield machin induct learn reinforc induct logic comput learn autom discoveri arguabl learn neural network statist classif put machin learn umbrella collect relev paper illustr develop field extens bibliographi field found contribut induct learn exampl typic induct learn algorithm greedi search strategi overcom combinatori search good heurist function estim potenti successor current state search space plai major role greedi search current induct learn algorithm variant impur function inform gain ratio distanc measur weight evid al measur assum attribut independ domain strong depend attribut greedi search poor chanc reveal good hypothesi kira rendel develop algorithm call shown effici estim qualiti attribut pariti problem number irrelev addit attribut relief correctli estim relev attribut time proport number attribut squar number train instanc origin relief deal discret continu deal incomplet data limit problem kononenko develop extens relief call improv origin algorithm estim probabl reliabl effici handl incomplet data set complex algorithm remain kira rendel relief preprocessor elimin irrelev attribut data descript learn heurist function overcom current induct learn algorithm reliabl guid search learn process paper reimplement assist learn algorithm top induct tree inform heurist function estim attribut qualiti step tree gener experi seri artifici data set result obtain select criterion compar result obtain inform gain result naiv bayesian classifi probabl addit discuss ffl preprocessor elimin irrelev suggest kira rendel ffl deal problem gener seri approach extens relief deal problem suggest kira rendel section describ origin relief interpret extend version section reimplement assist call section describ compar result algorithm briefli discuss approach mention suggest kira rendel potenti breakthrough discuss basi excel result artifici data set algorithm overview relief kira rendel develop algorithm effici estim qualiti attribut strong interdepend found pariti problem kei idea relief estim attribut valu distinguish instanc relief search nearest class nearest class nearest origin algorithm relief randomli select train set weight begin randomli select instanc find nearest hit nearest miss attribut calcul differ valu attribut instanc discret attribut differ valu valu continu attribut differ actual differ normal interv normal weight interv weight estim qualiti attribut formula updat weight good attribut instanc class differ differenti instanc class differ function diff calcul distanc instanc find nearest neighbor total distanc simpli sum differ attribut fact origin relief squar discret attribut diff differ result diff squar number train instanc complex algorithm relat impur function deriv show relief estim strongli relat impur function obviou relief estim attribut approxim differ instanc instanc elimin requir select instanc formula rewrit obtain equal trivial deriv equal jv jv equal gini constant gini gini highli correl class valu attribut differ factor probabl instanc attribut eq kind normal factor multi valu attribut impur function tend overestim multi valu attribut normal heurist avoid tendenc gain ratio binar attribut equat show relief implicitli normal deriv elimin condit probabl put back interpret relief estim averag local estim smaller part instanc space enabl relief account depend attribut detect context local global point depend hidden due effect averag train make impur function myopic extens relief relief deal discret continu attribut deal incomplet data limit problem kononenko develop extens call improv origin algorithm estim probabl reliabl extend deal incomplet data set descript extens reliabl probabl paramet algorithm section repres number instanc approxim probabl eq larger impli reliabl approxim obviou adopt small number train instanc run outer loop relief train instanc select nearest neighbor crucial import relief find nearest neighbor respect import attribut redund noisi attribut strongli affect select nearest neighbor estim probabl noisi data reliabl probabl approxim search nearest averag contribut nearest shown extens significantli improv reliabl estim attribut qualiti overcom problem paramet experi set satisfactori result problem significantli result obtain tune typic major machin learn mention result kind section incomplet enabl relief deal incomplet data function extend miss valu attribut calcul probabl instanc valu ffl instanc unknown ffl instanc unknown condit probabl approxim rel frequenc train set kira rendel claim relief estim attribut qualiti data set class split problem seri problem solut unsatisfactori relief deal multi class problem prior knowledg affect final outcom find miss find miss class averag contribut updat estim averag weight prior probabl idea algorithm estim abil attribut separ pair class class closest note complex number train instanc induct tree reimplement assist learn system top induct tree basic algorithm back cl learn develop hunt al reimplement author describ main featur assist differ implement binar attribut algorithm gener binari tree step binar version attribut select maxim inform gain attribut continu attribut point select maxim attribut inform gain discret attribut heurist greedi algorithm find local split attribut valu subset binar reduc replic problem strengthen statist support gener rule top induct tree algorithm construct binari tree order prevent detail split node hunt breiman cestnik fayyad tree prune techniqu prune part tree threshold minim number train minim attribut inform gain maxim probabl major class current node method develop niblett bratko laplac law success estim expect classif error current node commit prune incomplet data handl train instanc miss select attribut weight probabl attribut condit class label instanc miss valu weight uncondit probabl attribut valu naiv bayesian classifi intern node tree eventu successor label attribut valu train instanc naiv bayesian formula calcul probabl distribut leaf attribut path root root leaf note calcul learn phase leav label calcul class probabl distribut classif manner ordinari leav differ implement main differ assist reimplement attribut select rel shown significantli perform machin learn algorithm cestnik prior probabl laplac law success outcom number trial number trial outcom prior probabl condit jy paramet trade contribut rel frequenc prior probabl paramet set set default satisfactori result cestnik tune problem domain result naiv bayesian formula laplac law success cestnik bratko estim probabl eq probabl root tree estim prior probabl lower intern node train experi data set section describ methodolog result seri artifici data set seri real world data set methodolog perform seri experi compar perform variant inform gain select assist differ assist remain algorithm enabl evalu contribut paramet fix experi naiv bayesian classifi naiv bayesian formula calcul probabl class valu attribut assum condit independ attribut instanc classifi class maxim calcul probabl probabl paramet set experi addit test addit version assist implement idea kira rendel includ qualit evalu result approach elimin attribut variant preprocessor evalu attribut elimin learn attribut score user defin paramet turn result sensit set threshold kira rendel default typic work artifici data real world problem optim select result algorithm result optim algorithm achiev perform note select train set task cross valid train set paramet tune cost complex variant gener tree class problem union remain class class variant requir extens relief problem classif unseen case perform tree conflict situat tree tree normal tree classif experi differ perform effici gener seri tree conflict major case classif unseen classif reliabl seri tree provid point view explain classif experi data set perform time randomli select instanc learn test result averag system subset instanc learn test order provid condit except methodolog experi finit element mesh design methodolog dictat previou publish subsect classif measur averag inform score measur elimin influenc prior probabl appropri treat probabilist answer classifi averag inform score defin inf instanc inf instanc inform score classif test instanc defin inf log log log log cl class test prior probabl class cl probabl return classifi artifici data set gener data set order compar perform domain independ inform binari attribut class random binari attribut learner detect attribut inform easi task domain obtain replac inform attribut attribut valu defin origin attribut xor relat learner detect import attribut fact attribut strongli depend fairli complex problem solv myopic heurist domain instanc gener tree intern binari attribut random binari attribut ad descript instanc problem easi greedi tree learn algorithm approach difficulti due inappropri knowledg target concept pariti problem binari attribut random binari attribut randomli select instanc label wrong class problem hard lot attribut equal score evalu myopic evalu inform gain attribut pariti relat make problem harder attribut pariti relat make problem hardest pariti problem experi artifici data set artifici data set author result author directli compar result condit tabl basic descript artifici data set domain instanc tree bool led boolean function defin attribut class recognit rate target function data set smyth al report classif accuraci naiv classifi problem attribut valu optim recognit rate estim smyth al report classif accuraci naiv classifi data set obtain irvin problem legal chess posit attribut describ relev relat origin data includ set exampl learn test induct logic program algorithm report classif accuraci set exampl instanc attribut coordin piec data set mladen report result accuraci system assist basic characterist artifici data set list tabl result learn algorithm naiv bayesian classifi tabl tabl result show ffl classifi perform domain independ attribut tabl classif accuraci learn system artifici data set domain naiv tree bool led tabl averag inform score learn system artifici data set domain naiv tree bool led ffl version assist perform problem reconstruct tree naiv bayesian classifi significantli ffl successfulli solv problem strong depend attribut interest led naiv bayesian classifi reach estim upper bound classif accuraci suggest attribut consid optim classif domain domain perform naiv bayesian classifi due strong depend attribut inform score tabl show naiv bayesian classifi inform bool domain perform variant assist perform poor instanc belong major perform slightli real world data set compar perform algorithm real world data set problem ffl data set obtain medic center problem locat primari patient problem predict recurr breast cancer year remov problem determin type cancer diagnosi ffl surviv patient suffer hepat data provid gong compar perform algorithm real world data set vote obtain irvin famou soybean data set michalski fisher problem determin type iri flower problem determin number element edg object finit element mesh design problem object expert construct mesh experi object test learn result averag result report dzeroski ilp system classif accuraci result report al descript mesh problem ilp system attribut learner relat ariti describ problem note domain split algorithm test methodolog special case result tabl problem standard deviat tabl basic descript medic data set domain instanc prim iri vote crime basic attribut origin ignor relat descript object domain attribut learner inform ilp learner origin attribut deriv relat background knowledg attribut learner advantag provid addit attribut provid descript object ilp learner inform attribut number addit attribut deriv ilp learner relat descript background knowledg fairli complex task attribut learner data set chanc ilp learner reveal good hypothesi vote record session unit state congress smyth al report classif accuraci naiv bayesian backpropag classifi problem classif crimin educ problem discrimin electron physic data set basic characterist data set tabl result experi data set provid tabl medic data attribut typic independ naiv bayesian classifi show clear advantag data set inform score data set learn algorithm solv problem suggest attribut relev version assist similar domain significantli perform confid level tabl classif accuraci learn system medic data set domain naiv prim iri vote crime tabl averag inform score learn system medic data set domain naiv prim iri bit bit bit bit bit bit vote crime tail detail analysi show problem discov interdepend attribut attribut score poorli consid independ discov regular data attribut similar inform attribut reason naiv bayesian classifi perform provid naiv bayesian classifi addit attribut join depend attribut perform data classifi perform equal note inform score crime data set attribut irrelev class vote data set naiv bayesian classifi version assist compar rule base classifi smyth al interest result mesh domain attribut learner inform ilp outperform result ilp system report dzeroski al addit attribut result induct learner significantli improv induct learn system significantli outperform naiv bayesian classifi problem detail analysi show excel result version assist due naiv bayesian formula calcul class probabl distribut leav section problem test instanc fall leaf train instanc valu attribut test instanc naiv bayesian classifi effici solv problem current induct learn algorithm impur function guid search myopic due greedi search effici heurist estim attribut qualiti deal data set depend independ attribut extens relief enabl deal data set interpret eq explain interest strong correl estim impur function larg number nearest myopic behavior current induct learn system overcom replac exist heurist function variant top induct tree algorithm estim qualiti significantli outperform classifi domain strong depend attribut induct learner overlook relat easili demonstr artifici data shown real world problem detect interdepend result significantli result result overcom useless chang requir construct induct appli achiev good improv construct induct bayesian classifi classif accuraci algorithm explicitli search depend attribut attribut depend discov attribut construct exist call construct induct good idea guid construct induct naiv bayesian classifi obviou advantag domain independ medic diagnost problem naiv bayesian classifi reliabl estim condit probabl inform interest appropri combin power naiv bayesian classifi current induct logic program system attribut appropri demonstr domain attribut learner outperform exist ilp system enabl ilp system deal combin naiv bayesian classifi current ilp system greedi search techniqu heurist guid search myopic interest ilp system preliminari result version ilp system kononenko volum acknowledg equat cestnik prim data milan gong smyth bool saso dzeroski patrick murphi david aha data set irvin grate colleagu saso marko comment earlier draft significantli improv paper work support ministri scienc technolog refer breiman friedman olshen ra stone cj classif regress wadsworth intern group cestnik estim crucial task machin proc european confer artifici intellig august cestnik bratko estim probabl tree proc european work session march springer verlag assist knowledg elicit tool sophist user bratko lavrac progress machin learn sigma press dietterich tg shavlik jw read machin morgan kaufmann applic induct logic program finit element mesh design muggleton induct logic program academ press dzeroski handl induct logic msc faculti electr engin comput slovenia fayyad um induct tree multipl concept learn phd michigan fayyad um irani kb attribut select problem tree gener proc juli san ca mit press hunt martin stone experi academ press kira rendel practic approach featur proc intern conf machin learn juli morgan kira rendel featur select tradit method algorithm proc san juli kononenko bayesian proc european work session springer pp kononenko induct bayesian learn medic diagnosi appli artifici kononenko estim analysi extens relief proc european conf machin learn april de raedt springer verlag inform base evalu criterion classifi perform machin rl distanc base criterion attribut proc int symp methodolog intellig north oct rs rl learn told learn comparison method knowledg acquisit context develop expert system soybean diagnosi intern journal polici analysi inform rs tecuci machin multistrategi vol morgan kaufmann mladen combinatori optim induct concept learn proc intern conf machin learn june morgan pp muggleton induct logic program academ press uci repositori machin learn data depart inform comput scienc learn rule noisi proc expert system decemb stochast approach induct logic program proc conf electr engin comput scienc sept pp quinlan induct machin smyth goodman rm rule induct inform theori knowledg discoveri mit press smyth goodman rm hybrid bayesian conf artifici pp
HCI/747 4 softwar engin knowledg engin vol world scientif publish compani situat paradigm enhanc mobil interact inform system faculti hiroshima peopl interact pai attent thing relat situat problem interfac contextu work environ hard integr comput facilit user accomplish object easili work life situat comput paradigm mobil comput user base physic context activ carri workspac defin infrastructur situat interact provid applic chapter describ model call situat metaphor design interact user mobil comput basi situat comput framework call situat inform file filter present foundat situat applic develop gener schema top stage situat applic applic base present demonstr enhanc mobil interact achiev situat person inform applic introduct comput vehicl rang everydai human activ decad comput specif set type acquisit manag social interact interact activ recent technolog breakthrough person comput peopl find difficult interact comput maintain normal flow work real world kei reason applic knowledg real world situat develop provid explicit function situat comput paradigm enhanc interact mobil environ applic understand context activ convent provid desktop metaphor base comput desktop metaphor comput treat tool specif task write draw imag calcul budget technolog comput easili carri mobil environ object environ power integr comput commun capabl enhanc mobil comput ubiquit chang context activ analyz understand situat central manner independ applic inform pass applic enhanc interact provid function base current situat present paradigm call situat comput achiev develop situat applic respect mobil user inform manag main object situat comput enhanc interact simplifi interfac base real world situat present model call situat foundat achiev person situat comput interact metaphor visual interact design metaphor influenc function algorithm design applic explain chapter situat metaphor design strength stabil demonstr function effect pilot develop carri stage stage correspond design model formal descript situat metaphor situat inform file filter framework develop stage provid softwar abstract core foundat situat comput tool applic implement base framework applic present rest chapter organ section describ necess enhanc interact section review select set studi contribut develop situat comput section formal descript situat metaphor compon framework section applic develop person inform space base section section present applic person photograph call augment album pattern browser section develop interact inform visual situat metaphor chat room section collabor tool develop commun situat conclud chapter section situat interact comput treat kind machineri tool enhanc human capabl special inform process classifi tool physic psycholog physic tool pen extend physic abil psycholog tool symbol system enhanc mental capabl comput peculiar physic physiolog power tool enhanc physic psycholog human capabl seamless wai comput make interact simpl tool order reduc complex interfac comput system present base real world metaphor gradual educ user system function hide intern architectur desktop metaphor base interfac popular approach gener adopt comput system success earli stage person eventu fail support interact requir mobil environ comput brought desktop task heterogen system behavior person physic person circumst interact combin situat enhanc usag comput salesperson bring mobil comput visit custom busi carri activ place access creat inform inform servic provid system physic locat type work monolith found desktop hard maintain effect usag comput disturb workflow integr interact situat work context mobil environ identifi situat interact combin defin interact function devic strongli depend activ context devic necess situat interact situat action theori russian develop activ theori cognit scienc situat interact initi paradigm comput extend convent applic creat set applic gener applic develop provid enhanc interact awar current situat inform main input function web browser obtain situat inform type work statu person graphic interfac facil provid situat set defin obligatori situat situat compulsori input function output servic applic complet reli extent obtain situat inform mobil receiv locat inform current fail commun inform user present approach author develop situat applic mechan integr situat interact primari object situat comput paradigm emb comput peopl interact natur person applianc real world move briefli describ select set interest studi contribut situat comput paradigm relat work inspir motiv situat comput sourc cognit scienc identifi inform process theori cognit situat action theori activ theori describ framework enhanc situat interact cognit psycholog human mental process aim understand human behavior human view process inform etern strive sum interpret incom interpret reproduc inform store memori varieti algorithm cognit psycholog attempt repres mental construct goal stipul procedur action place assess action view equat rigid model intent plan head action real world mechan fall short expect complex realiti human model divorc task context find real world situat action theori action sole depend peopl formal model head human activ suffici comput plan properli interact situat action plan resourc person draw strongli determin outcom event unlik rigid plan cognit plan human activ remain fairli rough tacit level suchman explain detail action great extent link specif situat hand hard predict gener rule action understand rememb situat russian develop activ theori view tool mediat present altern framework interact research design base shortcom situat action theori cognit psycholog complet analysi human natur provid paradigm descript understand human interact comput context environ activ theori consist basic principl hierarch structur mediat develop nardi major differ activ theori situat action theori structur activ determin activ determin human unfold situat action theori activ plai situat goal plan determin activ appli situat contrast activ determin prior analysi object proce motiv partial determin activ situat action activ creat factor converg form situat situat action theori reject notion object engag activ situat action goal plan post hoc artifact reason action action place softwar engin motiv situat comput inform system physic contextu inform retriev inform assist peopl queri offic environ situat comput regard paradigm enhanc power ubiquit augment comput tradit stationari desktop comput studi includ consid situat highli relev physic model situat independ augment memori situat defin contextu factor user person statu requir core concept situat comput extend includ human characterist affect comput social behavior comput rest briefli describ studi relat situat comput situat inform space kind augment realiti displai displai earli present demonstr inform overload overcom segment inform attach physic object space idea user equip comput receiv inform base proxim object real world user space fax machin approach inform receiv fax displai comput system librari electron inform guid user written public requir track unit devic give posit coordin pitch yaw roll orient devic devic work sever limit applic brown framework call document creat applic highlight import contextu awar mobil comput document framework set resembl page html note consist content relev contextu inform trigger mobil user carri pda equip locat place note physic point interest user return locat note trigger inform pda note exist note consid electron form note peopl place work place forget inform thing exampl context trigger note adjac person physic object temperatur level note approach offer gener mechan creation applic basi research work requir system manag locat inform deliveri contextu inform applic virtual realiti techniqu augment convent view addit contextu inform user move real world starner describ wearabl displai overlai text sound normal view physic world emac editor project displai imag overlap view real world menu option displai usual top mount head transmit output radio remot finger recogn posit interpret posit pointer convent displai user select menu option carri activ feasibl situat comput directli discuss hull describ issu develop situat applic illustr design requir technolog import interpret sensor hard repres form knowledg social issu situat comput servic singl server encapsul context acquisit queri interfac applic necess situat comput address illustr work institut set situat applic gap exist peopl find difficult interact electron media maintain flow normal activ discontinu electron physic world order demonstr fact situat comput provid peopl mean make number applic discuss order reduc complex cumbersom develop toolkit handl context inform introduc impress work similar object close concept call context widget introduc mediat environ applic graphic widget gui toolkit mediat user applic widget librari facilit applic develop high level program integr widget applic addit mention work directli requir situat comput indirectli address vital issu give feedback success situat comput research studi present chapter address perspect situat comput viewpoint interact softwar engin approach facilit develop situat applic simpli discuss achiev softwar abstract interfac develop analysi carri order integr situat comput applic level system assist user approach adopt principl activ heavili influenc draft discuss section basic model situat comput introduc properti system level user imagin treat comput situat work space base develop framework applic develop situat metaphor metaphor long recogn plai import role user interfac design serv mean make unknown complex understand format simpli metaphor provid intuit thing work world knowledg desktop metaphor recognit larger role design process languag program function system architectur scientif discoveri introduc situat author strongli integr begin system level user imagin treat comput tool improv interact context convent desktop metaphor base model support requir emploi guid user featur graphic user interfac model person comput support properti relat assist interact situat comput pa expect provid interfac anticip voic dialog depict mobil consult speak digit secretari situat differ convent metaphor correspond intang thing refer circumst user react order achiev target peopl continu learn experi util knowledg carri task human interact situat depend knowledg gain past experi comput electron enforc situat metaphor interfac system behavior integr gradual real world activ interact mobil devic result model depict intellig consult static pictur learn user provid person interfac metaphor approach metaphor present form sourc metaphor target sourc metaphor determin base common knowledg real world target complex entiti repres interact theori metaphor metaphor simpli process transfer properti sourc complex interact knowledg target equal capabl chang understand sourc metaphor includ complex shift mean target sourc situat sourc correspond reaction situat base person target model defin suitabl interfac interact mobil interact model basic concept sourc target situat metaphor extend form interact model base properti influenc interact mobil environ process refin vagu idea basic concept initi design specif figur show interact model situat metaphor mobil mediat tool user goal workspac user interact interpret base physic time activ contextu factor vicin busi object goal identifi contextu factor activ time locat social event companion temperatur figur interact model situat metaphor physic locat highest prioriti mobil environ user move place part work style pivot physic significantli influenc interact classifi interact space time factor human behavior show path everydai life situat time identifi period visual segment timelin begin end point situat link establish previou period timelin busi goal consist activ activ identifi engag user mediat mobil devic contextu factor identifi depend influenc activ vicin respect physic locat set consist social object variabl interpret situat respect interact model situat formal defin situat attribut influenc interact definit state situat facilit descript concept situat metaphor li ti ai fi physic locat coordin valu continu period time start end time point set activ point respect activ engag workspac activ sequenc pair describ set contextu factor directli affect interact situat formal defin base context activ user access inform situat logic piec inform situat defin identifi base specif properti storag discuss section relationship situat relev set entiti function call id si id formal notat declar describ theoret foundat situat base concept call situat space situat space situat situat space interact space mobil tool achiev busi object comput mediat activ activ includ situat space main object situat space describ identifi past util provid system behavior function applic integr physic user activ inform entiti provid singl interfac base busi goal interact histori underlin sourc situat semant relat past situat make space situat space regard space variabl number forc affect interact mobil comput environ dimens defin time logic attribut dai month user activ contextu factor vari situat dimens depend case situat space ss defin ss set element properti exist distinct situat si ss oper concaten situat si iff sj ss aj ε fj continu period li geograph distanc locat li singl segment timelin ss call id si φ defin null situat situat space properti exist situat ss ℜ si si calcul base content analysi entiti set ℜ si threshold situat ℜ si ℜ sk ℜ si sk si ℜ situat threshold base declar ss navig function sd sk ss sk paramet describ dimens situat space plain histori interact mobil environ facilit understand anticip behavior situat formal declar ss guidelin establish proper organ situat space appli princip activ theori declar categori abstract instanc situat basic situat abstract situat class objectori framework instanc situat compar composit object consist primit object basic situat consid primit object properti ss identifi situat hierarch organ built base composit shown figur hierarchi basi provid pragmat interpret current situat visual situat metaphor detail construct section abstract situat instanc situat basic situat record interact histori file figur hierarch organ situat space function develop interpret metaphor refer process discov function sourc metaphor understand target call function function featur situat metaphor structur enorm problem space found target area list function featur current identif effect demonstr implement tool explain chapter function posit compon highlight present situat metaphor spatial ident real world situat mobil environ natur tag locat found person vocabulari behavior significantli correl locat situat function system strictli relat locat inform spatial ident augment access function system servic applic tempor ident time linear relationship human behavior period situat real life period relationship behavior vari respect time dai relationship factor lunch time work dai period time situat analyz respect individu social inform made system servic applic tempor ident consist deriv inform exact time interv user navig system statu base time comput person function system servic applic activ ident real world peopl recal past situat rememb event special activ locat time situat user retriev inform base real world activ person system behavior base futur activ file inform gener real life situat consist inform peopl refer explicit structur situat file inform depend storag structur devic convent user identifi describ situat partial creat modifi user includ logic relat set inform entiti link navig peopl organ gather inform structur simplifi locat inform desktop interfac provid maintain digit inform collect present storag structur user explicitli creat link entiti situat metaphor system build implicit link structur base situat entiti creat modifi navig present recal memori past situat filter inform inform present user base identifi interest current work context system maintain index base structur situat space support situat depend filter visual person analyz thing visual subset event start pattern move statist textual evalu situat basic situat instanc situat consid sequenc event respect parent situat situat space visual develop schema situat metaphor model integr situat mobil work environ system level main expect separ process manag situat inform applic commun situat inform applic simplifi develop applic underlin system base situat metaphor develop situat metaphor complex project straightforward determin softwar develop intern function commun system applic properli maintain time challeng interpret manag situat function featur previou section anticip stage set function featur refin develop prototyp applic lead remov neg compon includ posit compon appar evalu author start pilot project studi feasibl demonstr approach integr situat interact applic schema develop pilot project situat metaphor consist stage shown figur framework tool develop design framework tool develop figur develop stage situat metaphor design stage correspond theoret develop situat metaphor includ refin function featur state situat metaphor section defin stage develop realiz situat metaphor softwar compon situat inform file filter develop common middlewar central process manag situat inform framework basi includ situat interact prototyp applic stage applic util function featur inform situat order includ situat interact fact applic system tool situat metaphor prototyp applic develop base framework discuss detail chapter framework situat inform file framework gener architectur structur behavior softwar compon situat metaphor work virtual machin hard code make abstract design specif reusabl extend applic middlewar commun situat applic base framework pilot framework develop lightweight compon top desktop metaphor base file system model situat identifi requir support softwar design framework captur physic context user persuad busi goal collect meta data entiti access situat gather inform activ occur vicin user interpret situat inform identifi point view integr maintain situat inform relev inform entiti maintain interact histori high level deriv instanc abstract commun situat inform applic tool develop work cover requir step challeng requir integr engin approach collect author initi pilot project year ago begin stage number research student contribut develop achiev special captur interpret situat work pend start evalu usabl time write chapter rest describ system architectur data organ framework system architectur adopt base system suitabl provid solut robot problem deem architectur open extend make futur sensor ad carefulli monitor continu respect time locat system directli vicin obtain inform applic adequ contextu inform notifi user request describ relev detail system architectur framework shown figur partit base function part concentr captur context activ carri persuad goal workspac agent call agent sensor agent develop interfac reactiv middl part work interpret data captur part consist collabor agent situat agent rule base knowledg base interfac extern applic tool develop top framework consist agent present agent index file augment inform space gp agent sensor agent situat agent histori knowledg base captur interpret rule base augment info space index figur system architectur present present agent data organ organ data person inform space plai import role achiev function featur situat metaphor inform space reorgan integr situat data meta data augment inform maintain convent data organ manag file system present interfac storag structur primari element person inform space correspond file convent file system file defin logic collect repres set inform store relationship respect extern context content file gener access simpli convent file system forc user maintain filenam directori file convent system consist header bodi meta data time stamp file system provid facil integr meta data applic customiz organ file static singl hierarch view inform convent organ adequ provid augment interfac inform fundament requir situat metaphor extend conceptu technic situat inform entiti identifi logic collect multimedia data sourc respect initi situat user system agent creat entiti complet independ storag structur restrict filenam structur entiti extend interfac data segment shown figur interfac set attribut record contextu inform identif entiti attribut multipl valu multipl hierarchi identifi valu bodi data object compound document note actual data replic data segment browser person inform space situat inform relev identifi contextu relationship desktop inform relev file identifi storag locat directori navig inform space carri base contextu relationship browser tool develop top framework demonstr navig situat space formal navig function function featur situat metaphor user past situat graphic user interfac browser feedback avail inform graphic interfac queri facilit user express queri condit navig discuss interfac sd illustr detail inform roll inform roll inform roll logic techniqu defin situat metaphor ideal roll inform sheet describ set inform entiti situat navig mechan capabl fold unfold inform sheet hide control displai area figur design appli present larg number set small displai area easi interact techniqu rotat small roll microsoft user situat activ activ activ data context narr parent child outgo incom compon data user situat situat space interfac data segment entiti figur structur entiti compress view inform roll figur view inform roll data storag structur xx xx xx xx xx inform roll highest abstract inform roll present entiti linearli order accord respect specif featur situat space linear order appar featur physic determin inform person prefer registri user set entiti consecut inform roll shown figur compress view creat place entiti user defin view inform roll situat view consid dynam virtual directori situat metaphor user click boundari view expand show entiti abstract inform user interfac user interfac sd browser organ map time frame compon user activ figur map compon geograph map interfac facil small icon entiti locat user icon click select area icon includ time frame compon spreadsheet interfac time interv situat user interact chang scale column row analyz data select column isol cell describ specif time interv target situat scale row hour dai dai week week month fourth date month month year drag row user chang scale column time frame compon repres regular timelin basic column correspond dai drag column user chang period quarter semest year time frame compon map compon user activ compon figur browser compon user chang coordin column combin hide function user combin consecut dai column combin system monitor action perform action column column repres week dai similar user chang coordin column combin year hide user interest coordin column column repres user hide column februari decemb year system hide column februari decemb year time frame compon januari column year user find interest rule period activ visual respect time activ user activ compon figur displai inform categori respect user activ period time shown time frame compon map compon user mark activ relev icon select compon synchron user specifi condit compon time combin oper tool bar descript sd browser present list entiti scroll window figur list compress view inform roll earlier doubl click user open read write user expand list navig entiti displai click edg entiti figur view inform roll situat augment album person photographi decad person photograph imag print special paper cover imag move pictur major part document real life situat recent advanc digit technolog made digit photograph popular larg user commun benefit digit photograph includ abil displai imag video clip comput seamless wai pictur filenam folder clip storag file directori structur unwant overhead desktop comput user forc file augment album applic develop demonstr base situat metaphor provid system interfac manag retriev digit clip develop top framework contextu inform social captur pictur repres mean pictur content inform extent benefit retriev clip queri pictur parti year type queri process framework retriev mechan multimedia limit hand queri find face easi oper amount resourc execut queri prototyp applic implement laptop comput portabl digit video camera video clip store file type drive time inform addit digit photograph framework gather contextu inform user camera connect mobil sit agent activ associ file relev contextu inform time inform data file inform sec agent inform user obtain addit inform clip social event user keyword contextu factor clip comput directli connect camera implement lose practic system interfac user interact system compon map time frame compon event compon figur compon function independ select clip relev past function map time frame compon browser figur interfac augment album event shown figur show event categori exist current view map compon time frame compon event categori group clip show contextu relev icon birthdai event user select event icon map time frame compon restrict categori event compon displai contextu classif pictur user refin focu select subset icon map time frame user open pictur compress view inform roll figur frame view pictur visual displai size view give visual clue content user open imag video clip click screen pattern browser visual person workflow hierarch organ previou demonstr user inform base contextu relat identifi situat space user specifi situat user prefer analyz situat respect semant organ situat space pattern browser interact visual tool aim user find valuabl spatiotempor pattern situat space visual situat semant organ hierarch structur defin instanc basic situat section abstract situat top level situat describ categori goal refer locat time interv product inquiri product exampl abstract situat travel salesman instanc situat occurr abstract situat actual attribut valu product shop chain instanc abstract situat product basic situat repres actual occurr instanc situat real world actual valu time activ deliveri product shop correspond basic situat basic situat fact product deliv shop street decemb hierarch organ situat space index file framework construct carri batch process interact histori file situat histori cluster algorithm data mine techniqu huge amount record insert sit agent describ contextu inform interpret inform agent batch record correspond dai maintain singl file version number record analyz identifi basic situat result written basic situat index file cluster repres properti situat space extens hierarch cluster record process time boundari condit spatial tempor varianc record process recogn cluster cluster split base idl time round record discard link basic situat inform record cluster match identifi weight similar record cluster measur base euclidean distanc formula record final cluster determin basic situat inform link basic instanc situat establish updat basic situat index instanc situat index file record index file uniqu describ similar distanc basic situat instanc situat calcul euclidean distanc formula weight schema basic fail link exist instanc match determin instanc situat pilot user request verifi result commit index file dai user link basic instanc creat instanc situat manual link instanc abstract situat similar basic instanc situat weight schema threshold valu visual pattern browser compon user condit visual observ pattern angl call map window spiral window map window displai geograph map visual space user doubl click locat spiral boundari indic geograph area shown figur spiral move boundari adjust drag user specifi number oper provid chang scale map figur map window spatial viewpoint defin geograph map color rectangl repres basic spiral band occurr basic situat figur assign color situat situat organ basic spiral color icon displai map window user navig space chang rotat adjust visual radiu spiral scale time slider bottom window radiu spiral singl dai modifi chang visual radiu spiral chang determin tempor period initi visual radiu spiral spiral view chang planar view linear view shown figur user move rotat spiral separ chang radiu spiral figur planar view linear view timelin defin spatial viewpoint note visual mechan pattern browser base interact visual languag spatiotempor pattern interact function visual set basic situat situat align vertic form spiral figur show visual sale distribut locat applic align oper instanc situat product visual statement describ spatiotempor pattern instanc situat figur spatiotempor pattern instanc situat product pattern read wai individu pattern read top bottom shape icon user horizont read compar pattern pattern sale product repeatedli pattern show uniform sale product sudden pattern similar sale time pattern detail user open window view inform roll browser augment album chat room chat room applic demonstr situat commun initi specif social environ peopl social context collabor situat comput person ident place park social environ peopl gather specif area place place plai social peopl commun natur shy afraid person ident identifi group peopl persuad social requir specif area commun situat chat room facil establish commun mobil comput protect individu ident applic applic applic domain museum system design system design integr framework wireless network architectur social institut concern singl local area network maintain number infrar wireless transceiv spread physic space easili establish connect mobil comput user gather place physic space logic partit number physic segment identifi group chat room alloc physic segment peopl group talk portabl termin server call chat server maintain chat room physic segment overlap chat room creat integr number physic space pen agent pass relev situat inform short period client directli establish connect chat server wireless network figur show network architectur prototyp system develop evalu system function current activ rang transceiv approxim meter locat locat separ physic segment user move activ area physic system automat connect relev chat room connect disappear user move area figur prototyp architectur user interfac figur show chat window map pad chat user enter physic chat server alloc charact icon identif user draw figur mark locat map pad share user room maintain includ member room messag member room sender restrict specif person privat messag click charact icon target user distinguish chang background color shown sixth messag figur figur chat window map pad map pad system facil call steadi link member identifi meet physic segment user steadi server request user accept share situat system assist start author present chapter comput paradigm mobil comput environ situat user work motiv fact recent advanc technolog made mobil comput small poss occas power automat identifi current physic locat mobil comput adopt desktop metaphor base interact interact scheme fulli util technolog benefit provid interact mobil comput immin requir make present interact model call situat metaphor capabl repres chang context activ facil user interact comput natur tool real world situat mobil comput model activ context consist physic context environ activ perform persuad goal workspac function featur situat metaphor determin requir support comput tool refin increment develop cycl situat metaphor influenc system architectur design applic present develop methodolog implement situat metaphor stage gave design theoret foundat situat metaphor situat inform file develop core foundat applic develop base base system architectur prototyp applic develop stage demonstr prototyp applic base framework browser tool navig person inform space basi past situat augment album applic person digit collect show develop system interfac mobil person photographi space time forc influenc user activ mobil comput environ pattern user capabl visual analyz situat space spiral visual techniqu introduc make pattern event demonstr inform visual featur situat metaphor chat room collabor user commun situat exchang messag protect individu ident framework situat inform chat server maintain room respect physic area work discuss chapter summar stage research project metaphor mobil author softwar engin approach achiev expect situat comput situat metaphor integr properti enhanc interact mobil comput framework show achiev function featur situat metaphor foundat develop situat applic provid paradigm interact base situat multimedia inform sourc acknowledg work support societi promot research fellowship young scientist author author professor ichikawa guidanc assist refer situat problem cambridg nardi activ theori mit metaphor person multimedia intern journal softwar engin knowledg vol decemb psycholog progress cognit psycholog comput system interfac mit lam inform technolog support person world comput robinson design human memori comput vol wearabl remembr system augment intern symposium wearabl pp octob mit human interact ibm system vol framework creat electron vol septemb inform space spatial awar palmtop commun vol juli rhode realiti wearabl technic report mit media situat intern symposium wearabl comput cambridg bridg gap intent intern symposium wearabl comput octob exploit dualiti physic virtual acm confer human factor comput system april brodi handheld devic augment intern symposium handheld ubiquit comput septemb filter shop agent physic intern confer autonom medicin situat portal consum intern symposium handheld ubiquit comput septemb daniel dei gregori context aid develop acm confer human factor comput system approach inform acm freeman storag model person acm sigmod march cornel cambridg mack metaphor user interfac handbook interfac art interfac guid metaphor commun vol inform technolog method mit water team mental model mental gentner select analog interfac consid wearabl user workshop softwar engin wearabl june chang design acm theoret framework cognit vol pp california browser explor inform ieee symposium visual septemb semant file acm symposium oper system octob barri spreadsheet approach inform acm user interfac system octob system person digit ieee intern confer multimedia juli interact visual timelin geograph ieic transact inform august visual spatiotempor pattern spiral geograph ieee symposium visual jain cluster jain neural ieee march interact visual languag spatiotempor intern journal visual languag vol commun user share common physic interact system softwar studi interact mobil comput phd graduat school inform hiroshima septemb
ML/748 6 sf base view synthesi robust face recognit zhao chellappa center autom research maryland colleg md abstract sensit variat pose challeng problem face recognit method face dramat view light direct chang approach solv difficult problem broadli divid multipl imag base method multipl imag pose person hybrid method multipl imag learn imag person singl imag base method base learn carri present method class method base improv perform face recognit system handl variat due pose illumin imag synthesi introduct face recognit activ area research imag analysi understand method face recognit algorithm successfulli appli task face recognit drawback major difficulti pose variat fact system perform drop significantli pose variat present input imag difficulti reveal recent feret test solv problem suggest major research issu illumin variat face task face recognit difficult research method handl rotat problem basic divid multipl imag base method multipl imag person hybrid method multipl train imag train imag person singl imag base method train carri type type approach popular type approach receiv attent context face recognit review exist carefulli examin problem variat reflect model vari model assess difficulti problem evalu efficaci exist method analyt view synthesi techniqu face recognit robust pose illumin view synthesi convert input imag prototyp frontal light feed prototyp exist system subspac lda perform recognit major motiv sf view synthesi recent develop face recognit method combin symmetr sf assum vari face imag gener face good prototyp imag input imag obtain exist method type earliest work correl match scheme pose estim face recognit coupl iter loop input imag align imag select pose align carri affin transform base kei featur point optic flow refin align templat correl score pair match templat perform recognit main restrict method imag view person light variat textur facial express final comput cost high iter search approach imag synthesi method potenti method robust face recognit handl pose illumin problem method base illumin cone handl illumin variat handl variat due complet resolv ambigu reconstruct shape numer algorithm type popular reason success practic method util prior class inform review repres method linear class base method graph match base method final eigenfac approach imag synthesi method base assumpt linear object class extens linear imag project object extend linear shape model similar coot al activ shape model base featur point full imag object implement correspond imag input object refer object establish optic flow correspond refer imag imag pose comput final correspond field input imag linearli correspond field exampl compar parallel deform scheme method reduc comput correspond imag pose method extend carri addit error term synthesi robust face recognit scheme base elast bunch graph match author basic assum planar surfac patch kei featur point learn transform face rotat demonstr substanti improv face recognit rotat method fulli includ face landmark final flexibl graph match scheme drawback method requir accur landmark local easi task illumin variat present face imag size small popular eigenfac approach face recognit extend eigenfac method order achiev pose invari recognit method explicitli code pose inform construct individu eigenfac pose unifi framework call bilinear model method common imag cover illumin problem exclud pose problem class approach includ invari featur base model base method gabor wavelet base featur extract method face recognit robust small angl rotat larg number paper subject invari featur comput vision literatur applic technolog face recognit explor worthwhil point recent work invari method base imag shed light direct face imag facial model explor comput comput vision code commun face shape repres polygon model mesh model simul tissu due complex comput attempt appli technolog face recognit made dataset rang imag person view test problem definit solut order systemat studi pose variat problem face model vari model face shape divid pose variat problem rang easi hard imag transform rotat discuss scenario pose variat studi transform imag view model combin vari model face shape simplifi assum rotat loss gener model commonli sf standard equat ae pp qq shape gradient deriv depth map sin ff sin ff sin length light vector light sourc repres slant ff angl neg posit tilt angl neg assum problem illumin light condit chang view prove lemma partial deriv rotat lemma partial gradient underli surfac rotat plane relat tan proof assum surfac patch interest surfac normal surfac rotat surfac normal vector rotat figur surfac rotat simpl geometr tan rotat surfac rotat coordin system rotat coordin system surfac unchang fig easi project point plane plane base renorm vector replac tan prove lemma base lemma state theorem omit theorem assum arbitrari singl light sourc rotat plane imag relat origin imag sin tan indic function indic determin shape rotat angl assum straight singl light sourc corollari straight singl light sourc rotat imag relat origin imag sin defin theorem geometr transform matter reflect simpli appli imag warp techniqu obtain imag transform commonli solv correspond problem optic flow appli illumin problem coupl pose method suffici anymor analyz provid theorem omit theorem assum arbitrari singl light sourc rotat plane imag relat prototyp imag prototyp imag frontal imag straight singl light sourc result readi discuss pose variat problem case assum illumin chang final address case pose variat coupl illumin variat simpl face model discuss studi interest question class face recogn base discrimin analysi interest question train face imag fi straight light sourc obtain linear optim discrimin map question appli map rotat imag fi warp perfect frontal question interest reflect model imag warp light model point face differ pose pure imag warp resolv reflect interest thing assum frontal face symmetri proposit proposit optim discrimin map learn face imag optim distinguish rotat face imag provid ffl direct result train imag ffl light sourc singl straight produc symmetr frontal imag symmetr face shape ffl rotat imag warp frontal view correspond problem proposit base lemma lemma straight singl light sourc correspond problem subspac project coeffici vector frontal rotat imag class relat fi fi assum symmetr class fi denot project vector averag imag fi fi fi denot sum product matric proof basic express eigenspac decomposit imag class fi fi project coeffici project coeffici comput fi fi fi fi appli corollari divid imag left halv fi fi fi fi fi sin zc fi sin zc fi fi solv correspond problem rotat imag warp frontal replac util symmetr properti imag class assumpt zc equat fi fi fi fi fi sin fi sin fi fi fi fi fi lead simpl scale relat fi fi conclud proof base lemma obviou proposit true scale ad constant chang optim discrimin map notic proposit valid light sourc straight singl light proposit enforc assumpt common class shape literatur fairli gener statement case pose variat problem case small rotat problem state frontal imag fi slightli rotat face imag fi rotat angl small strategi perform recognit slightli rotat imag corollari sin small angl small approxim align normal imag proper face imag normal respect ey base conclud pose variat manag rotat angl small case prior class knowledg case commonli address exist approach make full set imag fi partial set rotat train imag fi classifi untrain imag basic idea solv problem explor inform imag frontal rotat learn transform frontal imag rotat fi fi appli learn transform imag knowledg made explicit ffl point map imag pose pose ffl transform imag pose learn knowledg eigenfac method bilinear model method subspac project frontal imag eigenfac rotat imag eigenfac implicitli assum avoid difficult correspond pure learn algorithm figur imag warp simpl face head imag arrang column column origin frontal imag rotat appli nonlinear princip compon analysi map frontal rotat view subspac nonlinear space appli linear learn method obtain map coeffici frontal view rotat view linear map perform recognit nonlinear space theoret point hard verifi valid algorithm conduct experi real face imag report result section case problem challeng case iii prior class test imag rotat angl includ illumin model illumin chang devot section address complex problem robust face recognit discuss combin problem pose illumin briefli discuss simpl techniqu commonli literatur imag warp rotat problem imag warp problem imag warp parallel correspond obtain prior class knowledg optic flow flexibl graph match appli correspond problem critic correspond problem restrict landmark node frontal identifi independ prior learn class knowledg simpl model solv correspond problem figur show fit individu imag simpl model deform base individu face ey nose tip estim pose imag discuss detail section figur imag synthesi rotat illumin gener head imag arrang row direct imag rotat column direct imag illumin vari pose illumin difficult problem handl pose illumin variat techniqu comput graphic model face complic task face recognit larg appli sf recent work symmetr sf recov complet shape simpl model process techniqu successfulli appli address pure illumin problem pose fix virtual view synthesi recognit basic idea improv system perform illumin pose variat preprocess input imag preprocess feed prototyp imag exist system subspac lda theorem virtual imag view illumin demonstr fig appli imag synthesi techniqu face illumin direct light sourc face pose view illumin order recogn input imag condit prototyp view defin input imag acquir view illumin direct light sourc pose estim exist pose estim algorithm prior class face head similar simpl model estim pose pose estim problem paramet estim problem arg mf imag mf imag gener simpl face model mf incorpor estim light sourc ad ff arg mf notic formul ignor realiti vari address imag introduc symmetr frontal face imag pp qq advantag approach elimin effect comparison real synthet imag order appli method rotat imag symmetr addit process theorem formul estim ff arg im imag virtual frontal view gener origin imag imag warp textur map theorem experi light sourc pose estim carri rough pose inform manual light sourc assum frontal fact basic experi pure imag warp plan implement full view synthesi futur shown good approach base method model frontal light assum data set drawn feret stirl qualiti dataset lower report subsequ work face recognit size normal imag smaller pair face front view normal size wrt ey pose face appli uniqu rotat angl pick manual imag visual imag synthesi wai imag face recognit imag match view light condit present test imag prototyp view light condit obviou approach effici frontal view test imag rotat gener virtual frontal view test imag match figur imag row rotat row frontal view real frontal view column good imag column bad pair figur synthesi virtual frontal view fourth column repres rotat column repres frontal sixth column virtual frontal view mention pose face consist uniqu rotat angl chosen imag synthesi result good column fig actual rotat angl preset bad column fig imag synthesi exampl fig comparison recognit result test compar efficaci method robust face model ii nonlinear learn method iii subspac lda origin iv subspac lda frontal imag mention pair pair good imag term correct rotat angl manual pick fig frontal view rotat imag test imag method divid imag train set untrain test set rotat test perform score train set test set list separ tabl report recognit perform subspac lda origin imag virtual frontal imag tabl method ii score tabl perform comparison learn base method correct score method score train set score left test set method iii iv score tabl perform comparison subspac lda origin imag virtual imag score good score left imag unlik method train test imag untrain drawn learn method poor gener achiev perfect score train true rotat angl train set test set virtual frontal view perform subspac gener problem retrain subspac lda extent improv depend qualiti virtual view sf base method handl pose variat problem possibl coupl illumin problem face recognit studi imag transform rotat reflect model base assess problem review exist method sf base method address difficult case problem aid gener face model futur plan improv view synthesi result deform model multipl face model test light sourc pose estim algorithm larger evalu efficaci method refer cl machin recognit proc vol pp pj sa feret evalu methodolog proc confer comput vision pattern san pp turk journal cognit vol pp dl swet discrimin imag ieee tran vol pp aug pn jp hespanha dj recognit class specif linear ieee tran vol pp pj linear discrimin analysi face center autom colleg technic report gg recognit base depth map surfac spie geometr method comput vol pp accur robust face identif proc intern confer pattern pp dj recognit vari mit artifici intellig technic report pose illumin direct face mit artifici intellig technic report dj recognit proc int conf comput pp shape train comput vision imag vol pp modular eigenspac face proc intern confer comput vision pattern jm recognit gender gender proc intern workshop automat face gestur pp maurer base recognit face rotat proc intern workshop automat face gestur pp object illumin view posit small number view singl proc confer comput vision pattern pp ullman linear combin ieee tran vol pp wt freeman jb bilinear model problem proc confer comput vision pattern san pp vetter object class imag synthesi singl ieee tran vol pp pn belhumeur dj set imag object light proc confer comput vision pattern san pp pn dj imag creat imag human face differ pose proc workshop model analysi visual scene pp bs chellappa featur base approach face proc comput vision pattern urbana pp illumin invari object ieee tran vol pp face posit pose learn base label imag vision vol gg pose estim face face theori ed ts pp db graham nm virtual gener face face theori ed ts pp terzopoulo synthesi facial imag sequenc physic anatom ieee pami vol pp rs creation facial ieee comput graphic vol pp quotient class base recognit vari proc comput vision pattern fort pp face recognit symmetr center autom colleg technic report approach shape reconstruct face surfac neural vol pp smola kr compon analysi kernel eigenvalu neural vol pp
ML/749 6 behavior classif adversari environ patrick rilei manuela veloso comput scienc carnegi mellon pa visit professor massachusett institut ma abstract order robot system success domain agent possibl interf accomplish agent adapt behavior quickli agent respond perform present approach adapt reli classif current adversari predefin adversari class featur present window techniqu abstract overli complic featur featur extract classif step fulli implement domain simul robot result present group adversari adapt introduct order robot system success complex adapt current behavior agent adapt occur level individu reactiv behavior team strategi highli complex domain clear optim agent adapt quickli effect perform possibl state action space dynam limit time reason agent action interest domain noisi percept action reinforc learn common techniqu agent automat discov optim polici discuss reinforc learn result poor perform type domain interest reinforc learn gener requir strategi agent time adapt faster system carmel adapt build model oppon case finit comput strategi oppon environ simpl repeat matrix game clear sort techniqu scale sort complex environ mention techniqu environ approach sen agent learn cooper agent simultan avoid exploit hostil agent clear action agent hostil complex strategi deal agent system hypothesi underli research effect adapt analog previou oppon note similar agent team emploi effect strategi behavior partial inspir human behavior human good sort adapt interest good sport player carefulli watch oppon plai chang strategi base action understand abil map autonom agent goal research abstract featur raw sensor data world state agent approach featur extract complex domain introduc section construct inform featur adversari class embodi strateg inform type adversari behav close relat work al bayesian cluster world cluster form describ gener featur world describ cluster case blue team won larg mass creat adversari class averag observ priori distinct section match observ current adversari adversari class current adversari predefin class step address section affect effect chang behavior base classif map adversari class strategi final chang behavior goal classif process aspect analyz absenc chang step address research abstract featur classifi number test domain softwar test domain research simul robot soccer server robot world cup intern ai robot research initi soccer server system system simul soccer discret fashion client commun standard network protocol action server track current state execut action client period send agent incomplet inform world agent receiv noisi inform direct distanc object field inform provid object field vision agent soccer server system agent connect client global view action send short messag player ball plai ideal sort classif coach classifi base global commun inform activ player classif limit effect languag strategi commun work classif coach agent fuse partial inform agent order classifi agent opportun act time action opportun visual inform time standard minut action opportun receipt visual inform impract attempt classifi adversari time visual inform arriv featur captur perform multipl cycl classifi adversari learn raw world data estim size state space soccer server expect adapt quickli provid abstract learn algorithm algorithm implement base success simul robot soccer team champion tree learn featur extract learn complex featur abstract raw data impract reveal expect learn algorithm effect decod sensor inform good model extract relev featur sensor data make learn feasibl time world time epoch return fig observ step featur extract lightli work complex domain learn featur extract critic complic window reduc complex remov time sequenc data remov time sequenc data effect complex domain text classif music analysi refer featur type observ occur fix length window length observ data result observ intern state updat function repres state world intern state captur time depend featur discret function call updat indic observ fig definit observ slightli strict updat function indic event event fact occur record data structur time occurr record event type occur time time result data structur ident data structur produc occur time time note observ intern state detect featur involv sequenc event observ event consist event type immedi event type pass shoot simul robot soccer requir sort descript intern state record time data structur end time data structur intern state discard observ data structur observ built data structur call field small geograph region design record occurr event specif geograph area observ record ad count geograph area count geograph area repres time type event pass occur region experi perform dimens longer dimens longer dimens field detail observ observ classif experi ball posit store oppon posit store oppon number oppon observ record oppon pass bin pass mark pass defin oppon control ball cycl oppon control significantli long control player middl oppon observ record oppon dribbl bin oppon dribbl mark dribbl defin oppon control ball continu cycl row control posit oppon observ record shot oppon demonstr structur examin ball posit observ close data structur section intern state updat function current add count whichev geograph region ball return updat result ball posit observ pictur fig field divid rectangular region ball move left cycl agent add count geograph region result count shown part construct classif goal observ classifi current adversari predefin set adversari determin varieti numer valu provid observ order reproduc result softwar develop research fig ball posit observ class current adversari fit conceptu adversari class repres strateg qualiti improv agent perform class provid compact agent describ adversari adversari class set target configur observ adversari class consist partli target configur oppon dribbl side midfield setup issu creat effect strategi chang address research import verifi inform obtain sort window approach featur extract discuss section agent global action limit commun version strateg chang base classif coach passiv coach plai game game progress game algorithm data structur develop analyz analysi gener adversari class data adversari class creat team class creat observ team data set underli assumpt strategi team vari significantli competit except team make team nice strategi editor strategi game team made softwar competit oppon plai competit instanc observ averag averag averag count geograph region creat adversari goal correctli identifi team plai base observ make accuraci random guess make accuraci random guess window length vari cycl cycl cycl regular length window game differ amount data extrem result order compar observ current adversari adversari notion similar valu observ observ built data similar metric develop metric account spatial local differ classif approach classif simpl nearest neighbor approach perform random problem perceiv approach small amount inform make classif gener similar instanc observ adversari singl real number type observ type led tree deal larg amount target configur specif adversari class target configur gener specif classif occur base similar target configur similar fed tree learn featur split distinguish class featur distinguish similar target configur class similar target configur affect adversari type class rectangular region plane necessarili center measur similar center region split plane line parallel center split plane direct tree captur disjunct concept team mode compar singl target configur effect captur mode greater varieti tree accuraci window length data tree accuraci window length normal amount data fig classif accuraci accuraci random guess configur express adversari type distinct mode behavior interest vari window length affect classif accuraci short window agent time captur occurr import event long window neg affect goal quick adapt unnecessari smooth featur result data gener target configur time window observ similar target configur record data train tree reserv test accuraci rate report test data order ascertain tree gener window randomli select train test data set result shown fig result smallest window highest accuraci rate expect small window import featur captur notic window length amount data tree train data train greatli accuraci tree train train tree window length reduc data test set data set window length reduc size data set window length data set reduc uniformli data reduc factor consecut window result trial shown fig error curv bit smaller epoch perform slightli futur work accuraci point class accuraci guess accuraci order magnitud guess data set data set robocup competit result peopl work produc interest reflect great varieti techniqu strategi class made team data set team plai requir classif method distinguish refin method creat adversari class higher classif accuraci differ accuraci trend epoch length point interest tradeoff window approach smaller window train data improv accuraci small window mean necessarili time consum event rare observ occur perfectli insid window small window give higher random fluctuat behavior import correct window abil dynam chang window length improv system run window length parallel combin classif interest futur direct main contribut research window approach extract featur complex domain success classif method tree learn demonstr approach classif effect dynam domain research address part problem adversari adapt adversari class gener team agent creation adversari class base plai style sole priori team suggest cluster approach understand map adversari class strategi requir greater understand strategi agent team emploi hidden markov model updat function observ creat complex reliabl observ hidden markov model successfulli recogn simpl behavior robot tree produc classif gave fairli good classif method adversari match class statist base machin learn algorithm produc kind inform adversari adversari featur adversari class gener method adapt adversari complex domain explor piec tree final classif step present result system domain simul robot soccer hope approach adversari adapt improv refer carmel markovitch oppon model system weiss adapt learn lectur note artifici page han veloso autom robot behavior recognit appli robot soccer workshop team behavior plan learn system weiss adapt learn lectur note artifici page frank soccer tool research multiag system appli artifici quinlan program machin learn morgan san davi bayesian cluster dynam technic report knowledg media open unit februari rilei classifi adversari behavior multiag environ technic report carnegi mellon sen sekaran reciproc adapt weiss adapt learn lectur note artifici page rilei champion simul team asada robot soccer world cup page springer learn model interact intern confer comput octob
ML/750 6 autom state abstract option algorithm ander andrew barto depart comput scienc massachusett ma abstract learn complex task significantli facilit defin hierarchi subtask agent learn tempor abstract solv assign accomplish task studi hierarch learn framework option argu full advantag hierarch perform state scale larger state abstract autom adapt mccallum algorithm automat build state featur illustr result algorithm simpl hierarch task result suggest autom state abstract attract approach make hierarch learn system effect introduct research field reinforc learn recent attent tempor abstract action term tempor abstract describ action variabl amount time motiv tempor abstract action exploit hierarch structur problem hierarch structur natur incorpor prior knowledg learn system tempor abstract action polici learn task learn hierarchi significantli reduc number situat learn agent discrimin framework option extend theori reinforc learn includ tempor abstract action accur execut option polici depend state featur learn agent featur relev differ option option hierarch learn perform state abstract irrelev featur specif option state abstract hierarch learn system save memori develop compact state learn gener induc abstract dietterich introduc state abstract hierarchi tempor abstract action approach requir system develop defin set relev state featur action prior learn complex problem increasingli difficult state remedi problem autom process construct state appli mccallum algorithm individu option achiev state abstract algorithm automat build start make distinct observ vector specif depend prior learn section give descript algorithm section introduc modif make algorithm suitabl learn hierarch system describ setup experi section present result section section conclud discuss futur work algorithm algorithm retain histori transit instanc observ time step previou receiv transit previou instanc base compon assign uniqu leaf tree distinct leaf determin path pair algorithm action estim futur discount reward execut util leaf denot max algorithm model consist estim transit probabl jl expect reward comput transit instanc model perform sweep iter execut modifi valu pair jl reinforc learn algorithm updat action priorit sweep algorithm period add distinct tree form temporari call fring perform statist test ad distinct predict power distinct base perceptu observ previou histori indic back current histori dimens examin leaf tree extend fix construct permut distinct path leaf instanc leaf distribut leav ad fring distinct statist compar distribut futur discount reward leaf node polici action fring node polici action distribut futur discount reward node polici action argmax estim futur discount reward individu instanc jl ks test output statist differ distribut node algorithm retain distinct leaf sum ks statist differ fring node larger sum ks differ exce threshold tree extend leaf distinct tree action valu previou leaf node pass leaf node restrict number distinct agent make time limit depth length histori algorithm retain depend tree size size state set algorithm potenti scale larg task previou algorithm learn compact state satisfactori polici complex drive task version algorithm suitabl continu state space develop successfulli robot soccer adapt algorithm option turn issu adapt algorithm option hierarch learn architectur finit markov process state set option consist set state option polici choic termin condit probabl option termin state reach primit action gener option termin time step easi defin hierarchi option polici option select option local reward function option facilit learn option polici make algorithm suitabl perform state abstract simultan defin state polici separ assign algorithm perform state abstract separ option modifi polici option level hierarchi oper time transit instanc form make scheme add notion tempor abstract definit transit transit instanc option form observ vector time step option execut option termin time durat discount sum reward receiv execut previou instanc option level hierarchi execut experi sequenc transit instanc algorithm work option histori instanc base distinct instanc algorithm develop task option termin execut histori made finit segment separ execut option transit figur taxi task instanc record execut independ instanc record previou execut updat segment algorithm appli hierarch learn option learn option oper part state space learn option behavior gener execut option process call learn action valu option updat base action execut option updat occur action execut probabl execut base distinct option transit instanc record execut option ad instanc record execut option histori option associ instanc vector approach requir addit memori multipl copi instanc scheme introduc vector reward fr instanc discount sum local reward option experi test version algorithm taxi task grid taxi assign task deliv passeng locat chosen random set site taxi agent observ vector locat current passeng destin action taxi cardin direct passeng passeng random pickup site reward provid taxi deliv passeng illeg action move aid taxi agent introduc denot set observ vector locat polici agent learn introduc local reward ident global reward provid agent except reach applic algorithm taxi histori option maximum length instanc length oldest instanc histori discard expand tree consid instanc histori set depth threshold distinct present case algorithm lower threshold agent make distinct difficult case accumul evid statist differ accept distinct algorithm back reconsid distinct import reduc number incorrect distinct due statist evid implement compar distribut futur discount reward leav instanc taxi task fulli set histori index algorithm system pick random action probabl perform softmax tune softmax temperatur good balanc explor improv perform avoid part ensur action execut regularli design set experi examin effici learn randomli select option randomli select posit taxi reach ignor issu deliv passeng begin learn assign singl node option set algorithm regular learn option share instanc set polici option taxi task learn parallel polici task option action reward provid task sum global reward local reward option execut passeng taxi posit select randomli passeng randomli select pickup site result result learn experi shown figur graph learn regular learn averag independ run tune set learn run give maximum perform interv time option save evalu separ evalu consist fix repeatedli navig target time randomli reposit taxi time target repeat ad reward conclud learn converg faster regular learn achiev higher level perform faster converg due fact histori option fill quickli learn higher perform achiev amount evid larger target option reach execut reach time execut option set perform learn durat time step regular figur comparison regular learn time step figur show result node repres distinct drawn leaf node shown squar omit denot distinct execut option order letter denot distinct observ note make distinct lower part grid branch algorithm made suboptim distinct distinct smaller number leav suffici repres optim polici figur total leaf node number leaf node vari averag leaf node make actual number state smaller compar result dietterich state compar distinct state flat distinct state polici requir result improv memori requir store histori account memori save due state abstract larger task significantli outweigh memori requir shown algorithm option hierarch learn system result suggest autom state abstract perform algorithm attract approach make hierarch learn system effect testb import step autom state abstract hierarchi incorpor learn method learn agent extract inform train data result show learn significantli improv perform learn agent perform state abstract main motiv develop hierarch version algorithm autom state definit transit instanc enabl histori structur learn solv problem partial observ domain futur work examin perform state abstract algorithm realist task plan develop version task figur polici algorithm back tree reconsid distinct potenti improv perform algorithm correct node incorrect distinct made acknowledg author tom dietterich provid code taxi andrew mccallum valuabl correspond ted perkin read provid comment paper work fund nation scienc foundat grant recommend express materi author necessarili reflect view nation scienc foundat refer hierarch reinforc learn maxq function decomposit artifici intellig research state abstract maxq hierarch reinforc learn muller advanc neural inform process system pp cambridg mit press emerg hierarch control learn relationship reinforc environ mea matar anim animat cambridg mit press reinforc learn select percept hidden state phd comput scienc rochest reinforc learn hierarchi machin solla advanc neural inform process system pp cambridg mit press model tempor abstract plan solla advanc neural inform process system pp cambridg mit press reinforc learn hierarchi abstract model proc nation conf artifici pp menlo aaai press learn tempor abstract action proc intl conf machin pp morgan kaufman mdp framework tempor abstract reinforc learn artifici intellig gener adversari reinforc learn aaai fall symposium model direct autonom system
Agents/751 1 approach posit select simul soccer agent matthew hu depart comput colchest abstract select optim posit soccer robot move robot footbal game challeng complex task environ robot motion dynam unpredict paper overview posit select scheme essex simul soccer place simul leagu stockholm focu concentr posit select behaviour select individu robot agent factor consid architectur implement posit select final team perform futur extens introduct robot world cup initi attempt foster ai intellig robot research provid uniform game soccer softwar technolog includ design principl autonom strategi reason intellig robot sensor fusion addit number hardwar advanc requir achiev state goal develop robot soccer team capabl beat human world cup champion team middl centuri challeng achiev task aim offer goal requir advanc landmark project robocup game confer held robocup held intern joint confer artifici intellig japan team particip held la cite de scienc de pari coincid human world cup attract team place stockholm conjunct team particip robocup simul soccer server virtual simul movement ball player player connect server socket local area commun carri server rule player establish addit player extern program commun server heavili player speak rang commun limit player send action command server cycl command player idl potenti give team advantag command pick random sensor inform receiv server approxim depend quantiti qualiti inform request narrow wider field view lower normal qualiti set return angl inform distanc inform server gener visual auditori inform text string give symbol higher level indic agent percept action command paramet power direct kick inform pass server client suscept player kick ball view pitch error paper focu posit select behaviour essex wizard simul soccer team descript agent architectur essex wizard present section main problem agent posit wai resolv discuss section section detail posit select behaviour develop result section show posit select behaviour work achiev good perform final futur work present section agent architectur essex wizard main object essex wizard team build firm research platform futur work multiag system approach adopt achiev perform modular architectur modular architectur adopt agent implement shown figur sensor sensor modul execut separ sensor thread incom visual auditori inform transmit server receiv interpret sensor detect inform limit area depend posit orient player give suffici inform select good inform pass memori modul agent current past inform make actuat modul implement separ thread send action server regular interv ensur player miss opportun act modul simpli wait cycl time base delai messag server state cycl chang send action receiv agent mind action light inform receiv sensor cycl addit modul receiv messag agent action send unrestrict action plai mode modul track current server plai mode ensur player behaviour current state kick ball team kick paramet paramet modul hold game constant server width player option current format memori modul track current state make inform modul memori updat explicitli inform base sensor inform addit end cycl state pitch cycl predict current state agent maintain accur world knowledg sensor data slow direct agent action inform agent kick ball speed direct calcul memori perform oppon predict oppon player kick ball situat date inform retain ball predict inform quickli move item memori confid object confid predict made current posit confid drop confid object behaviour base inform plai paramet memori modul behaviour modul select action perform send result actuat modul dispatch server complex modul agent robot behaviour behaviour modul agent carri number includ agent provid behaviour dribbl behaviour select move teammat pass select shown figur behaviour lowest level made agent reduc core primit action provid extend extract inform memori common task action turn player turn face face ball expect suffici task requir sequenc action order provid option requir extend primit implement extend primit implement term core add extend sequenc action deal complex situat move ball stage posit desir kick made agent move mix turn dash reach desir locat behaviour tactic behaviour build top primit behaviour provid option agent implement rule base system dribbl involv intermix possibl turn move ball ball agent control import track current ball locat ball agent scan execut number turn updat agent pictur object pitch agent gain control ball move ball involv predict locat ball time intercept move locat ball move quickli player wait ball close avoid overshoot move kick plai mode paramet memori sensor behaviour actuat server agent figur essex wizard agent architectur clear agent home goal danger lose ball teammat posit receiv pass clear ball involv kick advanc kick side pitch oppon end send similar clear ball occur agent close goal situat attempt ball posit teammat score pass kei ball pass select good posit pass pass evalu locat teammat oppon field order decid good high chanc tree evalu return inform suitabl teammat pass estim success behaviour decid pass good advanc kick behaviour pass ball posit posit select behaviour examin current view pitch suggest good place move select posit requir inform current role agent state pitch desir goalkeep move good posit make shot oppon forward avoid forward caught trap remaind paper concentr select good target posit combin complex behaviour posit select behaviour object robot agent select posit pitch move good posit defin result good team posit receiv prevent oppon gener factor consid game includ posit teammat oppon locat abil player oppon clear shot goal clear shot oppon goal good import good posit receiv pass teammat import player fulfil role team player assign base shirt number alloc server role defin home home repres sphere influenc player role home posit chang circumst import issu firstli decid behaviour safe posit chosen reach situat target player start move directli posit oper global player commun cost high simul leagu player find target posit independ game worth note posit select tactic option player player ball specif task player closest ball player dash ball definit section describ implement figur present typic posit player find locat prevent oppon team score actuat serv sensor actuat kick turn dash move clear ball send ball dribbl pass ball memor highlevel level behaviour low level behaviour thread figur agent behaviour architectur fix fix rel fix extrem simpl select target point player home locat fix rel return point fix offset locat ball tracker tracker protect goal select posit line oppon home goal perform select oppon track select point line select oppon track involv rank oppon distanc home goal player home locat list oppon check rank order teammat nearbi oppon teammat nearbi chosen oppon home area teammat oppon home area insid hope home track oppon oppon select distanc oppon goal measur target point main valu affect minimum rel distanc final distanc distanc oppon rel minimum distanc locat goal oppon point chosen distanc line rel distanc minimum distanc chosen point locat select oppon rel distanc minimum distanc greater chosen point minimum distanc select oppon final point adjust ensur insid player home area unlik fix fix rel tracker mechan oppon visibl visibl oppon home area visibl oppon insid home area track distanc oppon goal smaller situat imposs pick suitabl target option track exist marker marker similar tracker oppon select mark track unlik track target posit chosen base posit select posit ball aim posit player intercept pass intercept shot goal line select oppon goal consid line cross select angl bisect mark line creat extend select direct distanc equal shorter base line mark line obtain point select tracker ball tracker ball tracker perform oppon select phase target locat line ball goal option fail ball player home ball goal distanc minimum distanc trap trap consist move defend oppon end team attack past trap aim improv select point line shadow prevent oppon direct line trap line trap fail ball close line gener specif aim addit scheme situat clear action carri strateg posit attract method base gener essex wizard spar work distanc target point player pitch oppon distanc target point oppon target point ball addit constraint stai area player home locat stai pitch boundari avoid posit stai posit receiv pass player ball goal tracker ball tracker marker figur tracker implement initi singl monolith method posit select base strateg posit attract method spar method select posit mark oppon possibl implement spar method independ player select method disadvantag complic main bodi interfac method complic interfac player posit behaviour simpl rule defend track oppon ball defend half set trap ball oppon half format player longer requir complet set rule number possibl rapidli escal make select method complex task unclear method easi logic group situat specif method order present simpl interfac core player complex architectur select librari repres method select track set trap posit object creat instanc circumst core player activ specif base current situat find posit move bring consist core order find desir target locat simpli activ current tactic situat player underli interfac ident multipl player player implement design posit architectur specif basic indirect commun scheme observ posit teammat account select suitabl posit potenti good posit teammat player move close teammat select posit player ident configur lead behaviour individu ensur player decid defend design player explicitli similar reactiv approach behaviour base robot subsequ work multipl robot capabl form maintain flock format simpl implement suitabl extern configur pass larg number static argument core player posit select specif posit select scheme extract extern configur file start player share split section role player extract inform role plai format make clear distinct tactic implement hide implement detail complet set option access directli requir player option addit chang situat requir complet set option oper situat singl select good due state pitch trap ball situat option return error signal check chose default posit redirect request altern altern behaviour call succe option complex behaviour case underli ensur fail avoid return valid posit behaviour default fail gener valid posit home locat player return construct stack chang situat fail stack succe figur trap action implement result previou chapter test extens isol ensur work design perform real game situat difficult give clear indic dynam environ robocup game static page diagram section produc game essex wizard roll brain robocup competit sweden essex wizard dark grei line repres movement player time small white circl black dash line path ball figur show pitch cycl middl half game concentr end occupi essex wizard action clear goalkeep move conserv energi long action defend interest start period shown ball move oppon end defend move forward posit trap ball back trap break defend improv posit figur earlier game point repres posit essex wizard ball cycl ball move half move forward enforc trap arriv ball return close centr line immedi begin ball track attempt reach point ball goal move slowli oppon locat ball period point ball point stop turn futur work paper introduc team architectur essex posit select behaviour implement effect posit select requir player optim posit benefici team choic made base local inform build maintain imag pitch difficult due slow rate commun posit select behaviour design advantag gener knowledg format role restrict suffici freedom avoid break unfamiliar situat encount expand futur account inform make system adapt abil essex wizard team put test robocup achiev prize excel perform futur work essex wizard simul team focu attack strategi requir gener learn learn requir player automat improv posit behaviour approach acknowledg michael made contribut essex support project provid research promot fund refer robot offic plai proc int joint conf artifici pp juli robust layer control system mobil robot ieee robot pp hu kelli coordin multipl mobil robot proc mobil robot xiii page nov robot world cup initi int conf autonom agent marina del acm challeng problem ai robot robot soccer world cup lectur note artifici intellig pp approach simul soccer agent robocup ijcai robocup page juli august mj interact intellig technic report mit ai soccer simul robocup special session robocup offici site layer learn system phd carnegi mellon figur ball track action
ML/752 6 portabl tune word disambigu system gerard german research center softwar depart technic girona barcelona abstract report describ set experi carri explor portabl altern word disambigu algorithm aim work studi perform algorithm test corpu train explor abil tune demonstr empir algorithm outperform algorithm previou situat word machin natur languag portabl tune nlp system introduct word disambigu problem assign mean word text mean distinguish potenti attribut word tabl show definit word ag sentenc system assign correct instanc depend context word occur resolv ambigu word central problem natur languag process applic task natur languag machin inform retriev hypertext acquisit subcategor select speech spell refer automat text import open problem nlp wide rang approach investig larg effort devot tackl wordnet exampl corpu definit ag length time ag replac ag histor live corpora exampl ag mad star ag ag year ago ic ag end tabl definit corpora exampl fact highli accur system built success current line research approach statist machin learn algorithm appli learn statist model classifi corpora order perform approach learn semant annot obtain result method small set select ambigu artifici standard ml algorithm learn appli list neural network bayesian learn learn boost cite method jointli tree rule induct restrict domain perform ml base system calcul test algorithm separ part set annot exampl set exampl partit disjoint set procedur repeat time combin fold train fold test test exampl belong expect similar methodolog valid nlp english exist reason evid accuraci result simpli extrapol ffl depend domain applic idea polysem word time extrem share ffl accuraci figur obtain test classifi wall street journal brown corpu corpora belong ffl reason train materi larg repres cover potenti type exampl studi domain depend style studi devot assess valid determin extent tune process make real system portabl order corrobor previou work explor portabl tune ml algorithm train test corpora method suffer lack wide semant tag construct broad coverag system acquisit estim manual annot effort build broad coverag semant annot english corpu extrem high overhead greater costli tune procedur requir appli exist system learn overhead common ml algorithm scale real size explain method question due recent work reduc acquisit comput requir method line research design effici sampl method extern lexic wordnet web search engin automat obtain internet arbitrarili larg sampl word algorithm estim statist model paramet applic effici accur ml algorithm attribut order deal real size problem solv problem knowledg acquisit crucial make approach viabl belief refer fourth evid bottleneck futur worth investig robust portabl exist ml method resolv problem overview report organ section present ml algorithm section gener set includ corpora methodolog section report experi carri result obtain section conclud outlin line research learn algorithm test section refer short descript main characterist learn method compar naiv snow naiv naiv intend simpl repres statist learn method classic set assum independ classifi assign class maxim condit probabl class observ sequenc featur fc cm set class set featur valu test naiv method find class maxim arg max arg max estim train process rel frequenc avoid effect count estim condit probabl simpl smooth consist replac count number train exampl naiv claim obtain accuraci paper classifi learn aha gener train exampl perform exampl store memori classif exampl base class similar store exampl exampl store memori classif base algorithm ham distanc measur close exampl ks greater result weight major nearest neighbour vote strength proport close test experi explain section eb algorithm run time number nearest neighbour result choic report learn option author point method tend superior languag learn problem forget except classifi snow stand network winnow learn system winnow algorithm basic compon method appli reason detail winnow algorithm winnow linear threshold algorithm problem binari input featur classifi posit class order construct real system paramet estim train set neg class set activ featur weight input featur threshold paramet winnow onlin accept exampl updat weight winnow initi weight accept train class appli threshold rule comput predict class winnow updat mistak made predict class correct winnow predict class winnow updat weight neg weight activ featur promot ff ff number greater call promot paramet posit weight activ featur demot fi fi posit number lower call demot paramet snow architectur snow architectur winnow node learn separ class rest figur show snow architectur learn disambigu ag present tabl class winnow winnow maximum activ snow exampl train featur averag nuclear figur snow architectur connect featur class train exampl process sequenti train posit class belong neg rest kei point fast learn winnow node connect featur class train figur featur connect node featur connect winnow node exampl class connect featur class creat dynam learn exampl process train step repeat time adjust weight network order clarifi train step repetit neural network learn epoch util retrain step mention paper snow appli gold retrain impli add paramet train process finish mistak made train maximum number epoch achiev classifi snow similar neural network input featur output class highest activ tabl show paramet valu experi valu empir determin lead accuraci algorithm task paramet promot demot threshold initi weight jj number train epoch tabl snow paramet valu snow proven perform high train exampl target function resid featur space text categor spell correct main idea boost algorithm combin simpl moder accur weak highli accur classifi weak classifi train sequenti train exampl difficult classifi weak classifi weak linearli combin singl rule call combin hypothesi schapir singer algorithm multiclass label classif simpl weak test boolean predic make connect featur class activ weight initi jj threshold divid number activ featur current predict base predic binar attribut section form featur word weak rule singl simpl tree intern node binari leav answer test explain simpl modif adaboost mh consist reduc featur space explor learn weak classifi small proport attribut randomli select weak rule select idea method proport suffici good rule found iter chanc good rule learn process high import characterist attribut discard avoid risk elimin relev attribut method work import degrad observ perform valu greater equal irrelev highli depend attribut modif significantli effici learn process time loss accuraci set corpu corpu semant annot corpu occurr noun verb frequent ambigu english word corpu collect ng colleagu linguist data consortium corpu sentenc wall street journal brown corpu easi perform experi portabl altern system train wsj part test bc wsj part refer corpu bc part corpu word forc number exampl corpu order symmetri comparison direct group word frequent literatur select perform compar experi word treat classif word noun verb tabl inform number number percentag frequent refer group word attribut kind inform perform local topic context consist full sentenc ambigu word tag set label minor wordnet ldc achiev reduc size largest corpu perform random elimin size smallest exampl mf corpu po min max avg min max avg min max avg noun verb noun verb tabl inform set word refer context consecut word word tag word attribut refer local context correspond colloc consecut word topic context form stand unord set open class word sentenc method test translat inform featur wai snow lb algorithm requir binari featur local context attribut binar topic context attribut remain binari test concret word sentenc result number attribut expand thousand depend binari attribut nb eb algorithm lead extrem vector observ exampl repres vector thousand situat exampl coincid major valu attribut speak differ posit fact wrongli similar measur eb favour store exampl shortest sentenc order address limit reduc attribut space binari attribut singl attribut close class word sentenc similar valu fw fw jm redefin jj equal number word share approach impli test classifi account inform word inform word tagger annot train exampl label set attribut attribut except morpholog target word syntact relat nb problem effici classifi product thousand condit probabl classifi order improv test variant naiv algorithm account attribut condit probabl word test exampl posit effici loss accuraci variant nb eb algorithm call stand posit eb nb fulli test empir proven perform variant handl attribut methodolog comparison algorithm perform seri control experi train test set combin set train set left hand side symbol test set hand side mean train set corpu test set corpu symbol stand set mean train set union test set compar perform statist test appli depend case combin repres singl experi mcnemar test confid proven robust simpl test differ proport perform order prevent test materi train rate figur report section averag result fold statist test pair student confid inform statist test found classifi test method resolv potenti ti frequent ti experi experi tabl show accuraci figur method combin train test set mfc stand naiv classifi learn frequent train set classifi exampl test set averag result present result case print boldfac observ lb outperform method case superior statist compar lb eb approach case mark asterisk note lb achiev substanti improv result variat statist slightli knowledg column correspond train test set present acquir singl corpu cover knowledg combin corpora effect observ special case snow join train corpora accuraci method po noun mfc verb total noun nb verb total noun eb verb total noun snow verb total noun lb verb total tabl accuraci result method combin portabl disappoint result obtain restrict lb observ accuraci obtain accuraci consid upper bound lb differ point slightli frequent corpu comparison direct differ lower frequent corpu accuraci observ predict made method test set interest inform comparison algorithm figur show agreement rate kappa statist pair method case stand annot correct agreement rate accuraci result report interest drawn nb obtain similar result regard mfc agreement rate kappa valu tabl averag agreement ratio tabl achiev case mean time predict frequent lb obtain similar result regard agreement rate kappa similar kappa agreement valu regard kappa statist measur agreement reduc effect chanc agreement measur agreement construct semant annot corpora ng mfc lb dissimilar annot respect rest lb method learn behaviour exampl kappa valu low suggest evalu comput rel agreement human annot corpu theoret pointless expect agreement system refer corpu annot contrari intuit agreement human annot high paper report surprisingli low figur report accuraci rate kappa compar annot subset corpu perform independ research group report valu kappa annot special word corpu point kappa valu achiev lb consid excel result subset corpu report direct comparison note lb kappa valu move corpu extrem low experi previou experi show classifi train corpu work tune process make system portabl experi explor effect tune process consist ad origin train set small sampl manual tag exampl domain size portion vari corpu step remain set experi refer order determin extent origin train set contribut accur disambigu calcul result tune corpu train figur graphic present result obtain method plot straight line lower bound upper bound accuraci method grow upper tune corpu ad train set relat reveal interest fact plot contribut origin train corpu null plot degrad accuraci perform observ plot show naiv snow method worth origin train exampl strategi simpli tune corpu kappa perfect consid indic good agreement specif competit system romanc languag mfc nb eb snow lb mfc nb eb snow lb mfc nb eb snow lb mfc nb eb snow lb mfc nb eb snow lb mfc nb eb snow lb mfc nb eb snow lb mfc nb eb snow lb figur kappa statist agreement rate method experi situat moder improv accuraci observ retain origin train set show behaviour competitor experi bad result portabl system explain corpu distribut exampl corpu learn test corpu test corpu naiv accuraci rate mf accuraci rate mf base accuraci rate mf accuraci rate mf snow accuraci rate mf accuraci rate mf accuraci rate mf accuraci rate mf figur result tune experi algorithm acquir classif cue corpora hypothesi confirm observ bar plot figur distribut frequent sampl word corpora noun head complet opposit distribut corpora plot figur figur distribut frequent noun verb black bar grei bar corpu order check corpora gener number exampl part difficulti artifici elimin algorithm portabl exampl part similar tabl show result obtain corpora accuraci method po noun mfc verb total noun lb verb total tabl result corpora observ accuraci point distribut conserv train test portabl system achiev reduc size largest corpu size smallest differ accuraci import due simplif provid balanc distribut extrem tabl show perform lb noun state note lb perform mfc column accuraci method mfc lb tabl result noun state result impli exampl larg corpu train lb output order set rule base relev attribut studi weak rule gener lb observ differ ffl type featur rule significantli rule appli set corpu topic rule refer topic import corpu corpu topic rule corpu restrict corpu topic rule corpu rule learn corpu learn corpu ffl sign predict common rule contradictori corpora rule present tabl acquir corpu account colloc state court rule real rule output featur hold sign real number interpret predict assign magnitud predict interpret measur confid predict presenc colloc state court posit evid number neg rest rule presenc colloc contribut number neg rest number featur rule state court rule state court tabl refer colloc state court note rule complet coher assign exampl state court contradict inform exampl corpora work work point difficulti portabl import issu paid attent present main extract assur portabl process tune domain requir corpora differ bc wsj result contradict idea introduc system train larg corpora thousand exampl provid accur disambigu corpora significantli belief number issu knowledg studi state ml paradigm resolv realist problem ml algorithm contribut work consist empir demonstr algorithm outperform ml method algorithm proven properti appli domain work plan ffl studi problem obtain repres train clarifi meant repres note current approach word treat classif problem collect repres corpu account word order decid number exampl ffl due fact knowledg learn domain applic chang investig tune special algorithm ffl extens evalu task includ account attribut test algorithm corpora corpora automat obtain internet method ffl mislabel exampl result annot error tend hard exampl classifi tend larg weight final distribut observ identifi noisi exampl improv data qualiti preliminari experi carri direct corpu ffl inspect rule learn provid evid similar behaviour type knowledg perform cluster artifici acknowledg research partial fund spanish research depart project research depart consolid research group wordnet project grant refer albert learn algorithm machin bruce wieb model natur languag process comput assess agreement classif kappa statist comput cohen coeffici agreement nomin scale educ psycholog van den zavrel forget except harm languag learn machin roth learn text categor confer empir method natur languag brown usa dietterich approxim statist test compar classif learn algorithm neural duda hart pattern classif scene analysi wilei engelson dagan minim manual annot cost train corpora riloff wermter statist symbol approach learn natur languag lectur note artifici springer boost appli word disambigu european confer machin spain naiv approach word disambigu revisit european confer artifici germani tanaka select sampl word disambigu comput yarowski speech natur languag page yarowski method disambigu word larg corpu comput gold roth approach spell correct machin id introduct special issu word state art comput english report result intern confer languag resourc greec miller corpu statist wordnet relat identif comput littleston learn quickli irrelev attribut abound machin improv po tag machin learn techniqu joint confer empir method natur languag process larg moldovan automat method gener tag corpora nation confer artifici aaai miller paper wordnet special issu intern journal moonei compar experi disambigu word illustr role bia machin learn confer empir method natur languag emnlp ng lee integr multipl knowledg sourc disambigu word approach annual meet associ comput linguist acl foo case studi agreement word disambigu acl standard lexic resourc ng word recent improv confer empir method natur languag emnlp ng word disambigu acl standard lexic resourc pedersen bruce knowledg lean disambigu nation confer artifici aaai roth part speech tag network linear separ joint intern confer comput linguist annual meet associ comput page canada roth learn resolv natur languag unifi approach nation confer artifici aaai schapir sing improv boost algorithm predict machin learn domain depend acl confer appli natur languag washington usa stanfil waltz reason towel disambigu highli ambigu word comput studi polysemi judgement agreement programm advanc paper england yarowski list lexic ambigu applic accent restor spanish french annual meet associ comput page la usa
DB/753 3 web repositori daniel campo silva introduct research group departamento de informática de da universidad de lisboa campo portug web great person enhanc amount data vast true potenti har applic special aid user summar mine data applic solv user queri base vast part web long download data inform store reason solut copi inform time bandwidth save data process applic work develop web repositori support version extens object parallel oper load balanc version manag applic save time dimens save storag space extens object applic full advantag inform store versu parallel process load balanc web applic process capabl massiv amount data versu develop repositori web search engin design reusabl softwar modern web applic domain data wareh grid comput function requir paper web applic simpli versu client abil execut task parallel data process applic group independ thread versu enabl web applic perform retriev larg quantiti data web applic retriev save data built tightli coupl storag system storag framework highli distribut load thread manag web resourc applic manipul web data requir document retriev web document storag system provid method store retriev element document save histor data histori relev web applic interest portion web past storag provid access method enabl user applic respect time achiev featur identifi major requir support storag larg amount compress content provid support applic perform effici parallel process distribut data partit data disjoint read updat integr separ provid extens enabl view past state provid time dimens store support state object enabl applic decid make perman data model figur show uml class model data handl versu repositori class model gener enabl manag kind save data describ class model map mean web layer object version content figur class model data handl repositori object abstract refer web object versu object repres refer resourc version snapshot object instant time versu repres version download html layer repres logic time repositori version object exist layer search engin associ layer crawl object properti list applic properti list identifi subset object process versu url hash refer object host version properti list versu store inform download date web mime size statu code return server xml data version search engin store anchor text link html document oper model versu repositori applic profit parallel process web data inform store partit disjoint process independ applic suppli function partit data work function reconcil conflict data gener unit assum perform ¢ ¢ ¢ £ £ ¤ ¤ ¤ ¥ ¥ ¥ £ ¢ ¢ ¢ £ £ £ ¢ ¢ ¢ £ £ £ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¤ ¤ ¥ thread data applic data archiv data thread data archiv workspac group workspac privat workspac figur versu support class group privat workspac figur depict archiv workspac hold data set partit subset applic group workspac data set thread concurr subset process check back overhead introduc synchron independ part inform larg parallel process data process made tier repres workspac workspac bound independ environ applic thread process subset data defin kind group archiv privat local storag fast access data applic thread privat workspac independ resid machin group integr partial result gener applic thread privat workspac group workspac maintain share view data common applic thread archiv store data perman archiv workspac version histori reconstruct earlier view data data partit piec call work pass workspac oper applic work data lock sourc workspac destin workspac applic perform data workspac move back versu resolv conflict version elimin duplic content lock execut oper step figur check applic creat group data archiv applic fork parallel thread thread start privat workspac check work check finish work thread check group workspac restart work applic result group workspac archiv workspac proof concept proof present full present result obtain typic usag provid implement prototyp versu distribut web implement versu applic distribut web crawler applic high data interact run separ collect document part crawler deliv archiv collect document prototyp build search engin web relat work found system research work inspir design engin system distribut author version aid internet archiv xml microsoft sql server oracl mercat microsoft repositori discuss compar versu full present futur work paper present versu web data support parallel oper manag versu workspac work unit distribut data thread distribut web applic distribut applic applic partit data work unit solv conflict futur work versu includ detail studi perform review versu api manag improv extens metadata refer thoma philip shankar david version workspac microsoft repositori alex christo sigmod acm sigmod intern confer manag june page acm fred thoma queri navig web repositori comput intern web confer fred thoma internet differ track view web world wide anatomi enabl scalabl virtual organ allan heydon marc najork extens web crawler world wide jun hector andrea paepck repositori web page web internet build jame whitehead jr network protocol remot collabor author web susann morten european confer comput support cooper septemb randi katz unifi framework version model engin acm comput microsoft sql server sql server home xml power um motor de
IR/754 5 interfac enabl steve richard davi julia ur muller att park avenu florham nj usa abstract tool workplac commun potenti advantag current ui highli problemat user present design base data studi task user strategi gui main person annot serv visual analogu underli automat deriv messag header inform evalu field peopl mean access success support kei electron annot archiv behavior initi predict result argu util combin annot base index automat deriv gener techniqu access speech archiv keyword speech asynchron empir evalu introduct workplac commun estim million user worldwid organ reli heavili conduct everydai prefer email advantag email speech easi produc critic workplac task ubiquit phone act access devic common featur cellular phone phone access devic interfac web pda make graphic ui method wide access graphic access visual indic successfulli gener techniqu access type speech archiv virtual ink corpor roland st suit ma usa visual speech structur random access inher serial medium aim paper explor visual index techniqu appli address document problem current ui evalu system real prior research speech access techniqu evalu structur paper present extend analysi previou studi usag identifi kei user messag inform statu track archiv central user strategi process reli messag index implement gui support annot index ui user tempor index note individu messag note serv visual analogu underli speech straightforward access messag messag scan statu track provid peopl automat deriv header inform messag evalu field peopl mean access highli success support kei electron annot archiv behavior differ predict result argu util combin annot base index automat deriv header gener method access speech archiv task process strategi collect qualit quantit data identifi kei task strategi process typic tm server log activ survei high volum user interview high volum user server data show intens peopl access system time work receiv store min messag messag amount half survei report averag messag length sec half report length min interview messag complex simpl huge email messag worth substitut seri transact entir task accomplish exchang messag talk person real final peopl stress kei import featur email easili access telephon peopl tend respond quicker access user report main task process scan mailbox identifi import extract inform individu track statu current manag archiv store messag scan scan priorit incom locat valuabl save messag priorit critic user identifi urgent incom access mailbox time constraint meet user rapidli determin messag requir attent messag locat occur user search save messag valuabl inform current scan strategi sampl messag sequenc determin locat statu peopl survei messag header identifi urgent report slow listen determin messag requir action short break find messag sort skim listen coupl issu dealt immedi save messag pick prioriti locat store user retain detail model archiv survei report messag standard procedur find archiv messag linear natur mailbox search make locat oner messag messag store real pain messag time messag inform extract relev messag user extract critic inform labori process involv repeatedli listen messag verbatim fact phone number multipl listen vagu highli detail messag messag listen time understand agenda survei report messag half reduc repetit survei user report written note user emploi strategi strategi full user attempt produc written transcript target reduc futur access note sort messag sort synopsi felt strategi note indic messag predict object strategi abstract kei point messag caller caller reason import action user origin voic messag backup incomplet sketchi note write word mind messag back listen note scrap paper dedic peopl refer search archiv locat messag statu track workplac task deleg common user problem track messag statu statu track preval problem user access time pressur defer process number incom messag access unclear messag dealt access messag note rememb messag respond make peopl main techniqu statu track peopl note inform extract remind scrap left work area remind sit sticki call problem strategi peopl lose origin access remot locat meet room lose note problem peopl dedic record messag detail statu track user note leav messag mailbox remind place user scan archiv call back light messag respond scan remind outstand messag weak strategi visibl remind peopl access archiv unawar presenc unresolv item archiv manag tool automat gener messag inform user gener messag annot figur user interfac archiv manag peopl manag archiv access archiv consist messag store save valuabl messag engag period access messag sequenc determin preserv schedul half hour dai meet clean remov superflu user make easier scan exist valuabl monitor remind messag engag report extent accumul irrelev messag back start listen larg find time delet user interfac goal support inform statu track archiv manag obtain control laboratori studi access design base strategi observ process pai attent critic role kei benefit report user ubiqu develop provid access locat comput internet browser ui shown figur center screen show text box user gener messag plai control button locat left left interfac gener header inform messag deriv automat upper left screen show archiv manag tool creat manag folder structur design final iter trial user inform extract annot kei strategi address inform extract person note featur ui support user annot user record person text box messag annot messag summari studi user report repeat replai messag extract critic inform provid wai rapidli identifi replai relev part listen entir messag user note motiv observ handwritten note serv index underli structur origin note trigger thing meant give place holder back listen index work fig user note messag note speech plai user click word automat access speech plai note note provid access underli user focu area specif relev inform provid gener plai control navig messag note peopl plai stop messag skip forward skip back sec messag sk scan messag overview inform user studi reveal requir scan priorit locat import messag addit user gener import set cue aid scan messag header inform ui displai inform size number caller intern call delai time user hear relev inform enter relat note version introduc index note index materi plai determin iter earli user version plan make interv user configur figur show exposit deriv caller number corpor fig messag mailbox messag length messag local system unabl infer caller depict gener inform enabl user visual scan randomli access messag longer access messag sequenc identifi specif messag user manual supplement automat gener overview inform note user ad caller system unabl infer number unfamiliar annot support scan inform extract annot messag time user action messag audio annot plai messag quarter result good earn share retriev inform messag time user action messag audio annot detail quarter result locat annot detail quarter result click figur index type quarter good earn share statu track annot overview inform user report problem rememb outstand action requir messag user interfac design support statu track wai analog paper base strategi leav visual remind annot explicitli record action messag phone call plugin run state action request run relev test hope mere fact visual messag visibl mailbox serv remind peopl action access messag marilyn walker messag remind action messag requir final cue messag statu messag depict bold messag statu archiv manag user report problem rememb content prevent build irrelev messag interfac provid set tool manag delet data label button creat delet copi inform folder implicit support archiv manag provid visibl enabl archiv quickli scan identifi import messag filter superflu implement built top research system support email access implement cgi script connect standard mail server script produc html page interfac archiv messag messag retriev system store email messag special header data requir broad access influenc choic platform annot system implement web browser html plugin work time plugin restrict complex ui implement compar implement languag java modifi store annot file alongsid displai small annot window messag applic download annot file audio file messag user plai messag type text annot text box messag plai user current time index messag store word hold click user plai messag time index modifi annot back displai time page load user persist annot inform extract statu track evalu design major goal evalu investig system peopl everydai work design trial collect data investig effect system support task identifi concern system support annot central strategi instal system administ user questionnair address standard system peopl number messag receiv process gather data inform statu track archiv strategi survei peopl success tt featur inform messag support core task hypothesi measur system process process compar email statist differ hypothesi confirm confirm scan confirm locat specif messag confirm prefer method locat messag user listen user emploi visual sec scan mailbox confirm inform extract replai frequenc frequenc track messag statu frequenc lose note archiv behavior log usag data week collect data number durat messag store oper messag inform note peopl replai messag data identifi main type function user annot system administ extend version origin questionnair addit question basic featur note playback carri interview system instal probe issu elicit fuller descript system main benefit drawback find exampl unexpect system supplement interview observ peopl system research result instal system collect log user total session hour user research secretari support staff complet questionnair interview log show frequent system peopl system averag length hour user tend applic constantli unlik tt short session rule session typic access distribut plai oper session skip plai user replai messag occas listen messag tabl comparison user interfac confirm ns effect disconfirm confirm confirm ns effect time sequenc user typic save messag end session result tabl prefer predict peopl rate easier process messag support inform statu track archiv peopl rate process closer email tt access confirm tabl user comment bear superior process deal easier past offic put deal email contrast comment tt hate manag inform dislik save messag user highli system week repeat observ greater effici peopl complain tt requir execut oper access kei press tt kei easi access compar time consum process retriev user comment kei press access scan scan rate easier tt visual automat gener inform annot user find easier locat specif messag tt abil scan user switch scan sequenti sampl header note confirm user log show evid visual random user access messag order receiv store provid abil scan user priorit access user system knew messag order select pick deal put listen time scan rapid access mailbox fact messag visibl mean find inform extract user rate inform extract easier tt presenc abil playback user replai messag inform automat note provid remind messag content peopl note util note indic tabl show confirm differ number replai system greater control access provid mean user happi replai messag contrari peopl fewer note amount occur automat log relev obviat manual fewer note caller time date insid caller shown note util demonstr fact user report note system report differ type note system kei word phone number action differ reason major user case note remind messag action messag requir fact note similar paper analogu offer good support natur aspect user interfac statu track user find easier track messag abil scan outstand messag glanc peopl lose note tt note store singl locat multipl user comment statu track critic perceiv benefit face constant interrupt job file constant remind thing user exploit featur explicitli add multipl success comment origin messag track progress action respond call comment benefit note close associ origin messag save record piec paper archiv manag expect user archiv messag versu tt hypothesi confirm clear made easier store access valu messag visibl archiv meant user clean prevent inadvert build superflu forgotten access phone access messag remind examin file techniqu user save categor messag messag creat folder user explain system track thing remind attent delet make extra work file rememb emphasi statu track construct complex archiv inform extract reduc archiv user point difficulti inform extract tt messag inform extract end summari messag annot analysi investig number question central user strategi initi type tend fall main caller messag caller date frequenc messag caller messag topic caller number time date locat averag messag annot type frequent combin annot type number topic final ad annot annot messag occur annot addit annot messag track statu annot messag function messag user annot messag annot messag import annot messag plai unannot annot wide control analysi plai oper playback account plai oper compar start oper skip base plai user exploit index remaind argu receiv short reduc control access messag content short messag cost replai entir messag extract singl piec inform support fact peopl tend annot longer shorter messag turn messag access playback longer messag access reason annot specif messag peopl annot messag unfamiliar caller made annot frequent messag automat gener inform unanticip led call screen user point access messag meant fundament alter handl incom call screen call live call knew easili unanticip playback live audienc user report replai messag facilit greater messag confirm promot messag replai imagin find messag built center notion provid automat gener messag inform archiv tool design base requir data survei user log identifi kei user task strategi process data field trial show prefer tt ui improv inform extract statu track task user archiv behavior expect archiv size follow superior scan capabl prevent unintent accumul irrelev messag occur tt remov superflu messag archiv messag archiv behavior influenc prior experi previou tt delet messag dai common featur led user view data inher user assert messag longer field trial produc instanc archiv activ user habitu idea messag perman user fail exploit archiv tool prefer leav messag comment suggest systemat file oner file abil track messag statu messag longer visibl lead forgotten volum lower current import messag visibl lower messag volum reduc pressur file report email studi annot behavior complet predict user posit abil annot messag playback annot statu updat locat meant paper note note similar paper longer messag access user report fewer note reduc occur automat gener messag header fewer note messag inform index infrequ messag short replai undu reduc control inform user found hard anticip note futur note suffici remind user content underli speech work consist remind argu import effici reli sole note remind versu accuraci access verbatim speech record import system extens investig includ automat speech recognit produc transcript messag transcript provid browsabl text user read listen user serv visual analogu messag explor techniqu automat extract inform time telephon number transcript automat techniqu provid support inform extract scan task practic theoret implic result tool successfulli address problem user effici retriev locat web access address problem user experi tt data contribut grow bodi research gener method speech access present data show consist claim prior provid visual analogu index underli speech structur import support retriev approach result suggest person data combin automat gener data person annot gener techniqu access complex inform speech refer teach learn multimedia author classroom interact skim speech unpublish phd mit media express rich studi interact effect commun mode behavior team cooper human work audio structur repres ubiquit audio acm transact inform paradigm index video confer ieee commun electron mail van multimedia meet rice voic messag coordin commun intellectu lawrenc graphic telecommun sid intern augment audio notebook talk action plai studi factor underli speech behaviour handwritten note provid access record email explor person inform manag email sawhnei dynam organ ink audio notebook
DB/755 3 view larg scale xml repositori sophi cluet dan inria rocquencourt inria rocquencourt pari abstract interest maintain queri view huge highli heterogen xml repositori view larg appar limit size interest problem address distribut view machin neg impact queri translat quickli select relev part view minim cost commun potenti larg queri machin evalu introduct xml import share data publish web repres major opportun provid intellig access amaz sourc inform goal xylem project build store provid sophist servic xml document web user xylem question address spanish museum paint accur answer xml document list useless queri keyword formul structur document peopl defin standard document type dtd compani publish xml modest question involv hundr type expect user xylem view mechan document partit domain domain fact group associ tree repres structur summari call abstract inform view maintain correspond abstract dtd document gener tool address problem maintain queri concern view materi appar simpl definit mainten translat queri view point suffici address literatur recent context semistructur data main concern scalabl term data make differ heterogen data big scale view definit connect virtual schema actual connect museum author document titl paint figur queri pattern tree abstract dtd larg number concret dtd view collect larg larger order system distribut queri address arbitrari part interest distribut view impact neg queri million queri dai scale number add machin interest reduc hardwar growth minim time translat queri view view potenti larg collect impli view definit languag simpl face challeng problem quickli select part view concern queri size translat queri big xylem highli distribut cost commun queri machin evalu import consid paper organ section address problem mainten translat section extend work introduc join definit languag queri relax section conclud paper view definit view defin queri briefli introduc xylem queri languag address view definit queri xylem queri languag extens oql path express full text predic consist requir publish xml queri work group similar languag commun text semistructur basic queri filter collect xml document predic queri retriev titl paint orsai museum document dtd document chose extract underli structur incorpor view definit cultur author paint museum period titl cinema figur abstract dtd select doc note standard structur ad mean filter document collect cultur document type queri consid specif structur pattern shown figur note tag bold font node titl frame part queri answer pattern tree kind link captur child descend oper forget distinct cost queri depend size cultur collect collect correspond domain million document expect high queri concurr import understand evalu simpl queri effici adapt full text index technolog filter document tree pattern word oper xylem call captur function main commonli oper queri built combin standard project join core oper basi work view view tree pattern queri collect xml document requir user structur document simpl web scale repositori highli heterogen structur queri miss document relev element painter slightli structur view mechan mandatori studi solut defin view justifi choic xylem view enabl user interest paint queri singl data structur issu lot queri structur call singl structur abstract dtd abstract dtd tree concept describ concept interpret context ancestor tree author paint mean author movi mean figur present part abstract dtd cultur domain note abstract dtd simpler structur actual tree tag occurr symbol attribut element distinguish simplifi user view domain express queri previou xylem graphic user interfac base abstract dtd creat connect abstract dtd document queri view translat queri document artist period galleri painter paint year techniqu locat year descript biographi titl figur concret dtd document automat partit store physic cluster semant assum associ abstract dtd figur cluster document call art tourism note cultur root abstract dtd cluster illustr part view art document conform dtd figur notic concret dtd tree replac graph dtd structur forest dtd xylem project graph structur document found conform dtd call forest dtd summari assum loss gener dtd tree uniqu root final view defin queri pattern abstract dtd translat queri pattern concret dtd wai compar simplest solut term abstract dtd map set concret term actual dtd method complet ignor structur document storag point costli process gener useless combin averag number map abstract queri node translat union concret queri return answer featur return irrelev answer author director variant method add map translat complex slightli avoid irrelev answer solv problem empti queri cultur author paint museum titl artist galleri titl figur map dtd dtd method illustr figur view map defin abstract concret correspond classic definit connect structur defin queri figur correspond select cultur paint titl author museum ad insur children lost full text queri main differ view defin simpl queri larg collect view xylem involv queri concret possibl small collect document map lead absolut queri translat lot defin requir ffl dtd share similar reason familiar concept address form custom commonli mean creat document slight modif exist dtd easier perform write scratch record map tree tree miss opportun factor similar potenti lot space ffl view defin correspond tree hard difficulti spring scale larg number dtd provid autom view definit process thesauru standard techniqu recogn lexic easi associ word deal word concept author paint author book identifi concept word context ascend word tree good candid defin notion xylem automat map gener tool reli note understand connect exist tree method chose concept abstract dtd view defin set concret identifi path figur show map abstract dtd figur art dtd figur term main differ lack sixth map figur node abstract dtd annot paint ascend author cultur author paint museum period titl painter figur map paint author paint document document painter paint document painter paint document figur translat pattern tree painter figur show pattern tree left hand side hand translat concret tree map note tree lost shape translat process node ad swap perfectli reason find exampl case replac paint influenti paint translat inappropri map remain coher problem link semant matter map gener automat wrong map gener tool reli human interact made accept addit remov reject node swap motiv fact find good exampl show inappropri prefer miss good result return bad explain section motiv effici shown function good reason space notwithstand fact path simpl data structur requir space path common dtd factor reason found wai process time gain space section provid xylem view mechan fine conclud notic view present map structur structur uncondit implement view mechan featur simpl condit statement form path constant extens trivial discuss index index repositori index index repositori interfac interfac ethernet internet figur xylem machin architectur view implement order understand implement data process distribut briefli explain xylem machin architectur queri evalu process present view implement data structur process distribut xylem xylem system run cluster linux pc illustr figur distinguish kind machin bottom repositori machin charg store document data cluster semant rm store potenti cluster semant relat data art reduc number machin access evalu queri order reduc io index cluster index machin larg memori devot index partit cluster index machin index resid main memori xm rm adapt full text index technolog answer structur keyword queri explain previou section interfac machin connect internet charg run applic dispatch machin meta inform data distribut number rm xm depend number im grow number user control messag machin ship develop system ship data effici figur illustr queri evalu process view input queri partli optim compil interfac machin result compil distribut execut plan consist local subplan subplan ship respect machin eventu optim evalu subplan charg control execut send result back user stai interfac machin repositori index machin case index repositori machin involv machin repositori index machin interfac machin subplan dataflow control queri plan optim plan gener instal queri control access store access index figur queri evalu xylem evalu start machin index queri cluster identifi document element match tree pattern retriev assum queri index cultur return identifi document titl match queri pattern tree figur identifi return index ffl control subplan summari user ffl index machin join oper evalu support index ffl repositori machin extract valu select element index order effici pipelin evalu process intermediari data structur consum memori small buffer pass data machin evalu queri eventu stop user interest result distribut view queri view evalu replac view definit expand queri optim execut model view resid replic memori interfac machin rememb view xylem big grow web size depend number dtd machin memori dtd consum distribut view view collect concret type obviou answer distribut problem split collect im solut reason evalu broadcast interfac machin number im grow number size view averag size dtd collect web cultur paint author titl period museum titl artist period galleri abstract dtd painter concret dtd cluster map cluster painter paint year techniqu locat year descript biographi figur view cultur domain bad answer problem bypass distribut encod view reduc size smart encod scale standard translat pattern process queri step queri interfac machin local find cluster data concern gener plan specif abstract concret tree pattern queri pattern tree figur preserv abstract collect cultur replac actual cluster literatur cultur plan distribut evalu rememb evalu start index machin abstract pattern translat concret queri index section explain greater detail concern data structur translat process note translat nice properti avoid useless broadcast plan ship includ combin concret pattern match abstract solv distribut problem inform maintain im correspond abstract dtd actual cluster remain view inform natur distribut concern index machin cultur paint author titl period museum figur view interfac machin illustr reconsid view introduc previou section present figur view main memori persist straightforward translat xml document explain distribut view interfac index machin ffl interfac find tree repres annot abstract dtd node mark actual cluster exist match concret path figur structur time understand artist galleri titl paint year locat paint museum titl author root root root root cultur figur view index machin queri distribut replic im translat queri note made smaller root abstract dtd check abstract queri reduc number subplan user interest titl gener plan tourism section tree support join view definit note interfac machin manag abstract dtd item size small control ffl index find view inform rel index cluster figur correspond map figur consist tabl tree tabl repres simpl forest concret path map abstract path node repres tag identifi father node identifi entri tabl identifi tree map abstract path concret path concret path repres tree integ concret path dtd root element stem explain section inform reduc complex translat process thousand concret path rare dozen stem root note size alloc view index machin small compar size index size view depend size heterogen cluster cluster grow refin classif split result store index perform lazili view reconstruct index view simpli larger maintain view view data structur maintain interfac run process call global process queri compil control index machin repositori find process call local process local subplan evalu figur view data structur part process share queri manag object call view manag global local queri access view view manag navig accessor fact simpl object point view data structur global local find corba server call view server view server access instal updat view support view updat time perform send messag global view server view file map updat process global view server ffl fetch xml document inform view local view ffl instal memori tree structur connect abstract path cluster figur ffl interpret file updat annot tree abstract path partit map ffl cluster concern send updat messag local view ffl local updat wrong server return persist view inconsist success replai full updat make consist ffl save inform view return success local view server ffl updat view fetch xml document store previou updat instal data structur memori figur ffl read updat ffl save view inform return success note updat queri evalu version view order account send instal messag global view server global view server ffl fetch xml view ffl send instal messag concern local view ffl return failur distribut main memori view inconsist local subplan evalu user differ success replai instal correct ffl instal memori view data ffl view manag swap structur ffl wait queri structur updat tabl concret path slightli complex queri navig direct processor global queri view server view view manag queri queri processor local processor queri local local processor view server view view view manag global queri global queri processor processor global process local process figur global local process xylem ffl delet return success local view server ffl fetch xml local view ffl instal view structur ffl view manag swap structur ffl wait queri structur ffl delet return success readi abstract queri translat concret queri translat briefli explain previou evalu queri view perform interfac queri algebra express gener express featur oper call collect element match pattern section collect pattern abstract abstract queri translat translat abstract collect actual queri partli execut plan gener distribut plan evalu start index machin physic oper call abstract concret translat abstract pattern union concret pattern gener pattern physic algebra oper call match effici index document return select element document process machin concern full queri evalu process part view translat describ oper paint museum author museum author paint museum author paint union cultur cultur art document titl document titl document titl figur transform abstract pattern scan abstract queri translat part global process run interfac machin input oper match abstract pattern abstract cluster translat abstract cluster actual process illustr figur abstract cluster call cultur replac actual cultur art note pattern tree modifi trivial oper simpli global view manag mean navig annot tree figur navig view queri check comput intersect actual cluster found gener union oper branch actual cluster result queri processor incorpor global algebra express gener execut plan section gain complex ad join view definit languag museum author paint galleri document titl titl artist document figur concret pattern gener abstract concret translat part local process run index machin input abstract pattern view identifi output flow concret pattern figur illustr process pattern match art view inform figur good illustr main problem algorithm larg amount map abstract path abstract node queri map examin configur valid briefli explain section concret path form tree preserv relationship queri explain requisit detail museum author paint leav titl document figur upward path pattern leav rule node abstract pattern tree node concret pattern tree valid translat ascend ascend rule state swap node abstract concret impli semant strong relat broken explain section true chose rule slightli reduc complex algorithm section discuss relax sourc complex map lead rule rule view defin set map prefix valid exist prefix document find path painter rule forbid map abstract concept artist path map rule fact natur respect case algorithm readi explain algorithm leftmost branch abstract pattern tree figur rule impli translat branch branch comput rule leaf map solut solut construct concret node search map paint search prefix comput translat upward path start leaf stop reach node visit illustr figur constant branch stop node paint document call node constrain interpret attribut paint decomposit comput concret pattern tree combin branch solut leftmost leaf tree posit map find map descend rememb map node consist concret path dtd root element path stem figur map order root algorithm scan list map find root equal check map find consist root note check perform constant time rare bigger map ffl leftmost algorithm ffl comput branch start upward parent search map ancestor child note ancestor add node translat process case figur illustr case remov queri node map found construct fail node construct rightmost construct concret tree return branch comput root equal find solut leaf back previou complex scalabl factor algorithm averag number map abstract node repres averag number distinct root node averag number map root scalabl factor grow number store dtd number abstract queri tree length upward path consid constant cultur paint author titl period museum art museum author paint cultur titl paint author art paint art union join museum document titl figur introduc join view definit action perform leftmost leaf construct branch solut length queri cost worst map leftmost leaf fix root node queri tree arbitrari leaf ffl time branch left solut leaf map map construct branch solut fact root map time worst case complex ffl time branch find solut width queri time posit leaf worst complex algorithm fact equal smaller smaller fairli reason worst case complex improv consid view map tree collect tree virtual document collect actual document item inform sought user particip queri result answer queri empti exist document inform paint museum size abstract dtd web queri answer solut problem satisfi find follow link document document mean introduc join view definit languag solut relax queri semant answer found note solut studi briefli abstract queri level initi abstract queri abstract queri level museum author paint titl document museum author titl document document figur queri relax join view complex plan extend definit languag arbitrari join introduc follow link found xml document document paint link inform museum paint exhibit add piec inform queri result simplest found achiev goal simpli record fact concret path link assum concret abstract tag mean add map link note extra inform easi find add join translat process join introduc commun result machin machin museum paint part distinct avoid local execut join introduc global plan gener instal view repres queri interfac machin illustr figur lower left part figur show global view inform figur revisit link note node annot cultur mean find element concept museum tourism cultur cluster exist concret concept refer part figur partial show translat queri oper union argument previou section figur show join introduc museum link annot remain join paint art cluster museum cultur join lead potenti exponenti growth queri algebra plan queri complex answer reason amount time plan remain small abstract dtd concern queri natur node link worst case occur solut consist join backup answer found rememb part larg union oper easi deactiv incorpor progress solut fewer user feedback queri relax join answer queri return result solut call queri relax exist flavour inform retriev system answer miss interest document slightli structur goal queri relax phase relax rule guid translat process exampl relax stronger weaker ffl level discard rule algorithm match note remov augment complex construct upward combin map concret root add complex factor averag number map abstract node concret dtd tree length queri tree rememb number small ffl level remov queri node directli select project figur show result appli polici queri ffl level keyword search provid search abstract queri tree reduc root constant leav figur type queri chang note result level includ relax queri level queri bad wast cpu user time answer start evalu level filter result retriev level satisfactori impli work level return store intermedi data structur rememb process queri xylem requir memori pipelin good properti solut plan experi forget relax harm xylem project build data capabl store xml data web xylem properti xml provid servic difficult imposs realiz current web automat data structur chang present view mechan xylem address problem store view web scale work fulli implement join relax test step tune queri translat strategi result benchmark xylem team fruit discuss claud delobel rousset grate beeri visit gave suggest refer serg jason mc michael vassili janet wiener increment mainten materi view semistructur data proc int conf larg data base serg dallan jason jennif janet wiener lorel queri languag semistructur data intern journal digit apr queri xml document web peter susan kyle christian wong data transform system biolog data sourc peter intern confer larg data septemb page morgan peter susan gerd dan suciu queri languag optim techniqu unstructur data proc acm sigmod conf manag page acm cattel object odmg morgan vassili sophi jerom simeon wrap queri languag effici xml integr proc acm sigmod conf manag mari daniela alon dan suciu queri languag xml proc int www mari daniela alon dan suciu declar specif web site strudel larg data base david maier theori relat comput scienc oasi organ advanc structur inform standard jp integr de document xml heterogen technic report dan suciu queri decomposit view mainten queri languag unstructur data intern confer larg data septemb mumbai page morgan jd ullman principl vol comput scienc xml queri work group xml queri requir technic januari xylem
Agents/756 1 wasp nest factori vincent robot institut carnegi mellon forb avenu pa stephen smith robot institut carnegi mellon forb avenu pa abstract approach manufactur schedul control gain attent recent year approach attract offer robust unpredict factori oper specif local coordin polici give rise effici global perform effect adapt chang circumst remain interest challeng introduc approach coordin draw aspect comput model wasp coloni coordin individu activ alloc task meet collect nest focu specif problem configur machin factori satisfi product demand time system model set job queu front machin wasp agent interact form social hierarchi priorit job repres agent extern nest act machin model wasp task alloc behavior determin job accept machin queue show simpl factori system achiev desir effect job system converg factori configur maxim job mix system quickli adapt configur introduct factori complex dynam environ manufactur organ constantli face rearrang product evolv market opportun lead chang product demand manufactur prioriti resourc avail affect product capac forc reassess current product goal chang circumst frequent odd attempt build advanc schedul advanc schedul provid basi configur factori permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee canada copyright acm resourc optim perform rel requir prescript solut tend brittl quickli invalid unexpect event manufactur oper coordin decentr manner local dispatch schedul polici commonplac manufactur environ make execut base aspect current dynam strategi insensit unexpect event yield robust behavior advantag made myopic lead suboptim factori perform desir robust basi coordin similarli motiv research approach manufactur schedul control interest success approach suscept suboptim chaotic global behavior abil orchestr good global perform local interact protocol strategi remain challeng approach class problem view establish coordin polici adapt process exampl adapt behavior natur system comput analog system serv inspir optim control algorithm varieti domain context draw aspect model wasp behavior develop approach rout schedul job factori show simpl factori consist system converg factori configur special product maxim perform mix job system appropri adapt configur job mix time approach scalabl extend natur encompass complex factori environ remaind paper organ section summar wasp behavior model task alloc social interact underpin approach section model appli multiag system coordin flow job factori section present result section conclud discuss futur work wasp behavior model theraulaz al present model place coloni wasp suggest coordin group robot interact member coloni local environ result dynam distribut task forag care hierarch social order wasp coloni form interact individu wasp coloni emerg social order success wasp domin domin theraulaz al model aspect wasp behavior distinct behavior make explicit connect model describ natur interact individu wasp local environ respect task alloc model coloni selforgan alloc task refer threshold individu wasp threshold zone nest base wasp threshold zone amount stimulu locat wasp engag task forag zone lower threshold zone amount higher likelihood engag activ stimulu deneubourg discuss model threshold remain fix time threshold task time period task perform bonabeau al demonstr model lead distribut system alloc mail retriev task group mail carrier similarli adopt task alloc model assign job machin distribut factori set model describ natur interact place nest individu coloni encount probabl interact interact wasp higher social rank higher probabl domin interact social rank model call individu forc variabl success wasp chosen probabilist base function forc variabl interact wasp success wasp unsuccess interact wasp coloni domin hierarchi deneubourg discuss greater detail domin hierarchi wasp discuss number wai model probabl interact encount rang interact interact base tendenc individu concept forc model job exploit interact model priorit job machin queue high prioriti job correspond high rank wasp social hierarchi nest machin wasp nest appli wasp behavior model theraulaz al develop system coordin flow job factori satisfi machin job job job job job job job job job job job machin job job job job figur factori collect wasp nest queue job machin model wasp nest nest coloni agent charg priorit job queue wasp extern nest charg rout job nest product demand factori machin reconfigur perform task process job product time requir reconfigur machin setup requir perform type task setup requir level throughput attain depend abil factori configur special product minim setup time extent current demand job type biolog theraulaz al draw connect type wasp behavior model describ adopt type wasp behavior distinct aspect factori floor control interact govern basic task alloc machin factori rout wasp decid job accept process interact govern order accept job process queue front machin model coloni schedul wasp align specif job interact priorit job queue figur illustr system interest distinct aspect wasp behavior complement lack coupl underli biolog model rout wasp maintain threshold job type machin process respond stimuli job type rout nest job sit queue wait machin process simplest variat machin naiv process job complet machin pick job front queue order job queue dynam chang due behavior coloni agent charg schedul job assign individu schedul wasp schedul wasp posit social hierarchi coloni determin posit job queue machin process job order domin individu job line complet job seri domin interact place wasp job line wasp back queue success encount base factor job wasp requir setup time posit job queue wasp job end queue weaker job begin wasp job requir addit setup time stronger wasp job outcom encount chosen probabilist rout wasp schedul wasp discuss detail section section rout wasp machin system rout wasp rout wasp charg leav nest return job machin nest process wasp set threshold wasp job type wasp threshold job type machin process job system queu machin broadcast rout wasp stimulu equal length time job wait rout type job longer job remain stronger stimulu emit provid machin process job type rout wasp pick job emit stimulu essenti rule task alloc model function wasp tend pick job type threshold lower pick job type high stimulu emit threshold valu vari rang rout wasp maintain commun channel nest job type machin process knowledg adjust threshold job type updat threshold occur period machin back nest process job type process set process job type updat ffi machin back nest process set process job type updat ffi machin back nest idl empti job type machin process wasp adjust threshold ffi threshold job type process reinforc encourag rout wasp pick job type special wasp nest minim setup time wai threshold updat analog model encourag wasp idl machin job idl machin updat rout wasp eventu begin job special begin emit greater rule simpli act enhanc perform schedul wasp machin process job order queue order rigid chang time machin complet process wasp job back queue opportun challeng wasp job line machin job line type job wasp challeng wasp job analog low rank individu wasp social hierarchi part domin interact high rank individu job line requir setup wasp job back queue requir setup time process turn challeng wasp job challeng occur asynchron challeng wasp decid success multipl success occur pick random challeng success job success wasp trade posit queue job wasp lost interact order defin probabl challeng win defin forc wasp equat forc job prioriti job process correspond domin wasp coloni maxim system throughput detriment effect cycl time accomplish defin forc fw process time requir job wasp setup time requir job wasp process posit queue job wasp actual biolog model forc variabl vari rang base win loss interact applic model chosen impart wasp domain knowledg forc variabl futur extens work plan system due date urgent job account definit fw probabl challeng wasp win domin interact defin function forc variabl twist wasp higher forc variabl stronger individu forc defin lower valu impli stronger individu lower forc mean time requir job closer front queue job amount chang order forc variabl function note probabl challeng wasp defeat current rank wasp constant fc fp challeng chanc success fc greater fp challeng occur correspond weaker wasp challeng domin wasp wasp action evalu perform simul coordin oper simpl factori mix product demand factori interest experi illustr figur factori consist ident capabl process job type process job type requir time unit machin machin set job time unit requir machin benefici sequenc job type job type arriv period job arriv rate problem cover variat job ffl mix job type arriv time unit probabl maxim throughput expect factori configur dedic machin ffl mix job type arriv time unit probabl job type probabl expect machin dedic servic job type ffl dynam mix mix simul period simpli swap probabl mix part simul job arriv rate design approxim problem optim solut requir job process machin idl time job left unprocess end simul experi correspond heavili load factori condit variat agent coordin task alloc scheme outlin section refer rout wasp activ schedul wasp coordin sequenc job naiv polici process job order machin unit unit machin unit unit job job job job job job job job job job type type figur ident machin capabl process job type setup time switch machin scheme refer incorpor schedul wasp dynam manag machin queue threshold initi job type machin initi set random valu rang analog speci social insect individu initi special valu model paramet set trial error simul run fix ffi ffi ffi figur plot threshold rout wasp scheme number job mix plot column job type plot column job type lower valu threshold signifi wasp interest job type wasp plot shown averag time unit simul case job mix system produc desir machin special job type machin special job type job find machin equal interest job type machin stronger prefer job type expect machin job type expect equal strong prefer final row plot summar result dynam chang mix case job mix time unit chang time unit job arriv final time unit half plot machin strong prefer job type machin special job type half configur begin adapt job mix result obtain coordin basic task alloc model suffici fulli achiev optim factori configur time job type machin machin threshold time job type machin machin time job type machin machin threshold time job type machin machin time job type chang machin machin threshold time job type chang machin machin figur rout wasp plot averag threshold time rout wasp machin job mix tabl averag throughput job mix variat system rout wasp rout schedul wasp total job averag number job simul total job mix mix chang mix figur displai similar plot threshold rout wasp augment scheme plot show amplifi effect schedul wasp behavior rout wasp intellig sequenc result interact schedul system adapt job includ job mix chang time job differ worth note model fulli converg configur job mix improv comparison result machin slightli special job type machin job type machin stronger interest job type dramat improv dynam chang job mix experi time exact behavior job mix simul expect immedi time unit job mix complet role job type rout primarili machin machin process job type manner job type handl experi complet threshold shortli time signifi system process job machin sit idl job complet time unit factori process job simul end time unit interact schedul wasp nest posit impact behavior rout wasp extern nest improv throughput perform quantifi tabl show averag throughput number job result time unit simul valu averag simul threshold plot job mix simul perform roughli perform differenti job mix simul dynam chang job mix perform roughli job complet time unit sooner throughput greater tabl averag setup time job broken machin time interv mix mix chang mix tabl averag setup time job time remain portion simul horizon case job mix interv correspond roughli product phase chang job mix interv encompass phase note averag setup time lower compar confirm schedul wasp fact reduc amount setup time accru system averag setup time system configur job mix job averag setup time machin slightli time machin adapt job type chang job time requir reconfigur explan sharp drop averag setup time machin slight machin futur work paper present approach factori rout base aspect model adapt behavior observ wasp coloni agent perform rout activ manner analog task alloc real wasp machin queue agent coordin priorit job selforgan simul domin hierarchi demonstr system robust capabl effici adapt dynam chang uncertain factori environ extend work complex type factori coordin problem environ discuss system produc compar result scalabl version problem consid investig applic product environ interest adapt model oper respect common manufactur constraint due date object criteria minim weight accomplish investig formul altern forc variabl wasp intern nest encod dispatch model offer approach coordin materi flow meet chang time job type machin machin threshold time job type machin machin time job type machin machin threshold time job type machin machin time job type chang machin machin threshold time job type chang machin machin figur rout schedul plot averag threshold time rout wasp machin job mix natur applic global coordin problem continu trend special core manufactur organ reli increasingli coupl respect capabl partner capit market abil rapidli dynam reconfigur suppli chain increasingli import acknowledg wasp draw figur work fund part depart advanc research project agenc air forc rome research laboratori contract cmu robot institut view document author interpret necessarili repres offici polici express air forc govern refer attractor manufactur system chaotic present deneubourg local action global stigmergi collect robot brook artifici life fourth intern workshop synthesi simul live page theraulaz inspir optim social insect behaviour juli deneubourg adapt task alloc inspir model labor social insect bio comput emerg page world deneubourg fix threshold regul labor insect societi bulletin mathemat dorigo di caro ant coloni optim idea optim peterson cooper forag commun januari gordon organ work social insect coloni march kirchner town sensori basi danc languag scientif june lin integr shop floor control autonom agent liu coordin multipl agent distribut manufactur schedul phd robot carnegi mellon april morlei analysi dynam schedul final intellig dynam schedul manufactur page june morton heurist schedul applic product system project manag john wilei cooper schedul system expert system intellig page elsevi scienc publish clark agent manufactur requir system design workshop agent load balanc telecommun network agent intern confer autonom page acm fox resourc alloc distribut factori schedul ieee februari deneubourg hierarchi anim case primit wasp journal theoret deneubourg threshold reinforc labour insect societi royal societi london februari deneubourg task differenti wasp model group robot anim intern confer simul adapt page mit
AI/757 2 algebra topolog knowledg analog solv valencia abstract comput model analog solv base topolog formal sourc target analog repres simplex analog solv model topolog deform simplex polygon chain constraint appli framework resolut typic present find introduct present topolog framework knowledg base concept complex present system applic framework analog solv problem underli idea develop spatial relationship topolog relationship enabl build structur knowledg explor possibl topolog support analog elementari spatial entiti complex analog solv sourc target domain model topolog transform sourc target underli abstract space knowledg topolog knowledg topolog studi object properti invari continu deform combinatori topolog studi finit set object satisfi spatial algebra topolog develop applic algebra tool topolog problem combinatori algebra topolog approach attract constructivist model applic complex complex topolog abstract structur gener notion graph complex dimens graph definit standard algebra topolog definit abstract complex coupl set element call vertic complex set finit part part belong element call abstract simplex dimens universit franc universit franc simplex equal dimens complex dimens biggest simplex figur geometr vari hv figur show geometr complex set set close intersect complex attract gener semant network possibl express hierarchi relat graph hierarch structur highli recommend tree suffici knowledg complex binari relat atkin repres binari relat set model traffic interact agent chap posit analysi chess social relat incid matrix binari relat ae set ba set ba directli read tabl repres element ba vertic simplex build vertic dimens simplex sa repres depend number vertic ba matrix repres complex simplex repres element note ka figur fl valencia ecai european confer artifici intellig edit henri prade publish john wilei tabl incid matrix vertic simplex dual vertic simplex figur binari relat repres vertic repres dual complex kb element vertic element repres simplex figur ka kb inform present complementari simplex oe oe polygon chain dimens connect oe oe definit ff oe oe sequenc simplex belong complex call polygon chain origin oe end oe coupl oe oe oe dimens ff smallest dimens oe oe set predic extend set predic complex set predic png repres binari relat ae hold set integ set predic multipl incid matrix tabl repres dual complex element simplex build vertic dual enlighten fact element predic figur dual complex ae integ ident respect criteria tabl incid matrix number base complex associ simplex element distinguish element separ predic differenti situat occur dual complex simplex smaller common share term mean featur common call discrimin featur term applic refer system ident element repres featur share specif system analog solv solv analog model process analog solv basi previou topolog chose small paradigmat applic domain task answer typic give element call complet analog element kind analog solv studi evan work solut build scratch set solut choic call kind analog solv step ffl find relat ffl find relat ffl appli domain determin ffl verifi symmetri appli solv repres figur simplex relat figur path reason system valencia polygon problem space fourth figur deform figur path object term geometr element express properti level stai simpl chose geometr similar investig twelv basic element shown figur element combin properti element call start top left element black white triangl squar round view dual complex element vertic properti simplex notic simplex repres properti black figur element manipul complex set knowledg solv test repres knowledg complex conjug figur repres binari relat ae hold complex space problem solv analog deform simplex algorithm repres problem problem figur element element repres simplex properti vertic simpl figur repres simplex figur repres set simplex problem find relat repres repres appli repres note includ complex figur repres simplex belong transform tab model polygon chain sa sb domain sc appli tab determin tac sd deform sc tab appli relev domain sc figur step algorithm solv iq test case simpl figur repres simplex sa sb sc case simpl figur case simpl transform tab polygon chain sa sb elementari step link chain view elementari transform ts polygon chain sa sb transform ts ffi ffi relat minim number give higher prioriti polygon chain short higher correspond transform requir step preserv properti compar select solut measur satisfact appli tab sc extend domain tab extend tab ab ab sd ab sb applic strategi determin domain appli tab strategi implement thing chang invari hybrid method reason system valencia case figur transform junction introduc pair simplex transform simplex pair transform tab parallel applic transform found pair pair lead solut constraint vertic face pair vertic pair vertex mean pair vertex vertex mean transform pair vertex vertic mean duplic transform exampl analog solv give exampl solv figur solv call function resolv pair paramet shown detail figur defin term element figur white small circl white small squar correspond set simplex sa fh ig sb fh ig sc fh ig strategi pair set simplex set simplex output intermedi result result appli strategi set pair mean elementari transform element pair elementari transform depend heurist paramet intern settl call pair strategi appli elementari transform element set simplex repres appli output par mean parallel applic seq sequenti applic elementari transform term chang properti final solut element repres simplex sd figur output solv prefix output solut accept psycholog plausibl comput solut parallel select case solut user end figur element bigger black exampl solv pair strategi detail figur element black duplic duplic bigger figur element duplic duplic squar properti triangl creat unstabl call monster discuss choic made algorithm discuss addit strategi kernel ffl descript properti figur term predic problem properti posit give posit predic true reason system valencia ffl associ transform polygon chain uniqu transform call preserv minimum topolog properti chain step consist pair structur set simplex ffl determin domain sc appli tab lead strategi depend intersect sa sc sc ffl measur satisfact select solut shorter wider polygon chain complex measur satisfact test note formal problem depend geometr natur level base topolog object manipul system geometr verbal system comput model develop model analog solv analog system evan sme system illustr gentner theori analog arc system develop thagard simultan satisfi semant pragmat constraint compar system term perform studi analog structur constraint work contribut li princip search structur model term morphism topolog structur hybrid structur pure symbol pure analog approach prototyp mathematica program languag find result present surprisingli satisfi respect simplic underli machineri motiv investig complet version implement ml program languag intend explor notion formal concept similar polygon chain path topolog lead gener topolog model analog formal present consid wider field diagrammat reason lead concept toolkit assist diagrammat task system architectur design detail applic model diagrammat reason construct topolog structur inspir holland model refer atkin posit chess intern journal combinatori connect social harper overlap food soc biol thoma program solut class geometr analog semant inform chapter mit map engin artifici christian tempor structur cognit process foundat comput volum theoret framework analog cognit diagrammat reason cognit comput aaai languag structur introduct social geograph intern journal le en intellig combinatori introduct dover stephen structur cognit space order tree spatial inform volum gs dover experi creativ ai memo mit artifici intellig cambridg john keith richard paul induct process mit kathleen max spatial inform volum mathemat revolut inspir chapter mathemat complex johnson loom oxford transport plan chapter dynam larg complex road griffith oxford system septemb web pattern consequ april model pour le rapport pour le scienc august user electron document model analog european confer cognit model ritter richard pp april nottingham press weber testb miniatur languag intern comput scienc stephen redwood reason system valencia
AI/758 2 imit mechan joint structur build social skill humanoid robot brian scassellati mit artifici intellig lab technolog squar cambridg ma usa abstract adult extrem adept recogn social ey direct point establish basi joint attent skill serv basi complex form metaphor analog infant ground share experi assist develop complex commun skill review evid joint attent skill disord social develop evolutionari develop social skill describ research program aim test exist model joint attent develop build robot commun natur human joint attent group construct humanoid call part investig build intellig robot system progress skill similar observ human develop child learn social skill convent interact robot learn interact peopl natur social commun critic role imit plai bootstrap system simpl visual behavior complex social skill present data face ey find system serv basi system imit head movement individu motiv critic precursor social learn human develop abil select attend object mutual interest human larg repertoir social gaze point postur observ object collect mechan joint vital normal develop social skill children joint attent object event world serv initi mechan infant share experi negoti share mean joint attent mechan infant leverag skill knowledg adult caretak order learn part infant manipul behavior caretak part provid basi complex form social commun languag gestur joint attent investig research varieti field expert child develop interest skill part normal infant acquir extrem stereotyp sequenc bruner moor dunham addit work behavior manifest disord syndrom disrupt joint attent mechan demonstr vital skill social world philosoph interest joint attent explan issu contextu ground precursor theori mind dennett evolutionari psychologist evolut simpl social skill anim kingdom mean evalu presenc theori mind measur social function approach joint attent slightli construct robot exhibit social skill approach construct system recogn produc normal human social evalu complex model joint attent develop disciplin build machin recogn human social cue provid flexibl robust current system lack past decad increasingli complex machin learn system construct fail approach versatil human displai success system extract invari explor static attempt build system learn interact peopl social cue advanc embodi system build system robust safe stabl machin interact human learn environ construct machin recogn social cue human observ natur interact creat possibl machin learn directli observ untrain human instructor program build social capabl achiev wide rang natur interact untrain observ scassellati williamson robot offer uniqu tool psycholog relat disciplin evalu complex interact model implement model provid test bed manipul behavior progress implement test altern learn condit order evalu altern teach techniqu investig joint attent question develop origin complex commun skill human easili progress skill human acquir engag share fig humanoid robot cog freedom approxim human varieti sensori system approxim human includ tactil wrong problem hope correct part complex interplai learn basi commun robot implement theoret investig unavail direct build robot complet social skill human task resid realm scienc fiction artifici intellig order build success monolith skill manag piec remaind chapter devot build rough consensu evid work evolutionari studi decomposit accomplish rough outlin program build robot recogn gener simpl joint attent behavior describ preliminari step humanoid robot figur build program model joint attent build complex social decomposit simpler behavior skill implement test robot system section describ decomposit base evid abnorm evolutionari psycholog studi natur hope find fig vision develop platform work desktop system match design cog head develop platform routin system modifi breazeal investig express facial gestur regul social learn wai break comput problem manag explor theori human develop focu decomposit joint attent skill theoret begin develop decomposit implement test robot system evid decomposit relev studi occur evolutionari investig whiten collect import repeat mechan joint attent singl monolith system evid childhood develop show mechan joint attent present stereotyp progress skill occur infant roughli rate infant sensit ey direct interpret gener point gestur limit compon system disord unknown set behavior criteria center abnorm social commun skill icd individu tend normal sensori motor difficulti social relev task individu fail make ey recogn person fail grasp implic inform deficit cover cognit research miss mechan joint attent critic defici comparison mental disord william social defici specif grant evid research social skill anim joint attent set ontolog progress joint attent skill evid human infant evolutionari progress increasingli complex set skill map anim increasingli closer human phylogenet scale skill infant acquir earli sensit ey demonstr simpl snake green skill acquir tend primat decomposit basi implement joint begin model model coher account observ stage joint attent behavior normal blind observ defici joint attent children partial explan observ abil primat joint attent task describ detector detector share attent modul modul detector locat shape extrapol object detector attribut desir goal object move volit output modul share attent modul gener behavior link attent state observ attent state observ modul act output sam predict thought action observ individu descript analysi provid suffici detail robot implement build portion joint behavior requir set observ behavior evalu perform system increment requir decomposit skill mechan provid transit stage current work identifi implement account skill account reli heavili imit decomposit skill decomposit pursu broken maintain ey gaze imper declar point figur show simpl cartoon illustr skill smaller figur left cartoon repres novic larger figur repres caretak term implement vertic slice behavior part sam match observ skill stage mutual gaze stage gaze stage declar point stage imper point fig decomposit joint attent skill capabl maintain mutual gaze lead abil gaze imper point combin gaze result declar point section step produc mechan joint attent recognit mainten ey contact anim shown extrem sensit ey direct includ snake green chicken primat identifi obviou evolutionari advantag escap recognit carri social ey contact maintain social domin hierarchi relianc ey contact social cue strike infant strong prefer human face maintain ey contact month mainten ey contact testabl behavior goal system stage step engag joint attent gaze gaze rapid altern ey individu distal object attent anim sensit ey gaze directli primat show capabl extrapol direct gaze distal great ap extrapol object field view evolutionari progress mirror social skill ag term interchang ap includ human ap monkei ap human infant displai mainten ey contact month children begin exhibit gaze eighteen month children follow gaze field view gaze extrem imit gestur serv focu child attent object caregiv attend simplest form joint attent believ critic social scaffold smith develop theori provid share mean learn languag bruner ross function imit complet implement gaze involv separ discuss section step account imper point imper point gestur obtain object reach point object behavior human children month ag occur monkei infant behavior simpl reach infant initi perform imper point caretak attend infant caretak direct caretak present caregiv interpret infant gestur share mean infant learn gestur imagin child learn behavior simpl reinforc reach motion infant interpret adult request specif adult acquir child acquisit desir object serv posit reinforc contextu set reward reach action presenc attent gener behavior simpl extens primit reach behavior fourth step advent declar point declar point extend arm index finger design draw attent distal object unlik imper necessarili request children declar point draw attent object sun airplan pass overhead declar point occur specif social children point observ action imit critic factor declar point appeal specul ontolog phylogenet standpoint ontolog declar point begin emerg approxim month human time complex imit behavior pretend plai begin emerg phylogenet declar point identifi primat correspond primat document displai imit behavior gener condit child learn recogn declar point gestur adult imit gestur order produc declar point recognit point gestur build compet gaze imper infrastructur extrapol bodi cue present gaze appli domain gener declar point gestur requir motor imper util specif social circumst imit success point gestur child learn make similar gestur implement joint attent build system recogn produc joint attent skill outlin requir system sensori system motor abil cog project mit artifici intellig laboratori construct humanoid call part investig build intellig robot system progress skill similar observ human develop stein brook al past basic repertoir perceptu capabl skill implement robot brook al humanoid robot shown figur freedom approxim human varieti sensori system approxim human includ tactil cog visual system design mimic capabl human visual includ binocular wide field view high resolut camera captur view peripheri field captur view central area field view shown figur addit copi activ vision system desktop develop platform figur collect data report section minor differ differ import work report cog freedom neck pair humanlik arm arm compliant power seri elast actuat williamson hit arm simpli deflect implement mainten ey contact implement stage recogn respond ey requir perceptu abil requir robot capabl find determin locat ey determin ey robot motor abil maintain fixat point comput method face detect static imag investig machin vision poggio baluja kanad method current implement oper real time simpler strategi find face oper real time produc good result dynam condit strategi base method object detect report sinha find face accomplish fig imag obtain camera cog imag detect salient object worthi visual imag obtain high resolut detail object identifi potenti face locat imag base face detector identifi target face saccad target learn map convert locat imag locat learn map extract imag ey imag short summari step addit detail found scassellati identifi face imag convert grayscal pass stage figur search locat greatli improv speed detect step select locat potenti target motion detect face evalu combin optim detect face hz accuraci loss face detect method call design recogn frontal view face vari light condit ratio templat number region number shown figur overlai templat grayscal imag region convolv grayscal imag give averag grayscal region relat comparison region left forehead brighter frame grabber face detector motion detector fig block diagram stage face detect select target locat base motion inform past histori face detect occur hz accuraci loss left figur arrow head arrow denot lesser match metric number satisfi higher probabl face face face locat convert motor command center face imag maintain portabl develop platform ensur accuraci requir behavior learn adapt algorithm al map imag locat motor command foveat target call saccad map map implement interpol lookup train initi linear map obtain randomli select visual target saccad current map find target imag correl updat saccad map base error step system converg averag pixel error saccad trial inform techniqu found scassellati williamson human rare activ vision system saccad verifi locat face imag face ey locat templat camera map camera coordin learn map map pixel locat attempt find differ scale imag differ pixel offset estim row column scale factor appli imag match scale row column offset appli imag imag map fig ratio templat face detect templat region grai relat learn step scale factor estim activ vision move motor constant measur optic flow camera ratio flow rate ratio imag size correl find offset imag scale discov scale correl imag find match locat map face foveat extract imag ey imag figur extract imag readi process left imag figur show result face detect routin typic grayscal imag saccad imag figur show extract subimag ey obtain saccad target face addit exampl success detect varieti face figur method achiev good result dynam total trial distribut system extract imag ey trial miss result incorrect face identif face detect background result inaccur saccad motion subject order accur recogn caregiv account posit ey head posit head respect bodi work extract locat pupil ey posit head bodi progress implement gaze system capabl detect ey requir addit achiev gaze extract angl extrapol angl gaze distal motor routin altern distal object caregiv extract angl gaze gener detect face detector saccad map map motor control grabber fig block diagram find ey face target face system saccad verifi face map posit ey face templat posit imag gaze requir skill note section extrapol angl gaze difficult geometr analysi determin angl vergenc observ ey find distal object gaze human children demonstr simpler strategi butterworth shown approxim infant begin follow caregiv gaze correct side child distinguish caretak left caretak figur accuraci roughli determin angl gaze child track caregiv ey angl gaze salient object encount actual object attent angl child object encount path butterworth label mechan joint visual natur environ complet action month child reliabl attend distal object order scan path stage infant successfulli determin angl gaze vergenc infant exhibit gaze distal object field view turn angl gaze caretak warrant action infant begin enter stage follow gaze angl field repres angl gaze presenc object view implement progress robot system simpl mean bootstrap behavior capabl detect maintain ey contact extend provid rough angl gaze track angl watch object salient mimic ecolog strategi ecolog refin algorithm determin gaze add mechan determin vergenc rough geometr strategi refin feedback caretak strategi requir abil maintain inform salient fig successfulli detect face ey grayscal imag captur activ vision process ratio templat detect routin face found shown left subimag extract imag learn map object field view includ inform salient properti implement strategi requir make assumpt import properti object includ topic scope chapter implement imper point implement imper point accomplish implement gener task reach visual target children pass progress reach skill stage progress month stereotyp reach initi posit close child ey move ballist angl gaze directli target object infant miss arm withdrawn start posit attempt repeat achiev stage reach robot util foveat behavior obtain step order train arm reach al reach visual robot learn map retin imag coordin gaze coordin ey motor coordin arm motor figur saccad map relat posit camera imag motor command foveat ey locat task learn ballist movement map coordin coordin simplifi problem involv control arm posit linear combin basi postur primit fig addit exampl success face ey detect system locat face saccad extract ey imag camera posit ey part human subject ballist map construct learn algorithm compar motor command signal visual motion feedback clue local arm visual space saccad map util map gener error signal attempt reach figur track move obtain final posit imag coordin vector tip arm imag center imag visual error convert error gaze coordin saccad map gaze coordin train forward model ballist map distal learn techniqu rumelhart singl learn trial proce locat visual target saccad target learn saccad map convert ey posit ballist reach ballist map arm motion detect locat end arm saccad map convert error signal imag coordin gaze train ballist map withdraw repeat learn algorithm oper real unstructur environ explicit world coordin complex kinemat stage sensit field ecolog stage geometr stage fig progress gaze adapt butterworth infant show sensit side caretak gaze infant show strategi scan line gaze salient object child recogn vergenc caretak ey local distal orient object field view month ag techniqu successfulli train reach behavior approxim hour train video clip cog reach visual target addit detail method found al implement declar point task recogn declar point gestur applic geometr mechan gaze initi stimulu extrapol vector form angl gaze achiev distal extrapol vector form posit arm respect bodi requir rudimentari gestur recognit util mechan produc declar point gestur reli imit declar point social context begun focu problem involv recogn begun build system capabl simpl ad track mechan output face detector classifi system mimic head nod caretak nod robot respond nod figur face detect modul produc stream face locat attent marker attach salient face locat marker track frame frame posit marker face determin identifi visual target retin coordin motion detect imag correl saccad map foveat target gaze coordin arm primit coordin gener reach ballist map fig reach visual target product foveat target gener ballist reach ey posit imag correl train saccad map transform retin coordin gaze coordin saccad map conjunct motion detect train ballist map transform gaze coordin ballist reach track routin reset wait face acquir posit attent marker time repres motion face stimulu motion attent marker window classifi static class metric classifi cumul sum displac frame rel displac time cumul sum absolut valu displac total distanc travel horizont total trip distanc exce threshold horizont cumul displac threshold motion back horizont total distanc exce vertic total classifi motion part class vertic cumul total trip distanc exce threshold vertic cumul displac threshold motion classifi motion part class motion type default class simpl class drive pattern move head ey nod motion simpl form highli select produc horizont vertic movement suffici head mimic action movement object video clip guid evid disord social develop evolutionari develop fig gener error signal singl reach trial visual target gaze coordin transform ballist reach ballist map observ posit move obtain reach error signal imag convert back gaze coordin saccad map decomposit joint attent skill implement progress initi result find face imit simpl head suggest decomposit mechan build social skill robot implement begin skill robot acquir order test model inspir program robot implement provid tool investig complex interact model acknowledg support project provid part vision muri grant author receiv support nation scienc engin graduat fellowship author member cog group contribut rod breazeal robert charl matthew matthew williamson refer mit press fig imag captur videotap robot imit head nod upper imag show robot imit head nod human caretak output face detector drive fix nod robot face detector pick face stuf mimic action origin video clip brain autonom robot altern essenc fifteenth nation confer artifici intellig aaai press simul durat death anim behaviour joint visual theori blackwel monkei chicago press ed handbook john wilei compani time human infant infant neural inhibitori control neural base higher cognit vol york academi pp dsm statist manual mental american washington dc explain basil blackwel evolut mit press develop erlbaum icd classif mental behavior diagnost criteria world health organ geneva learn distal cognit scienc social face theori mind individu william journal cognit neurosci point humanoid anim animat fourth intern confer simul adapt behavior bradford pp ed joint origin role erlbaum evolutionari histori cognit trend neurosci seri elast intern confer intellig robot system vol pp theori byrn social evolut intellect oxford press decept theori blackwel human face detect visual technic report carnegi mellon shape bird ii import anim behavior capac joint visual attent natur mechan share attent humanoid cognit paper aaai fall aaai press foveat activ vision technic report mit artifici intellig lab memo find ey face foveat vision fifteenth nation confer artifici intellig aaai press recognit imag case investig visual scienc perceiv recogn phd massachusett institut technolog learn human face technic report mit artifici intellig lab memo dynam system approach develop cognit mit ma ed natur theori blackwel role tutor journal child psycholog psychiatri
ML/759 6 individu action collect sociolog learn ron sun cec missouri mo usa februari editori special issu cognit system multipl agent studi di erent disciplin issu tackl distribut arti cial parallel distribut cognit social game theori area mathemat relat disciplin studi dispar di erent disciplin tend ignor ai model cognit studi game theori west lebier sociolog work incorpor psycholog insight interdisciplinari interact integr commun make progress close research accentu interdisciplinari natur question learn interdisciplinari agent learn cooper bound minimum cognit capac agent learn cooper realist cognit constraint learn process dynam social structur relat interact multipl kei deserv discuss adam smith put intend promot public promot intend led hand promot end part intent paradox troubl economist comput scientist psychologist issu formul appar gap individu intent decid action larg social function action action bene social cooper establish individu maxim gain castelfranchi put real problem model plai social unawar function ect routin action subject situat similar ring individu neuron comput network neuron appar network neuron accomplish complex function unknown individu neuron strong similar human action issu consciou intent human explicit belief goal explicit mental direct connect social pose theoret point problem bridg gap explicit individu intent unintend social function suggest understand individu learn collect evolut kei satisfactori explan problem castelfranchi form simpl pattern format cognit emerg cognit emerg term sun sun al import collect notion cognit emerg reconcil di erenc individu intent collect social function human action hypothesi collect social function lodg cognit unconsci human long evolutionari process social reinforc agent receiv individu basi hidden cognit serv adam smith give rise emerg structur social function cognit emerg al agent correct consciou interpret case discuss notion individu cognit unconsci notion collect unconsci explor attempt answer ed open question cultur larg consist addit articul process perspect similar notion collect collect unconsci pierr adopt metaphor collect counterpart social unconsci social institut lodg insid individu mind note social unconsci properti exist question understand structur social unconsci answer question crucial step establish highlight individu agent societi burn address social role agent involv interact learn base notion rule complex knowledg arti cial describ individu chang belief social social social institut involv learn matter matter complex pattern social interact cognit lead complex collect social function broad theoret technic aspect collect function individu action explor work learn arti cial intellig provid concept bene ort understand individu action collect function aspect learn address michael littman deal function reinforc learn type set focu game von neuman morgenstern game competit equilibria cooper constitut subset game type basic approach reinforc estim valu di erent action di erent type reinforc learn techniqu likelihood achiev nash equilibria stabl ration discuss formal result converg result advanc formal mathemat understand interact multipl agent model base econom principl work baum reli arti cial economi evolv ectiv constel agent accomplish complex task work sun session simpl bid mechan establish cooper reinforc order solv complex task ecient hu wellman deal learn agent doubl auction market interest nding learn agent make minimum assumpt agent perform agent make elabor assumpt oppon wrong open question gener true circumst matter analysi recent work suggest qi cooper robot team central theme maja matar research matar discuss gener individu robot collect robot varieti techniqu survei rang commun channel amelior partial observ behavior histori imit learn robot human robot explor techniqu lead practic wai construct cooper robot team learn coordin accomplish task jointli approach cooper learn de essenti worth explor collabor make rapid progress centuri theoret work econom work includ work multiag research hope cooper lead understand sociolog collect function individu understand human cognit process underli turn lead design arti cial system present volum snapshot sampl work direct refer complex cooper princeton nj manifesto evolutionari econom intellig neural network machin learn ed bishop berlin invit exiv sociolog chicago press chicago game case methodolog individu theori collect unconsci york wealth nation clarendon uk account comput basi connectionist approach cognit scienc meet philosoph implicit skill explicit model skill learn cognit sun ration assumpt optim design applic intellig agent lectur note arti cial volum zhang soo germani sun reinforc learn bid automat segment intellig agent tool liu zhong world scienti singapor von neumann theori game econom behavior john wilei york west simpl game coupl random emerg properti cognit system
IR/760 5 submit intern confer machin learn learn extract symbol knowledg world wide web mark dayn andrew mccallum tom kamal yang quek school comput scienc carnegi mellon abstract goal project develop automat method construct maintain larg knowledg base content mirror world wide web argu feasibl system manual construct ontolog seed knowledg base set label web learn instanti object relat web system construct knowledg base support queri serv resourc problem solver search agent heart task gener identifi instanc identifi instanc relat defin ontolog includ task recogn case individu web page correspond class includ task identifi case pair page instanti ontolog relat present result initi experi text classif relat learn sketch problem futur research introduct world wide web easili access knowledg fact primarili repres text limit util wai goal research develop machin learn algorithm automat extract maintain larg probabilist knowledg base content mirror world wide web potenti benefit rang significantli power method inform retriev problem solver web directli underli knowledg base system answer question undergradu class taught full professor cornel versu paper approach extract symbol knowledg base present initi result feasibl machin learn support goal develop knowledg base provid ontolog defin class object relat interest problem domain top portion figur illustr defin hierarchi object relat interest develop provid train exampl web page describ specif instanc object relat web page figur repres instanc ontolog class faculti hyperlink correspond ontolog relat kind ontolog train system learn extract similar instanc relat fact explor addit web page goal system accept ontolog domain web knowledg interest solut learn ontolog ri defin set object set relat train set label web fragment page repres instanc ontolog object option set initi fact definit partial defin knowledg base method discov instanc ontolog object relat examin addit portion web learn method add factual knowledg knowledg base defin maintain knowledg base time primari role machin ffl discov instanc object defin ontolog instanc student ffl discov instanc relat object instanc relat specif specif person depart activ student faculti staff web entiti fundament cs home page jim tom jim home page research includ intellig web agent human comput interact teach fundament fundament cs home page tom jim webwatch project fund base knowledg structur figur knowledg base mirror content world wide web world wide web knowledg text form ontolog defin class relat interest user train system provid exampl object jim home page refer instanc relat research jim includ ffl discov probabilist rule reflect common regular implicit knowledg explicitli state origin web hypertext rule probabl requir learn hypertext content web page problem handl appli standard algorithm symbol knowledg base extract web method approach imagin approach problem extract object relat web approach natur languag text extract mean practic altern follow approach tipster project text pattern matcher develop describ specif phrase extract specif type inform paper approach conjectur extract inform web rich graph structur treat unstructur flat text build recent statist learn algorithm text classif assum paper instanc object ontolog correspond specif web page instanc person correspond person home approach task discov object classifi web page assum relat ontolog correspond chain web page object approach task discov instanc relat subgraph hyperlink web page final section paper suggest approach initi assumpt testb testb initi conduct experi problem domain scienc shown figur work ontolog domain includ class class set slot defin relat exist object class object ontolog class slot call relat peopl assembl data page hyperlink drawn cs depart auxiliari set page numer depart set includ page hyperlink interconnect auxiliari set includ addit page page class data set collect page class interest page hyperlink student label data straightforward gather initi set collect page point hyperlink initi set page point page home page object class page gather label classifi object task system identifi instanc ontolog object text sourc web note paper assum correspond web page ontolog student repres student home page procedur make identif consist statist text learn algorithm classifi web page object system output classifi examin structur page url describ step turn word vector classifi web page method repres document entri word vocabulari probabilist index approach paper classifi document word probabl word repres document class assign class document argmax argmax jd ith word dictionari word equat deriv directli principl theorem total assumpt condit probabl rule term jd probabl word repres document variant probabilist quantiti jd number time word occur document jdj total number word document defin quinlan faculti associ chair member ph director fax journal recent receiv award student resum advisor student work stuff link homepag interest person favorit homework assign exam grade midterm pm instructor due final depart seminar schedul event facil postgradu research group investig group member research laboratori develop relat arpa affili project type jan enter random program net time format access begin tabl contribut word probabilist index word vector class staff omit save train found test contribut score respect class note term miss html token interrupt lexic process word page poor predictor found home page note intuit prototyp import word actual student faculti dept staff group predict student faculti depart staff group tabl matrix show classif result combin test run obtain insight method word contribut highli quantiti class data tabl show ten heavili weight word class weight tabl word class quantiti multipli comput note magnitud vector weight rel strength top weight higher top weight instanc class strongli distinguish remain class instanc addit page remain data auxiliari data set perform run success exclud page data set mention section classif result shown matrix tabl notic web page instanc depart classifi high accuraci group instanc predict correctli accuraci staff page predict correctli group staff fewer train exampl person easili refin web page classif result shown tabl system learn classifi web page absolut accuraci disappoint student page correctli addit page class mistakenli classifi student page misclassifi student fact secondari student page describ hobbi research page point primari home page student object knowledg base repres singl page page regard page strongli resembl page class section examin refin initi approach design improv classif accuraci case trade coverag accuraci approach boost classif accuraci limit predict made system predict confid easili achiev method quantiti calcul classifi page measur confid classif set minimum threshold select point coverag order obtain accuraci goal automat extract knowledg base inform desir begin limit coverag page web examin url identifi primari page approach boost classif accuraci attempt distinguish primari page main home page secondari page page describ person point primari describ heurist design make distinct ideal imagin learn heurist exampl experi provid rule order evalu util approach examin structur identifi page primari page secondari page entiti url primari page author addit exploit directori structur web make deduct directori primari page directori start primari tild directori person organiz home page algorithm assum secondari page fall directori primari page algorithm group page directori expect find primari page primari group select page classifi page primari directori identifi match initi substr url algorithm consid page form primari page page match page classifi highest confid assum primari result impact incorpor refin origin page classifi summar figur horizont axi plot show actual coverag percent student page correctli classifi obtain minimum confid threshold adjust understand class student origin experi report tabl accuraci predict student page rightmost point student curv tabl show impact url accuraci improv note point curv correspond threshold confid predict classif minimum threshold accuraci improv cost coverag coverag accuraci reach level dramat improv accuraci obtain initi approach accuraci coverag faculti staff depart project student figur tradeoff url analyz attempt distinguish primari secondari page discov relat object addit discov instanc object text system discov instanc relat object investig approach method learn classifi appli automat discov instanc relat repres web approach approach discov relat base recogn pattern exist local graph structur surround primari page object case relat repres singl hyperlink instanc relat repres hyperlink directli home page home page instructor rule recogn instanc case rule relat appli recogn instanc relat explor web test set straightforward determin valu predic relat class predict valu produc page classifi confid valu produc page classifi assign confid instanti rule confid assign rule simpli product confid valu rule case rule appli rule maximum confid predict approach assembl set rule ontolog induc train data relat learn method experi appli relat learn algorithm foil found readili learn accur rule case relat repres singl hyperlink connect develop relat learn method suit task learn rule case relat repres chain hyperlink experi present rule recogn relat repres singl hyperlink experi conduct experi page classifi section conjunct simpl relat rule recogn instanc relat test set experi consist connect pair page page data set set connect posit instanc relat connect pair page task classifi relat page repres ffl instructor ffl instructor ffl pair repres instanc relat simpl rule accuraci coverag figur curv recogn instanc relat page classif section classifi connect pair data set note page classif experi predict classifi learn previou experi predict classif connect record confid predict threshold confid valu decid instanc classifi posit instanc relat case instructor instructor classifi neg figur show result curv result vari threshold accuraci classifi connect roughli coverag level note calcul accuraci respect instanc predict expect random guess result accuraci level result suggest high discov instanc relat exist object method construct knowledg base relat work recent year interest machin learn inform retriev commun text classif web repres huge data set space interest class construct effort web present opportun acquir user work model user interest direct interact detail web organ treat classif ontolog mean facilit automat process web data receiv attent shoe extens html page design annot associ ontolog enabl index system respond queri project adopt decim system ontolog sourc attempt model relat entiti project make appli index time organ retriev mediat user queri page content discuss paper explor feasibl machin learn techniqu classifi arbitrari hypertext page world wide identifi object predefin ontolog preliminari experi suggest class learn accuraci higher accuraci obtain trade coverag accuraci page classifi leverag hypertext web structur discov relat object reason accuraci abil trade coverag accuraci direct plan explor futur ffl addit featur content web linguist featur noun spatial layout featur posit url address url ffl repres web page includ descript hyperlink point addit content page person home page identifi fact hyperlink point proper person ffl hyperlink point web page hyperlink gener provid addit detail topic classif current page explor relat learn method learn classifi web page basi subgraph page surround page ffl develop method exploit hierarch relationship exist class ontolog approach learn separ page classifi level featur set select specif make discrimin level ffl learn classifi hyperlink base linguist structur surround text work obtain preliminari result show learn rule extract inform flat text base examin linguist sentenc ffl learn classifi bootstrap collect train exampl inform extractor learn classifi automat label classif automat label hyperlink point page ffl integr relat convent method learn recogn instanc relat learn rule defin relat repres hyperlink path invent predic textual content kei intermedi page lie path ffl initi work assumpt knowledg base object singl primari web extract descript object occur singl page spread multipl page ffl combin method extract object relat instanc web tradit method rule learn tract symbol knowledg symbol rule predict predict slot augment predict classifi task learn extract symbol knowledg world wide web offer wealth interest challeng machin learn problem domain test ground learn method combin rich symbol text hypertext refer balabanov learn inform retriev experi autom web aaai spring symposium inform gather heterogen distribut march cohen yoram singer learn queri web workshop inform dayn freitag machin learn inform extract onlin document thesi fuhr model retriev probabilist index inform process internet navig system workshop inform august kaufmann descript system fourth messag understand rager knowledg discoveri web workshop inform august syskil identifi interest web site thirteenth nation confer artifici august quinlan learn logic definit relat machin learn onlin implic classifi document retriev knowledg organ fourth intern juli
IR/761 5 linear classifi integr user model text content analysi person spanish servic alberto manuel manuel de jose pablo departamento de universidad de madrid de spain ext departamento de universidad de campu spain departamento de sistema universidad de spain abstract nowadai newspap agenc offer person inform access servic grow interest improv servic paper present methodolog improv intellig person servic appli spanish relev abc methodolog integr textual content analysi task machin learn techniqu achiev elabor user repres separ interest interest includ prefer structur content inform deliveri wide coverag classif topic person set keyword user defin prefer content machin learn techniqu obtain initi categori topic classif introduc detail implement methodolog abc describ experi evalu system comparison commerci system keyword content machin inform user adapt user person inform servic introduct journalist field lead offer advanc inform access servic newspap publish agenc suppli engin inform work partial support spanish ministri scienc technolog search person option opportun introduc improv context import popular web site outstand york offer person method special adapt base newspap section provid person base remain issu point simpl user model result introduct irrelev inform integr textual content analysi task machin learn techniqu achiev elabor user obtain suitabl document evalu similar interest inform repres exampl inform access system integr kind techniqu webmat sift webmat tool compil inform list url user monitor newspap home search result popular engin inform select accord user repres multipl interest vector term weight system compil person program repres account heard user avoid present inform sift inform filter system model interest topic keyword vector provid user updat automat relev feedback aim paper twofold methodolog improv intellig person servic present appli spanish relev newspap abc introduc work deepli integr element reach complet model person final offer person synthet version improv similar exist commerci servic user model repres separ multipl interest user express prefer term structur inform section newspap act structur inform wide coverag classif topic newspap level categori set content base interest user applic implicit feedback definit enhanc evolv interest text assign subject label text promin text analysi access task nowadai implement text categor modul automat assign spain subject label item base text text categor modul base linear classifi program mine spain web page appli inform retriev keyword item model user interest section focu process model interest applic set user inform access system kind user result elect usa person newspap subsequ dai hold stori consequ elect elect usa characterist kind suggest gener sporad interest separ long model access method depend kind necess handl ad hoc retriev handl dissemin inform select relev model send messag reader subsystem provid user set element place select piec inform context newspap section stori belong shown stori titl similar stori present element summari item adapt interest aim present import idea document relat integr summar subsystem introduc combin heurist gener gener summari summari adapt interest evalu summar system collect newspap articl domain prove util adapt summari inform access set short term model structur base model user model long term model content base model fine grain model grain model figur user model introduct identifi import requir user model reflect figur short model handl user system capabl repres multipl interest topic aspect includ addit person inform user prefer deliveri system store prefer structur newspap content grain keyword fine grain user model dynam adapt interest prefer prefer express term categori keyword term structur element belong section interest multipl interest user user show prefer give interest interest section item organ newspap user assign weight order give exampl usual section newspap section candid repres interest content altern possibl system provid wide coverag classif gener newspap familiar user greater part reader newspap web version season internet user settl categori hierarchi suppli familiar web directori select categori larger directori offer special version spanish categori system spain level categori level user gener interest categori level assign weight predefin hierarchi repres grain system user defin set keyword repres select method simultan categori lead addit control featur system oper unpredict model architectur extra level specif featur weight repres import interest tune mechan user obtain flexibl prefer addit inform user interest content system prefer inform deliveri inform refer dai week user messag upper bound number item messag avoid undesir overload desir length summari binari put system hold specif period time import user access model check featur user time knowledg system interest modifi extent implicitli desir inform retriev machin learn techniqu inform access system send period user relev respect interest store model item repres term weight vector space model formal concept similar text element user relev stori belong newspap section user model comput ij js kj β hj γ sim α newspap section user interest section user categori user number interest categori user di vector weight stori ch vector weight categori formula interest keyword user kj vector keyword user cosin formula vsm rank item obtain relev user obtain top rank select user accord upper bound number item messag profil appli text categori obtain rank order relev categori appli inform retriev keyword obtain list relev document user item process check belong section select user model document sort sourc result order integr level interest user assign refer system impli user inform chosen method interest result relev valu provid user easi number select method involv obtain system quot final relev rang user number select method chose automat categor item automat text categor system built perform task system learn linear classifi inform extract spain automat classifi item text categori level repres term weight vector vector built inform extract rocchio linear classifi assign categori vector categori cj text item pk compar similar sim ij ik weight ith term vector categori weight ith term vector item number term formula account length item item number word categori data acquisit mine construct vector repres extract inform spain requir categor system work item learn inform spain train data learn process design java program mine spain web site inform learn classifi classif program mine program download web page reachabl level spain web restrict domain page download train data import note common assumpt made appli learn approach item learn item classifi type approach describ violat forc requir state approach al classifi web document classifi artifici construct text surround hyperlink page categor machin learn linear classifi train text categor number machin learn approach includ tree learner probabilist classifi naiv neural network classifi knn approach import subclass learn approach learn linear winnow algorithm approach examin train instanc finit number construct prototyp instanc term weight compar instanc classifi linear classifi show interest properti make ideal industri applic linear classifi effici learn classif step linear number document effici learn approach linear classifi simpl interpret prototyp vector categori show high weight term consid good predictor categori linear classifi show good perform algorithm top perform standard test collect linear classifi advantag standard ir system categori similar document text collect categori vector index ir document classifi queri system classif system assign relev categori document select rocchio linear classifi algorithm popular learn approach test text categor algorithm origin design relev feedback process inform retriev system adapt text categor hull adapt model user prefer achiev dynam model evolv user appli feedback techniqu provid inform evolut relev feedback techniqu successfulli improv effect ir system techniqu work perform search retriev set user ir system design retriev document relev inform system queri improv reweight queri term ad term queri user unwil provid relev judgment retriev document user problem decid relev document altern implicit infer document relev successfulli appli learn user model document read user feedback system numer context includ summari assist user decid document relev inspect full text user access full text piec system infer relev term weight vector improv user model order achiev dynam user system store user read dissemin process user model adapt content base weight assign set keyword updat person access system electron version abc newspap implement method except automat adapt model figur show interfac edit model evalu model registr inform section categori keyword figur user model evalu work pattern appli exist system work pattern design evalu kind includ aspect interfac newspap summari user estim recal close questionnair evalu specif question center topic evalu system deriv major system restrict servic send digit version full daili edit select provid criteria section keyword system provid section keyword unclear interact produc final select control evalu environ establish analysi result respect kind user involv evalu carri user group lectur comput scienc extern user relationship field involv perform evalu evalu system evalu evalu observ user profil relev receiv document user check perform system actual set document newspap websit dai log system oper user profil system select object result obtain data work set recal base user criteria put base subsequ close analysi system log recal user criteria system log tabl recal figur result user evalu system evalu shown obtain similar recal lower system evalu reason user consid document relev refer interest belong categori word low recal consequ upper bound user model section categori number relev document high captur maximum recal fix user upper bound analysi user model log system yield data tabl upper bound select method section categori keyword averag select valu select averag tabl analysi user profil develop averag select user approxim upper bound document method select section categori keyword user select section method chose categori keyword user select method upper select method thirti chose chose categori chose keyword intuit method favour user chose section method averag section chose categori mark chose keyword mark user opt select possibl result show improv system respect system complet user model integr text classif techniqu optim system provid specif instruct method kind search refin wai integr method explor evalu process show measur effect develop futur work present set method achiev advanc user model offer intellig person access servic applic method develop person newspap relev spanish newspap abc introduc evalu comparison analog servic show result user satisfact person servic effect automat text content analysi machin learn techniqu integr achiev advanc user model user model account multipl interest chang charact interest includ interest inform deliveri explicit modif model support futur work plain extend machin learn techniqu feedback user model categori result daili text categor task make continu effort incorpor featur commerci version abc spanish newspap work user model multilingu environ exist resourc eurowordnet make refer fj sm autom learn rule text categor acm transact inform pp user profil model applic digit librari european confer research advanc technolog digit franc automat web page categor link context analysi european symposium hypermedia artifici pp interfac learn user profil implicit feedback aaai workshop recommend wisconsin hybrid user model stori classif seventh intern confer user canada de jm wordnet complement train inform text categor intern confer recent advanc natur languag process person agent search intern confer autonom learn method text categor acm intern confer research develop inform pp acm learn text categor confer empir method natur languag pp associ comput evalu base architectur digit servic fourth european confer research advanc technolog digit portug categori keyword interest specif tool servic onlin inform da improv text retriev rout problem latent semant index acm intern confer research develop inform pp springer de ls wb combin classifi text categor acm intern confer research develop inform pp acm jp train algorithm linear text classifi acm intern confer research develop inform pp acm evalu user direct summari improv inform access european confer research advanc technolog digit franc jj jr relev feedback inform retriev smart retriev experi automat document hall introduct modern inform retriev york da jo comparison classifi document rout problem acm intern confer research develop inform pp acm tutori autom text symposium artifici intellig sift tool inform dissemin usenix technic evalu statist approach text categor inform vol number pp jo compar studi featur select text categor intern confer machin pp morgan kaufmann san
DB/762 3 intern workshop logic program june pp logic semant languag partial complet tupl set mengchi liu depart comput scienc canada abstract discuss semant complex object partial complet tupl set redefin notion reflect exist partial complet tupl set studi integr partial inform tupl set spread check consist meantim present deduct languag ii complex object inconsist valu base relationlog main featur languag support null extend nest relat algebra oper directli importantli work firm logic foundat nest relat complex object partial complet tupl set solv open problem support gener inconsist valu deduct introduct complex object nest tupl set repres real world object relat set tupl tupl relat inform real world object incomplet tupl set partial complet complex object tupl partial attribut valu complet set partial complet tom children set sam member set sam partial tom children jim children pat set pat joe complet jim children kind set mean partial complet set relationlog notat distinguish repres partial complet set partial complet inform tupl interest problem obtain inform complet intend semant past partial complet tupl partial investig depth specif oper union join introduc integr partial inform complet set support set treat simpli partial set partial complet set complet investig relationlog oper call group integr partial set complet set partial tupl consist check consid deduct languag datalog extend express power tradit relat mean past languag complex object includ ldl hilog col relationlog support partial tupl support gener inconsist valu remain open problem deduct simpli tradit datalog join tupl base deriv bob pat ancestor intend deduct languag complex object inconsist valu perform natur join nest relat discuss specif null valu distinguish unknown valu rule ancestor mention problem gener null specif commerci dbmss support gener null paper twofold target gener problem combin work partial complet tupl partial set work partial complet set complet tupl uniform framework studi defin semant partial complet tupl set kei featur introduct equal special valu introduc deduct languag complex object inconsist valu call ii base relationlog ii mean languag successor relationlog ad support null extend nest relat algebra oper defin directli importantli make power languag calculu lp hilog col ldl relationlog stratif spirit research defin intend semant stratifi program minim support model program comput finit sequenc fixpoint work firm logic foundat nest relat complex object partial complet tupl set solv open problem support gener inconsist valu deduct rest paper organ section defin type object section discuss integr partial inform complet inform semant section present ii languag section definit stratif minim model semant stratifi program section summar point research issu type object assum exist countabl set attribut countabl set domain includ string boolean introduc notion type type defin domain atom type ftg set type distinct attribut tupl type atom call set call tupl call attribut denot set type schema tupl type ft ft call relat ft call relat schema defin notion object base notion boolean atom object special object inconsist distinct ho partial set distinct object partial set construct partial set fo complet set object distinct attribut tupl object denot assum attribut fa terminolog complet partial set tupl complet set partial set object tupl object treat partial set complet set tradit set ci cg exampl atom partial ag complet head irst citi relat object singleton tupl exampl relat head db set relat object defin notion introduc auxiliari notion set defin fin fin natur number ng natur number ng atom type assum set constant set call domain denot domain construct type obtain set type fin tupl type relat object schema respect exist relat schema schema relat object children children children respect relat object complet set partial set complet set fo intend mean element relat partial set ho intend mean tupl relat tupl ho relat object ho db respect schema relat object db respect schema db db ag ag ag sam ag ag ag relat object state faculti member sam ag phd state sam faculti member ag msc state ann faculti member msc object state faculti member mention phd db respect schema exampl complet inform real world object repres partial relat object partial complet inform tupl set relat object contradictori inform bob sam talk semant talk complet inform integr partial inform complet inform check consist meantim semant discuss integr partial inform real world object spread relat object complet inform semant introduc notion object complet doesnt involv partial set partial atom complet complet tupl complet depend object complet object denot partial set complet set exist om fa fa ha fa hc fd fc object denot object ident object denot ident object equal fundament differ choic equal justifi gener consid bob parent pat child bob parent pat child null gener consid equal term inform carri distinct turn power enabl repres null extend nest relat algebra oper defin directli importantli problem discuss discuss issu section studi integr partial inform real world object complet inform object compat tupl attribut compat intent treat attribut kei complex object integr partial inform base kei unlik tradit relat kei inconsist valu pair object compat attribut fa fa hd fd hc hc hc fc hc fc fc fc hc hc hd hd till fourth compat attribut compat compat attribut compat compat attribut note compat doesnt impli consist pair object fc fc fc fc fc fc nonempti set object compat pair object compat set object compat subset maxim compat set exist object compat object set compat relat object attribut definit inform real world object spread relat compat decid set object integr introduc compact oper integr partial inform complet inform gener union oper join oper compact oper incorpor partit normal form introduc compact oper defin set object complet set partial fo sg maxim compat set sg set object tupl complet object exist object compat set om attribut fp om ha ha ha ha fa ha fa fa ha fa hc hc hb fb ha hb ha hb ha ha ha fa hb fb hb hb hb fb hb hb fb continu db ag ag ag ag ag ag set object complet object denot proposit db db uniqu continu db ag db db intent db intend semant db defin order complet object base order object prefer denot complet set exist tupl set attribut attribut prefer relationship properti proposit prefer relationship partial order db db db proposit db db db schema defin semant db complet object respect db semant relat object db semant complet object semant partial object complet object partial object part queri partial complet tupl set queri compact ii deduct languag section introduc deduct languag ii complex object partial complet tupl set inform gener extend relationlog introduc complex object orient relationlog predic orient support null extend nest relat algebra oper defin directli importantli assum exist set variabl variabl exampl introduc syntax ii languag term defin constant atom atom partial set tupl term depend variabl atom complet set tupl term depend context distinct ht partial set distinct term partial set construct partial set ft complet set term distinct attribut tupl term term ground variabl schema atom tupl term fr atom ground ground ground atom relat object atom term posit liter posit neg liter liter posit neg liter rule form head atom bodi conjunct liter program finit set rule ag ag variabl figur show nest relat special object defin extend relat algebra oper relat ii rule repres oper hx hx hx hx hx hx hx hx hx hx hx hx ext children dai ext hx children dai program show support gener inconsist valu ii class text tutor text tutor children dai child dai date robert hanna mondai ullman brian thursdai program knuth hanna ada french martin class text tutor text tutor date robert ullman program knuth hanna richard french martin hebrew bibl tutor children dai child dai robert hanna mondai brian thursdai hanna ada martin wednesdai tuesdai fridai figur exampl nest relat algebra oper intend parent ancestor relat valu shown section repres correctli ii arent ar child ar ar child dec arent ar child dec arent ar child dec discuss semant ii languag object defin denot uc set complet object uc fo jo complet ground substitut finit map uc extend atom liter usual note requir variabl substitut complet object partial object variabl atom complet set tupl term schema program interpret complet object respect interpret notion satisfact negat defin ground posit iff iff equal defin section ground neg liter iff rule form iff ground substitut impli program iff rule program model interpret satisfi model minim model impli semant ii show suitabl syntact restrict justifi minim comput sequenc fixpoint oper intend semant program notion stratif languag give semant program involv negat set present similar notion program denot set relat relationship defin rule liter neg complet set term rule true bodi assum complet set term rule infer complet determin requir relat head higher level case negat program depend graph mark graph construct set node edg mark edg program stratifi depend graph cycl mark edg stratif program induc order evalu relat proposit set relat stratifi partit exist exist partit relat induc partit program strata fr relat head discuss defin semant stratifi program program interpret oper defin exist ground substitut respect undefin note similar tradit consequ incorpor type constraint complet ii partial set term function wai depend head rule bodi rule accumul partial inform complet set partial set complet set compact oper denot part complet set complet set partial set incorpor notion satisfact interpret support power oper defin compact oper defin defin pn sequenc oper iter power sequenc respect interpret defin defin pn pn defin theorem stratifi program minim support model program declar semant minim support model evalu exist continu program mp ar child ar child ar child ancestor dec dec dec dec dec dec discuss semant issu complex object partial complet tupl set investig integr partial inform spread tupl set complet inform present power languag ii support null extend nest relat algebra oper directli importantli solv open problem left provid herbrand minim model semant ii comput finit sequenc fixpoint work introduc updat construct ii effici evalu strategi ii prototyp implement ii semant languag present complex object objectori lack featur object class inherit behavior model complex object import compon model support partial complet tupl set import worthi studi number deduct languag iql rol directli support nest relat complex object mechan extend languag support partial complet tupl set acknowledg research partial support grant natur scienc engin research council canada refer abiteboul grumbach languag complex object acm abiteboul pc kanellaki object ident queri languag primit acm sigmod intern confer manag page kr ha walker theori declar knowledg foundat deduct logic page morgan kaufmann bancilhon calculu complex object comput system tsur set construct logic languag logic watter semant complex object approxim answer comput system zicari integr data model program paradigm acm sigmod intern confer manag page tanca logic program chen chu logic program languag deduct jm intern confer deduct page chen nest relat base knowledg acm sigmod intern confer manag page dong lv lakshmanan deduct incomplet inform joint intern confer symposium logic page mit press hull su untyp comput queri acm symposium principl page imielinski jr incomplet inform relat journal jr incomplet inform journal wu logic foundat languag journal krishnamurthi naqvi real horn languag intern confer larg data page lo morgan kaufmann kuper logic program set comput system mark leven georg loizou semant null extend nest relat acm libkin relat algebra complex object base partial inform confer mathemat foundat program page lnc libkin aspect partial inform phd libkin approxim intern confer data base page czech lnc libkin normal incomplet acm symposium principl page san liu type extens datalog set tupl intern logic program symposium page decemb mit press liu deduct object base languag inform liu type extens datalog set tupl journal logic mumick ka ross languag declar queri intern confer deduct page lnc semant type object theoret comput silberschatz extend algebra calculu nest relat acm
HCI/763 4 wearabl public displai falk appli research art institut box sweden abstract explor design space wearabl comput design wearabl comput displai paper describ effect turn privat displai transform wearabl comput concept make digit inform public privat user test show devic introduc interact suggest valuabl explor concept keyword wearabl interact public displai introduct wearabl comput defin continu augment mediat comput devic wearabl comput highli input output control effect keyboard displai wearabl comput power tool singl interact system person wearer altern approach interact wearabl interact shift wearabl devic explor potenti design space design prototyp wearabl comput displai form capabl displai dynam inform design wearabl public convent cloth inspir item peopl wear make statement person decid function coat badg primarili convei kind messag peopl design coat badg digit pin cloth import reason design proxim face promot interact displai instanc design made larger convei encourag wearer viewer figur connect hidden wearabl comput prototyp prototyp built base handheld effect function wearabl detach displai displai frame reconnect thin cabl game comput carri attract belt game interchang cartridg modifi aid softwar develop number present develop exist technolog rapid prototyp hardwar provid platform quickli implement graphic present exchang cartridg inform worn convei emot design implic major design public wearabl displai determin kind inform present provid inform wearer person view environ displai locat wearer inform provid natur option inherit wearabl system advantag wearer inform shown natur choic present adjust runtim parti star nice touch insert cartridg comput displai show cool viewer inform provid radic idea influenc displai advantag viewer interest inform present focu attent natur person disadvantag system viewer supposedli form separ inform displai sit confer particip stop inform receiv email expect import messag paper leav comput room environ inform provid option environ provid inform peopl organ vicin commun inform practic interest due local walk offic environ met fellow famou professor give talk minut attend forgotten locat experi interest lectur categori combin creat suitabl mix viewer wearer show interest due environ initi find test concept implement limit variant wearer environ inform wearer inform aspect program cartridg show star quot environ inform aspect incorpor radio transceiv enabl badg receiv displai broadcast inform local activ number student wear view perceiv enhanc interact point interest viewer wearer devic viewer fact activ user user express concern inform shown devic specif idea displai wearer felt import knowledg inform inform inform shown gener public interest import test user wear lengthi short text messag displai test test user show greater comfort shorter messag perceiv interrupt lengthi scroll messag regard distract shorter blink flash relat research interact form similar meme tag user wear displai intend interact meme tag focu exchang share autonom inform provid bound specif sourc viewer vicin devic exist associ displai inform inform initi phase continu peopl augment interact form ubiquit comput advantag human mobil publicli place public displai proxim prove conveni provid inform preliminari evalu augment give supplementari inform gener opinion test user suggest potenti wearabl comput kind futur work wearabl public wearer viewer face interact digit design devic explor step extend abil commun util wireless commun larger number built formal evalu control condit acknowledg construct gran design inspir lar erik holmquist particip evalu devic project sponsor refer meme tag commun move confer collabor cscw augment realiti wearabl comput mit media laboratori perceptu comput section technic report comput centuri scientif
DB/764 3 data integr servic introduct preval network technolog access data independ physic storag locat highli facilit enabl user access multitud data sourc relat combin return data inform physic store singl place person intens bui car queri car dealer web site compar result queri data sourc inform car review car imagin compani branch citi branch local record sale global compani branch queri result combin contact data sourc individu combin result manual time inform tediou task servic transpar access collect relat data sourc sourc constitut singl data sourc call servic data integr servic system integr multipl sourc provid servic refer data integr system main contribut data integr system user focu data describ obtain data integr system reliev user burden find relev data interact combin data return achiev system integr view data store underli data sourc user uniformli access data sourc queri singl data sourc access integr data form queri updat data data integr system facilit support chapter data integr servic data sourc queri answer data integr system data sourc data sourc figur data integr system tion olap analyt data mine olap perform market busi analysi make busi collect data data sourc analysi larg number aggreg queri detail data compani previou easili develop olap applic branch integr data mine discov knowledg larg volum data statist rule pattern automat found raw collect data data integr bring larg bodi data multipl data sourc uniformli queri knowledg discoveri detail inform data mine techniqu found custom chapter discuss issu involv build oper data integr system provid survei exist solut issu major issu investig main stage involv build data integr system comprehend major oper data integr system basic inform system comput architectur design data sourc integr major compon data sourc integr make design oper inform applic domain data integr system model applic domain determin underli data sourc model base model data sourc make integr system model data integr system provid queri function highli depend underli data queri capabl introduct content data sourc relat show varieti aspect differ make design model phase oper phase data integr system difficult major issu build data integr system resolv differ data sourc occur level issu gener refer heterogen data sourc data sourc integr belong compani arbitrari sourc world wide web car buyer sourc independ design autonom oper sourc necessarili legaci system obsolet system difficult migrat modern technolog file interfac data integr requir differ semant capabl data inconsist resolv major issu make integr data difficult heterogen data sourc sourc integr model world data similar semant data sourc convent refer real world object conflict data addit data model heterogen occur lower level includ access method sourc oper system underli individu data autonomi data sourc data sourc creat advanc integr system time part integr make independ forc act wai natur consequ chang data function announc world queri correct perform queri integr system formul unifi model system queri translat form understood process individu data sourc map incorrect queri result queri perform control factor degrad includ exist network environ commun delai unavail data sourc answer queri chapter data integr servic chapter outlin rest discuss mention issu detail order subsect chapter roughli correspond stage involv build oper data integr system start present common approach architect data integr system section discuss semant problem encount model data map stage data integr system section techniqu queri integr data present section data extract phase queri data obtain data sourc detail section devot section discuss import issu type data integr manag materi view system section complet discuss major problem solut section conclud chapter data integr architectur data integr architectur data sourc organ integr system wai section introduc main architectur data integr feder data wareh group approach base queri data sourc sourc queri result queri approach virtual approach materi approach data integr compar approach end section paramet describ characterist sourc integr distribut autonomi autonomi independ data sourc sourc integr system classif type design autonomi sourc independ data data semant interpret constraint commun autonomi sourc independ decid inform compon part integr system request respond execut autonomi sourc independ execut schedul incom request heterogen heterogen refer dissimilar compon data sourc make data integr system occur level lower heterogen hardwar oper network protocol higher heterogen program data model understand model concept relat logic heterogen resolv automat fact peopl present concept differ involv schemat semant heterogen schemat problem differ element repres concept store inform voluntari student posit develop attribut job hospit valu develop model job valu chapter data integr servic attribut job semant problem interpret differ unit attribut discuss issu section distribut distribut refer physic distribut data multipl site creat integr system design account latenc commun data sourc difficult heterogen system autonom data sourc metadata auxiliari data describ main data maintain integr system deal problem heterogen technic inform sourc queri capabl access semant inform semant connect domain dictionari describ main architectur approach design data integr discuss solut issu distribut heterogen major approach data integr common approach integr data sourc virtual view approach case data access sourc user submit queri inform system call lazi approach data integr materi approach filter inform data sourc repositori queri user method call eager approach data integr hybrid approach integr data select materi data extract sourc result queri store order queri design queri cost mainten issu discuss section virtual view approach discuss architectur integr data sourc virtual view approach feder system mediat system data integr architectur feder system feder system consist compon particip feder partial share data sourc feder oper independ feder compon call compon modifi ad interfac commun feder compon system central distribut feder manag type autonomi mention commun execut consequ heterogen issu main problem coupl tightli coupl tightli coupl fdb unifi schema unifi built schema integr techniqu section creat manual user solv logic domain expert determin correspond schema sourc tightli coupl fdb static difficult schema integr techniqu add remov compon easili kind coupl fdb unifi unifi languag queri sourc compon system human resolv semant heterogen request data export data compon decid view access data feder global sourc creat exampl system point order remain autonom function system provid mutual share data compon fdb facil commun data exchang compon access share data compon fdb import feder good mechan data exchang transact share case reason compon provid direct access share oper unifi schema schema produc schema integr system resolv syntact semant conflict schema schema user queri integr system chapter data integr servic data compon abil transact perform compon cooper activ central cooper kei feder sourc perform complex queri involv access data compon naiv achiev map schema schema map feder system figur requir schema translat tediou larg number compon feder research tool effici schema translat section note term differ research call tightli coupl system call coupl system approach tight architectur kind feder system architectur figur feder architectur feder architectur number autonom retain user queri collabor answer queri mediat system mediat system integr heterogen data sourc legaci web provid virtual view data user queri mediat system data sourc mean abil sourc data sourc data integr architectur schema access system present global schema user mediat user queri term mediat architectur tightli coupl feder wai mediat architectur compon queri capabl sourc system restrict sourc support access sourc system access fdb fact sourc system sourc approach complet autonomi mean easi add remov data sourc metadata wrapper wrapper sourc queri mediat queri queri queri queri sourc figur mediat architectur minor typic architectur mediat system shown figur main compon mediat system mediat wrapper data sourc mediat call perform action receiv queri formul unifi schema user queri individu sourc base sourc descript chapter data integr servic optim execut plan base sourc descript send wrapper individu transform queri local model schema mediat receiv answer combin answer send user wrapper hide technic data model detail data sourc mediat import compon architectur data refer section inform wrapper assum data sourc car dealer part acm car compani car dealer separ schema store inform car dealer store dealer store inform car sale acm car mediat architectur integr provid mediat schema schema mediat schema consist client acm car submit select automobil wrapper translat queri select year car make price renam model color wrapper dealer translat queri select data integr architectur wrapper renam implement architectur tsimmi manag multipl inform inform manifold sim carnot materi view approach materi view data sourc integr provid unifi view virtual view filter data store singl repositori data data tradit oltp line transact wai design support data histor summar data impli user data user tradit knowledg execut workload queri queri complex queri throughput import transact throughput inform oper oltp import step involv build maintain data model design stage design develop decid inform sourc view sourc global unifi schema mainten mainten deal initi popul sourc data refresh data sourc updat view mainten kei research topic specif data wareh discuss detail section oper oper data involv queri storag index issu chapter data integr servic metadata data integr queri wrapper wrapper data sourc data sourc figur data architectur data architectur figur compani cute toi toi store type toi dog store store number toi sold kind toi store store store assum compani relat data make integr select tupl union date type toi total number toi kind sold date sql queri sourc relat insert select sale data integr architectur integr insert select insert select wrapper sourc return relat correspondingli integr compon join sum number toi kind sold insert select implement data wareh approach data integr includ inform prototyp system note sourc integr retain execut autonomi comparison architectur virtual view approach prefer data wareh number data sourc integr system larg sourc updat frequent case web predict kind queri user sourc upgrad design integr system kind queri expect answer queri materi sourc physic locat access time queri formul introduc undesir delai time data wareh approach chosen improv perform architectur base virtual view approach mediat approach chosen system architectur common nowadai due larg number interfac written sourc commun chapter data integr servic hybrid approach discuss improv perform system approach data integr case select queri materi repositori repositori serv sourc mediat system hybrid approach commonli discuss literatur data wareh mediat schema integr schema integr schema descript data structur user relat schema specifi relat attribut defin schema specifi class attribut method class schema integr work construct integr inform reconcil schema data sourc coher schema product schema integr schema inform integr inform system metric exist judg good integr schema discuss section schema integr easi difficult depend data sourc differ schema repres inform section explor issu make schema integr describ techniqu develop deal problem problem schema integr schema integr problem broadli separ inform problem human organ problem formal realm schema repres human organiz problem autonom data sourc perform data peopl control data sourc act fairli autonom respect peopl construct integr system autonom data sourc internet rang data sourc integr larger data sourc manag peopl autonom peopl construct integr problem schema integr lack schema inform share sourc data administr interest integr understand schema relat schema site integr schema sourc data administr chang schema lead integr softwar make invalid assumpt data sourc chapter data integr servic schema design data sourc administr schema difficult integr schema integr system tightli control data sourc administr coerc easili integr schema coercion highli autonom environ complex set data sourc schema schema integr task conceiv larg human understand schema constitu data sourc place limit methodolog successfulli integr system logic problem problem fit squar realm formal problem focu attent schema integr research formal natur lend attempt solut involv knowledg numer incompat taxonomi describ problem occur schema integr repres taxonomi taxonomi heterogen conflict problem data model schema schema object orient integr schema repres relat conflict schema term describ concept term describ concept semant conflict schema level abstract model entiti distinguish schema integr system simpli model fail store distinct claim consensu reach taxonomi compet taxonomi schema integr structur conflict schema repres inform wai car ownership schema singl tabl store car owner schema normal inform tabl tabl taxonomi taxonomi larg refin heterogen conflict slightli incompat taxonomi offer taxonomi semant inconsist semant taxonomi includ conflict semant consid conflict distinct semant inconsist conflict notion conflict domain conflict schema simpl valu repres data schema store care price integ store price text string metadata conflict concept repres schema data regular data data sourc data sourc distinguish car truck maintain separ car truck tabl record specifi vehicl car truck data sourc singl field tabl row tabl repres car truck structur conflict notion structur conflict miss attribut schema repres superset inform schema schema repres car schema includ attribut date oil schema make provis store inform issu relat semant conflict deal differ level detail entiti schema store chapter data integr servic conflict describ fact inform system integr oper commun differ problem integr system semant inconsist integr inform system issu semant inform system taxonomi work offer full taxonomi schema integr discuss problem omit taxonomi list recognit object ident data data sourc attempt provid inform entiti recogn instanc data sourc fact describ entiti problemat integr schema integr schema gener repres form common data model design data model relat provid access data integr system common data homogen descript homogen descript integr system unifi schema design choic homogen descript integr system concept distinct specifi data model repres integr system homogen descript specifi data model schema provid integr system homogen descript higherord logic altern integr practic pair develop homogen descript integr system effort schema integr implement integr system associ procedur declar languag descript logic descript logic languag repres knowledg structur manner dl model notion concept role repres basic idea world concept unari predic subset domain concept notion concept definit includ object exclud role binari predic express relationship concept role repres binari relationship exist describ dl explicitli model predic descript logic schema integr dl softwar reason semant data provid basic semant inform make power tool design integr reason make human design integr system awar relationship schema unnot dl data integr advoc dl model data express model global domain global domain set concept role integr view system dl reason system set assert human state express term concept express relationship concept role data sourc integr data sourc global domain model integr system system lot automat reason data sourc ad remov integr system automat reason reduc effort invest error introduc human design integr system schema characterist dl identifi includ coher concept element meet requir concept subsumpt concept identifi concept relationship chapter data integr servic mutual disjoint concept identifi object meet requir membership concept concept identifi concept exact set element abil repres schema data model reason dl tool reason schema dl meet criteria capabl repres schema popular data model formal schema integr descript logic languag aid schema integr exampl formal qualiti metric integr schema qualiti metric integr schema access data data sourc provid integr view fact present set data sourc believ warrant confid data provid integr system data sourc consist descript logic complet complet consist descript logic data sourc correct minim understand integr transpar system common data abil integr system provid view constitu data sourc inform capac abil integr schema express inform data sourc schema express featur present absent integr metric score schema integr readabl integr schema make clear human import relationship impli integr schema redund recognit concept step schema integr attent paid step softwar design integr schema schema integr process gener consensu step clear survei academ literatur subject breakdown step translat data sourc schema integr common data semant enrich sourc record addit semant inform schema semant data model semant data model data sourc elimin issu data sourc data model schema car integr custom relat user schema integr schema translat semant data simplifi reason integr semant data model express relationship data schema element problem domain express data sourc data model formal addit semant inform produc good integr schema note addit inform discov simpli absent data sourc schema chapter data integr servic comparison analysi collect data sourc relationship element schema comparison comparison actual data data sourc statist reason fuzzi step guess relationship integr construct integr schema schema transform contrast offer includ earli plan phase integr includ select schema order integr step includ semant enrich sourc schema schema comparison analysi collect sourc schema correl conflict partial list conflict detect stage section schema conform modif sourc schema make suit integr includ resolut conflict detect schema comparison remain partial manual step human suggest conflict resolut lead modif sourc elabor reason schema merg restructur step sourc schema final ti form integr schema result integr schema evalu term qualiti metric section result qualiti analysi lead iter schema integr improv qualiti integr schema schema integr process perform increment integr step logic describ step data sourc type queri introduc integr system integr logic descript data sourc ad integr system step sourc model construct inform data sourc express term higherord logic integr system sourc model integr assert record relat data sourc data sourc global domain model conflict made appar assert record dealt step qualiti analysi assess qualiti integr schema outcom assess lead repetit earlier step global domain model sourc schema specif recal descript logic design time support softwar tool human design integr schema develop queri plan descript logic tradit schema access data sourc step construct view data sourc schema languag usabl system offer view data sourc design earlier sourc model integr step materi view schema data sourc introduc kind inform integr system integr system materi view restructur express newli inform applic integr system materi view section chapter data integr servic integr queri support integr execut plan formul queri accommod human softwar tool reason integr dl determin queri answer data sourc view establish specif detail reason softwar integr system materi view schema integr tool tool base survei academ literatur familiar industri solut data set tool assist schema integr larg academ excel overview kei academ system schema integr found benefit schema integr tool schema integr tool good perform great deal reason integr long human provid inform system languag tool reduc requir human effort integr schema identifi resolv schema conflict identifi relationship data store sourc schema optim integr schema term type check human rewrit queri determin exist data sourc capabl answer queri state art schema integr activ involv primarili schema enrich data sourc activ involv research peopl add inform sourc schema record written document schema integr conflict resolut schema integr tool detect conflict data sourc global domain model express human judgement decid problem trend research effort reduc human involv process time schema integr labor intens chapter data integr servic queri integr data main build data integr system facilit access multitud data sourc abil correctli effici process queri integr data li heart system tradit queri process involv basic declar queri user pass queri optim produc effici queri execut plan describ evalu appli algorithm execut plan data physic store disk procedur appli queri process data integr system gener term task challeng due complex brought exist multipl sourc differ characterist decid sourc relev queri particip queri evalu chosen data sourc particip process queri process mechan due potenti heterogen exist access method queri interfac sourc addit sourc autonom provid full queri capabl sourc data overlap inconsist data overlap data lead inform redund unnecessari comput queri evalu case larg number sourc probabl overlap benefici sourc queri evalu sourc incomplet term content imposs present complet answer queri list complic extens discuss section data integr system built major defin mediat schema particip data sourc store data integr system view materi data defin unifi schema integr system view user queri formul term schema integr system data store integr system unifi queri evalu difficult tradit queri process major issu synchron materi data origin data data mainten materi view discuss issu section view defin data sourc process data sourc updat data queri process origin data sourc realiz time queri integr data queri process materi view virtual view time user data sourc access requir queri process virtual approach includ issu mainten stage materi view approach discuss queri process problem virtual view approach section rest briefli discuss model issu form basi argument present main stage queri process data integr system queri queri optim queri execut data model map build model requir applic design schema support applic data integr start set preexist data sourc form basi applic data sourc data model schema sourc present partial view applic model design system applic start complet ideal view world simul design unifi schema singl data model base schema data sourc integr sourc map relev part unifi schema singl schema integr system call mediat schema facilit formul queri integr system user simpli pose queri term mediat directli term sourc schema practic effect term transpar system bring problem map queri mediat schema queri schema data sourc figur show main stage queri process data integr system global data model repres data integr system data sourc local data model conceptu translat mediat schema export sourc export sourc schema sourc schema differ data model user queri reformul queri individu global data model sourc queri translat form understand process data sourc data model translat achiev step step perform mediat wrapper compon oper mediat detail wrapper present section figur addit model mediat model sourc establish associ chapter data integr servic mediat schema sourc descript sourc statist queri sourc schema sourc queri export sourc schema wrapper data sourc queri mediat queri reformul queri optim queri execut engin wrapper logic plan queri export sourc physic plan queri execut wrapper data data sourc sourc figur stage queri process global data model local data model relat mediat schema relat sourc schema achiev sourc descript descript sourc content constraint content queri process capabl data sourc inform sourc permit subset queri schema sourc capabl descript includ input minimum maximum number input output select sourc appli accept variabl bind figur mediat schema sourc user queri reformul sourc queri export sourc schema export sourc schema refer translat sourc schema global data model sourc queri provid logic plan queri optim produc physic queri execut plan sourc statist physic plan execut queri execut engin commun data sourc wrapper shown queri execut engin collect result queri integr data sourc combin present user present method queri integr data model languag express mediat sourc descript queri due simplic illustr relat model global data model datalog languag datalog express queri view datalog program datalog program consist set rule predic xn variabl constant atom call head rule atom call subgoal bodi rule assum variabl head bodi rule mean left undefin variabl head variabl quantifi variabl existenti quantifi queri subgoal predic arithmet comparison variabl comparison predic ordinari subgoal bind predic repres relat store call edb predic predic relat construct rule call idb predic idb predic ri edb conjunct queri conjunct queri appli rule queri edb relat substitut valu variabl bodi rule substitut make subgoal substitut appli infer fact head predic answer queri conjunct queri model data sourc reformul queri mediat schema set queri written term sourc relationship relat mediat schema sourc relat achiev model sourc sourc descript approach describ sourc global view approach relat mediat view term sourc relat written specifi obtain tupl sourc chapter data integr servic simpl show mediat schema relat car review obtain sourc relat approach tsimmi system local view approach data sourc view term mediat schema relat written describ tupl mediat schema relat found opposit approach describ sourc term mediat schema relat assum sourc car produc sourc car sold dealer year dealer queri process approach applic broader problem call queri discuss problem section system approach inform manifold system descript logic approach descript logic languag design build schema base hierarchi collect domain model applic domain creat model describ class inform domain relationship inform sourc defin term model relat concept defin inform sourc concept defin integr system queri integr system term domain model model languag terminolog access sourc queri integr data dl approach similar view describ sourc written view formul term mediat concept class applic domain model queri formul approach sim system approach advantag disadvantag main advantag queri reformul easi relat mediat schema defin term sourc unfold definit mediat schema relat advantag reusabl view sourc construct hierarchi mediat tsimmi system difficult add sourc system requir relationship sourc sourc mediat schema chang rule queri reformul complex import advantag compar ad sourc constraint easier add describ sourc term mediat schema view sourc constraint simpli add predic sourc view definit compar dl approach benefit present user richer domain model hierarch structur sourc relat mediat schema relat part domain map facilit dl express model arbitrari join relat ad data sourc easi dl approach content sourc complet map domain domain model extend probabilist inform sourc descript mention sourc isol sourc relat underli assumpt sourc complet previou consid sourc car produc car produc car produc exist addit qualit sourc descript discuss previou quantit descript correl incomplet sourc qualit descript distinguish irrelev sourc quantit descript distinguish relev sourc higher probabl answer import work queri reformul focu approach chapter data integr servic categor quantit inform present coverag sourc specifi sourc cover qualit descript suggest probabl find data item sourc believ cover car produc probabl overlap part mediat schema specifi overlap part mediat schema indirectli overlap data sourc probabl car car econom ga assign car low ga infer car confid overlap inform sourc correl sourc content deriv categori explicitli state probabl car approxim subset kind probabilist inform optim queri process sourc higher probabl answer queri prioriti access includ similar studi probabilist inform data integr system queri reformul sourc user queri written term mediat schema reformul queri refer directli schema sourc global data import criteria met queri reformul semant correct answer obtain sourc correct answer origin queri minim sourc sourc contribut answer partial answer queri access addit avoid access redund reformul queri specif access sourc avoid redund queri evalu discuss queri reformul techniqu approach sourc model reason queri reformul straightforward applic import problem call queri briefli summar problem import applic present queri reformul algorithm queri integr data answer queri view problem defin queri set view definit rewrit queri view subgoal refer view predic find rewrit iti answer answer view interpret term queri reformul problem mean view describ sourc term mediat answer user queri written term schema rewrit queri queri refer view mediat schema view refer queri evalu sourc basic queri subqueri refer singl sourc answer queri view import applic includ queri data design semant data cach queri optim achiev materi view answer queri order save recomput discuss data design issu section ideal rewrit expect find rewrit data integr system sourc incomplet limit sourc capabl lead rewrit approxim origin queri approxim find technic term rewrit rewrit definit formal term queri queri subset queri queri rewrit queri set view definit queri rewrit refer view rewrit queri set view definit queri languag queri rewrit respect refer view rewrit chapter data integr servic complet complex find queri rewrit theoret issu relat problem find queri rewrit view includ complet complex queri rewrit algorithm briefli touch issu refer interest reader detail discuss complet queri rewrit algorithm defin set view queri queri rewrit algorithm find rewrit exist answer question depend queri languag express queri rewrit limit express languag prevent algorithm find queri rewrit exist case queri rewrit find rewrit point datalog rule rewrit exemplifi depend algorithm express queri languag complex queri rewrit algorithm discuss languag model assumpt np refer discuss specif case reformul algorithm queri set view term perform exhaust search conjunct view atom number subgoal queri algorithm altern wai find queri rewrit avoid exhaust search bucket algorithm main idea underli bucket algorithm reduc number queri rewrit consid subgoal queri separ determin view relev subgoal queri bucket algorithm find rewrit algorithm creat bucket subgoal view data relev answer subgoal algorithm find queri rewrit conjunct consist conjunct bucket choic element algorithm check result conjunct queri made addit predic ad rewrit rewrit ad answer result bucket algorithm union conjunct rewrit queri integr data simpl show algorithm present earlier assum data sourc inform car produc car sold dealer car review assum relat mediat view definit data year dealer assum car produc review sold pose queri mediat year statu initi letter field present step bucket algorithm construct bucket subgoal notic view map queri subgoal bucket import note insert bucket constraint year attribut queri car produc queri produc answer queri step algorithm view bucket combin queri simpl entri combin view construct queri combin entri test origin queri result union queri chapter data integr servic obtain queri written term view definit mediat schema year statu note elimin redund refer view ad extra constraint year statu attribut term complet mention bucket algorithm find rewrit queri queri arithmet comparison predic phase exponenti long algorithm kei idea underli algorithm construct set rule invert view rule show comput tupl mediat schema relat tupl view process obtain definit definit rewrit rewrit view definit origin queri easili answer rewritten rule rule construct subgoal bodi view invert view existenti variabl view definit map skolem function ensur variabl lost illustr view definit previou year algorithm invert view definit write rule subgoal view definit illustr attribut replac skolem function attribut view head input attribut chang variabl reason treat special attribut share car model view definit car exist model place view make map rewrit queri set view datalog program includ rule queri show queri evalu rule queri integr data assum sourc defin algorithm comput evalu obtain answer term algorithm find rewrit polynomi time size queri view note illustr rule approach evalu queri algorithm algorithm improv version bucket algorithm bucket comput subgoal comput rewrit bucket algorithm pai attent interact variabl queri view definit prune view ad bucket number view consid rewrit step number combin check clarifi algorithm view definit origin bucket algorithm put bucket car model rewrit requir join sell review chapter data integr servic sell review variabl head join view sell review variabl join sell review attribut view head model year rewrit put bucket car model subgoal bucket model sell bucket review queri prune bucket construct check number view combin rewrit detail discuss algorithm aim recov weak aspect bucket algorithm obtain effici algorithm idea examin share variabl reduc bucket content number view combin consid reduc phase algorithm describ algorithm detail interest reader algorithm assumpt view materi relat possibl infinit number aim find produc optim physic plan exist rewrit aim queri cost model consid algorithm differ algorithm contrari previou algorithm aim find rewrit rewrit redirect interest reader discuss algorithm comparison algorithm algorithm algorithm algorithm aim find rewrit queri goal algorithm find rewrit assumpt enabl algorithm find rewrit reformul stage queri process integr optim stage rewrit optim plan queri remain bucket algorithm share spirit bucket construct cartesian product bucket produc rewrit defici bucket algorithm construct queri integr data bucket unnecessarili larg lot combin comput test phase bucket algorithm close approach prevent defici algorithm shown outperform bucket algorithm algorithm advantag rule comput appli queri rule easi extend addit constraint ad system function depend rewrit obtain algorithm view relev queri algorithm ignor predic constraint variabl addit phase remov irrelev view ad shown ineffici rule algorithm larg number rule unfold queri evalu queri optim execut queri optim refer process translat declar queri effici queri execut specif sequenc step queri execut engin follow evalu queri addit oper applic order queri execut optim decid specif algorithm implement oper indic execut plan execut plan chosen optim estim cost candid plan cheapest cost estim statist inform underli data size relat select predic plan gener involv rule thumb select join techniqu easier cheaper evalu cost plan optim plan discuss previou queri reformul step optim queri prune irrelev sourc distinguish overlap sourc avoid redund comput rewritten queri specif logic higher level optim optim execut logic plan gener reformul physic data queri optim data integr system difficult optim problem tradit sourc autonom optim statist statist data store sourc chapter data integr servic sourc heterogen queri process capabl optim exploit capabl addit kind queri sourc process process relev kind process power underli data manag system perform due workload tradit easi estim data transfer time local disk main memori data integr system data transfer time predict due exist network environ delai burst occur sourc overlap redund time access redund sourc minim sourc unavail notic queri optim handl case flexibl replac overlap sourc unavail addit problem ineffici queri execut logic plan produc reformul lot union oper bottom line difficult decid static optimum strategi execut queri due insuffici inform dynam environ tradit approach gener queri execut plan execut applic adapt queri execut approach queri optim execut interleav rest section discuss approach adapt queri refer section advanc section option addit list make observ queri optim data integr import aim minim time answer queri minim total amount work execut queri amount data data sourc smaller compar case queri singl sourc tradit system adapt interleav plan execut queri integr data adapt oper execut engin higher achiev creat partial plan call fragment complet plan optim decid proce execut fragment fragment optim sourc environ plan rest queri includ oper execut depend observ list import oper system hash join collector oper hash join join implement quickli return answer queri spite fact sourc respond slowli contrari convent hash join smaller relat join chosen relat hash join hash relat hash result tupl produc data sourc arriv mask slow data transmiss rate sourc optim longer make relat size relat smaller process block due delai sourc collector oper facilit union larg number overlap sourc estim overlap relationship sourc depend behavior sourc optim adapt polici union perform collector oper achiev applic dynam polici polici rule level adapt realiz rule event execut oper complet fragment obtain partial result event trigger condit check defin action execut action includ reorder chang polici collector oper rule accompani oper tree gener optim modifi implement oper condit check point fragment complet order detect opportun queri translat thing treat black box sourc queri export schema schema sourc global data translat actual schema local data execut nativ queri processor step call queri translat step achiev wrapper data extract sourc wrapper topic section chapter data integr servic techniqu extract wrapper data extract deal issu process data sourc integr system combin techniqu area system artifici intellig natur languag process machin discuss wrapper previou import compon data integr system review work tool automat wrapper gener inform integr heterogen data translat queri data data model data schema mention section wrapper written data sourc integr system wrapper transform queri unifi schema queri format underli data sourc translat result back unifi schema note mediat system requir complex wrapper system wrapper gener approach wrapper design construct wrapper tool facilit wrapper code develop approach manual wrapper tediou creat impract sourc case web number sourc ad structur content sourc chang factor lead high mainten cost manual gener wrapper note part wrapper code deal detail specif sourc small part wrapper gener semiautomat base declar descript user techniqu program automat automat gener mean human involv tool automat wrapper gener gener train initi stage base learn algorithm techniqu extract wrapper tool wrapper construct review techniqu automat wrapper gener data design case web sourc mention write wrapper code web sourc hard due frequent content structur sourc data web partial structur fact develop tool automat extract data format inform semistructur page web html document intern hierarchi hierarchi explicitli site travel agenc inform countri hotel semistructur format presenc partial structur web sourc integr system design opportun gener wrapper sourc domain inform web underli web sourc question queri directli number subject sourc set permiss user queri approach describ semiautomat gener wrapper sourc sourc sourc inform page format weather page page citi structur current condit section humid wind wrapper answer queri section individu page sourc singl page inform author identifi step wrapper gener process type sourc mention build ad commun capabl structur sourc step refer find head token organ hierarchi tree section stress document size font type font notic colon simpl chapter data integr servic prove work domain system suggest set user correct output hierarchi found head determin base indent space font size grammar describ structur page web sourc produc result step result publish author show correct made user web sourc build parser parser extract structur portion data gener automat output grammar step ad commun capabl wrapper mechan fetch page sourc case singl page problem long url page case multipl page map queri url set url case cnn weather state usa citi url page weather forecast obtain ad end abbrevi region ne stand north abbrevi citi citi abbrevi url ri wrapper reli protocol deliv data network author paper perl script wrapper mediat commun integr system review system kqml queri manipul wrapper approach hammer al applic type data relat legaci web sourc wrapper implement toolkit base idea translat design wrapper declar languag defin rule type queri handl sourc rule defin action case queri mediat integr system match rule action nativ queri queri format underli sourc execut filter queri extend set queri sourc handl sourc support queri turn nativ queri predic techniqu extract wrapper support filter queri result nativ queri process queri transform consist step queri mediat match templat system match rule nativ queri process data result filter filter queri wrapper languag msl author queri formul give msl templat match nativ filter queri base present data sourc relat refer acm car compani relat relat consist data sourc write wrapper support msl queri sourc sourc support comparison predic attribut user msl queri honda car sale price match queri result templat queri superset result user queri action templat select automobil substitut nativ sql queri relat select automobil wrapper receiv answer sql queri thing postprocess result queri filter chapter data integr servic leav price result return back mediat integr system induct learn techniqu automat learn wrapper techniqu call wrapper induct techniqu base induct learn induct learn task comput gener set exampl unknown concept gener suggest model explain exampl simpl induct infer teacher sequenc pupil guess rule produc number previou case pn point classif induct learn method wrapper learn call tree learner solut repres tree drawback method fact base proposit logic number limit deal relat relat learn method type deal logic predic induct logic program method wide due abil deal complex structur approach part learn approach suggest gener base exampl gener model correct base exampl approach start gener hypothesi distil learn neg exampl system induct learn wrapper stalker system kushmerick al excel overview system inform extract induct learn discuss system develop kushmerick al approach suit text sourc tabul structur left tail html page list pupil class base assum pupil identifi techniqu extract wrapper call left delimit separ data html page string order distinguish tupl html head tag tail tag set delimit make job wrapper skip string till marker end fill tupl data surround algorithm author develop automat gener wrapper structur miss data order strict call class wrapper number html page label label case mean specif html page label html page hypothesi case set tag separ attribut wrapper learn separ famili label hand pretti author set heurist input label algorithm induct algorithm learn label data algorithm construct set delimit consist label page combin tag present page till consist set tag found question exampl conclud set delimit consist exampl consist remain exampl probabl ɛ learn wrapper correctli confid δ author provid formula estim chapter data integr servic materi view manag view defin deriv relat set relat queri result ordinari relat store tupl virtual relat defin view physic store call view materi view materi view date back earli tool speed queri view maintain integr constraint detect rule violat activ gain emerg applic data wareh discuss issu relat materi view data integr system present materi view approach data integr section term fact set view deriv data sourc answer view store repositori call data main improv queri time complex queri process step section answer user queri data time queri step complet result collect advanc queri abil answer queri avail system continu answer queri underli data sourc inaccess reason time queri benefit mention free view materi determin costli redund materi deriv relat defin view constitut unifi schema integr system benefici view select base criteria frequent queri view select materi maintain view mainten refer process synchron deriv data store updat base data store underli data sourc naiv maintain view view relev updat occur desir good perform present materi view select problem solut discuss approach maintain select view effici design select view materi problem materi view select defin set queri integr system access frequenc set sourc relat updat find set view materi total queri time queri process cost maintain select view minim materi view manag resourc constraint consid disk import mainten previou research problem concentr optim techniqu problem find optim queri execut plan evalu set queri simultan techniqu involv identifi common subexpress execut plan queri wai combin search space larg gener approach produc local optim plan queri merg optim gener global optim larger search space proven problem solut make heurist find solut close optim solut relat work materi view select similar path method multipl view process plan construct set queri part plan select materi cost comparison base cost cost queri number row tabl construct queri cost queri process frequenc queri multipli cost queri access materi node cost view mainten equal cost construct assum total cost equal sum cost queri process cost view mainten stage view find good global queri execut plan local execut plan individu queri merg base share oper common set wai find merg local optim queri plan local optim plan comput queri queri order descend fashion base queri process cost multipli access frequenc construct ith local queri plan incorpor order view select algorithm stage run costli chosen approach linear time term number queri gener global optim plan local optim plan queri consid problem map integ linear chapter data integr servic program problem state select subset join plan tree queri execut total queri process cost minimum set join tree found construct solut linear program problem optim solut solv exponenti number queri solut found select view materi execut tree built node correspond intermedi result queri simpli complet tree leaf node materi correspond materi queri base aim find set intermedi node materi total cost queri process view mainten minim brute forc find set compar cost combin node effici heurist algorithm present base node consid calcul save bring access queri subtract cost maintain node node materi ad solut set similar approach present base greedi heurist graph graph repres set queri plan graph queri merg obtain view graph node view graph repres view select materi problem node view graph sum total queri time total mainten time minim state minimum set cover problem reduc problem algorithm present greedi heurist set select view benefit step view benefit set ad set special case view view view graph indic investig focu view mainten indirectli cover method applic view select augment set materi view addit set view reduc total mainten cost select problem determin addit view appli techniqu view select mainten select plai addit view materi temporarili effici mainten claim techniqu applic select perman view materi research studi materi view select special case data cube dataset olap present detail materi view manag problem view mainten materi view deriv data origin store multipl data sourc primari copi data data sourc materi view stale inconsist underli data call process bring materi view underli data view mainten materi view brought view definit recomput view time base data effici point gener part view base call heurist inertia part view affect comput updat call increment view mainten exemplifi increment view mainten base relat store data assum view defin car materi data price car tupl ad car tabl data view updat modif addit tupl view recomput car tupl modif tupl satisfi view definit present dimens problem altern polici view mainten increment view mainten techniqu discuss subsect dimens problem paramet determin complex view mainten problem inform refer amount inform view mainten algorithm view definit actual updat occur base data algorithm addit inform content materi content base definit view integr constraint data sourc access algorithm depend inform task view mainten facilit knew attribut kei underli data insert attribut insert chapter data integr servic sourc requir insert materi view refer attribut modif determin modif handl view mainten algorithm paramet includ group express view definit languag view definit languag facilit complic task view mainten view defin level express languag includ conjunct modif instanc current content data sourc materi view modif determin capabl mainten algorithm complex dimens level complex dimens refer effici view mainten algorithm complex measur multipl includ complex view mainten view mainten algorithm amount extra inform view mainten polici main step materi view propag refresh propag step involv comput materi view base data refresh step comput appli materi view propag step refresh step perform mainten polici mainten polici categor view mainten refresh transact base data advantag polici queri process fast return result reason materi view brought advanc queri polici slow transact data sourc propag refresh scope polici applic data sourc fulli autonom commit delai integr system defer view mainten refresh view transact materi view manag base data log base data polici batch updat appli collect log view time defer view mainten view refresh lazili queri time queri answer consist base data slow transact sourc queri integr system process slowli view forc amount chang base data transact queri perform queri return result refresh period time interv call snapshot mainten spite good transact queri queri return result mainten scale number materi defer mainten view maintain immedi made select queri view consist result view maintain immedi view queri infrequ maintain defer fashion support stabl copi deriv data import period defer polici decent studi consist perform issu support multipl view mainten polici materi view relat inconsist maintain polici mutual consist view settl question view mainten appli discuss mainten perform increment view mainten increment view mainten algorithm investig long time effici altern work area problem central system materi view speed queri view implement rule check effici problem addit facet consid scope data integr system previou work appli case form basi algorithm data integr applic categor increment view mainten algorithm clarifi link mainten perform base relat case mainten polici mainten perform transact updat sourc chapter data integr servic mainten perform transact updat relev base relat previou method appli central natur involv algorithm base relat materi view part system data integr system algorithm underli sourc autonom unawar mainten procedur occur integr system forc includ mainten procedur updat transact state inform sourc decoupl data bring addit problem consist focu method increment view mainten gener present techniqu specif data integr system subsect survei increment view mainten algorithm classifi view languag inform dimens discuss give explicit classif aim give flavor import issu address algorithm handl select project join view isol consid spj view insert delet consid insert tupl simpli union delet tupl simpli subtract materi view data set updat view delet occur base relat complic problem stem fact tupl view project attribut due multipl tupl base relat base tupl deriv tupl delet exist base tupl deriv problem solv counter view tupl view tupl delet counter drop insert tupl join view perform join newli ad tupl join relat comput join relat scratch delet handl similar join delet tupl subtract origin view method combin spj view present count algorithm algorithm emphasi delet problemat count algorithm view negat aggreg function base counter method view languag gener tupl materi number altern deriv store count relev insert increment count relev delet decrement count count drop tupl store materi view algorithm work view tupl finit number deriv algorithm work gener view negat aggreg algorithm involv materi view manag basic ignor altern deriv put view tupl delet set invalid remov tupl delet set comput tupl insert view due insert base relat addit algorithm approach summar algebra approach increment view mainten present approach base semant argument base express bag algebra express repres materi view transact state set bag deriv delta express repres bag algebra express updat goal find minim set delta express proper handl duplic import comput aggreg function averag list correctli explor addit view materi optim increment mainten materi view gener idea maintain set view effici addit temporarili persist materi view approach involv materi common subexpress view mainten express multi queri optim algorithm mention approach section present select view materi view mainten data integr system main problem data integr system term increment view mainten mainten updat data sourc occur mainten integr system addit queri data sourc inform perform mainten data sourc continu chang time updat integr system mainten addit queri answer state data sourc time initi updat updat fix integr call state bug view mainten anomali problem stem fact mainten algorithm data integr system wai avoid state algorithm restrict updat view correct develop specif algorithm case algorithm case base usag condit hold state maintain correct algebra approach base bag semant chapter data integr servic minim view view inaccess queri mainten address problem lock algorithm concurr version materi view provid continu consist access mainten base view mainten algorithm algorithm briefli summar basi eca extra queri elimin anomali fact anomali occur view store copi base relat referenc option costli good option compar increment view mainten basic idea send queri data sourc avoid potenti anomali occur queri answer data sourc eagerli forc data sourc send correct inform anticip kind anomali occur prepar view mainten queri express addit view mainten express avoid anomali subsect discuss increment mainten process made effici updat filter updat data sourc updat materi view speed mainten process detect base data updat effect maintain updat call irrelev updat procedur prune irrelev updat mainten plan call updat filter call affect updat queri independ updat work area aim theoret defin suffici condit detect irrelev updat case delet modif defin irrelev updat updat oper appli base relat effect state deriv relat independ state reduc updat independ problem problem datalog program decid result case present practic algorithm detect irrelev updat view consid form queri select condit primari determin decid relev insert base substitut valu insert tupl select condit view select condit insert irrelev tupl insert view insert relev view substitut valu delet tupl select condit view select condit materi view manag delet irrelev tupl view delet satisfi boolean express assum boolean express conjunct inequ problem solv polynomi time gener disjunct add linear factor complex convent updat filter implement integr constraint trigger base relat decoupl deriv relat view definit system data integr filter integr system level data sourc perform filter awar view definit view speed mainten minim extern data sourc access mention maintain queri data sourc addit updat inform requir commun sourc exploit inform integr system avoid commun refer view maintain base data exist notion exact mean depend inform ideal case view updat perform local integr system base data updat view definit materi data addit techniqu minim base data access thing decid view achiev techniqu develop make investig singl view multipl view view isol note issu specif data integr system tradit inform context aim defin rule spj view algorithm highli depend view definit languag issu relat type kei inform exploit result sp view spj view join relat join join attribut kei spj view spj view chapter data integr servic model delet rule insert delet hold spj view updat involv predic view attribut explor similar condit gener view definit languag investig mean context show reduc problem decid queri techniqu make view local maintain view consid isol collect maintain integr system consid inform view extend materi view addit definit materi batch updat maintain updat oper save updat maintain amount work reduc updat oper delet tupl updat insert tupl updat effect state materi view consid auxiliari materi view materi addit view basic idea amount inform integr system level import point note remov situat anomali occur mainten total perform local integr system reason anomali addit queri data sourc time relat updat occur view addit queri dynam view manag state materi view manag import view select view mainten assum view materi select begin statist frequent queri base data updat frequenc select point system concentr mainten select view kind view manag call static view manag major problem approach queri workload materi view manag base data updat pattern view select invalid solut dynam view manag view select view mainten stage unifi queri workload continu monitor system view select updat dynam constraint consid addit chang workload pattern includ disk space mainten window mainten window import space system unavail queri mainten carri time window short number view longer mainten window materi speed queri process made chapter data integr servic conclud remark data integr servic import ingredi network data servic present opportun transpar access data sourc resid data sourc fact singl data sourc hide user fact data sourc present major problem build oper data integr system survei solut current data integr method research system mention chapter research prototyp appli techniqu system improv perform import point mention chapter standard issu develop repres commun data web easier standard extens markup languag xml similar standard effort wide data integr servic benefit heterogen data effect solut data integr amount avail data exist network grow speed bring data infer inform rise long data integr servic bibliographi knoblock queri process sim inform mediat advanc plan page aaai menlo ashish knoblock wrapper gener internet inform sourc ifci intern confer cooper inform system shen queri reformul dynam inform integr journal intellig inform system special issu intellig inform ullman gener effici plan queri view acm sigmod intern confer manag santa ashish optim inform mediat select materi data phd march larson updat deriv detect irrelev autonom comput updat transact system septemb concept support inform system integr confer weber feder inform terminolog architectur technic report berlin technic wm effici updat materi view acm sigmod intern bibliographi ferenc manag page borgida descript logic data manag ieee transact knowledg data octob chaudhuri dayal overview data wareh olap technolog sigmod algorithm defer view mainten acm sigmod intern confer manag page june de rosati descript logic framework inform integr principl knowledg page widom tsimmi integr heterogen inform sourc meet inform process societi japan page octob ross support multipl view mainten polici acm sigmod intern confer manag page june nardi unifi formal journal artifici intellig line inform extract world wide web juli basi schema integr confer inform system manag page levi probabilist inform data integr intern confer larg data base page august friedman optim data integr phd bibliographi mumick data integr view intern confer extend technolog page march griffin libkin increment mainten view duplic acm sigmod intern confer manag page san june gupta mumick materi applic data engin june gupta editor materi applic mit subrahmanian maintain view increment acm sigmod intern confer manag page widom system chapter inform integr prentic gupta select view materi data intern confer theori page januari hall negoti schema integr ai america confer inform august inform system integr commun transform conceptu data model object model intern confer conceptu model entiti relationship page vassalo wrapper tsimmi system workshop manag semistructur zhuge stanford data wareh project ieee bulletin technic data bibliographi feder architectur inform manag acm transact offic inform ullman implement data cube effici acm sigmod intern confer manag page june woelk carnot heterogen implement applic distribut parallel data wareh environ intern confer larg data base page august hull zhou framework support data integr materi virtual approach acm sigmod intern confer manag page weld adapt queri execut system data integr acm sigmod intern confer manag page june vassiliadi vassili fundament data springer hernandez system integr multipl heterogen intern confer data knowledg page srivastava inform manifold aaai symposium inform gather distribut heterogen kotidi roussopoulo dynam view manag system data acm sigmod intern confer manag page june doorenbo wrapper induct inform extract intl joint confer intellig page bibliographi levi combin artifici intellig data integr special issu artifici intellig recent trend develop springer levi techniqu data integr workshop artifici june levi answer queri survei submit litwin overview system acm nation page octob ordil queri heterogen inform sourc sourc descript intern confer larg data base page septemb levi sagiv queri independ updat intern confer larg data base page august subramanian logic foundat schema integr evolut heterogen system intern confer deduct page mitra algorithm answer queri effici view technic stanford septemb knoblock wrapper induct semistructur inform sourc confer automat learn discoveri sudarshan materi view select mainten optim submit march editor standard inform technolog industri chapter system page navath intellig integr heterogen inform sourc intern workshop bibliographi valduriez principl distribut chapter distribut dbm architectur prentic abiteboul object fusion mediat system intern confer larg septemb levi scalabl algorithm answer queri view intern confer larg data base page septemb quass widom view mainten acm sigmod intern confer manag page june rusinkiewicz al design implement system annual symposium parallel distribut sudarshan materi view mainten integr constraint trade space time acm sigmod intern confer manag page june naughton materi view select dataset intern confer larg data base page york august selli ghosh optim problem ieee transact knowledg data engin june sheth larson feder system manag heterogen autonom acm comput ward distribut heterogen intern confer data page ullman inform integr logic view intern confer theori page januari semant aspect heterogen bibliographi vassalo papakonstantin knowledg redund queri optim mediat workshop ai inform integr conjunct juli extens markup languag octob li algorithm materi view design data wareh environ intern confer larg data base page august widom view mainten wareh environ acm sigmod intern confer manag page san june
DB/765 3 real deduct languag mengchi liu depart comput scienc regina saskatchewan canada june abstract rol strongli type deduct languag integr import featur deduct structur languag present extens rol call support behavior objectori featur method encapsul real deduct languag support framework import featur object complex inform encapsul late class multipl structur behavior inherit con ict handl deduct system support featur pure framework deduct program languag introduct deduct import extens tradit technolog provid organ manipul structur object integr structur behavior part uniform framework lack declar queri logic foundat deduct er infer declar queri rm logic foundat lack power data model er deduct natur step overcom shortcom past number deduct languag iql live lattic datalog meth rock roll datalog rol structur import behavior featur method encapsul common system gemston iri objectstor objectstor odmg properli support live rol support encapsul datalog meth datalog method de ned rule encapsul method perform deduct updat signatur de ned method support signatur de ned semant involv method perform updat encapsul inherit transact model structur aspect transact logic model behavior aspect method updat support encapsul reason clear separ notion schema instanc gener method perform deduct updat encapsul method discuss inform spirit datalog fact rule action predic ldl speci object encapsul proper syntax semant framework de ned deduct languag structur behavior simpli provid kind incompat declar languag deduct imper languag data de nition complex task queri languag coral augment express access attribut invok rule imper program languag augment type construct rock roll er imper program languag rock languag roll unlik rock roll base singl underli data model er kind incompat declar languag deduct imper languag data de nition complex su er mismatch lack semant present extens rol call import featur rol incorpor featur support behavior featur method encapsul real deduct languag support framework import featur object complex inform encapsul late class multipl structur behavior inherit con ict handl deduct languag support featur pure framework paper organ section schema section discuss class hierarchi multipl inherit overrid block section describ object attribut section discuss queri updat section conclud paper paper major extens confer paper schema separ notion schema instanc schema consist set class de nition instanc consist set fact describ attribut de nition default class de nition class languag center object properti distinguish object valu physic conceptu entiti relationship real world model object object share common structur behavior properti classi ed class class denot collect object speci es structur behavior properti object structur part class consist set attribut de nition default valu attribut behavior part class consist set method de ned rule object collect denot class instanc class kind class distinguish oid functor tupl class set class class class class primit valu integ real number string prede ned ned attribut oper support valu void collect class denot xed string denot set real string repres void denot singleton set consist nil support subrang integ real charact charact string integr constraint attribut valu speci ed instanc class object integ oid class oid class denot collect oid identi repres individu oid class explicitli de ned class de introduc shortli oid part collect oid class denot ed vari time time insert delet oper section oid class concret abstract concret class direct instanc abstract abstract class organ class hierarchi functor class functor class denot collect functor object repres relationship real world entiti functor class form functor class class functor class explicitli de ned class de nition denot collect famili consist set person denot relationship supplier suppli part oid collect functor class denot ed vari time time insert delet oper tupl class tupl class denot collect tupl tupl class form attribut class call compon class street tupl class string compon class unlik oid functor tupl class explicitli de ned class de nition directli class de nition class collect tupl class denot depend collect compon class denot determin automat system set class set class denot collect homogen set set class form fcg call compon class set class person famili compon class tupl set class directli explicit class de nition long compon class de ned tupl collect set class denot depend collect compon class denot determin automat system support class object denot object instanc attribut de nition object attribut relat attribut applic instanc call instanc declar class instanc attribut de nition express attribut instanc speci es partial map class class attribut object default mean omit set tupl functor atom attribut number attribut de nition class combin person default gender default parent address street declar atom attribut attribut parent attribut address valu attribut gender object class default valu attribut address unknown attribut de nition constrain attribut valu instanc class kei featur program inform hide access attribut valu control access descriptor privat de ned attribut access method method class user directli queri omiss access descriptor public attribut access directli user queri method class privat ag privat salari attribut public attribut ag salari privat support partial complet set term provid di erent default valu attribut faculti default faculti default rst partial set faculti member partial partial phd addit faculti member fulli complet overrid default complet set faculti phd faculti attribut overrid default attribut class default class attribut introduc class class attribut descriptor class de ned attribut class attribut omiss instanc attribut class attribut de nition class attribut instanc speci es map object class object class person class default class count default rst attribut instanc attribut rest class attribut instanc instanc class attribut class class de ned attribut instanc access class attribut control access descriptor public privat default public public class directli access class public issu queri base queri queri combin attribut de nition method de nition object class attribut queri manipul method method manipul object call instanc de ned encapsul class de nition instanc method consist signatur implement fr class method de signatur speci es op argument class method result class simpli omit di erenti attribut signatur unari signatur attribut de access method control access descriptor public privat omiss access descriptor public public privat privat public method invok user directli queri method class privat method invok method de ned class intermedi result set fr rm form implement method rm rule rule ln head rule ln bodi rule kind rule queri rule updat rule queri rule speci es deduc return head bodi head rule invok instanc class bodi queri attribut valu object invoc queri rule invok queri rule invok bodi head directli indirectli rule rule call rule queri rule class rst rule person ps ps ag rule ps ps ancestor ps parent ps ps ancestor note rule de ned updat rule speci es updat chang instanc bodi rule head rule invok instanc class head return bodi queri attribut invoc queri updat command start insert invoc updat rule updat rule updat rule class person marri coupl divorc coupl delet delet insert insert rst rule ps ss make delet valu make condit updat rule sati proper error messag displai note variabl exampl denot instanc class person method invok note variabl rule logic variabl introduc renam chang mean support special variabl denot instanc class method invok similar refer program languag java occurr rule omit simplifi rule rule exampl simpli ed parent parent delet delet insert insert show complet person parent parent number method class combin program languag support method method method di erent signatur class method person method children rst method obtain children person unari obtain common children denot children overload method support class method manipul class class method class fr rm class method de rm rule simpli assum class person class attribut extens set instanc person class class person class extens comput averag ag instanc person invok instanc method set class shown class class method invok class issu queri base class de nition base class kind attribut de nition default method de nition encapsul kind inform class de nition class de nition class attribut de nition method de nition inherit speci cation discuss mean isa inherit speci cation section discuss section oid class abstract concret class descriptor abstract concret oid omit class uniqu class de class person default gender default parent address street class default parent parent delet delet insert insert class hierarchi inherit organ class class hierarchi class object top bottom direct de nition denot isa advantag multipl inherit kind properti inherit instanc inherit properti inherit subclass inherit instanc attribut de default instanc method direct superclass class attribut method inherit instanc inherit instanc subclass instanc superclass inherit properti subclass introduc addit attribut de default method local class de class isa person default delet salari insert salari direct subclass person inherit attribut de default method person instanc instanc person attribut de nition default method direct subclass omit object class de nition class person de ned di erent wai class person isa object class person inherit overrid block subclass overrid block attribut de default method inherit superclass class de nition class patient default smith class alcohol isa patient rst patient treat physician smith default physician smith physician time class de nition ad class de nition alcohol patient treat psychologist psychologist physician subclass alcohol introduc de nition attribut overrid attribut de nition default inherit patient show overrid default valu overrid attribut de nition class student isa person default gender default insert delet subclass student inherit attribut de default valu method person default valu gender overrid inherit attribut method enrol drop subclass inherit properti block inherit attribut method support class class de class isa person class inherit properti person marri divorc support method complet signatur overrid block attribut de nition default valu bound term subclass inherit attribut de nition inherit default attribut class attribut de nition overridden default block multipl inherit support multipl subclass direct subclass superclass inherit con ict happen class de class room class student room default class isa student direct subclass student inherit attribut method student con ict attribut room di erent wai con ict resolut ed prioriti default ed inherit path explicit renam ed prioriti order superclass class de nition superclass attribut de nition default valu method signatur directli de ned found class rst list inherit continu automat inherit attribut room student superclass method di erent inherit subclass method overload overrid support inherit con ict resolv overrid continu class inherit attribut de nition default room student chang order de nition student overrid inherit class isa student room default approach break connect attribut room student attribut room attribut de nition default room student ect altern inherit path select subclass inherit attribut de default method superclass di erent ed prioriti overrid meet demand discuss earlier solv user inherit path overrid ed prioriti inherit speci cation op op method signatur class class student method incom signatur di erent addit attribut room inherit attribut room method incom student class de class isa student student note class de inherit attribut de nition default room student method incom overload method inherit de nition explicit renam renam inherit attribut method class inherit speci cation op attribut class attribut method signatur abbrevi op method altern avoid con ict renam con ict attribut method inherit di erent continu work student di erent student previou altern disallow possibl explicit renam class isa student room attribut student di erent inherit con ict describ object attribut object class discuss section support ve kind functor tupl set valu valu directli ve kind integ real number charact charact string void nil oid oid string uniqu repres physic conceptu entiti oid belong class directli direct instanc class oid uniqu direct class due instanc oid indirectli belong class relat direct relationship direct class object speci cation form concret oid class oid person tom speci es oid tom direct instanc person functor object functor object repres relationship real world entiti functor object functor object functor object respect functor class instanc respect instanc supplier part respect tom pam instanc person functor object creat user explicitli object speci cation form infer method respect functor class tupl tupl complex valu identi ed tupl object partial set tupl respect tupl class instanc tupl instanc tupl class respect class street instanc street tupl directli set set complex valu identi ed set fo object set mean complet partial complet unknown order repres partial valu partial set ho object set fo partial set ho respect set class fcg instanc set instanc set class respect class partial set partial instanc set class respect class instanc pam tom instanc person instanc set directli object attribut instanc object attribut relat functor set attribut attribut valu object kind unknown partial set object speci cation object attribut object partial set speci es object partial object speci cation respect instanc attribut de nition instanc instanc partial instanc object speci cation form combin combin combin combin exampl object speci part citi supplier statu citi street instanc set object speci cation instanc person tom gender address street person gender address street person jim gender address street person ann gender address street bob parent salari pat parent salari student liz gender parent student joe gender parent sam gender parent object speci cation respect class de nition exampl consist schema instanc manufactur compani part base task test program languag schema abstract class part class isa part cost class compart isa part class fg instanc cost cost cost compart compart kind part base part composit part de ne class part abstract class attribut compart subclass part order express quantiti part manufactur composit tupl class de nition compart method comput base part manufactur composit part method comput assembl cost composit part part method de ned set class object instanc base part composit part made part queri queri queri queri ln ln queri express queri express includ attribut de nition object speci cation object class attribut variabl kind queri schema queri object queri schema queri schema queri retriev inform class schema queri roughli classi ed class attribut de nition default method queri class queri kind queri queri class subclass relationship queri isa object queri object queri isa queri isa person rst queri direct subclass class object subclass user de ned class direct superclass answer student subclass person answer attribut de nition queri kind queri retriev directli de ned inherit attribut de nition class queri queri persona queri queri ca rst queri class person attribut anonym variabl answer base class de nition attribut de nition person class bachelor attribut answer inherit block class attribut de ned person default queri support default attribut valu queri default queri default queri default queri persona default queri ca default person rst queri class person default attribut answer base class de nition class default attribut answer student base class de nition default attribut class person default attribut direct subclass person method queri method queri queri method signatur method implement method queri queri queri frg queri frg rst method signatur queri rest method implement queri rst queri class result method ag return method person class result implement method ag person implement unari method enrol student object queri object queri retriev inform object manipul object method invoc object queri roughli classi ed object class object attribut method invoc object class queri kind queri class inform object queri person bob queri bob queri bob queri rst queri class person direct class oid bob answer base section direct class bob answer direct class bob instanc answer person class direct instanc class object attribut queri kind queri attribut valu object queri queri queri person queri oa rst queri birth year tom answer birth year jim jim default return result direct instanc person person birth year gener queri object attribut valu method invoc method perform deduct updat invok object queri queri queri queri queri rst queri invok ag method liz invok ancestor method liz check jim element result invok method return liz invok marri method ann sam marri updat elementari updat command complex updat command insert ln delet ln ln queri express updat command treat transact succe fail ect updat command de ne manipul classi ed schema updat object updat schema updat user insert delet modifi class de nition schema updat class de nition creat insert command insert command insert class person default gender default parent address street class default insert class person parent parent exampl show delet modifi class de delet delet delet default delet delet student rst command delet directli de ned attribut person fail instanc attribut similar rst fail inherit block delet delet default gender class person oper fail class default delet method enrol student delet class student fail class instanc subclass class de nition object updat insert delet command creat destroi oid functor object assign delet attribut valu object combin insert delet modifi attribut valu note oid uniqu creat destroi modi ed direct instanc class exampl show creat oid functor insert person tom insert insert person insert rst command creat oid tom direct instanc person tom instanc oper fail note tom default valu person assign oid pam attribut tom tom attribut oper fail check rst respect class de nition person respect class de insert command creat oid jim assign attribut time default person overridden command creat functor object assign attribut quantiti exampl object delet delet delet bob delet insert rst command delet attribut bob delet pam bob parent set parent set complet set attribut oper complet set command delet bob direct class attribut valu pat salari combin queri updat command complex updat complex updat queri delet queri delet insert rst command make salari year deduct extens structur deduct languag rol unlik support pure framework import featur expect languag semant dynam part investig straightforward convert updat rule rol declar semant rol indirect semant static part partial implement top rol prototyp internet web page run sgi workstat compat machin implement complet languag progress version work direct semant extend edg program system ad addit function acknowledg author acknowledg contribut peopl particip implement rol min jun sun research support part natur scienc engin research council canada refer abiteboul cs santo ubiquit object intern workshop program lnc abiteboul pc kanellaki object ident queri languag primit acm sigmod intern confer manag page method rule acm sigmod intern confer manag page atkinson buneman type persist program languag acm comput bal deduct type languag intern confer deduct page lnc design implement rock deduct system inform bertino logic program languag intern confer extend page aj bonner kifer transact logic program intern confer logic page mit press borgida model class hierarchi contradict acm sigmod intern confer manag page stein gemston object manag system commun zicari integr data model program paradigm acm sigmod intern confer manag page editor object morgan cattel editor object odmg morgan deux al system commun topor declar procedur semant deduct objectori system journal intellig inform shan manag system acm tran oc inform sander live lattic rule languag data knowledg hm jamil implement abstract object inherit datalog neg intern confer larg data page morgan kaufmann kifer deduct object data quest integr intern confer deduct page lnc wu logic foundat languag journal kifer wu logic program complex object comput system won kim introduct mit objectstor system commun tw ling lee deduct system intern confer expert system applic page lnc liu guo real deduct languag intern confer conceptu model page nov lnc mengchi liu deduct object base languag inform mengchi liu deduct program languag intern symposium program logic program page septemb lnc mengchi liu overview object languag journal intellig inform mengchi liu incorpor method encapsul deduct languag intern confer expert system applic page august lnc mengchi liu overview deduct system intern confer technolog languag system usa santa august press lou ozsoyoglu deduct languag method method inherit acm sigmod intern confer manag page maier logic object technic report oregon graduat moss naqvi shalom tsur logic languag data knowledg base comput scienc seshadri implement coral deduct system acm sigmod intern confer manag page overview commerci manag sigmod sudarshan ad logic languag intern confer larg data page morgan kaufmann
HCI/766 4 virtual keyboard taylor grasp ci depart pennsylvania rm novemb abstract paper describ scheme human comput interact tradit input output keyboard replac augment realiti project system camera user input accomplish project imag interfac flat surfac scene monitor video camera scheme hing observ relationship surfac work virtual keyboard imag obtain project transform rp observ lead fast accur onlin calibr algorithm basic advantag vision base interact techniqu paper involv mechan input devic mice touch screen move part wire connect interfac surfac avoid physic instanti interfac gain level abstract exploit number wai firstli system design flexibl layout action user interfac softwar constrain fix mechan interfac flexibl custom interfac requir capabl individu user scheme amen miniatur interest applic field wearabl comput system thirdli scheme scale larg small flexibl match monitor base system restrict fix size industri human comput augment wearabl comput introduct paper describ scheme human comput interact tradit input output keyboard replac augment realiti project system camera figur show individu interact prototyp implement interfac system shown figur imag calcul project analyz imag screen acquir video camera system determin user indic virtual keyboard respond appropri scheme outlin schemat figur projector camera system act concert form feedback system user interact effect occlud part project imag system shown figur user present augment realiti displai imag virtual keyboard overlaid region interfac surfac user intent infer monitor imag obtain video camera basic advantag vision base interact techniqu paper involv mechan input devic mice touch screen move part wire connect interfac surfac avoid physic instanti interfac gain level abstract exploit number wai firstli system design flexibl layout action user interfac softwar constrain fix mechan interfac flexibl custom interfac requir capabl individu user scheme amen miniatur interest applic field wearabl comput system thirdli scheme scale larg small flexibl match monitor base system restrict fix size figur implement interfac scheme project system present imag interfac user user interact infer analyz imageri obtain video camera direct interfac surfac figur implement interfac scheme user present augment realiti displai control occlud portion interfac surfac work build idea krueger number human comput interfac includ fix camera observ action oper interpret intent system user observ background shadow obtain simpl background subtract composit imag interfac present user displai user control interfac simpli move shadow screen wellner describ similar system call digit desk project system project imag interfac work surfac monitor overhead camera video imageri obtain camera analyz comput correl signal obtain microphon mount tabl determin user touch interfac element displai paper describ techniqu comput vision augment realiti emploi develop human comput interfac significantli greater function unlik vision base interfac scheme mention exploit fact relationship surfac work virtual keyboard imag obtain project transform rp observ lead fast accur onlin calibr algorithm avail onlin calibr scheme open augment realiti displai shown figur imag interfac composit video imageri situat calibr system relationship camera interfac surfac occur camera interfac surfac move describ commonli graphic expedit imag manipul oper requir interfac scheme perform achiev standard pc fuch describ vision offic futur equip multipl camera projector system achiev spatial user interfac describ techniqu implement multi displai acquir inform structur environ structur light stereo techniqu work extend research virtual realiti system exemplifi cave system interfac scheme paper emploi system effect interact user comput system colleagu xerox parc develop whiteboard scan system call system interpret mark whiteboard check mark button limit rang gestur made user work explor displai system provid feedback user interact larg grow bodi literatur devot problem track human motion video imageri includ recent work automat interpret sign languag comput paper address problem interpret user motion space restrict attent monitor user interact surfac drastic simplifi imag analysi problem solv describ human comput interfac scheme project system project imag interfac work surfac user interact surfac detect monitor electromagnet field work surfac field sensor goal work present paper develop pure interfac scheme rest paper organ section describ prototyp implement interfac scheme section discuss detail advantag applic interfac scheme final section present drawn work implement section describ prototyp implement interact system system project system displai imag interfac user system augment realiti displai projector base system frame grabber graphic system comput projector video camera interfac surfac figur schemat diagram compon projector base interfac scheme shown figur setup prototyp implement consist standard person comput projector attach output port imag captur system figur show block diagram comput system underli projector base user interfac scheme left half figur show imag calcul interfac store frame buffer project screen half show imag screen acquir video camera coordin frame refer attach frame imag buffer interfac surfac usual manner figur left half figur show frame buffer imag virtual keyboard project interfac surfac side show imag interfac surfac acquir video camera system infer user intent analyz pattern video imag interfac surfac projector camera correct project virtual keyboard imag rectifi imag detect user interact updat interfac figur block diagram projector base interfac system interfac scheme hing observ relationship coordin point frame refer express elegantli basic project geometri definit coordin point frame coordin imag relat project transform relationship express algebra sf frame buffer imag buffer interfac surfac figur project transform relat point virtual interfac surfac imag buffer sf project transform relat posit point screen coordin project video conclud relationship point frame buffer correspond imag buffer express sf project transform complet oper set point constitut project basi relev project space case real project plane rp suggest straightforward calibr scheme determin map frame imag buffer simpli distinguish point frame buffer locat correspond imag buffer project transform comput point correspond straightforward manner standard techniqu descript accomplish includ note project transform comput apriori knowledg paramet camera geometr relationship interfac surfac camera system made calibr automat project fix pattern screen recogn local imageri acquir video camera fiduci mark interfac surfac comput project transform imag buffer interfac surfac similar manner project transform appli correct project virtual keyboard properli align interfac surfac opengl graphic correct implement effici manipul project view matric appropri estim project transform frame buffer imag interfac imag buffer appli project video imageri obtain camera project accomplish util textur map capabl modern graphic system program perform arbitrari project transform imag buffer frame rate burden system cpu imag rectifi system detect user interact surfac analyz differ imag virtual keyboard frame buffer rectifi imag calibr system construct map color intens valu project interfac surfac color intens measur camera system map system determin pixel rectifi imag differ significantli expect color intens end result analysi binari imag pixel differ significantli expect valu mark special case static interfac button element chang binari imag construct simpli comput differ current imag fix background imag binari imag construct system interpret user intent analyz pattern imag virtual calcul system shown figur virtual kei implement divid region shown figur detect central region suffici occlud region left untouch scheme system disambigu case user reach kei point case region virtual kei user reach fulli partial occlud scheme analyz pattern imag discern user intent draw program simpli track occlud point imag point interact distinguish desir undesir instanti button user occlud hand posit desir locat prototyp implement implicit assumpt intens video imag due user interact case environ ambient light cast shadow time limit amelior emploi sophist chang detect algorithm distinguish imag due user unintent variat system made adapt ambient light condit emploi cue shape motion improv detect user hand posit challeng problem occur system face ambigu pattern difficult implement standard style keyboard touch type scheme difficult distinguish situat finger hover kei situat occur sole basi imageri acquir monocular camera system problem avoid redesign interfac slight motion finger cover uncov part augment realiti system block diagram augment realiti system shown figur provid figur system similar scheme previou subsect major differ projector replac augment realiti displai differ scheme system relationship camera interfac surfac chang time mean imag video sequenc system recomput project transform interfac surfac imag buffer accomplish track posit set fiduci mark interfac surfac video imageri perform interfac surfac frame grabber imag buffer track fiduci estim project transform project detect user inter updat interfac imag interfac rectifi imag composit imag augment realiti displai project transform figur block diagram augment realiti interfac system comput appendix project transform calcul produc augment realiti displai imag virtual keyboard video imag interfac correct posit video imag techniqu detail figur show imag acquir video camera augment realiti displai produc system figur row figur correspond imag obtain video camera row figur correspond augment realiti displai present user user select shape displai button project transform appli project region video imageri correspond interfac surfac rectifi imag analyz determin user interact note task comput binari imag portion interfac occlud simpl amount locat dark object lighter background task reach modern comput vision techniqu binari imag comput user intent infer analyz pattern prototyp system shown system detect shape occlud displai pattern select box applic basic advantag vision base interact techniqu paper involv mechan input devic mice touch screen mean move part wire connect interfac surfac avoid physic instanti interfac gain level abstract exploit number wai graphic user interfac program present number interfac scheme user reconfigur interfac arbitrarili posit layout interfac element chang softwar reflect individu tast interfac emploi task gui present program characterist interfac scheme make individu special interfac easili tailor suit capabl individu user exploit develop interfac user suffer repetit stress disord tunnel syndrom result inflex arrang standard interfac devic interfac scheme reli mechan input devic amen miniatur intrigu applic interfac technolog wearabl comput system mann starner picard augment realiti displai section implement head mount displai pair glass miniatur camera mount glass video imageri close approxim user viewpoint interfac surfac simpl sheet shown figur pattern fiduci mark readili recogn track video imageri user present interfac comput shown figur interfac surfac virtual keyboard regist interfac surfac creat physic interfac advantag scheme entir system headset elimin bulki keyboard displai system mean comput miniatur size cellular telephon advantag modul light input mechan scheme essenti scale independ projector base scheme section interfac made larg small simpli chang rel posit projector interfac surfac system place interfac sheet surfac draft tabl entir wall capabl virtual realiti environ design place interfac element conveni surfac environ virtual light switch project virtual telephon project tabl top virtual displai project desktop intrigu possibl interfac scheme present abil leverag bandwidth video signal implement sophist interfac tradit keyboard typic comput keyboard order kei transmit comput time singl video imag order quarter million pixel intens measur acquir parallel approach exploit bandwidth design interfac user select larg varieti symbol occlud combin region interfac simpl implement virtual keyboard kei region finger user select symbol cover uncov combin kei similar interfac present keyboard organ musician invok wide rang sound depress set kei scheme person limit rang motion subtl variat pattern virtual keyboard small motion index vocabulari thousand symbol vision base human comput interact scheme present user intent occlud portion interfac surfac prototyp system develop standard comput project system present augment realiti displai user scheme hing observ relationship surfac virtual interfac surfac imag acquir camera repres project transform rp observ lead fast accur calibr algorithm significantli improv practic applic interfac scheme interfac scheme offer number advantag tradit approach avoid mechan interfac significantli flexibl interfac design behavior interfac custom softwar suit abil individu user scheme amen miniatur make attract appli techniqu wearabl comput premium size weight lead fulli function comput sophist interfac capabl carri pocket comput project transform point correspond denot homogen coordin project point form project basi rp construct project transform repres matrix map standard project basi matrix properti set point construct project map construct project transform map standard basi transform refer rt azuma survei augment realiti virtual taylor digit overview aaai spring symposium intellig page march mj ju recogn human motion model optic flow shah ramesh page kluwer academ carolina daniel thoma virtual design implement cave olivi faugera comput vision mit analysi gestur action technic talk video index proc ieee conf comp vision patt page june krueger artifici realiti krueger make real world virtual commun juli augment realiti ieee transact visual comput wendi gill kathi daniel augment ad comput dimens paper commun juli steve mann seek commun technolog pentland smart room scientif picard coupl august picard healei affect wearabl person decemb matt greg wolfgang effici imag gener displai render techniqu eurograph render june greg matt adam lev henri fuch offic unifi approach model spatial displai joshua tom christoph david joseph neil electr field graphic interfac ieee comput graphic thad joshua alex pentland american sign languag recognit desk wearabl video ieee tran pattern anal machin decemb vogler metaxa asl recognit base coupl hmm motion analysi intern confer comput pierr wellner interact paper digit desk commun juli
HCI/767 4 adapt adapt inform provis includ disabl elderli peopl alfr kobsa gmd fit german nation research center inform technolog interact research sankt germani andrea schloss germani due tremend popular hypermedia lead onlin inform medium year standard gatewai citizen visitor web site gener heterogen futur aim project cater hypermedia inform individu adapt content present web page individu user special elderli disabl user partli consid model characterist user individu user usag domain model exploit adapt process aim research verifi adapt user model techniqu hitherto cater interact softwar system user prove adapt user special origin aspect develop user model server concurr accommod user model applic instanc applic distribut comput environ adapt disabl user user model server research partli fund european commiss act programm anonym review valuabl assist prepar paper introduct aim project develop evalu distribut inform system hypermedia inform metropolitan area public varieti user travel agenc elderli blind user form abil system access world wide web peopl travel public inform kiosk hardwar softwar network surround anticip order cater user usag exploit method tool develop context adapt adapt system year intern model user individu usag domain model adapt content present user individu exist adapt adapt system consid user cognit abil recent peopl special disabl opportun advantag inform inform increasingli relev public place home access inform hypermedia form import standard gatewai electron inform entertain comput access peopl special research issu year effort put make softwar system usabl peopl origin design access graphic user interfac visual manual impair develop dedic inform disabl inform access public verbal descript paint major supplement data collect peopl special account solut restrict small popul disabl user fairli due small number potenti custom techniqu adapt gener interact softwar system individu user group emploi tailor softwar system disabl elderli peopl approach theoret econom viabl isol dedic solut user investig user hypermedia inform system report carri context interview citizen peopl type disabl show heterogen inform system cater individu differ rang circa result muscl impair muscl user encount exampl illustr point discuss remaind blind modal present inform chang tactil audio output supplementari orient navig addit tabl content intern extern link hypermedia user group detail inform access build exist dimens ramp type width import automat provid inform redund user omit user interest specif detail inform inform histori import build user lack specif inform present order lower effort build mental model current hypermedia page comput usag instruct augment explan experienc comput user user network access slow inform high data volum replac order reduc download time time hypermedia system extrem critic usabl point view address singl user requir scope adapt adapt order cater user inform system tailor manual system design possibl automat system system user chang system adapt behavior call adapt system adapt user automat base monitor user interact runtim call adapt adapt provid system adapt adapt user interfac includ special devic macro speech visual interfac interact techniqu adapt adapt hypermedia page includ adapt inform inform inform orient navig link hypermedia page group adapt aim enabl improv access inform group adapt person specif hypermedia system rest paper focu goal approach complement exist solut provid access www includ user disabl overview system architectur give overview princip compon interact compon central aim paper detail subsequ section main compon system fig multimedia inform domain modal includ restrict data model content model multimedia interfac access inform transpar adapt gener hypermedia document descript inform resourc control structur repositori gener web page includ process rule link entri irc page encod extens html user model server host model user user interfac present hypermedia inform fig architectur fig basic interact compon number refer user request hypermedia page user interfac ui forward request adapt fetch request hypermedia page irc gener page static irc page option altern hypermedia object group hypermedia object layout page process option altern element control adapt inform system compon assumpt user characterist user model inform multimedia object content model inform current user session request irc provid option element supplementari inform access exampl altern element gener detail pictur paint textual descript usag model group rule irc page user model construct rule control format primari assumpt user assumpt directli deriv user interact hypermedia primari assumpt directli report um interpret request hypermedia page adapt gener adapt page compliant standard hand user interfac present ui interpret hypermedia retriev multimedia object transpar final present request hypermedia page user commun activ compon carri http protocol top restrict slightli enhanc version kqml queri manipul languag commun languag protocol independ hardwar softwar commun um main advantag architectur exist softwar area www commun web develop develop compon www browser todai access system advantag individu featur content level compon distribut organiz technic requir technic motiv affect user mobil user model user model server locat system user access system um princip compon architectur start develop emploi softwar includ appl corp um user usag model order provid user model maintain system assumpt relev characterist individu includ point ui perform addit adapt altern visual interfac object interact discuss architectur similar spirit similar reason interest interest access inform build avail ramp detail inform histori prefer inform modal domain knowledg promin refer bridg infrastructur metropolitan area compet handl abil manipul interfac element wimp interfac achiev desir compet handl user knowledg orient navig aid adapt mechan method acquir assumpt user discuss literatur assumpt acquir base sourc initi interview acquisit primari assumpt user valuabl sourc inform initi assign user user subgroup base primari assumpt user addit inform applic system draw infer order acquir assumpt user user request detail inform histori assum interest detail inform henceforth automat provid stereotyp assumpt interest characterist user subgroup presum knowledg domain expert presum interest precondit stereotyp activ specif mean assumpt stereotyp assign user briefli present user model servic offer user model server describ user model architectur inform system citi itali compon offer layer model characterist individu user user group layer repres content assumpt conceptu knowledg languag fit paradigm outer partit collect type assumpt user user group order inherit subordin partit inherit content fig user model siena inform system fig show partit hierarchi system citi siena model individu user consist believ user assumpt user assumpt user interest believ user assumpt user assumpt user partit belong stereotyp part user model top partit repres interest knowledg stereotyp left side stereotyp hierarchi partit interest user blind user origin respect handicap interest inform avail ramp partit stereotyp assumpt knowledg novic expert system citi siena dash line fig exemplifi dynam inherit relationship individu user model stereotyp stereotyp inherit link activ retract stereotyp manag user model server basi set rule period execut simpl activ rule user model server user check item low initi activ interest stereotyp activ stereotyp interest inherit partit inherit place specif assumpt negat time interest inherit posit interest stereotyp similar inherit partit side stereotyp hierarchi order adapt usag usag model maintain system inform relev aspect user system usag user interfac provid altern task structur specif physic sensori abil current user network time bandwidth inform physic environ specif termin function specif type user inform usag model extract hypermedia page request http protocol exampl includ http header field type user interfac initi length html option test commun interest system read distanc provid satisfactori solut initi adapt visual interfac hardwar blind user page ui addit sourc inform estim time user point view network probe inject dummi imag begin end hypermedia page base estim time store usag technic motiv adapt appli user access inform pictur video replac user model server user model resid user model server princip reason includ central manag inform offer ui access recent inform effect respect inform exploit ui advantag assumpt acquir vice ui total reliev user model task advantag sophist servic um increment construct user model base primari assumpt dialog act infer secondari base primari set typic assumpt user group basi activ deactiv consist mainten chosen basi um scalabl function put paradigm user model develop terminolog logic emploi order predic logic modal logic ad enhanc inferenti capabl user model flexibl manag stereotyp support includ wide rang activ deactiv rule kind user inform store effici retriev emploi infer substanti enhanc order establish user model servic prototyp um made offer addit featur comparison access servic restrict slightli enhanc version kqml chosen implement applic programm interfac substanti special emphasi paid servic ui dynam locat access um host model user support host model user time simultan support modal oper repres assumpt type user model avail common lisp recent version port cmu common lisp sun workstat common lisp window framework privaci secur architectur develop user model system implement field trial model individu user user group stereotyp activ deactiv rule infer rule section adapt adapt exampl page adapt order adapt irc page assumpt store page descript inform option inform altern depend user usag system present option inform benefici inform altern select process control adapt rule part hypermedia page adapt automat perform system control user adapt term enabl user modifi select provid inform system choic input user includ feedback adapt initi navig behavior exploit updat user model user model construct rule rule part hypermedia page fig expert user adapt tabl fig expert user tabl modifi user fig netscap novic user gener inform inform system citi siena hypermedia inform includ special inform peopl disabl fig show page system describ adapt irc page detail page fig inform facil amen accommod hotel page separ column left column background main menu middl column inform servic offer column includ menu button point relev inform present page tailor user experienc comput system special inform peopl initi questionnair option navig path displai upper left corner experienc web user usag requir mental model hypermedia space hand navig aid offer web novic restrict hierarch siena menu left fig user altern navig element hypermedia page hand icon point link lower corner point inform interest current user assumpt acquir system infer mechan base navig histori user request detail inform cook style assum interest restaur option element button toolbar browser upper corner fig button button circl fig avail button user button press fig user automat obtain addit inform select user group addit inform peopl difficulti walk button design peopl inform behalf disabl person travel agenc clerk custom work system technic point button activ deactiv stereotyp button switch report respect kei concept negat um insert partit base stereotyp manag rule activ deactiv stereotyp tabl present user attribut system deem relev current user model user modifi attribut select request adapt version tabl includ attribut fig show adapt version user button fig part page descript includ browser html parser process page behav web access commerci browser extra button remain html page fig deselect attribut subsequ confirm deselect base system displai attribut anymor fig make assumpt user interest report um user interest inform relat um updat individu user model insert relat concept possibl activ deactiv stereotyp conflict assumpt stereotyp lower prioriti directli obtain interact user contradict individu user model activ stereotyp user interest stereotyp stereotyp candid fig system encourag user reconsid interest peopl due attribut select fig user confirm interest interest stereotyp deactiv confirm user retract stereotyp impact content hypermedia link user user confirm system assumpt fig attribut share displai button lead specif inform disabl peopl activ button switch system base user answer initi interview siena system automat present gener inform fig user request detail altern descript press button user request detail gener descript refin user model user request detail inform histori assum interest concept insert individu user model partit author environ irc page closer intern structur irc page written option link irc page base develop environ appl comput fig show author environ includ small part irc page visual fig background window fig show graphic irc element correspond column final page layout fig left column background show part main column present part column circl option element link inform studi foreground window fig show function content present part window column upper part present categori applic resourc categori web compon list column irc page repres compon html templat file specifi content layout irc page html tag defin format static dynam page content dynam page content mark special tag refer function compon defin current irc page declar file defin map tag html templat function script file implement applic behavior specif compon script file manag dynam page gener respond user request written script languag subset languag script file belong compon resourc store separ file call concentr correspond fragment develop environ hypermedia counterpart process fig link lower corner user assum interest inform disabl peopl intern structur option element assign adapt rule present fig circl part background window show element graphic inform detail compon file displai editor foreground window outer syntact element graphic pane open close question condit call hyperlink refer page open close chain imag text open close star open close symbol templat file html tag map tag condit element session method found declar file find implement queri user model object user interest inform disabl peopl current user interest inform method check kei concept partit individu user model access user model establish user model object encapsul complex kqml protocol issu level abstract provid hypermedia author user model host remot user model imag depend languag select user html imag tag altern text gener dynam compon manag imag select languag emploi irc page reusabl regard build block dynam part irc page reusabl compon serv build block reusabl compon addit reusabl compon develop reusabl function provid method object defin method mention irc page develop advantag class compon irc author provid level lowlevel code omit enhanc encapsul underli develop compat exist upcom standard html preserv subsystem behav web server adapt user interfac level adapt place level hypermedia user interfac level true select input output devic behavior number user interfac element type adapt perform user interfac detail give modal navig element adapt blind peopl page descript level fig present map citi siena includ interest place hotel siena map access button upper left corner page fig page blind peopl present fig visual map siena overview locat user figur visual impair adapt hypermedia system aha emploi gener web page altern option aha engin transfer web browser system lack graphic edit environ develop environ adapt opportun turn arbitrari part irc page reusabl compon author layout dynam behavior html import differ scalabl commerci transpar dispatch incom page request locat network comput number user necessarili time system label present web novic fig omit experienc web user fig textual descript import locat rel del central squar siena provid overview page short separ categori addit element top page blind peopl blind skim page short summari suffici inform decid page relev evalu system extens evalu site scenario section summar evalu result report common question share experi develop system benefici specif technic feasibl end user introduc adapt adapt inform content user interfac hypermedia inform system trial carri experi siena perform citizen includ peopl motor disabl test site siena school public inform point multimedia citizen travel agenc laboratori case studi blind user perform cnr subject receiv task plan trip plan attend music festiv plan town plan field studi floor uncov plan group tour peopl mobil impair travel agenc clerk experi finland carri random visitor tourist stage busi travel travel agenc clerk subject task consist book vacat tourist oneself client trial itali conduct visual impair user user visual impair citizen rome task includ inform dei st peter search locat direct system adapt featur adapt featur user subject usabl test procedur determin system effici user satisfact specif contribut adapt adapt data collect questionnair analysi log file select find altern descript graphic html compulsori defin irc page approach realiz system creat link top page facilit explor long page paragraph refer adapt featur individu differ user includ repeat user understand adapt featur adapt featur recogn understood frequent expert adapt comput web expert path navig user gener satisfi inform provid system attitud user found system properli design inform access clear mobil appreci level detail reach system enthusiast user easili find inform kind inform present concept mobil differ impair user properli reflect system shortcut frequent visit page automat pop index frame web page user notic understand mean felt featur system travel agenc clerk appreci possibl creat shortcut addit access button button gener correctli frequent result adapt featur gener appreci benefit inform system li user satisfact effici gain error reduct difficult measur repres successor project expect gain insight person tourist domain evalu hip museum guid portabl system adapt inform base current locat visitor presum interest infer navig path museum summari adapt adapt hypermedia inform system present cater kind disabl user hypermedia system import medium plai role gatewai electron inform servic domest environ result show extend current adapt adapt mechan user differ compar user session system cognit abil technic environ account technic feasibl appreci user approach provid post access handicap user group system origin design refer home page english error syntact user model base principl score intern confer user access voic input page interest predict sixth intern confer user model dynam model keyboard support user motor disabl sixth intern confer user model user model error spell checker user sixth intern confer user model user group requir web access blind visual impair comput user technolog educ visual handicap acm june introduct survei ieee septemb art navig hypertext commun vol lernen mit im hmd theori und praxi der usabl engin san academ press adapt user support ergonom design manual automat adapt softwar lawrenc erlbaum develop dual user interfac integr blind sight homer uim confer human factor comput adapt adapt user interfac disabl user project intellig servic technolog ubiquit telecom servic method techniqu adapt hypermedia user model interact model inform multimedia db world wide web consortium hypertext markup languag specif kqml languag standard perform commun applic user model system adapt case studi custom hypermedia issu appl object user model shell user model interact reason user model shell system user model interact acquir user model artifici intellig review user model acquisit heurist base dialogu act intern workshop design cooper user model stereotyp cognit util compon knowledg workbench principl semant explor knowledg san morgan kaufmann overview knowledg system cognit scienc report rule request standard track de measur user motiv server log file microsoft confer web empir franz cl window cmu common lisp user manual school comput person hypermedia inform adapt adapt system user privaci secur issu intellig servic technolog cooper competit berlin state art adapt user interfac adapt user principl practic north de open adapt hypermedia architectur issu result itali global evalu experi adapt support mobil museum guid interact applic mobil comput germani physic adapt present user situat context issu fig architectur fig partit hierarchi user user blind user comput novic novic siena novic user comput expert expert siena expert user fig expert user adapt tabl fig expert user tabl modifi user fig netscap novic user gener inform fig develop irc page develop environ fig siena map graphic form fig blind peopl
Agents/768 1 autonom robot symbol recognit artifici emot attend aaai confer francoi jonathan domin luc catherin serg research laboratori mobil robot intellig system depart electr comput engin universit de abstract paper describ approach design autonom robot aaai mobil robot make robot attend nation confer ai goal simplifi version integr methodolog develop research project conduct laboratori origin contribut symbol recognit techniqu make robot read artifici emot express state robot accomplish touch screen charg station robot recharg aspect influenc step robot complet task introduct young research laboratori interest design autonom system assist human real life task robot sort intellig give abil interact type agent robot deal real life set research project underwai studi aspect relat social abil read symbol deriv indic artifici emot monitor progress accomplish goal intent robot develop interfac touch screen displai emot state robot receiv instruct person develop charg station robot recharg capabl long group experi prepar integr approach fit aaai robot explain interest event strategi imagin sign guid robot move recogn possibl recharg confer room give short present html experi copyright american associ artifici intellig reserv paper describ robot platform detail strategi architectur methodolog symbol recognit concept artifici emot interfac develop paper present experi extens design figur pioneer robot particip mobil robot challeng robot shown charg station dock recharg robot platform devic pioneer robot indoor outdoor model robot equip camera frame rf connect pentium mhz onboard comput program environ develop tool control system robot mobil robot challeng indoor shown figur charg station shown figur station emit infrar signal detect ring figur charg station infrar receiv locat back visibl figur robot dock charg station back charg pin locat infrar ring make contact charg station charg station design adapt amount current gener recharg batteri fast figur back show infrar ring sign locat front robot symbol recogniz robot strategi implement mobil robot challeng goal attempt simplifi version task phase strategi registr assum robot start front door confer sign direct registr desk left arrow robot turn direct arrow continu arrow robot registr line identifi symbol robot wait line follow person arriv front line robot start search registr identifi instruct present enter touch screen registr symbol encount consid robot long find registr robot guid registr line mechan wait line elev step locat identifi letter symbol consid phase robot find elev robot guid elev person symbol robot assum elev door robot turn wait front open door door robot enter back make floor told time leav elev robot leav continu direct free obstacl time robot confer room track import peopl badg person interact touch screen snapshot person html report imag base posit arm face deriv skin tone guard time robot guard area make request touch screen robot stop track peopl base skin color snapshot navig confer room robot believ time assign confer start follow direct arrow sign room number find room turn direct assum posit door wait told turn present present turn robot start charg make present charg symbol infrar ring find charg robot make turn back perceiv infrar ring robot snapshot audienc gener html report describ experienc journei note robot execut command symbol posit rel symbol base posit camera sonar read robot decid find charg station instanc amount energi anytim phase explain imag symbol recognit memor html report messag describ step made robot softwar architectur design base hybrid architectur methodolog michaud vu combin properti intellig reason preserv underli principl architectur shown figur built top behavior connect sensori inform command behavior select dynam influenc implicit condit determin sensori hierarch organ goal robot reason ration modul knowledg innat acquir task note inform exchang ration modul behavior process modul run independ parallel deriv behavior recommend behavior ensur emerg preserv select behavior behavior select modul simpli activ behavior desir undesir motiv manag robot emot monitor accomplish goal robot time import sourc inform motiv observ effect serv abstract robot interact environ influenc relat link call activ behavior control sensori condit monitor arbitr mechan coordin robot behavior activ behavior exploit command control robot figur show organ behavior subsumpt arbitr fifteen behavior activ intent make robot move forward collid track object specif control camera captur face arm make robot follow robot find charg pid symbol specif color surround color zoom maximum resolut symbol make robot follow object direct chang posit robot specif command gener ration recharg make figur softwar architectur robot robot dock charg avoid make robot move move robot posit turn robot direct free backup make robot move rest stop control touch screen interfac behavior control veloc rotat camera note behavior pure intern influenc emot ration provid inform ration modul figur behavior control robot goal robot registr manag intern activ variabl call motiv vu work motiv system breazeal shown good balanc plan reactiv achiev intern variabl activ inhibit factor similar approach motiv motiv goal robot activ level motiv modul architectur affect behavior robot motiv energi level map function determin activ level energi level activ level motiv rang energi level influenc sensori exploit behavior activ ration time energi level comput equat em repres influenc weight affect motiv factor occur long period time influenc motiv entir habitu function modul influenc map directli determin threshold trigger energi level motiv motiv decid long recharg distress monitor robot move interact peopl time motiv base plan state order evalu progress accomplish state distress motiv make effici observ behavior exploit time long exploit avoid sign robot difficulti move freeli environ influenc modul motiv priorit theori social accomplish behavior implicit modul continu recommend activ make robot wander safe respond command symbol detect plan interact user modul deriv recommend base recharg distress backup rest depend activ level ration modul determin behavior recommend base phase robot explain strategi transit plan state deriv symbol situat perceiv input touch screen modul manag robot sign perceiv accept symbol current plan state robot search registr line symbol ration modul evalu command robot posit send command direct chang plan state reflect robot wait line regist symbol recognit social interact heterogen group robot human vision interest commun inform environ cooper robot real life find kind sign find room exit provid inform environ research activ involv handwritten print symbol recognit time thought interest give capabl mobil robot make robot recogn print sign interest idea method share type long vision system inform access electron media deriv inform environ symbol recognit techniqu imag segment robot featur extract color segment symbol identif artifici neural network imag segment achiev color commod hardwar veloso recogniz symbol assum pixel color repres symbol connect avoid recombin boundari box robot posit phase consist stop robot camera imag maximum resolut symbol perceiv locat black orang previou figur actual imag readi robot identif phase part imag delimit orang region scale imag symbol identif standard backpropag neural network design neural robot gather imag train set test symbol recogn robot ensur imag reflect correctli condit robot perceiv symbol network differ number hidden unit major vote determin symbol correctli recogn extens test justifi design choic show robust neural network figur snapshot imag detect symbol artifici emot concept artifici emot increasingli design autonom robot make robot respond situat experienc world interact human breazeal plai import role solv call problem adapt ident tempor artifici emot requir relat limit durat individu life artifici emot robot manag limit interact interact social establish share mean interperson commun al goal research conduct shown figur emot capabl incorpor control architectur global background emot influenc influenc architectur modul goal deriv emot model gener specif configur task mechan deriv emot state goal pursu robot make direct connect emot pain event robot collid case make contact object desir cognit approach explicitli influenc consid specif condit research complement research work artifici interest find model emot influenc specif state condit energi level motiv abstract progress accomplish goal activ motiv monitor energi level motiv make approach emot context motiv activ prioriti explain motiv repres plan state accomplish challeng emot chang paramet chang robot stimulu chang goal pursu robot relat research conduct oatlei indic emot provid biolog solut problem transit plan system multipl goal unpredict maintain transit commun model bipolar joi anger posit sad fear neg emot joi monitor energi indic accomplish goal motiv robot energi level gener emot sad monitor energi indic difficult progress accomplish goal motiv high level emot suggest robot unabl accomplish deactiv motiv question robot registr line symbol eventu emot make robot prompt person find registr line anger monitor oscil energi indic difficult progress accomplish goal motiv emot chang behavior backup react modifi veloc command fear monitor constant energi indic progress accomplish goal motiv emot speed gener chanc pick infrar read robot pass front charg station influenc analysi motiv energi level base amount energi level prioriti motiv note exclud possibl direct influenc reli analysi energi level motiv studi gener mechan benefit robot make situat environ accomplish goal challeng provid good setup emot plai critic part accomplish task role import long experi involv group robot valid concept relat social robot experi prepar fall interact interact instal touch screen monitor top shown figur touch screen monitor gener simpl facial express monitor emot state interact peopl menu screen figur face express emot state robot face repres figur gener facial inspir al orient size mouth determin eyebrow color face determin base comparison amplitud group big result color face face green posit size ey posit camera interact behavior program touch screen face displai make robot stop figur show option made make robot guard specif main control panel main control panel shown figur chang state facilit debug part strategi figur illustr type displai gener robot receiv specif input plan state group plan gener sequenc messag receiv instruct present registr desk figur show displai gener robot interact peopl robot continu move displai messag touch screen figur menu displai touch screen result approach challeng result integr research project laboratori project symbol recognit artifici emot start month mobil robot interfac project start month event preliminari design process requir modul softwar architectur complet end leav month implement test hardest part reveal adjust influenc factor requir lot fine tune difficult imposs make adjust code confer phase strategi work correctli made success test exhibit constrain area constant illumin condit ran complet trial convent peopl actual set elev confer room observ made robot identifi symbol correctli real life set identif perform imag symbol identif identifi symbol incorrectli identifi rememb symbol challeng arrow charg letter number difficult part adjust color segment orang black illumin condit convent area illumin entranc dark superposit color region local symbol gave robust difficult find figur main control panel chang state robot color segment work illumin condit case slightli chang vertic angl symbol illumin robot elev guidelin strategi physic limit robot elev autonom satisfi strategi enter leav elev reveal adequ limit amount knowledg exploit robot long time make robot phase challeng compar human instanc depend amount symbol encount place interact peopl minut robot entranc convent center registr desk note robot symbol direct indic minut robot guid symbol elev time requir robot phase challeng direct impact energi level robot trial hour half color adjust inevit robot recharg charg station reveal greatli valuabl abil robot autonom decid recharg fine tune approach robot suddenli start back expect read understand robot charg station back recharg figur messag displai robot arriv registr desk approach posit camera imag face upper bodi person arm leg behavior rapidli implement test trial convent center satisfi robot perform correspond design actual html report trial convent center web particip mobil robot goal design autonom robot capabl simplifi version entir task reach goal robot interpret print symbol inform interact peopl visual cue badg color skin touch screen menu facial express emot state memor inform html recharg found integr capabl real robot autonom make accomplish run hour debug main consol panel html report integr mechan requir intellig make fundament design autonom system work real life set architectur methodolog design contribut greatli make combin concept plan motiv emot approach suffici accomplish effici entir figur messag displai robot interact peopl demonstr robot challeng task address time ongo research provid nice setup demonstr integr capabl design autonom mobil robot work real world architectur facilit addit mechan improv process robot capabl speech map environ avoid explor area repetit capabl base knowledg environ implement ration modul architectur current implement nice start point actual capabl make interest addit coupl cue deriv symbol detect environ map improv robot local capabl anticip robot pioneer inher limit make effici human task idea make autonom robot capabl integr step form intellig make requir robot oper real life set acknowledg research conduct support natur scienc engin research council canada canadian foundat innov pour la format de laid la recherch quebec aaai travel support colleg team lend tool confer refer social interact robot human caretak adapt special issu simul model social agent robust layer control system mobil robot ieee journal robot autom fast color imag segment commod hardwar proc work interact robot cooper mobil direct autonom robot embodi interact social intellig agent comput analog agent lectur note artifici volum situat agent goal design autonom theori form biologi engin back mit bradford book motiv person harper row manag robot autonomi interact motiv visual commun proc autonom agent artifici emot social robot proc int symp distribut autonom robot system architectur methodolog base intent configur behavior comput intellig cognit theori emot emot gener theori emot volum academ press chapter experi social robot proc work interact robot habitu adapt behavior psycholog emot john wilei edit comput framework control proc work ground emot adapt confer simul adapt behavior distribut control proc int symp distribut autonom robot system
DB/769 3 effici concurr control broadcast environ shanmugasundaram ramamritham amherst abstract crucial environ data broadcast client low bandwidth client commun server advanc applic environ read data mutual consist current asymmetr commun capabl client mobil tradit approach impract weaker correct criterion call updat consist outlin mechan base criterion ensur mutual consist data maintain server read currenc data read client client obtain data current mutual consist contact server obtain lock result show substanti reduct time compar exist approach attract featur approach cach weaker form currenc obtain satisfi mutual consist data introduct emerg numer concurr demand broadcast mode data dissemin electron commerc expect typic auction bring million interest parti small fraction offer bid updat base bid made dissemin promptli consist small size affili indian institut bombai current state make broadcast feasibl commun bandwidth client commun server restrict attract approach broadcast medium transmit current state auction client commun updat current state low bandwidth server problem address paper techniqu outlin motiv applic concern problem provid reader current mutual consist data ensur consist updat data dissemin major mode inform transfer mobil comput wireless environ system commerci system support broadcast system run sophist involv data consist maintain spite origin mobil client applic includ stock gener road traffic manag system autom industri plant limit amount bandwidth client commun broadcast achiev data consist effici challeng research issu paper motiv similar herman al discuss transact support asymmetr bandwidth environ serializ correct show unnecessari environ author discuss tradeoff currenc data perform issu broadcast data item updat process run server updat transact semant server client updat made process run process client assum recent concurr relat work approach serial graph similar function requir client listen continu broadcast unlik commun failur evalu protocol broadcast environ protocol satisfi mutual consist currenc mutual consist ensur server maintain mutual consist data client read mutual consist data currenc ensur client data current begin broadcast ensur mutual consist adapt correct criterion call updat consist extern consist transact process broadcast environ present context broadcast disk intend applic similar auction size small number client larg protocol permit transact run mobil client read current consist valu contact server acquir lock valid read current valu evalu perform compar algorithm rest paper organ section outlin characterist broadcast environ demonstr exist concurr control techniqu motiv consist criterion weaker serializ show updat consist section describ algorithm approx check updat consist outlin mechan implement broadcast disk environ satisfi currenc requir section evalu perform mechan section summar paper outlin futur work correct broadcast environ outlin characterist broadcast environ describ exist concurr control techniqu applic broadcast environ identifi satisfi updat consist weaken currenc data client rest refer correct criterion updat consist characterist broadcast environ describ broadcast type broadcast environ illustr kei characterist broadcast environ broadcast disk server period broadcast data item client client view broadcast disk read valu data item broadcast cach local order write client contact server inform size transmit larg delai experienc client wait data item applic onlin auction traffic number data item transmit larg order server client bandwidth bandwidth client server limit ffl number client listen server order server handl high bandwidth commun client ffl batteri power scarc resourc mobil client transmiss requir substanti batteri power transmiss client techniqu concurr control broadcast environ asymmetri bandwidth account show exist concurr control techniqu effici satisfi requir design asymmetr commun environ serializ broadcast environ serializ commonli accept correct criterion transact system global properti effect concurr transact execut transact execut serial order requir excess commun distribut obtain requir underli protocol overli conserv disallow correct execut altern broadcast environ limit bandwidth client commun server altern lead unnecessari transact undesir show fundament virtual concurr control mechan satisfi serializ broadcast environ ffl concurr control protocol lock transact broadcast translat acquir read lock data item read client transact swamp server lock request ffl cach consist protocol predominantli assum server awar data item cach client data item client techniqu applic broadcast environ server track cach larg number client client inform server time data item lead high overhead transact consid version data currenc data item read ffl timestamp mechan distribut system timestamp base concurr control protocol requir object track read write timestamp broadcast environ requir client server commun read approach concurr control techniqu literatur aim broadcast environ approach ensur transact execut client server global serializ lead poor perform serializ achiev broadcast environ result present section support argument avoid commun cost incur interact server ensur serializ show client lead unnecessari abort assum broadcast client local transact execut histori histori updat server stock trade transact client read stock price ibm sun transact server updat price ibm sun execut transact run client inform server oper perform reason assumpt limit bandwidth client server server awar histori server broadcast histori client awar client awar server client serializ histori serial order global histori serializ abort read oper perform client transact commun client assum exist inform client messag abort client assum histori wast abort ensur serializ histori unnecessari abort occur system histori client awar histori distinguish case abort similar argument made absenc commun preserv transact abort case histori client assum worst case scenario histori histori modif histori addit oper readonli commit oper transact assum transact execut client transact execut server assum transact desir commit commit server awar histori server awar read write updat origin client order ensur consist absenc high client server server transact histori serializ commit entir histori implic actual histori execut updat transact commit serializ worst case assum wast unnecessari transact abort exampl illustr broadcast serializ updat transact unnecessari abort serializ induc excess commun entail abort avoid serializ fail correct criterion main exemplifi transact execut possibl client requir serial order updat transact exemplifi transact requir serializ respect updat updat affect valu read readonli transact requir show correct criterion relax notion search correct criteria weaken notion serializ literatur applic correct criterion context concurr call updat consist extern consist ideal broadcast environ correct histori consist iff condit hold formal ffl updat transact serializ ffl transact serializ respect subset updat transact read weaker condit maintain consist valu read transact rest give intuit condit exampl introduc previou section comment applic consist base condit broadcast environ histori section mention transact concurr control techniqu outlin applic broadcast environ reason outlin section histori serializ histori accept histori involv updat transact serializ serial order transact serializ respect updat transact transact serial order transact serial order histori transact read consist data updat consist transact consist state commit state transact updat sun stock transact updat ibm stock updat produc consist state consist transact serial order histori section transact histori serializ histori accept updat transact serializ serial order transact serializ respect updat transact serial order fact histori exampl accept impli transact contact server server requir inform perform valid transact maintain consist achiev updat consist data data read address problem serializ discuss section issu updat consist potenti concern fact transact execut client serial order execut updat transact case consid concurr execut transact client serial order updat transact execut lead inconsist transact order updat updat unrel mechan implement mutual consist satisfi currenc ensur readonli transact start execut complet transact serial order transact depend consist fashion execut base result inconsist histori case transact updat transact serial order execut updat transact global explain previou accept independ concurr execut transact serial order execut case concurr execut transact readonli transact read updat updat consist ensur transact updat transact serial order problem transact start execut complet updat transact updat transact start execut complet transact mechan enforc updat satisfi currenc requir ensur transact consist serial order transact depend updat consist implement paper result relat transact execut client serial order execut updat transact mechan correct outlin mechan ensur transact updat consist data valu read transact current shown updat transact serial determin histori updat consist exist effici determin histori updat virtual serializ base concurr control algorithm updat transact polynomi time approxim effici determin legal histori mechan implement algorithm broadcast disk simpler term space version outlin extend exploit weak currenc requir client cach techniqu simpl approxim algorithm determin updat adapt polynomi time algorithm accept set histori proper subset updat consist histori fact proper subset updat consist histori accept impli algorithm accept updat consist histori updat consist histori accept concept defin approxim algorithm transact execut histori set live transact respect histori liv eh minim set close liv eh liv eh transact read object written liv eh set live transact respect transact set transact directli indirectli read updat histori histori updat project histori includ oper perform transact perform write oper approxim algorithm approx determin histori legal iff condit updat conflict serializ read transact histori sh acycl sh serial graph consist transact liv eh intuit algorithm replac occurr view serializ formal updat consist occurr conflict serializ conflict serializ effici altern view expect algorithm approx effici shown approx polynomi time algorithm implement approx broadcast disk environ describ implement full broadcast disk environ simpler algorithm approxim approx space effici qualit compar algorithm concurr control algorithm implement outlin server client natur control inform transmit server client readonli transact valid protocol detail control inform comput server server function server perform definit sh formal updat consist term view serializ gener broadcast latest commit valu data item begin cycl note impli server maintain version latest commit version written version ensur conflict serializ transact submit server origin client submit valid exact inform client provid updat transact discuss client function assum transact transact transact read commit transmit control matrix cycl client determin transact read consist valu control matrix shortli client function client handl type readonli transact updat transact commit abort oper perform transact handl ffl read read oper perform data item broadcast control inform transmit cycl consult determin read oper proce exact detail natur check read oper proce transact abort ffl write data item write perform local copi data item client check made ffl transact perform write commit oper commit succe case transact perform write list object written valu written server list read oper perform cycl number perform server server check updat transact commit commun result client transact abort method handl updat transact similar method ffl transact perform write abort case transact written data copi data item written mainten version object common concurr control concern client maintain singl version discard execut transact stop natur control inform describ natur control inform transmit server show updat end cycl control inform matrix point time number object object assum id ob ob entri set cycl number determin histori execut commit updat transact server commit updat transact wrote ob assum transact write data item cycl begin ffl max eh write ob cycl number commit defin liv eh refer set transact directli indirectli read liv eh set transact latest commit ob write latest commit ob latest cycl number transact affect latest commit ob write ob commit illustr entri matrix determin assum commit oper occur broadcast cycl scenario transact write ob ob commit cycl broadcast similar commit transact write ob liv eh ft transact liv eh write ob cycl broadcast similar assum entri matrix store cycl number rel cycl broadcast avoid maximum number cycl transact span store cycl number max cycl perform modulo max cycl arithmet comparison reduc size entri matrix issu control inform transmit broadcast cycl address effect partit matrix broadcast column broadcast object ob minim amount time client wait control appar section valid client read transact protocol read oper set pair transact read object ob broadcast cycl read latest commit ob begin cycl cycl read oper object ob proce cycl iff hold preserv conflict matrix begin current cycl transact abort read oper perform transact object ob iff transact liv wrote ob read ob theorem transact commit protocol iff acycl proof comput control inform transact entri affect updat server simpl case entri updat serial order section show matrix increment construct begin entri set cycl number matrix consid commit transact serial order point time broadcast cycl newli commit transact occur immedi commit transact updat transact serial order cycl commit rs set object read ws set object written matrix comput ob ob ws transact write object ob ob transact write ob serial order transact affect latest ob write ob entri set cycl commit max ob ws ob ws transact read object rs transact depend set transact directli indirectli affect latest valu item written object rs entri updat reflect fact transact read entri set object ob entri column untouch theorem increment algorithm preserv semant matrix proof potenti drawback comput matrix term server time expect problem sever broadcast environ cater workload transact involv matrix construct potenti drawback mechan bandwidth requir transmit matrix broadcast cycl space requir matrix bit broadcast number object max cycl maximum number broadcast cycl span transact cost larg valu size object fraction broadcast cycl time spent control inform overhead overhead larg valu problem slightli shown compress techniqu worst number bit transmit order repres matrix broadcast cycl quadrat number object broadcast assum simplic entir matrix transmit broadcast cycl number bit transmit drastic reduc transmit previou matrix transmiss disadvantag client store previou transmit matrix client listen broadcast matrix subsequ delta read data broadcast usag scarc client resourc batteri investig detail approach detail paper plan studi part futur work implement previou mechan implement approx algorithm broadcast disk environ outlin potenti overhead comput transmit matrix order drawback mention modifi view object separ partit group object matrix number number group reduc size control inform fact fewer entri updat make effici updat matrix entri modifi set defin ffl max ob item set indistinguish check perform modif account group object set transact read object ob cycl cycl mc matrix begin current cycl partit ob belong number partit spectrum mechan implement vari size partit extrem partit singleton implement tradeoff size partit size unnecessari conflict reduc partit size impli control inform overhead concentr extrem case illustr basic partit singleton set item fall partit case matrix entri object latest cycl number commit written matrix fact simplifi db set object transact proce read object read updat correspond approach concurr control ensur serializ rest call approach fulli realiz potenti matrix reduct fact weaken read object ob perform transact read data item cycl db set object call modifi algorithm reduc idea algorithm transact read consist valu valu read overwritten transact read valu overwritten current read overwritten begin transact ensur transact state time read ensur transact state time read shown accept schedul accept approx optim similar bit set hardwar read valu transact chang futur read bit set object read chang cycl read oper perform transact abort read oper proce reduc number unnecessari abort readonli mechan nice properti unlik transact abort perform read weak currenc requir discuss assum read oper client transact data current begin broadcast cycl read oper perform read oper read data item broadcast client currenc requir data item read current time larger broadcast cycl time data item read broadcast disk cach client futur access data item read local cach wait data item broadcast data item remov cach currenc data item cach exce time unit note invalid item cach local client commun client currenc requir currenc requir data item invalid cach client pure invalid interv tailor object basi invalid perform client vastli currenc requir coexist broadcast medium case client cach larg hold date item cach replac polici similar suggest emploi extra commun cach techniqu specif instanc gener techniqu call introduc main problem solv context ensur transact mutual consist data read cach data item previou approach maintain consist cach data item ensur mutual consist object read transact achiev store column matrix data item cycl data item cach transact access cach data item inform valid weak currenc requir effect exploit broadcast environ client cach mechan extend maintain consist store relev column concurr control matrix simul result simul base experi aim compar perform algorithm concurr control client transact broadcast disk environ algorithm previou section algorithm baselin implement function ignor cost broadcast control inform object broadcast cycl length shorter run algorithm compar effect cach perform studi perform algorithm compar rel ffl transact time time transact submit client time transact commit includ time involv restart transact abort ffl transact restart ratio number time transact restart data read inconsist setup simul consist broadcast disk structur event queue transact execut client server execut updat transact client simul perform concurr control mechan transact independ number client object transact access determin uniform distribut object object updat correspond broadcast tabl list simul paramet client transact length number read oper perform client server transact length number oper server delai model exponenti distribut broadcast medium bandwidth delai translat client delai translat server fill broadcast disk data begin cycl simul object broadcast time entri exist object set time object broadcast client wait time read object cycl consist broadcast object control inform control inform consist number object column matrix broadcast object control inform consist arrai length element arrai broadcast object time broadcast bit unit time time measur term unit evalu algorithm respect set vari paramet time experi consist client transact simul run commit data deriv transact ensur data confid interv width point estim fraction cycl control inform ts size timestamp obj size object timestamp size bit object size byte object overhead work fraction cycl time control inform ts overhead case effect client transact length client transact length algorithm similar perform figur algorithm perform poorli length time limit show behavior client transact time paramet default client transact length server transact length transact rate server number object size object kb server read oper probabl client delai client delai client restart delai timestamp size bit tabl paramet simul time unit reduc number client transact abort figur weaker read condit note perform curv indic scale client transact length small differ perform magnifi figur differ control inform transmiss time read transact wait shorter time broadcast data number updat transact cycl reduc lesser read conflict cycl figur high correl time number abort rest concentr time effect server transact length longer server transact lead updat server cycl time server transact length figur show time compar demonstr scalabl effect transact rate server figur server transact rate left graph show time improv server transact rate perform match displai degrad perform server transact rate effect number object number object probabl transact access object length number object control inform length broadcast cycl number server transact cycl number conflict time size figur rel order protocol remain displai time unit size compar practic protocol rate constant smaller effect object size rel behavior algorithm size object shown figur length broadcast cycl object size time note small object perform space overhead size broadcast offset gain concurr small object perform object size effect control inform perform approach time smaller rate practic protocol summari result outperform outperform experi result confirm hypothesi weaker abort condit lead time highli scalabl respect client transact server transact server transact rate protocol displai time broadcast cycl rate case lower perform featur observ spite requir bit transmit control inform cycl case perform profil close repres end spectrum overhead transmit control inform size number object present cheaper perform scale choic algorithm depend capac broadcast medium profil frequenc client transact length effect client transact length comparison time client transact length effect client transact length comparison number abort figur effect client transact length server transact length effect server transact length effect server transact length transact rate client transact length effect server transact rate figur effect time number object effect size effect number object size object effect object size effect object size figur effect time show mutual consist requir satisfi adapt consist data maintain server read client data read client updat consist approx effici approxim updat consist implement approx broadcast environ satisfi currenc requir introduc low overhead altern extend exploit weak currenc requir simul studi compar perform protocol show superior compar protocol figur develop idea futur work applic broadcast base system stock trade traffic consist currenc requir cater requir effici concurr control subject paper figur show develop idea plan studi effici parallel comput increment transmiss control perform presenc extens optim client updat transact refer al broadcast data manag asymmetr commun environ acm sigmod franklin zdonik dissemin updat broadcast disk vldb barbara data cach issu inform retriev system acm transact septemb hadzilaco goodman concurr control recoveri system pm mj carei queri lock vldb august pm mj carei queri lock comput scienc technic report tr mj al data cach tradeoff dbm architectur acm sigmod june mj franklin cach memori manag system phd omiecinski transient version consist concurr system confer parallel distribut inform system decemb al architectur high throughput system acm sigmod imielinski br badrinath mobil wireless challeng data manag commun agraw activ framework transact process network vldb august wiederhold readonli transact distribut acm transact al inform bu architectur extens distribut system sosp north decemb ch papadimitri theori concurr control comput scienc pitoura scalabl process transact broadcast ieee intern confer distribut comput ramamritham chrysanthi taxonomi correct criteria applic vldb januari al effici concurr control broadcast environ univ massachusett technic report liu genesi advanc travel inform system killer applic mobil comput white wang row cach consist concurr control dbm architectur acm sigmod june distribut version manag action ieee transact softwar januari wilkinson ma maintain consist client cach data vldb august al broadcast demand effici time dissemin data mobil environ ieee technolog applic june pp
AI/770 2 learn detect comput network luca fabio depart electr electron engin itali itali introduct abstract secur comput network plai strateg role modern comput system order enforc high protect level number softwar tool develop detect system aim detect intrud protect pattern recognit approach network detect base ensembl learn paradigm potenti approach data fusion open issu outlin pattern ensembl data fusion nowadai number commerci public servic offer trough secur kei issu internet servic provid carri exploit unknown weak bug system applic softwar comput network protect attack number access restrict polici act grain filter detect system fine grain filter insid protect potenti threat network traffic audit data record host approach detect call base attack detail descript sequenc action perform attack approach detect match perfectli signatur effect strictli relat extent updat signatur latest attack develop challeng attack attack variant constantli develop time attack signatur made publicli number attack variant design produc effect origin slightli signatur detect develop signatur limit scope motiv difficulti captur attack requir small alarm rate signatur high attack detect rate unaccept alarm relev number normal traffic event match signatur easi avail signatur code attack protect attack exploit vulner current state art approach base statist knowledg normal activ comput statist profil constitut legitim traffic network correspond network traffic statist profil deviat significantli normal id model capabl detect system system type provid set usag profil store system repres work attack system involv abnorm acquisit profil activ easi task audit record produc profil normal activ trace detect id case consid legitim activ imperfect normal profil high rate alarm activ legitim user deviat store discuss point detect approach formul term paradigm approach classifi activ match normal profil hand approach classifi activ match attack profil pattern match effect object classifi exhibit regular common case current develop pattern match rule anomali detect reli experi intuit human expert point rule adapt high variabl activ number attack constantli develop difficulti current lead research appli statist pattern recognit approach base learn exampl paradigm main motiv pattern recognit approach develop advanc gener support recognit pattern formul detect problem combin advantag id present research advanc base learn paradigm earli number issu solv order oper environ work literatur show call research approach detect comput network base ensembl learn paradigm member ensembl train distinct featur result ensembl member combin approach motiv observ human expert combin attack evid featur set code attack signatur review current state art base learn paradigm section section present formul detect problem pattern recognit task data fusion approach base ensembl learn paradigm illustr section result public data set report section drawn section relat work pattern recognit approach detect recent technic report current detect commerci research product briefli discuss challeng develop effect point advanc research issu involv pattern recognit learn approach main capabl learn approach gener repres set detect type learn approach attack extract automat label traffic overcom subject human interpret implement current learn approach adapt threat issu address earli year id develop applic neural network investig number research neural network provid solut problem model user behavior anomali detect requir explicit user model neural network detect introduc altern statist techniqu id detect expert system model user behavior typic sequenc command execut user learn similar approach present approach anomali detect base neural network previou work address anomali detect problem analyz audit record produc oper anomali detect usag network protocol neural network model design perform anomali detect train set made string event captur base secur modul part oper system train set made string relat normal neural network act anomali detector string captur attack session includ train network model modifi act detect system train set made traffic data audit record detect traffic featur level abstract packet data high level secur level sourc destin occurr suspici neural network number output node select attack classif case network attack class discuss point pattern recognit techniqu base neural network apt provid solut open issu id automat extract normal attack signatur data abil detect attack train time extens evalu pattern classif techniqu carri sampl data set network traffic perform confer point feasibl pattern recognit approach id common characterist share pattern recognit approach review featur space made featur relat inform abstract level neural network hierarchi featur abstract level process distinct classif perform featur space made featur detect consid attack class recent advanc pattern recognit theori suggest classif perform improv combin ensembl pattern classifi train featur made individu classifi basi partial knowledg past combin mean suitabl combin function perform ensembl approach higher individu pattern classifi combin system exhibit higher robust respect uncertainti train data import featur difficulti collect repres set exampl section formul detect task pattern recognit problem section approach detect base ensembl learn paradigm present problem formul comput network basic exploit kind weak network transmiss protocol weak bug exhibit system applic softwar vast major host base inform extract network traffic detect system base network traffic process capabl detect base exploit weak network protocol base weak system applic softwar pattern recognit approach network detect pattern recognit point network detect problem formul figur inform network connect pair assign connect data class repres normal traffic categori denial access root worth note definit data class term refer sequenc data packet relat transfer web page http protocol aim network detector detect connect relat malici network connect defin classifi formul agreement relat work present section extract suitabl featur repres network connect base expert knowledg characterist distinguish attack normal connect basi previou work featur extract main featur set classifi connect gener inform relat connect includ traffic statist relat past connect similar current number connect destin host connect relat servic time window predefin number past content featur inform data content packet relev discov error report oper root access packet connect record featur extract featur traffic featur content featur classif normal attack class figur detect formul pattern recognit problem featur categor gener account variabl network traffic abstract level requir detect attack addit worth note featur current fall featur categori signatur involv evalu set featur belong featur categori simpl choic suitabl featur attack detect easi attack detect featur choic depend essenti human expert knowledg intuit effect signatur term high attack detect accuraci low alarm rate hand pattern recognit approach exploit rich inform provid featur extract network traffic data complex signatur effect separ attack normal traffic pattern recognit approach provid higher detect accuraci signatur addit gener capabl pattern recognit algorithm detect attack classifi ensembl approach previou section point type featur extract network traffic data featur categori inform discrimin attack normal traffic attack perform comput relat attack found featur categori exhibit discrimin power respect attack network analyst produc effect attack select effect subset featur experi intuit pattern recognit tool design process entir featur set extract effect signatur network analyst section pattern recognit approach base ensembl learn paradigm exploit observ attack evid collect separ featur subspac origin ensembl method base averag posterior estim multipl classifi provid solut recent paradigm ad pool suffici condit ensembl classifi accur individu member classifi accur accuraci higher make error data order gener ensembl made accur number method base resampl method bag ensembl member train train set method base train number classifi train set subset featur easi approach suit data end distinct subset detect problem worth note case goal improv perform respect individu ensembl improv perform respect classifi train entir featur space ensembl method solv detect problem illustr featur subspac independ perform attack detect evid combin order produc final figur process reflect human analyst perspect traffic statist order produc reliabl attack signatur provid effect attack detect low posit rate approach base ensembl learn attain effect attack detect combin multipl evid exhibit higher lower individu gener capabl pattern recognit algorithm detect attack provid signatur traffic featur content classifi classifi classifi classifi classifi classifi fusion function figur ensembl pattern classifi detect normal attack class order illustr simpl fusion major vote averag rule function fusion techniqu comput final set ensembl made classifi vote rule input pattern major class output classifi combin assign input pattern class maximum averag posterior averag comput classifi rule appli classifi provid estim posterior perceptron neural fusion rule base comput data class set output classifi belief valu base estim probabl pattern assign data class belong class class probabl easili comput matrix train set classif perform assign input pattern data class maximum detail combin method reader refer method combin output classifi ensembl base assumpt output classifi independ assumpt verifi real case assumpt hold assumpt hold problem featur set relat independ connect characterist set valu featur number byte relationship valu assum content featur attempt log system user reason argu combin classifi train featur set provid perform singl classifi perform higher classifi base singl featur vector featur result experi carri subset data base creat darpa framework detect evalu program subset columbia distribut part uci kdd archiv data base made larg number network connect relat normal malici traffic connect repres featur vector set featur illustr section connect label belong normal denial servic remot local user root probe attack attack class made attack design attain effect exploit vulner comput network worth note featur extract network traffic larg number commerci ensembl approach suit real scenario order test pattern recognit restrict investig connect relat ftp servic connect repres featur set featur data set discard featur exhibit constant ftp connect featur relat featur subdivid categori outlin section featur belong featur categori featur categori detail featur extract process reader refer featur valu linearli normal rang train set made normal probe attack total ftp connect extract data set test set made connect extract made connect relat normal traffic connect relat belong attack class attack connect relat attack type includ train set classif result relat pattern test capabl pattern recognit approach assign attack type correct attack class solv problem unbalanc class train set augment number pattern relat poorli repres traffic type carri number preliminari classif experi order identifi traffic type augment order produc reliabl perform test set popul train set number copi connect train set experi made normal probe attack total ftp connect heurist approach agreement practic observ attack type carri number connect exhibit similar featur valu featur valu correspond signatur work problem unbalanc class tabl show perform test set neural network train distinct featur content traffic featur perform neural network train entir featur vector report sake comparison network perceptron layer neuron network output neuron number data number input equal number featur hidden layer made neuron network train distinct featur neuron network train featur neural network train learn rate random start weight report result repres perform attain test set classif result report term classif averag classif cost comput cost matrix shown tabl alarm rate research cost matrix shown tabl weight error sever tabl cost matrix evalu matrix relat classifi assign class normal probe normal probe true class perform neural network train traffic similar network train content featur provid result result content featur set suit type traffic true respect traffic featur set tabl neural network train distinct featur set entir featur set classifi type perform error averag cost alarm mlp featur mlp content featur mlp traffic featur mlp featur tabl neural network train distinct featur set entir featur set classifi type attack unknown attack error averag cost error averag cost mlp featur mlp content featur mlp traffic featur mlp featur tabl report perform neural network attack type includ train unknown attack sampl relat attack type includ train set unknown attack type belong attack perform network train traffic featur exhibit high error rate high agreement network train content featur exhibit similar behaviour exhibit good gener capabl respect unknown attack result term attack detect provid network train featur set multipl classifi ensembl consid made classifi train distinct featur set result shown tabl combin improv perform respect individu respect neural network train featur vector respect attack detect perform attain neural network train featur capabl detect unknown attack consid combin improv gener capabl improv perform cost account attack detect capabl conclud multipl classifi approach base distinct featur suit solut implement id tabl combin neural network train distinct featur set combin techniqu perform error averag cost alarm major bayesian averag belief tabl combin neural network train distinct featur set combin techniqu attack unknown attack error averag cost error averag cost major bayesian averag belief research recent pattern recognit techniqu provid gener capabl report result show effect pattern recognit gener capabl pattern recognit tool origin high alarm difficult collect repres set normal traffic sampl report result show effect ensembl learn approach provid reliabl final depend agreement distinct classifi result obtain fusion rule base function paradigm account discrimin power provid consid featur set combin scheme improv present figur extens test requir compar base pattern recognit tool tradit respect capabl ensembl learn approach provid gener capabl alarm conclud combin reduc error reduc gener capabl aspect investig order deploi effect base pattern recognit refer role detect ieee pp pe practic detect prentic state practic detect rep dg pattern john wilei neural network compon detect proc ieee symp research secur pp mj detect neural advanc neural inform process system jordan mit pp sc dv base detector recogn ieee tran part pp ak ghosh studi neural network anomali mi proc usenix secur august usa adapt neural network approach detect phd school comp inf nova jm al network appli detect proc ieee world congress comp intel classifi acm sigkdd kittler multipl classifi lnc combin ieee tran pattern analysi machin pp lee sj framework construct featur model detect acm tran inform system tg method machin proc st intern workshop multipl classifi june lnc pp xu cy method combin multipl classifi applic handwrit recognit ieee tran man cybernet
Agents/771 1 plan agent jame bernd faculti comput scienc comput scienc depart ulm rostock ulm rostock test obligatori step develop system test system dynam simul system requir support declar construct facilit embedd varieti agent ecient distribut execut introduc system jame agent model environ jame agent dynam environ model time trigger state automata possibl frame base prede ned express tempor captur phenomenon ectiv agent illumin experi plan agent underli plan system gener empir result exist tradit static benchmark test analyz interplai heurist select view commit trust persist world uncov properti plan engin chosen test tileworld introduct test obligatori step softwar engin process import develop softwar system consid time develop agent system trivial essenti process trust techniqu assist develop agent face problem tradit distribut concurr system addit diculti complex interact autonom problem solv compon construct agent troubl knowledg base system due environ agent typic nondeterminist complex interact agent environ suggest test repres major research ort area system systemat experi agent found expect attent design agent architectur jen colleagu observ end test agent develop research area system time paul steve martha pollack wrote paper control agent problem controversi role concret test bed design agent system lost topic test phoenix tileworld soccer game larg scale disast repres complement convent benchmark er test scenario aim reveal prototyp problem dynam environ test confront agent valid model concret environ agent dwell aim present simplist world properti concret agent simpli ed version agent analyz properti plan compon nding simpli cation crucial part process test bed explain understand agent behav illumin behavior facet agent architectur plan agent research area test appar behavior dicult predict ad plan capabl agent architectur er advantag explicit knowledg combin stabl robust procedur strateg behavior agent introduct plan techniqu plan show millennium remot agent control deep space probe collect data internet techniqu develop case provabl correct diculti predict fact theoret knowledg structur complex plan problem speci domain uenc plan perform symbol planner fulli determinist algorithm understood plan competit intern confer arti cial intellig plan schedul lead big competit base realworld simpl benchmark problem de nite kind environ question determin behavior agent plan system make dynam plan fast produc valid plan result aip competit chang environ complex term memori plan agent illustr approach simul system jame meet sound method support experi develop multiag system experi execut tileworld scenario plan agent scenario model jame contrast project agent util special plan system maxim score experi agent equip gener base interplai time social trust view rang explor term plan system vari time initi state heurist function size domain model paper describ experi execut plan agent jame test type agent scenario test mobil agent strategi virtual network broad applic properti distinguish jame approach test system rm root formal approach discret event simul domin ii jame tool design test bed object develop agent model environ support modular exibl construct frame system declar modular model design central design test bed rang simpl benchmark test scenario hank point test ultim aim analyz agent perform environ construct ultim interest simpli ed system environ real world system deploi complex interestingli reason steve hank doubt ectiv small world martha pollack interpret approach begin assum test small test larg complement construct composit design ne compon user object jame base dev belong formal gener approach discret event simul model design coin modular composit construct model separ model environ model test unlik formal approach discret event state base view model attent event model captur agent environ situat automata wide unifi abstract percept literatur agent system rosenschein kaelbl introduc situat automaton interact environ transform stream input stream output control system agent maintain relationship environ situat knowledg compil transit rule typic reactiv agent agent total depend perfect percept intern state distinguish state produc input context agent di erent treat agent updat state percept interpret respect current updat state report nalli execut action strategi select action vari state structur di sketch scheme di erent architectur state automata frame construct form abstract behavior agent type abstract emploi agent agent perceiv agent state automata learn behavior pattern agent mean deriv state automaton mimic behavior agent ration action state automata plai central role bring di erent strand research develop dinverno colleagu observ demonstr commerci develop system provid formal foundat lend analysi bene ts make tempor dimens agent behavior explicit ad time trigger event test bed repres time proce contrast dev de ne state time persist simul varieti behavior formal approach discret event dev formal static model structur provid mean crucial model simul agent support variabl structur model assess access behavior structur agent formal introduc express agent ectiv concurr dynam system jame repres implement formal jame distinguish atom coupl model atom model set input state set output event transit dictat state model transit due intern grid agent fig composit coupl model extern input output function gener event output base current time advanc function determin time intern long state persist coupl model state behavior interfac environ set extern input output event made set atom coupl exist compon structur coupl model behavior pattern singl atom model frequent apt chang depend activ atom model coupl model support composit construct frame matter coupl model compon atom coupl composit hierarchi construct composit structur model support compon support nement compon figur illustr structur test scenario jame model atom agent grid posit repres model compon coupl model equal ned compon grid scenario neighborhood grid eld embrac diagon grid spread grid world advantag model environ uniform possibl locat physic realist atom simul spread nation park coupl model simul ect disast urban region scenario load dock coupl model easili repres ned structur locat logic hand model composit structur locat support tool develop environ hand locat build machin agent insid granular motion state output ext int input influenc trigger agent percept action cognit memori fig intern structur atom model role model agent jame agent ascend enter complex approach support formal exibl simul run distribut point import de ned part simul potenti locat interact reduc load local simul engin state space atom model easili structur ect aspect delib goal belief figur show agent term atom dev cognit compon embrac transit function invok plan system activ agent model charg output port access structur environ output port charg moment intern transit function execut trigger ow simul time agent activ decoupl receiv extern event percept event reaction direct environ interact state time advanc function agent rst reaction extern perturb chang intern state time advanc function associ time state persist determin time intern event time agent react extern event shorten lengthen time period output extern event requir agent reaction achiev produc state close model tempor aspect agent reaction extern function behavior output depend agent current state trigger ow time agent requir extern event stai activ time refer case agent time valid model time central test perform typic depend time approach model time function actual comput time estim compon size problem weight count instruct execut jame support time compon execut program overload standard lisp function compon test jame typic implement di erent java start extern thread java languag lend easi implement time variant intern inform compon measur real time consumpt introduc size visit search space count expand number rule number resolut step size structur term liter length express number queri oper belief estim complex measur support reproduc test applic restrict di erent plan system test number expand node valid measur planner gener state oper instanc start style planner expand node requir similar argument appli di erent knowledg algorithm system compar measur base easili size knowledg rst consumpt pollut introduc due runtim valid emploi show experi execut jame belief world affect model behavior articul charg output determin possibl manipul creat model chang interact structur structur connect agent construct work open environ composit interact vari due environ inher dynam due agent delib manipul atom model creat model add exist boundari coupl model delet coupl interact determin interact environ model initi movement interact context interact context determin surround coupl model coupl structur model agent move eld eld establish coupl destin grid element remov connect origin kind structur handl simpli softbot cluster agent move cluster initi move cooper model initi structur agent turn commun negoti jame movement coupl model impli atom model compli request add move model interact context facilit atom model equip default method react add creat delet default reaction suppress decid request execut freedom decid follow distinguish activ agent entiti typic model make model form agent simul jame distinguish dynam system execut interpret dynam speci ed model formal function time advanc function implement java model formal describ causal tempor depend exist exploit knowledg transform descript product trajectori simul layer simul layer adopt structur abstract simul atom model simul coupl model coordin form tree processor leav simul simul realiz exchang messag simul coordin hierarchi activ coordin direct input output simul invok transit output function updat state produc output determin time event model appli time advanc function inform make superior coordin model ect incom event activ time intern event schedul ecient test singl delib consum signi space comput distribut simul prove bene cial processor tree realiz execut adopt conserv strategi process occur simul time process concurr strategi split simul agent process di erent thread simul liber proce concurr util simul event synchron point implement moder optimist simul strategi develop support simul plan agent agent model jame invok extern plan process experi algorithm simul plan agent close cost singl agent perform signi sucient number machin agent plan cientli long test agent mobil agent system mole virtual network librari describ network simpl rout protocol interfac plug exist mole agent virtual world implement jame approach render addit model agent super test requir test contribut logan colleagu entir mole agent state virtual world conserv variant optimist strategi simul proce concurr avoid rollback outset perform di erenc conserv optimist variant explor iii plan agent jame plan illustr agent model jame agent gener plan execut plan blindli activ trigger percept agent call environ percept time consid rudimentari manner intern count simpl plan agent inspir intent model agent architectur agent intern state intern output function updat attitud determin suitabl extern transit function encod reaction agent incom event term state belief updat updat intent mean develop plan achiev newli select goal transit function relat di erent attitud intent time advanc function determin reaction time agent produc output part agent activ commun action model output function intent charg output port ect direct environ messag interpret receiv model intern transit complet activ updat agent state expect ect action class extend state doubl return void action action state action action return fig extract plan jame ad time intern event determin agent activ refer structur intern transit function execut set prede ned method ad remov chang interact model approach assum action layer symbol layer goal interpret plan system lower actual execut intend symbol activ jame speci determin kind inform output port ect action agent environ term structur case transit precipit chang structur model plan figur time consid current action execut plan current plan step execut start replan time determin agent start plan model time plan longer agent plan requir dynam environ agent work complet failur plan step thing observ environ class extend state doubl return fig extern transit simpl plan jame int ident plan figur refer problem plan step time meantim thing happen environ interrupt execut agent notic precondit plan step achiev start moment agent trigger incom distinguish failur execut ongo plan execut requir di erenti input refer current plan step input requir desir ect current plan step con agent continu execut plan reaction time environ inform agent agent mean proce time action complet design irrit agent rst step plan execut gener proce execut plan step agent wait input iv scenario tileworld initi creat test commit strategi irma agent tileworld grid world tile hole lled tile obstacl movement ga station lling consum energi obstacl disappear global paramet set environ displai probabilist back point dynam behavior ectiv agent measur term score summar number kind hole type tile lling agent activ consum tile carri longer walk energi frequent visit tileworld combin count fig tileworld scenario jame diamond denot black circl hole attribut score gain lling correct incorrect type tile grei grid obstacl tile type agent ll rout plan grid world set put constraint search space impli costli respect comput time memori fact similar logist aip uniqu characterist navig task dicult typic deliv parcel smaller set path goal solut solut tile diculti chang environ captur classic plan system primarili design static environ act entiti test bed system repres environ singl entiti agent interact describ grid world composit multipl grid enabl plug physic featur type grid adapt test bed easili complex spatial spread disast call agent action grid model atom model intern behavior probabl time behavior pattern state space grid chang depend plai role ga station interact structur grid agent exhibit dynam agent locat attach coupl move remov ad coupl adjac grid primari goal base ned version agent agent agent agent fig agent move grid posit ning distinguish phase plan gener execut bold long plan stick plan reconsid option plan explicitli fail reactiv agent tend adapt behavior strategi time action addit contrast plan activ trigger extern event easili exhibit plan agent start explor hope option present interact environ base agent request environ grant request interact environ structur protocol scan agent send request grid attach inform request propag sensor rang agent adjac grid result collect central grid back agent agent interpret result updat egocentr map part belief model facilit easi extens scenario physic accur sensor direct accuraci omnisci colleagu explor incomplet inform uenc perform agent pick agent send request pick tile grid attach grid answer request forward tile declin request put agent put gain score connect hole burden run short ga grid obstacl tile hole answer put request send score gain agent agent request move grid attach grid desir locat grant move request agent coupl move grid agent run send request grid ll ga request posit answer grid repres ga station protocol agent point view figur agent request fact environ time point thing hole eld east agent send current move grid element time agent time calcul consum multipli process move ned amount simul set time intern event eld move agent decid time lai acknowledg eld reward ten point agent architectur agent plan movement locat tile pick goal hole heurist function experi jame mediat reactiv ect perform agent core evalu design ration commit strategi decid agent drop goal seiz option ltere irma mean current agent bypass option con ict goal goal group commit opportunist coordin agent dicult absolut commit realist dynam environ chang depend valu option agent respect context awar relev monitor strategi realiz pollack introduc monitor attent agent part environ includ plan relat current commit trade reactiv delib capabl impli agent architectur di erent layer design agent architectur requir answer question aspect includ defer layer multiag scenario question interact work load task distribut agent bene ts gain cooper commun agent strategi agent negoti design subject test object test agent compar agent simpl inform inform agent agent inform inform fig agent scan environ move transfer move east fig interact agent environ ture speed design process agent standard gener plan system make build highli special compon found feasibl exist case recent plan system induc larg number successor due good perform benchmark problem consid capabl strength li produc plan step execut parallel applic search plan step sequenc parallel ltere mutual plan step easi execut big advantag thing point time pick thing techniqu navig task note result applic situat question gener tool obviou special compon explor principl underli domain ect planner perform possibl architectur er meet de cienci gener principl underli domain support plan modifi domain start fundament question delib di erenc plan goal make agent tileworld situat pai plan ahead hand interest condit architectur reach balanc reactiv delib behavior conduct seri experi initi hole ga agent distribut stochast origin scenario control set paramet de ne size maximum number tile hole frequenc seri rst scenario agent concurr activ grid relationship competit cooper time paramet set relat actual comput time agent simul time time unit determin time agent fig percentag score gain agent di erent real time factor valu pressur agent real time factor ten map time unit agent scan area grid equip ego centric map size center grid agent entir world experi consist simul run time unit simul process event time execut time continu time base account rst experi agent ponder goal agent consid goal time point agent underli plan system rst glanc goal prove case ecient goal environ dynam compar scenario thing chang slower environ agent plan execut agent decent chanc gener execut plan valid environ run time planner uenc size domain length produc plan time gener plan variat slightli agent time consumpt agent real time factor agent move action occupi plan agent score converg faster agent satisfi goal job local view task number action requir ll hole typic lling hole subsequ independ ect shown energi consumpt energi consumpt achiev plan goal outperform plan singl goal perform smarter appar time advantag gener plan due time multipli real time small time advanc hour complet plan nish remark agent figur util function select option util de ned distanc agent complex agent fig percentag score gain agent social awar figur modi ed di erent weight account distanc option agent raw absolut score hand varianc reduc fuel consumpt success isol reason behavior agent live head tile ll hole independ varianc score signi cantli board size agent agent put plan action precondit base plan vice versa moment notic plan longer execut intend action start reconsid slightli develop environ long experi durat short competitor stai fuel situat slowli improv impact time equip capabl roughli assess intent select goal heurist figur dynam tileworld unpredict grid turn moment ga start grow total current situat causal structur behavior grid learn world evolv worth ort reason hank doubt tileworld scenario test singl delib agent environ evolv sucient ort agent argument hank account causal structur underli behavior real environ advanc deduc agent random tileworld ect aspect agent applic domain experi test planner demonstr seri benchmark test chosen scenario unexpectedli fail meet high expect agent outperform agent problem domain reason record search path control strategi prove bene cial benchmark test experi explain poor perform planner run regularli constel plan hole longer gener plan reason amount time varianc score begin structur environ phenomenon problem structur situat exhibit di erent qualiti explan li separ access agent follow corridor path nal destin signi longer lead goal posit easier identifi shorter path total random compar good path exist share intermedi step split randomli distribut obstacl happen grid compar structur scenario posit reduc freedom plan obstacl posit properti make search sensit agent react slight motiv explor systemat behavior coupl di erent agent variat easili scalabl paramet agent interact environ seri problem agent face uncertain incomplet knowledg environ possibl handl problem frequent scan environ updat knowledg agent balanc cost bene ts central design refer agent reactiv put di opportunist strongli commit rst paramet determin fast agent awar determin paramet determin ect agent rst call bold strategi scan rang rang rang trust bold run combin fig overview setup de ne trust agent number plan agent execut blindli failur noti cation move agent check option step trust target hole evalu bold agent commit agent trust bold commit option estim check step plan execut case rate found plan commit goal trust rang bold strategi select goal signi uenc improv heurist agent make sophist estim number step ll commit rst agent heurist introduc adapt weight account averag distanc nearest usabl tile rst agent wait option plan explor behavior improv guess design walk randomli fail planner space build plan graph case agent start option commit random movement resembl behavior direct equal probabl pursu di erent agent equip di erent visibl seri start sensor rang agent entir world reduc rang give agent global view center seri basic kind environ rst time experi singl agent plane agent strategi sensor rang test combin vari paramet trust bold conduct set run denot bold ordin trust darker shade higher score agent receiv averag set note experi execut set repres subset bold trust region gure repres interpol version result figur show result experi agent ve color repres ve darker shade area higher valu depend experi valu di er averag score point agent scan rang rise agent scan rang result averag score depend bold trust depict figur bold trust fig averag score scan rang bold trust fig averag score scan rang figur minimum diagram demonstr diculti agent high bold medium trust smaller scan rang stabil agent perform reduc standard deviat experi standard deviat score receiv correl area darker shade bold trust fig low varianc agent perform small scan rang larg trust small bold valu pai varianc unaccept high seri test agent advanc heurist wide scan rang lead averag score bold trust fig averag score explor scan rang improv rst run turn reduc scan heurist easier mislead calcul involv object smaller area agent eld estim commit hole typic rapidli movement heurist put option center agent tile side ect agent automat move initi start central region tileworld vision improv perform degrad tileworld agent overlook entir eld agent plan due domain size plan gener agent wait option time inact reduc score potenti gain stabil larger scan rang figur figur show experi explor version architectur complet visibl eld distribut score equal averag score result explor start plan found turn set happen fail due memori ow avoid explor lead simpler goal agent found simpler goal explain slightli perform case limit visibl agent perform signi cantli improv averag score point standard deviat reduc agent complet environ introduc heurist sign good perform agent explor face unrestrict bold trust fig averag score explor scan rang bold trust fig score varianc explor scan rang visibl er opportun figur pai option account heurist select complet world time point option case restrict introduc heurist capabl explor score sensori input restrict ect rst seri experi agent plan tractabl opportun easili plan compar varianc figur score figur local maxima varianc score overlap experi score coincid stabl behavior summar strategi combin limit sensori capabl explor speak term plan system logist favor nding solut problem instanc explor phase replac phase agent typic wait option memori capabl explor view agent extend domain size directli correl rang vision case unrestrict sensori capabl agent extend view environ contrast restrict view view current state world plan base world hole prove unexpectedli opportunist behavior longer recommend cost bene ts agent unabl gener plan agent equip memori mean belief reason equip mean focu knowledg plan experi con rm experi conduct agent complex environ tileworld er complex plan system react sensit domain size trust environ pai set restrict view length plan trust agent execut entir plan ect trust score indic cost scan term time chosen compar high punish failur introduc balanc view ect trust current follow plan scan check valid intent avail option gener procedur experi properti jame prove composit design ectiv time trigger automata perspect model agent environ plug di erent kind grid element step step debug model facilit automata entiti separ execut control abil includ di erent explicit time model guid experi mean action execut distribut environ enabl perform test run small machin conclud compar jame approach support test agent dynam environ vi und number agent architectur desir assess contrast result achiev quantit experi continu technolog research eld remain immatur drawn technolog remain qualit subject dearth quantit result mean evalu potenti technolog conclud area mobil area ort direct execut support quantit experi ort give necessarili incomplet overview desir speci cation interact reason repres formal speci cation framework system coin hierarch exhibit similar model design jame compon input output interfac speci cation compon build block function compon speci ed subcompon desir distinguish di erent type impact receiv compon focu design system aim verifi properti rst step combin desir proof system made jung fischer critic lack dynam knowledg goal subject chang strategi oper desir support dynam creation compon variabl interact pattern resourc adapt perspect interrap straightforward recent develop desir critic account support evolut system agent reason properti structur agent delet creat agent simpl simul experi time slice document possibl interpret desir model simul time model captur time agent concurr asynchron behavior support true state base approach agent base state execut speci cation grid environ effort speci cation agent interact experi agent support construct frame test bed origin type knowledg reason mechan simul system evolv sim agent base forward chain mechan interpret behavior set rule origin built design singl expert system experi concurr activ autonom agent system program support de nition agent prede ned neural theorem plan relat data base simul algorithm proce time slice iter object run process interpret produc action extern action execut intern complet major agenda desir taem toolkit construct agent equip simul engin issu model question frame ecient sophist simul algorithm hitherto found requir attent chang develop taem announc distribut version simul proce time slice time slice prepar run distribut set concurr logan start develop distribut simul approach sim agent ecient simul multipl delib agent explicit time model test bed robocup emploi explicit time model simul engin agent commun asynchron simul check frequent agent decid action simul engin proce calcul agent sourc strategi equal calcul virtual time base time simul execut time agent virtual time simul system put case control execut time simul system distribut environ addit introduc due vari load network control element experi reduc result reproduc aspect minor interest execut contest parallel distribut execut mechan base explicit time model repres time monoton function execut process gain perform close correl ort agent algorithm simul extens plan agent close cost singl sucient number machin similar soccer simul virtual environ exist agent coupl environ test plan agent base idea tate plan initi part preci equip discret event simul system test scenario refer develop plan evacu oper rel virtual island scenario set test bed agent simul model autonom unit interact event queue simul run separ process repres actual state world model agent limit repres view agent jame approach simul entail descript environ model execut test domain separ popular simul game hammond colleagu test real time properti plan system planner role major combin reactiv delib capabl major attend quickli citi spread layout industri requir plan plan system run real time simul soccer simul phoenix test plan agent capabl virtual forest underli discret event simul engin synchron process agent propag agent agent type process produc time stamp event synchron event produc environ tool box construct test bed complement statist tool set experi interpret produc result object agent de ned event execut simul engin modular model agent environ support facilit construct test simul af forc introduc support model domain agent move space appli forc model unit call circular object set prede ned physic basic move higher level provid goal context lower level agent hierarch agent control unit serv frame design agent schedul action execut intern time step agent action execut due user support construct test agent agent restrict type agent environ test confront agent complex dynam environ exhibit causal structur ect activ anticip dynam environ pai scenario test bed agent design gener simul support construct type test grid agent dwell view agent abstract robot move physic world construct test scenario test agent di erent plan robot mobil agent move internet jame intent support test system larg provid dynam complex test scenario de ned interfac agent easili coupl compar jame gener system sim team appar primarili system construct agent system model complex dynam agent ecient execut model model design describ distribut rm root formal discret event approach constitut strength support er develop agent ectiv automata perspect delib frame obviou test mobil agent mole system jame jame constitut featur expect simul system tool input output graphic user interfac librari model system featur grow develop experi facilit compon vii jen wooldridg group work agent system construct test environ undesir state simul system sucient easi provid research student alik access experi system design jame integr agent discret event simul aim provid environ test agent singl interact strategi main object facilit test small test equal associ construct valid model agent environ jame clear conceptu framework enabl complex system manag decomposit jame speci cation tool agent present agent architectur ectiv time trigger state automaton frame describ emb agent architectur jame jame support abstract common percept agent agent architectur theoret found simul approach clear separ declar model design ecient concurr execut experi demonstr suitabl state automaton integr di erent plan variabl structur model captur dynam system hard predict analyz singl agent interact dynam environ necessit approach gener plan techniqu begin found plan problem interact algorithm commonli benchmark cover problem agent encount dwell dynam world classic plan system examin imposs predict perform agent architectur experi gave rst hint methodolog architectur paramet plan system show rst super cial result singl test set dynam mislead design reduc plan capabl remov sake perform run prove strateg kind perform term score term stabil resourc nding foster planner strength analysi exhaust nish di erent planner examin order similar hand discov abstract simpl domain tileworld thought refer anderson gener distribut system intellig agent design evalu hs fe mm jw arti cial plan high autonomi page san sc sd anderson mess user manual comput scienc sd anderson simul multipl agent proc sd dm dl pr cohen toolbox empir analyz arti cial intellig program intern journal arti cial intellig ms dl gd pr ad af hac agent simul control workshop softwar tool develop mobil agent system www journal special issu applic techniqu web blum furst fast plan plan graph analysi arti cial dj pollack plan practic reason comput bratman practic reason harvard fmt nr treur desir model system composit formal framework intern journal cooper inform fmt cm wijngaard evolut system sixth intern confer ai page fmt pat von treur model societi simpl conceptu speci cation poster proc carmel markovitch learn model intellig agent intern joint confer arti cial intellig trial understand design requir agent complex environ ai ks decker vr lesser design famili coordin algorithm eleventh nation confer arti cial page luck interact protocol agenti intern confer system coordin distribut problem solver kluwer academ cm treur composit veri cation system tempor logic jp mp intern workshop agent architectur languag lectur note arti cial springer jp pischel agenda gener testb distribut arti cial intellig applic ohar nr foundat distribut arti cial page john wilei simul learn agent ho tate domain speci criteria direct evalu plan system technic report inform scienc southern marina del keith golden leap inform gather planner page aaai gc goldman js rosenschein emerg coordin cooper rule nation confer arti cial page ml greenberg dl phoenix testb technic report comput inform massachusett kj mj dd actual agenc practic technic report comput scienc cohen test control design agent architectur horti pollack option evalu context confer theoret aspect ration knowledg intern sri softwar version januari wooldridg roadmap agent develop autonom agent nr jen wooldridg applic intellig agent nr jen agent technolog market cg jung fischer methodolog comparison agent model technic report georg rao methodolog model techniqu system bdi agent van de veld jw agent break volum page search rescu larg scale disast domain research proc ieee confer asada robocup synthet agent challeng intern joint confer arti cial intellig langlei scienc plan workshop innov approach page san morgan kaufmann logan distribut simul system dinverno agent theori agent case studi nr intern workshop agent number lectur note arti cial page springer rest mice user guid dep electr engin comput ann januari design intellig agent number lnai nicola barnei brian william remot ai system arti cial noda soccer simul cup special session structur argument mobil phd pollack ringuett introduc evalu agent architectur page pollack plan dynam system advanc plan technolog ga di ho man preci environ technic report arti cial intellig applic plan algorithm base direct search ag lk sc principl knowledg reason proc sixth intern confer page san morgan kaufmann js rosenschein lp kaelbl situat view control arti cial sandholm lesser coalit bound agent arti cial bp sb hall layer model simul architectur system develop im ein master depart comput sloman poli sim toolkit explor agent design intellig agent vol ii page logan framework distribut simul system european simul multi confer page sc model mobil agent futur gener comput dynam structur model simul ectiv approach acm transact model parallel simul delib agent parallel distribut simul confer ieee comput societi press plug test softwar agent virtual environ winter simul confer decemb mm mt cox monitor plan environ fourth intern confer ai plan system lesser experi simul system fourth intern confer multiag system aaai weld recent advanc ai plan technic report depart comput scienc octob daniel weld introduct commit plan ai mj wooldridg nr jen pitfal develop proc intern confer autonom agent bp kim tg theori model simul academ biographi bernd nish msc comput scienc ulm octob work applic test bed reactiv delib system member arti cial intellig depart research phd hierarch plan address receiv msc phd comput scienc fellow alexand von humboldt foundat research depart electr comput engin arizona assist professor arti cial intellig depart ulm join depart comput scienc rostock associ professor research interest arti cial model develop model simul method webpag address
AI/772 2 architectur intellig tutor nicola de santo marco marsella mario abstract interest realm brought success develop internet distanc learn kei issu field develop system support tutor activ paper concern present innov architectur intellig tutor make softwar agent knowledg repres store discuss abil system manag individu learn path user agent present implement system discuss introduct great amount inform internet brought develop sophist interest knowledg inform retriev inform filter hot topic area applic internet enorm number interest distanc learn potenti web provid rich materi possibl capabl learn knowledg impli digit technolog factor import world amount inform learn grow rapidli obsolet quickli matter local area network wide area network inform data applic brought enabl technolog framework bring multimedia train full avail million peopl electron mail electron bulletin board familiar tool busi educ environ coupl rapid improv graphic user interfac internet world wide applic train educ emerg daili itali università di itali deliveri system train educ underwai potenti number challeng overcom recent research gear develop intellig tutor system respond directli student assum activ role intellig tutor system emul human tutor teach teach learn teach relev inform student taught requir domain knowledg expert knowledg instruct student taught student interact intellig tutor system make judgement student student progress instruct model tailor human instructor act privat human trainer tutor free focu complex individu student artifici intellig identifi weak prefer style learn system qualit process recogn pattern identifi misconcept bug establish plan instruct instruct tailor learn style remedi base student error misconcept capabl control student behavior major compon intellig tutor system expert student model instruct model paragraph dealt introduct model expert model varieti knowledg architectur black box model establish criterion referenc knowledg base content domain natur organ exist comput understand comput assess student perform criterion accept perform identifi input behavior meet comput inform student perform error recommend solut dialogu student simplist comput provid detail explan reason mathemat equat lend type architectur architectur compar student input model model instruct program specif observ behavior model model perform fail meet prescrib behavior student receiv feedback feedback includ explan rule dialogu superfici simpl feedback correct complex provid detail reason behavior rule cognit model realist simul human problem solv level knowledg qualit procedur knowledg relat task perform declar knowledg set fact organ permit reason underli type knowledg architectur assumpt student procedur knowledg base make infer content domain qualit knowledg involv causal human reason behavior model system expert model qualit knowledg stage knowledg structur product system product system larg quantiti knowledg solv problem declar procedur knowledg integr product system declar knowledg formul fact procedur knowledg rule base relationship intellig tutor system expand applic product system recogn human capac solv problem reason method system assess student perform determin behavior conform prescrib perform match assum role weak prescrib remedi intellig tutor system make infer teach independ content domain student model student model establish framework identifi misconcept perform structur student model deriv behavior direct question histor data assumpt assess skill novic difficulti level content domain compar actual perform student model determin student master content domain advanc curriculum depend assess profici level student student model student misconcept miss concept bug librari miss concept item knowledg expert student lack misconcept item knowledg student expert bug identifi observ student behavior learn theori content domain instruct model activ interact student input level understand misunderstand knowledg domain tutori control select sequenc inform respond student question subject domain determin student kind effect meet chang student characterist weak adapt instruct level profici ideal conform evolv skill level student adapt novic evolv subject matter expert stand base intellig tutor system extend tradit manag system set function student model automat curriculum gener function improv learn effect base adapt didact materi student skill prefer chapter thought introduct function paragraph dealt student model paragraph describ implement algorithm curriculum gener function depict uml case diagram figur evalu curriculum case dealt curriculum gener evalu prefer evalu cognit state case relat user model function found effect set rule knowledg index base metadata conceptu graph point treat paragraph cm evalu curriculum evalu prefer evalu cognit state figur case diagram knowledg index evalu didact materi organ learn object store materi file system learn object entiti referenc learn learn object index order system learn process kind inform learn object requir metadata inform physic digit main goal locat effici effect resourc system comput field learn organ attent creation metadata standard syntax semant learn object metadata standard defin minim set properti learn object evalu abil local extend basic properti adopt ieee standard index learn materi advantag fact refer learn object metadata advantag complet syntax semant creat expert learn enabl automat import extern learn object adopt metadata enabl learn object extern adopt metadata metadata provid inform singl learn object provid inform object relat interdepend ieee standard metadata element call idea support domain conceptu conceptu simplifi view world repres conceptu graph explicit specif conceptu conceptu graph structur concept conceptu relat arc link conceptu relat concept concept intend abstract notion refer conceptu graph conceptu graph link concept underli knowledg domain kind gener conceptu graph massiv function conjunct metadata field cognit state model automat curriculum gener student model student model cognit state set learn prefer cognit state knowledg reach test domain concept repres inform arrai fuzzi number fuzzi number cognit state necess manag uncertainti student evalu process admit kind evalu reliabl student read deliv exposit learn object set concept infer student cognit state relat concept larg uncertainti student answer correctli test relat cognit state relat involv concept lower lower uncertainti repres kind ad inform narrow fuzzi number order model attitud human forget appli forget function cognit state human forget algorithm concept knowledg wide amplitud repres fuzzi number signifi evalu learn prefer inform student percept capabl kind resourc student shown recept evalu student prefer exploit metadata element educ ieee metadata categori format pedagog interact level semant densiti evalu student prefer exploit learn process mileston student chosen tutor cognit state updat respect activ perform student evalu concept involv student perform activ evalu pedagog effect learn object typolog exploit conceptu variat educ metadata inform visit learn object coupl subsequ mileston calcul inform student model exploit directli tutor automat curriculum gener procedur automat curriculum gener student assign set learn goal curriculum learn goal strongli learn intend set kei concept learnt success complet specif concept part domain repres insid conceptu graph domain curriculum order list learn object provid specif student knowledg complet specif learn goal student curriculum concept learnt student requir curriculum learn learn goal depend cognit state learn prefer reason curriculum gener procedur provid curriculum gener construct concept sequenc conceptu graph domain relat target learn goal student cognit state learn goal prerequisit student insert transform concept sequenc learn object sequenc student prefer insert test activ full descript algorithm found curriculum gener present chapter curriculum gener facil simpli tutor manag phase directli chang student curriculum base perform activ paradigm conceiv agent system chapter provid fundament system agent orient softwar engin main goal justifi choic implement paradigm choic base agent ma characterist involv introduct concept agent ma final discuss tool develop ma applic adopt jafma concept agent ma improv field softwar engin result introduct power abstract manag softwar inher complex kei advanc program design develop past decad procedur abstract data object orient program repres increasingli power exampl abstract singl compel argument favor agent softwar engin repres abstract consensu kei concept import emerg paradigm softwar situat awar react agent accomplish task softwar agent offer paradigm larg scale distribut heterogen applic paradigm interact cooper process adapt human agent mobil orthogon characterist import intellig desir characterist strictli requir paradigm paradigm form root agent orient methodolog attain oop methodolog ai studi intellig agent defin make system act react commun kei realiz potenti agent develop human languag kei develop human intellig societi agent agent commun languag share inform knowledg lead concept ma ma defin network commun cooper agent work solv problem individu capabl order obtain coher system individu agent ma share knowledg problem reason process coordin agent adopt approach chapter ma extend tradit manag system set function softwar modul act transpar intellig engin respect function exhibit cm mean function student model curriculum gener cm request servic behavior depict figur order fulfil abil intellig abil react concurr servic request easi describ reason motiv choic favor ma technolog provid servic agent paradigm inher distribut concurr task student requir concurr advantag presenc comput network ma approach ensur high level workload scalabl mean multi agent system share workload servic request pool agent distribut machin order optim repli time workload server ma ensur high level function scalabl function fact ad system simpli ad agent provid function modif made system behavior simpli correspond event agent servic ad ma architectur obtain optimum solut cooper kind agent updat student agent interact fact obtain partial solut agent final solut reach total time ma high redund agent ensur high level robust exploit manag error situat verifi activ server agent ma implement issu choic proper tool implement agent system arm develop advantag prove long run inher difficulti encount implement coordin behavior ma essenti enabl agent commun protocol languag agent interact combin coher ensur agent coordin bring coher solut problem solv import issu program languag chose java architectur neutral network object nativ method ma develop care examin state art select jafma agent framework pai special attent satisfi discuss point jafma defin methodolog support phase ma softwar develop requir specif commonli accept approach implement modul greater system comput base train task limit add classic manag system mean kind commun cm extern share data sourc led set relat interdepend shown figur cm modul strongli commun cm direct rmi invoc abil access share interact matter paragraph describ mean data sourc shown figur materi learn object form file deliveri metadata base metadata index materi format modifi metadata author log student activ perform learn experi test perman learner model cognit state learn prefer user inform system user assign inform learn goal curriculum conceiv ma paragraph describ process product common approach product agent softwar requir identif identif logic interact ma implement paragraph describ step cm data base user user web browser page feedback manag system event call metadata author tool knowledg librari data base learner model materi metadata figur cm interrel identifi agent start point identifi kind agent implement insid uml case diagram shown figur diagram servic provid cognit state evalu prefer evalu curriculum evalu complet student evalu evalu case call system kind base function typolog log evalu agent interest evalu updat cognit state interact metadata base affect agent interest evalu updat learn prefer interact metadata base pedagog agent interest evalu updat curriculum interact metadata agent agent commun ensur agent develop tool adopt cm softwar applic order implement commun fourth kind agent agent capabl invok directli cm act interfac cm fourth kind agent agent agent cm modul instanc java class cm commun simpli local call agent method cm requir request servic agent agent find slave agent net affect pedagog request servic choic made minim agent figur depict kind agent interact evalu agent affect agent manag system agent metadata base pedagog agent figur sourc interact identifi logic interact agent divid multicast group agent kind correspond specif group scalabl term abil repli concurr request obtain simpli put group higher number agent higher forecast workload agent commun agent typolog part group group figur depict group agent affect agent agent pedagog agent figur agent group evalu agent agent role agent identifi agent net send multicast messag automat fashion slave agent visibl agent add found slave address list maintain insid workspac slave agent close user kind error cancel list import note agent duplic order workload handl agent interact formal interact agent ma model form agent plan achiev base interact agent identifi agent system engag repres develop finit state machin model ma identifi type agent slave agent evalu order request provid servic figur form agent point view slave agent point view simpl realiz robust effici error signal agent error signal arriv agent perform limit number attempt agent error condit persist except pass cm handl transmit agent wait transmit messag convei attend error transmit messag error report except messag convei except descript receiv request run request respond result except timeout figur agent slave point ov view ma implement implement phase paper introduc basic concept step import rememb phase gener java infrastructur start extens point introduc jafma framework extend defin jafma class agent implement java class provid system data structur work properli order design ma find coher solut entir system import check logic consist agent automata model concurr finit state machin petri net provid tool check system coher analyz model action section present exampl softwar work figur show agent java swing applic load oper main window princip left side agent tree side big text box displai user select item tree multicast group multicast group folder item group agent regist agent figur pedagog agent regist pedagog select messag relat multicast group box run end error termin error end error termin correct end select messag relat box paragraph present interact level detail main data flow user cm agent paragraph paragraph dealt analysi singl agent pedagog agent request curriculum evalu servic figur pedagog agent interact agent launch server access cm agent figur student learn system web browser student reach point curriculum function call point cm notic browser server agent invok provid servic servic request agent slave agent slave agent perform calcul involv modifi sequenc student repli agent perform control return cm send browser current page student import note activ page chang remain part curriculum paragraph analyz agent agent request updat curriculum servic shown pedagog agent point view text insid box text extrapol directli pedagog agent messag box repres agent messag text time repres comment messag execut rule msg type find expect msg queue input condit satisfi rule execut execut rule figur interact msg type found expect msg queue input condit satisfi rule execut rule servic request start string line repres creat real time agent pedagog agent appli rule servic request match serv request pedagog agent appli rule serv appli curriculum evalu start inform id student id date pm posit curriculum expir market definit test expir strateg market definit test expir sector test expir sector structur corpor plan test test expir test test test test test updat learn market pedagog agent load inform actual gener inform current curriculum list learn mean passiv mean multipl choic test mean curriculum mileston actual posit curriculum mileston reason control pass pedagog agent line repres learn goal concept identifi cognit state inform id student id date pm visit frame durat rate evalu market market sector market market market market asa market market market ge market thing load actual cognit state student examin list concept evalu list numer coupl row triangular fuzzi number repres knowledg reach student concept row number coupl strictli knowledg worst reliabl evalu concept fulli student student show difficult understand concept prefer inform id student id date pm max frame size kb languag en coursewar genr hypertext imag text pedagog approach interact level medium low semant densiti low low difficulti low low inform user prefer learn materi requir element posit fuzzi number repres prefer genr element neg fuzzi number repres requir concept asa market market market ge market market pedagog agent start curriculum evalu concept requir reach learn goal minu calcul found materi goal corpor plan pedagog agent find metadata base materi explain requir concept learn object explain found learn object match student prefer curriculum curriculum corpor plan learn market curriculum approxim gener agent simpli order found materi curriculum curriculum corpor plan test test updat cognit state test test test updat learn market agent gener approxim curriculum ad test materi evalu mileston explain concept curriculum id student id date pm posit curriculum expir market definit test expir strateg market definit test expir sector test expir sector structur corpor plan test test expir test test test test test expir corpor plan test test updat cognit state test test test updat learn market curriculum gener merg curriculum order ensur visibl previou posit student page import note mileston gener agent call transform expir mileston transmit msg type servic provid execut final state reach final curriculum store perform back agent close introduc paper intellig tutor system base adopt softwar agent main innov issu found distribut natur implement flexibl agent approach agent defin cooper solv tutor prototyp version implement undergo campaign framework european esprit project call integr core engin web deliveri simul tool implement choic revel suitabl integr heterogen distanc learn modul base java languag facil test detail determin real effect system support tutor improv qualiti learn process studi concern architectur model intellig tutor system defin detail end care analysi obtain result refer intellig tutor mark ma methodolog intellig tutor artifici intellig educ tutor knowledg base proc int conf industri engin applic artifici intellig expert solowai learn proc chi knowledg manipul real submit agent base intellig tutor system distanc june object work draft document ieee learn technolog standard conceptu graph graph draft prade set system theori academ descript framework model syntax world wide web consortium agent framework depart electr comput engin comput scienc cincinnati agent commun maryland baltimor intern symposium agent system applic intern symposium mobil dartmouth workshop transport octob la marriott resort palm usa dm good ibm research watson research yorktown ny mj practic methodolog agent orient softwar engin technic report depart dec jp activ object autonom ieee nutshel ieee transact knowledg data softwar ieee
Agents/773 1 architectur guid crowd behavior system daniel thalmann comput graphic lab swiss feder institut technolog ch switzerland abstract paper describ architectur combin control human agent perform behavior system manag autonom crowd perform action main goal abil model crowd form larg number agent action basic behavior user interfac behavior control group crowd paper present server applic deal virtual human behavior system keyword agent network synthet human model introduct virtual human group form crowd popul virtual world intuit feel presenc crowd creat simul intellig action group individu develop system human behavior appli behavior control virtual crowd system implement order integr system model control group human agent behavior system user describ human charact rule figur interact virtual world send stimuli realtim induc behavior action human agent group counter bui laura train figur rule event defin user event set behavior rule check match condit activ order gener case unfamiliar user warn default induc rule user enter behavior inform simul rule event natur languag user interfac syntact simul feedback state behaviour rule base behaviour manag figur organ figur show step fact base order guid user defin behavior rule simpl syntax close english languag figur syntact analyz translat definit code understood behavior manag modul rule match user step behavior rule order counter bui train gener fact base event current system state state success induc synchron crowd applic wait adequ integr crowd model section architectur behavior client guid crowd send order server fix commun protocol client code order decod crowd simul feedback crowd model simul crowd agent endow level consid type virtual agent behavior control behavior autonom action emploi guid action defin consist agent action behavior simul start creat script languag action shown script figur group autonom figur script languag group inform group call form agent follow script inform data includ determin path initi postur appli specif action occur simul plai keyfram crowd part list action execut time autonom follow preprogram control simul order appli implement crowd client commun protocol server translat redirect messag detail process present section guid crowd client handl inform ip ap simul order tourist offic bui opera action divid motion command action command send data crowd translat server order compat inform await receptor approach server translat distribut inform client socket stream guid group choic behavior client run simultan machin send order typic messag bui messag await crowd client lower posit order translat inform crowd server environ inform store locat bu server translat transmit codifi order command readabl crowd client result simul human crowd manag train station order mix level control present script behavior specif action program ticket ticket sit wait action appli depend event occur simul figur guid group check timet sit figur autonom group enter train station train station simul involv agent guid paper address control guid crowd group system order enhanc intellig abil exist virtual agent control featur system user chang crowd behavior simul evalu model train station simul project part virtual citi project aim simul virtual urban life level autonomi obtain realist simul acknowledg research sponsor swiss nation research feder offic educ scienc act cape de de de superior offic educ refer sc open agent aaai spring march step virtual human manag urban environ luc kurt robot make short sri intern aaai robot contest model collabor virtual proc acm novemb taiwan artifici intellig case studi common isbn page templat word end user comput servic creation chang save save total edit minut print complet print number number number
ML/774 6 genet time space complex analysi martin pelikan fernando lobo illig report march illinoi genet algorithm laboratori illinoi transport build mathew avenu il genet time space complex analysi martin pelikan fernando lobo illinoi genet algorithm laboratori mathew il illinoi abstract analysi time space complex genet algorithm versu genet algorithm optim popul size provid result analysi discuss assumpt order analysi correct result applic wide rang problem configur genet algorithm consid result time space complex compar introduct genet algorithm altern common method tweak valu paramet genet algorithm order find accur reliabl solv problem algorithm manag number independ run genet algorithm popul size remain paramet set fix valu theori genet algorithm control map introduc order constitut robust set theoret analysi relat time converg space requir genet algorithm genet algorithm optim popul size paper provid analysi recent genet algorithm time converg function time requir genet algorithm optim popul size comput space complex analysi genet algorithm perform configur genet algorithm analyz result analysi discuss paper start provid basic background motiv genet algorithm section describ principl algorithm section analysi method provid result analysi discuss section paper conclud section background genet algorithm optim method easi applic wide rang problem prior knowledg make genet algorithm work user number paramet popul select crossov mutat probabl schema theorem set crossov rate select pressur algorithm achiev good result number problem crucial problem size popul order solut requir qualiti unawar optim build block popul size theori directli applic user left approach enlarg popul manual result satisfactori genet algorithm result schema theorem theoret studi genet algorithm order elimin ga paramet set paramet popul size reason manag multipl independ ga run popul size genet algorithm genet algorithm mutat mutat import sake genet algorithm mutat section discuss discard remain paramet select crossov popul size elimin select pressur crossov rate select pressur control bia algorithm solut stronger select pressur put qualiti solut select crossov rate control amount mix solut ga higher crossov solut mix select pressur crossov rate correl select strong ensur proper reproduct build block strong preserv popul give crossov time combin solut popul converg crossov rate larg order ensur proper mix build block respect current select pressur high crossov break long build weak select solut lost genet select pressur crossov rate set simplif schema theorem order ensur growth build block select pressur set solut popul copi select set size crossov rate set pair solut select set undergo solut median popul full copi offspr averag half offspr creat combin select solut crossov crossov method elimin popul size user optim popul size ga find solut run algorithm popul size result achiev bigger popul similar result smaller comput resourc user satisfi found solut found genet algorithm base similar principl describ approach approach autom version user typic iter enlarg popul genet approach order elimin major drawback simpler approach denot ga run perform ga run index nonneg integ start run ga popul size run ga denot run small popul popul size remain run set induct run popul larg popul run section describ approach simul run ga properti approach approach base perform run start run ga current run ga run ga popul size big previou start process repeat user satisfi solut algorithm found comput resourc spent noisi function function multipl optima trivial task design effect termin criteria simpli determin termin run wander search space long time qualit improv lose inform acquir comput termin success iter enlarg popul determin choic termin criteria approach approach elimin major drawback iter approach previou section manag race multipl popul genet algorithm maintain infinit number independ ga run simultan run larger popul requir fit evalu process gener run smaller process run speed respect number perform gener run infinit number run speed infinit loop inevit problem evad run number fit evalu entir comput ga popul size perform gener ga run perform gener run smaller popul size function evalu run perform gener run number fit evalu origin genet run smaller popul fit evalu run larger popul ga fit evalu ga analyz gener case run ga linearli proport number fit evalu respect number evalu run ga run delet converg averag fit current popul run lower averag fit current popul run larger run smaller popul succe result run bigger popul delet run smaller popul delet result run bigger popul indic remain run run smallest popul size index ga maintain run mechan solut found popul big genet algorithm find solut techniqu ensur spite virtual manag infinit number point time finit number run maintain counter activ ga ga ga ga ga ga ga ga ga ga ga tabl run genet algorithm implement posit integ greater counter set iter counter increment posit bit chang counter determin index run perform gener iter index posit chang bit order bit ga run time gener ga larger closer race resembl simpl iter approach simultan approach iter ga converg averag fit lower averag fit run ga run run smaller popul run ga delet index run remain run smallest popul ga index ga counter shift posit bit run index run consist step increment counter binari figur bit posit determin number activ run run perform underlin analysi section analysi relat worst case genet algorithm ga optim popul size worst run popul larger equal opt find solut requir qualiti solut correct build block probabl run smaller popul size converg run larger popul section start describ assumpt made order perform analysi worst case genet algorithm analysi perform assumpt assumpt genet algorithm select pressur crossov set genet find solut requir qualiti refer probabl popul larger equal critic popul size assumpt reason bigger sampl make accur qualiti found solut grow monoton popul ga approach problem call critic popul size optim denot opt averag number gener ga find solut optim popul size opt denot opt gener solut number fit evalu solut reach optim popul size opt denot opt opt opt opt assumpt popul size opt big opt genet algorithm opt gener reach solut opt opt opt averag number gener ga popul size find solut assumpt fact weaker exist genet algorithm theori suffici order make analysi worst popul size remain run ga easi exist minim popul size run ga suffici order find opt plug equat side opt substitut equat equat opt bound log opt log opt log opt assumpt equat bound expect number gener converg ga denot opt worst run ga reach solut comput resourc spent ga wast number gener perform run ga case success ga denot equat valid assum run ga perform gener perform time complex analysi worst case comput number fit evalu genet algorithm function number fit evalu ga optim popul size opt classifi fit evalu genet algorithm perform class class function evalu perform ga class evalu perform run popul smaller remain fit evalu classifi class number fit denot sum number fit evalu class ea eb ec ea number evalu ga run ga popul size find solut perform gener averag individu evalu number fit evalu perform denot comput appli equat bound number fit evalu denot ea ea opt ea opt eb number evalu run smaller popul worst run popul smaller find solut ga denot number gener perform run ga run ga found solut requir qualiti equat relat popul size opt sum fit evalu perform run popul smaller number fit evalu denot eb eb opt opt equat equat eb opt log opt opt simplifi eb opt log opt opt opt log posit real number grow logarithm ec number evalu run bigger popul run ga perform time gener ga equat ga run solv log number fit evalu perform run ga opt number fit evalu perform run ga denot ec ec opt opt opt ec opt ec opt log opt opt log opt simplifi equat ec opt log opt opt opt log neg real number logarithm number fit evalu number fit fit evalu genet algorithm achiev solut requir denot sum number fit evalu analyz ea equat number fit evalu opt log log opt opt opt log opt simplifi opt log opt opt opt opt log constant depend logarithm space complex analysi worst case comput memori solut popul initi run genet algorithm ga optim popul size store opt solut time space complex respect number individu store denot opt opt opt result previou algorithm ga ga run time equat number solut store time denot simplifi space complex genet algorithm opt opt opt log opt genet algorithm requir space proport space requir ga optim popul number gener requir ga optim popul size find solut power logarithm space requir discuss analysi upper boundari time requir genet algorithm find solut qualiti probabl simpl genet algorithm popul set optim result complex depend base determin proport fit evalu simul run analysi provid paper estim time space complex genet algorithm reader care interpret result analysi account cumul effect run multipl independ run run badli bigger chanc find solut actual scenario occur time complex choic scenario averag case scenario case problem suffer effect genet drift benefit low valu problem larger issu base genet algorithm work main approach reliev user set paramet ga origin genet algorithm fix reason problem affect genet drift analysi genet algorithm shown worst case comput requir ga optim popul size significantli offer effici method discard ga paramet method commonli evolutionari linkag learn genet univari margin distribut extend compact genet bayesian optim algorithm method complex analysi acknowledg author david goldberg discuss comment shape work work sponsor air forc offic scientif air forc materiel grant number research fund project provid grant armi research laboratori feder laboratori cooper agreement martin pelikan support grant number scientif grant agenc republ govern author reproduc distribut reprint notwithstand copyright notat thereon view author interpret necessarili repres offici polici express air forc scientif research govern refer genet algorithm machin learn understand mix genet algorithm journal societi instrument control genet size popul ieee intern confer evolutionari comput ieee genet algorithm report illinoi illinoi genet algorithm laboratori genet evolutionari comput confer juli florida adapt natur artifici system ann michigan press
Agents/775 1 repair speech act misunderstand abduct infer susan mcroi hirst toronto agent easili belief mean role utter particip reli expect determin unusu understand presum occur agent inconsist anoth agent chang interpret earlier turn direct accomplish repair describ abduct account interpret speech act repair speech act misunderstand discuss consid kind inform particip interpret inconsist belief consid inform design repair describ map form act relat act belief intent express give relat act act expect follow describ account belief distinguish belief agent act perform act support model misunderstand lead unexpect action utter describ process interpret repair illustr show account repair introduct speech act misunderstand occur particip differ understand role utter speaker utter assert understand request research consid problem avoid misunderstand correct address problem identifi repair misunderstand occur gener model dialogu account detect repair speech act misunderstand differ misunderstand misconcept notion misunderstand misconcept easili begin explic distinct misconcept error prior knowledg depart electr engin comput wi depart comput canada fl associ comput linguist comput linguist volum number believ canada unit state pollack studi problem particip determin misconcept section typic error recogn immedi express interpret respect comput knowledg world particip misunderstand occur particip obtain interpret believ complet particip intend obtain point interpret particip begin diverg misunderstand remain unnot particip continu talk break lead particip decid misunderstand occur attempt resolv repair negoti mean recogn misunderstand particip awar misunderstand occur passiv hope understood activ listen troubl thing particip subsequ order judg previou understood correctli particip produc consist coher displai understand evid misunderstand indic particip interpret ration interpret call displai interpret particip notic discrep interpret displai initi repair pass choic repair accept displai speaker effect negoti mean utter repair depend misunderstand appar analyst classifi repair problemat turn particip initi repair common type occur turn immedi particip chanc repli call repair common occur repli problemat turn request type repair involv misunderstand se correct repair address actual misunderstand displai misunderstand occur turn immedi speaker notic problem immedi act resolv made repair displai misunderstand occur subsequ turn speaker note choic speaker occurr misunderstand order achiev social goal distinguish repair repair correspond repair begin turn problemat arbitrari number interven pair turn refer interven exchang mcroi hirst repair misunderstand make crop grow tin hut gener hearer reinterpret earlier turn produc made repair fragment shown includ repair russ interpret express mother desir find interpret inconsist utter expect mother claim russ recov reinterpret indirect attempt satisfi fox point repair reconstruct initi utter ai reconstruct resembl oper system abduct assumpt prove incorrect dont mr mr teacher intent social inform problem interpret utter involv decid action speaker process involv surfac form state context utter context includ task particip involv prior belief context import speaker set time request express question intent inform rule belief speaker rule interpret difficulti misunderstand addit intend interpret greatli number altern interpret simpli ignor interpret inconsist predomin comput approach base sole infer difficulti constrain interpret process distinct kind plan repair spencer model system address problem incomplet taxonomi error interpret comput linguist volum number sociolog account suggest constrain approach interpret recognit comput model extend intent social account combin strength intent speaker expect decid interpret identifi goal account speaker lack pencil dont hearer interpret utter attempt convei inform goal explain reason goal potenti interpret utter intent account interpret attempt express request incomplet attempt fill inher difficulti approach stop search potenti mean account human commun analysi agent design behavior understand held account agent utter displai understand rule situat prior utter awar rule norm relev current follow depend view consequ choic import convent adjac pair adjac pair sequenti constrain pair utter type creat expect hearer bound produc expect readi justifi action accept infer speaker make sack ca approach weakest explan recipi utter understand utter part adjac pair agent linguist knowledg link featur utter rang speech act form adjac pair agent idea belief intent action make judgment appropri context overview aim research construct model commun interact support negoti mean develop gener model flexibl handl misunderstand support agent model form expect basi monitor differ chang interpret inform model specifi relationship reason particip express knowledg social convent speaker select speech act basi goal knowledg speech act expect follow speech act select utter form parti current accomplish desir goal interpret repair attempt appli amount reason function size plan hierarchi believ questionnair obtain driver drive utter interpret incomplet attempt california hearer assum speaker share plan hierarchi mcroi hirst repair misunderstand process work back observ utter underli goal reason suggest natur abduct model express logic theori priorit theorist framework van structur intent approach introduc model dialogu extend intent social account model unifi theori speech act repair misunderstand unif achiev treat product default abduct model interpret repair model avoid infer goal expect deriv social norm guid interpret model account link social account expect mental state discuss model address ffl control infer observ action expect repli extend infer goal unnecessari wast resourc ffl account nonmonoton interpret product utter nonmonoton form utter make part speaker goal explicit hearer reason abduct account expect speaker differ belief dialogu assum understand speaker manag nonmonoton negoti achiev understand ffl detect correct misunderstand speaker reli expect decid understood hearer identifi appar reinterpret earlier utter respond anew fail identifi commun mislead prematur believ goal achiev ffl altern notion mutual belief model reli mutual belief account speaker achiev speaker achiev social convent guid interpret repair account interpret avoid extend infer requir model standard depend agent expect goal approach perrault litman carberri lambert carberri start appli infer rule identifi agent possibl favor altern extend recogn plan approach begin analysi utter mean infer agent goal approach treat appar conflict expect utter inconsist reason explain inconsist comput linguist volum number model sourc expect convent attitud speech act call linguist intent speech act convent speech act act call linguist expect speaker expect displai understand convent appli expect consist attitud express respond act convent valid reason linguist intent base grice notion reflex intent express linguist intent content speaker intend hearer true speaker intend hearer linguist expect captur notion adjac pair defin linguist shown figur exist speech act bach allen speaker produc express intend hearer recogn refer descript intend find refer intend hearer refer speaker believ content hearer believ analysi provid speech act definit order captur linguist intent add true knowledg strictli knowledg expert recent experi individu share taxonomi speech act linguist intent social group activ special set linguist expect theori support flexibl speaker evalu coher utter view refer displai perspect speaker figur show list attitud act list assum exhaust respect theori connot assum attitud function illocutionari level speech surfac level approach work review interest issu function level note linguist intent express action intend question express intent hearer convent independ invit visit creat expect dinner express intent serv symbol intend intent achiev situat properti hold intent action argu repres sequenc speech comput work cite notion speech repres function relationship surfac form attitud express speaker maier dialogu act probabl induc adjac pair corpu dialogu appoint schedul commun occur differ speaker similar linguist experi develop similar expect work differ expect thing acquaint resolv order avoid social conflict mcroi hirst repair misunderstand set act necessarili suffici handl exampl taxonomi act special select model incorpor small number linguist shown figur act type speech act linguist intent inform inquisit request figur linguist intent turn expect repli request compli figur adjac pair quantit result jose morimoto provid evid adjac pair pair discov analysi real dialogu comput linguist volum number type plan adopt accept lend monei challeng meant offer repair repair bye close figur exampl type coher strategi mcroi hirst repair misunderstand repair model unifi fundament task repair speech act interpret nonmonoton framework speaker knowledg languag repres set default rule rule describ convent strategi produc coher displai strategi identifi misunderstand speaker utter coher gener correspond default infer interpret utter recogn correspond abduct infer theori definit theori goal proposit abduc set assumpt consist abduct appli solut local pragmat problem al stori understand goldman model incorpor gener coher plan close model treat open kind plan figur includ type plan speaker simpli action expect achiev desir illocutionari social norm context goal origin speaker plan mechan utter figur plan adopt utter occur immedi utter accept accept agent perform action elicit partner hearer displai understand accept appropri speaker utter challeng displai understand deni appropri agent challeng presupposit previou action occur immedi utter challeng repair displai displai interpret section fourth occur exchang repair occur repair close signal particip readi termin accept utter figur close misunderstand classifi particip recogn misunderstand occur hearer find speaker current utter inconsist speaker earlier decid interpret earlier incorrect hearer attribut misunderstand speaker repair occur repair occur model address class misunderstand section limit misunderstand speech act entail defer signal repair type repair consid misunderstand disagr object speaker identifi refer express hirst hirst al comput linguist volum number import role attribut utter creat expect influenc interpret subsequ misunderstand difficult result common includ ambigu build model interpret hearer interpret utter manifest model understand prior typic model interpret repres partial complet plan actual belief mutual particip carberri incorpor assumpt relax model account negoti hearer credul speaker particip make mistak relax hearer model distinguish belief speaker claim act dialogu hearer believ model repres altern interpret hearer consid result repair axiomat model architectur model model particip altern act speaker hearer section give knowledg structur enabl particip behavior reason algorithm produc appendix present dialogu involv instanti implement reason priorit theorist model formul priorit theorist framework van support default abduct reason theorist abduct reli theorem prover collect assumpt prove set observ verifi consist reason algorithm base pool implement extend incorpor prefer default suggest van priorit theorist reason assum default programm design potenti prove overrid fact hypothesi make reason addit fact overrid default make prefer syntax theorist extens predic calculu distinguish type fact default pool fact wff default prioriti atom formula free variabl distinct similar made present assum complet model access simul limit work memori limit access recent utter pool theorist implement full clausal theorem prover prolog appli reduc goal subgoal rule form goal subgoal unlik incorpor strategi reason case mcroi hirst repair misunderstand wff express default bird default oe set fact set default prioriti express assert oe languag lack explicit variabl understood quantifi fact true default correspond domain formula assum true fact insuffici explain prioriti integ default ground instanc default prioriti stronger prioriti default stronger lower prioriti set default explan consist default usabl theorist explan process akin scientif theori close formula repres observ logic consequ fact consist set default definit explan set fact set priorit default close formula set set ground instanc element consist satisfi prioriti constraint inconsist prioriti constraint requir ground instanc negat explain default usabl prioriti enabl default stronger repres except default prioriti weak strongest reserv attitud prior assumpt expect weak default assumpt unexpect action interpret weak default prefer expect ambigu languag model model base sort term sequenc languag includ infinit number variabl function symbol sort ariti defin special sequenc turn term proposit agent express thought quot limit syntax semant defin function ffl express agent perform action ffl express agent mistaken act act comput linguist volum number ffl express conjunct simpl form function symbol ffl express negat simpl defin express knowledg intent syntact ident captur notion speaker consist relat express simpl consist complet account account entail express account exist placehold compat relat express approach make compat default defin axiom exclud incompat ffl ffl intent make true true agent interpret ffl perform act linguist incompat agent interpret ffl intent perform act express incompat agent interpret ffl intent true agent interpret check compat verifi conjunct compat implement special danger treat compat default miss intuit incompat case misunderstand detect altern base compat notion consist underli complet logic defin speech act repres utter speech act manner perrault allen cohen levesqu function distinct boolean connect captur express agent repres note human behavior lai peopl express entail utter base case compat approach permit greater flexibl cost flexibl difficulti map surfac descript speech effort requir sentenc total complex problem fine grain reason sentenc prosodi requir sentenc processor interpret inform mcroi hirst repair misunderstand limit surfac languag act show liter form repair abbrevi assum form identifi treat declar sentenc theori includ act repres similar notat turn sequenc turn sequenc repres interpret particip consid time structur level root correspond singl turn order occur time path root leaf repres singl interpret dialogu node sibl correspond interpret turn node repres repair activ interpret defin recent call focu sequenc tree structur captur sequenti structur dialogu state attitud particip account express branch sequenti structur enabl particip retract attitud repair reason altern achiev call turn sequenc focu current turn context order previou state misunderstand defin successor relat turn definit turn sequenc successor turn sequenc ident addit turn turn successor turn presum parser recogn syntact input sentenc hurt analysi input utter question translat request form action altern identifi sentenc speech act end suffix descript speech act end act assert proposit true act assert truth proposit tree structur repres hierarch structur tempor structur lambert carberri comput linguist volum number particip knowledg structur enabl particip behavior reason algorithm produc divid specif particip ffl set prior assumpt belief goal express speaker assumpt ffl set potenti assumpt misunderstand ffl theori describ linguist includ principl interact fact relat linguist act interpret utter set ground instanc assumpt explain utter utter coher repli utter logic select definit interpret utter hearer speaker context ts set instanc element consist satisfi prioriti conflict stronger default appli definit coher utter context ts utter deriv agent linguist assum set meta meta consist meta meta satisfi prioriti constraint solut default reason meta languag predic action coher meta predic action explain mean context ts correspond agent speaker address speaker speech act social repres linguist expect context perform act act relat act default oe mcroi hirst repair misunderstand fact surfac form perform act context appar occurr reason agent utter predic relat appropri potenti interpret evid correct default oe kei differ interpret contextu inappropri figur repair close challeng accept adopt plan intent act figur relationship explan interpret correspond problem explain gener correspond problem explain act interpret gener updat set belief goal assum express context compon repres belief goal particip express assum agent maintain record express repres turn sequenc track current interpret dialogu introduc notion activ respect turn sequenc turn express agent utter speech act model discrimin equal accept altern default account fact surfac form perform act act accomplish surfac form default interpret affect particip understand subsequ turn default weak overridden user influenc default relat concern agent belief chang utter understood act type add perrault show default logic address problem comput linguist volum number displai activ turn sequenc focu section remain activ turn explicitli refut individu turn repres set fact form form simpler function compon model set potenti assumpt misunderstand set theorist theorem prover assum ground instanc predic consist fact default higher prioriti mention section default prioriti weak strongest level reserv attitud belief assumpt expect weak default assumpt unexpect action interpret weak axiom written express prefer expect ambigu predic greater detail discuss compon model speaker theori languag compon model speaker theori commun interact theori includ strategi express belief displai identifi understand broken strategi displai understand suggest perform speech act relationship speech act misunderstand recogn utter inconsist strategi repair suggest previou utter make problem public relat linguist knowledg import linguist knowledg shown circl figur box figur object relat relat link form form accomplish context correspond bodi relat approach speech act ambigu perform surfac level form relat act linguist intent express section relat intend mean turn speaker act repres state express avoid infinit theorist theori default captur persist activ particip assum belief goal pollack call relat mcroi hirst repair misunderstand goal belief express expect form form figur knowledg relat fit captur notion linguist expect discuss section relat act act expect follow expect condit distinguish axiom repres linguist expect shown fact speaker expect make result refer fact speaker expect make result refer belief goal particip actual belief goal distinguish express utter exampl consid model belief simplic chose includ belief goal explicitli initi background theori agent make assumpt belief goal default expect addit notion linguist exist model incorpor notion expect expect depend speaker knowledg social understand controversi valid adjac pair question hearer contrari consid challeng presupposit actual belief set defin weak modal logic current formal account speaker belief mcroi discuss comput linguist volum number belief world time captur theorist default condit repli condit repli condit oe repli fact oe condit rule expect action repli linguist intent incompat context ts expect action held previou state context eventu hold current action incompat agent intend achiev true compat linguist intent action activ context captur predic true incompat section hold defin form expect reason expect result futur action plan consid evalu potenti repair type expect differ type defin depend real belief agent perform part adjac pair depend activ action fact misunderstand encod strategi select act axiom refer expect order preserv requir linguist intent suggest action compat context acknowledg discrep theori present address handl ad extra default stronger prioriti tabl give axiom detail speaker linguist theori includ diagnost axiom speech act axiom refer ambigu inconsist express linguist expect tabl describ observ inconsist perform anew symptom misinterpret earlier act mistak surfac form earlier act accomplish observ intend activ activ higher prioriti assumpt memori stronger expect surfac form accomplish case desir evalu likelihood altern choic work discuss maier found statist regular misinterpret occur corpu dialogu mcroi hirst repair misunderstand default misunderstand lower prioriti speaker misunderstand coher interpret prefer coher interpret import act utter decomposit tabl plan adopt introduc goal axiom default oe fact oe summari speaker action ts speaker action expect follow action adopt plan perform trigger linguist intent compat tabl accept produc expect repli axiom default oe fact oe summari speaker action ts expect occur accept interpret ts comput linguist volum number tabl repair recov misunderstand axiom default oe fact oe summari speaker action ts mistaken instanc act instanc act reconstruct expect perform repair tabl repair recov speaker misunderstand axiom default oe fact oe summari speaker initi repair ts speaker perform action appar mistaken instanc act act expect follow perform repair reason compat perform mcroi hirst repair misunderstand tabl detect misunderstand axiom default anew oe anew fact fact summari speaker attempt action anew ts perform action linguist intent anew inconsist linguist intent action perform similar speech mistaken tabl detect anoth misunderstand axiom default anew anew oe anew fact oe summari speaker attempt action anew ts speaker perform act perform similar surfac perform anew mistaken comput linguist volum number detail show abduct account repair offer exampl show repair detail reason turn show output trace implement system demonstr detect product repair appendix show system output interleav perspect particip overview repeat dont mr mr teacher input repres dialogu sequenc utter interpret time russ hear decid interpret mother turn incorrect lead reinterpret provid show belief progress address ffl russ conclud respond ffl russ hear mother earlier incorrect ffl russ decid produc figur show output system turn perspect mcroi hirst repair misunderstand initi assumpt assum russ believ meet mother knowledg meet accur repres belief fact fact fact assum russ believ fact assum linguist expect section turn russ decid mother russ hear mother interpret attempt construct plausibl explan requir tent act basi decomposit relat attempt abduc intent displai understand symptom misunderstand theorist call explain utter return list assumpt made complet explan portion output updat describ interpret figur explain intent explan assumpt mother part plan russ question reason attribut linguist intent complet explan detail infer begin call theorist explain utter explain find speech act accomplish misunderstand explain act make default oe satisfi reason find speech act relat surfac form prioriti express belief manag assum expect life comput linguist volum number explain formula number linguist intent agent adopt plan figur output turn perspect mcroi hirst repair misunderstand possibl mother attempt consid system repres default simul choic import note explan russ belief rule abduc explan interpret satisfi reason kind explan hearer assum act fulfil speaker intent coher extend understood assum type misunderstand occur utter start adjac pair coher russ find type explan plan explain relev default repeat default oe default oe condit satisfi plausibl goal act mother achiev consist russ assum achiev act goal evid mother adopt linguist intent incompat consist assum mother intend plan russ infer linguist expect oracl analyst test interpret possibl admit utter displai mistaken belief initi knowledg introduc explicitli misconcept address consid previou utter part adjac explain utter accept challeng comput linguist volum number fact explain number linguist intent agent perform expect figur output turn perspect turn russ decid respond turn russ produc utter independ russ displai accept mother perspect displai perform act expect model turn shown figur theorist find russ accept mother perform demonstr accept expect act deriv act reli rule intent action shown earlier section accept repeat russ decid produc account justifi action displai accept mother displai understand includ explicit reject mcroi hirst repair misunderstand assum mother produc turn hear intent reason russ explan includ assumpt part adopt plan produc explain abduc russ attempt consid explan inclin make repair im plan adopt tabl mother plausibl explan explain mother linguist expect creat expect listen speaker fact credul goal explain belief perform expect linguist intent compat consist assum russ intend part plan consist context express mother russ plan explain assum mother demonstr accept figur mother interpret default repli repli oe repli expect section ffl true ffl linguist expect follow ffl russ believ condit ffl linguist intent compat express turn russ decid interpret turn wrong mother repli interpret act signal linguist intent figur mother interpret turn comput linguist volum number explain formula number linguist intent agent act figur output turn perspect mcroi hirst repair misunderstand incompat rule explan default intent act figur show theorist abduc attribut misunderstand incorrectli interpret mother utter explan condit default explain repeat rule sketch default default mistak anew observ observ observ intend mistak intend observ oe anew fact mistak fact mistak activ interpret incompat happen linguist intent linguist intent intent incompat inconsist hold linguist intent demonstr linguist intent compat interpret attribut expect attribut misunderstand russ mother express assum default comput linguist volum number plausibl mistak act surfac coher consist assum misunderstand explain result ad model fact addit termin activ turn russ real belief basi reconsid theori account turn russ perform repair understand turn russ perform displai accept interpret theorist call find coher act default intent find russ perform repair repeat similar involv reconstruct model default repli intend observ ts reconstruct repli ts reconstruct oe repli appli russ prior utter reconstruct reconstruct expect repli russ expect section reconstruct dialogu ffl linguist expect adjac pair ffl russ believ mother make displai accept recogn russ mcroi hirst repair misunderstand ffl linguist intent compat reconstruct explain turn number number linguist intent perform fourth turn repair figur output turn perspect relat work account base plan recognit account interpret speech act chain action effect precondit action identifi plan set includ observ act heurist appli discrimin altern allen perrault allen perrault perrault allen show plan recognit understand indirect speech act pass polit request pass interpret approach appli set infer rule identifi plausibl comput linguist volum number plan rule speaker truth proposit proposit made true final interpret determin set rate rate path action effect true time action rate heurist problemat conflat linguist pragmat knowledg knowledg search mechan approach depend relationship utter plan unabl handl utter directli relat domain plan consid problem indirect utter anticip explan includ subtask kind infer infer limit hearer goal expect common indirect explain exist social convent make expect litman work litman attempt overcom limit allen perrault approach extend plan hierarchi includ addit plan includ clarifi recogn identifi cue phrase add flexibl number add problem prune order requir addit heurist specif rule altern basi clue implicit default prefer litman add gener stop chain ambigu resolv carberri lambert carberri similar approach model introduc set goal recogn basi current properti dialogu model mutual belief particip goal set candid plan heurist appli subsequ work lambert carberri introduc level plan link act domain plan process elimin heurist loss mechan recogn goal specif carberri implement method extend perrault allen infer rule approach produc repair suggest includ inform captur rate heurist assum default rule captur handl suggest default retract utter interpret depend belief simpli reinterpret belief step approach miss point particip negoti mean precondit influenc interpret extent provid support evid explan mother knew russ mcroi hirst repair misunderstand albeit russ suspect mother chosen treat utter confirm suspicion delai answer traum work incorpor abduct reason model utter interpret model treat featur mood sentenc presenc lexic manifest speech act procedur test featur input suggest candid system remov candid inconsist prior belief traum extend work gener notion speech act act act assum understood posit evid hearer formal logic theori includ ground act acknowledg unlik speech ground act organ grammar ground act violat grammar recogn traum suggest violat trigger admit repair request model repair utter traum allen extend work includ notion social serv expect model account speech understand word differ expect speech context refer word utter comput user perform action expect type statement background knowledg statement underli statement relat task step subgoal task task follow statement accomplish expect independ belief state agent semant level inform long discrimin ambigu interpret correct mistak made speech recogn smith utter interpret expect match close approach account refer agent belief futur utter relat prior expect determin agent understand typic behavior mental state notion expect complimentari dialogu model speech input repres reason interpret pragmat forc inconsist rule ground elimin interpret cue type repair chose incorpor riesbeck comput linguist volum number approach misconcept misconcept deficit agent knowledg barrier understand agent evok concept relat prevent misconcept trigger agent check evid misconcept resolv appar error symptom misconcept includ refer entiti map object oper mai request clarif error correct replac delet part problemat utter make correct strategi ffl gener descript select ignor constraint goodman carberri carberri ffl make descript specif ad extra constraint carberri ffl conceptu combin gener constraint oper strategi achiev entiti correspond step strategi replac step strategi carberri carberri moor approach prevent class prevent approach trigger misunderstand find lack mechan detect previou repair inappropri particip address actual misunderstand collabor resolut concentr repair colleagu edmond repair differ situat agent deriv interpret utter initi unawar agent deriv interpret problem immedi appar edmond case refer express utter understood hirst edmond hirst al clark colleagu clark shown collabor repair problem negoti reconstruct elabor refer express edmond model plan recognit gener system recogn faulti plan repair copi system negoti refer refer express understood recogn refer plan repair present refer plan approv human produc recipi utter determin interpret chang mind face mcroi hirst repair misunderstand inform dialogu particip negoti mean utter respond hearer decid speaker goal expect hearer evid constraint speaker speaker displai challeng directli decid respond hearer infer misunderstand goal work construct model commun interact support negoti mean consid inform sourc reason process agent determin belief goal expect utter previou model dialogu tend repres mean global make pure structur pure intent give minim attent ffl agent model ffl agent reli structur intent inform ffl agent distinguish intend action misunderstand ffl agent interpret utter basi expect deriv previou utter expect futur action predict utter interpret ffl agent detect repair misunderstand work provid step unifi account repair primari contribut work treat misunderstand repair core languag abil account process mechan account normal speech interpret repair treat explan model abduct order account repair captur agent interpret repair independ actual belief dynam mental artifact object belief repair record agent refer altern interpret repair process potenti enabl recov reject repair address problem work facilit effort build natur languag interfac recov mistak user acknowledg work support natur scienc engin research council canada rai reiter suggest abduct jame allen advic tempor logic hector mike sheila stephen comment formal aspect work david susan dian raymond mark evan review comment draft paper thesi base refer comput linguist volum number jame recogn intent natur languag utter michael robert jame comput model mit page jame raymond perrault indirect speech act annual meet associ comput page kent robert linguist commun speech act mit press speech act mental state mountain confer artifici pragmat artifici page la mexico gerhard prefer extend logic framework default reason intern joint confer artifici page mi randal util user model handl ambigu misconcept robust plan recognit user model sandra pragmat model inform system interfac phd delawar sandra pragmat robust natur languag interfac comput sandra model user plan goal comput sandra plan recognit natur languag dialogu mit ma belief model repair sequenc dialogu direct intellig tutor system springer verlag eugen robert goldman logic semant interpret annual meet associ comput page ny herbert arena languag chicago center studi languag chicago herbert refer collabor process philip intent commun mit page philip hector levesqu speech act ration annual meet associ comput page chicago philip collabor refer object mutual intern confer comput linguist page kyoto sandra carberri approach flexibl plan recognit dialogu user model correct input expect applic speech understand comput barbara interact reconstruct languag process cognit bradlei repair refer identif failur relax annual meet associ comput page chicago mean philosoph peter hirst collabor refer express comput elizabeth ann linguist pragmat constraint utter interpret phd depart comput york publish rochest comput scienc technic report mcroi hirst repair misunderstand susan peter philip dian repair misunderstand speech jerri mark paul dougla edward interpret abduct annual meet associ comput page jerri mark dougla paul martin interpret abduct artifici paul sequenti speech act structur journal psycholinguist lynn sandra carberri model dialogu annual meet associ comput page ca lynn sandra carberri model negoti dialogu annual meet associ comput page delawar dian linguist altern annual meet associ comput page york autom theorem logic basi netherland susann multimod user interfac dialogu peg annual meet associ comput page delawar kathleen role perspect respond properti misconcept ninth intern joint confer artifici volum page kathleen respond misconcept perspect annual meet associ comput page kathleen reason highlight user model respond misconcept comput kathleen gener object misconcept artifici margaret talk organ sage hill susan abduct interpret reinterpret natur languag utter phd depart comput canada publish technic report depart comput scienc susan belief effect act introspect aaai spring symposium reason mental formal theori page stanford march respond answer vagu articul question confer human factor comput system page tx acm press publish special issu sigchi bulletin morimoto statist dialogu model predict speech act type utter intern symposium spoken japan raymond applic default logic speech act theori philip jerri martha intent commun mit page earlier version paper publish technic report center studi languag inform raymond jame allen analysi indirect speech act comput martha infer domain plan technic report tr artifici intellig sri menlo ca comput linguist volum number martha model plan infer distinguish belief actor observ annual meet associ comput page york martha plan complex mental attitud intent commun mit page randi roma logic reason system default diagnosi nick cercon gordon knowledg essai knowledg page publish research report faculti norbert elisabeth maier util statist dialogu act process annual meet associ comput page june comput analysi sentenc context technic report comput scienc stanford nc appli speech act theori ordinari journal repair structur provid american journal harvei sack open close comput model dialog phd depart comput duke nc bruce assimil plan recognit truth mainten reduc redund phd depart comput waterloo prolog technolog theorem prover journal autom sequenc social scienc work paper school social irvin david jame allen oblig dialogu process annual meet associ comput page la nm david elizabeth act spoken dialogu comput special comput approach languag ami sequenc rule coher journal vijai experi program full logic symposium logic ma ieee comput societi press van paul nest default reason user model phd depart comput ontario publish depart research report marilyn redund collabor dialogu aaai fall symposium structur natur languag understand page pacif novemb lynn eric mai varieti user detect correct eighth intern joint confer artifici page karlsruh repair appendix annot version output repair result simul copi belief assum time dinner believ mcroi hirst repair misunderstand dinner im dont believ time time dinner notic belief belief believ fact fact fact fact assum speaker believ time suspect believ fact fact fact show output side show perspect speaker box text speaker gener request satisfi dinner comput linguist volum number explain number agent adopt plan mcroi hirst repair misunderstand speaker interpret utter explain formula formula number agent adopt plan speaker produc repli linguist expect test suspect answer thing explan expect default belief agent answer agent possibl respond express inform initi speaker answer dont comput linguist volum number explain number agent perform expect speaker recogn speaker produc misunderstand request explain formula number mcroi hirst repair misunderstand agent speaker produc im explain number perform turn repair speaker recogn comput linguist volum number explain formula number agent speaker produc dont mcroi hirst repair misunderstand explain turn number number perform fourth turn repair speaker utter accept initi request explain formula comput linguist volum number number agent perform expect
DB/776 3 sentinel multipl engin inform retriev visual system kevin fox frieder margaret eric abstract describ prototyp inform retriev develop harri corpor inform system sentinel fusion multipl inform retriev integr vector space neural network train rule primari advantag sentinel visual capabl base fulli mathemat inform sentinel visual capabl user intuit relev refin techniqu result higher retriev accuraci introduct inform retriev system search retriev data collect document user queri volum data render tradit inform retriev system ineffect product environ data volum continu increasingli difficult develop engin support search retriev search time larger data collect necessit interact paradigm formul accur mechan intuit present result user inform retriev system describ prototyp inform retriev engin develop harri support effici intuit present document user queri accuraci measur evalu inform retriev system recal recal ratio number relev document retriev total number relev document ratio number relev document retriev total number document retriev interact user requir highli relev document form gener assess topic detail knowledg obtain read relat document time constraint limit user review top document determin result queri accur satisfactori retriev time accuraci recal potenti recent user studi conduct excit corpor demonstr percent user screen document return queri studi conduct wide rang oper environ shown averag number term provid user input rare greater target user sentinel system adher similar usag pattern high effici search time vastli critic high recal meet user demand sentinel design yield high retriev search word user provid form queri refin enhanc sentinel visual user capabl user friendli visual user focu kei aspect search queri graphic present relationship document base aspect queri understand user modifi search queri focu aspect sentinel fusion multipl retriev integr vector space model high sentinel deriv provid user multipl input interact fuse result obtain multipl inform retriev search support retriev support relev feedback mechan accuraci improv obtain fuse result multipl engin demonstr fuse differ retriev techniqu similar retriev engin demonstr weight research fund harri corpor intern research develop program harri corpor inform system po box fl depart comput scienc appli illinoi institut st il sentinel individu retriev engin modifi favor engin base queri type present retriev strategi reader refer varieti recent refer includ user understand retriev document set enhanc visual call tm tool support multipl level data cluster document data varieti user interact paradigm document visual displai enabl user view aspect document topic sentinel reduc displai import aspect document displai document space enabl user document relationship document aid document identif document identifi relev document sentinel easili review topic relev user manipul view gain view document relationship chang document inform view topic aspect aid identif relev document sentinel overview sentinel implement design emploi tm object design basic structur sentinel includ web user interfac user mechan build queri topic execut examin retriev build addit refin exist queri multipl retriev technolog util vector space model queri document corpu fusion compon combin rank retriev result individu engin viewer user mechan explor aspect retriev addit relev document user begin defin topic proce defin queri topic user queri sentinel form phrase document document cluster sentinel interact approach assum inform found user iter refin queri sentinel user review document select document relev topic relev document queri refin topic user quickli queri data addit queri sentinel retriev engin goal combin multipl differ retriev technolog leverag strength approach develop robust shown tabl tabl retriev engin strength weak vector space model strength uniqu term proper document input word document mean short document weak long document uniqu term proper noun term train corpu vsm sentinel sentinel emploi filter base work frequent sentinel slide window typic earli search act filter quickli identifi candid document review earli retriev process phrase dictionari vector space model retriev engin vector space model context vector sentinel vector space model repres document vector space word document train corpu repres vector word normal unit length lie unit similar word measur comput cosin similar measur measur cosin angl vector higher closer smaller angl vector word vector unit cosin similar measur reduc vector construct base term document queri treat document document queri compar compar respect vector vector space document measur term correspond close content queri judg relev document retriev word cluster document queri map vector space document vector close coincid queri vector retriev keyword singl document cluster provid input sentinel vsm queri construct sentinel vsm broadli narrowli depend document queri document score obtain comput measur queri document document score rang neg score irrelev document test reveal score relev document typic rang approxim closer document match queri experi shown strongest perform sentinel vsm result document document cluster pass top queri result review identifi relev irrelev relev document queri input pass sentinel vsm context vector train neural network train algorithm sentinel train word vsm nn train algorithm base train rule kohonen map learn algorithm organ vector space base featur train data item similar usag cluster word train repres sampl document process system heavier weight word closer proxim nn account train place adjust train word train algorithm shown figur sentinel figur neural network train rule initi context vector word dictionari valu vector chosen vector scale unit train epoch train document set set adjust context vector account proxim word weight heavili word closer proxim account train place adjust highli train word algorithm context vector context vector learn rate word neighbor adjust renorm increment word document increment calcul context vector document word adjust word context vector closer document context vector steer word document cluster similar mean vector space context vector word context vector entir document learn rate adjust renorm note earli larger document context vector random word train domin shrink rapidli word train continu document finish train epoch increment reduc ensur train updat small word train sentinel applic nn train rule vector word similar mean defin similar usag document converg complet word assign closest axi vector space axi repres direct vector space word assign closest axi highest cosin similar ax document reduct document reduc remov perform insert compound word document reduc count number word axi retrain ax highest count word document repres figur show percentag word document ax reduct reduct figur show document reduc ax figur percentag word ax document reduct reduct ax reduct ax figur text document reduc snow nevada boi charg spark blaze june nevada gain ground tuesdai nevada fire char gut home forc thousand resid lake taho sundai fire feder fire offici call worst start annual season recent memori season nation interag fire center nevada fire percent expect full wednesdai morn mike conwai suffer burn trap middl nevada fire film jump back pickup truck escap sentinel reduc number word document reduc time gener intern document improv queri match elimin low content word determin reduc result remov determin word document similar result note test result obtain document collect web stori shown topic peopl thing search start set nobl hall search perform document origin document show result keyword search reduct level figur score recal drop document reduc word retriev start show improv reduc document relev document found top reduct pass defin queri figur show result keyword document search recal document maintain highest rate document minim reduct start lower recal score figur recal result vsm compon sentinel document ax reduct level keyword retriev word retriev recal recal recal word retriev document figur recal result vsm compon sentinel document ax reduct level keyword document retriev word document retriev recal recal recal word document retriev document sentinel mathemat document inform document store document context axi context vector document context sum word document reduct build singl document queri compar document queri mathemat document mean built time doesnt recalcul queri document axi context vector sum word axi vector document clean reduct document context vector build queri document cluster displai implement vector space model count frequenc occurr word phrase build document queri frequenc count individu document file document corpu data frequenc count updat queri built highest frequenc count necessit comput time sentinel creat mathemat build queri mathemat consist group word compar mathemat offer ad document corpu requir recalcul word occurr frequenc larg index requir vector small document reduc minim calcul requir build posit neg queri document recalcul requir document size independ similar equat simplifi queri build repres context posit queri combin singl word singl document queri entir queri multipl document build document ax highest usag build queri tabl show document vector size build posit queri queri built axi highest axi usag relev document default axi document highest ax user lower number ax build queri build multipl document document similar irrelev document retriev build neg queri similar build posit queri frequent frequent ax relev document rel axi bad document tabl show neg queri built frequent ax respect good document build neg queri user lower number ax tabl posit queri tabl neg queri queri relev document bad queri axi ax axi ax sentinel rank sentinel initi retriev engin calcul document score queri retriev engin maintain high level score user adjust lowest accept score retriev engin weight effect score result retriev engin rank algorithm fuse result retriev engin rank document base number time document highest lowest averag locat queri list number retriev engin locat document irrelev document queri remov user specifi lowest accept score retriev engin elimin lower score document control number document shown user higher fewer document shown user document reveal match queri retriev engin assign specif percentag document score retriev engin reduc percentag depend queri retriev engin potenti misspel word put emphasi retriev document queri place emphasi vsm retriev engin scale sentinel standard score retriev engin rang topic multipl queri retriev compon score scale queri entir topic set score separ entri rank algorithm vsm scale queri document vsm entir vector axi vector score obtain cosin similar measur queri vector entir vector document corpu score rang closer match high posit score document score equal document scale base highest score queri quick method score potenti relev vsm fuse vsm highest result start experi appli cosin similar measur queri vector axi document corpu initi experi shown word queri limit number ax examin scale retriev engin count number occurr frequent term earli search topic filter quickli identifi candid document review earli retriev process engin keyword phrase document corpu train vsm compon identifi relev document pass sentinel select due speed process small amount storag frequenc tabl frequenc count vari exampl trec shown tabl text retriev confer yearli event sponsor nation institut standard technolog evalu inform retriev system approach trec standard data queri evalu queri select trec collect rang correspond standard rang present challeng divid largest number provid good document tabl rang trec data queri queri queri file sentinel file match largest match file examin document match occurr examin document larg number document document divid high scale document match remov scale calcul match consist larg number document coupl match rang document high match larg number match singl document document examin set remain document scale scale identifi document match review score algorithm algorithm develop rank document score retriev engin algorithm rate number time document identifi queri retriev engin maximum score minimum score averag score penalti point item penalti point item higher number lower score individu item lowest final score document penalti point assign document base number retriev engin locat document document locat individu queri list penalti ad document retriev engin identifi relev multipl engin retriev document strong indic document relev relev correl shown score minimum accept calcul scale retriev engin weight recent test system team lot emphasi number time file identifi multipl queri multipl retriev engin locat file set high penalti valu brought relev document top list type data identifi valu assign paramet score algorithm queri score put final list document list locat individu queri algorithm modifi document receiv penalti point locat individu queri list intend reward document locat close top list individu assign fewer penalti point sentinel user interfac visual primari user interact sentinel user interfac user build tailor queri topic interest move gener search specif topic area queri input queri consist singl multipl keyword keyword cluster document cluster set document retriev topic exhibit varieti aspect stori citi bomb relev articl damag bomb rescu timothi terri nichol appli sentinel search document relev trial timothi citi bomb document corpu consist stori cnn web site varieti topic user begin creat topic trial queri topic user creat queri enter shown figur user sentinel execut queri illustr figur rank list complet sentinel return user click document retriev text html enabl user determin point document topic top document relev irrelev document identifi mark irrelev document filter subsequ queri remov irrelev document lower score document accept final result list document mark exampl addit queri topic figur begin topic initi keyword queri consist keyword figur result queri displai rank order list relev document ad list queri document enhanc user understand retriev document set tm visual visual tool support multipl level data cluster document data varieti user interact paradigm document visual displai enabl user view aspect document topic tm displai intuit displai document relationship similar sentinel reduc displai import aspect document citi bomb stori number build victim timothi displai document space enabl user document relationship document aid locat addit document relev queri document identifi relev document sentinel easili review topic relev user manipul view gain view document relationship chang document ax inform view topic aspect aid identif relev document illustr figur document retriev document corpu repres mathemat space color cube red cube repres queri request case word yellow text relev document found text queri submit sentinel color document cluster document relat aspect notic relev stori separ stori sentinel figur displai perspect corpu retriev document dimens base stori queri notic relev stori separ stori separ figur aspect stori reveal configur user user quickli identifi area focu search document identifi doubl click box bring make inspect determin relev timothi trial figur retriev view keyword queri find stori timothi trial figur screen shot dimens show aspect retriev document set sentinel prototyp provid inform retriev visual system interact format queri refin fuse result form multipl retriev engin leverag strength design effici make easi add document sentinel multipl dictionari vocabulari user develop dictionari vocabulari sentinel base interfac user interact viewer explor document retriev user queri part evalu particip visual compon visual capabl accuraci result person significantli gain greater understand queri result visual compon continu enhanc sentinel improv system perform capabl refer sentinel frieder inform retriev engin intern confer parallel distribut process techniqu applic la juli bruce peopl inform novemb marc similar languag independ categor pp larri fitzpatrick mei feedback past social pp susan fusion david data relat journal american societi inform februari david grossman ad hoc inform algorithm kluwer academ simon neural ieee macmillan colleg publish marti hearst interact interfac search view retriev result larg categori pp annual intern acm sigir confer research develop pp robert inform storag john wilei associ ho evid annual acm john harri patent number karen peter read inform morgan kaufmann aravindan russel graphic displai retriev pp jack excit person commun frieder david novemb text scan algorithm util ieee symposium direct sentinel
Agents/777 1 foreign event handler maintain inform consist system adequaci februari introduct goal paper describ applic mobil code technolog feasibl current knowledg domain applic contradict observ mobil code techniqu bring possibl exist technolog distribut applic class problem receiv attent manag current environ problem maintain consist dynam inform maintain system adequaci chang requir custom motiv quantit improv peopl expect mobil qualit benefit import recogn mobil code commun convent messag pass process interconnect mobil code high level encod synchron primit agreement fraction commun context depend aspect encapsul insid mobil code chang context encapsul benefit softwar engin reduc depend reduc number modif make softwar order adapt requir reason cope system manag singl person inform chang world evolv user discov wai inform provid basic idea hook foreign mobil code run applic interf basic function execut mobil event handler perform task connect applic interest small number addit constraint origin design system complet adapt futur inform manag problem order build system work long period time anticip happen kind dynam deal dynam world peopl object book system account reflect inform offer anticip build good model world system base detect event handl dynam system posit paper submit workshop mobil agent context competit cooper autonom agent confer centr universitair broadli speak system handl event world dynam cope appli principl publish subscrib principl publish subscrib event notif gener long comput exist natur pass inform interest parti present context todai inform electron mail list insid applic underli design pattern difficult anticip user success inform system system invent wai discov requir complet unpredict satisfi system evolv experi show system evolv tend obsolet replac power competitor disappoint valuabl principl publish subscrib accommod potenti user fact design system provid access inform buri system event kind subscript interfac design inform observ notif propag user scheme extens sooner limit instanc interest event propag propag scheme difficult wide system lot user conflict upgrad incompat product phenomenon occur success protocol http instal million quickli gener solut exist imposs adopt cost upgrad interconnect host risk introduc incompat concern difficulti peopl collabor order maintain inform system larg distribut system belong entiti collabor instanc user support servic develop find solut system collabor solut base mobil code solv problem previou possibl offer mobil code encapsul convent adapt protocol extrem valuabl goal mobil code minim number convent requir anticip collabor solut relat technolog mobil mobil strong weak gener mobil code paradigm necessarili straightforward implement current mobil code environ case design inform system give attent commun issu phase kind mobil code execut environ integr system basic commun system send mobil code local interact interact place thread trigger mobil code visibl part servic interfac typic extern softwar entiti retriev updat inform watch event occur system mobil code written servic design consum special collabor servic design good understand interfac encapsul low level commun mobil code system remain underli network evolv unpredict wai attempt design interfac distribut servic describ complex interfac definit languag puzzl guess event interest servic user conveni access inform reason hidden system remain open inspect attach mobil code remov outer shell system foreign access inform directli inform encapsul object level granular smaller consequ work larger set action event mobil code attach kind system disturb restrict feasibl polici foreign handler inspect object instal trigger object receiv messag method research reach identifi work object granular trigger event handler object receiv messag exampl applic typic lack inform manag bad event handl problem broken link world wide web phenomenon time peopl referenc bookmark interest page definit locat move destroi site manag reorgan document mobil code eleg solv difficult user interest write agent send server properli hook agent readi execut page move delet instanc send fix hyperlink client side system perform distribut schedul distribut resourc alloc interest candid depend resourc depend impli frequent constraint check complex event handl inform date difficult constraint user busi process resourc constraint depend evolv peopl thing move chang peopl person electron organ resourc place vehicl agenda easi imagin complex interrel interest program agent check constraint detect inconsist instanc wife accept invit free seminar room easili work comput notion mobil find realist exampl domain multimedia system sourc code electron scientif reason larg class import problem isol case technic issu find satisfactori solut problemat applic approach mobil code foreign event handler approach free practic pitfal recent research mobil code fairli good answer memori limit consumpt server memori custom event handler appli principl sell server memori custom spare main system overload evalu event handler prioriti distribut load server condit simpl complex condit lot decid start quickli extrem environ java provid authent verif foreign code authent base encrypt determin code origin trust sourc verif runtim mechan ensur untrust code perform illeg oper problem fundament challeng inspect instal contradict principl encapsul larg depend make difficult manag reciproc mechan ensur event handler obsolet action user environ complex system interrel inform lot circular depend lead type infinit loop classic solut order hierarchi element avoid loop open system inspect facil requir lot effort secret imagin system design hide encapsul preciou inform object cryptograph techniqu hide sensit data exist system intern inform event difficult integr approach relat work recent effort build distribut evolv dynam inform system direct program languag mobil code built system manag librari sourc code dissemin activ kind sourc code file difficult manag store text file repres interdepend maintain consist document websit make access foreign event handler work earli stage slow difficulti integr exist server html editor institut group work techniqu larg scale event handl maintain inform coher system awar close approach goal mobil code distribut inform weather inform forecast system design servic program set agent custom paramet activ agent monitor current weather situat send messag specif system interest show feasibl lot user execut agent server hope paper convinc reader mobil code bring flexibl distribut system abil encapsul convent free softwar behav convent urgent flexibl todai commun protocol distribut system imposs anticip success system evolv user add interact protocol run system mobil code minim collabor inform provid consum interest problem mobil code solut occur system distribut manag singl person dynam inform chang world evolv user discov wai inform provid refer mobil agent kurt fritz mobil berlin lectur note comput vol isbn distribut servic messeng case distribut phd open direct mobil unpublish slide present design framework event observ sixth european softwar engin sigsoft symposium foundat softwar structur comput phd
Agents/778 1 introduc trust parti mobil agent paradigm uw wilhelm sebastian laboratoir de institut pour le commun informatiqu applic ecol polytechniqu de switzerland abstract mobil agent paradigm gain accept creation distribut domain electron commerc mobil agent roam global internet search servic owner problem approach malici servic provid agent itinerari access confidenti inform agent tamper agent articl identifi trust major issu context pessimist approach trust prevent malici behaviour correct approach reli trust hardwar devic mobil agent mean protect show approach limit protect mobil agent user extend protect mobil agent trust parti order full advantag mobil agent paradigm introduct approach distribut comput base mobil agent voyag consid innov idea structur distribut applic interest econom import class mobil agent electron commerc typic mobil agent domain electron commerc includ agent roam global internet search servic user owner servic provis physic execut search inform notif occurr event agent configur user relev inform desir constraint defin condit offer servic provid list potenti provid servic migrat site servic provid order locat offer servic sought user final transact chosen servic provid agent vulner execut execut platform servic user obtain protect agent mobil agent hold data payment final payment data princip servic entitl receiv payment malici servic provid obtain data payment method provid servic tamper agent order trick accept malici provid offer remov inform offer memori usual approach provid user protect assum servic provid trust princip creat mechan enabl user detect provid itinerari notion trust long recogn paramount import develop secur system conceiv system authent user trust function hold authent inform mean trust notion trust princip defin approach reader left intuit articl address question trust princip motiv base technic reason present pessimist approach trust prevent malici behaviour correct occur approach reli trust hardwar devic enforc polici polici properli agent advantag order protect inform possibl malici servic provid mobil agent paradigm identifi interact owner agent configur executor ident servic provid protocol secur relat concern requir addit parti trust parti princip call trust parti due trust function realiz trustworthi site princip mobil agent paradigm interact server classic mechan approach protect mobil agent regular appli mobil agent full advantag mobil agent paradigm remov remot messag interact princip section introduc model mobil agent point problem relat trust model section discuss notion trust defin relat enabl assess motiv trust section introduc trust hardwar devic defin execut agent section show approach protect agent regular user section discuss adequ approach problem effect notion open system section conclud paper summari main contribut mobil agent paradigm mobil agent paradigm identifi author innov approach structur problem distribut comput live discuss shown singl compel reason favour mobil agent paradigm classic approach author point mobil agent paradigm interest solut instanc context mobil agent mobil comput order accomplish task behalf user disconnect commun network user agent return report result task problem encount agent server hold larg amount unstructur data search specif inform user customiz servic provid offer small number simpl oper servic interfac combin agent obtain desir function resid stationari agent resid servic provid handl simpl routin action owner commun manag mobil agent decid handl incom commun basic definit focu underli technolog implement requir simpl model agent discuss identifi major abstract associ mobil agent mobil agent consist current execut marshal agent owner transport format subsequ agent executor agent confidenti integr protect transit prevent attack cryptograph mechan mechan provid data origin authent marshal agent agent executor eventu agent instanti special environ locat agent call agent platform mobil agent interact servic local ap agent locat ap continu accomplish task owner literatur agent distinguish approach support agent weak mobil strong mobil automat support transfer current execut state agent agent visit singl ap refer current execut state explicitli encod agent data migrat ap approach automat support transfer current execut state agent continu execut left initi migrat mobil agent easili visit ap deem accomplish desir task result agent remot execut directli agent owner form messag execut state agent extract agent owner agent return reason provid weak strong mobil execut environ ap agent transport format simpler ap provid current execut state java virtual transport format encod agent visit singl support weak trust model simpler damag incur agent ap agent ap agent agent easili attribut entiti princip problem account difficult princip defer damag action princip agent itinerari articl concentr protect mobil agent ap agent visit site repres multipl instanc problem main concern protect agent data undu manipul undesir disclosur agent question trust agent executor trust exampl agent confidenti inform servic agent inform accomplish shop agent system hold data give bargain advantag servic provid maximum price servic user pai lowest qo accept inquir servic agent electron commerc hold privat kei sign messag behalf confirm order agent kei secret prevent servic provid sign messag behalf agent owner agent person inform system privat data custom owner find inform agent search movi interest person inform user special agent executor infer simpli observ agent choic agent search inform stock depend owner convei sensit inform mere request convei interest threat mobil agent convent mobil agent agent owner send mobil agent agent executor order agent owner lose control code data agent agent executor engin agent analyz agent arbitrarili chang agent code direct attack experi agent feed arbitrari data reset initi order observ agent constel put agent executor stronger posit agent owner agent owner simpli trust agent executor method obtain confidenti inform agent carri order servic agent owner control behaviour agent executor reason imbal agent executor agent owner mobil agent model compar princip model agent owner whatsoev execut agent client reli basic implement type behaviour client part distribut applic implement convent agent system code execut code execut code reli accur time due fact client implement physic control servic observ happen system notic irregular react interrupt ongo transact log irregular client side provid evid case disput server mobil agent log data easili delet agent executor intend creat environ mobil agent base execut assumpt similar mobil agent protect malici agent executor notion trust mention import trust secur distribut system point lack clear definit meant term trust trust princip present analysi trust relat princip reason lack clear definit trust trust social technic issu difficult tackl technic approach major problem stem fact notion trust mix goal princip behaviour achiev goal order trust concur approv goal behav definit separ issu identifi polici consist goal princip polici set rule constrain behaviour princip conceiv situat written made princip interact polici defin trust princip belief adher publish polici question princip trust consist check publish polici order decid accept establish motiv belief adher publish polici difficult support formal specif secur polici approach problem difficult formal depend belief adher publish polici identifi fundament approach problem optimist approach pessimist approach optimist give entiti benefit assum behav punish violat publish polici pessimist approach prevent violat publish polici advanc effect constrain action princip conform polici approach advantag disadvantag optimist approach approach easi requir special measur make trust interact reason basi busi conduct todai requir reliabl mechan discov polici violat occur mechan approach blind motiv princip adher publish polici assert blind trust weak foundat trust recommend import valuabl transact import make probabl polici violat discov high improv control establish checkpoint polici violat discov attribut particip princip punish law damag polici violat primari goal punish deter potenti violat commit polici violat place depend punish identifi motiv belief entiti adher publish trust base reput trust base explicit punish trust base reput stem fact princip question gain violat polici lot lose case polici violat discov loss lost revenu due custom busi provid reput asset build invalu compani assum princip risk lose good reput small gain adher polici trust base explicit punish mean trust underli legal framework ensur princip proper behaviour explicitli introduc similar tradeoff trust base reput disciplinari action fine depend sever short term gain achiev polici violat negat punish problem enforc complex law countri applic expect transact difficulti percept person lose readili risk year possibl larg gain problem optimist approach stem fact confidenti inform necessarili conduct compani hold malici insid strictli person reason benefit difficult discov peopl punish decid malici compani problem reliabl discov polici violat resolv requir high transpar difficult achiev trustworthi princip good reput eager accept order protect intern busi process assum complet transpar tool approach design special compani execut frequent control conduct compani optimist approach prevent malici discov situat violat effect proper function system absolut strong detail discuss notion trust found paper swarup remark problem present life understood question stand pessimist approach pessimist approach remov disadvantag simpli prevent violat publish polici foundat trust sole reli princip polici verifi behaviour accept behaviour princip complet transpar constrain polici action polici prescrib action event polici enforc action place polici enforc realiz full limit polici rule effect enforc mechan reli optimist approach trust simpl conceiv enforc mechan recent consid imposs reli piec trust hardwar sander tschudin describ approach eventu capabl provid protect agent reli hardwar current form approach creat agent encod arbitrari support polynomi ration function viabl implement current knowledg reli trust hardwar describ piec hardwar requir met enforc rule polici hardwar compar secur yee hardwar protocol present execut environ reli describ protocol figur overview princip system comput host tm ae ao trust br fig overview princip protocol manufactur produc execut bought agent executor agent owner trust manufactur design produc execut environ properli section broker basic directori servic locat princip obtain credenti notat approach reli public kei cryptographi rsa detail descript cryptographi notat scope present inform topic notat princip pair pair kei kp public kei privat kei kei encrypt messag receiv public kei kp denot decrypt privat kei sign includ digit signatur messag gener privat kei verifi respect public kei kp denot assum usag optim scheme encrypt larg messag symmetr session turn encrypt pair digit signatur public kei cryptographi prepend messag hash algorithm reduc comput complex sign make explicit process environ note enforc behaviour princip piec trust hardwar concept appli call execut task environ task modul restrict interfac complet control modul call devic trust process environ figur complet agent platform inspect tamper agent resid protect disclosur manipul hardwar os vm librari librari fig trust process environ complet comput consist storag flash run virtual machin platform execut agent correct execut agent code definit languag java vm oper system extern interfac control vm protect agent privat kei princip physic owner privat kei achiev gener privat kei privat kei protect oper system secreci privat kei crucial requir usag enforc behaviour sophist approach creat pair kei incorpor kei recoveri mechan kei connect host comput control owner host comput access defin interfac oper remov facilit interact host agent agent verifi properti agent due implement modul restrict access imposs directli access inform properti ensur manufactur agent executor certif certif inform public kei agent owner trust tm section provid protect claim certif protocol protect object protocol transfer agent encrypt form network public kei imposs privat kei obtain code data protect agent protocol divid distinct phase phase consist execut execut phase protocol phase concern usag actual transfer agent protocol base interact figur initi initi particip exchang requir kei assum ao hold authent copi tm certif kei tm send certif cert stm ae ae regist refer ref ae broker origin chosen term object gener term agent refer ae consist physic address certif cert broker verifi ae control execut protocol ae agent executor agent owner broker manufactur trust process environ refer ae comput host tm ae ao trust br ref ae cert fig initi protocol usag particip finish execut usag part ao queri broker refer ae interact hold refer previou ao verifi polici ae accept certif cert check manufactur type order decid satisfi secur requir ao check ao abort protocol ao send agent encrypt public kei ae ae decrypt upload agent decrypt privat kei obtain execut agent eventu start agent interact local environ ae agent agent finish migrat back owner ae hold refer obviou problem protect malici agent independ approach tackl addit code sign sandbox problem protect tamper agent easili solv concaten agent hash entir agent includ execut encrypt simpli verifi correct hash start agent note feasibl actual construct modul real world applic reli agent executor agent owner broker manufactur trust process environ refer ae comput host tm ae ao trust br ae ao ref ae fig usag protocol sim card suffici time probabl attack violat protect modul actual realiz present strong set nonetheless feasibl requir prevent detect tamper applic imagin regular comput special oper system physic protect special hardwar effect seal detect continu video surveil similar system automat teller subject challeng inspect tm independ inspect organ explain instal conceiv resist massiv attack analysi remain risk scope present usag protocol concept integr agent platform ao protect code data agent manipul transit execut base trust relat ao ao trust tm properli manufactur control regularli claim hold certif enabl ao ensur deal manufactur extend addit formul rule effect enforc discuss approach agent base execut result previou execut limit number time agent execut achiev identifi polici suffici support agent ensur polici enforc agent execut ao trust ae proper protect suffic trust tm question ao trust tm ae discuss section address problem requir cooper trust parti secur relat deal reli cooper role provid defin function timestamp log creat evid resolv disput special charact function requir provid trustworthi administr domain user function interact server remot suffer usual problem limit high inflex interfac order rid remot messag exchang encapsul function agent execut trustworthi environ gather interact parti singl platform full advantag mobil agent paradigm section introduc polici discuss effect agent regular user shop agent show concept appli agent discuss implic approach polici assum servic provid enforc set detail code agent alter invoc agent method execut code agent data agent access manipul interfac agent agent provid method directli access data infer method invoc agent protect agent execut call public prior agent obtain certif design receiv polici agent decid transfer current honour agent actual transfer protocol intern clock reason accuraci order synchron clock trust time servic inform agent synchron succe rule basic protect agent code proper protect agent data undesir disclosur manipul rule requir protect agent regular oper system function rule ensur agent polici transfer agent ensur insuffici protect rule agent expir date implement limit lifetim order dai arriv agent request current time check time attribut lifetim expir date pass succe synchron agent simpli abort ae prevent code agent protect execut correctli shop agent shop agent search servic owner found suitabl negoti detail servic exact price qo servic provid special shop agent creat log entri server detail negoti contract provid payment data ao reconstruct activ agent case disput agent lost order shop agent effect conduct negoti conceal configur inform servic highest accept price lowest accept qo paramet shop agent hold public kei verifi acknowledg payment provid select servic provid success creation log entri shop agent execut enforc polici discuss section clear protect provid agent entiti access manipul data agent access method public interfac agent effect negoti servic request log contract delai action receiv sign acknowledg server agent send inform directli acknowledg receipt log messag ao perman connect prefer deleg task agent interact effici negoti agent servic provid exploit perform advantag mobil agent paradigm due special requir agent interact server remot interact perform penalti remot server bottleneck resourc consum larg number client encapsul function agent execut reli protect mechan shop agent case messag function consist accept arbitrari store defin point time respond acknowledg assert messag log acknowledg sign identifi messag includ messag hash messag capabl reproduc log messag time provid author request log messag confidenti protect regular encrypt method task ta act proxi actual accept messag log agent store local respond acknowledg forward messag server destroi log messag arriv handl normal messag order ta provid access suffici amount storag safe store log messag storag limit resourc ta special author owner grant ta abort access storag requir ta similar shop agent protect manipul code data conceal data item agent executor cryptograph kei kei mean secur forward log messag server ta configur simpli secret kei symmetr kei kei signatur kei sign acknowledg log messag necessarili signatur kei temporari kei valid certif sign signatur kei ensur ta execut enforc polici discuss section suffici high clear kei protect proper execut ta requir higher level assur protect regular user differenti featur manufactur remain problem ta log messag store storag eventu forward server owner simpli intercept messag ta server request termin ta function offer protect owner malici simpli agent termin problem solv ta intern clock provid track ta servic provid expir date ta ta accept log messag expir date date accept acknowledg messag receiv final messag ta expir date addit delai accommod clock indic messag store storag provid ta delet messag storag send server obtain messag ta acknowledg forward server final messag request owner restart ta forward messag send server assumpt possibl enforc access legal possibl owner avoid provis miss messag destroi approach log messag deliv server owner cheat discov proven owner destroi punish adequ fine problem destruct storag media appli regular assum oper implement adequ measur avoid problem discuss reloc function remot site local manag prevent bottleneck slow compon owner alloc resourc ta coordin ta collect merg log messag interact agent servic accumul log messag forward singl remot interact major advantag approach remot interact server critic commun path agent servic provid continu interact ta store log messag acknowledg entir interact exploit local commun link higher bandwidth lower latenc enabl perform interact due unreason overhead ta interact parti intermedi messag exchang ta easili log entir interact forward concept ta suitabl function wrap small object reli larg central manag interest exampl timestamp consist ta add timestamp messag sign result messag signatur kei classic secur solut reli problem princip exchang data item da db provid data item receiv princip ta facilit exchang accept data item descript data item expect design receiv verifi descript match actual data item case verifi paid amount correspond amount expect deliv data item design receiv trust manufactur introduc agent advantag polici enforc mention order princip trust proper enforc trust manufactur properli produc knowledg enforc correct behaviour present approach simpli replac requir trust relationship correct observ theoret point view replac trust arbitrari servic provid trust manufactur subtl implic briefli discuss advantag understand secur privaci problem central control resourc build reput separ concern manufactur special servic primarili deal field provis secur devic understand secur privaci make capabl entiti ensur servic awar potenti problem pitfal assum manufactur order compar number oper order make control behaviour easier expert organ conceiv manufactur invit extern expert control intern order obtain posit market approach qualiti assur product consid difficult task section assum undertaken major resourc build good reput incent protect reput reli good reput foundat trust manufactur manufactur enforc proper polici rule gain accomplish task oper independ manufactur complet princip manufactur mean access data process physic possibl manufactur draw direct benefit properli enforc polici assum argument high effect good lack incent sound reason trust manufactur build reliabl power main advantag approach li possibl leverag trust manufactur complet princip role servic proper ensur secur oper hardwar protect process data difficult due sheer number servic provid reput short term goal point justifi polici violat present servic provid easili defin polici rule enforc select option offer bui reput manufactur servic provid immedi benefit trust user manufactur convinc malici agent user approach favour open system princip possibl provid servic servic provid simpli obtain reput manufactur easili convinc client client confidenti inform suffici protect easier servic provid establish market possibl oper manufactur provid incorrect assum behaviour sever subject crimin investig scope discuss discuss notion trust context mobil agent system introduc structur problem domain start approach reli trust hardwar prevent malici behaviour correct form protect confidenti data shown approach effect protect confidenti data shop agent user extend protect special agent provid facilit servic limit approach suffici time oper succe break system violat polici enforc goal make attack costli negat gain implement provid level assur protect assum proof polici violat enforc polici attempt success break punish sever mere polici violat prove larger determin commit crimin acknowledg research support grant epfl swiss nation scienc foundat part swiss prioriti programm inform commun structur project number refer anderson kuhn tamper resist note usenix workshop electron commerc page novemb burk exchang system enabl secur unobserv comput vigna design distribut applic mobil code paradigm intern confer softwar engin page acm agent mobil comput ieee person octob direct cryptographi ieee transact inform novemb dod trust comput system evalu criteria technic report dod depart decemb gosl java languag environ white sun rs grai agent transport agent system cikm workshop intellig inform decemb kershenbaum mobil good mobil object programm volum lectur note comput page springer itu recommend directori authent framework intern telecommun lang program deploi java mobil agent aglet van handbook appli cryptographi crc ordil agent technic report technic comput scienc research bell rsa data rsa encrypt standard rsa data novemb formal approach secur architectur page sander tschudin mobil cryptographi ieee symposium secur schneier appli cryptographi authent servic open network system usenix winter technic page usenix februari swarup understand trust secur internet program page york time worker data agenc april vigna protect mobil agent trace workshop mobil object june jan vitek christian jensen secur internet secur issu mobil distribut object lectur note comput scienc springerverlag white telescript foundat electron market place white gener problem trust mobil agent system symposium network distribut system page internet march winkler threat comput system comput usenix winter woo lam authent distribut system ieee januari yee mobil agent secur internet program page zimmermann pgp user guid mit
AI/779 2 competit layer model featur bind sensori segment jochen ritter faculti germani neural comput abstract present recurr neural network featur bind sensori competit layer model topograph structur competit cooper interact layer network partit set input featur salient group dynam formul standard addit recurr network linear threshold neuron contextu relat featur code compat defin energi function minim neural dynam due usag dynam circuit model gain flexibl properti spin model segment exploit amplitud inform group process prove analyt result converg stabl attractor gener earlier result incorpor determinist anneal robust local minima linear dynam linear analysi analyz dynam bind conjunct anneal contour detect show integr segment group unifi model introduct viewpoint brain theori der malsburg von der malsburg featur bind provid basic sensori inform process principl kei question neural correl bind addit import question understand brain great interest similar mechan pattern recognit applic imag segment object recognit larg bodi neural network research bind model base tempor correl neural activ der malsburg stimul neurophysiolog find grai support function role synchron activ perceptu process featur bind model oscil problem slow converg necess connect robust synchroni oscil model develop der malsburg buhmann test honda europ futur technolog small network highli simplifi test imag relax oscil wang show long rang synchroni local connect appli imag segment auditori segreg wang problem limit number group repres overcom introduc algorithm abstract origin model phase averag model interact appli extract contour salienc yen finkel success applic segment data except yen finkel high dynam complex make simul costli analyt studi difficult task approach featur bind spin develop comput vision dong horaud combinatori applic featur repres spin variabl attain discret set spin state bind featur correspond share spin state regard applic model great advantag deriv energi cost function stabl output state minima approach establish link cluster fox hofmann buhmann label problem combinatori relax label standard techniqu field pattern fall categori label iter scheme pelillo offer conceptu approach model share drawback biolog requir iter discret cluster updat procedur complex normal nonlinear group intens studi subject comput exist varieti algorithm base markov random field geman variat approach shah curv evolut relat refer recent work stress import group deal problem recent approach segment normal cut malik combin graph partit base featur similar contribut competit layer model ritter approach featur bind standard addit recurr neural network linear threshold neuron similar spin featur assign set label select local circuit column coupl interact determin prefer bind mutual compat featur neuron repres label assign arrang layer orthogon structur fig shown ritter attractor provid feasibl solut relax label problem ritter appli textur base featur deriv gabor filter shown method perform wide rang imag data energi function approach similar quadrat energi function approach combinatori optim import differ formul linear tool analysi inspect bind process result extend previou result network layer case dynam circuit strict normal model gain flexibl biolog plausibl properti show advantag group contour segment section introduc architectur discuss main properti bind dynam section devot gener theoret cover attractor analysi relat group properti section effici simul procedur applic contour group present section section discuss result respect bind toler biolog relev featur bind model architectur consist set layer neuron denot activ neuron posit layer denot column set neuron activ share common posit layer associ column paramet vector typic featur local edg element posit complex featur ritter textur emploi vector local gabor filter spatial frequenc orient bind repres column express simultan activ share common layer bind achiev column assign featur layer interpret activ measur certainti assign neuron column equal driven extern input interpret detect featur preprocess step input fed activ connect weight layer activ coupl interact rr correspond compat featur symmetr function featur rr interact rr determin pattern elicit activ pattern singl layer mutual support constitu part rr suffer mutual inhibit rr exampl interact motiv gestalt law perceptu group shown figur interact pattern ident layer greater perceptu incorpor layer perform simultan group segment sec number layer correspond number suffici layer activ carri salient segment interact rl rl vertic input layer layer layer interact figur architectur input layer respond neuron vertic circuit implement topograph competit layer interact compat featur guid bind process layer arrang enforc dynam assign input featur contextu inform store interact assign realiz mutual symmetr inhibitori interact strength neural activ share common column combin input vertic interact combin standard addit activ dynam rr linear threshold transfer total input neuron addit term simplifi comput rr rr rr energi formul bind dynam dynam energi function form rr rr energi satisfi make dynam confin activ nonneg app attractor dynam local minima constraint vertic interact establish interact rr contribut quadrat energi sum proxim interact input group continu interact input group figur exampl interact perceptu group interact excitatori short distanc weakli inhibitori larger distanc capabl cluster proxim point symbol denot activ layer gestalt principl continu model local interact edg element lie curv constant curvatur combin weak inhibit separ segment compat group interpret neg energi qualiti aim dynam reach global minim minim energi state quadrat summat approach similar pott spin field free energi rr rr log minim subject weight constraint pott spin model explicit input activ sum due probabilist interpret addit convex entropi term weight temperatur paramet local minima soft attain minimum minim solut obtain recurr dynam fr rr implement circuit gradual sharpen dynam similar soft competit scheme group layer model hard weight constraint nonlinear replac flexibl coupl dynam input permit contextu modul input salienc requir addit stabil analysi perceptu context effect kind observ wide rang physiolog studi analysi dynam dynam driven depend interact pattern eigenvalu rate group format analysi motiv mechan slow mode dynam group qualiti ad coupl neuron form rr rr rr strength lead energi add analog convex term local minima grade assign make soft similar anneal pott model gradual lower inhibitori sweep grade assign final uniqu assign final group result time dynam anneal perform contour group shown figur anneal result regular group format produc group hierarch salient group slow result tradeoff converg time anneal depend complex input pattern respect interact problem wang coher local interact proper separ segment anneal reduc strength global inhibit achiev reinforc dynam discuss detail section theoret analysi dynam nonlinear dynam system consist seri continu connect linear system altern dynam implement form avoid occurr enforc constraint set reformul correspond constrain gradient descent energi natur make dynam activ dynam anneal activ dynam anneal figur activ dynam group format neural activ displai symbol layer symbol size repres activ interact local weak global inhibit fig typic dynam shown initi random activ valu activ column equal activ layer dynam break symmetri format group group assign circuit assign layer mode interact pattern main problem coher local interact proper separ group fragment group occur interact due fast express mode lead fragment group show mechan anneal suppress fragment mode dynam strength effect make circuit strict group assign singl featur fluctuat due fragment mode smooth group differenti salient structur share energi function converg attractor local minima consid dynam formul advantag simplifi linear analysi shift nonlinear boundari form prove result appendix form appli biolog plausibl convent form theoret analysi base discuss model attractor condit converg discuss analysi attractor prefer recurr dynam discuss synthet relat properti bind process implement converg assign network linear threshold neuron unbound excitatori interact balanc suffici inhibit discuss stabil singl circuit criterion base global inhibit prove state fact local inhibit suffici ensur system coupl column theorem rr rr dynam bound max factor control stabil margin maxim amplif input strength rr neuron larger sum excitatori connect rr converg simplest case input vertic interact term combin energi term interpret penalti term constraint multipli enforc sum activ column equal input unlik usual penalti function approach combinatori framework sensori segment strict enforc constraint undesir close stabil margin theorem penalti term deriv vertic interact longer domin interact activ strongli influenc return point state theorem essenti approach obtain proper assign state column singl activ condit vertic interact assign properti hold state theorem rr denot feedback neuron interact rr vertic interact satisfi attractor column posit activ index maxim support layer activ column vanish theorem state long interact vertic suffici converg uniqu assign featur layer maxim feedback central result due layer topolog requir arbitrarili larg vertic coupl note lack upper satur essenti exclud spuriou ambigu state nonzero activ stabl due dynam equilibrium due satur dougla al argu plausibl form dynam stabil cortic neuron rare oper close satur vertic feedback modul input intens amount depend ratio simpl theorem output activ neuron column show lower effect obtain activ remain sensit input intens note addit anneal rr rr rr suffici larg violat condit theorem lead stabl state multipl nonzero activ analysi show analysi discuss attractor turn discuss prefer dynam time develop defin linear differenti equat appli method analysi obtain solut linear constraint inact import special case interact rr rr ident layer simplic constant show special form topolog interact global complet term system linear dynam jh rr rr rr rr introduc vector xl xn hn write jh gx linear transform space id id id ident equat show orthonorm eigenvector basi fv obtain orthonorm eigenvector base fb fq calcul analyt eigenvector remain orthogon eigenvector eigenvalu direct geometr interpret divid linear system subspac span jl coher equal compon layer suffici larg eigenvalu neg orthogon subspac span remain eigenvector differ activ pattern layer sum column eigenvalu eigenvalu interact rr due symmetri layer linear dynam complet locat fix point determin inhomogen input rel fix compon develop correspond exponenti growth posit neg eigenvalu lead attract affin constraint surfac pass fix point expand fix point equat basi obtain fix point power compon ac jl jl jl approxim fix point draw sketch initi dynam refer analysi assum sort descend order affin constraint surfac ac dc figur sketch linear dynam layer shown activ trajectori activ singl column start small initi valu activ quickli approach fix point constraint surfac dc subspac dynam orthogon ac subspac drive process layer activ system small posit random valu suffici larg jl larg neg eigenvalu initi state rapidli project affin subspac orthogon pass fix point rapid project dynam dc space move activ boundari initi dynam linear mode posit eigenvalu develop differ layer slower eigenvalu smaller absolut princip largest posit eigenvalu domin dynam initi phase determin dynam drive activ column activ reach longer contribut linear dynam nonlinear effect introduc segment linear dynam result symmetri layer coupl dynam complex gener subsequ drive column assign state comparison figur regular highli symmetr discuss final group result obtain domin mode initi linear phase dynam suggest mechan anneal rr rr rr shift eigenvalu greater critic eigenvalu neg fix point asymptot analog pott field model lower critic mode acquir posit eigenvalu grow exponenti fix point section discuss emploi group qualiti result interact matrix form rr anneal simpl stimulu exampl contour group interact discuss bind problem coher separ refer previou analysi stimulu consist regularli edg element fig assum neglect effect column activ eigenvector result interact matrix rr activ featur contour group interact local interact rr global inhibit strength give rr rr interact pattern invari eigenvector interact sine cosin wave circl spatial frequenc assum edg share posit interact local neighbourhood rang order cosin eigenvector largest eigenvalu rr equal sum local valu global ac mode coher activ circl layer mode eigenvalu order sine cosin split circl halv gap determin coher mode domin fragment mode gener properti local interact gap rang interact differ mode grow time system stai initi linear mode determin coher shift spectrum interact addit rr rr rr time dynam suppress spuriou reduc converg rate add equal local interact circl fig task achiev coher proper separ interact pattern eigenvector composit system symmetr combin singl circl eigenvector eigenvalu mode separ group global inhibit add global inhibit mode undergo chang mode compon global constant inhibit effect shift eigenvalu spuriou mode suffici mode separ circl coher domin obviou limit strong global inhibit coher circl singl circl inhibit lower eigenvalu singl coher mode kn achiev coher separ small valu applic pictur complex complex interact spatial exponenti decai interact replac hard interact perfectli featur circl angular posit rr rr differ coher mode fragment mode limit suffici small featur space eigenvector eigenvector eigenvector input input input figur eigenvector contour group interact top row show eigenvector interact activ featur circl input pattern vector compon shown black white edg thick proport magnitud achiev coher bind eigenvalu coher mode suffici larg compar eigenvalu mode circl eigenvector symmetr combin singl circl eigenvector global mode weak global inhibit suffic lower eigenvalu suppress unwant mode complex input success eigenvector constitut hierarchi princip separ circl cross line short line drive segreg short line simpl anneal scheme section interpret hierarch suppress subsequ result hierarch group format process group featur input lower show eigenvector constitut hierarchi structur input gradual lower understood type anneal process regard energi function mode express hierarch back simul dynam simul principl parallel differenti equat integr euler method due analog vlsi implement simpler classic circuit incorpor sigmoid transfer function simul serial altern approach replac explicit trajectori integr rapid search fix point attractor iter solv fix point equat larg facilit linear model ritter iter solut approach extens markov random field approach imag segment algorithm conjunct exponenti anneal schedul temperatur paramet implement initi small random valu initi randomli updat rr rr step converg singl activ updat step correspond solv fix point equat activ activ held constant setup section critic temperatur max ff rr asynchron dynam converg ritter due converg result asynchron iter neural network feng observ speed gain roughli factor ten compar euler integr compar solut qualiti simul anneal simpli set applic contour group relat work long earli stage visual inform process visual cortex area neuron found respond local orient edg element classic recept field major issu vision research mechan visual system integr local element global salient contour facilit robust boundari detect object recognit process consid finkel process local edg inform combin cooper smooth salient process segment separ contour element assign group recent neural model contour integr enhanc stage visual process model orient tune competit orient interact lev sompolinski cowan modul found horizont long rang interact katz produc contextu effect enhanc featur link address model yen finkel yen finkel requir interact global activ normal li state biolog plausibl dynam model contour integr area discuss properti oscillatori correl model facilit segment result li complex excitatori inhibitori interact lead distort predict correl complex visual leav question robust group process unansw present applic approach group stage contour integr model simpl applic larg featur set real gener local orient leav preprocess step essenti oper local orient altern group altern edg featur fix local orient contour group model initi integr step local edg inform subsampl preprocess result assum local area singl edg detector activ optim tune orient set ideal edg featur index ng local orient edg intens contour group model set layer layer provid respond salient contour group singl layer provid captur background featur interact edg featur figur layer visual figur excitatori compon link edg lie tangenti common toler admit small deviat orient field gaussian compon excitatori interact field similar recent model yen finkel li similar interact pattern orient sensit cell observ local inhibitori compon compar magnitud excitatori field insensit orient suggest find support separ remot contour part addit weak inhibit direct biolog counterpart edg paramet interact field figur interact contour group interact depend differ vector unit vector encod orient comput conveni show result interact pattern singl horizont edg center sampl surround posit black edg share grei edg share inhibitori interact central edg length code interact strength observ connect structur complet rr preprocess stage emploi featur gener defin appendix interact rr rr rr ground layer rr rr figur layer paramet defin interact figur layer compet featur ground layer weak global inhibit strength chosen vertic interact input strength chosen equal max rr critic impli stabil margin theorem applic contour group model real imag shown figur preprocess app result set featur object background textur produc noisi background obtain robust group complex scene interact edg anneal exponenti schedul section group result shown fig choic ground layer strength approxim match sum interact edg part proper salient contour detect singl group noisi edg lack support align captur ground layer suffici layer salient segment activ interact amplif salient contour enhanc noisi fragment demonstr modul crucial compar group result pott spin field model equal interact structur anneal spin model gener lack abil repres addit amplitud inform result fig illustr make sensit noisi align element form spuriou group wang specul provid global inhibit group input imag pott spin group edg featur interact figur group natur imag input imag preprocess gener set edg featur displai edg input intens visual thick displai element background fruit textur low suppress threshold lose low contrast contour object show group result architectur figur layer ground layer symbol symbol dark repres activ layer symbol size proport magnitud ground layer omit scale interact displai upper left corner group achiev identif import curv element presenc background layer remain inact edg appl amplifi due support interact salient contour show group pott spin system interact due lack amplitud inform model strong tendenc curv ground layer produc significantli result vari paramet conclud dynam lead set separ complex input pattern figur show perform paramet set ident anneal complex imag aerial imag number layer suffici singl layer salient segment case dynam find combin segment layer mutual inhibit minim energi level minim result tendenc prefer combin parallel separ distanc larger local inhibit field interact suppress multipl segment layer global inhibit turn pose upper limit maximum size stabl global inhibit exce local support time dynam anneal illustr result hierarch group format process initi express salient group layer discuss bind properti bind model share compon recent bind model contour group interact base local compat combin weak global legion spin updat model legion model mechan perform segment suppress featur low support main differ li dynam consist model neural activ dynam layer system coupl column local contour group coher separ enforc anneal control express dynam result tradeoff converg time applic textur segment ritter shown suffici featur perform anneal model wang emploi mechan similar region grow successfulli appli task greyscal segment imag complex interact overlap intersect curv element pose problem applic contour group analysi reveal interest parallel group dynam oscillatori synchron contour integr model li restrict interact domin oscil mode model eigenvector compon domin group mode similar mechan suppress spuriou improv synchron properti model combin spatial mechan approach realist model cortic featur comput power sensori segment task figur group result figur show group result imag ident paramet set layer imag segment cover salient contour ground layer strength introduc minimum size segment collect smaller contour segment resolv requir extens model low intens edg enhanc top hat lower aerial imag finkel due presenc salient contour layer carri singl vertic group upper left corner center imag illustr tendenc combin parallel layer effici regard energi level global group lower row show sequenc emerg group lower left select amplif toler main differ compar spin model segment explicit usag amplitud inform input usag dynam circuit result amplitud modul enhanc salient group due support interact comparison pott spin model show result toler contour group process discuss li li dayan select amplif consid setup contribut set sampl featur omit model abil full rang featur detector orient model li exclud direct contour present input ensur proper oper model extend case featur similar threshold linear transfer function finit posit suppress activ neuron input biolog relev kei principl architectur encod featur bind assign separ popul interconnect local competit neuron biolog realist interpret architectur express term promin layer structur real visual implement rich local connect structur singl neuron layer restrict discuss monkei primari visual area intens studi region brain neuron granular layer primari visual cortex connect horizont connect spread lund data support idea specif inhibitori interact disjunct modul interconnect neuron model principl easili implement simpl neural circuit relat anatom structur interest question presenc suffici layer carri salient segment imag hard justifi visual albeit technic applic point view suggest control mechan separ concentr salient limit number layer form sever restrict principl featur bind competit spatial segreg layer process visual inform rout cortic evid local topograph inhibit layer area receiv major input princip input layer coupl reciproc inhibitori properti fitzpatrick parker spread connect lund put interpret inhibitori circuitri featur bind perform competit interact neuron layer project target layer area turn kei set neuron cortic area lund bind featur depth layer form basi subsequ process stage layer structur involv neural redund consid neural hardwar fix hardwir layer flexibl carri addit inform tempor domain model complex interact lead strong limit regard stabil separ group suggest principl topolog addit bind principl improv robust stabil featur bind process acknowledg author ut bauer wolf jurgen discuss anonym comment improv clariti manuscript support dfg grant support dfg grant appendix proof theorem dynam system rr rr theorem rr rr dynam bound max proof prove construct hypercub posit domain left dynam dynam leav posit domain hypercub defin show face system stai insid hypercub face rr rr rr omit neg term insert obtain rr rr max face note condit theorem impli diagon domin global interact matrix rr account vertic corollari condit theorem dynam system bound condit proof condit face construct box hold altern formul dynam state suffici condit vertic interact ensur converg unambigu activ layer column defin feedback layer rr theorem interact rr vertic interact satisfi attractor column posit activ index maxim support layer activ column vanish proof equilibrium posit activ column layer constraint small perturb column form expand quadrat function equilibrium obtain perturb linear compon vanish equilibrium rr rr rr rr rr state perturb local minimum attractor dynam quadrat form neg eigenvalu exist perturb equal state perturb due rr rr shown contradict attractor posit activ column case denot layer index posit activ row constraint inact activ prove case case remain stabl equilibria cover appendix preprocess interact edg featur gener subdivid imag small pixel sobel oper appli sampl intens gradient inform orthogon direct edg featur index posit maximum squar sobel unit orient vector direct normal sobel compon input squar sobel ad small posit constant observ slightli level improv abil enhanc low input contour effect constant chosen ten percent maximum edg intens origin pixel size imag subsampl interact edg posit differ vector unit orient vector exclud skew symmetr edg paramet control spatial smaller inhibitori compon dj dj equal edg lie tangenti common circl paramet control sharp constraint control strength local inhibit simul spatial dimens scale unit paramet refer contour fragment group simpl occlud comput vision imag understand comput arrai coupl applic textur discrimin neural comput lev theori orient tune visual cortex proc nat acad sci bayesian comput stochast system statist physiolog organ layer striat cortex data cluster model granular magnet neural comput model perceptu segreg doubl vowel network neural oscil length width tune cat primari visual cortex recurr excit circuit oscillatori synchron visual cortex role associ visual featur progress brain comput contour closur proc european confer comput pp lyapunov function neural net characterist neural comput contour integr human visual evid local vision research boundari detect constrain optim ieee tran pattern analysi machin intellig stochast gibb bayesian restor imag ieee tran pattern analysi machin horizont integr cortic dynam neuron analysi linear threshold neuron contrast sensit orient select iv striat cortex world monkei exp brain combinatori optim approach ieee tran pattern analysi machin intellig data cluster determinist anneal ieee tran pattern analysi machin intellig recept binocular interact function architectur cat visual cortex distribut fiber monkei comp foundat relax label process ieee tran pattern analysi machin intellig problem solv hopfield network biol improv visual sensit local parallel studi human observ alert monkei deform compon shape space int journal comput close curv incomplet effect closur segment proc nat acad sci neural model contour integr primari visual cortex neural comput differ asymmetr symmetr network local circuit neuron monkei striat neuron journal compar optim approxim smooth variat problem comm pure appl visual cortex circuitri orient tune petsch advanc neural inform process volum pp mit press perceptu group neural reproduc human textur percept technic report sfb bielefeld fast robust cluster updat algorithm imag model anneal visual latenc revisit neural comput trace curvatur curv detect ieee tran pattern analysi machin intellig dynam relax label process ieee intl conf neural network volum pp ieee press method map optim problem neural network int neural system architectur perceptu spatial interact vision spatial approach featur link proc int conf pari vol pp lattic connect primat visual cortex comp constrain cluster optim method ieee tran pattern analysi machin intellig scene label relax oper ieee tran cybernet dual mechan neural bind segment advanc neural inform process volum pp morgan kaufmann bind tempor structur multipl featur domain oscillatori network biol normal cut imag segment proc ieee conf comp vision pattern puerto rico visual featur integr tempor correl hypothesi ann rev rapid synchron fast threshold modul biol cooper dynam visual process physic review note dynam neural comput global competit local cooper network coupl oscil physica von der correl theori brain function technic report mpi von der bind model percept brain function current opinion von der sensori segment coupl oscil biol imag segment base oscillatori correl neural comput pattern excit inhibit evok horizont connect visual cortex share common relationship orient column featur bind relax label competit layer model proc eur symp art pp layer recurr neural network featur group nicoud proc pp function stream local connect layer neuron primari visual cortex monkei neurosci salient contour extract tempor bind network petsch advanc neural inform process system pp mit press extract perceptu salient contour striat cortic network vision research independ merger channel monkei primari visual anatomi project vi stage curv detect suggest style visual comput neural comput
Agents/780 1 agent infrastructur build evalu java agent framework system simul regi bryan victor lesser dept comput amherst ma usa abstract describ agent framework address issu encount design suitabl space evalu coordin adapt qualiti system research direct develop framework build di erent type agent facilit addit technolog underli technolog java agent framework design present reason design choic made build complet system evalu coordin adapt qualiti system java agent mass system simul introduct agent form gradual nding mainstream comput potenti improv perform wide rang comput task typic commerci mean word agent refer piec real potenti ort sponsor advanc research project agenc air forc research laboratori air forc materiel agreement number govern author reproduc distribut reprint notwithstand copyright annot thereon materi base work support nation scienc foundat grant view author interpret necessarili repres polici express advanc research project agenc air forc research laboratori govern paradigm li autonom entiti de nition agent autonom entiti capabl react determin goal action reason deadlin tradeo determin correctli develop reactiv piec good wai debug evalu research realiz begun develop requir infrastructur research di erent approach direct develop framework build di erent type agent facilit addit technolog underli technolog java agent framework design develop plug plai interfac build agent quickli exist gener develop develop requir schedul commun servic agent gener schedul commun compon plan compon schedul compon satisfi develop solut develop infrastructur creat plan interact exist compon unduli limit design schedul compon deriv implement special commun compon directli interact maxim code speed develop process respect fact research requir exibl construct solut serv simpl sca leav implement develop api convent gener exist compon deriv common agent satisfi di erent goal call complex interact phrase common individu compon interact direct knowledg compon function implement compon design oper rel autonomi reason analog agent intern organ limit form capabl interact compon varieti wai sophist individu compon provid speci discret xed dynam goal achiev function request compon direct method perform automat messag event occur agent object develop implement evalu system quickli excess knowledg engin avoid work domain leav time energi put critic higher level design control method agent evalu technolog agent built simul environ agent oper motiv system simul base potenti con object accur measur compar uenc di erent strategi determinist environ dicult model adapt behavior realist multiag system static reason adapt fulli test environ substant chang seemingli contradictori goal lie heart design mass work solut lead reproduc sacri dynam environ agent expect respond describ agent framework address issu encount design suitabl space evalu coordin adapt qualiti system describ framework mass simul environ describ concept work present implement intellig home domain testb present system run altern simul migrat system conclud overview futur direct project java agent framework architectur agent work mass environ ectiv isol behavior logic underli support code common agent simul goal framework agent behavior logic perform knowledg oper simul problem solv compon simul agent real agent type clean separ facilit creation clear path migrat develop technolog agent work real world shown recent distribut sensor network agent migrat simul world oper real hardwar framework exibl maintain separ mutual depend function area extent replac modifi satisfi java agent framework creat compon base architectur arriv softwar engin build notion design attempt encapsul function object respect interfac architectur sun agent framework enabl creation stand applic simpli plug group compon paradigm ideal agent permit creation number compon easili make manner note agent produc scheme act small multiag system compon function partial autonom entiti commun interact achiev individu goal system schedul goal schedul activ respect time resourc constraint oper common respond event describ task perform receiv schedul attempt integr action exist turn execut compon determin perform action schedul compon oper react request induc compon arrang kei exibl compon part care agent oper design free modifi adapt compon fig sun build agent base java sun microsystem compon model architectur java bean suppli set design behavior speci cation compon adher java bean api set method function convent applic construct tool bean manipul compon state make function easili import compat exist java bean facilit develop process provid common implement style compon make heavi java bean notion event permit dynam interconnect form stream gener subscrib compon develop base diagnosi compon track perform make suggest optim repair process perform relat agent observ diagnosi phase technolog enabl dynam event diagnosi compon form compon resid agent compon begin listen compon local coordin compon stream diagnosi compon coordin attempt remot agent coordin result commit respect event compon discov condit case coordin seri similar fail coordin attempt remot agent longer desir servic proactiv analysi current state coordin compon yield inform monitor event compon state diagnosi compon determin compon perform gener potenti solut problem experi diagnosi compon modifi compon order integr function state data event event common api api depend data fig abstract view typic compon build java bean model suppli number facil design make compon develop agent construct simpler consist schemat diagram typic compon gure java event state data plai import role type interact compon addit mechan provid resolv data depend method make kind data depend presenc compon agent work correctli commun requir local network port number bind requir log compon function correctli mechan ad organ assumpt made exibl autonomi mention speci cation dicult design servic compon function correctli structur ad execut compon break runtim distinct interv implement common api behavior convent interv individu compon special api exist famili compon instanc famili commun compon provid di erent type conform singl class api easili replac goal design add common pool compon compon pool combin creat agent desir capabl figur network messag servic singl commun compon pool domain ad bene compon easili swap agent respect origin class er di erent servic paper describ mass simul simul commun servic agent messag agent work environ rout requir special commun compon mass interact pool compon simpl commun oper convent mass commun automat rout messag simul control compon commun awar intern deliveri system modi cation scenario revisit hybrid simul issu agent conform mass commun speci real world messag exchang compon mass execut simul perform execut perform action report result mass control complet consist simul environ maintain noti real data gener agent organ agent price autonom natur individu compon make dicult trace thread control characterist exacerb event indirect ect dicult implement function base respect convent api deriv feel autonomi encapsul er compon orient design make addit complex compon built explain commun compon serv commun hub agent tcp base commun provid simpl send messag di erent encod delimit serv messag receiv connect acceptor compon interact commun listen messag directli invok method send messag deriv version exist work mass simul environ preprocess taem reader task descript cover articl compon agent maintain librari structur dynam instanti di erent depend agent design updat method distribut base learn add interact discov import facilit problem solv task develop condit gener task structur respect current work condit data manipul capabl exist permit mathemat condit structur creation manipul simpl routin written tool inform preprocessor condit structur abil perform oper le problem solv compon gener deriv version compon exist read simpl static task structur descript schedul schedul base schedul technolog compon schedul task structur mention result schedul account cost qualiti altern durat rel potenti deadlin schedul function monitor state addit produc direct invoc partial order schedul deriv version schedul schedul agent sophist manag time resourc replac schedul compon agent correctli merg schedul di erent exploit area potenti make ecient resourc layer top schedul rst obtain convent schedul reason agent activ concentr depend action time perform characterist agent partial order schedul intellig reason action frequent speed failur recoveri avoid replan state state compon serv import indirect form interact compon serv local repositori arbitrari data compon creat common inform state medium exchang compon add data direct method noti ed event stream compon react action monitor data produc problem solv compon gener task place schedul react produc schedul execut compon perform speci ed action directori servic compon gener directori servic local remot agent directori store data kei data queri boolean arithmet express compon directori servic post queri local remot directori compon serv intermediari queri monitor notifi compon arriv compon serv foundat wide varieti directori paradigm yellow fsm control fsm compon common interfac messag speci calli coordin negoti interact rst creat nite state machin describ protocol includ messag state messag type transit machin sca provid fsm fsm control popul develop code send process di erent messag clean separ protocol usag protocol quickli migrat environ compon provid servic local resourc domain depend function exampl agent implement cover articl evalu environ system numer problem systemat analysi di erent algorithm techniqu perform work runtim environ ident run failur occur time di erent run compar system interag messag trac interleav network event extern work simul system test react optim major di erent scenario number larg repres base design environ directli control baselin simul environ determinist run permit addit event ect environ run enabl determin requir accur coordin strategi comparison sacri qualiti fulli test adapt environ hank al de ne characterist system simul exogen exogen unplan event occur simul complex realist simul simul world react accord measur made real world simul network base actual network perform measur qualiti cost ect explicitli repres accur model imperfect sensor activ good simul clear interfac agent world measur plan qualiti agent determin achiev direct concern simul multipl agent present simul interact commun simul multipl agent complex ad abil model faulti commun misunderstand delai messag transfer clean interfac heart good simul claim agent simul run separ process commun agent simul make assumpt base local con share memori le system de ned model time determinist simul occur event point time unrel time perform stress agent di erent class scenario add determinist import featur simul accur compar result separ paramet produc di erent outcom show section mass address uncommon simul abil agent perform mixtur real simul activ agent simul environ perform perform execut sensor spatial constraint physic manifest fall categori activ agent perform simul environ er hybrid exist er import realist work condit clear path migrat work laboratori real world revisit implement section load clean wash dry enabl enabl sum electr consum consum produc produc task method resourc resourc interrelationship method interrelationship qualiti accumul function expect method result fig task structur agent multi agent system simul mass advanc incarn simul creat decker lesser realist environ ad support resourc resourc sophist commun mix real simul activ add script richer event notion locat connector agent move room town mass simul complet domain domain knowledg obtain con gurat le data receiv agent work environ agent run mass environ hierarch agent goal capabl figur repres knowledg task model simul quantit describ altern wai goal achiev task structur essenti annot task decomposit tree highest level node call task repres goal agent achiev goal structur shown gure task group set task method describ task group includ sequenc inform data ow relationship mandatori versu option task task repres manner perform complet repres primit action agent perform method quantit term expect cost durat expect durat schedul plan process reason effect select method execut qualiti accumul function task describ qualiti subtask combin calcul task qualiti sum load speci es qualiti load total qualiti subtask subtask successfulli perform sum task succe interact ect resourc quantit interrelationship enabl perform order curv line bottom gure repres resourc di erent consum ect method resourc view structur convent problem solv compon lieu gener compon domain appli technolog domain independ compon capabl reason structur compon interrelationship method resourc er potenti area coordin negoti quantit descript method reason tradeo di erent problem solv strategi task structur gure implement wash machin agent intellig home project discuss articl figur show agent distribut sensor network domain discuss initi local sensor type essenti abstract reduc knowledg make support code research focu intellectu issu di erent view structur cleanli decoupl agent simul agent make subject view local version describ agent belief object describ true model goal action structur function interact environ di erenc engin structur develop quickli gener test situat agent incorrect belief demonstr di erenc ect agent behavior coupl simpl con gurat mechan robust log make mass good platform rapid prototyp evalu system connect mass strong weak agent run mass environ simul vast major commun execut emploi compon rout respect data request simul control agent simul object view task resourc locat simul turn agent notion technic inform random number gener seed uniqu id high level aspect agent perform action easili remov agent run mass simpli replac compon gener agent convent base perform action local local comput clock support read random seed con gurat le type separ achiev cover section show agent run di erent simul independ real hardwar agent specif resourc definit taem model sensor script control execut problem solver state log commun agent control execut problem solver state log commun agent control execut problem solver state log commun agent execut monitor clock method execut request result sensor script random seed log control config event engin stream execut simul resourc manag commun modul event resourc db taem db sensor db script db fig architectur mass agent system figur show design high interact agent connect mass read con de ne log random script global sensor de nition instanti subsystem simul connect simul made standard agent distribut remot system agent send addit inform incorpor con characterist speci agent bundl agent agent send descript sensor resourc make environ arguabl import piec data agent task assimil shown gure execut subsystem simul quantifi characterist method execut ect resourc method interact method resourc manag track state resourc event engin manag queue event repres tangibl action place compon shown commun maintain tcp stream connect rout di erent kind messag agent correct destin control mass control task perform manag simul includ rout messag trac correct provid hook agent virtual environ manag di erent resourc util agent primari simul execut method request agent agent make subject view typic describ local view goal determin expect valu result execut mention simul object view world comput result activ environ distribut object view comput valu method determin result method resourc interact probabilist distribut describ averag case simul degrad improv result requir resourc action environ enabl facilit method execut happen enabl interrelationship dry absent subject view gure agent unawar enforc order constraint action agent perform dry simul detect precondit report dry method fail agent detect resolv potenti updat subject view accur inform mass track state ect resourc environ figur show type resourc support consum level consum ect direct consumpt product default revert back directli modi ed mass object view agent determin ect method resourc present object view notion upper resourc level exce agent attempt pass resourc switch error ect cost durat action resourc mass determin method ect ect action resourc resourc bound quantit repercuss violat consum larg portion simul attent act messag router agent agent send receiv messag simul design model network condit unpredict delai transfer failur rout plai import role environ gener permit control order messag receipt run section describ mechan detail control simul simul overrid goal compar behavior di erent algorithm environ condit correctli determinist replic run condit seri simul notion sequenc event simul techniqu exist exploit achiev discret time event discret time simul segment time line number slice simul begin time slice send actor run period cpu time repres prede ned quantiti cpu agent decid independ stop run agent perform remain independ hardwar run control perform techniqu simul ecient schedul simpli reduc number requir complet agent dictat nish easili accomplish perform work evalu potenti ect code optim characterist simul environ usag reaction behavior agent mass simul combin techniqu divid time number event intern repres action interact agent agent execut discret time noti ed activ messag event noti cation section discuss discret time simul bene ts describ event base simul environ discret time simul mass util discret notion agent run environ synchron simul time enabl simul begin time slice send agent messag agent resum local agent function transform amount real cpu time local processor local activ arbitrari amount real minut action involv complex respect percept techniqu seri action requir number perform amount simul time number complet independ action perform independ processor compet event execut request place time note techniqu order event time discuss section control reproduc simul granular time span singl event order ect simul result messag exchang agent arriv simul convert event facilit control rout nal destin convert section discuss implement advantag method event base simul event simul environ ned action speci start time increment realiz inspect respect determinist time note di erent notion event simul separ notion intern agent environ messag trac simul environ rout instanti messag event execut resourc modi er script action repres event simul control attempt repres activ event consist reason monitor control import class event simul execut messag event execut event creat time agent simul model method execut execut event de ne method start depend method probabilist distribut speci ed object task structur section execut event calcul qualiti method qualiti resourc usag execut event insert simul time base event repres time slot exist point simul expect nal durat resourc usag method execut characterist accru increment action long event perturb system perturb occur execut forc method ect limit resourc interact execut method method execut method overload resourc requir rst perform rst degrad simul model interact creat limit chang perform vector execut exact chang de ned simul object structur trace lifetim action event mass system method gure action begin agent schedul execut typic deriv task structur gure execut compon agent redirect action form network messag describ method execut mass resolv descript local object true quantit perform distribut method distribut determin result cost durat method resourc ect mass determin result qualiti cost durat determin method consum unit time unit activ action event creat insert action queue normal event remain queue assign nish time point result agent interact event modifi result characterist resourc deplet con ict method durat action qualiti reduc ect chang perform chang result report agent real activ incorpor mass environ agent notifi control perform activ method perform mass simul result cost durat action interact simul method abstract modifi result characterist target action mechan provid mass mix behavior action perform agent produc actual resourc result agent report result updat view maintain consist state section agent fuse sensor data dispar sourc produc estim target posit posit determin agent subsequ gather data simul fusion data mass unabl provid domain knowledg perform calcul report simul estim cost durat analysi process parti sati ed exchang agent data base reason simul maintain consist view result activ perform agent increment improv meet real world requir ad real capabl mass simul rest import class event messag model network trac occur agent commun directli messag agent rout simul event lifetim simul event queue repres travel time messag control durat event model di erent network condit interest network behavior model corrupt drop content messag event execut messag event uenc event larg number messag event delai lost prevent behavior race condit simul util kind order realiz event time agent complet activ successfulli acknowledg simul work accumul event time slot simul begin process gener uniqu number hash kei event time slot kei sort event order list determinist list work realiz event turn coupl control random function initi forc event process order subsequ run weight class event place simpli process sort make simul sacri unpredict natur real world environ control simultan problem experi intellig home project rst project develop mass intellig home project popul intellig capabl work interact environ reason tradeo goal testb develop number speci agent negoti resourc perform respect global deadlin task testb develop explor di erent type coordin protocol compar goal compar perform special coordin protocol gener protocol hope quantit evalu techniqu function term time qualiti stabil result process messag cost develop agent model goal achiev mass build dai simul task request maintain statu simul agent interact manag sensor agent mass event occur time subsequ run due agent behavior due di erent reason activ protocol vari task characterist intellig home project includ agent wash ee air run simul minut simul run di erent resourc test protocol scale number resourc con ict space limit prevent complet report project complet result found give synopsi small make reorgan exist relat fact hot water produc normal assum sucient water attempt maintain consist level tank time desir reduc unnecessari network initi organ agent coordin unnecessari agent examin assumpt owner decid con ict time preexist assumpt place put produc hot water request longer sucient resourc perform task lack adapt repeatedli progress normal poor job wash insuci amount hot water determin diagnost engin result poor perform observ intern sensor user rst determin requir resourc resourc coordin explicitli commun water requir sucient produc preliminari diagnosi act simpli make resourc coordin protocol diagnosi chang organiz structur explicit coordin perform hot water usag review modi ed experi interact ne valid updat assumpt note time dai water requir threshold coordin recommend mass simul explor evalu approach adapt tremend invest knowledg engin creat realist environ distribut sensor network distribut sensor network stress class issu address project present research set sensor arrang environ goal scenario sensor track mobil target move environ sensor abil determin locat target sensor organ coordin manner permit measur triangul situat analog distribut resourc alloc sensor repres resourc alloc task time addit hurdl includ lack reliabl scale hundr thousand sensor abil reason real fault prone environ section show migrat simul hardwar environ technic challeng architectur pose project oper work foreign simul environ actual hardwar function handl commun provid obviat mass simul environ oper domain agent inhabit attach sensor node develop maintain rome lab execut control commun sensor state log resourc model schedul directori servic observ problem solver execut control commun scan schedul fig organ agent upper bound domain depend lower bound independ model commun capabl action result individu posit direct mobil target di er mass signi wai simul nite number prede ned return actual result abstract qualiti return mass timelin continu wait acknowledg time slice lack standard seed result run nondeterminist rst determin requir interfac environ deriv commun shown gure control compon determin correct time commun compon funnel messag trac medium provid addit execut provid bridg action interfac sensor made line remaind work roughli line code domain depend problem reason goal agent scan produc scan pattern implement startup init fig task structur initi agent address schedul section provid quick exibl schedul techniqu resourc model compon track avail local power usag sensor compon schedul determin resourc evalu probabl action fail unexpect resourc usag commun compon enhanc add reliabl messag servic sequenc timeout enabl compon ag messag compon ad address task schedul target detect manag track gener perform negoti case high interact compon gener domain depend knowledg ad task gure initi dictat agent initi local perform background contact region manag solut region manag negoti individu sensor obtain maxim area coverag seri fast scan target track manag negoti agent perform synchron measur triangul technolog enabl provid ne grain schedul altern plan select capac remov con ict commit metric evalu approach rm error measur actual target synchron achiev track task successfulli demonstr simul challeng task migrat actual sensor hardwar agent host pc attach small omnidirect sensor serial parallel port task facilit develop middl abstract low level sensor action api interfac actual di er unpredict commun extrem measur valu vari action durat lack central clock de nition synchron agent activ agent modi ed address instanc ad reliabl commun model time de nition scheme control compon agent successfulli test hardwar process develop negoti scale techniqu appli interest domain produc consum transport architectur prototyp environ transport domain conceptu type gener middl layer api sensor driver implement sander move resourc place produc consum di erent face consum quantiti resourc order produc characterist domain altern exist factori transport choic made point pct agent make organiz structur system schedul coordin negoti problem solv reaction term symptom model organiz design tm mq fig role organiz knowledg pct agent system di er previou organiz design addit describ local goal capabl agent subject view describ agent system consum obtain resourc identifi pathwai transport made view condit view agent condit view essenti subject modi ed address current runtim condit gure subject view potenti candid capabl produc produc consum coordin condit view identifi cheap depend current goal agent side remov idea constrain search space present task speed reason select probabl success condit view organiz design agent major make base organ made induc chang agent behavior addit local diagnosi compon gener condit view mention diagnosi compon made causal serv road map symptom potenti compon monitor state listen event stream monitor detect behavior fig subject condit task structur pct causal model identifi potenti result set candid solut solut induc make organiz design modi cation local condit shown gure architectur facilit sort provid common mechan interact compon diagnosi compon integr simpli plug modi cation compon fig solut pct environ experi environ converg time diagnosi techniqu stabl ecienc organ gure initi condit environ left includ transport bring resourc produc consum requir di erent organ function ecient di erent diagnosi techniqu appli situat evalu characterist individu eventu converg solut shown side gure detail result experi found sophist pct environ test evalu dr tim kei idea articl abil architectur quickli easili prototyp explor di erent environ vari problem solv schedul implement retain abil code futur project migrat actual implement solut agent framework develop set convent exist compon facilit process agent construct exampl gener compon combin domain speci produc agent capabl complex reason behavior problem solv languag extend framework provid quantit view agent capabl interact import demonstr abil easili work wide rang includ discret time mass realtim actual make gener compon mass simul environ built permit rapid model test adapt behavior agent regard diagnosi repair mechan function mercuri environ primari simul success test work enabl nal result reason basi comparison compet adapt techniqu intellig home show heterogen group agent implement test mass di erent coordin problem solv techniqu languag extens model domain problem solv process distribut sensor network agent deploi simul real hardwar agent incorpor schedul ran notion organiz design condit adapt time diagnosi compon feel main advantag framework domain extens ort mass retain determin sacri unpredict make suit algorithm gener analysi acknowledg individu addit contribut research paper thoma wagner contribut schedul extens formal michael brett anita thoma ping xuan xq zhang contribut intellig home project project implement roger sander rome lab provid simul hardwar brett contribut work pct domain refer martin andersson sandholm level commit contract myopic strateg agent fifteenth nation confer arti cial page martin dynam adapt autonomi multiag system journal theoret arti cial accept public special issu autonomi control softwar agent framework multiag system develop implement phd decker environ center analysi design coordin mechan phd depart comput keith decker victor lesser gener partial global plan algorithm intern journal intellig cooper inform keith decker victor lesser quantit model complex environ technic comput scienc technic report keith decker task environ center simul simul comput model institut group aaai forthcom keith decker victor lesser gener partial global plan algorithm intern journal intellig cooper inform june keith decker victor lesser quantit model complex environ intern journal intellig system decemb special issu comput model model characterist agent keith decker victor lesser coordin assist mix human comput agent system concurr engin page concurr technolog corp umass cs martha pollack steven paul cohen control design agent architectur ai winter issu bryan horl reusabl compon architectur agent construct umass depart comput scienc technic report octob bryan brett victor lesser adapt organiz structur comput scienc technic report massachusett novemb bryan horl al white bryan roger kyle victor lesser distribut sensor network real time track submit autonom agent lee ndumu colli build distribut system appli arti cal intellig victor michael bryan brett anita regi thoma ping xq zhang system intellig environ control comput scienc technic report massachusett octob victor michael bryan brett anita regi thoma ping xq zhang system intellig environ control intern confer autonom acm press nelson roger chri swarm simul toolkit build simul web fe nortel network web page bryan victor thoma wagner implement soft agent control submit autonom agent thoma alan victor lesser heurist task schedul intern journal approxim special issu version umass cs
Agents/781 1 multiag system specif uml statechart aim intellig manufactur frieder stolzenburg informatik universit institut ur rheinau koblenz multiag system specif uml statechart aim intellig manufactur arai frieder stolzenburg knowledg industri dept institut ur informatik advanc system center fachbereich informatik mitsubishi materi corpor universit rheinau koblenz tokyo germani japan abstract multiag system paradigm contribut field theori technolog develop order design multiag standard procedur present industri applic complex structur plenti work resourc requir standard specif method standard method design softwar kei word simplic wide accept method multiag uml statechart aspect multiag advantag type diagram appli method robot soccer network applic approach enabl standard design multiag automat translat specif run implement verif formal analysi rigidli formal manner system specif concentr paper emerg author visit octob septemb formal specif multiag system gener applic robot network applic homogen heterogen gener approach softwar methodolog standard agent multiag unifi model languag introduct softwar system view multiag system provid good mean robust architectur softwar system system part function multiag system interest industri applic research foremost research topic field artifici intellig present implement system systemat formal clean show appli robot soccer activ industri applic activ web servic applic draw feasibl enhanc creat nowadai internetwork technolog import context respect multiag wide accept method design network enabl flexibl robust system industri applic advanc manufactur design multiag system overview applic agent technolog motiv multiag system system intellig agent pursu set goal task agent comput entiti softwar program robot view perceiv act environ autonom behavior partial depend experi import system agent design implement current softwar specif techniqu adapt respect multiag coordin agent express method make type diagram specif multiag uml statechart advantag procedur hand design programm rapidli develop hand specif easili turn execut type diagram formal base statechart verif formal analysi multiag model check focu laid rigidli formal specif method multiag basi formal system demonstr applic approach applic robot soccer detail featur uml statechart exploit develop multiag system translat specif execut interest reader refer overview paper distinguish system homogen agent principl system heterogen agent abil perform task team soccer agent view system homogen web servic peer peer applic system heterogen agent applic simul robot soccer section network applic section show kind multiag system introduc section multiag system studi domain robot behavior agent includ collabor mean uml statechart method applic industri introduc network applic domain order investig effect method domain discuss gener problem multiag system mean uml statechart relat work state machin dynam system appropri state machin statechart specif dynam procedur aspect softwar industri applic order provid understand give formal definit section demonstr statechart good mean dynam system multiag independ agent interact basic compon statechart part uml accept mean dynam behavior softwar system rigor formal flexibl implement analysi multiag system state connect transit condit action annot repres rectangl round corner structur hierarch transit drawn direct arc interconnect state transit annot event recept request chang guard action state composit behavior agent state sequenc simpl state finit configur reader refer section state machin figur sketch behavior robot soccer agent discuss detail section detail hidden decomposit icon machin simpl state init composit state concurr state commun start state initi state init state attack defend belong main state behav initi state init permit transit annot empti guard correspond agent center point agent kick ball full power enter attack state attack defend state mutual connect transit agent ball attack defend state transit attack defend back score goal attack mark commun defend init behav figur state machin behavior configur step behavior state machin introduc concept configur step definit configur root tree root node topmost initi state state machin configur complet leaf node label composit state initi state introduc successor leaf node label concurr state tree branch point state machin model behavior agent act environ main effect agent interact environ state machin chang situat form sequenc situat situat defin map variabl valu current world includ agent configur agent perform step configur proper multiag account agent compon agent perform step time distinguish part figur show configur state machin transit init attack reader refer briefli summar definit definit configur state machin configur mean transit state state annot current written node label ident replac complet annot event guard hold actual situat revisit figur transit init attack annot state step configur shown figur definit init node replac attack attack concurr state commun belong successor node attack state complet triangl symbol behav init behav commun attack figur configur transit definit configur configur simultan state occur path configur tree obtain appli model concurr behavior descript multiag entiti interact concurr heavili make concurr state applic section concurr state prerequisit proper execut parallel applic introduc applic robot soccer network bit detail robot soccer section tackl author consid network applic section interest thing applic appli techniqu describ multiag system section continu section address problem interact possibl heterogen agent robot soccer robocup soccer game chosen central topic aim innov appli social problem industri robocup intern joint project promot artifici relat field order perform soccer game robot technolog incorpor includ design principl autonom multiag strategi acquisit reason robocup consist leagu real robot size simul robot simul leagu offer softwar platform research softwar aspect robocup softwar design aspect import soccer agent design approach figur mode level abstract desir agent script level plan skeleton long mode chang role skill level host basic action soccer agent ident intern structur agent homogen natur state behavior agent state machin heterogen agent system multiag system statechart section guard logic good idea implement state machin logic program languag prolog approach develop soccer agent declar present advantag make prolog guard condit express yield specif process program conveni implement tree agent programm full program languag design implement agent restrict soccer domain homogen agent agent state machin agent role depend respect situat doubl pass situat interact agent trigger synchron state conveni skill skill skill skill figur layer architectur statechart hierarch structur make modular specif multiag system assum soccer plai agent modul move kick control independ order perform agent aim oppon goal kick devic time ball shot initi posit agent observ action requir synchron move modul kick modul shown figur synchron concurr region state synch state introduc uml synch drawn conjunct fork join shown thick bar figur left bar fork bar join state fire outgo transit synch state limit bound differ number time outgo incom transit fire bound set ball kick simul synchron introduc variabl rang synch initi effect transit synch state express set condit action transit fork join state shown figur increment introduct make synch state superflu note addit annot treatment synchron shown transit annot shown pass adjust goto shoot aim move kick figur machin concurr state pass network applic internet technolog widespread industri plenti data exchang internet data includ html page numer plant oper data exchang internet involv problem commun protocol internetwork technolog applic technolog approach design scheme data exchang multiag system method robot soccer introduc network applic domain multiag system concurr action collabor agent explicitli recent internet network gener prevail accompani advanc induc develop industri applic integr manufactur resourc achiev mean applic base multiag system network applic expect plai import role real intellig manufactur compon facil distribut show industri multiag system design method robot technolog investig design principl autonom multiag strategi design multiag system shown figur heterogen user broker proxi agent sensor behavior user agent commun send receiv file support broker agent agent primari function invok extern event invok user broker agent alloc destin file user agent broker agent enabl function broker agent user agent directli commun proxi agent introduc sensor agent network condit notifi result user agent optim user agent behavior heterogen agent function multiag system mean statechart case action execut parallel express region statechart detail section multiag system show behavior singl agent mean domain robot soccer network applic featur multiag system repres method remark robot soccer network applic method feasibl import aspect multiag domain characterist function approach enabl design multiag verif formal analysi system strict formal long run switch role shown figur user agent design state behavior similar soccer player agent figur toplevel behav user agent put state correspond mode level script level approach robot soccer domain figur exploit hierarch structur statechart figur architectur network applic figur state machin user agent extern user agent provid put assum user agent put analog attack defend state robot soccer domain put user agent transfer file state agent receiv file action initi click event discuss put state greater detail figur synchron put state composit state concurr send depict figur send design provid file transfer introduc order ensur function synchron concurr state enabl synch state render circl concurr region statechart synch state fork join thick bar stand transit concurr state synch state enabl synchron consequ figur synchron agent collabor statechart repres collabor collabor heterogen agent figur illustr concurr rightmost region belong sensor user agent figur design perform check task transfer substat kind mirror order enabl fast file transfer synch state repres collabor agent concurr singl agent interact agent parallel thread activ agent express synch state state machin synch state translat simpler synch introduc dedic synchron variabl figur transform concurr region execut possibl account definit action agent coordin extern event variabl synchron realiz state code explicitli prolog relat work method specif multiag system make standard softwar engin method formal easili achiev execut formal system analysi verif combin featur origin discuss work extend unifi model languag agent work analysi agent system case overview applic multiag process inform electron medic reader refer agent design extens uml object manag develop uml extend uml agent bunch diagram express aspect multiag templat packag sequenc collabor state activ diagram import aspect system agent interact collabor figur collabor agent stress interact protocol detail level combin sequenc state diagram good idea put nest present interest statechart label agent perform respect action type direct transform specif contrast approach present softwar engin describ system level abstract agent engin introduc level agent level previou approach discuss exploit uml design multiag system make standard diagram languag class diagram ontolog commun languag fipa acl kqml addit type architectur diagram set agent class relat protocol role diagram introduc relat interact protocol uml idea make standard notat author design multiag system mean diagram type agent design analysi approach composit verif multiag system agent hierarch standard notat statechart class diagram approach tempor logic composit verif abstract level base agent system consist number agent extern world formal descript exist multiag system approach nice theoret point view tool approach softwar engin verif specif standard procedur graphic notat similar uml collabor diagram base procedur multiag system emploi tool technolog develop model check class logic obtain tempor logic tree logic modal logic system sever agent multiag finit state machin modular increment design analysi multiag system standard softwar engin remedi approach approach show specif multiag system statechart formal analysi model check design analysi techniqu import industri accept approach combin softwar engin artifici intellig aspect major emphasi paper final remark present method specif multiag system appli robot soccer homogen agent network applic system heterogen agent present paper advantag approach present multiag system type statechart translat automat execut prolog commun agent statechart explicit desir subject work work concentr refin formal specif multiag system automat analysi system properti interest formal verifi multiag specif translat run code program languag approach present lai basi formal specif verif multiag system refer serafini model check algorithm system intern workshop intellig agent agent lnai page poggi exploit uml design system engin societi agent lnc page treur composit verif system tempor logic journal languag grefenstett strategi acquisit genet algorithm handbook genet chapter page van nostrand wooldridg roadmap agent research develop autonom agent murrai soccer agent uml fachbereich universit murrai agent uml robot soccer stolzenburg logic approach soccer agent engin robocup robot soccer world cup lnai page object manag model languag septemb version bauer extend uml agent agentori inform system workshop nation confer artifici page pnueli semant statechart ito intern confer theoret aspect comput lnc page york stolzenburg reason cognit robot system und de spatial agent implement logic express languag robot soccer lnai page editor multiag system modern approach distribut artifici intellig mit research report frieder stolzenburg multiag system specif uml statechart aim intellig manufactur kurt lautenbach reproduc empti mark jan murrai agent uml robot soccer andrea winter exchang graph anna simon slice book technolog ein technik fur ein bernt volker approach enabl program understand preprocess languag frieder stolzenburg specif multiag system statechart formal analysi model check oliv ration agent statechart util function torsten urgen ebert conceptu model web site gener graph technolog carlo che urgen frieder relat normal logic program transform properti harri andrea winter appli gupro geo case studi pascal von stephan model concurr algorithm urgen bernt franz lehner workshop softwar reengin mai stephan workshop und fur jan oliv frieder stolzenburg logic approach soccer agent engin peter zhang ftp intern workshop theorem st juli frieder garc carlo che introduc gener specif logic program manfr specif symbol implement constraint peter fabio tame richard andrea andi sch standard exchang format urgen roger formal ulrich fuzzi techniqu cach memori jen implement urgen bernt franz lehner workshop mai peter michael abduct model construct urgen bernt andrea winter interchang format reengin tool frieder oliv jan bj spatial agent implement logic express languag kurt carlo simon zur hybrid system frieder stolzenburg power model gener peter jd bruce spencer merg path improv minim model hyper tableaux urgen roger uh worldwid peter norbert ulrich furbach confluent connect calculu bernt andrea winter queri enabl technolog softwar reengin urgen georg pick program urgen ulrich ilkka niemel nonmonoton effici calculi implement urgen steffen infer mechan theori applic ws ki jose urgen mauricio claudia semant logic program stefan urgen teodor przymusinski super logic program urgen dix logic program paradigm stefan urgen burkhard ulrich zukowski comput model manfr kamp greql ein fur da peter urgen angelika manfr andrea winter und formal grundlagen peter da org thoma marx workflow model wfmc dieter obel schedul criteria ag constraint process hard system ulrich furbach disjunct logic program horn program control program andrea schmid solut count infin problem distanc vector rout ulrich michael frieder stolzenburg proof debug peter sch model elimin simplif applic softwar verif bernt andrea peter urgen ebert program system urgen jorg lobo logic program nonmonoton reason kurt carlo jan technischen anwendungen manfr kamp manag softwar repositori program tool gener approach
DB/782 3 issn de recherch institut nation de recherch en informatiqu en automatiqu perform evalu altern map scheme store xml data relat daniela florescu donald kossmann mai em perform evalu altern map scheme store xml data relat daniela florescu donald kossmann interact rapport de recherch mai page xml emerg domin data format data process internet queri xml queri languag studi xml data store queri standard relat system present altern map scheme store xml data relat discuss queri translat sql queri map scheme present result perform experi analyz altern map scheme term queri perform updat perform discuss focuss xml result paper relev data model queri languag data semistructur relat perform unit de recherch inria rocquencourt domain de bp le chesnai cedex telephon intern intern de perform pour le de xml dan system de base de le langag xml merg comm le langag standard de sur le web il est fort de interrog ce donn en langag proposit de langag ont dan ce dan la recherch dan ou dan cet articl nou le du de donn xml dan de de base de donn de de en le de sql de ce nou le donn xml dan de tabl nou la de dan de sql pour de de donn nou compar de perform nou de en le compromi entr le en term de de la de perform de de perform de le sur le langag de de donn xml langag de le dan cet articl de de donn dune larg class de langag de pour de donn donn langag de base de donn perform perform evalu altern map scheme store xml data relat introduct clear applic met data model exampl applic integr data data sourc applic schema time data support kind data model common featur data model lack schema data xml emerg standard data retriev data special queri languag exampl xql lorel common featur languag regular path express abil extract inform schema data approach store data xml execut queri data build system research prototyp lore strudel lotu note commerci system tailor store retriev xml special design structur queri optim extent sgml system design store graph softwar engin environ fall categori system rich data model capabl oodbmss exploit approach studi implement commerci system approach pursu part monet project relat system xml data map tabl relat schema queri pose queri languag translat sql queri oracl microsoft build tool facilit approach unclear approach accept system work long time system matur scale larg amount data current gener system matur evalu queri larg relat system matur scale addit advantag relat xml data tradit data make build applic involv kind data extra relat built support tradit data requir process xml data vastli requir process tradit data optim relat system recent work concentr model rr daniela florescu donald kossmann algorithm extract schema xml document data goal work analyz data queri workload target applic order approxim schema data store relat schema extract make easier formul queri experi paper studi perform relat process xml data extract goal studi gener advantag pitfal relat store manag xml data studi fundament scheme store xml document relat describ altern map scheme store xml show queri updat process map present result perform experi analyz space run time reconstruct xml run time seri queri updat function map scheme map scheme studi simpl implement improv model extract schema result perform experi input model synthet synthet benchmark queri updat function remaind paper organ section overview xml queri languag xml section describ altern map scheme store xml document relat section address queri process issu section present result perform evalu section suggest futur work data model queri languag xml extens markup languag creat world wide web consortium subset sgml special design web applic goal xml enabl deliveri data structur arbitrari depth complex applic requir structur xml retain kei sgml advantag valid languag design vastli easier implement full sgml xml html major inform provid tag attribut inria perform evalu altern map scheme store xml data relat document structur nest level xml document option descript grammar applic perform structur valid xml document consist set boundari delimit element call set attribut attribut element arbitrari list subel xml languag assum data sourc export inform address member famili structur inform repres xml person uniqu id ag attribut inform hobbi person provid valu subel child element person children famili child element person pointer child columbia rr daniela florescu donald kossmann data model data xml standard syntax data manag data independ aspect manag data extens studi broadli data refer data schema advanc implicit schema larg size chang schema descript describ current state violat schema data strongli valu attribut type model literatur big major base label direct graph simpl graph data similar oem model model direct label graph node model object outgo edg object model attribut object edg label attribut object uniqu intern object set attribut leav graph label data valu edg target object leav call data attribut call refer unlik object orient data object constrain similar set attribut valu data attribut constrain type graph model fragment xml data depict figur map origin develop theoret data model problem order attribut subel object order introduc order semant relev order order case order order graph model total order set outgo arc node graph question concern distinct attribut subel decid maintain model arc graph concern model xml refer implement refer regular arc graph impli loss inform translat xml data model distinct attribut element refer xml distinguish data extend xml respect inria perform evalu altern map scheme store xml data relat ag address ag hobbi address ag child child person person ag address child address person person peter john david mari hobbi cycl swim columbia av av av av hobbi paint figur data graph xml fragment impact result involv extra bookkeep queri languag state art abund work queri languag data major common characterist languag fact base label graph model languag abil queri schema abil accommod irregular miss repeat heterogen record regular path express paper queri enabl data extract xml document express map ontolog queri unknown unpredict data queri languag data featur regular path express abil queri schema attribut power restructur result queri complex xml document ignor restructur part concentr data extract part languag data extract costli part queri evalu queri select rr daniela florescu donald kossmann conjunct tree leav label variabl unari predic edg pattern label string unari predic regular path express construct concaten kleen star alphabet string special symbol denot wild card match attribut mark option queri person older live retriev express select av evalu queri result tabl bind variabl queri semant languag natur object match pattern data tree root object match requir pattern predic constant select pattern option edg bracket object qualifi match edg match match option option option edg queri return tupl store xml document relat describ altern map scheme store xml document relat start point label graph repres xml section map scheme determin tabl creat relat indic tabl store object node attribut valu map scheme conceiv xml concentr canon map scheme map scheme repres repres valu discuss inria perform evalu altern map scheme store xml data relat variant discuss altern result map scheme assess map scheme part perform evalu section map attribut edg approach simplest scheme store attribut singl call tabl edg tabl edg tabl record oid sourc target object attribut refer point ordin number recov attribut object order carri updat object attribut edg kei edg tabl figur show edg tabl popul xml document section bold face number target column oid target object entri target column refer valu valu store put valu tabl illustr discuss altern wai repres valu edg approach section discuss role shown figur term establish index sourc column combin index column index sourc column forward reconstruct object oid index backward object child experi set indic part perform experi report found indic simpl variant edg approach store attribut separ tabl experi variant reduc size cost queri process index longer slow backward dramat case variant remaind paper rr daniela florescu donald kossmann sourc ordin target ag peter address fruit child child ag figur edg tabl sourc ordin target paint swim cycl child sourc ordin target figur attribut tabl attribut approach map group attribut tabl approach resembl binari storag scheme store semistructur approach correspond horizont partit edg tabl partit attribut creat attribut tabl attribut xml attribut tabl kei attribut tabl mean edg approach figur show hobbi child attribut tabl xml document section term construct index sourc column attribut tabl separ index target column analog index scheme edg approach sourc ord ord child child ord hobbi hobbi peter null null peter null null mari paint john null null swim john null null cycl david null null null null figur tabl inria perform evalu altern map scheme store xml data relat tabl approach studi gener singl tabl store attribut xml document correspond tabl separ column attribut occur xml document tabl correspond result outer join attribut tabl structur tabl attribut xml document figur show instanc tabl xml document figur tabl set great deal repres object attribut child put tabl advantag disadvantag index scheme attribut establish separ indic sourc target column tabl normal approach fourth variant tabl approach approach attribut store separ tabl approach correspond oracl store attribut occur xml document separ tabl principl attribut approach row xml object tabl tabl normal structur tabl tabl attribut xml altern establish singl tabl attribut organ tabl edg tabl experi approach found inferior rr daniela florescu donald kossmann sourc ord ord hobbi hobbi hobbi peter null null null mari paint john null david null null null hobbi sourc ord target swim cycl figur tabl kei tabl sourc kei tabl attribut attribut refer object approach attribut set fact object attribut natur set null figur show tabl hobbi tabl xml document establish separ indic sourc target column tabl sourc target column tabl map valu turn altern wai map valu xml document string studi variant store valu separ store valu attribut variant result total map scheme section assess map scheme separ tabl store valu establish separ tabl conceiv data type separ tabl store string structur tabl simpli type column depend type type figur show approach combin edg complet figur tabl gener part state section xml data standard extend xml respect inria perform evalu altern map scheme store xml data relat edg sourc ordin target ag int string address string child ref child ref ag int int string peter av mari av paint av figur edg tabl separ tabl tation map scheme column tabl tabl valu ref indic refer separ tabl establish approach term index column tabl closer figur observ store time string tabl reason occur time origin xml document label graph repres document compact map origin xml document store string approach sever complic implement updat requir refer count garbag studi compact paper author xml document establish separ address object referenc david object order compact model david live place inlin obviou altern store valu attribut tabl edg correspond outer join edg tabl tabl correspond outer join tabl column data type refer approach inlin figur show inlin work attribut approach larg number null valu occur term establish indic column addit sourc target indic rr daniela florescu donald kossmann sourc ord val int val string target null paint null null swim null null cycl null child sourc ord val int val string target null null null null null null figur attribut tabl inlin altern column data type establish singl column store valu gener type valu convert string repres make imposs index order object map scheme state begin map scheme conceiv variant simpl map scheme present previou section tabl approach hybrid approach establish attribut tabl frequent attribut store attribut edg inlin small valu store larg valu separ tabl map scheme address literatur heard discuss select outer join attribut attribut store child hobbi attribut separ attribut tabl store address combin ag address individu attribut tabl approach attract object ag attribut occur queri involv object typic attribut state model algorithm extract inform discuss approach section select join attribut store ag address variant store ag address tabl inria perform evalu altern map scheme store xml data relat establish order store inform object address materi join attract queri attribut outer join attract queri subset attribut relat theori materi join outer join develop context access support relat materi view establish order speed execut queri find view materi activ research area context data context map xml document queri process updat discuss detail implement queri updat altern map scheme full detail scope paper concentr overview kind oper involv order implement queri pose xml queri languag propag updat carri origin xml document queri approach translat xml queri rdbm execut postprocess order queri result gener xml request step carri straightforward interest step translat sql gener sql kind oper rdbm carri gener sql categori queri altern map scheme give perform result section reconstruct object xml document import type queri reconstruct object xml object oid attribut object comput transit simpl queri execut map simpl lookup sourc edg tabl join tabl rr daniela florescu donald kossmann lookup sourc attribut union result produc lookup join tabl index lookup sourc union target column join tabl combin attribut approach inlin simpl lookup join tabl map sort ordin requir requir semant queri queri involv reconstruct sort sourc requir result object easili select valu pattern match queri involv select translat sql queri straightforward queri oid object swim hobbi inlin queri execut simpl lookup column hobbi hobbi tabl valu store separ queri involv lookup tabl join edg hobbi hobbi tabl queri involv addit join approach user interest oid object swim hobbi ag execut queri involv edg tabl edg hobbi ag join attribut union hobbi ag hobbi ag approach approach materi result kind join join approach queri languag make pose queri pattern xml document queri interpret graph section evalu queri attribut approach involv execut join addit possibl join number edg pattern evalu queri approach involv execut join addit join number node inria perform evalu altern map scheme store xml data relat option predic result irregular xml queri languag pose queri option predic object year swim hobbi queri translat approach sql union queri object year swim object year hobbi duplic elimin requir part predic attribut common featur xml queri languag capabl support queri predic attribut queri object address street edg queri easili translat sql ad predic address street translat queri involv initi step schema relat queri order relev attribut tabl relev tabl inform tabl attribut store tabl commerci product regular path express xml queri languag support regular path express make navig irregular unpredict structur transit closur ancestor john queri translat sql queri straightforward rdbm support sql queri step updat updat xml document propag relat straightforward seri sql delet statement requir propag updat discuss insert delet object attribut insert object object easili insert map scheme edg attribut row gener attribut object number row depend presenc object row insert object object attribut rr daniela florescu donald kossmann cardin row gener approach row insert tabl row insert tabl attribut cardin valu store separ row insert tabl object object attribut tabl attribut tabl creat insert attribut ad attribut exist object simpl straightforward edg attribut approach slightli complic scheme map attribut case depend presenc attribut object exist attribut row gener tabl updat insert attribut involv updat ordin attribut belong object locat attribut xml document procedur case order section valu store separ tabl attribut tabl updat attribut measur object attribut made scheme delet object object easili delet delet row tabl valu store separ object read delet order object valu delet tabl delet attribut delet attribut object simpl implement edg attribut approach involv case approach delet attribut involv reorgan ordin valu approach separ attribut read order attribut inria perform evalu altern map scheme store xml data relat evalu map scheme plan attack order studi altern map scheme carri seri perform experi size result relat map time relat xml time reconstruct xml document relat time execut class xml time execut kind updat function experi carri synthet xml document start point real xml data extent unclear characterist typic xml document real xml data gener xml document resembl real xml xml document studi map scheme model characterist found real xml data presenc larg text simplifi present result altern map scheme section studi approach separ tabl order studi wai map attribut studi attribut approach inlin order compar inlin separ tabl variant commerci relat system instal sun sparc station mhz processor mb main memori disk store intermedi result queri process machin run solari limit size main memori tenth size xml document default state option queri experi describ softwar run rdbm program prepar xml document implement updat implement java run machin call relat java program implement jdbc agreement publish vendor rr daniela florescu donald kossmann number object fn maximum number attribut refer object fv maximum number attribut valu object size short string size long text ps percent valu string percent valu text number attribut size attribut tabl characterist xml document benchmark benchmark characterist synthet xml document gener perform experi tabl xml document consist object object attribut refer attribut valu document nest object xml data model section document refer semant document nest attribut label attribut refer fact byte long type short string byte long text byte valu string valu text uniform distribut order select number attribut object individu determin object referenc object attribut graph repres xml document fact relev experi xml document valu data type tabl gener relat map scheme inlin column includ attribut scheme inlin index string section index text obviou deviat index scheme section string attribut edg repres relat repres inform repres paramet set experi shown tabl creat object object attribut perform evalu altern map scheme store xml data relat queri descript featur reconstruct xml object oid select oid object attribut rang select object attribut valu predic object option predic object predic attribut object match complex pattern refer node pattern match object connect chain refer regular path express object object connect chain refer regular path express object predic attribut tabl benchmark queri templat object refer attribut valu total approxim text byte short string byte benchmark queri tabl describ queri templat experi formul queri appendix paper queri templat test varieti featur provid includ simpl select oid option predic attribut pattern regular path express test queri part benchmark test templat light variant predic select index lookup intermedi result heavi variant indic typic attract intermedi result set predic select valu light queri variant select valu heavi variant predic set select valu predic involv string benchmark size result set benchmark queri list tabl queri translat sql queri map scheme outlin section sql translat depend select made translat correct map scheme check result produc queri reproduc carri benchmark queri queri carri warm time order run time queri rr daniela florescu donald kossmann tabl size result set benchmark queri gener commit object insert attribut randomli select commit attribut delet random attribut form random commit attribut delet random commit object tabl updat function warm impact perform light queri oper data main warm impact result heavi queri updat function part carri updat function tabl updat function test insert delet object individu attribut object characterist object attribut string probabl text probabl implement updat function map scheme section updat function insert xml attribut attribut attribut tabl creat tabl alter part execut updat function product carri kind oper cost oper strongli depend implement interest rdbm carri updat function sequenti order size tabl show size xml document result relat map scheme size xml document indic map scheme produc larger relat attribut approach result mb base store attribut part attribut inria perform evalu altern map scheme store xml data relat occur approxim time attribut divid xml document edg xml store multipl time produc base data attribut scheme recal section variant edg approach store attribut separ tabl result smaller relat reduct mb result queri time produc base data tabl section compar attribut approach inlin result smaller relat store inlin variant null produc inlin variant store compact rdbm size indic consum space xml attribut edg base data indic total tabl size time tabl show time prepar xml document actual analyz result tabl creat indic map scheme longest approach approach complic data approach produc relat data attribut edg prepar total tabl time rr daniela florescu donald kossmann reconstruct xml document tabl show time reconstruct xml document write relat data map scheme fact compel argument store xml data state section map scheme sort oid order sort environ mb sort mb disastr run time approach separ tabl explain tabl scan time attribut order restructur data carri join tabl attribut edg tabl reconstruct xml document run time queri tabl show run time benchmark queri map scheme optim rdbm found good plan default improv tabl show run time obtain optim tune optim improv achiev light queri forc optim indic tabl scan index join hash join make altern wai map attribut approach winner inlin beat separ tabl result explain fairli easili edg approach perform poorli heavi queri join edg tabl data edg tabl irrelev queri approach larg tabl perform poorli heavi queri attribut relev data process kind binari tabl approach observ monet project inria perform evalu altern map scheme store xml data relat attribut edg tabl run time queri data xml data high approach sensit size intermedi queri approach work tabl tabl perform poorli case explain inlin separ tabl inlin simpli win save cost join tabl result show inlin beat separ tabl larg valu inlin extent except rule queri involv predic attribut wild card edg approach attract queri predic directli appli edg tabl execut predic involv separ step gener sql union queri map scheme run time updat function tabl show run time updat function benchmark map scheme point import rr daniela florescu donald kossmann attribut edg tabl run time updat function cost creat object fairli map scheme insert attribut approach approach updat insert statement execut approach result data result complic organ make move attribut tabl attribut turn attribut mari delet attribut approach delet object cheapest edg statement carri probe edg tabl detect valu delet delet valu delet relev row edg tabl delet object attribut approach involv separ sql statement attribut tabl approach kind overhead target column probe separ order valu delet approach kind overhead carri probe target column probe relev tabl experi map scheme experi map scheme part decid present relev result paper section show materi outer join attribut inria perform evalu altern map scheme store xml data relat separ tabl inlin anticip anticip unanticip unanticip tabl materi outer join attribut tabl benchmark highli irregular data map scheme recommend algorithm extract schema materi separ attribut tabl run queri oper attribut queri materi queri save cost join individu attribut tabl run unanticip variant variant oper attribut materi join tabl show result run anticip unanticip variant tabl materi inlin tabl show simpl attribut scheme perform queri fa make valu store separ fa show essenti perform case cost queri process domin join tabl improv store refer result notic valu materi anticip case factor save join domin cost unanticip case reason unanticip case join larger studi perform relat manag xml document relat import rdbm rr daniela florescu donald kossmann product matur scale tradit data semistructur data relat make develop applic kind data virtual extra experi show rdbmss process complex xml queri larg queri perform achiev todai commerci technolog neg experi show reconstruct origin xml data relat data updat complic implement case extra made translat xml queri updat sql relat map scheme consid translat easi implement cheap translat complex sophist map scheme potenti address compon author concurr control implement rdbm compon rdbm work properli requir fulli structur data result kind function implement possibl execut great deal function implement rdbm studi altern wai store xml data relat result show approach base separ attribut tabl attribut occur xml document inlin valu attribut tabl approach larg valu inlin hurt perform approach desir make kind data inlin inform attribut singl statist xml document knowledg anticip queri workload encourag show robust perform achiev simpler approach result show sophist approach hurt avenu futur work result initi step order answer big question relat data store manag xml document plan run benchmark oodbmss xml data repositori benchmark decid relat product store xml document result encourag work implement binari data model inria perform evalu altern map scheme store xml data relat refer serg abiteboul queri data proc int conf theori serg dallan jason jennif janet wiener lorel queri languag semistructur data intern journal digit april kersten flatten object algebra provid perform proc int conf data engin page adam bosworth xml data workshop queri process semistructur data data suciu queri languag optim techniqu unstructur data proc acm sigmod conf manag page peter buneman semistructur data proc acm symposium principl system page peter susan mari dan suciu ad structur unstructur data proc int conf theori stefano sara stefano letizia tanca graphic languag queri restructur xml document proc int www vassili serg sophi michel scholl structur document queri facil proc acm sigmod conf manag copeland decomposit storag model proc acm sigmod conf manag page suciu store semistructur data store mari daniela alon dan suciu queri languag xml proc int www mari daniela alon dan suciu catch boat experi manag system proc acm sigmod conf manag mari daniela alon dan suciu queri languag manag system sigmod septemb daniela alon dan suciu queri optim algorithm semistructur data technic rr daniela florescu donald kossmann roi goldman jennif widom enabl queri formul optim semistructur proc int conf larg data base ullman implement data cube proc acm sigmod conf manag page june kemper moerkott access support index method object base inform engin system inform widom manag system semistructur data sigmod septemb mchugh widom queri optim semistructur data technic stanford novemb rajaraman index semistructur data technic stanford januari mohan lotu dbm world workshop queri process semistructur data serg rajeev motwani extract schema semistructur data proc acm sigmod conf manag yanni hector jennif widom object exchang heterogen inform sourc proc int conf data engin page www workshop queri languag decemb jonathan joe david xml queri languag ry materi parallel map object model relat system phd structur inform system sgml document proc int conf larg data base thoma inform organ data proc int conf larg data base page dan suciu semistructur data xml inria perform evalu altern map scheme store xml data relat selli data wareh proc int conf larg data base page august ullman principl volum ii comput scienc rockvil wilschut model queri semistructur data workshop queri process semistructur data data amalgam sgml document proc conf extend technolog page march rr unit de recherch inria de campu rue du jardin bp es nanci unit de recherch inria campu universitair de renn cedex unit de recherch inria avenu de st martin unit de recherch inria domain de bp le chesnai cedex unit de recherch inria rout de bp cedex domain de bp le chesnai cedex issn
Agents/783 1 aspect interfac assist actor mase atr media integr commun research japan abstract paper introduc interfac agent research project atr media integr commun research lab interest virtual interfac agent support human creativ activ mediat human user comput cyberspac categor interfac agent assist actor base function discuss design framework agent relat applic present current statu object design agent charact locomot design applic virtual museum group discuss environ virtual agent inhabit act introduct interfac interfac defin paper autonom agent mediat human user comput cyberspac interfac agent differ ordinari interfac expect chang behavior action autonom human user behavior situat interact progress expect agent maintain defin person charact displai behavior situat depend context import agent design person interfac agent specul agent accompani user dai perform role human butler secretari home offic person interfac agent solid person foundat charact flexibl plai role sake agent adapt vice relationship intim time design architectur suitabl develop interfac agent applic system architectur unifi control anim agent practic interfac agent remain toi plai friend chat pursu virtual creativ discuss support environ agent system plai activ role refer person differ person segment refer interfac agent perspect depend relationship categori agent assist secretari comput actor unlik person pronoun categor call identifi agent base function categor design interfac agent virtual museum user agent plai kind role visit avatar virtual world extend realiti grasp situat virtual world virtual assist agent answer question visit bibliograph inquiri virtual actor entertain visitor show plai avatar actor show open particip virtual visitor largest differ type agent level control access user user make agent assist actor simpli chang level control expect avatar actor maintain ident person agent user consist interact manner util agent open issu displai chang agent possibl figur agent approach difficulti cognit process track ident person possibl user awar chang statu context interact similar peopl abil chang mode interact peopl depend activ manag agent agent motiv behaviour unit percept knowledg monitor resourc manag world knowledg monitor activ manag knowledg base resourc manag figur agent architectur context architectur design structur base hierarch model fischer user interven level hierarchi agent architectur fel hierarchi basic action unit dof strictli action unit layer control agent figur geometr architectur fit desir design agent uniform framework visual embodi agent import issu provid visual feedback agent action interact locomot design interfac anim tool visual control system anim agent design base philosophi architectur respond interact control user behavior action layer discuss interfac agent research project agent philosophi candid agent built architectur section expand architectur work section present locomot anim mechan visual agent platform section anim joint limb limb figur world action behavior path action unit dof script talk user figur hierarch anim control interfac applic virtual person agent guid visit creativ discuss support environ discuss support agent attend onlin meet virtual particip architectur fundament compon asynchron hierarch agent architectur shown figur multilevel hierarch structur system action unit layer perceptu interpret input signal adjac layer approach resembl approach found interrap system uller structur call knowledg monitor knowledg base structur control layer access inform provid access knowledg appli level control abstract knowledg specif layer layer agent architectur user control agent level abstract level abstract correspond agent uniform design assist actor agent interact share knowledg monitor manag common activ common knowledg base knowledg monitor world act blackboard system design agent avatar requir frequent control action layer user explicit object intellig act adapt action unit dynam action natur assist agent expect explicit input goal plan user watch behavior user action exampl situat user environ basic behavior layer beneath actor agent follow script time figur anim design tool locomot human user agent respond properli freedom proce script architectur test implement agent card player simpl card game call agent fel board game feasibl architectur start implement real applic anim control visual agent realist believ motion import give agent intellig tediou requir great skill produc realist believ motion tradit action agent practic design agent action labor human anim motion captur anim process strongli desir incorpor knowledg real human move control motion anim autonom effici anim control interfac layer hierarch similar architectur figur develop anim system human locomot level access control behavior layer action layer figur interfac displai system locomot walk step behavior layer attribut paramet torso bend rotat action layer paramet anim system develop independ system incorpor architectur make visual agent autonom movabl cyberspac applic figur scene inform access virtual ancient villag tv camera set top screen time control document www server avatar figur screen shot avatar charact posit refer virtual ancient villag applic introduc applic system autonom agent inhabit interact human user concept mase interdisciplinari museum incorpor augment artifici intellig interfac agent technolog facilit commun visitor peopl exhibit object provid entertain educ experi visitor offer rich effect interact museum archiv peopl mediat interfac agent figur show prototyp subsystem visual tool archaeolog virtual system input devic el ancient villag visitor experi archaeolog hypothesi visual interfac agent support visitor person agent exhibit agent person agent agent major portion interact visitor proce exhibit assist agent guid walk museum provid inform interest visitor actor agent show artifact visual travel back origin era locat comput actor agent plai role comput human actor base script order make comput actor time interact import time difficult control plai human actor agent sensori devic long human action activ manag priori long actor plai part creat prototyp system develop script method interv script suitabl comput actor avatar agent import system provid visitor posit virtual villag window view document browser www www browser hook object view provid prepar inform request user select gestur point vista screen shown figur addit menu present archaeolog research exhibit design charact figur avatar agent pictur special set virtual camera posit front avatar give idea interfac agent inhabit virtual world posit virtual camera set point avatar ey posit sky view present shown figur exhibit plan introduc hmd mount devic person present fit displai person interfac agent creativ support develop system call aid inform discuss facilit creativ peopl engag collabor work aid onlin type chat system design space share user figur system synchron aid figur agent group discuss support environ discuss person desktop design assist agent join human addit inform agent provis trigger manual user request automat assist determin watch space agent act inform retriev system search moder relev relev inform choic depend situat agent implement softwar agent visual displai necessarili current version specul chang complex task amount data contemporari dictionari text data base charact discuss viewer show discuss space visual structur space inform space share particip automat visual relationship utter keyword common keyword clue measur close relationship person desktop viewer user person crystal share inform duplic modifi discuss space summari futur direct paper project interfac agent research present implement anim agent architectur applic outlin gradual result belief vertic layer architectur agent aspect agent provid conveni clear mechan user design interact agent displai control chang agent develop expect structur creativ thought activ chang perspect agent mediat commun system agent paper introduc fundament interfac agent architectur agent locomot algorithm plan appli result applic system aid system acknowledg author support encourag research armin sidnei substanti research contribut work mention special peter sidnei fel comment improv articl comput vision system gestur recognit provid perceptu comput media mit refer armin mase anim human locomot lifelik comput page octob armin sidnei mase hierarch agent interfac anim workshop anim interfac aug sidnei armin agent implement simpl card game agent intellig inform media page ieic dec pischel pragmat bdi architectur jp intellig agent page support realiti environ knowledg share conf virtual system page sept muller thiel model reactiv behaviour vertic layer agent architectur woolridg intellig page mase creativ aspect daili topic develop agent post confer workshop coordin technolog collabor lectur note seri feb aaron bobick comput stage action understand aug aaron bobick interv design interact system confer page mar sumi mase person share inform creativ
IR/784 5 content search retriev ad hoc francisco nguyen depart comput rutger nj abstract problem content search retriev commun comput potenti power model inform share ad hoc group user low cost entri natur model resourc scale commun size commun grow locat inform distribut larg number peer problemat present distribut content search retriev algorithm address problem algorithm base document rank instanti rank rule naiv applic requir peer commun collect invert index entir commun costli term bandwidth storag show approxim compact summari invert index make adapt work summari individu provid heurist adapt determin set peer contact show algorithm track perform give commun search retriev algorithm good assum central server introduct problem content search retriev commun comput potenti power model inform share ad hoc group user low cost entri explicit model resourc scale commun user interact form commun individu join bring resourc commun grow natur measur commun rutger show user share data open commun achiev greater size number open problem potenti comput realiz content search retriev open problem exist commun emploi central directori server flood algorithm object locat work support part nsf grant viabl framework content search retriev central server present singl point failur limit scalabl flood techniqu theori arbitrari content search typic limit number perform techniqu reli heavi replic popular item success search recent work studi scale commun put effici reliabl distribut method object locat remain object locat effort intend support file natur model acquir amount storag rapidli inform manag difficult tradit file system hierarch space success internet search engin strong evid content search retriev intuit paradigm user leverag manag access larg volum inform anecdot number individu research group googl hierarch namespac individu depend googl reloc page daili group grow size explod capac cost small group share larg amount data motiv explor content search retriev engin similar inform access paradigm internet search engin present distribut rank algorithm content search retriev specif context infrastructur build task develop applic framework ad hoc set user easili set inform share commun requir support central server basic idea commun member creat invert index document summar index compact summari commun member queri retriev match inform collect inform store commun provid overview discuss advantag underli approach section problem focu perform content search retriev index summari adopt vector space rank algorithm suggest salton al success rank algorithm queri set term document frequenc queri term document frequenc activ work extend gener framework build inform share term collect comput relev document queri naiv applic requir peer commun access invert index entir commun order comput similar queri document provid costli term bandwidth storag show approxim compact summari invert index present adapt specif context gener applic framework maintain approxim inform global index make show rule adapt rank peer order likelihood relev rank retriev document absenc complet global provid heurist adapt determin set peer contact benchmark collect smart trec show algorithm match accuraci compact summari individu invert index algorithm preserv main flavor return close set document queri trade bandwidth good search perform match search perform defin perform metric section contact peer entir invert index peer averag run assum user sort larg number retriev document find number peer contact direct heurist tune address content search retriev algorithm commun share file music inform share commun easili imagin commun share text document repositori scientif legal data text data movi review effect content search retriev good content search retriev algorithm import infrastructur compon build commun overview infrastructur build support search retriev inform spread dynam commun possibl run set heterogen devic section briefli discuss relev featur detail provid context rest paper basic data block xml snippet snippet extract term index possibl link extern file share xml user publish document index document store copi local data store share user publish xml snippet pointer file possibl addit descript file index xml snippet extern file type store xml snippet local data store extern file bloom filter summar index peer bloom filter arrai bit repres set word invert index filter comput indic member typic hash set bit index bloom member indic check bit ¢ peer comput bloom commun gossip algorithm combin algorithm demer algorithm algorithm maintain directori peer peer queri commun content queri bloom filter collect document word car test car bloom filter result bloom filter document word note peer document bloom filter give posit set peer peer document word bloom filter give neg approach bloom filter number collect bloom filter peer effici approxim invert index entir commun implement rank algorithm depend global costli current system bloom filter effici summari minim requir bandwidth storag node appendix show make structur provid xml tag plan extend make structur futur approxim total data index summar content peer independ accuraci storag combin filter peer save contact set peer queri hit combin filter abil independ trade accuraci storag peer run devic gossip inform maintain peer extrem resist attack main disadvantag approach rapidli chang inform spread necessarili spread time minim spike commun bandwidth address peer implement inform brokerag servic consist hash publish locat inform discuss featur impact work present paper shown easili scale commun size thousand gossip rate propag bloom filter term commun peer spread inform requir averag peer commun connect low bandwidth reduc gossip reduc gossip rate requir minut bloom requir averag bandwidth distribut content search retriev main problem address paper search retriev document relev queri pose member commun collect text problem retriev subset relev queri studi extens success techniqu address problem vector space rank model decid adapt techniqu briefli provid background vector space base document present heurist adapt techniqu environ vector space rank vector space rank document queri abstractli repres dimens distinct term space dimens distinct term compon vector repres import word refer weight inform dynam reduc gossip rate time document queri rank relev document queri measur similar vector candid vector similar vector gener measur cosin angl comput weight weight observ mean term mean term denomin equat drop simplic popular method assign term weight call rule basic idea combin term frequenc document term show document collect fact term frequent document import describ term document collect differenti document queri collect paper publish oper system find term oper system document differenti relev document exist literatur includ wai implement rule adopt system equat suggest witten al number time simpli drop normal denomin equat long document erron rank higher short document higher term weight higher term customari substitut simpler normal number term document result similar measur number document number time collect current search engin implement rank algorithm construct invert index collect index associ list document weight term posit term inform document statist ad index speed queri process engin invert index quickli determin subset document term comput vector equat engin rank document similar queri present result user search retriev recal member commun distribut summari invert index bloom invert index rule directli challeng adapt algorithm inform peer adapt algorithm work break relev rank problem rank peer likelihood peer document relev decid number peer contact rank document return peer node rank problem appli idea rank peer introduc call peer frequenc comput number peer commun number peer document similar idea metric term present index peer differenti peer queri note conveni comput bloom filter collect number bloom number hit bloom filter definit relev measur rank simpli weight sum term queri peer weight term differenti set term repres bloom filter result relev scheme peer term queri highest rank peer subset term rank power term differenti peer potenti relev document select problem commun grow feasibl desir contact larg subset peer queri establish relev order peer decid contact address assum user specifi upper limit number document return queri simpl solut select problem contact peer order relev document section obviou approach lead terribl perform measur percentag relev document return reason poor perform peer return document return document highli relev queri stop immedi larg subset retriev document relev queri address introduc heurist adapt determin stop point relev order contact top bottom maintain relev order document return equat stop contact peer document return sequenc peer fail contribut rank document idea initi set document contact node chanc provid document contribut high note latenc algorithm reduc contact peer parallel wast bandwidth result number document collect section function size commun evalu search heurist turn assess perform adapt stop heurist implement measur perform accept recal defin relev doc present user total relev doc collect relev doc present user total doc present user queri post fraction relev document search retriev algorithm identifi present describ irrelev materi user find relev materi ideal perform recal assess perform compar achiev recal origin algorithm match confid search retriev trace queri document number word collect size cacm med tabl characterist collect evalu search retriev capabl accuraci gossip bloom filter entir invert index addit recal examin averag number peer contact queri contact peer minim resourc usag queri studi number peer contact function number document user view size commun environ collect document queri human relev measur tabl present main characterist collect collect bucklei evalu smart collect small fragment text summari small size extract trec collect includ full articl press publish measur recal built simul distribut document set virtual peer run evalu search retriev algorithm compar assum optimist implement peer commun full invert index word count run rank equat comput rank document contact exact peer requir retriev document simul trace stop word remov stem elimin frequent word conflat word root studi perform distribut document peer motiv studi uniform distribut document set peer present worst case distribut search retriev algorithm document relev queri textual content compar link analysi googl web search engin spread larg number peer distribut search algorithm find peer contact motiv studi distribut measur current commun al found user commun share file rest studi commun repres futur commun base student access network creat commun share data studi observ data distribut similar found user provid major file commun collect fit distribut paramet drive partit collect simul commun search retriev evalu search retriev assum post user maximum number document accept answer queri figur plot averag recal provid queri function med collect show result med collect smart collect save space result med collect repres refer reader web result collect make observ adapt stop track perform close perform slightli catch med ident recal slightli outperform perform differ interest outperform correct find lower rank document determin relev highli rank document return relev adapt stop heurist critic perform simpli stop retriev document recal shown curv recal improv high recal med figur plot perform singl commun peer med peer figur plot recal commun size studi scalabl show result collect small accommod wide rang commun size show perform variant recal recal idf idf idf idf fig averag recal med collect distribut peer averag recal collect distribut peer idf adapt stop heurist distribut document adapt stop heurist uniform distribut document stop immedi document retriev stop function number function make observ recal remain constant commun size order peer fact adapt stop heurist function commun size critic adapt stop heurist account recal degrad commun size grow relev document spread peer commun size stop heurist widen search contact peer number peer contact understand effect adapt stop present figur number node contact variant recal fig recal number peer contact function commun size number peer contact med collect distribut peer collect distribut peer variabl adapt stop heurist constant stop heurist function commun size idf adapt stop heurist adapt stop heurist stop immedi document retriev minimum number node contact document plot distribut document uniform distribut lower bound number node contact comput lower sort node number relev document store global knowledg human plot lowest number node relev document note lower bound number peer contact base provid human relev measur rank make observ adapt stop heurist critic recal node contact match contact peer inform assum contact peer highli rank document stop potenti relev document growth number peer contact contact peer lower bound relev judgment explain recal algorithm shown earlier med start contact significantli peer recal improv rel outperform slightli med essenti equal impli equat strongli depend relationship linear work refin stop heurist reduc number peer contact degrad perform work harder uniform distribut relev document spread commun actual observ distribut shape paramet work favor distribut search retriev engin note result uniform distribut directli compar studi studi uniform distribut distribut chang recal number peer contact adapt stop heurist work distribut relev document widen search document spread contract search document concentr studi effect make adapt stop heurist function commun figur plot number node contact commun size collect adapt stop heurist adapt commun size adapt commun size import maintain constant recal commun size figur show adapt commun stop heurist throttl number peer contact quickli commun number node contact drop result lower recal shown retriev similar document conclud studi search retriev algorithm modifi rule find set relev document compar set result med recal level found intersect studi intersect low recal valu high intersect approach intersect close find essenti set relev document confid adapt chang essenti idea rank relat work current applic napster support document search retriev system tremend search limit system reli heavi replic popular item success commun built limit share music video file goal power user locat inform commun tightli collect scientif legal inventori differ led design implement content search retriev present paper contrast exist recent research effort seek provid global hash tabl share member commun framework tapestri chord techniqu spread pair commun rout queri member data store distribut hash structur creat invert effici approach time cost contact node order publish singl kei share content publish uniqu word time linear document size publish kei bloom filter contact node inform gossip bandwidth framework infrastructur implement rank rank algorithm adapt relat cori gloss address problem select rank fusion distribut collect recent studi french al show scale node main differ system assum presenc server hierarchi user decid peer contact empow peer work autonom distribut bloom filter wide answer queri presenc network node failur secondari differ bloom motiv goal support peer scarc resourc peer independ trade accuraci space search mechan client rout queri data sourc similar select implement model peer provid content give sketch queri answer hub client find node suitabl question unlik peer rank result search contact relev node queri comput potenti power model inform share ad hoc commun user commun grow locat inform distribut larg number peer problemat present rank algorithm content search retriev thesi search small set relev term locat natur locat document search retriev algorithm successfulli locat inform user search present unrel inform explor content search retriev approxim document rank instanti rank naiv implement requir peer commun access invert index entir commun show approxim compact summari bloom invert index make show rule adapt summari individu provid heurist adapt determin set peer contact shown algorithm track perform document distribut commun algorithm preserv main flavor return set document queri result provid evid distribut content search retriev commun perform search retriev algorithm base central server refer bloom hash code error commun brin page anatomi hypertextu web search engin comput network isdn bucklei implement smart inform retriev system technic report cornel croft search distribut collect infer network annual intern acm sigir confer research develop inform page hong distribut anonym inform storag retriev system workshop design issu anonym page nguyen infrastructur support inform share technic report depart comput rutger nov terri epidem algorithm replic mainten sixth annual acm symposium principl distribut page mou compar perform select algorithm research develop inform page jr semant file system acm symposium oper system effect gloss text discoveri problem acm sigmod page resourc discoveri distribut network symposium principl distribut page harman overview trec confer annual intern acm sigir confer research develop inform consist hash random distribut cach protocol reliev hot spot world wide web acm symposium theori page zhao architectur persist storag acm napster editor har power disrupt technolog shenker scalabl content address network acm sigcomm robertson jone relev weight search term journal american societi inform volum page druschel distribut object locat rout system intern confer distribut system platform yang vector space model inform retriev journal american societi inform volum page gribbl measur studi file share system multimedia comput network balakrishnan scalabl lookup servic internet applic acm sigcomm distribut search distribut network sun bell manag compress index document imag morgan san yang effici search network intern confer distribut comput system juli joseph infrastructur locat rout technic report appendix memori usag present estim amount memori member track content note memori usag depend bloom filter size number peer commun calcul chosen bloom filter store set term posit spread collect commun peer receiv averag term scenario filter store singl mean commun summar memori node exchang filter compress bandwidth requir singl node gather remain filter tabl show result obtain commun size calcul present peer memori collect size tabl amount memori node store bloom filter summar commun
AI/785 2 improv data driven tag system combin han van dept languag speech nijmegen po box hd nijmegen netherland walter daeleman dept comput linguist tilburg po box le tilburg netherland abstract paper examin differ model data driven system perform nlp task exploit yield higher accuraci individu system mean experi involv task tag tagger gener markov transform rule maximum train corpu data output combin vote strategi stage classifi combin tagger outperform combin show lower error rate individu tagger introduct natur languag process find languag model classifi interpret languag relat observ model categor recent work brill demonstr categor fact distinct categor hand languag model markov neural case hand manner model construct craft data data driven method popular explain fact hand craft explicit model natur data driven method model automat learn implicit structur annot train corpu easier quickli lead model produc result good qualiti good qualiti ultim goal qualiti reach task potenti learn method limit factor power softwar implement learn method avail train materi find task point face ceil qualiti reach machin learn system fact system ceil machin learn similarli limit potenti type learn method bring bia task method tend produc error concern question differ model exploit yield data driven model superior perform machin learn literatur approach combin classifi shown error uncorrel suffici result combin classifi perform individu system pazzani chan stolfo tumer underli assumpt twofold combin vote make system robust learner bia inform individu method behaviour principl admit possibl fix collect error execut investig mean experi nlp task experi tag reason choic tag wide research task van current perform level task leav room art perform data driven automat tagger english text singl tag low detail correctli tag word number method gener fulli function tag system annot text compon tagger van combin number tagger straightforward major vote van compon tagger statist model context probabl knowledg fundament result limit vari system varieti hope lead combin effect experi select primarili basi avail featur text complet languag model oldest system tradit trigram model henceforth tagger base context statist jt lexic statist jw directli estim rel corpu frequenc viterbi algorithm determin probabl tag sequenc model facil handl unknown system distribut potenti tag word lexicon system transform base learn system brill henceforth tagger brill system collect program perl script rule base tagger system start basic corpu annot word tag search space transform rule order reduc discrep current annot correct case rule tag rule appli sequenc text access contextu inform word tag window span posit focu lexic inform exist word form addit actual inform sever limit individu inform item combin pattern laid rule templat system learn daeleman al henceforth tagger train case inform context correct tag store memori case similar focu word retriev index basi inform gain accompani tag select system access inform focu word posit word unknown singl posit suffix inform capit presenc hyphen digit fourth final system system ratnaparkhi henceforth tagger number word context featur similar system train maximum entropi model assign weight paramet combin featur relev estim probabl beam search find highest probabl tag sequenc system brill system default set suggest document ratnaparkhi java implement system data data experi consist tag corpu corpu million divid sampl word text type manual check gener accept accur slight adapt charact tag replac marker split neg marker sentenc tag result ati singular plural articl singular noun major singular noun extend past verb singular articl invit nn singular common noun preposit ati singular plural articl jj adject candid nn plural common noun period consist tag tag averag ambigu tag difficulti tag task judg baselin measur tabl repres complet random choic potenti tag token select lexic tag divid corpu part call consist data construct tag compon coordin tag relat tag utter ten part train individu tagger consist data ninth select tagger paramet applic develop combin method final consist remain final perform measur tagger tune test token token tag data train individu tune combin inform tagger compon tagger context data driven manual adjust data test inspect detail benchmark tag qualiti measur potenti improv order combin compon tagger lead improv tag examin result individu tagger appli tune rigor measur rel qualiti tagger singl dataset ident circumst qualiti individu tagger tabl leav room tagger accuraci result report make confid gain accomplish combin room improv explain combin lead compon tagger differ error make case tabl show tagger select correct tag identifi impli imposs note error count tagger fact error benchmark tag accept measur qualiti relat specif tag linguist truth hope tag corpu live reput tagger correct major correct correct major minor correct tagger wrong tabl tagger agreement tune pattern bracket give distribut tag system tag case aim optim select case correct tag ideal lead correct tag word simpl vote wai result compon tagger select singl tag set tagger section examin number accuraci measur list tabl straightforward select method vote tagger vote tag choic tag highest number vote select question larg vote tagger democrat option give tagger vote give weight tagger prove qualiti gener tagger vote qualiti relat current tagger vote suggest tag inform tagger qualiti deriv inspect result tune tag measur percentag token tag tagger tag benchmark recal measur percentag token tag benchmark tag tagger abstract individu recal equal measur token tag case gener term accuraci random select win tag made tie tune test baselin random singl tagger simpl vote major vote tag tree tag tabl accuraci individu tagger combin method inform tagger perform fail recogn correct tag inform forc tagger add vote tag suggest amount equal minu recal tag turn vote system outperform singl vote system specif inform specif inform score higher explain fact recal inform miss perform recal equal worst significantli mcnemar vote inform perform individu tagger step examin pair investig situat tagger suggest estim probabl situat tag suggest dt suggest cs happen token probabl tag cs subordin conjunct dt determin ql quantifi combin tagger pair turn vote probabl suggest compon tagger tag pair observ fall back inform individu probabl tag tagger suggest tag note method tag suggest minor tagger chanc win remov restrict gain case chanc beat major slight hope high happen vote strategi outperform vote approach level ty major vote handl correctli stack classifi measur detail inform lead accuraci improv advantag step underli mechan vote model situat observ tune close practic feed output number classifi featur learner significantli call stack stage provid level addit origin input pattern choic level learner basic version case consist tag suggest compon tagger correct tag advanc version add inform word question tag suggest tagger previou posit similar metric tag straightforward overlap inform gain weight al base method reach qualiti explan found examin differ gener featur inform higher accuraci lower accuraci test overtrain tune small collect case base leverag stack effect stage materi show disagr featur tag examin overtrain effect specif level commerci version program induct train materi prune overfit train materi result test conjectur prune benefici interest case rare benefit data stage classifi suit type problem tag score significantli significantli handl due huge number featur valu test compon averag reduct error rate compon mr rt mt er mer met tabl correct score test vote tagger combin combin relat accuraci combin individu tagger shown tabl import observ combin outperform combin strict subset compon note improv yield combin vote individu score correct reduct error rate individu maximum entropi tagger major factor qualiti combin result qualiti combin score higher beat factor differ languag gener combin lowest accuraci oper critic margin edg significantli differ group nation scheme fact success combin reserv portion experi total annot data set paramet combin fact good spend extra train individu system set concaten train access piec data combin turn individu tagger limit compar combin extens train score correct test error error experi show task combin system perform ceil data driven system room closer examin differ combin question combin perform provid train data remain effect inconsist data ratnaparkhi effect penn treebank closer feel result encourag extend investig start addit compon tagger select shift languag investig limit expect nlp task combin lead worthwhil improv acknowledg creator tagger gener make system refer ali km pazzani mj error reduct learn multipl descript machin vol pp brill simpl part speech tagger proc pp brill advanc tag proc chan pk stolfo sj compar evalu vote partit data proc intern confer machin pp daeleman zavrel gilli se part speech proc fourth workshop larg pp daeleman van den bosch tree compress classif lazi learn algorithm artifici intellig special issu lazi pp van comparison tag democrat tag human comput select paper april hockei id clarendon pp van syntact tag kluwer academ johansson tag user manual norwegian comput centr norwai quinlan jr program machin learn san ca morgan ratnaparkhi maximum entropi part speech tagger proc confer empir method natur languag process implement probabilist tagger research netherland tumer ghosh error correl error reduct ensembl classifi connect special issu combin artifici neural ensembl vol pp wolpert dh stack gener neural vol pp
ML/786 6 saccad search gabor featur appli ey detect head track swiss feder institut technolog microprocessor interfac laboratori lausann abstract gabor decomposit ubiquit tool comput vision gener consid demand activ vision applic suggest approach featur detect inspir human saccad system dramat speedup achiev comput gabor decomposit point grid ey detect applic head track system present system featur camera design simul dynam perform human ey activ vision system base gabor decomposit kei gabor activ saccad ey head face recognit introduct gabor decomposit long power tool pattern recognit task comput vision problem motiv strong biolog gabor constitut good model simpl cell visual cortex calcul gabor filter heavi comput load made featur activ vision applic approach circumv problem human ey explor visual scene perform sequenc larg point fixat maintain short saccad shown preprint submit elsevi preprint septemb plai central role explor underli cognit process select mechan filter task relev inform approach head facial featur detect consist perform search base model saccad ey movement algorithm built grid gabor decomposit comput point perform part paper report simul experi saccad search detect ey subject real imag describ setup grid attach design mimic dynam perform human ey obtain perform head track sampl grid central attent strategi sampl grid rigidli displac imag grid mean densiti sampl point exponenti distanc centr limit comput gabor decomposit point retin requir grid displac order imag region consid sampl topolog automat implement concentr comput effort current fixat point global number fixat perform featur extract direct filter imag fourier transform bring dramat effici analog oper visual cortex primat human found finest part search tune frequenc decomposit match variabl sampl rate retina associ high frequenc gabor filter fovea low frequenc extract sampl rate coarser ey detect smooth integr inform centr ey global inform outlin orbit frequenc domain sampl map appli design gabor filter frequenc domain standard complex valu gabor function frequenc domain translat shift version oe exp exp paramet oe oe rotat paramet chosen cover frequenc plane complet small number logarithm space frequenc channel problem obtain uniform coverag frequenc plane space centr filter symmetr gaussian shape doesnt extend distanc central region frequenc space sampl peripheri substitut commonli gabor function modifi filter ae oe oe ae exp ae ae exp oe oe tan conform map frequenc plane log polar coordin filter textur analysi show high discrimin power construct uniform grid gaussian filter frequenc turn yield desir consist exponenti coverag fourier plane ey human subject explor natur ey scan fashion perform rapid jump region fixat relev inform acquir time fig gabor filter creat uniform sampl frequenc plane coordin cross repres posit slightli origin spent decid saccad aim pioneer studi saccad found stop place subject gaze explor human face distribut ey region motiv saccad search ey relev region face recognit procedur consist main step local inform driven saccad ey movement home grid search refin displac detect success saccad perform assum posit ey criteria appli check consist inform mismatch doubt assign discard saccad search descript search target construct averag gabor centr ey person train set result featur vector av consist frequenc channel emploi begin retin sampl grid random posit imag gabor featur vector extract point vector subsequ match refer av point grid euclidean distanc av minim fig retin sampl grid person ey model creation select target saccad saccad search assum converg saccad shorter threshold saccad target distanc av low found case search start point fall blank region search restart random posit refin search complet descript place retin sampl grid centr ey imag train set store gabor retin point order reduc sensit posit error small train relax procedur ey coordin emploi train version perform search train set ey coordin detect retrain system result ey model distinguish left ey ey improv comparison left ey model featur retina perform state spot facial featur left ey ey gradient descent success perform displac retina match ey model found residu distanc model classifi detect featur saccad search subsequ restart expect direct ey case ey random posit experi shown saccad search detect erron local minima corner detail order discrimin fake differ comput candid distanc attribut ey model distanc altern model ratio differ minimum call measur amount detect featur contribut match asymmetri turn correct gener drop order magnitud case spuriou identif error detect treat restart search random posit result algorithm test retin sampl grid ring rai relat dimens retina size facial imag evidenc figur imag emploi consist forti frontal shot twenti person imag resolut emploi pixel differ shot person consist tan eyelid head posit slightli slight scale person wear singl shot person extract left ey model repeat test perform mismatch found inform obtain outlin orbit correct detect featur subject ey close trial found median number fixat point detect imag part collect framework european person authent project fig sign denot match left ey model number identifi success start point saccad ey detect requir great major part search refin saccad displai note saccad search consid uninterest discard random restart lead detect left saccad search resum locat ey fig inform outlin orbit ey detect person ey shut trial fixat made ey candid locat saccad search reject comparison ey model centr retin sampl grid explor imag pixel number fixat subject wear glass strong reflect ey shut due fact algorithm facial featur altern cue infer spatial posit visibl low detect correctli accomplish end real time head track order demonstr flexibl effici saccad search algorithm implement head track system grid camera develop laboratori camera spheric mount specif design mimic dynam perform human ey saccad search algorithm section readili adapt head detect task substitut ey model global descript head detail point section order dynam inform imag sequenc achiev complement algorithm motion detect stage section detail descript hardwar found section result discuss section model head descript head obtain train set imag person sit front camera imag acquir resolut pixel standard gabor filter middl point ey comput averag vector constitut head model filter emploi logarithm space frequenc channel wavelength rang orient channel due optic averag distanc ey typic imag compar wavelength filter filter encod signatur head subpart expect map euclidean distanc head model gabor vector extract point imag head present singl pronounc minimum correspond head motion detect step track consecut frame acquir absolut differ comput differ threshold identifi pixel differ significantli fig output motion detect stage set rectangl surround move object scene ag field view partit rectangular grid grid cell label region motion percentag differ pixel part imag mark region motion consid process step make camera stop move frame consid process imag current frame discard immedi acquir hardwar setup algorithm implement swiss feder institut technolog vision sphere system acquir high resolut imag standard ccd camera tilt pan comput control innov principl close comput orthogon replac encod standard move sphere posit camera orthogon increment optic encod absolut desir camera posit transmit serial line motorola card card gener modul signal drive motor control elabor method low inertia vision sphere afford fast reach point interest view space control made easi fact rotat ax optic axi camera intersect singl point visual comput carri pentium pc equip fig front view swiss feder institut technolog vision sphere narrow black cylind dc larger optic encod video signal composit pixel field view ffi ffi ffi speed ffi ffi dimens mm power tabl characterist swiss institut technolog vision sphere meteor frame grabber averag cycl includ time requir camera half gener small case motion detect stage activ fewer retin point camera settl time shorter fig cover imag size grab time system believ head centr field view result perform system test track head person sit front camera subject move freeli system program acquir full resolut frame time believ head person centr imag crop imag centr store visual inspect repres imag area size comput averag head size ad side system accuraci pixel radiu circl pixel toler imag acquir turn repres head expect error typolog found subject move camera rang oper subject move frame blur typolog erron head presenc sharp geometr pattern contrast line move imag type failur partial correct motion detect due simplic head model emploi singl fig top imag show error due blur frame bottom repres error induc sharp geometr pattern object present attent driven search strategi mimick behaviour human saccad system main featur algorithm sampl gabor decomposit discuss ey detect static imag head detect track algorithm appli minor modif main advantag approach gener dramat reduct inform process order perform task crucial power mathemat tool gabor decomposit activ vision applic setup novelti head track privileg applic work remain track small object ey smooth pursuit larg object slow motion acknowledg work partli support project european programm mr mr program hardwar refer orient tune gabor filter bank design intern confer pattern page ieee comput du buf symmetri complex moment gabor space face authent grid gabor inform ieee proc volum page dh brain vision scientif american spatial frequenc row striat visual cortex vision chellappa approach imag featur detect applic pattern neuron oper visual cortex studi brain function visual natur task phd carlson center imag rochest institut ballard ey movement visual comput studi technic report nation resourc laboratori studi brain depart comput king saccad target select frontal ey field visual activ journal saccad search gabor featur appli ey detect technic report swiss feder institut comput scienc januari build visual correspond map neuron dynam face recognit system intern confer brain theori model mit novemb ey movement
ML/787 6 seventeenth nation confer artifici mutual benefici integr data mine inform extract yong raymond moonei depart comput tx abstract text mine concern appli data mine techniqu unstructur text inform extract form shallow text understand locat specif piec data natur languag transform unstructur text structur paper describ system call combin data mine methodolog perform text mine improv perform underli extract system rule mine extract corpu text predict addit inform extract futur improv recal encourag result present appli techniqu corpu comput job announc post internet newsgroup introduct data aka knowledg discoveri inform extract topic recent interest kdd consid applic statist method discov relationship larg relat concern locat specif piec data extract structur inform unstructur text research explor interact import area paper explor mutual benefit integr kdd provid kdd assum inform form relat electron inform form unstructur document structur problem text discov knowledg unstructur begin attract attent dagan hearst inform extract plai obviou role text mine method transform corpu textual document structur standard kdd method appli result discov relationship copyright american associ artifici intellig reserv previou develop induc rule extract inform text moonei califf system construct extract job messag post newsgroup appli standard rule induct result discov interest relationship job requir knowledg java graphic requir knowledg illustr role plai extend kdd textual obviou interact benefit kdd turn provid predict relationship slot filler discov kdd provid addit clue inform extract document extract job system extract addit slot filler typic recal correct slot filler system significantli lower extract slot filler predict relationship product improv recal suggest addit inform extract paper report experi domain demonstr predict rule acquir appli kdd extract improv recal inform extract remaind paper organ section present background inform rapier section describ system call text improv rapier perform exploit predict rule section present discuss result obtain corpu job post newsgroup section review relat section discuss direct futur section present seventeenth nation confer artifici sampl job post job senior dbm consult dbm applic consult work project team defin dbm base solut support electron sale forc custom servic applic desir year exp develop oracl sql server app visual similar recent experi relat instal configur oracl sql server dev environ desir understand unix script languag principl structur softwar engin project manag ampl opportun career growth bs higher comput scienc relat field requir fill job templat senior dbm consult tx dalla visual basic nt sql oracl electron custom servic requir year desir year requir bs figur sampl text fill templat background inform extract goal system locat specif data text data extract typic templat specifi list slot fill substr document varieti recent internet web document recent applic includ rental ad job announc homepag task extract post usenet figur show sampl messag newsgroup fill job templat slot multipl filler slot area slot relat job titl locat rapier system rapier relat rule learner acquir inform extract rule corpu label train exampl learn pattern describ constraint slot filler surround context search constraint pattern specif semant class token hypernym link wordnet provid semant class document annot inform tagger brill simpler version rapier emploi word constraint wordnet class provid addit advantag domain moonei learn algorithm rapier inspir induct logic program system rapier creat pattern slot complet word tag inform filler full context rule creat gener pair exist rule beam search rule produc incorrect rapier add rule base remov exist rule subsum rule order heurist weight rule size train corpu document annot fill rapier acquir knowledg base extract rule test document califf califf moonei provid inform result demonstr rapier perform realist applic usenet job post seminar announc system text mine construct system extract desir set slot construct corpu text appli extractor document creat collect structur record standard kdd techniqu appli result discov interest relationship induc rule predict inform field inform field standard classif method emploi task order discov predict treat pair extract distinct binari learn rule predict featur featur similar slot filler standard term popular filler platform win titl slot abbrevi term uniqu slot valu predict rule mine data small synonym dictionari similar term trivial case handl manual contriv rule induc rule result binari data learn seventeenth nation confer artifici qa titl engin lotu note activ server figur sampl mine predict rule job determin threshold rule valid creat label exampl appli document label set slot filler convert binari featur build predict rule rb appli binari predict rule rb verifi train data valid data accuraci lower delet rb figur algorithm rule mine phase tree translat prune rule appli ripper learn abil handl featur avoid step explicitli translat slot filler binari featur system produc similar result experi paper emploi discov knowledg describ relationship slot valu written form product rule tendenc web area slot applic repres product rule predict absenc filler focu rule predict presenc filler sampl rule mine job extract usenet newsgroup shown figur pseudocod text mine phase shown figur final step shown figur filter discov rule train data disjoint set label valid data order retain accur induc rule rule make incorrect predict train valid extract templat discard mine rule improv mine knowledg extract discov rule predict miss inform extract filler extract rule rule predict rule base rb fire current extract filler predict filler substr extract predict filler figur algorithm phase subsequ extract test system perform recal defin recal introduc combin recal comput weight measur recal set potenti slot filler larg fix small fraction filler present perform metric gener inform accuraci predict pair extract system provid high recal typic lower previou experi job post domain show rapier low higher recal mid rapier search find rule includ method recal method develop rule learner recal typic leav unchang addit knowledg form predict rule mine larger set data automat extract addit unannot improv recal unduli sacrif discov rule system extract fail extract assum extract error add area potenti improv recal appli extract rule appli mine rule result initi data predict addit potenti extract final extract predict filler base occur document substr filler found extractor consid predict confirm extract filler mine rule predict absenc filler remov extract inform analog confirm step improv seventeenth nation confer artifici unlabel system rapier miner exampl system rule base extractor trainer exampl predict rule base rule exampl figur system architectur train extract algorithm summar figur final issu order predict rule appli interact order produc result document initi fill templat make rule fire predict rule execut predict www extract rule longer fire rule negat condit appli order strategi attempt maxim recal make confirm predict architectur final system shown figur document user annot extract data process initi system rapier learn creat rule miner process construct knowledg base rule predict slot valu predict rule test improv recal exist system addit slot filler presenc document confirm ad final extract templat evalu methodolog test job post newsgroup collect cross valid gener train test set unannot document collect addit option input text miner rule induc predict filler area fill multipl system rapier exampl system exampl rule base predict rule base exampl predictor figur system architectur test filler obviou potenti relationship valu titl slot condit product consequ titl valu difficult predictor filler administr determin valu result figur show learn curv recal unlabel exampl emploi result order illustr impact amount train data extract predict rule set annot data provid rapier rule miner figur show comparison perform rapier filter rule independ fulli filter rule wai filter rule ad predict rule simpli train test induc rule entir train hold part origin train set disjoint valid set result statist evalu pair train set pair system compar determin differ recal statist fulli filter rule perform filter disjoint data higher moder interest aspect retain fix recal advantag rapier size train set due fact amount data provid text miner continu improv qualiti acquir predict rule result demonstr role data mine improv perform tabl show result recal addit unlabel document construct larger prior mine predict rule seventeenth nation confer artifici number train exampl rapier rule figur recal job post number exampl recal rule mine match filler tabl perform result unlabel exampl filter valid label exampl train extractor provid rule number addit exampl vari result show data suppli build predict rule higher recal larg recal ad inform extract unlabel document result larger good predict result due extract error inaccur predict rule discov averag predict rule provid label exampl unlabel exampl unlabel exampl show power label exampl produc good predict label exampl boost recal rate unlabel exampl unlabel exampl recal slowli unlabel exampl provid row tabl show number train exampl rapier rule figur job post perform simpl method recal extract substr filler slot version rememb string slot filler test extract filler languag replac mine rule trivial rule form true slot reason work poorli filler string job post necessarili correct filler slot newsgroup list requir skill job gener descript compani fact demonstr addit rule mine improv extract perform relat research research explor integr kdd feldman allud text discoveri textual system text manual tag limit number fix categori label kdt autom text categor paper discuss mine knowledg improv extract grow interest gener topic text mine work system detail evalu util exist kdd system develop rapidli evalu exist text corpora seventeenth nation confer artifici futur work preliminari result job post newsgroup fuller evalu appli domain busi medic document patient email product order step perform manual similar extract data canon map window uniqu term autom cluster slot filler distanc metric base textual charact edit distanc yianilo slot year provid rule miner addit input featur predict slot predict continu valu regress method categor techniqu area futur research procedur select slot rule mine autom current manual chose slot job templat identifi quantifi correl slot autom regard kdd improv method discov predict rule improv recal simpli elimin extract filler predict sever damag recal combin confid measur predict rule extract rule product improv recal inform extract data mine integr mutual benefit task enabl applic kdd unstructur text corpora kdd discov predict rule improv perform paper present initi result integr kdd demonstr advantag text mine research area intersect machin inform retriev appropri integr techniqu method discov knowledg larg text corpora develop grow interact comput linguist machin learn moonei critic develop effect system acknowledg research support nation scienc foundat grant refer advanc part speech tag twelfth nation confer artifici relat learn rule inform extract sixteenth nation confer artifici relat learn techniqu natur languag inform extract phd depart comput tx artifici intellig laboratori technic report ai machin learn natur languag special issu natur languag machin learn gener inform extract sixteenth nation confer artifici fast effect rule induct twelfth intern confer machin learn classifi english text ilp method de advanc induct logic program io press learn tree rule featur thirteenth nation confer artifici ed darpa messag understand evalu confer san morgan kaufman ed messag understand confer san morgan kaufman knowledg discoveri textual intern confer knowledg discoveri data mine electron lexic mit press inform extract applic gener learn approach fifteenth nation confer artifici text data mine annual meet associ comput program machin learn san morgan kaufmann learn string edit distanc ieee transact pattern analysi machin intellig learn inform extract rule free text machin learn
HCI/788 4 present workshop emot human artifact august emot human ed robert trappl paolo mit press separ evolv emot live aaron sloman school comput scienc birmingham abstract problem studi studi assum share understand everydai concept inher mean peopl peopl understand refer understand unclear discuss inher appar disagr peopl talk thing framework explain phenomena peopl refer talk emot affect state process conjectur paper base adult human type compon evolv includ rich vari collect compon interact gener sort phenomena research label framework provid ration reconstruct everydai concept mind varieti found brain damag softwar architectur support class state mental ontolog concept interpret differ refer architectur limit class architectur class behaviour indefinit architectur produc behaviour import constraint architectur produc biolog evolut lead notion human architectur compon evolv influenc compon pressur mind kind ecolog acquir kind inform process cooper compet framework hope studi mechan underli affect state mechan studi action learn explain concept shallow deeper shallow model practic entertain interfac design deeper model requir understand paper snapshot long term project address issu kind studi emot recent fashion ai cognit scienc sort thing label understand young engin train philosophi psycholog specialist definit relat instanc defin emot term observ physic behaviour jump defin term measur physiolog easili discern intern picard defin term kind consciou experi involv phenomenolog defin term brain mechan activ behaviour manifest occur extent cultur cast doubt behaviour criteria emot instanc sound peopl make exhibit pain vari english replac research regard emot inher social cultur true earthquak disagr sort evid relev studi emot regard behaviour skill actor show emot demonstr connect emot extern observ behaviour object reveal peopl act natur occur emot case extern peopl conceal emot link differenti observ jump grow interest semant rich emot behaviour worri work appreci colleagu worri polit parti lose sunni weather forecast dai plan admir impress research emot studi shallow larg ignor semant import human emot import social subject matter deep semant rich common difficulti peopl word cover affect includ desir ordinari describ emot enjoi meal find chair uncomfort sit affect state includ follow peopl constantli larg number multipl endur sourc concern emot necessarili involv consciou emot defin squar common observ peopl awar obviou problem criterion rule anim emot lack abil monitor state lack conceptu framework requir classifi state emot newborn infant classifi mental state adult categori feel infant behaviour manifest simpli part biolog import process gener behaviour parent express infant awar obviou resolv disagr issu ambigu kei concept concern order organ machin modul emot simpli state involv interact host process argu view make emot mechan biolog function view question make possibl ambigu word refer state process conform usag inconsist conceptu produc label compon modul announc develop robot softwar agent emot hard argu claim agreement emot extrem form phenomenon ai attribut mental state human capabl program basi shallow mcdermott ai commun year concern label modest step back problem defin affect relat question question sort anim artifact talk sort defin inform process varieti mechan store inform includ initi gener pursu kind import kind architectur discuss defin physic mechan softwar engin refer virtual machin simpl relationship underli physic architectur question sort sort state process occur anim artifact find kind system produc sort thing call emot distinguish sort replac question robot softwar agent insect newborn infant question sort emot sort robot softwar agent kind insect kind kind emot newborn infant defin larg number sort relat type architectur state process occur architectur defin class term architectur make kind comput emot type assum type organ potenti fruit philosoph scientif advanc applic therapi refer organ machin inform process architectur amount adopt dennett refer design stanc physic stanc describ physic compon intent stanc ignor intern mechan assum predict regard behav system act ration basi idea explain mental phenomena term inform process architectur support herbert simon highli recommend paper written earli make start project requir architectur capabl support human emot motiv architectur intellig book albu minski russel norvig dennett nilsson earli primit effort book architectur support collect state mental ontolog design defin sort kind kind kind context architectur produc vagu debat anim machin emot replac product factual kind anim machin kind kind defin twenti class emot produc architectur find normal adult human newborn infant sort robot activ assum system wholli partli requir adopt intent attempt build theori conform level defin counteract practic publish paper report robot softbot emot defin permit author claim ignor mcdermott author class emot refer find interest depend shallow entertain educ enhanc user interfac inexperienc user definit emot theori explain work human mind complex compon effect separ deep theori architectur peopl limit view system dennett recent write year gradual shift stress intent stanc adopt design explain system work term function decomposit interact justifi ascrib mental state process organ machin basi work dont awar shift acknowledg book instanc discuss design kind mind definit design stanc closer mccarthi definit function stanc explain behaviour system term function refer work shallow model tutori introduct sim agent feel focu aspect complet unawar leav ten blind men eleph basi part feel small part larg complex truth true theori gener theori mind phenomena explain parallel produc theori explanatori architectur collect exampl type actual broad rang case theori explain phenomena dont good theori base descript avoid prematur commit type explanatori architectur fairli neutral descript applic anim larg object detect rapidli move organ rapidli switch kind assum express includ individu fulli freez jump side inher vagu term small slow move object trigger kind block catch except relat intermedi small rapid slow motion phenomena explain includ commonplac exampl peopl observ read phenomena discov expert field laboratori inform deriv studi effect brain etholog studi anim build theori explain respect constraint biolog learnt comput softwar engin ai solut problem disagr phenomena includ initi constraint research work bottom fine grain empir observ behaviour physiolog brain structur start global behaviour interact global design explain featur involv attempt design mechan replic model detail worri put design complet approach involv attempt design complet work system wide rang capabl approxim origin progress ad detail mechan match finer grain requir mixtur topdown approach work primarili simultan progress deepen progress breadth attempt learn work bottom peopl research brain function mechan pitfal danger approach mechan produc capabl perform specif incap contribut adequ function larger architectur visual featur detector input imag produc output imag requir featur highlight inadequ mechan complet visual system requir output edg detector unlik modifi imag danger approach refer shallow lead design incap refin wai match fine grain detail specif ad model complet agent includ specif assign vari numer valu collect emot descriptor turn total spuriou actual emot phenomena found organ produc specif emot gener emerg featur interact mechan function analog thrash oper system produc emerg featur interact mechan condit heavi danger common approach lead excess focu design architectur mistak variat kind anim human stage develop newborn human infant sort architectur adult fact design correspond small subset natur occur case fulli understand function import design compar contrast altern design full understand architectur explor neighbourhood space explor architectur divid individu normal develop brain damag object analysi sketch schemat outlin architectur compon evolv older portion found organ newer portion anim conjectur oldest layer pure reactiv layer newer portion delib layer capabl creat descript actual reason newest portion layer collect mechan control rest system layer type lack share assumpt made roll layer necessarili requir extern acknowledg function modifi exist languag primat capabl humanlik languag inform process requir type formal encod inform factual inform control inform formal dimens import topic ongo research concept emot basi architectur produc crude classif familiar type emot process class primari emot depend oldest reactiv secondari emot depend part newer delib mechan tertiari emot refer depend interact recent evolv reflect layer class distinguish depend involv distinguish type perceptu mechan vari sophist type action mechan class emot support class percept richer flexibl sort mechan store differ defin class class occur occur stage human develop framework concept sort mental state process defin term kind inform process architectur process occur architectur architectur virtual machin level familiar softwar engin physic defin mental concept term state process virtual physic avoid mistak topic paper type variat architectur wai architectur vari design lowest level differ type physic system biolog mechan case differ system implement directli hardwar implement softwar interpret softwar possibl directli hardwar present implic form implement abound compon rule accur replic simul human mental state process peopl desir answer correct investig answer lowest level implement differ form simpli fix collect state regist valu vari capabl distribut overlaid rule encod weight kind neural form structur vari complex creat hybrid mode discov form start gener type variat type semant content organ encod organ inform environ typic restrict sort refer differ ontolog compon organ close expect capabl sort inform environ partli sort inform similar comment applic compon evolv time perform function human function visual system provid inform postur control includ inform optic flow pattern visual field clue individu begun fall forward backward inform directli encod control signal muscl contract relax correct detect motion postur control subsystem incap receiv kind inform environ similarli complex grasp catch move requir control motion feedback inform detect visual system inform formul plan futur person facial express kind inform process inform optic arrai issu discuss detail section return detail discuss dimens variat ambigu descript architectur research expect intellig principl attempt build theori human inform process architectur doom actual architectur complet unstructur suggest figur suggest produc human constrain modular improv modul impact disastr function economi genet encod design copi approxim modul argument appli evolut simpl function decomposit aid search import context impli point boundari modul sharp complex system learn develop modul boundari chang qualif claim design modular contrast claim intellig structur architectur intermedi posit found suggest central cognit compon human inform process architectur figur architectur oval repres process compon shade rectangl inform store buffer larg number compon complex unstructur fashion human comprehend sensori motor modul connect schemat figur fodor idea encapsul compon larg determin mode function modifi cognit process discuss fodor model theori vision david marr influenti book visual system function larg extract inform visual arrai construct descript object environ term geometr physic marr work essenti fodor expand divid process layer start retin imag pass intermedi edg binocular dispar optic flow textur featur primal surfac featur give orient surfac viewer centr object object ultim feed cognit system inform object hierarch structur descript view visual system architectur contrast model perceptu system partli driven top influenc current idea psychologist gibson constrain produc descript geometr physic properti object sensori system produc descript relat capabl organ gibson call vision inform anim posit afford possibl access neg risk rich output human visual system descript thing spider web bar hold equat varieti visual ambigu pictur illustr figur found textbook suggest visual system includ subsystem detect report inform kind subsystem produc descript produc control signal trigger saccad signal postur control system visual evolv earli evolutionari histori evolv modul sight read produc individu learn evolut ill relat conjectur architectur adult human cognit process figur fodor modular architectur fodor book suggest human collect sensori shown feed inform complex messi central cognit turn send signal collect encapsul motor mechan cube figur kind visual ambigu cube interpret differ pure geometr distanc figur interpret differ subtl object figur ambigu direct perceiv anim abstract properti perceptu relev predat prei afford schemat overview architectur sort architectur develop cognit affect project complex hard understand start simplifi view architectur combin provid overview combin pictur addit modul complet specif thing relat kind mental state process found human view anim share subset possibl design implement detail oper larger system mechan bird prei perceiv optic flow optic flow mechan tiger human central process percept action figur tower model inform flow modifi version tower model arrow repres flow descript control inform model vari kind process perceptu action inform flow unidirect includ intern feedback driven driven control tripl tower model schemat view behav system base notion flow inform organ sensor interven process mechan simplifi version model shown figur assum sensori central process mechan includ changeabl long term action mechan model type vari perceptu action pillar process occur physic input creation central perceptu mechan type sensori motor process occur deal level abstract simpl case perceptu mechan physic transform extern energi form process action mechan simpli consist motor receiv signal form control vector suggest human visual process complic includ sort layer analysi interpret possibl addit layer central control modul visual system encapsul packag suggest fodor action mechan includ direct simpl signal sophist control hierarchi high level symbol instruct instruct subsystem execut concurr organ simpl unstructur usefulli repres tripl tower organ paper discuss complet investig architectur system common architectur depict figur concern collect process layer lie sensor motor oper level differ type power lower respect idea neurosci albu page present notion layer brain lowest level implement theoret partli lack resourc partli gap design delib reason reactiv mechan figur tripl layer model model vari mechan function sort descript control inform flow layer oper concurr sort domin high level domin lower level level split action level reactiv layer split top level layer albu domin top level label model assum relat evolutionari mechan function layer oper sensori input motor output connect differ layer explain recent evolv level ai research explor number vari sophist vari kind control relat layer hierarchi exampl compar theori architectur layer assum inform sensor lowest level pass inform hierarchi topmost level major send control signal hierarchi lowest level drive sort model inform flow figur vertic stretch central circl fodor architectur ad intern structur omega architectur fodor model common system base engin design motiv set practic requir architectur motiv larg analysi requir live includ requir system produc evolut terminolog human carri skill task involv percept drive car oper time perform cognit demand task hold assess evalu state mind feel tire suggest subsystem extent behav complet act parallel previou wright explain main featur delib layer sort architectur assum higher level system total domin partial control distinguish system architectur differ abil layer perform reason chain futur action order form plan close relat abil reason past action order form explan previou success failur worth layer ultim implement reactiv mechan familiar comput system mechan type implement mechan type mechan action perform implement mechan thing central process percept action delib reason reactiv mechan figur combin tower layer view schemat overview function differenti architectur compon shown text figur combin view tripl tower tripl layer model combin previou diagram produc figur sensori action compon oper parallel level abstract feed inform inform level central system gener idea higher level cognit function develop requir sophist perceptu produc evolutionari pressur develop perceptu system oper abstract roll remark object recognit form develop abstract advantag wider rang condit disadvantag provid inform detail addit mechan oper abstract percept chunk inform form support learn associ delib reason handl fast dedic perceptu mechan support faster high level compar appli gener infer mechan result low level process perceptu mechan process biolog import inform anim figur abstract perceptu task specif dedic human high level function achiev remain hard research problem function vision similarli higher level mechan give abstract command action leav highli train evolv action control hierarchi produc detail simpli modul action gener lower level faster catch replac stop illustr power action routin compar write normal write hand hand full knowledg task harder unusu spend lot time train action mechan write control muscl theori mechan box capabl appli evolutionari pressur influenc develop similar view develop mechan stand walk inher unstabl upright postur leg produc pressur sensori system produc perceptu inform rapidli detect motion correct action human visual system inform optic flow send signal postur control happen alarm central process percept action delib reason reactiv mechan figur ad alarm mechan context produc behaviour mean long fast system interrupt redirect part system figur show global alarm alarm system parallel perform visual peopl afford environ provid visual feedback grasp direct control walk model impli inform sensori subsystem process concurr kind inform rout parallel current architectur contrast view visual system mention consist recent discoveri multipl visual pathwai idea present suggest function distinct sensori pathwai exist discov includ linkag mechan sensori modal enabl share mutual disambigu task catalogu full varieti perceptu function human anim bare begun restrict abil design robot complet task requir full analysi kind perceptu afford detect meet organ complex afford involv percept possibl imposs discuss system reactiv mechan gener faster delib mechan explain delib system inher discret serial characterist access short term memori structur repeatedli access associ memori answer question action situat happen action perform situat reactiv system lengthi sequenc chain intern reaction sensori input motor instanc system delai fraction make differ catch lose opportun avoid injuri death reason pure reactiv mechan fast result genet determin design result previou learn rapidli detect chang behaviour rapidli produc chang send control signal system alarm system schemat depict figur alarm system receiv input main part architectur send output main part alarm mechan neural net architectur layer function fast rule perform complex explor mean alarm mechan necessarili delib system sophist reactiv expect thing wrong situat global interrupt trigger posit gener failur react quickli danger advantag fast alarm system outweigh disadvantag alarm system trigger kind global includ roll rapidli jump sidewai avoid fast approach larg chang direct speed motion subtl reaction high level attent control system attend visual auditori physiolog cognit state enhanc readi kind action kind cognit rapid plan chemic organ heart physiolog phenomena underli familiar emot essenti type emot worth note figur depict alarm system separ architectur specif consist requir reactiv layer architectur alarm mechan simpli reactiv layer architectur constru earlier paper typic differ reactiv compon receiv input part send high prioriti control signal part organ mean reactiv mechan domin layer differ simpl subsumpt mention principl similar natur organ mechan human innat reflex mechan serv type narrow field influenc blink reflex trigger rapid protect ey danger driver fast car musician music illustr exist human fast trainabl involv sophist inform process trainabl fast reactiv system brain doubt brain defin boundari alarm system fast reactiv system global control capabl requir alarm system diagram complex chang organ learn situat fast global link process reactiv process involv alarm mechan trigger sensori input physiolog state produc global physiolog subset primari emot global alarm trigger event delib layer secondari emot subset case effect alarm disposit overrid control level tertiari emot distinct type paper present complet overview addit compon architectur decomposit outlin amount specif function system detail list figur section overview explicit implicit goal mechan organ implicit explicit goal goal implicit detect situat directli trigger gener uniqu implicit goal reaction design evolv achiev explicit long term associ memori persona mood process motiv gener attent filter motiv motiv compar categori formal descript standard valu attitud extra mechan figur addit compon requir system addit briefli section result check current situat match goal explicit goal sensor detect contact hot object trigger withdraw implicit goal avoid damag hot move state longer contact hot object descript implicit goal uniqu determin simpl organ swim detect shortag energi resourc trigger behaviour open mouth orient movement control sensor detect densiti gradient detect automat determin action requir satisfi action depend ascertain examin search inform food organ knowledg work order food knowledg determin acquir knowledg work food requir knowledg food buri locat distanc achiev goal consum food requir intermedi step pure reactiv system cope provid suitabl collect reactiv behaviour detect energi shortag trigger product explicit intern state effect repres goal obtain food state function trigger addit behaviour termin food turn trigger remov food eaten involv intermedi reactiv exist high level goal repeatedli trigger action determin combin goal chang context continu current situat food reach reactiv goal driven behaviour work organ effect plan achiev goal plan implicit larg collect rule situat plan plan mechan work sequenc action achiev goal reactiv system organ suffici rich vari evolutionari histori evolv larg collect plan cope problem environ insect anim problem evolutionari histori type organ genet structur larg store plan individu brain larg partial solut individu born partial reactiv plan store surplu capac kind learn learnt sequenc train perform encod plan sort environ implicit reactiv mechan sophist depend formal express goal condit action goal formal simpli collect flag activ level fulli altern goal state includ paramet bound valu introduc flexibl select action case formul syntact complex goal food type distanc syntact complex found delib mechan delib mechan reason environ mention partial solut plan train process reactiv system slow danger train pure reactiv system satisfactori environ suitabl context learn delib layer requir evolutionari histori individu train opportun provid wide varieti plan learnt safe form learn requir trial reward safe error punish entail death injuri delib mechan enabl analysi futur possibl provid safer discov point notic die stead philosoph karl note requir reason mechan goal immedi trigger behaviour reactiv trigger plan behaviour delib layer typic involv explor combin futur action found achiev achiev state easier achiev goal delib mechan creat select plan partial plan process depend organ begin produc behaviour control plan research ai year show plan complex process peopl suspect design work system capabl thing complex plan mechan interrupt oper concurr perceptu goal gener plan execut mechan busi execut plan achiev import mechan requir delib process work short term memori candid plan step predict plan execut construct prior select longer necessarili memori plan achiev abandon mechan learn compar result plan execut sophist plan memori requir long term extend associ memori store inform order answer question form action situat type type situat result perform action situat good bad aspect situat type suggest evolv reactiv system typic biolog process copi modifi evolv mechan basic content address associ engin determin action produc condit copi common modifi determin input repres hypothet situat order produc set individu mechan cope associ requir predict mechan condit event altern consequ sequenc evolutionari step requir produc function topic research detail clear sort trainabl associ neural net implement requir function memori mechan type explor ai research plan problem plan system explor branch set altern futur associ memori includ inform altern condit produc planner delib mechan present goal capabl discov altern plan achiev addit evalu criteria requir select altern plan case basi plan relat current prefer plan promot hinder goal ideal chapter notic select necessarili base selfish addit organ gener shorter plan longer danger danger easier terrain shorter familiar strategi unfamiliar context outcom partial uncertain explain previou sort delib mechan produc plan serial parallel neural mechan underli main oper serial reason limit short term memori build temporari structur plan access long term associ memori inher serial deal queri time singl high level mechan resolv major multipl inconsist east food west final system learn associ event delib number event complex search associ subset event exponenti number event learn requir parallel constrain heard argument dana skill compil creat plan slow process plan creat plan store repeat plan process easi comput human plan creat number found train effect reactiv system memori mechan structur learnt slow delib process transfer reactiv system futur rapid retriev delib perform task time word architectur includ skill compil leav open question detail store reactiv type creat select futur instanc formal slow delib mechan develop speed requir transform suggest analog differ interpret compil varieti motiv discuss assum bodi state food perceiv produc trigger reactiv behaviour suitabl trigger delib process produc plan achiev goal assum mechan produc goal place sort organ discuss requir motiv gener issu function motiv gener discuss kind motiv short long perman trigger physiolog delib process subgoal process part organ collect motiv type activ asynchron parallel process middl build tire curiou sight result asynchron motiv motiv compar resolv conflict simpl model singl numer motiv base assumpt motiv util scalar valu partial order real life thing organ learn motiv treat import discov short term long term consequ failur act select skill express collect specif motiv reactiv problem solv plan mechan compar part determin level goal select conflict organ innat motiv gener motiv compar capabl acquir process influenc cultur word motiv gener gener motiv compar specul sophist organ motiv gener compar motiv compar compar plai role creat learn motiv gener motiv evalu mechan evalu mechan organ evalu aspect current state preserv termin independ comparison goal motiv aesthet experi involv evalu current state worth serv rainbow enjoi tune evalu plai role theori instanc frijda theori includ action action evalu desir undesir independ comparison specif altern part process decid goal adopt reject mean evalu bad goal postpon hope mean human reason capabl past event evalu good bad failur part understand wrong altern mean mechan evalu state event good bad slightli context defin simpli term form output classif continu scale make evalu function role classif larger architectur current situat evalu good impli absenc organ mechan preserv resist occurr reduc termin evalu bad evalu good bad futur action consid possibl case effect follow evalu evalu relat learn process learn mechan base posit neg reinforc tend likelihood action found produc result evalu good likelihood action result evalu bad simpl summari justic varieti learn roll import evalu assum evalu make conflict motiv resolv compar evalu simpl numer scale good bad state event consum report show present result comparison term collect descript object result analysi simpl simpl sophist order scale gener evalu complex evalu reason conjectur human learnt motiv comparison base rel util common rule compar motiv outcom action learnt separ case learnt cultur process form individu learn case conflict remain disposit manifest evalu close attitud discuss choic sick mother leav fight countri exist problem impli exist answer evalu produc evolv serv function larger perform evalu concurr independ possibl conflict evalu instanc fear pull pain sexual pleasur talk evalu impli layer monitor intern state process detect evalu produc subsystem case organ awar evalu pleasur pain evalu close relat familiar concept concept extrem difficult chapter concept includ call evalu state pleasur current situat activ evalu produc disposit preserv pain connect neg produc disposit termin reduc effect evalu disposit context effect overridden person behaviour irrit produc disposit chang avoid presenc factor overrid neg evalu prevent disposit act strong valuabl evalu occur level account kind pleasur pain inclin refer pleasur pain occur fairli high level control hierarchi potenti affect global behaviour simpli reaction minor compon deep system perform function work clarifi relationship evalu pleasur pain pleasur pain thought emot enjoi emot give oneself mild pain press sharp point emot peopl insist case intens emot wai notion indetermin account offer restrict term case evalu produc disposit trigger sort interrupt redirect ongo activ global alarm mechan similarli evalu involv emot perceptu mechan detect posit neg afford involv evalu object situat good bad relat current goal gener involv kind special case percept trigger activ alarm mechan disrupt disposit produc disrupt emot disposit vari threshold class disposit weak normal concept inher vagu boundari mood attitud mood attitud affect concept defin architectur relat distinct emot common tend longer desir respect mood attitud mood straightforwardli constru global state modul perceiv environ intern involv chemic human mood turn gener modul effect state process mood danc express specif desir sort mood discuss gener state calm dont simpli word languag similar diverg usag ill ignor case mood global adapt reaction environ environ attempt partli riski action induc cautiou pessimist mood strong disposit select riski altern ly option achiev result similarli environ moder riski action found gener success induc optimist includ strong tendenc select action highli valu risk failur call ration reaction impli consciou adopt mood impli ration design build mechan produc mood similarli evolut select mechan organ tailor behaviour appropri individu organ idea happen result brain damag sort mechan produc chang mood discuss import symbol call gener state modul specif semant subdivid architectur topic futur research gener long term complex vari mood semant content simultan attitud individu polit style attitud thing includ collect motiv prefer evalu gener rich semant content fact simultan includ love peopl hate impli major typic frijda result attitud awar term refer attitud thought exampl emot love member music religi endur time thing emot memori infer interact attitud trigger motiv produc motiv gener hear rel trigger state great newspap headlin announc success individu strong attitud trigger emot anger motiv person attitud involv larg collect disposit behaviour disposit instanc disposit produc mental state note work clarifi architectur requir mechan involv modif activ attitud attent filter reason discuss previou paper wright newli gener alarm piec inform transfer reactiv layer delib layer disrupt activ goal plan activ urgent import requir close continu attent argu delib system goal import item perceptu inform present delib deal goal inform resourc import demand task extrem continu inform goal disrupt intric listen complex instruct perform import watch child danger disrupt wast frequent redirect attent reduc delib mechan sort attent filter dynam variabl threshold determin alarm signal potenti interrupt divert process delib layer interrupt threshold high current task urgent low time extrem import urgent goal principl gener time build filter total exclud kind interrupt mechan gener potenti interrupt assign quickli comput heurist measur urgenc previou paper label motiv divert delib process depend insist current threshold suppress pain produc injuri battl import footbal match progress function filter contrast insist defin relat power penetr interrupt intens defin abil remain activ select action boost intens motiv act reduc wast cycl plan goal process decid disturb higher level process divert interrupt filter fast global alarm reason potenti error prone global interrupt filter delib mechan sort global alarm mechan filter implement separ mechan part oper alarm system motiv gener clear implement filter type beaudoin switch persona human layer rigidli fix mode oper prefer control system time person person drive deal subordin offic switch control person involv turn larg collect style thought type reactiv possibl thing thing architectur requir store mechan acquir social mechan store person modifi extend mechan trigger extern context control person system part explan kind multipl person disord relat mechan social control social system cultur influenc individu evalu control delib provid mechan individu learn thing result experi mechan individu control made conform social approv pattern thought behaviour form religi make peopl thought attitud organ subset architectur part grid necessarili present anim type architectur conjectur explan human function sophist organ evolv includ type organ complex subset architectur found consist conjectur complet system evolv simpler architectur ad intern function differenti studi explor neighbourhood human give deeper understand design pure reactiv organ spider type organ pure includ complex genet determin reactiv plan case spider plan control behaviour individu organ social termit complex achiev result parallel activ reactiv plan construct termit evolut present enorm varieti problem evolutionari found enorm varieti solut discuss type filter beaudoin phd thesi percept action environ alarm reactiv process figur reactiv system alarm mechan design insect discuss reactiv mechan sketchi main featur reactiv mechan includ reason mechan construct situat present evalu explain reactiv mechan includ implicit explicit goal sort featur reactiv reactiv hybrid process analog discret mechan mechan space dedic specif parallel achiev great process proce mutual intern state dedic memori neural gener inform store requir delib mechan condit action pure sophist reactiv system reinforc learn requir alter weight architectur store plan implicit learnt chain construct plan structur descript advanc implicit plan learn plan modif learn chain explicit creation altern structur descript action evalu select conflict reaction trigger simultan handl vector net conflict resolut rule trigger exist conflict implicit reactiv motiv compar behaviour genet determin modif tunabl control chang weight reinforc learn disast follow environ requir plan structur speci partli larg number expend class reactiv architectur process hierarch control subsumpt architectur includ action manipul intern includ state repres temporari point reactiv mechan human form requir rapid detect fairli abstract featur environ rapid invoc complex structur perceptu action hierarch concurr process reactiv system includ global alarm mechan depict figur addit includ rapid redirect system light sudden danger sudden opportun includ behaviour feed specif train innat automat behaviour reaction close relat damasio picard call type sort primari rapidli produc alarm system gener alert attend carefulli sound gener pure intern chang distinct type emot involv extern behaviour extern detect physiolog reaction produc global occur organ alarm variabl threshold attent filter motiv activ long term memori percept action environ reactiv process delib process figur hybrid reactiv delib alarm type hybrid architectur includ mechan discuss section includ motiv content address long term variabl threshold attent layer percept action system delib reactiv compon hybrid reactiv delib organ addit reactiv anim closer human design space delib capabl simpl form mammal hard case report studi creativ problem solv demonstr abil ahead grasp consequ action perform abil vari individu ap hybrid reactiv delib architectur depict schemat figur includ reactiv delib global alarm mechan mention section featur delib mechan hybrid architectur discuss explicit goal possibl syntact rich support short term drive creation plan descript sequenc action construct action perform gener short term memori mechan varieti task store unlik reactiv system state inform dedic compon plan found repeatedli transfer skill reactiv layer invok execut quickli sensori mechan oper concurr level high level perceptu layer produc inform store requir reason action mechan higher level accept abstract descript automat lower level action explain delib layer action larg serial compar slow environ bodili trigger event reactiv interrupt goal delib layer process filter interrupt goal dynam vari interrupt threshold reduc explain filter act quickli oper delib resourc sophist reason capabl make trainabl heurist fit environ hybrid system requir global alarm mechan reason section addit effect alarm mechan reactiv hybrid system featur alarm mechan trigger occurr hypothet futur past possibl repres reason trigger actual occurr detect sensor intern state monitor hybrid system alarm mechan interrupt redirect modul delib layer trigger chang extern behaviour modul reactiv process extens function alarm mechan produc sort anticip danger reliev discov anticip event occur alarm system produc host learnt effect delib switch mode specif wai depend current goal current environ detect rapidli approach danger trigger care detail mode order chanc find suitabl plan necessarili plan delib mechan trigger global event alarm correspond case cognit process trigger emot distinguish type secondari emot produc pure central secondari emot pattern activ delib mechan alarm mechan trigger rapid type content delib produc extern behaviour extern detect physiolog partli secondari global signal chang central extern detect state muscular blood modul class secondari emot produc modif intern delib process depend mechan notic context architectur defin collect concept distinguish type process independ process found real organ word architectur defin concept formul empir research question answer investig organ architectur concept support layer ad architectur alarm return complet system postul depict schemat figur figur present sort architectur slightli enrich figur process process previou concurr monitor intern possibl includ intermedi layer perceptu evalu current state includ delib layer modif concurr activ reactiv alarm mechan disrupt item exce current threshold attent filter mechan mention layer function perform delib mechan determin strategi rigid intern monitor evalu mechan organ improv plan reason method detect situat attent work problem produc inform act remind import improv alloc scarc delib resourc detect state vari interrupt threshold context sensit compar automat inflex adjunct delib record delib feed learn detect manag delib strategi work alarm variabl threshold attent filter percept action delib process process environ reactiv process motiv activ long term memori figur layer system architectur mechan receiv inform part system basi evalu extent control intern state includ delib process distract interrupt inform reactiv mechan perceptu global control signal alarm mechan variabl threshold interrupt filter mention protect delib process explor intern problem solv evalu consequ intern diagnosi ill problem describ intern symptom evalu high level rel high level long term gener aspect intermedi visual commun effect direct attent meet left edg draw commun thing access content intermedi perceptu buffer intern state philosoph inclin robot discov sensori start human thing promot kind learn reduc frequenc failur prevent adopt goal interf prevent effort problem turn notic plan problem solv strategi slow possibl replac faster eleg detect possibl structur share final subtl cultur influenc behaviour function perform reason monitor give complet access detail intern state form form percept involv possibl introduc error incorrect previou experi wrong made religi peopl normal healthi thought motiv process control stop process partli control disrupt salient percept featur situat trigger alarm situat interven characterist tertiari emot partial loss control attent presenc control attent contrari claim theorist damasio emot pure cognit level alarm mechan trigger event delib mechan interrupt divert process delib system primari emot system peopl prone react bodili includ extern detect secondari tertiari emot occur distinguish partli pure central secondari tertiari produc addit primari emot architectur layer type emot everydai attribut affect state implicitli peopl inform processor partli gener semant includ refer object emot angri angri long possibl inform plai central role product charact emot semant inform long emot involv complex control state deep long deep long thought uncontrol drawn physiolog process facial blood muscular amount involv primari emot subset secondari tertiari necessarili emot import physiolog reaction psychologist influenc theori emot contrast view poet emot fact theorist regard physiolog phenomena defin emot central illustr comparison section collect blind men understand eleph basi part feel basi theori predict misunderstand sort control includ product physic redirect thought motiv inform process architectur rich architectur layer discuss alarm system mechan gener explain call tertiari emot primari emot involv event trigger reactiv mechan alarm system rapidli redirect reactiv behaviour perceptu motor subsystem includ thing disgust sight larg kind sexual aesthet separ categori simpl organ primari emot provok sophist case produc readi kind action action alert secondari emot trigger event delib reason perceiv relev import delib activ long term goal secondari emot occur reflect past idl reminisc result kind pleasur unexpect notic plan action contempl wrong produc mixtur extrem attent task effect emot includ typic primari emot architectur framework explor kind secondari effect architectur support long term high level percept unexpectedli anim interact attitud love gener host reaction includ gener goal resourc achiev goal secondari emot includ effect characterist tertiari disrupt redirect architectur includ tertiari emot depend type architectur layer capabl includ control attent thought process case possibl loss call refer includ state feel overwhelm feel aspect excit typic human gener stuff gossip involv social possibl kind social interact primat simplifi version tertiari emot social import human emot requir sophist concept knowledg rich control mechan sophist architectur success resent pass solv famou hard mathemat semant rich complex behaviour express languag speech written shakespear great exampl languag express situat complex previou remark actual emot state mixtur kind label necessarili identifi simpl categori thing call involv effect found ordinari usag word refer unambigu categori defin term underli architectur shown previou sort architectur discuss potenti explain varieti emot differ part system affect discuss static state develop vari subtl distinct made dynam sort kind feedback loop long intens rise long term effect sort framework present begin defin ontolog mind sort found human stage kind brain support mental ontolog anim sort human capabl class emot state suggest newborn human infant adult inform process capabl burn religi nation pride viewpoint mistak claim sort emot physiolog effect brain manner suggest william jame pure central secondari tertiari architectur support individu speci empir question definit mistak emot necessarili involv awar emot leav ambigu concept awar fact peopl emot state evid angri point plai architectur awar involv capabl capabl direct organ young lack incap awar intern state primari defin sort awar term architectur mechan support replac question collect empir question explain exist involv kind made action layer theori present highli specul make close truth implic understand topic cognit kind individu develop learn varieti perceptu process sort afford process varieti brain damag occur effect kind emot affect state process occur acknowledg theori type emot affect state necessarili conflict theori aspect semant effect theori concentr aspect emot attitud orthogon architectur attempt account emot label complet theori encompass reason expect taxonomi languag surviv sort architectur inform process mechan architectur power visual mechan implement anim prematur hope complet survei type architectur capabl turn architectur produc million year evolut bound messi unstructur understand scientist philosoph turn human principl modular order achiev robust effect collect find kind anim figur figur earlier discuss present structur modular combin central level global mechan diagram mislead partli convei design research frequent diagram indic diagram indic interact compon architectur arrow repres chang state repres flow inform compon diagram kind understand natur occur attempt preliminari overview featur architectur implement begin understand option understand evolutionari pressur shape mind research architectur collect layer idea hierarch control system connect analog feedback control recent ai system architectur includ albu nilsson mention subsumpt architectur brook idea discuss depend high level architectur stori understand minski notion brain section closer layer architectur mean thing research refer architectur distinct layer orthogon distinct classifi crude fashion read base futur concurr activ pipelin layer albu nilsson layer sequenti process sensori inform sensor bottom abstract interpret higher top basi stage abstract control inform flow layer motor call architectur pattern inform flow shape ai model style includ hybrid lower level compet neural net activ trigger incom sensori inform higher level symbol process select compet altern architectur layer concurr kind control inform constantli flow figur figur architectur figur domin hierarchi function differenti distinct concern higher level domin lower level attempt control successfulli direct control subsumpt model higher level deal abstract state goal complet domin lower level turn lower level behaviour speed slow modul conform standard idea hierarch control engin layer architectur level manipul sophist abstract necessarili domin lower attempt higher level partial control lower level lose alarm mechan influenc divert attent attent divert sensori input high salienc bright newli gener motiv high sit hard model major lower level reactiv mechan directli control delib concern control bodili function train possibl dimens variat direct control trainabl layer system assum higher level directli control lower level separ form control clear human higher level retrain lower level directli control repeat perform sequenc action carefulli control delib layer reactiv layer develop chain behaviour run higher level fluent skill music make natur interfac central mechan action control discuss section relev kind process control function layer kind process mechan reactiv perform oper level abstract model kind process function role figur show layer architectur includ lowest level pure level mechan repres futur action consequ evalu make select reactiv system behav tradit ai plan system similar mechan relev explain past mathemat gener reason counterfactu condit delib mechan reactiv mechan explicitli repres altern action prior select implement reactiv reactiv mechan oper structur temporari workspac reactiv mechan implement kind lower level includ neural symbol relianc level architectur kind high level global control chemic mechan slow unstructur intric problem solv argu human capabl requir quantum mechan convinc account explain detail mental phenomena spring distinct concern motiv gener plan singl layer origin layer variant omega inform flow layer trigger motiv mechan top process system includ motiv gener physiolog monitor reactiv layer gener acquir adjust motiv gener handl reactiv transfer delib layer adopt possibl plan store strategi achiev goal sort context full survei theori motiv gener scope worth note motiv benefit individu satisfi attempt explain kind power comput term sourc motiv architectur handl compet motiv motiv mutual deal conflict architectur differ locu conflict resolut mechan deploi form schemata form coalit opposit basi fix excitatori inhibitori link kind numer summat lead level hierarchi model detect conflict symbol resolut level sort conflict instanc stai home concert handl part continu utter current sentenc stop breath vocabulari address anger handl part system part compet reactiv part gener delib mechan decid word good long run perceptu central connect architectur perceptu compon differ relationship mode process perceptu modul central layer perceptu process produc level perceptu inform feed central fix entri level central inform pass omega fodor model depict figur omega model model sensori inform limit process interpret central fodor model version marr inform arriv narrow layer process contrast model percept model present perceptu sensori mechan transduc complex sensori produc inform environ direct compon central architectur trigger process affect part figur subsequ suggest perceptu process handl level abstract mixtur bottom rout part central system delib mechan perceptu inform chunk fairli high level fine control movement requir continu vari input reactiv system differenti effect kind brain damag support defend engin ground model defend greater length central motor connect analog distinct concern relationship central motor process call action extrem channel link motor system lowest level central omega motor signal directli part central mechan extrem hierarch motor control system control inform sort directli layer central system telescop fairli high level abstract instruct hand motor system produc transform detail motor instruct muscl control signal fodor model figur cover telescop model action human motor system complex hierarch anim support model abil perform skill base reactiv behaviour modul control high level prefer instanc plai music make act stage give impress architectur hierarch action action hierarchi separ layer commun central process fold central control telescop part central cognit mechan give hierarch action mechan access power central reason mechan inform reduc opportun central process problem continu uninterrupt complex action carri model constru describ similar system view differ engin design complex investig fulli design central system action system hierarch oper concurr advantag organ robot long ahead carri complex action part action hierarchi receiv instruct directli part central system control inform channel directli select bottleneck conflict detect action resolv routin trigger sort interrupt central mechan conjectur design understand system evolv human anim engin design similar comment applic involv architectur percept emerg notabl featur recent ai literatur architectur diagram special box label contrast specif compon function produc emot explain varieti emot emerg properti interact compon alarm mechan mechan divert attent emot compar emerg architectur thrash result interact mechan swap alloc resourc fairli heavi load special modul thrash detect system depend avail sophist process disagr label compon architectur word partli theorist write motiv emot compon gener motiv gener person gener separ accord ordinari motiv desir intens desir properti characterist disrupt emot state area greater conceptu part studi varieti state process support case clear capabl compon emerg featur interact compon attent filter figur figur exampl special filter design produc effect emerg involv mysteri process sort emerg usefulli distinguish emerg process properti featur defin term small scale compon make causal interact deriv logic mathemat law behaviour low level featur interest type emerg involv process virtual machin ontolog defin term ontolog underli implement law behaviour entiti ontolog logic mathemat deriv law behaviour implement machin chess plai virtual machin concept defin term concept physic rule chess plai strategi deriv law physic descript underli physic machin case circular physic layer virtual machin physic layer causal complet discuss point found filter interact compet compon altern easier implement control flexibl gener design depend languag model postul close link high level intern process extern languag suggest mechan analog exist public languag social dennett write explain kind oneself contrari view intern mechan formal high level control develop human languag truth interplai develop intern facilit inform process mechan social process influenc enhanc instanc cultur affect develop individu categori intern process capabl anim call rich complex inform process mechan evolv long extern underpin retriev inform anim import high level featur common extern languag structur manipul intern inform usefulli extend word refer form intern languag desir intend plan biolog prior extern commun give understand phenomena refer languag depend older languag understand posit understand social linguist phenomena influenc individu mental phenomena pure intern partli extern implement subtl distinct concern implement organ intellig artefact depend intern mechan implement share environ develop wrist made program abil push cylind tightli fit illustr advantag case inform process mechan interact design ergonom effect tool furnitur exampl philosoph viewpoint interest case abil refer spatial locat individu unambigu explain long ago individu suffic determin intern thought refer eiffel similar object earth referenti capabl depend part agent causal spatial relationship thing refer attempt implement aspect mental function brain robot subtl residu depend extern adequ theori mind account refer part part virtual machin problem uniqu refer solv partli intern causal relationship explain mental state semant content implement sole intern distinguish theori develop common varieti reduc mental phenomena pure intern function comput phenomena posit distinct methodolog varieti semant content includ refer object physic condit organ robot function successfulli ontolog argu type architectur understand sort process occur basi defin set concept describ mental ontolog learn mechan develop wai cluster reward punish system kind layer depict architectur abil develop collect concept intern state process understand histori learn process role concept plai subsequ intern process architectur exacerb complex idiosyncrat charact intern process system sophist reflect scientif understand forev limit true robot bat architectur bring design option face explain architectur human mind understand architectur defin collect concept describ human mental state expect approxim reason section approxim suffic provid clarif familiar concept type chang complex system expect find ordinari concept sea concept posit understand stage architectur support type interact develop instanc evalu extent control redirect part absorb categori strategi cultur human layer fix develop limit capabl normal adult person time context home drive pub interview suggest wai studi societi cultur exert subtl power influenc individu process exist layer exist extern human languag reflect argu avail intern inform bear medium reactiv delib layer extern languag function provid categori valu individu judg mental process power form social power mechan behaviour instanc evolv learnt cultur transmit gener rapidli genom modifi social role layer requir origin emerg evolut hope clarifi technic concept common refer psychologist brain scientist conflat aspect delib layer aspect layer shown exist ai system sophist plan problem solv capabl capabl symptom planner doesnt notic obviou type redund plan subtl loop behaviour consequ layer abil attend reflect mental intellig robot discov human provid food thought ai research work multi agent brain social scientist biologist studi evolut paper present view sum architectur human mind complex system wai minski call societi mind wai ecolog mind compon evolv nich defin remaind ecolog speci organ mind collect evolv view detail elabor begun import implic scienc mind anim mind robot engin activ involv product system interact model mind entertain detail fill consequ develop partli build work partli empir investig work pursu group adopt theoret attempt design work system varieti open mind commit architectur mechan research commun result failur fulli understand constraint opportun relev approach sort approach adopt ontolog bring order studi understand myriad rival definit move viewpoint partli analog concept kind physic stuff repres period tabl kind physic chemic process enrich understand hidden architectur matter task challeng physic singl architectur multipl architectur organ intellig correspondingli vari ontolog mind differ continuum possibl larg small discontinu understand includ implic evolutionari mechan individu learn develop applic develop conceptu framework discuss kind emot mental phenomena softwar agent lack reactiv mechan requir control physic replac discuss depend arbitrari prefer definit work lead approach compar psycholog architectur develop enhanc studi effect brain damag good understand normal function complex system hope understand wai wrong scientif philosoph implic idea relev engin topic relev design complex system practic includ advanc form interact entertain develop softwar hardwar issu understood build system effect model human mental includ affect design system engag fruitfulli human requir understand human work appreci enorm individu variabl design good teach system peopl learn scienc understand mind work design system classroom effect enhanc mode produc packag packag base good theori peopl function normal function produc convinc synthet charact comput shallow pure behaviour model suffic eventu found task extend behaviour repertoir ad behaviour explicit program imit learn process turn tediou deeper model expect power flexibl acknowledg idea present develop collabor steve luc brian ian tim edmund ian cognit affect birmingham benefit interact read public colleagu includ margaret dan stan pat john member workshop emot human artifact august attend mind workshop aisb convent april paper student colleagu found softwar includ sim agent free charg learnt includ author list bibliographi grate robert trappl paolo petta make workshop patienc paper present shape awar gap clarifi refer behaviour robot byte mcgraw nh broad agent aaai spring symposium integr intellig architectur american associ artifici intellig sigart aug pp goal process autonom agent phd school comput birmingham studi motiv process attent prospect artifici page io amsterdam intellig artifici natur explan cambridg york descart emot reason human brain book reactiv motiv collect minder intellig agent iii intern workshop agent languag kind understand london philosoph essai mind psycholog mit ma modular mind mit cambridg mass emot cambridg cambridg brain mind oxford oxford ecolog approach visual percept lawrenc associ publish editor diagrammat comput cognit perspect mit massachusett emot matter iq london separ visual pathwai percept action trend comput introduct cognit scienc london intern extern peterson page visual propriocept control stanc journal human movement symbiot evolut london vision freeman artifici intellig common proc intern joint confer artifici intellig artifici intellig meet natur mind design mit ma societi mind william london bat mind reflect page penguin book knowledg level artifici unifi theori cognit harvard press program agent control journal artifici intellig artifici synthesi morgan san francisco understand emot oxford stori gener base dynam mind comput cognit structur emot cambridg york editor form interdisciplinari theme cognit scienc intellect uk affect comput mit england quest glasgow preci brain emot behavior brain scienc brain emot oxford oxford artifici modern approach prentic hall concept mind hutchinson motiv emot control cognit reprint model yale scienc artifici mit mass edit deriv american phil comput revolut philosophi harvest press human sussex enabl machin proc page lo angel motiv mechan emot cognit reprint ma boden philosophi artifici read philosophi oxford refer causal link du advanc artifici intellig page north dordrecht design visual system comput model journal theoret mind control system philosophi cognit page cambridg press prospect ai gener scienc intellig prospect artifici page io amsterdam explor design space european confer august page chichest john wilei actual possibl principl knowledg intern confer page morgan kaufmann publish gener theori peterson form interdisciplinari theme cognit page sort control system person creat person synthet autonom person page springer note berlin alarm intern confer cybernet page ieee trajectori design space nich space progress artifici confer ai page lectur note artifici lisbon review affect comput rosalind ai sort architectur requir foundat ration page kluwer dordrecht architectur requir agent natur artifici sort machin human cognit social agent advanc page john amsterdam model model symposium design function mind april concept mind intern congress methodolog philosophi dordrecht kluwer librari robot emot proc int joint confer page vancouv build cognit rich agent sim agent toolkit commun associ comput essai descript london analysi emot episod philosophi psychiatri emot agent phd school comput birmingham onlin
IR/789 5 summar text sentenc select evalu metric jade goldstein mark mittal jaim carbonel languag technolog institut research carnegi mellon henri street pa pa usa usa abstract text summar system difficult difficult part document differ write style lexic usag cue suggest select sentenc summari paper present analysi summari gener sentenc select sentenc rank potenti summari weight combin statist linguist featur statist featur adapt standard ir method potenti linguist deriv analysi summari evalu featur normal version baselin random sentenc analyz properti baselin illustr discuss empir result show import baselin summar compress ratio carefulli craft long queri introduct continu growth web onlin text increasingli import provid improv mechan find inform quickli convent ir system rank present document base measur relev user queri document retriev system interest user present user summari match document user identifi document relev user gener document present content close relat initi search queri autom document summar date back luhn work ibm research continu investig approach problem seventi eighti resourc devot address problem grew order magnitud advent worldwid web larg scale search engin innov approach began linguist approach statist approach combin work except sentenc common type techniqu creat document summari concaten select excerpt origin document paradigm transform problem gener case requir abil abstract gener possibl simpler rank sentenc origin document salienc likelihood part summari kind summar close relat gener problem inform document document set sentenc order retriev match difficult achiev natur languag understand variat write document lexic syntact build summar work case ideal text summari includ relev inform user exclud extran redund provid background suit user profil coher qualiti difficult achiev natur languag process handl issu exploit regular pattern lexic repetit document structur gener reason summari document genr natur languag understand paper extract rank methodolog assign weight score statist linguist featur text span analysi illustr weight assign featur differ type summari genr weight optim specif applic genr determin linguist featur score evalu syntact lexic characterist newswir summari statist featur proven effect standard monolingu inform retriev techniqu outlin approach evalu summar analysi perform summar measur rel improv summari qualiti modifi weight specif incorpor addit normal version salton method import paramet evalu summar effect desir compress analyz effect compress ratio describ empir experi support gener summari text extract human summar call produc gener summari reflect kei point deem import user interest fact gener motiv summari physician effect elderli femal patient retriev engin produc lengthi report clinic abstract mention inform effect elderli patient summari physician passag differenti effect elderli male buri page clinic assembl summari user inform requir summari document approach text summar gener summari score sentenc respect statist linguist featur gener centroid queri vector calcul high frequenc document word titl document sentenc score formula order summari rank order ws set statist set linguist weight featur set weight tune type data set type summari desir user summari attempt answer question linguist featur place boost weight ge featur section tipster formal evalu success linguist featur includ themat discuss section document genr assign weight reflect individu linguist method ge fact summari newswir stori includ sentenc articl tabl featur high weight newswir genr statist featur includ standard inform cosin feedback techniqu local context analysi thesauru method queri vector user interest method elimin redund maxim margin relev data properti featur ideal text summari relev inform fulfil user inform seek elimin irrelev redund inform step construct summari identifi summar extract text relev user queri methodolog improv summar perform end creat relev sentenc examin system extract piec relev sentenc consist set document tipster evalu set articl span experi elimin articl cover subject result document evalu rank sentenc document relev relev relev treat relev final score sentenc determin major vote relev consid document relev sentenc score method tabl evalu mark document relev relev topic select relev sentenc articl sentenc mark relev relev sentenc data set sentenc set averag sentenc document relev sentenc summari sentenc note relev summari includ sentenc set due fact topic document relev data data set creat train evalu set question answer portion tipster evalu set formal evalu tabl summari consist sentenc directli extract mark section document answer list question topic improv gener analysi properti summari analyz articl summari reuter lo angel time analysi cover approxim articl lo angel time tabl summari gener sentenc manual written order analyz properti extract base convert summari extract summari match sentenc summari smallest subset sentenc stori kei concept mention sentenc reuter articl cover period lo angel time articl summari data set comparison relev sentenc data comparison reuter lo angel time doc rel doc doc properti summari summari summari rel rel rel task gener summari gener summari relev relev relev sourc tipster human extract human extract user studi user studi user studi document featur number doc avg median max min queri format topic topic topic summari featur doc length incl sentenc avg size median size size tabl data set relev sentenc data summari consist major vote relev sentenc autom match process defin threshold minimum number concept noun requir match detail inspect set sentenc transform highli document genr newswir articl found transform result summari length averag tabl document sentenc includ extran empir properti summari extract summari reuter lo angel time summari relev sentenc examin properti summari properti present tabl includ averag word length articl lexic properti sentenc includ summari lexic properti sentenc includ summari densiti entiti summari sentenc found summari length independ document compress ratio smaller longer document suggest common practic fix compress ratio constant summari length figur document compress ratio document word length graph approxim suggest product compress document length summari roughli constant tabl inform characterist success techniqu depend consist vocabulari usag articl fortun true newswir articl applic techniqu document genr requir knowledg word variant graph la time data slightli tabl frequenc word occurr summari sentenc frequenc occurr sentenc calcul ratio subtract repres percent articl reuter la time distribut articl summari figur show summari length word narrowli distribut word approxim sentenc found summari includ indefinit articl frequent sentenc summari sentenc tend start articl frequent sentenc tabl show token frequent summari reuter word frequent summari sentenc sentenc sentenc begin citi dash word pick sentenc word good sourc neg sentenc articl countri tend frequent summari sentenc reuter lo angel time articl dai present frequent summari sentenc sentenc word phrase common direct indirect quotat tend frequent sentenc exampl word occur frequent sentenc includ verb document word length reuter figur compress ratio versu document word length summari word count reuter figur distribut summari word length late commun word primarili word comma colon word preposit doesnt quotat word quotat word noun good neg indic summari sentenc person pronoun tend good sourc neg frequent occur quot statement inform significantli frequent sentenc class word frequent sentenc dataset ffl anaphor possibl sentenc introduc topic ffl articl introduc peopl subsequ refer formal ffl ffl auxiliari ffl written digit word repres recent year ffl evalu vagu word convei definit qualifi ffl ffl entiti repres word compar word summari greater densiti sentenc sentenc averag number proper noun sentenc summari sentenc document averag densiti proper noun number proper noun divid number word summari compar document summari sentenc averag compar word document sentenc summari sentenc greater proport proper noun document sentenc figur summari includ sentenc proper noun sentenc proper noun evalu metric jone gallier defin type summari measur system measur system perform task automat produc summari text extract result reason summari summari fall short optim length summari inform user seek extract tipster recent evalu summari evalu consist task determin document relev topic summari indic determin categor gener summari indic establish summari answer set question inform comparison human gener summari summari rate term confid intellig length jing al perform pilot experi sentenc examin perform summar system found system achiev perform length found result determin document relev topic tipster summari summar system recogn relev topic queri creat summari list index tabl label summari inform summari relationship np summari sentenc underli unit evalu summar system stage summari creation coverag relev sentenc system paragraph summari unit paragraph consist sentenc inform suitabl type suitabl construct unit summari due addit context paragraph solv includ addit inform issu summar evalu penal extran inform summari data set section examin perform vari featur summar system evalu select baselin measur random sentenc analysi perform random sentenc reveal interest properti summari interpol recal curv evalu perform result order account fact compress summari opportun return full set relev normal version recal normal version defin number relev sentenc number relev sentenc number sentenc summari standard definit defin normal version analysi summari properti current method evalu summar measur summari properti absolut measur compar summar improv summar solut problem deriv rel measur summar qualiti compar absolut perform measur theoret baselin summar perform adjust perform valu obtain normal chang perform rel baselin improv rel baselin baselin perform adjust perform perform valu good superior rel measur improv superior algorithm good algorithm normal measur perform chang number proper noun entiti count distribut document sentenc summari sentenc figur number proper noun sentenc baselin defin summari absolut perform summar algorithm randomli select sentenc summari measur expect amount overlap summari number sentenc number sentenc target number sentenc select summari assum uniform likelihood probabl sentenc relev expect proport relev matter sentenc select expect number relev product probabl sentenc relev number sentenc recal valu recal formula relat fourth easili calcul baselin calcul recal deriv document compress ratio measur document densiti sentenc document higher baselin summar algorithm gener good summari document baselin valu measur summar perform account number sentenc select characterist document import note analysi present equat independ evalu method appli evalu document inform retriev algorithm common practic summari evalu fix compress ratio yield target number summari sentenc percentag length document note empir analysi summari written peopl found number document summari extract length compress compress dataset reuter la time tabl compress ratio summari newswir extract base summari sentenc vari document approxim constant figur previou deriv support fix compress ratio effect mean evalu summar impact fix compress ratio equal multipli compress constant chang significantli grow larger longer document significantli uninform sentenc select metric assum fix yield plausibl result equal quantiti fix longer document yield lower baselin perform random sentenc select algorithm analysi offer explan popular heurist summar algorithm work select document sentenc summari suggest number sentenc select characterist document evalu algorithm qualiti algorithm expect number sentenc random sentenc select compress report write summari typic write summari sentenc long sentenc common summari compress ratio similar analysi show typic sentenc pick word sentenc keyword yield summari sentenc worthwhil examin shape curv ratio valu success valu subtract quantiti yield percentag improv valu addit summari sentenc assum point diminish return quantiti fall yield relationship typic valu point diminish return reach result unlik document inform text summar evalu extens address perform methodolog evalu contribut compon summar system linguist knowledg statist compon explor contribut type featur summar cosin distanc metric smart search engin score sentenc respect queri queri normal recal document begin random sentenc figur queri effect fix summar output sentenc relev sentenc construct term tipster topic consist concept section consist term topic averag word set full queri consist entir descript duplic weight word queri queri method shown improv perform monolingu inform retriev previou result suggest effect summar evalu rel benefit form queri summar form queri top rank sentenc document feedback document sentenc result document shown figur figur examin output summar fix sentenc relev sentenc data select evalu section figur show summari perform document charact compress nearest major vote relev sentenc data relev relev figur compar effect queri length figur compar short queri full queri medium queri set data includ concept section topic descript full queri medium queri elimin term concept section short queri includ topic header short queri summari show slight score improv queri techniqu initi retriev sentenc perform due small size queri small queri return rank sentenc ad addit document relat term summari includ addit sentenc irrelev longer effect titl addit effect neglig sentenc document slightli perform case relev sentenc data summar output fix summari compress reflect averag document compress data tabl normal recal document begin random sentenc figur queri effect document relev relev document normal recal document begin random sentenc figur queri effect document relev data set relev document init sentenc higher accuraci short queri summari initi sentenc reflect fact sentenc high probabl relev statist techniqu work supplement complementari featur exploit characterist specif document type languag english document begin introductori sentenc gener summari sentenc document repeat inform intuit exploit system design featur equal probabl import gain understand ratio situat linguist featur occur level document paragraph sentenc level word level section discuss sentenc featur select summari sentenc newswir articl effort discov linguist featur specif document genr scientif figur show score level compress sentenc level linguist featur approxim articl reuter output summari size fix size provid gener proport document length determin actual compress factor discuss section level compress effect summar qualiti analysi illustr connect baselin perform random sentenc select compress ratio investig qualiti summari featur data set term compress ratio summar output percentag document figur suggest perform drop document length reflect occur summar select sentenc low compress statist approach ad titl improv result data set long queri significantli baselin perform random select document begin document long queri summari improv raw score short queri improv baselin random select account base equat import queri format summar result graph versu baselin random recal ident figur empir confirm baselin random recal compress ratio graph score adjust rel random baselin equat similar figur tilt show perform compress ratio calcul score relev sentenc data sentenc retriev obtain score full queri short topic queri highest rank sentenc summar relev satisfactori investig method likelihood gener summari futur work paper present analysi summari gener sentenc select sentenc rank potenti summari weight combin statist linguist featur statist featur adapt standard ir method potenti linguist deriv analysi newswir summari evalu normal version curv compar improv random sentenc select baselin analysi properti baselin evalu summar system account compress ratio characterist document set work shown import baselin summar standard discuss summar effect context work demonstr import queri format summar result futur plan investig machin learn techniqu discov addit linguist anaphor inform present format varieti document summari length proport document length random select la random select summ posit summ syntact complex summ base connect inform summ np figur compress effect sentenc level linguist featur summari length proport document length rel rel rel rel rel begin document rel random sentenc summari begin document random sentenc figur compress effect queri relev sentenc data summari learn optim weight featur combin acknowledg michel work partial fund dod perform conjunct carnegi view necessarili reflect group refer workshop intellig scalabl text summar scalabl summar system robust nlp pp dynam summar confer empir method natur languag process june gener extract base summari handwritten summari align text span juli lexic chain text summar pp salienc base content text document pp implement smart inform retriev system tech rep tr cornel rerank reorder document produc summari aug autom text summar pp summar evalu method experi analysi aaai intellig text summar workshop mar pp evalu natur languag process analysi review lexic semant summar annual workshop ifip work group nlp kr apr automat creation literatur abstract ibm journal tipster text summar evalu tech rep octob structur text summari pp design evalu model summari gener info proc manag automat text summar paragraph extract select text span heurist metric juli construct literatur abstract techniqu prospect info proc manag gener natur languag multipl onlin sourc comput linguist automat theme summar text scienc improv retriev perform relev feedback journal american societi inform scienc introduct modern inform retriev comput scienc seri aggreg text gener associ comput linguist pp robust practic text summar system aaai intellig text summar workshop mar pp automat summar english text phd queri local global document analysi pp
Agents/790 1 agent commun yanni labrou depart comput scienc electr engin maryland baltimor counti maryland abstract agent commun languag collect messag facilit knowledg inform exchang softwar agent knowledg queri manipul languag fipa cornerston develop system commun simultan subject intens standard effort goal usabl initi focu revolv establish semant varieti question enter pictur standard commun agent present question work address alongsid histor evolut semant result standard introduct past ten year experienc transform term agent artifici intellig term accompani feat agent capabl term agent softwar agent refer paradigm softwar class autonomi design time agent paradigm appeal world distribut heterogen system transform inevit affect tool methodolog softwar agent deliv fulli persist theme conceptu evolut abil interact tackl collect problem singl agent individu larg part role endow agent abil commun left agent commun languag knowledg queri manipul languag conceiv earli gradual defin concept acl kqml work knowledg share effort consortium led ai aim achiev knowledg base agent part vocabulari kse kqml thought integr part larger solut question section agent earli kqml summar collect messag express ascii transport aim knowledg inform exchang softwar system view virtual knowledg base kqml specif discuss kqml manifest design deem import year incept recast languag agent commun larger number research part fledg kqml kqml dissoci kse issu forefront group design built system kqml commun larg part effort revolv build infrastructur send receiv properli form kqml messag develop scheme agent mechan distribut share agent tradit program environ initi emerg implement act experi resolv thing kqml specif address time spent deal research realiz list issu expand term usag refer paradigm ai artifact integr kqml primarili code major issu result shift focu content agent knowledg kse repres attitud content convei inevit proper semant commun act commun network architectur assumpt earlier emphasi semant messag type semant properli defin attitud suggest messag acl languag attitud content trend manifest major earlier work acl softwar develop attitud commun piec softwar popul focu syntax pragmat softwar integr discuss standard agent commun trace histor origin situat kqml context knowledg share effort reader understand evolut acl idea concept briefli present kqml introduc concept discuss agent commun languag semant kqml singl import issu earli debat includ overview argument acl discuss fipa acl languag develop foundat intellig physic organ effort develop standard broader area agent compar evalu kqml fipa argu develop subtl differ acl agent develop tool evolv transcend semant concept includ issu present problem challeng acl examin current work address thesi standard agent commun refer standard agent explor integr part design build challeng system commun agent origin agent commun languag concept understand evolut agent commun languag concept requir understand context gave birth kqml kqml introduc result knowledg share effort influenc current effort commun approach kse initi research effort circa encourag modest fund govern agenc kse highli activ roughli year enjoi particip dozen research academia research repres branch ai commun goal develop methodolog softwar tool knowledg share knowledg execut time intellig import kind system kind includ expert system central concept kse knowledg share requir requir common kse defin common languag kse agent view knowledg base exchang proposit languag express proposit attitud proposit attitud relationship proposit abbrevi acl refer agent commun languag concept acl collect acl simpli hope context prevent finit set proposit attitud agent respect proposit proposit attitud kse model includ layer proposit proposit call content ontolog proposit kse includ compon knowledg queri manipul languag proposit knowledg interchang format ontolingua kse layer view independ languag proposit content content chosen independ languag proposit attitud kse role case kse fipa captur proposit proposit proposit agent kqml influenc virtual knowledg base concept proposit content defin proposit attitud kqml concern prescrib agent design commun incorpor design intent choic origin kqml specif intent specif design choic issu chosen syntax deem changeabl build function agent requir agreement issu seemingli termin charact ascii stream kqml messag transmit tcp connect concept exist acl kqml dialect fipa acl kqml illustr basic concept except kqml variant assum kif content kqml dialect fipa acl follow basic concept kqml discuss kqml commun languag protocol inform exchang independ content syntax applic ontolog kqml independ transport mechan independ content languag similar approach technic work fipa acl content languag view orthogon rest acl messag type independ ontolog assum content identifi layer kqml content layer bear actual content messag languag kqml carri includ languag express ascii string express binari notat kqml implement ignor content portion determin end commun layer encod set featur messag describ commun ident sender uniqu identifi commun messag encod messag applic transmit core kqml layer determin kind interact agent messag function identifi speech act perform sender attach content speech act messag set perform content opaqu messag layer includ option featur describ content ontolog type descript descriptor topic ontolog featur make kqml implement properli deliv messag content inaccess syntax perform syntax kqml base familiar lisp balanc parenthesi list initi element list remain element argument pair syntax reveal root initi common turn flexibl ident symbol labrou identifi problem symbol provid inform actual network address context exist refer kqml design adopt term perform kqml primit messag type speech act perform utter succe simpli speaker assert utter typic declar accompani request turn comput cohen argu perform poor term acl primit messag constru action sender make send histor continu term kqml kqml messag agent repres queri type processor laptop encod shown figur kqml perform content ontolog assum queri identifi token receiv messag agent identifi queri written languag call kif keyword content valu keyword form commun perform keyword form messag layer due send labrou kqml messag figur labrou electron labrou electron fig exampl messag queri agent type cpu laptop kqml predefin set reserv minim requir set close kqml agent handl perform origin kqml specif consid set commun agent addit perform interpret implement implement reserv perform implement design criteria kqml produc languag support wide varieti interest agent architectur kqml introduc small number perform agent describ introduc special class agent call commun agent capabl process set perform facilit agent perform commun maintain registri servic forward messag rout messag base matchmak inform provid provid mediat translat servic semant year kqml exist inform semant descript critic identifi shortcom past research put effort provid formal semant work labrou finin provid semant kqml term complet condit perform assum sender receiv precondit state agent send receiv accept successfulli process precondit perform error postcondit describ state sender success utter receiv receipt process messag utter postcondit hold error report unsuccess process messag complet condit final place intent perform start fulfil establish precondit perform success execut perform precondit assum state interlocutor involv occur conform interlocutor postcondit describ state interlocutor assum success perform commun primit complet condit describ state agent languag mental attitud action descriptor send process semant model mental attitud languag describ state sever restrict wai mental attitud combin state figur show semant sender receiv framework semant suggest agent offer unsolicit inform agent easili amend introduc perform call semant descript empti semant approach build earlier work defin ration agenc suggest approach view reserv messag type attempt commun attempt involv ration agent form team engag commun approach strongli link acl semant agent theori assum agent involv acl exchang state believ content true fig kqml semant kqml specif kqml specif introduc basic concept design syntax natur languag descript mean perform exampl commun user expect provid element viabl languag kqml commun year establish element semant part origin kqml specif specif offer term valid sequenc messag agent interact specif sporad perform commentari intuit suggest attempt address includ effort legal sequenc perform agent term polici refer sequenc polici eventu separ thread research acl commun reason discuss issu practic natur equal import agent develop kqml specif assum exist agent referenc symbol symbol messag reach destin agent detail space explain associ symbol network address agent network address suffici initi kqml agent network protocol receiv agent process group made choic kqml specif offer prescrib address earli kqml specif concept agent commun framework futur specif work prototyp implement agent design implicitli make choic number issu long stai realm conceptu framework exchang idea research meet mail list establish share understand solut made offici specif specif made attempt provid start point discuss reconcil current idea clear consist specif advent foundat intellig physic agent brought life standard question foundat intellig physic agent foundat intellig physic agent associ promot success emerg applic servic goal make specif maxim system descript fipa standard organ area softwar agent organ origin includ word physic includ agent robot varieti presenc serv remind physic agent interact part scope fipa oper open intern collabor member compani activ field european eastern technolog compani earliest activ includ british franc deutsch oper center annual round specif current specif fipa home page fipa assign task technic primari updat specif applic task technic import scope articl charg produc specif acl agent manag cover agent servic agent interact cover integr agent legaci softwar applic form backbon fipa specif fipa acl agent commun draw speech act messag action commun intend perform action virtu fipa acl specif consist set messag type descript effect mental attitud sender receiv agent specif describ commun act narr form formal semant base modal logic norm descript set interact includ request contract kind auction fipa acl superfici similar kqml syntax ident reserv primit maintain kqml approach separ outer languag languag outer languag defin intend mean languag denot express mean commun appli fipa commun primit call commun short differ kqml perform fipa acl commun act kind entiti avoid term commun act interchang fipa acl specif document claim fipa acl make commit content languag claim hold true primit understand process fipa acl receiv agent understand semant sl discuss import point fipa acl semant sl formal languag defin fipa semant sl logic modal oper belief desir uncertain belief intent persist sl repres action trace origin work cohen levesqu current form primarili base work detail descript includ scope articl found fipa acl specif fipa acl semant commun act set sl formula describ feasibl precondit ration effect ca feasibl precondit describ condit sender ca agent properli perform commun act send feasibl precondit hold sender agent oblig perform commun ration effect repres effect agent expect occur result perform typic specifi condit hold true recipi receiv agent requir ensur expect effect find imposs agent knowledg ration effect plan ca assum ration effect necessarili follow conform fipa acl mean agent send ca hold irrelev conform issu introduct basic understand figur show specif commun act agent inform agent content content inform mean sender inform receiv proposit true send agent hold proposit receiv knowledg truth proposit intend receiv agent proposit true effect fig fipa acl semant commun act inform agent inform agent compar kqml fipa acl kqml fipa acl ident respect basic concept principl observ languag differ primarili detail semant framework differ semant framework imposs exact map transform kqml perform complet fipa vice versa differ import agent true bdi agent languag assum basic reserv content languag fipa acl agent limit understand sl properli process receiv messag case request languag syntax kqml messag fipa acl messag syntact ident commun primit import attribut fipa acl fipa chang syntax match facilit transit kqml system fipa acl larg part make agent system provid code incom messag channel network level network protocol ident syntax infrastructur choic acl encourag thought appli semant languag kqml semant semant languag differ level constitut semant complet condit feasibl precondit ration effect fipa acl differ level choic definit modal emploi languag describ approxim kqml primit framework vice complet accur translat defin ca fipa acl approxim replac definit inform figur definit semant differ acl treatment registr facilit primit primit cover rang import pragmat updat registr find agent assist process request task perform languag treat object fipa intend task treat request action defin rang reserv action cover registr task reserv action formal defin specif semant defin term descript acl user express desir fipa acl includ facilit primit accustom kqml user request serv sober remind acl requir care mix theoret pragmat fipa explor accommod facilit primit fipa acl similar basic assumpt syntax exist acl assumpt share registr mean commun code chang choic acl defin acl intuit understand primit prevail semant definit agent implement modal agent theori semant account languag chose base pragmat concern programm develop commun author receiv amount read natur languag definit primit agent commun semant emerg fipa acl addit headach implement decid acl larg semant differ acl comparison issu term practic incorpor acl agent system system kqml fipa provid suit api facilit receiv acl infrastructur servic assist agent basic facilit servic agent thing code reserv messag type commun prescrib semant code depend applic detail agent system acl programm provid item item reusabl compon programm integr applic code programm integr list item exist continu run servic agent craft build agent bit complex canon acl messag syntax fipa acl includ addit messag paramet semant primit paramet deep semant essenti process acl messag acl specif convent scheme messag suggest method deliveri acl includ pragmat addit formal semant layer pragmat aspect digest acl syntax extract insert messag paramet queu acl messag deliveri tcp network protocol pragmat issu includ convent find agent initi interact issu scope fundament abil speak acl research group design built agent system establish convent choic pragmat issu api kqml fipa acl provid actual process acl messag respect deep semant primit applic make todai care queu task mention perform task kqml fipa intent complianc specif mean complianc pragmat convent convent part standard extent acl semant subtl discrep implement account larg part situat todai lack system acl issu specif acl syntax semant suffic fulli includ acl solut acl useless artifact fipa effort address collect outlin contribut introduc topic emerg fundament construct interest system commun agent opinion agent commun languag refer agent commun includ issu transcend semant remain cover detail current work issu syntax encod core semant acl defin deep semant semant declar knowledg primit semant express knowledg sl case fipa acl semant account hearer speech act content commun act hearer content correspond syntact acl canon syntact form acl messag kqml fipa ascii sequenc advoc abstract syntax acl fix element abstract syntax direct semant messag multipl java advoc xml flexibl encod elabor point section servic infrastructur multiag system acl implement api mention open section differ set primit intend mean constitut barrier confront due mundan obstacl hand api written java agent infrastructur basic servic provid mean acl send receiv network scheme expect solut problem advoc scheme multipl encod xml mean reduc overhead build agent interact exist agent xml encod overhead tool thing remain flux solut approach applic domain easier develop servic build top infrastructur agent messag encod mention origin kqml specif suggest implicit sequenc messag agent interact idea commun agent introduc explor mark shift individu messag sequenc agent engag order perform task emphasi shift intern behavior pattern semant softwar develop bodi work area impress warrant workshop commun agent www www kqml kqml fipa acl evolv distanc mainstream internet technolog standard internet standard organ agenda except project major industri player commit major resourc depend plan futur work advantag fipa time www huge repositori inform agent refer conjunct www drive great part agent work acl fipa reason suggest acl work integr easili www leverag www tool infrastructur step integr acl work www abstract syntax acl domain specif content xml encod messag content type mobil agent interest confer effort creat content languag suitabl knowledg www content darpa agent model languag agent commun languag agent commun languag agent mean exchang inform knowledg kqml fipa languag proposit attitud acl intend layer mechan rpc rmi handl rule action simpl object semant acl messag describ desir state declar procedur method acl cover entir spectrum agent exchang complex object exchang share plan share experi strategi acl defin type messag agent exchang agent engag singl messag exchang share sequenc messag order accomplish specif negoti auction conceptu strategi behavior drive commun behavior agent send expect recipi respond messag expect encod messag structur encod polici increasingli recogn kqml fipa commun pattern messag exchang agent follow commun coordin lend context send receipt facilit interpret part infrastructur work devot problem specif implement agent issu requir access peopl agent specif standard describ learn support set agent describ class capabl defin sharabl desir coordin agent attempt accomplish specif task protocol specif type negoti agent adher coordin commun action attempt accomplish task suggest protocol coordin akin script specif coordin action result deep understand domain task hand effect task adequ form sequenc commun interact specif share agent kind inform agent sequenc messag determinist automata express varieti behavior remain conceptu simpl sophist desir formal support concurr verif set role agent engag plai constraint depend individu messag captur role equal repres coordin commun agent pursuit singl common goal set particip chang interact capabl easi specif individu develop system develop abil extend exist special composit special abil creat version detail origin akin idea subclass languag composit abil combin compound develop capabl entail creation syntax express term exist link piec compon set agent particip defin interfac agent standard set serv abstract agent interfac standard set function call method invoc serv api tradit approach interfac class servic identifi collect provid servic particip agent provid class servic implement set implement express idea earli winograd flore state transit diagram describ cool system detail current base model describ agent arc cool state transit diagram repres messag messag consequ polici agent automata engag model approach extend fsm focu express adher includ kuwabara al add inherit wagner al haddadi defin state abstract task model chosen stai bound cool basi develop system nodin unruh pitt mamdani protocol bdi agent martin al emploi transduc lin al cost al demonstr moor appli state chart parunak introduc graph bradshaw introduc notion suit collect agent labrou definit grammar work make contribut gener understand work facilit share polici agent fipa contribut effort provid specif number interest protocol agent commun www number research fipa suggest acl messag encod messag layer content layer xml xml languag creat markup languag describ data xml encod fipa acl messag includ content contrast html describ document structur visual xml describ data format indic data displai data mark xml target devic extens style languag xml sourc primarili intend directli human xml render standard standard web browser special lead method render specifi stylesheet xml defin languag construct xml languag call suppli specif document type definit essenti grammar extend bnf describ comput recent work explor polici standard petri net analysi languag dtd rule defin element structur languag describ defin dtd state element consist element call order dtd nest element default browser xml parser interpret document instanc learn rule defin dtd defin commun markup xml languag describ fipa acl messag deep semant commun primit simpli semant affect encod xml previou defin independ choic syntact encod encod acl messag xml offer advantag potenti easier develop parser encod xml markup inform directli tool write custom parser acl messag chang enhanc acl syntax result parser long reflect acl xml parser handl acl messag advantag process develop maintain parser simplifi make acl facilit softwar engin agent agent develop advantag build www offer softwar develop environ xml technolog xml facilit practic integr varieti web technolog issu acl commun address secur authent ident encrypt acl acl layer www solut certif ssl approach agent secur simpler intuit overload acl messag acl infrastructur accommod task mention oper semant pragmat aspect acl differ subtli implement todai problem practic xml ride standard facilit standard oper make happen xml incorpor link acl step address problem share ontolog acl content valu acl paramet token link point object definit ontolog slot present acl commun clear inform agent compound scarciti publish address interfac acl messag knowledg repositori www link varieti receiv paramet link network locat inform contact administr commun primit agent network protocol port receiv protocol type inform establish extend interact agent potenti interlocutor argument made messag paramet servic infrastructur approach acl specif partli fipa organ bodi author action specif kqml commun network research initi intent provid acl specif cover syntax semant carefulli avoid address pragmat acl specif level pragmat deleg charg agent manag boundari except specif introduc part acl specif divid conflict relat strive balanc semant pure acl specif practic point view recognit import fipa number protocol fipa address issu mention agent manag transport agent manag specif fipa agent messag transport specif deal deliveri messag network transport includ wireless environ agent messag transport refer model facil gener support messag transport servic agent guidelin specif messag transport http wap support encod suitabl transport xml encod http encod wap fipa agent manag specif framework fipa agent exist oper establish logic refer model recent summari specif migrat retir agent refer model describ primit ontolog support servic agent white agent control access yellow servic locat registr provid directori facilit fipa model agent belong agent platform provid basic servic consist specif sixteen fipa platform implement freeli access open support specif fipa platform distribut test collect download thousand time latest inform fipa specif reader encourag check fipa homepag knowledg queri manipul languag year agent commun languag term agent refer kind entiti refer todai kqml specif document combin natur languag syntact sugar period time kqml defin concept acl process acl larg categori agent system inevit acl concept encompass varieti issu depend point view conserv viewpoint advoc semant real issu agent develop suggest semant import concern build agent system emerg fipa acl tout attempt acl semant inher limit current acl semant effort research develop system brought foreground issu import semant agent fipa face problem kqml commun unabl put rest naiv earli concept kqml messag messag express ascii transport aim knowledg inform exchang softwar system view virtual knowledg exhibit limit long time ago revolv usabl semant order develop agent system commun protocol tool agent develop basic servic acl presum acl messag ascii string encod agent acl messag expect opaqu content languag express answer question content languag applic connect world wide question investig provid answer examin current suggest avenu persist final past semant term broader notion agent commun standard refer arpa knowledg share initi specif kqml languag arpa knowledg share extern interfac work juli austin thing word harvard barbuceanu mark fox languag describ coordin multiag system victor intern confer page san mit press jeffrei bradshaw open agent architectur support extens tenth knowledg acquisit system jeffrei stuart john open agent architectur jeffrei softwar agent bernard jonathan steven open standard open sourc system januari agent framework multiag system develop implement philip cohen hj levesqu intent choic commit artifici philip cohen hj levesqu commun action artifici agent intern confer system aaai june scott ye tim yanni yun peng model agent color petri net work note workshop implement page scott tim yanni yun ian jame tool agent develop work note workshop tool develop agent technic ian agent standard technic foundat intellig physic octob haddadi abstract task model polici work note workshop implement page adam richard jame rice ontolingua tool collabor ontolog construct novemb fipa fipa specif part agent commun languag technic fipa foundat intellig physic octob alan albert baker commun jafma work note workshop implement page michael genesereth richard fike knowledg interchang version refer manual technic comput scienc stanford june michael genesereth steven ketchpel softwar agent commun grosof labrou approach xml content languag agent commun thoma gruber translat approach portabl ontolog specif knowledg toru describ multiag coordin protocol inherit ieee intern confer tool artifici intellig page yanni labrou semant agent commun languag phd baltimor august yanni labrou tim finin semant approach gener commun languag softwar agent intern confer inform knowledg novemb yanni labrou tim finin kqml specif technic report technic report maryland baltimor yanni labrou tim finin semant agent commun languag michael huhn munindar read agent morgan reprint paper fifteenth intern joint confer artifici yanni tim yun peng agent commun current landscap ieee intellig yanni labrou timothi finin semant agent commun languag fifteenth intern joint confer artifici intellig august dougla rob kremer approach polici work note workshop implement intern confer autonom page francisco juan model implement system work note workshop implement page scott moor polici except work note workshop implement page swartout enabl technolog knowledg share ai fall nodin unruh facilit open commun agent infosleuth infrastructur michael munindar anand intellig agent volum iv workshop agent architectur volum lectur note artifici page van dyke parunak visual agent enhanc graph agent design analysi intern confer system ramesh richard peter don tim thoma robert nech darpa knowledg share progress report michael huhn munindar read agent morgan kaufmann jeremi pitt ab mamdani commun protocol system work note workshop implement page jeremi pitt ab mamdani semant agent commun languag page md sadek studi logic intent confer principl knowledg reason page ira smith philip cohen semant agent commun languag base nation confer artifici intellig august thoma brett victor ping xuan investig interact agent agent control compon work note workshop implement page terri winograd fernando flore understand comput cognit
HCI/791 4 tradit interfac interfac offer user greater express portabl ten myth multimod interact sharon oviatt novemb commun acm multimod system process combin natur input hand ey head bodi coordin manner multimedia system output system repres direct draw input output technolog anc demonstr process speech parallel manual varieti multimod system emerg rudimentari process speech combin earli system recogn speech ing locat point manual gestur gaze recent multimod system recogn broader rang signal longer limit simpl combin handl earlier system quickset system integr speech pen input includ drawn point semant unif process combin multimod inform carri input rich quickset multiag architectur run handheld pc figur illustr multimod command face face face spoken user drew arrow place correct orient map multimod system repres paradigm shift convent interfac provid user greater express portabl multimod system integr complementari modal yield highli synergist blend strength mode capit overcom weak system potenti function robustli unimod system involv singl technolog vision system process multimod input aim give user tool control sophist visual multimedia output capabl system keyboard input limit interact virtual anim balanc system power input output capabl match gener multimod system begin defin domin theme integr synchron requir combin mode strateg system comput scienc commun begin understand design integr robust multimod system develop system achiev intuit depend knowledg natur integr pattern combin input mode mean success design multimod system requir guidanc cognit scienc coordin human percept product natur modal multimod system flourish multidisciplinari teamwork individu compon technolog multimod separ myth empir realiti myth multimod interact identifi fashion discuss tive contrari empir evid current inform multimod interact summar research multimod linguist literatur natur multimod commun process uncov misconcept inform highlight multimod integr pattern tempor inform carri input process multimod differ user multimod integr reliabl gener advantag multimod system design inform design replac popular myth commun acm novemb accur foundat guid design multimod system myth build multimod user interact multimod user strong prefer interact multimod prefer pronounc spatial applic domain user prefer interact multimod free speech pen input spatial domain user prefer interact multimod issu command system multimod typic intermix unimod multimod express recent command express multimod rest spoken written predict user express command multimod depend type action perform express command multimod describ spatial inform shape object data summar figur user issu multimod command time calcul distanc object map requir spatial locat moder interact multimod select object larger delet object map perform gener action spatial print user rare express time user interact natur commun pattern involv mix unimod multimod multimod predict base type action perform empir result futur multimod system distinguish instanc user commun accur made parallel input stream interpret jointli versu individu data suggest knowledg type action includ applic influenc basic build multimod system myth speech point domin multimod integr pattern develop view novemb commun acm prototyp form multimod integr origin semant process base spoken mean deictic term resolv process coordin point object multimod system attempt resolv deictic express track direct human gaze concept multimod interact make limit input figur quickset multimod system handheld pc mode select repres persist metaphor mode transmit written manual facial express capabl gener symbol inform richli express simpl object select studi integr input pattern spontan multimod utter pen input creat symbol gestur digit lexic content interperson multimod linguist analysi spontan manual gestur confirm deictic gestur account gestur data highlight fact multimod system design process fail provid user function special algorithm process relat limit practic design futur multimod system myth multimod input involv simultan signal common assumpt signal involv multimod construct figur percentag command user express multimod function type task figur tk high level spatial locat command moder level select command neglig level gener action command percentag construct gener action command select command spatial locat command overlai locat print scroll control constraint task tempor tempor overlap determin signal combin system process success process deictic term reli interpret point word spoken order extract intend refer empir studi user speak deictic term deictic frequent overlap time point estim command spoken deictic overlap point disambigu mean issu spoken input frequent overlap multimod command comput illustr figur sequenti integr half pen input speech lag input signal find consist linguist data reveal spontan gestur sign languag spoken lexic analogu human commun gestur speech greater languag english speech gestur highli interdepend synchron multimod synchroni impli simultan empir evid reveal multimod zoom label delet queri calcul distanc modifi move add figur tk figur sequenti integr multimod pen input speech lag signal sec sec road sec nal tempor natur human commun count conveni overlap signal order achiev success process multimod architectur build myth speech primari input mode multimod system includ linguist alik view speech primari input head bodi direct input secondari speech view mode redund accompani carri inform perspect earli multimod system process speech primit integr commun acm novemb flexibl multimod interfac accommod wide rang environ singl mode suffic secondari mode simpl select secondari mode view primari speech signal degrad noisi case suppli inform confid speech recognit low view fail acknowledg mode tabl percentag multimod command user involv simultan sequenti integr spoken written signal user sim seq sim seq convei inform present speech signal spatial inform pen input manner action inform gestur multimod system ignor sourc inform systemat fail recogn type spontan multimod construct speech primari term input signal multimod construct pen input speech multimod major earlier product input believ provid assist user plan speech speech carrier import tempor input mode belief speech primari risk valuabl role plai mode novemb commun acm ation multimod architectur myth multimod languag differ linguist unimod languag frequent assum languag multimod languag differ basic form unimod type recent demonstr multimod languag syntact unimod speech user ad boat dock interact map system boat dock west end reward interact multimod input user complet action free interact user select elimin linguist complex illustr prefer speak spatial locat descript west end reward compact accur altern pen input linguist indirect fewer reduc anaphor track resolut natur languag process multimod languag simpli spoken textual languag command languag depart word order typic english differ import implic success natur languag process multimod languag tradit unimod form natur respect substanti simplifi implic multimod languag easier support robust system futur myth multimod integr involv redund content mode claim proposit content convei mode multimod commun high redund domin theme natur organ multimod input complementar figur speech pen input consist contribut complementari semant object sentenc typic loc inform written multimod correct system user highli motiv clarifi reinforc inform speech pen input rare express redund time human linguist document spontan speech gestur involv duplic inform actual data highlight import complementar major organiz theme multimod commun design multimod system expect reli duplic inform process multimod languag myth individu recognit technolog combin multimod produc greater common misconcept multimod system incorpor recognit speech handwrit result compound error greater perform multimod system support robust problem typic recognit technolog manag robust due leverag natur intellig deploi input mode effect flexibl multimod peopl avoid input mode content languag discuss minim error recognit error user altern input mode resolv effect error resolut occur matric differ lexic content technolog involv mode altern robust multimod system depend design architectur integr mode synergist optim multimod mutual disambigu input signal user speech recogn confirm singular parallel recognit graphic mark result recoveri correct plural interpret recoveri occur multimod architectur speech recogn initi rank plural interpret prefer choic list figur illustr mutual ambigu quickset log user drew arrow speech gestur correct interpret recov successfulli final multimod list recoveri achiev inappropri signal piec discard unif constraint legal multimod command due mutual parallel recognit semant interpret occur multimod architectur yield higher likelihood correct interpret recognit base figur quickset semant unif process capit complementar inform suppli exert linguist tempor constraint satisfi accept semant blend singl input mode improv direct result disambigu signal occur multimod exhibit greater perform stabil robust result superior characterist multimod system repres major perform advantag increasingli media recognit multimod architectur order har stabil effect myth multimod command integr uniform user interact larg individu differ integr pattern recent user adopt simultan sequenti integr pattern combin speech pen input tabl show user spoke wrote signal overlap user combin signal sequenti domin integr pattern commun acm novemb figur mutual disambigu fourth choic speech list choic gestur list pull unif produc correct multimod interpret began interact persist session integr pattern establish earli remain distinct integr pattern observ user find impli multimod system detect adapt domin integr pattern lead improv recognit rate myth input mode capabl transmit compar content altern extrem view speech concept emerg recent myth input mode fulli transmit compar proposit content simpl translat basic interchang assert myth design ideal inform tailor input output modal suit cognit limit inform commun modal coordin novemb commun acm tic manner creat ultim multimod translat devic inform kiosk admir fail acknowledg mode repres emerg technolog recogn manual head gaze strikingli uniqu differ type inform function integr basic suitabl incorpor interfac style mode simpl analogu requir support simpl translat mode basic vari capabl transmit similar mode compar speech write convei similar differ rang express speak complex spatial relat graphic locat inform trivial sketch pen speech deliv inform listen direct intent modal gaze reflect focu interest passiv convei inform period blank stare extrem differ input mode make suitabl candid qualit interfac style speech input function command gaze compat part interfac concept myth enhanc effici main advantag multimod system assum enhanc speed effici enabl parallel input primari perform advantag multimod compar unimod graphic interfac multimod interact spatial document interfac effici advantag limit spatial demonstr task content verbal quantit natur advantag multimod system noteworthi import modest speed enhanc error languag drop multimod interact strong prefer interact multimod constitut consequenti advantag advantag flexibl multimod system permit user select altern input mode flexibl make user altern mode physic avoid individu modal permit substanti error avoid easier error discuss flexibl multimod interfac accommod wide rang user temporarili perman usag set case singl mode suffic integr multimod system potenti support capabl support previou tradit system abil develop futur multimod system depend knowledg natur integr pattern combin input mode complex natur multimod cognit scienc plai essenti role guid design robust multimod system multidisciplinari perspect central success system design tradit domain tackl comput scienc design multimod system blend input mode synergist depend intim knowledg properti mode inform content characterist uniqu multimod languag multimod input integr synchron reli predict user interact alik user integr pattern optim robust multimod architectur depend clear understand advantag type compar unimod specif design challeng includ develop multimod architectur handl natur parallel interdepend input optim error avoid robust ten myth multimod interact identifi discuss viewpoint contrari empir evid separ myth goal reveal natur multimod interact turn foundat guid design futur multimod system refer ra put voic gestur graphic interfac acm comput graphic al anim gener facial gestur spoken inton multipl agent comput annual confer acm al multimod interact distribut applic acm intern multimedia confer acm aspect process utter ed relationship verbal nonverb commun cj kr integr simultan input hand gestur intellig multimedia interfac ed mit menlo hand gestur reveal thought chicago spontan gestur studi asl sign speech workshop integr gestur languag speech newark jg sc intellig interfac technolog intellig user interfac jw sullivan sw ed sl mutual disambigu recognit error multimod architectur confer human factor comput system acm sl multimod interact design human perform interact sl referenti featur linguist indirect multimod languag intern confer spoken languag process integr synchron input mode multimod interact confer human factor comput system acm sharon oviatt professor depart comput scienc engin oregon graduat institut scienc technolog center commun research support grant nation scienc grant equip donat ntt bell permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee acm commun acm novemb
DB/792 3 maintain tempor view inform sourc data wareh jun yang jennif widom comput scienc depart stanford abstract import data wareh provid tempor view histori sourc data recent work view mainten applic data view consid introduc framework maintain tempor view inform sourc data wareh environ describ architectur tempor data automat maintain tempor view sourc user tempor queri view dimens materi tempor view updat sourc relat time advanc present increment techniqu maintain tempor view case introduct data repositori effici queri analysi integr inform wide varieti sourc effect maintain materi view base relat sourc client interest histori sourc data evolv import support tempor queri underli inform sourc current state data interest techniqu materi relev tempor view histori sourc data applic benefit tempor data store daili bank account balanc provid audit log analyst compani tempor track period market incom personnel histori relev corpor partnership work support rome laboratori air forc contract advanc research develop commun manag staff project program user queri extractor extractor sourc sourc nt nt sourc relat tempor view tempor base relat fig simpl tempor data architectur research work date tempor view mainten wareh context applic requir tempor commerci system store time inform normal attribut standard relat queri sql point tempor write tempor queri absenc tempor data model extrem cumbersom user easili express queri interpret view maintain automat time treat normal difficult system exploit semant time view input administr requir overcom introduc framework maintain tempor view inform sourc present algorithm increment maintain tempor view time advanc sourc relat undergo tempor view definit languag subset includ class commonli aggreg term aggreg fig depict simpl tempor data architectur data sourc number sourc relat monitor export extractor sourc relat extractor notifi content updat sourc relat nt maintain tempor relat encod complet histori nt base relat construct definit materi tempor view user formul queri tempor view export import note tempor base relat serv primarili conceptu base relat defin necessarili materi full version paper detail formal present subject complet set theorem discuss implement work relat work view mainten problem studi survei work date consid view tempor view mainten introduc problem present nontempor number techniqu develop maintain view applic adopt algebra approach propag sourc appli method maintain aggreg view numer tempor data model queri languag survei chosen underli data model basi work concept essenti snapshot reduc discuss order avoid potenti snapshot construct number paper relat tempor view mainten refer address view mainten problem chronicl data model tupl timestamp singl time instant algebra weaker effici algorithm refer present techniqu increment maintain view defin oper arbitrari snapshot base tempor view complet histori order access complet queri explicitli differenti oper introduc close relat chang propag oper refer consid mainten relat queri select predic refer symbol current time express tempor queri languag handl store data refer explor relat problem monitor tempor integr constraint languag logic gener express problem detect constraint violat strict subset problem maintain view refer develop framework expir vacuum histor data restrict class tempor view preliminari data model view definit languag tempor data model essenti conceptu data model restrict transact time time domain ft set time instant total order relat tempor relat schema form explicit attribut implicit timestamp attribut valu explicit attribut regular timestamp attribut set element time instant special symbol explicit attribut form id dept offic phone research ami research ami develop ben develop coi fig content tempor relat current time tupl tempor symbol iff tupl ha ci interpret tupl ha present snapshot time iff snapshot pure relat duplic mean continu conceptu updat includ time instant time advanc updat implement store start end time set period encod end time store symbol extend time advanc assum implement discuss detail discuss tempor refer fig show tempor relat store directori inform encod set period view construct conceptu tempor base relat fig tempor algebra oper simplifi initi introduc aggreg oper separ section tempor tupl respect ar ar denot set explicit attribut schema denot part valu attribut set facilit defin def ft return union timestamp tupl attribut oper def ci ar def ci ar ar def ci oe def fr rn def ci rn intersect defin def select join predic refer explicit standard comparison arithmet referenc timestamp attribut time constant function predic smallest element largest element expect interpret exact predic languag affect assum predic close conjunct complement treatment deserv explan queri predic evalu implicit bind current time constant comput result store input tupl simpli replac treat distinct result timestamp approach approach occurr queri input relat replac queri evalu result problem gener queri result inform result tupl potenti time advanc pose problem view mainten slightli treatment classif tempor oper section tempor relat oper reduc counterpart reason tempor relat reduc problem simpler deal enabl intuit reason formal proof exploit properti preserv techniqu develop view mainten tempor oper refer time easi find reduct complic preserv desir properti lead classif oper oper formal notion snapshot defin oper tempor relat def return relat tupl snapshot time rn relat tempor current time tempor oper op respect counterpart op nt rn nt op nt nt standard relat equal correspond snapshot reduc shown tempor relat express defin oper counterpart relat algebra properti equal oper explicit refer time oe refer denot argument join oper oper tempor select join make explicit refer time predic find counterpart requir map treat normal attribut relat defin oper def rg tempor return relat schema attribut convert explicit encod adher concret repres bit vector length jtj time instant iff bit vector iff jtj scheme serv practic demonstr exist order develop mainten express present tempor predic convert predic timestamp constant function predic timestamp counterpart base encod notat omit biject intend interpret clear context oper oe select predic refer respect select oper oe nt nt oe nt oper join predic refer respect nt ffi nt rn nt nt nt denot relat nt store directori inform compani relat nt record current project assign tempor data conceptu tempor base encod histori nt nt previou fig depict state interest view project assign histori join develop depart past year longer emploi depart def multipl tupl valu id valu offic offic phone number ami fig ben tupl satisfi join project assign histori id dept offic phone research ami research ami develop ben develop coi fig content tempor relat ben return compani assign insert nt tupl record ben project assign insert nt coi leav compani delet nt tupl delet nt tupl shown fig content understand affect ben return timestamp tempor ben tupl longer satisfi project assign histori remov coi departur make coi tupl satisfi join project assign histori ad import observ reduc tempor join preserv monoton counterpart base relat view monoton fail oper act modif attribut pure illustr ben tupl delet result illustr coi tupl tempor view chang sourc due dimens time tupl timestamp extend time time interpret predic refer time nt nt stai evalu month notic longer project assign histori predic longer satisfi bind nontempor analog appli techniqu view mainten case maintain tempor view shown section tempor view maintain sourc relat updat call chang tempor current time advanc call view adopt approach chang sourc immedi propag affect view adopt approach view refresh view respect advanc time requir comput view requir comput affect sourc referenc user queri note lazi approach refresh view essenti perform unaccept refresh materi view time clock tick complet algorithm tempor view mainten outlin extractor fig report sourc updat affect conceptu tempor base relat step convert sourc updat updat form delta style step discuss section step refresh view definit refer current respect step discuss section step propag affect view step discuss section user present queri time step refresh view referenc user queri current respect step step comput queri refresh view maintain conceptu tempor base relat sourc relat nt conceptu maintain tempor relat encod histori nt extractor report sourc updat nt nt nt nt nt nt time find continu faithfulli encod histori nt turn obtain desir delta simpli timestamp nt nt ft nt ft nt nt nt ft nt nt effect termin timestamp tupl nt effect creat end timestamp tupl nt extend automat note requir materi point sole procedur gener initi chang propag discuss section option exact point base relat delta depend capabl sourc wareh full version paper discuss propag updat tempor base relat propag effect view definit refer achiev repeatedli appli set chang propag equat factor base relat delta express defin view chang propag equat tempor oper op express possibl rn empti reduct preserv relat chang propag equat oper deriv directli equal relat equat ident form oper tempor refer oe oe oe oe oe oe delta behav modif delet motiv section simpli chang propag equat reduc oper provid transform arbitrari delta pure delta behav modif reduct equal defin tempor semijoin oper rn def fr rn arbitrari delta nt nt nt nt semijoin definit obtain complet tupl affect delta result appli delta tupl notion pure delta captur condit condit ensur remov tupl shrink timestamp condit tupl exist tupl set explicit possibl expand exist tupl timestamp chang propag equat oper present equat ident import requir pure delta appli chang propag appli transform discuss pure delta requir satisfi refer oe oe oe oe oe oe develop chang propag equat oper requir pure delta significantli complic express chang propag equat shown delta gener side pure propag effici simpl chang propag equat requir pure delta met concret def defin section denot join predic denot select predic dept show deriv mainten express nt delet nt case nt obtain tempor delta nt ft nt nt discuss section oe oe oe transform pure continu appli chang propag content sourc repres increment refresh view describ procedur refresh view respect addit tempor relat denot result evalu tempor state time omit bracket notat denot result refresh respect defin special oper def ci tempor relat ft add miss time instant tupl timestamp oper introduc primarili discuss discuss realiti timestamp attribut implement set time period end requir updat time advanc ident oper practic procedur refresh view work defin tempor view refresh time deriv express refresh simpli comput appli materi deriv induct structur base case base relat induct hypothesi op op repeatedli appli chang propag equat op section factor combin op appli view refresh equat arriv oper make explicit refer expect easi refresh view definit oper shown view refresh equat refresh view involv appli materi delta gener op en refresh view definit oper requir updat materi truth tempor predic chang time advanc refer denot predic tempor semijoin oper defin section oe oe oe en pq en pq en obtain tupl satisfi result materi delet tupl satisfi insert tupl satisfi semijoin retain individu tupl timestamp order reevalu join predic lose track individu tempor join store result intersect timestamp join tupl updat gener complic make analysi determin term empti instanc updat comput appli delet oe gener assum implement timestamp encod set period elimin denot predic evalu time implicit bind delet rewritten oe easi verifi delet rewritten problem determin term empti reduc test predic unsatisfi restrict encod start time ts end time te assumpt hold transact time tempor includ function predic rewritten ordinari boolean express involv exist algorithm test satisfi illustr demonstr deriv express refresh tempor view time advanc view def section oper omit assum implement timestamp encod set period order test updat gener rewritten notat predic shown easili join predic unsatisfi unsatisfi simplifi tupl automat time advanc delet comput individu timestamp join tupl materi semijoin result simpli record individu timestamp join access complet sourc histori maintain tempor aggreg briefli outlin approach maintain class commonli tempor aggreg view call aggreg complet discuss full version paper denot aggreg aggreg window formal defin extend addit paramet window def return relat tupl valid point period defin tempor relat properti nt nt standard group aggreg oper result tempor aggreg sequenc valu gener move window length time comput aggreg tupl valid current window detail discuss tempor aggreg refer aggreg term instantan time comput tupl valid time nt nt simpli chang propag equat develop aggreg view refresh gener case term cumul time depend tupl valid valid approach requir pure delta section aggreg recomput valid period affect tupl ineffici period delta aggreg result affect approach base kei observ def ci ft assum timestamp implement set extend end time period timestamp merg adjac period overlap problem propag reduc propag appli chang propag equat obtain term view maintain remain term increment propag similar turn problem refresh cumul aggreg view respect current time unlik instantan cumul aggreg time stai time updat tupl valid materi aggreg termin timestamp comput valu aggreg period content append result view refresh fr return fragment period shorthand true tempor relat singl tupl timestamp fdg fr oe fr futur work provid tempor view sourc data featur data present systemat approach maintain tempor view framework data set tempor view mainten problem process implement algorithm studi perform wareh prototyp full version paper discuss investig problem tempor view enhanc framework propag sourc updat refresh view flexibl complic yield perform multipl updat combin batch process effici refer mark increment comput queri express ieee tran knowledg data larson updat deriv detect irrelev autonom comput updat acm tran snodgrass evalu complet proc intl workshop tempor page chomicki toman implement tempor integr constraint activ dbm ieee tran knowledg data snodgrass semant acm tran griffin libkin increment mainten view duplic proc acm sigmod intl conf manag page gupta mumick mainten materi applic ieee data silberschatz view mainten issu chronicl data model proc acm symp principl page jensen mark differenti queri process tempor chapter page snodgrass unifi tempor model conceptu model inform labio expir data technic comput scienc stanford navath ahm tempor relat model queri languag inform ozsoyoglu snodgrass tempor survei ieee tran knowledg data integr constraint rule mainten tempor deduct knowledg base proc intl conf larg data page qian wiederhold increment recomput activ relat express ieee tran knowledg data quass mainten express view aggreg proc acm workshop materi techniqu page widom make view data wareh proc intl conf parallel distribut inform snodgrass tempor queri languag tquel acm tran aggreg tempor queri languag tquel ieee tran knowledg data widom research problem data wareh proc intl conf inform knowledg page widom system prototyp view mainten proc acm workshop materi techniqu page yang widom maintain tempor view inform sourc data wareh technic comput scienc stanford
Agents/793 1 system manag concurr engin intellig softwar agent depart industri engin august abstract intellig softwar agent framework larg number expert interact project concurr project aerospac industri describ framework discuss intellig softwar agent manag system design environ make problem interest exist intellig agent framework task human user system design manag agent domain knowledg interact agent recommend strategi polici task system design risk discuss perform detail introduct intellig softwar agent concurr engin paradigm receiv attent research group idea respond inform coordin demand concurr engin practic larg project intellig softwar agent technolog candid significantli improv environ larg scale engin effort undertaken aerospac industri larg possibl geograph distribut strong task manag easi inform distribut requir minim time develop design paper summar effort part rapid design explor optim program sponsor darpa briefli give motiv intellig softwar agent architectur section section describ intellig agent call system design manag agent detail section describ risk manag coordin agent system present research area section intellig agent concurr engin intellig agent emploi concurr engin design project vision creat highli flexibl design environ evalu order magnitud design altern todai concurr engin practic broaden scope design constraint includ manufactur respect design optim approach significantli improv qualiti design reduc number time adjust abil automat evalu design respect requir document contribut addit improv qualiti reduct rework distribut concurr engin environ address provid task coordin easi access inform integr number multidisciplinari tool design optim abil automat evalu design respect textual requir approach adopt center task environ simul paradigm agent belief perform task base belief time measur perform task task sophist task structur involv relat task result share dynam handl framework static relat defin agent commun gather execut method applic framework sophist engin design manufactur environ trainer basic type agent emploi user coordin assist agent act interfac human user execut agent special agent emploi wrapper special engin softwar structur special agent system design manag agent abil manag ongo system design process main focu paper gallagh decker detail discuss framework basic system design manag agent system design manag agent stem work design lin sen basic object monitor manag dimens system design program concurr engin practic requir system develop abandon model system design favor test prototyp occur level system design methodolog acknowledg iter natur engin design fox develop enforc requir system design gener manag achiev object knowledg network rich knowledg scheme paramet ontolog approach suit intellig softwar agent commit semant syntax technolog summar depict figur activ constraint resourc statu polici notif event manag planner dispatch schedul plan negoti monitor dispatch coordin figur system design manag technolog symptom pattern knowledg network agent belief store trigger event messag commun messag version rule type messag action simpl notifi interest parti import inform concurr engin environ complex chang belief store agent agent perform task discuss technolog risk manag risk manag section describ specif facet system engin manag larg engin project conceptu present section equal appli facet system engin schedul intuit understand notion risk looser project broadli categor ffl event delai ffl event cost ffl event defici technolog perform gener risk unexpect event constraint violat thing notic definit risk causal natur identifi risk amount identifi variabl causal relationship level gener abstract import clue type ontolog commit make deal risk risk manag stage project involv servic engin build artifact risk risk risk handl risk assess primari stage risk manag built stage notion risk vulner stage contamin debat probabl subject object debat vital risk manag concept risk manag chang drastic depend adopt approach spread bayesian statist learn reconcil notion probabl stick risk analysi tool appli structur risk inform approach risk analysi william detail survei risk manag larg project analysi tool heavili quantit stem object percept probabl qualit tool report literatur risk handl scheme perform risk analysi continu basi project concept tune manag base identif control area event system engin life cycl potenti unwant chang process product matrix manag method method literatur risk handl strategi avoid potenti failur consequ probabl plan continu condit develop option fall back posit permit altern lower risk solut acknowledg exist risk accept consequ failur occur transfer risk organ object technolog manag risk larg engin project requir interact human softwar agent dynam control risk requir develop technolog rich knowledg project organ type risk stage design contractu stage risk stem differ interpret requir custom manufactur conceptu design stage risk due ffl wrong conceptu due ffl delai approv submit ffl delai due lack coordin risk manag technolog repres reason knowledg type risk technolog flexibl enabl user defin risk handl strategi meet requir pose risk manag ffl toronto virtual ontolog fox rich knowledg organ ffl bayesian network main risk analysi tool natur bayesian network captur causal relat risk variabl ffl system captur risk handl strategi figur summar concept network rule risk ontolog activ constraint paramet requir part figur conceptu risk manag technolog advantag rich knowledg ontolog commit minim ambigu understood ontolog approach adopt research challeng case extend current ontolog produc specif highli reusabl ontolog problem hand risk structur bayesian network bring main advantag variabl identifi tempor causal relationship explicitli account result econom joint probabl turn yield effici infer algorithm framework bayesian network valuabl effici infer infer bayesian network problem exact approxim approach infer exact infer algorithm exponenti number variabl expect number variabl larg repres risk interest qualit infer quantit henrion quantit qualit analysi bayesian network question quantit inform probabl valu risk manag tool resort qualit inform qualit infer figur show intern structur typic agent goal plan librari select plan task structur execut commun rest world standard agent commun languag plan local control task structur figur intern structur agent figur show interact agent framework framework consist user agent human user system agent act gatekeep framework extern agent agent framework share knowledg process blackboard execut agent activ legaci product system extern framework interact framework agent build system design process request task structur agent snapshot instanc design process dynam chang design evolv build bayesian network snapshot system term risk human stage elimin margin import task start inquir condit probabl node extract transact log framework network suffici quantifi activ wait transact transact task event qualit quantit infer drawn bayesian network activ rule transfer system action basi fire rule commun framework form strategi polici notif activ infer work period review mode implement commun agent ontolog activ constraint paramet requir part rule network risk user user agent agent execut agent system stress agent design agent organ ontolog project ontolog process ontolog strategi polici recommend notif plan local control task structur plan local control task structur plan local control task structur plan local control task structur plan local control task structur plan local control task structur plan local control task structur figur agent fike shapiro beck describ intellig agent technolog concurr engin framework concurr engin brought challeng inform requir support make process larg organ gener system design manag agent explain risk manag project awar ontolog bayesian network main risk handl tool handl risk manag system rule user flexibl manag tool main technolog artifici intellig extens risk manag conceptu enabl agent detect pattern risk manag possibl abstract notion risk inform avoid similar risk situat approach encod risk handl method earlier due poor risk structur result impress claim top ontolog bayesian network architectur encod risk handl method success refer integr design environ submit asm design manufactur symposium technic report describ system submit public retriev engin design context gero artifici intellig design kluwer academ pp ai design june stanford comput complex probabilist reason bayesian belief artifici intellig center analysi design coordin phd depart comput amherst effici reason qualit probabilist nation confer artifici intellig pp user manual version intern comput limit munich germani specif kqml agent commun languag darpa knowledg initi extern interfac work group common model petri mit ma ontolog confer cooper inform ontario model system ai system engin aaai washington knowledg interchang version refer technic report comput scienc stanford introduct bayesian ucl london risk manag wilei seri engin technolog john wilei son integr product team submit asm design engin comput engin inform manag symposium probabilist reason intellig network plausibl system john wilei york formul tradeoff plan pitman morgan kaufmann classifi bibliographi recent research relat project risk european journal oper research
ML/794 6 activ markov local mobil robot dieter wolfram burgard dept comput scienc germani sebastian thrun dept comput carnegi mellon pa abstract local problem determin posit mobil robot sensor data exist local approach exploit opportun control robot effector local paper activ local approach approach base markov local ration criteria set robot motion direct determin point direct sensor effici local robot deal noisi sensor approxim world model appropri approach demonstr empir mobil robot structur offic environ kei robot posit autonom servic robot introduct navig reliabl indoor mobil robot tremend scientif interest algorithm estim robot locat sensor data recent book issu illustr import local problem uniqu descript major exist approach local passiv passiv local address estim locat base incom stream sensor data rest assumpt robot point direct robot sensor control activ local assum local routin partial full control provid opportun effici robust local kei open issu activ local local robot paper demonstr activ local research direct develop effici robust local method artifici intellig heurist search machin activ control learn problem solv long recogn preprint submit elsevi preprint march theoret analysi practic complex achiev task greatli reduc activ interact environ action explor reduc exponenti complex polynomi shown koenig thrun work explor heurist search learn control activ vision led result superior passiv approach comput vision context mobil robot activ control robot benefici environ possess featur enabl robot unambigu determin locat case offic environ corridor offic alik mobil random motion wall incap determin robot ineffici paper demonstr activ control robot actuat significantli improv effici local framework base markov passiv probabilist approach local recent develop variant point markov local maintain probabl densiti entir configur space provid answer control robot actuat guid principl approach control actuat minim futur expect uncertainti uncertainti measur entropi futur belief distribut action minim expect futur approach capabl activ local robot approach empir valid context local activ address question move activ address problem sensor point implement assum robot metric map notic difficult local exist approach concentr situat initi robot locat capabl local robot scratch approach empir test mobil robot equip circular arrai ultrasound sensor kei result effici local improv drastic activ control robot motion direct activ control sensor relat work research concentr passiv local activ local receiv attent mobil robot commun primarili major literatur concern robot control plan assum posit robot research local estim problem recent navig uncertainti address research develop markov navig paradigm approach aim activ local robot local occur side effect oper robot uncertainti argu kaelbl exist condit approach report exhibit cyclic behavior due uncertainti local forefront local driven procedur check locat visit learn map problem activ local treat theoret find direct assumpt perfect sensor act environ model partial observ markov process approach deriv optim strategi move target locat posit robot perfectli method extend action robot improv posit estim minim expect entropi robot control action approach greedi prevent find effici solut realist environ disambigu robot posit requir robot move remot greedi entropi minim fail make robot move work develop robot explor techniqu effici map unknown environ method give result appli primari goal local situat fail markov local gener equat section briefli outlin basic markov local algorithm approach base detail kei idea markov local comput probabl distribut locat environ denot robot belief posit time locat space cartesian coordin ff robot orient reflect initi state robot start center correct robot initi uniformli distribut reflect global uncertainti case experi belief bel updat robot move robot motion model condit denot denot probabl motion action execut carri robot updat belief robot denot result belief time obtain model robot kinemat robot denot sensor likelihood perceiv refer map specifi probabl observ locat environ belief updat normal ensur belief bel sum descript markov navig import reader grasp essenti robot maintain belief distribut updat robot arriv sensor data probabilist mobil robot local due abil handl ambigu repres section introduc implement markov local posit probabl grid implement markov local reli updat cycl present previou exist implement distinguish discret state space world model reli topolog belief locat correspond node topolog map environ due natur abstract featur extract proxim sensor percept detect hallwai offic contrast implement base geometr variant markov spatial resolut cm angular resolut obtain likelihood directli metric model environ model proxim sensor advantag approach oper base raw data proxim sensor permit exploit arbitrari geometr featur environ width corridor size easili extend incorpor abstract featur landmark disadvantag method li huge state space maintain environ size angular resolut ffi state space consist state deal state space modifi basic approach reduc comput complex effici implement base reduc complex order sensor model proxim sensor base map store larg tabl approach locat sensor angl ff distanc nearest obstacl expect measur world probabl type comput mixtur geometr densiti function function specif distanc depict figur probabl measur distanc expect distanc ultrasound laser fig sensor model ultrasound sensor finder note higher accuraci finder versu ultrasound sensor repres smaller standard deviat gaussian distribut sensor comput amount fast seri tabl select comput time probabl mass center small number locat except initi global local vast major probabl close safe observ basi select comput enhanc comput speed algorithm implement consid locat threshold time requir process sensor scan intel processor activ markov local posit probabl grid shown robustli estim posit robot unstructur popul environ markov local passiv section deriv criteria control actuat robot local robot gener equat optim action trade util cost individu action util action elimin uncertainti posit estim robot action distinguish locat entropi obtain formula log measur uncertainti robot center singl entropi robot complet uncertain uniformli distribut current implement set priori posit probabl denot expect entropi perform action time fire sensor measur util perform action averag obtain eq probabl perceiv execut action log log denot belief posit perform perceiv express obtain definit entropi eq appli markov updat equat final eq comput expect entropi action serv normal ensur sum cost action find action trade util action cost execut action cost strongli depend action rang time perform action amount energi action section action select util cost robot point time action maxim argmax fi fi determin rel import certainti versu cost choic fi depend applic fi set section present applic gener scheme activ navig robot activ optim direct activ navig activ navig address problem determin move posit robot simpl motor control action meter basic action activ navig motor command insuffici figur show typic situat occur global local depart robot corridor figur belief state meter random motion corridor posit local maxima stem symmetri corridor situat robot move offic order uniqu determin posit chosen arbitrari target point atom action activ navig target point rel current robot absolut coordin action local maxima fig outlin depart posit probabl make robot move locat meter meter left action repres rel robot absolut posit target strongli depend actual belief posit estim figur show situat belief concentr posit mark big circl action carri robot locat mark locat mark move fig absolut posit target point coordin express coordin target locat action assum robot denot forward compon movement action compon target point action execut locat eq ff sin ff sin ff ff ff ff ff remaind section specifi comput util cost navig action util navig action order determin util move rel target locat eq entropi expect execut navig action comput appli coordin transform eq equat eq log cost navig action estim action estim expect cost path current locat robot target locat approach rest assumpt map environ specifi point occupi implement world model occup grid map occup occ denot probabl locat block obstacl robot comput probabl target point occupi recal robot exact estim probabl target point occupi probabl denot occ geometr permit occ occ robot occ occ coordin transform introduc eq eq point coordin consid occup point occ expect occup obtain averag locat weight robot subject belief result expect occup point rel robot cost base occ expect path length polici obtain popular version dynam program iter assign locat repres distanc robot set locat robot locat function updat occ min minim neighbor locat reach atom motor command eq assum cost point proport probabl occupi occ iter appli equat lead cost function reach point rel hill climb path robot current posit locat complet descript activ navig local action repres arbitrari target point rel robot current posit action select maxim weight sum expect uncertainti cost move cost consid vari drastic target point activ activ attack problem point robot sensor local robot activ navig realiz point sensor direct maxim expect util util action ff denot action point sensor direct ff rel robot orient expect entropi action eq eq ff ff ff log ff ff ff perceiv direct ff note replac ff eq point sensor specif direct chang locat robot work assum cost point sensor depend point direct neglect cost activ select point direct depend sole util result section test influenc activ extens markov local perform posit estim effici implement activ navig method implement test posit probabl grid introduc section implement activ navig discret action small resolut appli posit probabl grid complex comput util singl action jlj number locat jsj number eq result complex comput action eq order make comput util tractabl approxim set lm gaussian densiti mean equat present section appli mean simplif justifi observ quickli center small number approxim center gaussian comput scan belief state local maxima probabl exce threshold modif reduc size jlj order magnitud convinc set local maxima repres import aspect belief state suffici rich level fast sensor model introduc section action select perform reason time activ navig activ concentr belief state techniqu introduc appli fig environ path robot belief occup probabl occ po fig expect cost util payoff po activ navig activ navig test place robot corridor depart plot figur notic corridor environ basic symmetr possess place make difficult robot determin robot move find distinguish featur due furnitur offic state door influenc posit estim determin expect cost move target point robot uniqu local move room total random wander wall consist fail local robot wander routin unabl move robot narrow symmetri corridor made imposs uniqu determin robot locat experi activ navig approach present robot manag local short amount time figur show repres path activ explor run start robot posit corridor face task robot determin posit environ move room local order deal comput complex activ local section robot start random motion belief concentr local maxima ten meter random robot reach posit figur depict belief point time posit posit orient local maxima consid comput util cost action mark circl expect occup probabl occ obtain eq depict figur high probabl shown dark color note figur roughli correspond weight overlai map rel local weight probabl maxima figur origin coordin system point repres current posit robot action robot face figur displai expect cost reach target point cost comput iter base eq figur show util target eq expect uncertainti locat room make favor local util end reduc uncertainti base depict figur robot decid pick target end corridor point import notic exact trajectori current posit target point comput due unavoid inaccuraci world model unforeseen obstacl popul environ offic difficulti posit robot case local overcom problem robot control reactiv avoid techniqu implement global plan modul dynam program section gener cost minim path target locat intermedi target point path present reactiv avoid techniqu avoid gener motion command safe guid robot target overview architectur navig system reach end corridor figur belief state local maxima figur occup probabl result cost action belief depict figur note due state cost reach room remark lower reach room ambigu belief displai figur longer resolv leav corridor util shown figur low target point corridor compar util action guid robot room state door result payoff displai figur maxim target point room shown figur robot decid move room case turn room robot resolv ambigu room base furnitur room uniqu determin locat robot move straight target locat room figur show belief state point note ultrasound sensor experi activ experi demonstr effici local fig belief po occup probabl occ expect cost fig util payoff po final belief prove optim point direct robot sensor experi conduct sensor finder order demonstr abil techniqu select kind sensor situat camera mount pan head zoom differ ultrasound sensor finder li accuraci ultrasound sensor angular resolut ffi finder angular resolut ffi addit finder measur obstacl accur ultrasound sensor note approach differ repres sole model specif probabl measur distanc obstacl distanc figur show setup robot corridor depart move constant veloc corridor door symmetr order robot uniqu determin locat instal singl box side corridor obstacl detect robot ultrasound sensor uniqu determin robot ultrasound sensor point box path robot detect sonar fig setup simul activ robot read singl sensor point time passiv chose sensor random passiv method compar activ sensor eq evalu differ approach comput error local measur weight time activ random time activ random time activ random fig estim error experi robot ultrasound sensor result depict figur figur plot local error function averag confid interv error significantli faster sensor select activ result demonstr benefit activ figur depict result finder case activ superior point direct randomli method correctli determin posit due inabl finder detect featur break symmetri corridor kind experi observ local maxima posit probabl repres true locat robot repres posit mirror ffi final experi robot ultrasound sensor finder result depict figur activ significantli improv effici local process addit activ perform sensor restrict kind sensor figur order estim certainti approach true locat class experi sum probabl assign posit close true locat robot probabl depict figur activ true locat random strategi hand uniqu determin posit robot scope experi time activ random fig probabl assign correct posit shed light question activ local perform significantli passiv method analyz sensor read activ approach consid local point depict figur gener store sensor measur consid local plot end point rel true posit robot time fig end point ultrasound laser activ select note point figur figur stem experi robot sensor advantag method accur ultrasound sensor scan box symmetr posit left cloud point figur order break symmetri corridor case laser sensor prefer due higher accuraci explain activ sensor significantli activ kind select kind sensor approach combin accuraci finder abil ultrasound sensor disambigu posit estim paper advoc activ approach mobil robot local activ robot control effector effici local action gener maxim expect measur entropi basic principl appli activ local activ activ case activ expect cost incorpor action select approach verifi empir mobil robot kei result comparison effici local action select minim entropi case activ navig activ activ compon enabl robot local passiv counterpart fail rel advantag activ local larg environ possess featur enabl robot unambigu determin locat encourag limit deserv futur research kei limit algorithm complex entropi predict eq algorithm trick made comput entropi feasibl complex bound research scale approach environ significantli larger limit greedi action select problem optim explor np exist situat greedi solut fail experi observ robot unabl local greedi frequent happen passiv counterpart refer dh ballard cm brown comput vision ab cremer integr activ local robot control system robot autonom special issu feng navig mobil system techniqu ab thrun interact museum robot fifteenth nation confer artifici fast posit track mobil robot proc german confer artifici germani springer schmidt estim absolut posit mobil robot posit probabl grid proc thirteenth nation confer artifici thrun dynam window approach avoid ieee robot autom march ab cremer hybrid avoid method mobil robot proc ieee intern confer robot ab cremer posit estim mobil robot dynam environ fifteenth nation confer artifici kirchner autonom navig pipe proc euromicro workshop advanc mobil robot ieee comput societi lp ar ja kurien act discret bayesian model navig proc intern confer intellig robot lp ml ar cassandra plan act partial observ stochast domain technic brown kleinberg local problem mobil robot proc ieee symposium foundat comput koenig complex search technic report carnegi mellon april kuiper yt byun robot explor map strategi base semant hierarchi spatial robot autonom ml tl lp kaelbl complex solv markov problem proc eleventh intern confer uncertainti artifici robot ai summer stuart russel peter norvig artifici modern chapter number seri artifici intellig prentic simmon koenig probabilist robot navig partial observ environ proc intern joint confer artifici thrun learn map indoor mobil robot navig journal artifici intellig thrun role explor learn control white handbook intellig fuzzi adapt approach van nostrand map learn navig rhino
AI/795 2 issn de recherch institut nation de recherch en informatiqu en automatiqu algorithm project bundl adjust minimum paramet peter sturm unit de recherch inria avenu de algorithm project bundl adjust minimum paramet peter sturm interact movi rapport de recherch page bundl adjust techniqu comput maximum likelihood estim structur motion imag featur correspond larg system time iter optim process start solut obtain linear method term comput cost process depend repres structur motion address problem minim project structur camera calibr exist chang cost complic requir call model case loss restrict problem minim project fundament matrix classifi exist wai obtain minim set paramet categori present categori algorithm simpl implement yield minim address problem minim homogen entiti present call map tool optim homogen entiti minim number paramet make extens tool structur motion compar algorithm exist simul data real imag light algorithm perform exist term comput cost achiev perform term converg bundl project minim troi algorithm pour de avec nombr minim de de est techniqu pour calcul au maximum de dune reconstruct de correspond de primit imag en de tre la du temp en itr dune solut par de en term de le cot de calcul de tel de la pour le la structur le entr le dan cet nou le de de la structur du le ne pa calibr es la de dan le sen ell la de en express pour le ca san de nou le de la du entr deux dan le ca la matric nou de troi de de param tre minim troi par ce algorithm simpl de nou le de la de nou le nombr minim de nou cet dan le de la structur du nou algorithm avec exist en de donn simul de imag avec ce il le algorithm de perform en term de de perform gale en term de converg de project bundl adjust minimum paramet introduct bundl adjust standard techniqu structur motion optim base imag featur correspond view demonstr bundl adjust maximum likelihood estim provid error measur featur gaussian distribut interest bundl adjust enhanc estim practic case address problem bundl adjust point featur project work uncalibr partial calibr view process import accur recoveri project structur motion subsequ algorithm bundl adjust yield larg optim problem consist minim cost function base discrep featur actual complet set paramet structur motion cost function local minima process provid result method bundl adjust remain kei featur bundl adjust algorithm properti converg global comput cost term cpu time bundl adjust greatli depend algebra structur numer condit number paramet emploi minim main problem deal coordin frame project basi reconstruct express solut mind consist set coordin reconstruct point coordin impli priori check point gener project basi solut special form camera matric coordin frame minimum number view paper loss concentr case center project view ident scene observ planar problem express reconstruct basi insid refer project shown minim fundament matrix problem direct global uniqu map minim set paramet entri fundament matrix cover note true cost function bundl adjust sum squar euclidean distanc estim actual imag note point plane consid rr sturm solut problem bundl adjust minim number paramet classifi solut categori present give approach algorithm solv problem simpl practic import issu consid paper minim homogen project structur refer homogen solv call map coordin make extens solut algorithm solv problem present paper organ problem state previou work project structur motion review map coordin present appli minim structur algorithm minim project motion experi conduct simul data real imag shown drawn problem statement previou work give mathemat notat preliminari recal principl bundl adjust formal state problem coordin frame ambigu review exist approach gener case introduc contribut state review exist solut problem minim homogen entiti notat preliminari perspect project model camera repres homogen denot view consid matrix algebra dof homogen constraint correspond essenti dof camera rise repres geometr posit project space term design set view point project space model homogen denot point consid vector algebra dof homogen constraint correspond essenti dof term design set point actual imag point repres homogen denot imag point provid point project view handl easili mathemat point visibl view inria project bundl adjust minimum paramet problem repres motion structur vector function pq motion structur pq function repres singular function pq bundl adjust process paragraph minim fact number dimens equal number essenti dof problem formal state bundl adjust previou bundl adjust process conduct argmin pq cost function error sum squar euclidean distanc actual imag euclidean distanc import note invari rigid rotat project appli imag point simplifi form project bundl adjust maximum likelihood estim imag point corrupt iid center gaussian optim bundl adjust conduct iter optim algorithm numer algorithm initi estim case project structur exist algorithm provid initi import aspect estim process consid data condit enhanc method consist normal center scale imag point distanc center imag scale imag enter cost function preserv rel weight term rr sturm coordin frame ambigu import issu bundl adjust coordin frame express recov structur motion coordin frame ambigu constitut gaug freedom inher problem structur motion recoveri numer stabil converg properti estim process mind choic coordin frame fruit estim process metric problem easili solv singl view coordin frame global scale project gaug freedom constitut main problem dealt bundl algebra structur manipul coordin frame complex view uniqu project basi view provid constraint understand reconstruct express coordin error drop index clariti present error estim actual imag point express reconstruct coordin link current project matrix point transform ph hq chang imag coordin ph hq leav cost coordin frame ambigu measur cost function chang project dof state number essenti dof equal structur motion minu coordin frame minim dim dim problem mean mean handl gaug freedom free gaug consist problem algebra entri gaug evolv inria project bundl adjust minimum paramet reli coordin reconstruct point chosen point gener achiev form camera matric reli transform imag point give form project matric point constrain gaug freedom achiev minim imag coordin camera matrix write inhomogen valu penalti free gaug problem prevent gaug drift ad soft constraint measur set constraint camera matric coordin frame add penalti term cost function make estim process converg solut approxim constraint mean advantag term numer number paramet number measur ad cost function free gaug advantag simplic implement numer instabl estim diverg involv estim paramet test advantag number paramet estim minim estim behaviour strongli reli choic made point form project basi point gener priori advantag slightli solut simpl test partial yield simpl express camera matric euclidean imag transform time leav cost function invari make bundl adjust penalti simpl implement prevent gaug drift paramet measur comput cost process test normal exist method combin possibl complet partial coordin frame give detail exist approach approach mix coordin frame set point coordin match standard project basi addit imag transform yield rr sturm simpl express camera minim bundl adjust imag coordin leav cost function yield suboptim bundl adjust result rel structur introduc relat camera matric plane plane necessarili observ camera set ident matrix column camera matric view respect null vector view framework approach minim exist work minim author complet algebra entiti prevent gaug drift ad soft measur cost entri project matric result approach satisfactori term converg comput cost neglig problem measur ad possibl view incorpor gaug constraint structur repres gener homogen entiti investig possibl paragraph reduc problem case mention problem coordin frame special form camera matric fundament fundament matrix express camera matric recov complet coordin frame attach view loss select view coordin frame camera matric special form write gener homogen gener distant imag sequenc constitut good choic refer view point fall singular case close view manipul notat design camera matric author camera plane relat ambigu relat plane rel scale problem inria project bundl adjust minimum paramet author plane call canon plane denot link fundament matrix plane satisfi homogen essenti dof essenti dof canon plane essenti dof strictli epipolar essenti dof fundament matrix deduc plane project matric ambigu choic remov normal version remov ambigu rel scale canon project canon reconstruct basi minim entiti fundament matrix minim analysi restrict case author extend minim gener case map depend fundament matrix express fundament matrix attach make method complic implement solut number map reduc imag transform make distinct canon project matric fundament strictli canon project matric canon project matrix form slightli version origin canon project matric rel scale mean minim project motion state techniqu estim fundament matrix minim number paramet fall map express algebra entiti term model rr sturm local updat imag transform restrict number case categori give estim matric fundament matrix estim categori algorithm illustr categori algorithm consist canon plane enforc constraint yield map repres motion map relat map coordin recov canon plane paramet map index factor fundament matrix svd scale highest singular null singular rotat matric obtain svd local updat fact cost function consid bundl adjust data condit invari imag rotat imag center ensur lead uniqu minim fundament matrix algorithm necessit minim homogen entiti state problem paragraph homogen ambigu problem dealt project bundl adjust homogen algebra entiti algebra reconstruct point camera matric paramet entiti essenti dof account prevent bundl adjust process diverg save comput time estim minim number common strategi entiti homogen paramet measur soft constraint norm entiti reconstruct point element constraint norm uniti measur drawback method paramet estim measur comput cost estim process call map coordin perform optim minimum number paramet addit measur inria project bundl adjust minimum paramet map coordin homogen algebra entiti inher ambigu gaug freedom scale factor minim coordin repres essenti dof tool call map coordin local remov word produc minim version homogen entiti homogen entiti map index subsequ recov homogen entiti show decomposit properti coordin undergo small inhomogen part map constant system adapt optim map step optim practic algorithm map coordin tabl give term uniqu bidirect correspond set paramet algebra bidirect correspond set paramet algebra entiti consist select case map number map number step give detail map coordin case homogen vector method valid homogen entiti dimens map index index chosen maximum import properti slightli chang creat numer instabl maximum tend step map requir divid vector exist null element ensur homogen entiti complet null assum probabl vari optim step element null step maximum absolut minim structur show minim structur map coordin reconstruct point algebra paramet rr sturm homogen homogen entiti brought back case stack element singl vector inhomogen repres map coordin integ repres map index map argmax vv tabl map coordin homogen entiti includ optim process notat design vector form element vector insert posit point coordin map coordin map index tabl paramet minim set paramet map indic includ optim process direct minim canon project matric give solut minim project motion canon project matric algorithm yield consist paramet map unlik previou approach base map algorithm simpl requir express algebra entiti idea algorithm paramet repres enforc constraint examin constraint detail rewritten repres column equat linear entri assum elimin element recov enforc constraint index column complet row recov entri exclud inria project bundl adjust minimum paramet necessit case map element small coordin argmax map exclud row index correspond map paramet remain homogen map coordin map coordin provid minim algorithm tabl canon plane constraint hold inhomogen repres set map indic subsequ recov routin call iter optim process call evalu cost function comput map coordin map index extract obtain remov row comput map coordin map index build set paramet consist map coordin paramet store map indic recov recov comput miss row form tabl minim canon project matric factor fundament matrix svd fundament matrix mean minim motion decomposit rotat matric null singular valu rotat matrix local updat ratio singular valu due homogen fundament matrix updat scheme decomposit rebuild fundament matrix directli canon plane canon project matric rr sturm denot svd fundament matrix orthogon matric diagon singular valu strictli posit scalar homogen scale svd rotat matrix updat paramet rodriguez formula complet includ fundament matrix recov column column canon plane formul equat orthogon algorithm tabl epipolar geometri entiti compon epipolar geometri epipolar transform directli entiti map coordin tricki part approach establish link fundament matrix canon plane work multipl express fundament matrix avoid multipl express imag transform transform chosen leav invari cost function bundl adjust preserv data condit epipolar geometri epipolar transform recal epipolar geometri notat state epipolar geometri inria project bundl adjust minimum paramet fundament matrix inhomogen updat estim call start optim process call evalu cost function comput scale svd fundament set paramet updat updat sin updat sin recov canon plane recov tabl updat scheme motion epipolar pencil call epipolar transform denot point obtain intersect epipolar pencil line repres homogen epipolar transform homogen map coordin obtain paramet includ optim process recov entiti replac figur epipolar geometri epipolar transform rr sturm recov entiti fundament matrix plane method intersect epipolar pencil line intersect point epipolar denot intersect point relat dof call extend epipolar transform fundament matrix deduc shown plane form project matrix equat express extend epipolar transform form depend intersect line chosen ensur mean lie line priori deriv uniqu express extend epipolar transform fundament matrix imag transform ensur lie line intersect line view reason examin class imag transform form intersect line give mean estim transform ensur lie intersect line constraint transform imag data leav cost function preserv optim charact bundl numer condit preserv converg properti data condit transform denot rigid rotat translat condit transform spread chang coordin center graviti imag point possibl rotat imag dof angl rotat show estim angl form intersect line line li imag rotat pass inria project bundl adjust minimum paramet replac te figur priori chosen intersect line transform rotat imag center center li remov author rotat intersect line line line pass imag center parallel sign distanc imag center choic simplifi notabl extend epipolar transform show comput transform pure center rotat move farthest intersect line farthest point rotat situat illustr optim rotat write te imag center note formula valid case lie rotat appli imag problem li close imag tend imposs build angl rotat estim simpli detect case set ident matrix rotat threshold order pixel distanc imag center algorithm comput tabl deriv extend epipolar transform chosen intersect intersect point write hp entri rr sturm step estim transform appli imag data make singular preserv data condit cost function threshold chosen order pixel set set tabl algorithm comput center imag rotat farthest intersect line repres hp epipolar transform appli easili verifi extent epipolar transform recov gp algorithm tabl experi simul data compar method exist simul data test bench consist point ly insid sphere radiu meter observ camera focal length number camera center sphere situat distanc meter baselin camera meter point gener project imag corrupt addit center gaussian vari standard deviat measur quantiti depict characterist bundl adjust comput cpu time converg error versu standard deviat ad imag measur error current estim function time optim process plot correspond median valu trial bundl adjust initi valu obtain point algorithm triangul method compar inria project bundl adjust minimum paramet fundament matrix inhomogen epipolar geometri map subsequ recov canon project matric routin call iter optim step call evalu cost function comput map coordin svd fundament estim appli imag transform imag fundament comput entri epipolar transform map coordin linear system equat form comput map coordin epipolar transform map set paramet store map indic recov epipolar transform form extend epipolar transform equat form fundament matrix equat form canon plane equat tabl approach base epipolar geometri subsequ recov canon project matric rr sturm svd free measur prevent gaug drift partial partial free gaug complet camera matrix imag standard deviat map svd free normal partial free imag standard deviat map svd free normal partial free figur comparison cpu time converg error converg versu vari imag method observ roughli method converg minimum cost function method slightli reliabl converg free partial free figur show roughli converg big dispar comput cost method method worst comput cost normal partial free method minim number paramet present svd lowest comput roughli clear result method comput cost converg properti order understand explain behaviour measur number iter comput cost iter result shown found method free partial leav gaug drift freeli bad converg perform roughli method normal perform number iter smaller method involv solv costli linear system inria project bundl adjust minimum paramet imag standard deviat map svd free normal partial free imag standard deviat map svd free normal partial free figur comparison number iter converg comput cost iter method present minim number paramet number iter comput iter low comput cost number iter free gaug method normal method explain method achiev lowest total comput cost show evolut error optim process experi time converg measur highli depend converg threshold consecut account abil algorithm reach converg experi conduct test bench level imag point posit pixel method base minim reach converg normal partial free method roughli time attain free method time experi real imag valid algorithm real imag case imag order cover possibl close imag pair imag camera posit shown initi valu structur motion comput case simul data result shown tabl combin imag pair estim cpu time converg error converg result rr sturm time map svd free normal partial free figur comparison evolut error replac camera posit observ scene figur real imag valid algorithm inria project bundl adjust minimum paramet view map svd free normal partial free averag tabl error converg time converg obtain combin pair imag obtain simul data make row tabl show valu algorithm set imag pair product measur kind score algorithm respect test set imag rank converg properti comput partial free free test algorithm imag initi valu obtain regist view structur motion obtain camera matric view model gener homogen matric paramet map coordin result algorithm converg error pixel rel perform term comput time converg obtain case view studi problem minim constrain coordin frame recov structur motion special form camera matric classifi wai achiev categori present algorithm algorithm simpl implement compar exist result show perform term comput cost achiev result term converg properti exist algorithm constrain gaug mean perform algorithm recommend call svd simpl implement yield easi jacobian motion paramet algorithm rr sturm refer vision percept applic la mobil scienc informatiqu horaud project structur motion view planar scene intern confer comput volum page juli faugera dimens uncalibr stereo european confer comput santa page pe mh wright practic optim academ hartlei defenc algorithm intern confer comput page june hartlei sturm triangul comput vision imag ri hartlei project reconstruct invari multipl imag ieee transact pattern analysi machin octob reduc constraint theori experi intern journal comput algebra varieti multipl view geometri european confer comput hanna direct recoveri shape multipl parallax base approach intern confer pattern page qt faugera fundament algorithm stabil analysi intern journal comput qt canon geometri multipl project view comput vision imag gaug invari project reconstruct fort error surfac structur motion technic inria project bundl adjust minimum paramet carlsson linear multi view reconstruct camera recoveri intern confer comput page juli hs sawhnei geometri planar parallax confer comput vision pattern page rel canon model geometri applic ieee transact pattern analysi machin cc editor manual fourth edit american societi photogrammetri remot fall common framework kinemat reconstruct motion deform object european confer comput page sturm trigg factor base algorithm project structur motion buxton european confer comput volum lectur note comput page april trigg plane tensor factor european confer comput page pf ri bundl modern synthesi vision theori volum lectur note comput page zhang determin epipolar geometri review intern journal comput march rr unit de recherch inria avenu de unit de recherch inria de campu rue du jardin bp cedex unit de recherch inria renn campu universitair de beaulieu renn cedex unit de recherch inria rocquencourt domain de voluceau rocquencourt bp le chesnai cedex unit de recherch inria sophia antipoli rout de bp sophia antipoli cedex inria domain de voluceau bp le chesnai cedex issn
Agents/796 1 agent learn sidnei dr eng universidad feder de santa departamento de informatica de softwar cx postal campu sc brazil carlo da rocha costa dr sc universidad feder rio grand instituto de informatica departamento de informatica instituto de postal porto rs brazil genet neural artifici intellig agent learn sidnei dr eng universidad feder de santa brazil carlo da rocha costa dr sc universidad feder rio grand brazil instituto de genet neural artifici intellig abstract text initi discuss distribut neuron neural network learn creation destruct neuron base activ relat concept recogn introduc call activ defin agent collect activ repres concept sensori characterist concept repres neuron act recogn observ thing call thing motor characterist action vector defin schema agent environ goal vector schema reach activ schema permit distribut neuron conceptu creat concept base action sensat approach inspir theori swiss psychologist jean intend make explicit account process continu interact agent environ agent produc cognit structur version paper publish intern confer neural network genet algorithm held franc introduct notion autonom agent plai central role research artifici intellig autonom agent system capac goal orient action environ main autonom agent call cognit reactiv agent cognit agent base symbol process mechan tradit artifici intellig system reactiv agent base altern comput mechan neural analog altern approach autonom agent base hybrid mechan extens explor question proce combin symbol mechan research topic work orient jean piaget genet psycholog epistemolog kind mechan autonom agent coordin determin mechan characterist kind coordin symbol mechan result elabor call reflex abstract base element mechan paper present structur process form basic level process hybrid autonom agent process structur believ provid adequ mechan reflex abstract order maintain terminolog genet level call level autonom agent belong level call autonom agent mechan descript bodi origin defin base kohonen neural network genet algorithm combin reproduc main structur call schema schema call schema mechan differenti todai cultur neural network net basic reactiv evolut stimul provid entri schema mechan net evolv reactiv case weight introduc possibl activ evolut genet algorithm case schemata essenti schema mechan kind schema evolut process agent interact process environ account section discuss neural network problem perspect assum reader basic knowledg field section detail activ schemata section defin autonom agent show adequ interact process environ section point main aspect futur work distribut neuron neural network weight competit neural network initi train process common practic initi weight uniformli distribut random valu procedur difficulti train process observ pattern network arent uniformli concentr specif region space neuron distant pattern consid winner competit neuron discard region great concentr number neuron differenti categori pattern neuron distribut reflect actual structur observ space solut distribut neuron densiti entri group distribut net method develop approxim effect train network exist solut solut problem initi distribut neuron call convex combin method weight defin number element entri vector make weight vector normal coincid element entri assign small entri net increment limit reach make entri final reach actual carri respect neuron convex combin method work make learn slower method work begin train dont predict distribut entri reach method stop work distribut entri vector method method consist ad entri make entri move eventu captur weight vector method work slower convex combin method method initi random initi stage adjust weight winner move weight vector region greater concentr entri pattern train vector winner adjust adjust vicin restrict winner adjust fourth method neuron correspond number time activ number iter network denot number competit neuron wait neuron activ time averag specif neuron greater neuron activ time averag neuron situat put temporari threshold reduc win probabl neuron train method effect begin net train train proce environ condit concept bee net lose adapt capac point view mean agent variat environ organ solut problem consist vari number neuron net dynam creation destruct neuron variat effect concept model implement destroi activ neuron creat region cover activ neuron tendenc reduc varianc number entri neuron approach base quantit inform number occurr entri kind strategi observ categor human number exemplar concept factor concept observ diamond concept number greater observ concept exemplar dont foundat encount symbol level activ schema combin concept recognit neural network search mechan genet algorithm combin mechan build neural network capabl chang environ enabl movement vector entri space variat quantiti recogn concept main differ schema mechan method restrict quantit inform vector distribut decid alloc neuron activ schema base notion associ action percept criterion action success orient creation destruct neuron activ schemata sensori signal entri signal defin ration establish number decim digit repres defin alphabet set signal repres digit decim point gener signal defin ration alphabet gener signal denot signal xs xg correspond oper creat gener signal random distribut defin random random ration function uniformli distribut interv li li li sensori entri defin signal string sensori denot kleen closur set entri form concaten finit number element alphabet sensori entri size sensori entri correspond number signal entri sensori entri size denot signal denot gene chromosom genet alphabet defin finit set form signal alphabet special repres denot undetermin element genet element aa call gene genet alphabet signal compound genet alphabet signal alphabet call proper gene call improp gene oper appli proper produc absolut differ signal produc constant appli improp averag differ random number interv ab int nat function ab oper ag make summat gene gener signal oper implement mutat gene gene summat consist gene oper adjust gene ga signal ss limit learn approxim directli proport defin averag chromosom string element genet alphabet size chromosom chromosom size ca chromosom ca alphabet size chromosom defin number gene chromosom bear chromosom size denot similar sensori entri chromosom produc interv correspond averag applic function gene signal posit function similar nat similar ls lc natur oper crossov consist pair chromosom combin obtain pair oper crossov chromosom natur crossov point occur immedi gene chromosom crossov oper simpli return origin pair chromosom oper defin crossov lx ly lr vector mutat defin string gener signal vector mutat creat random signal vector mutat creat distribut function defin quantiti signal vector bear oper nat creat vector mutat respect valu gener random function interv valu gener interv li li li lt accept mutat vector valu concentr vicin sampl accept vector mean valu interv valu interv mutat consist applic gene chromosom valu vector mutat mutat defin mutat lc lv reproduct pair chromosom oper gener pair chromosom function reproduct reproduct neuron neuron defin pair element substitut weight vector basic model neural net improp gene chromosom denot weight applic neuron sensit entri posit element correspond activ threshold excit level neuron trigger domain neuron size denot neuron oper decomposit domain chromosom neuron threshold neuron applic neuron sensori entri gener signal interv correspond differ similar threshold differ signal produc applic neuron applic ls lr adjust neuron sensori entri adjust gene function adjust neuron neuron adjust la schemata schema consist tupl sensori entri goal action learn evalu schemata domain denot schema neuron neuron decomposit oper domain entri schema nm neuron goal schema neuron goal action schema learn schema evalu schema train schema pair correspond schema neuron adjust entri rate defin function train schema schema train ls ls attenu train schema consist reduc rate attenu rate reduc cycl iter function attenu schema schema defin attenu le evalu schema schema rel pair consist weight averag similar entri chromosom goal neuron schema averag weight similar entri chromosom entri neuron great greater particip calcul averag function schema schema ls ls reproduct pair schemata consist reproduct compon schemata reproduc schemata combin entri goal action valu schema schemata reproduct schemata origin pair schemata pair activ threshold gener genet process repres ration valu chromosom binari alphabet correspond basic model genet algorithm reproduct valu crossov mutat valu fix upper bound schemata test learn process valu fix arbitrari lower recent creat schema evalu bit smaller averag obtain randomli destruct process guid destroi neuron test havent popul popul consist set schemata oper defin popul domain popul defin powerset domain schema popul schema select schema popul popul sensori entri obtain applic neuron entri probabl schema ei select rate applic summat valu function select popul schema select lq ls select schemata probabl ej agent agent set signal set effector popul schemata agent live environ signal agent suffer action signal agent effector agent denot signal present agent pass environ agent environ denot set entri signal set environ schemata schemata necessarili defin agent schemata environ physic schemata physic relat observ relat signal agent sensor signal physic instant time instant descript cognit agent instant time instant descript environ agent interact instant agent work work agent environ step select agent observ sensori entri provid environ agent select winner schema activ winner select step activ agent activ winner put correspond posit proper signal chromosom step adjust agent adjust weight entri goal neuron data provid step attenu agent decrement learn attenu adjust rate winner attenu valu step evalu agent observ sensori entri effector activ observ repres agent calcul evalu winner winner step reproduct winner reduc agent make reproduct winner schema agent add pair schemata elimin schemata smallest valu return step work behavior concept identifi activ schemata schema randomli action execut make entri goal neuron schema identifi proper result creat action constant adjust goal neuron increment gradual evalu schemata action appli entri product desir lower schema perform role defin piaget perturb begin schemata reproduct call process reproduct doesnt destroi schema suffer schemata lowest evalu perturb schema pair schemata creat reproduct schemata perturb case reproduct perturb weight select schemata highest accord genet algorithm process make agent search good schemata order accommod perturb effect agent work effect agent instant readi act instant environ law oper instant determin action produc agent instant affect sensori entri environ agent instant interact process agent environ process evolut system agent repres evolut pair denot sequenc cycl form repres step agent repres step environ work sequenc step describ join work pair agent action modifi modif affect agent capac repres agent cognit interact process identifi genet epistemolog main contribut model combin neural network genet algorithm result learn mechan modif schema mechan approxim kind human classif method concept schemata built action goal action reach schema observ belong concept schema differenti differenti occur coupl schemata genet reproduc observ goal recombin creat repres structur activ relat object genet mechan find configur tupl observ action goal schemata repeatedli fail search goal fit reduc schemata reach goal fit increment schemata repres correct concept destroi preserv import aspect human classif method capac concept gener special exemplar belong class simultan cat time identifi schema mechan approxim gener effect simul competit neural network neuron configur consid special neuron neuron special proper gene similar gene similar similar mean schema special incorpor characterist doesnt exist schema defin kind schema special greater similar quantiti improp gene paper advanc formal studi relationship interact work agent environ characterist process cognit develop agent interest studi futur role interact process plai passag level cognit symbol handl studi verifi schema mechan suffic handl level mechan requir refer carlo da rocha machin sketch approach phd porto judith neural network architectur introduct van nostrand jean pierr decentr artifici intellig elsevi scienc david genet algorithm machin learn john adapt natur artifici system michigan jean cognit structur central problem cognit develop rio de person commun model knowledg construct phd
HCI/797 4 context crystal reward pitfal keith nigel keith mitchel christo distribut multimedia research group depart comput lancast uk introduct context situat potenti simplifi understand interact complex interact system due size devic smart interact system run devic share limit bandwidth interfac system user techniqu simplifi interact reduc bottleneck desir order serv notion ubiquit comput paper discuss potenti reward pitfal await design incorpor interact system issu anecdot base experi develop evalu guid system introduc issu popular interact brake system brake system system introduc safeti measur order reduc brake distanc greatli reduc potenti driver car excess brake context brake system driver brake situat wheel brake adapt element system involv detect wheel lock brake forc wheel longer lock point brake forc appli provid situat context brake advent driver requir develop mental model account complex interrelationship exist brake forc friction road number accid year involv car illustr fact driver relationship ab system identifi act behalf reduc mental physic demand drive car agent control driver driver prefer interact make car easier drive ab system enabl driver form simplifi mental model car brake driver detail rule govern brake forc result lack control driver brake mechan learnt skill order prevent car skill emploi driver car approach conflict brake distanc highlight potenti pitfal adapt problem fail reach stabl state user system attempt adapt current context system manag reach stabl state circumst system unpredict design import form mental model interact similar prescript freedom driver lock wheel car system prevent achiev task user trust agent perform adapt behalf ab altogeth system driver driver work ab system requir trust context technolog intellig abil react appropri context manner identifi main wai context simplifi interact interact task specif requir user order achiev desir reduc user level simpli fill requir current base inform system higher involv attempt current goal order reduc task specif ab chang output produc reduc quantiti inform process user qualiti inform present reduct output achiev attempt preempt output base current context reduc complex rule constitut mental model system gener achiev form intellig agent perform proport requir comput behalf section describ posit neg experi context gain develop evalu guid system experi develop tourist guid guid system develop provid visitor citi lancast inform tailor context citi number strateg posit wireless commun cell diamet approxim depend layout build commun cell dissemin locat inform tourist inform mobil guid unit carri guid visitor receiv inform attract structur tour citi tailor specif requir kei requir flexibl visitor system chang kind situat interact visitor chang tour book accommod resum tour design user interfac enabl user switch aspect function order meet demand current situat figur user interfac present visitor tour initi made reduc flexibl afford user interfac order involv make default mode situat tour complet abort order describ guid adapt context categori identifi introduct task specif type context util guid locat locat attract citi system reduc input assum inform requir visitor strongli influenc current locat visitor stand lancast castl request system area search content page lancast initi guid system made mistak visitor obtain inform current locat emploi system simplifi visitor task inappropri lack flexibl version frustrat user system extend enabl visitor requir search inform keyword point illustr problem successfulli goal user chang output produc system guid system attempt constrain tailor inform present visitor base current context visitor request list nearbi list constrain attract higher list assumpt made visitor interest attract open visit earlier version system constrain output remov close attract present list frustrat visitor interest visit attract view architectur build demonstr difficulti goal futur version system state interest architectur determin close attract clear architectur includ list reduc complex mental model agent act behalf user design reliev user oner task studi map guidebook order follow interest tour agent calcul tour base varieti current current special open hour rel posit attract citi prefer interest histor build evalu guid system experienc difficulti captur locat context suffici accuraci problem obtain inaccur incorrect contextu inform adapt perform base produc inappropri result case guid meant present list attract expect strategi build applic number strategi identifi design interact system util situat context strategi base analysi exist interact concern experienc develop evalu guid context constrain present simplifi specif crucial adapt inappropri user interact design carefulli fundament prescript decid adapt context adapt design care bear mind princip predict design adapt context potenti integr system ab inappropri transfer skill difficulti technic issu consid engin system technolog obtain context depend mean accur time manner intellig agent adapt context flexibl order cope problem obtain context potenti demand user design interact system avoid potenti pitfal paper consid potenti reward pitfal util situat context design interact system adapt context develop interact system user form simplifi mental model interact system system migrat complex user form intellig agent context abil reduc complex task specif reduc quantiti inform output system abil crucial gener interact system horizon design run futur mobil comput devic devic share limit bandwidth interfac user devic maxim bandwidth paramount import provid design potenti bring ubiquit inform applianc step closer realiti refer gs blair design object model tourist comput vol decemb pp fridai electron tourist issu acm press user interfac design longman isbn da comput mit press isbn comput scientif septemb pp comput applic proc workshop mobil comput system santa laboratori market place ieee person vol pp
DB/798 3 simultan proxi evalu brian davison depart comput scienc state jersei nj usa abstract simultan proxi evalu architectur design evalu multipl web proxi parallel object request duplic pass proxi spe architectur reduc problem unrealist test date inappropri applic prefetch proxi intend measur byte object hit cach consist space proxi evalu methodolog place architectur introduct paper present architectur evalu proxi cach grew research techniqu prefetch web cach found exist mechan evalu proxi cach suit prefetch system object evalu paramount appli academ relev explor approach consid rang exist proxi evalu found distinct disadvantag led design gener architectur ongo develop prototyp outlin end paper evalu simultan proxi evalu reduc problem unrealist test date inappropri workload evalu larger class proxi section provid quick introduct cach section motiv spe architectur describ space proxi evalu methodolog evalu comment implement issu conclud paper describ set sampl evalu task util report statu prototyp implement background cach long histori topic design comput memori virtual memori manag oper file cach internet perform network servic dn arp web cach temporari storag web object html retriev propon web cach claim advantag web reduc bandwidth consumpt request reduc server load request server reduc latenc cach closer client fourth object retriev cach origin server reachabl featur make world wide web perform drawback cach potenti object store cach fetch current object minim cach manag lack log client view page cach perform client built browser cach util client server part proxi proxi cach locat network gatewai reduc web cach store http gener web simplif bandwidth requir dedic internet connect share system serv client cach object server request cach object request client retriev client greater proxi cach part cach cach request document neighbor cach fetch directli server cach directli front reduc number request server handl share proxi cach serv popul client proxi cach receiv request web check memori return object client disturb upstream network connect destin server proxi attempt fetch object directli proxi cach increasingli world reduc bandwidth allevi delai world wide web paper describ method simultan evalu compet proxi cach request stream object measur proxi hit stale form wrapper test proxi monitor input output evalu proxi cach perform assess perform proxi consum select system situat develop work altern proxi mechan evalu perform measur recogn drawback implement imagin proxi larg disk cach high hit poor disk manag notic latenc imagin proxi achiev high hit rate cach imag short time free storag object prefetch inlin imag page request report high request hit perform term bandwidth save select proxi base perform workload request gener user perform parent proxi larg corpor proxi client exampl illustr import evalu mechan proxi system space cach evalu method commonli cach evalu method simul benchmark log object request byte page hit rate save calcul estim latenc improv artifici dataset characterist averag median object similar distribut object size object actual client request log arguabl repres request pattern includ exact inform object size evalu architectur sourc workload form algorithm implement tabl show categori data sourc test form algorithm evalu system repres area find desir qualiti web cach load improv measur rest section point characterist qualiti system area space work survei web evalu research categor evalu methodolog methodolog realism complex move diagon downward evalu methodolog space note method area live request stream sampl chang avail access characterist host live network connect cach mechan commonli evalu simul captur client request log sampl log shown figur log gener record request pass collect log packet cdf appropri modifi browser perform log workload sourc algorithm implement artifici captur log current request simul real network real network tabl space evalu methodolog proxi figur excerpt proxi log gener record request request log order inappropri replai order reflect request complet request origin simul system simul cach algorithm requir detail knowledg algorithm commerci simul accur assess document retriev delai imposs accur simul cach mechan prefetch basi content page serv access link web page server log page content log cach perform prefetch prefetch object user request log unknown characterist size web server time real network order combat difficulti live network measur techniqu elimin variabl internet local server isol gener unrealist expect perform addit current web server network isol network retriev current content web real system network state internet continu web server intermedi network connect test live network gener replic perform test experi requir reliabl robust robust network connect handl workload appli artifici workload captur log synthet workload assum object actual client request log averag lifetim web page short month captur log lose quickli refer longer inaccess chang content page short time give log process log reflect inaccur request order sampl log show figur note request main page request main page proxi cach trace log inaccur return stale object characterist current object current request stream workload live request stream produc experi reproduc pair live hardwar test hardwar softwar difficulti handl high real load abram emb multipl algorithm awar work attempt evalu multipl proxi time suggest altern complementari approach web proxi server evalu architectur compar multipl proxi actual object request gener user popul send multipl proxi parallel request live network connect spe architectur complementari exist mechan simultan blackbox comparison compet mechan realworld data environ spe architectur spe architectur actual client request exist network evalu multipl proxi record time measur calcul proxi latenc comput page byte hit rate form wrapper compet proxi produc log measur extern network usag perform consist client simultan evalu multipl util possibl sourc web request singl network connect provid object measur real load architectur detail paper architectur simultan evalu compet proxi cach web request funnel initi proxi call replic request multipl proxi attempt satisfi request return cach copi client browser proxi cach proxi cach proxi cach proxi collector proxi multipli internet figur architectur onlin evalu compet proxi cach client request proxi send copi proxi cach evalu directli collector cach copi request item proxi cach return proxi send request proxi collector proxi request cach fetch directli quest forward request special proxi cach fulfil proxi collector attempt return cach copi request fetch proper web server potenti proxi cach forc proxi send request singl request end internet fulfil figur diagram architectur user browser click browser send request url proxi case request send duplic request proxi evalu directli collector proxi object case return object quickli experi cach verifi content send request collector proxi client browser modif send request proxi evalu configur browser multipli proxi addit request multipli calcul request fulfil time proxi evalu multipli determin pass back client algorithm proxi cach evalu treat long function valid http proxi cach commerci gener elimin requir detail knowledg algorithm sourc code simul special code addit log typic proxi cach run simpl test softwar hardwar configur test architectur order prevent proxi cach issu request destin web util proxi collector function cach elimin extra traffic gener standard elimin duplic request result gener design cach collector prevent multipl request issu request side effect ad electron shop cart collector distinguish request url differ argument differ field ident post collector offer proxi copi object addit request signifi request client pass destin web server collector return document transmiss characterist fetch destin server includ amount time initi connect establish transmiss rate accur simul collector enabl proxi potenti cost retriev multipli record time accur reflect realworld perform request object collector cach inappropri perform boost tradit evalu cach algorithm simul onlin exist proxi cach blackbox evalu test proxi cach data elimin variat measur perform due time elimin variat measur perform due request log evalu prefetch system local mirror page referenc trace gener artifici workload complet intern link evalu prefetch system fetch page user includ tradit measur consist compar object return proxi fetch directli simultan compar proxi request stream realiz method drawback identifi disadvantag spe architectur comment evalu multipl prefetch scheme place higher demand bandwidth network multipl copi compar hardwar system compar proxi multipli collector introduc addit latenc proxi multipli hide client ip proxi perform task differ depend cach evalu independ easili perform claim part test replic applic method live network multipli collector manag larg number connect implement issu spe architectur characterist feasibl circumst elimin requir user exist proxi replac multipli ip port multipli collector combin configur transpar handl rout http request earlier descript spe http request proxi fill previou proxi cach proxi miss collector ensur collector chanc proxi test preserv client perform multipli contact collector directli object return collector standard result proxi compar consist proxi return stale object record send request directli multipli elimin difficulti determin return robust case failur proxi cach test implement spe architectur particip softwar cach connect shown factor cach perform multipli support persist connect client attempt contact proxi level client contact multipli multipli attempt gener ratio http request receiv collector receiv rang request type proxi evalu depend capabl highest collector record connect destin web server support http inform select provid http support client proxi request requir accur collector high tradit proxi cach mean attempt cach return object accur time characterist calcul compar averag latenc valu proxi handl attempt fetch object directli pass request proxi multipli configur fetch request url directli difficulti includ implement robust multipli collector measur proxi handl higher load proxi support time connect number difficulti spe proxi collector manag larg number connect architectur suit insight perform workload repres applic demonstr potenti spe present scenario exhibit aspect spe architectur valuabl evalu altern proxi measur proxi cach task compar bandwidth reduct multipl proxi includ perform prefetch believ client load intern work simul order evalu prefetch realist workload full content desir typic evalu task corpor similar research evalu prototyp properli spe architectur channel part load balanc live client request load multipl proxi evalu incom outgo byte proxi calcul actual bandwidth save current workload network connect perform spe architectur suffici measur stale data return proxi note loss minim test sort made implement collector stead test proxi request multipli fetch request measur latenc result vari os hardwar singl proxi cach solut question version unix hardwar suffici perform organ workload instal oper cach ident differ perform id scsi perform stock os instal determin spe receiv request load gener singl network rel perform configur calcul current load network capabl organ evalu transpar evalu architectur problem evalu overhead transpar evalu architectur implement evalu find latenc introduc attempt verifi consist collector implement live request stream question live request stream interact prefetch system reli exist time page request provid time prefetch object request past research suggest heavi tail distribut time captur request stream replai faster origin record artifici gener stream preserv time relev live request stream elimin ag prefetch system case order preserv desir replai trace log faithfulli possibl publicli trace log public trace log hide destin render useless fairli make reliabl live replai www replai trace log live network connect danger request gener filter suggest current request worst recent trace log client futur research paper present onlin evalu call spe proxi simultan evalu cach strategi request stream contrast exist evalu methodolog realist test environ potenti irrelev workload evalu prefetch test cach consist outlin space evalu methodolog shown spe fall provid sampl applic demonstr potenti architectur spe architectur design onlin environ real traffic evalu techniqu artifici workload trace log experi report artifici workload evalu system workload easili captur excess current load captur statist properti special workload retain benefit simultan evalu live network mention ongo develop effort build prototyp implement spe call onlin proxi present initi java implement function collector perform evalu incomplet pedagog exampl demonstr feasibl architectur continu expect implement collector appli spe architectur onlin time comparison altern proxi implement activ collabor infrastructur provid environ prototyp test reason time period spe architectur evalu proxi prefetch system valid manufactur claim provid comparison system live network evalu system implement spe architectur addit set measur tool cach design network engin alik acknowledg due haym brett anonym review comment earlier draft paper refer tim hypertext transfer protocol rfc product web page carlo mark crovella characterist www trace technic report comput scienc boston juli ramon fred michael rabinovich web proxi devil detail workshop internet server perform june peter chuck michael kurt hierarch internet object cach usenix technic san januari jame pitkow strategi world wide web comput network isdn yamaguchi interact prefetch proxi server improv www latenc seventh annual confer internet societi june brian davison survei proxi cach evalu techniqu fourth intern web cach workshop march fred jeffrei mogul rate chang live studi world wide web usenix symposium internet technolog system decemb extend version lab research technic report bradlei david michael measur access characterist client proxi cach usenix symposium internet technolog system decemb jeffrei tim hypertext transfer protocol rfc januari jame seltzer web cach consist usenix technic san januari brewster kahl preserv internet scientif march jeffrei fred krishnamurthi potenti benefit data compress http acm page septemb extend correct version research report digit equip corpor western research jeffrei mogul simpl http rfc octob carlo kathi richardson perform issu level web proxi acm sigmetr confer measur model comput page june acm press linda saul greenberg peopl revisit web empir find implic design histori system intern journal human comput roland marc abram proxi cach estim page load delai sixth intern world wide web page santa april duan wessel internet object cach document kurt invalid larg scale network object cach master roland stephen patrick brook network http packet work paper april
HCI/799 4 inform link inform view navig visual inform small displai johan peter lar erik holmquist appli research art technolog interact box sweden abstract pda applic design support peopl situat primarili meet peopl design address number issu interfac design inform visual interact mobil devic term inform system requir provid user singl integr inform system enabl quick access relat inform object interest select term system requir enabl easi effici inform includ devic problem address introduc inform link inform view evalu applic standard applic suit bundl prove interfac usabl applic interfac paradigm test subject train time system introduct popular person digit assist rapidli year area pda widespread mobil devic give user access digit inform move environ pda typic offic variabl predict design user interfac pda assum environ lack comfort work bad light chang singl session pda subwai mean light subwai car move station slight shake expect hand occupi hold handl order user situat distanc tradit offic environ addit constraint pose physic small size form factor pda introduc constraint human comput interact design pda typic smaller comput power limit input facil pda reli primarili input demand hand standard compon tradit graphic user button desktop displai small percentag screen percentag screen space forc search altern situat comput creat interfac problem user interact requir pose inform visual limit displai area explor design issu inform visual techniqu appli inform navig facilit order enabl fast retriev inform relev situat hand pda applic paper describ design issu respect applic work practic design support user relev inform activ meet peopl design integr interfac common kind inform store contact task meet technic applic run window design gui compon window ce user interfac order fulli explor altern interact techniqu avoid minim widget commonli larg screen checkbox fig typic screenshot window manag oper fig applic typic screenshot short descript system publish variant pda provid interact possibl term displai comput input choic devic greatli influenc design applic applic implement fig common pda market offer possibl quick prototyp languag subset devic weigh slightli gram held hand equip screen capabl displai pixel shade mhz nec mb ram stylu button easili access program devic button exit similar escap kei keyboard fig rotat rotat select press oper correspond arrow kei enter kei tradit comput keyboard fig action control design issu design address number issu interfac design inform visual user interact pda inform visual provid user inform perform task problem design comput applic inform visual niqu develop claim give user effici view inform problem difficult user access inform desktop comput fraction space ordinari displai inform visual techniqu recent appli devic small screen techniqu develop desktop displai modifi fit constraint pose small devic includ limit displai area requir design abandon ideal show account limit comput memori space chang network capabl inform navig inform pda separ view present inform present simultan devic larger displai resolut pda displai show inform resolv limit size screen make present small readabl user navig view pda order access amount inform displai singl view desktop laptop switch view requir user inform requir user relat previou inform order make transit add overhead cost interact user explicitli view switch make observ effect switch make inform displai ad overhead time concentr intend activ overhead partli mitig close map inform visual underli inform structur address book show entri feasibl divid present contact group group start letter user navig find chang view correspond move letter number item group number group larg displai creat hierarch structur view structur requir user switch view move move level view categor view creat user present inform level detail appar user move view individu piec inform view individu piec inform inform user move bottom hierarch structur switch view hierarch structur navig bottom structur typic problem switch read email person phone number contact list applic applic microsoft outlook activ desktop window ce devic integr common type organ requir user explicitli switch view modul order obtain desir inform applic paper aim integr step support quick retriev relat inform select interact constraint major differ desktop comput pda pda reli input implic interact design input slower make attract user manipul object displai stylu hand hold stylu cover part screen user ride pda slightli make manipul screen difficult accomplish ethnograph studi shown work feasibl requir user hand interact devic user mobil phone hand retriev inform pda input form introduc kei card enhanc track point devic make devic requir hardwar integr publicli pda commerci pda button hand hold devic button emploi limit instanc scroll commerci pda user interfac requir interact stylu oper interact style seemingli inherit oper desktop design input advantag present button explor interact button navig avoid problem requir navig achiev freedom order improv usabl situat user hand design control sole button pda fig constrain interfac control freedom forward context differ stationari mobil support user bring task problem stationari bring mobil devic mobil devic pda rare capabl stationari complet solut problem support activ main focu activ place technolog support implic applic pda support activ requir attent form user focu activ devic activ context sensit comput ad sensor provid function interest option futur develop illustr differ stationari mobil user typic work text pda comparison stationari stationari comput user work word processor order write full text pda short note meet phone call task accomplish typic usag illustr basic differ design object pda compar desktop comput order illustr interfac sequenc show typic interact system figur fig user find meet book user locat select contact list creat context view inform link includ past futur meet book email receiv task relat context user obtain inform detail list meet goldstein user present inform domain visibl tile fig click tile system set tile focu tile visual click focu tile stylu activ navig user navig individu data entri find user set meet tile focu tile fig activ navig view meet select meet tile overview system switch address book view navig view divid contact tile base letter repres number contact context tile black full focu tile fig similar user move focu tile click action control move focu tile contact surnam start contact goldstein identifi fig individu piec inform select order switch context view inform view context view fig visual resembl overview depict inform inform domain separ tile inform shown context tile select link object focu limit context inform user deem relev user decid inform object detail move focu tile examin meet user simpli move focu calendar note interact applic perform action control fig ensur step perform hand hold devic fig initi view applic fig overview focu fig initi view interfac design order creat integr user interfac design issu discuss solv address inform link inform view concept unifi present creat point support user inform coher navig inform type inform link order solv problem extens inform navig move individu piec relat inform find show inform type simultan system describ inform relat chosen piec inform inform link introduc solv problem inform link simpli connect piec piec inform belong inform domain inform link enabl collect piec inform form heterogen context object user preserv homogen structur inform domain inform link form semant layer relat object data type top storag data type inform link differ hyperlink present web defin context piec inform strategi link connect object repres semant properti frequent research field linguist wordnet semant type connect provid inform link design user determin piec inform link fig focu letter fig context view entri goldstein select fig context view focu calendar criteria make flexibl enabl user adapt visual respect environ applic make user perform addit action order establish effort made advanc leisur inform view inform view collect correl object displai user activ object activ chang depend action activ includ switch inform view inform view identifi independ current state object inform view present type distinguish design function support user complex task requir applic inform present encyclopedia individu countri inform except static present present give collect type map show geograph box demograph text bodi describ religion provid inform overview countri type inform present applic design support user inform meet categori inform show inform select inform present select inform task complet made design inform view easier visual base experi work flip zoom visual techniqu includ appli small screen decid base inform view flip zoom visual flip zoom belong class inform visual techniqu call visual central present detail simultan present contextu inform surround area flip zoom divid inform number rectangular tile denot focu tile remain context tile creat inform view flip zoom object inform view simpli map tile flip zoom visual tile select focu displai area user chang tile focu random access method stylu tile order object focu navig focu tile user detail present inform chang inform view select enabl explor point hide tile immedi chang inform view flip zoom techniqu hierarch visual abil inform visual natur map inform applic structur inform view node hierarchi task handl inform view present order order determin order inform view present inform top inform view present chosen piec inform bottom hierarch flip zoom techniqu navig select meet requir devic ordinari desktop show inform visual hierarch flip zoom visual simultan approach suitabl pda limit displai area pda made imposs intellig show inform view simultan inform view design user inform surround inform view add inform vital distract user lower usabl applic limit applic show inform view gave idea global context consist inform order local context view solv task view note limit differ present inform type priorit possibl show inform type applic descript inform view categori inform view creat overview inform view show summari inform inform type user select piec navig view number object detail inform creat navig inform domain context view present inform select user fig model inform view overview present top level hierarchi overview present inform inform type object repres separ type inform task meet user select switch navig view inform type object fig flow model interact applic navig view select inform domain user present navig view view show inform domain abstract order object natur inform domain user move navig view present select part inform view user task region item inform navig view provid user structur navig select individu piec inform handl inform group navig view creat inform domain previou usag navig navig view case inform domain structur hierarch user move navig view select piec switch context view flow scheme interact chang focu overview context fig depend amount inform structur number navig view requir domain case navig view creat handl dai email navig view separ draft email requir explor inform visual deem creat numer navig view inform domain situat amount inform requir navig easili incorpor applic fig interact flow scheme context view user select individu piec inform bottom level navig system switch context view select piec displai inform link inform link meet context view show inform peopl email receiv task meet mix inform domain problem navig inform system move relat piec inform type reduc type inform displai vari depend piec inform user context view design show individu piec inform domain simultan ad benefit context view navig view user evalu order evalu interfac benchmark standard applic bundl window ce sixteen paid student women ag task perform system user situat main differ situat user told hold mobil phone perform inclin user navig prior experi pda familiar window oper system stationari comput experi conduct usabl lab ericsson research sweden system pass set usabl complet task user task solv task solv window ce bundl statist effici usabl evalu show user perceiv arrang inform significantli applic user receiv descript minut freeli familiar interfac differ task complet time found main problem identifi interfac user standard graphic window inform view area button user util navig offer action situat navig led physic discomfort hold mobil phone conclud remark mobil user access inform interfac design work support fashion inform link inform view offer solut present navig inform devic small break tradit concept applic inform type support navig retriev inform entir applic due restrict freedom interfac featur subject evalu argu navig context user hand occupi restrict freedom interact usabl evalu show applic usabl complet novic user comparison window ce applic bundl inform view inform link applic briefli explor work futur work fulli valid gener usabl concept evalu identifi improv interact address futur research identifi basi applic organ commun inform explor futur acknowledg author magnu goldstein usabl lab ericsson radio system perform evalu research fund swedish institut inform part effect displai strategi small screen project mobil informat research program refer hierarch flip enabl parallel explor hierarch visual proc avi pp acm structur access integr inform small screen ext abstract pp acm le framework visual proc ieee inform visual pp ieee web browser small termin proc acm uist pp acm inform visual read inform vision pp morgan kaufmann san electron lexic mit gw gener view proc chi pp acm le visual flip zoom zoom browser ext abstract chi acm input devic mobil inform proc chi pp acm make empir explor hci mobil proc acm md review taxonomi present techniqu acm transact vol pp acm mit gg rich interact digit librari commun vol pp acm tilt oper small screen interfac acm symposium user interfac softwar technolog page acm mh graphic view commun vol pp acm comput applic workshop mobil comput system pp santa ieee comput singl hand kei card mobil devic proc chi pp acm event horizon user interfac model small technic report sun microsystem parctab ubiquit comput experi technic report xerox palo alto research march
ML/800 6 learn markov process kevin murphi depart comput scienc berkelei ca usa dynam probabilist hidden markov em kalman lter introduct abil predict fundament intellig system gener hope make perfect make adopt probabilist approach reason predict exact price stock predict expect deviat model assum result unknown factor omit model standard predict problem mathemat model system predict dynam system dynam system assum time step state system determin state transit restrict attent discret time dynam typic exact dynam probabilist state transit jx probabilist formul learn model data state discret continu predict probabl stock case predict expect case ir state vector state partit input variabl output variabl hidden latent variabl variabl directli control denot figur learn model kind start special case publish encyclopedia cognit figur gener dynam system repres dynam bayesian network bayesian belief network de hidden output shade node clear node hidden squar node xed input round node random variabl notic depend action model activ percept figur convert order markov model rst order markov model variabl observ case observ part system goal predict consequ action reinforc repres intend action extern input goal predict behavior omit input variabl focu notat techniqu gener easili remark markov properti implicit assum state current inform predict past irrelev write jx posit integ futur independ past made true augment state space appropri figur exampl fulli observ model discret state markov chain nite state markov system probabl transit state state speci ed transit def jjx independ call homogen markov assum initi state distribut speci ed def probabl satisfi constraint row matrix call stochast simpl nite state markov chain bigram wide statist approach natur languag process set goal predict word previou model word predict trigram goal learn jx section nite state markov chain markov process wide reinforc learn state transit input input discret write jjx input speci es transit matrix repres figur omit observ node assum directli observ model partial observ maximum likelihood estim train set goal learn maximum likelihood estim ml def arg max train data independ express likelihood comput likelihood individu likelihood likelihood number time state transit observ train def tn indic function event de ned analog number time rst state observ maxim introduc lagrang multipli enforc constraint simpl calculu yield intuit result paramet estim bayesian estim problem maximum likelihood estim assign probabl event train call problem case bigram model set word train corpu phrase ml paramet estim assign probabl test sentenc intuit probabl sentenc simpl solut data problem comput maximum posteriori estim ml map def arg max rule reason posterior condit likelihood prior likelihood assum row transit matrix independ multinomi random variabl prior suitabl prior dirichlet write hyper paramet intuit interpret term number time transit observ prior train set show map estim intuit form uninform prior laplac ect prevent estim data complex cluster word similar hierarch prior map estim comput point estim paramet valu fulli bayesian solut comput distribut paramet valu comput con denc estim activ onlin updat paramet estim step time dirichlet distribut conjug prior multinomi likelihood mean appli form posterior mode posterior map express sequenti bayesian updat consist simpli updat pseudo count observ transit applic onlin learn import figur coupl markov chain higher order markov chain mention kth order markov model convert markov model creat size state space mean number paramet estim exponenti amelior smooth hierarch prior approxim condit distribut jx mixtur bigram model learn paramet mixtur model em algorithm section problem number step histori call model order simpl model select basic problem train data larger number paramet result tting machin learn discuss approach model cheaper approach model maxim penal arg log ml estim paramet model dm number paramet complex penalti popular choic penalti function inform criterion bayesian inform criterion log number minimum descript length bic factori markov chain cartesian state space state fact discret state variabl figur illustr case situat frequent ai state world repres kind dynam bayesian network variabl state fulli interconnect model requir paramet variabl paramet model easier learn term number sampl sampl continu state space common form markov process continu state space random repres linear system wide studi special case linear case write ax write jx ax notat mean evalu normal probabl densiti function covari point distribut initi state estim paramet linear system techniqu base linear regress system usual approach learn dynam system repres function feedforward neural network creat train set matric row input row output denot vector learn backpropag conjug gradient method estim paramet set covari matrix residu higher order model easi convert linear model model process order repres model def def estim block separ contrast case discret state space discuss section number paramet linearli exponenti common aic score metric discuss section softwar packag tap delai feed window time slice exploit prior knowledg success input vector highli chosen partial observ model predict speech vector encod instantan power signal di erent frequenc band approach build model directli predict function model larg number paramet altern approach infer word person base acoust predict word nalli predict sound work phonem phonem acoust su er data problem mention section basi hidden markov model approach speech recognit prove success practic discuss learn model section reason model hidden variabl interest infer hidden signal predict signal bayesian network bayesian belief approach build gener model observ signal map figur appli rule causal infer jy discuss em algorithm paramet learn system identi case partial observ model harder case fulli observ model likelihood surfac multipl maxima approach gradient ascent simpler ectiv expect maxim algorithm neal em converg local maximum likelihood work roughli rst perform probabilist infer estim hidden state observ sequenc estim valu hidden variabl order updat paramet techniqu discuss section infer valu depend paramet hidden learn call infer subroutin learn method infer algorithm disadvantag requir paramet enforc constraint explain em algorithm detail discret state hidden markov model hidden markov model partial observ markov process dynam hidden variabl model standard markov chain section observ variabl function figur input speech ir assum distribut gaussian mixtur paramet determin hidden state yjx observ model jjx complet sequenc log log log jx log jx trick discuss section rewrit term log similarli term expect respect hidden variabl current paramet set log log omit term involv simplic term insid squar bracket expect number time def comput expect sucient statist updat paramet analog fulli observ case paramet recomput converg case em algorithm algorithm explain comput def def time space dynam program forward comput def jx jx jjx notic algorithm kei comput jy combin likelihood jx updat estim jy make diagon matrix def rewrit step algorithm simpl backward comput def jx jjx jx jjx jx jx rewrit simpl ab combin result forward backward step obtain def jx def jjx jx jx ess comput similarli term viterbi algorithm task speech recognit applic comput probabl state arg jy viterbi ident forward replac oper max classifi sequenc hmm normal constant comput equal likelihood jx classifi sequenc train spoken digit test sequenc comput likelihood hmm gener classifi digit hmm higher likelihood rival model factor state space creat partial observ version kind factor model discuss section yield model coupl hmm factori hmm figur state space exponenti number exact infer model intract time exponenti approxim infer figur factori hidden markov model hidden state repres distribut term priori independ discret random observ output hidden variabl explain phenomenon bayesian belief cost exact infer model grow exponenti number hidden variabl continu state space linear system kalman lter linear dynam system gener form ax cx independ random variabl repres gaussian figur kalman lter algorithm comput jy ld analog forward algorithm hmm kind claim analog brain term visual perform estim hidden state base quantiti jy algorithm comput jy analog algorithm hmm paramet estim em rt algorithm subroutin comput requir expect sucient statist gener rt algorithm time ir ir algorithm invert matrix store covari matrix system harder system nonlinear typic resort approxim method popular method comput jy onlin particl ltere extend kalman lter comput jy gibb sampl extend kalman smoother infer routin subroutin step bayesian estim em gradient ascent attempt comput ml paramet bayesian treat paramet random attempt comput distribut comput jy onlin model paramet repres hidden variabl fall categori infer discuss section discuss varieti increasingli complex model learn rang simpl count markov iter em algorithm partial markov model model proposit state work higher level model repres world term object relat ecient learn reason probabilist dynam model major open problem ai rst refer track data associ academ press adapt probabilist network hidden variabl machin neural network pattern recognit clarendon press plan control morgan kaufmann optim statist maximum likelihood incomplet data em algorithm royal statist seri linear system ax add state space updat equat function de sequenti mont carlo method practic springer verlag learn dynam bayesian network adapt process sequenc data structur lectur note arti cial page markov chain mont carlo practic chapman hall tutori learn bayesian network learn graphic model mit press system identi theori user prentic hall hierarch dirichlet languag model natur languag hidden markov model linear dynam system technic mit view em algorithm justi es increment variant learn graphic model mit press approxim infer probabilist languag ijcai tutori hidden markov model select applic speech recognit proc kalman lter model visual cortex neural learn nonlinear dynam system em algorithm kalman filter neural network wilei mix memori markov complex stochast process mixtur simpler machin bayesian framework reinforc learn intl conf machin learn
DB/801 3 exploit version handl updat broadcast disk pitoura depart comput scienc gr greec pano chrysanthi depart comput scienc pittsburgh pa usa abstract broadcast attract attent mean dissemin inform larg client popul wire wireless set exploit version concurr client transact presenc updat altern medium store older version broadcast current client local older version maintain local part server maintain client form materi view techniqu scalabl provid consist direct commun client server perform result show overhead maintain version provid concurr introduct data deliv server client wide rang emerg applic benefit broadcast mode data permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb work support part nation scienc foundat grant dissemin server repetit broadcast data client popul specif request client monitor broadcast channel retriev data item arriv broadcast channel applic typic involv small number server larger number client similar interest exampl includ stock electron commerc auction electron traffic control inform system concept broadcast deliveri earli work conduct area system previou work includ project bellcor boston commun inform system circul high bandwidth network user queri filter relev inform special massiv parallel transceiv broadcast inform fm channel client person comput equip radio receiv data dissemin broadcast attract attent due physic support broadcast provid increasingli import class network environ wireless comput includ cellular architectur satellit network data intens applic result scalabl mean provid inform larg client popul motiv dramat improv global connect popular internet system continu sophist client applic requir read current consist data updat server current updat treat context cach updat consid term local cach transact semant transact broadcast discuss project special hardwar detect valu read ensur consist architectur extend case distribut site broadcast content fragment resid site recent work involv develop correct criteria transact broadcast environ broadcast medium transmit concurr control relat inform client part transact manag undertaken client previou work compar studi suit techniqu ensur consist client transact broadcast environ maintain multipl version item concurr client transact version combin invalid report inform client updat ensur currenc read assum updat perform server dissemin currenc consist valu read client preserv requir client contact server altern mean store older version potenti storag medium older version broadcast current valu introduc protocol interleav current previou version determin frequenc broadcast version maintain older version client cach garbag collect version local inform activ client transact access requir exploit scenario maintain part server client form materi view aspect base relat air hybrid approach older version client main memori disk perform result show overhead maintain older version provid concurr broadcast item updat maintain version item number consist transact successfulli complet oper version broadcast size origin size depend broadcast organ overhead smaller remaind paper organ section introduc defin currenc present basic approach maintain correct section describ scheme relat issu section discuss broadcast server client broadcast data figur broadcast architectur version cach section discuss disconnect section present perform model result section conclud paper broadcast updat broadcast dissemin data server period broadcast data item larg client popul period broadcast call broadcast cycl content broadcast call client listen broadcast fetch data arriv data access concurr number client perform degrad access data strictli client wait data interest channel assum updat perform server dissemin broadcast model client listen broadcast continu read specif item select tune import case portabl mobil reli oper finit energi provid batteri listen broadcast consum energi select client prior knowledg structur broadcast util determin item interest channel broadcast form directori inform broadcast data client inform broadcast subsequ read techniqu broadcast index inform data smallest logic unit broadcast call bucket bucket analog block disk bucket header includ inform exact content bucket header depend specif broadcast organ inform header includ posit bucket offset begin offset begin offset begin client determin begin bucket figur currenc updat size broadcast fix data item correspond record assum user access data attribut search kei bucket item updat consist server broadcast item consist finit set data item state typic defin map data item domain denot defin set order pair data item valu data relat number integr constraint express relationship valu data state satisfi state consist violat integr constraint data item transact server updat valu number reason currenc data broadcast valu broadcast correspond current valu valu produc transact commit server updat server reflect immedi fraction call interv currenc interv assum item broadcast produc transact commit server begin current currenc interv current uniform updat immedi reflect currenc interv item figur depict currenc interv data item depend definit currenc interv adopt produc transact commit prior broadcast assum currenc interv item correspondingli client transact read data item currenc interv defin span client transact maximum number currenc interv read data defin readset transact denot read set item read read set order pair data item valu read correct criterion transact transact read consist data readset transact form subset consist state make assumpt transact manag server assumpt valu broadcast item produc commit transact set valu broadcast singl currenc interv correspond set subset consist state transact correct client transact read data valu currenc valu read consist inform readset transact queri optim emploi reduc transact span approach read base order item broadcast queri optim techniqu introduc addit read addit read execut read control branch approach cheap broadcast data air queri optim techniqu effect reduc span transact valu readset belong currenc currenc interv short invalid techniqu ensur correct transact transact read data valu correspond state achiev timestamp version number broadcast data item version number correspond currenc interv begin item currenc interv transact perform read subsequ test item read version item larger transact abort call method version method valu read transact correspond broadcast version method produc correct transact broadcast invalid report point invalid report includ list data item updat previou invalid report broadcast assum invalid report broadcast begin currenc interv set begin commit invalid method invalid rs lifetim method version method invalid figur currenc read maintain activ transact includ data item read client tune point read invalid report transact abort item invalid updat call method invalid method theorem invalid method produc correct transact proof currenc interv commit transact perform read oper ds state correspond currenc interv state begin claim valu read correspond state ds assum data item read ds invalid report transmit begin abort version transact read valu correspond state begin currenc interv perform read oper invalid read current valu begin currenc interv commit transmit invalid report begin currenc interv invalid report broadcast frequent addit transact read invalid report broadcast proof similar proof read addit invalid report item broadcast invalid report necessarili correspond singl state variat invalid transact read current valu time commit scheme invalid method prone starvat queri updat transact number optim mark invalid invalid report abort read data item transact successfulli maintain multipl version data item older copi item concurr control successfulli process transact tradit system basic scheme basic idea underli temporarili retain older version data number abort transact reduc version correspond valu begin currenc interv version number currenc interv length currenc interv number shorter currenc greater number version creat maximum transact span transact currenc interv perform read oper read current version largest version number subsequ data read version largest version number smaller equal version abort extrem current valu data item transact proce safe call scheme theorem method produc correct transact proof currenc interv perform read oper ds state broadcast interv show valu read correspond state ds consist correct data item read version largest version number recent produc begin currenc interv item ds term read state correspond currenc point version scheme invalid report variat method call invalid method read current version item currenc interv invalid read updat read version largest version number version abort theorem invalid method produc correct transact proof item read updat time ds state broadcast interv show valu read correspond state ds consist correct item read updat prior valu correspond state ds subsequ read version largest version number recent produc cycl item ds invalid read valu begin currenc interv invalid read valu correspond invalid permit currenc simpl cost broadcast invalid report updat cach reduc latenc answer client cach item interest local cach reduc latenc transact find data interest local cach access broadcast channel smaller number time assum unit correspond unit broadcast outlin conjunct cach presenc item cach stale approach commun updat client invalid combin form shown perform broadcast deliveri server broadcast invalid list page updat report invalid page cach invalid report page remain cach invalid page client fetch replac assum kind cach updat paper select propag frequent access page outperform easili combin techniqu support item cach version number read item perform test version number read item broadcast ensur item cach propag cach invalid report frequent propag invalid report data item cach page current correspond current currenc mark issu method easili enhanc handl delet insert item item creat version version number currenc delet special field indic item delet transact begin invalid invalid read version version number find item delet previou transact read version smaller version number desir item add version version number interv insert issu granular version maintain version maintain version bucket set invalid report bucket level implement invalid maintain transact set item maintain set bucket central number version maintain data item current valu item result fix size version item currenc interv discard older valu alloc space version maintain absolut number currenc maintain differ current interv interv current currenc interv interv version correspond currenc interv version number set max bit suffici version number possibl storag previou version cluster version item maintain consequ locat overflow older version store separ current version overflow bucket appropri link current version broadcast broadcast commit data maintain broadcast multipl version data item number older version retain properti server disk disk hot cold minor cycl chunk chunk chunk chunk figur broadcast server broadcast previou consist transact span smaller transact larger span proce possibl abort amount broadcast reserv adapt depend feedback updat rate server interrel problem broadcast organ place version determin optim frequenc transmit version broadcast disk organ specif item broadcast frequent frequenc version describ broadcast disk complet definit organ refer broadcast disk item broadcast divid rang similar access probabl rang separ disk figur bucket disk disk broadcast time disk disk achiev rel disk split smaller equal size unit call number chunk disk proport rel frequenc disk number chunk disk disk gener broadcast chunk disk cycl chunk sequenti disk minor cycl consist chunk disk figur minor cycl cluster cluster structur broadcast broadcast version item success older version hot item figur current valu hot item fast version cold data slow disk cluster work transact access version item equal probabl size size accommod version number chunk remain fix size depend hot data item relat item frequent updat largest hot item frequent updat version broadcast frequent item broadcast disk disk rel posit insid chunk due chunk size approach broadcast older version special locat insid chain current version overflow bucket pool overflow older version item broadcast end addit minor cycl end broadcast alloc version offset posit current item broadcast begin remain fix server recomput broadcast index broadcast cycl client local store directori locat data item broadcast locat posit broadcast index broadcast minor cycl carri overflow bucket pool transact locat version tune read index maintain pointer current version item point older version overflow pool read transact older pointer locat overflow bucket overflow transact read version penal wait end read version transact satisfi current version suffer similar latenc cluster overhead latenc due broadcast size equal divid transact minor cycl minor cycl current broadcast cluster updat addit minor cycl minor cycl minor cycl overflow bucket pool disk updat chunk disk figur broadcast multipl version drawback approach introduct addit minor cycl affect rel speed disk problem space alloc version multipl size minor cycl avoid older version slowest disk size slowest disk size chunk accommod version version chunk disk broadcast rel speed affect version disk disk creat hold version rel frequenc disk current version simpli multipli frequenc posit number slow disk carri version time slower disk current version broadcast organ current version consist disk speed disk speed disk speed creat disk disk place version assum current version broadcast time frequent version adjust rel frequenc disk disk speed disk speed disk speed disk speed size multipli figur show disk disk chunk creat version current item broadcast frequent version rel frequenc disk item disk broadcast time frequent item disk result size origin extra space version locat older version pointer current version approach adapt version faster disk transact slower disk transact current valu cach client cach provid altern storag medium older version data item version cach entri item updat cach entri entri insert cach version data multipl entri version number assum cach replac polici page replac data version cach recent method invalid method avoid broadcast version number item version number cach item currenc interv item insert cach larger equal currenc interv item updat variat invalid method invalid currenc interv transact read item broadcast read item cach continu oper long version cach version number version insert cach prior invalid effect cach size part cach maintain version item transact read older version found cach number older version properti number version characterist client tion client vari span client adjust space cach alloc older base size requir type local paramet garbag collect maintain cach oldest reason maintain version read invalid transact page replac invari page replac data version cach recent assum invalid method hold simpl begin point transact place invalid point set activ invalid transact item read subsequ updat currenc interv correspond state read invalid time transact list ascend order transact invalid item cach version cach invalid item maintain previou version cach largest version number maintain version possibl il read test recal recent invalid point discard vr case transact invalid futur read newli insert transact current il read version version number smaller transact rm il finish item delet version rm condit discard version transact rm complet version version number condit version version number current rm recent invalid transact version version number rm transact invalid show condit correct version optim version show transact read case vr hold vr read version version condit case vr hold vr read condit read item version number smaller case condit recent transact invalid futur read current version show condit hold version delet case assum delet version version cach version number current read transact invalid futur point case assum delet version case assum delet version read page replac older version maintain page replac polici approach offer flexibl divid cach space maintain current version maintain older cach replac polici part cach approach percentag cach alloc older version adjust dynam suitabl organ approach overflow bucket version version part cach approach appli global replac page smallest probabl access version number cluster work approach maintain version item version number select addit discard cach xs version version number client store data interest local data defin maintain view defin base relat base data updat view stale updat view reflect base data call view mainten view mainten studi problem scope paper focu view term broadcast version broadcast scalabl assum server stateless server maintain view lieu client server awar view maintain client addit contrast assum direct commun client server client server comput view main advantag broadcast model base relat client storag overhead base relat air recomput view term commun messag maintain creat client transact call view mainten transact view mainten transact call recomput call instal updat local view part execut normal client transact concurr queri process client recomput view account updat depend currenc invalid method valu commit invalid method recomput view scratch increment techniqu local store index process queri span instal updat client read client proce concurr view version data line simpl view mainten server awar fact client maintain view overhead server modifi content broadcast import issu currenc local maintain view decoupl currenc broadcast data mainten transact run period updat occur invalid report trigger execut view mainten relat issu disconnect desir client monitor broadcast continu case client carri portabl devic seek reduc batteri power consumpt access broadcast minim access broadcast sought client disconnect common data broadcast deliv wirelessli wireless commun face obstacl surround environ interact heavili gener wireless commun reliabl deliv bandwidth commun client forc miss number broadcast cycl version free transact requir read invalid report transact toler miss invalid report client transact refrain listen broadcast number cycl resum execut long requir version air transact toler miss currenc interv broadcast toler scheme intermitt connect depend rate creation version item chang currenc transact interv cach improv toler disconnect disconnect oper transact proce read data long version found cach updat transact transact proce contact updat transact commun updat server certif concurr control updat transact easi provid snapshot isol introduc support number vendor outlin implement method updat transact client proce read abort valu item updat client maintain local transmit server certif incorpor includ subsequ broadcast interv certifi successfulli client updat transact record currenc interv init perform read case invalid currenc interv currenc interv ts record currenc interv commit complet oper complet client send server list item written commit interv commit initi interv init certifi transact commit init commit perform simpli check current version number item written snapshot isol serializ suffer write skew transact read item modifi result violat constraint updat transact transform system consist state snapshot isol consist read ensur serializ serializ stronger test requir updat check readset perform evalu evalu perform method respect paramet perform model perform model similar present server period broadcast set data item rang assum broadcast disk organ disk rel frequenc client access item rang subset item broadcast access probabl follow zipf distribut zipf distribut paramet theta model access produc access pattern increasingli skew theta client wait unit make read request updat server gener zipf distribut similar read access distribut client write distribut rang paramet call offset model disagr client access pattern server updat pattern offset overlap distribut client page frequent updat offset shift updat distribut item make interest client assum transact commit server server transact number updat read read oper time frequent updat read oper server rang follow zipf offset updat set server client maintain local cach hold page cach replac polici cach recent page replac page cach entri invalid subsequ currenc interv tabl summar paramet describ oper server client valu parenthesi default perform result due space present repres result show applic method figur show size broadcast broadcast organ scheme simpl scheme invalid cluster depend offset maximum hot item updat minimum frequent updat item cold version slow disk disk size broadcast doubl case version current item version addit shown case broadcast version slowest disk figur show transact abort due updat overflow pool transact wait end broadcast locat span probabl abort disk broadcast size effect doubl size updat rate updat correspondingli updat broadcast late currenc interv time larger pai read current data part cach space version result small concurr long run transact space alloc current version transact read item span abort rate older version secondari memori cach garbag collect result dramat space requir maintain version maintain version item size secondari storag data dissemin broadcast import mode data deliveri data intens applic cach replac polici cach invalid lru invalid disk rel item rang theta distribut theta distribut time client read broadcast number read vari offset access client item broadcast number updat server currenc interv cach broadcast disk paramet client paramet server paramet tabl perform model paramet broadcast size number version cluster max cluster min overflow pool disk number version cluster max cluster min overflow pool disk figur broadcast size figur left updat set figur percentag transact abort number version cluster overflow pool disk number version cluster overflow pool disk figur abort rate figur left updat set version abort rate figur updat set version abort rate maintain multipl version concurr transact presenc updat invalid report ensur currenc read approach scalabl independ number client perform result show overhead maintain version provid concurr refer zdonik broadcast data manag asymmetr commun environ proc acm sigmod intl conf manag pp zdonik dissemin updat broadcast disk proc intl conf larg data pp wong design broadcast cycl perform li evalu distribut scheme high perform distribut system journal comput barbara certif support transact wireless system proc ieee intl conf distribut comput barbara imielinski cach strategi mobil environ proc acm sigmod intl conf manag pp oneil critiqu ansi sql isol level proc acm sigmod intl conf manag pp goodman concurr control recoveri system bestavro document dissemin www ieee data engin architectur commun kumar adapt broadcast protocol support effici energi conserv retriev mobil comput environ proc ieee intl conf data pp franklin zdonik framework scalabl system proc oopsla conf pp gifford system mass digit commun commun gupta mumick mainten materi techniqu applic ieee data engin june data organ access ieee transact knowledg data alonso adapt cach invalid method mobil environ mobil network lori effici flexibl method transient version avoid lock transact proc acm sigmod intl conf manag pp pitoura chrysanthi scalabl process transact broadcast push proc ieee intl conf distribut comput pitoura data manag mobil comput kluwer academ quass widom view mainten proc sigmod intl conf manag pp silberschatz correct execut proc acm symposium principl pp ramamritham effici concurr control broadcast environ acm sigmod intl conf manag wong broadcast deliveri proc yan sift tool inform dissemin proc usenix technic conf pp widom view mainten wareh environ proc sigmod intl conf manag pp
IR/802 5 wrapper gener xml seo hci advanc institut korea yang choi depart comput scienc korea abstract inform extract process recogn fragment document constitut core semant content previou inform extract system effect inform sourc due difficulti acquir repres domain knowledg deal structur heterogen inher sourc order resolv paper scheme wrapper gener label document implement inform extract contrast previou wrapper learn repres domain knowledg wrapper xml document multipl parti facilit simpler implement wrapper gener exploit xml parser interpret show good perform web site domain real expect easili adapt domain plug domain knowledg introduct inform extract process identifi fragment document constitut core semant inform extract system reli extract rule tailor inform gener call order cope structur heterogen inher sourc wrapper defin program rule understand inform provid specif sourc translat regular form agent wrapper special inform sourc system extract rule written human manual wrapper construct scalabl human develop describ extract rule inform sourc newli creat structur chang user limit obtain compar inform inform sourc overcom wrapper suggest automat build wrapper learn set sampl page method wrapper technolog extract specif inform heterogen inform sourc previou inform extract system effect manipul inform sourc due difficulti acquir repres domain requir user involv prepar train exampl obtain extract yang order resolv paper scheme wrapper gener semistructur label implement inform extract automat gener wrapper inform sourc extract specif part inform appli wrapper sourc wrapper gener algorithm recogn mean logic line sampl document domain find frequent pattern sequenc logic line wrapper construct base posit structur pattern domain knowledg wrapper repres xml document approach modular flexibl provid formal wai repres extract facilit simpler implement emploi xml parser interpret inher xml fulli exploit make wrapper portabl sharabl multipl parti distribut environ adopt approach build hierarch tree html document user provid mean tree html document hierarch process exclud user involv wrapper learn domain process label html document demonstr effect figur architectur approach adapt learn extract rule domain consist real estat inform page sampl web expect easili adapt domain simpli plug domain knowledg paper organ section describ system overview specifi kind document handl section present xml domain knowledg section explain wrapper gener algorithm section describ implement evalu system result section conclud summari futur direct system overview system consist modul includ user shown fig interfac modul form user queri combin queri templat site user send site obtain search result page html form learner main learn modul gener wrapper site modul analyz content html page pass construct extract rule refer domain knowledg interpret modul execut learn wrapper extract specif part inform html page design handl label label portion data extract express label denot mean counterpart fig show search result page home real estat page document structur unstructur compon structur part includ descript displai format page label document descript number figur label document pair ba recogn label denot dollar number number valu note label domain knowledg domain knowledg describ relationship wide applic domain make weak reveal plai crucial role recogn semant fragment document domain paper scheme repres domain shown fig domain real estat domain knowledg singl domain repres structur construct structur list number valu target omit omit figur domain knowledg real estat domain extract object real estat domain includ price number number list uniqu id hyperlink detail pictur xml construct maintain object correspond price correspond bed xml construct object consist list term recogn exist object price object price mean line recogn price string describ data type object posit relationship ontolog term valu price data type price ontolog term wrapper gener kei function wrapper gener real estat domain learn format descript success search result page output html page list item express list item match sampl express consist attribut denot case real estat attribut includ number redund irrelev fragment ¥ note maintain separ modul ¥ remov wrapper learn find start end posit recogn pattern item descript wrapper gener divid convert logic determin mean logic find frequent pattern convert logic line html sourc search result page broken sequenc logic line logic line conceptu similar line user learner identifi detect html delimit tag html tag consid unnecessari remov fig compar origin html sourc page fig html sourc remov redund tag convert sequenc logic line figur logic line convert tabl categori number assign object categori number object price bed bath citi ml detail img gener text determin mean logic line phase algorithm determin mean logic line check exist object domain knowledg logic line recogn includ object conform definit logic line origin line divid subpart appli modul mean logic line repres data structur data structur describ mean origin line ontolog data type cat categori number assign type data type object defin posit relationship ontolog categori number assign shown tabl result data structur analyz sequenc logic line descript fig shown tabl find frequent pattern categor entir page express sequenc categori number phase algorithm find frequent pattern sequenc proce find candid candid pattern duplic attribut candid pattern price obtain frequenc candid pattern defin obtain number attribut defin calcul total number attribut defin note select pattern maximum pattern maximum select longer pattern sequenc obtain descript fig note descript sequenc sequenc tabl show statist candid pattern valu select pattern maximum pattern impli site present inform order pictur number number ml id hyperlink detail construct wrapper wrapper built base frequent pattern fig show wrapper home site shown earlier fig wrapper repres structur consist construct describ input queri scheme site order search result page inform structur includ url cgi search number html form detail construct discuss paper construct describ pattern obtain previou pattern search modul note pattern includ number singl xml construct built object found sampl page construct consist element specifi term examin determin exist denot delimit discrimin object specifi data type ontolog term object omit figur wrapper real estat site tabl result data structur logic line object line cat type format digit digit digit digit digit digit ml digit digit view url url tabl statist frequenc repeat pattern total number attribut candid pattern pattern frequenc number attribut total attribut pattern pattern interpret wrapper actual extract inform perform interpret xml wrapper build extract rule appli rule search result page interpret process depict fig implement evalu interpret implement java fig show screen shot interfac user search constraint price number fig show result convert logic line find frequent pattern fig show result interpret user queri fig interpret extract number number ml number test site real estat domain home yahoo real estat move era real estat gener wrapper site site fail learn figur process extract inform appli wrapper figur user interfac result convert logic line result find frequent pattern figur trace learner modul figur result interpret real estat displai search result tabl form satisfi condit label document produc correct wrapper success interpret fetch data site albeit recal collect data site domain evalu present inform extract system repres domain knowledg wrapper xml automat gener wrapper label document show good perform web site domain real expect adapt domain easi modif domain knowledg current limit work label function document work resolv tackl investig method build hierarch tree document recogn mean tabl element refer parent node test site domain progress evalu power practic aim build custom wrapper learn agent appli refer system construct tor internet sourc acm mod intern confer manag page merialdo structur data back acm sigmod workshop manag page blum mitchel combin label unlabel data confer comput learn weld scalabl agent world wide web intern confer autonom page vassalo wrapper tsimmi system acm sigmod intern confer manag page doorenbo wrapper induct inform extract intern joint confer artifici page kushmerick glean web ieee intellig han wrapper construct system web inform sourc sixteenth intern confer data knoblock hierarch approach wrapper induct intern confer autonom page riloff automat construct dictionari inform extract task eleventh annual confer artifici page soderland induc conceptu dictionari intern confer artifici page soderland learn inform extract rule free text choi shop agent automat construct wrapper semistructur onlin vendor lectur note comput choi scalabl comparison shop agent engin intellig system page
DB/803 3 persist improv oid index tempor system depart comput inform scienc norwegian scienc norwai abstract tempor oid index map oid physic locat object transact time tempor index object version index call object descriptor includ commit timestamp transact creat object version oodb updat object tempor updat time object updat shown potenti present persist cach approach reduc index updat lookup cost tempor oodb develop cost model show reduc averag access cost fraction cost primari context paper oid index tempor appli gener secondari benefici applic updat introduct transact time tempor system updat object creat version version access system permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb maintain timestamp object commit time transact creat version object import featur object uniqu identifi object identifi object access oid oid mean disk page object directli mean oid index map logic oid physic locat object logic oid reason index object version entri call object descriptor administr includ inform map logic oid physic commit timestamp larg typic size order size mean small part fit main retriev bottleneck effici access buffer strategi appli import differ manag version object updat object creat effici oper focu optim lookup updat time object updat object updat creat object delet previou od version insert index page low local uniqu part oid integ assign monoton result index updat bottleneck reduc disk index recent index page index page buffer page gener low probabl find od map oid physic recent index entri separ od shore oodb low local index separ od cach util memori space wast larg page small part od cach reduc index lookup cost extend reduc index updat cost od updat costli present approach reduc updat cost note main reason bottleneck low local entri tree intermedi disk resid buffer main memori call persist cach typic larger main memori smaller entri manag lru main memori cach addit reduc updat reduc lookup cost reason reduc higher local compar tree node higher local mean disk oper read write od tree effici paper describ analyz perform cost function studi optim size buffer node main memori optim perform note primari context paper oid result relev entri access cost index entri cach gener secondari index organ rest paper section give overview relat work section describ object index manag section describ section develop oid access cost section cost model studi memori index access pattern affect perform section conclud paper outlin issu research relat work tempor system gener immatur case transact time awar prototyp tempor oid perform result present small index fit main expect larger number bottleneck similar hierarchi index import differ entri level regularli move support version exist tempor oper lru improv write read effici cost model paper base previou work model oodb tempor oodb model extend includ aspect buffer tree model compar simul result detail result simul index buffer index page access found object index manag start descript oid index version manag outlin base exist design close make integr current oodb basi oid index tempor oid index tradit realiz hash file od oid kei version access current version effici access read current effici od repres current version od repres histor object previou problem time version updat index link list version object access type version object oid effici altern access valid time costli object chain approach index index current previou version effici access method suitabl search rang oid search perfect assum current version flexibl combin kei rang time rang impli extra high lookup cost current version object search assum od object store includ commit time time concaten oid index kei od oid cluster leaf sort commit time search current version oid retriev time interv oid effici object oid od append index tree case monoton oper effici object od version insert tree note ineffici typic tempor queri addit secondari index good candid support navig main featur oodb compar relat system optim variant nest tree focu elabor subject tempor object manag space alloc object updat object impli object previou version object physic locat version previou updat object creat delet assum access current version object access effici benefit object current object previou version histor object updat previou version move histor version store current updat time object updat long modifi od written log updat immedi postpon checkpoint od written log index page written disk buffer replac data interest current version improv system made awar object defin version object updat costli updat object modifi import oodb effici support tempor data reduc perform applic util featur persist index entri cach od access uniformli distribut index leaf node od cach make read good object cluster includ histor object current object studi implic result studi updat object necessarili necessit alloc space updat disk main memori node buffer od cach figur overview index relat main memori buffer node node buffer cess od updat checkpoint interv resid leaf node low local mean leaf node updat index node instal read node larg access node random disk instal read costli reduc averag access persist cach subset entri goal frequent od contrast main memori cach od write entri back checkpoint interv main provid intermedi storag area persist od size gener larger size main smaller size content maintain lru mechan result high local access reduc total number instal make checkpoint costli averag lookup cost avoid denot index tree combin index entri illustr figur organ index relat main memori illustr figur number node small make store pointer node main memori copi od node access order leaf node node rang node store interv oid vulner skew avoid partit dynam chang oid rang boundari main base updat access rate node high updat access rate node result smaller interv alloc node node frequent repartit repres extra cost repartit neighbor node resid import note read node random disk node cluster random read node small seek time node read request elev cost read low lru manag node oper similar ordinari main memori entri store node exist entri discard provid access access tabl maintain bit entri clock algorithm lru approxim access bit set time entri access storag access access tabl node store node problem node discard main memori entri node written back entri chang desir access tabl maintain main main memori resid node node due buffer tabl discard problem access bit map approxim entri discard access tabl maintain main memori node problem tabl node size tabl small bit entri repres problem long larg system content access tabl wrong cach system restart affect perform startup od commit oper safe disk reduc amount wrong cach startup store access tabl node node written disk note differ option node written back updat od store node base observ conclud maintain access tabl main memori node approach addit access node tabl track statu entri respect dirti bit entri dirti bit set time entri modifi insert node dirti entri written back entri mark modifi safe discard updat oper emploi insert od result object updat entri directli insert od impli discard od base lru strategi prefer discard synchron dirti entri avoid high probabl slot dirti entri regularli copi asynchron background effici sequenti read sequenti instal read subsequ write node object creation object creation appli directli od result object creation effici append oper case od part hot retriev node discard buffer od access insert read oper read oper belong navig scan oper singl object read read oper check entri access od cach found search search result disk access actual node buffer rang candid disk access access result disk access node buffer od insert od cach od insert od immedi note candid node resid probe search od manag high hit rate optim od cach size small case note od addit entri dirti entri result updat oper instal insert od discard od cach good memori space od od cach candid node resid discard probe insert od insert entri updat oper reli od cach frequent access effici updat strategi delai updat mean entri collect batch updat option depend access pattern instal read option make od retriev read oper insert case option option paper scan oper scan oper treat singl object read singl scan oper make current content discard od retriev scan oper gener chanc collect repres hot set number od retriev larger number od fit scan hit probabl similar gener buffer manag case scan oper scan oper updat consult recent updat od actual resid content physic cach cluster page extra cost read relev page margin updat write dirti entri background read instal dirti entri node number sequenti read write scan avoid buffer node access oper affect rest buffer make node remov buffer rate tune question give higher frequent probabl node full dirti entri reduc probabl synchron higher prioriti mean disk bandwidth node smaller number dirti entri od updat penultim dirti od instal checkpoint period case period time content node written back short avoid overflow dirti od buffer buffer share node necessarili give optim perform access pollut result low hit rate node avoid separ buffer pin number upper level advantag strict lru optim buffer node index tree analyt model analyt model research cost cost reason cpu process parallel make cpu cost amount main memori necessarili cpu cost easili incorpor analyt orthogon issu discuss paper cpu cost affect qualit result import aspect amount main buffer characterist buffer space reflect model tradit disk cost read block disk sum start cost start transfer cost transfer averag start cost set time disk revolut transfer cost directli proport block read disk track transfer cost equal block size amount data track total time transfer block start transfer index cost reduc partit index disk declust node node disk straightforward time read write random index page tp sp index page size cost read write object log oper cost independ index separ issu orthogon studi paper focu reduc access time reduc access time disk space disk capac expect extra space worthwhil illustr figur amount reserv index page buffer reserv od cach assum size od od overhead byte entri od number entri fit od cach approxim od hash tabl clock algorithm lru number index page fit buffer approxim page memori disk address node oid rang boundari lru access tabl occupi total sp od number node index entri access model assum access object system skew object access assum partit rang oid partit size access probabl illustr bottom figur store model stabl total object version index note section oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid leaf node logic view tree base oid physic view map root node figur oid index lower part show index logic upper part index realiz physic arrow entri distribut leaf node perform depend number exist version total number version analysi model access satisfactori analysi major shortcom estim number distinct object access higher number distinct access object real system reason insid hot spot area smaller higher access probabl import tempor access small number current version larg number previou hot spot area smaller typic reflect model index tree size assum index tree space util number leaf node tree od fanout intern node size entri intern node number level tree tree number node level tree tree tree total number node tree tree tree buffer perform model buffer model extens dan dia lru buffer model due space present import aspect model detail descript found bdd model size data granul partit partit fraction fi data ff access partit distribut partit assum access assum independ denot partit set ff fi fi short actual od access partit set bdd steadi state averag buffer hit probabl denot buf number data granul fit buffer buffer hit probabl data granul belong partit denot buf bdd model calcul total number distinct data granul access access distinct od cach hit rate access od cach assum follow assumpt bdd independ random request appli model object entri data probabl od cach hit buf gener index buffer model bdd lru buffer model model access model buffer hierarch access complic search leaf page consid random node access tree independ extend origin model analyz buffer perform case hierarch index access base observ level tree access probabl root leaf tree initi partit partit size tree tree number index page level tree access probabl partit account hot divid leaf page partit fraction fi li leaf access probabl ff li rel leaf page partit partit size fi li tree access probabl ff li partit hot spot leaf page level make access node upper level long fanout suffici hot spot area treat access node upper level uniformli distribut level partit illustr figur tree level leaf page partit partit partit node node figur access partit index page access model assum low local index page oid entri partit cluster index illustr figur leaf node index entri unrel entri partit mean access pattern leaf node access pattern logic view initi od partit od access basi deriv leaf node access partit hit rate denot probabl od actual page memori disk number od node sp od total number od fit sp od probabl od node approxim buf buffer model share main memori page model reflect access probabl node node lru manag hit rate buffer partit illustr figur level tree leaf node partit divid reflect exist hot spot node belong leaf node partit physic adjac page lookup access lookup access lookup result averag page access total access probabl ff pc pc fraction access page part partit access probabl ff idx pc pc total number index page tree fi pc tree fi idx tree tree page partit partit partit denot result partit share denot node buffer hit probabl buf pc pc buf tree share buf idx buf tree share note section advantag separ buffer pc buffer page reserv buffer page reserv pc denot tree partit tree buffer hit probabl separ buffer buf pc pc buf buf tree tree lookup cost assum address page rang partit disk access lookup page read replac page dirti read od insert immedi page written back alloc space node number node read time schedul dirti empti slot read extra write cost margin compar read time pointer node written back place time approxim lookup cost lookup pc buf pc access entri level root leaf page buf disk access averag cost lookup lookup buf probabl oid entri request od access probabl pc entri access averag cost retriev entri interest note thing file system base lookup lookup pc lookup updat cost updat index page immedi updat probabl updat index page written back calcul averag index updat cost total index updat cost divid number updat defin checkpoint interv number object written checkpoint number written includ creat updat object written object creation written object updat exist object assum od cach larg dirti od checkpoint delet compact page background mean strategi write larger amount od log instal od instal search log check log recent version creation od object descriptor creat object creat number creat object ncr object od append index distribut entri node rightmost node cluster updat object creation directli contribut ncr od creat leaf page index height sn hs page total cost creat object descriptor cost write sn index page disk instal read page assum disk page written sp modif exist od object object version od insert number updat object checkpoint interv nu ncr od insert page number updat checkpoint interv larger number effici updat read sequenti number updat write continu segment assum high assum insert entri entri remov cost write pc sp number node cost slot entri insert run continu background period round ideal long node full dirti entri process cost equal read number node write dirti entri back assum node full process entri write back node dirti fill amount dirti entri node ideal close avoid delai normal process due overflow dirti entri suffici calcul paper number updat object round call super checkpoint period updat index involv page instal page version resid read page buffer cost lookup distinct object modifi number distinct updat object distinct note section object tempor denot fraction data access tempor object tempor updat object alter updat nontempor object number distinct updat tempor object du tempor number leaf page access part instal nm distinct du tree space od leaf node insert node written back space node process possibl root node parent node updat possibl page determin updat cost difficult suffici entri index probabl page split small neglect insert page gener updat object checkpoint rememb updat creat entri insert includ page split cost function probabl split order approxim split od page written updat parent node note split affect parent written back result total write back cost split nm split equat assum averag entri insert leaf node case long checkpoint interv suffici effici read complet updat index write back memori larg read write sequenti cost tree sp lookup idx averag index updat cost averag index updat cost object total cost updat divid number updat updat write pc note total super checkpoint updat object creat cost ordinari checkpoint period access cost system lookup cost lookup lookup write back od checkpoint interv similar write back ncr entri make difficult effici averag updat cost updat set fi fi fi ff ff ff tabl partit size partit access probabl partit set studi calcul equat ncr calcul calcul buffer hit index page buffer absenc memori pointer tabl perform studi deriv cost function calcul averag cost access system paramet access section studi valu paramet affect access condit optim size mix updat lookup affect optim paramet studi denot probabl oper write write averag index access cost averag cost index lookup index updat access write lookup write updat goal minim access measur gain optim paramet gain access access access access access cost rest give size fraction size difficult kind access pattern experienc predict base current access support tempor featur applic develop util wai access pattern paper necessarili repres show gain condit access pattern access pattern partit size access probabl summar tabl oid access pattern index page access pattern partit extens paramet kb ms sp kb od paramet mill write tempor tabl default paramet hot spot partit hot spot hot cold area partit set resembl access pattern close expect futur larg cold consist version set analysi hot spot area result number section base calcul default paramet summar tabl note talk main memori index relat main memori object page buffer orthogon issu valu tabl od occupi gb store compactli object occupi time space reflect main memori mb impli total buffer memori mb investig index memori interv mb dynam area access show avail larger amount memori affect perform effect figur illustr typic cost involv default index memori size gain benefici rel small index memori size compar total index size index size gain show section gain larger main memori optim size optim size illustr left figur access pattern note paramet combin section repres averag occur write read oper situat adapt tune system paramet set differ system tune cost index memori mb cost index memori mb index memori mb figur access cost emploi access pattern index memori mb index memori mb index memori mb figur optim size access pattern left effect updat ratio access pattern access cost emploi emploi larg index memori size index memori reserv od store pointer lru tabl hot spot smaller store hot spot area effect updat ratio main updat perform illustr middl figur show gain valu effect larger amount memori figur illustr benefici larg main memori buffer minimum gain mb gain gain gain slowli amount main memori effect page size page size import factor determin index perform optim page size contradict factor low larg page size mean wast space index page optim page size smaller small page result higher tree case upper level index tree resid tree smaller page size reduc buffer hit probabl strategi larg advantag creation small captur fact low level share studi optim page size access page size kb kb show small page kb block commonli benefici separ buffer analysi separ buffer analysi show cost reduct typic found import accur buffer partit assum knowledg current access pattern difficult practic lru buffer manag margin improv separ advic separ buffer futur work paper improv perform reduc number disk oper index mainten develop cost model analyz improv perform characterist access memori index size result show oid index cost reduc gain larg gain good optim size optim tune system import access pattern system system detect tune size index page buffer od cach size cost model paper valuabl optim automat tune tool strategi lru tabl updat strategi read oper issu interest work combin strategi dynam adapt perform improv make system vulner rapidli chang access pattern variant data skew paper improv oid index applic gener secondari interest applic updat low local acknowledg discuss construct comment refer dia simpl analysi lru buffer polici relationship buffer transient ninth intern confer data kossmann perform evalu oid map techniqu vldb time index monoton tempor design implement publish lomet salzberg access method data acm data manag file structur prentic storag manag method object system phd weikum perform histori data access method vldb tempor object storag intern workshop expert system analyt studi object identifi index intern confer expert system optim oid index cost tempor system intern confer foundat data analyt studi object identifi index technic report idi norwegian scienc suzuki develop perform analysi tempor persist object store australasian ullman principl system comput scienc
DB/804 3 descript logic inform integr diego giusepp de maurizio lenzerini dipartimento di informatica sistemistica di roma itali lastnam abstract inform integr problem combin data resid di heterogen provid user uni ed view call mediat schema mediat schema reconcil view queri user task system free user knowledg data data structur sourc discuss data integr describ approach data integr logic descript logic famili model inform manag integr formul queri pose perform type autom reason support queri answer process speci descript call speci calli design applic illustr dlr model mediat schema integr semant data nalli support queri answer process mean reason method introduct inform integr problem combin data resid di erent provid user uni ed view call mediat schema mediat schema reconcil view queri user task data integr system free user knowledg data data structur sourc interest kind system continu grow year organ face problem integr data resid sourc compani build data data resourc plan system address problem integr data world wide web subject investig project nowadai applic requir access legaci system deal problem integr data store di erent sourc design data integr system complex di erent includ heterogen relat mediat schema limit mechan access materi virtual data clean process queri express mediat schema problem sourc typic mean adopt di erent model system store data pose challeng problem mediat schema goal design schema provid abstract data resid sourc aspect deserv special attent choic languag express mediat schema schema mediat di erent overlap languag provid exibl power mechan refer detail discuss subject work paper formal famili descript logic mediat schema regard problem basic approach relat sourc mediat schema rst call requir mediat schema express term data sourc concept mediat view data sourc mean speci ed term data resid sourc call requir mediat schema speci ed independ sourc relationship mediat schema sourc establish de ning sourc view mediat schema mean sourc term concept mediat schema clear approach favor extens integr set mainten ad sourc system requir provid de nition necessarili involv mediat schema ad sourc typic requir chang de nition concept mediat schema rest adopt approach comparison approach report problem refer happen sourc present limit type access support typic web sourc access form eld necessarili lled user situat model sourc relat support queri select column suitabl notat situat consequ access limit queri process integr system investig paper problem deal criterion account design data integr system respect data explicit manag follow di erent call materi virtual materi system comput extens concept mediat schema replic data sourc virtual data resid sourc access queri replic integr system materi problem refresh materi view order major issu deal virtual approach construct mediat schema concern intent level data integr problem refer number issu integr level rst issu context interpret merg data provid sourc interpret data regard task cast common data return sourc provid data integr system request inform complex reconcili step due mismatch data refer real world error data store inconsist valu repres properti real world object di erent sourc task literatur data clean interest reader refer detail subject problem concern import issu data integr choic method comput answer queri pose term mediat schema queri answer approach typic reduc integr system base approach resort sophist queri process techniqu main issu system queri term suitabl set queri pose sourc reformul crucial step decid queri mediat schema set subqueri base mean sourc term concept mediat schema comput subqueri ship result assembl nal answer rest concentr problem queri process data integr system speci ed mean present rst provid logic formal problem illustr gener architectur data integr mediat set queri queri process set formal de ned problem answer queri view comput answer queri basi extens set view observ data problem relev includ data wareh queri optim support physic data independ instanti gener framework case view queri express make logic languag mediat schema express term knowledg base constitut gener assert membership formul express descript logic queri view express datalog predic bodi concept relat knowledg base speci ed provid extens exact respect view de nition assumpt data integr mean sound view correspond inform sourc produc necessarili answer queri complet view model sourc produc answer exact view produc answer queri illustr techniqu problem answer queri view set rst describ formul problem term logic present techniqu check logic implic worst case complex paper organ section present gener framework section illustr descript logic set architectur data gener framework section present method queri answer view architectur section describ work problem answer queri view section conclud paper framework section set logic framework data integr assum work relat refer relat alphabet alphabet constitut set predic constant symbol predic symbol denot relat constant symbol denot object store relat adopt uniqu assum di erent constant denot di erent object db simpli set predic symbol alphabet relat predic symbol constitut set tupl object satisfi relat main compon data integr system mediat queri compon express speci languag alphabet mediat schema express schema languag ls sourc model view mediat express view languag lv queri issu mediat express queri languag lq provid speci cation compon data integr system mediat schema set express languag ls alphabet languag ls determin express schema constraint satisfi constitut constraint fc cn db sati es constraint cn sati ed db sourc model term set view fv vm mediat schema view de nition def term queri express languag lv alphabet ariti determin ariti view set tupl inform extens content sourc ariti tupl speci cation assumpt adopt view interpret content sourc respect actual set tupl db satisfi describ possibl queri express languag lq alphabet intend provid speci cation data extract virtual repres integr system queri db denot set tupl db satisfi speci cation determin accur knowledg pair satisfi accur sourc respect speci cation def point paper assumpt relev data integr sound view view sound sound extens subset tupl satisfi de nition fact tupl conclud sati es fact tupl conclud satisfi view db coher sound view di erent assumpt domain account complet view view complet extens superset tupl satisfi de nition fact tupl conclud tupl sati es view fact tupl conclud tupl satisfi view db coher complet view exact view view exact extens set tupl object satisfi de nition db coher exact view ultim goal data integr system client extract inform account knowledg extens set content sourc problem extract inform data integr system reduc problem answer queri view schema set view fv vm de nition def extens speci cation queri ariti tupl dn problem consist decid decid dn db db sati es schema db coher vm de easi answer queri view essenti extend form reason presenc incomplet inform answer queri basi extens partial inform queri languag admit form incomplet inform gener coher view relat alphabet binari predic constant ann bill view femal de nition extens assum constraint schema view coupl ann femal compon bill male compon queri coupl return empti view conclud coupl ann femal compon bill male content data integr system architectur data integr coher framework section base descript logic mediat queri descript logic dlr rst introduc illustr logic compon data integr system descript logic dlr descript logic introduc earli attempt provid formal ground semant network frame evolv knowledg languag captur virtual formal arti cial softwar distinguish featur work logic detail comput complex analysi reason logic implic problem algorithm solv virtu logic optim reason practic system implement algorithm project domain interest model mean concept denot class object focu attent dl dlr basic element dlr concept relat assum deal alphabet constitut nite set atom atom denot denot arbitrari relat ariti denot arbitrari built denot compon integ denot ariti integ denot nonneg integ home page descript logic dn fd dg fd dg kg fig semant rule dlr ariti concept relat mean relat ariti combin form express type inherit ariti denot compon relat ariti semant dlr speci ed interpret constitut interpret domain interpret function assign constant element uniqu concept subset relat ariti subset condit figur sati ed observ constructor relat express di erenc complement mediat queri remind reader mediat schema constitut nite set constraint express schema languag ls schema languag ls base dl dlr constraint formul assert dlr relat dlr concept db set predic symbol alphabet denot db relat db predic symbol atom atom note interpret domain coincid set constant alphabet db sati es assert db db db db db sati es schema db sati es assert order de ne view introduc notion queri express set assum alphabet enrich nite set variabl simpli call variabl queri express datalog queri form conj conj conj conjunct variabl conjunct atom form variabl constant concept number variabl call ariti ariti relat denot queri observ atom queri express arbitrari dlr relat freeli assert kb distinguish approach respect constraint relat queri express kb queri express ariti interpret set db constant substitut formula conj conj evalu true db introduct queri de ne view queri queri express constitut view languag lv queri languag lq view set fv vm de nition def term queri express set tupl speci cation assumpt adopt view exact queri simpli queri de ned dlr schema express american doctor rel surgeon doctor american surgeon doctor sound view de nition extens queri constant ann add exact view de nition extens constraint inform conclud bill american discuss observ dlr captur great varieti data model form constraint dlr capabl captur formal conceptu data model typic entityrelationship model queri answer view constraint conceptu data model interest dlr con ned express data schema equip ectiv reason techniqu sound complet respect semant check assert logic set assert dlr number encod queri check queri model set solvabl queri answer section studi problem queri answer view set de schema express dlr knowledg queri view de nition dlr queri express call result problem answer queri view dlr technic result answer queri view dlr illustr section rst thing observ schema express set view fv vm queri tupl dn verifi essenti form logic implic observ made sharper introduc special express logic encod logic formula extens view view def fa introduc assert tupl introduc existenti quanti ed assert introduc quanti ed assert de treat view sound introduc type assert call set assert extens view problem queri answer view check reformul check logic implic hand part check logic implic turn check abil observ assert form assert express extens complet implic empti problem newli introduc assert express dl step translat dl work directli translat problem queri answer view dlr reason call directli correspond variant proposit dynam logic descript logic dl obtain dlr restrict relat binari relat call role complex role regular express concept form abstract denot atom gener atom simpl atom role atom gener role fd fd kg fig semant rule semant condit speci ed figur exploit result establish recent reason logic basi result li correspond variant proposit dynam logic includ program atom program inherit proposit dynam logic abil intern assert de ne role essenti correspond closur role role languag modal assert concept logic implic concept sati abil concept sati abil logic construct relat repres relat sound complet wrt concept sati abil logic mean rei cation atom relat rei ed introduc atom concept ap function role fn compon tupl relat repres instanc link role object repres compon tupl perform rei cation requir relat equal tupl constitut compon extens rei ed explicitli rule speci object connect object denot compon notat stand repetit tupl due fundament inabl express role sequenc meet concept forc situat constraint explicitli account reason make extend atom concept extens singl object requir make uniqu assumpt disjoint explicitli enforc explicit assert ad make reason restrict reason exptim reduct answer queri view dlr abil tackl answer queri view reduc problem check problem check abil concept obtain concept translat concept elimin relat mean rei cation reformul assert concept intern assert repres assert requir techniqu translat existenti quanti ed assert repres constant enforc disjoint di erent constant repres existenti quanti ed variabl treat skolem disjoint constraint addit repres tupl object speci atom concept term constant translat rei ed counterpart closur role role introduc rei cation atom relat ariti tupl translat conjunct rei ed counterpart concept translat atom combin translat quanti ed assert complet view sucient deal assert construct conj special call ect depend variabl speci detect cyclic depend connect compon connect compon build concept concept newli introduc concept treat variabl occur cycl di erent cycl denot variabl occur occur cycl rst de ne concept concept obtain variabl concept replac variabl concept replac concept quanti ed assert construct conjunct cx cx obtain replac observ xn abbrevi xn concept instanti constant proviso coincid proviso appli case variabl occur cycl critic point construct express quanti ed assert cycl directli translat assert concept shown construct deal nonempti requir special care correctli encod except rule due fundament inabl express role sequenc meet concept directli express assert share dlr assum cycl present model form constant extens view tupl check answer queri care explicit instanti step obtain encod exploit construct encod abox concept construct appli current case major adapt crucial observ translat order form sort disjunct abox basic fact prove construct present qa concept obtain construct qa size qa polynomi size view de assert exponenti number constant fdg exponenti due number instanti constant fdg captur quanti ed assert sati abil dlr queri answer view dlr relat work observ queri answer view form reason incomplet inform interest reader refer survei subject observ comput set run algorithm present tupl ariti object view extens deal incomplet inform rich expect tupl object separ set reason queri requir sophist form logic infer verifi tupl belong queri rise line reason depend tupl vari substanti tupl simpl languag avoid tupl shown queri answer dl cyclic tbox assert reason object polynomi data express complex requir sophist form infer queri answer view investig year context simpli ed framework problem studi case conjunct queri arithmet disjunct queri queri variant regular path queri framework queri interest result queri present queri answer view tightli relat queri rewrit studi rewrit conjunct queri conjunct view atom dl concept role dl express rewrit queri respect set view function extens return set tupl answer set queri respect view xe priori languag express rewrit union conjunct rewrit express languag call perfect rewrit return answer set queri respect independ languag express algorithm answer queri view view perfect rewrit result present show exist rewrit set mediat queri express dlr illustr framework data problem queri answer view data integr system address problem case datalog queri pose mediat schema express dlr consid assumpt view extens present techniqu solv problem worst case comput complex previou section algorithm answer queri view fact perfect rewrit set present remain open perfect rewrit express declar queri languag interest maxim rewrit belong behav queri languag polynomi data rewrit perfect acknowledg work present partli support esprit project dwq foundat data murst data integr member project daniel mosh contribut idea illustr chapter refer serg abiteboul oliv duschka complex answer queri materi view proc acm sigact sigmod sigart symp principl system page answer queri materi view disjunct proc int conf theori volum lectur note comput page alon rousset rewrit queri view descript logic proc acm sigact sigmod sigart symp principl system page maurizio lenzerini special issu data reconcili inform diego giusepp de maurizio lenzerini conjunct queri descript logic relat proc descript logic workshop page diego giusepp de maurizio lenzerini decid queri constraint proc acm sigact sigmod sigart symp principl system page diego giusepp de maurizio lenzerini answer queri view descript logic knowledg base proc nat conf arti cial intellig page diego giusepp de maurizio daniel rosati descript logic framework inform integr proc int conf principl knowledg reason page diego giusepp de maurizio daniel rosati inform conceptu model reason support proc int conf cooper inform system page diego giusepp de maurizio daniel rosati data integr data wareh int cooper inform diego giusepp de maurizio mosh vardi answer regular path queri view proc ieee int conf data engin page diego giusepp de maurizio mosh vardi queri process view regular path queri proc acm sigact sigmod sigart symp principl system page diego giusepp de maurizio mosh vardi queri process constraint satisfact proc ieee symp logic comput scienc page diego giusepp de maurizio mosh vardi queri proc int workshop knowledg meet page ceur electron workshop diego maurizio daniel nardi descript logic conceptu data model jan chomicki logic inform page kluwer academ catarci maurizio lenzerini repres interschema knowledg cooper inform system intellig cooper inform shim optim queri materi view proc ieee int conf data engin taipei chen uni ed view data acm tran march sara werner alexand rewrit aggreg queri view proc acm sigact sigmod sigart symp principl system page giusepp de giacomo maurizio lenzerini foundat descript logic tupl set proc int joint conf arti cial intellig page giusepp de giacomo maurizio lenzerini tbox abox reason express descript logic john stuart proc int conf principl knowledg reason page morgan lo francesco maurizio daniel andrea schaerf integr datalog descript logic intellig inform oliv duschka michael genesereth answer queri view proc acm sigact sigmod sigart symp principl system page elmasri navath fundament system benjamin cum publ menlo de caro grade modal studia michael fischer richard ladner proposit dynam logic regular program comput system daniela alon ioana dan suciu queri optim presenc limit access pattern proc acm sigmod int conf manag page daniela denni eric simon extens framework data clean technic report grahn alberto mendelzon tableau techniqu queri inform sourc global schema proc int conf theori volum lectur note comput page maurizio queri aggreg data proc acm sigact sigmod sigart symp principl system page ian ulrik stephan tobi queri dlr abox technic report rwth michael nigel tomasz shen munindar philip integr inform model carnot proc int conf cooper inform system page hull king semant applic research issu acm comput septemb matthia maurizio yanni pano editor fundament data dexter kozen logic program jan van handbook theoret comput scienc formal model page elsevi scienc publish maurizio lenzerini andrea schaerf concept languag queri languag proc nat conf arti cial intellig page alon levi obtain complet answer incomplet proc int conf larg data base page alon alberto divesh srivastava answer queri view proc acm sigact sigmod sigart symp principl system page alon levi rousset languag combin horn rule descript logic proc eur conf arti cial intellig page alon divesh thoma kirk data model queri evalu global inform system intellig inform chen li edward chang queri plan limit sourc capabl proc ieee int conf data engin page chen li edward chang answer queri presenc limit access pattern proc int conf theori chen hector yanni je rei capabl base mediat tsimmi proc acm sigmod int conf manag page anand je rei ullman answer queri templat bind pattern proc acm sigact sigmod sigart symp principl system rousset backward reason abox queri answer proc descript logic workshop page ceur electron workshop andrea schaerf queri answer knowledg semant issu phd dipartimento di informatica di roma klau schild correspond theori terminolog preliminari report proc int joint conf arti cial intellig page sydnei levi answer queri aggreg view proc int conf larg data base page stephan tobi complex reason cardin restrict nomin express descript logic arti cial intellig ioannidi versatil tool data independ larg je rei ullman inform integr logic view proc int conf theori volum lectur note comput page wieb van der hoek de rijk count object logic ron van der meyden logic approach incomplet inform jan chomicki logic inform page kluwer academ jennif widom special issu materi view data wareh ieee bulletin data chen hector je rei ullman comput capabl mediat proc acm sigmod int conf manag page chen je rei hector optim larg join queri mediat system proc int conf theori page
HCI/805 4 reach object vr lag frame rate colin ware balakrishnan faculti comput scienc brunswick po box nb canada paper report result studi reach behavior stereo displai system hand track object select found lag head track system unimport predict lag hand track system critic effect hand lag model mean variat fitt law measur system lag introduc multipl variabl fitt law index difficulti mean small lag degrad perform target small find error higher movement compar movement plane small time penalti movement direct experi low frame rate degrad attribut lag low frame doubl buffer combin earli sampl hand track devic categori subject methodolog techniqu interact techniqu gener human factor addit keyword fitt virtual haptic introduct virtual realiti displai system induc graphic scene coupl user ey posit graphic imag correct perspect view object maintain coupl achiev mean head track system polhemu track devic posit user ey comput offset respect measur head posit user manipul object graphic scene imag hand cursor coupl user hand input devic data bat order creat import screen updat rate fast minim lag posit displai system convent wisdom comput graphic hold ten updat requir percept smooth motion research field state inform present studi obtain empir data effect lag frame rate perform target april ware balakrishnan model order address topic number area prior research stereo displai law paradigm reach effect lag stereo displai comput graphic topic basi introduct kind displai chose studi convent monitor creat vr imag local region vicin screen shutter glass creat field sequenti user head posit track ensur correct perspect view obtain configur call fish tank vr result high resolut virtual imag shown task determin connect data head track import enhanc inform fundament common applic reach target visual guid hand motion target acquisit extens studi reach task studi shown averag time accur account fitt law kind task carri environ head coupl stereo factor lag head track hand track system influenc perform recent studi mckenna show differ error reach task head track larg statist test appli fitt law model lag fitt law success formula human factor research law describ time acquir visual target kind manual input devic variant fitt law commonli time distanc center target determin constant fitt law origin deriv inform theori recent mackenzi argu perspect slight variat formula satisfi replac constant constant formula time whichev variant fitt law logarithm part call index difficulti fitt law express time quantiti call index unit bit evid process model fitt law seri movement hand guid probe closer probe fall target area hand complet seri correct appli dynam feedback loop loop illustr figur human machin compon perform april ware balakrishnan iter seri model id portion fitt law interpret measur averag number movement movement requir acquir word number time main process loop execut fitt law studi assum machin process lag case comput graphic telerobot applic modifi equat time repres human process time requir make correct repres machin process id repres averag number iter control loop repres sum initi time time requir confirm acquisit target addit sensori motor process load introduc human oper highli stress human process compon mackenzi ware found paramet model kind excel descript data fitt law experi interpret term control loop earlier studi ferrel similar open loop control model account data deriv task machin lag fitt law classic fitt law model movement mackenzi buxton test number variat fitt law rectangular target found success index difficulti modifi target width dimens account id target size direct direct distanc center target essenti rule state perform determin smaller target dimens variat fitt law trivial extend data id mackenzi buxton model modifi index difficulti id repres thick target direct hand motion effect target width larg target subject group posit target hit insid target small target distribut overlap target boundari variant fitt law base idea target calcul index difficulti actual target width replac time standard deviat distribut hit error april ware balakrishnan σ repres standard deviat hit direct movement metric provid accur measur rate inform process achiev perform control movement goal predict perform model perform includ actual target dimens prefer lag cycl basic displai cycl interact graphic input devic sampl immedi buffer swap construct graphic imag frame displai frame construct buffer switch vertic blank interv imag construct time msec minimum msec lag occur effect input made visibl imag remain screen msec assum percept occur middl frame interv total lag current state technolog displai hz updat rate devic lag msec commun fairli yield total lag msec assumpt estim reason rapid frame rate question low case probabl percept effect movement occur time middl frame addit low rate sampl hand posit effect hz frame rate entir correct movement miss evid suggest maximum rate control movement approxim hz theorem requir sampl hz sampl prefer return issu discuss experi shown low frame rate pernici effect perform comput graphic stereo displai advantag abil visual system resolv differ imag present ey inform layout object space figur show simplest stereo displai line space differ ey differ angl α β ey call stereo figur show geometr solut layout line space note uniqu solut brain rel orient ey special refer extent cross import vergenc coupl accommod human visual pose problem vr displai place imag focu monitor screen object closer point fixat focu mean correct vergenc focu inform provid object plane screen excel introduct human stereo vision patterson martin april ware balakrishnan fusion area dispar larg singl imag longer occur doubl imag depth judgment made accur area fusion occur call fusion area illustr figur larger dispar fuse distanc point fixat fovea maximum dispar fusion break tenth eccentr limit stereo imag fusion area occur case figur depend spatial tempor factor fusion volum depth judgment made accur experi care minim experi examin problem small target select condit exist displai resolut depth displai resolut convent flat screen displai comput number pixel typic high resolut system view distanc cm distanc cm comput resolut depth stereo displai figur illustr geometri smallest horizont dispar pixel result pixel depth differ typic displai type consid plane screen pixel cm screen techniqu effect ten ratio horizont resolut depth resolut remain effect view distanc conclud introduct fitt lag remaind paper devot descript experi design gain understand import paramet affect perform placement task vr system measur lag head track hand track system low imag updat rate endur investig direct effect lag hand track effect lag head track target acquisit flat pizza box target cube effect final effect frame rate perform experi fitt law experi goal test extend fitt law lag model introduct correct account varianc variabl lag target acquisit experi test motion screen obei fitt law reason presum differ vertic horizont motion plane screen evid support motion screen reli lower resolut depth stereo displai plausibl critic dimens motion screen target acquisit significantli harder present studi compar horizont motion motion screen find account model april ware balakrishnan method experi apparatu apparatu illustr figur experi visual stimuli gener silicon graphic iri graphic stereo capabl monitor hz resolut pixel pixel measur hand bat polhemu sensor button wire track head posit achiev shutter glass integr head tracker experi conduct stereo subject head posit continu track order provid correct perspect view lag hand head track devic introduc buffer devic sampl delai process multipl frame rate system capabl maintain updat rate hz reduc manipul stimuli screen background set dark grei light grei wire mesh grid drawn horizont plane top bottom screen grid enhanc percept depth vr displai blue diamond shape pixel wide point coupl user hand bat target consist cm squar tile solid border pixel wide face choic color primarili determin attempt avoid bleed imag ey slow green monitor separ tile vari repres width target calcul target shown photograph figur procedur total lag condit includ level head lag level hand lag shown base condit head lag hand head lag condit head lag hand hand lag condit head lag hand actual lag measur method appendix perform evalu horizont motion motion screen result combin april ware balakrishnan carri fitt law analysi subject test target distanc target width yield total condit trial condit structur manner experi conduct hour session separ dai start subject receiv practic set block consist direct combin repetit subject present ten block combin block consist trial practic trial start block familiar subject lag direct ignor practic result trial trial session trial subject block present random trial block random start trial cursor left center screen plane screen target sec cursor distanc trial center cursor center cursor front center target cursor distanc front face target perpendicular cursor direct user move space task essenti flatten natur target subject complet trial press button effect bind xyz posit hand start move cursor box bound target tile button satisfi center cursor insid target time start moment target stop bat button press trial began approxim sec subject twelv comput liter subject author serv paid volunt subject prior experi apparatu experi result experi found effect head lag analysi varianc perform direct slower direct effect fail reach level understand effect task difficulti lag ran set regress coeffici model equat assum lag multipl effect index regress result hand lag condit analyz data experi modifi index difficulti decid end present data analyz unmodifi index difficulti unmodifi id account unmodifi id predict actual perform mention introduct modifi index difficulti arriv post hoc analysi distribut hit april ware balakrishnan time time time plot shown figur show time plot index difficulti hand lag condit valu index perform data bit rang cite mackenzi review articl differ estim human process time direct markedli note highli sensit point confirm fact high regress coeffici obtain combin data major differ perform direct broader distribut hit direct error rate direct perform doubl data tabl show error rate lag lag lag lag direct direct tabl percentag error hand lag condit direct discuss experi gener data consist previou fitt law studi similar task estim human process time msec consist previou estim msec lag set inform process rate bit fairli typic fitt law studi estim lag multipli larger found mackenzi ware task constraint larg lack perform degrad due head lag current placement task subject tend move head stereo depth cue suffici give adequ percept depth inform find error larger direct show movement screen isomorph movement horizont due lower resolut screen introduct find perform decrement due lag multipli system lag time index difficulti select small target lag msec simpl select longer lag highli interact system target select fundament build block interfac kind perform degrad easili make differ system perceiv april ware balakrishnan experi experi test extend fitt model cube target experi design task dimens movement critic experi design investig problem captur target small dimens mackenzi buxton prefer model differ captur cube captur box shape object flatten direct long size direct motion initi pilot work suggest fact case investig matter formal experi target cube size measur perform condit experi design minim occurr doubl imag situat occur binocular dispar great import determin factor target acquisit time method experi stimuli target chang cube solid border pixel wide face back face respect direct made opaqu face serv aid determin cursor penetr back face longer insid target cursor width reduc cm smallest target cm cube procedur target acquisit task perform direct variat direct figur experi start trial cursor cm left center screen plane screen target cursor distanc trial variat henceforth refer simpli cursor center plane target cursor distanc henceforth refer target center plane screen cursor front target distanc distanc cursor level hand lag investig direct head lag lowest msec result combin subject test target distanc cube size result combin experi conduct similar manner experi trial condit subject present block trial total trial session trial subject april ware balakrishnan target select time perform ident manner experi experi carri hour session practic session block trial random manner similar experi subject twelv comput liter subject author serv paid volunt subject prior experi apparatu experi result experi initi analysi data experi show larg departur classic fitt law relationship regress coeffici closer examin data reveal anomali trace data obtain cm cubic target condit high error rate experi observ subject suggest extrem difficulti task perform retrospect depth dispar half centimet pixel input devic inher approxim cm region exclud data subsequ analysi perform analysi varianc condit show main effect analysi varianc compar condit reveal effect perform direct slower perform found experi result consist degrad perform due direct due experi ran regress model equat time direct time direct time combin time result combin high individu valu index perform data bit lower found experi figur show time plot index difficulti lag condit valu plot exclud target point shown connect point error data tabl show consist effect direct lag lag lag direct direct direct april ware balakrishnan tabl percentag error hand lag condit direct discuss experi target symmetr condit account find error vari condit experi fact effect good user kind displai avoid reason depth imag space clear problem cm hold unsupport hand devic problem stereo resolut front back target surfac contribut requir make select inordin long simpl suggest target avoid reduc bit rate compar experi suggest simpl gener select select equat adequ weight comparison made experi experi effect low frame rate experi test effect frame rate lag perform major lag interact anim system practic doubl buffer explain lag introduc half time frame interv reason assumpt low frame rate disrupt task question theoret interest present studi address perform decrement attribut lag doubl buffer addit perform decrement attribut simpli low frame rate method experi stimuli background stimulu ident experi target cursor ident experi procedur base condit minim hand lag combin condit hand lag introduc wai head lag msec experi lag introduc wai april ware balakrishnan high frame condit frame rate maintain hz lag introduc queu hand track devic input effect integ number frame earli condit lag manipul vari frame rate devic sampl immedi buffer swap late condit lag manipul vari frame rate devic sampl prior buffer swap graphic imag cursor target construct ensu sec interv experi experi remov sourc delai devic result shorter lag case base interv high frame condit frame rate frame interv msec hand lag earli sampl doubl condit frame rate frame interv lag late sampl buffer late condit frame rate frame interv lag condit evalu direct result combin distanc size result combin total condit experi conduct similar manner experi ten trial condit result trial subject practic session experi target acquisit task perform direct experi start trial cursor left center screen plane screen target cursor distanc trial direct cursor center front screen target cursor distanc target select time perform ident manner experi subject twelv comput liter subject author serv paid volunt subject prior experi apparatu experi result experi april ware balakrishnan figur show averag target acquisit time earli late sampl hand track devic show advantag late sampl expect data show perform direct slower direct regress valu obtain condit appli model equat high frame rate data time direct time earli sampl data time direct time late sampl data time direct time data combin time plot shown figur illustr time plot index difficulti method introduc lag data index perform data bit found experi lower found experi real test model equat singl regress equat account data set condit combin set condit drop respect decid reevalu assumpt assumpt imag perceiv middl frame interv allud possibl lag effect introduc low devic sampl rate case low sampl rate long frame interv subject frame chang rel posit cursor target base observ make movement target movement sampl begin frame feedback loop effect addit lag account lag time movement made time sampl experi addit lag separ lag combin lag easili greater time frame interv assum april ware balakrishnan determin ran regress data combin valu lag compon step result plot figur show peak percept sampl lag approxim time frame give data combin time discuss experi experi level lag collect data estim detriment effect lag multipli index difficulti worth note system lag fitt law experi hz updat rate monitor machin lag msec devic lag neglig factor undoubtedli affect previou estim human compon process loop estim machin lag result experi felt post hoc analysi frame rate high studi chang result chang msec estim machin lag discov system lag introduc movement input devic visual feedback major factor reduc speed target select crude approxim simpl formula time account data experi suggest method estim time sampl devic buffer swap doubl buffer main render loop constant formul repres time initi visual guid movement correct control loop illustr figur result studi consist previou studi suggest depend task repres combin initi reaction time start task time termin mean button press id repres index task difficulti defin fitt modifi mackenzi buxton factor lag head coupl effect low frame rate lag direct hand motion minor effect perform movement direct consist perform decrement experi compar movement direct found evid higher error rate motion direct deriv number practic recommend result april ware balakrishnan acquir input devic low ideal msec note small lag perform cost select small target doubl buffer frame rate frame rate hz effect lag msec introduc add sec target select time select small target separ head lag hand lag head coupl stereo target select cursor small part graphic environ sampl head track draw scene point sampl hand track devic draw target cursor introduc lower lag task critic part target cursor creat higher updat rate target cursor lower al recent softwar architectur support kind decoupl avoid design system requir acquisit small target unsupport hand respect issu target acquisit essenti target data suggest differ index perform valu lower cube target pizza box target mean simpl extens law mackenzi buxton valid interpret reli comparison made substanti evid singl experi combin condit low bit rate substanti acquisit time suggest reduc task task satisfactori model worth note index perform satisfactorili describ inform content talk inform process dimens content task perform relat ratio target volum workspac linear distanc implicit mackenzi buxton respect issu lag sampl affect perform found effect variabl feel result appli fish tank vr situat studi full vr head mount head result dramat scene occur fish tank vr coupl lag handicap perform equip evalu possibl review paper comment predict filter hand head sampl effect filter task perform unknown import topic research distinct possibl circumst sampl rate filter degrad task perform measur lag studi essenti accur measur actual system lag modifi version method develop liang al measur lag polhemu hand track ultrason sensor april ware balakrishnan head track design motor driven assembl sat top comput monitor sensor polhemu attach belt driven motor move back monitor screen constant speed monitor displai graphic cursor reflect posit report sensor dimens posit video camera record movement sensor monitor graphic imag displai screen video tape plai back frame record differ posit physic sensor report posit displai graphic cursor knew amplitud veloc calcul lag displac comput control motor move pendulum liang ensur constant predetermin linear veloc reduc possibl error calcul order ensur lag measur techniqu accur reflect lag program calibr close resembl softwar devic driver implement doubl buffer screen updat rate hz maintain polhemu continu binari mode default filter rate demand report mode filter found devic lag msec polhemu msec lag introduc doubl buffer lag occur context experi method section experi grate anonym review point gain polhemu devic depend frequenc movement calibr complet clear inform affect human perform characterist reach task uncontrol factor experi acknowledg fund project provid nation scienc research council canada grant author grate mark paton devic driver code refer sr testb characterist dynam virtual environ spatial sensor nov ks evalu task perform fish tank virtual world acm transact inform system april ware balakrishnan lg process visual feedback control journal human percept perform high resolut virtual realiti siggraph comput pm inform capac human motor system control amplitud movement journal psycholog keel sw mi process visual feedback exp psycholog realism virtual realiti environ acm uist fitt law research design tool interact extend fitt law acm confer lag determin human perform interact system confer amsterdam ce keith je optim human motor ideal control rapid aim psycholog interact viewpoint control oper symposium special issu comput kn binocular hafner wl human human alic softwar architect build virtual adjunct tb wr remot manipul control transmiss ieee transact human factor tb muse virtual presenc fundament skill london ks fish tank virtual realiti confer human factor comput april ware balakrishnan object placement ieee comput graphic ld limit fusion depth judgement stereoscop color displai human figur diagram show control loop assum govern guid reach comput graphic environ compon repres machin human process oper figur pattern shown left ey result perceiv layout space shown point repres project screen vertic line shown plan view figur smaller dispar fuse closer point fixat point fixat area fusion place call fusion area locu constant dispar fixat point figur photograph show subject system major compon head track stereo vr shutter bat input cursor target subject closer monitor figur target cursor experi figur diagram show schemat plan view diagram summar experi figur averag result experi time respond plot index difficulti lag condit figur averag result experi time respond plot index difficulti lag condit point obtain target shown connect point due high error rate valu exclud data analysi figur data experi time plot frame rate earli late devic sampl condit figur averag result experi hand lag condit condit lag introduc queu devic valu condit lag introduc reduc frame rate sampl devic immedi buffer swap condit lag introduc reduc frame rate sampl devic buffer swap figur regress comput entir set data experi adjust estim machin lag figur apparatu measur lag system april ware balakrishnan
AI/806 2 richard cole peter eklund school inform griffith australia comput volum number scalabl formal concept analysi formal concept analysi symbol learn techniqu deriv mathemat algebra order theori techniqu appli broad rang knowledg explor task number domain record applic formal concept analysi deal small number object case complex algorithm index retriev data issu formal concept analysi appli explor larg number object size data make issu complex scalabl crucial paper present result experi carri set medic discharg summari attribut unifi medic languag system object medic document attribut uml term extract document formal concept analysi iter visual complex scalabl critic import amount data experi small compar size primari memori modern result import probabl distribut determin effici remain stabl size data work present firstli present methodolog explor knowledg text document formal concept analysi emploi conceptu scale creat result direct manipul line diagram conceptu scale lead small deriv context repres nest line diagram present algorithm fast determin context compress larg formal context work draw exist encod compress techniqu show rudimentari data analysi lead substanti effici improv knowledg fl blackwel main ma uk scalabl formal concept analysi introduct applic domain motiv requir research implicit knowledg incid occurr medic record aim research examin medic record deriv treatment condit suggest statist relationship test data set medic discharg describ patient interact hospit provid data document summari episod treatment creat patient leav care hospit call medic domain constrain medicin unit metropolitan hospit medic discharg summari provid corpu evidenti knowledg evidenti knowledg wai medic structur medic combin document discharg summari list patient prescrib varieti exhibit varieti symptom document suggest relationship treatment symptom document treatment evid suggest relationship relationship object research provid softwar tool research relationship treatment symptom emerg medic term firstli extract discharg summari term identifi structur popular medic nation librari medicin medic subject head thesauru subsumpt relat determin medic term formal concept analysi machin learn formal implic attribut determin varieti domain includ civil engin psycholog polit scienc view world object possess attribut singl unit thought concept concept extent object conform intent attribut expect object conform concept treat discharg summari medic term mesh attribut attribut mesh relev arbitrari investig small number attribut relev current studi import attribut distinguish set patient separ patient discharg summari identifi mesh attribut relev kei activ studi support mesh term subsumpt relationship defin select term process select attribut desir level specif interest patient interest occur left lung interest patient period time patient process investig process select attribut correct level specif select defin context appli data effect separ discharg summari cluster answer current queri impli select attribut select attribut modifi process repeat scalabl formal concept analysi graphic tool produc support specif attribut desir level specif process autom driven iter clinician oper continu produc select attribut appli formal concept analysi number document process larg result effici method creat order provid user rapid feedback mechan section overview previou work area relat result section describ medic discharg summari section descript formal concept analysi section describ process investig data section describ mechan handl larg amount perform oper requir effici section present background metaphor conceptu knowledg process call landscap knowledg descript metaphor identifi gave nomenclatur ten formal concept analysi activ fundament studi explor investig paper effici issu involv construct tool support explor investig explan term repeat conveni reader explor vagu idea instanc retriev literatur investig mean studi close examin systemat inquiri previou applic formal concept analysi analysi process text document divid categori conceptu scale al comput concept lattic context form set document set term document navig larg concept lattic window describ concept displai concept accomplish displai concept addit attribut intent al deriv bound size concept lattic comput similar document collect number term found document normal distribut small show distribut test document collect size concept lattic proport squar number document navig concept lattic show upper lower cover current concept investig reduc visual complex approach requir costli oper gener store full lattic rock retriev document collect conceptu scale conceptu scale advantag prevent costli space time task creat concept lattic document user conceptu neighborhood defin librarian search specif term system intend user base visitor librari expect creat conceptu scale scalabl formal concept analysi conceptu scale creat hand librarian combin user al describ set softwar tool creation combin conceptu scale nest line diagram task creation combin conceptu scale separ distinct softwar program import conceptu scale creat step independ analysi data incorpor expert knowledg construct creation conceptu scale combin appli conceptu scale data store relat tool appli formal concept analysi wide rang identifi metaphor tool present paper differ approach structur conceptu scale defin structur medic hierarchi knowledg captur definit mesh hierarchi form structur conceptu left clinician select attribut interest attribut search mesh provid list candid mesh term import select process displai clinician structur conceptu scale creat human comput interact metaphor direct manipul program achiev outcom call cole process embodi product larg number arbitrari combin scale form nest line diagram reflect structur data process paper product conceptu scale concept lattic concurr user receiv feedback design conceptu scale view structur concept lattic marriag process creat higher demand time space mechan meet demand subject paper algorithm fast determin deriv context gener concept lattic algorithm work compress larg context data compress ratio compress measur empir medic discharg summari uml medic discharg summari corpu medic discharg summari patient treatment obtain unit royal adelaid hospit discharg summari semistructur text document describ patient state interact hospit discharg summari remov address detail patient discharg document describ patient interact hospit summari episod treatment structur discharg summari mark convert html format procedur format inform easi view web browser scalabl formal concept analysi discharg summari previou file file ag yr cover patient number sex femal ward admiss date discharg date doctor date birth referr addr problem list small cell ca left treat cycl side discharg treatment sec fort tab drop ey td inform patient patient present pain awar specif symptom due extens reliev discomfort summari admiss year live daughter present chest pain mth histori episod precipit meal reliev recent problem good toler note alcohol gm daili reform mth heavi examin year hr bp hs dual pn bs nil mildli tender sound vertebr tender neurolog examin investig upper liver normal size progress mr made reason recoveri complain pain follow file figur discharg summari scalabl formal concept analysi figur discharg summari discharg summari rich varieti medic express portion gener common australian doctor english languag spell medic term make concept extract problemat unifi medic languag system unifi medic languag system project undertaken nation librari medicin attempt collect larg number exist medic languag vocabulari classif singl system section semant specialist inform sourc map central vocabulari compon uml distinct term term descript vocabulari medic term repres medic concept term descript descript word combin phrase sentenc descript record ulm alia term attribut identif work simplifi concept extract constrain match word discharg document presenc alia vocabulari subsumpt order defin concept map vocabulari attempt creat group term vocabulari relat term face term vocabulari map class term consid mean order relat vocabulari lead order relat class contradict situat shown figur medic subject head medic thesauru uml mesh commonli index describ medic term uml concept detect discharg summari map concept mesh mesh vocabulari index discharg summari document formal concept analysi metaphor describ process knowledg explor knowledg explor dynam process comput medium aspect knowledg investig central idea understand fundament unit thought concept concept constitut intent extens understand start defin tripl set binari relat read object attribut concept pair maxim respect properti set call extent call intent concept set concept context order complet lattic call concept scalabl formal concept analysi mesh term term cross vocabulari relat order term term figur merg vocabulari uml lattic context applic data formal concept analysi appli relat object attribut valu data set set set attribut relat impli understand attribut partial function context defin attribut call context context map formal context map call conceptu scale conceptu scale set context ms gs deriv context ms js context creat appli conceptu scale multivalu context deriv relat js ms defin js process creat conceptu scale perform expert knowledg domain data drawn conceptu scale creat concept repres formal context laid hand conceptu scale extern order singl valu context research conceptu scale creat manipul view medic taxonomi term manipul view enabl definit layout conceptu scale exist hierarch make achiev autom textual search mesh term discharg summari document scalabl formal concept analysi methodolog knowledg explor larg context conceptu scale formal concept analysi serv transform data attribut attribut reduc number attribut involv singl investig mechan automat gener conceptu scale result manipul mesh hierarchi present mechan process wai approach conceptu scale creat manipul diagram enter valu cross tabl context conceptu manipul diagram restrict implic exist scale exist mesh medic taxonomi conceptu scale gener construct context conceptu scale approach gener approach user insert arbitrari implic matter interpret context method dynam user creat examin deriv concept composit scale iter gener scale creat prior separ action combin scale nest line diagram clinician present browser navig mesh browser oper abil perform text search descript term mesh uml user locat medic term interest term ad conceptu scale construct term ad current conceptu upper bound call join form term conceptu scale join form respect hierarch order mesh upper bound definit singl term ad scale conceptu scale construct view user poset viewer poset partial order set call hierarchi ai literatur poset viewer show scale hierarch relationship mesh concept diagram diagram preserv subsumpt relat mesh concept cover relat preserv diagram join oper join oper concept graph connect diagram displai conceptu scale updat time fashion encod mesh hierarchi compact term chosen encod achiev good averag case perform wide rang hierarchi structur perform tree number oper partit mesh term assign term color group color partit partit visibl attribut defin number conceptu scale conceptu scale defin context interest medic attribut user formul conceptu scale repeat briefli section context set document scalabl formal concept analysi lung drug therapi mesh smoke figur unfold mesh fm set term mesh order valu term indic term found indic found incid relat document term scale determin select attribut order mesh attribut conceptu gi call deriv context result apposit deriv context conceptu scale unfold mesh context interest figur nest line diagram definit pair scale outer scale scale attribut nest line diagram direct product concept lattic deriv context split smaller deriv conceptu scale lattic structur shown larg oval figur attribut lattic shown small insid larg attribut therapi concept direct product smaller lattic present concept lattic apposit smaller context smaller circl fill correspond valid concept scalabl formal concept analysi mesh lung smoke drug therapi figur concept lattic nest line diagram pictori direct product lattic meet join preserv order concept lattic direct product lattic result line connect larg oval connect concept posit ly connect oval intent concept determin collect attribut path diagram connect shown connect concept posit connect oval left small circl figur path lead upward connect oval path achiev link top oval find posit concept intent determin concept label number attach number document mention medic term type concept directli left document determin document mention mention visual evidenti reason natur indic correspond treatment scalabl formal concept analysi context oper approach outlin section requir formal context document attribut repres space effici manner oper requir produc context interest user queri effici time complex oper requir produc context interest produc class document class possess combin select attribut result context possess class context class context store intent extent size determin context interest suffici construct line diagram store size attribut instanti reason line diagram show extent attempt repres list object motiv anticip oper interest structur lattic extent size examin document clinician find concept extent small meaningfulli retriev document intent sampl set thereof intent concept queri oper invert file structur permit interfac call html browser gener context store extent size extent object effici hash attribut valu assign order attribut interest order assign attribut singl bit bitmap treat number number attribut interest singl scale gener limit concept lattic complex easili interpret entireti bitmap number easili store bit integ case attribut interest hash function modifi work integ arbitrari bit length bitmap context repres arrai bit line bit line sequenti arrai bit correspond attribut document amount space requir store present byte calcul context bit object attribut interest examin determin class object lead straight forward algorithm order invert file invert file establish techniqu inform retriev defin map commonli document idea invert file store attribut list object case document arbitrari total order defin offset success document possess attribut store attribut document document patient invert file amount space requir store attribut depend size largest scalabl formal concept analysi frequenc occurr attribut attribut set figur present algorithm extract context interest invert file total context figur pictori algorithm oper algorithm set initi element attribut stack ad heap tupl heap tupl shown oval number entri attribut stack heap data structur make element minim set element store heap heap data structur altern design make element maxim set heap algorithm shown figur heap return set element minim set element store heap oper remov minim oper remov element remov set store heap minim element set map data structur store map valu form valu form rang map start initi empti set domain rang assign made domain rang set extend imag map express assign stage iter algorithm stack entri minimum stack advanc document number document number stack entri sum entri entri stack order entri heap stack entri stack document number document select term order element heap partial order order algorithm depend number object possess attribut heap oper trivial small order maximum number element heap equal number attribut context interest order algorithm worst case behavior object possess attribut case case attribut present half effici store invert index document attribut refer invert file attribut invert file algorithm outlin figur updat handl case attribut encod list document attribut order algorithm depend number entri invert file number document group attribut refer invert file attribut compress invert file space effici obtain compress invert file section compress offset valu usual encod offset binari long repres largest offset make assumpt offset rang largest offset equal probabl occurr assumpt exploit probabl distribut offset valu encod offset smaller number bit shannon entropi theori lower bound averag number bit requir transmit data express sequenc scalabl formal concept analysi input ms set attribut interest set object map attribut stack integ repres invert file variabl jgj partial map set attribut set integ heap subset tupl heap minimum total order attribut part tupl output map power set attribut integ algorithm ms loop end end loop loop end loop loop add class advanc minimum attribut loop end end loop end loop figur algorithm determin context interest scalabl formal concept analysi current posit stack invert file entri minimum respect document number heap entri invert file entri minimum document number advanc iter figur pictori algorithm probabl distribut lower bound shannon entropi theori suffici condit exist encod system provid algorithm achiev perform predict number encod system reach lower reason job encod small number bit compar space effici bitmap encod invert file binari encod invert file code part part unari part binari number unari encod repres number code singl paramet give length binari number encod code paramet length code number code code repeat result chosen method gener optim prefix free code geometr distribut bernoulli trial probabl success assumpt bernoulli trial probabl term document independ order document examin effect compress order algorithm shown figur ad term found document term scalabl formal concept analysi number document histogram document attribut data origin data figur histogram number document attribut initi data data ratio number attribut number entri compress shannon entropi bound compress tabl compress result result figur show distribut number attribut attach number document initi data map term document data initi map transform term ad document term found distribut show attribut attach small number document origin data attribut data attribut document probabl distribut number document attach attribut emploi local encod techniqu separ paramet code attribut encod invert file attribut tabl show result compress invert file compress improv data reason improv gener scalabl formal concept analysi iter encod type initi data data bitmap file invert index invert index tabl algorithm complex number document attribut found offset size reduc shannon entropi bound data number offset index data number attribut factor number entri factor factor significantli independ number document half document attribut effici encod store document attribut occur extens made basic invert file index call optim invert file index initi data attribut present half document data attribut present half document significantli affect compress result attribut effect perform algorithm comput context interest complex algorithm shown figur sensit distribut entri invert case exhibit order bitmap file tabl show order algorithm initi data number document data perform algorithm approach bitmap file reason top term mesh present larg proport conceptu present document document mesh term algorithm iter document term scale algorithm iter document invert index store document mesh term smaller entri result number entri consid smaller algorithm extend slightli handl invert extens chang order algorithm data perform initi data invert index reason distribut attribut document chang number entri fewer paper mechan construct conceptu scale structur conceptu scale automat gener structur mesh taxonomi direct manipul emploi user direct composit attribut conceptu scale shown structur mesh algorithm data invert file tool scalabl formal concept analysi scale larg data set shown give good perform term time space data structur algorithm appli specif problem gener deriv context invert file index produc good result tradit text retriev applic paper explor hierarchi set document effect perform invert file index found hierarchi gener index constant factor hierarchi produc compress perform algorithm comput deriv context affect hierarchi data shown small modif algorithm data structur exploit chang distribut improv time complex algorithm refer foundat comput scienc comput scienc press wh freeman lattic conceptu cluster system applic retriev machin applic formal concept analysi text retriev medic domain intern confer conceptu page south wale text retriev formal concept analysi australian document comput symposium introduct lattic order cambridg mathemat textbook press cambridg recent develop multipl inherit research knowledg engin sparc term encod dynam taxonomi conceptu knowledg intern confer conceptu structur formal concept mathemat foundat springer design interfac inform retriev page uml knowledg document ein zur und von und page commun system engin prentic hall ein zur und conceptu cluster scale inform page scale formal concept analysi conceptu knowledg volum lectur note artif page australia springer scalabl formal concept analysi gener graphic object edit phd comput system dept electr electron stanford data analysi base conceptu file data analysi knowledg page restructur lattic approach base hierarchi concept order page concept lattic conceptu knowledg system comput math landscap pragmat paradigm knowledg process intern symposium knowledg storag page manag gigabyt van nostrand reinhold
DB/807 3 synchron improv fresh junghoo hector depart comput scienc ca octob abstract paper studi refresh local copi autonom data sourc maintain copi size data maintain copi make crucial synchron copi defin fresh chang model underli synchron polici analyt studi polici verifi base data collect web site show polici improv significantli compar current polici introduct local copi remot data sourc frequent made improv perform avail data copi remot sale custom tabl local analysi web search engin copi portion index user navig web remot sourc updat independ push updat client client period poll sourc detect refresh copi scenario illustr figur portion local copi temporarili due delai sourc updat refresh local copi applic import control inform perform refresh process data improv paper address import question refresh synchron process synchron copi copi copi synchron order data item synchron data item answer question queri poll updat data sourc local copi figur conceptu diagram problem synchron fresh problem work driven manag web data maintain local repositori call portion web million support research experi web search mine googl search engin repositori commerci product web search engin altavista maintain similar copi index base web data collect maintain repositori index web page period revisit work program call web crawler size web grow crucial synchron data recent studi show month page index popular web search engin lot user express search engin return obsolet user follow link link search engin broken tune synchron reduc wast resourc time significantli synchron local copi introduc interest challeng measur fresh copi trivial copi consid fresh remot data measur fresh current statu data current statu spread thousand web data item averag rate page cnn web site updat updat page depend relat page develop time visit page dai fresh formal studi synchron data maxim fresh main contribut make present formal framework studi synchron defin notion fresh ag copi studi web analysi appli data materi view maintain top autonom poll underli period level fresh present synchron polici compar studi show polici intuit appeal perform naiv polici synchron polici improv fresh order magnitud case valid analysi data collect web site month period data show polici current polici rest paper organ section present framework synchron problem section explain option exist synchron local compar option section section verifi analysi data collect world wide web framework studi synchron understand mean data chang time section present framework address issu refer data sourc monitor local copi local distinguish refer data item element local element section start discuss definit fresh fresh ag section discuss model evolut individu element final section discuss model fresh ag element element notion element synchron dai synchron year ago base intuit defin fresh ag local element element maintain element upto specif time valu equal defin fresh time fresh fraction local local element local element mathemat reformul definit definit fresh local element time time fresh local time note fresh hard measur practic compar data local copi estim fresh inform data captur defin metric ag definit ag local element time time modif time ag local time time element synchron element modifi figur time evolut ag averag local element chang dai ago synchron dai figur show evolut element horizont axi repres vertic axi show assum element dot line local element synchron dash line fresh drop element ag linearli point local element synchron fresh recov ag drop fresh local chang time fresh point point time compar synchron import metric fairli consid fresh period instant fresh averag time metric definit defin time averag fresh element time averag fresh lim lim time averag ag defin similarli prove sum detail refer appendix poisson process probabilist evolut element studi synchron method element assum element modifi poisson process poisson process model sequenc event happen randomli independ fix rate time occurr fatal auto arriv custom servic model poisson process poisson time event exponenti distribut lemma time event occur poisson process chang rate probabl densiti function assum element modifi poisson process chang rate element rate rate element element element chang element element chang year section verifi poisson process describ real web page poisson process analyz fresh ag element time comput expect fresh ag time assum synchron integr probabl densiti function lemma obtain probabl interv synchron interv local element probabl time expect fresh note expect fresh time expect fresh approach time pass obtain expect ag similarli modifi time ag time lemma time probabl expect ag time note expect ag time expect ag approxim time larg figur show graph note recov evolut model previou subsect model evolut element discuss model depend element chang model uniform assum element chang frequenc simpl model individu element time entir assum element chang averag rate time graph time time graph time figur time evolut element figur histogram chang frequenc symbol mean fresh element averag time ag element averag time fresh element averag element rate synchron frequenc chang frequenc element synchron frequenc element averag chang frequenc element averag synchron frequenc element tabl symbol paper mean element chang slightli frequenc model work good approxim assum element chang rate refer chang frequenc element plot histogram show figur horizont axi show rang chang frequenc vertic axi show fraction element chang frequenc rang approxim discret histogram continu distribut function consist element adopt continu distribut model conveni reader summar notat tabl continu explain symbol introduc synchron polici discuss time section studi local copi refresh dimens synchron synchron decid frequent synchron local synchron maintain local assum synchron element vari adjust synchron resourc decid element synchron unit decid frequent synchron individu element illustr issu consist element chang rate decid synchron total rate decid frequent synchron synchron element uniformli rate synchron rate synchron element synchron element rate base fix alloc individu classifi synchron polici studi polici section uniform alloc synchron element chang element synchron fix frequenc option correspond polici alloc synchron element rate proport alloc polici synchron element frequenc proport chang frequenc frequenc ratio proport alloc polici option correspond polici synchron decid order synchron element maintain local web page site order maintain local copi continu updat local revisit page site perform adopt maintain explicit list url visit url repeatedli order notic updat local fix synchron fix interv maintain url root page crawl start root link link structur crawl determin page visit synchron order chang crawl notic synchron variabl interv visit end crawl begin interv close opposit case close dai activ synchron synchron page request user page user request synchron order random synchron interv bound rang infin page synchron point dai figur option synchron point summar option section compar synchron order polici fix synchron element order repeatedli element synchron fix interv polici polici correspond option random synchron element synchron order iter polici correspond option pure synchron select arbitrari element synchron element synchron interv arbitrari length polici correspond option synchron synchron limit web site heavili access desir crawl site frequent visit illustr option due constraint maintain local page site site heavili access synchron includ figur synchron page begin midnight figur synchron page begin synchron page rest dai figur synchron page uniformli dai assum synchron uniformli time assumpt valid web environ web site locat time easi identifi time zone web site resid access pattern web site vari wide web site heavili access dai access user home crawler guess time visit typic visit site uniform rate conveni crawler comparison polici fresh synchron fresh fresh polici fresh ag tabl fresh ag formula polici fresh fresh graph ag graph figur comparison fresh ag synchron polici synchron element address question analyz synchron order polici learn polici term fresh ag section assum element modifi averag rate adopt uniform model element chang make synchron element assum uniform alloc polici section assumpt significantli simplifi give solid understand issu address base analyz polici detail appendix summar result tabl repres frequenc ratio frequenc element frequenc local element synchron synchron element element chang synchron reader interpret show fresh ag graph figur horizont axi frequenc ratio vertic axi show fresh ag local notic synchron element chang fresh approach ag approach element chang frequent synchron fresh ag notic fresh equal synchron element chang result reason element random point fix averag rate element chang chang synchron delai exist chang element element fresh graph figur practic implic answer question graph measur fresh local measur frequent element estim fresh local element chang synchron local element dai fresh local polici note deriv equat tabl assum element chang rate equat true element chang rate interpret averag rate formula approxim section deriv exact formula element chang rate fresh local find frequent synchron local element order achiev fresh frequenc ratio synchron local element time frequent element chang polici polici perform metric synchron element chang fresh polici higher polici dramat ag ag polici fourth polici variabl time visit polici comparison polici previou address assum element chang rate element chang rate element synchron element address question analyz polici section model model assum polici polici section polici polici assum element frequenc element synchron fix interv synchron frequenc rememb synchron element time unit averag synchron frequenc equal section start discuss compar uniform alloc polici proport alloc polici uniform polici turn section briefli discuss measur frequenc chang learn refer polici fresh ag uniform alloc proport alloc tabl fresh ag formula polici proport polici section understand studi simpl final section studi alloc resourc element achiev optim fresh ag uniform proport alloc polici assum chang frequenc element follow gamma compar proport uniform polici appendix prove section valid distribut gamma distribut model random variabl domain number distribut cover wide arrai distribut exponenti distribut special instanc gamma gamma distribut close normal distribut varianc small mathemat properti versatil make gamma distribut desir describ distribut chang frequenc analyz uniform proport alloc polici summar result tabl repres frequenc ratio averag rate element chang gamma averag rate synchron repres standard deviat chang frequenc gamma subscript refer proport alloc polici subscript refer uniform alloc polici uniform polici proport compar plot graph figur note uniform polici ratio proport polici ratio ratio uniform polici proport uniform polici element chang frequenc varianc chang frequenc element chang polici give result element chang grow larger smaller observ ag ratio chang fresh ratio heavili depend show uniform polici proport gamma distribut fact gener appendix prove uniform polici proport polici distribut graph graph figur graph vv dai element modif time figur element chang frequenc element expect proport polici uniform alloc resourc element chang attent understand unintuit studi simpl consist element analysi simpl understand result reveal intuit trend confirm trend studi optim synchron polici section analyz consist assum assum goal maxim fresh averag time figur visual illustr simpl model element dai split interv element interv element model poisson process adopt model due simplic concret assum decid synchron element dai element synchron synchron answer compar fresh pick element element middl dai synchron remain remain half dai synchron element row benefit tabl estim benefit choic dai fresh probabl middl dai synchron dai dai synchron middl remain remain half interv probabl expect benefit dai dai crude select tabl show expect benefit scenario column show total synchron frequenc column show synchron alloc fourth column estim expect column show valu give highest expect benefit save show interest pair note row correspond proport polici row correspond uniform polici observ interest row synchron frequenc smaller chang frequenc give synchron element chang fast focu track row synchron frequenc larg uniform alloc polici proport alloc polici optim point locat proport polici uniform polici verifi trend earlier analysi base poisson process assum poisson process chang frequenc refer time averag fresh synchron fresh fix equat plot figur show seri graph obtain horizont fresh fresh fresh fresh fresh fresh figur seri fresh graph synchron frequenc constraint axi repres fraction synchron alloc synchron element synchron element middl point correspond uniform polici point correspond proport polici vertic axi graph show normal fresh normal fresh uniform polici compar uniform proport polici fresh proport polici ax cross uniform polici uniform polici proport dot origin note synchron frequenc small give element highest fresh larg optim point uniform polici proport polici fresh highest figur star optim polici previou learn uniform polici proport polici learn optim polici uniform polici proport polici highest fresh figur alloc resourc element gener address question studi synchron individu element order maxim fresh ag chang frequenc synchron frequenc synchron frequenc tabl optim synchron frequenc formul goal problem find valu maxim satisfi constraint deriv close form solv problem method lagrang multipli illustr properti consist chang frequenc list chang frequenc row tabl explain mean row continu decid synchron local rate find synchron element solv problem show graph solut figur horizont axi graph correspond chang frequenc vertic axi show optim synchron frequenc element chang frequenc optim synchron frequenc chang frequenc element similarli find optim synchron frequenc list row tabl notic synchron frequent synchron frequenc highest rate result shape figur synchron frequenc element smaller smaller obtain figur solv prove shape graph distribut optim graph figur graph scale constant factor figur shape graph statement true improv penal element chang polici chang frequenc synchron frequenc fresh optim chang frequenc synchron frequenc ag optim figur solut fresh ag optim problem comput optim ag solut show result figur ax graph list optim synchron frequenc row tabl contrari observ synchron element notic synchron frequenc approxim close optim solut close uniform polici proport polici similarli prove shape optim ag graph figur trend observ gener hold experi paper model poisson process verifi poisson process model data collect site month observ chang frequenc compar synchron polici result show optim polici perform significantli current polici crawler setup collect data web page crawl page site februari june stanford system design creat maintain larg web repositori system capabl high index speed page handl larg data repositori html section briefli discuss site select experi select site snapshot web repositori maintain snapshot million web base snapshot identifi top site candid site measur popular essenti count page repositori link count popular measur site pagerank popular similar link count learn refer dai fraction figur chang interv page averag chang interv dai figur percentag page averag interv chang contact candid site permiss experi site includ site yahoo microsoft stanford site result bia peopl interest site chosen select page crawl dai daili updat measur page detect month infer page month averag note estim accur page chang seldom chang page detect chang access page daili basi page detect experi verif poisson process verifi poisson process adequ model web page lemma comput long page chang poisson process time follow exponenti distribut result verifi assumpt plot time page time distribut follow poisson process figur show web page model poisson process plot select page averag chang interv dai measur time page data distribut chang shown figur horizont axi repres interv vertic axi show fraction interv vertic axi graph logarithm distribut exponenti line graph poisson process predict exist small poisson process predict observ data detail discuss issu learn fix refer plot similar graph page averag chang similar result data polici fresh ag proport dai uniform dai optim dai tabl fresh ag predict base real web data frequenc chang implic base data report page chang figur horizont axi repres averag chang interv vertic axi show fraction page chang averag interv page chang dai bar figur estim improv adopt polici assum maintain million page local synchron page month base figur assum page chang page chang page chang assum chang year crude idea polici tabl show predict fresh ag polici comput assum polici section polici optim polici significantli polici fresh optim polici proport polici ag uniform polici optim polici learn care optim polici base frequenc chang proport peopl intuit significantli ag proport polici time optim relat work refer studi improv web crawler refer focu select page initi order improv local collect contrari studi maintain collect refer studi schedul web crawler improv fresh model web page similar model crawler fresh data wareh lot work maintain local materi view work minim size view reduc queri time paper studi synchron local improv fresh ag present formal theoret foundat popular search engin report number similar studi polici studi identifi potenti pitfal optim polici improv fresh ag significantli investig real web page valid analysi base data digit inform increasingli import collect crawler data simpli refresh data care decid data poll check fresh polici studi paper make data collect refer googl van den dom approach web resourc discoveri intern world wide web cho measur frequenc chang work progress page crawl url order comput network isdn weber optim robot schedul web search engin technic zhuge stanford data wareh project ieee data engin june ullman implement data cube acm sigmod lawrenc gile access inform web page brin anatomi hypertextu web search engin comput network isdn taylor karlin introduct stochast model academ jr calculu analyt geometri widom view mainten wareh environ acm sigmod time averag fresh fresh sum fresh fresh averag time sum fresh element averag time theorem formal prove theorem proof lim lim dt lim proof ag similar analysi synchron order polici comput fresh averag polici section comput assum polici section assum element chang rate refer fresh simpli time unit make discuss concret polici synchron local element order repeatedli describ polici formal figur record order list local record element synchron iter step synchron element repeat loop forev note synchron element order order comput fresh comput fresh fresh element studi random element evolv time assum synchron element expect fresh evolv figur assum synchron initi lose gener note recov synchron process expect algorithm synchron procedur figur algorithm synchron polici time figur time evolut polici learn studi evolv interv suspect fresh averag time equal expect fresh averag interv theorem show intuit correct theorem element synchron fix interv time averag fresh time averag interv proof lim lim ji lim ni lim dt synchron fresh synchron averag fresh algorithm synchron procedur figur algorithm synchron polici converg expect lim lim dt equat base theorem comput fresh dt assum element chang frequenc synchron interv equat hold element fresh analyz ag polici synchron order element crawl figur describ polici note random order element iter appli random permut polici complex analyz polici synchron point interv synchron interv fix extrem synchron begin iter end iter opposit close synchron end iter begin iter synchron interv fix number distribut equat theorem modifi lim ds ds theorem simpli divid synchron interv fix averag weight rel frequenc interv perform deriv close form lemma time element synchron iter polici pdf synchron interv proof pdf ds ds ds ds ds ds algorithm synchron procedur figur algorithm synchron polici base lemma equat comput fresh result analysi valid element fresh comput similarli polici synchron pick arbitrarili random element polici figur describ polici formal note pick complet random element synchron rebuild synchron analysi polici similar polici time synchron random variabl probabl densiti function fresh lim ds ds note outer integr synchron interv arbitrarili larg raw rare event prove fe gamma distribut model element chang chang frequenc follow distribut comput averag function integr comput fresh assum chang frequenc follow gamma distribut comput assum synchron element fix frequenc item section appendix show fresh case ag gamma distribut paramet varianc distribut comput fresh uniform alloc polici definit uniform alloc theorem subscript stand uniform alloc polici comput averag weight gamma distribut substitut equat intuit deal varianc distribut reformul formula equat comput ag similarli comput fresh proport alloc polici definit proport equat deriv superior uniform polici proport polici section show uniform alloc polici proport alloc polici chang frequenc follow gamma distribut gener show uniform polici proport polici distribut chang frequenc deriv lemma lemma convex proof prove mathemat induct base obviou induct assum prove assum convex definit set equat equat clear proof concav similar prove fresh uniform fresh proport proof base convex function analyt form deriv polici convex appli result lemma theorem true proof uniform polici proport fresh verifi convex comput analyt form synchron order polici prove ag uniform ag proport base concav theorem true proof definit uniform proport function figur graph figur graph solut problem comput close form solv problem method lagrang solut solut fresh satisfi equat notic introduc variabl solut consist equat equat equat unknown variabl solv equat close form optim satisfi optim pair graph learn properti optim solut studi properti graph figur show graph polici explain plot graph graph equat comput optim solv equat equat equat solut equat paramet depend distribut total solut distribut prove solut equat essenti independ solut equal typic artifact method lagrang multipli equat solv analyt motiv show graph equat figur graph plot numer clear graph simpli scale version graph graph converg graph converg graph maximum maximum graph equat gener theorem satisfi equat point scale factor satisfi equat proof theorem graph essenti scale version graph shape properti solut similarli prove graph scale factor similarli prove theorem polici
Agents/808 1 programm agent flexibl qo manag ip network hermann de meer la cort antonio dept electr engin center telecommun research columbia usa istituto di informatica itali dipartimento di itali correspond address prof antonio dipartimento di itali abstract network solut network manag qo control softwar technolog boost evolut applic level control network function code deploi network dynam benefit applic applic class agent support dynam distribut control manag function flexibl effici technolog overcom problem inher current internet technolog focu attent qo local network realiz qo manag strategi variat custom applic requir network state describ experi result obtain softwar agent migrat suspend order implement flexibl qo manag ip network keyword softwar qualiti custom polici introduct reed clark coin famou argument system design shape internet significantli nowadai argument base observ function low level network redund cost suffici network control manag separ applic level control function promin reason challeng legaci wisdom inher multimedia requir applic flexibl met network real time revisit origin clark point drive forc fact flexibl led design principl monolith system network advent programm pictur chang network ultim form fact open real possibl defer design choic upward closer result function place deep insid contradict code deploi network dynam benefit applic applic long perform secur network servic network programm attract state develop infanc pragmat approach suggest java albeit vehicl rapid prototyp network protocol softwar agent system base system independ applic code dynam download roam network order perform network function behalf user applic approach advantag gain experi custom network function fly long programm true broader scale comput effici concern control transport custom demand smaller time scale exist approach reach fine grain replac ip packet code router switch extens demand coarser time combin motiv mobil agent support network control perform dedic process behalf custom insid network link region node cluster implement requir algorithm servic paper present strategi flexibl qo manag ip network base mobil agent main part paper initi section ii short review qo problem internet motiv introduct programm softwar section adopt refer architectur concept introduc coordin commun mechan agent illustr section iv present algorithm implement resourc reserv strategi signal section introduc heurist approach determin figur merit bandwidth alloc section vi show result obtain measur network testb base mobil agent platform section vii comment fair reserv algorithm traffic section present point futur work extens ii qo internet programm network qo relat multimedia applic quantit express subject object criteria term user satisfact user satisfact larg depend continu media audio video data present distribut data transport process kind dedic resourc provid tradit internetwork data commun environ larg packet highli flexibl effici data transport resourc share multiplex impli qualiti respect time deliveri mean highli util network process desir servic provid point result temporari delai rel throughput delai deterior qo substanti type counter measur provis dedic resourc adapt applic long pain struggl internet commun royal resourc reserv earli nineti initi optim embodi atm implement earli model resourc reserv qo larg extend flexibl concern result lower ietf standard bodi respond roll back ip network resourc reserv concept pertain result model part flexibl problem solv face heterogen scalabl ietf commun ad perspect spectrum measur qo support provis differenti servic class give explicit resourc reserv result model reli state insid core approach solut scalabl earlier concern remain scalabl complex remain signal procedur face limit qo predict result servic cost factor benefit servic differenti qo support matter belief review histor process provid qo support tion made increasingli clear reserv scheme atm scale core network question qo provid stateless approach singl solut challeng question wouldnt desir leav state implement state implement custom implement trade cost servic qualiti prefer capac network servic flexibl configur vision provid custom servic parallel demand repres larger organ compani subsidiari reli servic provid model pai impli satisfi accept qualiti prefer implement type servic standard framework architect network resourc base programm network suggest appli paradigm spawn network follow similar platform map rapid prototyp network faster time scale servic major incent approach polici implement admiss reserv strategi agent discov resourc insid network claim resourc behalf custom figur merit captur bandwidth claim loss risk incur due high util monetari cost measur claim resourc state network custom follow figur merit negoti concept base assumpt custom vari pai resourc circumst vari custom custom time singl custom result approach advantag agent capabl trigger adapt applic insid network behalf custom resourc diminish amount useless data reduc signal overhead agent perform adapt line figur merit mention incorpor custom polici prefer concept combin resourc explain minimum qualiti servic relat custom adapt perform base share excess resourc resourc claim coarser scale resourc reserv inclin talk virtual link virtual network custom behalf custom granular time space resourc reserv agent perform coarser scale flow flow adapt perform rel virtual network claim custom mobil agent provid highest flexibl carri applic specif knowledg network locat philosophi similar recent express activ network commun project activ extens softwar complement activ messag full scale programm network investig programm level lower oper system term programm network provid underli network program environ similarli darwin project leverag complet internet protocol stack build top note preclud underli trigger project programm network commun rest focu definit implement basic agent interact reserv protocol signal admiss control qo adapt control limit studi experi involv control load servic class servic control load servic requir attent due definit closer servic class propel framework iii environ qo manag mobil agent investig research deal distribut system monitor manag appli technolog similar scenario develop fulli programm map agent develop manag mobil agent fulli creat java mechan wake deactiv activ commun migrat order run task assign map suitabl creation distribut applic secur mechan base asymmetr kei authent access control compliant masif standard vl vl vl core network edg router router edg router edg custom custom custom user user user fig agent server gener order advantag agent technolog qo approach base set special agent dynam decid amount resourc assign virtual link signal mechan alloc request bandwidth refer depict figur assum set custom constitut user exchang data custom public privat entiti group user custom access core network edg repres access point extern world core network made set router establish virtual link custom vl group physic connect user belong custom set vl constitut nowadai referenc virtual programm network edg router receiv request vl creation custom behavior user decid set vl remot custom request set vl arriv edg router core network role edg refer figur show softwar modul execut assum router origin request vl creation router receiv request agent involv edg router ffl receiv open request vl custom creat manag request ffl manag vl send messag open request remot edg router wait arriv collector agent router agent ffl receiv request vl creation connector agent creat charg manag vl ffl vl connector identifi vl identifi agent vl execut remot edg router ffl period creat connector task travel router edg router collect inform state network custom coordin connector connector connector collector collector collector request vl creation vl vl vl network core network statu collector vl creation request coordin fig agent edg router router vl core network agent task collect statist condit network agent ffl collect inform bandwidth reserv collector agent time requir ffl collect inform total bandwidth occupi output port collector agent time requir router router collector collector collector edg router edg router core network fig agent present router clarifi process set vl order agent coordin illustr step refer figur coordin agent edg router receiv messag set creat agent run agent send messag coordin agent present edg router send data messag connector agent creat connector discov path edg router send list cross router collector agent creat collector receiv migrat router core requir local agent inform bandwidth reserv requir local agent figur inform total bandwidth calcul free bandwidth assign collector agent store identifi edg router vl share output interfac vl establish data collector migrat repeat oper collector collect inform state router core network path edg router collector reach edg router pass collect inform vl cross router output interfac connect serv collector bandwidth agent figur appli custom polici resourc reserv custom adopt deleg agent network role appli enforc polici fix custom chang agent framework bring deep insid network section describ polici implement testb idea algorithm condit vl resourc percentag resourc regard updat paramet reserv outlin migrat collector agent edg router edg router place period execut avoid problem collector agent program kill execut open vl exist router migrat avoid collect potenti inform consequ exist vl set data relat statu modifi iv algorithm resourc reserv algorithm execut agent order implement reserv polici consist distinct shown figur phase fix qualiti custom assur agent firstli reserv bandwidth origin requir applic resourc verifi execut figur merit depend network paramet paramet pai user obtain high qo idea check feasibl provid amount reserv bandwidth lower origin long perform averag loss maintain admiss valu resourc network suffici meet request phase algorithm start agent requir agent manag vl give part resourc requir strong coordin action agent manag vl establish agent build inform commun collector start execut full execut phase phase accept vl collect cross bandwidth vl vl creation coordin agent reduc bandwidth assign exist vl fig algorithm list router resourc creat vl router list record store reserv vl cross router router agent send resourc request messag agent relat reserv vl cross reduc amount bandwidth succe collect router remov list procedur repeat subsequ list agent obtain creat vl singl router path vl requir sum agent vl creation qo requir custom figur merit previou determin amount reduct bandwidth reserv identifi approach heurist aim identifi relat loss ratio bandwidth alloc vl figur merit express relat alloc bandwidth averag packet theoret practic util main extrem difficult obtain measur delai end point due clock deal servic feasibl delai constraint reserv carri term alloc bandwidth section describ trial carri figur merit evalu execut algorithm previou section defin factor ur percentag assign resourc respect total amount resourc requir vl ur mean perform vl reserv connect ur mean vl connect figur show environ edg router custom repres testb host tx rx edg router connect core network repres network router connect dedic link perform experi protocol signal resourc reserv host testb network sun workstat solari oper protocol sun host instal equip network interfac card configur router tx rx node emul aggreg traffic gener testb real descript experi term connect denot defin virtual link implement protocol sun host exploit main function support effort control load servic mechan provid link share accept traffic type class base queu mechan consist estim packet schedul refer architectur classifi custom rx tx custom core network router edg edg router router router fig network architectur evalu mechan incom packet estim bandwidth usag class select class send packet schedul support borrow mechan defin integr servic work group control load servic mean connect avail extra bandwidth traffic class immedi return owner network bandwidth partit link router class set network administr devic estim traffic load devic perform bandwidth suppli link connect subdivid ffl reserv ffl traffic lent reserv ffl traffic lent reserv connect repartit dynam chang drop connect reactiv gener inform stream tx workstat rx workstat tool gener traffic specif statist defin paramet perform measur percentag loss ratio delai order relat loss ratio amount bandwidth appli reserv polici section perform experi tx workstat send rx workstat number udp inform exponenti distribut depart time core router reserv connect assign inform stream form aggreg traffic provid paramet traffic relat connect reserv connect case fulli occupi bandwidth assign router number reserv connect vari emiss rate reserv connect number udp packet payload size set byte router load effort sum interarriv time exponenti probabl constant interarriv time udp packet payload size set byte vari number load vari dedic link capac fig averag loss ratio versu factor vari traffic load measur loss ratio experi averag obtain depict graph figur averag loss ratio versu factor vari effort load shown perform depend distribut load suppli reserv graph give indic minimum factor accept function total figur merit reserv algorithm execut experi carri verifi level qualiti servic term averag loss maintain reserv resourc requir virtual link amount reserv vl accept profit network manag make user pai reserv bandwidth vi result qo manag polici order verifi effect qo manag set trial softwar agent implement algorithm section iv network architectur shown figur core router load reserv connect deriv constant bit rate traffic sourc emit frame packet effort constitut addit load bandwidth suppli link core router divid previou reserv traffic inherit reserv traffic inherit reserv connect set experi carri aim show system behav vl requir reserv bandwidth alloc total load low experi introduc extra load network due presenc vl load network effort traffic experi check system behav stringent qo requir test made requir loss ratio higher addit load set total bandwidth load offer reserv connect foreseen kind connect complet reserv agent system creat connect request term maximum loss ratio addit load system creat complet reserv connect singl connect factor graph figur loss ratio higher phase algorithm figur requir resourc agent connect case factor calcul curv figur variat reserv reserv reserv connect connect connect connect connect tabl test valu reserv connect ad connect ad connect loss connect connect connect connect tabl ii test percentag packet loss ratio loss connect assign connect shown tabl notic connect lent part bandwidth assign incom connect due fact algorithm minim number connect interact vari assign reduc signal overhead connect maximum resourc figur measur averag packet delai loss ratio note reserv connect slightli affect carri creation connect tabl percentag packet loss ratio shown connect ad due fact total load network low test test scenario previou case addit load network repres gener byte exponenti distribut interarriv gener byte uniform distribut total load repres total bandwidth suppli link case connect requir maximum admiss loss add featur previou system graph figur bandwidth reserv order creat observ progress delai notic connect reduc reserv period perform degrad comparison condit full reserv qualiti servic term requir packet loss maintain tabl reserv reserv connect connect connect connect connect tabl iii test valu reserv connect ad ad connect load total loss connect connect connect connect tabl iv test percentag packet loss ratio loss connect delai delai delai fig test progress delai connect test test network load test reserv connect requir loss ratio higher graph figur factor higher tabl show reserv connect algorithm figur appli progress delai suffer connect lent bandwidth cross transient settl qualiti servic requir connect ratio higher shown tabl vi mobil creat system dynam introduct qo manag servic agent decid amount resourc assign virtual link signal mechan alloc reserv bandwidth virtual granular time space resourc reserv scale flow base approach experi perform primari interest perform greatli depend reserv reserv connect connect connect connect connect tabl test valu reserv connect ad ad connect loss connect connect connect connect tabl vi test percentag packet loss ratio loss connect implement softwar tool emul hardwar function router outlin point test carri agent manag stationari edg mobil network agent task manag aspect qualiti vl test carri agent system confirm system architectur figur carri task regard collect inform state network applic algorithm averag valu report collector agent regard bandwidth router close valu traffic gener condit network figur merit fig system deduct reserv appli virtual link exchang messag agent lend resourc delai delai fig test progress delai connect result function effect vii impact reserv strategi traffic previou test shown softwar agent custom polici appli network note agent polici resourc reserv base avail resourc network inform interest custom low util addit resourc altern adapt strategi consid heurist result present figur merit fig agent approach incorpor custom polici applic adapt insid network adapt trigger agent enhanc fair reserv scheme regard effort traffic traffic offer reserv vl perform vl offer effort traffic excess agent adapt reserv portion data stream discard drop enhanc layer case layer code emiss rate user custom consid commun scenario previou test figur borrow mechan disabl core router subdivid mbit assign reserv remain transmiss traffic router load data stream reserv consist exponenti traffic packet size equal byte variabl averag rate shown figur bold line graph reserv connect emiss rate driven interact tool minut stream reserv stream fig time progress averag load offer data stream averag averag loss ratio averag rate packet receiv rx node observ window measur figur long reserv traffic fulli mbit assign perform traffic influenc presenc reserv traffic reserv traffic portion includ mbit manag traffic contribut loss ratio minut transmiss averag delai loss probabl stream remain graph averag rate receiv packet reflect time progress traffic offer stream averag delai averag delai averag averag averag loss averag loss fig averag averag loss probabl averag rate receiv packet rx node observ window reserv stream stream minut traffic till reach long reserv traffic remain averag delai stream slightli loss ratio remain low averag rate receiv packet reflect real progress offer wider fluctuat comparison previou minut minut begin reserv traffic worsen perform stream averag delai amount lost packet packet rate measur destin node reflect time progress traffic sourc perform effort traffic consid excess adapt mechan start activ agent interact tool adjust frame progress time interv averag emiss rate reserv connect mean packet loss ratio traffic reduc level fair assur experi show adapt polici establish custom activ depend dynam inform agent monitor insid network side inform enhanc layer network level difficult setup embodi agent transport edg router flexibl agent approach fact network predefin strategi appli demand viii softwar agent dynam custom qo manag function high flexibl increasingli requir heterogen network high variabl applic requir met paper framework qo manag base mobil agent present implement agent base approach shown custom polici implement reserv strategi agent oper insid network behalf custom figur merit express bandwidth request loss risk incur polici introduc assur minimum qualiti reli share extra resourc agent trigger adapt applic insid network proof testb consist ordinari unix emul oper develop experi carri order valid previou idea perform issu circumst result obtain demonstr feasibl qo manag complement softwar agent acknowledg work partial fund italian dell universit della ricerca framework project methodolog tool high perform system distribut refer tool ds wa ad jm smith activ network architectur ieee framework network internet novemb zhang framework qo combin differenti servic internet draft march shenker integr servic internet overview rfc june resourc reserv protocol version function specif rfc septemb mobil agent enabl technolog activ intellig network implement ieee page da hg de ks spawn network ieee page hg de survei programm network acm comput commun april hg de da genesi virtual network oper system spawn network architectur ieee int conf open architectur network march ts eugen zhang resourc manag customiz network servic sixth ieee intern confer network protocol octob dm chess mobil good idea ibm technic report octob gener gmd ibm mobil agent system facil joint submiss omg omg tc document novemb de jp tunnel agent enhanc internet qo ieee de manag qo softwar agent cybernet intern al survei activ network research ieee commun januari floyd jacobson resourc manag model packet network transact august mr genesereth sp ketchpel softwar agent commun juli rothermel mobil agent lectur note comp intellig emerg technolog gener san march sun microsystem reserv protocol ver port sun workstat isi ver al omg mobil agent system facil intern workshop mobil stuttgart septemb ieee network special issu programm network vita design implement mobil agent platform journal system publish dp jh dd clark commentari network argument ieee jh dp dd clark argument system design acm transact comput novemb weiss architectur differenti servic rfc decemb specif qualiti servic rfc septemb specif network element servic rfc septemb resourc reserv protocol ieee septemb
Agents/809 1 approach design intellig team train system michael thoma john richard volz depart comput scienc texa colleg texa abstract paper present knowledg approach design team train system intellig agent train system team train put practic team skill import role intellig agent virtual team tutor carri agent equip understand task team select process belief team mental state exist agent teamwork model incorpor element list analyz inform team member support proactiv agent interact encod team develop base bdi call petri net model individu agent plan inform deriv role descript repres rule algorithm introduc detect inform flow gener team interact keyword team team introduct train industri critic success industri train great reduc cost autom aspect train recent import team train teamwork import busi manag sport emerg definit team group entiti work achiev goal accomplish effect team member plai uniqu requir uniqu skill resourc team author role team deal share inform distribut call cooper team focu individu skill typic learn optim commun maintain situat effect group great deal research invest develop technolog multimedia tutor system attempt carri user model determin student doesnt tend fall categori potenti defici knowledg anticip directli test cognit model student understand construct compar expert model task determin differ current system typic focu individu intellig agent extend method build train system team train put scenario refin team skill import role intellig agent plai system virtual agent substitut team member partial team provid huge cost reli produc realist behavior interact major role agent plai role reliev load human trainer carri intellig agent equip understand task team select process agent reason goal goal team team member share commit requir belief reason view base vast amount literatur written mental thought essenti effect teamwork introduc architectur support type belief reason requir build approach compon introduc languag call logic languag encod defin syntax encod teamwork base team ontolog languag provid relat plan describ domain ideal team behavior ontolog defin semant predic encod teamwork method automat gener coordin intent contract net theori approach interest structur domain role document virtual agent interact human commun realist explicit goal hierarchi intent import problem team behavior provid feedback work establish joint intent team member achiev joint inform team member order provid inform proactiv focu approach descript team defin interpret convert descript form gener belief reason theorem high comput complex action interact team easili encod petri natur pr system design execut plan dynam incorpor analysi inform plan find inform team member analysi plan petri net explicitli captur plan knowledg inform show descript formal languag translat petri net agent team team situat petri net feel adequ start point commit choic spectrum tradeoff express effici compon provid algorithm virtual agent make base petri net argu crucial mental state team member belief reason agent track state agent action base belief defin rule gener algorithm make agent context team focu approach collabor execut plan dynam plan organ understand action individu team complic explicitli involv reason member team action implicitli support team goal agent approach model team member maintain simplifi model mental state member team avoid issu comput complex belief reason modal petri net approxim mental state team member decid reason action achiev reason state focu make teamwork effici anticip action expect inform exchang provid proactiv accomplish languag encod teamwork ontolog underli framework base bdi model repres knowledg desir repres gener goal agent intent repres select plan agent present ontolog identifi gener concept relationship occur teamwork multipl domain give formal definit basi languag primit term mean languag base predic logic encod teamwork number predic express team work domain basic predic declar type term unari predic associ symbol specif class teamwork concept predic repres relat term basic object type predic concept team domain specif class object defin team unari predic defin member team defin virtual agent defin human team structur process gener term role specif individu team unari predic defin role make assign relat capabl gener role member team plai interest team defin relationship member role stage turn describ team real world domain flight control space sequenc specif stage team land unari predic defin stage team goal individu chang stage stage assum stage total repres interv logic condit defin subset state world treat goal proposit agent environ involv complex constraint goal conjunct condit note goal associ set action plan action assum primit interrupt plan view hierarch structur leav hierarchi repres primit action action defin similar strip set condit plan serv multipl multipl plan achiev manner similar introduc repres plan procedur languag introduc plan defin assum action action plan assum postcondit action action plan defin constraint mean action occur action causal link written si sj read achiev causal link serv record step si achiev precondit casual link repres relat goal defin identifi plan achiev goal core base predic relat basic class team interact gener begin defin relationship set set role share reach goal stage semant express base work cohen levesqu map joint intent effect commit agent action differenti kind redund share multipl agent agent carri independ multipl agent action damag accomplish unnecessari effort kind redund agent team monitor movement enemi report command report inform wast commun bandwidth repres redund role individu share competit share multipl agent agent carri multipl agent action risk failur kind share competit team member save ball collid lose point repres share competit share complementari requir multipl agent cooper carri share complementari agent share move heavi tabl defin share complementari requir simultan commun role synchron action observ relat concept kind team commun decid persist goal stage team commun decid persist goal goal stage team commun build joint intent stage synchron wait act readi capabl capabl relationship role action contrast capabl team member plai agent kind capabl put role requir set capabl defin capabl capabl role capabl action distinguish kind backup capabl kind action team member time interf call backup capabl repres capabl individu capabl role repres share conflict capabl kind action role action action turn failur due call share conflict capabl repres share cooper capabl kind action role independ cooper defin share cooper capabl repres belief belief import reason anticip action express extend incorpor belief straightforward belief role assert specif team member make mutual belief agent assum share common knowledg capabl involv agent belief assumpt relax human team member fact proposit repres dynam note individu action oper convert belief statement agent action requir execut agent believ true implic elect achiev agent eventu true simul type belief reason present reason belief intract petri net algorithm introduc address cost express lead adequ effici tradeoff approxim belief reason involv commun commun import teamwork commun team member coordin collabor commun complic petri net repres introduc barbuceanu fox al commun repres invoc protocol fsm finit state machin describ commun process interrupt condit fsm end success commun achiev commun fail list protocol broadcast team broadcast announc team respond multicast commun fsm defin σ set σ set atom action δ transit initi state set final state defin commun polici commun interest topic hope incorpor idea focu discuss commun paper team domain order illustr ontolog team present algorithm construct petri net gener team introduc real world domain nasa mission control center consist team arrang hierarch manner delin role team member flight director disciplin monitor function space shuttl disciplin hierarch organ disciplin leader specialist system disciplin system offic oper space shuttl orbit maneuv system reaction control system secondari engin orbit dock burn prop assist engin offic consum offic prop offic vertic chain interfac disciplin member con offic sit consol separ room flight control room call support room launch fd prop offic statu check disciplin readi launch prop offic check member check consol report prop offic prop offic report statu back fd readi launch role con assum commun channel reach prop con report prop assum virtual agent shown figur plai con base mutual belief share capabl mutual understood agent involv figur nasa mcc team causal achiev con similar gener petri net plan petri net suggest implement intellig agent teamwork petri net good repres action framework repres depend action natur input place transit effect action simpli output place connect transit simul extra input place enabl fire token present mechan control choic plan handl team stage similar petri net good repres synchron requir figur petri net model plan gener petri net construct algorithm introduc figur petri net model plan petri net repres belief straightforward order incorpor agent belief petri introduc type node call suitabl semant belief node hold type repres proposit believ repres believ absenc type token lack import aspect team situat color petri net standard color petri arc transit belief node label restrict type token satisfi input deposit output transit belief node uniqu multipl token deposit singl reduc multipl ts cancel ts fs occur cancel revert interpret back uncertainti place proposit network merg import maintain consist transit effect belief true propag transit depend belief ad output transit back belief node input action undo explicitli list effect readi introduc algorithm gener petri net role team algorithm call algorithm gener plan pass argument combin petri net merg proposit node relationship role plan indirect role relat goal goal relat plan relat action algorithm translat input effect output link transit construct step algorithm merg belief node proposit connect base causal link algorithm goal place serv control petri net petri input place transit fire petri net model plan execut goal current token put goal place relev plan execut hold appli construct petri net plan shown figur subnet role goal plan solv goal append subnet mention set relat role creat place label creat input place plan creat output place plan action creat creat transit label input place output place action causal link merg output place condit casual link input place condit casual link order constraint constraint causal link action add place node action transit base order constraint input place output place action merg input place output place action transit label gener interact petri net addit gener petri net determin interact place agent concern detect ambigu multipl agent accomplish determin inform exchang agent present algorithm accomplish detect ambigu team base share knowledg agent initi commun team member resolv detect ambigu detect inform agent resolv request inform agent detect inform agent resolv provid inform agent plan role offlin onlin capabl figur team interact gener inform flow commun protocol team interact accomplish task simul inform flow gener team interact offlin onlin shown figur agent analyz petri net agent order deriv inform flow identifi proposit agent defin inform flow proposit piec inform provid set role provid inform achiev maintain set role inform agent piec inform proposit map input place transit petri net action agent execut carri petri net model gener agent involv determin inform flow petri net set input place transit set output place transit τ step gener inform flow offlin provid inform determin agent transit output token belief node agent inform proposit input transit agent set place output transit input st petri net agent set place relat input transit agent set st petri net proposit agent proposit agent set give set flow call illustr top half figur onlin base knowledg inform current algorithm gener team interact determin current identifi inform empti input place transit carri case petri net exchang pertin inform oper algorithm determin set candid team interact supplement set action agent resolv issu specif action direct priorit choic commun channel team algorithm start identifi activ goal agent current inform agent agent intend accomplish invok commun resolv conflict depend type agent find block transit petri net gener request inform proposit effect agent commun inform agent agent transit depend place token incorrect token petri net goal petri net argument unclear context goal role ri append append ri append τ transit petri net γ append τ transit petri net ω transit petri net ai input goal node token append return illustr back shuttl control team receiv command prop resolv goal check find involv commun setup joint intent figur assum joint intent built put token goal place check input place current transit find input place token fire delet token input place ad token output place belief chang token loop back reset check find input place current commun perspect commun occur network synchron mean agent time agent perform action order achiev weaker form synchron agent select team agent achiev protocol refer transit token fire transit report prop offic statu reach goal state stop execut plan futur work present languag base ontolog specifi semant capabl team action plan team enabl team belief mental state base agent design behav virtual team member train uniqu featur approach dynam gener proactiv team interact analyz inform flow agent algorithm teamwork model implement virtual team member intellig team train serv teamwork coach agent assess process perform team train order agent build model user explain central depend interact reli team context petri net serv user error identifi structur differ miss compar expert model intellig team train system reduc time cost train team staff domain mission control applic futur work focu plan recognit infer probabl token mark petri net base observ action agent model behavior problem cooper inform flow acknowledg research partial support fellowship grant seed fund texa engin experi station train system scienc technolog initi refer agent architectur practic teamwork nation confer artifici intellig rhode island van systemat develop team review literatur human factor research institut technic report reactiv reason plan nation confer artifici intellig languag describ coordin multi agent system intern confer system jd open agent architectur softwar agent rg contract net commun control distribut problem solver ieee transact md team make review model approach emploi petri net train perform base color petri net intern artifici intellig modern approach prentic upper saddl jy guid complet complex modal logic knowledg belief artifici pr hj teamwork nou special issu cognit scienc artifici intellig bdi theori practic intern confer multiag system limit inform enhanc group stabil intern journal framework develop team perform measur train team perform assess applic princ lawrenc erlbaum nj hang evolut intellig tutor system research intern confer intellig tutor system mw cognit model intellig tutor artifici intellig theoret base team foster share mental model advanc interdisciplinari studi work jai
ML/810 6 framework program initi design result sebastian thrun comput scienc carnegi mellon pa abstract paper describ program languag robot equip sensor actuat ce found program support comput uncertain support adapt teach mean program innov facilit rapid develop softwar demonstr mobil robot applic introduct paper introduc languag program robot short support develop adapt instruct robot ce interleav phase convent program code improv exampl ce support comput uncertain encount system exist complementari methodolog program pursu convent program includ teach learn vast major success robot program procedur languag java environ complex develop robot softwar incur substanti combin empir analysi research successfulli substitut induct learn convent program develop train softwar perform task train artifici neural network map camera imag steer direct autonom land vehicl approxim minut system provid remark level skill drive type road wide rang condit code skill manual work colleagu shown demonstr adapt reduc design time robot softwar substanti recent emploi neural network sensor interpret map task led mobil robot successfulli navig crowd public place argu neural network led softwar provid enhanc level flexibl robot easili retrain demonstr recent aaai mobil robot competit import learn robot long recogn enorm research effort learn impact robot partial research robot learn design learn amount knowledg minimum virtual robot research reinforc learn evolutionari comput seek establish algorithm learn entir map sensor actuat scratch field resort narrow full observ environ abund train data current demonstr reinforc learn robot solv simpl coordin leg visual servo paper advoc integr convent program learn argu convent program rasa learn end shown figur end wai instruct uniqu strength weak convent program program oe teach figur complimentari wai instruct convent program teach exist robot live close extrem research seek integr robot instruct mixtur program teach prefer make robot straightforward express complex structur procedur convent program code exampl aspect robot softwar easier program teach mean learn desir goal integr convent program learn find wai develop softwar effort paper present program call design facilit develop adapt softwar system program ce interleav convent code develop learn ce programm leav form function artifici neural network fill programm train provid exampl desir program behavior program learn bridg gap program behavior paramet function ce possess assign mechan mechan adjust paramet function approxim improv program perform ce differ convent program languag aspect relev programm abil comput uncertain inform inform sensor noisi limit limit robot abil state environ ce data type repres probabl distribut independ comput probabl distribut analog comput convent data differ cess probabilist variabl assum multipl valu time probabilist natur variabl robust ce extens highli popular program languag choic base ce seek retain advantag offer concept adapt softwar probabilist comput programm system assum reader familiar remaind paper describ major extens probabilist comput learn idea learn mechan ce reli probabilist natur variabl paper describ depth develop program mail deliveri illustr convent program teach close integr ce show cess probabilist sensor data process robust wai discuss shortcom current approach reader notic ce implement exist interpret compil empir result obtain implement function librari function differ syntact result report view probabilist comput ce section describ cess probabilist data function kei idea handl uncertainti variabl describ probabl probabl distribut variabl close obstacl simultan valu weight numer likelihood independ comput probabl distribut analog comput convent valu draw section describ major probabilist data oper function end introduc mechan lack direct analog land convent convolv data oper probabilist data type ce method probabl theori repres process uncertain inform uncertain inform repres collect data type parallel exist data type float data type refer probabilist data type notic numer data type possess probabilist data type call dual data type declar variabl repres probabl distribut valu variabl declar integ probabl variabl axiom valu sum properti languag close correspond probabilist data type dual convent numer data type repres singl probabilist data type repres probabl distribut valu probabilist data type gener convent data type enabl variabl multipl valu time integ correspond special case probabilist variabl valu probabl shown close correspond comput valu comput probabl distribut valu exist straightforward wai merg convent probabilist data repres probabl distribut probabilist variabl dual hand valu extrem number arbitrari probabl distribut float point valu byte resolut statist literatur offer compact mixtur gaussian constant function approxim tree method current implement probabl distribut repres constant densiti function granular function determin set variabl prob dist default constant ce offer varieti wai assign distribut probabilist variabl statement assign distribut probabl center ae finit probabl distribut list list consist tupl number probabl assign assign distribut probabilist variabl ce possess definit commonli probabl distribut statement initi probabilist variabl uniform distribut interv statement assign normal distribut varianc predefin constant ce cover larg number common distribut directli distribut combin arithmet oper altern initi probabilist variabl arithmet oper arithmet probabilist data type analog convent arithmet assum probabilist variabl type possess ae statement gener valu sum probabl product margin arithmet oper perform domain probabl distribut import notic ce make implicit independ assumpt righthand operand assign comput ce assum stochast independ issu independ ce revisit section type ce mechan type interest convent probabilist variabl declar declar statement assign distribut probabl mass center ae assign distribut ce offer collect altern function convert probabilist variabl numer valu comput maximum likelihood varianc probabilist variabl probabl individu valu probabilist variabl rang access librari function prob function accept logic express comput probabl express probabilist variabl hand statement assign probabl smaller type probabilist variabl dual truncat probabilist truncat remov valu probabilist variabl truncat librari function truncat identifi largest probabl set probabl current probabl smaller bound time largest probabl bound type float lie code segment gener probabl distribut largest probabl remov valu probabl smaller valu probabl smaller normal remain probabl valu lead distribut truncat remov valu futur speed comput situat event truncat reduc comput time order magnitud margin chang result probabilist oper probabilist variabl repres probabl distribut function comput undefin probabilist arrai prepar result discuss briefli present obviou ce program averag distribut domain denot distribut domain averag averag express repres distribut code segment index pr assign pr averag distribut independ ce comput probabilist ce make implicit independ assumpt probabilist variabl statement type ce assum ce assum joint distribut product margin import notic independ assumpt result statement demonstr assum ident ae reader quickli notic absenc independ assumpt similar assign ce independ assumpt fact ce possess infer mechan type network import consequ obviou initi condit result distribut slightli complic sequenc statement lead distribut execut variabl assum independ statement constraint probabl distribut ce track implicit depend assign comput relat ce popular framework comput probabilist discuss end paper independ assumpt essenti comput strict mechan programm explicitli maintain depend call compound permit creation probabilist variabl describ full joint distribut variabl make trace depend correctli sequenc statement compound compound data structur enabl programm comput probabl distribut syntax struct convent declar compound creat variabl model probabl distribut dimens integ margin distribut compound variabl access xb refer margin distribut project da dc compound variabl result alloc memori full joint distribut gener dimens compound variabl size joint distribut space grow exponenti dimens number probabilist compound probabilist variabl probabilist long operand type dimens access margin requir addit memor explicitli command access individu event cover probabilist variabl power tool process probabilist inform command command enabl programm handl probabilist variabl regular loop valu syntax command list probabilist variabl separ regular ce code variabl list empti command interpret variabl probabl distribut execut combin valu variabl except probabl insid type variabl convert dual read valu variabl write valu probabilist variabl iter ce cach probabl combin valu probabilist variabl effect probabilist variabl construct probabl distribut probabilist variabl bodi command chang variabl list declar insid command illustr instruct loop combin valu variabl except probabl execut resid cach probabl assign valu assign probabl probabl probabl probabl complet result convert probabl distribut variabl mention ae notic assign ce automat normal result probabl distribut integr command appli complex loop code segment int gener probabl distribut notic actual number iter probabilist variabl number iter depend insid command solut problem section side effect cess independ assumpt sequenc statement discuss piec code gener result intuit correct command enabl programm manipul individu element probabilist variabl insid ce track implicit probabilist depend variabl command sound probabilist variabl command major limit li comput grow exponenti number variabl variabl type imposs loop valu sampl variabl predefin sampl variabl prob dist resolut effici command reader notic assign probabilist variabl left probabilist variabl hand side list oper multipli distribut ce featur special oper integr probabilist possess dual convent oper denot call oper multipli probabl distribut probabilist variabl repres distribut pr pr domain statement assign product distribut pr pr pr domain normal ensur express integr pr pr result statement undefin oper integr independ sensor inform rule estim quantiti sourc proxim obstacl mobil estim obtain sonar estim obtain laser rang finder statement integr probabilist variabl evid singl distribut inform integr kalman filter dynam belief network ai algorithm deal independ probabl distribut make formal estim quantiti set sensor denot estim base singl sensor problem integr result multipl sensor data consist estim languag probabl face problem comput condit probabl probabl express js assumpt sensor read independ refer assumpt written desir probabl express js denomin depend constant desir express ff normal ff probabilist variabl statement assign probabl probabilist evid type assum appli rule equat yield ff depend transform fi normal fi induct yield fl normal fl function increment updat equat realiz repres repres repres distribut term omit effect approxim averag section oper specif integr inform time subroutin obstacl proxim comput distribut obstacl distanc base sensor data record mobil robot iter applic assign dist dist comput obstacl past sensor read variabl proxim assum type note oper ident evid integr step kalman filter dynam belief network approach deal integr probabilist inform integr probabl distribut justifi condit independ independ true measur variabl assumpt interpret assumpt measur independ multipl measur learn ce probabilist data function return issu integr convent program teach program ce activ interleav convent code develop learn program mobil robot programm start basic level leav program train robot provid inform gap programm resum code develop implement level addit train program phase convent program program flexibl typic depend rel difficulti merit program teach program teach cess learn mechan capabl chang paramet function approxim programm modifi creat program code directli paramet type default descript step size float step size gradient descent momentum float momentum param init rang float initi paramet rang min max gradient float bound gradient size learn flag int learn flag tabl control paramet function approxim ce function approxim ce ce possess function approxim paramet modifi base exampl function approxim paramet estim train ce program declar fa creat function approxim call adher convent function function approxim possess group adjust control intern control paramet group paramet modifi automat ce train program programm neural paramet weight network group paramet control paramet set programm ce offer control paramet list tabl modifi initi default paramet command denot function paramet tabl desir paramet code segment fa set step size function approxim group paramet intern control paramet input output dimens function approxim natur paramet configur function refer function approxim configur field type specifi type function approxim linear dimens input output space field field type variabl impact number discuss field addit paramet specif function number hidden unit neural network function call configur neural network output hidden input convent float output function approxim configur function approxim convent statement function approxim map variabl vector float compound command output function approxim train paramet function approxim adjust minim error actual desir gradient descent desir valu set symbol train oper statement specifi desir variabl current point program train oper cess credit assign mechan chang paramet function approxim contribut learn flag small amount direct minim deviat train oper permit combin variabl type variabl share induc error basi paramet depend variabl dx dy probabilist dx dy probabilist kei featur ce programm provid target signal directli output function approxim suffic provid target signal valu depend paramet function approxim code train instruct mobil robot turn parallel wall float float fa angl turn angl turn programm amount direct robot turn parallel wall assum store variabl target turn target valu modifi paramet modifi function map sonar measur angl assum sonar scan variabl pi numer constant ce updat paramet gradient descent solv problem credit time variabl updat ce comput gradient respect relev function approxim paramet weight neural depend function approxim annot gradient field measur depend paramet function approxim chain rule differenti enabl ce propag gradient valu ce detect paramet influenc variabl sum gradient train oper error deriv chain rule appli updat paramet contribut function approxim mechan version gradient similar backpropag algorithm gradient propag ce program code gradient propag variabl learn flag set section import probabl learn probabilist comput kei enabl factor learn mechan ce convent code differenti statement assum type float probabl program statement similar type probabl alter gradient gradient descent chang learn occur pictur probabilist variabl type statement differenti ae ae notic gradient probabilist ce program essenti differenti observ crucial probabilist comput compon learn approach independ compon ce current credit assign mechan fail case cess learn mechan fail convent variabl conjunct statement literatur automat program differenti function approxim probabilist variabl function approxim probabilist input output correspond convent variabl section explain function approxim probabilist variabl ce input function approxim probabilist function approxim run combin input valu output weight probabl input vector averag command output function approxim pictur problemat function approxim integr ce solv dilemma convert output interpret output function approxim desir probabl input output function approxim figur real world interfac robot research schemat robot environ dimens dimens ce consid function approxim function probabl dy comput distribut ce loop valu input probabilist comput denomin comput output ce sampl function resolut probabilist variabl involv resolut easili chang sampl distribut granular learn gradient input variabl respect function approxim propag function approxim chain rule differenti program mail deliveri robot ce section illustr develop program ce demonstr robust softwar develop ce extrem effort present final emphasi describ process softwar involv convent code train robot shown figur equip color arrai sonar wheel encod odometri odometri measur consist rel chang head direct distanc travel comput overhead camera imag automat resolut pixel robot control directli set translat rotat veloc perform program task mail deliveri offic environ shown figur task requir collect skill robot carri left hand hand hand gestur gestur gestur figur posit neg exampl gestur wait locat home postal carrier arriv carrier hand mail robot local deliveri mail shown figur inform robot natur carrier instruct robot mail deliv locat left robot locat mail hand figur show exampl neg train exampl robot move acoust peopl adjac offic robot pick mail mail robot return home posit robot avoid obstacl wall peopl step robot perform recogn gestur camera imag navig target destin stop place environ ambigu distinguish featur door nich locat make difficult recogn target locat home posit corridor popul corrupt sensor read program exploit fact robot oper singl corridor enter offic program mail deliveri robot develop local routin routin recogn robot locat head direct global cartesian coordin frame base sonar scan develop code navig goal locat develop softwar recogn gestur camera schedul coordin requir activ reader notic result report base prototyp implement ce function librari prototyp function languag declar oper involv function call statement implement translat ce local corridor angl integr corridor angl target integr corridor angl target test set time figur estim corridor diagram show local extract singl sensor read diagram show integr corridor obtain text solid white line depict label program train diagram show perform test set horizont axi correspond vertic axi angl darker higher likelihood corridor angl begin develop code recogn obviou featur angl corridor rel robot denot li due symmetri corridor angl insuffici determin global head knowledg ff reduc space head direct leav open end corridor robot face track corridor angl fa float float struct float alpha alpha alpha alpha alpha alpha function type xxx part robot applic interfac discuss line number ad reader conveni import variabl probabilist variabl estim corridor angl line alpha initi indic initi robot unawar orient angl alpha modifi type sonar scan odometri queri sonar sensor robot function approxim convert sensor scan estim corridor call alpha local code function approxim neural network call net topolog line line local estim ff integr alpha oper robot odometri queri line rotat odometri data rotat corridor angl chang amount robot odometri erron accommod error perceiv line convert measur probabilist variabl add small gaussian term line add current alpha addit reflect programm knowledg measur robot shaft wall orient chang execut summat line alpha lie longer line normal alpha program train sequenc measur corridor angl label manual line retriev label train line target signal estim alpha cess credit assign mechan modifi paramet neural network sonar maxim accuraci variabl alpha notic train signal directli output constrain valu function network output successfulli train network sequenc robot corridor dataset measur label hand minut approxim half data train half figur show alpha local train set train vertic axi correspond valu alpha horizont axi depict visual probabl darker higher likelihood comput line shown figur solid white line figur correspond label initi local variabl alpha track angl figur show track perform illustr data suffici train program track ff interest notic sonar odometri data track ff sonar robot determin initi unabl track ff figur alpha local produc accur estim base robot track ff sourc inform geometr model relat odometri wall angl head direct extend program comput head direct call differ corridor angl defin ff exploit fact ff mod corridor angl head direct modulo inform end corridor robot face global local highli symmetr environ make assumpt initi robot face end corridor insert program alpha local comput theta turn comput estim theta head direct head direct train set head direct test set time figur plot head direct train test set robot accur track head direct coin theta theta theta theta theta theta li probabilist variabl map probabilist variabl alpha local copi probabl alpha local probabilist theta distribut theta local equal shape distribut alpha local global head direct obtain initi line confin actual head direct initi interv rule updat theta robot consid global head consid initi likelihood avoid problem robot slowli lose direct effect call variabl theta truncat regular interv train requir point figur show program action plot head direct dataset cross valid annot global head direct theta initi confin interv program quickli determin head direct track accur entir dataset trace figur collect minut suggest program capabl determin track head direct fact environ highli ambigu popul observ singl failur local approach notic line code minut data collect label minut function train set test set time figur estim data data partial mislabel program recov accur estim estim environ consid inform sonar read point west east figur sonar read hit wall angl maxim chanc measur correct hit wall steep angl reflect extract sensor translat coordin oper estim robot head compound int sonar read extract probabilist head direct notic loop filter sonar read meter corridor bound specular reflect sonar measur straightforward design ce code estim fa float code larg analog code extract corridor angl neural network extract local estim newli comput sonar train set local inform integr oper robot told initi call home home estim larg base odometri network net return estim close actual sensor read figur show estim illustr program accur track robot posit navig goal point probabilist estim robot point straightforward implement function make robot move arbitrari target locat corridor code insert make robot move arbitrari locat variabl goal float function set set robot constant max tran max rot maximum translat rotat veloc line code segment comput store theta differ robot head direct theta rel angl theta goal implement robot attempt rotat full speed line deviat theta diff larger magnitud robot move forward translat veloc set maximum code segment comput probabilist tran rot assign probabl respect motion command probabilist variabl convert convent float assign type line valu fed robot motor result control deliv smooth control magnitud depend condit assum hold true probabl rot suggest rotat veloc max rot suggest rot case robot head direct align averag robot rotat current code work empti avoid unexpect human reactiv avoid check frontal sonar sensor make robot stop easili design insert code final motion code make robot stop obstacl close forward motion robot stuck close wall gestur interfac gestur recogn robot camera applic gestur interfac robust light daylight variat postal carrier cloth carrier assum pose distanc hand roughli posit camera field view figur extrem piec ce code turn suffic recogn fa float code segment neural network map camera imag probabilist variabl likelihood gestur shown train label data train code train set train dataset collect approxim label approxim minut gestur recogn threshold hand hand interfac yield accuraci train accuraci set number grain portion dataset particip train actual gestur left hand hand hand recogn left hand hand hand tabl gestur recognit measur independ test set process valid recognit collect consist imag dataset collect postal carrier wear cloth result obtain independ evalu summar tabl confirm high reliabl gestur interfac accuraci rate rate case highli involv arm motion similar gestur schedul schedul requir coordin deliveri request final return home posit achiev wrap navig code int struct float left hand schedul hand schedul schedul return start reach stop robot mail blow horn wait restart approach figur plot robot trajectori consecut successfulli deliv piec mail shown raw sonar measur robot reach destin point meter error robot odometri schedul variabl stack memor list goal posit gestur statement line ensur gestur accept robot deliv mail line robot check gestur add destin home posit robot check goal locat reach line check robot cross goal destin counter activ goal increment locat final stop home horn activ robot wait person push button simpli empti stack point deliveri complet line activ condit case activ goal navig softwar determin motion command result tabl show complet ce program minor reorder variabl declar program line train suffic control mail deliveri raw sensor read motor control program prove extrem reliabl deliv mail popul corridor figur show raw data collect deliveri deliv piec mail figur raw odometri inaccur reliabl track robot posit declar fa coin compound float float float struct float struct float int initi alpha theta main loop local alpha alpha theta theta alpha alpha theta theta theta gestur schedul navig train alpha tabl complet ce implement mail deliveri program phase wait carrier move locat deliv mail return home posit wait corridor angl alpha orient theta coordin coordin left arm arm probabilist translat veloc tran max translat veloc max probabilist rotat veloc rot rotat veloc time figur plot kei variabl success mail deliveri text figur illustr sonar partial total partial peopl walk close robot test program track posit reliabl error successfulli deliv mail correct recipi figur show major variabl singl mail deliveri postal carrier lift left robot move locat deliv return horizont axi correspond time figur illustr phase wait move locat deliv move wait mail deliveri trigger left arm shown figur figur illustr posit accur track robot posit run veloc profil shown demonstr control smooth robot move approxim relat work field ai larg adopt problem solv perspect typic ai system program reli infer mechan comput desir quantiti typic prolog program languag program collect horn logic infer mechan theorem gener program output popular network programm probabl distribut graphic probabilist infer mechan appli margin exist varieti framework knowledg order influenc graphic wide varieti infer rang theorem prover planner probabilist infer algorithm ce differ work procedur program declar program code specifi directli comput involv arriv ce lack infer mechan type discuss field procedur languag popular program tool comparison declar procedur languag offer tighter control program enabl programm arriv effici facilit debug softwar develop issu integr learn infer system studi intens recent work learn theori refin induct logic program led varieti learn algorithm modifi program written order logic base exampl research team integr learn algorithm problem solv soar prodigi theo architectur requir declar theori theorem prover planner gener control learn appli modifi domain theori unexplain speed reason process human observ learn model problem solv order facilit subsequ problem solv attempt approach impact reason infer mechan slow characterist make inadequ control system note approach inappropri major issu robot system lack flexibl robustli deal noisi sensor data learn mechan domain data noisi costli obtain learn compil exist add knowledg approach limit includ induct compon robust induct logic program hypothesi space size amount background scale limit amount background knowledg provid learn algorithm brittl data environ data space result paper ce successfulli learn context sensor data retain full advantag procedur program languag common practic program system procedur program machin learn point program code ce analog domain theori ai architectur discuss cess procedur integr conveni convent program advantag adapt mechan mechan handl uncertain inform probabilist proven varieti applic domain recent work network markov chain theoret practic probabilist real world integr uncertain sensor inform time rule common practic approach grid approach learn model origin moravec elf appli numer success robot system emploi updat rule oper ce markov probabilist method mobil robot local recent enjoi enorm practic success rule integr sensor inform hidden markov model kalman filter dynam belief network success approach emploi rule tempor domain cess oper support approach algorithm implement effici ce convent program languag tradit work probabilist algorithm effici infer problem solv network commun conveni wai compactli structur probabl effici infer mechan margin learn typic appli construct probabilist exampl recogn research method bridg gap logic probabilist ce differ network differ prolog network joint distribut random variabl facilit effici margin infer mechan network track depend random variabl comput margin distribut challeng network undirect assign interpret constraint joint distribut random program cyclic similarli difficult comput program statement ce comput rule manipul mathemat constraint probabl distribut statement fundament effect cess independ assumpt ensur effici execut scalabl larg program statement network facilit integr probabilist reason mainstream smoothli blend probabilist convent advantag limit present output ce program distribut oper support network abil gener distribut procedur sequenc assign ce similar spirit recent koller languag defin complex probabl distribut tailor approxim probabilist suit program languag field research altern languag methodolog program robot approach integr learn architectur support comput uncertain inform popular subsumpt architectur modular program coupl finit state machin map sensor read directli motor command approach address uncertainti typic robot consequ fail provid adequ mechan deal sensor limit unobserv state robot program subsumpt architectur typic behavior function recent sensor read environ consid deal perceptu maintain intern state essenti subsumpt architectur support research successfulli implement adapt mechan top research flexibl program languag robot provid special mechan support except resourc synchron languag address aspect interact dynam unexpect condit forc robot deviat gener address uncertainti robot percept typic assum import event detect suffici certainti program languag includ learn phase argu vast major research field robot learn rasa learn method approach reinforc learn evolutionari program lack flexibl integr prior subject scale train data scarc reinforc common wai insert knowledg includ choic input type function approxim gener wai control hierarch genet program user choic data build block program genet oper search programm poss knowledg express easili knowledg perform gener knowledg law physic geometri inabl integr knowledg learn make difficult approach learn complex control limit amount data ce critic depart line adopt power commonli method program robot benefit learn cess learn mechan power reinforc learn genet ce program learn delai penalti requir target learn cess learn compon differ genet program manipul program code genet program easili appli ce program practic experi human find difficult understand program simpl problem discuss paper program languag design program robot system ce extens retain cs full function provid addit featur accommod exist difficulti develop robot ce offer programm option teach code ce programm function approxim teach provid exampl cess credit assign mechan programm provid train signal arbitrari variabl program ce mechan adequ deal natur system interact real world idea probabilist data type make program uncertain inform analog program convent data ad benefit robust perform demonstr concept paper program mobil mail deliveri robot short ce program hour demonstr control mobil robot highli reliabl deliv mail interact postal carrier popul corridor compar program convent program languag typic order magnitud requir higher develop cost extend version paper demonstr code probabilist local algorithm order magnitud compact ce current implement ce possess limit warrant futur ffl lack suitabl interpret compil ce experi carri function ce syntact limit pure limit current conceptu syntax languag ffl current implement constant function probabl distribut suffer limit size scale exponenti dimens compound make comput unabl repres finit distribut outcom toss coin suffer inflex assign resourc mechan place resourc region high advantag constant limit languag shortcom current implement option mixtur gaussian approxim method tree interest algorithm adapt resourc consumpt accord resourc probabilist facilit design mechan select comput case ffl notic cess learn mechan restrict case label data exampl label gener label gener automat learn predict upcom robot wander randomli tactil sensor label data address issu delai typic address reinforc learn literatur augment ce learn compon learn control delai reward subject futur work address learn unlabel data recent carri domain inform demonstr util unlabel data learn label data unlabel data collect everydai train cess function approxim extent approach improv perform ce program remain found opportun futur ce current form wide rang robot demonstr result paper true goal chang current practic comput system instruct comput narrowli convent keyboard instruct robot instruct richer involv answer learn method instruct possess uniqu strength gain comb reason teach program ce step provid mechan write adapt softwar improv base learn exampl hope paper stimul research space learn languag huge bare explor acknowledg paper benefit greatli continu discuss frank gratefulli acknowledg author tom dietterich tom mitchel insight detail comment earlier draft paper acknowledg stimul discuss craig tom tom andrew daphn rai nichola stuart member robot learn lab cmu research sponsor part darpa number number rome lab number view document author interpret necessarili repres offici polici express rome unit state govern refer hosoda acquisit real robot reinforc learn machin singh learn act dynam program artifici bennett dejong learn plan robust execut machin bergadano giordana guid induct domain theori machin learn vol page morgan san extens automat differenti tool technic report argonn nation borenstein vector field histogram fast obstacl avoid mobil robot ieee journal robot june boyan gener reinforc safe approxim function advanc neural inform process system mit press stone classif regress tree brook robot emerg behavior carefulli evolv network neural ra brook intellig reason page juli ab thrun mobil robot rhino ai thrun interact museum robot aaai fifteenth nation confer artifici schmidt estim absolut posit mobil robot posit probabl grid thirteenth nation confer artifici menlo august aaai press castelli cover exponenti label sampl pattern recognit januari castelli cover rel label unlabel sampl pattern recognit unknown mix paramet ieee transact inform novemb connel editor robot learn kluwer academ dayan hinton reinforc learn advanc neural inform process system san morgan kaufmann dean kanazawa model reason persist causat comput dean boddi analysi plan seventh nation confer artifici intellig page menlo aaai mit press dejong moonei altern view machin thrun mont carlo local mobil robot ap db rubin maximum likelihood incomplet data em algorithm journal royal statist seri ed passeng car intern symposium intellig dietterich maxq method hierarch reinforc learn intern confer machin dietterich learn knowledg level machin doorenbo match learn rule eleventh nation confer artifici intellig page menlo aaai mit press dorigo robot develop autonom agent learn artifici introduct fuzzi control springer rev elf map navig ieee journal robot june elf occup probabilist framework robot percept navig phd depart electr comput carnegi mellon rj firbi investig reactiv plan complex domain nation confer artifici page robot program demonstr support induct human interact machin gat languag support robust plan execut autonom agent work note aaai fall symposium plan aaai appli optim estim mit learn algorithm fulli recurr neural network intern joint confer neural san ieee tab neural network koller construct flexibl dynam belief network probabilist knowledg base ch european confer symbol quantit approach reason page springer verlag packag automat differenti algorithm written acm transact mathemat konolig robot make short work ai mm veloso plan complet robot agent lewi intern confer autonom page acm halpern analysi logic probabl artifici heckerman tutori learn bayesian network technic report technic report microsoft hirsh combin empir analyt learn version space sixth page san june sb kang assembl plan observ symbol visual page oxford isard blake condit densiti propag visual track intern journal comput press lp ar ja kurien act discret bayesian model navig intern confer intellig robot lp ml aw moor reinforc survei journal artifici intellig kalman approach linear filter predict problem tran journal basic kj ad learn concept sensor data mobil robot machin koenig simmon passiv distanc learn robot navig thirteenth intern confer machin koller learn approxim stochast process intern confer machin learn pfeffer effect bayesian infer stochast program nation confer artifici intellig rhode koller pfeffer bayesian network annual confer uncertainti ai rhode konolig languag reactiv control german confer artifici springer verlag ra kowalski logic problem solv north koza genet program comput mean natur select mit koza genet program automat discoveri reusabl program mit newel chunk anatomi gener learn mechan lin learn reinforc artifici neural network phd carnegi mellon school comput ml ar lp kaelbl learn polici partial observ scale twelfth intern confer machin mae brook learn coordin behavior eighth nation confer artifici page mit press mahadevan connel scale reinforc learn robot exploit subsumpt architectur eighth intern workshop machin page matar cliff challeng evolv control physic robot technic report brandei comput scienc matar distribut model mobil robot navig master januari mit ai lab tech report matar reinforc learn domain autonom januari stochast volum academ miller laird lexic acquisit model thirteenth annual meet cognit scienc page erlbaum gil problem solv perspect artifici mitchel increasingli reactiv aaai menlo august aaai press mit press unifi view machin tm jc schlimmer system architectur intellig lawrenc aw effici local weight polynomi regress predict intern confer machin learn morgan kaufmann moravec sensor fusion certainti grid mobil robot ai page summer induct logic program academ mitchel learn classifi text label unlabel document aaai fifteenth nation confer artifici robot ai summer jj oliv dl dow learn assist learn eighth australian joint confer omohundro effici algorithm neural network behaviour journal complex ourston moonei theori refin noisi data technic report ai artifici intellig texa march parr russel reinforc learn hierarchi machin advanc neural inform process system mit press silverstein approach learn relat concept eighth intern workshop machin page june pearl probabilist reason intellig network plausibl infer morgan kaufmann san pomerleau neural network percept mobil robot guidanc kluwer academ pomerleau rapidli adapt neural network autonom navig advanc neural inform page san morgan kaufmann pool probabilist horn abduct bayesian network artifici quinlan learn logic definit relat machin lr rabin bh juang introduct hidden markov model ieee assp lb automat techniqu applic springer rosenbloom knowledg level induct eighth nation confer artifici page mit press rosenbloom laird map gener soar technic report stanford dept comput william learn intern error propag rumelhart parallel distribut process vol ii mit russel norvig artifici modern approach prentic englewood schaal learn demonstr advanc neural inform process system mit press schultz grefenstett evolv robot behavior technic report navi center appli research artifici washington octob shavlik combin symbol neural learn machin simmon concurr plan execut autonom robot ieee control februari simmon koenig probabilist robot navig partial observ environ page august simmon thrun languag tool robot integr aaai spring sutton gener reinforc success exampl code advanc neural inform process system mit press rs sutton ag barto reinforc introduct mit teller evolv intellig recombin oper angelin advanc genet program mit press tesauro practic issu tempor differ learn machin thrun neural network learn approach kluwer academ thrun bayesian landmark learn mobil robot local machin thrun framework program initi design result technic report carnegi mellon comput scienc thrun learn map indoor mobil robot navig artifici schmidt map learn navig rhino rp mobil case studi success robot system mit burgard probabilist approach concurr map local mobil robot machin autonom robot towel shavlik artifici neural network artifici wang plan learn oper intern confer artifici intellig plan system watkin learn delai reward phd king welch bishop introduct kalman filter technic report tr north depart comput william learn algorithm continu run fulli recurr neural network neural technic report ic report institut cognit san langlei place recognit dynam environ journal robot special issu mobil locat
HCI/811 4 paper present iee colloquium interfac inform improv interact virtual environ alistair sutcliff neil centr hci citi london introduct virtual environ provid interfac abstract graphic interact techniqu ve repres interfac style offer possibl challeng interfac design studi design ve show design lack coher approach interact design design difficult technic issu support user interact major interact problem found current perceptu difficulti find understand interact common problem result user frustrat low usabl accept ve miller guidanc interact design ve avoid usabl problem usabl requir ve theoret research user interact behaviour control studi carri evalu usabl compar interact success implement improv interact found theoret research inform interact design understand user interact behaviour requir model interact convent exist ve model interact ve elabor norman gener cycl interact model consist stage describ exploratori reactiv event model evalu user compar observ physic mental behaviour verbal predict model major predict pattern activ support model refin light result breakdown interact provid design properti support user identifi stage interact properti cover aspect user spatial viewpoint user action action feedback properti total identifi properti identifi object state object easi identifi copi real world phenomena studi method control studi carri evalu impact design properti interact success eighteen subject part studi experi ve control group control group origin version virtual busi park applic group version miss design properti implement figur show made applic implement distinguish identifi clear navig pathwai declar action amend object wall share edg made distinguish textur object exit door made easier identifi label area user navig mark sign action provid inform basic facil cu inform sign design properti implement object commonli amend check independ judg ensur repres requir design properti question subject interact busi aim gather inform architectur basic servic specif task investig open load bai compar build subject provid verbal protocol interact interact session subject complet busi park retrospect questionnair view applic data usabl problem encount gather observ video subject verbal protocol common score scheme test result gener improv interact amend group encount significantli fewer usabl problem incid group successfulli complet significantli task group spent time differ avg group achiev higher total score test differ weakli avg group show posit view ve retrospect questionnair group perceiv ve significantli provid inform object action discuss result encourag show improv interact level fewer usabl lead success frustrat interact subject complet task gain inform interact favour opinion ve result design properti import requir success ve interfac significantli improv implement miss design properti refin set design properti light includ design properti cover unsolv problem area futur work involv translat properti concret design includ design benefit theoret research usabl import ensur accept system interfac inher difficult focu design interact ve made product pleasant user acknowledg vr solut rural wale develop board loan applic support epsrc refer usag evalu initi applic report virtual act project van dam gleicher challeng workshop sigchi bulletin sutcliff design practic usabl problem virtual environ virtual realiti world sutcliff interact virtual evalu model interact accept public interact vr special issu de experi result land vehicl pictori commun virtual real ed sr kaiser aj taylor miller ld usabl evalu virtual realiti engin mainten system master thesi colleg london norman da psycholog everydai thing basic book figur implement design distinguish object identifi object clear navig pathwai declar action
Agents/812 1 formal specif design mobil system christin huang depart comput scienc washington saint mo abstract termin classic problem distribut revisit set provid emerg mobil comput technolog simpl solut tailor ad hoc network emploi vehicl demonstr applic formal requir design strategi field mobil comput approach base understood techniqu specif methodolog tailor mobil applic design address concern mobil transient specif coordin construct proof logic program notat mobil uniti provid intellectu tool requir carri task introduct demand depend provid strong impetu softwar engin commun evalu adopt formal method formal notat led develop specif formal verif contribut applic mechan theorem prover program formal class techniqu ensur correct potenti softwar develop futur program deriv costli increment appli vari rigor conjunct complet program verif verif ti analysi support program deriv deal essenc design problem construct solut sequenti formal deriv enjoi long stand tradit deriv concern concurr program clean field difficult make scope gener direct emerg concurr area constructivist approach start simpl compon properti combin larger properti comput effort favor approach part due algebra work abstract csp specif refin advoc strongli work uniti initi specif gradual refin point detail write correct program trivial program refin correct program start point alter program satisfi addit desir properti produc work action system sequenti program transform concurr distribut mix specif program refin conjunct swarm model proof logic paper pose simpl question feasibl appli formal deriv techniqu develop mobil mobil consist compon move physic logic space compon move system exhibit physic mobil compon code system displai logic refer code mobil code remot mobil agent typic form code mobil system entail combin logic physic mobil lime provid logic mobil agent top fix ad hoc network potenti larg number independ comput decoupl comput frequent continu posit natur behavior commun pattern present design challeng formal method readi deliv complet practic complex undertak benefit enorm rigor design emploi design critic aspect system attempt answer question earlier consist formal specif deriv termin detect protocol ad hoc mobil carri emploi mobil uniti proof logic program notat mobil uniti notat mobil system coordin languag express interact proof logic highli modular extens uniti model extend notat logic accommod specif reason mobil program exhibit dynam reconfigur express mobil uniti system subject rigor formal verif set requir express tempor properti execut remaind paper organ section review briefli mobil uniti syntax proof logic section formal specif termin detect problem section seri refin specif section present mobil uniti program gener requir section summar lesson learn methodolog notat section gentl introduct mobil uniti bodi publish work reader interest detail understand model applic specif verif mobil ip model verif mobil code mobil uniti base uniti model extens notat logic uniti program assign section declar section set variabl program type section definit conveni remaind program proof initi section set state predic true program execut begin assign section set assign statement symbol separ individu element assign statement form list program list state predic call guard statement guard side express evalu current state result valu store variabl side standard uniti execut model involv execut statement assign section execut program start state satisfi constraint initi section assign statement select execut select statement arbitrari weakli statement select infinit infinit execut execut infinit mobil uniti execut model slightli due presenc kind reactiv statement inhibit statement toi mobil uniti program shown program declar token integ initi token assign count token token move end host program instanc index assign statement host token count statement model movement host locat mobil movement reduc assign special variabl denot locat host denot express captur motion pattern behavior toi host count token move program defin class program identifi creat complet creat instanc program shown compon section mobil uniti program accomplish creat host place initi locat system program end host compon interact inhibit end unlik mobil uniti variabl local compon separ section specifi coordin compon defin share data mobil coordin typic locat depend order defin coordin statement interact section refer variabl belong compon dot notat section view model physic realiti commun place host specif desir system servic interact section statement collect token statement inhibit execut statement host host ten token oper semant inhibit construct strengthen guard affect statement true statement interact section select execut compon program inhibit move token collect interact statement select execut addit inhibit host hold ten host prohibit fewer eleven token inhibit construct add flexibl control program execut addit program mobil uniti proof special tempor logic safeti properti state transit progress properti action eventu place safeti properti includ assert program reach state predic continu hold long forev stabl defin state continu hold forev inv mean init stabl hold initi execut program init program initi state basic progress properti includ ensur simpli state program reach state remain true long statement make predic true defin basic progress properti program state program reach state eventu reach state true notic requir hold establish defin describ progress condit requir hold point establish detect defin predic relat defin repres notat express involv hoar tripl quantifi set statement system mobil uniti uniti logic share predic relat differ appar examin definit ensur manner handl program construct mobil uniti properti total count number token eventu section emploi mobil uniti proof logic give formal requir definit termin detect problem problem specif illustr methodolog formal specif design mobil system examin case termin detect protocol set mobil host identifi move space initi host idl activ host commun rang host idl time reactiv encount activ host basic requir determin host idl store inform boolean flag locat specif host problem reduc notat assum free variabl quantifi stabl claim detect termin condit safeti properti state host host activ progress properti requir flag claim eventu record system express host defin negat import note problem definit case depend natur underli comput section demonstr refin specif step step formal deriv emploi specif refin techniqu goal gener program solut account architectur featur ad hoc network form opportunist host move rang refin process start captur high level behavior featur underli applic move introduc kei element termin detect protocol final refin step bring mobil transient commun surfac gener mobil uniti code adher specif remaind section proce refin time provid inform motiv step show result specif aid refin conclud list specif statement label captur current state refin refin refin activ principl host idl return activ statu presenc activ host notat hop quantifi variabl rang text defin variabl quantifi variabl valu permit rang rang colon omit domain variabl restrict context instanti variabl substitut express produc multiset valu op yield express instanti variabl satisfi express ident element true op op properti underli comput express safeti state host remain idl activ time activ host present system host establish retain forev add properti longer deriv refin refin token base account determin termin simpli count host idl frequent host movement make direct count accomplish thing associ token idl host independ idl host system hold token advantag approach token collect count collect point strategi work number token equal number idl host defin number token system number idl relationship establish inv ad constraint properti replac predic number host system properti replac claim detect collect mechan left undefin time refin refin token consumpt maintain invari number token system reflect number idl activ idl host requir number token activ host idl consum token express add histori token maintain held chang safeti token token captur requir host activ token destroi step properti strengthen properti account token consumpt refin refin token collect mention refin collect token count collect point collect introduc token pass mechan simplifi introduc concept rank host higher id rank higher host lower id host eventu collect token accomplish forc host pass token lower rank host introduc definit count number token idl agent hold host idl add ii track highest rank host hold token host forc reach collect token stage add progress begin shape progress token pass mention section properti combin safeti properti progress properti properti requir metric eventu note properti restrict behavior highest rank host hold token behavior host long highest rank token holder pass token lower rank show token reach restrict behavior host termin detect replac claim detect refin refin rank independ behavior determin ident requir stop comput host unifi behavior host rewrit properti term variabl underli program begin ad progress state host token collect point eventu token note replac prevent pass token higher rank host fix ad stabil properti stabl pass token higher rank host combin host token collect host pass token directli indirectli properti constrain variabl properti replac properti refin refin refin commun host host host pass token host host activ host pass token host parti commun previou refin embodi notion commun host requir activ place accomplish introduc hold host commun begin refin safeti token token requir host commun activ properti replac properti lose constraint add requir host pass token commun lower rank host add easili remov properti properti conjunct properti requir highest rank token pass token lower rank host behavior host leav separ properti progress safeti refin piec separ refin refin contact properti convei thing ensur host token meet lower rank exist requir token pass lower rank host requir place restrict movement mobil host make assumpt movement refin properti oblig host token meet lower rank host forc host met lower rank pass token point commun properti replac properti strengthen weaken refin refin decentr allud exist token collect complet decentr final elimin forc pass token lower rank exist add safeti token token requir host pass host lower id commun rang gain exact number token properti replac properti properti specif requir host token meet lower rank host pass token host commun time termin reduc detect token count reach replac claim detect refin mobil program final step design specif construct program text defin program deriv program statement directli final specif result program system mobil shown discuss text shift program notat mobil express local natur variabl ownership compon commun model system program declar integ claim boolean activ initi token idl activ claim assign idl token token activ detect claim move end compon interact inhibit end final specif shape result program manner reflect code host coordin polici govern interact host repres contribut program deriv literatur kei ty deriv techniqu mobil local action individu host relat behavior underli comput implement detect statement captur transit activ order preserv invari gener token process statement reduc skip host token check number host order record termin local model mobil assign valu locat action involv multipl compon captur interact section view model physic realiti specif servic provid oper system middlewar design support mobil interact captur requir token consum activ host wake idl fact remain token distribut host arbitrari implement detail statement host activ nondeterminist obligatori time statement select execut manner statement system interact mechan similar captur transfer token idl host higher lower rank host specif demand transfer accomplish host move accomplish emploi interact inhibit explicitli preclud movement long transfer token complet point correct attempt verifi correct reveal overlook properti demand host host carri token meet lower rank host ad hoc construct program satisfi requir gener imposs mobil uniti includ notion condit defin correct condit desir behavior achiev met advantag properti motion structur space host move back long meet realiti paper present formal deriv termin detect protocol mobil comput discuss physic ad hoc solut work equal wire network support commun mobil agent simplic actual demonstr versatil mobil reveal number subtl methodolog interest question problem definit gener independ mobil desir address mobil definit space requir suffici model idea host rang part ad hoc rout advantag structur space order refin import late introduct commun constraint made deriv simpler long time underli architectur affect greatli deriv interest coordin construct mobil shape manner refin place advantag simplifi deriv process tailor abstract coordin construct built mobil uniti tradit commun primit consid literatur distribut condit properti reason open host system withstand paper strong evid formal treatment mobil feasibl complex mobil desir research support part nation scienc foundat grant recommend express paper author necessarili reflect view nation scienc foundat refer back refin parallel algorithm sci comput misra parallel program foundat cunningham roman program logic share dataspac languag ieee tran paral dist dijkstra disciplin program englewood dijkstra method program deriv multipli sci comput scienc program prim notion encapsul acm sigplan calcul deriv algorithm inf process formal deriv parallel maximum flow graph acm tran prog lang methodolog program formal sci comput roman composit program abstract mobil comput ieee tran soft roman model mobil ip mobil uniti acm tran softwar engin morgan specif statement acm tran prog lang morri law data refin acta roman linda meet mobil proc st int conf softwar page reason code mobil mobil uniti washington st depart comput extend version acm roman cunningham mix program metaphor share dataspac model concurr ieee tran soft roman cunningham reason synchron group research direct parallel program page ball formal deriv program ieee tran soft murphi softwar engin roadmap futur softwar page intl conf soft acm roman wilcox refin ieee tran soft formal specif design distribut electron network ieee tran
Agents/813 1 reinforc weight partit ron sun todd peterson alabama depart comput scienc al april contact ron depart comput al run reinforc learn work conduct author fund offic naval research grant supplement research grant alabama includ research anonym review comment reinforc weight partit abstract paper address weight partit complex reinforc learn aim facilit learn paper present idea weight multipl agent extend partit space multipl region differenti weight exploit differenti characterist region differenti characterist agent reduc learn complex agent function facilit learn reinforc learn wai partit task agent select base partit base heurist method test find heurist method perform significantli model neural reinforc introduct multipl agent problem lieu singl agent goal make complex learn task easier achiev perform combin outcom multipl agent breiman schapir al wolpert jacob al jordan jacob exist combin wai accord problem classif vote numer predict averag combin weight adopt agent carri weight tresp breiman goal make combin optim weight uniformli problem space uniform weight disadvantag differ characterist region problem space case agent perform region space ideal weight adopt partit problem space addit weight agent special local region overlap jacob al jordan jacob jacob tresp ad advantag partit simpler local agent turn lot simpler global simpler function form approxim polynomi function multipl agent atkeson fewer number hidden unit backpropag network multipl network partit potenti improv learn method appli extens task simpl classif problem exist relat involv task reinforc learn learn autonom agent basi simpl feedback limit singh dayan hinton dorigo gambardella dietterich discuss explor approach task reinforc learn main aim present uniform perspect approach weight mention reinforc present method motiv develop light perspect remaind analyz weight show optim weight scheme gate al boost schapir tree address issu optim light proce wai achiev optim partit optim weight experi method present discuss advantag method li fact make learn task easier manag achiev perform requir priori knowledg begin unlik exist approach requir detail domain knowledg initi partit case rbf tresp kubat priori partit problem space singh priori subsequ case gate reinforc priori determin structur hierarch rl approach dayan hinton dietterich method suitabl increment reinforc learn domain structur characterist involv priori structur make easi similar idea jacob al jordan jacob tresp detail discuss method deal rl directli method search optim partit state separ learn individu manag complex learn individu agent combin agent method learn partit separ learn individu agent tend reduc complex isol extent aspect learn weight analyz optim issu simpl averag weight averag simpl denot agent output agent averag output weight denot agent output agent weight agent combin output note context regress classif correct output agent agent averag error train cross avg avg avg avg avg sum data avg avg issu optim averag discuss extens line extend breiman analysi analysi simpl averag agent train address optim weight averag analysi limit show averag weight averag singl agent equal singl agent suggest breiman note avg output averag mean averag error individu agent greater equal error combin outcom averag scheme weight agent ident vari weight hope result weight averag suggest wolpert breiman make differenti weight scheme show avg weight scheme reduc subject constraint direct minim gradient error weight subject constraint inequ hold total error deriv avg altern minim error error weight subject constraint shown krogh minim criterion adjust combin weight minim sum squar error combin outcom earlier minim weight averag varianc agent term contribut reduct error individu addit reduct error combin outcom dealt refer approach approach approach approach discuss context reinforc wai constitut algorithm obtain weight weight perform gradient descent perform gradient descent hope estim error individu averag agent indic true error ensur combin outcom individu agent wai ensur combin weight optim minim weight error express form issu close relat weight set agent uncorrel set ident highli similar agent averag weight averag scheme justifi theoret basi decomposit breiman ueda heurist creat independ agent number achiev repeat random train data set agent achiev repeat resampl chang sampl probabl favor data point misclassifi schapir drucker combin function linear combin equal applic averag weight averag idea wolpert breiman weight averag outcom arbitrarili complex combin function adopt flexibl combin backpropag network combin outcom train gradient descent usual backpropag base error due complex combin harder ensur accuraci converg optima simpl averag weight averag analysi limit learn combin weight weight involv learn agent train combin weight agent time analysi limit input part input combin weight remain constant multipl region input dynam form acquir dynam set combin weight combin agent situat due fact partit space region addit optim weight agent region weight input space partit analyz wai partit number recent involv multipl learn agent concern partit input space multipl region word gener refer gener subset input gate model produc partit space expert weight overlap variat weight scheme interpret combin weight combin outcom individu agent select probabilist outcom individu rel weight agent probabl select domain al jordan jacob xu al gate approach predict task attempt find optim agent optim weight minim weight averag error al error error target output input input space output agent input weight agent input weight vari input model make simplifi assumpt divid element remain approxim kj denot error kj kj error error kj assum kj encourag kj steep sigmoid function repres weight competit learn scheme encourag agent featur base logic formula region discuss formul section wind kj ks kj kk kj kj error kj kk clear gate model minim local error region optim partit region handl agent neural optim chosen region regard sum squar simplifi partit mutual exhaust gate carri result grade boundari overlap region optim object essenti interpret combin weight weight agent differ point input space boundari region note necessarili hard partit region multipl agent activ section note type partit singh al partit hard boundari input assign region probabilist error function discuss section error encourag kg error result optim problem basic optim partit optim agent simultan error variat al error deriv lead case appli method boost freund schapir view partit input space agent input due fact iter input weight differ creat focu input space unlik gate combin weight fix respect function input instanc sampl sampl weight distribut train agent freund schapir start uniform distribut sampl weight train instanc instanc weight iter modifi base perform current agent current ffl instanc correctli classifi iter number ffl total error rate current agent ffl algorithm weight reduc instanc handl correctli train sampl iter probabl iter calcul breiman similar boost algorithm term proce origin boost probabl calcul misclassif rate ith instanc previou combin output freund schapir weight vote agent weight log ffl ffl error rate agent breiman show equal vote equal effect perform variat compar origin boost algorithm drawn specif scheme boost grade focu instanc creat form input instanc highest weight center region agent assign region handl instanc accord instanc lower weight constitut boundari region wai radial basi function girosi agent train final point input space vote agent cover point question order strengthen argument role partit boost chang weight perform radic adjust instanc correctli classifi instanc correctli handl previou agent previou current iter amount hard partit input region handl individu logic extrem origin boost method analysi breiman show variat origin boost algorithm impact conjectur variat perform approxim origin method freund schapir natur method partit input appar radial basi function network constitut soft partit input space girosi function highest activ center gradual taper activ distanc respect center region handl individu agent classif predict calcul weight individu agent accord distanc center agent point question local weight regress al view soft partit input space tree view partit input space multipl homogen region region ideal lead uniqu classif weight involv start node increment creat node split current node basic idea node split maxim gain inform reduc input featur maximum inform gain split success split lead tree structur cart al similar tree regard view form base minim total varianc start node increment split node determin vector weight specifi grade region shape fulli determin weight wn obtain max max specifi instanc center boundari case multipl agent assign ident region overlap region weight instanc oscil back gener ident overlap region compat mechan boundari soft overlap grade boundari function hard boundari function relat overlap hard overlap partit function hard partit function outcom combin overlap averag weight averag determinist determinist assign function probabilist overlap stochast assign function figur type partit dimens split point error avg xs avg xs dimens split point avg varianc predict valu side split point avg xs varianc side dimens minim measur increment split node lead tree structur method lead method rl discuss method exist partit input space feedback inform task reinforc learn discuss predict feedback classif feedback correct class reinforc learn feedback indic sequenc action achiev object type object partit divid world wai facilit perform task advantag group similar input region separ dissimilar input region world partit grade grade boundari delin sampl weight updat weight region overlap soft mutual case type hard output gener fashion case region handl sole region handl set agent weight differ accord perform characterist order enhanc perform section optim weight breiman map input region partit probabilist determinist figur tabl catalog differ partit reinforc learn review reinforc learn review reinforc learn bellman bertseka tsitsikli kaelbl al order assum system state transit depend control perform agent set set control state transit function map current state current control state time polici determin control current time step current markovian process determin state state perform state jx jx cost occur state lim fl estim start state select fix polici denot denot fl discount factor idea discount incur futur matter incur import fl effect discount find estim result polici control number iter updat estim max fl state state result action polici updat state asynchron state updat long state updat infinit tsitsikli variat track compon insid side notat fl fl max rang state reinforc learn updat complet explicitli probabl estim base actual state perform updat necessit fact inform current state transit fl max fl max fl max ff learn rate determin action argmax boltzmann distribut transit frequenc approach estim result valu earlier specif updat formula commonli refer function approxim state space larg assum neural backpropag lin sutton awar potenti unpredict type function approxim boyan moor sutton hope partit remedi lieu local approxim rbf network comparison relat frequent studi type learn note output reinforc learn interpret ffl predict output current state chosen action view predict discount cumul fl term predict lookahead fl max reinforc receiv action state result action note target predict move max chang time chang ffl classif state action desir action close action close assum stochast make base action perform final outcom interpret stochast classif interpret ignor point estim discount cumul lead work circumst simplifi learn interpret serv foundat present work address partit weight reinforc learn partit reinforc learn task overview reinforc readi extend multiag learn set reinforc learn due complex function larg state space result complex scenario function approxim accuraci approxim complex learn affect complex lack smooth function discuss boyan moor find wai reduc complex function partit reinforc learn task reduc complex improv learn term speed discuss possibl partit reinforc learn exist wolpert jacob al singh ffl partit input space state input locat region space handl agent gate jacob al jordan jacob ffl partit subsequ handl agent singh thrun schwartz partit subsequ predetermin singh automat determin part reinforc learn ffl partit action action deal agent limit type action dayan hinton limit agent action level abstract sun al sun peterson divid action speed type handl separ agent ffl partit goal multipl explicit goal achiev reinforc learn dayan hinton goal agent determin action agent reddi tadep partit goal learn extern provid exampl search static partit goal sun al sun peterson ffl partit reinforc reinforc reinforc associ achiev aspect goal sun al matar view form partit goal ffl partit output divid output multipl set overlap probabilist partit varieti base set equal agent entir input space simplest discuss section breiman base input input space partit partit output result partit jacob al discuss base output subset agent erickson combin output agent erickson involv combin gate determin base independ involv partit averag weight averag complex method discuss previou concern partit output averag weight averag top partit input space sake weight averag singl extrem region basic motiv partit rl make learn neural network agent gener good idea lead improv perform whitehead show learn time rl depend size state space minimum distanc start state goal state divid space multipl separ learn subspac facilit smaller size potenti learn facilit neural network converg bp network depend number pattern learn complex set pattern complex underli hertz al divid set train pattern multipl set separ network learn pattern network improv converg network due tendenc bp network smooth output homogen pattern assign network lead accur output partit lead assign similar pattern homogen map learn network improv partit reinforc learn perspect previou possibl achiev ffl soft partit carri base chosen optim squar maximum likelihood jacob jacob partit time individu agent learn part optim criterion train individu agent gradient criterion ffl partit obtain separ train individu base perform agent train separ explor possibl optim reinforc inspir idea discuss section case reinforc learn partit output combin gener valu proper optim term predict classif detail discuss section type partit dealt sun al sun sun peterson gate input output agent agent agent weight figur partit optim discuss optim gener structur system partit multipl agent shown figur assum output multipl agent combin weight boltzmann distribut select action base combin output learn rule partit deriv learn criterion learn rule individu agent possibl learn criterion target valu desir hing view reinforc learn predict task classif section error function differ target valu actual section optim method base gradient deriv learn rule target valu state reinforc case task view predict step task earlier discuss view depend measur determin desir case task view classif task step separ desir action target close undesir action target close denot bellman residu updat agent predict task defin fl max state result action state classif task defin criterion success met criterion fl sun peterson discuss justif predict differ quantiti local error measur agent global error measur deriv combin local error measur term deriv global error measur deriv learn number possibl section justif combin separ error measur individu agent combin local error base weight averag exponenti weight averag al treat agent separ entiti minim error separ proport contribut error justif term reduc error weight averag output reduc varianc agent discuss section krogh analysi section normal easier total weight assum previou analysi creat form competit agent combin error defin measur directli section sum individu error measur wai lead minim individu measur squar bellman fl max predict task interpret gener predict weight averag agent weight averag individu agent predict justif term reduc averag error weight averag output discuss section breiman classif task bellman state result action state determin wai earlier measur characterist encourag note weight depend fl agent cooper make predict compet case measur al term optim squar maximum likelihood limit ml em requir assumpt underli probabl distribut lead parametr statist model jacob deriv learn rule base steepest newton numer method tsitsikli focu increment steepest descent approach updat base gradient form soft partit grade boundari determin sake calcul gradient partit deriv learn rule type combin weight individu agent network weight net agent measur increment steepest experienc perform action state updat type weight ff net net fi net ff fi learn rate gate weight gener lookup view amount updat appli entri tabl gate weight gener gate network input view error minim gate network learn rule intern weight gate network easili deriv learn rule net depend neural network implement deriv net depend structur neural network chosen agent exponenti similarli deriv increment steepest descent ff net net fi net em ml learn indic eventu perform compar ls jacob deriv learn accord predict classif treat target valu strictli speak appli deriv learn ff net net fi net combin weight tend fall rise simultan competit weight order total weight constant avoid satur deriv heurist weight updat amount updat weight current step adjust weight updat amount total principl comput implement care set learn rate gate network agent network set respect schedul initi learn rate gate network higher compar agent quickli reduc low gate learn stabil faster agent provid stabl structur stabl agent learn stabl current action perform step made agent receiv input comput output weight averag combin wk action select base maximum argmax boltzmann distribut complet gener specif algorithm figur detail learn rule error measur interpret discuss text omit specif figur optim method term minim total error extent increment steepest descent method optim respect find local note input gate network compar individu agent potenti improv potenti inform individu agent perform task gate mechan assign subtask agent input partit reflect structur space enabl space region local view agent coordin partit input full partial descript current full partial rl essenti discuss agent receiv input comput output combin agent weight qk action select base maximum boltzmann distribut perform select action agent receiv input comput gener global error gener local error measur agent base fl qk qk abstract qk combin local error base weight averag exponenti weight averag gener global error measur directli base weight combin fl qk qk appli updat rule deriv adopt global error measur gate adjust weight appli updat rule deriv adopt global error measur individu adjust intern weight step figur gradient descent algorithm optim optim altern partit space sake produc method enabl learn decomposit separ issu optim facilit task wai optim partit import fact hard partit calcul gradient partit free hard soft hard partit easi analysi hard partit region superior overlap partit krogh show advantag base analysi ensembl gener decomposit gener error weight averag individu gener error ensembl ambigu section ad advantag partit base learn agent specif input learn sum main process method partit unifi algorithm gener term figur algorithm basic gener plausibl partit test agent measur base select partit pursu gener variat select partit loop learn refer learn individu agent unlik case gradient descent basic dictat soft partit calcul input output agent agent agent region spec figur partit termin condit satisfi algorithm variat gate model jacob al term partit space gate method gener structur system partit shown figur assum input system check region specif direct agent handl region input belong output select agent final outcom system boltzmann distribut select action base predict task interpret agent learn term mean gener partit select ffl appli gradient em batch mode larg assum gate network train individu agent complet train gate network long period train individu agent collect updat adjust gate network ffl space partit perform explicit search ffl search techniqu genet algorithm appli gate network weight gate network mutat cross appli directli partit region partit mutat cross ffl possibl tree progress split appli lead optim partit space criterion split base error function mention earlier discuss possibl tree algorithm figur region partit hard handl singl agent neural figur algorithm partit time attempt find partit split region increment criterion satisfi quinlan breiman al split criterion base total magnitud error incur region train base consist error concern distribut direct posit combin context error defin updat amount bellman select region split high sum absolut error sum squar indic high magnitud error bellman low sum high sum absolut error indic low error consist residu distribut combin criterion threshold refer data point encount previou train region split defin max state action state result action state agent agent select dimens region split heurist high sum absolut error low error consist sum absolut error remain split dimens error sum error analog breiman al compar dimens region consist dimens optim max split point dimens refer point region side split project dimens measur error consist split dimens optim select dimens threshold dimens satisfi threshold highest select dimens optim select split point base maxim sum absolut valu total error side split argmax split point dimens point optim exact error consist maxim al split region boundari creat split creat split hyperplan select point spec initi set region cover entir space train set agent record perform partit modifi oper base perform partit train set agent record perform partit termin condit figur optim algorithm gener descript optim specif instanc split region region region spec region region region specif origin region replic exist agent handl agent creat handl region split number region exce combin exist region number adjac region combin agent involv delet algorithm relat number partit algorithm examin section tree cart al addit inspir gate model al note stochast hard partit singh al assign input region probabilist suit partit gradient algorithm domain independ domain knowledg dimens split domain navig input dimens instrument dimens find good save comput turn algorithm complex algorithm direct manipul figur consid simultan set partit select subset modifi test involv larger search space type oper inspir mutat crossov mutat select region dimens split split point select region combin guid criteria prescrib previou algorithm figur usual mutat random consist mutat strong likelihood improv partit mutat safe appli partit popul crossov perform partit success select partit cross select split hyperplan crossov figur random duplic oper usual ga explicitli impli crossov oper detail figur success partit copi gener figur full detail initi partit region cover space repeat time time randomli gener initi train agent partit trial split partit repeat time time randomli gener initi condit train set region assign trial split split region satisfi select dimens space maxim provid select dimens select point ly region maxim select point select creat split spec split region newli creat region spec region region specif origin creat agent handl region replic agent origin region number region exce combin region number randomli select region adjac merg agent region delet figur algorithm instanc optim text detail randomli gener popul number region determin upper limit repeat time time randomli gener initi condit train set agent partit partit popul region partit assign partit record averag perform partit perform crossov entir popul perform mutat partit result popul number iter preset goto stop figur detail figur algorithm instanc optim simplifi version ga region made logic conjunct simpl inequ input dimens simpl type altern type radial basi function linear map linear perceptron network extend arbitrarili shape region backpropag network serv gate extens analog extend weight averag gener input stack output side measur optim partit algorithm result perform base success rate number step trial reach success rate transfer perform test gener optim qualiti result algorithm depend qualiti heurist qualiti result ga base algorithm reli optim ga se empir evid literatur numer domain ga good weak algorithm formal optim measur optim maxim result maxim local minima algorithm optim descript specif algorithm hard soft partit case algorithm gener bag boost gener gate due overlap region justif partit requir soft partit altern hard partit multipl agent region maintain simplic partit time improv note sake assum error fix valu distribut region agent order reduc realiti valu chang function partit complic analysi time randomli select entir select probabl select partit determin boltzmann distribut success rate partit divid input space half space randomli select dimens split point dimens split belong belong crossov combin region region region result region region region region region cross border region half space region agent number region exce number region select region adjac combin agent origin region delet put result partit popul remov exist partit lowest perform popul move remain partit popul popul repeat time randomli select split select select dimens select point prescrib figur creat agent handl region replic agent origin region split lead limit number region partit combin randomli select region partit adjac figur agent combin region random gener partit initi partit region cover entir space randomli select region randomli select dimens space split region randomli select point dimens split region creat region origin region select spec region replac origin region region set region creat region figur detail algorithm initi partit region cover input space train set agent region split partit repeat time time randomli gener initi condit train agent learn set combin weight region split stop split partit total figur figur algorithm weight averag special case optim perform region combin outcom multipl agent section breiman extens algorithm weight averag ad algorithm figur shown figur straightforward repeat detail region split algorithm learn rule combin weight increment steepest descent obtain ff gate algorithm section figur fact combin weight complet uniform region partit learn combin weight partit hard boundari intern weight agent net fi net deriv net depend network type structur chosen agent error measur discuss section detail perform combin agent benefit agent case weight averag experi task maze difficulti level easi hard vari size layout maze small size shown figur maze small size shown figur median size doubl origin larg size time origin size perform experi combin task difficulti level maze layout size figur easi maze figur hard maze maze layout task set agent view soft soft direct obstacl distanc cell input inform distanc bear goal total binari input separ input gate region specif consist coordin agent move select output turn speed step episod agent fail reach goal failur declar reinforc provid target time run move determin agent reinforc gr distanc travel target direct set agent reinforc gr algorithm paramet test rl test partit predict classif exponenti total denot respect error combin test batch version gate predict interpret measur resembl section test includ ga test variat multipl agent region combin weight train measur comparison test simpl averag weight averag multipl agent sa wa base predict interpret measur construct agent type random variat initi intern structur individu agent initi number hidden learn gener uncorrel agent test paramet algorithm set learn rate individu agent set ff initi gradual lower ff ff ffl ffl denot episod number hidden unit backpropag network agent discount factor fl set initi temperatur boltzmann distribut action select set temperatur chang ffl ffl gate algorithm includ linear network gate jordan jacob coordin input gate network local orient depend view agent error criterion set number agent set set learn rate gate network higher individu agent network initi reduc ff ff ff ffl ffl updat gate weight episod updat agent section rs threshold set threshold maximum number region set number repetit set train agent partit episod partit chang set number agent region paramet rs popul size partit set train agent partit gener episod maximum number region partit set number repetit set threshold mutat oper set rs sa agent result compar algorithm discuss earlier test perform maze test perform measur averag success rate conduct suffici train algorithm averag learn curv level paramet set rang paramet set test partit algorithm total train algorithm algorithm partit algorithm rs episod region addit train ga episod partit partit train train note algorithm algorithm requir updat overlap ident region simultan updat multipl agent step figur show perform algorithm train maze combin difficulti level partit method improv perform compar singl agent system compar rs fare compar difficult set hard maze larg demonstr merit algorithm compar partit shown figur algorithm perform rs ga perform differ statist algorithm perform agent learn partit time gradient complic process algorithm separ aspect learn facilit learn process discuss earlier compar rs ga ga gener conduct search incur higher expect achiev perform judg differ random introduc crossov oper setup advantag introduc random compar rs mr algorithm perform compar mr slightli differ statist wa sa outperform compar gate algorithm mention classif interpret lead inaccur expect perform compar predict interpret conjectur born perform perform po perform differ statist exponenti version perform equal level compar version compar compar cwa batch version perform version ba perform compar gate algorithm singl agent simpl weight averag note coordin provid algorithm partit provid part avoid put algorithm disadvantag compar perform algorithm found perform differ examin rs rs specif figur show learn curv term success rate block figur show consist curv term consist measur demonstr gradual improv system rs learn figur show partit region algorithm task rs mr ga po cwa ba sa wa figur comparison algorithm term averag test perform number success episod test standard deviat text explan result trajectori region maze reach goal end conjectur multipl agent reduc requir complex individu agent multipl agent learn task equal effect simpler individu agent backpropag complex agent determin number hidden unit network data figur show gradual reduc number hidden unit rs perform perform rs affect recal point agent region special agent order exploit differenti characterist region develop differenti characterist agent reduc complex individu figur show averag agent typic set compar agent found averag agent impli action polici form figur agent special region specif concern action specif region discuss retrac develop idea paper discuss gate led adopt partit rl variat term error figur algorithm rl figur formul altern algorithm enabl decomposit learn analysi bag led analysi weight averag extens simpl turn led partit gener gate episod hard hard hard figur learn curv rs term success hard maze episod hard hard hard figur consist measur learn hard maze figur partit region rs ten sampl success trajectori region test turn left straight turn action turn left straight turn action turn left straight turn action turn left straight turn action figur averag agent major categori wall wall wall wall left compar input state fit categori averag agent turn left straight turn action turn left straight turn action turn left straight turn action turn left straight turn action figur averag agent major categori wall wall wall wall left compar input state fit categori averag agent turn left straight turn action turn left straight turn action turn left straight turn action turn left straight turn action figur averag agent major categori wall wall wall wall left compar input state fit categori averag agent turn left straight turn action turn left straight turn action turn left straight turn action turn left straight turn action figur averag agent major categori wall wall wall wall left compar input state fit categori averag agent unit rs rs rs rs figur effect number hidden unit backpropag network algorithm success rate shown standard deviat draw inspir method discuss discuss tree cart similar idea led formul algorithm algorithm weight averag extens algorithm extens straight applic sum optim issu set ffl optim soft partit gate discuss section optim set combin weight intern agent weight net partit direct result algorithm gradient reach local optima net reach global optima proper intern structur learn learn gradient reach global optima linear combin agent section problem local optima regard ffl optim soft optim set paramet net learn net reach global learn reach global optima linear combin gradient local optima reach compar previou cost higher due fact adjust train net converg interleav combin weight learn agent train amount agent train necessarili train agent converg combin weight chang method essenti batch version method discuss ffl optim hard partit ga discuss section optim paramet net partit adjust net multipl agent region basi current optim ensur case limit case respect discuss section avoid high cost incur order train system converg partit interleav partit train agent train ffl optim hard optim set paramet net gradient descent local optima reach order perform optim select type partit learn method appli gradient descent creat differenti partit soft partit discuss probabilist function al resembl soft partit weight interpret probabl soft due optim hard partit adopt work comparison regard averag weight addit theoret mention earlier breiman demonstr perform advantag result combin set perron munro doyl rosen tumer ghosh tresp empir demonstr bag boost ting witten quinlan drucker dietterich work deal reinforc learn regard variat discuss weight set gate weight input point varianc agent weight set gate weight residu error agent input weight condit probabl estim gate weight agent input point combin thereof discuss tresp partit work mccallum criteria split base differ distribut regard action base varianc error base amount error base error consist ratio differ sum absolut error sum van der form structur hierarchi split error exce preset train algorithm evolutionari method independ develop similar method compar weight partit work rare dealt breiman wolpert van der jacob al jordan jacob work extend reinforc learn complex lack clear learn target move target chang constantli learn mccallum specif design reinforc compar exist work involv approach differ rel advantag approach requir priori partit space singh approach requir priori task subtask dietterich dietterich simplifi requir priori determin preset subgoal predetermin subsequ approach learn partit method reli complex fit cluster group agent costli produc irregular region disjoint part differenti input featur reward function agent singh separ train subtask agent space approach requir knowledg initi case rbf network tresp kubat approach limit select agent entir dayan hinton agent altern deal sequenc term assign agent approach justifi algorithm ad hoc method dorigo gambardella involv pure heurist method competit determin winner agent region approach differ featur select approach mccallum tree select input featur order creat state reinforc learn work divid space region agent learn make learn task easier divid space tree approach differ function schaal atkeson peterson sun van der hypercub region form spheric form rbf gaussian function rbf power approxim capabl arbitrari function map elimin highli overlap region hard partit approach differ cmac lane al sutton power approxim avoid highli overlap placement region point appli fuzzi logic base method takagi sugeno approach suitabl increment learn involv unlik exist work predetermin partit make hard imposs undergo suitabl learn situat world minor learn quickli accommod due local region make individu map part learn approxim neural simpler make learn easier local region tend group similar distribut regard easier adjust major chang occur approach accommod creat drastic alloc local agent costli conclud remark work concern weight partit reinforc learn task develop approach facilit reinforc learn partit space region weight multipl agent differ learn approach view agent assign region weight weight learn respect point input increment creat agent split region note individu radial basi function capabl arbitrari overlap placement function space order approxim arbitrari function optim partit space achiev learn perform optim partit hard soft boundari goal exploit differenti characterist region differenti characterist agent reduc learn complex agent function facilit learn test approach discuss paper reinforc learn task differ state space size difficulti level summar find perform algorithm vari good method facilit learn reduc requisit complex individu agent weight set agent uncorrel set ident highli similar agent averag weight averag scheme justifi basi decomposit breiman ueda avg avg avg avg avg avg avg avg avg total error determin bia avg avg avg varianc avg avg avg averag outcom agent averag reduc bia individu reduc varianc individu agent improv perform aggreg system varianc avg avg avg avg avg avg avg number agent independ ident avg avg avg varianc reduc factor avg avg avg reduct averag method fall heurist creat independ agent number achiev repeat random train data set achiev repeat chang sampl probabl favor data point misclassifi drucker idea relev gate al jacob aim achiev uncorrel agent neg agent refer approach manipul model articul control journal dynam system measur local weight regress artifici intellig review dynam program princeton nj bertseka program athena ma learn radial basi function network proc intern confer machin learn morgan san ca boyan gener reinforc safe approxim function neural inform process system mit ma classif regress ca bag predictor machin stack regress machin varianc arc classifi technic report berkelei reinforc learn perceptu perceptu distinct approach proc aaai morgan san ca dayan reinforc learn neural inform process mit ma hierarch reinforc learn maxq function decomposit dorigo reinforc learn approach combinatori optim technic report universit de belgium improv boost techniqu proc morgan san ca erickson rule categori learn manuscript freund experi boost algorithm proc morgan san ca optim linear combin neural network phd purdu indiana simpl societi mind technic report comput laboratori uk introduct theori neural comput ma analysi architectur neural comput adapt mixtur local expert neural comput jordan hierarch mixtur expert em algorithm neural comput reinforc survei journal artifici intellig krogh neural network cross activ learn neural inform process mit ma tree initi network manuscript theori develop cmac neural network ieee control reactiv agent base reinforc teach machin learn prune adapt boost proc morgan san ca reward function learn proc confer simul adapt behavior mit ma learn select attent memori task proc confer simul adapt behavior mit ma varianc combin estim neural inform process mit ma munro reduc varianc predict resampl techniqu connect improv regress averag method varianc reduct extens gener convex measur optim phd brown ri peterson rbf network altern hybrid architectur ieee intern confer neural ieee nj poggio network approxim learn induct learn tree machin learn boost proc morgan san ca bootstrap effect regular techniqu connect reddi learn rule proc morgan san ca hierarch learn procedur abstract mechan phd depart comput ny ensembl learn decorrel neural network connect adapt network function approxim space ieee transact neural schaal isol altern view system expert advanc neural inform process system mit press ma boost explan effect vote method intern confer machin learn morgan san francisco learn solv markovian process phd ma reinforc learn soft state aggreg sj hanson cowan ed advanc neural inform process system morgan san ca plan reinforc learn technic report al sun comput architectur integr neural symbol process kluwer academ publish ma sun hybrid agent architectur reactiv sequenti make sun integr lawrenc erlbaum associ nj sun hybrid model learn sequenti navig proc ieee intern symposium comput intellig robot autom ca ieee press nj sun experi hybrid model learn sequenti make inform scienc skill learn reactiv sequenti task cognit scienc societi lawrenc erlbaum nj learn predict method tempor differ machin learn integr architectur react base approxim dynam program seventh intern confer machin learn morgan san ca gener reinforc success exampl code neural inform process system mit ma tadep hierarch reinforc learn proc intern confer machin learn morgan san francisco takagi fuzzi identif system applic model control ieee transact man cybernet averag regular estim neural reinforc learn multipl task hierarch cmac architectur robot autonom system thrun find structur reinforc learn neural inform process system mit ma ting stack bag dag model proc morgan san ca tumer error correl error reduct ensembl classifi connect tresp combin estim weight function neural inform process system mit ma ueda gener error ensembl estim ieee intern confer neural ieee press nj van der approxim neural network proc intern confer neural australia ieee nj learn delai reward phd cambridg uk tr complex analysi cooper mechan reinforc learn proc morgan san ca stack gener neural jordan altern model mixtur expert neural inform process system mit ma
AI/814 2 markov random field associ memori markov random field comput scienc chair pattern germani phone paper fulli connect energi function markov random field model inspir theori major task model defin neighborhood system irregular site energi function proper encod constraint energi function offer major advantag make avoid model problem case irregular site full connect make neighborhood definit energi function defin independ consid applic basic assumpt infinit dimens configur space energi choic energi depend scalar product kernel function energi solv problem high make result framework call model spin markov random field experi textur object show correct effect model introduct year grow interest comput vision machin learn commun spin glass theori applic learn recognit task physic describ magnet materi interact magnet moment random conflict attempt understand cooper behavior system led develop concept techniqu find applic extens area attractor neural network combinatori optim problem evolut reason idea extend result context appeal sg model disord system fulli understood theoret point view physicist studi long time disord system find hidden recent year discov collect behavior disord system entiti instanc magnet materi chang qualit behavior singl compon modifi slightli class describ collect behavior class class chang perturb system point view comput entiti imag object featur describ scene object compon model random interact conflict interact give rise collect behavior approach order integr result suitabl framework comput vision machin attempt parisi model match problem sg mathemat recent sg approach gaussian naiv field approxim recent replica method approach amit attractor neural network thousand binari perceptron successfulli recogn context larg number class perceptron random feed forward modifi field depend hebbian class repres act associ paper markov random field theori natur framework integr result comput vision applic mathemat formul equilibrium statist mechan consequ full connect main featur sg markovian properti automat sg model model strong motiv integr sg result framework make appli class problem applic difficult make imposs defin respect neighborhood energi function properli model constraint neighbor relat site defin respect case regular site definit gener success applic found literatur instanc monograph import note approach base model solv low level imag process problem author high level vision task object recognit due fact high level vision task gener model irregular neighborhood defin mean heurist gener instanc object recognit applic chosen featur invari pose pose paramet incorpor energi formul neighbor relat dramat due mutual neighborhood chang pose paramet energi case irregular site formul gener manual problem neighborhood definit avoid fulli connect full connect elimin defin distanc solv problem instanc zhu fulli connect textur vocabulari result comput time high deal problem eleg full connect make neighborhood definit energi function defin independ consid make find analyt properti minima make unnecessari construct fast algorithm search absolut minima previou work attempt integr result framework basic assumpt infinit dimens configur space energi live condit satisfi gener pattern recognit due choic function scalar product configur kernel function energi solv problem high make result model call model spin random field paper organ section review basic definit underli model problem case irregular neighborhood system section introduc basic idea topic present main concept result context familiar reader detail discuss applic attractor neural network found emphasi mathemat formul theoret result descript model energi function associ model section present show chosen energi written function scalar product open possibl kernel method order satisfi basic requir equilibrium statist high dimens configur space kernel trick map data possibl space respect space data live consequ kernel energi unexpect fascin kind kernel chosen order satisfi theoret constraint hebbian constraint lead choic gener gaussian kernel choic make interpret iz window induc choic make interpret kernel gener frame model section report experi perform recept field histogram classif result report textur object result obtain compar obtain nearest neighbor classifi distanc measur commonli emploi literatur histogram comparison perform paper conclud summari futur direct research markov random field markov random field branch probabl theori foundat model spatial interact lattic system interact featur label natur studi vision problem pose label problem solut set label assign imag pixel featur label problem term set site set label index discret set set continu ab discret number label problem assign label label set site set call label site term label site assign uniqu regard function domain imag terminolog random label call configur site relat neighborhood system neighborhood system defin set site neighbor subset call cliqu element neighbor set cliqu denot fm famili random variabl defin set random variabl discret label set probabl random variabl denot joint probabl denot fm defin respect neighborhood system set denot set label site set label site neighbor note random field site neighbor set random variabl gibb random field respect configur obei gibb exp exp normal constant call partit constant call energi function energi sum cliqu potenti cliqu depend local configur cliqu theorem establish gibb distribut distribut gibb distribut major task model defin neighborhood system irregular energi function proper encod constraint neighbor relat site relat irregular case neighborhood system defin mean heurist distanc energi function quantit cost measur qualiti solut minimum case irregular energi function formul gener manual problem relev model rare appli comput vision task object gener model irregular site problem neighborhood definit avoid fulli connect full connect elimin defin distanc dramat algorithm complex spin glass theori spin glass express spin glass introduc describ magnet materi interact spin random conflict studi system led develop field theori sg find applic extens area attractor neural network combinatori optim basic properti sg disord disord refer constrain disord interact spin frustrat refer conflict obei simultan relev frustrat lead degeneraci multipl interest mathemat structur studi sg introduc reader essenti ingredi sg behavior describ familiar situat mathemat model system life sourc goal mutual give make feel frustrat situat complex peopl shakespear situat frequent fight charact scene person relat friend enemi assum simplic feel good relat problem side case friend enemi side side friend hate stai opposit side frustrat situat analysi formal assign pair number ab enemi relat charact frustrat cb relat triplet situat scene unstabl rearrang side idea formal mathemat variabl valu depend side charact set ij interest minim energi function ij dynam error correspond examin sequenti set step equal ij introduc error optim eleg consist substitut probabl system reach equilibrium probabl defin eq function introduc error advantag comput probabl distribut configur equilibrium case formal ident equat statist mechan eq gibb probabl distribut boltzmann constant absolut temperatur dynam lead probabl distribut eq consid weight configur optim probabl distribut concentr optim larg finit probabl distribut concentr optim configur choic connect matrix ij lead system behavior order spin assum valu corner line connect spin spin interact energi configur spin sum pair connect line figur ij assum valu posit sign neighbor spin prefer sign ij pair spin edg lower energi product valu equal sign ij easi verifi configur arrang spin singl pair ij configur eq reach lowest note equilibrium configur symmetri transform model figur simpl exampl system system present system choic ij figur easi configur spin satisfi bound spin opposit bound align bound tend final align lead contradict configur give energi low system frustrat lowest energi system configur lowest note group state symmetri state insid group mean frustrat prevent energi low creat varieti ground state clear exampl problem find set minim eq harder harder grow ij sampl random infinit rang sg demonstr np complet problem aim determin algorithm find optim solut studi analyt properti optim optim solut clear knowledg make algorithm unnecessari section concentr choic interest attractor neural show section turn start point build sg model associ memori recognit conceptu relationship sg recurr neural network suggest sg relev model brain function weve previou section frustrat interact lead energi surfac suggest similar behavior model synapt efficaci neuron neuron model variabl synapt efficaci connect matrix frustrat interact produc global interpret memori impli train tune order put vallei correct minima larg basin subject constraint memori simplest model satisfi request hopfield model concentr attent configur space dimens configur random variabl valu assum system fulli effect interact site assum ij ji stabl state system configur minima energi function specif connect matrix ij set configur system call assumpt prove chapter detail analysi appendix signal analysi absolut minima phase transit absolut minima system capabl store configur result extend discret continu case equat mean pattern memor memor situat configur pattern label absolut minima prescript pattern contribut connect matrix term product valu neuron network state ident pattern due hopfield model simplest model associ memori markov random field kernel associ memori analog led model brain function make attract idea energi function framework pattern recognit time vallei interpret configur state relat class recogn eq solv model problem illustr section irregular site energi full connect make neighborhood definit energi function defin independ consid applic detail analyt knowledg energi function make avoid np complet problem section pattern recognit set continu label label configur configur space configur goal classifi sampl class view pixel consid problem classifi class object singl configur imag maximum posteriori criteria argmax map classifi rewritten argmax interest noisi interest reader find detail chap assum class priori probabl likelihood evalu map classifi ml classifi argmax argmin model eq configur space set prototyp hold orthogon condit relax linear independ orthogon obtain chang basi impli relev inform normal configur satisfi sever limit kind featur pattern recognit problem solv approach condit impli larg number featur due condit satisfi suggest gener energi function configur space find sort dichotom work applic finit dimens data energi function infinit dimens space solut dilemma data space nonlinear map data space determin chosen featur applic loss gener assum energi space determin requir find map energi model condit automat condit matter dont find map thing easier notic energi function due choic connect matrix rewritten function scalar product configur equat depend data scalar product space function form find kernel function satisfi condit substitut equat equat theoret result mercer find kernel function satisfi equat explicitli map mercer condit kernel exist pair properti exist map dx idea substitut kernel repres scalar product higher dimens algorithm depend scalar product data call kernel trick support vector machin year theoret result interest machin learn comput vision commun kernel function method densiti estim kernel trick result energi function subset prototyp classifi argmin kernel method probabl densiti estim classif import note kernel condit satisfi mean energi defin space space data live condit orthogon signal analysi stabil store prototyp turn condit domin term stabil prototyp chosen kernel satisfi condit kernel function scalar product space map prototyp stress kernel energi function due fact choic write energi function scalar product kernel associ memori choic kernel algorithm make kernel trick provid criteria order kernel spite fact choic kernel lead poor perform case svm kernel choic satisfi criteria condit satisfi gaussian radial basi function kernel prove satisfi mercer condit kernel case gener gaussian kernel chosen distanc input space kernel formul defin gener distanc measur equat distanc demonstr satisfi mercer condit exponenti affect valid mercer remap input variabl kernel gener distanc satisfi condit interest choic distanc symmetr approxim function distanc gaussian kernel exp kernel satisfi mercer condit color histogram imag base classif svm excel perform gener kernel color histogram imag base prove effect choic prototyp set train exampl rel condit satisfi prototyp map space space measur orthogon map pattern kernel function due properti gaussian kernel effect figur gener gaussian kernel valu orthogon pattern space condit give constraint satisfi dont introduc criteria choic natur train sampl case energi function repres contribut energi prototyp rel class choic simpl interest interpret notic squar oper kernel polynomi kernel oper kernel kernel kernel kernel rewrit equat number train sampl kernel argument posit integr view probabl densiti gaussian kernel satisfi quantiti interpret window estim class densiti space multipl factor consid incorpor assumpt doesnt chang map classif result consid class note prior inform probabl consid class choic train pattern prototyp problem larg number train exampl class train pattern similar case orthogon pattern made kernel insuffici stabil train exampl prototyp risk store prototyp hold risk higher number train sampl debt bernhard idea maximum entropi frame section stress similar frame model zhu section condit satisfi order hopfield model lead kernel energi choic gener gaussian kernel make condit space notic gener gaussian kernel suitabl histogram effect product ab gener distanc ab smaller smaller behavior explain bin histogram repres singl uniform color region singl uniform grei level imag repres histogram small variat intens region effect move neighbor result histogram assum simplic neighbor bin empti ab ab rbf stand laplacian distanc clear exponenti decai faster faster ab suggest histogram natur choic histogram successfulli textur object recognit assum histogram analog frame model strong frame model statist theori textur set filter select captur textur filter histogram comput histogram interpret margin distribut unknown probabl distribut consid textur sampl probabl estim set margin maximum entropi principl textur sampl statist model exp probabl paramet determin constraint ob ob comput sampl imag distribut satisfi constraint maximum unifi textur model differ definit featur statist energi function frame gibb distribut energi function depend scalar product fulli connect equat written suggest possibl interpret kernel frame model work understood interpret mean condit prototyp final understood effect kernel function singl configur vector equat function interpret filter oper configur vector experi section present experi test classif perform textur object experi recept field histogram method schiel order extend color histogram approach swain ballard main idea calcul histogram vector recept field determin chose local properti measur recept field determin dimens resolut axi basi result report chose experi local characterist base gaussian lap xx yy debt alan yuill idea gratefulli schiel softwar comput exp gaussian distribut xx yy order deriv respect textur experi chose scale resolut histogram axi bin view repres object experi chose resolut histogram axi bin resolut histogram axi bin case view repres case classif framework section chose gener gaussian kernel obtain kernel perform compar distanc prove effect comparison measur experi run sgi matlab textur experi classif experi twenti natur textur brodatz textur album figur origin imag dimens obtain overlap region pixel textur consist imag chose prototyp prototyp select randomli sampl class train sampl set made singl view paramet select heurist found perform obtain classif result shown tabl prototyp behav product ab recognit rate remark note roughli agreement theoret expect section recognit time view sec tabl classif result textur figur textur object experi set experi columbia benchmark object recognit object figur view view pixel imag obtain place object turntabl view imag experi chose class repres prototyp experi run chose classif result shown tabl experi perform chose tabl classif result object tabl classif result object classif result shown tabl stress report knowledg approach successfulli appli columbia tabl recognit perform product ab agreement result obtain result report recognit time view sec higher recognit time obtain experi due higher number prototyp gener experi lower basic effect lower interest note behavior present textur experi prototyp recognit rate obtain gener kernel ab suggest kernel effect similar measur histogram comparison summari paper present energi function inspir model physic disord system energi function present main easili appli problem model irregular site consid neighborhood system fulli requir algorithm search absolut minima analyt properti theori basic assumpt infinit dimens configur choic depend scalar product kernel trick figur object make result framework experi textur object show higher classif perform compar histogram comparison measur work extend wai classif system experi order demonstr potenti capabl object gener pattern recognit investig perform manner histogram base test possibl combin criteria select prototyp introduc doubl effect speed recognit time improv classif perform consequ connect frame model explor classif theori model probabl densiti textur order find explicit formul partit function acknowledg pleasur schiel scholkopf inspir discuss work partial support research center imag analysi refer brain cambridg network shape neural network pattern spin glass model markov random proc workshop perspect kernel base learn markov random field object technic report januari imag ieee tran neural hart pattern john wilei son suppress spuriou state neural network nonlinear analog physic review vol pp dec network physic system emerg collect comput proc acad sci vol pp april grade collect comput properti proc acad sci vol pp model physic review vol pp random field model comput comput scienc li probabilist approach object burkhard comput vision eccv volum ii lectur note comput page springer curv gaussian process framework good advanc neural inform process system editor dietterich mit press spin glass theori world jw zhang markov random field approach imag interpret ieee transact pattern analysi machin june object imag librari tech report dept comp columbia field method classif gaussian advanc neural inform process system solla pp mit press correspond recept field intern journal comput pp learn mit press special issu machin learn vector machin kernel editor campbel journal comput pp statist learn wheeler sensor probabilist hypothesi robust local object recognit ieee transact pattern analysi machin winkler imag random field dynam mont carlo volum applic mathemat sc zhu gestalt law markov random field novemb random field maximum entropi intern journal comput pp
AI/815 2 interact plan architectur applic evacu oper hector yz david aha len breslow dana nau depart comput scienc maryland colleg md navi center appli research ai naval research laboratori dc abstract paper describ interact architectur gener plan architectur develop appli assist militari command staff plan neo evacu integr hierarch task plan maintain agenda tactic plan task guidelin militari address neo plan support bookkeep crucial plan task differ greatli neo oper militari plan personnel select task interact refin oper plan select appli repres task decomposit previou neo oper command previou experi formul oper plan accord neo doctrin introduct neo evacu militari evacu oper requir perform hundr subtask primari goal minim loss life formul neo plan complex task involv wide rang factor militari polit meteorolog uncertainti hostil level flaw neo plan yield consequ siegel report mistak eastern exit doctrin state inspect prior embark militari transport task assign eastern exit ground produc weapon helicopt evacu flight immedi result illustr difficulti plan neo manual thesi command staff greatli benefit assist intellig neo plan formul tool analyz guidelin neo review case studi consult neo plan conclud command accept assist tool exhibit ffl doctrin task analysi guid plan formul technic note januari ffl support interact capabl ffl provid case index plan segment previou retriev user warrant current oper environ ffl perform record maintain inform statu relat task joint task forc element system neo plan discuss relat deploi exhibit characterist paper introduc plan formul tool design meet applic assist neo planner interact architectur integr task decomposit user edit doctrin task select task user interact refin htn plan integr ensur oper plan frame plan doctrin made command mechan incorpor doctrin oper plan formul cycl practic support interact task edit oper plan formul incorpor knowledg previou repres augment replac oper procedur section describ neo plan knowledg architectur final section detail contrast contribut relat work evacu oper neo conduct assist usa depart state evacu militari select countri nation live danger locat host foreign nation safe haven involv swift insert temporari occup object usa plan withdraw mission complet neo plan oper conduct author forc size rang hundr branch arm servic number thousand ten neo conduct past decad eastern exit assur unclassifi public exist describ neo doctrin case studi gener make process neo made oper strateg level involv global polit perform neo tactic level involv determin size composit forc execut neo oper level concret assign specif resourc specif task implement java download inform neo command plan neo context doctrin establish framework design strateg tactic oper partli address doctrin describ gener aspect consid plan militari includ chain command task agenda doctrin ideal account characterist specif neo command adapt doctrin specif wai dynam modifi doctrin guidanc elimin irrelev plan task ad depend oper resourc command past experi neo doctrin state forward command element insert evacu area prior primari evacu tempor constraint prevent insert emploi experi previou complement doctrin suggest oper refin suitabl current environ draw experi identifi concentr plan multipl evacu site command staff guidanc doctrin oper experi past oper plan neo describ assist neo planner interact refin tactic plan oper focu effort ignor strateg issu involv polit aspect challeng model simul knowledg architectur plan formul variant hierarch task network repres plan express defin htn set task order denot tm oei relat oe form oe express tempor restrict task problem solv htn occur appli method task subtask method form hp set precondit appli appli task yield htn consist task distinguish uniqu multipl method task oper occur leav network uniqu task correspond solv uncondit method task multipl wai correspond solv specif context method task repres repres precondit set pair case obtain oper manual standard oper procedur report detail previou episod solv task access case precondit case case similar episod standard procedur call depart state concentr prior transport organ deploi eastern exit sharp edg concentr forc multipl separ evacu interact planner command question displai displai planner task agenda command hierarchi agenda editor neo subtask descript task decomposit select case librari method base select task select knowledg base edit task neo doctrin plan figur architectur integr subsect describ compon integr hierarch task editor neo difficult command staff track complet statu task perform element hierarch task editor conceiv facilit neo plan process knowledg base tactic edit knowledg base select task edit assign militari personnel investig statu task serv bookkeep maintain task agenda planner formul plan task knowledg base consist command assign task command applic neo plan encod htn captur critic plan knowledg neo doctrin requir substanti manual knowledg acquisit htn consist prepar sh organ process perform evacu insert main bodi insert prepar forc forc main bodi support forc preliminari evacu task figur top level neo task assign command element arrow denot arrow denot task intermedi stage task order relat elicit command hierarchi commonli neo oper elicit relat task element map task command element addit provid user visual descript neo edit order command map task command assign militari command tailor knowledg base circumst current neo function support enabl task monitor execut paper plan detail figur displai top level task perform neo element task doctrin describ procedur tactic plan provid suffici detail formul oper plan assist planner refin select task oper subtask variant case retriev tool extend support htn plan task task conduct interact end user appli method displai case select node question case answer current neo user select answer displai pair comput similar current task potenti decomposit method case rank question rank frequenc displai case answer question modifi case rank displai end user select case current task displai case select task question answer match current plan scenario precondit match appli case base previou experi select question user answer differ support partial match precondit current plan scenario integr integr formul plan accord doctrin case input htn describ doctrin applic uniqu task expand set case subtask multipl wai user output edit htn leav oper action case applic militari plan personnel edit neo knowledg base delet task edit command reassign task command element user select task initi index case retriev yield select case network subtask task oper action reach task immedi displai oper action complex requir plan agent secur perimet task assign secur element secur element command plan establish perimet command perspect simpl task plan assign subordin element neo planner formul main action element accomplish kei task user gener plan perform altern task decomposit edit knowledg base handl unforeseen occur plan execut scope paper summari satisfi requir state introduct plan obtain circumscrib doctrin modif introduc command support task edit trigger task case incorpor knowledg previou oper serv task decomposit altern user visual check task assign element figur snapshot displai doctrin task hierarch organ arrow denot order constraint neo plan neo plan user view top level task assign task view decomposit figur show intermedi stage process user select task select assembl area evacu control highlight command element standard procedur dictat ideal assembl area concentr altern method consid task militari planner select displai altern initi figur user answer hostil yield perfect match displai case user select figur show subtask displai correspond case decomposit network send air task correspond oper action user determin hostil initi dialogu figur figur show snapshot user select detect hostil altern decid handl hostil presenc prompt dialogu assum user answer hostil forc match situat oper eastern exit multipl locat transport gather user select assign displai figur answer question top window direct user user answer list answer lower window displai question figur interfac select determin hostil presenc task relat research deploi neo plan tool conceptu design predict forc size type requir neo chavez henrion approach instanti gener neo plan specif paramet assess altern plan gil al present system predict man estim neo task system formul neo plan al distribut hierarch plan system implement darpa agenc sponsor project relat neo figur command handl hostil presenc plan tate system approach plan formul advantag user increment elabor plan focu attent guid access store plan fragment neo plan approach inspir research applic case retriev system extend appli hierarch plan task research approach htn plan task militari domain mitchel integr select task tactic planner neo plan requir task address choic involv perform task suggest plan perform task decomposit interact focu retriev plan adapt learn plan formul automat gener plan guid edit object hierarchi object user interact task formul research relat system crisi ferguson allen interact planner militari crisi system case plan formul perform task decomposit distribut gener planner case al interact hierarch schedul crisi perform interact plan formul al fight forest fire support interact plan hierarch guidelin formul plan leak al appli disast learn case adapt interact knowledg acquisit problem elicit transit plan tool assist militari command formul oper plan tool combin task decomposit process reason approach support interact plan formul yield plan benefit previou experi sound doctrin support experi planner exploit knowledg plan expert case perform bookkeep design characterist chosen enhanc accept militari plan previou approach includ capabl great potenti combin htn plan techniqu realworld applic illustr unifi framework complex evacu multipl sourc inform previou oper standard oper target serv plan formul compon interact support system develop system center id perform distribut plan replan neo plan effort integr gener htn planner process numer comput numer inform import neo oper made resourc capabl avail determin helicopt requir acknowledg pat langlei frank comment earlier draft research support grant naval research laboratori armi research laboratori offic naval research refer refin case librari intern confer reason springer twofold integr cbr support system dw aha jj daniel reason paper workshop report menlo aaai press lj integr ai compon militari plan applic nation confer artifici intellig aaai press navi aid environ report naval research navi center appli research artifici intellig matter plan effici estim inform laboratori plane schedul initi morgan kaufmann hybrid approach integr gener plan dw aha jj daniel reason paper workshop report menlo aaai press dod joint techniqu procedur evacu oper public report depart htn complex express twelfth nation confer artifici intellig aaai press jf integr intellig assist nation confer artifici intellig aaai press seed interact crisi assist dw aha jj daniel reason paper workshop report menlo aaai press criteria direct evalu plan system laboratori plane schedul initi morgan kaufmann sr user design support system evacu oper unit state central command master school air forc institut ohio kirk evacu plan pai naval war colleg acquir case adapt hybrid approach thirteenth nation confer artifici intellig aaai press sw hybrid architectur plan control ninth confer innov applic artifici intellig aaai press descript function report naval research navi center appli research artifici intellig gr oper sharp corp program action marin corp ab eastern evacu oper januari report center naval ab requir assist peac insight case studi report center naval david evacu oper support nation militari strategi fort unit state armi command gener staff school advanc militari studi mix initi plan laboratori plane schedul initi morgan kaufmann mt plan ninth confer innov applic artifici intellig aaai press control commun distribut plan irrelev reason nation confer artifici intellig aaai press
IR/816 5 learn construct knowledg base world wide web mark craven dan dipasquo dayn freitag andrew mccallum tom mitchel kamal nigam sean slatteri school comput carnegi mellon forb usa henri usa abstract world wide web vast sourc inform access understand human goal research automat creat comput understand knowledg base content mirror world wide web knowledg base enabl effect retriev web promot web support infer problem solv approach develop trainabl inform extract system input ontolog defin class relat emploi produc interest creat knowledg base set train data consist label region hypertext repres instanc class relat system learn extract inform page hyperlink web articl describ gener machin learn algorithm initi result prototyp system creat knowledg base describ research project research support part darpa program research contract view document author interpret repres offici express darpa govern preprint submit artifici intellig januari opportun rise world wide web made workstat retriev web page person web largest sourc inform expect grow world primari knowledg resourc decad research motiv simpl workstat retriev web understand web page goal research project automat creat knowledg base content mirror world wide web wide knowledg consist comput understand assert probabilist form emploi carnegi mellon expect world wide knowledg base effect inform retriev support queri mile pittsburgh offer java step enabl web support infer problem solv provid knowledg base softwar travel agent handl request hotel flight arrang upcom acm notic inform acm nearbi flight spread multipl text page web knowledg base make inform support varieti intellig agent construct maintain world wide knowledg thesi explor articl develop knowledg base machin learn creat inform extract method desir type appli learn inform extract method extract probabilist statement directli web hypertext assert knowledg base carri term web sourc inform extract provid evidenti support web evolv knowledg base automat updat reflect chang content articl explor thesi evalu learn algorithm relev inform extract present prototyp system successfulli built knowledg base thousand assert comput scienc depart learn inform extractor fundament cs home page jim tom jim home page web kb entiti activ person depart student staff faculti jim research includ intellig web agent human comput interact teach fundament cs intro ai tom fig overview system top part figur show ontolog defin class relat interest partial box repres arrow special relationship defin relat class list insid box bottom part show web page identifi train exampl class faculti page constitut train relat instructor taught ontolog set train learn interpret addit web page hyperlink add instanc knowledg shown middl figur instanc repres dash partial box dash line show relationship instanc web sourc begin briefli survei capabl system section subsequ section consid detail assumpt underli approach remain section present learn algorithm result inform extract relat overview system system train extract inform desir web site order automat popul knowledg base assert train user provid specif class relat interest ontolog defin vocabulari target knowledg base ontolog provid top half figur ontolog defin hierarchi class includ research defin relat class advisor relat instanc student instanc faculti advisor option instanc class constitut initi version knowledg base train exampl describ instanc ontolog class relat web page shown bottom figur repres instanc faculti class pair page repres instanc relat taught taught jim includ ontolog set train system learn gener procedur extract instanc class relat web current accomplish learn classifi arbitrari web page hyperlink path class relat defin ontolog explor system start input url explor page search follow link explor page learn class repres member ontolog class page determin class entiti repres page knowledg ontolog relat page instanti base learn rule local structur web page page class search link page crawl experi system train set approxim web page pair comput scienc depart web site texa train exampl hand label ontolog shown figur system explor web site comput scienc depart carnegi mellon add knowledg base entri base inform extract web site faculti fig entiti automat extract cmu comput scienc depart web site train comput scienc site entiti ad instanc faculti project knowledg base shown figur identifi refer entiti automat gener titl page entiti extract research student faculti person project depart extract correct accuraci tabl class instanc recogni tion accuraci explor cmu comput scienc depart web train comput scienc depart instanc ad system knowledg result web shown figur top instanc describ faculti ad knowledg result examin web page system classifi categori system creat faculti instanc knowledg extract relat involv instanc determin faculti taught faculti instanc project relat faculti project instanc research project extract web page descript shown bottom figur identifi refer instanc automat gener titl page instanc extract accur system extract system visit web page carnegi mellon instructor member project depart extract correct accuraci tabl relat instanc recognit accuraci explor cmu comput scienc depart web train comput scienc depart result ad class instanc knowledg base fraction correctli extract instanc summar tabl tabl system creat knowledg base instanc class fact repres accuraci extract relat instanc summar similar fashion tabl note dont label page relat carnegi calcul coverag result task figur show inform displai system note displai show web page visit inform extract system web page interfac control panel user interact system grow knowledg base problem formul summar previou system support thesi system train automat popul knowledg base web hypertext section describ detail learn algorithm system problem formul assumpt underli current approach interest gener knowledg base consist ontolog defin class relat instructor instanc refer accuraci measur commonli commun refer coverag recal measur fig web interfac system upper left pane serv control panel middl left pane describ current activ lower left pane summar session upper pane show page lower pane mechan extract knowledg base class train exampl web describ instanc class relat gener procedur capabl extract addit instanc class relat rest web note necessarili extract instanc class relat ontolog ontolog class countri initi knowledg base includ instanc countri world learn procedur recogn pursu problem learn extract instanc make assumpt type knowledg extract knowledg repres hypertext web assumpt ffl assumpt class instanc web assum instanc ontolog class repres segment hypertext web segment singl web contigu string text web root graph web page link direct edg hyperlink instanc person singl page person home refer person string text arbitrari web collect interconnect web page jointli describ person ffl assumpt relat instanc web arbitrari instanc relat assum instanc relat repres web wai instanc repres undirect path hyperlink page connect segment repres segment repres bottom figur show hyperlink connect segment repres jim segment repres hyperlink repres relat instructor instanc altern repres segment text repres segment repres relat instanc taught repres figur fact jim home page phrase context instanc repres fact hypertext segment satisfi learn model extract instanc research area classifi jim page statist model word typic found page describ ai research appendix formal present assumpt addit assumpt map web hypertext make simplifi assumpt initi research report articl plan relax assumpt futur research progress ffl assum articl class instanc repres singl web page person repres home instanc multipl page person home page collect neighbor page describ current system train classifi primari home page descript ignor neighbor affili page instanc text system creat knowledg base instanc extract relat valu text fragment illustr figur ffl assum class instanc repres singl segment hypertext system encount unlink web page repres instanc creat distinct instanc class knowledg base assumpt satisfi distinct person home page typic repres distinct except web page describ overcom elvi requir method independ discov instanc ffl assum relat relat argument fairli easi relax assumpt problem definit current set view primari learn task involv extract instanc recogn class instanc classifi bodi hypertext section statist relat learn techniqu examin relax assumpt class instanc repres singl web page recogn relat instanc classifi chain hyperlink section investig relat learn solut problem recogn class relat instanc extract small field text web page section task relat learn approach testb experi report articl base ontolog comput scienc depart shown figur ontolog includ class research web page classif experi class label web page fall ontolog class ontolog class set exist instanc class class instanc ontolog class slot call instructor relat peopl assembl data set experi report set page hyperlink drawn cs texa cornel wisconsin set page numer comput scienc depart set includ page hyperlink interconnect set includ addit page page class data set collect page class interest page hyperlink student label data straightforward gather initi set collect page point hyperlink initi page point page gather step label addit label label relat instanc relat instanc consist pair page class instanc involv relat instanc instructor relat consist home page person home page data set relat instanc instructor member project member depart instanc instanc set label owner page person class automat tag text fragment person home page match hyperlink point page index page match heurist favor recal occurr posit person procedur yield distinct occurr instanc set subsequ experi crossvalid methodolog evalu algorithm conduct run train classifi data data set set page test classifi data remain iter hold test set data set publicli learn recogn class instanc task system identifi instanc ontolog class text sourc web section address case class instanc repres web instanc student class repres student home page part section discuss statist approach classifi web page method page part section discuss learn firstord rule classifi web page appeal aspect approach rule describ page class rich descript local graph structur page evalu effect combin predict made classifi statist text classif section classifi web page statist method approach similar grow bodi work text classif involv bag word unigram appli method wai advantag redund hypertext train independ classifi page ffl word occur ffl word occur titl html head ffl word occur hyperlink word anchor point page approach approach involv build probabilist model class label train classifi newli page select class probabl evid word describ page method classifi web page naiv minor modif base diverg document calcul score class score log log number word size ith word vocabulari repres probabl randomli drawn word randomli drawn document class word repres proport word document word class predict method document simpli class greatest score method make classif naiv produc classif score extrem explain naiv appendix detail modif naiv probabilist model ignor sequenc word occur model call unigram model base statist singl word isol unigram model naiv assum presenc word document independ word document rule call naiv condit independ assumpt violat empir naiv classifi good job classifi text document observ part explain fact classif estim function sign binari function estim word independ assumpt naiv give extrem class probabl estim estim poor classif accuraci remain high common approach naiv text classif bernoulli bayesian network depend word binari word document consid featur boolean variabl indic presenc absenc word document multinomi unigram languag model integ word word consid document collect event found outperform data set formul naiv text classif set class fc document consist classifi document member word argmax transform comput express appli rule rewrit express product rule drop term constant assum word independ modif transform tradit formul naiv form equat appendix estim word probabl kei step implement naiv estim word make probabl estim robust respect infrequ encount smooth method modifi probabl obtain simpl event count import effect smooth avoid assign probabl valu word occur train data class naiv involv product word singl class prevent class maximum word strongli class smooth common laplac estim ad word count smooth found perform amount train data class differ dramat differ laplac smooth strength prior depend relationship number uniqu word total number word occurr train data word occur uniqu prior word prior weaker set count number time word occur train data class total number uniqu word class total number uniqu word class note set defin obtain standard maximum likelihood estim featur select import implement issu decid vocabulari size problem domain found empir slightli accur classif restrict vocabulari size limit vocabulari word experi vocabulari select rank word averag mutual inform respect class label write random variabl indic word present absent write fw valu write random variabl valu class averag mutual inform log featur select method found perform altern text classif studi evalu evalu method data set methodolog section iter train classifi page begin actual student faculti staff research project depart predict accuraci student faculti staff research project depart coverag tabl matrix show result classifi web page classifi result combin test run coverag accuraci shown hyperlink tabl show result matrix test classifi column matrix repres class show instanc class classifi row repres instanc predict belong show true class instanc tabl illustr interest result note coverag high faculti instanc correctli classifi notabl except trend instanc belong class correctli classifi discuss result detail interest result remain mistak made classifi involv subclass person staff instanc correctli assign staff correct superclass level person result mistak equal fail correctli classifi instanc leaf class make correct infer instanc correctli assign gener class low level classif accuraci class larg explain natur class recal section instanc class collect gather page hyperlink instanc class instanc class word similar instanc class home page belong page page describ read belong class content page class suggest properli belong core motiv includ class system web ad instanc knowledg ensur add multipl instanc correspond object add instanc knowledg base encount home page secondari page list read assign frame page classif task correctli recogn page class interest tabl difficult show combin sourc evid perform high accuraci obtain insight learn classifi word contribut highli quantiti score class measur train set data calcul log word class figur show ten word class greatest weight ratio space show word staff class tabl highli weight word intuit prototyp class except gener class repres extrem set page interest result illustr tabl word includ stop list highli weight model word typic word top ten word student class common predict student class pronoun verb conjug frequent page stop list set word commonli remov document process system standard stop list includ word gener thought convei inform document topic student page home comput scienc faculti professor comput research scienc system homework assign class hour assign due research project group project research laboratori system system project depart depart scienc comput faculti inform undergradu graduat staff server dd gt tabl top ten highli weight word tabl show ten word highli weight learn model weight shown repres weight ratio word class symbol repres arbitrari digit top word shown faculti repres token occur phone class result suggest advantag select vocabulari domain specif mutual gener stop list tabl show result assign page class highest score approach improv classif accuraci limit accuraci coverag student faculti depart staff fig tradeoff classifi predict class order confid curv show behavior classifi threshold confid vari repres percentag page class correctli classifi belong class repres percentag page assign class member class predict made classifi predict confid easili achiev method quantiti score calcul classifi page measur confid classif set minimum threshold select point coverag order obtain accuraci goal automat extract knowledg base inform desir begin limit coverag page web effect trade coverag accuraci classifi shown figur horizont axi plot repres percentag page class correctli classifi belong class vertic axi repres percentag page classifi class member class understand class student result tabl classifi predict page belong student class correct time rightmost point student curv tabl correspond point confid threshold accuraci predict rise accuraci coverag student faculti depart staff fig tradeoff hyperlink classifi accuraci coverag student faculti depart staff fig tradeoff classifi coverag accuraci reach level discuss result classifi figur show curv hyperlink curv show aggreg result test set run discuss aspect distinguish learn hypertext learn domain hypertext independ sourc evid mean piec text result figur multipl sourc evid potenti combin make predict accuraci depart predict made hyperlink classifi classifi accur full hyperlink classifi accur depart curv hyperlink classifi uniformli superior curv classifi reason differ accuraci data set includ depart page includ hyperlink point depart page hyperlink classifi larg sampl data learn word statist hyperlink point depart similarli fairli larg number hyperlink base predict classifi page train classifi illustr case page classif result predict accuraci simpli classifi curv faculti research project curv classifi coverag level explan result titl head provid summari page tend word highli predict page class text classif note hypertext structur web thought graph web page node graph hyperlink edg method classifi web page discuss previou section word singl node graph set edg node method learn model account featur pattern connect word occur neighbor page profit rule form page home page word textbook ta link page word rule repres gener characterist repres task learn classifi page learner induc rule approach learn algorithm section quinlan foil algorithm foil greedi cover algorithm learn horn foil induc horn begin empti tail search add liter tail cover posit instanc evalu function search measur provid learn algorithm consist background ffl set relat word occur page boolean relat page word word occur distinct relat word vocabulari set includ stem word occurr occur page constraint select intent assembl vocabulari reason size includ word discrimin power predic run priori subset page profit describ learn select vocabulari mutual statist text classifi ffl link relat repres hyperlink interconnect page data set appli foil learn separ set class consid previou section learn descript treat default class classifi test calcul measur confid predict calcul confid valu reason resolv conflict predict term rule interchang stem refer process heurist reduc word root form word comput comput stem root comput version foil specif design problem induct bia version suit task independ learn rule set interest measur accuraci learn rule set vari adjust coverag procedur calcul confid predict estim learn calcul rule accuraci train exampl rule accuraci defin accuraci mp number instanc correctli classifi total number instanc classifi prior estim rule constant call sampl size determin heavili weight rel observ data set set proport instanc train set belong target class score sort order descend accuraci integr predict independ learn ffl classifi rule match predict confid ffl classifi match predict class confid rule score class predict confid minu score ffl classifi match rule predict class confid equal score match rule divid total number classifi match rule class predict confid make total confid sum evalu experi report foil default set experi section crossvalid methodolog result plot class shown figur compar result figur rule gener provid lower coverag statist provid superior accuraci class figur show rule learn foil chang affect classif made learn set affect confid predict syntax learn rule symbol accuraci coverag student faculti depart staff fig tradeoff foil page classifi valid run learn rule shown illustr power rule classifi page home page pass group page word doesnt word good page hyperlink page hyperlink page link page word assign sampl rule learn student class run leav page washington train set notic rule refer page variabl common stem version rule similar rule learn train illustr foil learn exploit page order identifi student home page washington test correct applic rule bind page entitl student uw faculti rule classifi page faculti page stem variant faculti point page repres implic head rule left side oper bodi side ontolog class start letter variabl start letter link train test neg link train test neg link train test neg fig rule learn foil classifi page rule show classif ordinari text classif neighbor page provid strong evid class page learn method inform effect perform standard techniqu domain combin learner previou experi show page classif depend class observ suggest profit combin predict made classifi describ evalu simpl approach task approach method emploi combin predict classifi advantag fact classifi produc measur confid predict method simpl vote scheme confid valu predict made classifi web predict class plural vote made individu class select class highest confid predict order ensur confid measur output classifi calibr classifi induc map output score probabl predict correct partit score produc classifi bin measur accuraci score fall bin accuraci coverag student faculti depart staff fig tradeoff combin classifi vocabulari size word evalu figur show curv vote predictor compar figur curv classifi shown figur accur predict achiev evid classifi page high level vote classifi accur classifi depart class research project predict made vote classifi significantli accur coverag attain vote classifi good figur predict accuraci case combin multipl result experi disappoint curv vote classifi uniformli curv constitu classifi curv class good counterpart curv constitu classifi result shown figur disappoint method combin predict multipl classifi overli simpl method fail accur map classif score estim accuraci observ vote method perform statist classifi limit small vocabulari figur show curv accuraci coverag student faculti depart staff fig tradeoff combin classifi vocabulari size word vote statist classifi train vocabulari size word compar figur baselin classifi curv produc vote method gener superior classifi curv vote classifi achiev result constitu classifi accur vocabulari counterpart futur plan altern combin function exploit special area exhibit individu classifi identifi segment discuss section assumpt class instanc knowledg base correspond contigu segment hypertext web student repres web singl web cluster interlink web page center home page experi report effect made simpler instanc repres singl web page label train encount varieti student instanc ontolog interlink web page singl page case hand label primari home page label interlink page student remov simplifi assumpt develop method identifi set interlink page repres singl knowledg base instanc section present set heurist identifi group relat page identifi home page group show classif accuraci previou section significantli improv heurist group page automat assign label fit assumpt made hand label data approach web page prototyp faculti member main page page list public page describ research interest work assumpt relationship recogn page correspond singl identifi repres page classifi page classifi rest page accomplish solv group relat page identifi repres page group spertu identifi regular url structur present heurist discov page group identifi repres home page slightli approach imagin learn heurist experi provid rule hand obviou group extract url base directori structur prefix kei directori compon url logic group web page entiti url deduc exist entiti url prefix keyword penultim directori posit typic presenc person entiti directori space denot typic penultim prefix marker ultim prefix marker typic indic typic indic usernam person organ algorithm group url longest directori prefix match pattern event pattern entir directori prefix group url entiti prefix group appli group heurist result set web page conjectur repres singl ontolog entiti identifi singl primari page repres entiti correspond entiti page filenam pattern label primari page page complet url directori url filenam match directori identifi primari page page match pattern classifi automat event page group match page highest classif confid label primari page classifi faculti classifi page classifi classifi predict definit algorithm appendix evalu impact url heurist origin page classifi summar figur compar curv figur strike accuraci level coverag class note degrad total coverag occur page correctli classifi page section summari section task recogn class instanc web page classif show hypertext redund web page classifi sourc full text text titl text text neighbor file organ repres url experi suggest approach suffici recogn instanc ontolog class high accuraci experi section classifi accuraci coverag student faculti depart staff fig tradeoff classifi applic url heurist url heurist show section line research combin predict multipl classifi sourc evid learn recogn relat instanc previou section discuss task learn extract instanc ontolog class web approach task assum class instanc interest repres web page cluster web page discuss task learn recogn relat interest exist extract class instanc hypothesi underli approach relat class instanc repres hyperlink path web task learn recogn instanc relat involv induc rule prototyp path relat instanc instructor relat repres hyperlink directli home page home page instructor link variabl repres web liter repres predict classif liter link test exist hyperlink page page problem task involv discov hyperlink path unknown variabl emploi learn method learn rule algorithm develop task base foil algorithm page classif section discuss algorithm detail problem relat learn task consist background ffl class set page class consid section class relat list page repres instanc class page train instanc relat determin actual class page page test predict page class classifi discuss section system access predict page test set condit repres system face ffl link relat repres web hyperlink argument relat specifi identifi argument specifi page hyperlink argument page hyperlink point ffl set relat word found anchor text hyperlink vocabulari set relat includ word occur time set hyperlink train set note word relat section describ web set hyperlink ffl word instanc relat hyperlink word anchor text start capit letter ffl instanc relat hyperlink word alphabet numer charact teach ffl neighborhood set relat word found hyperlink neighborhood hyperlink includ word singl list tabl titl head hyperlink vocabulari set relat includ frequent occur word train word stoplist learn definit target relat data set section member instructor depart addit posit instanc train set includ approxim neg exampl form set neg train instanc target relat pair page posit instanc target relat select criterion result sampl neg instanc connect pair page small reason learn time depart person augment neg instanc pair posit instanc addit neg instanc preclud learner learn trivial rule person member depart learn method state algorithm learn relat rule similar foil greedi cover approach learn set horn primari differ method foil twofold unlik foil method simpli search add concept definit method evalu function search process discuss differ turn section foil construct search space candid liter found strategi unabl learn rule path consist hyperlink search process method emploi consist phase part addit liter ad search algorithm construct path part variant richard moonei relat pathfind method method design allevi basic weak learn good definit step search space exhibit gain basic idea underli relat pathfind relat problem domain thought direct graph node domain constant edg correspond relat hold constant algorithm find small number prototyp path graph train set neg uncov posit instanc uncov posit instanc find path bound background relat select common path prototyp search hasnt fail gener path initi refin fail find accept backtrack step learn fig procedur learn determinist variant relat pathfind expand subgraph return path fig find path background relat left shown graph constant link singl binari relat graph thought repres web page connect hyperlink pair uncov posit instanc pathfind proce expand subgraph constant intersect return path link constant instanc target relat figur overview pathfind procedur learn singl procedur iter complet definit learn step method find shortest path bound length posit instanc target cover learn illustr figur involv expand subgraph constant instanc subgraph expand find constant reach instanc background relat connect constant frontier subgraph find path uncov posit find path posit instanc return common path fig find common path set posit instanc graph shown figur posit instanc algorithm find shortest path instanc return common path prototyp instanc path instanc direct path prototyp convert initi mon path prototyp initi path prototyp specifi number hyperlink path refer page hyperlink instanc notion common path prototyp illustr figur initi form replac constant path uniqu variabl refin simpl foil search fail find accept procedur backtrack remov select path prototyp list candid common prototyp bia search initi class pair page relat learn target relat member initi tail liter research bia advantag domain knowledg present ontolog system differ algorithm foil foil measur guid dzeroski bratko error guid construct found evalu function algorithm learn gener method constrain learn path posit instanc found chang ad target relat learn algorithm updat count indic number instanc cover path prototyp foil inform gain measur evalu evalu approach learn relat rule data methodolog section learn target relat train instanc data test learn instanc fourth figur show learn instructor depart member project relat learn target concept show rule classifi instanc rule learn train statist repres aggreg test set rule learn instructor relat simplest target relat learn rule shown match case page hyperlink point person page rule shown member project relat interest describ member project instanc project home page point intermedi page point person home page hyperlink project page intermedi page word rule cover case member research project list subsidiari page home page project rule shown depart relat involv path link depart home page person home page rule requir word occur hyperlink path algorithm learn exploit fact depart page serv graduat student student home page point directori member depart predict relat calcul confid predict vari coverag learn rule set vari threshold confid valu calcul confid predict uncertainti predict page classif test learn confid measur predict relat instanc simpli product confid measur page classif factor relat predict confid figur show instructor link test neg depart link link link neighborhood word test neg member research link link neighborhood word test neg fig rule learn recogn relat instanc accuraci coverag fig tradeoff learn relat rule curv target relat accuraci level rule set fairli high member project rule accur coverag level instructor rule accur coverag level depart rule accur coverag level limit coverag level learn rule due primarili limit coverag page classifi note learn rule includ liter test predict page classif figur coverag exhibit page classifi class learn extract text field inform extract repres web page relat small fragment text page person home interest extract person type task commonli call inform extract section discuss approach learn rule inform extract task approach develop inform extract learn algorithm call srv rule srv learner spirit foil share foil approach gain design inform extract problem mind limit encompass search heurist specif inform extract problem input srv set label identifi instanc field set featur defin token output set inform extract rule extract process involv examin text fragment size match rule rule srv mean space step ad liter match posit exampl exclud larg number cover neg exampl rule deem good cover posit special judg posit exampl match remov train process repeat posit label text sequenc train neg unlabel token sequenc size posit train assess good liter neg exampl rule learner attempt express salient characterist posit exampl term individu token surround srv input set featur defin individu token featur simpl featur map token arbitrari discret typic relat featur map token token document simpl featur capit relat featur token return token immedi fragment sequenc token document step rule liter gener ffl constrain length integ liter mean jf jf number token ffl posit test token sequenc var path list relat feat simpl featur legal feat liter assert capit token bind token variabl distinct variabl rule bind distinct token match fragment logic liter current rule srv introduc variabl make implicit assert inequ true path empti exploit relat structur domain ffl constrain posit token bound current rule start integ liter assert token bound write ellipsi stand assert made rule ffl constrain rel posit order token bound variabl rule integ liter mean token immedi token srv exploit relat structur domain form relat structur relat token obviou successor connect adjac interest kind structur syntact structur path argument list relat featur posit relationship token bound variabl token reach relat featur test appli token liter token render logic true note liter ad rule implicitli refer fragment omit fragment variabl srv liter sake fig extract rule home page owner english render rule sequenc html titl field longer token unknown achiev correct match valid set learner path length path system make longer path comput facil entail control evalu previou repeatedli hold page belong test train remain data set present experi consist person page data set unit measur experi individu page srv confid predict page correspond instanc page owner make predict page behavior count correct count error bruce randal bruce randal associ fig html fragment rule figur match fragment bruce randal titl extract note erron predict miss person figur show learn rule applic test case figur show curv srv task criteria achiev accuraci page process full file owner accuraci coverag fig tradeoff srv extract predict file count error larg part learner error spuriou predict file page srv perform relat work bodi research relat task method discuss articl section briefli review main area relat work document classif work relat research document report recent text retriev confer wide varieti method appli task tfidf approach inform retriev basi rocchio classif algorithm standard baselin algorithm text classif approach involv describ class vector weight import word class learn includ memori base reason neural network linear discrimin analysi logist regress exponenti gradient algorithm line research text classif basic idea probabl inform theori rule start point number classif algorithm minimum descript length principl basi algorithm line research symbol learn method text classif numer studi algorithm ripper charad found studi algorithm competit method inform extract problem address relat tradit inform extract research messag understand commun work muc commun consid problem extract symbol descript terrorist attack construct case frame field kei differ work research report concern extract inform muc work ordinari flat text approach reli heavili machin learn method train extract earli work muc commun reli method extract inform problem method induc routin receiv attent autoslog machin learn system learn extract pattern collect document annot identifi fragment interest pattern review manual instal larger inform extract system remov requir document annot crystal rapier demonstr machin learn techniqu learn rule perform extract autonom crystal cover algorithm annot sentenc input produc rule extract sentenc rapier idea relat learn relax relianc syntact preprocess start maxim specif extract system learn drop constraint merg pattern contrast approach introduc research explor problem text extract web internet sourc ila system design learn semant output onlin compar inform shopbot bargain hunt design learn pattern html support extract price inform onlin catalog shopbot solut gener problem learn extract pattern highli regular sourc idea proven gener text shown work web page modif crystal sentenc fragment replac segment html whisk combin capabl crystal system learn extract pattern free text extract semant inform hypertext research group consid semant inform automat infer extract hypertext spertu present set heurist relat hypertext convent semant relationship consid relationship infer hyperlink file system html page structur mong elkan develop system find web page paper bibliograph citat part task perform system find person home page public page author start home page person institut mong elkan rule similar rule learn section rule keyword hyperlink decid follow search rule specif work consid problem learn rule arbitrari relat pirolli al task classifi page function categori index refer class featur file number incom outgo averag depth children page hyperlink work directli involv learn function class observ firstord learner page relat classif implicitli learn function categori learn rule recogn student page promin exploit class person index page featur differ pirolli common approach central import text similar hyperlink connect extract knowledg base web group work extract proposit inform web luke al extens html call shoe web page author encod ontolog inform page develop extract inform web store local knowledg base hope librari standard ontolog common enabl agent learn inform encod web start inform server natur languag interfac knowledg base collect web knowledg base metainform content queri start return relev hypertext segment start build knowledg base discov manual ad natur languag annot web page recent develop area advent extens markup languag html design describ layout inform xml describ inform content page web page author xml encod ontolog inform page xml world wide web consortium wide method annot content web shoe assist task extract knowledg base obviat approach notabl limit approach shoe xml web page author emploi ontolog individu web page author annot web success approach hing extent author emploi share ontolog consist manner ontolog larg hand web page author approach case ontolog categori describ web page relev categori task extract knowledg base appli ontolog made user system interest xml approach potenti exploit page train data learn predict xml annot element page input featur plan explor issu futur research web agent system web agent extract inform web agent develop past includ involv form learn vast major system learn improv abil retriev text extract inform joachim al describ web agent call webwatch serv tour guid user web webwatch learn suggest hyperlink user base hyperlink previou user similar interest involv learn classifi hyperlink task similar work report learn extract relat inform system similar goal letizia learn interest singl contrast webwatch learn commun user syskil webert offer restrict webwatch letizia start manual construct index page user rate hyperlink page system rate learn user specif topic profil suggest unexplor hyperlink page syskil webert search engin lyco retriev page turn topic profil queri work set gener model user interest learn user rate page model web offlin return set page match user interest relat system closer spirit work shake al ahoi attempt locat home page inform person organiz affili ahoi knowledg home page placement convent search person home fact learn convent experi futur work began articl goal thesi goal automat creat larg knowledg base content mirror world wide thesi automat creat knowledg base web machin learn algorithm creat inform extract method desir type appli method extract symbol statement directli web hypertext articl support thesi test varieti machin learn algorithm inform describ system incorpor learn inform extractor web site popul knowledg base shown section system achiev accuraci coverag level approxim learn inform extractor popul knowledg base web site result provid encourag initi support suggest rout futur research explor varieti learn method includ statist rule learn method found statist bag word deriv document classif method inform work classifi individu web page method advantag special hypertext structur web develop learn algorithm learn classifi page learn recogn relat page method capabl describ pattern occur multipl web specif word page hyperlink experi method tend higher accuraci bag word frequent provid lower coverag addit learn method page develop method detail structur hypertext specif text fragment singl web page srv algorithm section learn relat rule extract specif type text field web person toolbox method applic wide rang problem domain appli combin method wai explor articl current work problem page classifi recogn instanc relat econom sector work page classifi recogn class instanc method recogn instanc class relat depend instanc tend repres web base initi result report optimist futur prospect automat construct maintain symbol knowledg base interpret hypertext web kei question level accuraci achiev learn procedur extract inform level accuraci requir task requir accuraci high intellig system automat invest monei behalf task inform retriev system suffici accur outperform current retriev system real notion ontolog research stronger learn method conjectur steadi stream applic approxim correct knowledg base outperform current keyword retriev method type question system effort requir train system extens grow experi report system train thousand web page collect cost approxim effort newer work begin explor method reduc depend hand label data list research opportun merit ffl develop learn method exploit hierarch relationship exist class hierarchi recent work shown accuraci bayesian bag word classifi improv class hierarchi obtain accur estim class condit word probabl ffl vast pool unlabel web page supplement data improv learn accuraci recent shown em algorithm combin label unlabel data boost accuraci explor combin em train activ learn learner request label specif web page label ffl multipl classifi problem set web page classifi examin word classifi examin word incom hyperlink page recent method classifi act trainer provid initi experi theoret analysi show approach ffl exploit linguist structur plan explor wai preposit phrase extract text featur inform extract conduct preliminari experi show improv accuraci case bag word augment extract phrase conjectur linguist featur task classifi individu hyperlink ffl explor multipl strategi learn extract text field web page develop number approach task includ learn ffl integr statist method learn task begun develop method augment learn abil classifi invent predic page hyperlink referenc learn rule ffl exploit html structur plan investig util repres html structur page learn rule relat classif inform extract investig approach repres html structur exploit learn task ffl learn regular grow knowledg base plan learn method discov interest regular fact extract learn fact improv futur fact extract knowledg base expect learn predict depart faculti member base depart student ffl extend ontolog problem domain appli method task extract inform compani web assumpt class relat instanc repres appendix provid formal treatment assumpt make class relat instanc repres web web page sequenc token word html tag defin function return page sequenc token resid token repres hyperlink predic true ith token page function return page point hyperlink defin relat repres case direct hyperlink path direct edg true defin relat repres case path undirect edg true true defin segment hypertext segment consist subsequ token segment consist page segment consist root subgraph repres root subgraph defin relat hold page sequenc token page sequenc token root root ae predic model true segment satisfi arbitrari statist model repres state assumpt class relat instanc repres web ffl assum instanc ontolog class repres hypertext segment defin ffl assum instanc relat repres wai segment repres segment repres repres model true obtain evenli distribut score naiv naiv accur present problem interpret score class estim uncertainti score win class tend gravit score lose class tend effect strong error probabl calcul win class extrem valu artifact independ assumpt class differ order final probabl differ order magnitud word document word probabl similar class word depend account score accur reflect uncertainti predict enabl sensibl compar score multipl document attempt counter extrem avoid complex model step product word geometr likelihood approach close relat concept perplex languag model speech recognit perplex measur likelihood data likelihood normal length data begin naiv rewrit sum express sum word vocabulari word document divid number word document result log geometr word term class prior interpret term express neg cross entropi distribut word induc document distribut word induc term specifi class highest score lowest cross class document effici express result score class vari tendenc extrem valu cross entropi equat intuit understood averag number bit encod word document encod optim distribut word independ drawn class cross entropi account vari difficulti encod document inher requir bit averag encod score sensibl compar document account differ document subtract averag number bit encod document optim encod word independ result express intuit understood averag number extra bit requir suboptim encod optim encod modifi term equat express kl diverg score log normal score class sum constant normal effect confid classif document high word entropi intuit desir document uniqu consid stronger result correct classif note modif chang order class estim document classif made naiv affect modif serv provid compar score note straightforward naiv equat chang score order class chang classif result naiv serv provid compar score url group algorithm present detail algorithm identifi segment discuss section regular url structur group relat page identifi primari home page group algorithm wildcard match text wildcard match directori wildcard wildcard match singl digit wildcard variabl match directori ffl set web tent classif score ffl web identifi ffl group longest prefix url match ffl prefix group complet directori portion url ffl identifi primari ffl primari page page url ffl page group match page highest score class primari page ffl chang classif page ffl final classif score web page refer fourth messag understand confer june morgan kaufmann san francisco messag understand confer august morgan kaufmann san francisco fourth text retriev nation technic inform text retriev nation technic inform weiss autom learn rule text categor acm transact inform juli weiss languag independ autom learn text categor model technic balabanov shoham learn inform retriev experi autom web aaai spring symposium inform gather distribut macmillan machin learn user issu thirteenth nation confer artifici page blum mitchel combin label unlabel data cotrain annual confer comput learn theori extens markup languag technic report world wide web califf moonei relat learn rule inform extract work paper workshop natur languag cestnik estim crucial task machin learn ninth european confer artifici intellig page pitman cohen fast effect rule induct twelfth intern confer machin learn morgan cover thoma element inform theori john wilei de tm improv learn accuraci inform filter intern confer machin learn workshop machin learn meet hci dipasquo html format aid natur languag process world wide june senior comput scienc carnegi mellon domingo pazzani optim simpl bayesian classifi loss machin weld scalabl agent web intern confer autonom agent dzeroski bratko handl induct logic program sh muggleton intern workshop induct logic program number technic page institut gener comput technolog freitag grammat infer improv inform extract workshop autom grammat languag morgan kaufmann freitag inform extract applic gener learn approach fifteenth nation confer artifici aaai press freitag multistrategi learn inform extract intern confer machin page morgan freitag learn inform extract jerom friedman data mine knowledg riloff case studi linguist phrase text categor www work note workshop learn text hsu dung wrap semistructur web page transduc confer automat learn discoveri joachim probabilist analysi rocchio algorithm tfidf text categor fourteenth intern confer machin page morgan kaufmann mitchel tour guid world wide web fifteenth intern joint confer artifici page morgan kaufmann katz sentenc process inform access world wide web aaai spring symposium natur languag process world wide kim moldovan acquisit linguist pattern inform extract ieee transact knowledg data koller sahami optim featur select thirteenth intern confer machin learn morgan koller sahami hierarch classifi document word fourteenth intern confer machin page morgan kaufmann kushmerick wrapper induct inform extract phd tech report lang learn filter netnew twelfth intern confer machin learn morgan lewi gale sequenti algorithm train text classifi seventeenth annual intern acm sigir confer research develop retriev papka train algorithm linear text classifi nineteenth annual intern acm sigir confer research develop inform page lewi ringuett comparison learn algorithm text categor annual symposium document analysi inform page lieberman agent assist web fourteenth intern joint confer artifici page morgan hendler web agent intern confer autonom page waltz classifi stori memori base reason fifteenth annual intern acm sigir confer research develop inform retriev page mccallum nigam emploi em activ learn text classif intern confer machin page morgan ng improv text shrinkag hierarchi class intern confer machin page morgan mccallum nigam comparison event model naiv text classif work note workshop learn text mong elkan tool find scientif paper worldwid web intern congress comput scienc moulini ganascia appli exist machin learn algorithm text categor symbol approach learn natur languag process march ganascia text symbol approach ion steve craig knoblock wrapper induct inform sourc confer automat learn discoveri mitchel text classif label unlabel document em machin billsu syskil identifi interest web site thirteenth nation confer artifici page press perkowitz etzioni categori learn understand inform internet intern joint confer artifici page morgan rao silk sow extract usabl structur web human factor comput chi confer page quinlan learn logic definit relat machin quinlan midterm report european confer machin page rabin juang fundament speech recognit prentic hall signal process richard moonei learn relat pathfind tenth nation confer artifici page san press riloff automat gener extract pattern untag text thirteenth nation confer artifici page riloff empir studi autom dictionari construct inform extract domain pedersen comparison classifi document rout problem annual intern acm sigir confer research develop inform retriev page langheinrich etzioni dynam refer case studi homepag domain sixth intern world wide web santa slatteri craven combin statist relat method learn hypertext domain intern confer induct logic program springer soderland learn text analysi rule natur languag process phd depart comput scienc technic report soderland learn extract inform world wide web intern confer knowledg discoveri data stephen soderland learn inform extract rule free text machin februari spertu mine structur inform web sixth intern world wide web santa weiss optim rule induct ieee page decemb witten bell estim probabl event adapt text compress ieee transact inform juli yang pederson featur select statist learn text categor fourteenth intern confer machin page morgan kaufmann
ML/817 6 grade learn object detect donald geman februari domain de le chesnai support part cnet depart mathemat ma support part onr contract aro muri grant abstract goal detect instanc gener object greyscal scene design algorithm motiv comput effici search explor pose object class start train learn hierarchi spatial arrang edg grade size arrang priori semant geometr interpret select split correl probabl arrang size object instanc decai slowli demonstr theoret experi detect mean find suffici number arrang size introduct start train set exampl gener object class goal construct algorithm detect local instanc class greyscal scene exampl subimag singl instanc object frontal view face rang train sampl detect algorithm function highli clutter scene measur perform alarm rate size train set achiev small neg rate work belong ongo broader project visual recognit question problem effici code design featur search strategi time highli manner densiti object explor space pose paradigm analyz context tree uncertainti reduct approach learn tree final algorithm express code tree binari base comparison intens differ learn hierarchi increasingli complex featur order declar success check minim number complex featur binari imag function presenc absenc spatial arrang edg fragment fragment approxim locat approxim definit order accommod geometr invari arrang priori semant geometr interpret simpli object class specif render rare gener background introduc notion algorithm discov larg number train exampl main contribut paper mean arrang divid highli correl split highli correl smaller individu edg fragment learn algorithm procedur build larger larger arrang fashion motiv probabl arrang size object instanc gradual insur featur highli discrimin separ object background statement justifi theoret illustr empir order idea statist learn framework appli learn algorithm train exampl subset pose pose face mean shape locat triangl form ey mouth routin repeatedli appli seri success constrain learn set order detect face wide rang detail experi end process pose space search success denser arrang predecessor demonstr train singl refer pose relax geometr constraint accommod gener hough transform minim comput experi synthet detect world line challeng wing local indistinguish experi real detect frontal view face olivetti train set pictur individu small train suffici estim train requir minut pc estim larg system coupl paramet statist learn method invari properti larg learn invari object detect problem detect instanc gener object class inform due depth motion wide studi comput vision literatur case varieti method includ artifici neural network support vector machin bayesian infer deform templat precursor methodolog cite princip difficulti variat face due discuss approach build larg invari definit edg fragment comparison intens section approach geometr invari explicit arrang conjunct elementari disjunct edg compar number arrang present threshold detect final base massiv disjunct conjunct highli local edg liter treatment geometr invari sharp contrast complet discuss statist framework denot set refer grid quantiz standard grei level subimag divid categori object pictur singl instanc object class refer mean object roughli center subimag scale object roughli grid background pictur stand class background denot probabl measur empir measur subimag imag larg induc condit distribut background class distribut object class classifi neg error rate posit error rate seek minim subject part motiv classifi defin section train set assum random sampl neg exampl sampl estim alarm rate construct classifi import constraint size suffici larg reliabl estim number paramet order train set genuin random sampl synthet rare case real problem approach induct model reli empir measur induc defin classifi directli train amount estim probabl distribut event probabl determin compon classifi deriv rel frequenc possibl estim maximum likelihood background distribut extrem difficult model comput maximum likelihood estim feasibl simpl case hierarchi featur seek hierarchi rang primit complex statist popul increasingli dispar comput effici achiev progress check complex attribut order separ instanc clutter instanc object subimag immedi dismiss object candid base primit edg global requir examin involv correl depend elementari test featur conjunct elementari test elementari test local disjunct local filter experi local filter detect edg filter effect edg filter appli locat orient polar horizont edg posit polar locat mean vertic max number neighbor pixel figur show train face detect edg fragment elementari test edg test edg present small neighborhood size neighborhood depend subset pose space defin learn chosen make probabl elementari test order arrang refer subset ae dg random variabl xa simpli spatial conjunct elementari xa ae set pixel definit order limit famili arrang assum write jaj size pool classifi construct subset find arrang statist xa estim attempt obtain desir dispar construct arrang larg size render rare construct base correl denot correl coeffici random variabl respect binari variabl arrang size filter pair requir ae threshold ae yield pair elementari test tend occur object good candid discrimin arrang size ae continu singl arrang size combin pair requir ae defin decomposit nest set binari partit success binari individu element dg assum partit cell split evenli size split child cell size differ size odd call correl inequ hold split figur show decomposit ae ae arrang random variabl xa call decomposit arrang elementari featur exist arrang ffl ffl ffl xc ae likelihood bound gener depend jaj reason assumpt type exponenti figur arrang broken conjunct posit correl smaller arrang observ empir arrang expect slower rate show rate ae log valu ae likelihood ratio model give lower bound denot set jaj ae min ae log sketch min write shown induct argument ae impli concav function log flavor induct true case binari varianc cg bg bg fag fbg ae ae ae ae inequ due hold impli model classifi detect view sequenc hypothesi test complex rel null hypothesi test appli simpler reject null overwhelm major subimag examin fact result highli process subimag investig detail fix ae hypothesi test base number size present pictur xa largest size object class experi arrang size cover arrang size threshold fc classifi object classifi ae fz zk figur detector sequenc filter threshold defin maximum valu yield ae implement ae seri depict figur natur choic ae minim posit ae arg min ae ae perform systemat explor ae assum ae fix experi ae learn practic construct ae dont set requir great experi base approxim hope estim attempt find fix number size goal learn estim ae size learn task estim threshold definit arrang estim procedur correl estim empir measur deriv construct build famili fx famili fx order construct case set arrang ffl ffl ffl select subset size ja ja put randomli sampl arrang present train cover number chosen arrang random sampl attempt maxim quantiti min xa process initi common elementari termin longer cover object exampl arrang size natur estim threshold max xa fact sever case yield fundament constraint formul figur scene experi wing experi design problem background structur resembl target evalu detector learn algorithm control statist set mean random sampl error rate includ maximum estim high scene binari jag figur line realiz random transit probabl orient segment northwest scene gener randomli set locat integ randomli nw locat gener random walk length start nw walk proce nw figur consist random line equal length start common pixel probabl ne case direct ne locat vertex randomli select wing consist diagon nw start pixel constrain symmetri condit illustr figur detect problem difficult object instanc distinguish configur instanc clutter wing background insepar base sole local correl account complet wing black pixel orient nw ne give ampl evid line segment mean obviou learn algorithm symmetri constraint accommod larg variat wing instanc train test gener larg scene randomli extract subimag center wing jlj optim error rate obtain model geometri check diagon line correct length verifi symmetri constraint endpoint describ maximum likelihood classifi ml figur wing subimag train set background subimag wing subimag background subimag wing error posit elementari test individu black white black pixel diagon adjac elementari test locat grid orient orient edg type neighborhood test make classifi stabl respect small perturb wing exploit symmetri properti arrang estim accumul wing captur shape small locat confin larger longer rang depend exploit pixel line probabl distribut random variabl shape cumul distribut function similar shown figur combin error rate achiev ff fi higher implement constraint ff separ popul difficult work metric experi face pose triangl vertic posit ey mouth goal detect frontal view triangl point basic scale distanc elong search face scale simultan assum face minim refer scale find larger algorithm downsampl scene triangl partit learn problem algorithm train set group pose locat fall window train set heterogen orient elong mix locat approxim step process scene evalu result classifi subimag window pixel window retain face locat alarm arrang cover train ensembl posit rate mean half scene finish elementari involv arrang size edg divid scale lead learn problem arrang learn small train set homogen discrimin arrang found continu steadili restrict amount variat triangl eventu constrain locat window pin paramet limit process global deform templat involv onlin optim order refin nonlinear aspect pose face recognit train set illustr learn fix shape triangl locat restrict locat train set construct olivetti ten frontal pose forti individu pictur mark locat ey variat scale elong triangl orient pictur train rest estim neg rate recal direct input classifi featur vector elementari test fx origin grei level correspond orient edg section train imag comput edg arrai boolean featur pixel horizont vertic polar edg arrai transform affin map carri origin triangl refer ey mouth fix locat figur show greyscal pictur train set origin transform edg map train regist edg elementari test local disjunct map learn arrang shown figur arrang learn size size orient polar particip edg figur face train imag extract edg regist edg map small squar refer pose small strip lefthand arrang captur inform face righthand reflect typic correl edg ey mouth lefthand arrang split size side divid singl edg pair edg arrang thousand made turn arrang edg mouth forehead outlin illustr figur dark pixel proport number time edg support involv pixel learn arrang measur discrimin power arrang illustr figur vertic axi probabl horizont axi arrang size curv theoret lower bound elementari test approxim min ae section curv log randomli sampl ten arrang comput probabl event actual likelihood face lie bound figur exampl arrang size face figur area face dark high usag incid face incid face theoret bound figur likelihood sampl learn arrang size face face curv theoret lower bound face figur depict cumul distribut estim modest size extrem rare face background subimag separ correl estim estim respect higher level ae experi recal construct ae ae addit data test check decomposit correl determin ae max maxim ae decomposit smaller larger ae shown figur conserv check ae ae lead larger level shift curv figur face pictur background pictur face pictur background pictur figur distribut function face decomposit arrang valid ae ae target ae estim error rate error rate difficult analyz full scene paper framework statist learn simpli classifi remain face origin regist fashion train random sampl subimag extract scene www realist estim report base search face larg posit rate express number alarm due conserv placement threshold neg rate posit error function featur fi figur import properti sharp final meaningless step process restrict locat rate drop percent figur proport learn decomposit level ae posit error figur posit error function size arrang formul object detect learn problem constrain invari effici basic assumpt ultim detect object discov featur context statist appeal gener theori induct instanc structur risk minim theoret result neural network classifi gener net learn highli dedic vision problem captur spatial depend structur estim correl conjunct local featur estim paramet explicit make train fast directli address natur constraint invari geometr low neg error limit amount train data concentr pattern object place frontal view face remain methodolog extend handl freedom imag object simultan detect object class difficult kei question size combin featur set scale set arrang size dedic object logarithm result repres object arrang limit demonstr object gener class constrain pose rapidli detect error natur visual select human occur hundr virtual perfect refer amit deform templat method object detect icip amit geman shape quantiz recognit random tree neural amit geman comput model visual select neural baum haussler size net valid neural coot taylor locat face statist featur detector intern confer automat face gestur page ieee comput societi probabilist method pattern recognit geman face detect technic prepar geman activ test model track road satellit imag ieee tran object recognit geometr queri proc perona find face clutter scene label random graph match int conf comp page girosi train support vector applic face detect page ieee comput societi neural face detect ieee tran sung poggio learn face detect ieee tran ullman vision mit vapnik natur statist learn wilder tree algorithm handwritten digit recognit phd featur extract face deform templat inter comp
DB/818 3 updat cube queri inform commun engin comput scienc korea advanc institut scienc technolog abstract queri popular import find trend discov relationship attribut applic sum select cell olap data cube target cell decid queri rang direct method access data cube forc cell incur sever overhead time crucial olap applic interact user recent dynam data element cube frequent chang time affect environ updat cost search cost cube effici algorithm reduc updat cost significantli maintain reason search index structur call hybrid method provid approxim result reduc cost queri applic quick approxim answer accur support system introduct analyt process categori technolog analyst work support korea research foundat grant permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb gain insight aggreg data access varieti view inform summar data level detail combin attribut typic olap applic includ product perform effect sale program market sale capac plan olap applic data model data increasingli import data cube construct subset attribut attribut chosen measur attribut valu interest attribut select dimens function attribut measur attribut aggreg dimens data cube maintain compani assum data cube dimens measur attribut domain year region color data cube cell measur attribut combin function color data cube analysi tool data call queri appli aggreg oper measur attribut rang queri typic includ total amount sale seoul model red color queri form popular import olap natur time crucial olap applic direct method process queri access data cube suffer fact cell access number cell access proport size defin queri enhanc search prefix sum approach addit cube call prefix sum cube store cumul sum data method reduc search cost current environ forc data element cube dynam chang time affect updat cost search cost cube excel studi made reduc updat cost method addit data structur rel prefix sum cube minim updat propag prefix sum cube approach limit context updat propag problem reduc rpc slight transform pc updat accomplish search effici olap import issu improv updat perform minim search effici effici algorithm make drastic cut updat propag index structur call index structur modifi version store updat valu data cube support effici queri process algorithm advantag tradit prefix sum approach gain search effici reduct updat cost current applic support number step involv answer forc queri execut sever queri cost import provid facil quick approxim result accur support make process time hybrid method provid approxim result order reduc cost queri collect inform make relat work introduc briefli previou approach address queri olap data cube el present eleg algorithm comput rang queri data cube call prefix sum approach essenti idea prefix sum approach precomput prefix sum data answer ad hoc queri approach turn power queri process constant time size data cube maintain prefix sum cube data element cube frequent chang reduc updat propag prefix sum el present algorithm comput rang queri data cube call rel prefix sum approach balanc tradeoff direct method prefix sum approach approach impract data cube high dimens high capac updat cost exponenti chan ioannidi class cube call hierarch base orthogon dimens shown cube design call hierarch band cube significantli queri updat algorithm index map cube lowlevel cube complic implement verifi analyt result method el dynam data cube design prefix sum cube assum dimens data cube constitut tree structur decomposit techniqu data cube practic compani previou dimens size size dimens dimens size make difficult balanc tree prefix sum cube data cube high dimens high difficult appli approach tree approach incur high comput overhead contribut present techniqu call dynam updat cube exploit index contribut summar effici algorithm advantag prefix sum approach reduc updat cost significantli present comparison updat complex method updat complex algorithm respect number chang cell data cube provid analysi size data cube evalu show method perform effici compar method hybrid method provid approxim result respect olap method reduc approxim error approach work specif address hybrid method approxim accur answer time demand extens experi approxim method demonstr remark speedup queri process preserv accuraci remaind paper organ preliminari inform prefix sum approach section section detail descript work hybrid method approxim result section result respect perform evalu algorithm present section give section preliminari introduc background inform prefix sum cube close relat method prefix sum prefix sum cube pc size data cube store precomput prefix sum cell pc sum cell includ data cube figur show data cube prefix sum cube cell sum cell rang sum entir cube found cell denot set dimens ni denot number cell dimens el present simpl method addit cell store precomput comput comput base precomput prefix sum xd id figur show prefix sum approach power queri constant size data cube lemma comput element pc left hand side equat specifi side equat consist addit element pc sign determin product notat xj index index prefix sum cube pc figur origin data cube prefix sum cube pc lemma pc obtain illustr figur deriv figur geometr explan comput case figur geometr illustr case work data cube motiv advanc internet technolog world wide applic includ olap server time locat user wide spread geograph great number user larg scale olap server concurr perform ment issu support queri process dynam data updat time previou method base prefix sum queri user block rang queri includ singl cell chang due updat process queri produc incorrect answer updat oper queri block clear block degrad perform olap server updat cost high olap server wide system support make process number user issu larg number queri relat concern reach queri requir incur high cost execut great load olap server queri approxim make user inexact answer hybrid method approxim answer process exact answer queri interest previou method base prefix sum cube provid kind hybrid method idea dynam olap cell data cube frequent chang problem cost updat prefix sum cube high basic idea store manag chang cell virtual call updat updat prefix sum cube directli queri prefix sum cube dynam updat cube manipul simultan data prefix sum cube dynam updat cube involv chang cell data cube shown figur prefix sum store cumul sum data cube cell data cube chang cell differ valu chang dynam updat cube store data cube chang cell prefix sum cube dynam updat cube figur basic concept dynam updat cube posit dynam updat cube cell repres point cell store index call cell spatial close cluster minimum bound search mbr prune effici detail explain section posit valu dynam updat cube cell store idea paper summar prefix sum cube dynam updat cube data cube updat directli prefix sum cube store data cube manag reduc updat cost resolv problem propag updat prefix sum approach process approxim answer search partial search perform root intern node level leaf node detail calcul approxim answer explain section size cell data cube chang cost search updat high inform store reflect prefix sum depend threshold root figur structur introduc structur shown figur construct process initi directori root data cube cell valu data cube cell spatial posit store defin formal definit directori node li tupl child node ci form sum ci ci directori address ci mbr entri ci form µ dimens posit dimens defin mf µ updat posit nj number partit dimens data node level di tupl data entri form pi posit index differ chang cell object provid fast approxim answer queri object improv approxim techniqu section queri prefix sum cube pc order answer queri mention pc includ inform recent bulk updat includ inform updat updat cell spatial close cluster mbr index data cube dynam updat cube figur queri data cube dynam updat cube figur cell mark symbol data cube updat data cube figur figur mbr lowest level dynam updat cube cell reflect pc queri hd pc obtain answer function return answer function return answer calcul function return answer found answer figur queri obtain answer pc select ax ay answer equat function obtain lemma definit mbr queri mbr node relationship formal defin disjoint iff φ iff intersect iff φ note defin intersect find result function root node entri root node evalu respect spatial relationship definit algorithm function shown algorithm queri answer visit node depth order start root node node return answer entri node evalu case relationship definit case prune strategi case entri relat irrelev queri prune case entri relat ad answer entri exact answer respect entri case choic approxim evalu child mbr includ approxim comput approxim entri relat add answer detail descript approxim answer discuss section algorithm call replac entri shown figur queri find answer function complet function disjoint intersect intersect figur dynam updat cube updat cell data cube affect prefix sum cube directli chang locat updat cell affect updat request form posit index differ chang cell step updat identifi updat made target updat identifi target data node reflect updat request final chosen target data node method check data entri posit exist node case case posit updat made data entri exist ad ancestor data node ancestor node data node process repeat root node case posit posit data entri insert end node ancestor data node case overflow occur node insert process number data entri exce threshold node split node adopt split strategi detail algorithm refer assum node split recalcul parent adjust parent reflect ancestor node root node root directori node data node figur detail structur figur updat process cell figur chang process correspond updat request shown figur entri select root node entri chosen intermedi node data entri posit found node point entri ad result chang data ancestor node chang time complex dynam updat cube dynam updat cube effici compar previou method time complex method updat singl cell nu number chang cell usual number chang cell small compar total size data cube complex correspond complex descend singl path tree tabl show comparison complex method assum number cell dimens clear method outperform method size dynam updat cube small origin data cube nu tabl time complex method method updat time prefix rel prefix dynam data dynam updat cube comparison time complex shown tabl tabl show number comparison updat cost method size tabl dimens total size data cube assum base log complex method base log dynam data cube gener nu method evalu nu observ result tabl method outperform method tabl number comparison updat cost method dynam updat cube rel dynam sum ps data cube previou method base prefix sum cube queri cost order improv updat cost method effici updat perform requir process previou method method incur addit overhead compar prefix sum approach experi section demonstr queri process method effici hybrid method real olap environ user typic search unusu data behavior issu queri interact user satisfi approxim answer queri time greatli reduc hybrid method provid approxim result reduc cost queri highli benefici applic quick approxim answer time consum accur support system provid techniqu illustr reduc error approxim techniqu addit cost approxim techniqu process obtain approxim answer search partial search perform root intern node level leaf node exist mbr particip answer queri classifi mbr group number mbr intersect number intersect mbr shown figur level mbr mbr mbr mbr mbr intersect mbr mbr mbr queri mbr mbr level figur shape queri mbr mbr level intersect mbr answer queri level approxim vol mbr mbr vol mbr improv approxim techniqu list posit definit improv approxim techniqu resiz area rang queri accur approxim calcul differ approxim resiz resiz find node search illustr shown figur overlap region calcul region resiz accur approxim vertic side node half valu find α valu uniformli valu posit µ α µ α µ µ resiz µ µ resiz similarli calcul calcul differ µ approxim resiz resiz find node search lower level select node differ valu bigger search intersect node level error reduc addit overhead search level node level big differ node figur resiz queri queri evalu present environ perform evalu method method paper prefix sum cube updat made updat reflect prefix sum cube period evalu updat perform updat queri consid prefix sum cube queri process evalu accuraci approxim result access prefix sum cube implement modifi accommod node size adjust reason depth evalu approxim result hybrid method test data set gener type uniform zipf distribut paramet zipf distribut determin constant dimens test data cardin dimens number data element insert type queri base queri size queri volum data cube experi sun ultra ii workstat main memori hard disk error rate result percentag error result obtain issu queri updat evalu queri updat process averag result figur show effici queri queri small size figur illustr result queri execut queri respect result obtain visit node root level data result exact effici queri measur execut time result show execut time figur exact queri uniform queri size figur exact queri perform uniform medium size queri figur show perform number page access insert chang cell insert data element repres number data element repres number page access insert singl tree correspond depth tree observ number page access nu number chang cell figur insert perform figur perform error rate uniform queri number data figur show error rate approxim queri result hybrid method paramet uniform data updat store repres approxim level approxim queri perform level data node leaf parent level approxim level queri evalu data approxim level queri evalu level approxim level queri evalu level node level level node level approxim level queri evalu level node level level node level node differ approxim valu section search lower level shown figur evalu time reduc rapidli approxim level error rate slightli obtain high perform reason error rate select approxim level figur show case data compar figur case error rate data store queri perform figur show result uniformli distribut data number data queri size vari figur show result zipf distribut data number data vari shown figur approxim level observ good point hybrid method figur perform error rate uniform queri size number data figur perform error rate uniform queri size number data figur perform error rate zipf queri size number data techniqu call dynam updat cube design reduc updat cost data cube maintain reason search effici recent dynam environ data element data cube frequent time affect updat cost search cost cube exploit hierarch data call store inform updat cell data cube minim updat cost small fraction data element data cube chang advantag hierarch tree structur dynam updat hybrid method provid approxim result reduc cost queri applic quick approxim answer accur support system updat complex method respect number chang cell data cube provid evalu queri updat effici approxim accuraci respect dimens queri size result demonstr method perform effici updat queri show reason approxim error rate gain speed hybrid method futur plan investig techniqu reduc approxim error hybrid develop index mechan data cube refer index structur high confer larg data pp effici robust access method point acm sigmod confer manag pp alex stephen data data hierarch cube confer larg data pp provid analyt technic codd el dynam data confer extend el rel prefix effici approach dynam olap data confer data pp dynam index structur spatial acm sigmod confer manag pp rang queri olap data acm sigmod confer manag pp rang queri dynam olap data data knowledg engin pp dynam index confer larg data pp
ML/819 6 fuzzi argument extend logic program michael schroeder ralf depart citi london uk juli abstract de ne fuzzi version extend logic program semant explicit negat develop fuzzi xpoint argument semant proof procedur show procedur sound complet respect argument semant introduct attent argument develop philosophi comput set legal reason negoti agent semant logic program broader context knowledg system base relat wagner structur extens relat ax figur deduct cater negat captur explicitli fuzzi model vagu deduct standard queri languag relat lack concept transit closur relat express sql relat architectur fdb rdb deduct fuzzi negat figur cube ax deduct negat fuzzi complet program languag top sql deduct achiev elegantli ad relat rule cater neg inform relat principl fact assum desir state neg fact explicitli explicit neg call consist posit neg inform modi cation rise concept absent relat und ned fact posit neg consid und ned inconsist fact posit neg inconsist interest method regain consist drop posit neg assumpt coher principl relat explicit negat negat fact explicitli default fuzzi inform de ned simpli true fuzzi logic deal kind inform import case unclear uncertain inform concept truth true probabilist evid true weather forecast make statement chanc rain statement rain tomorrow true todai evid truth statement fuzzi concept inher adult consid extens relat orthogon ad relat arriv system cube figur relat deduct relat infer engin prolog relat posit neg inform fuzzi relat fact assign truth deduct infer engin logic program explicit stabl model fuzzi fact assign truth fuzzi deduct fuzzi infer engin assum part fuzzi fuzzi deduct fuzzi rule infer engin combin examin aim articl provid framework top corner cube figur declar xpoint argument semant proof procedur lot work deduct negat concentr extend deduct fuzzi argument semant semant wf extend reach node cube extens explicit proof procedur basi show extend captur fuzzi develop fuzzi argument semant proof procedur base show sound complet extend logic program fuzzi logic de ne logic program languag suitabl implement fuzzi deduct outlin kind explicit negat falsiti fact implicit negat deriv inform assumpt falsiti fact uncertain inform speci ed assign fuzzi truth fact accord rule fuzzi truth de nition object liter atom implicit negat de ne default liter form object liter liter object default liter fuzzi extend logic program set rule form lm object liter object rule form call fuzzi analog ordinari call consequ rule extend semant extend logic program fuzzi pleasant properti share semant semant exist ecient proof procedur de ning semant fuzzi extend logic brie properti logic discuss properti carri fuzzi set fuzzi negat fuzzi version extend logic liter assign truth valu interv simpli true de ne conjunct standard fuzzi de nition minimum main problem suitabl fuzzi semant kind negat standard de nition fuzzi negat zadeh impli posit neg inform independ argu evid make de ne truth explicit negat truth posit inform neg inform connect explicit negat indirect coher relat explicit implicit negat impli coher principl coher principl state evid assum default hold ect proof wai succe fuzzi formula truth valu wai state coher depend understood statement truth greater coher principl gener state impli version coher principl provid de nition truth implicit negat truth explicit negat extrem case de nition compli fuzzi coher principl impli version state implicit negat extrem case explicit long explicit evid de nite hold default impli version state weak connect explicit implicit explicit evid hold evid law negat classic gener boolean law exclud contradict law exclud middl true logic interest extent law hold lem hold explicit liter lem implicit und law exclud expect hold extend logic program contradictori program fa impli consequ program coher principl impli law exclud contradict hold implicit negat hold contradict oper view implicit semant coher principl sati es law exclud contradict state success deriv state proven true proven contradictori program law exclud contradict trivial hold program semant view contradictori program dismiss wai remov inconsist move fuzzi rule contradictori program expect law contradict exclud middl hold hold implicit negat law exclud middl hold implicit fuzzi argument de nition argument base de nition fuzzi extend logic program argument nite sequenc ground instanc rule object liter consequ consequ distinct rule sequenc consequ subsequ argument rule call partial argument de nition strength rule argument de ned induct ln rule strength argument de ned fundament attack attack attack argument de nition undercut argument argument assumpt lm argument argument attack undercut undercut stronger contradict symmetr undercut invalid argument attack undercut symmetr de nition argument coher attack core argument framework accept de argument accept wrt set argument arg undercut defeat arg de nition defeat empti attack undercut accept wrt set arg argument argument undercut defeat argument arg coher principl sati ed order argument sucient undercut program fp argument accept wrt undercut de ne semant program iter accumul accept argument de nition extend logic program subset argument fp fa accept wrt sg justi ed xpoint fp overrul attack justi ed argument justi ed overrul note de nition defeat accept slightli di erent dung discuss brie semant declar de nition argument process xpoint semant comput ineci interest justi ed section present ecient proof procedur comput justi ed argument proof procedur fuzzi argument main reason chose base fuzzi approach de ne proof case compet stabl model main problem de ning proof procedur neg loop program fp pg fp pg classic logic obtain model fg fpg expect conclud case lead infer due nite loop prove prolog appli rule similar reason stop termin prolog problem occur gener due posit neg loop deal problem de ne prove veriti de nition fuzzi ground fuzzi extend logic true unari predic program obtain replac rule form rule form fuzzi liter root label node label liter fuzzi construct start root success expand node node label object liter rule leaf select rule lm ln fuzzi successor node label lm ln fuzzi successor node label node label default liter leav de nition success fail tree fuzzi success truth fail nite tree fail tree success truth root success truth node mark leaf label success truth leaf label object liter distinct fail leaf label default liter success truth fuzzi fuzzi success fuzzi label fail intermedi node fuzzi success truth children success truth valu vm vm fail remain node label fail fuzzi success truth fuzzi oper fp element xpoint gener comput nite number step class fp justi ed argument comput nite number step proof procedur deriv success fuzzi comput justi ed argument proof procedur appendix de nition fuzzi extend logic program call object liter argument nite argument attack theorem possibl fuzzi extend logic object exist success fuzzi truth exist justi ed argument strength exist success fuzzi truth exist argument strength overrul proof sketch note fuzzi root label correspond argument fuzzi correspond argument rule bodi liter complement success truth tree equal strength argument de ne rank fuzzi number alter attempt show tree success de ne kind rank argument de ned number undercut establish argument justi ed argument de ned number attack establish argument note rank tree argument nite proof induct rank show success fuzzi rank correspond justi ed argument success rank correspond argument overrul success fuzzi rank depend failur fuzzi rank correspond undercut rank argument rank undercut overrul induct argument justi ed success fuzzi rank depend failur fuzzi rank undercut rank attack justi ed induct argument overrul coincid height dialogu tree argument easi establish semant fuzzi extend logic program conserv extens semant extend logic program theorem extend logic program rule form object liter exist success exist success fuzzi truth proof immedi de nition fuzzi program true replac fuzzi success truth truth valu occur tree truth present argument semant fuzzi extend logic proof procedur sound complet wrt argument semant semant similar argument framework extend logic program dung present argument extend logic program set default assumpt notion attack de ned deriv undercut deriv liter assumpt deriv argument deriv argument accept wrt set arg argument attack undercut argument arg dung work argument semant logic program inspir subsequ work work base de nition framework richer rule divid strict rule assum rule strict de nition argument notion defeat accept di argument accept wrt set arg argument attack argument undercut undercut de nition accept strong satisfi coher program fp argument accept wrt undercut de ne proof theori argument dialogu correspond default liter tree includ tree dung deal fuzzi imperfect area extens survei wagner introduc framework fuzzi reason kind negat main di erenc wagner work di erent interpret fuzzi negat certainti scale rang certainti certainti certainti certainti greater interpret negat default behav es explicit negat wagner de ne term approach relat wagner relat approach stabl proof procedur de ned base approach interpret fuzzi negat di erent wagner de ne conserv extens futur tackl truth liter import argument process examin variat de nition account truth liter attack argument consid strength greater de ne notion account argument strength greater modifi treat fuzzi fact truth rule prioriti extend logic program deriv liter fuzzi deriv valu necessarili relat deriv case desir inconsist due incorrect problem possibl order regain consist exist method remov inconsist extend logic program examin method extend fuzzi extend logic program argument framework extend order model negoti agent knowledg agent desir extend fuzzi argument framework set interest argu fuzzi adapt prioriti deal fuzzi adapt prioriti argument truth liter implement fuzzi de ned call succe success fuzzi truth liter truth success tree tu la ga list local global ancestor loop check loop complement refer pereira queri evalu semant explicit negat proc european confer arti cial intellig page john wilei august pereira deriv procedur program explicit negat proc intern logic program symposium page mit novemb pereira logic program system reason journal autom alfer pereira reason logic program pm ra toni approach default reason arti cial codd relat model data larg share data bank commun carlo wolfgang lui moniz pereira extend logic program system knowledg base knowledg page morgan kaufmann carlo lui moniz michael schroeder logic program diagnosi confer logic program reason lnai dung argument semant logic program explicit negat proc intern confer logic page mit gelfond lifschitz stabl model semant logic program kowalski intern confer logic page mit allen van kenneth john schlipf unfound set wellfound semant gener logic program acm symposium principl page ac kaka toni comput argument logic program logic simon parson imperfect inform knowledg survei current approach ieee transact knowledg data henri giovanni extend program prioriti journal appli simon carlo nick jen agent reason negoti argu journal logic michael schroeder ecient argument framework negoti autonom agent model autonom agent multiag world gerd wagner foundat knowledg system applic agent kluwer academ gerd wagner negat fuzzi possibilist logic program logic program soft comput research studi zadeh theori approxim reason machin
Agents/820 1 architectur mobil agent server abstract mobil softwar agent softwar compon move network consid attract technolog electron commerc applic secur concern prevail paper describ architectur concept server runtim environ mobil agent architectur focu secur easi offer framework transpar content inspect agent mean filter implement filter handl agent sign authent select encrypt agent content filter appli transpar agent awar secur servic provid server autonom mobil agent malici distribut applic introduct mobil agent push flexibl distribut system limit comput distribut code perform distribut inform gather electron commerc applic area mobil agent technolog offer substanti benefit european esprit project interact develop proof concept applic base mobil agent technolog demonstr benefit expect mobil agent technolog deleg shop task mobil agent volker roth fraunhof institut für datenverarbeitung germani describ basic concept architectur mobil agent server basi applic server activ develop fraunhof institut comput graphic secur identifi numer time research top criterion accept mobil agent technolog research decid concentr mobil agent decid investig secur aspect titl platform secur mobil agent chosen reflect focu discuss secur mechan support section section summar open problem section highlight relat work drawn section mobil agent benefit mobil agent roam seek carri task behalf sender autonom return sender agent present result endeavor user freed oblig perman monitor progress make mobil agent mobil environ perman network connect maintain order run applic mobil agent offer great benefit applic network ad intellig function servic unifi homogen access paradigm mobil agent offer network bandwidth save migrat process sourc ship back network applic copyright ieee person materi permit permiss materi promot creat collect work resal redistribut server copyright compon work work obtain ieee base mobil agent inher distribut agent independ hardwar oper deploi heterogen environ advantag claim mobil agent addit summar recommend overview frequent quot gener accept claim order exploit benefit mobil agent framework cope number secur threat mobil itinerari gener span number server run compet oper steal data mobil malici host pass agent attack compet server owner process host awar malici agent break server order harm agent host gain unauthor system access mobil agent make perfect cover mobil agent attack remot host innoc host launch pad order cover track attack agent server threaten attack origin system agent transfer network connect privaci agent launch activ attack server directli indirectli manipul agent transport attack mobil agent system add threat compar impact attack sound secur model resist attack fundament busi accept market exploit fascin gener architectur design server decid consist minimum lightweight core easili extend mean agent plugin mechan facilit tailor server core specif applic domain fix set secur mechan secur mechan extend adapt requir cryptograph protect mechan design implement top cryptographi architectur extens order depend singl cryptograph technolog task server summar load instal agent system send stop signal agent remov dispatch agent maintain separ anonym agent provid servic manag architectur distinguish agent servic agent resourc thread persist storag space servic meant call agent run thread agent request servic refer borrow resourc owner agent maintain map index agent agent map privat object server object map defin agent map agent context agent context repres environ instanc respect object control lifecycl agent maintain refer object agent word due histor reason differ agent system aglet servic manag handl servic registri greater detail section system share space publish object secur architectur recent move jdk jdk make proxi gener featur build jdk provid adequ secur mobil agent server agent secur architectur server compar agent pass layer protect admit runtim system figur class agent load jvm secur layer transport layer secur protocol tl ssl time ssl implement java secur socket extens framework provid sun microsystem layer mutual authent agent transpar encrypt integr protect connect request authent peer accept reject configur polici layer consist pipelin secur filter separ pipelin incom agent outgo agent support filter inspect process accept reject refer filter procedur content inspect analog concept time featur complementari pair filter handl digit signatur select encrypt agent verif decrypt incom encrypt sign outgo addit filter end incom pipelin assign configur set permiss incom base inform establish verifi filter permiss grant base authent ident sponsor state recent sender filter regist unregist dynam boot time server mean configur file subsequ pass secur sandbox set accept agent regard layer agent separ thread group class loader agent thread run thread group thread agent marshal thread remain thread thread group termin serial framework java callback pass control back object thread block thread remain thread group handl migrat request agent prevent agent flood network agent server migrat termin time class brought agent annot tag permiss gener dynam uniqu agent agent attempt modifi thread group current thread trace back thread group identifi tag permiss test prevent agent manipul thread agent agent invok method configur thread filter sort thread creat class class abstract window toolkit separ thread group agent thread class load dedic class loader class loader support load class bundl load class remot code sourc agent load class class path verifi configur set trust hash function digest verifi class match digest sign owner regard layer class author owner agent load namespac agent share class agent load class space agent order method invoc share interfac interfac deem trust digest match class loader return load interfac load interfac serv interfac agent work interfac class referenc agent ident improv scheme compar interfac implement api level add overhead class load implement interfac object manag global agent class loader pollut attack map requir break trust hash function class defin java bytecod class pass filter pipelin similar incom agent class filter modifi bytecod filter reject class implement malici agent implement method order attack garbag collector thread host vm addit filter implement bytecod arbitr order add resourc account agent class agent separ agent refer agent instanc publish default mean share instanc agent publish registri agent view registri track object regist agent publish object wrap proxi creat dynam agent termin retract publish environ instruct handler proxi invalid link origin object make origin object unavail agent refer registri make origin object garbag collect registri registri maintain number servic level subject configur configur file level identifi uniqu level registri publish object retract lookup object list object list level oper list subject permiss check permiss grant base level servic oper asterisk permiss wildcard charact level server asterisk ordinari order prevent clash wildcard servic object publish store access control context current creation privat variabl privileg action servic set store access control context prevent privileg due global visibl class local class path malici code instanti servic object directli consult registri give code extend privileg permiss creat instanc limit grant access control context malici code word agent requir retriev servic instanc maintain registri subject access control registri meant bootstrap mechan agent servic find servic servic facilit agent commun languag made mean registri agent address mean directli agent transport content inspect basic configur server regist portal servic agent transport transport level call portal server call portal server figur agent pass portal portal scan level secur filter servic incom outgo agent hand filter turn inspect annot filter arrang lexic order filter accept reject agent time portal simpli reject agent portal handl transport serv transport servic listen network port transport servic simpli pass receiv agent decompress care process trigger event fire agent termin event agent question filter agent agent set ticket scan transport level transport servic accept ticket transport servic transport agent win ticket consist set altern url point desir destin figur illustr transport servic enforc maximum size decompress size agent size exce maximum decompress abort agent discard servic support agent transport simpl socket connect plain ssl http transport http transport handl mean web agent servlet regist detail web integr found agent structur mobil agent transport java archiv jar specif sun microsystem extend zip archiv support digit signatur mean ad signatur file content zip archiv signatur format cryptograph messag syntax standard build standard extend jar format support select encrypt jar content multipl recipi encrypt decrypt handl transpar agent filter introduc section order prevent encrypt part agent copi conjunct agent past filter implement proof knowledg requir decrypt kei agent bear digit signatur entiti sign static part agent part remain unchang owner agent entiti behalf agent send server sign complet agent part mutabl bind state agent static part agent server commit state occur agent host agent earli discuss concept found agent abstract compar combin map interfac filesystem order access store data static mutabl part similar folder abstract agent structur process outgo secur compress back jar transport destin host marshal instanc graph agent store structur side agent schedul comput snapshot fit agent structur back persist depend configur agent structur properti agent human readabl nicknam agent code sourc load class properti sign protect tamper comput implicit appli digest algorithm signatur render agent global uniqu anonym implicit provid agent scalabl rout messag agent support type access folder data read host modifi break verifi integr data read modifi host host commit state check link host hop group data read predetermin set author host modif data break verifi integr group data read modifi predetermin set host group valid recipi defin flexibl data mobil agent gather host protect eavesdrop host belong access group folder data store protect mechan part secur agent remain unawar cryptograph oper kei manag structur jar file consist pair properti initi class brought agent cover modif properti break static integr file serial object instanc graph agent inform manag select encrypt agent content relat work mobil agent list impress varieti current mobil agent system number system list share bia secur notabl mole instanc rigor separ agent system price improv separ paid term reduc perform restrict java environ seal seal commun mean synchron object commun pass order prevent share object refer seal packag complet replac standard jdk packag share class seal minim improv secur attack covert channel mean ident copi class load class loader individu seal number mechan compar deploi agent state protect mean digit signatur target state reveal part state select recipi object target state encrypt public kei intend recipi clear prevent adversari cut encrypt object target past target state agent adversari send agent list recipi agent recipi decrypt object bring back object adversari open problem decid build regular java virtual machin unmodifi core packag rule number protect measur expect viabl secur mobil agent platform foremost shortcom lack proper resourc control java vm robust number attack memori exhaust problem forc termin agent termin thread method stop thread java provok inconsist object state call thread agent agent catch propag stack continu time chose ignor problem server flag agent case build cooper number class java core packag synchron class object local class share global agent acquir lock class object effect block thread attempt access issu dealt mean dynam byte code rewrit extend byte code restrict visibl core minim share class instanc vitek implement protect mechan architectur support easi integr filter suitabl number shortcom java malici agent launch attack order agent run agent run class agent server verifi claim ident owner base digit signatur certif cover chanc track mean evid log secur host articl gave overview basic architectur highlight featur set system open multitud transport protocol support flexibl content inspect incom outgo agent mean filter ad filter simpl server core easili tailor requir domain ad servic complementari pair filter handl initi agent authent sign confidenti select folder structur cut past attack encrypt content detect prevent introduc notion tag permiss gener dynam implement agent access control thread group server architectur prove flexibl power constantli enhanc thing plan provid extend integr protect agent base mechan karjoth al algorithm base agent acknowledg part work sponsor esprit project target interact project number refer softwar agent ch pp menlo lang good reason mobil commun vol pp march applic mobil agent person assist electron proc confer practic applic intellig agent technolog bradshaw pp april isbn structur distribut argument mobil phd februari sun java tm cryptographi architectur api specif juli internet document sun java tm cryptographi extens api specif usa tl protocol version request comment internet engin task jan ssl netscap commun nov java tm secur architectur sun rel rsa messag syntax public standard rsa redwood roth java archiv applic mobil agent agent mediat electron european perspect dignum vol lectur note artif pp springer roth control kei manag mobil comput special issu data secur imag commun vol pp agent rothermel hohl pp secur global servic mobil ecoop workshop mobil object oper system secur program languag june mobil agent internet document url version current octob java base mobil agent ecoop workshop mobil object system tschudin secur multipl mobil agent secur vol lectur note comput pp berlin springer karnik server architectur intern confer allel distribut process techniqu applic juli mobil agent proc intern symposium agent system intern symposium mobil agent von resourc account interfac proc acm oopsla octob comput result rothermel hohl pp record itinerari cooper proc ecoop workshop mobil object secur internet mobil pp domain de bp le chesnai cedex juli sun jdk rothermel intern workshop mobil agent vol lectur note comput scienc berlin springer septemb agent secur filter agent servic ticket url secur filter figur support multipl gatewai agent transport inbound outbound gatewai servic manag central manag servic pipe agent number secur filter transport content digit encrypt dynam bytecod load access control environ agent implicit privaci protect scalabl messag rout log dynam proxi agent encapsul transport layer integr servic figur gener secur architectur resembl agent pass layer instal launch runtim system agent foo servic server request registri god secur transport local ident object idl sign filter foo servic servic agent kei master verifi filter encrypt filter raw decrypt filter http figur gener architectur distinguish agent servic agent request servic servic refer borrow resourc agent
Agents/821 1 algorithm optim level commit contract tuoma februari algorithm optim level commit contract tuoma depart comput scienc washington mo februari abstract autom negoti system consist contract bind level commit contract contract parti decommit pai predetermin penalti recent shown improv pareto effici agent ration decommit nash equilibrium inflat threshold good offer decommit paper level commit contract protocol present algorithm algorithm present comput nash equilibrium decommit threshold decommit probabl contract price penalti exist uniqu equilibrium analyz algorithm present optim contract exist uniqu optimum analyz algorithm offer contract optim servic web part gener electron commerc server algorithm gener contract involv agent materi base work support nation scienc foundat career award grant grant introduct multiag system consist contract bind agent follow matter futur event unravel contract profit agent view profit view futur event post contract low expect payoff realiz futur desir view post normal full commit contract unabl advantag possibl futur event provid multiag system consist cooper agent incorpor form decommit order agent accommod event origin contract net protocol agent contract task send termin messag cancel contract partial fulfil agent mind lose part effort monetari role decommit cooper agent studi meet schedul contract suggest util potenti provid futur event agent contract oblig made futur event game expect payoff parti compar full commit contract contract impract space combin futur event larg unknown event mutual observ agent lie level commit contract method capit futur event condit contract futur mechan built contract decommit achiev contract level commit decommit agent agent freed oblig simpli pai decommit penalti parti method requir explicit condit futur agent condit dynam event verif mechan ly requir principl assess decommit penalti studi law assess penalti agent breach contract breach occur penalti partial meet commonli motiv agent follow contract level commit explicitli decommit contract predetermin price activ method util potenti provid uncertain futur decommit possibl agent expect payoff gener assumpt analyz contract situat perspect risk neutral agent attempt maxim expect contractor pai task paid handl task handl task type constraint method specif classic task alloc contractor minim contract price ae pai maxim payoff ae receiv studi set futur agent involv uncertainti agent receiv offer contractor offer probabilist ant probabl densiti function contractor receiv correspond outstand offer payoff receiv contract made offer probabilist probabl densiti function receiv correspond outstand offer payoff variabl assum statist decommit studi constant time cost search partner good bad diamond framework interpret model situat agent cost structur handl task task handl chang due resourc back game agent futur subset game independ contractor option make contract wait option make contract contractor wait agent make full commit contract price make level commit contract contract contractor decommit decommit restrict attent contract agent paid decommit contractor decid decommit offer offer decid decommit offer contractor realist practic autom contract perspect theori level commit protocol present date algorithm present agent comput decommit agent benefici contract paper level commit contract present algorithm comput agent decommit algorithm construct optim level commit contract set defin nash equilibria contract concern ration agent reluct decommit chanc parti case agent freed pai collect penalti show decommit level commit featur contract parti expect enabl contract set full commit contract benefici parti set review analysi ration agent deriv nash equilibrium decommit game game probabl mass point agent decommit strategi agent decommit strategi contribut begin section contractor decommit low task handl low cost denot decommit threshold decommit probabl decommit high paid handl task denot decommit threshold decommit probabl sequenti decommit game sequenti decommit agent reveal decommit parti decommit implement analyz order due space limit discuss set decid case contractor decid analog altern level commit contract differ agent pai penalti decommit contractor move decommit hold contract agent pai decommit penalti decommit contractor move decommit ae contractor ae decommit decommit contractor ae def simultan decommit game simultan decommit agent reveal decommit simultan discuss variant pai penalti decommit contractor decommit equat rule contract agent paid decommit equat ae def decommit equat rule contract agent paid decommit equat ae def agent pai decommit contractor decommit equat rule contract agent paid decommit equat ae bp def decommit equat rule contract agent paid decommit equat ae def calcul nash equilibria amount solv simultan equat exist nash equilibrium discuss exist ne denot support support theorem ne exist ae ne exist ae trivial ne exist ae ne exist ae ae trivial ne exist ae ae trivial ne exist ae ae ne exist ne exist ae ae trivial ne exist ae ae trivial ne exist ae ae ne exist ae ne exist proof curv defin continu ae ae limit curv intersect ae ae ae intersect ae intersect limit ae ae limit curv intersect ae ae ae curv intersect ae similarli ae curv intersect ae intersect limit ae ae limit curv intersect ae ae ae curv intersect ae ae equal curv intersect ae intersect uniqu nash equilibrium uniqu nash equilibrium theorem sequenti ne uniqu simultan game ne uniqu proof sequenti uniqu form threshold express function ae defin function threshold fig show multipl equilibria exist game construct similar ae ae figur nash equilibria algorithm find nash equilibria discuss algorithm comput nash equilibria assum probabl densiti function linear piec justifi continu function approxim arbitrarili close linear curv implement linear curv easi user input algorithm comput equilibrium sequenti game straightforward simpli substitut contract paramet simultan game substitut system nonlinear simultan equat equat multipl solut found rule iter procedur find solut motiv design fast analyt algorithm find solut search space rectangl simultan equat solv analyt rectangl rectangl algorithm solv function quadrat linear rectangl substitut substitut reduc result equat cubic polynomi solv root polynomi calcul valu accept solut lie rectangl algorithm run time rectangl equilibria present social welfar maxim maxim sum agent expect payoff present equilibria optim contract discuss ration agent decommit contract optim contract account agent decommit nash equilibrium present algorithm analysi find optim contract price decommit penalti set protocol analysi describ optim problem contractor expect defin deriv game ae ae bt bt protocol social defin optim contract contract maxim social max express show game function origin problem optim space reduc optim space ration agent accept contract expect payoff individu ration defin feasibl set space deriv unconstrain verifi belong feasibl set condit unconstrain optima case satisfi equal special case deal gap region probabl densiti insid case pair gap constitut continu set local optim solut constant region valu definit integr constant find local optim suffic evalu point region pair gap satisfact ir constraint verifi local optimum found substitut valu equat ir constraint reduc system linear inequ straightforward solv system verifi part result solut li region defin pair gap local optimum consid candid global optim case algorithm gap constant gap give deriv formula deriv integr respect limit calcul formula condit calcul local optim valu substitut equat ir constraint give inequ part gap feasibl local optimum consid candid global optim case analog case case condit give pair simultan equat describ function equat function local optimum exist curv intersect intersect multipl theorem curv intersect intersect intersect intersect point uniqu proof limit limit curv repres strictli function deriv note intersect intersect point uniqu intersect intersect figur show intersect multipl multipl optima show local optim solut lie feasibl exist nonempti rang contract price ae satisfi ir constraint deriv lb ub express ir lb ub lb figur local optima ub lb bt ub bt occur form fact defin probabl densiti function game lb ub reduc shown true form algorithm find optim contract algorithm find optim contract check special case time nm pair gap optima case determin comput intersect point curv multipl solut rule iter method find solut algorithm rectangular decomposit equilibrium find algorithm present rectangl solv quadrat equat linear substitut substitut reduc result equat polynomi solv root polynomi calcul valu accept solut lie rectangl algorithm run time rectangl candid set local optima result case scan global optima fair optim contract optim pair defin set welfar maxim contract differ base expect gain full commit divid contract parti implement show optim feasibl contract user visual choic lead expect payoff function ae suggest fair contract divid excess equal turn fair contract price ae fair valu penalti calcul implement algorithm provid base contract optim servic web part gener electron commerc server java implement gui commun server web written execut comput client accept linear function user input graphic text probabl densiti function automat scale integr output interfac displai decommit threshold probabl optim feasibl contract fair optim feasibl contract server comput root polynomi rectangular decomposit algorithm root find method comput root find root simultan polish root reduc numer root close boundari result root calcul rectangl accommod extend rectangl direct ffl captur root overlook gener contract method gener contract involv agent demonstr game parti decommit contract break parti densiti function offer ir constraint contract paid paid ae ae ae decommit penalti figur sequenti game variant depend decommit order simultan game differ base parti simultan decommit pai due limit space present formula ae ae ae ae express analog similar express rectangular decomposit algorithm comput nash equilibria extend rectangl extend case optim problem contractor figur contract characterist function solv root deriv yield equat variabl rectangular decomposit algorithm calcul optima extend case rectangl similar occur gener level commit contract practic capit futur uncertainti negoti agent paper present algorithm contract comput nash equilibrium decommit threshold decommit probabl ration agent algorithm optim contract price penalti maxim sum agent expect payoff account agent decommit contract optim servic provid web refer georg weber mathemat method physicist academ john joseph law contract west publish peter diamond eric equilibrium analysi search breach steadi state bell krau agent contract task environ proc eleventh nation confer artifici intellig page juli john nash equilibrium point game proc nation academi richard posner econom analysi law brown william saul william brian flanneri numer recip art scientif comput cambridg raiffa art scienc negoti harvard univ jeffrei rosenschein zlotkin rule design convent autom negoti comput mit tuoma sandholm victor lesser advantag level commit contract protocol nation confer artifici intellig page august tuoma sandholm implement contract net protocol base margin cost calcul nation confer artifici intellig page juli sandip sen tradeoff distribut schedul phd univ reid smith contract net commun control distribut problem solver ieee transact decemb
DB/822 3 intern confer expert system applic august septemb vol pp queri process relationlog mengchi liu depart comput regina canada abstract relationlog persist deduct system support ectiv ecient access infer larg amount data complex structur describ queri process relationlog system illustr extend techniqu relationlog introduct past nest relat complex object model develop extend applic tradit relat model applic imag process text retriev import direct intens research logic program base languag datalog queri languag languag simpl natur express queri relat express tradit relat languag past ort combin extend datalog set tupl constructor natur xpoint construct express transit closur declar polynomi space time make express practic real applic research kind deduct stai theoret level implement system ldl coral past design implement persist deduct system call relationlog relationlog system base deduct languag relationlog type extens datalog tupl set power mechan repres manipul nest tupl relat ned declar semant relationlog support nest set tradit queri process techniqu datalog rule rewrit techniqu directli extend techniqu queri nest set tupl answer ecient describ queri process relationlog system illustr extend extend techniqu relationlog paper organ section overview relationlog data model section show relationlog system architectur section describ extend techniqu evalu relationlog rule section address extend strategi section summar paper relationlog overview datalog deduct languag relat relationlog deduct languag nest relat complex object stand relationship nest relat complex object model datalog stand relat model relationlog type unlik datalog atom data type support relationlog includ base tupl set type form set tupl fstringg citi relat schema tupl type relat set tupl nest set tupl relat schema call robot id arm ax matrix ector joint angl max min dynam accel gripper function id arm gripper matrix joint fv max min left gripper righthand middl lefthand relationlog languag rule deriv complex object relat explicitli store relationlog consist schema set relat schema relat set relat store disk set rule de ne relat complet relationlog schema ag parent address citi ancestor edb person ag parent address string street citi mari sean st john pam av montreal jim st calgari sean sam av regina idb hy hy hy hy variabl anonym variabl relat relat queri uniformli queri queri queri john queri mari queri system architectur relationlog system implement persist deduct system system architectur relationlog shown figur user interfac buffer manag index manag main memori updat manag storag updat subsystem ddl manag dml manag queri manag data manag queri subsystem command result fig architectur relationlog system organ layer rst layer user interfac kind user interfac textual user interfac graphic user interfac provid di erent kind environ user de manipul textual user interfac process user command displai result graphic user interfac user pick oper menu kind interfac send oper intern form lower layer layer data manag queri subsystem consist ddl queri manag dml cooper tightli direct lower layer handl smaller task ddl manag process ddl maintain system catalog indic answer type check request dml queri manag check rule strati ed rule creat queri manag data retriev rule evalu data retriev simpli match indic result data retriev relat de ned extend strategi extend xpoint evalu techniqu result queri dml manag perform updat relat updat impli dml manag request queri manag process queri perform updat relat request layer storag updat subsystem consist main bu er index updat manag bu er manag deal updat relat indic rule main memori disk le index manag charg creation updat hash indic relat transpar interfac updat manag deal updat relat indic rule extend techniqu relationlog extend algorithm coupl extend rule rewrit describ extend algorithm algorithm relationlog oper group denot group set compat tupl di erent denot di erenc nest relat run illustr extend algorithm extend strategi graph repres edg node nest relat edg store graph edg cg fg ffg transit closur express relationlog zi partial set term di erent denot part set bodi rule deriv part set group head rule algorithm relat path path path path temp path temp path path path temp fact infer fact path temp path path fact path infer stage algorithm stop empti obtain fact path path edg path temp path temp path path path path temp path temp path path path path temp fg fg path path xpoint path path nest path fg fg ffg ffg extend strategi techniqu simul evalu push select occur approach perform rival ecienc techniqu assum reader familiar adorn rule rewrit give introduct notat appli relationlog xed order argument predic argument atom complet set partial set tupl term relationlog type kind argument predic fact base schema di erent level relat relationlog level repres set tupl nest set tupl robot relat level rst arm gripper ax fourth db matrix ax arm order repres bound free inform deepli nest extend adorn predic relationlog string length alphabet atom argument stand atom argument stand complet set partial set tupl term complet set partial set term tupl string alphabet tg superscript repres statu argument exampl extend adorn argument adorn note atom variabl ci bbb xi atom variabl cg bbb zg fff atom variabl bc set variabl tupl variabl bc ff atom variabl bp bb bb order show extend strategi rule typic queri pattern relat path case bp case bp bb case bp bf case bp case bc case bc case fp case fp hy case describ handl case relationlog exampl case queri answer kind queri true dont evalu origin rule answer queri simpli evalu rewrit rule convert queri queri case queri answer kind queri true case dont evalu origin rule simpli evalu rewrit rule convert queri queri case queri answer queri path possibl empti list node reachabl evalu rewrit rule case convert queri queri case queri answer queri list node reachabl evalu rewritten hy hy hy hy case queri queri similar answer queri set node exact rule case result case queri queri reach complet set fg similar case answer check set fg case queri answer queri list node reach rewritten rule hy hy hy hy case queri hy case queri rewritten rule queri constant reduc search space origin rule evalu directli discuss queri process mechan relationlog deduct system extens techniqu evalu relationlog program complet implement relationlog extend extend techniqu discuss paper develop relationlog system achiev reason perform larg volum data disk system graduat student research project successfulli test relationlog system version internet public access evalu extend relationlog deduct system provid algebra queri languag refer hj editor intern workshop theori applic nest relat complex object lnc pc hj editor nest relat complex object lectur note comput vol abiteboul grumbach languag complex object acm vianu foundat addison serg abiteboul beeri power languag manipul complex valu vldb bancilhon calculu complex object comput system tsur set construct logic languag logic tanca logic program chen chu logic program languag deduct jm intern confer deduct page zaniolo ldl system prototyp ieee transact knowledg data colbi algebra queri optim nest relat acm sigmod intern confer manag page hull survei theoret research type complex object page academ krishnamurthi naqvi real horn languag intern confer larg data page lo morgan kaufmann kuper logic program set comput system mark leven georg loizou semant null extend nest relat acm liu shan design implement relationlog deduct system intern workshop expert system applic workshop page august press mengchi liu type extens datalog set tupl journal logic yuan normal form nest relat acm tran sudarshan relat logic intern confer larg data page british morgan kaufmann raghu divesh praveen seshadri coral deduct system vldb queri languag relat inform silberschatz extend algebra calculu nest relat acm jd ullman principl volum comput scienc jd ullman principl volum comput scienc
DB/823 3 advanc object model environ li ieee comput frederick lochovski ieee comput societi abstract advanc object model approach integr data knowledg manag base present gener inform system requir flexibl data model capabl provid current dbmss integr data knowledg manag capabl increasingli import versatil role facil serv data object product facilit flexibl data knowledg manag integr prototyp implement mechan oper construct top commerci dbm rule base system index object knowledg dynam inform system introduct organ requir intellig inform manag order achiev higher level intellig interact integr data manag knowledg manag technolog crucial gener inform system applic organiz inform system support system comput support cooper work inform system data object longer passiv entiti activ dynam exhibit activ dynam applic semant seldom restrict tradit includ rang specif integr constraint gener applic rule issu relat develop data knowledg base system extrem import address vital develop applic expositori comparison classifi data knowledg manag requir aspect figur model structur behavior object applic domain support paradigm element domain longer passiv atom valu complex structur activ li depart hong kong polytechn hung hong kong fh lochovski depart comput scienc clear water hong kong behavior oo construct combin structur behavior access model data object compar model er oo model greatli facilit reduc gap applic domain function data model model extent oper access longer part extern encapsul object model function aspect applic domain activ knowledg activ consist task execut individu make type agent distinguish assert knowledg semant deduct rule infer knowledg situat specif rule except form specif action part typic refer procedur model applic dynam requir flexibl model object level abil evolv migrat object abil support activ abil model multipl state activ task execut task state transit reflect progress task model requir data aspect structur behavior dynam object evolut migrat multipl perspect data dynam bind migrat function aspect activ task agent assert activ figur manag requir note aspect requir aspect area requir perspect distribut point view intens paper focu basic concentr central system context adequ requir develop advanc object model environ underli approach base integr rule base system system order enabl integr system handl wide varieti data knowledg manag requir articul depict figur approach investig feasibl practic organ upgrad exist oodb system simpli integr rule base system approach highli dramat individu system compon approach advantag simplic design readi result system util individu compon strength handl type knowledg oper integr rule base oodb system base gener notion role role effect mean accommod dynam object state multipl captur applic knowledg level facilit integr knowledg form product data role essenti serv bridg gap data base knowledg base semant highli mediat capabl bind data knowledg unit dynam fashion develop dynam role mechan accommod flexibl bind major research emphasi project describ detail approach integr data knowledg manag capabl applic rest paper organ section provid overview promin work close relat highlight exist defici requir section describ architectur framework integr data knowledg architectur fit pictur support applic section detail versatil role facil form foundat dynam bridg set oper section describ prototyp system implement issu prototyp provid case studi appli organiz inform system illustr facil util address specif problem pertin oi applic section conclud paper background research provid overview promin work close relat research due interdisciplinari natur group relat work integr manag data rule dynam object model integr manag data rule rule manag import extens recent year mainstream technolog rule activ capabl captur gener knowledg declar expert activ deduct deal rule addit basic relat model recent model enabl technolog build advanc inform system rule activ expert dbmss rule plai role dbmss long time stonebrak point product rule unifi mechan integr access view process support infer bulk dbmss attempt util rule establish enforc data manag polici modular partit complex rule set time activ dbm respond automat event gener intern extern user ai system long rule activ object procedur attach slot frame knowledg infer mechan ai system implement assum small number object store singl thread concurr control share object research conduct provid support persist inform ai system expert facil result respect aspect requir articul section tradit activ expert system address aspect provid facil model behavior properti data adequ address applic dynam aspect rule paradigm import dimens technolog evolut develop model provid detail discuss paradigm compar relat oodb system support rich data structur mechan hierarch gener relationship object data process form encapsul store manag oodb system central uniform code manag mechan favor code tool incorpor rule system rule action store manag object method oodb system excel enabl technolog unifi manag data procedur order handl advanc requir gener inform oodbm combin recent expert deduct reason refer deduct system exemplifi adam od chimera sentinel system approach wide rang intern function extern applic support gener extens manner system implement develop total kernel scratch build special rule manag modul insid exist oodbm approach special implement kernel rule manag modul oodbmss amount effort modif exist oodbm code requir approach respect aspect requir articul section system provid support tradit address aspect larg extent remain weak limit aspect accommod applic dynam object model parallel research integr data object knowledg rule research direct develop oodbmss support advanc includ object evolut dynam conceptu multipl radic direct support dynam function oodbmss base object model extend role base object model model role extens exampl work belong group includ convent oodbmss develop program languag system approach defin structur behavior properti data object assum object creat restrict model dynam real world true applic domain relax model restrict role facil incorpor recent oodbmss result improv model power flexibl convent model notion role model system role defin network data model approach role wide model semant network data model context role demonstr effect support object evolut migrat conceptu cluster model work role model facilit describ behavior object evolut approach support role encapsul class role simpli addit facet inherit usual inherit attribut work object migrat pattern consid pattern object migrat chang repres dynam valid histori object work conceptu cluster model role object group form ad dynam collect deriv approach support role work encapsul cluster role found support multipl object work area includ object special aspect fibonacci approach work combin approach prototyp system objectori class view individu object auxiliari role object defin inherit path role attach object class directli extens provid special perspect object class fibonacci system al role hierarchi base class object plai role hierarchi respect aspect requir section oodbmss role extens capabl address aspect great aspect model function aspect includ kind model direct support dynam function oodbmss emploi program languag previou restrict class longer adopt object model oodbm defin object model map provid languag object model exampl includ gemston follow approach oodbmss extend role support object migrat object view perspect respect aspect requir section model capabl address aspect system address issu directli explicitli support incorpor semant form leav aspect figur larg unsupport architectur build manag system capabl satisfi aspect requir articul section develop hybrid advanc object model environ underli approach base integr oodb system rule base system architectur seamless integr dispar system versatil bridg mechan role figur illustr major compon lower level higher level approach build advanc inform system enabl system quickli econom util posit featur paradigm integr data knowledg manag explain languag interfac integr mechan bridg oodbm base rule base procedur system figur architectur view system implement approach explicit oodb system data manag compon serv knowledg manag commun interact compon shown figur dynam bridg mechan advantag simplic design readi approach avoid complic individu compon model function implement level bridg desir accommod complex manag activ applic domain addit declar knowledg semant form accommod knowledg form typic correspond task perspect organiz inform system topic support procedur knowledg issu migrat declar procedur knowledg emphasi facil associ data object rule procedur dynam bridg mechan system applic level view system singl languag interfac unifi environ data knowledg manag reason provid environ level point suggest applic conceptu late partit applic user point conveni desir unifi environ provid data knowledg semant system care kind semant underli compon fulli support addit unifi languag facil address issu manner bind static scope rule incorpor account principl encapsul manner rule manipul fire static object potenti inconsist problem infer engin rule base modul framework requir princip object develop cater aspect requir figur singl import demonstr architectur framework support requir figur intuit illustr architectur support aspect requir shown figur data mechan oodbm rule base procedur system function data aspect structur behavior rule assert role agent applic domain model base activ aspect dynam aspect figur support aspect requir includ structur behavior readili cover oodbm function activ knowledg form assert support procedur base rule base role mechan aspect role mechan addit serv bridg mechan data object effect basi model dynam includ exhibit capabl section present detail facil effect appli address specif issu pertin organiz inform system compon meant captur function requir applic event order support intend provid flexibl foundat versatil develop easili natur section bridg mechan base set versatil role facil bridg mechan base flexibl role facil integr data knowledg manag set dynam role facil serv bridg mechan figur provid desir oodb procedur rule base compon role serv dynam data object adopt role mention due fact role effect context convent gracefulli accommod includ object migrat model object reli exist multipl inherit hierarchi mechan oodb system model dynam aspect util role separ static aspect dynam oodb schema remain stabl role natur partit messag object object receiv send messag stage complement approach convent oodb model system context role adopt serv captur dynam interact integr object figur intuit illustr relationship distinct construct data object rest figur run elabor approach bridg mechan describ underli role model set role oper support basic role bind procedur data object role model role model bridg mechan view variant class model convent oodb role exhibit featur similar featur gener characterist applic role ffl object assum role relinquish exist role person student switch student switch back student event mechan develop top role mechan admin staff faculti vacat rule person foreign born dept head faculti vacat rule graduat rule student postgradu class role hierarchi hierarchi rb procedur pool class hierarchi oodb research assist graduat approach data knowledg integr ffl role plai object clerk programm plai role task arrang seminar ffl role partit messag object plai object receiv send messag role postal address appli person famili person privat phone number access view role ffl role plai relinquish object role independ determin relationship person custom independ serv act depart serv head time understand featur complementari role respect oodb formal definit basic notion role addit role featur support subsequ subsect formal definit role class object class role depend set individu class instanc class call object instanc role class call role class abbrevi role inst ff denot set instanc class state world ff assum function call model object class state ff inst ff inst ff inst ff call player role state ff inst ff surject inject function codomain includ instanc object class role role player object role instanc object plai properti elimin case role player role instanc role player role instanc role properti inform role plai impli object role plai multipl role object role player role differ role object class identif point instanc object subclass ident identifi instanc superclass instanc role instanc player class formal differ respect problem role provid data protect partit messag receiv player model person plai role student role instanc attribut student person type error person student access inform perspect access student inform type error specif target defin deleg role instanc player model role person sex attribut person type error correct error deleg evalu sex plai amount replac role oodb model role natur regard addit facil role set attribut method defin properti behavior applic object plai role unlik creat delet object object player adopt notat state world refer denot time variant properti object class context role gener includ differ respect oodb role set product rule creat role applic role player rule initi sharabl role explicit export import role number state transit state defin subset rule set util addit facil role explain subsequ subsect role return player rule definit manipul invoc figur role definit figur show definit syntax similar defin main properti oper applic role instanc consist regist current object plai record attribut defin record method defin part arrai local part arrai global accommod type rule creat specifi state object player role origin role deriv section convent oodb role regard view staff research pg ug student phone dept link inherit path figur partial inherit role hierarchi partial inherit similar class organ hierarchi role structur result call hierarchi special role deriv figur faculti special hierarchi similar isa differ attribut procedur inherit select manner object player act player default figur design support inherit player level individu object inherit offer greater design flexibl term properti behavior inherit object model role mechan figur intuit illustr shown regular employ regard member regular project staff postgradu student work count regular project staff member polici object plai role explicitli count player effect facilit notion object special popular ai prototyp system complementari mean model object individu overcom convent subclass hierarchi mechan data object similar rule creat inherit directli share rule mean explicit oper role note type rule share restrict role exhibit role section inherit rule unlik attribut gener role specif desir inherit rule research assist project member project rule travel defin role applic fact role figur illustr shown rule export role import rule role nobl role select inherit attribut method defin base role mask attribut method attribut role mask assum research assist count regular staff member provid work phone method role role attribut attr suspend int int int string string ad attribut string int string int method method suspend int string string float string ad method float string state transit rule state transit rule sharabl rule import salari rule figur suspend definit import rule defin role applic research assist gener defin rule describ work hour limit specifi weekli work hour exce research assist paid hour role state transit shown figur role defin set facilit control role behavior role state prescrib current context execut object player role object plai role execut method state state describ object player evolv role input output state transit rule constitut part role definit state transit rule resembl finit state transit gener execut figur illustr state transit role finit state machin notat state transit enforc implement local rule role onboard quit leav duti complet start state assign duti return resign special approv figur applic state transit role role oper role role figur set role oper defin part role model oper provid basic role manipul oper object player rule describ semant detail descript oper sampl usag found role creation delet ffl role constructor creat role creat role requir specif role addit attribut method addit select inherit state role player transit rule state ffl delet role role rule creat role remov player detach role oper player ffl oper assign role data object object assign role option set initi state initi state put nil valid state oper ffl oper detach role exist ffl oper player set attribut defin role assign updat player attribut ffl oper return set object player role iter player list option user return set explicit player player includ inherit oper role state ffl oper return current state object role note role player time state transit defin role local rule section ffl oper set current state object plai role state oper reset player current state oper rule method ffl oper creat rule current role result object player current role rule ffl oper modifi exist rule current chang propag import role rule ffl oper delet rule current role import role ffl oper rule temporarili set object player mask rule resum oper ffl oper deactiv rule resum set object player note oper mean execut time execut ffl oper rule defin role set object plai role oper newli introduc rule evalu test schedul execut rule base compon ffl oper return set rule defin applic player role user set applic rule ffl oper creat import extern procedur method role method dynam creat execut file execut set object function call player method combin method role import procedur export role role import ffl oper export method publicli select set role export method share procedur put figur oper view basic support addit role boundari ffl oper import remov method export share method remov pool role import ffl oper invok extern procedur import role oper newli import procedur evalu test set object ffl oper return set method defin applic player role method procedur export return correl class role role model facilit dynam bind object dynam role player support dynam rule definit manipul hierarchi rule share role object vice versa call flexibl correl scheme class role feasibl scheme detail scheme extend class definit role assert ordinari class definit extend includ role assert part oodb applic role class exist part oodb class construct role dynam ad delet class time protect valid relinquish applic enforc role order control rule form eca rule defin figur illustr object class definit syntax similar augment construct class public person attribut int string string method int string string applic role constraint check return complet undo figur object class definit extend role assert shown applic role object initi defin set updat role constrain role assum experi member role assert treat special form integr constraint class enforc rule base compon scheme ad constraint role drawback scheme requir modif made exist class mechan order incorpor role assert class definit constraint relationship awkward role assert respect individu class altern correl role class class constraint role definit role object plai role class constraint constraint part role definit figur show figur class constraint scheme overcom drawback scheme defin applic role check constraint updat due advantag scheme system minim dynam role current prototyp scheme implement correl class role class public person role attribut string attribut int method string method int string figur ordinari class definit extend role definit discuss approach provid advanc model capabl offer flexibl effici data knowledg integr embodi approach organ upgrad exist oodb system simpli integr rule base system versatil bridg mechan compar system approach adam od chimera sentinel effici term underli commun involv costli build due fact bridg mechan oodbmss simpli chang exist oodbm code obviou approach result attract rule defin role role serv natur indic relev reduc search space rule retriev process rule access made effici system target goal base creat opportun optim system includ order facilit rule share inherit rule treat citizen hold uniqu convent class rule role defin role view extend class kind extent hold object player extent maintain oper role defin similar method simplifi implement util role build bridg mechan make full exist role kind applic target mention includ abil model object provid semant support dynam object provid extend queri capabl data util addit benefit explor organiz inform system applic develop prototyp section prototyp applic part research develop prototyp system base commerci system oodb system call odbm commerci version system develop mcc expert system shell call clip languag integr product system johnson space note choic specif oodb system case rule base system due avail system dynam capabl odbm support schema evolut found conveni quick prototyp prototyp system written mixtur lisp discuss implement prototyp describ specif applic context organiz inform system call implement integr approach prototyp develop bottom briefli describ implement bridg layer map odbm object clip provid integr interfac applic detail implement prototyp system report implement role simplic role implement object prototyp due fact dynam featur odbm easili map function role facil figur serv root role class hierarchi role class implement definit role class dynam modifi odbm support dynam schema modif implement choic pure conveni impli approach depend odbm commerci oodbmss support schema role mechan natur implement separ modul independ underli oodbm explicit oid approach track object plai object player role instanc role class creat effect address problem mention section instanc role class store role attribut role player note explicit creation role instanc transpar user point view user shield exist role instanc role class multipl inherit support role oper accomplish knowledg role instanc user addit level indirect slight overhead player nobl role plai base role implement introduc concept depend role independ role role player plai independ role depend role role player exclud plai independ impli action exclud altogeth depend role player exclud plai depend role affect role plai depend role depend depend role figur lisp definit player player plai record state player state chang finit automata store list role depend player role instanc figur definit attribut deal rule control rule attribut set rule export rule local rule subscrib player attribut figur share instanc class implement role mention scheme ii implement requir modif role player object role serv logic group facilit partial trigger rule base role relat project adopt approach built role detail implement found implement rule rule implement object facilit share process rule figur show rule class definit prototyp system specifi rule figur rule class definit rule bodi specifi condit action rule store list role class subscrib rule player subscrib role subject applic rule store list player player role temporarili applic rule store list individu player subject applic rule list object referenc rule member impli object class load clip work object case object load notic subscrib rule implicitli relat object implement bridg layer bridg layer map object clip format integr program interfac applic program interfac written sampl code list appendix role oper program interfac consist role oper earlier section view role oper view oper administr natur involv role player rule applic player oper direct role class view oper categori gener applic individu player subscrib rule view user interest subscrib rule knowledg subscrib rule decid applic rule role stress oper accomplish view support view requir modif role player class definit load rule clip requir rule relev fact work memori order execut rule relat object load memori execut rule load clip work automat rewritten reflect applic rule respect subscrib subscrib suspend player load object clip object referenc rule clip load clip work memori rule load object clip gener object odbm class hierarchi maintain clip work memori class clip work memori explicit relat major defici class hierarchi maintain current statu prototyp prototyp system basic featur model facil includ role definit rule map clip object rule clip uniform view transient persist graphic user interfac design implement support rang oper activ prototyp system refin extend support flexibl event mechan queri languag appli demonstr util versatil model facil present subsect case studi appli specif organiz inform system call due space restrict specif aspect appli highlight facil address challeng requir present overview describ base engin organiz inform system activ system target activ manag process organiz environ goal support activ occur organ architectur mimic organ composit unit unit call behav organ small domain organiz knowledg exampl depart head payrol word process advisor individu organiz worker organiz similar organiz activ result insid interact organ assign activ processor assist carri function activ addit coordin execut entiti commun figur show conceptu system architectur activ processor shown figur type entiti data knowledg procedur activ organiz activ coordin workspac data agent knowledg activ processor mean activ entiti mean access info entiti point mean pass control entiti point mean execut entiti point organiz coordin activ workspac task fact case cr ear role mechan base oodbm rule procedur base agent repositori agent figur architectur engin procedur knowledg activ activ note organiz agent unit person ultim activ perform architectur consist engin data knowledg manag program environ construct specif realiz implement oasi detail descript found detail entiti found omit focu subsequ discuss examin issu involv incorpor engin system clear integr data knowledg manag capabl provid requir crucial analysi requir led incorpor base engin manner depict figur data repositori oper includ convent type support oodbm directli advanc function support data object multipl perspect associ oper object achiev role facil act bridg knowledg form consult rule extern activ rule distribut readili support larg extent rule base system rule coupl role mechan rule aspect util applic omit simplic discuss set incorpor address specif problem pertin advanc inform system versatil role facil emploi resolv challeng data knowledg manag issu costli awkward deal knowledg commun share requir system elabor detail abil support flexibl knowledg commun share organiz agent mention assign organ individu organ assign agent organiz unit assign unit organiz architectur figur explicitli partit distribut organiz knowledg privat knowledg share knowledg organ mean knowledg inherit hierarchi hierarchi categor knowledg agent unit relat type knowledg inherit hierarchi structur organ figur addit share knowledg base knowledg inherit flexibl share hierarchi share includ dynam bind agent rule explicit share rule agent knowledg inherit hierarchi point requir system rule procedur access agent dynam sale person joe sale knowledg develop project develop depart develop system person sam system assign serv market agent system knowledg order market support individu implement oasi call combin capabl case function subsystem support top rule base knowledg consist knowledg inherit hierarchi strict hierarchi multipl inherit answer simpl question describ basic function system make knowledg system resid project develop depart individu agent joe sam belong organiz unit directli relat develop introduc unit ad knowledg inherit hierarchi undesir organ perform structur order accommod activ promot support system od sentinel chimera defin specif rule object class attach rule individu object joe explicitli creat problem manag maintain rule number larg awkward inflex object longer specif acquir problem natur address role facil grace manner role call serv unit defin joe sam includ player role actual agent basic knowledg system figur method defin share easili flexibl agent sam appoint organiz unit note object elig instanc unit declar organ market sale joe steve attribut method sam unit agent role develop sue john string date string boolean figur knowledg commun share point requir system rule defin unit dynam share flexibl manner unit knowledg inherit hierarchi directli share knowledg travel agent accid insur defin insur agent duplic accid insur polici travel effici simpli travel agent rule insur agent easili accommod protocol agent type illustr figur notic import rule access applic travel rule insur travel agent import rule longer import rule export owner delet role role attribut attribut int int method method int boolean void real state transit rule state transit rule sharabl rule sharabl import rule figur explicit knowledg share agent scenario flexibl role mechan address challeng problem involv dynam knowledg commun share knowledg commun share costli note system type knowledg share support requir research direct gener inform system applic requir advanc data knowledg manag capabl provid current technolog convent embodi exist activ expert manag system fulli address requir paper architectur prototyp system hybrid facil accommod model requir integr commerci oodbm product rule base system respect requir articul begin paper figur system address aspect dynam great tradit exist oodbmss address subset aspect major research emphasi project develop dynam bridg mechan integr dispar compon system bridg mechan base gener role concept order accommod flexibl bind role serv dynam data knowledg role model offer advanc area rule class set oper defin implement support basic role role state rule method oper object relev issu correl class extens current oodbm class mechan address applic context organiz inform system call show facil solv challeng problem involv knowledg commun share environ approach support develop practic opportun test exist oodbm technolog implement specif advantag methodolog provid data object knowledg compon captur repres aspect applic semant applic semant declar form procedur form evolv flexibl dynam separ compon rule procedur static dynam facilit static dynam major research emphasi project effici manag evalu number rule larg system effici store retriev relev rule execut rule index role store physic accommod larg set rule effici search facil approach repres practic extend current oodbmss captur dynam extens role mechan underli role model facil current model provid facil support tempor event support support tempor current support interact relationship research issu carri order achiev manag role data knowledg process develop versatil event mechan top enabl support capabl issu hope investig prototyp ffl role optim storag base ffl evolut data rule base migrat rule method vice ffl adequaci approach incorpor type plan negoti capabl knowledg acknowledg author express sincer anonym suggest clarifi improv present paper lc chan kw chiu contribut prototyp implement applic system work support research grant council hong kong grant hkust refer object data model intern confer larg page chakravarthi perspect rule support acm sigmod intern confer manag page cw role concept data intl conf larg page paraboschi intellig system design intl conf applic lectur note page beeri milo model activ intl conf larg page stein gemston object manag comm cattel object data manag kim event activ context intl conf larg page lc kw li versatil bridg mechan user interfac expert technic report dept comput hong kong scienc technolog clear water hong lc chan li flexibl event model top common storag intl workshop inform technolog page dayal manag proc intl conf data knowledg page dayal view data proc intl workshop program page morgan chakravarthi combin activ time acm sigmod ap dr mccarthi object knowledg model activ objectori proc intl workshop page grai manag unifi intl conf larg page al comm oct elmasri navath fundament system etzion segev proc intl workshop gener inform technolog system june israel kr dittrich activ concept intl workshop program page nh hv shmueli specif acm sigmod intern confer manag page mf extend transact environ workflow distribut object ieee data nh hv jagadish activ constraint intl conf larg page en hanson initi report design dbm integr product rule acm sigmod ls cm video manag system base advanc proc confer storag retriev imag video page system metro mn usa odbm user kerschberg manag environ intellig inform inform kim introduct mit jf woelk kim fh applic acm page li fh lochovski approach integr data knowledg manag gener inform intl workshop gener inform technolog page li fh lochovski support facil groupwar proc annual workshop inform technolog page dec li fh lochovski extend object behavior support knowledg intl symposium advanc technolog page oct li fh lochovski support facil cscw journal organiz comput electron ablex pub smith object model spatial intl comput softwar applic page ieee comput septemb li smith conceptu model dynam cluster object intl conf larg page lieberman prototyp object implement share behavior proc page oct fh lochovski li inform intl symposium gener system page fh lj william model support knowledg migrat proc acm confer offic inform page johnson space center clip refer manual version marten fh lochovski program environ implement distribut organiz support proc acm confer organiz comput page proc intl symposium gener system applic sept japan lesser intellig assist distribut offic acm confer offic inform page mt al uniform behavior manag vldb vldb juli jd palmer na field cooper ieee pernici confer offic inform page richardson schwartz extend object support independ proc acm sigmod intl conf manag page roman specif geograph data process ieee tran knowledg data organ resourc model adapt offic system organiz proc dexa page scior acm transact inform april stonebrak infer knowledg base manag system integr artifici intellig page springer stonebrak hearst trend expert data base intl conf expert page menlo su constraint object intl conf larg data page lochovski data model yoshikawa proc intl symposium advanc technolog integr oct japan ullman principl system comput scienc kerschberg system develop life comm rj de jong identif object role object identifi technic report faculti mathemat comput vrije decemb rj de jong pa dynam model logic cc woo fh lochovski commun intellig inform intl intellig cooper inform list class definit bridg layer bridg layer implement class definit essenti method shown sake class class public class rule public int char int int int class public int state state int int int scope int int visibl int int visibl int int visibl int int visibl class public int int int int class public role store memori static class hierarchi implement requir dynam creation delet class problem lead adopt class instanc class imag instanc class object primari data structur object cach potenti basi implement transpar persist object store instanc class object role instanc nobl role
DB/824 3 informatica page web agent mainten academ contact norri institut inform switzerland inform extract edit vladimir juli novemb novemb describ internet agent continu gather inform web document order maintain local ensur currenc specif detail agent maintain inform academ project public agent oper driven combin extract profil specifi inform extract web document local specifi contact interest agent detect updat inform confid level automat updat local introduct world wide web major sourc inform area interest user typic spend hour search web updat document academ technic analyst econom data comput enthusiast softwar product version requir time download inform effort organ conveni form assist user task fetch work inform publish web internet agent gather inform store local client user queri process inform conveni agent oper driven combin extract profil inform extract web document local entiti interest user access local paper extend version paper base inform extract web proc system agent maintain ensur currenc approach gener agent dynam specif applic describ oper agent inform extract process academia system support academ automat track contact inform research telephon number email address inform project public problem maintain contact inform person current peopl chang job organ chang telephon system essenti user notifi chang time user contact inform goal academia provid form address book updat automat base inform extract web document area web import sourc inform project public web publish medium mean articl internet informatica page norri confer journal book academ interest articl report research field period web site check updat public list download public interest goal academia maintain inform public project research updat automat base inform extract web document goal academia maintain inform confer interest mean web site list confer user confer interest agent search web page extract kei inform locat paper submiss date store inform user academia academia agent run period search web frequenc search user creat entri research user effect specifi domain interest agent inform search academia agent divid person gener inform peopl public project confer inform confer inform extract process control extract profil specifi inform extract web document base combin keyword term match proxim measur confid measur extract agent calcul reliabl score extract inform item reliabl confid determin inform agent updat directli consult user academia combin techniqu develop research area extract inform web document system develop queri dynam gener web document languag extract pattern enabl structur object construct inform html document system work fix web site pattern agent base extract fix pattern extract inform form web page agent extract mechan extract inform public project agent gener pattern base structur individu item found repeat item html list tabl similar techniqu compar shop agent extract inform specif site store agent train keyword learn pattern announc agent find page explicit train keyword work complex retriev focu present web page user extract profil drive retriev find page interest main task extract inform page section describ compon oper academia system section detail extract profil extract process section describ specif process extract inform public section describ confid valu assign extract fact form user interact agent discuss section conclud remark section academia system academia reduc work academ find updat inform research specif applic explain gener extract note gener concept system applic aim agent dynam configur figur show compon academia informatica page academia system work flow www page user info queri academia search consult set store agent figur compon academia academia implement om manag system norri om system graphic full queri languag method support oper user download document ftp system support url base simpl click url view web document send email internet browser netscap gener web browser om academia access gener internet browser netscap commun internet explor kei contact inform store consist person identifi address gener start point agent search updat person agent search compon find relev web document person store gener fact person photo inform research activ includ titl url lead abstract public project titl url page inform project user access directli retriev process inform academ contact academia agent servic inform extract web document maintain ensur currenc agent updat consult user perform updat level autonomi agent term perform automat updat control user confid threshold confid level inform found agent updat directli confid threshold set user control agent set includ agent run depend applic term frequenc updat import current extract process agent term extract profil applic system profil provid part system user adapt search addit inform interest finger inform add extract pattern profil inform section extract profil explain detail academia agent run background period user read person determin search domain agent find find search compon combin metacrawl etzioni home page finder al search argument person relev document found agent perform search page return search compon informatica page norri case inform consult user decid inform reliabl store note experi combin search engin result implement search compon test result page usabl homepag locat agent start extract inform page referenc page search homepag basic wai search case agent search keyword extract profil user defin set agent inform found proxim keyword url keyword link homepag detail extract process format extract profil section keyword search prove effect academia find gener inform person potenti link page public list project descript search find inform public project inform repres list extract keyword approach public frequent repres web document html list item give public inform url download document keyword occur explicitli agent detect recur pattern html page indic occurr list base text item tabl font structur inform detail search section agent start search potenti home page repeatedli interest link search inform link collect search list link lead gener public research topic agent search link search techniqu defin type link futur version academia possibl user alter search techniqu search confid comput piec inform found base reliabl extract pattern find item extract profil level corrobor contradictori inform found telephon number found level confid high phone number found confid low cv calcul end search predict item found search agent start interact fact cv greater agent write fact record action log stage user access examin agent action fact cv agent consult user decid fact store agent store user futur avoid repeatedli user question user gain confid reduc threshold give agent greater autonomi note agent store meta data web document search updat time length page agent meta data futur search detect page chang page relat person repeat extract process extract profil describ extract profil detail assist explain issu led solut mean exampl profil consist set extract pattern specifi keyword academia informatica page search term form inform proxim support keyword cv gener idea extract process base pattern agent search page keyword extract pattern keyword inform seek locat vicin wai inform found case person phone number keyword phone number follow phone number consist digit special charact number immedi keyword background difficult extract string phone number exist find titl person keyword found titl person reason lead specif extract pattern user add pattern refin exist part extract profil academia agent shown tabl line profil correspond extract pattern specifi keyword addit inform agent determin fact form found extract fact extract pattern term number attribut option start explain attribut shown tabl attribut keyword specifi type inform extract agent distinguish main categori inform refer inform textual inform textual inform consist fact extract type string extract boolean return indic specif term locat determin titl simpli specif design front person type includ date imag refer inform consist link web document interest direct search main link gener page public page research page link web page perform determin posit keyword web document keyword found usual text text belong link titl page header gener insid link refer row tabl keyword found link indic refer web document list public possibl found determin local inform extract term maximum distanc keyword posit number inform search neg number inform occur keyword mean result distanc keyword attribut fn surnam person proxim keyword extract pattern tabl specifi surnam person charact keyword check design belong person inform seek person extract pattern specifi occur attribut mean occur ml xl determin length result inform type string cv extract pattern attribut percent cv section agent extract inform store case extract pattern tabl extract inform keyword store titl person object case refer inform informatica page norri keyword fn ml xl obj prof titl prof titl public tabl extract profil keyword ml xl obj email email phone phone finger finger tabl extract profil store obj unspecifi tabl show option attribut detail format valu extract note omit cv happen specifi charact occur string tabl expect form telephon number find phone agent string charact start distanc charact keyword keyword occur usual text result phone number length case email finger charact set result type format valu extract email agent automat string space part extract profil tabl show support requir proxim main sk keyword occur web document specifi maximum distanc keyword mean distanc extract pattern tabl link page gener fact specifi keyword occur text belong link distanc occur link text line specifi begin charact regular text extract link web document gener interest found maximum distanc charact extract pattern tabl find link page specif inform project keyword occur usual text charact link distanc charact assum link web document list project line im lead project call link home page extract pattern agent extract link search result web document project inform specif valu shown tabl led good result chose form web page relev inform adapt proxim valu base experi detail inform extract profil extract process found approach led good solut extract gener weak lead public research topic reason li fact academia informatica page keyword sk ml xl obj home page work project tabl extract profil inform possibl list form list structur vari agent detect structur dynam achiev extract section extract public describ extract detail agent extract inform public start assum agent locat document part deem inform public agent form pattern repeat entri html list tabl structur agent detect recur find structur item assum find list item inform determin item inform author titl figur public list respect agent ideal term extract inform entri shown structur note case occur entri field public entri date larger pattern small differ entri agent respect irregular decid defin pattern entri tag stand separ part entri link begin end tempor steiner inform eth april proc int conf australia program environ inform eth march proc austria figur part html public list public referenc page postscript version agent posit person question figur public author found agent assum author locat part person agent assum person author entri situat peopl give list public home page explicitli state author confid evid assumpt true agent extract titl public observ titl occur begin informatica page norri item posit titl twenti charact punctuat charact comma agent statist extract titl entri cv reflect reliabl extract string titl base observ occur titl twenti charact lower cv agent examin link entri link store interest postscript file abstract topic note html document public list gener automat produc regular entri term html command facilit extract process lead reliabl result extract inform research project abil agent extract inform good public main reason inform research project free head page inform research topic project confid valu agent extract inform web give inform agent determin reliabl inform state previou extract pattern cv measur reliabl extract inform item isol comput confid measur extract agent context inform found occurr corrobor conflict inform refer cv extract pattern condit possibl fact occur keyword idea cv adapt certainti factor defin mycin shortliff main differ confid valu rang certainti factor expert system mycin rang cv rang exist complet certainti fact found reliabl user set threshold cv fact reach order reliabl user complet certainti found pattern led reliabl fact decid percentag valu cv reliabl extract pattern term number case pattern lead correct fact percent mean case fact extract pattern consid reliabl half case extract result reliabl inform suffici effect extract pattern calcul cv fact case extract pattern lead correctli phone low confid page analyz inform person question cv fact depend cv context page assign cv fact page belong process person possibl page inform person initi page obtain url store alloc cv indic page inform person question receiv final cv occurr multipli cv keyword extract pattern page found page process search proce cv multipli cv keyword led academia informatica page link page cv page link found end search page fact found inform consid reliabl cv fact sum cv equal fact note cv percent fact found effect merg similar fact select highest cv max case fact depend fact titl public titl abstract public extract process yield unequ valu titl abstract substr agent assum titl public correct titl associ abstract cv public titl lower extract abstract cv abstract titl updat introduc show calcul cv fact found complic depend factor includ context search type fact extract scope paper present detail confid rule fulli discuss import point inform web free true updat agent unabl detect inform wrong case correct inform user interact import fact trust agent interact user easi user monitor agent action control level autonomi term automat updat provid simpl graphic interfac user instal agent paramet reliabl threshold period execut user gain confid reduc threshold give agent greater autonomi agent fact remain cv threshold agent consult user open interact window displai person inform found cv user instruct agent store drop fact agent record user avoid repeat question futur mean user involv long tediou interact futur consult minim occur peopl enter web page chang significantli order user inspect action detail maintain record interact term updat record web page search mention user inspect updat extract profil stage user manual chang cv extract pattern add extract pattern agent find addit inform direct updat gener recommend drastic consequ oper agent updat extract profil gener perform intend develop configur tool assist user tailor specif applic system academia requir develop system applic domain work show import role autonom agent futur informatica page norri user benefit wealth inform internet requir invest vast amount time effort experi academia show handl larg amount data compar time produc good result test set extract approxim percent correct involv agent search web page total megabyt focu improv gener oper agent reduc search time cach techniqu retriev web page system compon improv order reliabl inform extract part includ learn techniqu enabl agent improv perform agent capabl action give feedback user user inform keyword lead extract user adapt delet keyword attribut extract profil gener system support rapid develop applic system dynam configur aim provid system configur type search inform web resourc usenet refer armstrong freitag joachim mitchel learn world wide web proc symp inform gather distribut california buchanan bg shortliff eh expert mycin experi stanford heurist program massachusett doorenbo etzioni weld scalabl agent web proc intl confer autonom marina del california hammer cho crespo extract semistructur inform web technic depart comput stanford california mainten contact internet agent master institut inform eth zurich menczer adapt retriev agent heurist neighborhood inform discoveri machin proc intern san california norri mc om framework data manag informatik journal swiss june norri mc om data manag system technic institut inform eth zurich norri mc extend entityrelationship approach data manag system proc intl confer texa selberg etzioni metacrawl architectur resourc aggreg web ieee shake langheinrich etzioni dynam refer case studi homepag domain proc sixth intl world wide web santa california
Agents/825 1 split clone agent fan turku centr comput scienc technic report split clone agent fan turku centr comput scienc technic report isbn issn abstract clone agent balanc load discharg comput task clone reason transfer smaller clone agent bulki agent mobil comput simpl bdi agent model formal establish semant agent gener inherit cation de ned kind clone mechan identi properti clone mechan relationship implement issu discuss agent mobil inherit research group program methodolog research group introduct kind mechan agent agent network individu avoid situat agent agent function leisur mechan ma facilit special kind con agent regist servic knowledg facilit facilit balanc load local agent control agent cooper autonomi facilit bottleneck ma extend classic agent architectur furnish agent capabl idea clone comput scienc di erent wai inherit mechan oo paradigm paradigm kind object attribut ned exist clone procedur program pro compil parametr polymorph elimin oo languag clone agent gener concurr agent instanc mental state behavior discharg comput task clone instanc simplest clone deep copi compon templat agent identifi result entiti fresh agent identi er clone agent ecient exibl ancestor prefer kind clone clone agent case agent transfer site desir comput part servic knowledg sucient complet comput task mobil agent consum fewer network resourc transfer smaller comput logic site larger amount data transfer date enjoi full bene ts permit kind agent transfer world restrict perform improv agent split smaller secur agent vulner wai split agent smaller depend constitut agent model question establish simpl formal bdi agent model de ne di erent kind analyz properti relationship agent model de ned section formal de ne semant agent gener inherit cation bdi agent pertin import clone mechan section section give di erent kind clone mechan properti section concern implement issu conclud remark section agent model agent system situat dynam chang continu perceiv react extern stimulu base intern mental state desir intent primari mental attitud ascrib captur committ aspect set plan behavior pattern agent knowledg agent true fact world accumul belief state agent ect model perceiv environ coexist agent goal speci es desir end state goal compon make agent predic logic speci cation languag goal vector predic set formula form wg formula test goal pre xing achiev goal deduct structur pair set set infer logic relat set formula mean prove rule ag denot set agent question belief goal compon agent model deduct structur de nition agent knowledg compon belief compon goal compon fk fk fk de normal axiom schema modal logic formula di erent interpret depend distinguish write belief goal agent close axiom includ infer rule necessit rule exclud avoid notori logic omnisci de nition deduct structur deduct closur deduct closur de nition deduct structur set kernel minim subset hold function natur number de ned induct collect set formula ig de ned de nition collect distinct set safe split greatest split safe longer safe split kernel split exist kernel greatest split feasibl logic split exist kernel split safe split fb fb gg lost split fb fb gg safe split greatest split fb feasibl logic split agent set feasibl logic split exist kernel split jsj size set agent conjectur jf jf jm jm show hold exist uniqu kernel split fq uniqu kernel split jf jf jm jm behavior agent determin plan repositori plan set trigger event guard condit plan built primit subplan commun primit ow sequenti denot plan prioriti util ct ls intern trigger export plan call plan end failur event label call di erent export event trigger guard condit deduct closur current base belief set plan bodi appli plan denot ct ct set pl pl pl act primit subplan call commun primit occur set plan ascrib agent de nition plan bodi graph act ow relat plan cluster flg collect set de ned oper object denot xpoint de nition agent minim cover split plan set de ned fc jl feasibl behavior split agent denot set feasibl behavior split act set primit action occur plan librari pa agent jm jm current activ focu ground instanc plan bodi ect choic commit agent current mental state set intent agent denot bdi agent denot agent abstract empti agent ag oper semant bdi agent agent receiv stimulu activ task inform coordin intern invok event delet ad belief instanc pertin plan invoc event coincid stimulu collect form select plan set plan instanc committ feasibl context sati ed current knowledg belief collect uni cation append intent set execut intent ect mental state gener make system evolv inherit agent creat inherit agent agent nomenclatur term subag freeli subag creat attribut simpli wrap ascrib inconsist mental state strategi rede ning appli resolv kind discrep case attribut ad creation result origin behavior preserv inform ad viewpoint belief exist contradict exist acquir acquir inform exist part incur discrep abandon schedul problem transfer rede ning plan deserv attent claim behavior veri ed behavior subag result failur plan subag prior suspect inherit mechan introduc agent smoothli system veri ed behavior succe context algorithm rede ned plan optim context subag feasibl solut ascrib higher prioriti rede ned plan applic domain strategi permiss order subag identifi sourc inherit inherit element wrap tag creation subag tag set atom tag identi chang dynam tag uniqu empti tag tag set tag construct tag tag tag tag element tag de nition element tag de ned set js sg extract function de ned tag tag tag set ft js sg function de ned tag element tag tag set fs js sg lemma tag set jt complet split jt tag formula tag forgotten set sg overridden tag set di erenc overridden priorit set union de ned set denot reject set de ned set de nition deduct structur function respect de ned fpg de nition plan set function respect de ned sl sl jl sl sl jl de nition agent hk reject set de ned set agent construct function sh singl inherit de ned hk exist agent share behavior exist agent claim subag de nition agent hk hk agent cation function sid singl inherit de ned hk agent furnish attribut identifi de nition set ag fusion function fs ag hk ha pa de nition deduct structur denot weaker denot ld agent hk hk denot set agent denot set agent denot ja ja weak associ agent singl inherit theorem agent hk set consist ha result consist set appli function theorem hold inconsist fp fq belief compon result agent left half part theorem belief compon result agent half part multipl inherit power mechan agent enrich versatil entiti combin attribut exist agent complic creat agent multipl inherit singl inconsist result super di erent super agent singl multipl prefer subag exist contradict super agent contradict origin di erent super discrimin counterpart ascrib di erent analog situat servic provid major function prior subsidiari ful lled concurr de nition set fa ag hk reject set de ned set agent construct function mh multipl inherit de ned hk agent identifi subag set exist agent de nition set fa ag hk hk agent cation function mid multipl inherit de ned hk similar weak associ multipl inherit theorem set ag set ha theorem set ag set agent clone simplest agent clone deep copi compon assign fresh identi er result entiti de nition agent hk prototyp clone function ps de ned hk identi er result prototyp clone clone agent ecient exibl prefer kind clone templat de nition agent hk logic split function ls de ned lemma agent hk lemma mean element logic randomli chosen split logic slice set agent belief compon feasibl logic split extend set de nition hk ag hk ag belief denot weaker belief denot ld set ag agent weaker ag denot lemma agent hk ag ag consist fs fs restrict ag theorem ag fs proof agent set ag agent prove fs fs fm free al fs al fs nition ff fs ag fs fs fa lemma fs fs fm free al fs al fs fs fs ff fs ag nition de nition agent hk fp bs ha behavior split function bs de ned fb lemma agent hk element behavior randomli chosen behavior split behavior slice set agent plan librari feasibl behavior split bs extend bs bs set de nition hk ag hk ag denot weaker denot set ag agent weaker ag denot lemma agent hk ag ag fs fs restrict ag theorem ag al fs proof agent set ag agent prove fs fs fn free al fs al fs bs nition ff fs ag fs fs fa lemma fs fs fn free al fs al fs fs fs ff fs ag nition bs split agent result clone plan relationship logic split behavior split theorem agent bs tag identi ad element mental behavior compon agent creat inherit append compon inherit part hold reject set function tag disappear compon result agent exist extrem case tag disappear compon result subag case practic subag inherit agent bene reason contribut identi er super agent occur tag subag agent hk split agent inherit ad de ned behavior introduc ect result slice ha pa knowledg plan compon result clone ad de ned lost clone tag call kind problem featur interact counter behavior preserv behavior preserv problem oo paradigm simpl text input window user text agent gener singl inherit behavior cut past de ned di erent oper chang displai style select text ned text gener cut past ned ensur select text cut past di erent style text lost note version cut past di erent split speci ed encapsul featur preserv behavior de nition agent hk split function rs de ned ha pa pa set ag rs extend lemma agent hk de nition agent hk weaker hk denot ld ld ld agent set ag weaker denot ag ag consist fs fs restrict ag lemma set ag set result set agent appli split function weaker shown lemma intent set agent agent speci ed prefer result lemma set ag ag theorem ag ag fs proof ag prove fs fs nition ff fs ag fs fs fa lemma fs fs fs fs ff fs ag nition clone relat de set split jaj explicit clone stand perspect origin agent clone di erent window interfac origin agent view provid di erent function servic agent implicit perspect explicit di erent explicit clone combin jaj di erent perspect jaj clone result agent split relationship rs rs complic bs ls agent ii direct chang depend chosen split jl chang depend chosen ideal case logic split chosen angel ideal stronger relat weaker relat theorem agent analysi relat rs maxim split chosen angel concern plan librari theorem agent implement issu clone mechan easili agent implement compar classic agent capabl di erent architectur pertin clone mechan virtual shell clone ident origin agent embodi di erent entiti clone ident correspond real entiti ident correspond virtual facilit manag result clone kind virtual entiti state plan librari mental state mental state direct plan librari behavior includ virtual di erent clone subset origin agent plan librari agent societi form clone evolut trace agent clone intent clone agent empti virtual shell fusion clone consist entiti ident evolut version clone fusion kind viewpoint mental state clone chang split super agent exist con ict mental state clone clone successfulli ful lled respect task initi intent super agent clone point fusion clone acquir knowledg world mental state agent evolut version simpli recov knowledg map virtual shell deriv current mental state clone coordin clone mechan make agent run cientli comput unit execut part function origin ecienc virtual shell coordin clone coordin individu clone longer run combin function demand agent virtual shell schedul candid clone case clone fail messag relai deleg forward mechan implement properti share di erent entiti object knowledg origin question forward wrap trace direct ancestor repeatedli question solv context origin object virtual shell agent charg messag forward clone meta virtual shell local societi extern virtual shell discharg clone behavior deleg set clone connect clone virtual consid global entiti clone agent identi insid behavior clone contribut part agent export behavior agent deleg clone virtual shell clone agent distinguish normal agent independ clone ident clone agent transpar agent clone claim independ agent acquir ident permiss clone agent origin clone agent contract kind dissoci clone back control clone trace inherit attribut agent trace tag sourc clone clone histori knowledg base record pertin agent isnt direct relat individu clone result split action interact coordin common virtual shell migrat architectur clone mechan mobil agent prohibit clone agent claim independ agent transfer comput site clone contract back pertin inform acquir extern comput context fed back clone fusion analog principl agent clone clone individu part gure entiti agent descend clone form virtual agent tree structur combin clone relat evolut trace agent shown main trace line success version agent clone point version fusion point success version version evolut trace clone clone mechan softwar architectur system di er larg construct agent clone capabl facilit longer viewpoint clone agent regist clone agent clone comparison split agent clone behavior composit intellig object collect clone piec clone piec agent organ deleg deleg relat clone agent global entiti real clone piec ident transpar agent ect di erent viewpoint aliat clone intuit mean agent clone compar piec split object perspect aop agent clone piec evolut insid agent di erent clone agent di erent behavior di erent mental time give discrep fusion reason clone integr origin agent evolv version furnish inform extern robust behavior clone chang social posit permiss aliat agent mobil comput agent clone larg transfer entiti prefer discharg mobil agent clone break clone announc clone individu independ agent mobil comput unit smaller parallel comput promot clone transfer comput site time bulki agent undergo long site speci ed task ful lled main contribut paper di erent clone mechan agent pertin properti clone mechan relat studi formal bdi agent formal agent singl multipl inherit clone logic behavior prototyp identi ed bdi agent logic order avoid unnecessari cooper di erent clone incomplet de cienci mental close logic origin belief compon split unit fb ascrib clone case queri hold bene ts logic split local infer simpli ed speed ow number logic formula belief base result clone global inform inform topolog concern multiag essenti agent goal intent result clone divert clone agent exist potenti behavior disappear belief clone agent fulli inherit clone behavior feasibl behavior split plan librari construct carefulli preserv integr result plan avoid unnecessari cooper di erent clone plan clone agent fulli inherit order clone cooper smoothli smaller plan clone respond behav determinist choic import clone suitabl mobil comput unit frequenc cooper clone solv complex problem split valuabl bene ts logic split behavior split acquir stone origin agent divid inherit sourc element result set clone set super agent current clone agent chang gener carri make mental state clone agent consist creation ad mental state de ned behavior project compon clone split stage futur properti perform issu explor split refer perspect complex aggreg intern confer object orient inform page dec uk split disciplin deleg object confer objectori applic san usa acm sigplan notic iter type analysi extend messag split sigplan confer program languag design page methodolog procedur clone comput languag analysi inherit mechan program proc page georg wooldridg model agenc intellig agent lectur note vol march program european confer program finland lnc june deduct model belief pitman london morgan san ca mobil agent futur internet acm oper system review mobil agent mobil comput chapter addison weslei acm kaiser adequ test program journal program procedur proposit logic workshop lnai page bdi agent speak logic comput languag lnai page program arti cial intellig intellig theori practic knowledg engin review choic intellig vol turku centr comput scienc turku finland turku depart mathemat scienc abo depart comput scienc institut advanc manag system research turku school econom busi administr institut inform system scienc
IR/826 5 retriev www activ logic inform retriev world wide web activ survei problem definit anderson perli intellig system institut advanc comput comput engin depart comput amir colleg usa abstract inform world wide web billion page cover area human difficult provid effect search tool inform access peopl access web inform main kind search browser queri engin form set keyword show topic process tent time consum satisfi user inaccur irrelev result support express inform return high qualiti search result web search tool system reason uncertainti flexibl recov irregular reason involv activ logic formal develop applic challeng mind motiv design thought factor support flexibl human reason place time activ logic famili infer engin explicitli reason incorpor histori reason run characterist make activ logic system flexibl tradit ai system suitabl reason report survei recent advanc machin learn crawl problem relat web review continuum learn highlight specif challeng distinguish inform retriev hypertext domain summar kei area recent ongo research concentr search final inform integr base activ logic framework web inform web machin activ logic dr visit activ logic comput scienc colleg dr dr de recherch en artifici intellig infer system universit discuss challeng inform retriev integr page content inform retriev www activ logic titl page introduct search engin web crawler portal engin direct list search engin sequenti search concurr search web analysi web content analysi similar similar string distanc model statist word model document compon structur model analysi link structur web rank algorithm algorithm applic hub author page hit algorithm hit algorithm applic machin learn approach inform retriev learn naïv classifi learn relat learn learn label unlabel document reinforc learn case base reason learn cluster agglom cluster domain specif search engin topic specif crawler recent research crawl ibm crawler cora domain specif search engin context crawler basic crawler ibm crawler page inform retriev www activ logic cora crawler context crawler inform integr environ base activ logic framework activ logic crawl refer page figur inform retriev www activ logic titl page internet host number web coverag percentag popular search engin workflow typic web crawler workflow topic portal workflow topic engin link set hub author basic oper hit classif search engin system architectur ibm show distil crawler collabor workflow train phase cora spider pseudo code assign url train data learn map neighborhood text url workflow cora spider work phase pseudo code cora spider work phase architectur context crawler pseudo code train phase context crawler pseudo code test phase context crawler tabl titl page comparison measur perform classic inform system web search engin evalu paramet search engin search languag perspect evalu paramet search engin perspect evalu paramet search engin perspect return result model measur document document similar comparison hit algorithm main categori machin learn approach exampl type search engin characterist basic approach crawl page introduct inform retriev www activ logic web rapid growth number number host number domain regist worldwid billion web page estim number web page exce billion million page byte text ad averag life span web page dai web download amount byte inform connect capabl download mega byte text number internet host exponenti figur show growth internet host largest search engin impress job extend web growth crawl abil search engin largest popular search alta vista hotbot index access web februari late figur show percentag web coverag end todai googl biggest search gather billion page cover percent publicli web page jan jul internet host number internet softwar consortium jan jul jan jul jan jul jan jul jan jul date page jan jul jan jul jan jul jan jul jan figur internet host number internet softwar consortium number queri search engin handl grown march april world wide web worm receiv averag queri dai novemb altavista claim handl roughli million queri dai number user inform retriev www activ logic autom system queri search top search engin handl hundr million queri dai percent web coverag percent search engin fast alta vista northern light googl inktomi lyco search engin figur web coverag percentag popular search engin search engin report dec web search engin creat maintain index word document find web return user rank list relev document search result result valuabl user rank method improv rank result document user inform context return rank result search engin list top access site peopl find interest inform web web continu major search engin face problem unabl index document rapid growth amount data number document publicli result index document authent requir inform search form peopl share inform search servic locat interest inform increasingli import deal huge amount web content build search limit number crawl relat hyperlink avoid irrelev part web page dec feb dec inform retriev www activ logic approach web crawl mechan improv crawler distinguish link achiev high perform measur quantit measur perform classic inform retriev straightforwardli extend evalu web search engin web user tendenc favor perform issu strongli tradit user inform retriev system basic model tradit retriev system recogn speed inform recal context inform defin ratio relev document number retriev document recal defin proport relev document retriev web user util search engin interest result displai page list retriev document measur recal rate web search engin queri trivial research recogn recal form find inform rich call author page hub page page link author page recogn tabl classic inform system web search engin speed interact time result displai page recal find inform rich call author hub page tabl comparison measur perform classic inform system web search engin method find interest inform web queri queri search search engin post user queri index keyword return rank list document navig set link target topic user select link guess lead relev document queri user clear goal suitabl user express goal explicitli boolean combin keyword suitabl situat goal gener inform topic peopl difficulti typic queri mechan search engin search engin queri tend search engin accept user queri set keyword form boolean express method return low qualiti result formul complex queri form boolean express difficult imposs peopl find natur languag choic convei inform simpl keyword convei complex search semant user express review basic concept area web inform search machin learn approach search engin crawl method section describ type search goal answer page inform retriev www activ logic search engin section review web content structur analysi section describ approach inform retriev section describ search engin crawler architectur section introduc inform integr environ base activ logic present section search engin resourc abil search inform internet search engin major web crawler web portal engin strength weak subsect review detail search engin provid servic comparison import matter user paramet compar search engin list tabl tabl show paramet perspect evalu paramet descript default search engin put keyword word concept search occur engin search default exact charact word synonym word statist type word abil exclud web page includ special search possibl engin repres put minu front exclud term truncat possibl find form word ad truncat symbol end word search abil search term valu portion entir page special kind page special site domain date search place date restrict search queri date restrict locat newli creat recent updat web weed older result phrase search abil quotat mark term kind boolean connector adj term phrase search nest support nest part search adj pie mean appl search abil cast wide narrow search set result case sensit search engin case sensit languag abil search web page languag natur languag support handl queri natur page inform retriev www activ logic tabl evalu paramet search engin search languag perspect tabl show paramet search engin manner search tabl show paramet return result perspect evalu paramet content size search part kind web resourc index topic web crawl strategi page descript big web page index search full text web page specif part link web index document internet sourc email search engin specif topic document type manner search engin web prioriti queue hub author score tabl evalu paramet search engin perspect evalu paramet web page rank method displai option suggest search similar search translat result descript paramet rank web page return result site option rank return suggest search base initi search provid suggest synonym altern search suggest search special locat web page highli relev research interest find page possibl offer tool translat result page languag tabl evalu paramet search engin perspect return result web crawler web web written spring roughli coincid ncsa mosaic web crawler seek internet page inform retriev www activ logic index gener start set predefin web address download extract url order follow index word phrase rel posit word user search index presenc phrase combin word web document web crawler store complementari inform time download rank comput header concept stand fact extract url download page figur show workflow typic web crawler web crawler start singl set default page continu download web page internet assum web graph link start page set clear theori correct aspect reach web document singl point graph path page page internet search engin cover internet page power time limit gather web document page ad daili speed web crawler gather web web page updat long web crawler crawl web crawler typic automat keyword store document found human mainten gener import role web crawler index queri web crawler find specif common inform interest search topic web crawler return thousand result word find page difficult kind web portal fit review web portal add complementari url queue contact web server crawler page download page process page index extract url updat queue inform retriev www activ logic figur workflow typic web crawler hundr commerci web crawler altavista excit googl hotbot lyco northern light popular web crawler portal web portal gener consid site organ inform topic call web user defin search criteria search web index criteria organ site topic navig find user portal human maintain larg portal work hard catch intuit categor work portal search archiv web search gener summari titl site content portal provid gener construct portal web page institut individu send search web find interest web page topic figur show workflow topic portal acquir web associ number web page page summari line full paragraph paramet construct hierarchi topic acquir web page lower level hierarchi relev hierarchi maintain human updat add relev document top level hierarchi limit number gener vari topic number subtop lower level depend topic web page research aim autom classif construct project result accept level portal effici find common unabl organ specif inform easi find rule decid crawler portal order find inform popular portal looksmart open directori project patent portal differ page inform retriev www activ logic amount inform web page inform item institut individu add web page url relev subtop engin figur workflow topic portal engin site queri natur languag send larg number search engin return result user engin method search direct list search engin sequenti search concurr search direct list search engin gather web page kind search engin send user queri directli list search engin acquir result user directli pose queri isol benefit kind search engin save time approach cover search engin user number engin rank return result search engin paramet search engin queri page human effort associ rank acquir web page extract inform index web page updat period index inform item web page schedul updat sequenti search inform retriev www activ logic kind search engin user select search engin list send user queri select search engin result shown return search engin engin wait receiv result displai result slow slowest select search engin concurr search kind engin similar sequenti search wait receiv result search engin receiv search engin displai receiv result ad gradual approach time user result search engin tip engin input support search engin convert queri standard form support search engin lowest common denomin featur determin user enter transform queri satisfi user intent engin input search find hit obscur item web point real conveni find result largest number bad result primari motiv engin web huge search engin isol cover small fraction web low recal search result search combin good return result user scheme recal engin repres cumul search result search cover entir web figur show workflow topic engin engin dogpil metacrawl page web analysi inform retriev www activ logic user queri select search engin send user queri search engin acquir result search engin duplic check repres result user figur workflow topic engin web similar link edg web page node approach overcom current limit web crawler approach web structur web guid web crawler find path approach web content perform thing combin aspect web search improv function web crawl strategi web content analysi basic content web page search engin form exact queri match document index intent shortli review document similar measur kind similar similar import identifi similar user queri document similar import find similar document document pool search engin search engin repres featur similar term vector repres term corpu repres presenc correspond term document repres presenc correspond term queri method weight term document queri local weight function binari weight weight show presenc weight global weight function simpl implement page inform retriev www activ logic entropi simplest formul similar qk dk weight term queri weight term document note binari term weight similar measur number term adapt similar measur similar document import search user find web page desir find relev document paramet determin relat hyperlink section document content tabl show model similar measur model descript method string distanc consid distanc amount differ string statist word consid frequenc word document judg similar lsi document compon structur consid structur compon keyword research paper citat parasit tabl model measur similar string distanc model distanc differ string number substitut letter requir transform string string distanc base algorithm build optim weight match letter match larger string statist word model tfidf frequenc document base word frequenc document fact suitabl set part larg number document common word comput effici stem word consid complet word stem approach porter return stem form word word weight word calcul base word frequenc number document includ highest word frequenc number document document pool distanc document calcul dot product word vector document page inform retriev www activ logic latent semant index approach vector space model document measur similar document vector vector model space weight word document semant index variat vector space model inform retriev techniqu singular decomposit reduc vector soumen chakrabarti method consid word deriv relationship word inher concept similar document calcul cosin reduc vector space document approach conceptu match exact word research show lsi result standard fewer train set document categori document compon structur model knowledg document compon structur judg similar document approach suit situat document specif special compon structur case research similar structur refer common citat paramet parasit system link referenc web page html structur referenc web page indic referenc page comput scienc research paper finder method document similar measur string distanc measur edit distanc header document common word titl document reduc distanc header common citat make estim document similar citat document analog tfidf word weight combin method document similar result final similar distanc measur accur singl method analysi link structur web web page number figur found download entir page brin figur approach link structur web find import web page determin topic page inform retriev www activ logic subsect present method link structur web rank web page differ number popular site typic homepag student number refer thing evid nobel prize assign fact highli link page page page brin page rank algorithm calcul import web page link structur web sophist simpli count number web page reason case simpl citat count correspond notion import web page link yahoo home import page rank higher page link obscur place page rank attempt good approxim obtain link structur page brin page rank algorithm page rank make link graph web page rank algorithm defin assum page page point paramet damp set set detail section defin number link page page rank page pr pr note page rank form probabl distribut web sum web page rank page brin note rank page divid evenli contribut rank page point equat start set rank iter comput converg comput page rank calcul simpl iter correspond princip eigen vector normal link matrix web page rank algorithm hour calcul rank million page page rank algorithm applic algorithm base web crawl algorithm googl search engin googl make link structur anchor text googl order paramet url highest rank crawl page rank paramet measur page import crawl page rank result user queri page inform retriev www activ logic hub author page section import page extract link structur web approach kind page identifi web page page import author special page great number link author page visit research almaden research algorithm identifi page web subsect review call hit hit algorithm hit find good sourc content good sourc link author larg hub page page author throw unrel page larg page simpli popular figur author exhibit call mutual reinforc good hub page point good good author page point good kleinberg hub author unrel page larg figur link set hub author hit associ author weight hub weight weight type normal squar sum page sum point page sum point figur basic oper hit mutual reinforc relationship express point page larg receiv larg page inform retriev www activ logic point page larg receiv larg weight page kleinberg bharat point hit work case due mutual reinforc relationship set document host point singl document host drive hub score document host author score document host document host point multipl document creat problem assumpt singl author organ author set document situat give undu weight opinion automat gener link web document gener tool web author link insert tool show neighborhood graph document relev queri topic node topic drift problem rank author hub tend origin topic run algorithm queri comput drift gener topic bharat approach solv topic drift problem web content addit graph structur node link relev queri topic calcul relev weight comput author score author score hub score author weight hub weight node hit algorithm link structur web find import web tabl show comparison approach hub auth inform retriev www activ logic hit page rank distinguish page high number relat topic relat queri hit suitabl topic driven page import measur page blindli calcul import page link queri page rank suitabl measur rank site page import perspect peopl citat estim popular highli cite site refin hit consid web page rank link structur page content addit link structur web tabl comparison hit page rank algorithm hit algorithm applic implement clever search engin ibm enhanc approach research ibm almaden center final improv version crawler research institut machin learn approach inform retriev learn improv function system algorithm method machin learn categori algorithm algorithm search comput approach improv function aspect section review approach web inform retriev system algorithm applic method briefli discuss search engin machin learn approach section machin main categori approach differ approach learner agent learn tabl show approach descript approach descript learn learner agent learn collect label train train phase agent correct answer input state test phase agent guess label case learner agent learn small collect label learn train data categori problem small collect train data provid system label train data real world problem learn learner agent set data perform expect work specif measur similar train data agent tabl main categori machin learn approach inform retriev www activ logic learn learn call classif base learn train data set data item train set label word learner told correct answer item class algorithm learn train set guess label input item test phase classif applic hypertext data domain classif import order guess relev web document crawl topic train phase agent build model set document paramet import applic classif construct directori portal web searcher find directori easier find gener inform automat construct mainten portal lead research area appli classif web ir system naïv classifi model learn assum text document gener parametr model model estim model paramet train data estim paramet classifi calcul probabl gener document class classif select class highest probabl classifi class word frequenc document frequenc stand assumpt word occur document independ word document independ occurr locat formal model wt word document cj class train frequenc document class compar probabl occur word wt document class document set probabl document gener class word document rule naïv assumpt paramet learn train data set estim probabl word wt class frequenc word wt class cj number occurr word wt document di di wt frequenc paramet calcul page di inform retriev www activ logic number class number document result show number train document accuraci classif good classif approach support vector machin classif method classif hypertext document comparison naïv classifi result show lower error score naïv context learn relat learn relat document approach extend classif problem classif web page comput scienc depart web site class relat class learn relat improv function classif enabl answer complex queri faculti learn relat page exploit hyperlink web site word statist neighborhood document addit graph structur web page augment learn soumen chakrabarti learn learn learn open interpret learn larg train data obtain human effort real small collect label train larger pool unlabel data web context train data small set label document label document goal guess label document categori review learn label unlabel document section learner agent learn interact dynam environ provid set train data agent difficult dynam inher environ correspondingli huge number state action environ learner agent told correct action told good bad action requir model measur good action agent state section review reinforc learn categori learn method learn label unlabel document expect maxim approach set label unlabel document learn classif problem algorithm train naïv classifi label document build model page inform retriev www activ logic data em class iter algorithm maximum likelihood maximum posteriori paramet estim problem incomplet data model train data miss em iter current model estim miss miss estim improv model em iter calcul class document classifi equat estim classifi paramet document equat iter continu converg result naïv error reduc care model class mixtur term distribut reinforc learn term refer framework learn optim make reward punish differ learn learner told correct action simpli told good bad select action express form scalar formal task reinforc learn set state set action transit function pair result reward function pair scalar learner agent interact dynam environ time agent select action receiv reward result transit state goal agent learn map state action call maxim reward time consid discount sum reward infinit futur discount factor γ reward receiv sooner valuabl reward receiv polici defin rt reward receiv time step start state optim written maxim π state learn optim polici specif correl function learn select action state optim polici express π γ rt optim polici select state action highest expect futur arg cora search engin web crawler reinforc learn learn find comput scienc research paper web site comput scienc depart page inform retriev www activ logic case base reason case base reason approach develop system past experi solv current similar problem type reason base past experi call case case descript experienc situat learner agent agent acquir experi interact environ cbr kind case store case success case failur case success case basi solv problem present similar failur case prevent agent repeat similar action lead unsuccess result case base reason varieti applic exampl cbr task diagnosi task medicin technic system configur plan design task case base search engin search homepag research interest cbr learn compon learn past search result past case answer similar queri futur knowledg base enhanc search result learn learner agent told correct action evalu action state train phase hypertext learner set hypertext expect discov hierarchi organ document hierarchi approach call cluster good cluster method collect similar document leav dissimilar node join root hierarchi cluster enhanc visual subsect review cluster method classic cluster method hierarch agglom cluster appli hyperlink document document repres vector space word document element vector model tfidf similar document calcul cosin angl distanc provid length normal cluster basic techniqu cluster number cluster show desir number cluster document agent select number seed document arbitrarili seed document deleg cluster document assign similar cluster coordin seed vector space recomput centroid document assign seed process repeat seed coordin stabil process document assign continu document soumen chakrabarti agglom cluster page inform retriev www activ logic agglom cluster cluster document continu merg group group merg sequenc gener hierarchi base similar formal group γ γ γ similar document defin cosin angl vector document tfidf vector space measur similar algorithm initi place document group soumen chakrabarti search engin web continu grow idea crawl entir web regular basi feasibl search engin limit point summar fundament limit queri accept user queri form set complex user easili formul boolean combin keyword search engin implicit context inform accept user queri form natur languag keyword exact rank result shown user exact keyword match method low web coverag cover portion publicli document web web coverag section highest coverag rate search engin cover percent web document long result list low relev user result search engin satisfi user relev document search engin high result list user due basic problem includ inform specif search engin search engin defin inform access system access inform web relev classifi search engin shown figur page search engin inform retriev www activ logic search engin specif document type figur classif search engin system shown figur classifi search engin search engin search engin search engin special exist kind search search engin focu specif document type search engin focu specif topic comput tabl show search categori search engin exampl categori northern light search engin cora type search engin bdi agent specif topic search ibm context engin tabl exampl type search engin review section search engin web crawler crawler web graph download web index process index download queri manag handl user queri return relev document index user report focu crawl mechan search engin focu crawl crawl approach domainspecif search engin crawler visit link web crawler reorder link queue predict likelihood lead page relev topic search divid specif topic specif document type goal crawl crawl page relat task topic crawler goal fetch page task crawl document type page relat topic cora find comput scienc research categor document specif paper specif topic scienc search engin page domain specif search engin specif topic inform retriev www activ logic type kind crawler crawl specif type search engin categori ahoi homepag search servic base crawler special tune locat homepag crawl approach search introduc soumen chakrabarti al describ crawler crawler maintain page specif set topic repres narrow segment web distribut team special manag entir content web collect index access web document answer crawler analyz crawl boundari find link relev avoid irrelev region web crawler select seek page relev set topic page result person web world wide web topic consol focu system exemplari document page function result save hardwar network achiev respect coverag rapid simpli crawler detect page focu crawler crawl entir web ideal crawler retriev maxim set relev page simultan minim number irrelev document web crawler offer potenti solut currenc problem standard exhaust crawl supplement crawl categori content chakrabarti al crawler concentr crawler rest report refer kind recogn basic work crawl state soumen chakrabarti al present crawler approach web resourc discoveri work larg almaden research center cora comput scienc research paper search engin reinforc learn guid crawler renni mccallum justresearch carnegi mellon origin initi work approach crawl context graph build model context topic relev page occur web subsect survei approach review basic crawler final approach subsect recent research crawl crawler fish system fish inform retriev system crawl hypertext document web method follow link web document search engin adopt assumpt assum relev document topic link structur fish page inform retriev www activ logic link page relev topic search identifi relev document base keyword regular express approach crawl web paramet reorder link queue heurist measur identifi page import similar drive number page point page locat approach earlier section web structur analysi crawl approach resourc discoveri introduc topic focu repres set document set keyword system main distil crawler classifi make relev judgment page decid link distil determin central page determin visit prioriti base connect analysi variat hit algorithm soumen chakrabarti improv version approach ad classifi call task classifi assign prioriti unvisit url classifi templat classifi html tag dom object user feedback learn classif site map applic crawl crawler start point web graph relev document approach vector space model comput similar document focu topic page inherit discount score origin relev anchor text url text judg prioriti link follow relev page approach improv fish cora comput scienc search engin reinforc learn guid crawler crawler train test train phase learn map text neighborhood url scalar url discount reward receiv url reward document access link test work assign scalar unvisit url neighborhood text estim sum reward obtain url crawler pick url prioriti queue url order estim sum futur discount reward strength approach consid futur reward link crawl likelihood crawl link document lead reason amount document high describ approach detail section kind crawler consid hidden aspect web goal crawler access huge amount hidden inform web search form approach system call web model form set pair determin suitabl input valu base label form layout crawler perform larger form descript label finit context graph guid crawler research approach state assign proper credit link page inform retriev www activ logic crawl import problem crawl page lead level deep start page address problem crawler search engin find construct context graph page set train set classifi assign document class expect distanc document graph classifi construct seed document show expect distanc target page naïv classifi layer link lower distanc target document review kind crawler section web topic manag system approach crawl crawler download page relev document document system repres vector model space relev topic comput techniqu model crawler url includ keyword topic set threshold branch web stop url branch relev score area fall threshold evalu crawler report initi set classifi topic built evalu crawl document research approach good crawler remain vicin topic evalu crawler base abil remain crawl session strategi crawl prioriti queue order link similar focu topic page found order page score method web structur analysi section neural network learn text link result research show infospid place final lowest effici conclud method gener search crawler learn link structur web detail approach find featur page make link lead page page url structur link structur web combin consid featur research approach claim learn link structur web gener framework assum predefin structur learn link structur statist model result research show combin featur model effici isol approach robust start point web ibm crawler crawl approach topic specif resourc discoveri soumen colleagu almaden center focu topic system repres set page provid user system system page inform retriev www activ logic topic taxonomi user mark document good select focu topic system main classifi make judgment relev crawl decid link page classifi extend version naïv classifi compon distil evalu central page determin crawl prioriti link distil bibliometr concept hub author page approxim social judgment web page qualiti page calcul hub author score web page extend version hit algorithm crawl link page highest hub score hope find author compon system dynam crawler crawl web prioriti queue system work train test train classifi train label data relev focu topic train data set acquir exist search engin open directori project figur show architectur system classifi web retriev document process target document index learn train phase topic taxonomi web crawler figur architectur ibm show distil crawler collabor cora domain specif search engin cora search engin automat classifi extract comput scienc research paper web paper cora organ taxonomi field author titl extract paper bibliograph inform extract bibliometr analysi perform creation mainten cora reli heavili artifici intellig machin learn techniqu task broken spider refer match classif page document pool distil prioriti queue inform retriev www activ logic report concentr crawl methodolog cora divid spider task train test figur show workflow cora spider phase strength reinforc learn formal measur util action give give benefit futur reinforc learn agent present delai benefit learn map action scalar indic sum futur discount reward expect execut action make reward valuabl sooner encourag effici spider document reward action hyperlink state bit vector indic document remain action discov state includ current page agent crawler jump url number action larg depend document spider visit kei featur spider make reinforc learn proper framework defin optim solut perform measur term reward environ present situat delai renni mccallum train phase involv assign valu hyperlink train learn map text valu train data target document reward comput scienc research paper web page comput scienc depart shown figur assign url sum discount number reward obtain url futur strategi futur reward comput map text cast regress problem classif discret hyperlink valu train naiv classifi neighborhood text figur show pseudo code map text train phase figur show pseudo code map neighborhood text url train data train data set web class comput hyperlink learn compon figur workflow train phase cora spider page word pair train class determin number classifi inform retriev www activ logic hyperlink crawl strategi hyperlink directli lead target crawl strategi futur rt γ futur discount number reward step figur pseudo code assign url train data pair place neighborhood text hyperlink bin train naïv bai classifi text bin train bin specif rang figur learn map neighborhood text url test spider crawl web follow link higher estim reward figur show workflow work phase system crawler start homepag comput scienc depart research paper target document figur show pseudo code system work phase identifi target document web html document retriev document target document hyperlink extract document process process target document index web crawler figur workflow cora spider work phase page hyperlink neighborhood text prioriti queue naïv classifi learn train phase bin probabl gener text bin calcul url inform retriev www activ logic download document hyperlink highest document target store document pool process index extract url send anchor neighborhood text naïv bai classifi probabl gener text neighborhood text class naïv bai calcul url probabl gener url text bin produc naïv bai classifi bin insert pair prioriti queue crawl figur pseudo code cora spider work phase experi show direct spider time effici spider base effici smart spider explicitli model futur reward context crawler context crawler approach crawl build context graph web page show page link page web link guess distanc page target crawl web page distanc target page research approach major problem crawl perform credit assign document crawl gain pursu crawl path ultim yield larger set valuabl page address problem present crawl algorithm build model context topic relev page occur web context model captur typic link hierarchi valuabl page model content document frequent relev page algorithm leverag exist capabl larg search engin provid partial crawl capabl algorithm show perform improv crawl effici standard diligenti al recogn work process crawler train test train phase user provid seed document relev topic seed document backlink gather search engin level gather page assign specif layer distanc seed page layer includ document specif distanc target document seed document lai layer set naïv classifi train document layer classifi learn document specif layer page inform retriev www activ logic test download page classifi classifi estim distanc target assign queue layer crawler crawl url queue smaller number figur show architectur crawler figur show pseudo code train test web seed layer document class web crawler class maker figur architectur context crawler figur pseudo code train phase context crawler figur pseudo code test phase context crawler page url document ad queue queue queue queue document seed page construct context graph level assign document layer distanc seed document train naïv classifi layer document layer download document url smallest number queue empti jump small number document classifi document train naïv classifi estim distanc target document target document class store process assign url document queue estim distanc target document assign estim document layer inform retriev www activ logic basic crawler section basic approach crawl approach ibm crawler context crawler detail previou section tabl show fundament characterist crawler comparison ibm crawler cora context crawler type input exemplari document web site seed document train data classifi relev document web site page context graph seed document page learn identifi target document map neighborhood text url scalar estim distanc current page target page target document html file comput scienc research paper file html file identifi target document method train naïv classifi algorithm identifi accuraci train naïv classifi tabl characterist basic approach crawl approach strength major problem highlight abil disabl detail ibm crawler summar problem crawler fix model ibm crawler fix model relev class classifi evalu topic relev document adapt classifi document mark relev classifi updat classifi ensur flexibl classifi simultan corrupt classifi difficult model futur reward major problem face crawler learn set document lead reliabl highli relev document word model futur reward link home page comput scienc depart relev link home page eventu lead home page learn home page research find valuabl target page lack comparison result result report paper approach compar result portal open directori judgment qualiti gather page approach hard exemplari document focu topic form high qualiti document relat topic hard user inform retriev www activ logic cora crawler summar problem crawler slow initi main reinforc learn crawler learn set document lead document level order learn set cora repeatedli crawl substanti part target web site learn phase repres web site web site server document repeatedli crawl learn construct optim path target document approach place burden user repres web difficulti target page site start web site approach find target page start web site leav target page web site unabl find document level start page report result show find target document hop current page word url map set neighborhood word url farther jump larg gener learn context crawler summar problem crawler requir link major limit approach requir link exist search engin reason fraction seed set limit layer effici crawl learn document distanc target page set naïv classifi learn document jump difficult heterogen varieti web page found distanc target document inform integr environ base activ logic framework activ logic kind develop formal mechan model ongo process reason unlik tradit logic calcul final set drawn initi set monitor set time special persist rule theorem α present time impli time special rule knowledg base theorem α negat theorem consequ carri forward infer activ consist formal languag infer applic rule depend formula proven true static formula belief set gener current belief subset formula proven believ proven subsequ reject activ logic page inform retriev www activ logic situat maintain toler base activ logic famili infer engin incorpor histori reason run time activ logic record reason time prior current time continu reason time reason record mark time occur time activ logic record passag time discret time slide forward system run conveni regard current infer occur work memori transfer histori activ logic infer rule infer activ logic current time note work step thought sec correspond perform elementari cognit task activ logic term real reason characterist make activ logic suitabl domain includ time situat plan execut reason agent reason dialog includ updat context autonom agenc exampl activ logic paper present coupl simpl rule time step updat rule current enabl activ logic track step number time basic rule includ activ logic contradict present add contradict rule consequ deriv rule attempt resolv contradict reinstat time modu time time conclud note step obtain deriv inherit rule formula true iff current pose comput problem verifi form prevent time inherit rule prevent lemma contradict inherit sentenc initi present bird bird fly rule consecut page inform retriev www activ logic step step present step chang activ logic inform world wide difficult provid effect tool access inform web user access web domin click hyperlink search keyword queri user main tool locat relev resourc catalog search engin human expert construct catalog tend highli accur difficult maintain web grow growth search engin design elimin human effort catalog web site search engin consist mechan web chang index mechan queri interfac user gener queri system contemporari search engin link analysi link analysi identifi popular popular correl relev queri numer attempt improv search engin major effort regard improv web detail section critic factor implement mainten crawler conceptu model reason support conceptu knowledg reason techniqu plai import role factor activ logic base framework crawler creat engin implement role mention briefli crawler main crawler present crawler tend probabilist reason compon detail descript compon section major problem face exist crawler frequent difficult learn set document lead reliabl highli relev document defici problem hierarch page layout commonli occur web research paper languag larg number paper found home page research comput scienc depart home page find home page good strategi follow path comput scienc cs depart page gener low relev score adapt crawler base activ logic principl learn strategi build tree queri expand tree system process util compact context construct hierarchi model queri web page crawler base activ logic util page inform retriev www activ logic limit keyword crawl gener search engin indic effici web distinct stage activ logic perform crawl initi phase queri present search engin phase initi tree construct crawl phase extract page web site stage tree construct seed page process phase evalu page tree queri tree phase queri tree improv time time implement idea specif step result show queri time lead expect relat crawler implement build hierarchi tree queri crawler time link system improv queri tree result tree improv time base activ logic procedur combin crawler architectur queri tree process consid weight node repres result tree crawler result weight node calcul base node relev topic queri base tree prune expand optim tree present adequ relat result queri characterist activ logic consid phase amount lookup time prior contradictori inform detect infer initi repair default term lookup result page contrari default knowledg topic reason infer trigger occur environ base activ logic situat maintain histori toler enabl output process phase knowledg input classifi compon project aim develop method tool semant integr inform sourc web page work progress center demonstr applic inform servic environ logic reason tool formal foundat activ logic seek index maintain page relev predefin set topic effect build high qualiti collect web document search engin technolog evolut final reach point artifici intellig offer tremend review page inform retriev www activ logic evolut begin survei techniqu develop improv search engin function highlight machin learn approach inform retriev web concentr search engin inform integr environ base activ logic approach current technolog good manner provid result page refer inform retriev www activ logic statist john carol global market forecast internet usag base internet commerc market data version internet fact jan lawrenc cl search world wide scienc lawrenc cl access inform natur data mine tutori sigkdd newslett special interest group knowledg discoveri data acm anatomi hypertext web search seventh intern world wide web journal american societi inform context web ieee data engin volum number pp media media announc top digit properti site januari usabl georgia institut www user van der approach web resourc intern world wide web confer van den distribut hypertext resourc discoveri vldb kobayashi inform retriev ibm research april authorit sourc hyperlink environ symposium discret extend version journal acm page inform retriev www activ logic system cooper inform collabor human artifici pp lee gener search sixth pacif rim artifact artifici intellig engin oct search engin web robot page internet growth credit background autom construct internet portal machin inform retriev renni reinforc learn spider web intern confer machin learn mccallum build search engin machin learn spring symposium intellig agent kobayashi inform retriev select ibm tokyo research ibm binari code capabl correct spuriou insert delet russian pp intellig string comparison nec institut tech report data structur algorithm nearest neighbor search gener symposium discret pp specif term valu automat journal document pp mf algorithm suffix program practic evalu ir autom classif eighth intern confer inform knowledg automat index bibliograph journal document pp page inform retriev www activ logic mine structur inform web sixth intern world wide web kd lee autonom web agent automat retriev identif interest intern acm confer autonom pp web bulletin ieee comput societi technic data effici crawl url seventh intern web confer bharat improv algorithm topic distil hyperlink sigir confer research develop inform vol dom enhanc hypertext categor acm sr rajagopalan mine link structur world wide ieee signatur navig text scalabl featur classif signatur gener organ larg text hierarch topic vldb ak bdi effect approach intellig search spring symposium intellig agent cyberspac stanford machin naiv independ assumpt inform improv multiclass text classif support vector massachusett institut artifici intellig laboratori text classif label unlabel document machin learn reinforc journal artifici intellig pp jl morgan publish page inform retriev www activ logic reason survei futur lectur note artifici vol heidelberg page learn understand bulletin ieee comput societi technic data lee gori crawl context intern confer larg vldb pp dynam refer case studi homepag sixth intern world wide web de inform retriev distribut riao pp hypertext featur enhanc crawl topic bulletin ieee comput societi technic data crawl onlin relev world wide web search algorithm tailor web site seventh intern world wide web raghavan crawl hidden stanford digit librari technic mukherjea system collect analyz web intern world wide web srinivasan evalu web annual intern intellig crawl world wide web arbitrari intern world wide web hong regress classif intellig data analysi reason situat time phd depart comput colleg unifi formal approach episod reason technic reason situat time basic journal theoret artifici page inform retriev www activ logic traum perli practic reason plan execut activ logic workshop practic reason assess knowledg intern symposium methodolog intellig pp perli mistak intern journal human comput dialogu state domain task independ electron transact forthcom perli interpret presupposit activ context comput intellig okamoto dai life robot workshop radic agent nasa goddard space flight hr don inform integr system base activ logic intern confer manag inform page
DB/827 3 dynam data mainten fulli concurr environ xin zhang elk rundenstein depart comput worcest polytechn ma abstract data emerg technolog support make gather inform distribut inform sourc materi repositori dynam environ dw maintain order stai recent mainten algorithm tackl problem dw manag concurr data updat ev system handl schema iss concurr schema iss concurr interleav sc du remain unexplor problem solut framework call successfulli address problem framework detect concurr sc broken queri scheme conflict concurr du local timestamp scheme architectur framework separ concern concurr du concurr sc handl restrict autonomi concurr execut iss solut implement ev data wareh system data view data updat schema concurr introduct data wareh data built gather inform autonom inform sourc integr virtual repositori data wareh import applic network travel support web relat applic import consequ autonomi sourc fact sourc chang control higher data integr layer work support part grant nsf grant nsf cise instrument grant nsf grant dr rundenstein industri ibm ibm partnership gte partial support xin zhang dw manag fulli concurr environ data chang schema queri interfac cooper user data convent typic undergo schema due includ applic requir correct schema design case studi health manag applic busi type applic reveal schema inevit develop project project oper seemingli stabl data sourc undergo data updat indirectli schema propag dw data possibl schema account iss schema occur concurr mix arbitrarili data updat iss data built top iss meaningfulli handl updat view surviv period time type task relat dw manag distribut environ heavili studi area increment mainten materi view distribut iss view mainten algorithm maintain extent data data updat occur space area call view synchron concern evolv view definit schema chang iss result view definit undefin refer view adapt adapt view extent increment view definit chang directli user indirectli view synchron modul materi view mainten area attent problem concurr updat iss recent work studi concurr problem data updat schema environ approach integr exist algorithm design address dw manag subproblem va system provid protocol iss consequ enabl correctli collabor system lock iss wait mediat accomplish mainten data admit sc execut propag dw solut limit requir inform sourc cooper announc intend wait dw finish servic outstand permit execut schema updat approach overcom limit previou solut dynam data framework handl fulli concurr sc du put restrict time sc place requir cooper iss restrict cooper process manag data queri request iss updat occur concurr iss call updat concurr updat concurr du result incorrect queri result return concurr sc result broken queri process error messag provid complet solut call problem mainten concurr call problem strategi detect concurr sc base broken queri identifi conflict analyz select va algorithm literatur determin affect concurr elicit properti requir function correctli dynam environ introduc solut framework adapt architectur separ concern concurr du concurr sc handl restrict fulli concurr execut iss problem definit background schema view definit understand dw manag view mainten view synchron view adapt work figur algorithm updat view definit affect schema output set view definit updat affect view definit va algorithm adapt extent rewritten view base set vm continu updat view extent base data updat independ occur iss view definit view extent va vm sc du data manag fig relationship va algorithm definit problem concept mainten concurr defin data updat extend incorpor schema assum view defin spj queri connect dw fifo figur defin main notat sequenti number uniqu gener updat messag reach system definit denot du sc updat short updat denot receiv dw answer updat receiv dw notat mean inform sourc subscript updat sequenc number queri handl updat queri result queri result fig notat mean qr dw sc du qr fig time line mainten concurr data updat figur illustr concept updat defin definit time line messag time stamp assign arriv dw layer mean updat defin respect data layer layer assum dw schema chang sc data updat du sc receiv dw du occur adapt queri sc arriv du occur queri result arriv dw du mainten concurr sc definit type updat list tabl order easiest hardest term handl definit queri call broken queri process schema expect queri consist actual schema encount queri process type mean denot du happen handl du ii handl sc sch iii handl du iv handl sc sch sch denot du handl system denot du du tabl type updat distinguish type broken queri base type sc problem characterist space system deal problem type broken queri case data interfac relat chang map strategi desir data type broken queri replac data remov find requir inform altern sourc hold duplic data type broken queri replac data drop system identifi altern sourc data result broken queri interpret exist queri broken queri defin definit return respect empti queri result error messag framework solut architectur framework divid dw middl space figur depict modul framework data flow dw space extent dw receiv queri middl space bundl data updat dw space iss wrapper wrapper translat return queri send notif du sc iss middl space middl space integr framework divid subspac subspac call dw manag subspac dw manag va locat subspac subspac call queri engin socket va vm middl space dw du sc data flow intersect dw space space data flow data flow legend space wrapper wrapper wrapper assign time stamp queri engin updat messag queue qr qr du queri engin subspac modul dw manag subspac sc du queue fig architectur framework mean symbol figur mean view definit affect schema chang data updat evolv view definit affect view dw data increment view extent data set tupl insert remov extent view queri result return qe inform va modul requir modul view adapt view adapt queri adapt queri result subspac subspac queri engin support updat messag queue modul assign time stamp modul modul captur updat assign time stamp modul assign time stamp incom du queri base arriv subspac effect correspond level concurr control kei idea du handl local qe modul middl dw manag algorithm vm shield awar du technic report detail dynam protocol discuss justif concurr control section level concurr control detect concurr du base local timestamp assign du arriv dw detect concurr sc base identifi submit queri broken return unansw framework order separ handl concurr data updat schema level concurr control middl space lower level concurr control queri engin concurr du concurr sc type handl qe dw manag subspac support higher level concurr control manag algorithm subspac cooper order handl schema type sc render view definit undefin affect va handl low level concurr control qe subspac solv type ii problem tabl qe level local correct strategi part type iii iv problem tabl local map strategi local correct handl du queri dw modul space qe modul includ increment view mainten view adapt view recomput queri queri type queri engin local correct algorithm successfulli fix side effect concurr du queri pass queri result layer system result concurr du transpar modul dw manag subspac local correct possibl face infinit wait due correct problem strobe solut detail local correct scheme adopt proof correct scope space found map handl addit featur base temporari map tabl ad queri engin order handl concurr sc type queri result qe check concurr receiv concurr qe directli return result concurr make queri qe renam queri base resent succe renam transpar higher layer discuss handl qe found sc found qe handl broken queri anymor report error messag data mainten subspac modifi queri base break due qe modul modifi queri resubmit queri encount highli case iss continu issu qe endur long process time high level concurr control dw manag subspac vm va modul dw manag subspac final handl concurr problem effect concurr send queri qe shown vm modul affect concurr doesnt capabl handl shown va modul modul design handl concurr shown modul sc definit troubl concurr send queri space modul provid inform va modul va adapt view extent concurr sc state diagram section modul call gener version view definit account sc point view sc happen sequenti sc middl space assign random handl order distribut environ conveni determin sc happen space rel occur time issu sc happen sc autonom iss affect correct detail appli va modul view definit evolv capabl gener view adapt queri drop view longer empti va doesnt adapt vm modul sc vm encount concurr recogn fact receiv broken queri pass qe modul vm algorithm literatur havent consid handl broken put handl va modul redesign sc middl space framework pick prefer order handl sc base model handl order set sc scope paper system exist vm algorithm literatur intact vm algorithm simpli stop send du handl va modul du handl va algorithm adapt extent view discuss detail isol vm modul handl vm sweep strobe eca effect updat exist dw manag algorithm decid queri engin modul explain section fix problem du queri result reach dw manag modul du effect modul vm modul awar concept sc modul send queri space vm modul send queri space view assum view definit maintain chang mainten queri broken vm modul reset system work newli updat view definit gener care sc vm function unchang environ va modul send queri space adapt view extent view adapt queri broken va handl adapt process complet va algorithm design identifi broken queri problem dw manag concurr du sc solut framework solv problem layer architectur present paper work address data mainten problem fulli concurr du sc iss overcom limit previou approach drop restrict assumpt cooper iss process implement data solut plan run studi assess perform aspect solut acknowledg li implement ev system refer effici view mainten data page ross adapt materi view redefinit acm sigmod intern confer manag page subramanian languag relat system intern confer larg data page sept rundenstein queri rewrit intern hong juli march measur stabil data model european journal inform mohania dong algorithm adapt materi view data intern symposium cooper system advanc decemb rundenstein view mainten view synchron intern engin applic symposium canada quass widom view mainten page zhang maintain data chang inform sourc commun june li evolv view environ demo page quantifi schema evolut inform softwar januari rundenstein parallel view mainten concurr data updat distribut sourc technic report worcest polytechn dept comput zhang rundenstein dynam data mainten fulli concurr environ technic report worcest polytechn dept comput juli zhang rundenstein framework integr exist algorithm data mainten task intern engin applic page widom view mainten wareh environ page wiener strobe algorithm consist intern confer parallel distribut inform page decemb
Agents/828 1 agent vickrei auction consid special track theori felix brandt gerhard wei institut fur technisch universitat munchen germani tel abstract recent year auction import field multiag system mechan resourc alloc task assign case vickrei auction protocol prescrib individu agent interact order agreement show vickrei theoret inappropri agent particip auction process attitud econom agent make reduc profit competitor main goal maxim profit introduc agent deviat domin strategi paper present strategi bidder repeat vickrei auction intend loss fellow agent order absolut group bidder strategi evalu simpl task alloc scenario introduct area multiag system concern system technic entiti call agent interact intellig achiev steadili grow interest past decad kei problem address area autom resourc alloc task assign individu agent solut problem common practic appli result insight auction theori understood auction protocol english dutch vickrei auction vickrei auction receiv attent multiag commun appli varieti context oper comput network vickrei auction favor main requir low bandwidth time consumpt possess domin bid true valuat section auction privat remain characterist make vickrei auction protocol appeal point view autom vickrei origin formul sell good resourc work bidder make seal bid express amount bidder submit highest bid win price pai winner equal highest bid task assign scenario vickrei auction work round reason refer vickrei bidder execut task make bid express amount pai task bidder submit lowest bid win winner receiv amount equal lowest bid payoff lowest bid minu prime cost win winner pick randomli paper concentr vickrei auction task assign present result hold vickrei auction origin formul import bid seal bidder win auction necessarili lowest bid low bid gener assumpt made applic multiag system individu agent intend maxim profit care profit mean case set observ maxim delib loss rival compani minim profit practic compani accept lower profit sell good loss damag compet compani bind gain costum compani exhibit behavior attitud consid period time absolut profit import profit rel compani profit worth point behav ration act condit object maxim absolut paper investig perform vickrei auction multiag system presenc agent exclud relat problem discuss econom literatur bidder extern describ prefer bidder win auction sell patent nuclear weapon approach sole agent care bui good award task contract interest fellow profit strengthen market posit major differ paper structur section explain agent aim maxim absolut profit bid true valuat vickrei auction section formal captur attitud sketch section show impact bid strategi section introduc analyz strategi repeat vickrei auction section present result illustr implic strategi section conclud paper overview advantag disadvantag agent domin strategi vickrei auction domin mean agent appli strategi receiv highest matter strategi bidder domin strategi bid true valuat task agent bid bid privat valuat condit exist domin strategi equilibrium bidder symmetr independ valuat task impli task agent privat valu submit bid profit agent defin equat profit easili bid task optim strategi agent investig profit make bid privat suffic model agent repres entir competit care win lose draw distinct fellow bidder bid prime cost condit agent bs bid win auction receiv monei bid lose win bid win gain task price remain payoff bid case describ result paid amount monei bid monei prime lose lose reduc bs payoff bid yield profit bid true valuat extrem simplifi bid due absenc wast dutch auction attitud multiag applic assum object agent team maxim absolut profit care profit made bidder dont estim privat domin equilibrium exist independ risk neutral agent applic realist assum agent present gain monei rel scenario wise avail agent accept small loss great loss agent make develop formal descript attitud start point reason assum agent maxim differ profit gain mean profit hand agent loss hand consid equal import point view agent view captur agent intent rival achiev higher flexibl describ analyz agent object harm competitor agent put emphasi profit loss lead formal specif agent agent agent maxim weight differ profit profit competitor agent intend maxim payoff payoff profit paramet call rate rate crucial formal agent behavior obviou formula cover agent set higher hurt greater prioriti pure destruct agent defin agent balanc profit profit competitor equal import vickrei auction implic formal notion attitud vickrei auction enorm remain implic theoret investig combin equat payoff agent function bid payoff case section agent effect win price agent receiv complet depend bid carefulli adjust payoff agent simpli profit bid capabl reduc bs profit bs privat optim strategi bid figur reduc bs profit absolut minimum fig reduc bs profit minimum prime cost prefer great loss gain small profit rate bid reject gain make lose rate bid safe figur top monei lose fig aggress bid bs strategi bid bid strategi agent unrealist assumpt agent privat valu lowest privat omit margin includ avoid random result occur bidder share minimum bid strict version theorem state vickrei auction balanc bidder strategi defin equat nash equilibrium assumpt state agent appli reason singl agent deviat payoff agent lowest privat lowest bidder repres lowest bidder suffic differenti individu bidder vickrei auction sole victor possibl agent harm cheapest provid hurt highest bidder inferior agent reduc profit lowest bidder assum appli strategi defin payoff payoff payoff payoff max ba payoff bid receiv equal bid payoff diminish strategi defin equat equilibrium independ rate bidder claim strategi optim strategi reduc loss occur worst case encount mean bidder singl agent reduc agent payoff min payoff min yield minimum profit win yield minimum profit lose auction maximum minima max ba min payoff max ba min payoff min payoff due fact equilibrium point comput set bid repeat auction basi theoret foundat previou develop bid strategi realist environ gener agent privat bidder principl agent possibl figur instanc mean care auction learn previou auction paper deal techniqu reveal privat valu auction fix number repeat round balanc agent lose auction round task auction bid win auction receiv amount equal lowest privat cheapest agent agent appli domin figur privat place bid middl privat valu lose differ valu safe cut competitor profit auction round total number round high invest pai scenario agent follow domin bid strategi bid strategi bid bid bid eleg agent appli strategi agent win paid monei lowest bid produc huge deficit step step approach possibl reduc bid round round small margin agent bid reach figur displai modifi strategi step size equal privat algorithm emul aggress strategi algorithm work stabl dynam environ agent vanish time time strategi balanc agent appli agent reduc win agent profit figur real privat cheaper agent time agent bid won lost start bid bid lost lost won won lost won bid bid fig strategi repeat vickrei auction group agent bidder risk rate prescrib care agent small step size order safe competitor suffer huge loss make neg profit reason set depend number distribut privat valu rate upper bound level commit contract task execut contract bind breach pai penalti commit contract unavoid loss agent produc cheapest competitor reduc break neg contract due fact reason close deal figur privat agent incent accomplish task break contract loss make accept contract greater penalti pai break deal common definit penalti fraction contract agent breach contract pr actual task price pr penalti rate give assumpt pr agent break contract task price equal privat distribut prime cost true case result set investig paper similar due reason limit present experi conduct detail result includ random cost tabl number buyer execut task associ prime cost task execut interest task price higher cost price bid integ valu sell task interest calcul submit seal bid submit lowest bid declar winner lowest bid price announc paid price execut task equal win winner pick randomli earn monei handl privat task prime cost assum execut task round commit tabl prime cost ident abil handl cheapest price bid privat valu gain horizont line figur show profit accumul task task task tabl fair cost tabl round ce ce appli domin strategi bid prime cost ce harm competitor reduc profit minimum ce agent rate larg step chose care step size set reason ce set visual strategi work contrast normal case appli domin strategi make equal ce outperform rival lose sum profit entir group reduc singl agent aggress strategi vulner vickrei auction bid glanc agent care profit make highest profit odd effect explain fellow bidder auction round fig ident ad equat ce risk entir profit order hurt ce ce complet gain perform break expect figur agent cut quarter profit rival due mutual rate attitud agent formal introduc paper lead import strateg behavior agent argu impli exist agent paper vickrei auction show auction addit defici vulner bidder effect polici enabl easi price manipul common english auction privat bidder vickrei auction strategi paper work english auction inabl prevent profit reduct regard major disadvantag auction type dutch auction suffer strategi auction round fig ident problem strategi repeat vickrei auction desir intend cut cheapest agent profit highest margin reduc bid bidder stai bid privat lose monei harm round requir agent make special feasibl set behavior paper opposit bidder bidder coordin bid order agent bid intent harm fellow bidder research step explor strategi agent detail plan examin strategi complex environ number vari time task intend investig type collabor agent act effici refer brandt bid repeat vickrei auction technic report institut fur technisch universitat wei task assign multiag system base auction level commit contract klusch cooper inform agent volum lectur note artifici artifici page berlin weiss user control mode ip alloc present mit workshop internet econom ke ms miller incent engin comput resourc manag ba ecolog comput ferber system introduct distribut artifici intellig john wilei son huberman sh clearwat multiag system control build environ intern confer multiag system page menlo aaai press sell nuclear weapon american econom jk hr varian price internet public access internet confer school rp mcmillan auction bid journal econom pr rj weber theori auction competit bid ohar nr editor foundat distribut artifici intellig john wilei son game inform basil mh rothkopf rm model cheat vickrei auction journal mh tj ep kahn vickrei auction journal polit tw sandholm limit vickrei auction comput multiag system intern confer multiag system menlo aaai press tw sandholm vr lesser issu autom negoti electron extend contract net framework intern confer system page tw sandholm vr lesser advantag level commit contract protocol nation confer artifici intellig page sun microsystem manag share resourc market mechan vickrei counter competit seal tender journal ca jo ws distribut comput economi ieee transact softwar editor multiag system modern approach distribut artifici intellig mit
HCI/829 4 guidelin readabl diagram abstract henk clair han van faculti scienc vrije amsterdam de boelelaan hv netherland paper present work establish guidelin creation readabl diagram exampl guidelin exampl improv diagram guidelin meant assist practic prepar diagram commun architectur stakehold diagram import inform technolog recent interest widespread softwar develop electron make make class user guidelin visual contribut readabl diagram emphasi outward diagram addit support process design set diagram attempt made arriv guidelin evalu process perform group practic outcom evalu present work part research project gener term human factor keyword graphic introduct present work establish guidelin creation readabl diagram give guidelin exampl improv diagram insight diagram diagrammat reason gener bring gener research find domain inform technolog work part studi introduct word relat mention current develop current statu work establish guidelin section give short descript approach discuss evalu process section dig guidelin section subset guidelin present illustr section give support design diagram end section futur work view print color document download websit research comput scienc long histori creat diagram function decomposit schema exampl diagram martin state art softwar diagram gener introduct person comput method analysi design draw standard recent uml oo fowler natur draw good softwar architectur branch softwar engin recent ieee standard defin fundament organ system embodi relationship environ principl guid design van place architectur phase softwar life cycl requir engin design phase architectur interest concern stakehold account solut result architectur phase seri major design put constraint build process product deliv design repres form seri diagram diagram give view decomposit system major logic build map softwar element hardwar element wellknown model describ softwar architectur soni describ detail set diagram advic manag architectur scale annot set diagram found internet focu guidelin research appli diagram relat area kind diagram serv task model user interfac design current develop diagram factor make interest diagram role emerg field inform fill peopl technic background stakehold plai role assess develop societi gear visual commun demand appeal research develop graphic metaphor state art overview widespread avail draw softwar graphic librari make pencil templat draw outdat reason mention diagram formal rule develop deal brown contribut debat uml architectur diagram adopt ieee standard spur interest creat specif base model question repres softwar inspir sei workshop outcom research develop commun architectur design model read architect reader build write draw process figur step commun architectur sake posit develop commun process divid broad gener step part design architectur model specif architectur prepar text diagram part read text diagram make mental model architectur process receiv inform accept project design step consist understand structur understand outlin major design goal free creativ process concept technolog confer seminar support architect model step part abstract architectur made concret pattern formal semant model uml compani standard cultur influenc partit final step architect prepar actual design project step divid constant switch free format model draft accent gradual shift step reader comprehend architectur start read document mental model creat inform ration process sharp distinct focu gradual shift mere realiz consequ reader start discuss design end meet aim guidelin strengthen transit design reader scope readabl guidelin figur dot architect level prepar support reader quickli correctli extract focu outward diagram activ evalu process activ start research phase establish compar work field case decid approach establish start point identifi knowledg domain guidelin extract ware sourc human technic user interfac borcher websit design area mention psycholog inform standard icon librari prove discuss particip compani heurist rule captur guidelin extract base intuit estim base experi softwar develop case doubt guidelin architect decid result document time start thing signal reach satur point result present group particip compani intern softwar govern workshop guidelin appli exist diagram discuss guidelin section show exampl diagram improv workshop architect guidelin hand appli work suit give person estim month form questionnair strengthen understand guidelin document prepar period exampl architectur diagram found internet diagram comment respect visual attribut diagram distribut architect found websit research conclud questionnair evalu process view larg number guidelin broad brush questionnair consist simpl question add comment choic independ mind busi bunch peopl urg step twelv architect respond questionnair vari end guidelin receiv support major vote feel case give weight neg draw line support stai guidelin fall tabl tabl summar support column calcul total vote guidelin visual attribut visual attribut hierarchi focu form size width tabl evalu summari number guidelin drop support layout color connector text graphic icon context design report total comment made respond guidelin gener applic redund theoret section give exampl reject consid doubt guidelin origin document summari background percept theori base vote consid doubt expect discuss particip architect reject substanti number guidelin discuss place practic situat amount reject doubt guidelin support credibl set guidelin architect effort provid practic guidelin credibl guidelin base qualiti person judgment vote small group practic architect claim guidelin proven correct claim guidelin consid valuabl practic architect readabl guidelin section give pointer guidelin motiv step unknown explan interest reader found refer materi readabl guidelin center human build mental model support process outlin paragraph human percept foremost read function human amaz complex process point visual attribut plai role human brain recogn group object diagram guidelin point limit human maximum number user comfort handl viewer minim differenti type minimum space appeal major concern diagram diagram appeal diagram impress stimul reader dive inform modern dai world peopl overload inform easili put competit build mental model read text view diagram architectur build mental model architectur element mental model explicitli defin impli view constant process construct relat evalu plausibl affirm reject process base visual attribut present diagram inform diagram inform previou experi guidelin prevent construct incorrect element mental model promot construct correct element visual attribut diagram norman call provid strong clue mean creat diagram account visual attribut lead result meaningless variat diagram commun express diagram worth ten thousand simon classic argu diagram li recogn complex relationship element support process diagram transfer inform build mental narayanan assist process inform view diagram architectur part model consciou mind inspir correct inspir combin object attribut diagram construct altern diagram correct easili reason start point natur start point creat express presum consequ closer diagram ideal start point line addit mental construct diagram creat start brain resourc start point weaker inspir guidelin visual attribut list guidelin visual attribut graphic icon section give exampl guidelin hierarchi diagram element view glanc provid viewer clue easili perceiv main separ addit content tabl exampl guidelin respect tabl hierarchi guidelin creat clear hierarchi complex diagram design complex diagram read minut diagram immedi automat make import present secondari studi reveal detail diagram organ inform clear visual hierarchi visual attribut plai role indic size color line pattern main shorter avoid distinct visual level primari color object action add hierarchi complex requir viewer deriv hierarchi view inform process diagram incur extra work possibl irrit quit possibl wrong complex diagram hierarchi appeal high chanc properli understood figur diagram visual hierarch level rol team consult project sector period budget project statu figur diagram visual hierarch level consid doubt guidelin categori creat urgenc diagram simpl graphic graphic fall form width form diagram gener fall formal shape project data store small graphic imag icon small graphic icon treat detail section tabl exampl guidelin respect tabl form object guidelin form object clear form box provid annot consist form set diagram match outward form object properti object symbol concret tangibl object geometr shape abstract concept form diagram reject guidelin categori level low shade size width import visual attribut peopl underestim strong real life person easili import bigger induc similar connot size diagram differ import tabl exampl guidelin respect tabl size width guidelin size width similar object equal deviat size width signal avoid resiz object short long text long text altern put short label object text annot margin diagram avoid make object smaller inform make object bigger fill diagram empti size object diagram mean object grown shrunk figur figur xyz central unix mq cic adm cic mq cic nt xy cic fv fu cic figur diagram workshop particip xyz central mq cic adm mq cic cic unix cic nt xyz fv fu xy cic figur diagram figur appli guidelin size layout figur object suppress interpret diagram vertic posit object horizont posit vagu mean horizont posit check interrel figur size object made equal object posit grid mean diagram perform start reason mean immedi layout put object diagram pattern easili recogniz fit underli great aid viewer diagram discern rememb object relationship relev clear pattern make easi ey back object support process layout aspect diagram basic horizont vertic distanc object center distribut white space basic pattern make clear viewer strategi posit object mean deriv posit object workflow diagram activ posit left order execut vertic posit execut stage process clear messi diagram start improv import visual attribut good layout perceiv instantli unconsci unclear layout hinder perceiv detail inform provid white space make diagram eleg white space room alter support reason diagram figur diagram attent paid basic pattern proper horizont vertic outlin object tabl layout guidelin layout recogniz posit pattern object diagram familiar layout pattern web posit object central horizont vertic secondari axi object posit horizont vertic posit account left top bottom make flow direct recogniz provid white space crowd diagram white space distinguish set diagram similar object similar posit figur diagram clear layout pattern main page divid area convei main structur architectur case show applic client workstat center left main area servic applic local lan server remot mainfram machin deal real machin locat conceptu repres machin group left main area realiti occur time locat oper made clear extra white space area locat app home workstat messag server datum color server info server server call locat server offic central offic locat mainfram mainfram voic unit figur clear layout pattern locat mainfram mainfram telephon unit color strong visual worthwhil pai attent visual attribut strongli influenc cultur fashion color cloth compani color color comput document nowadai practic color printer hand due guidelin element time relev addit mean easili attach color distinct color diagram object program mean color rest document color enlarg appeal diagram tabl color guidelin color color competit attent viewer color problem wrong prior color diagram color categor group object mean vivid color strong signal safe rule primari color hue color wheel follow compani color western viewer tend prefer color orang yellow recogn screen color recogn paper avoid problem print black color level proxim color parallel proxim mean extend diagram mean color reflect state combin guidelin setup color scheme set diagram exampl color combin figur color meant upper object scope system design realiz color red drew attent object de rol van van te te rol van van figur diagram workshop particip figur diagram figur color compar figur figur big differ ad color make figur object easili perceiv semant distanc object compart area immedi clear reject guidelin categori color combin color connector connector specif architectur object relat object architectur diagram connector diagram show function divid main area connector process diagram connector diagram design connector plai connector number equal surpass number problemat common problem connector make diagram messi connector easi follow usual solut find posit object make connector easi design give simpli accept make diagram appeal difficult comprehend softwar tool optim flow connector problem tool result layout total ignor pattern diagram tabl connector guidelin connector line connector long lead unclear ambigu avoid unnecessari bend connect line avoid great emphasi leav round bend natur impress flow close parallel line difficult follow individu solut maintain distanc line parallel line bend equal distanc bend connector easi follow human ey give support reason relationship object guidelin connector give idea make life connector figur section recogn guidelin connector consid doubt guidelin categori connector object diagram text text graphic friend enemi combin power text strong suggest proper interpret associ stimul guidelin text stimul architect ad proper subscript annot matter expect peopl rememb diagram present text import speed build proper mental model creat good start point line reason tabl text diagram guidelin text diagram write activ action thing concret word memor verbal visual space permit complet label place short label shape footnot provid inform provid clear subtitl subscript diagram posit set show give read draw explain annot give answer focu explain design label annot stand background remain subordin subject matter graphic icon graphic icon make diagram technic audienc graphic artist object action modest instanc squar inch print draw packag pc librari kind graphic icon smaller imag todai recognit symbol graphic user interfac date inspir collect icon graphic icon parallel color strong visual impact depend cultur compani context fuzzi differ worthwhil option differ difficult set icon peopl abil draw icon graphic possibl creativ contribut architectur design compar creat icon web site tabl graphic icon guidelin graphic icon icon graphic speed save graphic spatial visual appeal funni graphic daili life viewer ad icon box indic function relat figur simplifi technic diagram icon speed recognit idea icon set icon repres abstract concept work icon explain figur green middl color icon green object number unspecifi relat yellow equal fulfil figur diagram icon speed recognit unit inf inf figur diagram graphic figur simplifi free graphic meant appeal suitabl ad technic inform work graphic viewer detail graphic distract mean graphic context design focu paper outward visual attribut deal diagram specif ti visual attribut section guidelin captur factor encount search guidelin visual attribut design evalu aim kind guidelin support architect plan evalu set diagram gener diagram perspect account specif issu essenc good diagram hard tabl design set diagram guidelin design set diagram diagram architectur grow design ad start design outlook good graphic stakehold creat clear structur set diagram visual attribut design set diagram mind prepar diagram show good creat diagram viewer compar find blind spot visual account organ adjust reach start identifi import inform diagram object top level identifi singl object domin graphic formul specif question viewer answer diagram evalu diagram list gener question peopl diagram relat diagram differ compar current seri consecut diagram build complex simul progress reveal detail inform consid doubt guidelin categori graphic organ preview structur inform concept structur report structur addit insight organ subject diagram architectur report make subject guidelin incorpor diagram architectur design report text paper posit diagram referenc diagram tabl diagram architectur report guidelin diagram architectur report distanc report diagram refer big possibl repeat diagram signal repeat thumbnail margin text highlight thumbnail part diagram treat text number diagram text refer diagram number refer diagram prefer end paragraph diagram refer text simpli directli inform reader diagram content encourag reader diagram question point peculiar futur work visual attribut effect mean find wai improv readabl diagram visual attribut visual hierarch layout form icon graphic al express import class clear structur motiv symbol icon lightweight valid guidelin establish workshop architect particip compani gave support practic guidelin direct research maintain extend guidelin instanc idea prioriti guidelin visual attribut influenc differenti usag posit guidelin formal model commun link readabl diagram readabl text develop readabl text arm understand relev visual attribut diagram plan start research specif type diagram visual specif aspect diagram adjust serv interest specif user group acknowledg research partli fund grant comput softwar centr dutch tax custom ing institut refer wisconsin bernhard construct blueprint jan oliv arnold layout rule graphic web comput vol evalu intellig diagrammat languag specif intern brown al describ softwar architectur workshop intern confer softwar color henri symbol authorit guid intern graphic uml guid standard object model readabl comput acm journal comput august guido van der rob academ appli softwar illustr comput ieee recommend practic architectur ieee standard henk guidelin readabl found henk guidelin diagram bee found pb view model ieee softwar herbert diagram worth ten thousand cognit scienc william diana handbook pictori exampl intern dover jame diagram techniqu analyst diagrammat taxonom technic report decemb psycholog dai basic softwar engin workshop softwar architectur januari denni bill scott document softwar aid system workshop annual acm confer system rl softwar architectur industri intern confer softwar pp robert inform van softwar principl john wilei colin inform morgan kaufmann van user interfac master dissert seri electron
Agents/830 1 manufactur system integr mobil agent author todd john edward depart manufactur engin uk abstract mobil code champion solut plethora softwar problem paper investig mobil agent mobil object support improv system integr agil manufactur domain describ system built support sale order process distribut manufactur ibm aglet softwar develop kit sale order process model requir agil basi implement deriv data collect industri case studi system evalu methodolog metric semant align chang capabl present evalu system respect system agil support work evid mobil agent mobil object system inher properti build agil distribut system mobil agent addit autonomi provid margin greater support keyword mobil mobil distribut system aglet introduct access inform critic factor develop busi system architectur inform store abil effect distribut inform view provid competit advantag todai simpli base requir corpor surviv global market place oper manufactur distribut support inform technolog system capabl distribut oper manag inform remain base integr differ system data sourc internet technolog prove effect connect mix type comput comput provid locat independ inform analyst predict futur evolutionari converg intranet tradit model peer peer remain number problem technolog satur network part network question mean remot access requir distribut model ineffect support busi data factor data integr secur concern deal internet mobil agent technolog gener solut potenti overcom set problem achiev local interact al equal applic problem geograph distribut inform mobil agent system inher distribut mobil object mobil agent work build integr softwar system support distribut manufactur order test mobil evalu system conduct methodolog number relev metric identifi section describ model work model system paper implement sale order process typic manufactur model system base deriv industri case studi undertaken vacuum compon manufactur base uk refer acm mixtur packag standard offic product support busi market chang rapidli exist infrastructur increasingli appar acm remain agil achiev infrastructur capabl respond chang requir met exist infrastructur recent experi acm half year phase account packag introduc accept strategi bui monolith packag begin impact rapidli inflex legaci applic intric spider web interdepend packag place make increasingli difficult contempl radic chang support infrastructur interdepend agil compani legaci problem applic domain overview acm busi process gener studi figur separ busi process involv defin senior manag figur area core process surround dot line clarif identifi extract core busi process repres higher level abstract view examin interact major simpl top level process model gener repres entir acm busi figur show top level busi process model descript element interact model show interact number process support specif demonstr import system integr domain order evalu mobil manufactur integr examin integr method emploi tradit integr comput busi increasingli fundament success requir achiev technolog global busi requir infrastructur capabl deal distribut made constitu commun domain side world number infrastructur model typic common object request broker architectur distribut common object model remot method invoc microsystem technolog attempt solv distribut problem provid locat major tenet distribut system refer model open distribut process famili author contend princip local interact embodi mobil code paradigm potenti improv integr agil compar tradit technolog subsect characterist corba order establish context examin potenti advantag mobil corba corba product consortium hundr object manag group omg approach problem integr dispar compon creat interfac code distribut compon system describ interfac interfac definit languag subsequ underli object request broker al orb function commun backbon system compon interact omg contend compon commun orb awar mechan fact discov run time flexibl configur realiti commerci orb discov runtim compon method argument idl definit insuffici support creat tangibl solut base coupl late bind edward addit trade omg provid improv level support type solut corba bring locat transpar abstract integr whilst metaphor distribut drawback al figur repres compon commun orb compon interact compon case compon complet host side world summari tradit distribut mechan promot locat transpar major achiev commun object locat object messag system mobil data pass object locat tradit system locat transpar mobil data integr enabl commun distribut object shown top part figur author content featur local reduc network server flexibl applic support mobil agent potenti provid level integr agil provid convent technolog embodi corba edward agent object mobil agent topic discuss mainstream agent base research year mobil gener expand commun dedic investig potenti paradigm definit answer mobil code system live expect grow bodi work tschudin rothermel hohl minar expand number includ aglet oshima voyag space mole al hive al classif mobil agent discuss work paper defin agent autonom migrat host comput classifi line franklin graesser agent classif scheme graesser goal mobil goal orient simpli reactiv proactiv commun commun agent mobil transport host mobil object discuss work paper similar agent kei differ logic enabl agent make autonom sale order process background mobil object agent inher distribut execut varieti platform oper system achiev full potenti network configur true advantag migrat dispar system continu function requir influenc mobil code system creat usual mobil agent framework written type script bytecod dedic host server spiral popular combin platform made de facto languag mobil code system script bytecod interpret remov agent arriv place ensur environ exist host capabl uniformli execut agent arriv exampl system server type execut environ agent host oshima grai overview discuss java mobil agent found zimmerman advantag mobil code system advantag claim mobil agent al lang oshima quantit measur exist support claim summari frequent quot qualit includ bandwidth save transfer lot data back move logic local data sourc limit latenc logic data latenc reduc disconnect oper comput offlin move activ process host stabil mobil softwar depend stabl mobil achiev replic fault toler server flexibl client isnt limit function server code mobil client upload function server simplic instal server base server requir function outset prevent legaci enabl distribut comput mobil agent inher fundament enabl distribut comput summari mobil code system exist tradit distribut system preval industri todai mobil object system provid local interact commun provid abstract base mobil messeng limit autonomi shown central section figur mobil agent system provid local interact abstract base mobil logic data mobil agent provid greater autonomi shown bottom section figur figur depict notion mobil agent migrat host host resid local data sourc queri industri motiv case studi acm plai import role provid basi implement undertaken paper confirm busi commonli found manufactur abil remain agil competit market goal difficult examin judg detail studi reveal acm requir identifi support system handl rapid addit sale agent handl addit stock control centr busi logic made easili requir form basi object implement model sale order process core process identifi acm involv introduc figur model address acm core busi process implement work examin aspect concentr interact sale agent deal order request stock control centr modifi model shown figur product control exclud entir field research deem extern object research grei area figur dispatch repres process consid make excel candid investig futur work figur depict implement agent model acm fundament oper custom dispatch resid distribut request fulfil order pass order object queri stock product stock return object return parent notifi custom deliveri date product stock satisfi migrat manufactur plant product id encapsul order object queri list raw materi requir encapsul dispatch manufactur return object standard deliveri date raw materi agent manufactur plant server gener encapsul detail requir materi mobil object model similar kei differ result stock queri gather remot mobil guid specif process inform local data return process mobil object make autonom base acquir inform system work paper implement ibm aglet softwar develop mobil agent develop framework oshima scenario investig undertaken mobil agent mobil object system system consist select individu agent object type identifi model analog compon system mobil agent system whilst mobil object system discuss section sale agent sale agent graphic user interfac base agent gener dispatch distribut agent host world interact resid slim client sale person work termin host laptop travel sale person capabl track current order mobil agent version logic agent requir creat accompani order capabl maintain list spawn order mobil object version busi logic requir process result return slave order agent repres mobil element system classifi section goal commun mobil encapsul singl complet order creation migrat host interact stock level unabl satisfi migrat encapsul product id deriv bill materi agent migrat host futur agent invok manufactur process establish requir time manufactur commun consist simpl messag acknowledg valid outcom goal report deliveri date order futur includ report futur time deliveri alloc materi intern work order number time manufactur requir interact user gui make major agent popul system execut depend number receiv larg number mobil migrat attempt fulfil order order object initi perform function mobil object contrast mobil agent view mobil object mobil messeng migrat data sourc advantag local interact advantag busi logic autonom process result collect stock level inform return origin report find parent termin static gui handl request interfac stock control act wrapper data commun bridg data agent system request stock alloc made design agent unifi varieti system expect manufactur appar requir featur agent whilst gener agent problem common queri agent conceiv base pattern agent system advantag techniqu consist reusabl inher pattern build agent complex queri agent discuss edward architectur put good perform role finish task control alloc raw part connect bill materi mobil queri request manufactur stock fulfil order type agent repres system static agent commun simpli acknowledg commun repres definit avenu investig research evalu evalu work conduct basili al method section includ overview principl question metric identifi present result goal evalu implement system respect satisfi industri motiv support system section state goal workshop red group held gener broad set question aim provid full coverag issu order deriv set metric work evalu fulfil goal section initi question system complex system flexibl method customari develop hierarch set question focu set question answer tangibl measur code tabl list question extract larg vari set question gener workshop tabl show set relev metric gener workshop section describ metric combin provid quantifi measur agil system measur object agent system test agil system relat industri object section conceptu semant align conceptu measur singl concept semant abstract applic domain map compon softwar system metric requir identif inform base concept real comparison counterpart softwar system order agent object system concept order split separ score conceptu rate semant align real world abstract compon softwar system shown import attempt build flexibl system edward conceptu measur semant align combin metric produc compound measur sa semant inform base process base mobil static denot softwar denot real world ratio process base abstract softwar process base abstract real world metric system assess softwar system reflect semant applic comparison ideal align measur gaug difficult understand understand applic domain mobil object system sa mobil agent system sa result show mobil code system easi abstract domain map compon system inform abstract real world averag spread compon implement mobil static compon compon domain model mobil static compon domain model static element implement small differ system shown semant align process mobil agent system shown semant align mobil object system process logic sale order process mobil spread sa ir ps pr ms mr ss sr ps pr mobil mobil object system chang capabl order evalu agil system make system industri requir report section agil term ad sale stock control agent modifi logic sale order process metric tabl modif agent object system line industri requir agil measur chang capabl system achiev combin result work singl chang capabl requir chang set number object number src file number interact number conceptu entiti state chang capabl compar system measur system measur chang capabl rel ideal mobil object mobil agent system chang capabl requir handl rapid addit sale mobil object mobil agent system cc handl addit stock control mobil object mobil agent system cc busi logic sale order process made mobil object cc mobil agent cc result show system easi chang ad sale facil requir instanti incur ab system code stock control centr ad low number system differ system appar make sale order process singl mobil mobil agent system mobil mobil object system paper argu mobil code aid rapid integr modif inform system support distribut paper mobil agent system provid mechan support mobil data mobil logic tradit commun technolog sole provid mobil data achiev strategi mobil agent commun local whilst orb provid locat transpar materi data collect industri case model gener support manufactur process static mobil agent object technolog number kei agent type identifi role result system discuss evalu mobil agent system mobil object system paper gener metric measur semant align system domain chang capabl system found attempt provid measur system agil result provid evid mobil static element applic domain map mobil static object agent implement gener system chang capabl weigh fact design oop principl built flexibl mind legaci contend author support idea align system domain improv understand system withstand work evid mobil code paradigm provid mechan reflect dynam domain implement system distinct mobil object mobil agent work identifi ad autonomi mobil agent establish reason highlight support agil mobil object semant align chang capabl acknowledg author epsrc continu red group member input metric workshop refer goal question metric encyclopedia softwar pp wilei son good enabl virtual intern confer manag logist burn mechan engin juli pp isbn compon base contemporari technolog intellig system edit lm kluwer academ isbn taxonomi autonom proc int workshop agent flexibl secur phd dept comp dartmouth colleg intern standard refer model open distribut part overview guid cd java ieee internet vol agent aglet world wide web journal good reason mobil comm vol distribut agent network mobil mail voyag core packag technic overview omg object manag common object request architectur object manag group connecticut usa essenti distribut object surviv john wilei son york usa mobil agent improv align manufactur support journal robot autonom vol agent context competit proc part autonom agent seattl proc intern septemb lectur note comput scienc isbn system softwar associ distribut object comput java base mobil agent proc mobil object system sun microsystem remot method invoc object programm lectur note comput scienc foundat electron white gener magic bradshaw mit isbn note distribut sun microsystem technic report tabl tabl question gener method gener question metric number system support easi understand busi entiti map data abstract busi process map softwar method real world entiti mobil mobil system real world entiti static static system compon system line code comment easi modifi conceptu entiti chang requir object chang src file chang interact chang compon system rel size real world entiti map softwar compon compon chang interact chang connect method object public tabl metric gener metric natur metric identifi abstract real world compar info base abstract softwar identifi abstract real world compar process evid softwar identifi mobil element real compar mobil element softwar identifi static element real compar static element softwar count compon count line code count ratio count requir count requir count requir count file chang requir count number inter object method invoc count number public method list figur figur acm busi process receipt order figur top level view busi process acm figur commun compon orb figur comparison distribut mechan figur mobil agent local data sourc figur modifi process model acm figur agent sale order process model rout
IR/831 5 inform extract text corpu mine featur zavrel peter cnt languag technolog group belgium dn netherland abstract paper describ method build inform extract system standard text classif machin learn datamin complex featur larg corpu text superfici annot successfulli method build system job introduct rapid develop inform extract system larg usual method extract rule simpli labori turn machin learn techniqu induc knowledg extract annot train sampl techniqu induct extract rule califf learn extract rule train sampl annot detail entiti extract mark exact locat text rule induc gener context occurr relev entiti lot work manual annot larg sampl text level detail organ interest autom exist inform extract task larg quantiti text pair relev entiti figur inform extract task string set text classif task categori label set work thousand job categor job educ industri code larg number type extract slot replac separ classif task text train exist machin learn techniqu assign categori label basi featur text mean treat symbol entiti extract actual instanti entiti strongli predict string featur task result larg amount categori larger amount instanti cue forc pai special attent import issu text document term featur start bag term select subset good predictor categori start gradual extend document complex base search train data good predictor search good featur restrict singl word document previou good result obtain longer phrase featur gener term corpu job engin point specif categori data addit sourc label section boundari complex conjunct section label phrase rich featur languag possibl achiev high price pai face larg number potenti featur lead treatment featur select task corpu experi number exist base simpl corpu discoveri process corpu build fulli system dutch job month paper describ basic philosophi report result experi remaind paper structur section descript data set classif task defin data section briefli present machin learn algorithm classif section describ document posit field document record figur ideal situat learn inform extract entiti mark context document map versu commonli occur situat document global record method select featur section give accuraci result system final attempt draw gener work data data set conduct research corpu job collect archiv dutch onlin job search site onlin scan print edit process manual correct ocr error add classif inform format learn approach data present problem corpu classif label approach filter origin dataset obtain set document dutch comput specialist specialist informatica de van de van en en technisch de technisch van de perform connect en interfac technisch kenni en technisch en al specialist met multi processor pr aix technisch en technisch test kenni van en connect technisch bel van de ab fax de de figur job document step label field interest experi report document train set remaind test set document token split languag document guess freeli languag figur show text preprocess stage document label inform job titl code educ requir code written van data set english small portion german larg major dutch level comput industri sector code coal produc data set consist legaci annot evolv chang year exact anecdot report suggest consist frequent assign label field code remaind categori report accuraci exact match human annot test set overli low addit categori text segment section label job titl descript requir organ descript benefit contact inform label predict correct segment text section develop system clear label inform constrain featur field interest resourc good predictor posit present contact inform good featur present job titl innov aspect system treat problem section label text classif task typic featur extract categori turn content phrase section label featur syntact filler phrase classif learn classif task label standard learn method detail descript effici learn exampl store memori binari vector classif nearest neighbor retriev case receiv frequent categori nearest neighbor distribut categori distanc metric turn robust classif task simpl overlap binari featur receiv equal weight stanfil earlier applic learn text store activ featur case contrast implement index featur case speed match process featur mine size categori set applic make larg featur order make recogn realiz cue categori featur languag type string interrupt whitespac string consist consecut unigram separ whitespac conjunct unigram phrase specif section label regular express text experi featur present text repres document gener vector activ featur potenti featur select comput reason success constrain document featur good predictor stop word discrimin class hide string low chanc gener document burden space uniqu token occur train corpu potenti total thousand candid data set comparison corpu base measur evalu predict singl term gain ratio inform gain chi squar log likelihood raw frequenc measur class sticki condit probabl class combin absolut frequenc threshold singl term featur phrase featur term specif cue job titl phrasal comput select statist phrase number quickli explod mine phrasal perform rank length twelv corpu appli threshold left million rank predict qualiti content entiti section cp measur match system label consid conjunct phrase section label featur conjunct fall threshold predict threshold set system construct complet automat train data final addit system mine corpu semiautomat type describ compani method similar start small seed set find context occur human iter identifi entiti context list compani educ job includ featur result featur select tabl show result experi statist featur select appli unigram featur main tabl featur final system includ featur maximum tabl educ field simpl metric cp outperform job log likelihood beat small margin sector gr freq turn perform simpl cp freq comparison sophist measur explan larg number statist measur ig measur deviat condit probabl priori probabl categori misl larg number small deviat tend select inform frequent featur inform infrequ featur previou work text examin featur select method confin binari problem smaller gain correct frequenc overestim import infrequ case activ featur chi freq case activ cp detail report explor paramet space result system complet solv extract task job long short develop period final set accuraci section label extract categor posit educ industri sector accuraci figur measur noisi corpu legaci data relax class boundari score answer correct merg relat result improv job sector classifi system interfac figur suggest made system effici correct human oper natur system continu increment updat featur set memori classifi system improv appli text classif approach counterintuit solut shown appli successfulli limit domain job detail entiti label train acknowledg construct system support hard work colleagu group tilburg alphabet van den walter author peter servic bv involv paul busi public provid job data refer extract pattern relat world wide web webdb workshop march rj relat learn rule inform extract sixteenth nation confer artifici intellig bm sj dj trade mip memori knowledg engin commun van der van den tilburg memori base version refer technic report technic tilburg accur method statist coincid comput inform extract html fifteenth nation confer artifici intellig tilburg undergradu research report featur subset select european confer machin learn springer berlin md word sequenc featur seventh comput sc confer ht hb integr multipl knowledg sourc disambigu word approach annual meet acl morgan san mateo program machin learn san morgan kaufmann accuraci field select method ig gr chi freq cp ll ig gr chi freq cp ll branch ig gr chi freq cp ll tabl comparison measur singl term featur tabl show accuraci percentag categori task train thousand test remain document select method row show result top rank term featur learn inform extract rule free text machin automat text studi featur select method machin learn techniqu automat categor dutch master tilburg reason commun jo compar studi featur select text categor proc intern confer machin learn figur interfac system
ML/832 6 ieee transact electron packag vol januari rough set data mine tool semiconductor manufactur grow volum inform pose interest challeng call tool discov properti data data mine emerg disciplin contribut tool data discoveri autonom decisionmak basic concept rough set theori aspect data mine introduc rough set theori offer viabl approach extract rule data set extract rule make predict semiconductor industri applic contrast approach regress analysi neural network singl model built goal data mine extract knowledg rule applic concept system engin evolutionari comput introduc paper algorithm concept present paper illustr exampl index evolutionari knowledg knowledg rough set semiconductor manufactur introduct data mine emerg area comput intellig offer tool process larg volum data gain attent research evidenc number applic report grow volum data digit form interest data mine relat includ machin cluster regress neural network fundament differ approach data mine neural network regress approach creat model base train data set model predetermin set featur machin learn algorithm data mine gener number model form captur relationship input featur extrem set featur includ rule independ similar result produc cluster analysi neural network regress model view singl model form entir popul data data mine approach paradigm tool determin featur common popul data model creat data mine explicit manuscript receiv octob march author depart industri intellig system iowa ia usa publish item identifi andrew ieee fig data set ieee data mine theori rough set theori reduct data find hidden data gener rule rough set theori algorithm paper fall broad area machin learn langlei simon group machin learn research neural genet rule analyt learn major develop learn data mine summar edit volum book mitchel survei import applic machin learn relat topic includ nonparametr discuss reinforc learn cover numer data mine softwar product rule extract basi illustr section ii rule extract content data set numer categor inform easili interpret inform transform form understood human user rule extract algorithm design identifi pattern data set express rule rule extract concept illustr data set fig featur rough set theori fig rule extract rough set algorithm fig pattern rule fig featur denot process paramet compon low rule extract algorithm transform data set fig rule fig set number squar bracket rule describ properti defin appendix rule fig correspond pattern shade cell matrix fig matrix fig number featur describ object data set algorithm gener rule fig minim number rule rule extract algorithm includ gener rule algorithm minim number featur includ rule gener result fig rule repres matrix fig featur fig repres object case rule describ object illustr fig pattern rule extract learn algorithm vari shape easi imagin larg data set pattern complex idea research report paper understand pattern add extract knowledg enhanc perform robust improv iii rule structur goal structur rule enhanc capabl knowledg gener learn algorithm knowledg structur support notion cognit map mental model discuss structur rule evalu perspect incorpor knowledg extract data idea structur knowledg introduc exampl structur matric fig rule featur group block matrix fig differenti featur uniqu featur set valu made base valu featur featur set rule mutual structur matrix fig complex featur valu prefer deal structur fig structur fig due associ uniqu set featur term support fig defin rule support appendix structur matrix fig complex featur valu prefer deal structur fig structur fig due associ uniqu set featur term support fig defin rule support appendix case illustr fig shape knowledg structur shape explor knowledg structur make process transpar user comput support data miss data farm discuss knowledg structur larg determin type learn algorithm entropi learn criteria minim number learn algorithm produc rule learn algorithm result multipl rule complic knowledg structur comput complex problem pattern enhanc util extract knowledg structur matric enhanc visual includ virtual realiti tool greatli impact qualiti transpar make matric plai import role knowledg discoveri process fuse inform sourc machin learn algorithm gener rule turn structur algorithm present section algorithm data engin principl section iv data engin term genet engin relationship genet program evolutionari comput ieee transact electron packag vol januari fig rule minimum number featur fig pattern rule fig fig mutual block gener similar genet engin approach simpl method select breed vari type scope found experi data set engin medic domain lead develop data engin method data engin principl introduc paper aim improv qualiti gener matric merg cluster rule featur valu featur replac featur valu rang merg rule column remov column entri rule data engin principl incorpor algorithm illustr section algorithm algorithm group shade entri matrix featur shade entri call mark featur step algorithm outlin step select matrix mark featur maximum class break tie arbitrarili step cluster rule class review cluster algorithm fig overlap rule pattern fig data set gener sourc step mark entri matrix principl section iv step satisfactori matrix structur obtain algorithm illustr includ data sourc greatest advantag data mine algorithm algorithm discuss paper abil data type data creat sourc data fig data sourc consid rough set algorithm gener rule set fig pattern result rule set fig shown fig step algorithm illustr matrix fig step featur frequent rule featur arbitrarili select step rule includ class high cluster fig rule class low cluster fig step appli data engin principl section iv matrix fig result matrix fig rough set theori fig rule deriv sourc data fig rule deriv sourc data fig pattern rule fig fig cluster matrix fig matrix transform featur replac column remov principl base featur replac data engin principl rule attach class rule rule featur replac rang column remov principl led remov column unmark featur fig inform make visibl made support measur rang dsm redund factor defin appendix analysi result fig featur depend small differenti versu result versu rang featur valu overlap rang featur depend differenti larg versu vi evolutionari comput rule engin import develop effort user suffici trust solut data set small incomplet ad dimens trust develop rule extract small data set involv fulli trust user captur essenc user trust knowledg extract data set term rule accept measur introduc rule accept measur subject assess reflect user confid extract rule import properti rule extract data set determin success failur data mine effort rule accept measur depend type data rule ieee transact electron packag vol januari fig compound rule fig process control chart measur redund factor support measur make set metric measur qualiti extract knowledg make base result shown fig compound rule higher rule accept measur gener rule classif power rule fig rule obtain gener attribut valu redund factor vii data process data rule engin discuss earlier section paper aim improv predict qualiti extract knowledg impact qualiti rule preprocess data set statist process control method suggest statist control method analyz outcom trend improv process essenc relationship statist control data mine captur fig process control chart fig divid outcom popul inform analyz approach typic numer direct relationship captur region featur rule extract data set outcom numer fig treat data region differ region train data set natur broken smaller set extract rule area enhanc predict power viii test knowledg accuraci user knowledg extract train data set interest accuraci predict made base knowledg method determin classif qualiti rule set divid categori cross valid partit method base split data test set train set separ data set creat data collect phase priori data collect posteriori classif qualiti deriv singl test set posteriori partit repeat numer time arbitrarili determin size test data bootstrap method suggest split data set train set test set method discuss suggest divid set object disjoint equal size group test set group remain train set process repeat time group test size group method method ix basic concept data mine rough set theori discuss rough set theori viabl approach extract knowledg make predict individu data object fault popul object rule extract data set featur consid model describ data set properti contrast approach regress analysi neural network essenti model fix set featur construct entir popul exist concept data mine expand rule structur data engin concept follow evolutionari comput approach extend knowledg pattern form rule extract rough set algorithm differ pattern gener algorithm tree algorithm limit overlap featur includ rough set rule make suitabl form interest semiconductor applic algorithm introduc paper form algorithm enhanc util extract transpar knowledg lead inform make algorithm illustr numer structur deriv algorithm enhanc visual tool appendix rough set theori background definit rough set theori base assumpt data inform object rough set theori object properli select inform paper indiscern adject kei algorithm present paper select subset featur categori object reduct minim suffici subset featur red al pawlak red produc classif object collect featur reduct minim subset respect properti core collect featur reduct comput product reduct pawlak introduc concept lower upper measur qualiti accuraci classif denot finit set finit set approxim denot set element classifi element base set featur approxim denot set element possibl classifi element base set featur definit express formal famili class indiscern relat set object indiscern set featur classs call set set object atom set object approxim accuraci data set ratio total lower approxim class total upper approxim class boundari approxim upper lower approxim classif accuraci rule set ratio number correctli classifi object test set object test set classif qualiti featur set ratio number object lower approxim total number object data set broader definit accuraci accuraci defin total number true posit ad total number true neg divid total number patient studi accuraci fig base quadrant fig metric defin addit accuraci sensit posit specif neg posit predict neg predict fig classif quadrant fig object data set rule length number elementari condit element rule rule strength number object data set properti condit rule exact rule outcom correspond condit approxim rule condit correspond outcom note exact rule gener set object lower approxim rule gener boundari rule support number object data set properti condit rule rule coverag proport object train set identifi rule rule coverag rule support estim condit probabl rule accept subject measur reflect user confid extract rule gener rule support rule coverag rule accept measur express number condit term rule discrimin level measur level rule repres object basic definit introduc illustr data set fig classif qualiti singl featur featur object uniqu classif qualiti select pair featur featur set object uniqu classif qualiti select tripl featur featur set object ieee transact electron packag vol januari fig exact approxim rule deriv data set fig uniqu classif qualiti featur classif qualiti number fig number class number lower upper approxim class number lower upper approxim class number lower upper approxim base valu data set fig classif qualiti featur approxim accuraci knowledg extract data set follow typic structur rule typic format rule extract data set rule discrimin support exact approxim rule extract form set fig support measur total number rule support express number object train set support redund factor number mutual featur set fig refer int inform comput vol pp langlei machin learn rule commun vol pp lin rough set data lin ed machin paradigm ed mit machin learn data ed machin learn theori diagnosi form artif vol pp overview regress techniqu knowledg knowl eng vol pp barto reinforc learn mit carol mental model research issu user softwar nat acad introduct human factor engin harper genet program mit evolutionari design ed san morgan comput intellig design manufactur concurr ed qualiti control englewood jr interest proc int acm sigkdd conf knowledg discoveri data pp set analysi patient suspect acut proc pp data industri case ieee tran electron packag vol pp oct choic assess statist stat vol pp rough theoret aspect reason data rough set tool knowledg proc int conf knowledg discoveri data fayyad ed menlo pp classif patient highli select int mach vol pp data mine ieee tran inform technol vol pp dec fundament andrew professor industri engin iowa citi interest theori applic comput data optim product healthcar publish research paper journal sponsor sme speak frequent intern conduct consult industri corpor serv editori board sixteen journal edit book seri journal intellig manufactur
ML/833 6 southampton support vector machin classif regress steve technic report faculti scienc mathemat school electron comput scienc content nomenclatur xi introduct statist learn theori vc dimens structur risk support vector classif optim separ hyperplan linearli separ optim separ hyperplan linearli high featur space polynomi map discuss featur space kernel function polynomi gaussian radial basi function exponenti radial basi function perceptron fourier seri spline spline addit kernel tensor product implicit explicit bia data kernel select classif iri data applic support vector regress linear regress loss function quadrat loss function iii iv content huber loss function linear regress exampl comment regress data applic implement issu support vector classif support vector regress matlab svm toolbox bibliographi list figur model error vc dimens illustr optim separ hyperplan canon hyperplan constrain canon hyperplan optim separ hyperplan optim separ hyperplan optim separ hyperplan optim separ hyperplan optim separ hyperplan map input space high featur space map input space polynomi featur space comparison implicit explicit bia linear kernel iri data set separ linear svc separ polynomi svm separ polynomi svm separ radial basi function svm separ polynomi svm effect separ linear spline svm loss function linear regress polynomi regress radial basi function regress spline regress regress exponenti rbf regress linear spline regress regress gaussian rbf regress σ gaussian rbf regress σ exponenti rbf regress σ fourier regress linear spline regress vi list figur regress list tabl linearli separ classif data separ classif data regress data vii list support vector classif matlab code support vector regress matlab code ix nomenclatur column vector posit part svm misclassif toler paramet dataset kernel function risk function empir risk function xi chapter introduct problem empir data model german engin applic empir data model process induct build model hope deduc system serv ultim quantiti qualiti observ govern perform empir model observ natur data obtain finit typic sampl due high natur problem data form distribut input space problem ill pose tradit neural network approach suffer difficulti produc model overfit data consequ algorithm paramet select statist measur select model foundat support vector machin develop vapnik gain popular due attract empir perform formul embodi risk shown tradit empir risk emploi convent neural network srm upper bound expect erm error train data differ equip svm greater abil goal statist learn svm develop solv classif recent extend domain regress problem literatur terminolog svm slightli term svm ical describ classif support vector method support vector regress describ regress support vector method report term svm refer classif regress term support vector classif support vector regress specif section continu introduct structur risk chapter introduct principl chapter svm introduc set histor access lead map input higher featur space suitabl choic kernel function report consid problem regress illustr exampl show properti techniqu statist learn theori section introduct statist learn theori depth statist learn figur model error goal model model hypothesi closest respect error underli function target space error approxim error consequ hypothesi space smaller target underli function lie hypothesi space poor choic model space result larg approxim refer model mismatch estim error error due learn procedur result niqu select model hypothesi space chapter introduct error form error ultim find unknown find approxim empir risk empir empir risk make ˆ arg min lim true law larg number lim min min valid hn condit intuit requir minima converg bound hold probabl ln ln δ express expect risk independ probabl tribut vc dimens vc dimens scalar measur capac set function figur vc dimens illustr chapter introduct definit vc dimens set function exist set point point separ set exist satisfi properti figur illustr point plane set linear indic function point case vc dimens equal number free gener function infinit vc dimens set linear indic function space vc dimens equal structur risk creat structur sh hypothesi space vc dimens srm consist solv problem min sh ln ln δ underli process model determinist model problem exact chapter restrict determinist cess multipl output problem reduc set singl output lem consid independ process multipl input desir predict singl output chapter support vector classif classif problem restrict problem loss gener problem goal separ class function induc exampl goal produc classifi work unseen figur linear classifi separ margin distanc nearest data point linear classifi term optim separ hyperplan expect boundari boundari figur optim separ hyperplan optim separ hyperplan problem separ set train vector belong separ chapter support vector classif set vector optim separ hyperplan separ error distanc closest vector hyperplan maxim redund equat loss gener canon hyperplan paramet constrain min constraint prefer altern fy formul problem word state norm weight vector equal nearest point data set hyperplan idea illustr figur distanc nearest point hyperplan shown figur canon hyperplan separ hyperplan canon form satisfi distanc point hyperplan chapter support vector classif optim hyperplan subject constraint equat margin min min xi min xi min xi min xi min xi hyperplan optim separ data independ provid equat satisfi separ chang move normal direct margin remain unchang hyperplan longer optim nearer class equat implement srm bound equat hyperplan nearer data point intuit figur reduc capac figur constrain canon hyperplan chapter support vector classif vc set canon hyperplan space bound radiu data point equat upper bound vc dimens solut problem equat constraint equat saddl point lagrang function α lagrang multipli lagrangian respect respect α classic lagrangian dualiti enabl primal equat transform dual easier solv dual problem max max α α min minimum respect equat dual problem max α max α solut problem α arg min α chapter support vector classif solv equat constraint equat determin lagrang optim separ hyperplan xr xr xs support vector class hard classifi α yr ys soft classifi linearli interpol hard classifi equat produc real valu output classifi queri train data resid point lagrang multipli point term support vector data linearli separ sv lie margin number sv small hyperplan determin small subset train point remov train set recalcul hyperplan produc answer svm inform data set sv produc data linearli separ equal equat vc dimens classifi bound chapter support vector classif tabl linearli separ classif data train lie unit linearli separ illustr method train set tabl svc solut shown figur dot line describ locu margin circl data point repres lie margin figur optim separ hyperplan optim separ hyperplan discuss restrict case train data linearli separ gener figur approach depend prior knowledg problem estim data case expect possibl hyperplan correctli separ method chapter support vector classif figur optim separ hyperplan introduc addit cost function misclassif altern complex function describ discuss chapter enabl optim separ hyperplan method cort vapnik introduc penalti ξ σ σ measur misclassif error problem pose classif error bound vc dimens classifi constraint equat modifi case optim separ hyperplan determin vector subject constraint equat solut problem equat constraint equat saddl point lagrangian chapter support vector classif β lagrang multipli lagrangian respect respect β classic lagrangian dualiti enabl primal equat transform dual problem dual problem max max α min minimum respect ξ equat dual problem max α max α solut problem α arg min α solut problem ident separ case modif bound lagrang multipli uncertain part approach coeffici determin paramet introduc addit capac control classifi directli relat paramet smola al ultim chosen reflect knowledg data warrant practic discuss chapter chapter support vector classif tabl separ classif data linearli addit data point ad separ data tabl produc linearli data tabl result svc shown figur sv longer requir lie figur orient hyperplan width margin figur optim separ hyperplan solut converg solut obtain optim separ hyperplan figur solut converg margin term figur point lagrang multipli emphasi misclassif pure produc larg width margin width margin rang li point lagrang multipli equal bound chapter support vector classif figur optim separ hyperplan figur optim separ hyperplan high featur space case linear boundari inappropri svm map input high featur map svm construct optim separ hyperplan higher figur idea exploit method al enabl address figur map input space high featur space chapter support vector classif restrict map ter turn commonli emploi function accept map radial basi function sigmoid function problem equat α arg min α kernel function perform map featur constraint solv equat constraint equat determin lagrang hard classifi implement optim separ hyperplan featur space bia comput support comput sv margin stabil kernel bia bia accommod classifi emploi kernel bia term finit kernel made simplifi problem remov equal constraint equat chapter discuss condit satisfi valid kernel function chapter support vector classif polynomi map polynomi kernel map input vector featur space ing svc linearli train data tabl produc classif illustr figur margin longer constant width due project input space solut contrast figur train data classifi correctli svm implement srm principl care choic kernel function produc classif boundari topolog map input space dimens greater number train point produc classifi classif error train set badli discuss figur map input space polynomi featur space typic data linearli separ possibl high featur space make separ data finit amount train data potenti corrupt practic emploi approach place upper bound lagrang multipli question determin paramet similar problem coeffici shown paramet directli relat paramet kernel process determin chapter support vector classif effici potenti method sought remov train pattern support solut unchang fast method valid support vector chapter featur space chapter discuss method construct map high featur space reproduc kernel idea kernel function enabl oper perform input space potenti high featur space product evalu featur space address comput critic depend number train pattern provid good data distribut high problem gener requir larg train set kernel function theori base reproduc kernel hilbert space product featur space kernel input provid condit hold symmetr posit definit satisfi kernel repres legitim product featur space valid function satisfi condit state valid real chapter featur space polynomi polynomi map popular method kernel prefer avoid problem hessian gaussian radial basi function radial basi function receiv commonli exp classic techniqu radial basi function emploi method determin subset centr typic method cluster emploi select subset centr attract featur svm select support vector contribut local gaussian centr data point select global basi function srm principl exponenti radial basi function radial basi function exp produc linear solut attract discontinu accept perceptron long establish singl hidden valid kernel tanh valu paramet sv correspond layer lagrang multipli weight chapter featur space fourier seri fourier seri consid featur space kernel defin interv π π kernel good choic capabl evid fourier transform spline spline popular choic model due flexibl finit order knot locat τ infinit spline defin interv case kernel solut cubic spline popular spline formul kernel defin interv attract close chapter featur space addit kernel complic kernel obtain form sum sum posit definit function posit definit tensor product kernel kernel obtain form tensor product kernel construct spline simpli obtain product univari kernel implicit explicit bia remark previou chapter kernel implicit bia bia kernel function lead slightli effici method implement solut obtain implicit explicit bia initi differ highlight difficulti interpret high featur space figur compar linear kernel explicit bia polynomi implicit bia evid solut solut offer good explicit implicit figur comparison implicit explicit bia linear kernel chapter featur space data data requir kernel due restrict advantag unrestrict kernel determin data requir input featur improv condit number hessian problem kernel select obviou question map map framework easier make comparison upper bound vc equat potenti avenu provid mean compar kernel requir estim radiu data featur space final strong theoret method select kernel valid independ test set larg number method bootstrap remain prefer method kernel select chapter classif iri data iri data set establish data set demonstr perform classif algorithm data set attribut goal classifi class iri base attribut problem restrict featur inform length width distribut data illustr figur figur iri data set class easili separ linear boundari svc solut product kernel illustr figur support vector circl support vector import inform classif boundari illustr potenti svc data select separ class class trivial exampl ident length correspond class figur illustr svc solut obtain polynomi clear area input space data classifi chapter classif iri data figur separ linear svc figur separ polynomi svm figur illustr higher order polynomi separ addit capac control svc determin hyperplan featur space evid overfit due high natur kernel disjoint region top illustr figur separ polynomi svm chapter classif iri data figur illustr gaussian radial basi function svc varianc result similar polynomi figur separ radial basi function svm figur illustr svc solut obtain polynomi toler misclassif error produc solut good expect import toler misclassif error due natur data input featur figur separ polynomi svm effect toler misclassif error topolog classifi figur show result linear spline svc misclassif toler valu offer good depend open figur close figur demonstr paramet optim prior knowledg problem requir select final solut chapter classif iri data figur effect separ linear spline svm applic larger complex classif problem attack svc osuna al appli svc exact problem face encourag result svc robust method pattern overfit problem adopt srm principl kernel function enabl solut implicitli support vector provid descript data classif chapter support vector regress svm appli regress problem introduct altern loss loss function modifi includ distanc measur figur illustr loss function quadrat laplac huber figur loss function loss function figur correspond convent squar error criterion loss function figur laplacian loss function sensit outlier quadrat loss function huber loss function figur robust loss function optim properti underli chapter support vector regress distribut data unknown loss function produc support vector address issu vapnik loss function figur approxim loss function enabl set support vector obtain linear regress problem approxim set linear optim regress function minimum ξ ξ slack variabl repres upper lower constraint output system loss function loss figur solut max max arg min ε ε α α α α α yi α ɛ chapter support vector regress α α solv equat constraint equat determin lagrang α regress function equat α xi condit satisfi solut support vector point lagrang multipli greater ɛ loss function problem min β regress function equat quadrat loss function quadrat loss figur chapter support vector regress solut max max α yi α α simplifi exploit equat note impli β result problem min β regress function equat huber loss function β huber loss figur solut max max result problem min β µ α yi α α β µ chapter support vector regress tabl regress data regress function equat data set tabl solut laplac loss function addit capac control shown figur linear regress figur linear regress similarli classif model requir adequ model data manner svc ping map data high featur space linear regress perform kernel approach emploi address loss chapter support vector regress figur max max α α α α solv equat constraint equat determin lagrang regress function sv α α svc equal constraint drop kernel bia accommod kernel regress function criteria loss function chapter similarli obtain replac dot product kernel function loss function attract unlik quadrat huber cost data point support sv solut quadrat loss function produc solut ridg order paramet λ exampl illustr kernel function model regress data tabl loss function addit capac control figur show solut sv circl dot line describ region solut data point lie region chapter support vector regress error loss result demonstr support vector region figur illustr solut figur polynomi regress radial basi function σ model flexibl model function error loss verifi fact data point lie zone figur show figur radial basi function regress solut linear spline kernel result model cubic due high capac function model data loss function notic overfit control figur show solut infinit similar solut spline kernel endpoint figur show solut exponenti rbf linear spline model high capac show behaviour extrem region chapter support vector regress comment figur spline regress figur regress figur exponenti rbf regress regress method select repres loss function addit capac control requir base prior knowledg problem distribut chapter support vector regress absenc inform robust loss figur shown good altern vapnik develop loss function robust loss function huber enabl sparsiti sv implement region demonstr section chapter regress data consid data illustr regress problem method control regress loss addit capac result shown chapter obtain loss function kernel capac control figur illustr solut linear spline kernel addit capac control evid solut li region figur illustr figur linear spline regress solut kernel addit capac control kernel prone oscil region linear spline altern loss function prefer figur illustr solut gaussian rbf kernel addit capac control rbf wide accur model data figur illustr solut gaussian rbf kernel addit chapter regress data figur regress figur gaussian rbf regress σ capac control rbf accur model data introduct region figur illustr solut exponenti rbf figur gaussian rbf regress σ kernel addit capac control solut linear function oscil avoid figur illustr chapter regress data figur exponenti rbf regress σ solut fourier kernel addit capac control solut suffer similar problem wide gaussian rbf kernel kernel accur model data figur illustr solut linear spline figur fourier regress addit capac extra capac control render solut incap accur model peak contrast figur figur illustr solut addit capac extra capac control render solut incap accur model peak contrast figur exampl shown repres set region typic care select addit capac control method cross valid requir loss function inappropri choic kernel solut oscil region chapter regress data figur linear spline regress applic figur regress appli time seri model problem achiev excel result appli data set santa fe time seri competit chapter support vector machin attract approach data model combin control techniqu address result global quadrat problem box readili solv interior point method kernel map unifi framework commonli emploi model enabl perform classif problem control obtain correspond weight vector canon framework solut obtain set support vector lie boundari inform requir separ data weight vector criterion regress modifi loss function futur direct niqu kernel function addit capac develop kernel invari appendix implement issu result problem depend number train ple data larg method speed algorithm problem smaller approxim exact method matlab implement main support vector routin shown note routin typic quadrat badli condit render quadrat program incap produc accur solut address quick fix order larg perturb solut significantli capac control support vector classif problem express matrix notat constraint min α zz α matlab implement appendix implement issu function alpha svc svc support vector classif usag alpha bia svc paramet train input train target kernel function upper bound separ case number support vector alpha lagrang multipli bia term author steve soton ac uk check correct number argument svc vector classif size inf end end construct kernel matrix end end add small amount order avoid problem hessian badli condit ey size set paramet problem set bound alpha alpha start point set number equal constraint set constraint ax end solv problem st alpha lambda appendix implement issu end time st alpha alpha alpha alpha comput number support vector epsilon alpha find alpha epsilon length vector implicit bia explicit bia find averag support vector margin sv margin alpha alpha find alpha epsilon alpha epsilon length length sum alpha support vector margin comput bia end end list support vector classif matlab code support vector regress problem loss function express matrix notat constraint min xx xx xt hx ε ε α xl α α appendix implement issu matlab implement function beta bia support vector regress usag beta bia loss paramet train input train target kernel function upper bound separ case loss loss function insensit number support vector beta differ lagrang multipli bia bia term author steve soton ac uk check correct number argument vector regress size end loss end inf end end construct kernel matrix end end set paramet problem switch lower loss case hb set bound alpha alpha start point set number equal constraint set constraint ax end case quadrat hb ey appendix implement issu start point set number equal constraint set constraint ax end unknown loss function end add small amount order avoid problem hessian badli condit rank equal note ad reg solut hb hb ey size solv problem st alpha lambda time st switch lower loss case beta alpha alpha case quadrat beta alpha end beta beta beta comput number support vector epsilon ab beta find ab beta epsilon length vector implicit bia bia explicit bia switch lower loss case find bia averag support vector interpol error sv interpol error alpha alpha find ab beta epsilon ab beta epsilon length bia length sum sign beta beta support vector interpol error comput bia bia max min end appendix implement issu end case quadrat bia beta end end list support vector regress matlab code appendix matlab svm toolbox matlab toolbox implement svm freeli academ download extract tar file matlab toolbox directori add matlab path type svm matlab prompt main user interfac classif regress bibliographi theoret foundat potenti function method pattern recognit learn autom remot theori reproduc kernel tran amer math bellman adapt control process princeton vetter comparison object recognit algorithm realist model von der von artifici neural network page springer lectur note comput vol cort vapnik support vector network machin curv surfac fit spline monograph numer analysi clarendon girosi approxim support vector machin ai memo mit artifici intellig sr km network perform assess fuzzi data model intellig data volum lectur note comput page lectur cauchi problem linear partial differenti equat yale theori applic penal squar method duce kernel hilbert space made mathemat theori algorithm john wilei bibliographi girosi nonlinear predict chaotic time seri support vector machin neural network signal process vii ieee ieee vapnik dict time seri support vector machin aj advanc kernel method support vector page mit press short version springer lectur note comput scienc girosi improv train algorithm support vector machin neural network signal process vii ieee page ieee koch comput vision regular theori smola regress estim support vector learn machin technisch universität smola method pattern approxim oper technic report gmd april weston implement issu support vector machin technic report comput intellig royal vapnik natur statist learn theori isbn vapnik statist learn theori smola support vector method function regress signal process advanc neural inform process system page mit press spline model observ data seri appli vol
ML/834 6 sarah lesli pack kaelbl ai memo april institut te cambridg ma usa institut te artifici laboratori mit abstract reinforc learn method oper proposit world state intract larg gener poorli deictic believ viabl gener exist method experi learn deictic report literatur paper explor form deictic nave proposit simpl domain deictic worsen perform conclud discuss result strategi learn domain object report describ work artifici intellig lab massachusett institut technolog research sponsor naval research contract telegraph telephon corpor part collabor nation scienc foundat graduat research fellowship introduct human world made door individu object set object stand relat artifici agent successfulli interact repres reason relat hold interest agent inher relat physic embodi learn act learn algorithm answer question interact order logic immedi mind due compact abil gener object quantif develop learn algorithm relat gener induct logic program specif dzeroski al relat reinforc learn move complex import establish exist techniqu break domain document attempt appli standard techniqu appar relat domain strategi ai plan relat domain finit domain describ domain larg set proposit repres instanti properti relat domain method inappropri learn give support gener object start work agr chapman gain momentum debat problem late issu ai magazin culmin argument made viabil deictic relat domain point object world role ongo activ arbitrari typic case order fact deictic lack gener fol attend comput complex exist reinforc learn algorithm deictic systemat investig circumst result perform compar naiv proposit underli domain relat paper present result set experi form deictic compar proposit respect learn problem domain result reinforc learn algorithm program chapman kaelbl algorithm remaind paper organ section briefli review reinforc learn impact choic natur learn problem section review deictic impact section describ set experi aim understand deictic section review relat work conclud reinforc learn term reinforc learn denot set problem set algorithm reinforc learn problem frame term reward agent observ environ environ action time agent action receiv scalar reward signal good action current state environ task face agent learn map observ histori action maxim reward receiv time map learn agent call polici denot observ probabl action observ observ call symbol correspond underli state environ agent percept reliabl correspond state environ fulli observ observ correspond state multipl distinct state agent environ partial observ yield learn problem optim action conflat state wai repres advantag disadvantag make discuss block world block color block tabl repres state atom uniqu configur block action state yield reward lead state simpl singl number repres entir state learn implement tabl index state price paid simplic high atom intract small number object assign color block wai stack block determin state gener action state state factor problem atom state repres set proposit distanc state measur term number bit encod make gener learn algorithm base neural network tree term proposit paper denot naiv relat domain block proposit color block proposit block stack proposit opportun refer object unabl perform import type gener object type ident object unimport long properti goal agent pick green learn rule express order block green top block pick rule appli number block size proposit rule polynomi function number block proposit version disjunct block cover existenti disjunct conjunct block cover quantif work rl learn domain state repres express fol partli deal uncertainti fol problemat exist work larg assum atom proposit state work combin rl fol requir introduct data structur learn algorithm unfortun wealth theori algorithm appli standard deictic potenti bridg gener fol amen solut face exist algorithm deictic subject section deictic word deictic deriv greek mean introduc artifici intellig agr chapman build ullman work visual routin deictic express mean rel agent context book door front exampl deictic express natur languag import class deictic deriv directli percept action relat agent object world agent direct percept sensibl speak agent pick thing primit deictic make compound deictic express directli percept relat speak benson describ interest system complex deictic express demand central deictic notion marker attent resourc control agent agent mark object attend move marker shift foci perceptu featur object mark object agent marker influenc mark object manipul agent wai percept action agent structur gener framework deictic agent marker object environ effect complet proposit agent marker limit perceptu window world environ fulli observ partial observ standpoint agent point spectrum deixi wide deixi fd special marker call focu number addit marker perceptu inform object mark focu perceptu action move focu move marker object mark move focu object mark marker object mark focu manipul agent wd perceptu inform object mark focu marker number practic deixi wide deixi inform state environ fd wd mean space requir fd wd agent learn long sequenc perceptu action gather inform state environ behav requir access short state histori learner rememb recent past start hypothesi deictic amelior problem advantag partial agent object object typic includ plai role current activ relev reward ultim receiv irrelev aspect world easili observ learn made easier gener passiv lack deictic gener object doesnt matter cup biolog object role plai agent current activ conjectur deixi plai role human repres world deictic agent control substanti partial exchang lose abil rest mccallum observ thesi partial observ learn obscur irrelev distinct hinder obscur relev thing miss literatur systemat evalu impact switch proposit deictic respect learn perform section report set experi begin explor block world learn agent exist simul block world learn hand remov red blue block green block block lift choic problem domain arbitrari whitehead ballard introduc pioneer work deixi relat domain develop lion algorithm deal perceptu result deictic avoid state mccallum domain demonstr number marker requir solv problem reduc short histori observ martin domain motiv evalu algorithm learn polici gener initi configur whitehead ballard block world whitehead ballard block world wai whitehead perceptu inform action marker agent move marker gain perceptu inform perform action whitehead algorithm requir separ percept action marker agent avoid ambigu restrict appli algorithm separ marker action combin give agent advantag natur area world relev current activ section whitehead action set includ primit top bottom stack gave agent basic primit action set move focu attent hope learn put search action task hope gener action arriv learner solv set task domain deal ambigu state avoid whitehead ad histori perceptu space assum agent ambigu state back task interest properti true mccallum block world mccallum block world test util memori base whitehead addit histori ambigu world addit marker agent solv complex mccallum move arbitrarili mccallum includ whitehead learn watch agent act teacher polici probabl direct influenc agent believ agent arriv optim polici learn action set mccallum slightli gener specif whitehead green task block world setup previou empir work deictic import wai goal understand condit systemat compar util proposit deictic evalu learn algorithm design oper tune perceptu featur train paradigm task appar reinforc learn work domain perceptu featur fine tune specif task face learn agent frequent exampl correct action provid teacher develop set perceptu featur reason agent arbitrari task block provid inform agent observ reward deictic deictic object conceiv long string idea implement set marker agent block agent fix marker block fix attent block develop flavor deictic focu marker addit marker agent receiv perceptu inform relat color block agent hand agent identifi addit marker bound block left focu deixi scenario narrow focu attent requir care decid attend wide deixi addit inform perceptu inform spatial proxim mark block inform spatial proxim block pair mark ident marker marker return inform block left marker redund case action set deictic agent focu move top stack tabl focu move side block focu fall top stack side block focu land randomli action succe block block top stack put block top stack move marker coincid focu move focu coincid marker proposit arbitrari assign includ tabl block agent perceiv block color locat block index horizont posit block block question singl bit hand hold block proposit agent action set action succe block block top stack put block top stack hand action fail agent attempt move hand edg tabl choic algorithm approach reinforc learn goal understand strength weak domain discuss altern method longer observ state deictic includ histori order make problem markovian addit inform requir render observ space larg explicit tabl requir learn algorithm approxim function includ histori order make problem markovian chose function approxim program common success method reinforc learn larg domain hope improv perform function approxim histori algorithm mccallum algorithm initi experi settl modifi version simpler algorithm neural network approxim pair reward distribut determin observ bit relev predict reward divid state space believ advantag program respect learn faster virtu abil discern part observ vector irrelev task ignor amount distract inform initi experi settl modifi version simpler algorithm descript program baselin comparison program algorithm bertseka tsitsikli neural network action action set number input node network equal length current percept vector past pair action percept vector histori paramet number hidden node number input node divid singl output unit approxim action learn rate discount factor updat observ found led stabl result partial observ domain descript algorithm algorithm make tree structur determin element state space import predict reward tree initi root node make state distinct fring node beneath distinct made statist root node fring node discount reward receiv agent statist test perform determin distinct fring worth ad perman tree distinct found fring distinct node ad fring creat beneath leaf node store updat leaf node tree domain fulli modifi origin algorithm begin fring includ histor distinct begin agent experi match leaf substanti complic bookkeep solv start episod observ past histori window agent make split ad bit observ vector agent aliv time append number experi begin trial rest observ vector fill arbitrarili partial observ arriv gener sampl determin split import statist origin algorithm vector discount reward state repres leaf fring state divid outgo action vector compar vector parent node examin split percept vector includ featur valu learn rate discount factor issu algorithm main reason decid algorithm test execut fring test object fring determin set node repres addit distinct significantli parent fring test compar util make addit distinct make distinct fring ks test instanc origin store parent compar instanc tent store fring node instanc calcul instanc record time reward receiv time discount util tree node instanc record time step sampl instanc directli calcul tree instanc statist test attempt find account uncertainti learn problem kind uncertainti learn increment algorithm uncertainti valu transit probabl state true underli mdp uncertainti valu transit probabl state approxim state encod tree statist test uncertainti present type uncertainti feel ks answer question reason calcul fring test fring dynam creat time fring test carri understood text mccallum step fring test leaf expand fring fix depth combin action observ deposit leaf instanc fring updat fring node compar distribut instanc fring node parent distinct distribut combin sampl instanc depend util repres node tree util node node newli creat fring problem statist node tree updat fring test result incorrect valu distribut compar problem acut earli stage tree small likelihood node depend fring correct approach recomput entir tree fring test compar origin valu parent valu fring extrem result perform hit sever render impract modif made algorithm essenti select percept major distinct remain requir experi world price greater comput rememb histor data estim model environ transit model state split experi proposit yield larg observ space full observ deictic yield small observ space partial observ make learn question section explor empir experi start configur compar size state action space comput size underli state space deictic size state space comput state space hand configur wai arrang block wai arrang block color true hand full true full proposit wai block deictic wai block block color number configur configur underli state space ground state underli state space deictic ground state comput size observ space deictic agent observ hand full featur block tabl block underneath posit stack size observ space number ground state roughli billion roughli deictic agent observ hand full featur wide agent mark object tabl ident marker underneath marker ident marker marker note observ space correspond size includ combin percept mark object agent true agent object tabl ident marker underneath marker ident marker marker ident marker left marker ident marker marker object agent true size observ space constant size deictic observ space wide deictic observ space action set deictic section chang addit constant action action set section requir action action setup learn task pick green block cover red block consist long green red block addit blue block distractor figur tabl block posit made color block agent receiv reward pick green reward action fail attempt move hand left edg attempt pick reward perform learn algorithm measur configur assign block random fulli observ case assign marker block random deictic case agent action learn time agent pick green origin configur restor reassign end epoch action state learn algorithm frozen agent addit action total accumul reward measur result plot length optim action sequenc deictic proposit scale result reflect optim perform respect agent data point agent comput accumul reward test ad maximum penalti obtain consist execut worst action worst divid maximum reward obtain optim polici step curv consist optim agent score consist terribl agent score trial initi result learn curv algorithm figur show proposit learner perform figur algorithm total reward trial number train iter domain million deictic wide deictic full proposit total reward trial number train iter domain million full proposit deictic wide deictic figur learn curv algorithm domain origin hypothesi addit block distract proposit repres block deictic case perform learner deictic hypothesi gap smaller addit learn curv deictic learner reduc observ space gave upper hand figur task configur size observ space addit learn perform configur degrad deictic section explor question algorithm total reward trial number train iter domain million deictic full proposit wide deictic total reward trial number train iter domain million full proposit wide deictic deictic figur learn curv algorithm domain hypothesi perform discov opposit true agent algorithm learn slowli agent distractor block ad agent reach solut optim tree larg tree plot figur cap includ fring section investig tree larg discuss section result present explan compar deictic proposit deictic compact observ space abil focu interest part state advantag proposit conjectur advantag grow pronounc amount distract state inform figur show hypothesi true understand deictic understand problem harder addit distractor block start hypothesi block explor problem deictic learner space observ stai true consist block configur locat quickli deictic action action condit block marker bound deictic learner direct access focu complex part state space reduc likelihood arriv solut explor set long random agent solut metric quantiti call quantifi explor problem count number action random agent arriv goal measur set agent action randomli number distractor block time place addit blue block side origin stack green red block measur number step random agent reach goal result averag trial agent configur left graph figur number step randomli number addit blue block averag number step reach goal random walk deictic number addit blue block averag number step reach goal random walk deictic longer action sequenc figur number distractor block agent start blue block success ad side origin stack arriv solut deictic case case dramat explor task harder extra learn perform set experi involv pin choic action set explor experi investig length optim action sequenc explor origin action deictic agent requir reach goal requir step reach goal number action requir reach test agent task requir step reach goal task pick green block initi cover red block expect longer optim action case grow deictic case graph figur show grew faster order magnitud deictic case conclud length optim action sequenc problem deictic case number addit blue block averag number step reach goal random walk deictic deictic reduc action set number addit distractor block averag number step reach goal random walk deictic full proposit modifi deictic figur number distractor block action set experi investig size action set number explor remov action deictic action set believ distract deictic compar random deictic agent action set reduc action consist action random agent origin action set left side figur show result experi rate growth slightli order magnitud chang deictic action set order characterist deictic action set make explor creat action set modifi action idea modifi action set thought characterist deictic action block pick origin action essenti task action modifi action set deictic modifi action set similar set mccallum experi move focu left version action stricter origin set block direct focu land focu stai put focu tabl color block pick block top stack mark exact block put block held top stack mark focu move hand stack block move hand left pick block top stack underneath hand put block held top stack underneath hand graph figur show result agent grow opposit modifi action set grew roughli rate origin set main deictic action set modifi action reduc great deal depend action focu locat focu locat observ agent number distractor block unobserv part state space grow exponenti remov strict depend focu locat likelihood agent explor make progress modifi action probabl success action probabl harm action appendix inform analysi rel action set learn experi figur modifi action set show deictic agent learn compar agent slightli faster agent total reward trial number train iter domain full proposit wide deictic deictic total reward trial number train iter domain deictic wide deictic full proposit figur learn curv deictic agent modifi action set compar side figur deictic set action chosen carefulli reason bia provid unsatisfi note order render deictic action set remov depend made deictic initi focu attent option provid structur hierarch tempor extend action clever action hierarchi abstract partial observ exist level atom action hierarch action provid level make virtu abstract exploratori provid determinist action space compar program order agent learn polici optim initi result show grow tree unreason larg tree grow reach natur limit state avoid run add arbitrari cap size tree observ develop theori tree larg tree node distinguish state respect reward receiv state repres distinct leaf tree polici learn tree grow larg includ leav state distinct valu polici learn simpl make problem clear section consid simpl maze shown figur start goal figur state start state goal state unnecessari distinct simpl agent observ wall cardin environ partial state requir action reach goal time agent receiv percept vector move direct agent reward reach penal step lead penal slightli attempt move wall algorithm made distinct split distinguish state base south clear block separ state state observ trial subgroup split east separ state state larg reward receiv east state leaf state polici east figur show tree point learn process polici learn state distinct west east south figur tree split distinct made previou action node state shown figur meaningless distinct addit inform yield previou state state action inform east state state south action mean state util subsequ polici depend current state distinct east south north west east west south north west north figur tree split examin polici agent make distinct begin make agent state polici east state state oscil west east explor lead agent south state agent visit state gener perform east action agent state perform south west action split previou current disambigu high probabl state yield reason north state shown figur made distinct base polici lead algorithm make distinct attempt fulli repres function polici execut polici shown figur fact valu state depend visit time tree larger requir store function optim polici experi confirm explan larg tree fix polici agent tree grow obtain tree unnecessari split repres function fix polici avoid make bad split due statist natur underli larg tree note problem exhibit figur sampl polici complic tree problem grow unreason larg tree pomdp address kind complex tree requir adequ explain valu current polici complex tree complex polici requir complex tree repres valu reason wasnt encount problem previou work problem requir addit histori order enorm state add histori york drive task requir end tree terribl larg reason termin train arbitrarili state tree grown larger train continu mccallum remark tree larger fact tree larger tree comparison solv problem adopt action altern develop polici learn function polici begin function tree explor redund leav notabl reason tree grow larg pomdp abil current state term histor action learn algorithm frequent multipl perceptu correspond underli world state set state focu green block focu green block clear multipl action observ sequenc singl underli algorithm data doom build underneath lead actual identif underli world prerequisit learn pomdp approach convert inher relat problem proposit success long run nave grow size squar number object sever redund due arbitrari assign object deictic approach fatal gener action set lead long earli trial intermedi reward amelior assign intermedi valu attent state inher dramat partial observ pose problem reinforc learn algorithm perform fix window amount histori select relev aspect swamp huge input space algorithm suscept problem induc interact partial estim chang approach higher level strategi work deictic proposit reinforc learn altern learn direct polici search problem partial observ inherit problem local search appli learn polici express stochast control work domain method parametr form polici scale environ strategi appli pomdp framework directli learn model world dynam includ evolut hidden state solv model analyt optim polici intract onlin modul endow agent encapsul import inform action observ histori algorithm successfulli learn map mental state action drastic approach give proposit deictic express individu real relat import earli work relat reinforc learn show relat gener complex complet observ environ state repres conjunct relat system induc logic regress tree test order express intern node predict valu leav intern node variabl gener object ident recent work appli induct logic program techniqu stochast unclear work case recent work al adapt algorithm relat reinforc learner increment work problem encount system commit split earli forc duplic relat relat complex learn problem shift problem present proposit domain split gener attribut line deal gener object relat deal partial observ learn model world dynam plan continu work pursu program indirect reinforc model state relat deictic object world acknowledg work fund naval research contract telegraph telephon corpor part collabor nation scienc foundat graduat research fellowship inform analysi action set figur inform analyz action set origin modifi move space state configur goal column show configur block agent optim polici goal column list action action set section descript action move agent strictli forward trajectori list action approxim probabl randomli select action action action full column list action move agent strictli backward probabl randomli select action note probabl list figur intend illustr action set messag origin deictic action likelihood randomli action advanc low compar likelihood action set modifi deictic action set reason explor origin deictic action set advanc action likelihood regress action likelihood world configur likelihood advanc likelihood regress figur trajectori agent origin action set advanc action likelihood regress action likelihood likelihood advanc likelihood regress world configur advanc action likelihood regress action likelihood likelihood advanc likelihood regress world configur figur trajectori deictic agent origin action set likelihood advanc likelihood regress world configur likelihood advanc likelihood regress world configur figur trajectori deictic agent modifi action set refer philip agr david chapman implement theori activ sixth nation confer artifici baird residu reinforc learn function approxim intern confer machin dana mari pn rao deictic code embodi cognit behavior brain scott benson learn action model reactiv autonom agent phd stanford dimitri bertseka dynam program optim control athena volum dimitri bertseka john tsitsikli program athena david chapman lesli pack kaelbl input gener delai reinforc algorithm perform comparison intern joint confer artifici kurt jan hendrik blockeel speed relat reinforc learn increment order tree learner european confer machin de blockeel relat reinforc learn fifteenth intern confer machin page morgan saso luc de kurt relat reinforc learn machin sridhar mahadevan hierarch reinforc learn advanc neural inform process michael singh converg stochast iter dynam program algorithm neural novemb henri kautz bart selman plan satisfi european confer artifici lane lesli pack kaelbl determinist abstract markov process nation confer artifici mario martin reinforc learn agent face complex task phd universitat de andrew mccallum reinforc learn select percept hidden state phd andrew mccallum util distinct reinforc learn hidden state twelfth intern confer machin page san morgan kaufmann nicola lesli pack anthoni cassandra solv pomdp search space finit polici submit stephen muggleton luc de raedt induct logic theori method journal logic richard sutton open theoret question reinforc learn european confer comput learn john tsitsikli benjamin van roi analysi learn function approxim ieee transact automat ullman visual routin steven whitehead dana ballard learn perceiv act trial error machin william simpl statist algorithm connectionist reinforc learn machin
IR/835 5 electron mail filter user studi abstract electron mail offer rapid commun essenti inform electron mail send unwant messag varieti approach learn profil interest filter mail report usabl studi investig type profil peopl filter mail keyword mail user studi introduct electron mail offer rapid commun essenti facilit transmiss unwant messag light bulb chain urban softwar automat sort mail categori talk homework autom process sort mail priorit messag suggest action delet junk mail forward urgent messag handheld softwar maintain profil interest investig user profil usabl point view goal paper investig altern user profil show altern affect user accept autom system filter mail altern profil equal peopl confid profil present commerci program user inspect base rule pattern text rule learn program ripper easili learn rule approach classifi text electron mail includ linear michael pazzani depart inform comput scienc irvin ca model callan heckerman learn percept support vector machin naïv bayesian classifi prove effect applic earliest text classif method base find centroid exampl class method competit recent approach text classif introduc prototyp profil show accur altern approach user place confid profil linear model illustr altern collect sampl mail messag faculti unwant import task difficult junk mail filter unwant mail includ unwant item talk grant call paper faculti member interest similar style import messag linear prototyp mail filter rule commonli mail filter profil cohen argu learn type greater rule advantag system user extend modifi learn figur present set rule learn ripper exampl mail messag discard bodi bodi bodi bodi bodi bodi bodi bodi forward figur rule learn ripper filter linear model shown form accur profil user interest callan figur show linear model learn perceptron mail exampl inform term binari variabl linear model fewer variabl variabl coeffici equal discard forward figur linear model mail filter learn perceptron linear model view sum evid discard mail messag sign coeffici equat figur counterintuit neg coeffici indic presenc term evid forward term occur frequent messag delet pazzani bai report peopl prefer linear model sign coeffici equat direct correl explanatori variabl depend variabl investig view sum evid perceptron weight categor made similar comparison prototyp figur show prototyp learn train exampl describ prototyp learn algorithm detail prototyp classif process simpli categor class prototyp term common messag discard forward figur prototyp model mail filter address profil individu word term pair term gener find number paper pair word term slight posit effect accuraci specul profil displai user prefer profil word pair previou research profil learn restaur recommend word pair made includ term investig hypothesi empir group subject figur show prototyp includ word pair term learn messag figur space limit prohibit show rule linear model word pair messag discard forward figur prototyp model word pair term final issu investig empir person detect profil accur creat inaccur profil introduc classif train exampl achiev invert categor exampl chosen random profil make mistak origin goal paper explor altern user profil specul affect peopl result text mine algorithm creat understand profil interest treat intuit conduct studi evalu prototyp accept user rule prototyp accept user linear model word pair term accept profil linear inaccur profil noisi train accept user accur linear mail filter experi report studi subject filter mail judg profil learn data shown figur previou section decid focu task forward discard file folder establish result peopl perform simplest case address complex task subject subject male femal student major inform comput scienc irvin particip experi receiv extra credit stimuli stimuli consist mail messag mail filter profil profil gener prototyp learner learn includ individu includ word pair word pair learn data ad procedur subject imagin assist faculti member job decid forward discard mail messag faculti member stimuli shown figur figur unwant electron mail phase subject shown mail messag time subject messag forward discard receiv feedback correct mail messag select randomli replac record number error made subject block ten messag final phase subject shown mail filter profil time random order scale profil perform made forward discard mail rate select radio button click shown profil radio button reset displai profil continu subject rate profil figur show displai record rate subject profil determin type profil subject result analysi subject error show subject improv feedback block ten subject made error subject improv block ten fourth block averag rate subject type mail profil shown tabl perform pair determin discuss section support find adjust account fact make comparison figur subject provid feedback mail profil differ highli prototyp word pair receiv higher rate rule word pair inaccur prototyp model noisi train accept user accur algorithm rate rule rule rule linear model linear model linear model prototyp prototyp prototyp tabl rate subject type mail profil differ prototyp word pair receiv higher rate linear model word pair inaccur linear model accept user accur differ margin prototyp word pair term user discuss result studi confirm intuit initi plan focu rule explor differ individu word word pair result ripper rule wide varieti paramet appar easi understand learn rule classifi learn rule credibl subject easili imagin counterexampl rule rule filter mail term assum fail mail subject greatli prefer prototyp subject prefer accur rule accur rule learn noisi data power learn rule includ word pair user confid rule prototyp word pair receiv higher rate profil differ profil linear model word rule model word prototyp model learn noisi data differ prototyp model individu word term prototyp word pair margin context comparison studi linear model accept user prototyp model user distinguish linear model accur train data learn noisi data result influenc term user distinguish small coeffici affect accuraci learn text classif prototyp subject studi prefer prototyp text classifi feel small number word class describ prototyp construct initi attempt creat prototyp simpli select word highest criteria inform result profil accur classifi adopt genet algorithm approach creat prototyp class learn pair prototyp text train convert bit vector length bit repres presenc absenc individu word inform term distinguish posit exampl discard neg select binari featur individu popul repres bit vector length bit repres prototyp discard remain repres prototyp discard term present prototyp repres present prototyp classif procedur prototyp simpli count number time term present occur locat discard forward prototyp term common discard prototyp forward messag classifi discard classifi forward genet algorithm oper initi popul individu individu initi popul form concaten randomli select posit randomli select neg individu score fit function simpli check accuraci train produc procedur caution comparison order wai visual linear model user displai word posit coeffici green neg coeffici repres magnitud coeffici bright color individu select popul probabl proport individu fit individu creat applic crossov oper mutat oper bit replac random bit probabl individu fit previou gener retain genet algorithm run gener produc improv fit function gener fittest individu return experi algorithm show compar accuraci method naïv bayesian classifi drawback prototyp involv user edit prototyp hard user anticip effect ad delet term prototyp edit environ effect easili visual train set plan acknowledg research fund part nation scienc foundat grant comment robin daniel billsu kick earlier draft paper clarifi issu present explor factor affect user prefer automat learn mail filter profil subject rate learn profil autom task subject learn found subject confid learn rule text classif prototyp experi show competit accuraci text classifi readili accept user find suggest word pair term improv user accept learn prototyp profil refer learn rule classifi aaai spring symposium machin learn inform access pattern classif scene analysi john wilei son induct learn algorithm text categor train algorithm linear text classifi learn user identif interest web site machin framework demograph filter artifici intellig review program machin learn morgan lo california relev feedback inform retriev gerald salton smart retriev experi autom document process englewood nj horvitz bayesian approach filter junk workshop learn text wisconsin
IR/836 5 context filter inform filter murthi intellig system lab dept comput scienc autom indian institut scienc india context filter inform filter jan abstract inform filter system featur document worth design system find paper disambigu methodolog call context filter find input occur requir context context filter factor ambigu factor special inform filter handl structur fashion structur context filter good context filter varieti context consid exist disambigu method inform filter model context filter mode build context filter suggest algorithm learn idea context filter report paper form import element instruct inform filter agent develop kei inform context list introduct inform filter process separ irrelev document relev huge avail electron document flood user lot inform provid effect mean extract document interest motiv research develop softwar agent interact user find interest knowledg chunk document extract document relev inform inform filter softwar agent emploi natur languag process techniqu base techniqu analyz repres document compar user profil learnt agent filter irrelev criterion base techniqu simpl wide emploi inform filter system paper emphasi base system base set extract manual method set appropri repres document user profil user profil separ boundari relev irrelev document filter system develop web document filter exampl system info topic base filter system classifi rule base system weight base system rule base system follow explicit rule express term separ relev document irrelev weight base system find similar document user profil space base similar decid document relev topic sift exampl rule base system exampl weight base system import characterist inform filter domain dynam document collect long term interest user characterist give rise evolut rich involv user achiev make process user user import rich accur feedback expect user learn process rule base system suit good rule base system paper time document repres base inform filter find proper lead uncertainti filter process natur languag process interest disambigu interest led develop disambigu system system base lexicon base corpu base method section explain scheme paper method suitabl inform filter method paper factor uncertainti inform filter methodolog call context filter reduc uncertainti factor uncertainti factor handl tradit disambigu system factor concern inform filter domain methodolog provid base easi handl filter build process methodolog user build context filter mode learn minim interact learn learn interact learn hand craft entir filter methodolog share partial filter user support reliev user build context filter scratch context filter correctli recogn proper support context extract relev paragraph document relev rule confirm context filter limit rule base equal applic weight base system paper organ discuss factor uncertainti section motiv methodolog call rectifi problem section present structur context make descript featur context filter section mode build context filter section discuss flexibl design wider applic context filter section compar method disambigu exist disambigu system context inform filter factor uncertainti inform filter contribut partli uncertainti usag partli uncertain relat topic document factor uncertainti ffl implicit absent document topic repres present situat refer implicit situat involv call implicit situat occur wai explicit absenc synonym present phrase absent synonym present explicit absenc synonym confer refer refer inform filter confer announc document implicit note paper report chess tournament absent ffl pseudo present document presenc relat requir topic situat call pseudo situat involv call pseudo refer intend broad refer document filter commun data filter requir topic document occur document document filter document relev occur chess document pseudo casual mention topic chess ffl broadli defin occur broad special mean improv certainti definit relev occur document refer document filter refer html document filter filter filter exact refer find refer intern nation region tournament find exact usag found ffl defin occur tend defin correct case relev rule filter genet exist paragraph discuss topic paragraph discuss case simpl presenc document suffici decid presenc topic requir interrel presenc section present scheme reduc uncertainti factor context filter solv problem section elimin lot improv filter phrase call context occur featur pair solv problem featur context filter pair depend featur true set featur falseg set context found respect pair definit section posit pass filter call context filter context filter filter posit occur posit context occur neg context posit context requir occur context neg context requir absenc context reason includ relev definit directli separ filter ffl stabl context rule user time context definit user group remain stabl time user work similar stream document relev definit vari user user time time good idea process document stage singl stage ffl prohibit rule length relev definit reason includ directli relev definit lead longer rule rule prohibit higher rule length make rule slow learn ffl uniform applic filter entir relev context filter appli applic relev definit short augment context filter augment posit neg reduc rule length improv speed learn structur context filter suggest context filter seri context filter stage shown figur stage remov uncertainti factor discuss previou section input stage list posit confirm earlier stage context filter work work stage doc confirm kei phrase pseudo kei phrase elimin kei phrase special local confirm context featur extract implicit kei phrase find posit extract posit figur context process posit document stage implicit posit document output true posit absent requir posit context present output true stage elimin pseudo output stage posit input presenc posit context absenc neg context posit question occur requir output stage true posit stage elimin valid broad occur requir specif output stage true posit input true occur requir context specif stage elimin posit occur local context requir posit context posit question posit context posit elimin occur order stage stage oper order order import number reason order context filter stage understood view correct view point view point give support argument posit stage posit stage support view point correct view point unlik stage output stage true input stage stage dummi stage function stage stage stage pseudo filter stage output stage true wrongli process stage posit stage understood view point remain stage process occur qualifi explor posit captur implicit stage order remain stage context filter support view point unlik implicit output stage stage correct affect chang order stage local finder stage work valid check correct local invalid refer special special broad requir input broadli accept pseudo elimin output broadli posit special pseudo elimin justifi order stage type context context phrase featur context filter context jointli context occur respect featur context filter defin type context context defin window question posit document occur context context phrase context phrase occur posit satisfi condit window size context depend window size defin type context context local context context global context context window size satisfi local global definit context valid structur unstructur document structur document definit context augment varieti structur document user vari augment context definit suggest common augment context definit phrase occur phrase occur section satisfi window condit context present titl section phrase occur local phrase occur section satisfi window condit local occur titl section phrase occur phrase occur section satisfi window condit context occur titl previou section phrase occur document occur global document context phrase relat context phrase influenc influenc effect region occur mean locat influenc window locat document depend type context occur respect context filter stage activ type ffl support context support posit presenc posit document requir posit context present requir neg context posit support stai list posit stai list context chang effect rang context definit occur stage type ffl associ context support effect rang defin context context expand posit effect rang rang cover associ posit context cover associ neg context posit context give rise possibl locat consid context stage local context stage type input stage give rise window absenc input stage output window window cover size window greater rang presenc implicit model oper context filter repres context filter list pair class constant true list defin classif function input defin equal index true test perceptron conjunct attribut featur attribut context filter list pair earlier list complement form list conjunct featur chosen dnf express list conjunct vice hierarch structur list natur inform filter domain user insert node perceptron test list posit document fed context pass stage order section exampl describ preliminari context filter document filter filter html document filter machin learn techniqu list stage output true posit phrase output true posit phrase global context occur context case impli presenc topic repres similarli output true posit phrase occur synonym output posit suggest default test document filter stage global context condit met posit pseudo occur filter specif definit html document stage posit filter paragraph talk machin learn appli inform local context posit posit meet requir filter posit meet expand cover nearbi phrase phrase chess report india plai intern tournament list stage stage output posit meet condit global context stage transpar filter input stage presenc intern player list presenc case output input posit true filter stage local context input posit stage expand cover filter method build context filter input featur context filter pair section featur vector depend posit document context phrase local corpu base method extract automat suitabl inform filter task requir larg corpu assum manual suppli context occur respect pair automat consid document locat pair extract document instanc extract instanc test context filter instanc build context filter mode stage built stage stage build build stage manual construct list requir stage extract featur build stage context filter built show exampl learn mode batch increment learn algorithm learn list build context filter list maintain sampl previou call valid set increment mode instanc classifi current list instanc classifi valid set chang made list classifi instanc correctli increment list algorithm outlin appendix set instanc increment algorithm repeatedli call sequenti repeat till criterion met batch mode set instanc mix valid set list built scratch batch list learn refer appendix outlin algorithm build list data build list list built sourc merg list valid set list list merg refer appendix sketch algorithm build hybrid approach build context model domain simpl reinforc feedback instanc learn method interact method user correct rule test node test node list featur make learn faster compar mode involv learn part complet hand craft list requir mode receiv set feedback method approach learn agent structur modif list suggest user increment algorithm invok reinforc feedback instanc passiv interact updat interact mode learn agent show updat base criterion user suggest choic list updat dialogu process list updat complet user termin dialogu process termin dialogu process learn agent remain requir updat comment context filter provid context filter offer flexibl design wider applic sharabl context context invari time group user work similar stream document context filter built user user increment modif context filter domain context filter paragraph paragraph extract process retriev paragraph document relev inform context filter augment definit document associ context definit improv paragraph extract process effect elimin augment view term context context filter weight base inform filter context filter weight base system weight pair weight improv filter consid rel definit pseudo broad definit pseudo broad rel respect user user interest inform filter occur context filter pseudo occur similarli user interest type inform filter unlik section consid broadli defin provid suitabl inform filter domain disambigu method suitabl section context filter inform filter section present argument support fact inform special featur context filter paper suit compar exist disambigu system special featur structur handl handl stage manner gener specif definit stage defin function lead good stage filter properli stage wrongli filter easili filter function understood base stage emploi advantag credit assign problem function stage wrong process easili find stage modifi correct handl implicit reduc absent exist system recognit recogn local context context usag global context enhanc power disambigu exist system context system local context remain context crucial inform filter flexibl model list chosen make lot conveni context filter develop increment learn batch learn list context filter develop combin list merg give perform merg context filter develop document collect develop user combin fuller perform provid lexicon group thread html document difficult provid extens lexicon similarli size corpu model dont lexicon corpu built increment fly user built collabor user algorithm discuss requir model requir select save search speed learn process flexibl select phrase chosen context phrase depend user requir highli unlik corpu base disambigu criterion user lead user activ develop context filter involv user speed develop process futur direct paper present factor base inform filter system resolv improv perform structur call context filter resolv defin featur work outlin build context filter discuss featur final provid compar analysi method exist disambigu system number thing make idea automat extract context phrase develop abil adopt corpu method mode build context filter context filter develop user environ exchang high level inform develop environ easi present receiv result process result appendix section present sketch algorithm increment learn merg list specif develop instruct inform filter agent develop present sketch webb algorithm batch learn list detail present space constraint detail algorithm forthcom paper gener algorithm increment learn batch learn list literatur increment valid find win test node ni ni correctli classifi return list node order similar ni list empti top test node list test node win node gener test node cover ni special test node uncov wrongli cover uncov ni check met accept goto delet test node list add test node win node special node test node cover ni uncov gener special node cover wrongli uncov test node cover ni gener test node cover ni special test node uncov wrongli cover uncov ni check met accept goto delet test node list empti top node list present add node class label ni test cover ni wrong instanc check criterion met accept goto delet pn add ni return merg list valid set list valid set nv nv make fi classifi correctli fi classifi incorrectli fi classifi correctli fi classifi correctli evalu induc rule cover uncov augment test node rule append augment list prune reduc complex return batch instanc find probabl class cp induc default class dl dn find instanc misclassifi find probabl class mi induc minim rule cover exclud add node test found rule check met return goto refer della della disambigu statist proc acl berkelei induct machin learn rule induct recent machin european yve rule induct unifi fourteenth intern joint confer artifici intellig inform filter semant interpret disambigu cambridg algorithm word proc raw corpu word disambigu fifteenth nation confer artifici intellig juli wi learn algorithm word disambigu fourteenth nation confer artifici intellig juli ri learn machin learn learn list homogen proc nat conf page effici algorithm increment learn technic inform scienc southern comprehend word theori strategi natur lawrenc erlbaum word disambigu index massiv semant wordnet disambigu word text proc acm recent progress learn list prepend infer singapor intern confer intellig semant natur artifici intellig disambigu statist model categori train larg corpora
ML/837 6 machin learn approach build search engin andrew mccallum kamal nigam jason renni seymor research henri street pa school comput scienc carnegi mellon pa abstract search engin increasingli popular offer accuraci extra featur search engin difficult timeconsum maintain paper machin learn techniqu greatli autom creation mainten search engin describ research reinforc text classif inform extract enabl effici popul topic identifi inform text segment built demonstr search engin comput scienc research paper introduct amount inform world wide web increasingli difficult find search engin altavista hotbot offer high provid low detail queri inform search engin power tool complex queri summer camp locat cost perform search search engin extrem tediou imposs search engin increasingli popular build search engin typic requir ongo human effort paper describ ra effort autom aspect creat maintain domainspecif search engin machin learn techniqu techniqu search engin creat quickli minim suit domain paper present machin learn method effici build browsabl topic extract substr briefli paragraph search engin begin collect document index aim popul search spider explor web explor direct fashion find document effici frame spider task reinforc learn framework kaelbl mathemat defin result show simpl reinforc learn spider time effici spider search search engin provid browsabl topic yahoo prototyp automat ad document topic hierarchi pose text classif task present extens naiv text classifi mccallum train result accur classif unlabel hierarchi keyword algorithm combin naiv hierarch shrinkag place document comput scienc hierarchi perform approach human agreement level extract piec inform document search engin user search featur gener search engin inform process automat find specif textual substr suit task approach inform extract techniqu statist languag model speech hidden markov model algorithm extract field affili research paper header accuraci brought machin learn techniqu search engin comput scienc research paper intellig spider start home page comput scienc depart laboratori collect link postscript document document convert plain text figur screen shot queri result page cora search engin note topic hierarchi extract paper author abstract process determin research paper abstract refer import identifi inform titl author extract head bibliographi section extract result group citat paper build citat graph phrase keyword search facil collect paper comput scienc topic hierarchi list paper research topic figur show result search queri topic hierarchi hope addit provid platform machin learn search engin valuabl tool comput scientist section describ research make cora detail provid mccallum al paper cora web page effici spider effici spider concern page cs depart web site research paper search engin index search collect cora index small subset avoid region web graph significantli improv effici number research paper found finit amount time formal set frame problem effici turn reinforc learn reinforc learn framework learn optim reward punish kaelbl agent learn polici map state action effort maxim reward time discount model reward time geometr discount sum fl reward receiv futur repres polici map pair expect discount reward polici made select action largest aid understand reinforc learn relat common reinforc learn task explor maze find piec agent receiv reward find piec action move grid squar maze state posit locat piec remain consum consum provid reward note order act agent futur reward spider document piec action hyperlink state set document remain set hyperlink discov kei featur spider make reinforc learn proper framework environ present situat delai reward problem practic appli reinforc learn spider enorm spider gener hyperlink make simplifi assumpt disregard state captur relev distinct action word found neighborhood hyperlink map scalar repres map collect naiv text classifi section cast regress problem classif discret discount sum futur reward valu train data place hyperlink bin text hyperlink anchor surround page train data classifi test estim hyperlink weight averag bin averag classifi probabilist class membership weight system studi framework defin optim behavior collect reproduc mutat agent system reinforc learn web task webwatch joachim assist combin reinforc learn percent research paper found percent hyperlink spider cs depart rl rl futur figur averag perform reinforc learn spider versu tradit search relev hyperlink user laser reinforc learn tune search paramet search engin boyan result august fulli map cs depart web site brown cornel pittsburgh texa includ document hyperlink perform data train spider test fourth target page reward comput scienc research identifi separ simpl algorithm high train agent find target page train calcul hyperlink discount sum reward result execut optim polici determin full knowledg web agent learn experi spider evalu split spider test start depart home page figur report result tradit search reinforc learner fl repres binari classifi reward hyperlink futur fl repres classifi futur reward time reinforc learn spider found research paper search measur perform number hyperlink research paper found reinforc learner significantli requir explor requir repres factor spider effici note futur reinforc learn spider perform spider futur reward select altern give reward averag spider time long futur find paper paper spider perform slightli link reward spider recogn accur ongo work improv accuraci classif futur reward larger number bin run experi task singl target futur reward crucial futur spider retriev target page effici spider renni classif hierarchi bootstrap keyword topic hierarchi effici organ view larg quantiti inform cumbersom yahoo topic hierarchi integr part search engin creat hierarchi comput scienc top part shown figur creat hierarchi structur select keyword node expert examin confer comput scienc web site difficult part creat hierarchi place document correct topic node yahoo hire peopl categor web page hierarchi machin learn autom task text classif acquir label train document build accur classifi prohibit burden classifi builder unlabel keyword class hierarchi builder train builder simpli keyword categori larg collect unlabel document label keyword classifi document keyword place class keyword preliminari label document remain unlabel bootstrap improv classifi document preliminari initi naiv text classifi preliminari label dempster estim label unlabel document label document statist shrinkag incorpor order improv paramet estim class hierarchi paper combin time document classifi em unlabel data hierarch shrinkag bayesian text classif framework multinomi naiv text classif paramet model class frequenc word jc rel document frequenc estim paramet document determin probabl belong class jd jd ik jc ik word occur kth posit document train standard naiv classifi requir set class label estim word frequenc simpli smooth frequenc word occur train document jc jd jv jv jd number time word occur document jd indic document belong class jv number word vocabulari class frequenc smooth document frequenc estim data combin label unlabel data past work shown naiv paramet estim improv em combin evid data nigam bootstrap initi naiv model estim data em iter converg label data rebuild model data preliminari label serv provid good start em incorpor unlabel data preliminari label class organ naiv paramet estim improv statist techniqu shrinkag mccallum word frequenc paramet estim class calcul weight averag classs local estim ancestor hierarchi form pool data ancestor techniqu balanc tradeoff specif local word frequenc estim reliabl gener ancestor frequenc estim optim mixtur weight weight averag calcul em concurr class label result describ result classifi comput scienc research paper hierarchi test set creat random sampl research paper paper entir cora archiv fit discard abstract paper full text tradit naiv label train test result classif accuraci document minut creat smaller train set result accuraci classifi base keyword turn bootstrap approach noisi train tradit naiv text accuraci reach test set full includ em hierarch achiev accuraci interest human agreement peopl test set result demonstr util bootstrap approach keyword match naiv em hierarch shrinkag result classif accuraci close human agreement level automat creat preliminari keyword avoid human effort train data futur work plan refin probabilist model document interior hierarchi document multipl class multipl mixtur compon class investig principl method word featur cluster provid discrimin train unlabel data inform extract inform extract concern identifi phrase interest textual data case search engin research automat extract inform text segment search specif provid effect present search result show titl match refer paper investig techniqu extract field relev research header refer section paper inform extract approach base hidden markov model accompani search techniqu wide speech recognit tag discret hmm set state emit symbol discret vocabulari set transit state common goal learn problem hmm recov state sequenc highest probabl produc observ sequenc volum editor institut titl journal tech date institut author figur illustr hmm refer extract arg max probabl transit state probabl state emit output symbol viterbi algorithm effici recov state sequenc hmm extract inform research paper formul model state class affili state emit word unigram distribut order label text treat word text observ recov state sequenc state produc word class tag word illustr hmm refer extract shown figur work hmm inform extract learn model structur number state automat data system hmm inform extract includ leek extract inform gene locat scientif system bikel extract system automat determin model structur state model assembl inspect train exampl experi goal inform extract experi investig model multipl state manual automat outperform model state class header extract defin header research paper word begin paper section end whichev occur singl ad end header case termin abstract automat locat substitut singl token special class word identifi simpl regular express convert token case newlin inform remov text target class identifi includ fifteen public page manual tag header split word token label train set word token test set unigram languag model built class smooth modifi form absolut discount state class unigram distribut emiss distribut compar perform model state class model multipl state class model deriv train data hmm built word token train set assign singl state transit state state class label word token hmm put seri state merg order gener model combin state share uniqu transit class label adjac titl state merg titl state state transit count introduc merg state model start point model manual merg made iter manner produc automat forward backward procedur produc model consist merg state share transit common state label transit probabl model set maximum likelihood baselin model transit count directli label train model count preserv state merg process model perform measur word classif percentag header word emit state label word true label extract result present tabl hidden markov model extract header perform obtain model model outperform baselin indic richer model deriv data benefici model perform model model number number model state transit accuraci baselin tabl extract accuraci model limit state merg model unrestrict expect sophist state merg discuss seymor result model inform extract relat work relat research project investig automat construct web site zealand digit librari project witten creat search engin domain comput scienc technic report song melodi manual identifi web sourc project bollack develop search engin comput scienc research paper similar function match refer search webkb project craven machin learn techniqu extract inform web knowledg base whirl project effort integr varieti sourc singl search engin extract pattern fuzzi match inform retriev search amount inform internet continu grow exponenti trend argu public power tool sort creator tool intellig techniqu build maintain tool paper shown machin learn techniqu significantli aid creation mainten domainspecif search engin present research reinforc text classif inform extract end futur appli machin learn autom aspect search creat topic hierarchi cluster automat identifi semin paper citat graph analysi verifi techniqu paper gener appli domain refer weischedel learn gile autonom web agent automat retriev identif interest public agent justin dayn thorsten joachim machin learn architectur optim web search engin aaai workshop inform cohen inform system reason structur collect text agent slatteri learn extract symbol knowledg world wide web rubin maximum likelihood incomplet data em algorithm journal royal statist seri mitchel tour guid world wide web moor reinforc survei journal artifici intellig leek inform extract hidden markov model master ng improv text shrinkag hierarchi class seymor build search engin machin learn techniqu aaai spring symposium intellig agent menczer adapt retriev agent heurist neighborhood inform discoveri mitchel text classif label unlabel document em machin rabin tutori hidden markov model select applic speech recognit jason renni andrew mccallum reinforc learn spider web effici rosenfeld learn hidden markov model structur inform extract aaai workshop machin learn inform viterbi error bound convolut code optimum decod algorithm ieee transact inform public digit librari base collect experi commun
HCI/838 4 enabl activ space manuel roi campbel depart comput scienc illinoi west avenu abstract ubiquit comput promot physic space hundr special devic allevi specif everydai task provid wai interact comput environ person comput lose focu attent due fact comput environ spread physic space user view comput environ final extend physic limit comput physic space comput activ space activ space requir system softwar capabl seamlessli coordin hidden complex goal extend model provid current comput system interact physic space entiti mean singl abstract call activ space introduct ubiquit comput promot devic special specif task devic provid enhanc user product simplifi everydai task main aspect ubiquit comput mean user perceiv function devic provid function physic space geograph defin physic boundari semant mean offic kitchen room task perform properti confer person physic turn dictat type entiti expect space physic comput servic entiti interact final servic physic space host physic entiti perceiv comput percept pure abstract interact physic space singl entiti level individu devic servic physic space lose percept singl comput impli imposs access context physic physic space approach provid model interact activ space solut provid custom scenario target specif type function paper introduc gaia system softwar infrastructur design provid support activ space activ space model map abstract percept physic space comput class softwar entiti activ space encapsul contextu inform relat physic physic interact physic interact programmat activ space blend virtual physic properti present physic space defin behavior explicitli defin function physic properti space locat entiti sound light condit affect execut execut applic affect physic properti physic space activ space gener model hide complex intern comput statu export standard program interfac independ underli physic space applic develop context gener activ gaia os adapt applic requir properti physic space applic deal characterist physic space execut gaia os abstract properti arbitrari physic space tradit os abstract hardwar export gener comput environ comput system activ space introduct defin activ space gener comput system mean tradit comput system person comput case activ space section map standard compon defin tradit comput system activ space counterpart assum person comput standard comput system activ offic activ space assum activ offic person comput video overhead devic detect locat user offic devic configur light temperatur room tradit comput system divid oper applic program user hardwar compon person comput process unit volatil perman storag activ offic process unit person comput workstat offic activ offic coordin exist process unit export uniformli model weakli coupl processor activ offic persist equal sum persist storag export comput system activ offic mobil deal case person standard protocol interact attach intern standard isa defin electr signal requir enabl interact person comput card mean intern bu activ offic coordin export temperatur locat sensor light temperatur activ offic defin softwar bu enabl data distribut intern bu person comput softwar bu protocol enabl commun entiti activ offic exampl protocol softwar bu dcom java rmi introduc hardwar map comput system person activ space activ physic space model comput system activ space simpli physic space comput capabl host softwar control resourc export physic space point activ offic compar distribut object system exist solut stop point comput system oper system problem applic implement code control hardwar devic requir model physic space comput system oper system pose problem collect hardwar devic applic configur appropri major problem assum applic run user manag resourc export space common situat activ space problem previou situat decid entiti devic solut provid gener softwar infrastructur manag resourc physic space physic space requir oper system oper system convert physic space activ awar reactiv behavior capabl interact coordin entiti import aspect oper system combin physic virtual properti activ space compon comput applic program fit natur model present tradit understand applic user model extend context activ point view entiti oper system restrict person entiti activ space case activ car check traffic statu updat rout present navig system car user activ citi human user involv applic program benefit comput model defin comput entiti export activ includ user model user export resourc activ space applic standard interfac activ space model request specif function independ properti underli physic space activ space physic space entiti oper system standard mechan requir coordin comput capabl activ space infrastructur gaia enabl activ space model gener comput system exist principl standard comput system gaia jame formul popular idea earth collect cybernet global entiti call greek gaia project conceiv physic semant physic properti entiti activ space activ space awar resourc export contextu model provid interact mechan gaia project defin os applic model applic activ space compon depict figur gaia intend defin polici rule behavior entiti run space simpli tool minimum set polici model arbitrari activ space gaia os compon base distribut system run exist oper system implement top exist middlewar platform includ unifi object bu gaia os servic section gaia applic model support regist manag applic run context activ space activ space model physic space entiti gaia os perform task state activ space consist physic semant properti physic space entiti activ space activ space export function manipul activ space unifi object bu gaia servic gaia applic model activ space figur gaia architectur gaia os section inform export function gaia os gaia os infrastructur top activ space implement main compon gaia os unifi object gaia servic gaia applic model unifi object bu defin distribut object model os consist core compon manag low level function implement enforc polici specif distribut object set compon defin integr compon model collect orb request implement remot commun mechan compon model integr execut environ compon unifi object bu dynam instanti reconfigur manag depend integr compon model provid integr orb gaia servic implement corba servic corba orb pc workstat handheld comput point view gener gaia os architectur expand function capabl implement compon manag core integr activ space access export servic gaia dynam adapt servic capabl devic current version unifi object bu run window nt window ce gaia servic implement unifi compon object run context activ space access entiti function interact unifi object bu gaia servic base oper system adapt system base mean system dynam reconfigur provid function requir entiti depict figur gaia run top unifi object qo environ servic object stream automat configur compon repositori gaia applic model applic activ space interact applic involv depend physic view displai gaia provid applic manag servic support abil schedul interact applic deliv event applic manag servic inspir model applic view visual control inform updat view system maintain consist view model chang framework reinvent support adapt interact figur gauss architectur qo resourc manag secur environ servic object stream servic automat configur servic compon repositori object bu unifi applic heterogen natur activ space framework introduc element call model adapt instanc object stream type data export model type data expect view creat interact applic context activ space requir provid attach associ control view view attach model model adapt format data requir view react modifi view model activ view broadli interpret includ displai physic space effect actuat devic physic space activ switch set light project imag screen view videoconferenc model posit user insid activ space control gaia applic model function creat regist compon applic view manipul schedul applic configur paramet resolv conflict applic activ space implement activ space model properti physic space implement export abstract physic space properti function export gaia os gener term entiti denot physic comput object space activ space mechan manag polici polici activ space customiz interfac export activ space interact space singl element collect heterogen entiti activ space encapsul complex space provid function store retriev inform relat activ manipul activ discov check statu partit space region defin locat manipul event bootstrap activ space provid abstract activ space level granular activ space approach entiti state export defin function perspect develop applic exploit space relat interact instanc abstract physic space reason activ space entiti individu entiti relat work project relat digit enhanc physic space provid solut scenario specif type applic microsoft easi live project home work environ state comput natur light main properti environ casual access extens hp work ad web presenc physic space web paradigm extend physic infrar beacon provid url relat physic space web browser standard applic gui kei aspect dynam creation custom web page contextu paramet final georgia tech classroom preserv augment electron note student teacher attach synchron video annot class gaia offer gener infrastructur manag arbitrari physic space larg collect entiti result call activ space develop applic strict knowledg underli infrastructur provid physic space gaia map applic physic space extend exist concept tradit comput system model activ space strategi facilit understand concept call activ space gaia os similar aspect standard distribut object make uniqu tight integr physic environ explicit knowledg entiti activ space tight integr impli physic virtual environ affect counterpart knowledg entiti activ space adapt global execut environ entiti tradit comput system activ correct activ space case tradit comput system understood tradit comput system case activ space defin space gaia extend comput environ room build citi gener arbitrari physic space activ space exist isol provid distribut comput environ refer easyliv project microsoft research microsoft research creat web place internet system applic laboratori experi instrument live educ environ ibm system journal oper system concept addison weslei rh depend manag distribut system ieee rh design implement runtim reflect commun proc workshop middlewar tx al ubiquit corba workshop reflect middlewar ny oper system rapidli chang workshop reflect program system belgium xu distribut qo compil runtim instanti ieee intern confer multimedia expo york design implement resourc manag master thesi illinoi al manag environ intern confer parallel distribut system ieee rh support automat configur distribut proc usenix confer technolog system san ca ge st user interfac paradigm
HCI/839 4 provid softwar environ wireless pda michel freder wei gilbert paul freder domain de bp le chesnai franc campu de renn franc posit paper abstract wireless pda foreseen pc futur adequ softwar environ order execut type applic paper introduc base featur customiz middlewar middlewar platform emb servic resourc manag support applic introduct wireless person digit assist devic foreseen pc futur adequ softwar hardwar platform pda conveni pc overli restrict applic support ongo effort provid conveni hardwar platform paper design issu softwar environ aim wireless examin research group major concern drive design target softwar environ accommod constraint pda mandatori fine tune manag energi consumpt memori environ enabl execut applic support includ soft multimedia applic easi pda enabl provis applic extend capabl mobil phone applic promot exchang inform peopl happen nearbi commun environ base geograph proxim common user address requir li combin solut resourc manag polici close coupl result impact energi consumpt deleg task proxi servic benefit qualiti servic minim resourc consumpt pda offer open softwar enabl extend set applic support pda adapt softwar environ applic emerg literatur number base build meet object work oper system relev work issu energi save mobil comput examin solut li adapt mobil applic collabor applic oper system compar interest examin coupl manag resourc consumpt energi includ schedul account constraint energi budget task schedul deleg task remot issu examin perspect provid proxi carri number comput prior deliv applic thin client interest broader cooper proxi servic pda remot execut servic order minim resourc relat energi consumpt pda provid open environ subsum adher standard portabl possibl dynam download ideal candid major player area softwar environ java shortcom target solv futur light ongo work extend java meet requir softwar inform applianc examin adequ solut schedul task memori manag paper organ section sketch requir kei concern provis softwar present result base design lie provid customiz middlewar platform adequ servic section discuss middlewar servic handl resourc scarciti enabl type applic section offer base design softwar environ section overview main requir identifi softwar environ aim wireless pda present result base design environ requir requir softwar environ aim wireless pda kind depend relat pda featur limit resourc applic support wide accept pda user examin turn set requir deriv base guidelin design softwar environ progress hardwar technolog enabl provis wireless pda increasingli pda resourc capabl convent pc success pda primarili lie combin subsum adequ hardwar technolog examin hardwar vendor technolog complement adequ softwar solut order restrict applic possibl concurr solut integr resourc manag enforc energi cope limit memori resourc budget wireless pda intend fulli replac convent intend complement conveni conveni carri success pda pc pda enabl run applic support desktop pda open opportun applic exploit fact pda carri user mobil phone applic build ubiquit comput longer requir specif surround infrastructur possess wireless pda main applic pda typic run trip applic access discret continu multimedia data major constraint foreseen applic adequ support manag soft task wireless pda offer capabl mobil phone commun softwar support li manag hard task pda give opportun applic spirit wearabl ubiquit comput user carri enabl mobil user exchang inform happen physic encount applic introduc notion cooper support awar inform commun mobil user close physic proxim investig kind applic base physic proxim call spontan inform system consist dynam set distribut system pda physic close support applic requir provis adequ servic relat identifi popul user physic close trust sake inform exchang base softwar architectur previou subsect overview requir softwar environ aim wireless pda address provis middlewar servic resourc manag servic dedic applic main issu offer servic categori lie schedul task enabl energi custom memori java servic dedic interest servic aim applic depend interact addit environ coupl remot servic deleg task proxi server order diminish resourc consumpt pda servic foreseen commonplac suffic wap applic architectur exploit servic provid deliveri web data wireless pda identifi requir softwar middlewar figur choic build environ java result concern offer open environ environ reli base underli infrastructur oper base wireless commun protocol number hardwar vendor investig design conveni hardwar platform gener pda specif case experi multiprocessor hardwar platform design object softwar environ open hardwar platform provid os environ possibl run java examin number os vendor environ independ underli os os independ underli infrastructur achiev wrapper offer api softwar environ notic major design concern definit api leav place optim api emb number option function underli oper system support identifi actual energi budget handl phone commun address softwar environ result usag hardwar resourc account schedul issu address resourc handl phone handl toplevel prioriti task base jvm environ jvm develop scratch offer middlewar environ easili custom respect servic emb base jvm offer function execut java applic notic unlik tradit applic run concurr singl jvm similar java os utah led integr protect mechan base jvm middlewar servic servic offer middlewar platform enabl optim usag clear larg number servic current applic applic applic underli infrastructur hardwar wireless commun base jvm middlewar resourc manag servic servic remot cooper servic rt memori schedul awar energi profil user region collabor load negoti protocol wrapper offer infrastructur api softwar environ figur architectur softwar environ concentr servic resourc servic enabl spontan inform set trust collabor region user physic close categori servic discuss servic resourc manag schedul task address schedul soft task account energi consumpt construct applic java environ problem construct soft applic enabl identifi adequ schedul task meet tempor constraint deadlin readi execut time recal soft system differ hard deadlin miss enabl provis schedul base empir analysi task durat execut task make applic schedul scheme scheme assign prioriti scheme task deadlin durat java programm provid mean express constraint typic emb durat programm care usag java synchron except handl mechan address issu provid programm number java class serv describ applic term task tempor constraint task java code execut share resourc resourc access model enabl java thread synchron pose problem construct task descript applic enabl deriv schedul graph task tempor constraint access share resourc arriv schedul graph applic combin schedul graph specifi schedul task applic run concurr applic ultim reject schedul comput global schedul graph enabl meet tempor constraint applic addit tempor constraint specif applic energi consumpt enabl schedul accept reject incom applic result energi consumpt implement schedul approach schedul li exploit underli heterogen multiprocessor hardwar enabl adequ processor execut task respect tempor investig solut issu except handl fair handl applic kei issu resourc manag li memori java implicit memori mechan garbag collector carefulli design compliant constraint design memori manag build number exist work reli distribut memori manag scheme run applic assign portion memori execut dedic gc run applic applic memori usag profil applic combin gc global gc run reclaim object creat environ share applic exist garbag collect algorithm offer featur compliant issu schedul task interf schedul task remain profil applic memori usag knowledg elig investig wai coupl gc applic introduc gc task execut applic reli negoti protocol commonli run multimedia applic handl constraint limit capabl pda requir make resourc execut applic case resourc common negoti protocol place applic system applic lower resourc requir chang result qualiti servic offer user chang color video examin detail studi interest address dynam negoti order benefit resourc left applic termin schedul memori manag servic investig subsum knowledg applic behavior address soft applic reli profil static analysi tool evalu resourc consumpt worst case design profil tool java assess applic behavior term energi execut memori usag tool pda offer develop environ analysi result provid applic deliv pda execut notic approach similar virtual machin distribut handl applic servic dedic spontan inform system applic spontan inform system inform system distribut pda requir devic dynam discov pda physic inform eventu provid jini address issu slowli evolv problem exploit volatil network connect highli mobil devic set consid jini requir avail central lookup servic si context set autonom mobil design inform discoveri mechan central entiti inform confidenti user defin polici reach issu consid design lookup servic satisfi autonomi properti defin progress inform satisfi user confidenti constraint kei issu si occur inform discoveri phase user unexpect disconnect frequent limit commun commun time bound issu design effici commun scheme spite user mobil approach investig physic paramet posit remot entiti enabl estim constraint result energi consumpt period commun mobil node addit inform si object design mechan transfer structur inform si entiti stabil highli volatil environ mobil limit coverag commun mechan defin order benefit time built environ awar studi carefulli provid atom inform transfer select degrad data estim commun time wireless pda foreseen promin comput devic featur combin easi featur mobil phone process capac current pc offer pda user requir adequ softwar hardwar environ paper introduc softwar environ wireless li customiz middlewar current research interest middlewar servic execut applic multimedia applic applic enabl set distribut inform system pda user physic close base middlewar infrastructur oper concentr design implement subset middlewar servic resourc manag schedul memori servic set spontan inform system refer hg baker garbag collect motion sick workshop garbag collect system wei paradigm mobil commun system inform societi technolog confer novemb satyanarayanan adapt mobil applic page decemb chawath adapt network client variat activ lesson perspect special issu ieee person commun august schedul real time garbag collect technic publish nordic workshop program environ sweden june java overview exist solut ieee intern symposium distribut page march cowan thompson close support mobil collabor interchang user profil intern symposium handheld ubiquit comput page lam implement evalu schedul multimedia applic page decemb asynchron java except handl realtim context ieee workshop program languag industri decemb gun bershad design implement distribut virtual machin network comput page decemb nest java os structur mobil code eighth acm sigop european workshop septemb pr wilson ms johnston garbag collect workshop garbag collect memori manag
ML/840 6 featur subset select bayesian network base optim sierra dept comput scienc artifici intellig countri po box san sebastian countri spain method featur subset select machin subset select estim bayesian network present random search execut domain knowledg wrapper learn evalu good visit solut base distribut avoid crossov mutat oper evolv genet algorithm absenc evolut factor probabl distribut solut found gener search result achiev varieti task domain knowledg paper explain main idea featur subset estim distribut algorithm bayesian present relat work concept studi problem featur subset select process carri obtain basi defin stop criteria algorithm machin featur subset predict estim distribut estim bayesian network bayesian overfit introduct machin goal learn algorithm induc classifi classifi exampl fe descript featur gener classifi set sampl fe descript featur fx class label fw belong machin learn process put emphasi prior case classic rule induc classifi exampl learn algorithm develop rule machin learn commun formul descript featur learn respond question featur subset select approach reformul set candid select subset learn algorithm reduct made process carri advantag classif system specif ffl reduct cost ffl improv final classif ffl faster induct final classif ffl improv classif accuraci attain higher classif accuraci usual object machin learn process long prove classif accuraci machin learn algorithm monoton respect addit featur irrelev redund depend specif characterist learn degrad predict accuraci classif model object maxim perform classif algorithm reduct number final classifi complex understand human object view search state search space subset featur task exhaust evalu featur subset practic larg amount comput effort requir search techniqu solv problem knowledg natur carri intellig search space solut evolutionari search genet algorithm long search engin process ga crossov mutat oper make evolut optim select crossov mutat rate open problem field ga fix mean search estim bayesian network algorithm inspir estim distribut algorithm paradigm result algorithm share basic characterist attract properti avoid crossov mutat oper algorithm evolut base probabilist model bayesian network solut gener guid explor space featur work organ section introduc concept compon section introduc bayesian network search algorithm section present detail algorithm featur subset section present learn algorithm test approach result sixth section conclud summari futur work ii featur subset select search problem work locat machin literatur includ plenti work field pattern recognit chandrasekaran stearn kittler statist fukunaga al miller data mine al provost yang commun exchang share idea deal problem report aha bankert object featur subset select machin learn reduc number featur dataset improv learn algorithm perform task object maxim classif accuraci specif task learn effect reduct number featur induc final classif model featur select task search state search space identifi subset featur partial order child featur state figur express search algorithm natur process blum langlei argu structur space featur select method stanc basic issu determin natur search start point search organ evalu strategi featur subset criterion halt search ffl start point space determin direct search start featur success add start featur success remov select initi state middl fig individu space relat featur solut problem featur rectangl includ featur subset search space ffl organ search determin strategi search space size number featur problem roughli search strategi optim heurist classic optim search algorithm exhaust evalu subset branch bound search fukunaga detect optim subset monoton evalu function systemat examin subset monoton search space depend evalu function exhaust search impract make smart choic base inform search heurist search concept find optim optim heurist determinist heurist heurist algorithm classic determinist heurist algorithm sequenti forward backward select kittler float select method al search john determinist run obtain solut de jong result suggest classic greedi tend trap local peak interdepend featur work al interest idea attempt avoid heurist search motiv avoid stuck local maximum random escap local maximum impli expect solut run search engin genet algorithm simul anneal la vega algorithm liu jain kind classif search ffl evalu function measur effect subset featur search algorithm chosen examin object search search algorithm util return evalu function guid search measur carri object characterist captur relev featur set featur defin target concept report john al goal maxim featur select depend featur target concept learn algorithm kohavi john report domain target concept optim featur subset maxim predict accuraci specif learn algorithm occur due characterist limit classifi featur relev accuraci optim coupl idea error report classifi featur subset evalu criterion previou work stearn classif error rate guid search john al wrapper concept definit impli algorithm conduct search good subset featur induct algorithm part evalu algorithm induc final classif model classif algorithm idea train featur subset encount search estim error assign evalu function featur subset induct algorithm construct final classifi includ process wrapper strategi high comput technic comput advanc decad made wrapper approach calcul amount accuraci estim test amount appli wrapper comput resourc critic factor problem setiono number featur number instanc bear mind time learn algorithm wrapper scheme train phase requir solut visit search engin approach literatur allevi load train caruana freitag evalu subset advantag properti learn moor lee burden techniqu model learn algorithm evalu good featur subset assess properti data learn algorithm final part process construct final classifi set select featur statist literatur measur evalu good candid featur subset review classic statist measur detect featur subset higher discriminatori inform respect class probabl distribut data measur monoton addit featur hurt accuraci classif final classifi pattern recognit order recogn form common fix posit integ number select featur subset cardin found search paramet fix examin slope curv statist measur cardin select featur featur subset requir select cardin final featur subset predict accuraci assess run classifi select featur type ignor induct algorithm assess merit featur filter approach inspir statist complex filter measur final induct algorithm evalu function gener focu dietterich relief rendel cardi algorithm koller sahami work probabilist concept featur select setiono filter approach receiv attent mine commun deal huge wrapper approach figur locat role filter wrapper approach process size problem applic wrapper work note term predict accuraci filter approach earli empir show superior wrapper train set select featur subset learn algorithm final classif model test set final accuraci estim train set full featur set train set search algorithm learn algorithm accuraci estim train set evalu function measur final select featur subset test set select featur subset final classif model final accuraci estim test set search algorithm candid featur subset candid featur subset train set candid featur subset featur select algorithm featur select algorithm featur set train set full train set select featur subset learn algorithm test set select featur subset final select featur subset candid featur subset featur subset train set measur discrimin power process filter approach process wrapper approach fig summar process filter wrapper approach due comput avail appli sequenti featur select wrapper discard global search engin genet compar work algorithm blum langlei present type concept cover featur select process made induct algorithm partit method implicitli select featur branch rule prefer featur final model initi featur induct algorithm includ present featur model execut approach learn algorithm prefer featur possibl includ featur final classif model induc learn algorithm filter wrapper approach locat abstract level perform featur select process final classifi select learn algorithm ffl criterion halt search intuit approach stop search evalu function altern subset classic criterion fix amount solut visit search iii bayesian network approach paradigm bayesian network explain bear mind search engin algorithm present paradigm gener formula algorithm bayesian network import basi paradigm genet algorithm holland techniqu solv optim problem report result area problem ga fail decept attract attent research consequ grow interest adapt ga order overcom weak ga popul base search method set individu candid solut optim gener individu final individu form popul gener crossov mutat oper interest adapt estim distribut algorithm figur crossov mutat popul sampl probabl distribut estim select individu gener individu initi randomli repeat stop criterion met select individu select method estim joint probabl distribut individu select sampl individu fig main scheme approach search perform probabilist inform guid search shown approach process solut empir proven result approach similar al approach replac genet crossov mutat oper mean probabilist model select solut solut gener induc model main problem resid probabl distribut estim comput probabl domain binari impract led approxim probabl distribut assum factor probabl model al pelikan al simplest estim distribut good solut assum independ featur domain candid solut sampl proport valu featur independ remain solut popul base increment learn baluja compact genet algorithm harik al univari margin distribut algorithm muhlenbein simul crossov algorithm type work artifici task interact featur cover higher order interact variabl complex real task effort cover interact featur problem gener algorithm mimic algorithm simpl chain distribut bonet al depend tree davi bivari margin distribut algorithm pelikan muhlenbein pelikan muhlenbein demonstr cover depend problem higher order interact factor distribut algorithm muhlenbein al cover higher order interact fix factor joint probabl distribut fda prior inform decomposit evolutionari comput term term problem valu candid denot absenc featur denot presenc factor problem extra inform decomposit factor bayesian network graphic cover higher order interact boa al algorithm bayesian network estim joint distribut solut multivari interact problem variabl cover base work bayesian network model repres probabl distribut set candid solut applic automat learn method induc distribut model gener effici bayesian network definit bayesian network lauritzen pearl encod relationship model data describ data gener instanc variabl similar properti data bayesian network encod probabl distribut vector pair direct acycl graph node correspond variabl arc repres condit variabl variabl node variabl denot give factor set parent variabl instant number state denot number valu jx ijk requir condit probabl valu defin joint probabl distribut ijk repres probabl kth state jth instant factor joint distribut gener instanc condit probabl model dataset arc node relat node variabl end node arc depend variabl start node probabl distribut defin bayesian network bayesian network wide problem uncertainti handl probabl section relat learn process bayesian network data gener instanc bayesian network learn bayesian network data kei step estim probabl distribut depend result algorithm vari show automat bayesian network select individu treat data case form data set goal set method obtain fast multipl connect form data set select case probabl distribut find repres probabl theori equat bayesian model averag al requir sum approxim afor mention approach select model reduc number structur account denot set structur approxim model select approxim arg max mean structur maximum posterior likelihood larg result obtain model due easier applic lower cost model prefer time rememb estim quickli heckerman al shown structur ijk ijk expect probabl variabl kth state parent node jth configur cooper shown ijk ijk ij ijk number time kth state jth configur ij ijk combin ijk ij repres probabl distribut bayesian network structur maximum posterior paramet comput directli data set thing find learn data structur maximum posterior likelihood prior probabl structur set uniform find structur maximum posterior likelihood find structur maxim probabl data prove calcul close form heckerman al case bic approxim asymptot appeal properti select simpl structur reduc comput log ijk log ijk ij log ijk ij defin find requir search proven al result obtain global search techniqu al al al chicker al wong al comput cost make problem find fast simpl algorithm return good prefer algorithm learn bayesian network data algorithm greedi search heurist algorithm start structur add arc maximum bic approxim measur algorithm stop ad arc util measur sampl bayesian network repres desir probabl distribut bayesian individu gener joint probabl distribut encod network individu gener sampl directli bayesian probabilist logic sampl algorithm henrion pl find order node bayesian network gener fig probabilist logic sampl scheme pl figur advantag bayesian network defin probabl distribut gener valu variabl order instanti time make gener valu trivial estim bayesian network gener procedur figur understand step concept dag arc mean initi bayesian network bn assign probabl individu number individu popul number individu select popul suggest close popul evolv gener gener low lead low result earli converg bn sampl individu bn stop criterion met select individu find structur maxim calcul ijk ijk ij data set bn sampl individu bn pl fig basic scheme previou section shown individu creat bayesian network bayesian network estim probabl distribut select individu individu select algorithm stop individu select rang base select select individu individu popul select method stop algorithm criteria ffl fix number ffl individu popul ffl averag evalu function individu popul improv fix number ffl sampl individu bayesian network evalu function individu previou gener variat criteria depend problem concept explain section popul creat point individu previou popul discard popul newli creat individu problem lose individu minor chang discard maintain individu previou gener creat individu elitist approach form iter popul directli discard individu previou gener replac newli gener individu put individu form popul individu previou gener popul converg faster individu impli risk lose popul iv featur subset select estim bayesian network explain present piec connect search algorithm problem clarifi evalu function process explain final evalu process stop criteria coupl reflect risk connect search space problem algorithm search engin provid solv problem search seek featur subset space featur subset individu search space featur common notat repres full featur bit bit indic featur present absent gener induc bayesian network factor probabl distribut select individu bayesian network form repres featur domain node valu state absenc presenc bear gener procedur figur summar method random search select individu induct bayesian network node sampl individu bayesian network calcul evalu function valu put individu previou gener newli gener form popul evalu function individu fig method execut domain knowledg ga share crossov mutat oper evolv popul solut oper fix popul size size select set select ffl explain ffl fix elect popul size relat domain evalu function justif popul size explain present dataset point explan point similar algorithm work koller sahami concept probabilist reason build optim featur subset filter approach concept condit independ markov concept construct bayesian network characterist evalu function wrapper approach calcul evalu function individu evalu function featur subset found search classif algorithm calcul error estim train data accuraci random uncertainti base kohavi work accuraci estim multipl combin heurist kohavi john control uncertainti evalu function heurist work ffl standard deviat accuraci estim crossvalid ffl repeat standard deviat drop maximum ffl small dataset time larger possibl intern loop extern loop machin learn algorithm ass test unseen instanc particip select featur subset accuraci estim loop process figur ffl accuraci estim guid search process explain previou point repres evalu function ffl accuraci report final test featur subset select unseen instanc search subset due natur execut give iter appli accuraci estim problem stop criteria initi stage definit report accuraci final perform aha kohavi person alert optimist natur estim guid search due search natur featur subset big amount subset adapt train present instanc present train accuraci dramat occur intern process recommend report accuraci guid search final accuraci process jain report function pattern recognit problem qualiti select featur subset small train set improv train set kohavi note wrapper machin learn approach princip reason low amount train instanc studi issu carri set experi train size dataset classif algorithm train size sampl test fix test set instanc figur summar set experi accuraci gener gener accuraci train instanc train instanc accuraci gener gener accuraci train instanc train instanc accuraci gener gener accuraci train instanc train instanc fig intern extern loop accuraci valu train size dataset learn algorithm intern loop accuraci multipl time repeat standard deviat accuraci estim drop show accuraci estim loop accuraci solut search gener repres gener repres initi gener search train repeat multipl differ intern accuraci greater standard deviat train size fidel intern extern loop accuraci accuraci estim rang form standard deviat accuraci accuraci estim differ risk small search process improv posterior perform unseen instanc improv differ intern extern estim import estim improv intern estim coupl extern improv intern estim coupl intern improv small size train curv show errat relat result gener high care small dataset obviou small algorithm dean qualiti result function time figur discard idea time small train set size find follow work ng interest work demonstr select larg pool classif model noisi task small train pick model minimum model higher error gener error test instanc relat number instanc train heurist stop criteria adopt ffl dataset instanc instanc train subset extern loop accuraci search stop sampl gener featur subset evalu function improv subset found previou gener subset found previou return solut ffl smaller dataset instanc train subset extern loop accuraci search stop sampl gener featur subset evalu function smaller evalu function featur subset previou gener subset previou gener return solut improv intern loop estim measur account continu search number dataset critic permiss larger dataset lesser impact improv estim coupl improv gener accuraci unseen instanc smaller dataset greater risk occur continu search improv accuraci estim individu consecut gener improv risk decai basi gener accuraci improv unseen instanc dataset learn algorithm dataset tabl summar characterist select dataset real dataset uci repositori imag dataset statlog project al artifici dataset equal relev irrelev binari featur design artifici call involv continu featur rang target concept defin pair test fold run account repeat multipl time tabl detail domain continu nomin domain num instanc num class num featur anneal imag chess number featur number instanc characterist evalu function number solut popul reliabl estim bayesian network paramet fig relat relev concept estim reliabl bayesian network instanc nearer euclidean featur target concept rest featur repetit relev featur repeat time wrapper approach account number instanc order select dataset learn algorithm explain run time extrem high dataset instanc order select basic criteria number featur dataset bayesian network factor probabl distribut solut suffici number solut fix reliabl estim paramet network dataset larger extrem larg number solut actual popul cost calcul evalu function wrapper reliabl estim paramet network independ evalu function filter approach execut account quantiti comput resourc order fix paramet estim reliabl bayesian characterist evalu number instanc featur dataset number solut popul figur show relat concept learn algorithm learn algorithm famili experi ffl classif tree algorithm measur carri split node tree incorpor strategi construct tree incorpor statist minimum depend split class ffl algorithm variat rule predict class assum featur independ predict class probabl nomin featur estim data maximum likelihood estim normal distribut assum estim class condit probabl continu attribut spite simplic kohavi john note nb accuraci superior set real note schema classifi insert task low capac discard irrelev featur featur tree make singl class fold singl train sampl tendenc train data damag gener accuraci unseen instanc notic author freitag kohavi john al trust capac discard irrelev plai role avoid irrelev hide attribut learn algorithm data deep stage tree gener power good scale irrelev nb improv accuraci level discard correl redund featur base independ assumpt predict featur predict hurt correl featur violat independ assumpt plai role discard group correl ideal select final model langlei sage forward featur select direct detect kohavi john backward direct vi result iter report accuraci ten accuraci standard deviat report tabl show accuraci featur subset select tabl show averag cardin featur nb iter test appli determin accuraci differ tabl comparison accuraci percentag domain anneal imag chess averag tabl comparison accuraci percentag nb domain nb nb anneal imag chess averag approach featur select test variat pair test test probabl observ test statist contradictori null hypothesi algorithm comput sampl data tabl show gener stop ten run procedur tabl show averag run time ten singl fold experi run machin softwar al execut algorithm ffl induc tree significantli fewer attribut tabl cardin select featur subset account carri discard featur construct tree column show full set cardin domain full set anneal imag chess tabl cardin select featur subset nb account appli full featur set induc classif model domain nb full set nb anneal imag chess tabl gener stop ten run procedur note subset return algorithm subset previou gener respect stop initi gener consid domain nb anneal imag chess tabl cpu report number reflect averag time standard deviat ten fold domain nb anneal imag chess coupl mainten predict accuraci major place result assert made kohavi john preprocess step made real dataset includ relev featur accuraci special damag irrelev dataset preprocess process detect smaller featur subset equal accuraci featur tree process made averag accuraci improv set due domain slight accuraci improv achiev improv artifici special select test robust wrap irrelev featur filter relev featur final return irrelev featur tree ffl nb significantli reduc number featur induc final model reduct coupl accuraci improv domain nb toler influenc irrelev featur reduc predict accuraci averag accuraci respect domain impli rel reduct error rate artifici special select test robust wrap detect redund hurt nb accuraci violat independ assumpt select repeat featur target concept ffl ow fact wrapper approach larg cpu time base evolut minimum amount individu evalu order reliabl induc bayesian network evolut process time induc bayesian network gener comparison time calcul evalu cpu time emploi learn algorithm domain induct bayesian network present local search mechan demonstr low cost order induc bayesian network individu cpu averag imag domain domain fewer cpu anneal domain due simplic nb learn algorithm train test condit probabl attribut time smaller ffl understand cpu time tabl gener search stop account gener evalu individu differ stop gener gener present standard deviat cpu time vii summari futur work due random long appli problem pattern recognit machin learn commun work present search engin share interest characterist ga state search bayesian network search variant distribut approach base ga evolut popul attract approach avoid necess fix crossov mutat oper respect ga select crossov mutat oper rate open problem ga task evolut solut factor probabl distribut individu gener search factor carri bayesian network induc cheap local search mechan work root method relat work process search approach bayesian network join piec provid concept process understood basic piec paramet process present justifi problem carri inspir stop criteria relat number instanc domain work includ learn nb wrapper approach ass evalu function featur subset larg amount cpu time learn algorithm induct bayesian network evolut demonstr cheap cpu time filter artifici special kind featur hurt perform specif learn algorithm featur case domain redund featur nb major real accuraci mainten reduct achiev case nb reduct coupl notabl accuraci improv futur lengthen work featur weight problem nearest neighbor algorithm continu work approach interest explor present cpu time filter approach calcul evalu function order deal domain larger number featur futur work address simpler probabl model factor probabl distribut model assum fewer depend variabl problem research employ metric fix number individu reliabl learn paramet bayesian network refer dw mk learn machin learn dw aha rl featur select classif cloud empir workshop pp dw person tg learn irrelev ninth nation confer artifici pp combin test compar classif learn neural comput accept public hybrid learn genet algorithm tree pattern pp increment method integr genet search base function optim competit technic report carnegi mellon optim combinatori learn structur search fourteenth intern confer machin pp pattern recognit reduct pr ln kanal handbook pp al select relev featur exampl machin artifici intellig schedul problem solv artifici intellig rr properti bayesian belief network learn tenth annual confer uncertainti artifici pp optim subset theori refin bayesian seventh confer uncertainti artifici lo pp jh ra cj classif tree improv tenth intern confer machin pp greedi attribut eleventh intern confer machin nj lo pp jm expert system probabilist network estim crucial task machin european confer artifici pp data overview ieee transact knowledg data engin dm learn bayesian network technic report microsoft advanc technolog microsoft microsoft dm learn bayesian search method preliminari paper intern workshop artifici intellig ft pp gf ea bayesian method induct probabilist network machin learn ap condit independ statist journal royal statist seri js de cl find optima estim probabl petsch advanc neural inform process system mit tg approxim statist test compar learn neural comput evalu featur select method applic comput technic report california jm analysi behaviour genet algorithm learn bayesian network structur pattern recognit letter global optim bayesian ii symposium artifici intellig la pp sampl complex learn bayesian confer uncertainti artifici pp jj optim control paramet genet algorithm ieee transact cybernet gr fg de compact genet illig report illinoi illinoi genet algorithm learn bayesian combin knowledg statist machin learn propag uncertainti bayesian network probabilist logic jf ln kanal uncertainti artifici intellig elsevi scienc publish pp jh adapt natur artifici michigan ann featur weight nearest neighbor algorithm bayesian network base combinatori student session advanc artifici intellig pp ak sampl size pattern recognit pr ln kanal handbook pp featur small sampl ieee transact pattern analysi machin intellig irrelev featur subset select eleventh intern pp la featur select tradit method tenth nation confer artifici san pp featur set search ch chen pattern recognit signal den pp featur subset select search probabilist aaai fall symposium pp studi bootstrap accuraci estim model pp featur subset select wrapper overfit search space intern confer knowledg discoveri data mine pp wrapper featur subset artifici intellig data mine machin learn librari intern journal artifici intellig tool person optim featur thirteenth intern confer machin pp genet algorithm featur select parallel inform process letter induct select bayesian tenth confer uncertainti artifici pp rh learn bayesian network structur search order genet ieee transact man cybernet part system rh structur learn bayesian network genet perform analysi control ieee transact pattern analysi machin intellig ja jm review cooper evolutionari comput probabilist graphic ii symposium artifici intellig la pp sl graphic oxford featur select classif probabilist wrapper ninth intern confer machin pp featur select knowledg discoveri data kluwer academ increment featur appli intellig ae ct ja bayesian model aaai workshop integr multipl learn pp statist engin prentic hall englewood aj subset select chapman featur subset select tenth european confer machin pp aw ms effici algorithm minim cross valid eleventh intern confer machin pp recombin gene estim distribut binari hm al lectur note comput scienc parallel problem solv natur ppsn pp equat select evolutionari comput distribut graphic model evolutionari submit uci repositori machin learn depart inform comput branch bound algorithm featur subset ieee transact ay prevent fourteenth confer machin pp probabilist reason intellig network plausibl morgan palo bivari margin distribut submit de bayesian optim illig report illinoi illinoi genet algorithm de survei optim build probabilist illig report illinoi illinoi genet algorithm survei method scale induct data mine knowledg discoveri float search method featur pattern recognit letter jr induct machin learn jr infer tree minimum descript length inform comput jr program machin morgan san estim dimens annal statist automat featur intern journal pattern recognit artifici intellig db prototyp featur select sampl random mutat hillclimb eleventh intern confer machin pp sd select featur pattern intern confer pattern pp uniform crossov genet intern confer genet algorithm pp machin neural statist paramount publish de robust featur select intern confer tool artifici pp ml ks evolutionari program minimum descript length principl data mine bayesian ieee transact pattern analysi machin intellig featur subset select genet ieee intellig system jo compar studi featur select text fourteenth intern confer machin pp
ML/841 6 concept formal fuzzi logic toolkit chri matthew paul inform school technolog environ la po box school manag inform abstract formal method model tool requir engin speci cation languag permit unambigu model system properti behaviour system drawn problem di cult model crisp term desir formal model commenc earli understand part problem domain approxim paper suggest fuzzi set theori scheme approxim provid summari toolkit de ne measur modi er manipul fuzzi set relat provid exampl law establish isomorph extend notat present convent appli boolean set relat formal speci requir fuzzi set theori introduct formal method set tool develop correct speci cation system properti behaviour updat version paper present author associ prof ian comput scienc electr point technic error origin paper er solut author dr roger duke comput scienc electr mr steve dunn comput construct comment suggest made prepar paper commonli speci cation safeti critic gu appli stage system develop lifecycl includ speci cation user requir commonli speci cation languag basi commun valid system develop methodolog power analyt tool facilit system understand develop seri veri mathemat model model predict system behaviour identifi error prior implement level abstract vari statement requir basi commun detail concret softwar design document inform graphic method data ow open di er design rigor mathemat properti speci cation system problem natur understood crisp cise term soft major focu interact peopl social technic natur substanti bodi research reveal peopl di er perspect problem function problem de nition wait possibl equal relev viewpoint depend particip multipl viewpoint contradictori vagu uncertainti problem domain type di cult model boolean set theori concept opinion easili natur group interest extent resembl type rel rank thing class type descript realist level experi attempt distinguish experienc classifi person group peopl hold set extent person resembl peopl hold view natur set factor uenc distinguish uenc total uenc exampl similar case system problem involv human make judgement argu formal approach introduc earli requir determin formal express model provid unambigu express client requir speci er client share common understand lem enabl issu ambigu uncertainti identi ed resolv earli formal speci cation languag requir object concept type speci cation develop present problem vagu inher problem domain danger lose part attempt repres desir develop speci cation earli identifi resolv aspect problem perspect express formal model ne model issu clari resolv uncertainti prior develop speci cation imagin approxim understand part problem domain express formal model case speci cation languag requir syntax semant captur repres approxim fuzzi set theori er possibl fuzzi set fuzzi set theori fuzzi logic mathemat basi repres reason knowledg uncertain problem domain boolean set theori set membership crisp element member underli principl fuzzi set theori ment permit exhibit partial membership set fuzzi set theori repres concept motiv high pro ts product worker import problem domain organiz context common set oper union intersect fuzzi measur fuzzi subset fuzzi set entropi fuzzi logic deal truth conceptu framework approxim exact reason truth proposit motiv product worker lead high pro ts estim reason fuzzi set theori fuzzi logic successfulli appli industri control system commerci expert system fuzzi set relat theori possibl theori suggest analyt tool social scienc idea measur instrument present methodolog problem psycholog measur led develop fuzzi graphic rate scale measur occup prefer fuzzi set base categori market applic fuzzi set rate scheme personnel select fuzzi set theori fuzzi logic model group prefer set option clear cut fuzzi proposit captur elast function requir techniqu model requir engin system develop research compat fuzzi set theori mean human place linguist term describ set suggest model techniqu base fuzzi set theori lead model closer cognit process model base boolean set theori motiv motiv current research system drawn natur model understood crisp term retain bene ts speci cation languag method commun build exist syntax semant captur vagu characterist fuzzi set theori establish techniqu repres uncertainti boolean crisp set theori set base speci cation languag provid notat incorpor fuzzi set idea languag time retain model paper concern develop suitabl fuzzi set notat exist syntax assum exist schema calculu logic structur remain develop toolkit de ne set measur modi er manipul fuzzi set current version toolkit extend present concept relat fuzzi relat fuzzi set develop gener de nition domain rang fuzzi relat domain rang restrict develop gener de nition composit oper fuzzi relat de ned relat fuzzi relat provid abbrevi ident relat term fuzzi relat includ seri law establish isomorph tend notat present convent appli crisp set set membership valu constrain toolkit identi es proof relev law hold partial set membership permit paper present summari includ sampl law reader refer current version complet toolkit proof law present due space constraint abbrevi detail discuss illustr exampl form companion paper paper section introduc fuzzi set tion scheme toolkit toolkit summari present section section altern fuzzi set scheme discuss paper conclud refer applic area fuzzi set fuzzi repres map refer real number interv membership element refer set fuzzi set imagin set order pair crisp set membership constrain refer set set membership element shown explicitli written extend notat crisp set express extend notat convent term set written simpli de nition relat function oper manipul refer set consid basic type speci cation fuzzi set de ned total function refer set interv de ne fuzzi set oper intersect set di fuzzi set modi er fuzzi set fuzzi set membership manipul toolkit gener de axiomat descript abbrevi er measur minf maxf determin membership refer set element intersect union fuzzi oper establish preserv properti boolean appli crisp min max behav exist boolean set gener principl guid prepar toolkit applic permit de ning union intersect term crisp set fuzzi de ned term fuzzi set fuzzi set domain rang restrict fuzzi relat fuzzi crisp set permit appli crisp set extend notat toolkit de abbrevi descript isomorph convent map set type convent notat fuzzi set type ft map refer set element full membership fuzzi set power set convent includ proof attempt establish isomorph basic set oper intersect union fuzzi set de ned min max oper domain fuzzi set intersect equal intersect domain intersect fun fun case fun fun de ned fun case fuzzi set union domain equal union domain iti fun de ned total de nition ensur fun fun fun de ned domain complement fuzzi set equal set set membership refer set element complement minu membership element set fuzzi set di erenc de ned term fuzzi set intersect complement case simpler wai express de nition follow attempt style attempt explicitli show set membership term total function init fuzzi set repres membership element fuzzi set fun fun de ning function repres membership crisp set fun fun toolkit type check type check default mathemat toolkit type check speci cation written extend notat toolkit summari draft standard number system assum set real de ned subset assum oper function min max de ned set real number type checker version softwar school comput inform basic de nition set membership measur real number interv fr gener de ne fuzzi set function refer real number ft gener constrain membership valu element fuzzi set set type crisp set written extend notat ct map power set type convent fuzzi ft extend notat set set set map refer set element membership fuzzi set type ft power set type convent refer core fuzzi set fun ft fun toolkit de ne support fuzzi set similar fashion support set set refer set element exhibit membership fuzzi set de ned function map set type ft type set fun fun type ct fun cut fuzzi set set refer set element membership valu greater equal strict cut membership valu greater notat concept cut function fuzzi set ft fun ft fun fun fun fun extend support es fuzzi set partial function type part fuzzi set set membership greater es ft toolkit de ne total transform fuzzi set type de nition follow ensur set membership de ned refer set element total dom fun fun dom fun fun fuzzi set refer set element membership greater ff ft nite fuzzi set type ft nite number element membership greater nite ft ff ft empti nite fuzzi nite de ned toolkit element membership greater de nition total membership relat fuzzi set membership provid de ned similar rang restrict set fun ft fun set measur empti empti type ft membership valu empti set nite fuzzi set empti ft empti type ft de ned toolkit valu cardin fuzzi set de ned sum membership valu mean nite fuzzi set counter sum membership valu set type count restrict summat membership valu greater nite fuzzi set counter dom fun counter fun counter count nite ft fun nite ft count set oper set union intersect set type ft fun fun dom fun dom fun fun fun fun fun fun fun dom fun dom fun fun fun fun complement set type ft fun dom fun dom fun fun set di erenc fuzzi set fun fun fun fun oper mean crisp set written extend notat fun fun fun fun fun min max oper fuzzi set intersect union provid boolean set preserv exist mathemat structur idempot distribut fun membership refer set element complement altern oper de nition bound sum receiv intuit practic support sacri ce properti fuzzi case product oper intersect idempot distribut partial set membership fuzzi set fun shown de morgan law hold set type fun fun law exclud middl valid fuzzi case hold set type ct fun empti expect ect overlap fuzzi set complement concept fs ft fuzzi set fuzzi set de ned toolkit membership fuzzi set fun fuzzi set fuzzi interpret indic fun part union intersect constraint de nition intersect ensur form set exhibit membership fuzzi set fuzzi set appli crisp set fuzzi union intersect mean fuzzi set union intersect set equal set de nition fuzzi nite fuzzi set base concept fuzzi set entropi fuzzi fuzzi set estim determin resembl set complement de nition relat refer set element exhibit membership fuzzi set nite crisp membership element extend support set fuzzi set nite ft fun nite ft fun empti fun empti counter measur fuzzi set nite ft nite ft fun nite ft empti fun empti fun empti fun empti fun fun fun fun count fun empti fuzzi set membership valu refer set case fun fun equal fun de nition subset relat set type ft follow origin de nition de ne complet fun fun fun fun fun fun fun fun subset mean crisp set written convent extend notat fun fun fun fun fun fun measur subset de ne weaker form set de ned fuzzi set countabl set type nite ft nite ft nite ft fun nite ft empti fun fun empti fun set modi er fuzzi number fuzzi set modi er transform membership valu refer element exhibit partial membership set type ft appli set type ct ect refer linguist hedg analog drawn action modi er gener natur languag mean ascrib mathemat descript provid argu intuit reader direct detail discuss issu de nition concentr modi fun fun toolkit de nition dilat modi squar root membership approxim hedg model fuzzi number fuzzi system repres measur scalar fuzzi set paramet depend magnitud scale consid di er scale factor di er linguist descript de nition model approxim hedg triangular fuzzi set centr posit real number toolkit similar de nition approxim hedg case scale factor support set fuzzi suggest expect number de nition provid set paramet subject depend context hedg gaussian trapezoid set paramet ad toolkit reader direct detail set paramet practic applic approxim hedg type fuzzi system toolkit gener de nition fuzzi quanti er base fuzzi relat gener de ne fuzzi crisp relat ident relat de extend notat fx fun fx id fun fun id fun mean extend convent notat id type cx de nition ident relat base found fuzzi relat de ned mean extend convent notat rang domain fuzzi relat fuzzi relat de ned fuzzi set membership element domain element consid equal maximum membership map fxg fuzzi de nition dom shown dom mean domain crisp relat written convent extend notat dom rang domain restrict fuzzi relat domain rang restrict fuzzi relat de ned membership restrict fuzzi relat minimum origin membership membership restrict mean crisp relat written tional extend notat cx cy toolkit de ne domain rang fuzzi tion membership fuzzi tion minimum origin membership total membership complement restrict de nition similar replac relat composit oper fuzzi relat common composit oper fuzzi shown oper ned interchang min max de nition de nition mean crisp relat written convent extend notat fuzzi relat imag fuzzi relat fx set fx set set de nition base mean crisp relat set convent extend notat set cx fuzzi function set seri fuzzi function de ned toolkit de nition convent notat crisp version de ned shown mean convent extend notat fuzzi partial function fr fuzzi total function fr dom fuzzi partial inject fr fuzzi total inject fr fuzzi partial surject fr ran fuzzi total surject fr ran fuzzi biject fr ran altern notat de nition fuzzi set total function refer made base scheme base set nest subset form cut fuzzi set section altern vector notat provid geometr algebra nite refer element de ne seri fuzzi subset repres vector compon membership valu element fuzzi subset geometr point space crisp subset repres point vertic hypercub closer point centr fuzzi set repres point centr hypercub vector compon equal set point repres power set set subset fuzzi notat eleg fuzzi set fuzzi entropi notat simpl membership valu repres manipul refer set element impli order vector compon scheme set algebra languag limit vector notat basic ical construct de ned notat explicitli de ne map function refer set membership interv membership vector fuzzi set evalu speci cation evalu set membership refer set element requir membership input fuzzi set type ft easili map explicitli state altern membership refer set element larg refer set tediou nite refer set suggest system drawn natur understood crisp term fuzzi set theori establish formal model approxim characterist system paper present summari fuzzi logic toolkit seri exampl intend illustr toolkit includ exampl fuzzi set repres grade concept motiv fuzzi relat model servic qualiti client satisfact health system fuzzi concept gener model tool situat involv con ict agreement work ongo result found refer gm sl ea fuzzi set personnel discuss applic journal occup organiz fuzzi fuzzi applic world scienti system system practic john wilei jim soft system methodolog action john wilei cox fuzzi system handbook ap brace duboi fuzzi set theori applic academ duboi prade possibl approach process uncertainti plenum smith speci cation version technic report dept comput smith speci cation languag advoc descript standard comput standard graham fuzzi logic commerci expert system result prospect fuzzi set fuzzi measur concept occup social space journal practic program formal method cambridg roger soft comput comput approach learn machin intellig fuzzi logic linguist quanti er group make rr yager la introduct fuzzi logic applic intellig page kluwer kaufmann introduct theori fuzzi volum fundament theoret element academ klir type measur uncertainti mario consensu page kluwer fuzzi probabl int gener neural network fuzzi system foundat fuzzi system john wilei lee yen soft requir system rr yager la fuzzi neural soft page van nostrand fuzzi set basic techniqu bibliographi kluwer de luca de nition entropi set fuzzi set theori inform matthew fuzzi australian workshop requir engin page matthew fuzzi concept formal method illustr exampl technic report school manag inform matthew fuzzi extend notat technic report rev school manag inform quanti er fuzzi concept fuzzi set page elsevi scienc publish notat version technic june till introduct formal speci cation prentic hall intern seri comput formal method inform system engin thayer softwar requir page ieee comput societi kj fuzzi natur languag risk analysi comput scienc fuzzi set analysi behavior social scienc ignor uncertainti emerg paradigm jm spivei refer manual prentic hall intern seri comput formal method speci cation behaviour semant inform page kluwer formal speci analyt tool inform system journal inform april innov notat standard zum speci cation lectur note comput scienc fuzzi concept construct ai novemb singl categori scale complet captur psycholog wang interpret fuzzi ieee transact cybernet part apr wilson methodolog applic john wilei wing speci er introduct formal method ieee yao compar studi rough set fuzzi set journal inform zadeh fuzzi set inform zadeh concept linguist variabl applic approxim reason inform zadeh fuzzi logic ieee april zadeh knowledg fuzzi logic rr yager la introduct fuzzi logic applic intellig page kluwer ac common framework quanti er probabl term fuzzi set page elsevi scienc publish empir studi integr linguist probabl fuzzi set page elsevi scienc publish
AI/842 2 proc good distanc metric local planner probabilist roadmap method nanci christoph daniel depart comput texa colleg tx abstract paper present compar evalu distanc metric local planner context probabilist roadmap method motion plan workspac distanc metric local planner consid studi concentr clutter workspac mechan design result includ recommend select combin distanc metric local planner motion plan probabilist roadmap method find local planner make connect indic construct multipl local planner local plan method call outperform common method crowd environ introduct automat motion plan method appli area virtual realiti design motion plan method practic restrict robot freedom strong evid complet planner find solut determin requir time exponenti number dof robot attent focuss random probabilist motion plan method notabl random potenti field method random walk attempt escap local minima method effect configur space exist simpl situat fail class random motion plan method gain attent research support part nsf career award reu nsf grant texa higher educ coordin board grant support part dale support part ge foundat graduat leav universidad de la support part scholarship probabilist roadmap method random preprocess construct graph roadmap node correspond configur robot node connect edg path configur found plan method motion plan queri process connect initi goal configur find path roadmap connect point probabilist node gener connect node form distanc metric select candid node pair local planner check connect gener local planner ii queri process connect start goal roadmap distanc metric select roadmap node local planner find path roadmap connect node prm shown perform practic roadmap construct difficult plan queri answer quickli fraction prm suitabl multipl queri perform static gener prm strategi solv singl queri construct portion roadmap prm differ strategi roadmap node gener initi roadmap improv prm method gener node uniformli sampl roadmap enhanc sampl region method inform environ guid node gener sampl method emploi random reflect techniqu proc call geometr node ad gener robot configur obstacl boundari prm vari term share import primit oper addit import primit oper motion prm make heavi distanc comput socal local planner local planner make connect roadmap node build start goal configur roadmap process queri abil local planner make connect run time gener strategi prm local planner initi roadmap planner determinist reason faster connect attempt connect attempt fail environ crowd planner determinist path dont save full prm local planner make connect smart local planner enhanc connect connect compon queri process connect start goal planner random invok fewer time path save distanc metric plai crucial role prm attempt connect pair distanc metric determin pair connect build roadmap obtain fast queri limit number connect attempt start goal roadmap roadmap success queri depend intim distanc metric context good distanc metric rel probabl configur connect highli depend local planner attempt studi discuss choic local planner distanc metric crucial impact success effici prm due high complex natur clear method situat paper provid guidanc select good distanc metric local planner prm present compar evalu distanc metric local planner workspac distanc metric local planner studi concentr clutter workspac mechan design move object object yield result studi includ recommend select combin distanc metric local planner prm find local planner make connect connect roadmap construct multipl local planner local plan call outperform common method environ studi studi motiv interest motion plan approach emploi planner remark goal studi provid empir evid combin distanc metric local planner perform prm type problem seek empir evid due random natur make difficult analyz number attempt made theoret explain success prm analyz make natur prm compon local applic prm appli distanc metric distanc metric prm determin node attempt connect local planner plai crucial role effici success prm good metric limit number call local planner produc roadmap note fast distanc calcul numer oper prm good measur distanc configur measur workspac region swept robot move swept volum comput metric prohibit prm reli explicitli local approach cartesian euclidean distanc space slightli sophist approach weight euclidean distanc metric maximum distanc travel point robot move path configur distanc comput base differ unit vector object local refer frame configur metric defin prm proc distanc metric studi metric formula paramet euclidean scale euclidean minkowski modifi minkowski manhattan workspac distanc metric studi metric descript center mass euclidean distanc center mass bound box max euclidean distanc vertic bound box tabl formula ir configur jc jc flg normal factor growth distanc defin convex polyhedra amount object grown intern seed point surfac touch distanc metric evalu move object consid studi rigid object configur coordin defin posit orient orient coordin valu studi consid metric tabl directli appli oper point workspac workspac metric transform configur workspac coordin comput distanc order bia rang posit coordin vari normal orient coordin magnitud posit coordin multipli orient coordin maximum rang workspac bound box metric regular euclidean distanc ir posit orient import scale euclidean distanc rel import posit orient compon scale paramet minkowski distanc gener form euclidean distanc paramet place posit orient import modifi minkowski distinguish posit orient coordin paramet metric usual manhattan distanc ir workspac metric workspac metric chose studi simpl metric base euclidean distanc workspac sophist select requir comput suitabl prm workspac metric studi euclidean distanc center mass robot configur workspac metric make bound box find maximum euclidean distanc vertex bound box configur vertex configur local planner local planner prm make connect node build start goal roadmap process queri studi concentr local fast connect power determinist path dont mention method potenti local planner prm local planner test configur suffici line approach move manhattan path dof test move dof method direct current dof found planner base search strategi method suitabl dumb planner larg run time class local search slide method iter move configur move neighbor closer maximum clearanc proc intermedi config increment coord step return endfor return end ff fi fl ff fi fl return return end find neighbor evalu neighbor neighbor endwhil return return end figur local planner evalu configur ff fi fl obstacl slide step consid dimens replac neighbor step closer larger clearanc local planner evalu studi consid common plan method variant distanc metric section denot start goal configur robot ff fi fl ff fi fl path test local planner consist sequenc configur differ predecessor successor fix resolut resolut valu differ posit orient vari environ pair start goal configur resolut planner determin number intermedi configur test maximum differ divid coordin calcul increment coordin differ divid figur increment vector determin neighbor configur test planner common method interpol bia straight line configur check point fix resolut line figur orient distanc calcul movement shortest direct call famili local planner planner translat intermedi configur rotat intermedi configur final translat paramet repres fraction part translat distanc robot travel planner plan pair figur planner basic comput set neighbor select neighbor iter process termin reach movement unbound run plan halt set maximum number iter figur plan method planner slow dumb local planner prm made faster number neighbor check maximum number step search method set maximum number step small constant time number step neighbor configur posit coordin increment goal method move neighbor evalu function select neighbor select neighbor maximum clearanc workspac clearanc defin minimum distanc robot center mass obstacl center mass distanc select neighbor minimum distanc goal configur evalu planner metric import criteria select distanc metric local planner prm effect run time good distanc metric local yield small distanc configur connect local planner good local planner metric combin make connect node select metric experi design evalu metric planner term requir clutter workspac program written run sgi machin proc figur moder environ studi consid basic environ repres clutter workspac figur environ set environ consist cube unit cube obstacl move object cube consist triangl obstacl cube center parallel front back middl plane arrang cube surround cubic region center middl plane hard problem control vari distanc back plane distanc environ set environ twist ff shape triangl object separ intertwin tube sequenc rotat translat puzzl made easier scale obstacl tube effect shrink widen gap ff simultan transform tube circl increasingli longer ellipsoid scale factor test design object determin local planner distanc metric effect clutter environ interest evalu planner metric situat configur connect constraint surfac ran test suit environ studi gener free configur surfac free configur surfac random gener cube surfac select random tube intertwin roughli half separ similarli surfac local connect configur configur rate metric local comput distanc metric node node sort analyz connect made closest node prm typic attempt small number connect result prm perform huge number distanc comput local plan comput time oper import factor time evalu distanc metric shown tabl valu shown averag comput local planner comput time vari problem difficult compar gener idea rel cost infer algorithm planner planner select metric paramet metric requir scale euclidean minkowski modifi minkowski determin good valu test select evalu tabl gener observ rel import translat distanc configur environ harder true optim paramet depend test configur constraint surfac distanc import closer interest observ hard environ displai similar characterist easi environ indic environ consid difficult environ select metric local planner select paramet valu left total distanc metric planner evalu metric environ summari result metric recommend local planner shown tabl metric import translat distanc rotat distanc recommend effici effect account metric suggest effici altern proc local metric planner easi moder hard good recommend good recommend good recommend euclidean euclidean euclidean euclidean tabl match distanc metric local planner number distanc metric figur number bold metric local planner test distanc metric local planner environ mass box easi environ moder environ hard environ surfac free distanc metric local planner environ mass box easi environ moder environ hard environ surfac free figur lp distanc environ metric perform compar environ metric environ environ good approxim exact cube metric extrem vertic object vertic detail result shown figur planner environ graph local set bar correspond version environ bottom black portion bar show averag number surfac connect local planner distanc metric closest node top white portion bar show free case fewer connect shown easi version environ moder hard differ due fewer connect surfac explan environ easi reason gener connect closest node cube easi surfac surfac connect report configur cube harder connect easi fewer connect surfac move tube harder time move configur tube intertwin half surfac point obstacl tube longer easi version moder hard factor obstacl tube larger move tube collid plan select local planner determin distanc metric suit local planner type compar local planner distanc metric combin figur local planner found outperform common planner case easi version explain fact swept volum planner gener planner planner fact planner surfac test configur improv maximum number iter dramat differ seemingli symmetr explain fact goal configur proc local planner distanc metric local planner environ mass easi environ moder environ hard environ surfac free local planner distanc metric local planner environ mass easi environ moder environ hard environ surfac free figur comparison pair environ connect chart local planner easi environ connect chart local planner easi environ figur lp coverag pie lp lp easi wai constraint surfac rotat goal involv rotat start free test configur reason explain fact similar behavior test configur constraint surfac rotat start goal interest observ make connect node surfac planner easi relat fact obstacl tube longer environ planner tube intertwin room maneuv multipl local planner result local planner choic planner slightli effect make connect slightli faster prm easili util local planner local planner make result answer pie chart shown figur show planner made connect empir evid import environ clutter recommend main goal studi determin good combin distanc metric local planner prm clutter environ report tabl includ recommend select distanc metric local planner type environ good choic scale euclidean weight posit coordin environ clutter absolut perform compar effici comput local planner outperform commonli planner found test local planner made connect roadmap connect enhanc prm multipl local planner reduc number fail connect local planner make connect base recommend order planner planner perform compar configur constraint planner proc acknowledg robot group texa jeff li han suggest work grate john latomb discuss comment alpha puzzl design bori comput graphic system group ge corpor research develop center ge provid product cad anim produc environ snapshot shown paper refer gupta motion plan base approach kinemat redund kinemat roadmap proc ieee internat conf robot autom page prm workspac proc intern workshop algorithm foundat robot amato wu random roadmap method path manipul plan proc ieee internat conf robot autom page april latomb robot motion distribut approach internat robot ariadn global plan local method proc ieee internat conf intel rob syst volum kumar parallel search algorithm robot motion plan proc ieee internat conf robot autom volum page chang li assembl maintain studi motion plan proc ieee internat conf robot autom page chen hwang motion planner perform proport task difficulti proc ieee internat conf robot autom page solv combin direct random search proc ieee internat conf robot autom page gupta guo motion plan sequenti search backtrack ieee tran robot motion plan freedom random reflect obstacl proc ieee internat conf robot autom page motwani path plan configur space proc ieee internat conf robot autom page hwang ahuja gross motion plan survei acm comput hwang ahuja potenti field approach path plan ieee tran robot hwang chen heurist compet planner classic mover problem proc ieee internat conf robot autom volum page hwang chen heurist complet planner classic mover problem proc ieee internat conf robot autom page latomb analysi probabilist roadmap path plan proc ieee internat conf robot autom volum page latomb configur space fast path plan proc ieee internat conf robot autom page raghavan random queri preprocess robot path plan proc acm symp theori comput page overmar probabilist roadmap path plan configur space ieee tran robot motion plan freedom bidirect heurist free space ieee tran robot sensor base map build rate function configur space proc ieee internat conf robot autom volum page latomb robot motion plan kluwer academ mclean increment roadmap global path plan evolv industri environ proc ieee internat conf robot autom volum page practic motion plan strategi base approach proc ieee internat conf robot autom page ong gilbert growth measur object separ penetr ieee tran robot overmar probabilist learn approach motion plan proc workshop algorithm foundat page metric modular robot motion plan ieee tran robot reif complex piano mover problem gener proc ieee symp foundat comput scienc page implement fast path planner industri manipul proc ieee internat conf robot autom volum page hwang path plan everydai robot proc ieee internat conf robot autom page xavier fast distanc robust detect proc ieee internat conf robot autom page zhang comput rotat distanc contact polyhedra proc ieee internat conf robot autom volum page
ML/843 6 fl kluwer academ boston manufactur netherland tutori support vector machin pattern recognit christoph jc burg bell lucent technolog fayyad abstract tutori start overview concept vc dimens structur risk minim describ linear support vector machin separ work detail describ mechan discuss svm solut uniqu global describ support vector train practic discuss detail kernel map techniqu construct svm solut nonlinear data show support vector machin larg vc dimens comput vc dimens homogen polynomi gaussian radial basi function kernel high vc dimens ill gener present exist theori show good gener perform argument support observ high accuraci review result experi inspir argument present give numer exampl proof kei theorem hope reader find materi cast fresh light support vector statist learn vc pattern recognit introduct paper provid introductori extens tutori basic idea support vector machin book excel descript leav room account start teach subject start late seventi receiv time suitabl introductori review tutori dwell pattern recognit problem idea carri directli case regress estim linear oper space constraint preclud explor topic tutori materi proof strong emphasi clear make materi access eleg gener easili ad basic idea clear longer proof collect appendix alert reader summar recent applic extens support vector machin pattern recognit svm isol handwritten digit recognit burg burg burg object recognit speaker identif charm detect face detect imag freund text categor regress estim svm compar benchmark time seri predict test osuna boston problem artifici pet oper problem svm gener perform error rate test match significantli compet method svm densiti estim anova decomposit studi basic svm prior knowledg problem larg class svm imag recognit problem give result pixel permut randomli imag suffer act leav perform neural network sever work incorpor prior knowledg svm burg scholkopf svm good gener slow test problem address osuna recent work gener basic idea scholkopf smola shown connect regular theori scholkopf shown svm idea incorpor wide rang algorithm smola scholkopf reader find thesi problem drove initi develop svm occur bia varianc tradeoff capac control overfit basic idea roughli learn finit amount train gener perform achiev balanc accuraci attain train abil machin learn train set error machin capac photograph memori present conclud tree number leav machin capac lazi declar tree gener explor formal concept result shine peak theori statist learn bold vector matrix normal vector matrix compon scalar label compon vector matric greek label vector matric roman indic familiar lagrang multipli solv problem equal inequ constraint assum bound gener perform pattern recognit learn machin remark famili bound govern relat capac learn machin perform theori grew empir quantiti converg number data point true calcul infinit amount start bound notat larg follow observ observ consist vector trust sourc tree recognit vector pixel valu imag simplifi subsequ assum exist unknown probabl distribut data data assum drawn ident cumul probabl note assumpt gener associ fix distribut trust sourc assign label fix condit assum fix machin task learn map machin defin set map function label adjust paramet ff machin assum input choic give output choic ff gener call neural network fix ff weight learn machin expect test error train machin jy note densiti dp written nice write true estim quantiti call expect risk call actual quantiti ultim interest defin measur error rate train set finit number jy note probabl distribut fix number choic ff train set fx quantiti jy call loss case valu loss probabl bound hold integ call vapnik chervonenki measur notion capac mention call hand side eq depart previou author call bound hold term hand side call note kei point bound independ assum train data test data drawn independ comput left hand side easili comput hand side learn machin famili function suffici small machin minim hand machin lowest upper bound actual risk principl method learn machin essenti idea structur risk minim section fix famili learn machin extent bound tight extent bound tight hope hand side inform learn machin minim actual risk bound tight chosen famili learn machin critic justifi target fire complaint reli experi judg vc dimens vc dimens properti set function ff gener set choic ff specifi defin class function function correspond pattern recognit ff set point label member set found correctli assign set point set function vc dimens set function defin maximum number train point note vc dimens exist set point gener true set point point orient hyperplan space data live set consist orient straight point side assign class point class orient shown figur side line point assign label find point set find vc dimens set orient line figur point orient line hyperplan theorem prove proof theorem set point point origin point orient hyperplan posit vector remain point linearli independ vc dimens set orient hyperplan point posit vector remain point linearli point vector linearli altern proof corollari found refer vc dimens number paramet vc dimens concret notion capac set function led expect learn machin paramet high vc learn machin paramet low vc dimens strike counterexampl due levin js denker learn machin infinit vc dimens famili classifi infinit vc dimens matter larg defin step function famili defin ff number present task find point label label ff ff vc dimens machin infinit arbitrarili larg number find point simpli equal assign label shown figur write phase oe ffi choic label requir ffi phase mod ffi point forc ffi ffi impli contrari assign label point set function eq set point ly orient hyperplan set chosen famili function figur point infinit vc dimens vc confid vc dimens sampl size figur vc confid monoton minim bound minim figur show term hand side eq vari choic confid level assum train sampl size vc confid monoton function true select learn machin empir risk learn machin set function minim vc dimens lead upper bound actual error empir learn machin minim hand side eq note adopt eq guid eq chosen upper bound actual risk prevent machin empir function set higher vc perform fact system good perform infinit vc dimens section note graph show vc confid exce higher valu bound tight exampl kth nearest neighbour set function infinit vc dimens empir number label successfulli learn algorithm point opposit class lie top bound inform classifi infinit vc bound valid bound nearest neighbour classifi perform infinit poor perform follow time honour tradit understand thing break classifi bound violat bound left hand side eq larg hand side small famili classifi worst actual risk empir risk number train vc dimens easi comput bound call classifi consist notebook room write class train subsequ classifi simpli pattern class data posit neg sampl chosen randomli notebook classifi empir risk train error subsequ actual vc dimens substitut valu eq bound met exp monoton structur risk minim summar principl structur risk minim note vc confid term eq depend chosen class empir risk actual risk depend function chosen train procedur find subset chosen set risk bound subset minim arrang thing vc dimens vari integ introduc divid entir class function nest subset comput bound srm consist find subset function minim bound actual risk simpli train seri subset goal train simpli minim empir risk train machin seri sum empir risk vc confid minim figur nest subset order vc dimens laid groundwork begin explor support vector machin linear support vector machin separ case start simplest linear machin train separ data analysi gener case nonlinear machin train data result similar quadrat program label train data fx hyperplan separ posit neg exampl point lie hyperplan satisfi normal perpendicular distanc hyperplan kwk euclidean norm shortest distanc separ hyperplan closest posit defin separ hyperplan linearli separ support vector algorithm simpli separ hyperplan largest margin formul train data satisfi combin set point equal eq hold exist point scale point lie hyperplan normal perpendicular distanc origin point equal eq hold lie hyperplan normal perpendicular distanc origin margin simpli note parallel train point fall find pair hyperplan maximum margin minim kwk subject constraint expect solut typic case form shown figur train point equal eq hold wind ly hyperplan remov chang solut call support figur extra circl switch lagrangian formul problem reason constraint replac constraint lagrang multipli easier handl reformul train data actual train test form dot product vector crucial properti gener procedur nonlinear case introduc posit lagrang multipli ff inequ constraint recal rule constraint form origin margin figur linear separ hyperplan separ case support vector circl constraint equat multipli posit lagrang multipli subtract object form lagrangian equal lagrang multipli unconstrain lp kwk ff ff minim lp respect simultan requir deriv lp respect ff subject constraint ff call set constraint convex quadrat program object function point satisfi constraint form convex set linear constraint defin convex set simultan linear constraint defin intersect convex convex mean solv maxim lp subject constraint gradient lp respect subject constraint ff call set constraint dual formul problem call wolf dual properti maximum lp subject constraint occur valu minimum lp subject constraint requir gradient lp respect vanish give ff ff equal constraint dual substitut eq give ld ff ff ff note lagrangian label formul lp ld object function solut found minim lp maxim ld note formul problem amount requir hyperplan constraint mild restrict high amount reduc number freedom support vector train linear amount maxim ld respect ff subject constraint posit ff solut notic lagrang multipli ff train point point ff call lie hyperplan train point ff lie equal eq side strict inequ eq hold support vector critic element train set lie closest train point remov move cross train separ hyperplan found condit condit plai central role theori practic constrain optim primal problem condit state lp ff lp ff ff ff condit satisfi solut constrain optim problem kind provid intersect set feasibl direct set descent direct coincid intersect set feasibl direct linear constraint set descent direct technic regular assumpt hold support vector constraint linear problem svm convex convex object constraint give convex feasibl convex problem regular condit condit suffici ff solut solv svm problem find solut condit fact result approach find solut path method mention section note explicitli determin train threshold implicitli determin easili found eq ff comput numer safer result notic weve cast problem optim problem constraint manag eq find solut real world problem requir numer method work rare case problem nontrivi number dimens solut solut found analyt optim main aim section explor pattern recognit problem support vector solut found result deriv proof problem train point turn support reason find solut analyt symmetr point ly sphere radiu point form vertic symmetr simplex conveni emb point lie hyperplan pass origin perpendicular point lie span recal vector label roman indic coordin coordin ffi ffi rn ffi defin ffi vector equidist point unit circl figur consequ symmetri angl pair vector equal kx ffi ffi assign class label arbitrarili find hyperplan separ class widest margin maxim ld eq subject ff subject equal eq strategi simpli solv problem inequ constraint result solut fact satisfi ff found gener actual maximum ld lie feasibl provid equal eq met order equal constraint introduc addit lagrang multipli seek maxim ld ff ff ij ff ff introduc hessian ij set simpl element diagon element fact element differ factor suggest solut ff unknown plug form eq defin substitut equal constraint eq find solut ff kwk ff ff ff ff ff note case lagrang multipli remain undetermin determin solv ff posit fact ff train point note kwk depend number posit polar class label assign point eq true number point minimum margin occur number posit neg case margin minimum margin occur case maximum margin simplex consist point ly span label point maximum minimum margin figur note result section amount construct proof vc dimens orient separ hyperplan test phase train support vector simpli determin side boundari hyperplan ly half parallel test pattern li assign class class case algorithm separ appli find feasibl evidenc object function dual grow arbitrarili larg extend idea handl relax constraint introduc cost primal object introduc posit slack variabl constraint error exce upper bound number train error natur assign extra cost error chang object function minim kwk kwk paramet chosen larger assign higher penalti error convex program problem posit integ quadrat program choic advantag lagrang wolf dual ld ff ff ff subject ff ff solut ns ff ns number support vector differ optim hyperplan case ff upper bound situat summar schemat figur condit primal problem primal lagrangian lp kwk ff fy lagrang multipli introduc enforc posit condit primal problem run number train dimens ff ff ff ff ff fy complementar eq determin threshold note eq combin eq show ff simpli train point ff eq comput numer averag train figur linear separ hyperplan case mechan analog case data ith support vector exert forc ff stiff sheet ly surfac denot unit vector direct solut satisfi condit mechan forc ff torqu support denot vector data condit sum forc vanish met easili show torqu vanish mechan analog depend form solut hold separ case fact analog hold gener nonlinear case analog interest point data point support vector highest valu exert highest forc sheet upper bound ff correspond upper bound forc point exert sheet analog reason good call vector exampl pictur figur show exampl pattern recognit separ class denot circl disk support vector identifi extra circl error case identifi cross reader invit lucent svm applet experi creat pictur bit figur linear separ background colour show shape surfac nonlinear support vector machin method gener case function linear function guyon show trick accomplish straightforward notic data train eq form dot map data infinit euclidean space map call train algorithm depend data dot product function form train explicitli infinit easi work explicitli replac train algorithm produc support vector machin live infinit roughli amount time train data previou section linear space live eq test phase svm comput dot product test point specif comput sign ns ff ns ff support vector avoid comput explicitli call space data case rang higher dimens note addit fact live gener vector map eq comput avoid sum make svm ns time ns number support idea line significantli speed test phase svm note easi find kernel kernel function dot product train algorithm solut found independ dimens section discuss function end section simpl construct map data vector easi find space map subscript refer vector data defin squar typic grei level imag imag shown figur figur illustr imag live space high surfac dimens note map space uniqu kernel equal chosen figur squar map literatur svm refer space hilbert end section note point hilbert space gener euclidean space behav fashion linear product complet respect norm cauchi sequenc point converg point author requir separ countabl subset closur space dont gener product scalar product euclidean space interest older mathemat literatur requir hilbert space infinit mathematician happi defin infinit euclidean space research hilbert space center oper basic properti long work peopl understand mention hilbert decid term euclidean tutori mercer condit kernel exist pair properti answer mercer condit courant exist map dx finit note specif easi check mercer condit satisfi eq hold finit norm satisfi eq easili prove condit satisfi posit integr power dot show typic term multinomi contribut term form left hand side eq simpl consequ kernel express posit real coeffici seri uniformli satisfi mercer fact note scholkopf kernel satisfi mercer exist data hessian quadrat program problem solut dual object function arbitrarili kernel satisfi mercer find train set result posit case train converg perfectli geometr interpret lack note mercer condit prospect kernel dot product construct homogen homogen dot product quadrat polynomi kernel discuss explicitli construct map kernel section show eq extend arbitrari homogen polynomi space euclidean space dimens data consist imag map data enorm number dimens ill gener perform result machin set hyperplan bg number pattern recognit system number paramet make past start gate svm argu form adjust paramet number train beg question requir maximum margin hyperplan save dai strong case made claim map surfac dimens obviou map eq imag vector simpl quadrat vector imag plai inhomogen kernel convinc map vector linearli depend vector linearli independ consid case implicitli equal turn thing start construct kernel fourier data cut form view dot product vector map kernel comput close easili ffi clear implicit map trick work algorithm data dot product nearest neighbor fact deriv nonlinear version princip compon analysi smola trick continu find exampl nonlinear svm kernel investig pattern recognit problem eq result classifi polynomi eq gaussian radial basi function eq kind sigmoid neural network rbf number center eq center weight threshold produc automat svm train give excel result compar classic case gaussian rbf neural network layer consist ns set set consist dl dimens layer consist ns weight ff evalu simpli requir weight sum evalu dot product test data support vector neural network architectur determin svm train hyperbol tangent kernel satisfi mercer condit valu paramet ffi data kxk notic condit paramet posit figur show result pattern recognit problem shown figur kernel chosen cubic polynomi notic number freedom linearli separ case solut roughli indic capac linearli case separ figur polynomi kernel background colour show shape surfac note svm classifi binari easili combin handl multiclass case effect combin train classifi case class test point largest posit distanc guyon global solut uniqu solut support vector train problem exist point feasibl region object function lower address kind wai uniqu solut bg eq solut bg differ pair bg ff requir fewer support vector trivial requir fewer instruct test phase turn local solut global properti convex program problem solut uniqu object function strictli case mean hessian posit definit quadrat object function hessian posit definit strictli true posit definit hessian impli strictli convex object vice versa hessian posit solut point real line coordin polar hessian posit solut eq uniqu easi find solut uniqu ff problem separ point squar polar solut ff ff solut satisfi constraint ff ff occur solut ff null space hessian ij requir ff orthogon vector compon ad ff ff eq leav ld unchang ff ff ff satisfi eq ff ff solut solut bg happen principl hessian posit solut necessarili simpl theorem show solut solut optim point continu deform solut optim intermedi point solut theorem variabl stand pair variabl bg hessian problem posit object function convex point object function attain minim exist path solut minimum object function convex satisfi constraint eq explicitli combin constraint theorem instruct problem depict figur optim solut case linear support vector smoothli move hyperplan solut gener hyperplan solut fact solut optim uniqu solut suitabl choic effect assign label note perfectli accept solut classif hyperplan primal object function higher figur solut note fact svm train find global solut contrast case neural local minima exist method solut support vector optim problem solv analyt number train data separ case train data support vector section note happen problem symmetri happen gener analyt worst case comput complex order ns number support exampl complex real world equat dot product replac solv numer small gener optim packag solv linearli constrain convex quadrat program good survei found larger rang exist techniqu brought bear full explor rel merit method fill tutori describ gener give explan techniqu mean set point ly boundari feasibl constraint equal hold nonlinear program techniqu basic recip note optim condit solut defin strategi approach optim uniformli dual object function subject decid decomposit algorithm portion train data handl time guyon freund give descript issu involv view problem requir solut sequenc equal constrain problem equal constrain problem solv step newton method requir storag factor project step conjug gradient ascent number data point problem extra storag algorithm move face constraint case algorithm restart constraint ad list equal constraint method disadvantag constraint made activ time consid point feasibl region line search project actual move remain insid feasibl region approach add constraint note activ constraint inact step essenti part hessian column ff comput algorithm comput newton advantag fact hessian posit diagon algorithm bunch hessian easili reduc block diagon form constraint made activ factor project hessian easili updat recomput factor interior point variabl essenti rescal remain insid feasibl region algorithm path algorithm method problem number support vector fraction train sampl size expect larg briefli describ core optim method activ set method combin gradient conjug gradient ascent object function extra cost phase search direct gradient nearest face search direct found dot product gradient maximum li current point nearest optim point search direct comput analyt requir line phase enter jump face repeat phase phase conjug gradient ascent face encount case phase stop criterion met note ffl search direct project ff continu satisfi equal constraint eq note conjug gradient algorithm simpli search subspac import project implement eq met angl result search search direct prior minim ffl face hit search direct adjust subsequ search face reset rate object function fall threshold ffl algorithm stop fraction rate object function fall toler doubl note stop criterion condit size project search direct fall threshold criterion handl scale ffl opinion hardest thing handl problem correctli algorithm slower good check algorithm work check solut satisfi condit primal suffici condit solut optim condit eq dot product data vector replac kernel expand eq gener map point check suffici check ff satisfi ff equal constraint point ff satisfi eq point ff satisfi eq suffici condit condit note explicitli comput trivial paralleliz support vector machin strike properti train test function depend data kernel function correspond dot product space dimens dh dh larg complex comput smaller kernel form dot product requir order comput requir oper dl dimens fact construct hyperplan high space left tractabl comput svm circumv form paramet intract paramet overfit train give result comput complex train algorithm result assum strategi situat problem train number train ns number support vector dl dimens input data case sv upper ns number oper dl ns dl start interior feasibl case sv upper ns ns dl sv upper ns larger decomposit algorithm date method guyon start arbitrari subset data train rest train data test result list error sort wrong side margin lie condit chunk construct combin ns support vector decid heurist chunk size grow quickli slowli result slow note vector drop support vector chunk final solut process continu data point found satisfi condit method requir number support vector ns small hessian size ns ns fit memori altern decomposit algorithm overcom limit freund small portion train data train subset support vector set point ff method shown easili handl problem train point support vector note speed approach reli support vector lagrang multipli ff upper ff train algorithm advantag parallel process wai element hessian comput simultan element requir comput dot product train parallel comput object speed parallel requir matrix parallel higher train chunk simultan scheme combin decomposit algorithm freund make larg problem support tractabl test test simpli evalu eq requir number oper requir evalu kernel dot product rbf dimens data vector evalu kernel sum highli paralleliz procedur absenc parallel speed test phase larg section vc dimens support vector machin show vc dimens svm larg explor argument spite svm exhibit good gener perform essenti plausibl argument exist theori famili svm high accuraci problem call kernel satisfi mercer condit posit space space call space minim dimens kernel theorem posit kernel correspond minim space vc dimens support vector machin error penalti eq minim space dimens dh dh point imag map found posit vector linearli independ theorem vector hyperplan restrict svm separ case error penalti valu point linearli found solut separ famili support vector machin kernel vc dimens dh exampl vc dimens polynomi kernel svm homogen polynomi act data dl dl case dl kernel quadrat explicitli construct map dl dimens correspond term power fact label compon explicitli write map dl dl dl dl lead theorem space data live dimens dl dl dimens minim homogen polynomi kernel dl proof vc dimens svm kernel note larg quickli vc dimens radial basi function kernel theorem class mercer kernel kx assum data chosen arbitrarili famili classifi consist support vector machin error penalti infinit vc dimens kernel ij gram matrix matrix dot train data element made arbitrarili assumpt diagon element matrix full set dot product form linearli independ theorem point hyperplan support vector machin suffici larg error penalti true finit number vc dimens classifi infinit note assumpt theorem stronger chosen make connect radial basi function fact train point chosen rank matrix ij limit gaussian rbf accomplish train data restrict lie bound subset dl small rbf width gener vc dimens svm rbf classifi data restrict lie bound subset dl restrict rbf width good control vc dimens case opportun present situat svm solut comput amount construct proof theorem concret case gaussian rbf kernel form train point smallest distanc pair point larger width oe function evalu support vector ff sum hand side larg domin term fact ratio term contribut rest sum made arbitrarili larg train point arbitrarili order find svm assum moment train point support work svm separ case argument hold svm case eq larg point support equal eq hold posit polar point assum posit polar point ff lagrang multipli assumpt correct deliv solut satisfi condit eq appli train equal constraint eq ff ff ff satisfi ff ff result ff condit constraint found global solut train number train separ vc dimens infinit situat summar schemat figur figur gaussian rbf svm suffici small width classifi arbitrarili larg number train point infinit vc dimens left strike vc dimens infinit data valu dl svm rbf excel perform similar stori hold polynomi svm gener perform svm section collect argument bound relat gener perform svm start present famili classifi structur risk minim rigor give insight maxim margin import vc dimens gap toler classifi famili classifi set function call toler classifi oe locat diamet ball parallel call set point ly hyperplan function oe defin point lie insid margin assign class depend side margin set fall point simpli defin assign class contribut risk situat figur odd famili condit result system similar structur risk minim demonstr rigor discuss appendix label diamet ball perpendicular distanc hyperplan vc dimens defin maximum number point point occur error wai appendix control vc dimens famili classifi control minimum margin maximum diamet member famili assum famili gap toler classifi diamet shown figur margin satisfi famili classifi correspond set classifi figur nest subset figur gap toler classifi data idea show gap toler classifi implement structur risk minim extens space arbitrari dimens encapsul theorem theorem data vc dimens gap toler classifi minimum margin maximum diamet dmax bound max min proof assum held follow symmetri argument point ly ball point gap toler classifi margin order point lie vertic symmetr lie surfac ball case number point satisfi point vc dimens orient hyperplan distribut point gap toler classifi orient show point sphere diamet sphere dimens result section find distribut point vertic symmetr gap toler classifi max min find distribut point max min point max min maximum number point written bd max min point max min quantiti hand side satisfi integ odd largest number point bound dd max min bound satisfi gener vc dimens gap toler classifi satisfi max min conclud proof gap toler structur risk svm structur risk minim gap toler classifi subset call train success train data assign label label coincid actual train error find subset fewest train error call number error find function oe maximum margin lowest bound vc note result risk bound hand side eq bound vc dimens place vc find subset train error find oe maximum note risk bound classifi minimum risk bound altern approach divid function nest subset oe mg satisfi dd famili function vc dimens bound note ae srm proce oe train succe subset empir risk minim oe lowest risk bound note essenti argument bound hold chosen minim empir risk elimin solut train point satisfi invalid result gap toler classifi fact special kind support vector machin simpli count data fall sphere train insid separ error reason conclud support vector train similar gain similar kind capac control train gap toler classifi argument constitut rigor demonstr structur risk minim svm origin argument structur risk minim svm structur determin data section subtl problem origin argument structur defin train point member margin set test point fall margin label simpli assign fix class vc dimens higher bound deriv theorem true label error label arriv gap toler classifi structur risk minim system structur depend data result bound looser vc bound examin typic case vc bound factor higher measur test moment structur risk minim provid rigor explan svm good gener perform argument strongli suggest algorithm minim expect give gener perform evid found theorem quot proof theorem optim hyperplan pass probabl error test expect left train set size expect train set size order observ real comput diamet minim sphere number train point kernel map comput minim sphere map space comput radiu smallest sphere map train minim subject ck center sphere introduc posit lagrang multipli primal lagrangian lp ck convex quadrat program maxim wolf dual ld replac subject solut problem similar support vector fact code easili modifi solv problem note analysi show exist priori reason expect center sphere express term map train data solut support vector eq chosen geometr fortun smallest area triangl point point posit vector linearli center triangl express term bound altern bound actual risk support vector support number train sampl actual risk machin train expect actual risk choic train set size support expect number support vector choic train set size easi bound typic situat train train shown figur figur support vector error remov dot line denot estim test error remov train test remov repeat train point support vector solut remov train point support vector includ effect hyperplan found worst happen support vector error expect train set upper bound actual train set size find bound situat actual error number support vector intuit give fewer support vector give fail bound tighter found estim vc dimens combin eq time section sv bound actual risk put observ mention train svm rbf classifi automat give valu rbf number center threshold gaussian paramet rbf width eq assum rbf width find optim oe minim figur show seri experi nist digit train point test point top curv left hand panel show vc bound bound result approxim vc dimens eq eq middl curv show bound bottom curv show measur test error bound hand panel show vc bound top oe test scale factor curv strike curv minima vc predict experi digit show vc bound gave minimum oe factor minim test error case vc bound consist gave lower predict oe minim test error minimum valu oe test actual risk sv bound vc bound sigma squar vc bound actual risk sigma squar figur vc bound predict limit biggest limit support vector approach li choic kernel kernel svm classifi paramet error kernel big rug sweep paramet work limit kernel prior knowledg choic kernel problem research issu limit speed train test speed problem test phase larg solv requir train pass train larg dataset support unsolv problem discret data present suitabl rescal excel result obtain work train multiclass svm step optim design multiclass svm classifi area research extens briefli describ method improv perform svm virtual support vector method burg burg attempt incorpor invari problem translat invari imag recognit train creat data distort result support vector case final train system distort data idea easi implement work method incorpor invari reduc set method burg introduc address speed support vector machin test start train svm idea replac sum eq similar support comput vector element train ff set weight comput number paramet chosen give speedup desir result vector vector paramet found minim euclidean norm differ origin vector approxim techniqu svm regress find effici function data combin method gave factor speedup error rate nist digit svm provid approach problem pattern recognit regress estim linear oper clear connect underli statist learn theori differ radic compar approach neural svm train find global simpl geometr interpret fertil ground investig svm larg choic svm link problem design larg bodi exist work kernel base method hope tutori encourag explor svm acknowledg im grate comment manuscript comment special due patient guidanc learn smola interest fruit valuabl discuss structur risk minim appendix proof theorem collect theorem state proof lemma shorter proof proof lemma set point separ hyperplan intersect convex hull empti notion point posit vector interchang proof ca cb convex hull set point denot set point posit vector ca cb mean convex hull show linearli separ show set linearli separ origin pick denot set point set linearli separ repeat process show linearli separ origin linearli separ show ca cb ca cb linearli separ origin ca cb origin ca cb ca cb ca cb suffici show convex set linearli separ point euclidean distanc minim chord join li point closer show line segment join convex impli ae assumpt point form angl occur point defin distanc closest point linearli separ ca cb linearli separ linearli separ linearli separ remain show set point linearli intersect convex hull empti assumpt exist pair gener point ca written fw bg point cb ca cb find point simultan satisfi inequ theorem set point point origin point orient hyperplan posit vector remain point linearli independ label origin assum posit vector remain point linearli independ partit point order subset convex hull set point posit vector satisfi ff ff ff posit vector point null posit vector convex hull set point posit vector satisfi fi fi fi posit vector point intersect exist simultan satisfi eq eq subtract equat linear combin posit vector contradict assumpt linear independ exist hyperplan separ true choic point remain show posit vector linearli point orient hyperplan posit vector linearli exist fl fl fl scale fl fl eq state origin li convex hull remain origin separ remain point point fl place term neg fl js js indic partit set origin scale equat loss gener hold left hand side eq posit vector point ly convex hull point equal point hand side posit vector point ly convex hull point convex hull set point separ hyperplan point theorem data dimens minim homogen polynomi kernel show number compon label compon eq compon uniqu identifi choic integ object distribut partit object left partit object fall partit correspond term product eq object fall left partit correspond term object fall partit correspond term number distinct term form number distribut object partit modulo permut partit permut show set vector compon span space fact compon linearli independ function imag act subspac exist fix nonzero vector label introduc compon eq hold map eq deriv appli oper eq pick term power eq give true choic compon vanish imag act span gap toler classifi vc bound point central argument collect point set choic label function set found assign label point vc dimens set function defin maximum number point slightli definit set point set function choic label function set found assign incorrect label point vc dimens set function defin maximum number point fact definit adopt enter vc bound proof function rang data assign posit neg definit point fall region simpli deem definit concret defin gap toler label point ly margin sphere error situat figur assign posit class point gap classifi margin width greater ball diamet point definit point definit caveat outlin vc bound appli function rang label mean point label bound appli function defin vc dimens weaken make follow notat point denot densiti oe function rang set function label fx xn finit number point requir properti exist oe defin set point fx fx requir oe set measur denot set point defin empir risk set fx oeg indic function note empir risk defin actual risk function oe note point contribut actual risk fix xn na number set xn ag set defin coeffici defin max na xn defin vc dimens class maximum integ theorem theorem defin point xn denot subset oe satisfi restrict view part train exp proof section theorem drop hold function oe hold oe minim empir error train data valu note proof hold definit note usual form vc bound easili deriv eq vc set exp solv ffl result appli gap toler classifi section classifi oe set paramet ball diamet orient hyperplan scalar call margin normal direct specifi point label posit minim distanc origin oe margin set sm defin set consist point minim distanc defin sm function oe defin set eq note privat commun reader elicit sink feel urg studi simpl geometr interpret lagrang boundari singl gradient function extrem parallel gradient function contour boundari boundari intersect gradient parallel linear combin case inequ gradient function contour boundari phrase function estim paramet estim comput function gener accuraci error rate test set size state term mathemat object consid pair set point lie hyperplan choic unit normal ng orient hyperplan set point span subspac linear gener convex hull set point gener posit defin vertic point deriv bound assum empir risk converg uniformli actual risk number train observ suffici condit lim number train sampl vc entropi set function set function infinit vc vc entropi log requir uniform converg bound nice geometr interpret dual basic find closest point convex hull set defin torqu ffl fn repeat indic sum hand ffl total tensor ffl greek indic denot tensor sum torqu sheet ffl ffl ff wn ffl wn origin formul call function sign repres class assign data point number paramet requir point manifold altern argu form lie subspac dimens work prepar smola point review point core quadrat optim line higher level code handl cach dot complex larger kaufman provid result recal sign de mean integ greater equal actual formula correct distanc pair vertic symmetr simplex eq rigor proof lack point privat commun altern bound set total bound function loss function empir risk bound looser eq case privat commun refer ma em li theoret foundat potenti function method pattern recognit learn autom remot anthoni pac learn neural network handbook brain theori neural page kp bennett geometri learn geometri page mathemat associ america cm bishop neural network pattern recognit clarendon vetter comparison object recognit algorithm realist model von der von artifici neural network page springer lectur note comput vol vapnik train algorithm optim margin classifi annual workshop comput learn acm jame bunch linda kaufman stabl method calcul inertia solv symmetr linear system mathemat jame bunch linda kaufman comput method indefinit quadrat program problem linear algebra burg scholkopf improv accuraci speed support vector learn machin advanc neural inform process system page mit press burg simplifi support vector rule thirteenth intern confer machin page morgan kaufman burg build local invari kernel nip workshop support vector machin support vector web technic lucent cort vapnik support vector network machin courant hilbert method mathemat physic luc gabor lugosi probabilist theori pattern recognit springer applic mathemat vol vapnik support vector regress machin advanc neural inform process fletcher practic method optim john wilei stuart geman eli neural network bia varianc dilemma neural girosi approxim support vector machin neural comput ai memo sa solla structur risk minim charact recognit advanc neural inform process pr hilbert space problem book van nostrand roger horn charl johnson matrix analysi cambridg joachim text categor support vector machin technic ls viii number kaufman solv qp problem support vector train nip workshop support vector machin kolmogorov introductori real analysi ol nonlinear program mcgraw linear algorithm applic john wilei dc montgomeri ea introduct linear regress analysi john wilei wright optim guid jorg solut larg quadrat program problem bound constraint siam girosi nonlinear predict chaotic time seri support vector machin ieee workshop neural network signal process page vapnik predict time seri support vector machin intern confer artifici neural page springer lectur note comput robert girosi improv train algorithm support vector machin ieee workshop neural network signal ed page robert girosi train support vector applic face detect ieee confer comput vision pattern page osuna girosi reduc complex support vector machin intern confer pattern recognit william brain saul william vetter numer recip art scientif comput cambridg schmidt identifi speaker support vector network interfac scholkopf support vector learn vapnik extract support data task fayyad intern confer knowledg discoveri data mine aaai menlo vapnik incorpor invari support vector learn machin von der von artifici neural network page springer lectur note comput vol vapnik prior knowledg support vector kernel advanc neural inform process system mit press press muller nonlinear compon analysi kernel eigenvalu problem neural press vapnik support vector method learn featur extract ninth australian congress neural network vapnik compar support vector machin gaussian kernel radial basi function classifi ieee tran sign john peter robert martin anthoni framework structur risk minim annual confer comput learn page john peter robert martin anthoni structur risk minim hierarchi technic technic report smola scholkopf method pattern approxim oper algorithmica muller gener cost function support vector regress ninth australian congress neural network alex bernhard muller connect regular oper support vector kernel neural network weston support vector anova decomposit technic royal hollowai report number gilbert strang introduct appli mathemat interior point method algorithm formul orsa rj interior point code quadrat program technic program statist oper princeton vapnik estim depend base empir data springer vapnik natur statist learn theori vapnik statist learn theori john wilei prepar smola support vector method function regress signal process advanc neural inform process grace support vector reproduc kernel hilbert space nip workshop support vector machin watkin densiti estim support vector machin technic royal hollowai report number
DB/844 3 pictori author search hyperlink web abstract depart comput scienc israel óò çùö ô óö øó ô øó øó øó øó øó óö òó òó áø óñ òó øó áø øó øó çùö óò óò øó keyword introduct øó óò óò øó copyright held hong kong acm ibm research lab israel ëù øó øó øó øó øó øó ø ôöó øó ôöó óò óò øó øûó øó øó çò óö øó web imag search áø áø áò ôöó øó øóö øó øóö øó óò øó óò link structur analysi web page search øó øó øó øóô óò ô øó õ ô ô õ ó ó øûó ô ô øó õ øó ô ô ô øó õ õ õ õ ñù ó òó øûó ø óö óò òóø øðý øó óò óö øó øó ó óò link structur analysi web imag search áò óò ó çùö ô óö øó ô øó øó ó øó øó ó øó øó ó øó áò óò ø øó óò áò çùö áø øó øó óò çùö òó øó ôöó øó øó øó áò òóø øó øó òó øó óò òóø óò øó øó óòðý øó áò øó øó ðó óö óùö óò óò óò áò óò áò øó óùö óò áò óùö òóø òó óò øó øó link analysi find authorit web page óò øûó øó óùö øûó óùö pagerank ô ô øûó øó óùö óò øó ô õ ô óùø øó øó ñù çùö áò ë óùö mutual reinforc approach øó øó ø øó ø øó ø øó ø óòðý ø ø øó øó ø áø øó óò ø õ ø ë øó õ óòðý ë ë øó ë øó ë ¢ ý ï óò øûó óòðý øóô øó øó á è øó ü ç è øó ü á øó øó øóö ï ì ç óô øó øó øóö ï øóö ï ì ï ì øó øûó ï ì ï ì ï ì ï ó ì ï ì ì øó áø øó óùø ý ï ý ó øùöò çùö ó ý ý øó øó óùö øóö øó link structur analysi find authorit imag óùö óð óùö formal definit model ô øó ô øûó ô ô óö ô øó óö ô òóø ô øó óòðý ø è ø á è óò è ô ï ý øó ä å ¢ ý øó adjac øó áò óùö óùö ó ý ý ó ý øóô øó ý øó ý è ý øó øó øó ý å ý å øó øó ó å ì å ó óò øó ý ó øó ó ó ìó ø ý ô øó ô ý ó å ì ï ì ý ó è ó òó øûó è øó ï å ý ¢ ý ó ï å øó øó øó øó ó ý ó ï ì ï å óò óùö ý å ï å ý ùô øó øóö å ï å áò çùö ý òóø weight relat øó ä øó øó ø øó øó óö øóö øó ëù óùö óö øó øó øó óò øóô øó øó øóô assembl topic collect çùö óò ø ø óò ø ø øó ø øó ø õ ø õ õ øó è øó ä òóø óòðý çò è á è øó ø øó ø çùö øó óö øó òóø óòðý óò øó øó ðó øó øó ðó ø øó ø øó áò òóø óö øó ðó øó øó óö òóø øûó øó óò identifi replic imag áò øó øûó áò øó çùö óòðý filter imag ô øó õ ô óò õ óö òó øó øó øó øó óùø øó øó øó øó ä óùø øó òóø óùø øó øó óùø ø óòðý øó øó òóø òóø øóô óö áò øó øó øó ùô óð óò óò ø áò óò óùø áø øó óò óò òóø óùø ôöó óùö øó ý øó ý øó øó imag rank scheme øó ø øó á ø øó ø ô ø öø ô òóø áò øó ó óò áò øó å è è ô ô ô ø ø øó ø ø øóö ô öø ô áò øó è è öø ô áò å òóø è è öø ô ï å ý ó å ì ì ï ì ï ø ô óùö ó ø ó øó ¢ øó ô öø ø ó å ì ê å ý ì ê ó ì ê ô öø öø óùø óò ó ý òóø ó ó øó imag imag hub øó øó óö çùö ó øó óò óò øó øó óùö øó ô ô øó óò øó óò çùö ó óö óùø óò ý øó øùöò ý ý å óö ô ô óùø øóö ì óñ øó ý ô øó ô ì ï ì ï å øó óò ô ô óö øó ô áò ý óùø óùö óñ øó óò discuss futur work óò øó áò øó óùö òóø óò øûó ý ï å óùö øó óùö ý å ý å òóø çùö óò øó ó ùö øó ðý øó óûò óò øó òó òóø áø òóø òóø òóø øó óö øó øó óò óò øó ø óñ øó óò øóô ôöó óò áø øó ó óùö øó øó óö øó áø øó øó øó óö áò óùö øó è è ë óò ø óò ë á øó óò óò òóø øó ë øó ø ôöó øó òóø ùö óò ø øó acknowledg øó óò vita ë óò ë å ë refer ê ë óò èöó óò ë ä èöó å ë ë ë óò èöó óò óñ ë â è ë èöó ë â ë ê è ë ë óñ â å ê èöó óñ óñ øö å î ë ì ï å èöó óò î å å èöó áò óñ áò óñ áò óñ áò ðý óñ áò ðý óñ ë óùö áò óùö óñ áò óñ ã áò èöó áòø óò å å â â ê ë ø èöó ç èöó à øûó â ë â ê ë óò â appendix url imag ðó óñ ó óñ óñ óñ óñ óñ óñ óñ óñ ù óñ óñ ì ó øó øûó òóø øðý óñ óñ óñ ùò óñ óñ ô óñ ô óñ ô óñ óñ ô óñ ô ú ù óñ ò ô ñ óñ ò óñ òý ò óñ ñ ë óùö óñ óñ ùò óñ ùò å ùò ùò óñ ü óñ öó óñ óñ óñ ø óñ
DB/845 3 boost variabl length earli classif juan carlo alonso abstract previou system time seri classif present base boost simpl liter predic base tempor interv type rel region oper ver region domain variabl work present featur system system deal directli variabl length time seri obtain classifi partial time seri essenti give alarm signal experi data set show method highli competit previou approach introduct multivari time seri classif domain signal continu system diagnosi data mine tempor problem tackl extract featur seri kind convent machin learn method approach drawback preprocess techniqu ad hoc domain heurist applic tempor domain difficult captur preprocess descript obtain featur hard understand design specif machin learn method induct time seri classifi construct classifi effici learn multivari time seri input consist set train exampl class consist time seri seri refer vari time machin learn point point seri attribut method learn time seri classifi work base liter tempor interv boost method gener ensembl inspir good result work ensembl simpl classifi work support spanish project tap de project sistema universidad de de de sistema universidad de studi base classifi consist liter method deal directli variabl length time seri preprocess data set order obtain fix length consid gener solut method variabl length seri liter seri long variant boost work featur capac assign preliminari classif incomplet exampl classifi gener dynam time gener long system dynam system classifi current histor valu variabl problem order confirm wait variabl evolv obtain classif input seri length rest chapter organ section introduct suit method base interv section section variabl length seri earli classif section present result give conclud remark section boost activ research topic ensembl classifi obtain gener combin base construct machin learn method target ensembl accuraci respect base classifi popular method creat ensembl boost famili adaboost promin member work assign weight exampl weight iter base classifi distribut weight weight base correct class assign base classifi final result obtain weight vote base classifi adaboost binari method extend adaboost multiclass case figur show instanc belong consid problem simultan version present main label belong finit label space associ weight combin exampl label base learner gener base hypothesi weight real weight base select weight readjust defin initi train weak learner distribut weak hypothesi updat normal factor output final arg max figur open question select train weak learner question address class base classifi return ln sum weight exampl bad classifi train base multiclass binari learner train weak learner binari class output weak binari gener uniqu tl select select good weak learner discrimin class rest class binari problem select valu defin tl interv base liter figur show classif predic point base predic point includ case point threshold true variabl point equal threshold note learner predic learn algorithm predic introduc test result obtain boost interv base predic kind interv predic rel region base rel predic differ valu interv region base predic base presenc valu variabl region interv section introduc detail includ select effici rel predic natur describ seri stai predic deal differ valu variabl end begin greater equal rang valu variabl interv equal predic express natur describ fairli complex pattern combin predic seri noisi strict definit interv relat hold point filter seri prior learn system time seri classif reli assumpt data clean predic extrem interv indic amount chang predic stai strict definit case point interv consid maximum differ valu interv paramet learn method predic liter select process select interv region base predic select definit predic base visual rule languag dynam system predic end variabl region interv begin end end true percentag percentag time begin end variabl region greater equal percentag predic point point le interv base stai region true percentag figur classif predic decid work tempor definit predic due fact extens conjunct disjunct interv demand true percentag addit paramet flexibl region region previou predic interv domain valu variabl case definit region obtain background knowledg obtain discret obtain consecut interv region consid interv form union interv equal reason fix region classifi obtain effici liter easier understand region fix overlap classifi tabl show classifi obtain data set classifi base classifi column show liter class data set weight liter class order classifi weight calcul assign class greater weight weight base classifi liter weight sum weight true liter minu sum weight liter variabl length seri normal length set seri preprocess data adequ domain method gener solut import learn method deal variabl length seri preprocess data set uniform length basic boost binari base classifi return variant predict base learner return real sign classif absolut confid predict special case consist base classifi select ln liter true seri length seri liter interv partial seri result evalu liter end seri begin result end seri result depend result extrem interv consid stai result point rang case result result point interv region case result result point interv region case result true result seri point interv insid region case result earli classif classifi obtain train exampl full necessarili length classifi classifi exampl wait classifi obtain initi classif complet liter defin result partial interv refer area liter result unknown interv learn method produc result linear combin liter liter unknown simpli omit classifi classif partial linear combin liter result simpl approach point valu unknown easili improv valu point interv result liter similar evalu liter variabl length seri valid characterist data set summar tabl train test partit result obtain liter cylind bell funnel true true true true true true true tabl classifi data set weight class ing experi fold stratifi cross valid tabl show obtain result data set combin predic set rel predic stai set interv includ true percentag includ consid special case true percentag liter data set show method overfit result data set improv liter tabl show data set obtain result iter interest issu result obtain result point base liter worst obtain result set interv close result comparison rel region base liter adequaci depend data set tabl show result earli classif consid length express term percentag length longest seri data set tabl show earli classif result interv liter demonstr rest section detail discuss data includ result boost point base interv base liter result data set bell artifici introduc learn task distinguish cylind bell funnel exampl gener obtain standard normal distribut integ obtain uniform distribut integ obtain uniform distribut exampl gener evalu function figur show exampl data set obtain result shown figur kind graph show error rate function number liter show error case earli classif maximum number consid liter error rate shown function percentag length seri result point base liter interv base liter result shown tabl earli result obtain seri length close obtain full seri error report event event cluster tree result interv base liter liter method obtain result earli classif liter seri length variabl length version exampl data set length order check method variabl length data set alter random number valu delet end maximum number valu elimin half origin length obtain result data shown figur tabl variabl length data set earli seri length percentag graph tabl rel length longest seri data set data set correspond point longest seri point interest issu obtain result alter data set result report origin data set control chart data set class control synthet gener process time seri length defin random number rs train length class variabl exampl test min averag max fold cv fold cv control fold cv fold cv trace fold cv tabl characterist data set liter true data set number point rel percentag interv control trace trace glove glove glove tabl result data set liter length true data set percentag point rel percentag interv control control trace trace glove glove tabl earli classif result data set liter cylind bell funnel figur exampl data set exampl class shown graph origin data set error number liter error seri length percentag point interv point interv variabl length data set error number liter error seri length percentag point interv point interv figur error graph data set error number liter liter point interv error seri length percentag percentag point interv tabl result data set error number liter liter point interv error seri length percentag percentag point interv tabl result data set rs gt rs gt rs kx time time rs kx figur show exampl class data obtain uci kdd archiv result shown figur tabl result interv base except earli classif short fragment possibl due fact liter refer interv initi fragment earli classif short error rate larg variabl length version control data set alter variabl length case result seri length result shown figur tabl trace dataset introduc benchmark classif system tempor pattern process industri data set gener artifici variabl shown figur combin behavior variabl produc class data set train test partit length seri run time algorithm depend length data set averag valu group length exampl result data set length result shown figur tabl data boost point base liter learn error greater boost interv base liter error earli error seri length result report recurr neural network wavelet error exampl assign class australian sign languag australian deaf commun instanc sign collect instrument glove wrist middl ring finger bend class exampl class minimum length maximum result shown figur tabl result report error event event cluster nave classifi result interv base liter respect result earli fact problem practic earli exampl gener quickli fact percentag longest data set length vari lot obtain result length includ exampl complet normal cyclic downward upward figur exampl control data set exampl class shown graph error number liter liter point interv error seri length percentag percentag point interv tabl result control data set error number liter liter point interv error seri length percentag percentag point interv tabl result data set origin data set error number liter error seri length percentag point interv point interv variabl length data set error number liter error seri length percentag point interv point interv figur error graph control data set error number liter liter point interv error seri length percentag percentag point interv tabl result trace data set case case figur trace data set variabl behavior exampl behavior shown error number liter error seri length percentag point interv point interv figur error graph trace data set error number liter error seri length percentag point interv point interv figur error graph data set error number liter liter point interv error seri length percentag percentag point interv tabl result data set time seri classif system present base boost simpl classifi individu classifi form liter bodi predic base interv kind interv predic rel region base rel predic differ valu region base predic presenc valu variabl region interv experi data set show method highli competit previou approach data method achiev report result awar strength method base result point base predic show incorpor interv predic improv significantli obtain iter interest featur method simplic user point method free number iter classifi obtain number iter includ obtain iter select initi fragment obtain classifi continu ad base classifi obtain classifi programm point view method simpl implement boost easiest classif method learn method deal directli variabl length seri evalu liter result boost method work base classifi featur method abil classifi incomplet exampl earli classif time gener option wait full interest featur earli classif influenc learn simpli capac obtain classifi relev fact order earli classifi addit classifi complex classifi main focu work classif accuraci method produc model weight tree rule present liter model figur show tree liter refer robert yanni similar queri emploi confer carlo alonso gonzalez juan graphic rule languag continu dynam intern confer comput intellig control autom dj pattern time dynam program advanc knowledg discoveri data um aaai press bai uci kdd moham descript multivari time intern cyclic upward normal downward figur tree data set control ferenc machin learn ivan bratko saso dzeroski morgan classifi machin learn data rs john wilei juan carlo henrik interv base intellig data david tempor classif window wavelet decomposit recurr neural intern topic meet nuclear plant control local featur extract applic librari phd depart yale robert introduct intern joint confer artifici intellig pp morgan robert schapir yoram boost algorithm annual confer comput learn theori pp
Agents/846 1 statist issu courant comput scienc depart pai du muse switzerland abstract paper describ multiag system applic simul framework collect robot result measur object outcom show form implicit cooper place system absenc explicit cooper virtu design system effect task achiev appropri introduc obstacl modifi environ agent preliminari partial concept emerg illustr system introduct work fit framework artifici intellig autonom agent concern collect phenomena issu carri solut system achiev global task virtu emerg selforgan system point view adapt capabl methodolog engin trend draw model evolutionari biologi studi anim particip concept embodi intellig surfac artifici intellig courant courant relinquish control stringent hierarch data structur favor decentr control strategi base interact influenc requir autonom compon expect lead solut emerg featur al epistemolog stanc fit root cognit found theori varela rosch work support type simul appli collect collect robot applic involv real robot paper focu case consist studi intens simul pool autonom agent regroup object distribut environ paper organ section short overview state art autonom reader basic kei concept understand framework work section devot discuss concept concept emerg section introduc testb applic relat work domain mention fourth section devot present result bring fore properti multiag system section devot discuss illustr notion emerg case simul section conclud paper autonom basic concept autonom agent design fulfil intern extern goal action continu interact environ unpredict major concept autonom agent embodi cognit depend kind experi bodi capac statement serv basi conceiv autonom agent embodi system embodi form framework form embodi found disput form relat physic embodi agent interact environ mean sensori percept motor control real robot form relat simul embodi agent interact artifici environ simul robot artifici life courant autonom interact system environ paramount import deal interact lead natur concept autonom emerg behavior function present widespread enc emerg framework autonom agent forrest emerg offer bridg necess complex adapt behavior macro level interact micro level system behavior consid emerg descript categori describ behavior constitu compon brook add emerg behavior lead emerg function behavior contribut system system build koenig emerg defin resort dynam system larg number interact entiti exhibit global properti exist level individu emerg properti import concept autonom agent autonomi type autonomi commonli point oper autonomi behavior autonomi oper autonomi defin capac oper human remot control behavior autonomi basi origin agent capac form adapt principl behavior freedom form principl behavior part view emerg find good concept exampl system exhibit emerg properti attempt defin concept grumbach jean al koenig major difficulti defin emerg fact emerg defin object emerg subject compon relat cognit properti explain notion disput todai introduc partial notion serv basi oper definit framework assum causal entail part observ world explain entail formal model model put correspond observ world hand abstract mechan phenomena observ world hand mechan figur result path form sequenc inferenti produc causal entail aim qualifi explan evalu model basi explan yield introduc notion cost benefit explan possibl defin cost benefit present choic cost respect length explan posit benefit constitut subject part evalu typic refer human cognit capabl gener critic point includ aspect unavoid evalu explan benefit scale satisfact explan strictli posit number defin explan respect ratio benefit cost econom model respect phenomenon defin econom econom explan explan model yield explan term econom defin note econom induc partial order model phenomenon econom model respect phenomenon tend speak emerg typic reflect search model provid higher notic equal explan observ phenomenon current speak respect search model mandatori low speak respect note object properti includ subject part observ world causal abstract abstract model inferenti model inferenti set model figur graphic view emerg rough estim benefit suffici testb simul tackl common problem collect robot lot agent seek object distribut environ order regroup object address problem innov aspect approach rest system integr autonom agent system freedom act agent decid action basi strictli local privat system type master type cooper system flexibl fault toler work relat work framework collect robot deneubourg al theraulaz deneubourg mondada mondada focu collect capabl system achiev cluster task system typic creat cluster object eventu regroup task system typic creat singl cluster object basi coordin robot implement simul swarm simul system environ discret squar set object set transpar obstacl set agent present agent roam avoid pick drop object outset object distribut environ obstacl set set chosen fix maximum object cell experi consid complet object present environ regroup agent singl cell speak stack agent consist action control algorithm modul depend applic user control algorithm modul defin type autonomi insid modul design decid implement oper autonomi behavior autonomi sake chose implement autonom agent agent decid action local inform master agent becker al deneubourg exploit coordin robot coordin mean liter work product system flexibl fault toler agent explicit coordin featur detect manag antagonist situat commun tool negoti fact indirect influenc environ variant control algorithm agent implement focu control agent carri object cell pick object probabl power alpha constant greater equal agent carri object cell systemat drop object cell special agent move cell note agent carri object time simpl control algorithm explicitli modul probabl pick object function local densiti suffici condit system regroup object section deneubourg al author show model mechan involv modul probabl drop object function local densiti suffici gener observ sequenc cluster state modul encompass privat inform agent depend control algorithm agent consist inform rel agent carri object intern variabl includ state random number gener agent endow type object percept move lead famili agent percept agent obstacl environ famili cell obstacl agent implicitli perceiv cell agent move note agent cell agent endow refer basic object perceiv quantiti object present cell stand agent endow random move capabl roam move direct randomli drawn agent type refer basic agent variant randomli draw probabl randomli draw direct probabl direct famili agent refer inerti agent famili agent agent agent artifici ey camera model horaud classic paramet translat rotat perceiv object object obstacl environ object closest optic avoid wander area est agent tune numer wai len larg number individu behavior previou conduct studi find paramet optim global behavior system vari number agent agent regroup agent regroup object singl stack finit act initi configur experi environ regroup agent concurr work expect yield singl stack object result goal explicitli embodi agent conflict natur due natur agent agent action agent time lead observ contradictori goal compar previou goal suggest action conform observ becker al deneubourg studi type conflict evolut system versu number type natur environ undertaken result found courant result size environ fix number run intens number experi famili agent introduc previou basic inerti agent agent camera basic agent inerti size environ object run experi agent size environ object run experi alpha set experi consist vari distribut object environ number agent measur cost system achiev task object regroup experi repeat simpl obstacl present part environ figur result yield collect system achiev global task object obstacl present environ figur displai cost basic inerti agent agent camera versu number agent system figur displai speedup system basic inerti agent agent camera versu number agent system agent defin cost system defin number iter system achiev task vertic bar chart standard deviat figur basic agent inerti cell environ object simpl obstacl agent red squar print repres green squar grei print repres black squar grei print materi obstacl figur agent cell environ object simpl obstacl agent ratio cost agent cost agent chart show perform system scale number agent number agent perform system illustr featur agent particip achiev global task awar explicit cooper virtu design context oper form implicit cooper place system make short form cooper accord ferber cooper system long number agent system defin effici system ratio number agent linear mean effici case effici system equal greater curv speak strong cooper case effici number speak weak cooper weak except case basic agent till agent figur inerti agent till agent figur strong cooper strong cooper found mondada robot expect remov long stick hole problem singl robot task requir synchron cooper robot case basic speedup approxim linear agent control algorithm agent extrem respect effici exhibit group agent slightli higher section true linear case agent camera presenc singl agent greatli perturb obstacl persist obstruct obstacl gener presenc agent attenu perturb notic obstacl agent time case agent rang linear significantli reduc absenc reason optim obviou camera guid movement fact agent direct featur found move strategi inerti agent compar basic inerti agent significantli reduc cost exhibit larger rang improv robust system agent encod specifi regroup object locat stack object end regroup experi result agent depend number number object presenc obstacl locat form presenc obstacl environ influenc locat due obviou spatial modifi spatial distribut final stack figur cell environ inerti object complex obstacl bet global task achiev examin control algorithm preempt manner achiev task exact locat final stack due determin system action environ depict figur object complex run locat frequenc final stack locat frequenc final stack north south locat frequenc final stack north south figur locat frequenc final stack involv inerti agent alpha set studi influenc obstacl spatial distribut final stack note number free cell north part south part result distribut locat stack object end experi suggest configur obstacl influenc outcom system figur displai frequenc locat final frequenc build stack north part environ significantli higher build south part discuss concentr result aim illustr concept emerg result fact global task object regroup achiev system simpl base modul probabl pick object function local stabil situat stack remain environ gener number clear differ size induc bia system stack process biggest stack stack constitut unstabl configur sooner differ size result concern exhibit system simpl reason number agent number stack remain step number stack outset effect number stack step lower lower number agent model system explan present easili complet express term model explan cost low benefit high emerg respect model true number agent cost basic obstacl environ number agent cost basic simpl obstacl environ figur basic cost complet task obstacl number agent basic obstacl environ number agent basic simpl obstacl environ figur basic speedup obstacl dot line linear model implement simul simul includ pseudo random number gener seed valu gener address result task singl run explan result term model run strong emerg explan term model tend extrem long benefit low econom close speak weak emerg simul simpl system agent present agent decid time action relat intern state percept collect behavior system implicitli driven individu behavior agent speak behavior autonomi level autonomi oper level agent supervisor system global task regroup encod explicitli environ repres agent explicit cooper protocol agent global task achiev virtu implicit plai role advantag approach adapt fault agent obstacl ad remov system extent run sever troubl configur obstacl influenc distribut locat final stack find mean control system compel fulfil specif task profit partial concept emerg preliminari serv basi oper definit emerg refer artifici intellig local action global stigmergi collect robot fourth workshop artifici life mit press number agent cost inerti obstacl environ number agent cost inerti simpl obstacl environ figur inerti cost complet task obstacl number agent inerti obstacl environ number agent inerti simpl obstacl environ figur inerti speedup obstacl dot line linear flexibl convei system base autonom vehicl car volum intellig collect herm emerg phenomena critic review de robust layer control system mobil robot ieee robot autom intellig reason emerg artifici life artifici intellig autonom concept implement fourteenth european meet cybernet system research volum conflict simpl multiag system workshop agent conflict le ver intellig collect emerg collect cooper phenomena natur artifici comput network physica constructivist approach autonom agent artifici life virtual john wilei son jc deneubourg al dynam collect ant robot ja mayer sw simul adapt anim mit press swarm simul toolkit build simul technic santa fe institut poster artifici life mate choic intern confer societi adapt behavior collect cooper group biolog number agent agent obstacl environ number agent cost agent simpl obstacl environ figur agent cost complet task obstacl number agent agent obstacl environ number agent agent simpl obstacl environ figur agent speedup obstacl dot line linear inspir experi robot fourth symposium robot probabilist model collect experi real robot intern symposium distribut autonom robot system local interact collect intellig biologi technolog intellig autonom agent nato asi seri mr jean al emerg herm koenig de scienc cognit cognit perspect autonom agent robot autonom system horaud vision par herm ground agent artifici world intern confer virtual world le de la vie le concept de la metaphor la relat avec sur le complex artifici life rout artifici intellig build situat agent lawrenc erlbaum embodi cognit scienc human experi mit press biolog ingredi cognit scienc steel artifici life rout artifici intellig build situat agent lawrenc erlbaum adapt behavior autonom agent autonom adapt behavior distribut simul journal
IR/847 5 featur subset select mladen depart intellig slovenia abstract paper describ method featur subset select larg text data comparison data collect web user show characterist problem domain machin learn algorithm consid featur score measur select problem domain consist hyperlink form repres word vector learn experi naiv bayesian classifi text data perform achiev featur select method base featur score measur call odd ratio inform retriev introduct proposit learn problem domain set class vector featur valu featur describ exampl relev benefici induct learn reduc qualiti induc model high number featur slow induct process give similar result obtain smaller featur subset section describ approach commonli featur subset select learn text data section compar featur score measur data collect web user section describ problem domain naiv bayesian classifi text experi discuss section featur subset select approach method develop featur subset select pattern recognit machin search strategi evalu function john al point differ main approach machin learn featur subset filter approach featur subset select independ learn method wrapper approach featur subset select learn algorithm learn domain repres select featur subset usual learn text defin featur word occur train document easili result ten thousand featur method featur subset select inform retriev simpl compar method develop machin learn score measur singl featur score assign featur featur sort assign score predefin number featur form solut featur subset score individu featur perform measur machin learn featur select learn inform gain tree induct inform retriev commonli featur score odd ratio problem rank document relev posit class occurr word featur log jc jc log jc jc jc jc jc condit probabl word occur class handl singular notic odd ratio averag featur inform record word occur consid experi measur inspir origin odd ratio includ simpl measur report work text classif domain score word frequenc word baselin measur random score assign experi measur similar inform gain expect cross keyword checker mutual inform includ inform gain base perform worst data odd ratio section domain descript machin learn problem defin predict click hyperlink set web document visit user perform user sit web browser wait request document prototyp system call person webwatch learn separ model user highlight hyperlink request web document hyperlink visit document machin learn exampl assign class posit click neg machin learn model function hyperlink hope function approxim interest hyperlink click hyperlink interest skip repres hyperlink small document underlin word window word head hyperlink document repres word vector call commonli inform learn perform naiv bayesian classifi word posit featur defin word experi perform data collect user particip project result user section data characterist tabl user approxim word occur document result featur domain posit class probabl number exampl data entropi tabl domain descript data collect user deal unbalanc class exampl neg experi test repetit randomli select exampl test exampl report averag standard error featur select learn perform train exampl data set observ influenc number featur select learn system perform unbalanc class distribut tabl classif accuraci give mislead result domain measur inform score geometr accuraci result present figur classif accuraci inform score estim model qualiti domain highest classif accuraci highest inform score achiev measur base odd tabl figur measur vector size approxim featur mean select featur subset includ featur similar reduct number featur observ measur vector size achiev worst result random closer word sort inform gain show word characterist neg class probabl posit document mean classif posit hyperlink repres word vector full select word experi didnt remov common frequent word result common word contribut poor perform frequenc measur req lowest line explan bad result achiev combin frequenc odd ratio frequenc stand combin odd ratio valu frequenc combin case combin frequenc logarithm probabl quotient logarithm part stand measur achiev result score measur accuraci inform score featur freq random freq random tabl subset classif result plot figur domain discuss compar attribut score measur inform gain machin learn experi text data variant odd ratio frequenc random baselin measur result experi suggest featur subset select featur select find contradict result report problem domain result suggest problem class target class featur score measur base odd ratio identifi posit exampl dont care identifi neg exampl prior probabl posit class low naiv bayesian formula consid word occur document rapid featur exampl repres word vector full vector size score method random freq vector size score method random freq vector size score method random freq vector size score method random freq fig influenc vector size classif accuraci inform score data notic curv sort valu end classifi prior probabl mean order identifi posit document select featur probabl posit class hold suffici differ suffici number product member naiv bayesian formula base featur score measur condit result point problem domain machin learn algorithm characterist select featur score measur import simpl featur subset select approach solut qualiti trade time complex featur subset found approxim assum featur independ assumpt naiv bayesian classifi experi experi plan includ remov infrequ featur common word modif test data hypothesi good behavior simpl score frequenc set yang pedersen acknowledg work support ministri scienc technolog part work perform author stai carnegi mellon author grate tom mitchel machin learn group carnegi mellon gener suggest fruit discuss refer languag independ autom learn text categor proc annual int confer research develop inform field trial internet commun acm vol decemb probabilist analysi rocchio algorithm tfidf text proc intern confer machin learn pp irrelev featur subset select proc intern confer machin learn pp adapt person inform filter system organ person profil proc int joint confer artifici intellig pp hierarch classifi document proc intern confer machin learn pp evalu criterion classifi machin learn kluwer academ learn neg exampl european confer machin learn pp machin person implement technic report learn user identif interest web machin learn kluwer academ pp van select good search inform process shaw comput perfect retriev inform process compar studi featur select text proc intern confer machin learn pp articl process macro packag llnc style
IR/848 5 criterion function document experi analysi ying zhao georg karypi depart comput scienc armi research center mn technic report updat februari abstract recent wit tremend growth volum text document digit intranet led interest develop method user effect organ inform ultim goal find fast document cluster algorithm plai import role goal shown provid intuit mechan organ larg amount inform small number cluster greatli improv retriev perform queri import document cluster expand rang applic led develop number algorithm class cluster algorithm low comput requir treat cluster problem optim process seek maxim minim cluster criterion function defin entir cluster solut focu paper evalu perform criterion function problem cluster document studi involv total criterion introduc paper past evalu consist evalu involv fifteen analysi characterist criterion function effect cluster produc result show set criterion function consist outperform newli criterion function lead result theoret analysi criterion function show rel perform depend correctli oper cluster lead balanc cluster introduct topic cluster extens studi scientif disciplin year varieti algorithm develop recent survei work support nsf armi research offic contract doe armi high perform comput research center contract number relat paper www topic offer summari applic algorithm algorithm categor dimens base underli methodolog lead agglom partit structur final lead hierarch hierarch solut agglom algorithm find cluster initi assign object cluster repeatedli merg pair cluster stop criterion met number method determin pair cluster group averag complet link cure rock hierarch algorithm produc cluster form singl cluster top cluster leav partit autoclass find cluster partit entir dataset predetermin automat deriv number cluster depend cluster solut obtain sequenc repeat bisect gener relat cluster solut produc level case rise hierarch solut recent research recogn partit cluster algorithm cluster larg document dataset due low comput requir kei characterist partit cluster algorithm global criterion function optim drive entir cluster process algorithm criterion function implicit algorithm criterion function explicit easili state class algorithm thought consist kei compon criterion function optim cluster actual algorithm achiev optim compon larg independ focu paper studi suitabl criterion function problem cluster document dataset evalu total criterion function measur aspect combin criterion function util view underli model document vector high model collect graph evalu perform criterion function data set obtain sourc experi show criterion function lead substanti set criterion function produc cluster solut analysi criterion function show perform depend correctli oper dataset cluster densiti document similar produc balanc cluster analysi show sensit differ cluster densiti explain outcom studi observ earlier result report cluster algorithm solut obtain perform sequenc repeat bisect criterion function solut obtain comput cluster directli solut comput repeat differ densiti cluster discov gener smaller densiti differ cluster cluster algorithm handl variat cluster densiti tend perform substanti comput cluster repeat bisect rest paper organ section inform document repres similar distanc document comput section describ criterion function algorithm optim section detail evalu criterion function section analyz criterion function explain perform section conclud remark direct futur research global cluster criterion function inher featur partit cluster algorithm context agglom algorithm cluster algorithm criterion function paper cluster toolkit onlin preliminari document cluster algorithm paper model repres document document consid vector simplest document repres vector dv frequenc ith term document wide refin model weight term base document frequenc document collect motiv weight term frequent document limit discrimin reason commonli multipli frequenc term total number document number document ith term document lead account document length document vector normal unit length document vector unit rest assum vector document weight normal unit length similar measur promin wai comput similar document di dj method base commonli cosin function ii document vector unit formula simplifi measur document common vector orthogon method comput similar document euclidean give dj ii distanc document common distanc note fact measur similar measur measur similar document vector unit length definit paper symbol denot number number number symbol denot set document sk denot nk denot size cluster set document vector defin composit vector da da dca centroid vector ca da ca ai composit vector da sum document vector centroid ca vector obtain averag weight term present document note document vector length centroid vector necessarili unit length vector properti cosin function measur similar document advantag number properti involv composit centroid vector set document si sj set document nj document dj cj composit centroid vector sum similar document si document sj equal di dj sum similar document si equal ii di ii note equat includ similar involv pair vector document cluster problem cluster defin set partit number subset document assign subset similar document assign subset discuss focu paper studi suitabl cluster criterion function context partit document cluster algorithm cluster problem cluster criterion function comput cluster solut optim rest section present number criterion function evalu drive cluster descript optim algorithm cluster criterion function intern criterion function class cluster criterion function produc cluster solut optim criterion function defin document part cluster account document assign cluster due view cluster process refer criterion function intern intern criterion function studi maxim sum averag similar document assign weight size cluster cosin function measur similar cluster solut optim criterion maxim mr equat formula note definit includ document cluster criterion function similar context hierarch agglom cluster heurist determin pair cluster merg criterion function studi popular variant algorithm algorithm cluster repres centroid vector goal find cluster solut maxim similar document centroid cluster assign cosin function measur similar document criterion function maxim formula compar criterion function essenti differ criterion function scale similar ii term nr term term ii similar document tend import cluster ii dr document smaller similar compar cluster higher similar note similar document centroid vector cluster defin back criterion function intern criterion function studi tradit algorithm criterion function euclidean distanc determin document cluster determin qualiti cluster solut function criterion defin minim simpl algebra manipul equat rewritten dill show criterion function similar natur similar express term squar distanc basic properti dill equat nr lr lr minim maxim discuss extern criterion function unlik intern criterion extern criterion function deriv cluster solut optim function base cluster due view cluster process refer criterion function extern hard defin extern criterion function lead cluster solut intuit extern function deriv requir centroid vector cluster mutual orthogon document share term cluster problem criterion function trivial solut achiev assign cluster singl document share term assign rest document kth cluster extern function studi separ document cluster entir separ document cluster extern criterion function defin minim nr centroid vector entir collect equat minim cosin centroid vector cluster centroid vector entir collect minim cosin essenti angl note contribut cluster weight base cluster larger cluster weight heavier cluster solut extern criterion function motiv multipl discrimin analysi similar minim trace scatter matrix equat ii composit vector entir document collect note ii constant irrespect cluster solut criterion function minim ii dr ii equat initi motiv defin extern criterion cosin function measur separ cluster entir criterion function account similar document ii df ii hybrid criterion function combin extern intern characterist cluster extern criterion function defin respect euclidean distanc function error centroid vector maxim nf ii cr shown maxim ident minim hybrid criterion function criterion function optim singl criterion function defin term document assign cluster relat document assign cluster relat entir collect maxim measur similar document minim similar cluster document collect cluster criterion function combin defin set hybrid criterion function simultan optim multipl individu criterion function focu hybrid criterion function obtain combin criterion criterion function maxim xk maxim ii note maxim relat graph base criterion function criterion function view document vector altern view relat document graph type graph model document context cluster graph graph obtain comput similar graph obtain view document term bipartit graph collect document similar graph gs obtain model document edg pair vertic weight equal similar document view document number combin criterion function defin measur cluster qualiti studi investig criterion function call recent fall categori criterion function combin intern extern view cluster process defin minim vertic sr rest vertic graph sr set vertic defin sum edg connect vertic vertic motiv criterion function cluster process view partit document group minim partit reason similar discuss section extern criterion trivial reason scale sum intern edg shown scale lead balanc cluster solut cosin function measur similar equat criterion function ir criterion function simplifi minim ii altern graph model view document term graph gb consist set vd vt vertex set vd correspond document vertex set vt correspond term ith document jth edg connect ith vertex vd jth vertex vt weight edg set discuss section bipartit problem cluster view comput simultan partit document term criterion function defin optim studi focu base criterion function call normal recent context bipartit graph model document cluster normal cut criterion function defin minim vr set vertic assign rth sum weight adjac list vertic assign rth cluster note rth cluster vertic va document term kei motiv criterion function comput cluster group document term document note quantiti primarili normal ensur optim criterion function lead trivial solut similar ii dr ii factor criterion function optim wai criterion function previou section optim common perform optim greedi strategi greedi approach commonli context partit cluster algorithm criterion function shown converg local minima altern power optim base spectral properti document similar matrix matrix multilevel optim method optim method develop subset criterion function studi criterion function optim greedi strategi primarili ensur optim equal power criterion function greedi optim consist initi cluster refin initi cluster cluster solut comput number desir document randomli select form seed cluster similar document seed document assign cluster similar seed similar document seed determin cosin measur document vector approach lead initi cluster solut criterion function approach produc initi partit va document produc initi partit vt term algorithm obtain initi partit vt induc partit va comput partit assign partit correspond highest cut column weight column partit assign partit highest sum note assign total due minim goal cluster refin phase initi cluster solut iter refin criterion function depend criterion function refin strategi refin strategi consist number iter document visit random order comput chang criterion function obtain move di cluster exist move lead improv criterion move cluster lead highest improv cluster remain cluster belong refin phase perform iter document move cluster note unlik tradit refin approach type algorithm move document determin lead improv criterion function type refin algorithm call increment move directli optim criterion refin strategi converg local minima criterion function refin strategi defin term cluster composit centroid chang criterion function result singl document move comput effici refin strategi criterion function base altern cluster refin past partit bipartit graph similarli refin consist number iter iter consist step document visit random order comput chang obtain move di cluster exist move di move cluster lead highest reduct cluster di remain cluster belong term visit random order comput chang obtain move cluster exist move tj move cluster lead highest reduct cluster tj remain cluster belong refin phase perform iter document term move cluster refin approach converg local minima algorithm refin phase greedi converg global local minima solut obtain depend set seed document select obtain initi cluster elimin process repeat number time comput cluster solut initi cluster cluster achiev criterion function rest discuss refer cluster solut solut obtain select potenti solut result evalu perform cluster criterion function number dataset rest section describ dataset descript result document collect total fifteen dataset gener characterist summar tabl smallest dataset document largest document ensur obtain sourc data remov common word stem porter algorithm term occur fewer document elimin classic dataset obtain combin medlin abstract past evalu inform retriev system data individu set form class fbi dataset foreign broadcast inform servic data class correspond categor collect sport dataset deriv san jose mercuri newspap articl distribut part trec collect vol dataset construct select document part topic articl categor descript dataset document review dataset document sport dataset document hockei select document ensur document share descript tag multipl dataset obtain articl lo angel time categori correspond desk paper articl includ document sport desk dataset onlin data sourc document term class classic fbi fbi san jose mercuri review san jose mercuri sport san jose mercuri la time trec trec trec rel kl webac webac wap webac tabl summari data set evalu cluster criterion function dataset deriv collect class dataset correspond document judg relev queri dataset obtain ohsum collect document index uniqu categori dataset document molecular sequenc risk tomographi categori dataset tel text categor test collect distribut divid label set construct data set data select document singl label dataset wap webac project document correspond web page list subject hierarchi dataset kla set document differ document assign class kla categor methodolog metric dataset obtain cluster solut optim cluster criterion function qualiti cluster solut measur metric class label document assign cluster metric wide entropi measur class document distribut measur puriti measur extend cluster document primarili class cluster sr size entropi cluster defin nr log nr nr nr number class number document ith class assign rth cluster entropi entir cluster solut defin sum individu cluster entropi weight cluster size nr entropi sr perfect cluster solut lead cluster document singl case entropi smaller entropi cluster solut similar puriti cluster defin fraction cluster size largest class document assign cluster repres puriti cluster solut obtain weight sum individu cluster puriti puriti sr larger valu cluster solut elimin instanc cluster solut criterion function trap bad local experi found ten cluster solut entropi puriti valu report rest section correspond averag entropi puriti ten solut discuss section ten cluster solut correspond solut ten initi partit refin phase criterion function comput cluster solut number experi perform complet dai pentium workstat evalu direct cluster set experi evalu qualiti cluster solut produc criterion function directli comput cluster solut result dataset criterion function cluster solut shown tabl show entropi puriti result entir set experi result tabl provid primarili complet order evalu criterion function summar result averag perform criterion function entir set dataset summar result averag entropi criterion function fifteen dataset cluster qualiti dataset qualiti improv number felt simpl averag distort result summar base averag rel dataset divid entropi obtain criterion function smallest entropi obtain dataset criterion function ratio repres criterion function perform criterion function seri experi note dataset valu criterion function achiev solut measur entropi ratio sensit actual entropi valu refer ratio rel entropi criterion function averag rel entropi dataset criterion function averag rel entropi close function dataset averag rel entropi criterion function perform poorli perform similar transform puriti function higher valu puriti divid puriti puriti higher opposit ratio divid puriti achiev criterion averag dataset valu averag rel puriti interpret similar manner averag rel entropi good close greater valu averag rel entropi cluster solut shown tabl row label averag averag set cluster solut entri underlin correspond criterion function perform boldfac entri correspond criterion function perform entropi cluster cluster dataset classic fbi review sport wap cluster cluster dataset classic fbi review sport wap puriti cluster cluster dataset classic fbi review sport wap cluster cluster dataset classic fbi review sport wap tabl entropi puriti dataset criterion function cluster solut obtain direct cluster averag rel entropi avg averag rel puriti tabl rel entropi puriti averag dataset criterion function cluster solut obtain direct cluster underlin entri repres perform boldfac entri correspond scheme perform number observ made analyz result tabl criterion function lead cluster solut consist solut obtain criterion function true qualiti cluster solut evalu entropi puriti measur lead solut term entropi term puriti solut criterion function lead solut irrespect number cluster measur evalu cluster qualiti entir set method solut criterion function perform solut entropi puriti criterion function perform qualiti evalu puriti criterion function perform middl road averag term entropi term puriti compar scheme note rel perform criterion function remain evalu method chang rel differ criterion function measur entropi greater compar measur puriti entropi measur account entir distribut document cluster largest class puriti measur evalu cluster repeat bisect set experi evalu cluster solut produc criterion function cluster solut obtain sequenc cluster bisect solut obtain bisect entir collect cluster select lead total cluster process select bisect cluster continu cluster obtain bisect perform result cluster solut optim criterion function cluster solut necessarili local minima respect criterion function obtain cluster solut fashion desir result solut easili visual kei step algorithm method select cluster bisect number approach chose select largest approach lead good balanc cluster solut tabl show qualiti cluster solut produc criterion function entropi cluster cluster dataset classic review sport wap cluster cluster dataset classic review sport wap puriti cluster cluster dataset classic review sport wap cluster cluster dataset classic review sport wap tabl entropi puriti dataset criterion function cluster solut obtain repeat bisect solut obtain repeat bisect result primarili provid complet discuss focu averag rel entropi puriti cluster solut shown tabl valu tabl obtain procedur discuss section averag result tabl averag rel entropi avg averag rel puriti avg tabl rel entropi puriti averag dataset criterion function cluster solut obtain repeat bisect underlin entri repres perform boldfac entri correspond scheme perform number observ made analyz result criterion function lead cluster term entropi term puriti criterion function lead criterion function criterion function perform solut qualiti measur qualiti measur entropi result gener consist obtain direct cluster case repeat reduct rel differ worst scheme term direct similar trend observ criterion function puriti rel improv appar criterion function perform reason improv discuss section interest observ averag rel entropi repeat bisect higher result obtain direct higher variat rel perform criterion function data set figur compar qualiti cluster solut obtain direct cluster obtain repeat bisect plot obtain divid entropi achiev direct approach entropi achiev rb averag ratio fifteen data set criterion function number cluster lower entropi valu ratio greater rb approach lead solut direct vice versa higher puriti valu ratio smaller rb approach lead solut direct plot figur make number observ term entropi criterion function lead solut direct rb cluster remain criterion rel perform sensit number cluster small number direct approach lead number cluster rb approach outperform direct sensit number cluster true cluster criterion main differ quickli qualiti direct versu rb cluster direct versu rb cluster criterion function criterion function figur rel perform direct cluster repeat bisect averag entropi puriti measur direct cluster solut degrad criterion function rel perform chang significantli direct rb fact cluster criterion function qualiti solut obtain repeat bisect achiev direct cluster alarm solut obtain rb approach local minima respect criterion lead qualit cluster expect direct strictli rb fact happen suggest problem criterion function discuss analyz section evalu cluster repeat bisect investig behavior cluster approach perform sequenc experi final solut obtain criterion refin greedi refin algorithm goal optim criterion function refin algorithm ident section refer scheme detail result sequenc experi shown tabl summari result term averag rel entropi shown tabl compar rel perform criterion function similar direct approach tend outperform term entropi term puriti scheme figur compar rel qualiti solut solut obtain scheme plot gener method gener plot figur result optim criterion qualiti solut larg number cluster largest degrad optim cluster qualiti slightli result verifi observ made section suggest optim criterion function necessarili lead qualiti larg valu discuss analysi evalu criterion function present section show interest trend qualiti cluster solut produc seemingli similar criterion function substanti entropi cluster cluster dataset classic fbi review sport wap cluster cluster dataset classic fbi oat oat review sport wap puriti cluster cluster dataset classic fbi review sport wap cluster cluster dataset classic fbi review sport wap tabl entropi puriti dataset criterion function cluster solut obtain repeat bisect refin averag rel entropi avg averag rel puriti tabl rel entropi puriti averag dataset criterion function cluster solut obtain repeat bisect refin underlin entri repres perform boldfac entri correspond scheme perform versu rb cluster el ht gt criterion function versu rb cluster criterion function figur rel perform repeat cluster refin repeat bisect result averag entropi puriti measur intern criterion produc cluster solut maxim cluster similar function perform substanti true criterion attempt minim function account cluster similar cluster dissimilar perform consist trend criterion qualiti solut produc repeat bisect gener solut produc direct cluster perform refin perform gap number cluster remain section analyz criterion function explain trend analysi criterion function start point analyz perform intern criterion function import qualit understand fail tabl show cluster solut obtain sport dataset intern criterion function row repres show document assign cluster document categori singl document categori column label show number document assign column label show averag similar document cluster row show valu entropi puriti measur cluster solut note cluster comput direct cluster approach criterion cid size sim hockei box bicycl criterion cid size sim hockei box bicycl tabl distribut cluster solut criterion function sport dataset result tabl criterion function produc unbalanc cluster mixtur cluster tight cluster behav differ wai produc solut cluster ninth larg number document categori low similar produc singl larg cluster poor qualiti qualit differ cluster produc produc exclud larg poor remain cluster tend pure tight averag similar document criterion function produc fairli pure tend tight observ natur cluster solut produc criterion function hold remain dataset specif sport dataset analyz behavior focu condit movement document cluster lead improv criterion function cluster si sj document initi part si averag similar document si ci averag similar document si shown appendix criterion function document move si sj iff case criterion function move happen iff jj compar equat equat make observ explain behavior cluster document substanti averag criterion function tend move document fight cluster document similar tight cluster loss document small tend move differenti criterion function small move place case document common document move sj long gi low averag similar document cluster criterion function move averag similar document sj equat move iff observ explain result shown tabl cluster solut fairli pure tight singl larg poor qualiti cluster singl cluster act garbag collector attract document cluster gi move condit satisfi easili rang valu meet move condit larger move document higher power pull document fight cluster cluster lead cluster solut exist singl larg cluster document rest cluster make cluster pure tight document high similar document sj frequent move tight cluster cluster compar criterion long equat satisfi graphic illustr figur show rang valu movement document ith jth cluster lead improv criterion function plot figur obtain plot figur obtain set plot ni nj plot figur correspond correspond averag similar valu region plot figur label base criterion function move base set valu plot region small valu perform move condit discuss main reason creat larg poor qualiti cluster region perform move region averag similar document cluster sj rel intern similar sj greater quantiti si plot size region differ tight cluster justif type move behav document sj measur document si exhibit dynam model characterist move move condit move condit figur rang valu document move ith jth cluster plot show rang averag similar document ith jth cluster plot show rang respect similar case cluster assum document base close cluster properti cluster principl dynam model shown lead error primari evid cluster membership actual guess reason criterion function lead cluster gener noisi cluster tabl illustr analysi criterion function criterion function measur qualiti cluster solut account separ cluster tight cluster experi present section show lead cluster solut set experi highest perform differ criterion function occur direct cluster tabl show cluster solut sport data set produc illustr differ cluster qualiti result criterion function lead cluster solut balanc produc criterion function solut obtain criterion function exhibit similar characterist lesser solut obtain criterion function previou section produc mixtur larg small smaller cluster fight larger cluster order compar criterion function import rewrit make similar dissimilar appar averag similar document rth cluster averag similar document sr entir set document criterion function rewritten nr nr nr criterion cid size sim hockei box bicycl criterion cid size sim hockei box bicycl tabl distribut cluster solut criterion function sport dataset criterion function rewritten mr compar equat differ wai differ measur qualiti combin individu cluster qualiti measur deriv qualiti cluster solut case qualiti rth cluster case qualiti measur qualiti cluster relat prefer cluster solut cluster extrem small larg cluster tend small cluster qualiti measur tend produc solut balanc cluster turn impli sensit gs cluster qualiti measur cluster small valu higher sensit due measur qualiti expect lead balanc cluster solut result tabl show happen unbalanc cluster produc attribut differ suggest differ combin individu cluster qualiti measur deriv qualiti cluster reason unbalanc cluster criterion function sum individu cluster qualiti weight size cluster perform similar summat cluster qualiti weight size cluster weight scheme similar natur wide graph partit differ individu cluster qualiti weight reason lead significantli unbalanc cluster solut reason recal previou discuss qualiti measur cluster relat qualiti measur larg cluster larg cluster tend case multipli qualiti measur cluster ensur larg cluster contribut lot criterion function tend optim larg cluster case divid qualiti measur larg cluster net effect contribut cluster criterion function optim point exist larg cluster illustr creat criterion function deriv cluster qualiti measur combin mechan criterion function defin minim ii find cluster solut sport dataset shown tabl compar cluster solut produc produc gs solut balanc achiev substanti lower entropi criterion cid size sim hockei box bicycl tabl distribut cluster solut criterion function sport dataset analysi criterion function experi present section show criterion function consist led cluster solut worst solut produc criterion function consid studi illustr criterion function tabl show cluster solut produc direct cluster sport dataset solut produc solut highli unbalanc sixth cluster document differ cluster document primarili singl categori note cluster solut produc similar produc criterion function cluster find good map scheme natur criterion function make extrem hard analyz reason potenti explain unbalanc cluster produc fact inspir approach separ cluster measur versu size respect cluster shown normal cut approach context tradit graph lead solut unbalanc obtain criterion function discuss section balanc mechan lead unbalanc cluster solut criterion cid size sim hockei box bicycl tabl distribut cluster solut criterion function sport dataset analysi criterion function set criterion function focu hybrid criterion function deriv combin criterion cluster solut produc criterion function sport dataset shown tabl result tabl compar result produc criterion function lead cluster solut combin characterist respect pair individu criterion function criterion function lead solut balanc unbalanc solut balanc balanc criterion cid size sim hockei box bicycl criterion cid size sim hockei box bicycl tabl distribut cluster solut criterion function sport dataset experi section qualiti solut measur produc closer solut produc closer qualiti measur term perform rel remain outperform understand criterion function condit document move current cluster si cluster sj document move stai criterion function defin improv perform move interest case criterion function move remain depend criterion function improv rel degrad function move lead larg improv small perform order make import pair criterion function involv roughli rang valu improv criterion function compar degrad case criterion studi show long suffici criterion function order case closer match criterion function explain perform rel respect pair criterion solut closer analysi direct cluster versu repeat bisect discuss begin experi present section show criterion suffici larg valu cluster solut produc repeat bisect solut obtain direct cluster reason analysi criterion function base differ tight averag similar document document natur part fighter cluster end move looser cluster criterion function tend produc incorrect cluster result cluster tight criterion function sensit tight differ criterion function cluster solut obtain repeat differ tight pair cluster success bisect tend small cluster tend homogen result pair subclust small tight differ cluster comput directli final cluster obtain sequenc repeat bisect exist cluster differ tight exist pair criterion function end move document fighter cluster weakli connect rest document looser cluster final cluster solut potenti obtain repeat bisect illustr behavior criterion function comput cluster solut repeat refin solut perform refin result shown tabl solut cluster cluster fight compar solut obtain perform refin size cluster looser size fighter cluster cluster case reason cluster produc direct cluster cluster produc repeat bisect tendenc produc solut balanc cluster size imbal greater cluster obtain repeat imbal direct cluster addit constraint cluster reason perform observ direct cluster criterion repeat bisect cid size sim footbal hockei box bicycl golf criterion refin cid size sim footbal hockei box bicycl tabl distribut cluster solut criterion function sport solut refin conclud remark paper studi global criterion function cluster larg document dataset function document remain introduc studi consist detail evalu fifteen dataset approach find desir theoret analysi characterist criterion function experi show criterion function tradit algorithm perform criterion function variant lead good result outperform solut produc recent criterion function criterion function perform criterion function achiev result analysi show perform differ observ criterion function attribut extent criterion function sensit cluster extend lead balanc solut analysi identifi defici criterion function provid guidanc improv refer stephen philip yu merit build categor system cluster proc acm sigkdd confer knowledg discoveri data page mw st gw obrien linear algebra intellig inform retriev siam eh moor document categor queri gener world wide web webac ai eh moor cluster web document categor support system daniel bolei princip direct partit data mine knowledg cheeseman stutz classif theori result um advanc knowledg discoveri data page dr jo dr jw tukei approach larg document collect acm page page ap nm rubin maximum likelihood incomplet data em algorithm journal royal statist document word bipartit spectral graph partit technic report depart comput ds concept decomposit larg text data cluster technic report research report rj ibm research chri ming simon spectral cut graph partit data cluster technic report lawrenc berkelei nation ro pe dg stork pattern classif john wilei xu algorithm discov cluster larg spatial proc confer knowledg discoveri data rajeev shim effici cluster algorithm larg proc conf manag rajeev shim robust cluster algorithm categor attribut proc conf data eh moor web agent document categor proc intern confer autonom eh hypergraph base cluster data summari result bulletin technic data spatial cluster method data survei miller geograph data mine knowledg discoveri taylor tj interact retriev evalu larg test collect research page je jackson user guid princip compon john wilei ak flynn data review acm comput ak jain dube algorithm cluster data prentic karypi eh concept fast reduct algorithm applic document retriev categor technic report depart comput www url cs umn eh kumar hierarch cluster algorithm dynam model ieee eh kumar multilevel refin hierarch cluster technic report depart comput karypi kumar fast highli qualiti multilevel scheme partit irregular graph siam journal scientif www url short version intl conf parallel process kaufman pj find group introduct john wilei king cluster procedur journal american partit rectangular structur matric parallel comput siam journal scientif larsen aon fast effect text mine document cluster proc acm sigkdd confer knowledg discoveri data page lee cluster analysi applic jt advanc inform system scienc plenum dd lewi text categor test collect distribut research att method classif analysi multivari observ proc symp math page mobash web page categor featur select associ rule princip compon cluster workshop inform technolog dec ng han effici effect cluster method spatial data mine proc vldb page mf porter algorithm suffix strip salton automat text retriev inform comput ph numer taxonomi kumar comparison document cluster techniqu kdd workshop text ghosh scalabl approach cluster theodoridi pattern recognit academ trec text retriev confer nist jason denni bruce zhang autom discoveri activ motif molecul intern confer knowledg discoveri data page method detect describ gestalt cluster ieee transact gu bipartit graph partit data cluster gu spectral relax cluster technic report pennsylvania state effici data cluster method larg proc conf manag analysi document move condit cluster si sj document initi part cj composit centroid vector di ci document si criterion function move si sj reduc criterion function ni nj ni nj equat rewritten ii ni ni di di di nj nj nj nj dj dj dj nj nj dj nj dj ni nj nj ni ni ni ni nj nj nj assum ni nj suffici close close factor involv ni nj elimin lead averag similar document si averag similar document si equat rewritten document move sj cluster long differ averag similar document cluster half differ averag similar document si sj criterion function move si sj similar fashion equat rewritten di di di dj dj suffici larg di di di di di di hold long gi oi significantli larger condit fairli mild essenti requir suffici larg rel true set document form cluster equat equat rewritten di dj equat move document long
IR/849 5 digit librari donna carl alex cornel digit librari research group abstract crawl web build collect document relat topic activ area research late crawler technolog develop benefit search engin web crawl consid import strategi build larg scale digit librari paper consid crawl technolog exploit collect build make crawl crawl goal make crawl web power crawler softwar implement crawl tunnel overcom limit pure approach tunnel priorit link page page relev estim link priorit add mix tunnel crawl strategi evalu current crawl direct fly determin termin tunnel activ result combin crawl tunnel tool build digit librari introduct tool techniqu build larg scale digit answer question crucial success nation scienc digit librari project goal build possibl largest digit librari date accomplish includ resourc partner nsf incorpor wealth scientif mathemat inform open web build digit librari breadth scale requir innov techniqu task undertaken ampl expert human scale labor prohibit note arm kei move digit librari depend human labor li combin raw comput power smart algorithm paper describ aspect work techniqu automat build onlin collect topic specif resourc task critic find organ needl vast web haystack earlier paper initi result attempt web crawl build collect establish topic hierarchi paper focu techniqu make process increasingli import size web comput scale problem greater describ techniqu call tunnel mean determin link follow sourc page select crawl build collect hypothesi examin pattern correl web link path select crawl techniqu paper structur part background work autom collect build part describ gener issu web crawl part heart describ tunnel techniqu improv web crawl part result web work develop tunnel techniqu close part describ result appli part relat work document tent class nearest subject correl document consid collect correl link html page collect item collect repres url figur merit indic item belong collect qualiti collect depend initi input topic hierarchi metric assign download document collect collect build depend crawl crawl discuss section build number collect subfield technolog start topic hierarchi subject leverag googl return good document construct centroid hit googl build crawl seed independ includ hub topic queri centroid construct hit return search result program submit queri googl result page hit url replac ad hoc approach formal soap recent announc limit rang topic googl find fewer document search result hit concaten page turn term vector term weight basic frequenc word set divid frequenc word page download queri link pdf ps ad parent correl valu weight standard inform retriev advantag build collect simultan term document frequenc estim term occurr queri set centroid weight term frequenc centroid built gener success implement crawl depend heavili initi subject descriptor found index term list math forum work sourc math subject curriculum outlin grade scienc fail broad gener term find proper term specif subject hierarchi crucial automat collect synthesi crawl select harvest interest url web intens research topic late earli work web crawl xerox parc pirolli pitkow chakrabarti semin paper introduc crawl collect web advantag search engin produc collect search engin prepar answer queri web crawler distinguish page analyz link follow newli discov link crawl frontier download turn attempt order url discov search engin crawl defin coupl wai kleinberg hub author brin page page rank defin term link definit concentr relev topic definit combin link analysi find page specif author topic crawl grew text categor assign document categori hit algorithm search stai commun extract topic number crawler develop web chakrabarti al implement crawler storag manag renni mccallum design crawler attempt crawl page type feedback crawl menczer al work design evalu crawler report build collect high good summar result crawl end interest techniqu crawl context graph introduc continu work experi crawler base power crawler softwar crawler written configur file option crawl base class extens extens support flavor includ crawl extens led crawler build number collect simultan main goal complet start set topic descript document assumpt lie idea crawl link page relev relev page assumpt made page link topic studi found likelihood link page similar textual content consid random pair page web assumpt anchor text descript content page point problem anchor text content anchor text includ research found anchor fairli lack semant inform assumpt page analysi determin page relat topic collect assembl final assumpt link inform focu crawl studi found text url string import inform collect physic document url relev url word stop list appli url page support directli mercat configur includ option filter url string crawl encount page url server mark desir note semant web initi type link addit inform attach link crawler trick crawl order crawl frontier link relev page link page requir estim relev page point base assumpt list assum link unlik earlier mercat research estim error priorit frontier intens goal crawl mercat support priorit chose exploit mercat abil pass inform parent url child link creat threshold valu set configur file appli entir crawl mercat track increment counter crawl path exce point termin crawl direct set low limit amount irrelev materi crawl threshold number determin correl level document respect centroid set threshold high encourag high collect experi good set crawl threshold collect chanc relev threshold crude wai crawl essenti page page page minim size crawl limit scope tunnel extend scope crawl ad tunnel crawl drawback necessarili optim simpli follow page relev crawl follow seri bad page order good import recal build collect url expositori page subject defin term number crawl term rank download inspect amount trash hurt impact obtain result reason applic tunnel start crawl necessarili start seed case build collect start seed appli equal collect tunnel desir part web tunnel improv crawl expand prune path main challeng decid stop termin direct crawl definit nugget web document cosin correl collect centroid higher threshold document repres correl score document match centroid highli path notat definit correl path length path length path link common path length path length partial path seed treat seed nugget termin path final distanc nugget greater equal incomplet path due crawl time consist incomplet crawl begin root tree proce downward tabl tunnel definit path notat sequenc page link nugget path length minu number path crawl tree consist link obviou illustr definit introduc correl score download document score argmax centroid setup collect topic area mathemat topic basic linear algebra graph equat hour crawl perform collect document topic order collect set threshold maxim data save download url download url correl url page nearest centroid url parent document link seed crawl download url nearest nugget ancestor distanc integ impli url greater nugget ancestor function page cosin correl parent distanc level simplest distanc metric relat distanc node nugget parent distanc data gain insight structur crawl portion web path data path sequenc correl signal statist analyz collect stand chanc empir answer nugget diamet web page download correl predict link depend led bad part web nugget correl high good correl score predict lead shape path pure white inform crawl path determin abandon path infer path longer path crawl irrelev part web answer question lead find wai make tunnel section report statist result empir studi result uniqu document download analyz small portion larg sampl make statist observ path termin due result approxim maxim tunnel crawl hope find inform statist design good tunnel strategi long nugget run complet common length complet path correspond figur tabl show distribut distanc closest ancestor nugget gener popul note length ancestor find nugget high valu figur suggest tunnel point worthwhil nugget level number avg corr max corr tabl correl path length column distanc closest ancestor nugget column number node includ nugget averag correl parent children tabl distribut correl gener popul compar distribut children node column fall column show distribut children parent score rang distribut note nugget averag opposit true children nugget correl bracket predict mean make big estim relev link target path histori matter score individu node poor histori crawl strategi dynam alter shape question treat path priorit relev area web chose analyz compar path end path end penultim document predict final document figur show result indic good pai attent path histori nugget displai correl gener popul node bracket node total tabl parent parent node rang distribut children parent children gener popul correl number averag path standard bracket node length nugget deviat tabl averag path length children nugget correl score correl bracket grandpar grandpar low score parent correl bracket grandpar grandpar high score parent fig path shape matter ancestor nugget popul larg combin parent grandpar lead nugget divid graph parent node parent distribut grandpar score case score parent matter probabl reach nugget match gener popul highli score grandpar make curv shift distinctli aspect path histori shape ancestor slide averag path lead nugget path nugget tend end higher node path lower figur window size window averag path type path smallest window averag averag window averag partial path xxx nugget path window averag good determin crawl path dip middl window distinguish dip window averag compar number averag window averag path closer closer stop frontier grow rapidli discov worth minut million url frontier million hour larg frontier make priorit crawl weed url land frontier slow run typic full crawl mercat hour drop initi speed page page data structur grow larger larger threshold drop crawl slow larg crawl run amount materi crawl crucial provid impact stop achiev put find practic crawl threshold valu statist path data path histori account replac distanc metric section adapt distanc nugget correl score current parent remain constant crawl node distanc nugget grow exponenti length path rel lower correl score greater distanc crawl termin fewer step adapt hour crawl threshold result shown figur tabl figur adapt crawl show smooth declin node correl distanc impli dynam distanc measur accur reflect good current node respect correl path graph suddenli reason adapt metric essenti infin distanc nugget ancestor averag correl distanc nugget fig averag correl download paper distanc nearest nugget ancestor result crawl tunnel base adapt frontier million url hour compar figur tabl regular crawl adapt threshold length min min final url frontier uniqu doc tabl comparison minut regular crawl minut crawl adapt part percentag number document crawl adapt minut complet vastli fix crawl simpli mean path termin distanc nearest ancestor nugget result tabl show benefit accru part statist relat crawl termin download adapt larger frontier minut regular larger data download rate faster crawl perform compar time network congest answer crawl stai longer territori spend time figur url document reflect uniqu document download figur adapt focu gain lot part tabl talk qualiti download document correl document percentag higher adapt win hand larger proport download document nugget relat research work similar work work conceptu similar execut start set run build collect time report broad scope hand exploit parallel automat process karypi han vector space model start set centroid construct requir hand seed topic distil techniqu locat page topic emerg start question taxonomi topic distil work crucial autom digit determin current topic structur web aspect collect build relationship cluster field artifici intellig recommend applic ai cluster support vector text close spirit collect build karypi han set exist document collect construct centroid collect make term vector collect remain document classifi nearest centroid classif good document classifi collect origin interest work classif compar classif algorithm typic artifici naiv neighbor algorithm experi conclud document classif accur result extend web feel justifi approach paper technolog web crawler build collect larg scale digit librari build technolog introduc inform retriev term vector cosin web commun tunnel introduc term nugget concept path nugget perform larg crawl gain statist insight natur path path histori relev inform design adapt reflect path expand tunnel concept achiev highli crawl expect appli strategi futur work digit collect synthesi acknowledg work fund part nsf grant project ii due bill arm suggest research focu autom collect build acknowledg technic receiv system research center marc richard chri implement mercat extens captur path data suggest term refer autom digit comput skill task magazin digit librari research find cambridg collect synthesi joint confer digit librari connect fast access linkag inform web intern world wide web confer comput network isdn system special feb anatomi hypertextu web search engin intern world wide web confer onlin feb recent result automat web resourc discoveri acm comput survei van den distribut hypertext resourc discoveri exampl vldb confer pp van den approach web resourc discoveri eighth intern web confer pp current august topic local web annual intern confer research develop inform retriev juli acm crawl context graph intern confer larg infer web commun link topolog acm confer hypertext time space structur hypermedia system pp document analysi result tech rep comput mar extens web crawler world wide web support vector method learn rank function inform march cornel topic distil hierarch categor web document workshop knowledg data engin exchang ieee authorit sourc hyperlink environ journal acm compil document collect internet sigir forum lagoz core servic architectur nation digit librari scienc educ joint confer digit librari adapt retriev intern local context scale web pp republish machin pp evalu web crawler sigir septemb la system collect analyz web inform intern world wide web gener elsevi august web crawl tech rep research report compaq sept prima faci argument favor semant web silk sow extract usabl structur web reinforc learn spider web intern confer machin learn automat inform organ retriev nsf nation mathemat educ digit librari project project report magazin digit librari research
HCI/850 4 usabl inform log approach michel pott steve nation institut standard technolog bureau drive md posit paper prepar workshop concern issu experi surround log data commun briefli describ relev element field studi group weld engin collabor system conduct nist log data captur field studi order time order import preserv analysi present experi issu encount analysi data context categor techniqu analysi sequenti data hilbert group descript core weld research team peopl role divid team member locat physic facil actual weld weld testb guest research particip necessarili physic core group particip weld collaboratori access workplac client desktop comput comput weld testb tw collabor system wysiwi whiteboard backdrop tw provid boundari data group user metaphor transit groupwar doorwai provid portal room data organ room configur occup organ tool graphic tw system synchron asynchron user importantli interact context relev data work experi full group meet plan period individu activ smaller coordin meet team member output task input task collect data nativ version tw produc inform ident user enter distribut ident room user file messag pass user set interact deem rudimentari captur type data usabl analysi sourc code applic contract vendor instrument softwar addit log issu surfac subsequ negoti pertin workshop focu usabl analyst tend interact log vendor primarili perform implic log fine granular potenti impact system perform outcom negoti vendor analyst creation log addit inform content chat combin user room id tool id tool combin user tool id annot tool content modifi messag ad messag board content inform collect server log supplement questionnair interview data log data quantit natur interact append custom log file event creat base server log found kind issu emerg data data issu issu data issu center granular log analysi start start expect exploratori data analysi interest user interact behavior commerci product identifi document describ collabor softwar environ identif impli recommend nist strategi work fairli analysi found interest track investig fulli explor insuffici data granular log support deep level investig issu center abstract log data put data context goal match log data qualit evalu data user satisfact questionnair data issu background user interfac event gener normal oper user interfac system ui event includ button data input select input captur ui event data gener system produc event ui event correspond user interact regard potenti fruit sourc inform applic usag usabl natur ui log event produc larg quantiti data difficult abstract level analysi sanderson fisher descript exploratori sequenti data analysi discuss rang event type interact author note granular captur event rang ey movement chang time topic occur interv rang minut meet minut project extend month year enorm variabl granular durat event perspect lead parallel set ui event captur hilbert studi user interfac event categor yield usabl data author describ type abstract user interact hierarchi level physic input devic user interfac abstract interact event provid valu input relat event attent level time difficult address level interact yardstick measur scale clear data set creat interact user comput system larg collabor system necessarili experi combinatori due potenti actual interact multipl user data issu explor log event gener requir access applic code import issu relat perform applic log event log huge quantiti event slow applic turn affect usabl user satisfact applic discret warrant log huge quantiti event gener larg log concern situat granular event log respect anticip hard question easier answer question log differ log applic log gener standard format common tool analyz technolog suggest extens markup languag tag log data softwar tool interpret tool specif analyz log data file gener tool spreadsheet statist analysi visual specif format format gener set tool produc notion explor june evalu collabor analysi issu experi hilbert group techniqu analyz sequenti techniqu appli domain interact give hilbert descript relat experi issu techniqu categori synchron search techniqu user interfac event synchron sourc data video record code observ log search medium locat supplementari inform simplest techniqu exploit user interfac event usabl evalu techniqu fall process construct timelin event month experi data input user attempt hypertext markup languag present run problem appropri portrai level event abstract transform event stream transform involv recod event stream facilit human autom analysi summari pattern visual tool select abstract event sequenc interest perform count summari count summari statist report facil spreadsheet manag tool detect sequenc techniqu investig identifi occurr concret abstractli defin sequenc sequenc event potenti usabl explor visual event happen target sequenc spreadsheet manag tool detect select sequenc necess tool fashion problem visual abil deal appropri potenti larg amount white space compar sequenc compar actual sequenc event model trace expect sequenc identifi potenti usabl perform expert walkthrough usabl begun mine log type approach measur step perform particip weld scenario expert synergist applic visual method analysi techniqu techniqu present result transform form human exploit innat visual analysi capabl interpret complet descript visual tool found evalu support evalu environ facilit flexibl composit visual capabl provid integr rudimentari integr evalu support provid basic summari statist plan significantli augment aspect system time addit issu fit relat unrel issu analysi relat issu log put keystrok compar quantit data qualit data unrel issu address thing ethic log chat refer roseman room metaphor transit groupwar research report depart comput canada dm df extract usabl inform user interfac event technic report depart inform comput irvin steve allen workshop evalu collabor workshop report ieee intern workshop enabl infrastructur collabor pp steve tool visual group work ieee intern workshop enabl infrastructur collabor pp pm fisher exploratori sequenti data foundat special issu exploratori sequenti data analysi interact
ML/851 6 learn evalu visual featur pose estim robert sim gregori dudek centr intellig machin mcgill canada abstract present method learn set visual landmark pose estim landmark learn mechan design applic wide rang gener approach comput pose estim landmark detect local measur distinct repres princip compon encod exploit match attribut observ landmark gener method evalu term util pose estim present evid demonstr util method introduct develop approach robot local learn set landmark robot environ landmark learn repres set imag obtain initi explor environ priori assumpt made landmark initi obtain maxim local measur distinct imag approach mimic process visual attent paper extend previou work learn problem broader evalu varieti landmark attribut util present evalu result lead improv explor strategi method base main model detect recogniz characterist linear subspac method recogn interpol reconstruct incomplet optim estim combin pose estim singl view elabor idea paper section present discuss relat work problem pose estim section present overview method approach landmark detect match discuss section section present approach determin landmark util examin type landmark attribut emploi pose estim section result paper conclud section discuss result previou work earli solut pose estim problem assum problem landmark recognit easili solv reliabl extract uniqu landmark sensor data method reli featur strict assumpt sensor number author develop method avoid explicit imag defin implicit landmark bayesian framework linear discrimin princip compon analysi note circumst imag recoveri reduc linear interpol suitabl model techniqu demonstr good result pose estim face object recognit encod featur interpret method base global candid landmark track landmark attribut imag sampl pose space figur train method imag tend fail presenc outlier approach attempt overcom avoid assumpt sensor exploit imag properti overview method section present overview approach pose estim method consist distinct learn explor pose estim phase initi phase set landmark extract imag data group futur recognit set attribut learn track encod gener exploit landmark function camera posit emploi pose camera consist detect classifi landmark current comput pose estim attribut observ landmark method depict figur learn phase imag collect sampl rang pose environ landmark candid extract imag model visual attent candid landmark independ pose estim final pose estim input imag match track landmark filter merg figur onlin pose estim phase track landmark extract track visual similar candid landmark configur space track landmark basi set comput landmark attribut posit intens edg measur term priori util pose estim set track landmark store futur retriev pose estim posit estim singl imag acquir camera candid landmark extract input imag model visual attent phase candid landmark match track landmark learn phase posit estim obtain comput attribut match candid landmark final posit estim comput merg individu estim observ candid visual landmark order extract potenti landmark emploi statist measur local imag content good candid includ salienc measur edg densiti local output match filter formul landmark detector filter extract local maxima map imag landmark candid repres region imag ordinari concept emploi dudek explor environ figur show result obtain run landmark detector imag obtain lab landmark origin intens comput densiti function detail landmark detect algorithm provid figur detect landmark imag track landmark repres basic featur emploi pose accomplish comput attribut landmark function camera posit order achiev stabil landmark establish track landmark set pose techniqu landmark track oper train imag landmark candid match select set landmark prototyp prototyp instanc observ landmark candid set landmark candid observ match includ prototyp constitut track landmark task landmark achiev princip compon analysi repres landmark subspac encod intens distribut neighbourhood candid subspac comput intens distribut set prototyp match detail track algorithm found track landmark deriv attribut constitut essenti model primit subsequ correspond posit estim figur show typic track landmark poster door figur thumbnail imag correspond landmark detect imag grid posit pose space grid posit thumbnail imag posit pose space landmark candid found match prototyp figur typic landmark set landmark goal learn set landmark order estim unknown paramet pose camera futur observ landmark assum moment explor phase yield track landmark constitut set observ pose set attribut comput imag neighbourhood landmark exampl attribut intens edg distribut imag neighbourhood posit landmark imag observ pose comput attribut function pose robot note observ simpli make observ pose sequel drop subscript reader awar rang attribut comput singl gener function attribut comput observ problem gener pose estim invert pose lead comput invert gener problem assum method comput pose estim function exploratori observ comput appli observ order gener approxim pose estim previou present method comput linear squar reconstruct space span train observ reader refer work detail altern emploi bilinear interpol neural network landmark util interest evalu measur util attribut comput pose estim achiev cross valid cross valid oper train observ pose input function comput modifi track landmark measur error defin util covari distribut observ repres averag systemat error inher repres distribut error benefit comput comput pose estim observ correct systemat associ result order repres uncertainti estim note comput sole attribut quantiti term intend reflect approxim necessarili strict linear algebra comput train phase note assum error gaussian case measur qualiti train data improv perform process estim pose pose train comput measur reliabl rq set track landmark observ pose set comput determin covari obtain attribut larger valu lead reliabl pose estim figur plot function pose scene depict figur orient camera fix face neg direct robot move pose space note reliabl small valu due fact imag region pose space chang dramat small lead track landmark figur train reliabl function pose camera face neg direct pose estim pose estim involv extract match learn landmark gener pose estim comput attribut match equat final step combin estim landmark attribut obtain final pose estim order combin emploi approach smith cheeseman combin estim error model emploi error model prior outlier detect perform find median posit estim xm comput median cm set estim covari coe cm defin ellipsoid region pose scale control centr xm predict consid accept figur depict set posit estim set median estim estim consid accept solid figur set filter predict demonstr util method result techniqu test varieti environ obtain result result tabul tabl pose camera constrain singl orient imag scene collect demonstr method recov orient method train singl orient figur scene ii scene ii iii train sampl test sampl track landmark sampl space error std deviat accuraci tabl result scene constrain environ posit camera mount robot measur high accuraci scene simpl construct set imag cm interv pose space scene ii emploi robot slightli complic imag collect interv pose space scene iii emploi camera mount mobil robot ground truth pose robot measur accuraci scene depict figur train imag collect interv pose space result scene produc tabl column record number train number test input sampl pose number track space nearest sampl train error standard deviat error set test input line express qualiti result term percentag figur present set estim obtain test imag obtain scene plot repres estim gener imag recal pose estim gener prior knowledg robot posit accuraci highli satisfi evalu attribut tabl summar qualiti attribut emploi pose estim scene track imag intens distribut edg distribut landmark gener separ coordin cm coordin cm pose estim ground truth figur set pose estim obtain laboratori environ shown figur attribut scene ii iii imag posit intens distribut edg distribut tabl priori attribut uncertainti priori util tabul determin util covari track landmark smaller reliabl attribut interest note geometr posit landmark imag reliabl indic posit trend violat scene motion camera small quantiz error pose estim procedur note edg distribut fare poorli due highli nonlinear variat edg distribut function camera pose paper present method learn set landmark set view environ order obtain accur pose estim candid landmark detect local maxima measur distinct landmark candid group track landmark set candid correspond visual region observ viewpoint function comput gener pose estim futur observ match track landmark util measur order determin qualiti train data expect confid subsequ pose estim onlin posit estim perform detect candid match track landmark match gener pose estim set estim combin robust statist result method perform varieti environ refer eric gregori dudek autom map ieee confer comput vision pattern percept mobil page june thrun algorithm mobil robot local ieee confer comput vision pattern recognit ft june ieee press sk sa track visual ieee intern confer robot page san starner modular eigenspac face recognit proc ieee confer comput vision pattern page june ieee press poggio girosi network approxim learn ieee neural network theori volum page crowlei continu properti manifold mobil robot posit estim ieee workshop percept mobil ft june ieee press shi good featur track proc ieee intern conf comput vision pattern recognit ieee sim dudek learn featur pose estim ieee workshop percept mobil ft june ieee press sim dudek learn visual landmark pose estim ieee intern confer robot ieee press randal smith peter cheeseman estim spatial intern journal robot kt sutherland wb thompson inexact navig page matthew turk alex pentland face model recognit mobil robot nov grace converg rate thin plate smooth spline data noisi smooth techniqu curv page
Agents/852 1 provid environ softwar agent execut similar build oper system execut gener applic fashion oper system set servic execut user agent framework similar set servic execut agent action servic includ abil commun maintain current state execut select execut path set execut path focu paper studi soft agent schedul context framework execut intellig softwar agent develop test compar perform agent activ agent architectur decaf environ center agent softwar toolkit rapid execut agent achiev solut complex softwar system unlik tradit oper abil reason action execut action perform featur decaf abil reason deadlin commit support idea real time execut task achiev concept execut pro le agent execut lead optim optim schedul agent execut present paper discuss agent architectur di er oper essenti detail agent execut formal model paramet schedul agent architectur enhanc provid servic agent request intellig agent softwar system materi base work support nation scienc foundat grant copyright american associ arti cial intellig reserv schedul distribut agent john graham depart comput inform scienc keith thesi advisor delawar de introduct tradit os life cycl process govern basic process le order manag lifetim process pass state turn oper system base local readi process alloc processor time select criteria job start agent architectur view oper system manag activ agent life cycl essenti di erenc agent architectur gener oper system list tabl figur graphic depict agent action life cycl agent task templat exact tradit os templat repres job instanti agent plan plan fragment list task descript relationship task action descript execut pro le task action request execut task templat list examin make request job program framework instanti task list action execut list action wait enabl rst list correspond readi queue similar sleep queue tradit os action execut complet case thread data structur task destroi sleep await case thread move queue action wait messag receiv extra level sophist agent framework abil reason job run order run tradit oper system agent architectur handl job type input job agent task request input messag action job complet action complet job execut pro le execut pro le execut action network commun explicitli program singl nite number process resourc number type job startup agent activ assum network orient support network built oper java virtual machin unlimit number virtual cpu parallel execut complet list action initi plan le start time tabl compar tradit oper system agent architectur reason abil action pro le program agent framework abil complet set job deadlin rearrang task solut event failur framework distinguish tradit section describ detail execut includ note java virtual machin underli oper decaf execut action parallel explicit instruct programm java jvm provid parallel activ multipl processor jvm repres essenti monolith kernel impli hard deadlin experi conduct hope place time jvm de ne bound soft environ abil rapidli prototyp agent system decaf test develop approxim demonstr agent system past year decaf attempt captur rang process interrelationship occur intens ai environ capabl repres complet task reduct tree nau similar retsina sycara annot drawn ms task structur descript languag lesser lesser leav tree repres basic agent action primit main thrust current research soft realtim compon framework work leverag work start schedul massachusett lesser remaind paper organ introduct descript decaf descript agent execut decaf determin schedul lastli actual result develop decaf decaf architectur implement decaf decker environ center agent agent architectur multi agent system decaf architectur toolkit user program agent decaf build oper environ intern agent schedul monitor fashion similar oper system primit decaf framework demonstr test ectiv algorithm decaf architectur servic intellig agent sycara sycara al execut eventu learn al figur repres high level structur decaf architectur structur insid heavi black line intern architectur item line provid sourc incom kqml shown figur ve intern execut modul current data structur queue agent initi execut modul control ow task life time modul run continu concurr java thread agent agent initi modul run agent initi modul read plan le task reduct speci ed plan le action wait enabl pend action incom kqml messag agent action lifecycl ad task templat hash tabl tree structur action accomplish goal dispatch agent initi control pass dispatch wait incom kqml messag incom messag queue incom messag kqml perform inform incom messag result action dispatch messag attempt commun part ongo dispatch make distinct recogn kqml eld messag part exist case dispatch action pend action queue set task continu agent action messag part case messag eld object creat bdi georg object queue planner agent typic activ achiev thing dispatch handl error messag incom messag improperli format intern modul send error messag dispatch format send messag action execut figur decaf agent action life cycl agent task templat incom plan file agent task complet thread destroi planner planner monitor object queue match goal exist task templat store plan librari copi instanti form htn goal task queue uniqu identi er provis pass agent incom messag subsequ messag request goal instanti plan templat task network uniqu identi er task queue moment instanti structur action complet incom request schedul schedul wait task queue schedul determin action execut execut order determin base provis modul provis incom messag provis result action complet mean task queue structur check time provis action execut executor executor set oper agenda queue action queue executor immedi place task execut execut thing occur action plan file incom kqml messag incom messag queue agent initi task templat pend hashtabl action queue domain fact belief object queue complet complet return error result action result queue framework wait result distribut result downstream action task queue accomplish executor examin agenda queue work possibl action block wait agent commun complet occur action send messag agent requir remaind task complet result kqml messag return task complet pend action queue action queue kei eld outgo kqml messag incom messag dispatch check eld exist dispatch check pend action queue messag action return agenda queue complet action exist pend action error messag return sender schedul decaf previou agent architectur made realtim ai perform guardian al task queue outgo kqml messag decaf task control structur agenda queue dispatch planner schedul executor figur decaf architectur overview action result queue action modul medic monitor applic built blackboard architectur guardian featur achiev desir system perform anytim algorithm dynam applic maintain knowledg base phoenix project cohen design autonom system contribut reactiv compon delib agent system arti al task model base activ event user examin task appli knowledg problem prototyp built prototyp analyz feasibl develop schedul algorithm decaf distinguish work fashion tradit oper system lesser leverag build decaf model idea analyz schedul static evalu outcom term user de ned util function result measur schedul schedul chosen execut approach decaf distinguish basic method analysi schedul path dynam line emphasi speed event ofth failur action execut goal make repair schedul recalcul scratch set criteria lesser reduc assist speedup action proce method path emploi determin rework redon execut path execut parallel reduc possibl failur decaf design modular fashion schedul algorithm test rest environ constant interfac schedul modul de ned test develop set benchmark agent activ compar method analysi compar algorithm discuss develop agent schedul algorithm tradit oper job run complet prerequisit long prior knowledg commun resourc share present inform requir complet job result simplist schedul algorithm case set multilevel feedback queue queue case simpli solari schedul constraint de nition solari de ned access cpu bound period request made bound long job action short de ned job extern request resourc limit de nition met spring oper system ramamritham set time slice execut program predict behavior agent action except rule give result time search result vari base input result action chain achiev nal iter chain requir achiev measur qualiti ultim result number iter limit time turn put limit alloc piec chain di culti predict expect perform algorithm solv ai worst case perform algorithm cost schedul requir task limit complex requir achiev result solv problem context agent de ned agent statist achiev requir qualiti result requir time made task lesser notion refer compar context solari os agent develop solut task act featur make agent solut attract fact solut hard code failur select path result failur solut make agent solut robust time make schedul execut agent action di cult solut involv separ action multipl di erent execut path achiev task result problem schedul task potenti reschedul face intract decaf schedul appli heurist problem obtain schedul solut result schedul optim obtain optim solut problem intent develop solut sati es user criteria regard limit set characterist appli agent action direct embodi compon architectur decaf agent program commit architectur user de ned schedul criteria program state involv develop hierarch task network task action task action list user criteria de ne schedul behavior pro le action task action relationship deadlin characterist accumul function util function section discuss item provid formal model agent perform decaf behavior pro le agent action pro le attach behavior pro le view vector characterist cn characterist relat perform action result produc action actual outcom action fail qualiti perform action achiev result high term user expect mathemat set characterist consid size heurist appli solut limit vector durat context cost durat expect accumul function easili calcul qualiti item mean user context qualiti action low price airlin ticket extrem low agent respond price ibm stock good qualiti perform mean consid context pool action schedul determin optim focu valu characterist agent action qualiti durat result distinguish reason nding optim execut agent reason reason good perform versu bad relationship deadlin perform action ect subsequ term schedul problem depend relationship action import action ai complet action aj time complet sequenc action sum time complet ai aj relat run parallel minimum time run time longest action relationship explicitli program develop decaf plan editor approach di er ms type relationship de idea ms notion essenti action ai run action potenti qualiti result occur relationship reason decaf order reduc comput complex characterist accumul function task characterist accumul function inform schedul perform metric subtask gather function user sum mean subtask perform make hand subtask su cient make determin indic assum su cient extern run subtask parallel rst nish result approach leverag schedul work lesser fact initi benchmark comparison schedul develop previou work lesser good solut depend client complex object di erent client object quanti cation object schedul react dynam event exact calculu semant oper schedul event failur node schedul recomput schedul activ interleav plan execut modul util function simpli agent accomplish goal goal taxi ride point point nite number wai accomplish goal user desir make ride short cheap relax descript util agent norvig task util function assign user idea action make task valu perform characterist action xed user measur vari cost ticket price web site price web site actual price ticket found greater qualiti result lower util function task retriev ticket price site minimum cost nding ticket mean result produc action schedul complex util function cost relev qualiti import agent possess util function make ration util di erent action criteria select schedul set action current activ research decaf architectur design aspect agent develop singl examin project featur work relat agent schedul schedul design criteria major research project decaf underwai develop evalu schedul compon schedul compon agent deadlin commit achiev soft perform de ned earlier faster heurist achiev result set agent sequenc fast plan evalu determin result approach issu repres improv recent work dynam evalu plan combin delib reactiv activ extens parallel execut reactiv compon respond failur strictli time fashion evalu success schedul algorithm schedul modul insert decaf framework simpl algorithm modi ed run algorithm develop algorithm preliminari acronym evalu plan select solut begin execut solut select analysi reason rst estim plan idea select run quickli compar analysi give faster recoveri event failur altern plan execut analysi fcf implement version implement expect result schedul produc higher qualiti fcf faster implement resourc schedul algorithm algorithm similar agent action schedul anticip produc similar qualiti time recov agent node failur robust fashion final result complet preliminari result base qualiti schedul time determin schedul start select schedul baselin data report qualiti pick time analysi evalu plan schedul determin set schedul execut plan millisecond decaf architectur perform entir framework make heavi java thread execut modul separ thread framework start task run executor run sequenti research determin task run executor separ thread hand prevent undu delai task wait run task thread run immedi control immedi return executor select task neg aspect design data synchron easili solv complic program interfac signi cantli solut agent programm action capabl independ activ set ag perform pro le drawback accomplish thread synchron lack synchron primit java languag java monitor sole mean synchron decaf framework includ intern binari count condit variabl lock basi languag enhanc technic report detail perform decaf architectur summar part thread execut modul decaf agent action execut separ thread jvm singl processor thread version decaf ran faster version ect multipl processor actual perform bene cpu depend greatli actual plan comput involv comput expect greatest bene compar intens result show case improv test cpu schedul evalu execut plan time evalu run plan due cienci architectur shown accur time run ten schedul time evalu run schedul determin decaf current ma develop architectur evalu decaf present gener agent architectur unix present gener oper system decaf class ma develop agent system valid decaf agent develop platform proven year complet project develop decaf inform extract agent front end gener access easili adapt speci extract inform virtual food court ma model interact requir supplier oper resourc manag agent capabl request resourc agent commun work featur set routin resourc manag develop deadlock detect agent agent provid servic agent commun middl agent williamson maker broker develop decaf summari shown fundament outlin agent architectur base oper system principl incorpor concept soft architectur develop work ma model research platform develop algorithm detail algorithm put place measur ectiv work shown refer design unix oper system quantit model complex comput task environ eleventh nation confer cial intellig adapt inform agent journal intellig inform system internet fifteenth intern joint confer cial semant hierarch task network plan cs technic report maryland analyz schedul hard arti cial intellig system engin applic arti cial intellig survei research delib arti cial intellig journal system agent framework intellig agent vi sixth intern workshop agent languag lectur note arti cial intellig berlin volum concurr java program oxford press prototyp monitor agent arti cial intellig diagnosi integr part multiag adapt tech report umass address constraint design autonom agent journal system commit foundat coordin system knowledg engin review georg bdi theori practic intern confer san aaai press arti cial approach saddl prentic hall spring kernel support ai applic cs technic report univ massachusett distribut intellig agent ieee expert complex goal criteria applic schedul fourteenth nation confer cial intellig direct task schedul intern journal approxim special issu schedul version umass cs execut plan environ aaai fall symposium plan execut aaai report
Agents/853 1 constraint agent leo boe space group helicopt advanc comput technolog po box ms pa abstract part darpa rapid design explor optim involv concurr design engin research project call seek partial autom integr product team concept boe organ design engin aid intellig agent technolog earli stage project expect crucial emploi system design manag agent develop toronto depart conjunct boe toronto ontolog virtual domain theori design engin depend underli phrase assert axiomat system run constraint logic system primari knowledg resourc monitor ongo design offer suggest interact agent underli domain model agent architectur emploi primit constraint notion facilit design engin process constraint evalu agent goal commit execut task paper describ expect interact constraint agent ongo research introduct part darpa rapid design explor optim involv concurr design engin research project call al al seek partial autom integr product team concept boe organ design engin aid intellig agent oper blackboard environ corkil core architectur center task environ simul intellig agent framework nagendra wagner decker sycara decker sycara project earli stage framework expect emploi system design manag agent develop toronto depart conjunct boe al toronto ontolog virtual ontolog fox domain theori design engin depend underli phrase assert fike gruber gruber gruber olsen axiomat system run constraint logic system primari knowledg resourc monitor ongo design offer suggest interact agent human underli domain model agent architectur emploi primit constraint notion facilit design engin process constraint evalu agent goal commit execut task agent constraint current model individu agent displai figur view agent consid intellig agent commun agent version kqml al local execut task task effect agent affect agent diverg taem system intend environ agent interact human softwar system task structur view hierarchi subtask reduc eventu instanti agent base intern notion goal satisfi similar unifi concept agent sadri note correl deduct techniqu investig appli proof procedur agent control cycl goal reduct rule integr taem model agent receiv kqml request agent achiev goal interact displai top figur depict request agent interact event evolv implement agent environ request content form constraint possibl assert relat phrase fike languag agent msg kei flow agent intern view agent commun languag messag kif stress local belief knowledg base plan librari local planner local schedul local executor task schedul local commun blackboard event event kif stress local control agent agent goal constraint flow figur agent intern view receiv agent determin possibl satisfi goal possess task structur subtask order action consult rule base map intern knowledg commit determin satisfi goal request agent commit continu plan task reduct instanti process respect domain constraint content slot origin request figur constraint flow repres dot line evalu domain constraint plan delai evalu perform constraint schedul execut phase project unsur constitut delin domain constraint altern task structur perform type stress analysi design aircraft wing constraint tradeoff formul term granular analysi time requir perform analysi gross analysi time finer analysi agent make earli plan delai schedul perform constraint evalu plan agent local schedul cooper schedul modul awar agent execut task structur satisfi interact agent process effect constraint evalu schedul execut time mention constraint gener perform constraint concern notion applic time qualiti vector metric task part interact agent coordin softwar hardwar applic facilit design analysi activ design engin process includ cad geometr parametr data analysi legaci applic perform evalu optim factor produc initi model type schedul emploi close correl taem architectur lesser garvei link embodi risk assessor embodi bayesian network inspect agent rule task structur addit commun directli offer advic plan schedul process kind agent interact involv interact agent environ global notion ongo design coordin inspect intern data structur evolv design network kind interact facilit human agent collabor figur displai pictur agent interact process user user coordin assist agent repres user interfac respect ongo design project user model global upper leftmost knowledg store figur access agent initi perform task anticip eventu dedic agent repres function stress analysi organiz entiti displai special agent interven individu thread agent agent special inform agent maintain project evolv design intern connect node inform applic constraint hold correl tempor point design evolut partli repres design altern aspect interact agent constraint cost model al drive design analysi weight preliminari detail design model partial map compon constraint local belief knowledg base librari local planner local schedul local executor task schedul local commun local control local belief knowledg base librari local planner local schedul local executor task schedul local commun local control local belief knowledg base plan librari local planner local schedul local executor task schedul local commun local control local belief knowledg base plan librari local planner local schedul local executor task schedul local commun local control agent joe user login organ ontolog project team role user user model joe user design agent local belief knowledg base plan librari local planner local schedul local executor task schedul local commun local control thread engin local belief knowledg base plan librari local planner local schedul local executor task schedul local commun local control stress agent design engin process ontolog local belief knowledg base plan librari local planner local schedul local executor task schedul local commun local control thread local belief knowledg base plan librari local planner local schedul local executor task schedul local commun local control design agent local belief knowledg base plan librari local planner local schedul local executor task schedul local commun local control agent extern view inform agent local belief knowledg base librari local planner local schedul local executor task schedul local commun local control execut local belief knowledg base plan librari local planner local schedul local executor task schedul local commun local control system manag agent strategi figur agent extern view research project evolv period expect wit chang prospect project content paper remain specul hedg anticip work expect addit crucial contribut subcontractor primari enabl agent facilit collabor design process hope fill larger intellig collabor work design project repres network constrain design altern acknowledg work support cooper agreement darpa major fund darpa nist particip act remain fund suppli boe refer asa integr design environ submit asm design manufactur symposium product data manag futur integr depart mechan industri januari design integr depart mechan industri toronto technic kumar deduct logic program england keith environ center analysi design coordin mechan phd dept comput massachusett nagendra architectur multiag cooper inform gather intern confer inform knowledg manag workshop intellig inform md katia design reusabl behavior inform agent robot specif kqml agent commun languag june darpa knowledg initi extern interfac work group alan victor schedul iee transact man michael richard knowledg interchang format version refer manual logic dept comput scienc stanford tom translat approach portabl ontolog specif knowledg pp tom principl design ontolog knowledg share ed formal ontolog conceptu analysi knowledg gregori ontolog engin mathemat jon erik ed fourth intern confer principl knowledg morgan kaufman stanford knowledg system laboratori technic report methodolog design evalu ontolog depart industri toronto unifi agent architectur combin ration reactiv depart imperi june scott daniel design integr engin integr design analysi tool concurr research special issu applic multiag system concurr mark requir ontolog engin design integr depart mechan industri cost optim softwar transport aircraft design evalu nasa contractor report user manual keith integr product team submit asm design engin comput engin engin inform manag symposium victor satisf evalu heart paradigm umass depart comput scienc technic report katia unifi inform control flow hierarch task network technic robot
DB/854 3 scalabl algorithm tempor aggreg moon fernando vega lopez dept comput scienc tandem comput arizona az ca technic report abstract abil model natur essenti applic data wareh mine tempor aspect provid uniqu characterist challeng queri process optim challeng comput tempor complic comput tempor group introduc varieti tempor aggreg algorithm overcom major drawback previou work process time improv significantli algorithm deal substanti larger size memori parallel algorithm design architectur achiev scalabl perform deliv linear contribut made paper import rate size time requir advanc processor mass storag technolog novemb depart comput scienc arizona az work sponsor part nation scienc foundat research infrastructur program author assum content paper salari dept begin end richard account karen ship nathan market nathan account count max begin end input tupl tempor aggreg result figur sampl tempor aggreg introduct aggreg function comput scalar maximum appli set tupl function essenti compon queri heavili applic promin queri benchmark ap high percentag aggreg oper effici execut aggreg function import goal applic captur natur model import recogn research tempor model queri languag develop report literatur tempor queri languag support tempor aggreg tempor data queri provid uniqu characterist challeng queri process optim challeng comput tempor complic comput tempor group tempor tempor group process partit time tupl group partit aggreg valu comput group tempor group type partit span group instant group span group base defin length week independ tempor attribut valu tupl instant group depend data store pair consecut instant creat time aggreg remain constant interv call constant interv aggreg base span instant group call span aggreg instant focu comput instant common challeng tempor aggreg comput instant aggreg tupl overlap simpli tupl order relat suffici due vari interv length comput maximum salari involv comput tempor extent maximum requir determin tupl overlap tempor instant figur show sampl tabl tempor repres begin end individu tupl result instant aggreg maximum salari number tabl figur note multipl valu aggreg result singl scalar point period aggreg remain constant collect singl tupl instant aggreg evalu maximum salari depart tempor aggreg process sequenti parallel fashion parallel process technolog size applic grow evidenc olap data wareh environ sequenti parallel algorithm develop comput tempor aggreg suffer limit size aggreg restrict memori requir priori knowledg input varieti tempor aggreg algorithm overcom major drawback previou work solut provid benefit state ffl algorithm aggreg requir priori knowledg input improv process time significantli ffl algorithm aggreg reli data partit deal substanti larger size memori ffl parallel algorithm develop architectur aggreg solut achiev scalabl perform deliv linear note problem comput tempor aggreg relat aggreg data wareh environ data item data wareh environ point data deal tempor data time interv arbitrari length rest paper organ section survei background relat work comput tempor aggreg major limit previou work discuss section section present improv algorithm scalabl solut aggreg base data partit parallel process techniqu section present result evalu sequenti parallel solut section summar contribut paper outlook futur work background previou work type aggreg comput convent relat scalar aggreg aggreg function scalar aggreg oper min produc singl entir aggreg function partit relat base attribut comput scalar aggreg independ individu partit scalar aggreg aggreg express option qualif simpl algorithm epstein evalu scalar aggreg handl scalar aggreg algorithm comput separ store result singleton refer singleton relat evalu rest queri approach emploi program transform method systemat gener effici iter program aggreg queri approach implement tempor aggreg base extens epstein algorithm constant interv determin aggreg evalu epstein techniqu step separ complet read recent algorithm kline snodgrass tempor aggreg base instant group tupl algorithm call aggreg tree variant aggreg build tree scan algorithm fast requir minim scan build tree memori result tree store inform comput tempor aggreg depth search aggreg tree binari tree track tupl timestamp period time span node tree start end time aggreg aggreg tree begin singl node initi tree figur assum earliest latest timestamp sampl tabl figur tupl insert empti aggreg tree insert record add node initi result updat aggreg tree shown figur count assign leaf node tree repres valid interv insert tupl aggreg tree insert rest record figur shown figur comput number tupl count period count leaf node ad parent count valu start sum parent count ad leaf total tempor aggreg result tabl oo initi tree tree ad final tree ad oo oo oo oo oo oo tree ad oo oo figur sampl aggreg tree count aggreg limit previou method note order tupl insert aggreg tree affect result tupl sort start time insert aggreg tree link insert slower insert balanc binari tree worst case time creat aggreg tree tupl sort time limit aggreg tree approach entir tree memori size aggreg tree proport number distinct timestamp start time end size aggreg tree algorithm deal limit size memori number distinct timestamp tupl circumv variant aggreg call aggreg author aggreg tree advantag tupl enabl garbag collect tree memori requir reduc significantli aggreg tree approach assum tupl tabl order tupl posit posit total order version tabl requir difficult met real system priori knowledg requir extern sort tabl worst case run time aggreg tree algorithm appar aggreg effici suffer poor due run time memori requir research effort develop parallel algorithm comput tempor aggreg ye kean approach parallel aggreg tree algorithm architectur al develop parallel algorithm comput tempor specif parallel tree algorithm al show perform parallel algorithm extens empir studi condit parallel algorithm inherit limit aggreg tree parallel algorithm develop parallel aggreg tree size parallel algorithm handl limit aggreg memori particip processor improv algorithm aggreg present algorithm comput tempor altern aggreg tree algorithm aggreg tree binari similar segment tree bentlei segment tree static balanc set aggreg tree aggreg tree dynam construct tupl scan insert tree structur result aggreg tree depend order tupl insert fact worst case run time tupl order timestamp valu quadrat complex impract costli applic observ common aggreg oper categor avg min demand track attribut valu tupl observ led develop algorithm group aggreg oper solut group call balanc tree present section main idea algorithm tree balanc dynam tupl give notion maintain interv tree node solut group call aggreg similar classic algorithm algorithm present section assum memori larg store entir data structur requir aggreg algorithm rest count max repres group balanc tree algorithm count aggreg simpl approach base timestamp sort provid effici solut count aggreg approach start load entir tupl memori timestamp valu extract timestamp timestamp start time end time tupl timestamp tag sort order timestamp valu figur sort list timestamp tag sampl figur count aggreg comput scan sort timestamp tag order start counter initi counter increment start tag decrement end tag encount tag counter increment number start tag decrement number end tag figur timestamp counter increment start tag timestamp worst case process time approach log number tupl input real world tempor case tupl share timestamp valu start time end time approach requir amount memori process time repeat timestamp valu balanc tree algorithm optim perform repeat timestamp valu motiv balanc tree algorithm sort list timestamp built load entir memori timestamp sort increment insert balanc tupl input scan node balanc tree store start time end store tag node store store number tupl start figur count aggreg sort timestamp tag figur balanc tree construct timestamp store number tupl end timestamp color tag store insert algorithm tree balanc dynam figur show process build balanc tree sampl tabl figur show timestamp relev tempor aggreg comput start time record insert empti node creat set result tree singl node shown figur figur illustr snapshot tree tree balanc insert algorithm elabor insert focu paper balanc tree algorithm proce creat tree tree tupl read input balanc tree probe start end time tupl tree start timestamp found node creat insert tree start time end counter node timestamp increment insert node balanc tree algorithm comput aggreg valu perform tree tree node count aggreg increment node decrement node balanc tree algorithm summar figur elimin redund timestamp valu balanc tree algorithm reduc memori requir tree time substanti small percentag uniqu timestamp balanc tree store inform tempor group aggreg intern node leaf node balanc tree algorithm half node requir aggreg tree store constant interv leaf node sum node store store attribut sum tupl start timestamp store attribut sum tupl end timestamp algorithm balanc tree set empti balanc tupl tabl begin time node insert node ts endif time node insert node ts tend endif end set count node begin count output nt count end end algorithm figur balanc tree algorithm count aggreg algorithm max aggreg balanc tree algorithm simpl effici count max aggreg balanc tree store uniqu timestamp counter count track tupl aliv time instant inform tree figur root node show exist tupl start time tree convei inform life span tupl exact end time specif unlik count imposs comput max aggreg exact life span tupl modifi balanc tree algorithm comput max repeat timestamp valu tree addit data structur dual heap tree dual heap store attribut valu max aggreg live tupl dead separ max aggreg comput compar maximum valu heap pop match maximum valu heap dual heap track life span tupl requir comput max aggreg lose benefit balanc tree tree node tupl reduct memori requir due repeat addit overhead process heap aggreg call aggreg algorithm classic algorithm base aggreg algorithm comput larger aggreg result merg smaller aggreg result algorithm start merg tupl pair bottom termin final aggreg result obtain top intermedi aggreg defin ft fm integ set uniqu timestamp order set attribut maximum attribut time interv exist live tupl nil empti interv consecut valu equal tupl input consid figur illustr process merg tupl sampl tabl figur input record nil merg step merg step figur merg max aggreg sampl tupl line segment figur tupl tabl merg intermedi result tupl merg intermedi result result step shown figur intermedi result merg final aggreg result shown figur input tupl aggreg algorithm gener intermedi aggreg memori algorithm merg intermedi result final aggreg result obtain worst case process time algorithm log shown figur size intermedi result smaller tupl cover consecut interv merg singl interv share aggreg maximum amount addit memori requir intermedi result smaller size input count balanc tree remain algorithm choic balanc tree algorithm memori requir number tree minimum build balanc tree increment remov repeat minim process time bucket algorithm aggreg addit algorithm aggreg previou major compon work paper develop techniqu comput tempor aggreg constraint limit buffer space size deal limit size memori crucial tempor aggreg requir constant number due potenti huge amount tempor data prohibit costli number requir scan limit proport size accept solut method requir small constant number scan algorithm base partit tupl import oper relat hash join algorithm idea hash join algorithm hash join relat join hash function assur tupl relat bucket join tupl relat bucket relat join oper perform read relat provid memori tupl relat bucket memori assum uniform distribut shown hash bucket bucket bucket bucket bucket ft bucket ft bucket ft bucket ft figur partit assign tupl bucket join algorithm requir scan number buffer page larger squar root number disk page smaller relat idea data partit relat hash join appli directli tempor aggreg tupl time interv readili partit tempor disjoint class hash time interv tupl length tupl overlap interv tupl check tupl overlap bucket tempor aggreg comput read bucket constant number time circumv assign data object multipl bucket replic approach figur tempor partit nb disjoint nb number bucket tupl life span interv tupl assign bucket figur tupl assign bucket life span properli bucket tupl life span overlap interv tupl life span split piec piec assign bucket turn split tupl impact result figur life span tupl overlap tupl assign bucket bucket bucket process entail replic tupl lead duplic tupl minim duplic assign tupl sole bucket tupl start end timestamp lie life span tupl overlap bucket nb tupl replic bucket intermedi bucket store tupl meta arrai aggreg inform tupl ts life span overlap intermedi bucket size meta arrai equal number bucket element meta arrai store aggreg bucket figur time interv tupl span bucket split segment adjust time interv segment properli interv bucket line figur repres adjust time interv split assign bucket element meta arrai increment similar assign bucket element meta arrai increment result data partit meta arrai illustr figur note element meta arrai store valid aggreg tupl life span longer entir tupl scan partit bucket meta arrai tempor aggreg oper perform bucket independ figur show partial result aggreg perform bucket aggreg store meta arrai bucket bucket bucket bucket bucket ft bucket ft bucket ft bucket ft meta arrai count aggreg figur meta arrai reduc data replic aggreg bucket bucket combin meta arrai figur step aggreg base data partit meta arrai aggreg result bucket simpli ad count count final aggreg result obtain merg pair adjac bucket boundari adjac aggreg valu equal figur show final aggreg result dot vertic bar figur repres merg bucket boundari figur outlin tempor aggreg algorithm base data partit algorithm assum entir tabl partit nb disjoint interv equal bucket note aggreg algorithm previou section aggreg individu bucket provid meta arrai small fit memori suffici memori hold tupl tempor aggreg oper perform read bucket approach requir access read comput tempor aggreg data replic tupl overlap multipl access requir approach extent depend algorithm tempor bucket set ib time interv bucket max tupl tabl begin set start bucket time set end bucket time insert bucket start bucket bucket end insert bucket end bucket end updat meta end nb begin perform tempor aggreg bucket combin scalar meta bucket merg bucket boundari end end algorithm figur bucket algorithm base tempor data partit factor life span tupl number bucket worst size tabl origin size replic tupl tabl bucket access requir approach bound small constant number scan show perform impact data replic section parallel bucket algorithm parallel process applic typic involv partit alloc partit set processor processor perform oper partit data achiev queri process time architectur parallel architectur made attract choic applic due high potenti scalabl scalabl capabl deliv perform proport number particip processor processor local memori secondari storag commun messag pass initi data placement central distribut multipl processor parallel data redistribut processor particip oper assum result aggreg remain local storag unit particip processor collect result special coordin processor result aggreg intermedi data phase parallel queri process point section previou attempt develop scalabl method comput tempor aggreg base parallel aggreg tree algorithm approach inherit limit aggreg tree algorithm approach suffer run time tight limit size deal parallel tempor aggreg algorithm base bucket algorithm present previou section straightforward parallel bucket algorithm distribut bucket particip processor tempor partit disjoint number processor processor partit nb disjoint interv distribut bucket comput correct aggreg construct meta arrai process parallel effici processor processor processor processor bucket ft bucket fg bucket ft tupl ft tupl ft tupl ft local meta arrai count aggreg global meta arrai count aggreg figur data distribut meta arrai local data local meta arrai global meta arrai processor tupl life span overlap multipl local bucket multipl life span tupl overlap bucket processor bucket processor tupl replic bp bp local meta arrai aggreg inform tupl ts life span overlap intermedi bucket bp nb local meta arrai bp bp global meta arrai updat processor tupl inform intermedi processor exist tupl overlap size global meta arrai equal number processor element global meta arrai store aggreg processor local meta arrai ident sequenti bucket algorithm processor comput global local meta arrai independ figur tupl initi store processor processor particip count aggreg time interv span remot processor split segment processor element global meta arrai increment similar assign local bucket processor element global meta arrai increment figur show result data distribut local data ship local global meta arrai note tupl processor shown figur parallel aggreg algorithm summar figur algorithm assum entir tabl partit nb disjoint interv equal bucket distribut processor rang partit processor assign nb consecut bucket rang partit scheme minim size global meta arrai arrai element requir processor processor comput global meta arrai independ local processor commun comput final global meta arrai entir respect oper op oper op determin kind aggreg oper op addit oper count aggreg maximum oper max aggreg collect commun comput final global meta arrai implement effici parallel comput network workstat overhead combin global meta arrai expect neglig volum commun word processor algorithm parallel tempor bucket set number particip set ib time interv bucket max set proc local processor id proc tupl local partit remot processor begin set start proc time set end proc time proc send processor start proc proc send processor end proc end updat global meta insert local bucket algorithm updat local meta arrai algorithm end global combin global meta arrai wrt aggreg oper nb begin local meta meta global meta perform tempor aggreg bucket local meta algorithm end end algorithm figur parallel bucket algorithm base tempor data partit empir evalu evalu algorithm empir compar previou work chose count tempor aggreg carri experi oper condit affect perform algorithm focu perform gain algorithm scalabl sequenti parallel bucket algorithm set test benchmark perform cluster intel pentium workstat mhz clock rate workstat mbyte memori gbyte disk storag scsi run linux kernel version workstat connect mbp switch ethernet network switch handl aggreg bandwidth type commun messag pass pentium lam implement mpi commun standard lam messag pass packag pentium observ averag commun latenc microsecond averag transfer rate note high latenc low transfer rate compar parallel comput equip high perform switch ibm parallel system sequenti parallel buffer size kbyte disk io messag pass messag pass primit attempt minim commun overhead commun overlap local comput disk io measur time includ disk access time commun overhead accur averag time multipl run elimin extrem case avoid system cach effect disk access load scalabl perform carri experi workstat repair time studi system proprietari mpi implement observ averag commun latenc microsecond averag transfer rate irrelev data entir memori consecut run experi gener synthet data million tempor instant consid basic life span life span tupl determin randomli life span tupl determin randomli percent popul tupl fix percent percent start time tupl uniformli distribut tupl byte includ tempor attribut time end attribut synthet gener experi sort tempor attribut state aggreg set experi carri small mbyte mbyte requir data structur fit memori recal algorithm section aggreg tree algorithm variat requir entir data structur memori balanc tree algorithm count aggreg algorithm max aggreg figur compar balanc tree aggreg tree algorithm count figur compar aggreg tree algorithm max aggreg balanc tree aggreg algorithm consist perform faster aggreg tree algorithm count max aggreg tree time aggreg higher percentag process time algorithm remain constant percentag tupl note perform aggreg tree algorithm remain unchang count max algorithm work essenti aggreg figur tupl input sort start expect perform aggreg tree algorithm process time aggreg tree order magnitud slower plot vertic line figur compar aggreg tree algorithm algorithm perform time faster aggreg tree algorithm algorithm outperform aggreg tree aggreg tree consist margin aggreg tree requir priori knowledg algorithm knowledg reduc process time perform algorithm affect percentag figur show process time measur vari percentag tupl bucket algorithm aggreg fact balanc tree aggreg algorithm design group aggreg algorithm show ident perform behavior previou experi rest present result count aggreg set experi carri evalu bucket algorithm section perform aggreg data partit small measur overhead data partit balanc tree algorithm comput count aggreg figur bucket irrespect larg demonstr overhead data partit compar balanc tree algorithm data observ percent process time bucket algorithm addit bucket algorithm outperform aggreg tree algorithm significantli figur figur size byte count aggreg small db time size byte max aggreg small db count aggreg unsort data max aggreg unsort data size byte count aggreg small db time size byte max aggreg small db count aggreg sort data max aggreg sort data percentag long live tupl count aggreg small db vari aggreg tree time percentag long live tupl max aggreg small db vari aggreg tree count aggreg vari max aggreg vari figur aggreg time small amount overhead data partit expect smaller larg bucket remain memori written disk step aggreg individu cach bucket disk copi note perform bucket algorithm affect percentag tupl reason obviou tupl replic lead comput time disk access time notic perform bucket algorithm affect number bucket data partit exist local optimum size byte balanc tree bucket bucket bucket balanc tree time number bucket impact bucket number bucket bucket bucket bucket balanc tree impact number bucket data base size aggreg bucket algorithm bucket bucket bucket algorithm figur aggreg time determin size figur fifteen optim bucket number mbyte mbyte percent conjectur opposit perform effect data partit comput complex balanc tree algorithm higher linear log comput complex reduc data partit cost balanc tree construct reduc log log log nb number tupl nb number bucket bucket data tupl turn cost disk access acknowledg issu address carefulli figur show process time bucket algorithm size mbyte gbyte number bucket data partit mbyte gbyte larg fit memori except mbyte aggreg algorithm experi result shown figur demonstr bucket algorithm comput tempor aggreg substanti larger size memori note process time algorithm grow faster linearli size motiv scalabl solut parallel bucket algorithm section mb gb gb gb gb size byte perform parallel bucket parallel bucket perform partit aggreg mbyte separ measur figur perform parallel aggreg number node perform parallel bucket parallel bucket perform partit aggreg mbyte separ measur figur perform parallel aggreg parallel algorithm aggreg set experi design evalu scalabl parallel bucket algorithm section experi present input distribut particip processor partit attribut partit scheme initi data effect elimin potenti advantag parallel bucket algorithm exploit perform rang partit tempor attribut favor data placement parallel bucket number tupl ship remot processor minim reduc commun overhead perform fix size partit processor million tupl entir grow number processor number processor vari number local bucket fix total number bucket data redistribut number particip processor number local bucket determin previou experi figur base local partit size note sequenti bucket algorithm case figur plot fairli close horizont linear perform respect number processor corrobor fact time spent data partit remain static number processor figur measur case separ process stage number processor data partit time due addit cost messag pass processor time spent aggreg percent due data replic number processor overhead level essenti flat processor linear perform perform fix size entir million tupl determin size partit base number particip processor size local partit singl processor due limit disk space start experi processor number processor chang size local partit mbyte mbyte result perform parallel bucket algorithm shown figur matter observ number processor separ measur figur case larg attribut perform gain local grew faster linearli number processor note number bucket data redistribut number processor conjectur aggreg cost reduc comput smaller aggreg comput larger aggreg futur work develop algorithm comput tempor aggreg algorithm provid benefit current state art wai balanc tree aggreg algorithm improv process time significantli small fit memori develop sequenti parallel bucket algorithm base data partit scheme algorithm comput tempor aggreg substanti larger size process data partit sequenti parallel fashion local global meta arrai partit demonstr parallel bucket algorithm achiev scalabl perform deliv linear observ factor affect perform includ percentag tupl number bucket data partit algorithm outperform previou approach consist irrespect worth elabor issu assum tupl uniformli distribut perform solut exist skew data distribut investig adapt data partit data sampl techniqu handl data skew plan studi perform impact factor initi data placement tempor partit data reduct aggreg plan extend data partit approach requir comput aggreg data object extent unlik tempor expect process data partit gener meta arrai sophist refer van de watt collect commun librari scalabl high perform comput confer page jon loui bentlei algorithm rectangl problem technic report comput scienc carnegi mellon ohio supercomput center parallel comput surajit chaudhuri dayal overview data wareh olap technolog sigmod march thoma charl ronald rivest introduct algorithm mcgraw helen thoma case parallel data wareh olap ninth intern workshop expert system applic page august david randi frank leonard michael david wood implement techniqu main memori system page june robert epstein techniqu process aggreg relat system technic report februari freytag translat aggreg queri iter program vldb page august jose bruce jim richard snodgrass parallel algorithm comput tempor aggreg intern confer data engin technic report tr depart comput scienc christian jensen richard snodgrass semant inform inform nick kline richard snodgrass comput tempor aggreg inter confer data page march donald knuth sort volum art comput program addisonweslei publish snodgrass al tempor queri languag kluwer academ mackenzi aggreg tempor queri languag tquel ieee transact knowledg data octob michael stonebrak case share quarterli bulletin ieee comput societi technic march tansel al tempor design implement system applic seri redwood transact process perform san ca tpc benchmark standard june implement histor aggreg master wayn state novemb carolyn ansi sql standard scaleabl portabl benchmark relat system jim benchmark handbook transact process system page morgan kaufman san ye john kean process tempor aggreg parallel ieee inter conf page octob
HCI/855 4 intern telecommun twelfth biennial june feasibl discuss collabor virtual environ find altern wai member interact manuel borg research member fernando de porto portug feasibl discuss collabor virtual environ paper discuss potenti impact roadmap creation collabor virtual environ actual environ present justifi evolut feasibl creation virtual simul bia teacher associ present introduct fernando requir year student laptop comput offer area social student acquir basic skill interact surviv inform sea similar encount inform societi environ fall student staff network support total popul teacher initi enter year exist infrastructur connect locat campu librari social infrastructur offer opportun develop inform system gener virtual enhanc concept dialogu call technolog research area bring great expect support virtual commun collabor virtual environ collabor virtual environ distribut virtual realiti technolog support group work simultan access virtual realiti system support work support user work user explicitli repres share space interact inform resourc paper discuss potenti impact roadmap creation collabor virtual environ member interact wai actual figur present justifi evolut feasibl relat project potenti creat action virtual simul bia present main goal introduc form educ situat student inform plai major role learn materi compon system teacher repres triangular area action place teacher act regul underli idea stimul virtual group interact driven common inform compet collabor achiev task maximum rich fernando actual environ fernando merg result privat institut year growth locat portug largest citi student administr staff peopl student belong administr scienc da commun scienc da polit behavior scienc scienc technolog present offer twenti graduat graduat area technolog fernando locat pont de offer plan year phase consolid assum process sum educ project qualiti requir born state strateg innov innov posit hold laptop discuss section privat fernando privat start evolv ten year portug higher educ environ public older centuri histori locat coimbra definit technolog environ laptop initi mention base laptop requir admiss tabl minim specif laptop comput begin project year project agreement comput compani suppli laptop year public announc minim specif student bui laptop comput recommend minim specif year hardwar softwar intel mb mb lan intel pentium mb mb lan intel pentium mb gb lan tabl laptop minim spec window ms offic window ms offic pro window ms offic pro import issu student laptop owner local privat comput lab requir monthli fee cost vari institut institut fernando fee comput lab drop begin initi laptop minim specif develop assur comput price inferior student pai year monthli valu decemb mean differ pai servic comput lab laptop comput small network infrastructur project base lan connect start late ethernet mbp lan lab entri point server intel evolv lan segment entri includ librari phase intranet servic wan connect internet network server sun lan segment continu segment number entri point network server tabl network evolut year number entri point number server entri point server tabl network evolut fernando tabl actual number laptop fernando shown figur includ student teacher decemb year student cover teacher cover total tabl laptop number fernando base actual infrastructur fernando coverag entri point student entri point laptop owner valu student connect time inform fernando technolog infrastructur found environ bring opportun explor inform technolog educ onlin facil classroom potenti present author discuss fernando facil concept student connect network infrastructur laptop campu facil student network set project area massiv presenc laptop comput make part infrastructur affect campu wide inform system cwi technolog infrastructur layer enabl chang share content student teacher teacher link comput resourc respect content make network daili activ content import factor enter discuss concept import discuss content layer major advantag higher educ institut constitut great produc content materi proper workforc maintain materi updat usabl student involv teacher gather content publish onlin stand intend virtual campu network distanc learn environ local interact engin structur approach servic content gener student professor technolog environ exist strong reinforc mobil laptop network entri greater involv student share technolog invest network tool inform manipul classroom space step prepar prototyp materi campu train teacher integr inform commun technolog technolog process integr goal inform technolog adequ institut shift offer offer open distanc learn normal part servic catalogu defin virtual situat defin report virtual figur role educ lab introduc innov practic advantag fernando environ figur concept collabor virtual environ technolog support global concept frequent cyberspac term coin virtual scienc fiction book lead concept influenc theorist design virtual realiti system cyberspac work environ predic hardwir commun interfac direct total sensori access parallel world potenti work definit global comput access realiti comput heard object physic physic object charact made pure cyberspac lead design potenti project advantag environ fernando actual inform technolog servic evolv research area relat collabor virtual environ opportun implement assess valid concept term todai technolog evolv applic defin meet peopl interact comput order obtain common goal involv distribut virtual realiti technolog support group work condit present system consid provis simultan access virtual realiti system explicitli support user work import aspect kind system exist virtual space defin immateri world distanc interact user set network comput state interact accomplish exchang written idea space possibl movement voic exchang open definit system system internet relai chat includ mud irc system discuss social implic perspect share point user awar user state essenc user explicit repres share space state share space exist inhabit user space number stabl technolog mud distribut vr point main reason develop support natur spatial social skill offer natur human inher address interact larg number user applic cooper spatial current offer design support extend support collabor comput support cooper work import contribut area develop comput support cooper work state cscw emerg identifi research field role comput group work primari cscw characterist point interdisciplinari research involv peopl comput human scienc cscw system provid mean give answer question group peopl collabor peopl plan work comput group work advantag focu peopl work unifi theme cscw gener requir cscw system meet complet multimedia integr commun action ad select workspac interfac defend principl cooper separ mean comput support fit normal user work pattern principl cscw applic peopl cooper overcom barrier space time peopl lead function discuss import factor cscw applic collabor defin knowledg support cooper activ design specif applic wexelblat virtual technolog enabl technolog cscw virtual realiti virtual realiti enabl technolog system treat vr gener solut address direct abil visual program process vr bring chang strateg emerg virtual implement chang work virtual tactic interact graphic plai import role artifici intellig artifact object orient vr displai control technolog envelop person interact virtual environ author vr technolog creat artifici world sensori user real spatial environ inaccess virtu physic incompat user environ essenc virtual realiti multimedia environ user reach vr deliveri human convinc realiti exist digit electron form memori comput vr enabl technolog bring metaphor interact human machin metaphor inform creat thing peopl machin understand vr metaphor real world potenti applic vr educ inform central creation virtual report import biggest applic educ implement issu classif tool classif user interfac perspect histor list text base interfac virtual realiti interfac exampl type tradit mud irc system system consid strictli exampl virtual realiti interfac distribut interact virtual environ gener develop environ nottingham depart comput scienc order support link part commun group member depend exist potenti link link includ mechan messag electron meet discuss approach support commun identifi approach base share workspac share workspac particip share common area express idea build product share workspac resourc cooper interact support refer inform share model support collabor involv conferenc conferenc desktop multimedia conferenc electron meet system classifi share space media spatial orient video collabor virtual environ system altern classifi exampl comput game vr design support medium larg number user virtual virtual world user repres exist autonom agent behavior control comput program challeng higher educ ad platform manag set servic campu build facil detail discuss implement issu virtual environ present introduct discuss softwar requir develop virtual environ sourc paper assist virtual space tool softwar rapid construct object virtual environ model save format massiv dive applic comput support collabor learn dimens preserv odl gener educ learn interact student essenti learn requir technolog prove potenti deal requir interact orient comput support collabor learn gener cscw discuss defin act coordin social pursuit share joint simpli relationship refer central everydai live cooper learn process driven definit state human group collect interdepend perceiv group member group member interdepend relat group role group function expect open learn situat simultan influenc group includ distribut system virtual technolog augment group environ add influenc social structur group work produc inform product inform oper finer level detail outcom cooper state cooper learn posit effect student work cooper learn behaviour listen addit competit learn goal cooper relev learn justifi introduct ict support enhanc cscl principl adapt advantag refer outcom virtual environ higher educ todai student amount inform access huge amount make imposs maintain global restrict individu basi call phenomena face huge amount inform daili basi global prepar student ict deal phenomena student odl environ kind educ environ complement specif type train learn student vr enhanc learn virtual realiti offer form deal huge amount inform explor combin clever human facil bring feel lock human feel presenc place current literatur refer cyberspac call space repres context individu group perspect offer technolog environ student form inform space interact inform multimedia extend librari make game understand technolog student reli capac activ gather requir inform activ individu assess work result collabor effort kind share knowledg student extend interact system combin virtual realiti techniqu cscw bring essenc make interact share inform space individu discuss make visual inform student activ privat share relat student introduc real bia system make individu group compet inform potenti real work substitut improv virtual point creation enhanc environ issu social biolog area technic issu offer solut requir provid complex infrastructur function social issu import deal student expect kind teacher interest institut answer evolv chang environ relat societi actual crucial requir biolog issu consid creation input solut inform societi societi base digit interact predomin comput mediat base assumpt enter inform societi present virtual project inform dead inform fast notic absenc due excess inform sourc difficulti deal huge amount inform student teacher search definit list refer topic imposs true mean group peopl common problem imagin possess import grow characterist mention environ constitut valuabl asset trade potenti product trade imagin product trade result collabor effort peopl involv state knowledg share environ virtual real virtual experi web type virtual experi world wide web classifi profit initi classif web altern commun channel pure web result spacecraft orient promot interest understand advanc technolog emphasi space program spacecraft product stop shop post product includ concept archiv access technic expert web site access interact system base membership exampl virtual foundat foundat foundat promot virtual program foundat primarili inform knowledg navig multimedia applic educ scientif virtual text digit cognit total comput aid learn area constitut good list exampl potenti area develop virtual environ interact system base submiss particip user gain access account virtual offer servic virtual catalog index type virtual onlin sponsor busi card search servic intern busi web promot servic give price web bid midwest technic associ web merlin partnership contribut idea provid internet site interest inform gener guidelin make virtual product potenti line action explain implement virtual dozen servic offer servic base provid inform gather time maintain qualiti project context virtual inform issu global inform system environ thousand peopl work produc potenti answer specif problem type teacher associ environ servic activ classifi potenti match characterist mention system web base project evolv virtual space credit offer class student exchang skill kind work provid effect member relat virtual space virtual space creat teacher mix group number individu credit system base hour credit student redefin time student tradit membership cost associ associ contribut valu give credit certif learn easili tremend impact higher institut work work real adher kind actual inform system support virtual centr educ impact creation busi scale problem deal teacher role mention user question remain clear implement virtual project open full line trial conduct demonstr viabl path innov web facil intranet environ test group group student make exam collabor student stai exam classroom goal write answer examin form student stai librari goal access librari resourc student social space goal gather peopl manag bring social student commun laptop comput network web servic experi result present perspect order access system fernando evalu feasibl technic econom perspect oper aspect start system commun user commun literaci comput network environ facilit justifi system fernando oper item fulfil environ technic support laptop user network infrastructur crucial success implement import normal oper import complex system user intens support infrastructur demand discuss issu deal laptop support fernando made technic perspect face technolog system hardwar softwar advantag laptop initi technolog face servic applic offer commun servic applic develop natur evolut web facil combin java vrml fernando environ integr system singl interfac internet browser maximum system usabl experi gather test servic function function video real time applic test small group student enhanc laptop system knowledg deal king experi difficult set term voluntari student number high econom possibl bui laptop import factor role student dissemin support system function technic issu deal scale problem network traffic consid upgrad server network constitut reason internet proven experi result phase redefin student role promot system assess technolog applic econom import support manag board institut difficult fund invest infrastructur system rise technolog scale problem network power secur softwar strong invest peopl start system project support user commun technic staff user commun promot system support support technic hardwar function support function pure econom system easili assess impact kind system evalu phase offer virtual lab higher educ reduc mainten oper invest phase develop student laptop clever facil develop maintain system major institut cost network invest gener support exist larg commun laptop owner offer system materi teacher deal physic restrict compat teacher student class digit base virtual lab permit construct inform result support complex softwar system develop cost monei introduct virtual infrastructur enhanc tool educ odl offer lead redefinit higher educ train impact experi infrastructur offer digit support train learn constitut real competit advantag higher educ institut present basi transform deal realiti life long learn deal educ competitor introduc group activ situat higher educ great advantag system prepar assess student collabor activ implicit explicit assess issu administr activ teacher spend time support teacher activ assess administr work expect product make educ materi contribut transform teacher lead kind substitut predomin role facilit role creator sort produc system enhanc foster interact lead creation develop form search inform knowledg issu viabl work theme research conduct perspect term applic import aspect studi result oper gather inform develop virtual monitor evolut constitut import studi assess real impact system interest point project introduct associ member work introduc associ member element student associ partner teach great potenti constitut bind higher educ industri refer de rethink cscw architectur milano european confer comput support cooper john al kluwer academ pp borg marco framework classif comput support collabor design approach iii intern workshop groupwar octob basi london christoph cyber wilei christoph challeng realiti search futur wilei michael step mit pp steve chri share artifici spatial comput support cooper work pp steve spatial model interact larg virtual environ european confer cscw itali septemb steve chri collabor virtual tutori european confer comput support cooper septemb steve chri introduc parti object spatial model interact john al european confer comput support cooper kluwer academ pp donald michael michael internetwork infrastructur requir virtual environ vrml san decemb al build explor al confer supplement european confer comput support cooper lancast pp de implement integr train strategi higher educ bite intern pp kim inform manag virtual visual alan ed virtual realiti applic academ william ac book experi move action electron learn environ bite intern pp digit support teacher teach current experi internet facil virtual environ abstract accept intern technolog relat discuss potenti chang learn train paper submit portug group altern form evalu student skill da vol pp overview ed cooper book kaufmann pp linda al learn mit press david mark experi virtual butterworth european compet inform strategi prentic hall jon educ world confer april david implement comput support cooper london michael virtual realiti planetari explor alan ed virtual realiti applic academ stuart write literaci ag alan ed virtual realiti applic academ jo ann virtual virtual cambridg press howard virtual onlin tom technolog support cooper dan ed cscw na introduct case verlag tom build virtual campu workshop higher educ virtual campu nottingham juli parker inform ag global higher collabor inform manag octob cooper research david de passag william gibson cultur model cyberspac ed mit pp virtual classroom web page captur alan realiti virtual realiti cscw alan ed virtual realiti applic academ michael al softwar requir comput gener virtual environ virtual vol mit cambridg pp
IR/856 5 automat inform extract peng comput scienc depart waterloo septemb phd thesi dale schuurman prof frank abstract inform techniqu internet system english learn requir larg amount human work narrow domain depend system dicult port domain inher shortcom western languag asian languag di erent english word delimit comput easili token input text string languag thai word boundari word pose dicult problem inform extract languag intend implement languag independ automat system system automat learn framework label data requir train learn framework small amount label data larg amount unlabel data speci deal english languag entiti recognit entiti relat system easili extend languag task implement word po extend maximum entropi model incorpor unlabel data gener inform extract content introduct problem de nition problem inform extract di erenc tm problem inform extract problem previou research english research problem combin unlabel data learn framework expect maxim maximum entropi principl basic concept entropi diverg maximum likelihood estim maximum entropi model maximum entropi principl solv optim problem maximum diverg model relationship problem model train model problem improv iter ii maximum entropi model entiti recognit induc featur incorpor unlabel data model word segment em segment segment mutual inform lexicon experi result po improv segment tagger po tagger equat po paramet estim handl unknown word incorpor unlabel data experi inform extract system system architectur experi design experi result contribut thesi time tabl ful ll thesi time tabl acknowledg iii introduct layout section de ne problem inform extract problem section argu import problem section summar previou research problem section point research problem solv thesi section introduc research combin unlabel data learn framework section introduc maximum entropi principl section discuss maximum entropi model ne recognit section discuss incorpor unlabel train data framework section describ word segment system section describ tagger system section describ architectur inform extract system section summar contribut thesi section outlin time tabl ful ll thesi section draw end problem de nition problem inform extract de nition inform extract muc inform extract messag understand confer de ned extract inform text form text string process text string slot label kind inform ll input inform extract set ed newswir output set lled slot ve independ inform extract task categor class proper text entiti task consist subtask tempor number nding person email address document templat entiti identifi featur entiti templat element evalu gener templat element entiti locat link refer entiti text templat instanc broader relat employ relat compani person templat relat evalu gener relat object point templat element object scenario instanc event fact speci ed event complex relat multipl rocket relat launch outcom launch success failur entiti recognit recognit link entiti rst task di erenc tm distinguish ir tm ir return interest document return interest text string entiti document combin ir popular task question answer system rst retriev relat document extract interest inform document di erenc tm clear inform extract inform exist document goal text mine di erent goal text data mine discov deriv inform nding pattern separ signal exampl task includ text topic detect text segment problem tm research ne text mine problem research text categor problem problem inform extract subsect talk gener problem inform extract asian speci problem face inform extract asian explicit charact segment word rst step languag word segment segment charact string word separ step similar english problem languag relat tag tagger english tagger claim languag independ publicli po tagger main reason lack benchmark data train test recent treebank port tagger segment po build inform extract system problem document text stori press forrest research predic unstructur data predomin data type store onlin volum text internet expand fast estim inform inform extract emerg technolog part search method access mine inform tradit document text manag tool inadequ meet todai demand system work homogen collect document heterogen text face dai internet search tool su er poor recal inform extract allevi problem entiti view person locat document begin read document detail document classi select document categori document save lot time read articl main idea automat document index techniqu import usag practic english asian languag import internet peopl world speak system de nite great import futur inform technolog research institut research main research institut compani special inform extract awar transfer web data inform extract compani special start author graduat nyu srv compani special inform mation speech recognit text data mine compani start mean technolog hot broad prospect previou research inform extract idea earli work trace back enthusiasm recent event text data fund tipster text program pursu ir understand lot enthusiasm research darpa sponsor entiti jointli muc muc stop fund problem confer ir focu inform retriev recent focu question answer learn text creat phd brie review previou research english ne recognit task english made survei inform extract model system classi ed dictionari base rule base model machin learn model hidden markov system lot human labor construct label train data drew machin learn techniqu favor futur system prefer automat model hmm duplic work found hmm initi label result randomli result bad contribut reason due lack train limit amount train data hmm train em su er local maximum problem pure method work label data guid algorithm modi ed hmm transit depend previou depend current observ transit probabl model exponenti distribut exponenti distribut exibl multinomi distribut hmm incorpor featur easili natur languag featur easi repres explicit form easili model framework maximum entropi principl train author paper framework extend learn framework em perform experi direct direct goal thesi automat learn text due limit amount label train larg amount unlabel data easi obtain standard maximum entropi framework entiti shown maximum entropi model success task standard maximum entropi framework learn incorpor unlabel data entiti system entiti extract similarli word boundari rst step inform extract token word segment token dictionari token hand craft token separ morpholog analyz system return detail publish dictionari rule base method simpl ectiv limit narrow requir human labor construct dictionari rule dictionari rule descript fth system languag domain make system dicult port languag domain goal construct languag domain independ token pure section detail entiti recognit system automat requir lot human labor train data label word featur semant train corpu po system label word label geograph organ system entiti peopl locat list organ list languag model built featur tag rst dictionari assign word gener featur predict label person extract rule ambigu resolv heurist rule rule learnt corpu million person learn mechan system special dictionari obtain web human knowledg dictionari includ person organ roman alphabet dictionari obtain charact type token match special tree built learn open close entiti base kind inform entiti extract rule token rstly assign prede ned basic rule merg basic unit entiti method regard step reduc perform system summar tabl result util featur languag model techniqu rule base method work result obtain step rule base model di erenc due differ demonstr featur base languag model techniqu step techniqu work system ntt tabl result system languag model techniqu guess kind local lm model implement entiti recognit system maximum entropi model toolkit satisfi result show maximum entropi model techniqu inform extract toolkit publicli implement maximum entropi toolkit style implement maximum entropi model advantag incorpor techniqu speed em system discuss pure learn framework collin singer rst method ne collin singer algorithm unlabel em base approach result show unlabel exampl ne recognit base list method cotrain method learn framework maximum likelihood predict learn entiti repres pair algorithm rst set seed label exampl spell rule induc list contextu rule learn label exampl current contextu rule induc list spell procedur continu rule number reach constant base adaboost algorithm algorithm em base method common approach learn research problem main problem system behav task dicult adapt system portabl problem adapt system languag languag easili adapt english resolut system french spain languag introduc architectur combin system deal document viewpoint di erent automat port system languag languag human involv handl document system requir rule hand label train data easi goal adapt english system western languag easier adapt asian languag word segment problem inform extract requir constraint includ local globe maximum entropi model shown good model constraint nlp entiti recognit po word disambigu attribut grammar languag model text segment word spell check machin translat text classi cation inform extract standard method mean label train data gi ii train model perform learn system larg depend label train data natur languag obtain label train data easi task research ort devot combin unlabel data learn call learn section introduc approach research problem thesi incorpor unlabel train data model problem train biggest limit model comput complex gi train ii improv great contribut model research problem mind research port english system implement word segment system po tagger problem solv thesi combin unlabel data learn framework label train data easi obtain learn complet learn yield good ort put combin unlabel data learn research explor unlabel data learn framework receiv attent recent section brie discuss learn literatur includ detail review approach unlabel data learn fall ve expect maxim adapt regular kernel transduct interest em approach approach expect maxim em algorithm gener method nding estim paramet underli distribut data set data incomplet miss valu assum data observ independ ident gener process call incomplet data assum complet data set exist miss valu goal em algorithm optim largest likelihood log likelihood observ argmax argmax argmax log object function log gener solut distribut nice form em algorithm situat step em expect step maxim step comput expect log likelihood complet data observ data current paramet estim expect function call function log step nding maxim make argmax step step continu converg stop criterion met step dicult replac gener step gener maxim log improv log likelihood compar previou step version em call gener em converg slower standard em proof converg em found local maximum problem straightforward appli em gener yield good perform variant di erent applic activ learn method select unlabel data text classi cation overcom local maximum problem standard author initi em label criterion deriv select inform unlabel data add label data pool rerun em present case studi address unlabel data improv naiv text classi er small amount label train data unlabel train penal uenc unlabel author multipli constant log likelihood term unlabel data separ distribut equal part uenc core lexicon word combin em multipl discrimin analysi discrimin em algorithm imag retriev applic modi ed em algorithm includ reward optim problem reinforc learn literatur conclud make em algorithm care problem initi paramet label initi randomli custom em procedur select unlabel data select repres unlabel activ learn monitor iter procedur stop earli high likelihood high perform applic continu iter result perform word segment iter result tting recent applic depend assumpt assum data correctli classi ed di erent view provid sucient label data view independ class write data di erent view data view sucient classi classi er classifi data view view target function label label exampl target function assign label view observ label web page classi cation problem web page word word hyperlink point page web page correctli classi ed label data small amount label data label unlabel data basic procedur illustr fig initi collect label exampl pool unlabel exampl loop exist exampl label classi er view classi er view class pick unlabel classi er con dent label class add label document class pick unlabel classi er con dent label class add label document classi predict class label exampl predict combin multipli class probabl score figur procedur successfulli appli lot includ document classi cation statist entiti recognit algorithm satisfi data view redund view view independ class condit import easi independ view real data variant variant requir split independ di erent learn algorithm label unlabel exampl add con dent exampl learner accuraci accumul label data import appli low qualiti unlabel activ learn correct label relat em drawn claim form diagnost em di erenc similar approach algorithm di erenc em requir view split assumpt em relabel unlabel data label unlabel data increment maximum entropi principl discuss incorpor unlabel data introduc famou maximum entropi principl basic concept recal basic concept entropi entropi discret random variabl fx distribut de ned log entropi metric measur uncertainti system larger entropi uncertain system extrem case entropi mean system fulli decid extrem uniform system largest log diverg diverg call rel de ned distribut random variabl fx rel entropi de ned log measur di erenc distribut event space quantiti proof jensen diverg symmetr maximum likelihood estim likelihood random variabl fx distribut de ned maximum likelihood estim distribut largest likelihood argmax maximum entropi model time introduc model maximum entropi principl make infer basi partial probabl distribut maximum entropi subject assign amount arbitrari assumpt inform hypothesi random variabl valu fx estim probabl fp assum knowledg expect function number di erent function constraint function refer featur nlp maximum entropi infer constrain true distribut expect function constraint empir distribut obtain data constraint optim distribut maxim entropi distribut argmax log solv constraint optim problem section normal constant distribut uniform distribut solv optim problem de ne lagrangian log fm fm calcul partial deriv respect fm fm set deriv de ne equat maximum diverg model gener model call diverg includ refer distribut optim distribut solut minim kl diverg jjp subject constrain jjp log subject constraint solv constraint optim problem similar relationship model complet observ empir probabl de ned log log form log log lagrang pf log log optim solut constraint maximum entropi model equal solut maximum likelihood estim constraint distribut form result ad justi cation maximum entropi notion select model basi maximum entropi isnt compel model model parametr form account train sampl solut shown uniqu advantag model attract merit simplic model repres system featur captur regular system featur model train ecient algorithm natur languag explicit parametr form easi appli maximum likelihood estim maximum entropi languag repres featur captur regular languag maximum entropi check spell error atom featur featur induc algorithm automat induc train paramet gi algorithm model simpl work model temper tting problem ml estim increment construct eld captur salient properti incorpor detail collect gener con gurat tting exist great merit conveni form model kind beauti form make easi factor train train complet model achiev train incomplet form make simpler tradit em local maximum train speed faster problem model model attract merit success nlp task problem deserv notic de nite answer question peopl put possibl pattern featur empir matter ecient induc algorithm greedi search time hope advanc algorithm ecient incorpor unlabel framework learn perform depend label train data nlp label data easi incorpor unlabel data framework import work em algorithm incorpor unlabel data model train model problem goal deriv featur equat distribut form log likelihood log log deriv respect set depend coupl system easi solv directli numer optim method present gi iter constraint sum featur constant della pietra al iter constraint sum featur ii reduc gi improv iter ii de ne auxiliari function de ned lower bound di erenc log log call likelihood straightforward method deriv respect set solv equat introduc coupl system de ne jensen inequ call di erenti respect solv ii shown arbitrari valu converg solv equat comput set maximum entropi model entiti recognit assum assign kind ft token test corpu problem formul calcul probabl jc inform deriv token maximum entropi inform deriv token repres binari featur equat special form word begin capit charter larg probabl person number featur english entiti present token begin capit letter start maximum entropi model lot featur featur weight paramet train gi ii algorithm section featur weight calcul condit probabl assign entiti highest probabl assign entiti viterbi algorithm kei step maximum entropi model induc featur induc featur kind featur descript number number digit mix letter digit number comma number period valid ibm initi cap intel word wont intern capit tabl featur featur includ lexic featur xed length window section featur indic section word featur includ featur pool simpl count select method select featur frequent time sophist featur select method incorpor unlabel data model word segment unlik english western asian languag delimit word word segment kei subproblem languag process task inform languag segment input sentenc word nontrivi task case signi amount research techniqu discov word main idea techniqu start lexicon set word segment concaten charact string optim heurist object maximum length mutual maximum likelihood approach main problem word segment construct origin lexicon method construct lexicon classi ed segment raw unseg corpu hand collect word segment corpu build lexicon commonli build complet lexicon hand impract number segment method recent segment text approach form em learn probabilist model charact sequenc emploi procedur segment text word reason em algorithm wide adopt train converg good probabl model local maxim likelihood posterior probabl train data em appli rst extract lexicon candid train initi probabl distribut standard iter adjust probabl posterior probabl train data em segment assum sequenc charact segment chunk chunk chosen lexicon fs jv jg probabl distribut jv jg de ned comput segment sequenc chunk segment calcul joint likelihood task segment achiev maximum argmax argmax note number segment feasibl determin segment ecient recov viterbi emploi dynam program approach build segment bottom manner dempster al updat function case examin maxim constraint obtain paramet formula numer sum segment number occurr word weight probabl segment denomin weight sum number word segment weight frequenc count equat ecient calcul forward backward ecient approxim viterbi detail algorithm segment advantag lexicon construct automat discov word word acquir high probabl word natur segment word base word discoveri method variant standard em avoid trap local maxima core lexicon word judg candid lexicon word core lexicon em maxim likelihood train corpu automat suggest word candid core word ad em reiniti give half total probabl mass core core word guid segment pull em poor local maxima assum sequenc charact segment chunk number charact sequenc number word segment chunk chosen core lexicon fs jv jg candid lexicon fs jv jg probabl distribut jv jg de ned core lexicon jv jg candid recov segment sequenc chunk segment calcul joint likelihood number chunk occur core number chunk occur candid lexicon chunk core candid note equat de ned equat true segment true uenc applic process segment distribut merg half space distribut core lexicon half space distribut candid lexicon cj task segment achiev maximum argmax equal argmax argmax conveni equat discuss similarli em updat function em updat maxim constraint yield paramet formula number time occur segment standard reiniti di erent success optim case denomin weight sum number word numer normal weight frequenc count updat ecient calcul forward backward ecient approxim viterbi main diculti appli em problem probabl distribut complex typic em trap poor local maxima guid em probabl partit lexicon core candid initi empti word rst start uniform em likelihood train corpu train process word highest probabl select move probabl rescal half total probabl mass em run shift half probabl mass uenc core word determin segment act ectiv guid process train sequenc call procedur success move top word forward select forward select repeat segment perform viterbi valid corpu lead mean includ erron core forward select decrement carri process backward word lowest probabl move back em train success repeat valid corpu mean delet correct core procedur forward select backward delet decrement shown fig outcom train procedur probabl distribut lexicon viterbi segment test sequenc input complet unseg train corpu valid corpu initi potenti nite set iter em learn base current calcul valid corpu chang select direct forward backward test test test corpu figur learn em train emploi mutual inform base lexicon prune prune illeg found import segment mutual inform lexicon em train acquir probabl distribut entir lexicon point lexicon import factor word lexicon critic model maxim em erron tend natur introduc lexicon mean model motiv prune lexicon remov erron entri invok mutual inform base criterion recal mutual inform random variabl larg strong depend independ test depend chunk long split probabl origin string chunk mutual inform log appli measur set threshold mutual inform higher threshold strongli split remov mutual inform lower lower threshold remov lexicon redistribut probabl mutual inform weakli shift probabl portion ss probabl distribut rest probabl smaller proport probabl idea shift weight probabl distribut shorter word split process carri pseudo code illustr fig experi result compar techniqu previou follow measur perform detect word boundari word consid correctli recov boundari correctli front rst charact boundari correctli end charact mi log depend return depend return figur mutual inform probabilist lexicon prune boundari rst charact word denot number word test corpu denot number word recov corpu denot number word correctli recov recal measur de ned train consist unseg charact suppli author year servic stori test corpu ldc articl correctli segment hand remov creat unseg corpu algorithm section recov valid consist sentenc randomli select test corpu frequenc dictionari modern top frequent word consist limit length word sucient situat result shown tabl obtain standard em result obtain result obtain repeatedli appli lexicon prune standard em result obtain repeatedli appli lexicon prune train row label perfect lexicon obtain maximum length match complet lexicon test word occur test corpu result learn algorithm result sux tree model perfect result obtain lexicon test corpu nal lex size result result result result perfect lexicon perfect tabl result observ make result train improv perform standard em train mutual inform prune greater improv verifi claim lexicon model lexicon prune reduc lexicon size make lexicon smaller suppli calcul comparison combin obtain improv perform pure approach result perfect lexicon improv strategi train lexicon prune complementari result perform addit combin lexicon prune direct comparison made investig pure train approach exploit addit context inform train set consid compar train lexicon prune achiev higher recal obtain improv problem report test perform compar sux tree model emploi context inform entropi achiev score result suggest context inform import di erent test set test set test data segment correct comparison fulli calibr perfect lexicon achiev higher perform achiev experi suggest obtain perform test data result demonstr util local context assum independ result emploi smooth techniqu local context inform prove ad perform dramat experi higher likelihood segment em segment frequenc highli frequent chunk true word languag characterist po inform augment segment po improv segment equat languag characterist segment plan po inform section augment segment segment give give po argmax po charact probabl distribut de ned lexicon assum independ rst part standard segment part po tagger section step segment segment charact string chunk comput probabl po tag chunk search segment complic standard segment tagger po inform nlp task includ inform speech languag synthesi entiti recognit po inform publicli po tagger claim languag po tagger easi port po tagger english western spain languag similar charact repres byte comput word delimit explicitli whitespac word format word pre stem tag unknown word tag benchmark data train dicult port po tagger charact repres byte comput explicit word boundari word word form pre sux dicult tag unknown word public benchmark tag data train test allevi recent treebank discuss po tagger train treebank basic idea po tagger current po tagger fall rule base tagger markov tagger maximum entropi tagger hybrid tagger rule base tagger induc rule train corpu advantag storag abil long rang inform approach easi port languag markov tagger statist easili port account recent lose long rang inform tag hybrid tagger combin rule base tagger markov tagger order advantag rule base tagger markov tagger maximum entropi tagger statist unlik markov account long rang inform clue capit maximum entropi tagger found brant sophist method handl unknown invent tagger found maximum entropi model gave comparison tagger swedish found base tagger perform perform depend size train corpu maximum entropi model long time train markov tagger plan incorpor unlabel data train equat po charniak al good descript equat tag assum languag xed vocabulari fw xed tag set ft po tag noun sequenc word word chosen vocabulari denot po sequenc task po tag nding po sequenc word sequenc argmax jw equat formul argmax argmax chain rule break equat piec break rst jw jt jt jt jt jt jt break jt jt equat make di erent independ assumpt di erent model current markov tagger deriv equat di erent independ assumpt equat make assumpt jt jw jt jw equat mean current word depend previou previou po tag equat mean current po tag depend current previou word tag equat simpli ed argmax jw jw argmax jw mean word pick common tag word equat assum current po tag depend previou po tag current word depend jt jt jt jt model argmax jt jt model base assumpt make assumpt model model discuss estim paramet model paramet estim learn probabl jt jt estim frequenc count denot jt jt data smooth techniqu adjust probabl smooth techniqu languag model includ absolut discount linear discount discount discount linear interpol chen goodman made comparison smooth techniqu handl unknown word part po tagger abil handl unknown word tagger pre sux inform estim po tag unknown word problem dicult solut incorpor unlabel data method includ boost activ learn em experi inform extract system system architectur construct segment po build entiti recognit system basic structur system shown fig segment input document ne finder output entiti po tagger figur entiti recognit system experi design evalu system real data year download le html format convert html format le pure text pure text format input experi result contribut thesi framework automat inform extract incorpor unlabel data framework task word segment po tagger time tabl ful ll thesi part segment part po tagger finish po includ incorpor unlabel data train improv segment context inform smooth techniqu improv segment po inform model english entiti recognit incorpor unlabel data model english ne port english ne nder find relat entiti write defend thesi time tabl framework automat inform extract order make system easi port make system train small amount label data speci incorpor unlabel data maximum entropi framework train learn framework segment implement po tagger improv machin learn techniqu activ learn acknowledg appreci debt kind prof dale schuurman dale full freedom research topic constantli devot great enthusiasm research teach write research paper dale lot canada life good friend seek dale research lot amit steven mike hu member group ai group give lot past year research support bell nserc refer statist segment applic languag independ domain model multilingu inform extract workshop multilingu softwar ai contribut la text segment exponenti model empir method natur languag ri maximum entropi approach natur languag comput march gentl tutori em algorithm applic paramet estim gaussian mixtur hidden markov model technic learn label unlabel data graph icml combin label unlabel data confer comput learn juli maximum entropi approach entiti recognit phd thesi york statist tagger sixth appli natur languag process wa probabilist sound algorithm segment word discoveri machin learn text segment make train simpl part speech tagger learn natur languag case studi part speech tag comput dec rel label unlabel sampl pattern recognit unknown mix paramet ieee tran inform vol pp iter method lexicon extract intern journal comput linguist languag equat tag eleventh nation confer arti cial menlo aaai press parser north american chapter american associ comput empir studi smooth techniqu languag model technic comput scienc harvard descript system messag understand inform extract task definit messag understand entiti task de nition messag understand penn treebank em review model entiti classi cation element inform wilei son inform extract somer handbook natur languag marcel al practic tagger confer appli natur languag discoveri unit arti studi implic acquisit journal iter scale model annal mathemat volum issu languag model variabl length theoret formul evalu incomplet data em algorithm journal royal statist soc ser parallel inform extract system multilingu inform european intellig system control confer session multilingu inform extract pattern classi cation scene analysi confer appli natur languag process machin learn inform extract inform domain phd inform extract hmm boost weak learn algorithm major inform descript oki system messag understand extract kei term text intern journal comput process orient special issu inform retriev orient discov word unseg text page enhanc learn unlabel data principl maximum entropi mathemat text data annual meet associ comput expect maxim weakli label data icml maximum entropi discrimin advanc neural inform process system mit inform theori statist physic segment disambigu comput research mexico state la mexico estim probabl data languag model compon speech ieee transact speech signal volum page march maximum entropi techniqu exploit semant colloc depend languag model comput speech pp oct wrapper induct inform extract phd hybrid po tag gener handl intern workshop inform retriev asian languag foundat statist natur languag process mit markov random field model natur phd washington maximum entropi inform extract emploi em activ learn text classi cation compar learn algorithm po tag swedish emnlp role unlabel data learn sixth intern colloquium cognit san machin learn distribut text data phd octob algorithm machin learn robot spring lectur florida structur probabilist depend stochast languag model comput speech volum page understand behavior workshop text mine analyz ectiv applic ninth intern confer inform knowledg manag pp la maximum entropi text classi cation workshop machin learn inform pp text classi cation label unlabel document em machin pp good maximum empir investig ensembl model grammar unpublish draft word segment inform retriev aaai spring symposium text speech electron work model develop task survei comput comput scienc hmm inform extract inform digit multimedia comput scienc word intern symposium intellig data analysi hierarch em approach word natur languag process paci rim symposium limit natur languag learn larg dataset confer empir method natur languag process la induc featur random field ieee transact pattern analysi machin la maximum entropi iter excerpt paper submit public retarget word segment procedur inform retriev symposium document analysi inform tutori hidden markov model select applic speech recognit maximum entropi model natur languag ambigu resolut phd comput inform scienc probabilist constraint logic phd lexic stochast model grammar measur em train annual meet associ comput linguist hong maximum entropi model adapt statist languag approach phd comput scienc carnegi mellon report appli method statist june improv boost algorithm con predict machin approach model select fourteenth nation confer arti cial intellig learn label unlabel data technic edinburgh descript ne system messag understand queri annual acm workshop comput learn pp statist method nding word boundari text comput process orient stochast algorithm comput text mine busi publish dm decemb kernel unlabel exampl advanc neural inform process system text mine turn inform knowledg white paper statist learn concept extract textual inform filter phd universit statist learn theori john wilei inform extract core languag pazienza inform make inform extract pazienza berlin estim probabl event adapt text ieee transact inform vol juli algorithm applic imag retriev ieee conf comput vision pattern recognit vol pp hilton head scenario custom inform extract phd york word disambigu rival method annual meet associ comput linguist pp descript kent ridg digit lab system messag understand
DB/857 3 parallel tempor versatil support futur applic depart comput inform scienc norwegian scienc technolog norwai abstract discuss featur futur system support deliv requir function perform futur applic import featur effici support larg deliveri queri larg data full text tempor data version effici support featur integr architectur describ architectur suitabl parallel tempor system describ techniqu develop avoid bottleneck system base architectur introduct recent year brought comput avail power connect global made util power data manag system applic area perform storag combin made realiz applic heavi current comput hardwar high perform storag capac necessarili support oper benefit current futur hardwar mean rethink previou similar hardwar world introduct risc concept concentr bottleneck futur inform system adequ design step process rethink solut advent system relat system good perform applic applic demand rdb deliv model power remov languag mismatch made integr applic program case applic perform data live model world insert creat mismatch wai similar languag mismatch system support world similar includ time space aspect tempor manag activ research area year current adequ yesterdai problem cope tomorrow applic describ suitabl tomorrow parallel tempor system give overview describ techniqu develop make deliv high perform scalabl futur applic organ rest paper sect give overview relat work sect describ applic area limit support exist system base summar featur futur system describ assumpt featur motiv design system sect discuss techniqu perform tempor oodb sect conclud paper relat work area tempor evid amount research summar tempor bibliographi publish work area tempor data implement issu tempor long full scale system implement common test small amount make scalabl system question applic area tempor system scalabl import amount data larg area tempor awar tempor object store descript preliminari design storag manag objectori system base techniqu file philosophi approach base introduc rosenblum ousterhout lf basi object texa persist store part oper object store page oper page granular public object lf base oodb architectur design import studi current futur applic system categor applic area exist applic emerg applic area exist applic area includ tradit typic transact suit applic area applic specif system file system current gener system handl perform constraint emerg applic area includ applic emerg comput perform applic area world wide web exampl exist system recent potenti perform bottleneck includ geograph inform scientif statist multimedia system exampl applic support deliv desir perform includ tempor system semistructur data manag base characterist applic identifi featur futur system ffl effici support larg object ffl deliveri data ffl queri larg data set ffl applic low updat rate exploit perform ffl support full text index ffl support data ffl support data compress ffl dynam cluster dynam tune system option paramet ffl tempor data manag singl system support featur featur solut work support featur futur system support integr system goal project design support list philosophi base current problem handl futur main memori system problem comput power solv larg solv size main memori import util main memori reduc time consum secondari memori access main bottleneck system larg secondari memori access access data read oper system read optim main memori capac amount disk write oper rel disk read oper gener call focu write optim system provid comput power data parallel architectur approach primari interest oodb base advent high perform high speed expect base commod network cost effect applic data transact throughput point import emerg applic area high data bandwidth exampl video supercomput earlier file system system support deliveri larg data volum set base queri neglect featur expect import futur oodb relat system popular hybrid system justifi assumpt distribut inform system increasingli support facilit effici support effici execut local queri oper describ architectur interest aspect oodb storag current write ahead log emploi throughput reduc time wal defer sooner data written result write lot small disk access individu object solut elimin current similar file system approach log written contigu larg block write object index possibl write oper good write possibl read oper written data version object append log log infinit length physic disk size infinit solv problem divid disk equal physic segment segment continu write segment data delet migrat tertiari segment delet data leav lot partial fill data empti segment collect move segment call make segment combin clean cluster segment tradit system version requir transact time tempor mean previou version copi place updat doubl write cost version free extra disk system support transact time tempor system effici version object written logic object identifi logic oid index map logic oid physic locat retriev object index entri object descriptor physic address transact time timestamp tradit nontempor updat object updat updat object updat make difficult realiz effici oodb base techniqu case updat object updat case previou version written place support tempor data index cost approach storag structur suit basi tempor system overwrit version free maintain tempor inform make retriev addit index server server server server server server server server server group server server server server server server server server server group server server server server server server server server server group server server server server server server server server server group client messeng messeng client manag applic oodb session sm api client address space api server address space fig system architectur server architectur parallel distribut architectur system design high strategi achiev base design parallel server data declust set call server group add remov node configur server server group cooper task data bandwidth close aggreg bandwidth cooper server benefit parallel server server server group connect kind high speed commun desir data distribut demand support distribut satisfi hybrid distribut server group connect server group distribut system gener bandwidth connect server server group object cluster server group base local common tradit distribut server group comput kind object store server group declust server group declust hash server architectur server similar shore project applic program system connect server run machin server gatewai includ remot server server data server includ run offic make avail system difficult node data server run node make applic program access system advantag approach make client run machin util common server side cach client side cach emploi commun server object server architectur server shown fig client oper client side stub mechan commun server commun server implement share memori queue server side oper server run separ thread thread transact thread incur extra cost lock thread thread switch compar event driven thread benefici exploit multiprocessor comput client connect server start session connect alloc oodb session thread applic thread client alloc thread oper server address space behalf client command data commun messeng server extens commun client server class oodb session applic manag session alloc oodb session applic access storag manag sm api oodb session portal system applic extens similar informix datablad interest point sm api superset client interfac stub featur make easier implement test ad server commun client illustr fig applic make easi integr extens ad system featur found ad server concept shore concept oodb object ship page system filter object oper imposs difficult page server system storag manag storag manag perman storag object import oper includ transact secondari tertiari storag index buffer data main memori reduc amount data transfer main memori disk import buffer includ object index node object descriptor buffer entri size dynam optim perform chang access pattern perman storag data store logic log log store logic data volum data volum consist storag devic storag devic secondari tertiari typic exampl storag devic raw disk fix size file nativ file simul disk optic tape devic dynam ad remov data volum ad devic basic number segment remov devic move data resid devic essenti clean oper segment resid devic disk space data tertiari memori applic transpar object partit migrat tertiari storag object storag object smaller written contigu object segment page object larger threshold segment larg object index maintain larg object reason ffl write larg object block transact time ffl segment object part object read modifi ffl part object resid physic possibl level storag hierarchi threshold set independ object object class object retriev characterist typic exampl video gener index retriev larg block video plai video search index small node desir similar video index retriev small part object retriev displai retriev imag retriev video object deliv part deliv retriev plan support retriev system partli solv queue system data special object larg object view arrai retriev part object retriev byte rang object flexibl structur store larg index structur store larg subobject index addit inform support complex index concurr control recoveri characterist call special handl special object handler exampl special object persist index spatial data store larg object advantag make integr part object system avg index access index buffer index size od od od opt od opt od opt od fig access cost access od cach remov bottleneck design cost model identifi potenti bottleneck find techniqu avoid oid index manag potenti costli reduc index develop oid index structur parallel tempor oodb techniqu reduc cost oid ffl object descriptor cach tempor oodb ffl persist cach oid index entri bottleneck object retriev system write object retriev index lookup bottleneck techniqu reduc number size read improv object retriev perform margin write ffl signatur ffl object compress compress improv write reduc amount data written disk give overview techniqu detail refer paper techniqu present analyz object descriptor cach reduc disk recent index page index page buffer page gener low probabl find od map oid physic recent index entri separ od cach main shore oodb low local index separ od cach util memori space wast larg page small part od cach read import note bottleneck problem exist tradit page updat techniqu tradit updat object object updat creat updat mean techniqu applic system main memori node buffer od cach disk cost index memori mb fig overview index access cost access updat effici individu entri insert make make store od od cach combin optim od cach size log effici checkpoint instal perform cost reduct illustr fig show averag index access cost access pattern index memori size memori memori od cach page optim od cach size od cach averag access cost calcul access read read time read time write probabl oper write oper reason read write oper studi independ exampl persist cach od access uniformli distribut index leaf node od cach make read access od updat checkpoint interv resid leaf node low local mean leaf node updat index node instal read node larg access node random disk instal read costli od cach reduc updat number updat object checkpoint interv smaller size od cach reduc averag access persist cach subset entri goal frequent od contrast main memori cach od write entri back access pattern mean access mean access gain memori size fig gain signatur tempor versu memori access pattern checkpoint interv main provid intermedi storag area persist od size gener larger size main smaller size content maintain lru mechan result high local access reduc total number instal make checkpoint costli averag lookup cost od index node illustr fig number node small make store pointer node main node node buffer disk access access node copi od node access order leaf node node rang node store interv oid cost reduct illustr fig show averag index access cost access pattern index memori size index memori memori od cach page page million object version studi signatur signatur bit gener appli hash function attribut object signatur object store separ object filter candid object perfect match queri tradit signatur store separ signatur updat time object updat costli updat time object updat store signatur od addit cost maintain signatur margin figur show gain access pattern object compress reduc storag disk object compress written object written locat space size current version written system emploi difficult benefit object compress ratio version difficult space reserv combin signatur compress power techniqu queri signatur decompress avoid object import object memori discuss featur futur system support deliv requir function perform futur applic support architectur ar make effici scalabl system architectur suitabl parallel tempor develop norwegian scienc technolog avoid potenti bottleneck case larg techniqu reduc object identifi index cost object read cost desir includ od persist object identifi object signatur integr object identifi index addit result import analyt studi system design phase problem bottleneck identifi easier cheaper find solut confirm project problem analyt model analysi studi predict access pattern futur system studi access base knowledg current rest data access futur tempor system support issu list sect applic develop util result access pattern implement refer bohlen tempor system implement sigmod shore persist applic acm sigmod persist store australasian comput scienc storag manag method object system phd effici signatur system advanc inform system persist improv oid index tempor system vldb effici index structur oid index parallel tempor system technic report idi norwegian scienc tempor object storag intern workshop expert system write optim system intern confer comput scienc optim oid index cost tempor system intern confer foundat data rosenblum ousterhout design implement file system thirteenth acm symposium oper system wilson portabl persist store intern workshop persist object suzuki develop perform analysi tempor persist object store australasian wang tempor bibliographi updat tempor research practic
DB/858 3 data energi data collect project lui lui judith andrew jai brian digit govern research center digit govern research center inform scienc institut depart comput scienc southern california columbia west mc marina del ca ny abstract massiv amount statist text data govern agenc creat set daunt challeng research analysi commun problem includ control terminolog digit govern research center investig solut kei problem paper focu ontolog map terminolog data integr data base high speed queri interfac queri input present result collabor research columbia inform scienc institut southern california emploi technolog develop sim access autom dictionari terminolog analysi pilot applic target gasolin data bureau labor energi inform administr depart censu govern agenc digit govern research center access web household govern feder agenc censu bureau labor energi inform mandat make inform public massiv amount statist text data agenc creat set daunt challeng research analysi commun challeng stem dispar terminolog data stem provid broad easi access support proper understand complex data digit govern research center establish address problem consist student inform scienc institut southern california columbia comput scienc depart center research inform access mandat conduct support research kei area inform develop build pilot collabor close govern provid user energi data collect project background energi data collect project start nation scienc digit govern program work repres feder state statist agenc organ build system dissemin statist data censu bureau labor statist energi inform administr depart energi california energi commiss inform extens monthli energi data public site receiv hundr thousand hit inform download standard web page prepar pdf year current facil support limit access rich data make visibl definit footnot explain complex natur data chang definit make incompar figur queri definit facil difficult expert project address problem year research demonstr initi result inform integr address effect method identifi describ content inform accur effici locat answer unavail wrap hundr sourc test stage inform perform research comput properti investig extract inform footnot text section ontolog construct extend terminolog taxonomi incorpor domain develop autom align algorithm term extract glossari involv automat analysi term agenc censu sic automat handl acronym creation ontolog section user interfac develop design implement complet user interfac capabl handl integr queri present result section construct deploi db extend domain model db analysi text analysi integr ontolog global terminolog sourc descript integr axiom sourc user interfac ontolog browser queri constructor queri processor reformul σ cost optim figur architectur system user queri access creat db queri retriev data system architectur order support homogen access multipl system involv princip manag access overarch ontolog term defin interfac system architectur phase lifecycl system shown figur ontolog construct phase includ work term term extract acronym handl section user interfac facilit construct queri involv ontolog interact method user interfac dispatch queri queri return result interfac displai queri answer interfac engag user queri relax dialogu section kind queri access phase queri planner consult sourc descript ontolog transform user queri optim queri plan access relev retriev request inform section inform captur integr section discuss issu sourc domain sim queri access aggreg extract inform footnot address import question data error paper sim planner domain model retriev inform multipl sourc requir familiar content queri languag locat person distribut inform ultim break retriev task collect specif queri sourc inform analysi larg number individu typic possess knowledg time requir determin find process inform perform task time consum prone error year area usa period month ca ny week subclass gener relat sourc map unit measur time seri footnot point sale date tag text regular figur fragment domain model premium product gasolin premium qualiti price volum lead approach integr statist build research perform sim group isi sim assum system design specifi global model applic domain describ content sourc web term global model sim mediat singl point access user express queri individu sourc sim translat express subset queri plan seri oper includ queri sourc relev data manipul data queri express intern loom knowledg languag sql subset limit treatment aggreg oper problem distribut oper multipl difficult potenti ineffici find averag distribut dataset fastest retriev averag number instanc calcul global minim transfer data dbmss support instanc obtain averag integr site obtain data unnecessarili discuss approach queri involv aggreg oper section incorpor model data sourc start incorpor sourc oracl microsoft access html web form pdf collect energi inform censu bureau labor california energi commiss larg amount inform form web page web sourc automat technolog ariadn system ariadn develop mark web page gui system induct learn landmark grammar extract field similar page gener wrapper code result wrapper act simpl relat accept sql dynam retriev data web page form data nativ relat wrap model associ concept descript set approxim domain organ constitut domain model requir domain fragment domain model shown figur model describ time seri data gasolin product time seri defin set dimens product type premium properti measur area measur unit time seri sourc specif valu hierarch dimens sourc provid monthli price consum price premium gasolin state california dimens metadata describ seri actual data model set measur date domain model describ sourc footnot data answer queri return footnot data tupl request model link overarch ontolog retriev time ten ad ontolog concept relationship seri valu reifi relat section discuss link perform tool facilit construct wrapper work perform andrew philpot lui domain expert eia bl automat descript sourc critic scale mediat system larg number inform sourc govern agenc fashion aggreg queri investig integr data inform aggreg data sourc inform unit state report month ten sourc type inform unit state report year sourc yearli inform discrimin state goal work conceptu present user uniform view data necessarili heterogen aggreg granular coverag main challeng integr deal data set exhibit vari granular coverag data set inform granular time month geographi citi state product regular gasolin data set inform coverag term time januari decemb januari januari geographi san ca product lead premium gasolin lead regular numer statist rang imput sophist form develop deal data mismatch scale develop approach present user unifi view data view suffici user exploit inform suffici hide granular coverag differ data set user pose queri view time correctli answer queri data set reformul queri data answer relax reformul queri find closest queri requir provid exact answer kei observ reformul data attribut follow natur granular hierarchi combin granular hierarchi result granular lattic node correspond lead gasolin data month node correspond lead gasolin data year develop algorithm queri answer level granular set data conclud answer queri lead gasolin month state long queri time state california york run decid answer user queri reformul find queri lattic provid exact distanc function granular lattic initi result algorithm illustr bl data averag price regular automat footnot extract footnot import piec metadata accompani statist tabl footnot qualifi data specif cell tabl defin gener procedur extract footnot determin scope applic footnot challeng problem statist tabl text html case govern data investig automat extract footnot link work led lui assist professor columbia collabor assist professor york phd student situat unifi view level granular data set defin view undesir result valuabl data user exploit work perform columbia assist graduat jai footnot wrapper pilot system built andrew philpot footnot text web page analyz track extent footnot associ footnot symbol footnot text ontolog construct section discuss terminolog standard ontolog ontolog practic experi shown integr data definit difficulti govern fund metadata initi disappoint result focu collect structur inform result larg data collect admir unsuit larg ontolog concept glossari linguist map logic map ontolog data sourc figur ontolog domain model small applic past year map domain collect creat map domain exist refer ontolog choic futur make statist agenc eventu gener domain map refer ontolog make publicli refer ontolog merg hope encourag align data merg content larg place structur exist larg fairli gener ontolog call built term link subsumpt addit link rearrang extens wordnet princeton gener cognit upper model isi support natur languag ident wordnet access ontolog browser ontolog project structur shown figur deploi version defin domain model approxim node repres concept present gasolin domain section link domain concept align tool section defin type ontolog link call hold concept ontolog domain model user rapidli proce concept concept real data work perform lui andrew align link domain model requir central problem term align determin term belong ontolog challeng problem imposs align ontolog taxonom automat ontolog depend larg inform english term definit recent research uncov varieti heurist identif align process procedur partial heurist make initi align suggest function integr suggest set align valid criteria heurist repeat integr cycl evalu metric full power techniqu link word foreign lexicon concept ontolog project exist match heurist definit develop match perform exhaust match concept link concept special reward begin end overlap substr match implement algorithm match gene sequenc obtain order magnitud speedup definit match compar overlap word definit concept link definit word remov implement standard vector space match algorithm effici implement develop project base expect set concept semant tend cluster insid concept organ semant close turn heurist perform appli link approxim domain model concept sim organ time write link approxim glossari item acquir eia section accuraci linkag correl target concept figur illustr accuraci ten subgroup domain measur human align concept accuraci subgroup optim match correct match perform figur accuraci align domain model concept autom align heurist work perform hovi graduat refin recod algorithm perform andrew philpot distanc cluster definit extract glossari entri problem terminolog requir special attent devot term endeavor fact agenc defin ident term differ call call salari read definit lengthi term definit import inform buri goal research definit analysi identifi set resourc agenc relev domain energi develop tool automat definit intern map lexic knowledg base uniform structur map level autom compon improv columbia automat lexic knowledg base system definit sourc page creat lexic knowledg base automat structur form set ontolog gener definit analysi work base prior experi dictionari analysi creat knowledg base automat phrase variat rule map relat term lexic resourc determin rang verif corpora confirm ambigu link phrase elimin potenti ambigu singl word term combin statist method part speech tagger appli columbia appli determin link noun phrase bigram analysi perform find colloc semant attribut tag predefin semant attribut determin analysi definit literatur definit set includ attribut arrang quantifi automat determin potenti determin run bigram probabl model entir document find attribut classifi document assembl attribut locat definit shown user phrase surround user note attribut output analysi build glossari input analyz total definit includ offici eia gasolin larger glossari glossari select term relev sic code metadata definit explan censu bureau run output automat extract medic definit lai articl digit librari ii project columbia web page show work ensur output automat input map issu due complex data acronym analysi system acronym catalogu system determin mean acronym document list possibl acronym current definit list confid marker develop abbrevi acronym frequent definit make definit uninterpret agenc domain built code initi acronym resolut link exist acronym abbrevi glossari order add guess extern resourc work led judith klavan columbia graduat brian work led judith klavan columbia graduat brian challeng problem deal acronym resolv determin acronym nf sale art auction refer network file system comput demo page permit user enter sourc data interfac extrem difficult user make product statist data web sheer wealth current system typic offer fundament user interfac access method attempt trade gener reli collect consist tabl chart design advanc answer typic question hundr make difficult user find closest answer system provid keyword search mechan user discov relev address specif queri method find inform achiev gener user construct queri user interfac expert requir intim knowledg domain structur mean queri wai result inform present address user interfac develop unifi user interfac queri present statist inform focu year project develop effici user interfac facilit user access data multipl interfac address main support queri system guid displai tabl creat integr multipl individu footnot link origin data ontolog support entir integr capabl displai concept definit graphic text method user construct complet queri dynam chang set menu dynam refer domain model design ad domain model link paramet immedi user queri taxonom ensur group menu displai interfac refer gener environ cole confer japan ca knoblock hsu queri process sim inform mediat tate advanc plan technolog menlo aaai press ambit jl ca knoblock flexibl scalabl queri plan transform approach artifici intellig ra gener organ knowledg natur languag upper model unpublish research scienc marina del ca lexic applic mit press implement data cube acm sigmod confer work perform columbia graduat jai eh combin standard practic ontolog machin translat intern confer languag resourc evalu spain autom placement concept larg ontolog prepar comput lexicon natur languag process twelfth intern confer comput linguist hungari natur languag approach term delo confer european research consortium inform manag switzerland method extract medic terminolog definit american medic informat associ annual lo california sk luk build knowledg base machin translat aaai confer evolv technolog knowledg system john sowa principl semant explor knowledg morgan kaufmann minton knoblock wrapper induct semistructur inform sourc confer autom learn discoveri pa eh hovi ontolog concept associ bilingu dictionari confer md disambigu bilingu nomin entri wordnet symposium spain russ distribut ontolog knowledg acquisit system workshop canada
ML/859 6 cooper learn composit search experi design system nagendra prasad susan lander victor lesser depart comput scienc massachusett ma blackboard technolog main street ma abstract suggest learn techniqu short term long term enhanc search effici design system agent learn requir local search process techniqu agent accumul appli constrain inform global problem gather result agent problem solv problem instanc techniqu classifi problem instanc appropri index retriev constrain inform appli problem instanc techniqu present context applic call steam show learn improv solut qualiti result introduct studi techniqu appli system improv solut qualiti result ubiquit problem system cooper search techniqu problem constrain inform distribut agent set individu agent perceiv search space bound local constraint constraint agent system problem easili address repres form explicit constraint collect process central algorithm compel reason build system make agent simpl agent complex system repres combin declar procedur knowledg captur set materi base work support nation scienc foundat grant content paper necessarili reflect posit polici offici infer explicit constraint agent oper independ solv subproblem task individu solut integr global consist solut agent local view search space avoid produc subproblem solut conflict agent solut make intellig manag conflict occur suggest learn techniqu short term long term address local perspect problem techniqu agent accumul appli constrain inform global problem gather result agent problem solv problem instanc techniqu classifi problem instanc appropri index retriev constrain inform appli problem instanc techniqu present context applic call steam remaind articl organ formal view distribut search space system briefli present steam prototyp applic lander lesser subsequ section introduc learn mechan enhanc search effici present result demonstr effect learn mechan discuss relat work present distribut search space search fundament concern artifici intellig entir search space confin singl logic search central distribut search involv state space search oper control regim partit multipl agent lesser recogn distribut search framework understand varieti issu distribut artifici intellig system distribut multipl agent requir synergist search solut mutual accept satisfi constraint global solut constrain inform distribut agent set individu agent perceiv search space bound local constraint constraint agent system distinguish local search space composit search space local search space privat agent defin domain valu paramet constrain local search set local constraint problem defin local solut space subset local search space agent ffl paramet set ij respect domain ij paramet valu ix defin local search space agent domain set discret real label interv paramet share paramet belong paramet set agent repres set agent paramet part paramet set fa fp ij gg share paramet iff ffl hard constraint hc ij repres solut requir satisfi local solut agent produc time ffl soft constraint sc ij repres solut prefer agent time soft constraint violat modifi affect abil agent produc global accept design set hard soft hc sc defin local solut space constraint satisfi hard constraint necessarili satisfi soft constraint satisfi extent soft constraint vari flexibl softer relax agent satisfi oe problem respect strategi relax soft constraint ik ik soft constraint relax strongli effect system perform lander discuss studi relat issu attempt discuss present paper local solut agent consist assign valu ij ij paramet ij local solut util measur attach facilit select prefer solut agent prefer solut solut util util defin notion project section formal descript learn algorithm local solut fp ix ix set paramet defin project fp ij ij ij xg solut space project defin constraint explicitli repres implicit procedur procedur constraint max end paramet implicitli constrain complex system case implicit constraint easili discern repres declar form suitabl share agent soft constraint steam level flexibl constraint level repres highest prefer agent satisfi constraint highest level solut evalu base constraint number constraint satisfi cost design solut satisfi constraint higher level prefer multipl design compon satisfi number constraint highest compon cost chosen composit search space cs share search space deriv composit local search space agent desir solut space system subset composit search space paramet composit search space consist gk ij gk ij gk ij gk paramet set composit space repres featur design constrain composit search space domain paramet set deriv intersect domain paramet agent paramet share paramet design system steam parametr design system produc steam motor power pump inject water chamber high temperatur steam input chamber output steam steam consist agent design compon steam agent design compon steam possess critiqu evolv partial design steam global cooper system impli local perform measur sacrif pursuit global perform agent produc compon poorli rate local particip design high qualiti steam distribut search system agent perform local search base implicit explicit constraint local context local state local static dynam constraint design compon local agenda potenti action search steam perform space partial design partial design repres partial solut composit search space initi place problem specif central share memori act repositori emerg composit solut partial visibl agent design compon produc agent central repositori agent initi base base problem specif intern constraint local state agent turn extend critiqu form complet design evolut composit solut steam view seri state transit composit solut agent plai role agent work composit solut concurr learn effici search problem solv steam start agent possess local view search solut space limit perspect search agent avoid produc compon conflict agent compon section introduc machin learn techniqu exploit situat lead conflict avoid similar conflict futur conflict driven learn cdl present negoti search lander reinterpret process form learn provid formal basi learn mechan discuss pure local view agent start lead composit solut mutual accept agent attempt extend critiqu partial detect design violat local constraint set paramet share agent ij agent extend critiqu solut detect conflict iff ij ij violat constraint explicit implicit explicit constraint share agent detect violat explicit constraint gener feedback agent partial design involv conflict explicit constraint limit simpl boundari constraint form maximum minimum valu paramet share explicit constraint share agent exchang feedback requir agent develop approxim composit search space includ local perspect explicit constrain inform assimil agent type view learn told exchang inform appli current problem instanc lemma show exchang cdl progress improv agent view composit search space set constraint commun feedback agent time detect conflict fc fc ae lemma view composit search space conflict inform assimil refin previou respect relev portion actual composit search space design lead conflict abandon agent pursu design enhanc knowledg composit solut requir exchang explicit constraint agent find mutual accept solut presenc implicit constraint share explicit constraint lead conflict exchang time result view agent composit search space approxim true composit search extent agent local view approach global agent effect learn agent learn predict composit solut requir base past experi endow agent capabl learn accumul local view composit search space requir design run view learn inform retriev futur problem instanc learn agent perform search learn discuss end agent store problem specif constraint receiv feedback agent approxim requir composit solut space problem specif agent learn suffici larg train replac process assimil feedback learn knowledg problem instanc present agent retriev set constraint store past problem specif similar present problem specif add set local requir start search agent avoid commun achiev approxim composit search space defin local domain constraint constraint similar past case case base pc algorithm base euclidean metric obtain similar past case result empir demonstr merit learn composit order demonstr merit learn experi search strategi ffl blind search learn appli agent detect conflict design pursu agent commun inform ffl learn agent detect conflict gener feedback assimil recipi agent recipi conflict inform constrain futur search singl design extend altern design ffl learn agent accumul case start problemsolv awar constraint agent commun agent algorithm find case similar present problem solv instanc initi requir constraint case ran algorithm case base steam system experi agent initi design extend exist partial design extend design critiqu partial design agent chanc perform role cycl number cycl repres good approxim amount search perform entir system problem specif consist paramet problem solv termin agent produc singl mutual accept design train cbl system randomli chosen instanc test search strategi set instanc train instanc tabl show averag cost design produc algorithm tabl show averag number cycl design wilcoxon test reveal cost design produc steam cbl cdl lower produc steam blind search level test reveal differ cost design produc steam cdl produc steam cbl cbl produc slightli design cdl cdl perform blind search initi run conflict gain view composit search space exchang feedback conflict cbl start problem solv good approxim global solut space requir manag cdl cdl gain blind cdl tabl averag cost design blind cdl tabl averag number cycl design accur view requir exchang fact past case approxim present requir cbl offset inform search initi stage result demonstr learn learn improv solut qualiti process time compar blind search learn cbl requir commun note cdl requir learn phase relat work classifi work relev topic hand distribut conflict manag learn distribut search explicit focu research small group dai research past year yokoo al ishida conri al al sycara al al investig issu distribut search implicit piec work assumpt agent homogen local knowledg tightli integr strategi agent conflict manag approach similar conflict driven learn mechan present klein develop theori comput model resolut conflict group expert agent conflict advic resolv conflict advic chosen set conflict resolut advic activ conflict class deal encount conflict klein work gener foundat handl conflict design applic system fall short conflict resolut mechan larger problem solv context involv studi issu solut inform exchang learn genesereth genesereth present strategi call progress negoti resolv conflict system agent provabl converg mutual accept solut exist converg reli crucial explicit declar exchang constrain inform system aggreg complex agent repres combin declar procedur knowledg captur set explicit constraint previou work relat learn system limit tan sen sekaran sekaran repres work reinforc learn system work highlight interest aspect learn primarili center toi problem grid world steam complex system demonstr viabil method interest learn task domain problem solv notion explicit system nagendra prasad al lander discuss organ role learn steam organ control distribut search process agent work reinforc learn agent organ plai role distribut search shoham tennenholtz tennenholtz discuss emerg convent system simpl interact shaw discuss classifi system base multiag learn system resourc task alloc flexibl manufactur system genet algorithm classifi system specif requir achiev learn complex expert difficult achiev requir relat work present weiss classifi system learn aspect system present multipl agent variant holland bucket algorithm learn instanti hierarch organ effici solv problem paper investig role learn improv effici distribut search set heterogen agent parametr design experi suggest learn drastic improv search result experi show agent reli past problem solv experi problem instanc predict kind conflict encount avoid commun feedback conflict case learn learn method present address acut learn mechan system steam reusabl agent system open system assembl minim custom integr dynam select subset catalogu exist agent reusabl agent involv system situat explicitli anticip time design learn allevi huge effort involv understand agent mechan make work refer multistag negoti distribut constraint satisfact ieee transact cybernet properti bucket algorithm intern confer genet algorithm progress strategi resolv conflict cooper distribut design conflict resolut support conflict resolut cooper design system ieee transact cybernet share guid cooper search heterogen reusabl agent ieee transact knowledg data engin distribut search heterogen reusabl system phd massachusett overview distribut ai distribut search journal societi artifici intellig retrospect view distribut problem solv ieee transact cybernet nagendra learn organiz role heterogen system comput scienc technic report massachusett learn coordin share inform twelfth nation confer artifici aaai learn adapt dai system distribut artifici volum pub emerg convent initi result observ distribut constrain heurist search ieee transact cybernet reinforc independ cooper agent tenth intern confer machin studi distribut machin learn organiz design technic report institut tu distribut satisfact formal distribut problem solv twelfth confer distribut comput system
ML/860 6 euclidean bayesian match visual recognit moghaddam alex pentland mitsubishi electr research laboratori mit media laboratori broadwai st ma usa ma usa abstract techniqu direct visual match imag face recognit search argu favor probabilist measur contrast simpler method base standard euclidean norm templat norm eigenspac similar measur base bayesian analysi imag model mutual class variat facial due express due differ probabl densiti function respect class obtain train data eigenspac densiti estim techniqu subsequ comput similar measur base posteriori probabl membership rank match perform advantag probabilist match techniqu standard euclidean eigenspac match demonstr result arpa face recognit algorithm found top perform introduct current approach imag match visual object recognit imag retriev make simpl imag similar metric euclidean distanc normal correspond standard approach recognit simplest similar measur imag set proport norm jj simpl formul suffer major exploit knowledg type variat critic express similar formul probabilist similar measur base probabl imag intens denot characterist typic variat object face defin class facial imag facial express variat similar measur express term probabl posteriori probabl estim likelihood deriv train data effici subspac method densiti estim data bayesian approach view gener nonlinear extens linear discrimin analysi techniqu face recognit nonlinear gener distinct advantag linear method larg analysi intens differ problem type differ occur match imag face recognit task defin distinct mutual repres variat multipl imag individu express light repres variat result match individu assum class seek obtain estim likelihood function intens differ likelihood defin similar score pair imag directli term posteriori probabl prior set reflect specif oper condit number test imag size sourc priori knowledg imag match bayesian formul cast standard face recognit task classif problem binari pattern classif problem simpler problem solv maximum posteriori rule imag determin belong individu densiti model difficulti approach intens differ vector typic lack suffici independ train observ comput reliabl statist likelihood densiti singular covari matric estim comput cost evalu likelihood formid comput highli ineffici major class significantli smaller effici densiti estim method moghaddam pentland divid vector space complementari subspac eigenspac decomposit method reli princip compon analysi form estim complet likelihood evalu princip decomposit illustr figur show orthogon decomposit vector space mutual princip subspac princip compon orthogon complement residu compon orthogon subspac euclidean distanc pca residu error compon li featur space refer mahalanobi distanc gaussian densiti shown complet likelihood estim written product independ dif dff figur decomposit princip subspac orthogon complement gaussian typic eigenvalu spectrum orthogon subspac margin gaussian densiti exp exp ffl pf pf true margin densiti estim margin densiti orthogon complement princip compon ffl residu optim weight paramet ae found simpli averag eigenvalu ae note actual major eigenvalu unknown fit nonlinear function portion eigenvalu spectrum estim averag eigenvalu princip subspac experi test recognit strategi collect imag feret face collect imag consist hard recognit case proven difficult face recognit algorithm test feret difficulti pose dataset stem fact imag imag condit set imag consist pair divid galleri imag consist pair imag probe set consist pair subset galleri member probe galleri dataset captur week exhibit differ hair light figur figur exampl feret imag pair galleri set probe set scale search featur warp mask head search figur face align system appli match perform affin align facial imag automat system extract face input imag normal scale slight rotat system detail estim object locat case posit scale face locat individu facial geometr align face standard normal form shown figur face experi geometr align normal manner prior analysi eigenfac match baselin eigenfac match techniqu recognit normal imag galleri probe set project eigenspac rule base euclidean distanc measur match probe imag galleri imag note method correspond gener method euclidean norm type similar figur standard eigenfac figur distribut class princip compon dot schemat distribut show orient differ princip eigenvector restrict princip compon subspac data eigenfac project shown figur note eigenfac repres princip compon set imag individu galleri probe set obtain eigenvector galleri probe set part recognit rate obtain method found correct match correct match top nearest neighbor note perform similar recognit rate obtain algorithm test lower typic rate obtain feret attribut lower perform fact imag select challeng eigenfac method match view individu galleri obtain higher recognit rate suggest galleri imag repres challeng data set imag time ident light condit bayesian match probabilist gather train data comput intens differ train subset differ match view individu random subset differ match imag individu figur interest class linearli separ simpl method visual plot mutual princip compon perform pca combin dataset project vector princip eigenvector visual shown figur scatter plot princip compon plot show complet mean differ primarili amount displai smaller intens differ expect reliabl distinguish differ direct visual interpret figur mislead essenti deal intersect origin space kei distinguish factor distribut rel orient easili determin rel orient perform separ pca class comput dot product respect eigenvector analysi yield cosin angl major ax found ffi impli orient figur schemat illustr geometri drawn approxim scale eigenvalu dual eigenfac note mutual correspond set eigenfac shown figur note variat shown figur repres subtl variat due express variat figur repres gener eigenfac code variat hair facial hair glass note qualit similar eigenfac standard eigenfac figur suggest basic intuit intens differ type span larger vector space similar volum span standard eigenspac correspond tightli constrain subspac subspac critic part formul probabilist measur facial similar fact experi larger set feret imag shown eigenspac suffici simplifi maximum likelihood measur similar section note class linearli simpl linear discrimin rank cumul match score rutger umd excalibur arl ef mit mar mit sep score figur cumul recognit rate frontal view compet algorithm feret test top curv sep correspond bayesian match techniqu note standard eigenfac match mar techniqu reliabl proper surfac inher nonlinear gaussian defin term posteriori probabl equal optim discrimin surfac automat implement invok map classif rule analyz geometri comput likelihood estim method outlin section select princip subspac dimens densiti estim default set equal evalu posteriori probabl match probe imag galleri probe imag comput differ sort match time posteriori probabl similar measur probabilist rank yield improv recognit rate warp perform recognit misclassifi feret competit result approach recognit produc improv accuraci obtain standard eigenfac match rule probabilist similar measur septemb feret competit subspac found system typic margin compet algorithm figur figur show perform comparison standard eigenfac bayesian method test note gain perform afford bayesian similar measur figur show recognit result imag separ time month cumul match score august march galleri probe rank cumul match score march galleri probe rank figur cumul recognit rate standard eigenfac match newer bayesian similar frontal frontal duplic view challeng recognit show improv recognit rate bayesian match note case probabilist similar measur effect halv error rate eigenfac match recent experi simplifi probabilist similar measur eigenfac intens differ formul maximum likelihood match techniqu maximum posteriori approach defin equat simplifi measur offici feret experi size shown result minor deficit recognit rate cut comput cost factor singl eigenspac project eigenfac probabilist match interest compar contrast conceptu oper differ standard eigenfac match base type similar probabilist similar comput shown figur repres signal flow graph method eigenfac match probe galleri imag project singl set respect coeffici differenc norm comput euclidean distanc metric basi similar score probabilist match regist probe galleri imag differenc project set eigenfac comput likelihood posteriori probabl comput applic rule eq likelihood comput form simplifi similar eq note previou section reduc comput requir factor recognit rate percentag point map ml figur oper signal flow diagram eigenfac similar probabilist similar discuss techniqu direct visual match imag recognit search larg face argu favor probabilist measur contrast simpler method base standard norm templat match templat match norm eigenspac match similar measur base bayesian analysi imag model mutual class variat face due express due probabl densiti function respect class obtain train data eigenspac densiti estim techniqu subsequ comput similar measur base posteriori probabl membership rank find match perform advantag probabilist match techniqu demonstr small larg independ test part arpa septemb bayesian similar compet algorithm type result demonstr superior perform probabilist match exist techniqu probabilist framework advantag densiti estim explicitli type variat critic formul measur similar deform facial express high irrelev measur similar base ident subspac densiti estim method repres class correspond learn method discov princip mode variat import classif task equat similar posteriori probabl obtain optim rule match recognit aspect approach differ significantli recent method simpl linear discrimin analysi techniqu recognit bayesian method view gener nonlinear version linear discrimin analysi techniqu comput advantag approach comput store eigenspac individu galleri requir eigenspac suffici probabilist match storag comput cost fix size result obtain simplifi ml similar measur eq suggest superior altern standard eigenfac match likelihood similar base densiti superior nearestneighbor match eigenspac essenti requir number project complet slightli posteriori similar eq comput cost standard eigenfac acknowledg armi research laboratori provid offici feret test result figur refer kriegman eigenfac recognit class specif linear project ieee transact pattern analysi machin juli poggio face recognit featur templat ieee transact pattern analysi machin octob chellappa discrimin analysi recognit human face proc intl conf speech signal page princip compon analysi jone poggio match linear combin prototyp ai memo artifici intellig massachusett institut novemb moghaddam pentland face recognit modular eigenspac automat system identif inspect moghaddam pentland probabilist visual learn object ieee transact pattern analysi machin juli rizvi feret evalu methodolog algorithm ieee comput vision pattern page june swet weng discrimin imag retriev ieee transact pattern analysi machin august turk pentland eigenfac recognit journal cognit
AI/861 2 concept formal illustr exampl chri matthew inform technolog school technolog environ la australia paul school manag inform scienc australia novemb abstract formal method model tool requir engin speci cation languag unambigu model system properti behaviour system drawn problem di cult model crisp term desir formal model commenc earli understand part problem domain approxim work paper identi es problem type interest argu uncertainti suggest fuzzi set theori formal model aspect paper illustr extend notat incorpor fuzzi varieti problem domain exampl present underpin discuss issu fuzzi concept invari fuzzi set limit crisp approach model concept oper add remov element fuzzi set fuzzi relat system requir seri linguist quanti ed proposit model con ict agreement possibl formal fuzzi set requir engin introduct requir engin analysi process softwar requir identi ed speci ed model speci cation page client requir engin activ role process requir analysi critic success softwar implement long accept system fault trace back inaccur ambigu speci cation client bring vagu unclear notion system challeng incomplet idea client ne process debat elicit formal speci cation rstly attempt gather understand client commun understand client system builder system model tool process creat model express understand current system identifi area chang describ nal product built di er perspect express function behaviour aspect system permit partit complex system problem smaller manag unit basi commun valid client model techniqu diagram techniqu data ow state transit diagram entiti relationship support explanatori text approach lack de ned formal syntax permit model express term open ambigu misunderstand point express model formal subject rigor analysi formal speci cation languag model tool formal approach formal method set mathemat base techniqu develop correct speci cation system behaviour properti formula page formula text form appli set explicit rule seri ned symbol symbol syntact rule form speci cation languag check result boehm ibm studi system fault trace speci cation ambigu wide accept academ comput commun situat improv recent studi failur suggest signi number system deliv fail fulli meet requir sacerdoti jackson syntact correct comput context program languag formal speci cation languag unlik abstract speci cation program languag execut design limit attent paid commun mean speci cation human execut program comput mean evid program languag formal speci cation tool system develop error omiss speci cation appar program languag focu attent set requir requir abstract model predict system identifi error omiss prior implement point formal method predict program run code write page formal approach commonli speci cation safeti critic argu appli stage system develop includ requir determin argu formal approach introduc earli requir determin formal express model provid unambigu express client requir requir engin client share common understand problem enabl issu ambigu uncertainti identi ed resolv earli commonli speci cation languag rose smith rose smith basi commun requir valid system develop methodolog base type set theori rst order predic calculu system properti model concept system chang explicitli state speci cation describ system basic build block speci cation schema group compon refer made speci cation schema provid structur speci cation describ system oper permiss system state schema calculu complex compon speci cation built set de ned simpler schema power analyt tool facilit system understand develop seri veri model sinclair till level abstract vari statement requir basi commun concret softwar design document unlik inform graphic method data ow open di er design prove rigor mathemat properti speci cation problem type problem domain natur understood term soft major focu interact peopl social technic natur substanti bodi research wilson suggest approach understand activ system import school thought underpin soft system methodolog deni complex problem de nition simpli wait uncov suggest problem construct admit exist perspect problem domain vagu intern extern potenti result valid model relev problem situat soft system methodolog attempt focu attent debat problem context differ perspect problem essenc requir engin learn detect identi cation process zadeh concept system present altern de ne system behaviour strongli uenc human percept emot legal educ system exampl system zadeh suggest individu thought process view system characterist system type human make judgement place climat uncertainti develop system attempt model human make deal uncertain ned knowledg shortli jackson term contradict describ system di culti repres system problem due part uncertainti inher problem domain uncertainti wai di culti classifi object concept class base seri attribut uncertainti class object belong simpli due lack inform word inform su cient make klir refer type uncertainti due citi con describ de cienci uncertainti natur problem domain classi cation class inform class natur discret klir suggest uncertainti properti natur languag problem domain exhibit type uncertainti interest point classi cation uncertainti type vari literatur author duboi prade lee kuo adopt narrow view uncertainti reserv term describ situat uncertain due insu cient inform context klir deal multipl perspect complex problem domain manag inconsist exist requir engin kramer dark deal current research formal method model tool system problem interest uncertainti natur vagu problem domain work alli rang attempt formal speci cation languag bridg analysi hand control develop product formal speci cation extens retain ofth origin initi work speci cation languag advantag rang autom tool check softwar speci cation check type consist level autom support unavail problem domain natur understood term di cult model boolean set theori concept opinion easili natur group interest extent resembl type rel rank class type descript realist experi attempt distinguish experienc inexperienc classifi person group hold set extent person resembl peopl hold view level custom servic provid simpli classifi good bad concept partial understood di cult de ne measur environ system requir di cult express model requir perform network cient su cient approxim statement network understand de ne perform benchmark measur work meant cient fact di cult unrealist assign mean statement type concept pro ts system perform share price low su cient express approxim understand share group peopl support literatur prototyp theori suggest uncertainti refer vagu term refer rang theori exemplar attempt explain concept categor term resembl consid typic concept class altern view prototyp exemplar structur underli principl remain boundari class fuzzi unclear instanc concept order typic concept ross chapter page kean chapter outlin theori descript support result object compar instanc prototyp exemplar class crisp boundari categori zhang de ne categor membership type fuzzi argu resolv inform context provid word overlap natur express fuzzi inher properti natur languag deal statement clever solv problem tall person make good zadeh klir boundari clever peopl clever good poor clear cut gradual amount extra inform fulli resolv complet measur person attitud argu respond extent agreement simpli respond gener suggest permit uncertainti fuzzi recent compar result support approach suggest inappropri deal person attitud requir lee yen qualit natur system requir requir state approxim heurist express introduc concept soft function requir requir hold uenc requir met attempt introduc elast system natur ect compet requir problem domain formal speci cation languag requir object concept type speci cation develop present problem fuzzi inher problem domain suggest case problem domain predominantli social technic natur danger lose part attempt repres languag requir permiss system state oper express schema hold system oper succe fail idea requir partial met system state approxim hold di cult imagin suggest advantag introduc formal approach earli requir determin express part problem domain partial understood formal model ne model issu clari ed imagin approxim understand problem domain express formal model attempt develop formal model earli requir elicit occur order facilit sort approach requir engin speci cation languag syntact semant captur repres approxim fuzzi set theori fuzzi er deal natur occur linguist fuzzi set fuzzi set theori fuzzi logic mathemat basi repres reason knowledg uncertain problem domain cox unlik boolean set theori set membership crisp element member set underli principl fuzzi set theori partial set membership permit fuzzi set theori repres concept motiv high pro product import problem context valu linguist variabl pro ts repres fuzzi set phrase pro low pro ts interpret approxim statement pro level fuzzi set theori boolean set theori common set oper union intersect fuzzi measur fuzzi subset fuzzi fuzzi logic deal truth conceptu framework approxim exact reason truth proposit motiv product worker lead high pro ts estim reason intuit manner zadeh fuzzi set theori fuzzi logic successfulli appli industri control deliv perform level similar obtain oper fuzzi method techniqu uncertainti manag commerci expert system fuzzi set relat theori possibl theori prade suggest altern analyt tool social scienc argu exist statist techniqu restrict appli model human behaviour mismatch probabilist determinist basi approach psycholog theori explain human behaviour brodi wright elast inher fuzzi set theori provid exibl tool quantit analysi social area human choic make idea instrument psycholog measur present problem motiv research area fuzzi graphic rate scale measur occup prefer al fuzzi set approach personnel select fuzzi linguist model predict risk tunnel syndrom workplac case fuzzi method basi data analysi deliv result obtain approach fuzzi set theori fuzzi logic linguist variabl valu express word numer variabl pro ts consid linguist variabl high zadeh applic idea approxim reason fuzzi set model group environ inform individu express prefer seri evid linguist express support consensu entir group action fuzzi calculu linguist quanti ed underli basi work recognit fuzzi properti natur languag suggest fuzzi set theori natur languag process fuzzi set attract interest model tool natur languag semant argu intuit risk analysi make numer rate approach impract fuzzi linguist variabl natur languag scheme build natur risk analysi system clear fuzzi method analyt descript domain predominantli social technic fuzzi set theori uncertainti due imposs make distinct concept categori uncertainti type refer fuzzi occur natur problem domain zhang current research focuss formal speci cation languag model tool problem domain type motiv system drawn socio natur model understood crisp term retain bene ts speci cation languag method commun build exist syntax semant captur vagu characterist fuzzi set theori establish techniqu repres uncertainti boolean crisp set theori set base speci cation languag provid notat incorpor fuzzi set idea languag time retain develop fuzzi set notat exist syntax matthew exist schema calculu logic structur extend set notat explicitli show set membership element extend notat fuzzi set model total function gener type real number interv boolean crisp set set membership constrain set intersect di erenc de ned oper function type provid gener de nition fuzzi relat properti rang domain restrict relat composit relat imag develop seri proof show tend notat isomorph convent set membership constrain work paper show exampl notat appli interpret exampl typic system drawn social technic problem domain interest human characterist di cult de ne partial understood attempt repres fuzzi set notat introduc matthew intent present complet part illustr scheme applic highlight limit approach appli system type illustr exampl assum reader notat languag de nition direct languag work paper overview de nition gener fuzzi set fuzzi set measur fuzzi set modi er exampl detail languag descript proof law found matthew invari fuzzi set earlier time unabl concept distinct class type overlap gradual class class linguist repres fuzzi set extend notat model concept speci cation simpl illustr pro level pro ts measur monetari term term high pro low pro ts case pro ts linguist variabl valu averag fuzzi set term speci cation extend notat model concept pro ts pr ts ts ts ts ts ts de nition fuzzi set paramet remain unchang speci cation case ts axiomat de nition begin speci cation repres pro level averag pro level consid small averag word overlap crisp boundari typic establish interpret partial set membership zadeh ross assum acquir paramet set repres collect understand peopl concept map function de ned constraint axiomat de nition ts ts ts fuzzi de ned languag de nition similar constraint develop ts ts result map function shown ts ts ts aa pro advantag approach includ fuzzi set model necessarili complet understand set paramet knowledg problem domain deepen exampl linguist variabl de ned invari fuzzi set begin speci cation includ concept demand retail student enrol educ treatment cost health system case refer set numer stage map function deliv set membership determin fuzzi set extend interest person emploi interest product experi workforc assum basic person model write state schema de ne fuzzi set repres concept sta ng emploi motiv experienc product refer set fuzzi set basic type person set membership interpret varieti membership emploi repres factor includ employ mode salari packag stage complet understand di er employ mode condit provid approxim indic employ membership emploi mean person emploi full membership emploi interpret perman employ highest salari level hand membership emploi simpli full time employ person issu remain unresolv earli stage understand concept emploi resolv seri disjoint crisp ect employ mode altern remain fuzzi membership simpli indic proport time employ motiv product concept peopl show experi product repres membership fuzzi set experi product case fuzzi set assum set membership due properti refer set unlik invari fuzzi set map function deliv set refer set element result system oper shortli fuzzi set empti initi system state nite model satisfactorili boolean fuzzi term boolean approach boundari concept high averag pro ts crisp gradual linguist variabl pro de ned seri threshold valu ts ts pro determin pro ts high evalu pro ts averag evalu ts ts concept mutual pro level high pro averag place unnatur boundari fuzzi concept similar fashion set de ned basic person model de ned power set person emploi motiv person extend notat emploi motiv case distinguish motiv person product person fulli emploi person person model doesnt product shade thing black white crisp approach restrict forc resolv uncertainti approxim prior model develop build unnatur model danger import part problem domain model lost fuzzi set oper modi er seri fuzzi set oper modi er de ned extend notat model properti approxim statement heurist describ aspect problem domain highli motiv model inexperienc model emploi experienc motiv peopl product model product experienc motiv built speci cation incorpor heurist product peopl motiv schema sta ng sta ng sta ng product product experienc assum initi state set repres product experi empti word membership refer set element set describ initi state written init sta ng emploi empti motiv empti experi empti product empti ad remov element set type involv alter membership element element fuzzi set model total achiev function overrid oper adjust membership set motiv written sta ng motiv motiv emploi emploi experi experi sta ng person dom motiv motiv emploi emploi experi experi shown empti nite fuzzi set initi system state experi product nite fuzzi set provid overrid function nite set experi product remain nite fuzzi set subsequ system state import mean countabl properti set similar subset evalu shortli properti give abil question speci cation estim set requir fuzzi crisp relat illustr fuzzi crisp show question speci detail model part health care network seri institut deliv varieti medic servic gener public model relat servic deliveri ve basic type interest client institut institut involv deliveri medic servic client peopl possibl medic er institut medic servic type er health system ag care date date date date simpl state schema describ servic deliveri institut highqual institut client satisfact client highqual satisfact fact medic servic er institut model crisp relat fuzzi medic servic er note medic servic medic servic type er date model medic servic type er institut fuzzi permit repres idea institut er type medic servic time interest qualiti medic servic er institut network servic qualiti model fuzzi relat simplic includ singl concept import model similar approach deal medic servic er system client satisfact servic er schema constraint state membership er institut relat highqual equal word interest qualiti servic er institut health care network similarli interest satisfact client medic servic er institut network state schema constraint de nition ms institut initi state set empti word servic er institut system servic system describ initi state written init empti highqual empti empti satisfact empti shown initi state permiss state empti empti highqual de ne system oper satisfact describ institut er medic servic highqual highqual satisfact satisfact shown oper succe initi state subsequ state long remain institut er medic servic element boolean set written extend notat mean convent type institut describ qualiti medic servic er institut system highqual highqual satisfact satisfact initi violat oper ect system remain initi state state constraint highqual function overrid succe subsequ state ensur highqual hold word deal qualiti servic er system doesnt necessarili er institut advantag model concept servic qualiti client satisfact fuzzi term question speci cation question de answer di cult simpli answer answer express approxim gener term medic servic er network high medic servic er institut high gener medic servic high qualiti section show question type answer seri quanti ed proposit express part system requir linguist quanti ed proposit highqual er servic highest qualiti ms institut crisp relat er servic high qualiti set equal highqual determin qualiti er servic system empti determin qualiti er servic system empti fuzzi quanti er measur de ned matthew de nition ensur er servic high qualiti greater equal er servic schema ensur servic er system answer fuzzi quanti er linguist hedg seri similar question frame client sati ed medic servic servic er system high client sati ed medic servic question seri linguist quanti ed proposit client sati ed servic high qualiti client sati ed servic high qualiti fuzzi truth proposit evalu interpret statement requir system provid determin extent system meet requir time model con ict agreement recent observ fuzzi rough set perfect candid model con ict situat presenc knowledg area fuzzi set concern pawlak present framework con ict analysi base rough set theori concept agreement con ict form part analysi treat fuzzi term system problem interest includ con ict contradict build aspect formal model illustr introduc case abstract imagin set agent stakehold set issu import agent de ne fuzzi linguist quanti ed proposit written gener term ys quanti er set object properti object al rough set crisp set de ned concept partial set membership idea element possibl belong set rough lack inform natur problem domain support agent issu issu support agent express issu extent agent agreement issu agent total agreement issu agent fuzzi relat imag support fuzzi set type indic support agent de ne term support assum agent agreement issu relat individu support issu simpl close measur absolut di erenc de ned issu de nition properti ict de ned term ict issu ict note de ned concept agreement con ict ict model fuzzi concept permit possibl word agreement con ict issu standard de nition exist extend notat time describ system state idea con support agent issu issu ict issu issu ict set agent issu nite speci cation declar free type agent issu im de ne initi state system depend view problem initi support agent issu interest case schema describ initi state init con support empti ict empti altern full support issu init schema written init con support empti ict speci cation provid oper express support issu function overrid fuzzi support con support support broad agreement agent issu interest con agent dom dom support interpret agent broad agreement rang issu interest equal equal fuzzi type support agent show issu interest ensur agent show support issu made initi support empti ensur support nite fuzzi relat imag nite countabl case basic type issu agent nite de ned free equal measur replac close measur base averag ham distanc measur membership valu relat imag set distanc fuzzi set de ned nite refer set cardin ofth cut number element nite refer set distanc measur ham distanc measur standard measur estim distanc vector ham distanc de ned distanc dom dom distanc fuzzi relat support interpret indic lack agent express support issu interest fuzzi approach clear cut indic support fuzzi de ned extend notat final note problem domain approach discuss section similar approach model extent set system requir met seri compet vendor extent set criteria met seri tender applic fuzzi approach problem involv group make establish al yager constraint oper oper succe hold rst introduc concept employ pro level write schema person set emploi peopl pro level high emploi sta ng pro ts pro ts emploi emploi emploi motiv motiv experienc experienc case extend notat pro level employ model crisp term oper succe pro greater equal threshold high pro ts membership set emploi suggest earlier concept pro level consid linguist variabl valu high fuzzi set simpli evalu pro level high determin pro level high emploi sta pro level high partial hold word consid model wai approach emploi person relat pro ts high schema approach emploi sta ng pro ts emploi emploi emploi motiv motiv experienc experienc person emploi retain set emploi ts fuzzi interpret partial set membership emploi unclear possibl employ employ idea pro ts high directli determin proport full time employ er simplist problem domain approach approach suggest hold determin oper succe illustr imagin group peopl employ statu ect pro level high group includ peopl emploi peopl seek employ schema attempt model adjust employ mix peopl concern result pro level ect employ statu individu speci ect group emploi sta ng pro ts dom emploi emploi motiv motiv experienc experienc ef form fuzzi set type ft extend support set type de ned matthew peopl ect oper desir employ statu oper complet succe nite number peopl dom emploi dom emploi ensur membership peopl fuzzi set una ect unchang measur domain restrict type nite countabl nite dom nite nite nite nite shown law matthew emploi employ adjust complet succe emploi empti ect peopl longer emploi person emploi nite partial function dom dom fp prior desir assum mp dom fp mj determin mj term mn word ect precondit simplic assum de nition count defn count mj count mn nal exce overrid mj mp mj mn mp result consist mp oper equal overrid mp result consist rst approach mn intent fulli emploi equal hold mn mj mp partial function assum pn mp dom png assum dom mj mj pn de ned de nition count dom dom assum pi dom nal exce overrid count mj count mj mj result precondit complet hold mp mj summat equal function overrid succe complet similarli hold mp mj word interest case partial hold mp overrid simpli proport desir mn gener case element domain overrid function overrid mj proport sum desir mix employ level peopl ect oper vari constraint nal employ level person exce de ned overrid function predict actual nal talk summat valu peopl ect word talk ect individu argu system problem natur understood exact term context inher uncertainti involv human make judgement argu advantag gain formal method earli system develop exist formal method languag limit appli softer problem type suggest fuzzi set theori formal model uncertainti typic system develop extens permit possibl partial set membership shown extend notat isomorph convent express crisp concept matthew paper present seri exampl illustr notat appli sort system problem identi ed emphasi aspect problem domain natur term extent natur describ concept approxim linguist numer attempt focu problem domain result continu discret ect underli fuzzi characterist problem type refer fuzzi set personnel discuss journal occup organiz psycholog fuzzi linguist model predict tunnel syndrom risk occup ergonom fuzzi logic yager zadeh introduct fuzzi logic applic intellig kluwer pp softwar ieee transact comput fuzzi fuzzi world scienti singapor shortli expert mycin experi stanford heurist program publish massachusett expert uncertainti elsevi scienc publish essex system system john wilei chichest soft system methodolog john wilei chichest applic di measur evalu psycholog qualiti quantiti fuzzi system ap brace boston fuzzi logic busi charl river media mass understand stakehold viewpoint requir de framework viewpoint technic report depart inform monash possibl theori approach process plenum york speci cation version technic report dept comput queensland speci cation languag advoc descript comput standard interfac cognit lawrenc erlbaum inconsist handl speci ieee transact softwar engin fuzzi logic commerci expert system result fuzzi set system fuzzi logic chicago chicago practic applic evalu fuzzi graphic rate fuzzi set elsevi scienc publish pp fuzzi measur concept occup social journal psycholog critic system inform system australasian confer inform adelaid introduct expert addison weslei england practic program formal cambridg cambridg fuzzi logic linguist quanti er group yager zadeh introduct fuzzi logic applic intellig kluwer pp soft consensu fuzzi prefer fuzzi consensu kluwer pp psycholinguist linguist studi natur john type measur consensu kluwer pp fuzzi int gener system neural network fuzzi jersei approach requir analysi complex ieee transact knowledg data engin soft requir yager zadeh fuzzi neural soft van nostrand pp fuzzi australian workshop requir engin pp fuzzi concept formal extend notat technic report school manag inform fuzzi extend notat toolkit technic report school manag inform cognit brace orlando fuzzi set natur languag yager zadeh introduct fuzzi logic applic intellig kluwer pp project newslett australian comput societi bulletin inquiri anatomi con journal inform scienc introduct formal speci cation prentic hall intern seri comput softwar engin fourth intern edit fuzzi logic engin york formal method inform system thayer softwar requir ieee comput societi pp fuzzi natur languag risk comput scienc rockvil fuzzi set analysi behavior social york possibl fuzzi psycholog fuzzi set elsevi scienc publish pp prentic hall intern seri comput formal method harvei speci cation behaviour semant inform kluwer pp formal speci analyt tool inform journal inform system fuzzi set theori movement social public administr review fuzzi concept ai expert singl categori scale complet captur psycholog market interpret ieee transact cybernet cybernet methodolog john wilei chichest speci er introduct formal ieee comput fuzzi logic formul function linguist speci concept linguist variabl applic approxim reason inform scienc fuzzi ieee comput knowledg fuzzi yager zadeh introduct fuzzi logic applic intellig kluwer pp sociolog applic fuzzi classi cation appli behavior scienc review fuzzi vagu gener journal pragmat
DB/862 3 construct transform cbr techniqu corpor memori manag david wilson david leak comput scienc depart indiana av corpor cbr implement abstract achiev widespread reason support corpor memori requir flexibl integr implement exist organiz resourc infrastructur reason implement construct tend fall implement constraint web implement type repres target construct corpor memori import understand strength construct transform paper describ framework relat type cbr discuss typic strength describ practic strategi build corpor cbr memori meet requir transform exist resourc introduct construct corpor memori share relev experienti knowledg organ import challeng task knowledg store process wai optim task queri central substanti manner transfer knowledg vari organ organiz goal chang import examin support mechan vari implement build maintain corpor memori paper version construct sort cbr workshop autom construct case base author research support part nasa award achiev widespread reason support corpor memori requir flexibl integr implement exist organiz infrastructur vehicl share knowledg investig implement address piec gener implement infrastructur system build cbr system construct tend fit gener implement defin broad implement constraint reflect evolutionari develop cbr practic call model implement address system goal base constraint reason task research focu method optim address specif reason demonstr effect method meet specif task goal success trend incorpor cbr system wess leverag corpor knowledg asset knowledg manag aha implement reflect addit implement constraint cbr system part architectur shimazu import implement constraint context typic cbr integr oper conjunct corpor knowledg activ preval relat system watson kitano shimazu allen al includ object system cbr implement provid make function note cbr implement cbr system emerg advantag recent develop knowledg share web watson doyl al implement reflect addit constraint cbr system conform structur document standard markup languag al note type distinct base construct reason system present inform implement web implement proprietari softwar standard gener markup languag implement factor chosen constraint repres type implement broad applic implement intend perfect repres implement target construct corpor vari task aspect context prefer import understand model individu construct transform transform task criteria suggest model differ current implement differ model aspect combin system web front paper outlin framework practic construct repres figur line repres addit inform expect plai import role build maintain corpor memori figur relat cbr implement type implement model implement appli level typic cbr find differenti cbr process recogn import complex object objectori sgml restrict discuss relat model xml implement account bulk current cbr practic system highli tune effici metric prove difficult system context effort standard amelior difficulti al widespread integr cbr implement system standard constraint commun accord tabl model relat system process adopt structur queri languag convent cbr system gain strength underli concurr scalabl integr data normal corpor task reason sql design provid perform limit refin metric difficult construct complex case difficult model manual construct xml emerg vehicl knowledg web medium definit custom markup languag applic independ exchang complex hierarch exist channel xml customiz displai inform extens style languag xml viabl transfer fairli support limit grow usabl applic cbr evolv rapidli cunningham benefit immedi individu develop standard commun knowledg share crucial task widespread field xml primarili tightli coupl process applic gener requir process direct structur queri analog develop realiz implement realiz framework automat implement transform involv outlin process defin exemplifi transform section outlin model omit section describ transform construct implement involv associ case structur relat schema figur show model typic cbr store data repres case result outcom er model fulli implement rdb construct straightforward case singl tabl row correspond case complex case relat normal techniqu model data case outcom result figur entiti relationship diagram typic reason process system cbr implement neighbor retriev number data structur literatur effici implement algorithm al standard system offer support similar metric express case retriev order similar result process place simpl storag medium case retriev process extern system combin storag benefit system process requir full implement basic queri case select simpl simpl select perform base condit appli result subset process extern shift part process task requir model effort similar relax queri specif watson basic queri select condit metric metric function order row base similar function target case system perform full analysi method comput sort record lose effici optim index metric retriev reject principl al prove comput requir case process retriev determin util method applic requir test context metric retriev good time prototyp applic case featur basic queri select order full advantag case perform simpl retriev evalu metric reduc number retriev case base model cbr figur describ structur full cbr system xml document type definit select line dtd shown xml document conform cbr dtd describ structur cbr system compon case base express relat constitu attribut complex hierarchi support insid relat insid contrast dtd cbr al process individu work implement incorpor xml dtd describ mathemat structur repres similar metric xml instanc dtd describ actual case separ xml applic gener proper structur definit separ case data actual case data defin conform instanc gener dtd process gener case data dtd cbr system ensur separ check assert structur case data separ dtd defin data structur consist data format requir reason system document type definit system attribut repres gener identifi xml attribut case data valid dtd gener consist ensur integr case data form expect dtd case data data valid perform standard xml tool xml process evolv queri languag implement enhanc applic xml cbr implement model transform implement import implement transform implement task criteria prefer model differ current differ implement model aspect combin system web front outlin transform framework xml case structur convert system xml applic process xml markup gener data definit languag statement creat tabl relat fragment cbr system relat peopl ssn make year xml fragment map xml structur relat tabl pattern translat relat ddl creat tabl person creat tabl auto make year complex case applic adopt simpl foreign kei strategi augment substructur kei parent structur order facilit futur applic updat catalog role creat tabl cbr model similar transform applic transform xml case data fill gener tabl main task transform xml implement implement identifi map xml structur assum user develop system tool inform creat case data model al applic section gener declar xml structur process similar gener gener statement sql transform exist model conform xml model model involv lack explicit case structur singl transform applic understand role object cbr maintain catalog object suggest section significantli reduc amount reason requir prior transform process role determin perform manual system user assist process determin role catalog system catalog includ role system data mine techniqu determin object role dash line figur repres extra inform requir transform convert xml format depend actual avail tool assist transform case repres map xml schema format applic built top parser present categor current cbr implement model shown view lead practic support build maintain corpor memori gener transform implement model exist implement facilit combin implement type meet chang task requir view method natur extens gener mine aid system construct base present challeng creat commun standard xml specif build set standard translat xml standard develop standard cbr function system requir shift attent build infrastructur field area constrain feasibl consequenti worthwhil commun standard long sought area ai structur foundat provid coupl impetu develop success corpor memori environ ripe achiev goal cbr provid gener framework ti world practic tool integr tradit cbr commun shape build block construct gener success research industri cbr system cbr practic expect implement type increasingli hope facilit transform refer jonathan rc david wr mauric john hugh integr case base retriev relat system aircraft technic support irma david aha problem solv knowledg manag system aaai stefan christian daniel kriegel cost model nearest neighbor search data space acm pod tim jean extens markup languag reason cooper queri answer techniqu support page michel maria barri smyth cbr smart technolog network technic report triniti colleg jeremi applic case base reason object orient retriev ian unit kingdom workshop reason dan ian watson web base reason system sale support applic innov expert system vi cunningham shape cbr view xml michel doyl distribut cbr xml workshop intellig system electron number comput scienc intern organ switzerland iso inform process text offic system standard gener markup languag kitano shimazu experi share case studi softwar qualiti control futur direct aaai michael ralph ralph jame jacqu le frank stefan common case languag consortium web union document design tata mcgraw hiroaki shibata retriev case relat system shimazu textual reason system xml web fourth european workshop reason marku stefan wess system ur und support addison queri languag watson appli techniqu system morgan san
DB/863 3 optim techniqu nonmonoton reason wolfgang faber nicola leon matei gerald pfeifer institut informationssystem tu wien austria abstract paper program rewrit techniqu disjunct datalog descend queri optim techniqu relat algebra reduc size ground instanti program case time gener ground instanti time subsequ oper ground program shorten part techniqu implement preprocess step disjunct deduct system dlv recent publish show signi reduct ground program size tremend speedup achiev introduct dlv disjunct deduct system implement consist answer set semant similar system area reason kernel modul dlv oper ground instanti input program origin input instanti procedur import instanti procedur measur term size output number rule instanti program resp size time gener instanti author present techniqu improv line paper optim techniqu descend queri optim techniqu eld relat give rule work support scienc project address correspond author deduct base comput evalu relat algebra express bodi rule assign result evalu relat head predic relat algebra express rule proj sel join relat predic join denot natur join common relat algebra express evalu project select relat system evalu relat algebra express origin proj join sel program rewrit simul project select relat algebra worthwhil note project select evalu tradit strati deduct implement deduct system novelti approach techniqu process program instanti nonmonoton disjunct order reduc size instanti program instanc de ned disjunct rule ground instanti dlv gener ground instanc preprocess step rewrit dlv proce base predic normal strati ed predic similar process gener ground instanc rule instanti process appli rewritten answer set origin provid prime predic dlv ltere main advantag obtain evalu normal strati ed program program complet dlv instanti ground instanti gener instanti process gener drastic reduct size ground instanti gener dramat improv system evidenti section paper structur section provid quick overview languag detail descript optim section present interest applic dlv domain plan conclud coupl benchmark short analysi languag dlv atom express form predic atom constant variabl liter express form negat failur extend atom atom strong negat symbol dlv program set rule constraint rule form extend atom part left call head part bodi constraint rule empti head rule empti bodi call omit case addit user de ned atom dlv support predic constant string start variabl string start letter anonym variabl denot occurr anonym variabl stand variabl di erent entir rule ground queri form translat constraint queri gener constraint semant dlv program consist answer set satisfi constraint program consist answer set nice power formal graph undirect repres fact form assign node color adjac node color simpl program figur comput legal graph node blue node edg color figur graph relat optim outlin section import ground instanti small gener time section present detail optim rule program meet syntact condit transform addit rule ad program answer set origin program answer set transform instanc auxiliari predic de ned ad rule elimin rule atom xn variabl techniqu ground proce match atom posit bodi instanc bind free variabl nest loop join algorithm match current predic backtrack previou predic match instanc uenc match atom di erent instanc obtain atom head elimin project variabl obtain auxiliari predic add rule xn xn substitut bodi gener ground instanc di er bind avoid case variabl elimin optim easili gener implement case variabl gener optim techniqu project group atom singl atom instanc rule note variabl add rule substitut rule ground instanc gener faster gener useless ground instanc avoid elimin rule bodi optim improv exploit liter liter relat argument liter narrow set ground instanc match bodi liter instanc rule set ground instanc narrow start ground ad rule replac ground avoid useless relat join oper match nding argument match instanc satisfi inequ relat liter gener techniqu consid group atom select builtin liter narrow ground instanc match bodi liter instanc rule add rule substitut rule disadvantag ground match match variabl bound match liter ground instanc obtain outlin section main advantag optim techniqu evalu normal strati ed instanti process gener drastic reduct size ground instanti worth note techniqu appli rule constraint rule empti program program obtain appli rewrit optim techniqu answer set set liter obtain elimin auxiliari set liter atom deriv rule introduc optim techniqu place order evalu answer set result support statement theorem answer set answer set answer set exist answer set applic plan interest applic ai literatur plan emploi recent research start approach domain chosen section provid natur encod problem languag benchmark section consist tabl arbitrari number label cubic block tabl block refer addit xed program shown inform actual block provid form fact languag store state time fulli speci ed relat speci es block resid locat time concept time current context discret deal limit number xed time step repres mean integ predic constant rst time time speci ed invok dlv option predic repres number de ne successor relat constant substitut kind move block locat move start point complet time time action move block locat initi block move block block resid block move block resid note arbitrari number block move ect move action move block locat point simultan action initi time action initi defin involv block initi goal situat figur sussman anomali relat inerti mean chang remain stabl time actual move place time block locat time block problem involv block initi state block speci ed fact languag task sequenc move goal state reach appli sequenc action initi state classic instanc sussman depict figur plan length valid benchmark dlv includ simpl version relat optim consid singl involv techniqu section appli option enabl disabl enabl base chose instanc size perform benchmark ram run figur detail data size ground program encount resp figur execut time nding rst answer set problem ground rule ground constraint figur ground problem block step figur execut time evid simpl form optim signi reduct size ground program tremend perform boost work implement involv gener version provid improv program inform dlv binari common edg manual test instanc project web site acknowledg review valuabl comment refer scarcello deduct system nonmonoton reason intern confer logic program nonmonoton reason number lectur note ai page springer scarcello progress report disjunct deduct system dlv intern confer flexibl queri answer system page applic logic program comput experi unpublish faber pfeifer dlv homepag gelfond lifschitz classic negat logic program disjunct gener simon smodel implement stabl model semant normal logic program intern confer logic program nonmonoton reason volum lectur note ai page juli ullman principl knowledg base system comput scienc
DB/864 3 similar queri process imag februari mv depart comput scienc softwar engin monash vic depart comput scienc rmit gpo box melbourn vic februari abstract prototyp cbir system build layer data model enabl retriev base high level imag imag mountain paper deal issu queri process encount implement system contribut paper summar term process queri imag similar base imag similar base color imag similar base imag similar base color review basic cbir queri process literatur provid process involv effici evalu combin problem attract research attent recent time fagin algorithm evalu combin function paper provid probabilist analysi expect cost algorithm base insight queri process algorithm prove perform fagin algorithm combin function problem process queri multipl exampl problem user pose queri give multipl imag process high level concept definit categor previou work process singl featur categori algorithm present techniqu process multipl multipl problem address defin semant queri strategi process tradit cost measur adequ evalu rel merit cbir queri process algorithm measur evalu queri process algorithm retriev perform addit tradit process cost result algorithm evalu measur keyword multimedia queri process imag queri evalu cbir cbir multipl introduct advanc storag process technolog made multimedia larg collect video sound transmit retriev multimedia object import research area logic common centuri relat todai imag wide multimedia applic medic geograph inform photo galleri imag retriev base index manual enter text imag user pose queri type keyword inform requir system index text retriev imag scale user retriev imag base content predefin annot view imag led lot interest content base imag retriev commerci develop academ research commun cbir system develop prototyp commerci area brought imag process commun cbir system extract imag high index index structur user pose queri give color textur draw sketch system retriev imag similar user queri rank base similar strategi algorithm similar base retriev high index structur work queri process higher explor underli index structur paper address issu process higher level queri cbir system part research build prototyp cbir system call level data model develop store raw imag extract imag featur semant inform imag layer store raw imag data extract featur store imag featur layer featur inform includ global imag featur extract imag imag object featur object system defin featur addit user defin featur provid routin comput map imag layer imag featur layer call featur extract map system defin user provid similar function spatial relationship system semant layer user semant layer semant defin user base inform lower level advanc featur system enabl user defin high level concept user refer concept queri contribut organ rest paper summar sampl queri imag identifi imag similar base simpl queri singl featur process queri straight forward imag similar base color multipl featur involv color textur featur combin function imag similar base queri multipl imag featur vector imag similar base color queri multipl multipl featur combin function section address issu process high index structur role algorithm neighbor search discuss address issu mean queri optim context cbir queri unlik relat queri cost evalu cbir queri process factor qualiti queri result queri optim base combin process cost retriev perform effort defin techniqu evalu queri optim measur evalu cbir queri process combin process cost retriev perform method evalu process strategi result report section section essenti deal effici evalu combin function encount cbir queri problem address fagin ortega al provid probabilist analysi expect cost fagin algorithm evalu fuzzi combin function base insight observ algorithm effici evalu combin function perform algorithm depend combin function algorithm base fagin defin bound properti combin function algorithm valid combin function satisfi defin bound properti standard fuzzi function min max satisfi respect bound evalu perform algorithm test bed compar result report user expect retriev imag mountain give imag mountain support qbic virag logic user expect result imag decid support queri call queri multipl process queri address section exampl queri essenti problem implicitli encount process high level concept queri user relev feedback unlik relat semant cbir queri clear semant result retriev imag relev user percept queri defin low level semant fuzzi logic categor prior research result broad techniqu singl featur queri techniqu process queri multipl problem address knowledg result perform techniqu section report special benefit cbir procedur result limit research lack standard collect imag cbir research trec text retriev research cbir system collect evalu collect make difficult compar result obtain algorithm topic discuss author particip hope research establish standard data procedur cbir research similar trec project corel photo cd collect experi broader cbir issu featur problem activ research issu orthogon queri process problem deal paper cbir queri basic perform evalu elementari queri cbir system support imag similar base process cbir system index built extract featur load imag system extract featur index appropri index structur index high featur hb tree variant similar calcul measur distanc featur vector high space approach system ibm qbic photobook visualseek netra virag candid jacob process find nearest featur vector index retriev imag summar process elementari cbir queri featur vector imag featur extract algorithm pose neighbor queri index structur find vector similar vector retriev imag displai sort similar order process algorithm rang search exact match search tree cbir system qbic structur high data question research develop index structur scale high data part project focu queri process strategi section independ underli index structur defin process elementari cbir queri high index structur compon requir process queri nearest neighbor search algorithm similar measur defin index structur encod index structur assum subsystem yield sort list imag base similar featur vector definit cbir queri specifi featur vector featur color exist index featur vector imag index similar process algorithm call subsystem subsystem return imag sort similar queri featur vector framework evalu queri process algorithm tradit queri process algorithm evalu base measur term disk access cpu time amount main memori evalu queri process strategi cbir system user satisfact qualiti queri addit cost user evalu algorithm requir disk access retriev relev good algorithm requir disk imag retriev relev order evalu rel perform measur combin retriev perform execut cost recogn import problem cbir literatur address issu smith execut cost measur evalu perform retriev system find imag ortega evalu retriev perform recal question combin cost user arriv practic measur reflect realist percept order practic briefli describ terminolog real life exampl motiv mathemat measur combin process cost user satisfact singl perform measur mathemat detail model user satisfact depend qualiti retriev result relat user percept semant pose queri user satisfi queri snow cover retriev imag snow cover mountain paramet recal adapt text document retriev literatur measur user perform methodolog obtain perform measur similar text retriev recal base notion collect imag partit set consist imag relev relev decid human judgment imag irrelev queri system retriev set queri relev set defin essenti measur rel size relev irrelev set human judgment system provid result ratio number relev imag retriev total number imag retriev ideal situat correspond retriev imag relev recal ratio number relev imag retriev total number relev imag achiev ideal recal retriev imag poor recal retriev perform algorithm provid give valu level form graph real life scenario combin real life user pai amount receiv satisfact servic ffl user train melbourn sydnei cost hour flight cost hour total cost hour cost user time straight forward find option cheaper scenario arriv model cbir queri ffl cost stai hotel user pai night stai conveni stai star hotel pai user pai heavi price margin improv qualiti situat repres cbir queri process ffl problem graduat student work research project summer student reject suitabl enthusiast interest work project student mark enthusiasm excit student mark student grade heavili penal make evalu student penal comparison student mark scenario realist cbir queri process algorithm evalu model evalu measur denot execut cost incur function memori usag cpu time number disk access retriev perform effect cost algorithm measur obtain combin combin function fi defin retriev function aim defin function appropri meet goal simpl defin fuzzi rp retriev perform vari linearli cost model travel scenario accomplish addit oper weight model realist cbir applic combin function reflect real life situat cbir system multipl suitabl scale factor combin function retriev perform defin neg doubl exponenti function number paramet measur user call parametr approach rmax exp min ch exp min ch exp min ch rmax ch paramet set user aim defin arriv realist cost measur evalu queri process algorithm cbir system state cost measur enabl user penal algorithm give algorithm give perfect algorithm give low heavili penal paramet rmax essenti determin paramet determin maximum penalti retriev perform figur retriev perform valu fix rmax ch algorithm disk access rmax mine ch tabl show comparison cost algorithm scenario paramet set ch determin rang penalti rapidli perform evalu rmax ch plot function shown figur observ algorithm penal long penal maximum tabl show evalu hypothet algorithm number disk access execut cost consid algorithm tabl effect cost comput cost model combin paramet cost bold letter correspond cost algorithm choic paramet cbir model user evalu algorithm user evalu algorithm effici evalu function section problem encount process queri form imag similar base color support system includ requir result sort list imag base similar problem address effici evalu combin function produc requir result combin function boolean complex cosin modifi cosin formula research literatur regard combin similar measur studi text retriev area combin algorithm evalu recent fagin chaudhuri gravano ortega al address problem fagin algorithm implement ibm garlic project approach fuzzi logic evalu combin function fagin probabilist upper bound complex algorithm evalu conjunct queri chaudhuri gravano strategi queri optim base notion optim execut space main focu work choic index optim execut queri threshold filter condit imag similar imag color similar greater textur similar greater result cbir system user queri seldom threshold filter condit user provid proper threshold condit detail underli similar measur filter condit threshold bad threshold result serial access select imag textur similar approach base fagin work refer algorithm queri process algorithm probabilist bound algorithm assumpt random distribut similar valu rang deriv express expect cost algorithm model practic result depend exact distribut similar determin conduct experi report result insight gain analysi fagin led observ class fuzzi combin standard min max satisfi bound properti algorithm complex queri process analysi show algorithm perform algorithm case evalu compar perform algorithm imag system color histogram gabor textur featur defin naiv algorithm process queri base fuzzi logic grade set set pair imag real number interv regard grade set return subsystem fuzzi set system displai top imag screen user view imag press button screen system provid effici evalu request naiv algorithm evalu queri find grade base color imag color find grade base textur imag textur combin grade set combin sort result grade displai top imag screen user request system displai imag sort list algorithm access color textur featur vector imag question process queri optim underli index problem queri optim retriev match imag effici manner cbir system index featur queri imag index structur research index structur studi algorithm process rang neighbor queri featur vector index structur make combin function arriv final result grade grade set return subsystem research investig combin fuzzi boolean queri imag queri denot grade queri defin ari combin function combin result queri subsystem combin function evalu conjunct queri term ari queri term denot ari queri combin function evalu conjunct disjunct queri satisfi triangular norm properti commut norm triangular norm dual fagin defin strict xm iff combin function satisfi addit lower upper bound properti defin definit lower bound combin function object queri satisfi lower bound properti iff definit upper bound combin function object queri satisfi upper bound properti iff standard rule fuzzi logic defin zadeh conjunct disjunct negat combin function framework fuzzi logic rule standard fuzzi rule satisfi lower bound properti standard fuzzi rule satisfi upper bound properti function satisfi lower upper bound properti algorithm evalu combin function satisfi bound properti fagin queri process algorithm refer fagin algorithm combin fuzzi inform queri process algorithm conjunct disjunct queri evalu algorithm cbir support subsystem definit featur involv briefli describ algorithm fagin lower upper bound analysi provid probabilist analysi expect cost algorithm sort random access comput return imag queri combin function subsystem process queri term subsystem output pair sort order similar imag step repeat repeat set imag subsystem output member imag output step repeat member imag subsystem find random access subsystem comput grade imag sort imag select top imag output provid summari analysi algorithm fagin cost process queri measur term number access type sort access phase random access phase sort access cost algorithm total number object access phase random access cost algorithm total number object access phase imag obtain color subsystem imag textur subsystem sort sort access cost algorithm access cost sum random access cost sort access cost queri atom condit requir retriev imag denot sort random access cost subsystem total access cost imag access phase subsystem access random access subsystem ki set imag access phase subsystem assum sort list return subsystem base color featur complet independ sort list return subsystem base textur mean atom queri independ fagin probabilist bound cost process queri theorem access cost algorithm arbitrarili high number imag refer bound discourag larg cost number assumpt consid cost practic imag cbir system oid hash tabl perform random access constant time realist assumpt consid probabilist averag case analysi worst case cost algorithm discourag implement queri optim understand natur queri process carri analysi probabl expect cost algorithm user number term number similar imag number imag number sort access retriev probabl make sort access probabl probabl popul size number peopl common deriv express probabl result combinatori probabl theori total number wai member chosen interest number common member assum member number denot set choic person number common obtain summat theorem sum set peopl number choic intersect express object cumul probabl figur probabl distribut requir probabl probabl retriev common imag access obtain summat probabl probabl unsuccess product write express evalu number access requir retriev similar imag note express figur show probabl distribut imag access phase observ distribut doubl exponenti narrow spread cost process queri small rang distribut implic averag cost close observ base result obtain work requir area higher valu color textur result grade grade grade figur sampl data red textur queri process algorithm fagin algorithm requir access lower upper bound properti satisfi combin function shown figur user retriev match imag algorithm requir access total access cost sort access random access list combin function satisfi bound properti access cost sort cbir system random access cost smaller constant hash tabl sort access cost number sort access major cost factor queri process algorithm difficult formal absolut optim criteria optim algorithm make nonuniform access subsystem algorithm hard find base heurist defin optim criterion class algorithm access element uniformli subsystem equal number request subsystem sort present algorithm requir smaller number sort access combin function satisfi bound properti show algorithm satisfi optim criterion discuss algorithm conjunct queri valid disjunct queri optim criterion definit criterion base number sort access minim definit queri process algorithm minimum number sort access requir uniform algorithm retriev top access element lemma algorithm combin function satisfi lower bound threshold iter evalu imag retriev element retriev iter assum subsystem output element sort definit lower bound properti contradict lemma algorithm access element imag retriev definit lemma shown queri process algorithm requir access subsystem common element phase algorithm lead violat criteria algorithm avoid algorithm analysi queri process algorithm return top imag cbir queri explain subsystem return match imag sort order queri term request subsystem return imag subsystem output grade set pair imag similar imag return subsystem current random access subsystem find comput threshold element retriev subsystem current iter comput grade imag retriev iter updat set imag grade iter step set imag output grade set prove correct algorithm theorem queri algorithm correctli return top satisfi bound properti clear member assum exist imag case combin algorithm satisfi lower bound impli smaller definit assumpt base lemma case combin algorithm satisfi upper bound impli greater definit assumpt theorem queri process algorithm algorithm access element subsystem retriev top element definit bound properti lemma proposit number common element retriev sort access algorithm algorithm theorem lemma theorem probabilist access cost algorithm bound arbitrarili high probabl number common element retriev subsystem sort access proof proposit proposit access cost queri process algorithm equal singl step result order studi rel perform algorithm implement system algorithm implement experi run sun solari unix machin set imag obtain world wide web test data imag size pixel format experi featur similar function cost number access exact number disk access imag cumul probabl algorithm algorithm figur probabl distribut algorithm algorithm expect sort random total expect sort random total figur number access set color textur featur extract imag color featur imag repres histogram gabor function obtain textur imag repres vector queri vector obtain randomli select imag extract featur queri imag similar imag color vector textur note number sort random access total access requir subsystem retriev match experi repeat queri imag select randomli figur plot cumul probabl distribut requir number sort access subsystem algorithm repeat experi valu consist result obtain shown figur list access cost algorithm expect cost calcul probabl distribut sort access requir result averag number element access subsystem total cost sum random sort access call cost note algorithm outperform algorithm process imag user expect retriev imag mountain give imag support qbic virag logic user expect result imag refer queri multipl support exist system support problem implicitli encount process high level concept queri process user relev feedback exampl encount imag similar base imag similar base color process point classifi singl featur queri multipl featur queri strategi process base figur neighbor approach effect nearest neighbor approach space region approach space queri semant defin assum system relev featur extract store index structur support rang access requir definit function call process algorithm subsystem return similar element base similar element queri featur subsystem return element featur rang subsystem return similar imag queri featur vector function requir featur index direct access hash definit queri imag queri db queri imag db definit process algorithm call queri pose user result includ imag queri db nn nn result queri set similar imag call properti algorithm process algorithm queri pose user imag queri result algorithm desir user point view singl featur queri run subsect retriev imag similar base color imag color featur system concern broad approach process effect nearest neighbour nearest neighbour region base singl effect queri point comput similar search made knn nearest neighbour search made region base approach rang search capabl index structur figur show basic idea approach approach effect queri comput techniqu queri point movement techniqu mar effect queri point comput centroid queri feedback queri point move good exampl bad queri effect point comput iter give weight exampl base user feedback distanc function distil inform exampl queri coeffici impli distanc function standard euclidean distanc circl weight euclidean distanc align coordin axi function describ necessarili align coordin axi knn approach nearest neighbour queri point determin pose nearest neighbour queri featur index featur index return list pair similar sort output techniqu call singl search balanc search weight search weight search region base algorithm imag similar featur close high featur space cluster index high search base region idea defin region requir high level concept featur pose region queri algorithm make call make call creat row featur imag comput minimum bound rectangl queri featur vector column minimum store maximum vector determin requir queri region region extend amount care boundari effect ensur data point close queri point comput queri region includ pose queri color subsystem number element retriev region expand factor call final result comput retriev imag appli techniqu ffl find similar imag retriev queri point combin max function essenti neighbor approach result imag select output result ffl determin effect queri point comput similar imag retriev call imag select output result figur show work algorithm featur space rectangl show comput queri region queri point lie queri imag includ result retriev perform algorithm good featur vector relev imag queri imag happen boundari summari knn region approach satisfi properti base approach feel process algorithm possess properti user point view result properti user make system unfriendli detail state standard benchmark test cbir queri process algorithm collect imag research accord consensu reach corel collect imag data collect corel imag chosen manual classifi set imag predetermin relev irrelev imag human judgment recal knn region figur sunset color knn nearest region region approach result consid global color textur carson result human percept color featur vector textur gabor textur featur vector featur vector imag extract store appropri evalu perform pose queri high level concept pose ten queri queri set imag randomli valu comput base system manual judgment repeat textur featur retriev perform algorithm set queri shown figur observ region algorithm work color space graph present give visual intuit reader postpon discuss detail perform evalu algorithm section multipl featur multipl imag user select multipl featur imag dynam user chang featur imag queri exist system support featur enhanc capabl system requir process multipl complex problem queri run describ algorithm retriev imag similar base color textur low level semant interpret multipl imag multipl featur shown figur queri singl featur multipl imag queri break queri singl imag multipl featur queri queri process algorithm featur prioriti approach queri singl featur queri process individu algorithm result combin algorithm defin section tree queri semant shown figur algorithm perform oper featur queri tree process data driven algorithm describ standard fuzzi function min max comput simplic algorithm remain combin function describ low level semant queri interpret comput final grade figur queri semant tree base featur prioriti approach ij similar imag imag base featur requir result sort list imag base queri semant tree process ffl leaf node process algorithm retriev similar imag ffl node process max function result obtain child node ffl node process queri process algorithm ffl result size repeat step output result imag prioriti approach queri singl multipl featur queri queri process algorithm defin section result combin combin function max fuzzi figur show tree queri semant algorithm perform oper queri tree process data driven algorithm algorithm term fuzzi function min max comput oper algorithm valid function queri retriev imag similar base featur low level semant queri interpret comput final grade ij similar imag imag base featur requir result sort list imag base process queri semant tree process ffl leaf node process algorithm retriev similar imag ffl node process queri process algorithm ffl node process max function result obtain child node ffl result size repeat step output result result evalu algorithm process multipl experi similar earlier repeat queri pose ten queri queri set imag randomli valu comput base system manual judgment retriev perform algorithm set repres queri shown figur observ imag prioriti approach retriev perform type queri postpon discuss result section figur queri semant tree base imag prioriti approach recal figur sunset color textur cost model analysi cost model execut cost base number object access subsystem defin earlier paper similar fagin object access subsystem interfac cost sort access cost number element retriev subsystem call subsystem retriev imag sort access cost algorithm call find similar imag incur unit direct access cost region access cost total number object retriev algorithm function execut cost total number object access subsystem cost model mention disk access requir region sort access higher direct access region access cheaper sort access region data cluster disk page execut cost algorithm measur term number disk page memori cpu process cost aim model rel perform queri process strategi result valid cost measur similar number disk page access function call depend index structur subsystem index imag featur color textur note perform model independ type measur evalu execut cost present perform evalu detail algorithm base result perform evalu algorithm queri imag similar base color evalu algorithm tabl show result experi discuss earlier section execut cost shown number imag access region approach show effect cost comput cbir cost model discuss earlier valu queri execut cost effect knn region knn region knn region flower mountain sunset tabl effect cost base color number disk queri execut cost effect cost knn region knn region knn region flower mountain sunset tabl effect cost base textur queri execut cost effect cost flower mountain sunset tabl effect cost base color textur explain set result shown row tabl algorithm incur cost access choic comput valu algorithm conclud algorithm chang effect cost note valu algorithm remain independ due high make user fulli satisfi penalti lower execut cost higher penal poor retriev perform heavili base draw ffl process singl choic algorithm depend featur color knn approach perform approach tabl gabor textur approach perform approach conclud retriev perform algorithm depend distribut data point queri point featur space ffl knn region approach region base algorithm ffl algorithm retriev perform low recal valu higher recal differ retriev perform ffl execut cost approach process multipl featur approach ffl base observ approach approach process choic process algorithm depend distribut data high featur space cbir queri optim make statist measur decid process strategi statist comput store relat algorithm effici algorithm queri featur space problem solv paper address issu cbir queri encount system develop problem retriev imag similar queri imag pose user research access process simpl queri recent research address problem process complex form cbir queri classifi cbir queri complex queri multipl imag discuss process elementari cbir queri exist high index structur queri involv combin function process fagin algorithm probabilist analysi fagin algorithm supplement bound insight arriv algorithm deriv bound algorithm test bed real life present show algorithm perform singl step algorithm scope heurist inher complex problem investig issu problem encount cbir system process queri multipl imag problem occur process relev concept user pose queri put prior result process queri singl featur knn method present result compar approach properti queri process algorithm defin user algorithm properti knn region base approach algorithm approach base region base approach algorithm address issu process queri multipl address knowledg strategi present definit semant result perform evalu techniqu tradit adequ evalu cbir queri process strategi develop framework defin perform evalu measur combin execut cost qualiti result result evalu perform algorithm present attempt address process strategi evalu framework cbir queri work includ select process strategi base distribut data queri point high featur space suitabl measur compar similar function cbir system investig cbir queri process import area infanc expect categor algorithm evalu measur research activ futur area refer norbert ralf schneider bernhard seeger effici robust access method point rectangl acm sigmod intern confer manag page atlant stefan christian bohm kriegel pyramid break page stefan daniel keim kriegel index structur data vldb page ramakrishnan shaft proc carson virginia storag retriev featur data larg onlin imag collect bulletin ieee comput societi technic data volum number page decemb marco la queri system video volum page chakrabarti mehrotra hybrid index structur high featur space fifteenth intern confer data page march surajit chaudhuri lui gravano optim queri multimedia repositori bulletin ieee comput societi technic data page william wimmer queri multimedia data multipl repositori garlic project work confer visual system march david lomet salzberg hb index support recoveri node consolid vldb volum number page ronald fagin combin fuzzi inform multipl system proc fifteenth acm symp principl page wayn jonathan qian byron monika jim deni david steel peter queri imag video qbic system volum number page septemb gupta visual inform virag perspect technic report virag suit san ca guttman dynam index structur spatial search acm sigmod confer manag page christo faloutso queri multipl exampl ashish od shmueli jennif widom intern confer larg data august york page morgan michael cannon donald hush queri imag candid approach volum storag retriev imag video page cl liu introduct combinatori mathemat book wy ma bs manjunath toolbox navig larg imag ieee intern confer imag santa bs manjunath textur featur retriev imag data ieee transact pattern analysi machin volum number page august queri process issu fifteenth intern confer data page march layer schema imag data model chri mcdonald australian comput scienc vol australasian page fuzzi system content base imag retriev ieee intern confer intellig process page gold virginia michael stonebrak relat imag ieee volum number page septemb huang support rank boolean similar queri mar ieee transact knowledg data engin accept public picard sclaroff tool content base manipul imag intern journal comput volum number page michael ortega chakrabarti similar search multipl exampl mar intern confer visual inform system june kellei vincent nearest neighbor queri acm sigmod intl confer manag page june yong thoma huang chang imag past present futur journal visual commun imag volum page gerard salton automat text retriev al comput simon ramesh jain similar queri imag ieee intern confer comput vision pattern san june thoma kriegel optim neighbor search acm john smith chang fulli autom imag queri system acm novemb multimedia index retriev annual intern acm sigir confer research develop inform retriev august workshop mv ja index spatial data class linear map function intern confer inform page
AI/865 2 robot soccer percept multiag control manuela veloso peter stone han comput scienc depart carnegi mellon pa abstract robot soccer challeng research domain involv multipl agent collabor adversari environ achiev specif object describ team small robot agent develop enter competit design built robot vision develop implement algorithm strateg collabor robot uncertain dynam environ robot organ hold specif pursu goal game demonstr collabor behavior multipl occas robot switch role maxim perform team present overview vision process algorithm successfulli track multipl move object predict trajectori paper focuss agent behavior rang individu behavior strateg team behavior cmunit won competit japan introduct problem solv complex domain involv multipl dynam learn feedback previou experi robot soccer complex task multipl agent collabor adversari environ achiev specif object robot soccer offer challeng research domain investig larg spectrum issu relev develop complet autonom agent natur domain necessit realtim coupl quick behav make behavior make process rang simpl reactiv move directli arbitrarili complex reason procedur account action perceiv strategi teammat oppon innov techniqu abound pursu research robot soccer domain robocup initi includ simul leagu robot leagu research extens simul develop learn techniqu team strategi simul team strategi directli incorpor robot system appli machin learn techniqu acquir hard tune boundari behavior real robot focu present team small robot agent enter complet system cognit capabl develop physic robot vision process algorithm perceiv strateg reason individu collabor behavior team ultim version multipl autonom agent develop previou version team present discuss improv team part research repres major advanc work interest contribut present ffl reliabl percept filter vision process algorithm track multipl move predict object inevit sharp trajectori occur ffl set robust behavior individu agent agent equip skill enabl effect perform individu collabor action ffl multiag strateg reason collabor robot achiev flexibl approach task space agent assign flexibl team structur agent organ homogen agent flexibl switch role altern plan collabor pass teammat shoot goal control metric evalu ffl demonstr complet integr cognit team multipl robot agent combin robust intellig control code repres challeng successfulli meet work paper fulli implement figur show pictur robot agent hardwar descript paper organ section present vision process algorithm section focu agent behavior rang individu multiag behavior section report experi robot robot competit conclud figur robot team compet percept multipl agent robot leagu setup view complet autonom framework physic navig robot video camera plai field connect central interfac client mind robot player figur sketch build block architectur transmit interfac client modul client modul client modul client modul client modul raw vision data action code action code object posit figur cmunit architectur global percept distribut reaction complet system fulli autonom consist challeng process cycl global vision algorithm perceiv dynam environ process give posit robot ball inform control distribut agent algorithm agent evalu world state strateg knowledg decid action motion command control radio commun command broadcast directli individu agent robot identif binari code detect command intend robot complet system fulli implement fit vision system robot small interest quickli move strateg multiag research opt global vision system part research investig develop team robot capabl local percept part challeng develop approach individu robot autonomi consist combin sourc local target broadcast commun fact percept achiev video camera complet field offer opportun global view world state setup simplifi share inform multipl present challeng reliabl process movement multipl move agent agent oppon team section focuss present vision process algorithm accuraci make major contribut success team detect vision requir robot soccer examin research robot soccer research investig vision processor due reactiv soccer robot framework requir high percept process cycl time due rich visual dedic processor dsp vision system successfulli surprisingli consist transfer camera process slow processor detect mechan simpl robocup rule defin color object field major cue object detect robocup rule green color field white mark side specifi yellow blue color circular area top color team singl color patch robot provid orient inform ad addit color patch top robot ball orang golf ball differenti color straightforward manner set detect patch unord detect color patch top robot match distanc constant distanc pink orient match patch distanc patch mark robot captur posit orient inher vision system detect current system magnitud spuriou detect frame system attempt elimin detect method color patch size match robot discard techniqu filter ad distanc match mechan briefli detect elimin data associ data associ address problem retain robot identif subsequ frame obviou approach differenti number robot detect number color simpl find robustli distinguish color assign share green orang white field blue yellow team color inevit variat light condit area field make detect associ mechan fulli base separ color fit robot color top attempt made differenti color data associ approach solv problem retain robot identif subsequ frame robot color marker greedi algorithm retain associ base spatial locat robot consecut associ maintain search minimum distanc current robot posit match closest posit previou account size robot estim veloc algorithm robust noisi theori find optim correct match practic detect associ approach highli reliabl track predict set robot soccer abil detect locat object field real soccer essenti robot predict futur locat ball extend kalman filter filter suitabl detect ball locat noisi ekf estim possibl nonlinear system goal filter estim state system state denot vector set equat describ behavior predict state system uk wk function repres behavior uk extern input system wk gaussian random variabl covari matrix qk wk captur system discrep physic system denot time system model observ observ zk vk zk vector observ nonlinear measur vk gaussian random variabl covari matrix rk captur observ process ekf involv iter updat propag current estim system state error covari comput iter updat current observ refin current estim recomput covari propag state covari system time step calcul system equat process iter altern updat propag step care adjust filter paramet model achiev success track predict ball sharp bounc occur vision process approach work perfectli game detect track move object oppon predict movement ball provid ekf agent behavior goalkeep ahead time predict defend posit goal suffer due predict ball posit multiag strategi control achiev multiag strategi combin accur individu collabor behavior agent reason persist reactiv behavior develop aim reach team object behavior order successfulli agent requir robust basic skill skill includ abil place abil direct ball abil intercept move ball skill execut avoid obstacl wall robot navig movement control reactiv control control strategi modifi version simpl vehicl love vehicl defin reactiv control mechan direct differenti driven robot destin point similar behavior requir love vehicl control mechan simplist start converg goal slowli modifi set reactiv control formula effect adjust control ff sin fi direct target rel ff fi base translat rotat set control formula differ love vehicl account orient robot respect goal explicitli add rotat control robot hardwar includ motor robot turn front back robot absolut term navig robot effici switch direct turn ball handl robot accur direct ball target approach ball direct ball predict return vision process robot aim point side target posit robot equip method ball move ball target ball wait move ball cross path intercept target ball collect robot consid line target posit ball current predict depend ball move robot plan path point line ball hit ball end face target posit robot target figur illustr behavior target intermedi robot ball line line final ball target figur ball robot comput line ball target line ball perpendicular line robot side line aim intermedi target side ball avoid hit ball target robot aim point directli ball line target ball intercept behavior robot consid line target posit determin ball path intersect line robot posit line point intersect time ball arriv robot ball handl routin base ball eventu cross path point robot intercept goal robot ball intercept ball collect ball aim ball predict locat fix time futur eventu posit place intercept ball target obstacl avoid robot soccer obstacl robot goal locat robot avoid plan path obstacl due highli dynam natur obstacl avoid algorithm control robot continu replan goal posit obstacl event obstacl block direct path goal robot line line ball target point intercept final ball target intermedi figur ball robot comput intersect line target posit ball line trajectori robot posit fix distanc intersect move forward backward time requir stop posit distanc ball robot final target ball time intercept point robot aim side obstacl posit move directli origin goal plan entir path goal locat robot ahead obstacl assumpt robot continu move reactiv control robot continu reevalu target posit figur robot line intermedi target obstacl final robot target figur obstacl robot start straight final target line obstacl distanc line aim intermedi target slightli obstacl robot obstacl short edg field reactiv robot continu recomput line obstacl longer path aim addit intermedi target obtain path final target obstacl avoid robot stuck robot wall oppon robot obstacl inevit unabl robot identifi sourc problem closest obstacl move normal control resum multiag behavior behavior effect singl robot robot simultan chase ball shoot chao result order achiev coordin multiag organ robot flexibl team structur team defin set posit behavior robot dynam map posit robot equip knowledg requir plai posit format posit area field robot move default situat activ mode determin robot move ball robot ball shoot pass teammat pass evalu function multiag behavior origin develop simul transfer code pass evalu function redefin flexibl team activ mode posit defin flexibl region player attempt move ball robot plai posit remain side field oppon goal ball posit classifi base locat region behavior specif term posit consid potenti section time robot plai posit field robot knowledg plai posit robot posit fly robot switch posit robot chase ball region robot robot continu chase robot move posit vacat posit player collect commonli format collect posit consist attack format consist defend attack figur case robot switch format base condit team lose time left robot switch format format condit switch posit format decid call order elimin complex negoti protocol default action robot posit face activ mode robot default behavior occur robot inact state ball robot activ state activ robot move attempt pass teammat figur defin format posit format repres behavior role attack posit shown notic posit format shoot goal base evalu function account teammat oppon posit section robot intend receiv pass move auxiliari state intercept move ball goal current function set robot closest ball activ intend receiv robot auxiliari robot inact state evalu collabor opportun main featur robot abil collabor pass ball activ robot evalu function account teammat oppon posit determin pass ball shoot part format posit set posit consid pass defend pass forward forward pass backward midfield defend posit occupi robot evalu pass posit evalu shot evalu robot comput line segment ball receiv shoot ball figur case line segment consid pass shot product relev robot pass shoot multipli valu factor determin rel proxim activ robot potenti receiv goal robot pass shot maximum line segment comput algorithm correspond figur oppon ffl comput distanc distanc ls end ball kick robot figur ffl defin constant oppon farther consid discount distanc consid larger figur oppon goal evalu actual distanc ball reason distanc oppon time block extra distanc longer ffl return line line robot oppon teammat ball goal line figur pass evalu pass robot consid open path ball teammat teammat goal evalu consid line ball goal oppon line comput oppon distanc segment segment origin smaller larger easier oppon intercept ball note oppon discount valu pass segment reflect easili oppon intercept pass subsequ shot closer oppon line farther chanc intercept ball goalkeep goalkeep robot special hardwar special softwar switch posit activ mode goalkeep physic frame distinct robot long rule block goal goalkeep role prevent ball enter goal stai parallel close aim directli ball coordin field simpli stai ball ball past goalkeep robot fast ball defeat behavior goalkeep continu monitor ball trajectori case move ball predict destin point ahead time move predict ball posit crucial illustr figur current function goalkeep stai front goal step move stai closest edg goal condit goalkeep move ball predict locat figur ffl ball speed larger minimum threshold ffl ball zone figur side ffl ball move point minimum distanc goal goalkeep stai ball coordin figur goal goalkeep ball fast slow ball zone figur goalkeep ball coordin move ball predict illustr ball ball situat goalkeep move ball predict goali move dot oppon intercept ball goal goalkeep behavior ball coordin move ball predict locat discuss successfulli demonstr feasibl effect team multiag robot system major challeng integr rang percept strateg multiag reason cmunit fulli implement multiag system loop close implement interest strateg includ agent collabor evalu altern action gener difficult accumul scientif result test team robot extend run prohibit batteri limit difficulti robot oper concurr resourc build singl team spare offer restrict evalu cmunit base result effect game plai includ anecdot evid multiag capabl robot soccer team robot team plai game robot team nara institut scienc technolog pari franc spain result game tabl oppon score girona total tabl score cmunit game small robot leagu won game score thirteen goal score cmunit goalkeep attack situat franc refin goalkeep goal present section observ goalkeep error match spectat notic team behavior section robot switch posit success pass impress goal tournament result pass robot pass pass shot ball goal robot behavior visual appeal entertain spectat peopl attain appreci difficulti task control singl robot joystick program develop peopl children found difficult maneuv singl robot direct ball open goal peopl impress facil robot defend awar issu open research develop systemat identifi address team version enhanc robot behavior machin learn techniqu acknowledg develop build robot research sponsor part advanc research project agenc rome air forc materiel agreement number part depart offic naval research contract number view document author interpret necessarili repres offici polici express air depart offic naval research unit state govern refer peter manuela veloso build dedic robot soccer system workshop page novemb minoru alexi maja peter hiroaki kitano robocup physic agent appli artifici minoru hosoda behavior acquisit real robot reinforc learn machin vehicl experi synthet psycholog mit han manuela veloso reactiv visual control multipl robot agent intern confer robot kalman result linear filter predict theori journal basic page march hiroaki itsuki minoru hitoshi osawa challeng problem ai ai spring hiroaki milind peter manuela hitoshi itsuki minoru asada robocup synthet agent challeng fifteenth intern joint confer artifici page san morgan kaufmann maja matar design understand adapt group behavior adapt decemb michael alan rod stewart control robot testb ieee intern confer page randi bill carl ann wright dynam object captur fast vision track ai spring ali sheila build integr mobil robot soccer competit intern confer robot peter stone manuela veloso simul team hiroaki robot world cup soccer game confer springer press peter stone manuela veloso layer approach learn client behavior robocup soccer server appli artifici press peter stone manuela veloso task dynam role commun strateg teamwork submit artifici peter stone manuela veloso tree confid factor multiag control hiroaki robot world cup soccer game confer springer press manuela peter team hiroaki robot world cup soccer game confer springer
IR/866 5 site find link anchor inform nick craswel david hawk csiro mathemat inform scienc australia abstract rank method literatur appli commerci web search engin recent trec tradit method conduct type task find main entri point specif web site rank base link anchor text effect rank base document method formula obtain result set queri million document set set million document set site find effect begin explain search engin adopt link method open rich area effect tradit method fail keyword citat link web evalu introduct web site user find manual maintain directori web site size volatil effect automat site find interest research problem compar site find effect rank method rank method link method make hypertext structur web link rank base incom outgo link content method rank base text content past trec experi found link inform enhanc retriev effect small larg web track found link method method permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee septemb usa copyright acm stephen robertson microsoft research uk tive result enthusiasm research industri link method experi base trec static test collect blind examin pool result trec experi base subject search experi base site find task link anchor method propag link anchor word sourc target document trec experi link method section experi evalu site find effect show effect enhanc describ site find problem rank method introduc evalu methodolog evalu site find effect present site find compar effect link method discuss site find problem difficult defin term introduc adopt amento al site organ collect page specif topic maintain singl person group site thing thousand site host note site broad cover broad rang subject matter rang servic note import featur site page publish coher sourc inform sigir web site paper author publish site includ definit site subset larger site microsoft word site part larger microsoft site site main entri refer home page page introductori inform site navig link main page connot simpli call entri page case entri synonym cnn site paper found trec web site site find task user find queri site search system succe task return entri page requir method return list correct answer close top rank subject queri describ topic interest result list relev document site find similar item user item item search user item site find involv unknown site site find queri requir site item search queri describ topic site find exampl altavista site find queri imposs confirm user find offici michael home find web site fun site date pattern offici star war notic question start user site locat site find queri categor modem pc learn dog wet trec system base okapi formula present found highli effect answer queri comparison commerci search engin altavista exampl user exist cnn home typic web queri interest method work typic web deal shorter queri list tabl question queri disambigu imposs determin user specif web site word queri experi assum user type queri specialist site find hope find specif site definit detail site find queri user singl web site tabl slightli user multipl site gener topic left futur studi search search site entri page multipl url url good answer occur offici mirror site altern domain altern file page forward user directli page case includ multimedia home page url flag correct answer manual examin pool result mirror lack author true site alter date respect offici site evalu base rank correct answer credit return page link correct answer page requir work find page link futur link page cost make experi complex link page rank correct answer rank correct answer link page correct site find practic specialist site find servic exist map keyword entri automat method number system state site tune exampl automat engin googl feel button gear specif web hand made directori methodolog studi system googl evalu tune compar manual system current evalu site find publish studi conduct control environ larg number queri previou small experi brin page show top commerci engin capabl find site entri page search engin watch march includ tabl engin find experi web site background link method section background inform link method relat issu experi evalu link method base anchor fulli section context queri correct answer random kennedi space center dayton wide web doug imag data servic infoseek cake european institut media liber democrat ram mobil data limit scope resum bank princ william ic forum ucla visit britain anu strateg defenc studi centr graduat program statist wood workshop centr scienc engin materi gender relat centr graduat program polit scienc faculti econom commerc bruce hall studi nation centr popul health tabl queri pair chosen random test set site find task find correct answer url correct answer set url judg rank method hyperlink relationship document part document sourc document link sourc document text target document refer case anchor user sourc case underlin acm site user select browser displai target document rank queri set gener rank list document entri page site close top list rank method link target possibl anchor gener rank list link method divid depend altern assumpt topic local anchor descript anchor text method evalu paper base anchor descript assumpt recommend assumpt link page author recommend page high highli rank highli base simpl link count calcul page weight iter propag recent studi found link recommend method good job pick high qualiti judg human expert judgment qualiti properli evalu recommend bharat reliabl defin measur aspect assess import end endeavor topic local assumpt page connect link topic recent studi found assumpt true topic local assumpt make reason propag match score link spread activ perform probabilist argument page page rank highli anchor descript assumpt anchor text link describ target link mention anchor text describ make reason index anchor text occur target sourc link method evalu propag anchor text section rank method commerci search includ googl incorpor link recommend inform googl associ link anchor text target document awar search engin rank base topic local trec experi link text retriev confer primarili concentr subject perform govern document recent expand search question document includ web collect web collect base internet archiv crawl million page gigabyt collect million document subset collect million page subset trec task compar link method base subject search task small web track compar method find link larg web track incorpor pagerank rank enhanc effect main web task result final indic link subject search critic ground link graph small incomplet link method work million commerci engin index million studi link graph smaller recent crawl suffici evalu methodolog evalu corpu fix test corpu hypertext document identifi queri pair identifi set pair number repres user type order find site entri page run method method run queri corpu examin result examin pool result identifi url mirror measur effect appli effect measur case multipl correct measur top rank test corpu simpli document set effect site find gener web crawl crawl queri pair describ queri underli type queri order find sigir web site rank method appli case limit output top rank document web search engin produc top rank desir place find correct answer top top pool result examin similar trec ad hoc present union result human judg judg criteria judg identifi document pool relev queri user judg simpli identifi url expect correct answer wai section requir answer reward commonli quot effect measur trec averag top rank correct answer averag reciproc rank top rank document chose reciproc top princip measur present document retriev histogram rank correct answer comparison method queri superior number queri difficult aspect design decid queri pair pair chosen spread popul site repres spread site includ evalu experi limit impact consid site interest comput scientist realist queri web user typic type short site requir site find queri evalu miss word offici ad extra word ideal larg sampl queri repres sampl web user publicli test collect type lack time resourc undertak methodolog sound survei web user fall short ideal consid approxim method prepar data refer select pair select involv randomli queri search log identifi site plausibl correct answer queri queri search identifi correct answer gener problem approach interpret correct reflect real user underli queri encount addit problem approach context experi due incomplet ag data small proport queri correct answer queri answer exclud give method chanc method capabl find link involv randomli pick site entri page manual gener queri random entri page web directori page randomli collect navig entri page site link edit url suitabl link randomli chosen page registr page navig lead confer site entri page approach advantag gener repres sampl popul site disadvantag queri formul repres queri submit gener user popul easier deal queri gener problem decid appli variant select method experi compar simpl link anchor method content minim differ method implement okapi formula page includ length normal control case relev feedback stem emploi content method index textual content document queri correct answer document textual content excit home wine card music flower gift excit search power competit search entir web search search excit web review search usenet newsgroup search tip advanc search submit info destin visit refer peopl finder yellow page email lookup travel search sharewar resourc free start page bookmark excit excit direct free search engin inform feedback add url excit job excit excit web review insight million document anchor method text base anchor descript build anchor document anchor text incom link page link anchor text word ad time anchor document base correct anchor document excit excit excit search view excit home excit search engin excit exit cite excit net search link page excit entri averag anchor document larg million anchor document method compar document set queri pair recent document crawl australian nation web server set pair gener random page navig nearest entri gener queri case navig due entri page page queri gener page discard set pair gener list collect randomli chosen link live gener queri select manual maintain web list site popular averag web site set pair gener base page list hundr web site site correspond teach research unit randomli chosen page gener queri set queri gener queri base spell mistak case replac abbrevi case word ad omit ensur simpl queri match titl page question endeavor queri averag queri length stop set queri word pair tabl chosen queri word occur requir document simpli compani web site compani person site occurr queri term document full text favor method number topic anchor method content method rank correct answer figur result site entri chosen randomli page select navig anchor method return correct answer rank compar time content method result randomli chosen reciproc rank correct answer top content method anchor method distribut correct answer rank depict figur content anchor anchor achiev rank equal queri content method score reciproc rank anchor method achiev distribut correct answer rank depict figur content anchor anchor equal queri content method score reciproc rank anchor method achiev distribut correct answer rank depict figur content anchor anchor equal sign test show differ discuss import featur result strong advantag anchor method content method retriev system rank explan anchor inform content site find task strength differ anchor text highli site find uncov condit content base consist effect trec subject search effect experi anchor method queri gener view document number topic anchor method content method rank correct answer figur result site number topic anchor method content method rank correct answer figur result site institut observ section queri term occur document check queri term occur anchor anchor document exist empti anchor document occur page link imag anchor anchor text addit queri correct answer restrict test ensur content method chanc find queri select site retriev link method reject reason featur result figur biggest differ link content method rank rank separ method question correct answer rank answer anchor method return correct answer rank result median full set answer anchor method tend succe answer incom link except failur larg excit link yahoo queri correct answer top larg number introduc word anchor document effect lower rank randomli chosen anchor method return correct answer top ten improv desir link method emploi simpl chosen absolut pure link inform link anchor target superior pure link method pure content method strong evid anchor site find confound factor differ softwar futur experi interest test link content combin method test retriev techniqu relev measur impact site find method found reduc number site top experi show result similar higher absolut valu site heavili promot publish site promot gener incom link anchor involv seed entri page search keyword content fair access automat method effect gener site link anchor method highli effect experi achiev small size crawl hyperlink teach research site stage drawn retriev system provid distinct site find subject search composit rank function found excel task incom link anchor text link document link pair constitut sort train queri view open possibl explor includ combin anchor text evid sourc train studi show anchor text queri site anchor propag interest properti succe requir page crawl text successfulli found queri anchor crawl page enabl retriev common misspel altern anchor index found prime prime correctli return critic experi content method ideal effect emploi relev feedback passag score altern tune paramet complet content method effect discount possibl unambigu shown consist effect subject search method ideal task shown link anchor method capabl highli effect site find rank correct answer top result site find term search content index cover million document total million term occurr anchor index cover million link total million term occurr link index document document fewer term anchor text includ mean site find index potenti order magnitud smaller full text index gain partial offset deal document queri time anchor index type queri final page author manipul link content boost page rank measur experi rank method fool repetit queri word content anchor text spam target popular popular queri tabl result confirm crawl australian nation environ spam widespread problem work anecdot evid suggest site find common import web search activ site find found rank appli link anchor document significantli outperform rank method appli document full text case measur link anchor method approxim effect content method anchor method work equal million document million document collect conclud link anchor text valuabl sourc inform site find collect size web commerci search engin varieti rank method time publish evalu perform method task methodolog present studi base great aspect import problem investig futur work special method found achiev similar perform link anchor perform link anchor method improv link method form descript link anchor site optim weight form link content evid site find anchor text evid search acknowledg comment steve walker technic advic microsoft research refer brian loren william hill predict expert qualiti rate web document sigir page krishna bharat monika improv algorithm topic distil hyperlink environ page sergei brin lawrenc page anatomi hypertextu web search engin rick kazman search visual web connect page brian davison topic local web sigir page david nick paul donna harman result challeng web search evalu page david ellen peter nick craswel overview web track page gaithersburg novemb nist special public jon kleinberg authorit sourc hyperlink environ journal oliv mcbryan tool tame web mm okapi page gaithersburg novemb nist special public jacqu justin picard retriev effect web inform process danni sullivan search engin watch web zhu susan gauch incorpor qualiti metric inform retriev world wide web sigir page
IR/867 5 improv classif unlabel background knowledg assess document similar sarah haym hirsh comput scienc rutger nj usa abstract describ method improv classif short text string combin label train data secondari corpu unlabel relat longer document show unlabel background knowledg greatli error number exampl size string train set small label text job larg amount inform problem world wide web approach view task inform integr tool combin function techniqu literatur introduct task classifi textual data cull site world wide web difficult intens studi nigam applic machin learn techniqu attempt solv problem includ categor web page search classif articl subject machin learn ripper limit learn base sole classifi data impract extrem tediou suffici number train exampl achiev high accuraci task huge data tini percentag realist classifi program unabl exploit inform achiev higher accuraci face unlabel exampl research text learn mine recogn label tremend amount unlabel exampl nigam al work expect maxim naiv classifi paramet naiv classifi set label exampl learn model em probabilist classifi unlabel result collect classifi document estim set paramet naiv em algorithm iter chang naiv paramet nigam al present number result show error rate reduc significantli unlabel exampl relat algorithm mccallum nigam jone al blum mitchel algorithm unlabel data improv learn algorithm appli problem target concept redundantli suffici wai subset attribut describ view data creat predictor classifi unlabel data train learner blum mitchel prove unlabel exampl suffici concept initi weak learner lewi colleagu lewi make unlabel data focu label human label modest subset class membership undecid result learn data label paper describ method corpu unlabel data assist classif task unlik attempt classifi requir form compar train data case classifi data classif schema label instanc unlabel corpu aid task directli compar unlabel directli element label train unlabel background knowledg connect label exampl label train classifi unknown test instanc exist set unlabel background knowledg similar test train call approach data longer directli compar compar step intermediari paper improv classif short text string unlabel relat longer document concret approach task assign topic label technic paper label titl physic articl titl word galaxi easili classifi correctli train articl domain articl common white classifi correctli titl word label train exampl train set word white dwarf system correctli classifi titl word util corpu unlabel paper abstract natur web system find unlabel paper abstract similar white dwarf train titl train titl classifi white dwarf titl dissimilar compar directli order achiev whirl convent system augment special oper text comparison text classif program nearest neighbor approach text document tfidf similar text document measur cosin similar whirl make pose queri field train exampl background knowledg test tabl whirl framework easili explor similar classif succinct queri combin train similar background similar test section give review whirl discuss classif unlabel data describ distinctli domain test system domain descript set result domain vari data set conclud discuss dimens choic direct current futur research approach whirl text classif whirl cohen inform integr tool specif design queri integr vari textual sourc web whirl queri search retriev textual sourc base condit assum corpu train exampl test assign label train exampl view tabl field hold textual field label hold class label test line simpli textual field instanc whirl queri select train test sim paramet queri gener intermedi tabl tupl maxim similar score unlik tradit sql result set tupl order highest score repres closest whirl sim oper comput similar textual document comput similar whirl comput model text document repres document vector vector space comput pass document stemmer comput weight term tfidf weight method distanc vector comput cosin repres statist similar document whirl final step tabl tupl project field select statement note train exampl label multipl nearbi exampl train combin singl tupl final result tabl combin score perform treat score probabl combin individu score tupl label final score label whichev label highest score result project tabl return label test instanc method bear similar method yang chute shown perform text classif task base paper experi whirl background knowledg question larg bodi unlabel aid classif piec inform relationship whatsoev classif hope learn word combin exampl background knowledg provid corpu text inform import word term tfidf valu larg joint probabl word percentag time word coexist larg context test similar train test context conjunct train exampl label whirl express abil creat conjunct queri simpli ad condit whirl queri text classif expand subject classif physic paper titl discuss fairli small set label paper larg set unlabel paper abstract web page result relat call background singl creat queri classif select train test background sim sim similar comparison queri comput whirl multipli obtain final score tupl tabl tabl project field discuss whichev label highest score return label test connect test directli train bridg element background tabl note whirl combin score tupl gener match background tabl whirl fashion essenti conduct search set item background knowledg close neighbor test provid exist train neighbor background knowledg train neighbor test defin differ background knowledg incorpor word test found background word background knowledg connect test dissimilar term word overlap direct cosin train exampl final classif integr inform multipl train exampl multipl exampl lie background text note approach concern class background item belong simpli text directli part process contrast approach explicitli train set classifi background item true add label set method sophist combin train instanc background knowledg background instanc close numer train instanc includ tabl return whirl queri train exampl close class train includ tabl multipl close numer background instanc classif task consist label word articl topic test belong categori cosin distanc word test small number train exampl larg hope larg corpu unlabel articl word test word train exampl note whirl queri form queri directli search train exampl closest test search train exampl closest test unlik standard queri conjunct background knowledg chosen respect train close mean queri multipl maxim score conjunct condit combin experi result test system distinct task world wide web train test exampl short text problem preval world applic whirl design sourc background knowledg origin site obtain label unrel site found web data set technic paper common text categor task assign disciplin technic paper creat physic paper archiv download titl technic paper area physic gener rel quantum month march background knowledg download abstract paper area previou month januari februari total piec knowledg background set combin distribut class titl quantum background knowledg abstract download label knowledg learn program access data set creat obtain download articl sport bank head novemb recent train test set older background knowledg background knowledg consist corpu articl background knowledg problem consist word articl inform studi show includ entir articl improv accuraci degrad effici whirl data data point belong sport belong bank categori present set result connect data call test train set consist word articl web page titl determin whirl nearest neighbor classif cohen hirsh data set world wide web includ web page head page bird primat train class bird bird center titl url link titl web page label chose half titl total exampl discard half simpli url web page url download word corpu background knowledg url reachabl program creat background knowledg total entri background knowledg compani cohen hirsh data set consist train set compani hoover web site label industri creat background knowledg web site download web page busi categori busi hierarchi creat piec background knowledg hierarchi number class divid irrelev treat sole sourc unlabel background text piec background knowledg consist combin web page store hierarchi instanc tabl background knowledg longer text string train test exampl result present seri result graph show whirl incorpor background knowledg perform whirl supplementari knowledg improv dramat fewer label label exampl shorter string number data set time start section compar core whirl method background knowledg label tradit ripper demonstr improv top strong classif perform error rate tabl repres averag error run full train set problem shown bold whirl porter stem algorithm creat tfidf give data ripper data outperform improv report repres stronger classif perform credibl method remaind present seri report error rate baselin whirl approach label case report error rate vari number train exampl learner point tabl error ripper data set ripper hoover physic physic repres averag run data train set test set hold test set number exampl train set vari test percent data present set result physic data figur figur figur titl paper materi class class number train exampl figur class class fewer number train exampl ad previou problem figur show effect background knowledg text data set line repres remain horizont fewer train exampl indic background knowledg lack data sharpli degrad fewer train exampl background fewer train exampl class error rate effect background knowledg figur result data set present figur train test set figur vari term number word rang word word smaller number word train test perform addit background knowledg shorter string test train data repres figur point line intersect string length background knowledg reduc error entir set train data number word exampl point background knowledg chang string length background knowledg reduc percentag data figur class paper titl problem percentag data figur class paper titl problem percentag data figur percentag data figur percentag data figur percentag data figur percentag data figur rate percent data empir evid inform train data greater advantag corpu background knowledg classif size reduct error rate obtain run greater fewer word result domain graph figur reduct error rate number train exampl domain unlik discuss overlap topic background knowledg page classifi test belong categori dog discuss cat vice versa train test titl web page pet store anim care easili categori error rate larg percentag result compani data set graph figur outperform percent error rate substanti percent train exampl differ error rate system reduc unlik result previou domain due fact train test exampl compani consist word occur reduc number train exampl reduc dictionari word train corpu substanti fewer word find bridg background knowledg percentag data figur compani final remark present method reduc error rate text classif larg bodi potenti background knowledg domain system substanti reduct error set label exampl small background knowledg small degrad accuraci twenti percent data number limit work address effici queri issu deal whirl approach essenti nearest neighbor queri condit combinatori search space word combin background knowledg crucial success area futur research effect sourc natur inform background knowledg data base data set background knowledg site train test set fourth data background knowledg unrel web background knowledg web site background knowledg cull combin automat creat web search futur work plan explor refin approach explor disjunct queri correct classif test close train background bridg exist issu useless search prune earli begin extens approach select train test background background sim sim sim type queri background knowledg bridg gap train test test train exampl small bit knowledg class queri small bit knowledg map larger piec background knowledg similar investig conjunct whirl adjust impact train test data similar acknowledg william cohen comment discuss anonym review suggest refer combin label unlabel data eleventh annual confer theori acm press automat queri text retriev confer nist special public fast effect rule induct twelfth intern confer machin learn san morgan kaufmann integr heterogen common domain queri base textual similar acmsigmod intern confer manag data acm press inform system reason structur collect text intern acm confer autonom agent acm press join text categor whirl fourth intern confer knowledg discoveri data mine menlo aaai press text categor support vector learn relev featur tenth european confer machin learn springer bootstrap text learn task work note workshop text techniqu applic heterogen uncertainti sampl learn eleventh intern confer machin learn san morgan kaufmann gale sequenti algorithm train text classifi seventeenth annual intern confer research develop inform retriev acm press text classif bootstrap em shrinkag work note acl workshop learn natur languag process role unlabel data learn sixth intern colloquium cognit scienc text classif label unlabel document em machin learn algorithm suffix strip program machin learn san morgan kaufmann automat text process map method text classif retriev acm transact inform
Agents/868 1 agent patient flow control preliminari concept hannebau technic berlin comput scienc depart softwar engin wendler humboldt berlin comput scienc depart artifici intellig gmd plan optim abstract articl describ research effort cope found control optim todai busi process central control achiev result control system technic secur constraint appli central control distribut control hand cope constraint entail suboptim result commun overhead concept agent dynam fluent transit global local busi process control adapt current system structur evalu concept framework patient flow control project berlin todai applic inform technolog face major aspect busi set aspect partial fulli autom execut complex busi process enforc sophist plan schedul aspect control process execut process distribut spatial coordin interact execut entiti question substanc process manag notion intellig agent singh jen wooldridg recent concept incorpor merit sophist ai method strong commun interact capabl intellig agent appli control optim industri transport product contrast research involv human process domain administr health care manag present problem distribut patient flow control problem collabor problem solv busi context introduc concept agent tailor dynam adapt reconfigur collabor problem solv situat patient flow control research humboldt technic berlin gmd carri case studi cardiolog clinic europ biggest hospit cardiolog clinic consist ward capac altogeth type medic consult diagnost diagnost unit perform diagnost examin dai examin request depart clinic present problem coordin request serv unit spatial organiz distribut unit result distribut distribut control suboptim patient throughput resourc usag tradit monolith system scale pure measur process instanti ignor problem restrict inform distribut local flexibl architectur control request serv process diagnosi decid design realiz distribut multi agent system run comput cardiolog clinic system call perman activ dynam alloc actor resourc diagnost cope failur emerg case technolog found agent manag commun languag set top microsoft messag queue server dcom implement languag visual visual basic ps model problem collabor problem solv task autonom benevol agent difficult engin task collabor problem solv design distribut major part problem space control singl develop team medic inform control decid part problem assign agent case problem space control develop global solut central control lead solut social technic secur aspect enforc distribut agent face tradeoff global problem solv highest qualiti solut common goal due technic secur restrict collabor problem solv obei social aspect diminish problem complex partit entail suboptim solut vast commun overhead design distribut task alloc mechan influenc qualiti effici problem solv procedur describ conceptu research direct cope agent tradit approach collabor problem solv design distribut aspect static assign role compet specif agent problem space static distribut fix set agent type approach differ modif reconfigur ma structur measur intern problem solv complex commun system automat adapt current problem structur melt split problem solv task skill step target agent term denot entiti built independ repres piec goal problem solv capabl exchang compon entiti dynam reconfigur fit current situat dynam reconfigur central find good solut global problem hard imposs due comput complex partit problem search good solut collabor manner speed search commun coordin overhead destroi gain parallel interest solv solv central solver solv optim partit problem distribut agent assum solv method complet correct agent extern method correct complet agent motiv agent set present small collabor problem solv assum agent freeli reconfigur term assign problem solv knowledg skill assum global problem partit subproblem solut global problem consist set solut consist enforc constraint connect subproblem restrict solut capac constraint figur graphic sampl problem subproblem denot graph constraint denot dash line capac constraint denot solid line agent agent figur simpl constrain problem legal assign subproblem agent shown figur deriv group subproblem connect agent care solut subproblem extern connect subproblem agent denot thick line easili extern constraint commun overhead consist check extern constraint effici intern constraint target dynam reconfigur reduc commun overhead consist check reduc extern consist check step target simpl binari constraint group sophist global constraint defin subproblem typic capac constraint restrict figur intern constraint extern constraint repres fact connect subproblem resourc model introduc singl capac constraint hold capac constraint extend problem graph constraint node figur show effect reconfigur step constraint assign agent check consist connect subproblem capac constraint agent agent agent agent cap cap figur introduc global constraint introduc special agent cope global constraint complex extern consist check reduc number simpl binari constraint number commun ensur capac restrict quadrat number connect subproblem contrast number commun line global constraint linear number connect subproblem intern capac check omit reduc number extern constraint subproblem agent strategi lead special agent global commun effort reduc significantli observ agent consist commun agent agent agent commun agent agent step reconfigur multi agent system figur show result technolog call agent melt agent overtak agent care capac agent capac constraint effect reconfigur reduct extern consist check extern commun line constraint check intern combin techniqu assign global constraint special agent melt close relat agent method automat global problem structur find good partit problem approach approach dynam reconfigur melt agent lead situat intern problem complex agent agent cap cap figur melt agent solv global agent agent resolv situat appli agent split denot techniqu complementari agent melt agent split agent distribut subproblem agent make intern constraint extern main challeng dynam reconfigur adapt agent melt agent split current problem structur case commun agent decid melt reach higher global solut qualiti case high intern agent decid split reach comput risk result issu previou subsect assum possess agent technolog agent system dynam reconfigur subsect discuss preliminari design idea realiz properti agent architectur tradit program relat understood control programm procedur paramet call concret condit implement control structur procedur languag situat case autonom agent dynam complex world solv common programm advanc condit call procedur paramet criteria call extend chess programm concret criteria fix procedur control agent program implement flexibl reason process choic procedur architectur mental compon mental transform mental compound belief desir social skill goal individu skill individu desir social execut intent commit select creat creat updat figur mental bdi compon transform found cognit scienc claim design approach flexibl reason process appli artifici intellig research levesqu rao georgeff claim highli suitabl nondeterminist compet local inform bound ration bdi approach agent maintain model call belief true belief action guid desir agent intent partial plan achiev chosen desir action rel stabil intent prevent overload reason useless plan quick reaction dynam environ central bdi design desir act emerg belief agent situat heurist desir ration agent select consist goal intent pursu effici task directli correspond consecut phase process put bdi reason mean ration choic georgeff goal consist desir desir goal intent approach agent reli assumpt agent defin sum mental categori includ intent skill point mental categori collect mental compon repres distinct piec goal encapsul compon exchang recombin gener reason process transform passiv mental compon agent reason process differ element mental compon collect denot set subproblem assign contempl agent individu desir social desir denot agent goal intent stand individu skill social skill figur show bdi architectur agent specif obei individu implement solv subproblem sensor updat agent current belief belief desir creat assum subproblem state solv pend function creat algorithm algorithm creat jp cumul util function util consist predic consist set mental select function comput consist subset desir maximum util goal algorithm select arg max commit function comput consist subset recent intent goal maximum util intent goal goal recent includ set intent due low util inconsist reason ad individu desir chanc select algorithm commit arg max fi ji simpl intent sequenti execut order util intent execut interpret script individu social skill agent give subsect agent mental state agent melt achiev goal goal intent collect melt agent empti appli agent desir belief desir inconsist definit skill orthogon inconsist agent split goal intent defin consist agent easili distribut agent consist issu design agent architectur support dynam ma infrastructur design commun cooper protocol ma infrastructur dynam commun termin problem solv call unit agent context close fipa standard algorithm execut order interpret end agent manag agent manag agent commun languag agent commun languag figur show main space agent exist call workspac cycl arrow independ run thread dash box messag queue agent unit mental compon librari agent unit mental compon librari workspac messag transport system commun agent manag agent figur agent workspac compon librari idea workspac possibl unit agent dynam link mental compon librari intent skill compon compon agent parallel independ workspac host boundari agent simpli initi connect mental compon librari hold dynam domain depend code state encapsul compon refer dynam reassign agent melt agent simpli mean creat agent hold mental compon refer recent agent agent split distribut refer mental compon agent technic cation cooper protocol support dynam reconfigur case collabor problem constraint subproblem intern uniqu agent extern distribut agent cooper protocol cooper protocol agent implement script individu social skill agent script describ part approach reconfigur awar cooper protocol agent script implement extern request constraint current subproblem solv problem local algorithm script extern administr constraint pg ext abstract inform constraint extern administr store set extern constraint ext ext ext ext ext end intern constraint comput local optim function find solut intern ext int int int int opt ext int inform extern constraint static asynchron solut agent invalid ext agent inform constraint administr solut assum problem solv set state optimist react asynchron inform desir monitor ad individu end script realiz monitor mean watch accept agent solut relat work work articl relat task share effort ma research distribut constraint satisfact work algorithm script extern administr constraint wait messag time event trigger pg ext trigger event select fin case agent send messag retract inform constraint administr unsolv adjust state case end messag case end select topic deal negoti lesser cooper lesser load balanc agent replic williamson shehori al social reconfigur yokoo norri shen norri work topic static problem problem partit exampl found al buchanan yokoo al result research direct construct agent interact applic intellig agent found product manag sycara burk levi burmeist al hannebau shen norri telecommun al huhn singh meet schedul sycara sycara sen health care manag fox ramesh al fox al decker li prospect agent vision work group achiev result reason process robocup team humboldt base modular bdi reason wendler burkhard al lead team competit similar modular concept successfulli person assist agent dynam skill exchang research gmd approach effici cope timet problem john effort agent conceptu level applic level base recent research distribut product control present busi process model base petri net team begin realiz hope achiev result end refer problem partit solver coordin distribut constraint satisfact workshop parallel process artifici intellig practic reason harvard press distribut asynchron schedul intellig schedul morgan kaufmann publish bdi design principl cooper implement intern workshop robocup bdi artifici soccer ai magazin techniqu traffic manufactur progress report agent technolog market springer intent choic commit artifici intellig multistag negoti distribut plan read distribut artifici intellig morgan kaufmann publish dynam coordin algorithm distribut sensor network eleventh nation confer artifici intellig coordin hospit patient schedul intern confer system clone intellig adapt inform agent methodolog volum lnai springer distribut problem solv plan multiag system modern approach distribut artifici intellig mit press fipa agent commun languag agent commun languag fipa part version fipa agent manag agent manag fipa part version gener technolog clinic support system comput method program total distribut meet schedul system advanc artifici volum lnai springer method solv practic problem schedul model confer practic applic constraint technolog timet eleventh intern confer applic prolog distribut task plan flexibl manufactur environ distribut softwar agent applic volum lnai springer rapid concurr softwar engin competit situat sixth intern confer concurr engin bdi control environ manufactur system progress report intellig agent inform process manag universitat tzi report formal workflow model intellig agent workshop agent base system busi context aaai press approach health care manag appli artifici intern journal manag heterogen transact workflow agent agent technolog market springer ed read agent morgan kaufmann publish organ distribut product system ieee transact knowledg data engin agent technolog market springer manag busi process intellig agent bc expert system confer reach agreement logic model implement artifici intellig assist agent distribut knowledg workshop inform system emerg constraint satisfact coordin interact workshop model autonom agent world distribut meet schedul sixteenth annual confer cognit scienc societi comparison approach solv distribut constraint satisfact problem research report depart comput glasgow uk adapt architectur intellig manufactur intern journal product research architectur heterogen medic annual american confer inform bdi theori practic intern confer system mit press formal studi distribut meet schedul group negoti resourc util task perform agent clone intern workshop agent architectur languag hybrid agentori infrastructur model manufactur knowledg acquisit workshop system intellig survei knowledg inform intern journal contract net highlevel commun control distribut problem solver read distribut artifici intellig morgan kaufmann publish solv time tabl transport problem distribut csp techniqu workshop constraint applic model solv distribut constraint satisfact problem confer distribut constrain heurist search ieee transact cybernet distribut constraint satisfact formal algorithm ieee transact knowledg data engin
IR/869 5 infrastructur digit librari abstract digit librari todai monolith system dissolv collect electron servic challeng provid infrastructur support user deal multitud servic infrastructur offer integr access combin content multipl provid activ dissemin support user locat combin servic suitabl global info program infrastructur digit librari compon infrastructur develop feder queri servic alert servic herm integr servic combin underli heterogen inform sourc portal support user locat appli digit librari servic introduct expect digit librari futur larg number heterogen servic offer parti involv archiv digit content user increasingli difficult deal multitud heterogen servic user interfac access requir separ registr goal facilit interact user digit librari consist set heterogen servic offer independ provid user support user locat combin digit librari includ trade negoti servic properti user search queri multipl inform sourc user stai relev content digit librari present project address issu project constitut program infrastructur digit librari german digit librari initi global info feder servic bibliograph metadata develop magdeburg support flexibl integr bibliograph data multipl inform sourc type unifi queri servic offer util digit librari servic herm herm project free berlin develop alert servic digit librari research enter profil interest herm system notifi match bibliograph refer harvest varieti heterogen underli inform sourc mean research deleg tediou task continu scan inform sourc relev public herm project integr platform electron public servic creat tar project fundament infrastructur mechan facil integr mechan constitut broker digit librari servic herm made user portal develop function infrastructur case domain digit librari constitut integr environ multipl aspect inform servic give introduct scholar inform research topic enter decid search catalog select servic type catalog portal suggest set catalog feder queri servic offer function includ research wide coverag forward search interfac pose search request view result research find topic interest stai alert servic cover inform sourc relev topic portal suggest herm alert system enter search herm start watch sourc match public notifi research posit result issu project herm scenario outlin issu domain electron virtual digit consist servic includ document retriev engin alert facil todai type servic access typic offer provid constitut function digit librari specif set servic type provid found homogen integr identif set servic web integr data sourc provid servic herm feder bibliograph feder servic mediat queri bibliograph data sourc offer extend queri process capabl global view integr data support simpl search scenario servic requir access complex citat index schema catalog jdbc driver interfac queri processor parser queri evalu optim adaptor manag adaptor adaptor figur architectur feder servic promot client offer standard jdbc interfac post standard sql queri integr data deal data data overlap data possibl limit queri capabl sourc system aspect flexibl configur applic describ underli sourc interdepend achiev easili configur wrapper call adapt adapt cover class data xml adapt integr xml version dblp bibliographi queri tool harvest bibliograph inform main issu herm alert system depict fig interfac heterogen provid bibliograph data provid wrapper provid activ proprietari standard activ provid notifi alert system typic passiv provid monitor regular basi detect instanc wrapper web site standard passiv provid metadata harvest protocol herm includ gener wrapper arbitrari compliant inform provid herm wrapper harvest bibliograph offer feder cover bibliograph data sourc integr servic mix type project partner springer notifi bibliographi ftp server inform provid proprietari adher standard sgml format publish springer describ articl scholarli journal slightli modifi xml version describ articl herm format java vm provid provid herm alert system observ wrapper wrapper xml filter web interfac subscript subscript subscript figur herm architectur rang implement method xslt broker digit librari servic project dynam broker electron publish advanc user interfac form web figur architectur fundament infrastructur consist type manag trader compon implement function servic mediat type manag incorpor sophist type system handl public servic specif trader dynam maintain repositori current offer match request servic optim fashion servic remot provid integr base extens set adapt commun protocol portal applic compon provid combin util end user fashion present digit librari servic develop global info program infrastructur digit librari user issu project work make herm portal includ specif servic descript implement form api middlewar corba open issu includ unifi mechan transpar manag user account prefer multipl support ad user assist combin servic custom servic refer feder servic heterogen digit librari access cooper sourc kyoto intern confer digit research practic ieee comput societi european workgroup sgml header herm notif servic digit librari joint confer digit june spiliopoul build wrapper publish intern journal digit global info initi global und informationssystem für und technik de bmbf gener auf basi informatik page berlin heidelberg feb verlag michael lei dblp digit bibliographi librari project sattler citat link feder digit librari proc int workshop engin feder inform page advanc concept gener portal proc intern workshop web base collabor
DB/870 3 queri calculu object toni norman paton depart comput manchest oxford manchest unit kingdom abstract develop involv extens aspect architectur aspect receiv attent develop queri calculu provid semant queri underpin effect queri optim evalu framework show queri calculu spatiotempor object build monoid calculu fegara maier system develop paper show extens odmg type system spatial tempor type accommod monoid approach queri histor data illustr map monoid open applic logic optim base normal algorithm fegara maier introduct focu research activ period exist prototyp complet system product provid effect support applic track spatial data time design implement complet challeng involv extens aspect architectur data queri queri queri program storag open issu relat undertak led research focu specif aspect problem join address develop complet dbm rise collect result built develop complet endeavour pursu rare tripod paper seek design prototyp complet system extend odmg standard object facil manag vector spatial descript past state spatial data extend oql calculu algebra histori tempor type odmg model spatial type figur tripod compon figur illustr relationship compon tripod design core odmg object model odmg model extend tripod categori primit spatial type tempor type spatial type tripod rose algebra support vector type line region tempor type support tripod version rose algebra instant close relationship spatial tempor type consist kind data past state odmg includ spatial tempor record histori histori set timestamp tempor type type extend odmg model figur histori repres object model leav open question result model queri semant effect optim monoid calculu extend tripod accommod queri spatial tempor data figur illustr layer repres queri algebra queri deriv map focu paper queri calculu layer figur layer semant histor queri object incorpor monoid calculu queri optim support queri optim gener calculu oql provid support tempor histor featur pure extens exist calculu retain extens separ queri figur present class definit illustr sort model mean durat citi exist record properti attribut histor assign elect attribut histor store valu tempor attribut ward mayor attribut attribut histor previou current valu spatial type reason definit class ward omit class citi attribut string attribut attribut attribut string attribut region figur odl remaind paper structur section overview structur tripod snapshot histori constru instanc abstract data type section overview monoid approach queri process object section show construct section incorpor framework section give rise queri calculu histor object section exampl includ queri requir aggreg histor attribut express section discuss relat work section draw stem contribut paper histor object structur behaviour tripod support manag queri entiti chang time notion histori histori model entiti relationship particip undergo result assign made tripod object request histori maintain made construct histori histori record episod chang identifi timestamp timestamp instanc tempor type rich collect predic oper section overview structur tripod snapshot histori constru instanc adt overview develop notion histori monoid introduc section open definit queri calculu contribut paper reason complet formal descript tripod construct refer made timestamp instanc tempor type tripod extend set odmg primit type tempor call number oper predic defin underli domain interpret structur refer tempor realm defin special realm defin schneider tempor realm finit set integ spatial realm finit integ reason adopt viewpoint terminolog realm valu find suitabl individu kind strategi preval queri process architectur realm oper rich set predic constructor nice closur properti tripod system find develop realm unifi notion interpret oper spatial tempor valu unif level interpret propag upward predic oper realm defin spatial tempor valu facilit implement softwar author develop tempor integ set set pair element close timestamp ¢ ¢ figur illustr timestamp graphic form figur timestamp timestamp ¢ valu singleton figur tripod timestamp denot set timestamp repres predic oper defin shown figur oper give reader intuit understand mean base oper set integ integ classic definit tempor predic full formal semant reason allud ¥ figur oper timestamp timestamp applic design complement relat primit type odmg standard main histori construct oper requir introduct primit valu thought build block timestamp consist oper defin instant shown figur figur tempor valu snapshot valu object model mention request histori maintain made construct assign snapshot construct time denot timestamp consequ assign defin odmg object histori tripod object model object attribut relationship instanc histori associ timestamp snapshot drawn domain object identifi histori attribut valu type valid relationship instanc structur histori ¢ ¢ ¢ histori quadrupl denot domain valu granular set call form tripod timestamp snapshot rest set set set set histori set state constrain inject function set timestamp occur set snapshot occur histori invari histori timestamp occur type granular ¢ snapshot occur timestamp histori record valu valid time snapshot assign histori occurr timestamp previou occurr adjust appropri coalesc place explicit mention earlier valu histori integ snapshot properti timestamp element denot year year year salari salari behaviour histori subsect overview oper tripod oper histori constru instanc lead behaviour categor constructor discuss merg updat oper overview focuss full detail note distinguish oper defin histori oper defin timestamp £ queri oper histori repres queri oper histori shown figur note express figur fact templat set signatur element set predic timestamp member templat yield signatur £ templat includ figur queri histori £ ¢ £ ¢ £ state set histori ident ¢ ¥ contrast queri histori ¢ ¢ £ exemplifi oper queri histori repli histori £ £ £ £ £ merg updat oper histori repres merg updat oper histori shown figur figur merg updat histori union histori union state set state argument state argument timestamp snapshot satisfi invari histori infix state set histori exemplifi state set £ ¢ £ ¢ histori timestamp type yield histori oper map state set state timestamp ¢ occur ¢ ¢ £ £ recomput note semant reli definit recal function restrict set denot set pair £ ¥ ¢ histori state type £ yield histori equal occur ¢ timestamp recomput ¢ ¢ timestamp includ occur recomput state set equal state timestamp ¢ common point recomput make longer case ¢ approach queri process £ ¢ £ ¢ £ £ £ monoid ¢ abstract monoid tripl consist set ¢ £ ¢ £ ¢ ¢ ¥ £ binari associ oper call merg function ident element call element monoid note ¢ type exampl monoid £ tent care abbrevi merg function identifi type exampl ¢ scalar monoid ¢ call primit monoid ¢ collect commonli refer monoid ¢ call collect monoid requir addit call unit function monoid denot sibl construct instanc ¢ ple collect monoid ¥ function return singleton construct set ger write £ set customari omit unit function denot collect monoid specif easili infer merg function identifi monoid collect monoid written denot union plicat remov denot list denot empti empti bag empti monoid monoid calculu briefli £ monoid express £ form express call sequenc qualifi gener form filter form predic term call rang variabl express domain bind drawn requir stipul gener monoid idempot commut idempot commut monoid map set monoid idempot list monoid map bag monoid commut monoid simpl procedur interpret monoid £ form gener gener rise nest loop straightforward gener multipl filter denot result comput shown figur figur procedur interpret monoid set instanc type defin appli reduct set obtain reduct calculu shown monoid serv target map oql monoid calculu qualifi queri calculu object reduct formal declar semant oql result oql queri give exampl oql queri alongsid monoid figur gener monoid map oql queri figur return set citi ten map monoid figur descript map oql monoid algebra optim monoid monoid figur map ¤ ¤ ¤ ¢ ¢ figur oql monoid sion practic experi monoid approach implement system report parallel increment view mainten extend queri calculu section show construct section incorpor framework section give rise queri calculu histor object timestamp snapshot monoid type tripod implement primit type statu odmg primit type instant scalar aspect formal captur collect introduc monoid ¢ ¢ tion map set valu type type membership iti mean map set ¢ valu type type interv smallest convex meet overlap ¢ ¥ defin collect monoid ¢ element respect empti instanc unit function merg function assembl union disassembl £ monoid inherit monoid properti idempot commut write monoid ¢ £ £ monoid £ lexicon filter extend set tripod predic primit tripod type set domain gener extend express denot path domain tripod tempor tripod oper return instanc ¥ ¥ ¥ assum monoid figur count interv ¢ liter £ £ ¢ ¢ figur tempor valu note coalesc implicit fact £ defin term discuss coalesc definit extend monoid calculu collect form timestamp collect monoid defin tempor tripod type cover due lack space note spatial type tripod support primit type discuss definit monoid monoid similar strategi tempor type tripod extend set primit odmg type tempor type mean applic design express domain defin attribut relationship model tempor aspect applic section snapshot simpli valu valid type extend type system impli monoid odmg tempor type extend type system monoid written chang histori add histori monoid queri reason assum histori check granular timestamp case simplifi notat equat histori state set note type instanc histori design model applic tempor signal distinct retain section denot set histori defin collect monoid element empti denot unit tion £ merg function defin section note definit pick argument restrict tive idempot ¢ write monoid lexicon filter stem set oper histori outlin section set domain gener extend express monoid figur histori oper ¥ histori £ ¢ £ ¥ monoid figur comput longest token left bracket ¢ ¢ ¢ durat snapshot smaller longest period record return granul lifespan snapshot £ spatial tempor tension odmg histori give rise extend set monoid remaind section discuss rise extend queri calculu section show aggreg histor data express extend set monoid queri calculu found histori monoid work monoid approach queri calculi object yield wealth result rewrit map physic algebra defin queri process framework relat enjoi decad show timestamp histori give rise monoid monoid effect extend odmg set tempor type notion histori core logic queri optim set transform rewrit termin normal algorithm appli usual rewrit rule heurist push select insid result express costli evalu origin transform applic depend properti monoid monoid defin addit primit type transform defin provid basic compon queri calculu histor object timestamp monoid suggest idempot transform appli collect monoid appli timestamp monoid histori monoid suggest transform requir argument monoid commut rule result approach endow histor object extend queri calculu exampl queri tempor spatial data section show queri calculu histor object contribut paper express queri repres class applic tripod design support elect ¤ ¢ elect citi ¤ ¢ ¤ ¤ ¢ figur tempor queri schema fragment figur queri tempor attribut shown figur case aggreg queri tempor compil option map monoid choic stem fact tripod tempor valu obviou action disassembl tempor set consist individu compon tempor appli standard aggreg monoid effici option reli fact oper defin tempor valu effect return aggreg compon effect comput count type instant map monoid shown figur tempor type primit type compil number compon semant case compil monoid present similar assum map monoid shown figur symbol denot introduct local bind produc note version sum queri rang simpli aggreg element snapshot type set time point order queri shown figur histori histori mayor citi histori monoid defin section histori hand side gener bodi monoid bind state pair denot snapshot notic oper histori analog compon tempor queri denot scan carri kernel queri evalu mayor manchest ¢ ¢ long ken livingston mayor london ¢ ¢ retriev histori pari mayor ¢ ¢ citi area larger squar mile june ¤ ¢ maximum citi june ¢ ¢ figur histor queri aggreg spatial valu analog tempor valu discuss context queri opportun appli primit oper comput aggreg individu compon spatial compil spatial spatial region monoid queri suggest benefit method paper integr spatial histor featur object queri calculu immedi appar combin spatial tempor aggreg requir extra machineri queri figur monoid map queri notat date integ valu domain valu construct reason paper discuss detail mechan handl granular current time interv support relat work contribut report paper aim lai foundat queri optim process paper show monoid approach problem adopt context rich collect tempor spatial type extend standard odmg type system contribut paper set work tempor spatiotempor data model languag relat set recent wide rang report relat tempor model current research tempor object model queri languag stem similar work relat set model typic timestamp individu tupl attribut timestamp approach adopt paper adapt set method emploi gadia model attribut valu function tempor element attribut tempor element union disjoint time interv oper defin tripod tempor type exploit construct schneider earli spatial set tempor predic oper foundat interv algebra defin turn extend allen union convex interv tempor relat model consequ discuss tempor queri optim process scarc excel survei detail focu queri leav queri calculi background tempor model tempor object model fewer survei histor object model bertino al close relat work tempor extens odmg object call properti timestamp odmg object properti function util timestamp close resembl primit tripod type model address concern object properti made immut modifi attent paid model object migrat type lifetim structur compon odmg behaviour aspect tempor domain detail behaviour precursor definit queri languag difficult compar contribut paper greater detail model move object data model util discret model time exist data model captur object properti continu chang model move object approach adopt model state spatial properti express continu function time queri posit spatial data infer interpol spatial valu bound express mechan move line polygon queri move object achiev extend exist algebra process call lift kernel algebra oper appli tempor type tripod data model calculu address explicitli target applic object chang discret step queri optim research topic develop effici strategi process spatial join queri line investig work constraint idea underpin queri optim concentr describ calculu underpin logic optim provid basi rewrit logic express calculu properti strategi optim concern cost model underli physic execut queri map monad algebra express made execut oper scope paper subject futur work intend carri figur design implement system present relat formal optim declar queri paper introduc collect primit tempor type base spatial rose algebra provid consist complementari facil describ time space tempor type underpin notion valu record time incorpor monoid calculu framework provid semant spatiotempor queri object practic framework develop optim queri illustr result queri calculu collect queri power facil model queri object ongo work develop extens oql provid express queri support investig effici algorithm queri evalu acknowledg discuss michael john chri keith mason bo partner tripod contribut significantli shape contribut paper acknowledg debt work fund uk engin physic scienc research council support gratefulli acknowledg refer paton increment mainten materi oql view proc pp allen maintain knowledg tempor interv novemb extend odmg object model time proc pp tempor system implement mod snodgrass tempor statement modifi acm decemb editor object odmg morgan fegara optim queri object updat fegara maier optim object queri effect calculu acm decemb gadia homogen relat model queri languag tempor acm fernand data fernand tempor data system complex spatial queri proc pp scholl translat oql monoid nest technic report depart mathemat comput septemb vazirgianni foundat repres queri move object acm march schneider spatial data rose algebra vldb snodgrass evalu relat algebra incorpor time dimens acm comput logic time phd california novemb william virtual effici implement strategi finit resolut spatial data type pp august review data model technic depart unit octob faloutso select estim spatial queri region data store proc de paton architectur parallel odmg compliant object proc cikm pp novemb snodgrass tempor object orient critic comparison modern object chapter pp chorochrono particip research network spatiotempor system sigmod cost model join queri spatial proc
Agents/871 1 make complex articul agent danc analysi control method drawn biologi maja matar comput scienc depart southern california west sal mc lo ca victor colleg comput georgia institut technolog atlant drive ga matthew williamson mit artifici intellig lab massachusett institut technolog technolog squar ma accept final form paper autonom agent juli abstract discuss tradeoff involv control complex articul present implement control complex humanoid torso danc control drawn biolog illustr issu cartesian space task specif implement evalu control qualit quantit natur movement control flexibl gener combin approach aim util strength altern gener framework address complex motor control articul agent kei articul agent motor anim introduct control humanoid dynam simul extrem difficult problem due high control freedom redund system method develop simpler manipul gradual scale complex arm mason recent physic arm williamson anthropomorph control found applic area dynam simul human involv realist physic match complex robot problem obrien van de present control implement address tradeoff involv approach articul includ control cartesian relev applic includ biolog anim control implement humanoid torso appli task perform continu sequenc smooth movement movement sequenc chosen popular danc task matar al comparison control torqu cartesian control paper describ compar perform human data speed smooth result motion qualit quantit measur rest paper organ section relev background relat work manipul includ anim issu section describ humanoid simul test bed section detail specif task section describ torqu control section describ control section contrast method cartesian control section present detail perform analysi comparison method criteria includ qualit quantit natur control flexibl section describ continu work combin approach articul section conclud paper background relat work comput anim robot primari area research motion artifici agent section briefli review introduc biolog inspir type control discuss control robot manipul control address reach posit control manipul matur area research offer varieti standard techniqu review robot method found craig paul bradi al solv kinemat find relev joint angl obtain desir posit orient difficult structur redund ii solv kinemat techniqu linear system kinemat oper jacobian jacobian achiev posit control jacobian redund system explor huang control method origin forc control hybrid control craig inspir work stiff control gener control control posit section techniqu augment includ model robot dynam order improv accuraci control common comput torqu dynam manipul solv provid torqu motion walker paul learn varieti techniqu fuzzi adapt explor continu appli problem schaal atkeson li jordan rumelhart control comput anim comput charact anim creat physic model automat gener realist motion current techniqu physic model classifi level method minim constraint automat solver reli control requir stronger kluwer style file user witkin kass present approach start end condit gener motion characterist anticip determin cohen extend approach higher dof system complex constraint mark introduc constraint approach creat behavior automat genet algorithm control dynam simul appli successfulli complex system articul human figur dynam simul gener graphic motion appli dynam model forward integr simul ensur physic plausibl motion enforc law physic pai simul walk draw strongli robot work torso leg control base constraint demonstr rigid bodi dynam simul leg creatur control consist state machin cycl constraint perform gait al extend work human suggest toolbox techniqu control articul system gener athlet behavior bicycl van de search techniqu find balanc control charact aim automat control simul agent method gener anim automat exist includ motion captur procedur relev control work present complet review control comput zeltzer control biolog motiv flexibl effici biolog motion desir model complex agent control work inspir specif principl deriv evid neurosci relat work spinal frog rat suggest exist motor primit converg singl equilibrium point produc behavior reach wipe field frog leg execut behavior rest posit correspond equilibrium field linear superposit field field domin suggest eleg organiz principl motor entir behavior code combin complex behavior idea suppli agent collect basi behavior primit repres combin gener repertoir complex appeal previou work matar inspir biolog successfulli appli idea basi behavior control planar mobil paper extend notion agent dof work similar perform williamson scassellati williamson present control reach robot base biolog evid system superposit interpol reach rest postur inspir data describ peopl fixat observ human movement matar matar demonstr present video human arm observ focu imit subject reconstruct complet trajectori unnatur movement involv multipl spite attend suggest form intern model complet behavior primit effect encapsul detail control appropri design motor task larg posit matar al tional control gener postur trajectori dynam humanoid torso simul chosen implement test simul human static graphic leg consist rigid link connect revolut joint total dof dynam model creat method al mass inform gener graphic bodi part human densiti estim equat motion calcul commerci rosenth sherman simul act accept extern forc environ joint limit implement extens subsequ work rigid bodi section freedom dof wrist dof elbow dof shoulder dof wrist dof waist dof shoulder dof neck dof elbow rigid bodi section freedom dof wrist dof elbow dof shoulder dof wrist dof waist dof shoulder dof neck dof elbow figur dynam simul test bed consist rigid link connect revolut joint total dof test compar motor control simul fairli stabl static ground allevi explicit balanc control virtual extern forc appli explicit calcul kinemat arm enabl implement evalu control movement simul softwar handl issu ik dynam section introduc task compar control approach task specif movement reli specif realist constraint test task challeng control familiar chose kluwer style file popular danc involv sequenc coordin movement constitut natur verbal descript found web aim teach peopl danc omit hip descript tabl tabl extend arm straight palm extend left arm straight palm rotat hand rotat left hand touch hand top left shoulder touch left hand top shoulder touch hand back head touch left hand back head touch hand left side touch left hand side move hand hip move left hand left hip set directli formal specif task plan sequenc order provid danc specif interest individu consist frame refer deal defin postur express joint rest defin hand cartesian refer frame mention peopl watch movement pai activ attent focu hand hand posit suffici constrain rest joint requir mixtur coordin frame type heterogen task specif common natur languag control system satisfi goal underli address issu control specif implement approach control command torqu actuat joint successfulli control gener behavior varieti system al van de implement calcul torqu joint function angular posit veloc error feedback state desir desir actual desir actual stiff desir desir desir angl veloc actual actual actual angl veloc gener desir angl feedback error interpol target postur postur deriv task section intermedi postur point guid joint trajectori difficult transit point swing hand head prevent matar al direct unaccept path head increment desir angl spline smoothli interpol postur point gain chosen hand remain constant approach direct control actuat joint give user local control detail behavior control turn requir complet set desir angl time inform joint neck import behavior gener interpol postur reason method reduc requir amount inform control actuat joint individu modifi respect desir local control gener motion desir postur set angl posit constraint satisfi feedback cartesian space tip difficult control error directli case kinemat solver gener desir angl posit constraint approach implement control describ approach base recent work inspir biolog data section earlier show small number primit gener wide rang forc field frog foot combin primit simul leg move part workspac actual path leg influenc field straight natur show combin primit move point straight line primit weight step step achiev target control trajectori motion appli approach stabl potenti field singl static equilibrium point combin gener control primit combin weight function step function move agent target posit function dictat desir trajectori arm move hand avoid head error torqu linear linear figur graph show differ linear control torqu due control drop high error kluwer style file primit relationship joint actual actual joint oe relationship primit depend actual angl actual deriv actual primit oe joint stiff damp desir angl desir calcul oe actual desir actual desir actual defin deriv gaussian potenti center desir control similar linear small error actual desir larg torqu calcul primit drop shown figur suggest behavior consist biolog control rich behavior produc primit combin creat motion primit perform static defin oe weight step function path manipul weight function ae actual actual ae actual actual step function defin yield smooth transit control movement final postur defin desir function defin ae ae creat smooth adjust trajectori separ control path movement implement differ number wai set arbitrarili chosen solv squar optim problem determin size step select arbitrari chose correspond posit arm simplifi weight pragmat unclear optim method scale dof system implement full dof simul work primit defin gaussian potenti full coupl implement treat independ control refer similar control previou reli relationship joint determin arm motion main differ defin oe oe actual joint actual desir coupl joint exponenti term matar al actual desir figur virtual forc comput attach virtual spring damper hand posit desir posit xe torqu joint calcul produc desir forc end move desir posit approach control linear control simpli switch interpol linear function manipul defin explicit point cartesian control approach contrast implement control act cartesian frame intuit interfac cartesian posit hand easier visual angl joint approach base principl introduc appli robot manipul gener principl modul mechan arm alter torqu arm joint mechan object defin relationship disturb gener forc compress spring exert forc proport displac system constant equal stiff spring complic mechan robot mechan determin control joint level mechan arm made virtual spring damper connect equilibrium move point drag arm arm automat return equilibrium posit disturb arrang control arm advantag term interact environ control calcul forc virtual spring illustr figur desir actual desir actual actual vector defin posit orient actual vector desir desir vector desir posit veloc stiff damp matric desir forc implement appli torqu calcul jacobian actual simpl relat actual kluwer style file appli equat result stabl control posit orient hand workspac arm constrain final orient prevent arm violat joint limit move bodi constrain control ad control elbow motion posit elbow hand intuit method constrain arm motion experi show control elbow desir orient upper elbow posit control calcul similar manner equat jacobian defin transform elbow shoulder forc due desir rotat term ad control includ effect graviti link arm actual extra damp shoulder joint shoulder make final torqu appli hand hand elbow elbow actual shoulder perform desir posit orient desir orient upper arm control scheme calcul torqu joint order move arm maintain control waist neck move linear interpol scheme gradual shift desir posit extra point avoid head method advantag posit control techniqu kinemat ii requir forward kinemat jacobian stabl move contact surfac gener formul control simpl merg mechan control strategi main difficulti encount implement scheme find compact intuit orient elbow hand orient hand singl angl rel lower orient upper arm align segment desir vector scheme produc motion hand natur move hand straight touch shoulder natur motion hand move directli straight line curv solut requir detail specif desir trajectori altern simul system arbitrari forc appli arm forc calcul equat directli appli hand variant approach experi appli actual desir actual desir desir desir actual actual defin gain constant carefulli chosen valu control effect move hand desir cartesian posit desir simpler implement control number disadvantag forc appli high damp constrain rest result unnatur motion due fact arm move influenc appli virtual spring damper hand elbow effect forc arm unintuit arbitrari posit orient upper posit orient make system predict easi oper matar al figur perform shown seri case torqu control control found sensit singular configur arm arm chose final control method detail mason perform analysi comparison analysi evalu complex behavior open research challeng synthet behavior agent ai issu analysi increasingli acut explor evalu qualit make observ differ control perform consist task task singl similar human synthet motion natur qualit judg natur movement import aspect robot anim aesthet judgment difficult quantifi qualit judgment motion requir playback record control figur show imag goal facilit qualit comparison arm trajectori gener control control shown control control begin end postur similar path valid kluwer style file figur imag show trajectori hand avoid bodi unnatur path vari significantli motion gener smooth due spline interpol chosen point movement result gaussian control control motion move straight line differ human movement simul agent due underli dynam chosen test qualit featur limit dynam simul separ dictat underli control rigid bodi simul limit overcom control spine necessarili stiff dynam simul constrain motion physic plausibl necessarili natur simul constrain joint limit avoid control handl limit directli control knowledg bodi avoid accomplish user choic desir posit result unnatur trajectori improv direct predict joint limit contrast limit qualit differ control directli torqu method interpol postur spline smooth result motion includ small head hand movement produc natur motion qualit differ control difficult quantifi vari dynam involv bia avoid section address approach quantit evalu control natur quantit arm analyz qualit previou complex easili compar quantit fashion introduc extern metric veloc domin activ hand individu control hand posit record human perform matar al comparison speed subtask human subtask subtask subtask time time figur comparison hand veloc profil arm straight straight touch shoulder back back head human data hand posit data person perform record commerci flock bird track system comput hand veloc compar veloc control figur show veloc analyz control human perform danc evalu individu control perform shape smooth veloc profil peak speed human motion data record fairli low variabl sampl rate produc veloc assum effect smooth higher frequenc sampl analysi peak veloc show torqu control gener unnatur fast hand movement control close match human peak speed control gener symmetr hand natur human movement categor symmetr properti atkeson movement requir avoid control produc motion close match shape human veloc profil differ hand movement task task control perform varieti suggest potenti gener control task task variabl control forc perform varieti condit requir sophist path order avoid control point avoid effect postur dramat speed profil note chang speed postur chang control kluwer style file initi control trajectori remain consist task point achiev goal result veloc profil sophist approach comparison minim hand posit flash metric describ human arm movement plane inspir work planar evalu final dt deriv posit respect time chose evalu metric measur minimum torqu chang suzuki energi easier record human subject good measur smooth human figur comparison valu control human data line connect data point correspond actual calcul map left hand movement calcul valu control human data shown graph squar activ hand left length task expect correspond control human focu trend movement involv avoid head high valu reflect complex base sole cartesian low movement primarili joint constraint command hand palm low result movement short distanc cartesian goal move hand hip sensit measur vari strongli task task control log scale system gather human data matar al suffer marker ad evalu made effort creat correspond path human variabl arm path time effect slower movement faster movement shown time method normal data shown account differ normal exact valu graph reliabl gener trend remark obviou correl data set control flexibl addit evalu success control creat evalu control user point view section issu amount inform requir inform input simplic final motion tune actual comput complex control gain constant great differ amount inform requir control control lowest requir valu arm step control requir valu input timestep call extra interpol routin control requir includ hand orient elbow interpol routin import number paramet posit inform determin inform input user solv kinemat arm angl adjust due fact joint articul make effect joint arm motion depend angl control work cartesian make specif hand posit easier orient elbow hand slightli due awkward rotat illustr fundament tradeoff type control awkward explicit control cartesian space control easier control individu freedom factor influenc dynam arm danc arm move quickli dynam make choic import requir creat posit point requir motion arm wholli determin posit difficult map error arm path specif paramet difficulti appar refer reason final evalu made term complex implement simpl control close control control requir jacobian matrix calcul numer vector oper graviti complex explicit kinemat algorithm complex control present return posit cartesian space kluwer style file continu combin approach control implement present involv unavoid consist approach gener movement refer frame simplest task result unnatur challeng transform specif implement final prefer mean flexibl combin control util approach suit task work develop approach control approach implement framework brook behavior abstract encapsul control detail primit implement gener primit specif goal assign benefit behavior decomposit wai structur system type behavior decomposit specif behavior control depend sensor effector implement type cartesian desir behavior type primit movement earli demonstr mohan emploi notion type motor primit behavior gener assign type control cartesian movement implement execut elimin control execut parallel implement includ primit execut concurr order gener movement concurr behavior combin complex requir consist output control combin type primit assum user intellig autom method subdivid task assign type unreason assumpt specif typic sequenti present fashion break gener directli observ break automat assign primit approxim search textual task strong hint form refer bodi part joint combin control individu behavior util coordin underli perform seamlessli integr sequenc effect mean encapsul gener behavior integr control scheme user complex articul agent modular approach control combin advantag success approach matar al compar set approach control anthropomorph includ implement dynam torso test compar control human qualit quantit includ natur hand veloc control flexibl facilit realist control human data gener independ techniqu implement gener closer fit desir human hand posit select goal posit control ik solver comput postur control achiev hand posit time human motion gener simul motion close fit human perform minim techniqu appli control paramet find movement minim match perform metric fundament tradeoff believ control effort approach produc result depend specif order address combin framework type movement primit refer frame type order maxim match descript task control achiev acknowledg work support nsf career grant matar author nanci pollard stefan schaal share provid insight comment simul develop georgia institut technolog refer arm kinemat annual review neurosci featur vertic arm journal neurosci ed make control anim articul morgan kaufmann san california kinemat redund intern journal robot research control merg mechan ieee intern confer robot pp ed robot plan mit ma intellig pp interact control graphic siggraph pp control dynam interact intern journal control introduct mechan massachusett coordin arm confirm mathemat journal neurosci forc field organ frog spinal journal neurosci kluwer style file anim human graphic siggraph annual confer acm addison pp approach journal dynam control user technic symbol learn distal cognit scienc control kinemat redund manipul ieee transact man cybernet comput scheme mechan transact asm journal dynam measur control point humanoid pollack intern confer simul adapt mit cape pp peopl watch human technic report brandei understand adapt group adapt behavior exampl group journal theoret artifici intellig behavior observ imit human cognit brain research primit articul meyer intern confer simul adapt mit pp movement control method dynam simul danc acm st pp control arm brain research nonlinear forc distribut system control primit repres learn ieee intern symposium comput intellig robot ca field comput paradigm motor control biolog cybernet combin primit vertebr motor nation academi scienc principl economi skill biolog cybernet constraint graphic siggraph pp program control technic report comput scienc tech report tr cornel robot mit ma anim dynam leg graphic siggraph pp control journal dynam control activ stiff control manipul cartesian ieee confer pp learn jordan neural inform process system mit pp implement control system magazin appli nonlinear prentic englewood nj control optim human arm biolog cybernet van de guid optim balanc terzopoulo anim simul pp isbn motion rate control manipul human ieee transact system mathemat coordin control arm plan mit pp matar al postur interact behavior humanoid robot pollack intern confer simul adapt mit cape pp rhythmic robot control intern confer intellig robot system graphic siggraph pp
DB/872 3 approach subsequ search sequenc park depart comput scienc lo angel lo ca usa kim depart commun engin nation korea weslei chu depart comput scienc lo angel lo ca usa keyword similar sequenc time index techniqu abstract paper investig subsequ search problem time warp sequenc time warp enabl find sequenc similar chang pattern length work motiv observ subsequ search slow quadrat total length data sequenc resolv approach subsequ search modifi similar measur time warp time warp limit number subsequ compar queri sequenc effici retriev similar subsequ dismiss extract featur vector data segment exploit monoton chang build index tree queri process index featur successor effect approach verifi experi synthet data set introduct sequenc set data order list element similar search oper find sequenc subsequ approach dismiss time warp similar measur subsequ similar queri term origin time warp distanc includ answer set approach permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee acm symposium appli comput la nv copyright acm chang pattern similar queri sequenc similar search grow import data mine data wareh research effort effici similar search sequenc euclidean distanc similar measur recent techniqu tend favor time warp distanc higher accuraci wider applic high comput cost time warp transform sequenc element replic time extra cost sequenc ident transform time warp time warp distanc defin smallest distanc sequenc transform time warp euclidean distanc sequenc compar time warp distanc appli sequenc arbitrari length time warp distanc fit sequenc length time warp distanc appli sequenc subsequ search data sequenc queri sequenc time warp distanc complex jj xj qj length queri sequenc submit subsequ search denot subsequ element posit denot suffix start posit time warp distanc subsequ queri sequenc obtain distanc comput number distanc comput subsequ search number suffix suffix averag length subsequ search requir comput complex comput complex sequenc averag length cost linearli total number data sequenc quadrat averag length data sequenc subsequ search perform degrad typic environ larg number long sequenc store tackl problem scheme resolv primari goal paper make subsequ search linear averag length data sequenc achiev emploi approach subsequ search effici index techniqu rest paper organ overview search problem section section similar measur defin index construct queri process method present section section effect approach verifi result section relat work approach permit match sequenc length emploi modifi version edit distanc consid sequenc similar major element match time warp distanc similar measur filter index filter distanc filter modifi edit distanc time warp distanc focu sequenc search present access method subsequ search time warp distanc categor suffix tree index structur distanc function index retriev similar subsequ dismiss comput complex quadrat averag length data sequenc subsequ search algorithm convert data sequenc order list linear segment fit line appli modifi time warp similar measur sequenti suggest subsequ search techniqu accumul time warp distanc similar measur effici queri extract featur vector data sequenc build suffix tree categor featur vector show fairli good perform subsequ optim number categori hard determin suffix tree apt larg data sequenc long search introduc modifi similar measur time warp time warp reduc number subsequ compar queri sequenc convert data sequenc order list segment queri process convert queri sequenc order list segment number segment queri sequenc compar subsequ consist consecut segment data sequenc segment denot segment segment similar determin time warp distanc time warp distanc segment segment pair time warp distanc equal make similar analyz comput cost averag number element segment cost comput time warp distanc segment pair number segment cost comput similar number segment number subsequ consist consecut segment cost subsequ search cost linear length present detail descript segment method obtain order list segment sequenc extract featur vector method make segment monoton chang pattern segment ff ff monoton chang pattern ff ff ff ff data sequenc segment segment scheme similar measur similar measur intuit user easili applic sequenc length definit subsequ distanc function defin max time warp distanc function segment impli segment pair time warp distanc time warp distanc function element segment match neighbor element segment minim distanc segment formal definit index scheme process approach approach read data sequenc comput data subsequ queri sequenc effici queri index discard subsequ rapidli defin notat section maximum minimum element valu segment ff ff denot monoton ff ff monoton ff ff ff height element featur extract segment ff ff featur vector extract exploit monoton chang properti ffl begin element ffl element ffl number element ffl sum height element ffl maximum deviat interpol line ff ffl minimum deviat interpol line ff interpol line segment ff obtain connect express ip ff ff ff ff repres featur interpol line express ip element deviat defin ff ip deviat valu maximum assign minimum assign index construct build index structur rtree set featur vector extract data segment featur vector element organ attribut determin minimum bound rectangl remain featur leaf node filter locat actual data sequenc effici find order relationship segment identifi segment express segment ff identifi immedi segment identifi immedi segment identifi queri process queri process algorithm consist filter shown figur algorithm convert queri sequenc segment queri segment index filter valu index filter retriev set candid segment similar pass queri segment index filter run serial parallel fashion depend environ featur filter refin output index filter exploit featur leaf node index successor filter assembl candid subsequ order relationship candid segment final answer obtain actual data sequenc retriev candid segment queri sequenc segment index filter queri segment index filter queri segment index filter queri segment featur filter candid segment featur filter candid segment featur filter successor filter candid segment candid segment candid segment postprocess candid subsequ similar subsequ figur queri process algorithm similar measur appli discard alarm index filter point element queri segment toler index filter construct queri rectangl find data point locat queri rectangl set data point belong queri rectangl repres set data segment element claim data segment queri rectangl time warp distanc larger queri segment proof theorem theorem segment ff data point segment fi data point jb jl featur filter featur filter perform filter output index filter estim distanc segment accur distanc function ft lb ff ub ff featur vector valu ff comput deriv procedur lb ff max ub ff min fvg fvg fvg set element posit valu smaller find element posit fvg closest segment largest fvg segment smallest fvg element posit directli obtain featur vector deriv process ae fvg set element posit valu larger find element posit fvg closest segment smallest fvg segment largest fvg element posit directli obtain featur vector detail deriv ae distanc function ft distanc function dft featur filter adapt distanc function lb introduc dft lb term featur dv max dv min loss assum exchang role rang ff ff fi ft defin dft max ae case ff fi overlap set element posit ff valu larger element posit closest set element posit fi valu smaller element posit closest readi deriv ft case ff fi overlap ft ff ub fi final case ff fi set element posit ff valu larger element posit closest set element posit ff valu smaller element posit closest readi deriv ft case ff fi dft ff ub ff dismiss ft consist underestim time warp distanc theorem show ft function proof theorem theorem ff featur dft queri process time total number data sequenc approach figur time approach scheme number data sequenc averag length data sequenc successor filter successor filter candid segment return featur filter construct set candid subsequ exploit order relationship candid segment candid segment ff fi subsequ ff ffl fi satisfi fi fi belong result featur filter ff belong result featur filter process start output featur filter end output featur filter candid segment fail form candid subsequ filter successor filter perform evalu perform evalu experi show successfulli perform subsequ search linearli total number data sequenc averag length data compar perform queri process approach approach perform implement approach scheme measur perform data sequenc queri sequenc gener data sequenc averag length queri sequenc data sequenc toler determin answer ratio answer ratio defin number answer divid total number data subsequ compar shown figur figur time approach scheme linearli number length data sequenc perform comparison implement queri process approach compar queri process time approach queri process time averag length data sequenc approach figur time approach scheme length data sequenc total number data sequenc queri process time answer ratio approach approach figur time approach approach scheme answer ratio answer ratio toler data set uc irvin kdd archiv gener data sequenc length queri sequenc averag length gener function figur show result answer ratio approach consist outperform approach achiev time warp distanc good similar measur data requir high comput cost search time quadrat length data sequenc perform subsequ search degrad significantli long data sequenc allevi approach subsequ search modifi similar measur time warp time warp reduc number data sequenc compar approach filter reduc queri process time result reveal queri process time scheme linearli number length data sequenc approach approach yield significantli lower queri process time compar approach segment index scheme assum segment monoton chang distanc subsequ defin maximum distanc segment pair subsequ assumpt suffix tree requir larger index space research support part nsf grant nih grant basic research program scienc engin kim kim encourag support refer swami effici similar search sequenc proc page shim fast similar search presenc translat proc page clifford find pattern time dynam program approach advanc knowledg discoveri data page ozsoyoglu match index sequenc length proc acm page manolopoulo fast subsequ match proc acm page keogh pazzani scale dynam time warp massiv dataset proc page chu approach subsequ search sequenc technic report ucla comput scienc dept hsu effici search similar subsequ length sequenc proc ieee page chu fast retriev similar subsequ long sequenc proc ieee knowledg data engin exchang workshop page rabin juang fundament speech recognit prentic mendelzon queri data acm page faloutso effici retriev similar time sequenc time warp proc ieee page
DB/873 3 abduct logic program antoni kaka depart comput cypru web marc deneck depart comput belgium web march abstract abduct logic program start late earli attempt extend logic program framework suitabl varieti problem arti cial intellig area comput scienc paper aim chart main develop eld ten year critic view develop comput suitabl applic paper attempt challeng prospect develop eld introduct abduct embrac ai nonmonoton reason paradigm address limit deduct reason classic logic role abduct demonstr varieti applic reason paradigm ai diagnosi natur languag understand default reason plan knowledg assimil belief coordin problem context logic studi abduct infer start end eighti outcom di erent attempt logic program solv face limit standard logic program solv di erent research extend logic program abduct introduc abduct logic program order solv plan problem event calculu abduct solv plan goal explain order set entail plan goal approach explor al deneck jung recent kaka mancarella show applic abduct logic program deduct updat knowledg assimil applic abduct diagnosi studi abduct logic program framework semant de ned suitabl extens complet semant lp parallel studi abduct inferenti kowalski kaka mancarella dung abduct semant devic describ semant logic program analog pool abduct logic program investig knowledg point view suitabl repres reason incomplet inform de nition assert knowledg shown abduct logic program comput paradigm resolv limit logic program respect higher level knowledg reason task alp manifest framework declar problem solv suitabl broad collect problem start number abduct system develop abduct procedur comput negat failur abduct extend case gener abduct predic extend incorpor constraint solv clp framework call integr featur abduct constraint logic program earli abduct procedur develop complet extens sldnf abduct abduct abduct procedur regard hybrid sldnfa procedur consol al de ned base explicit rewrit rule complet equal incorpor constraint solv similar procedur bottom combin top system implement model gener develop multiprocessor machin develop recent abduct procedur exploit tabl techniqu xsb ort potenti applic time ort develop ectiv system base abduct practic problem eld face extend continu number challeng volum journal logic program special issu abduct logic program paper open perspect relationship abduct comput paradigm implement level recent import progress made level aim chapter give overview state art abduct logic point problem challeng sketch recent progress rest paper section brie review studi abduct ai philosophi situat abduct logic program broad context section formal de nition review di erent formal semant literatur section review di erent alp framework develop potenti scope applic link extens lp paper end discuss futur challeng prospect develop eld alp abduct emerg context philosoph studi logic view abduct aim section give person view emerg recent studi eld arti cial intellig logic program term abduct introduc logician philosoph cs pierc de ned infer process form hypothesi explain observ phenomena abduct de ned broadli form refer fact gener hypothesi subject extra qualiti condit form minim econom criterion de nition extrem gener cover form hypothet reason wide rang di erent human scienti discoveri philosoph treatment human cognit formal de ned reason principl formal comput logic context formal abduct de ned logic theori repres expert knowledg formula repres observ problem abduct infer search explan formula sati wrt hold subject restrict minim criteria criteria restrict form explan formula restrict predic view de ne free sati wrt free abduct explan observ formula logic entail observ good natur view explan observ latent form probabl latent lead note entail causal entail entail doctor explain hypothesi account explan exampl causat entail correspond rare turn applic abduct theori describ explicit causal inform notabl case diagnosi tempor theori describ ect action restrict explan formula predic describ primit explan formula entail observ observ class logic entail view implement causal view abduct infer relationship reason paradigm form hypothet abduct versatil inform reason incomplet uncertain knowledg incomplet knowledg state air domain uncertain knowledg truth domain presenc incomplet deduct reason paradigm determin statement true state abduct return explan formula collect state air observ true abduct strongli relat model gener sati abil check nement form reason de exist abduct answer prove sati abil observ abduct return inform answer describ properti class state air observ valid philosoph logician argu abduct induct induct form infer explan philosoph de nition abduct gener abstract cover form infer formal distinguish context formal logic relat problem term abduct denot form reason distinguish induct reason current applic relat causal evidenti model reason studi link abduct abduct goal infer extent knowledg speci state scenario world applic goal infer intent knowledg hold di erent state air current state world abduct solut problem car start morn explan batteri empti explan extent induct infer deriv set exampl rule batteri empti car start intent knowledg consequ abduct answer induct answer di erent format induct answer gener rule refer scenario abduct answer simpler set ground describ observ current scenario distinct form answer reason induc strong di erenc underli infer procedur abduct declar knowledg earli dai deduct consid fundament problem solv paradigm declar logic standard logic program belong paradigm base deduct queri solv shown easili abduct natur option declar problem solv argument process declar knowledg start design alphabet alphabet de ne ontolog domain design repres concept relationship problem domain human expert begin knowledg descript phase express knowledg formal statement obviou choic alphabet determin factor qualiti speci cation alphabet complex simpl correspond relat function domain complic knowledg descript phase express men natur alphabet rule express repres set person balanc binari complic signi cantli express knowledg obtain declar knowledg choic alphabet govern criteria isomorph concept human expert choic alphabet determin kind infer solv speci comput problem alphabet comput problem search extens unknown predic sati es condit de nition abduct infer problem model gener problem comput problem occur frequent assum solv problem time tabl lectur import type object domain time slot class room lectur place class room time slot natur choic repres relat time room observ alphabet solv time tabl problem requir comput tabl time room atom sati es constraint condit correct schedul comput tabl abduct deduct task illustr gener phenomenon logic problem solv choic ontolog alphabet sort infer solv comput problem alphabet chosen accord natur structur domain abduct infer model gener vice insist deduct infer forc lack choic alphabet function choic time tabl problem solv deduct queri solv prolog case di erent complex ontolog list atom complex ontolog reduc readabl modular make logic speci cation problem depend reduc reusabl choic govern issu natur issu comput ectiv complex ontolog reduc eleg greatli augment express encod heurist strateg inform solv comput problem aim research intellig search infer method push direct declar abduct logic program section present brie abduct de ned context logic program abduct logic program theori de ned tripl consist logic set ground abduc atom set classic logic formula call integr atom occur head rule recal close relationship abduct model explain previou section abduc speci ed predic eld abduct logic de nition abduct de nition abduct logic theori abduct explan queri set ground abduc atom ic consist remark order de nition gener di erent wai de ne notion abduct solut term semant standard logic program choic semant de ne entail relat notion consist logic program notion abduct solut main semant logic program de ne di erent abduct logic framework de nition gener choic syntax syntax normal logic program negat failur investig abduct context extend logic program constraint logic program integr constraint ic introduc de ne constrain abduct solut di erent view earli work abduct theorist context classic logic base consist view constraint extens theori abduct solut requir consist integr constraint ic consist de nition implement entail abduct solut entail constraint view strictli stronger consist view version alp de nition aim de ne concept abduct solut queri de ne abduct logic program logic pair syntax semant notion gener model de origin suggest de nition de nition model abduct logic framework exist set model classic model ic entail relat abduct logic framework classic logic formula de ned standard ic model note de nition gener choic semant logic program abduct extens stabl semant semant de ned complet semant extend case abduct logic program semant complet semant abduct logic framework de ned map complet rst order logic theori consist set uniqu clark equal theori ic set complet de nition predic argu applic set abduct logic framework repres human expert strong de nition knowledg fulli determin group predic term open predic rule repres case de ned predic head program exhaust case set set open predic set rule de ne de ned atom open predic de nition human expert weaker assert knowledg repres theori ic integr constraint interpret alp context knowledg abduct logic program call open logic program abduct logic program framework framework de ned previou section gener syntax semant past ten framework instanti di erent wai aim section present brie number altern framework attempt show wider varieti motiv approach found abduct logic program di erent instanti di er di erent formal syntax simpli di erent infer induc di erent procedur semant varieti approach begin eld argu section converg approach import problem eld current attent approach complet semant lp abduct deduct rst alp framework syntax framework hierarch logic program prede ned set abduc predic formal syntax hierarch program extens clark complet semant predic complet main aim work studi relationship abduct deduct set nonmonoton reason nonmonoton reason predic explanatori closur implement sort closur principl extract implicit neg inform explicit posit inform shown work abduct explan queri respect set rule deduct appli complet semant closur principl abduct logic program abduc complet pc consist nition predic rewrit observ formula languag abduc predic pc formula call explan disjunct abduct solut restrict hierarch program ensur termin procedur comput explan formula abduct framework formal diagnost problem solv classi cation nonmonoton inherit hierarchi extend updat deduct complet semant basi optim abduct problem solv sldnfa open logic program sldnfa abduct extens suitabl abduct reason context abduct logic program complet semant procedur earli attempt implement abduct reason event calculu earli experi procedur context tempor reason plan number subsequ knowledg reason experi abduct logic program sldnfa attent gradual shift semant aspect formal abduct reason sldnfa shown abduct problem deduct problem stress develop open logic lp knowledg framework repres incomplet knowledg tbox descript open logic program repres set de constraint repres abox descript logic link descript logic investig work progress direct comput ort improv comput perform express sldnfa integr higher order aggreg logic problem base weak complet semant correctli deal posit induct de nition transit closur evolv integr classic logic induct de nition semant sldnfa appli experi plan tempor reason schedul constraint iff framework iff framework base complet semant initi develop unifi framework integr abduct view updat extens develop deal predic constraint logic aim applic semant queri modi cation iff proof procedur incorpor negat failur experi proof procedur model reason underli agent speci cation manag activ rule main underli lp semant framework fit complet semant framework de nition de ned explicitli user iff proof procedur appli number rewrit rule obtain disjunct answer initi goal main rewrit rule backward reason de forward reason integr constraint answer goal conjunct abduc possibl denial integr constraint framework appli problem inform integr manag inform network approach stabl semant logic program semant nement complet semant includ stabl model semant model semant alp framework semant underli lp framework bottom abduct work aim develop ecient abduct infer procedur alp kaka mancarella gener stabl model semant approach base translat abduct logic program pure logic program stabl model semant abduct solut wrt origin abduct logic program correspond stabl model translat develop system stabl model comput result system comput abduct solut system extens procedur comput model dynam check integr constraint comput stabl model deriv fact pure approach problem system make choic atom lead queri simpli irrelev queri avoid bottom system integr procedur expect model gener procedur search atom rule relev queri integr steer search direct solut framework appli problem legal reason comput similar case problem consist manag softwar engin abduct constraint logic program framework grew attempt address problem provid declar program model environ problem arti cial intellig time accept comput perform root work abduct negat failur earli de nition abduct logic program kei element support abduct central infer facilit declar problem constraint solv enhanc ecienc comput process abduct infer appli problem hand abduct theori integr de ned clp languag nite domain constraint semant form model semant extend obviou de nition underli lp framework clp negat mean abduct comput homogen abduc gener comput model consist cooper interleav constraint abduct consist check abduc assumpt constraint satisfact gener constraint integr abduct reason constraint solv constraint solver solv nal constraint store gener abduct reduct ect dynam abduct search solut enabl abduct reduct prune earli set suitabl clp constraint abduct solut construct appli di erent type problem includ time tabl inform integr framework integr induct logic program form machin learn incomplet inform extend prefer abduct order broaden applic alp ai inou sakama kind extens extend abduct prefer abduct extend abduct extens abduct infer method infer abduct atom remov abduct atom abduct program method comput extend abduct model gener method term rewrit transform method reduc problem comput extend abduct standard abduct problem extend abduct potenti applic abduct theori abduct nonmonoton view updat deduct theori contradict system repair problem model induct logic program prefer prioriti di erent liter program prioriti induc prefer order model abduct program abduct solut queri goal prefer abduct comput prefer solut procedur comput prefer abduct de ned prefer abduct resolut multipl extens problem nonmonoton skeptic reason rule prefer view updat legal reason abduct extend lp abduct framework base extend logic program abduct logic program framework tupl ic extend logic program explicit default ic set constraint set ground object liter atom explicitli negat atom declar semant formal base semant extend program tabl mechan integr abduct reason system execut abduct queri stage program transform ad rule nite ground program rule falsiti result program call dual program evalu method oper dual program framework appli medic diagnosi reason action solv inconsist metaphor reason diagnosi power grid failur probabilist horn abduct independ choic logic probabilist horn abduct evolv independ choic logic combin logic reason belief network simpl coher framework develop motiv theorist system extend framework includ logic belief markov process strateg form game special case shown close relat bayesian network uncertainti repres probabl independ choic logic theori made choic space consist disjoint set ground atom element choic space call altern acycl logic program element altern uni es head semant world choic element altern true world stabl model atom chosen logic program intuit logic program consequ choic framework abduct explan observ provid descript world true belief network de ned independ probabl distribut altern natur make choic altern case bayesian condit correspond reason framework independ choic logic extend theori agent make choic natur case multipl agent make choic di erent implement icl special case exist includ implement explan topdown implement ground probabilist variant con ict diagnosi algorithm base ecient implement belief network exploit independ inher rule form initi studi applic icl center problem diagnosi robot control alp system applic implement gener abduct logic program system develop recent experi initi applic system develop implement framework alp restrict full framework system implement top clp languag clp constraint solver handl constraint nite domain atom architectur system gener implement similar constraint solver inform web direct comparison experi underli clp system demonstr potenti alp provid model environ modular exibl signi cantli comput ecienc underli clp framework appli di erent type problem initi applic concentr problem time tabl plan applic includ optic music recognit implement system handl recognit incomplet resolv inconsist softwar requir simpli ed form identifi inconsist suggest restor consist speci cation intellig inform integr basic framework develop inform mediat semant integr inform web page sourc applic notabl except applic small size compani cypru indic gener methodolog guidelin develop abduct applic schedul applic produc solut judg good compar manual gener solut expert year time provid exibl platform compani easili experi polici prefer system develop kuleuven implement abduct context support directli gener rst order classic axiom languag system integr constraint solv gener abduct resolut sldnfa implement top sicstu prolog system context prototyp constraint solv problem logic plan problem block extens system small industri schedul mainten unit power plant due higher order aggreg summat problem repres short extend system higher order predic solv problem gener nite domain constraint store subsequ solv underli comparison pure show bene combin reason ecienc program ort due modular declar knowledg compar di erent approach solv constraint problem includ smodel system bottom abduct procedur implement truth mainten techniqu top expect method number applic domain legal dynam notion similar case legal reason implement abduct logic program input system legal case base current case posit user system translat case base current case abduct logic program proof procedur system comput import factor retriev similar case base import factor gener explan current case similar retriev case prefer user posit system extend legal rule legal case combin interpret consist manag softwar system comput minim logic speci cation abduct logic program speci cation written horn translat abduct logic program incompat speci cation inform system comput abduct maxim consist program avoid incompat system base abduct procedur implement top integr tabul abduct consist preprocessor gener dual metainterpret tabl evalu abduct goal preliminari metainterpret written xsb system work order migrat tabl mechan care work underwai xsb system set remov oper implement engin level system appli medic diagnosi result investig logic autom statist manual mental current user interfac system abduct simpl clinic relev hypothet inform patient system diagnosi basi limit inform rst applic abduct emploi detect speci cation inconsist diagnosi system power grid failur abduct abduc hypothet physic event diagnosi system wrong diagnosi violat speci cation constraint prototyp implement iff procedur origin iff proof modi cation proof procedur suggest rst prototyp voyag extens interact commun multipl cooper problem solv prototyp appli inform integr multipl sourc manag inform network integr progol learn precondit action framework event situat calculi prototyp implement extens proof procedur appli schedul semant queri link alp extens lp parallel develop framework system alp clear exist strong link alp extens logic program link found enhanc capabl alp framework comput ectiv suitabl applic present brie main link alp lp extens answer set strong connect establish abduct logic program stabl model semant asp level semant framework larg class theori admit special type integr signi di erenc comput model asp work proposit ground theori global satisfact comput previou alp comput directli abduct theori expect integr approach enhanc capabl framework induct logic program abduct induct reason combin enhanc abduct reason feed induct process prepar data synthesi alp ilp investig form knowledg intens learn complex background theori abduct infer train data give altern possibl assimil data framework ilp extend learn incomplet background data result theori alp theori framework perform multipl predic learn natur constraint logic program integr constraint solv abduct logic program import languag level implement level languag enhanc express languag arithmet express implement experi shown constraint solv techniqu abduct reason make abduct comput ecient integr paradigm alp clp constraint program environ modular exibl problem domain potenti bene ts paradigm larg unexplor moment disjunct logic program correspond alp paradigm shown hypothet reason alp reason ind nite inform dlp interchang theori framework transform framework execut framework transform alp theori dlp system recent develop dlv system answer abduct queri shown abduct proof procedur basi develop comput dlp program challeng prospect alp decad studi shown abduct reason address varieti problem framework develop paradigm initi eld face extend continu number challeng methodolog comput level achiev goal provid ectiv declar problem solv framework suitabl varieti problem section attempt chart challeng heterogen alp term abduct gener term denot broad class reason phenomena gener carri alp section alp heterogen eld di erent formal di erent semant abduct denot concept total di erent conceptu level framework discuss abduct concept inferenti form logic infer abduct concept semant level abduct semant negat failur abduct semant techniqu speci style de ning formal semant develop comput ort di erent level semant research clarifi declar knowledg research clarifi applic logic research explor relat implement research investig implement ecient problem solver ort link construct cross support current heterogen eld make combin ort extrem dicult conceptu homogen import eld extend focuss procedur homogen obtain elabor logic foundat alp select speci class applic epistemolog foundat alp underli problem eld lack epistemolog foundat result heterogen exhibit eld epistemolog studi logic concern question knowledg express logic lai foundat systemat develop knowledg methodolog logic epistemolog studi alp contribut signi cantli understand eld logic methodolog level knowledg repres abduct logic except work question receiv attent alp de nition abduct solut aim de ne formal correct criterion abduct address question alp formal interpret de nition formal model semant alp provid clear answer negat alp extend complet semant de ned alp map negat failur liter classic negat kaka mancarella de ne stabl negat failur liter interpret modal liter autoepistem logic default open question relationship classic logic alp framework arbitrari fol theori alp extens classic model alp framework classic model suggest epistemolog alp extens fol alp de ned studi abduct reason fol studi deduct reason rst extens epistemolog alp complic develop systemat knowledg methodolog introduc lack coher eld continu blur contribut alp knowledg level ai commun answer question found earlier mention theori abduct logic framework natur repres de nition predic repres set classic logic assert view alp induc knowledg methodolog similar descript logic base de nition knowledg logic program rule assert knowledg constraint view alp studi abduct model gener context de nition assert inform comput applic challeng comput challeng paradigm aim di erent abduct framework provid framework solv broad class problem declar extrem dicult formal complex result show gener problem comput abduct hard gener case alp framework function exist abduct solut undecid problem datalog problem comput abduct solut intract practic level challeng alp compar clp understand satisfi ectiv constraint theori high logic time con ned domain arithmet recent experi reduc ectiv high level alp lower level constraint handl ecient system problem handl instruct stage focu class applic problem end develop comput techniqu applic di erent wai approach problem comput complex alp ne current wai integr niqu constraint solv abduct infer mention recent experi shown class high level alp reduc ecient lower level constraint handl ecient system hybrid comput model alp studi interfac abduct reason solver black box interest examin case integr solver ect dynam abduct comput gener nite domain constraint store alongsid abduct reduct di erent wai ect reduct steer search abduct solut import challeng alp studi techniqu constraint solv constraint program incorpor exploit comput alp search problem abduct gener techniqu heurist arti cial intellig due strong link abduct plan studi recent develop heurist method search plan appli gener case abduct comput complementari approach address comput hard appli alp develop alp system user facil increment ne model problem modular start pure declar model develop model addit knowledg includ heurist oper control knowledg recent work suggest line develop systemat studi model environ design build alp abduct wide rang potenti applic essenti featur featur make abduct evalu bene ts abduct moment clear answer question reason fact focu type applic primari problem solv task examin abduct alp case abduct ad hoc methodolog guidelin develop applic mention eld de ne prototyp class problem method possibl constraint satisfact problem problem speci knowledg exploit approach develop alp model environ constraint program modular exploit addit knowledg problem plan speci case previou problem knowledg intens learn machin learn rich background knowledg perform induct method integr abduct integr alp ilp provid framework enhanc separ capabl abduct logic program grew attempt logic program techniqu broad class present abduct logic program present logic program declar problem main emphasi till set di erent framework abduct show provid gener approach declar problem solv alp face number methodolog comput level typic eld initi stage develop begin understand contribut eld develop solut problem eld face logic alp aim suitabl declar knowledg facilit reusabl grace modi abil alp retain logic program possibl high level strateg inform abduct program speed ne tune comput alp combin advantag declar speci cation program greater extent standard logic program eld start full extent problem complex develop ectiv useabl alp system task alp provid gener model environ time ectiv system extrem dicult begin learn break task subproblem amen studi current understand eld hope remain program environ alp programm solv problem ectiv refer swift abduct tabl dual program proc intern confer logic la nov dec plan abduct updat proc pereira jg datalog grammar abduct syntact error diagnosi repair proc natur languag understand logic program power grid failur diagnosi certi cation technic lisbon mello express collabor competit abduct logic agent charniak mcdermott introduct arti cal intellig kl clark negat failur gallair logic page plenum torasso relationship abduct deduct journal logic compil knowledg guid focu abduct diagnosi ieee transact knowledg data vol pp ml role abduct view updat journal intellig inform vol pp deneck terminolog interpret logic program vw intern confer logic program nonmonoton lectur note arti cial intellig page deneck de abduct procedur normal abduct program kr proc intern joint confer symposium logic page mit deneck de repres incomplet knowledg abduct logic program proc intern symposium logic page mit deneck de repres incomplet knowledg abduct logic program journal logic septemb deneck de abduct procedur abduct logic program journal logic bruynoogh tempor reason abduct event calculu proc european confer arti cial intellig john wilei van de event calculu protocol speci cation experi intern joint confer symposium logic page mit deneck extend classic logic induct de nition intern confer comput logic volum lectur note arti cial page juli springer mechan abduct reason phd dip di pm dung negat abduct foundat logic program proc intern confer logic thoma georg nicola leon abduct logic semant complex theoret comput scienc thoma wolfgang nicola gerald pfeifer declar dlv system jack arti cial intellig kluwer academ abduct plan event calculu ra kowalski ka proc intern confer logic program mit ra kowalski abduct compar negat failur proc intern confer logic program pereira diagnosi viewpoint comput logic proc classic negat logic program disjunct gener pp fixpoint semant gener logic program compar stabl model semant proc pp flach kaka abduct essai relat integr kluwer academ flach kaka abduct induct background issu peter flach antoni abduct essai relat integr abduct deduct phd imperi ra kowalski procedur abduct logic program journal logic program gelfond lifschitz stabl model semant logic program proc intern joint confer symposium logic page jr integr abduct framework interpret symposium autom inou hypothet reason logic program journal logic inou simpl extend abduct intern confer comput lectur note arti cial page abduct model gener technic report institut gener comput sakama abduct framework nonmonoton theori chang page morgan inou sakama abduc prioriti deriv intend page morgan inou sakama comput extend abduct transact program annal mathemat arti cial jr josephson sg editor abduct technolog cambridg cg plan abduct event calculu technic report dfki report kaka integr abduct constraint solv abduct logic program journal logic comput ra toni role abduct logic program handbook logic arti cial intellig logic program page dm cj hogger ja robinson oxford press ac kaka mancarella stabl semant abduct proc european confer ac kaka mancarella updat abduct proc larg page morgan ac kaka mancarella relat truth mainten abduct proc paci rim intern confer arti cial kaka mancarella knowledg assimil abduct intern workshop truth springer verlag lectur note comput vol pp integr abduct constraint logic program proc intern logic program pp ac kaka michael schedul abduct pp ac michael case reason ac michael abduct constraint logic program journal logic program issu abduct logic vol pp ac kaka flexibl solut complex problem logic program ac kaka abduct concept learn gener vol pp logic program system annal arti cial intellig ra kowalski sergot calculu event gener execut suspend logic program fundamenta informatica iso press metaphor map consist dynam logic program lloyd al proc int conf comput logic page lnai jw lloyd foundat logic program mccarthi action causal law technic report arti cal intellig marc mauric bruynoogh abduct plan system base event calculu journal logic septemb lr deneck abduct plan event calculu intern depart comput muggleton theori complet learn induct logic niemela simon smodel implement stabl model semant normal logic program proce intern confer logic program pp role abduct reason process belief phd depart comput cs peirc philosoph write peirc dover de marc deneck logic program approach repres solv constraint satisfact problem comparison intern confer logic program autom accept lm jn jj alfer nonmonoton reason semant proc intern confer logic page mit pearl probabilist reason intellig network plausibl infer morgan san pool logic framework default reason arti cal pool methodolog default abduct reason system intern journal intellig decemb pool logic abduct anytim algorithm comput prior posterior probabl gener pool probabilist horn abduct bayesian network arti cial pool probabilist con ict search algorithm estim posterior probabl bayesian network arti cial pool independ choic logic model multipl agent uncertainti arti cial special issu econom principl system pool probabilist partial exploit rule structur probabilist infer proc intern joint conf arti cial intellig page logic reason system default diagnosi cercon knowledg essai page david pool bayesian graphic abduct peter flach antoni abduct essai relat integr logic reason system default diagnosi knowledg essai cercon springer verlag lectur note comput scienc induct abduct workshop abduct induct featur interact resolut hypothet reason proc world cybernet informat intern confer inform system analysi synthesi usa juli stabl model logic program negat proc pp base system semant integr intern data inform knowledg theme integr heterogen data wareh toni abduct negat failur activ agent proc congress italian associ arti cial page toni abduct negat failur activ reactiv mello proc congress italian associ arti cial springer verlag lnai page sakama inou updat extend logic program abduct lpnmr lectur note arti cial page sakama inou abduct logic program disjunct logic relationship transfer journal logic program special issu alp sakama inou altern approach semant disjunct logic program deduct journal autom reason interpret reason abduct logic program journal advanc comput vol pp comput minim logic program abduct proc intern workshop principl softwar pp level abduct decid similar case proc pp satoh queri evalu method abduct logic program kr proc intern joint confer symposium logic comput abduct tm proc pp queri evalu method abduct logic program proc pp comput abduct tm topdown expect journal logic vol pp correct proof procedur gener logic program integr mello extens logic lnai pp predict deduct explan abduct proc page toni autom reason collect inform manag proc intern workshop interact conjunct annual confer ec programm van de strong correspond descript logic open logic program lee proc intern confer logic page van ka js semant gener logic program journal van nu marc deneck problem solv experi int workshop reason session page april abduct constraint logic program phd imperi toni semant queri optim abduct constraint handl proc intern confer flexibl queri answer larsen christiansen springer verlag lnai xsb group xsb logic program version yamamoto abduct induct base bottom gener peter flach antoni abduct essai relat integr pp jh ly yuan goebel abduct approach disjunct logic program journal logic program issu abduct logic vol pp
IR/874 5 automat pattern acquisit inform extract comput scienc depart york ny usa central issu inform extract cost custom scenario research autom acquisit pattern import portabl scalabl introduc pattern pattern denot path depend tree sentenc outlin procedur acquir pattern text system extract relev sentenc train data base score common path tree relev sentenc extract pattern keyword inform pattern acquisit introduct inform extract system todai commonli base pattern match pattern written custom system scenario costli hand led recent research autom acquisit pattern text minim riloff report success result procedur corpu develop procedur unannot natur languag text common assumpt relev document includ good pattern riloff implement idea appli heurist rule document advanc system classifi document seed pattern specif scenario find pattern relev document set repres riloff reli sentenc structur english predefin heurist rule base syntact comput scienc depart york ny usa ralph grishman comput scienc depart york ny usa tripl predic challeng care examin reveal challeng autom acquisit pattern inform extract languag challeng languag free free word order problem analyz captur pattern predic permut argument list pattern separ constraint predic pattern number pattern cover simpl fact rise unaccept high flexibl case mark system difficulti languag flexibl case mark found argument mark object english mark case marker mark grammat categori situat topic marker mark entiti mark english difficult deal varieti simpli fix number argument predic creat pattern relationship direct captur relationship predic modifi argument previou introduc ad hoc frame obj extract relationship sentenc assum relationship clausal boundari problem li relationship event subordin sentenc announc retir hard find relationship event retir global view predic problem lead system fail captur argument fill templat overcom problem make system capabl find pattern train templat introduc pattern acquir automat pattern tion definit pattern pattern base depend tree sentenc pattern defin path depend tree pass intermedi node tree depend tree direct tree node phrasal direct arc denot depend denot depend subject depend relationship limit element includ modifi head cover relationship sentenc inform extract figur show comparison base af left part figur sequenc phrasal unit sentenc order tree part depend tree find relationship base pattern dummi express hold denot direct relationship repres complic pattern node root node depend hard repres sentenc structur match target sentenc depend tree predic detect predic node root find match pattern benefit advantag pattern match surfac base pattern address problem mention previou free problem offer direct depend relationship free problem freeli depend tree find path pattern depend predefin riloff indirect relationship find indirect relationship predic modifi argument parser obtain depend tree sentenc predic pattern øó captur relationship sentenc appoint relationship clausal boundari captur relationship clausal boundari pattern øó find relationship combin relationship merg event algorithm outlin procedur automat acquisit pattern emploi cascad shown figur origin document process morpholog analyz system retriev relev document scenario relev document set select set relev sentenc relev sentenc set relev document set sentenc relev sentenc set path depend tree pattern document preprocess morpholog analysi entiti tag perform train data stage base tree algorithm inform stage document retriev system retriev document describ event scenario call relev document set set narr sentenc describ scenario select creat queri retriev set size relev document set retriev document ir system perform ir task inform retriev extract evalu project japan sentenc creat pattern retriev relev document set sentenc retriev system calcul score relev scenario sentenc relev document set retriev relev sentenc sourc set experi retriev sentenc sourc pattern extract subsect score word relev document set calcul score word û û æ û æ verb entiti number document term frequenc relev document set document frequenc collect system calcul score sentenc base score word unusu short sentenc depend tree pattern pattern pattern ê figur pattern unusu long sentenc penal score sentenc pattern é pattern figur extract pattern è û û number word av averag number word sentenc pattern extract base depend tree pattern extract relev sentenc retriev previou subsect figur show procedur retriev sentenc depend tree stage find predic tree system predic tree root shown path root node path collect count relev sentenc system path higher threshold extract pattern figur show exampl acquir pattern experi simpl task evalu good acquir pattern incorpor complet extract system templat find match pattern portion test sentenc good measur perform pattern task experi find phrasal includ match pattern test sentenc perform measur recal term number match pattern calcul origin document set è document preprocess relev sentenc set preprocess document set è è document retriev relev document set sentenc retriev extract pattern pattern extract figur pattern acquisit procedur process procedur paper base individu slot filler case procedur credit slot filler strictli entiti match pattern pattern case approxim potenti number assign match pattern assign number match pattern pattern manag success scenario match part test match gain number match denomin pattern match clinton gain number entiti pattern sake defin baselin system pattern acquir procedur direct relationship predic argument figur chose scenario execut manag event corpor manag left posit assum present past event item titl event suspect arrest item suspicion data manag success document sentenc date person organ tabl test set manag success scenario arrest document sentenc date suspicion suspect tabl test set arrest scenario corpu train previou system retriev articl scenario relev document set train data retriev sentenc relev sentenc set pattern extract test data manual review data month statist test data shown tabl result figur figur illustr curv sentenc english translat stage node stage é extract pattern announc appoint é figur pattern acquisit experi execut manag success scenario arrest rank acquir pattern calcul sum score sentenc retriev section word pattern sort basi obtain curv chang number pattern list figur show superior baselin system recal highest recal baselin level level higher baselin figur curv slightli shape lower recal low baselin due fact pattern list baselin pattern high score word pattern higher score figur show result experi arrest scenario recal achiev higher recal high recal baselin point baselin small number perfect highli rank arrest recal baselin announc figur result manag success scenario recal scenario pattern execut success promot assum announc inform promot arrest arrest suspicion arrest arrest suspicion arrest ag baselin figur result arrest scenario suspicion baselin arrest ag discuss low recal made class type crime recal arrest scenario low classifi reliabl make gain recal system class crime train data annot separ good indic sentenc acquir pattern incorpor class pattern reduc noisi pattern carri templat manag success defin tag entiti tagger includ titl knew knew pattern argument classifi class captur put weight pattern collect pattern higher achiev high figur acquir pattern erron case analysi investig train accid airplan accid report paper problem worth mention similar scenario result effect target event airplan accid error identifi match effect result incid typic airport close airplan accid perform document retriev sentenc retriev good frequenc relev acquir pattern low improv retriev robust approach relat sentenc scenario specif make difficult ir result document retriev stage includ document relat scenario broader specif task case airplan accid scenario result document retriev includ document accid traffic accid sentenc retriev pattern acquisit scenario affect result document retriev futur work inform extract appli acquir pattern inform extract step requir mention pattern set binari relationship predic merg match element event structur necess gener attempt gener pattern candid pattern expand thesauru introduc class suitabl domain class express flight number perform airplan accid scenario gener pattern improv recal robust pattern extract discuss previou perform system reli compon scenario difficult ir result affect investig conserv approach present result show procedur automat pattern acquisit procedur gener address problem specif morpholog parser produc depend tree procedur applic languag acknowledg research support advanc research project agenc part inform extract summar grant space naval warfar system center san diego paper necessarili reflect posit polici govern refer nagao kn parser structur analyz workshop sharabl natur languag morpholog analyz kyoto nara institut scienc ma inform retriev base stochast model riloff automat gener extract pattern untag text thirteenth nation confer artifici intellig tree method find classifi text sixth workshop larg discoveri pattern inform extract sixth appli natur languag process
DB/875 3 model schema select john roddick school comput inform south level south australia australia fabio mandreoli maria dipartimento di informatica universit di vial itali abstract schema version mechan handl chang structur system investig context static tempor grow interest spatial data mechan hold spatial context data format issu paper present model accommod schema version spatial relat schema schema introduct motiv schema version regard applic tempor semant schema provid mechan handl chang real world data independ fashion structur addit delet split coalesc addit delet achiev minimum impact data applic mechan version structur facilit altern structur data previou survei field review area glossari tempor concept schema evolut system support schema evolut permit modif schema loss extant data support previou schemata requir schema version system accommod schema version queri retrospect version interfac develop spatial spatiotempor import research topic recent research shown similar problem consid spatial problem experienc data chang schemata tempor schema version provid solut structur time abil version schemata spatial analogu locat schema appli abil appli schemata data applic differ applic land administr author paper investig lesson learnt theori develop tempor orient schema version examin appli spatial acknowledg spatial domain differ fundament wai solut handl time carefulli spatial context paper structur section review tempor schema version background model present section investig analog tempor spatial domain motiv spatial schema version section schema select model discuss research direct provid section tempor schema version revisit research schema evolut schema version undertaken number year result number schema handl discuss briefli issu data queri languag relat research survei found concept complet schema develop idea clifford warren complet relat enabl time access concept complet introduc discuss detail overarch schema time valid retriev complet schema detail defin minim superset relev schemata capabl hold data loss princip data mechan emploi event chang data simpli coerc format lazi mechan data convert access data physic convert access interfac queri languag extens accommod schema tempor queri languag orthogon ad exist function specif design schema data retriev statement shown figur specifi data held retriev schema format extant default effect resili compil program includ set schema date note set schema oper queri level heterogen queri singl dimens effect expand support schemata pre data retriev number time dimens identifi case make distinguish ffl time event occur fact true realiti set schema date select dept cs overlap overlap figur queri refer ffl time data repres real world event fact record ffl time determin structur format data store simpli term arguabl version abil ffl time determin structur real world wide data real world manipul natur partner data ffl time current schema updat ffl time applic program compil applic static data structur program ffl time invok event term paper repres simpli shown figur object model actual occur data structur figur data structur time dimens augment diagram tempor schema dimens defin tempor data shown figur real world real world applic object model schema schema figur real object model schema time dimens statement data event time version happen record structur record structur applic compil applic access data store multipl valid singl queri record notabl discuss literatur work includ aspect multipl dimens head common posit literatur assum dimens time ident spatial schema version commonli state perceiv dimens space time time dimens number sensori physic attribut make simpl scale solut difficult ffl time unidirect system consid linear relat concept easili understood argu space dimens treat differ graviti accommod space geograph commonli ffl time space consid continu time discret isomorph larger granular select specif granular consid isomorph real number ffl common calendar preval singl express point time adopt inform system multipl set rule govern space uncommon frequent system spatial coordin handl inform system notwithstand translat tempor spatial domain made develop accept convent make volum work schema includ relat tempor schema version extend spatial spatiotempor model data gener research schema integr applic spatial popular area research adequ schema version problem evid system spatial schema version ffl mechan schemata applic locat import legal collect method ffl indic rule data collect manner interpret data collect countri collect protocol collect ffl method provid local ownership interpret central held author provid rule data collect author interpret spatial system rural map region method type entiti depict agricultur natur heritag nativ airport flood ignor quantum inform provis requir freedom inform privaci task combin map similar facet area global schema combin element local schemata determin data locat data refer note aspect discuss section spatial analogu tempor exampl statement data fact locat ffl happen ffl ffl structur ffl record spatial structur applic locat ffl record clear spatial correspond investig incorpor gener model schema select spatiotempor model schema select initi discuss model schemata label region default time option label space time suppli model degrad multipl static schema model option label suppli degrad schema version time suppli model degrad convent tempor schema version la limit case degrad version model embrac concept complet schema introduc construct minim schema capabl hold data loss complet relat scheme relat scheme minim union explicit attribut defin relev spatiotempor span relat domain attribut syntact gener hold data store version implicit primari kei defin maxim set kei attribut scheme relev span version schema view ax space time figur schema version pertin time label coordin figur schemata defin assum dimens time expand schema activ appli transact applic area schema point schemata valid region differ respect test schemata valid region resp shown time schemata construct queri area queri rang determin area union area defin output schema includ area determin step complet schema construct area schema includ queri view queri execut compil schema coerc data conform complet schema inform lost step lost result convert output transform rule output schema format requir note queri bound region queri spatial region multipl schemata time compil complet schema problem gener problem schema integr coupl accommod tempor spatial semant schema version parallel version model schema data select model gener appli flexibl model support seamless integr spatial parallel version facil treat uniform coordin system mean coordin impli special select tempor spatial parallel version combin intent part set schema version sv part set data schema version structur schema definit part schema definit part includ data structur definit set catalogu tabl relat set class definit objectori coordin part defin area repres pertin schema version made set spatial region tempor notic tempor spatial coordin xyz coordin bitempor time schema version sv defin sv jl fs im ft ip coordin system schema version select mean select function sv coordin suppli repres point version singl schema version select sv jl schema version time coordin omit set point singl point composit function obtain complet schema composit function typic base union intersect semant depend applic requir label coordin select function defin sv sv notic result complet schema version set support schema version schema select function defin sv sv coordin combin singl coordin version dealt interv set coordin schema construct gener definit sv function sv sv previou exampl definit complet specif composit function complic simpl union intersect oper requir applic complex schema integr techniqu issu investig literatur overview method schema integr relat semant found objectori problem activ research solut semant syntact aspect consid fa part data organ adopt organ describ logic aim effici support queri process organ data repositori common store augment differenti number schema version figur common store logic structur definit common schema version schema version attribut definit type integ real attribut type includ common store structur structur defin common element maintain common store data replic differenti store organ common common figur organ data structur differenti store defin definit common part data instanc sv schema version retriev common store differenti store notic data retriev common store type attribut sv integ number store real number common refer suitabl function store differenti store case organ effici data retriev complet schemata involv assum data belong schema version sv sv requir complet schema sv sv comput intersect data found common store data store differenti store belong schema version discard complet schema comput union data found common store differenti store ds ds step queri process list section area queri complet schema qs construct mean sv function qs sv data access queri common store differenti store schema version involv qs data retriev process complet possibl function differenti store appli research paper discuss initi idea attempt date accommod schema version spatial research continu refin model issu queri languag support concern relat architectur issu lazi strict data speed access data current schemata consult experi discuss research albeit spatial schema version adjunct system interest investig util discov extent natur spatial schema version acknowledg work conceiv author attend integr spatial tempor workshop schloss dagstuhl novemb gmbh kind hospit provid conduc work comment refer jf survei spatiotempor press manag schema evolut proc seventeenth intern confer larg tempor orient data manag schema evolut tempor orient data knowl hj hf schema evolut persist proc sixth advanc compar analysi methodolog schema integr acm comput ds formal semant time acm tran de mr schema version relat inf mr formal model tempor schema version objectori technic report universita di research issu spatial sigmod rh introduct spatial system vldb al consensu glossari tempor concept februari version tempor research lectur note comput berlin heidelberg hf schema version view proc inform technolog harmon sr schema evolut oodb class version sigmod gt schema evolut system data knowl ca schema evolut design integr schemata research practic issu australian confer world la spatial final frontier theori dj class modif gemston dbm oopsla ip ic import metadata engin spatial data infrastructur proc western australia jf dynam chang schema model comput jf queri languag extens support schema evolut sigmod jf rt schema version support tempor queri languag kluwer academ boston jf survei schema version issu system inf jf model schema version tempor system comput sc rt tempor queri languag kluwer academ york meta oper type manag lazi mechan schema evolut proc intern confer deduct objectori dood schema integr confer advanc inform system engin
IR/876 5 scenario custom inform extract roman dissert submit partial fulfil requir doctor philosophi depart comput scienc graduat school art scienc york professor ralph grishman dissert advisor roman reserv wife cat iii acknowledg prof ralph concern advic matter academ happen research sponsor part advanc research project space naval warfar system center san diego grant result opinion express necessarili reflect posit polici infer member prof davi york clair cardi cornel invalu time comment prof alan richard helm comput scienc guid product place work hope trust continu team hour make project work famili friend make graduat life adopt thought contribut work kind existenti iv abstract scenario custom inform extract roman york research prof ralph grishman inform extract emerg nlp function process natur languag locat specif piec fact fill system todai commonli base pattern match core engin cascad set pattern linguist complex pattern consist regular express map syntact logic form pattern set custom defin set fact extract construct pattern base topic recogn princip wider technolog larg pattern base wide coverag thesi address portabl problem stage introduc set tool build pattern manual exampl adapt system subject domain user set sentenc train specifi map extract logic form system appli transform automat gener set pattern shift portabl bottleneck build pattern find good exampl methodolog discov good exampl automat larg corpu text system initi seed small set good pattern user increment learn procedur identifi pattern class relat term success iter present confirm discov pattern exhibit high measur term recal vi content dedic iii acknowledg iv abstract list figur xi list tabl xiii list xiv introduct central issu concept object studi prior work inform extract flavor learn method vii method automat method activ learn learn corpora overview system core engin interact custom automat discoveri pattern core system architectur lexic analysi recognit pattern logic phase organ pattern base formal evalu problem score acquisit document browser knowledg base editor edit pattern acquir precondit semant gener concept editor viii acquir action predic editor syntact gener acquir pattern evalu tool approxim match clausal modifi assess pattern discoveri motiv outlin note methodolog normal syntact analysi gener concept class index pattern rank document relev discov action result qualit evalu manag success merger acquisit corpor ix natur disast text filter event extract manag success discuss util analysi manag success error commiss error omiss research problem variat scenario converg syntact inform put formal framework dualiti rule instanc bibliographi list figur system architectur pet compon main document ne result st result success text extract record manual code scenario pattern initi analysi concept editor predic editor final pattern initi analysi np evalu window perform st task intuit iter discoveri densiti pattern distribut manag success xi pattern iter util util iter xii list tabl sampl tabl corpor acquisit muc histori lf complex np entiti lf lf appoint gg lf lf modifi infer event seed pattern set seed pattern set seed pattern set seed pattern set perform slot fill xiii list sampl sourc document sampl ne output sampl st output xiv chapter introduct subject matter thesi inform extract natur languag process artifici intellig fix coordin scientif give descript object process arbitrari free newspap magazin transcrib radio tv broadcast web find specif type fact report corpor merger reduc discov fact structur tabl spreadsheet text jack item market sudden bid maker dell comput announc yesterdai bid billion attempt acquir startup text convert system tabl buyer item price date dell jack reuter link sourc tabl sampl tabl corpor acquisit record tabl link back origin document exact place document event report highlight conveni access benefit transform unstructur origin text structur move benefit plain text oper perform keyword search wide rang oper appli tabl tabl corpor report text user issu complex tabl fact sort search record alphabet date net amount comput import benefit tabl form semant index text collect index index keyword collect organ date semant index order chao textual technolog order automat technolog result research cf chapter initi provid automat tool analyst govern agenc manual sift vast collect textual inform specif fact central issu concept task inform extract search free natur languag text context understood term formal fix set semant relationship event entiti particip semant object belong small number fix regular fix close circumscrib subject domain regular structur object store relat consequ regular structur result make establish notion compar system result correct perform system easili evalu evalu direct area machin translat text summar darpa conduct competit call messag understand confer cf chapter measur perform muc goal motiv discuss similar evalu inform score measur recal extract record field nomenclatur accept current term subject domain denot class textual document scenario denot specif topic interest set fact extract scenario topic sixth messag understand scenario system seek event highlevel corpor execut left post assum system todai commonli base pattern match partial syntact analysi pattern consist regular express map syntact logic form pattern store pattern knowledg base system princip factor recogn obstacl widespread inform extract perform user appli system domain scenario system port knowledg base built tune knowledg base recogn process zipf aka problem area nlp larg number fact cover small number frequent occur remain tail cover rare pattern full overcom problem give system develop abil quickli custom robust kb kb wide coverag high object studi focu attent pattern recogn complex custom address custom problem introduc set tool build pattern manual exampl adapt system domain user set train specifi candid map set semant object logic system appli transform candid automat gener set pattern shift portabl bottleneck build pattern find good candid methodolog discov good candid automat larg corpu text system initi seed small set pattern user increment learn procedur identifi pattern concept class success iter goal thesi present integr approach problem custom approach embodi actual test evalu viabil chapter review prior work chapter outlin approach chapter focu detail core system acquisit tool chapter present tool automat discoveri pattern chapter cover result chapter discuss research problem remain resolv chapter prior work inform extract fix origin messag understand confer held suggest work relat time earli indic potenti import extract relat text appli idea medic text field surg activ result muc sponsor navi explicit object stimul research inform extract total muc place muc textual domain topic cf tabl particip built system task particip muc year topic messag naval oper terror latin america newspap radio corpor joint ventur microelectron negoti labor disput corpor manag success airplan crash launch tabl muc histori sponsor distribut train form sourc document answer prepar human annot muc score tool compar produc system correct answer produc human annot test corpu develop hidden test document distribut week advanc final submiss result sponsor prepar correct answer kei test competit present studi build nyu inform extract system call muc chapter describ make heavi refer document call document corpu document answer distribut prepar part competit muc valuabl requir domain linguist extens human construct valid test corpora strictli reveal system benchmark port system domain requir heavi manual field emphasi shift explicitli rapid develop system particip week time announc topic train data time distribut test data formal evalu short compar month earlier evalu system reli heavili clever realiz complet sentenc find event field gener shift partial mean pattern match quest global full parser correctli identifi event argument prevail enabl task grew complex understand underli problem problem stratifi task particip judg task led site chose compet task todai task recogn complex entiti find categor class proper text templat element find entiti identifi featur civilian militari commerci entiti govern agenc find link refer entiti text templat relat find instanc broader relat relat person compani scenario templat find instanc event fact event complex relat multipl rocket relat launch cargo carri outcom failur center st note order perform st system perform task optim perform optim perform task find event find proper particip event sought ne plai import role chapter remain task scope studi flavor thesi focu extract fact term unstructur text contrast extract structur heavi form problem studi domain type relat interest exampl job classifi section newspap passag predict commonli extract item passag normal articl formal structur gener multipl instanc event extract learn method section present taxonomi relat method learn pattern observ trend manual construct pattern automat techniqu method prior system class requir interact user system present interact tool detail chapter gener exampl extract pattern massachusett corpu annot extract templat induc pattern base autoslog requir human checker weed undesir pattern similarli approach exhibit flavor place categori environ build integr iter user filter result automat pattern learn algorithm pet constitut advanc richer user control concept hierarchi provid automat syntact gener automat method method automat convert corpu annot extract exampl extract pattern report experi hidden markov model build symbol rule identifi slot filler induct logic program shortcom approach reduc burden find exampl annot shift portabl bottleneck problem build pattern find good system larg amount annot train simpl extract task autom train massachusett system perform train vast corpu substanti drop perform train reason larg train corpora system learn rule state term individu lexic recent work ntt describ system capabl special gener rule state term hierarchi word class activ learn automat learn annot corpu quickli pick common requir larg corpu achiev good coverag frequent pattern typic skew distribut pattern pattern long tail rare user undertak sequenti annot exampl automat learn find annot exampl activ learn method cut number exampl user annot select suitabl candid report gain learn select annot exampl match pattern similar good exampl match pattern uncertainti support learn corpora system system model bootstrap find pattern start small set exampl data process seed set tupl algorithm search larg corpu pattern tupl find addit exampl ad process repeat approach advantag fact event state repeatedli form larg web limit report approach pattern surfac inform inher limit scheme rank tupl relev reli fact relat function public learn unannot corpora constitut prior work close relat studi iter train mutual redund independ classifi classif bootstrap unclassifi web page find home page professor earlier pioneer bootstrap work simplic lucid show bootstrap train classifi proper noun learn pattern state term lexic item bootstrap problem idea import gener strength principl unifi research automat method fill slot event task closest relat find word class relev scenario pattern find word class pattern word syntact gener collect relev irrelev document pattern rank base frequenc relev part prefer pattern occur relev document pattern turn extract pattern task respect work close relat formula comput pattern score base formula present work crucial respect built observ express substanti relev text irrelev exploit dual relationship relev document good pattern forc relianc constraint remov work system attempt recov entir fashion muc task pattern produc system identifi np fill individu slot combin stage complet event templat work directli discov relat pattern approach reli set document relev util corpu high proport relev procedur requir relev work assumpt corpu balanc proport relev document small classifi document admittedli easier tag event instanc text automat formid task prepar test hour mark short document chapter overview system system logic divid core engin core engin oper regular express pattern match draw attend knowledg base vari ii gui front end core engin pet enabl user modifi knowledg base tune system domain scenario iii suit auxiliari aid user highli labori process tune knowledg base automat techniqu creat knowledg manual construct train corpora phase implement prof ralph grishman nyu particip muc detail phase ii iii provid function form substanc thesi develop phase ii address problem custom experi interact tool automat corpu provid approach compon list order emerg earli research wrote lisp prolog perl code build monolith extract system kb factor make system portabl conveni graphic editor develop kb question popul inevit manual search vast corpora typic relev aid standard ir techniqu narrow search question research aim answer core engin system consist cascad modul attend knowledg base modul transform input text document detail discuss customiz knowledg base term concept group term hierarchi class predic describ logic structur event extract pattern pattern fire event text base compon undertaken extens research seek disciplin methodolog custom compon knowledg base knowledg complex pattern base pattern perform complex map syntact domain semant discuss problem build gener pattern deem knowledg base problem custom consid interrel problem pattern custom interact custom function core problem custom user abil adapt system scenario custom knowledg base manual requir familiar work system allevi implement phase suit editor browser pet tool user build pattern exampl custom pattern base domain user set train candid specifi logic form induc system appli transform candid automat gener set pattern pet user scenario start candid text event gener pattern user ultim find amount search sentenc larg train corpu search perform aid queri narrow search space user fail provid class system hope recov event experi shown process discov candid highli gap pattern directli translat gap coverag pet shift portabl bottleneck build pattern find exampl system autom process discov good automat discoveri pattern experi automat pattern discoveri present system aim find exampl common linguist construct relev scenario simpl matter provid advanc relev found part discoveri process indic relev passag presenc construct introduc procedur acquir construct passag tandem import observ pattern base concept base serv defin set construct system extract seek type occur level singl word level complex syntact pattern concept pattern singl unifi simpli introduc concept class unifi class diverg constitu pattern discoveri procedur account concept variat chapter describ phase chapter core system architectur diagram system shown figur system pipelin modul draw attend process pass output modul modul oper intern store document text ad annot annot structur attach span syntact semant inform relat subsequ phase process modul view solv quest mean bodi research dedic individu problem harder move stage potenti contribut practic error final result deal problem modul encount scope thesi lexic analysi recognit noun verb group event refer resolut infer output gener lexicon pattern base templat format semant concept hierarchi infer rule noun phrase figur system architectur focu problem build find scenario implicitli problem realiti lexic analysi lexic analyz break document break sentenc token assign syntact token modul draw set dictionari heurist rule import factor type text process observ text type fall continuum dimens correspond lack text heavili mark structur inform sgml explicit paragraph sentenc typic case web electron newspap minim mark depend punctuat capit print matter digit ocr minim punctuat case includ text transcrib speech recognit radio tv free dialog term human reader presenc absenc margin text understand human languag redund built enabl human reader extract mean absenc mean comput point make text muc fall categori sampl sgml document shown appendix document text segment develop drawn collect wall street journal articl inform harder job lexic analyz sentenc breaker simpli assum sentenc end period point capit acronym abbrevi easili naiv algorithm sentenc identif strictli case system attempt construct global principl entir document process lexic analysi attach token list altern case token syntact ambigu read list featur valu categori modul attempt find express decid read token simpl matter list lexic analyz incorpor statist rank read token statist likelihood recognit recognit modul identifi proper attach semant categori proper fall object geograph locat compani klein product purpl work sport music boston boston major man missil great dark ic legal equal opportun simpl local contextu cue special person titl compani design special close list common person list compani pattern encod heurist rule categor phrase prior knowledg place call gener problem reli surfac cue deeper semant inform find categor problem resolut multipl exampl relat problem typic document multipl time variant shorter version acronym replac full form recognit system todai reach accuraci narrow domain describ statist method build ne recogn automat maximum entropi estim comput probabl boundari classif requir train data human annot ne recogn revisit compon greater detail section deal automat pattern discoveri pattern modul primarili syntact pattern identifi small syntact basic noun group noun left verb chain verb group consist head verb modal pattern identifi ng system mark group syntact identifi head word group case mark basic noun phrase creat semant entiti link np entiti build inform gather earlier np distinguish basic ng np preposit phrase preposit phrase attach resolv attach pp strong local evid present evid semant built pattern np pattern captur np presid case pp attach noun denot group object exampl team pattern attach pp set class result lf head noun pp entiti team behav subsequ pattern seek constitu semant type astronaut chanc match entir np light noun behav set pattern build complex base semant inform np involv subordin np comput chip year vice presid domest pattern phase identifi nomin place text sought event relationship occur phase focu studi discuss greater detail section modul oper match pattern success complex input pattern consist trigger match sequenc surfac sentenc action perform precondit prescrib oper map surfac sentenc fragment semant object action perform oper logic form process segment phase repres intern sequenc lf relationship event encount analysi lf predic repres lf object slot tabl distinguish slot call determin number type remain slot object slot class locat tabl lf entiti class slot call slot call point entiti describ establish relat locat entiti matrix compani entiti noun phase document appendix inform resourc european inform servic oper induc lf tabl note pattern identifi slot class european inform servic locat entiti parent entiti tabl complex np entiti lf entir text segment form singl noun group lf segment annot link subsequ access text return inform store refer origin text event complex kind syntact head verb entiti operand demonstr text induc event rest text produc event slot class compani entiti posit entiti person entiti tabl lf appoint gg slot class succe successor entiti predecessor entiti tabl lf logic phase subsequ phase oper logic form built phase refer resolut merg express link anaphor pronoun resolv multipl mention event basic mechan refer resolut slot class compani entiti posit entiti person entiti tabl lf unif object unifi slot compat determin semant type anaphor person pronoun event resolv entiti base semant compat rel order lf refer resolut event tabl slot class succe successor entiti predecessor entiti tabl modifi analysi modul infer rule build modifi event inform extract singl complex fact spread rule predic rule variabl type type type rule combin event infer event tabl unifi underspecifi event strictli infer rule constitut customiz pet interfac built system form lisp code structur output defin appropri design correspond close event surfac sentenc infer minim output templat correspond close surfac infer oper successfulli model straightforward command mean command state relat algebra output gener select result lf output format output structur tabl slot class compani entiti posit entiti person entiti tabl infer event extract illustr oper phase lf event intermedi present output form output task specif organ pattern base describ strategi pattern examin organ pattern base detail pattern arrang layer rang layer gener pattern pattern recognit tempor numer pure syntact pattern noun verb group pattern wide rang task layer narrow rang gener includ type pattern noun phrase express relationship person organ layer clausal pattern captur relev event stratif reflect rel pattern pattern lowest level widest applic built core compon expect chang system port domain applic commonli encount organ pattern plug requir task set pattern extract domain entiti build librari pattern captur organ pattern built basi move expect highest pattern invest greatest make step easier design system attempt chapter formal evalu core engin origin text input produc sgml output origin text form identifi titl paragraph document ne result extract modifi copi origin document ne tag insert addit sgml st output report file extract format sampl output file task shown appendix correct answer kei system match score program user evalu system perform compar result predefin answer kei measur evalu similar recal goal retriev good qualiti document text recal defin term number document correctli number miss system retriev number spuriou situat bit measur slot fill semant object system found text case categori object slot identifi system pick object place pick wrong object denot number incorrectli identifi slot object formula conveni measur perform singl case weight geometr paramet control rel import recal evalu complet evalu requir answer kei darpa gener set answer kei train corpu test consist articl wall street journal problem score note muc evalu complex conceptu algorithm problem complex score recal ir task addit complex fact document simpli relev irrelev document induc event event typic slot leav potenti room error answer system event situat complic event event spuriou slot fill set event form set score answer align set give highest score lack order inher origin text gener anchor event segment event piec mean complex infer partial cue descript search optim align problem forego fact requir check problem system version assign higher score muc lore phenomenon context terror latin develop carefulli engin system particip site submit system religi report kill el disregard input formal rogu system receiv higher score compet perform extract simpl happen correct answer singl report event basic slot happen correctli fill assign credit base fact event found slot correctli fill system improv thing learn discov correct event stop discov incorrect event satisfi replac higher score score case penal spuriou event case miss note happen intermedi normal develop system compon find compon debug separ simpl matter tweak singl compon find problem fix allevi suggest score algorithm extend notion rel import slot insid event event receiv point constraint import slot satisfi situat complic fact recent evalu includ score assign credit identifi span text induc report event score remain topic research problem method standard measur qualiti resort chapter chapter acquisit pet set graphic tool custom knowledg base scenario figur show princip compon toolkit interact lexicon editor concept editor templat editor evalu lexicon pattern base templat format semant concept hierarchi corpu pattern editor document browser figur pet compon kb chapter modul pet present organ princip repres box laid document perform oper document knowledg base custom knowledg evalu test appli acquir kb train corpu introduc tool turn prototyp integr graphic intend support develop cycl custom tool written common lisp seamless integr core written lisp graphic packag garnet develop cmu user begin interact bring pet control panel main panel user invok compon sit top turn invok function document browser start descript document develop process typic actual document analyz tool user select document train collect perform task select document figur main document ne result view result graphic form figur show document demonstr text appendix pilot present chapter illustr pet function present pet support muc ne st scenario templat figur st result output produc ne st task opaqu process load human reader document browser present result intuit graphic form result ne figur entiti categori noun shown boldfac user click entiti messag panel bottom main window displai type sgml annot standard muc format figur show result st process document graph intend aid view system output reader readili reduct cognit load compar result shown graph node correspond slot extract object bottom panel show object muc standard slot pair click node label inform briefli mention peculiar output format output output structur task structur intend group transit pertain post compani intern store transit event separ record tabl event relat simpli mean transit event actual final output form output form view tabl uniqu kei intern tabl pair output view field call set transit event match kei organ muc output format introduc extra level graph graph figur show pilot document induc singl success event person left transit regist element slot slot valu slot call post nest slot graph show node node deeper level hidden click parent node click node shown node expand color node expand atom white pet document browser includ similar user view answer graphic review system conveni compar system output answer kei type system answer link back sourc click node graph highlight text main document window layout st graph rearrang click drag node discuss section align event system answer kei problem tool aid user visual align knowledg base editor prior knowledg base code lisp part system kb modular resid separ uniform conveni facil modifi kb modif kb segment lisp code explicitli entir system advent develop file format store kb facilit dynam modif knowledg base kb editor implement lexicon user build dictionari dictionari supplement base english concept lexic entri group hierarchi semant similarli pattern element refer concept class editor user organ class direct acycl graph examin modifi hierarchi predic user defin intern logic structur fill pattern match editor user predic repres interact pattern editor pattern engin oper appli set semant pattern text sentenc pattern editor system acquir pattern sentenc provid user user structur result sentenc enabl user control order pattern appli form group pattern mention custom process logic center pattern base turn custom occas descript kb editor edit pattern main object pet engag user level surfac hide intern oper ad user restrict input provid exampl text event describ output structur text induc describ system inform automat build pattern map text gener newli creat pattern boost gener syntact semant level develop found salient text segment intend tune system extract inform figur show segment pilot extract form record era find candid develop construct pattern captur extract event observ chapter pattern consist trigger action inform resourc european inform servic oper appoint georg year presid field posit presid compani european inform servic locat london person georg statu figur success text extract record trigger match activ begin noun type verb group class np class action instruct assembl match constitu event structur figur show excerpt pattern code code intend aspir appar method develop pet emploi kind interact appli pattern system acquir typic produc partial analysi build lf analyz constitu text user specifi combin yield lf entir appoint appoint appoint compani slot agent figur manual code scenario pattern acquir precondit illustr oper show user system acquir clausal pattern figur figur show main window pattern editor top window editor window text origin user past document browser user click pet invok analyz main point basic special produc partial figur initi analysi pattern shallow syntact pattern noun group verb group window precondit window initi precondit system approxim precondit pattern user ultim accept initi analysi found separ segment sentenc sentenc begin long noun head lexic item pick complex noun group discuss section find verb liter analyz part part window color np verb group liter build underli syntact structur constitu identifi precondit explain section user click structur displai form graph window pattern constitu window constitu noun build semant structur logic form displai syntact inform user click graph entiti show class fill slot note slot complet nest entiti system engag user oper constitu menu oper includ gener appli regular express oper option remov ad piec transform requir basic linguist awar part understand subject domain typic user find level gener np vg maxim coverag figur concept editor semant gener concept editor constitu np serv broader coverag pattern noun phrase gener includ term denot type busi pattern match semant similar noun phrase posit user gather semant concept inherit outlin section gather semant call pet user perform semant gener individu constitu pattern precondit gener process user emploi concept view modifi concept figur editor node graph item modifi semant hierarchi built includ gener concept locat compani specif user add item relev term found train pair auxiliari extern tool provid link tabl word base parent class node includ relat term class includ unspecifi type busi identifi proper determin refer compani identif pattern pattern creat entiti set class constitu bring menu oper user gener class np hierarchi level time actual candid class suggest user statist constitu gener class verb similar np gener semant class includ corpor class call liter mark option match sentenc appoint final liter unnatur restrict match end sentenc oper result pet user state complex constraint constitu simpl constraint slot state slot specif node concept hierarchi constraint np shorthand gener gener form bracket express conjunct multipl slot entiti constraint provid level specif concept hierarchi state slot slot class node mechan provid finer control pattern build advanc user pet driven automat stick shift detail document user figur predic editor acquir action predic editor user specifi action perform precondit match select class lf creat type lf chosen list predic store separ knowledg event entiti figur show sampl predic base task predic editor user defin type lf slot user set figur final pattern ing type object slot slot shown pattern final predic predic chosen menu pattern editor figur slot pertain predic user constitu found function argument event node constitu graph predic slot node drag identifi constitu fill slot pattern definit figur precondit action constitut pattern match produc lf user text box window instruct pet accept pattern syntact gener variant origin jane yesterdai ceo basic pattern activ acquir match passiv essenti kind variat syntact system syntact variant origin captur passiv rel option semant relev interven randomli pattern constitu modifi arbitrari sentenc apposit exemplifi segment captur syntact origin user provid transform build pattern individu insert option modifi make pattern gener naiv approach quickli lead gross render user task unmanag pet invok pattern system gener relat gener pattern automat activ pattern passiv gener modifi made option pattern oper syntact macro insid pattern rn match preposit subordin delimit sa sentenc passiv vp result pattern match passiv produc correct event lf maxim system clausal includ nomin work build map verb role nomin provid gener discuss section similar mechan featur sri info resourc london euro info servic oper compani locat compani figur initi analysi np acquir pattern similar acquir pattern analyz portion shown tabl complex np made seri lexic item basic system analyz figur liter constitu shown boldfac approach involv creation noun group pattern gener noun group pattern gener noun group pattern appli analyz custom tool support altern mechan special noun analyz gener noun group pattern result lf restructur pattern analysi creat lf entiti segment figur user proce complet precondit pattern simplifi form pattern analog pattern current pattern element involv conjunct test syntact type semant class acquir user design gener entiti matrix complex np design correspond main compani remain entiti subordin stand semant relat constitu fill constitu fill slot establish user subordin entiti slot matrix entiti figur evalu tool evalu tool user test acquir kb system perform process report score individu messag train corpu process complet train corpu score perform system estim improv score base anticip improv individu messag shown bracket sequenc pattern featur remain implement current build separ figur evalu window featur user quantifi answer question system perform improv term ultim featur problem measur plan develop process system compar score system establish give document document state score featur essenti develop improv part system lead degrad common improv recal degrad tool enabl user close monitor fluctuat develop cycl approxim match clausal modifi toolkit remain incomplet aspect shortcom bootstrap process lack user acquir similar pattern pet indic whatsoev proxim indic put pet line activ learn approach mention section basic shortcom pet user notic exampl induc similar variat combin exampl pattern pet map exampl pattern strictli fashion problem exampl typic bring pp sentenc adjunct posit modifi accommod result maxim gener modifi gener option sa combin build system encount basic pattern exampl support subset seller price date valu price modifi subordin rel constitu match noun arrow slot predic fill np slot note adjunct fill predic slot irrelev import big naiv approach pet requir manual past modifi singl gener pattern overli complex possibl human error extend function pattern editor multipl exampl singl gener pattern automat recent work institut inform procedur multipl pattern involv manual special disjunct modifi possibl occur pattern sa insid perfectli fill slot predic pattern valu scenario studi experi build pattern remain implement formal disciplin approach formal pet solv problem complet singl modifi entir scenario illustr build pattern support exampl buyer ad hoc add modifi sa modifi appli pattern proper sa appli pattern entir assess issu section remain time write develop pet result function prototyp prototyp custom variabl rocket formal merger custom perform graduat student system expert pet port result system scenario pet develop scenario delv complex mention pet compar top score graph shown figur curiou observ recal system annot figur perform st task highest low recal score experi suggest pet good user transform exampl correct find good exampl begin custom bottleneck shift build pattern find motiv research algorithm pattern chapter graph show perform human annot prepar answer kei piec evid complex task high poor perform annot chapter pattern discoveri present conceptu outlin procedur automat acquisit pattern chapter elabor methodolog greater detail procedur requir train corpu manual annot event corpu relev feedback user procedur base iter small improv gain step motiv central idea combin document select iter relax process similar techniqu idea inspir larg work automat align sentenc word bilingu corpu machin translat author made crucial mutual inform sentenc translat good indic word translat pair word translat pair sentenc correspond dualiti space word correspond space sentenc space inher mutual connect context discov good pattern inform base motiv fundament assumpt principl densiti principl dualiti principl set text partit relev stand reason pattern strongli correl relev subset subset gener good pattern domain observ similar made author motiv express substanti relev text irrelev principl successfulli extract event describ terrorist attack kei observ dualiti space document space pattern principl document relev scenario strong indic good pattern ii good pattern strong indic relev document seed figur intuit iter discoveri part dualiti principl restat densiti principl part ii part intuit true exploit pattern receiv highest score expand set document believ relev intuit motiv iter procedur diagram figur start seed set pattern proce identifi pattern relev document bootstrap chain outlin larg corpu trust set scenario initi chosen ad hoc user seed seed pattern initi set concept class trust pattern induc binari split pattern match partit relev respect pattern set document assign weight document match seed receiv weight search candid automat convert sentenc corpu set candid pattern work relev candid meet densiti set document hit kei idea select pattern distribut strongli correl relev pattern distribut relev document sentenc extract tupl major head verb object chapter tupl consid pattern present discoveri constitut skeleton syntact transform pattern system extract phase figur densiti pattern distribut select strongest add grow trust set find concept base newli chosen extend concept class user feedback present candid class user retain relev scenario trust pattern set induc partit corpu pattern return step repeat procedur pattern ad note point import observ regard intuit formula visual figur term side inequ estim margin probabl expect find relev document corpu term left side estim condit probabl pattern match relev term fix singl find pattern amount maxim left side form basi score function section present process result potenti return pattern gener specif relat sought user intuit convinc point structur strongli correl relev structur bear inform relev scenario discoveri procedur suggest entri predic base gener approach adapt popul knowledg base lexicon concept base return point relat predic base procedur end iter consid variant procedur user check result current iter improv qualiti expect verif user gener improv qualiti result show substanti improv ant initi experi result point remain research chapter methodolog appli discoveri subject corpu preprocess step normal appli recognit modul replac proper special token describ numer express currenc singl token design categori factor item text make parser job essenti discoveri maxim leverag common redund text find repeat pattern syntact analysi factor run corpu syntact parser depend parser base fdg formal develop research unit multilingu languag technolog parser output reduc noun phrase consist argument argument subject sentenc agent appoint succe john board push john resign argument verb parser find main verb base form head verb verb remov inform auxiliari subordin parser attempt reconstruct miss semant role sentenc smith join yield main verb argument subject passiv subject transform parser output appoint presid board chairman board fourth argument phrase refer object subject typic argument object compani john smith argument fill system np refer subject distinct typic resolv automat gave swim clinton appoint john smith ambigu show resolv refer pure syntact fourth argument refer subject object argument loc tempor modifi preposit parser return preposit head modifi clausal argument preposit phrase parser determin proper attach attach level default np tupl head noun possess smith noun challeng nomin john parser perform level syntact normal normal maxim common pattern occur text type normal transform clausal passiv rel common form includ attempt parser resolv rel hire hire yield ident structur type normal reduct inflect form base form head verb group noun strip case person experi report rich syntact inform return parser np tupl clausal tupl reduc verb object object miss fourth argument note subject object miss parser unabl resolv move posit final tripl restrict tripl transform intend captur inform verb parser routin produc empti object fourth subsequ phase oper tripl obtain result phase subsequ refer argument tripl argument call gener concept class result tupl repeat corpu frequenc obtain reliabl statist tupl gener set phase search pattern work gener pattern identifi pair relev valu miss role construct concept class group class valu argument miss gener tripl decid candid result discuss chapter transform move object complement posit verb initi assum verb special subsequ analysi reveal larg class verb parser analyz complement miss intend conduct experi uniform transform independ verb tripl verb miss form concept class verb occur note admit valu miss role member concept class yield complet irrelev miss role rise call primari tripl valu primari tripl high correl distribut relev document correl score comput score scheme detail section fix group explor induct semant class analysi syntact context limit select syntact construct relev scenario index primari tripl consist main clausal build invert index back document annot produc parser object tripl consist syntact head group serv kei index index map gener tripl set primari tripl pattern rank rank pattern gener tripl strength correl relev defin correl score log denot relev subset document match observ section term account condit probabl relev pattern measur support relev document support distrust frequent pattern rare pattern end system select pattern highest correl add trust set document win pattern match ad relev set search pattern restart document relev descript simplifi import respect assign relev score document scale seed pattern accept ground document match relev subsequ newli accept pattern trust similarli absolut iter number pattern assign base relev document rec rel rel relev document previou set document match classifi consist set defin set document pattern rec rel win pattern relev score document document match subset accept view subset pattern classifi pattern determin relev score document rel max rel rec ensur relev score grow posit pattern vote document result follow measur adopt vote pattern vote relev rel rec add weight account variat support wp weight defin relev total support pattern log largest weight formula simpli count relev cumul pair captur mutual dualiti pattern document grow relev score heart procedur discov action observ earlier pattern consist trigger express action map syntact semant role section discoveri trigger begin address problem discov action similar fashion bootstrap discoveri procedur action run seed pattern user specifi map explicitli acquir set good studi occurr trigger actual text seed trigger induc set instanc tupl pattern argument relat observ perform formula result follow expect import event wai point exploit dualiti instanc hand trigger trigger match instanc element stand relat infer relat induc trigger trigger induc relat produc instanc relat call bootstrap algorithm fill relat induc trigger discov procedur implement remain investig observ close relat approach chapter prior work chapter result establish object measur good pattern discov straightforward matter evalu complic factor discov pattern inform extract directli pattern carri trigger lack action event pattern induc pattern argument fill event slot conduct pattern properli incorpor knowledg base stand incorpor pattern requir addit manual incorpor discov pattern form order object set compar system result correct answer requir human great amount time object obtain level detail level greatest detail standard muc st answer templat answer specifi document event extract slot event fill answer level relev document correspond relev judgement constitut ir text retriev confer chapter measur qualit begin manual inspect extract attempt judg qualiti resort quantit measur rest complet review altogeth object method provid fairli good pattern discov match scenario text set document relev obtain measur note addit grow pattern grow relev rank document qualiti retriev document evalu human view discoveri procedur close relat muc system judg level level event slot event set test document answer correctli fill evalu manual incorpor discov pattern knowledg base run full extract score present type evalu turn qualit evalu test scenario domain busi gener busi chose corpu articl wall street journal articl drawn month period month articl yield total clausal distinct gener corpu articl cover month manag success test extens manag success scenario extract system train test data section start seed tabl subject verb direct object tabl seed pattern set token denot semant class entiti type denot list verb nomin quit list pattern discov iter list show addit central includ clariti list includ exampl element demonstr underlin discov pattern observ pattern turn strongli correl domain simpl measur perform compar pattern found procedur extract engin manual construct task system approxim level distinct verbal head conserv observ discoveri procedur found found clausal pattern miss manual construct strongli relev risk set philosoph debat relev note directli essenti convei chang post pattern verb pattern special cover st task specif case person occupi explicitli state prev assum fill rule automat assum implicit transit person left prev mandat system gener event explicit inform contrari convei system inform gener event pattern curiou found cf task success system fill slot call slot organ person post post inform text fill slot aid learn pattern consist text person left pursu typic interest clue reliev system seek inform fill slot note prepar design studi train larg number addit document retriev ir queri found note context time competit achiev highest particip merger acquisit seed tabl subject verb direct object merg tabl seed pattern set class found pattern corpor seed tabl subject verb direct object bring suit tabl seed pattern set class small seed induc larg number relev natur disast seed tabl subject verb direct object tabl seed pattern set concept class damag seed induc relev text filter pattern document pattern gain relev weight qualiti document deem relev judg recal figur manag success ment count relev intern relev score reach threshold view ir engin evalu compar behavior give result binari relev judgement document comput recal formula test relev inform answer kei set includ articl train judgement constitut hidden truth visibl figur show recal plot start seed pattern section observ similar trend recal grow steadili reason point bad pattern system improv stop curv point recal specul test corpu remain due fact pattern easili learn pattern happen occur larger proport document test corpu interest compar text filter result test corpu shown anonym plot attain valu rang muc manual code system import bear mind benefit train inform seed pattern set figur show perform text filter acquisit seed tabl train wsj test set document retriev set ir judg relev hand event extract describ evalu task manual incorpor discov pattern knowledg base ran full extract origin train test recal acquisit figur wall street journal articl result produc appli full muc score recal corpora shown tabl start version undergon continu improv muc evalu remov nomin pattern review pattern gener discard relev correspond directli predic implement task worth noun phrase pattern give rise scenario event presid induc event record fred smith left ibm pattern left insid contribut high baselin score obtain seed event pattern train test pattern base recal recal seed union tabl perform slot fill discov relev pattern accommod current state discuss section instanc remain pattern make set addit infer rule case system infer departur combin rule check presenc event overrid implicit departur ad rule accommod pattern pattern augment inform map pattern constitu predic argument pattern result pattern automat gener handl syntact variant rel result pattern base appli formal train formal test output evalu muc seed pattern base consist initi pattern tabl seed pattern give result recal total serv baselin train corpu ad pattern system discov produc pattern base call gave point rise recal loss point boost point result corpu correspond pattern base label pattern base manual prepar train corpu month work comput linguist studi train corpu depth time show current perform point base call union union observ gain point formal test seed pattern base result score higher score find result perform pattern discov month manual tune perform close current result substanti addit develop note result follow discuss section manag success result slot fill task manag success report interpret caveat mind perform system depend event pattern plai princip remain compon underli engin impact perform includ syntact anaphora infer improv formal evalu formal report tabl benefit run top improv gain muc formal evalu base attribut improv rel improv base base note includ discov pattern review select good augment ad action trigger work discoveri automat review augment process compar amount time requir manual corpu analysi develop pattern base pattern base tabl includ pattern discov section full credit discoveri tabl manual base tabl benefit specul retrospect human develop provid mechan outset chapter discuss turn analysi result present relat prior problem remain research util analysi evalu chapter confirm tool find pattern turn question work confirm set pattern final product discoveri process view problem find good pattern captur scenario diagram side figur list pattern evalu iter pattern correl formula pattern review iter sort figur pattern iter correl score sort list read pattern list pattern correct solut close call question includ pattern closer solut bring answer shown figur view retriev comput recal pattern respect pattern plot show recal vari test conduct train iter note typic recal util figur util test pattern recov pattern reach half pattern final set clear find good cost search list larg situat complic inspect pai attent relationship found pattern fall evenli remain pattern irrelev treat outset judg rel leav recal assumpt fair assess group assum liber stanc respect achiev irrespect arriv strict judgement set claim pattern group strictli miss verb group subsum pattern pattern discuss gener pattern miss argument accept subsumpt move accept stricter judgement pattern subsum pattern merit higher recal score respect judg observ pattern question section yield minimum compar favor figur lie figur show situat success iter line start iter graph show jn improv iter recal util figur util iter confirm util manag success analyz perform current state earli stage understand tune analysi suggest number area refin common error divid error commiss error omiss degrad recal error commiss pattern procedur discov basic includ irrelev element concept class expand role potenti question bad bad class idea pattern bad acquir subsum potenti relev remain object pattern bad unclear modif procedur remov type error principl pattern weakli correl compani announc major corpor structur manag success instanc major chang expect pattern wide support insid relev document expect wide support current score function dozen iter pattern reach top rank list real deal problem dont start modifi score function weed weakli correl pattern essenti scenario pattern captur number scenario fact peopl die disast wide support valuabl pattern hold pattern state amount damag incur natur note error commiss principl troublesom easi procedur error kind problemat fact motiv entir investig learn techniqu turn error omiss figur recal train corpu precipit drop studi miss document document discov miss pattern pattern turn miss due kind error twelv relev document miss document good discov pattern relev fell threshold chose ad cf section document pattern assign addit credit multipl hit document document complex apposit verbal parser resolv reason analysi obtain hope recov pattern document exhibit complet consist singl incomplet long event partial state bodi main verb strand headlin document miss pattern recov extens shown list discov pattern section qualit find rich class relat term set term captur argument gener pattern procedur make discov class iter area improv correspond step outlin section class adjust base relev pattern grow discoveri pattern concept richer concept class boost coverag pattern subsequ iter obviou form gener merg pattern concept class enrich set discov pattern preliminari analysi reveal relev document pick miss pattern miss pattern pm data section pattern discov relat recal seed pattern similar data lead type merg seed pattern extend concept class intuit justifi term class function object pair measur strength associ pair extens class includ support evid pattern overlap class pattern strength overlap measur pattern pattern overlap complet clausal common suggest merg pattern gener verb object posit potenti fruit method extens concept class deriv central observ found principl posit find pair occur accept pattern document find tupl object subscrib yarowski assum pair compel merg object singl class relat merg principl assum occur relev document accept relax condit wai relax inspir view entir set relev document coher subscrib invok yarowski principl merg pattern occur relev document direct merg class clausal argument relev document merg object verb document belief verb fix put place mechan extend chanc recov miss document variant potenti requir research research problem section list import problem remain lie scope thesi variat scenario studi behavior discoveri algorithm addit scenario determin extent phenomena perform evalu text exhibit notic plane scenario reason text filter score pattern find success bootstrap ground pull relev document spread seed start recal iter recal close relat question sensit discoveri procedur initi pattern success depend good pattern user initi case lie choic good seed suggest due type linguist text type scale complex inher scenario similar work began address import question necess possibl qualifi complex scenario state formal term basic intuit familiar muc task tractabl task relat question seed set set term document research suggest converg variant formula comput confid document respect pattern determin empir variant optim plan experi select weight threshold control rank pattern criteria termin iter dynam adjust weight fundament question hope expect discoveri process converg time hope work number back pattern discov experi show section scenario good typic find strong reach critic point accept irrelev degrad question artifact choic score function diverg inher task import investig learn find answer closer examin pattern critic provid clue hope find paramet likelihood good iter place stop syntact inform initi experi util main clausal verb object parser richer section extend procedur advantag gener addit argument parser inform noun phrase expect nomin import verb indic relev scenario extend procedur account np pattern problem technic natur provid parser parser routin troubl common construct easili handl simpl semant apposit compound locat syntact procedur parser miss find singl tripl strong score gener system match document multipl credit find disciplin bia import path investig person insid current trend data mine research expect show substanti return minim requir iter human singl prune suggest concept class expect improv success grow seed set pattern user find check system begun investig ad basic function human feedback end iter initi result problem emerg connect extens problem person loop gener make binari pattern good bad system lack disciplin user assign weight newli acquir pattern time find pattern user add seed restart process begin put put place mechan phase ii pet discov multipl sentenc support induct pattern pattern base exampl give rise wealth modifi pattern discuss section pet extend incorpor variat modifi pattern disciplin tool user organ discov exampl find largest common basic interact extend pet enrich pattern set option modifi formal framework presenc number similar list section suggest presenc fundament common principl natur seek captur common term featur relat approach make import contribut regard author present list problem area induc classifi unlabel data review involv attempt gather approach singl unifi formal framework call kei defin characterist class problem presenc view featur respect system abil progress train multipl start unlabel data label exampl author develop framework present proof learnabl problem fall class unsatisfactori aspect view leav moment inher violat leav match natur class approach discuss head dualiti rule instanc intuit seek simpler unifi principl learn approach present section common share featur approach presenc classifi instanc base classifi singl classifi learn solv singl classif problem classifi set rule number confid grow train instanc base data point acquir classif label train presenc multipl featur featur bootstrap happen case singl classifi grow set instanc document classif label relev judgement case grow set instanc actual fact find textual realiz document train expand set translat word pair instanc align translat sentenc corpu rule instanc cite algorithm fall gener head classifi regist analysi classifi grow set label suggest counterintuit accept independ multipl learn scheme version reflect realiti approach accur import common featur turn assign relev rank instanc instanc rule essenti featur final heavi appeal intuit section admit indic rigor investig result present thesi method corpu analysi rapidli identifi larg number relev pattern train corpu feel techniqu gener pattern present potenti great opportun combat data note room investig build system closer appendix sampl sourc document sampl pattern pet roman staff report project wall street journal page inform resourc european inform servic oper appoint georg year presid succe mr sloan cite health reason late yesterdai appendix sampl ne output sampl pattern pet roman staff report project wall street journal page inform resourc inform servic oper appoint georg year presid succe mr sloan cite health reason late yesterdai appendix sampl st output unclear inform compani unit kingdom bibliographi eugen lui gravano extract relat larg collect acm intern confer digit librari descript system proc messag understand conf august morgan kaufmann dougla jerri john david processor inform extract text proc intl joint conf artifici intellig page august amit alan analyz perform messag understand system technic report dept comput duke blum tom mitchel combin label unlabel data annual confer comput learn theori page juli acm press andrew john eugen ralph grishman exploit knowledg sourc maximum entropi entiti recognit sixth workshop larg august sergei brin extract pattern relat world wide web webdb workshop intern confer extend moonei relat learn rule inform extract work note aaai spring symposium appli machin learn page menlo aaai press mari elain relat learn techniqu natur languag inform extract phd depart comput august artifici intellig laboratori technic report ai clair cardi david pierc interact environ inform extract technic report cornel comput septemb michael collin yoram singer model entiti classif joint confer empir method natur languag process larg colleg june maryland shaul shaul markovitch contextu word similar estim data annual meet comput page june david stephen joseph wendi lehnert descript umass system proc sixth messag understand conf novemb morgan kaufmann dayn freitag andrew mccallum inform extract hmm shrinkag workshop machin learn inform extract juli garnet collect technic report carnegi mellon comput februari michael gregori privat ralph grishman nyu system proc sixth messag understand conf page novemb morgan kaufmann ralph grishman tipster phase ii architectur design version york august ralph grishman inform techniqu challeng maria inform extract lectur note artifici ralph catherin adam meyer build comput lexicon proc intl conf comput linguist page august ralph catherin john sterl york descript system proc fourth messag understand conf page june ralph grishman john sterl york descript system proc messag understand conf august morgan kaufmann ralph grishman roman issu inform extract intern realiz spontan speech page februari harri linguist transform inform retriev intern confer scientif ralph automat word class format inform process privat privat timo depend parser english technic report depart gener februari martin kai martin align comput soderland test result analysi proc fourth messag understand june morgan kaufmann catherin ralph adam meyer creat common syntact dictionari english proc intl workshop share natur languag august adam catherin roman ralph lesli reev produc nomin pattern inform extract workshop comput treatment august georg miller lexic english commun novemb scott michael lanc richard rebecca ralph annot group algorithm learn extract descript sift system seventh messag understand confer tom mitchel role unlabel data learn sixth intern colloquium cognit san messag understand confer morgan fourth messag understand confer morgan june messag understand confer august morgan kaufmann sixth messag understand confer novemb morgan kaufmann seventh messag understand confer nichol secondari predic annual meet berkelei linguist page maria editor inform extract lectur note artifici fernando lee distribut cluster english word annual meet comput page june ellen automat construct dictionari inform extract task eleventh nation confer artifici intellig page aaai ellen automat gener extract pattern untag text thirteenth nation confer artifici intellig page aaai ellen rosi jone learn dictionari inform extract bootstrap sixteenth nation confer artifici intellig carol margaret medic languag comput manag narr data addison appli ilp rule gener workshop machin learn inform extract juli stephen soderland learn inform extract rule free text machin strzalkowski jose perez carballo natur languag inform report proc fourth text retriev novemb strzalkowski jin wang concept intern confer comput linguist august timo depend parser confer appli natur languag page april acl mari elain raymond moonei activ learn natur languag inform extract proc intern conf machin page morgan san roman extract toolkit user develop roman ralph grishman custom inform extract system intern workshop lexic driven inform page juli universita di roma roman ralph grishman descript system st seventh messag understand april roman ralph automat acquisit domain knowledg inform extract intern confer comput linguist august roman ralph discoveri pattern inform extract confer appli natur languag process april david yarowski word disambigu rival method annual meet associ comput page juli acm press
DB/877 3 paper chapter logic inform chomicki integr semant applic godfrei grant gryz minker depart comput scienc institut advanc comput studi maryland colleg park colleg usa depart comput inform scienc usa depart comput scienc york canada armi research laboratori usa decemb decemb semant minker content introduct background semant integr constraint exampl integr constraint express model semant extens basic model reason integr constraint elimin integr constraint model elimin residu method applic integr constraint semant queri optim cooper answer combin resolv inconsist view updat addit applic futur direct decemb semant minker introduct knowledg data data yield constraint form data relationship data function knowledg gener rule world data knowledg knowledg defin semant benefici store explicitli addit data long recogn relat knowledg captur store integr statement legal state transit integr constraint close queri true updat integr constraint introduc prevent enter incorrect data check integr integr constraint wider applic addit integr includ queri optim cooper queri combin semant consist view updat commonli held integr constraint adequ suitabl knowledg type knowledg written ic uniform applic reli semant emploi logic call deduct logic emploi logic subset predic describ queri record repres logic fact rule logic implicit fact logic deduct plai role relat logic model extend formula integr constraint advantag logic approach integr constraint handl common formal techniqu ad hoc approach emploi applic constraint depart flight depart time ic written attribut extend datalog datalog basic datalog notat introduc attribut field introduc section integr constraint express function depend fact address address function depend relat integr constraint express depend foreign kei relat relat depart constraint read depart depart depart integr integr constraint gener constraint state flight nation airport leav violat flight leav numer practic exampl ic integr constraint exist practic applic todai note integr constraint express logic languag express fact rule work knowledg argu formal suitabl captur ic design proven suitabl adequ task limit focu integr constraint compar knowledg result logic appli relat logic model subsum relat model decemb semant minker integr constraint explicitli applic alik declar express ic specif difficult express maintain lesson lead advent relat declar specif fact rule easier express maintain ic requir ensur applic program trend declar ic ic hidden system ensur consist ic reli applic program standard defin gener class ic subsum exampl ic express deduct logic basic natur tool reason specif appli relat appli broad bodi work logic relat gener consensu queri work mean integr consensu meant ic differ wide defin ic consist defin provabl deduc distinct discuss detail section view ic repres written logic gener situat complex permit indefinit disjunct inform ic subtl profound differ mean due interpret ic semant ic made interpret interpret evid ambigu corrupt unanticip wai introduc integr constraint logic framework overview work ic context section present basic definit integr constraint chapter semant discuss ic repres knowledg variat basic model review techniqu reason ic present number import applic emploi ic conclud discuss current futur work import aspect ic cover chapter discuss integr constraint check consist respect ic recommend survei work background section summari background notat chapter addit detail logic found languag terminolog logic present logic express rule queri logic show integr constraint express logic standard syntax usual symbol predic notion sentenc formula free defin usual restrict formula formula consid queri restrict form standard formula call ground variabl substitut set substitut element substitut pair variabl constant collect side substitut set substitut appli formula integr constraint express briefli review section decemb semant minker rewrit formula replac occurr formula element substitut parallel formula substitut substitut appli formula written formula ground substitut formula result ground formula side substitut pair substitut distinct formula denot exist defin origin substitut element substitut pair exchang answer queri ground substitut queri formula result ground formula true respect ground queri formula logic entail import class sentenc gener atom variabl understood quantifi written logic form implic written shorthand disjunct assum side implic conjunct quantif understood form call rule collect atom side call head collect atom side bodi bodi head empti horn rule atom definit atom rule iff variabl head bodi rule empti head gener consid queri ground rule empti bodi call fact definit rule clear procedur interpret bn call rule rule rule interpret shown shown rule essenti relat rule express view relat permit fact condit bodi simpli interpret true defin collect rule fact rule fact definit rule fact singl atom head defin call definit call disjunct call languag written definit defin datalog recal term note datalog term disjunct permit rule fact term call languag disjunct datalog paper deduct definit deduct datalog treat disjunct deduct disjunct datalog db defin consist interpret disjunct rule appar disjunct rule state atom rule head proven atom bodi standard extend sql support differ express relat support deduct system decemb semant minker ffl edb ffl db edb collect fact db collect rule redefin set integr neg data repres explicitli logic standard approach neg data infer close world assumpt default rule infer neg fact ground atom negat accept true provabl set negat atom infer written cwa approach negat clark complet formal concept set tupl true predic set proven true fact rule accomplish ad formula predic correspond collect rule suppli logic half definit predic negat fact deduc complet formula ad assum bodi rule posit atom defin rule negat atom bodi rule negat logic subsum relat includ set differ extend deduct negat rule negat atom bodi call normal deduct normal rule call normal call datalog extend default negat datalog normal rule constant true proven true write negat symbol logic refer default negat semant defin normal interpret default negat differ logic negat number semant defin normal semant accept notion default negat gener base logic default negat logic exchang rule db default negat seemingli disjunct negat atom bodi move head db db db consist singl rule singl fact db singl disjunct rule singl fact rule db written logic negat default db db logic db infer fact infer fact infer assum true db infer disjunct fact infer note default negat result add fact db longer speak term logic normal framework deduct remain applic decemb semant minker infer intuit default negat combin solut simpli definit negat canon negat restrict negat lead call stratifi uniqu standard model call perfect model defin model semant section context integr uniqu standard model case captur concept stabl import model semant normal normal logic semant stabl model semant semant model semant retrospect work semant logic program deduct peopl consid logic addit default extens basic model section extens includ modal logic tempor logic logic extend order logic addit oper modal logic deal possibl belief distinguish belief approach discuss tempor logic deal concept past notion chang model transact discuss semant integr constraint redefin deduct ffl edb ffl db ffl integr ic formula ic meant knowledg domain intend gener rule db repres specif fact edb verifi data edb consist gener model repres integr constraint ic integr constraint relat introduc valid ensur state remain consist world view world knowledg ic encod found wide arrai task discuss number applic section standard view ic repres knowledg posit debat section briefli view ic repres knowledg recogn ic repres gener thing type knowledg db db call state specif fact world deduct defin integr constraint literatur decemb semant minker specif semant respect integr constraint compon type knowledg express integr constraint model base semant extend ic extens suggest ic exampl integr constraint express ic limit formula clausal rule queri ic distinguish rule write predic attribut ag domain constraint state sixteen year written emploi conveni attribut extend field attribut relat understood obviou free inconveni notat prolog datalog attribut posit atom attribut fill field attribut mention atom assum fill uniqu posit atom relev predic slot convent adopt prolog write special variabl prolog field exist order attribut interpret existenti variabl emploi convent express function depend attribut relat predic attribut ag ic express person person address ag address ssn ag statement made part db gener person relat placement ic suggest fact person relat obtain relationship express integr constraint ic check state gener portion number syntax ic formula ic perspect restrict syntact form ic ic restrict denial formula form atom default negat part atom negat atom default negat part ic field notat datalog syntact conveni easi instanc top prolog system decemb semant minker denial constraint address ssn ag person address ag extra predic introduc write constraint denial constraint formula meant referenti integr constraint express depart depart relat depart repres denial add predic rule depart rule essenti defin project integr constraint repres address ssn ag assum attribut type write introduc depart recal assum notat datalog depart depart region type existenti quantif insid integr quantif intend class written form denial constraint written normal denial constraint consid integr rule aggreg model ic involv aggreg found model semant gener notion integr constraint logic formula true accept ic formula sentenc answer gener notion straightforward care decemb semant minker ic preval view base logic logic entail model semant wai formal mean ic situat complex default negat lead logic discuss approach defin mean ic context default negat model semant offer defin formal mean logic discuss section datalog datalog model semant introduc integr constraint extend model semant cover mean integr constraint respect rest number approach interpret logic languag truth assign true construct ground fact repres atom set consid construct atom set consid construct sentenc assign valuat respect preserv truth obviou logic connect quantifi model collect datalog interpret languag valuat sentenc true herbrand model model restrict predic constant function case logic mention basic text logic restrict attent herbrand point herbrand model model call minim model subset model definit datalog db db rule consist assur negat fact deduc shown case db minim model gener accept model semant db minim model denot model standard approach ascrib mean ic db edb db discuss consist definit ic satisfi iff db ic model entail ic satisfi iff db ic ic consist model db problem fulli captur intuit integr constraint case datalog inequ ic restrict denial definit differ ic definit effect differ consist ic syntact rule empti behav rule db ic model intend distinct call formula integr constraint lost captur intuit integr constraint rule epistem integr constraint gener data entail ic intuit serv deni confirm model notion ic entail definit captur intuit integr constraint reason empti pragmat addit default negat relat model set minu formula construct languag construct predic languag logic connect oper decemb semant minker model model empti ic logic entail intend definit differ denial rule normal rule inequ permit reason differ ic page express function depend relat attribut function determin address rewritten denial constraint ic page consist singl fact legitim albeit address address made close world assumpt logic explicit model note technic herbrand model mention easili imagin unrel fact mention legitim herbrand model violat ic invalid entail definit model address consist ic valid respect consist definit definit differ normal denial constraint constraint rewritten normal denial constraint ic page rewritten ic page consist singl fact legitim model person minim model inconsist respect ic invalid respect entail definit model satisfi valid respect consist definit simplist semant datalog permit normal denial constraint normal standard reconcil approach ic satisfi minim ic work fine definit default negat pictur default negat demonstr case normal disjunct uniqu minim model repres mean number minim model approach set minim model entail consist approach differ pure entail approach minim model satisfi ic pure consist approach minim model satisfi ic ic effect elimin model entail exist semant ic entail consist definit disjunct default negat lose substanc intuit integr contribut gener data proof queri evalu emploi ic effect elimin model intuit weakli ic activ gener fill attribut decemb semant minker indirectli infer integr constraint negat close relat denial constraint effect add logic negat deduct recal disjunct negat atom consist entail denial constraint model satisfi state constraint shown normal logic program deduct transform disjunct logic program disjunct deduct integr constraint ad subset set minim model disjunct logic program consist ic set stabl model initi normal logic program power yield fact integr constraint negat approach semant issu extens basic model ic consid updat preserv truth defin concept state constraint ic formula true current state truth necessarili preserv updat state constraint applic ic discuss section extens constraint user request queri process flight user request flight chang plane requir flight involv chang elimin relat user constraint concept prefer constraint user express prefer answer prefer express annot user constraint ic consid static refer state db tempor constraint repres constraint db state approach tempor ic discuss modal logic consid express queri ic ic repres knowledg knowledg actual world ic express knowledg world modal logic express ic discuss reason integr constraint advoc explicit integr constraint rule fact explicitli clear constraint integr constraint left necessarili obviou semant semant inform made ic applic separ issu reason integr constraint context reason integr constraint process elimin altogeth transform result semant queri origin result set answer pose transform reason techniqu import applic emploi integr part queri evalu present techniqu process integr constraint gener present describ transform deduct logic integr constraint decemb semant minker constraint result transform normal deduct logic origin deduct rule modifi inform integr constraint integr constraint express denial constraint section denial constraint elimin semant meaningless model inconsist denial disjunct deduct method compil integr constraint approach elimin integr constraint rewrit deduct rule annot rule relev piec integr constraint call queri evalu elimin integr constraint transform kowalski sadri elimin integr make modifi consist origin theori theori repres restor consist applic deduct theori definit integr constraint denial atom atom negat atom rule datalog deduct rule form unifi gener unifi replac rule rule deal case integr constraint applic rule potenti handl case applic unifi rule km ln default negat scope conjunct atom rule instanc variant predic singl rule defin repres conjunct equal yn xn xn meant negat empti conjunct case rule ad conjunct rule written collect deduct emploi techniqu similar section rewrit arbitrari integr constraint denial constraint easi show transform call db consist origin set integr constraint exist sldnf refut instanc db ic shown origin db ic db arbitrari queri result set answer origin problem inher incorpor ic db epistem distinct drawn ic rule section lost assum predic elimin integr decemb semant minker constraint result ad rule make predic ic elimin predic edb fact express rule transform user updat updat view updat incorpor ic rule introduc default negat transform desir origin default negat subsect describ techniqu elimin integr constraint larg avoid problem techniqu complet elimin ic restrict domain disjunct disjunct fact repres minim ic elimin explicit rule introduc type inform store call residu model elimin normal disjunct knowledg consid synonym set canon model semant normal canon model stabl model stabl model semant disjunct minim model semant definit determin uniqu minim consist entail definit ic present section ic disregard normal disjunct set integr constraint consist subset canon model consid consist canon model explicitli proof procedur queri evalu strategi manifest queri union ic consist integr constraint plai activ role deduct process model satisfi integr constraint elimin consid part semant reduct number model describ semant impli possibl inform deduc ic plai role filter elimin model integr constraint db fa semant repres set minim fa fa model fa satisfi db entail consist note queri answer requir ic intersect minim model empti respect predic long ic indefinit predic predic express disjunct elimin remov model satisfi logic program disjunct infer rule ad queri process proof procedur complet proof procedur extend tradit sld procedur factor reduct accomplish extra infer rule model disjunct logic program system disjunct deduct disjunct answer weaker disjunct answer return decemb semant minker figur refut tree subsumpt elimin complet inferenc disjunct account denial implement discuss work appli disjunct integr constraint residu method basic idea residu method theorem prove techniqu call partial subsumpt attach integr constraint fragment call residu relat rule start present concept subsumpt subsum substitut subsum substitut illustr partial show basic procedur test subsumpt test instanti ground substitut constant present result clausal formula result conjunct denial rule final step linear refut subsum resolut step subsum iff refut tree end null tree shown figur subsumpt algorithm appli determin partial integr constraint part subsum relat part subsum null integr constraint rare subsum relat ic partial subsum leav fragment bottom refut tree odd design decemb semant minker fragment call residu repres interact relat integr constraint gener complex perform partial subsumpt integr rule instanc predic partial subsumpt perform linear time number predic integr constraint commenc constant occur ic handl special illustr relat integr constraint subsumpt algorithm work ic resolv instanti transform call appli ic subsumpt proce expand yield resolv yield residu ground substitut appli residu intuit repres integr constraint effect predic case extra call obtain residu step basic care remov redund atom leav detail reduct state definit partial subsumpt residu definit ic partial subsum atom iff ic subsum ic ic result expand subsum definit integr constraint ic atom appli subsumpt algorithm ic resolut bottom refut tree result reduc residu ic residu result integr constraint relat residu ic call maxim residu call residu redund residu call integr constraint relat residu maxim redund residu semant queri section multipl residu constraint constraint heurist select residu applic integr constraint integr constraint repres semant design relat ic vital maintain consist updat entri origin reason integr constraint introduc describ import includ semant queri cooper queri view updat ic combin meaningfulli resolv addit applic semant queri optim semant queri optim techniqu integr constraint improv effici queri evalu algorithm appli queri queri pose syntact optim perform typic consist step step queri logic respect db origin queri gener queri lowest estim evalu cost chosen submit evalu decemb semant minker step base heurist account physic design tabl aspect integr coher optim major type join transform elimin join queri restrict introduct restrict index attribut reduc cost evalu restrict restrict attribut impli restrict attribut work research start influenti techniqu develop main idea techniqu summar compil phase transform phase compil phase residu section comput relat tabl rule result compil phase set semant constrain inform carri integr constraint place queri semant transform store residu gener semant queri process effici origin queri describ method student attribut id section attribut student id faculti attribut ag assum integr constraint faculti member thirti year faculti section ag method partial subsumpt section ic relat construct fa annot relat faculti mean queri predic faculti satisfi condit state residu succe queri student taught professor older twenti queri student section id section faculti section ag queri predic residu semant queri queri student section id section faculti section ag select oper faculti tabl tupl satisfi queri potenti evalu effici primari advantag residu approach associ integr constraint explicitli rule reduc search space integr constraint appli queri comput relat semant queri optim compil time rigid combin rule integr constraint disadvantag work queri repres succinctli union conjunct case suffici residu decemb semant minker attach rule isol case residu consid respect deriv tree produc evalu requir case rewrit simpli individu rule research advanc direct case residu techniqu approach queri evalu interleav join union oper queri evalu queri express succinctli singl union residu directli attach research queri involv arbitrari nest union join oper initi develop extend approach recent develop transfer exist techniqu base logic object model core techniqu transform object schema relat object semant reflect integr constraint relat level section object queri transform queri relat optim queri perform relat level produc relat map optim object queri techniqu work larg class object queri method structur constructor cooper answer cooper answer augment system respond queri answer addit inform contribut user goal intent numer cooper answer techniqu explor techniqu vari aspect cycl attempt clarifi user misconcept user formul type addit explan list candid queri cooper answer relev knowledg addit data answer set knowledg deriv semant repres integr constraint work cooper answer built previou work semant queri optim shown queri fail produc empti answer evalu queri true queri subsum answer queri inconsist respect answer queri empti unexpect empti ambigu queri queri failur part queri result queri inconsist respect semant misconcept user behalf call queri misconcept queri succe semant cooper explain misconcept user patient ward patient gender infect type queri male patient matern ward highli infect natur integr decemb semant minker patient gender patient ward patient gender patient gender ic express function depend patient ic ad patient record entri matern ward prove logic queri fail gal minker studi misconcept determin queri misconcept check subsum inconsist built mechan misconcept test techniqu residu partial subsumpt section subsum ic reason queri fail proof subsumpt ic basi explan user develop approach misconcept detect explan user constraint mention introduc cooper techniqu focu user queri user interest necessarili consist ic requir emploi algorithm test misconcept remov portion answer set user interest user variat ic semant ad type cooper answer queri formula answer altern formula logic subsum queri answer answer set superset logic logic subsum queri preval answer warrant answer simpler queri explic queri answer introduc ia view rewrit queri preserv semant ia consid suffici criterion ia subsum answer consid integr ic ia queri ia logic respect ic answer consid base residu argu ia queri respect integr constraint convei semant inform semest professor rank professor comput scienc teach semest integr constraint professor rank start semest state professor teach semest queri set comput scienc rank return ia user misconcept respond ia professor teach mislead user miss fact answer set comput scienc professor user notic decemb semant minker user knowledg left techniqu cooper answer knowledg attempt disambigu explain situat user techniqu identifi presupposit fail queri user case conjunct synonym find minim fail queri advoc queri fail determin misconcept misconcept explain cooper focu part queri fail user inform appropri seek valid variant misconcept queri patient ward infect type assum queri fail patient infect fail patient highli cooper techniqu presupposit emploi integr techniqu semant knowledg bring bear fail queri side cooper answer close relat knowledg discoveri complex find queri optim algorithm approach discov note discov process form integr constraint found queri design discov intend mf ic ic miss specif discov mf ic mf treat state constraint transact invalid state constraint semant queri optim routin ic previou state queri consid misconcept intent queri answer respect queri formula serv integr constraint semant misconcept link semant chose integr constraint choic choic semant cooper answer combin resolv inconsist past work devot answer queri heterogen distribut work critic organ locat remot relat data organ data distribut simpli organiz reason set deduct set integr constraint consid ic obtain answer queri ignor integr combin union easili shown consist account union individu merg ic inconsist synonym basic sql queri decemb semant minker merg techniqu ensur consist minim loss inform accomplish result potenti disjunct goal combin set datalog fdb ic obtain maxim set consist data result disjunct datalog db fag db ic bg consist correct combin db db maxim combin combin consist minim fag answer queri correct respect minim model defin consist set datalog db consist respect set integr constraint ic iff minim db satisfi ic algorithm combin datalog provid illustr present briefli step perform algorithm combin db fp db fp fact db db individu consist ic simpl union db db step union db db call fp db union ic consist ic answer substitut call substitut step atom ic substitut move left clausal result atom ic substitut move safe elimin disjunct evalu negat atom renam posit atom introduc predic involv case introduc intend mean formula rewritten minim model disjunct fact singl fact found fp fp fp step minim model term origin predic denot model fp fp fp project model fp fp fp model maxim model db consist ic step db collect disjunct form atom maxim model db call combin db fp note db consist ic algorithm work rule explain decemb semant minker develop maxim combin consist set ic definit stratifi definit normal stratifi shown combin consist order shown combin default logic problem combin datalog integr constraint prioriti solv practic necess resolv semant conflict merger multipl respect global integr constraint simpli semant conflict assur organ updat mechan assur collect consist idea step inconsist respect integr complex inevit accept inconsist ic check mention section inconsist respect integr answer consid valid ic mask local inconsist logic program deduct consid techniqu discuss merg global consist manner appli problem present consist view singl inconsist view updat deduct relat view head db rule edb predic defin term predic predic problem view deduct updat predic accomplish modifi appropri underli part problem underli tabl modifi effect updat unclear problem ambigu view updat problem case pure definit deduct unclear relat modifi accomplish view updat db updat fact restrict definit plausibl wai accomplish ffl add ffl add ffl add option arbitrari arbitrarili result updat strong reason disjunct inform accomplish updat fourth ad option intuit correct gener algorithm accomplish view updat insert disjunct deduct provid semant justif updat algorithm accomplish make repres decemb semant minker underli kind updat involv insert delet inform deduct involv insert delet inform stratifi normal disjunct insert normal deduct requir insert neg inform neg inform explicitli yield neg inform reason close world reason extens work made model theoret approach introduc encompass wide class herbrand includ perfect model stabl model disjunct includ negat disjunct rule denial requir satisfi integr constraint prove algorithm provid respect criteria minim chang give prioriti minim delet illustr applic ic framework proposit note atom atom minim model project edb fag cg db minim wg minim model true insert db minim algorithm add fact edb remov fact subsum yield minim model edb cg cg db minim wg minim true respect modifi db insert minim model edb algorithm ic account updat insert edb remov subsum note minim modif presenc ic minim model project edb cg minim model wg wg addit applic discuss briefli applic integr constraint order optim sql oper group order distinct requir physic order data sort describ optim techniqu minim number sort column detect sort avoid altogeth exist function depend retriev data tupl sort column function depend sort avoid function depend push sort queri tree make cheaper combin sort singl sort decemb semant minker enhanc applic queri fold queri fold semant optim techniqu replac origin predic queri resourc predic answer modifi queri resourc view cach result previou queri queri fold evalu queri context heterogen system tabl relat view definit semant queri cach queri answer cach integr constraint dramat applic queri describ queri fold algorithm function describ algorithm depend reveal semant reason rapid develop design captur mean applic environ model relat deduct introduct natur object model requir introduct data queri languag compat model techniqu design relat deduct directli applic object techniqu develop specif model shown exist techniqu transfer relat object model main idea approach transform object schema relat schema object semant reflect integr constraint relat level transform intend captur semant inform encod object object type relationship class kei subclass object model repres tabl tupl repres object class fact subclass express integr xn xn transform object schema relat schema integr constraint queri pose object translat queri relat point exist tool develop relat appli queri result translat back object model semant data secur secur constraint secur privaci import issu system commerci relat system provid secur mechan design tabl updat user provid account password facil authent user system granular mechan permiss decid basi finer mode data secur type data user class permit call semant data secur question semant secur specif accomplish argu secur constraint view special form integr constraint secur constraint written declar ic akin user mention section differ shield answer user queri user interest conflict user shield user secur privaci reason mechan semant queri optim elimin answer conflict secur semant data secur techniqu includ semant queri optim section semant queri cach cooper answer section queri rewrit view decemb semant minker issu semant data secur epistem ensur user infer secur formula design secret deduct domain deduct system extend ensur secret shown ensur secret system lie user semant data secur issu grow import applic possibl tradit secur mechan circumv grow shown techniqu knowledg discoveri data secur secur constraint secur breach futur direct discuss aspect integr constraint note integr constraint import tradit applic updat maintain consist provid semant inform logic repres integr logic repres repres user constraint uniform languag permit tool techniqu logic appli permit system develop complet answer answer correct respect semant stress integr constraint provid basi perform applic semant queri provid cooper combin handl inconsist contribut solv view updat problem disjunct note uniform definit semant integr constraint note consist state consist integr entail state integr constraint entail definit definit relev demonstr paper area integr constraint investig topic ffl implement semant queri ffl tempor ffl transact ffl activ ffl data mine induct ffl logic foundat deduct ffl combin ffl multimedia ffl constraint constraint logic program discuss topic found tempor activ clear applic integr constraint remain fertil area explor topic investig yield intellig system topic decemb semant minker acknowledg editor construct comment refer vianu foundat minker combin multipl knowledg base ieee transact knowledg data juli subrahmanian combin knowledg base consist order theori comput subrahmanian combin default logic intl journal intellig cooper info subrahmanian declar foundat secur deduct fourth intern confer theori lectur note comput vol page oct springer bonner kifer logic program transact chomicki saak chapter jeffrei comput logic open set book cambridg bry composit semant logic program deduct joint intern confer symposium logic bad sept mit press staudt subsumpt queri inform jan minker foundat semant queri optim deduct workshop foundat deduct logic page aug minker semant queri addit constraint control strategi expert page apr minker logic base approach semant queri optim acm transact june chan world semant disjunct ieee transact data knowledg shim optim queri materi view page chen roussopoulo implement perform evalu adm queri integr queri result cach match intern confer extend answer queri address rule base queri rule base expert decemb semant minker chomicki editor logic inform system kluwer academ chomicki toman tempor logic inform system chomicki saak chapter clark negat failur gallair logic data page plenum conrad logic primer chomicki saak chapter dahl editor natur languag understand logic program north tan semant data cach replac da deduct logic program editor nonstandard queri nonstandard answer studi logic comput clarendon jone integr constraint revisit journal duschka levi plan inform gather proc aug mannila disjunct datalog acm transact fixpoint semant gener logic program compar stabl model semant gener fernandez disjunct deduct phd depart comput colleg minker model theoret approach view updat deduct journal autom subrahmanian disjunct lp integr constraint stabl model semant annal mathemat artifici cooper answer queri phd depart comput colleg minker overview cooper answer journal intellig inform invit paper minker overview cooper answer imielinski chapter page lobo qualifi answer reflect user prefer page santiago de minker user languag gener issu cooper answer system advanc logic program tool formal languag page june gal cooper deduct phd depart comput colleg gal minker natur languag interfac cooper answer confer artifici intellig decemb gal minker inform cooper answer integr constraint dahl page schlipf unfound set semant gener logic program symposium principl page decemb semant minker gelfond lifschitz stabl model semant logic program kowalski proc intern confer symposium logic page august godfrei architectur implement cooper system phd maryland colleg colleg maryland progress godfrei minim cooper fail queri intern journal cooper inform system june godfrei gryz framework queri optim workshop deduct logic nr page sept held conjunct godfrei gryz queri optim technic report dept comput colleg md oct godfrei gryz overview dynam queri evalu queri optim intern confer deduct dec minker semant queri optim evalu ra foundat intellig intern symposium methodolog intellig lectur note artifici intellig page june springer architectur cooper system litwin intern confer applic lectur note comput scienc page springer june raschid semant queri optim object page apr ieee comput scienc lo california minker view updat stratifi disjunct journal autom march grant minker integr constraint knowledg base system knowledg volum page aper integr control relat overview data knowledg gryz queri fold depend proc hammer zdonik queri process proc intern confer larg data page oct imielinski intellig queri answer rule base system minker keller basu cach scheme architectur vldb apr king system semant queri optim relat proc intern confer larg data page sept kowalski logic data descript logic data page plenum kowalski sadri knowledg integr dec draft manuscript lakshmanan semant queri optim deduct proc ieee intern confer data page decemb semant minker logic foundat activ chomicki saak chapter lee han semant queri optim proc ieee intern confer data page semant queri reformul deduct proc ieee intern confer data page ieee comput societi srivastava answer queri view proc page levi sagiv semant queri optim datalog program acm symposium principl system lloyd foundat logic program symbol intellig rajasekar foundat disjunct logic program mit loveland combin model elimin resolut meltzer machin intellig page semant inform deduct system phd colleg maryland melton simon understand complet guid morgan san minker indefinit close world assumpt sixth confer autom page lectur note comput scienc page springer editor foundat deduct logic program morgan kaufmann minker logic year retrospect workshop logic san juli invit keynot address motro constraint provid answer relat queri fifteenth intern confer larg data aug oleari knowledg discoveri threat secur frawlei chapter editor knowledg discoveri aaai press mit menlo constraint improv gener answer deduct ieee intern confer data control gener answer ieee transact knowledg data minker prioriti combin knowledg base journal cooper inform feb qian queri fold intern confer data page reiter close world data base gallair logic data page plenum reiter journal logic oct sakama model semant disjunct intern confer deduct object orient page dec decemb semant minker fundament techniqu order optim page stickel prolog technolog theorem implement extend prolog compil journal autom ford secur constraint process multilevel secur distribut manag system ieee transact knowledg data apr ullman principl volum ii principl comput scienc seri comput scienc van der meyden logic approach incomplet survei chomicki saak chapter yang larson queri transform thirteenth intern confer larg data page semant queri optim deduct intern confer deduct page decemb semant minker index close world assumpt cooper db formula queri integr function knowledg logic higher answer bodi head decemb semant minker sldnf
DB/878 3 algorithm tempor queri oper xml depart comput inform scienc norwegian scienc technolog norwai abstract content xml data seldom static document document document updat search histor retriev document valid queri support extend system tempor featur paper describ queri oper order support xml queri languag support tempor oper describ algorithm make effici implement queri oper tempor queri process introduct amount data xml rapidli advantag xml document inform schema make compar unstructur data queri xml data directli store xml data xml data creat xml data collect web xylem content data seldom static document document document updat search histor retriev document valid queri realiz store version document middlewar layer convert tempor queri languag statement convent execut underli system call stratum approach approach make introduct tempor support difficult achiev good tempor queri process gener cost store complet document version high tempor xml system order realiz effici tempor xml issu solv import issu effici storag version xml effici index work author ercim fellow group franc note similar gener document version aspect time make possibl solut tempor xml document tempor xml queri process relat work section concentr issu tempor xml queri process give outlin expect found tempor xml queri introduc queri oper execut queri outlin algorithm realiz queri oper algorithm partial depend xml document version work paper present context storag model organ rest paper section give overview relat work section studi time ident context tempor xml queri section assum data model section give exampl tempor xml queri section give overview algebra oper illustr queri section describ algorithm execut oper section conclud paper outlin issu research relat work model repres semistructur data languag queri present chawath al queri translat lorel languag queri semistructur view stratum approach work chawath al extend al storag version document studi marian al chien al chien al access previou snapshot retriev approach relat work present introduc valid time featur xml present grandi mandreoli tempor xml queri import issu pose addit difficulti context context xml document retriev web case xml data time ident issu discuss detail time xml tempor aspect common aspect transact time valid time case queri point view similar transact local storag document system store xml full inform time xml document time xml storag copi xml document similar transact import differ case gener time xml time document retriev web document retriev point result inconsist view document document refer document document delet updat version necessarili version document similar valid document time document includ timestamp document time document post exampl notic agenc document index queri base document time difficult extract time document expect document includ metadata base rdf part provid public time expir time concentr support note techniqu present equal applic addit oper introduc coalesc ident element version xml document xml document url gener element document ident persist version document impli queri difficult execut simpl exampl queri creat time queri previou version element element persist storag system support order make part data model queri languag system function xylem persist xylem call identifi element document time independ element delet conveni paper acronym eid concaten document id eid identifi uniqu element document tempor xml gener version element version element order uniqu identifi version timestamp eid denot identifi version element concaten eid timestamp assum data model document view forest tree advantag approach queri version document similar queri gener set xml document view forest forest tree result return possibl tree assum element timestamp base observ document web frequent move price restaur price restaur restaur price price restaur figur restaur list retriev januari januari januari timestamp element time updat element children updat element impli updat element note logic appli document implement note distinct document timestamp element timestamp snapshot queri document version figur document version version restaur guid restaur guid exampl note physic storag version document store complet version previou version store delta version order reconstruct previou retriev process complet version number delta document detail section exampl tempor xml queri main section creat queri describ kind queri expect tempor xml queri languag base mix xylem queri languag element xpath xqueri queri oper algorithm present paper independ queri languag queri return restaur price written select assum result deliv default document tag result select express deliv element tag complet path queri semistructur data queri expect oper note xylem support histor special support queri languag order retriev document valid time timestamp path filter element version valid select complex version keyword timestamp order retriev price histori restaur select return timestamp element predic time includ select includ delet creat time element order queri time rel time denot express dai week algebra oper oper tempor xml queri describ term oper addit oper assum avail tradit project discuss oper extens oper oper input forest tree set xml document filter element xml pattern tree tree match pattern tree includ inform project relationship defin oper forest tree pattern pattern tree detail oper refer overview oper tempor queri oper ad tempor snapshot oper similar oper oper snapshot document valid time output oper set section return match pattern version document collect output oper set return version document valid interv te short time interv te includ te upper output oper set root document te return version element valid interv te output oper set eid equal eid input return creat time element retriev element creat select creat note eid element delet eid element strictli timestamp element identif oper shown paper describ algorithm avail timestamp improv perform timestamp gener extra cost involv assum avail return delet time element return timestamp version element version timestamp current eid retriev version oper construct select distinct retriev current version element gener tempor select retriev previou version element reconstruct tree root eid version timestamp result oper previou version document store delta impli access process potenti larg number delta addit complet version except current version store complet previou version document store complet actual version read case queri version element conveni return eventu applic separ edit script edit script describ similar inform rc file edit script xml tree note long edit script repres xml oper break closur properti queri version repres document element diff construct select support string equal string queri oper access structur paper access method queri gain provid addit access method string equal expect separ oper access structur equal gener method equal test queri order illustr give queri base restaur queri oper list restaur list select snapshot list version restaur element valid time version creat updat reconstruct retriev number restaur select tradit aggreg oper sum note reconstruct document show case storag delta previou document version creat perform problem list price histori restaur select timestamp retriev version restaur note predic act current version element price histori restaur histori list oper execut section describ tempor xml queri execut describ assum physic storag storag manag delta document content give overview queri oper algorithm physic storag model assum document version store complet current version previou version store chain complet delta delta forward backward similar storag strategi xylem make queri tempor characterist base current version queri characterist restaur queri queri restaur list explain bottleneck partli handl primari index techniqu delta fact store separ xml document store distinguish delta document complet xml document xml document consist complet current delta document delta document index delta index simpl version store timestamp text index number store timestamp actual version delta index note good solut expect delta index resid memori store timestamp index document content index order facilit similar document index index index index word includ element post word includ document identifi inform determin hierarch relationship element document denot function retriev post word index retriev document identifi relationship inform instanc word extens extend tempor domain extend order support tempor oper altern index content index content version impli index content version timestamp facilit search version search element delet costli index content delta object impli index move delet inform directli text index facilit search path problem result extrem instanc delta effici access queri snapshot content index snapshot delta inform combin altern approach effici snapshot chang base result larger index higher updat cost base observ index content version note rule studi rel perform altern left topic futur research oper tempor basic tempor oper lookup current retriev post occurr word document valid version lookup snapshot time post occurr word document version valid time lookup post histori retriev post word timestamp addit note index queri type costli access structur fact delta store make version reconstruct typic tempor queri problem delta case store delta document store result delta read involv disk seek worst case access structur consid basic addit index structur access method order achiev accept perform goal index reduc number delta work directli delta avoid reconstruct snapshot oper algorithm describ algorithm tempor assum avail tempor index oper extens oper xylem algorithm origin oper inform word call execut join document identifi relationship oper execut variant algorithm origin oper main differ entri valid time consid lookup access word call lookup execut join document identifi relationship execut retriev occurr test match tempor valid view tempor multiwai word call lookup execut join document identifi relationship time word pattern valid impli tempor reconstruct order reconstruct version delta timestamp appli complet current version current delta delta possibl snapshot version made snapshot version process start oldest snapshot timestamp greater equal intermedi version valid algorithm reconstruct version valid te reconstruct oper reconstruct version te snapshot note algorithm output document histori previou version algorithm te te forest tree set document filter root eid note optim desir delta read order retriev creat time element interest strategi delta backward version valid find delta element introduc reconstruct note reason assum avail timestamp timestamp start recent version element case current element addit index index eid timestamp note common index insert gener element insert document document updat index expect frequent object insert document averag cost insert item index high delta easi bottleneck frequent oper case altern addit index retriev delet time element base perform similar document element exist version delet time document delet time element element resid delta forward start time find delta delet addit index altern strategi store creat delet timestamp list version good addit space timestamp opportun repres list list rang delta version content index section retriev creat delet timestamp element drawback strategi oper evalu lookup delta index section document eid document timestamp current timestamp found lookup delta index note order access data version eid actual document version reconstruct diff order gener differ xml differ algorithm root element input algorithm issu relat equal data model queri languag version compar match issu complic semant equal oper xml data model xml queri algebra equal oper exact semant complet compar compar ident node semant issu appli tempor context includ issu automat type shallow deep tempor ident node version difficult issu introduc relat problem creat delta version assum list restaur price select illustr gener compar price restaur restaur member restaur time restaur short order compar address restaur easier address store address part address store base discuss equal approach compar compar assum comparison element semant deep true match element valu strict xml data assum element persist id comparison perform util persist node possibl syntax case make actual restaur element attribut ad problem approach relat gener problem make diff equal version problem occur entri delet reintroduc version eid eid equal test fail entri restaur version introduc similar oper style approach weikum perfect solut combin shallow equal similar oper interest solut summari paper tempor queri execut xml system issu relat time ident data model basi tempor xml queri languag tempor support xml queri languag impli oper queri identifi oper order support typic queri tempor xml order achiev desir perform effici execut queri oper algorithm execut oper futur work includ develop techniqu reduc cost execut queri oper main goal context develop techniqu reduc number delta version retriev import strategi achiev goal develop type index algebra rewrit techniqu futur work includ studi modifi framework oper algorithm easili top exist system acknowledg serg abiteboul suggest topic vincent benjamin nguyen discuss construct comment refer cluet pattern tree queri xylem technic report queri xml document xylem technic report widom repres queri semistructur data fourteenth intern confer data engin ieee comput widom manag histor semistructur data zaniolo compar studi version manag scheme xml document version publish webdb technic report zaniolo version manag xml versu scheme intern workshop research issu data document manag data intens busi scientif applic marian detect xml document technic report grandi mandreoli valid time technic report grandi mandreoli valid infrastructur tempor manag web document advanc inform intern advi jensen snodgrass tempor data manag ieee transact knowledg data manag version xml vldb tanca tempor aspect semistructur data vassili tsotra effici manag document object referenc vldb weikum ad relev xml webdb web consortium xml queri work februari recent version web consortium xml queri data work februari recent version web consortium queri languag februari recent version xylem dynam xml data web ieee data engin
IR/879 5 hierarch cluster label unlabel data lk hansen informat mathemat technic denmark richard petersen build denmark abstract paper present hierarch probabilist cluster method learn datamin learn perform label unlabel exampl probabilist cluster base suggest generaliz gaussian mixtur model extend modifi expect maxim procedur learn unlabel label exampl hierarch scheme agglom base probabilist similar measur compar dissimilar error accumul posterior cluster probabl measur scheme successfulli test artifici data segment introduct hierarch method datamin provid multilevel descript relev applic relat inform retriev navig organ approach hierarch analysi agglom cluster scheme recent develop includ paper focu agglom probabilist cluster gaussian densiti mixtur base earlier work extend suggest compar similar measur connect cluster merg advantag probabilist cluster scheme automat detect final hierarchi level data train order provid descript cluster suggest interpret list prototyp data exampl list typic featur cluster generaliz gaussian mixtur model soft generaliz gaussian mixtur model basic model learn extend framework research support danish research council distribut multimedia technolog applic program center multimedia signal imag process telemedicin program learn combin set label unlabel data present modifi version approach call generaliz gaussian mixtur model learn combin set relev practic applic due fact label exampl hard instanc document categor medic applic model estim paramet gaussian cluster modifi em procedur disjoint data set prevent notori infinit overfit problem ensur good gener abil optimum number cluster mixtur determin automat minim estim gener error paper applic object categor text spot topic provid easi understand interpret larger text block broader creat intellig search engin provid understand document content webpag ontolog section model learn introduc algorithm hierarch cluster scheme discuss section introduc similar measur cluster merg section provid numer experi segment generaliz gaussian mixtur model step approach probabilist cluster flexibl extens gaussian mixtur densiti generaliz gaussian mixtur model aim learn unlabel label data defin input featur vector class assum mutual class joint densiti model gaussian mixtur xj kx kj number compon gaussian mix prior pk posterior pc gaussian compon vector covari matrix vector model yg gaussian mixtur model eq flexibl joint compon assum input densiti eq cx kx uf yg assum loss function optim classif rule defin data set unlabel set label object estim combin nl nu exampl ensur high generaliz label data perform learn number label data estim data set share model paramet neg data assum consist independ log kx log log kx kx discount factor model estim label unlabel data result ident refer gener mixtur model depend omit optim set optim typic case advantag discount influenc unlabel data initi valu randomli select indic set ik comput class prior select split ratio split unlabel data set disjoint set similar split label data repeat converg comput posterior compon updat mean updat covari matric perform regular updat cluster prior nl nu updat class cluster posterior figur algorithm algorithm model paramet estim iter modifi em algorithm mean covari matric estim independ data combin set approach prevent overfit problem standard approach design generaliz gaussian mixtur model label unlabel data view extens algorithm suggest implement hard soft assign data compon em iter step hard approach data assign cluster select highest mean covari estim classic empir estim data assign compon soft version mean covari estim weight result small data set gener soft version prefer algorithm summar fig base soft approach main iter loop abort chang cluster assign notic label exampl assign cluster kn arg unlabel kn arg contrast em algorithm iter lead improv practic experi updat scheme suffici robust potenti poor condit covari matric cluster exampl assign avoid regular input covari matrix fig select smallest posit ensur result condit number smaller float point machin essenti algorithm paramet number compon weight factor paramet chosen maxim gener perform method pick estim classif error minim comput cumbersom method select base aic estim gener error neg number paramet remain algorithm paramet determin split ratio principl select achiev high gener perform practic simul show proper choic case converg criteria base neg formul model input data perform learn case object model input densiti eq train model case unlabel exampl choic separ model class condit input defin eq ky number compon optim rule assum loss classif maxim pc approach refer mixtur discrimin analysi flexibl model eq discrimin minim classif error neg log model paramet model provid reason estim entir input discrimin learn data obtain estim close boundari model eq describ joint probabl interpret partial discrimin estim procedur hierarch cluster case learn hierarch cluster concern identifi hierarch structur cluster featur space suggest agglom cluster scheme start cluster level optim model higher level hierarchi cluster merg base similar measur pair cluster procedur repeat reach cluster top level level cluster final learn identifi hierarch structur common work input densiti identifi individu hierarchi class work class condit input densiti model eq eq kx similar fig essenti obtain set neglect step initi main iter neglect sum label data densiti cluster level mix gener case depend densiti model level cluster level merg level pj level assign uniqu featur probabilist cluster abil provid optim cluster level assign data train assign cluster level threshold typic set procedur ensur assign wrong cluster probabl cluster interpret interpret cluster gener exampl cluster displai prototyp exampl typic featur level hierarchi distribut prototyp exampl identifi highest densiti valu cluster higher level prototyp sampl drawn gaussian cluster proport typic featur level found draw ancillari exampl region list typic keyword demonstr sec higher level proce similar measur similar measur appli framework hierarch cluster natur distanc measur cluster densiti diverg reflect dissimilar densiti probabilist space drawback kl obtain analyt express level distanc subsequ level approxim express similar probabl space model sec comput level hierarchi fig illustr hierarch cluster gaussian distribut toi data dissimilar measur densiti defin dx index cluster due distanc refer dissimilar set cluster indic defin disjoint ii indic constitut cluster level densiti cluster obtain similar definit gaussian integr dx jj defin vector ig dimens symmetr matrix distanc written turn fig import includ prior compon dissimilar measur easili comput modifi matrix cluster similar measur natur principl base merg highest merg similar probabl draw exampl cluster denot arg model estim rm arg comput approxim arbitrarili accur ancillari set data sampl drawn estim model randomli select cluster probabl draw sampl comput estim cluster arg estim section omit depend notat conveni fraction sampl sampl depend similar measur construct fix hierarchi visual interpret data sampl depend hierarchi obtain merg number cluster relev data sampl idea base level assign sec comput posterior rank descend order comput accumul posterior sampl depend cluster form merg fundament compon level modifi error confu figur hierarch cluster gaussian cluster wide extrem peak prior tabl show construct distanc measur group cluster level due fact distanc base shape distribut appli dissimilar measur level method absorb cluster form cluster method absorb cluster stage reason prior cluster neglect method experi hierarch cluster illustr segment defin complet set uniqu word occur email email histogram vector frequenc occurr word defin content email matrix collect histogram email suitabl preprocess data requir good perform remov word normal histogram vector unit length preprocess matrix train consist word email annot job spam model directli deploi commonli framework latent semant index oper latent space featur vector found project subspac span left eigenvector largest singular valu singular decomposit matrix investig method automat determin subspac dimens base gener number subspac compon obtain initi studi classif error set found subspac good perform fig present scatter pc pc pc figur scatter plot data largest princip compon displai light grei color black dark grei spam data exist small job confer plot featur largest princip compon data part job confer mix fig show perform fig hierarch illustr threshold word approx occurr influenc classif error simul threshold set occurr approach normal vector repres estim vector sum extens experi approach give featur gaussian mixtur model classif error classif error aic minima λ minima figur averag perform algorithm repeat run nu unlabel exampl variabl number label exampl nl algorithm paramet set upper panel show perform function discount factor unlabel exampl correspond unlabel unlabel exampl nl optim close unlabel data fulli nl nl indic reduc util unlabel exampl classif error reduc approx unlabel data nl gradual nl classif error optim function nl shown middl panel lower panel show number compon select aic criterion optim sec nl advantag number compon keyword busi web scienc inform interest busi call tabl keyword model job spam typic featur sec backproject origin keyword cluster tab fig illustr hierarchi individu class depend densiti dissimilar cluster measur comput overlap exist ancillari data requir comput basic treat dissimilar cluster standard incorpor prior confer class domin cluster keyword list tab accord mean confer lower left panel show cluster level assign distribut test set classifi confer email cf sec obtain interpret level high level similar comment made job spam class train model result typic run present fig top row illustr hierarchi form sampl cluster similar measur sampl depend measur number top bar frequent combin level cluster resembl sampl depend cluster similar higher level cluster form inspect bottom row show cluster class cluster combin sampl depend method align class label align cluster class label level dissimilar probabl cluster cluster dissimilar probabl cluster cluster dissimilar probabl cluster cluster figur hierarch cluster model left column class middl column column upper row show modifi dissimilar lower row histogram cluster level assign test cf sec probabl probabl cluster mixtur confer job spam cluster dissimilar probabl modifi cluster hierarchi level cluster dissimilar probabl similar cluster hierarchi level cluster figur model upper row show hierarch structur left panel illustr sampl depend similar measur sec middl panel modifi dissimilar sec panel cluster measur sec measur lower row show cluster annot email label level hierarchi level cluster remain modifi dissimilar cluster measur black bar fraction confer label test set email end cluster keyword cluster level provid respect superior method current data set keyword cluster provid perfect descript job confer keyword cluster belong broad spam categori paper present probabilist agglom hierarch cluster scheme base introduc generaliz gaussian mixtur model extens abil learn label unlabel exampl import real world medic support successfulli test segment email probabilist scheme automat cluster hierarchi level assign unseen natur techniqu interpret cluster prototyp exampl featur similar measur cluster merg present compar refer autoregress model ann inst stat vol pp cm neural network pattern oxford cm bishop hierarch latent variabl model data ieee pami vol pp yang machin learn inform machin learn vol pp st gw tk landauer latent semant amer soc inf vol pp hierarch siam sci comput vol pp learn inform extract inform machin learn vol pp lk text generaliz gaussian proc ieee vol pp lk learn label unlabel submit hasti analysi gaussian royal stat societi seri vol pp lagu map document proc work cl jr high data effect advanc nip mit pp lk hansen compon adv comp pp lk christiansen learn world wide comput statist data lk christiansen learn world wide proc nonlinear method data pp comparison cluster proc conf art morgan pp dj miller hs mixtur expert classifi learn base label unlabel advanc nip pp ak classif label unlabel document machin vol pp larsen lk cluster proc int conf intellig inform engin system alli technolog osaka mixtur advanc nip pp em agglom hierarch cluster document inf proc vol pp probabilist framework hierarch organ classif document submit journal intellig inform ed wiener jo hierarchi text inform vol pp approach hierarch mixtur advanc nip pp jc measur independ compon analysi proc ieee vol pp
IR/880 5 de lisboa de retriev web miguel de maria para de em informática professor jorg costa da silva professor jorg costa da silva professor departamento de informática de da universidad de lisboa internet é um de da da de foi de forma os motor de para é de mai para forma um de ao sistema de de na internet tem como de os de sistema de para est de para de de de para de de support vector como mai à para ser de ao de um de de um de na da de result na de de abstract effici inform retriev highli dynam web complex task search retriev environ continu updat sourc largest media absent internet global search engin index classifi inform smaller network commun address develop inform manag environ design improv retriev effici onlin smaller network commun search achiev goal combin multipl index defin multipl gather deal public period inform retriev techniqu order classifi set theme support vector prove fast reliabl classif techniqu prove scalabl solut accept storag manag fairli larg collect daili public combin fine tune train filter web document multipl enabl achiev classif accuraci acknowledg work support part praxi project ariadn digit praxi project tabl content chapter motiv contribut organ chapter ii concept inform inform retriev model automat inform classif model inform classif algorithm inform metadata inform integr softwar agent inform mediat integr summari concept chapter iii relat work inform retriev internet web search engin ir digit publish environ ii search engin ir develop environ harvest altavista tm search intranet relat work summari chapter iv architectur global architectur retriev servic classif servic train classifi strategi portal gener architectur summari chapter design implement implement retriev servic implement classif servic implement design implement summari chapter vi result evalu gather activ queri effici classif accuraci multipl classif classif score classifi accuraci time result evalu summari chapter vii futur work futur work appendix search engin internet search engin subject directori special search engin metasearch engin appendix distribut classif score obtain classifi intern societi local scienc environ busi comput internet refer iii iv list figur figur digit librari architectur servic includ load articl gener electron public compon digit librari specif interfac access common inform bu figur develop model develop initi requir definit design implement prototyp creat prototyp subject evalu process design option prototyp cycl iter time optimum prototyp perform achiev figur recal relat ir system figur basic inform retriev model produc user set document queri comparison queri organ list surrog produc list document evalu relev queri croft figur incid matrix ir system document repres surrog figur vector space model document similar product vector repres document repres dimens relev item document close similar queri vector vi list figur figur basic infer network object queri network oj object rm concept qk queri node repres inform figur tree simpl automat attend footbal game watch tv base weather condit figur linear separ hyperplan support vector circl figur linear separ hyperplan case wrong classif perform extract tool determin support set posit neg figur graphic perform classif algorithm figur harvest architectur main compon figur architectur main compon retriev classif search engin topic collect index gener figur retriev servic architectur articl retriev index web gather predefin period queue action manag configur control retriev articl store classif inform request classif servic figur classif servic articl receiv retriev servic convert vector format enabl classif base model defin train exampl local librari articl compar set recent articl check relat figur data model articl articl catalogu set attribut vector format store associ featur classif store confid level categori articl relat figur interfac search engin user submit advanc queri multipl restrict search interfac access custom built state person prefer figur oper system multipl gather agent target public web document agent assign handl request classif store inform access web interfac figur web interfac manag gather agent collect interfac edit delet agent figur interfac creation gather agent agent schedul plan de knowledg detect current edit da paramet figur gather knowledg base detect current edit set regular express defin rule scan web document figur configur script gather agent main configur script express restrict web site script invoc classif servic figur object storag format inform articl file format figur oper model classif servic main subcompon figur protocol thesauru servic servic receiv word list featur includ root lexic inform figur messag format protocol thesauru servic request messag accept word messag syntax lexic inform word figur vector format word identifi sequenc number index vocabulari file vii viii list figur weight normal frequenc document document frequenc figur histogram weight articl present figur weight normal length figur protocol classif servic client send document request classif classif respond confid level categori test vector format figur messag format protocol classif servic request delimit tag classif delimit tag tag vector format categori separ charact space separ featur weight figur web custom topic collect index gener advanc search form search item figur protocol commun harvest broker queri issu specif messag format broker return match result set result code identifi data figur messag format queri specif result set queri issu custom broker result code identifi match object aggreg data attribut figur analysi public bandwidth bandwidth limit attend text retriev gather activ figur decomposit task perform articl process gather agent request articl obtain complet articl classif articl store tt repres time fulli process articl figur time spent classif function articl size averag text size classifi articl figur corpu size evolut time index grow corpu size relat total corpu size index size time figur decomposit oper perform process queri user submit queri receiv process start send result user receiv match result result arriv figur time queri time similar queri normal queri process queri approxim figur time queri load situat simultan time load figur time queri load situat size slight degrad number articl collect load situat figur contribut categori collect exampl calcul classif accuraci figur classif accuraci option accuraci formula formula repres achiev accuraci option pass classifi figur classif accuraci accuraci formula formula repres estim accuraci figur comparison classif accuraci option figur number posit classif score option figur comparison number correct classif total number classif figur recal valu categori ix list figur figur analysi distribut classif score obtain classifi sport busi graph show classifi produc high score exampl classifi score illustr classifi difficulti produc high classif score exampl classifi score figur graph illustr distribut top classif score exampl categori lowest score societi busi figur classif score posit exampl creat obtain classifi train articl written januari notori evidenc result tendenc line figur classif score posit exampl obtain classifi train articl sampl month year figur architectur design metasearch engin main compon set agent perform queri search displai mechan figur distribut analysi classif score obtain classifi polit figur distribut analysi classif score obtain classifi intern polit figur distribut analysi classif score obtain classifi societi figur distribut analysi classif score obtain classifi local figur distribut analysi classif score obtain classifi media figur distribut analysi classif score obtain classifi educ figur distribut analysi classif score obtain classifi scienc environ figur distribut analysi classif score obtain classifi cultur figur distribut analysi classif score obtain classifi busi econom figur distribut analysi classif score obtain classifi sport figur distribut analysi classif score obtain classifi comput internet xi xii list tabl list tabl tabl onlin public classifi period avail archiv search capabl tabl descript major search engin provid search featur onlin environ tabl detail descript list attribut class tabl set queue defin index web site tabl set categori defin tabl set messag result set tabl onlin public test tabl number document retriev edit public averag time complet gather activ valu obtain low network traffic hour tabl storag statist dai activ tabl list word queri articl test effici tabl formula calcul classif accuraci xiii xiv list tabl tabl classif score categori percentag exampl classifi societi busi classif score low tabl list common web search engin tabl descript select web search engin librari tabl descript select subject directori engin tabl descript select web metasearch engin chapter introduct number electron public articl publish web dramat year exist keyword search engin cope mass inform dissert present system appli modern inform retriev techniqu manag inform chapter detail object outlin methodolog develop chapter introduct motiv object avail onlin inform easili access trough internet evid inform inabl assimil larg amount inform appar onlin inform suffer problem tool index journalist onlin inform site requir frequenc effect limit visibl nation commun uniqu inform web attempt popular search engin locat find refer articl month link page broken high volatil onlin inform publish dai found fifteen onlin public provid search engin archiv offer free search retriev access archiv public restrict access make imposs accur link publish inform larg mass multipl class user inform search retriev archiv journalist search review recent public research stori ordinari user queri recent specif topic queri bring factor complex retriev environ dynam inform classifi inform relev articl easili discov huge amount publish electron public web separ articl print classif criteria uniform lead poor satisfact inform intellig softwar index special inform publish internet moder comput account semant updat constraint defin web servic user publish internet site organ common categori scheme special index make knowledg updat schedul site organ relev onlin public make visit motiv object inform ad prototyp search environ approach attempt overcom current limit exist search engin queri altavista document major onlin public date februari april answer found document match ten thousand document publish public averag hundr fifti document edit user search engin document stori quickli realiz document publish stori daili onlin public disappear experi illustr current situat onlin updat constraint sever limit coverag web search engin infoseek search engin yahoo light overcom problem extend coverag index major web site includ reuter fox washington post onlin scan daili provid document daili requir comput effort queri infoseek keyword recent document endless articl publish worldwid locat index broken link week common gener index face problem document publish daili basi onlin public worldwid size speak onlin commun big larg gener index content produc archiv document give possibl search continu link consist archiv public produc realiti motiv previou report discuss multipl approach mitig problem al maria silva complet solut obtain global digit chapter introduct gather inform digit librari merg internet web site singl uniform built collect independ develop compon reli accomplish larger task digit librari inform present figur al ariadn jointli develop lisbon nation daili newspap digit publish infrastructur inform produc journalist organ common inform ariadn gener multipl public digit format system set person servic inform filter payment server bill inform function unit ariadn inform classif retriev archiv corpu section detail main problem face main result achiev common interfac bu search search interfac public gener public multimedia repositori person gener person public loader user templat repositori http ariadn digit librari architectur figur digit librari architectur servic includ load articl gener electron public compon digit librari specif interfac access common inform bu contribut contribut advanc framework definit web servic retriev classifi web resourc creat digit librari public architectur make improv function retriev perform hypothesi dissert integr exist search classif mechan control architectur improv retriev effici specif domain collect inform induc satisfact valid select web environ target inform domain unstabl environ inform quickli obsolet time discard publish text categor appli inform complex subject heterogen natur main problem automat retriev articl site short period time public give access archiv previou edit build refer useless quickli web site built show inform content time url invalid strategi increment gather web site base direct applic common statist learn method automat text classif problem classif articl articl classifi correctli reflect topic address tradit classifi train set posit neg exampl typic output binari classif ignor underli relat valid classif model creat train exampl inform public classif manual label valid test exampl chapter introduct accuraci classif classif system measur classif confid prevent strong neg impact reader web good valu classif accuraci obtain research environ insuffici reader detect semant distrust system stop season classifi behavior time distanc date articl train set evalu tend lose accuraci topic vocabulari ad strong weight featur discard provid easi access articl public riski oper automat group articl topic requir high mistak obviou reader prototyp search classif system address introduc problem index month sampl public observ scalabl solut accept storag support archiv filter inform publish short period time web store stamp repositori collect resourc custom elimin problem duplic resourc extend common classif multipl classif scheme experi sampl approxim observ articl receiv multipl classif behavior improv perceiv qualiti classif activ classif accuraci point investig iter averag accuraci classif approxim import improv action filter web clear commonli navig header data unrel content measur classif accuraci directli depend season event measur degrad accuraci distinct strategi creation classifi built exampl small time classifi built articl bigger time period observ confid methodolog classif rapidli classifi confid valu higher remain constant time methodolog develop iter iter requir implement prototyp develop perform function evalu system function defin architectur detail defin architectur implement system prototyp prototyp subject evalu process stage result system return stage prototyp figur illustr process perform function evalu phase evalu requir analysi phase evalu evalu requir analysi requir analysi requir analysi prototyp construct prototyp construct prototyp construct implement phase figur develop model develop initi requir definit design implement prototyp creat prototyp subject evalu process design option prototyp cycl iter time optimum prototyp perform achiev chapter introduct evalu complex stage methodolog structur algorithm chosen larg dictat perform inform retriev classif problem situat emerg develop iter requir identifi maxim perform improv develop end prototyp accomplish desir result organ dissert dissert detail develop organ chapter concept introduc technolog involv develop present kei idea inform model inform softwar agent concept metadata chapter iii relat work analyz system share common object present analysi internet search detail current publish web resourc analyz softwar compon build block architectur harvest inform discoveri main build block present detail chapter iv architectur describ function main requir detail behavior compon chapter implement describ built present compon build system develop connect softwar piec chapter vi result evalu present statist gather oper discuss scalabl scenario detail result studi classif accuraci chapter includ deriv develop trace guidelin futur work chapter ii concept incorpor technolog domain present overview concept involv start discuss inform retriev dive model perform cover repres system conceiv year proce present concept automat inform cover algorithm artifici intellig test present background inform softwar inform mediat plai import role chapter ii concept inform retriev inform retriev abbrevi main goal retriev document text inform content user consid relev jone willet felt public back ir popular research felt autom exist manual index search method salton achiev ir commun defin main activ import studi area index search index refer document repres retriev search refer structur built index stage examin process queri activ repres core ir gain techniqu user interact interfac ir system lead discoveri wai improv retriev effect al ir present face paradigm shift appli bibliograph archiv store refer document document attribut titl abstract due storag search surrog full text document ir document retriev text handl textual resourc broad area impli word inform todai textual entiti kind media valid foundat ir question kei challeng ir continu retriev relev document entiti user demand main issu ir measur notion relev bucklei effort establish quantit measur evalu effect ir system term relev item retriev queri measur recal percentag item retriev search relev percentag relev item retriev collect search number relev number document retriev number relev recal number relev document collect inform retriev common ir system measur present figur show improv expect recal true recal figur recal relat ir system averag larg number queri larg ir system perform recal accept specif condit low valu measur ir system contrast obtain manag system dbmss dbmss share essenc goal retriev relev inform dbmss provid differ ir system inher structur dbm system facil retriev user demand ir handl object unstructur abstract larg text document document share inform item refer subject difficulti lead field parallel complementari inform filter classic belkin croft present definit concept share common point differ aspect croft ir profil user request queri aim short term quick user interest dramat amount time user wait relev answer bigger ir static index process term document chang time deal term abstract concept dynam involv learn document share concept ir retriev relev document remov collect incom document irrelev chapter ii concept field share similar provid user retriev perform ir system includ provid facil cover wide varieti user import aspect ir system evalu retriev perform evalu belong user user satisfi queri expect met potenti failur user judg system perform distinct characterist contribut percept system effect includ accuraci queri amount irrelev inform includ user feel system meet turn gener system fail techniqu minim situat relev feedback bucklei techniqu improv queri formul initi retriev oper control queri alter term queri return higher number relev document user remaind section detail behavior ir system work inform retriev model ir research model aspect ir system approach ir lead percept underli assumpt assumpt familiar analysi ir system limit perform evalu simplifi system easier state strategi effect trec initi platform research ir test system techniqu compar trec defin set experi test probe wide variat retriev techniqu ir system goal ir discoveri document enabl user satisfi inform gener agreement model illustr figur model user set goal intent relat specif topic find resourc knowledg inadequ inform lead inform retriev user inform seek illustr model submit queri ir system express languag understood inform behavior repres side figur queri consid approxim imperfect left side figur model consid produc document process organ mean text surrog index central import ir system comparison queri set surrog gener lead select possibl relev retriev document document evalu user leav ir evalu lead modif queri inform discuss relev process queri modif user evalu produc text text collect organ text surrog organ comparison interact retriev text evalu modif person intent inform queri figur basic inform retriev model produc user set document queri comparison queri organ list surrog produc list document evalu relev queri croft research concern primarili process document comparison evalu system measur chapter ii concept recal dedic analysi document comparison techniqu underli structur ir system build index phase incid matrix document corpu repres occurr surrog di dm tk tn figur incid matrix ir system document repres surrog surrog tk document di entri matrix assign weight repres import relev surrog document find good relev function kei ir system express relev relat document inform rang valu irrelev document relev document problem relev state establish uniqu user user issu request judg result document opinion relev dynam user document relev point classifi document irrelev inform model differ ir system relev relat comparison process strategi method model detail review mcgill boolean model simpli provid presenc surrog document complex calcul made retriev yield rank list document uncertainti account exampl vector inform retriev space model probabilist model similar function compar document queri present behavior ir model mention detail boolean model boolean retriev base concept exact match queri specif text surrog model boolean queri boolean logic oper retriev document surrog combin surrog queri retriev distinct made incid matrix simpli fill surrog opposit situat comparison oper boolean model partit set retriev retriev model ir system critic oper retriev system reason obtain simpl invert file invert file main dictionari file post file dictionari file list keyword classif post file seri list previou entri list identifi document term major problem model relev rank larg set retriev document vector space model vector space model base retriev concept concept limit boolean model exact match concept vector space introduc salton al al treat document queri vector dimens word surrog repres document queri document match compar vector similar function document request vector vector number surrog occur document base di qi repres weight term typic similar measur chapter ii concept mcgill comput product di qi di qi document queri vector figur queri individu document relev item figur vector space model document similar product vector repres document repres dimens relev item document close similar queri vector assumpt similar vector repres document queri document relev queri import refin model surrog queri weight account import weight comput basi statist distribut term text occurr frequenc term document poor number time term refer document direct relat topic identifi term measur deriv intend optim weight assign document frequenc idf idf measur relev singl set give idea mean surrog document surrog term defin dk dk occurr frequenc term weight assign strategi idf occurr frequenc term document assign largest inform retriev weight term high frequenc individu rare collect automat weight estim improv recal present al standard term frequenc weight smart smart classic ir system vector space model smart plai role develop ir system origin design middl time punch card magnet tape smart began low level ir academ user high ir gener routin concern smart evolv year sophist appli system extern user low access text relev inform mcgill smart result lifetim research salton ir model smart fulli automat index method assign content identifi document search request collect relat document common subject make start specif item subject area find relat item neighbor subject field characterist vector space identifi document retriev perform similar comput store item incom rank retriev item order similar queri includ automat procedur produc improv search statement base inform obtain result earlier retriev oper smart continu refer research academ environ creator state result obtain extens test trec collect retriev evalu smart system produc superior retriev perform area specif condit perform valu compar obtain commerci retriev allan al chapter ii concept probabilist model probabilist ir model base probabl rank principl principl state goal ir system rank document order probabl relev evid probabilist model suggest sourc evid estim probabl relev text queri typic sourc evid statist distribut surrog relev nonrelev document wai probabilist concept appli ir approach attract interest recent infer network rank document order satisfi probabl inform probabilist retriev model comput probabl inform satisfi object text media retriev environ object media type queri inform regard complex proposit content object infer network model base bayesian infer network acycl depend graph node repres variabl constant edg repres depend relat preposit typic ir node correspond word term extract text document network built ir object queri network object network built index phase remain unchang process retriev consist object node node concept assign assign specif concept object repres arc node object concept assign estim probabl base occurr frequenc concept individu object larg collect object queri network consist singl node repres user inform multipl root concept express inform network modifi reformul relev feedback mechan inform retriev queri network built interact user attach object network enabl comput probabl inform met object produc rank list object figur present scheme detail process found inqueri object network oj rm queri network figur basic infer network object queri network oj object rm concept qk queri node repres inform inqueri system al base probabilist model found wide accept tool member ir research commun basi oper system inqueri led commerci win west publish compani topic veriti inqueri base infer network model document rank order probabl satisfi inform search involv calcul belief document due occurr singl queri term combin individu belief mean type logic oper includ boolean natur languag search continu develop ongo seri trec confer chapter ii concept automat inform classif typic ir problem reli queri interest retriev system find document user satisfi inform filter system profil user request identifi relev materi stream arriv document user make topic search provid retriev mechan queri summar entir provid complex profil filter system structur arrang inform user easili discov relev resourc specif inform problem address inform classif ic inform classif assign inform unit predefin categori base content classif activ oper previou inform user applic ic automat document inform unit document text automat text categor topic earli sixti automat classif text document difficult result correct involv subject manipul text document wai recent automat classif techniqu gain import exhaust studi compar algorithm vast amount inform recent access detail review techniqu yang automat inform classif desir activ situat dimens document corpu dramat larg human impract typic automat text categor classif stori multipl sourc plai import role inform manag system ir system gener includ classif facil resourc index label determin classif categori automat classif inform perform phase characterist abstract specif model specif train exampl classif system learn determin categori properti differenti posit neg exampl automat inform classif provid item test learn model perform classif ic subject abstract natur concept user understand common agreement imposs train target categori document make task automat classif harder ir perfect expect ic misclassif automat classifi rule creation happen inform provid learn model defici situat classif variabl confid model inform classif basic notion learn method notion classifi classifi function map input attribut confid input belong class case text document attribut word document class correspond text categori sport classifi probabilist probabl distribut typic situat express cinema theatr goal inform classif learn classifi induct learn method section describ compar algorithm method requir small amount label train data exampl item input train data paramet classif model test evalu effect model test unseen instanc common agreement varianc algorithm document vector word featur show previou popular ir system valu term frequenc document frequenc comput depend learn techniqu featur emploi chapter ii concept algorithm inform classif algorithm implement automat document categor base content present overview tradit recent algorithm appli task tree algorithm set record record consist number pair attribut repres categori record goal determin tree basi answer question attribut predict correctli categori attribut tree classifi construct categori approach algorithm exampl deriv concept tree categori attribut boolean valu figur present tree automat attend footbal game watch base weather condit outlook sunni attend attend rain humid watch tv true watch tv attend figur tree simpl automat attend footbal game watch tv base weather condit text categor complex properti valu map exist absenc keyword document simpl boolean valu techniqu appli text categor class probabl return function probabl item classifi specif categori detail automat inform classif introduct techniqu appli text categor al naïv net naïv classifi construct train data estim probabl categori document featur valu instanc theorem estim ck ck ck quantiti impract comput simplifi assumpt naïv assum featur xn categori variabl simplifi fact assumpt condit independ gener true word naïv surprisingli effect interest learn express bayesian network al method learn network special classif limit form depend featur relax restrict assumpt naïv classifi bayesian probabl featur xi directli influenc featur neighbor knn neighbor statist approach pattern recognit text categor test find nearest neighbor train document proxim measur categori neighbor weight categori candid similar score neighbor document test document weight categori neighbor chapter ii concept document nearest neighbor share weight ad result score categori test document rule knn written di classif document respect categori di similar test document train document di bj threshold binari support vector machin support vector machin svm learn method introduc vapnik cort vapnik quickli gain popular learn commun simplest linear svm hyperplan separ set posit exampl set neg exampl maximum margin figur illustr scheme margin figur linear separ hyperplan support vector circl formula output linear svm vector constant learn train set linearli separ input vector automat inform classif linear margin defin distanc hyperplan nearest posit neg exampl maxim margin express optim minim subject xi yi ith train yi correct output svm ith train problem linearli separ figur present exampl classifi correctli vapnik optim formul exampl fall wrong side boundari figur linear separ hyperplan case wrong classif perform extract tool determin support set posit neg svm shown yield good gener perform varieti classif includ handwritten charact face recognit text categor simplest linear version svm good classif fast learn fast classifi instanc train svm requir solut quadrat program problem quadrat program optim method learn basi train exampl complet tutori svm pattern recognit chapter ii concept perform analysi compar perform analysi classif algorithm conduct al joachim yang result share gener figur present result survei joachim result present obtain collect number reuter collect train set collect benchmark classif algorithm knn perform figur graphic perform classif algorithm classif accuraci measur tradit recal proport item categori recal proport item categori origin categori studi report averag breakeven extens detail train data test result refer support vector machin accur method averag accuraci neighbor slight lower perform tree significantli averag naïv show significantli inferior behavior valu question yang studi present closer perform valu knn svm svm techniqu present higher perform metadata metadata metadata gener data describ data enhanc element metadata document common metadata resourc bibliograph catalog typic librari clear catalog import resourc document good collect document user advent develop mainten metadata kei enabl institut compani provid easi access effici manag collect heterogen natur environ creat addit problem tradit metadata manag make manag set specif area gener metadata schema fit taxonomi lagoz metadata metadata supplement automat gener classif reduc document resourc collect retriev media collect benefit avail metadata human due size automat metadata extract techniqu inferior metadata practic solut popul metadata record larg internet metadata schema motiv librari metadata standard enabl common metadata scheme marc record congress exampl standard area specifi share structur record librari congress store retriev protocol dublin core core develop internet specifi minimum set attribut describ web resourc common agreement defici specif area complementari chapter ii concept schema addit metadata specif defin overcom limit web site adopt inform integr rapid evolut inform avail research work techniqu integr multipl distribut heterogen inform sourc intellig softwar agent smart inform mediat technolog inform integr overlap softwar agent inform mediat definit softwar agent concept controversi approach side scientif commun handl approach broad definit agent perceiv environ sensor act environ effector norvig specif definit provid concaten term word agent softwar agent ketchpel autonom agent graesser mobil agent al collabor programm intellig agent al commun languag abil live perform action autonom local remot knowledg abil collabor agent commun refer agent softwar compon capabl act order accomplish task definit support reject collabor knowledg specif aspect action perform set properti contribut definit kei attribut found agent special notion concept mediat mediat view special program interact remot sourc normal access heterogen inform predefin protocol mediat interact directli web sourc wrapper wrapper softwar object encapsul web sourc offer common api mediat inform integr previou fit task identifi ir system system design subramanian present customiz architectur softwar agent captur access inform distribut electron repositori integr system task web inform integr system answer queri requir extract combin data multipl heterogen data sourc al multipl instanc web data integr system al beeri al li al address specif problem larg evolv number web sourc data sourc experi larg simpl queri navig interfac metadata characterist sourc metadata absent data sourc data structur metadata induc web page format explicit tag element larg sourc autonomi frequent web site chang appeal interfac wrapper useless inform sourc manag awar exist wrapper address set approach creation inform integr system approach replic inform web data sourc load common schema queri made inform inform fresh exist highest queri perform achiev approach data remain origin web data sourc queri reach remot data sourc inform fresh exist longer maximum queri perform achiev zhou hull discuss detail advantag disadvantag approach virtual approach data sourc replac previou chapter ii concept inform larg number data sourc small number specif data sourc import provid archiv inform publish web wareh approach approach develop summari concept kei inform retriev concept inform perform evalu present repres model ir system develop past kei inform classif concept statist learn techniqu compar base effici classif activ support vector recent research effect learn tool data kei tool ir system present current scheme repres meta inform mention dissert inform integr kei featur discuss common approach tool work chapter iii relat work advanc search classif tool onlin articl similar todai internet present review system begin give introduct mechan ir internet proce analysi onlin public internet describ ir system integr digit publish environ review search tool index environ investig framework develop web retriev harvest altavista search intranet chapter iii relat work inform retriev internet introduct world wide web earli nineti al inform publish gain widespread main reason enorm success graphic interfac access multimedia inform hypertext hyperlink internet publish easi make effect inform difficult volum inform access internet made imposs find relev inform guid ir techniqu found perfect ground applic facil offer web ir engin inferior exist ir research matter time gener retriev techniqu popular web search engin current distinct properti world wide web environ present problem ir research current web ir system experi server network rapidli grow user popul attempt access system current web search engin primarili support text retriev provid support complex found digit librari multimedia inform web search engin web transform search engin import part process studi lawrenc gile februari million page index web gile repres terabyt inform terabyt text remov html comment extra studi quantifi variabl difficult task due web dynam environ provid good clue quantif web search engin provid effici access huge amount inform power tool assist task navig world wide web recent survei gvu visual usabl center user survei state web user search engin find inform ir digit publish environ consum search engin locat bui good research destin elect web search engin face problem task lack search engin coverag rel estim size publicli index web engin index estim web size gile sever updat frequenc constraint index daili modifi page search engin month web search engin cope absenc metadata web resourc simpl html homepag site site dublin core standard face find type search engin index web metasearch engin place queri multipl search engin join result common interfac appendix discuss detail behavior coverag search tool ir digit publish environ inform publish gain widespread newspap start offer electron version paper public digit medium reduc cost simultan avail paper internet quickli cover inher benefit brought print distribut cost avail global area public specif domain creat digit problem surviv tradit media case paper version public replac electron version byte magazin econom electron public provid public user subscript fee tradit flag larg number gener narrow scheme financ overcom servic emerg avail search capabl public edit natur addit classic profit featur provid newspap paper archiv medium chapter iii relat work electron journal charg small fee access articl digit archiv provid free access restrict limit tempor rang case rang edit report week gener situat public provid dedic search engin provid horizont search capabl find articl publish specif stori onlin public reli tradit web search engin present previou section problem search tool index wide rang web site desir turn useless daili produc dai hundr articl internet short period time major search altavista search engin visit nation web weekli monthli basi natur power special search tool environ list search engin referenc specif search engin special interest special search engin provid retriev featur onlin environ limit public restrict area unit index wide rang onlin public world includ public el pai digit pai le mond mond featur search engin classif result predefin set categori set featur make similar system drawback system introduc incomplet coverag public includ search index path past year public paper onlin major electron public onlin site list tabl data present present good snapshot current realiti onlin public region scope specif topic ir digit publish environ present detail descript overview search engin dedic engin onlin environ onlin public da de euro focu onlin de record subject archiv search engin period sport gener gener gener gener gener gener gener sport gener sport sport gener gener gener edit daili daili edit edit edit edit daili daili weekli weekli weekli weekli daili edit edit edit edit daili daili daili daili articl daili edit daili tabl onlin public classifi period avail archiv search capabl chapter iii relat work commerci onlin search engin index electron period onlin version print public fast relev result index select period consist million claim web rate articl dai articl index continu captur latest updat approxim period list articl categor predefin system advanc search interfac includ boolean phrase restrict specif articl categori period specif period enabl user make select queri find search search engin search engin subject directori internet offer top stock sport popular item find break popular topic straightforward activ web todai top search engin offer special search onlin environ tabl present abbrevi list search engin provid extract studi import aspect analysi updat frequenc relat number sourc number sourc updat frequenc situat difficulti effect tempor coverag review valu present tabl provid claim search provid inferior coverag primari goal provid exhaust coverag main public intern unit state public includ group turn search difficult task ir develop environ search engin date coverag northern light altavista total index excit hotbot search infoseek sourc updat frequenc sort method week min date week year web week web month web site week wire web month web month web site min date hour relev hour relev hour relev hour relev minut date hour date tabl descript major search engin provid search featur onlin environ ir develop environ integr environ develop search retriev system commerci product academ todai goal provid framework develop system retriev document text relev content user inform review system present harvest al academ system integr compon manag inform web describ altavista tm search intranet tm search intranet commerci product inform retriev smaller harvest harvest integr set tool replic relev inform internet manual harvest design built internet research task forc research group resourc chapter iii relat work element colorado mid nineti harvest open system base project field major research tailor code provid custom specif function kei goal harvest provid flexibl system configur wai creat type make effici internet network index space disk main featur harvest abil provid data gather architectur construct index harvest consist subsystem figur present architectur scheme harvest base search present al harvest subsystem replic object cach user interact harvest base search engin queri manag entiti entri point index part broker broker build index inform provid gather design run inform provid websit broker retriev inform broker cach replic mechan system scalabl access support remaind section compon interact gather provid client broker queri manag subsystem gather gather provid object cach replic manag provid figur harvest architectur main compon ir develop environ gather gather effici customiz collect index inform index system internet gener excess load remot retriev index inform http perform multipl heavyweight retriev oper index system excess network traffic retriev entir object discard inform reach index site html anchor harvest gather address ineffici wai inform provid run harvest gather export content summari public corpu inform gather period scan modifi resourc add content summari local cach summari object retriev cach compress stream requir separ request object provid remot access increment updat index transmit inform compress stream improv effici network transmiss featur reduc server network load order magnitud build index broker harvest index server call broker index queri interfac gather inform broker retriev inform gather increment updat index record uniqu identifi index remov inform invok subsystem receiv updat queri broker subsystem accommod index search harvest defin gener interfac accommod varieti search engin main requir interfac support boolean combin queri increment updat varieti backend insid broker harvest optim user support index flexibl interact support fast search complex stand queri chapter iii relat work default search engin harvest pointer occurr achiev space effici index size data support fast increment index support regular approxim queri object repres set pair separ index attribut tag support view notion involv stand queri object inform filter base queri predic make easi refin extend predic time replic harvest weakli replic file system call top broker replic instanc replic group flood complet state inform detect synchron failur implement eventu updat replica eventu converg object cach meet demand network link inform harvest includ hierarch object cach cach send request neighbor parent measur bandwidth fastest respond server retriev data cach http ftp object normal proxi server harvest autom task integr inform dispar repositori format architectur make effici internet server network link measur harvest reduc server network index space requir order compar system al major creation index customiz make index builder control index inform index search harvest excel choic develop framework search retriev system lack support discourag tool harvest project end support built compon pose risk develop project built system relat work summari altavista tm search intranet altavista tm search intranet commerci product ir function base public altavista search technolog world wide web tm search intranet product highli effici search retriev resourc easili configur manag retriev capabl larg amount inform spread multipl inform system geograph area altavista search intranet perform administr complex set task gather page continu gather capabl softwar page index creat index set distribut corpor web file server offer fulli user interfac submit queri present result good featur offer system wide rang file format support inher support languag technic specif difficult detail commerci product short descript architectur option conceal altavista search intranet product give user scaleabl search retriev solut major drawback system cost small domain limit number excel number document begin cost prohibit form process applic inform present product web site novemb cost index document approxim relat work summari inform retriev techniqu import tool internet size inform publish web grew effect inform present repres set exist web search compar index strategi subject directori ir techniqu digit publish environ chapter iii relat work import digit newspap portug term period avail search engin archiv facil present ir develop test detail architectur ir system search retriev web content system softwar compon prototyp implement chapter iv architectur defin set softwar compon retriev classif text document gather site web begin present global architectur detail behavior retriev classif servic topic collect index gener chapter iv architectur global architectur main object retriev classif articl found web search engin special inform figur present architectur main compon retriev classif web main retriev servic articl site distribut web higher abstract servic provid continu stream articl retriev web site retriev document deliv classif servic classif servic servic assign classif score articl categori defin collect train exampl local digit librari articl compon load common maintain index classifi articl access compon produc report topic collect index gener provid updat topic web gener predefin report specif topic search interfac offer direct access method retriev remain chapter detail behavior main compon site site site web articl retriev servic local digit librari inform classif servic train exampl classif search interfac topic collect index gener busi stori sport stori relat figur architectur main compon retriev classif search engin topic collect index gener retriev servic retriev servic retriev servic gather tool crawl web site collect articl publish multipl public figur detail retriev servic behavior multipl gather agent retriev index web site gather agent pf figur specif public restrict control index task web site gather agent request classif articl classif servic store result articl deal period queue configur updat prioriti gather schedul agent express updat frequenc target public daili public weekli edit target public gather agent start interest index current edit public gather agent configur index part inform site configur control store knowledg agent reject accept specif web document part current edit select scalabl avoid past scan irrelev inform public simpl header comparison prevent articl dynam web page built demand invalid header inform activ server page asp technolog activ server wide digit publish mark web date request publish time gather agent load articl inform extract web metadata includ time live valu edit agent retriev servic forward web document classif servic suppli clean format inform html act produc continu stream articl retriev web site chapter iv architectur site site site web configur control pb pc pa pe pf pd gather agent retriev servic articl classif servic figur retriev servic architectur articl retriev index web gather predefin period queue action manag configur control retriev articl store classif inform request classif servic classif servic figur detail classif servic behavior articl arriv stream provid retriev servic free present element html automat convert vector format base vocabulari inform classif schema present chapter actual base classif perform vector format thesauru word stem reduc featur document predefin vocabulari document repres vector thousand fill weight term document weight assign document featur calcul document frequenc frequenc document present inform classif servic retriev concept vector format store classif futur classif model classifi cn figur built train exampl prepar corpu provid local defin train strategi develop implement corpu articl daili classifi manual editor relat articl detect similar detect mechan mechan quantifi proxim articl recent process base vector format similar articl group articl relat cluster classifi process result classif score load confid level data relat articl train classifi strategi select train inform crucial determin effici accuraci articl train clean html tag web page relat format navig pick articl refer newspap public date uniformli distribut long time period strategi lead train data higher number distinct season includ train data small time window consid approach maxim accuraci process short cyclic event classifi maximum number featur featur select improv effici train test web dynam broad environ featur select remov featur import consid strongli categori chapter iv architectur local digit librari inform retriev servic articl vector transform thesauru classif model classifi classif classif model cn previou articl classif model similar detect classif servic figur classif servic articl receiv retriev servic convert vector format enabl classif base model defin train exampl local librari articl compar set recent articl check relat articl act central compon figur present data model load articl common attribut shown attribut set extract document structur target public unknown detail descript attribut present tabl specif attribut case list attribut attribut extract heurist clean navig bar header commonli found html inform web goal deliv text classif filter data repres observ induc misclassif articl featur weight categori confid figur data model articl articl catalogu set attribut vector format store associ featur classif store confid level categori articl relat model vector format associ featur class weight featur document calcul document frequenc idf al base vocabulari defin train exampl weight normal format similar detect classif servic mechan determin relat articl similar function similar associ articl store creat cluster relat articl class articl belong categori classif model express absolut confid score articl store multipl associ categori confid score chapter iv architectur attribut descript articl creation document time object live time object gather agent host gather agent type document size document checksum creat comparison gather set gather set head refer refer list url refer full text extract free format navig extract featur date public edit document weight categori weight featur calcul featur frequenc document categori confid document confid belong tabl detail descript list attribut class portal gener portal gener web interfac interfac search capabl gener custom report figur present overview access method access advanc search interfac user custom queri restrict classif data interfac search retriev articl filter categori edit compon includ search engin simpl queri handl complex advanc queri sourc gener custom report dynam built set prefer suppli editor individu user prefer store autonom associ user list rule defin format person public list potenti highli relev refer inform interest topic collect gener search engin access advanc search queri search public categori edit search engin topic collect gener custom report sport stori busi stori user prefer custom report sport stori public public figur interfac search engin user submit advanc queri multipl restrict search interfac access custom built state person prefer chapter iv architectur architectur summari architectur main retriev classif portal gener compon make flexibl modular exist singl inform mediat dedic web site mainten oper ad public rule express restrict url collect kei featur enabl index content attribut ensur scalabl volum inform publish dai web site perform classif train data classif assum vital import accuraci train strategi maximum number featur articl wide tempor rang underli natur season minim import featur avail filter version articl found web filter oper ignor style common format provid stronger remov topic report custom power search interfac chapter design implement architectur suggest integr set built custom softwar compon retriev classif text document share common articl present implement architectur begin overview global system proce detail implement inform compon chapter design implement implement implement set softwar compon previou develop scratch write softwar bind compon entir system implement oper figur retriev servic gather collect site gather agent index site gather agent gather agent web gather agent search engin harvest broker site result queri request classif server thesauru servic check similar recent web interfac user prefer relat word stem request classif similar detector topic collect index gener result classif servic train model classifi server classif model figur oper system multipl gather agent target public web document agent assign handl request classif store inform access web interfac retriev servic implement retriev servic implement modifi version harvest inform discoveri access system al gather gather agent send request classif servic classifi web store local gather local gather catalogu central harvest broker classif servic develop compon servic step convert document vector format lead creation thesauru servic servic perform word import correct detect document featur classif server thesauru obtain data pass classifi server built servic perform actual classif text svm packag written automat text classif support vector machin compon develop scratch built set tool implement web access access custom user search interfac interfac commun harvest broker harvest specif hidden simpl browser interfac remaind chapter present implement detail main compon retriev servic implement retriev servic inherit architectur harvest system al appli notion gather collect agent harvest broker gather unifi unit harvest system provid schedul gather activ plug compon support specif schedul queue compon oper system schedul queue unix request gather public web site gather agent defin queue chapter design implement queue gather schedul daili daili weekli sundai weekli mondai weekli tuesdai weekli wednesdai weekli thursdai weekli fridai weekli saturdai tabl set queue defin index web site set queue suffici handl onlin publish easili expand manual configur individu agent difficult develop special tool manag gather agent collect tool web interfac special develop figur easili creat agent chang configur exist creation agent figur entri point web site agent directli access current edit public queue match period figur web interfac manag gather agent collect interfac edit delet agent retriev servic implement figur interfac creation gather agent agent schedul plan de knowledg detect current edit da paramet specif inform web site requir effici perform gather rule detect locat current edit detect made regular express express rule web document rule knowledg base agent gener small program simpli state accept web document retriev public figur present extract output program filter current edit moment public chapter design implement deni deni deni big deni deni deni deni figur gather knowledg base detect current edit set regular express defin rule scan web document output agent manag tool set script configur gather agent figur show extract specif gather agent configur script harvest document manual detail format behavior properti present configur repres gather agent configur control main script web site configur script properti control retriev activ filter output program defin url correspond content current edit script time agent perform gather reflect updat definit rule defin restrict current edit post summar defin action perform gather oper classif comput valu attribut vector format list relat stori load retriev servic implement cf type deni deni deni big deni figur configur script gather agent main configur script express restrict web site script invoc classif servic gather agent suppli local articl harvest broker broker collect inform agent compil data gather central repositori data transfer store common call standard object interchang format al object list describ pair figur broker repositori implement distinct type index repositori index gener index tool wu repositori store retriev object format shown figur repositori support defin queri search retriev oper inherit origin harvest system major detail section chapter design implement pol da html pol da pol da da de de um de para de da se todo os na os crime de na de facto da de de um de para de da se todo os na os crime de na de facto um de para de para figur object storag format inform articl file format classif servic implement classif servic implement project adopt classif scheme present tabl categori nation polit scienc environ intern polit cultur societi sport local busi econom media comput internet educ tabl set categori defin reduc base theme organ common press western world digit librari newspap build train exampl classif model set categori core automat text classif activ categori correspond section obtain larg collect articl classifi editor accomplish classif servic integr figur thesauru servic classifi server train model classif server similar detector thesauru servic word stem function word stem reduc number featur found document replac word found root servic built base pinto packag freeli base packag suppli librari function manipul dictionari term includ check exist lexic classif code complet list featur download download web site chapter design implement retriev servic request recent relat classif server thesauru servic check similar word stem request classif similar detector result classif servic train model classifi server classif model figur oper model classif servic main figur present protocol commun thesauru servic request messag simpli includ word queri server respond lexic inform word shown figur word exist dictionari root word extract textual document vector format client request thesauru servic figur protocol thesauru servic servic receiv word list featur includ root lexic inform classif servic implement request word lex figur messag format protocol thesauru servic request messag accept word messag syntax lexic inform word document vector format vocabulari word term journalist environ vocabulari built root word specif term found larg collect articl gather onlin root word found thesauru servic origin word collect entri vocabulari index number convert textual document vector format requir weight quantifi import term document weight calcul frequenc term document document frequenc chapter ii review number document collect calcul document store vocabulari normal weight treat small larg document figur present text document vector format word number strongest weight occur multipl time articl occur regularli small portion collect figur show weight distribut set word word small document contribut classif activ strong weight contribut identifi theme chapter design implement da de de um de para de da se todo os na os crime de na de facto vector weight figur vector format word identifi sequenc number index vocabulari file weight normal frequenc document document frequenc facto crime featur figur histogram weight articl present figur weight normal length document vector posit neg train exampl categori creat collect articl gather approxim edit newspap classif servic implement built knowledg svm light implement support vector tool automat text classif packag suppli tool creat test classif model base document vector format sourc code freeli classif model built svm light consist set support vector determin separ posit neg document specif categori classif model issu confid classifi document calcul distanc point repres vector separ posit neg exampl develop server support classif classifi server code svm light handl invoc multipl classif model issu classif model classif server server written interfac classif servic compon server convert document vector format request document classif classifi server protocol commun classif server illustr figur client da request classif servic figur protocol classif servic client send document request classif classif respond confid level categori test vector format chapter design implement classif servic client issu request document delimit tag classif servic convert document vector format request classif servic respond messag delimit tag classif confid delimit vector document figur detail syntax messag classif servic interfac protocol document featur request featur featur figur messag format protocol classif servic request delimit tag classif delimit tag tag vector format categori separ charact space separ featur weight similar detector classif servic identifi relat stori process request quantifi similar articl implement web form collect input search compon gener topic report report gener search resourc compil result issu specif queri entiti handl submit queri applic server base java servlet turn call harvest broker broker turn search engin wu handl complex advanc text retriev queri effici figur retriev servic index search engin harvest broker result figur web custom topic collect index gener advanc search form search item topic report custom person prefer suppli topic interest user inform person index articl user prefer store autonom repositori load time user visit web site protocol commun broker repres figur broker accept multipl type command depend environ type admin bulk user admin environ environ specifi administr command start stop broker bulk environ environ transfer object gather broker user environ user environ accept search command queri paramet custom defin case word boundari paramet control result maximum number object displai match line paramet addit restrict object retriev queri web interfac user prefer topic collect index gener chapter design implement client request harvest broker interfac version broker version object end return harvest broker figur protocol commun harvest broker queri issu specif messag format broker return match result set result code identifi data harvest broker return result set list object data item identifi result code complet list messag code descript user environ present tabl code structur result set provid specif data match object term found case descript url specif attribut match object broker suppli messag code time format messag format harvest broker protocol illustr figur implement web applic server main behavior respond user submit produc topic report protocol obtain result set inform format user present differ result format present appli document templat list object return broker request user identif enter web site appli person prefer profil custom report design implement summari xxx request figur messag format queri specif result set queri issu custom broker result code identifi match object aggreg data attribut messag number descript messag user signal end result error messag user object url match opaqu data line object descript local summari url object local broker url homepag object attribut signal object end harvest broker version tabl set messag result set design implement summari implement softwar system integr project includ harvest inform discoveri access thesauru svm light classif chapter design implement harvest system extend addit index queue support retriev system modul ad defin collect url interest content classif activ thesauru languag enabl document vector svm light implement support vector machin theori make classif compon custom easi access case multipl model defin theme harvest broker search engin implement articl data store file format implement advanc web search interfac harvest broker search engin retriev document topic index user prefer build person report chapter vi result evalu test repres group web site chapter present result gather oper electron public discuss scalabl issu gather queri effici evalu observ classif accuraci result chapter vi result evalu gather activ measur perform oper develop prototyp continu grow corpu inform gather group web site repres electron public portug show select select public period de de de daili weekli weekli daili daili daili tabl onlin public test test present chapter obtain run dell comput pentium processor intern mb scsi hard drive redhat linux oper system hour summar classifi select public public gather sequenc avoid resourc exhaust happen gather activ start time process public gather depend directli internet condit connect machin host test experienc limit bandwidth public web affect perform tabl present averag number document retriev web site averag time spent gather sampl iter result present depend restrict present machin host gather agent broker optim oper environ compon separ machin limit gather activ distribut gather agent public separ processor public time retriev current edit time retriev entir web site content number document edit document dn dai total tabl number document retriev edit public averag time complet gather activ valu obtain low network traffic hour optim gather configur retriev document prove effect comput time wast past edit irrelev inform publish daili basi figur compar throughput scan measur document effici public bandwidth de approxim document result present total classif storag gather articl figur activ stage compar scan time harvest estim time requir classifi averag repres overhead introduc gather activ origin harvest system chapter vi result evalu document dn jn figur analysi public bandwidth bandwidth limit attend text retriev gather activ retriev document classifi document store document figur decomposit task perform articl process gather agent request articl obtain complet articl classif articl store tt repres time fulli process articl figur compar size articl time classif sampl approxim articl dai estim averag size text time classifi articl averag articl text classifi figur show durat classif activ relat document size observ effect vector format reflect write style text small repeat vocabulari vector format gather activ smaller text richer vocabulari text smaller vector format classifi smaller amount time aspect influenc scalabl storag gather index observ week regist import size index maintain broker size tabl summar storag approxim document dai time size figur time spent classif function articl size averag text size classifi articl document daili averag document size size corpu size index corpu doc kb mb mb tabl storag statist dai activ estim approxim gb corpu storag accommod select public year accept storag densiti cost current technolog number public expect web chapter vi result evalu averag document accommod articl text classif inform complementari inform act repositori longer origin web site index essenti data structur size grow corpu observ grow slower corpu index inform illustr anticip structur hold index creat document simpli assign refer term index discuss effici queri submit gather inform corpu size time corpu size index size figur corpu size evolut time index grow corpu size relat total corpu size index size time queri effici estim effici base time process queri time match result receiv time match result receiv figur queri effici submit queri perform search oper send result tt figur decomposit oper perform process queri user submit queri receiv process start send result user receiv match result result arriv set bench ten keyword built special softwar probe measur client local oper environ correspond delai network keyword test pick repres corpu complet list present tabl keyword descript lisboa frequent keyword corpu frequent keyword recent articl time frequent keyword intern collect frequent keyword recent articl time frequent keyword polit collect universidad frequent keyword educ gene frequent keyword scienc internet frequent word comput collect frequent word busi collect frequent word cultur collect tabl list word queri articl test effici figur show averag time queri submiss limit result set item minim inform return broker time obtain approxim document test made normal queri submit interv resourc fulli process chapter vi result evalu averag process send match result set client observ small differ set queri result similar queri queri approxim averag time queri approxim complet dispatch result set except queri quicker result set limit match document load situat test experienc load situat intend exhaust hardwar resourc observ behavior situat situat queri result present figur show simultan queri directli time process interest observ provid standard deviat time standard deviat heavier load situat valu obtain condit previou situat internet gene universidad queri lisboa time result result figur time queri time similar queri normal queri process queri approxim queri effici time queri averag standard deviat figur time queri load situat simultan time load perform observ measur degrad time grow chose situat vari size document present figur show scale size inform corpu slight degrad perform evalu core activ classif articl time number articl collect averag figur time queri load situat size slight degrad number articl collect load situat chapter vi result evalu classif accuraci measur accuraci test collect articl collect repres sampl articl gather dai reflect inform corpu scan web site randomli chose articl public manual classifi categori evalu classifi articl categori case multipl classif figur present distribut articl categori test collect comput internet scienc environ cultur societi polit media sport local educ busi econom figur contribut categori collect exampl calcul classif accuraci societi local common collect repres categori contribut articl remain articl defin categori gather document relev text pictur tabl content commonli guid user public piec articl multipl categori compar classif accuraci option select text present word found document retriev web site exclud html tag comput heurist detect core ignor addit header navig inform commonli found web public classif accuraci evalu calcul formula tabl descript repres formula descript classif accept classif highest posit score correct classif ignor classif classif consid highest posit classif score categori match manual assign classif automat classif consid correct penalti classif match manual assign categori classif highest posit score consid toc articl ignor misclassif appli url repres text tabl consid correct classif obtain formula null classif ignor null classif posit classif score issu classifi consid correct classif obtain formula combin previou formula reflect pure misclassif tabl formula calcul classif accuraci figur present classif accuraci valu obtain defin formula option highest classif accuraci approxim multipl accuraci rise remov tabl content articl null accuraci improv approxim combin estim articl misclassifi option filter text classif accuraci improv significantli limit number exampl remain articl classifi heurist declin articl small number word text small group word fit class document relev pictur tabl content figur present accuraci result achiev chapter vi result evalu accuraci classif classif classif toc articl null classif figur classif accuraci option accuraci formula formula repres achiev accuraci option pass classifi accuraci classif classif classif toc articl null classif figur classif accuraci accuraci formula formula repres estim accuraci classif accuraci highest posit classif accuraci improv approxim multipl accuraci improv articl inform accuraci classif slightli improv accuraci improv remov null classif approxim combin restrict estim averag misclassif figur compar option process articl classif multipl classif account biggest improv approach observ gener filter improv classif significantli themat cover filter reduc classif score remov strong weight featur found navig bar header accuraci affect case classif accuraci accuraci formula figur comparison classif accuraci option multipl classif measur number multipl categori assign set articl classifi figur illustr distribut chapter vi result evalu categori categori categori categori null classif figur number posit classif score option number singl classif express posit classif score found articl remain classifi categori articl posit classif repres total articl analyz behavior classifi obtain categori highest number multipl posit classif origin misclassif figur detail distribut sc scienc env comput internet cu cultur sp sport bu busi ec ed educ intern polit lo local media po polit societi number articl sc cu sp bu ed lo po number articl correct classif total number classif categori figur comparison number correct classif total number classif classif accuraci categori local societi hold highest number multipl classif typic articl refer region classifi topic societi broad explain high number multipl classif specif sport number articl multipl classif minim reliabl categori minimum error classif activ classif occur busi societi categori contribut approxim misclassif analyz effect multipl classif appli tradit measur inform recal chapter ii detail review situat estim recal number correct classif number articl categori number correct classif recal number posit score figur present recal valu categori categori due limit number exampl test set present addit articl classifi yield recal region societi scienc present low level recal sport categori present highest recal extra classif sport occur test set categori sc scienc env comput internet cu cultur sp sport bu busi ec ed educ intern polit lo local media po polit societi sc cu sp bu ed lo po categori recal figur recal valu categori chapter vi result evalu classif score figur present chart classif score obtain busi sport complet analysi categori refer appendix group classif score categori level interv ad curv cumul percentag exampl classif score absolut reflect confid level return classifi repres distanc actual document boundari defin support vector machin analysi understand distribut classif score identifi confid level classifi categori educ small number prematur state threshold categori measur evalu classifi perform detect defici tabl summar valu obtain limit set categori observ classif score threshold test exampl reach identifi misclassif societi present lowest score valu suggest improv train collect requir categori exampl classifi exampl classifi polit intern polit societi local cultur busi econom sport comput internet tabl classif score categori percentag exampl classifi societi busi classif score low classif accuraci number exampl number exampl sport classif score busi econom classif score figur analysi distribut classif score obtain classifi sport busi graph show classifi produc high score exampl classifi score illustr classifi difficulti produc high classif score exampl classifi score figur present graph illustr distribut categori closest origin societi busi comput sport graph origin cumul percentag cumul percentag chapter vi result evalu sp po polit intern bu societi lo local cu cultur bu busi sp sport comput internet po cu lo percentag exampl figur graph illustr distribut top classif score exampl categori lowest score societi busi classifi accuraci time observ classifi accuraci behav time distanc date articl train set evalu articl measur train classifi articl month classifi articl publish month year observ evolut averag classif score posit classif figur degrad classif score obtain linear regress averag behavior notori classif accuraci classif score posit classif jan mar apr jun jul aug cultur sport busi polit averag tendenc figur classif score posit exampl creat obtain classifi train articl written januari notori evidenc result tendenc line classifi accuraci cycl track season event behavior appar dynam categori sport polit static domain cultur classifi accuraci time stabl experi suggest uniformli distribut articl larg period time train set rebuilt classifi strategi submit test exampl previou experi version observ behavior illustr figur trend degrad classifi displai stabl averag classif score set categori interest point notic absolut classif score show indic train set induc higher level accuraci chapter vi result evalu classif score posit classif jan mar apr jun jul aug cultur sport busi polit averag tendenc figur classif score posit exampl obtain classifi train articl sampl month year result evalu summari chapter present result oper evalu effici scalabl prove scalabl solut accept storag support archiv inform publish short period time web classif accuraci achiev categori obtain import improv filter inform web clean commonli found web content observ classif accuraci directli depend season event evalu behavior classifi analysi distribut classif score posit classif analysi show defici suggest review exampl select train set contribut significantli improv accuraci chapter vii futur work futur work dissert discuss automat gather classif web present implement evalu system manag onlin inform kei concept ir inform evalu effici present repres model ir system develop valid theori review kei inform classif concept statist learn techniqu compar effici classif activ support vector recent research effect learn accuraci time spend train classif result techniqu classif inform retriev techniqu import tool internet briefli present ir techniqu digit publish environ import digit newspap portug term avail person search engin archiv facil web resourc dedic search engin give access archiv natur power special search tool archiv facil environ requir support preserv attempt develop search engin web address limit architectur main retriev classif portal gener compon make flexibl modular exist singl inform mediat dedic web site mainten oper ad public rule express restrict public url collect kei featur enabl index content attribut ensur scalabl volum inform publish dai web site futur work perform classif train data classif assum vital import accuraci train strategi maximum number featur articl wide tempor rang underli natur season minim import featur avail filter version articl found web filter oper ignor style common format provid stronger remov topic report custom access power search interfac prove scalabl solut accept storag support archiv inform publish short period time web achiev classif accuraci approxim main work oper improv search retriev oper journalist public editor ordinari web user specif web collect futur work implement similar detector finish framework classif detect similar articl gener encourag result subject extens user evalu test valid result present classif accuraci domain subject environ import evalu fulfil inform extens develop introduct direct implicit relev feedback interest extens bucklei import valid correct search oper result real time improv accuraci futur work appendix search engin internet type search engin index search subject special search engin topic collect final metasearch engin appendix discuss behavior coverag type appendix search engin internet search engin index engin act crawl internet site collect web page provid search capabl web page search perform match keyword word page select subject directori provid demand term size search engin web fit descript list number search engin provid tabl tabl present descript select set search base survei librari inktomi row tabl refer search engin tradit definit web search engin appli inktomi search engin gener web search engin clear inktomi partner search provid search return ident result inktomi backbon search engin user visit inktomi web site find typic web search engin interfac user find compani homepag search engin www address altavista aol excit fast search hotbot infoseek lyco msn light snap tabl list common web search engin search engin search engin typic web user difficulti pick analysi multipl estim perform effect search engin make maintain web site search engin perform data measur system suffer inaccuraci due daili search larg set measur classif process search engin descript result rank total size estim gener web good rank innov approach base page popular measur link page match base version document altavista gener web advanc search capabl boolean oper rank result web search engin provid translat term queri northern light integr huge web full text recent articl articl busi sourc small fee search method combin search subject categori keyword search specif journal titl automat fuzzi method weight result search term left document sort date infoseek featur easi excel content page site make smaller size automat fuzzi method document sort date gener web largest fastest search engin date excel rank option refin search result automat fuzzi method million million million million million tabl descript select web search engin librari appendix search engin internet subject directori subject directori combin directori classifi web resourc organ predefin categori retriev capabl tabl present select list special qualifi web search engin provid featur share basic site pick carefulli organ hierarch subject categori annot content descript perform navig subject categori search gener term document engin search subject categori descript search engin descript estim size index compil public librarian inform suppli busi highest qualiti site good annot document compil academ librarian document rank editor document scarc descript annot biggest famou directori topic keyword select categori million document galaxi good annot document tabl descript select subject directori engin special search engin special search engin specif search engin special document collect common provid gener relev specif queri limit coverag awar avail inform user directli special search engin forc check gener search engin subject directori engin count number search engin web categori search engin internet section count catalogu search engin gener engin domain specif search includ search engin hundr site hack crack metasearch engin avail search engin lead problem user awar exist search engin familiar inform design retriev difficulti empir result singl search engin return relev result etzioni work search engin difficult task experienc user metasearch engin design deal problem provid interfac automat access multipl convent search ad addit level abstract web search present design metasearch system result usag evalu metasearch system eventu savvysearch servic power wide search engin select relev search engin base user queri term submit user queri search engin system interpret result displai uniform format unlik regular search metasearch engin directli access corpu web search engin appendix search engin internet typic architectur metasearch engin present figur compon interfac agent displai mechan dispatch determin search engin select user queri interfac agent manag interact search engin agent adapt queri format target search engin interpret result format queri displai mechan integr set result format present user result rank interleav mechan purg duplic result altavista agent user interfac dispatch lyco agent queri displai result interfac agent agent figur architectur design metasearch engin main compon set agent perform queri search displai mechan metasearch engin repres good approach quick discoveri relev web resourc inform search engin present low overlap disadvantag system metasearch engin spend short time retriev result queri problem search term simpli pass queri word complex lost make search engin support logic metasearch engin metasearch engin tool tabl summar characterist select group metasearch engin web metasearch engin search tool queri web search result format dogpil altavista dogpil open directori infoseek lyco lyco top sequenti list hit tool queri sort rank search tool duplic occur search servic infer find altavista excit search infoseek lyco webcrawl sort cluster word phrase found result duplic elimin metacrawl altavista excit infoseek looksmart lyco webcrawl consolid result larg rank score deriv rank search engin normal confid score sum rank tabl descript select web metasearch engin altavista infoseek result sort categori keyword queri sort group chosen user work normal search engin behavior stanford internet metasearch consist protocol search retriev internet start group effort digit librari involv compani includ major top web search engin goal start facilit main task metasearch engin sourc evalu evalu queri resourc merg queri result protocol intend commun human exist write queri defin queri languag appendix search engin internet appendix distribut classif score obtain classifi appendix distribut classif score obtain classifi polit number exampl polit classif score figur distribut analysi classif score obtain classifi polit intern polit number exampl intern polit classif score figur distribut analysi classif score obtain classifi intern polit cumul percentag cumul percentag societi societi number exampl societi classif score figur distribut analysi classif score obtain classifi societi local number exampl local classif score figur distribut analysi classif score obtain classifi local cumul percentag cumul percentag appendix distribut classif score obtain classifi media number exampl media classif score figur distribut analysi classif score obtain classifi media educ number exampl educ classif score figur distribut analysi classif score obtain classifi educ scienc environ scienc environ number exampl scienc environ classif score figur distribut analysi classif score obtain classifi scienc environ cultur number exampl cultur classif score figur distribut analysi classif score obtain classifi cultur cumul percentag appendix distribut classif score obtain classifi busi econom number exampl busi econom classif score figur distribut analysi classif score obtain classifi busi econom sport number exampl sport classif score figur distribut analysi classif score obtain classifi sport cumul percentag cumul percentag comput internet comput internet number exampl comput internet classif score figur distribut analysi classif score obtain classifi comput internet cumul percentag appendix distribut classif score obtain classifi refer manual onlin altavista system construct mediat internet sourc acm confer manag data altavista tm search intranet softwar product descript version altavista compani tool suit har web data intern workshop web inform filter inform side commun page nearest neighbor nn pattern classif techniqu comput scienc seri ieee comput societi press berkelei librari recommend search subject directori metasearch engin berkelei librari nielsen world wide web commun page harvest inform discoveri access system intern www page customiz discoveri access system internet engin task forc tutori support vector machin pattern recognit data mine knowledg page byte trec tipster experi inqueri inform process page bayesian approach learn bayesian network local structur thirteenth confer uncertainti artifici intellig cranfield test index languag devic page network machin page jr extend warwick metadata activ digit object novemb refer semant road map literatur searcher journal associ comput page experi select search engin metasearch acm transact inform page dublin core dublin simpl descript model electron resourc induct learn algorithm text categor page el pai mendelzon techniqu wide survei sigmod record program taxonomi autonom agent intern workshop agent architectur languag softwar agent commun usabl center www user survei stanford internet acm confer manag data trec confer hypertext inform retriev page konstanz harvest manual technic report colorado learn bayesian combin knowledg statist data machin page mobil agent digit battlefield intern confer autonom page framework support data integr materi virtual approach acm confer manag page manag semant heterogen theoret perspect acm sigact sigmod sigart symposium principl system page infoseek text categor support vector learn relev featur european confer machin learn make svm learn practic advanc kernel method support vector burg smola read inform retriev morgan kaufman download site inform storag retriev john wilei son access distribut inform web page le mond acm transact inform special issu text categor refer capabl base mediat tsimmi acm confer manag data librari congress marc standard inform retriev standard part strateg view present futur april tool search entir file system usenix winter page architectur inform retriev onlin technic report departamento de de da universidad de lisboa inform preserv ariadn sixth delo workshop ariadn digit librari architectur european confer digit librari page make studi metadata creation mix collect acm digit page microsoft activ server page machin learn inform retriev view tempor signal intern confer massachusett american mathemat page programm intellig agent commun northernlight search engin guid web search face inktomi page search current page softwar overview knowledg engin probabilist reason intellig network plausibl infer morgan kaufmann induct tree machin learn reuter probabl rank principl ir journal document pp custom inform captur access acm transact inform page artifici intellig modern approach hall learn limit depend bayesian classifi intern confer knowledg discoveri data page automat inform organ retriev vector space model automat index commun page introduct modern inform retriev smart retriev page refer improv retriev perform relev feedback journal american societi inform page automat text retriev inform comput pennsylvania select text util text acm hypertext page automat theme summar text page savvysearch search comparison metacrawl intern world wide web confer sort interfac framework text search commun page evalu infer network base retriev model acm transact inform natur statist learn veriti mediat architectur futur inform system ieee page evalu statist approach text categor technic report carnegi mellon text categor method confer page
ML/881 6 intern confer qualiti robot learn reactiv robot behavior institut informat girona campu spain abstract paper approach design onlin learn simpl reactiv robot behavior gener neural network continu state action algorithm recent learn sampl converg function repres reactiv adapt behavior map sensori state robot control action group behavior constitut reactiv control scheme design fulfil simpl mission paper center descript base behavior show perform autonom underwat vehicl target mission simul experi demonstr converg stabil learn point suitabl onlin robot learn advantag limit discuss robot reinforc autonom underwat vehicl introduct commonli methodolog robot learn reinforc learn agent maxim scalar evalu interact environ goal rl system find optim polici map state environ action turn maxim accumul futur reward rl techniqu base finit markov process finit state action space main advantag rl knowledg form machin make class learn suitabl onlin robot learn main disadvantag longer converg time lack gener continu variabl activ research topic rl paper kind rl design onlin learn simpl reactiv robot behavior approach differenti implement nn directli break problem finit set featur cluster direct simplest gener nn impli learn capabl instabl learn optim map avoid algorithm introduc recent repres learn sampl space sampl repeatedli nn weight updat assur converg nn optim algorithm conceiv learn intern intern confer qualiti robot map reactiv behavior combin high level control scheme design achiev simpl mission autonom robot behavior coordin hybrid coordin tune phase paper demonstr feasibl algorithm simul experi underwat robot figur target mission figur target obstacl learnt result obtain show converg behavior optim achiev mission structur paper section descript control scheme present section introduc approach behavior learn section simul experi detail discuss futur work present section control scheme set simpl behavior coordin constitut control scheme prioriti determin behavior independ goal accomplish perceiv state environ control action coordin charg final behavior action main coordin methodolog found competit coordin singl behavior select cooper coordin behavior hybrid coordin competit cooper methodolog gener structur shown figur coordin base normal behavior output output vector repres veloc behavior activ level level control robot figur hybrid coordin system implement set hierarch hybrid figur node input gener merg normal control input domin behavior suppress behavior complet activ domin behavior partial activ final combin input basic idea optim path cooper predomin behavior complet activ behavior modifi domin behavior slightli complet activ situat cooper behavior robust present deal critic situat hybrid node tune phase coordin set behavior defin classifi behavior depend prioriti sensor intern confer qualiti robot hybrid coordin control action figur architectur hybrid coordin system xi ni domin base behavior ad ad ad ad figur normal output behavior equat hierarch hybrid node approach learn map state action space state space sensor inform perceiv robot behavior order accomplish goal action space veloc robot follow tempor differ initi arbitrarili design solv reinforc learn problem current state tempor differ algorithm solv action maxim ˆ carri action world transit probabl appli random action probabl state finit markov problem short term reward state dynam ˆ ˆ robot environ γ max ˆ ˆ tempor differ method figur algorithm suitabl learn onlin robot learn import onlin learn resid possibl execut behavior previou phase manual collect offlin import characterist algorithm optim map learnt independ polici perceiv state action receiv reinforc updat valu denot pair continu valu converg greedi maximum state point optim action figur show algorithm neural work continu state usual tabl larg requir resolut tabular long learn time memori requir make implement algorithm control architectur impract neural network gener state action intern confer qualiti robot reduc number valu store tabl set nn weight implement nn backpropag algorithm direct direct algorithm converg proof prove unstabl learn behavior instabl lack weight updat space solv limit base behavior maintain recent learn sampl sampl iter updat weight nn assur gener visit space local gener current visit space learn sampl initi state action state reward rt action coordin control system feedback state reinforc function action maxq backpropag learn gener control action figur order prevent huge learn sampl substitut sampl closer threshold distanc sampl geometr comput vector import maintain recent sampl current dynam environ structur phase neural algorithm shown figur approxim nn ˆ max ˆ γ input continu state output output error found weight updat standard backpropag algorithm layer nn hyperbol tangent activ function layer weight initi randomli find action maxim network evalu action appli action finit suffici reinforc function reinforc function determin polici learnt behavior definit function requir knowledg human design function associ state reward reduc valu associ desir state undesir algorithm learn act phase phase phase phase unit delai max action max max learn reward sampl updat comput nn weight updat action select figur neural algorithm intern confer qualiti robot kind robot work autonom underwat vehicl call uri applic consist target mean camera avoid obstacl set sonar sensor applic design carri swim pool light absorpt appli figur design built girona accomplish mission architectur behavior design behavior input sensor gener vector defin figur show schema architectur behavior obstacl avoid goal avoid obstacl perceiv mean sonar figur behavior learnt algorithm dof reinforc function neg reward depend distanc obstacl detect target behavior target video camera point figur track board base chromat characterist rel posit target behavior learnt algorithm dof reinforc function neg reward target move posit target recoveri goal behavior recov target disappear camera view track system lose behavior spin move vehicl vertic direct behavior learn preprogram simul environ develop order realist experi figur simul model vehicl identifi delai sensor actuat move target introduc carri close path repeatedli veloc target chang maximum veloc behavior implement neural algorithm freedom implement independ reward behavior learnt influenc number iter requir learn dof approxim figur show evolut dof behavior train algorithm explor action space learn track target fl sonar beam figur schema architectur figur sonar transduc video camera layout β fr α α camera view sonar paramet α camera paramet intern confer qualiti robot dof behavior complet mission test figur show track error evolut mission vehicl close obstacl avoid behavior partial control track error hybrid coordin system gener cooper target lost figur learn evolut behavior futur work base behavior present simul result show feasibl hybrid approach converg learn algorithm approach prove suitabl learn behavior reactiv control scheme neural network gener map optim polici short time present dof learnt independ realiz real experi improv behavior order learn simultan behavior refer figur run simul figur track error evolut mission robot mit reinforc learn function machin twelfth intern san coordin reinforc behavior usa continu state action australian joint confer artifici neural foundat prentic reinforc introduct mit watkin machin
Agents/882 1 flexibl time pressur noh piotr gmytrasiewicz depart comput scienc engin texa arlington tx box abstract perform ration autonom agent comput resourc agent present demand sever investig wai agent knowledg result delib compil reduc complex procedur save time urgent situat machin learn algorithm compil rule coordin environ learn endow agent tapestri make rang pure reactiv fulli delib agent select method depend time constraint situat combin reactiv method serv stage accur slower delib valid framework result simul coordin experi show compil result save time offer good perform domain introduct desir autonom oper uncertainti complex make optim action execut ration circumst paradigm expect util costli russel russel zilberstein addit complex present environ agent make ration action possibl complex fulli state intent action agent demand lead failur decid action time constraint cope time constraint situat complex uncertain endow agent tapestri strictli reactiv pure delib reactiv procedur construct compil delib reason rule compil process exploit regular reason avoid costli urgent situat rule obtain machin learn result comput perform offlin compil method assign perform measur compar benchmark compil combin delib constitut spectrum approach make constraint comput time pressur method agent number factor mechan situat hand kei factor includ qualiti provid method run urgenc situat hand situat agent afford luxuri reason result highest qualiti choic made situat agent save time crude fast reactiv tool situat agent method sophist necessarili optim spectrum pure reactiv fulli delib tool span combin varieti method agent fast reactiv rule stage narrow set viabl altern altern pass delib method agent detail knowledg comput expect util action develop suit procedur agent oper measur perform run time domain autom agent decid coordin attempt intercept multipl incom threat lesson learn domain gener domain background relat work prior work delib method includ model method gmytrasiewicz noh implement version agent comput action agent state knowledg capabl task coordin agent simul figur scenario domain figur perform agent compar human perform figur present result term averag total damag suffer coordin team show perform team experi team case commun commun perform achiev team team perform slightli perform strategi team team human team figur perform human team procedur consid combin agent altern complex worst exponenti number agent present complex multiag situat figur run time grow hour current implement lisp run clear supplement method complex scenario figur complex scenario present work build bodi relat search fox al fox theoret framework symbol reason reactiv procedur rigor effort make system tractabl includ work metareason procedur control infer horvitz anytim algorithm dean russel zilberstein approach bratman bratman describ agent architectur includ reason reason agent intent involv execut plan constrain process rao al rao explor applic reactiv delib behavior provid bdi manag system ephrati collabor ephrati appli filter strategi tileworld system filter accomplish rule provid system guid agent role alloc repres learn result agent ration sampl scenario obtain delib method filter strategi accumul agent knowledg effect limit urgent situat section paper compil process explor regular delib show autonom agent compil perform metric time constraint valid framework discuss result summar result research issu formal compil filter reduc complex time make time constrain compil result delib set reactiv rule numer machin learn algorithm autonom agent compil knowledg elimin delib constrain number altern action consid exclud suboptim adapt delib agent consist compil delib procedur agent bound ration emerg combin usag set set action agent set world state agent discrimin action defin abstract world state includ paramet relev action action pick block abstract specifi locat paramet block set compil method agent emploi learn method compil decisionmak procedur adapt delib agent implement function ae fy repres action recommend state machin learn algorithm compil model function ae gener train exampl learn algorithm delib reason perform flexibl ada procedur combin depend circumst hand agent make delib ration maxim expect util agent decisionmak bound comput time adapt delib set compil rule remov reduc cost strategi repres agent filter criterion ffi ffi set plausibl action agent situat filter criterion ffi result appli rule function ae current state obtain plausibl altern ffi fa fa situat set plausibl agent maxim expect util arg max appli formal agent make coordin domain action domain specif consist number attack label figur number defend label mission unit attempt intercept attack target minim damag defend ground area note situat make coordin batteri attempt intercept due wast due likelihood remain threat reach destin damag proport size expect benefit shoot threat quantifi product size left top corner screen point point missil posit batteri posit ia ib figur simpl scenario threat intercept probabl intercept probabl ij depend angl ij target js direct motion batteri line distanc ij batteri speed target ij ij ij constant figur combin benefit shoot threat shoot threat amount enter payoff top figur payoff matrix row repres altern action shoot shoot column repres altern action figur model structur make actual behavior depend number factor uncertain cooper alloc air unit calcul probabl kill evalu target surviv depend characterist intercept probabl probabl base heurist factor hit launch situat repres payoff matrix run unabl attack target attempt shoot target attempt shoot target fulli oper oper depict level model figur case model method dynam program noh process model structur figur determin ration choic coordin action comput fulli oper probabl distribut action shoot target probabl distribut action intercept target probabl distribut combin model result distribut expect remain uncertainti propag result level combin probabl distribut describ action comput expect util altern action uncertainti ration coordin choic intercept target compil delib construct compil rule agent coordin machin learn clark foil input data learn implement domain common lisp top mice simul linux implement simpl bayesian classifi algorithm obtain model method bayesian result repres rule probabl occurr attribut class clark case call select target select target repres output output order set rule train result foil relat attribut horn describ agent compil knowledg learn compar capabl environ learn rule experi consid agent vari limit knowledg agent decid behavior execut base sensori input limit inform agent attribut situat agent environ summar tabl includ speed angl attack agent intercept capabl possess unabl probabl capabl agent agent possess unabl experi valu attribut randomli gener rang valu tabl describ relev attribut target attribut type target size numer target speed nomin fast target angl numer distanc numer capac nomin incap numer long numer short numer incap numer base attribut tabl target agent consid intercept classifi dont select tree obtain attribut depict figur tabl describ paramet agent gener set agent requir addit set probabl paramet angl capac size distanc distanc select select long short distanc figur tree obtain experi perform result evalu qualiti rule set gener learn algorithm perform obtain express term total expect damag friendli forc launch total expect damag defin sum residu size attack target target aim contribut intercept total damag target contribut size damag find size train set sound learn gener set train exampl number exampl result perform improv drastic perform improv scenario includ batteri target suffici number train instanc found exampl compil rule obtain learn test perform method set case result perform runtim tabl tabl perform runtim algorithm unit target set method time delib reactiv foil anova analyz perform result tabl standard analysi varianc method comput anova exce team equal effect level differ perform due chanc probabl pure delib procedur show perform bayesian classifi comput probabl enabl agent select target highest probabl class target intercept bayesian classifi show reason perform runtim pure reactiv uniqu decid target sensori input valu attribut similar agent ambigu target intercept appli randomli select target agent perform foil runtim requir longest shortest runtim procedur anova reveal differ run time due chanc probabl make agent compar current sensori input rule classifi learn result obtain foil repres sequenti comparison tree due differ foil longer run advantag tree reduc number match disregard node tree unrel input measur effici adapt delib agent architectur reactiv rule filter altern consid delib experi set depict figur batteri target agent implement experi model closest neighbor coordin reduc time shown tabl classifi perform reactiv rule filter criteria ada agent train data learn gener consist dont select target select target class result perform runtim set tabl tabl perform runtim algorithm set method time tabl present averag total expect damag trial focu perform rule filter altern perform agent perform agent agent runtim adapt delib agent drastic reduc size set filter plausibl altern action target bayesian classifi total runtim agent agent target select simul environ result combin reactiv delib procedur save agent time offer good compar pure delib procedur reactiv perform bayesian classifi includ addit probabilist inform batteri control randomli select target filter perform worst investig set rule set achiev compil reason implement method learn algorithm found compil rule reduc complex run time complex scenario approach enabl adapt delib agent reach reason time period experi domain assess qualiti flexibl procedur overhead loss time result addit damag combin reactiv delib method avoid catastroph provid futur autonom agent decid coordin action fashion horvitz dean framework provid ration action uncertain deadlin calcul comput repres tradeoff cost benefit comput acknowledg grate dr lawrenc holder anonym provid comment relat work research sponsor offic naval research artifici intellig program contract nation scienc foundat career award refer bratman pollack plan practic reason journal comput quinlan effici induct logic program sigart januari clark clark niblett induct algorithm machin learn dean dean boddi analysi plan nation confer artifici page st august edmund thoma montgomeri flexibl testb intellig coordin experi distribut ai page septemb ephrati ur deriv coordin filter strategi intern joint confer artifici page august fox fox symbol theori autonom system confer uncertainti artifici page juli gmytrasiewicz bayesian updat agent model intern journal user model gmytrasiewicz reason agent intellig agent agent page springer horvitz heckerman reflect action scarc theoret principl theoret studi intern joint confer artifici page august horvitz reason vari uncertain resourc constraint nation confer artifici page st august air system analysi artech noh noh gmytrasiewicz agent model intern confer user page june noh noh gmytrasiewicz ration commun behavior intern confer multi agent page juli quinlan program machin learn morgan kaufmann rao rao georgeff bdi theori practic intern confer multiag page juli russel russel subramanian provabl agent journal artifici intellig russel russel wefald principl metareason artifici russel execut architectur compil intern joint confer artifici page august zilberstein zilberstein russel optim composit system artifici zilberstein model bound ration aaai fall symposium ration novemb
IR/883 5 relev feedback queri search model search digit librari alan smeaton franci school comput applic dublin citi dublin ireland fulli oper larg scale digit librari base distribut architectur number independ search engin index overlap portion entir content librari index retriev search engin techniqu provid coher unifi search suit underli independ search engin import part navig digit librari paper present architectur system search world largest world wide web make system suit underli web search engin bulk work system orchestr parallel fashion provid higher level inform retriev function meta search engin underli direct search engin provid relev feedback queri option user paper present design architectur system describ initi version oper outlin oper advanc version inform retriev digit librari push develop multimedia inform develop technolog work present deliveri order make effect kind electron found digit librari manipul inform content crucial compon inform retriev kei technolog develop dl develop inform retriev techniqu decad precipit system develop distribut ir system wai area inform place minor impact field world wide web largest distribut collect search vast major user ir index fulli oper larg scale dl base distribut architectur number independ search engin index overlap portion entir content librari media index retriev index techniqu search engin kind retriev navig techniqu provid coher unifi search suit underli independ search engin import part navig digit librari inform retriev techniqu relev feedback queri provid improv retriev effect straightforward keyword weight match implement techniqu suit underli search engin desir user point view individu search engin remain straightforward deliv advanc search option user approach paradigm search digit librari import dl paper present techniqu design implement search www base broadcast user search number convent search engin combin result rank list search www ir techniqu nobl task model kind ir system outlin exist number search engin provid straightforward keyword weight term match overlap portion entir web approach retriev effect meta search engin concept system web section paper user feed back system url relev queri inform gener rank list search term user add system add gener approach search web examin section meta search engin web search present section algorithm deliv inform retriev techniqu architectur section includ user interfac section report statu implement section give analysi approach final section present plan extend work final search world wide web world wide web launch year group effect access inform web provid user follow hypertext link attempt maintain classif directori web content led develop system function constantli seek page updat page discov recent updat page download index page local index file local index made internet commun search web crawl program provid sourc input document index user queri search engin lyco return pointer origin document remot www server growth web number search engin join lyco respect attempt index entir www addit includ infoseek search engin thing common includ poor support concept search user system practic search system inform tend shift evolv requir result natur evolut document queri feel aspect satisfi concentr queri examin content retriev document expand vocabulari domain discov good search posit expand origin queri addit search term add specif weight search term base document queri present convent search engin except altavista inform retriev effect aid inform retriev task van rijsbergen relev feedback concept user judgement relev retriev document rel queri fed back search system system inform improv remaind search inform automat add extra search term assign weight exist search term ir techniqu decad success techniqu publish year ago sparck jone technolog queri relev feedback develop time demonstr improv retriev effect text collect trec global web search engin altavista close queri case base document limit relev judg user similar function search intranet search geograph global web convent web search engin attempt index larg portion web maintain index current gener provid term weight return rank list url effici provid function simpl list word input queri queri order attract custom turn web search engin compet size index portion web claim index emphasi web coverag effect effici search problem larg engin effort deliv web search user easili amount url retriev concentr coverag web search engin develop thing time rapid web growth search engin effect search small portion web attract custom engin deliv search web put burden sift retriev url attract custom web search engin function enhanc advanc ir techniqu incorpor servic url www meta search engin idea ir search engin basi underli sophist elabor search function intellig termin user queri express set keyword implement term weight document rank broadcast numer independ search underli boolean ir system provid ir weight search term document top sophist boolean search engin similar approach search system top develop search web emerg work compar exampl type highwai infer savvysearch system oper essenti queri underli www search engin parallel order answer user queri differ process perform result return www search engin present user highwai metacrawl combin result data fusion techniqu base document score sum score document engin metacrawl offer broken link detect result queri time infer cluster document return search engin group base locat www site metacrawl offer altern rank base score savvysearch larg number underli engin concentr select subset search engin rout user queri differ work servic html form user interfac limit function interact offer user architectur implement java offer improv interact interfac user importantli offer scope develop system incorpor effect relev feedback queri meta search engin mention page basic compil form interfac search tool found web cover number gener divid categori technic report parallel combin result involv simpli redirect browser relev engin queri meta search algorithm architectur retriev system architectur client java applet run user machin server written run sun ultra sparc client lightweight term comput process perform order oper machin emerg network comput architectur term eriksson url url algorithm retriev inform web begin invit user input set keyword search term client applet individu word phrase delimit invert comma user input queri press queri pass back server broadcast parallel web search webcrawl pass user search web search engin request system return top rank url poor overlap observ document list web search engin web search engin webcrawl support direct request top rank url infoseek return url search request break user queri individu queri engin request top url rank url rank lyco interrog retriev maximum url search handl break separ thread top yield total parallel thread request search engin period set perform data fusion oper url list return search engin point data fusion perform server machin base rank posit retriev statu url score search engin return score engin return url score rang consist search engin search engin upper limit url score fuse rank url send back user client applet displai user figur show client applet user input process top url fuse rank search engin displai user select press button web page retriev web displai user www browser search engin return period back server updat url rank gener updat rank period propag back user applet window figur user search retriev initi rank url user select url full url displai statu line show displai result figur view url user mark url retriev list relev shown colour chang relev url applet result list shown view url mark user invok command press button send list url mark relev back server process retriev full web earlier retriev page user displai user machin server cach page return web period discard process text retriev url remov html tag stopword stem remain text porter word stemmer extract list candid search term word stem candid search term origin queri relev score search term rank formula formula rank candid search term queri evalu oper inform retriev system work evalu base close formula rank match choic search term add made user formula rank candid search term chosen user oper set formula success paramet score individu search total number document number document index term size sampl relev document identifi number relev document index term case search web paramet difficult estim part work involv determin formula rank candid search term simplest candid search term rank top score threshold back user applet word stem set word form occurr reduc word stem pane open user applet shown figur figur state applet user mark url relev request origin queri expand work figur system return term rank candid addit queri work term suggest occur relev url form word form term occur word form entri applet read achiev save origin word form occurr web page stem version perform simpl lookup displai question user search inform band song album includ titl word form occur url mark relev user user receiv list candid extra search term select ad queri figur show user select term box add queri press button mark altern user ad suggest term queri addit extra term queri complet user queri system close term queri search engin cycl continu statu preliminari version meta search engin implement architectur combin rank output web search engin incorpor relev feedback queri oper juli system serv ten thousand web search internet commun worldwid technic problem gener custom perform impact web search system server machin support data fusion commun web search engin commun underli web search engin architectur proven valid version user interfac extend meta search engin develop java abstract window toolkit present subject usabl trial analysi includ paper applet displai pc run usabl analysi result interfac earlier minor basic function chang commun server convent web search engin code test data fusion techniqu basic architectur implement test present test queri compon updat system internet commun gener june analysi technolog transfer research product slow inform retriev result search web initi trec speed weight search term demonstr posit effect retriev effect late product recent automat search term weight relev feedback demonstr intellig termin front end term weight de present web search engin develop tool effect search web enorm technic challeng growth rate search engin vendor fulli occupi meant minim function search engin concern lot effort put engin system index high portion web promot web search engin vendor claim web page engin index intranet index creat singl small number ir techniqu relev feedback queri support global web grow find relev inform effect increasingli difficult due sheer web search engin develop ir techniqu start compet function size index novic user ir effect web search engin effect queri techniqu belkin seri experi group ir novic user find document collect version inform retriev system version system conceal vari presenc relev feedback queri question explor paper relev feedback queri function hidden novic user impact effect search perceiv usabl system result show clear benefit make user awar oper user invok manual system perform oper background result give support novic user system opportun determin url invok queri candid search term ad expand queri queri work suggest mechan elabor inform retriev techniqu yield effect top convent search engin implement run fusion server program control search search yield search gener rank list candid search cumbersom sit top convent web search system search engin direct user search part implement write routin html page return search order extract url document rank work show techniqu suggest candid search term incorpor part search servic offer current engin major modif current interact user web search engin lightweight search treat independ interact base program develop search tool java applet search server program made awar stage user search initi supplementari search relev secondari move web search forward consist multipl independ singl search handl user search progress plan number issu remain resolv implement search tool investig rang search term rank formula order determin system intend implement number formula includ simpl number assum url list retriev user visit mark addit introduc concept url interfac extens gear build sampl nonrelev url search term page count neg contribut score search term term rank implement automat select set implement term rank formula user search round robin fashion log search term ad user yield data requir correl search term rank actual search term chosen popul real user search work report yardstick measur user choic search term work point formula handl updat version java server program run machin prepar launch version web search system version oper summer queri issu scaleabl date version search system real impact resourc user search lightweight machin system paper manag multithread search search engin download relev stem gener rank list search user search monitor system huge popular distribut fusion server process multipl server net work report paper shown algorithm incorpor queri search global www vast major system implement extens oper system work show advanc ir techniqu improv retriev develop search web improv techniqu refer yardstick evalu rank algorithm interact queri en inform process system knowledg ieee intellig system fourth text retriev confer dh harman nist special public belkin case studi interact inform retriev behaviour intellig termin implement relev feedback larg oper retriev lectur note comput scienc research develop inform algorithm suffix mf sparck jone weight search se robertson sparck journal van rijsbergen retriev effect queri document retriev af smeaton cj van comput data fusion agent search af smeaton poster present santa april
Agents/884 1 gener state space petri net milan depart comput scienc technolog czech republ abstract articl describ problem area gener exploit state space petri net underli model languag tool call rst explain uenc identi er dynam disappear instanc state space problem describ compar method work identi er base sophist rule mechan abstract discuss approach properti system valid mean state space model introduct current complex distribut applic requir deal dynam disappear object synchron migrat node distribut environ run kind applic includ distribut oper groupwar concurr work peopl applic exploit technolog languag call base petri net develop tu order support prototyp complex distribut softwar system support intuit model kei featur messag synchron achiev work activ object encapsul set process petri net process insid object commun share object commun messag pass simul examin system model support prototyp version tool call model softwar system creat usabl prototyp work implement prolog smalltalk run prototyp distribut start simul articl concentr rst step made exploit formal analysi veri cation method context approach consid complementari simul fulli verifi behaviour partial analysi veri cation reveal error tend di erent found simul easili extract subsystem veri ed abstract environ di erent approach perform formal analysi veri gener explor suitabl repres state space straightforward case method base state space fulli easi implement paper extend slightli modi ed version di erent wai allevi main de state problem method successfulli adapt optim deal state space highli dynam structur show work state space gener formal dynam instanti kind pai care attent treat identi er object gener kind dynam disappear unnecessari state gener state space unnecessarili grow niti problem solv introduc sophist rule assign identi er instanc concret instanc import test state equal applic symmetri reduct method structur model uenc gener state state space tool investig properti relat global state individu dynam disappear instanc time analysi veri cation question refer concret instanc semant import model work identi er di erent state rst present main idea formal subsequ discuss solut problem state space discuss approach analysi veri cation question answer state space kei concept formal enrich concurr polymorph transit messag wait accept creat perform primit comput illustr notat shown figur stack pn return return pop main pn stack synchron port return place class class ascend initi mark messag pattern object net transit action test arc transit guard paramet place method net produc pop st fig method produc consum main principl structur behaviour explain due space limit descript present formal complet explain bit deeper introduct formal found complet de nition structur petri net de ned collect element set constant const variabl net element place pl transit class element object net method net synchron port sy messag selector class object identi er method net instanc identi er mid denot net id oid initi class oid initi object tupl object identi er set bind variabl denot bind fb var ug object net consist place transit place mark transit condit test precondit input postcondit output method net similar object net set paramet place return place method net access place object net order run method modifi state object run synchron port special transit dynam fuse regular transit transit port guard messag send synchron port embodi set postcondit place object set paramet paramet activ port bound constant uni ed variabl de ned level transit port activ class speci ed object net element set method net subset set synchron port subset sy set messag selector subset method net port object net describ data object encapsul activ exhibit method net object asynchron respond receiv messag synchron port remot test chang state object atom inherit mechan increment speci cation class inherit method synchron port rede ned method synchron port ad similar approach appli object net place transit detail descript inherit mechan scope dynam behaviour dynam behaviour correspond evolut system object object class system net instanc instanc object net set run instanc method net net instanc entail identi er id id mark place transit mark place multiset element transit mark set invoc invoc identi er id mid invok net instanc store bind bind input variabl transit state run form mark mark repres multiset mark element order classic petri manipul case transit identi er invok transit mark ect fact transit invok method wait termin execut transit special featur method net instanc store bind special variabl mid formal compat place transit mark achiev de ne mark element tripl consist identi er net instanc belong place element bind mark multiset chang mark mark result occurr event event includ type identi er id id net instanc place transit tr static repres bind tree bind level involv transit synchron port activ transit type event evalu action atom action involv trivial comput object instanti messag instanti termin method net instanc enabl event occur mark mark call step denot initi mark correspond initi mark object net instanc initi class identi ed oid set mark denot ma set event ev set mark reachabl denot introduc notat id denot net net id identi es instanc denot oid oid id identi es net instanc belong object identi ed oid note object identi ed identi er object net instanc role instanc identi er state space discuss problem deal identi er dynam disappear instanc introduc compar method intend minim impact presenc instanc state state space problem point view consid repres formal dynam instanti kind object process problem deal formal dynam common notion state space consist set state set structur transit set semant transit link state structur initi state pai care attent presenc instanc identi er state instanc exist state system uniqu identi ed make refer local state instanc express refer work sort instanc identi form address common run program simul model context state presenc instanc identi er state signi cantli contribut state space problem due possibl unnecessarili gener redund state di er involv instanc uenc futur behaviour system examin denot phenomenon problem state space redund instanc sourc rst due formal support dynam structur stem formal assign identi er newli instanc redund state instanc plai role model system local state refer creat di erent di erent state space path lead creation illustr model exibl manufactur system product cell repres object uniqu distinguish machin encapsul redund state gener object creat identi ed di erent combin possibl ect order independ creat symmetr work instanc sourc state space redund deal instanc identi er symmetri exist level model system manifest model treat instanc symmetr inform save space ignor di erent identi er instanc swap point evolut model system symmetr activ dine philosoph figur call mention symmetri possibl exploit symmetri reduc state space speci formal dynam instanti interest symmetri manifest similar redund pure intern mechan dynam structur solv import note state space signi redund symmetri result diculti assign dynam instanc mechan make state space semant evid system formal suce creat destroi instanc semant point identifi identi er solv problem option context formal support dynam real necess problem solv restrict semant appli model languag examin state space suitabl reduc prefer approach di erent method solv problem di erent context combin method remov sourc state space redund reduc state space rid unnecessari prove lose import wrt properti model system analyz veri ed context import distinguish instanc express ownership manipul event surround state interest concret valu identi er implement mention mechan method solv problem present sophist rule assign identi er newli stanc inspir process identi er handl spin abstract special symmetri method reduc state space method base concret instanc import check state lead work renam class state individu state method discuss context rst de ne full state space order obtain basi discuss reduct mention method add problem solv problem remov unnecessari instanc state systemat remov number concurr exist instanc grow problem manifest stronger gener semant equal state distinguish di erent garbag present appli good solut problem advantag remov unnecessari instanc state case garbag collect mechan solv problem order mechan work suce creat store refer obsolet instanc interest problem import domain dynam structur devot interest formal analysi veri cation run semant petri net introduc solv problem spin problem treat simpl set rule instanc limit maximum number satisfi solut obtain explain short note call problem requir nite domain identi er good symmetri method investig detail recent note canon heap java pathfind model checker similar method full state space full state space de ned gener concept state space mention earlier state correspond reachabl mark structur transit applic event semant transit de ned accord ring rule initi state initi de nition state space petri net set mark initi mark set event ev de ne state space ma ev consequ de nition full state space ignor problem creat rst instanc net domain instanc identi er immedi obtain nite target mark requir set identi er net nite solv problem chang semant model arti cialli restrict number concurr exist instanc gener unnecessarili target mark sophist rule sophist rule assign identi er newli instanc attempt nondetermin potenti present manag dynam disappear instanc reduc number state process rule made part semant model languag appli integr model languag applic view tool reduc state space show lose import inform wrt verifi proof base show applic rule fact implement principl state space discuss simplest nontrivi rule instanc assign identi er order de cienci techniqu cyclic creat destroi obtain nite state space semant equal nite state space obtain recycl identi er immedi identifi newli instanc smallest identi er desir appli recycl identi er garbag collect prevent obsolet instanc unnecessarili remain state semant equal state di erent di erent garbag recycl identi gener di erent state semant equal illustr con gurat instanc number involv trivial mutual relat con gurat instanc creat state space path instanc creat di erent order auxiliari instanc di erent overlap lifetim gener state con gurat instanc di er involv instanc content di erent combin undesir ect histori creation instanc problem gener unnecessari state partial avoid mutual independ sequenc identi er type instanc sequenc achiev make type instanc part instanc identi er creat rst instanc net rst instanc net identi ed undesir ect order instanc mechan identifi instanc produc redund state model enabl di erent order creat instanc frequent similar principl achiev reduct redund area identifi method net instanc assign identi er method net instanc independ transit bind variabl event method net instanc uniqu transit mark element referenc includ transit bind start method di erent sequenc method net instanc identi er disjoint start creat destroi instanc persist chang rest obtain nite semant equal state instanc identi ed give idea gener unnecessari state avoid ad optim previou mention case system distribut philosoph figur obtain state note appli remain redund redund stem mechan assign object class method net instanc start bind transit map symmetri work instanc identi er principl exploit identifi method net instanc gener work object achiev improv sophist sort static analysi object method net reveal object referenc net instanc di erent creat unambigu nest object identi ed local net instanc encapsul isol object creat di erent transit case start method problem gener unnecessari avoid advanc allevi partial order reduct techniqu techniqu reduc number path lead state possibl obtain di erent permut identi er involv characterist instanc problem fulli solv interleav set sophist combin reduct elimin sourc possibl map symmetri symmetr action instanc identi er kind sophist rule similar origin solv problem mention model checker spin spin work dynam instanti process special languag process identi ed integ termin identi er recycl order creation start run process principl easili possibl cyclic instanti process partial overlap method prevent state space grow niti assum appli arti cial limit number run fact process termin identi er recycl order alloc accept context suit work object life independ creator spin separ mechan identifi process di erent type spin appli simpl static method reduct order applic produc larg overhead method avoid redund assign newli process avoid redund work instanc symmetr exchang situat kind concurr symmetr behaviour set philosoph figur system distribut philosoph abstract inform respect previou suggest method solv problem base concret valu instanc import check state de ne mark equal exist suitabl permut set identi er applic make state ident replac work state work renam class note applic ecient remov garbag state remain desir order avoid gener semant equal state distinguish di erent garbag describ method abstract partial formal fulli formal proof found note concept abstract special gener notion symmetri appli reduc state presenc concret instanc state unlik gener highli renam symmetri model fulli autom wai treat gener state space state space special case symmetr reduc state de ne directli save space closer implement add applic symmetri solv problem context state space account special garbag encapsul method net instanc nite number identi er newli instanc idea abstract inform appli due fact behaviour model depend concret valu identi er crucial de nition instanc identi er express perform trivial comput depend concret valu instanc proven start concret instanc uenc futur evolut futur behaviour system exhibit state equal renam reason distinguish state mark equal exist suitabl permut set identi er applic make state ident accept permut accept permut chang identi er initi import garbag collect mechan preserv inform net object instanc belong permut ful requir call renam permut de nition petri net set instanc identi er id initi object identi er oid de ne renam permut biject id id oid id id concept renam permut basi de ning renam biject set mark set event renam symmetri preserv structur trivial content mark event chang involv identi er formal de nition renam symmetri obtain extens biject work identi er biject mark event exact de refer reader denot renam symmetri induc renam permut de ne mark equal renam exist renam permut event denot renam relat member class refer board quotient set wrt denot notion renam symmetri formal mention properti concret instanc present state uenc instanc futur behaviour start state properti crucial theori symmetr reduc state space proposit petri net set mark set event ev set renam permut hold ev renam symmetri expect notion state space state gener state concret identi er instanc account state event consid equal equal renam de nition state space base gener concept state space time state correspond reachabl class ma wrt structur transit class ev wrt de nition state petri net set mark initi mark set event ev renam relat de ne state space state ig note na state space preserv inform reachabl state interconnect preserv partial na state space inform instanc manipul event state inform import deal isol explor sequenc state event concret instanc instanc behav event surround na state provid instanc identi er arbitrari repres na state inform lost na state dicult preserv de ne complet state space state de ne state space label na state space na state label tupl consist repres mark belong class repres na state group permut permut map repres mark structur transit label minimum set tupl consist repres event renam permut requir repres event repres sourc mark lead repres target mark appli renam event repres sourc mark lead mark equal renam repres target mark deriv eventu newli repres event permut set sourc permut permut number target mark process de nition state predic ful lled appli identi er event event di er identi er newli creat object event identi er newli start method net instanc event de nition state set mark set event ev set renam permut de ne complet state space state tripl na state space ev smallest set im state space inform reachabl state event concret interconnect instanc manipul event obtain full state space set renam permut content proposit note set renam permut practic veri cation task concret instanc import proposit petri net state space set renam permut reconstruct full state space rule versu abstract compar techniqu sophist rule abstract sophist possibl combin partial order remov redund assign di erent dynam instanc characterist role model system redund remov sophist combin partial order sourc state space redund model instanc plai concurr symmetr role time deal model involv phenomenon except remov redund dynam disappear instanc save memori approach base sophist rule consequ ignor di erent possibl identifi instanc denot function composit ident state respect creat role conclud renam save memori sophist case partial order reduct pai renam term time complex test mark equal renam correspond solv graph isomorph problem greatli time complex heurist deal accommod context techniqu lead state space hash heurist test state equal renam heurist comput state canon wrt detail appli di erent heurist context abstract found illustr present data obtain simpl prolog prototyp state space appli classic dine distribut russian di erent version simpl system restart counter state space model obtain introduc sophist rule reduct isol nest state state space reduc time visibl abstract lead signi reduct number exist system system distribut elabor sophist rule remov redund speedup obtain abstract exampl rang small neg valu present result chang improv mention method order isol unambigu nest hash bit comparison algorithm predomin abstract obtain make elabor sophist rule appli deal system partial order reduct case except appli object abstract advantag choic renam symmetri natur exploit kind state space common wai state space analysi veri cation question accommod deal brie discuss problem deal state space state space queri properti label tempor logic context state space statist context gener state space statist number number strongli connect set home signi petri statist bound live adapt style structur model de ne place bound transit live ignor structur virtual merg instanc net maximum number token place singl instanc transit live instanc net add statist primarili connect deal instanc object interest persist instanc transient instanc net instanc delet unavoid delet note evalu statist complic evalu statist ignor structur deal lead track individu life instanc recycl identi er due simpli interrel local state instanc refer identi er di erent state examin state space path state state space queri languag state space queri languag state space inspir languag tool state space queri languag context provid special tool queri state event respect highli speci structur note tool describ term tempor logic formula properti system veri ed mean express system invari speci cation legal termin state progress state main problem solv queri state event stem dynam prepar tool explor properti set state event respect fact set exist relat di erent encount state predict prototyp state space suggest solut problem base group function instanc queri function initi obtain set exist instanc net start initi make deriv set net instanc constant straight transit referenc instanc mark place transit exist function deriv set method net instanc run object function avoid exact knowledg exist instanc work advanc restrict set group set iter function appli set instanc constant function group intend combin order obtain requir characterist state exist instanc select constant proce explor instanc referenc select present examin state model system distribut philosoph class describ distribut philosoph shown figur model system distribut philosoph class task creat group philosoph interconnect ring method distribut philosoph di er classic share tabl exchang pn return return return left left return left hungri eat fork left fork start eat stop eat left nb nb hungri fig class distribut philosoph fork negoti fork messag send method de ne predic eat neighbour deriv set eat philosoph eat neighbour state model distribut philosoph prolog notat instanc queri set iter function prototyp tool work state space current state consid implicit queri return set exist instanc belong net set ns run object belong class cs queri return set ms token belong class cs store place ps instanc queri select element ful predic predic eat neighbour check correct system neighbour eat time predic hold empti check suitabl state space queri evalu predic eat neighbour state collect state hold set abstract approach check valid ctl formula ag eat properti label direct start assert simplest kind properti direct context assert form special guard restrict transit transit port assert red assert hold error messag invari model express common condit state hold reachabl state error state invari speci ed mention set function queri state order illeg termin state model identi ed announc gener state introduc special kind label declar place termin state consid legal instanc exist state token place requir state instanc net involv place legal illeg termin state distinguish place appli gener condit condit function queri state mention previou subsect condit mark state legal termin state evalu true state approach legal termin state recogn complex condit requir token colour store set place context introduc instanc delet place label gener form instanc delet instanc delet place instanc net legal delet speci ed place mark error introduc label indic instanc net instanc net delet counterpart place introduc kind label place progress place loop encount state space consid legal state fact instanc progress place mark introduc progress condit analog mention condit join progress label place eat object net distribut philosoph fig progress system distribut philosoph exhibit undesir loop strong fair assumpt philosoph exchang fork transit method enabl philosoph start eat approach sucient verifi set concurr exist instanc net exhibit kind instanc reach local progress state di erent state state space loop speci cation kind introduc instanc progress place loop state space consid legal instanc progress state instanc exist entir loop verifi kind individu track comput complex multipli power maximum number concurr exist instanc chosen fair case state unfold label tempor logic speci cation state space common tempor logic appli modifi tempor oper model check diculti atom formula tempor logic atom tempor logic formula refer properti state event describ function queri state event introduc discuss state space queri languag context note common tempor logic provid sucient tool trace instanc state space path special tempor logic call index ctl applic symmetr reduc state space system consist process introduc quanti act existenti quanti er process restrict quanti er discuss detail appli obviou rang net instanc object origin work account possibl dynam creat destroi instanc captur de ne process quanti er context rang instanc exist state evalu account examin properti instanc state space happen instanc delet moment intuit instanc identi er evalu formula instanc instanc delet state termin state ef hold instanc mark ful lled path lead ag hold instanc mark hold path lead destroi easi accommod origin model check algorithm cope mention modi cation compar tempor time complex model check necess track individu life instanc deal identi er dynam disappear model compon worsen state space problem consid work state space petri net similar phenomenon encount formal dynam approach deal identi sophist rule compar elabor sophist rule appli deal system partial order reduct abstract advantag renam symmetri natur exploit kind symmetri sketch di erent wai analysi veri cation question appli domain common advantag disadvantag preserv mention state space state space queri properti label tempor logic context analysi veri cation question answer state space ignor respect structur run instanc model refer concret involv hard imposs manag mention deal analysi veri cation question lead higher time space requir hold case sucient distinguish instanc singl track individu behaviour state space path notion includ articl exploit formal analysi veri cation reduc state goal futur research reduc state intend adapt theori partial order reduct domain lot concurr model base acknowledg work project inform control support grant agenc czech republ contract prototyp distribut applic petri refer visser java pathfind gener java model checker workshop advanc veri tool petri net model comput aid system theori technolog volum lectur note comput page la de gran februari gener state space petri net intern journal comput system scienc version gener exploit state space objectori petri net sm workshop softwar engin petri intern confer applic theori petri net page depart comput aarhu ea emerson ap sistla util symmetri model check fair approach acm transact program languag juli gj model checker spin ieee transact softwar cn ip dl dill veri cation symmetri journal formal method system model object petri net phd depart comput scienc faculti electr engin comput technic czech jensen colour petri basic analysi method practic vol analysi method monograph theoret comput scienc ca object orient model object petri paper publish advanc petri net combin partial order reduct journal formal method system intern confer comput aid veri cation stanford lnc cooper net intern confer applic theori petri volum lectur note comput page june ap ea emerson symmetri base model checker veri cation safeti live extend version paper ap symmetri base model checker veri cation live properti intern confer comput aid veri volum lectur note comput page state problem lectur petri net basic volum lectur note comput page formal analysi veri cation state space petri net phd depart comput scienc faculti electr engin comput czech april
ML/885 6 learnabl languag christoph globig steffen lang po box germani htwk po box germani abstract present paper investig learnabl index famili uniformli languag interest learn respect arbitrari fix similar learnabl index famili requir show index famili posit neg case posit case class famili compar small present result provid bound size case base choic case select strategi influenc learn capabl learner defin case select strategi compar learn power elabor relat languag learn posit posit neg exampl introduct reason artifici intellig reason knowledg repres collect typic case case base similar form rule wide accept approach consid reason model human expert structur knowledg learn understood interest possibl improv knowledg learn system system store case case base remov case case chang measur chang case base similar measur work support deutsch forschungsgemeinschaft project formal learn induct infer manner introduc turn learn algorithm remark effect classifi instanc power result abil learner chang underli similar measur learn task arbitrarili knowledg directli encod similar matter case store case base order overcom undesir encod trick investig learn assumpt underli similar measur chang learn task approach restrict result wit assumpt interest class formal languag learnabl interest investig problem choic case select strategi influenc learn capabl assumpt tailor sequel confin learn index famili formal languag underli assumpt learner chang measur learnabl index famili requir section show index famili posit neg case posit case class famili compar small minim size case base discuss fix measur similar learn capabl learn system depend strategi select case case section discuss influenc properti case select strategi access case case select strategi store case present strategi access delet case case case select strategi delet case case base case base grow case select strategi defin type learn elabor relat type learn relat languag learn posit posit neg exampl preliminari definit section adapt induct infer literatur target object languag finit alphabet denot set string alphabet subset call languag set denot set natur number denot pair function denot set ration number write fin finit subset denot cardin set basic wai present inform languag learner present posit data posit neg data present call text inform text languag infinit sequenc fs ng initi sequenc set fs kg denot set text inform languag infinit sequenc fs fs nl initi sequenc set fs fs denot set inform loss gener assum natur number repres initi segment text restrict investig learnabl index famili languag sequenc index famili function indic string hold index famili membership problem uniformli decid languag singl function denot set index famili definit adapt denot function defin input learnabl text learnabl iff lim exist lim set index famili learnabl text denot set unari comput function section summar result obtain defin languag set case similar measur oe call measur similar denot set total defin comput similar measur subset similar measur rang call standard semant st cb fin oe similar measur cb fs cb fs cb oe describ languag st st cb fw cb cb oe repr iff cb fin st repr iff cb fin cb fin st cb repr repr repr repr repr repr mean oe repr repr posit case store case directli definit lemma similar measur oe exist measur oe repr repr appli result theorem repr prove famili pattern languag posit case repres index famili posit neg case store case base introduc concept repres case languag oe repres case wrt oe provid iff notion repres case subsequ order simplifi proof definit adapt theorem repr proof index famili includ rang set lexicograph string defin total function set proce induct set index satisfi total repres case easili claim defin desir similar measur oe fw claim repr infinit claim note construct repres case obtain st remain handl case finit maxim element claim infinit repres case choic hold st fw theorem prove repr repres measur shown result remain case base posit neg case admiss underli idea similar definit repres proof lemma index famili repr exist oe repr notic proof exploit fact case base order repres languag necessarili comput assum finit decid case base comput practic point view natur case base small appli construct underli proof theorem finit languag repres put element case base theorem exist oe cb cb st cb proof slightli modifi version concept repres introduc proof theorem index famili order obtain desir result similar measur lexicograph string case fw case fw oe belong string serv repres case order show repres respect distinguish case case simpli cb fw cb st cb case proce string satisfi string ffl definit repres case set cb fw cb fw definit oe case definit appli argument yield st cb ffl contrast serv repres case cb fw cb fw st cb shown similar manner omit detail construct discuss case finish proof case base comput assum decid case base comput learnabl base result section studi learnabl index famili index famili learnabl text case select strategi iff cb lim st index famili learnabl inform case select strategi iff cb lim st underli assumpt learner chang measur similar learn process learn capabl depend case select inform describ dimens case select strategi access case case select strategi store case present strategi access delet case case case select strategi delet case case base case base grow respect dimens defin type case select strategi cb case base construct learner initi sequenc length case select strategi type iff condit hold cb cb cb cb cb cb cb cb abbrevi prefix mean case select strategi learn definit strategi type store multipl case singl learn step demand strategi type store singl case learn step learn capabl chang exist system simpli collect present model case select strategi type cb kg lead case base infinit languag text infinit defin mean strategi learn successfulli index famili iff st defin analog text st converg semant compar notion converg underli identif type bc induct infer function learn type demand sequenc converg learn text section studi languag learn posit case theorem show learnabl incompar denot set incompar theorem repr mo stand de ra lc ca stand prove class learn text index famili fag fa jg learnabl text hand famili pattern languag learnabl repr proof index famili repr order show simul learn strategi interleav limit process oe repr assum effect finit subset oe membership uniformli decid exist total function lim st input comput limit finit case base assum text desir learner defin comput comput set cb set cb fs infer text claim converg correct case base definit case select strategi type proof prove assert remain part handl similar manner definit fag bg fa show wit desir separ claim oe denot underli similar measur string serv repres case singleton languag fa fag wrt string repres case wrt oe assum present text easi verifi put case fail learn delet subsequ includ case fail learn text contradict claim recal delet case actual case base easili defin provid underli similar measur oe fulfil repres wrt repres wrt repres wrt oe omit detail theorem proof present proof assert show interest part proof index famili languag alphabet learnabl oe order show defin similar measur oe step loss gener assum oe assum effect string step set set easi verifi learnabl strategi oe step definit oe base oe set indic jm set ffl observ st st assum st belong definit string wrt directli impli iter argument obtain contradict assumpt ffl observ st impli st st observ prove similar manner readi defin strategi wit wrt oe text set cb st set cb cb set cb cb learn simpli collect st observ st st st st definit cb cb work requir show fa fa wit separ claim infinit learn reason text st languag text finit infinit finit case prove claim similar measur fulfil requir repres repres measur set repres languag disjoint wait store case base proof fag similar idea proof theorem show fag fb fa fig relationship learn type theorem show random access present case abil delet case actual case base learn power learn system subsum figur illustr relationship type learn text path type type proper subset learn inform learn inform power learn text index famili learnabl inform main result section index famili learnabl fix measur theorem proof shown idea proof theorem learn inform relat learn type chang case select strategi store case inform drop case case index famili learnabl theorem proof suffic show main idea defin target case select strategi wrt similar measur oe introduc proof theorem omit detail theorem easi conclud learn capabl combin free access case histori abil delet case case base proof fag alphabet index famili finit languag fa contrari strategi similar measur oe wrt oe learn inform cb st account learn fed inform distinct cb fail learn fed cb st cb fed initi segment distinguish case cb fail learn fag fvg inform prefix case cb impli fail learn fwg extens yield inform case case easili contradict proof famili finit languag show exist oe wrt oe definit hold st fa mg st fa assum set fag fa mg st mg st fa properti oe easi verifi famili finit languag learnabl strategi simpli collect case remain prove directli theorem shown proper belong complet proof learn power limit remark rich index famili proof present paper studi type learn index famili posit data posit neg data approach consid learn respect arbitrari fix similar measur attent problem underli case select strategi influenc capabl learner order answer question coupl result index famili achiev turn choic case select strategi learn text investig posit neg data simpl case select strategi suffici order exhaust full power learn point investig learn index famili orient natur give assumpt learner histori learn task order determin hypothesi lead notion iter work learn strategi formal learn exist system learner freedom chang underli similar measur learn refer david aha learn algorithm rai proc page morgan kaufmann angluin induct infer formal languag posit data inform angluin smith induct theori method comput class formal languag diploma htwk june christoph globig stefan wess symbol learn classif inform system data studi data knowledg page springer mark gold languag identif limit inform klau jantk learn induct infer acm workshop comput learn theori page kp jantk steffen lang learn pattern languag intern workshop algorithm learn theori volum page articl process macro packag llnc style
IR/886 5 search engin find onlin david hawk nick craswel csiro mathemat inform scienc gpo box australia abstract report result blind evalu perform commerci search engin onlin servic queri topic relev queri found strong correl perform type queri differ engin keyword search onlin servic queri search engin ground methodolog independ qualiti evalu commerci search engin facilit inform consum choic lead gener search qualiti inform subject comparison number academ studi attempt compar perform search engin scientif basi inform retriev experi publish scientif evalu commerci search engin measur abil search system retriev document relev topic interest queri submit commerci search engin reflect rang inform argu search engin evalu methodolog extend reflect broader realiti carri evalu involv queri set rang inform type report result evalu conduct cover tradit topic relev judg page relev topic contribut addit implicit queri newspap report sell flower internet relev queri evalu cover search onlin servic page judg searcher directli access internet servic person send flower internet satisfi newspap articl discuss topic requir page initi desir transact fit andrei inform categori approxim transact categori kathleen griffith centr mental health research australian nation australia experi set topic relev queri set onlin servic queri submit commerci search engin octob topic relev queri ident larg web task septemb evalu commerci search engin onlin servic queri ident larg web task exampl queri stopword topic find inform digit camera find inform current court multipl onlin iq order flower find icq find anim download comput game queri minu stop word submit automat script logic separ search result link risk error autom subject result valid check potenti problem detect elimin number run analysi page retriev googl fast northernlight lyco microsoft metacrawl eng type gener metasearch directori excit altavista dmoz search engin octob figur topic relev queri result document retriev server document queri search engin pool present independ assessor judg interfac dead link judg judg result list engin evalu ten document retriev correspond close good answer page result present searcher result discuss figur show perform commerci engin type queri multipl analysi varianc confirm differ perform search engin type queri onlin multipl comparison differ test conduct topic relev googl significantli engin fast northernlight onlin servic googl significantli superior northernlight page retriev googl northernlight fast lyco metacrawl eng type gener metasearch directori excit altavista microsoft dmoz search engin octob figur onlin servic queri onlin servic queri topic relev queri figur perform topic relev onlin servic queri pearson shown figur strong posit correl perform type queri pair reveal perform onlin servic queri superior topic relev indic search engin tune onlin servic queri equal topic relev queri harder caveat knowledg publish studi investig search engin perform onlin servic queri found strong correl perform onlin servic topic relev queri found perform differ engin type queri time submit queri import note perform engin vari time factor rank user interfac coverag fresh index import evalu categori result return directori servic evalu qualiti authorit result page present conduct evalu effect commerci search engin find site entri page hope report result final poster present refer andrei broder invit talk novemb wei ding gari marchionini compar studi web search servic perform asi annual octob michael gordon praveen pathak find inform world wide retriev effect search engin inform process march david nick peter kathi griffith measur search engin qualiti inform press david nick paul donna harman result challeng web search evalu leighton srivastava world wide web search servic journal american societi inform nation institut standard technolog trec home page inform retriev research batch queri vari gener difficulti
DB/887 3 analysi rule xml jame bailei peter wood depart comput melbourn school comput scienc inform london abstract xml domin standard store exchang inform area data wareh rapidli grow technolog support reactiv function xml repositori rule automat perform action event natur facil support function studi eca rule context xml data defin simpl languag eca rule xml repositori languag illustr mean syntax semant formal investig method eca task ad complex xml set compar convent activ introduct rule provid reactiv function includ activ workflow network technolog implement busi process paper simpl eca rule languag provid reactiv function corpora xml document motiv work xml mechan data wareh recent extens commerci system support view export xml discuss increment mainten view xml data valid input data maintain audit trail data analog convent eca rule integr technolog provid kind reactiv function corpora xml document type eca rule mechan automat broadcast inform subscrib content relev document chang emploi flexibl mean maintain statist document web site usag behaviour kei recur theme success eca rule techniqu tool behaviour part paper explor techniqu eca rule languag xml closest work describ languag interact xml sourc web incorpor eca rule detail syntax semant rule analysi address discuss extend xml repositori eca rule order support activ extens xslt lorel languag handl updat event xml document insert delet event section analysi techniqu develop convent activ appli extend languag detail discuss specif applic approach push technolog rule action method updat trigger rule recent paper defin activ rule languag concern rule analysi rule syntax describ similar defin rule format base definit trigger rule execut semant model gener insert delet xml data bulk involv document fragment unbound size describ semant updat sequenc smaller updat depend content fragment trigger execut interleav execut smaller updat treat updat atom trigger execut invok complet toplevel updat semant produc result updat question futur research determin respect suitabl applic relat work discuss monitor subscript xml support subscript web document set alert monitor simpl web document monitor queri processor perform complex event detect send notif event trigger engin perform includ creat version xml document focu reactiv function highli tune specif applic extens xqueri languag incorpor updat oper refer reader paper review provis updat facil xml manipul updat oper express action support eca rule languag includ renam replac specif updat multipl level document trigger discuss implement mechan delet oper underli relat store xml provis eca rule xml level consid paper structur section defin simpl languag eca rule xml document languag illustr mean syntax semant formal section discuss techniqu rule includ issu trigger activ relationship sophist analysi techniqu base abstract interpret section discuss techniqu execut eca rule section conclud remark outlin direct work eca rule languag xml consist set xml document eca rule xml form event condit action illustr eca rule mean exampl defin syntax semant formal xml consist document list book magazin held element isbn number book stock greater eca rule updat inform document insert book insert insert true variabl success bound newli insert book node detect event part rule condit part rule check book greater action part rule insert copi isbn node child phrase true isbn node ad exist children eca rule similarli updat inform delet book delet true delet isbn node child match isbn delet book delet xml consist document store amount sale product store document hold inform includ store sold amount eca rule updat document product amount ad insert true delet insert true action rule delet store parent insert product store exist child product action add store child product net effect copi store remain product note attribut fragment xpath paper includ function attribut valu type idref xpath graph structur document attribut type id idref discuss view updat data xml consist restaur inform includ ingredi document view deriv list cafe ingredi ingredi element mushroom ad cafe eca rule perform view mainten insert insert true result document introduc eca rule languag inform syntax semant eca rule syntax event part eca rule express form insert delet xpath express evalu set node rule trigger set node includ node case delet case delet variabl condit action part eca rule set instanti set delet node return condit part eca rule constant true conjunct xpath express evalu xml document chang event form rule event part condit refer variabl evalu instanti document evalu document action part eca rule sequenc action action execut xml document chang event form rule event part rule condit queri evalu true call set document eca rule set candid document eca rule fire set candid document action express form insert delet xqueri express xpath constant true xpath qualifi insert express specifi set immedi insert express refer variabl construct instanti rule condit queri evalu true refer singl construct option xpath qualifi evalu child node insert form insert sibl insert form insert sibl true order insert delet express specifi set node delet refer variabl order appli analysi techniqu discuss section assum xpath xqueri express eca rule restrict simpl defin extend techniqu larger fragment xpath xqueri languag area work xpath fragment disallow number featur full xpath notabl axi ax function syntax simpl xpath express denot string denot element attribut observ phrase updat happen placement restrict occur root node document underlin term refer paper xpath express start establish call document function function path express refer variabl variabl express xpath express call qualifi delet qualifi xpath left path node call path distinguish path express node end distinguish path distinguish leaf express result xpath express set match distinguish leaf express result type denot element denot element result type determin distinguish path leaf string leaf leaf infer replac occurr left start substitut distinguish path xpath express occur event part rule step element replac separ occurr replac step step separ delet step separ term path result modifi distinguish determin leaf modifi distinguish path condit eca rule result type conjunct ingredi event part rule insert result type conjunct determin distinguish path substitut replac delet replac final delet leav modifi distinguish path xqueri fragment disallow full express keyword essenti permit part express syntax simpl xqueri express modifi distinguish path simpli determin result origin path xqueri express xpath express element constructor element constructor empti element element sequenc element content element list attribut attribut list empti equat attribut attribut list attribut string express element content element constructor express express xpath express brace brace evalu result insert posit element constructor attribut result type xqueri express denot node type element type suffix node root arbitrari captur fact result xpath express return set node root tree determin xpath express singl node type element constructor form tree element express ignor string express determin result type delet replac modifi tree tree repres xpath express xqueri express insert action rule store type xpath express xqueri express assum result type repres xpath express eca rule execut semant rule execut semant procedur pseudocod input execut xml consist set xml document schedul consist list updat execut updat pair action action part rule set pair delta identifi document appli delta set instanti variabl gener event condit part rule respect document time rule event condit part call set instanti set delta rule identifi number order prioriti common standard trigger assum rule loss assum schedul initi eca rule execut consist action initi set document delta action initi schedul singleton form head tail function head return element list function tail return list minu element function execut action head schedul set document refer updat perform candid document refer updat perform instanti candid document return pair db result updat delta arrai set delta event part rule respect document function determin set candid document rule respect updat execut set instanti variabl candid document evalu rule condit document case variabl occur condit rule case condit evalu element subset condit evalu true nonempti set determin return candid document pair set instanti wrt return candid document occurr condit rule case condit evalu document evalu pair set set instanti wrt return candid document number action action part rule jth action rule statement ensur action rule order schedul action pair set consist set candid document rule set delta document rule consid order prioriti statement action rule fire schedul front action rule execut proce fashion schedul empti rule execut possibl rule analysi techniqu import develop set rule discuss techniqu section observ number observ make execut ffl gener undertak simultan set updat insert result order set insert common parent construct determin order respect exist area work extend eca languag captur order relationship ffl coupl rule coupl mode assum mean action rule fire result current updat head current schedul coupl mode eca system defer detach examin applic impact context area work ffl bind assum instanti variabl determin time event part rule detect bind possibl examin implic context area work coupl bind choic made correspond standard trigger ffl eca languag encompass analog trigger relat activ occurr variabl rule action execut document time rule fire trigger occurr action action execut instanti document trigger eca rule behaviour analysi eca rule activ number approach literatur context relat kei analysi question termin rule set eca rule termin initi event initi rule execut termin trigger activ relat rule determin set eca rule rule trigger rule action gener event trigger trigger graph repres rule direct arc vertex vertex trigger acycl trigger graph impli definit termin rule execut activ graph repres rule vertic case arc distinct vertic condit chang true execut arc vertex condit true execut action acycl graph impli definit termin rule execut trigger activ graph combin method call rule reduct result previou method vertex incom trigger activ arc remov outgo arc remov vertic repeat vertic procedur result vertic rule set termin investig abstract interpret termin eca rule eca rule abstract abstract repres number real real schedul abstract interpret approach costli techniqu approach focu trigger activ relationship pair rule approach consid global relationship relationship evolv rule execut natur question analysi techniqu develop eca rule relat xml set translat set xml document eca rule relat form appli previou analysi techniqu rule problem approach result loss trigger graph transform translat xml document number unari binari relat relat state element relat semant element identifi element identifi relat semant data node identifi relat child store xml document content insert delet element eca rule form child condit action trigger graph rule relat modif trigger suffici translat xml data eca rule relat form techniqu develop conduct analysi directli discuss techniqu trigger graph xml eca rule order determin trigger relationship xml eca determin action rule trigger event part rule insert action trigger insert delet action trigger delet event insert action form insert rule insert event ev form insert rule ev independ recal section denot result type tree node element leaf node possibl suffix indic node root arbitrari set path set xpath queri fe event ev independ action queri independ queri set xml document queri option part insert trigger develop safe test base distinguish path recal section construct modifi distinguish xpath express path occurr element attribut occurr oper attribut occur end attribut children ev event action set element singl set attribut interpret singl occur xml modifi distinguish path interpret regular express alphabet overload regular express denot altern symbol alphabet regular express denot altern symbol alphabet form replac occurr occurr occurr occurr distinguish path match path element termin attribut document xml db string languag denot xpath express set action rule xpath express event ev rule modifi distinguish path impli xml document db test empti intersect regular languag standard techniqu intersect conclud independ rule trigger rule arc insert trigger graph test consid distinguish path conserv test case trigger state event insert action insert set queri deriv action singl queri ident distinguish path xpath express event method conclud rule action trigger rule event ev exact structur insert action element children action trigger ev requir child test detect develop test area research test delet action trigger delet delet action form delet belong rule delet event ev form delet belong rule view xqueri express deriv queri set insert case simpli xpath singleton set trigger independ trigger graph set eca rule acycl graph impli definit termin rule activ graph xml eca rule order determin activ relationship eca determin action rule chang condit part rule case activ arc action rule leav condit part activ arc tabl illustr transit condit absenc negat rule condit column show truth subsequ column truth insert delet ni rue rue rue rue case clear tabl absenc negat rule activ action insert condit condit xpath express requir return result distinguish path plai role xpath qualifi interest exist path document match distinguish path insert element occur qualifi turn true insert element turn condit true qualifi distinguish path similar test condit analog introduc rewrit condit condit condit turn true element ad element element element ad element element child procedur determin insert involv construct set xpath express qualifi distinguish path object condit chang true result insert condit chang true result insert start set fc set conjunct proce conjunct number condit ad singl step decomposit element ffl condit form replac ffl form replac delet step form replac occurr ensur occur end form replac uw form delet add condit case depend structur qualifi ffl match nontermin grammar simpl xpath add ffl match nontermin add ffl match add ffl match add ffl match match nontermin add match nontermin add decomposit process continu condit action rule insert section construct queri set test regular express intersect order check independ condit chang truth true deem insert activ arc conserv area research develop test condit eca rule set condit construct decomposit procedur singl condit modifi distinguish path substitut insert action activ ffl insert ffl insert book ffl insert bookstor book child child set queri gener insert action queri interpret regular equal interpret regular express mean condit insert possibl independ activ arc ad rule insert action rule condit condit eca rule substitut drop set initi condit condit condit interpret state insert chang condit true ingredi insert child insert child insert child restaur test detect possibl correctli insert activ arc case rule activ leav condit true analysi case rule obtain develop notion analog properti eca rule relat set rule execut action make condit absenc negat rule possibl rule action delet subsum conjunct condit delet action delet queri test simpl xpath express eca rule constrain provid oper qualifi decid test determin rule decid larger fragment xpath languag open problem fragment xpath properti develop conserv area research activ graph set eca rule acycl graph impli definit termin rule trigger activ graph combin rule reduct method emploi abstract interpret rule execut abstract interpret approach eca rule analysi discuss appli present xml set approach techniqu focu trigger activ relationship pair rule approach natur pair rule insert delet rule delet true insert easi trigger activ graph rule solid arc trigger broken arc activ trigger activ rule reduct method rule set abstract interpret approach rule termin test consist run abstract rule execut initi singleton abstract initi abstract condit unknown rue invoc abstract execut definit termin set eca rule conclud set rule deem possibl initi abstract schedul consist action rule trace abstract execut rule denot condit queri rule action rule iter schedul unknown rue rue rue rule iter rule execut rule iter remain make true conjunct prior execut made conjunct iter falsiti mean rule fire point conclud rule rule trigger rule execut termin iter initi abstract schedul consist trace abstract execut rule iter schedul unknown rue unknown rue rue rue execut iter iter rule fire conclud rule rule trigger rule execut termin iter conclud termin rule set eca rule execut number techniqu execut xml eca trigger relationship rule deriv techniqu discuss section order event detect function section action appli trigger rule evalu rule event queri set set empti document dynam maintain activ relationship rule rule section avoid evalu condit queri true modifi function section individu express condit action part rule recent result express document satisfi constraint conform schema document type definit rule condit action abstract interpret predict sequenc rule action execut current produc version rule execut semant sequenc techniqu convent activ appli equal xml set techniqu opportun rule execut specif sequenc rule abstract common set queri evalu techniqu rule compil rule execut simpl eca rule languag provid reactiv function xml develop techniqu trigger activ depend xml eca rule combin techniqu recent theoret result analysi approach eca rule develop convent number techniqu behaviour xml eca rule time techniqu eca rule xml data determin trigger activ relationship eca rule complex xml set relat determin effect rule action simpli matter match updat relat potenti event bodi rule condit associ implicit semant comparison set path express requir imagin xslt transform sourc document kind view document exampl paper xslt process entir sourc document updat order produc document detect updat finer granular activ rule updat document xslt requir result tree gener appli transform sourc document work open direct ffl explor practic effect test independ queri trigger analysi activ investig possibl develop ffl explor decid independ larger fragment develop conserv approxim case properti ffl extend express part eca support negat rule ffl incorpor inform document type order analysi inform possibl rule ffl investig coupl mode bind mode eca ffl develop analysi techniqu properti eca rule confluenc rule execut rule prioriti permit refer jl wiener increment mainten materi view semistructur data proc int conf larg page bs yesha relat transduc electron commerc editor abstract interpret declar languag elli push technolog person event correl proc int conf larg page hellerstein behaviour product confluenc observ determin proc acm sigmod int conf manag page acm hellerstein static analysi techniqu predict behavior activ rule acm lv srivastava minim tree pattern queri proc acm sigmod int conf manag page bailei abstract interpret framework termin analysi activ rule proc int workshop program lnc page activ rule partial evalu abstract interpret proc int workshop program dynam approach termin analysi activ rule proc int conf comput logic lnc paraboschi improv rule analysi mean trigger activ graph rule lnc page paraboschi runtim analysi activ behavior ieee transact knowledg data barali widom algebra approach rule analysi expert system intern confer larg page barali widom algebra approach static analysi activ rule acm ceri activ xqueri proc icd paraboschi activ rule paradigm vldb paraboschi push reactiv servic xml repositori activ rule proc widom practic applic trigger success issu proc int conf larg page ceri fraternali design applic object idea methodolog paraboschi web site gener applic proc int conf larg page view larg scale xml repositori proc int conf larg page deutsch tannen integr constraint xpath fragment proc int workshop knowledg meet mf suciu effici evalu xml queri proc acm sigmod int conf manag page ay suciu queri conjunct queri regular express proc acm symp principl page acm hopcroft ullman introduct automata comput ishikawa activ distribut system proc web dynam simon activ commerci experi activ rule page cochran activ featur activ rule page monitor xml data web proc acm sigmod int conf manag page hr principl program analysi editor activ rule system shasha effici match system proc int conf cooper inform system page zg ay ds weld updat xml proc acm sigmod int conf manag page wadler formal semant pattern xslt markup technolog widom ceri activ system san pt wood xml pattern proc int conf comput logic lnc page pt wood simpl xpath express proc webdb fourth int workshop web page world wide web consortium xml path languag version novemb recommend world wide web consortium xsl transform version novemb recommend world wide web consortium xqueri xml queri languag june work draft
IR/888 5 maximum likelihood estim filter threshold yi zhang jami callan school comput scienc carnegi mellon pa usa abstract inform filter system base statist retriev model comput numer score indic document match profil document score dissemin threshold deliv optim dissemin threshold maxim util function base distribut score relev document paramet distribut estim relev relev inform obtain filter paper present method adjust dissemin threshold explicitli model bia base maximum likelihood jointli estim paramet densiti distribut relev nonrelev document ratio relev document corpu experi filter track data demonstr effect algorithm keyword inform dissemin maximum likelihood estim introduct inform filter system monitor document stream find document match inform profil consist queri relat context histori filter system base statist model vector infer numer score document match dissemin document score threshold dissemin inform stream system provid relev judgment document deliv adapt filter system learn accur time adapt filter system learn user feedback import learn corpu idf learn filter ad delet term adjust term learn dissemin threshold prior research adapt filter learn filter profil common approach learn profil increment version rocchio algorithm nr nr initi profil profil set relev nr set document constant indic rel type evid machin learn algorithm text classif naiv boost problem set filter threshold receiv attent part oper environ reli boolean retriev model profil match research work statist algorithm delai dissemin score comput document sort document dissemin top trec rout task approach effect dissemin inform quickli dissemin find dissemin threshold profil problem set dissemin threshold find threshold maxim util metric relev document reward document recent trec filter track evalu recent research set dissemin threshold base heurist regress method permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee septemb usa copyright acm heurist threshold vari lower bound util upper bound optim microsoft cambridg map document score probabl relev score log ast set learn averag score top retriev document kun assum gaussian distribut score relev document exponenti distribut score found threshold maxim linear util measur approach extrem achiev result util orient run filter track evalu potenti weak kun approach assum train data accur repres distribut relev document score assumpt true adapt filter relev inform obtain document dissemin relev inform document score train data inher paper present method set dissemin threshold kun assum relev document score distribut document score distribut exponenti algorithm explicitli model sampl maximum likelihood principl find estim paramet jointli estim paramet densiti distribut ratio relev document corpu experi method produc dissemin threshold significantli accur baselin kun method case section describ maximum likelihood estim model score distribut section describ methodolog algorithm set dissemin threshold base score distribut section report result section conclud model score distribut mathemat model document score distribut small proport document relev accur model distribut document score top rank document dissemin threshold set accur research suggest model score distribut gaussian distribut score relev document exponenti distribut top rank document distribut model score score nr score gaussian varianc gaussian varianc exponenti minimum score document analysi result filter track data ohsum support approach figur illustr normal distribut fit relev document score topic figur illustr exponenti distribut fit document score topic document score figur densiti relev document document score figur densiti document document score figur densiti relev document document score number document figur densiti document model low score document provid accur estim distribut score task area interest area threshold document problem kun paramet estim method set kun paramet estim method normal exponenti distribut simpl calcul varianc train data approach paramet estim produc inform filter task relev inform document score dissemin threshold train data restrict score sampl score higher real document score densiti estim base relev inform densiti estim base relev inform document threshold figur estim paramet relev document topic profil figur varianc gaussian distribut relev train data restrict document score fix dissemin threshold varianc calcul kun method order estim distribut sampl dissemin threshold real world adapt threshold chang problem interest maximum likelihood estim score distribut paramet maximum likelihood paramet estim solv problem point filter filter system deliv document user relev judgment deliv document provid user treat document train data deliv document user repres tripl score deliv threshold document score document relev document relev score nr order describ densiti distribut paramet mean section expect ratio relev document corpu model repres ratio corpu exponenti model fit top score model accur score threshold typic set observ train repres set tripl score probabl max arg max arg assum prior knowledg distribut treat prior probabl uniform revisit remov assumpt section constant independ drop probabl maxim likelihood train data max arg max arg max arg max arg score score score step equat due assumpt document step due fact maxim function maxim step sampl constraint train data notic train data sampl randomli individu train document sampl randomli condit probabl score paramet estim base equat item insid sum oper equat score score score score score score score score score score score score score score step equat base definit condit step due chain rule step due fact train document score higher threshold probabl document score threshold relev probabl score threshold nonrelev probabl score calcul integr densiti function posit infin dx dx score score dx dx nr score nr score repres probabl document score threshold nr score nr score score intuit explan equat illustr figur assum sum area exponenti gaussian curv correspond area normal distribut curv correspond area exponenti distribut curv relev document score document document figur distribut score document profil equat lp max arg relev score lp score lp train data random sampl corpu true replac equat optim paramet kun kun method maximum likelihood estim paramet train data random sampl dataset equal sampl filter equat find paramet paramet optim conjug gradient descent close form solut equat numer method method conjug gradient descent cg iter minim procedur function sketch cg algorithm shown figur approxim search improv search solut direct detail descript deriv side equat calcul search direct taylor calcul integr equat taylor converg figur sketch cg algorithm methodolog baselin ml method set dissemin threshold evalu seri experi trec data methodolog trec filter track year year experi methodolog experi filter data advantag approach result obtain dataset obtain methodolog consequ result data directli compar result system particip filter track evalu methodolog detail evalu measur commonli evalu measur filter system linear correspond assign posit neg cost element categori relev deliv deliv util variabl number document benefit cost categori filter linear util function set threshold nr score score solut solv ad util measur max topic mesh topic set lower bound profil limit impact poor profil filter result lower bound profil score opt simpler definit util initi guess minimum neg gradient minim point direct linear combin gradient converg slightli simplifi variant util metric filter track measur experi deliveri rule deliv score data text corpora test ohsum dataset filter track ft dataset filter track ohsum data ohsum data collect nation librari medicin bibliograph filter track consist articl subset journal cover year ohsum queri mesh head simul user profil relev judgment ohsum queri made medic librarian physician basi output interact search mesh assign head document nation librari medicin treat posit relev judgment filter assum user profil descript arriv begin articl learn word occurr statist corpu statist averag document system begin natur languag descript inform exampl relev document averag number relev articl test data ohsum topic mesh head ft data ft data collect articl time filter track trec topic simul user profil relev judgment made nist basi pool output search system begin identifi relev document natur languag descript inform titl descript field trec topic averag number relev articl test data methodolog inform filter system experi process document remov unusu symbol punctuat special exclud highli frequent term list default inqueri stop word list stem porter stemmer process document compar profil tfidf formula measur similar document user profil filter system creat initi filter profil term trec topic titl descript set initi threshold document train dataset pass filter profil term weight updat filter relev document system sampl constraint score exce dissemin probabl simpli element equat chang score lp section simplic set prior probabl uniform real filter earli stage filter small number problem document estim prior relev document varianc smooth prior paramet solv problem prior amount sampl data influenc prior set prior beta distribut equal ad relev document document sampl randomli smooth prior set equal ad sum squar varianc relev document set ad relev document nonrelev ad sum squar varianc distribut queri run carri run baselin paramet estim method run maximum likelihood estim run stop deliv document neg common begin minimum deliveri ratio introduc avoid problem profil achiev minimum deliveri threshold automat correspond fourth run minimum deliveri ratio set approxim document dissemin profil beta distribut conjug prior binomi prior simplifi calcul special case gamma conjug prior varianc normal distribut result experi report paper attempt optim util consist recent trec filter track evalu methodolog optim util lead higher recal case util case util recal report metric provid greater insight metric evalu result result ohsum dataset algorithm work minimum deliveri ratio column earli stage document hard estim score distribut correctli equat threshold set high futur document learn place introduc minimum deliveri ratio forc system deliv percentag train data enabl system recov automat ohsum topic mesh maximum likelihood estim minimum deliveri ratio achiev result profil updat disabl run dataset receiv posit averag util result run topic averag compar filter system adapt filter track effect algorithm filter system learn improv profil experi static filter profil tabl util filter ohsum dataset run run run run method method min deliveri ratio ml ml min deliveri ratio util avg doc deliv profil recal util avg doc deliv profil recal tabl util filter ft dataset run run run run method method min deliveri ratio ml ml min deliveri ratio util avg doc deliv profil recal number profil algorithm perform equal ft data differ ft dataset ohsum dataset averag number relev document profil test set ft filter profil good mean imposs find threshold achiev posit util profil updat baselin method set threshold high profil relev document recal profil algorithm threshold baselin ml method similar util metric recal metric compar util topic run run found ml method good profil score distribut relev document document good system point view user differ method baselin algorithm larg comparison topic level comparison ohsum ft corpora suggest method work good perform profil similar baselin method baselin method deliv fewer ohsum ml method tabl column averag number document deliv baselin method close minimum deliveri empir justif previou analysi illustr figur gaussian estim baselin method higher actual threshold set high final result baselin method highli influenc minimum deliveri ratio problem maximum likelihood threshold base estim score distribut accur figur util differ run run point high horizont work similar topic figur differ number document deliv run run deliv document point horizont run comput effici comput effici import environ filter system pace document stream mathemat ml algorithm effici minut filter year ohsum data profil run mhz intel pentium iii processor mb memori time includ aspect document includ set updat dissemin threshold filter futur work develop effect algorithm set dissemin threshold filter document gaussian distribut score relev document exponenti distribut score threshold maxim util measur deriv base paramet distribut due fact relev judgment deliv document method estim score densiti paramet result threshold higher optim algorithm base maximum likelihood principl jointli estim paramet densiti ratio relev document algorithm explicitli model inher bia filter train data consist document score threshold constantli paper solv sampl bia problem inform filter method obtain improv filter task filter profil updat filter effect system combin threshold updat profil updat achiev perform difficulti combin algorithm profil updat adjust train data score base profil term weight futur research problem acknowledg wei xu discuss idea paper paul review earlier draft paper materi base work support air forc research laboratori contract recommend express paper necessarili reflect sponsor refer allan increment relev feedback inform filter nineteenth annual intern acm sigir confer research develop inform pp acm cha tp van der weid kun filter threshold optim adapt filter system ninth text retriev confer nation institut standard special public jp wb dw document retriev rout inqueri system text profil id profil id retriev confer pp nation institut standard special public callan document filter infer network nineteenth annual intern acm sigir confer research develop inform pp acm callan learn filter annual intern acm sigir confer research develop inform pp acm press robertson filter track final report eighth text retriev confer pp nation institut standard special public sy bt zhang text filter boost naiv classifi annual intern acm sigir confer research develop inform pp acm press dd singhal boost document rout ninth intern confer inform knowledg manag pp acm press porter algorithm suffix strip pp sa wt bp flanneri numer recip art scientif pp cambridg press leon interact retriev evalu larg test collect research seventeenth annual intern acm sigir confer research develop inform pp acm press feng model score distribut combin output search engin annual intern acm sigir confer research develop inform retriev la acm rocchio relev feedback inform retriev smart retriev system experi automat document pp prentic hall hull guidelin filter track ninth text retriev confer nation institut standard special public walker microsoft cambridg filter track ninth text retriev confer nation institut standard special public robertson press threshold set adapt filter journal document payn okapi fourth text retriev confer nation institut standard special public singhal boost rocchio appli text filter annual intern acm sigir confer research develop inform pp acm yang knn failur analysi ninth text retriev confer nation institut standard special public threshold calibr adapt filter seventh text retriev confer pp nation institut standard special public da evan optim adapt filter eighth text retriev confer pp nation institut standard special public callan ninth text retriev confer nation institut standard special public
IR/889 5 label unlabel data learn drift concept ralf ls informatik viii germani abstract learn data collect extend period cope problem distribut underli data chang label train data point time typic inform adapt classif document respect user interest interest user document content chang time filter system adapt concept user give filter system achiev good label train exampl provid paper method recogn handl concept support vector machin unlabel data reduc label data method maintain window train size automat adjust estim gener error minim approach theoret effect effici practic requir complic simpler robust compar heurist experi simul concept drift scenario base text data compar method window manag approach show effect select window size robust order achiev accept perform fewer label train method exploit unlabel exampl transduct introduct machin learn method appli data collect extend period time applic introduc problem distribut underli data chang time compani collect amount data sale figur custom data find pattern custom behaviour predict futur sale custom behaviour chang model underli success predict adapt problem occur inform adapt classif document respect user interest inform filter techniqu build person learn prefer user filter email interest user document content chang time filter system adapt concept problem real world applic label train data appli inform filter domain user give partial filter system achiev good label train exampl provid paper method detect handl concept support vector machin extend approach unlabel data reduc label data approach clear theoret motiv requir complic paramet tune review work adapt chang concept shortli describ induct transduct support vector paper explain window adjust approach evalu simul concept drift scenario realworld text data experi show approach effect select window size result low predict error rate complet feedback amount feedback reduc unlabel data perform system empir result show unlabel data significantli improv perform text case label unlabel data expect improv perform inform filter approach perform drop gracefulli reduc amount feedback point inform retriev word natur languag occur strong pattern word occur type inform independ document label unlabel data concept drift studi problem concept drift pattern recognit problem framework consist featur vector label indic classif data arriv time batch loss gener batch assum equal exampl denot batch batch data independ ident distribut respect distribut pr depend amount type concept distribut pr pr batch differ goal learner sequenti predict label batch batch learner subset train exampl batch predict label batch learner aim minim cumul number predict error user partial assign label label unknown learn algorithm unlabel data addit label disregard exampl learner exploit inform captur unlabel exampl section basic inform pr algorithm unlabel data machin chang concept handl time window fix adapt size train data widmer weight data part hypothesi ag util classif task taylor approach weight exampl inform filter increment relev feedback approach earlier approach maintain window adapt size explor window fix choic window size fast adapt good gener phase concept chang basic idea adapt window manag adjust window size current extent concept drift task learn drift concept studi comput learn theori learn chang concept restrict type admiss concept drift concept provabl effici learnabl concept rate extent drift limit wai function randomli jump valu predict learner accuraci assum possibl perman slow concept drift defin extent drift probabl subsequ concept randomli drawn result includ upper bound extend drift maxim toler learner algorithm learn concept drift constant extent drift show suffici learner fix number recent exampl window minim fix size learn concept extent drift appropri limit long restrict extend determin maxim rate drift accept maxim accept frequenc concept impli lower bound size fix window concept similar lower bound long applic hand obei reader electron chang interest arbitrarili radic larg time window theoret result impract applic orient approach reli smaller window fix size window adjust heurist smaller window size perform fix larger window heurist intuit work applic requir tune transfer lack proper theoret foundat support vector machin support vector machin window adjust approach paper support vector machin core learn algorithm support vector machin base structur risk minim principl statist learn theori basic svm learn linear rule bg ae weight vector threshold idea structur risk minim find hypothesi lowest probabl error show goal translat find hyperplan maximum comput hyperplan solv optim problem optim problem subject introduct svm optim euclidean length jj weight vector proport rule constraint requir train exampl classifi correctli slack train li side greater equal upper bound number train error factor paramet train error model complex comput reason solv wolf dual optim problem solv optim problem directli optim problem ff ff ff subject ff ff sv light comput solut optim problem support vector train exampl ff solut solut optim problem rule comput ff train calcul support vector ff train loss comput solv optim problem appli learn suffici calcul product featur vector exploit boser al introduc kernel learn rule depend type kernel svm learn polynomi radial basi function layer sigmoid neural net kernel calcul featur space replac formula transduct support vector machin set transduct infer introduc vapnik descript descript learn task learner hypothesi space function iid sampl train train exampl yn train consist document vector binari label contrast induct sv light light learner iid sampl test test exampl distribut transduct learner aim select function hl train test train test expect number erron predict dp test exampl minim shown linearli separ problem lead optim problem optim problem svm sep minim jj subject solv problem mean find label test data hyperplan hyperplan separ train test data maximum margin handl introduc slack variabl similarli induct svm optim problem svm minim jj subject paramet set user trade margin size misclassifi train exampl exclud test exampl algorithm solv optim problem effici sv light comput solut optim problem approach unlabel data method exploit unlabel data earli empir result transduct found bennett show small improv standard uci dataset conduct experi approach minim norm prohibit kernel connect concept algorithm present approach estim confid predict base transduct set nigam al approach unlabel data text classif multinomi naiv classifi incorpor unlabel data problem naiv independ assumpt violat text em show substanti improv perform regular naiv classifi describ extens framework arbitrari classifi blum mitchel work unlabel data set exploit fact multipl repres text page anchor text hyperlink point page blum mitchel develop boost scheme exploit condit independ window adjust optim perform method paper extens approach approach handl drift distribut exampl window train data window includ exampl suffici current target concept assum amount drift window includ train exampl previou approach similar window strategi shortcom fix window size involv complic heurist fix window size make strong assumpt quickli concept heurist adapt speed amount involv paramet difficult tune present approach select window size involv complic kei idea select window size estim gener error exampl minim estim gener error special form effici method estim perform svm base idea estim estim error rate proce train sampl train remov result sampl train yn lead classif rule classif rule test held classifi incorrectli produc error process repeat train exampl number error divid estim gener error estim comput train sampl size run learner time overcom problem upper bound number error calcul brute forc ow argument comput vector train loss solut primal svm train problem ff solut dual svm train problem base vector train svm extra cost estim defin count maximum differ element hessian max count number train quantiti ff exce document vector normal unit length experi proven approxim upper bound number error train set total number train error rate err ff theoret properti discuss shown estim pessimist overestim true error rate averag experi show bia accept small text classif problem varianc estim essenti low holdout estim data design similar estim combin measur window adjust algorithm method extens approach exploit unlabel data basic idea algorithm find window size label train win label induct ident algorithm determin good window size unlabel win unlabel stream document transduct svm estim error test leav window size win label unchang subsect describ part algorithm separ window size win label win unlabel maintain label unlabel data probabl describ user drift captur label chang rate probabl describ distribut document ident underli label unlabel exampl independ label separ window obtain inform probabl distribut window label data subsect describ window adjust approach work label exampl train set induct svm window adjust algorithm ignor unlabel window label exampl sake simpler assum subsect exampl label window adjust algorithm solv larg window learner train gener concept chang larg window data longer relev current target concept find size mean qualiti number train exampl answer question window adjust algorithm batch essenti window train svm result train set window size comput base result train contrast previou estim consid recent train exampl err ff reflect assumpt recent exampl similar exampl batch window size minim error rate select algorithm return win label algorithm summar ffl train train sampl consist batch exampl ffl train svm exampl comput exampl ffl window size minim label window unlabel data transduct test exampl batch unlabel exampl optim learn text classif task perform improv compar induct svm maxim small set label train exampl larg set unlabel exampl addit small test set consid unlabel unlabel data current time window size win label part train train exampl time treat unlabel consid potenti batch size number text arriv part algorithm part previou section label exampl algorithm previou label unlabel exampl algorithm section earlier label virtual batch size smaller real batch size exampl algorithm find window unlabel data final summar ffl train train sampl consist batch exampl test test sampl ffl train exampl train exampl window size win label test exampl comput exampl ffl window size minim unlabel experi setup order evalu part window adjust approach section method make unlabel data manag approach evalu combin induct ffl learner gener classif model exampl ffl learner induc hypothesi recent batch correspond window fix size batch ffl window window fix size batch ffl window window adjust algorithm adapt window size current concept drift situat tabl relev categori concept chang scenario probabl relev document categori time step gori experi perform inform filter typic applic area learn drift concept text document repres vector word distinct word correspond featur word document word occur time train data occur list stop word consid document featur vector normal unit length abstract document length perform classifi measur metric predict recal classifi recogn relev document relev document classifi relev relev report result estim averag ten run experi subset document data set text retriev confer consist english busi text text assign categori categori consid case world debt concept chang scenario simul text randomli split batch equal size document text categori distribut equal batch tabl describ relev categori concept chang scenario time step probabl relev document categori document class relev scenario scenario document categori consid relev user interest document irrelev batch document categori relev irrelev scenario document categori consid relev user interest document irrelev slowli batch batch document categori relev irrelev scenario simul abrupt concept shift user interest categori categori batch back randomli select text consid categori batch order evalu part window adjust approach section advantag achiev unlabel exampl automat chose amount unlabel data experi plan base scenario rate user ffl induct svm label data part window adjust method section ffl label train set induct svm test set ffl unlabel exampl window size win label induct svm ffl train data window size win label induct svm unlabel data ffl part window adjust method section automat chose amount unlabel data result figur compar predict error rate adapt window size algorithm method graph show predict error batch full memori strategi adapt window size algorithm essenti coincid long concept drift stabl show lower predict error fix size memori approach point concept perform method deterior perform memori adapt size recov quickli concept error rate full memori approach remain high scenario concept memori fix size strategi exhibit higher error rate adapt window algorithm stabl phase concept drift show fix full memori approach perform suboptim situat adapt window size algorithm achiev low error rate phase scenario reflect averag error rate result experi present workshop batch adapt size memori fix size full memori batch adapt size memori fix size full memori batch adapt size memori fix size full memori figur comparison predict error rate scenario denot batch number averag predict error window rang window rang window rang figur window size rang scenario denot batch number horizont line mark averag train window rang select batch number bottom part graph depict locat type concept shift batch tabl adapt window size algorithm achiev low averag error rate scenario recal consist high behavior adapt window algorithm explain window size select figur show averag train window rang bottom graph depict time extent concept drift scenario scenario train window abrupt concept chang batch cover exampl current concept batch averag train set size slightli smaller maxim explan larg train set small number addit exampl make differ concept chang batch adapt window size algorithm pick train window cover exampl drift desir similar behavior found scenario drift adapt window size algorithm intermedi select train exampl concept batch suffici train exampl distribut earlier exampl discard behavior adapt window size algorithm scenario reason situat occur batch window size exhibit larg varianc run algorithm select small train set size remain run select train exampl start batch borderlin accept batch exampl train singl batch summari method handl concept drift support vector machin method window adjust approach directli implement goal discard irrelev data aim minim gener error exploit special properti adapt window size select problem unlik convent heurist method clear simpl theoret motiv method easier practic involv paramet complic heurist experi inform filter domain show algorithm achiev low error rate select window size concept drift scenario extens method exploit unlabel data reduc amount label data learn drift concept extens base transduct svm react expect label exampl previou approach acknowledg work support dfg collabor research center comput intellig tabl window manag approach scenario averag trial batch sampl error full fix adapt memori memori size size scenario error recal scenario error recal scenario error recal thorsten joachim make svm light implement publicli refer jame allan increment relev feedback inform filter nineteenth acm confer research develop inform page acm press marko balabanov adapt web page recommend servic intern confer autonom page acm press bennett combin support vector mathemat program method classif advanc kernel method support vector learn blum tom mitchel combin label unlabel data annual confer comput learn theori burg tutori support vector machin pattern recognit data mine knowledg fletcher practic method optim learn transduct confer uncertainti artifici page david philip long track drift concept minim disagr machin joachim make svm learn practic advanc kernel method support vector learn mit thorsten joachim transduct infer text classif support vector machin intern confer machin learn joachim estim gener perform svm effici seventeenth intern confer machin san morgan kaufman ralf thorsten joachim detect concept drift support vector machin seventeenth intern confer machin learn san morgan kaufmann ralf renz adapt inform learn presenc concept drift workshop note workshop learn text page menlo aaai press rl rivest learn concept advanc neural inform process volum page san morgan kaufmann gerhard und zur data mine master fachbereich universitat jun partial text combin label unlabel document scheme ramon lopez de confer machin learn volum page springer verlag lunt evalu attribut obtain statist rule engin tom rich dayn john david experi learn person assist commun jul mitchel learn classifi text label unlabel document kamal andrew sebastian tom mitchel text classif label unlabel document em machin salton bucklei term weight approach automat text retriev inform process charl structur chang classif workshop note workshop dynam chang theori context depend page apr van rijsbergen theoret basi data inform retriev journal june vapnik structur risk minim risk problem pattern recognit autom remot vapnik statist learn theori gerhard widmer kubat learn presenc concept drift hidden context machin
ML/890 6 relat chemic structur applic neural fold architectur thorsten schmitt christoph institut fur technisch universitat munchen munchen paper base neural fold architectur fa recurr neural network architectur suit adapt structur learn approxim map symbol term structur ir main object paper demonstr fa successfulli appli approxim quantit structur activ relationship plai import role drug design process approach problem suitabl learn task fa present final fa appli inhibit achiev result compar result machin learn approach prove fa significantli recurr neural fold drug quantit structur activ inhibit introduct field drug quantit relationship specif interest typic set chemic structur activ problem construct predict theori relat map structur compound activ high accuraci theori form basi clinic drug averag drug year develop select drug high low activ thousand structur reduc number drug test laboratori reliabl machin learn approach reduc cost speed drug design process tradit method develop linear regress sophist statist method commonli recent feedforward neural network symbol machin learn techniqu appli method benchmark investig achiev result improv capabl neural fold architectur fa approxim map term structur strongli suggest applic paper develop map chemic structur formula term appli benchmark detail descript experi paper organ section inhibit benchmark introduc result machin learn approach appli benchmark present neural fa briefli review section section develop suitabl term structur drug benchmark set outlin approach experi result achiev fa benchmark present section section subsum paper final comparison result gener remark benchmark problem benchmark previou result benchmark deal inhibit act agent inhibit enzym inhibit reproduct cancer cell benchmark origin work baker benchmark set excel test ground approach analysi benchmark set consist drug respect activ drug basic chemic atom set structur connect atom group discret branch attribut part benchmark determin expert complet list chemic group attribut found drug benchmark set common templat displai fig posit ring substitut chemic group posit ad ring basic group ring consist bridg ring substitut posit ring prime posit specif posit ring connect bridg noteworthi benchmark set drug bridg ring posit simultan bridg ring posit linear regress standard feedforward neural network appli inhibit benchmark compar result symbol machin learn algorithm report result number hidden displai tab machin learn techniqu knowledg train set test set xy xy linear regress attribut squar neural network attribut attribut drug structur tabl hirst king result benchmark accuraci approach measur spearman rank correl coeffici actual predict activ train test set mean xy standard standard deviat comput trial method perform train set show good gener properti approach significantli fold architectur fold architectur network variant standard perceptron work direct acycl graph comput map term signatur note term easili repres dag detail discuss finit set describ ariti symbol max fg maximum ariti symbol set term usual function label assign label vector symbol call label size rep dimens compress term dimens network perceptron sigmoid activ function appli encod network enc classifi network class encod comput compress max rep input neuron rep output neuron enc comput function enc rep ffl denot vector concaten function enc defin enc ffl ffl ffl ffl nil network virtual unfold accommod term constant encod composit term encod subterm nil vector fix absenc subterm fig show network perceptron classifi class rep input neuron output neuron comput function class output encod input total ir linear unit output layer basic templat nh templat ring drug nh cl templat ring bridg nh bridg drug nh nh cl cl figur templat drug nil nil nil nil nil rep rep classifi network encod network result neuron figur network unfold accommod work defin net class network train backpropag structur variant standard error output layer classifi network propag back entir virtual unfold network result term directli optim task hand current refin includ effici term minim dag speed complex epoch linear total number node edg train set improv conjug gradient descent speed converg encod chemic structur term section develop suitabl term drug discuss possibl complex term fig illustr substitut chemic group respect term fig basic templat displai part drug benchmark explicitli encod combin encod basic function symbol ariti singl paramet function symbol term substructur substitut posit appli oper greater explicit nh group posit structur formula fig show templat ad ring suitabl term function symbol ring ariti describ ring substitut posit order term simpl standard substitut structur formula explicitli atom posit interest encod atom ring occur posit substitut minim dag repres set term minim number node edg repres multipl occurr substructur ring oper requir ariti noteworthi procedur ad detail chemic structur term fig exhibit structur formula drug chosen term atom encod constant cl structur formula demonstr bridg ring repres term function symbol bridg ariti defin bridg ring argument describ chemic structur ring term encod bridg structur simplest repres chemic subformula approach replac bridg oper describ bridg directli instanc posit drug repres assum actual term chemic group long includ desir featur scheme emploi consist benchmark set repres term form main reason bridg construct substitut chemic group constant easi addit attribut term constant repres substitut chemic group extend function symbol ariti paramet repres attribut chemic group atom attribut term experi result setup experi section fold trial direct comparison result experi train epoch learn algorithm conjug gradient descent method kind train test set experi kind term structur chemic group repres constant kind consist term structur attribut chemic group repres function symbol ariti section displai exampl kind fa weight epoch train set test set tot rep rep tot enc class xy xy tabl achiev result reveal good gener properti fa benchmark label code function symbol uniqu chosen binari encod scheme activ rescal interv target repres smallest largest activ tab summar paramet result experi perform column present number weight emploi column displai epoch gener properti observ spearman rank xy standard deviat spearman rank train test set displai column network train experi perform excel train set epoch xy clear overfit effect observ test set assum train epoch enhanc perform train set perform train test set term structur observ perform test set experi superior report result benchmark fa abil find approxim map symbol structur numer valu suggest strongli applic field chemistri pharmacolog case studi benchmark drug design demonstr fa relat chemic structur activ achiev result significantli achiev machin learn techniqu overfit effect encount experi hold small network detail term drug section add inform improv gener number drug benchmark small experi deal bigger set drug drug develop nation cancer institut activ form cancer test data easili access experi demonstr big set structur process futur work refer learn distribut backpropag structur intern confer neural network christoph connectionist approach learn heurist autom deduct system phd technic comput jd sternberg quantit relationship neural network induct logic program ii inhibit molecular weinstein approach molecular pharmacolog cancer januari srinivasan relat chemic activ examin ilp success gener induct learn symbol domain recurr neural network german annual confer artifici intellig springer verlag note comput scienc ja jr ration learn algorithm proc intern joint confer neural network volum page marsh prescrib bank thorsten schmitt evalu neural fold architectur induct learn task logic term chemic structur master technisch experi applic fold architectur network guid theorem prove ai intern american chemic
IR/891 5 cluster datamin anna jan lar kai hansen informat mathemat model richard petersen build technic introduct abstract paper present hierarch probabilist cluster method learn datamin applic probabilist cluster base suggest generaliz gaussian mixtur model soft version generaliz gaussian mixtur model discuss hierarch scheme agglom base distanc metric scheme successfulli test artifici data segment hierarch method datamin give multilevel descript data relev applic relat inform retriev navig approach hierarch analysi agglom cluster suggest recent develop includ focu agglom probabilist cluster gaussian densiti mixtur probabilist scheme enabl automat detect final hierarchi level order provid descript cluster suggest interpret list prototyp data exampl list typic featur cluster generaliz gaussian mixtur model soft generaliz gaussian mixtur model address learn learn combin set label unlabel data relev practic applic due fact label exampl hard document categor discuss aspect model estim paramet gaussian cluster modifi em procedur disjoint set observ ensur high gener abil optimum number cluster mixtur determin automat minim gener error paper applic object categor text spot topic provid easi understand interpret larger text broader creat intellig search engin provid understand document content webpag ontolog generaliz gaussian mixtur model step approach probabilist cluster flexibl gaussian mixtur densiti generaliz gaussian mixtur model model densiti featur vector kx exp kj compon gaussian mix proport compon vector covari matrix paramet estim iter modifi em algorithm mean estim data covari independ combin set prevent notori overfit problem standard approach optimum number chosen minim approxim gener aic neg time number paramet learn paramet estim train set featur vector number sampl learn classif data set featur class label yn adapt gaussian class separ classifi optim rule maxim pc approach refer mixtur discrimin analysi implement hard soft assign data compon em iter step hard approach data assign cluster select highest mean covari estim classic empir estim data assign compon soft version mean estim weight mean experi version gave iter algorithm requir typic iter defin assign exampl cluster learn curv experi hard slightli gener perform small similar behavior larg cluster separ hierarch cluster suggest agglom cluster scheme start cluster level optim model case learn ky optim number compon pc class higher level hierarchi cluster merg base similar measur pair cluster procedur repeat reach cluster top level level cluster cluster final densiti cluster level mix densiti model level cluster level merg level natur distanc measur cluster densiti diverg reflect dissimilar densiti probabilist space drawback kl obtain analyt express level gener error function number exampl hierarchi distanc subsequ level approxim approach base distanc measur norm densiti dx index cluster due inequ distanc measur set cluster indic defin disjoint subset indic cluster constitut cluster level densiti cluster obtain similar definit gaussian integr dx defin vector ig dimens symmetr matrix distanc written figur illustr hierarch cluster gaussian distribut toi data uniqu featur probabilist cluster abil provid optim cluster level assign data exampl train assign cluster level threshold typic set procedur ensur assign wrong cluster probabl interpret cluster gener exampl level hierarchi distribut gaussian draw exampl region const cluster higher level hierarchi sampl drawn gaussian cluster proport µ µ µ µ distanc cluster figur hierarch cluster left panel scatter plot data cluster wide distribut narrow distanc base shape distribut cluster closer cluster panel present experi hierarch cluster illustr segment defin complet set uniqu word occur email email histogram vector frequenc occurr word defin content email matrix collect histogram email suitabl preprocess matrix train word email annot job spam model word remov word stem directli matrix deploi latent semant index oper latent space featur vector found project subspac span left eigenvector largest singular singular decomposit matrix investig method automat determin subspac dimens base gener concept found subspac good perform typic result run learn depict figur learn resembl correct categori level hierarchi compar learn label exampl lack hierarchi good multilevel descript data interpret find typic featur page origin keyword cluster tabl probabl distanc hierarchi level confer job spam cluster cluster probabl probabl hierarchi level confer job spam cluster distribut test set email cluster figur hierarch cluster upper row show cluster annot email label train set level level cluster categori job spam level cluster big resembl categori spam distribut cluster level high resembl categori averag probabl erron categori test set lower left panel show cluster lower panel show histogram cluster assign test cf page sampl obtain reliabl descript level reliabl higher level paper present probabilist agglom hierarch cluster algorithm base generaliz gaussian mixtur model metric densiti space lead simpl algorithm learn probabilist scheme automat cluster hierarchi level assign unseen data natur techniqu interpret cluster tabl keyword learn mac prototyp exampl featur algorithm successfulli appli segment email refer yang special machin learn inform machin learn machin learn inform extract inform machin learn cm bishop hierarch latent variabl model data ieee pami algorithm hierarch siam sci comput comparison cluster method proc conf art morgan pp approach hierarch mixtur model advanc nip pp learn mixtur hierarchi advanc nip pp ak mitchel text classif label unlabel document machin dj miller hs mixtur expert classifi learn base label unlabel data advanc nip pp lk model text generaliz gaussian mixtur proc ieee vol pp cl jr restructur high data effect retriev advanc nip mit pp lk hansen compon text adv comp pp lagu websom map document collect proc work em implement agglom hierarch cluster document inf proc man probabilist framework hierarch organ classif document submit journal intellig inform ed wiener jo pedersen exploit hierarchi text inform lk christiansen learn world wide comput statist data analysi lk christiansen learn world wide web proc nonlinear method data pp cm neural network pattern oxford hasti tibshirani discrimin analysi gaussian royal stat societi seri jc measur independ compon analysi proc ieee vol pp st gw tk landauer index latent semant amer soc inf
DB/892 3 complex aggreg multipl granular kenneth ross divesh srivastava columbia ny usa florham nj usa steven institut nj usa abstract datacub queri comput simpl aggreg multipl granular paper examin gener problem comput complex subqueri involv multipl depend aggreg multipl granular call queri combin month find fraction total sale item due supplier suppli minimum price show classifi cube base extent fine granular result comput granular classif includ algebra holist cube provid syntact suffici condit determin cube distribut algebra distinct import exist datacub evalu algorithm comput cube distribut complex evalu cpu perform comput cube datacub evalu algorithm ross srivastava varieti benchmark data demonstr cpu cost evalu distribut cube compar evalu simpl datacub show varieti holist cube evalu manag overhead compar distribut case introduct support system aim provid answer complex queri pose larg repres busi inform transact medic inform patient treatment scientif data larg set vast quantiti data inform answer question import applic user queri domain broken month find total sale includ dimens broken diagnosi find averag life includ dimens electron mail address author queri datacub queri datacub queri comput aggreg data varieti granular queri gener aggreg data granular includ total sale supplier supplier month month empti set total datacub comput separ comput aggreg granular comput aggreg coarser level granular time comput aggreg finer level granular algorithm present kind support queri consid involv aggreg queri multipl depend aggreg comput group queri find minimum price total sale minimum price tupl present extend sql syntax succinct queri studi demonstr queri effici evalu standard sql queri lead queri hard optim complex support queri multipl depend aggreg comput varieti granular queri queri replac phrase subset call queri illustr practic util queri number exampl main contribut paper classif classifi cube base increment extend notion holist aggreg gener context identif provid syntact suffici condit cube queri determin distribut algebra evalu queri perform import identifi syntact condit admit larg class cube queri express simpl datacub evalu present algorithm increment comput coarser granular output distribut cube finer granular output cube show algorithm conjunct techniqu effici evalu datacub evalu cube distribut complex discuss suitabl datacub evalu techniqu effici evalu holist cube perform evalu cpu perform comput cube datacub evalu algorithm ross srivastava varieti benchmark data demonstr cpu cost evalu distribut cube compar evalu simpl datacub show varieti holist cube evalu manag overhead compar distribut case sophist queri datacub queri incur cost exampl paper relat busi applic supplier suppli item custom unit price sale item order custom supplier date store price sale order date deliv delai dai background aggreg multipl granular grai al present comput aggreg data multipl granular refer reader syntax semant queri present aid intuit datacub group subset find total sale tupl write queri select suppli year cube month mean datacub union result sql obtain subset cube cube replac group attribut select replac special constant queri multipl featur group ross present extens sql queri multipl featur group relat refer reader syntax semant present aid intuit recal standard sql attribut group aggreg constant valu select month find total sale minimum price supplier item month sql extens write queri select suppli year group month mean queri understood tupl suppli relat satisfi condit tupl group base valu group attribut item month multipl group tupl minimum price tupl group variabl rang tupl group price equal sum sale tupl rang valu group attribut queri result cube work ross section motiv gener queri multipl granular queri time granular find minimum price supplier sum commonli call queri find minimum price supplier sum finer granular answer queri granular set group perform oper analog call cube queri group subset find minimum price tupl total sale minimum price tupl group subset find minimum price tupl fraction total sale due tupl delai dai price minimum price group subset find minimum price tupl maximum minimum delai set minimum price fraction total sale due tupl maximum delai set minimum price fraction total sale due tupl minimum delai set minimum price tupl select tp cond cube bk rm sm fig syntax cube queri queri express standard featur sql view cube express datacub argu result express complex lead queri difficult prefer extend succinct syntax cube combin syntax cube cube queri syntax figur cube ident syntact extens unchang standard sql cube cube combin cube specif group variabl rm group select cube ident syntact extens mean cube union result queri select tp cond group rm sm arbitrari subset fb select evalu special constant requir group variabl rang subset tupl group variabl rang simpli write condit notat conveni shorthand queri condit repeat express queri syntax select suppli year cube month select suppli year cube month select suppli year cube month classifi cube understand issu evalu classif base notion increment evalu definit cube queri attribut mention cube instanc attribut instanc involv special call group group level attribut set group level call denot set attribut group coarser finer attribut attribut granular group coarser granular group datacub cube evalu multipl pass base data evalu techniqu requir larg number datacub distribut aggreg terminolog evalu increment comput output datacub coarser granular output datacub finer granular captur properti definit distribut cube definit cube syntax figur denot arbitrari subset cube attribut fb subset denot select tp cond group rm sm select evalu constant queri distribut cube comput function comput proposit datacub distribut aggreg function distribut cube show queri distribut cube comput aggreg granular month group comput aggreg granular item combin twelv pair valu annual pair comput minimum monthli valu annual add month monthli equal annual annual cube aggreg function select distribut queri illustr queri determin fraction total sale due tupl delai dai price minimum price weve comput aggreg granular month group comput aggreg granular item simpli combin twelv tupl valu global tupl valu minimum price year januari combin januari yearli fraction tupl price figur includ contribut tupl price cube cube ad aggreg select modifi cube distribut datacub select extend distribut cube ad select averag sale coarser granular comput averag sale total sale finer granular definit holist cube algebra cube exist obtain ad aggreg select distribut holist cube queri exampl holist cube extens queri distribut identifi distribut cube identifi natur syntact condit cube distribut step defin binari relat group variabl rm base pattern attribut refer definit oe group variabl group variabl condit refer attribut defin oe transit closur note syntact restrict condit section partial order step identifi pattern access group relationship tupl group group variabl rang definit identifi import access pattern group variabl definit group variabl group variabl rang subset tupl rang import understand oe necessarili impli show condit group variabl relat partial order essenti cube distribut condit attribut impli condit attribut case identifi simpli check shorthand cube defin captur import relationship group natur defin condit group variabl definit cube cube queri cube graph denot acycl graph defin node group variabl rm cube addit node direct edg exist node edg form add edg edg node refer parent node path node refer ancestor node node empti label node label aggreg condit defin condit part label ancestor queri queri queri fig cube graph figur present cube graph queri final step identifi condit distribut defin mean set aggreg function attribut distribut gener singl distribut aggreg function definit set aggreg function attribut aggreg function distribut algebra aggreg function aggreg function attribut provid addit inform increment comput set set distribut theorem cube queri denot set fr group variabl queri distribut condit set select distribut oe impli cube graph tree aggreg condit node aggreg condit node form written simpli ak parent aggreg form queri select queri queri satisfi condit theorem condit queri violat condit condit theorem easili modifi identifi algebra shown full version paper evalu cube evalu cube distribut queri repres holist queri repres queri algebra queri evalu transform distribut distribut function definit distribut cube requir exist comput function output cube coarser granular comput output cube finer granular cube simpl comput output coarser granular output finer granular simpl standard sql aggreg function coarser group comput maximum valu finer coarser group comput sum valu finer group present function simpl cube queri comput minimum price tupl total sale minimum price subset specif satisfi condit theorem give function comput coarser granular result finer granular result queri fv group fine coarser group gener output aggreg group pair form minimum total sale process group adjust aggreg coarser group local flag initi set indic group process note output cube finest granular comput function comput perform techniqu suggest set end return cube graph queri simpl chain singl group figur gener algorithm applic condit theorem satisfi deal group variabl cube full version paper algorithm distribut cube algorithm comput datacub detail algorithm import algorithm attempt comput datacub util lattic structur granular finer granular result combin give result coarser granular algorithm perform optim base estim size answer group datacub crucial featur distribut cube algorithm mention coarser granular aggreg comput finer granular aggreg distribut function comput coarser aggreg automat deriv function plai role addit plai evalu datacub aggreg sum size output group constant tupl fix size easili deriv queri syntax estim techniqu algorithm estim size intermedi emploi optim strategi result clear algorithm appli distribut cube complex compar simpl datacub harder comput simpl aggreg cpu cost address concern detail section holist case algorithm comput datacub divid algorithm main memori essenti store input typic partit sort fashion datacub tupl immedi flush output buffer algorithm main memori essenti store typic arrai algorithm approach suit comput holist cube reason approach lend possibl maintain tupl group input relat simultan comput holist aggreg group maintain partial comput obtain scan input increment comput perform holist cube evalu techniqu ross srivastava implement varieti cube queri softwar extens respect aggreg function arbitrari distribut aggreg function written link code distribut softwar work combin tupl share cube attribut singl tupl combin function exist distribut multipl sort scan step comput cube holist initi combin step multipl sort scan step comput cube result unlik case distribut fine granular result comput granular aggreg comput separ granular cpu perform measur gener ultrasparc run solari machin input relat fit ram expect analog result larger tabl divid conquer approach report time cpu time report oper close time cpu time measur commenc input write output result suppress order avoid introduc cost ran cube number comparison ran datacub number distribut aggreg function holist queri run input includ cube attribut aggreg attribut data sourc randomli gener data data gener benchmark data measur cloud coverag globe period month mean attribut tabl part supplier date return discount quantiti price code cloud latitud longitud dai hour weather total cloud code amount amount random uniformli gener queri output tupl group queri output maximum tupl maximum group select minimum maximum minimum maximum valu group maximum group output queri find maximum comput maximum tupl tupl tupl maximum queri find maximum maximum group comput maximum tupl group greater greater maximum maximum comput input tupl satisfi output tupl gener queri output maximum queri output maximum minimum valu cpu time uniform attribut cardin vari attribut cpu time tupl attribut cardin fig perform random dataset present perform graph figur show perform random dataset left fix input size vari attribut cardin low cube number combin input cube attribut smaller number tupl high cube graph show edg aggreg function perform fairli narrow rang distribut function perform substanti holist function reason behavior initi combin step perform distribut aggreg holist aggreg distribut initi data set tupl combin cardin mean subsequ work perform tupl tupl show perform scale number tupl attribut cardin number tupl densiti gradual holist cube begin edg graph curv divid group curv group close group consist consist output output aggreg complex determin number output column distribut aggreg function simpl complex neglig appar overhead evalu complex distribut cube compar simpl datacub number output column cpu time tupl tpcd data cpu time tupl cloud data fig perform cloud dataset remain figur show perform cloud data set data similar perform characterist random data set cloud data set show similar densiti issu edg point tupl remain initi combin step holist cube significantli distribut comput involv cpu cost manag consid cube natur class complex queri involv multipl depend aggreg comput multipl practic classifi cube queri increment coarser granular result comput finer granular result identifi syntact suffici condit recogn cube distribut algebra shown number exist algorithm evalu optim distribut cube neglig cpu cost import subclass cube queri difficult comput datacub includ sophist queri easili express datacub queri author introduc algebra oper syntax data analysi consid issu multipl depend aggreg group specif exampl present paper approach requir multipl view lead problem outlin acknowledg ted johnson comment paper research kenneth ross support grant david packard foundat fellowship scienc sloan foundat nsf young investig nsf cise award refer sarawagi comput aggreg page sarawagi model ieee ross queri multipl featur group relat page pirahesh datacub relat aggreg oper gener ieee page microsoft technic report london edit cloud report ship land station li wang data model support analyt process page ross srivastava fast comput datacub page srivastava complex aggreg multipl granular technic transact process perform council suit san ca usa tpc benchmark naughton algorithm simultan aggreg acm page articl process macro packag llnc style
ML/893 6 distanc neural method hf depart comput nichola institut gener framework minim distanc method present radial basi function perceptron neural network includ framework special case version minim distanc method formul test dataset obtain encourag result introduct classif import applic neural system accuraci pattern recognit statist classif system compar recent larg dataset consist trend observ result studi classifi find dataset result excel result bad real world applic good strategi find classifi work data frequent simpl nearest neighbor method method method natur neural realiz recent present gener framework minim distanc method framework extend result test version md method present simplest classif algorithm applic pattern recognit problem base neighbor rule approach import artifici intellig refer instanc base memori base learn case base learn train data vector label class belong treat refer vector classif nearest refer vector unknown vector class vector determin probabl assign vector class ci simplest case nearest neighbor determin class unknown asymptot error rate classifi limit larg larg number refer vector equal optim bayesian valu practic number refer vector small small valu work method simpl frequent standard refer classif problem comput complex actual demand refer vector calcul distanc find smallest distanc oja claim realist pattern space hard find variat rule significantli lighter brute forc hierarch scheme partit data space hierarch cluster scheme effect search nearest neighbor easili train time optim short nearest neighbor method suitabl complex larg train dataset expert altern system neural model explicitli base nearest neighbor ham network comput ham distanc binari pattern find maximum overlap prototyp realiz rule minim distanc method present natur type realiz concentr present gener framework test specif method deriv framework network implement initi stage implement secondari import section gener framework md method present relat neural md method explain section result test real dataset short discuss present section ii framework minim distanc method problem classif state set train vector vector unknown inform provid distanc estim probabl classif describ classif model valu procedur gener model adapt system classif includ number refer vector account neighborhood metric function comput maximum size neighborhood weight function estim contribut refer vector classif set refer vector creat set train vector total cost function minim train kernel scale influenc train total cost function select paramet procedur context network comput lead version md neural method analyz detail gener framework relat neural network md method explain threshold neuron comput distanc natur input signal weight neuron input threshold θ realiz θ norm defin ham distanc interpret weight neuron hidden layer address refer vector input space threshold neuron activ input fall hard sphere radiu θ center chang binari real valu threshold sigmoid transfer input weight normal soft activ neuron input vector close unit sphere realiz gener output function neuron σ normal input vector sigmoid function monoton grow transfer simpli evalu influenc refer vector depend distanc classif probabl function distanc output function monoton reach normal weight input part rang sigmoid function normal arbitrari rang sigmoid argument li interv sigmoid maximum curvatur smaller weight norm network oper linear regim regular method add penalti term error function forc weight small smooth network approxim train data mlp network sigmoid function estim influenc weight vector distanc weight train combin estim comput final output rbf network euclidean distanc function exponenti weight function chang distanc function equat type neural network defin interpret neural classifi special md adapt system worth investig combin weight distanc function addit paramet larg number classif system obtain variant md method present network simplest version lead method train dataset refer set distanc function metric function variabl radiu neighbor vector fall insid sphere type metric function paramet optim train vector class border nearest vector class error train equal larger valu test recommend optim train set test easi perform method learn metric function problem select avoid ti sever restrict ti resolv reject case ti ad extra neighbor vector tie number neighbor vector randomli brake tie give probabl detail procedur rare practic clear possibl experi ad vector break tie prefer differ classif accuraci neglig neural realiz rule binari pattern afford ham network network significantli simplifi complex output network node normal vector output unit determin hidden node maximum input receiv transfer class label node output algorithm enforc neighbor radiu adapt paramet number classif probabl classif optim method valid set hard sphere transfer function network realiz algorithm reject vector refer vector fall radiu equal probabl classif class obtain avoid problem uniqu classif introduct variabl ri refer vector radiu input space improv method number adapt paramet significantli develop line lead restrict energi classifi introduc cooper treat hard limit approxim rbf network neighbor found train vector sphere refer largest radiu sphere overlap sphere class train vector fall rang sphere wrong class radiu sphere shrink leav vector sphere posit sphere optim algorithm lead direct lvq algorithm vote method classifi success number ri reduc independ valu select input space area optim compon radiu total distanc separ distanc individu input give result optim metric function reduc number paramet variabl attach center cluster assur smooth transit region input space interpol valu nearest cluster center recommend soft weight algorithm nearest refer vector influenc probabl classif strongli lai chang hard sphere transfer function smoother function includ weight favorit fuzzi logic membership function conic radial radiu grow linearli insid radiu classif probabl calcul output node dn dn max plai role weight estim contribut refer vector distanc soft algorithm paramet optim radial basi function network gaussian transfer function soft weight md algorithm weight function includ combin sigmoid dn dn variabl equal distanc neighbor weight function vector insid radiu rk distanc neighbor rk conic weight function broad vector receiv α approach furthest neighbor weight approach md classifi optim α accur nn effect weight pronounc larger valu distanc measur calcul distanc base euclidean metric input ham metric binari input addit paramet optim global input local refer metric involv paramet α scale factor paramet α α euclidean metric correspond α manhattan metric α sensit direct axi direct axi simplest rbf version gaussian function paramet optim independ optim compon effect optim scale factor si method euclidean metric scale simplest attribut mahalanobi distanc obtain appli linear transform input vector metric tensor provid adapt calcul distanc refer provid larg number adapt paramet local coordin system origin refer vector provid local scale factor local metric tensor simpl select featur classif time lower complex classif model add cost function addit penalti sum ij featur product scale factor small delet loss accuraci addit optim scale factor accuraci reason modifi differ metric gain popular distanc vector discret class comput condit si estim calcul number time featur aj occur vector belong class divid number time featur aj occur class defin featur comput differ featur metric defin matrix number row equal number class number column equal number attribut gener valu requir set probabl densiti function discret procedur adapt system provid distanc function md method typic mlp network train differ pair vector give output distanc class output neural network md procedur input mlp set attribut function scale similar function properti requir distanc smoothli chang region input obtain train vector nearest neighbor select initi similar epoch process repeat similar function gener creat distanc function minim distanc maxim distanc activ select refer vector md method avoid larg number refer vector reduc number vector refer set lead model lower complex improv gener capabl classif system cluster techniqu select small number initi refer vector close cluster center classif accuraci check remain set nn wrongli classifi vector move train refer set variant valid set determin candid refer set altern approach requir initi cluster start train set nearest vector class vector cluster border vector neighborhood unambigu classifi approach lead cluster start larg number neighbor remov vector center cluster reduc step interest algorithm select good refer vector run vector determin nearest vector class move vector refer set algorithm leav vector class border refer vector activ select refer vector leav small subset train vector optim posit train error refer vector neighborhood train vector updat η learn slowli class rule move center move nearest move neighbor η optim subset close center cluster virtual support vector ad refer set improv classif rate simplest approach interpol exist train vector add neighbor vector belong class case data cluster belong class separ shift border improv gener minimum threshold distanc vector class prevent creation overlap vector distribut select kernel function error function choic kernel function measur classif error discuss local regress base md approach error function simpli ref desir valu valu predict model kernel function measur influenc refer vector total error high peak function fit valu refer input vector make larg error valu weight function estim distanc classif problem kernel function determin size neighborhood case accur classif requir cost function classif error output valu provid minim risk sum run train vector risk specifi paramet classifi minim error sum run train exampl xp model classifi xp vector refer set comput iii result framework minim distanc method previou section lead method classif approach frequent popular neural machin learn classif method md method present improv result test simplest choic real artifici data result report base number neighbor tie broken manhattan distanc function studi detail comparison scale data approach show small dataset result belong report mlp result fsm result test compar result append good significantli improv scale asa mlp level wisconsin breast cancer data result obtain scale result slightli test crossvalid give accuraci hepat data scale result asa optim excel scale result cleveland heart data result obtain fsm show distanc function case cluster size region input dataset creat real medic test screen problem peopl healthi case belong normal case belong primari group total case train case test neural classifi give accuraci test set optim mlp train variant backpropag cascad correl algorithm perform tediou genet optim mlp network architectur result studi local adapt reach accuraci test logic rule deriv method reach accuraci result give obtain case optim metric result raw standard scale metric optim method reliabl number refer vector larg data unit disappoint soft lead improv optim weight conic function optim radiu found adapt result significantli failur anneal simplex minim method minimum distanc method global paramet find scale factor paramet case requir studi data uci repositori dataset includ machin learn detail descript found medic data includ sonar ti obtain train test wisconsin breast cancer data data scale factor cleveland heart optim method hepat accuraci larger dataset significantli result detail medic dataset strongli slightli result obtain normal miss valu featur conic number neighbor replac class vowel method tabl wisconsin breast cancer hepat cleveland heart data dataset method append data rule asa wisconsin breast cancer data scale asa fsm hepat data cart lda fsm scale asa cleveland heart data cart lda scale asa fsm case scale improv accuraci combin scale artifici data monk problem scale method monk problem accuraci problem case mlp obtain problem optim case error due ad iv summari discuss gener draw preliminari result scale individu featur import bring substanti gain accuraci reduc number featur scale select fix number neighbor work optim radiu number neighbor count optim number neighbor small weight procedur contribut significantli accuraci result tabl ii result dataset scale sonar vowel achiev local weight function similarli adapt individu great soft weight perform minim distanc point view lead fruit framework method accommod found method literatur improv simpl scheme hasti tibshirani write adapt classif linear discrimin point advoc local metric area input friedman interest adapt metric base interact partit data oja improv refer vector lvq techniqu moor schaal discuss local weight regress minim distanc method metric kernel function appli approxim problem accommod gener framework present mlp rbf network exampl neural md method identif combin procedur adapt paramet improv result achiev neural classifi possibl creat fuzzi model remain explor perform method classif depend natur data classif remain subject empir studi preliminari result dataset obtain method bear mind test simplest method small encourag support wd kg polish scientif grant gratefulli acknowledg refer theoret account classifi neural comput neural minim distanc proc conf neural network oct pr ln handbook statist pattern recognit reduct amsterdam classif learn neighbor june pp dl handbook brain theori neural network press pp rp introduct comput neural ieee magazin signal speech process converg ham memori tran neural network dl ln neural model categori biolog cybernet pd advanc method neural network nostrand reinhold fe neighbor distanc network class boundari featur pp cg aw moor local weight artifici intellig review adapt simul anneal lesson control cybernet cj pm uci sm empir comparison pattern neural net machin learn classif jw shavlik tg read machin morgan kauffman ca extract crisp logic rule constrain backpropag network pp logic rule classif medic data neural pp hj rule induct algorithm base approxim tech rep cs regina featur space map adapt comp phy comm comparison optim backpropag brussel pp synthesi perform analysi neural network tech rep discrimin adapt nearest neighbor ieee pami flexibl metric nearest neighbor technic dept stanford
ML/894 6 navig comput model rat septemb navig comput model rat approach autonom navig base compon rat navig spatial model environ construct hebbian learn consist popul local overlap place model place cell activ rat place eld establish extract properti environ visual sensori input visual ambigu resolv mean path integr reinforc learn appli place cell activ navig result obtain mobil khepera robot present autonom place reinforc popul vector path integr introduct complex autonom navig task inher concept autonom agent complet control system capabl adapt behavior situat face tradit approach base intern model world endow robot symbol problemat task centr system swiss feder institut technolog lausann real complex environ make imposs design knowledg agent system interact typic corrupt unknown distribut model tend design human robot sensori system recent research autonom robot move approach term robot idea agent build behavior mean experi principl design robot inspir basic behavior mechan observ biolog system adapt strategi neural plastic learn reinforc learn evolutionari techniqu successfulli address problem design adapt system autonom navig unpredict real environ solut base reactiv behavior agent learn map incom stimuli action order perform control polici accomplish build intern spatial model environ kind navig agent biolog counterpart simpl anim ant complex biolog organ explicit spatial emploi cognit support perform navig complex context studi neurophysiolog structur mammal exhibit spatial properti structur brain thought plai function role navig due evid neuron place rat place cell maxim rat region place eld cell place cell activ encod spatial locat anim recent nding show exist neuron function rat head orient horizont plane cell observ format provid rat neural compass place code direct crucial capabl solv spatial learn task lesion rat impair rat navig skill support idea plai function role navig understand underli mechan place cell activ attract prospect design system emul navig skill give short account model approach discuss greater detail forthcom navig comput model rat paper state art princip theori distinguish cognit map theori okeef involv spatial learn navig theori identi brain region provid neural rat locat environ altern theori memori theori formal marr theori hold temporari memori devic capabl store retriev sequenc pattern theori receiv wide support data framework navig model theori converg spatial locat recogn compar current sensori input memori visit place rumelhart suggest mechan competit learn format place cell idea reli evid feedback inhibit hebbian synapt plastic occur navig model place cell base idea roll okeef brown sharp place navig strategi explor abbott navig system base tempor asymmetr potenti depress place cell touretzki develop model role navig integr function region brain interact franz structur learn cognit map sequenc view action gaussier model place cell activ speci contribut memori consolid process meyer comput model build topolog environ sequenc visit place dayan model cell form attractor recurr network elimin place eld import memori buckingham implement marr model roll formal model anatom region achiev function work levi aim realiz neural network model region figur architectur overview neural model stimuli combin yield space navig base place cell desir reward mobil khepera robot equip model role memor tempor sequenc event identifi region path integr system interact extern sensori input guid rat spatial behavior barn suggest inform theoret approach understand role memori learn intermedi posit harri multilevel structur provid absolut local environ recognit base place cell activ claim marr theori consist involv spatial behavior learn neural encod anim spatiotempor knowledg context thought memori time function retriev inform guid navig similar view levi spatial build place field shown place eld determin combin mutual relationship code current anim locat experi rat show visual landmark place ident place cell maintain stabl recept eld absenc reliabl orient cue suggest complex architectur multimod inform learn maintain place eld navig comput model rat propriocept inform partial replac extern stimuli model reli idea process build maintain place eld extern stimuli visual discrimin distinct spatial locat result spatial consist local view hypothesi suggest intern stimuli propriocept integr time provid combin form stabl place eld spatial consist larg popul place cell ensembl activ encod anim locat spatial navig achiev base place cell desir reward stimul order valid model test real mobil khepera robot vision system consist linear camera cover azimuth rang intern inform provid infrar sensor endow robot obstacl detect capabl learn place field recept eld learn extract properti environ visual sensori input incom visual stimuli interpret mean neuron respond combin visual pattern ltere properti distanc egocentr orient visual cue measur explicit imag process neural architectur built increment appli hebbian learn activ neural lter propag model yield place cell activ model visual input imag map space set class lter class correspond visual pattern set lter class correspond dioeerent frequenc pattern walsh index length repres imag cluster lter highest correl convolut max jx ja call set activ lter sc ff snapshot cell figur exampl recept eld cell layer darker higher ring rate cell robot region environ visual input maxim activ con local spot environ recept eld multipl peak indic similar visual stimuli occur dioeerent locat threshold lter consid activ snapshot cell activ depend current sum lter form cell function normal chosen visit locat robot snapshot west maintain snapshot activ depend current view locat environ snapshot form local view snapshot cell activ depend current gaze code spatial locat order achiev spatial discrimin appli learn creat popul cell downstream snapshot layer anatom counterpart neural layer cortex call neuron sec cell time robot simultan activ snapshot cell connect newli creat sec cell model rat system present provid robot neural compass region main cortic input region record cell show spatial correl tend place eld area navig comput model rat random weight index sec cell snapshot ring activ snapshot cell ij ffl activ threshold neuron consid maxim random ring rate sec cell averag activ neuron ij ij chang hebbian learn ij ij connect snapshot cell sec cell creat number maxim ring sec cell locat exce threshold simpl techniqu system control redund result neural call learn scheme eq grow network sec cell driven set snapshot cell activ code visual featur environ activ sec cell depend combin multipl visual cue result ensembl sec cell activ code spatial locat fig show exampl place eld layer model darker higher ring rate cell fig show cell activ robot local region environ robot center eld task fig show cell multipl activ sec cell encod ambigu visual recept eld identi dioeerent spatial locat yield similar visual stimuli cell layer type type solv ambigu visual input intern inform provid path integr order visual data mean intern gener neuron driven path integr system hypothet cell model inform mean neural activ robot pi cell activ propriocept stimuli robot orient provid system ring rate cell gaussian exp dr dr posit estim center eld cell oe width gaussian eld activ pi cell place eld pi cell chang environ environ spatial provid pi place eld place medial cortex repres inform neural activ make straightforward correl visual inform inform appli hebbian learn place field visual sensori input integr drive activ neural spatial form cell project layer mean downstream increment creat appli grow network scheme simultan activ sec cell connect creat place cell repres cell sec creat eq chang hebbian learn ring rate place cell weight averag activ cell hebbian learn learn place cell cell repres cell synapt weight ip establish ip ip place cell activ depend neural combin yield stabl spatial fig show typic recept eld layer model interpret neural popul activ model learn spatial consist larg popul place cell overlap place eld fig show record data cell medial cortex show place eld topolog preserv properti dioeerent environ navig comput model rat figur typic recept eld threedimens place cell layer darker higher cell ring rate robot region environ show maxim cell activ bound arena khepera robot wall cover xed random sequenc black white stripe variabl width combin stripe form visual input pattern linear vision system fig show popul place cell creat robot learn dot repres place posit repres center cell place eld place cell cover environ uniformli ensembl network activ correspond robot locat fig interpret ensembl network activ popul vector decod scheme ring activ cell locat cell popul vector center mass network activ fig center mass encod robot posit repres white cross robust estim robot posit interpret monitor made explicit correl place cell activ underli frame refer place cell vector repres estim locat robot creat cell sec figur cm test environ khepera robot learn popul place cell ensembl activ correspond robot posit shown darker higher ring rate explor odometri calibr odometri vulner cumul error util visual inform path integr system robot adopt explor strategi emul exploratori behavior anim start explor nest creat place cell model environ explor proce assum odometri calibr xed time cal cal robot stop creat place cell start home vector return nest locat visit locat necessarili learn spatial local sec cell activ perform calibr process sec center mass sec cell activ oe varianc activ assess reliabl sec cell activ xed varianc threshold oe spatial locat sec encod sec activ suitabl robot weight ff ae oe oe comput calibr robot posit ff sec dr dr posit estim dead reckon system robot calibr stop home vector explor resum techniqu robot explor environ odometri error bound rang fig show calibr versu uncalibr odometri error navig comput model rat figur varianc oe cell activ center mass oe spatial locat calibr robot posit uncalibr dead reckon error versu calibr robot posit explor session time step spatial learn map accomplish function role cognit support model incorpor knowledg relationship target obstacl turn stabl place eld natur basi learn navig map appli approach deriv map base place eld spatial method consist store navig knowledg recurr neuron connect place cell learn mean tempor asymmetr potenti depress synapt dynam recurr network neural popul activ map shown place eld natur start point appli learn deriv navig map reinforc learn continu space popul action cell nucleu activ direct motor command type target structur involv goal memori behavior figur place cell project action cell target nucleu reinforc learn function map continu spatial locat action food action cell east driven popul place cell place cell action cell modi learn continu map function task potenti associ spatial locat reward action learn function continu locat space endow system spatial gener capabl robot associ action spatial posit overlap local place eld layer provid natur set basi function learn map function robot locat action cell nucleu denot activ place cell activ action cell robot posit encod place cell activ number place cell synapt project place cell action cell activ depend linearli activ vector synapt weight learn task consist updat approxim optim function map state action cell activ linear version watkin algorithm robot posit interpret neural activ action locat environ navig comput model rat experi behavior target region feed environ learn session consist sequenc train path start random posit lead target time robot reach train path begin random locat learn discret set action popul vector code appli map continu action space averag ensembl action cell activ posit action oe sin oe direct environ encod action cell activ nucleu aw princip direct eq result smooth trajectori robot behav order consolid path rout singl target task fig show view arena fig dark squar repres locat white object obstacl notic infrar sensor detect transpar respect vision system fig show navig map learn robot train trial train path random start locat vector eld fig obtain raster uniformli environ dot repres sampl posit pointer direct calcul eq posit solid line shown fig robot trajectori start locat learn navig map multipl target task learn scheme appli multipl target type ft tm set distinct target type food water target set map function set synapt weight distinct reward signal fr tm experi distinct type reward stimul fig show target locat figur view environ locat grei obstacl robot trajectori induc action cell activ learn vector eld learn navig map bottom environ learn session start locat primari task robot approxim function navig map learn train trial shown fig notic search food happen robot encount water locat receiv posit reward signal respect inform exploit robot adjust weight current robot partial learn navig map lead fig show knowledg water locat acquir robot learn optim polici reach food robot decid focu water target approxim action cell start knowledg result shorter learn time robot progress fig present navig map learn robot train trial water discuss present comput model rat studi role spatial learn navig stress import combin stimuli stimuli path drive place cell activ region properti environ extract visual inform navig comput model rat figur arena distinct target type white rectangl obstacl navig map food reward locat partial navig map water locat learn robot food nal map acquir robot water order distinct region environ combin visual cue distinct spatial locat provid ident visual view manifold repres visual input space singular order remov hebbian learn appli correl intern inform visual inform combin intern extern stimuli yield stabl place eld visual data mean path integr neural activ reliabl visual inform path integr system hebbian learn appli build place eld start prior system grow increment agent interact environ redund place cell activ consid crucial properti yield robust system develop spatial consist larg popul overlap place eld cover environ uniformli learn appli achiev navig base learn place eld popul activ neuron nucleu map physic locat action reinforc learn continu space appli adjust place cell action cell nucleu robot platform evalu model real context robot tool valid hypothesi function process biolog inspir solut yield potenti understand model biolog solut result autonom navig system fact agent simpler transpar biolog make appeal understand natur underli mechan anim behavior appli learn scheme shown design autonom agent approach present paper stress import continu interact real robot environ result increment dynam develop navig make robot adapt behavior situat experienc gener refer hc andrew comput techniqu imag process academ del spatial model state space reinforc learn technic report swiss feder inst technolog model place cell tempor asymmetr action learn neural network int springer verlag spatial cognit model place cell activ submit biolog navig comput model rat ca bl bw lh lin comparison spatial tempor characterist neuron activ sequenti stage process op understand brain region model studi brain structur volum progress brain page elsevi scienc publish beer intellig adapt experi comput academ san ht blair pe sharp anticipatori head direct signal anterior evid circuit integr angular head motion comput head direct ki blum lf abbott model spatial map format rat neural ra brook approach robot page ma brown pe sharp simul morri water maze neural network model nucleu okeef model function neural dt comput manifesto meyer anim proc int conf simul adapt mit book dorigo robot shape mit georgakopoulo maurer role dead reckon navig sue spatial chapter page oxford floreano mondada evolut plastic neurocontrol situat agent anim animat proc fourth int conf simul adapt mit book competit learn method system inst neural jp build ground symbol local motiv fourth european conf page ap neuron popul code movement direct lf abbott learn navig map potenti modul place cell comp ant path integr neural architectur biol jj hs bl place head direct learn landmark stabil dayan spatial relat environ recurr model area rat neural network int springer verlag cl rw js head direct cell record nuclei rat soc neurosci wb ra baxter function int neural ja meyer anim animat mit ha mo hh approach visual navig spatial memori jd neural network int page springer verlag ej ca bl vl spatial inform content reliabl visual input marr simpl theori tran soc bl neural mechan spatial comput inform storag rm neural mental chapter page mit ml home path integr mammal okeef cognit map clarendon autonom agent robot autonom gj ru jl ring place cell dark depend rat recent experi navig comput model rat gj ru jl jb jr posit ring properti medial descript comparison place cell kd harri memori navig model support marr theori function ad cognit map phd dep comput carnegi mellon ad ds touretzki cognit map de rumelhart featur discoveri competit learn de rumelhart jl parallel distribut process mit press bl theta rhythm memori tempor sequenc event int neural rs sutton ag barto reinforc introduct mit js head direct cell record anterior nuclei freeli move rat js ri jb jr head direct cell record freeli move rat descript quantit analysi roll comput analysi role memori ca barn explain function ja meyer place sequenc learn navig jd neural network int page springer verlag si ja meyer navig review prospect progress sejnowski associ memori place cell int neural dj willshaw jt buckingham assess marr theori temporari memori store tran soc
HCI/895 4 statist pattern recognit techniqu multimod human comput interact multimedia inform process depart comput faculti electr engin germani germani paper present extens overview statist pattern recognit method varieti di erent relat multimod interact multimedia inform process typic task area interact includ handwrit gestur retriev imag multimedia inform process includ algorithm document video index face recognit aim paper demonstr speech commun usabl classic speech recognit hidden markov model relat statist pattern recognit larger varieti relat problem ecient process retriev multimedia inform introduct hidden markov model repres statist pattern recognit techniqu consid power tool speech recognit ecienc hmm basic fact hmm perfectli suit warp pattern arbitrari major reason ectiv learn capabl hmm larg advantag includ decod capabl hmm abil perform recognit segment singl step turn capabl varieti challeng pattern recognit problem expect problem includ process speech signal true applic handwrit recognit gestur applic directli impli gener featur deriv pen input case handwrit video sequenc case gestur recognit applic happen popular modal interact shown hmm restrict model process hmm imag space subdivid imag spatial order segment serv substitut order arti cialli gener sequenc process hmm imag warp vertic horizont lead elast match capabl imag hmm explicitli explain fundament assum peopl activ speech recognit concentr present exampl hmm applic area mention handwrit recognit obviou popular applic area hmm speech hmm handwrit recognit true handwrit pen trajectori captur case interpret pattern sequenc turn superior learn abil warp capabl exist fast ectiv decod procedur connect pattern major advantag hmm tradit pattern process techniqu handwrit recognit todai power larg vocabulari handwrit recognit system base handwrit letter alphabet repres hmm hmm state letter repres di erent section topolog import uenc product letter model import connect letter order build hmm entir word speech major hmm compon output observ consist probabl densiti function model gener stroke state handwrit featur extract pen trajectori dynam inform handwrit product process turn improv obtain static featur incorpor recognit process larg vocabulari handwrit recognit system develop author evalu angl spatial resampl stroke sin di erenc consecut angl pen pressur write vector repres bitmap slide pen trajectori order incorpor fraction actual imag written letter fig show featur hmm topolog typic handwrit recognit pixel pixel da figur hmm model handwrit product process typic featur recognit interest question handwrit recognit choic correct model techniqu group present rst systemat investig problem compar continu hybrid model techniqu demand larg vocabulari handwrit recognit task turn hybrid techniqu base inform theori principl perform case advanc handwrit recognit system capabl handl vocabulari word recognit accuraci recognit stochast model imag sequenc mention due fact time seri model success origin applic hmm paradigm obviou natur choic question principl statist theori stochast model techniqu imag sequenc suitabl applic imag sequenc process hmm involv recognit classi cation imag sequenc typic applic found area gestur track surveil turn hmm ecient research group perform extens investig hmm imag sequenc process area area imag sequenc process recognit develop complex demand research area recent descript activ carri area scope paper concentr descript approach gestur recognit gestur recognit gestur recognit typic problem requir ectiv combin di erent challeng comput capabl deal imag sequenc imag requir handl exibl object comput score order classifi motion object video sequenc hmm research group order deal approach requir complic segment major base idea track part human bodi carri gestur classic hmm gestur recognit base track hand evalu featur sequenc deriv track process hmm lead problem due fact involv track process complic free error gestur recognit person equip special sensor facilit track wear special cloth perform gestur front speci ed background outlin detail capabl avoid limit enabl gestur recognit unconstrain addit equip background limit calcul imag frame video sequenc repres gestur global motion describ gestur moment deriv di erenc imag video sequenc turn featur conveni visual show center graviti motion motion varianc ax ellipsi fig show investig gestur comput overlai motion ellipsi figur typic gestur overlai ellipsi repres motion featur garbag model techniqu er hmm model addit motion person perform reloc imag simpli relax gestur result gestur recognit system recognit spontan perform arbitrari unlimit perform sequenc adjac gestur special decod capabl hmm recognit process enabl recognit spontan perform gestur detail video segment index turn global motion featur gestur recognit system suitabl describ video sequenc carri inform wide rang di erent found movi tv materi suggest immedi content recognit video present approach index tv hmm turn segment capabl hmm segment typic content special item major innov approach case hmm di erent content class typic magazin result hierarch stochast model content class highest featur indic elementari segment cue lowest level integr larg stochast shown fig detail approach found begin cut window chang newscast newscast interview cut dissolv wipe cut report weather forecast cut cut end interview newscast newscast interview person cut cut figur stochast video model index tv stochast imag model hmm origin popular hmm area time seri classi signal vari time ecient model nonlinear time warp capabl hmm shown comput vision problem involv pattern process classic hmm approach appli pattern vari space speci comput vision task solv elegantli hmm present introduct foundat classi cation shape hmm hidden markov model order classifi shape object natur imag elast match capabl hmm lead deform toler recognit mode featur sequenc built imag shape order calcul kundu radii center graviti shape featur extract techniqu due limit classifi close contour unconstrain shape shown fig shape pair sucient outer geometri order overcom polar subsampl techniqu illustr fig shape matrix shape geometri account class classi ed rotat invari mode rotat invari achiev number preprocess step aim rotat shape orient step base geometr properti elong axi minimum radiu point preprocess procedur complic lee carri origin hmm dj figur featur extract hmm structur rotat variant recognit shape experi similar class close contour task kundu preprocess step rotat pattern prior featur extract featur radii center graviti shape boundari major di erenc approach classi cation techniqu base vector quantiz hmm approach util polar subsampl techniqu combin hmm classi er util complic procedur base rule geometr make combin segment classi cation abil lead eleg solut problem invari shape recognit pattern spot hmm filler state rotat invari recognit shape polar sampl perform adapt shown fig sampl polar coordin origin cog sampl raster fig express denot sampl imag sampl interv radiu interv determin divid radiu rmax xed number dimens featur note featur extract rotat variant sampl model scheme fig lead rotat variant recognit mode order achiev rotat modi ed concaten ller model ller model copi origin initi train hmm shown fig attach front origin rst hmm model modi ed initi state distribut vector nal model modi ed hmm end featur sequenc reach compon vector uniformli set denot number state origin model step express rotat angl equal concaten modi ed hmm illustr fig featur sequenc object rotat respect shape train origin present concaten origin model align part sequenc viterbi algorithm fig lead high probabl object similar shape fig align sequenc markov model rotat angl estim number featur align rst number featur denot filler model origin hmm filler model origin hmm filler model filler model figur align present featur sequenc origin hmm filler model rotat angl estim typic pattern spot problem solv hmm ecient elegantli due fact automat align ller model direct result viterbi decod procedur verifi experi larg consist carri class show larg varianc larg amount contour perturb rotat class split test train consist draw result show recognit accuraci detail descript experi found imag retriev base hmm gener class condit probabl classifi unknown pattern likelihood score order element imag similar sketch queri imag techniqu previou section order perform content base imag retriev user sketch imag repres rotat invari model fig rough sketch object repres featur sequenc sequenc score ecient appli prune techniqu hmm framework probabl score calcul imag highest score retriev system show feasibl approach appli integr inhomogen featur deriv color shape singl statist model fig illustr gener featur case stream deriv shape calcul appli step depict upper part fig note sampl scheme ident fig order calcul color inform rgb color binar step skip remain step illustr lower part fig carri featur vector compon deriv heterogen inform uenc di erent cue shape color control stream integr part queri techniqu present section evalu consist imag arbitrarili rotat object imag featur extract step present fig train individu model util algorithm discuss previou model concaten modi ed ller hmm repres imag rotat invari integr shape color deriv featur fig present result achiev row queri sketch shown rst grei imag grei highest similar score number featur align rst ller model retriev imag estim rotat angl calcul valu eq larger number queri sketch retriev imag detail descript retriev system found binar calcul filter subsampl featur stream featur stream red green blue figur featur extract step sketch sketch sketch figur queri sketch retriev imag note color match grip tong red grip rst retriev tong stochast model imag pseudo hmm extens hmm develop order model data call pseudo due fact state align consecut column calcul independ introduct pseudo hmm planar stochast automata arrang outlin fig state horizont direct denot consist hmm vertic direct charact recognit face recognit consid imag face fig subdivid vertic model data stripe align result horizont warp pattern pattern repres stripe align hmm result vertic align stripe similar model consid consist horizont stripe figur basic structur pseudo hmm imag classi cation shown fig train featur segment algorithm model train recognit procedur accomplish calcul probabl data gener hmm doubli viterbi algorithm kuo show transform hmm insert special state featur fig show augment state figur augment marker state state gener high probabl emiss featur structur fig care fact featur di erent ordinari featur hmm train standard algorithm recognit step carri standard viterbi algorithm util classi cation demonstr section face recognit task classi cation imag pseudo hmm statist model capabl demonstr recognit accuraci achiev olivetti research laboratori face result achiev appli rst featur base discret cosin transform imag scan sampl window top bottom left pixel sampl window size transform dct triangl shape mask extract rst coecient arrang vector result featur extract arrai vector overlap adjac sampl window improv abil hmm model neighborhood relat sampl block ect overlap compar speech includ redund inform featur experi show overlap direct recognit accuraci step statist classi cation base singl model structur illustr fig train person algorithm recognit viterbi algorithm algorithm order determin probabl face model test imag algorithm show similar recognit viterbi algorithm faster algorithm automat segment face imag recogn assign model highest product probabl test imag train hmm paramet local maximum likelihood function depend initi model paramet import provid good initi model train exploit similar face compar object train common initi model face train set common model ned ve face person obtain face model person main improv compar dct featur grei common initi model column imag model row model advantag recognit person tilt head import point human level case ect model column fig show segment tilt face region align frame white line figur segment imag human face summari aim paper demonstr statist pattern recognit techniqu base hidden markov model speech recognit outlin obviou approach tremend potenti applic area interact multimedia inform process research result present paper stimul research contribut explor power paradigm futur demand pattern recognit task refer lr tutori hidden markov model select applic speech proc vol feb pp integr acoust inform larg vocabulari word recogni ieee intern confer signal process pp shape classi cation hidden markov ieee transact pattern analysi machin vol pp gonzalez digit imag discrimin planar shape shape ieee transact vol pp es matric mix shape factor signatur veri proc intern confer document analysi recognit ulm pp lee classi cation shape vector vol pp retriev rotat object user proc ieee workshop access imag video librari conjunct cvpr santa pp kuo spot poorli print document pseudo hidden markov ieee transact pattern analysi machin vol pp fs recognit hidden markov ph cambridg recognit hmm rotat featur intern workshop frontier handwrit recognit pp face recognit hidden markov workshop advanc facial imag analysi recognit technolog conjunct european confer comput vision germani gener ty hmm speech proc ieee intern confer speech signal process pp engin draw ed submit intern confer document analysi recognit markov model base continu onlin gestur proc int confer pattern recognit investig hybrid model techniqu larg vocabulari cursiv handwrit intern workshop frontier handwrit recognit august speech recognit real altern tradit survei int workshop page st octob video index tv broadcast hidden markov proc ieee intern confer signal process hmm imag sequenc ieee intern confer imag process stochast model shape imag ieee workshop access imag video librari conjunct pp fort june
ML/896 6 cellular system pattern recognit associ neural network christo jame austin advanc comput architectur group comput scienc york uk cellular system pattern recognit present paper cell arrai capabl perform basic symbol process exchang messag state cellular automata oper aim system transform initi symbol descript pattern correspond object level hierarch approach descript structur pattern underli process engin system aura model associ memori system endow learn mechan util distribut natur architectur dedic hardwar platform introduct basic characterist cellular automata abil parallel distribut process due simpl interconnect process unit call cell connect direct neighbourhood fashion time step state cell determin state neighbour cell previou time step cellular automata architectur successfulli low medium level comput vision problem feasibl hardwar implement architectur import factor speed oper extens cellular automata combin idea neural network introduc cellular neural network augment model cellular automata continu time dynam control behaviour system proper weight matric control primarili low medium level comput vision system present paper combin cellular architectur neural approach system aim recognit pattern scene idea syntact structur pattern recognit structur pattern relat primit constitu great import classif identif basic drawback system successfulli appli specif case gener suffer sensit graph match lack gener robust learn mechan current system hierarch approach learn structur pattern iter higher level cell connect direct neighbourhood inform propag exchang distant cell iter cell awar state distant neighbour cell receiv suffici inform object level state assign recal cell consist number modul associ neural network capabl symbol process cell call associ processor form cellular associ neural network messag signal symbol natur initi level process basic pattern primit form pattern messag symbol repres complex format pattern primit share similar characterist cellular neural network cann kind cellular inform process system main differ fund project state scholarship foundat greec symbol natur inform associ neural network exist algorithm gener rule initi descript architectur found section present basic characterist system method train recal pattern present result dedic hardwar platform implement associ memori model briefli present architectur mention main characterist system cellular automata structur associ memori symbol process cell aim transform symbol complex correspond object level output descript object initi label stage product symbol digit imag perform similar fashion model associ memori suit imag process task associ memori detail symbol process part system associ memori model model associ memori system advanc distribut associ memori advanc uncertain reason architectur initi label imag form basic symbol process engin architectur correl matrix memori main process approach oper figur ariti ariti ariti token lexic token convert symbol bind separ identifi separ pattern figur associ pattern raw pattern produc applic pattern aura model adam consist learn recal associ input output binari data input pattern method order constant number classifi linearli insepar produc sparser input capac prevent fast satur facilit threshold oper class pattern smaller input output pattern class pattern constant number bit set uniqu combin associ class pattern output associ current content input pattern appli sum column raw class pattern produc convert binari class pattern method set greatest integ raw class rest number input pattern appli class pattern raw output retriev convert binari pattern set sum greater equal rest number class pattern aura extens adam symbol process basic model depict figur input data aura rule output relev postcondit order form input binari product tensor product variabl valu tensor product input correl separ number precondit separ regard class pattern adam index output store separ number separ obtain threshold output recov recal model oper parallel data mean simultan present input condit result simultan product relev output import characterist error oper uncertain miss speed larg amount data feasibl hardwar implement cellular associ neural network cell cann call associ processor form number modul task perform aura processor commun direct neighbour processor cann figur processor exchang messag neighbour site state repres symbol initi state processor symbol arrai produc initi label modul processor perform convert input form suitabl spread combin incom inform inform pass direct make neighbour combin current state inform neighbour produc state processor modul call passer combin passer passer combin area area figur associ processor pattern test modul combin form associ processor depend connect schema specifi messag form input modul output direct set symbol cann input set symbol repres primit pattern found imag set transit symbol evolut process cann output symbol repres complic pattern final label imag messag consist symbol set learn aim learn session cann produc set symbol rule repres transit level pattern primit object level rule modul associ processor common modul type oper cann locat independ rule form input condit input condit combin messag output transit symbol symbol output alphabet basic principl rule product combin symbol input recogniz postcondit retriev transit symbol assign postcondit current format input rule store relev aura learn session endeavour extract input pattern inform structur due propag cell awar initi state distant cell reflect state finit number cell state uniqu arrai uniqu state uniqu format pattern primit initi pattern divid termin condit end learn precondit exist input combin modul user provid symbol pattern present recal recal session system evolut similar cellular automata rule produc learn session defin state transit place pattern learn session present number end object level label state cell similar pattern object level label pattern area common unknown pattern system label format pattern primit recogn feasibl site end object level label make system relax paramet insert postcondit combin input found constraint relax incomplet precondit match accept system extra impetu assist converg solut toler cell alter state cell independ decid output produc paramet recal session input multipl symbol place present aura consecut simultan present option present input trade speed size present input faster larger recal session stop alter configur threshold preset maximum number experi system aim identif simpl object scene long term aim applic analysi electron mechan draw number prototyp symbol pattern test oper system connect schema depict figur alter modul appli experi connect schemata evalu order test exact behaviour process modul effect relax consecut simultan present test geometr alter prototyp test pattern paramet associ memori oper methodolog investig experi pattern train figur size order symbol ten combin pattern test due lack relev result depict figur repetit pattern number rule combin modul start end number iter complet learn session depend size pattern number rule produc depend level similar pattern common format repres rule iter pattern combin iter pattern combin figur percentag distribut object level label area graph figur show system pattern combin pattern percentag distribut object level label area iter shown label highest percentag label repres pattern similar highest graph cell end object level label label due fact area includ part number object label note object label present output cell toler precondit match relax local experi shown kind relax behav global figur correspond simultan consecut present consecut present time consum steadi solut repetit simultan present fluctuat time iter simultan present behav similarli consecut size set experi perform softwar implement aura model run silicon graphic workstat hardwar platform hardwar platform function develop research group version presenc latest bu connect host comput follow scalabl model similar process node parallel connect bu special design base fpga logic devot sum threshold oper yield potenti time workstat summari system present approach cellular inform process cellular architectur combin associ neural network idea structur pattern recognit inform symbol natur messag state repres symbol requir speed rule high storag capac error toler oper met aura type associ memori underli process engin system transform initi symbol scene object level idea grammar repres class syntact system extend rule describ structur pattern produc learn mechan store addit fashion knowledg built gradual exist distribut messag propag model process guid recognit process potenti architectur demonstr test prototyp symbol pattern initi stage paramet system evalu parallel process dedic hardwar platform expect enhanc system real time process abil refer editor modern cellular theori applic plenum pierr milgram effici cellular algorithm imag process imag lo yang cellular neural theori ieee transact circuit lo yang cellular neural applic ieee transact circuit bunk structur syntact pattern recognit handbook pattern recognit comput page world structur syntact method line draw extend work advanc syntact structur pattern int page cellular associ neural network imag interpret iee int confer imag process applic page jul okeef austin imag object label classif associ memori page jul austin tj associ memori imag recognit analysi imag vision lee neural architectur fast rule match artifici neural network expert system dec dj op hc associ memori jun pack cellular neural network associ ieee monograph associ kennedi austin parallel architectur binari neural network page sep
ML/897 6 data mine framework build detect model lee stolfo comput scienc columbia west ny abstract updat instal detect system due attack method upgrad comput environ current construct manual encod expert secur slow describ data mine framework adapt build detect model central idea util audit program extract extens set featur describ network connect host appli data mine program learn rule accur captur behavior normal activ rule detect anomali detect detect model specif compon network system incorpor exist id produc meta detect model combin evid multipl model discuss strength data mine associ frequent episod report result appli program network audit data darpa detect evalu program introduct comput system plai increasingli vital role modern target enemi crimin addit prevent user authent password avoid program inform protect detect wall protect comput system detect techniqu categor anomali detect detect anomali detect id flag observ activ deviat significantli establish normal usag profil anomali detect stat pattern attack weak spot system match identifi research support part grant darpa nsf submit ieee symposium secur privaci accuraci essenti requir extens adapt critic todai network comput environ multipl place network system network carefulli craft ip packet crash victim host vulner system softwar exploit yield illeg root shell activ penetr point record audit data id extend incorpor modul special compon network system larg traffic volum secur relat mail list web site suggest system secur hole method continu discov imper updat frequent time build effect id enorm knowledg engin task system builder reli intuit experi select statist measur anomali detect expert analyz categor attack scenario system rule pattern detect manual ad hoc natur develop current limit extens adapt handl audit data updat slow recent research commerci start provid mechan custom extens filter network traffic stream seri execut script polici script event detect handl rule system administr personnel instal site assum role secur expert id builder write correct event handl function experi show system provid great write script involv lot effort addit learn script mean script system handl fix set network traffic event type occas forc make sourc code origin id gener event type research aim develop systemat approach build develop set automat tool appli varieti audit data sourc gener detect model point view detect data analysi process anomali detect find normal usag pattern audit detect encod match pattern audit data central theme approach appli data mine program extens gather audit data comput model accur captur actual behavior normal activ automat approach elimin manual analyz encod select statist measur normal usag profil data mine tool appli multipl stream detect modul special type specif compon network learn combin detect model consid evid framework facilit construct adapt rest paper organ section outlin main compon framework section illustr data mine program discov pattern comput normal profil section report result experi build detect model audit data darpa evalu program section discuss relat research project section outlin futur research plan systemat framework basic detect audit mechan enabl record system distinct evid legitim activ manifest audit data sheer volum audit amount audit record number system featur audit effici intellig data analysi tool requir discov behavior system activ data mine gener refer process extract model larg store data recent rapid develop data mine made wide varieti drawn field pattern machin type algorithm mine audit map data item categori algorithm output form tree rule ideal applic detect gather suffici audit data user appli classif algorithm learn classifi label predict unseen audit data belong normal class abnorm link determin relat field record correl system featur audit data correl command argument shell command histori data serv basi construct normal usag profil programm highli sequenc model sequenti pattern algorithm discov sequenc audit event frequent occur frequent event pattern provid guidelin incorpor tempor statist measur detect model pattern audit data attack suggest measur includ develop appli data mine techniqu build detect model framework consist program learn classifi associ rule link frequent episod sequenc support environ enabl system builder interact iter drive process construct evalu detect model end product intuit rule easili inspect edit secur expert detect learn rule replac manual encod pattern system featur measur select pattern comput audit data learn correl evid multipl detect produc combin detect model import point framework elimin analyz raw audit output build detect model network data mine program audit data record correspond high level network connect host session record includ extens set featur describ characterist durat number byte analyz raw audit data essenti task argu gener util develop network oper system made lowest level build block regard exampl robust free perform ip packet filter event handler output summar connect record framework assum build block construct mine audit data section describ data mine illustr appli algorithm gener detect model audit data audit data refer timestamp audit number featur label servic flag hot fail login root shell su durat normal telnet sf normal telnet sf guess telnet sf normal telnet sf overflow telnet sf normal telnet sf guess telnet sf overflow telnet sf normal telnet sf tabl telnet record classif detect thought classif classifi audit record discret set normal kind set featur class label classif algorithm comput model distinguish featur valu describ concept telnet connect record shown tabl ripper classif rule learn gener rule classifi telnet guess fail login number fail login greater telnet connect guess password overflow hot root shell number hot indic number condit root shell telnet connect buffer overflow attack hot indic includ access system creation execut condit includ normal true telnet connect ripper select uniqu featur valu identifi rule inspect edit secur incorpor detect system accuraci classif model depend heavili set featur train data featur remov record tabl ripper produc accur rule identifi buffer overflow connect show due tempor natur network probe ad tempor statist result improv accuraci classif model select set system featur critic step formul classif task strategi mine frequent episod network audit pattern guidelin select construct tempor statist featur section discuss process detail import reason combin multipl detect model order avoid perform bottleneck easi target id consist multipl cooper lightweight subsystem monitor separ part entir network environ id inspect full data content ip packet track connect run memori attack syn function lightweight id inspect header ip packet detect target network exploit host guess buffer solut lightweight system gatewai check packet system monitor activ host detect system combin evid subsystem action make detect model adapt combin exist model model train data normal data audit data network restart entir model build process aggreg audit data data mechan induct learn correl predict number base classifi result combin classif power base classifi construct cooper detect model shown figur connect record construct attribut predict base detect class label origin connect label classif algorithm appli record produc combin detect model figur combin multipl cooper detect model associ rule empir evid program execut user activ exhibit frequent correl system featur privileg program access system file specif directori programm edit compil file frequent consist behavior includ normal usag profil goal mine associ rule deriv correl tabl set record set defin percentag record item set associ rule express support confid tabl show shell input command telnet session secretari filenam remov content mail bodi repres morn timestamp hostnam pascal extend origin associ rule algorithm make relat system featur term axi denot import case shell command axi featur program output rule includ axi featur command vi time hostnam command subject time hostnam time hostnam command pascal pascal cd pascal vi tex pascal tex vi pascal mail pascal subject progress pascal vi tex pascal vi tex pascal mail pascal subject progress pascal vi tex pascal latex tex pascal pascal tabl shell command record associ rule convei inform user behavior rule mine session merg aggreg rule set form user normal profil section detail experi associ rule anomali detect frequent episod studi frequent sequenti pattern network event order understand natur attack frequent episod repres audit record pattern set timestamp event record set interv sequenc event record start timestamp end width interv defin set interv minim occurr proper defin ratio number minimum occurr total number event record frequent episod rule express item form episod support confid width occurr introduc extent origin frequent episod algorithm extend algorithm comput frequent sequenti pattern phase find frequent associ axi gener frequent serial pattern associ timestamp durat servic src host dst host src byte dst byte flag http spoof victim http spoof victim http spoof victim http spoof victim http spoof victim http spoof victim http spoof victim ftp sf smtp sf telnet sf smtp sf http tabl network connect record approach combin associ sequenti pattern singl rule algorithm make relat system featur studi sequenti pattern connect destin design refer featur form addit condit minim occurr event record cover constitu item set refer featur mine frequent episod network connect record guidelin construct tempor statist featur build classif model raw output summar network connect record set featur number byte tabl show exampl connect record appli frequent episod program normal connect data studi result pattern outlin algorithm visual compar frequent sequenti pattern syn flood attack shown tabl spoof sourc send lot syn packet connect port victim host short time span axi featur refer algorithm produc uniqu pattern normal describ lag dst host lag dst host lag dst host perform pattern mine comparison data number variat axi featur refer featur limit choic attack order understand behavior perspect axi refer data gener distinct axi refer featur pattern serv guidelin ad addit featur connect record build classif assum dst refer width episod connect examin connect past share item set add count connect share current add count valu featur item set add count connect open problem decid time window mine sequenti pattern increment plot number pattern gener run experi show plot stabil initi sharp jump call smallest stabl region report experi valu calcul tempor statist featur classif model result show plot accuraci classifi stabil tend taper requir good window size set sequenti pattern suffici pattern captur small ad tempor statist featur experi build detect model particip darpa detect evalu program manag mit lincoln object program survei evalu research detect standard set extens gather audit includ wide varieti simul network environ militari provid darpa particip site build detect model tweak exist system train send result test data back darpa perform evalu report preliminari result darpa data provid data week network traffic data content data packet transmit host insid simul militari base audit data unix solari host network session provid main categori attack includ syn unauthor access remot machin guess unauthor access local privileg local user buffer overflow surveil probe user behavior manag system data packet filter engin extend handl made packet fragment inspect modul crash process data ad function inspect data exchang interact tcp connect function assign valu set featur data content suggest suspici behavior total content featur number access system creation execut number destin host number access file number fail login root shell command approach includ extens set indic data mine program decid minim set discrimin featur identifi detect result final test data due back darpa evalu result made darpa decemb report perform detect model event handler output summar record connect connect record includ featur describ start sourc destin byte flag indic connect establish number fragment size offset tcp connect addit featur connect ad tempor statist featur procedur outlin section connect past destin host concurr number number connect servic current number uniqu number number connect past servic current number uniqu destin number number flag detect train data darpa includ identifi sourc host destin host attack inform label connect record attack data dai train detect model data dai train data set consist record normal connect record appli ripper learn classif rule type classifi classifi connect test data normal report true posit posit rate result classifi tp refer situat classif predict correctli fp refer situat normal record identifi amount audit data dai million connect record nasti aggreg connect record singl train data set extract connect record fall surround time window minu durat randomli extract sequenc normal connect record probe experi tp fp tp fp tp fp tp fp tp fp fat lean tabl tp fp detect model fat classifi experi build classifi detect connect record larg set includ traffic tempor statist content featur row tabl show tp fp rate classifi report perform main categori remot user gain access local host local user gain access root result show classifi effect detect probe attack attack observ variat attack make choic tempor statist featur inadequ probe attack hide trace slow pace significantli behavior attack upto minut move port host statist comput base time span problem larg number rule learn algorithm lot heurist search huge hypothesi case creat rule accur gener rule identifi attack echo repli simpli condit servic echo request rule learner case simpli fail tempor statist evid lean classifi experi build detect model special categori attack main object combin set separ learn model improv perform result classifi discov rule attack content rule probe attack content featur build separ classif model remov content featur connect record remov tempor statist tcp record content featur mean type connect train data consist predict subset test data true class label ripper appli learn rule combin evid classifi result rule basic select accur base classifi type row tabl show perform improv detect probe attack improv benefit reduc featur set select power rule traffic base classifi handl protocol echo connect past connect destin host current echo request attack simpli base base classifi rule traffic base classifi accur rule servic unregist flag syn packet respond rst rule detect attack anomali detect privileg hard detect dont secur personnel focuss guard attack insid problem problem secur personnel difficult classifi singl event user normal abnorm unpredict natur peopl user action login session studi determin behav approach mine frequent pattern user command merg add pattern aggreg set form normal usag profil user pattern merg pattern righthand support valu confid valu analyz user login mine frequent pattern sequenc command session pattern set compar profil pattern set similar score assign assum set pattern pattern rule merg profil pattern similar score simpli higher similar score mean higher likelihood user behavior histor profil darpa data includ user anomali data evalu anomali detect system tabl system administr log cat password file run command top programm write public domain code vi compil code read send execut unix command programm similar user work afternoon secretari secretari edit latex run read send mail manag read send mail manag read mail tabl user descript user starttim anomali descript week mon log beta week mon secretari log night week tue log week tue secretari week wed secretari manag week wed log night week programm week fri week fri log tabl anomali schedul describ consist behavior user anomali analysi extract shell command user telnet session shell command replac timestamp nt elimin input edit filenam extens tabl show exampl process command data appli frequent episod algorithm command data login session axi featur pattern rang consecut mine frequent sequenti pattern associ user time host treat week data gather simpli merg pattern user profil user activ time segment treat week train compar pattern session profil time segment record rang similar score week data week user tabl compar pattern user compar result similar score normal rang time tabl column label rang similar user profil record mean user login time segment week column similar measur session session detect similar score smaller normal rang programm thursdai pattern match pm similar score rang user normal anomali secretari secretari tabl similar user profil order understand natur user compar activ group match defin group group group programm sa group profil build group basi pattern user belong group merg profil compar target user profil record rang normal similar score tabl column user show strongest associ group column user assum anoth group ident normal anomali user sa sa secretari secretari tabl similar group profil relat work network detect research area recent emerald made extens primari design goal research automat method construct detect model mechan design autom extent process share view discuss id built standard compon oper system network commun build robust box algorithm analyz user shell command detect anomali discuss basic idea shell command singl stream string match techniqu build updat user profil extend frequent episod algorithm superior approach consid associ command frequent sequenti pattern associ futur direct outlin data mine framework construct detect model kei idea appli data mine program audit data comput anomali detect observ behavior data facilit adapt mean construct combin model incorpor evid multipl model mechan make feasibl introduc id compon exist id extend basic associ rule frequent episod algorithm accommod special requir analyz audit data experi show frequent pattern mine audit data reliabl anomali detect guidelin select tempor statist featur build effect classif model result data darpa detect evalu program highli accur detect model built automat system give final perform analysi current evalu program conclud futur work includ mechan procedur translat learn detect rule preliminari project start acknowledg colleagu extend research group encourag refer swami mine associ rule set item larg acm sigmod confer manag page chan stolfo parallel distribut learn aaai workshop knowledg discoveri page cohen fast effect rule induct machin intern lake morgan kaufmann smyth kdd process extract knowledg volum data commun novemb porra state transit detect approach ieee transact softwar march anonym ftp june levitt autom detect vulner privileg program execut monitor annual comput secur applic page decemb kumar softwar architectur support detect nation inform secur page lane brodlei sequenc match learn anomali detect comput secur aaai ai approach fraud detect risk page aaai juli stolfo mine sequenti applic submit august lee stolfo data mine approach detect usenix secur san januari mine audit data build detect model intern confer knowledg discoveri data august aaai press garvei detect expert system final technic report technic comput scienc sri menlo februari lunt detect intrud comput system confer audit comput mannila toivonen discov gener episod minim occurr intern confer knowledg discoveri data august verkamo discov frequent episod sequenc intern confer knowledg discoveri data august todd karl levitt network detect ieee network flight record network flight record system detect network intrud usenix secur san phillip porra peter neumann event monitor enabl live disturb nation inform system secur baltimor octob common detect framework mountain ca basic secur modul guid
Agents/898 1 trainabl inform assist cooper problem solv bauer dfki germani abstract softwar agent intend perform task behalf user agent compet suffici produc desir outcom paper present approach cooper problem solv inform agent user support achiev goal side effect user extend agent capabl enabl autonom perform similar task futur introduct softwar agent intend autonom perform task behalf user agent compet suffici produc desir outcom simpli give leav task altern identifi current problem commun agent expect result carri achiev origin goal user system expect interest obtain cost interven time time consequ ration system troubl enhanc commun user agent train agent capabl extend similar problem futur prevent process effici paper present approach cooper problem solv softwar agent user support achiev goal demonstr solut user extend agent capabl enhanc potenti user train mode base paradigm program demonstr support level naiv user add perform system flexibl adapt rapidli chang environ achiev case present trip planner satisfi user request inform web site central challeng system cooper user system satisfi inform request rest paper organ section introduc system architectur describ trip planner applic scenario section describ knowledg queri inform integr aspect section discuss interact user system attempt defici system model inform sourc section discuss relat work summar framework introduc architectur trainabl inform assist case instanti applic internet travel arrang assist figur tour arrang scenario user cooper plan assembl trip core compon architectur applic modul instanti trip planner knowledg inform broker satisfi request control access inform extract trainer broker bridg potenti gap knowledg gather request inform planner share user interfac standard web browser architectur support interchang role user broker inform consum inform provid consum role user specifi desir trip interfac provid trip planner trip planner implement process handl mean integr data increment refin trip specif user prefer trip planner inform gap fill current domain data highli dynam local send inform request inform broker modul maintain detail specif inform sourc includ schemat type inform term plan knowledg user prefer trainer info extract domain ontolog web site annot request train result specif info request info info request info script dialog site inform heurist browser site info broker figur architectur ontolog section oper descript extract script implement web queri languag section inform broker execut script requir hand result applic satisfi origin inform request time broker search inform unsuccess depend type system react wai web site access broker simpli satisfi applic inform request altern inform sourc interest case occur intend web site script produc desir outcom simpl sort syntact type check discov date extract time expect section frequent reason modif web site layout case origin inform html document script failur hand inform extract trainer start program demonstr dialog user role inform provid consum exchang object dialog gener work script modifi futur inform identif relev inform provid applic enabl system successfulli deal web modif current process carri section give detail account user system interact deal fail inform request cooper achiev domain goal knowledg queri plan ontolog plai kei role knowledg defin set concept provid common languag system compon mean integr inform unrel sourc consequ ffl formal plan oper applic user refer precondit effect trip plan oper constrain set admiss train user prefer airlin transport mean ffl descript web concept defin ontolog describ kind inform found site addit import aspect inform sourc discuss section ffl formul inform request applic inform broker ontolog common languag messag queri plan inform sourc address order satisfi inform request queri plan process sketch section select sourc determin queri ontolog ontolog provid model scheme inform sourc number basi exchang messag inform domain ontobrok approach variant frame logic repres concept interrelationship attribut declar hr min time time pm pm time time time time time time time time time figur part ontolog includ syntact variant express carrier departur destin number defin concept flight attribut carrier class airlin defin departur destin class formal languag made defin concept relationship content inform sourc similar classic data base schema section sourc answer inform request applic number technic subtleti dealt arriv time flight extract inform sourc search connect train sourc repres time american format includ make european format deal problem syntact variant ident piec extend standard ontolog mean repres class figur depict part trip ontolog encod definit time concept attribut time subclass time time possess addit attribut pm class turn subsum number subclass rec rec interest point fact refer recogn simpl program perform kind test string extract onlin piec inform format side effect attribut min time instanti respect valu canon concept note recogn implement simpl accept limit formal appli produc syntact variant instanti canon exampl recogn includ time format vari figur phone number problem recogn instanc class form time sourc queri server expect format solv appli time output recogn annot web section time canon time instanc produc input requir web site annot import knowledg sourc inform broker annot web site answer inform request applic modul web site captur site content schema repres type inform found sourc term concept defin current number queri scheme reflect wai inform sourc queri plai import role queri plan process sketch statist data typic time queri procedur descript extract relev inform onlin document compon initi provid knowledg engin user statist automat updat queri final aspect web site wrapper inform extract encod web queri languag section maintain updat dialog system user section explain detail content web site schema date time time data found organ tupl inform describ instanc class flight defin note express airlin refer carrier attribut instanc class flight member class airlin figur wrapper specif date time entri syntact variant term recogn section order web site inform queri produc intend provid inform requir queri scheme mention describ kind inform provid queri agent term attribut site content schema discuss attribut instanti perform queri evalu result document queri scheme web reflect fact queri sourc provid concret valu ffl ffl ffl produc document ffl time ffl time extract script inform date found case sourc inform manifold similar mark posit site content schema queri agent provid concret stand attribut instanti queri denot attribut involv kind queri note gener queri scheme repres altern wai address inform sourc inform broker treat queri scheme plan oper precondit mark effect mark inform request inform system role goal initi state plan queri plan gener combin oper progress queri plan process exploit statist access inform identifi path support partial replan case fail attempt access inform sourc detail scope paper queri languag approach web queri languag call combin extend featur found relat languag design main basic inform gather process document inform select guid search filter base content structur elabor xml flexibl link referenc concept integr featur order robust queri focu applic context trainabl inform assist user defin inform gather action cooper interact userdefin abstract integr queri form macro oper target languag program session repres intermedi final user intend inform select concept section consid web comput dynam graph structur node static dynam gener document edg link navig search graph structur path regular express base flexibl document quantif form existenti document repres tree structur canon mean obviou fault document option start addit annot integr wai posit specif element document constraint path root relev constraint properti context es rel posit collect plai kei role specif posit collect root specif specif attribut set specif leav match specif pattern collect access complet index forward backward addit singl element select interv fetch prefix suffix singl border element automat element definit macro abstract wrap annot document part kind collect script flight figur integr recogn section restrict integr structur properti document show select script realiz extract attribut arriv time applic context relat section script select arriv time flight rel posit destin specif tabl document url sampl document figur tabl constrain row type flight macro select row tabl data field boldfac string classifi recogn context select text element field row check recogn valid robust refer properti script type modif document ad commerci banner onlin document chang layout collect set element specif specif structur specif attribut collect share access method distinguish mode interv whichev kind span line tabl tabl select arriv time predecessor lm select successor br td element flight tabl document destin flight applic time defin macro flight tr constrain figur script extract attribut arriv time specif citi format element landmark select arriv time text predecessor valid recogn time exampl found interact user assum mention section inform broker fail satisfi inform request current applic system system initi dialog user identifi portion content relev queri basic idea translat user select execut access method term iter refin combin addit hint user system heurist serv identifi robust navig object script enabl system autonom deal web site futur train process document enrich addit html featur serv mark singl special charact user navig document javascript function text portion highlight uniqu identifi enhanc interact function document import note remain document browser unaffect figur depict situat access method arriv time flight server defin modifi document yield tree serv main data structur train process user select text portion uniqu map tree learn concept hidden user amount translat oper access procedur term rest section depict figur user identifi arriv time flight wrapper framework script describ extract type inform basic consist part document content initi mark data term syntact featur html tag surround posit tree document gener wrapper robust type modif document ad commerci banner reformat part add abstract element descript user select identifi featur document support uniqu identif part ad descript constrain navig document level abstract ignor irrelev detail select button left serv landmark identifi tabl inform flight describ flight tabl select ignor top document occurr select button simul behavior wrapper defin insensit modif made principl syntact featur document serv string format style singl html tag refer context current inform request kind landmark posit arriv time rel string destin current boston train dialog select relev document user identif reason landmark improv wrapper place cooper dialog user system sketch user mark relev document part system comput initi term document user ffl provid exampl possibl concept learn enabl system discrimin ffl give addit hint facilit identif ffl accept reject landmark suggest ffl system present current hypothesi critic ffl termin dialog time ffl addit ffl identifi posit current document ffl suggest landmark number heurist process user ffl classifi user select detail translat place ffl present current hypothesi user note dialog follow fix protocol partner turn suggest addit modif current wrapper order reduc user workload system number heurist enabl search landmark user task limit accept reject system suggest landmark heurist includ search graphic object format string neighborhood select document count number row column test applic find refer instanti featur current inform request context similar heurist time system present current hypothesi user execut script step time highlight document portion select displai simpl natur languag translat code depict figur system find landmark limit context flight correspond highlight tabl descript flight select text tabl cell element td html string repres destin produc script flight depict figur altern start point simpli count row column relev cell tabl sensit simpl reorder tabl consequ heurist includ numer posit descript appli low prioriti aspect train dialog descript flight web singl user greatli facilit system task explicitli mark occurr restrict search area simpli mark irrelev document part header includ number graphic case wrapper consist method find occurr interest concept document descript find macro plai import role cooper definit wrapper hand simplifi train process restrict relev context search space navig aid landmark advantag system user note macro flight defin section train dialog sketch figur hand commun system wrapper explain term concept final mention train method creat wrapper distribut document interconnect hyperlink treat link ordinari edg document wrapper gather inform visit web site relat work instanti tradit inform integr system inform manifold ariadn concentr effici gener execut queri plan integr inform unrel add aspect cooper problem solv human user involv train system gather inform differ basic assumpt inform sourc make detail sourc descript explicitli repres constraint inform site inform car price order optim queri process reli user interact correct wrong sourc descript add miss detail contrast automat approach captur content inform sourc term user categori ila term describ trainer learn system structur input order facilit learn task situat inform gather typic occur role distribut slightli system user account system find balanc acquir inform produc robust wrapper annoi user involv lengthi train dialog current wrapper gener approach landmark grammar work token document string mean wrapper canon tree structur extend sequenti token robust wrapper integr abstract landmark pattern wrapper induct method aim automat construct content extract procedur web sourc requir exampl work approach onlin integr inform sourc adequ support languag incorpor idea websql provid sophist construct navig lack integr model document select specif part nice program languag manipul sgml document lack navig construct xml link concept base xml tree specif resourc document paper present architectur trainabl inform assist problem trip inform www inform integr framework reli user interact order recov fail inform gather action dialog correct system misconcept content layout inform provid basi success inform gather futur express web queri languag implement requir inform extract wrapper incorpor structur semant constraint relev inform recogn make access procedur learn robust modif document layout structur futur work includ improv compon aim provid robust wrapper intuit integr ontolog manag compon refer ashish ca knoblock wrapper gener internet inform sourc ifci confer cooper inform system mihaila applic web queri languag intern www santa bauer architectur trainabl inform assist workshop studer high idea meersman semant issu multimedia system hsu initi result wrap semistructur web page transduc contextu rule workshop ai inform integr intern joint confer artifici model web sourc inform integr fifteenth nation confer artifici knoblock replan inform gather page konopnicki shmueli queri system web vldb doorenbo wrapper induct inform extract intern joint confer artifici page ordil queri heterogen inform sourc sourc descript vldb knoblock learn wrapper inform sourc workshop ai inform integr perkowitz etzioni categori learn understand inform internet page sgml queri languag vanlehn learn lesson artifici extens markup languag part link work draft
ML/899 6 markov techniqu object local robot herman dept mechan katholiek universiteit belgium abstract paper deal object local robot bayesian framework describ method base markov local techniqu mont carlo implement appli solv global local problem robot approach successfulli appli problem local box robot manipul introduct order autom product process posit fast accur local method requir paper investig concept success mobil robot research markov local method proven fundament differ mobil robot control robot broad rang techniqu pattern recognit object local network fuzzi logic possibl theori bayesian infer bayesian local object perform infer form posterior probabl distribut incorpor inform prior knowledg sensor shape object recogn denot condit probabl measur vector background knowledg postdoctor fellow support minist polici programm kuleuven concert research action gratefulli acknowledg figur local cast piec robot manipul equip sensor problem solv shape inform sensor characterist model object repres likelihood function probabl densiti function likelihood correspond posit shape object account sensor sensor measur rule combin priori pdf posit likelihood pdf obtain posterior pdf repres inform problem measur bayesian techniqu incorpor difficult turn model priori pdf comput issu huge memori requir comput time show practic bayesian model make simplifi assumpt probabl function kalman filter hidden markov model reli sampl mont carlo markov local section describ markov approach object local markov local iter rule updat inform time sensor data section review case studi mont carlo implement ml algorithm successfulli appli effici improv made markov techniqu object local markov local mobil robot world approach capabl solv global local map robot initi posit theoret deriv ml object local denot robot belief environ object posit timestep sensor measur vector moment gener case repres sensor measur step algorithm find posteriori pdf reflect robot belief object sensor robot belief updat sensor measur lk crucial factor effici ml markov lk markov assumpt measur updat markov assumpt reduc eq normal factor likelihood function predict measur locat measur robot improv estim base model sensor object ml algorithm doesnt robot belief local mont carlo approach effici implement mont carlo approach markov local implement techniqu minim squar error estim correspond find order system measur equat linear major problem kf moment pdf approxim gaussian describ kf problem deal system measur equat kf remain fastest mean local provid sensor characterist model unimod system measur equat linear complex object cast piec fig measur equat inher limit kalman filter track object local posit orient chang object proper motion robot carri approxim gaussian good sampl state space altern mont carlo approach method grid slower power method implement ml algorithm point robot updat belief object posit time step repres pdf form mont carlo method sampl state space resolut grid state space refin attain grid updat place chanc find object small improv perform predict step calcul line comput likelihood function reduc lookup tabl compar kalman implement remain slower memori consum figur contour robot differ mobil robot robot demonstr due kf limit track global local mont carlo approach yield result mobil robot local execut freedom posit local cast figur requir search dof posit contour object inform shape posit involv fix horizont support local object area translat rotat requir state space grid time bigger mobil robot build grid rotat sensor provid local sensor laser scanner provid global inform environ posit object data process complex sensor power tactil sensor time sensor measur high coupl measur updat belief inform curvatur gather contour object sensor figur time delai measur control problem requir higher rate preprocess data integr curvatur likelihood function process raw sensor data forc data curvatur arc deriv raw data speed gain obtain activ approach sensor measur larg inform measur side cube gather sensor inform complementari order reduc order moment peak fast section describ case studi carlo approach successfulli appli object local problem case studi concern simpl object state space local problem freedom orient problem solv kalman filter approach de case local box robot manipul robot freedom equip dof forc sensor program move touch side cube environ figur cast piec stop threshold reach send posit program implement markov approach sensor measur forc dimens posit error consequ error joint posit proper complianc cube sensor due high measur discret due sampl assum gaussian characterist error measur posit simpl combin gaussian sensor characterist model box result mathemat complex function object contour curv likelihood function gaussian sensor characterist ds paramet curv function figur construct likelihood function dof object contour side obtain express form ds depend length side cube total likelihood function sum side numer integr librari construct sampl version result case cube sensor gaussian characterist shown figur resolut grid sampl version likelihood function cube corner locat tabl construct octav numer integr librari termin accuraci estim locat cube result approach tabl figur variabl number sampl figur sampl probabl threshold destroi order reduc number sampl requir memori time updat sampl fast number sampl previou experi measur reduc factor recov bad approach notic cube state space actual locat cube estim figur result cube dof consid state space corner grid resolut cm mean initi number sampl number perform mb run linux repres remain sampl sensor measur sampl repres posit corner cube orient posit visibl posit cube correspond estim coordin express cm case shape object calcul time complex shape cast piec figur requir offlin calcul lookup tabl fast cube calcul effort import step lot sampl updat approach granular grid adapt updat sampl high extend mont carlo approach grid grid local sensor probabl sensor measur found likelihood function account sensor characterist account symmetri object reduc requir time gap coupl touch verifi approach suit multimod distribut symmetri posteriori distribut peak figur repres remain sampl account measur figur cube account symmetri figur show remain sampl measur result pdf comparison long sensor measur distribut weight squar approach yield result implement markov local algorithm major differ squar method valid sensor characterist written gaussian distribut sensor characterist differ markov approach differ complex squar method unlik markov approach lookup tabl sampl version likelihood effici improv complex due complex likelihood function larg number mont carlo sampl approach practic perform local algorithm recognit space obtain likelihood function fewer freedom faster recognit space state space sensor space figur local recognit space possibl autom construct sampl version likelihood function start probabl function express sensor characterist object pattern recognit robot make distinct object manipul pattern recognit problem solv approach continu state variabl replac discret number class complex local problem local problem pattern recognit problem number pattern recogn infin reduc comput effort pattern recognit problem complex local invari object recognit algorithm consid invari specif mathemat function combin measur result chang specif group transform corner cube section measur point side cube horizont calcul angl line obtain matter locat box complex model corner replac singl activ activ approach base entropi filter sensor action entropi robot belief written lk maxim robot belief uniform pdf entropi distribut filter bad assumpt good measur improv robot posit estim object reduc entropi mean filter bad measur requir idea locat work measur reject measur idea sensor action measur produc maxim inform maxim reduc entropi robot belief chosen order minim bayesian framework markov local suit solv global object local comput requir repres pdf high implement issu consid combin mont carlo sampl state space combin evalu predict step rule invari ml execut construct likelihood function solv pattern recognit problem product process autom flexibl activ method elimin erron sensor measur speed local process sensor measur refer de compliant bayesian local mobil robot dynam journal artifici intellig vol neural ieee vol pp klir fuzzi inform englewood duboi synthet view belief uncertain input framework possibl int approxim vol pp gener maximum entropi bayesian method problem pp cambridg inform bayesian statist pp elsevi scienc network plausibl review practic bayesian method neural method neural approach linear filter predict vol pp tutori hidden markov model select applic speech vol pp sensor pp de de van robust sensor local geometr model nuclear proc confer remot techniqu hazard invari featur registr recognit phd ku depart electr div decemb
DB/900 3 effect network hierarchi structur perform atm hierarch rout yi du depart comput scienc john hopkin md bell lucent technolog crawford corner room nj abstract network deploi hierarch rout partit reveal full detail intern structur domain aggreg view paramet subnetwork border node atm standard internet architectur adopt approach rout paper studi effect atm hierarch rout protocol network hierarch structur simul studi show hierarch sourc rout perform compar global rout strategi util storag commun overhead network hierarch rout perform global rout hierarchi topolog perform perform rout delai suggest necess studi hierarchi design commun network hierarch rout introduct rout algorithm divid major distanc vector algorithm link state algorithm distanc vector algorithm router maintain tabl entri destin network rout cost hop destin tabl exchang propag author format rout cost slow shown distanc vector algorithm suffer slow recoveri link slow recoveri time rout loop occur link state network router flood eman link cost network hop rout calcul base full topolog maintain router link state algorithm exhibit slow recoveri time occur link failur algorithm class suffer scalabl distanc vector algorithm tabl size grow linearli number link state algorithm commun cost grow number space requir topolog mainten cope hierarch rout suggest approach network group hierarchi node level node high level report inform underneath topolog interest node node receiv report rout inform node domain exchang inform lower level node node maintain partial inform entir network requir rout inform storag node substanti reduc atm rout standard internet rout protocol adopt strategi domain typic correspond manag organ geograph region reduc size structur hide detail intern structur domain secur reason full inform intern aggreg rout inform domain maintain report domain achiev scalabl rout aggreg complex rout protocol grow linearli number link network sourc rout rout wai aggreg rout call aggreg exist tradeoff size accuraci rout inform paper studi perform hierarch rout link cost metric aggreg scheme interest understand perform implic hierarchi network graph studi effect hierarch rout atm standard repres rout signal protocol matur perform implic futur atm network perform simul studi compar perform global rout hierarch rout term network throughput control overhead signal delai show hierarch rout effect global rout exponenti link cost metric incur slightli higher signal delai hierarchi lead improv rout perform global rout observ level hierarchi necessarili lead perform impli hierarchi topolog perform import studi hierarchi design hierarch rout save storag rout inform commun capabl secur scalabl hierarch rout effect scalabl rout solut futur global network rest paper organ hierarch rout introduc section section discuss simul environ develop studi atm rout simul paramet studi detail section section present result perform studi section hierarch sourc rout sourc rout broad rout categori realiz connect sourc node receiv request local rout inform maintain make path connect rout inform link present rout protocol form cost metric rout algorithm execut link cost metric valu find feasibl path connect request shortest path dijkstra wide note inform physic link rout domain maintain physic path found connect request sourc node style sourc rout call global sourc rout found path necessarili feasibl term resourc path link signal process invok link path order reserv bandwidth link bandwidth support request link support backtrack back previou node link rout call link state rout approach adopt internet rout protocol feasibl sourc node maintain full inform physic link node maintain inform network sourc find sequenc partial path abstract consist path connect request success establish partial path sequenc realiz rout physic link request path level topolog kind rout call hierarch sourc rout approach deploi atm standard partial path signal process invok link path reserv bandwidth link bandwidth support request link support backtrack action make back previou node link style sourc rout requir node maintain view entir rout differ detail maintain inform rout inform network overhead inform state chang link transmit node maintain inform relat link commun overhead incur updat node inform sourc ing requir node store rout link state network support commun node link state updat rout inform commun major system rout protocol rout inform node aggreg topolog aggreg scheme reduc rout inform storag node topolog inform main reason hierarch rout scalabl topolog aggreg essenti deriv simpler connect graph complic real connect graph topolog aggreg scheme tree scheme scheme focu effect hierarchi structur hierarch rout perform hierarchi topolog affect perform hierarch rout atm rout protocol studi atm simul implement star simul atm rout studi aggreg scheme affect perform hierarch rout star discret event simul written emul rout protocol hierarch structur network modular architectur enabl easi integr modul achiev function gener interfac rout link cost function provid permit insert cost function studi similar interfac aggreg scheme domain rout inform summari topolog graph provid briefli discuss design star detail design implement star found star consist ffl simul ffl topolog aggreg ffl network topolog ffl network traffic load ffl statist ffl graphic simul engin adopt shortest path algorithm link cost function select feasibl path power formul exist scheme fit scheme internet rout realiz shortest path algorithm constant link cost link cost function link characterist link util link capac captur inform perform theori suggest exist rout algorithm base exponenti cost link achiev optim perform term throughput algorithm facilit simul easi incorpor link metric function aggreg inform domain recomput chang occur topolog paramet justifi aggreg topolog aggreg server accept topolog aggreg method return result aggreg metric aggreg calcul call perform provid capabl direct call aggreg function execut sequenti simul option run aggreg server machin allevi load comput aggreg server serv multipl request simultan network topolog gener produc topolog network traffic load gener gener dynam random connect request simul drive simul request repres stare sourc destin traffic bandwidth requir simpl topolog descript format input connect request stream distribut bandwidth requir statist collector collect data graphic displai show rout signal progress current connect request establish discuss simul paramet perform measur simul experi simul paramet cost link function aggreg scheme import paramet rout manc network perform measur network throughput defin total flow successfulli transmit control overhead signal delai measur effici rout establish paramet detail link cost metric discuss constant link cost metric internet exponenti link metric theoret perform rout algorithm perform metric studi paper metric detail constant cost link constant bandwidth link correspond natur minimum hop rout internet exponenti link cost exponenti function remain bandwidth link cost function justifi queue theori suggest opportun cost function aggreg method aggreg method plai import role network perform aggreg method incur combin comput burden size affect overhead manag network rout inform aggreg scheme studi includ complet inform star span tree span tree random span tree graph complet aggreg full cost matrix border node dia star aggreg cost star radiu half cost network diamet av star aggreg cost star radiu half averag cost distanc border node mst minimum span tree rst random span tree scheme complet basi compar perform loss due aggreg due onlin natur low link complet exhibit slightli perform method made turn bad futur connect request separ studi conduct perform aggreg scheme shown complet minimum span tree provid good perform achiev good perform high aggreg comput network dynam factor affect perform link cost function aggreg scheme mention interest ffl hierarch network hierarchi network connect graph lead network perform network hierarch structur main focu ffl link link delai normal connect averag hold time link reserv process asynchron due link delai link bandwidth held connect request eventu fail request prevent bandwidth held connect ffl network traffic load lead network perform ffl link link capac affect chanc request honor perform measur measur compar perform throughput measur cumul length realiz control overhead measur averag number backtrack connect paramet environ attribut affect perform aggreg method lead differ due fact aggreg inform maintain level hierarch rout differ aggreg scheme paramet enhanc suppress differ aggreg scheme link metric rout algorithm calcul shortest path minimum hop metric exponenti cost function section compar paramet hierarch rout global rout examin link network link capac observ backtrack link cost entir network bandwidth consumpt aggreg method result throughput expect similar aggreg method differ due interact concurr reserv larger differ occur due bad rout select incomplet aggreg inform gain insight paramet aggreg affect network examin topolog differ paramet examin carri graph regular regular differ graph studi graph provid guid investig graph graph investig lowest level connect hierarch structur induc hierarch level simul result compar perform global rout strategi hierarch rout strategi physic induc hierarchi ad hierarch rout studi theori suggest exponenti cost metric optim polici ensur algorithm competit optim counterpart result select metric simul section report simul result confirm theoret result studi topolog verifi superior exponenti cost metric hierarch rout introduc network structur studi topolog layer topolog layer figur hierarch structur middl node layer hand structur depict left layer node structur link intern link layer bold intern link layer link border link border node bold link topolog studi studi topolog pattern concern connect pattern lowest hierarch structur lowest level connect topolog studi effect individu network paramet graph properti interest studi number number averag border node pattern domain network structur gener specif valu topolog call hierarch studi topolog level switch network figur illustr topolog effect link cost metric perform exponenti cost metric constant metric figur show ratio throughput exponenti constant figur show ratio metric observ exponenti metric achiev gain network throughput constant suffer aggreg throughput ratio delai complet min span tree rand span tree traffic load figur ratio throughput exponenti constant cost metric topolog figur show exponenti cost metric perform constant cost metric exponenti link cost metric rest studi studi effect hierarchi rout perform focu hierarch rout perform hierarchi topolog studi hierarchi affect rout perform physic network ratio delai complet min span tree rand span tree traffic load figur ratio exponenti constant cost metric topolog figur effect hierarchi topolog level node studi effect topolog level node level hierarchi level hierarchi level figur show ratio throughput hierarchi figur show ratio hierarchi delai complet min span tree rand span tree traffic load figur ratio throughput hierarchi hierarchi topolog figur delai complet min span tree rand span tree traffic load figur ratio hierarchi hierarchi topolog figur hierarchi perform hierarchi term network throughput situat hierarchi produc throughput low request connect establish grant differ favor hierarchi star hierarchi perform hierarchi hierarchi incur compar hierarchi differ load low load hierarchi incur incur hierarchi star aggreg er shown unsuccess gener high load hierarchi shown perform hierarchi network hierarchi perform throughput signal delai good hierarchi design guid hierarch rout process lead improv perform hierarchi topolog hierarchi compar hierarchi high level aggreg complex node figur replac intern structur figur figur show ratio throughput hierarchi figur show ratio hierarchi delai complet min span tree rand span tree traffic load figur ratio throughput hierarchi hierarchi topolog figur figur show hierarchi throughput hierarchi throughput hierarchi slightli hierarchi figur show hierarchi perform hierarchi term situat hierarchi incur delai complet min span tree rand span tree traffic load figur ratio hierarchi hierarchi topolog figur exist situat hierarchi incur studi show hierarchi lead drastic rout hierarchi physic topolog justifi necess studi design hierarchi network achiev good perform studi effect atm hierarch rout perform studi hierarch rout perform network hierarchi compar perform global rout strategi hierarch rout term network throughput signal delai realiz connect focu perform link cost metric aggreg scheme studi show gener hierarch rout perform compar global rout strategi util storag commun overhead comput overhead network hierarch rout perform global rout hierarchi topolog perform implic suggest necess studi hierarchi design commun network find link cost metric plai import role rout perform studi show exponenti link cost metric hierarch rout effect rout larg network refer privat interfac specif version technic atm forum technic mar soar weight graph discret comput plotkin rout annual ieee symposium foundat comput page oct rout network hierarch topolog aggreg journal simul environ aggreg base hierarch aggreg juli probabilist approxim metric space algorithm applic annual ieee symposium foundat comput oct bertseka data network prentic rout feb internet work group rout inform june internet rfc rout rout commun page prentic version mar internet rfc rout rout commun page prentic schaffer graph journal graph
HCI/901 4 septemb pm keyword interact user zoomabl inform inform inform user interfac manag system abstract describ zoomabl graphic sketchpad explor altern tradit window interfac discuss motiv describ present prototyp applic introduc inform physic strategi interfac design briefli contrast current design strategi rich world dynam persist inform entiti oper multipl physic specif design provid cognit facil access serv basi design work materi journal visual languag comput zoomabl graphic sketchpad explor altern interfac physic benjamin bederson jame hollan comput scienc depart mexico nm ken perlin jonathan meyer david bacon media research laboratori comput scienc depart york ny georg furna bell commun research south street nj septemb pm introduct imagin comput screen made sheet materi continu displai crisp comput matter sheet size imagin sheet elast stretch order magnitud rubber imagin vast quantiti inform repres organ place size comput sheet access piec inform stretch imagin special sheet part sheet stretch part interact piec data time ordinarili filter data show underli data filter data relev portion data imagin stretch mechan provid altern scale object pure geometr repres page text small make present abstract titl readabl stretch show huge make show comput number deriv histori interact begin interfac sheet exist todai program call dont stretch huge simul zoom data call portal simul notion call semant zoom scale data wai user control vast data surfac pan zoom portal object data surfac filter data repres differ pan zoom navig larg inform space direct manipul tap peopl natur spatial hope user intuit access inform convent comput search techniqu provid bridg tradit interfac metaphor figur depict sequenc view pan zoom data figur sequenc view zoom data septemb pm motiv interfac design move pointer explor larger space interfac addit wai interfac desktop metaphor requir explor virtual world altern natur tradit direct manipul approach interfac design involv similar underli enrich greater possibl afford move richer world myriad benefit orient design emploi comput primarili mimic mechan older media import engin reason exploit earlier success approach potenti underutil mechan media year explor strategi interfac design focu mechan enabl comput mimick mechan older media strategi consist view interfac design develop physic behavior collect inform object effect inform physic arrang object natur normal activ similar physic materi evid wear wear record histori time influenc futur posit wai book crack open referenc place frequent consult paper top pile desk usag corner surfac index card catalog wear mark provid cue natur product physic materi limit record wai influenc futur inform physic strategi led explor digit object record object manual interact event make futur object displai graphic abstract accru histori part object depict copi histori sourc code develop section code copi led correct bug piec code view code deriv inform physic strategi lead explor physic interact graphic data part explor form research consortium design successor pad serv substrat explor interfac inform visual complex domain system design septemb pm oper platform rang graphic workstat pda digit interact cabl box describ motiv report statu current present initi prototyp applic todai inform readili effect access situat complic fact threshold vast avail inform network comput technolog continu process massiv amount perceptu data experi perceptu access inform resid comput system reachabl network connect unlik world rare present wai reflect rich structur dynam charact richer world dynam persist inform entiti oper multipl physic specif design provid cognit facil access physic design exploit semant relationship explicit implicit task interact kind work materi physic central support view inform multipl scale attempt tap natur spatial wai address inform present problem provid effect access larg structur inform smaller displai furna explor interest function determin inform visibl distanc central focal area recommend gener approach provid central focu area detail surround peripheri place detail larger context move simpl binari choic present elid inform determin scale inform detail render base semant task describ semant filter inform similar earli work mcc filter knowledg base hit recent work filter xerox abil make easier intuit find specif inform larg dataspac central motiv tradit approach filter recommend subset produc small dataset user effect navig complementari filter approach provid substrat structur inform septemb pm descript substrat creat interact structur inform base zoomabl interfac add scale class paramet mechan navig space effici mechan maintain interact larg complic graphic scene applic directli support creation manipul graphic navig space object implement widget interpret script languag creat zoomabl applic standard object support color hypertext markup languag standard input widget suppli extens focu current implement provid smooth zoom larg graphic dataset natur interfac requir consist high dataspac larg scene complic speed critic function interfac paradigm inher interact import search strategi visual explor dataspac zoom essenti interact frame rate maintain focu design make easi parti build applic made clear call applic written part api written care ensur effici gener connect script languag explor fairli interfac complex graphic interact script languag run kind glue languag creat interfac put actual interact render perform substrat approach peopl develop applic avoid complex inher type system implement section inform sampl applic sampl draw applic built top support interact draw manipul object load predefin programmat creat object applic written tcl script produc figur depict paper navig outlin discuss part applic septemb pm basic user interfac navig button left button mode depend user select move draw graphic follow middl button zoom button zoom zoom center move zoom user dynam control point zoom primit graphic user interfac builder progress creation activ object activ object anim view locat kind move object surfac navig easili find inform surfac import intuit navig larg dataspac primari motiv support visual search direct manipul pan zoom addit tradit search applic anim view piec data anim interpol pan zoom bring view locat end point screen width start anim zoom point start end point visibl anim smoothli zoom destin context viewer speed anim pan perform zoom cover ground pan zoom section diagram detail surprisingli complex topic navig search mechan support search text object enter text search menu result list object text click element list produc automat anim object search highlight object data surfac match search specif special marker bright yellow remain visibl matter zoom object small marker visibl simpl semant zoom figur depict search mechan figur search window user search text anim object click search entri implement visual bookmark navig aid user rememb place maintain miniatur view place move bookmark view place marker main septemb pm view identifi marker side click view anim main view place figur visual bookmark user rememb interest place show miniatur view place click miniatur view anim main view rememb locat portal portal special item provid view area surfac portal pass interact event occur place pan zoom portal perform kind interact portal portal filter input provid mechan chang behavior object view portal portal chang object present call portal replic inform provid method bring physic separ data figur creat approxim place magnif portal creat indic creat portal hyperlink hyperlink click chang main view move hyperlink screen solv make portal object method portal move user pan zoom make object sticki effect lift surfac stick monitor glass click hyperlink sticki portal bring link portal index isnt lost continu design user interfac typic low user interfac task hand task enter place gener number entri mechan interfac specif number entri slider decid fix interfac design interfac level specif task weve design pair number entri chang gener number entri mechan slider user prefer default septemb pm gener number entri mechan enter number type drag slider len number text chang number len show data dial modifi object alter behavior compon drag surfac examin exist data data depict column number data len show data scatter bar chart figur support multipl inform displai wai effect task hand make notion multipl underli data intuit show linkag slider len partial cover text number entri modifi underli number mechan modifi type text entri move vice versa figur show textual data scatter plot bar chart semant zoom make zoom standard part part interfac reevalu semant zoom chang thing depend size zoom natur mechan repres abstract object natur extra detail object zoom view close zoom simpli scale version potenti effect implement digit clock normal size show hour minut zoom make text show eventu date zoom show hour analog clock len posit digit similar doesnt show hand minut mark zoom semant zoom activ role interfac primari mechan retriev data built prototyp tool access system usag includ inform print system user machin depict small object label zoom start process gather show larger object zoom make inform disappear process inact septemb pm visual explor type interact visual briefli advantag variabl resolut interact layout graphic object space interest tradit layout decid visual repres arbitrari graph surfac extrem difficult imposs posit object logic relat object repres link object requir overlap cross edg lai tree difficult gener exponenti number children wont fit fix size space tradit layout techniqu sophist adapt algorithm lai gener result graph hard understand larg tree repres hierarch depict singl box refer tree interact zoomabl method visual repres larg data structur fact room put inform option suit visual hierarch data inform deeper hierarchi made smaller access inform accomplish zoom hypertext markup languag tradit graphic depict relationship window strong semant relationship hypertext click hyperlink bring window link text altern replac content exist import relationship window relationship repres experi layout hypertext document relationship link repres visual layout repres tree distort page focu larg node smaller distort control window graphic view link ad tree current focu view anim node center larg read read hypertext written hypertext markup languag languag describ hypertext document www browser septemb pm mosaic netscap follow link internet figur show snapshot hypertext link view show tree node user interfac access hypertext similar tradit zoom mechan emploi special mechan return object parent altern layout techniqu shown camera special zoom view tree idea give overview tree view individu page read view global context local detail simultan camera drag detail view updat camera point click page camera anim page page brought camera center view layout problem challeng underli data arbitrari cyclic graph graph view hierarchi singl node call root node imagin node shake graph neighbor children neighbor approach displai html document order link describ hierarchi data cycl encount link page user brought origin copi page focu put figur html document load layout implicitli show histori user interact view show tree node directori browser built zoomabl directori browser explor layout directori browser graphic interfac access directori structur filesystem figur directori repres folder icon file repres solid squar color file type directori file show filenam label user suffici close read directori file organ alphabet insid search directori structur zoom directori content base search mechan zoom file automat load text imag insid color squar annot typic level hierarchi visibl figur view filesystem timelin septemb pm scale convei tempor inform event place long period time larg scale event shown small scale notion visual histori comput user interfac timelin visual show decad larg number zoom decad reveal year decad zoom year show event place year figur show sequenc snapshot view zoom figur sequenc view histori comput interfac oval document layout object surfac resid absolut rel posit object encod inform html posit encod order user hypertext document oval document posit reinforc narr structur document guid reader sequenc step eventu lead back start point page bottom edg arc subsequ page edg drawn scale reflect posit tour middl page shown distant start end page larger closer user navig button bottom edg page advanc document click page distant pan zoom page fill screen advantag layout system anim page user infer progress document direct page move page move layout effect access page document zoom small distanc reveal click page document page hyperlink button oval document shown arrow point destin object click hyperlink anim surfac direct reduc user experi navig hypertext document oval document view illustr coordin system lead interest wai lai tradit page base materi septemb pm layout drawback practic short document adopt circular narr structur figur screen oval document layout diagram effort understand space develop analyt tool describ call diagram repres spatial structur inform world magnif diagram visual aspect zoomabl interfac analyz properti discuss diagram briefli discuss detail pan zoom interact basic idea diagram easili illustr dimens typic slice world basic diagram concept illustr figur diagram figur diagram point view zoom point view window septemb pm show point copi magnif copi stack systemat creat diagram horizont ax repres origin spatial dimens vertic axi repres magnif diagram show infinit number point repres line eman origin call line great rai pictur stack form point great rai region cone compar standard world standard viewer small window show small piec world view window pan move part time line zoom narrow scope smaller region time line detail zoom larger section diagram view window repres constant size locat place space scale user pan zoom view segment move rigidli chang sequenc movement repres path diagram advantag diagram reifi movement repres static easier analyz pan oper horizont part path zoom movement great rai type movement correspond curv characterist shape figur basic trajectori shown heavi dash line pure pure zoom zoom point septemb pm abil diagram repres movement path solv concret problem design good interact concern situat system move user view automat point space result sort hyperlink jump result search problem occur interfac move user region zoom solut action jointli pan zoom simpl simpli comput pan zoom independ result nonmonoton pan cover distanc constant pace magnifi world exponenti result target locat rush due pan catch hack fix log power work space scale monoton approach target view captur kind constraint trajectori figur path nonmonoton path exit side violat monoton requir space path exit top bottom violat monoton requir zoom simpl path monoton diagon simpl coordin transform defin diagram defin path yield unintuit hyperbol relationship implement trajectori deriv diagram analysi figur solut simpl joint problem trajectori monoton approach point pan zoom septemb pm found superior uninform effort problem concern notion shortest path point paramet space curiou question shortest distanc point gener straight line pan expect time cost linear spatial zoom fastest point point tediou pan fact shorter zoom make small zoom figur inspir diagram defin inform theoret metric cost path function number bit transmit movi motion address question find good path make movi small found point window width pure pan motion pretti point zoom plai major role diagram repres semant object chang size magnifi object point small turn solid label page figur show semant zoom differ ordinari geometr triangular region chang scale axi explicitli repres aspect object made visibl intend diagram creat semant zoomabl object idea provid edit environ transit boundari figur shortest path point straight line arrow repres unit cost zoom zoom make small pan zoom back make larg pan directli septemb pm move align direct manipul diagram capit fact static repres scale inher readili analyz procedur anim substrat build anim object complex interfac widget recent appli techniqu creat anim actor widget emploi mechan control movement gestur simul person ultim goal support inform physic object anim natur applic design convei user structur anim narr assort disjoint tempor event approach goal provid mechan definit graphic object defin hierarch control mechan movement start defin simpl widget button slider behavior level make easier applic develop easili chang feel applic widget definit suppli tradit design easili chang visual figur semant zoom bottom slice show view point septemb pm style interact mechan explor widget advantag zoom environ extens mechan implement choic widget altern tradit menu figur show view widget view left show zoom view widget show current zoom widget choic visibl user select figur prototyp zoomabl choic widget widget implement render languag languag design fast compact effici execut time faster execut time stack languag simpl structur execut time roughli faster interpret languag speed execut script render effici render item substrat step creat complex anim definit simpl repetit motion object base stochast process mechan automat transit motion stochast process defin rotat magnitud coher appli give natur behavior mechan chang motion hierarch control chang paramet stochast movement environ chain sequenc motion transit build complex anim behavior user interfac handl transit action tempo morph approach start tempo tempo action time continu vari speed master clock tempo phase depend synchron action preserv transit defin action extend transit action surfac multipl actor maintain individu tempo relat notion explor attent actor convei process distract user current import zoomabl environ abil provid awar process import attribut paradigm studi semant discret state transit visual septemb pm resent shift attent actor surfac quickli convei user actor user interact interest determin extent encod textur interact order convei visual impress complex activ scale requir detail suspect techniqu charact anim effect implement implement version unix oper system standard graphic librari system run ibm pc run trivial portabl unix system implement widget applic written interpret tcl languag featur access tcl make unnecessari write code effici order anim dataspac size complex util standard effici method creat power system successfulli load object directori maintain interact rate frame object check time movement object visibl kei render system time roughli proport number visibl independ number object effici method spatial object store intern hierarchi base bound box fast index visibl object automat restructur hierarchi object maintain balanc tree fastest index render fast navig lower draw small item system idl short scene success drawn maximum resolut render item differ depend larg screen render lower resolut region updat portion screen chang link area screen refin independ septemb pm render portion larg object visibl appli imag text adjust frame anim zoom maintain constant perceptu independ processor scene window size accomplish render fewer time slow anim interrupt input event anim immedi brought end state refin immedi return control user object repres larg dataset directori tag automat remov render reload visibl optim imag code render zoom imag carefulli optim zoom imag script languag interfac import design implement creat fast effici graphic make extens make easili experi interfac mechan implement make difficult author add object interact compil link cycl slow make difficult decid creat interpret script languag interfac problem approach work long script languag level script languag system easi modifi critic code written effici system class speed creat script languag fine handl small amount script languag render languag render effici languag user defin widget anim result septemb pm anim perform linux base pc platform chose tcl primari script larg combin librari creat graphic user interfac built widget tk combin standard widget make complet applic build debug widget mechan compar zoomabl interfac tradit interfac mechan system tcl interfac design similar interfac tk canva widget surfac draw structur implement tk canva add extra featur tcl interfac summar give feel program experi script languag suit task primarili requir higher speed anim incorpor altern gener program high speed interact tcl interfac command creat manipul refer object uniqu integ id object group mechan associ data object command direct specif object id case appli object share tag widget command start widget exampl widget pad red rectangl black outlin creat corner point pad creat rectangl black put item number point make object make object anchor point northwest pad item number visibl largest dimens greater pixel pixel pad septemb pm straightforward make script evalu specif event hit group object simpl macro expand event script inform specif event exampl make item tag foo turn blue left button press pad bind foo pad blue singl event bind group object affect object click macro expand specif pad bind foo pad blue basic navig search mechan provid tcl interfac basic smoothli locat magnif millisecond pad smoothli locat object number fill quarter millisecond pad center return list object id text pad find foo event briefli attach event handler item surfac specif event hit event handler evalu system oper tk canva mode event handler defin specif mode mode simpl text string default surfac set activ event mode includ septemb pm event handler mode activ fire creation event handler select set mode event search protocol event hit item event handler defin event search protocol specifi item search event handler event portal check event handler portal check bottom order event portal search order specif object object tag portal tag event portal intercept event event pass event event sequenc recogn bind command event handler call event pass portal top order replac event call handler command execut return special modifi event modif includ kill stop event portal pass chang list activ mode surfac event hit chang coordin event pass event event handler pass event gener event handler commonli singl event trigger event handler specif item class item messag item send arbitrari messag item group item messag send facil analog event includ search protocol pass mechan callback addit event bind item item defin tcl script evalu special time septemb pm type render callback render callback script evalu time item render script execut object render object script render object time function item number modifi call tcl procedur surround object render pad pad call object render render routin render make defin object whatsoev item defin render script call procedur object creat anim object chang custom object implement semant zoomabl size object callback timer callback timer callback script evalu regular independ item receiv event zoom callback zoom callback script evalu item render size previou cross threshold typic creat effici semant zoomabl object object chang cross size effici avoid script evalu border cross extens extens tcl script easi mechan defin command compound object type treat object command interact line text extens extens defin creat tcl command specif prefix septemb pm extens defin command invoc defin procedur make automat specif registr procedur definit creation object defin command procedur defin command defin object type strategi interfac design explor part research program develop altern strategi interfac design goal move mimick mechan earlier media start fulli exploit radic mechan inform physic view interfac object effect complement tradit approach inform physic strategi interfac design involv distinct approach tradit approach map level object function yield interfac object trash function open close window menu benefit orient design mimick mechan earlier media explor potenti effect mechan semant zoom mechan natur adopt inform physic strategi geometr order magnitud mechan tradit metaphor lead design investig interfac design interest interfac semin work sutherland sketchpad simul interfac led develop direct manipul style interfac exampl gener approach deriv sutherland continu inspir develop recent exampl includ work born student witkin approach construct dynam interact interfac smith altern realiti kit languag exampl strategi interfac design system make techniqu simul distinct data interfac unifi simul object interfac object concret base implement mechan level tradit user access control paramet underli physic altern realiti kit approach realiz septemb pm mimic realiti chang point cartoon anim mechan physic world effect achiev import cost benefit tradit strategi lead explor mechan limit view interfac wai metaphor necessarili metaphor solar system describ atom design limit metaphor resourc hand metaphor refer familiar order work unfamiliar interfac metaphor function metaphor design metaphor design physic descript behavior interfac design offer design option tradit approach metaphor temporari bridg concept die linguist metaphor lose metaphor impact foot mountain leg success metaphor wind dead metaphor familiar provid metaphor earlier stage familiar interfac due actual experi actual detail behavior overarch metaphor form substant knowledg experienc user restrict behavior entiti interfac avoid violat initi metaphor potenti restrict function emploi support user task interfac continu evolv user compet similarli dead metaphor window restrict altern organ interact comput clash dead metaphor file newer concept persist distribut object hierarchi sheer amount complex inform interact continu requir interfac design strategi scale tradit strategi scale physic scale organ greater greater complex uniform applic set simpl law greater complex metaphor structur correspond metaphor target refer design start merg function separ applic serv integr natur complex task metaphor work individu simpl compon septemb pm applic typic smoothli integr support complex task clear metaphor harm lead user import knowledg support interfac point metaphor primari design strategi restrict rang interfac design effect tradeoff design led larger space interfac cost design strategi cost design longer reli heavili user familiar metaphor refer level tradit object design longer learn power metaphor earli usag rapidli power actual experi focu easili physic case physic creat equal equal fit requir human cognit futur direct adequ explor effect substrat inform physic design strategi discuss requir develop wide rang applic domain plan investig construct activ document tool interact document web browser mosaic predefin interact widget client hook provid document access widget method provid modifi client distribut client user popul standard practic extens ensur widget defin script includ document document provid form interact depend client suppli design stage extens html call markup languag markup languag describ document logic format document size provid method script includ document activ document addit data investig replac standard window system consist basic semant zoomabl gaug displai statist list task state printer peopl log intend extend tool comput resourc facil access navig produc suit septemb pm zoomabl applic order support exist incorpor mechan control placement applic window screen make blend surfac move window act extend virtual window manag effect screen size zoomabl applic resid side side collabor work environ origin pad implement basic share workspac singl process displai multipl design sophist approach goal portal remot surfac network permiss user system spatial server send updat system portal lag retriev cach local system interact wont lost build complet visual interfac creation interact visual dataspac multimedia author tool director tm appl multimedia author tool tm visual design program experi creat beauti complex interact hypertext data retriev system discuss layout html huge data surfac potenti allevi problem navig larg hypertext document build set tool visual design creat interact zoomabl multimedia system avail substrat approach point start make wider commun goal make freeli project home page current inform acknowledg work support part arpa contract mexico support receiv craig part hci initi arpa david fox matthew fuch nyu eric de david jason stewart discuss zoomabl interfac acknowledg member comput graphic interact media research group bellcor discuss share continu search septemb pm refer ronald human factor readabl acm benjamin larri jame advanc acm sigchi confer benjamin bederson jame zoom graphic interfac explor altern interfac acm symposium user interfac softwar technolog eric ken william toni magic acm siggraph confer alan born simul technic report xerox palo alto research alan born tool build user acm transact brook robust layer control system mobil ieee journal robot stuart georg mackinlai inform inform acm human factor comput system confer chang david ungar cartoon user acm symposium user interfac softwar technolog person steve sue georg tom rai harshman index latent semant analysi journal american societi inform william spatial manag acm siggraph textur procedur academ stephen joseph eric tool visual softwar ieee transact softwar septemb pm kim steven georg furna graphic larg knowledg cognit scienc applic lawrenc erlbaum georg gener acm sigchi pp georg furna benjamin understand acm press michael draw formal video william jame david tim edit wear read acm pp william hill jame digit press jame elain william david wayn kent jonathan member human interfac laboratori introduct human interfac tool intellig user pp jame hollan scott acm pp chapter read groupwar comput support cooper work georg lakoff mark metaphor live chicago gg perspect detail context smoothli integr human factor comput acm john tcl tk addison ken perlin david fox altern approach comput acm siggraph ken imag acm siggraph ken video acm siggraph septemb pm randi altern realiti anim environ creat interact ieee comput societi workshop visual randi experi altern realiti tension liter acm ken eric bier movabl filter user interfac acm ivan sutherland graphic commun spring joint comput book david ungar randi power oopsla andrew michael william welch interact comput
IR/902 5 web document feasibl demonstr oren zamir oren etzioni depart comput scienc engin washington wa usa abstract user web search engin forc sift long order list document return engin ir commun explor document cluster altern method organ retriev cluster deploi major search engin paper articul uniqu requir web document cluster report evalu cluster method domain kei requir method creat cluster base short snippet return web search engin find cluster base snippet good cluster creat full text web document satisfi stringent requir web introduc linear time document collect algorithm call suffix tree cluster creat cluster base phrase share document show faster standard cluster method argu web document cluster feasibl potenti benefici introduct convent document retriev system return long list rank document user forc sift find relev document major todai web search engin follow paradigm web search engin extrem low low web search engin coupl rank list present make hard user find inform attempt filter method shake advanc prune option selberg attempt make search engin result easi paper consid document cluster feasibl method present result web search engin document cluster algorithm reli cluster entir document collect cut silverstein web search engin collect larg fluid cluster cluster appli smaller set document return queri search engin servic million queri permiss make copi part work person classroom grant fee provid copi made distribut profit commerci copyright titl public date notic copi permiss copi post server redistribut requir prior specif permiss fee australia acm free cpu cycl memori dedic individu queri sever cluster perform separ receiv search engin result creat cluster present user base identifi kei requir web document cluster method produc cluster group document relev user queri separ irrelev browsabl user determin glanc cluster content interest replac sift rank list sift cluster method provid accur descript cluster document multipl import avoid confin document cluster method produc high qualiti cluster access snippet return search user unwil wait system download origin document web patient user sift document rank list present cluster user order magnitud document cluster method cluster thousand snippet impati count save method start process snippet receiv web introduc suffix tree cluster time algorithm design meet requir treat document set word make proxim inform word reli suffix tree effici identifi set document share common phrase inform creat cluster succinctli summar content user demonstr effect speed creat prototyp cluster web search access output metacrawl meta search engin cluster algorithm figur show sampl output provid preliminari evid satisfi snippet paper denot number document cluster number word document assum bound constant relev benefit creat overlap cluster share phrase cluster provid inform summar user studi valid belief area futur work search result cluster num size share phrase sampl document titl puerto latin music music austin home page follow york dancer origin develop york dancer artist latin midi file exchang music web con compani religi experi arizona cuisin gift tomato mix figur output cluster engin queri cluster shown word bold share phrase found cluster note descript power phrase paper organ section assess extent previou work document cluster meet requir web domain section describ detail report evalu cluster algorithm web domain conclud summar contribut direct futur work previou work document cluster section review previou work document cluster algorithm discuss algorithm measur requir web domain document cluster investig mean improv perform search engin entir corpu cluster hypothesi van cluster investig document techniqu cut allen work altern paradigm numer document cluster algorithm literatur agglom hierarch cluster algorithm commonli algorithm typic slow appli larg document collect method typic method typic time experi algorithm slow meet speed requir thousand document halt criteria algorithm suggest typic base predetermin constant halt cluster algorithm sensit halt criterion algorithm mistakenli merg multipl result cluster meaningless user web result queri extrem vari type relev sensit halt criterion poor result characterist web domain receiv outlier sort reduc effect commonli halt criteria linear time cluster algorithm candid compli speed requir cluster includ algorithm time complex number desir cluster number iter method number cluster creat advantag algorithm unlik produc overlap cluster chief disadvantag effect desir cluster approxim spheric respect similar measur reason document standard weight word vector form normal similar fall approxim spheric cluster method suffer order depend tendenc produc larg cluster popular increment cluster algorithm popular event detect domain fraction linear time cluster algorithm introduc fraction approxim search closest cluster perform local bound region algorithm suffer disadvantag arbitrari halt criteria poor perform domain outlier algorithm initi cluster centroid creat appli cluster sampl document collect sampl riski possibl interest small repres sampl note algorithm increment contrast mention algorithm treat document set word order sequenc lose valuabl inform phrase long supplement index ir system bucklei al lexic atom syntact phrase shown improv hurt recal phrase gener simpl statist approach contigu successfulli hull method wide appli document cluster author pair word attribut attempt handl larg number document return search engin search engin provid queri refin featur suggest word ad exclud queri word organ group repres cluster document northern light search engin search retriev document organ folder label singl word document label northern light reveal method creat folder cost suffix tree cluster suffix tree cluster linear time cluster algorithm base identifi phrase common group document phrase context order sequenc word defin base cluster set document share common phrase logic document identifi base cluster suffix combin base cluster cluster step document string text repres document transform light stem algorithm word prefix suffix reduc plural sentenc boundari punctuat html mark token html tag strip origin document string pointer begin word transform string posit origin string enabl identifi kei phrase transform displai origin text enhanc user readabl step identifi base cluster identif base cluster view creation invert index phrase document collect effici data structur call suffix tree structur construct time linear size construct increment document read idea suffix tree document cluster introduc present improv cluster introduc merger base cluster compar standard ir methodolog classic cluster method web domain suffix tree string compact trie suffix treat document string suffix word suffix tree direct tree intern node children edg label label node defin concaten path root node edg node begin word suffix exist label equal suffix tree collect string compact trie suffix string collect mark design string origin label suffix construct suffix tree sentenc document collect figur suffix tree set string node suffix tree drawn circl box attach design origin number box design string origin order string number design suffix string label node figur label refer cat figur suffix tree string node suffix tree repres group document phrase common label node repres common set document tag descend node make document group node repres base cluster base cluster node suffix tree tabl list mark node shown figur base cluster node phrase document cat tabl node shown figur base cluster base cluster assign score function number document word make phrase score base cluster phrase number document base cluster number word score effect length maintain stoplist supplement internet specif word word document receiv score function penal singl word linear phrase word constant longer phrase step combin base cluster document share phrase document set distinct base cluster overlap ident avoid ident step algorithm merg base cluster high overlap document set consid figur top cluster result merg base cluster label base document set overlap defin binari similar measur base cluster base overlap document set base cluster size repres number document common base defin similar similar defin base cluster node base node connect iff base cluster similar cluster defin connect compon base cluster graph cluster union document base cluster figur illustr base cluster graph base cluster tabl singl cluster ts document ts ts document cat document figur base cluster graph figur tabl connect cluster notic word base cluster discard score connect compon repres cluster cluster base cluster cluster algorithm predetermin minim similar base cluster serv halt criterion cluster algorithm increment order independ encount undesir chain effect cluster domain base cluster typic find small connect compon algorithm increment document arriv add suffix tree node updat result tag updat relev base cluster recalcul similar base cluster rest base cluster check base cluster graph result final cluster cost step dont check similar modifi base cluster base highest score base cluster cost document linear collect size cost insert document suffix tree linear collect number node affect insert time complex linear regard collect size final cluster score sort base score base cluster overlap final number cluster report top cluster top cluster interest cluster report number document phrase base cluster goal cluster algorithm domain group document share common necessarili partit collect claim artifici forc document document topic constraint cluster produc document cluster acknowledg document complex object group multipl potenti intern group reason ir system form document similar measur euclidean document similar multipl distinct document centroid turn dissimilar document share phrase document number base cluster document cluster note overlap cluster merg singl cluster shown figur queri cluster relat recip produc cluster relat compani sell product document correctli cluster includ recip inform compani market algorithm requir user requir number cluster requir specif threshold determin similar base cluster found perform sensit unlik algorithm show extrem sensit number cluster requir experi order evalu compar origin rank list search engin cluster algorithm algorithm comparison agglom hierarch cluster refer fraction algorithm chosen commonli rest chosen fast contend cluster construct document collect save result queri metacrawl search engin chose standard ir interest perform document cluster web metacrawl meta search rout queri search engin collat assum search result snippet return repres web search engin effect inform retriev standard ir forc gener queri relev awar lead bia result counteract potenti plan publish data set web independ valid replic experi process defin queri topic bear descript interest account black bear attack human inform prevent word queri topic field keyword web search metacrawl search engin gener collect snippet result queri snippet return search download origin document gener collect web document manual assign relev judgment document collect base queri descript averag relev document queri experi appli cluster algorithm document collect compar effect inform retriev result cluster algorithm reorder list document return search variat method laid assum user select cluster highest relev document densiti cluster algorithm tend produc cluster size artifici influenc comparison consid constant number document start top cluster work subsequ cluster reach document remain document consid irrelev pick singl pick fraction assumpt standard evalu cluster algorithm empir test shown user fail cluster time hearst work realist model user probabl make error case top cluster document collect reorder method appli overlap document document addit time deem user actual user behavior complex methodolog model user behavior user pick larg cluster investig scan document user pick small cluster proce cluster algorithm run produc number cluster fair comparison algorithm algorithm paramet set relev minim cluster optim separ data set figur compar averag cluster algorithm origin rank averag web document collect fraction origin list algorithm averag figur averag cluster algorithm origin rank list return search averag origin document collect figur algorithm score highest experi posit result due part phrase identifi cluster due fact natur overlap cluster experi document cluster averag document cluster base cluster base phrase word measur impact featur ran ablat studi creat variant algorithm variant ran phase elimin overlap cluster remov document cluster centroid closest document variant singl word phrase perform variat figur cluster overlap phrase critic success phrase kei basi identifi overlap kei mean decid phrase document determin assign cluster overlap enabl document potenti particip cluster base share phrase document algorithm figur averag document collect variant forc result true partit singl word phrase consid phrase overlap improv averag standard cluster algorithm straightforward manner argu suffix tree perform term extract sort document measur impact introduc phrase addit attribut perform cluster algorithm examin cluster algorithm compar standard algorithm singl word document vector modifi version phrase identifi suffix tree attribut document vector experi run origin web document collect result figur show modif posit neg impact perform effect dramat impact phrase algorithm understand issu algorithm singl word phrase figur averag cluster algorithm phrase identifi suffix tree perform degrad substanti phrase modif substanti consist effect algorithm examin effect overlap cluster algorithm modifi overlap cluster document cluster iter algorithm impact figur small algorithm overlap overlap figur averag cluster algorithm compar nonoverlap version algorithm chosen easili adapt produc overlap cluster interest note cluster overlap produc algorithm tabl present averag number cluster document algorithm calcul statist separ relev irrelev document tabl overlap produc greater algorithm averag document multipl cluster advantag document densiti relev document user place irrelev document multipl cluster hurt cluster qualiti ratio statist row tabl view indic benefit overlap cluster averag result figur correl ratio algorithm effect overlap cluster figur highest avg num relev document avg num irrelev document ratio tabl averag number cluster document algorithm calcul statist separ relev irrelev document ratio statist view indic benefit overlap cluster clear phrase overlap critic success element plug cluster algorithm part algorithm conjectur phrase base cluster convei cluster content user cluster displai phrase base cluster cluster averag base addit word frequent cluster word identifi cluster user studi carri corrobor conjectur snippet versu document major issu cluster web search engin result similar perform produc cluster snippet return search engin figur show cluster snippet affect perform cluster algorithm continu reli relev judgement previou experi shown figur qualiti cluster appar small web document word averag word elimin stoplist word word snippet word averag word word explan snippet repres attempt search engin extract phrase origin document snippet phrase correct cluster present origin document misclassif document result intim earlier find show cluster qualiti affect truncat vector document standard ir collect fraction algorithm snippet origin document figur averag cluster algorithm snippet collect compar averag origin web document collect execut time measur execut time cluster algorithm cluster snippet collect size result shown figur report time averag collect size time measur linux machin run pentium processor number snippet fraction figur execut time cluster algorithm snippet collect function collect size faster graph suggest due increment natur carri cluster process document arriv web return result user mere document receiv plain linear time algorithm produc cluster collect hundr document fast true interact shown linear time algorithm comparison conserv account increment natur argu document cluster machin separ search engin receiv search engin result web output cluster user cpu time system wait search engin result arriv web web delai order produc result instantan document algorithm start comput increment enabl system instantan displai result impati user interrupt cluster event detect track task main contribut paper identif uniqu requir document cluster web search engin definit time cluster algorithm satisfi evalu cluster algorithm web search engin form baselin futur work preliminari experi encourag suggest fast document cluster algorithm cluster search engin result cluster snippet return search engin reason altern download origin document needless user studi demonstr direct cluster search engin result support inform access task web experi confirm appar advantag exist cluster algorithm gather data field system web instrument system log queri cluster link user futur work intend report statist behavior system perform control user studi contrast present cluster method acknowledg richard karp contribut research marti david lewi maarek comment earlier draft paper feldman earli discuss relat knowledg discoveri text research fund part offic naval research grant darpa rome lab grant nation scienc foundat grant refer littman interfac navig cluster document set return queri acm confer organiz comput page allen singhal automat queri harman text retriev confer depart pedersen tukei approach larg document collect intern acm sigir confer research develop inform page karger pedersen constant larg document collect intern acm sigir confer research develop inform page croft organ search larg file document phd thesi octob fagan experi automat phrase index document comparison syntact method phd cornel algorithm tree comput scienc comput chapter cambridg hearst pedersen reexamin cluster retriev result intern acm sigir confer research develop inform page hearst categori cluster inform access interfac strzalkowski natur languag inform kluwer academ hill vector cluster techniqu inform retriev pedersen xerox site spanish track harman text retriev confer nist special croft evalu techniqu cluster search result technic report depart comput maarek librarian automat organ book dynam cooper examin procedur detect number cluster data set rasmussen cluster algorithm frake inform page prentic document retriev system optim evalu phd harvard yang yu theori term import automat text analysi silverstein project effici document cluster intern acm sigir confer research develop inform page selberg etzioni search comparison metacrawl world wide web langheinrich etzioni home page finder world wide web silverstein pedersen time cluster arbitrari corpu subset intern acm sigir confer research develop inform page tdt colleg octob construct suffix tree van inform implement agglom hierarch cluster algorithm document retriev inform process linear pattern match algorithm annual symposium foundat comput scienc page willet recent trend hierarch document critic review inform process karp fast intuit cluster web document intern confer knowledg discoveri data page evan evalu syntact phrase index nlp track report harman text retriev confer nist special
IR/903 5 induct typolog text classif multivari statist analysi nlp system serg serg gabriel pierr sophi de corpu usag cnr en franc cnr universit pari sud franc abstract method natur languag process base huge corpora requir syntact homogen text master develop methodolog associ tool text calibr benchmark call construct contemporari french base multivari analysi linguist featur integr tool modular architectur base gener model hand flexibl annot corpu output nlp statist tool hand retrac result tool annot layer back primari textual data justifi interpret introduct natur languag process increasingli depend method avail corpora longer huge annot corpora readili real problem corpu heterogen studi cover area nlp suggest perform natur languag system depend work homogen shown perform probabilist tagger relat domain oper perform test corpu probabl categori function domain colloc shown differ significantli domain instanc shown perform parser depend domain examin result obtain probabilist syntact parser domain brown corpu romanc observ vari differ perform term recal depend learn domain test domain similar observ made perform inform retriev system examin depend relev queri trec evalu campaign categori articl wall street journal part tipster corpu categori base classif stylist featur averag word averag word proport digit letter result suggest articl judg relev queri specif categori articl chosen system queri found specif categori suggest corpu heterogen induc type statist error random error occur sampl small repres bia error occur featur sampl systemat popul architectur text profil paper present methodolog set tool text part corpu term linguist featur base intern properti text pattern categori aim text profil method produc measur corpu homogen part corpu enabl construct homogen subset corpu term paramet model approach similar work text classif text group contemporari english text repres vector featur featur base categori aspect automat extract word text text point dimens space text close space similar properti featur dimens close comput featur frequenc build vector featur space reduc discrimin analysi result discrimin analysi featur mixtur origin featur discrimin dimens cluster method group text term locat space result cluster type text correspond directli text languag style regist project text space permit assign type closest cluster project continu extend work wai appli kind analysi french languag analysi framework base work english made french framework linguist featur describ text featur set featur vector comput text analysi process develop architectur enabl work textual corpu appli tagger featur extractor text sgml format store annot nlp tool add text develop sgml awar specif tool correct error made tool master qualiti featur extract assembl set statist analysi tool develop specif tool graphic tune result automat cluster featur set classif top gener architectur effort link maintain textual data origin featur classif text type obtain follow link back text type textual data origin specif featur classif dimens permit tune specif featur extract accentu contrast class main goal stabil interpret present result obtain architectur al paper present justifi architectur profil architectur project architectur modul develop modular architectur flexibl framework process annot text studi corpu heterogen bottom architectur consist collect text tag encod recommend text descript header attach perform queri base descript variabl text extract subset text text relev studi applic descript variabl includ inform type document journalist press includ categori describ newspap section articl belong current step perform tag associ lexic item word stem tag process associ part speech categori inform lexic item tag base work constant prove robust tagger evalu programm grace lower level present dai includ class adverb categori part word item tag perform typolog consist replac inform gener tagger categori categori calcul tag vari featur studi result tag corpu matrix matrix frequenc featur text corpu studi result tag corpu statist softwar program analysi matrix identifi relev featur opposit make induct classif text type statist treatment perform type aim explor correl linguist featur compon correspond consist observ featur small group featur order determin relev relat classif enabl observ featur necessarili rule probabl law impli text point chang point classif type train impli place text preexist classif quinlan evalu architectur corpu process test architectur tipster tipster architectur natur languag process system base approach mean inform text store separ text text remain unchang inform text annot encod sgml format model annot link arbitrari inform text segment document base relev document segment identifi charact span byte stream document term offset model annot defin class repres element inform extract inform retriev type document group collect annot model tipster architectur ti specif make portabl rang platform gate architectur specif implement tipster gate gate base tipster aim make heterogen nlp modul develop complex system store separ primari data refer gate architectur main compon gate document manag descript inform document gatewai queri languag engin compon integr architectur compon commun directli api function retriev inform output direct collect reusabl object languag engin modul interfac resourc resourc programm data semant tag modul objectori encapsul function interfac attribut object method launch call api method queri obtain inform document primari data store result analysi process modul result modul analysi modul gate graphic interfac graphic tool displai resourc underli make task interconnect compon explor combin exist modul easier effort requir develop tool gener intermedi format specif format accept gener exist modul im im corpu workbench workbench develop search engin aim studi tag corpu textual data accompani annot treat base store index order queri answer promptli queri express term regular express part annot sequenc annot architectur suit effici handl corpu annot lt xml lt xml lt xml approach base success unix filter stage process tag sgml tree event sequenc constitut sgml document context requir formul queri architectur enabl type annot whilst formal valid data stage sgml event flow solut multipl annot storag annot singl document versu distribut annot approach facilit subsequ access document establish connect level annot favour annot diverg enabl articul great number simultan annot link compon pivot format modul modul remain control render modul singl format solut favour joint heterogen homogen treatment architectur constraint platform architectur model fulfil requir support multipl linguist phenomena aim project studi distribut correl linguist phenomena provid measur text homogen basi text typolog part task hand determin linguist event statist discriminatori yield relev result lead defin text type determin empir test requir flexibl architectur underli linguist phenomena architectur support type segment mark primari textual data plan parallel annot part speech output po tagger typolog mark base uniqu set featur mention part task hand determin featur statist discriminatori set featur typolog mark constantli pace result test set profil featur open featur level present featur emploi belong categori charact punctuat capit letter digit close lexic set categori function word typolog categori text imag chart achiev flexibl support multipl build layer annot primari textual data remain whilst success annot layer store separ document annot connect primari data link approach share aspect tipster architectur hand reminisc tipster approach annot separ text differ approach annot encod sgml trace back result annot layer segment typolog mark built typolog mark build part speech tag annot layer document header bodi header inform describ annot oper perform annot question header inform rel specif softwar output articul typolog mark relev choic made point bodi annot tag element express indirectli term link point element layer element layer merg liter bodi annot document speed process annot layer corpu primari data form multipl annot layer branch element primari corpu lower annot level element text chunk primari corpu annot element higher access complet sequenc treatment annot track oper perform subset text chunk impli retrac oper step step access paramet choic perform step document descript header annot document crucial order correctli interpret result statist analysi import reason statist method factor base multivari analysi contrast natur mean result valid scope paramet rel extract queri lead construct paramet statist method emploi analysi provid contextu inform interpret result typolog mark text profil abstract hard interpret result statist method give pattern opposit correl abstract linguist featur order interpret pattern essenti backtrack step construct featur recov context text origin order check interpret examin behaviour trait context studi construct principl aim text profil method calibr corpu term criteria order achiev calibr perform view word construct term combin paramet requir architectur corpu fine grain base level element corpu textual unit document built extract assembl relev textual unit relat paramet achiev extract entir document heterogen relat criteria vari enorm length base level segment unit paragraph implement segment scheme envisag architectur support annot structur unit arbitrari conflict annot data achiev overlai multipl annot level segment corpu extract result document descript header bodi textual chunk relev extract queri merg relev annot merg relev annot chunk document stream document flatten linear chunk annot layer annot chunk merg relev parallel conflict annot singl sgml stream result corpu annot corpu limit mark relev linguist phenomena studi typolog result statist analysi extract result corpu form annot document descript header detail kind statist analysi undertaken bodi annot document tag result connect textual chunk backward link statu project result kind annot extract criteria construct subsequ corpora articul type descript inform explor order establish correl statist result classif scheme modular design modular architectur provid open testb text analysi tool plug aim test compar statist treatment tool found commun automat difficult simultan gate articul encapsul treatment emploi approach standard sgml format encod studi gener intermedi document directli output applic format redund wast storag space intermedi document firstli trace back interchang format applic format easili sgml process librari instanc document gener matrix row text variabl featur output applic format matrix straightforward annot base structur featur experi typolog mark enabl examin featur critic light lead scatter occurr make contrast case verb current choic featur verb categori fragment limit number occurr grip verb consid tendenc respect section articl featur rough hide real opposit case nombr group quantiti effect differenti case noun result relev tagger output inform indic noun morpholog relat verb adject chang granular inform output highlight contrast text directli visibl result tagger aim fact manipul structur featur order inform total partial kind tag enabl select subset featur structur emploi unif grammar make inform result style instanc oper perform adopt formal repres word corpu featur structur advantag approach featur transform carri formal framework unif grammar featur logic benefit transform tool develop domain enrich primari text collect document descript header segment paragraph extract analysi collect paragraph assembl criteria descript header ing extract paramet analysi result document descript header ing analysi paramet bodi consist link specif point locat indirectli primari text collect figur inform output tagger rigor formul term oper conjunct disjunct featur test possibl sum featur creat super featur express term disjunct conjunct elementari featur defin stand properti agenc conjunct elementari featur activ formal qualiti featur structur fact express hierarch inform depend kind opposit highlight featur level featur structur gener nest structur featur structur flatten end transform process oper featur transform perform al consist sourc hand side target hand sourc rule match featur structur unif featur structur transform specif rule target figur show transform typolog mark built tag form si le de action ce moment nou en extract tag nt verb typolog mark figur annot flow success annot level shown top extract produc document group paragraph atom extract analysi satisfi constraint extract queri document xml object descript header uniqu identifi paragraph includ document uniqu identifi concaten identifi origin identifi text collect paragraph identifi text collect extract integr identifi identifi scheme annot level architectur tagger output store annot document uniqu identifi instanc paragraph identifi advantag scheme transform text chunk retrac identifi annot document code tagger illustr output robust tagger raw output tagger paragraph store document step typolog mark construct featur structur tagger result transform refin inform ad tag ambigu verb person express disjunct valu gener statu architectur architectur present base gener model develop test framework project implement project project present project develop research develop de collabor en normal de aim project extract promin emerg topic automat analysi compani social player textual data analysi method corpu studi project million word heterogen book corpor union summari corpor transcript tape trade union modular architectur open framework tool plug result text mine tool integr corpu architectur structur layer corpu primari point relev unit corpu architectur structur level level consist collect document tag ce encod recommend defin document level provid descript header segment minim textual unit case correspond extractor develop xml python librari retriev relev text chunk assembl homogen exploit size extractor run queri descript paramet store document header full text search constraint essenti text mine softwar run homogen corpora order yield relev result dynam assembl corpora constitut level corpu architectur result treatment perform statist softwar structur annot layer point textual primari data collabor aim adapt architectur process web site mark passag present prototyp gener profil architectur aim project provid methodolog practic framework web site profil develop typolog site approach consist site set indic content structur step defin subsequ enrich descript site term content structur indic inform pump descript header site header remain open extend inform deem relev subsequ lead proposit content typolog predefin topic index construct content categori induct approach result analysi obtain cross formal structur content typolog consist describ articul formal semant descript site practic account agent involv approach aim progress establish implicit exchang rule web architectur modular framework text profil text typolog enabl flexibl text annot importantli document backtrack transform result nlp statist analysi tool essenti order produc explanatori principl model correl linguist featur text typolog pursu test determin relev linguist featur present describ text typolog measur text homogen perform test framework featur express power oper perform structur defin combin featur granular enlarg scope natur featur project linguist structur mark refer variat speech write cambridg cambridg corpora gener languag studi comput dimens regist variat comparison cambridg cambridg le de discour lausann modular flexibl architectur integr corpu queri system confer comput lexicographi text hungari archiv id par couch de ecol de pari practic header larg corpora comput text encod initi background edit nanci id jean carpent klein levin le structur de miller pour le automatiqu du langag chapter page pari tipster architectur design document version technic advanc project agenc le mond en main lafon de text de lafon le de donn corpu automatiqu de pour page manuel de langag pari stylist experi inform retriev pour en adt de grand corpu sgml basi nlp confer appli pp acl domain depend confer appli natur languag pp associ comput linguist introduct approach grammar csli lectur note csli pour du discour labor dune
AI/904 2 execut monitor robot program giusepp de giacomo dipartimento di informatica sistemistica di roma rai reiter depart comput scienc toronto depart comput scienc toronto abstract imagin robot execut program reason continu program matter exogen event occur world execut monitor robot process observ world discrep actual world intern recov discrep provid situat account program monitor account reli specif interpret logic program languag golog theori support implement illustr standard block world robot execut golog program build suitabl tower monitor make simpl kind planner recov malici exogen action perform agent perform sequenc action gener recoveri robot elimin discrep resum execut program author mention alphabet introduct motiv imagin robot execut program reason continu program matter exogen event occur world treat robot execut program build tower block environ inhabit malici agent arbitrarili move block robot robot equip observ world fail conform intern world absenc malici agent robot observ discrep actual world model give complet execut program call programm give sophist anticip discrep actual world intern instruct recov failur repertoir gener failur recoveri invok recoveri techniqu involv detect robot comput plan restor state world exogen action occur execut resum execut program recoveri strategi discuss execut monitor robot process observ world discrep recov perceiv discrep approach execut monitor paper option option valuabl difficult write program account except case easier inexperienc write simpl program languag sophist execut monitor experienc robot track actual execut program robot execut program physic perform action program execut primit action program test execut monitor observ exogen action occur monitor determin exogen action affect success outcom execut simpli continu execut discrep robot intern world model discrep execut robot monitor determin correct action nondeterminist idea execut program problemat section form program robot continu execut origin program understand execut monitor mechan output compar sensor measur intern model produc program execut make thing paper provid situat account program monitor illustr theori standard block world environ robot execut golog program build suitabl tower monitor make simpl kind planner recov malici exogen action perform agent robot perform sequenc action gener recoveri discrep elimin robot resum build goal tower situat calculu golog situat calculu specif design repres dynam chang world version situat calculu axiomat primit action fluent domain provid action precondit primit action syntact form formula free variabl situat term action precondit axiom formula condit execut action situat addit provid suitabl uniqu axiom action successor state fluent syntact form formula free variabl situat term successor state axiom embodi solut frame problem reiter axiom describ initi situat true action occur finit set sentenc mention situat term situat independ golog present extend golog languag primit action background domain theori typic golog program intend execut sequenc action extract comput execut variant golog intend execut includ empti program primit action test truth condit oe ffi sequenc ffi nondeterminist choic action nondeterminist choic argument action ffi nondeterminist iter proc fi procedur formal paramet bodi fi block world golog program nondeterminist build tower block spell procedur build rome tower determin block letter clear select block letter move similar procedur note procedur paramet proc tower proc proc associ program transit semant base singl step program execut semant declar program program counter move begin program intermedi state configur pair consist program state part origin program left situat introduc predic tran final axiom procedur extend version ffl ffi program ffi situat step return result situat program ffi remain execut ffi denot transit relat configur ffl configur consid comput complet program remain ffi requir repetit ffi execut ffi complet program immedi tran predic tran empti ffi primit ffi ffi nil test ffi ffi nil ffi ffi ffi ffi nondeterminist ffi ffi ffi ffi ffi ffi ffi ffi ffi assert configur evolv singl configur intuit read write oe denot term repres situat calculu formula suppress situat argument denot formula restor argument assum standard encod situat calculu formula evolv configur evolv provid execut notic perform remain perform evolv provid result restor suppress situat argument fluent mention oe proce notic case situat remain unchang ffi evolv ffi provid evolv evolv provid final configur evolv evolv provid evolv provid exist evolv ffi program result substitut uniformli ffi evolv ffi provid evolv observ evolv final definit final predic final empti true primit test ffi nondeterminist ffi true configur reach program ffi start situat obtain repeatedli transit relat denot tran start reflex transit closur transit relat denot defin situat calculu ffi ffi stand conjunct closur ffi ffi ffi final give definit relat ffi hold repeatedli program obtain program ffi situat ffi legal termin golog interpret describ approach execut distinguish carefulli golog interpret relat mean termin situat result execut program fl begin situat relat natur prolog implement term interpret brave interpret differ interpret golog program select action commit physic repeat rest program sf select action prog commit action interpret base ran origin give account program action make simplifi interpret deal suitabl coupl execut monitor interpret differ prolog cut prevent backtrack tran select altern action prog effect commit action select tran commit qualifi understood interpret refer brave reach eventu program interpret termin situat cautiou interpret avoid possibl defin cautiou interpret sf select action prog make rest prog termin commit action cautiou brave commit action action lead success termin program provid program termin cautiou interpret reach cautiou interpret appeal execut robot program process commit program remaind program requir preclud cautiou interpret robot program appeal action action perform brave interpret suitabl program action price pai greater risk path cautiou interpret implement prolog interpret lift directli introduc interpret requir program precondit successor state axiom initi state express prolog implement inherit prolog close world assumpt limit theori full version cautiou interpret includ appendix execut monitor golog program discuss interpret golog program combin monitor imagin execut primit action evalu program test robot compar mental world model realiti assum discrep robot mental world realiti result exogen mind golog program nondeterminist imagin cautiou interpret verifi program termin outcom action programm prove robot observ action execut monitor observ exogen action chang valu fluent recov unanticip event cycl recov repeat program termin assum applic domain programm specif primit action axiomat initi section golog program account exogen action occur robot execut program assum program account programm goal write assum programm order sentenc describ program programm call program postcondit assum postcondit program ffi origin goal program deal paper ffi useless thing ffi satisfi approach execut monitor chang modifi program situat satisfi origin postcondit golog program section semant golog program execut monitor definit parallel section system interpret execut formal predic symbol ffi describ transit consist singl ran step program singl call execut monitor role execut monitor sensori input form exogen action gener program perceiv discrep result system pass configur configur ffi ffi ffi configur reach program ffi situat execut monitor obtain repeatedli reflex transit closur relat face ideal practic argu convincingli agent observ action occurr effect longer tabl reconcil point view pose observ action occurr abduct observ exogen action occurr account observ implicit stanc paper robot exogen action occurr gloss obviou technic problem realiz abduct point view implement golog interpret describ brave cautiou version golog interpret execut monitor brave execut monitor sf select action prog commit action cautiou execut monitor sf select action prog make rest prog termin commit action monitor elabor definit class ffi ffi ffi ffi monitor check exist exogen determin situat reach monitor program ffi termin monitor return invok recoveri mechan determin program ffi monitor appeal recov prefer monitor program long termin situat program goal hold notic exogen simpli primit action class monitor pursu question recoveri procedur monitor previou section appeal relat ffi true ffi program exogen current situat occurr ffi program execut place begin situat specif form basi implement ffi ffi ffi oe recoveri mechan conceptu determin shortest program prefix program yield program termin easi simplest simpli gener length test yield termin length complex bound notic appeal assumpt section monitor program goal condit recoveri mechan program ad prefix result program behav wai unintend programm long goal condit origin termin execut alter program satisfi programm intent implement theori execut monitor support demonstr block world program cautiou monitor section straightforward implement monitor ffi numer argument addit argument mention equal minim length equal maxim length complex bound current implement includ gener recoveri procedur appendix prolog code implement monitor block world axiomat successor state action precondit axiom successor state axiom imagin sophist realiz simpl idea make action perform pursu topic action precondit axiom initi block tabl clear block letter block letter spell block letter irrelev build tower spell program goal obviou ari note goal execut monitor recov exogen action move complet irrelev program implement suitabl prolog provid appendix execut trace origin procedur tower simpl design deal kind extern disturb trace execut monitor produc fairli sophist behavior deal exogen unforeseen program note test chang primit action result situat time program perform primit action evalu exogen program occur sequenc action current situat perform extern agent current user simul activ extern agent annot trace step block world build program current cautiou interpret execut offlin fail block brave interpret eventu enter exogen occur recoveri step program exogen program cover block uncov block kind current program state construct continu program current enter exogen occur current start recov exogen block letter cover recoveri procedur determin minim action order program prefix previou program state evalu continu step futur work elabor version paper discuss relationship work approach ai execut monitor rogu remark differ formal neat fact stori monitor arbitrari simpli straight line partial order plan plan ongo futur work includ draw closer parallel concept control system discret event control theori prove sound complet recoveri procedur extend idea tempor monitor robot control program written tempor golog implement idea cognit robot group autonom robot toronto refer steel integr execut monitor nation confer artifici intellig page morgan kaufmann san pe nj nilsson learn execut gener robot plan artifici de hj levesqu reason concurr priorit exogen action situat calculu fifteenth intern joint confer artifici intellig de giacomo hj levesqu congolog increment interpret technic comput scienc prepar veloso plan robot execut asynchron user request proc int conf intellig robot system hj lin scherl logic program languag dynam domain logic special issu volum lin reiter state constraint revisit logic special issu action volum philosoph problem standpoint artifici intellig machin edinburgh pj wm supervisori control class discret event process siam journal control pj wm modular feedback logic discret event system siam journal control reiter frame problem situat simpl solut complet result goal regress vladimir artifici intellig mathemat theori paper honor john page academ san reiter prove properti state situat calculu artifici reiter tempor golog technic depart comput scherl hj levesqu frame problem knowledg produc action proc page appendix golog interpret golog interpret conjunct disjunct implic action nondeterminist action transit closur sr situat result prog lead goal replac hold predic implement transform test condit negat failur treat hold predic includ prolog system predic work golog programm give result restor situat argument appendix monitor recoveri procedur execut monitor call recoveri procedur extern disturb arbitrari golog situat result termin exogen disturb simul execut exogen exogen program redon determin remind program termin goal situat recoveri step program recov program current nl exogen program exogen termin golog program simul happen print error program recov prefix program plan find longer sequenc action complex bound recoveri procedur fail elabor good action perform plan undo result action plan futil appendix golog program program build tower block sort final posit block arbitrari primit action declar action precondit axiom successor state axiom initi tabl clear block letter build
IR/905 5 inform content block web document lin institut inform scienc academia academia road sec taipei taiwan abstract approach discov inform content set tabular document web web site partit page content block html tag web page base occurr featur set calcul entropi featur entropi featur content entropi block defin analyz inform method dynam select partit block inform redund inform content block distinguish part redund content block common part base answer set gener manual tag web site total web experi show recal rate greater inform block site automat separ semant redund content navig adopt preprocessor inform retriev extract retriev extract index size extract complex reduc keyword inform content inform inform extract introduct innov web creat numer inform sourc publish html page internet redund page mirror site ident page url inform redund web site present servic navig copyright privaci page busi easi access focu problem redund internet page redund method automat permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee sigkdd juli canada copyright acm ho institut inform scienc academia academia road sec taipei taiwan discov redund extract inform content page depict cnet tech present page begin tech categori search latest relat featur content part content expect ident page call ident block redund content block block distinguish semant user call inform content block appli present style busi conveni user easili navig relat servic simpl click page big challeng search engin web miner system clever human process content page search engin index text web inform tech page inform useless retriev extract problem experienc previou work carri search engin web site taiwan site publish page articl redund appli approach search engin deal problem redund provid search result read artifici tag page content avoid index retriev redund content approach tediou work scalabl method process page internet problem redund affect factor wide evalu search search size index present search result influenc problem search engin automat captur sentenc descript page redund compani navig panel locat top page descript page extract search engin ident web site templat layout site base statist search engin page page februari search engin inktomi reveal rate page tabular page tag averag page tabular page tag page page tabular structur search engin page ten tabl easi conveni modular html page visual content block easi appli identifi content unit content justifi redund inform paper studi inform extract web discov metadata set web document perform specif site base guidanc human knowledg applic scalabl par search engin deal semant scalabl problem respect search engin inform extract system focu effici automat discov inform content block extract metadata page system effect appli search engin inform extract inform block page reduc complex mine section describ relat studi illustr content block method evalu inform measur content block base inform greedi approach dynam divid content block inform redund data answer perform experi evalu effect method experi method perfect discov inform content block tabular page conclud contribut relat work studi deal problem redund search engin index redund content retriev result problem affect web miner extract pattern document inform content illustr studi field rest inform retriev system denot search engin inform extract system denot web text miner ir system implement automat analyz web document serv inform ir system search divid automat preprocess search crawl web crawler grab page relat page hyperlink page content page base html markup languag xml index engin process store content index file make search requir effici match index document retriev relev result difficult rank order relev result due fast growth web document analyz hyperlink structur hit pagerank cope problem pagerank successfulli googl search engin appendix rank result inher page user search engin index page content semant content hit algorithm give web due semant redund hyperlink page redund compani navig rel privaci index retriev ir system scalabl requir automat process find content index improv retriev system goal transform collect ir inform readili digest analyz par ir system retriev relev system aim extract structur document basic type unstructur text document call text typic integr nlp work extract inform unstructur text popular text mine studi shift structur research call web mine wrapper system extract structur inform web html document base manual gener templat exampl cardi defin pipelin process token sentenc templat gener base cascad similar cardi machin learn appli gener rule process knowledg concept dictionari templat gener rule manual gener train instanc appli learn process artifici select label text miner learn wrapper rule label train tupl wrapper induct author manual defin wrapper consist knowledg extract data recogn delimit match class richer wrapper probabl work site gui user open web defin attribut label tupl web page common disadvantag system cost nlp annot corpora gener hand system appli specif web extract structur inform page specif web site page gener cgi system scalabl appli resolv semant deficit search engin approach discov inform content page cope problem redund ir system system effici extract structur inform content page system extract inform content web document type improv effici ir system page page written html major xml year document object model defin tree structur html xml tag intern node text hyperlink tree leaf node count refer web page html tag reduc concentr html document tag tabular document defin paper base html tag page partit content block partit block form tree denot page base order correspond order tree nest content block correspond node lower level tree partit page block content block includ base specif partit smaller block tabular content tag special site assign titl default gener author tool method estim entropi content determin inform redund discov inform content web site emploi templat present web page true page gener cgi program page cluster set page present templat page web site web site regard page cluster rest assum web site page cluster lose gener process discov inform content block start ir system complet grab page web site crawl sequenc breadth search depth search restrict site data set includ page site figur show modul modul inform redund content block page html document site classifi cb cb extract gener special content block calcul cb entropi tree content block matrix partit train set cluster base url pattern featur extract calcul featur entropi figur process extract content block page base web page repres tree leaf node content anchor text process extract content block categor phase initi tree structur obtain html page base intern node content block consist content string html leaf node due nest child block parent block content string child block exclud parent block shown figur rectangl denot tabl child tabl content string content content string parent block string process scan html file time complex file length process crawler grab page index extract process extra burden ir system phase refin granular tree classif content block ambigu omit detail due limit paper length extract content block content string figur extract content block text string extract featur content block page content featur block simultan extract featur correspond keyword stop word includ appli porter stem algorithm remov stop word english keyword extract extract keyword featur written orient languag difficult lack trivial separ languag studi appli statist approach extract keyword orient languag develop algorithm extract keyword sentenc base term base term base gener collect hot queri queri stop search engin complex extract featur length sentenc complex averag page length accumul complex number document cluster calcul entropi valu featur entropi featur estim weight distribut featur page cluster easi calcul featur content block page group repres list term frequenc weight variat page list page form matrix matrix gener extract featur document cluster time complex averag number featur cost sort featur effici group regard number featur page proport page length time complex base time complex calcul entropi valu featur linear total number featur accumul complex stage result matrix reusabl index process ir system base measur entropi featur correspond calcul probabl distribut row search servic project sponsor serv web user matrix famou gener formula defin content block uncertainti inform featur page distinguish ph log ii log probabl featur page seldom page normal weight featur featur threshold easi determin vari entropi cluster site higher threshold higher recal rate expect rate fh ij ij ij weight document df lower balanc appli normal entropi rang base greedi approach dynam determin threshold logarithm number equat train set cluster threshold modifi inform featur inform content includ basic idea greedi fh ij log ij number document approach figur page content start interv block page featur threshold includ featur page figur layout wide block includ threshold web site logo compani includ boundari inform banner navig panel redund block reach inform content copyright polici easi explain greedi approach base bottom lose real experi section time complex page figur featur entropi calcul depend interv threshold interv start step conclud total time log fh fh fh fh fh complex fh fh fh fh fh document site similar structur figur measur entropi featur estim entropi content block featur entropi contribut semant measur content block featur entropi content block summat featur shown equat cb fh ji featur featur content block number equat normal fh cb entropi content averag featur entropi block feasibl assum averag number content block page constant time complex calcul entropi content block accumul complex stage classifi content block base content block divid redund inform higher defin threshold close content block absolut redund featur page experi evalu previou manual label set tag identifi inform content block page publish web site taiwan data answer set inform automat discov inform block page site compar result answer set appli measur wide evalu perform ir recal experi verifi qualiti method featur extract inform content block desir measur recal shown figur ideal case recal rate equal recal rate common featur desir featur rate common featur discov featur desir featur common featur discov featur figur recal rate evalu site present page tag articl categori publish present categori site shown tabl site page train set appli run page train set site thousand page ten train page randomli select cluster experi find optim threshold recal measur project sponsor search servic taiwan web site run interv par recal rate site interv shown figur threshold recal rate base answer set recal rate number featur includ select block due optim threshold found number featur figur optim threshold respect recal rate converg point result show high recal rate optim threshold site distribut cnet converg recal optim threshold vari site recal perfect trace train page found data wrong titl inform categori greedi approach dynam find optim threshold web site tabl site tabular page site categori page network invest life taiwan cnet invest supplement miscellan daili taiwan headlin stock societi ct intern citi close februari recal rate number featur includ rate threshold content block entropi cnet ct figur recal rate page cluster threshold content block entropi cnet ct figur rate page cluster rate shown figur par recal rate shown figur threshold highest rate page cluster correspond optim threshold result summar tabl show site perfect optim threshold highest answer set check articl find page includ extra content block consist relat page relat current articl block consist text length block longer articl page content train low inform content block kind block includ includ noisi featur affect threshold case content judgment inform redund ambigu depend perspect user tabl recal optim threshold site optim recal cnet ct experi prove greedi approach achiev high recal recal low recal reason wrong data low due content block approach achiev perfect recal discov inform content tabular web page investig effect number randomli select train redo experi page cluster wrong data page semant ambigu content block relat site includ experi number train exampl start interv result shown figur dot line denot recal rate solid line repres cluster perfect recal rate approach line overlap highest rate cluster number randomli select exampl reveal number exampl influenc rate rate degrad number random number effect recal rate dot line recal rate larger content cluster exampl higher select filter inform content block train exampl impli higher recal rate affect higher threshold mean featur includ recal rate number train exampl figur base number train exampl previou conclud method feasibl discov inform content web page site greedi approach adapt find optim threshold block entropi web site templat base optim threshold inform content block dynam select site result show recal rate larger close result experi result prove contribut search engin automat extract inform web page appli gener web ir system reduc size index retriev complex discov process polynomi intermedi page keyword gener share crawler index web ir system appli web system effici system simpli smaller inform content block page content preprocessor web ir system method appli tabular web page base assumpt page cluster experi evalu page publish web site develop method automat discov page cluster web site make method applic gener web page restrict tabular appli gener special process merg split content block base html document object model evalu english web page import polish method refer israel inform extract improv document sixth text retriev confer pp practic inform addison anatomi hypertextu web search seventh intern world wide web googl search method inform ai document object model hyperlink enhanc topic distil inform tenth intern world wide web confer gener grammar workshop machin learn inform keyword extract inform acm sigir intern confer inform commun retriev data structur prentic learn inform phd dissert comput scienc carnegi mellon transduc data extract inform sourc hyperlink journal mine sigkdd induct inform phd depart comput scienc porter stem text retriev inform addison mathemat theori bell system technic vol pp juli techniqu acm transact offic inform object model markup markup structur associ semistructur ieee transact knowledg data
AI/906 2 institut comput scienc academi scienc czech republ comput theori neural network technic report decemb institut comput academi scienc czech republ pod pragu czech republ institut comput scienc academi scienc czech republ comput theori neural network technic report decemb abstract present paper detail taxonomi neural network model restrict present respect comput properti criteria classi cation includ feedforward recurr discret continu binari analog symmetr asymmetr nite size nite famili determinist probabilist underli result comput power spike neural network brie survei complet relev refer keyword neural rbf spike comput power research support grant ga cr ga cr person grant introduct neural network repres wide appli comput paradigm altern convent comput area arti cial intellig analog classic model comput ture machin understand comput potenti limit convent capabl neural network realiz gener comput studi decad relev result achiev comput descript power neural net investig compar architectur tradit comput model descript tool includ nite regular ture boolean aim approach comput neural optim implement requir function neural network classi ed comput taxonomi enrich tradit repertoir comput mean bring ecienc neural network inspir neurophysiolog knowledg respect theoret result broaden understand comput principl mental process recal gener model neural network consist simpl comput unit index sg jv call network size unit serv extern input output assum network input output remain call hidden neuron unit connect orient graph call architectur edg lead neuron label real weight ji architectur correspond weight respect neuron comput dynam neural network determin neuron evolut real state time establish network state time begin neural network initi state includ extern input network state updat neuron collect input output incid neuron underli weight connect transform current state output network read end comput digit comput extern binari input provid binari output assum valu encod analog state intermedi stage comput oper real number neural network classi ed restrict paramet comput dynam model obtain di erent comput capabl present paper detail taxonomi neural network model present comput point view respect theoret result comput power neural network brie survei complet relev refer main focu classic perceptron network section comput properti understood dynam consid singl perceptron model perceptron network basic divid architectur feedforward recurr network nite possibl nite architectur criterion appli classi cation probabilist version paragraph comput taxonomi perceptron network ned binari paragraph analog network paragraph di erent domain state valu nite network paragraph nite famili paragraph distinguish respect input protocol onlin comput properti symmetr recurr network undirect architectur di er asymmetr section neural network model comput capabl recent studi survei includ rbf network emploi comput unit altern perceptron comput taxonomi extend network biolog plausibl spike neuron make tempor code state valu determinist noisi spike network review perceptron network perceptron threshold network repres popular neural network model comput dynam inspect discret continu time dynam perceptron work discret updat state time instant excit ji assign neuron time respect weight sum input includ bia view weight formal constant unit input instant neuron subset comput output appli activ function remain unit chang network state time determin perceptron network binari state emploi hard limit threshold activ function bipolar valu gener discret substitut binari substanti chang size weight approxim continu sigmoid activ function standard sigmoid state analog neuron gener real comput boolean function analog state output neuron interpret binari output separ xed real threshold singl perceptron singl perceptron extern binari input comput boolean function long time boolean function implement singl pariti function repres promin boolean function comput perceptron call linearli separ linear threshold function creat proper subclass boolean function includ basic logic function close negat input variabl output number linearli separ boolean function variabl estim lower upper bound small fraction boolean function issu decid boolean function disjunct conjunct normal form linearli problem descript complex linear threshold function studi shown linearli separ boolean function implement integ weight number bit sucient repres singl integ weight paramet perceptron log feedforward network architectur feedforward neural network acycl graph unit feedforward network group sequenc disjoint layer neuron layer connect neuron subsequ layer rst input layer consist extern input count number layer network depth output layer output neuron intermedi hidden layer includ hidden neuron number layer exclud input call network depth comput proce input layer hidden layer output layer begin state input unit set extern input gener output neuron determin layer state neuron layer comput end state output neuron repres result comput network function evalu parallel time equal depth model feedforward neural network coincid circuit neuron call comput properti intens studi boolean circuit complex singl circuit comput vector boolean function xed number variabl comput input arbitrari nite famili fc input length consid framework complex measur size depth express term input length input protocol assum input boolean variabl present negat case threshold circuit modi ed size posit weight depth size weight preserv feedforward network paragraph comput capabl feedforward neural network emploi threshold activ function inspect simplest case singl perceptron consid paragraph clear threshold gate connect circuit implement gener boolean function size threshold circuit optim determin log prove sucient implement vector boolean function depth function requir number gate unbound depth respect lower upper bound earlier estim network coincid lower bound number connect threshold circuit comput gener boolean function squar deriv result impli nite li threshold circuit exponenti gate capabl comput map constant parallel time boolean complex theori addit restrict circuit threshold circuit integ weight paramet bound polynomi constant term input length translat bit polynomi weight reduc comput power threshold circuit paragraph exponenti weight gener requir perceptron unbound weight threshold circuit replac polynomi depth layer polynomi overhead network size explicit construct underli circuit polynomi independ depth found polynomi weight assum perceptron network parallel comput step grant restrict concern maximum gate maximum number input singl unit circuit bound repres model convent circuit technolog number input wire gate restrict unbound typic properti interconnect neural network gain ecienc classic circuit size depth maximum implement threshold circuit unbound gate depth log log yield log factor feedforward neural network unbound exponenti size network practic realiz larger input length speci function requir superlinear number gate circuit unbound depth function comput threshold circuit polynomi size constant depth implement reason restrict correspond neurophysiolog knowledg suggest layer human brain structur context complex class tc denot lt introduc denot function comput threshold circuit depth de ne complex class tc tc underli constant comput tc tc tc tc hierarchi tc function comput singl perceptron polynomi weight proper subclass tc tc tc paragraph function comput singl perceptron result deeper separ tc tc great import neurocomput wit function belong tc tc boolean product ip de ned ip stand xor function determin number input odd mean perceptron network power ration tc hierarchi depth unknown repres import open problem complex theori problem comput threshold circuit linear number gate conceiv tc hierarchi depth tc tc import case symmetr boolean function valu independ order input function depend number input typic symmetr function pariti function shown symmetr function variabl implement threshold circuit size depth size gener reduc log depth unbound weight lower bound depth match lower bound achiev illustr fact threshold circuit power circuit emploi basic logic gate prove pariti function comput circuit complex class ac led conjectur weaker tc hierarchi ac tc partial result line ac function comput threshold circuit depth size log constant found comput power threshold circuit small constant depth illustr capabl comput basic arithmet function perceptron network polynomi size weight construct compar binari number comput sum multipl sum number product binari power sort number achiev feedforward network depth circuit power issu reduc polynomi size weight requir product proof sort found multipl product binari number perform depth analyt function implement larg perceptron network polynomi size weight small constant number layer result di erent complex measur includ connect threshold circuit achiev smaller feedforward network case arithmet circuit optim depth layer multipli implement threshold gate depth gener result shown pariti function comput log log threshold circuit size edg bound lower bound size threshold circuit comput pariti function log symmetr function comput log log threshold circuit edg complex nf log log log bound xed integ complex call total wire length introduc feedforward network plai import role vlsi circuit implement context ecient sensori process number parallel input model assum gate di erent intersect point grid unit distanc adjac intersect unit arbitrarili connect wire plane cross minim sum wire length de ne total wire length circuit gate consid unit evalu time occupi set intersect point grid connect undirect wire arbitrari fashion architectur feedforward network ecient term total wire length substanti di er commonli design circuit complet connect layer requir total wire length boolean function lr de ned lr iff exist repres simpl global pattern detect comput network log threshold gate total wire length log feedforward network comput capabl feedforward neural network compar analog unit emploi standard sigmoid activ function result valid gener class activ common comput model practic learn boolean threshold circuit implement analog feedforward network architectur size weight approxim function real state valu bring ecienc small analog network constant size boolean function de ned iff stand xor comput network ve analog unit constant separ polynomi weight implement threshold circuit constant number gate unbound weight con rm analog feedforward network slightli power comput devic binari counterpart similar result shown call unari squar function sq give sq iff comput analog unit polynomi separ boolean threshold circuit comput sq requir size gate unbound depth weight size feedforward network reduc logarithm factor binari unit replac analog complex class tc gener analog version tc function comput polynomi feedforward neural network layer separ emploi activ function turn class tc tc substanti di erenc comput power feedforward network depth polynomi size comput valid polynomi size unbound depth exponenti weight provid depth binari threshold circuit constant factor function comput arbitrari small separ analog feedforward network constant depth polynomi arbitrari real weight emploi activ function shown belong tc lower bound variabl pariti function gener analog feedforward network polynomi layer separ constant size dn neuron xed optim unit sucient recurr neural network architectur recurr neural network cyclic comput devic termin nite step special attent paid symmetr hop eld network weight satisfi respect architectur undirect graph comput mode recurr network depend choic set updat unit rule recurr network sequenti mode time instant unit updat state order formal avoid long constant intermedi comput unit updat chang call product comput length discret updat introduc exist unit updat time product comput recurr network converg reach stabl state time analog ky hold small constant systemat choic fjg discret macroscop time introduc unit network updat gener case updat output parallel exist time instant neuron output simultan fulli parallel mode consid unit updat time asynchron comput respect choic random singl unit network fact decid independ time instant state updat synchron comput set determin determinist time instant choic central driven seemingli power asynchron model shown binari state comput power synchron systemat counterpart cost small overhead size time asynchron network sequenti parallel mode symmetr network synchron model assum comput input arbitrari di erent input protocol introduc recurr network nite number unit nite famili cyclic input consid finit recurr network comput power recurr network studi analog tradit model comput network exploit acceptor languag binari alphabet call neural acceptor work fulli parallel input string arbitrari length sequenti present network bit bit input neuron inp state extern set respect input bit prescrib time instant uenc remain unit network output neuron subsequ signal input string belong underli languag neural acceptor input bit present period discret inp output neuron recogn pre input string onlin possibl time delai iff shown binari network constant time delai reduc linear network size network addit valid input unit emploi end input output neuron time depend input length result recognit announc valid output unit oval oval iff oval analog network altern input protocol input string arbitrari length encod real initi state input inp asymmetr recurr network comput power nite recurr neural network gener asymmetr weight emploi activ function depend descript complex weight integ weight model coincid nite binari recurr network threshold gate activ function comput power binari neural acceptor nite number network state correspond nite automata shortli call recogn class regular languag ner descript measur studi neural implement nite automata ecient shown size construct constant period present input simul determinist nite automaton state worst size reduc period polynomi weight assum size compar length regular express descript ecienc exce determinist nite automata unit construct recogn regular languag regular express length shown describ regular languag requir regular express exponenti linear network size con rm power descript capabl nite analog recurr network ration weight emploi activ function simul arbitrari ture machin step step implement ture function comput ture machin time comput xed analog recurr network unit time size network reduc neuron cost simul time comput network correspond complex class ture shown gener class activ function includ standard sigmoid respect simul requir overhead comput step nite analog recurr network arbitrari real weight activ function comput capabl comput power analog neural acceptor work time nite famili threshold circuit size polynomi relat mean comput network correspond nonuniform complex class de exponenti time map comput proper hierarchi nonuniform complex class prove comput analog recurr network kolmogorov complex real weight set logarithm bound kolmogorov complex real languag recogn correspond complex class de result analog comput nite recurr network assum real number calcul amount analog reduc comput power analog recurr network upper bound size remain valid gener class activ function common distribut nonzero larg set network unabl recogn regular languag recogn de nite languag comput power complex relat problem studi nite recurr network issu exist stabl state binari network prove halt problem issu recurr network termin comput input shown binari network algorithm undecid analog network ration weight unit comput note comput recurr network size termin time circuit size st depth standard techniqu impli comput feedforward converg recurr network symmetr recurr network fundament properti symmetr network dynam constrain energi function bound function de ned state space product comput exist function network state converg stabl state local minimum binari symmetr sequenti comput start initi state termin provid call prove energi function ji parallel comput binari hop eld net shown reach stabl state quadrat form neg de nite eventu altern di erent state converg result gener analog symmetr network prove mild converg xed point limit cycl length parallel updat appli function ji converg time hop eld number updat network converg analog studi symmetr network binari neuron trivial upper bound hold di erent network state worst converg time hop eld net exponenti sequenti parallel mode wit sequenti parallel implement binari counter network space converg time asynchron sequenti updat fulli parallel step averag fast converg log binari hop eld net shown reason assumpt previou bound account size weight upper bound converg time binari sequenti parallel hop eld net jw ji call weight network characterist energi function integ weight real weight upper bound express jw ji jw min jj sequenti jw ji jw parallel updat ji yield polynomialtim converg binari symmetr network polynomi weight result translat converg time bound respect full descript complex hop eld number bit binari symmetr network lower upper bound shown compar result analog hop eld net real weight paramet plai import role lower bound updat arbitrari continu function analog hop eld net comput termin binari symmetr network size hop eld network origin associ memori issu determin number stabl state pattern store hop eld import shown averag asymptot stabl state binari hop eld net size feedback jj weight independ ident gaussian random variabl binari symmetr issu decid neg feedback weight stabl problem determin exact number stabl state binari hop eld net de nition issu nding stabl state binari symmetr network shown complet complex class local search problem de nition problem attract radiu stabl binari output ip stabl network state respect sequenti fulli parallel hop eld net converg shown algorithm approxim attract radii sequenti fulli parallel binari hop eld net factor xed np hop eld network altern appli fast approxim solut combinatori optim problem cost function optim problem encod energi hop eld network minim comput issu nding network state minim energi energi prescrib hop eld net special interest call min energi problem gener npcomplet binari analog hop eld net binari hop eld net architectur planar lattic planar graph issu solvabl approxim algorithm solv min energi problem absolut error binari hop eld net weight introduc base highperform approxim algorithm max cut problem symmetr network binari neuron constant result match lower bound approxim min energi algorithm np min energi approxim absolut error log polynomi time special binari hop eld net architectur grid result comput power hop eld net survei similarli asymmetr recurr network paragraph binari network comput converg asymmetr network hop eld net shown linear overhead time size simul symmetr network improv origin construct tight hop eld converg theorem show binari symmetr network converg comput implement ecient hop eld net threshold circuit implement symmetr interconnect architectur symmetr binari neural acceptor input sequenc properli weaker nite automata recogn strict subclass regular call hop eld languag prove regular languag hop eld languag iff pre sux string exist analog symmetr neural acceptor faithfulli recogn eld languag lower bound comput power nite analog hop eld net converg properti nite analog hop eld net simul arbitrari ture machin fulli parallel analog symmetr network augment extern oscil produc nite binari sequenc nite substr form bx devic exploit simul analog asymmetr recurr network kolmogorov complex real weight impli result comput power analog asymmetr network valid analog hop eld net extern oscil ration weight devic ture nite famili binari recurr network altern input nite famili fn binari recurr input length exploit comput analog circuit complex binari input network input neuron initi initi network state recogn languag respect network emploi input string converg time singl output neuron read belong iff context size de ned number unit famili binari recurr network recogn languag complex class de converg asymmetr symmetr network result famili hop eld recogn hop eld net famili restrict polynomi weight respect input comput power reduc probabilist network comput properti stochast version perceptron network studi refer model probabilist network de ned respect determinist model augment addit random binari input unit state time establish independ ident distribut binari discret time instant probabl real probabl model probabilist network shown polynomi relat neural network stochast behavior includ comput state connect unit boltzmann machin probabilist network exploit languag recognit similar determinist counterpart order analyz comput power languag probabl probabl network output input previou symmetri probabl error accept reject input achiev gener ad random input unit probabilist feedforward network simplic rst probabilist feedforward network threshold languag recognit famili probabilist threshold circuit high probabl error error reduc arbitrarili repeat comput parallel languag probabilist feedforward network size unit layer stochast threshold circuit log gate probabilist binari feedforward network replac reason larg determinist threshold circuit prove languag probabilist feedforward network size input layer exist threshold circuit size ln recogn complex class tc famili threshold circuit gener probabilist version class languag famili probabilist threshold circuit depth error real sequenc probabl input length languag ip consist input instanc boolean product shown belong con probabilist feedforward network ecient determinist counterpart ip tc layer save introduc stochast threshold circuit hold tc nonuniform circuit probabilist recurr network comput analysi gener nite probabilist recurr network activ function integ result coincid determinist network paragraph probabilist network regular languag probabilist network ration weight polynomi time languag nonuniform complex class correspond polynomialtim probabilist ture machin pre logarithm advic function de weak comput capabl probabl random input unit arbitrari real number restrict probabl ration comput power polynomialtim probabilist network ration weight reduc complex class arbitrari real weight comput power probabilist recurr network work time polynomi relat determinist network simul time nt impli comput correspond complex class dynam neural network dynam analog network state de ned real solut system di erenti equat unit boundari condit initi network state dy dt ji excit unit de ned activ function emploi impli function shown symmetr network ji ij converg initi state stabl state satisfi dy exponenti lower bound converg time hop eld net obtain term system dimens set stabl state discret system coincid system asymmetr network control dynam construct simul nite recurr network faithfulli overhead simul achiev hop eld net impli nite famili network recogn complex class paragraph neural network model comput capabl neural network model altern perceptron network recent analyz spike network review rbf network unit rbf network repres import altern classic perceptron network comput radial basi function rst introduc context interpol problem perceptron updat rule unit modi ed respect proport distanc input vector ji jin consist state incom unit incid call center ji jin real posit paramet determin call width state rbf unit time instant determin similarli activ function gaussian function shape di er sigmoid function repres binari valu di erent analog state rbf unit reserv protocol boolean gate multipl liter variabl implement rbf unit emploi maximum norm max jx larg class activ function special type includ gaussian implement robust analog binari valu speci disjoint small interv respect real state result section comput power perceptron network reformul rbf network determinist nite automata state implement recurr network log rbf unit robust ture nite rbf network repres open problem network neural network model comput power recent studi consist call gate neurocomput competit strategi kohonen network competit principl neurophysiolog plausibl ecient analog vlsi implement gate real input binari output comput map de ned ith output iff number input valu greater gate omit input maxim simpl devic implement perceptron network threshold gate suce comput impli recurr perceptron network threshold gate comput sublinear time boolean function tc comput network polynomi size comput singl gate appli constant weight sum input variabl natur weight polynomi size network gain ecienc total wire length function lr introduc paragraph comput network consist unit weight threshold total wire length reduc gate ecient perceptron network spike neuron promin posit neural network model altern classic perceptron paradigm occupi network spike neuron cial neural spike network spike neuron biolog plausibl unit previou neuron model comput properti rst survei determinist noisi version inspect determinist spike network main di erenc spike network tradit neural network model consist encod comput state tempor di erenc ring time neuron sequenc ring time spike neuron denot fy set spike neuron continu time instant maxi denot ring time formal de ne spike input neuron inp extern encod input binari input string present separ input onlin singl input unit inp inp bit repres ring ring time interv ring design input encod tempor di erenc inp inp sucient larg integ constant spike inp inp input neuron inp connect function ji denot set nonneg real introduc model gener neuron spike unit continu time due notat function formal de ned constant miss ji ji weight ji connect assum posit unit inp bia function determin nonneg threshold potenti time neuron gener spike note function opposit bia call threshold function hard limit spike neuron inp determin inf excit ji ji de ned continu time exclud bia term call potenti spike output neuron encod result output protocol input subsequ result comput power spike network valid gener class bia function satisfi weak condit function ji connect posit ji neg ji model biolog excitatori inhibitori ji ji min ji max individu synapt delai connect function ji stereotyp exist gener function end end ji ji ji ji global maximum exist short linearli neg end end end exampl function includ mathemat simpl linear function ji ji jt ji ji ji ji strict function requir simpl constant function ji ji ji end end exampl function includ ji de ned counterpart ji gener assumpt sati ed biolog plausibl function gener bia function emploi inp assum ref order prevent neuron ring period ref previou neg constant equal initi time end exampl bia function includ mathemat simpl constant function ref ref lower bound comput power spike network rst review feedforward network threshold gate unbound weight depth neural network spike neuron spike network polynomi size bound weight construct simul comput time interv length determinist nite automaton moor state simul spike network constant period present input bit neuron log unit bound weight build neural network nite number spike neuron ration weight paramet introduc assumpt threshold function ration simul ture machin linear time comput step requir xed constant number spike map comput nite spike network arbitrari real weight comput power spike network complet introduc upper bound prove comput power nite spike network linear necessarili satisfi equal nite analog recurr perceptron network linear activ function activ function network call random access machin regist work arbitrari real number bound absolut valu exact de previou achiev simul valid restrict numer paramet model ration number spike network linear function easili program perform ecient basic oper analog variabl tempor code addit multipl constant restrict constant function easier implement hardwar spike network monoton continu threshold function emploi arbitrari paramet carri addit multipl constant arbitrari small di erenc ring time neuron bound number spike spike network constant function linear threshold function ration paramet onlin input determinist nite automata xed number spike simul step arbitrari real paramet restrict spike network onlin input simul ture machin polynomi number spike comput power spike network depend shape potenti reduc essenti constant function result digit comput spike network base forc synchron mechan spike small tempor di erenc ring time exploit encod addit analog inform spike neuron di erent synapt delai ji emploi constant power perceptron boolean function cd formal simpl task cd iff easili implement singl spike neuron input suitabl delai feedforward perceptron network comput cd requir threshold gate unit polynomi exponenti activ result gener analog input arbitrari reason function wit element distinct function ed de ned ed ed jx arbitrarili comput singl spike neuron feedforward network comput ed requir log threshold gate hidden unit sigmoid activ function noisi spike network spike network model inform process biolog neuron natur introduc notion determinist model paragraph assum ring time realist point view noisi spike network excit spike neuron govern probabl unit function lower bound determin upper bound probabl neuron time interv length spike assum argument xed lim xed lim xed determin interv function assum initi exist constant function sati es condit exist sourc neg background contribut excit spike neuron addit term deviat arbitrarili long time interv arbitrarili small percentag averag option digit shown previou weak condit boolean function implement sucient larg network noisi spike neuron arbitrarili high probabl correct determinist nite automaton construct network noisi spike neuron simul comput length arbitrarili high probabl correct similar result achiev analog comput noisi spike network tempor encod analog valu reliabl simul feedforward perceptron network real input output bibliographi dh ge tj learn algorithm boltzmann cognit scienc note power threshold annual symposium foundat comput scienc research triangl north carolina comput societi asynchron threshold graph alon explicit construct major circuit comparison siam journal discret mathemat ak tj ecient simul nite automata neural journal acm ma handbook brain theori neural network mit jl structur complex jl ht comput power neural term kolmogorov ieee transact inform theori jl structur logarithm advic complex theoret comput scienc comput complex spin glass journal physic mathemat gener approxim energi intern confer arti cial neural network itali approxim ground state problem spin journal complex jp ground state frustrat model spin glass match method graph journal physic mathemat gener jw gener converg theorem neural ieee transact inform theori dynam applic recurr neural network nite state machin neural comput ak lj constant depth siam journal comput ma cohen absolut stabil global pattern format parallel memori storag competit neural ieee transact cybernet tm geometr statist properti system linear inequ applic pattern ieee transact electron comput tm capac problem linear pattern recognit book dasgupta power comparison activ sj jd cl advanc neural inform process system san dasgupta analog versu discret neural neural comput converg time hop eld ieee transact neural network comput complex analyz eld complex system attract radii hop eld net hard neural comput complex issu discret hop eld research report depart comput transient length sequenti iter threshold discret appli mathemat energi function neural network continu local complex system jb circuit mathemat system theori mr garei ds johnson comput guid theori freeman gh comput complex nding stabl state vector connectionist model eld technic report depart comput mx dp improv approxim algorithm maximum cut sati abil problem nite journal acm major gate gener weight threshold comput complex simul threshold circuit major siam journal comput lm construct parallel comput base boolean theoret comput scienc dynam posit automata theoret comput scienc lyapunov function automata fogelman automata network comput applic energi function tool studi threshold discret appli mathemat exponenti transient class symmetr neural network synchron sequenti complex system neural automata dynam behavior applic academ converg symmetr threshold inform control threshold circuit bound journal comput system scienc connectionist network exponenti time unpublish depart comput lubi steepest descent exponenti time symmetr connectionist complex system hartlei comparison comput power neural network ieee intern confer neural san diego size weight threshold siam journal discret mathemat megiddo geometr separ boolean discret appli mathemat note threshold multipl depth inform process letter proof tc research report dortmund jj hop neural network physic system emerg collect comput nation academi scienc jj hop neuron grade collect comput properti nation academi scienc jj hop eld dw tank comput optim biolog bg horn dr node complex neural neural network bg horn dr bound complex recurr neural network implement nite state neural network optim simul automata neural annual symposium theoret aspect comput scienc ds johnson ch easi local journal comput system scienc ht dynam sigmoid neural inform comput sc event nerv net nite ce shannon automata studi annal mathemat princeton map extend vol springer seri inform dynam discret continu state hop eld neural comput famili recurr theoret comput scienc converg result associ memori neural network ra foundat circuit complex theori sensori advanc neural inform process system nip mit comput power network threshold devic asynchron depart comput complex nding connectionist model stabl state msc depart comput ob implement algebra logic function term bound depth formula basi soviet physic ob circuit threshold soviet physic comput complex network spike ds tk advanc neural inform process system mit comput power noisi spike mc advanc neural inform process system mit lower bound comput power network spike neural comput bound comput power learn complex analog neural siam journal comput fast sigmoid network spike neural comput network spike gener neural network neural network comput power neural comput maass cm neural network mit maass network spike neuron emul arbitrari hop eld net tempor comput neural system maass model fast analog comput base neural comput maass ect analog analog neural comput maass comput inform comput ed comput power sigmoid versu boolean threshold annual symposium foundat comput scienc san puerto rico maass ed analog neural net gaussian common distribut recogn arbitrari regular neural comput approxim algorithm base nite siam journal comput rj ec er ss capac hop eld associ ieee transact inform theori ml minski sa perceptron mit threshold logic applic theori major journal franklin institut ei synthesi network threshold pe hyperplan cut discret mathemat comput complex neural nordic journal comput comput power discret hop eld net hidden neural comput comput asynchron threshold logic theoret comput scienc comput power continu time neural seminar current trend theori practic informat czech republ overview comput power recurr neural finnish ai confer step finland symposium finnish ai primer complex theori neural rb formal techniqu arti cial studi comput scienc arti cial circuit complex neural network mit relat boltzmann machin convent model neural network period behaviour societi symmetr stabil loop connectionist model asymmetr biolog cybernet radial basi function multivari jc mason mg confer algorithm approxim function data scienc probabilist inform control aa small depth threshold scandinavian workshop algorithm finland jh reif sr threshold circuit polynomi siam journal comput probabilist model inform storag organ psycholog review vp theoret advanc neural comput learn academ de ge rj learn intern error de rumelhart de parallel distribut explor microstructur mit je comput work time nite journal acm aa er simpl local search problem hard siam journal comput ht recurr neural network nite journal comput intellig ht neural network analog ture limit ht stochast analog network comput journal ht noisi neural network sa tk advanc neural inform process system mit ht ed analog comput neural theoret comput scienc ht ed comput power neural journal comput system hop eld seminar current trend theori practic informat czech republ analog stabl simul discret neural neural network world hop eld net simul discret neural intern icsc symposium neural comput germani academ comput complex binari analog symmetr hop eld neural comput theori journal acm depth ecient neural network relat ieee transact inform theori siu vp optim depth threshold circuit multipl relat siam journal discret mathemat vp tradeo neural ieee transact comput vp comput optim size threshold ieee intern symposium inform hungari vp ration approxim techniqu analysi neural ieee transact inform theori vp discret neural theoret foundat englewood cli vp massiv parallel design journal parallel distribut comput robust implement nite automata recurr rbf seminar current trend theori practic informat czech republ tanaka sf analyt theori ground state properti spin spin journal physic metal physic sequenti simul parallel iter applic theoret comput scienc von probabilist logic synthesi reliabl organ ce shannon automata studi annal mathemat princeton complex boolean function optim lower bound depth threshold circuit arithmet inform process letter complex issu discret neural network world ya asymptot logarithm number threshold function algebra soviet mathemat
IR/907 5 automat data extract larg web site mecca paolo merialdo università di roma tre università della università di roma tre abstract paper investig techniqu extract data html site automat gener wrapper autom wrapper gener data extract paper develop techniqu compar html page gener wrapper base similar differ result web site confirm feasibl approach introduct amount inform net html format grow fast web largest develop made public html site modern legaci larg bodi data easili access manipul reason web data sourc intend comput applic introduc overcom limit respect extract data web page make comput applic remain complex relev task data extract html perform softwar modul call wrapper earli approach wrap web site base manual techniqu kei problem manual code wrapper write difficult labor intens permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb natur wrapper tend brittl difficult maintain paper develop approach data extract goal fulli autom wrapper gener reli priori knowledg target page content attempt main element origin respect work discuss section overview contribut target research web site larg amount data fairli regular structur gener wrapper set html page correspond infer grammar html code regular grammar grammar page extract piec data grammar infer extens studi problem survei literatur regular grammar infer hard work regular grammar correctli identifi posit exampl presenc posit neg exist effici learn algorithm identifi minimum state determinist finit state automaton consist arbitrari set exampl larg bodi research origin semin work concentr develop effici algorithm work presenc addit inform set label exampl knowledg queri pose fact regular express learn posit exampl high complex learn presenc addit inform limit applic tradit grammar infer techniqu web recent motiv number pragmat approach wrapper gener html page work attack wrapper gener problem data mine conceptu model differ formal wrapper share number common wrapper gener work addit typic set label sampl provid user extern wrapper infer posit exampl gener assum wrapper induct system priori knowledg page schema data work assum target page collect flat case system handl nest attribut extract nest system gener wrapper examin html page time paper investig wrapper gener problem perspect aim autom wrapper gener process larger extent approach depart literatur system reli requir interact user wrapper gener mean wrapper gener data extract complet automat wrapper gener priori knowledg page schema data organ html schema infer system restrict flat handl arbitrarili nest approach wrapper infer html order pattern meaningless system work html page pattern discoveri base studi similar dissimilar mismatch identifi relev structur data extract page site automat data store html page produc script program content give simpl fairli faith abstract semant process result separ execut number queri underli gener sourc set tupl possibl nest type publish site serial sourc dataset html code produc actual possibl introduc url materi banner imag call class page site collect page gener script formul problem studi paper set sampl html page belong find nest type sourc dataset extract sourc dataset page idea clarifi figur refer fiction bookstor site page list book author gener script queri produc nest dataset tupl data list book list script serial result tupl html page run system compar html code infer common structur extract sourc dataset figur show actual output system run html page dataset extract produc html format store figur input html page system infer nest schema page origin field gener encod page schema base pure content figur data extract output html anonym field manual dataset intrigu altern form postprocess wrapper automat discov attribut separ research space simplic reason deal work theoret background theoret root studi trace back previou paper present build theoret concentr develop actual algorithm wrapper gener data extract larg html site main intuit work site gener process encod origin content string html data extract decod process summar theoret ground establish concentr nest built arbitrarili nest list tupl due fact data item html string inher blur distinct order unord collect null valu type instanc schema find data extract problem present formal problem nest type collect instanc encod string storag decod origin instanc encod version solv approach base close correspond nest type regular express special symbol alphabet symbol σ regular express σ string alphabet σ defin empti ɛ element σ regular express semant express defin iter shortcut option shortcut class regular express fit framework straightforward map nest type map string map possibl map refer type list tupl form refer list empti show nest τ reconstruct linear time note nest type catch full structur present html shown abstract describ structur page fairli regular web site obviou altern enrich type system grammar formal introduc union oper discuss strongli complex wrapper infer process base correspond nest type show set html string encod sourc collect instanc ik nest type discov type τ infer minim regular express σ string τ σ wrapper sk reconstruct sourc dataset ik solv schema find data extract process amount find minim languag input html sk lattic iff upper bound input σ oper lub turn amount comput upper bound base schema find data extract process solv iter comput upper bound lattic gener common wrapper input html page crucial problem solv data extract problem consist find algorithm comput upper bound concentr develop algorithm comput upper bound section number experi web site show effect discuss section match techniqu section devot present algorithm match base match techniqu call describ avoid error miss tag assum html code compli restrict variant html tag requir properli close nest loss gener tool turn html page assum sourc lexic analyz transform list token html tag string figur html sampl transform list match algorithm work object list call regular express html page page page start page initi version wrapper progress refin find common regular express page solv mismatch wrapper sampl match algorithm consist sampl wrapper mismatch token sampl compli grammar wrapper mismatch discov essenti inform wrapper mismatch solv mismatch gener wrapper algorithm succe common wrapper gener solv mismatch encount mismatch essenti kind mismatch gener string mismatch happen string occur posit wrapper sampl tag mismatch tag wrapper tag string paragraph discuss mismatch simpl figur end section gener techniqu show appli complex exampl closer real site string discov field page belong string mismatch due valu field mismatch discov field figur show exampl string mismatch step string token solv string simpli gener wrapper mark newli discov initi equal page gener replac string step worth note constant string token origin field wrapper consid addit inform ad gener script part html layout tag discov option tag mismatch discov iter option presenc strategi consist repeat pattern pattern attempt identifi option pattern discuss option base tag mismatch discuss figur tag mismatch occur token due presenc imag sampl wrapper imag consid option solv search iter techniqu search fail assum tag mismatch due presenc option mean wrapper sampl piec html code present skip piec resum main option pattern locat respect run mismatch tag token assum option pattern locat skip proce match imag sampl success tag assum pattern locat proce match token wrapper occurr tag sampl simpl mismatch tag conclud option pattern locat sampl wrapper imag resum wrapper gener option pattern gener wrapper resum wrapper gener introduc pattern form wrapper page book john smith db primer comp sy wrapper solv resum compar token string mismatch tag mismatch string mismatch string mismatch tag mismatch termin tag search squar match tag discov iter concentr task discov iter figur html sourc list book titl tag mismatch token easi mismatch cardin book list book book repeat pattern solv identifi repeat pattern call gener wrapper resum mismatch solv algorithm case main squar locat search tag kei hint squar iter wrapper sampl occurr squar call ow os number occurr squar wrapper assum occurr match conclud encount mismatch squar occurr match identifi token figur simpl match sampl book paul jone xml work html script javascript squar token immedi mismatch posit token call termin tag run correspond tag mismatch correspond end list sampl begin occurr squar clue squar initi list higher cardin wrapper mean mismatch token correspond initi tag explor candid squar form real candid squar form sampl check possibl search wrapper sampl occurr termin tag search fail succe sampl infer sampl candid occurr squar token squar match check candid occurr identifi match candid squar occurr upward portion sampl start match token move search succe manag find match figur wrapper gener gener denot newli found squar search wrapper contigu repeat occurr mismatch replac shown figur mismatch resum run solv mismatch complet conclud success gener common wrapper input html page base appar case tag iter respect mismatch token successfulli produc common wrapper page option miss list complex exampl figur algorithm succe solv string mismatch simpl tag mismatch number mismatch solv repres challeng case discuss section discuss challeng string mismatch straightforward concentr tag mismatch mismatch solv algorithm inher solv mismatch gener solv figur report variant page page nest list book list edit start match sampl initi equal page stop token tag mismatch found solv mismatch base termin tag token locat candid squar occurr wrapper match candid squar upward portion wrapper rememb match squar start compar occurr termin tag move token comparison figur duplic wrapper portion match match token list order differ previou squar match simpl align mismatch gener match fragment mismatch call intern mismatch intern mismatch involv token depend nest structur lead discov list edit insid list book deal intern mismatch extern mismatch mean match algorithm solv extern intern mismatch requir start match base idea discuss differ match work compar wrapper portion object respect case figur extern mismatch trigger intern mismatch discuss lead discov list book lead identifi option pattern final wrapper report figur sourc complex algorithm altern lead correct solut ahead choic prove backtrack resum altern discoveri iter tag mismatch idea hold step solv mismatch requir wrapper candid squar match intern forc search squar wrapper sampl locat squar search termin occurr termin identifi candid squar match tree base idea discuss give descript algorithm match algorithm work gener wrapper match sampl solv mismatch encount find solut correspond find visit tree shown figur solut correspond solut extern mismatch encount solv mismatch correspond turn wrapper page comput system primer intern mismatch wrapper solv extern mismatch find visit mismatch solv introduc option search wrapper sampl iter option altern candid evalu order discov iter solv intern mismatch wrapper sampl manag solv return gener wrapper output ɛ lower complex formal argument omit space show algorithm exponenti time complex respect input depend fact tree match worst case exponenti size due explor altern mismatch primari goal implement sampl figur complex match xml work comput limit complex introduc prune order skip correspond solut base achiev good express shown run time report result figur section bound node put constant bound maximum number candid squar option occurr evalu larg justifi experi real case squar candid close mismatch point implement system seldom evalu candid sort children node base length candid shortest discard limit backtrack extern mismatch reduc amount memori store discard portion tree visit candid intern extern extern extern mn pcdata squar squar option option candid candid candid intern ml figur tree wrapper gener problem found correspond extern mismatch lead discov extern mismatch lead find discoveri fixpoint match backtrack delimit order find reason express complex match decid constraint posit option pattern prune tree base respect posit iter option discard visit strategi wrapper pattern delimit side option pattern left delimit pattern choic slightli reduc express advantag practic gener exponenti confirm low comput time memori requir exhibit system discuss section result base algorithm develop prototyp wrapper gener system run number experi real html site system complet written java order clean html fix error make code compliant build dom java port html tidi librari html clean prototyp conduct experi site experi conduct machin equip intel pentium iii processor work mbyte run linux sun java develop kit run collect html iter appli algorithm match gener common wrapper page algorithm initi page initi wrapper success match wrapper gener step sampl gener page singl algorithm produc wrapper store set match list page wrapper gener algorithm gener collect cluster input html page respect match wrapper report figur list result rel web site select number class fairli regular class download number sampl figur tabl refer experi conduct tabl compar page class result data extract system result wien stalker wrapper gener system base machin learn approach tabl figur short descript number sampl consid result obtain number wrapper creat number sampl match wrapper outcom data extract process extract dataset page comput time examin sampl total time comput match sampl includ time relat preprocess sourc call time tabl class result schema site descript time nest opt list car brand music style product subcategori product inform packag packag distribut singl packag packag directori club countri player nation team tabl site schema compar result la weekli address finder nest opt ord wien stalker data element structur level nest number attribut number option number list larg major page system gener wrapper extract dataset html sourc process complet automat requir human comput time gener order experi show match converg examin small number sampl match wrapper remain case system unabl extract data page main sourc limit express power regular restrict implement match algorithm discuss express power case suffici express wrap page happen sampl class form form regular languag requir union case languag infrequ case encount experi packag directori page describ folder softwar packag nest folder repres screen progress indent folder tag piec html code form languag nest balanc languag figur result regular system fail find common wrapper page case regular languag requir union frequent kind music page list custom html code case system unabl discov repeat pattern wrapper gener fail unabl factor system return number wrapper order number sampl implement choic class partit due choic implement system discuss disallow adjac iter option order gener singl wrapper page page singl packag descript page requir iter adjac option pattern comparison work compar result wien tabl figur report number element respect page class result literatur origin test sampl class download rise repositori inform sourc data extract project tabl site page number descript target number attribut level nest page option element attribut occur order result obtain comput time wien stalker refer cpu time learn thing worth note respect express power system wien stalker gener wrapper examin number label system knowledg target priori knowledg organ page comput time refer case system gener wrapper cpu time order magnitud lower learn wrapper wien stalker differ wien unabl handl option fail sampl stalker express power handl disjunct treat attribut address finder limit fail case wien stalker handl nest fail class page list list equal correctli discov nest gener wrapper qualiti extract dataset import comment relat qualiti data extract wrapper dataset correspond expect inspect case influenc physic html layout data page give simpl page list club countri logic page list club rel citi present list present tabl row tabl data html layout induc interpret list quadrupl wrapper gener run clue fact column html tabl gener dataset form case relev data correctli schema page wien stalker portion html compar result restrict analysi portion expect logic organ page refer tool extract structur semistructur data text document atzeni mecca cut past merialdo weav web mecca grammar except inform smith approach extract data web gold languag identif limit inform gold complex automaton identif data inform grumbach mecca search lost schema crespo extract semistructur inform web proc workshop manag semistructur hsu dung gener transduc semistructur data extract web inform extract inform web kushmerick wrapper effici express artifici doorenbo wrapper induct inform extract knoblock hierarch approach wrapper induct proc autonom pitt induct comput complex analog induct lectur note ai soar da silva extract semistructur data exampl sahuguet web recycl html page xml document soderland learn inform extract rule semistructur free text machin winston artifici intellig
DB/908 3 diagnosi frontend dlv system thoma wolfgang nicola leon gerald pfeifer institut ur technisch universit austria paper present diagnosi frontend knowledg system develop technisch universitat wien kernel languag system extens disjunct logic program integr offer frontend advanc knowledg formal formal model diagnosi emploi frontend includ abduct diagnosi dlp diagnosi diagnosi gener singl error subset minim consid illustr frontend show dlv encod diagnosi problem discuss implement issu diagnost reason implement dlv engin suitabl translat diagnost problem disjunct logic stabl model correspond kind diagnost reason problem emerg reduct provid disjunct logic stabl model introduct effort spent develop formal theori advanc knowledg implement formal system tailor solv kr problem achiev develop effici system applic wider rang kr problem earli stage step direct dlv activ develop institut fur dlv stand datalog datalog disjunct technisch universitat wien system base fragment disjunct logic program embodi gener disjunct datalog engin implement reli algorithm result present subsequ refin improv due express power languag system capabl effici express problem complex scope logic program exploit domain specif frontend applic domain comparison dlv similar system present diagnosi frontend dlv special effici system diagnosi stress point goal develop diagnost system compet fastest system perform intent demonstr formal diagnosi compil conceptu level dlv problem solv practic qualifi dlv tool solv ad hoc testb experi form diagnosi section download proce paper give section review concept disjunct logic program kernel languag dlv describ section formal model diagnosi realiz frontend support abduct diagnosi adapt semant logic program diagnosi abduct model diagnosi theori disjunct logic semant set stabl model form diagnost reason recent prove highli repres problem locat level polynomi hierarchi diagnosi model refer theori ai commun preprint issn io press thoma eiter al diagnosi frontend dlv system logic classic similarli origin definit reiter diagnosi modal gener subset minim consid model illustr kind diagnost reason support dlv number demonstr power simplic model diagnosi section present translat algorithm kind diagnost reason problem emerg discuss rewrit diagnosi problem disjunct logic stabl model program correspond diagnosi stabl model stabl model uniqu diagnosi exist diagnosi stabl model program exist part view central contribut paper run program obtain input diagnosi problem show section architectur conclud paper section preliminari disjunct logic program full background logic refer overview semant logic languag paper term constant variabl atom predic ariti term liter posit liter neg liter atom rule form atom disjunct head conjunct bodi normal posit disjunct note function symbol consid paper log program call datalog finit set disjunct datalog normal rule posit rule posit denot set head atom posit bodi neg bodi set denot set posit denot set neg liter denot set fa constraint express form liter rule empti syntact object ground variabl usual context deduct assum rule variabl occur rule occur posit bodi liter rule defin datalog program simpli datalog program set integr constraint denot herbrand set constant bp herbrand base instanti predic term instanti rule constraint term interpret subset bp atom true ground posit liter true wrt iff ground neg liter true wrt iff wrt ground rule satisfi interpret head true bodi constraint treat rule empti head satisfi iff bodi interpret model datalog program rule satisfi minker semant datalog program assign set minim model proper subset model program fa minim model fag fbg gener stabl model semant appli program negat datalog program total interpret transform wrt posit program thoma eiter al diagnosi frontend dlv system interpret stabl model set stabl model denot extend definit full datalog program constraint definit stabl model program datalog set integr stabl model satisfi constraint oper reason datalog program definit defin consequ oper brave reason oper stabl model datalog program set liter exist stabl model hold stabl model liter true datalog program fa stabl cg satisfi constraint stabl model consequ fag fbg bg abduct diagnosi dlp theori abduct diagnost reason wide studi literatur year diagnost problem consist descript system observ actual state reason error definit defin abduct diagnost problem tripl set ground atom refer datalog program section refer theori set ground liter refer observ solut refer abduct describ notion reason abduct diagnost problem gener abduct diagnosi case find gener subset observ base system descript consid diagnosi explan abduct case understand diagnosi system model reason observ definit gener diagnosi set hold note definit incorpor brave reason consequ oper literatur definit base cautiou true model varieti definit show disjunct system electr shown fig consist simpl wire parallel control plate oper plate stand thoma eiter al diagnosi frontend dlv system current melt current assum equal power suppli fail case power bulb broken bulb current high curr st power high system descript light power light broken bulb light melt fuse melt fuse melt fuse melt fuse high curr hot plate melt fuse power hot plate melt fuse power rule describ situat control light power bulb fuse melt fourth rule state high fuse melt rule state heat power failur fuse melt observ light emit plate st flight hot plate goal find st hh st st st explain current situat st stabl light light hot plate valid diagnosi examin valid diagnosi st stabl light hot plate hot plate valid model st hot plate augment high refrain model switch bulb ac fig simplifi circuit diagram program st stabl flight melt fuse hot plate flight melt fuse hot plate model light hot plate valid diagnosi note observ hold albeit suffici model explain observ brave reason st high broken high broken system descript util notion reachabl easili defin logic program defin classic order logic comput network depict fig node denot comput arc repres network fact form state connect node node main part system descript notion node reachabl node path comput path onlin thoma eiter al diagnosi frontend dlv system fig topolog network system descript net consist fact connect rule reach assumpt machin net work comput fail reach observ net valid show gener error explain assum explain inform gain gener prefer requir addit minim criterion singl error abduct diagnosi commonli minim criterion requir made hypothesi definit gener diagnosi singl error hold reconsid singl error diagnosi reconsid singl error diagnosi case obviou singl error assumpt potenti import miss follow directli singl error diagnosi assum addit case instanc observ includ singl error diagnosi exist subset minim abduct diagnosi version minim criterion requir subset diagnosi definit gener diagnosi subset minim diagnosi hold reconsid subset minim high subset minim thoma eiter al diagnosi frontend dlv system diagnosi diagnosi defin abduct introduc gener problem formul subsect defin notion diagnosi definit diagnost problem tripl set ground atom predic ab refer set sentenc refer theori set ground liter refer observ herbrand interpret theori sentenc quantifi consid assum sentenc written clausal form repres datalog program atom form mean compon behav abnorm gener diagnosi definit gener diagnosi set consist classic note approach requir weaker properti compar abduct approach definit requir consist classic definit requir exist stabl model entail diagnosi oi diagnosi diagnosi problem occur head vice versa hold gener comparison abduct fig circuit diagram full circuit descript full fig system descript add give definit gate involv xor output ensur input output truth thoma eiter al diagnosi frontend dlv system gener model circuit add gate abnorm add observ input output add smallest gener add hh add add add fact subset minim gener addit number yield diagnosi note abnorm compon show dual behavior function assum addit compon save model input output element connect input output fig faulti necessarili output addit full set gener clear irrelev origin definit includ minim criterion singl error diagnosi abduct feasibl singl error label compon abnorm definit gener diagnosi singl error hold reconsid singl error diagnosi add subset minim diagnosi field diagnost definit includ subset minim criterion definit gener diagnosi subset minim diagnosi hold state subset minim add denot powerset thoma eiter al diagnosi frontend dlv system dlp problem provid algorithm transform diagnost problem defin section datalog program defin section show algorithm transform abduct diagnost transform algorithm diagnost problem similar techniqu retriev project web page remark syntact restrict diagnosi theori order achiev perform implement resp due complex issu case harder express datalog approach transform abduct logic program disjunct logic program found sakama inou describ transform abduct logic program disjunct logic program model exploit similar idea transform gener case translat map subset minim stabl model disjunct logic program discuss basic abduct translat perform function fig special atom repres membership hypothesi solut rule connect constraint observ ad descript algorithm includ stabl hypothesi assum hold part hypothesi part diagnosi due minim stabl model sol occur imposs occur stabl model rule instruct function fig gener correspond atom belong model deduc constraint gener instruct function fig ensur solut initi theori observ abduct diagnosi predic start underscor reserv dlv intern usag regular user function dlp abduct problem oi datalog program var dlp begin hh hn fh fo om posit liter neg liter return end fig basic abduct diagnosi translat function dlp abduct problem oi datalog program var dlp begin hh hn return end algorithm gener abduct diagnosi gener abduct comput program gener algorithm thoma eiter al diagnosi frontend dlv system function set atom model program transform diagnost problem oi set atom var begin hh hn fh return end fig translat stabl model function dlp abduct problem oi datalog program var dlp begin hh hn return end algorithm singl error abduct diagnosi theorem oi abduct problem dlp logic program gener algorithm input stabl model dlp correspond diagnosi diagnosi stabl model dlp stabl model dlp fig diagnosi rule instruct algorithm gener diagnosi candid assum hypothesi candid check rule fig program comput singl error diagnosi gener algorithm similiar previou case introduc choic rule function dlp abduct problem oi posit datalog program var dlp begin return end algorithm subset minim abduct diagnosi theorem oi abduct problem dlp logic program gener algorithm input stabl model dlp correspond singl error diagnosi singl error diagnosi stabl model dlp stabl model dlp fig singl error diagnosi case similiar gener theorem differ gener evalu combin empti virtu instruct algorithm instanc gener hypothesi assum minim stabl head made true program comput subset minim abduct gener algorithm consist part gener part check minim part produc function fig complic function consid note theori restrict nonneg full subset minim abduct diagnosi problem datalog theori complex class express datalog subset minim abduct diagnosi datalog program consid order algorithm compact thoma eiter al diagnosi frontend dlv system function dlp abduct problem oi posit datalog program var dlp begin hh hn fo return fig subset minim check abduct diagnosi theorem oi abduct problem dlp logic program gener algorithm input stabl model dlp correspond subset minim diagnosi subset minim diagnosi stabl model dlp stabl model dlp fig subset minim diagnosi note predic directli support stand inequ denot successor comput minim extend gener case addit minim check perform set rule gener function fig minim check work diagnosi subset satisfi subset element gener subset reject rule instruct function fig gener set fact rule instruct gener subset fix index hk ig repres set element hypothesi true stabl model true subset check entail observ reject minim mean instruct gener version theori parametr respect index rule gener instruct instal correspond element parametr respect stand paramet list rule instruct check observ entail mean parametr copi theori gener instruct observ entail true mean diagnosi invalid minim subset verifi condit true minim reject final check perform rule instruct minim hold hk hk true condit express rule process applic thoma eiter al diagnosi frontend dlv system user gui user error singl subset minim gener error singl subset minim gener diagnosi rewrit diagnosi rewrit dlv kernel abduct reiter fig system architectur check success rule rule enforc check true system architectur gener architectur diagnosi frontend dlv depict fig order diagnosi user observ diagnost problem separ file file requir bear extens observ file tag extens theori file special requir invok dlv system diagnosi tradit interfac graphic user interfac user type reason desir minim criterion recommend extens avoid option effect gener abduct singl error abduct subset minim abduct singl error subset minim tabl switch subset select option depict tabl mean radio button gui depend diagnosi mode translat algorithm fig result datalog program solv stabl model calcul function fig appli model order extract diagnosi correspond model user interfac subsequ displai window termin work diagnosi frontend dlv system abduct diagnost reason diagnosi gener subset minim comput knowledg power formal illustr show number problem repres easili framework implement frontend reli translat rewrit diagnosi problem disjunct logic program stabl model correspond subset minim make dlp encod fulli exploit power disjunct logic program solv problem issu remain work issu design optim techniqu speed comput note datalog program se consid effici fragment datalog expect fast diagnosi frontend solv problem thoma eiter al diagnosi frontend dlv system identifi lower complex bound potenti effici solut algorithm exploit structur knowledg system suggest lead perform requir problem specif translat algorithm map diagnosi problem disjunct logic program fragment datalog effici evalu procedur datalog engin restrict emploi complex algorithm find solut transpar user datalog present unifi comput framework abduct problem identif unifi semant framework gener definit diagnosi problem spirit remain investig issu work altern formal diagnosi abduct diagnosi infer stabl model dlv system freeli platform dlv homepag detail descript featur dlv system found acknowledg author implement origin version diagnosi frontend dlv work support scienc project refer pfeifer dlv overview workshop logic program octob rullo strong weak constraint disjunct datalog intern confer logic program nonmonoton reason number lectur note ai page juli springer verlag tanca logic program scarcello dlv model gener applic frontend workshop logic program research report page septemb munchen torasso relationship abduct deduct journal logic consol torasso spectrum logic definit diagnosi comput diagnosi causal network fourteenth intern joint confer artifici intellig page morgan kaufmann compil approach sixth intern confer principl knowledg reason page morgan kaufmann de reiter system artifici dix semant logic intuit formal properti overview action inform proc konstanz colloquium logic inform page leon abduct logic semant complex theoret comput decemb mannila disjunct datalog acm transact septemb scarcello deduct system nonmonoton reason intern confer logic program nonmonoton reason number lectur note ai page springer scarcello architectur disjunct deduct system joint confer declar program page june scarcello progress report disjunct deduct system dlv intern confer flexibl queri answer system page scarcello kr system progress comparison benchmark sixth intern confer principl knowledg reason page morgan kaufmann pfeifer repres school timet disjunct logic program languag workshop logic program octob thoma eiter al diagnosi frontend dlv system faber pfeifer dlv homepag gelfond lifschitz stabl model semant logic program logic intl confer page mit press gelfond lifschitz classic negat logic program disjunct gener inou sakama transform abduct logic program disjunct program tenth intern confer logic page toni abduct logic program journal logic kaka mancarella updat abduct vldb page konolig abduct versu closur causal theori artifici scarcello disjunct stabl unfound fixpoint semant comput inform june lloyd foundat logic program lloyd foundat logic program edit rajasekar foundat disjunct logic program mit minker indefinit data base close world assumpt confer autom deduct number lectur note comput page springer peng abduct infer model diagnost problem solv symbol comput artifici intellig pool explan architectur default abduct reason comput pool normal fault diagnosi eleventh intern joint confer artifici intellig page przymusinski stabl semant disjunct program gener reiter theori diagnosi principl artifici sakama inou disjunct abduct logic program van eleventh intern confer logic page extend version relat abduct disjunct logic system intern joint confer artifici page
DB/909 3 xml queri experi exemplar editor mari fernandez lab research jerom simeon bell lucent technolog philip wadler bell lucent technolog contributor sophi cluet inria deutsch univ pennsylvania daniela florescu inria franc alon levi seattl david maier oregon graduat institut jason mchugh stanford jonathan robi softwar ag dan suciu lab research jennif widom stanford abstract paper identifi essenti featur xml queri languag examin exist queri ya xql languag commun possess strike similar fourth document commun lack kei function introduct commun learn thing process queri evolut relat semistructur principl remain semistructur languag emerg aim queri xml lorel languag develop independ research group thousand mile show strike similar approach document commun learn thing search format document document process commun develop model structur text search techniqu region algebra languag emerg process xml data xql commun address applic area commun concern larg repositori integr data heterogen export view legaci transform data common format document commun concern queri structur integr structur deriv multipl present singl underli document major author document camp commun great deal experi studi express power support applic area list queri languag featur provid express power argu express power queri languag plai central role design queri languag xml document commun learn dont feel compet advanc lesson hope commun learn queri techniqu implement queri languag subject scope paper queri languag list featur ffl queri consist pattern filter constructor inform pass model flat unord structur ffl construct nest order relat retain structur origin complet restructur document kei advantag approach construct includ nest queri group relat data item skolem function explicit group oper index sort ffl join oper combin data portion join oper relat ffl tag variabl path express support queri knowledg document structur access arbitrarili nest data provid ffl construct process altern wai construct check absenc miss field ffl arbitrari extern aggreg string comparison ffl navig simplifi handl data refer illustr point collect typic queri show express xql languag structur xql structur queri express xql xql grew document queri express xql wrote paper xml queri work group highlight research commun experi design implement xml queri languag suggest lorel adopt work group initi languag light languag strike ignor lesson learn research commun suggest common idea featur languag consid start point work group serv yardstick work group recommend languag compar address import orthogon environ xml queri languag execut refer reader list desir languag featur relat issu refer reader substanti bodi includ motiv typic applic semistructur data model semistructur data design queri process optim schema languag schema extract section present ten essenti queri section present featur ten essenti queri present queri illustr ten essenti featur xml queri languag illustr exampl xql languag provid natur simpl formul run xml input document bibliographi entri dtd bib book price book year cdata author editor affili titl affili publish price dtd specifi book element author element editor publish element price year attribut author element editor element affili price text select extract select titl book publish give queri evalu maximum order output section show sort titl document alphabet order queri consist pattern match nest element input document bind filter test bound constructor specifi result term bound variabl nest queri constructor xql support pattern constructor xql appli filter element process entiti refer note lorel provid syntact shorthand common idiom write queri gener form assum queri fix data sourc return xml tree queri act xml dom graph implement xql interfac dom construct construct pattern filter constructor construct result map variabl tupl valu satisfi result pair year titl valu bound satisfi result complet queri construct outer construct element book satisfi pair make bib titl match bib titl publish constructor make pattern match filter repeat element pattern express bib element book book element year publish titl element nest queri constructor bib element multipl book pair result mean match relat map variabl tupl valu satisfi lorel select lorel constructor select pattern pattern filter bib entri point data xml document bind variabl element id element denot select element satisfi filter mean relat map variabl tupl valu satisfi select construct xml book element year attribut titl element xql titl xql pattern select bib element input document evalu nest express element nest pattern book select book element children bib element satisfi filter bracket xql constructor pattern express determin result queri result bib element select book express project book year attribut titl element flatten queri longer filter publish return collect pair queri flatten nest book contribut pair author recal mean pattern filter cartesian product variabl bind satisfi pattern filter result flatten effect basi restructur document construct construct produc tupl bind satisfi pattern filter book titl possibl multipl tupl author book construct produc result element pair valu bound constructor free variabl make result titl author match bib titl pair titl author produc result element queri titl author occur preserv duplic elimin bag permit duplic intermedi set elimin duplic lorel select lorel bind variabl book input document author pair book bound variabl creat element pair tag result xml construct result element titl author xql flatten exist result pattern filter model intermedi relat result xql queri maintain origin nest node input document preserv structur previou return result pair preserv group result titl xql group preserv result queri project origin document titl author book queri creat result element renam oper children result element titl author element book document order preserv queri written make result titl match bib titl author queri extract titl author author bound list author element book success author lorel queri express lorel select select pattern express denot set valu denot set bind produc book element set titl author book preserv origin document structur nest construct construct construct bind variabl book element collect element select author element preserv structur nest queri explicit group construct section chang structur nest result queri structur origin xml document queri illustr restructur group author titl written requir join element author queri treat author equal exampl join section construct construct join construct occur outer occurr test equal result element construct pair author element titl construct nest queri make result author make match bib titl match bib nest queri join author element lorel select lorel nest queri join author element xql xql express join section express requir flatten multipl instanc author produc singl element author queri demonstr import semant chosen languag restructur data flatten data reconstruct chang structur explicit group addit group lorel provid construct support easier group lorel provid skolem function show rewrit queri previou section oper queri group author titl written make result result author match bib titl match produc tupl bind satisfi pattern led flatten effect result nest group write result make express compactli result previou nest queri construct construct attribut type id uniqu identifi element bear element document id attribut distinguish attribut id type id control group attribut denot uniqu function call skolem function separ result element group result singl element author multipl titl lorel select syntax skolem function lorel reflect underli data model present earlier queri queri skolem function creat desir structur root skolem accept creat singl multipl result result creat author skolem function distinct pair bind element creat author author titl book xql xql support explicit group oper combin data sourc combin inform collect portion merg inform multipl document assum data sourc book review review entri titl price review queri list book price sourc construct construct note variabl titl join data sourc join oper numer techniqu develop evalu join effici make titl match bib titl price review titl price queri ident lorel lorel entri point review access data xml document select pb pa tb note lorel explicit equal predic book titl perform join xql xql queri titl price price join perform assign variabl variabl assign bind variabl book predic select titl review explicit assign select suggest evalu strategi symmetr syntax languag preserv tradit queri sql oql separ queri semant mechan evalu index element xml document order import refer order element preserv order order queri return book titl element author xql titl xql subscript index subscript singl combin express select author author element renam empti element lorel select exist lorel nest queri construct result select author index produc element exist author index construct construct construct construct index variabl pattern bind titl author index bound posit author element list sibl index start titl element author index index constructor nest queri select author index produc element exist author index make bib titl make match author make match author match bib titl author index variabl denot start retriev titl list author variabl make nest return author select index creat element author exist sort select titl book publish output order back show modifi queri titl list alphabet construct construct queri ident section specifi result element sort titl make bib book titl match bib titl publish ident queri section phrase specifi result element sort titl lorel select order order sort element satisfi book titl creat output document select xql xql sort construct consid combin sort index previou section list titl order input document unlik preserv document order lorel explicit order tag variabl xml document mean queri document priori knowledg structur tag element queri select book element tag match regular express result queri preserv origin tag construct construct tag variabl queri document structur variabl bound tag book tag match regular express constructor produc element tag note element express begin tag variabl close open tag make bib book titl match bib book titl tag variabl denot symbol lorel select queri path variabl bound path match regular express function return string path path variabl gener tag variabl bound arbitrari path document tag variabl manipul tag valu assum data sourc inform type product type model product type model type element tag gener join queri section item type join element tag element valu version bound tag product element sourc type element sourc lorel formul similar construct construct queri appli sourc product type element tag valu type priori product type ad queri work modif xql xql support tag variabl express queri express queri conveni constrain path express dtd defin element section chapter section titl section element nest section element arbitrari depth express match path arbitrari depth queri retriev section chapter titl word nest level occur construct construct match chapter element sequenc nest section element express combin altern concaten oper lorel select path express compon bind variabl element reachabl chapter sequenc section element xql xql support express support access children descend oper queri arbitrari depth unconstrain path queri select titl chapter section string requir section element chapter titl titl provid express write queri potenti return entir document techniqu evalu class express effici addit featur exampl previou section illustr essenti featur xml queri languag present featur extern function aggreg applic domain requir special oper support applic aggreg function integr applic requir approxim comparison string valu queri access price list collect multipl bibliographi return minimum price book construct construct queri extract titl price group price book skolem function final min aggreg function return minim price queri comput averag number author book make match bib book author function approach aggreg function simpli function collect queri aggreg count return size input collect list author avg averag process altern xml dtd provid construct describ altern structur book bibliographi author editor extract full content author element affili editor written make bib match author make book titl editor affili make refer titl org match bib nest queri match book bibliographi pattern separ altern construct similar function program languag case statement imper languag book match author make book titl author match editor affili refer titl organ creat altern handl nest queri nest queri handl mutual construct construct construct quantif check properti hold element collect queri coupl book set author queri requir abil compar set valu lorel lorel select exist exist filter verifi author author book filter check opposit set predic quantifi author directli set equal make origin copi match url author url author variabl set author book filter test set equal express nest negat isempti predic predic return true evalu empti answer check exist author book provid function similar quantif xql express queri data model navig imagin slight chang maintain affili address avoid duplic assign uniqu id chang book element refer author id dtd omit bib book book year book author book editor person person id author attribut type refer person element illustr data repres xml wai complex repres directli indirectli refer atom repres attribut queri languag defin respect data data physic data model unifi xql support model distinguish support graph data unifi compon refer lorel support model unifi attribut advantag unifi data model queri written independ underli lorel queri section select queri chang complet modifi queri requir explicit join access referenc select pid bind author attribut bind content person element select person id attribut equal join output document construct author element content content person queri section appli newli reorgan construct construct make result titl author match bib titl queri requir small modif access author attribut variabl bound referenc element xql modifi queri make work titl author xql explicit indirect string return element id match titl present featur xml queri languag support requir applic transform xml data sourc base experi queri languag provid good express simplic perform xml queri languag advantag experi paper express power declar confid featur evalu effici optim techniqu exist featur join nest queri path express aggreg function refer abiteboul queri data intern confer page wiener lorel queri languag semistructur data intern journal digit april beeri milo schema integr translat structur data intern confer springer verlag buneman semistructur data acm symposium principl page suciu ad structur unstructur data intern confer page springer verlag suciu queri languag optim techniqu unstructur data acmsigmod intern confer manag page cattel object odmg morgan chaudhuri shim overview optim queri aggreg data engin bulletin cluet moerkott evalu queri gener path express intern confer manag cormack algebra structur text search framework implement comput simeon mediat data intern confer manag simeon ya design specif technic cluet moerkott nest queri object base intern workshop program integr heterogen common domain queri base textual similar acmsigmod intern confer manag suciu queri languag xml intern world wide web suciu catch boat experi manag system intern confer manag fernandez suciu optim regular path express graph schema intern confer data widom semistructur data migrat lore data model queri languag intern workshop web june goldman widom enabl queri formul optim semistructur larg data page septemb graef queri evalu techniqu larg comput survei maier desiderata xml queri languag workshop queri languag xml mchugh widom queri optim xml septemb motwani infer structur semistructur data workshop manag widom object exchang heterogen inform sourc ieee intern confer data page march robi design editor xql suciu overview semistructur data sigact decemb
ML/910 6 integr case base reason tabu search solv problem stephan ganascia universit pierr mari pari cnr place bp pari cedex franc abstract tabu search establish heurist techniqu problem exact algorithm belong famili simul anneal genet algorithm extend basic iter improv scheme ad control learn techniqu captur experi establish analysi past search experi process order guid search solut introduc reason approach control learn tabu search search experi concern oper select repres case aim case improv conflict resolut method domain present applic facil locat problem result show ad approach basic tabu search significantli improv solut qualiti evalu benchmark problem reduc gap optim solut factor la recherch est de pour de algorithm exact ne pa ell la de techniqu le simul le algorithm tend le cycl basic itr en recour de techniqu de de recherch ce tent de de dune de la recherch est de la recherch sur la instanc de dan cet nou techniqu de de ca pour de dan la le ca rel la de il la de la du nou par son applic au de placement le de la techniqu de recherch la qualit de solut identifi pour de de entr le solut la solut se ou dun paper publish intern confer aamodt veloso reason research lectur note artifici intellig springer integr case base reason tabu search solv problem stephan ganascia universit pierr mari pari vi cnr place bp pari cedex franc abstract tabu search establish heurist techniqu problem exact algorithm belong famili simul anneal genet algorithm extend basic iter improv scheme ad control learn techniqu captur experi establish analysi past search experi process order guid search solut introduc reason approach control learn tabu search search experi concern oper select repres case aim case improv conflict resolut method domain present applic facil locat problem result show ad approach basic tabu search significantli improv solut qualiti evalu benchmark problem reduc gap optim solut factor introduct import problem solv effici exact mathemat program local search iter improv tabu search regularli shown apt produc solut domain success base abil learn problem instanc experi control futur search learn call strongli domain depend essenti statist natur reason research import solv problem approach investig demonstr domain logic learn simpl problem instanc improv acquir case complex system cabin design repair problem job shop maintain case librari definit provid criteria select repair action paper introduc learn techniqu directli design experi learn level insid tabu search hybrid combin strength gener techniqu cbr capabl captur experi domain weak knowledg paper structur section present test domain serv facil section outlin tabu search concept understand section introduc learn section present preliminari evalu facil locat problem facil locat problem deal optim place unknown number facil plant finit set order cost deliv demand set client facil binari variabl design open facil locat client demand real variabl ij hold flow facil client open facil charg fix cost cost ij charg flow ij typic relat distanc facil client express object function find facil configur total cost simpl studi variant facil locat facil locat problem facil capac unlimit import practic applic transport industri sector mathemat program formul ij ij subject ij ij ij max max mathemat properti provid mean find global optim solut larg problem instanc addit constraint exact techniqu distinguish problem problem usual separ oper research problem facil problem instanc defin give client set locat anymor heurist tabu search interest evalu benchmark problem instanc result heurist approach compar global optim solut client client client client mn fig gener facil locat tabu search local search heurist explor search space move solut state appli oper order improv object function iter variant classic deepest descent search scheme produc high qualiti solut optim varieti domain simul genet algorithm tabu search tabu search tackl search control applic facil locat problem produc solut oper select guid oper evalu function reflect chang appli tabu search add control structur gener oper select criteria base level control consist tabu list cope local minima greedi local search trap visit solut put manag strategi long oper lead back declar tabu forbidden appli idea forc search move case local push attract tabu list fix size adapt variabl size tabu search upper level build memori search process meant improv futur benefit learn experi experi search problem instanc aim focu search area search diversif direct search unexplor region interpret rigor defin problem depend criteria case facil typic consist fix number open facil forc explor similar diversif achiev compel open facil chang statu number iter combin tabu search reason claim reason suit control learn tabu form learn base experi shallow resum qualifi experi solut close optim solut refer found past search reason adapt problem experi extens repres domain knowledg weak domain theori control learn plan investig machin learn reason differ plan plan achiev local search solut construct task find good oper receipt construct choic abandon learn singl oper evid good solut problem instanc share characterist good solut problem instanc transfer acquir experi problem instanc practic major concern plan learn complet uncommon tabu search remain part paper introduc learn improv oper local search techniqu detail straightforward learn techniqu case captur approxim call oper fire outcom hypothesi case similar fire oper result similar qualif case relev oper schema creat descript state oper fire reward attribut fire case retriev occur oper applic state descript identifi similar case relev retriev case reward modifi oper fire prioriti algorithm problem defin domain problem instanc stop condit tabu start problem instanc empti case librari initi function solut engin domain current gener initi solut state current empti satisfi set appli oper achiev oper case current return tabl main loop function feasibl solut empti repeat agenda set applic oper current oper agenda prioriti appli set prioriti reorder agenda select oper highest prioriti agenda append current fire current current feasibl return current tabl solut experi feasibl solut solut gener long stop condit satisfi typic stop condit combin cpu iter number iter improv solut appli achiev solut case insert case librari feasibl state build iter appli oper current state agenda set applic oper fall tabu condit tabu list conflict agenda sort oper evalu function modifi conflict resolut relev experi retriev case memori feasibl state construct special plan effort control structur provid user model oper close facil add tabu sever client facil alloc client unsatisfi demand open control strategi facil client client alloc facil close long facil member tabu close open remain initi client alloc closest facil case assess case repres order languag facilit domain model similar comput case requir partial match construct subgraph isomorph worst case match complex grow exponenti number descriptor case number descriptor proport problem instanc case singl machin schedul match complex problem undesir case assess reduc match complex classic approach predic type combinatori problem gener symbol numer characterist predic type cope numer featur order induct learn liter form start predic variabl number attribut attribut belong object type object attribut repres entiti attribut entiti relat facil object attribut type cost attribut type cost typic liter domain state deliv unit cost predic type reduc match complex case object happen simpl domain singl machin schedul common techniqu complex reduct reduc length retain state footprint case singl footprint produc oper precondit restrict descript situat oper appli case ideal complet local configur relat solut state defin context set present state oper describ domain entiti concern oper fire function context set fact precondit oper state object extract object attribut return subset fact state object occur tabl context construct fig oper schema left show definit evalu precondit action part show client alloc precondit entiti middl box fact object attribut occur lai precondit context state iti precondit ion action oper schema context precondit object fig context applic compon reward attribut oper fire oper reward depend qualiti solut construct transform oper involv evalu opt simpl qualit heurist reward assign posit oper contribut improv solut qualiti neg assign construct feasibl solut defin solut tabl case gener function case current reward bonu reward return case tabl case gener reward attribut case aim clarifi gener interest case librari rudimentari case ad base sequenti simpli append end evalu case origin pertin perform case retriev simpl target partial case librari order find closest match liter liter match attribut greedi partial match heurist liter map order order ad context similar evalu hit count map ratio map numer attribut final evalu partial map detail algorithm match similar evalu previou work case adapt oper prioriti reward store retriev case reward attribut scheme lead prioriti case bonu prioriti diminish case prioriti adapt weight similar case oper function prioriti empti case sim match case sim sim case reward reward reward bonu return tabl case retriev prioriti adapt result goal verifi ad tabu search improv qualiti solut found benchmark problem instanc optim solut make verifi close heurist approach global optimum cross valid separ train due rudimentari case librari appropri evalu cpu time impact approach similar tabu search restart scratch empti case librari design learn conduct improv system implement conduct sun sparc workstat industri forward chain infer engin pattern match domain model introduc section tabu list implement tabu list fix size list variabl size rang transit probabl list size main iter ad basic tabu method medium size problem instanc client affect instanc facil stop visit solut find solut run requir iter gener result shown tabl solut produc method global optim solut problem smaller object function solut improv column absolut solut total cost due result show integr improv solut qualiti problem instanc problem instanc tabu search produc excel result ad benefici averag gap optim solut improv solut qualiti tabu search design divid gap optimum paper introduc learn store oper select experi encount tabu search problem solut improv instanc problem solut improv instanc tabl solut qualiti improv due progress evalu approach conduct facil locat problem show ad tabu search framework solut qualiti test domain significantli improv tabu search techniqu evalu problem domain tabu search implement comfort gener interest approach order gain deeper understand ad reason techniqu tabu search improv rudimentari case base introduc analysi case relev contradict compar case librari feedback case identif high case confid sophist case librari improv perform approach actual work address topic acknowledg alain david fruit discuss work refer reactiv tabu orsa journal comput distribut test problem electron journal oper research societi heurist locat european journal oper research bunk similar measur structur european workshop bisson learn fol similar tabu search procedur balanc annal oper research glover tabu search part orsa comput glover tabu search part orsa comput ganascia reason approach knowledg transfer tabu tech rep pari ganascia case base reason tabu search singl machin schedul tech pari hammond model hansen ribeiro locat size platform oil european journal oper research kolodn morgan michalski theori methodolog induct machin artifici intellig palo mathemat morgan minton learn search control kluwer academ franci discret locat mitchel learn problem reev modern heurist techniqu combinatori kibler learn episod sycara acquisit user prefer solut improv veloso learn analog reason gener problem phd carnegi mellon chunk tabu tech california dec
DB/911 3 repres queri xml incomplet inform serg abiteboul studi queri xml incomplet inform simpl model xml data simpl queri system incomplet inform spirit system develop imielinski relat scenario incomplet inform xml document continu enrich success queri document show system repres partial inform sourc document acquir success intellig answer queri impact complex enrich system queri languag addit featur result suggest approach achiev practic appeal balanc express tractabl research present motiv xylem project object data web xml document introduct xml data call inform collect web site store central fashion inform held complet due limit storag dynam natur web expir deal incomplet inform view incomplet repositori xml document continu enrich explor web queri crawl web document miss partial author support part author support part nation scienc foundat grant number work perform part visit inria permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee pod santa california usa copyright acm luc victor vianu uc san diego incomplet inform xml document satisfi de nition incomplet inform xml document enrich answer queri remot document queri pose action rst altern answer queri incomplet inform data answer complet repres answer describ incomplet knowledg sourc import variat answer provid piec inform hold similarli possibl hold similar mediat seek sourc addit inform fulli answer queri incomplet inform guid determin addit explor web sourc advantag data paper introduc incomplet studi increment mainten address issu answer queri pose incomplet quest simplic cienci main motiv factor choic led limit notabl limit queri languag base pattern match simpl select condit data simpli ed dtd ignor order compon assumpt xml element persist identi er framework captur broad rang situat practic interest exampl illustr incomplet inform natur partial xml tree repres data type inform style dtd repres data miss type miss data interest reminisc extens dtd includ rang data price special mechan de ne type element pend context call incomplet tree illustr incomplet tree exhibit partial inform miss natur repres xml document show simpli ed dtd sati ed input sequenc pair partial knowledg input repres incomplet tree maintain increment ptime queri incomplet set answer queri repres incomplet tree comput ptime show incomplet tree form strong system respect queri check ptime queri fulli answer data case data su provid ptime algorithm incomplet tree determin addit inform sourc order fulli answer set queri retriev inform incomplet tree increment maintain size grow exponenti sequenc pair discuss wai deal exponenti blowup extens incomplet tree call intuit add form altern size incomplet tree shown remain polynomi respect entir sequenc pair manipul handl incomplet inform exponenti check empti conjunct tree ptime regular incomplet tree altern exhibit restrict input dtd queri ensur incomplet tree remain polynomi sequenc pair manipul remain polynomi exhibit approach deal case incomplet tree grow larg practic rst approach consist small set addit queri chosen provid critic inform elimin unknown inform shrink incomplet tree prove queri chosen incomplet tree remain polynomi size respect entir sequenc pair input dtd approach heurist approach heurist gracefulli inform repres incomplet trade accuraci size incomplet tree show approach incomplet tree polynomi sequenc pair argu core model practic appeal start point deal incomplet inform xml model limit discuss impact extens show minor extens lead signi di culti system longer exhibit partial inform longer strong system queri answer inform high complex undecid extens concern queri extra featur includ option neg queri construct path data power restructur model transduc discuss extens framework persist id assumpt issu order paper organ section introduc formal model type system section deal acquisit incomplet approach exponenti blowup incomplet tree section discuss extens complex undecid result paper end relat work incomplet inform interest earli system focu search semant queri appli incomplet semant incomplet approach close world assumpt open world assumpt cwa state hold explicitli state incomplet state rule incomplet tree reconcil approach combin semant describ exibl miss state fact document data exist landmark paper laid formal groundwork incomplet null introduc notion strong system system spirit address tree model relat model benign form queri languag restrict relat algebra data complex handl incomplet studi program complex higher exponenti data complex rst note part studi null weak instanc updat incomplet inform receiv special attent scenario spirit data techniqu reminisc techniqu answer queri studi problem model base incomplet inform studi problem manag incomplet due data expir studi extens dtd special consid special mechan system closest work investig studi incomplet inform semistructur data framework result di erent formal framework present core framework incomplet inform de ne turn model xml document simpli ed system incomplet inform run catalog figur data tree formal model abstract xml document label tree abstract simpli es real xml document minor substanti model distinguish attribut distinct consid signi simpli cation tree xml document order discuss issu order section nite set nite set element set data valu denot element node data valu possibl superscript denot set label assum set data valu ration number set equip linear order simpli ed model xml de ned definit tree tripl nite root tree node label associ label node data assign node data tree denot apr data tree ht ing restrict node note pre xe tree share node tree type structur valid document dtd simpli ed version dtd call tree type tree type speci element set element children node label multipl constraint root restrict easili remov alphabet label auxiliari notion multipl atom describ children node label atom express ai distinct label symbol definit tree type alphabet tripl label call associ multipl atom call type satisfact tree type tree denot de ned obviou root label label wi number children label ai restrict wi child label wi child label wi child label ai wi set tree satisfi denot denot tree type understood tree type catalog catalog product product price cat pictur cat observ write tree type repres graphic catalog tree multipl edg figur queri de ne simpl queri languag select pre xe input tree claim su cient practic queri basic input tree depth start read node speci ed element possibl select condit data valu node involv pattern extract speci ed leav pattern node label call queri pre queri queri figur queri price subcategori electron product price queri pictur camera pictur catalog label tree condi root associ node label extend alphabet intern node label sibl intern node distinct label cond associ combin statement form neg label absenc node label children node pattern node adorn bar entir root node extract exampl queri shown figur formal notion answer queri auxiliari concept valuat condi input data tree map node node edg mi map edg label int sati es mi edg child label answer pre tree consist node imag valuat descend node label answer queri catalog depict figur remark insist essenti aspect model remark identi tree queri answer pre xe root share node input import aspect amount persist node identi er input answer condit tree type discuss incomplet inform main idea time result previou pre full data tree repres complet data queri initi type de nition partial knowledg miss portion full tree incomplet inform includ pre tree descript miss inform describ miss inform extend tree type disjunct multipl condit data ad special mechan de ne type element instanc figur pose queri miss data type rst product categori product price greater de ne formal incomplet extend notion tree type note data sourc continu tree de ned introduc de ne simpl condit tree type condit de ned queri simpl condit tree type alphabet pair map associ disjunct cond associ condit condit appli data node label set tree repres simpl condit tree type de ned obviou manner denot extend notat tree type condit tree type hand side product disjunct multipl ab found context dtd express structur properti depend context node consid special achiev type element suggest de nition special map map set element transform data tree data tree obviou replac label readi de ne complex type paper condit tree type special alphabet tripl simpl condit tree special map label special label catalog element product semant condit tree type de ned data tree exist tree similar condit tree type unrank tree automata de ne valid set role special alphabet condit tree type similar state tree automaton analog fulli lack presenc data valu tree avor automata techniqu carri set tree de nabl condit tree type properti similar regular tree languag set tree de ned condit tree type close complement technic point algorithm test empti set tree satisfi condit tree type easi reduct test empti grammar show lemma check empti incomplet tree discuss incomplet inform consist pre full data inform miss portion tree miss portion condit tree type alphabet special alphabet order fulli captur incomplet su cient provid label pre tree element provid interpret node term special alphabet readi de ne incomplet tree definit incomplet tree consist condit tree type special alphabet data tree td data label map associ node td subset includ denot incomplet tree catalog incomplet tree result queri repres figur grei node inform describ miss portion input tree catalog product price cat pictur catalog catalog product dtd sourc product product product canon elec elec soni elec product canon elec elec soni elec elec camera camera camera price cat pictur camera camera answer queri catalog product price cat pictur catalog product catalog product canon elec camera queri queri answer queri price cat pictur price cat pictur incomplet inform queri queri figur catalog product elec camera price set tree repres incomplet tree de nition consist tree exist data tree sati es pre node label symbol symbol label node set tree repres denot incomplet interest check fact set fact partial inform natur fact interest pre xe tree incomplet tree data tree pre tree pre node identi pre tree pre show standard techniqu dtd theorem incomplet tree data tree check ptime pre pre acquir incomplet inform present main result show framework cientli deal incomplet inform scenario rst deal acquir partial discuss exponenti blowup problem answer queri knowledg consist incomplet classic problem queri incomplet appli model issu knowledg order fulli answer queri acquir incomplet inform basic inform web acquir gradual answer queri show framework develop assum input singl document tree type case multipl sourc easili reduc case virtual merg sourc singl document input tree tree consecut answer ne partial inform describ incomplet tree stage incomplet tree answer ne incomplet inform comput describ tree compat answer queri nement algorithm call outlin inform algorithm ne rst illustr algorithm catalog figur incomplet tree queri data tree output queri incomplet tree describ miss product product return queri electron product price creat label obviou condit attach special product construct incomplet tree repres kind product return queri cheap camera pictur node id product canon answer queri inform return node queri merg note persist node id assumpt critic product queri queri type inform fact price product case type product queri queri case camera return queri categori camera camera pictur case infer type miss return queri queri electron camera pictur yield categori miss node note nement algorithm ne input algorithm incomplet tree answer consist condit tree type special alphabet data tree output incomplet tree comput condit tree type negat condit tree type tree return empti answer node queri tree creat type la label type special la intuit ta accept start assum involv empti ta accept start verifi condit accept start satisfi condit return empti answer queri propag empti set cond cond creat tree type process queri root leav induct root type tr root tq node children tq de nition children bound add rule ta accept accept ta condit sati ed ai children satisfi condit requir iter note node leav treat di erent propag eventu failur type leaf creat easi modifi step step consist comput intersect tree type input tree type straightforward polynomi time note yield tree type conjunct disjunct multipl atom produc condit tree type miss inform data tree obtain creat type comput join exist node id crucial data special comput intersect type data type special condit tree type comput show theorem incomplet tree answer algorithm ne comput polynomi time incomplet tree complex algorithm ne repeatedli increment ne initi tree type success pair increment step size incomplet tree exponenti sequenc illustr algorithm incomplet tree ptime complex incomplet tree exponenti respect sequenc pair algorithm develop worst exponenti complex respect sequenc legitim due system answer turn prove independ system illustr pre shown theorem ptime respect incomplet tree theorem type xed alphabet data tree determin pre ai determin pre tree node identi proof reduct avoid exponenti blowup exponenti blowup incomplet tree illustr tree type root queri root answer empti incomplet tree construct queri algorithm ne yield disjunct multipl statement avoid exponenti blowup incomplet conjunct disjunct type de nition incomplet restrict initi tree type rst discuss extens incomplet tree restrict initi tree type conjunct incomplet tree prevent exponenti blowup incomplet tree conjunct disjunct multipl atom type speci disjunct mean conjunct disjunct multipl atom tree simultan valid respect type speci ed conjunct term analog altern nondetermin control refer incomplet tree augment conjunct conjunct incomplet tree shown conjunct incomplet tree construct increment extens algorithm stai polynomi sequenc pair input tree type conjunct incomplet tree illustr incomplet inform provid pair repres conjunct root ai bi special discuss algorithm ne yield disjunct multipl dnf form conjunct price pai conjunct tree complex manipul kei problem check conjunct incomplet tree theorem polynomi usual incomplet tree lemma restrict tree type queri approach avoid blowup size incomplet tree restrict input tree type exhibit restrict reason practic input tree type restrict perform data test path queri tree condi linear test pair node ni parent straightforward modi cation algorithm ne produc input incomplet tree size polynomi sequenc refer variant algorithm ne show theorem tree type answer incomplet tree construct algorithm ne size polynomi proof queri conjunct node factor transform conjunct incomplet tree regular incomplet tree straightforward process exponenti maxim depth queri qi tree type depth qi depth bound algorithm remain polynomi qi heurist sketch approach deal case incomplet tree grow larg practic rst consist small set addit queri chosen provid critic inform elimin unknown inform shrink incomplet tree choic addit queri guid appli incomplet tree larg standard choic addit queri incomplet tree polynomi size larger complet input data tree tree type approach deal larg incomplet tree gracefulli inform order shrink incomplet tree idea illustr incomplet tree larg explicitli restrict pair valu test repeatedli queri make maintain inform connect valu costli inform connect retain rang valu combin valu identi ed score system maintain dynam queri approach extend combin type constraint data valu structur tree omit detail abstract queri incomplet tree show incomplet tree answer queri distinct issu rst classic problem answer queri inform provid incomplet tree answer incomplet provid descript answer rst issu address present section address incomplet tree guid mediat decid queri sourc document order provid complet answer user queri note import technic properti incomplet tree produc algorithm ne call incomplet tree reachabl construct algorithm ne initi tree type sequenc pair inspect shown reachabl tree special form ensur multipl statement incomplet tree involv special version symbol unambigu special statement assign data node possibl describ miss data impact properti complex manipul signi comput complement intersect condit tree type gener analog manipul reachabl incomplet tree polynomi time rst question mention knowledg world consist incomplet tree obtain algorithm ne mean data tree answer answer data tree incomplet tree form strong system set incomplet tree arbitrari theorem incomplet tree ectiv construct incomplet tree denot construct decid fulli answer inform provid incomplet tree corollari tree data tree decid ptime fulli answer proof reduc test empti condit tree ptime lemma remark import side corollari combin theorem provid check answer view provid sequenc pair problem answer queri view studi recent context relat import variant queri answer problem incomplet decid fact answer queri consequ theorem theorem reachabl incomplet tree data tree check ptime pre pre guid mediat partial inform input speci ed incomplet user pose queri virtual input document provid complet answer queri inform addit queri gener input document obtain inform fulli answer queri incomplet tree guid gener queri assum gener queri explor input document start node refer queri local order gener local queri determin sourc possibl inform relev queri state question ectiv theorem reachabl incomplet tree check tree tree proof similar theorem detail gener local queri show cientli comput set local queri collect addit inform answer incomplet tree data tree td local express form queri return answer full td root set local queri complet rel equal obtain extend node td queri pose root trivial complet rel point local queri avoid work previou queri complet properti node exist retriev queri node retriev distinct queri queri return empti answer input tree call arbitrari incomplet tree illustr incomplet tree queri incomplet tree queri complet rel queri appli retriev exist valid incomplet reachabl reachabl incomplet turn complet state theorem incomplet construct ptime set local queri form complet rel complet appeal enforc cost paramet account order gener cient complet extens framework xml document incomplet inform reli limit avail persist node lack simpl queri languag section discuss extens impact handl incomplet inform studi extens scope paper illustr kind di culti extens introduc de nition section inform begin discuss extens impact handl incomplet inform branch recal tree pattern child label node pattern disallow queri pattern simultan product pictur camera branch multipl children label incomplet tree remain strong system extend branch maintain increment ptime reachabl incomplet tree exponenti respect data tree special root root incomplet tree describ possibl assign valu branch construct answer queri construct answer consist bodi head bodi tree pattern node pattern label variabl bodi de ne set bind variabl input node head queri speci es construct answer data tree bind spirit skolem function incomplet tree longer strong system branch construct answer root root bodi head produc answer equal number bs bind bind incomplet tree exist strong system queri remain open branch option queri option label semant valuat partial requir de ned node option request camera displai pictur exist camera answer pictur combin branch option yield exponenti blowup complex question consid illustr variant pre question note theorem check ptime tree pre answer tree compat input tree type singl pair ai extend branch option show theorem tree type pair queri branch option pre proof reduct valid dnf formula disjunct note complex lower bound independ system extend transduc turn framework extend order tree power restructur long data join illustr tree transduc introduc model wide rang xml transform languag origin transduc work tree data valu easili extend select refer extend transduc acceptor analog call extend languag order data tree accept call extend regular tree languag input tree type de ned extend regular tree languag natur system queri extend automaton automaton data tree languag accept extend automata provid system maintain stai polynomi input type entir sequenc pair shown extend techniqu theorem input type speci ed extend pair qi extend transduc ai exist extend automaton comput ptime fact automata provid system broad class restructur drawback intuit appeal incomplet inform provid incomplet tree lost automata strong system discuss necessarili regular tree languag input type transduc problem occur simpler set branch simpl construct basic manipul handl incomplet inform high lower bound theorem extend automaton due thoma fact test empti gener regular express recal empti condit tree type test ptime lemma basic step manipul extens involv join data valu turn extrem power featur lead dramat di culti handl incomplet inform kei question undecid join data negat negat consist label express alphabet complement valuat match posit extens valuat match neg extend negat leav join data valu compar data valu di erent node pattern queri combin featur lead undecid question input tree type sequenc pair data undecid queri empti answer theorem input tree type sequenc pair queri qi extend data proof reduct undecid implic function depend easi shown undecid queri tree satisfi input tree type compat pair undecid tree pre tree note result independ system impli exist ectiv system empti pre decid join data option construct reduct similar proof theorem show theorem data tree input tree type pair queri qi extend data option construct pre answer queri tree theorem highlight option construct answer path express join data valu queri pattern node reachabl parent pattern tree path label spell word regular languag extend path express test data valu lead undecid kei question theorem input tree type pair queri qi extend path express test data proof reduct empti intersect languag show ectiv strong system class queri node id order inform discuss persist node id issu order node id signi assumpt framework avail persist distinct queri xml document return node id node ident avail node id enrich inform node consecut illustr catalog id longer gener system incomplet inform extend order track wai match node return di erent queri assumpt node id gener depend sourc provid persist node id gener id element approach expect process cost order issu order facet consid input tree answer queri preserv answer order element input sourc dtd describ order children possibl regular express edg queri order select pattern queri request element occur element condit regular weaker partial order condit discuss extend transduc show framework extend presenc albeit cost high complex clear order complic handl incomplet inform input element rst queri request list element order queri list element queri list element answer answer depend type input form answer answer answer input form answer previou inform interleav element problem similar issu persist id wrapper data sourc provid rank merg answer consecut queri absenc system maintain inform partial order element order issu interest question explor main contribut paper simpl framework queri xml document incomplet inform framework model xml document simpl xml queri system xml incomplet inform show incomplet inform acquir consecut queri answer cientli repres increment ned system queri handl cientli exibl answer provid incomplet answer system full answer provid complet partial inform addit queri framework limit wai assum sourc provid persist node id order document dtd queri queri languag path express data join order trace boundari consid extens framework show signi impact handl incomplet rang high complex undecid justi es featur make suggest practic appeal solut handl incomplet inform xml refer abiteboul duschka answer queri materi view proc acm page grahn queri set world theoret comput regular tree languag alphabet unpublish beeri milo schema integr translat structur data proc int conf page shim optim queri materi view proc icd page mediat data proc acm page codd understand relat bull acm sigmod page complex relat queri inf yang expir data proc page grahn problem incomplet inform relat berlin yannakaki test instanc assumpt inf proc imielinski incomplet inform relat sagiv queri incomplet answer semistructur data proc acm page widom prototyp data creation mainten proc acm page sagiv answer queri view proc acm page yannakaki complex test implic function join depend vianu typecheck xml transform proc acm page papakonstantin vianu dtd infer view xml data proc acm page ullman answer queri templat bind pattern proc acm page reiter sound complet queri evalu algorithm relat null valu person complex problem automata theori logic phd report mac project mac vardi complex relat queri languag proc acm page vardi integr incomplet inform proc acm page zaniolo relat null valu journal comput system
Agents/912 1 inform agent survei mobil agent michael schroeder depart citi london uk april abstract inform agent process integr distribut inform achiev task research promot idea mobil inform agent migrat user host host network outlin concept mobil inform agent give survei load aim distribut inform process content introduct inform agent mobil agent mobil agent introduct advent internet dawn inform inhabit inform time aspect vision true inform access user overload approach resolut dilemma make inform evalu inform obtain distribut inform sourc reduc time discov valuabl improv qualiti inform reduc user time cost spent hunt inform biologi scienc experi speed drug discoveri reduc cost biologist discov unknown protein learn consult system publicli onlin tool publicli potenti miss import inform inform integr number analysi tool protein annot dispatch read entri send entri locat host enrich entri eventu send back dispatch protein annot import annot parallel solv problem achiev optim dispatch spread entri evenli load host network inform agent autom inform gather reduc network enabl asynchron machin achiev inform agent answer agent research agent develop past year review research agenthood constitut properti agent perceiv act agent exhibit behaviour agent interact user agent oper human control action broad broad shoham draw borderlin agenthood elegantli make hardwar softwar agent fact chosen analyz control mental understand design system emploi agent metaphor nwana agent axi role role inform agent common architectur inform agent consist inform mediat wrapper inform provid prepar possibl unstructur data mediat mediat point contact user facilit touch wrapper kind inform wrapper provid user queri contact integr return user research inform agent result develop system sim infomast infosleuth softbot kraft tambi type inform object encapsul dispatch creat itinerari inform visit itinerari collect inform order regist dispatch dispatch act mediat facilit time act wrapper system distribut comput distribut object comput platform rpc distribut load system mobil agent mobil agent mobil agent object data migrat host base work carri process migrat distribut object comput combin migrat distribut object coin spread java research wide interest object mobil java crucial develop mobil design program requir implement object mobil standard featur java remot method invoc simpl mobil object rmi develop support invoc method remot cater indirectli object pass paramet remot rmi copi object target machin object sourc object migrat machin support code mobil class migrat object java dynam class load rmi implement mobil mobil inform object easi implement simpli public void implement dispatch rmi provid remot method receiv mobil inform object code fragment public void public void public static void mor code fragment migrat object rmi type strong mobil weak mobil strong execut state object preserv weak mobil code restart arriv remot destin java support weak access execut stack mobil agent platform voyag aglet hive mole dagent strong mobil provid modifi java virtual machin dagent platform mobil agent mobil agent promot infrastructur inform agent potenti enabl asynchron infrastructur time reason mobil agent relat aim strategi adapt perform machin requir agent oper research investig mobil section survei mobil agent system distinguish system static task assign host stai migrat turn stage advantag leav system middlewar lb mo ma ft si pvm pvm corba corba spawn rpc java appl mat voyag flash voyag travel rmi al dagent challeng java figur market type mobil wan support fault nativ code resourc simul model load balanc current snapshot system predict system state inaccur survei figur addit inform middlewar underli system mechan secur implement top middlewar provis inform system state decid host start task qualiti approach depend amount state data gather data lead accur static task migrat launch host form easi implement lead good wide adopt applet basic middlewar pvm corba applet librari pvm adapt variat machin network ad achiev recommend servic load machin simpler approach applet central compon decid launch human user decid provid resourc download commun result back server implement particip simpl approach scale form massiv machin similar consist claim fastest comput earth number system good survei found approach system found approach repres system state balanc load market mechan resourc achiev match suppli demand resourc system price match emploi sophist auction protocol resourc consum bid resourc auction style emploi advantag auction market mechan determin unknown resourc group agent agreement commun determin spawn system emploi strategi infrastructur parallel applet auction mechan evalu simul vickrei doubl auction repeat doubl auction main goal gain trade author aim compar social price stabil role reserv price ocean avoid commun overhead auction price mechan negoti emploi hierarch broker architectur alloc resourc dynam price rent resourc period fee migrat data transport servic distanc sourc destin local cluster broker determin statist load pass hierarchi global knowledg pass broker evalu order alloc task ocean aim commerci platform exchang comput process power number arbitr assist task dissemin market price client type quantiti comput resourc serv trust assist secur transact protocol buyer make price bid requir secur resourc requir platform depend estim size comput task seller secur measur hardwar network support agent stuck machin launch environ dynam advantag agent migrat achiev mobil object mobil rmi object mobil activ thread decid independ move add schedul handl local central schedul decid task task agent decid local global pattern emerg exist number system base infrastructur travel mat flash make autonom mobil agent roam net search host mobil agent travel client wrap parallel applic mobil agent dispatch resourc broker broker form parallel virtual machin atop server execut agent host system autonom agent roam net server run platform base extend support strong mobil agent mat distinguish role hive manag user interact determin task queen agent run local server control worker thread mobil agent messag idl comput resourc remot workstat flash system agent maintain inform system pass inform local resid mobil agent mobil agent migrat cluster search free resourc system combin applic system inform base load manag react dynam background load avoid unnecessari migrat agent short life span approach system resourc control mobil agent base dagent platform strong mobil agent alloc resourc agent system electron bank system set resourc manag dynam price polici resourc present author focu price auction mechan dynam price addit commun system aim cpu agent locat respect commun partner system gear improv perform dynam match resourc execut requir agent accomplish agent migrat host agent resid commun improv static placement scheme achiev approach involv challeng obtain initi model adapt model time pass area oper author explor approach distribut cpu load expect process lifetim decid migrat similar idea challeng implement market approach monei agent make bid give estim time complet job import major impact system messag delai error estim job complet time deal problem learn behaviour introduc bid agent mobil inform agent roam network integr distribut inform lang oshima point mobil agent reduc data transfer shown jim waldo point intellig agent typic reduc reason mobil agent asynchron machin launch task execut collect work theori clear long agent initi host wait clear host assum agent perman failur creat asynchron comput requir limit form leisur stai onlin perman asynchron comput easili implement distribut object system amend default protocol client send request poll result server push client defer synchron request standard featur reason mobil mobil process investig oper system number agent system mobil put gener context compar agent system cater static mobil approach balanc load current system obtain system wide maintain accur model workload system futur work challeng integr chang model minim current inform task system run entri annot autonom decid migrat local comput resourc aim optim workload system made inform provid migrat ultim achiev emerg balanc workload system refer allan parallel applic softwar high perform comput survei comput network inform tool knoblock retriev integr data multipl inform sourc intern journal intellig cooper inform page knoblock queri process sim inform mediat laboratori plan schedul initi reprint read agent singh morgan kaufmann finkel design process migrat charlott experi dynam load distribut larg workstat network proc intern confer lectur note comput volum page august pg steven transpar access multipl bioinformat inform sourc sixth intern confer intellig system molecular biologi woelk semant integr inform open dynam environ acm page ru resourc control mobil agent proc intern confer autonom agent acm press ru econom market mean open system proc workshop mobil agent context competit intern confer autonom agent acm press brian robert david georg daniela ru mobil agent distribut inform retriev matthia intellig inform agent lf workload load balanc strategi usenix summer page mae system distribut resourc alloc proc intern confer autonom agent marina del februari acm press jonathan dale david mobil agent architectur distribut inform manag intern workshop virtual march dougla ousterhout transpar process design altern implement softwar practic birmingham agent architectur michigan digit librari ieee softwar al al parallel virtual machin mit oren etzioni daniel weld interfac internet commun page trace adapt organiz polici ma work note uk workshop multiag st catherin decemb frank ocean open comput exchang arbitr network octob mobil inform agent web matthia klusch gerhard intern workshop cooper inform agent mobil electron commerc inform discoveri volum page juli springer arthur oliv inform integr acm ndumu mobil agent distribut parallel process proc intern confer autonom agent acm press glass objectspac voyag agent orb java proc worldwid comput applic intern page march springer nj wa sm ac dm ew pr visser knowledg fusion distribut knowledg base expert system applic ab exploit process lifetim distribut dynam acm transact comput hohl mobil agent repositori mobil agent system parallel algorithm feasibl studi proc workshop java network stanford palo acm press nick katia michael roadmap agent research develop autonom agent distribut object group manag architectur proc workshop java highperform network stanford palo acm press black mobil emerald system acm transact comput adapt placement parallel java agent scalabl comput cluster proc workshop java highperform network stanford palo februari acm press lang oshima program deploi java mobil agent aglet lang oshima good reason mobil agent commun march liang dynam class load java virtual machin proc confer object orient program system languag applic volum page acm press mae distribut agent network thing proc intern symposium agent system applic intern symposium mobil agent palm ieee distribut approach autom protein sequenc annot approach distribut comput proc intern confer autonom agent acm press scalabl issu global comput proc java grand san acm press global distribut comput internet project proc intern confer distribut comput system ieee nwana softwar overview knowledg engin nwana ndumu perspect softwar agent research knowledg engin pal load manag mobil agent proc euromicro page object manag group common object request architectur omicini zambonelli coordin mobil inform agent tucson journal internet kotz transport inform agent journal intellig inform thoma sandholm distribut ration make gerhard system mit build studi volunt comput system java futur gener comput sandip ghosh adapt choic inform sourc matthia intellig inform agent worm program earli experi distribut comput commun yoav shoham program hohl mole java base mobil agent system proc workshop mobil object system migrat parallel object framework java proc workshop java network stanford palo acm press tolksdorf coordin pattern mobil inform agent klusch proc int workshop cooper inform volum lectur note page berlin van parallel comput java proc java grand san acm press jim waldo mobil distribut agent ieee intellig distribut comput economi transact softwar februari gio wiederhold michael genesereth basi mediat technic wim xu mobil agent base infrastructur global parallel comput proc intern symposium agent system applic intern symposium mobil agent octob mj wooldridg nr jen agent architectur survei wooldridg nr intellig agent lnai xu wim mobil agent base push methodolog global parallel comput practic
ML/913 6 ur informatik der technischen universitat munchen viii autom reason featur extract learn vector quantiz data structur report christoph institut fur informatik tu munchen germani marco gori dipartimento di ingegneria dellinformazion universita di siena itali tu germani featur extract learn vector quantiz data structur christoph institut fur technisch universitat germani marco gori dipartimento di ingegneria universita di itali abstract fold architectur network close relat concept neural network develop solv learn task data structur paper address fundament problem find vector structur solut base idea featur extract fold architectur network method learn data structur combin idea learn vector quantiz fold architectur network suggest introduct field scientif technic peopl system assist deal structur object exampl chemic algebra express softwar sourc conceptu taxonom graph structur object object structur object consid size object domain limit object size domain contrast static kind data real handl statist pattern recognit neural network approach fold architectur network close relat concept neural network frasconi develop solv learn task classif data structur applic field autom logo recognit schmitt frasconi fa rn gener vector structur object section fa rn gener region vector space open reject exampl total encount learn achiev analysi case static data gori paper framework fa extend wai address problem find vector structur approach combin idea encod data structur fa method featur extract develop case static data note vector structur applic kind method densiti cluster field statist pattern recognit neural network euclidian distanc vector space defin distanc measur structur retriev similar structur respect reject structur total structur suggest algorithm learn data structur approach combin learn vector quantiz encod fa contrast standard learn fa region space close paper organ section introduc fa kind structur object interest section briefli review method featur extract princip compon analysi network static data natur extens case data structur solut combin featur extract encod network fa simpl label tree neuron encod network transform network rep rep neuron rep rep nil nil result nil nil nil encod network unfold transform network network unfold topolog figur process label tree tion suggest combin lvq fa fold architectur network structur object deal paper finit label order tree simpli call label tree label assum real vector fix uniform length node label attach label edg order concern children node assum limit number children tree determin logic term algebra express finit set symbol easili repres label tree maximum ariti symbol maximum introduc inject function map symbol real vector fa variant standard network gener recurr neural network learn approxim map label tree ir detail discuss fa fa appli encod network enc transform network tran sigmoid activ function consid enc comput compress fix length label tree tran input comput final output network figur show fa process label tree maximum enc tran network note case maximum enc tran simpl recurr network ree repres domain label tree process maximum max rep denot dimens compress network final enc tot max rep input neuron rep output neuron enc comput function enc ir rep ir assum label tree ir label ree order list children ffl denot vector concaten function enc ree ir comput compress defin enc ffl ffl ffl ffl nil network virtual unfold encod encod composit tree encod children nil ir fix indic absenc child figur show encod simpl label tree transform network tran rep input neuron output neuron comput function tran ir ir output encod network enc input tran total network comput function tran ffi enc ree ir shown fa tran max enc sigmoid dimens dimens dimens decod encod input layer output layer compress layer figur network activ approxim function label tree real vector space hammer simul fa enc tran sigmoid activ function fa train structur variant standard backpropag mean error output layer tran propag back entir unfold network exact gradient respect weight tran enc comput train complet result compress directli optim task hand current refin includ effici label tree train set minim direct acycl graph repres ident occur posit time complex gradient comput linear number node edg train minim speed gradient comput practic applic order magnitud achiev featur extract static data case static data high dimens reduc perform pattern recognit learn task main reason model data fewer adapt paramet properli constrain data set limit lead gener reduct achiev form linear nonlinear combin origin variabl variabl call featur process gener featur extract problem featur extract formal sampl unknown probabl distribut ir find encod map ir ir transform sampl inform origin good gener exampl probabl distribut requir vector call featur vector sampl mean denot sampl covari matrix encod typic criteria evalu qualiti featur reconstruct varianc scatter popul entropi measur normal normal set encod criteria find encod optim min max max normal reconstruct error assum decod map ir ir interest learn criteria class inform optim process optim map time disadvantag comparison criteria direct implement network network network train vector sampl scatter measur maxim squar sampl distanc direct implement complex varianc criterion simpl proof complex entropi measur complex criterion previou direct measur entropi sampl make assumpt densiti function assumpt normal distribut lead normal reason restrict oneself linear orthonorm encod map shown present criteria row optim encod matrix case eigenvector unit correspond largest eigenvalu diagon matrix eigenvalu element transform call pca proof situat gener linear encod map constant linear transform subspac data project minim mean find subspac project independ choic project vector encod normal made arbitrarili larg length project vector subspac varianc compon chosen project constrain featur vector finit interv sigmoid limit normal differ end arbitrari larg project vector featur vector ly border interv project vector constrain unit length orthogon maxim push project vector direct eigenvector largest eigenvalu maxim entropi measur mean maxim statist independ individu sacrif orthogon harm case normal summar analysi normal reason criteria linear encod map addit constraint unit length project vector orthogon gener encod map applic reason hand linear featur extract call network encod decod network shown figur data structur problem find vector label tree regard featur extract problem input space infinit encod map encod fa idea investig work network decod encod part network encod form encod fa decod simpli mirror imag train vector consist label compress children node node tree sampl set decod network unfold compress randomli initi begin train epoch input target lead move target converg problem rid move target problem unfold decod network encod fa decod face addit problem ident occur posit ident minim section appli gradient comput case encod section mention big disadvantag optim decod encod case featur extract label tree sever explain paragraph import criteria evalu qualiti featur discuss section conclud appli normal case featur extract label tree restrict oneself linear activ function encod formal addit constraint orthonorm long unfold encod network standard method linear pca appli callan unfold deal move target converg complet clear formal orthonorm constraint unfold encod gener approach encod fa sigmoid activ function entropi criterion due featur vector gener constrain finit interv assum normal distribut featur space case normal reason featur vector highest entropi mimic uniform distribut achiev spread label tree accomplish maxim criterion uniform min jf enc enc import differ uniform concentr optim process smallest sampl squar function concentr largest compar uniform normal size weight necessarili size normal due constrain featur space finit uniform necessarili naiv complex comput uniform set featur vector algorithm find closest pair featur vector log step preparata due uniform continu differenti criterion weight closest pair featur vector consid determin closest element sampl evalu ineffici kind train requir cost batch learn epoch kind onlin weight updat reason concentr smallest distanc pair featur vector distanc size motiv kind soft choic detail min fi fx fi ln fi xn made arbitrarili similar exact minimum steep paramet fi make nice model physic featur vector set particl ident charg minim energi system forc squar distanc particl optim process concentr closest featur energi enc enc case soft minimum energi criterion dont evalu pair featur vector restrict close pair identifi effici algorithm log learn vector quantiz data structur section present method find vector label tree kind method statist pattern recognit neural network appli applic lvq lvq learn approach classif work assum sampl vector ir class label set code vector ir determin classic vector quantiz method point densiti function code vector approxim unknown sampl densiti function sampl closest code vector determin partit disjoint subset consist sampl vector closest code vector class label highest frequenc subset attach respect code vector classif vector perform assign class closest code vector actual lvq perform fine tune kind classifi adapt code vector assum closest code vector train vector simplest form lvq updat rule class move bit direct move code vector updat updat loop sampl vector learn rate monoton time shown lvq border found classif vector depend find closest code maximum distanc defin vector distanc closest code vector exce maximum reject lvq defin close region lvq solv classif task label tree appli found featur extract section enc encod network weight simpli substitut enc extend approach updat code lvq train encod network time order label tree suit classif task updat rule case ident class label class enc enc enc enc enc push bit direct push suitabl learn rate differ paper present idea extend fa rn idea address fundament problem occur applic solv properli fa rn problem concern similar measur data structur euclidean distanc vector structur found provid similar measur determin data problem concern reject exampl total expect combin lvq fa suit provid classif reject plain fa present work preliminari result plan evalu applic document classif refer callan callan analyt techniqu fast reliabl deriv connectionist symbol structur connect frasconi logo recognit neural network page frasconi gener framework adapt process data structur ieee transact neural septemb fukunaga introduct statist pattern recognit san academ learn distribut backpropag structur intern confer neural network page ieee june connectionist approach learn heurist autom deduct system phd technic comput gori gori perceptron adequ pattern recognit ieee transact pattern analysi machin octob hammer hammer neural network approxim map structur object intern confer comput intellig page march kohonen map septemb induct learn symbol domain recurr neural network german annual confer artifici intellig springer verlag note comput scienc correspond neural fold architectur tree automata technic report dept neural inform comput preparata preparata comput introduct text monograph comput scienc schmitt schmitt relat chemic structur activ structur process neural fold architectur confer engin applic neural network june neural network classif structur ieee transact neural label connect
AI/914 2 pattern properti specif verif matthew kansa state depart comput inform scienc ks georg massachusett depart mathemat statist ma jame corbett depart inform comput scienc abstract model checker verif tool develop detect kind error automat transit technolog research practic slow number potenti reluct adopt formal primari unfamiliar specif strategi recent approach properti specif verif carri survei collect exampl properti specif found instanc pattern updat pattern system accommod pattern variat exist pattern encount survei paper report result survei current statu pattern system keyword formal concurr system introduct formal specif verif method offer advantag current wide adopt partli due lack definit evid support benefit formal number pragmat barrier adopt formal method identifi includ lack thing good tool good train work partial support nsf grant nasa grant cess support formal method recent avail tool support verif opportun overcom barrier verif refer set techniqu prove properti model comput system properti typic tempor logic regular system transit system kind tool support varieti verif techniqu techniqu base model check bisimul languag flow analysi inequ condit contrast mechan theorem requir guidanc verif techniqu fulli reliev user understand work verif process verif techniqu critic develop concurr behavior make test problemat user verif tool system requir specif languag tool challeng requir time elev call floor time open door elev arriv floor verifi properti linear tempor logic model develop translat inform requir formula difficult read difficult write correctli idiom specif languag contend acquir level repres substanti obstacl adopt autom verif techniqu provid effect draw larg experi base greatli reduc obstacl deal complex specif daunt softwar develop design complex address definit abstract complex specif abstract import captur experi base expert specifi enabl transfer experi specif pattern system system collect specif abstract maxim coverag varieti techniqu tune semant meet user adopt approach present specif abstract focu match problem characterist solut strategi pattern origin develop captur recur solut design code problem design code languag rich express formal provid solut full rang solut wider pattern success solv natur occur domain problem dont full express languag prefer guidanc languag featur solv commonli occur problem approach success domain properti specif verif number express specif knew fell small number categori believ collect simpl pattern defin assist map descript system behavior formal improv transit formal method practic evalu survei sourc properti specif locat collect exampl properti specif verif tool found vast major instanc pattern system subsequ updat pattern system accommod pattern variat exist pattern encount survei paper overview updat pattern system report result survei properti studi kind awar section describ specif pattern system verif section present result survei section compar approach relat work section conclud specif pattern system describ pattern system begin give background notion pattern describ idea appli domain properti specif verif describ set pattern organ give overview current state pattern system properti specif pattern design pattern introduc mean leverag experi expert system design pattern intend captur descript recur solut softwar design requir address mean requir exampl solut inform form understood identifi similar requir select pattern address instanti solut embodi pattern system model transit system finit number state set possibl label state properti specif pattern gener descript commonli occur requir permiss sequenc model system properti specif pattern describ essenti structur aspect system behavior express behavior rang common formal properti specif pattern figur variant pattern format pattern statement pattern intent structur behavior map common specif exampl relationship pattern specif formal quantifi regular express tempor comput tree logic capit letter stand event disjunct event formal stand state formula formal pattern extent program execut pattern hold intent describ relationship pair occurr occurr occurr enabl occurr enabl map map enabl occurr ctl global ef ef global quantifi regular express set denot express match symbol denot instanc express event global exampl properti occur commonli specif concurr system describ requir resourc grant request properti properti occur occurr follow restrict follow properti note properti correspond occurr occurr addit constraint ad constrain variat pattern map pattern describ properti occur simultan strictli relax constraint possibl empti variat pattern relationship gener properti multipl separ constitut call chain pattern figur pattern basic kind global entir program execut execut part execut design part execut continu scope determin start end pattern interv properti evalu close left open end scope consist state begin start state includ end state chose scope global state sequenc figur pattern scope easi encod specif commonli encount real properti specif studi defin scope explain construct variant map special part pattern system formal underli model event scope open end figur illustr portion execut design kind scope note scope interpret scope delimit present execut specif true scope oper present specif formal logic experi inform requir properti segment program execut pattern system properti mirror view enhanc usabl note specif formal semant express properti express easili formal imposs captur formal formal reason proposit hold scope regard dual absenc properti state proposit hold state scope easi requir event occur properti proposit hold scope express term occurr event indic proposit true absenc event indic bear simpl relat absenc pattern note formal express condit involv infinit limit finit sequenc state event expect properti express commonli pattern system point differ user system specif pattern develop system properti specif pattern verif tool pattern system set pattern organ connect relat pattern facilit user search pattern match requir map section obtain templat properti formal instanti templat plug state formula event specif requir defin specif attempt give small set independ concept larg class interest specif construct collect specif give smallest set gener specif complet list specif pattern system frequent properti specif small fraction properti logic regular express commonli occur practic simpl variant make pattern system expect set pattern grow time develop encount properti specif real system easili map exist pattern pattern space limit prohibit descript pattern full set full pattern addit explan relationship map formal list set short phrase state state formula event disjunct absenc occur scope exist occur scope bound exist occur time scope variant pattern occurr occurr elev properti section instanc pattern occur scope scope figur kei element pattern scope chain sequenc pn sequenc qm pattern gener pattern chain sequenc pn sequenc qm pattern gener pattern express bound fifo relationship organ organ pattern hierarchi base semant pattern requir occur occur absenc pattern constrain order organ pattern system hierarchi illustr figur hierarchi distinguish properti deal occurr order system execut addit pattern provid set pattern explain combin vari pattern pattern templat typic individu event state formula pattern substitut templat pattern note give user guidanc safe make substitut pattern note describ construct variant specif absent segment pattern origin pattern system provid map ad map addit graphic interv logic queri languag space show map figur survei properti specif idea pattern system properti specif verif assum specif peopl write fall small number gave empir evid import assumpt collect specif found fall small number familiar categori describ survei properti specif section data collect collect specif ffl verif paper literatur ffl specif contact research verif tool specif request exampl mail list newsgroup ffl student project offer author graduat verif collect specif sourc specif collect form express requir specif specif formal inform prose descript requir specif wide varieti applic hardwar commun control abstract data oper object complet descript specif found specif pattern web page citat publish paper examin specif manual determin match pattern scope properti formal version specif instanti templat map specif case classif trivial find trivial specif carefulli count match ffl specif formal instanti templat map formula map absenc ffl specif obtain pattern paramet substitut section templat map paramet logic properti pattern occurr absenc exist order chain chain bound exist figur pattern hierarchi boolean combin safe substitut tempor formula guidanc correct pattern note encount case requir realiz ctl formula pattern instanti paramet af ffl specif variant pattern note section map scope close left open specif collect mention section pattern note explain open left end scope close end variant mention pattern note includ chain pattern state event forbidden element chain ffl specif variant pattern discov interest variant pattern describ execut respond zs requir found instanc constrain variant instanc variant ad pattern note explain adjust map obtain variant ffl formal express specif correct specif instanc pattern specif collect formal express match prose formal express make intent specif intent match count match record inform requir prose descript requir pattern pattern determin requir instanc scope scope pattern paramet note paramet provid templat arrai nest tempor map map properti formal specif languag exampl collect map sourc sourc domain applic domain note addit inform sampl entri specif server request registr eventu regist global proposit replic model server gregori pp distribut object system note specif found world wide web result data summar tabl total figur graph total pattern scope match pattern group specif match pattern shown figur common pattern sampl common dual absenc pattern account sampl found instanc figur show pattern cover major sampl frequenc scope pattern tot absenc exist bound exist resp chain prec chain unknown total tabl total absenc unknown exist resp chain prec chain bound exist pattern global scope figur total number instanc pattern put drop quickli issu pattern pattern pattern match found system small easili ad pattern match real specif worth slight pattern system size figur exampl global scope note exist resp chain prec chain pattern bound exist unknown absenc global scope figur percentag specif pattern ple scope instanc exist pattern conceptu global map singl oper tempor logic mention specif collect research student connect specif written collabor differ significantli specif written separ data compar data set figur differ data note rank exist resp chain prec chain pattern bound exist unknown absenc global scope figur percentag specif pattern common pattern unknown rank remain pattern small number instanc pattern data set data noisi differ wrote specif vast major specif global scope wrote specif fall pattern system interest question pattern system affect kind specif peopl write verif check critic exact choic requir requir express term left analyst pattern system assist formul properti analyst complex pattern scope investig set specif affili written set divid specif written develop pattern system specif written comparison shown figur differ case pronounc sampl size complex pattern pattern system introduc specif creat develop pattern system scope specif evenli spread pattern note specif written pattern system match pattern demonstr pattern system properti specif verif potenti show specif fall small number categori show system requir answer difficult ffl pattern facilit learn specif ffl pattern specif written ffl specif gener pattern answer question definit answer requir experi human subject evid support larg author experi teach verif master level softwar engin curriculum relat work specif formal present term minim set oper order simplifi semant definit addit oper defin term primit formal defin user formal prefer write specif higher level formal provid oper abstract classic introduc lamport plai critic role formal uniti correspond global pattern system number formal design definit addit deriv oper properti safeti properti written tempor written term deriv oper author illustr capabl defin oper term basic oper deriv oper correspond exist scope absenc global pattern system support fix set specif abstract formal lack explicit support defin abstract interv logic provid user mechan defin segment system execut properti hold interv construct oper provid logic gener scope essenti commonli occur interv packag pattern recent work requir engin explor templat pattern construct requir van suggest librari refin construct detail requir control english project restrict subset natur languag formul offer annot templat guid user effort aim develop essenti complet requir pattern system concern translat aspect requir formal specif suitabl verif tool studi class specif develop write manna pnueli address issu theoret angl syntact classif formula complet describ space specif write taxonomi specif includ categori broader pattern pattern easili categor pattern global scope safeti exist pattern global scope pattern global scope properti exist pattern similar overtak properti safeti chain pattern complex scope map syntact categori difficult natur canon form defin contrast goal work give construct descript class specif occur frequent practic manna pnueli adopt pragmat approach line intent pattern system claim gener theori tempor logic requir handl correct properti concurr program defin restrict handl invari properti subsum absenc properti subsum properti subsum bound exist similar chain properti subsum scope version absenc pattern data present paper support manna pnueli intuit common found pattern constitut bulk properti survei definit abstract write formal specif import factor make autom formal specif verif usabl specif pattern system set commonli occur specif abstract formal support definit abstract directli updat pattern system develop properti specif verif collect larg sampl specif suggest properti specif peopl write instanc pattern system explor direct work specif pattern work defin pattern simplifi write class properti ctl write specif properti tricki express studi benefit defin languag properti specif base provid autom support compil properti express languag specif formal check legal pattern substitut studi approach check consist pattern map express multipl formal ctl ctl map lie fragment ctl formal justifi map survei paper expect applic verif technolog type specif develop chang time view pattern system dynam entiti grow process dialog critic review commun develop user verif techniqu contribut commun acknowledg laura make contribut pattern system peopl contribut directli van eh kg pb jm winter refer autom analysi concurr system constrain express toolset ieee transact softwar nov misra parallel program foundat addison weslei publish sistla automat verif concurr system tempor logic specif acm transact program languag apr steffen concurr semant base tool verif concurr system acm transact program languag jan corbett integ program verifi gener safeti live properti formal method system jan van formal refin pattern requir elabor fourth acm sigsoft symposium foundat softwar page san oct acm softwar engin graphic interv logic concurr system acm transact softwar engin apr corbett system specif pattern corbett properti specif pattern verif workshop formal method softwar page mar clark data flow analysi verifi properti concurr program softwar engin dec acm sigsoft symposium foundat softwar engin fuch control english intern workshop control languag vlissid design element reusabl softwar synchron program languag sept harel softwar analyt commun protocol technic lamport tempor logic action acm transact program languag manna pnueli tool rule practic verifi technic report stanford juli carnegi mellon comput year acm manna pnueli tempor logic reactiv concurr specif van analog requir framework intern confer requir mcmillan symbol model check kluwer academ sequenc constraint languag automat static analysi gener ieee transact softwar mar lamport prove live properti concurr system acm transact program languag juli rosenblum formal method panel acm sigsoft softwar engin juli
Agents/915 1 millennium technic report sussex technic report copyright artifici life autonom softwar agent home entertain stephen millennium interact mill dave cognit comput brighton millennium interact mill uk abstract paper technic descript commerci softwar packag creatur simul environ exist number synthet agent user interact agent intend intern architectur creatur inspir anim biologi creatur neural network coordin behavior model simpl energi metabol system interact neural network model modul neuron activ stage develop hebbian learn mechan neural network adapt lifetim creatur network architectur detail biochemistri creatur evolutionari adapt sexual reproduct macintosh platform late offer user opportun engag artifici life technolog addit describ technic paper conclud discuss scientif implic system introduct autonom softwar agent potenti applic entertain industri discuss interact entertain product base techniqu develop artifici life adapt behavior research brook mae cliff al call human user interact synthet agent inhabit close environ artifici neural network control artifici biochemistri energi metabol hormon regul network biochemistri possibl evolutionari adapt sexual reproduct commerci aspect creatur interest scienc engin commun paper discuss creatur develop millennium interact publish warner interact core artifici life techniqu develop millennium creatur refer web site aspect product relev autonom agent research north america europ late run macintosh platform section discuss relat work section present descript technic aspect section conclud specul comment scientif impact product relat work autonom agent entertain briefli summar work artifici life adapt behavior research relev creatur background discuss descript select research semin work reynold establish possibl autonom agent behavior techniqu movi sequenc show behavior synthet agent produc human anim give broad detail pose specif subsequ relat al faith kinemat simul fish model impress visual accuraci biolog plausibl behavior share reynold origin work relianc skill manual design agent physic behavior control requir invest skill labor face difficult task design lifelik synthet agent entertain research drawn inspir biologi blumberg develop behavior control mechan inspir find etholog scienc anim control synthet dog inhabit softwar interact human user virtual agent object environ research work develop techniqu reduc relianc skill labor incorpor type automat adapt learn mechan agent softwar reynold explor genet program techniqu relat genet algorithm develop control program synthet agent move world simplifi kinemat sim emploi similar artifici evolut techniqu develop physic morpholog artifici neural network control millennium technic report sussex technic report copyright synthet autonom agent inhabit world realist kinemat larg bodi work learn artifici neural network rumelhart mcclelland relev entertain product public scientif literatur describ commerci interact entertain softwar product citat section promot materi piec entertain softwar explicitli promot draw artifici life research user observ interact variabl terrain varieti speci plant anim ecosystem simul cellular automata make autonom agent techniqu recent product stronger link autonom agent research maxi present user design breed virtual fish observ swim virtual similar product work al manifest note maxi pioneer concept metaphor intend highlight style game plai score toi impli score aim achiev interact toi experi give user onscreen anim virtual pet base dog cat user interact virtual pet train perform simpl trick similar product blumberg work mention product announc time write fujitsu interact stronger link artifici involv kinemat realist model agent environ adapt control base proprietari entrop reduct technolog product involv render hybrid creatur user engag simpl interact special input devic combin proxim detector microphon detect amplitud pitch nearbi sound present involv artifici life emploi genet encod neural network architectur artifici biochemistri describ section develop commun artifici possibl creatur discuss section creatur creatur inhabit effect platform environ depth cue object rel front typic world measur approxim screen horizont screen window scroll smoothli follow select creatur world number object creatur interact varieti wai system written program virtual object world script attach determin interact includ creatur agent static part environ object elev button press object environ ad screenshot show view part world shown figur figur screenshot show view part creatur world user pointer environ pointer imag human hand user move object environ pick drop attract attent creatur wave hand front stroke gener reinforc gener reinforc typic creatur shown figur creatur minor morpholog detail color hair type genet grow size creatur approxim millennium technic report sussex technic report copyright life creatur genet creatur manag surviv ag gene kill creatur creatur simul touch model approxim techniqu simul vision involv simul optic process retin imag object line sight neuron repres presenc object visual field activ approxim sensori process fairli common neural network research sound attenu distanc object creatur object creatur ey point direct simpl figur creatur creatur learn simpl keyboard input plai interact creatur environ typic target ten creatur activ time degrad occur section describ detail neural genet creatur neural network creatur brain heterogen neural object call defin chemic morpholog characterist group cell cell lobe form connect cell sourc lobe perform function net network architectur design biolog comput construct initi model approxim group interconnect roughli paramet genet control vari lobe lobe figur sampl interconnect lobe structur structur neural architectur design compli effici comput world ten creatur requir process neuron synapt connect addit load displai rest capabl support plan brain neural configur control gener creatur capabl express neural plan recombin fair chanc construct system equal higher util parent neuron neuron singl lobe share characterist vari wide rang behavior aspect neuron dynam simpl defin express factor control genet construct lobe paramet neuron tabl neuron paramet type input cell possess class input feed signal sourc lobe state intern comput genet defin express threshold output state relax rate exponenti recoveri rate current state rest state rest state natur state input gain modul input state express comput state input signal neuron intern state comput genet defin function interpret control aspect synapt behavior express design interpret extrem mutat syntax millennium technic report sussex technic report copyright error comput state valu wai tabl function present provid order power futur evolutionari improv system tabl exampl state sum input ad previou state state minu input excitatori inhibitori state sum input input fire previou state state time state current input modul neuron state function appli exponenti return defin state import relax function act damp neuron state faster harder disturb tension input relax system provid integr input state neuron reflect intens frequenc stimuli neuron fed signal cell carri class characterist sourc integr type data main paramet tabl paramet modul input signal weight act rest state statist reinforc relax rate rate relax back relax rate rate rise suscept current suscept reinforc suscept relax rate suscept paramet strength control migrat reinforc express comput suscept express comput sensit reinforc strength gain express comput strength strength loss express comput signal arriv modul weight provid output rise trigger reinforc activ relax exponenti slower react strongli individu reinforc effect comput move averag creatur meet situat find chosen action immedi strongli repeat incent present situat bad experi creatur interpret sweep migrat initi wire defin birth small number genet rule neuron attempt connect lobe direct spatial multipl fan distribut side optimum sourc cell figur individu migrat form connect sourc strength chang comput chemic strength fall disconnect rule find connect migrat rule chosen order fulfil requir initi brain model hope gener scheme time extra migrat involv competit cell repres input implement part model gener problem left disconnect brain model architectur gener engin circuitri defin genet section describ specif model system implement gener creatur rest level relax threshold figur state relax millennium technic report sussex technic report copyright concept lobe percept lobe lobe verb misc drive sourc attent noun arrang lobe figur brain model attent neural circuit devot minor task lobe implement mechan stimuli arriv object environ cell fire input lobe cell repres class signal map output sum intens frequenc stimuli time simul inhibit cell compet control creatur attent creatur gaze sensori fix recipi action creatur mechan limit creatur verb mode serv reduc sensori neural process accept net object time make bulk remain neuron connect make combin group sensori input larg region concept event memori laid small massiv lobe call relationship memori store action model base reinforc drive reduct cell concept space simpl comput output analog signal percept lobe sensori system fire input fire cell randomli wire seek pattern occur cell commit remain connect strength fall biochem feedback loop attempt maintain pool uncommit neuron leav repeatedli cell connect long period percept lobe sensori total number cell requir repres sensori permut input larg migrat mechan design round problem record portion input space turn relev number problem work layer repres singl object neuron highli feed concept space job form relationship concept cell record synapt weight action sensori circumst decid current synapt sensit modul reinforc conduct signal cell cell fire connect repres condit current decai exponenti time sensit repres relationship current sensori schemata latest action remain sensit period order respond share defer reward punish connect action concept capabl migrat search sourc signal biochem feedback loop control repeat reinforc strength cell sum input current state fact sum type input subtract sum type relax rate cell cell accumul number short base number concept cell intens cell winner creatur invok action script gener concept space seek repres permut input exist total sensori situat obtain system capabl gener learn relationship situat sensori situat deem relat share individu sensori situat evok memori relat situat repres learn experi relat situat offer advic react situat find green thing stare iv rememb thing stare ey kiss good hit big green doesnt work ill situat turn qualiti experienc millennium technic report sussex technic report copyright total learn reinforc long fire strongli long reinforc suppli proport cell creatur gradual learn discrimin acquir memori form gener futur learn learn provid layer weight exist reward chemic excitatori punish chemic inhibitori chemic gener directli stimuli chemic reaction involv drive level creatur maintain set chemic repres drive avoid drive reduc higher concentr press drive stimuli product drive drive chemic react level drive creatur activ respond reduc hot cold drive reduc produc punish reward chemic drive punish drive reward drive reduct weight excitatori drive reinforc inhibitori reduc drive balanc punish reward action object return net punish net creatur intern state time creatur learn eat hungri full brain model ambiti sever limit rang cognit function primit reinforc mechan serv provid learn logic creatur doesnt suffer side gener mechan reduc arbitrari face dynam albeit damp close produc satisfactorili complex believ sequenc surprisingli free limit cycl attractor biochemistri central function neural net simul biochemistri control widespread inform intern feedback loop extern system mechan simul function basic metabol simpl immun system biochemistri straightforward base class chemic arbitrari number rang repres chemic number repres current concentr chemic inher reaction undergo defin restrict base chemic physic characterist molecul emitt chemic produc genet defin attach arbitrari byte valu system neuron brain output sensori system locu attach defin descriptor start emitt repres code chemic emit gain characterist emitt byte emitt attach automat emitt adjust code chang awar emitt exist reaction chemic undergo transform defin reaction reaction form determin ratio transform normal reaction product exponenti decai breakdown reaction defin immut chemic law reaction product reaction exponenti time receptor chemic concentr monitor attach set arbitrari byte defin locu emitt receptor gene chemic receptor respond threshold nomin output part brain bodi receptor chemic biochem structur attach receptor emitt loci brain lobe widespread feedback path combin reaction path implement control synapt provid learn reinforc interact control wait natur discov control vital neural biochemistri implement system millennium technic report sussex technic report copyright compulsori digit expect gener public simpl metabol system simul base energi select biochem reaction produc effect plant emit synthet inhabit environ carri invok product simplifi immun popul mutat potenti ad genet creatur structur function determin gene genom provid inherit user expect creatur show characterist identifi drawn parent troubl ensur genom capabl evolutionari includ introduct structur brought duplic mutat gene genom string divid isol gene mean mark gene type characterist length byte interpret specif byte genom gene safe mutat fear crash system genom form chromosom parent gene cross splice gene boundari crossov error introduc gene omiss duplic small number random mutat gene bodi appli prevent excess failur rate due reproduct error critic gene header specifi oper duplic perform perform gene linkag proport separ link characterist expect facial genom prevent characterist simpli inherit creatur opposit sex gene carri genet instruct appropri sex gene express phenotyp gene header determin time genom gene express cater creatur gene simpli code outward speak red human vast major code function emul fact real gene code produc turn produc characterist stai true principl genotyp phenotyp separ order abstract gene creatur genom code structur reaction brain outward phenomena strength discuss difficult provid project essenti scienc object creat biolog behavior suffici satisfi expect gener public sale figur time product launch subject achiev behavior creatur dynam vari learn exampl appar emerg behavior cooper plai scene result difficult establish genuin confer observ tendenc anthropomorph dynam behavior agent environ configur usabl genotyp requir approxim interact paramet point belief complex synthesi achiev aim justifi creatur commerci product home user interact artifici autonom agent behavior control neural network interact biochem system creatur coordin percept action extend period maintain suffici intern energi surviv matur point capabl sexual plausibl argu instanc artifici exhibit suffici condit instanc life formul list condit number philosoph claim creatur aliv note philosoph debat possibl requir strong artifici mind user creatur engag artifici life technolog complet manner millennium technic report sussex technic report copyright creatur product mention section assum user run creatur month reason sale ten creatur exist provid machin global creatur user commun user commun creat similar advoc trai ongo work major global artifici life research experi monitor evolut featur group local scale nation global comparison reveal diverg evolutionari path creatur learn human studi spread emerg move machin machin electron teach behavior languag variant creatur user consid part intern scienc experi fun acknowledg millennium interact involv permiss publish work refer websit blumberg select lesson al pp mae brook mae artifici life iv mit press al meyer sw wilson anim animat intern confer simul adapt behavior mit press websit html de goldberg algorithm machin addison weslei koza program comput mean natur mit press mae life meet lifelik autonom commun acm websit websit report network unpublish document ml creat unpublish document reynold herd distribut behavior comput graphic reynold corridor noisi al mcclelland de rumelhart jl mcclelland distribut volum mit press sim morpholog behavior mae al al artifici fish autonom behavior physic world mae
Agents/916 1 note theoret comput scienc pp abstract formal respect andrea omicini enrico denti università di bologna vial itali languag prove effect build individu agent enabl commun system logic tupl centr shown languag effect exploit rule commun build social behaviour formal defin notion logic tupl centr oper semant languag respect behaviour specif logic tupl centr exploit formal framework asynchron system coordin media repres separ independ respect coordin entiti show approach effect exploit coordin heterogen agent sort technolog coordin media system system rapidli fundament paradigm engin complex softwar system internet era agent agent environ basic abstract system tomorrow built broadli interact relev featur complex system system built put interact achiev global system goal issu govern agent interact relev agent partial knowledg surround limit capabl affect perceiv understand evolut typic depend interact agent environ fulfil goal internet agent unpredict publish elsevi scienc omicini denti agent environ make agent interact complex issu internet agent typic deal incomplet inform unpredict heterogen sourc format model technolog emerg focu interact independ dimens model engin hardwar softwar system research coordin model languag provid comput scientist engin languag tool shape manag space agent interact coordin model conceptu framework model interact space system coordin model suppli mechan abstract requir rule interact agent agent societi built coordin social rule express coordin law role coordin medium work natur locu law rule agent interact kei make coordin medium adequ support model engin complex softwar concern role languag plai context broadli languag shown effect context system languag individu agent develop comput interag commun commun relev approach usefulli exploit build individu agent enabl commun rule commun build global behaviour shown coordin medium logic tupl centr effect exploit coordin internet agent logic tupl centr promot logic tupl make defin behaviour coordin medium commun event term logic specif intellig agent inspect modifi behaviour multiag system reason act specif tupl remaind paper introduc formal defin notion logic tupl syntax oper semant languag respect specif behaviour logic tupl centr exploit gener formal framework asynchron system introduc make formal describ behaviour coordin medium separ independ respect behaviour coordin entiti show coordin medium bound agent coordin languag omicini denti promot heterogen system enabl agent sort technolog combin coordin exploit approach coordin logic tupl centr languag successfulli exploit context coordin model share prolog esp linda interactor notion logic tupl space typic adopt enabl commun form agent coordin broadli linda successor extens promot form interact coordin basic express term access consum inform agent base avail repres term tupl tupl access associ match process map tupl tupl templat logic tupl centr logic tupl centr logic tupl perceiv agent logic tupl logic tupl centr logic logic tupl atom logic tupl work admiss tupl unif tupl match mechan logic tupl logic tupl centr access standard tupl space put logic tupl tupl queri primit suppli tupl templat pre expect unifi tupl back tupl centr post inp delet unifi tupl tupl leav wait suit tupl inp fail tupl found make tupl centr differ tupl space notion behaviour defin tupl centr react commun event behaviour specif tupl centr express term reaction specif associ commun event possibl occur tupl centr set comput activ call reaction reaction principl access modifi current tupl centr state ad remov access inform relat trigger commun event perform oper tupl commun event trigger multipl reaction execut local tupl centr commun event tupl centr behav omicini denti standard tupl execut trigger reaction serv commun event tupl centr main empti behaviour specif bring trigger reaction independ commun behaviour tupl centr default tupl space behaviour specif result invoc commun primit sum effect primit reaction perceiv altogeth transit tupl centr state reaction execut observ behaviour tupl centr commun event perceiv agent transit tupl centr case tupl space unlik standard tupl state transit limit insert remov singl perceiv transit tupl centr state made complex make decoupl agent view tupl centr standard tupl actual state tupl relat emb coordin law govern system tupl centr principl coordin rule explicitli defin coordin medium conceptu belong respect tupl centr logic tupl centr tupl centr commun tupl reaction specif languag respect languag languag specif behaviour tupl centr behaviour specif respect enabl definit comput tupl call make associ reaction commun event occur tupl centr respect declar procedur part specif commun event declar reaction mean specif logic call specif form commun event specif tupl associ reaction θ ev θ reaction respect enabl reaction procedur defin term sequenc logic reaction fail reaction succe reaction goal fail reaction execut sequenti transact fail reaction effect state logic tupl omicini denti tabl main respect predic reaction goal tupl space access modif succe insert tupl tupl centr tupl unifi templat tt found tupl unifi tt fail tupl unifi templat tt found tupl unifi tt remov tupl fail tupl unifi templat tt found tupl fail commun event inform current unifi tupl involv current commun event current unifi identifi agent trigger current commun event current op unifi descriptor oper produc current commun event current unifi identifi tupl centr perform comput pre succe pre phase oper post succe post phase oper success succe pre phase post phase success oper failur succe post phase fail oper tre main respect predic reaction goal report tabl inform descript semant reaction trigger commun event execut serv agent perceiv result serv commun event execut reaction altogeth singl transit tupl centr state effect commun primit logic tupl centr made complex coordin requir system gener respect shown comput coordin law principl encapsul respect tupl centr respect tupl centr conceptu structur tupl ordinari commun specif omicini denti specif tupl distinct suggest level abstract space agent commun coordin viewpoint repres time current state agent state space tupl make commun viewpoint space specif tupl coordin behaviour specif tupl centr govern specif tupl defin agent coordin rule space respect tupl centr collect logic theori commun agent principl access tupl space specif space uniform adopt time commun coordin viewpoint system belong approach respect enabl principl agent reason system statu behaviour commun coordin theori empow agent abil chang coordin law act specif space exampl coordin rule found subsect report simpl order intuit respect work show respect classic dine philosoph philosoph agent share spaghetti bowl philosoph share adjac acquir atom avoid atom ensur fair tupl repres singli pair adjac choic natur easili lead deadlock philosoph enabl atom choic solv deadlock introduc problem ensur coher domain longer ensur deadlock avoid choic requir philosoph lock semaphor tupl tupl space call global agreement cope typic open system enforc law mean ensur philosoph adher requir lock omicini denti tabl respect code dine philosoph philosoph agent semaphor tupl natur choic repres pair applic domain suggest repres singli philosoph eat acquir pair mean singl eat mean singl oper result oper atom remov insert tupl tupl transpar perform agent adopt respect tupl achiev requir coordin law tupl centr term respect agent directli handl coordin respect code tabl make tupl centr behav mediat tupl space philosoph reaction tabl remov tupl subsequ insert tupl viewpoint make emiss tupl philosoph result presenc tupl space mediat requir reaction ensur dual behaviour obtain philosoph requir pair mean handl case mean tupl formal notat syntax omicini denti respect adopt typic syntact convent logic languag denot set variabl set function symbol set predic symbol π τ set term built σ γ set ground term built set atom built appli predic symbol π term τ logic tupl tupl templat atom formula denot tupl languag tupl templat space ordinari tupl respect tupl centr atom formula definit tupl match predic respect tupl centr trivial base tupl tupl templat variabl θ tupl match templat iff unifi specif respect defin form specif tupl popul specif space respect behaviour specif σ specif tupl defin grammar tabl reaction respect defin set respect admiss reaction accomplish definit symbol tabl set admiss commun set admiss reaction oper includ oper access consum tupl tabl tabl set admiss tupl centr oper respect tupl centr agent denot ground respect agent set admiss identifi coordin agent set γ ground term respect logic tupl space denot ground respect coordin set admiss identifi coordin media coincid set γ ground term semant framework defin coordin medium suitabl oper term interact transit state commun system transit trigger interact transit gener output event order formal denot behaviour coordin medium omicini denti tabl core syntax respect inp current tupl current agent current op current tc pre post success failur respect tupl defin notion admiss commun defin behaviour term transit system definit commun admiss commun event respect tupl centr denot set admiss commun event respect tupl centr γ denot trigger γ target tupl event event tupl direct denot commun event trigger agent target tupl denot event tupl centr success failur answer success fail inp defin te notion admiss reaction event definit reaction admiss reaction event respect tupl centr omicini denti er denot set admiss reaction er set admiss tupl centr event respect tupl centr section logic tupl centr basic logic tupl space enrich behaviour specif associ tupl centr event reaction respect behaviour specif σ associ event reaction trigger trigger reaction execut tupl centr semant respect term reaction specif function reaction evalu function repres twofold role respect specif languag reaction execut defin respect associ event encapsul respect conceptu machineri reaction execut reaction specif function put tupl centr event reaction relat behaviour specif tupl centr definit specif admiss tupl centr event event defin θ respect behaviour specif σ admiss tupl centr event reaction specif function defin denot union behaviour specif σ admiss tupl centr event repres reaction trigger σ definit behaviour tupl centr default behaviour tupl space σ impli definit tupl centr reaction evalu function encapsul effect reaction execut logic tupl centr behaviour specif σ logic tupl space trigger reaction return pair omicini denti tabl semant respect reaction goal θ θ θ θ θ θ repres state logic tupl space newli trigger reaction definit execut sequenc reaction logic trigger admiss tupl centr σ respect behaviour specif reaction execut state defin tripl reaction execut step transit rule tabl reaction execut sequenc sequenc reaction execut omicini denti denot final state reaction execut sequenc initi state state sequenc applic rule exist respect behaviour specif admiss tupl centr event logic reaction execut function defin step reaction execut repres reaction goal current state space ordinari set reaction trigger reaction goal event initi trigger reaction execut execut trigger reaction respect tupl centr tupl space behaviour specif σ repres sequenc initi state definit account transact semant respect sequenc oper execut reaction trigger event execut tupl set reaction set provid updat tupl centr state tupl set reaction occur tupl centr state transit occur rule tabl symbol retain usual mean final state sequenc reach reaction goal applic rule step delet goal number reaction goal finit reaction execut finit number step worth note matter rule tabl formal defin semant respect reaction match inform definit tabl tupl centr behaviour state logic tupl space express pair logic tupl tupl pend queri wait serv regard tupl state tupl centr trigger reaction form pair record reaction trigger event behaviour specif σ wait execut state respect tupl centr express tripl σ logic tupl space ordinari tupl omicini denti pend request tupl accept tupl centr wait serv trigger reaction wait execut σ respect behaviour specif determin evolut tupl centr state tupl centr state σ denot ws multiset pend queri satisfi tupl match predic ws defin nt nt ws denot wp pend queri predic queri semant wp defin nt nt wp oper behaviour tupl centr model term transit system kind admiss listen commun event input speak return answer agent output react handl reaction execut task satisfi queri pend predic queri wait answer trigger reaction execut tupl centr wait commun event sa tupl centr listen commun event reach tupl listen transit depend event wp ws σ wp ws σ σ σ symbol retain usual mean repres reaction trigger event behaviour specif σ trigger reaction satisfi pend queri predic queri pend satisfi queri wp speak transit σ nt σ σ ws σ omicini denti nt σ σ rule result output event back trigger agent answer queri record pend queri nt listen transit rule correspond successfulli serv repres answer fail predic queri trigger reaction react transit σ σ result execut reaction reaction evalu function definit note tupl centr receiv extern event listen transit serv pend queri speak transit execut trigger reaction admiss react transit reaction trigger commun event tupl centr behaviour specif execut tupl centr handl request agent agent perceiv result commun event effect trigger reaction altogeth singl transit tupl centr state make exploit respect program tupl centr make exhibit observ express coordin rule term reaction specif coordin medium relat work prolog commun languag origin approach fipa exampl explicitli prolog content languag agent commun languag fipa kqml effect problem agent margin address issu agent coordin central issu respect regard exploit logic languag coordin system notion logic tupl centr enhanc notion logic tupl space abil express law coordin system term emb coordin media notion logic tupl centr defin paper exploit omicini denti model coordin luce tucson respect tupl centr made show languag successfulli exploit coordin agent engin social behaviour heterogen system formal defin notion logic tupl centr oper semant languag respect specif behaviour logic tupl centr semant framework adopt coordin medium formal denot separ independ respect coordin entiti exploit notion admiss commun fulli defin semant respect tupl centr hypothesi natur behaviour coordin agent adopt coordin medium limit agent coordin languag agent sort technolog combin coordin logic tupl shown instanc agent interact cooper multipl respect tupl centr distribut system encapsul semant behaviour specif languag function definit notion tupl centr independ behaviour specif languag chosen reactiv tupl space defin mar coordin model mobil agent interpret tupl languag reaction model reaction execut semant mar tupl centr principl defin analog respect defin specif notion tupl templat javaspac entri suitabl match function conjunct mar explor chanc defin heterogen coordin model base notion tupl combin languag commun coordin explor depth relationship dual issu coordin secur notion logic tupl centr emb basic mechan agent access topolog abstract model distribut exploit approach refer concurr share acm transact program languag system pp omicini denti leonardi programm coordin architectur mobil ieee internet comput pp distribut program logic tupl gener comput pp coordin model languag softwar acm comput survei pp languag lnc intern confer april omicini coordin technolog internet nordic journal comput pp omicini multiag system coordin jen intellig agent vi agent lnai pp intern workshop orlando juli languag lnc intern confer april softwar lnc intern workshop limerick june paper omicini system extend scope coordin secur garijo boman pp omicini rule agent motion structur william high perform comput lnc pp intern confer europ amsterdam express power languag program coordin sac pp architectur coordin multiag softwar practic experi pp omicini luce coordin technolog ma design develop porto roman pp mckai kqml agent commun intern confer inform knowledg manag pp omicini denti foundat intellig physic fipa home page url jini technolog system lnai european workshop model autonom agent world valencia june juli le languag lnc intern confer septemb berlin gener commun acm transact program languag system pp semant coordin sac pp societi infrastructur analysi design ciancarini wooldridg pp denti agent coordin control logic gori topic artifici lnai pp congress italian associ artifici intellig octob coordin model languag appli artifici intellig pp special coordin model languag ai tolksdorf societi agent lnai intern workshop berlin august paper coordin internet applic autonom agent system pp special coordin mechan web agent klusch internet pp languag lnc intern confer septemb acm symposium appli comput februari march atlanta track coordin languag applic omicini denti acm symposium appli comput februari march san antonio track coordin languag applic acm symposium appli comput march como track coordin languag applic acm symposium appli comput march la vega track coordin languag applic url dahl de logic program infrastructur remot mobil code ieee workshop enabl infrastructur collabor pp
AI/917 2 theori robot aaai aaai robot contest tc son depart comput scienc texa el paso el usa abstract paper describ control aspect mobil robot particip aaai robot competit event aaai robot consist score total point robot won place event home vacuum contest main goal paper show agent theori base action theori develop al build introduct particip aaai robot navig contest aaai home vacuum contest team score point run contest total point final won place event paper relat theori develop higher level al low level design contest process present descript control architectur robot show level close theori focu main relat made respect aaai competit show architectur extend modifi task discuss weak present goal pursu aaai robot navig contest robot requir achiev navig task offic topolog map gave point program initi room robot perfect assist richard environ robot requir start director find confer room find confer room empti empti inform director meet inform professor director meet director final return director offic robot requir hit chang avail statu confer robot requir back director offic topolog map offic environ partit landmark figur figur diagram show topolog map event particip aaai robot competit theori agent descript theori agent detail earlier work theori concern control agent dynam exogen event control agent occur agent action theori theori languag action effect constraint causal rule environ focu main point simplifi real requir bit theori formul correct control modul respect action goal achiev mainten set plausibl initi theori occurr exogen event formul correct base comput set plausibl call base set initi control modul theori exogen event occur state unfold control modul assum exogen event occur test result plan condit plan state incomplet control modul achiev goal note exogen event care step consid step develop suffici condit correct prove correct class control importantli suffici give algorithm automat construct control set initi theori exogen action approach control agent action theori agent action verifi correct control rule provid control design automat construct control modul correct respect set plausibl combin happen offlin plan subset carefulli construct set plausibl state base action agent exogen event highli set state refer agent equip control modul environ agent continu react base control modul rare case agent state account control rule prescrib case agent reach account state set account state larger set state satisfi easier make plan reach control modul agent note reaction tradit hybrid architectur paper lower level modul reactiv higher level modul delib agent reactiv level set plausibl state delib encount rare state account compil approach differ formal correct complex plan exogen control modul collect control rule form pn fluent obtain action action control modul reactiv work strengthen result ffl section plan anticip situat domain prescrib action initi prescrib action optim formul prescrib action optim ffl drummond scr local execut choic lead goal local execut choic lead goal achiev deflect critic plan control rule respect set highli plausibl set state prohibit larg unmanag explicit condit knowledg consid research situat control rule plan consid languag exogen plan reactiv dynam domain chang happen agent action previou paragraph talk agent control continu execut control modul action hand side control rule control modul implement control case mobil robot offic environ hierarchi control modul theori higher level control high uncertainti lower level action mobil robot lower execut action straight intersect corridor detect lowest control mention earlier paragraph rule formal multivalu logic gear handl uncertainti formul blend control modul extrem provid smooth motion blend action corridor avoid obstacl design robot section describ environ describ level robot control relat role agent theori level put describ architectur robot repres environ partit topolog map region label landmark base criteria landmark recogn robot case agent internet environ case formul applic level memori past landmark robot achiev requir task recov failur base decid design area constant corridor width navig domain landmark robot move landmark corridor width figur landmark break junction design landmark type junction landmark detect detect navig hallwai design landmark type corridor entranc room design landmark type door oe oe oe oe oe figur area mark landmark store adjac inform landmark approxim distanc adjac landmark tabl discuss section modul correct modul control modul kind previou section reactiv structur gear gracefulli recov breakdown model exogen action control conf director director back director halt control modul part list determin function denot fluent unknown reiter previou work control rule plan construct logic truth fluent rang account fluent truth unknown special action action modul earlier work control modul plan reason action plan commun reactiv framework organ contest scientif advanc creat contest problem note control modul view plan mean plan event modul suffici robot recov stuck restart input posit head robot keyboard restart construct control modul manual agent theori previou section verifi correct control modul note goal control modul simpli express collect fluent classic formula requir plan system express formula tempor knowledg oper goal tempor oper consid agent commun plan commun recent studi incorpor tempor knowledg oper goal formal preliminari attempt give declar goal extens languag metric interv tempor extens specif knowledg mean oper atom specif ka mean mean confer room mean professor inform meet confer room mean mean eventu mean robot director offic obstacl agent theori verifi correct goal formula tempor knowledg check unfold control modul respect satisfi goal due tempor oper goal trajectori state import final state automat construct algorithm construct control modul goal futur goal find algorithm automat gener control modul complex goal knowledg tempor oper modul room room automat construct top level control modul special director action implement sonar check substanti movement reactiv structur action abstract landmark topolog map implement control modul describ control refer navig control modul navig control modul basic tabl current node goal adjac node entri tabl meant robot node ultim goal reach node adjac node action modul action robot node adjac node control modul automat gener approxim distanc adjac node cost action robot node action robot node adjac node implement control modul describ control modul control modul adjac node correct action control modul turn chang head robot navig robot kind node adjac node turn action list column tabl navig action list sixth column tabl type type node node action corridor junction detect break junction corridor detect corridor forward junction door door door junction door tabl action rule gener navig action current head action east west turn east south turn east north turn left west east turn west south turn left west north turn north west turn left north east turn north south turn south east turn left south west turn south north turn tabl action rule gener turn action flavor effect navig turn action formal term interchang detect corridor turn mean node type corridor mean node adjac node node robot head dir give simpl map node give tabl adjac head inform map row tabl read node type node type node approxim distanc node node robot head west oe figur sampl map type type head dst corridor junction west junction corridor west corridor wall break west wall break corridor north tabl show adjac record domain depict figur back control modul robot node adjac node condit part control rule control modul check robot head tabl robot execut turn action tabl head robot execut navig action tabl tabl compil descript action describ action inform initi state goal tabl gener manual correct verifi theori paper automat construct algorithm basic action skill refer action previou control modul action column tabl basic action resembl reactiv skill rap architectur implement merg skill implement control modul base logic lowest uncertainti physic world make harder implement low level task control modul kind fluent paper found control modul kind al notion correct control exogen action futur goal extend approach logic concept control blend skill basic action basic action forward mean translat forward speed time avoid avoid crash basic action forward involv blend skill necessarili respect assum skill avoid control control face avoid search destin tabl list basic action skill robot intuit function tabl list weight skill implement action detect corridor action effect forward forward distanc detect corridor forward corridor width detect door forward distanc enter room detect break follow corridor width chang corridor width detect turn left turn left turn turn turn turn speak transmit inform detect occupi action detect room occupi align correct hardwar uncertainti tabl basic action behavior fi function weight translat forward forward point open find open robot follow corridor follow virtual corridor hallwai width avoid close sonar avoid close sonar sensor read avoid close infrar avoid close infra red sensor read stop touch stop bump avoid crash stop danger crash obstacl point forward robot turn back tabl skill robot weight detect corridor concept normal skill defin basic action formal set basic action set fi translat fi rotat fi basic action normal behavior fi fi associ weight control modul defin correct presenc exogen develop method automat construct control modul comput translat rotat ta fi ra fi figur diagram show sonar emiss avoid obstacl illustr normal robot perform action detect corridor situat depict figur current veloc head index correspond robot head directli action detect corridor skill list tabl current sensor read behavior individu translat rotat translat forward fi fi point open fi fi follow corridor fi fi avoid close sonar fi fi avoid close infrar fi fi stop touch fi fi avoid crash fi fi point forward fi fi translat rotat robot detect corridor detect corridor action detect robot slow turn unit correspond avoid encount obstacl architectur figur depict architectur atlant architectur tire architectur rap architectur relat architectur modul previou section show correspond figur block correspond top level modul action modul refer task architectur task director execut task involv navig control modul robot node correspond shortest path gener block architectur control modul robot node adjac node correspond action plan gener block architectur plan block architectur ae oe ae oe ae oe oe topolog map shortest path action plan gen reactiv skill actuat sensor plan action sequenc plan reactiv subplan figur depict architectur aaai robot competit correspond combin navig control modul control modul robot node adjac node sequenc task task list plan determin sequenc basic action execut reactiv block architectur correspond basic action skill modul correspond idea process theoret hierarchi control modul control architectur suggest merg level control modul implement point view fact maintain merg level control modul aaai competit show architectur easili modifi extend complet task main advantag worth note modif competit week work action gener plan start descript contest home vacuum domain consist corridor live famili bedroom robot travel corridor enter room event robot start station human period enter leav room leav robot job room clean robot enter room human present human enter room robot minut human present room minut live room occupi minut robot clean mess hallwai human present robot unknown reason week competit start order complet task addit ffl detect ffl navig insid room task add action set action action detect mess action close wall action robot navig insid room planner plan sequenc requir top level control modul event time halt start start start easi verifi control modul ensur robot continu travel clean mess stop minut limit action start reset fluent control valu robot initi true fluent unknown present architectur robot successfulli robot competit success due simpl correct top level control modul main disadvantag capabl recogn environ sensor camera work unknown environ add featur main goal futur hope complet challeng task requir navig simpl capabl goal implement algorithm automat gener top level control modul manual acknowledg research partial support grant nsf career nasa nsf refer arkin integr world knowledg reactiv navig design autonom page mit formal narr nest circumscript aaai page bacchu plan tempor extend goal aaai page slack experi architectur reactiv agent intellig agent page baral son relat theori action reactiv robot control proc aaai workshop reason plan robot bridg baral son regular special robot control relat action theori proc aaai workshop theori plan baral son relat theori action reactiv control technic cs texa el paso drummond situat control rule kr page jame firbi architectur synthet vacuum cleaner proc aaai fall symposium seri workshop instanti jame firbi robot navig proc aaai fall symposium seri workshop control physic world intellig jame firbi modular issu reactiv plan aip page gat integr plan react heterogen asynchron architectur control mobil robot aaai page gelfond lifschitz repres action chang logic program journal logic golden weld repres middl ground revisit kr page lifschitz action indirect preliminari report kr page aaai mobil robot competit exhibit ai page levesqu plan presenc aaai page scherl logic approach high level robot program progress report work note aaai fall symposium control physic world intellig system novemb editor design autonom agent rang applic logic strict inertia journal logic octob plan reactiv robot unpredict environ ijcai page singh multiag system theoret framework commun multivalu logic approach integr plan control artifici scherl levesqu frame problem knowledg produc action aaai page
AI/918 2 ecient atom cluster optim hybrid extend compact genet algorithm seed popul illig report illinoi genet algorithm laboratori depart gener engin illinoi transport build mathew il ecient atom cluster optim hybrid extend compact genet algorithm seed popul sastri illinoi genet algorithm laboratori depart gener engin transport mathew av illinoi il abstract recent studi highli reliabl cluster optim algorithm emploi extend compact genet algorithm simplex search studi util ecienc enhanc techniqu base cluster optim reduc popul size number function evalu retain high reliabl predict lowest energi structur seed initi popul lowest energi structur smaller cluster emploi ecienc enhanc techniqu empir result popul size total number function evalu scale cluster size reduc introduct kei challeng genet evolutionari comput research design compet genet algorithm compet ga solv hard progress made line essenc compet ga design problem intract rst gener ga render tractabl problem predict lowest energi structur atom cluster central forc interact problem harder interact includ addit term term angular variat studi estim number local minima rapidli exp number atom cluster sastri cluster optim algorithm util extend compact genet algorithm simplex method report popul size number function evalu scale larg scale task comput larg number function evalu daunt place premium varieti ecienc enhanc techniqu paper ecienc enhanc techniqu call seed emploi solv cluster optim problem seed initi popul gener base individu smaller present case smaller lowest energi cluster object current studi util seed extend compact genet algorithm compet ga task cluster optim evalu ectiv predict global optim structur silicon cluster test case lowest energi structur cluster atom successfulli predict paper structur literatur review ga base cluster optim present section descript note silicon potenti current studi section cluster optim algorithm section result discuss section literatur review interest emploi ga solv cluster optim problem shown ga outperform tradit mont carlo base simul anneal method report ga superior simul anneal predict geometri ar ga success predict optim structur atom simul anneal fail case studi author geometr crossov creat individu simpl ga predict structur si si potenti alexand hybrid combin binari code ga conjug gradient local search report signi improv perform compar ga local search method modi ed hybrid ga encod real valu binari simplex conjug gradient techniqu predict cluster structur si sastri extend compact genet algorithm simplex search empir determin scale popul size number function evalu size cluster algorithm predict lowest energi structur cluster atom high reliabl popul size number function evalu scale high hoar emploi seed procedur seed procedur complic extend compact genet algorithm harik base kei idea choic good probabl distribut linkag learn measur good distribut quanti ed base minimum descript model kei concept mdl model thing simpler distribut complex mdl restrict penal inaccur complex lead optim probabl distribut mdl restrict reformul problem nding good distribut optim problem minim probabl model popul probabl distribut class probabl model margin product model form product margin distribut partit gene similar cga unlik model cga repres probabl distribut gene time facilit direct linkag map partit separ tightli link gene current studi gene partit refer bb concept illustr bit problem chose partit partit impli bit jointli distribut st bit independ distribut probabl distribut partit simpli frequenc individu bit valu similarli proport individu st similarli probabl distribut partit procedur gure thing cluster converg perform simplex search evalu potenti energi cluster end initi cluster seed perform tournament select build mdl creat cluster replac cluster figur procedur identi cation mdl creation popul base identi cation gener formul constrain optim minim cm subject bb cm model complex repres cost complex model cm log bb compress popul complex repres cost simpl model complex evalu bb ij log ij bb equat repres number length bb bb ij number chromosom current popul possess bb constraint due nite popul size popul gener base optim popul size crossov lled individu current popul note bb length sequenc rst sequenc denot sequenc di er origin procedur individu individu current gener irrespect tness rest individu gener randomli subset current individu subset gene group identi ed current procedur di erent origin procedur subset chosen probabilist poll origin procedur lead stochast method current studi determinist method frequenc bit sequenc subset remain constant observ outcom method similar fact determinist method faster silicon potenti research empir potenti figur angular part term sw gong potenti reproduc phy weber potenti calcul potenti energi silicon cluster potenti sw potenti includ term potenti satisfactorili predict bulk phase accur predict structur properti term sw potenti perfect angl ab molecular dynam calcul larg peak smaller peak gong base sw correct term incorpor angl prefer angl gong potenti form tot br ij ij exp ij jr ij ji ki kj ij ik jk ji ki exp ij ki jr ij jr ki tot potenti energi ij angl ji ki vertex empir paramet determin tting data ab calcul term angular part gong potenti incorpor prefer bond angl comparison term sw gong potenti di erent angl shown gure gong report structur properti predict potenti close obtain ab studi signi cantli predict potenti compar optim structur predict sw potenti gong potenti si cluster current studi gong potenti term calcul total potenti energi cluster algorithm descript object cluster optim problem minim total potenti tot determin lowest energi structur cluster repres xed cartesian coordin intern coordin emploi earlier cluster optim xed coordin requir intern coordin requir variabl xed coordin compact intern coordin cluster atom nite optim structur xed coordin studi shown xed intern coordin term algorithm ecienc present studi atom repres cartesian coordin coordin repres bit binari string atom cluster fulli repres bit string initi popul gener seed procedur present studi seed posit atom atom cluster set equal posit optim structur atom cluster lowest energi structur atom cluster creat initi gener atom cluster posit remain atom gener coordin sampl uniformli seed procedur simpler earlier studi gener structur relax local search present case simplex method simplex algorithm adopt simplex requir initi point variabl problem initi point individu popul gener ad uniform random variabl variabl solv atom variabl initi cluster simplex method individu account initi rest gener ad uniform random variabl individu unlik ran simplex algorithm till toler run till toler reach wai incorpor solut obtain local assign tness local search individu chang structur assign tness structur individu rule thumb state approach appli time rest present case preliminari studi fulli approach superior approach current studi approach relax structur subject tournament select replac number individu randomli select current gener individu minimum potenti energi transfer procedur repeat till mate pool individu present studi tournament size model built select individu individu creat base section gure proport worst individu current popul replac individu converg criteria varianc tness popul varianc bit valu popul whichev occur rst minimum popul converg time number function evalu evalu converg run global optimum reliabl algorithm set criteria stringent exist literatur requir run reach global minima result report present studi averag independ run result discuss potenti energi unit optim structur di erent size obtain seed simpl ga seed compar gure minimum potenti energi predict seed literatur cluster size studi predict optim structur silicon cluster atom emploi gong potenti gure ga predict structur qualiti seed sga seed figur potenti energi lowest energi structur predict sga seed di erent cluster size potenti energi unit ev averag minimum popul size requir di erent cluster size seed compar seed sga seed gure minimum popul size requir converg time global minimum scale sga seed gure seed outperform sga seed seed fact popul size cluster atom atom similar case explan solv atom rst solv atom cluster atom cluster solv minimum popul sga figur comparison minimum popul size requir sga seed reach global optima di erent cluster size low reliabl reduc popul size requir atom cluster creat initi popul atom cluster averag number gener seed sga seed di erent cluster size shown gure result show seed converg faster seed show converg time seed constant cluster size sga seed faster seed reason sga maintain due drift good bb mix reduc genet drift preserv longer averag number function evalu seed sga seed di erent size cluster compar gure number function evalu scale size cluster case seed scale case sga seed hand seed outperform outperform sga seed seed perform algorithm scale worst case scale number function evalu determin shown gure worst case determin squar sum averag number function evalu standard deviat number function evalu similarli case determin squar averag number function evalu minu standard deviat number function evalu seed sga seed figur comparison converg time reach global optima sga seed di erent cluster size function evalu sga figur comparison number function evalu requir reach global optima di erent cluster size function evalu averag worst figur worst averag case scale number function evalu seed worst case con denc interv ecient hybrid cluster optim algorithm util extend compact genet algorithm simplex algorithm ecienc enhanc techniqu algorithm successfulli predict optim structur silicon cluster size empir result popul size number function evalu requir predict lowest energi structur reliabl number atom cluster case seed popul function evalu scale improv case seed scale techniqu simpl ga seed popul size number function evalu scale acknowledg due prof goldberg discuss valuabl suggest part studi conduct part atom scale simul taught prof prof comment martin ravi sinha input studi work sponsor air forc oc scienti air forc materiel grant research fund work provid nation scienc foundat grant support provid grant armi research laboratori feder laboratori cooper agreement govern author reproduc distribut reprint govern notwithstand copyright notat thereon view author interpret necessarili repres polici express air forc oc scienti nation scienc govern refer increment method integr genet search base function optim competit learn report carnegi mellon molecular geometri optim genet algorithm phy rev evolutionari design comput sweet lesson genet algorithm autom design innov pp san morgan kaufmann studi structur properti small silicon cluster phy rev global geometri optim cluster modi ed genet algorithm linkag learn probabilist model report illinoi compact genet algorithm ieee confer evolutionari comput ieee servic center global geometri optim cluster genet algorithm phy global geometri cluster growth strategi optim genet algorithm phy structur dynam simpl adv global geometri optim silicon cluster xed genet algorithm genet algorithm chemistri rev comput extend compact genet algorithm report illinoi global geometri optim atom cluster modi ed genet algorithm xed coordin structur bind numer recip cambridg press cluster optim extend compact genet algorithm report illinoi comput simul local order phase silicon phy rev empir approach structur energi system phy rev comput complex determin atom cluster phy studi lowest energi structur atom cluster genet algorithm comput phy applic genet algorithm calcul bound state local densiti approxim
AI/919 2 hamburg zur mathematik order suffici condit optim control problem free final approach helmut maurer han joachim preprint septemb hamburg zur mathematik preprint bericht mathematisch model und simul und scientif comput comput fluid dynam data analysi order suffici condit optim control problem free final approach helmut maurer han joachim septemb abstract order suffici condit control problem constraint free final time present deriv de control problem free final time augment control problem fix final time exist express condit posit definit variat conveni numer tool verifi condit base approach find bound solut equat satisfi specif boundari condit augment equat augment control problem deriv modif boundari constraint discuss numer classic orbit transfer minim problem electr demonstr equat approach viabl numer test kei word optim free final order suffici orbit problem subject classif support deutsch forschungsgemeinschaft grant ma institut fur universitat fachbereich introduct introduct find extens literatur order suffici optim condit optim control problem control state cf ref literatur cite paper shown fundament import stabil sensit analysi parametr optim control cf ref express term posit quadrat form critic cone obtain linear equal inequ constraint condit abstract lend numer verif practic test basi ref main idea underli approach book ho unconstrain control problem test requir construct bound solut equat satisfi addit boundari condit inher difficulti fact coeffici equat depend accur solut control variabl cite paper deal control problem fix time interv extens result problem free final time time interv discuss ref method ref chapter heurist argument suffer drawback control problem tractabl approach function ff defin ref ident quantiti defin rigor proof ref found extens result control problem mix constraint case cover condit remedi defici ref unconstrain control problem condit test numer challeng situat gener approach time interv develop author offer practic devic test condit numer aim present paper develop verifi scc control problem free final time mix constraint approach straightforward idea ref reduc free final time case fix final time case treat free final time augment state variabl procedur lead augment set equat boundari condit unconstrain control deriv ref organ paper section recal control problem fix final ref section describ effect time transform augment variabl function problem straightforward calcul show equat augment problem split separ part salient featur approach suffic solv reduc form equat boundari constraint control problem ix time boundari condit equat work case practic interest deriv addit sign condit solut initi final time turn crucial numer test section appli numer methodolog practic challeng exampl highli accur numer solut exampl obtain multipl shoot cf ref classic problem planar orbit transfer minim cf ref treat section augment equat test succe confirm optim numer solut section present modif problem solv ref fix time interv control constraint free final time problem local minima local maximum augment test capabl prove optim local minima problem subject control constraint studi deriv reduc equat boundari constraint comput bound solut satisfi extra boundari condit mention applic extens basi straightforward perform comput sensit analysi exampl numer techniqu ref sensit differenti optim solut respect paramet obtain solut addit linear boundari problem extens concern optim control problem pure state constraint techniqu paper appli control problem fix final time autonom control problem subject mix state final time determin control function state function minim function subject ae ae assum function open set final time assum exist feasibl pair function satisfi constraint control problem ix time order condit optim pair cf ref unconstrain hamiltonian function resp augment hamiltonian defin denot variabl multipli constraint asterisk denot partial deriv denot subscript make hypothesi order condit satisfi normal form cost multipli assum exist drop lower subscript condit hold ae ae min uu const notat denot argument function refer solut introduc regular assumpt fi set constraint fi fi kg denot compon vector fi obtain set activ indic fi kg regular assumpt concern linear independ gradient activ cf ref fi gradient uniformli linear independ fi ae margin ffi defin set indic ffi fi fi fi control problem ix time denot compon obviou ffi ae hold ffi strict complementar condit valid indic ffi conveni introduc notat ffi ffi assum modifi strict cf ref satisfi denot euclidean exist estim uu hold satisfi ffi order suffici condit deriv studi behavior variat variat system equat abbrevi similar notat variat system equat set function satisfi ae ffi ae introduc function ae defin tt obviou notat variat quadrat form xx xu ux uu dt theorem summar weak local minimum found ref theorem control problem fix final admiss problem exist multipli condit control problem ix time condit assumpt exist ffi quadrat form estim variat satisfi variat system continu fi ffi assumpt condit constant exist ff jjx jj jj hold admiss jjx jj jj ff strict weak local minimum problem previou theorem suitabl direct numer practic control problem mention discret version control problem optim techniqu develop check posit condit comput reduc cf ref order obtain verifi suffici condit control problem function theorem strengthen symmetr matrix function variat satisfi linear state equat ad ident variat perform partial integr find definit condit theorem hold condit satisfi condit exist symmetr matrix xx xu ux uu hold uniformli vector ffi control problem ix time condit boundari condit tt valid satisfi consequ definit condit hold matrix posit definit space condit satisfi lead requir strict condit uu valid interv evalu complement matrix continu depend od system estim exist solut equat xx xu uu xu bound satisfi boundari condit cf ref theorem applic condit strong equat fail bound cf problem ref weaker condit obtain introduc modifi reduc equat recal ffi definit vector ffi ffi ffi ffi matrix ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi conveni omit time argument defin cf ref ffi ffi ffi ffi ffi ffi ffi ffi ffi xx xx xu ffi ffi ux ffi uu ffi ffi xu xu ffi uu ffi uu ffi ffi uu ffi ffi control problem free time note matrix ffi uu defin virtu assumpt estim hold matrix equat ffi ffi ffi xx ffi xu qf ffi uu ffi xu qf bound solut satisfi boundari condit gener tediou elabor equat explicitli facilit numer treatment practic applic discuss special case detail interior arc ffi equat reduc introduc boundari arc ffi control compon activ constraint due assumpt ffi ffi project ffi vanish matric ffi ffi ffi ffi ffi ffi ffi uu ffi xx xx xu ffi ffi ffi ffi uu ffi ffi ux equat reduc linear od ffi ffi ffi xx special case pure control constraint lead simpl linear od xx problem ref provid illustr applic approach evalu boundari condit special case practic interest boundari condit separ compon initi final state fix ae ae denot complement index set ng ng easi boundari condit satisfi posit virtu continu depend solut od system definit condit relax suffic requir posit relax conveni numer appli exampl section control problem free time control problem free final time control problem section final time condit problem free final time cf ref extend section hamiltonian defin assum exist multipli normal satisfi equat condit free final time condit obtain transform problem free final time problem fix final time transform proce augment state dimens introduc free final time addit state variabl transform develop free final time case basi theorem fix final time defin time variabl notat state control variabl respect time variabl augment state satisfi differenti equat dx result time transform augment control problem fix time interv minim function subject ae ae function control problem free time transform problem fix time interv fall categori control problem treat section obtain transform problem evalu theorem augment state variabl relat multipli problem problem time interv hamiltonian problem denot augment variabl multipli constraint introduc scale multipli hamiltonian relat hamiltonian equat multipli problem satisfi condit ae ae uu const relat immedi yield prove condit check condit assumpt observ scale uu uu order appli theorem problem evalu term relat tild quantiti defin recal scale multipli obtain transform quantiti control problem free time xx xu xu uu uu observ relat make ident denot unconstrain hamiltonian lead problem free final time theorem control problem free final admiss problem exist multipli condit condit assumpt hold respect time interv exist ffi quadrat form express term transform function estim variat satisfi variat system time interv continu fi ffi assumpt condit constant exist ff jjx jj jt jj hold admiss jjx jj jt jj ff strict weak local minimum problem appar condit handi practic applic resort equat boundari condit develop augment symmetr scalar insert transform quantiti equat matrix control problem free time obtain equat linear equat direct integr interv argument omit xx xu qf uu xu qf tf xu qf uu tf dq tf uu tf equat evalu interv equat interv note hold total interior arc draw attent fact equat ident equat ref section ref formula ref modifi equat work time interv similar transform quantiti procedur cumbersom restrict discuss special case ffi consid comput matric ffi ffi ffi ffi xx xx xu ffi ffi ffi ffi uu ffi ffi ux tild quantiti recogn equat split ffi ffi ffi xx ffi ffi ffi dq formula simplifi constraint pure control constraint ffi equat yield xx dq equat provid conveni test appli problem section tediou write boundari condit gener case discuss import case initi final state planar transfer minim flight time hold prescrib posit definit condit evalu augment matrix reduc boundari condit constitut extra condit free final time case turn crucial numer exampl discuss section note relax initi virtu continu depend od solut initi data planar transfer minim flight time rocket flight squar law field studi extens ref classic orbit transfer minim time state variabl distanc vehicl radial compon horizont compon mass vehicl control variabl angl thrust vector respect local horizon thrust maxim fi max final time minim variabl scale dynam model treat ref optim control problem minim final time dt subject equat motion fi max sin fi max max boundari condit initi final state planar transfer minim flight time constant fi max underli physic data vehicl initi thrust exit boundari problem control constraint hamiltonian fi max sin fi max fi max evalu order optim condit omit conveni subscript refer optim solut optim control deriv condit sin equat normal time interv wv dw dm fi max condit yield fi max transform state equat normal time interv obtain boundari problem consist equat simplifi elimin variabl variabl substitut fi max planar transfer minim flight time variabl drop enter equat reduc od respect variabl fix time interv trivial equat view boundari condit boundari condit respect hamiltonian boundari condit solut variabl obtain integr equat fi max elimin condit radial veloc tangent veloc control figur state variabl control variabl code ref initi final valu variabl final figur displai state variabl control variabl figur show variabl planar transfer minim flight time figur variabl order suffici condit check strict condit assumpt account scale obtain fi max find min verifi strict condit prove theorem remain show equat possess bound solut sign condit hold transfer minim flight time figur solut equat reader remind elimin state variabl remain state variabl fix final valu symmetr matrix form control current oscil refrain write equat explicitli evalu tediou simplifi symbol comput offer packag note coeffici equat function nomin trajectori find initi valu sign condit heurist optim techniqu start initi estim integr chang iter compon order minim chang indic compon cyclic initi solut equat found exist interv final assumpt theorem verifi draw trajectori weak local minimum problem compon function shown figur control current oscil problem treat ref fix final time control problem sensit analysi model discuss ref investig slightli modifi problem free final time figur displai electr circuit denot electr current diod state variabl electr current time control suitabl transform voltag gener addit paramet problem free final time defin minim function dt dt control current oscil ir figur subject solut problem final time found ref denot optim control problem fix final time behavior function insight behavior optim solut free final time unconstrain optim solut unconstrain problem control constraint delet appli time transform unconstrain hamiltonian omit lower index denot optim solut control comput equat yield transform state equat equat lead od dx dx control current oscil comput optim solut control problem fix final time resolv boundari condit solvabl final time suitabl final time optim function shown figur valu observ graph figur depict local minima local maximum respect final time clear minimum discern free final time condit boundari condit yield boundari condit figur graph solv case code ref case find solut solut solut control current oscil figur optim state variabl obviou solut correspond local minima local maximum shown figur note sign pass solut solut show solut local minimum respect optim state variabl displai figur condit trivial hold view uu verifi equat bound solut boundari condit hold relax form matrix control current oscil evalu equat dq dq dq dr dr dq suffic find bound solut equat satisfi trial success initi valu final valu bound jj theorem assert solut weak local minimum mention suffici condit ref check numer solut similar test optim solut obtain bound solut equat initi valu final valu valu yield bound jj situat solut local maximum respect final time initi valu test produc solut equat test exclud optim strong indic draw solut behav saddl point solut local minimum respect control fix time local maximum respect final time case situat complic figur distinct local minimum code control current oscil solut solut solv equat final time find initi produc final test case sign condit verifi test detect solut local minimum constrain optim solut solut satisfi addit control constraint augment view scale multipli state equat control law interior arc unconstrain control depict figur suggest constrain control boundari arc boundari arc assum solut structur optim junction point implicitli determin condit control continu point lead junction condit interv solv state equat control substitut boundari junction condit control current oscil figur graph control constraint case optim function constrain problem depict figur valu distinct minimum detect case case code optim state variabl shown figur order check suffici condit theorem find bound solut equat interior arc modifi equat boundari arc modifi equat yield linear dq dq dq dr dr dq find solut satisfi termin valu bound solut equat obtain initi valu control current oscil figur optim state variabl produc desir termin valu valu bound jj interest note obtain bound solut equat interv test develop section weaker form facilit numer check control current oscil figur solut equat case code yield solut evalu equat specif find bound solut satisfi sign condit fact confirm impress gain figur local minimum refer identifi indebt ch beckmann prepar numer exampl refer bryson appli optim publish corpor ch solv optim control problem control state sensit analysi direct discret method practic optim control comp appl die zur von und der report order necess suffici theori free final time ieee confer pp poor stabil converg nonlinear appli math pp order optim condit set function rang siam control pp suffici condit gradient project method optim control siam control pp order suffici condit structur nonlinear program function mathemat program data lectur note pure appli marcel pp von dept technisch universitat refer smooth properti approxim optim control annal oper research calculu variat optim control john suffici condit minimum optim control optim theori pp jacobson differenti dynam american elsevi publish compani gradient theori optim flight ar pp method optim academ pp kenneth mc problem advanc control vol pp df optim trajectori space academ approach stabil sensit analysi optim optim control advanc math scienc pp stabil sensit solut nonlinear optim control appli math pp suffici optim condit optim control problem subject state siam control pp sensit analysi parametr control problem comput optim pp order suffici condit control problem free final european control pp maurer order suffici condit sensit analysi control parametr optim relat topic peter lang pp maurer solut differenti parametr nonlinear control problem optim theori pp refer maurer order suffici condit optim control problem mix optim theori pp calculu variat optim translat mathemat vol american mathemat trajectori optim part comput method optim academ pp theori princeton program numer solut optim control institut flight system intern report exist multipl solut fuel orbit transfer optim theori pp quadrat condit extrem optim control theoret russian mathemat pp condit broken confer variat optim reich chapman boca pp comput feedback control constrain optim control part neighbour optim control applic pp comput feedback control constrain optim control part correct method base multipl optim control applic pp suffici condit weak local minima optim control problem mix fur analysi und pp extens differenti dynam program method includ system state depend control constraint state variabl inequ appli scienc engin pp equat optim control problem mix control necess siam control pp dai septemb
ML/920 6 submit acm autonom agent synthet agent system bayesian model human interact barbara oliv alex pentland vision model media laboratori ma usa abstract build statist machin learn model real data frequent encount difficulti limit amount train data compar specif learn architectur order deal problem develop synthet agent train system develop flexibl prior model recogn human interact pedestrian visual surveil task demonstr abil prior model accur classifi real human behavior interact addit tune train introduct solut develop applic agent system steadili number agent appli domain comput game interact inform retriev user interfac electron industri process control paper agent prior model sourc train data system model human specif synthet agent mimic human interact model recogn goal system accur interpret behavior interact pedestrian scene ing approach model interact statist learn techniqu teach system recogn normal behavior common interact graphic model hidden markov model coupl hidden markov model model classifi human behavior offer dynam time train clear bayesian semant individu interact coupl gener process major problem statist model rare limit number exampl behavior train model compar specif learn architectur critic problem gener model captur prior knowledg human behavior order deal problem creat synthet agent train system develop flexibl prior model recogn human interact pedestrian visual surveil task select prior controversi open issu bayesian demonstr abil prior model accur classifi real human addit tune train major emphasi effici bayesian integr prior knowledg synthet prior evid data paramet approach straightforward flexibl techniqu design requir strong analyt assumpt made form prior experi found combin synthet prior limit real data easili achiev high accuraci recognit interact system robust case exampl behavior exampl visual surveil system overview visual surveil system emploi static camera wide watch dynam outdoor scene extens activ camera straightforward plan comput note prior form markov model vision system segment move object learn scene scene descript method variat learn accur discount move object descript track temporari multiobject meet kalman filter track object color veloc tempor order stream data obtain behavior descript detect interact object figur depict process loop main function unit ultim system extend descript comput vision system direct reader comput vision input modul detect track move object move object output featur vector describ motion spatial relationship nearbi move object featur vector constitut input stochast behavior model hmm vari structur depend complex classifi perceiv behavior visual evid pedestrian detect track focu attent model expect expect imag track interact detect recognit detect foveat input model percept select attent predict predict attent model expect vector featur visual input learn figur process loop synthet behavior agent develop framework creat synthet agent mimic human behavior virtual environ agent assign behavior interact gener interact behavior kind individu behavior paramet virtual environ model basi real pedestrian scene obtain measur typic pedestrian movement agent architectur dynam system consist number agent perform specif behavior set behavior system start time move discret forward time agent disappear scene agent follow path direct walk random speed random instanc time slow speed stop chang direct independ agent scene precondit satisfi specif interact agent place agent perfect knowledg includ posit agent loss system gener prior model synthet data agent interact agent make depend type locat locat agent scene script behavior priori knowledg kind place agent behavior determin perceiv contextu rel posit path direct repertoir behavior trigger event agent decid follow proce path speed progress reach walk path agent adapt mutual speed order continu advanc exit scene attent focu attent interest simul human interact visual surveil system continu observ monitor attent mechan record situat eventu lead interact specif event signal system interest happen chang direct agent place agent nearbi radiu attent simul start dump agent featur vector figur illustr mechan path window agent attent figur attent window synthet agent environ agent orient veloc data featur vector construct consist deriv rel distanc ff align magnitud veloc note featur vector invari absolut posit direct agent environ agent behavior agent behavior system structur hierarch primit simpl behavior agent perform walk chang chang start walk higher level complex interact behavior simul human interact specif tempor success simpl behavior event signal chang current simpl behavior agent perceptu system detect event react agent close agent fall attent radiu agent agent agent reach agent occupi roughli posit agent start agent talk amount chat timer expir agent start move signal agent timer agent timer stop dont stai stop forev agent timer start expir moment agent start move experi report consid interact behavior illustr figur reach walk agent happen path walk direct agent decid reach speed order reach agent slow walk speed meet separ agent path opposit direct close realiz slow final stop chat talk independ meet agent behav talk decid continu agent direct follow chang direct order meet continu agent start path close decid interact agent wait reach direct order wait agent chat time decid chang direct order meet separ interact decid separ independ note figur portion agent trajectori featur vector fell attent window simul depict assum interact occur radiu agent record trajectori proper design interact behavior requir agent knowledg posit synchron success individu behavior activ agent figur illustr timelin synchron simpl behavior event constitut interact interact happen moment time provid interact satisfi speed walk durat start end action vari highli high varianc quantit aspect interact confer robust learn model tend captur invari part interact invari reflect natur interact environ behavior hmm section describ framework build appli model individu behavior interact order build effect comput model human behavior address question knowledg map comput dynam deliv consist interpret statist direct acycl graph probabilist infer network provid effici solut rel distanc deriv rel distanc veloc magnitud align agent trajectori featur vector rel distanc deriv rel distanc veloc magnitud align agent trajectori featur vector rel distanc deriv rel distanc veloc magnitud align agent trajectori featur vector figur trajectori featur vector rel distanc deriv rel distanc veloc magnitud align agent trajectori featur vector rel distanc deriv rel distanc veloc magnitud align agent trajectori featur vector rel distanc deriv rel distanc veloc magnitud align agent trajectori interact featur vector interact figur trajectori featur vector chang chang direct interact behavior chang speed speed time walk walk reach agent direct path agent close speed walk walk event follow start walk start walk walk walk stop chat chat agent close leav agent expir timer path opposit direct reach agent chat approach separ approach speed walk walk time event direct start walk chang direct walk chat chat stop walk expir timer opposit direct path speed reach agent chat agent close approach approach speed walk walk time event agent close approach walk walk chat chat path leav agent expir timer agent approach path reach agent chat chang separ walk stop wait walk time event walk walk start walk chat approach chang direct reach agent chat timer expir path speed agent close path agent approach chat time walk stop wait stop chang direct event walk figur timelin complex behavior term event simpl behavior figur typic imag pedestrian plaza question hmm view simpl case tempor pin dag paper human behavior examin gener pedestrian walk open outdoor environ goal develop composit analysi observ behavior term state transit state time manner state correspond common notion human immedi applic wide rang site view situat figur show typic imag pedestrian scenario hidden markov model popular probabilist framework model process structur time clear bayesian effici algorithm state paramet automat perform dynam time warp hmm essenti quantiz system configur space small number discret probabl transit state singl finit discret variabl index current state system inform histori process futur infer reflect current state variabl graphic hmm depict time figur interest system multipl interact merit composit variabl typic case system structur time space singl state markov model problem order model interact complex architectur direct reader extend descript observ state state observ figur graphic hmm time technic perform compar analysi hmm model human interact extens basic markov model gener memori system provid composit state time interest system composit state simultan state variabl exact solut extens basic hmm chain intract case approxim techniqu exist exact solut case interact case coupl hidden markov model model interact case correspond individu human architectur state chain coupl matric condit probabl model causal influenc hidden state variabl graphic shown figur graph state time depend state time chain influenc chain causal link result section describ experi perform analyz real pedestrian data synthet model train data site data collect preprocess person detect track system obtain blob featur person hour video exampl type meet behavior detect process featur vector comput vision process modul centroid person kalman filter state instant consist repres filter compon gaussian fit blob color space vision system hz sgi comput filter data cutoff filter comput pair nearbi person featur vector consist deriv rel distanc jv norm veloc vector ff align trajectori person typic trajectori featur vector meet continu separ behavior shown figur type behavior displai figur synthet agent note similar featur vector case figur trajectori featur vector interact meet continu separ behavior human behavior model evalu result model meet continu meet split follow interact versu interact detect test perform hmm perform omit report result order evalu synthet agent environ train type behavior model learn synthet agent environ directli appli real data addit train tune paramet posterior behavior model train start point synthet model exampl interact data specif site recognit accuraci summar tabl noteworthi train recognit accuraci real data result demonstr abil accomplish extrem rapid refin behavior model initi prior model final roc curv posterior displai figur interest result experi high accuraci obtain test priori model obtain synthet agent simul fact priori model transfer real data demonstr robust approach show synthet agent train develop model type behavior avoid problem limit amount train data appli model real human behavior addit paramet tune train agent paramet sensit order evalu sensit classif accuraci variat model train set model chang paramet agent dynam factor perform alter model turn virtual case sensit peopl rel rate movement test real pedestrian data prior posterior accuraci real data roc curv real pedestrian data figur left accuraci priori model test real pedestrian data entri row interact remain entri classif accuraci interact behavior interact reach walk meet meet continu roc curv real pedestrian data summari paper evalu agent prior model sourc train data system model human specif synthet agent mimic human interact model recogn main element bayesian perceptu synthet agent comput vision system mathemat model framework recogn human behavior interact visual surveil task system combin inform close feedback compon emploi statist bayesian approach statist learn hmm model behavior interact found superior hmm term train effici classif accuraci synthet agent train system creat order develop flexibl interpret prior behavior demonstr abil priori model accur classifi real behavior addit tune train fact special limit amount train data acknowledg sincer michael toni jebara matthew brand insight comment refer wl guid literatur learn probabilist network ieee transact knowledg data lawrenc tutori hidden markov model select applic speech vol pp matthew alex hidden markov model complex action ieee matthew hidden markov model model interact submit neural novemb model recogn human novemb rk percept passiv pp bayesian comput vision system model human gran januari david tutori learn bayesian tech rep microsoft june lawrenc saul michael chain hidden markov gari david tk vol
ML/921 6 rule discoveri parallel genet algorithm la av de pr brazil av de pr brazil alex freita pr brazil abstract import issu data mine scalabl respect size dataset mine paper address issu present parallel ga rule discoveri algorithm exploit data distribut data mine control distribut popul individu processor introduct import issu data mine knowledg discoveri algorithm scale respect size mine parallel process regard natur solut problem scalabl data mine genet algorithm tend comparison rule induct design parallel ga data mine import research area radcliff al al al paper present parallel ga rule discoveri data mine paper focu parallel aspect report result speed parallel version algorithm sequenti version result qualiti discov rule scope detail al data mine task address paper depend model task regard gener classif task al depend similarli aim discov rule predict goal valu predictor attribut classif singl goal attribut depend model goal attribut approach depend user specifi small set potenti goal interest predict rest paper organ section present overview parallel ga section present overview section discuss exploit parallel reduc process time section report comput result section conclud paper overview parallel genet algorithm broad sourc parallel genet algorithm exploit parallel applic genet oper mutat comput fit popul individu context mine larg import reason genet oper simpl applic cheap bottleneck algorithm comput individu process time proport size data mine high level basic approach exploit parallel fit comput approach consist exploit parallel approach illustr figur approach set individu current popul distribut processor subset individu fit comput parallel processor flow control algorithm parallel approach comput fit individu singl processor handl data mine sequenti mode note comput fit individu requir access entir data mine order avoid high data traffic entir data mine replic processor make difficult scale approach larg subpopul fit individu comput processor subpopul fit individu comput processor exploit control parallel fit comput data subset processor singl individu data subset processor exploit data parallel figur approach exploit parallel fit comput genet algorithm control kind parallel exploit major parallel genet algorithm algorithm typic design solv combinatori optim situat context data applic intuit approach exploit parallel fit comput consist exploit parallel approach illustr figur approach data mine distribut comput fit individu handl data parallel approach approach fit comput import advantag context data scalabl respect size data mine approach put simpli data lead larger data parallel exploit note data control parallel address kind larg problem data parallel address problem larg control parallel address problem larg search space desir exploit kind parallel genet algorithm data mine goal algorithm section overview section briefli describ main aspect algorithm individu repres singl predict rule form repres condit predict rule condit conjunct term term tripl form current version assum attribut categor continu attribut discret preprocess step part rule encod conjunct term length part rang number predictor attribut length part control genet term remov lesser crossov detail oper scope paper interest reader refer al predict tripl form goal attribut user notic rule goal attribut address task depend explain introduct popul divid individu individu repres rule goal attribut goal attribut part rule part individu fix undergo action genet oper number subpopul greater equal number goal attribut user constraint respect goal occur discov rule motiv divid popul subpopul twofold individu mate individu popul simpl solut problem avoid exchang genet materi individu evolv predict goal attribut kind popul partit greatli facilit exploit section mention pass ga paper design discov knowledg accur interest achiev goal fit function partial base modifi version rule al exploit parallel mention global popul individu divid subpopul subpopul assign distinct logic processor node number processor node parallel machin network discuss case case discuss case subpopul alloc distinct processor node processor node subpopul evolv parallel addit data mine partit processor approach relat advantag exploit data explain avoid problem replic data mine reduc scalabl larg gener genet algorithm consist fit evalu applic genet oper phase exploit fit evalu phase exploit data parallel control parallel individu pass processor kind scheme scheme physic interconnect processor node map logic ring processor processor node neighbour left neighbour figur explor parallel processor node comput partial measur fit individu local access local dataset processor transfer entir local subpopul fit neighbour processor node receiv subpopul individu left perform comput partial fit measur incom individu local data combin partial fit measur previou incom individu produc fit forward incom updat partial fit neighbour process repeat individu pass processor return origin final fit comput scheme illustr figur note pass processor individu partial fit data mine minim commun overhead phase applic genet oper exploit control parallel phase processor appli genet oper individu local subpopul parallel applic genet oper subpopul complet independ applic genet oper subpopul phase requir commun discuss assum case case basic idea argument opportun exploit parallel wast differ case subpopul alloc distinct processor processor node parallel parallel machin case subpopul alloc processor order ensur subpopul evenli distribut achiev good workload balanc case physic processor node charg evolv parallel data mine task pvm virtual softwar environ cluster heterogen comput view singl parallel machin al comput result section report result experi dataset obtain uci repositori dataset dataset question adult absenc specif benchmark dataset depend model dataset chosen partial potenti goal attribut partial due larg comparison dataset uci repositori processor partit data set popul popul flow individu pass processor pop dataset instanc attribut experi goal attribut social financ adult dataset instanc attribut goal attribut data class salari greater experi genet algorithm individu run gener experi perform parallel virtual machin consist pentium ii mb main memori gb oper system linux redhat pvm interconnect network ethernet mbp system processor run master control slave program run processor run master program run slave program experi measur speed parallel version algorithm sequenti defin sp sequenti process time singl parallel process time tabl show sp result adult tabl parallel process time shown fourth column sum process time initi time requir distribut data individu processor tabl speed result data set number processor number subpopul sequenti process time parallel process time speed sec sec sec sec sec tabl speed result adult data set number processor number subpopul sequenti process time parallel process time speed sec sec sec shown tabl parallel version achiev reason speed sequenti version speed greater case adult dataset reason dataset larger opportun explor data parallel larger public domain dataset experi expect system achiev higher speed larg investig research futur research hybrid parallel strategi ga discov predict rule depend model task strategi exploit data distribut data mine control distribut popul individu processor result show good speed achiev provid data mine larg size due fact data parallel proport size data mine mention futur work includ extens set experi valid empir result report paper due space paper aspect scalabl issu mention detail descript algorithm analysi qualiti discov rule found al refer lo network genet algorithm concept learn proc int conf genet morgan kaufmann lo evalu coevolut concept learn machin proc fifteenth int morgan kaufmann hs aa parallel genet algorithm rule discoveri larg proc ieee man cybernet japan iw nj parallel data mine hierarch genet algorithm final report uk aa sh mine larg parallel process kluwer pvm parallel virtual machin user guid tutori network parallel comput mit press concept induct evolutionari comput aa hs discov interest predict rule genet algorithm proc washington usa survei method scale induct algorithm data mine knowledg discoveri
ML/922 6 transact neural vol januari data mine soft comput survei senior mitra present articl survei literatur data mine soft comput categor provid base soft comput tool hybrid data mine function prefer criterion select model util soft comput methodolog highlight gener fuzzi set suitabl handl issu relat understand mix media inform human provid approxim solut faster neural network exhibit good learn gener capabl environ genet algorithm provid effici search algorithm select mix media base prefer function rough set suitabl handl type uncertainti data challeng data mine applic soft comput methodolog extens bibliographi includ index genet knowledg neural rough rule extract introduct digit revolut made digit inform easi captur fairli store develop comput hardwar softwar rapid huge amount data collect store rate data store grow rate tradit ad hoc mixtur statist techniqu data manag tool longer adequ analyz vast collect data domain larg volum data store central distribut includ stock index interest credit card fraud detect health diagnost inform store hospit manag system manufactur process optim troubl shoot telecommun call pattern fault manag system scientif astronom observ genom biolog data world wide web raw data rare direct benefit true predic abil extract inform manuscript receiv march novemb author machin intellig indian statist india publish item identifi ieee support understand phenomenon govern data sourc data analysi manual process analyst intim familiar data statist provid summari gener report analyst act sophist queri processor approach rapidli break size data grow number dimens number data order dimens order increasingli common scale data explor inferenc human peopl comput technolog autom process prompt intellig data analysi discov knowledg data term kdd refer process knowledg discoveri data mine step involv applic specif algorithm extract pattern data addit step kdd data data data incorpor prior proper interpret result ensur knowledg deriv data subject kdd continu intersect research field machin pattern artifici reason knowledg acquisit expert data machin comput kdd system incorpor method field success applic report vari sector telecommun theori tool provid infrastructur access manipul data data wareh recent popular refer current busi trend collect clean transact make analysi support good overview kdd found ref field concern infer model data includ statist pattern appli machin learn neural comput natur question kdd kdd process knowledg discoveri larg volum includ storag access scale algorithm massiv data interpret visual model support human machin interact ieee transact neural vol januari data mine form knowledg discoveri essenti solv problem specif domain individu data set gather studi collect origin creat knowledg obtain process elimin largest data collect medic exist vast quantiti unstructur format applic data mine facilit systemat analysi case medic requir larg amount preprocess order numer textual inform symbol redund exist medic term data frequent robust preprocess system requir order extract kind knowledg medic data set data clean error organ fashion make problem soft comput consortium methodolog work synergist form flexibl inform process capabl handl ambigu situat aim exploit toler approxim partial truth order achiev solut guid principl method comput lead accept solut low cost seek approxim solut formul problem soft comput methodolog fuzzi neural genet rough wide appli data mine step kdd process fuzzi set provid natur framework process deal uncertainti neural network rough set wide classif rule gener genet algorithm involv optim search queri optim templat select approach case base reason tree wide solv data mine problem present articl overview literatur data soft comput framework section ii describ basic notion knowledg discoveri data mine challeng highlight section iii survei explain role soft comput tool categor basi data mine function implement prefer criterion select model util applic soft comput methodolog highlight section iv conclud articl challeng data mine applic soft comput methodolog ii knowledg discoveri data mine kdd defin nontrivi process identifi potenti ultim understand pattern data data set fact pattern express languag describ fact subset call pattern simpler fact measur measur valid discov function map express partial total order measur space express subset assign certainti measur novelti pattern measur function respect data knowledg pattern potenti lead measur util function map express partial total order measur space goal kdd make pattern understand human measur function map express partial total order measur space pattern combin express map express measur space pattern call knowledg threshold select threshold term pattern knowledg iff role threshold huge number discov pattern report approach design measur object subject structur pattern gener comput rule fail captur complex pattern discoveri process subject depend user examin pattern major reason pattern interest subject point view user user act advantag concept import observ action correl defin term dissimilar discov pattern vocabulari provid user student evalu offer defin evalu instruct describ pattern interest term action pattern professor consist instruct rate rate interest show professor room improv evalu instruct rate higher rate turn professor rate instruct rate lower pattern unexpect interest data mine step kdd process consist pattern subject mitra data mine soft comput framework fig kdd process comput limit histor data discov regular improv futur data consist collect time seri descript learn predict event seri kdd process kdd process outlin fig interact iter step understand applic includ relev prior knowledg goal applic extract target data includ select data set subset variabl data clean includ basic remov handl miss data data sourc due oper error system implement flaw low qualiti data clean prior data mine data includ integr heterogen data sourc data reduct includ find featur repres data goal reduct transform method function data includ decid model deriv data mine algorithm web imag discov associ rule function rule combin data mine includ select search pattern decid model paramet data includ search pattern interest form set includ interpret discov visual extract pattern analyz pattern automat semiautomat identifi pattern user discov includ incorpor knowledg perform action base knowledg data mine kdd refer process turn data knowledg import step kdd process data mine data mine interdisciplinari field gener goal predict outcom uncov relationship data autom tool emploi sophist algorithm discov hidden anomali structur larg amount data store data inform repositori data mine task discov interest pattern describ predict behavior model base data data mine involv fit model determin pattern observ data fit model plai role infer knowledg decid model reflect knowledg part kdd process subject human judgment requir data mine algorithm constitut combin compon function model form linear neural model paramet determin data prefer basi prefer model set paramet depend data criterion form function model temper smooth term avoid gener model freedom constrain data search specif algorithm find model prefer criterion data mine algorithm instanti compon common model function current data mine practic includ classif classifi data item predefin categor class regress map data item predict variabl cluster map data item cluster natur group data item base similar metric probabl densiti model rule gener extract classif rule data discov associ rule describ associ relationship attribut summar compact descript subset data depend model describ depend variabl ieee transact neural vol januari sequenc analysi model sequenti analysi goal model state process gener sequenc extract report deviat trend time rapid growth interest data mine due fall cost larg storag devic collect data develop robust effici machin learn algorithm process fall cost comput enabl intens method data analysi notion scalabl relat effici process larg data gener model commonli cite reason scale size train set accuraci learn classif model degrad accuraci learn smaller sampl stem presenc exist larg number featur scale larg data set impli fast learn algorithm develop speed slow issu turn algorithm feasibl larg number exampl introduc potenti problem time space complex goal learn classif substanti sacrif scale algorithm main approach scale includ design fast reduc asymptot optim search find approxim advantag inher partit divid data subset instanc learn select possibl combin relat address data feasibl treat singl flat file gener data mine algorithm demonstr varieti realworld applic work problem involv larg set data collect singl data numer symbol featur data invari text imag featur interleav carefulli cleanli collect task mind develop gener algorithm expect encompass sourc type data support data human expert collabor comput form test main challeng data mine procedur involv massiv data set high huge data set creat combinatori search space model chanc data mine algorithm find spuriou pattern gener valid solut includ robust effici sampl approxim method parallel process user interact prior knowledg data mine inher interact iter process user interact domain knowledg form specif detail level visual extract model desir overfit assess statist data set mine huge distribut sourc presenc spuriou data point lead overfit model regular resampl methodolog model design understand pattern make discoveri understand human solut includ rule natur languag visual data knowledg nonstandard incomplet data data miss noisi mix media data learn data repres combin imag text manag chang data knowledg rapidli chang make discov pattern invalid solut includ increment method updat pattern integr data mine tool part entir make system desir integr final make procedur iii soft comput data mine recent soft comput methodolog appli handl challeng pose data mine main constitu soft includ fuzzi neural genet rough set contribut distinct methodolog address problem domain manner result intellig robust system provid low approxim compar tradit techniqu describ role individu soft comput tool system develop handl function aspect data mine suitabl prefer criterion optim mine mention data mine soft comput combin tradit method depend applic requir human interact decid suitabl approach fuzzi set model qualit transmiss handl uncertainti stage fuzzi set fuzzi logic capabl reason human type reason natur form earliest wide report constitu soft comput develop fuzzi logic mitra data mine soft comput framework led emerg soft comput section provid literatur pertain fuzzi set data mine knowledg discoveri concern identifi interest pattern describ manner fuzzi model repres prudent sift qualit observ calibr rule attempt establish relationship system variabl grow versatil knowledg discoveri import compon human interact inher process knowledg process fuzzi set inher inclin cope linguist domain knowledg produc interpret solut notion encompass featur quantifi fuzzi set fuzzi dissimilar discov pattern vocabulari measur extens methodolog defin term belief belief base previou evid denot belief soft belief weight attach belief belief measur condit belief function frequenc raw data pattern rel belief system evid formal defin definit measur amount belief chang result pattern grow role fuzzi set technolog realm data mine data browser implement fuzzi set theori analysi data data mine necessit simultan deal type data numer data develop learn algorithm creat mix fuzzi rule involv categor numer attribut pedrycz discuss construct fuzzi comput vehicl knowledg establish relationship data mine fuzzi model role fuzzi set categor base function data mine model data mine aim sift larg volum data order reveal inform form user fuzzi set support linguist data discov depend data format data typic interest discoveri structur eventu quantif function depend exist prevent search meaningless trivial pattern research develop fuzzi cluster algorithm russel explor fuzzi cluster method mine telecommun custom prospect gain busi custom market share pedrycz design fuzzi cluster algorithm contextu inform induc linguist space search procedur kdd achiev focu import data mine attribut valu consid result data mine approach achiev attribut focu recogn interest featur suggest approach progress reduc data set partit elimin import attribut reduc partit soft focu handl crisp data work progress reduct cognit lead inform object gener inform nugget sift uninterest attribut combin distanc metric care type attribut avoid taxonom structur valu handl granular partit granular reduc attribut result loss finer grain lead partit difficulti soft granul defin term membership function granular comput find pattern data express process chunk inform regard essenti entiti cognit pursuit gear establish pattern data concept granular comput concentr comput effort specif subset complet split comput effort lead modular effect associ import area data mine research deal discoveri associ rule associ rule describ interest associ relationship attribut boolean associ involv binari gener associ involv attribut hierarch quantit associ involv attribut quantit categor valu fuzzi techniqu consid kei compon data mine system affin human knowledg wei chen mine gener associ rule fuzzi taxonom structur crisp taxonomi assum child belong ancestor fuzzi taxonomi repres direct acycl edg repres fuzzi relationship partial belong item taxonomi account comput support confid au chan util adjust differ observ expect frequenc count attribut discov fuzzi associ rule relat divid quantit attribut fix emploi linguist term repres reveal regular except threshold quantit valu directli infer rule linguist lead discoveri natur ieee transact neural vol januari understand rule algorithm discov posit neg deal fuzzi class boundari miss valu fuzzi techniqu buri boundari adjac interv numer result resili inaccuraci physic measur real life entiti effect algorithm demonstr transact system industri china function fuzzi logic analyz infer base function depend relat fuzzi infer gener infer fuzzi relat gener classic counterpart support fuzzi inform storag retriev infer analysi perform special abstract model maintain vital link fuzzi relat model link util infer formal practic applic involv infer includ knowledg discoveri secur fd interest notion knowledg discoveri standpoint properti real world valid properti applic engin queri optim al data mine algorithm extend repres gradual rule linguist variabl data summari discoveri major compon knowledg discoveri user inform grasp essenc larg amount inform fuzzi set theori data summar fuzzi set interact summari discoveri process util fuzzi hierarchi domain knowledg gener tupl form summari includ fuzzi concept virtu fuzzi fuzzi relationship common actual domain natur discoveri process accur summari linguist summari larg set data deriv linguist quantifi proposit valid correspond prefer criterion involv mine task system consist summar quantiti agreement simpl summar extend confluenc attribut impli combinatori problem due huge number summari involv determin found interest linguist summari nontrivi involv complic combin attribut gener automat human requir develop fuzzi queri interact linguist summar natur term support fuzzi element includ interv attribut membership match fuzzi relat import coeffici user formul set linguist summari interest system retriev record calcul valid summari linguist summari select scheme fuzzi queri www browser microsoft explor netscap navig definit fuzzi fuzzi linguist quantifi java applet chiang al fuzzi linguist summari mine time seri data system human form graphic displai user determin knowledg discov model predict util rank includ cpu real storag web mine typic user profil url associ vast amount access log import compon web deal tailor interact web inform space base inform al defin user session tempor compact sequenc web access user dissimilar measur web session captur organ web site goal categor session web mine imag recent size multimedia inform consist mix media made imag retriev activ research area unlik tradit techniqu retriev imag base exact match cbir system repres inform content imag visual featur retriev imag base similar featur develop interact iter imag retriev system account subject human percept visual content featur relev weight learn posit neg integr dissimilar measur smooth transit feedback model continu fuzzi membership function design fuzzi approach handl complex linguist queri consist multipl attribut queri interpret imag retriev imag satisfi attribut membership featur vector imag membership function attribut fuzzi connect combin satisfact multipl attribut complex queri arriv satisfact rank imag retriev neural network neural network earlier thought unsuit data mine inher natur inform symbol suitabl verif interpret human recent widespread activ aim extract knowledg train network mitra data mine soft comput framework form symbol rule serv identifi attribut individu determin classif unlik fuzzi main contribut neural net data mine stem rule extract cluster rule primari input connectionist rule extract algorithm train neural term link data set hidden output unit automat deriv combin simplifi arriv rule set rule provid insight applic domain neural net incorpor parallel tackl optim problem data domain model suitabl environ typic network train achiev requir accuraci rate redund connect network remov prune algorithm link weight activ valu hidden unit network classif rule gener rule provid quantit measur evalu perform gener rule relat prefer fit chosen rule matrix element number pattern belong class classifi class correct classif provid rule test set defin equal number point class point correctli classifi point found classifi class accuraci defin kappa class defin numer denomin kappa obtain sum respect numer denomin separ class measur percentag test set network output measur quantifi goal restrict minimum number class problem percentag exampl test set rule fire measur uncov region smaller uncov region superior measur term number rule lower compact comput measur term cpu time requir confid rule defin confid factor incom link weight node threshold cluster big challeng data mine organ retriev document archiv kohonen al demonstr util huge map million node partit million patent abstract document repres featur vector al emploi strategi partit data cluster al perform hierarch cluster base spread factor independ data design data mine combin neural network data cluster set patholog data inform topographi morpholog combin som nonlinear map reduc dimens data visual neural network varieti classif regress task time seri predict attempt lee liu emploi neural oscillatori elast graph match model hybrid radial basi function identif track comput comput popular hybrid wide report literatur judici integr merit neural fuzzi enabl build intellig system incorpor gener advantag artifici neural network massiv learn environ system model qualit knowledg term transmiss uncertainti fuzzi logic gener approach applic specif merit highlight earlier rule gener aspect neural network util extract natur rule fuzzi neural network fuzzi mlp fuzzi kohonen network linguist rule gener inferenc set combin incomplet compon input vector consist membership valu overlap partit linguist properti high input featur output provid term class membership valu block diagram fuzzi neural network depict fig ieee transact neural vol januari fig block diagram fuzzi neural network fig block diagram inferenc rule gener phase model capabl inferenc base complet partial queri user unknown input variabl kei reach produc justif infer form rule connect weight node activ valu train network process certainti factor determin confid output note certainti refer prefer criterion extract notion pattern fig view stage involv process inferenc rule gener zhang al design granular neural network deal data fusion granular knowledg discoveri network capabl learn intern granular relat input output predict relat granular data compress gener granular knowledg form rule network mitra al capabl gener posit neg rule linguist form justifi reach absenc posit inform belong pattern class complementari inform pattern belong class gener neg rule priori class inform distribut pattern point featur space account encod crude domain knowledg data set connect weight fuzzi interv linguist set process network topolog automat refin grow prune link node network converg result rule genet algorithm ga global search suitabl situat search space larg optim fit prefer criterion data arriv optim solut genet oper knowledg discoveri system develop genet program concept system intent inform extract set popular problem address find common characterist set object genet program automat select queri ga fusion multipl data type multimedia autom program gener mine multimedia data literatur domain data mine rich fuzzi set provid categor interest system base function model discov pattern data mine encompass predict variabl attribut determin unknown futur valu variabl interest tradit weight averag linear model predict requir basic assumpt interact attribut handl attribut interact manner xu mitra data mine soft comput framework design system nonlinear integr adapt ga learn nonlinear set train data noda al ga discov interest rule depend model rule predict goal attribut gener attribut high inform gain good predictor class consid individu attribut low inform gain relev attribut interact account phenomenon rule consequ comput base rel frequenc predict goal interest rule predict author attempt discov interest rule larg set accur necessarili rule associ al evolv associ rule provid high accuraci coverag accuraci rule measur coverag interpret record satisfi rule defin note quantit measur rule evalu discuss section refer neural network rough set theori rough set emerg major mathemat tool manag uncertainti granular domain indiscern object prove varieti kdd process offer mathemat tool discov hidden pattern data data mine overlook fundament principl rough learn system discov redund depend featur problem classifi approxim concept lower upper approxim fig schemat diagram rough set rough set learn algorithm obtain set rule tabl rough set method effect tool extract knowledg creat knowledg classifi object attribut creat tabl knowledg discoveri process initi remov undesir attribut final data depend reduc find minim subset attribut call reduct rough set applic data mine gener proce direct rule induct attribut tabl method base gener discern matric reduct data filtrat templat gener involv extract elementari block data base relat genet algorithm fig lower upper approxim rough set time stage methodolog larg data set reduct memori comput requir rule work dynam consid rough system develop data mine includ system base variabl rough set model rule induct system base learn exampl base rough set theori extend handl miss attribut closest fit hybrid al integr design theori rough set util extract domain knowledg extract crude domain knowledg encod connect weight rule gener tabl comput rel reduct network topolog automat determin depend factor rule encod initi connect weight hidden node model conjunct part output node model disjunct hybrid intellig system design report direct mine huge dataset partit develop classifi combin result modular approach pursu combin mlp gener ga fig depict knowledg flow entir process classif problem split problem depend rule extract directli attribut tabl consist fuzzi membership valu adapt appli threshold final network evolv ga restrict mutat framework divid conquer evolutionari found enhanc perform network georg ga appli determin data summari develop hybrid discov conceptu cluster larg ieee transact neural vol januari fig knowledg flow modular system iv discuss current research data mine discoveri algorithm visual techniqu grow awar easi discov huge number pattern pattern useless uninterest user prevent user overwhelm larg number uninterest techniqu identifi pattern present user soft comput involv fuzzi neural genet rough recent solv data mine problem strive provid approxim solut low speed process categor provid base soft comput tool hybrid mine function prefer criterion select model fuzzi constitut oldest compon soft suitabl handl issu relat understand mix media inform human provid approxim solut faster discov associ rule function time seri web imag retriev neural network suitabl environ typic extract knowledg form quantit evalu classif regress type machin learn scale hybrid exploit characterist neural network fuzzi set gener handl mix mode model highli nonlinear boundari domain natur encod network improv perform genet algorithm provid effici search algorithm select mix media base prefer function emploi regress discov associ rule rough set suitabl handl type uncertainti data util extract knowledg form rule hybrid typic enjoi gener merit individu soft comput tool integr data mine function model system includ rule data incorpor domain partit note notion modular effect direct scale algorithm speed converg reason ai problem solv recent drawn attent soft comput data mine commun profil potenti applic challeng methodolog includ scalabl problem extrem larg heterogen spread multipl possibl disk web geograph locat combin data singl larg file featur evalu reduct improv predict accuraci recent work direct choic metric evalu techniqu handl dynam data incorpor domain knowledg user interact quantit evalu perform effici integr soft comput tool connect comput theori explain zadeh attent commerci data mine tool develop base soft comput methodolog includ data mine fuzzi ibm intellig miner neural ga mine parallel algorithm desir explor tradeoff memori inform select suitabl parallel algorithm data mine partit data appropri distribut subset multipl learn concept descript combin correspond coupl mitra data mine soft comput framework collect independ term distribut data mine refer fayyad mine knowledg discoveri commun vol pp data data commun vol pp major hybrid knowledg system detect int intel vol pp discoveri causal relationship larg clinic rx project vol lectur note medic informat troubleshoot cfm engin boe cbr vol pp lectur note comput scienc scientif commun vol pp commun vol pp advanc knowledg discoveri data mine menlo issu knowledg discoveri knowledg int intel vol neural soft commun vol pp pal pattern method soft comput discoveri intern conflict appli artifici vol pp program machin learn san morgan data mine method knowledg discoveri silberschatz make pattern interest knowledg discoveri ieee tran knowledg data vol pp learn data commun vol kdd process extract knowledg volum commun vol pp mitra inferenc rule ieee tran neural vol pp inferenc rule ieee tran cybern vol pp fuzzi mlp classif rule ieee tran neural vol pp fuzzi knowledg encod ieee tran neural vol pp modular design rough network fuzzi vol pp hybrid system mine market survei proc intern confer knowledg discoveri data mine aug type nonlinear integr applic evolutionari algorithm data proc ieee int conf pp oct interest predict rule genet proc ieee evolutionari comput cec pp juli data mine expert system proc ieee int conf pp oct russel cluster data mine market proc june pp fuzzi pattern recognit vol pp de neural network approach medic data mine proc ieee int joint conf neural pp rough genet neural network conceptu cluster discoveri data proc nov pp organ massiv document ieee tran neural vol pp ieee tran neural vol pp organ map control growth knowledg ieee tran neural vol pp truth direct challeng extract knowledg train artifici neural ieee tran neural vol pp data mine neural ieee tran knowledg data vol pp mitra rule survei soft comput ieee tran neural vol pp rough set framework data mine proposit default lectur note comput vol pp hu knowledg rule rough set proc int conf data eng feb pp law rough set comput vol pp shan acquisit increment modif classif comput vol pp neural network data fusion ieee tran neural vol pp associ rule set item larg proc acm sigmod int conf manag pp wei gener associ rule fuzzi taxonom proc june pp au effect algorithm discov fuzzi rule relat proc ieee int conf fuzzi syst fuzz ieee pp evolutionari approach data proc nov pp lee summar fuzzi isa ieee tran cybern vol pp linguist summari knowledg discoveri frawlei ed menlo pp mine linguist summari interact proc oct pp georg summar genet algorithm fuzzi genet algorithm soft herrera ed pp hale fd infer relat data knowledg vol pp mine discoveri extend function proc june pp time seri data fuzzi linguist summari fuzzi set vol pp lee identif track system integr neural oscillatori graph match hybrid rbf network track mine ieee tran neural vol pp provost survei method scale induct data mine knowledg vol pp set technolog knowledg fuzzi set vol pp ieee transact neural vol januari interest pattern user ieee tran knowledg data vol pp discoveri fuzzi int intel vol pp data fuzzi pattern recognit vol pp symbol data proc june pp knowledg discoveri menlo proc june pp theori fuzzi inform granul central human reason fuzzi fuzzi set vol pp mine system fuzzi rule proc ieee int conf fuzzi syst fuzz ieee pp mar cluster base robust estim applic web proc june pp soft comput imag process imag retriev fuzzi proc june pp fuzzi approach complex linguist queri base imag proc june pp fuzzi modular rule gener ieee tran knowledg data visual analysi hierarch neural project data ieee tran neural vol pp genet approach data proc int conf knowledg discoveri data mine aug program improv data applic biochemistri protein proc annu conf genet program stanford juli pp discov collect object genet proc annu conf genet program stanford juli pp teller evolut data int expert vol pp rough theoret aspect reason data rough set knowledg discoveri system knowledg discoveri rough proc int workshop rough set soft comput pp knowledg discoveri rough set knowledg discoveri case studi softwar ed pp closest fit approach miss attribut valu birth proc nov pp pal rough fuzzi trend cancer soft ieee tran biom vol pp special issu neural data knowledg ieee tran neural vol pp soft comput case base reason bengio joint distribut neural ieee tran neural vol pp strip mine virtual design pharmaceut neural ieee tran neural vol pp hybrid approach neural network memori base learn data ieee tran neural vol pp featur ieee tran neural vol pp direct comput theori ai vol pp agraw mine associ ieee tran knowledg data vol pp kargupta advanc distribut knowledg discoveri mit mitra receiv physic tech comput scienc phd comput scienc indian statist european laboratori intellig techniqu german academ exchang servic fellow join indian statist associ professor book pattern method soft comput paradigm research public visit professor research interest includ data pattern fuzzi artifici neural network soft comput dr mitra recipi nation talent search scholarship nation council educ research ieee transact neural network outstand paper award fellowship pal receiv phd radio physic electron india receiv phd electr engin imperi london professor distinguish scientist indian statist found head machin intellig unit work colleg park postdoctor visit nasa johnson space texa guest investig senior research hong kong polytechn hong kong visit professor serv distinguish visitor ieee comput societi region research interest includ pattern imag data soft neural genet fuzzi system book includ fuzzi mathemat approach pattern pattern method soft comput research public prof pal fellow world academi nation academi india receiv research nasa tech ieee transact neural network outstand paper nasa patent applic gold om foundat award scientif intern award republ sy indian nation scienc academi associ editor ieee transact neural network pattern recognit intern journal pattern recognit artifici appli inform fuzzi set fundamenta execut advisori editori ieee transact fuzzi intern journal imag intern journal approxim guest editor journal includ ieee comput mitra receiv electr engin indian work scientist center artifici intellig india senior research fellow indian statist research interest area data mine knowledg pattern learn soft comput
ML/923 6 mine optim support rule numer attribut rajeev rastogi shim bell laboratori murrai nj abstract mine associ rule larg data set receiv attent recent year associ rule determin correl attribut relat applic retail sector optim associ rule effect focu interest characterist involv attribut optim associ rule permit uninstanti attribut problem determin instanti confid gain rule maxim gener optim support associ rule problem permit rule disjunct uninstanti numer attribut gener associ rule enabl extract inform season local pattern involv uninstanti attribut rule singl numer present dynam program algorithm comput optim associ rule bucket techniqu reduc input divid conquer strategi improv perform significantli sacrif optim present approxim algorithm base dynam program numer attribut result singl numer attribut bucket divid conquer enhanc effect reduc execut time memori requir dynam program algorithm show algorithm scale linearli attribut domain size number disjunct introduct larg number corpor invest heavili inform technolog manag busi vast amount critic busi data store system volum data expect grow futur organ unabl collect valuabl insight data guid market invest manag polici reason inform store implicitli larg amount data sophist techniqu develop area data knowledg compani leverag data effect extract insight inform data associ introduc provid mechan discov correl underli data gener associ rule view defin attribut form conjunct condit valu domain attribut rule support confid support condit ratio number tupl satisfi number tupl relat support rule form support confid ratio support condit associ rule problem comput associ rule satisfi minimum support minimum confid scheme found relat telecom servic provid call detail inform attribut relat src src dst dst countri durat singl tupl relat captur inform endpoint tempor element call associ rule citi countri satisfi minimum support minimum confid total call ny call origin ny franc optim associ rule motiv applic market introduc associ rule form numer uninstanti instanti condit condit uninstanti author defin gain rule denot differ support support time minimum confid author algorithm determin valu uninstanti variabl ffl confid maxim support condit minimum support optim confid ffl support condit maxim confid minimum confid optim support ffl gain maxim confid minimum confid optim gain optim associ rule unravel rang numer attribut trend correl strong high confid telecom servic provid mention earlier interest offer promot ny custom make call franc time promot critic advantag offer close period consecut dai maximum number call ny made minimum percentag call ny franc framework develop determin period associ rule src citi ny dst countri franc minimum confid optim support rule result period call ny number call origin ny maximum minimum confid optim gain rule result period call ny franc exce total call number excess call maximum limit optim associ rule dealt singl optim interv singl numer attribut determin number singl interv inadequ descript local trend underli data telecom servic provid interest upto promot custom ny call franc mechan identifi upto period number call ny franc made associ rule permit disjunct uninstanti determin optim period find optim instanti src citi ny dst countri franc inform telecom servic provid determin suitabl period offer discount intern long distanc call franc framework strengthen enrich associ rule uninstanti attribut optim instanti rule durat durat dst countri franc yield valuabl inform type call term period fairli high call substanti portion direct franc gener optim associ rule problem associ rule upto disjunct uninstanti numer attribut present dynam program algorithm comput optim associ rule complex number valu domain uninstanti attribut present optim significantli improv comput complex algorithm bucket algorithm coalesc contigu valu confid greater divid conquer strategi enabl split origin problem multipl smaller subproblem combin solut subproblem drastic reduc comput perform reduc storag permit algorithm execut larg result optim enabl dynam program algorithm scale linearli domain size number disjunct optim make handl input valu larg minut dynam program algorithm comput optim associ rule restrict comput approxim associ rule remaind paper organ section discuss relat work section present gener framework optim support associ rule describ dynam program comput optim support rule singl numer attribut section section algorithm comput approxim rule numer attribut section result experi demonstr effect optim section summar present direct futur research relat work associ rule set transact transact set item bought studi associ rule sale transact data form disjoint set item effici algorithm comput found gener associ rule multipl level taxonomi item studi associ rule quantit categor attribut studi work restrict associ rule form suggest wai extend framework rang singl left hand side rule achiev partit numer attribut interv merg neighbor interv gener larger interv author partial complet measur order determin partit numer attribut interv author studi problem discov cyclic associ associ rule displai regular cyclic variat time optim associ rule problem introduc author permit associ rule singl uninstanti condit left hand scheme determin valu variabl confid support rule maxim author extend result case rule uninstanti numer attribut left hand side algorithm discov optim support confid associ rule class region rectangl admiss region admiss algorithm comput support confid scheme comput singl optim region extend optim support confid problem comput optim show problem case uninstanti numer attribut search algorithm emploi branch bound prune techniqu comput optim region optim support problem requir confid optim consid greater minimum threshold confid optim region fall threshold reason intract redefin optim support problem optim region requir minimum confid make problem tractabl attribut case scheme cluster quantit associ rule uninstanti numer attribut left hand side present support author present cluster algorithm gener set point rectangl requir confid support comput optim set satisfi minimum confid individu point requir confid preliminari defin optim associ rule problem address paper data assum store relat defin categor numer attribut associ rule built atom condit form categor atom condit valu domain condit refer refer condit uninstanti atom condit combin oper yield complex condit instanti associ studi form arbitrari instanti condit support instanti condit denot ratio number tupl satisfi condit total number tupl relat associ rule defin defin note definit definit defin adopt definit denot minimum confid optim associ rule problem requir optim instanti comput uninstanti associ rule conjunct uninstanti atom condit distinct numer arbitrari instanti condit assum domain uninstanti numer attribut ng depend uninstanti numer space axi uninstanti valu axi valu domain attribut note singl interv domain uninstanti combin result region region simpli interv region rectangl bound axi endpoint interv axi region defin conf rule defin conf set fr defin conf rule case defin conf rule note hold set defin notat associ present formul optim associ rule problem support determin set region region maxim refer set optim support set telecom servic provid section call detail data week period figur present summari relat dai summari inform total call made call ny call ny franc includ summari support date rule date citi ny dst countri franc total number call made week interest discov interest period heavi call volum ny franc period rang consecut uninstanti associ rule date src citi ny dst countri franc date src citi ny dst countri franc assum interest period optim support set requir upto period percentag call period ny franc number call ny maxim period maximum final optim support set date total call call ny call ny franc support confid figur summari call detail data week period remaind assum support confid point region comput perform singl pass relat support constitut input algorithm input size numer attribut tackl problem comput optim support set associ rule singl uninstanti numer attribut uninstanti rule uninstanti numer attribut dynam program algorithm comput optim support set section section present preprocess algorithm contigu rang valu domain attribut singl reduc size input present divid conquer optim section improv comput complex memori requir dynam program algorithm bucket region interv domain size number interv split rang map domain bucket belong domain bg number interv consid reduc time space complex algorithm note reduct space complex result reduc memori requir algorithm account assign valu domain bucket bucket procedur impact optim optim set optim set comput bucket ident comput raw domain valu order ensur bucket procedur interv optim set comput prior bucket subset valu assign bucket complex bucket procedur input bucket algorithm support confid valu sort order valu prefer time complex linear procedur perform singl pass input data larg inform support confid point fit bucket comput effici singl scan data present bucket algorithm meet requir optim optim set time complex output algorithm bucket support input dynam program algorithm section optim support contigu valu domain uninstanti attribut confid greater equal singl bucket bucket algorithm confid assign separ bucket bucket valu interv assign bucket confid confid domain confid greater equal confid bucket scheme gener valu valu fourth valu straightforward observ assign valu bucket achiev perform singl pass input data theorem show bucket scheme preserv optim comput optim set theorem optim support set interv case conf conf note conf conf conf set higher support optim support set lead contradict similar argument show conf set contigu confid valu optim set reason optim set valu interv optim valu confid violat theorem interv optim set comput prior valu assign bucket optim set comput bucket initi domain valu optim support algorithm present dynam program algorithm optim support problem dimens input algorithm bucket gener bucket scheme section confid support problem determin set interv confid interv greater equal support set maxim intuit denot optim set interv interv interv confid figur optim support set comput fairli straightforward observ conf conf conf interv bound comput valu subinterv theorem optim set ffl ffl maximum conf interv confid maximum support whichev higher support optim set instanti confid instanti confid support maximum conf maxim support theorem enabl dynam program order comput shown figur comput comput case turn comput comput requir comput requir comput procedur begin true return conf return return end figur algorithm comput optim support set comput separ comput time comput requir recomput note pair requir comput dynam program algorithm dynam program algorithm comput shown figur algorithm assum conf precomput interv arrai store optim set entri arrai initi set procedur check comput invok function comput step optim set store return algorithm calcul result theorem check confid interv maximum support confid case interv interest function step argument return set maximum support interv interest lie lie set union pair interv maximum support note initi invok paramet step algorithm time space complex comput complex procedur invok paramet mention precomput confid support interv execut time complex precomput complex shown proport number time invok reason exclud invoc incur constant overhead invoc step result separ invoc count includ invoc comput overhead invoc assum conf interv comput step constant overhead note union step comput constant time store support union obtain simpli sum support invoc execut constant count maximum number time invok note bodi execut subsequ invoc simpli return comput greater time case pair invok time step step step number pair invok time invok step number valu maximum number valu invok time conclud time complex dynam algorithm comput store satisfi space complex algorithm gener procedur simplifi bound number interv optim set invoc comput optim set singl interv comput optim set limit number interv order comput optim initi invok argument interv store optim set bound number interv conf line theorem maximum interv simplifi comput optim chang requir procedur replac step time complex simplifi algorithm reduc invok time invok time divid conquer dynam program algorithm comput optim support set present previou section time complex space complex number input bucket divid conquer algorithm partit rang consist bucket subrang dynam program algorithm order comput optim set subrang combin optim set subrang deriv optim set entir rang bucket input dynam program algorithm subrang size smaller entir divid conquer approach reduc time space complex comput optim set entir rang result reduc execut time memori algorithm execut section divid conquer execut time storag algorithm linearli number input bucket present intuit underli divid conquer approach present scheme linear time complex split rang bucket subrang make scheme practic larg case support confid inform bucket fit show result subrang combin yield optim support set intuit describ intuit underli optim bucket case interv conf interv optim support set confid conclud occur optim set interv optim set left interv span independ comput set result maximum support trivial optim set interv left interv valu optim set gener idea comput partit point partit point bucket properti interv confid interv optim set partit point partit point partit interv interv partit interv properti interv optim set wholli singl partit reason adjac partit point comput comput partit combin maximum support comput partit point figur present algorithm comput partit point kei idea underli algorithm bucket comput largest interv end confid point partit point largest interv end interv end confid procedur begin earliest earliest break earliest fjg return end figur algorithm gener partit point exce largest interv confid bucket comput linear time recent result author introduc notion effect point bucket effect conf fairli straightforward observ largest interv confid end effect point effect point confid conf posit describ procedur figur util effect point order comput partit point author show effect point comput linear time singl forward pass bucket repeat assum effect point store order arrai effect properti effect point make effici comput largest interv end bucket confid effect point scan order conf procedur simultan scan input bucket effect point order variabl track current bucket scan effect point variabl earliest store earliest effect point exist interv confid begin earliest end bucket greater equal bucket partit point step interv end confid scan bucket effect point bucket effect point candid longest interv confid end step effect point immedi decrement longest interv end earliest set procedur begin return end figur divid conquer algorithm optim support simpli bucket decrement step earliest bucket longest interv confid end earliest effect point earliest store effect point immedi algorithm perform pass data forward pass comput effect point pass partit point comput algorithm effici data larg fit divid conquer algorithm partit gener partit procedur figur comput optim support set boundari bucket partit number bucket partit step optim set partit interv comput procedur return optim support set size interv consist bucket optim set size partit store step invok time number interv rang complex optim set interv partit comput invoc store share invoc partit arbitrari interv partit maximum size optim optim set comput time optim set comput partit merg step merg process carri success step step optim set partit merg result merg partit store figur problem comput optim set dimens end step store optim set interv belong partit comput optim set partit obtain step maxim complex step merg comput valu number partit complex step complex algorithm max denot largest complex max found larg number max divid conquer result substanti reduct comput complex dynam program algorithm origin complex reduc storag memori requir dynam program algorithm max numer attribut problem mine optim support set case uninstanti numer attribut comput set rectangl space support maximum dynam program algorithm comput optim support set simpli consid wai split interv individu comput optim set subinterv approach work interv optim set wholli subinterv optim set comput subinterv similar approach split rectangl combin optim set yield optim set origin rectangl point illustr figur illustr rectangl optim set rectangl obviou split rectangl rectangl optim set complet dynam program approach consid split rectangl horizont vertic combin optim set result optim set origin rectangl comput order comput optim set dynam program cut form shown figur origin point split region portion region upper left quadrant point problem approach subregion due cut perfect rectangl region form shown figur lower edg region gener algorithm straight edg defin step number region complex dynam program algorithm comput optim set cut exponenti describ dynam program algorithm polynomi time complex comput approxim optim set approxim algorithm dynam program procedur comput approxim support set dynam program algorithm simpl end end horizont vertic cut split rectangl space defer detail descript procedur algorithm gener algorithm differ unlik case dimens consid vertic dimens vertic horizont cut split interv comput optim set size subinterv optim set size approach work case optim exist split subinterv optim set interv optim interv rectangl belong optim set comput optim set size valu gener procedur comput approxim optim set cut cleanli divid rectangl optim set number point input dynam program algorithm case size domain uninstanti numer attribut theorem complex procedur appendix optim result mention simpl end end dynam program approach result optim set comput identifi restrict yield optim set show bound comput approxim gener case deviat optim set defin set rectangl binari space partit plane rectangl partit rectangl set rectangl figur binari space bold line partit set figur restrict optim set binari space show procedur comput optim set note set fewer rectangl plane binari space comput optim set figur binari space rectangl theorem procedur comput optim set binari space rectangl appendix result studi perform algorithm comput optim support set case show bucket divid conquer make dynam program algorithm highli scaleabl tackl domain size high mine interv domain valu achiev matter minut studi sensit optim minimum confid threshold data file read begin algorithm order comput support confid point time constitut tini fraction total execut time algorithm includ time spent read data file result note perform algorithm depend number tupl data file sensit size attribut domain number interv experi perform sun machin mb ram run solari synthet associ rule experi form uc uninstanti attribut section domain consist integ rang domain point assign randomli gener confid uniform distribut assign randomli gener support uniform averag support bucket divid conquer studi improv execut time result due bucket divid conquer optim figur plot perform variant algorithm domain size size domain optim bucket divid conquer max valu max input size figur vari input size bucket divid conquer log scale repres valu ax fix number interv minimum confid threshold optim found dynam program algorithm time excess minut valu domain attribut bucket divid algorithm domain size high major portion perform improv result due divid conquer bucket reduc input reduct fairli small optim support divid partit origin problem size subproblem size max complex max mk mk optim support divid conquer split bucket partit size max max comput complex divid conquer smaller complex bucket effect bucket divid conquer depend valu discuss detail section figur show algorithm optim scale input size due quadrat complex found execut time line expect hold bucket optim divid conquer complex algorithm max mk mk number partit max size largest partit max stai approxim linearli expect divid conquer algorithm exhibit linear observ optim support case tabl figur valu max valu optim max stai narrow rang linearli respect cost comput optim set partit stai approxim algorithm incur linear minimum confid optim bucket divid conquer max sensit valu max confid figur vari cost comput optim set partit combin sensit studi bucket divid conquer optim minimum confid valu figur plot execut time algorithm vari figur plot perform algorithm optim comput optim support set find perform dynam program algorithm confid reason optim confid interv optim set interv interv call interv larg number interv confid turn attent bucket divid conquer optim tabl figur present number bucket gener bucket algorithm number partit gener divid conquer algorithm max size partit max make observ confid number bucket input algorithm valu lower divid conquer optim confid confid max partit size reason point bucket algorithm coalesc contigu valu confid lower larger number valu point attribut fact number partit point confid number point complet explain behaviour optim figur lower due smaller number bucket smaller input perform algorithm bucket bucket confid reduct input size smaller bucket optim effect larg confid valu perform algorithm bucket divid conquer enhanc interest confid valu divid conquer gener execut time size optim set divid conquer figur perform algorithm divid conquer divid conquer kick execut time confid smaller size partit primarili order algorithm bucket divid conquer optim scale valu vari domain size result experi optim support case shown figur execut time slightli linearli reason complex divid conquer algorithm max mk mk complex comput set linearli cost combin result partit final optim set complex quadrat find execut time algorithm linear quadrat found comput time time doubl note valu larger max major time spent combin result partit subsequ result quadrat execut time divid conquer optim emploi conclud remark gener optim support associ rule problem permit rule upto disjunct uninstanti numer attribut present dynam program algorithm comput optim associ rule complex number valu domain uninstanti attribut present optim significantli improv comput time memori requir algorithm bucket algorithm coalesc contigu valu confid greater minimum confid minimum confid divid conquer strategi enabl split origin problem multipl smaller subproblem combin solut subproblem show optim enabl dynam program algorithm execut larg valu domain size algorithm scale linearli domain size number disjunct studi sensit optim valu minimum confid dynam program algorithm comput approxim associ rule optim rule restrict case work techniqu reduc input size comput complex algorithm case hank korth avi silberschatz encourag comment earlier draft paper support imposs complet work refer rakesh tomasz swami mine associ rule set item larg proc acm sigmod confer manag page rakesh agraw ramakrishnan srikant fast algorithm mine associ rule proc vldb septemb takeshi data mine optim associ visual proc acm sigmod confer manag june takeshi mine optim associ rule numer attribut proc acm symposium principl june han fu discoveri associ rule larg proc vldb septemb brian jennif widom cluster associ rule intl confer data april verkamo effici algorithm discov associ rule aaai workshop knowledg discoveri page juli silberschatz cyclic associ rule intl confer data jong soo philip yu effect hash base algorithm mine associ rule proc confer manag san present strong rule wj knowledg discoveri page menlo rastogi shim mine optim associ rule categor numer attribut intl confer data ramakrishnan srikant rakesh agraw mine gener associ rule proc vldb septemb ramakrishnan srikant rakesh agraw mine quantit associ rule larg relat tabl proc acm sigmod confer manag june navath effici algorithm mine associ rule larg proc vldb septemb proof theorem procedur begin comput earlier return conf return return end complex algorithm simpli number time procedur invok multipli constant reason step constant loop step result call overhead step count number call arbitrari rectangl arbitrari show invok paramet time number rectangl complex algorithm show set paramet invok time observ rectangl invok invoc rectangl cut vertic horizont yield rectangl li number rectangl rectangl obtain stretch possibl stretch rectangl direct invoc result invoc bodi set input paramet execut input invok time proof induct size rectangl invok trivial shown comput optim binari space set unit rectangl confid rectangl optim set rectangl show rectangl algorithm comput optim binari space set algorithm comput optim binari space case optim set rectangl conf correctli set case conf optim rectangl largest optim set size support maximum optim set interest comput optim binari space exist horizont vertic cut cleanli partit optim due cut rectangl optim set cut consid set union optim set result support due induct optim support rectangl
DB/924 3 practic approach combin queri web roi jennif widom stanford abstract present approach combin queri facil tradit exist search engin web leverag result web search enhanc sql queri relat inform store enhanc explain web search paper primarili describ support relat demonstr util number interest queri result queri support enabl virtual tupl repres web search result gener dynam queri execut queri execut involv call search queri processor idl present lightweight techniqu call asynchron iter integr easili standard sequenti queri processor enabl concurr queri process multipl web search request asynchron iter broader applic open interest queri optim issu develop prototyp implement extend dbm virtual tabl asynchron perform result report introduct inform todai split structur data store tradit huge amount unstructur inform web tradit oper type languag sql oql enabl express queri million html page form vast unstructur amalgam inform web data index search search engin support fairli simpl queri paper approach combin exist strength tradit web search singl queri system stand queri queri languag practic exploit exist search engin augment sql queri relat enhanc explain web search basic architectur shown figur instanc queri tradit web search rout exist search engin user interact pose queri seamlessli combin web search tradit queri work support nation scienc foundat grant nasa grant keyword search web local sql googl search engin altavista user multipl instanc local figur basic architectur local inform includ state popul capit enhanc sql queri web search engin pose interest queri section rank state mention web rank state normal state popul rank state web phrase state capit web state top url state googl altavista url top url return state url perform filter data web enabl user write intuit sql queri automat execut web search relev queri combin search result structur data easili write interest queri requir amount program manual search web enhanc web keyword search inform inform addit inform state user search keyword phrase web correl phrase term identifi state movi web phrase find tripl underwat film support system techniqu present focu primarili queri leav detail explor futur work base introduc virtual webpag relat virtual tabl program tabl queri return tupl tupl store formal virtual tabl section suffic webpag infinit tabl web search url return search engin express thought aggreg view web search total number url return search engin express webpag av av denot virtual tabl altavista search similar virtual tabl googl search engin referenc virtual tabl sql assur virtual column defin search express bound answer queri sql detail queri execut clear call search engin requir obviou execut queri effici typic search engin latenc possibl modifi search engin accept special call paper show small modif convent queri processor exploit properti exist search engin queri process involv search engin kei observ latenc singl request high explicitli support queri processor idl request search engin web handl concurr request maximum queri processor issu web request concurr process singl queri discuss section tradit queri processor design handl requir configur modifi parallel queri processor achiev concurr parallel queri processor tend system design multiprocessor gear larg data set complex queri basic problem issu concurr web request queri limit scope requir tradit parallel satisfactori solut support introduc queri execut techniqu call asynchron iter concurr extern virtual tabl access integr easili convent relat system main contribut paper formal webpag virtual tabl integr exampl illustr power queri enabl discuss support virtual tabl exist system asynchron techniqu enabl relat queri processor execut multipl concurr web search singl queri discuss asynchron iter context gener queri process techniqu applic scenario open interest queri optim issu result prototyp show asynchron iter speed queri factor relat work approach bridg divid structur unstructur web wrapper system make inform web page act logic wrapper mean enabl express queri data necessarili design wrapper facilit integr data possibl heterogen wrapper web data tend requir html structur semistructur data model xml provid hope introduc structur web data queri vast amount inform remain continu queri search engin queri languag dynam navig extract data work differ invent queri queri combin result web search tradit structur data techniqu close relat report written execut optim techniqu sql queri integr extern text sourc main differ work aim minim number extern provid mechan launch call concurr techniqu complementari framework incorpor assum extern text sourc return search result unord enabl optim integr sql web search result optim gear extern text search return small common breadth web discuss approach coupl search engin web queri rewrit scheme automat translat queri call search engin predic effici queri integr search engin virtual tabl virtual tabl abstract search address issu extern form core paper integr extern relat optim ldl discuss gener problem creat optim queri plan extern sourc limit access pattern vari queri process capabl consid work data focu specif scenario type extern sourc web search queri capabl address situat extern sourc unavail queri multipl extern sourc rewritten sequenc increment queri subset queri result combin time form final result asynchron iter techniqu introduc share gener spirit comput portion queri fill remain valu techniqu oper finer involv queri goal enabl concurr process extern request handl unavail sourc section reli depend join suppli bind virtual tabl integr web search sql queri previou work optim effici execut queri involv depend join highli applic queri optim algorithm presenc depend join provid cach techniqu appli improv implement depend join discuss research discuss section preliminari complementari previou work approach enabl engin support concurr call extern sourc execut singl queri virtual tabl integr web search abstract web search engin virtual webpag string repres web search express refer valu bound queri process attribut unix printf style bound bound web search bind webpag attribut date valu return search engin search express url return search engin rank rank practic webpag queri tn default equal constant attribut thought search engin retriev url search express extrem addit network request initi prudent restrict rank constant rank constant thought input search engin simpl view webpag count total number page return search express web search engin return total number page deliv actual url interest queri note tupl gener dynam queri number column function queri queri bind column simpl keyword bind complic search infinit famili infinit larg virtual tabl conveni tabl default restrict rank includ assum default select predic rank prevent queri note virtual tabl view scalar input paramet output count webpag virtual tabl gener scalar number column number focu paper support gener case exampl section webpag write sql queri exampl present inform section addit virtual regular store restat write show small fraction actual result popul valu queri estim censu bureau queri issu altavista queri integr result altavista googl search perform octob queri rank state web select count order count desc note reli default result reader unawar texa michigan popul washington rank highli state queri exploit search engin featur avoid hit rememb current goal improv accuraci web search queri rank state normal state popul select order desc search engin googl explicitli support default turn repeat ident web search return slightli result exhibit minor differ result queri rank state web phrase select count corner order count desc recal default bound locat unit state person state refer point border utah note dramat count result queri state capit web state select capit limit text search half result due capit common queri top url state omit queri result compel select rank webpag rank order rank queri googl altavista url top url return state url select webpag av webpag googl googl altavista relev support virtual tabl exist system ibm informix support virtual tabl form give quick overview support option summar modifi abstract virtual tabl definit work system understand oracl expect support virtual tabl futur inform support virtual tabl product virtual tabl support tabl written java tabl function export number column support variabl number introduc famili tabl function handl number predetermin similarli queri tabl function iter support method close queri processor push select predic tabl function omiss appar prevent implement webpag tabl logic infinit number tupl requir select condit finit tabl function support paramet correl column tabl select tabl function singl paramet creat tabl function iter tupl pass tupl open method requir refer implement webpag requir search term suppli tabl function constant join syntax shown queri case pass restrict rank paramet tabl function informix support virtual tabl virtual tabl interfac unlik informix hook larg number function dbm modifi tabl informix virtual tabl scan access process select condit informix queri processor join virtual tabl column gener search express bound time queri processor scan webpag informix implement webpag mention implement scalar support queri process ideal virtual tabl tradit execut queri involv webpag extrem slow due call web search engin mention section optim reduc number extern cach techniqu import avoid repeat extern call approach extens queri involv webpag issu number search engin call high latenc search engin domin entir execut time queri tradit queri plan involv webpag forc issu web search queri processor idl request web search engin built support concurr tradit queri processor make poor resourc find issu concurr web search queri process parallel queri processor gamma volcano logic option heavyweight approach problem queri requir independ web search perform search parallel queri processor dynam partit problem correct launch queri thread process support concurr web search queri process problem restrict scope requir full parallel dbm remaind section describ asynchron queri process techniqu integr easili tradit queri processor achiev high number concurr web search low overhead discuss briefli section asynchron iter fact gener queri process techniqu handl high number concurr call extern sourc futur plan compar asynchron iter perform parallel queri processor rang queri involv call extern asynchron iter open interest queri optim problem asynchron iter start relat simpl tabl identifi acm special interest call rank sig web keyword select knuth order count desc result altavista count depend sig figur queri plan sig figur show queri plan queri plan assum execut model oper plan tree support close oper depend join oper requir call child includ bind left limit physic join techniqu varieti work describ hash cach techniqu improv perform depend oper extern virtual tabl scan assum work queri processor produc plan depend join scan virtual ibm section perform sequenc web search execut queri plan queri processor idl time queri processor issu web search overhead parallel queri processor small data tupl acm issu request achiev behavior asynchron techniqu involv asynchron version call physic queri oper call wait asynchron launch call complet global softwar modul call manag asynchron extern call gener idea modifi queri plan incorpor asynchron iter replac insert oper appropri plan oper commun global modul queri plan oper modifi support asynchron iter walk actual behavior asynchron iter queri plan figur comparison figur replac oper global tupl construct queri attribut mark special placehold serv placehold attribut tupl part incomplet sig pend call return call depend figur asynchron iter placehold identifi pend call miss pend call suppli true attribut call finish recal includ obei standard iter includ close method discuss turn oper queri plan work scan sort oper oblivi asynchron iter depend join standard oper asynchron iter dj tupl call open call turn contact regist extern call knuth uniqu identifi modul issu asynchron network request store request return case call return data simpli store hash tabl kei achiev regist call return dj result tupl count attribut placehold call identifi dj combin return tupl parent behavior open method call call open dj call dj buffer return tupl insid implement sake revisit momentarili coordin fill placehold return tupl parent problem variat standard synchron problem call call complet data store signal consum data signal locat incomplet tupl placehold local hash replac count retriev method call complet tupl wait signal return tupl parent note gener tupl depend pend call pass directli oper simpl implement open tupl gener dj buffer insid return tupl parent case larg join make make complet tupl parent exhaust execut child subplan queri execut question materi temporari result versu return tupl optim issu show section asynchron iter improv queri perform factor standard sequenti queri plan import issu discuss section extern call gener result tupl call webpag produc number includ number gener tupl call complet queri plan involv account possibl incomplet tupl buffer placehold pend call properli place oper relat queri plan correct maxim concurr monitor control resourc usag import issu asynchron iter assum queri execut safe issu unbound number concurr search request regul amount concurr prevent search engin number simultan request limit total number concurr outgo request prevent exhaust local network bandwidth simpl modifi handl add counter monitor total number activ counter extern destin administr configur counter desir call regist execut resourc call queue resourc free queu call execut applic asynchron iter delv detail remain technic issu outlin previou briefli broader applic asynchron iter paper describ asynchron iter specif context techniqu gener appli situat queri depend valu provid extern sourc extern sourc handl concurr queri issu independ call extern asynchron iter exampl primarili illustr case concurr request search sig webpag depend figur queri plan sig webpag asynchron iter implement web tabl thousand queri tabl fetch html url index find round exploit resourc burden extern sourc mention parallel queri processor achiev high level concurr offer asynchron partit tabl dynam small fragment spawn queri thread process issu thread highest perform web server thread http network request handl asynchron loop singl process implement modul asynchron iter similar enabl simultan call low overhead futur work plan conduct experi compar perform asynchron iter parallel dbm manag concurr call extern sourc tupl gener cancel previou center depend join yield match tupl virtual tabl return number tupl return call wait actual begin assum tupl result retriev top url sig select webpag rank join webpag gener tupl assum simpl queri plan shown figur previou gener search engin initi buffer tupl tupl wait buffer call complet return delet buffer sig depend depend figur queri plan sig webpag av webpag googl return fill attribut valu gener return dynam creat addit copi fill attribut valu sig mention web tupl ultim produc handl multipl queri plan involv multipl queri find top url sig search engin select webpag av webpag googl figur show queri plan maxim concurr request note placement merg oper discuss section bottom depend join gener placehold identifi call webpag av upper join augment tupl addit placehold call webpag googl buffer incomplet placehold call algorithm tupl gener end section appli case slight dynam copi tupl refer pend call incomplet tupl buffer queri find combin top url search nonetheless serv illustr point section wait complet call ca altavista call cg googl ca return make addit copi copi refer pend call cg copi cg tupl referenc cg updat queri plan gener recal convert queri plan asynchron iter oper convert oper ad plan section describ algorithm place oper plan primari goal introduc correct simpl algorithm attempt maxim number concurr web attempt maxim amount queri process work perform wait web request easi integr exist queri compil oper significantli alter cost queri effect queri execut time depend specif instanc result return search engin fulli address queri optim presenc asynchron iter broad problem scope paper intend focu optim futur work assum optim gener plan depend join asynchron plan produc optim input algorithm continu assum iter model plan oper describ step placement consolid insert recal convert oper input plan asynchron oper insert directli insert parent previou parent parent transform correct oper occur asynchron call block oper wait complet percol move oper queri plan time pull oper amount queri process work block wait extern call complet rewrit queri plan slightli enabl parent select predic depend attribut valu fill pull higher pull select predic join depend valu fill rewrit join select move actual algorithm base notion oper clash case pull denot set attribut valu fill oper call attribut valu substitut placehold clash depend attribut remov attribut aggreg existenti oper case oper clash attribut fill continu process case bit subtl project placehold call tupl cancel gener place extra tupl incorrect number duplic return case similar case aggreg existenti quantif requir accur talli incom tupl repeatedli pull oper oper check project pull parent clash rewrit select similar rewrit set union oper examin complet tupl perform duplic rewrit clash oper bag union oper percol algorithm termin oper pull plan order percol oper potenti effect final order adjac made irrelev discuss illustr percol algorithm exampl momentarili consolid find oper adjac plan point merg adjac oper perform singl oper manag multipl placehold valu tupl discuss section merg set attribut fill oper plan gener exampl show exampl demonstr placement algorithm point perform gain asynchron iter potenti pitfal current algorithm figur show placement algorithm gener queri plan earlier figur sig av googl queri omit queri plan figur show input simpl queri plan asynchron iter figur show plan convert oper insert directli figur show plan percol move depend join depend valu return webpag av pull parent sig sig sig sig depend depend depend depend depend depend depend depend figur gener queri plan sig webpag av webpag googl figur depend join final plan consolid shown figur queri processor process extern call sig concurr demonstr interest advantag asynchron iter altern simpli modifi depend join oper work chang depend join launch join input tupl approach provid maxim concurr simpl prevent concurr request multipl depend queri processor block join complet discuss section parallel queri processor queri perform depend join parallel requir nontrivi rewrit transform plan plan depend join children final join meaningless tabl introduc illustr select av googl figur show result run placement algorithm input plan perform virtual tabl depend join asynchron input plan perform join straightforward depend join implement send ident call googl sig incorpor local cach search engin result import plan asynchron iter plan figur tabl gener copi incomplet tupl av buffer patch depend prefer oper shown figur reduc total number attribut valu patch roughli factor larg block prevent concurr issu web request googl origin input altern place singl oper depend join contriv serv illustr challeng queri optim problem introduc oper case simpl placement algorithm perform section final tabl comput scienc field find url top url sig select webpag webpag sig sig depend depend depend depend figur queri plan mix depend join sig webpag depend depend sig depend depend webpag webpag webpag figur gener queri plan queri sig input queri plan shown figur note input plan join root plan implement hash join insert pull depend join pull upper rewrit join select section join depend attribut suppli pull figur show final plan sig tabl rewrit join big perform enabl queri processor execut extern call left concurr specif rewrit mistak illustr import issu sig url search engin assum moment sig sig tupl gener ultim cancel pull oper figur result unnecessari placehold tupl ultim empti gener return match tupl final result plan perform unnecessari queri processor wait true web search result continu exampl demonstr placement algorithm maxim number concurr extern call queri plan extern call domin queri execut asynchron iter provid dramat perform demonstr section potenti perform pitfal address complet queri optim incorpor asynchron manipul queri plan asynchron iter chang rel perform input plan asynchron version remain cheaper asynchron version oper buffer possibl fill miss attribut valu situat amount work requir offset advantag asynchron iter asynchron iter assum join result continu patch result join result turn approach perform work order pull oper move rewrit oper input queri replac join select addit work induc rewrit offset benefit addit concurr implement experi integr virtual tabl asynchron iter techniqu relat manag system call construct student stanford dbm support subset sql includ buffer queri execut design join techniqu queri optim user join order manual stabl sophist support experi demonstr potenti asynchron iter experi show perform improv run queri asynchron iter convent sequenti iter measur perform queri inher difficulti perform search engin altavista fluctuat depend load network delai control cach behavior repeat search ident keyword express run faster time mitig wait hour queri issu ident verifi empir long elimin cach behavior perform experi late night load search engin low consist order run experi wait hour templat queri instanti multipl version structur similar result slightli search issu templat synchron asynchron improv templat run run templat run run templat run run tabl result templat select count repres constant chosen pool common creat instanc templat constant pool time queri asynchron wait hour time queri standard queri processor repeat test queri instanc result templat shown tabl list result run time list averag execut time asynchron iter altavista altavista googl experi conduct sun sparc ram machin run suno comput connect internet stanford network templat select rank webpag queri issu search tupl webpag instanti templat ensur select distinct constant creat queri instanc prototyp join order order tabl queri join state join result webpag result shown tabl templat templat similar section ad constant creat queri instanti result shown tabl select webpag av webpag googl result show asynchron iter improv perform queri factor queri small local network cost domin result effect illustr improv offer asynchron iter queri involv complex local queri process larger speedup result experi highli depend sophist queri processor asynchron illustr section complex queri introduc optim impact perform futur work plan studi queri optim incorpor asynchron includ addit experi perform comparison altern approach parallel queri process creat simpl interfac user pose limit queri implement visit acknowledg serg abiteboul contribut earli jason mchugh comment initi draft paper berthold paul brown inform ibm refer abiteboul queri semistructur data intern confer januari ashish ca knoblock wrapper gener internet sourc sigmod bonnet partial answer unavail data sourc intern confer flexibl queri answer system page buneman semistructur data sixteenth acm symposium principl page tutori mediat data acm sigmod intern confer manag page june yan join queri extern text execut optim techniqu acm sigmod intern confer manag page san krishnamurthi open architectur ldl fifteenth intern confer larg data page august widom tsimmi integr heterogen inform sourc anniversari meet inform process societi page octob suciu queri languag xml eighth intern world wide web confer dj da rasmussen gamma machin project ieee transact knowledg data integr sql search engin confer larg page august suciu queri optim presenc limit access pattern acm sigmod intern confer manag page june jd widom system implement prentic upper saddl widom semistructur data migrat lore data model queri languag intern workshop web page june graef encapsul parallel volcano queri process system acm sigmod intern confer manag page atlant graef queri evalu techniqu larg acm comput crespo extract semistructur inform web workshop manag semistructur page yang optim queri data sourc confer larg page august jm hellerstein jf naughton queri execut techniqu cach method acm sigmod intern confer manag page june ibm sql refer version konopnicki shmueli queri system world wide web intern confer larg data page septemb ordil queri heterogen inform sourc sourc descript intern confer larg page septemb ao milo queri world wide web intern journal digit april ka morri algorithm order subgoal seventh acm symposium principl page effici portabl web server usenix annual technic june ullman queri translat scheme rapid implement wrapper fourth intern confer deduct page decemb widom object exchang heterogen inform sourc eleventh intern confer data page march mt lm mj wf pm thoma el wimmer garlic project acm sigmod intern confer manag page june pirahesh sql open heterogen data access acm sigmod intern confer manag page june mt roth pm schwarz dont scrap wrap wrapper architectur legaci data sourc confer larg page august jd ullman answer queri templat bind pattern fourteenth acm symposium principl page san distribut applic distribut virtual tabl interfac data engin unit state bureau censu state popul estim demograph compon popul juli juli decemb world wide web consortium extens markup languag decemb ullman optim larg join queri mediat system intern confer theori page januari
HCI/925 4 intellig technolog educ peter brusilovski carnegi technolog educ interact institut carnegi mellon pa usa paper review adapt intellig technolog context distanc educ analyz kind technolog easi implement place technolog educ introduct educ hot research develop area benefit educ classroom independ platform independ web coursewar instal support place thousand learner world equip kind comput thousand educ applic made web year problem network static hypertext page challeng research goal develop advanc educ applic offer amount adapt intellig featur import applic distanc student work intellig person assist teacher peer student provid normal classroom situat easi adapt import coursewar wider varieti student educ applic web coursewar design class user mind suit user earli dai number research team implement kind adapt intellig system distanc goal paper provid review work perform area review center adapt intellig technolog stai level technolog provid compat earlier paper adapt hypermedia adapt intellig technolog essenti wai add adapt intellig function educ system technolog finer grain techniqu correspond variat function wai implement section analyz kind technolog easi implement web discuss place technolog educ educ review technolog adapt intellig educ system kind system ai inherit earlier kind intellig tutor system adapt hypermedia system adapt intellig technolog appli ai system directli adopt area adapt hypermedia area long ai research produc origin technolog inspir web context technolog identifi section review exist technolog group origin technolog list exist ai implement variat technolog discuss wai implement web technolog educ intellig tutor system tradit area research investig problem develop ai goal knowledg teach strategi support flexibl individu learn tutor review exist intellig tutor system perform author identifi core curriculum intellig analysi student interact problem solv support technolog implement numer technolog problem solv ad set classifi function cover core set technolog consid subject turn classifi exist ai ai tradit technolog call report system constitut small stream insid area curriculum sequenc goal curriculum sequenc technolog refer instruct plan provid student suitabl individu plan sequenc knowledg unit learn sequenc learn task work student find learn materi classic system essenti kind activ passiv activ sequenc impli learn goal subset domain concept topic system activ sequenc build individu path achiev goal passiv sequenc call reactiv technolog requir activ learn goal start user solv problem answer question correctli goal offer user subset learn fill gap student knowledg resolv misconcept activ sequenc make distinguish system fix adjust learn goal exist system guid student fix learn goal set domain concept system adjust learn goal teacher student select subset set concept current learn goal system sequenc distinguish level high low sequenc knowledg sequenc determin learn set lesson taught sequenc task sequenc determin learn task current subgoal high low level sequenc perform mechan system mechan lesson select learn task lesson adapt select system system manipul order task problem question case call problem question sequenc sequenc popular technolog ai kind sequenc mention implement web activ sequenc domin type sequenc system vc prolog remedi multimedia perform passiv remedi sequenc activ sequenc hand system perform intellig high low level sequenc leav choic activ topic user vice leav choic topic user gener adapt sequenc problem topic system support sequenc fix learn goal system support adjust learn goal enabl teacher student kb select individu goal student goal subset domain concept project activ sequenc system driven student knowledg differ student knowledg global system experi prefer type media learn materi drive sequenc task topic interest case sequenc found system perform advanc sequenc educ materi adapt learn goal sequenc perform student start work system produc static adapt test system kind learn materi possess question thing gener adapt sequenc question assess student knowledg system incomplet natur compon distribut ai curriculum sequenc consid oldest technolog implement year technolog attent devot mainstream research center problem solv support technolog analyz problem solv support consid main duti deliveri sequenc educ materi perform system human includ educ materi set situat ai context educ solid amount educ materi structur main attract educ system context curriculum sequenc technolog import guid student hyperspac inform technolog natur easi implement knowledg locat server sequenc popular technolog ai problem solv support technolog mention problem solv support consid main duti system main technolog identifi problem solv support intellig analysi student interact problem solv problem solv support technolog student process solv educ wai intellig analysi student solut deal student final answer educ problem matter answer obtain consid solut analyz decid solut correct find wrong possibl identifi miss incorrect knowledg error function refer knowledg intellig analyz provid student extens error feedback updat student model classic tabl number ai implement intellig analysi student solut interact problem solv support recent move power technolog wait final technolog provid student intellig step problem solv level signal wrong give execut step student system implement technolog refer interact watch action understand understand provid updat student model classic technolog repres number ai problem solv technolog newest technolog student solv problem articul suggest relev success problem solv case earlier experi exampl explain problem solv web technolog implement area tradit interact problem solv support technolog absolut domin interact problem solv support ultim goal intellig analysi student solut consid imperfect base problem solv support rare web context situat intellig analysi student solut base problem solv support natur web context technolog passiv student easi implement web cgi interfac standalon easi port web implement cgi gatewai standalon program technolog implement web import benefit technolog web context low requir interact browser server problem solv cycl import case slow internet connect technolog provid intellig support interact technolog technolog domin web context power interact hungri interact problem solv support interact problem solv support technolog technolog migrat web problem approach implement cgi interfac older standalon pioneer system work properli technolog illustr system trial implement interact problem solv support web system interfac standalon practic algebra tutor system cgi interfac web version system provid button student feedback system ad essenti student slow internet possibl request feedback perform problem solv step move categori intellig problem subcategori analyz capabl analyz incomplet solut belong intellig analyz subcategori tradit analyz interact tutor tabl mark keyword consid real interact real interact tutor expect activ sleep request monitor student instantli react error simpli implement tradit cgi interact requir interact base java java technolog matur recent year ago review prospect platform ai mention system java reliabl solut interact tutor java offer solut solut tutor implement complet java java applet work java applic solut distribut tutor part function implement java work client part work server side part commun internet pure java solut simpler languag build architectur offer attract choic develop tutor definit choic port standalon interact tutor web demonstr intellig function earlier standalon tutor chang applic develop thin java client implement interfac function commun intellig server event small newli implement interact tutor easili implement pure benefit architectur reason central student model overhead approach distribut big java natur support wai commun architectur popular year standard implement interact tutor implement kind highli interact ai exampl implement interfac anim pedagog agent vincent adapt hypermedia technolog educ adapt hypermedia research area adapt hypermedia system appli form user model adapt content link hypermedia page user distinguish major technolog adapt adapt present adapt navig support educ main applic area adapt hypermedia number standalon adapt educ hypermedia system built ai adapt hypermedia technolog report web primari platform develop educ adapt hypermedia system goal adapt navig support technolog support student hyperspac orient navig chang visibl link adapt navig support consid gener curriculum sequenc technolog hypermedia context share goal student find learn materi adapt navig support option tradit guid student directli indirectli www context hypermedia basic organiz adapt navig support natur effici wai adapt link exampl standalon system adapt hide adapt annot adapt hide adapt sort wai popular ai direct adapt link adapt link hide direct guidanc impli system inform student link current page drive page hyperspac page decid basi student current knowledg learn link page present current system gener dynam link adapt navig support direct guidanc curriculum sequenc technolog differ addit page suggest direct guidanc technolog page exist hyperspac student reach page step system guidanc guidanc student realiz page fast adapt sequenc task present complet gener system student wai materi sequenc direct guidanc appli level sequenc mechan comparison sequenc page simpli select set accept page heurist refer sequenc page sequenc provid good exampl technolog differ technolog start disappear web context system natur move hypermedia platform repres part learn materi hyperspac long type educ materi repres set node sequenc indistinguish direct guidanc stress similar repres adapt sequenc adapt navig support direct guidanc column tabl popular form web annot appli descend system kb adapt navig support sort popular technolog hide disabl variant hide link visibl user proce page link page readi option make link complet user click remedi multimedia system show user list page read goal page tabl list major system adapt navig support type adapt goal adapt present technolog adapt content hypermedia page user knowledg inform store user model system adapt page adapt gener assembl piec user adapt present expert user receiv detail deep novic receiv addit explan adapt present import www context suit student ae implement adapt pt aha system appli flexibl condit text techniqu system adapt present special context gener adapt summari book chapter gener special prefac content page depend student page descend adapt present provid adapt insert warn educ statu page page readi ast insert textual warn end insert warn imag form red bar interest adapt present suggest project individu present inform educ hypertext perform agent technolog educ group technolog excit technolog root educ system group includ technolog call technolog student model match simpli model essenc technolog abil analyz match student model student time tradit adapt intellig educ system opportun explor technolog work student student time context opportun natur student record store central server administr excel framework develop adapt intellig technolog make match student model student identifi exampl student model call adapt collabor support intellig class monitor exampl differ consid technolog student model match group adapt collabor support adapt technolog develop year develop network educ system goal adapt collabor support system knowledg student form match group kind collabor pioneer exampl adapt collabor support year exampl includ form group collabor problem solv proper moment time find compet peer answer question topic find person model show good knowledg year ago brusilovski predict adapt collabor support popular technolog predict true immedi list real exampl adapt collabor support context group extend origin technolog develop system context intellig system similar system develop evalu central florida addit group pioneer work adapt collabor support recent suggest complet framework implement intellig support techniqu distribut educ framework natur support origin adapt collabor support techniqu framework explor model match techniqu intellig class monitor base abil compar record student search search mismatch goal identifi student learn record essenti peer student wai cold progress simpli access materi student teacher attent challeng provid explan push regular classroom teacher simpli track student attend activ find student special attent teacher case log data tabl number hard grasp identifi small subset student import commun teacher student time consum distanc teacher simpli individu address small subset class system interest fuzzi mechan identifi deadlock student classroom time intellig class monitor technolog author adapt intellig technolog educ clear familiar adapt intellig technolog enhanc side educ system adapt present improv usabl materi present adapt navig support adapt sequenc control student select relev test assign problem solv support intellig solut analysi significantli improv work assign provid interact intellig feedback grade load shoulder model match technolog enforc administr distanc commun collabor student teacher adapt intellig technolog found place virtual part real coursewar hundr distanc student system discuss typic teach real distanc class rest hand system aha small class dozen commerci web coursewar system hundr real distanc appli adapt intellig technolog research practic educ area merg posit author educ young compani produc educ system compet market simpl system number research level system demonstr benefit adapt intellig technolog long competit market educ system import factor win custom tradit educ compani start includ adapt intellig function research team solid experi adapt intellig technolog found startup compani bring technolog market technolog commerci system sequenc technolog sequenc question match current structur educ system turn adapt navig support model match problemsolv support technolog stai research level expect market small tutor aim support teach fragment subject hope year show number exampl adapt intellig system excit develop research level system ref adapt sequenc adapt navig support problem solv support intellig solut analysi adapt present page annot partial server test remedi vc prolog tutor remedi annot partial server annot partial server server tabl adapt intellig technolog educ system combin adapt hypermedia function system ref adapt sequenc adapt navig support adapt present page annot ast annot test annot annot ac annot hide remedi multimedia system remedi hide pt hide aha annot hide annot page kb annot tabl adapt intellig technolog adapt hypermedia system system ref adapt sequenc remedi task topic question problem solv support problem java intellig solut analysi partial server java wit server java java java server java java adel java partial java tabl adapt intellig technolog system refer deploi intellig tutor architectur intern journal artifici intellig educ onlin lisp tutor byte present agent educ applic web proc workshop educ system world wide world confer artifici intellig onlin concept level model www proc workshop educ system world wide world confer artifici intellig onlin comput tutori stanford project intern journal studi intellig tutor system web proc intern www confer fraunhof institut comput graphic method techniqu adapt hypermedia user model adapt interact adapt educ system world wide web proc workshop trend applic artifici intellig world congress expert mexico educ tool develop adapt coursewar comput network isdn system intellig learn environ user proc interdisciplinari workshop complex learn comput environ onlin distribut intellig tutor web du artifici intellig knowledg media learn system amsterdam intellig tutor system world wide web intellig tutor system lectur note comput vol springer berlin foundat intellig tutor introduct foundat intellig tutor system lawrenc erlbaum hillsdal enhanc student learn incorpor student learn style adapt hypermedia proc world confer educ multimedia aac learn media adapt educ proc workshop system user model world wide intern confer user carnegi mellon onlin onlin de open adapt hypermedia architectur review hypermedia multimedia de teach hypertext hypermedia web journal comput scienc onlin deliveri navig support proc world confer web san aac intellig tutor basic anatomi proc world confer internet aac einer für die technisch universität support peer collabor distribut workplac environ intern journal artifici intellig educ onlin intellig support intellig tutor system lectur note comput vol berlin adapt constructivist teach intelligenz adapt hypertext system exploratori learn program user model interact multipl student model parametr group learn proc world confer artifici intellig aac opportunist group format artifici intellig knowledg media learn system amsterdam pen base user interfac www client proc aac user model custom hypertext intellig advanc techniqu world wide web lectur note comput vol berlin educ environ proc intern world wide web confer onlin intellig learn environ simplex algorithm proc intern confer comput aid learn instruct scienc sweden peer workplac train artifici intellig knowledg media learn system amsterdam effect automat assign peer role distanc school comput central florida onlin preliminari framework adapt hypermedia proc workshop intern confer intellig tutor system san tx onlin intellig tutor system integr learn environ distribut hypermedia proc world confer educ multimedia aac architectur intellig tutor system www artifici intellig knowledg media learn system amsterdam search deadlock web learner measur similar learn activ proc workshop intern confer intellig tutor system san tx onlin implement intellig tutor system web educ technolog research autonom pedagog agent train intellig tutor system lectur note comput berlin der ein intelligenz internet base evalu system artifici intellig open learn environ io amsterdam pat tutor web proc workshop educ system world wide world confer artifici intellig onlin creat versatil intellig learn environ architectur lectur note comput vol springer berlin empir evalu tutori agent proc world confer educ multimedia hypermedia world confer educ aac pedagog agent web proc intern confer autonom acm press onlin ac adapt coursewar environ review hypermedia multimedia adapt statist proc workshop system user model world wide intern confer user carnegi mellon onlin onlin curriculum sequenc tutor intellig tutor system lectur note comput berlin architectur intellig collabor educ system artifici intellig knowledg media learn system amsterdam dynam gener www artifici intellig knowledg media learn system amsterdam anim data structur intellig tutor system put interact tutor www proc workshop educ system world wide world confer artifici intellig onlin individu select exampl intellig learn environ journal artifici intellig educ trier onlin user model adapt navig support tutor system user model wien develop comput assist languag learn system write natur languag process studi passiv voic proc workshop educ system world wide world confer artifici intellig onlin
DB/926 3 tempor web repositori campo silva research group departamento de informática de da universidad de lisboa campo portug abstract web data applic process larg amount web data short time paper present web repositori model support object version distribut oper kind applic version applic save time dimens enabl develop web applic distribut parallel oper massiv amount data present prototyp implement versu result collect analisi execut distribut web crawler simul implement versu applic introduct web great person enhanc amount data vast true potenti har tool special aid user summar mine data handl larg amount applic bandwidth applic solv user queri long download data inform user store reason copi inform time bandwidth save data process applic seek store larg portion web web bot download inform web robot proprietari outdat solut store web data tightli coupl robot readili usag applic effici implement web applic deal web data scalabl capabl hold larg amount high satisfi user applic work motiv storag system offer high perform manag filesystem interfac manag web interfac web goal provid support automat perform retriev larg quantiti data web repres huge comput requir advanc techniqu address scale problem applic retriev save data built tightli coupl storag system storag framework develop highli distribut load process instanc applic manag web resourc applic manipul web data requir document retriev web url document modif storag system provid method store retriev element document save histor data histori relev applic care unavail document current interest portion web time ago storag provid access method enabl user applic respect time paper present implement model web data repositori satisfi function architectur requir proof concept model present implement work prototyp versu design model store manag web data prototyp system implement versu model paper organ section present research work relat section present versu model distribut section detail prototyp implement measur made section present direct futur work relat work section present research topic relat versu comparison versu system present scope paper version model power mean repres evolut object time earli emphasi version system research support comput aid design system web data collect similar cad engin data collect time bandwidth relat link integr data form complex object page site part collect web relat part version model provid semant extens support organ engin data includ unifi concept manag structur inform chang time versu version oper distribut author version set extens http protocol enabl user collabor edit manag file remot web server webdav protocol enabl web server web data exchang data tool protocol long prevent user write resourc merg webdav enabl server design hold amount data aim hold versu web repositori data store design hold web data develop support search store data build rank implement hold larg portion architectur design hold entir visibl web repres repositori design maintain larg share repositori data download web main focu optim data store separ manag system found manag bottleneck system perform find detail manag save relat system specif tailor support web crawler aim develop gener repositori support applic aid differ engin enabl user track internet system explor storag offer navig tool analyz differ web page time differ engin support central version repositori store version document comparison futur data save repositori control system format save relat goal internet archiv build internet librari offer access collect digit format main focu long term preserv select content access collect item focu provid access method parallel manipul collect data versu model process larg quantiti inform web involv integr data multipl summar mine web data kei scale heavi data process oper li distribut load parallel task perform distribut support storag system cope complex partit work physic distribut data schedul work unit provis method access distribut data fusion independ process part form coher view approach li adopt version workspac model data enabl parallel applic process larg collect web page versu support concurr version distribut typic usag scenario applic high data interact distribut web crawler run separ collect document part crawler deliv integr archiv collect document run context applic depict figur storag server root crawl page start crawl web consist download extract link referenc download page thread exchang data storag server ensur document process thread upload document obtain storag make applic requir identifi requir versu local storag processor inform sourc storag server high bandwidth low process node figur run context applic versu storag server hold data share transact run applic transact run process node data process local time consum data transfer process node storag server parallel data process process node support partit work disjoint unit process separ support concurr updat disjoint subset support integr result process provid enabl thread exchang inform applic avoid duplic support storag larg amount ultim archiv larg portion entir enabl read store inform transact process support period partial updat store refresh stale data item maintain relationship inform document equal store save storag space share content enabl view past state provid time dimens store data assumpt design versu model base inform space partit disjoint subset process perform overhead introduc commun synchron independ part comput larg parallel execut thread applic suppli repositori function partit data process unit function reconcil conflict data gener unit independ work unit applic specif assumpt implicitli state versu suit applic profit parallel process assumpt state independ work unit applic detect reconcil inconsist process perform independ work unit concept present main concept versu model workspac workspac bound independ environ applic thread appli transact subset data minim interact data subset process client defin kind group archiv privat storag applic thread privat workspac independ resid processor parallel thread access repositori gener result applic instanti privat workspac group integr partial result gener client privat workspac applic thread process archiv data instanti group workspac conflict consolid data privat workspac group workspac versu mechan handl conflict archiv store data perman version histori data reconstruct earlier view data ¢ ¢ ¢ £ £ £ £ £ £ ¤ ¤ ¤ ¤ ¤ ¤ ¥ ¥ ¥ ¥ ¥ ¥ ¢ ¢ ¢ ¢ ¢ ¢ £ £ £ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ ¥ thread data applic data check check archiv data thread data archiv workspac group workspac privat workspac figur versu support class group privat workspac figur depict archiv workspac hold data set partit subset applic group workspac data set thread concurr subset process check back archiv workspac append data store archiv workspac updat delet data pass workspac oper step figur applic instanti group data archiv applic fork parallel parallel thread start privat workspac check data finish thread check result group workspac restart data applic result group workspac archiv workspac layer versu data collect object organ layer layer storag unit capabl hold singl version object store workspac workspac object layer workspac activ layer object ad workspac activ layer transact save object layer activ layer layer repres integ monoton increment repositori versu repositori set increment activ layer number automat manual set automat layer current layer increment version object exist current layer version ad layer repositori set manual increment current layer addit object exist layer deni error layer store time dimens show partial order object manipul oper repositori manual increment applic infer object store layer mean insert repositori layer activ layer version version model storag instanc object save instant time store evolut state enabl applic view repres world point time web repres save easili refresh applic version model web data refresh part repres data maintain coher fresh fresh data applic work view search engin built top repositori latest version web differ engin read version document track chang versu assum version version object version layer uniqu version version object distinct layer order layer number deriv older version object associ versu design process web object view label node object instanc edg associ object edg label denot associ type object save versu repositori model properti set stream data stream data save manag extern versu object repres versu tupl object identifi object chang version object object relat type model rich associ exist real world object relationship type object object repres tupl anchor target associ type partit data unit partit workspac defin workspac disjoint subset call subset form partit strict data simpli strict unit predic check data workspac applic disjoint subset data object check applic object advanc identifi object turn imposs applic applic set object predic predic function object return true belong oper applic predic object workspac defin unit repositori test suppli predic candid return satisfi predic thread perform transact object identifi start letter function repositori return true object start repositori evalu function object workspac find predic defin versu applic applic knowledg data process independ subset predic defin workspac obei invari object workspac satisfi predic defin simultan workspac object workspac satisfi predic satisfi predic time invari impli predic depend object attribut updat applic function properti object invari strict data unit strict data unit repres set data check transact partit vari predic predic applic size data unit applic depend minimum granular singl object invari impli data unit defin partit disjoint union strict data unit workspac repres set object workspac work unit work unit strict data unit workspac check result oper execut object work unit back valid work unit definit creat data unit letter make object letter identifi match work unit letter part data unit polici gener work unit independ appli empti workspac thousand object partit work unit definit compli repositori object id match start object id letter id belong data unit check work unit data unit data unit strict data unit object relationship version belong strict data unit version ad work unit object ad work unit satisfi predic defin strict data unit origin directli relat object strict data unit figur repres relationship work unit workspac work unit ident strict work check object satisfi predic origin unit object squar figur satisfi predic data unit data unit condit ii iii iv time group workspac privat workspac figur illustr data process versu group workspac object shape oper perform applic partit base object shape line partit squar work unit circl data privat workspac object updat object cross data check back origin group workspac oper updat applic check work unit object privat modifi object check work unit back intuit mode oper massiv process larg collect make concurr copi object separ data manipul isol reconcil collect present semant oper workspac oper data conflict gener addit object work unit isol difficult object strict data unit check crawler collect page work privat workspac check work unit object download web page find link page save satisfi predic proper work unit handl work unit time mitig data belong current strict data unit check insert work expand data unit insert object albeit satisfi strict work direct associ object strict work unit insert object belong strict work unit insert updat data strict work unit gener object data unit check workspac thread concur object condit insert object belong strict work unit gener parallel process insert object isol reconcil conflict automat resolv transact data unit workspac determin appli predic work unit sourc workspac oper unit defin predic sourc workspac gener sourc workspac target gener oper oper unit reserv modif sourc workspac unit ad set unit target workspac object sourc workspac satisfi relationship sourc workspac anchor target object check copi target workspac relationship object belong check unit object belong unit thread work target workspac access relationship applic requir access relationship defin partit gener unit big transact data work unit time copi relationship involv object strict data unit privat applic oper privat workspac relationship object workspac conflict resolut implement conflict resolut polici repositori forc applic resolv specif conflict satisfi specif web versu defin conflict manag interfac applic implement solv conflict save conflict data destin relat type target content object id kei version origin layer kei version object figur class model data handl repositori conflict manag function candid save repositori gener merg candid work data check workspac account exist data conflict exist data function workspac wx return result check wx effect result set object consist object exist object exist belong strict updat isol object identifi conflict resolut exist object belong remain exist satisfi predic result relationship relationship exist relationship updat relationship lock creat unit check data model figur show uml class model data handl versu repositori main object destin id uri relat type version content origin kei kei kei figur simpl model web repres class model figur version snapshot object instant time save repositori layer content repres state object version download web page layer storag unit capabl version object properti version object properti version properti download date web page object abstract aggreg version real world object properti common version object relat direct associ instanc object object instanc target field relat object target associ instanc chosen applic target relat fill target version identifi class model gener enabl manag kind save data simpl model data download web repres versu class shown figur resourc data refer place download repres act attempt download resourc download result stream stream save content download attempt download log temporari statu record field properti kei download date record respect properti resourc properti chang repres host serv resourc download data refer download data html link repres relat link download resourc resourc target attribut remain resourc target attribut fill target download link extend save whichev implement addit properti system architectur versu applic librari run client applic process run repositori librari implement versu api access data structur method distribut applic base versu model access invok call repositori oper result oper data store visibl assum distribut techniqu appli data manag distribut file file versu workspac group share data store data storag support extern process gener system architectur illustr dualiti data manag shown figur store relat distribut manag processor run processor workspac basic distribut workspac workspac visibl run distinct interfac workspac map connect map workspac respect visibl rule object repositori view archiv applic applic gw aw pw pw gw pw pw pw gw aw applic address space db db db db db filesystem figur data manag versu gw pw group privat workspac workspac interfac workspac share workspac share data storag applic process includ link privat privat group workspac data storag storag object applic view group workspac initi thread applic view privat workspac implement polici archiv workspac implement optim hold larg amount data perform big applic access archiv data creat applic start initi group workspac applic run applic data held workspac discard applic end insid applic thread insid applic creat privat workspac creat optim quickli perform small hold limit amount data discard thread end result valid versu model built prototyp data manag implement applic manipul versu data java api manag code written sql dbm independ prototyp major softwar access distribut data provid nf file group archiv workspac run oracl dbm privat workspac run dbm measur perform prototyp detect bottleneck provid inform valid versu model optim implement versu prototyp run applic simul web crawler measur hardwar configur group workspac run pentium ram privat workspac run machin rang pentium tabl averag time complet phase crawl web site machin measur idl group workspac load object version crawl total pentium pentium ii pentium iii averag processor mhz ram pentium processor mb ram process crawler simul web homepag group workspac privat gener web page site privat workspac check result back group workspac gener web page random stress perform independ bandwidth retriev data internet tabl show averag time check simul crawl site gener document kbyte refer final check result group workspac versu equat creat object version properti relationship averag row tabl show amount time complet run cpu time spent spent execut oper spent time spent compar amount time perform crawl central repositori time repres overhead distribut recov parallel execut crawl crawl oper perform run comput due high number versu api call access privat workspac figur repres time spent process version function size work unit number object version applic scenario analysi work unit size variabl check time remain constant copi object version homepag time spent check unit grow number unit check size privat workspac slow read oper time spent process version show work size affect process data total crawl figur time process object version function number version data unit privat workspac figur show optimum work unit size version result valid conflict resolv time result valid exist prototyp chang improv expect shape obtain curv optimum work unit size applic depend differ presenc conflict conflict resolut polici adopt preliminari result show versu prototyp process version minut run network processor execut web crawler simul parallel group workspac version run crawler simul processor time obtain process time version minut show parallel execut applic top versu pai ideal linear optim deeper time spent versu investig scalabl limit relat implement futur work paper present model repositori web support version distribut oper versu workspac distribut data processor involv ing data versu assum data set partit disjoint unit process independ potenti perform assumpt parallel process independ data unit gener manag number conflict provid method resolv merg data unit distribut applic client applic partit data unit assign processor modular architectur implement versu model present implement versu api java librari built softwar compon present initi perform evalu result prototyp conjunct simul stress usag pattern real web data process applic futur work versu includ detail studi versu compar result technolog albeit overlap versu adapt tackl requir applic target domain lead optim prototyp implement area interest studi feasibl develop webdav interfac refin versu object version xml element granular refer altavista rfc nf version protocol specif sun june thoma anderson michael david patterson drew randolph wang network file system acm transact comput system februari thoma ball dougli internet differ engin applic spring mike crawl build archiv world wide web web techniqu fred thoma queri navig web repositori comput intern web confer fred thoma internet differ track view web world wide googl harvest web index jun hector andrea paepck repositori web page web engin home page juli internet build jame whitehead jr network protocol remot collabor author web susann morten european confer comput support cooper septemb randi katz unifi framework version model engin acm comput smith truth web web techniqu danni sullivan altavista region list left rot search engin septemb walter evalu control system intern confer softwar septemb page ieee comput ieee comput septemb webdav resourc
ML/927 6 evolv swim control simul inspir neurobiolog accept public adapt behavior jan john hallam david willshaw dept artifici forrest edinburgh centr cognit edinburgh abstract paper present neural swim control simul develop evolutionari algorithm genet algorithm evolv architectur connectionist model determin muscular activ simul bodi interact water work inspir biolog model develop reproduc central pattern gener observ real evolv artifici demonstr genet algorithm interest design techniqu neural control exist altern solut biolog connect varieti neural control evolv produc pattern oscil swim pattern modul extern excit appli network order vari speed direct swim evolv control cover larger rang phase lag speed swim model show techniqu evolv artifici solut interest tool develop neurobiolog model biolog plausibl control develop rang oscil frequenc closer observ real model neural genet central pattern introduct locomot import aspect live control movement extens studi biolog scienc engin neurobiolog shown effect motion control present anim kingdom interconnect creat oscillatori activ motion adapt dynam environ sensori inform control gener distribut present remark robust flexibl inspir interest appli artifici neural network control abstract mathemat model neuron process signal control advanc neurobiolog robot point model biolog control directli implement robot al neural control inspir insect control walk robot al al robot benefit biologi sourc inspir solv control neurobiolog return benefit experi receiv evalu capac biolog model produc specif behaviour interest interact artifici neural network techniqu investig comput perform central nervou system develop neurobiolog model adapt backpropag algorithm develop biolog plausibl connectionist model reproduc local bend reflex sejnowski evolutionari algorithm popular design techniqu artifici neural network al yao recent develop model singl cell wilcox research interest biolog inspir neural locomot control autonom agent develop control genet algorithm studi simplest form motion gener travel fin type locomot present basic featur natur motion creation modul set oscil characterist frequenc phase lag work inspir connectionist model swim control develop artifici control evolv connect synapt weight neuron similar model interest evalu effici ga design neural network produc pattern oscil activ modul simpl input signal applic design techniqu automat gener neural control swim robot interest investig exist altern neural configur biolog found studi provid insight characterist central pattern gener gener investig ga tool neurobiolog evolutionari process instanti variabl synapt weight connectionist model connect behaviour correspond neurobiolog observ firstli present current knowledg swim control connectionist model made develop altern solut evolutionari firstli evolut segment evolut coupl set segment evolut sensori feedback stretch sensit cell ga develop biolog repeat evolut ad constraint encod order evolv control preserv segment connect observ biolog background connectionist model earliest simplest vertebr pair fin swim propag head tail network neuron locat spinal cord control motion extens studi al al al physiolog experi isol spinal cord shown network neuron central pattern gener mean gener pattern oscil oscillatori excit brain sensori feedback al small part spinal cord isol produc oscil subject excitatori cpg consid interconnect local oscil complet control form approxim segment cpg produc oscil frequenc vari maintain constant wavelength length frequenc chang cpg control swim model level connectionist abstract oscil level model realist neural model demonstr current state knowledg suffici produc model result physiolog observ al al connectionist model cpg william realist neuron model captur main featur abil chang frequenc action potenti spike depend sum activ total demonstr connect suffici produc oscil pattern observ real complic neuron mechan abstract swim control model chain mathemat oscil order studi kind coupl produc phase relat segment constant spinal cord remain fix proport cycl frequenc oscil chang william work present situat connectionist level connectionist model advantag abstract simul complet cpg spinal mechan simul bodi requir comput time paramet choic time concret give interest insight function cpg real mention connectionist model produc oscil pattern observ real connectionist model made model cpg similar control robot al learn design directli applic design control swim instanc reproduc connectionist model model inspir work biolog model evolv control compar refer biolog model model combin simul neural control mechan simul water direct evalu neural activ transform mechan movement offer possibl investig effect sensori feedback mainten constant wavelength larg rang frequenc interest aspect cpg mean phase lag segment maintain constant proport period oscil time delai segment vari depend frequenc lag segment due delai conduct descend fix veloc conduct stretch sensit cell present model give quantit result paper present qualit behaviour compar perform evolv swim control neural control interconnect segment network segment network oscil made excitatori inhibitori inhibitori neuron unit model repres popul function similar neuron real neuron receiv excitatori input weight segment connect tabl complet control form interconnect copi segment network interconnect consist extend connect neuron segment neuron neighbour segment interconnect simplifi symmetr extens connect extens cin project neuron unit model integr satur transfer function output correspond fire frequenc popul repres calcul synapt repres group excitatori inhibitori neuron delai excitatori inhibitori input repres frequenc adapt observ real neuron paramet type neuron tabl connect weight tabl defin simul model fit physiolog observ segment network receiv adequ excit oscil regularli left neuron phase frequenc oscil level excit interconnect segment lead travel wave oscil segment receiv extra excit compar lag segment rel period oscil constant spinal ten segment extrem lag vari amount extra higher extra larger lag shorter frequenc oscil wavelength chang independ model reproduc capac real cover rang frequenc oscil wavelength constant simul show frequenc phase lag segment travel period obtain wavelength smaller reproduc mechan model bodi interact water bodi made rigid link connect freedom mechan link neural segment muscl connect link model combin spring damper muscl spring reduc rest length water obtain travel wave neural activ transform travel bodi head tail propag lead forc surround water propel fish forward simul biolog model rang frequenc phase lag neural control highest speed simul reach oscil hz rel lag segment mechan simul direct evalu effici cpg control swim term speed studi effect sensori feedback edg cell locat side spinal cord di al cell model output signal proport local curvatur bodi effect edg cell control neglig low synapt al shown feedback cross speed barrier local speed opposit direct coordin neural activ actual movement bodi prevent chang direct evolv central pattern gener develop altern swim control ga defin suitabl connect synapt weight neuron similar model similar neuron model directli compar perform evolv solut biolog model control evolv stage segment oscil control gener evolv coupl copi chosen segment connect provid sensori feedback cell ad stage requir simul neural activ simul control mechan simul bodi interact water decomposit stage motiv properti biolog control reproduc segment network oscil independ isol sensori feedback control produc coordin travel wave oscil complet isol spinal cord indic sensori feedback coordin role feedback stretch sensit cell coordin neural activ actual movement bodi disturb environ stage includ simul speed barrier cross sensori feedback provid cpg correct mechan valu obtain speed swim approxim smaller quantit exampl qualit behaviour simul ident al detail head muscl muscl tail ec ec ec ec ec ec ec ec mn ein lin lin ein mn cin cin mn ein lin lin ein mn mn ein lin lin ein mn mn ein lin lin ein mn cin cin cin cin cin cin figur biolog control control made interconnect segment oscil segment neuron type neuron present type cin lin mn control receiv feedback stretch sensit edg cell ec dash line project segment connect segment text tabl explan bs tabl biolog excitatori inhibitori connect repres posit neg weight left neuron bs stand brain stem number segment connect segment direct bracket neuron type ein ms ms cin ms ms lin ms mn ms tabl neuron time constant coeffici frequenc adapt time constant frequenc adapt control evalu depend abil control swim order obtain similar perform biolog defin goal evolv ffl product stabl oscil spinal ffl gener phase lag ffl frequenc oscil depend global ffl lag segment depend proport extra excit ffl independ lag ffl larg rang lag speed ffl capac incorpor sensori feedback stretch sensit cell cross speed barrier evolutionari segment oscil segment oscil gener evolv connect neuron biolog segment sign qualiti solut evalu depend abil produc regular oscil frequenc vari level excit brain stem brain stem sign gene ein lin mn cin figur encod segment network encod chromosom repres connect neuron biolog model number neuron dynam paramet equat fix sign neuron synapt weight connect evolv symmetri chromosom string gene real number sign gene defin inhibitori excitatori excitatori gene directli encod synapt weight correspond linear real depend sign gene inhibitori sign gene smaller chose neuron inhibitori excitatori neuron inhibit excit order develop network constraint biolog biolog neuron emit excitatori inhibitori excitatori final gene chromosom determin synapt weight connect brain stem correspond real weight boundari defin includ rang weight biolog model note denomin cin lin distinguish type neuron dynam equat lose mean descript function sign neuron biolog model genet algorithm algorithm variat standard ga instanc usual binari encod replac real number encod algorithm start randomli gener initi popul fix number children gener mutat prune crossov oper coupl breed creat coupl children crossov prob simpli copi parent mutat oper mutat gene children probabl prob mutat consist ad small random number mutat rang rand rand random number prune oper appli randomli prune connect prob set gene null weight children size popul constant worst solut popul popul ga paramet evolut segment oscil tabl popul size number children crossov probabl mutat probabl mutat rang prune probabl tabl ga paramet evolv segment oscil evalu defin fit function reward desir characterist segment product regular oscil peak activ period left neuron phase frequenc oscil vari monoton level extern excit minim set connect al evolv fulli connect weakest connect prove unnecessari creation oscil remov affect neural activ mathemat definit fit function appendix solut evalu simul time asymmetr initi condit left neuron network oscil simul level extern excit carri order determin rang frequenc note evalu fit segment oscil base neural activ neuron influenc muscular activ mean activ solut fewer activ neuron develop result carri evolut popul chromosom evolut stop arbitrarili chosen limit suffici solut run reach fit higher evolut start randomli gener initi popul neuron randomli chanc result network oscil solut initi gener solut produc regular fix frequenc evolut converg final popul network produc regular oscil variabl frequenc biolog frequenc oscil amplitud signal level excit oscil receiv stai excit level high asymmetr state activ inact fittest solut run cover larger rang frequenc biolog reach lower higher frequenc result summar tabl ten run converg network solut similar fit valu al detail descript evolv solut differ sign number neuron activ creation oscil evolut converg network activ neuron solut inhibitori type creat oscil demonstr excitatori connectionist product oscil larg frequenc rang inact neuron due high chanc inact receiv strong excitatori input converg similar configur base ident oscil structur permut due symmetri inhibitori ein cin variat valu connect solut connect similar strength present behaviour figur show simul configur evolv oscil differ significantli biolog segment control solut present strong similar solut number sign biolog model connect note random configur oscil receiv fit valu depend amplitud vari reach equilibrium state fit frequenc rang oscil number neuron connect biol model tabl summari result evolv segment network tabl solut lowest highest frequenc segment network activ oscil sign influenc number connect oscil fewer number connect complet remov inact neuron mn ein ein mn muscl muscl cin cin figur segment network configur ten run converg time bs figur oscil evolv segment network neural configur biolog similar structur inhibitori connect cin neuron side strong inhibitori connect lin neuron cin neuron side act burst termin biolog lin activ cycl inhibit cin activ side start prune oper ga led solut significantli fewer connect solut weak connect plai import role creation oscil case solut fewer major connect inact neuron solut tabl number connect remov inact neuron evolutionari control gener complet cpg evolv interconnect fix segment network segment oscil evolut previou evolutionari stage chosen evalu complet cpg base simul neural activ mechan movement bodi qualiti solut depend capac control swim frequenc lag segment encod ga chromosom encod segment interconnect similarli biolog interconnect extens segment connect neuron neighbour segment segment extens direct encod chromosom valu extens neighbour maxim extens chosen includ maxim extens biolog model number gene number segment connect symmetri assum connect weight segment network fix rescal depend extens weight connect neuron divid number segment receiv input ga evolut segment oscil prune oper gene transform integ chromosom real number ga ga paramet evolut tabl popul size number children crossov probabl mutat probabl mutat rang tabl ga paramet evolv control fact weak connect remov affect oscil due fact mutat oper time give weight prune mutat oper slow converg minim set connect evalu control evalu capac control swim mechan simul requir featur control gener stabl oscil segment coordin phase differ creation travel abil chang speed swim chang frequenc oscil wavelength abil chang frequenc wavelength global excit level amount extra excit segment mathemat definit fit function appendix evalu control consist simul level global excit extra excit segment order determin influenc phase lag segment speed order comparison biolog special emphasi capac swim wavelength length bodi lag segment capac chang frequenc larg rang measur lag close result carri evolut base evolv segment oscil previou evolutionari stage popul made chromosom evolut stop fit fittest solut popul significantli gener depend random coupl initi popul effect depend segment network segment network robust produc stabl oscil random fail produc stabl oscil gener observ randomli connect segment oscil produc stabl phase segment vari extra excit segment run successfulli converg control capabl gener stabl oscil phase lag segment larg rang frequenc phase lag similarli biolog evolv cpg produc lag segment constant spinal extrem lack extens segment extrem tend oscil lag extra excit appli segment test solut run rang level excit extra excit order determin exact rang frequenc phase lag result summar tabl control cover approxim rang frequenc isol segment network evolv control cover larger rang phase lag maximum lag solut speed rang cover evolv solut gener larger rang model solut reach higher note solut swim slowli backward segment oscil phase extra excit kind perform solut produc lag extra excit segment fit frequenc rang rel lag speed rang rang biol model tabl summari result evolv control tabl solut rang phase lag speed produc solut cover larger rang frequenc phase lag biolog independ control variabl good global level excit frequenc oscil influenc rel lag segment problem illustr solut reach high frequenc high explain maximum speed low combin high frequenc high lag high speed mechan fit function prevent rel lack independ reward small area global excit versu extra excit space visit evalu depend occur high level global excit extra excit visit evalu rel problem solv sampl combin type excit evalu clear make segment network coupl al detail descript evolv extent interconnect vari solut systemat coupl favour direct extent coupl asymmetri vari depend type connect influenc phase differ activ neuron segment gener observ made connect neuron type extend connect neuron type extend larg major inhibitori connect extend final cpg base similar segment oscil similar asymmetri coupl segment connect figur show simul evolv control evolv cpg perform turn aspect account evalu function similarli biolog give higher excit level side spinal cord lead differ note solut level global travel wave receiv extra excit extra excit travel head tail figur simul evolv swim control frequenc oscil phase lag segment cycl durat speed swim neural continu line correspond dash line correspond cin line ein mechan ms dot vertic line separ mm amplitud stronger muscl contract chang direct swim case evolv permut turn abil permut effect straight avoid antagonist effect amplitud extra excit neuron send inhibitori connect side initi test evolv control show produc backward swim give excit segment induc tail head limit lag speed obtain evolutionari sensori feedback stretch sensit cell cpg evolv work open receiv feedback mechan simul sensori feedback provid cpg stretch sensit cell edg situat side spinal cord inhibitori excitatori edg cell emit signal proport elong di al cell coordin neural activ actual bodi movement show sensori feedback cross barrier water local speed opposit direct swim al show preliminari experi evolv sensori feedback artifici control order cross similar speed barrier encod ga chromosom encod segment oscil receiv sensori feedback stretch sensit cell situat side part spinal cord encod synapt weight connect edg cell neuron segment network symmetri side segment network spinal cord connect excitatori inhibitori gene decod synapt weight note fix boundari small order prevent sensori feedback disturb product oscil ga paramet evolutionari stage prune oper evalu solut reward depend abil cross speed barrier barrier mm wide length simul speed water flow opposit direct swim set higher speed swim fit function defin progress barrier direct minim deviat minim differ speed swim sensori feedback point ad prevent import swim pattern sensori feedback control evalu chosen combin frequenc oscil phase lag segment middl respect mathemat definit fit function appendix result carri run control previou evolutionari stage control chosen combin rel larg rang lag speed independ control frequenc lag similar biolog model sensori feedback evolv neuron form segment oscil cin chosen level excit produc swim sensori frequenc oscil rel lag speed speed barrier set higher speed sensori cross speed barrier local forc entranc barrier disturb bodi lead extra bend upper part bodi forc chang direct swim eventu swim initi direct run converg gener control cross speed barrier connect stretch sensit cell ident evolv control solut evolv excitatori connect stretch sensit cell inhibit prevent excess bend solut develop strong excitatori connect stretch sensit cell connect prevent excess effect amplitud signal approxim larger sensori feedback excitatori feedback ms ms figur effect speed barrier swim evolv sensori feedback lead bodi sensit extra forc due barrier note al evolv control cross speed barrier reli amplitud evolv sensori feedback cross reduc speed barrier obtain success control swim sensori feedback act burst termin switch neural activ side extend ga tool neurobiolog model method present develop connectionist model present similar circuitri found ga tool develop model automat gener instanti variabl difficult measur illustr repeat evolutionari stage fit restrict space solut control preserv segment connect sign neuron observ real summar result al al firstli evolv segment oscil evolv synapt weight network fix configur biolog segment connect found set synapt weight modifi order optim frequenc rang frequenc rang closer observ real obtain solut cover rang main observ frequenc rang obtain strength inhibitori connect cin lin lin cin evolutionari evolv coupl segment oscil biolog model coupl perfectli real idea studi kind interconnect produc phase lag segment constant spinal cord independ frequenc oscil view origin phase lag real due differ frequenc oscil natur domin coupl ascend descend instanc al evolv interconnect fit function artifici control develop coupl produc kind phase lag observ real evolv solut cover larg rang lag reach slightli higher speed coupl evolv coupl run carri significantli simplifi coupl model find evolv cpg domin coupl systemat present asymmetri project depend segment connect cpg reli natur coupl differ frequenc creat travel wave coupl optim wave travel head tail extra excit segment determin exact phase lag excit segment amount evolv sensori feedback control enabl simul cross speed barrier evolv connect correspond close observ real connect excitatori inhibitori stretch sensit cell establish real di al present sign evolv control cross speed barrier good situat sensori feedback develop natur evolut real discuss discuss method stage evolut control evolv stage order simplifi problem subproblem decomposit motiv similar decomposit real gave possibl direct comparison evolv solut biolog model advantag decomposit reduc time evolv complet control avoid evalu control made segment oscil oscil correctli isol decomposit present mislead evolut fittest solut stage necessarili start element stage segment oscil evolv reward capac constitut handicap stage encod scheme simpl encod scheme directli encod synapt weight extent interconnect chromosom meant search perform defin limit space solut neuron fix maximum number neuron search space larg gener varieti interest central pattern gener enlarg search space includ paramet neuron dynam encod initi test show ga evolv neuron paramet connect gener work cpg interest extens indirect modular limit number neuron meyer report encod evolv swim control singl evolutionari stage definit fit function defin fit function constitut import part method object develop cpg capabl produc stabl oscil modul speed swim extern frequenc phase lag oscil object iter defin suitabl set fit function function product factor reward qualit quantit mean solut perform evenli aspect receiv highest fit neural mn mechan speed variabl import neural aspect gradual mechan aspect evolutionari stage mechan aspect examin effect determin qualiti swim reward neural activ present risk search network architectur reward mechan variabl stage evolutionari approach discuss ga connectionist model ga present interest featur design connectionist model compar tradit learn algorithm learn algorithm dynam neural network variat backpropag iter updat synapt weight error function calcul differ current desir state trajectori network algorithm comput gradient error function term synapt weight updat weight ga compar easier implement fit function differenti continu provid specif oscil network learn learn algorithm restrict problem desir state trajectori case control problem ga desir behaviour network instanc term rang frequenc produc term speed swim mechan simul parallel stochast natur ga make trap local optimum gradient search learn algorithm ga flexibl type evolv control modifi encod ad remov constraint ga oper ad prune fit function ad remov properti ga evolutionari algorithm made popular method design neural control animat gallagh gruau meyer ga neurobiolog model fact ga find set synapt weight interconnect cpg search space restrict solut present biolog segment connect show potenti tool develop neurobiolog model evolutionari process gener part synapt weight connectionist model set hand defin satisfactori valu ga prove search possibl optim synapt weight order produc larger rang frequenc research neurobiolog evolutionari algorithm similar set synapt weight neural network model al al determin conduct paramet model singl neuron wilcox gener point note ga demonstr model produc specif behaviour find effici set unknown invalid hypothet model inabl find success variabl instanti due fail model problem ga set discuss evolv control interest cpg successfulli evolv observ exist varieti connect produc neural activ swim demonstr exist solut altern biolog cpg control swim effici solut differ biolog model term neuron excitatori inhibitori influenc number neuron involv segment oscil evolv artifici segment oscil significantli larger rang frequenc segment oscil oscil similar structur biolog evolv network plai role biolog network sign prefer role sign dynam neuron model major oscil base inhibitori show connectionist excitatori product oscil larg frequenc rang control evolut control show segment network interconnect wai produc stabl oscil phase lag swim biolog swim speed wavelength produc vari simpl extern signal excit appli turn induc side control receiv excit evolv control gener cover larger rang phase speed model independ control frequenc phase segment gener observ coupl segment similar observ made bend network produc physiolog accur local bend function sejnowski systemat asymmetri interconnect favour direct asymmetri direct depend segment connect note coupl evolv control bit crude segment synapt weight extens segment connect connect segment interest function determin synapt strength depend length order influenc segment distanc separ sensori feedback evolut connect stretch sensit cell illustr sensori feedback evolv cpg coordin neural activ actual movement bodi cross speed barrier feedback stiff bodi act burst termin switch neural activ side excess stretch preliminari experi fix extern command cpg cross barrier due passiv properti cpg sensori feedback activ correct command cross experi includ order determin respect import sensori feedback higher command brain cross barrier point consid al higher control center speed direct swim modul input movement simul determin evolv control higher neural center gener simpl input node cpg provid interfac cpg higher control center interest extend simul ad simpl simul visual system evolv higher neural center simpl coordin experi avoid obstacl approach attach host paper genet algorithm develop connectionist neural network control swim inspir connectionist model central pattern gener altern artifici solut successfulli evolv work show firstli genet algorithm interest design techniqu dynam recurr network appli locomot control evolv network effici control swim simul produc stabl oscil frequenc phase lag modul simpl extern signal work illustr biolog connect uniqu connect model differ obtain effici solut altern solut cover larger lag speed rang obtain show techniqu evolv artifici solut potenti tool develop neurobiolog model incorpor biolog knowledg real encod evalu function genet evolutionari process find variabl difficult case synapt product desir behaviour solut satisfi biolog constraint produc oscil larger rang frequenc origin biolog model successfulli evolv jan support grant swiss nation research fund european commiss facil provid edinburgh aud billard richard reev comment earlier version manuscript fit function fit segment oscil fit fit oscil fit connect fit freq fit oscil fit connect con ratio con ratio con ratio con ratio fit freq fit oscil max freq min freq max freq min freq max freq min freq max freq min freq function fit oscil made factor reward activ vari regular phase left factor function statist measur signal standard deviat neuron number differ area output bound vari linearli valu variabl bound variabl determin hand exampl behaviour initi experi fix bound fit oscil make differ interest solut limit determin solut oscil regularli opposit behaviour left function fit connect reward solut reduc connect bound vari linearli valu depend connect ratio ratio number connect maximum number connect smaller connect higher maximum reward solut connect ratio smaller factor fit freq reward solut oscil larg rang frequenc excit brain stem vari rang frequenc measur solut oscil regularli opposit behaviour left oscil default level excit frequenc ratio maximum minimum measur make set simul level excit rang frequenc amplitud signal monoton excit level reward note exampl neural correspond interest behaviour chosen fix bound good behaviour fit oscil higher lower lower condit amplitud neural activ frequenc ad prevent antagonist effect speed test mechan simul show frequenc amplitud signal speed swim durat simul fix minimum oscil requir verifi stabil lowest measur frequenc approxim hz fit control fit min fit oscil fit fit fit speed ffl min fit oscil minimum fit oscil segment control simul excit level middl rang excit segment oscil extra excit segment ffl fit lag lag freq measur make simul fix level excit amount extra excit lag rang oscil regular segment fit lag monoton amount extra excit lag rang divid frequenc rang order reward solut chang lag segment independ frequenc ffl fit freq freq lag measur make simul excit level vari fix amount extra excit calcul previou lag measur lag includ lag defin extra excit lag closest frequenc rang frequenc monoton level excit ffl fit speed speed rang speed rang correspond rang speed cover simul made definit lag fit rang measur differ maximum minimum target target fix lag hz frequenc rang speed rang fit sensori feedback fit fit progress fit deviat fit speed constanc ffl fit progress vari linearli limit maximum progress head vari mm speed barrier bodi progress measur distanc direct head entri point ffl fit deviat vari linearli cosin deviat angl initi direct swim direct entri vari ffl fit speed constanc vari linearli rel differ speed sensori feedback vari refer gallagh beer jc gallagh evolv dynam neural network adapt behavior adapt al tm mckenna biolog neural network robot academ jt buchanan newli identifi role locomot spinal cord jt buchanan neural network simul coupl oscil spinal cord biolog al de ch complex behavior control simpl network adapt neural basi behaviour anim combin neuron mechan model fish swim biolog al model realist simul neural network singl neuron synapt interact biolog al neural control fish swim studi numer simul adapt al ks hj beer leg coordin mechan stick insect appli robot locomot adapt al wc neural network model orient movement journal compar al wc applic visual system biolog pa compar analysi central pattern gener neural control rhythmic movement vertebr jon wilei goldberg genet algorithm machin learn al buchanan neural control locomot lower vertebr neural control rhythmic movement page jon wilei al neuron network gener behavior membran simul annu rev al el gn neural network locomot bodi orient trend gruau automat definit modular neural network adapt aj evolut develop central pattern gener swim al aj willshaw artifici compar natur artifici evolv swim control husband fourth european confer artifici page mit al aj willshaw evolv swim control simul inspir neurobiolog dept artifici intellig research paper januari al aj willshaw gener investig swim circuitri genet algorithm meyer meyer evolut develop control architectur animat robot autonom meyer meyer evolut develop neural network control artifici insect ieee tran neural chain coupl oscil ma handbook brain theori neural page mit al ma ah ga bekei genet algorithm gait synthesi robot recent trend mobil robot world sejnowski sr tj sejnowski comput trend neural mechan coordin local excit modifi phase coupl spinal cord ba pearlmutt gradient calcul dynam recurr neural survei ieee transact neural al lj combin genet algorithm neural survei state art schaffer combin genet algorithm neural network ieee comput societi di al di synapt effect stretch receptor neuron mediat feedback locomot brain al coordin simul network model segment boundari biolog al model realist simul neural network segment network gener rhythmic decemb wilcox west gl wilcox robust paramet select model neuron evolutionari algorithm jm comput trend research plenum tl william ka spinal cord gener pattern ma handbook brain theori neural page mit tl william phase coupl synapt spread chain coupl neuron oscil xin yao review evolutionari artifici neural network intern journal intellig
Agents/928 1 declar constraint data model applic bori van faculti comput scienc po box netherland abstract complex applic applic fruitfulli view number independ agent access modifi share data structur view share data includ domain data view edit entir user interfac state share data concept ectiv model techniqu aspect model speci cation requir structur evolut share data enabl desir level abstract implement user interfac speci cation check correct agent ensembl agent work share data enabl formal coupl requir execut system desir paper constraint speci cation provid formal version tradit structur diagram combin arbitrari similar object constraint languag speci cation coupl applic written toolkit mean code assert speci cation techniqu assess mean speci cation small applic introduct address system design issu complex interact system view interact applic consist number separ agent access modifi share data share data domain data data view user interfac data posit item concept share data central user interfac model emphasi laid domain data goal architectur style identifi restrict clarifi access mean architectur construct interfac de nition mvc architectur style split share data number model speci es interfac model object separ pac style addit architectur constraint prescrib limit access compart mean encapsul hierarchi model assum data fruitfulli separ number isol compart practic complex queri oper data singl compart access limit number agent system provid awar user interfac data user scrollbar cursor concurr access di erent user di erent order enabl user activ multimod system person assist typic oper track activ user di erent part user interfac toolkit di erent user applic interact access singl global share data structur step approach model share data import aspect system base share data model describ global properti data discuss formal version structur type constraint combin formal global properti applic share data declar manner languag describ model show applic speci ed manner speci cation paper structur discuss exist effort constraint speci relat work describ constraint languag coupl work applic languag assess mean speci potenti discuss relat work formal languag exist suitabl de ning constraint mean provid coupl execut system vari proper coupl execut system bene practic languag recent attempt stimul wide accept constraint speci cation omg object constraint languag ocl practic languag special design easili execut ocl straightforward correct assert form truth express set quanti er collect de ned mean collect queri result combin assert queri mean structur constraint ocl queri facil basic consist navig enabl navig object structur refer note bypass encapsul principl prescrib design ocl manner speci cation languag fruitfulli describ system base concept compil exist coupl ocl execut notabl compil enabl ocl constraint ad java class annot gener extra code compil languag combin speci cation assert languag enabl model easi coupl full execut system ort made emploi tradit abstract model structur diagram model interact softwar speci cation necessarili translat languag structur diagram uml class diagram tool exist coupl speci cation execut mean gener code skeleton speci cation primarili describ user interfac inform usabl method shown prove describ usabl aspect user interfac model exist behaviour user interfac form machin machin variant gener intuit easili coupl sequenc speci usag scenario carri full system limit express practic describ limit number requir larg abstract step made respect execut system statechart model transit speci ed mean truth enabl abstract step uml speci es statechart correspond behaviour object structur diagram develop environ exist combin state machin structur diagram similar manner fewer model integr state structur execut manner correspond easi understand formal coupl ensur plan formal integr structur diagram statechart ocl environ diagram enabl ocl express place experi combin speci cation interact system constraint languag describ constraint languag enabl constraint share data speci ed languag enabl special notat descript constraint state machin code modul gener speci ad run system provid diagnost state transit constraint violat languag visual map statement languag structur state diagram graphic tool edit speci diagram gener textual speci cation graph layout tool conveni program languag toolkit easili data structur constraint speci cation system model share data includ user interfac includ click special relat model map constraint speci cation execut code close system queri basic queri facil free make track made easi map basic structur diagram de ne map attribut de ned constraint languag map check relat multipl map state machin problemat abstract step concret state system abstract state machin proper exibl harel statechart approach transit condit state combin event condit speci ed arbitrari truth express unlik languag separ de nition set mean constraint explain set de describ constraint languag queri set de ned mean queri content set speci moment time result queri speci moment queri written prolog style tupl entiti speci ed field repres attribut liter kei tupl speci es search pattern variabl free variabl constraint queri hand side speci es queri pattern pattern queri result set bind free variabl found tupl variabl list left hand side result set queri result card game speci ed set set set call stand card select player relat particip speci game relat note identi er start tild symbol variabl identi er constant special constant stand entiti set de ned case entiti card note underscor wildcard denot posit matter queri speci cation provid queri facil express found languag wai power ocl navig enabl pattern match ecienc reason power queri facil ad languag languag continu speci cation languag structur speci cation basic model de ne entiti relationship entiti relat refer number case multipl refer speci ed note entiti directli refer entiti practic consid design abil desir entiti relat speci es attribut option oper constraint speci ed properti entiti relat gener assert state machin speci cation state machin speci ed basic di erenc transit speci ed arbitrari truth speci es state condit transit occur state condit true event occur condit speci ed truth express event condit left empti state machin speci ed assert speci ed insid entiti relat separ statement assert case assert hold entiti assert state speci state assert truth express express exist foral quanti speci ed evalu combin element set mention express case result true express result true case result true express result true exist quanti er size oper count number element set combin express boolean oper boolean express individu eld set address notat exampl truth true empti set user select card true long true player join case studi evalu stage research begin small assess languag applic applic assess speci cation languag card comput version game set work implement applic exist start constraint earlier methodolog consid suitabl constraint languag assess give constraint speci cation system complet speci cation describ constraint system provid reason coverag complex speci cation illustr provid mean qualit assess give full speci cation track speci cation kind step prompt speci kind inconsist speci cation implement found applic applic implement game agent incorpor game standard agent user interfac text give speci cation applic give constraint speci cation gure diagram figur show structur diagram gure state diagram game user natur languag speci cation user log present game window ll creat delet join game begun game user talk user join game game card plai displai game proce card laid deck tabl player search combin card satisfi combin call rst set call coupl point card remov replac card deck game continu deck exhaust player set win player extra card laid game option point set enabl player set game continu fresh card assess speci cation process process speci cation found improv insight made design system prompt insight made constraint speci cation assert violat detect adjust speci cation implement program origin develop ed structur diagram speci ed earliest phase found formal structur diagram complet accur formal clear redund relat refer implicit de cienci easili correct initi speci cation state machin game show mode game model illeg user action select card player call rst speci cation state machin assert condit user action made clear clear transit thought transit plai watch gener speci cation techniqu subject focu speci cation unusu result straightforward speci cation cover interest part applic approach level abstract suitabl describ abstract user interfac model lled altern concret user interfac close coupl speci cation execut system provid extra show coupl discrep previou inform speci cation system clari ed fail assert check state transit uncov error result structur state diagram easi ectiv part usabl speci cation notat provid formal bridg usabl method implement fig structur diagram applic structur diagram notat similar uml notat box entiti shape relat arc annot relat multipl number indic refer paramet implement graphic notat refer entiti similar sql tabl refer arc point target entiti relat annot attribut valu event number valu event mean attribut default arc game direct refer found user game entiti user attribut event requir explan game event game concern speci success failur set user select card form set event basic user interfac type start request request game show call particip game model particip relat user particip number user particip game game number card entiti system displai solut tripl relat solut relat fig state diagram entiti user model user user enter leav game box arc transit label event condit express squar horizont arrow left state begin state transit model singl set game user mode particip user game user examin game case view card talk user user join game set join state transit obviou fig state diagram entiti game model game model di erent mode game game user signal game user call select solut shown solut provid shown game creat card tabl game start run user start game user call card select mode enter user request game solut displai mode state transit obviou entiti event set set free watch watch plai free plai free watch assert entiti event set set set set assert assert assert entiti relat relat relat set fig full constraint speci cation full speci cation diagram gener correspond suppli diagram speci cation obviou left discuss assert user speci es assert state event game event de ned case user free watch state game speci es assert rst state user select card begin game turn state user select call solut shown state particip time readi select user particip game global assert speci es solut di erent card belong game structur diagram make clear agent access requir data user view list queri particip relat user awar card user simpli queri select relat structur speci cation similar spirit speci decid usabl entiti relat visibl user state diagram contribut intuit part constraint speci cation part speci cation execut system state machin speci desir read state applic system behaviour ectiv express term state refer steve richard bernhard jo alan amsterdam manifesto ocl uml technic report object manag jackson lightweight object model notat technic report mit laboratori comput green benyon beneath model inform artifact intern journal greg phillip architectur synchron groupwar technic report depart comput inform queen smyth user interfac develop environ object page ieee object manag group omg uni ed model languag speci version david harel model reactiv system approach ian horrock construct user interfac statechart andrew david compar mvc pac architectur workshop formal aspect human comput frank finger modular architectur toolset support ocl andi stuart uml uni ed model languag advanc standard intern octob volum page paulo da silva user interfac declar model develop survei ph volum page june paulo da silva norman paton uni ed model languag interact applic andi stuart uml uni ed model languag advanc standard intern octob volum page roseman greenberg build groupwar page oreilli kevin schneider jame abstract user model notat support plastic interact system chri interact speci veri intern june volum lectur note comput page seo gerard kim structur approach virtual realiti system design submit presenc dg wysiwi earli experi interfac acm transact oc inform bori van structur distribut virtual environ relat model technic report gist dept comput jon johann gener statechart design scenario intern confer softwar page
HCI/929 4 orient recoveri text plane singl imag clark depart comput uk abstract method recoveri paragraph text full perspect transform present horizont vanish point text plane found extens project profil accur segment line text analysi line reveal style justif provid estim vertic vanish point plane text final recov view suitabl ocr recognit introduct optic charact recognit area comput vision gener deal problem text imag research recognit text real scene text orient rel camera research applic replac document scanner camera facilit text assist disabl visual wearabl comput task requir knowledg local gener autom task requir abil read scanner prepar appli ocr text imag real view segment region text produc issu consid paper previou work estim orient planar surfac imag vari assumpt made achiev ribeiro present method textur distort estim vanish point text plane affin distort power spectra found straight line correl measur determin orient vanish line posit text repetit element element match cover small area imag attempt find orthogon line architectur assess rel camera geometri hough transform estim orient planar shape featur find skew symmetri shape axi symmetri affin recoveri origin imag locat text region figur prepar paragraph planar recoveri threshold requir recoveri perspect work priori inform shape observ knowledg princip vanish point plane text li suffici recov view observ paragraph orient rel line text point horizont vanish point text plane imag paragraph exhibit form straight margin left text central vertic line text align case vertic line point vertic vanish point text plane concentr work recoveri paragraph line text reason assumpt justif exist centr avoid problem group element paragraph work ensur global inform paragraph time principl project profil extend problem locat horizont vanish point separ line paragraph format segment line text reveal style justif align provid estim vertic vanish point rest paper structur section briefli review previou work input work section discuss paragraph model fit locat horizont vanish separ line estim vertic vanish point section vanish point text plane emploi recov view paragraph suitabl higher level recognit conclud futur work section find text region introduc text segment algorithm textur measur train neural network classifi area imag text figur show larg region text found figur approach work output system present region individu shape recov orient text gener view text order paragraph requir classif text background pixel region provid text segment algorithm princip background foreground colour easili separ threshold averag intens imag neighbourhood adapt threshold order variat illumin text region partial calcul threshold effici ensur correct label proport pixel fall threshold consid block text larger area background text group pixel lower proport label group background shown figur demonstr correct label light text dark background typic input work present locat horizont vanish point modena demonstr text locat method imag book cover emploi project profil estim skew angl locat text number potenti angl found pair compon project profil gener angl observ project profil minimum entropi correspond correct skew angl guid search directli applic find vanish point freedom order search gener project profil point view vanish skew angl circular search illustr figur correspond vanish point imag plane scalar centr map infinit plane exponenti finit search ensur accur locat vanish search space popul evenli posit cell project profil text gener vanish point ly text region central hole figur project set bin imag pixel accumul classic gener project profil binari imag angl posit pixel depend normal vector describ angl project diagon distanc imag dot product posit pixel axi project profil imag defin manipul emploi map axi rang bin project profil angl point project imag freedom repres parallel slice imag repres angular slice project refin map imag pixel θ θ relationship search space score project profil gener figur figur search space angl pixel centr rel vanish point size angular rang text rel vanish point obtain vector perpendicular magnitud equal radiu bound circl text region figur depend point project fact vr distant vanish point view text region smaller angular rang find ensur angular rang text region close text text pixel fall rang project bin vital order gener profil benefici bin gener angular rang absent text accumul project profil vanish point simpl measur confid found project confid measur chosen respond favour project profil distinct peak trough straight line distinguish point horizont vanish point neighbourhood favour measur found respond entropi effici comput confid vanish point regard text figur plot figur darker pixel repres larger vanish point project profil largest confid chosen horizont vanish point text plane win project profil poor project profil shown figur mark figur white cross black cross gener imag resolut search figur potenti vanish point va project profil method consist provid good estim horizont vanish point experi locat vertic vanish point locat horizont vanish project profil text make separ individu line text style justif paragraph lead locat vertic vanish point appli simpl algorithm win project profil segment line peak defin rang angl project bin regist averag height interest part project bi andi indic bin trough defin rang angl peak central angl trough separ boundari adjac line paragraph project segment line vanish point angl rang pixel binari imag ly adjac segment line collect line text result segment shown figur full short line text segment accur segment paragraph locat paragraph frame figur paragraph recognit line segment mark point line fit green red rectangular frame text plane blue frame recoveri determin left end segment form set anticip justif expect straight line fit set repres left centr line paragraph line imag vertic vanish point lie establish line fit set sampl algorithm reject outlier short equat head set line fit potenti pass averag angl found error lx ef sin normal reward fit larg number point set obtain line respect error condit type paragraph el ec er fulli justifi left justifi justifi central justifi tabl classifi type paragraph classifi style justif paragraph rule tabl figur show pass centr paragraph condit tabl satisfi paragraph correctli identifi central justifi baselin repres vertic line text suffici weak perspect plane text full find distanc baselin vertic vanish point li proce gener style line intersect estim posit vertic vanish point figur line chosen method assum fit line accur repres vertic margin paragraph type paragraph fulli assumpt break section found vanish point project line describ left margin top bottom limit paragraph line intersect form shown figur recov viewpoint paragraph text section remov perspect map imag model text block desir provid aspect ratio rectangl provid good model origin imag pixel text plane frame paragraph model recov orient text fix distanc obtain model vertic imag label find world coordin corner centr depth point scene figur project origin imag line ab form plane top edg ab rectangl lie similarli project bottom line dc form plane bottom line dc rectangl lie line ab dc opposit edg rectangl parallel direct horizont vector text plane vector li plane perpendicular normal plane ab ad dc bc appli principl left plane recov vertic direct rectangl scene vector describ orient text depth plane scene unknown interest fix resolv corner obtain coordin text rectangl recov aspect ratio rectangl world space geometri involv planar recoveri recoveri text figur recoveri text imag construct destin suitabl interpol gener view text recov page run figur exampl figur show case recoveri central align text figur present exampl paragraph text background vice versa exampl recoveri poorli align paragraph demonstr figur poor method estim locat horizont vertic vanish point recov paragraph correctli figur present recoveri multipl paragraph imag figur note good result obtain line recov paragraph discuss present method recoveri paragraph perspect transform singl imag project profil vanish point robustli recov horizont vanish point text segment paragraph constitu line line fit margin central line paragraph appli estim vertic vanish point princip vanish point find orient text plane recov view algorithm perform wide rang provid paragraph full line gener project profil potenti vanish point section requir larg amount initi reveal natur search space result figur demonstr space obviou direct effici search initi low resolut scan reveal angular region figur exampl recoveri paragraph case imag shown recov paragraph correct vanish point region search find angl distanc horizont vanish point section vertic line fit paragraph estim vertic vanish point paragraph accuraci fit line reduc number line paragraph number word line low result poorli defin explor altern indic posit vanish line space result imag reproduc low suitabl fed ocr system interpret text read human observ work perform ocr text segment activ good result futur intend integr work automat system text recognit environ refer boll approach model fit applic find cylind rang data proc int conf artifici page clark find text region measur proc british machin vision page zisserman shape homogen revisit proc british machin vision page hodg richard faster spatial imag process partial summat technic report cambridg modena automat identif skew estim text line real scene imag pattern lam extract low resolut text activ camera ocr proc spanish symposium pattern recognit imag page map planar object pose estim imag vision ribeiro hancock detect multipl textur plane local spectral distort proc british machin vision page approach vanish point detect architectur environ proc british machin vision page van detect skew symmetri hough transform techniqu detect reflect symmetri pattern recognit
HCI/930 4 air traffic manag seminar june human factor alarm notif evalu centr de la navig avenu franc abstract grow work alarm design air traffic control displai concern event notifi number safeti requir visual notif effici detect understood requir inform radar displai obscur visual notif design hierarchi sever benign advantag current graphic capabl identifi explor dimens visual alarm design present paper term detect time tempor profil anim signal frequenc conclud size tempor profil anim suit introduc nuanc convei notif visual displai show detect signal measur vari amount attent time introduct design user interfac command control system air traffic control safeti devic adequaci effici user action critic issu safeti inform perceiv interpret user import notifi alarm asynchron event aircraft fly mile ten alarm notic matter matter alarm unnot comput system led major evolut design user interfac air traffic control inform includ sophist displai underli system grow notif convei user kind alarm type breakdown problem ground risk detect event nonetheless asynchron commun statu aircraft incom request aircraft data link respond notif interfac provid hand sever alarm reli blink label wider rang signal requir evolut comput system provid design extrem wide rang visual techniqu design visual richer displai air traffic control engin explor wai displai piec inform graphic radar colour background geograph meteorolog enrich flight label colour avoid visual clutter difficult real visual design ad rang inform displai lead disastr result displai messag obscur piec exampl realist simul control area larg screen notic alarm base colour chang long order ensur alarm design tend add sound notifi inform sound effici context air traffic control reluct prefer emerg alarm mean found lower prioriti notif graphic capabl comput design solut potenti solut domain work put find neurophysiolog long time vision sensit movement central vision accur order signal person anim art set rule painter graphic order influenc ey imag modern comput provid subset visual techniqu painter cartoon author capabl air traffic video game instanc make extens visual interest possibl design anim effici attent obscur background inform goal research identifi salient design dimens explor mechan anim effici provid engin hierarchi visual signal map hierarchi alarm identifi report experi preliminari result compar salienc notifi inform good alarm attent provid inform situat signal kind action aspect alarm design treat separ classic result visual alarm design effici attent vast major result base light displai paramet test pertain shape locat guidelin factor design evalu colour yellow caution green locat central area control blink rate research step characterist visual percept se cognit mechan alarm awar defin set basic principl readabl signal relationship situat hand effici recov order seri signal group spatial signal displai close relat function convent mean colour congruent red signal design provid combin inform research work ecolog perspect advoc integr inform fundament unit analysi system case studi question relev format inform present user design attempt exploit larg capac human system found natur environ suppli transpar inform environ good provid displai aircraft pilot design featur optic arrai support percept flight direct design attent rest accumul result tradit user interfac design guid tend conserv address issu locat blink rate time mere transposit classic result todai graphic screen product complex graphic effect surpass capac light signal endless variat design signal rang event prioriti number dialogu machin import user attent grab attract amount inform convei crucial work avoid main task explor seri graphic attribut effect support larg rang signal distinct attent capabl attribut classic paramet size domin colour graphic signal signal clutter displai obscur piec transpar provid modern graphic system interest dimens transpar level visual signal transpar gradient determin contrast background anim set dimens type anim difficult move period anim period classic variabl signal frequenc illustr figur time diamet signal frequenc figur variat signal evolv time top variat tempor profil left variat frequenc present paper report subset paramet shape colour extens decid paramet neutral shape colour chose circl rel symbol neutral mean triangl cultur colour yellow colour largest percept field manipul transpar anim signal anim chose frequenc tempor profil signal small signal rippl encompass goal catch ey rest experi carri experi order assess influenc signal list experi consist seri random signal subject detect design figur indic signal capac collect reaction time signal time subject react signal attend comput point accuraci distanc cm signal point subject finger land order assess accuraci signal perceiv figur setup design procedur subject part experi seat front screen equip touch input shown figur distanc depend length subject arm evalu capac comput signal signal randomli peripheri subject attend test displai screen central part figur exist yield highli reliabl stabl measur individu perform underli assumpt difficult attent requir test provid tool grade amount attent requir subject wealth publish result check reliabl data figur task visual signal peripheri signal rippl converg small disk detect task signal yellow circl diamet vari systemat transpar signal frequenc tempor profil figur aspect signal displai yellow surround anim figur repetit signal configur signal screen except central part dedic task subject instruct point signal detect forbidden visual explor screen reaction time point accuraci measur task test consist word displai black colour central part test entail level easiest subject instruct read aloud colour print black word print correct answer ink colour print correct answer ink colour colour ignor word word print correct answer subject instruct attent time test perform task quickli minim error rate experi divid session dai condit subject present ten repetit signal configur session result discuss report pertain reaction time time subject react signal attend pertain point accuraci distanc cm signal point subject finger land reaction perform anova design attent load influenc level difficulti figur rippl cross screen converg point interest effect reaction time signal ident signal level difficulti task confirm amount attent requir level difficulti task reflect reaction time secondari task anova show main effect subject mean rang fastest subject slowest subject observ interact subject level difficulti task due learn effect signal detect level difficulti concur signal detect session yield longest reaction time worth note result consequ main effect condit balanc subject observ main effect signal transpar transpar signal yield longer reaction tempor shape signal entail longer reaction aspect local signal yield longer reaction time interact effect richer descript observ behaviour global signal reaction transpar signal signal surfac reaction differ dramat transpar signal order find posit signal screen influenc reaction perform correl reaction time polar signal found correl rang signal posit screen influenc reaction time perform design anova point accuraci depend variabl found main subject effect subject accur accuraci rang addit main point accur concur test condit highest level difficulti transpar signal lead accur point entail lower point accuraci point accur global signal magnitud differ fetch argu differ interest scale air traffic control posit sum show percept signal measur influenc amount attent time result caution design signal air traffic control attent vari wide time found worth tempor shape aspect signal differ reaction time depend combin natur task expect react quickli observ differ signal configur higher real life situat transpar aim opac level care level requir interact paramet paramet make good candid notif low prioriti inform transpar paramet test paramet hint specif usag transpar mode chosen set paramet featur workload lead control mental postpon tune subset event preliminari result error rate transpar signal frequent miss signal notifi event minor notic user resolv conflict scan screen paper step elabor design principl base graphic transpar anim experi determin explor set import effect visual detect time interest test find hold attent field restrict screen air traffic control spread attent wider visual minim radar strip board small screen button displai question result signal time observ hierarchi detect distribut reaction time observ present conduct experi design confirm find paradigm manner akin video game unabl hierarchi visual signal rate term detect time probabl work includ introduct shorten signal detect reinforc enrich effect visual signal multimod design refer kr je engin data human percept perform harri armstrong aerospac medic research air forc km ed human factor design evalu air traffic control system feder aviat final april warn research prospect taylor kj global perspect ecolog system lawrenc erlbaum bl evalu transpar menu usag proc canada ar review acta half centuri research integr review psycholog vol ecolog work perspect ecolog lawrenc erlbaum human factor alarm design taylor engin psycholog human
DB/931 3 integr keyword search xml queri process daniela florescu rocquencourt bp le franc donald kossmann univ passau fur system germani ioana manolescu rocquencourt bp le franc abstract due popular xml data queri xml special handl data structur absent languag rich queri content structur xml vari unknown structur make formul queri difficult task extens xml queri languag enabl keyword search granular xml element novic user formul queri yield optim opportun queri processor present implement extens top commerci discuss implement choic perform result keyword xml queri index introduct background motiv doubt xml rapidli import data format scientif data dna linguist treebank annot larg document shakespear data exchang internet electron larg softwar includ larg number develop tool manag xml data applic base xml strength xml repres structur data unstructur data xml hospit repres inform patient observ doctor advantag import tool work effect kind import xml queri languag select record structur part xml document search inform text pose queri find patient older year specif symptom keyword search import queri xml data regular user structur partial situat frequent user visit web data store web site user bui car internet price categori car repres dealer web user prefer directli car price queri involv keyword search price evalu predic price reason integr keyword search xml queri process queri xml document time user interest bui cheap car user inform car dealer car dealer store data car dealer user interest price car user queri previou queri involv keyword search price user car dealer store data regular xml queri process keyword search extens studi previou work give overview relat work section shown featur combin extend xml queri languag keyword search show extend queri languag implement paper role relat system altern wai process xml queri keyword search exploit relat system exampl popular rdbm product ibm microsoft sql oracl rdbm advantag easi build extend xml queri processor integr keyword search top requir function rdbmss organ rdbm instal addit cost incur rdbmss mix xml data data data world xml rdbmss show good perform twenti year research develop invest make rdbmss queri processor rdbm vendor continu improv product rdbmss capabl store process larg volum data relat wai scenario xml data replic initi relat scenario perform xml queri includ keyword search execut full advantag power queri process capabl rdbm interleav keyword search oper xml queri data move network process boundari cross execut queri scenario scenario show rdbm data xml data build data long viabl technic legal reason replic xml data web describ scenario queri process carri distribut xml document store data sourc rdbm store index execut keyword search find relev xml data sourc queri xml data sourc power data sourc implement top simpl file system techniqu develop work applic system rdbm approach applic xml queri processor current gener oodbmss xml queri processor matur process larg amount data focu rdbmss paper exploit featur built rdbmss contribut overview paper goal work integr keyword search xml queri process make exist system remaind report show extend exist xml queri languag order support keyword search make queri xml data structur user queri xml document user queri multipl xml document dtd present extens invert file order support keyword search show extend invert file store relat system show xml queri involv keyword search oper process xml data store relat show xml queri keyword search xml data store relat present perform experi demonstr overhead approach give feel cost extend xml queri process keyword search section describ data model queri languag work section present index keyword search invert section discuss role rdbmss queri process detail section perform experi section overview relat work section conclud paper suggest futur work data model queri languag abund work recent address problem find formal data model queri languag xml data remain open problem common agreement reach describ section data model queri languag basi work data model queri languag similar spirit result present paper easili adapt formal assum final standard characterist function current work applic futur standard xml queri languag work extend queri languag keyword base search capabl start section describ xml data model continu describ syntax semant current extens data model relev question xml queri evalu singl xml set xml document set xml element subtl make queri set xml gener case call set document xml data set xml element data set partit xml element form type tag xml data set multipl element type document model xml data set graph gd ffl element xml data set intern node ne graph intern node ne label distinct system gener element elid ffl data xml data leaf vv leaf node vv label ffl graph gd type attribut edg content edg built element directli nest element graph gd content edg node ne node ne edg label type element directli element graph gd content edg node ne node vv edg label empti string attribut element graph gd attribut edg node ne node vv edg label attribut type data model unord data model order data model order model enforc addit total order set outgo content edg intern order compon element origin xml file sake unord data model data model order element state ignor idref data idref repres edg type techniqu present paper affect presenc idref articl articl articl author author author author author author author titl titl year year ieee wide web id id id figur data model xml data xml data xml data set bibliograph domain exemplifi data model consist articl element xml store file articl element similar type inform year public inform organ differ case web server access pattern wide web perform web server ieee infocom ed analysi web server ieee global telecommun confer graph model xml data set depict figur attribut edg mark dash system gener element id intern node show bold ital queri languag queri declar select data multipl xml data input creation xml data output simpl queri element construct variabl specifi data retriev xml data construct specifi assembl queri result xml set xml pattern set predic xml element item data attribut attribut eventu replac variabl variabl prefix order distinguish string similarli xml model major differ label graph variabl constant denot graph model set queri xml data set result evalu queri input defin map graph graph gd preserv constant label queri induc substitut variabl queri set constant valu data graph gd substitut satisfi addit creat construct ad result eventu element var map pattern graph data graph defin substitut variabl var set intern node data graph element origin xml file variabl project construct result includ xml element articl written mr construct map preserv constant map defin ffl web ffl web ffl web match addit predic note predic semant test string match string regular path express semant queri xml element part queri result extend keyword search good solut queri xml assum reason amount knowledg structur data order facilit case limit knowledg structur data xml queri regular path express regular path express panacea demonstr assum user tag subel author element attribut user depth tag queri express variabl construct replac underscor sign match search depth construct union search attribut depth construct easi imagin complex queri absenc knowledg usag potenti nest author queri hard write evalu solv add special predic call languag predic test exist keyword xml element predic xml element integ express limit depth word found boolean express set constant attribut attribut constraint locat word element data set substitut variabl set intern node graph gd predic evalu true iff set string label edg leav depth root graph gd occurr word obei locat tag attribut queri previou simplifi predic idea search element type articl author subel string author subel articl limit search depth interest kind occurr word attribut content xml element final construct alia express tag attribut content attribut semant result evalu queri data set element relev question context word substr string separ ident carri separ mean text document split english word separ mean gener difficult defin notion content xml element text string encod applic domain inform bibtex entri methodolog split pcdata valu charact separ assum applic depend procedur system interest question normal procedur transform capit letter appli string valu order probabl match string constant queri valu data procedur assum relat field work split normal procedur domain data framework describ integr extern procedur process data clean illustr search give assum absenc knowledg structur xml data articl element word depth extens express construct queri return element xml data set conclud section remark keyword base search necess multipl xml data structur articl structur unknown multipl heterogen xml sourc queri order express full rang fulli structur complet unstructur order global optim process essenti support capabl queri formal relat support index describ extens invert file index extend invert file implement keyword search find relev xml data sourc xml element distribut environ show invert file store relat discuss variant invert file queri process detail section invert file classic index structur keyword search invert file simplest invert file record mean word found document extend structur inform granular element document word titl element articl element xml data set section record keyword tag attribut word attribut word element data content tradit inform retriev distinct requir system work granular system gear support predic inform record depth word time element order execut predic limit depth tradit ir system record inform ignor structur document invert file record word depth locat natur mean section invert file note multipl distinct record word elid word tag depth articl depth articl titl year relev question elid element model effici store system model elid record url belong xml start end posit element type element dtd document specifi element attribut uniqu identifi element id uniqu identifi attribut store elid record manipul complex elid record intern kei number inform element store separ tabl call element tabl work intern smaller elid queri process significantli faster store inform individu xml document url inform separ document tabl obtain relat schema store element elid document repres bold start end id store invert file relat invert file implement wai chose relat system rdbmss handl larg amount data invert list tend larg larger fact origin data rdbm execut part queri queri keyword search process singl rdbm cross process boundari natur store invert file rdbm establish tabl store invert tabl locat previou subsect huge huge tabl inspect queri involv keyword search desir partit tabl smaller tabl queri process small tabl wai partit tabl depend queri workload characterist xml data heurist proven effect ffl partit word keyword separ tabl establish locat find element word titl analysi tabl inspect partit invert file virtual ir system todai ffl partit individu word tabl type elid record articl element keyword tabl author element keyword separ tabl partit queri scope queri section articl author execut inspect tabl partit data specif goal process xml queri retriev individu element document obtain relat schema store invert type tag word xml data set store tabl high number invert file store ten thousand current rdbmss capabl manag larg number tabl number tabl partit limit popular word occur element tabl xml data set section shown figur store tabl sort elid number intern repres speed queri process find element specif keyword achiev merg relev tabl keyword sort achiev creat cluster index elid column tabl establish index docid type column element tabl docid url column document tabl variant mention previou wai partit inform invert file relat altern scheme partit word docid scheme benefici queri retriev inform specif document partit scheme depend queri workload problem partit scheme previou section speed queri process materi intersect tabl queri articl involv keyword benefici materi join tabl bibliograph queri process directli tabl individu tabl result relat schema depth loc depth loc depth loc elid tabl refer articl element note word context materi bibliograph queri materi join tabl materi depend queri workload popular approach ir commun ignor stop word invert file stop word word frequent exampl word stop word ir system ir system find relev document match queri stop word import order determin relev document stop word word frequent element tag carri import inform element interest answer fulli match ir system gear give ten hundr document match queri count number citat work donald knuth comput scienc paper valid queri involv find thousand exist approach improv queri process perform includ bitmap compress techniqu techniqu exploit context implement techniqu part work reli capabl rdbmss bitmap index techniqu compress techniqu integr relat system explor featur futur work extend queri process turn discuss queri predic process describ queri process scenario invert file xml data store replic rdbm discuss scenario introduct replic xml data rdbm queri process rdbm revisit queri keyword search implement rdbm describ extens integr keyword search wai store xml data rdbm execut xml queri binari tabl approach present approach show good robust perform basic idea approach establish id sourc target sourc target year sourc target author titl sourc target figur tabl result xml section binari tabl type tag xml data entri binari tabl sourc target entri denot target subel sourc depth target type entri denot sourc attribut subel idref target binari tabl repres structur xml document base valu pcdata integ store binari tabl separ tabl store valu binari tabl binari tabl articl repres binari tabl attribut font tabl attribut store invert file attribut build kei tabl repres bold sourc elid refer articl target elid refer subel target null articl subel part articl part null articl text detail binari approach found explain kind queri translat sql includ complex queri involv regular path express wild give figur show binari tabl xml data set section queri section execut sql select articl author titl year keyword search rdbm invert file store rdbm store invert keyword search integr straightforward queri involv predic specif tabl store entri invert file keyword join part process queri approach demonstr mean exampl simpl queri search element type articl mention word queri express extens construct execut extend queri processor translat simpl sql select elid queri author written paper mention word demonstr keyword search xml queri process coexist queri formul construct queri translat sql select articl year author execut sql optim rdbm find good order join individu tabl point rdbm interleav keyword search regular queri process binari approach author rdbm awar keyword search queri process keyword search invert file order execut queri predic join tabl store invert file materi join order speed execut queri queri rewritten queri involv tabl structur select articl year author optim rdbm decid carri join tabl tabl good rdbm earli poor optim tabl cost queri case kind care distribut xml queri process turn discuss process queri xml data index data store rdbm situat owner web site give permiss index user visit web site order retriev data scenario invert file store rdbm locat relev xml data sourc full queri result comput mediat mediat rdbm queri invert file access xml data sourc comput full queri result differenti data sourc queri data sourc queri capabl xml data sourc queri capabl data sourc queri queri execut invert file store rdbm find relev document elid relev document data sourc extract queri result retriev document interest step narrow search tag attribut keyword queri invert file store rdbm queri involv predic work explain queri author articl keyword titl queri written construct invert file ffl elid articl element author subel depth ffl elid articl element subel depth ffl elid articl element titl subel depth ffl elid articl element word depth interest articl meet call set articl articl articl match articl word titl narrow search invert file interest titl author ffl elid author element subel depth ffl elid titl element word depth ffl start end posit elid store element infer articl element titl author subel belong previou result singl sql queri show queri breviti prove good return elid articl element match queri perfect predic price evalu invert file invert file xml data idref subel test start end posit store element tabl applic stop step return elid articl element situat perfect tradit invert file invert file inform extend invert file section import find superset element match queri independ qualiti mediat access xml data sourc mediat access data sourc order construct author implement retriev step depend interfac xml data sourc data sourc support retriev individu element featur exploit entir document relev element retriev queri result produc mediat retriev document mediat check match queri construct queri result queri larg document match document load rdbm section invert file store rdbm order evalu predic retriev xml data mediat follow idref retriev document part queri execut xml data sourc queri capabl altern retriev gener queri result push part queri data data sourc queri capabl queri process carri find relev document elid previou subsect push pass elid data sourc data sourc execut part queri elid refin result return data sourc data sourc execut queri step execut literatur step call bind depend join studi extens detail refer interest reader relev experi implement prototyp queri processor keyword search top rdbm present result initi perform experi conduct prototyp report experi perform scenario xml data addit invert store rdbm environ construct shakespear plai xml format dtd xml plai oasi web site experi synthet xml document random xml kind present result experi breviti test program written rdbm server run pc disk client program ran separ pc redhat linux parser version dom parser construct tree document shakespear data consist fairli small document fit main parser work larg document size exce main memori parser work gener invert file relat index process proce xml document previou subsect construct record invert file store record file file system file record invert file big tabl rdbm partit tabl tabl word type elid sql section step step check word attribut tag xml document gener record check word exist invert file keyword requir special handl check word occurr word current element father record gener tabl summar size load time shakespear plai prototyp note size relat binari invert ten time size origin xml main reason construct invert file granular xml document build invert file fine granular combin keyword search xml queri process data volum unaccept applic plan investig special compress techniqu approxim invert file import avenu futur work size xml file number distinct word size relat load time min total load time high roughli half time spent write document content temporari file rest process time spent load data rdbm construct index dbm judici distribut process dbm file time reduc queri perform studi queri queri line speaker word love queri scene word implement queri ffl structur queri exploit full xml queri involv predic variant simul expert user ffl partial structur queri exploit plai scene scene involv line speaker variant model user partial knowledg structur data ffl unstructur queri predic model user absolut knowledg structur data queri express variant structur construct partial structur construct unstructur construct tabl show run time queri result produc variant observ queri execut partial structur variant faster structur variant turn faster unstructur variant queri result achiev structur variant partial structur unstructur user issu queri order result partial structur variant queri return result granular line user refin structur scene return partial structur attempt queri queri run time queri result run time queri result structur sec line sec scene part structur sec scene sec scene unstructur sec element sec element result achiev expert user fulli structur data predic support novic user mention reason expert novic user refin queri add structur structur specif result approach step simpl pc power expect novic user speak xml queri user graphic queri interfac gener queri predic relat work extens studi inform retriev literatur specif work xml queri process report inform retriev techniqu current web search engin xml html text data make work show keyword search integr queri process work xml start queri languag extend integr keyword search queri languag xml xql xsl simpl queri capabl languag data struql languag support featur regular path express order search pattern structur xml data keyword support except lorel recent extend featur similar number compani product store queri exampl oracl xml develop kit support keyword search oracl index xml document store flat structur queri languag text index compani begun work queri process keyword search xml branch sequoia softwar launch product publish detail approach show exist xml queri languag extend order support keyword search extend xml queri languag implement import data structur keyword search invert file gave extens invert file xml queri process show invert file store queri relat system techniqu paper easili implement easier addit invert xml data store replic relat system combin keyword search regular queri process system support user partial knowledg structur xml data refin queri experi show keyword search xml queri process carri effici structur faster queri user total unstructur queri execut structur higher qualiti queri result structur result produc low result return complet unstructur queri refin queri order result flip side approach extend invert file unusu factor ten larger origin data import goal futur work investig variant invert file significantli smaller show good perform refer peter susan gerd dan suciu queri languag optim techniqu unstructur data proc acm sigmod conf manag page stefano sara stefano letizia tanca graphic languag queri restructur xml document proc int world wide web confer volum page mari daniela alon dan suciu queri languag xml proc int world wide web confer volum page mari dan suciu store semistructur data store proc acm sigmod conf manag page daniela florescu donald kossmann store queri xml data ieee data engin volum page daniela alon ioana dan suciu queri optim presenc limit access pattern proc acm sigmod conf manag page william frake ricardo editor inform data structur algorithm simon extens data clean tool proc acm sigmod conf manag iyer david data compress support jorg matthia carlo proc int conf larg data base page johnson perform measur compress bitmap indic proc int conf larg data base page chun david jeffrei naughton relat queri xml limit opportun proc int conf larg data base page moerkott implement perform compress novemb technic report mannheim jennif widom data manag research direct ieee data engin volum page vita daniela florescu receiv phd space object orient queri research inria project dr florescu author queri languag main design strudel manag system current research interest includ xml technolog queri static queri web site data clean daniela florescu member work group xml queri languag donald kossmann receiv msc passau ph comput scienc technic aachen research associ colleg park assist professor comput scienc passau research focuss distribut system ioana manolescu receiv msc ecol normal ph student inria topic optim semistructur interest xml schema extract storag queri optim data integr system daniela florescu donald work system enabl relat data integr engin process xml document
IR/932 5 sampl page uniformli world wide web david pennock £ steve lawrenc £ lee gile ¤ ¥ depart manag scienc stanford nec research independ nj school inform scienc pennsylvania state pa abstract present algorithm gener uniformli random sampl page world wide build recent work al al al al algorithm base weight methodolog algorithm oper arbitrari direct natur applic web show algorithm gener sampl uniformli random algorithm oper undirect requir mechan obtain inbound link web page access search addit knowledg inbound algorithm arriv uniform distribut faster deriv explicit bound time converg evalu algorithm simul web show yield reliabl uniform sampl page compar result previou discuss theoret relationship method introduct world wide web massiv network reflect idea trend societi accur content structur provid window interest million individu organ globe obtain good estim quantiti due sheer size page januari lawrenc gile distribut dynam natur exhaust web page technic challeng costli result rapidli outdat page kahl reason approach infer statist base random sampl web page gener uniform sampl web page nontrivi problem method standard methodolog emerg lawrenc gile gile queri major search part work conduct visit nec research institut engin estim overlap infer bound size index web estim search rel coverag author gile emploi sampl approach base random test ip address determin characterist host page found updat size estim web bharat broder broder methodolog base gener random queri method make explicit hyperlink structur web view web direct graph node correspond web page edg correspond hyperlink sampl web page gener crawl web graph polici al al present crawl polici base reweight result random crawl order approxim uniform sampl algorithm refer make pagerank web page pagerank measur popular web part googl rank search result page author explain method ideal yield uniform point practic theoret discuss compar experi section gener sampl web page larg number inbound link al al altern method sampl web page uniformli method assum web undirect hyperlink backward forward web practic algorithm queri search engin inbound link page experi appli actual type approxim result sampl develop algorithm gener uniform sampl built methodolog approach work arbitrari direct directli applic web prove asymptot algorithm gener uniform sampl web expect number occurr sampl page web algorithm provabl asymptot converg real web algorithm analysi modifi algorithm oper undirect graph assum knowledg inbound link page show problem analysi simplifi addit deriv formal bound time converg empir result comparison test algorithm simul direct web show gener sampl independ number link page directli compar algorithm sampl simul web data undirect model assumpt outperform isol kei approxim lead show modifi thought special case conclud summari discuss futur research direct setup notat broder al al find web divid main central strongli connect set page reach core connect back set page connect core reach set page disconnect core seek gener uniform sampl page core page reachabl core sampl method base random walk hope sampl page reachabl start page statist subset web suffici repres publicli access web page interest view web direct graph web page node hyperlink edg denot set web page assum loss gener page strongli connect core matrix defin matrix thought connect matrix element denot connect page web note assum node connect diagon element equal page hyperlink connect back page make assumpt exist page reach page edg assumpt hold page strongli connect core page reachabl core denot matrix obtain normal row sum transit probabl matrix random walk hyperlink chosen uniformli random assumpt impli random walk diagon element aperiod standard result stochast process exist stationari distribut algorithm analysi stationari distribut repres asymptot frequenc visit page random walk transit probabl suffici long expect frequenc web page web page includ sampl probabl expect number occurr web page sampl yield uniformli random sampl true estim web page collect initi comput estim stationari probabl perform random walk record walk visit page formal definit algorithm note design algorithm start web page crawl web transit probabl time period ¥ time continu crawl web denot web page visit denot addit time period collect distinct web page collect crawl note web page repeat page comput estim ari probabl crawl web ing time period start page denot sequenc web page ¥ ¤ £ visit ¥ ¥ ¥ indic random variabl equal includ page probabl number ¤ final sampl set ¤ posit ¤ ¤ proposit establish suffici larg return sampl set uniform sampl asymptot expect number occurr page page proposit web page final set web page return step algorithm proof recal ¥ variabl denot collect web page gather step rithm ¤ random variabl defin ¤ ¤ repres ¤ event includ sampl collect random variabl correspond set web page final sampl denot start page crawl step ¥ ¤ ¥ ¤ ¤ ¤ ¤ ¤ ¤ ¤ equal fact state time random correspond ¥ ¤ standard result stochast process impli ¤ ¥ bound time converg larg valu requir produc potenti affect practic run entir web note paramet time perform record inform elimin depend induc distribut random ¥ instanti step number page order estim stationari ¥ distribut web page high number inbound link visit algorithm produc accur estim stationari probabl small web page small number inbound link vast major occur infrequ larg obtain good estim page elimin estim phase assum access inbound link page pursu techniqu reduc bound time converg examin potenti algorithm conjunct crawler van den dom diligenti al order gener uniform sampl subset web entir web algorithm analysi page collect step includ final sampl probabl proport estim stationari probabl qualiti result sampl depend cantli accur estim true stationari probabl section show assum web undirect algorithm greatli simplifi expedit assumpt requir knowledg page point web page assumpt partial justifi fact search engin queri inbound link web page search complet fulli perform queri time consum costli undirect defin matrix mean hyperlink matrix denot connect matrix web page ignor assumpt hold page strongli connect page reachabl page connect core transit probabl matrix defin matrix correspond transit probabl web hyperlink chosen uniformli random follow point web page ¢ denot number link ¢ total number connect page applic algorithm case undirect graph reli lemma sum number link page lemma stationari £ distribut ¢ ¢ ¤ denot total number edg graph proof ¢ ¤ irreduc aperiod stationari distribut exist uniqu suffic show note ¥ desir lemma explicit formula stationari distribut basic algorithm present section step estim stationari probabl elimin potenti long crawl step requir direct case formal definit algorithm algorithm start web page crawl web transit probabl time period time continu crawl web denot ¥ web page visit crawl addit time period ¢ ¤ page tive number includ ¤ sampl ¢ probabl ¤ proof proposit immedi extend current case assum web model undirect put bound deviat sampl sampl denot denot set web ¤ denot collect hyperlink ¢ denot maximum denot diamet web denot collect shortest path point web denot maximum number path singl edg common measur web graph proposit proposit impli suffici larg expect number occurr web page ¤ sampl approach show rate converg exponenti paramet depend graphic properti maximum bottleneck plan comput estim quantiti real web proof proposit reli result geometr bound eigenvalu markov chain lemma transit probabl markov chain state space distribut assum irreduc ¤ ¥ eigenvalu ¥ proof proposit ¥ ¢ ¤ ¥ ¥ lemma connect graph denot random walk ¥ denot largest eigenvalu ¥ ¢ ¢ ¢ maximum diamet ¥ ¥ denot collect shortest path point graph proof corollari ¥ lemma connect graph bipartit path odd length collect denot random walk denot smallest eigenvalu ¢ ¢ maximum ber edg ¥ maximum proof corollari node web graph lemma collect ¢ bound proof proposit ¥ step ¤ proof web page recal collect denot collect random variabl defin ¤ ¤ ¢ ¤ repres ¤ event includ sampl collect ¤ ¤ random variabl correspond set web page final sampl impli ¥ ¤ ¢ ¥ ¤ ¥ £ ¤ equal lemma start web ¤ correspond web page visit time lemma ¥ ¥ denot largest eigenvalu transit probabl denot smallest eigenvalu equal express stationari probabl lemma lemma desir result empir result comparison present evalu includ comparison previou algorithm describ modifi algorithm view special case isol kei approxim step lead sampl test algorithm simul web graph belong primari strongli connect compon graph gener pennock al extens albert model web growth model gener undirect graph edg distribut ident real web convert result undirect graph direct graph assign edg random ran algorithm paramet result sampl size method base random expect number inbound outbound link sourc sampl bia figur compar distribut inbound link sampl set true distribut entir graph figur displai comparison outbound link likelihood page occur sampl independ number link page true inlink distribut sampl inlink distribut ratio gener sampl random sampl number inlink figur distribut inbound link simul web graph distribut inbound link page return algorithm ratio sampl distribut true random sampl algorithm figur show histogram node id number sampl node graph group ten bucket figur show proport sampl node chosen bucket sampl proport bucket figur plot ratio proport bucket true expect uniform sampl systemat bia sampl true outlink distribut sampl outlink distribut ratio gener sampl random sampl number outlink figur comparison sampl actual outbound link distribut algorithm node number ratio gener sampl random sampl bin number figur distribut node number sampl gener algorithm present empir result algorithm experi perform undirect graph node main connect gener pennock al model web growth time set start node set node number gener sampl size node choic web page visit accept sampl figur show distribut number edg graph versu sampl bottom portion figur show ratio proport node sampl number edg versu true proport systemat bia node small larg figur show histogram node number gener algorithm true edg distribut edg distribut random sampl undirect sampl ratio number edg figur distribut number edg sampl gener algorithm node number random sampl undirect sampl ratio bin number figur distribut node number sampl gener algorithm compar experi compar result sampl al al denot total number node graph algorithm conduct random walk ¢ node probabl neighbor chosen probabl ¢ node graph chosen random node random node al al approxim step node visit final sampl gener visit node probabl proport pagerank algorithm conduct random walk graph construct node graph construct perform assum node origin graph bound constant graph built ad number loop node node graph stationari distribut random walk graph uniform true edg distribut node edg distribut edg distribut edg distribut ratio pagerank regular undirect number edg figur distribut edg simul undirect graph distribut edg page return algorithm distribut edg page return algorithm distribut edg page return algorithm ratio sampl distribut true algorithm time sampl initi seed set size ran sampl size collect algorithm gener sampl uniqu vast major node repeat due ¢ ¢ assum knowledg true algorithm figur show true edg distribut simul web sampl distribut algorithm produc uniform notic bia base number edg incid node exhibit consist bia page larg number edg note origin idea underli algorithm special case algorithm ideal crawl polici correspond transit probabl ¥ ¢ £ £ random walk page visit includ sampl probabl denot number outlink web page proport pagerank denot turn stationari probabl page transit probabl idea underli similar emploi altern crawl polici stationari distribut sourc bia sampl stem approxim step requir al al conduct random walk web graph transit probabl matrix recal probabl ¢ web page chosen random page feasibl web page algorithm place author approxim step randomli page visit conjectur primari sourc error contribut bia result sampl present algorithm uniform random sampl world wide web page algorithm gener sampl provabl uniform limit tradeoff algorithm algorithm natur suit work direct long time converg sampl algorithm converg formal bound converg algorithm requir assumpt hyperlink backward forward empir test verifi algorithm produc uniform sampl simul web algorithm perform algorithm method recent literatur discuss theoret connect highlight kei approxim step lead sampl refer approxim aggreg queri web page random walk intern confer larg data base emerg scale random network scienc techniqu measur rel size overlap public web search engin intern world wide web confer anatomi hypertextu web search engin seventh intern world wide web confer graph structur web intern world wide web confer van den approach web resourc discoveri intern world wide web confer geometr bound eigenvalu markov chain annal appli probabl crawl context graph intern confer larg vldb url sampl intern world wide web januari web surpass billion document press preserv internet scientif american search world wide web scienc access inform web natur winner model web link accumul prepar
ML/933 6 submit learn appli document recognit leon patrick neural network train backpropag algorithm constitut success learn techniqu network learn algorithm complex surfac classifi pattern handwritten minim preprocess paper review method appli handwritten charact recognit compar standard handwritten digit recognit task convolut neural specif design deal variabl shown outperform techniqu document recognit system multipl modul includ field languag model learn call graph transform network system train global method minim perform measur system handwrit recognit experi demonstr advantag global flexibl graph transform network graph transform network read bank check convolut neural network charact recogn combin global train techniqu record accuraci busi person check deploi commerci read million check month neural document machin convolut neural graph transform finit state transduc introduct machin learn appli neural plai increasingli import role design pattern recognit system argu avail learn techniqu crucial factor recent success pattern recognit applic continu speech recognit handwrit recognit main messag paper pattern recognit system built reli automat heurist made recent progress machin learn comput technolog charact recognit case show featur extract advantag replac carefulli design author speech imag process servic research schulz drive red nj bengio depart dinformatiqu de recherch universit de cp succ de la canada trainabl classifi modul featur extract modul class score featur vector raw input fig tradit pattern recognit perform fix featur trainabl classifi learn machin oper directli pixel imag document understand case show tradit build recognit system manual integr individu design modul replac unifi design call graph transform train modul optim global perform criterion earli dai pattern recognit variabl rich natur type make imposs build accur recognit system hand pattern recognit system built combin automat learn techniqu algorithm usual method recogn individu pattern consist divid system main modul shown figur call featur transform input pattern repres vector short string symbol easili match invari respect transform distort input pattern chang natur featur extractor prior knowledg specif task focu design trainabl main problem approach recognit accuraci larg determin abil design set featur turn daunt task redon problem larg amount pattern recognit literatur devot describ compar rel merit featur set task requir featur extractor due fact learn techniqu submit classifi limit space easili separ class combin factor chang vision decad avail machin fast arithmet unit reli method algorithm refin avail larg problem larg market wide handwrit enabl design reli real data featur extract build recognit system import factor avail power machin learn techniqu handl input gener intric function fed larg data set argu recent progress accuraci speech handwrit recognit system attribut larg part relianc learn techniqu larg train data set evid larg proport modern commerci ocr system form neural network train task handwritten charact recognit compar perform learn techniqu benchmark data set handwritten digit recognit automat learn learn techniqu succe minim amount prior knowledg task case neural good incorpor knowledg tailor architectur task convolut neural network introduc section ii special neural network architectur incorpor knowledg invari shape local connect constraint weight comparison method isol handwritten digit recognit present section iii recognit individu charact recognit word sentenc idea combin multipl modul train reduc error introduc section iv recogn object handwritten word system modul manipul direct graph lead concept trainabl graph transform network introduc section iv section describ classic method heurist recogn word charact string discrimin techniqu train recogn word level requir manual segment label present section vii section viii present neural network approach elimin segment heurist scan recogn locat input section shown trainabl graph transform network formul multipl gener base gener graph composit algorithm connect hidden markov commonli speech recognit treat section describ global train system recogn handwrit enter pen comput problem handwrit machin produc feedback user write core system convolut neural network result demonstr advantag train recogn word train isol charact section xi describ complet system read handwritten bank check core system convolut neural network call section ii system commerci ncr corp line check recognit system bank industri read million check month bank learn data approach automat machin success popular recent year neural network call learn learn machin comput function input repres collect adjust paramet system pattern recognit output interpret recogn class label pattern score probabl class loss function measur discrep desir output pattern output produc system averag loss function train averag error set label exampl call train set simplest learn problem consist find minim train perform system train set interest relev measur error rate system practic perform estim measur accuraci set sampl disjoint train call test set theoret work shown gap expect error rate test set test error rate train set train number train sampl approxim test train ff number train measur complex machin ff number constant gap number train sampl capac train capac train optim capac achiev lowest gener error test learn algorithm attempt minim train estim gap formal version call submit structur risk minim base defin sequenc learn machin sequenc subset paramet space subset superset previou subset practic structur risk minim implement minim train function call regular fi constant chosen larg valu paramet belong subset paramet space minim effect limit capac access subset paramet control tradeoff minim train error minim expect gap train error test error learn gener problem minim function respect set paramet root issu comput scienc learn draw fact gener easier minim continu function discret function loss function minim estim impact small variat paramet valu loss function measur gradient loss function respect paramet effici learn algorithm gradient vector comput analyt numer basi numer learn algorithm paramet procedur set paramet respect differenti simplest minim procedur set gradient descent algorithm iter adjust ffl simplest ffl scalar constant sophist procedur variabl substitut diagon substitut estim hessian matrix newton method conjug gradient method appendix show claim contrari method larg learn machin limit popular minim procedur stochast gradient call updat consist updat paramet vector version averag gradient common instanc updat basi singl ffl pk procedur paramet vector fluctuat averag converg faster regular gradient descent order method larg train set redund sampl encount speech charact reason explain appendix properti algorithm appli learn studi theoret practic success task occur mid eighti gradient learn procedur late limit linear system simpl gradient descent techniqu complex machin learn task wide realiz event occur event realiz earli warn contrari presenc local minima loss function major problem practic appar notic local minima major impedi success earli learn techniqu boltzmann machin event popular hinton william simpl effici comput gradient system layer process event demonstr procedur appli neural network sigmoid unit solv complic learn task basic idea gradient comput effici propag output input idea control theori literatur earli sixti applic machin learn gener realiz earli deriv context neural network learn target unit intermedi layer minim disturb argument lagrang formal control theori literatur rigor method deriv deriv gener recurr network network heterogen modul simpl deriv gener system section fact local minima problem neural network theoret mysteri conjectur network overs task case presenc paramet space reduc risk region wide learn wide learn algorithm form learn real handwrit recognit system isol handwritten charact recognit extens studi literatur earli success applic neural submit network compar experi recognit individu handwritten digit report section iii show neural network train learn perform method test data neural call convolut design learn extract relev featur directli pixel imag section difficult problem handwrit recogn individu separ charact neighbor word process segment techniqu call heurist consist gener larg number potenti cut charact heurist imag process subsequ select combin cut base score candid charact recogn accuraci system depend qualiti cut gener abil recogn distinguish correctli segment charact piec multipl incorrectli segment charact train recogn perform task pose major challeng difficulti creat label incorrectli segment charact simplest solut consist run imag charact string manual label charact extrem tediou costli difficult label consist half cut label half cut label section consist train system level string charact level notion learn system train minim loss function measur probabl erron answer section explor wai ensur loss function lend learn method section introduc direct acycl graph arc carri numer inform repres altern introduc idea solut section viii elimin segment altogeth idea sweep recogn locat input reli properti abil correctli recogn charact input presenc charact reject imag center charact sequenc recogn output obtain sweep recogn input fed graph transform network linguist constraint account final extract interpret similar hidden markov model make approach reminisc classic speech recognit techniqu gener convolut neural network make attract save comput cost global trainabl system state practic pattern recognit system multipl modul document recognit system field extract region field cut input imag imag candid classifi score candid contextu gener base stochast select grammat correct answer gener recogn inform carri modul modul repres graph numer inform attach arc output recogn modul repres acycl graph arc label score candid path repres altern interpret input string modul manual context charact recogn train label imag charact complet system subset paramet modul manual adjust maxim perform step extrem suboptim altern train entir system minim global error measur probabl charact misclassif document level find good minimum global loss function respect paramet system loss function measur perform made differenti respect system tunabl paramet find local minimum learn sheer size complex system make intract ensur global loss function system built network differenti modul function implement modul continu differenti respect intern paramet modul weight neural net charact recogn case charact recognit respect modul input simpl gener procedur effici comput gradient loss function respect paramet system system built cascad implement function xn fn xn vector repres output wn vector submit tunabl paramet modul subset modul input vector previou modul output input modul input pattern partial deriv respect xn partial deriv respect wn comput backward recurr jacobian respect evalu point jacobian respect jacobian vector function matrix partial deriv output respect input equat comput term gradient equat gener backward procedur neural network averag gradient train pattern obtain full gradient interest note instanc explicitli comput jacobian matrix formula product jacobian vector partial easier comput product directli comput jacobian analog ordinari neural modul call hidden layer output observ complex situat simpl cascad modul partial deriv notat ambigu awkward complet rigor deriv gener case lagrang function tradit neural network special case state inform xn repres modul altern layer matrix multipl sigmoid function state state inform complex recognit system repres graph numer inform attach arc call graph graph produc graph output network modul call graph transform network section vii ix develop concept show learn train paramet modul minim global loss function paradox gradient comput state inform repres essenti discret object difficulti shown ii convolut neural network isol charact recognit abil network train gradient descent learn map larg collect exampl make obviou candid imag recognit task tradit model pattern featur extractor gather relev inform input elimin irrelev variabl trainabl classifi categor result featur vector class network classifi potenti interest scheme reli learn featur extractor case charact network fed raw input ordinari fulli connect network success task charact problem typic imag hundr variabl layer hundr hidden unit ten thousand weight larg number paramet capac system requir larger train set memori requir store weight rule hardwar implement main defici unstructur net imag speech applic invari respect local distort input input layer neural charact approxim center input field preprocess handwrit normal word posit variat individu charact combin variabl write variat posit distinct featur input object network suffici size learn produc output invari respect variat learn task result multipl unit similar weight pattern posit locat input detect distinct featur input learn weight configur requir larg number train instanc cover space variat convolut shift invari automat obtain forc replic weight configur space defici architectur topolog input input variabl present order affect outcom train imag strong local variabl spatial tempor nearbi highli correl local correl reason advantag extract combin local featur recogn spatial tempor configur neighbor variabl classifi small number categori convolut submit work forc extract local featur restrict recept field hidden unit local convolut network convolut network combin architectur idea ensur distort local recept share weight weight spatial tempor typic convolut network recogn dub shown figur input plane receiv imag charact approxim center unit layer receiv input set unit locat small neighborhood previou layer idea connect unit local recept field input back perceptron earli simultan discoveri neuron cat visual system local connect time neural model visual learn local recept neuron extract elementari visual featur orient corner similar featur signal speech featur combin subsequ layer order detect featur state distort shift input posit salient featur vari elementari featur detector part imag entir imag knowledg appli forc set recept field locat place ident weight vector unit layer organ plane unit share set weight set output unit plane call featur map unit featur map constrain perform oper part imag complet convolut layer featur map weight multipl featur extract locat concret layer shown figur unit hidden layer organ featur map unit featur map input connect area call recept field unit unit trainabl coeffici trainabl bia recept field contigu unit featur map center correspondingli contigu unit previou layer recept field neighbor unit overlap hidden layer recept field horizont contigu unit overlap column row state unit featur map share set weight bia detect featur locat input featur map layer set weight extract type local featur case input locat type featur extract unit ident locat featur map sequenti implement featur map scan input imag singl unit local recept store state unit locat featur map oper addit bia squash convolut network kernel convolut set connect weight unit featur map interest properti convolut layer input imag featur map output shift left unchang properti basi robust convolut network shift distort input featur exact locat import approxim posit rel featur relev input imag endpoint roughli horizont segment upper left corner upper endpoint roughli vertic segment lower portion input imag posit featur irrelev identifi potenti harm posit vari instanc charact simpl reduc posit distinct featur encod featur map reduc spatial resolut featur map achiev layer perform local averag reduc resolut featur reduc sensit output shift distort hidden layer layer layer featur featur map previou layer recept field unit area previou layer featur map unit comput averag multipli trainabl add trainabl pass result sigmoid function contigu unit contigu recept field layer featur map half number row column featur map previou layer trainabl coeffici bia control effect sigmoid nonlinear coeffici unit oper layer blur input coeffici unit perform function depend bia success layer convolut typic result number featur map spatial resolut unit hidden layer figur input connect featur map previou layer inspir notion implement global learn procedur submit input convolut subsampl convolut featur map subsampl map map layer map layer full connect full connect gaussian connect output fig architectur convolut neural digit recognit plane featur set unit weight constrain ident larg invari geometr transform input achiev progress reduct spatial resolut progress rich number featur weight learn convolut network featur extractor weight share techniqu interest side effect reduc number free reduc machin reduc gap test error train error network figur trainabl free paramet weight share convolut network appli handwrit recognit charact recognit handwrit recognit face recognit convolut network share weight singl tempor dimens neural network phonem recognit spoken word recognit recognit isol handwritten charact signatur verif section describ detail architectur convolut neural network experi count trainabl paramet input pixel imag significantli larger largest charact pixel center reason desir potenti distinct featur stroke corner center recept field featur detector set center recept field convolut layer form area center input valu input pixel normal background level correspond foreground correspond tabl column featur map combin unit featur map make input roughli varianc roughli learn convolut layer label subsampl layer label layer label layer index layer convolut layer featur map unit featur map connect neighborhood input size featur map prevent connect input fall boundari trainabl connect layer layer featur map size unit featur map connect neighborhood featur map input unit multipli trainabl ad trainabl bia result pass sigmoid function recept field featur map half number row column featur map layer trainabl paramet connect layer convolut layer featur map unit featur map connect neighborhood ident locat subset featur map tabl show set featur map combin featur map connect featur map featur reason twofold connect scheme number connect reason bound submit forc break symmetri network featur map forc extract featur set input connect scheme tabl featur map input contigu subset featur map input contigu subset input discontinu subset final input featur map layer trainabl paramet connect layer layer featur map size unit featur map connect neighborhood featur map similar layer trainabl paramet connect layer convolut layer featur map unit connect neighborhood featur map size size featur map amount full connect label convolut input made bigger featur map dimens larger process dynam size convolut network section section viii layer trainabl connect layer unit reason number design output explain fulli connect trainabl paramet classic neural unit layer comput dot product input vector weight bia ad weight denot unit pass sigmoid squash function produc state unit denot squash function scale hyperbol amplitud function determin slope origin function horizont asymptot constant chosen choic squash function appendix output layer euclidean radial basi function unit input output rbf unit comput ij output rbf unit comput euclidean distanc input vector paramet vector input paramet larger rbf output output fig initi paramet output rbf recogn full ascii set rbf interpret penalti term measur fit input pattern model class rbf probabilist rbf output interpret unnorm neg gaussian distribut space configur layer input loss function design configur close paramet vector rbf correspond pattern desir class paramet vector unit chosen hand fix compon paramet vector set chosen random equal probabl chosen form error correct code suggest design repres styliz imag charact class drawn bitmap number recogn isol recogn string charact full printabl ascii set charact digit squar similar output code system combin linguist correct code class output rbf ambigu charact pick interpret figur output code full ascii set reason distribut common code call place cell output distribut code tend behav badli number class larger dozen reason output unit code time difficult achiev sigmoid unit reason classifi recogn reject rbf distribut code unlik activ circumscrib region input space pattern fall submit paramet vector rbf plai role target vector layer worth point compon vector rang sigmoid prevent sigmoid satur point maximum curvatur sigmoid forc unit oper maxim rang satur sigmoid avoid lead slow converg loss function loss function simplest output loss function network maximum likelihood estim criterion case minimum squar error criterion set train sampl output rbf correspond correct class input pattern cost function lack import properti paramet rbf total solut rbf paramet vector state constant equal paramet vector case network ignor rbf output equal phenomenon occur rbf weight adapt problem competit class competit obtain discrimin train dub map similar maximum mutual inform criterion train hmm correspond maxim posterior probabl correct class minim logarithm probabl correct input imag class background class label term mean addit push penalti correct class mse criterion pull penalti incorrect term plai role necessarili smaller equal loss function posit constant prevent penalti class larg push posterior probabl class label ratio discrimin criterion prevent mention rbf paramet learn rbf center section present gener criterion system learn classifi multipl object input charact word comput gradient loss function respect weight layer convolut network standard algorithm slightli modifi account weight share easi implement comput partial deriv loss function respect network convent network weight share partial deriv connect share paramet ad form deriv respect paramet larg architectur train requir techniqu appendix section appendix describ detail sigmoid weight initi section describ minim procedur stochast version diagon approxim procedur iii result comparison method recogn individu digit problem involv design practic recognit excel benchmark compar shape recognit method exist method combin featur extractor trainabl studi concentr adapt method oper directli imag modifi nist set train test system paper construct nist special special binari imag handwritten digit nist origin design train set test set cleaner easier recogn reason found fact collect censu bureau collect student draw learn experi requir result independ choic train set test complet set sampl build mix nist dataset digit imag written writer contrast block data writer data scrambl writer ident inform writer split charact written writer train set remain writer test set set exampl train set submit fig exampl complet exampl start pattern make full set train pattern test set complet exampl start pattern make full set test pattern experi subset test imag full train sampl result call modifi dataset origin black white imag size normal fit pixel box preserv aspect ratio result imag grei level result techniqu normal algorithm version imag center imag comput center mass translat imag posit point center field field extend background pixel version refer regular version charact imag crop pixel imag comput moment inertia pixel foreground pixel background pixel shear imag horizont shift line princip axi vertic version refer version earli imag reduc pixel regular train test exampl center center mass figur show exampl randomli pick test set result version train regular iter entir train data perform session valu global learn rate equat appendix diagon hessian approxim reevalu appendix fix entir iter paramet set result effect learn rate pass vari approxim set paramet test error rate stabil pass train set error rate train set reach pass author report observ common phenomenon overtrain train neural network adapt algorithm task train error test error minimum start number iter phenomenon observ case learn curv figur show reason learn rate larg effect weight settl local minimum oscil randomli averag cost lower broader minimum stochast gradient similar effect regular term favor broader minima broader minima correspond solut larg entropi paramet benefici gener error influenc train set size measur train network exampl result train error test error shown figur clear special architectur train data improv accuraci verifi artifici gener train exampl randomli distort origin train imag train set origin pattern instanc distort pattern randomli pick distort paramet distort combin planar affin horizont vertic squeez horizont compress vertic horizont shear figur show exampl distort pattern train distort data test error rate drop train paramet deform total length train session left unchang pass pattern interest note network effect individu sampl pass submit test train error rate train set iter fig train test error function number pass pattern train set averag train error measur train proce explain train error larger test error converg attain pass train set train error test error test error train set size error rate fig train test error achiev train set size graph suggest larger train set improv perform squar show test error train pattern artifici gener random distort test pattern distort figur show misclassifi test exampl exampl genuin perfectli identifi written style show improv expect train data comparison classifi sake varieti trainabl classifi train test earli subset result present error rate test set method shown figur linear linear classifi possibl simplest classifi linear classifi input pixel contribut fig exampl distort ten train pattern fig test pattern misclassifi imag displai correct answer network answer error genuin ambigu digit written style train set weight sum output unit output unit highest sum contribut bia class input charact regular error rate network free paramet test error rate network free paramet defici linear classifi document includ simpli form basi comparison sophist classifi combin sigmoid linear gradient descent learn directli solv linear system gave similar result simpl improv basic linear classifi test idea train unit network separ class class case layer unit label submit euclidean euclidean pca quadrat rbf linear svm poli poli local poli boost tangent distanc linear linear fig error rate test set classif method classifi train test version train set augment artifici distort exampl system pixel imag uncertainti quot error rate unit train produc pattern class pattern class train pattern final score class sum output unit label minu sum output unit label error rate regular test set baselin nearest neighbor classifi simpl classifi neighbor classifi euclidean distanc measur input imag classifi advantag train brain part requir memori requir recognit time complet twenti twenti pixel train imag megabyt byte run time compact modest error rate regular test set error rate error rate realist euclidean distanc system oper featur vector directli system present studi oper directli result baselin comparison princip compon analysi polynomi classifi preprocess stage construct comput project input pattern princip compon set train vector comput princip input compon comput subtract train vector covari matrix result vector comput diagon singular decomposit featur vector input polynomi classifi classifi linear classifi modul comput product pair input variabl error regular test set radial basi function network rbf network construct layer gaussian rbf unit layer simpl input output linear classifi rbf unit divid group group unit train train exampl class adapt algorithm layer weight comput regular method submit error rate regular test set layer fulli connect neural network classifi test fulli connect neural network layer weight hidden train version appendix error regular test set network hidden network hidden unit artifici distort gener train data brought margin hidden hidden unit imag test error jump network hidden unit remain mysteri network larg number free paramet manag achiev low test error conjectur dynam gradient descent learn net effect origin weight space saddl point attract weight invari shrink epoch theoret analysi confirm small weight sigmoid oper make network essenti network learn weight progress effect capac network implement vapnik risk principl theoret understand empir layer fulli connect neural network effect layer neural network train theoret result shown function approxim layer neural network author observ layer architectur yield perform practic situat phenomenon observ test error rate network result layer obtain margin weight connect network size yield margin improv error train distort pattern improv perform error network small convolut convolut network attempt solv dilemma small network learn train larg network earli embodi convolut network architectur includ comparison imag pixel center input layer step requir evalu convolut natur number free paramet architectur develop version usp postal servic zip size tune match data achiev test error fact network small number paramet attain good error rate indic architectur task experi made clear larger convolut network make optim larg size train set design address problem similar detail architectur featur subsampl map connect pair featur featur subsampl fulli connect layer output layer connect free paramet test error seri replac layer euclidean nearest neighbor method bottou vapnik local linear classifi retrain time test pattern shown method improv raw error improv reject perform boost theoret work schapir drucker al develop method combin multipl classifi train usual train pattern filter net machin mix net wrong net train pattern net output net simpli ad error rate artifici distort imag order sampl train net test error rate classifi boost time singl net net produc high confid net call averag comput cost time singl net tangent distanc classifi tangent distanc classifi nearestneighbor method distanc function made insensit small distort translat input imag imag point high submit pixel space equal number evolv distort charact trace curv pixel space distort defin manifold pixel space small vicin origin manifold approxim tangent plane excel measur charact imag distanc tangent set distort gener plane includ line thick variat test error rate achiev pixel imag techniqu simpl euclidean distanc multipl resolut reduc number tangent distanc calcul support vector machin polynomi classifi method gener complex surfac impract number product term prohibit support vector techniqu extrem econom repres complex surfac includ polynomi type surfac interest subset surfac correspond hyperplan maximum distanc convex hull class space product term vapnik realiz polynomi set comput comput dot product input imag subset train sampl vector elev result linearli combin number obtain find support vector coeffici amount solv quadrat minim problem linear inequ constraint sake includ result obtain burg scholkopf report regular error rate regular test set cort vapnik report error rate svm data slightli techniqu comput cost techniqu million recognit scholkopf virtual support vector techniqu error attain scholkopf reach modifi version extrem regular svm allevi burg reduc set support vector techniqu attain regular test set comput cost discuss summari perform classifi shown figur figur show raw error rate euclidean tangent distanc svm poli local boost fig reject percentag test pattern reject achiev error system euclidean rbf tangent distanc svm poli poli poli local boost linear fig number oper recognit singl charact start imag classifi test set boost perform achiev score close figur show number pattern test set reject attain error method pattern reject output smaller predefin threshold reject perform raw error rate score decid reject pattern differ score top class boost perform enhanc version origin raw accuraci ident figur show number oper recognit singl imag method neural network demand method convolut neural network suit hardwar implement regular structur low memori requir weight singl chip mix implement predecessor shown oper speed excess charact rapid progress mainstream comput technolog render technolog quickli submit rbf tangent distanc svm poli poli poli local boost linear euclidean fig memori measur number method method requir byte variabl adequ perform obsolet implement techniqu due enorm memori comput requir train time measur neighbor essenti train time net train net train time requir pass train set amount dai cpu train silicon graphic origin singl processor import note train time relev interest final user system choic exist techniqu bring margin accuraci improv price train final user chose figur show memori number free classifi measur term number variabl store method requir byte variabl adequ perform nearestneighbor method bit pixel store templat imag neural network requir memori method perform depend factor includ run memori requir comput technolog recogn feasibl larger recogn turn requir larger train set technolog recogn complex requir week data consid long consid state art local learn optim margin tangent distanc classifi develop improv turn motiv search improv neural network architectur search guid part estim capac learn deriv measur train test error function number train exampl discov capac seri experi combin analysi characterist recognit craft find boost substanti improv modest penalti memori comput distort model effect size data set requir collect data support vector machin excel unlik high perform includ priori knowledg problem classifi imag pixel permut fix map lost pictori structur reach level perform compar convolut neural network memori comput requir svm requir factor convolut error rate close improv result techniqu plenti data method attain respect accuraci method run faster requir space techniqu neural net advantag strike train continu size invari resist convolut network suit recogn reject shape wide vari typic produc heurist segment string recognit system experi import resist distort invari obviou situat real applic charact gener segment context prior recognit segment algorithm rare perfect leav extran mark charact imag neighbor cut charact produc incomplet charact imag reliabl center normal incomplet charact danger enlarg mark genuin system resort normal imag level field word upper lower profil entir field detect normal imag fix height submit mark blown creat wide variat size vertic posit charact segment prefer recogn robust variat figur show exampl distort charact correctli recogn estim accur recognit occur scale variat factor vertic shift variat minu half height rotat minu fulli invari recognit complex shape convolut network offer partial answer problem invari robust respect geometr distort figur includ exampl robust extrem noisi condit process imag pose problem segment featur extract robustli extract salient featur clutter imag train set network shown train set salt ad pixel randomli invert probabl exampl action internet iv system graph transform network classic previou simpl form learn clear gradient algorithm equat describ gener situat simpl network altern linear transform sigmoid function deriv arrang function long comput product jacobian modul vector train system multipl heterogen answer larg complex trainabl system built special modul simplest mix convolut rbf layer trivial system recogn train simultan segment recogn correct segment figur show trainabl system system defin function implement graph interconnect modul graph implicitli defin partial order modul updat forward pass figur modul modul updat final modul modul trainabl paramet loss measur perform function input desir output loss fig trainabl system heterogen modul implement modul simplest loss function modul receiv extern input carri desir output qualit differ trainabl paramet extern input output intermedi state approach program offer conveni implement system modul instanc class modul class method member call argument input output modul comput output modul figur call method modul argument complex modul construct simpler modul simpli defin class slot member modul intermedi state variabl modul method class simpli call method member intermedi state variabl extern input output argument algorithm easili generaliz network includ influenc graph limit discuss case direct acycl graph comput deriv system simpl call modul class defin method modul argument method deriv system comput call method modul order compar forward propag phase state variabl assum slot store gradient comput backward addit storag state comput forward pass backward pass effect comput partial deriv loss respect state variabl paramet system interest dualiti properti forward backward function modul sum variabl forward direct transform simpl backward submit output fig exampl noisi charact correctli recogn output label repres penalti higher direct forward direct transform sum backward direct softwar environ obtain result call concept base dialect lisp compil fact deriv comput propag graph easi understand intuit justifi theoret lagrang function formal extend procedur network recurr connect special modul neural network standard pattern recognit techniqu formul term system train learn commonli modul includ matrix multipl sigmoid combin build convent neural network modul includ convolut rbf layer loss function repres modul singl output produc loss commonli modul simpl method method function multipl jacobian commonli exampl method fanout vice versa method multipl coeffici multipl coeffici method multipl matrix multipl matrix method addit constant ident modul insert system effect interest multiplex modul regular switch output modul select depend switch copi output modul differenti respect switch differenti respect regular input function system includ modul differenti respect paramet long switch input depend paramet switch input extern input submit layer layer layer layer graph transform graph transform fig tradit neural system commun vector layer graph transform network trainabl modul oper produc graph arc carri numer inform interest case min modul modul input output output modul minimum input function modul differenti switch surfac set measur function continu suffici ensur converg learn algorithm implement idea easili extend includ method propag approxim deriv lead direct gener modular system equat appendix multiplex modul special case gener length section architectur system dynam input data multiplex modul dynam architectur system input pattern graph transform network system flexibl tool build larg trainabl system descript previou section implicitli assum set state inform commun vector limit flexibl vector data defici notabl task deal variabl length input continu speech recognit handwritten word task requir encod relationship object featur number natur vari scene recognit composit import special case recognit string charact word vector lack flexibl task state encod probabl distribut sequenc vector symbol case linguist process distribut sequenc repres stochast gener direct graph arc vector grammar special case vector probabl symbol path graph repres sequenc vector distribut sequenc repres interpret element data arc paramet probabl distribut simpli penalti distribut sequenc handi model linguist knowledg speech handwrit recognit path repres altern interpret input success process modul progress refin interpret speech recognit system start singl sequenc acoust transform lattic phonem phonem lattic word word singl sequenc word repres interpret work build handwrit recognit found system easili quickli develop design view system network modul graph input produc graph output modul call graph complet system call graph transform modul commun state gradient form direct graph arc carri numer inform statist point state vector convent network repres mean distribut state space network neural network section state sequenc fix size vector repres probabl distribut sequenc vector state repres repres mixtur probabl distribut structur collect vector main point section show learn procedur limit network simpl modul commun gener gradient graph transform gradient respect numer inform output comput gradient respect numer inform attach input respect modul intern paramet learn appli long differenti function produc numer data output graph numer data input graph function paramet point section show function implement modul typic document process system submit fig build segment graph heurist imag recognit commonli thought combinatori differenti respect intern paramet respect usabl part global trainabl system avoid make refer probabl theori quantiti manipul view transform probabl exponenti normal multipl object heurist vi multipl object heurist difficult problem handwrit recognit recogn isol string zip check word recogn deal charact segment string individu charact imag imposs imag analysi techniqu segment natur written sequenc charact form charact recent histori automat speech recognit remind train recogn optim global criterion word sentenc prefer train phonem unit recent work shown true handwrit recognit optim criterion prefer sole train recogn charact recogn learn recogn individu reject charact minim word error section describ detail simpl address problem read string word check amount method avoid task result segment requir tradit system train individu label charact imag segment graph method word segment recognit call heurist main advantag approach segment avoid make hard segment larg number segment idea heurist imag process techniqu find candid cut word recogn score altern segment gener process depict figur number candid cut gener good candid locat cut found locat minima vertic project minima distanc upper lower contour word segment heurist section xi cut gener heurist design gener cut hope set cut includ cut altern segment repres call segment graph segment graph direct acycl graph start node end node intern node candid cut produc segment algorithm arc sourc node destin node imag ink cut sourc node cut destin node arc creat node decid ink cut form candid charact individu piec ink arc pair success piec ink separ wide clear indic belong charact complet path graph piec ink path correspond associ piec ink form charact recognit transform viterbi transform simpl recogn charact string shown figur graph transform call recognit transform rec viterbi transform goal recognit transform gener call interpret graph recognit graph int interpret segment input path int repres interpret segment input role viterbi transform extract interpret interpret graph recognit transform rec segment graph seg appli recogn singl charact imag arc segment graph interpret graph int structur segment arc replac set arc node set arc class imag arc seg shown figur arc attach class penalti imag belong class produc recogn comput penalti candid penalti combin penalti comput charact obtain submit nn nn nn nn nn nn interpret graph segment graph viterbi penalti viterbi path seg rec int viterbi transform recognit transform fig recogn charact string arc low penalti shown ti arc interpret graph combin penalti natur highli train procedur tune penalti advantag combin path interpret graph correspond interpret input word penalti interpret segment sum arc penalti path interpret graph comput penalti interpret independ segment requir combin penalti path interpret rule combin penalti parallel path section viterbi transform produc graph singl path path path cumul penalti interpret graph result recognit produc read label arc graph extract viterbi transform viterbi transform ow famou viterbi algorithm applic principl dynam program find shortest path graph effici penalti arc sourc node destin node multipl arc interpret arc label viterbi algorithm proce node cumul viterbi penalti cumul penalti comput order satisfi partial order defin interpret graph direct start node initi penalti charact recogn penalti class class label piec segment graph candid segment imag piec interpret graph charact recogn charact recogn fig recognit transform refin arc segment arc set arc interpret charact attach penalti label cumul penalti start node cumul penalti comput valu parent upstream arc destin min node minim hand side note mn minim enter arc end node reach obtain end total penalti path smallest total penalti call penalti viterbi sequenc arc node viterbi path obtain viterbi path node arc trace back node arc start end minim enter mn start node reach label sequenc read arc viterbi path vii global train graph transform network previou section describ process recogn string heurist assum recogn train give low penalti correct class label correctli segment high penalti erron categori correctli segment high penalti categori badli form charact section explain train system string level requir manual label charact segment train perform architectur slightli recognit architectur previou section submit priori knowledg expect modul order train separ heurist individu label imag train charact recogn difficult obtain set imag train model reject wrongli segment candid separ train requir addit inform lack incomplet correct segment label incorrect candid shown separ train section describ method train handwrit recogn string viterbi discrimin viterbi forward discrimin forward train gener system map criterion introduc section discrimin forward train similar maximum mutual inform criterion train hmm speech recognit differ classic make probabilist show learn discrimin train simpl instanc principl error correct learn train method sequenc recognit system hmm extens studi context speech recognit method requir system base probabilist gener model provid normal likelihood space input sequenc popular hmm learn reli normal normal preserv model neural network integr system discrimin train case author method train neural speech recogn word sentenc level global trainabl sequenc recognit system avoid difficulti statist model resort techniqu recurr neural network earli train rnn techniqu prove difficult practic techniqu present simplifi gener global train method develop speech recognit viterbi train select path interpret graph lowest penalti viterbi algorithm path lowest penalti correct label sequenc obviou loss function minim averag train set penalti path recognit transform interpret graph desir sequenc path selector constrain path constrain viterbi penalti constrain interpret graph int viterbi transform fig viterbi train architectur charact string recogn base heurist correct label sequenc lowest penalti goal train find set recogn paramet recogn neural minim averag penalti lowest penalti path gradient loss function comput architectur shown figur train architectur ident recognit architectur previou extra graph transform call path selector insert interpret graph viterbi transform transform interpret graph desir label sequenc input extract interpret graph path correct label sequenc output graph call constrain interpret graph forc align hmm path correspond correct label sequenc constrain interpret graph viterbi transform produc graph singl path path path lowest penalti path transform simpli comput cumul penalti ad penalti path output loss function current label inform requir system sequenc desir charact label knowledg correct segment requir part segment interpret graph yield lowest penalti process gradient viterbi train explain section gradient propag backward modul order comput gradient modul tune paramet gradient path straightforward partial deriv submit loss function respect individu penalti constrain viterbi path equal loss function simpli sum penalti backpropag viterbi transform equal simpl partial deriv respect penalti arc constrain graph arc constrain viterbi path legitim essenti discret function viterbi answer viterbi transform collect min function put shown section iv gradient min function effect path selector transform similar backpropag viterbi transform arc int gradient arc depend arc alter ego label gradient forward propag recognit instanc recogn singl charact creat arc segment graph state recogn instanc store arc penalti int produc individu output recogn gradient output instanc recogn recogn output gradient part correct push gradient present recogn output backpropag recogn instanc recogn obtain vector partial deriv loss function respect recogn instanc paramet recogn instanc share paramet clone full gradient loss function respect recogn paramet vector simpli sum gradient vector produc recogn instanc viterbi formul speech recognit system similar algorithm appli speech recognit system integr neural network time align hybrid system simpl train architectur flaw potenti fatal problem mention section recogn simpl neural network sigmoid output minimum loss function recogn ignor set output constant vector small valu compon problem occur recogn output simultan minimum hand recogn output layer rbf unit fix trivial solut due fact set rbf fix distinct paramet vector simultan minimum complet occur total prevent occurr loss function trivial solut constant recogn output flat spot saddl attract direct difficult minim procedur paramet rbf problem reappear rbf center converg singl underli neural network learn produc ignor input kind occur width rbf adapt occur trainabl modul neural network feed rbf occur speech recognit system gener system produc normal likelihood input data avoid train system respect discrimin train maxim condit probabl correct interpret sequenc class input imag problem viterbi train penalti answer reliabl measur confid compet answer account discrimin viterbi train modif train criterion circumv problem time produc reliabl confid valu idea minim cumul penalti lowest penalti path correct penalti compet possibl incorrect path danger low penalti type criterion call plai good answer bad discrimin train procedur attempt build separ surfac class model individu class independ model condit distribut class input imag discrimin classif separ gener model input data class class yield joint distribut class condit approach assum form distribut input data discrimin criterion differ penalti viterbi path constrain penalti viterbi path interpret differ penalti correct penalti path train architectur shown figur left side diagram ident submit path selector viterbi viterbi transform segment graph seg recognit rec interpret graph int desir answer neural net weight nn nn nn nn nn loss function segment fig discrimin viterbi train architectur charact string recogn base heurist quantiti squar bracket penalti comput forward propag quantiti partial deriv comput backward propag submit discrimin viterbi train loss function reduc risk forc recogn penalti wrongli recogn object discrimin train error correct minim differ desir output comput left half figur actual output comput half figur discrimin viterbi loss function denot call penalti viterbi path constrain penalti viterbi path unconstrain interpret posit constrain graph subset path interpret viterbi algorithm select path lowest total penalti ideal path gradient discrimin viterbi add train train figur show gradient left half ident viterbi train ident gradient half multipli contribut loss neg sign process similar left half gradient arc int posit contribut left half neg contribut half contribut penalti int arc halv connect forward pass arc int gradient contribut cost arc gradient contribut half cancel contribut left half arc part gradient arc gradient arc lower penalti make arc gradient arc low higher penalti part desir answer variat techniqu speech recognit bottou version loss function satur fix gener loss function variat method viterbi path discrimin viterbi algorithm flaw problem nonetheless main problem criterion build margin class gradient penalti constrain viterbi path equal viterbi path desir push penalti wrong path danger close good section present solut problem forward forward train penalti viterbi path perfectli partial pictur situat imagin lowest penalti path segment produc answer label argu penalti interpret smaller penalti obtain path produc multipl path ident label sequenc evid label sequenc correct rule comput penalti graph parallel path combin rule borrow probabilist interpret penalti neg log posterior probabilist posterior probabl interpret sum posterior path produc interpret translat term penalti interpret neg logarithm sum neg exponenti penalti individu path penalti smaller penalti individu path call forward algorithm comput quantiti effici penalti comput procedur interpret call forward penalti concept constrain subgraph interpret graph path consist label sequenc constrain graph label sequenc empti infinit run forward algorithm constrain graph forward penalti interpret forward algorithm proce similar viterbi oper node combin incom cumul min function version min fn start set upstream arc node penalti arc xn note numer largest smallest log interest analog drawn graph appli forward algorithm neural network run forward multipl replac addit replac sigmoid submit understand forward algorithm multipl score addit penalti score penalti case viterbi algorithm select path largest cumul score score multipli forward score sum cumul score path start end node forward penalti lower cumul penalti path lower penalti equal forward penalti forward algorithm forward pass wellknown algorithm train hidden markov model section detail relat work hmm advantag forward penalti respect viterbi penalti account wai produc lowest penalti import ambigu combin forward penalti path label sequenc penalti path label penalti forward train slight modif introduc viterbi train suffic turn viterbi transform figur forward interpret graph input produc forward penalti graph output penalti path correct answer forward penalti comput forward backpropag viterbi transform penalti input graph influenc forward penalti belong path stronger influenc comput deriv respect forward penalti fn comput node graph graph fd dn sourc ng set downstream arc node deriv respect arc penalti version viterbi transform arc influenc loss function arc belong low penalti path larger influenc backpropag path selector deriv respect int arc alter ego simpli copi arc deriv respect arc author appli idea backpropag gradient forward train constrain interpret graph recognit transform interpret graph path selector forward forward int desir sequenc fig discrimin forward train architectur charact string recogn base heurist speech recognit includ model model author recommend discrimin train section discrimin forward train inform forward penalti discrimin train criterion call discrimin forward criterion criterion correspond maxim posterior probabl path correct interpret posterior probabl defin exponenti minu constrain forward normal exponenti minu unconstrain forward penalti note forward penalti constrain graph larger equal forward penalti unconstrain interpret graph forward penalti constrain graph equal forward penalti complet interpret graph equal quantiti achiev combin penalti path correct label sequenc neglig small compar penalti posterior probabl path correct interpret train architectur shown figur differ denot call forward penalti constrain forward penalti complet interpret posit constrain graph subset path interpret forward penalti graph larger forward penalti subgraph graph ideal penalti incorrect path infinit penalti coincid reader submit familiar boltzmann machin connectionist model recogn constrain unconstrain graph analog observ valu output phase boltzmann machin algorithm deriv discrimin forward distribut gradient evenli viterbi case deriv left half figur interpret graph deriv negat result arc ad contribut left half arc int deriv arc part correct path posit deriv deriv larg incorrect path lower penalti correct path deriv respect arc part incorrect path larg neg deriv penalti path correct interpret smaller loss function close gradient train concentr exampl imag yield classif concentr piec imag error discrimin forward train eleg effici solv credit assign problem learn machin manipul data structur graph idea situat learn machin discret altern interpret deriv interpret graph penalti charact recogn instanc charact recogn deriv paramet gradient contribut candid segment ad obtain total gradient pair correct label train set step stochast gradient descent appli updat paramet remark discrimin train global train criterion probabilist individu penalti arc graph good reason penalti class sum integr input domain discuss case posterior local normal penalti elimin inform import local reject class piec imag correspond valid charact segment candid wrong explicit introduc probabilist framework address problem remain difficult class probabilist train system requir densiti model unseen unlabel probabilist interpret individu variabl plai import role algorithm combin procedur method appli discrimin train reduc method enforc normal probabilist quantiti perform learn time creat prefer postpon normal final stage quantiti manipul system direct probabilist interpret discuss case gener model gener model build boundari build independ densiti model perform classif basi model discrimin approach focu ultim goal case learn classif surfac theoret argument suggest estim input densiti real goal obtain discrimin function classif suboptim strategi problem estim densiti space find boundari intern variabl system direct probabilist system view produc posterior probabl class assum label sequenc figur exponenti minu interpret estim posterior probabl label sequenc input sum posterior label sequenc approach consist directli minim approxim number misclassif prefer discrimin forward loss function numer problem optim section good obtain score base reject strategi import point made free deem classif model fact intern variabl clear probabilist interpret make model legitim model manipul normal quantiti import advantag global discrimin train learn import system learn integr ambigu segment algorithm ambigu charact recogn section present result handwrit recognit system confirm advantag global train versu separ train experi speech recognit hybrid neural network hmm show mark improv brought global submit recogn fig explicit segment avoid sweep recogn locat input field ing viii multipl object space displac neural network simpl altern explicitli segment imag charact string heurist idea sweep recogn locat normal imag entir word string shown figur segment heurist requir system essenti examin segment input problem approach method gener recogn appli locat larg subset locat charact field view recogn small effect error rate recogn center charact neighbor center charact present field view possibl touch center charact recogn correctli recogn charact center input neighbor charact close touch central charact word charact string perfectli size normal individu charact string wide vari size baselin posit recogn robust shift size variat problem elegantli circumv convolut network replic input field shown section convolut neural network robust shift scale variat input extran mark input properti care problem mention previou paragraph convolut network provid drastic save comput requir replic larg input field replic convolut call space displac neural network shown figur scan recogn prohibit convolut network scan replic effici input field instanc convolut net alter ego nearbi locat fig space displac neural network convolut network replic wide input field convolut natur unit instanc ident locat input ident state comput thin state share network instanc recomput slice put result simpli larger convolut network structur ident origin featur map larger horizont dimens replic convolut network simpli size field convolut replic output layer output layer effect convolut layer output recept field center elementari object produc class output charact output interpret evid presenc object posit input field architectur attract recogn cursiv handwrit reliabl segment heurist exist idea attract gener wide interest recent state put enorm demand recogn speech recogn order magnitud replic convolut network easier instanc model interpret output output sequenc vector encod score find charact class label locat input requir pull label sequenc vector sequenc output shown figur individu charact spot neighbor instanc submit robust recogn horizont translat charact erron detect recogn instanc piec charact recogn instanc output label elimin extran charact output sequenc type graph transform input graph shown figur sequenc vector produc code linear graph multipl arc pair success node arc pair node label penalti produc class label locat graph call output graph input graph transform grammar specif transduc encod relationship input string class label output string recogn charact transduc weight finit state machin arc pair label possibl penalti transduc state arc state observ input symbol match symbol symbol pair attach arc point transduc emit symbol pair penalti combin penalti input symbol penalti arc transduc transform weight symbol sequenc weight symbol sequenc graph transform shown figur perform composit recognit graph grammar transduc oper sequenc path recognit graph match path grammar transduc composit produc interpret path output label sequenc composit oper combinatori turn exist effici algorithm detail section ix experi seri train goal replic recogn multipl charact segment data gener modifi nist set train imag central side charact pick random train set separ bound box charact chosen random pixel central charact case desir output network blank space class train imag degrad salt pixel figur show exampl success recognit multipl charact standard techniqu base heurist fail viterbi transform transform viterbi answer charact model transduc script output interpret graph viterbi graph fig graph transform pull interpret output input output viterbi answer fig multipl charact recognit explicit segment perform ampl network exhibit strike invari resist properti author argu invari requir sophist model neural network exhibit properti larg extent suggest accur recognit multipl overlap object requir explicit mechan solv featur bind problem figur network charact close task imposs achiev classic heurist techniqu correctli group disconnect piec ink form charact good exampl shown upper half figur top left connect connect system correctli identifi separ object top interest reason system correctli identifi individu left half half disconnect correctli geometr inform decid associ left half vertic bar left half submit input output answer fig appli noisi imag digit string digit shown output repres win class lighter grei level answer erron remov charact model transduc prevent charact contigu output import advantag implement parallel hardwar special chip design charact imag preprocess applic rapid progress convent processor technolog vector arithmet instruct intel make success special hardwar hypothet short video clip view global train string imag artifici gener individu charact advantag advanc locat label import charact real train correct sequenc label string gener locat charact input imag unknown experi previou interpret extract output simpl graph transform global train perform gradient graph transform arrang architectur similar section vii model output hidden markov model global hybrid speech recognit handwrit recognit space displac neural network combin hmm elast match method handwritten word recognit figur show graph transform architectur train hybrid discrimin forward criterion top part compar top part figur side composit recognit graph grammar interpret graph legal interpret left side composit perform grammar path desir sequenc label similar function path selector previou section section loss function differ forward score submit constrain interpret graph interpret graph path selector forward forward int desir sequenc transform charact model transduc script output fig global trainabl hybrid system express obtain left half forward score obtain half composit track arc recognit graph origin arc interpret graph deriv respect arc recognit graph equal sum deriv respect arc interpret graph origin deriv comput penalti grammar learn previou discrimin criterion criterion result effect network output rbf adapt train procedur formul term hmm earli experi zip code recognit recent experi handwrit recognit demonstr idea hybrid extrem attract techniqu yield result heurist hope result improv experi gain model object detect spot interest applic object detect spot invari properti convolut combin effici replic larg field suggest object spot detect larg imag main idea train singl convolut network distinguish imag object interest imag present background util network replic cover entir imag form space displac neural network output plane activ unit presenc object interest recept field size object detect imag imag present network multipl result multipl resolut combin idea appli face address block locat envelop hand track video illustr case face detect imag imag face scale collect imag filter laplacian filter remov variat global illumin low spatial frequenc illumin gradient train sampl face manual extract imag face size normal height entir face approxim pixel fairli larg variat factor scale background pick random singl convolut network train sampl classifi face scene imag filter laplacian resolut network replic multipl resolut imag simpl vote techniqu combin result multipl resolut version global train method previou section allevi manual locat face build train sampl locat altern parallel arc simpl graph start node end node author neural classifi support vector machin face detect great success system similar includ idea present imag network multipl scale system convolut advantag speedup reli comput requir reason limit classifi invari scale variat convolut multipli number scale imag present classifi ix graph transform network transduc section graph transform network introduc gener network state inform repres graph vector section framework gener power graph composit algorithm submit previou work numer author speech recognit learn method integr statist model acoust recognit gaussian mixtur neural network similar idea appli handwrit recognit systemat approach trainabl system idea transform graph graph receiv interest comput concept weight transduc transduc appli speech recognit languag translat made handwrit recognit line work effici search algorithm algebra aspect combin transduc graph acceptor effort devot build global trainabl system transduc section systemat approach automat train system approach trainabl call standard transduct establish framework transduc discret symbol attach arc graph acceptor graph singl symbol attach arc transduc graph symbol input symbol output special null symbol absorb symbol concaten symbol build symbol weight transduc acceptor scalar quantiti attach arc composit oper input acceptor graph transduc graph build output acceptor graph path output graph symbol sequenc correspond path symbol sequenc input acceptor graph path pair sequenc transduc graph weight arc output graph obtain ad weight match arc input acceptor transduc graph rest call graph composit oper transduc transduct oper simpl transduct shown figur simpl input output symbol transduc arc ident type transduc graph call grammar graph understand transduct imagin token sit start node input acceptor graph transduc graph token freeli follow arc label null input symbol token follow arc label input symbol token arc label input symbol accept trajectori token reach end node graph token reach termin trajectori repres sequenc input symbol compli acceptor transduc collect sequenc output symbol trajectori transduc token procedur produc simpl techniqu section avoid gener multipl copi subgraph detect output state transduct oper perform effici present complex problem handl combin null null symbol weight interpret probabl acceptor graph repres probabl distribut languag defin set label sequenc path start end graph applic transduct oper incorpor linguist constraint lexicon recogn word charact string recognit transform produc recognit graph acceptor appli neural network recogn candid segment acceptor graph transduc graph grammar grammar transduc path legal sequenc possibl augment penalti rel likelihood sequenc arc ident input output symbol transduct mention section path selector heurist train implement composit transduc graph linear graph correct label sequenc composit interpret graph linear graph yield constrain graph gener transduct data structur arc finit number input graph transduc sound solut applic data structur attach arc graph imag object readili present composit oper solv problem handl graph discret symbol penalti interest graph arc carri complex data includ data structur vector imag graph requir addit ffl examin pair arc input criterion decid creat output base inform attach input arc decid build entir node arc ffl criterion build submit recognit graph graph composit interpret graph match add match add match add cut cap cat grammar graph fig composit recognit graph grammar graph order build interpret consist forward propag method check gradient applic method output graph comput inform attach newli creat function inform attach input arc function encapsul object call composit transform instanc composit transform implement ffl compar data structur point arc return boolean indic creat output graph ffl call return true method creat arc node node output graph comput inform attach newli creat arc function attach inform input arc ffl call train order propag gradient inform output data structur respect paramet call argument assum function comput valu attach output arc differenti check method construct dynam architectur function method perform forward propag architectur comput numer inform attach arc method perform backward propag architectur comput partial deriv loss function respect inform attach arc illustr figur figur show simplifi gener graph composit algorithm simplifi algorithm handl null check token trajectori accept token simultan reach end node manag null transit straightforward modif token simul function null joint token loop null transit call token simul final call method identifi accept trajectori consist run preliminari pass identifi token configur reach termin configur token end easili achiev trajectori opposit direct start end node follow arc upstream main build node token reach termin configur graph composit transduc standard easili effici implement gener transduct method check simpli test equal input symbol method creat singl arc symbol output symbol transduc arc composit pair graph incorpor linguist constraint handwrit recogn exampl handwrit recognit system section check read system section rest term composit transform denot graph transform base gener transduct multipl graph concept gener transduct gener graph transform earlier segment formul term gener transduct case gener transduct input graph singl input graph method transform creat arc complet subgraph arc initi graph fact pair procedur defin transduc shown gener transduct singl graph theoret standard composit graph transduc graph implement oper ineffici transduc complic graph produc gener transduct repres order avoid build output graph huge interpret graph grammar instanti node visit search algorithm recognit strategi propag benefit prune submit function return creat graph creat map token posit node graph subroutin simul token function return check visit record configur joint token transit arc arc return node graph return perform token simul delet map return fig simplifi gener composit algorithm simplifi handl null transit implement dead end avoid main compon composit function token associ arrai map rememb node graph visit algorithm beam graph transform network note graph structur section vii discuss idea global train gradient simpl graph transform method basi backpropag algorithm gener graph transform gener composit transform dynam establish function relationship numer quantiti input output arc check function decid relationship function implement numer relationship check function establish structur network insid composit transform assum gradient structur paramet affect score store arc success graph system threshold paramet determin arc graph exist arc arc larg case paramet affect penalti kind system discuss applic section knowledg structur graph produc graph transform determin natur graph depend paramet input interest graph transform modul attempt learn structur output graph consid combinatori problem amen solut problem gener larg graph graph candid select hidden markov model gener extens hmm probabilist interpret penalti push final stage differ constrain forward penalti unconstrain forward penalti interpret neg label drop altogeth network repres surfac label sequenc input graph transform network extend hmm combin framework multipl level multipl model pereira al transduc framework stack hmm repres level process automat speech recognit unfold hmm time yield graph similar interpret graph final stage process graph transform viterbi node time step state model penalti arc correspond submit tive emit observ data posit state state time interv probabilist forward penalti neg logarithm likelihood observ data sequenc section vii mention phenomenon occur loss function train neural hybrid system classic hmm fix problem occur paramet emiss transit probabl model forc satisfi probabilist sum integr probabl random variabl valu probabl event probabl event automat probabilist assumpt hmm probabilist discrimin discuss section improv perform shown speech recognit system hmm model strongli relat graph transform view probabilist repres condit distribut output sequenc input sequenc emiss probabl modul transit probabl modul emiss probabl modul comput condit emiss probabl output variabl input discret transit probabl modul comput condit transit probabl chang input view graph assign output graph probabl distribut sequenc output path input graph output graph penalti arc simpli ad order obtain complet output graph input valu emiss transit modul read data structur input arc graph transform output graph complet instanti low penalti path handwrit recognit system natur handwrit mixtur lower case upper cursiv reliabl recogn handwrit greatli improv interact implement present technic challeng charact isol inform context word built word recognit system devic base main preprocessor normal word fit geometr model word modul produc normal pen viterbi graph segment graph recognit graph recognit transform segment transform word normal normal word interpret graph languag model comput graph beam search transform fig handwrit recognit base heurist replic convolut neural network spot recogn interpret network output constraint account network jointli train minim error measur defin word level compar system base section system base heurist section sequenti natur inform pen trajectori reveal inform pure optic input heurist effici candid charact script preprocess input normal reduc simplifi charact recognit word normal scheme base fit geometr model word structur model line repres ascend core base line descend line line fit local minima maxima pen trajectori paramet line estim modifi version em algorithm maxim joint probabl observ point paramet prior paramet prevent line submit recognit graph word normal normal word interpret graph comput transform charact model languag model viterbi graph output beam search transform fig handwrit recognit base neural network recognit handwritten charact pen trajectori digit surfac time domain trajectori local geometr dynam featur extract recognit perform curv match classif techniqu depend stroke order individu write style make difficult high writer independ system integr segment recognit intent writer produc legibl natur preserv pictori natur signal time exploit sequenti inform trajectori design call pen trajectori repres imag pictur element inform local properti trajectori view pixel featur featur orient pen trajectori area local curvatur area pixel featur make assumpt natur input trajectori depend stroke order write type handwrit lower unlik global comput complet word requir segment network architectur network found onlin offlin charact recognit convolut network similar multipl input plane number unit layer convolut kernel size layer layer convolut kernel size layer convolut kernel size layer classif rbf unit class full printabl ascii distribut code output adapt unlik heurist input network consist row column determin resolut suffici repres handwritten charact number column vari width input word number layer size kernel size includ determin unambigu architectur paramet remain select number featur map inform featur map connect featur map rate chosen small kernel small layer limit total number connect kernel size upper layer chosen small satisfi size constraint mention larger architectur necessarili perform requir time train small architectur half input field perform insuffici input resolut note input resolut nonetheless optic charact angl curvatur provid inform singl grei level pixel network train train phase center rbf train network weight minim output distanc rbf unit correct class minim error previou layer center rbf bootstrap phase perform isol charact network weight rbf center train global minim discrimin criterion word level submit heurist main graph segment transform perform heurist output segment graph comput imag attach arc graph charact recognit transform appli convolut network charact recogn candid output recognit penalti class arc composit transform recognit graph grammar graph repres languag model incorpor lexic constraint beam search transform extract good interpret interpret graph task achiev usual viterbi transform beam search algorithm implement prune strategi larg interpret graph main graph transform transform replic convolut network word output recognit graph linear graph class penalti window center regular interv input imag composit transform recognit graph hmm charact class figur composit transform output previou transform languag model incorpor lexic output interpret graph beam search transform extract good interpret interpret graph languag model simpli constrain final output graph repres sequenc charact label dictionari interpret graph complet node creat beam search modul interpret graph repres procedur explicitli crucial contribut research joint train graph transform modul network respect singl explain section vii ix discrimin forward loss function final output minim forward penalti constrain interpret maxim forward penalti interpret graph global loss function optim stochast diagon procedur appendix deriv comput optim learn rate optim oper paramet notabl network weight rbf center result set evalu gener abil neural network classifi coupl word normal preprocess input result writer independ mode writer train initi train isol charact perform approxim hand print charact class upper lower test isol charact perform separ type upper case error lower case error digit error punctuat error experi perform network architectur enhanc robust recogn variat addit train data gener appli local affin transform origin charact set experi concern recognit lower case word test perform word evalu improv brought word normal system system normal network word time heurist obtain normal word charact error delet search constrain dictionari word normal preprocess charact level error rate drop word charact error rel drop word charact error suggest normal word entireti segment normal process segment languag model languag model word lexicon global train global train global train global train global train global train ho ho fig compar result error show improv brought global train heurist system word dictionari set measur improv obtain joint train neural network comparison train base error perform charact level initi train individu charact global submit train perform lower case word dictionari error rate drop word charact error rel drop heurist system slightli improv dictionari error rate drop word charact error rel drop error drop word charact error rel drop lower error rate obtain drastic reduc size dictionari yield word charact error result demonstr global train hybrid handwrit recognit confirm similar result obtain earlier speech recognit xi check read system section describ base check read intend industri show gradient make fast yield accur reliabl solut verif amount check task extrem time monei consum bank high interest autom process partial autom result cost reduct threshold econom viabil automat check set check read error check reject human oper describ perform system correct reject error system present cross threshold repres mixtur busi person check check version amount courtesi amount written legal amount written letter busi gener amount easi difficult find due lack standard busi check layout amount person check easi find harder read simplic speed initi task read courtesi amount task consist main ffl system field candid courtesi amount obviou person posit amount standard find amount difficult busi human ey segment graph interpret graph grammar recognit graph field graph check graph amount graph nat bank dollar exce recognit transform segment field locat viterbi answer viterbi transform fig complet check amount reader implement singl cascad graph transform modul success graph transform progress extract higher level inform string check actual amount difficult decid candid courtesi amount perform full recognit ffl order read courtesi amount system segment field read score candid final find interpret amount contextu knowledg repres stochast grammar check amount methodolog build check amount read system handl person check busi check check amount recognit describ success graph transform network read check amount figur graph transform produc graph path encod score current consid stage system input system trivial graph singl arc carri imag check figur field locat transform field perform classic imag analysi connect compon ink densiti layout heurist extract rectangular zone check amount field produc output call field graph figur candid zone arc link start submit node end node arc imag penalti term comput simpl featur extract zone aspect penalti term close featur suggest field larg field deem amount penalti function paramet global tunabl arc repres separ dollar cent amount sequenc field handwritten cent amount written fraction align dollar amount worst find cent amount candid fraction dollar amount segment transform seg similar section ix examin zone field cut imag piec ink heurist imag process techniqu piec ink charact piec charact arc field graph replac segment graph repres group piec ink field segment graph append arc penalti field field graph arc carri segment penalti evalu likelihood segment charact penalti obtain differenti function combin simpl featur space piec ink complianc segment imag global tunabl paramet segment graph repres segment field imag comput penalti segment field ad arc penalti path differenti function comput penalti ensur paramet optim global segment varieti heurist find candid cut import call idea cast line downward top field imag line hit black deflect follow contour object line hit local minimum upper continu downward cross black propag vertic downward ink line meet merg singl cut procedur repeat bottom strategi separ touch charact doubl recognit transform rec iter segment arc segment graph run charact recogn segment imag recogn convolut neural network section weight constitut largest import subset tunabl paramet recogn classifi segment imag class printabl ascii class unknown symbol charact arc input graph rec replac arc output graph arc label penalti sum penalti arc input graph penalti classifi imag comput recogn recognit graph repres weight score charact class path graph repres charact string field comput penalti interpret ad penalti path sequenc charact valid check amount composit transform gram select path recognit graph repres valid charact sequenc check amount transform graph recognit grammar graph grammar graph sequenc symbol constitut amount output composit call interpret path recognit graph compat grammar oper combin input graph produc output gener transduct section differenti function comput data attach output arc data attach input arc output arc receiv class label penalti comput simpli sum penalti input arc recogn arc penalti grammar path interpret graph repres interpret segment field check sum penalti path repres interpret combin evid modul grammar viterbi transform final select path lowest accumul grammat correct interpret learn stage check read system tunabl paramet paramet manual paramet field locat vast major weight neural net recogn prior global optim modul paramet initi reason valu paramet field locat segment initi paramet neural net charact recogn initi train label charact entir system train global check imag label correct amount explicit segment amount train train check level loss function minim global train procedur discrimin forward criterion section differ submit interpret graph path selector forward forward viterbi answer fig addit process requir comput confid ward penalti constrain interpret graph correct label forward penalti unconstrain interpret graph deriv entir practic segment reject low confid check order reject check carri erron viterbi rate reject check confid threshold compar unnorm viterbi penalti check meaningless decid answer trust optim measur confid probabl viterbi answer input imag section target sequenc viterbi discrimin forward loss function estim logarithm probabl simpl solut obtain good estim confid interpret graph figur comput discrimin forward loss figur desir sequenc viterbi answer summar figur confid result version system fulli implement test busi check system basic gener engin task specif heurist encapsul check method amount code write adapt earlier segment segment transform system deal person check base earlier implement concept restrict neural network classifi initi train imag charact imag origin span entir printabl ascii set handwritten charact size normal string level addit imag gener randomli distort origin imag simpl affin transform imag network train charact imag automat segment check imag manual truth network initi train reject result segment error recogn insert check read system small subset paramet train global field check imag busi check automat categor machin print perform correctli recogn reject compar perform previou system test reject check categor charact standard posit dollar sign detect machin found standard courtesi amount candid found improv attribut main neural network recogn train data system advantag grammat constraint effici previou system architectur provid extrem flexibl test adjust tune system point import framework separ part system part easi adjust import global train minor task global train concern small subset paramet independ test perform system integr show superior system commerci courtesi amount read system system integr ncr line check read system field bank june read million check month xii short histori automat pattern role learn invari improv perform recognit system system paper evid fact convolut neural network shown elimin featur extractor graph transform network shown reduc manual manual paramet tune document recognit system train data comput understand learn algorithm recognit system reli perform improv algorithm elegantli solv credit assign problem neural learn procedur graph transform network introduc paper solv submit credit assign problem system function architectur dynam input learn algorithm present unusu form gradient descent dynam effici algorithm comput gradient result paper establish relev minim method gener organ principl learn larg system shown step document analysi system formul graph transform gradient part design philosophi term graph transform clear separ heurist segment procedur knowledg gener transduct worth point data gener model maximum likelihood principl call justifi architectur train criteria paper gradient base learn appli global discrimin loss function optim classif reject principl put strong constraint system perform method architectur present paper offer gener solut larg number problem encount pattern recognit featur extract fix gener deriv expert prior knowledg task reli incorrect assumpt human design captur relev inform input shown applic learn convolut neural network learn featur exampl success approach demonstr extens compar digit recognit experi nist segment recognit object imag complet decoupl hard segment heurist gener evalu larg number postpon criterion minim hand truth imag obtain segment charact train charact recogn account document sequenc charact recogn fact segment candid true train system optim global measur requir time consum detail yield significantli recognit train modul cooper common goal ambigu inher charact linguist model integr optim sequenc heurist combin sourc unifi framework gener transduct method appli graph repres weight set input success approach demonstr commerci deploi check read system read million busi person check gener transduct engin resid hundr line code tradit recognit system reli handcraft heurist isol individu recogniz object space displac neural network approach draw robust effici convolut neural network avoid explicit segment altogeth simultan automat learn segment recognit achiev learn method paper present small number exampl graph transform clear concept appli situat domain knowledg state inform repres graph case audio signal recognit visual scene analysi applic futur work attempt appli graph transform network hope relianc automat detail engin faster converg squash function convolut network symmetr function believ yield faster learn extrem slow weight small problem weight space origin fix point learn saddl attract direct choic equal satisfi gain squash transform normal oper interpret state network simplifi absolut deriv maximum improv converg end learn session choic paramet affect result weight initi random valu uniform distribut number input unit connect belong connect share weight rule difficult connect share weight belong unit ident reason divid initi standard deviat weight sum rang fall normal oper region submit sigmoid initi weight gradient small learn slow sigmoid satur gradient small standard deviat weight sum scale squar root number input input scale linearli number input input highli correl chose assum hypothesi unit receiv highli correl signal stochast gradient batch gradient learn algorithm class method updat paramet dub classic gradient accumul entir train paramet updat exact gradient comput call gradient evalu basi singl train sampl small number paramet updat approxim gradient train sampl select randomli properli random sequenc stochast gradient estim paramet updat batch version empir result practic import task redund data stochast version faster batch order magnitud reason total understood intuit explan found extrem train copi subset accumul gradient set redund comput perform run stochast gradient train set amount perform complet learn iter small subset idea gener train set exist repetit pattern redund present fact stochast updat level gener expect author claim method lieu gradient descent neural net train literatur abound recommend classic method method version conjug gradient method method unsuit train larg neural network larg data set method requir oper number make impract moder size network method requir oper make impract larg network conjug gradient requir oper updat converg speed reli accur evalu success descent make mode larg data brought method regular batch gradient descent match enorm speed brought stochast gradient author attempt conjug gradient small batch size attempt demonstr surpass carefulli tune stochast gradient experi perform stochast method scale paramet ax minim eccentr error surfac stochast diagon ow reason appendix prefer updat weight present singl pattern accord stochast updat method pattern present constant random train set typic repeat time updat algorithm dub stochast diagon method individu learn rate comput paramet pass train set learn rate comput diagon term estim approxim hessian matrix algorithm believ bring tremend learn speed converg reliabl requir extens adjust learn paramet correct major loss function due peculiar network architectur train data addit cost procedur standard stochast gradient descent neglig learn iter paramet updat stochast updat rule ffl instantan loss function pattern convolut neural weight partial deriv sum partial deriv respect connect share paramet ij ij connect weight unit unit set unit index pair connect share paramet ij state step size ffl constant function deriv loss function axi ffl kk submit constant kk estim deriv loss function respect larger kk smaller weight updat paramet prevent step size larg deriv method optim exact formula comput kk deriv respect connect weight kk ij kl make approxim approxim drop term hessian respect connect weight kk ij term ij averag train set local ij ij local deriv respect connect weight comput local deriv respect total input downstream ij state unit deriv instantan loss function respect total input unit effici algorithm comput deriv similar procedur comput deriv ki deriv lead problem term gradient algorithm move downhil approxim call deriv estim approxim essenti ignor estim function neural network loss function equat approxim deriv ki similar formula sigmoid deriv weight valu squar side sum product side term approxim make run averag equat entir train run small subset train set addit order properti error surfac chang slowli experi kk pattern train pass train set size train set addit cost kk neglig estim sensit subset train set averag suggest properti error surfac determin structur detail statist sampl algorithm network weight share creat error surfac singl paramet layer enorm influenc output deriv error respect paramet small paramet network algorithm phenomenon unlik method method work stochast mode diagon approxim hessian classic factor prevent step size larg deriv estim small method call stochast diagon method acknowledg system paper work research lucent technolog christoph craig troi jane contribut check read system result section iii includ contribut chri harri larri ur bernhard author fernando vladimir john isabel guyon charl rai provid applic motiv lawrenc rabin lawrenc jackel support encourag refer duda pattern classif scene wilei appli submit handwritten zip code neural vol pp winter mechan learn physic review vol pp learn neural vol pp asymptot valu rate advanc neural inform process system san pp morgan kaufmann natur statist learn statist learn john wilei numer art scientif cambridg theori adapt pattern ieee transact electron vol pp ya adapt learn automat academ ya foundat theori learn academ minski random london symposium inform learn algorithm boltzmann cognit vol pp hinton boltzmann parallel distribut explor microstructur cognit volum rumelhart ed mit intern error parallel distribut explor microstructur vol pp bradford jr bryson appli optim publish learn scheme asymmetr threshold pp process asymmetr threshold disord system biolog le pp tech sloan school april de learn phd universit june theoret framework connectionist model summer pp morgan kaufmann bottou framework cooper learn advanc neural inform process touretzki vol morgan kaufmann recognit unconstrain handwritten special issu optic charact vol pp juli read special issu optic charact vol pp juli digit applic neural net chip automat ieee pp novemb invit paper segment recognit neural inform process vol pp morgan kaufmann san christoph john recognit space displac neural neural inform process ed vol morgan kaufmann san ca tutori hidden markov model select applic speech vol pp februari connectionist speech hybrid kluwer academ binocular function architectur cat visual journal physiolog vol pp neural biolog vol pp algorithm pattern recognit toler deform shift pattern vol pp percept multipl connectionist mit network design extend version publish technic report toronto digit recognit advanc neural inform process system david morgan kaufmann integr segment recognit overlap neural vol pp wang neural network charact intern confer neural vol pp hybrid handwrit neural vol lee convolut neural network ieee transact neural vol pp lang time delai neural network architectur speech tech rep pittsburgh recognit neural ieee transact speech signal vol pp march independ isol digit perceptron dynam time neural vol pp neural network time perform eurospeech european confer speech commun sept neural network charact recogn touch pattern vol pp verif time delai neural intern journal pattern recognit artifici vol august covari applic physic review vol pp submit dietterich multiclass learn problem output journal artifici intellig vol pp de mutual inform hidden markov model paramet speech proc int conf signal pp de recognit hidden markov speech vol pp juang learn minimum error ieee tran signal vol pp learn algorithm handwritten digit intern confer artifici neural fogelman pp neural net architectur classifi handwritten proc washington dc vol pp ieee quadrat polynomi proc intern confer pattern recognit pp ieee word recognit system postal address ieee vol digit recognit backpropag neural neural vol saad gradient descent learn neural advanc neural inform process david michael michael ed vol pp mit cambridg superposit sigmoid mathemat vol pp bottou learn neural vol pp strength weak machin vol pp perform neural network boost advanc neural inform process system san pp morgan kaufmann denker pattern recognit transform advanc neural inform process vol morgan train algorithm optim margin annual workshop comput learn vol pp burg accuraci speed support vector advanc neural inform process system jordan mozer ed mit cambridg bernhard jane lawrenc anna neural network chip charact ieee transact neural vol march interpret feedforward classif network relationship statist pattern architectur le springer check graph transform intern confer signal vol pp ieee neural network speech sequenc intern thompson comput path method train neural network recogn charact intern joint confer neural vol pp system recognit handwritten jerusalem pp bound convolut code asymptot optimum decod ieee transact inform pp lippmann gold classifi speech ieee intern confer neural san june word recognit dynam program neural intern confer signal recurr network architectur hidden markov model speech viterbi hybrid method continu speech intern confer signal pp hidden markov model neural network intern confer signal pp lvq comparison intern joint confer neural de optim neural markov model ieee transact neural vol pp neural network continu speech advanc neural inform process system vol pp morgan san mateo depend gradient descent ieee transact neural special issu recurr neural network pattern recognit neural benchmark ieee intern confer neural san vol pp speech recognit global european confer speech commun sept denker segment mathemat induct addison weslei de applic la reconnaiss de la phd universit de pari orsai featur model design automat speech proc architectur learn high perform charact speech intern confer signal vol ration transduct applic human languag arpa natur languag process von der invari object recognit dynam link ieee tran vol pp analog neural network processor programm ieee journal vol pp decemb submit segment advanc neural inform process system pp hmm hybrid system improv ieee transact speech audio vol pp handwritten zip code recognit ieee juli bengio le normal handwritten word proc intern confer pattern ieee approach local object iee proc signal vol august wolf address block locat convolut locat advanc neural inform process system pp nowlan convolut neural network hand advanc neural inform process system san pp morgan kaufmann face pp ieee comput societi press support vector applic face pp ieee comput societi press markov model advanc neural inform process vol pp de network gaussian mixtur hybrid speech recognit densiti advanc neural inform process system pp morgan kaufmann pereira recognit composit weight finit devic natur mit press transduc languag speech comput vol synthesi cursiv handwrit recognit handbook optic charact recognit document imag wang bunk ed world scientif mohri determin minim larg vocabulari eurospeech septemb bengio hmm advanc neural inform process ed vol pp mit ma bengio hmm sequenc ieee transact neural vol pp ration design weight transduc lectur note comput scienc springer utter verif connect digit ieee tran speech audio vol pp featur model design automat speech eurospeech bengio em algorithm asynchron hidden markov intern confer neural inform pp state art handwrit ieee transact pattern analysi machin vol pp connectionist recogn cursiv handwrit intern confer signal cursiv script amount postal european confer dedic postal june pp script recognit appli process bank int conf document analysi august pp process inform int conf man octob pp line recognit handwritten postal word neural int journal pattern recognit artifici vol pp special issu applic neural network pattern recognit guyon jackel handwrit recognit neural spatial versu tempor proc intern confer handwrit draw ecol de telecommun neural net simul dsp processor ieee tran neural vol pp method steepest descent newton neural vol pp kramer parallel learn algorithm neural advanc neural inform process ds denver vol pp morgan san mateo effici train neural phd aarhu becker converg backpropag learn tech rep toronto connectionist research septemb lecun lecun receiv ecol en pari phd comput scienc universit pierr mari earli version learn algorithm neural network join depart comput scienc toronto research associ join adapt system research depart bell laboratori work thing neural machin handwrit recognit head imag process servic research depart serv board machin learn serv associ editor ieee tran neural network gener chair workshop held year utah serv program ijcnn nip member ieee neural network signal process technic publish technic paper book chapter neural machin pattern handwrit submit document imag vlsi inform theori addit current interest includ user imag index multimedia materi leon bottou leon bottou receiv ecol pari en informatiqu ecol normal pari phd comput scienc universit de work speech recognit framework stochast gradient learn global train join adapt system research depart bell laboratori work neural statist learn theori local learn algorithm return franc research engin chairman compani make neural network simul traffic forecast softwar eventu back bell laboratori work graph transform network optic charact recognit member imag process servic research depart learn current interest includ arithmet imag compress index bengio bengio receiv electr engin mcgill receiv msc phd comput scienc mcgill fellow massachusett institut technolog join bell join faculti comput scienc depart universit de montreal associ professor work neural network research interest center learn algorithm data sequenti spatial patrick patrick graduat ecol franc ecol de telecommun franc receiv phd speech signal process work alex waibel design architectur atr carnegi mellon research scientist develop connectionist learn algorithm telephon speech recognit join bell laboratori work applic optic charact recognit transduc process document join imag process servic research depart research interest includ statist connectionist model sequenc machin speech imag inform theori
Agents/934 1 emerg macro spatial structur dissip cellular implic distribut comput franco zambonelli dipartimento di scienz università di modena reggio emilia reggio itali abstract paper describ peculiar behavior observ class cellular automata defin cellular automata make environ influenc evolut automata peculiar dynam evolut class cellular automata stabl spatial structur emerg local interact behavior emerg cellular automaton state cell influenc extern world paper discuss relat perform experi area open distribut distribut comput basic intuit dissip cellular automata express characterist strongli resembl open distribut system base autonom situat activ compon agent similar sort behavior emerg possibl fruitfulli exploit cellular open agent softwar engin introduct autonomi characterist agent modern softwar system softwar system includ proactiv compon capabl autonom mobil assimil softwar engin perspect autonom proactiv model compon system situat comput web physic manufactur execut local interact environ agent research softwar engin recogn autonomi effect abstract design develop complex softwar design applic autonom applic simplifi applic design develop approach enforc local interact explicitli introduc abstract natur match characterist open multiag system andrea dipartimento di informatica sistemistica università di bologna vial bologna itali autonomi sourc complex engin problem experi focu paper presenc autonom situat softwar dynam environ dramat affect global behavior softwar system present discuss set experi perform class cellular automata defin dissip cellular automata dca differ cellular automata cellular automata cell interact synchron influenc evolut intern state automata dissip asynchron open cell updat statu independ automata live dip environ directli influenc intern behavior open system dca consid minimalist open agent system dynam behavior provid insight behavior open agent system open distribut softwar system report experi show dca exhibit peculiar interest behavior evolut situat induc extern stabl spatial structur emerg local interact behavior emerg cellular automaton synchron close state cell influenc paper argu similar sort behavior emerg multiag system start popul internet physic process unpredict dynam behavior dramat influenc behavior network larg scale requir explicitli account exploit softwar design develop control effect addit design dimens paper organ section sketch main characterist cellular automata section introduc class dissip cellular present spatial structur emerg attempt explain behavior section discuss relat dissip cellular automata distribut analyz impact perform experi section discuss relat work section conclud discuss work progress cellular automata gener cellular automata regular lattic automaton cell updat state depend state transit function state state neighbor cell scientif interest ca primarili fact simplic local show complex global behavior evolut time system exhibit varieti dynam pattern relat state cell fix configur cell period complex structur evolv time global behavior ca determin local function neighborhood structur chosen ca static defin quadrupl finit set state cell dimens neighborhood local transit rule automaton structur discret grid set integ cell identifi arrai compon repres coordin cell grid gener assum grid limit close toru state cell express variabl domain defin order list cell state defin ca global state neighborhood structur defin cell cell defin function map cell set cell neighborhood structur regular definit cell subset group translat local transit rule function map configur state neighborhood state transit rule defin futur state cell depend state neighbor cell state cell typic cell quadrupl specifi characterist automaton complet descript ca requir definit dynam rule updat state ca cell dynam ca assum discret cell updat state discret time step equat set state neighbor cell cell time usual definit ca synchron cell updat state parallel time step assum finit number cell case identifi cell variabl xi global state evolv xn yn xn system evolut evolut transit rule determinist state cell system eventu reach stabl reach fix point period pass sequenc reach cyclic attractor ca squar grid state kind ca deepli studi biolog cell interpret depend state figur show initi random situat ca cell dead aliv moor neighborhood structur neighbor cell defin squar cell transit di cell aliv iff neighbor live cell live iff neighbor ca start evolv initi random state cell synchron chang transient eventu reach final cyclic attractor global state shown figur assum transit ca show behavior reach basin attract forward interest reader systemat analysi classif synchron ca dissip cellular automata introduc class ca defin cellular asynchroni discuss peculiar behavior observ asynchron dynam section concentr ca synchron larg part literatur dedic analysi behavior synchron ca synchron dynam repres make suit model simul phenomena involv popul interact asynchron dynam introduc accept ca asynchron cell updat state independ dynam kind global daemon job time step cell updat wai determin cell updat cell order fix random cell randomli select time step asynchron dynam global transit xn yk xn xk xn cell select transit determin specif kind select polici figur initi random situat ca figur synchron ca reach global state cyclic attractor figur fix point reach asynchron ca cell assum wake cell make updat case interest open distribut comput agent process execut interact asynchron local intern clock dynam continu notion time updat signal cell determinist τ time probabilist probabl cell updat state uniform state cell select basi current state neighbor cell experi present ca asynchron cell uniform probabl rate wake updat state updat cell implement atom mutual prevent cell updat state concurr observ asynchron ca exhibit behavior synchron term transient final attractor dynam fix point attractor fix point synchron dynam fix point asynchron dynam vice basin attract final attractor reach asynchron dynam reach synchron figur show fix point reach asynchron counterpart ca section asynchron ca reach attractor synchron counterpart observ reach open ca studi close account interact ca environ class ca studi addit dynam behavior ca influenc extern environ oper point open ca impli cell forc extern chang independ cell evalu state independ transit function figur thermodynam manifest extern environ term energi forc cell chang state consid manifest energi flow system influenc fact activ cell asynchron extern forc state cell perturb ca made call kind ca dissip cellular automata formal point dca consid asynchron dynam uniform distribut rate perturb action quadrupl defin dynam discuss subsect perturb action ϕ transit function act concurr chang state ca cell state α probabilist distribut independ current state cell neighbor experi uniform distribut rate λ ca grid extern forc state cell figur basic structur dissip cellular automaton emerg behavior behavior exhibit dca dramat synchron close asynchron counterpart perturb high effect perturb intern dynam dca rate cell updat prevail make behavior dca random compar peculiar pattern emerg interest reader refer page repeat experi observ perturb cell induc extern system equilibrium make imposs reach equilibrium situat make dca develop larg scale regular spatial structur structur exhibit correl state emerg strictli local asynchron transit break spatial symmetri final state structur continu perturb effect extern environ figur show pattern emerg exhibit stabl spatial structur transit rule neighborhood structur synchron ca section asynchron ca subsect presenc pattern break rotat symmetri automata evid compar pattern observ ca asynchron close open provid make emerg local transit enlarg ca size global state fact perturb effect modifi figur show typic pattern emerg dca neighborhood structur made neighbor neighbor cell cell maximum distanc cell transit di cell aliv iff neighbor live cell live iff neighbor break pattern extend global scale local pattern emerg asynchron close regim pattern stabl continu perturb effect environ pattern stabl robust dynam long diagon stripe figur chang continu maintain global structur stripe translat horizont constant speed dca lattic make pattern fix point simpl cyclic explain dca dynam phenomenon underli behavior dca similar determin emerg structur dissip system cell figur figur behavior evolv dca situat forc extern stabl pattern emerg figur behavior evolv dca dynam pattern emerg figur stabil situat asynchron close ca rule dca figur pattern emerg fluid plate thermodynam equilibrium thermal energi flow extern perturb equilibrium presenc small differ temperatur thermal energi perturb energi flow plate form thermal temperatur gradient reach critic thermal flow fluid start occur motion occur disord regular spatial pattern movement symmetri break correl cell movement behavior maintain temperatur gradient plate case regular pattern disappear fluid motion behavior dca subject temperatur gradient plate substitut ratio ratio system perturb extern occur small dynam behavior dca substanti chang ratio high dca dynam chang regular spatial pattern high spatial pattern disappear dca dynam highli disord detail measur complet quantit analysi dca dynam work progress similar suggest determin behavior cell determin behavior dca presenc small autonom compon molecul dca act asynchron strictli local tend reach local equilibrium strictli local reflect global uniform equilibrium system system substanti local reach equilibrium situat continu result continu attempt local equilibrium typic end cell group found equilibrium state robust regard perturb compat stabl local pattern start domin influenc sort enforc global coordin larg scale spatial stabl situat emerg perturb high avoid local stabl situat persist longer influenc situat temp fluid materi temp inject energi rotat cell figur pattern cell implic distribut comput multiag system dca characterist typic distribut system type softwar reflect autonomi local open dynam environ agent autonom entiti execut subject global flow control execut agent multiag system proce state transit occur local intern time adopt state transit dca cell driven intern independ clock state transit dca cell agent typic execut context interact agent intern state occur context organ abstract concept local reflect actual physic local sake scalabl organ typic execut spatial bound distribut interact limit enabl make agent move site site cell interact check state limit number cell neighborhood agent situat entiti live dip comput web physic room manufactur unit control agent typic influenc execut state environ agent multiag system global evolut multiag system influenc environ live environ possess dynam control comput agent found web site predict chang time temperatur condit room agent devot control vari dynam number reason predict sort open find perturb chang intern state make cell situat environ characterist dynam chang unpredict characterist lead observ behavior dca present system modern distribut softwar good reason presum similar strang behavior observ agent start popul internet physic environ discuss possibl emerg complex behavior system studi except agent intern dynam system total drive behavior simpl dca complex behavior emerg due influenc dynam impact observ maintain distribut agent system delin revolutionari chang paradigm comput scienc softwar engin defend dynam report experi open possibl softwar system dynam environ exhibit behavior program desir highli damag effect case comput internet price emerg spatial pattern produc great price differ site planet case inform retriev larg amount inform left make remain part deep methodolog adopt softwar mainten requir avoid situat predict control solut direct softwar system design mechan compon exhibit determinist behavior approach immedi fail nondetermin dynam except handl avoid damag make system work effect challeng approach design design system make wide rang desir global disregard full understand behavior understand behavior system behavior system term term global behavior depend condit softwar system design dynam make intern dynam contrast consequ softwar system longer test goal find error test regard capabl behav independ exact behavior compon condit system expect oper import note newli deploi softwar system execut environ system execut softwar system impact condit system dynam design test system devot make softwar system danger system expect theori model complex dynam modern social organiz plai major role revolutionari chang paradigm softwar cultur background comput scientist softwar design cultur find wai exploit construct influenc dynam exploit dynam research clarifi mutual dynam influenc softwar system suitabl methodolog tool develop mad softwar engin develop dynam addit design enemi fight trivial applic directli inspir visual dca paint made chang color local transit make chang color pattern simpl perturb transit rule global chang pattern wall possibl make global pattern emerg system reli local interact exploit enforc global coordin synchron system comput low effort exploit dynam control influenc system interven system world continu decentr softwar system run stop case internet servic maintain updat system stop feasibl stop internet marketplac auction requir stop accept make negoti updat test softwar loss term revenu imag tremend avail proper model possibl influenc system stop simpli forc specif dynam chang global behavior system make exhibit requir behavior relat work cellular automata ca extens studi research area ca encompass theoret applic call hard soft scienc hard ca scienc includ formal studi comput properti ca extens simpl ca model studi behavior ca complex dynam system ca consid synchron close sake achiev determin predict behavior work recogn peculiar interest behavior exhibit asynchron model miss identifi strong influenc system perturb environ behavior ca dynam soft ca scienc split main applic simul engin ca shown altern comput system edg detect digit imag random number gener call cellular program approach cell local transit function transit function assign chang mean evolutionari applic imag combinatori optim problem evolv hardwar hope investig dca lead applic approach area simul ca power simul system process phenomena simul process classic ca typic made close system dca model introduc put research forward provid suitabl framework simul open social comput system side simul classic ca viabl assumpt actor ca perfect knowledg full control state rare fulfil societi market dca approach effect model influenc dynam environ presenc process limit knowledg control local strictli relat work ca research boolean network network form broad boolean network consid sort ca topolog interconnect undirect typic regular type network found interest applic model biolog social network dynam case research relat influenc perturb environ network dynam miss system fact establish entiti situat research explicitli focu influenc environ behavior agent multiag system origin distribut artifici intellig multiag system larg amount studi shown system autonom compon interact chang statu outcom make peculiar global behavior damag emerg recent exampl studi found area comput market comput ecosystem anticip section studi intern dynam account perturb environ studi area artifici social law show global rule constrain behavior agent group notabl influenc dynam behavior group studi adopt organiz metaphor design multiag system show definit global rule agent obei effect control global multiag system behavior basic intuit fact live environ societi fulli autonom action constrain state cell dca chang perturb function studi exploit kind abstract construct design assum full control environ behavior research typic miss identifi agent live dynam rule govern execut interact chang evolut multiag system influenc behavior unpredict simpli uncontrol import abstract dynam global behavior system properli attribut studi implement multiag system simpl agent indirectli interact local put synthet pheromon environ pheromon concentr spatial bound portion environ affect interact pheromon evapor simpl model emerg phenomena achiev difficult goal find shortest cluster similar multiag system dca exploit asynchron compon affect execut evolv global state correl gener mean posit feedback till system research possibl environ dynam construct exploit research perturb effect uncontrol dynam global behavior system futur work paper report outcom set experi perform class cellular open environ perturb dynam experi shown perturb make spatial observ close emerg start paper discuss strong relat dca distribut paper argu distribut agent system exhibit characterist open similar sort spatial structur make agent start popul dramat influenc behavior network requir explicitli account environ exploit dynam addit design prevent control behavior system experi report paper work formal concept measur perturb order thermodynam emerg extend dca simul framework studi behavior network structur regular boolean network mobil intend perform experi evalu behavior dca perturb regim evalu behavior complex dca larg set complex transit function main object drive current research make experi approxim characterist distribut scenario end power simul environ refer confer cellular automata research confer cellular automata research industri dynam complex system theraulaz swarm intellig natur artifici system santa fe institut studi scienc complex oxford mobil agent applic intern confer softwar toronto concur program distribut artifici distribut artifici theori kluwer pp strategi select seller satisfi proc intern workshop cooper inform pp sept control comput vision coordin internet omicini al springer pp emerg comput sfi studi scienc vol st intern workshop softwar lnc jan asynchron cellular physica softwar artifici kauffman origin order oxford price softwar comput structur scientif chicago nov versu dynam spatial distribut physica social comput artifici explor freeman organ agent intern confer autonom montreal approach workshop radic agent sept engin principl natur agent annal oper de asynchron updat cellular cellular automata perform physica sipper emerg cellular ieee juli artifici cellular theoret comput march commun wegner interact power commun softwar aaai menlo park pp princeton wolfram cellular automata complex abstract analysi design st intern workshop softwar lnc jan design sign italian workshop object modena sept
ML/935 6 robust classif system environ foster provost bell atlant scienc technolog avenu white york tom fawcett bell atlant scienc technolog avenu white york januari abstract difficult target oper condit uncertainti make build robust classif system problemat show build hybrid classifi perform classifi target condit robust perform extend wide varieti comparison includ optim metric expect workforc util perform hybrid surpass classifi hybrid effici updat provid empir evid robust hybrid classifi problem introduct classif system built experi compar perform classifi perform comparison difficult environ kei paramet optim tradeoff target class distribut seldom inform crucial choic optim classifi argu desir avoid commit singl classifi system construct hybrid classif system built hybrid perform target class distribut target condit run time case inform unavail system run condit chang dynam hybrid system tune easili base feedback actual perform argument structur sketch briefli tradit approach build order demonstr brittl type common problem subsequ section provid support claim roc convex hull eleg solut problem build robust classif system solut eleg result hybrid robust wide varieti problem effici updat show hybrid classifi classifi situat provid empir evid type system problem brittl robust classifi gener team creat system larg number instanc identifi action instanc potenti case fraudul account faulti interest problem method classifi rank instanc system builder ai method expert neural learn tree system potenti classif model ignor moment issu foremost question face system builder model perform classif approach answer distribut instanc sampl standard approach estim error rate model statist model lowest error rate strategi common machin pattern data expert system medic diagnosi measur cost benefit appli statist method bootstrap estim model error rate recent studi compar effect statist method dietterich approach brittl type common posit rate figur classifi criteria environ cost benefit class distribut approxim fact point author catlett fact concern larg subfield analysi environ chang time system conceiv time level fraud level custom chang continu time place place paper address problem instanc map element set ng posit neg class classif model map instanc predict class distinguish actual class predict class label ng classif produc model error cost function cost posit error cost neg error repres class distribut class prior probabl tradit approach brittl model respect specif cost function class distribut target condit system longer perform accept assum maximum posit fp find classifi highest true posit tp exce fp limit simplic loss cost includ benefit realiz compar classifi error frequenc estim probabl fp shown figur classifi fp system built singl classifi brittl fp requir chang address brittl extend tradit framework produc robust defin satisfi target cost class robust classifi perform classifi condit statement optim classifi classifi state classifi robust stronger state optim robust classifi optim condit system easi tune base feedback situat target condit run time situat chang classif brittl overcom save classifi expert probabilist perform autom comparison desir target condit system feasibl time space myriad classif data mine method paramet set store classifi tune system compar classifi fly condit practic show classifi hybrid classifi roc convex hull robust hybrid classifi built roc convex hull method compar visual classifi behavior environ fawcett base receiv oper characterist classic methodolog signal detect theori common medic diagnosi recent begun gener ai classifi work definit space instanc space set classif model classifi set classif model function classifi input instanc classif number produc classif produc posit rate classifi classifi classifi figur roc graph classifi thing involv time set cost class distribut defin select classifi condit build defin set includ model perform optim condit cost store map method gener appli varieti problem formul review briefli basic roc analysi roc space denot coordin system visual classifi perform roc tp repres axi fp repres axi classifi repres point roc space tp pair model produc continu output estim posterior probabl instanc class statist vari threshold output vari result curv call roc curv roc curv illustr error tradeoff probabilist model figur show graph typic roc complet roc curv classifi shown figur roc graph illustr predict behavior classifi regard class distribut error decoupl classif perform factor detail provost fawcett method input set classif perform plot roc space find convex hull set point roc space convex hull set point smallest convex set point threshold defin classifi posit rate classifi classifi classifi convex hull figur roc curv convex hull boundari point roc space classifi point potenti optim point roc space northwest figur show roc curv convex hull drawn claim model combin form classifi robust classifi definit classifi set classifi make classif classifi fp note moment defin fp valu vertic robust classif definit robust classifi vagu mean classifi situat call comparison framework show robust wide varieti comparison framework begin minim expect process prove minim expect cost cost class distribut deep understand work show robust varieti practic metric show problem hybrid classifi minim expect cost analysi method determin classif model convex hull roc space line correspond weight random guess proper classifi line expect cost appli classifi error probabl tp fp tp fp show robust problem classifi classifi minimum expect cost definit minim expect cost class translat singl real product cost ratio reciproc class ratio set condit defin slope import tool argument slope monoton discret number compon includ classifi defin endpoint phrase roc shorthand cumbersom point roc refer vertic space proof definit real number point slope endpoint segment slope segment exist vertex left adjac segment slope greater adjac segment slope leftmost endpoint consid attach segment infinit slope rightmost endpoint consid attach segment slope note defin point lemma cost class point minimum expect cost assum condit exist point smaller expect cost point equat point expect cost point tp tp fp fp condit point equal expect cost form roc space slope point line larger lower expect cost point curv curv convex set contradict line point point line expect point smaller expect cost point contradict shown minimum expect cost classifi definit line slope line lemma cost class distribut translat point minimum expect cost slope point point slope point minimum expect cost definit segment left slope segment slope greater case point vertex neighbor line left line connect slope greater construct proof lemma mean lower expect cost contradict argument analog lemma slope point point minimum expect cost point point slope proof directli lemma lemma multipl definit connect expect proof directli lemma lemma similar argument signal detect theori determin oper point roc curv model produc class membership probabl straightforward show robust problem minim expect cost theorem minim expect cost cost distribut class distribut classifi point directli lemma classif translat condit valu plug valu fp equat show translat condit lemma fp point slope straightforward calcul optim workforc recal previou section show robust goal provid minimum expect cost classif robust common metric accuraci maxim prefer classifi target class distribut rare account comparison classifi corollari minim error rate target class distribut error rate minim cost minim uniform error cost altern roc analysi compar area roc curv situat target cost distribut class distribut complet unknown auc repres probabl randomli chosen posit instanc rate higher neg estim wilcoxon test rank critic auc model choic specif target classifi maximum auc suboptim support eleg show optim specif target fact classifi larger auc theorem classifi auc larger assum roc curv classifi larger area curv point fall area mean convex hull contradict recal criterion specifi maximum accept fp rate standard roc select classifi criterion plot roc draw vertic line desir maximum fp pick roc curv largest tp intersect line minim expect cost suffici vertex problem formul posit rate classifi classifi classifi hull figur roc convex hull select classifi criterion perform statist point prefer figur slight yield classifi perform statist theorem achiev tp tradeoff repres point vertic extend point pick point fp tp tp point tp classifi call left endpoint hull segment endpoint distanc distanc make classif input instanc flip weight coin answer classifi probabl classifi probabl straightforward show fp tp classifi tp corollari maxim tp criterion similar minimum expect cost classifi realist problem formul support problem optim workforc workforc process fix number case case case leav case workforc workforc handl system present set case similar absolut cutoff percentag cutoff practic problem total number posit case total number neg case outweigh theorem workforc hybrid provid set choic criterion maxim tp subject tp fp optim point found intersect constraint line similarli previou classifi rest theorem classif translat condit fp valu plug criterion condit defin fp valu workforc util condit cutoff fp found intersect line tp fp similar argument hold comparison metric shown maxim lift linoff recal macmillan subject absolut percentag cutoff case provid set case minim expect environ forc favor robust solut comparison framework realworld desir cutoff unknown chang fundament variabl case compet robust solut optim solut cutoff document retriev yield document appar solut problem robust classif system rank work rank list case cutoff practic rank model classifi cutoff rememb roc curv form case rank move cutoff extrem implicit rank function perform problem robust solv elegantli set cutoff formal argument scope rank function perfect pick randomli randomli rank perfectli prefer cutoff prefer larger cutoff beat compon classifi realist situat system compon classifi criterion intersect fp line highest compon roc curv occur fp intersect compon classifi produc statist figur theorem surpass perform compon classifi problem hull point tp larger tp point fp theorem achiev tp hull small number fp valu correspond hull vertic hold problem workforc lift recal maxim time space effici argu robust wide varieti problem formul show effici updat time effici build depend effici build compon vari wide model type model built machin learn method built data model year build presum work built method classifi updat increment time effici depend effici evalu classifi presum work time effici hybrid depend effici build log time algorithm number classifi roc space classifi optim target condit theorem minim expect classifi optim cost class distribut directli lemma definit number classifi store reduc bound potenti target condit provost fawcett rang condit defin segment subset ad classifi effici ad classifi extend ad possibl subtract conclud classifi superior exist classifi portion roc space discard complex compon classifi situat complex construct prohibit classif model find subset effici model empir demonstr robust classif theoret interest concentr weaken strong assumpt argu assumpt knowledg cost class distribut cite evid ai work subfield analysi dedic quantifi cost benefit exist classifi classifi optim set optim scope paper offer studi provid solid evid answer refer roc analysi medic domain recent conduct bradlei answer fortun publish result classifi domin roc curv complet defin mean domin classifi robust vice exist trivial domain classifi techniqu essenti bradlei studi medic data set uci repositori murphi note rare individu misclassif cost plot roc curv classifi learn algorithm neural tree statist data set domin classifi mean exist set condit classifi prefer classifi paper classifi bradlei result heart bleed result full set classifi found figur classifi construct cleveland heart posit rate msc perceptron figur bradlei classifi result heart bleed data posit rate msc perceptron figur bradlei classifi result cleveland heart data shown figur bradlei result show domain classifi maxim singl area roc cost class distribut shown limit limit present defin problem extend note grow quadrat number class assum constant error cost type posit cost error type cost problem transform problem uniform error cost duplic instanc proport cost evalu reformul methodolog appli assum paper estim classifi perform statist tp good mention work address product good estim simpl perform statist error rate work address product good roc curv estim note simpler care avoid overfit train data ensur differ roc curv author advoc averag roc curv open problem address predict perform comput perform concern classif model easi answer underli model answer fall short interpol model understand system perform optim target condit realist problem formul effici build term time updat increment conclud robust classif system motiv work fundament recent machin learn work combin multipl model pazzani work combin model order boost perform fix cost class distribut combin model robust cost class distribut method classifi candid extend classifi achiev perform specif set condit interpol edg pursu line inquiri note easi tune uncertainti case class cost distribut inform run method set achiev optim perform uncertainti quantiti present run system tune base feedback perform vari extrem turn knob tp turn knob left fp rate alarm observ turn knob left system produc turn knob knob give optim tp tradeoff acknowledg discuss roc analysi classifi andrew georg kohavi ron andrew bradlei suppli data analysi refer error reduct learn multipl descript machin learn algorithm convex hull technic report minnesota data mine custom support john wilei son machin learn user issu thirteenth nation confer artifici menlo aaai press area roc curv evalu machin learn algorithm pattern recognit tailor ruleset cost confer ai approxim statist test compar classif learn algorithm neural comput signal detect theori roc analysi seri percept academ press mean area receiv oper characterist curv radiolog uci repositori machin learn analysi visual classifi comparison class cost distribut intern confer knowledg discoveri data mine aaai press compar pitfal avoid recommend approach data mine knowledg discoveri measur accuraci diagnost system scienc clinic analysi saunder compani
IR/936 5 intellig retriev digit imag larg geospati anthoni jame dept spatial inform scienc engin nation center geograph inform analysi main commiss work group kei imag spatial inform manag shape digit imag match abstract paper present develop spatial data manag system util queri retriev digit imag topograph discuss strategi algorithm implement present design issu queri tool research emploi sketch shape spatial configur imag retriev strategi inspir match repres extens function varieti raster result rank statist score user subsequ narrow broaden search obtain result search introduct intellig imag retriev larg applic receiv attent comput vision commun prototyp system includ ibm qbic visualseek pichunt common trend effort focu imag includ imag cartoon wild anim object queri retriev imag sunset imag properti adequ inform imag member displai substanti differ properti distinguish topograph imag larg number imag aerial repres strike similar term gener imag properti imag retriev approach mention suffici inform retriev topograph imag distinguish imag topograph shape configur object paper present approach retriev imag topograph imag oper approach emploi increasingli specif inform retriev imageri term content refer object depict imag present strategi design prototyp system imag retriev system design digit imag analysi issu relat match sketch imag queri mention research origin topograph develop methodolog appli type imageri strategi descript oper environ system shown fig searchabl topograph imag aerial inform metadata metadata interest includ form inform sensor date content properti common data file digit map digit aim strategi advantag intuit method human express spatial sketch queri interfac access individu member input paramet metadata inform sketch approach design proce oper sketch configur addit metadata search yield imag satisfi metadata spatial configur similar sketch match imag satisfi queri paramet search perform progress metadata inform thin pool potenti match analysi shape perform identifi match assign estim confid reason design metadata search optim thin larg search space search gener move global imag properti convei sketch metadata queri queri interfac imag metadata addit metadata imageri extract match similar estim queri shape sketch updat queri metadata fig oper environ metadata individu featur imag metadata inform support indirectli assign semant connot sought featur specif shape mean found aerial imag scale found satellit imag ground resolut queri topograph relat simpl gener color textur properti typic inadequ differenti aerial satellit imag variat depict area histogram relev global properti compar imag rural urban coastal area suffici percept exploit queri process context topograph applic term wide varieti natur problem forc perform search imag object depict system design outlin object extract digit imag perform imag introduc result system architectur shown fig dash line oper reach java server access librari featur metadata retriev proper imag design shown fig imag entri imag filenam metadata list potenti valu set attribut describ gener properti imag attribut includ date time date time introduct locat imag hierarch arrang geograph entiti complex attribut extend incorpor sensor inform imageri type featur set distinct featur object link imag file featur role featur librari provid crucial link reduc search space queri group featur order queri librari optim optim criteria member librari exhaust describ input member librari independ unnecessari ideal librari approach base span space shape addit includ semant semant object inform object link imag file part queri perform user input set metadata valu sketch depict object metadata valu describ accept characterist imag object input valu identifi accept subset metadata link featur featur librari defin featur input sketch match featur subset complet featur match java client web server imag analysi tool featur lib metadata info imag librari fig system architectur accept match give link specif imag locat object similar input sketch inform return user option edit queri semant librari mention result pass check semant properti detect object queri result provid ad step order support sequenc perform time imag introduc user metadata inform metadata librari updat add extract input imag digit imag analysi featur compar exist complet featur librari match librari entri updat includ link link metadata featur librari updat connect metadata valu imag featur detect extend queri configur emploi concept describ major topolog relat point break queri spatial scene identifi individu object similar input exist identifi combin locat satisfi topolog relationship input metadata librari featur librari semant librari imag librari sketch fig design attempt retriev raster file depict hexagon build structur separ shape identifi locat object exist subsequ analyz inform filenam locat combin satisfi desir configur formul scene queri combin space queri topolog permit easi fast queri edit attempt edit queri reconfigur set topolog relat oper simpler search shape librari design appar analyz mean metadata featur connect assum distinct metadata metadata space point space correspond imag captur similar sensor paramet accept specif valu move blob metadata space photo scale specif area specif date form blob metadata space blob repres scale space area time data captur defin point metadata space declar kind featur specif area geograph space queri metadata inform narrow area perform shape queri shape exist region interest design tradit process identifi object geograph space mention implement initi librari readili set librari interact pictur environ hundr augment incorpor standard cartograph figur shape librari augment time shape queri find adequ match librari case queri pattern member compar acquir link inform posit pattern similar match match algorithm influenc concept squar match modifi function onlin stage prototyp squar match offer robust method establish correspond imag window mathemat base permit success extens applic multipl imag match scheme establish correspond set imag match match process begin imag enter imag user input relev metadata imag extract imag appli gener edg filter produc final edg file consist black level white level pixel edg file link imag ident filenam extens begin match featur featur librari edg file record featur librari featur found match match locat imag determin librari featur center mass central pixel featur origin rotat scale librari featur match process method prove center minimum bound circumst multipl group featur combin make singl featur templat match imag imag edg file subdivid direct direct creat matrix equal size subregion subregion boundari librari featur rotat scale insid match boundari set featur doesnt wast time search area imag relev data featur rotat metadata input menu user push input button add imag spawn process imag imag imag scale button pop screen option addit option interact ad user imag input input fig metadata input menu fig subregion imag fig overlap subregion space order avoid break origin librari templat boundari subdivid imag featur restrict translat uncontrol imag movement confin subregion subregion check individu match librari featur search direct distanc move distanc half dimens subregion find suitabl match pixel vote move entir featur posit subregion posit half dimens subregion search repeat featur encount boundari drop half subregion dimens direct repeat movement direct find featur imag match hit boundari subregion entir subregion search successfulli featur jump begin subregion repeat process complet check posit match region identifi match imag avoid miss match occur border addit subregion ad overlap area give separ region imag search number subregion decid assum featur search smaller total imag size featur search larger imag subdivid quarter subdivid imag includ scene complex complex scene subdivid speed search process determin direct move featur match subregion divid quadrant center central pixel templat featur quadrant match separ imag sum pixel featur quadrant record vote stai move vote direct direct check direct mean quadrant vote move stai move method half featur detect featur shift origin pixel edg imag quadrant vote compar quadrant averag direct distanc templat featur posit subregion sampl quadrant vote templat featur shift found tabl vote mean quadrant vote cardin handl case combin quadrant analysi quadrant shift direct distanc proce rotat scale amount translat averag distanc calcul quadrant transform coordin featur pixel calcul sin sin shift shift scale larger scale larger scale smaller scale smaller rotat rotat tabl select quadrant vote featur shift subregion subregion subregion subregion subregion angl rotat axi posit axi rotat angl posit counter direct iter quadrant shift determin rotat angl opposit halv halv rotat angl continu long direct rotat altern posit neg arbitrari limit iter met scale independ axi global independ axi scale user digit featur match process featur scale amount direct global match process match process user exist featur imag search featur librari global scale assum constant scale chang direct case imag scan resolut focal length fly height determin analyz quadrant shift scale direct entir featur scale amount direct case quadrant remain intact featur pixel quadrant pixel move direct amount case scale featur space featur pixel quadrant logic data insert empti space detail exist origin scan method circumv lack area fractal imag compress techniqu matter larg imag scale zoom detail shown librari featur settl match accuraci determin pixel continu vote move compar vote stai subregion imag match posit match percentag record sort imag match percentag imag determin imag link featur featur templat librari match match process begin sketch featur match featur librari turn link imag wai user select featur imag interfac edit digit scratch featur outlin interfac user turn featur pixel insid area user click white pixel turn black vice versa user select featur exist imag templat object nomin scale base scan resolut satellit imageri scan resolut combin focal length fly height aerial imag user provid scale templat featur match priorit templat featur scale order fit closer featur true match templat featur extract match begin procedur begin determin templat featur center mass determin similar match process match featur librari imag subdivid individu featur templat librari save amount search process time match assum subregion imag perform rotat scale oper similar match process differ scale user global scale select exist featur imag independ scale sketch edit templat featur scratch templat featur settl match accuraci determin pixel continu vote move compar vote stai librari featur templat match posit match percentag record sort match percentag determin rank sort return imag base origin queri distinguish featur scale rotat determin match percentag test featur manipul order fit imag made reflect rank addit subdivid quadrant quadrant facilit templat featur warp fit object imag subdivid quadrant quadrant conceiv level featur manipul result queri return user templat featur click pixel chang option metadata queri run subset imag entir case metadata chang subset list imag creat search match queri imag return queri top displai queri result screen cutoff match percentag determin imag includ queri subset imag subsequ queri begin return sort imag user interest undo button return previou queri paramet sketch metadata queri paramet store individu queri recal result comment prototyp system paper develop present enhanc optim imag featur tabl match result origin imag user digit polygon area interest user push extract button extract area interest option edit area interest click push metadata continu metadata extract area fig extract area interest imag imag edg edg extract individu featur imag test preliminari result tabl show match percentag extract featur sampl imag return test reliabl match extract featur modifi ad queri imag modifi featur return match imag lower match percentag case metadata menu imag imag scale area match user edit sketch metadata click rerun queri subset user rerun queri subset imag undo redo user retriev full resolut imag click thumbnail fig queri result prototyp system paper develop present enhanc optim comput advantag method versatil theoret system design match core modul properli function compar digit imag window sketch offer potenti extend system function multimedia spatial queri perform simultan gi vector import aspect anticip move integr spatial inform focu futur work due system design match tool method scale independ import queri oper inher sketch depict featur combin featur resolut emploi multiresolut differ directli account accuraci perform potenti techniqu optim method robust term mathemat statist advantag exploit object interpret queri oper match candid arrang rank base statist analysi similar templat potenti object interpret inher method base squar foundat emploi match extrem import project method present step forward spatial move queri base metadata global properti imag domin queri featur imag put emphasi semant inform content conceptu accur imag retriev abil human oper manipul queri process chang bring human oper process advantag superior cognit abil acknowledg work partial support nation scienc foundat grant number nation center geograph inform career grant number refer multipl imag engin remot vol pp cohen sd lj index arpa imag understand vol pp cox ml yianilo annot content base imag ieee access imag video pp egenhof topolog intern journal geograph inform vol pp flickner imag video qbic septemb pp featur extract squar templat match constrain intern shape intern archiv photogrammetri remot vol part pp featur extract dynam program global enforc squar automat extract object aerial space pp gudivada evalu algorithm imag retriev spatial acm transact inform vol pp guiba lj retriev robot vision research arpa imag understand vol pp jain nsf workshop visual inform manag theori comput kluwer academ track fluid tomographi vol pp mehrotra je retriev shape data pp septemb ve retriev relat pp septemb rw tp textur multimedia pp sclaroff imag world wide ieee access imag video pp manual technic utrecht holland smith jr imag video world wide multimedia pp
DB/937 3 conjunct regular path queri kr diego giusepp de giacomo maurizio lenzerini mosh vardi dipartimento di informatica sistemistica di roma itali lastnam depart comput scienc rice po box tx usa vardi abstract reason queri basic problem knowledg fundament form reason queri check verifi queri yield necessarili subset result queri queri crucial queri knowledg base veri inform integr cooper answer paper address problem queri context semistructur knowledg basic queri regular path pair object connect path conform regular express conjunct regular path queri extend regular path queri possibl binari conjunct atom speci es regular path queri hold variabl present techniqu check queri base nite automata techniqu show power automata deal oper variabl queri comput complex algorithm problem introduct queri fundament mechan extract inform knowledg base basic reason task queri queri amount comput inform return result queri reason servic involv queri knowledg system support import check verifi queri yield necessarili subset result queri crucial queri knowledg base veri inform integr cooper answer queri optim aim improv ecienc queri larg bene ts possibl perform kind comparison queri express queri check recogn avoid comput result recogn possibl materi integr constraint speedup queri process fernandez milo shown queri relev task knowledg base veri cation problem verifi knowledg base produc correct set output set input solv mean method exploit abil check queri major issu inform integr reformul queri express uni ed domain term local sourc recent paper point queri essenti de knoblock inform integr applic develop data express languag de semistructur model scenario pose interest challeng knowledg queri notabl challeng de queri crucial integr constraint check cooper answer gener knowledg system base descript logic conceptu form subsumpt heart relev reason task levi needless queri undecid limit express power queri languag knowledg suitabl queri languag design retain decid true notion conjunct queri basic investig reason queri conjunct queri simpli conjunct atom built relat symbol quanti correspond singl rule datalog result queri concern conjunct queri extens establish conjunct van der conjunct queri inequ case queri union di erenc oper studi class datalog queri decid undecid result present der paper case conjunct queri presenc type constraint david levi levi knowledg system integr datalog descript logic paper address problem queri context gener form knowledg call semistructur knowledg base goal captur essenti featur knowledg base found semant descript conceptu tradit semistructur conceiv knowledg base label node repres label edg node repres fact binari relat denot label hold object basic queri mechan regular path queri de pair object connect path conform regular express regular path queri extrem express complex navig graph union transit closur crucial complet knowledg structur knowledg base conjunct regular path queri extend regular path queri possibl binari conjunct atom speci es regular path queri hold variabl author argu kind extens essenti make regular path queri real set buneman milo conjunct regular path queri studi expspac algorithm queri class present lower bound provid method easili generaliz account oper case oper implicitli address de algorithm queri framework investig includ rich set suit conjunct regular path queri present techniqu check queri base nite automata di erent standard nite state automata equip head move back input string transit kind automata head move stai place techniqu show power automata deal oper variabl conjunct queri describ algorithm check queri check nonempti automaton construct queri algorithm work exponenti complex algorithm case conjunct regular path queri prove expspac lower bound comput complex demonstr method essenti optim lower bound hold disregard solut open problem conjunct regular path queri pspace speci method basi automata reason complex adapt gener form queri union conjunct reason task queri formal arti cial intellig tempor dynam logic backward action theori knowledg base queri semistructur knowledg base graph set set edg label element alphabet node repres edg node label repres fact binari relat hold pair denot edg label basic queri mechan kb regular path queri express regular express nite comput set pair node kb connect path conform regular languag de ned queri extend regular path queri possibl conjunct variabl fp alphabet includ symbol denot binari relat regular path queri express mean regular express nite automata contrast evalu kb comput set pair node connect conform regular languag de ned sequenc form conform simpl node occur add possibl conjunct atom speci es regular path queri hold variabl alphabet conjunct regular path queri formula form xn em xn rang set fu variabl call distinguish em answer set kb set tupl dn node total map fu distinguish variabl conjunct kb parent relationship mother return pair individu transit closur sibl individu descend father mother written kb counterexampl kb kb tupl verifi father order introduc notion canon kb xn em total map variabl fu node constitut simpl conjunct node edg start end node share di erent simpl conjunct connect node node conform easi tupl belong nonempti assum form xn distinguish variabl xn set variabl disjoint assumpt made loss renam variabl simul equal introduc hand side kb total map variabl call map distinguish variabl node distinguish variabl note exist impli theorem import theorem exist kb map variabl node exist proof easi counterexampl show counterexampl transform kb form state theorem kb counterexampl automata automaton consist alphabet nite set state set initi transit function set accept state transit state head read input move left stai place automaton tradit nondeterminist nite state automaton call con gurat pair consist state posit repres natur number run sequenc con gurat sequenc run word run accept accept accept run set word accept denot automata de ne regular languag automaton construct automaton log state accept languag gain intuit automata captur comput kb end show automaton fundament task verifi nonempti kb basic idea exploit automata repres special kb mean word kb domain xed set constitut simpl node edg disjoint start end node kb repres word wk alphabet form wm rang act separ speci wk consist subword simpl conform observ repres kb word differ direct consid order subword build automaton ae alphabet ae accept word wk nonempti answer kb repres wk exploit abil automata move word forward correspond edg kb posit word repres node posit repres node capabl ensur automaton evalu word simul evalu queri kb construct ae assum repres nite automaton alphabet ae sa fs fs sa fs fs sg de ned transit place head automaton randomli chosen posit input string set state automaton randomli chosen initi state point transit make automaton readi scan step backward place transit transit correspond transit perform forward backward current automaton reach symbol repres node rst enter move occurr word automaton exit search mode continu comput forward backward item transit move head automaton end input automaton enter nal state observ separ symbol transit role forc automaton move correct direct exit theorem relationship automaton theorem kb wk word repres ae accept wk nonempti check upper bound lower bound problem check upper bound form xn set variabl show search counterexampl kb theorem sucient kb map variabl node exist gener candid counterexampl kb rst construct automaton accept set word form repres kb element xed set node explicitli encod word accept map variabl node requir ensur element word accept constitut partit class construct de automaton accept word form word automaton check word distinct symbol constitut partit automaton check word symbol number state polynomi size alphabet number state exponenti number variabl product automaton exponenti size call word accept kw denot kb map virtu correspond kb method check base search kw exist check kw de ne automaton check exist complement obtain automaton order de ne repres kw map annot variabl map kw symbol annot repres word alphabet intend mean variabl map kw node map target node edg occurr word repres annot automaton check annot correspond kw construct de automaton check symbol distinguish variabl occurr annot set variabl automaton check variabl annot symbol annot occurr symbol automaton check occurr symbol annot set variabl symbol automaton check atom sati ed kw symbol annot pair node kw build exploit construct section number state polynomi size number state exponenti number variabl product automaton automaton exponenti size de ne automaton simul guess annot emul behaviour result annot word simul guess emul obtain simpli construct project annot notic number state automaton depend size exponenti number variabl transit idea construct path initi state nal state lead accept word correspond path lead accept word repres observ number state stress project annot transit correspond guess order guess automaton automaton ensur make guess time pass posit word de ne automaton complement theorem speci ed nonempti proof theorem check sucient kb map variabl node canon exist word accept repres kb kw map kw accept annot repres kw nonempti exist kw canon kw exist nonempti theorem check expspac proof theorem empti size exponenti size size exponenti size size polynomi size size exponenti size size doubli exponenti size check empti construct explicitli start construct empti algorithm move state intersect state guess check directli connect veri algorithm discard step algorithm memori state gener singl step algorithm lower bound show expspac lower bound conjunct regular path queri close open problem pspace prove result exploit reduct tile problem emd tile unit squar type tile problem speci ed mean nite set tile binari relat repres horizont vertic adjac distinguish tile type tile problem consist determin number region integ plane size tile consist adjac relat left bottom tile region type upper tile type reduct accept expspac ture machin analog emd shown tile problem theorem problem check proof instanc tile problem number unari alphabet queri regular express hand side word consist sequenc block consist address tile intend sequenc address behav start end word encod tile pair adjac tile consist pair tile tile consist word encod error error pair block exhibit incorrect behavior counter pair tile inconsist detect error queri regular express ng construct explain intuit map pair repres error de ne regular express fc detect adjac block error address bit fc construct encod counter de ne regular express fh detect adjac block tile respect horizont adjac relat fh order construct regular express detect sequenc tile rst block respect vertic adjac relat de de ne denot complement bit assum address bit word accept gn constitut sequenc block rst block block fact rst block coincid address block address bit equal block address bit equal intersect gn detect error due vertic adjac relat de ning fh fc queri detect type error word error word word counterexampl present upper bound lower bound result conjunct regular path queri class queri featur typic modern queri languag knowledg data base largest subset queri languag xml data shown decid upper bound show ad conjunct regular path queri complex queri lower bound hold case answer question inher complex check conjunct regular path queri interest featur method demonstr power automata reason complex queri method adapt gener form queri reason task easi extend algorithm case union conjunct regular path queri queri typic rst step address involv problem queri rewrit queri answer view case regular path problem studi work extend result power queri consid exploit techniqu base automata acknowledg work support part nsf grant esprit project dwq data italian space agenc project ed basi di refer data relat semistructur data xml morgan lo alto queri cach optim distribut mediat system proc acm sigmod int conf manag pp relat express siam undecid domino problem mem amer math classic problem perspect mathemat logic extens markup languag recommend tech world wide web consortium semistructur data proc acm sigact sigmod sigart sym principl system pp queri languag optim techniqu unstructur data proc acm sigmod int conf manag pp de decid queri constraint proc acm sigact sigmod sigart sym principl system pp de repres reason xml descript logic approach logic de descript logic framework inform integr proc int conf principl knowledg reason pp de rewrit regular express regular path queri proc acm sigact sigmod sigart sym principl system pp de answer regular path queri view proc ieee int conf data engin minim posit conjunct queri oodb proc acm sigact sigmod sigart sym principl system pp optim implement conjunct queri relat data base proc acm sym theori comput pp optim queri materi view proc ieee int conf data engin taipei datalog program proc acm sigact sigmod sigart sym principl system pp david test conjunct queri function depend comput system queri xml data ieee bulletin technic data reason descript logic principl knowledg studi languag pp csli public integr datalog descript logic intellig inform conceptu current research practic elli horwood workshop intellig inform integr ceur electron workshop verifi integr constraint proc int joint conf arti cial intellig optim regular path express graph schema proc ieee int conf data engin pp techniqu survei sigmod queri conjunct queri regular express proc acm sigact sigmod sigart sym principl system pp navig plan data integr proc nat conf arti cial intellig aaai mit press gener conjunct queri view mainten integr constraint veri cation workshop deduct conjunct washington dc introduct automata comput addison weslei publ massachussett conjunct queri inequ aaai spring symp inform gather distribut aaai spring symposium seri aaai mit press queri answer algorithm inform agent proc nat conf arti cial intellig pp languag combin horn rule descript logic proc european conf arti cial intellig pp veri cation knowledg unifi logic view proc european symposium valid veri cation knowledg base system belgium combin horn rule descript logic arti cial veri cation knowledg base base check arti cial semant queri optim datalog program proc acm sigact sigmod sigart sym principl system pp decid queri complex object proc acm sigact sigmod sigart sym principl system pp index structur path express proc int conf theori vol lectur note comput pp system annot answer queri properti intellig inform relat express union differ oper van der complex queri ind nite inform phd rutger van emd domino forev proc informatik pp paderborn van emd conveni tile vol lectur note pure appli pp marcel dekker note reduct automata automata inform process special issu materi view data wareh ieee bulletin data
DB/938 3 distribut manag ý dept comp turkei abstract distribut manag relat data enabl share consist data provid system transpar contrast inform user access compact data relat process distribut manag challeng research area involv bridg syntact semant heterogen data function exist distribut manag system built focu implement dedic protocol distribut inflex major modif exchang protocol softwar architectur compli design facilit mainten softwar system present approach flexibl distribut independ distribut manag protocol method modular exchang test design distribut manag form system framework gener queri process scheme prototyp implement form homogen environ test protocol option heterogen dbmss keyword artifici intellig expert parallel distribut process introduct princip type relat data network differenti design distribut design multi db major problem type db manag system syntact semant heterogen data model access model relat data object al al conceptu schema al relax db integr al al db tool order cope type success solut attack problem algorithm softwar design orient softwar design facilit gener softwar design paradigm solut db al al insuffici design intellig behaviour design paradigm intellig behaviour distribut system agent approach research system reach matur enabl success inform retriev domain al al al al al solut problem relat requir heurist decid function suitabl form function approach design framework flexibl form intellig ma implement prototyp form concern prototyp exploratori test protocol method implement devot implement test dedic protocol method al initi design test data exchang scalabl larg number site provid test environ protocol goal implement flexibl provid modular exchang protocol introduc system relax function flexibl framework emphasi queri process environ prototyp aspect discuss paper conclud final remark design major problem area consid princip softwar design issu chosen framework consist introduc distribut model problem area consid adopt commonli problem requir model physic db distribut queri distribut directori distribut concurr distribut deadlock heterogen heurist solut tend result requir process termin evalu complet principl design issu defin flexibl major system modular exchang combin test support relax order satisfi perspect softwar issu guid design knowledg flexibl complet site db figur relationship data compon manag db db db db tm db model basic idea db model share db unlimit number heterogen dbmss site logic physic relationship insid depict cardin logic system compon repres unrestrict scalabl import relationship complet model complet model agent type emploi user agent implement domainspecif user interfac task agent implement distribut queri distribut concurr control resourc agent implement broker function task agent db agent agent implement physic db distribut db maintain local global wait graph resolv deadlock detail discuss agent type respect provid descript model distribut queri process model complet prototyp implement model system perform complet discuss applic domain internet structur relat easi configur polici complet client user user agent task agent mi discuss framework flexibl form ma prototyp implement form homogen environ test protocol method heterogen dbmss complet synchron commun commun network nj server agent nj resourc agent figur commun relationship autonom entiti refer referenc url valid octob al ein für im al peter customiz discoveri access tr boulder al colin complet guid intranet john wilei son york al distribut applet al philip open agent aaai spring pp march al knowledg aaai expert system physic design relat expert system microcomput al distribut object manag commun acm al mean differenti compon tool ieee comput al van frank van pass belief intellig agent agent springer al approach control share heterogen southern california al access heterogen inform sourc aaai symposium inform stanford al michael arthur oliv inform integr acm sigmod al optim distribut ieee transact knowledg data semant heterogen feder heterogen phd southern california sun microsystem palo alto al schemat similar vldb journal al agent base mental ieee comput specif distribut dept comp al commun model distribut concurr system engin volum io amsterdam al system agent model agent commun languag submit burg submit taipei design concept submit atlant citi al manag system semistructur sep al dougla open agent framework build distribut softwar appli artifici vol pp al analyt network artifici manag al henri consist heterogen distribut technic texa austin al technic mcc al david stuart scalabl inform retriev autonom marina del rai essenti distribut object surviv john wilei york artifici agent societi social structur implic autonom berlin al distribut prentic englewood cliff al georg model advanc academ press al exchang heterogen inform ieee intern confer data taipei al paul replic intern confer data orlean al paul distribut vldb vol pp berlin al intellig ieee dec al yanni versatil tool physic data al complex distribut queri ieee transact knowledg data
DB/939 3 model tempor consist data robert beat list tjoa institut softwar technolog ibm watson research center vienna technolog mill river austria ny usa abstract gener discov delai comput system typic updat pattern tradit data weekli basi enlarg propag delai inform knowledg worker main contribut paper identif tempor inform data classic descript time instant fact repres instant inform enter system present approach model conceptu time consist problem introduc data model deal time delai support knowledg worker determin situat inform instant time introduct observ event comput system delai appli context inform system determin extern intern factor updat process propag delai time interv monitor system realiz occur state chang contrast oper system meet time focu data gener strateg analysi data integr heterogen system data load week month complic situat data current consist context easi task requir rel avail data support process timet requir perform restrict data cite time varianc silent characterist view aspect data strong influenc delai system realiz state data approach enabl react chang custom concern figur demonstr typic updat pattern tradit weekli monthli basi enlarg propag delai inform knowledg worker delai recognit event result number data integr aggreg record chang count total prior histori analyt process histor analysi result longer addit inform time period integr delai summari chang unexpectedli user present schema model cope delai enabl time consist inform enhanc analyt process inform valid data typic restrict time frequent updat data remaind paper organ section consid research issu relat work event boston ny event captur electron format data load data past action base knowledg futur address chang ny provid special servic figur delai discoveri section classifi common tempor data structur inform system introduc concept tempor consist viewpoint section evalu model final give research issu relat work notion time fundament exist import aspect phenomena reflect past event futur reason event domain time time independ variabl determin sequenc state system tempor inform classic descript time instant fact repres instant inform system implicit critic transact process import determin situat inform time tempor provid support futur data sophist queri time state research tempor grown recent year transact time valid time investig detail field data al concentr shortcom star schema context slowli chang dimens conclud easier analyt process queri perform observ regular event formal approach manag tempor consist section pedersen jensen describ featur entir data model requir handl data evalu model disciplin tempor data lot research context tempor view interest practic approach view time fact captur electron format knowledg worker fact dimens record complic chang count total prior histori health deal huge number record natur delai activ tempor discuss conclud tempor faith provid appli concept data wareh ensur inform analyt process consist tempor data structur timestamp mainten tempor data tempor data understand time reflect relat structur state chang affect exist data number transient data kei characterist transient data alter delet exist record physic destroi previou data content type data typic found oper environ period data record ad physic content modifi record ad reflect updat delet period data complet record occur data period natur data kind data typic found data oper system previou state import account insur premium oper durat persist data held due perform storag constraint kind data term data snapshot data snapshot data stabl view data exist point time special kind period data snapshot repres data time seri snapshot provid view histori organ standard approach store period data found time stamp statu event record varieti scheme maxim effici timestamp singl timestamp approach store start time record applic event face defici context gener state inform store common type queri explain queri access current data singl timestamp identifi current record find latest timestamp period ineffici process queri build view data time past order support kind period valid record compar requir time singl timestamp end period valid found record period sequenc gener process order address timestamp end ad fact identifi end period valid perform improv retriev data suffici fulli solv period valid chang time due inform integr tempor consist view snapshot analyt process requir storag valid period enhanc data model time dimens detail section valid time dimens motiv revel time dimens describ point piec inform realiz sourc system load timestamp repres point time piec inform integr tempor consist figur overlap valid period continuum real time model direct timelin consist infinit set instant point underli time axi section timelin call durat event place instant durat time interv determin durat instant figur describ comput system observ state indic person live boston mr smith stai state comput system mr smith address york addit data reveal live york order determin situat instant feasibl process state model situat tempor find system mr smith live instant piec inform integr conceptu model section present conceptu model gener figur illustr overlap valid time tempor consist inform requir reliabl view histor data point time independ propag delai knowledg state determin instant consid inform integr instant order relat instant impli move forward time knowledg state grow gener analysi time interv instant interest ii interest start ii end juli st ks ii orthogon time dimens independ analysi capabl gener store state determin instant valid time interv xs xe data model enabl tempor consist set condit list tabl satisfi combin store dataset subject tabl conceptu model tempor consist knowledg state interest retriev state ks ii ii ii ks ii ii ii ii ii ks ii mean case valid time overlap past futur state state event boston ny valid time state valid time state revel time event revel time tabl describ time correct state retriev analyt process retriev state view output function appli ks ii read exampl describ contribut conceptu model convent tempor model restrict valid time point time analysi base ks ks figur state valid till entri tabl system move forward time appli knowledg state ks reveal state valid till entri tabl precondit overlap valid time combin ii ks analyt process retriev system ks model full number involv overlap state independ condit overlap state consid type overlap occur model tempor consist identifi propag delai tempor order issu environ repres valid time properti relat state instant describ time interv valid inform instant revel time revel time describ point piec inform realiz sourc system concept tightli relat notion transact time tempor context call properti clarifi transact result record sourc system analyt process reveal interest relat fact load timestamp load timestamp time integr dataset presenc load timestamp repres point time automat make action refer activ environ conceptu model mention type time inform valid time relat instant interest analyt process typic knowledg state relat revel time accur pictur entiti interest relat load observ control activ mechan context activ logic design tempor data import central aspect choic timestamp fact time interv abbrevi set time point practic reason order model past futur instant symbol instant analyt tradit effect support commonli time dimens load timestamp revel valid time fact integr separ logic time dimens model time interv singl timestamp discuss issu section depend appli environ approach suit decid time physic realiz bitempor model combin featur repres realiti accur updat logic model design mix tempor aspect strategi fact tempor consist aggreg handl integr fact inform previou data load affect aggreg aggreg delet store time consist adjust valid time recomput timestamp data data stage tradit establish deliveri order manag tempor consist requir tempor account store fact aggreg integr data enhanc knowledg state subject updat exist data structur end date revel involv dataset modifi valid time overlap import note valid time state provid data stage tempor sourc chang end date revel time chang bitempor model tabl tempor order overlap valid time locat valid time revel time load timestamp boston chang locat valid time revel time load timestamp boston ny chang tabl show physic dataset situat exemplifi figur kind tempor integr method slow data stage case overlap valid time type bold face tabl simplifi analyt process dramat evalu base relat model emerg candid data model model adequ address issu relat histori data tempor core issu data wareh order model histori organ accur cope propag delai strateg chang aggreg monthli sale inform sale total incorrect tradit ignor revel time record invalid cash flow statist model enabl explicit hierarchi time dimens aid user navig multipl hierarchi time dimens base load dai roll week month knowledg model handl chang data time systemat ad valid period overlap valid time subject enhanc type slowli chang dimens type usabl approach evalu applic industri project domain accid insur found introduct knowledg state viewpoint enhanc analyt process focu approach manag tempor consist enabl knowledg worker establish control activ behavior environ manag tempor consist store fact time correct view model real world ensur piec inform captur organ oper sourc system integr time correct manner entir import futur research direct field mainten dynam inform system schema dynam advantag provid tempor consist support data includ data effici captur organ analyz sequenc histori present approach enabl time consist view analysi valid detail data typic restrict time captur delai record ignor tempor issu lead impoverish express power question queri semant scenario refer al systemat chang manag data wareh technic report januari mh al versu tempor data model proc ieee comput societi pp rm tjoa manag time consist activ data environ proc intl conf germani lp english improv data busi inform qualiti john wilei tempor research lnc wh inmon build data john wilei cs jensen ce consensu glossari tempor concept pp cs jensen rt snodgrass tempor data manag ieee transact knowledg data vol pp kimbal data toolkit jon wilei kimbal backward time intellig vol septemb tb pedersen cs jensen data model complex data proc ieee comput pp jf roddick accommod delai tempor activ proc confer ieee comput pp ea rundenstein al maintain data chang inform sourc commun vol pp make data activ proc intl conf lnc pp cs rt snodgrass effect timestamp vldb vol issu pp data model morgan kaufmann san zaniolo al advanc system morgan kaufmann san
HCI/940 4 layout rule graphic web document jan borcher oliv arnold kn abstract number individu compet attent web grow exponenti make design visual appeal document import inform kei success inform provid present layout guidelin textual static web document drawn field gestalt hypertext interact web document classifi basic layout rule appli show evolv standard text java vrml support appli rule introduct technolog year author develop media make technolog advantag suddenli print quantum leap technolog point design similar process identifi connect basic technolog earli servic electron bulletin ftp develop media twenti year worldwid web medium support hypertext function internet graphic network technolog make environ wide usag world wide miss import defin attribut type case interact behaviour speak comput medium defin type inform user type present level attract decid document succe fail convei media philosoph marshal declar medium case web mean graphic easili navig document attract reader earli dai user field comput gener accept interfac long suppli inform major web user comput commerci servic begin creat web site outstand qualiti attract enorm amount visitor dai develop made web document uncommon make creation success web site reward busi competit situat web inform provid intensifi peopl page select hyperlink point surf web page interest left user back find put recent articl inform design give guidelin design textual graphic web document capabl attract reader reinvent show field scienc offer rich resourc address layout problem adapt rule appli document sort media order differ tradit start simpl anim interact lead virtual realiti present form content intent document strong influenc graphic design classifi onlin document number depend appli layout rule overview rest paper organ ffl section give introduct field cognit psycholog gestalt theori explain human percept process visual knowledg creat layout environ easier oper rememb ffl section overview design rule convent print document classic printer ffl section present layout rule web classif web page basic type show intent page influenc optim layout part closer standard evolv recent creation type static graphic dynam virtual realiti ffl section overview layout featur html latest version support design simplifi creat visual appeal page text simpl graphic ffl section lead static dynam document present java languag environ connect enhanc web browser support integr execut java program web page arbitrari program execut browser side java page bring anim local interact web page ffl section final step discuss problem inher layout rule extend cover case promin examin virtual realiti model languag descript languag object world design transmiss mind standard languag virtual realiti creat web framework standard briefli creation web document highqual layout examin paper conclud summari current state layout rule web outlook addit support requir creat aesthet document world quickli chang standard fundament user interfac gestalt psycholog design good user web basic question perceiv object real principl percept combin object question treat scientif field call found applic essenc research summar hundr pattern consid belong figur round object perceiv object close belong previou previou figur shape button simpl user associ special inform good shape express function button shape user forget mean present law import design document user interfac law deal static law treat dynam case law interest design vrml java applic ffl law succinct call law good state percept object perfect simpl shape make easier rememb polygon edg perceiv circl short period transform essenti lossi compress algorithm associ exist notion circl storag capac rememb complex shape figur practic applic law interfac object button simpl shape figur present altern shape button shape user associ inform shape rememb shape user forget mean function ffl law proxim effect figur object closer form group rule import screen show easi piec inform belong ffl law uniti object form close shape perceiv group effect overrul law proxim figur figur box frame frequent graphic user combin row button complex user interfac compon make law figur ffl law equal similar object candid group percept system reason push button arrang row size rule frequent violat exist document interfac ffl law continu tendenc percept assum continu figur consist doubl intersect straight line figur text indent form group consid belong perceiv continu level indent ffl law experi match object perceiv figur object form close shape belong similar object belong thing user interfac reli metaphor minim memori load peopl map figur letter experi expect posit frequent told view made experi interpret subsequ encount object correctli figur show applic law left button perceiv real button experi interpret shadow belong object stand draw plane button consid object draw due natur experi light result subtl hint shadow understand scene effect obviou virtual realiti environ section ffl law common motion move front static tend group case suffici correl veloc vector gestalt psycholog depth scope clear law fundament peopl understand includ user interfac document inform process document interfac defin imag user memori chang anymor interfac obei gestalt percept system misinterpret appli rule section show gestalt law appli convent design good web document layout rule convent document find design guidelin web start rule tradit offer briefli present basic schedul typograph creat print give exampl rule identifi step adapt cater possibl electron counterpart chang print document system divid identifi special characterist interact hypertext document classifi web give separ design rule type basic design schedul convent document layout step page width height document page determin wide format rang seri slim format page area page margin classic ratio margin page width layout page arrang inform insid page layout framework defin column directli influenc line length rang charact line figur exampl law unstructur box lead uncertainti semant rearrang line clearer layout frame group object lead obviou semant figur intersect doubl case ambigu object perceiv form simplest shape map object thing figur indent lead text sequenc badli structur hard indent text form group perceiv belong human ey move text chunk shorter line reader grasp text line slow read speed justif avoid short format readabl case extrem long requir read cycl tire make harder reader locat begin impair read speed vertic document layout rigid grid vertic line space bodi text grid bottom line head lie grid font font size bodi determin consist document classic valu bold chapter bold section bold subsect bold paragraph bodi annot footnot repeat typograph rule book teach design reader break maximum font famili compat line capit click click click click figur button shadow button shadow draw experi suggest light ter element bold small combin word choic font class strong influenc small print color font prefer reason lie simpl shape equal width charact contour font peopl claim proport font read bodi text print media font size creat page dark light area finish actual text enter document correct content point view aesthet document final stage minor made margin properli justifi adjust mathemat line end colon extend slightli rest margin layout rule web document web document electron access document hypertext characterist consist text graphic interact sum cross refer structur complex linear structur book figur paper deal emerg techniqu anim sound video layout compon web document written anim effect implement java applet code tempor major problem html layout point view defin logic layout exact mean displai attribut featur physic descript hint text displai browser boldfac ital print web document type attribut web document crucial layout design attribut relat question document dynam short definit page displai inform form hyperlink interact limit link activ page interact gui user compon form button make complex user input process place server result static page client dynam page final chang time displai modifi content layout type necessarili exclud design point dynam page passiv part establish consist entir document peopl creat web document motiv drive peopl compani creat web page enabl classif layout detect reason web document present make contact appeal reason creat web document peopl institut present inform document consist passiv page object inform limit subject provid inform servic inform servic page upto passiv primari goal provid inform limit subject field railwai traffic inform servic user find train connect chosen destin user visit servic motiv inform give succe find quickli page laid constant part stringent user visitor stai system longer document design minim averag session durat text element domin page provid inform request onlin document exist close environ print bound ag inform document offer transact retriev transact retriev system design complet system similar inform addit emphasi inform flow user servic exampl hotel reserv user enter data book inform pass hotel comput user interfac complex virtual input devic user motiv compar inform success expect higher custom clear task mind hotel hope complet system design minim session time product servic document rare requir subject page instal compani institut present product public attract innov miss initi motiv potenti user visual attract entri document longer user stai higher success ey provid make subsequ page present visual chang layout content user motiv explor user guidanc stringent design maxim averag session durat graphic element domin text prefer nice drawn start button click highlight word entertain fun web document entertain expect dynam gener term attract layout follow rule system encount area video game initi motiv system creat session durat maxim reason interfac visual appeal simpl lead design conflict document belong class document suppli inform servic goal provid primari task individu page appli layout rule web document modif appli convent layout step web page screen landscap portrait suitabl displai inform page browser suggest portrait window displai page page close tradit media size landscap choic leav side part screen window layout altern standard screen layout result text line long readabl extra space extra window applic web browser partli overlap page appeal sight danger peopl lost easili fight window window overlap restrict limit level hint partli hand hard influenc design paramet page hypertext access wai ordinari document consist page pattern inform head show document user locat essenti avoid syndrom consist understand arrang author creation modif date mean leav page hyperlink home sight long page requir pattern visibl simpl back requir result fitt law correl point time directli size distanc target object browser design recogn introduc frame separ window displai constant banner inform link remain access time move document netscap font electron document color easier print media color strike text color appli conserv replac font rememb percent male europ north america form color blind color pair opposit lead focu problem color displai lower resolut applic grei level layout speak fact actual color capabl browser unpredict peopl read slower screen paper differ devic tradit print offer comput screen offer font small font size li import differ convent document hypertext split small chunk displai organ structur mean convent document restructur complet author provid link point section linear document author ignor fact inform chang electron media wide oral cultur print cultur print cultur electron linear read longer media design quick easi access support search techniqu figur show hyperlink document problem fast direct access section text page requir link link cross author final end overlap make interact simpl hard user imagin structur avail document influenc english local languag aesthet significantli lower resolut todai comput screen comparison print media mean fine correct earlier document view screen problem leav paramet unknown browser view web document written graphic sound browser equip program reveal layout chosen carefulli addit activ web document read interact mean rule area interact design graphic user interfac mind treatment user interfac html design standard web document hypertext markup initi design facilit cooper work technic document standard document descript languag web html base standard graphic markup languag design logic document markup languag mention transform structur layout task browser exact posit pictur page html browser arbitrari posit pictur imposs gener html version major ffl tabl part ffl color arbitrari element ffl page background imag ffl page layout defin html develop intermediari definit specif html stage offer text glossari index tabl content figur simpl structur web document ffl tabl page layout ffl background ffl inlin imag arbitrarili shape sensit ffl concret layout specif cascad style sheet special layout implement html custom style sheet html remain larg logic markup style sheet part languag special instruct obei specif html complet featur improv java design interact document java origin design sun microsystem develop consum electron program languag similar make interest runtim java compil translat java sourc code intermedi code virtual machin common architectur platform suffici fast interpret intermedi code format exist independ architectur platform make offer uniform softwar function web interest featur concept interpret determin code modul requir modul load miss code modul download web interpret initi code modul output sound graphic requir modul download network runtim anymor web browser interpret java program java html document object integr web document directli interact continu chang network commun applet download start author integr object show anim view data view interact feedback download applet execut local client side applet interact resourc inform provid integr stock market diagram show current servic page web browser handl java sun microsystem java applic modifi tend adapt html version simpli download function commun protocol netscap netscap commun java distribut regular binari format netscap interpret java applet html document avail java function wide browser netscap relev java program author languag specif java finish number web document integr java applet wide web moment languag stabl detail sampl sun java web page place start layout dynam page creat document java make work restrict html dynam page creat addit challeng clear appeal account rule appli tempor document consist framework part chang constantli syndrom back previou entri document run applet provid access execut interrupt control bring user back state start applet complex design rule deriv field movi creation dynam page limit anim restrict area mean layout larg determin static make rule applic vrml abund amount inform exist web dynam complet applic inform server question environ present content classifi earlier paper number applic present graphic attract applic classifi data research social branch industri handl larg amount statist data visual abstract model translat visibl structur peopl regular trend object research area deal structur visual directli molecular inform data semant attach inform structur inform present natur graph organiz pyramid peopl work softwar hierarchi engin market left project displai front realiti visual everydai object environ world natur environ social interact network system chat conceptu problem interfac promin problem document call input support nice technolog navig accomplish ffl special devic input problem devic gener unsuit orient ffl metaphor interpret input standard devic navig command applic space disadvantag approach navig intuit miss input dimens gener main task world defin wai user move choic basic virtual world model real make constrain movement user freedom real walk open fly air walk wall system simul real make advantag addit freedom distinguish virtual realiti physic absenc pass possibl user liber navig model view user object document challeng creat environ view aesthet exist world imag world problem made fact scene map output devic limit contrast tradit web object view angl larg render readabl user problem world social reject offer improv reason virtual realiti environ creat high expect realism meet todai technolog reason vr environ classifi realism realism behaviour research show realist behaviour import realist perceiv social textual mud complex interact model perceiv world simpl mean interact exist system standard spite number environ standard pure scene descript world chat world proprietari commerci project social navig world inform visual system present inform structur sophist set layout underli project aim develop user interfac paradigm desktop make emerg technolog possibl simplifi understand larg amount inform vrml open standard descript object world develop incorpor exist web vrml specif basic definit ascii file format descript scene larg deriv ident open inventor file format defin silicon graphic descript scene open inventor system scene defin scene hierarchi node repres object attribut camera hierarchi shape node includ usual basic set object line interest featur node chang object close possibl includ link vrml scene extern web document graph vrml support interact behaviour featur schedul vrml address extens world vrml approach definit standard environ focu technolog rest section layout rule world previou design electron text document deriv heurist exact rule histor tradit expert stress text common print text textual limit possibl electron document account modifi tradit design simul world histor background borrow architectur scientif disciplin serv nice supplier guidelin design realiti architectur knowledg pass form good guidelin tend contemporari vari enorm school promot contrast guidelin extrem tediou creat object simul high detail characterist creat hand complex softwar idea simul object electron commun saddl roof creat genuin innov space advantag newli gain object make virtual world high level detail creat copi creat complex put textur marbl algorithm creat aesthet attract textur automat base mathemat system constraint precomput mind environ spatial distanc inform sourc disappear hypertext link standard web document design make point virtual world unnecessari delai user experi interest meet make journei reward environ aim present structur number rule applic deriv case fitt law earlier basic extend result gather gestalt law easili transfer law appli equal arrang object carri actual view layout perspect distort disturb percept perfect layout world creat environ enabl visitor move order reach point interest standard web document case rule design convent page appli document situat bring addit challeng creat seamless transit framework content achiev displai document insid frame read devic part environ similar techniqu encount video game navig engin environ viewer support mode viewer support navig flip object scene move viewer remain walk motion head fly set control fly automat move user select point interest head make mode access overlai scene displai control button sampl list show scene design scene standard vrml multipl client reli type navig type movement free situat web document design predict sort browser page displai model account user potenti move arbitrarili scene author tool support larg clear observ design world complex task creat web document summari paper shown layout question import issu design web document guidelin good layout drawn convent gestalt area clear area complex justifi consult expert respect field design optim layout requir classif document creat intent document creat number static dynam present techniqu media requir adapt rule hypertext navig html suitabl text graphic document requir anim java applet offer function web environ user interfac issu solv widespread standard vrml current offer interact design aesthet web document easili support tool case passiv page elabor present form support content provid task creat interest appeal document part idea present special emphasi kiosk publish refer virtual realiti model languag version specif novemb worldwid vol august kn layout issu kiosk sigchi vol octob br ur die germani stuart georg inform visual inform acm confer human factor comput inform pp charl sgml oxford oxford java languag environ white sun mountain zur berlin train wheel keynot intern web darmstadt von final thesi decemb heidelberg gestalt york extend fitt law stuart georg rapid control movement virtual proc acm siggraph york august pp inform design vol acm octob pp medium random simon schuster die de wien oral technolog london roger good switzerland vrml proc vrml san decemb hypertext markup languag version internet march comput oxford lectur design user vivid sourc evalu determin social mediat stanford decemb author jan borcher graduat comput scienc karlsruh work doctor thesi research group linz main interest lie design user interfac type electron book mobil devic virtual realiti research group institut comput scienc linz austria oliv graduat comput scienc karlsruh work doctor thesi institut oper dialog system interest simul model aspect comput graphic optim design graphic user interfac effici easi algorithm comput geometri institut oper dialog system karlsruh germani kn receiv master comput scienc karlsruh work ur und karlsruh project call design video interest data compress user interfac institut oper dialog system karlsruh germani arnold receiv phd karlsruh work senior assist recent publish book graphic window system area special interest tool platform user interfac medic mobil comput institut oper dialog system karlsruh germani
Agents/941 1 increment code migrat xml wolfgang anthoni finkelstein dept comput scienc colleg london london uk abstract demonstr xml relat technolog code mobil overcom restrict exist approach fix granular mobil enabl complet program individu line code network defin concept increment code mobil abil migrat replac code fragment remot program combin increment migrat achiev unavail flexibl examin applic increment code migrat varieti includ user interfac applic manag mobil thin manag distribut document keyword increment code xml technolog introduct popular java spread technolog contribut grow interest dynam reconfigur distribut system architectur reconfigur achiev code transfer fragment code host potenti mobil rang start simpl data inform transfer exampl actual paramet pass remot procedur call web page return request http protocol level code mobil migrat execut browser load applet class remot server common exampl code mobil java rmi java virtual author partial support dipartimento di scienz università di itali built web offer mobil granular class level telescript obliq java base mobil code languag system mobil agent code data move consid highest level mobil achiev logic context applic domain flexibl approach code mobil achiev java mobil agent gener flexibl requir result low network bandwidth scalabl bandwidth server gsm mobil phone cope download larg amount java byte code server scalabl requir applic thousand client sync updat code fragment paper show achiev mobil approach base java demonstr unit mobil agent class level individu statement support increment insert substitut possibl code fragment open applic area code mobil manag applic mobil thin wireless connect person digit assist user interfac construct document manag work build formal foundat code mobil establish paper develop theoret model mobil level singl statement variabl argu potenti code mobil capabl commonli languag code java share vision focu implement mobil standard wide technolog identifi mobil code design concept independ technolog embodi wai technolog extens markup languag exploit achiev code mobil level xml design code interest relat code migrat exploit tree structur xml document xml relat xpointer document object model modifi program dynam avail technolog simplifi construct languag interpret paper structur section discuss relat notabl altern approach logic code mobil section show xml support definit languag increment code mobil defin xml section argu increment code mobil potenti set applic area user interfac manag applic mobil thin consist manag distribut document give exampl applic approach domain section demonstr implement mobil code system support xml product section evalu approach identifi strength weak section summari work futur work overview xml logic mobil physic mobil concern physic movement mobil phone wearabl comput logic mobil abil transfer data code host network paper logic approach applic inform transit physic mobil section discuss work appli manag applic deploi pda logic mobil encompass data code mobil data mobil common mechan exchang spread inform host distribut network data mobil achiev pass paramet remot procedur object request put oper file transfer protocol introduct internet web hyper text markup languag predomin format data move host internet xml basi gener markup languag internet xml subset standard gener languag unlik html xml sgml user defin set tag structur document markup tag defin document type definit dtd grammar defin syntax document xml document declar refer dtd order enabl gener parser obtain specif grammar advent mat transfer data defin dtd standard encod specif notat xml exampl softwar engin applic xml includ dtd defin transfer format uml model xml public document applicationspecif transport protocol distribut system construct report xml transport data distribut heterogen compon trade system system xml document paramet corba object request omg request interfac definit languag xml address seamless interchang xml document complex valu idl data type data code mobil java support object serial class load statu object serial transfer host class load strategi depend applic netscap class loader download applet class web server html java rmi class loader applic download class object remot pass paramet run time class move object migrat host fetch remot server technolog built top simpl mechan sophist mobil code paradigm classifi remot evalu mobil agent remot evalu proactiv ship code remot host execut mobil agent autonom object carri state code proactiv move network system develop support mobil agent agent mobil requir migrat code state agent time move proactiv perform task behalf user increment code mobil xml xml flexibl approach describ data structur show xml describ code xml dtd similar attribut grammar element xml dtd correspond product grammar content element defin side product content declar element sequenc element altern give express power dtd bnf context free grammar markup pcdata includ dtd defin termin symbol element xml dtd attribut attribut time time cdata figur dtd instruct set store constant static semant symbol tabl static type xml dtd defin abstract syntax program languag refer document instanc dtd xml program xml program interpret section discuss interpret construct xml technolog xml program host effect achiev code mobil order demonstr simpl program languag instruct robot languag defin paper subset reason breviti languag set primit includ switch robot make proce step current chang robot current direct turn object turn program languag includ number control structur repetit condit execut time statement repeat system figur xml program final posit initi posit figur action robot cycl command number time figur show syntax subset program languag defin xml dtd figur show instanc dtd figur instanc xml program instruct turn proce turn left proce step rout shown figur imagin real instruct control host send xml program radio achiev logic code mobil xml unlik java compil xml program transfer sourc code interpret remot host unlik xml confin send unit xml document begin root start symbol grammar enabl individu statement refer code fragment xml program increment complet program arbitrarili increment xml control slow radio avoid program increment send program increment figur show finegrain program increment imagin chang behaviour replac statement increment chang behaviour make turn left languag primit turn time system figur xml code increment figur xpointer address increment determin root symbol increment time full xml program figur question insert replac program increment address locat html document achiev defin user control document includ author document sender increment control program assum programm identifi anchor label increment code insert replac solv standard xpointer part xlink specif overcom limit html support navig xml document navig capabl address document compon modifi document xpointer identifi compon exist xml program replac increment back figur show xpointer express determin program statement replac xpointer express start root program select statement type statement select statement fragment program xml xpointer express increment code mobil figur show behaviour differ increment replac statement implement turn turn left time final posit behavior initi posit figur increment chang behaviour applic section present idea simpl describ applic domain benefit increment code mobil xml includ user interfac manag applic portabl digit flexibl consist check distribut document engin instal administr system thousand client potenti applic increment code mobil departur control system airlin handl good exampl larg airlin client implement user interfac system deploi thousand distribut globe machin necessarili airlin temporarili rent airport tight control updat softwar airlin frequent updat softwar instal machin accommod deploi java virtual machin system download applic central server java disadvantag requir code substanti size download possibl slow network java code chang user interfac chang limit overcom instal user interfac engin client machin interpret user interfac descript dtd user interfac descript languag markup tag java swing user interfac compon interpret document gener desir user interfac appli approach code mobil descript user interfac central server distribut client host user interfac descript small compar size java byte code full user interfac avoid problem limit overcom user interfac descript xml gener server applic increment mobil appli successfulli context displai window ad replac xml code increment user interfac engin program increment dynam integr origin xml code make window chang applic manag mobil pda interest applic approach code mobil logic mobil meet physic mobil lightweight comput person digit assist start mission critic comput integr comput environ import pda run set applic pda york stock exchang nyse equip trader trade data entri autom transmiss trade data back offic trade settl system applic market evolv rapidli analyst invent product deriv regular basi product trade applic adjust updat support trade deriv machin wire workstat feasibl transfer replac complet code increment approach paper appli approach essenti devic thin client case increment code updat valuabl disconnect pda slow irda radio network connect advantag approach applic develop script languag develop trade applic build interpret languag deploi pda applic program increment ad list updat server pda connect pda physic enter trade room establish connect server check applic pda server increment send applic updat deploi pda definit languag implement interpret sound difficult accomplish support applicationspecif languag refer modal user interfac definit implement interpret simplifi avail xml parser java virtual machin develop palm pilot oper system run gener mobil phone consist manag distribut document describ approach manag consist distribut document assum document repres xml fair offic save document xml visual ag environ xml instanc collabor diagram class class diagram figur consist rule xml format scheme project repositori case tool export uml diagram consist manag approach base languag express consist rule languag xml program languag figur show consist rule express languag rule base dtd uml demand object collabor class class diagram equal type object discuss interpret execut consist rule order check consist xml document result check rule set xlink express link consist document fragment inconsist document fragment indic inconsist approach set rule rule interpret inflex member softwar develop team work set rule central interpret rule creat bottleneck avoid multipl rule interpret machin rule interpret set rule develop check consist document produc local dedic interpret subgroup develop team order check consist document produc xml xml doc doc xml doc consist rule xml format consist checker host xml xml doc doc xml doc consist rule xml format consist checker updat consist rule host manag host xml xml doc doc xml doc consist rule xml format consist checker host figur consist manag architectur ferent team member higher level rule set check consist number rule defin realist project subset rule relev subset determin type document develop modifi state project closer deadlin rule enforc initi stage set rule activ rule interpret static chang project order accommod set rule activ interpret chang interpret run set achiev broadcast share storag rule ad exist rule delet rule set individu interpret trigger consist supervisor compon increment code migrat pass consist rule rule interpret involv figur show architectur approach workstat group project server run interpret rule consist supervisor manag rule set consist rule activ interpret move rule increment shown xml defin program defin updat code increment fashion section describ util xml technolog order implement interpret applic specif languag interpret implement increment code updat implement approach program languag interpret languag implement show significantli xml import api import parser public void string parser program parser parser read input stream program root tree program document figur translat xml program ast notabl xml parser implement document object model simplifi construct interpret explain commun sender receiv achiev distribut object technolog focu implement increment code demonstr xpointer processor support locat increment dom support increment syntax tree modif interpret implement stage interpret program involv valid syntact correct result interpret produc attribut abstract syntax tree program program written task deleg valid xml parser valid xml parser exist figur show parser interpret invok code figur xml parser construct tree graphic repres figur time time figur abstract syntax tree program stage interpret static semant analysi uniqu identifi correct type express interpret execut code order avoid abstract syntax tree tree visit interpret check violat static semant execut oper node repres oper ast construct xml document standard document object model implement dom oper support obtain children queri type obtain valu node attribut figur show excerpt interpret abstract syntax tree execut statement ast node action modifi state variabl case state variabl robot switch current posit direct number item pick interpret perform method initi pass root node ast tree examin type node perform action root call execut child node node type add current direct note implement command requir line code total line java code code mobil order support code xml program remot host read local file system transfer protocol due simplic xml program pass paramet remot invoc object invok implement interpret xml program interpret understand xml program written dtd languag figur show migrat code remot host order facilit remot commun transmit mobil interpret declar remot shown figur interfac implement interpret enabl control resid host send program interpret host note transfer dtd code assum dtd store local choic deriv observ interpret implement tightli link dtd grammar languag interpret depend grammar languag execut increment code mobil shown interpret import dom api import xml parser class posit direct privat int privat int privat int privat boolean statu public void node figur ast interpret xml document interpret figur xml program migrat remot interpret pass paramet method figur paramet xpointer express xpointer express empti identifi node abstract syntax tree replac program increment import import dtd public interfac extend remot void string throw figur remot method invoc xpointer direct xml increment xml document interpret figur increment migrat robot site pass paramet execut figur show migrat increment code strategi implement increment code mobil program increment pass paramet construct syntax tree evalu xpointer express replac node address express root node syntax tree increment replac shown figur order implement strategi increment advantag dom program increment construct ast achiev full program parser creat tree root node type root type dtd case root increment node creat evalu xpointer express replac node fulli deleg xpointer processor processor figur show xpointer processor order locat node replac replac code increment shown bottom figur navig parent node replac standard dom oper substitut root node syntax tree increment evalu section discuss advantag current disadvantag approach hint disadvantag overcom code replac time time time dtd figur result increment code updat ast import dom api import ibm parser import xpointer public void string throw creat xpointer object updat locat pass xpointer interpret xpointer object node doc point throw node node parent node throw replac code figur evalu xpointer express demonstr xml relat technolog implement increment code mobil granular fix granular mobil enabl complet program individu line code network combin increment mobil achiev flexibl unavail examin applic increment code mobil user interfac applic manag pda manag distribut document success approach critic depend abil encod program languag xml dtd demonstr dtd suggest achiev scalabl envisag approach write xml version interpret javascript build compil translat javascript xml encod xml interpret wrap exist javascript interpret shown increment achiev replac exist fragment note overli restrict strategi shown appli add delet piec code origin program address insert point identifi fragment xpointer implement abstract syntax insert delet oper dom interfac shown figur method replac fragment code execut program simplif feasibl interfac extend oper perform ad higher level flexibl abil manipul code remot entiti primit implement oper provid dom xpointer xpointer enabl address node tree dom support increment remov modif node tree present paper describ combin data code step agent mobil achiev chang dtd languag add encod posit state attribut write xml program posit initi interpret modifi order obtain inform initi initi statu correctli rmi implement migrat xml program independ transport long xml encod move code advantag distribut object languag report context transport protocol distribut object technolog add overhead balanc middlewar servic secur choic evalu transport technolog extrem applic scope paper increment updat code robot termin execut applic conveni appli program program execut user interfac applic good feasibl approach problem relat mainten program counter updat oper cycl languag simpl feasibl increment updat code seri issu relat access control code updat parti actual statu program perspect applic orient singl sender full control code updat corba transmit corba secur servic enforc access summari work paper present increment approach code mobil xml languag novelti approach abil send code increment resend complet updat version code java base technolog launch idea object class set paradigm commun feasibl theoret languag analyz code mobil movement granular show java point class unit possibl explor paper shown embodi set potenti applic develop applic order benchmark evalu approach studi perform issu understand space speed overhead compar java byte code transmiss interest explor secur implic code migrat address secur servic implement interpret corba object access control interfac corba secur author princip perform code render special tag defin xml java specif code displai formal notat web develop work integr dtd java fragment order updat abil interpret understand construct interest provid support proactiv code mobil ad specif xml tag mobil code languag interpret movement extens introduc issu relat dynam modif code extend potenti approach paper intend explor approach real project involv industri partner domain mention section collabor industri partner develop flexibl user interfac manag busi analysi applic intend advantag applic investig mobil phone pda applic platform provid explor increment code mobil applic manag acknowledg indebt gp picco detail comment interest suggest earlier draft paper discuss topic acknowledg support european union project refer ibm modal ibm le wood document object model level specif recommend world wide web octob rumbaugh unifi model languag user guid addison extens markup languag recommend world wide web march cardelli languag distribut scope proc acm symp principl program languag cardelli gordon mobil ambient proc foundat softwar scienc comput structur european joint confer theori practic softwar volum springer coordin languag analyz system mobil compon acm tran softwar engin page manag complex document case studi xml ieee transact knowledg data consist manag distribut document xml relat technolog research note colleg dept comput submit public finkelstein markup meet middlewar proc int workshop futur trend distribut south africa ieee comput societi jj calculu mobil agent proc int conf concurr theori volum lnc gp vigna understand code mobil ieee tran softwar rs grai agent transport agent system proc cikm workshop intellig inform dec iso inform process text offic system gener markup languag sgml technic intern standard javasoft java remot method invoc jdk octob zimmerman java mobil agent ieee internet knuth semant languag mathemat system gener magic telescript languag refer gener oct maler xml link languag technic report world wide web march gp roman model code mobil proc european softwar eng conf volum page roman composit program abstract mobil comput ieee tran softwar object manag group xml meta data interchang omg model interchang format connecticut ma octob object manag group request connecticut ma august robot softwar xml contact softwar jw dk gifford remot evalu acm tran program languag oct suzuki yamamoto make uml model exchang internet approach muller proc int workshop uml lectur note comput scienc cf tschudin introduct messeng languag univ moor mobil agent commun
AI/942 2 foundat bayesian network jon williamson bayesian ed david cor eld jon williamson kluwer appli logic seri abstract bayesian network treat pure formal interpret argu current foundat put forward foundat involv aspect interpret formal approach rst section give introduct bayesian network critic type interpret section remaind paper suggest foundat bayesian network domain causal cn nite liter express form state conjunct liter bayesian network consist direct acycl dag node cn set probabl valu jd liter involv node state parent ng independ parent node probabilist independ set node descend jd jd bayesian network suce determin joint probabl distribut node cn probabl distribut cn repres bayesian network bayesian network import area probabl function expert system arti cial intellig diagnosi constitut typic depart king colleg london uk jd bayesian network independ assumpt call markov causal markov condit bayesian network object interpret formal properti bayesian network problem area expert present state symptom probabilist approach rang causal liter depend structur graph number speci er requir determin probabl distribut comput time requir calcul substanti lower bayesian network independ assumpt make assumpt bayesian network er kei pragmat advantag formal assumpt independ princip type philosoph foundat bayesian network treat bayesian network abstract machin learn techniqu learn past case data instanc symptom ad past bayesian network repres approxim target probabl distribut bayesian network interpret graph repres causal object subject case graph arrow direct subject case graph repres causal knowledg agent arrow direct speci ed probabl object term frequenc subject term ration belief bayesian final independ assumpt posit relat causal interpret interpret probabl view import potenti problem abstract approach initi data ground construct expert limit initi causal probabilist knowledg domain reliabl past case data invok machin learn algorithm case data slowli learn algorithm yield depend result applic requir oper expert system case abstract approach interpret approach face initi causal probabilist inform shape compon bayesian network bayesian network immedi form past case data requir hand interpret approach larg statu independ assumpt section outlin problem develop hybrid methodolog incorpor aspect interpret abstract account tackl problem object interpret investig subject approach probabilist approach diagnosi note learn algorithm interpret point view depend foundat object network object bayesian network independ assumpt make substant claim relationship causal probabl show claim highli render object interpret inadequ note principl common logic consequ independ assumpt principl common claim variabl correl probabilist independ common exploit link independ common principl counterexampl contradict demonstr limit object interpret ect translat doubt probabilist causal philosoph literatur appeal principl common doubt object interpret bayesian network counterexampl consid thought unusu thought suscept provid taxonomi counterexampl order show problem widespread consid gener argu independ assumpt document type counterexampl principl common causal variabl constraint ensur probabilist correl suitabl common account contradict exist condit common account contradict screen condit principl due section page assum basi statist exist common resembl mill canon induct phenomenon vari manner phenomenon vari ect connect fact causat page larg literatur touch independ assumpt critic defenc al section independ assumpt cover cover critic viabl reaction critic note page believ principl common hold unusu posit independ empir counterexampl attack priori posit strongli standard posteriori view correl tree tend sold orang sold repres number tree sold dai repres number orang sold dai random suitabl constant order independ assumpt hold common found explain directli causal relat common time year season intuit endow time year causal obviou mechan plai underli causat intuit common causal explan correl intuit independ assumpt fail causal scenario order save independ assumpt tempt maintain time year common call strategi causal extens idea extend intuit concept count intuit time causal context bayesian causal extens form assumpt common variabl found correl number diculti strategi causal extens extend concept creat epistem problem identifi causal variabl causal relationship hard problem extens concept make task harder dicult expert provid qualit causal knowledg form bayesian network dag causal extens expert identifi variabl render independ assumpt identifi ect deal number node arrow consid graph bayesian network risk network complex practic amount space requir store bayesian network amount time requir calcul probabl network exponenti number node worst case worst case occur graph arrow graph causal extens danger tactic epistem practic point view major problem extend concept lose qualiti import causal genuin causal variabl tend characterist view ect tend relat physic mechan variabl qualiti longer explic notion extens ad hoc word lose synonym process pursu ind nite undesir requir genuin causal interpret graph al bayesian abstract foundat sober produc counterexampl principl common fact sea level venic cost britain rise past centuri monoton imagin put data form chronolog list sea level price british quantiti steadili true higher averag sea level tend higher averag price quantiti strongli posit correl feel driven explain correl postul common regard sea level british price isol endogen reason local condit venic sea level di erent local condit britain driven cost postul common simpli rest sober call exist common question causal explan explan involv common correl postul common con ict intuit common causal mechan appeal issu mechan determin correl causal point reject correl sun spot econom cycl relat accept correl sun spot terrestri magnet storm plausibl physic relationship causal separ line make restrict correl restrict causal restrict claim british price water level type correl principl common appli correl predict determin physic process attempt avoid counterexampl common principl restrict principl note pursu strategi context defenc probabilist causal move success thought term bayesian network restrict principl common restrict call type defenc independ assumpt reduct probabl function bayesian network independ correl restrict viabl move bayesian network varieti causal strategi argu variabl sort independ assumpt appli claim correl variabl causal exampl altern accept individu correctli independ assumpt appli variabl index complet descript properti repeatedli instanti counterexampl independ individu variabl depend clear rule individu overcom counterexampl exampl exhibit tempor correl easi variabl event exhibit case altern individu independ assumpt rule correl restrict priori plausibl appli individu appeal individu mean overcom problem correl causal restrict induc epistem problem individu matter amount analysi tackl make applic bayesian network harder problem interest variabl individu independ case machineri bayesian network appli subsect illustr problem correl introduc strategi defend independ includ causal extens british societi philosophi scienc meet june sober produc convinc claim failur principl common appeal distinct homolog biologi share featur di erent speci account common ancestor evolv independ case shown occur speci subject similar select constraint common featur sati es constraint optim speci featur competit environ case correl causal explain predict time seri select constraint explain argu section constraint common sober claim principl common follow bayesian network independ assumpt obviou bayesian network graph common probabilist independ liter joint probabl rst equal decomposit probabl bayesian network theorem al page causal restrict strategi ectiv deal made work epistem intuit cost subsect strategi appli common type counterexampl cost accept foundat stick intuit notion individu variabl matter constraint counterexampl probabilist depend explan relat depend variabl depend explan causal number causal variabl correl virtu logic mathemat relat physic constrain local law boundari condit situat turn mean express constrain probabl infect probabilist common infect variabl overlap mean advoc causal restrict remov node bayesian network relat mean move number reason lose valuabl inform bayesian network delet origin node import applic network mean relat vagu classi cation symptom patient report thermomet relat node case includ synonym bayesian network natur languag causal reason remov node invalid independ assumpt remov node common node simpli node relat discoveri black death coincid genuin scienti sort thing desk build expert system causal suggest common variabl call overlap introduc gener screen epistem cost term identifi depend virtu mean ad complex incorpor variabl commit counterintuit concept probabilist correl explain logic relat logic sentenc necessarili perfectli sentenc logic impli sentenc probabl greater equal bayesian network involv logic complex variabl complaint clinic test determin patient patient patient direct determin liter tempt spirit causal incorpor causal probabl speci cation bayesian network determin object screen node node independ assumpt sati ed problem ect situat causal genuin logic causal patient genet characterist patient genet characterist causal mechan conjunct causal graph node node restrict expect node screen common turn mathemat relat probabilist correl applic bayesian network theori colon document al gilli object guid insid colon avoid presenc larg dark region screen small dark region size region directli dark measur intens level intens varianc region bayesian network construct incorpor variabl independ test found varianc variabl found correl causal graph independ problem obviou common varianc mathemat causal varianc random variabl signi es expect simplest bernoulli random variabl make varianc perfectli correl light intens complic standard probabl constrain make varianc probabilist depend resolv failur independ rst correl node remov gave improv perform su er signi loss inform gilli attempt introduc extra common screen move improv success rate bayesian fundament problem firstli clear node repres call causal interpret longer graph distribut probabl relat node node nding probabl introduct node unwant correl fulli screen test empir equat object probabl distribut bayesian network lost object causal object probabilist compon interpret object interpret depend constraint includ physic law exempli ed particl decai conserv total momentum determin prior state particl momentum part decai momentum part determin momentum part prior state particl determin part decai prior principl common fail obviou call common exist compon principl fail common found quantum independ fail screen condit fail particl red spin spin liter repres occurr common found explain spin screen sati ed wildli inappropri assumpt quantum world conclud quantum constraint object probabl page page note eld bell theorem conclud violat bell inequ teach pair event screen common past exampl argu di erent front assum determin page survei philosoph literatur exampl local constraint initi condit account depend causal variabl independ assumpt make typic case occur oper subject oper produc ect independ oper produc individu spend divid veget amount spend pure probabilist consequ state enter amount spent veget ect produc independ oper produc expenditur dollar oper produc expenditur dollar veget constraint di erent correl counterexampl screen condit pool ball set black pocket white beginn plai pot black attempt shot pot white liter repres occurr screen ect entitl infer event prior screen event compound event consist state motion shortli collid resort arti cial compound event suggest weak causal relat embodi salient featur situat adequ theori probabilist causal handl situat term relat appeal ad hoc construct add view adequ interpret bayesian network appeal ad hoc construct al give defenc counterexampl argu speci calli individu momentum cue ball satisfactori absenc gener theori individu repeatedli pull blue red bag pull red prevent pull blue correl pp pp hj figur failur circuitri compon explain repeat pull bag trial constrain probabl isnt sort thing count problem admit defeat problem diagnosi apparatu investig quantum mechan troubleshoot pool maintain applic intellig reason una ect constraint occur includ central diagnosi problem circuit constrain fact compon fail simultan fail circuit break fail common failur figur fail screen jc medicin opposit failur compon human bodi chanc failur resourc weaken case constraint gener sort thing call pursu causal includ constraint bayesian problem loss causal diculti knowledg constraint super intellig agent agent perform ect probabl directli concern fact physic law requir agent languag causal graph bayesian network constraint thing leav harder discov relev constraint causal relat domain discov physic law correl consequ domain feat harder domain expert provid inform causal inform gener constraint identi dicult connect variabl causal graph arrow pool tabl constraint gener symmetr causal relat constraint vari case causal law dont pool tabl includ causal graph interest predict pot al page figur tree spend orang sale causal graph vari radic shot shot complic task note correl combin complic matter variabl correl common complet screen correl common account part surplu call ineci english partli explain water level rise venic global partli price rise remain bulk correl complet direct ect fulli screen rst put forward causal high tree sale peopl festiv peopl spend orang sale rise figur explain correl explain peopl spend monei occas year bigger hope shown type depend invok contest valid independ assumpt strategi present defenc causal restrict causal extens strategi subject practic intuit render object interpret bayesian network worst imposs undesir subject network problem object interpret compon bayesian network reason object interpret simpli causal variabl causal relat relev domain interest practic knowledg limit estim object probabl test posit causal knowledg easi identifi complet causal pictur pertain eld wit fact causal discoveri remain larg compon scienti research make bayesian network agent perspect bayesian network express knowledg graph interpret xs epistem probabl speci cation interpret belief liter condit parent state independ assumpt link agent pictur causal belief function hold belief function reduc bayesian network independ assumpt hold reason xs knowledg causal belief wildli di er object bayesian theori hold belief long belief function formal probabl function independ assumpt strong xe xs belief function bayesian restrict xs subject xs causal knowledg belief probabl speci cation chang slightli belief chang leav room subject regard belief strong constraint independ appeal base freedom causal knowledg belief subject interpret bayesian network line reason independ hold subject network similar object subject distribut close object probabl put practic requir expert system diagnosi liver fair idea causal pictur relat obtain estim object probabl probabl speci form bayesian network close object version independ assumpt hold object version expect hold approxim subject case independ approxim held subject case probabl distribut determin subject network approxim object close practic liver diagnosi posit argu section aw reason reason doubt independ assumpt made object causal probabl independ hold small di erenc subject network object network lead signi di erenc probabl distribut determin network claim argu argument subject object distribut network worth spell notat concept advanc object probabl distribut object bayesian network consist causal graph probabl speci cation independ assum hold object causal respect object probabl repercuss object network determin agent subject bayesian network consist causal graph probabl speci cation subject network determin probabl function independ assumpt question independ hold subject match xs full belief function concern concern altern justi cation subject interpret claim subject network close resembl object network function close object probabl practic argu distinguish type di erenc subject object di erenc causal graph di erenc probabl speci cation causal subject argu make assumpt independ hold assum xs belief speci cation consist object assum causal knowledg correct subgraph causal knowledg incomplet strict close practic basic type incomplet variabl fewer node causal relat variabl fewer arrow deal rst minu node arrow connect rest graph sati es independ respect satisfi independ direct direct cs direct pair direct ect arrow direct direct needless state air failur independ practic repercuss ran simul close distribut object distribut result form figur bar background graph show perform bayesian network form remov singl node incid arrow network satisfi independ comput randomli gener bayesian network net remov random chose random state node calcul liter network deem success valu di er valu determin origin network percentag success calcul number trial bar chart repres percentag bar foreground graph repres percentag success half node incid arrow remov experi practic small valu read small data result suggest trend success rate size network plausibl remov node incid arrow larg bayesian network sati es result network probabl valu determin sucient close object al pg trial case converg slow fact nearest integ equal half node chosen figur node remov figur object causal graph probabl remov node bayesian net reduc probabl graph show trend remov node larg causal graph chang smaller portion remov node small expect remov node result distribut origin number node bear mind independ assumpt remov node impli independ node graph remov node small graph chang fewer impli independ remov node larg graph complain simul unrealist drawn doesnt intermediari object causal causal chain exist figur repres object causal graph doesnt figur figur case remov bs incid arrow introduc independ assumpt impli figur incid arrow remov figur remov incid arrow redirect figur node remov arrow origin redirect simul found redirect remov arrow improv success figur qualit lesson gener trend success number node simul unrealist type unknown remov node random simul extent ect observ node part causal chain earlier part remov leaf graph introduc independ remov common epistem causal graph satisfi independ node remov random factor render simul base network chosen random made node arrow arrow direct maintain acycl graph highli highli chose probabl uniformli machin real roughli half node node chosen symptom node valu select uniformli face lack knowledg structur object causal graph suggest explic random trend simul sensit network chosen random sum larg object causal graph remov arbitrari node chang independ impli chang result distribut determin bayesian network arguabl true object situat sati es independ independ remov arbitrari node make hold agent ignor causal turn case ignor causal relat form delet node node satisfi independ respect direct independ respect requir independ condit impli independ respect situat condit call depend principl correspond intuit probabl make ect direct probabilist depend condit liter state jc long probabl sati es depend respect arrow remov give probabl independ de nite fail respect simpli independ respect requir independ condit contradict assumpt depend hold respect note result depend local situat involv direct graph rectifi situat note result requir object causal satisfi independ respect object probabl depend principl hold causal world extrem independ hold epistem causal theori argu independ appeal altern principl sceptic reader convinc argument perform simul gener trend back row figur repres result simul depend principl defenc principl note depend principl partial independ assumpt direct arrow absent independ occurr extra chang break independ relat graph figur arrow remov assum random arrow node remov case clear downward success rate uniformli low arrow small result network satisfi front row figur downward trend number node causal subject lead signi di erenc subject object probabl distribut probabilist subject turn xs hard di er object situat sati es xs causal graph match object causal graph speci cation di er object speci cation probabl function determin subject network expect back row figur show node probabl speci er perturb middl row show half node probabl perturb front row case node probabl perturb practic probabilist graphic subject occur make close practic back row figur show node remov arrow node probabl perturb front row show half node half remain arrow half remain node perturb figur node probabl perturb figur node arrow node probabl perturb subject bayesian network signi cantli practic distribut determin subject network di er object distribut practic subject bayesian network rare accept independ fail link object causal problem due subject abandon bayesian network origin conceiv move graphic model extens bayesian network model includ chain cyclic partial orient graph summari graph altern strong assumpt made preclud diculti due subject assum causal subject match cite causal assumpt central causal common measur variabl measur common assumpt hidden node insert account common assumpt inadequ foundat point investig process causal discoveri bayesian network overcom problem causal subject suggest agent causal knowledg assum approxim complet principl common weaken sucient strong correl explan approxim screen weak version principl common hold realiti problem hold epistem fewer common includ agent graph belief function ect object probabl close strategi su er problem earlier counterexampl correl arbitrarili weaken principl common hold realiti xs bayesian network constrain object inform contradict al dechter al pearl al make faith independ popul causal explan di erent requir depend causal simpl independ relationship repres singl independ web dag repres independ condit independ condit wasserman critic faith al weaker principl independ object sati ed agent xs causal graph approxim complet includ explan major correl roughli screen probabl function determin bayesian network close object probabl practic remaind section make object explic intuit notion approxim complet assum weaken version variabl approxim probabilist independ set variabl includ ect direct condit chosen approxim call assumpt approxim real jd jd probabl de ned note type assumpt assum expect independ hold equal real number measur physic quantiti weaken assumpt problem incomplet plausibl agent common account smallest approxim independ sati ed incorpor graph approxim independ sati xs belief function match object probabl function jp jd jd jp jd jd jd jd strategi face import problem approxim independ hold xs bayesian network larger bayesian network reliabl smaller sucient larg make approxim independ sati probabl found network di er wildli object small network small make plausibl approxim independ hold direct method determin distribut bayesian jd state direct consist small toler jd jd jd assum order occur chain jc jc jc approxim jc jd state direct consist jd jd jd jd fi jd jd error jd jd case bound con dent xs knowledg sati es approxim low prepar graph ten node fteen node maximum error reach error accept error maximum graph ten fty unrealist practic propag techniqu determin probabl concern averag phenomenon occur figur small perturb probabl cation xs network lead signi discrep probabl valu found propag correct valu round problem subject resort approxim independ bayesian network problem face interpret bayesian network independ assumpt fail object interpret correl explan independ expect hold subject interpret agent bayesian network gener give rise probabl function di er true belief function importantli di er object upset altern justi cation subject network argu view bayesian rest foundat view put forward initi adopt subject graph bayesian network agent causal structur probabl speci er ration belief acknowledg fact distribut speci ed agent bayesian network close object distribut practic argu good start ned approxim realiti methodolog stage product initi bayesian network stage nement term stage yield epistem stage borrow techniqu abstract approach order deliv network distribut close approxim object distribut process nement causal interpret drop kei question requir attent convinc foundat bayesian network stage justi argu subject demonstr subject interpret bayesian network good start point rest section section stage discuss nement bayesian network section bayesian network practic subject causal agent rare causal relat hold node interest common variabl subject requir belief function perfectli reason probabl speci er bayesian network good estim object probabl xs belief thought object determin speci ed valu causal knowledg causal graph probabl speci cation view agent background independ assumpt complet belief determin joint probabl function background knowledg independ longer substant assumpt link agent causal graph ration belief logic deriv undetermin belief xs probabl speci cation central issu justifi independ assumpt mean complet issu complet receiv plenti attent literatur approach rang laplac principl indi erenc jayn maximum entropi principl indi erent altern true explic probabl function cn fulli speci ed valu paramet cn kn constraint addit constraint impli background knowledg maximum entropi principl absenc inform select complet subject constraint entropi log convinc justi cation maximum entropi principl involv shannon interpret entropi measur case entropi subject background knowledg determin probabl function inform close background knowledg justi cation base boltzmann work entropi involv pari demonstr maximum entropi solut complet satisfi intuit compel languag invari detail justi cation justi maximum entropi optim distribut game requir predict outcom logarithm loss function leav independ stage stage justi ed independ complet coincid maximum entropi bayesian network maximum entropi argument ident independ maximum entropi complet requir rst make background knowledg explicit show entropi subject constraint knowledg solut determin bayesian network independ assumpt background knowledg background knowledg consist compon causal interpret bayesian causal dag speci ed probabl liter condit state parent rst formul knowledg formal appli maximum entropi procedur probabl speci problem simpli entropi subject constraint bayesian network speci xed outset causal graph provid obviou constraint qualit free notion entropi probabl procedur turn causal inform constraint complet causal interpret constraint present compon bayesian network involv variabl cn complet belief function maximum entropi mean causal variabl dm ad causal variabl current cn inform ect understand origin problem inform form extens origin dag extens probabl speci cation incorpor condit probabl parent form complet larger domain cn dm restrict complet base call principl causal irrelev principl base asymmetri causat inform lead inform knowledg ect provid inform inform occurr hj hj figur lung chest pain ect irrelev question inform form variabl ect unknown irrelev true variabl thought causal unrel found common wise variabl probabilist depend greater extent thought simpl signi es lung cancer causal relat link probabl liter involv inform complet form joint probabl distribut learn lung cancer probabl liter involv common inclin form complet render depend liter motiv liter case make thought learn lung cancer chest pain figur valu liter form complet causal irrelev condit requir di er idea learn knowledg common ect give occur belief chang irrelev assum complet process constrain probabl valu speci cation bayesian causal graph principl causal irrelev kei point causal irrelev strong causal inform constrain weak controversi entropi kei proposit probabl speci cation causal graph bayesian network gener discuss causal asymmetri principl causal distribut entropi distribut determin bayesian network independ assumpt strategi proof lagrang multipli deriv condit entropi show bayesian network distribut sati es condit straightforward method reason constraint consist speci ed probabl xed due causal irrelev causal addit constraint common probabl distribut linear restrict domain entropi function convex set kn proposit page entropi strictli concav function shown problem uniqu local global bayesian network distribut sati es condit optim solut uniqu global maximum entropi strictli concav strictli concav distinct vector paramet log log log log signi es cross measur distanc probabl strictli posit argument distinct strictli posit true distinct strictli concav lagrang multipli approach yield global maximum thing reformul problem make suit bayesian network framework mean nding paramet standard mention loss gener node cn order respect bayesian network speci parent order order dag structur causal graph theorem page make proof clearer probabl speci cation posit ect result repres liter paramet jc proposit main thing note chain rule translat entropi formula framework neg entropi entropi log log log log make step separ term cancel addit probabl deal type constraint speci cation constraint determin valu provid bayesian network speci cation causal constraint determin causal dag causal irrelev condit final addit constraint axiom probabl suspect constraint lead complic adopt induct approach form lagrangian function incorpor speci cation addit constraint framework write speci cation constraint jc kr kr kr involv parent constraint entropi prove proposit induct case trivial constraint complet determin probabl distribut entropi bayesian network sati es entropi induct hypothesi hold case appli principl causal irrelev gener causal constraint note exist uniqu maximum independ note depend inclin avoid subscript process causal dag variabl order hn involv cn move essenti involv incorpor variabl cn previou variabl cn entropi domain restrict result probabl function cn causal irrelev entropi smaller domain ect appli induct hypothesi xed bayesian network independ kr order remain hn respect subject speci cation constraint xing valu kr addit constraint kn kn adapt speci cation constraint kr kr kr xed entropi cn kr kr kn kr kr kn posit lagrangian function hn ln log kr kr kn kr kr kn log kr kn kr kr lagrang order condit minimum rst check constraint quali cation constraint form matrix section row consist partial deriv final check rank easili avoid detail entropi partial deriv lagrangian log kr kn equat elimin lagrang multipli nding equat involv kn equat cn substitut give equat kr kn kr log log elimin multipli express side nding equat involv equat case constraint uniqu determin bayesian network entropi trivial log log log log note bayesian network distribut constraint sati ed independ assumpt impli kr kr kr kr case substitut kr kr kr kr hold bayesian network distribut entropi requir remain point speci er kr induct hypothesi kr vanish elimin entropi term constraint leav fewer partial deriv condit condit sati ed scenario kr case lagrangian partial deriv constraint sati ed substitut partial deriv make common deal cross entropi log log condit sati ed null speci er independ justi ed import thing rememb independ assumpt fact causal assert agent knowledg complet logic deriv probabl statement agent background knowledg independ justi ed logic coincid maximum justi cation stage stage process justi ed left bayesian network complet bear close resembl object probabl put practic applic bayesian network includ medic diagnosi nding high risk scenario sucient deem reason lack relev neglig collect relev inform reliabl model object situat step ne bayesian network light order achiev greater reliabl algorithm extens literatur learn bayesian network data appli rest section idea respect simpl techniqu clear justi cation coher approach section deal case causal inform question type inform collect order ne limit complex network causal inform agent present inform form causal link add arrow initi bayesian network good survei relat algorithm justi cation involv entropi pose signi comput problem worst case emploi mutual inform techniqu probabilist infer bayesian network mean deriv network causal chang probabl jd parent account justi cation strategi appli argument section learn causal link probabl background knowledg includ extend causal graph probabl speci case entropi adopt bayesian network form ad arrow speci er justi cation reli depend principl direct probabl ect condit ect causal start bayesian network sg xs causal graph sg probabl speci entri assum object probabl jd add arrow chang speci ed probabl give network sh measur improv network closer induc probabl function object probabl function usual measur distanc probabl cross entropi network network initi network network probabilist depend condit parent depend principl hold fact entail node probabilist depend probabl distribut repres network closer target object distribut justi ed ad arrow simplic loss gener assum strictli posit atom state show cross entropi distanc ln ln ln atom bear mind real assumpt ln show deal bayesian jd jd liter consist state parent consist arrow term product liter involv node jd jd jc remain liter substitut jc set variabl fc dg valu state parent form bayesian network incorpor graph probabl determin usual probabl function bayesian addit probabl requir turn reason ln atom state ln jc jc jc consist condit depend hold assumpt posit atom state essenti atom state ln ln ln rst sum hand side sum compon jd case axiom sum read ln ln ln deal cross entropi convent ln ln ln reason appli atom state ln justi es approach learn causal link current variabl learn variabl causal relat learn probabl jd appli argument equal argument show xs network construct network ad node causal arrow graph probabl speci cation final note argument requir ad arrow link probabilist depend node node causal relat probabilist depend agent present inform ect node justi ed ad arrow node causal relat result graph agent bayesian network longer causal bayesian network abstract tool repres probabl function mutual inform strategi chang network causal inform probabilist depend present agent strategi seek good arrow ad arrow size speci cation requir bayesian network space time calcul probabl network time mean limit complex prevent network address question section kei limit complex consist constraint bayesian network constraint node constant bound number parent serv restrict space complex bayesian network instanc discret network requir tree complet network determin target distribut easi variabl complex network equal bayesian network space complex approxim discret network complet network give target distribut depend problem hand resourc balanc approxim complex graph singli connect graph ensur bayesian network calcul requir probabl ecient time polynomi number node note network space complex practic constraint limit space complex constraint goal constrain network bayesian network satisfi good approxim target object distribut cross entropi measur associ weight arrow bayesian network order weigh arrow node parent weigh arrow condit mutual inform log rang state network subject constraint ord closest approxim measur network satisfi arrow weight distanc probabl function determin xs bayesian network target function log log log jd consist log log jd result independ choic proof log log log entropi function mutual inform parent entropi restrict node entropi independ choic bayesian network distanc network target distribut total mutual inform note log log log log parent iter relat jd distanc network distribut target distribut sum arrow weight wai constrain network maximum close maximum simplest greedi start discret graph stage weigh arrow addit ensur dag structur constraint remain sati add maximum weight arrow exist spawn graph ad arrow previou constantli prune number graph elimin longer maximum weight stop algorithm arrow ad straightforward proof liu approxim maximum weight span tree perform turn remark ectiv greedi approach algorithm justi answer question section seek good arrow add nding arrow maximum condit mutual inform weight limit complex network constraint network note ad arrow gener incompat causal interpret graph bayesian arrow correspond condit mutual inform causal stage correspond close abstract foundat bayesian network causal interpret independ assumpt pose signi problem straightforward object subject interpret bayesian pure mean determin agent belief function background knowledg bayesian network rm foundat adopt rst adopt subject causal interpret drop network ned order approxim target object probabl function foundat appeal notion assumpt causal independ assumpt stage justi ed maximum entropi strategi stage justi ed cross entropi rel object distribut worri object interpret determin depend worri subject interpret ne network probabl distribut determin object advantag abstract approach dont requir past case data determin network make causal probabilist background knowledg refer al altern markov properti chain confer uncertainti arti cial portland morgan page frank common philosophi scienc associ page note ad arrow causal graph discret ensur constraint sati ed initi causal network david cor donald gilli je pari art human research board fund research al john daphn stuart russel probabilist network hidden machin learn page guid literatur learn probabilist network ieee transact knowledg data engin page eld jeremi british journal philosophi scienc page nanci capac clarendon press liu ck chow cn discret probabl distribut depend ieee transact inform theori page ronald design oliv boyd ba van scienti clarendon oxford chain graph markov journal statist page clark review recent work foundat causal turner page cooper clark gregori mit press peter entropi glass confer uncertainti arti cial daniel cambridg press daniel jame invari causal markov british journal philosophi scienc page richard paul philosoph review page al david christoph gregori bayesian approach causal cooper page edward construct phd stanford paul critic causal discoveri turner page paul humphrei david grand british journal philosophi scienc page mutual inform approxim evalu bayesian phd school comput scienc softwar monash michael graphic mit press gilli duncan hidden node bayesian arti cial intellig page frank foundat bayesian challeng principl soft comput page john confer uncertainti arti cial san morgan page john causal markov fact sigart turner stephen statist method search causal knowledg social notr dame press john stuart system connect view principl evid method scienti harper eighth richard reason expert theori wilei smith rm oliv jq uenc belief net wilei david reduc causal direct philosophi scienc associ page je uncertain reason cambridg press je maximum page je pari maximum entropi infer intern journal autom reason page reason intellig network plausibl san morgan kaufmann cambridg press dechter pearl independ causal graph confer uncertainti arti cial portland morgan kaufmann al dan geiger thoma logic uenc smith page direct ramsei ultim philosophi scienc associ page han direct berkelei lo california reprint discoveri algorithm direct cyclic confer uncertainti arti cial portland morgan page wasserman jame robin larri imposs infer causat associ background cooper page william physic american institut physic weslei page weslei explan causal structur princeton press weslei oxford press steven direct british journal philosophi scienc page richard introduct causal turner page richard view page jq principl smith page elliott principl common jame essai honour weslei page cyclic graphic feedback confer uncertainti arti cial montreal morgan page al peter clark richard lectur note statist al peter clark richard humphrei review british journal philosophi scienc page al le df gilli da probabl expert arti cial intellig page rangarajan rst cambridg press pearl verma synthesi causal lo cognit system california al cox multivari structur deriv univari center survei research jon probabl report pai jw jon probabilist approach eleventh intern workshop principl diagnosi june jon discret probabl distribut bayesian report pai jw
Agents/943 1 avoid antonio moreno superior universitat de abstract belief formal model decad doxast logic world model kripk semant provid intuit semant commit model agent logic omnisci classic perfect reason belief close classic deduct model model resourc limit prevent attain level doxast compet report statement problem survei interest approach suggest overcom content formal model belief world kripk semant logic omnisci perfect reason avoid logic omnisci syntact approach belief set formula incomplet deduct rule belief model restrict deduct semant approach imposs world explicit implicit belief logic gener awar urn model logic belief belief world unifi semant summari refer formal model belief logic knowledg belief doxast modal logic formal reason knowledg belief perform agent proposit modal logic unari oper ad proposit call modal oper existenti modal oper modal oper interpret give rise logic interest ffl interpret ffl tempor mean read ffl deontic interpret ffl dynam mean case execut interpret execut program make ffl provabl read mean ffl doxast mean interpret ffl epistem interpret world kripk semant literatur doxast logic modal oper call agent famili subscript oper bm consid read believ usual languag proposit doxast logic agent set primit proposit basic logic oper modal belief oper bm formula languag primit proposit applic logic oper modal oper formula languag semant model adopt basi doxast logic world model model base assumpt set state agent agent set world compat existenti modal oper defin actual agent distinguish world actual usual semant formula doxast languag kripk semant state agent believ formula iff true world agent actual world normal kripk structur tupl form rm set truth assign primit proposit world access relat world agent ffl iff indistinguish world agent normal kripk structur relat true state model defin ffl primit true ffl ffl ffl ffl ffl st ffl formal concept belief agent believ proposit true world consid world agent actual world mean true world connect actual world access relat world agent exist sound complet axiomat class normal kripk structur agent axiomat system sound respect class structur formula provabl true complet respect formula true prove axiomat system class structur sound complet axiomat class axiomat system set normal kripk structur agent axiom infer ffl instanc tautolog proposit calculu ffl ffl infer ffl infer formula provabl axiomat system instanc axiom obtain appli infer rule provabl formula formula true class structur true state structur class axiomat system system km agent simplest model logic knowledg belief approach properti knowledg belief account ad axiom basic system popular ffl axiom ffl posit axiom ffl neg axiom ffl axiom system kt defin system axiom knowledg axiom posit introspect ad system system turn transform ad axiom neg introspect system weak axiom introspect axiom knowledg ad axiom consist system obtain exist strong relationship axiom properti access relat world kripk structur easili prove relat axiom knowledg axiom posit axiom neg axiom consist logic omnisci perfect reason axiom ad km axiom rule basic modal system axiom instanc proposit rule directli classic proposit logic relationship studi branch modal logic correspond binari relat properti condit ffl ffl ffl ffl instanc axiom schema standard proposit presenc axiom rule necessit commit model agent ffl logic tautolog true ffl perfect logic consequ belief agent believ state mean proposit true world compat state true agent fact impli agent basic arithmet axiom theorem theorem agent knew rule chess white win strategi union problem refer literatur problem logic omnisci author prefer call closur logic consequ tautolog closur distinguish logic omnisci perfect logic omnisci perfect reason accept circumst unaccept consid problem epistem logic reason commun protocol distribut system context extern view design system ascrib knowledg process process comput requir answer question shoham note applic knowledg possess agent simpl complex intern reason neglect logic omnisci perfect reason accept classic puzzl literatur reason muddi wise men cheat perli point omnisci formal major advantag simpler easier model ideal reason real reason measur approxim circumst condit case agent comput knowledg action base intern view worth point comment made omnisci rel chosen languag full ration absolut requir languag isomorph languag languag fashion set limit agent thing report deal doxast observ applic epistem suffer logic omnisci perfect reason problem differ knowledg belief account literatur true fact properti knowledg obtain axiom hold acquir comput realist model human agent logic comput agent resourc limit prevent perfect summari omnisci line real reason agent number reason order justifi studi ffl ideal agent physic imposs ffl agent construct necessarili limit resourc bound finit limit cognit comput capabl short time world await ffl set belief real agent simpli close logic agent procedur predic logic ffl artifici agent gener incomplet incorrect belief realiti ffl wrong theori built ideal entiti successfulli appli ration ideal agent intuit firm ground judg irrat finit agent ideal limit finit agent resign possibl gain insight natur reason limit resourc avoid logic omnisci author solv problem logic omnisci perfect reason section review relev classifi syntact semant syntact approach belief set formula basic syntact solut problem logic omnisci perfect reason repres belief agent set formula set belief agent ff set formula languag ff believ oe sentenc oe belong set belief ff model assum natur belief ff contradictori inconsist sentenc semant approach analog syntact approach logic belief section approach problem set belief agent instanc tautolog close logic consequ halpern comment option difficult belief principl guid analysi incomplet deduct rule interest approach adopt konolig model belief agent deduct structur deduct structur tupl base set fact set deduct rule logic oe ffl believ formula oe belong set defin deduct closur base set rule flexibl model belief avoid problem logic omnisci perfect reason agent modu ponen includ set deduct deduct closur condit weaker closur logic consequ deduct rule agent logic deriv logic consequ base model reason knowledg perform agent resourc limit konolig proposit modal logic belief oper show analyt tableaux method prove formula satisfi prove method sound close tableau head negat complet close tableau konolig defin system deduct paramet intern languag agent rule agent add rule method analyt branch formula close rule obtain lemma show relationship satisfact sentenc belief oper deriv intern languag set unsatisfi iff st ffi belief model wooldridg describ model belief system reason model subsum classic wai belief konolig deduct model belief section standard doxast normal modal logic agent belief system repres belief defin tupl base set belief observ made agent belief extens binari relationship set formula formula satisfi ffl ffl ffl belief extens relat model agent reason abil idea clarifi concept belief set repres agent set foe mean tupl agent believ formula set formula ffi main point abil model agent reason process base logic infer model definit pair includ model agent oblig formula fail ff includ agent formula negat includ fact make similar levesqu logic implicit explicit belief section note logic omnisci avoid model axiom necessit rule normal modal logic hold syntact natur belief belief extens wooldridg show deriv belief extens relat base set belief set legal belief state set bs belief state system possibl chain event defin ffi agent formula includ legal belief state base set formula notion similar necess notion normal modal wooldridg stress belief normal modal interpret model restrict deduct hintikka suggest syntact solut logic omnisci perfect reason put syntact restrict deduct argument order restrict class logic consequ oe hold oe number free individu symbol number level quantifi formula denot number individu consid basic idea paramet greater argument hintikka claim approach yield result urn model semant approach section semant approach imposs world cresswel point problem logic omnisci perfect reason solv classic world semant world tautolog true inconsist formula world call imposs standard situat vardi mention disadvantag ffl intuit underli classic world difficult defin semant logic connect world ffl ad world solv perfect reason agent model logic consequ standard logic consequ consequ relev logic explicit implicit belief approach logic omnisci perfect reason logic explicit implicit belief levesqu section notat levesqu languag modal explicit belief implicit belief oper nest formula languag structur explicit implicit belief defin tupl set primit subset repres situat actual present function set primit subset situat support truth support situat classic world compulsori primit proposit true situat primit proposit true ffl proposit true ffl situat complet partial support truth primit complet situat compat situat point defin set complet situat compat situat defin relat situat formula oe hold situat structur support truth oe hold support oe definit relat ffl primit ffl ffl primit ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl formula true state levesqu defin formula valid true structur complet situat ffl prove explicit belief impli implicit belief prove implicit belief close implic proposit tautolog explicit belief suffer ffl close implic set belief close implic bp satisfi ffl close valid implic set belief close valid implic bp satisfi ffl tautolog satisfi ffl agent inconsist belief believ satisfi ffl agent formula logic formula satisfi point properti deriv exist situat formula case explicit belief agent close situat agent believ inconsist belief situat agent believ idea prove tautolog agent tautolog form primit proposit agent fact suggest semant model lack logic omnisci due lack knowledg model due lack comput tautolog form primit proposit difficult prove fagin halpern add comment ffl relat defin valid relat defin complet situat impli formula valid logic truth support situat exist situat st valid formula proposit calculu valid logic valid restrict complet idea consist situat ffl definit relat respect logic oper clear agent primit proposit hold easi imagin agent knowledg proposit tautolog ffl logic deal agent proposit logic nest belief limit logic gener awar fagin halpern suggest logic solv problem approach explicit implicit konolig comment logic gener awar similar logic deal agent investig halpern extend approach partial nest belief assum proposit languag usual boolean oper negat conjunct primit interpret case singl modal unari explicit implicit belief awar oper nest kripk structur gener awar tupl set truth assign primit proposit state binari relat element access relat euclidean serial system world set sentenc languag st ffl set formula agent awar state necessarili semant languag relat defin ffl ffl primit true ffl ffl ffl st ffl ffl ffl st ffl ffl implicit belief oper standard kripk semant access relat euclidean oper satisfi axiom posit neg introspect axiom consist explicit belief defin implicit belief belong awar set explicit implicit belief equal agent awar implicit belief interpret formula agent prove consequ time agent awar class formula easi make deduct show deduct logic gener awar model perfect reason restrict set formula konolig make remark logic ffl connect properti access relat axiom satisfi knowledg lost assum agent explicitli believ true bb true bb la ll true condit oe la oe ab condit affect access analysi introspect properti standard kripk semant lost ffl logic gener awar syntact explicit belief defin implicit belief agent awar ffl st ffl part conjunct refer presenc awar part kripk syntact formal moor prove system weak stabl set set stabl close modu ponen condit ffl ffl ffl ffl syntact point model logic gener awar intersect stabl set arbitrari set awar ffl realist model agent perfect reason respect syntact class formula urn model hintikka suggest syntact approach problem logic omnisci section comment approach semant approach urn model approach start interest gener concept variat notion urn model probabl call nest quantifi formula repres success draw individu urn domain success search individu model concept urn model obtain set individu vari success draw urn model role imposs world vari subtli success draw told classic model sequenc draw long sentenc shown condit oe true urn model argument oe oe syntact restrict mention section logic belief semant approach problem logic omnisci logic belief set assum relat defin formula satisfi world defin intens formula set world satisfi semant fulli determin intens formula oe intens semant agent ff believ believ approach problem logic omnisci perfect reason partial longer true ff believ semant impli ff believ oe agent contradictori sentenc ff believ semant ff believ oe price paid belief agent connect appli intens semant relat partit set formula class ff believ ff believ class natur map class subset formula class intens impli agent believ set proposit set subset belief structur defin tupl set function return intens atom proposit function assign agent set proposit believ world languag atom proposit close respect boolean connect believ agent semant languag ffl ffl ffl ffl ffl ffl ffl line formal idea agent believ world intens includ proposit believ agent vardi comment approach make ffl notion world left primit give intuit natur world ffl left open issu obtain set world belief world order overcom vardi describ model belief proposit defin belief world construct set world semant relat logic relat assign defin truth valu set atom proposit call world assum world defin induct set world assign function relat agent set proposit set world infinit sequenc prefix call world ww set world assign restrict level remov proposit level obtain notion satisfact formula finitari world defin ffl primit true ffl ffl ffl fw belief world extens belief world previou determin satisfact formula prefix long number level nest belief oper oe prove formula depth satisfi valid problem formula belief world decid belief world axiomat ffl instanc proposit tautolog ffl infer vardi model belief valid proposit reason allevi logic omnisci problem solv vardi suggest wai attack ffl add world belief world ffl accept epistem notion noi pure add syntact flavour semant unifi semant show logic knowledg belief case semant defin gener world framework semant defin languag proposit logic model tupl form ffl set normal ffl set ffl binari relat ffl function assign boolean formula condit ww note condit defin normal truth falsiti formula world formula oe true model world iff formula valid model true normal world model valid valid model show levesqu logic explicit implicit belief section fagin halpern logic gener awar local reason section van der hoek meyer logic awar principl special case unifi framework summari world model kripk semant extens decad give formal semant modal formula doxast epistem logic success attain model base fact ffl intuit approach process reason knowledg intellig agent carri ffl axiom rule behaviour knowledg close link properti access relat world point semant world consid spite posit commit world model kripk semant make difficult model reason process model agent logic omnisci perfect reason logic consequ problem detect label hintikka author comput scienc artifici provid altern formal solv partial problem report review ffl simpl syntact repres belief set set formula ffl deduct model belief suggest konolig set belief agent repres axiomat system ffl belief model wooldridg konolig axiomat system ffl syntact solut number free symbol number nest quantifi suggest hintikka ffl philosoph imposs ffl separ explicit implicit consid levesqu ffl addit concept awar logic explicit implicit result logic gener awar defin fagin halpern ffl semant counterpart hintikka syntact made urn model ffl logic belief semant view idea repres belief set list formula ffl belief world defin construct vardi ffl world model provid logic framework unifi previou approach classic approach extend improv recent approach base similar decoupl evalu primit proposit evalu negat logic ration action share basic limit world model extens review found refer logic relev necess princeton van handbook philosoph vol ed pp kluwer academ bradford mit choic artifici intellig pp logic logic journal philosoph logic pp framework logic explicit comput intellig pp oxford awar limit proc ninth intern joint confer artifici pp knowledg mit approach logic omnisci research report ibm research almaden research decemb sixth confer theoret aspect ration pp confer theoret aspect reason ed pp mose guid complet complex modal logic knowledg artifici intellig pp confer american associ artifici pp cornel world journal philosoph logic pp knowledg paradigm epistem confer theoret aspect reason ed pp van der logic rapport vrije universiteit action logic agent bound artifici intellig pp introduct modal formal theori pp ed deduct model morgan san awar sententi view implicit explicit confer theoret aspect reason pp semant analysi modal logic normal modal proposit fur mathematisch logik und grundlagen mathematik pp proposit logic belief tenth intern joint confer artif pp tractabl knowledg servic full confer theoret aspect reason pp relat explicit implicit intern confer principl knowledg pp attract logic european workshop logic lectur note artifici intellig pp springer studi epistem reason thirteenth intern joint confer artifici pp reason knowledg artifici intellig pp logic implicit explicit confer american associ artifici pp knowledg comput intellig pp formal msc centr cognit de ration ration finit lund cognit studi pp nonmonoton artifici intellig center technic note sri menlo comput scienc ration agent intern confer principl knowledg situat aaai workshop formal model ration pp semant intent mainten ration fourteenth intern joint confer artifici pp theori intern confer kind model firstord journal philosoph vol pp reason knowledg knowledg engin vol pp logic technic report depart comput stanford octob artifici intellig pp epistem logic logic confer theoret aspect reason ed pp gener world framework reason knowledg studia logica pp abstract gener model logic repres mental state aaai spring aaai march
IR/944 5 data mine model servic internet goal articl debat provid data mine model servic internet servic provid adequ data made internet yahoo huge categor document train document classifi provid model servic internet data mine made access wider audienc limit peopl data host practic problem solv idea made work identifi close invit debat investig introduct internet era share vast treasur authorit inform confin book limit access free internet extend power inform share knowledg share huge amount data host knowledg server build model accumul data aspect make potenti user consult server opinion site make final mine server total ad basi document access web rich document sourc long found rich sourc data confin disconnect larg instanc knowledg share todai base model modulo problem commun servic approach superior exist approach reason internet servic greater share access end user user access date model server gain model refin latest result user advantag reduc overhead softwar user mobil reduc cost user softwar downsid lack suffici bandwidth locat confidenti sunita sarawagi indian institut technolog bombai data model current wave applic servic provid offer busi solut applic make idea mine servic provid relev exist asp cover broad rang includ desktop storag manag erp system grow number mine compani start provid busi intellig solut internet applic servic basic approach compani retriev custom data oper case augment relev demograph data compani provid mine knowledg web interfac client mine servic model involv share simpli softwar skill data model usag model ad hoc requir priori agreement servic provid user close relat project mmm project goal share econom model internet line relat concept exemplifi site net back human expert answer question pose user free fee goal autom mine model goal project overlap goal recent work area distribut data mine close relat area learn project underwai larg scale distribut data exampl project mine data distribut project provid high perform network comput testb mine jam project develop java agent base meta learn framework distribut mine project collect data mine stress learn vertic partit data field distribut data mine share concern web mine servic area standard model integr differ distribut mine project focu model construct distribut fashion integr stress protocol softwar architectur exchang data partial model agnost check instanc sigkdd explor copyright acm juli volum issu page model construct individu knowledg server worri put model servic web model integr variat enhanc basic meta learn algorithm requir singl coordin phase separ valid set elabor issu section meant ad hoc internet user assum close set particip scenario present scenario internet knowledg server document classif servic immin mine servic document classif servic accept document predict class predefin categori tree internet larg categor document sourc exampl yahoo altavista gener web corr ncstrl comput scienc medic list endless data rich site easili categor data set build automat text classifi model made servic user submit document back posit document taxonomi site digit librari newspap agenc automat categor submiss standard taxonomi download huge amount data site spend monei effort build good automat agenc categor servic involv fee problem user contend predict portal assign categori document predict trust site area strength weak singl site constantli cascad yahoo grain predict document comput scienc medicin corr detail classif discuss interest research issu section collabor filter servic compel applic scenario electron commerc store sell stream movi internet store provid person recommend custom base demograph profil prefer pattern similar user store data learn pattern start servic mine model imdb internet movi offer recommend similar movi site movi critic movi site updat negoti copi prefer store simpli servic recommend model onlin book provid relationship profil prefer book genr similar classif appli movi collabor filter system book make grain predict type movi access collabor filter engin movi actor refin recommend collabor engin train larger amount data domain predict genr movi site good predict subset popul filter indian movi indian site filter american movi handl american site problem combin predict similar model level granular partial develop model store collect sale incorpor experi recommend store build recommend engin infrastructur depriv experi store option ship data servic provid figur combin predict data previou model risk predict servic time involv data tradit busi insur compani draw experi exist busi determin rate charg applic kei factor determin premium rate risk level applic engag insur pai premium insur compani histor data build model answer question insur compani busi share model credit card compani insur busi sell data compani basic data credit worthi applic case easili share scenario previou stronger confidenti concern parti separ agreement share model secur privat network concern insur compani model multipl credit card compani cover geograph region applic compani decid notion risk assess exist rate assign credit bureau agenc specif individu sigkdd explor copyright acm juli volum issu page predict approach differ base geographi influenc risk level compani figur compani collect data integr data extern data provid research challeng challeng make ad hoc mine model web realiti list interest standard standard data model fundament effect combin collabor model distribut internet applic document share easier text document human interpret data schema definit hard interpret establish user commun slowli gradual chang industri grow number consortium standard aspect busi inform mine move standard understood domain model predict promin exampl ol db data mine standard process model data mine data mine group predict model markup languag base xml aspect step standard syntact level format aspect address level rpc protocol soap mine standard mention aspect standard semant data identifi attribut mean industri group vertic industri group attempt xml context issu standard model structur case hierarch involv structur tree agreement harder yahoo base data sourc taxonomi web directori provid method express capabl scope model part data train coverag train data confidenti data model confidenti major concern share data model internet larg data sourc guard compani phenomenon remov limit data sourc popular appeal increasingli made freeli web hold strongli document classif scenario present earlier partial collabor filter scenario busi busi secur infrastructur greater provid model data share summar model fewer confidenti concern share raw data insur scenario present credit compani share risk predict model insur compani raw data dataset made share albeit strict access control applic fraud detect competit bank share data concern confidenti data document classif scenario model freeli user deploi model secur concern ship data servic provid convinc user servic provid log data integr distribut model eventu multipl site start offer predict servic domain document classif user yahoo altavista site serv categor web document movi recommend user imdb movi critic site cover partial overlap data set user left make briefli review classic work discuss appli context meta learn refer method integr result classif compon model train independ varieti method construct meta model individu model learnt parallel present base method classif broadli classifi add vote classifi class highest vote arbitr rule classifi reach consensu explicitli train meta classifi predict compon classifi valid data set meta learner type depend set attribut meta learn extrem class predict compon model train extrem class predict origin input attribut call augment method vote arbit simplist shown inferior combin method method suitabl reason particip site autonom mean input method time model construct proce autonom coordin site site constantli evolv chang model knowledg server exist knowledg sigkdd explor copyright acm juli volum issu page server tradit model select approach singl train phase combin model applic type user model unlik train mine user user histor data benchmark model exist method meta learn knowledg probe requir separ valid set rule list research area integr output mine model dynam model select problem design dynam model select algorithm requir global synchron reli avail valid set user maintain full autonomi particip site term predict model chang model obviou algorithm meet criteria major vote algorithm vote work homogen set fail site special strong topic compar site movi recommend predict site special topic prefer strategi classifi output addit inform confid make predict research work direct account differ coverag model model level granular adapt dynam model select problem class label arrang hierarchi case interest integr model model level taxonomi text categor scenario site yahoo level categor document belong special cs repositori provid subject level classif research issu decid level classif partial model previou assum correct class label instanc class label paper present applic data mine medicin data mine medicin site corr classifi paper base taxonomi comput scienc subject assign class label yahoo assign class class class mistak model select method handl vertic partit data situat input attribut vertic partit site data student vertic partit institut store academ record student track record student graduat studi model predict perform real world base academ record initi combin model vertic partit data sourc initi attempt made learn vertic partit data problem requir central coordin synchron meta learn method problem open research investig person mine model mine servic suffici amount user collect data perform model train model work data provid data true label feedback mine model approach prefer user continu benefit data provid infrastructur build model user enter special contract servic provid build special model person data includ data user data insuffici provid build provid data includ overshadow data time build robust complet model calibr accuraci model data data big cover interest case entir data similar problem captur drift model time progress proport data recent versu standard approach assign ag factor weight instanc factor clear ag factor instanc ag rate refer editor workshop integr multipl learn portland aaai yang deploi data mine internet domingo knowledg discoveri multipl model intern data preliminari design system high distribut data mine kargupta al schmidt mmm access algorithm www poster present intern sigkdd explor copyright acm juli volum issu page web kargupta editor workshop distribut data fourth intern confer knowledg discoveri data kargupta park collect data technolog ubiquit data analysi distribut heterogen site submit ieee comput special issu data adam impact chang popul classifi perform intern confer sig knowledg discoveri data mine parallel distribut learn intern workshop multistrategi page stolfo metalearn distribut data mine issu approach proc conf knowledg discoveri data schapir singer improv boost algorithm predict machin chan java agent distribut intern confer knowledg discoveri data weigend predict confid interv error editor distribut artifici intellig meet machin learn environ springer editor multiag modern approach distribut artifici intellig mit widmer kubat learn presenc concept drift hidden context machin sigkdd explor copyright acm juli volum issu page
IR/945 5 inform space tilburg june abstract document gener background target advanc inform space plan includ librari inform system tilburg overview current inform topic semant network preliminari idea actual implement includ semant conceptu topic document introduct librari develop tilburg cooper european aim singl point user interfac multitud singl user set map connect queri data content individu queri result merg elimin doubl present user suitabl format aim desktop deliveri materi electron channel provid user lack integr singl entri point distribut queri ii involv work queri decid start work user interfac perceiv lack user satisfact current queri engin paper describ main featur system keyword search overview current statist inform preliminari idea requir advanc user interfac librari system heart librari system li facil enabl user queri exhaust librari collect bibliograph author queri straightforward librari catalog essenti answer user question user nding interest document speci refer addit tradit catalog form oper document locat inform lend statu possibl reserv document futur borrow system extens undoubtedli improv librari user locat interest materi assist user librari begun store inform show storag extend storag facil enabl user speci document queri document content document content regard collect word content queri work search speci word feasibl restrict technic document xed action descript consid content queri request speci conceptu match conceptu queri remot straightforward exact match user speci eld pretti retriev relev librari readili conceptu queri al distinguish ve kind knowledg user order successfulli conceptu queri inform retriev system procedur knowledg ir system possibl includ boolean oper keyword complex underli queri user fulli exploit strateg knowledg search request formul simpli knowledg semant ir system command full text storag form document deliveri procedur syntact knowledg knowledg construct index polici optim materi word document index titl search knowledg user plan proce current queri complet strategi pearl grow develop queri keyword provid retriev fall categori domain knowledg decid chang unsatisfactori queri queri result retriev document narrow substitut gener term speci requir domain knowledg user lack knowledg queri inevit satisfactori result limit amount control librari user knowledg rst knowledg user train librari er gener voluntari basi lack domain knowledg easi ectiv educ tradit task librari factor uenc result queri song state success ir depend size short queri provid su cient inform ir system distinguish relev document irrelev user enter short queri studi rose steven queri consist kei partial due user lack domain partial simpli formul long queri problem solv proper user reach user train option song conclud system support user addit domain knowledg support found user domain knowledg deal complex inform user domain knowledg simpl inform di erenc iter queri drawback user prefer short coupl lack kind lead recur sequenc queri result queri iter queri simpl keyword search commonli form boolean user receiv inform synonym keyword poor document recal user receiv document orthograph semant di erent keyword poor addit penalti recal inabl searcher fulli articul impact complex combin oper hard grasp slight chang queri larg chang amount retriev greatli discourag user continu ning queri plain keyword search er hint document er user result list relev top provis provid relev select subgroup retriev document inform ir system document materi relev feedback user queri recur queri subsystem high system load system connect full turn larg number document index record format central ship user browser render displai problem counter simpl techniqu convent inform retriev technolog match term speci ed user term occur index term match ectiv specialist access materi area terminolog specialist close relat subject area relev term searcher present problem gain adequ knowledg potenti huge dynam system queri arti cialli ned ad word synonym attempt automat expand queri synonym thesauru fail improv retriev ectiv system frequent degrad perform type mechan term introduc level granular retriev process trade commerci system includ hierarch thesauri provid adjunct inform seeker refer automat expand user request techniqu exist suggest relat materi provid relev cach techniqu basic queri engin modern system techniqu improv user satisfact problem work inform retriev began earli sixti studi shown ectiv exist ir system inadequ wide acknowledg older studi respect blair maron recent shaw al survei ir paper publish period conclud retriev ectiv system gener rare half relev document retriev rare half retriev document relev enabl conceptu queri order overcom limit keyword search engin queri usag search intermediari intermediari human machin expert system intermediari shield user technic aspect true queri engin background knowledg document domain object system spontan descript inform minim inform seeker engag repeat queri reformul order discov exact terminolog retriev inform requir intermediari user underli start initi queri subsequ intermediari confront user complet di erent interfac guid user correct complet queri intermediari add featur retriev provid di erent document order system matter choic knowledg conceptu queri involv knowledg navig basic type knowledg search search impli user solut lack domain knowledg complet requir impli document resourc link logic topic assist user process inform discoveri visual relat searchabl interact provid searcher conceptu map er altern search term interact term system suggest term user signi cantli enhanc retriev ectiv papazogl basic idea interfac provid user freeli fair indic distribut terminolog domain reason overlap actual serv guid actual queri serv underli origin mean inform space browser slightli date signi cantli ect nal result set dir inform space provid easi navig unknown concept predetermin network interrel concept user overview domain wai organ network network boil sort hierarch tree compar strictli hierarch digit number system librari shown concept natur rank singl parent semant network resembl satisfactori librari classi cation system decim classi cation system librari congress classi cation attempt develop hierarch classi cation structur human knowledg classi ed strict hierarch system lc unabl fulli captur desir relationship necess place concept place limit partli artifact pre xe categori code express gener relationship mean put directli concept assign code basi assign code result catalog arbitrarili reason categori assign catalog code document limit classi cation system static evolv fast adequ track chang terminolog evolv eld publish knowledg navig major improv provid addit basic keyword accomplish maintain singl access point mean span heterogen geograph distribut singl interfac exist infrastructur engin part result form individu domain inform store user put queri substanti number queri distribut amount queri result number miss due synonymi acquir knowledg partial increment avoid regular download inform aggreg support partit distribut knowledg base multipl implement interfac coexist seamlessli conceptu network state previou transit keyword search conceptu search conceptu requir solv queri problem unlik string conceptu match involv complex data structur resourc readili easili gener document wood index combin techniqu knowledg natur languag process classic techniqu index word phrase text enabl retriev system make connect terminolog request relat terminolog inform automat analyz conceptu structur phrase extract semant relationship word concept establish connect terminolog request terminolog provid inform automat organ word phrase index materi explicitli link concept speci speci concept gener concept concept concept modi structur connect term request relat concept care point di erenc maintain semant net maintain set topic level hierarch search speci cation involv weight combin varieti queri oper power abil tune perform inform design topic speci cation activ requir special skill kind skill requir manual put semant net wider topic mesh distribut conceptu network scalabl requir librari digit strongli suggest index distribut papazogl argument hold conceptu network period updat semant net larg extent increment introduct materi underli requir complet recalcul network network propag increment part distribut system tradit dir updat complet propag opportun con semant net updat possibl con ict solut link node modi cation delet restrict design author manag semant net feder manner propag ectiv duplic net site maintain singl core link separ maintain net queri time ectiv produc distribut result net augment relat net link net xed semant overlap term correspond advantag structur exibl erent net special di erent complement scalabl individu updat hamper user net possibl net geograph local cach establish improv network latenc time consolid core network core network develop design concept receiv uniqu concept net explicitli link core concept improv correct guess overlap inform space glu form singl lexicon inform space terminolog domain creat overview domain knowledg inform giant lexicon meant continu live updat extens basic structur simpl implement techniqu exist automat extend thesauru term encount automat creat network author manual craft consid preliminari skill human domain specialist hard manual creat network numer irregular papazogl autom tool di erenc network small cover signi part domain complet satisfi network improv time conceptu network biggest challeng lexicon assist inform space su cient extens cover reason part properli link lexicon content document librari domain cover matter put lot lexicograph work knowledg skill assist tool link close tradit ir map terminolog document cover domain rst problem solv automat process statist arti cial human input knowledg essenti scienti eld extens experi gather compil vast knowledg sourc trivial build semant relat project care creat good core knowledg stabl basic ontolog local knowledg built work eld relationship lexicographi conceptu elicit method sociolog psycholog obviou domain expert automat quali ed creat good conceptu conceptu model specialist lack requir domain knowledg close cooper group peopl necess success project eld conceptu model pai bit attent elicit interest machin knowledg extract present recent project eurowordnet pai attent knowledg acquisit integr part lexicon substanti di erenc core knowledg addit knowledg hold gener core versu speci citi fring extend part lexicon maintain core knowledg stabl construct select group fring attribut peopl eld period lexicon manag weed wrong misplac connect contribut knowledg shield browser con ectiv feedback quickli gener show contribut knowledg suitabl extens nice touch add address url contribut refer addit inform contribut entri requir lexicon manag link domain librari bring problem straightforward approach directli issu queri select info space directli confront tradit problem keyword match system knowledg network info space provid addit cue ectiv queri situat xed index system simpli modifi underli mass data bulk map reli queri formul environ info space inform mention pinpoint exact document straight info mechan uniqu document refer succe refer arbitrari document set appoint authorit document creation set facilit user contribut gener good queri lexicon signi portion relev inform inform lexicon lexicon store inform form concept node link connect inform area user space augment concept surround progress weight concept meaningless mere exist link produc weight keyword match pattern link type produc di erent score size info area vari user move center area gradual shift complex queri document space di erenc separ space model compar tradit keyword document space automat map keyword space li fact lexicon domain independ actual document space map queri info space creation time info space space suitabl actual assist attach concept node tradit keyword lack browsabl passag retriev tradit document advanc applic technolog aim passag retriev system provid user ectiv access inform minim read time requir discov inform sought found retriev document system provid passag retriev featur automat extract index phrase materi transform phrase intern provid ectiv search techniqu intern connect concept term queri connect concept passag index materi underli system partner retriev index passag retriev consid futur extens foreseen avail document project futur work clear signi improv user satisfact librari inform retriev system expect ad domain knowledg current ir approach good requir user input paragraph extens conceptu network provid requir extra domain knowledg network exist librari knowledg worker commonli requir domain necessarili train formal knowledg conceptu network su cient experienc creat maintain conceptu network support topic work area knowledg elicit knowledg complement map techniqu conceptu model actual boolean keyword requir design work product system suitabl work month ort foreseen build requir conceptu network domain project involv creation basic semant principl extens survei exist thesauri glossari econom domain expert project consid mandatori made facil link concept lexic enabl queri fact lingua franca econom expect facil consid mandatori part advanc inform browser refer evalu retriev ectiv document retriev system commun approach queri inform retriev lectur note comput volum page mental model interact handbook chapter netherland andrea cluster hierarchi hypertext ir acm hypertext page journal paper electron project serial european project de lectur note comput digit librari comput page springer heidelberg approach conceptu text retriev eurowordnet multilingu semant work note aaai spring symposium text retriev conceptu model lexicon phd tilburg netherland measur discrimin onlin searcher di erent train experi onlin inform elicit inform network intern symposium cooper system advanc japan semant framework landscap inform space feder digit librari intellig deduct hypermedia technolog john wilei ny lightweight engin interact inform text retriev confer nation institut standard md develop automat text retriev improv retriev perform relev feedback journal american societi inform al interact term suggest user digit librari acm intern confer digit page bethesda md perform standard evalu ir test vector space retriev model inform process grammat conceptu individu lexicon phd amsterdam lexicon project ijcai workshop ontolog multilingu japan inform retriev graphic inform phd maastricht netherland conceptu organ knowledg technic sun microsystem laboratori
DB/946 3 manag queri process interv robert volker bayer research center knowledg base system germani abstract manag queri process interv special case extend object handl interv plai import role tempor fuzzi fuzzi logic measur qualiti exist access method extend object address special problem main memori access method support access secondari storag research applic extend object part doctor work contribut articl specif solut manag queri interv extens classic combin transform extend object paramet space solut specif problem extend object point rang spatial paramet space introduct manag extend object discuss lot research commun access method quasi standard spatial applic data structur develop deal paper part edbt phd workshop germani person materi permit permiss materi creat collect work resal redistribut server copyright compon work obtain extend object greater special object resp interv hand special data structur extern segment tree complic integr dbm problem manag queri process interv interest common access method commerci rdbm handl call interv simpli interv give exampl applic requir interv match manag tempor standard store current version data kind snap tempor histori version lifetim seldom point fuzzi applic area fuzzi logic resp match map interv match fuzzi match point interv match interv width determin fuzzi match applic model interv person requir track user behavior find profil fit user behavior user typic profil express set interv access file assign profil match user interv profil interv find match profil overlap user interv paramet space transform interv point figur endpoint transform qualiti product rai tube produc assembl line sort qualiti criteria clock rate properti express set interv find class interv match commerci rdbmss limit support interv process problem design main memori data structur support retriev secondari storag drawback complex integr exist relat dbm technolog show interv support minor modif rdbm implement commerci rdbm support idea demonstr context point interv intersect problem interv intersect interv handl effici support interv handl combin transform interv paramet space solut easi integr commerci rdbm paramet space simpl geometr shape consid point higher space call paramet space requir transform interv space interpret begin end interv coordin space transform call endpoint transform result paramet space dimens equal domain fig show interv point queri pq interv queri iq point paramet space interv depict fig point map main interv width formul queri iq pq max pq point queri pq iq intersect queri iq iq enclosur queri queri eq cq figur nativ space queri paramet space simpl domain interv assum point queri answer queri box intersect queri map queri box queri map queri box enclosur queri map queri box transform fairli simpl result queri box transform method midpoint transform problem typic queri result queri transform method conceptu paramet space approach disadvantag neglect case paramet space dimens evalu index paramet space fig show thousand gaussian distribut interv paramet space fig result partit paramet space space adapt paramet space figur distribut interv paramet space partit data distribut paramet space earlier measur proven perform excel dimens constant overhead iq queri box result paramet space transform start upper left corner region cover larg popul area remain cach queri requir evalu approach check requir meet approach inherit good properti excel secondari storag logarithm worst case major queri time linear size result independ input data insert scalabl growth small space requir index paramet space transform straight forward approach easi implement robust applic integr minimum impact exist part long support support interv manag queri requir data type interv minor exist code rdbm summari outlook present hybrid method manag queri interv transform interv paramet space index space requir transform paramet space simpl independ rdbm function research investig usabl perform approach artifici data real world data order check scalabl secondari storag manag fit main memori gigabyt data cach main memori test access method consid main memori access method secondari storag access method check space fill curv result perform final investig approach appli extend object higher space refer mccreight organ maintain larg order index acta informatica index technic report institut fur tu munchen gener concept comput applic lectur note comput springer verlag bayer perform rang queri technic report institut fur informatik gute extern segment tree algorithmica bayer improv rang queri rectangular volum queri box set proc intern symposium web cooper system germani gunter access method acm comput survei dynam index structur spatial search proc acm sigmod conf probabilist reason intellig system network plausibl infer pearl rev print san calif isbn heidelberg springer isbn bayer process oper restrict relat manag system extern sort proc icd australia bayer improv olap perform hierarch cluster proc idea canada process relat queri access techniqu band infix isbn ja class data structur associ search proc acm conf orenstein comparison spatial queri process techniqu nativ paramet space proc acm conf relat hierarch data structur acm comput survei specht adapt person scheme hypermedia proc confer hypertext inform retriev multimedia
DB/947 3 preserv distribut data mine chri clifton depart comput scienc novemb data mine technolog emerg mean identifi pattern trend larg quantiti data data mine data wareh tool oper princip gather data central run algorithm data number applic lead distribut data mine obviou solut data heterogen access data problem simpli data distribut situat connect transmit larg quantiti data central site heterogen sourc easier combin result combin privaci sourc organ share data mine data research concentr issu obtain data mine result valid distribut data limit share data site perform local oper site produc intermedi data obtain reveal privat inform site variant depend data type data mine restrict share inform problem difficult learn associ rule support confid common data mine simpl distribut solut privaci individu site associ rule receiv lu shot ag impli hospit insur meet criteria meet shot ag criteria requir hospit algorithm effici find associ rule minimum level support easili extend distribut case rule support data approach local data data mine local data combin valid result local data figur data approach distribut data mine support individu site distribut algorithm work request site send rule support rule request site send count item support total count item site comput global support rule support found work shown figur vari problem challeng difficult protect individu item site support method reveal inform variant approach fail data partit singl item part inform part build research program address broad spectrum data mine privaci issu purdu research foundat fund address problem associ rule data vertic privaci mean prevent learn attribut valu entiti relat work research run exist data mine tool site combin gener give global valid result proof assum data divid data item support rule partit data site support support item item send site run item assign support item site local data mine local data data mine combin local data mine local data request local analysi fc combin result local data mine local data figur comput associ rule individu site result situat dispar local global result valu singl entiti split sourc data mine individu site unabl detect correl item duplic result data singl site homogen popul import geograph demograph distinct popul singl site data mine algorithm partit data subset work parallel data mine relev goal parallel data mine algorithm commun cost node issu parallel data mine algorithm serv start point portion research algorithm distribut data mine cheung al method horizont partit basic approach outlin figur distribut classif address approach develop classifi train individu develop global classifi protect individu remain shown individu classifi privat inform recent work address classif vertic partit data situat distribut interest respect learn work address privaci concern research inform calcul data made data mine minim inform restrict classif lem treat approach desir quantif secur process corpor requir absolut knowledg protocol leak format long inform share strict possibl bound work cooper comput entiti mutual distrust comput data process secret share secur parti comput investig yao gener comput semin paper prove exist secur solut approach function comput repres combinatori parti run short protocol gate circuit particip share input wire output wire gate appeal gener mean size protocol depend size depend size input highli ineffici larg data mine show secur solut achiev effici secur solut distribut data mine open number scenario issu identifi public health problem biolog warfar data collector public health privaci concern limit data share govern agenc center control accomplish desir result preserv privaci individu collabor corpor entiti ford share problem jointli produc ford explor tire ford associ rule techniqu discov problem earlier requir extens data share factor trade secret agreement manufactur stand share obtain preserv secreci govern entiti face similar limit share law intellig tax collect corpor individu legal system prevent share custom data subsidiari parent exampl defin set problem plan address problem face expect seed larger research effort address wide varieti distribut data mine problem problem desir data mine cluster associ rule identifi relationship data mine pose set challeng data entiti found singl site medic insur site type data privaci concern sole valu individu entiti identifi develop techniqu provabl protect inform notion advanc lead human vet intermedi result requir individu site result complet method requir numer round requir human difficult develop exact solut meet privaci constraint data mine approxim solut suffici obtain solut bound differ solut solut appli problem privaci mine heterogen problem combin result easier combin sourc plane type model number field plane type model number produc rule tal jack screw field easi manual discov model number plane type context research plan research culmin product prototyp system distribut data mine initi phase formal defin develop effici algorithm solv problem note tive develop find solv altern definit problem altern measur practic defin problem solv work support develop method enabl discoveri associ rule vertic partit ing privaci individu item method requir commun cost number item round commun method outlin appendix altern approach give cost relat support size provid practic algorithm expect develop solut variant problem project solut step formal prove solut preserv privaci data item method describ work ad random valu give share equat unknown recov desir result equat multipl solut recoveri origin unknown data item prevent remain formal proven recoveri data item develop complet associ rule mine algorithm method appendix comput critic figur associ rule mine secur incorpor complet demonstr full algorithm preserv privaci individu data item issu resolv complex algorithm distribut measur number size data number commun round requir algorithm data complex gener thought term number data item memori size requir evalu set cost metric data mine techniqu intract good perform practic case tradit analyz algorithm comparison exist central data mine algorithm messag comput round valid efficaci practic implement test algorithm requir develop prototyp system enabl test distribut platform comput facil support test exist indiana center system scalar product algorithm associ rule mine problem definit mine boolean associ rule presenc absenc attribut repres item string entir repres matrix find itemset count number record valu attribut itemset translat simpl mathemat total number attribut remain attribut valu attribut valu bm support threshold requir total number sequenc repres vector process data valu describ comput vector scalar product vector cardin defin xi yi comput frequenc attribut vector attribut vector comput itemset frequent translat check number transact attribut present itemset present greater support repres absenc presenc attribut translat comput xi yi xi yi attribut valu translat calcul scalar dot product attribut present effici secur parti possess attribut limit inform reveal section compon algorithm descript protocol gener protocol straightforward find associ ck candid ck begin attribut parti independ calcul itemset frequent attribut remain attribut construct side side ai bi comput xi yi lk lk end end answer compon algorithm scalar product vector defin xi yi comput scalar product form larg part protocol import effici commun algorithm comput scalar product present algorithm gener random comput constraint coeffici set linear independ equat send valu multipli add send write assum simplifi protocol protocol easili gener case odd simplifi equat group xi yi xn yn yn line rh succinctli written xi desir final result group multipl compon rearrang equat factor ri xi yi desir result xi remain baggag ri valu recal valu earlier coeffici ri valu easili multipli valu add subtract total desir result cooper total number transact attribut reveal detail transact refer rakesh agraw ramakrishnan srikant fast algorithm mine associ rule intern confer larg data septemb vldb rakesh agraw ramakrishnan srikant data mine acm sigmod confer manag acm philip chan extens approach scalabl accur induct learn phd depart comput columbia report philip chan accuraci scalabl data mine journal intellig inform david vincent ada fu effici mine associ rule distribut transact knowledg data decemb kargupta distribut web mine bayesian network multipl data stream ieee intern confer data mine novemb decemb plai mental game complet theorem protocol honest major acm symposium theori page kargupta editor advanc distribut parallel knowledg discoveri privaci preserv data mine advanc cryptolog page august andrea philip stolfo distribut data mine issu chapter edward navath effici algorithm mine associ rule larg intern confer larg data page septemb michael jochen distribut part problem class distribut knowledg discoveri ubiquit data mine mobil distribut environ workshop joint european confer machin learn european confer principl practic knowledg discoveri andrew yao gener exchang secret ieee symposium foundat comput page moham zaki parallel distribut associ survei ieee special issu parallel mechan data decemb
DB/948 3 defin view imag system vincent duan paul depart comput scienc alberta canada view mechan handl complex semant emerg applic area imag paper present view mechan defin imag system develop top power view mechan base separ type class manag object type imag view mechan view mechan give semant imag solut base distinct physic salient object interest object imag logic salient object mean object introduct view wide relat manag system extend model capabl provid data independ view relat formula defin virtual relat produc formula appli real relat materi view mechan newli emerg applic area technolog discuss view mechan imag work conduct context imag manag prototyp develop research support strateg grant natur scienc engin research council canada alberta deal view research effort commun object view defin relat achiev problem complex gener environ assum virtual class defin exist schema virtual object virtual class oid time view violat principl virtual class consid normal place class due volum complex imag imag commonli built top object system imag benefit view mechan imag interpret view mechan model system defin model capabl handl imag includ syntact color salient object imag level syntact featur organ store call physic salient object level physic salient object mean logic salient object level salient object detect annot manual process fact manual automat extract inform organ inform imag interpret regard context imag understand imag chang electron commerc system catalog photograph peopl model cloth shoe custom point interest object catalog compani track model cloth shoe assum model model agenc agenc interest find pictur model user interpret content set imag defin imag content regard context captur enhanc imag model share imag user group mechan imag implement user virtual creat imag interpret context includ salient object semant class deriv mechan gener appli applic present section section describ model extend support view section present imag view definit languag describ current defin view imag system imag section discuss relat work section conclud deriv class separ definit object characterist mechan maintain instanc type reason type defin behavior encapsul hidden behavior implement object creat type templat term behavior includ public interfac function public state instanc behavior defin type describ interfac object class class ti notion type object instanc entir group object includ subtyp extent type manag class refer deep extent introduc shallow extent refer object creat directli type subtyp consist reason type paper start set class class type denot extent class denot graph repres type hierarchi type deriv simpl deriv class singl class call parent deriv class parent term root class refer class root object refer object root class deriv relationship object properti introduc obtain data store simpl deriv class simpl deriv class virtual class deriv singl parent class definit deriv class defin parent class formula select valid object extent interfac defin type combin function augment hide ffi map set object type set object type properti hide properti appli set object type return set object type avoid introduc extend applic type ffi properti defin creat type call restrict properti ffi defin restrict supertyp creat type augment addit properti function implement augment subtyp defin type class deriv class properti fi hidden properti type class deriv class sibl properti stand subtyp relationship supertyp relationship properti notion sibl gener notion subtyp supertyp gener case properti remov ad illustr figur assum properti defin restrict augment restrict type person class figur deriv class type defin view imag system figur extent augment restrict person subset extent person interfac defin type augment restrict person deriv class assum type person subtyp student faculti student teach faculti research type student properti properti defin faculti deriv class teacher person teach properti obtain year depend type root object class teacher directli deriv class person properti defin person deriv solv problem definit pair class filter interfac deriv class filter interfac deriv class filter interfac deriv class sibl function return common ancestor type hierarchi semant construct oper base basic set oper binari oper formula obtain term combin complex note deriv class defin ancestor function anc work fine root common supertyp creat worst properti problem deriv class teacher solv defin simpl deriv class student teacher extent subset student deriv class faculti teacher faculti teacher defin teacher student teacher teacher type teacher subtyp person common ancestor identifi updat deriv object deriv object deriv root object properti total properti root object teacher student faculti type class figur deriv class type defin view imag system properti root class hidden defin deriv class deriv object root object view angl interfac function deriv deriv object root object identifi oid root object redefin notion oid class root oid root object differenti deriv oid defin logic object includ deriv independ view implement techniqu case view materi increment activ research area deriv object oid kei candid directli identifi deriv object root object updat properti inherit root type easili propag root object creat object deriv class creat object root class unknown properti valu defin imag view mechan imag view present paper base imag research project develop distribut dbm imag spatial applic model aim organ imag queri overview model effici imag relat data support wide rang queri depict figur main imag block salient object block defin block group semant relat entiti imag block imag block made imag layer imag layer distinguish imag maintain independ refer independ imag user defin imag type classif figur depict type hierarchi electron commerc applic repres catalog class gener catalog type deriv root type root imag type provid type catalog special salient object block salient object block design handl salient object organ simpl salient object imag hierarchi defin figur figur distinguish kind salient physic logic salient object logic salient object abstract salient object relev applic object creat inherit relationship belong categori instanc salient object salient object imag imag imag block salient object block salient object figur model overview figur imag hierarchi figur logic salient object hierarchi defin view imag system instanc type politician repres presid clinton object creat exist imag presid clinton call logic salient maintain imag independ gener inform store object interest instanc object physic salient specif imag set inform link fact data color shape imag give formal definit content physic logic salient object definit physic salient object region geometr object space textur logic salient object interpret region object give semant physic salient object definit set logic salient object set physic salient object content imag defin pair set physic salient map physic salient object logic salient object imag basic unit model defin definit imag defin tripl set raw imag format content imag set descript data color textur imag part recogn salient object imag progress comput vision automat detect object state art comput vision permit automat recognit arbitrari scene assum object detect imag analysi softwar gener object syntact object semant region imag properti shape textur challeng provid syntact object semant assum object detect person comput assign explain imag analysi manual compon project charg imag process object detect concern imag peopl imag process softwar detect face imag minimum bound rectangl spatial assign logic salient object face imag descript properti date photograph provid remaind assum inform level salient object provid level salient object ensur semant independ salient object idea imag view base semant independ class deriv mechan present section extend model support imag view schema imag type hierarchi salient object type hierarchi imag view defin deriv imag class give semant salient object imag deriv logic salient object class deriv class defin imag class deriv salient object class illustr exampl shown section aim deriv imag class filter salient object redefin semant deriv logic salient object class defin imag view deriv imag class deriv imag addit defin convert salient object parent imag class deriv definit deriv imag class class deriv imag class specifi valid logic salient object imag extent imag deriv imag set physic salient object subset set physic salient object logic salient object belong valid logic salient object addit redefin deriv imag class redefin content imag class defin figur deriv catalog give interpret imag imag custom catalog class cloth compani catalog custom interest find cloth catalog valid logic salient object class cloth addit compani interest inform model deriv imag class creat deriv class defin view imag system deriv combin oper deriv class common ancestor catalog type sibl type catalog type class student figur deriv imag class defin imag view deriv logic salient object class definit defin content imag pair repres physic salient object function map physic salient object logic salient object imag deriv assum deriv logic salient object class logic salient object class physic salient object map object note interfac function transform object object defin ffi deriv imag object class deriv cloth shoe deriv class deriv deriv class deriv imag class defin imag femal cloth shoe sibl definit imag view defin deriv imag class redefin semant physic salient object imag deriv logic salient object class imag view definit languag view definit languag defin deriv class queri view definit express object queri queri languag defin extend standard object queri oql predic function captur tempor spatial relationship extens introduc form predic includ predic check salient object belong imag convent languag definit fg part possibl view languag creat delet deriv creat deriv class deriv class definit augment properti hide properti valid salient object class extent definit union intersect minu delet deriv class delet class deriv defin deriv logic salient object deriv imag class class deriv class deriv ordinari deriv class queri extent defin deriv class extent return uniqu subset combin parent class extent augment defin properti queri invok exist properti keyword refer current object properti class defin view imag system deriv cast cast type ff content defin valid logic salient object deriv imag class hide previou imag content redefin implement imag view deriv logic salient object class logic salient object class mention deriv semant physic salient object parent deriv object assum salient object class deriv class imag imag class salient object type deriv imag class content imag deriv salient object type imag view imag element cloth salient object exampl imag view give exampl imag view deriv catalog schema express odmg object model appendix schema appendix view imag model cloth exampl correspond custom femal cloth catalog femal catalog view imag view view deriv cloth augment cloth hide extent deriv hide place cast accessori extent content deriv class redefin cloth custom attribut hidden virtual attribut return averag price type cloth imag view imag class catalog renam extent imag content limit object type redefin cloth attribut place hidden attribut accessori defin set imag catalog type chang set ensur consist imag view view deriv extent select femal deriv hide place cast accessori extent content imag femal item select cloth catalog salient object restrict femal cloth imag view view deriv augment shoe hide extent select femal deriv hide place extent content deriv union extent combin deriv catalog defin view imag system implement deriv class distinct type class support objectori languag current implement top objectstor type imag logic salient object subtyp user implement describ section simul idea implement type class call class type class start person type class class person class object class class class subclass class deriv class properti defin class class type class list superclass list subclass shallow extent class list class deriv depend properti defin class list class deriv filter function redefin set function class class class deriv class deriv class augment properti comput object class type deriv class type root class materi deriv class extent object class repres user class extent properti return object type class comput deep extent simplifi materi store level root class deriv class class deriv class extent materi time class refer materi flag set time object modifi delet root chang messag class materi flag materi flag deriv class deriv class extent recomput materi flag reset augment properti deriv object comput singl root object manag algorithm increment view mainten easili implement object deriv class oid root object deriv chang method pass oid chang root object delet deriv class object deriv class object visit updat creat deriv object modifi root object delet deriv object delet root object relat work view mechan defin imag compar solut multimedia product develop top system defin view mechan imag view solut section focu repres view view multiview view view view mechan defin system view distinguish kind deriv virtual imaginari class main idea virtual class select object exist root connect root extens virtual class interfac modifi hide attribut ad virtual imaginari class select restructur queri data root turn connect root extens virtual attribut attach data object queri root view augment origin interfac virtual object attribut hide restrict origin interfac root object hide attribut virtual object visibl multiview multiview research prototyp develop michigan top gemston system multiview updat materi view main featur system integr virtual base class unifi global schema classif algorithm restructur defin view imag system class hierarchi virtual class particip inherit hierarchi base class gener schemata base virtual class includ increment view mainten algorithm view materi iew make distinct virtual class select queri exist object imaginari class select object restructur turn object virtual class connect gener hierarchi relationship imaginari class multiview integr deriv class global class hierarchi complex classif algorithm solut simpler power virtual class deriv class type integr type hierarchi modif root class addit view imag view provid semant independ content imag view object view mechan earli main problem view express power queri defin reusabl model accuraci view gener consist oid problem relat view mechan user view class link gener queri gener view class restrict problem type problem type virtual class relat type classif problem extent virtual class relat exist find answer question environ relationship relationship lead contradict distinct deriv hierarchi gener hierarchi base distinct type eleg solut problem view mechan present paper deriv class exist problem solv fact deriv object root object interfac function deriv object root class share oid uniqu identifi pair class oid invari deriv object recomput model separ object imag salient semant salient object view imag view mechan give semant imag deriv imag class defin deriv logic salient object class give semant object imag hide object directli defin deriv imag class main contribut paper power objectori view mechan base distinct class imag view mechan base imag semant imag view implement languag support distinct class type refer abiteboul bonner object view acm sigmod intern confer manag page widom strip rule system effici maintain deriv data acm sigmod intern confer manag page el effici view mainten data acm sigmod intern confer manag page bertino view mechan intern confer extend data base page march editor object odmg morgan san ross support multipl view mainten polici acm sigmod intern confer manag page kuno rundenstein multiview oodb view design implement journal theori practic object system objectstor system commun separ implement object dbmss technolog languag system intern confer page santa august multimedia object queri languag intern workshop multimedia inform page septemb model imag approach defin view imag system intern confer visual inform page san decemb sudarshan materi view mainten integr constraint trade space time acm sigmod intern confer manag page june rundenstein classif algorithm support view intern confer inform knowledg page june claud serg abiteboul virtual schema base intern confer extend data base page march cross divid comput vision data base search imag ifip work confer visual system page spaccapietra deriv object class dood system intern confer deduct dood page decemb sampl schema class method class person date time string class region salient object region imag color salient object color imag textur salient object textur imag class string string address class string class string string real manufactur integ string date date date boolean true cloth stock class imag item match cloth class string class imag region color textur textur salient object object type person object type model object type cloth object type shoe imag
DB/949 3 express power data integr system andrea diego giusepp de maurizio lenzerini dipartimento di informatica sistemistica universita di roma itali abstract basic approach design data integr system map concept global schema view map sourc view global schema goal paper relat approach respect express power analysi carri relat queri global view map conjunct queri introduc notion data integr show integr constraint global approach incompar addit integr constraint global present techniqu transform direct show result impli transform system approach gener system introduct data integr problem combin data resid provid user unifi view call global schema global schema interfac user issu queri system system answer queri access free user knowledg data data structur sourc interest kind system continu grow year organ face problem integr data resid sourc compani build data data resourc plan system address problem integr data world wide web subject investig project nowadai applic requir access legaci system deal problem integr data store sourc design data integr system complex issu import aspect specif map global schema specif carri queri process basic approach map sourc global schema call simpli requir global schema express term data sourc element global view data sourc mean term data resid sourc call requir global schema independ sourc sourc defin view global schema relationship global schema sourc establish inform content sourc term view global schema approach method data integr system procedur flavor respect approach design data integr system concentr content sourc term global forc data global schema queri sourc comparison approach report approach ensur easier extens integr set mainten ad sourc system requir provid definit necessarili involv global view ad sourc principl requir chang definit concept global schema process queri approach difficult task knowledg data global schema view repres view provid partial inform data map associ sourc view global infer sourc order answer queri express global schema extract inform data integr system similar queri answer incomplet complex task queri process easier advantag map directli specifi sourc queri correspond element global schema queri answer base simpl unfold strategi intuit deep analysi differ approach miss goal paper investig rel express power approach address problem check system transform interest transform respect queri queri pose origin system answer pose system introduc notion notion class data integr system result queri reduc system deriv procedur specif declar result queri reduc deriv declar content sourc start procedur specif studi problem set global schema express relat queri integr system queri global queri express languag conjunct queri show set transform show presenc integr constraint global schema reduc direct depend simpl form depend suffic transform system singl head full depend suffici direct introduc assert illustr adapt techniqu transform result present paper show techniqu answer queri integr constraint relev data integr approach answer queri form depend year result impli approach directli appli queri answer system depend data integr good candid applic experi techniqu real world set paper organ section describ formal framework data introduc notion class data integr system section show relat model integr class system mutual section present result case integr constraint global schema section conclud paper discuss approach framework data integr set formal framework data integr relat set assum involv framework defin fix set object db relat schema relat structur db db db denot relat ariti queri denot db set tupl object db obtain evalu set answer db focu conjunct queri equal atom constant denot cq ariti relat schema hx xn xn ym xn distinguish variabl necessarili ym existenti quantifi xn ym conjunct atom predic symbol involv variabl xn ym relat write cq fhx xn xn simpli constraint relat schema simpl singl head full depend relat tupl distinct attribut denot project tupl denot project depend depend form relat relat schema sequenc distinct attribut belong db satisfi db db simpl depend form relat relat schema distinct attribut db satisfi tupl db hold singl head full depend form relat relat schema conjunct queri ariti db satisfi db db data integr system tripl global express relat possibl constraint sourc express relat model map constitut set assert form queri sourc schema global schema sourc schema describ schema data global schema view underli sourc assert map establish connect relat global schema sourc schema typic data map data provid queri sourc satisfi queri global necessarili complet answer queri global schema user queri pose global schema answer retriev data make map basic approach map map associ relat queri map set relat form map associ relat queri map set relat form observ case associ relat global singl queri call class integr system map similarli integr system call sourc sourc schema global satisfi constraint sourc global satisfi assert respect global legal respect satisfi assert map respect observ global exist legal respect queri pose integr system express term relat global schema sourc answer queri respect set tupl object global legal respect set call set answer respect integr system mi hg sourc schema relat relat respect queri sourc respect queri global schema answer queri integr system ident compar class integr introduc concept class integr system class integr system exist function respect compar constraint section data integr system constraint global schema check system transform wrt show transform feasibl begin transform theorem class data integr system class system proof prove theorem exhibit system sourc set queri system hg answer queri wrt differ system global schema constitut sourc schema constitut singl relat map assum system hg respect observ constraint global introduct relat useless construct system wrt newli introduc predic relat assum map form conjunct atom relat existenti quantifi constant sourc answer wrt contradict immedi obtain contradict result show mechan queri answer directli simul mechan basic substitut user queri global relat definit map turn transform theorem class data integr system class system proof exhibit system mi queri system hg construct sourc answer queri differ wrt global schema constitut singl relat sourc schema constitut map previou observ introduct relat construct system wrt assum map form conjunct atom relat existenti quantifi constant defin sourc big distinct queri answer hg system show ci construct global satisfi wrt ci construct associ variabl constant definit distinct constant constant atom add tupl construct ensur ci legal wrt bi ci ci prove claim result show deduc inform specifi role sourc relat wrt global inform direct inform queri answer perform compar constraint address question case integr constraint global schema direct singl head full depend suffic system system mi defin system hg sourc relat defin relat includ assert introduc singl head full depend denot conjunct obtain substitut atom xn xn easi result data integr system hg transform observ size linearli relat size turn question reduc system system show simpl equal gener depend global obtain system system mi integr system loss assum equal atom conjunct queri map defin integr system hg technic rewrit queri map variabl atom ad suitabl equal bodi queri queri rewritten xg set sourc remain unchang global schema obtain relat imag relat relat expand relat number variabl assum variabl zn distinguish ad relat add depend imag expand relat atom occur add depend expand relat atom occur add simpl equal gener depend expand map associ global relat imag queri remain global relat empti queri verifi theorem theorem integr integr system defin construct time linear size illustr transform integr system mi global schema constitut relat express paper cite express paper topic sourc schema constitut sourc pair paper mutual cite sourc pair paper sourc paper cite map sourc schema global schema integr system hg sourc schema remain unchang global schema constitut relat addit relat imag sourc imag sourc imag sourc expand sourc expand sourc expand sourc imag sourc expand sourc imag sourc expand sourc imag sourc expand sourc expand sourc expand sourc expand sourc expand sourc expand sourc expand sourc expand sourc map sourc sourc show integr system integr system obtain proof base observ integr system captur suitabl logic program refer notion rel logic concentr system logic program system hg defin depend set introduc form simplic attribut xn ym simpl equal gener depend form substitut occurr skolem result obtain rule form fn wm fresh skolem function assert map fhx xn xn ym rule form xn xn ym proviso simpl equal gener depend appli equat variabl relat predic sourc finit set ground fact logic program term appli result logic program theori show lemma lemma integr sourc logic program defin min minim model queri tupl hc object hc hc proof semant constraint translat shown answer wrt correct answer logic program claim classic result logic program correct answer logic program true minim model integr tupl constant answer queri equal satisfi minim model logic program turn integr system loss assum equal gener depend fold queri suitabl renam variabl integr system defin logic program introduc rule depend treat queri map queri sourc simplic assum unari relat relat queri appli skolem introduc deriv skolem base result prove integr system lemma analog lemma lemma integr sourc logic program defin min minim model queri tupl hc object hc hc integr tupl constant answer queri equal satisfi minim model logic program lemma place prove main result theorem integr integr system defin wrt proof logic program captur logic program captur show sourc global relat global schema renam skolem min min min minim model lemma lemma claim discuss previou section studi rel express power main approach data shown case integr constraint global system mutual presenc integr constraint deriv transform direct demonstr depend simpl form depend global schema suffici transform system system size linearli relat size origin system techniqu easili extend transform system approach data relationship global schema sourc establish make assert associ conjunct queri global schema conjunct queri sourc schema gener exploit techniqu present section difficult system transform techniqu present kei idea assert transform assert depend assert system ariti queri introduc relat symbol global schema result associ queri verifi treat techniqu introduc system obtain system size linearli relat size origin system refer serg abiteboul oliv duschka complex answer queri materi view proc acm sigact sigmod sigart symp principl system page serg richard victor vianu foundat addison weslei publ diego giusepp de maurizio mosh vardi answer regular path queri view proc ieee int conf data engin page diego giusepp de maurizio mosh vardi queri process constraint satisfact proc ieee symp logic comput scienc page oliv duschka michael genesereth answer queri view proc acm sigact sigmod sigart symp principl system page marc alon todd navig plan data integr proc nat conf artifici intellig page aaai mit grahn alberto mendelzon tableau techniqu queri inform sourc global schema proc int conf theori volum lectur note comput page gryz queri fold depend proc ieee int conf data engin page alon answer queri survei larg richard hull manag semant heterogen theoret perspect proc acm sigact sigmod sigart symp principl system alon levi techniqu data integr jack logic base artifici intellig kluwer academ chen li edward chang queri plan limit sourc capabl proc ieee int conf data engin page john lloyd foundat logic program extend val tannen chase proc acm sigmod int conf manag page qian queri fold proc ieee int conf data engin page jeffrei ullman inform integr logic view proc int conf theori volum lectur note comput page ron van der meyden logic approach incomplet inform jan chomicki gunter logic inform page kluwer academ
IR/950 5 miss link probabilist model document content hypertext connect david cohn burn glass technolog south craig suit pa abstract thoma hofmann depart comput scienc brown ri describ joint probabilist model model content document collect set web page research paper archiv model base probabilist factor decomposit identifi princip topic collect authorit document topic relationship topic map order build predict model link content applic approach inform retriev topic queri web web bibliometr analysi introduct book isol corpu document work document inevit relat build publish materi interdepend repres author explicitli make refer relat document vast number document electron world wide interdepend document form instant access referenc materi model understand structur implicit content connect document base resort manual classif rank document main goal paper present joint probabilist model document content stochast process mimic gener document part larger make accur predict exist hyperlink citat present extens work probabilist latent semant analysi probabilist hit mixtur model perform simultan decomposit tabl word occurr factor model extrem identifi topic common subject cover document repres weak memori make forget time document space understand relat document topic cover combin evid term link yield potenti stabl factor predict identifi authorit document topic author document correl frequent identifi author kei problem search engin predict navig predict content found model directli support navig document interact human user intellig spider web author support predict link base document content support author mainten hypertext automat improv updat link structur applic address facet press challeng locat inform environ world wide web led emerg entir due impoverish explicit structur web manual creat hyperlink citat limit scope annot add link pointer document awar access link annot creat link unchang relev document cite document link updat appropri defici make web inher link relev document exist exist link arbitrari model step technolog dynam infer reliabl structur impoverish structur observ review section show model combin joint probabilist model section describ applic preliminari experi area section futur direct relat research statist variant latent semant analysi build factor multinomi model base assumpt underli document gener process start point matrix word denot term word ti occur document dj svd factor identifi princip eigenvector perform probabilist decomposit close relat matrix decomposit present factor identifi state zk latent variabl rel frequenc estim term corpu document dj repres convex combin factor mix weight predict probabl term document constrain function form probabl set normal constraint factor mix weight learn maxim likelihood observ term frequenc aim maxim log factor zk interpret state latent mix variabl observ word algorithm appli find local maximum demonstr effect ad hoc inform languag model cluster factor captur distinct document cluster document domin document cluster emerg gaussian factor approach import distinguish factor model standard probabilist mixtur model mixtur object assum set latent sourc document credit object distribut sourc model insist candid sourc true origin object factor model assum object mixtur sourc assert document half half latent variabl observ document perform probabilist factor document citat bibliometr analysi bibliometr attempt identifi topic document influenti author paper base pattern citat frequenc analysi appli refer print techniqu proven success analyz hyperlink structur world wide web tradit begin matrix pair entri aij nonzero document di cite document dj dj hyperlink di princip eigenvector aa eigenvector roughli similar citat pattern coeffici document eigenvector interpret document commun cite commun coeffici princip eigenvector interpret commun authorit document cite commun probabilist model replac eigenvector yield model clear statist interpret mathemat ident model citat document model term model citat document substitut probabl estim term probabl estim spectral princip factor model interpret indic princip citat commun princip probabl document interpret author respect topic joint probabilist model content connect link hyperlink document gener term applic appli reason merg joint probabilist explain term citat term common set underli factor base similar defin joint model predict term notic decomposit share mix proport coupl condit probabl term multipl treat aij count variabl probabl link document dl probabl occurr term ti advantag joint model approach integr principl manner mix proport learn decomposit consist content link statist coupl model evid link structur account make predict document content vice versa decomposit model address question word found document link link structur simpl probabilist infer rel import assign predict term link depend specif applic maxim likelihood function rel weight α α ni al log log normal count ensur document weight number observ em approach straightforward deriv set equat formula posterior probabl latent variabl observ distribut recomput mix proport α experi ni al ni al potenti applic joint probabilist model simpli extens individu reli power joint model improv perform intellig web uniqu joint model requir simultan model content connect describ experi verifi joint model yield improv classif compar individu model describ quantiti call comput joint demonstr guid web crawler page interest experi temper version equat minim detail accuraci webkb data std error alpha accuraci cora data std error alpha figur classif accuraci webkb cora data set joint model α data set experi webkb data set consist approxim web page comput scienc classifi school categori cora data set consist abstract refer approxim comput scienc research approxim paper categor subfield machin learn classif joint probabilist model perform number wai classif associ document domin form spectral cluster factor label domin class document test document judg domin factor share label approach classif factor nearest neighbor approach test document judg label nearest neighbor determin cosin project factor space method experi cora webkb factor factor arbitrarili select number correspond number class compar power joint model individu model vari α lower upper extrem randomli select data reserv test set model temper lower limit β β factor time data likelihood stop figur illustr result accuraci joint model α greater model indic content link structur document collect corrobor accuraci robust wide rang mix proport refer flow previou subsect demonstr joint model amplifi abil found individu model joint model featur found document thought occupi point joint space factor mixtur term act describ link act direct connect point provid refer indic referenti connect topic refer flow exist arbitrari point factor absenc document map directli point refer document di document point factor space di dj model comput probabl combin factor depart faculti project faculti figur princip refer flow primari topic identifi examin subset webkb archiv di dj product probabl observ link repres refer point factor space integr link corpu unnorm figur show princip refer flow topic webkb archiv intellig web crawl refer flow find web page set word target dt project dt model identifi point factor space repres topic explor web follow link lead document project refer flow web page ds section web page link word project find point factor space prior inform link model comput refer flow fst indic probabl document link frequenc true sourc rank greedi simpli follow link document section highest refer flow figur rank target topic comput refer flow design score higher erenc flow state transit sourc document drawn random ti find optim link follow treat system markov process success model document approach similar project success window document factor observ trajectori larg jump factor mixtur success window probabl topic boundari document test util intellig web conduct experi webkb data set greedi solut dt select random corpu ds link target refer flow fst comput larger refer stronger expect direct link sourc target rank flow refer flow target randomli chosen page figur refer flow predict power base median rank versu median rank distractor chosen random note distractor screen ensur link distractor valid sourc target question discuss relat work attempt combin link term inform web approach ad hoc aim retriev authorit document relev queri bharat provid good overview research algorithm comput bibliometr author weight link base relev neighbor term machin learn commun recent interest sort relat model studi bibliometr al describ gener framework learn probabilist relat model present experi varieti domain specif probabilist model attempt explain content connect document unstructur document base demonstr preliminari result applic paper scratch surfac potenti applic joint probabilist document model refer bharat improv algorithm topic distil hyperlink environ annual intern acm sigir confer research develop inform brin page anatomi hypertextu web search engin technic comput scienc stanford cohn chang learn probabilist identifi authorit document intern confer machin harshman index latent semant analysi american societi inform pfeffer learn probabilist relat model dzeroski relat data mine hearst segment expositori text june hofmann probabilist latent semant analysi confer uncertainti page kleinberg authorit sourc hyperlink environ proc symposium discret lee seung learn part object matrix factor page seymor autom construct internet portal machin learn inform retriev electron
IR/951 5 introduct architectur multimedia inform retriev feder digit librari henrik norbert fuhr depart comput scienc germani peopl routin access huge number heterogen distribut digit librari satisfi inform relev librari inform reformul librari schema queri result fuse ineffect manual task accur tool desir mind develop eu solut feder digit librari cover issu start inform retriev approach focu retriev homogen sourc extend approach deal kind media imag transcript speech handl heterogen librari innov mind consid librari provid queri interfac mind architectur architectur standard structur mediat wrapper librari proxi extend function librari give dispatch requir inform provid librari extens implement standard implement intern textual inform commun singl proxi implement resourc written approach flexibl proxi implement dispatch scenario librari result architectur depict figur main function shift proxi major task queri queri rewritten librari calcul expect retriev cost resourc document weight data fusion mind architectur queri transform queri transform user interfac db dispatch proxi proxi db layer layer layer layer figur mind architectur user queri set condit attribut belong standard schema schema set type attribut data type attribut defin media domain predic mind consid heterogen librari major task transform user queri counterpart probabilist datalog describ uncertain map schema user queri condit dublin core attribut transform proprietari queri condit refer marc attribut map marc standard schema librari schema dc superset retriev return item solut determinist predic logic longer suffici express schema map probabilist datalog ground fact rule attach probabl boolean weight express uncertainti schema marc dc rule state pair dc creator marc system learn rule condit probabl earli multipl rule head lead exponenti number probabl code rule bodi detail proprietari queri condit weight calcul base user queri condit weight condit map probabl librari support stem colour histogram map pair schema definit map standard librari schema store resourc descript xml simpl algorithm automat transform user queri resourc select resourc select aim determin subset resourc retriev qualiti retriev cost queri resourc extend model proxi expect retriev cost connect comput charg deliveri cost view document measur retriev dispatch calcul optimum select expect cost expect number relev document queri librari requir usual modern view retriev uncertain outlook data fusion linear retriev function index weight condit lead proxi comput sum index tf idf valu index weight sum comput text term fact imag repres featur vector colour continu domain store sum featur vector vector cluster cluster vj centroid radiu number vector defin retriev metric featur vector index weight sum estim condit ci inform comput expect cost function code store resourc descript data fusion data weight retriev document optimum retriev qualiti techniqu investig global idf valu data fusion global idf valu comput dispatch request local document frequenc queri term similar frequenc media proxi frequenc store resourc descript acquisit resourc descript proxi simpli request resourc descript librari environ librari provid queri sampl solut estim document frequenc index weight text librari extend techniqu media featur vector extract cluster queri schema map requir mind learn schema map set result earli experi work project investig librari schema learn suffici train sampl outlook paper describ architectur ongo project mind fact digit librari hidden proxi actual librari dispatch librari fulli refer deleg focu futur work proxi acquisit textual resourc descript inform sum index weight standard implement proxi acknowledg work support eu commiss grant refer du automat discoveri languag model text acm sigmod intern confer manag page croft search distribut collect infer network annual intern acm sigir confer research develop inform page acm dublin core metadata initi dublin core metadata element version fuhr approach select network ir acm transact inform fuhr data abstract network inform retriev system inform process fuhr probabilist implement logic inform retriev advanc applic journal american societi inform librari congress marc standard fuhr learn probabilist datalog rule inform classif transform cikm
ML/952 6 target acquisit multipl object behavior coordin paolo maja matar usc robot research laboratori southern california lo ca work fund offic naval research grant abstract paper approach coordin context cooper target acquisit approach base multipl object behavior coordin extend multipl robot mechan distribut command fusion group robot pursu multipl goal multipl robot parallel mechan enabl robot select action benefit benefit group result mobil robot valid group robot successfulli track acquir move target introduct cooper team robot unknown set pose complex control problem requir solut suitabl multitud conflict task object robot action optim respect robot unaccept respect major issu design system control coordin multipl robot problem decid action select robot make benefit group central approach problem attract due inher scale requir commun commun global knowledg environ distribut approach hand appeal due properti scale reliabl overview approach issu cooper mobil robot relat work target observ allianc action select consist inhibit motiv approach similar task includ emploi format control type cooper explicit task paper approach multi robot coordin base multipl object behavior coordin view extens arbitr approach enabl command fusion group robot pursuit satisfact multipl goal multipl robot parallel approach command fusion approach find suitabl multipl conflict robot behavior object successfulli appli approach coordin behavior singl robot extend approach task appli approach task cooper target group robot collect captur move target behavior coordin multipl object behavior coordin base multipl object theori approach make complex situat object sider object defin standard qualiti altern evalu object map assign reflect altern desir multipl object behavior formal object function defin map action interv action fx defin finit set altern action map behavior object function formul coordin multipl behavior multipl object problem seek optim multipl object function object function produc multivalu behavior set altern action action chosen satisfi object function formul multipl object problem argmax subject object function estim behavior control vector xn constrain action space solut equat correspond select action satisfi object behavior solv problem number method literatur solv advantag disadvantag give descript highlight main characterist multipl behavior framework fuzzi behavior object function encod semant fuzzi membership function excel overview applic fuzzi logic robot action space constrain due physic geometr set constraint mechan construct subset feasibl physic action object make make suitabl behavior coordin start describ type solut problem solut optim result maximum object function simultan optim solut equat iff import characterist problem multipl competit improv deterior optim solut exist concept optim modifi includ similar concept problem practic hope solut satisfi object suffici idea encompass definit definit satisf satisf solut extend multipl object problem reduc subset feasibl exce aspir level object point impract search optim solut argu practic effici solut satisf solut correspond behavior maker solut notion optim context multipl object make definit solut multipl object problem iff exist solut solut improv object function simultan deterior object solut nondomin effici solut action select method gener solut notion satisf plai role formul behavior coordin mechan properti techniqu gener po satisf solut problem base definit behavior coordin scheme proce feasibl action base physic hard find set feasibl permiss altern action base object criteria find set action reject reduc significantli set altern satisf action incorpor subject knowledg aspir find set satisf altern prefer action criteria final select prefer action approach systemat narrow set includ increasingli criteria set hard constraint natur task physic limit robot limit exclud set action base object exclud set domin solut simpli effici compar solut incorpor subject prefer structur term set suffici solut criteria subject knowledg includ make final select altern evalu behavior object rank term prefer action relat fuzzi control mechan multipl object behavior coordin fuzzi interchang formul inferenc mechan multipl object formal tool behavior coordin resolv conflict principl manner respect behavior blend fuzzi multipl object approach compat combin straightforward combin approach behavior fuzzi gener multivalu behavior output fuzzi fuzzi context rule gener weight coordin behavior gener satisf solut multipl object make techniqu combin advantag approxim reason behavior specif fuzzi logic qualit formal behavior coordin capabl multipl object make cooper target acquisit appli behavior coordin approach task cooper target acquisit current implement team robot pursu surround target limit robot due practic space equip limit approach easili extend gener case cooper robot group task task robot search surround pursu final captur task high state diagram figur surround search captur pursu lost found lost escap reach approach lost lost found reach dir captur search figur finit state descript target acquisit task group perspect individu perspect success accomplish task effect cooper robot focu cooper surround target cooper enabl effici distribut search target captur focu paper overview cooper search strategi robot task robot task consist search approach captur depict figur order decid direct approach robot requir cooper partner techniqu multipl object behavior coordin enabl collect individu object strategi surround group collect object distribut robot evenli arc target result format shown figur dq target figur strategi group object surround target individu robot translat argmax subject angl describ direct robot target defin window toler robot requir stai equat assum describ complement mean implement equat state robot approach target direct conflict direct partner robot gener desir approach target direct base target rel angl target left robot desir approach left target front desir approach left robot common refer coordin target common refer point suffici target move robot illustr dynam strategi cooper robot case robot approach left assum robot desir approach left robot state desir approach left figur illustr object function robot make process robot approach robot approach left depend multipl object make process chosen robot requir attain aspir level produc satisf solut select solut thick object function exce aspir robot state desir approach target conflict robot desir approach left resolv conflict robot robot desir aspir level figur pursuit direct negoti techniqu multipl object behavior coordin cooper case robot desir approach target direct case experi conflict make situat resolv robot wander approach target direct solut give prioriti case conflict robot highest prioriti author select altern assign weight valu object function robot highest weight win conflict situat hierarchi effici case chosen altern strategi robot decid weight valu base sensori inform robot desir approach target determin rel posit attenu function distanc target object function robot weight proport distanc target impli closer robot target higher weight approach make robot farther room maneuv format robot close target system overview section briefli describ control architectur robot robot platform system implement mobil robot stack pentium processor run linux robot equip soni activ camera connect frame ring ultrason posit compass front sonar soni camera control freedom control angular absolut camera softwar architectur control approach multivalu behavior gener fuzzi express action select perform multipl object behavior coordin lexicograph approach shown advantag combin fuzzi multipl object behavior coordin behavior repertoir describ behavior safeti behavior control veloc base front sonar maintain safe speed behavior avoid behavior control head robot base sonar read maintain safe travel direct left left face behavior servo head robot base input vision face target vision system imag posit target chromat color differ target posit center imag gener error vector behavior attempt minim result robot rotat target center imag front forward left left behavior control pan angl camera angl negoti target approach target robot sensor provid distanc inform size target imag proport behavior trigger target robot field view larg triangular membership function center ang effect combin behavior approach behavior robot target direct camera straight ahead drive robot closer target robot closer turn camera head target align control camera pan angl align robot target desir surround behavior control camera pan angl express desir direct approach target forward left left left output behavior partner robot select direct rotat rotat behavior control angular veloc robot rotat left robot turn direct run circl robot target action select coordin activ behavior combin command blend mechan figur depict behavior hierarchi relationship behavior phase search approach target distinguish visibl target robot field view target search behavior activ approach behavior activ case robot safeti behavior command fusion action select wander safe rotat safeti face avoid search approach align target captur arbitr command fusion action select figur behavior hierarchi action select target acquisit task result section describ valid result trial confin lab environ setup pioneer robot section detail target acquisit manual guid dummi target futur plan autonom robot replac order log posit orient robot experi conduct overhead camera track system capabl simultan track marker posit orient lab show reliabl result success cooper target acquisit trial complet batteri experi progress valid experi target follow search search align target start target end search follow align follow align figur align behavior static target move target conduct simpl experi robot follow target result show robot search find approach direct figur field view robot camera narrow target easi lose robot close robot immedi search direct detect target find figur result valid singl robot follow pursu target group experi robot perform task result robot surround includ cooper make negoti direct robot approach target left target search follow surround follow target surround surround left left figur surround behavior static target move target figur show segment singl trial left target initi static short search robot detect target approach align end stabl format surround target figur target start move robot follow format trail plot tempor occurr event target start move robot immedi hold back path clear proce system mechan explicit coordin result interact robot constraint action select mechan futur work paper extend multipl object behavior coordin approach cooper multi robot task approach easili extend altern command fusion mechan fuzzi conclud work extend command fusion action select mechan coordin contrast behavior arbitr mechan allianc essenti coordin command fusion pursuit multipl goal multipl robot parallel demonstr command fusion produc dynam task context cooper target acquisit result valid approach produc reliabl cooper current implement emploi approach easili scale arbitrari number robot problem problem anticip larg number robot amount inform exchang futur investig strategi robot commun nearest neighbor robot task produc accept result intend investig applic approach distribut cooper search refer ronald arkin robot intellig robot autonom agent seri mit tucker balch ronald arkin format control team ieee transact robot autom uni alex andrew cooper mobil direct autonom multiobject make theori volum miguel schneider maja matar territori task ieee transact robot maja matar issu approach design collect autonom agent robot autonom decemb lynn parker cooper robot observ intellig autom soft special issu robot research oak ridg nation paolo multipl object action select behavior fusion vote phd depart medic informat imag institut electron aalborg fredrik august paolo maja matar approach fuzzi behavior coordin ieee intern symposium comput intellig robot novemb alessandro fuzzi logic autonom robot catalogu technic report universit de av cp novemb herbert simon scienc manag harper
Agents/953 1 dynam agent discoveri varga comput autom research institut hungari hu abstract issu gain import real world applic agent system bootstrap agent bootstrap mean discoveri surround world agent bootstrap import find servic dynam environ bootstrap procedur support level domain agent organ deleg bootstrap procedur agent support aim present investig question model support dynam distribut agent discoveri categori subject descriptor challeng open agent system agent orient agent applic gener term theori keyword autonom servic bootstrap introduct oper util global distribut comput system enhanc significantli web semant inform process autonom agent agent consid import model engin complex distribut system foundat intellig physic agent form produc softwar standard heterogen interact system nowadai fipa compliant agent platform implement exist test eu project practic problem found initi provid import feedback standard procedur theoret issu issu gain import agent bootstrap agent platform agent servic social agent discov build intern surround agent interact call bootstrap agent similarli talk bootstrap agent servic agent platform bootstrap static dynam bootstrap static agent build intern startup chang normal oper instal environ long time industri control system bootstrap dynam agent chang intern normal oper mobil chang environ mobil person digit assist agent bootstrap analog creat web page integr web web page link home page web site web site link web site link establish newli creat web page site procedur web peopl page creat peopl link page peopl find page heurist find home page address real world robot search web web site build catalogu web page peopl catalogu find web page observ procedur support level domain bootstrap place organ deleg bootstrap procedur agent support rest paper investig question describ model dynam agent discoveri bootstrap techniqu section discuss bootstrap techniqu web servic agent base discuss bootstrap techniqu bootstrap web servic bootstrap paradigm web servic similar distribut object system web servic descript discoveri integr registri web servic ad regist registri web servic web servic find registri basic central registri user registri locat bootstrap registri prerequisit bootstrap web bootstrap registri autom distribut web servic discoveri introduc facilit bootstrap web servic registri distribut web servic discoveri approach web servic web site deploi web servic descript standard structur refer servic descript registri servic descript web site web servic descript publish web web servic found similarli web robot search web servic descript distribut web servic discoveri approach reduc registri discoveri problem web site discoveri work human bootstrap agent system earli agent architectur archon focu servic discoveri design approach applic archon architectur result agent system static agent relationship structur repres agent acquaint modul agent approach agent relationship structur agent relationship structur determin design focu agent relationship structur chang run agent bootstrap import issu gaia agent design methodolog similar trait accord fipa agent servic provid agent agent deploi agent platform agent regist servic directori facilit platform creat start provid servic df solv agent agent servic discoveri problem singl platform platform discov mean global fipa approach reduc bootstrap problem platform bootstrap problem investig london fipa meet platform bootstrap publicli platform address web site network servic darpa agent markup languag base web servic ontolog approach semant markup servic creat publish web site idea search engin search servic locat servic automat build servic registri approach extend current web search approach semant inform agent servic servic registri servic match algorithm bootstrap techniqu discuss bootstrap approach characterist bootstrap assist central repositori built human robot shown figur bootstrap technolog agent system reli central global registri central natur registri fault toler agent central registri bootstrap number agent agent system central registri bottleneck directori servic domain level figur extern assist bootstrap situat agent search global registri built global registri gener specif problem solv agent arriv town person assist agent task reserv hotel assist agent result local hotel reserv servic find hotel world wide global registri discov bootstrap local servic bootstrap improv find wai establish direct link directori servic peer discoveri servic solv initi list peer contact agent system knowledg base techniqu construct initi contact list human bootstrap techniqu order investig agent discov bootstrap desir agent servic real world scenario scenario person chang monei monei chang bank account bank web site url web site web site similar url countri code end visit web page find monei exchang rate compar rate select bank exchang rate visit web site bank exchang rate find page describ chang monei scenario user servic specif user gener user gener servic registri built robot find registri servic closest user specif user person result environ specif monei exchang observ user specif human bootstrap techniqu base current knowledg state user user knowledg rule trial failur success cycl incomplet knowledg discuss task deleg agent agent complex adapt dynam environ knowledg base discoveri identifi kind bootstrap extern assist knowledg base extern assist bootstrap reason activ human aid shown figur knowledg base bootstrap reason activ insid satisfi dynam environ section model support knowledg base agent discoveri agent bootstrap system architectur agent bootstrap system architectur agent domain knowledg agent acquaint model agent engin shown figur agent engin servic gent registri domain knowledg base agent acq model figur knowledg base bootstrap architectur embodi algorithm part rest compon store knowledg bootstrap compon part agent function knowledg base bootstrap architectur work system massiv amount singl agent store inform local environ mobil agent system model inform current locat agent model agent model store knowledg state past agent knowledg base plai role depend situat bootstrap relev inform util knowledg base deduc inform previou experi agent knowledg servic agent import agent servic descript agent domain knowledg base domain knowledg base store knowledg problem solv agent model histori domain knowledg base deduc inform futur activ agent monei exchang domain knowledg base inform bank monei exchang servic servic descript address inform servic obtain direct contact servic descript page agent platform web global directori registri built robot approach includ wai obtain servic agent bootstrap architectur util advantag approach agent engin rule retriev servic descript address rule util convent agent system requir system stick convent monei exchang servic address creation mean creation home page web address bank servic descript agent engin retriev servic descript servic provid servic registri monei exchang correspond navig web site bank knowledg base bootstrap servic descript base servic descript includ servic input result locat servic access point servic servic agent engin put retriev servic inform acquaint model agent notifi agent servic bootstrap agent servic normal retriev servic inform acquaint model agent bootstrap algorithm agent bootstrap algorithm execut agent engin servic agent engin read domain knowledg base relat read histori agent model check relat servic util agent relat servic util agent servic descript address servic servic descript address relat servic util agent servic descript engin creat servic descript address base rule thumb relat servic util engin gener servic registri address engin contact servic descript address queri descript desir servic return servic descript engin extract servic locat servic contact point store agent acquaint model paper investig bootstrap problem agent bootstrap import problem applic test bed fipa compliant agent instal point bootstrap techniqu dynam chang environ type bootstrap call knowledg base bootstrap support dynam distribut agent discoveri identifi import compon knowledg base bootstrap procedur note convent agent deploi issu dynam distribut agent servic discoveri import knowledg base bootstrap practic argu agreement compon usag agent system usag recommend acknowledg paper initi earlier challeng work archon agent architectur shape idea fipa discuss project meet budapest node comment anonym review public support grant refer tim jame hendler semant scientif american omicini wooldridg softwar engin coordin agent klusch springer open standard system softwar worldwid open agent agentlink http nr eh archon develop dai applic electr transport manag particl ieee vol pp fipa platform handheld mobil agent languag eighth intern august paramount usa web execut technic white paper discoveri integr busi execut technic white paper overview web servic inspect distribut web servic discoveri ftp architectur multiag system elli nr intellig system cooper commun electr expert system vol elsevi scienc pp kinni methodolog analysi journal autonom agent multiag system foundat intellig physic resolut london april daml servic coalit semant markup web intern semant web work symposium juli tc son semant web ieee intellig special issu semant vol pp dynam servic matchmak agent open inform journal acm sigmod special issu semant global inform sheth mobil agent network resourc discoveri newslett acm sig vol summer te practic ibm ve
ML/954 6 mixtur linear subspac face detect abstract present method mixtur linear subspac face detect grai level imag method mixtur factor analyz concurr perform cluster perform local reduct paramet mixtur model estim em algorithm face detect probabl input sampl prede ned threshold mixtur subspac method kohonen map cluster fisher linear discrimin optim project gaussian distribut model densiti function project sampl class paramet densiti function maximum likelihood estim rule base maximum likelihood wide rang face imag includ di erent di erent express di erent light condit train set captur variat human face method test set imag face result rst dataset show method perform method fewer detect introduct imag human face central intellig human comput interact research involv face includ face face pose express recognit gestur recognit exist method topic assum human face imag imag sequenc identi ed local build fulli autom system extract inform imag human essenti develop robust algorithm detect human face singl imag sequenc goal face detect identifi locat human face pose light condit challeng problem human face highli object high variabl color textur recent method face detect detect frontal face light condit present face detect method mixtur linear subspac detect face di erent featur di erent di erent light condit imag human face lie complex subset imag space model singl linear mixtur linear subspac model distribut face pattern rst detect method extens factor analysi factor analysi statist method model covari structur high data small number latent analogu princip compon analysi unlik de ne proper densiti model data cost code data point equal princip compon subspac densiti unnorm pca robust independ featur data princip compon maxim varianc input retain unwant variat hinton al appli fa digit recognit compar perform pca fa model mixtur model factor analyz recent extend appli face recognit studi show fa perform pca digit face recognit light ect human distribut face imag space repres mixtur subspac subspac captur characterist face present probabilist method mixtur factor analyz detect face wide variat paramet mixtur model estim em algorithm method present fisher linear discrimin project sampl high imag space lower featur space fisherfac method shown outperform wide eigenfac method face recognit reason project pca train face sampl class kohonen organ map label scatter matric gener optim project base gaussian model densiti function paramet estim base maximum likelihood detect input imag scan rectangular window probabl comput maximum likelihood rule determin face detect captur variat face set face imag olivetti umist harvard yale feret method test compar perform method result data set consist imag show method perform report method fewer detect test collect set imag face data set challeng pro le face express face heavi shadow method detect face facial express light condit method fewer detect method relat work numer method recent detect human face singl imag sequenc imag give review face detect method survei face detect sung poggio report learn approach locat vertic frontal view human face number gaussian cluster model distribut face pattern comput subspac span cluster eigenvector comput evid face small window move portion imag base distanc metric measur face exist window detect algorithm combin templat match detect method hierarch markov random eld maximum posteriori probabl estim algorithm segment imag xed scale gener imag pyramid reduc heurist select area face layer process ect priori knowledg spatial relationship facial featur mouth identi ed templat match gradient intens detect base map estim huang appli kullback rel inform maxim discrimin posit neg exampl face famili discret markov process model face background pattern estim densiti function detect face base likelihood ratio comput train moghaddam pentland probabilist method base densiti estim high space eigenspac decomposit rowlei al ensembl neural network learn face pattern face detect schneiderman al describ probabilist method base local princip compon analysi method preliminari result pro le face detect hidden markov model higher order statist support vector machin appli face detect demonstr success detect upright frontal face light condit mixtur factor analyz rst mixtur model factor analyz train sampl em algorithm obtain distribut face pattern detect input imag scan rectangular window probabl current input face pattern calcul face detect probabl prede ned threshold brie describ factor analysi mixtur factor analyz section detail model found factor analysi factor analysi statist model observ vector partit unobserv systemat part unobserv error part systemat part linear combin small number unobserv factor variabl compon error vector consid uncorrel independ point factor analysi descript interdepend set variabl term factor regard observ variabl observ data vector model vector factor gener smaller gener model factor load matrix factor assum distribut independ normal unit random variabl distribut diagon due assumpt observ variabl independ factor distribut covari goal factor analysi model covari structur factor variabl model correl element variabl account independ element factor plai role princip compon inform project data expect factor comput linear xx mixtur model mixtur factor analyz factor analyz number factor factor analyz di erent gener model obei mixtur paramet mixtur model vector adapt mix latent variabl model factor mixtur indic variabl data point gener rst factor analyz set train em algorithm estim em comput expect interact hidden variabl log likelihood jx de ning ij equat obtain ij equat obtain jx ij em algorithm mixtur factor analyz state comput jx data point mixtur compon solv set linear equat mixtur factor analyz essenti reduc mixtur gaussian factor analyz ts gaussian portion weight posterior ij covari matrix gaussian speci ed lower factor load model paramet dedic model covari structur high dimens detect face pattern detect input imag scan rectangular window probabl face pattern estim equat face detect probabl prede ned threshold order detect face di erent input imag repeatedli subsampl factor scan iter mixtur linear space fisher linear discrimin mixtur rst kohonen map divid face sampl face class gener label sampl fisher project comput base class maxim ratio scatter scatter label train set project high imag space lower featur gaussian distribut model densiti function figur canon face face class class paramet estim maximum likelihood principl condit probabl sampl class comput maximum likelihood principl decid class sampl belong reason face class size train set number class cluster result poor sampl estim densiti function larg number class label sampl som appli fisher linear discrimin class label train sampl inform train sampl kohonen map divid face sampl nite number class divid face sampl imag class nal weight vector node centroid prototyp correspond canon face class procedur appli sampl figur show canon face class clear sampl face imag di erent pose di erent light condit lower corner upper left classi ed di erent class fisher linear discrimin pca commonli project face pattern high imag space lower featur drawback approach de ne subspac greatest varianc project sampl vector subspac project suitabl classi cation princip compon retain unwant larg variat class project space cluster fisher linear discrimin class speci method optim project classi cation nding project maxim project determin maxim ratio scatter scatter classi cation simpli ed project space demonstr fisherfac method outperform eigenfac method face recognit scatter matrix de ned sb scatter matrix de ned sw class number sampl class optim project chosen matrix orthonorm column maxim ratio determin scatter matrix project sampl determin scatter matrix project arg max jw jw sw wm fw ji mg set gener eigenvector sb sw largest gener eigenvalu ji mg rank sb sum matric rank upper bound detail method overcom singular problem comput densiti function label train set project featur gaussian distribut model densiti ccd maximum likelihood jx yk jx yk detect face pattern input imag scan rectangular window determin face exist window rule decid input window face base maximum arg max detect face di erent input imag repeatedli subsampl factor scan iter experi set face imag olivetti umist harvard yale feret wide variat facial express light condit sampl mixtur start exampl imag extrem collect repres set bootstrap method includ exampl train face sampl manual crop normal align vertic size pixel make detect method sensit scale rotat face exampl gener origin sampl imag produc randomli rotat imag scale produc face sampl test method set imag collect rowlei sung tabl show detect rate method report result detect method test set result test set consist imag exclud imag hand drawn show method compar detect perform fewer detect tabl show result test set sung poggio consist imag exclud imag line drawn face method consist perform detect test set consist imag collect world wide di erent express face heavi shadow detect rate method number detect method perform equal detect face method perform slightli rst figur show result method test imag web page mention result notic detect upper left corner imag figur window resembl face notic method pro le face face heavi shadow rotat face face detect ectiv method due lack exampl train set exist detect method ectiv detect type face recent method detect rotat face method detect occlud face face heavi shadow discuss method mixtur linear subspac method detect human face facial express light condit method project facilit classi cation face pattern rst method ts mixtur factor analyz estim densiti function face method map partit train set class fisher linear discrimin optim project cation result set imag demonstr method perform algorithm detect upright frontal fewer detect contribut paper summar introduc project method tabl result imag test set imag schneiderman rowlei detect detect detect detect detect rate detect rate detect rate detect rate detect rate detect tabl result imag test set imag schneiderman rowlei sung osuna detect detect detect detect detect detect rate detect rate detect rate detect rate detect rate detect rate detect figur sampl result mixtur factor analyz imag test set detect face shown window figur sampl result mixtur subspac fisher linear discrimin imag test set detect face shown window perform pca classi cation linear subspac appli mixtur model linear subspac captur variat face pattern method appli mixtur pca project optim classi cation subspac clear svm perform face detect studi appli svm small test set face great interest compar method svm larg test set svm aim optim hyperplan minim gener error theoret upper bound refer anderson introduct multivari statist analysi john kriegman eigenfac recognit class speci linear project ieee tran pattern anal mach huang face detect maximum discrimin ieee comput societi confer comput vision pattern page rubin maximum likelihood incomplet data em algorithm royal statist duda hart pattern classi cation scene analysi john huang mixtur local subspac face recognit ieee comput societi confer comput vision pattern page ghahramani hinton em algorithm mixtur factor analyz technic report depart comput graham virtual gener face recognit face theori volum nato asi seri comput system page deform model face recognit arbitrari light condit phd harvard model manifold imag handwritten digit ieee tran neural kohonen organ map moghaddam pentland probabilist visual learn object recognit ieee tran pattern anal mach girosi train support vector applic face detect ieee comput societi confer comput vision pattern page poggio gener object detect intern confer comput page rauss feret evalu face theori volum nato asi seri comput system page qian huang object detect hierarch map estim ieee comput societi confer comput vision pattern page patil find face photograph sixth intern confer comput page kanad neural face detect ieee tran pattern anal mach kanad rotat invari neural face detect ieee comput societi confer comput vision pattern page face recognit hidden markov model phd schneiderman kanad probabilist model local spatial relationship object recognit ieee comput societi confer comput vision pattern page sung poggio learn human face detect ieee tran pattern anal mach kriegman face detect method work paper
HCI/955 4 consist data mobil client local cach edward leung au depart comput scienc citi hong kong tat chee hong kong abstract data broadcast shown effici method dissemin data item mobil comput system larg number issu ensur currenc consist data item examin adequ data item updat transact instal valu execut updat transact broadcast data item interleav mobil gener mobil observ inconsist data valu design broadcast method call order updat order mobil comput system mobil transact consist sequenc read oper mobil transact receiv consist data valu newest version data item ensur consist maxim currenc cach aim reduc access delai mobil transact compar perform effici broadcast cach method invalid method result show offer perform aspect introduct ow constraint mobil comput asymmetr limit power suppli design effici cost effect mobil comput system pose challeng import issu effici dissemin consist data item broadcast server call mobil transact gener mobil client recent effici data dissemin method base data broadcast broadcast server period continu broadcast data item mobil client data mobil transact inform broadcast server access data item data item broadcast advanc data manag tm tata publish compani data item mobil comput system record inform current traffic condit trade price stock valu highli dynam updat captur current inform system refresh valu data item execut updat interleav data broadcast import maintain data item access data item undesir significantli affect inform mobil client concurr execut updat data broadcast problem concurr control address result execut schedul mobil updat transact consist data item provid mobil client result provid inconsist inform mobil client case mobil client exchang rate dollar uk pound york london time return result repres inform time mobil client make wrong trade inform trade price stock consist stock rise trade price stock stock index mobil client frustrat correct convent concurr control phase optimist method timestamp order suitabl mobil comput system overhead set lock detect data conflict mobil environ heavi studi problem dissemin consist data item mobil transact updat perform concurr broadcast server recent concurr control data broadcast receiv grow interest effici pioneer method broadcast multipl version data item consist data item provid mobil transact requir mobil transact read data item commit point broadcast cycl basic broadcast method extend system client cach multipl version data item maintain read cach data commit data access delai reduc time data consist ensur effici method concurr control mobil transact updat transact data scheme call updat order provid updat valu data item mobil transact time maintain serializ execut updat mobil design mobil transact oper unord extend protocol order mobil transact data requir order issu access consist cach item address perform extens simul experi compar perform broadcast method invalid method invalid report broadcast broadcast server mobil client valid access data item mobil transact summari contribut protocol extend mobil transact read oper enhanc base invalid scheme suggest access consist data client extens simul experi perform result shown outperform broadcast method invalid method organ remain part paper section review relat work broadcast consist data item section describ system model section defin correct criteria illustr problem data inconsist data broadcast exampl section introduc protocol detail discuss properti implement overhead section compar perform broadcast cach method invalid method simul paper conclud section relat work mobil comput subject research recent year lot effort devot design data broadcast algorithm import issu broadcast consist data item receiv adequ attent uncontrol data broadcast result client read inconsist data item provid consist data item transact import requir transact process system tradit concurr control protocol suitabl mobil comput system due heavi overhead detect data conflict mobil environ studi area suggest solut relax consist requir consist model semant relat data group data item insid cluster mutual consist inconsist data item cluster control matrix data conflict resolut data matrix size broadcast control matrix broadcast data item mobil client perform consist check matrix read data item method handl transact updat transact write oper perform local copi data item client end transact includ read write oper cycl number perform server commit method detect problem broadcast serial graph client maintain local serial graph ensur schedul commit transact serializ updat transact broadcast server drawback method heavi overhead broadcast serial graph data conflict server broadcast client listen transmiss channel continu maintain updat serial graph lead affect correct maintain serial graph client disconnect mobil network disconnect frequent disconnect occur mobil client base mobil client obtain updat serial inform make virtual imposs ensur serializ transact execut method similar broadcast serial graph method invalid method invalid report period broadcast broadcast cycl invalid report consist list includ data item updat broadcast server previou broadcast cycl valid data item access mobil transact ensur check invalid report transact restart case access data item invalid broadcast method server broadcast previou version data item addit commit version data item broadcast cycl mobil transact access data latest version read oper subsequ read oper transact read data item largest version number smaller equal data version oper transact read older version data data consist ensur mobil transact receiv latest data item order reduc number version broadcast facilit check updat transact updat end broadcast cycl arriv middl broadcast cycl number version broadcast data item determin transact defin maximum number broadcast cycl transact read data import assumpt broadcast method current broadcast data item cycl broadcast method extend system client cach addit broadcast multipl version data client maintain previou version data item cach number version maintain client cach determin lifespan transact rule access broadcast data access cach item effici characterist broadcast method compar method serial graph broadcast examin broadcast method system mobil client frequent disconnect mobil network mobil client access cach data item disconnect data item consist system model mobil comput system model consist broadcast number mobil client mobil network shown figur broadcast server commun mobil client low bandwidth wireless channel mobil network broadcast server maintain import properti data item mobil comput system valu highli dynam maintain inform trade price stock locat move object maintain valid data updat transact gener refresh data valu assum updat gener extern captur provid data reuter updat transact gener time sensor devic repres snapshot extern environ updat gener record data item version number broadcast server mobil network mobil client figur system model assum updat transact short consist write stock quot updat arriv rate high assum concurr control phase lock concurr control updat transact broadcast server broadcast server period broadcast data item continu end broadcast cycl broadcast cycl cycl immedi length broadcast cycl fix variabl depend adopt broadcast schedul algorithm broadcast algorithm adopt select data item broadcast effici broadcast algorithm base deadlin transact access frequenc data item method depend broadcast algorithm adopt appli broadcast algorithm mobil client issu mobil transact access data item assum mt consist sequenc data request simplifi oper assum requir access data item mt defin deadlin period arriv time transact deadlin call assum set mobil transact defin system perform requir assum mt total useless deadlin abort deadlin assum result mobil transact report request mobil client commit time mobil transact abort restart atom properti maintain perform undo oper transact broadcast process model long readonli call broadcast transact length bt defin base mobil transact time requir broadcast data item equal mobil transact data item set bt includ data item broadcast period time mobil current time reason mobil transact defin length broadcast transact normal case mobil transact finish note broadcast transact possess characterist transact reason treat transact facilit discuss mechan correct protocol introduc section assumpt system model summar updat transact process broadcast server arriv rate updat transact high sporad mobil transact read oper mt order result mobil transact report request client commit time mobil transact arriv time import complet mobil transact deadlin useless broadcast process model broadcast transact correct criteria problem correct introduct strategi broadcast consist data item mobil identifi correct requir protocol fundament requir dissemin data item mobil consist currenc adopt serializ correct criterion consist commonli convent system wide accept commun serial graph set transact schedul serializ concurr control updat transact assum concurr control inconsist problem data conflict mobil transact updat transact protocol concentr resolv type data conflict ensur mobil transact read consist data valu import properti mobil comput applic valu data item highli dynam arriv rate updat high data valu broadcast server mobil updat arriv valu instal dynam difficult maintain tight consist statu object extern environ valu data item due delai complet updat process true updat gener remot site stock monitor updat gener stock exchang data vendor maintain stock assum delai transmit updat gener delai due resourc data content server stale inform mobil client order minim stale system process updat transact broadcast latest commit data item provid updat valu data item mobil network altern bound data item bound data stock data valu total useless time bound note requir gener previou studi import due realtim properti data item data inconsist problem briefli describ inconsist problem data broadcast repres exampl data conflict mt updat transact updat updat data item data item mobil read schedul broadcast mt read updat updat broadcast mt read mobil transact mt observ inconsist data valu serial graph cyclic mt mt reason mt read data conflict updat read conflict data updat mt conflict updat transact serial order updat transact mobil transact final serial graph cyclic due transit depend updat updat updat schedul broadcast broadcast mt read updat updat updat updat broadcast broadcast mt read serial graph cyclic mt involv broadcast cycl mt find requir data item singl broadcast cycl occur broadcast transact schedul broadcast broadcast cycl mt read end broadcast cycl updat updat broadcast broadcast cycl mt read serial graph cyclic mt order updat order method overview updat order protocol broadcast consist data item mobil transact unord read mobil transact consist set read oper oper execut order extens call order mobil transact read oper order issu access consist cach data item process oper disconnect address transact tj read uncommit data item transact depend basic principl protocol ensur data conflict occur broadcast transact updat transact serial order bt mobil transact read data item broadcast serial order broadcast transact mobil transact bt mt serial order updat transact mobil transact mt schedul serializ correct protocol discuss detail section protocol consist execut updat conflict resolut updat broadcast transact execut updat transact execut updat transact divid execut phase updat phase execut oper updat transact execut data conflict updat transact resolv convent concurr control protocol valu write oper transact written privat workspac transact immedi oper updat transact enter updat phase perman updat perform copi valu privat workspac data conflict broadcast transact check updat phase perform critic section updat transact adopt resolv data conflict updat transact optimist approach detect conflict broadcast transact import advantag divid execut updat transact phase significantli reduc block probabl delai broadcast transact broadcast transact read data lock updat transact updat broadcast transact block updat transact commit base principl updat hold block due data conflict updat transact due transit block time broadcast transact long divid execut updat transact phase greatli reduc block probabl block time broadcast transact data conflict updat broadcast transact occur updat transact updat shorter detect data conflict updat broadcast transact easier updat system data item access updat transact note mobil broadcast transact data conflict facilit discuss protocol assum data conflict transit depend relationship occur mobil transact updat transact compar write set updat transact read set broadcast system easili determin data conflict conflict resolut updat broadcast transact data conflict updat transact broadcast transact detect updat transact enter updat phase resolv conflict serial order bt desir bt detail algorithm broadcast server mobil client shown section algorithm broadcast server defin algorithm broadcast server perform updat transact enter updat phase bt bt depend data item bt data item endif bt set data item broadcast bt set data item updat conflict data serial order broadcast transact updat transact note section set data item broadcast transact consist data broadcast period time mobil current time set data item broadcast transact fix broadcast data data item includ data item broadcast transact remov algorithm mobil client data item request mt repres sequenc read oper process mt start read oper sequenc data item receiv bt match request data item execut oper mt read data item oper process process repeat read oper oper sequenc case data mt wait data mt restart oper request data item execut oper reason restart ensur serializ order mt reason provid updat data valu mobil transact algorithm mobil client shown assum mt read data item bt cach client discuss case access cach data item data item requir oper mt loop mt exhaust read data item bt broadcast mt process updat mt mt mt repeat process updat mt restart execut oper requir endif endif data item request oper mt end loop mt sequenc read oper mt mt set data item access mt consist currenc check cach data benefit cach data item mobil transact read request data item directli broadcast mobil transact wait long time wait time depend broadcast algorithm adopt size flat broadcast disk potenti perform problem mobil transact restart access data item broadcast commit restart mobil transact greatli time wait data item broadcast transact solv problem reduc restart mobil client maintain data item cach case mobil transact restart due arriv version access data restart transact immedi access data item cach wait broadcast transact mobil transact access data data item client cach cach cach replac recent invok mobil transact find requir data item client access data item result shorter access delai assum scheme adopt maintain valid cach data item data item broadcast cach copi data cach copi refresh version broadcast invalid report base consist check cach data item effect improv perform transact determin currenc consist cach item access data item describ invalid report method combin protocol consist data item access mobil transact ensur gener invalid report invalid report prepar period broadcast broadcast server invalid report includ latest updat ident set data updat interv time report current updat occur report durat assum data updat time report useless invalid report shift call report report time report durat chosen greater report period slide window approach gener report solv problem valid disconnect mobil transact valid access data item disconnect network period longer report durat ident updat data item repeat invalid report period equal report durat note larg report report size greatli size depend number updat occur report period worst report includ data item updat report durat figur data item broadcast time prior broadcast transact report durat updat current report durat data item invalid report includ data item updat time updat includ valid assum mobil client put broadcast data item record broadcast time data item base broadcast cach data item divid newest version unknown version data item belong newest version group broadcast time length broadcast transact current time classifi unknown version group transact access data transact access data item immedi found cach data item retriev broadcast transact mobil transact complet check valid access data item belong newest version transact commit immedi belong unknown version mobil transact commit receiv invalid report valid access data item valid compar access data item cach time access data item data item invalid report data item invalid found invalid report data item valid report greater mobil transact restart read invalid data item note number data item belong newest version group reduc block delai mobil length broadcast transact mean larger set data item check data updat transact broadcast transact tradeoff smaller number mobil transact valid invalid larger number base total overhead longer broadcast transact report period report durat set data item check set updat item set data item check set updat item broadcast transact broadcast broadcast report current report time updat figur gener invalid report practic problem implement period invalid report definit report period paramet repres tradeoff bandwidth valuabl broadcast invalid report wait time transact report report size small expect consum period broadcast report set small order reduc wait time valid implement overhead characterist correct theorem schedul commit transact produc protocol serializ proof consist part show serial order commit mobil transact conflict updat transact mobil transact read conflict data item broadcast transact prove serial order mobil transact updat transact mobil transact read conflict data item cach bt mobil broadcast transact updat data conflict bt broadcast conflict data item updat data serial bt bt conflict data item immedi serial order reset bt broadcast serial order bt mt read data item serial order bt mt serial order serial order mt mt data conflict mt conflict data item broadcast length broadcast transact mt read data cach data item broadcast prior serial order mt mt mt mt restart check invalid report serial order mt mt serial graph edg mt contradict qed obviou currenc data item observ mobil transact maxim due data mechan data item broadcast length broadcast transact updat version implement overhead characterist discuss implement overhead characterist protocol protocol requir mobil client data item maintain cach item main overhead protocol execut updat transact check data set broadcast transact updat transact updat transact enter updat gener invalid conflict data item item broadcast start updat phase updat transact divid execut updat transact phase trivial incur addit overhead similar defer updat approach overhead check conflict data set probabl data conflict low number data item updat updat transact small speed check data item updat sort id main overhead protocol data number depend probabl data conflict turn depend broadcast arriv rate updat pattern updat transact algorithm mobil client simpl incur addit overhead check addit work replac version data item case record broadcast time check invalid report case transact access data item belong unknown version group main advantag compar broadcast method summar perform method examin detail perform evalu experi report section consist broadcast method ensur execut schedul transact serializ currenc maxim currenc data item read mobil transact data item provid broadcast method updat version provid commit valu broadcast cycl updat perform end broadcast cycl main overhead main overhead broadcast due broadcast multipl version data item multipl version data item cach factor significantli broadcast overhead factor reduc cach hit probabl client cach fill multipl version data item distinct item drawback mobil cach size small util effici main overhead due data broadcast algorithm broadcast requir cycl includ data item appli broadcast algorithm broadcast subset data item disconnect import properti mobil network frequent voluntari involuntari voluntari mobil client initi disconnect order conserv power mobil machin voluntari disconnect mobil client occur complet transact affect mechan creat problem correct protocol involuntari disconnect result instabl mobil network cellular radio strength signal receiv mobil client affect number factor distanc mobil client base height surround build disconnect occur signal receiv mobil client lower threshold level disconnect impact consist transact execut main impact network disconnect time mobil client disconnect network mobil client version data item serializ order mobil transact updat transact data result schedul mobil client temporarili disconnect mobil transact access data item belong unknown version group valid invalid report disconnect greater check window mobil transact identifi valid access data item invalid report cach data item consid invalid discard cach data item case significantli affect system perform broadcast index structur import issu design data broadcast algorithm minim tune time broadcast data affect power consumpt mobil machin suggest previou work design data broadcast index organ broadcast cycl insert head broadcast cycl mobil client tune index base broadcast determin requir data item mobil transact broadcast broadcast data turn mode order minim power consumpt mobil machin wake broadcast requir data item mechan protocol affect effici broadcast index broadcast data item delai due order minim impact data broadcast set maximum broadcast bandwidth data broadcast cycl maxim addit delai data item origin broadcast schedul bound maximum broadcast equal broadcast cycl set maximum bandwidth hand affect correct protocol conflict order case conflict updat transact broadcast transact maximum bandwidth reach ensur correct maximum bandwidth broadcast server broadcast addit piec inform broadcast cycl system broadcast signal period inform mobil client stop execut mobil transact check invalid report access data item period broadcast signal short mobil transact inform commit conflict updat transact broadcast broadcast server broadcast ident conflict item valu item origin protocol mobil determin valid cach data item data item access transact base broadcast data ident ident small affect broadcast schedul ensur currenc access data mobil transact commit immedi wait invalid report maximum bandwidth affect power consumpt mobil chosen base probabl data conflict amount power save mode compar power consumpt level activ total power suppli mobil machin power suppli highli critic larger maximum bandwidth order gain advantag mechan protocol perform studi perform simul studi investig perform protocol compar broadcast cach method period invalid report method reason compar algorithm repres extrem tradeoff concurr currenc shown mv high concurr low currenc ir high currenc low concurr definit updat mv ir perform end broadcast cycl number version broadcast number version creat period time mobil current time similar experi set client cach reserv version data item remain version cach recent polici cach replac note found previou version data item put secondari perform store version practic mobil palm handheld secondari memori implement ir similar invalid scheme gener invalid report fix end broadcast cycl updat perform end cycl implement simul simul languag base program model mv ir extens simul experi perform investig impact updat data access pattern updat cach size size perform protocol simul model model consist main entiti process shown figur main entiti broadcast air media mobil client process broadcast broadcast process server updat process main process client process mobil client simul mobil transact broadcast server locat broadcast server assum item size item uniqu identifi updat indic updat time air media air media collect air channel assum schedul broadcast item item share broadcast channel mobil client larg number mobil client gener transact client gener transact time gener mobil transact exponenti distribut time complet transact updat updat item server updat process updat item data figur simul model broadcast process broadcast item mobil client broadcast process broadcast process defin broadcast select data item broadcast assum flat broadcast disk model simplifi model analysi broadcast cycl includ data item server updat process server updat process gener updat transact data item updat updat transact assum follow zipf distribut commonli studi area server updat process resolv data conflict updat transact mobil client process mobil client process gener mobil transact assum mobil transact defin deadlin set arriv time transact assum complet mobil transact significantli affect deadlin total useless deadlin transact abort deadlin transact consist sequenc oper oper requir access data item assum data access pattern oper zipf distribut mobil transact access requir data item oper cach find data item listen broadcast cycl continu data item requir data transact access cpu comput process oper mobil transact complet commit model paramet perform measur model paramet tabl list model paramet baselin valu paramet baselin size data item mobil client broadcast rate data item sec cach size data item cach replac scheme lru data access distribut mobil updat zipf distribut skew access distribut offset data access distribut mobil updat transact oper mobil transact write oper updat transact invalid report gener period ir sec report durat sec mobil transact sec time mobil client sec time updat transact sec tabl model paramet ad baselin valu perform measur primari perform measur miss time stale access rate miss rate defin number miss deadlin divid total number transact gener capabl meet time requir transact stale access rate defin number stale data read data latest updat divid total number data access import measur currenc data item observ mobil transact addit primari measur statist cach hit broadcast restart rate investig perform characterist protocol broadcast overhead captur amount broadcast bandwidth consum protocol broadcast overhead percentag bandwidth data item due data conflict overhead broadcast invalid report broadcast overhead percentag broadcast bandwidth broadcast version data newest version restart rate defin number transact restart total number transact complet mobil transact restart check invalid report mobil transact restart due perform result discuss impact updat workload figur show impact updat interv perform mv skew coeffici zipf distribut adopt updat transact mobil transact offset set zipf distribut mobil transact updat transact set hot data item note skew coeffici number hot data item figur figur time miss rate protocol gradual updat interv consist expect updat interv reduc updat workload data conflict probabl updat mobil transact lower consequ lighter workload lower broadcast overhead smaller number restart ir observ figur figur depict figur figur perform time miss mv ir perform compar mv due higher cach hit rate shown figur broadcast overhead higher mv shown figur updat workload heavi multipl version data item maintain cach significantli reduc number data item lead smaller cach hit rate broadcast multipl version data item broadcast overhead import advantag mv provid higher data currenc mobil transact shown figur stale access rate remain stale access rate mv workload heavi skew coeffici equal mobil transact observ valu mv drop stale access rate skew coeffici due low updat frequenc data item perform ir similar mv skew coeffici equal ir mv skew coeffici equal due higher cach hit rate lower broadcast restart rate higher mv stale access rate ir lower shown figur cach maintain updat version data item version invalid invalid report period figur figur show perform ir mv skew coeffici larger skew coeffici affect number hot data item reduc skew coeffici number hot item reduc cach hit rate shown figur figur figur show perform protocol offset zipf function updat mobil transact set type transact set hot data item consist previou perform time miss mv ir shown figur perform ir mv due larg number restart figur figur show result length mobil transact oper oper consist result previou perform length overhead protocol restart probabl transact ir higher number restart larger restart cost low restart transact find requir data item cach impact cach size figur show perform protocol client cach size cach size improv perform protocol shown figur figur due higher cach hit rate shown figur consist result previou perform mv ir shown figur figur smaller time lower miss rate perform due higher cach hit rate lower broadcast overhead differ perform greater updat workload heavier poor time ir due restart natur protocol size size length broadcast cycl flat broadcast disk broadcast cycl includ data item number hot data item larger due larger conflict probabl lower figur show result size data item observ perform protocol degrad larger due longer broadcast cycl mobil transact wait longer data item find requir data item cach lower cach hit rate number hot data item larger perform remain consist mv ir miss rate stale access rate size larger data broadcast shown effici method dissemin data item transact gener mobil client research design broadcast algorithm receiv lot attent previou concurr control issu larg broadcast data item execut updat transact import maintain valid data item mobil transact observ inconsist data valu studi issu concurr control updat transact mobil consist order oper protocol call order updat order protocol effect maintain schedul updat mobil transact serializ time maxim currenc data item observ mobil transact unlik version effici protocol broadcast consist data item mobil appli broadcast algorithm impact mechan mobil client cach data manag mean implement easili mobil broadcast system order investig perform characterist simul model mobil comput system data broadcast implement experi perform investig impact system paramet perform compar broadcast cach method invalid method result show significantli outperform effici method term time mobil transact miss rate import advantag data item gener current broadcast method acknowledg work paper partial support grant research grant council hong kong special administr china grant refer data manag asymmetr commun acm push pull data acm concurr control recoveri publish broadcast protocol support power conserv retriev mobil user intern confer data pp dissemin data asymmetr commun euromicro confer june push technolog acm sigmod comparison index method data broadcast intern confer inform algorithm schedul singl multipl channel data technic report depart comput feb wireless challeng data commun vol oct sand organ ieee transact knowledg data vol pp evalu transact manag issu mobil comput edward consist data transact mobil ieee workshop mobil comput system feb hv broadcast strategi multipl wireless intern confer inform knowledg page novemb hv cach comput vol page consist data mobil distribut intern confer distribut comput pp process transact broadcast intern confer distribut version handl updat broadcast larg data base sept transact wireless workshop mobil distribut august liang tempor coher virtual data system concurr control broadcast acm sigmod intern confer manag june data manag mobil intern workshop issu applic technolog juli queri track mobil distribut parallel vol fernandez effici time dissemin data mobil ieee technolog applic updat interv mv mv ir ir figur time skew coeffici broadcast overhead mv mv ir ir updat interv figur broadcast overhead skew coeffici stale access rate mv mv ir ir updat interv figur stale access rate skew coeffici updat interv figur time offset mv mv ir ir miss rate updat interv figur miss rate skew coeffici restart rate mv mv ir ir updat interv mv mv ir ir figur cach hit rate skew coeffici cach hit rate updat interv figur restart rate skew coeffici miss rate mv mv ir ir mv mv ir ir figur miss rate offset updat interv mv mv ir ir updat interv figur time length mobil transact mv updat mv updat ir updat ir updat updat updat cach size figur time cach size cach hit rate cach size figur cach hit rate cach size miss rate mv updat mv updat ir updat ir updat updat updat updat interv figur miss rate size mv mv ir ir miss rate mv mv ir ir updat interv figur miss rate length mobil transact miss rate mv updat mv updat ir updat ir updat updat updat cach size figur miss rate cach size mv mv ir ir updat interv figur time size cach hit rate mv mv ir ir updat interv figur cach hit rate size
HCI/956 4 support creativ advanc user interfac ben shneiderman juli depart comput interact institut advanc comput studi institut system research maryland colleg md usa posit paper nation scienc foundat european commiss meet humancomput interact research june franc publish book form abstract challeng interact research user interfac design construct inform technolog support creativ ambiti goal attain design build adequ understand creativ process paper describ model framework gener learn previou work store digit consult peer mentor middl late stage evalu solut dissemin result contribut digit integr activ requir interact research advanc user interfac design paper concentr techniqu inform visual support creativ work enabl user find relev inform identifi desir item discov pattern collect describ inform visual method question perceptu cognit collabor hcil technic report introduct ambiti vision shape concret research agenda bush vision system support memori inspir research half centuri develop web goal augment human intellect led innov window belief import led innov haptic feedback graphic environ recognit power onlin commun inspir earli softwar develop emerg idea collaboratori research inspir vision import predecessor integr framework creativ support tool creativ support support creativ bold feasibl refin understand creativ process emerg advanc user interfac support creativ theori creativ vari common featur describ preparatori phase deal find understand explor altern discuss peer mentor step lai basi moment inspir break rigid mind set hour evalu refin potenti implement chosen dissemin theori contribut phase integr user interfac call learn previou work store digit consult peer mentor middl late stage evalu solut dissemin result contribut digit activ opportun research user interfac design interact search digit librari consult peer mentor visual data process free associ explor tool artifact perform review replai session histori dissemin result activ richli visual support activ deserv part research paper strategi visual paper item visual data process discuss place broad arrai activ collect donat creat relat search digit librari consult peer mentor free associ artifact perform review replai session histori dissemin result visual data process explor solut tool phase primari activ figur phase relat primari activ visual support creativ visual activ support framework visual inform process central task creativ explor inform visual contribut earli stage collect inform vast digit explor altern identifi peopl consult dissemin evolutionari made human visual system extrem adapt recogn extract detect unexpect item human rapidli process enorm amount visual inform action rapidli human perceptu apparatu integr interpret peopl rapidli identifi familiar face recogn threat linear tabular present music extend human enabl transmiss inform time support creativ process record idea facilit innov discoveri compel author produc coher develop consist present logic argument linear tabular format enabl author search present rapidli goal visual design match task present dramat portrai possibl show hundr present inform french suit specif task visual present tree map addit advantag present affin multipl enabl user relationship difficult discov linear textual present proxim link present show rich structur relationship code size color easili perceiv code mark highlight addit relationship world map rich inform sourc enabl design show complex relationship user plan trip make discoveri mental map inform space special design period tabl monthli taxonomi anim support creativ place inform orderli compact structur support user solv plan make discoveri inform visual human perceptu abil remark larg underutil current graphic user interfac comput base visual present bring addit opportun danger ad anim color movement enrich possibl present risk overwhelm reader great benefit comput environ opportun user rapidli present suit task user quickli chang rule govern color movement zoom click specif item greater detail possibl design user simpl process view click dai enabl user overview quickli move detail pictur worth thousand word interfac worth thousand pictur reason expect futur user interfac growth displai small portabl person devic attract larg project displai great human perceptu skill remark larg underutil current inform comput system base design lead research center develop advanc prototyp varieti widget explor rich inform space defin inform visual compact graphic present user interfac rapidli manipul larg number item possibl extract larger dataset effect inform visual enabl user make explan pattern group individu item definit user interfac control present inform visual deal abstract data scientif visual model scientif visual typic deal phenomena crystal human anatomi model typic deal mechan architectur aircraft design exampl inform visual support creativ earli visual base dynam anim displai updat immedi movement widget user point light map repres home sale williamson shift slider number point light offer quick understand suitabl home sold click point light produc full descript pictur control experi subject confirm perform prefer advantag dynam queri natur languag interfac paper step creat provid visual access film film arrang color code rectangl product year popular recent popular film upper hand corner variant scroll enabl user singl axi millisecond view desir region film film titl user click film dialog box give full inform imag film commerci version displai late figur film view displai year popular film color code film type larger size dot longer movi lifelin appli multipl timelin person histori medic record horizont vertic filter enabl repres complex histori support explor click timelin detail inform inform visual support creativ work enabl user find relev inform resourc digit identifi desir item discov pattern collect figur demonstr digit librari film view present larg amount inform orderli user understand distribut film librari find specif film satisfi legal inform user seek relev support argument west kei number system organ inform hierarchi level expand tree node figur show result search displai reveal case fall kei number hierarchi addit inform suppli organ case color show region case visual make clear major topic crimin law visual enabl user find relev resourc difficult discov typic page list case page figur result search legal inform librari organ west kei number year color code region form creativ support identifi item set legal inform librari drug discoveri task typic compound view organ amount carbon color code moment size code unusu compound select squar upper visibl distinct color code easi black white figur inform visual chemic compound amount carbon amount oxygen color code moment size code import pattern visual displai familiar chemic period tabl element inform color size code user make select move doubl box slider figur show usual layout high immedi visibl color code figur show strong correl dramat figur period tabl element color code show size code energi wai inform visual interfac support creativ complet give design specif goal work question futur comput industri research commun move ahead gener system addit research inform visual emerg kei site georgia tech graphic visual usabl xerox palo alto research lucent technolog bell il commerci activ rang exist packag includ visual sa special visual tool emerg compani visual visibl numer question remain basi research agenda figur chemic organ reveal strong correl creativ support inform visual tool design specif type data gener import issu rang inform visual situat includ network data clear singl tool wide rang user task includ present zoom desir filter undesir obtain show relationship extract inform histori user action review replai develop gener tool support rang data task major step forward success support creativ practic applic inform visual requir smooth integr tool result web search easili import cut visual present user filter data appropri adjust visual code interest group item user select past spreadsheet statist packag process visual process item embedd written slide email note email recipi manipul visual report perceptu foundat understand perceptu principl anim code static dynam environ user interfac extens human factor analysi recognit small number simpl outlier larg group occur rapidli recognit complex relationship involv multipl color shape longer strategi rapid pan zoom begin comparison anim distort orient dual view carr schaffer kei comparison deserv extens studi visual present advoc style claim empir evid shallow cognit solid theori creativ support inform visual rest understand cognit principl guid design exist design principl direct manipul demonstr success empir wide appli word draw visual object action shown tap analog reason metaphor icon action replac type continu feedback principl design rigor provid predict power basic principl appli summar visual inform seek overview zoom overview zoom overview zoom overview zoom overview zoom overview zoom overview zoom overview zoom overview zoom line repres project struggl design wrote continu remind design system effect visual direct manipul dynam queri user confid ambiti task empir studi assess benefit kei phase creativ process consult peer mentor consult occur late stage creativ problem solv process user confer materi commun medium email print document creativ support inform visual tool make easi user annot activ creativ support riski term sound vagu difficult evalu research topic work identifi user list offer open paper concentr activ visual explor inform visual techniqu support creativ research deal kei question order develop perceptu cognit collabor implement tool suffici goal visual subject rigor empir studi past develop bia rang control experi field trial ethnograph valid refin sharpen understand measur studi rapid rout develop advanc user interfac greatli partner nasa partial support research benjamin david preec thought comment earlier draft refer christoph visual inform tight coupl dynam queri filter proc acm human factor comput york color plate dynam queri inform implement proc acm human factor comput york richard stephen allan visual network ieee transact visual comput graphic benjamin jame zoom graphic user interfac explor altern interfac proc user interfac softwar technolog york wisconsin wi creativ myth basic york comput scientist commun acm atlant monthli comput creativ system stuart visual retriev ieee comput graphic applic read inform vision morgan kaufmann san ca creativ innov inform system boyd fraser publ ma flow psycholog discoveri york de creativ step harper york dougla william research center augment human afip proc fall joint comput confer onlin case studi offic nj network human commun mit ma empir examin creativ support system idea mi quarterli norman impact world wide web idea proc hawaii intern confer system ieee press richard problem york nation research council nation nation appli inform technolog scientif nation academi dc gari judith research comput support cooper handbook amsterdam taxonomi guidelin ieee softwar visual person proc acm human factor comput ny georg stuart inform visual interact commun acm visual interfac text ieee comput graphic applic applic framework creat learn univ maryland dept comput scienc technic report stanlei lawrenc creativ dell york steven jeffrei michael philip john user interfac environ explor proc inform visual lo ca navig hierarch cluster network acm transact interact design user strategi effect publ ma pursuit transform intern journal interact creat creativ user interfac support univ maryland dept comput scienc technic report dynam queri visual inform ieee softwar visual digit librari search result categor hierarch maryland depart comput scienc technic report proc british hci confer visual displai quantit graphic ct graphic ct visual imag evid graphic ct dynam evalu dynam queri inform explor proc acm reprint spark innov ablex
DB/957 3 solut effici storag index data datta ramamritham helen thoma abstract effici queri process critic requir data wareh system support applic requir interact time answer queri vast repositori data hundr gigabyt terabyt common approach improv analyt process queri perform util index access structur quickli access base data major drawback approach incur overhead access structur store addit base data present data repositori olap queri drastic improv perform simultan reduc storag cost wareh data storag access technolog data recent develop base paradigm fast access requir index basic idea underli curio technolog relat notion posit index briefli describ posit index provid overview techniqu incorpor curio compar perform curio lead commerci relat wareh product set typic olap queri result curio significantli consist outperform product term queri storag load time llc georgia institut ga ma introduct data wareh analyt process critic compon support advanc technolog improv abil manag retriev larg volum data data wareh refer collect support technolog aim enabl knowledg worker make faster data repositori histor data pertain organ olap refer techniqu perform complex analysi inform store data manag analyst maker varieti function area sale market plan olap queri specif trend anomali base inform filter group data wai effici queri process critic requir olap underli data queri support applic typic requir interact time data system understood compar tradit transact process system oltp system design autom data process task order structur repetit task oper detail data emphasi system maxim transact throughput contrast oltp data design support larg amount histor data data tend extrem larg uncommon data hundr gigabyt terabyt size olap applic render data achiev queri frequent aggreg consolid statist formula olap environ queri aggreg summar data import detail record typic olap queri requir oper join aggreg complic situat fact queri perform tabl potenti million record result deliv interact busi analyst system clear emphasi olap environ effici queri process main approach fast olap queri process precomput strategi approach reli summari deriv tabl precomput answer queri explor area context data basic underli work data achiev faster time answer frequent queri approach commonli refer olap approach numer commerci product base includ oracl express dss agent recogn work point precomput data cube number tabl form cube grow exponenti number dimens fraction workload olap applic consist queri comput demand led work strategi queri process strategi approach fast olap queri process support queri fast access structur base data system index improv effici access data gener index techniqu util oltp includ tree olap index structur provid perform bitmap index index project index analysi discuss index structur present number index support commerci product iq oracl informix server index structur separ set indic access structur typic maintain addit base data consid index data separ larg size data storag addit storag requir due index structur true data storag mainten cost time high year origin cost initi media cost cost addit year oper cost paper present data repositori olap queri solut problem exist technolog recent develop base design techniqu fast access requir index curio drastic improv perform simultan reduc storag cost wareh basic idea curio solut relat techniqu vertic partit file object paper present overview techniqu underli curio demonstr potenti perform analysi compar perform curio lead relat olap product rang dimens includ queri load storag requir result curio significantli consist outperform index structur algorithm product dimens highlight kei properti advantag curio noteworthi contribut paper compar perform analysi lead rolap product dimens paper organ section motiv effici wareh solut section describ posit index applic curio section present result perform evalu section discuss addit properti advantag curio conclud section data motiv motiv effici storag retriev data wareh environ provid descript star schema kei design techniqu relat olap convent relat design dictat highli normal schema larg number transact access updat data queri larg portion potenti larg tabl join data face environ larg repositori normal desir system analyst prefer view data individu data item point data space star schema relat design paradigm seek encapsul acknowledg prefer model strategi data olap star set dimens tabl fact tabl illustr simpl star schema present figur tupl tupl tupl timestamp po id product id tax discount statu byte byte byte byte byte byte byte byte profil id tupl tupl timestamp dow dom month quarter year byte byte byte byte byte byte byte time po id po zip citi region state countri byte byte byte byte byte byte byte byte locat sale incom byte byte byte byte byte byte ag attribut byte byte custom profil product id type make seri year price byte byte byte byte byte byte byte ethnic product mar statu zip gender profil id fact tabl dimens tabl relat kei attribut attribut attribut figur simpl star schema model histori sale automobil manufactur locat globe intend support market strateg central fact dimens data captur custom profil product tabl note fact tabl set busi metric attribut discount primari kei dimens timestamp pk time po id pk locat profil id pk custom profil product id pk product remaind paper consid index data convent set relat tabl separ set indic access structur relat tabl store tabl repres seri record partit chain data block link block pointer paper make assumpt entir record store contigu data block record length cardin number record jt easi comput number record fit data block block size size page pointer determin size tabl jt assum implement platform block size byte block pointer size byte easili comput total size schema figur approxim mb addit base retriev index structur typic defin data fact tabl sale tabl index attribut system commerci provid referenc primit individu record row identifi base record point index leaf level pointer point set base record retriev disk block store rid consist uniqu block identifi gener concaten number slot row rid record block notion rid clarifi concept present paper larg number index scheme literatur index type shown data commerci research system ffl deriv successfulli relat system number year entri index point list point base data distinct field list store chain data block ffl bitmap differ bitmap standard list rid distinct bitmap vector jt repres row tabl bit set row match vector ffl project index simpli consist specif column tabl entri index order valu underli effici map valu tabl record project store chain data block implement project iq duplic column ffl index principl project index column row tabl repres order index refer literatur record tupl identifi store bit posit column index store separ chain data block structur improv queri space penalti standard bitmap incur storag overhead due natur structur uncommon standard bitmap index singl column tabl size tabl moder index column storag requir factor number corrobor perform studi section cost absolut percentag term reduc sacrif effici obtain turn answer question affirm recal project index simpli mirror imag column index index column fact store index column fact tabl result duplic data store index origin tabl record reconstruct easili index basic idea curio solut appli divid sale tabl figur smaller shown figur schema vertic tupl byte tupl byte byte byte statu discount tax tupl tupl tupl byte region locat citi zip po po id tupl timestamp sale byte tupl po id sale byte time byte byte byte byte byte byte byte year quarter month sale dom dow timestamp profil id gender attribut zip mar statu ethnic incom byte byte byte byte byte byte ag byte byte custom profil profil id sale state tupl byte countri product id type make seri year price byte byte byte byte byte byte byte byte product byte byte tupl product id sale byte byte byte byte byte fact tabl relat dimens ordin map kei attribut attribut attribut figur schema vertic partit index scheme attribut id remain column busi metric sale tabl discount record origin sale tabl partit individu result tabl origin record easili compon row result tabl share ordin posit result size comput approxim mb essenti size raw data origin configur util separ column partit fact tabl element index tabl simpl power store data index storag cost data term storag index free tabl id id consid posit index broadli index storag structur easi access tupl posit index extens basic addit provid map column valu sole repositori column valu proce describ posit index approach detail posit index approach discuss previou posit index simpli creat vertic partit relat column index remov origin store entri posit base record isol column project index fast access data tabl graphic structur shown figur show configur base tabl record base sale tabl reduc sale tabl posit index timestamp tax discount statu timestamp tax discount statu timestamp tax discount statu statu timestamp timestamp timestamp timestamp timestamp timestamp timestamp timestamp timestamp timestamp timestamp tax discount statu tax discount statu tax discount statu tax discount statu tax convent relat statu posit index figur posit index figur posit index reduc tabl figur base tabl consist attribut statu posit index construct timestamp column posit index simpli chain timestamp attribut reduc tabl remain field base discount statu dot line join posit index record record reduc order record base tabl conserv posit index reduc tabl properti easi map timestamp valu record reduc tabl map reli fact exist fix number hold record data block denot width attribut number slot page posit index figur bdi reduc tabl reduc base easili associ element record posit index reduc tabl simpl arithmet map assum instanc access record base tabl translat associ posit index record exist posit index column record reduc tabl comput rid record posit determin locat timestamp block posit slot number timestamp found scan oper easili simpli track number data block load scan oper note posit match record data block ordin record base tabl simpli timestamp timestamp timestamp determin rid entri reduc tabl rid reduc number data block block chain reduc tabl record reduc slot block desir record reduc reduc reduc reduc rem reduc remaind oper oper map oper easili implement integ oper fast modern architectur delai comput neglig compar slower storag access time vertic partit tabl posit index carri comput overhead access tabl note potenti problem presenc attribut type number record vari page solv defin maximum number record model system ordin posit number correspond actual record uniqu fix length surrog simplifi paper assum field length fix loss gener idea present section form basi posit index techniqu underli curio idea extend develop addit proprietari data structur algorithm effici join aggreg oper noteworthi featur curio perform join essenti exist map individu element foreign kei column kei fact tabl ordin posit kei valu dimens tabl map fast evalu join oper eleg data structur algorithm greatli reduc number disk access requir queri achiev fast time proce demonstr perform techniqu perform evalu curio present result perform compar queri process storag load time curio exist product benchmark virtual rolap vendor due space readabl concern refer reader plot section report result specif product rel perform curio essenti uniform compar rolap product consid product select studi oracl red brick product select respect vendor identifi market leader data wareh solut recent studi oracl largest market share close ibm felt red brick acquir interest comparison product solut present queri process queri perform import aspect analysi test perform window nt machin singl mhz intel pentium processor mb ram queri experi base star schema shown figur schema time fact tabl singl foreign kei column dimens number displai column size column byte index built scheme index column test provid advantag mention product term storag requir index built incur addit storag overhead special index give product advantag bitmap index oracl star index red brick relat attribut kei attribut quantiti price type amount product color weight time year month week dai custom address ag phone total figur schema perform evalu data schema randomli gener load respect bulk load util data load index creation treat separ step load time compar curio curio index creation size consid gb size refer size raw includ overhead ad data load tabl list number tupl tabl size consid tabl gb gb gb custom product time tabl tabl cardin perform evalu queri experi tabl tabl includ descript sql characterist queri characterist complex queri term number tabl number number group column aggreg queri queri join fact tabl restrict dimens tabl comput group column note fact tabl restrict costli dimens tabl tupl evalu provid plot time data size level defin time start queri record displai metric select displai record mark point analyst begin process retriev inform time queri session time analyst spend wait record measur analysi note queri run control condit elimin effect extran event machin run render unnecessari run network process process run test machin relev softwar process core os process make test elimin effect cach restart machin success queri result test present bar chart number bar red oracl ratio perform compar curio present result queri follow comparison storag comparison load time queri result queri complex involv aggreg figur show time select product queri clear curio outperform perform advantag raw data size queri gb level red brick close time curio curio fast red brick larg data size curio approxim time faster oracl queri note queri singl tabl queri complex queri involv curio perform shown figur id descript sql formul characterist list high volum select quantiti singl tabl queri custom restrict custom id column project quantiti list high volum select quantiti join custom custom dimens id id column project id quantiti find custom select quantiti join high volum product custom dimens product id id column project id id id quantiti find custom select quantiti join high volum product custom time dimens product id id column project month id id id quantiti find total number select singl tabl queri restrict aggreg type count group column find total quantiti select join product product dimens high volum id id column project id aggreg type sum quantiti group column group select join find maximum quantiti product custom dimens restrict elderli custom id id column project id id aggreg type max id group column group rang select join find maximum quantiti product custom dimens restrict elderli custom id id column project id id aggreg type max id group column group pname elderli select join find total quantiti product custom time dimens high volum id id column project rang product id id aggreg type sum list month group column id quantiti group month elderli select join find total quantiti product custom time dimens high volum id id column project rang product id id aggreg type sum list product group column month id quantiti group month tabl queri perform evalu join gb figur curio time approxim time faster oracl raw data size curio red brick oracl time queri raw data size curio red brick oracl queri raw data size curio red brick oracl time queri raw data size curio red brick oracl queri figur time queri complex aggreg queri perform result queri displai figur result similar obtain magnitud curio perform advantag greater case queri shown figur simplest aggreg queri consist count involv singl tabl restrict expect queri evalu quickli system curio red brick answer queri data size oracl requir gb remain queri complex queri join restrict group queri join restrict group column queri data curio significantli outperform product idea magnitud curio queri figur join restrict group column gb curio perform queri approxim time faster time faster time faster red brick storag requir result compar storag requir product load size raw data result size data index data provid figur clear curio effici term storag requir gb data requir disk space shown figur gb index data requir time shown figur red brick perform term storag data index storag requir significantli time gb data red shown figur storag requir costli dollar term recent trend central driven prohibit cost transmit receiv data network storag hard disk price recent corpor budget spent storag cost cost includ mainten storag media estim dollar spent storag dollar spent annual mainten cost experi fulli index data curio offer tremend save storag cost order manag view featur curio attract queri perform gain load time result examin time load data build index product comparison time provid figur clear curio red brick oracl raw data size queri curio red brick oracl queri raw data size curio red brick oracl time queri raw data size curio red brick oracl queri raw data size curio red brick oracl time queri raw data size curio red brick oracl queri raw data size figur time aggreg queri addit advantag curio design superior perform load fact curio requir index curio significantli faster product curio load gb data time faster oracl shown figur figur index creation time curio red brick oracl raw data size curio red brick oracl raw data size figur comparison size displai curio essenti index creation repeat load time curio plot figur show magnitud cost build index fastest creation time gb data red slowest time hour curio red brick oracl raw data size curio red brick oracl raw data size figur comparison load time advantag curio curio term queri process storag load time section show curio significantli faster process olap costli term storag faster load data compar lead exist relat solut properti curio approach provid addit advantag discuss advantag number block vertic partit emploi curio bring addit advantag larg portion olap queri access subset attribut tabl examin convent singl attribut entir record load attribut valu insid record store contigu convent implement sampl schema section attribut sale tabl load po id tax attribut convent load extran data curio approach partit data relev column load answer queri ffl high storag requir curio reduc compress index schema approach potenti appli convent storag size reduct higher curio compress algorithm yield higher compress ratio set valu compress rang small domain displai happen vertic partit approach convent data store row row decompress exist algorithm oper compress data expect compress curio index provid higher perform gain compress version index paper ffl memori queri access column number time column select column small true compress size main memori queri cost significantli reduc column memori durat queri evalu attribut select sql save thousand block access index attribut memori load size smaller curio convent number memori fault smaller curio mb implement curio gb implement convent index assum size main memori mbyte expect curio approach find requir column memori approxim time convent approach yield block hit ratio curio approach yield perform advantag reduc number time data block load disk ffl reduc memori algorithm curio perform queri properti memori requir independ size fact tabl extrem size valuabl rapid growth typic occur ffl easi order remain data period refresh tabl index updat reflect real world store refresh consist seri append oper fact tabl updat index append data exist tabl perform updat index costli index complet reorgan curio util clear updat curio incur addit index updat cost curio refresh process assum data simpli sort oper perform shown section curio perform load extrem fast compar product properti desir applic time window refresh shrink present effici olap queri engin data repositori base simpl data storag index scheme show clear superior posit index approach underli curio point view storag cost main advantag approach li fact essenti index provid show curio outperform lead product order term queri speed storag requir discuss addit advantag gain curio queri process curio occur faster convent implement relev attribut attribut highli curio effici main memori dimens tabl occur assum updat normal refresh refer widom strip rule system effici maintain deriv data proc acm sigmod intl conf manag page armstrong data deal grow pain proc thirteenth intl conf data page april ieee schneider data wareh tutori acm sigmod intl conf manag june mj carei sql proc acm sigmod intl conf manag page dayal overview data wareh olap technolog sigmod march chu analysi variant inform ef sb ct provid olap mandat technic ef codd ubiquit acm comput june intern data corp data wareh worldwid market report franci manag storag outlook supplement pc page novemb cd french teach oltp kernel advanc techniqu proc page april jd ullman index select olap proc thirteenth intl conf data page april ieee guttman dynam index structur spatial search read page morgan kaufmann san jd ullman implement data cube effici proc acm page june solut corp olap server ibm corp version window informix softwar extend parallel server gener index data white wh inmon build data wilei kimbal data toolkit wilei dss agent oneil model architectur perform intl workshop high perform transact system volum lectur note comput page oneil quass improv queri perform variant index proc acm sigmod intl conf manag page oracl corp oracl express oracl corp star queri white june oracl corp edit window red brick system red brick version window shoshani olap statist similar differ acm simpson storag manag cost page april iq optim interact perform data white
HCI/958 4 prior research embodi interfac agent found user find engag argu embodi serv stronger function system design actual human protocol design interfac commun behavior refer object point gestur exampl protocol nativ speaker languag perform leverag intellig interfac discuss protocol integr interfac agent act show embodi requir success implement introduct qualit differ form commun academ routin travel long distanc conduct interact electron form commun seemingli work peopl import person qualit differ situat enjoi human comput screen human bodi enabl commun protocol provid rich robust channel commun afford medium todai bodi postur plai essenti role proper execut pretti afford embodi yan gestur narr languag group mit media laboratori massachusett initi interrupt feedback error kind behavior enabl exchang multipl level inform real time peopl extrem adept extract mean subtl variat perform slight variat feedback nod time gaze behavior significantli alter interpret utter great great interest interfac design commun protocol user train nativ speaker languag skill daili embodi interfac agent exploit protocol potenti provid higher bandwidth commun depict human bodi decor menu screen interfac attract user embodi interfac agent develop date novelti point gestur facial anim interfac agent provid system handl mechan interact system found provid improv task perform text interfac review embodi interfac agent develop date summar result evalu perform discuss human commun protocol interfac util requir embodi present embodi interfac agent implement protocol describ ongo research program develop embodi interfac agent leverag knowledg human commun skill relat work research built embodi interfac vari abil closest research area work rickel johnson andr rist lester al agent verbal nonverb move object interfac point gestur combin speech text output associ verbal nonverb behavior addit afford bodi exploit kind task perform speech system automat gener facial movement inton pattern case domain artifici agent emphasi product proposit behavior reinforc content speech system design interact run real time work thorisson good embodi interfac agent inspir studi human compet develop recogn displai interact inform simpl gestur speech event perceiv gener back channel behavior lead natur interact limit abil recogn gener proposit limit abil provid correct inton speech emphasi speech gestur speech charact system develop al architectur present paper research applic domain implement detail system charact assist user complex system control answer question give tutori behavior agent limit greet point gestur bodi posit user studi embodi interfac agent mae takeuchi studi user interfac static anim found user rate engag entertain function interfac face sproull found user cooper interfac agent human face dog imag rist muller found user rate anim present agent entertain interfac agent differ actual perform recal present interfac agent interfac user studi system mention user rate smooth interact agent languag skill significantli higher test condit util limit behavior limit behavior disabl evalu address embodi system interact includ includ anim figur test embodi improv task learn perform previou studi inspir show mere presenc charact win focu contribut embodi fulli function order start understand embodi contribut interact human commun protocol requir embodi embodi wide rang behavior execut tight synchron carri commun function import understand emploi varieti circumst produc commun commun function realiz set behavior clear system deal model handl function separ run risk inflex insensit natur phase briefli describ fundament commun protocol function element exampl nonverb behavior contribut success implement tabl show exampl map commun function behavior base previou research typic north american nonverb map form function reli fundament contribut proposit interact proposit inform correspond content includ speech hand gestur complement elabor speech content size sentenc interact inform consist cue regul process includ rang nonverb behavior head nod regulatori speech theoret stanc examin role embodi behavior note previou embodi interfac agent deal interact proposit inform integr prevent fulli exploit afford bodi initi termin human elabor engag disengag peopl show readi engag turn potenti gaze person exchang sign mutual recognit typic involv eyebrow movement toss head wave arm initi synchron distanc commun function commun behavior initi react short glanc invit contact sustain smile distanc head smile close head embrac smile break glanc head wave give turn eyebrow turn hand gestur space turn glanc start talk feedback request feedback eyebrow give feedback head nod tabl exampl function behavior realiz content elabor emphasi gestur convei inform content wai hand uniqu suit fulfil hand simultan spatial relationship voic channel commonli thought bodi point possibl account fact commonli implement bodi anim interfac agent involv deictic gestur interlocutor discuss share task peopl approach seal commit close handshak accompani verbal exchang greet phase end particip move orient stand angl termin similarli move start orient shift glanc cumul verbal exchang break mutual gaze interrupt interlocutor talk sequenc protocol involv floor manag determin turn turn listen involv factor includ gaze inton listen interrupt speaker gestur turn gestur convei semant pragmat inform beat gestur movement hand chang form content accompani speech serv pragmat convei inform speaker icon metaphor gestur convei featur action event redund complementari rel speech convei addit inform provid robust emphasi respect icon convei inform spatial relationship metaphor repres concept physic sweep gestur accompani properti titl free feedback error correct speaker request feedback listen gaze eyebrow listen provid feedback head nod speaker facial express lack posit feedback listen clarifi question hear understand speaker embodi agent rea project mit media lab goal construct interfac agent rea implement protocol order make interact natur person current task rea act real estat answer user question properti show user virtual figur user interact rea rea fulli articul graphic user passiv camera audio capabl speech facial gestur output system consist larg project screen rea displai user stand front camera mount top project screen track head hand posit space user wear microphon captur speech input singl sgi comput run graphic engin comput manag speech recognit gener imag process rea conduct describ featur task domain respond verbal input user make cue typic turn behavior rea turn initi error correct misunderstand user gener combin facial express gestur output gener increment natur languag gener engin base extend redund complementari gestur synchron speech output simpl model determin speech act user engag resolv gener anaphor refer architectur figur show modul rea architectur design meet requir input accept modal input devic modal integr singl semant pass modul modul kqml frame slot interact proposit inform regulatori contribut act maintain system categor behavior term function mirror organ architectur central made term function delib move peripheri made term behavior input manag action addit input manag action schedul commun hardwir reaction respond immedi user input system command track user gaze shift move reactiv behavior modul natur perform inferenc action multipl realtim cycl complet rea implement expert system languag input devic speech bodi po gaze gestur input manag hardwir reaction understand modul figur rea softwar architectur delib modul overview implement commun protocol rea implement human commun protocol initi termin rea acknowledg user presenc turn face detect vision system exchang user verbal user verbal greet rea recogn user turn vision suspend speech input process user turn face interrupt rea track speak turn state speak hold turn rea verbal interrupt base audio threshold yield turn user begin speak user gestur detect vision interpret express desir halt remark nearest sentenc boundari exhibit behavior plan serv hold turn readi end speak turn turn face user turn transit point modul interact process proposit process planner knowledg base model gener modul speech gestur gen action schedul output devic speech bodi po gaze gestur content elabor emphasi rea point gestur refer pictur environ research gener point gestur disambigu object virtual recognit user point gestur pursu rea gener natur languag accompani gestur unifi text gener modul modul distribut inform convei user voic gestur channel base semant pragmat result redund complementari gestur gestur function hand start end hand envelop size beat gestur gener mark inform semant inform convei gestur channel describ rea love demonstr hand garden surround side develop modul classifi user base input vision system statist underwai feedback error correct rea feedback user turn nod head end user utter detect audio threshold user turn rea fulli understand user input due error report speech recognit attempt repair clarifi question sampl interact detail order understand rea process user proposit produc output segment interact user describ messag rea intern modul paragraph record actual interact user tim approach rea rea notic smile tim rea hand wave tim bui place rea glanc turn rea beat gestur emphasi inform tim interrupt begin gestur rea finish current utter turn tim detail focu modul architectur contribut carri interact messag packag kqml sender recipi field modul commun messag describ interact user includ messag content field frame type sender recipi field denot commun action origin intend recipi rea depend interpret gener rea modul gener process sequenc input manag inform user action creat sender user recip rea input field place descript behavior detect understand modul receiv interpret behavior fill prop field send dm reaction incom dm construct time sender rea recipi user fill prop dm pass frame gener modul job translat proposit interact descript seri low level behavior output field lastli action schedul receiv output coordin verbal realiz um dm user rea figur sampl perform user feet stereoscop vision system start track user head hand movement receiv inform um send dm interact messag user present make system transit state send gm interact request gener invit start gm map request sequenc includ user execut user respond invit im report onset voic um send dm interact messag user turn system transit state stai im deliv speech content um dm receiv um interact messag user proposit messag form speech case type greet insid dm speech act gener oblig respond greet similar speech act return fulfil dm send act gm execut gm break speech act hand wave behavior spoken utter realiz system momentarili state speech act return back state figur rea state user start speak gm produc interact messag indic user shift system state user finish bui place gm dm interact messag user turn proposit messag user perform gm add attribut place order consid dm determin meet user prefer speech act gener oblig time present oblig gener oblig dm send gm fulfil proposit interact messag state rea turn gm gm consult text gestur gener gener verbal gestur express proposit instruct glanc effort turn user notic rea plan speak grab rea stai state rea deliv utter gener user realiz weak constraint add detail spontan hand anticip elabor queri vision notic sudden hand movement um send messag dm user turn gestur treat rea finish current utter give user dm remov futur oblig gm continu execut current utter user interrupt speech overlap dm halt gm rea give user turn rea finish utter user state user continu capabl function show user reli interact compet system negoti prefer system embodi charact capabl emot express user comfort began overlap speech limit speech recognit system develop matthew augment gestur addit speech real time capabl step test rea implement larger set includ error correct gestur user engag effici fluent interact system paper argu embodi interfac agent provid qualit advantag bodi wai leverag knowledg human commun behavior demonstr approach rea system increasingli capabl make intellig proposit contribut rea sensit regulatori interact function verbal capabl produc regulatori behavior improv interact user remain awar state acknowledg member rea team lee david yu jennif smith contribut work comment paper candi sidner anonym review comment improv paper refer integr reactiv script behavior present agent agent acm press pentland track human bodi van lifelik comput persona project microsoft research softwar bradshaw mit effect visibl cooper problem solv task languag speech integr face gestur automat spoken dialogu spoken dialogu system mit press acm chi confer human system design embodi embodi mit anim gener facial gestur spoken inton multipl agent comput graphic power nod envelop emot feedback anim agent journal appli artifici press turn model multimod wilk machin facial displai research languag social clip refer manual version technic number softwar technolog johnson space kqml agent commun languag intern confer inform knowledg manag novemb acm press interact friedman human valu design comput technolog csli conduct pattern behavior encount cambridg press york agent effect ieee intern workshop robot human commun persona affect impact anim pedagog agent human factor comput confer acm press hand gestur reveal thought chicago press interfac william human factor comput extend abstract acm press dialog anim agent virtual realiti workshop embodi charact octob modal comput phd commun comput model dialogu skill phd mit media situat facial social interact nielsen human factor comput confer acm press
ML/959 6 optim neural network time seri predict de della institut research parallel inform system nation research council itali itali time seri artifici neural evolutionari genet delai differenti equat abstract paper investig effect design neural network model time seri predict base evolutionari approach genet algorithm consid face optim design neural network architectur choic learn method effect approach evalu standard benchmark predict seri introduct main motiv time seri research provid predict mathemat model phenomenon unknown incomplet time seri consist measur observ previou outcom phenomenon made sequenti time consecut observ depend attempt predict process predict time seri predict problem face stochast method fast limit applic commonli emploi linear model practic process nonlinear linear model inadequ nonlinear method artifici neural network wide time seri predict problem ann power stochast drawback design effici architectur choic paramet involv requir high process time learn neural network weight consid hard optim problem learn time scale exponenti prohibit problem size grow face problem lot time wast find network architectur natur devot attent automat procedur exploit power techniqu effici search advanc soft comput engin design manufactur space network architectur suitabl set paramet found guidanc train abil result network gener unknown data optim case heurist techniqu train process whitlei face task separ approach genet algorithm util architectur optim choic variant back propag method literatur ga simul anneal emploi aim optim neural network architectur train network model bp genet algorithm demonstr superior ga design neural network linear system identif object paper investig possibl emploi evolutionari approach design ann nonlinear stationari time seri predict problem popular neural layer perceptron consid time seri analysi success train method mlp bp evolutionari account effici design neural model deal network topolog optim choic techniqu updat weight bp time optim relat paramet time seri predict problem procedur find optim attain rapidli architectur close optim perform standard benchmark predict time seri consid evalu effect approach paper organ section state art time seri predict briefli section descript benchmark problem report section implement detail outlin section result shown discuss section final comment prospect futur work review state art time seri predict approach time seri predict problem investig year method divid global local model global model approach model phenomenon examin local model base divid data set smaller model simpl model global model give result stationari time seri statist chang time approach devot linear design model theori algorithm model build linear regress method autoregress autoregress move averag model complex regress method multivari adapt regress spline measur phenomena linear model method inappropri describ behavior reason nonlinear method wide util nonlinear method ann repres attract approach time seri predict problem addit abil repres complex nonlinear type mlp radial basi function network effect construct approxim unknown function learn exampl time seri predict ann main problem design structur network effect learn phase topolog network fix learn phase perform method neural model mlp frequent limit learn map static network perform predict stationari time seri novelti work provid simultan effici architectur optim learn process seri situat scienc technolog futur evolut system predict past measur system small number mathemat model made write equat motion integr forward predict futur state procedur fail system freedom case track motion space studi dynam appar chaotic system freedom reveal dissip reduc number effect relev freedom small number account set evolut foe hg repres state time oe repres state time assum ae evolut curv oe tend wai defin dimens attractor compact metric space ffl defin maxim set maxim cardin subset point distanc ffl defin limit capac advanc soft comput engin design manufactur lim inf ffl attractor object integ identif coordin attractor make problem simpl freedom choic combin relev variabl difficult imposs sequenc past measur chaotic system form system dynam provid suffici larg compar attractor sequenc inform predict motion attractor prove theorem exist smooth function defin subset correctli predict futur variabl question shown attempt predict behaviour time seri gener chaotic dynam system time seri transform reconstruct state space delai space point state space vector time seri valu sequenc delai step assum function relationship current state futur state fp aim find predictor fp approxim fp predict base previou valu data fp necessarili nonlinear repres number time step ahead perform predict base estim dimens manifold time seri origin construct ann model extern input system dimens suffici obviou larg time seri experi gener chaotic differenti delai equat defin dx dt design determin system behavior initi valu time interv system approach stabl equilibrium point limit cycl seri period doubl system chaotic control chaotic seri larger larger attractor higher difficult valu greater characterist period approxim perceptron optim evolutionari algorithm basic idea provid automat procedur find neural network structur time seri predict gener optim mlp train solv problem architectur number hidden layer number node layer activ function layer presenc absenc bia techniqu weight chang point approach train phase effect bp algorithm number heurist modif basic approach speed train time enabl complet learn process approach wai proce chang weight valu paramet involv depend problem priori qualit analysi variant solut problem firstli fix configur basi empir train network pattern evalu qualiti algorithm analysi demonstr search present exponenti complex perform techniqu addit time possibl train fail network configur run local minimum learn mechan choic paramet search basi paramet advanc soft comput engin design manufactur train coeffici momentum coeffici ff util heurist method reduc search time probabl stuck local minima determin set paramet list aim provid gener techniqu determin network structur high import point face time seri predict problem decid previou outcom phenomenon consid call window size establish sampl past outcom mean find constant lag call sampl lag decid insert featur found evolut import note case paramet evalu guidanc aim determin valu evolutionari search power literatur problem limit paramet report hidden layer adequ task face reduc number paramet account encod neural network defin genotyp code characterist mlp phenotyp mlp genotyp paramet relat network number hidden layer number neuron layer gene repres activ function type output layer paramet relat bp number neuron input layer presenc absenc bia sampl lag ffi evolutionari chromosom structur constitut report fig locu gene ff ffi set tabl genet encod allel defin subset report row tabl vari maximum fix equal allel defin design hidden layer activ output layer sampl lag learn coeffici number layer momentum coeffici bia number node hidden layer number node window size fig graphic genet encod ae ir mean activ function output layer assum sigmoid tanh chromosom loci choic activ function hidden layer perform preliminari set run featur found evolutionari algorithm run solut tanh hidden layer presenc loci high execut time due higher search loci examin tanh decid cancel field final depict fig tanh hidden layer perform run modifi final solut yield system chang network sigmoid tanh result predict valu close averag seri fit function ann total pattern set divid train set verifi set train evalu gener abil train network advanc soft comput engin design manufactur evalu good paramet describ good normal squar error train defin ann gener abil comput refer verifi natur account normal squar error specif fit function optim algorithm neural network structur popul network repres potenti candid solut free evolv solut individu evalu determin solv problem select process establish mate mean genet oper creat individu gener process repeat adequ network achiev stop criterion fulfil algorithm train mlp relat individu repres neural network configur gener scheme train set ts procedur genet algorithm begin randomli initi popul neural network criterion train mean ts evalu train network save train network select neural network randomli select structur recombin obtain perform mutat od updat variabl od end design procedur constitut evolutionari algorithm procedur train mlp encapsul main program procedur return valu fit evalu action complet transpar main program evalu good result result literatur speak singl problem exist famili problem instanc famili determin set valu equat decid describ futur predict start current window experi decid set valu perform set evalu effect system predict report valu literatur compar result achiev research preliminari obtain relat time consist sampl data divid train data set train predict verifi set evalu perform train system consist made valu previou system find window size sampl lag effect perform predict describ set experi experi case set popul size truncat rate maximum number gener max fuzzi recombin recombin discret mutat mutat probabl pm strategi order save gener individu current gener maximum number train epoch minimum learn stop criterion genet evolut fit equal lower perform ten run seed number random number gener small train evalu ann minut mean pentium advanc soft comput engin design manufactur small time huge number neuron network reason led limit max number train epoch reason valu limit execut time dai result run similar report plot run fig show result achiev train set window size account clariti predict obtain verifi set case real mg seri shown mlp figur node input hidden hidden layer node output layer learn coeffici momentum coeffici sampl lag bia activ function output layer tanh direct evalu qualiti solut run train set verifi set evalu qualiti solut found mean paramet account shape predict seri refer shape real seri roughli paramet closer shape predict curv respect mg higher paramet account consecut point real mg seri time step set set act write seri consist seri number point equal mg seri minu predict creat seri slope pr compar newli creat seri slope pr predict incorrect percentag correct predict refer total number evalu set point mg train set verifi set result run experi paramet set previou set experi case perform ten run found solut similar report run fig result achiev train set train set window size graphic fig show predict compar actual seri valu window size sampl lag run network hidden layer neuron learn coeffici momentum design time step train network output target time step predict network output target fig result train set verifi set coeffici bia activ function output layer run train set verifi set valu compar report report rel error obtain mlp learn epoch train set verifi set case approach achiev valu lower number learn epoch advanc soft comput engin design manufactur time step train network output target time step predict network output target fig result train set verifi set percentag correct result run window size remark theorem state past measur suffici perform predict larger window note algorithm havent insert pressur fit function lead window small achiev design valu window size higher yield paper evolutionari approach effect design neural network model time seri predict investig face simultan optim architectur design learn method choic fuzzi recombin improv perform emploi approach test standard benchmark predict seri result prove effect predict optim neural model problem hand point automat procedur provid achiev network architectur time seri predict close optim perform order ascertain procedur analyz time seri predict problem paper evalu predict directli literatur paper report perform improv obtain iter predict achiev predict futur perform system work complex real life predict problem method easili distribut intend perform implement parallel version evolutionari approach aim improv perform qualiti neural search time refer weigend time seri forecast futur understand past mozer neural net tempor sequenc process time seri forecast futur understand past weigend back local recurr global feedforward critic review architectur ieee tran neural network kaski time seri predict fir elman neural network world congress neural network inn pp rumelhart parallel distribut process mit press advanc soft comput engin design manufactur montana davi train feedforward neural network genet algorithm eleventh intern joint confer artifici intellig pp learn neural net genet algorithm parallel process neural system comput pp train neural net reactiv tabu search ieee tran neural network whitlei genet algorithm neural optim connect connect parallel comput reev steel simul genet review applic neural network tenth iast symposium appli informat pp holland adapt natur artifici system michigan ann arbor goldberg genet algorithm optim machin learn massachussett kean prune back propag neural network modern stochast optim techniqu neural comput applic de della artifici neural network optim mean evolutionari algorithm soft comput engin design manufactur london muhlenbein analysi mutat recombin genet algorithm neural network world muhlenbein predict model genet algorithm continu paramet optim evolutionari comput muhlenbein scienc breed applic genet algorithm evolutionari comput rumelhart hinton william learn intern error propag parallel distribut explor microstructur cognit mit press glass oscil chao physiolog control system scienc tong nonlinear time dynam system approach oxford press box jenkin time seri forecast control prentic englewood jersei friedman multivari adapt regress spline annal statist nonlinear signal process neural predict system model lo alamo nation laboratori technic report farmer predict chaotic time seri physic review letter farmer exploit chao predict futur reduc learn cognit world singapor design nonlinear model forecast read cybenko approxim superposit sigmoid function mathemat signal system detect strang attractor lectur note mathemat berlin fractal geometri natur van nostrand york packard farmer shaw geometri time seri physic review letter farmer gibson state space reconstruct presenc physica neural comput theori practic san freeman voigt muhlenbein fuzzi recombin continu genet algorithm sixth intern confer genet algorithm morgan predict advantag unit neural comput
DB/960 3 express analyt perform model replic matthia nicola matthia jark technic informatik germani abstract vast number design option replic requir effici analyt perform evalu overhead simul measur option review exist analyt model term model replic schemata network properti show data replic commun workload pattern model accur base defin model approach replic model integr deriv complet analyt queue model demonstr higher express exist model yield bottleneck analysi permit evalu throughput avail introduct replic manag distribut concern alloc physic copi logic data fragment updat maintain accept mutual consist replic intend data avail presenc site commun retriev cost local access mainten replic data close relat replic manag impact system perform literatur offer algorithm replica placement replica control sophist method match todai analyt model perform evalu vast number altern design replic appar exist analyt model extrem replic replic full replic import role commun replica manag suffici account evolut distribut modern commun system theoret perform model evalu system lag aim identifi remedi flaw perform evalu deriv analyt model approach describ replic accur express result obtain section present critic review exist perform model includ formal classif replic model section present requir perform model overcom defici exist approach model replic depend structur captur section develop analyt queue model implement base model detail commun model section present result deriv includ bottleneck analysi critic part analyt throughput estim shortcom exist perform model section analyz altern perform model distribut reveal drawback exist studi motiv gener model concept commun perform studi distribut emploi analyt method simul simul evalu complex system model level detail preclud analyt solut simul costli term program comput time simul fail cover paramet space carri sensit analysi desir simul analyt studi queue system underli model earli queue model distribut model fulli replic local site system block read transact process server write transact block server model share read write major drawback model commun neglect site share singl queue incom transact remedi distribut model queue network network local model system restrict transact exponenti distribut servic time model local queue arbitrarili distribut servic network system distribut servic time assign exponenti distribut servic time transact updat model evalu system transact type analyt perform studi model commun network infinit server introduc constant delai messag size network load mean unlimit transmiss queue network consid bottleneck model predict replic deterior throughput disprov section larg wide area applic wireless mobil inform system suffer low commun link bottleneck analyt studi combin detail model detail commun model author assum uniformli distribut data data item access equal probabl data access realist model analyt studi lock conflict block transact model compar concurr control algorithm model complex typic simul simplifi model assumpt replic commun classif replic model perform studi distribut simpli assum logic data item repres physic model full partial object site perform evalu assum full replic data object replic site site hold complet copi distribut extrem case replic recogn applic full replic optim configur object site partial studi model partial replic data object replic site replic denot paramet describ logic data item repres physic number site express mean full data item replic data item replic applic data replic site read intens data replic site common situat model scheme object site partial replic denot describ percentag logic data item fulli replic site data item fulli replic replic express mean full replic model partial replic consid scheme orthogon approach replic defin percentag data item number copi larg wide area distribut afford replic data item site updat propag avail scheme realist model integr commun learn exist defin requir improv model express model replic repres evalu realist replic schemata time throughput bottleneck comput import perform criteria requir captur load depend commun network limit transact interplai replic commun detail transact commun pattern applic model data qualiti replic schemata relax coher consid requir met model transact process primari copi approach judg advantag replica control concept implement commerci system oracl asynchron updat propag secondari copi process updat transact assum execut singl local remot site primarili intend compar concurr control refrain model lock conflict detail replic commun model replic base classif section orthogon concept combin scheme call object replic model pair describ percentag logic data item repres physic copi replic site share logic data item remain express mean full replic logic data replic schema number physic copi view number copi replic object actual extent express visual independ normal interv level yield characterist depict fig site perform model assum full replic point replic schema scheme replic bold line point orthogon scheme studi replic line consid point fig replic schema realworld replic strategi captur accur profit contribut understand replic affect distribut system perform replic level replic full replic replic object site object site fig model replic depend structur aspect real system matter depend consid model fig sketch structur depend rectangular node repres input paramet model oval node stand intermedi final bold arrow node node depend directli scheme core part model direct impact qualiti arriv rate network substanti influenc result transact type arriv rate servic time messag type transact individu distribut transmiss time depend messag model wide rang applic workload pattern bold arrow highlight import depend load depend commun delai network limit throughput captur throughput depend replic data item replic replic item ta type messag type network traffic network limit throughput limit throughput commun delai qualiti time arriv rate ta type throughput fig depend structur network local bottleneck analysi fig show depend captur found typic analyt model model assum constant commun delai unlimit network capac type queri updat model model captur load depend commun exploit throughput calcul combin simpl replic transact model arriv rate depend nonuniform data model factor access local hot spot access depend neglect studi analyt studi fail cover suffici depend transact process calcul throughput perform criterion combin replic model detail commun cover interdepend previou studi item queri updat constant commun delai access local time arriv rate queri updat data item cach network traffic al commun delai hot spot access factor time arriv rate fig depend hwang al alonso al analyt queue model section present mathemat implement queue model replic approach tabl show model paramet paramet mean number site number transact type percentag transact type function distinguish queri updat transact arriv rate site ta type percentag data item replic copi replic data item servic time transact type coher index commun bandwidth loc transact local replic qualiti replica placement sel qualiti replica select fine tune replica placement fine tune replica select probabl local transact execut send size messag size send transact type return size messag size return queri result send time send transact type return time return queri result tabl model paramet workload model replic open queue network ident site repres system transact arriv distribut system model ident poisson process paramet arriv stream site transact load number site type transact number transact probabl type poisson arriv process site consist separ stream rate characterist function distinguish queri updat type queri type number data object access transact assum geometr servic time transact type local model exponenti distribut servic time combin arriv process transact type distribut local qualiti replic replic due skill data alloc transact exhibit behaviour tend access data item local site submiss model probabl loc transact type execut local forward remot site probabl loc introduc partial replic probabl queri answer local due primari copi write avail select data item replic place impact system perform qualiti replic design perform evalu find replica select major impact replica placement queri select updat intens data item replic high updat propag overhead introduc sel express extent updat type tend access data item select replic sel mean replic data item chang updat type sel signal prefer replic sel declar replica select unfortun updat type access replic data read intens data item perform gain low long replica local queri express extent replica placement probabl queri type execut local mean replica placement necessarili queri declar queri type run home site higher replic updat intens data item select replic local read probabl paramet sel depend replic defin sel sel paramet close sel follow optimum valu assum replica distribut evenli site receiv equal share forward transact propag updat probabl transact type execut local site amount loc loc replic transact process local probabl loc probabl loc queri execut replic local read avail depend replica placement loc sel model data access transact process arriv rate perform replic improv requir mutual consist replica logic data item relax concept relax coher denot coher condit calcul coher index measur diverg small valu express high model suspend updat updat propag immedi total arriv rate total transact type singl site amount total sel share incom transact execut local remain transact forward site data site forward transact receiv remain equal probabl explain term term cover updat propag reduct relax transact type updat local load total updat propag remot site probabl updat remot site hit primari copi sel secondari copi resid local secondari copi distribut evenli site updat propag reduc relax formula simplifi total sel defin total total commun messag requir execut transact remot send queri site result return transact type commun delai send model exponenti distribut send return valu depend bandwidth messag size paramet repres network bandwidth send size return size denot messag size byte send transact type mean send return exponenti distribut servic time defin size send send size return return averag number messag distribut system amount sel sum cover messag type send forward remot site due lack local data updat sum return queri result remot updat assum acknowledg return messag model limit network local consid connect network local commun server model system arriv rate server messag site send receiv number messag due site ident layout symmetr behaviour servic time transact type impli messag messag type exponenti distribut servic time send messag type return express share sel messag servic time send share messag servic time return moment servic time distribut deriv averag wait time local commun server obtain formula gener system result return send return send sel sel perform criteria similar calcul wait time local found total total total total total total total total combin averag time transact type result send return time transact type averag transact type wait receiv servic probabl transact forward remot site wait time return assum return return messag updat steadi throughput local equal arriv rate bound limit system capac throughput grow local server commun server util reach solv equat arriv rate yield maximum limit throughput maximum limit throughput sel return send sel maximum throughput site server satur commun bottleneck limit throughput system throughput amount result express result present base paramet valu carefulli chosen measur system telecom applic valu transact short long queri statist sensit analysi show paramet variat affect perform valu reason model stabl mention absolut valu refer characterist diagram gener shape express graph primari result graph depend input valu number updat intend compar result paramet combin show approach express analysi set paramet fig show maximum throughput model consid case express throughput moder replic remark replic medium high model assum unlimit network capac long data item replic maxim place copi site reach highest peak tp avail requir data item replic medium number copi yield maximum throughput strive high worthwhil paramet base set loc send size byte return size size turn tabl paramet base valu maximum throughput fig maximum system throughput tp replic data item site high throughput full replic result show express approach result throughput maxim place copi site model fairli good replic schema read intens updat intens data item select replic care replica select updat propag overhead dramat number copi maxim enhanc local read avail reliev commun throughput larger valu increasingli difficult avoid replic updat intens data item place copi site afford anymor fig fig replica select throughput peak found low number copi data item replic difficult pick updat intens object replic read avail captur model sel converg replica set result present section benefit replic depend percentag updat workload percentag updat benefit replic gradual reduc eventu outweigh drawback propag cost local parallel read replic yield perform throughput calcul consid limit network bottleneck analysi replic schema read fig low replic satur network earlier updat propag satur local medium high replic updat propag network traffic time local data avail reliev transact load updat secondari copi grow local throughput bottleneck combin averag time shown fig moder replic reduc time half extend replic dimens rapidli satur system propag updat outweigh advantag local read access high time reveal low time replic extend dimens moder replic schemata chosen satisfi applic individu requir reliabl retain similarli low time model replic kind examin averag time fig averag time throughput bottleneck db network fig bottleneck analysi address scalabl fig depict throughput function system size note model consid transact arriv stream site transact load number site number logic data object number site set logic data item replic site data item throughput grow tp number site larger system achiev significantli higher throughput relax coher high replic larg system updat propag overhead hinder scalabl reduc replic data object fewer updat propag transact process bottleneck anymor fig throughput grow tp maximum throughput throughput bottleneck db network fig throughput bottleneck analysi discuss fig throughput scalabl improv mean replic depend critic select data item replic placement copi fig examin impact qualiti replic scalabl replic read intens amount updat intens data item replic copi randomli chosen site remot site read model paramet set replic schema replica mainten overhead benefit local parallel read access transact load number secondari copi grow number local satur propag updat system size low cf fig drastic deterior throughput scalabl throughput replic reduc mean replic replic replic maximum throughput replic schema throughput bottleneck db network fig throughput bottleneck analysi bad replic schema requir meet avail result fig clarifi tradeoff involv unreason high number gener find repres fig fig drastic chang maximum number node reduc absolut valu depend number site rang site hundr site summari outlook base analysi exist perform present improv model approach perform evalu distribut replic system express replic advanc commun possibl model qualiti replic abil arbitrari transact commun pattern applic reflect close interplai replica manag bottleneck find show partial evalu affect throughput scalabl result present illustr limit number paramet demonstr express perform evalu approach simplifi commun model numer paramet variat investig analyt model simul make full valid virtual imposs partial valid model conduct match result extens measur data gather telecom prototyp implement distribut testb valid analyt result refer replic group commun european research seminar advanc distribut system march cach issu inform retriev acm transact vol pp mutual acm sigmod intern confer manag pp june replic analysi queue servic perform evalu vol pp victor analysi distribut concurr control protocol comput vol pp march ab perform model design minim replic distribut driven telecommun journal distribut parallel vol pp octob michael concurr control studi intern confer larg pp classif updat method replic technic report stanford octob structur classif integr replica control technic report columbia dm ps replic distribut ieee transact knowledg data vol pp june erol number copi distribut ieee transact softwar vol pp januari network data intens applic final project technic report rainer matthia perform replic relax intern confer larg pp sept updat algorithm replic data distribut phd comput scienc stanford north jim danger replic sigmod vol pp june sy ks replic distribut perform intern confer expert system pp suit replic protocol base group commun intern confer distribut comput cs ek wy ky evalu replica control algorithm local distribut intern confer system advanc pp april volum john wilei kin updat algorithm replic signal wireless advanc intellig ieee transact vol pp march analysi transact process system rollback ieee transact knowledg data vol pp mc dl replica manag scheme flexibl dynam workshop configur distribut mc analysi transact manag algorithm replic architectur ifip transact scienc vol pp randolph replic perform vol pp eric propag strategi improv fresh data lazi master technic report inria august jf impact network delai timestamp algorithm perform pp juli analysi averag messag overhead replica control ieee transact parallel distribut vol pp oct sh evalu intern confer data pp sh replic control distribut algorithm intern confer system advanc pp stonebrak control consist multipl copi data distribut ieee transact softwar recoveri distribut ieee transact softwar vol pp novemb adapt data replic acm transact vol pp mh throughput estim parallel softwar engin vol pp juli
DB/961 3 preserv associ rule mine vertic partit data abstract depart comput scienc purdu west indiana privaci constrain data mine project paper address problem associ rule mine transact distribut sourc site hold attribut site collabor identifi global valid associ rule site reveal individu transact data present algorithm effici discov frequent itemset minimum support site reveal individu transact valu categori subject descriptor data distribut protect introduct data mine technolog emerg mean identifi pattern trend larg quantiti data mine encompass algorithm associ rule mine sequenc detect algorithm develop central data gather central algorithm run data privaci concern prevent approach central site author data present privaci preserv algorithm mine associ rule vertic partit data vertic site element transact tradit site groceri cloth kei credit card number join identifi relationship cloth groceri permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee sigkdd canada copyright acm chri clifton depart comput scienc purdu west indiana individu possibl violat consum privaci agreement realist exampl manufactur manufactur provid compon finish product car incorpor electr made independ produc proprietari data collect singl kei join data mine malfunct recent troubl ford motor tire provid ford explor tire specif factori separ problem result injuri tire problem tire ford explor pose side felt delai identifi real problem led public relat eventu replac million fine ford explor account million replac tire manufactur data earli gener associ rule base data enabl ford resolv safeti problem public relat problem mine associ rule column tabl split row design initi protocol respond join kei present remain attribut present goal find associ rule involv attribut join kei lai privaci constraint ideal achiev complet practic solut control inform disclosur accept quantifi accuraci effici view secur restrict outlin relat work problem background section formal defin problem give solut section present compon scalar product kei part solut discuss method section present extens limit disclosur section analyz secur provid commun cost algorithm conclud summar contribut paper give direct futur work background relat work central data mine model assum data requir data mine algorithm central site simpl approach data mine multipl sourc share data run exist data mine tool site independ combin fail give global valid result issu dispar local global result valu singl entiti split sourc data mine individu site unabl detect correl item duplic result data singl site homogen hide geograph demograph distinct popul algorithm distribut data mine cheung al method horizont partit recent work address privaci distribut classif address approach develop classifi train site develop global classifi protect individu remain shown individu classifi privat inform recent work address classif bayesian network vertic partit data situat distribut interest respect learn work address privaci concern research inform calcul reveal data made data mine minim inform restrict problem treat approach desir quantif secur process corpor requir absolut knowledg protocol leak inform long inform share bound data perturb techniqu protect individu privaci ad random valu distribut actual data problem approach tradeoff privaci accuraci data perturb appli boolean associ rule interest featur work flexibl definit abil correctli guess perturb data consid greater threat privaci correctli learn cryptograph protocol achiev complet knowledg classif algorithm parti horizont partit data work cooper comput entiti mutual distrust secur parti comput investig yao gener comput semin paper prove exist secur solut idea function comput repres combinatori parti run short protocol secur comput gate circuit particip share input wire output wire gate appeal gener mean size protocol depend size depend size input ineffici larg data mine relationship drawn problem data mine secur comput show secur solut achiev effici secur solut privaci preserv distribut data mine open problem definit heterogen scenario consid vertic partit parti associ rule mine problem formal state set call item set transact set item transact uniqu call tid transact set item associ rule implic φ rule hold transact set confid transact rule support transact set transact mine boolean associ rule absenc presenc attribut repres transact string find itemset count number record valu attribut itemset translat simpl mathemat total number attribut attribut remain attribut bm sequenc support threshold total number repres column xi iff row attribut scalar product cardin vector defin xi yi determin frequent reduc test section present effici comput scalar product side vector show gener protocol gener associ rule share inform scalar product comput gener protocol straightforward assum attribut ap attribut comput frequenc item product individu xi aj yi bj comput share inform scalar product protocol secur comput frequenc entir comput remain attribut itemset frequent creat vector cardin aa ab creat vector cardin bc scalar product itemset complet algorithm find frequent itemset begin ck candid ck begin attribut parti independ calcul attribut remain attribut construct side side ai bi comput xi yi endif lk lk end end answer step function set larg itemset found pass argument gener set candid itemset ck gener superset candid itemset prune set discuss function detail count frequent comput associ rule support step requir share inform final result step reveal extra inform parti show comput step reveal inform compon algorithm secur comput scalar product kei protocol scalar product protocol secur comput cryptograph solut scale data mine problem give algebra solut hide true valu place equat mask random valu knowledg equat comput privat valu side learn substanti number privat valu sourc algebra techniqu recent requir commun cost method present assum loss gener step gener random rn matrix form coeffici set linear independ send vector step comput calcul send independ equat unknown reveal valu gener random number valu obtain full disclosur valu govern partit valu creat earlier valu hide equat yn yn yn yn yn yn send valu yn simplifi group xi yi term xn yn yn line rh succinctli written xi desir final result remain group multipl compon rearrang equat factor ri xi yi ad subtract quantiti side equat chang equat equat rewritten xi yi rn factor ri compon group rest xi yi yn yn yn yn yn yn rn ri valu coeffici ri valu multipli valu receiv ri subtract sum emp xi yi factor emp xi yi rn desir final result xi add sum multipl term temp step send valu comput final result final repli result select protocol requir matrix valu form coeffici linear independ equat necess obviou fact equat hide data valu equat elimin half linkag unknown creat high coeffici matrix gener function form linearli independ equat enabl construct matrix share seed gener function method goal work creat effici method comput associ rule entiti valu requir complet solut discuss problem pose boolean attribut prevent disclosur item exist prevent probe find specif set valu problem true scalar product detect prevent omit due space constraint natur problem parti learn result global associ rule result disclosur support threshold rule item item item properti accept protocol knowledg obtain global rule method presenc absenc rule support threshold side learn exact support itemset probabl learn set item properti occur global support equal support threshold learn probabl item set support properti comput ratio actual support support specif individu data valu certainti method possibl reduc approxim answer troubl mine boolean associ input valu yi restrict creat disclosur protocol scalar product protocol recal equat unknown equat xi valu equat uniqu valu yi obtain correct solut brute forc approach enabl correct valu yi analog situat exist equat yi valu elimin problem ensur multipl solut select valu evid accomplish form equat yn group yi pair select set coeffici pair find solut uniqu yi duplic valu forc multipl solut equat unabl verifi set xi check uniqu solut ri valu requir commun period gener commun order valu pair match period commun cost creat problem secur result duplic half secur valu determin pair tabl secur analysi protocol protect number total number number valu random unknown equat gener reveal xn yn tabl commun cost round cost maximum bit repres input secur commun secur analysi secur scalar product protocol base inabl side solv equat unknown unknown randomli safe assum privat data valu equat solv reveal valu disclosur risk method base number data valu parti extern sourc tabl present number unknown equat gener show number data valu parti knowledg obtain full disclosur scalar product protocol candid item set introduc extra equat candid itemset multipl attribut question linear equat percept weaken privaci data multipl candid set split side candid set equat candid secur valu time equat combin sum reveal addit limit number time run protocol limit adjust reach number entiti high rel number attribut commun analysi total commun cost depend number candid express multipl cost apriori algorithm comput support candid itemset requir run compon scalar product protocol cost run number item send messag valu repli messag consist valu send messag consist valu final send total commun round commun cost constant approxim summar tabl quadrat cost commun valu cost made constant function seed gener valu futur work major contribut paper privaci preserv associ rule mine algorithm privaci preserv scalar product effici protocol comput scalar product preserv privaci individu valu show achiev good individu secur commun cost compar requir build central data direct futur research handl multipl parti parti work limit boolean associ rule mine attribut quantit associ rule mine significantli complex problem privaci issu face type data sequenc detect grand goal develop method enabl data mine singl site respect privaci polici acknowledg author suggest address boolean attribut portion work support grant nation scienc sponsor center educ research inform assur secur refer agraw aggarw design quantif privaci preserv data mine algorithm twentieth acm symposium principl santa acm swami mine associ rule set item larg buneman acm sigmod intern confer manag page agraw srikant fast algorithm mine associ rule intern confer larg data sept vldb agraw srikant data mine acm sigmod confer manag acm chan extens approach scalabl accur induct learn phd depart comput columbia report chan accuraci scalabl data mine journal intellig inform kargupta distribut web mine bayesian network multipl data stream ieee intern confer data mine nov dec fu effici mine associ rule distribut transact knowledg data dec du secur comput problem review open problem secur paradigm sept du secur comput geometri seventh intern workshop algorithm data rhode aug ford motor corpor corpor report plai mental game complet theorem protocol honest major acm symposium theori page secur protocol comput dot product cluster distribut environ intern confer parallel aug clifton distribut mine associ rule horizont partit data acm sigmod workshop research issu data mine knowledg discoveri june privaci preserv data mine advanc cryptolog page aug nation highwai traffic safeti administr tire recal stolfo distribut data mine issu chapter rizvi associ rule mine intern confer larg data base aug distribut part problem class distribut knowledg discoveri ubiquit data mine mobil distribut environ workshop joint european confer machin learn european confer principl practic knowledg discoveri yao gener exchang secret ieee symposium foundat comput page
ML/962 6 autonom helicopt control reinforc learn polici search method andrew jeff schneider control problem robot field cast partial observ markovian problem optim control formal find optim solut problem intract observ simpl structur control suffic good recent research artifici intellig commun polici search method techniqu find control structur control exist tradit reinforc learn algorithm make certainti assumpt learn model calcul optim polici markovian model algorithm evalu control distribut markovian model previou work demonstr algorithm maxim reward respect model uncertainti lead safer robust control briefli perform criterion robust explor search note relat experi design activ learn valid power approach robot applic demonstr present learn control algorithm fly autonom helicopt show control learn robust deliv good perform domain introduct great deal interest appli learn control plan robot autom system obviat tediou develop complex principl model suggest varieti method control base experi gener real system reinforc learn appli real system gather data costli potenti includ learn form system model implicitli determin optim effici data tradit reinforc learn algorithm make certainti assumpt learn model calcul optim variant dynam markovian model content techniqu face difficulti drew jeff schneider carnegi mellon robot applic robot interest system observ actual state system markov process noisi function partial observ mdp learn system design explicitli account result violat markov properti physic system imposs data part model learn algorithm capabl captur subtleti real system learn control algorithm exhibit robust good complex build optim polici typic rise exponenti number dimens learn oper physic world experi costli face explor dilemma learn system trade desir improv model action state explor improv perform desir action good yield problem receiv attent develop strategi explor exploit effici extrem difficult constraint present real system helicopt learn dynam control polici ensur crash oper polici deriv learn model intim ti issu build control explor recent research artifici intellig commun polici search method techniqu amelior difficulti mention argu paper perform metric polici search natur extend evalu control distribut markovian address issu robust explor deal uncertainti model noisi observ markov comput complex overwhelm find optim polici discount pomdp central idea polici search restrict class control observ simpl structur control suffic good recent research polici search method techniqu find good control structur control exist polici search combat comput complex issu introduc problem requir form compact explicit transit cost limit class polici search potenti rapidli find good polici limit complex control serv form structur intract number polici simul evalu subtleti appar reason number evalu properti captur theorem relat uniform converg estim complex search polici class structur polici natur robot field natur build restrict control directli structur easili limit amount comput requir control cycl suitabl limit complex control structur case physic insight lead good select control class previou work safeti address treat learn model uncertainti sourc incorpor stochast transit mdp good empir result method reli assumpt model error uncorrel time rare make explor delib perform polynomi time lead nice theoret result complex reinforc aggress explor algorithm encourag hope build safe control literatur explor problem reinforc learn extens discuss problem ii preliminari setup address formal discuss result measur theoret detail import loss consid introduc notion sampl evalu control stochast process probabl valu state space endow bound reward function max rmax state space control space typic suitabl restrict gener continu space probabl space canon refer bit sampl space note state process determin finit bit stochast process model initi state chosen bit markov process transit kernel partial observ markov ident control access random variabl valu observ space measur control map call strategi polici restrict denot offlin simul determinist simul model sampl typic distribut joint distribut initi markov transit store evalu control determinist simul model reason essenti amount reset random number gener simul pick event roll polici polici critic advantag ensur reward criterion optim function assumpt determinist simul complex theoret prove uniform converg mean time polynomi horizon length iii optim polici perform criterion formal notion build optim control requir criterion judg perform control trajectori natur sum futur reward achiev control denot empir perform polici singl fl fl metric suggest polici order trajectori expect respect measur markov model note initi dynam effect expect model uncertainti complet reinforc learn solut evalu base approach entir posterior distribut point estim find optim control metric correspond bayesian optim control chang time due inform definit polici ffl bayesian stationari perform ffl connect robust explor applic import optim criterion explicitli encourag robust explor address issu length central idea safeti robust criterion maxim perform worst model larg set trajectori control bound control perform robust procedur invert perform similar heurist approach commonli experi design discuss applic stochast optim artifici intellig descript algorithm mention algorithm develop control maxim criterion search good experi perform collect essenti design face heurist optim stationari control version experi point largest expect converg algorithm briefli note theorem complex evalu polici class bayesian stationari perform criterion immedi theorem discret distribut pomdp class strategi dimens ffi polici estim determin sampl algorithm sampl sampl evalu scenario rmax ffl log ffi fl probabl ffi uniformli close polici class type typic lead number sampl encourag term tractabl approach result polynomi complex uniform bound evalu perform criterion extend case infinit action space suitabl assumpt complex discuss polici search complex uniform bound evalu comput complex achiev optim proposit find unrestrict stationari polici achiev largest expect reward distribut markovian partial observ process distribut model result estim rl lead difficult comput problem lose markov properti make dynam program effici solut techniqu problem similar find polici reduct similar prove result sampl algorithm point defer question sampl case bayesian parametr approxim system sampl obtain simpli sampl posterior paramet roll trajectori standard polici evalu problem demonstr regress techniqu admir serv model highli noisi dynam techniqu make imposs directli sampl space model model local weight bayesian regress make sampl set posterior local gener sampl predict distribut due model uncertainti argu combin abil model suffici creat arbitrari length trajectori independ sampl predict distribut regress algorithm optim techniqu section sampl hope close approxim ideal sampl algorithm predict algorithm gener sampl predict distribut learner predict distribut gener sampl state transit predict distribut updat current state updat learn model gener state transit train point observ real system repeat termin state enter effect horizon reach analysi assum repeat time reset learn model back origin model estim optim bayesian expect iter model gener sampl algorithm sampl predict distribut theorem predict model algorithm updat trajectori gener algorithm independ sampl predict distribut argu induct step predict jx jx jx observ data build model discret model jx jx jx jx jt denot discret class model estim data distribut summat posterior model distribut markov model condit observ data transit final equat show jx distribut distribut model simpli learn model data observ transit fig cmu helicopt autonom flight similar result shown technic detail case model distribut law composit drawn iid jx drawn jx pair iid joint predict distribut iv result ampl room appli techniqu develop machin learn commun problem control autonom helicopt autonom helicopt control difficult dynam larg vari great deal flight envelop section detail result appli polici search method previou section problem flight control autonom helicopt dynam begin problem provid manag goal appli consid horizont translat dynam instabl lie control paramount exist tune helicopt dynam goal regul helicopt hover slowli vari trajectori formal cost function optim model model dynam system challeng learn dynam chose implement model form local affin ref ffi ffi lat oe vx pitch vy roll fig graphic depict neural network structur polici control helicopt oper ffi ffi lat reflect cyclic control helicopt state variabl refer translat deviat helicopt set point massiv crossvalid appli determin kernel width data collect pilot helicopt data record kalman introduc data due dynam advantag reduc appar delai control appli unobserv actuat dynam hope captur principl behavior helicopt lower frequenc model interest futur work involv build model capabl captur higher frequenc dynam helicopt demonstr control design control structur initi control simpl control capabl fly helicopt style structur figur decoupl pitch roll equilibrium similiar linear pd control paramet modifi control weight output node paramet sigmoid function hidden output layer fairli simpl control lead polici differenti paramet linear equilibrium hidden layer adapt larg shift posit unlik linear optim maxim bayesian stationari perform criterion demonstr criterion approxim typic lead control aggress obtain optim maximum likelihood model varieti cost criterion time veloc vx vy time veloc vx vy fig data log demonstr perform hover highli train pilot control built robust polici search method lead mildli control typic quadrat ffi lat ffi quadrat form posit variabl typic reflect real perform goal reflect prefer control emphasi stabil veloc angl place huge penalti modest deviat nomin set expect control perform start distant set point reflect cost criterion posit variabl comput linear magnitud state form assign larg penalti larg space data observ establish cost consid task optim paramet trajectori roll sampl techniqu algorithm model typic polici evalu trajectori horizon length discount factor fl amoeba optim techniqu modifi control paramet guid search optima random restart appli initi weight optim find reason solut note differenti optim techniqu smooth penalti introduc valid initi valid experi perform linear model hover good perform model encourag significantli larger bandwidth model obtain local weight regress techniqu develop set techniqu formul model armi develop design specif identif perform system identif frequenc domain treat state space identif optim match problem approach valid numer advantag physic helicopt state space explicitli model dynam introduc delai system model enabl al captur higher frequenc dynam hope frequenc domain approach fundament linear captur dynam small part flight envelop inflex model forc structur accur dramat scale origin design appar excel result hover center model interest note control develop polici search maximum likelihood model highli oscillatori perform linear simul control learn distribut contrast significantli lower loop gain confid achiev simul control port autonom helicopt control comput loop oper simul ensur control wasnt oper model order digit filter implement control output helicopt test result demonstr simpl polici search techniqu gener control applic robot system condit track move set point reject strong figur show typic perform contrast hover highli train human pilot control obtain safe learn control method current work establish framework develop structur control sensit model uncertainti demonstr viabil approach difficult physic control problem futur research direct includ sophist control flight envelop interest area pursu onlin implement polici search dynam reconfigur control interest context event failur critic base limit experi quickli search viabl control extend work appli effici techniqu loop includ faster optim reward shape principl continu investig explicit criterion explor risk sensit polici search acknowledg author gratefulli acknowledg enlighten bernard andrew implement experi helicopt author chuck thorp support research drew support robot institut nation scienc foundat fellowship refer bertseka program athena dynam program princeton larg pomdp reusabl neural inform process system model uncertainti estim safe dynam control neural inform process system kearn reinforc learn polynomi intern confer machin sutton reinforc introduct mit polici search method larg mdp uncertainti artifici sixteenth explor base reinforc tech robot carnegi mellon moor base stochast advanc neural inform process system algorithm sequenti make phd brown local weight regress robot ieee int confer robot april identif unman helicopt present american helicopt societi
AI/963 2 simul team peter stone manuela veloso comput scienc depart carnegi mellon pa robot soccer world cup kitano springer berlin abstract soccer server system rich challeng domain agent accur perceiv act quickli larg noisi world act rang individu skill collabor adversari behavior articl present approach challeng team tournament introduct soccer server system rich challeng domain act interag commun order agent team act real sensat arriv unpredict interv action agent noisi sensori method convert sensori input good world model action capabl rang individu move point kick strateg collabor adversari reason agent act work teammat common goal commun percept central control imposs articl present approach challeng team simul tournament section introduc agent architectur team coordin section present agent world model uncertain environ lot hidden state section lai agent hierarch behavior structur machin learn level behavior individu collabor adversari team flexibl teamwork robot team present section section conclud team member architectur teamwork structur situat team member architectur suitabl domain individu agent captur agreement respond act autonom base standard agent team member architectur agent reason select act real world team synchron team make agreement agent period low commun figur show function model architectur world state intern state real world intern behavior extern behavior architectur sensor inform interpret action primit team member agreement fig team member architectur pt domain agent track type world intern state agent type intern behavior extern behavior world state reflect agent concept real sensor predict effect action updat result process sensori inform updat predict effect extern behavior modul chosen action world state directli access intern extern behavior agreement set team privat synchron defin flexibl teamwork structur present commun protocol agreement chang period team gener remain unchang agreement access intern behavior intern state store agent intern variabl reflect previou current world possibl agreement agent role team behavior store part intern distribut past world state agent updat intern state intern behavior intern behavior updat agent intern state base current intern world team agreement extern behavior refer world intern send command actuat action affect real alter agent futur percept extern behavior world intern direct access agreement intern extern behavior similar set pair condit logic express input action behavior illustr figur behavior direct acycl graph arbitrari depth leav dag behavior type respect intern state intern behavior action primit extern behavior fig intern extern behavior organ direct acycl graph notion behavior consist laid behavior nest select behavior consid agent behavior consid singl behavior intern behavior extern call time updat intern state act team structur present section reli build team member architectur predict memori base sensori inform receiv agent build world state develop predict memori model build probabilist state base past observ make effect model creat store updat knowledg inaccess part environ agent reli past observ determin posit object visibl conduct experi compar effect approach simpler inaccess part environ result obtain demonstr predict approach gener effect memori outperform model layer learn world model successfulli agent respond effect environ section intern behavior updat intern state extern behavior produc execut actuat command span intern extern layer learn hierarch approach client behavior machin learn level kei point layer learn techniqu machin learn opportun individu behavior collabor behavior team behavior adversari behavior environ world model high level goal fig overview layer learn framework design domain complex learn map straight sensor actuat approach difficult aspect domain determin behavior learn learn behavior combin vertic part tabl illustr behavior level robot soccer domain complex futil learn intellig behavior straight primit provid server identifi skill learn move higher level strategi experi insight client act human coach teach young children plai real soccer layer strateg level behavior type exampl individu intercept action select individu pass dribbl player collabor aim player collabor pass teammat team format team strateg posit adversari strateg adapt tabl exampl behavior level ball intercept extern behavior involv direct action environ higher level strateg posit intern behavior involv agent intern state type learn level depend task characterist neural network tree learn ball intercept pass offlin approach task train game situat reinforc learn approach behavior depend oppon adversari action team collabor action select benefit adapt oppon flexibl team structur approach task decomposit soccer server assign fix posit agent approach lead inflex player adapt posit ball locat inflex team adapt oppon local ineffici player tire run field back posit chase ball introduc format flexibl teamwork combat problem team depend player pass fix posit player definit posit includ home home maximum illustr figur posit home coordin default locat agent agent set actual home posit home rang move max agent longer consid posit home max rang posit part format format consist set posit set unit format unit behavior specif member posit figur illustr posit captain unit left center player home coordin max rang home rang center left unit unit captain fig posit home coordin home max rang posit belong unit player addit belief team current format time format map teammat posit player consist belief team condit synchron opportun team structur featur simul soccer team featur definit switch multipl format flexibl posit adjust posit special plai dynam switch format implement rang full definit format part agreement teammat period full autonomi low necessarili format rest teammat approach address ffl static format format set agreement ffl switch format team synchron team set global access evalu metric indic cmunit team switch format base amount time left rel differ team switch format lose end game format win agent independ track score agent switch format simultan flexibl posit multiag player posit flexibl anticip wai agent posit flexibl react ball posit mark oppon react ball agent move locat rang minim distanc ball mark agent move oppon stai default posit home oppon mark chosen player closest unit captain ensur oppon preset algorithm part agreement homogen agent plai posit capabl challeng issu player chang posit agreement procedur team coordin role chang agreement design order switch posit unit switch posit joint perform team improv save player energi respond quickli ball set plai final implement improv facilit flexibl teamwork structur introduct set special plai part team defin multiag soccer format typic forward plan execut time situat occur make team plan situat robot soccer situat occur repeatedli center spot ball inform team situat player execut set plai behavior player role pass player fill shoot kick ball locat found set plai significantli improv team perform goal score set plai soccer server system wide rang ai challeng approach problem rang world model multiag cooper machin lean techniqu improv perform individu team behavior success implement reach acknowledg research sponsor part advanc research project agenc rome air forc materiel agreement number part depart offic naval research contract number view document author interpret necessarili repres offici polici express air depart offic naval research unit state govern refer mike peter manuela veloso predict memori inaccess environ workshop page novemb hiroaki itsuki minoru hitoshi osawa challeng problem ai ai spring michael richard world encyclopedia soccer visibl ink maja matar interact intellig behavior mit eec phd thesi mit ai august itsuki noda hitoshi matsubara soccer server research system workshop novemb soccer server url peter stone manuela veloso layer approach learn client behavior robocup soccer server appli artifici manuela peter team hiroaki robot soccer world cup page springer
ML/964 6 distribut control barri brian perform robot abstract distribut control team mobil robot present number uniqu includ highli real world task safeti dynam heterogen lack standard tool techniqu similar problem plagu develop singl robot applic revolut led techniqu robot control base behavior implement system control singl potenti distribut control robot control fulli realiz paper present system distribut behavior control standard interact place ip extend paradigm provid arbitrari scalabl give overview broadcast local gener techniqu construct scalabl system survei research project applic implement distribut control architectur distribut system strong trend robot commun distribut robot system group robot singl robot greater achiev strongli cooper task simpli perform robot uncommon dai mobil robot equip wireless ethernet commun architectur address problem specif robot domain ffl sophist radio system subject loss bandwidth due rf competit bandwidth barri brian ffl real world task safeti robot task time depend crucial task perform system surviv inform sever limit lifetim measur influenc reliabl commun address ffl motiv research involv economi vision group robot lesser task perform linearli drop robot good distribut robot architectur robot effici ad system ffl dynam robot prone commun problem mention lead robot unreach vari period scalabl factor mention lead chang robot team applic benefit abil match robot task user program configur ffl robot equip differ reliabl subsystem applic benefit abil automat match robot task base individu robot vari time rest paper describ architectur design address issu distribut robot control distribut distribut control robot coordin robot machin effect singl configur group interact central explicit commun share sensor read discuss briefli behavior paradigm outlin extens present techniqu build system present survei number success system control approach robot control introduc rodnei brook influenti field robot term commonli accept descript effect year principl horizont world intellig ey brook salient contribut contribut set welldefin abstract techniqu behavior implement number languag flexibl successor subsumpt architectur refer abstract techniqu behavior distribut control behavior languag numer experi demonstr scalabl approach higher level matar demonstr distribut map social learn mae work action select system maintain commun method behavior languag behavior code facil common lisp system successfulli domain robot soccer learn interact control written term group concurr process behavior interfac share part access behavior extern access element refer port regist hold singl data item simpl integ arbitrari data intern access part interfac regist port access process boolean variabl remain true period time trigger port behavior link unidirect data path sourc port destin port port number incom outgo connect data arriv written directli process behavior indirectli gener propag port outgo connect data flow modifi connect overrid connect port port period effect messag propag ffl written propag ds outgo connect normal connect ffl written period incom connect write port connect temporarili ffl written period messag propag port connect temporarili ffl input suppress period messag arriv written propag normal ffl output inhibit period messag arriv propag outward normal mechan suppress inhibit subsumpt form effici barri brian intuit implement connect extern behavior code easili interact behavior modifi dynam port abstract enforc approach program comput sensor read effector action place coordin interact behavior behavior system complex control built extrem easili testabl behavior approach uniform interfac encapsul system compon level abstract issu time behavior reactiv map delib planner research interact system compon reduc complex compon type behavior languag limit specif target develop widespread system built implement control captur eleg messag suppress lack implement basic substrat system major reason approach problemat scale behavior languag facil behavior distribut robot allianc architectur provid control robot commun gener commun arbitr techniqu behavior robot extend notion connect network distribut comput open wide rang robust algorithm coordin develop distribut control extens languag intend develop distribut control system group mobil robot facilit commun distribut system compon schedul task featur special develop wide rang architectur reactiv mean coordin plan vision control small refer easili ad serv simpl effect heterogen system compon design highli distribut control portabl oper system maxim princip goal facilit implement robust system cope noisi variat resourc task requir redistribut system hardwar failur messag pass wide varieti great deal system flexibl includ dynam reconfigur behavior structur redistribut task group robot determin task constraint chang avail resourc question languag librari strictli refer involv syntact structur foreign differ semant make extens cs macro result standard preprocessor translat code standard code consist header file object code standard refer gener develop languag extens paradigm extend paradigm primari wai abil connect behavior arbitr ip addit featur provid scalabl system connect network extens ip make connect pair tripl behavior distinct made support ip broadcast local connect made host broadcast messag propag connect port host network sender broadcast connect special scalabl featur regist natur previou system easi arbitrarili add behavior port ad comparison made data sourc robot ad behavior interfac robot chang data robot percentag robot data overwritten lost barri brian flexibl group robust robot failur address problem addit special port messag incom written port hold data item current ffl normal incom replac current ffl current incom current ffl current incom current ffl current incom current ffl current incom iff incom current demonstr section suffici implement group coordin strategi add type ffl written period messag written directli behavior propag messag arriv connect control inform flow construct arbitr structur present section scalabl observ present effect strategi implement small number connect extrem simpl compon behavior system perform cooper observ multipl move target task goal group robot number move target observ field view robot meter target target target cover order construct system maintain observ highest prioriti target make robot properli distribut separ target redundantli observ target leav adapt chang number robot target robot techniqu call broadcast local elig ble approach detail distribut control output inhibit local robot behavior output inhibit local robot behavior output inhibit local robot behavior search search observ observ observ observ search observ observ search observ observ search observ observ observ observ robot robot robot output inhibit output inhibit fig peer group structur system creat combin local subsumpt line omit connect broadcast local elig ble mechan involv comparison local determin elig elig calcul peer behavior robot robot local elig behavior bn perform task tn inhibit peer behavior behavior bn task tn inhibit activ failur robot claim task result task immedi potenti robot order behavior particip ble implicitli declar behavior normal port local inhibit behavior refer process arbitr peer instanc behavior robot behavior instanc bn perform task tn result select singl robot perform tn select robot elig local task illustr figur local port robot behavior bn broadcast elig estim port robot behavior bn port maintain maximum elig messag receiv current cycl whichev robot local elig equal receiv write inhibit inhibit behavior bn robot barri brian arbitr peer behavior local mechan arbitr behavior robot simpl combin suffici robust team cooper call combin local subsumpt robot local subsumpt hierarchi layer hierarchi figur result system similar diagram figur robot control behavior bn highest prioriti behavior gener behavior gener output fail current input unsuit task object field output robot claim task suitabl implement figur show code descript refer behavior mention common behavior singl behavior robot control translat motion maintain safe veloc base distanc obstacl behavior control rotat motion robot class behavior observ behavior rotat robot specif target center field view combin common veloc control robot approach specif target maintain distanc approxim foot search search behavior random wander ble ble control subsumpt hierarchi instanti observ target observ highest prioriti target observ lowest join broadcast peer group consist observ target robot figur produc hierarchi figur local evalu function observ behavior proport height target visual field approxim distanc behavior control robot robot approach track target observ robot distribut control local elig estim void main peer pioneer mobil robot fig code discuss detail slightli complic version ble approach implement pioneer robot target proven effect properli assign robot target robot switch observ coverag target system advantag pattern abil robot observ target time robot tend cover target task achiev interest benefici effect tend reduc problem sensor uncertainti physic robot barri brian system practic addit partial survei research project applic museum film special roam sale exhibit trade work perform art number robot competit includ aaai robocup robot soccer competit implement cooper behavior robot cooper autonom robot helicopt format control outdoor environ build topolog map system run robot commun desktop work cooper map heterogen robot substrat behavior control experi involv artifici emot social robot continu research present work planar object manipul experi robot learn cooper analysi benefit interact human refer arkin robot mit ronald arkin tucker balch cooper multiag robot system david peter robin artifici intellig mobil case studi success robot page aaai mit brook behavior user guid memo mit ai april brook intellig mit brook rosenberg common lisp system lisp vendor user topolog map build mobil robot sensor fusion decentr control autonom robot page brian maja matar task alloc heterogen agent autonom patti mae situat agent goal robot autonom maja matar navig rat model robot spatial intern confer simul adapt anim animat mit maja matar exampl group behavior journal theoret artifici distribut control francoi michaud maja matar behavior histori learn nonstationari condit robot autonom francoi michaud vu manag robot autonomi interact motiv visual commun proc conf autonom page monica maja matar learn cooper interact submit parker cooper robot appli observ intellig plan world parker architectur fault toler cooper ieee transact robot paolo maja matar target acquisit multipl object behavior coordin ieee intern confer robot san april matar design implement mechan heterogen robot group sensor fusion decentr control autonom robot page design behavior multipl robot system cooper object manipul intern symposium intellig barri cooper minim approach team artifici barri brian maja matar broadcast local elig observ submit
ML/965 6 evolv optim function neural net modul atr artifici brain project hugo de gari michael hough michael evolutionari system atr human inform process research kyoto japan comput scienc depart stanford usa suit boulder usa abstract paper report effort evolv optimum function convert analog binari signal vice versa binari signal neural net circuit modul evolv electron speed machin atr artifici brain project cbm fpga base piec hardwar evolv ten thousand cellular automata base neural network circuit modul electron speed download architect artifici brain larg ram space programm fpga constrain bit binari signal neural model model effici techniqu convert digit signal analog vice evolv term analog signal term abstract spike train inform signal space earlier convolut digit text book figur fig gave moder accuraci actual desir output result appli genet algorithm evolut function make accur accuraci import reduc cumul error output neural net modul input long sequenti chain modul artifici brain architectur consist modul cbm handl modul maximum artifici neuron deliv atr spring introduct paper report effort evolv optimum function convert analog binari signal vice versa neural net modul evolv atr machin cbm fpga base piec specialist hardwar grow evolv cellular automata base neural network circuit electron speed updat ca rate billion evolv neural net modul complet run genet algorithm ten thousand circuit growth fit constraint fpga chip cbm bit neural signal interpret problem bit signal enter exit modul interpret eventu chose convolut spike train binari convolut function digit figur text book fig horizont axi show number clock vertic axi show valu convolut result convolut analog waveform moder accur actual waveform convolut spike train evolv simul cbm differ target waveform roughli thought good motiv accur function evolv reason import greater modul margin error time assembl ten thousand modul artifici hierarch modular error accumul pass sequenti modul point render artifici brain set improv accuraci actual output target output success project artifici brain depend attain greater accuraci sourc error evolv ca base neural net cbm due limit function user suppli analog valu input analog target output cbm cbm pure digit input user term analog easier abstract deconvolut convolut transform sourc error due qualiti evolv neural net modul paper address sourc error paper publish qualiti evolv modul attempt reduc kind approach initi arbitrari sinusoid analog wave form form shown fig smooth input deconvolut function explain section result spike train output deconvolut algorithm base convolut function convert spike train back analog output explain section result final convolut output result origin analog input wave form step approach shown fig genet algorithm evolv digit valu convolut function analog gave match target waveform origin input analog fig origin convolut cycl wide fig arbitrari sinusoid analog test wave form fig result deconvolut fig analog curv deconvolut convolut back origin analog curv fig sequenc remaind paper consist section section explain convolut approach interv inform convert analog waveform section explain deconvolut convert analog waveform deconvolut algorithm digit valu convolut function section explain oper optim digit valu convolut incorpor deconvolut gave closest fit origin analog input wave form final output analog wave form section report result obtain thought optim test section limit higher higher function longer cope section summar offer final remark convolut interv inform constraint programm fpga ca base model codi simpl order implement constraint neural signal state model made bit inform natur spike problem interpret assign mean binari stream clock sequenc neural net modul input idea frequenc base count number time window clock thought slow artifici brain ten thousand modul vertic nest depth output modul layer fed modul layer larg cumul delai end total time robot slow wave finger front react deliv integ real valu number clock ultim speed call neuron output surfac fire clock fire pattern repres integ independ output found ultim chose convolv binari string convolut function shown fig call interv inform inspir deliv real valu output clock convert binari string analog time depend signal team publish paper result convolut work cbm implement fpga measur fit valu electron speed detail convolut algorithm output bit string cbm run convolut function shown simplifi output time defin sum sampl convolut filter posit clarifi meant simplifi convolv left bit convolut filter valu diagram move left convolut filter view convolut filter move number colon show convolut sum time spike train left convolut filter output convolut filter valu time vari analog desir result deconvolut section explain interv inform effici transform spike train string time vari signal interpret order interpret spike train output codi modul evalu fit valu compar actual convert analog output waveform user target algorithm clock integ time vari output spike train interfac robot bodi artifici brain brain codi modul ee term analog signal input visual make task evolv codi modul easier present algorithm opposit time vari analog output spike convolut convolut result origin analog signal descript algorithm gener time vari analog signal present call view convolut algorithm section give intuit feel deconvolut consist singl pass convolut function add convolut function output turn singl convolut convolut function express function time convolut convolut seri spike time delai convolv sum convolut time delai clock tick add convolut filter output shift time offset repeat spike train convolut filter deconvolut advantag effect kind progress subtract convolut function clock valu convolut function analog valu subtract convolut function valu analog valu justif analog valu greater convolut impli gener analog signal valu clock codi modul fire fire contribut set convolut valu analog output determin clock subtract convolut function similar process undertaken clock tick convolv output valu convolut function simpl previou section sig subtract subtract subtract subtract assum spike convolv output convolut filter clock tick target spike bring valu closer waveform low spike futur spike bring closer code algorithm dur durat number error sum differ convolut waveform clock number element convolut wave store waveform clock bit store spike histori thresh threshold decid error small valu convolut function void char int int int error fig show action origin input analog signal smooth curv fig output gener shown fig result analog input convolut function shown fig result analog output close origin analog input curv curv fig result output curv work valu waveform larg greater chang quickli rel time width convolut filter window simpli add constant incom analog signal spike ensur analog signal chang rapidli filter high frequenc compon signal low frequenc band pass evolv optim result evolv accur initi approach evolv integ valu digit convolut function type shown fig fix window width fig popul integ string integ constant integ valu digit convolut averag percentag error actual analog output target analog output genet algorithm fit function member ga popul fit score serv basi comparison improv score evolv convolut function progress smaller size window width arbitrarili construct sinusoid type wave form evolv valu convolut function averag error actual target wave form wave form comput load window width case fairli run gener ga minut ibm mhz practic idea ga chromosom list posit integ deconvolut algorithm work neg simpli ad larg constant digit convolut function chose ga paramet valu genet oper popul size mutat oper integ integ convolut valu random posit convolut valu gener convolut increment decrement integ convolut valu list convolut function deconvolut function perform experi fit definit sum absolut differ actual output valu target valu valu origin wave tabl show percentag error window length averag curv column show truncat percent mean dozen output valu clock cycl output gener convolut function time climb target curv gener excess error curv fig climb phenomenon tabl percentag error window width window width percent error percent error truncat chose convolut function window width truncat percentag error convolut function valu depict graphic fig fig evolv convolut cycl wide arm evolv convolut function test origin width convolut function pair arbitrari test wave form shown tabl show result comparison origin width convolut function text evolv width convolut function accuraci improv evolv convolut function factor justifi effort evolv convolut function fig show target actual output waveform evolv convolut function tabl percentag error comparison textbook evolv case window width percent error percent error truncat convolut convolut test obtain optim convolut function window width function appli sinusoid wave form cope fig show window width convolut function cope trace sinusoid form figur show result output wave form approxim initi wave form close truncat percentag error percentag differ actual target waveform averag number clock case case frequenc waveform chang faster window width convolut function case show convolut function give good result frequenc wavelength window width convolut function trade qualiti trace lower window cope higher frequenc wave form felt window width clock adequ project summari final remark programm hardwar constrain bit neural signal model model neural net modul evolv electron speed machin februari immedi interpret problem bitstr enter leav cbm neural net modul user useless uninterpret mean convert time depend analog waveform vice versa user option term analog waveform constant paper show dual convolut process call interv inform code algorithm transform discov shown question fig target actual sinusoid wavelength cycl convolut function simpli digit convolut function text book began window width clock cycl good percentag error actual target waveform appli genet algorithm evolut convolut function window manag reduc width doubl accuraci time assembl larg number evolv neural net modul artifici accuraci modul output reduc cumul error sequenti chain output modul input modul output fed directli input evolv modul case evolutionari engin analog input output waveform correspond analog waveform correl close optim work undertaken import project refer hugo de gari artifici brain atr project aim artifici brain million neural net modul insid cell cellular automata machin gener comput juli hugo de felix michael build artifici brain fpga base machin artifici life robot fig target actual sinusoid wavelength cycl hugo de michael felix michael hough build artifici brain fpga base machin appli mathemat comput special issu artifici life artifici brain comput felix hugo de michael simplifi cellular automata base neuron model artifici evolut octob michael hugo de felix hitoshi cbm hardwar tool evolv neural net modul fraction run million neuron artifici brain real time john marco david max hitoshi rick genet program annual juli michael hugo de gari spike interv inform code atr machin intern confer evolv biologi hardwar septemb fred david rob de van william explor neural code mit articl process macro packag llnc style fig target actual sinusoid wavelength cycl fig target actual sinusoid wavelength cycl
DB/966 3 queri rewrit semistructur data yanni papakonstantin san diego vassalo stanford paper number abstract address problem queri rewrit languag queri semistructur data develop present algorithm semistructur queri set semistructur view find rewrit queri access view produc result algorithm base appropri gener unif techniqu develop relat data develop algorithm check queri show algorithm sound complet find rewrit queri discuss complex extend rewrit algorithm structur constraint find opportun queri rewrit incorpor algorithm tsimmi system introduct semistructur data queri view definit languag queri manag web data biolog integr heterogen data harvest inform discoveri access system lotu note messag groupwar system import precursor approach data model semistructur model flexibl natur inform system semistructur model context web data partial implicit structur semistructur model xml emerg standard model exchang web data case relat rewrit semistructur queri view fundament queri process optim tool semistructur queri section contact vassalo tel research partial sponsor award number wright aeronaut system air forc materi grant number research partial support nsf grant air forc contract foundat present abstract version rewrit problem describ includ rewrit build tsimmi system rewrit problem suffici level abstract rewrit problem face applic list queri access semistructur set view fv find rewrit rewrit queri queri access view return result rewrit queri view access directli call total rewrit queri applic rewrit algorithm semistructur model repositori store semistructur data mediat integr heterogen inform import rewrit algorithm mediat repositori relat wit applic semistructur world relat queri rewrit algorithm answer queri materi view queri cach view mediat system describ sourc content limit queri capabl sourc constant view select resid sourc declar answer queri pick attribut ra bound constant queri sourc data rewritten correctli content capabl correctli view case queri access view total rewrit queri point highlight import rewrit algorithm relat mediat rewrit algorithm equal import semistructur mediat rewrit algorithm tsimmi rewrit cach queri tsimmi mediat integr semistructur data multipl heterogen inform sourc virtual view vm view rewrit algorithm gener integr architectur shown figur bibliograph mediat combin data multipl bibliograph sourc singl view run user mediat multipl queri refer sourc data bibliograph sourc access interfac distribut multipl site formal concept definit rewrit queri section integr view inform inform sourc sourc inform sourc wrapper wrapper wrapper mediat figur tsimmi integr architectur mediat rewrit queri engin queri candid plan plan cost estim queri plan queri queri cost optim figur mediat architectur vari queri queri emit mediat conform capabl illustr issu user queri request public mediat user queri multipl queri refer sourc figur decomposit correctli effici mediat figur capabl underli extract inform sourc made rewrit modul run sourc support queri cbr decid queri retriev public sourc filter mediat mediat formul queri plan respect queri capabl queri translat nativ queri languag sourc individu queri public sourc inform appropri consolid entiti mediat combin result present user tsimmi system parametr view describ queri capabl mediat emploi simplifi version rewrit algorithm accomplish task process implement fulli gener queri rewrit algorithm present paper tsimmi system note exist paramet view affect complex problem present clariti work paper plain semistructur view parametr rewrit algorithm semistructur algorithm answer queri materi view cach queri repositori semistructur lore cach queri result rewrit algorithm creat rewrit queri public obtain filter cach queri public notic rewrit algorithm queri cach queri statement examin sourc data cach queri plai case role view materi view cach queri main origin motiv relat queri rewrit import semistructur algorithm applic repositori web data store xml data similar data model queri languag tree specif languag work similar recent xml queri languag web site manag structur web recent work appli concept inform integr task build complex web site serv inform deriv multipl data sourc web site site graph semistructur data graph content inform sourc access inform web queri data graph rewritten queri web site structur content web site definit view definit data queri rewrit handl algorithm data model queri view definit languag tsimmi model semistructur data oem data model label graph model node uniqu identifi data model semistructur inform system strudel lore unql easili reduc oem express queri view implement languag creation semant skolem function featur strong restructur queri result autonomi bibliograph sourc rewrit queri deliv stale result user result user assum sourc delet cach result correct answer user quickli deliv user inspect cach system collect current result sourc system place account cach sourc paper deal consist issu focu rewrit algorithm arbitrari answer tree major sourc practic applic restructur capabl suffici power resembl datalog facilit present similar differ rewrit relat conjunct queri semistructur queri highlight similar goal paper describ detail section restructur note queri copi arbitrarili support label variabl enabl queri data algorithm algorithm solv rewrit problem output finit set rewrit queri condit refer view rewrit queri view reason cost effici strictli fewer includ algorithm return rewrit return set rewrit queri properti algorithm oper find candid rewrit queri retain candid rewrit queri origin queri algorithm gener map view origin queri order narrow space candid queri algorithm chase techniqu deal kei depend hold object ident test candid rewrit queri origin queri accomplish step algorithm rewrit queri view obtain queri rewrit queri refer view test origin queri develop condit queri extend condit union conjunct queri queri path express extend rewrit algorithm make structur constraint sourc data constraint easili express standard xml dtd newli exist constraint find rewrit case absenc algorithm fail lesson result rewrit algorithm base extend unif relat semistructur world benefit vast bodi knowledg relat queri rewrit obtain insight interfac optim tsimmi system figur reader reduct semistructur data present conjunct rewrit problem fulli reduc relat conjunct queri rewrit problem answer neg queri articl dbpl book titl isbn titl keyword author confer locat year isbn figur oem object reduc conjunct relat queri queri view reduc datalog function symbol limit form function symbol introduc construct object semant copi arbitrarili deepli nest object sourc queri result copi import featur integr semistructur sourc factor make rewrit semistructur queri harder relat queri lack schema necessit label variabl queri view exist structur constraint opportun queri rewrit identifi situat infer depend structur extend rewrit algorithm depend content section introduc oem data model queri languag semistructur data section state rewrit describ algorithm describ map queri composit section present algorithm test queri section prove correct rewrit algorithm queri view discuss complex rewrit problem section discuss relat work section offer conclud remark discuss futur work oem data model queri languag oem data data repres root graph label node call uniqu figur illustr bibliograph data repres oem atom object atom object set semistructur struql recent adopt approach set object point outgo edg notic definit inher object part set object essenti oem subgraph root root graph illustr top level object start point queri sourc note ignor object reachabl root graph typic atom data gener case term herbrand ffl set atom includ necessarili confin atom data label valu ffl arbitrari set uninterpret function symbol function symbol term symbol mean case semant mean object web page typic good idea url term facilit integr task oem model data natur repres arbitrari expect deal xml data natur repres direct acycl tree queri rule defin queri result minim model semant rule consist head style datalog head describ result object answer bodi describ condit satisfi sourc object head bodi condit base object pattern form label field term atom function symbol term set pattern object pattern term field head queri uniqu restrict forc produc fresh object queri result forc produc answer tree arbitrari graph queri result discuss remov restrict result section semant power illustr semant femal person gender semant queri tupl bind variabl data sourc db person object identifi object gender subobject femal object id object subobject object id object queri result exclud femal object subobject object id object subobject result rule subobject object note subgraph data db answer queri object uniqu structur denot queri head queri construct answer object tree restructur sourc refer result queri answer tree copi semant subgraph queri result construct tree subgraph potenti hang branch note final queri refer data condit refer oem pd set subgraph set set label atom valu vo set variabl vc set vo vc vo vc set variabl mean queri bodi set assign pd satisfi condit bodi assign map variabl label variabl variabl pd mean queri head creat label node answer make object pattern queri root answer tree object pattern xm queri assign creat object label object pattern fo creat object notic assign produc term object valu object translat datalog function symbol limit fix schema shown express struql express linear datalog queri comput parallel time polynomi processor ae rest posit queri cyclic object pattern bodi condit object pattern cycl oem simplifi focu normal form defin queri easili convert normal form focu normal form limit power languag normal form queri queri bodi field object pattern normal form queri condit bodi call singl path queri queri easili transform normal form rememb set object essenti oem subgraph root object variabl variabl field object pattern femal person gender person safe queri queri safe variabl queri head queri bodi simpl syntact test defin safeti conjunct queri defin safeti remaind paper discuss safe queri view view defin simpli queri view defin oem space uniqu easili accomplish qualifi view import point featur essenti queri integr semistructur abil queri copi arbitrarili nest abil restructur data semant abil queri data label variabl queri rewrit queri refer oem conjunct view vn refer rewrit problem find queri refer vn oem result result definit call rewrit queri rewrit queri start discuss straightforward definit oem oem oem set object identifi label atom set atom object atom set object ident set subobject appar definit carri queri result view defin oem renam discuss issu section rewrit queri singl path condit inform present algorithm decid queri singl path condit rewritten singl view path condit special case complet rewrit algorithm section illustr basic step techniqu gener algorithm proven sound complet section step find candid queri find map view condit develop candid queri map note special case queri singl path condit map candid queri step find map map bodi bodi map extend cope object nest formal defin section map variabl bind satisfi bodi bind satisfi bodi map condit relev view queri condit map condit condit check rewrit queri notic map bodi singl path condit bodi gener case multipl map view restructur person object db object label properti subobject valu subobject notic inform show label valu db correspond disappear queri stanford answer view inform correspond show algorithm find rewrit queri person properti person stanford person map bodi bodi condit stanford enforc view order object relev queri step gener candid queri appli map result build rewrit queri head ident head bodi head continu candid rewrit queri creat head result appli head stanford person properti exampl illustr technic issu artifici step test correct candid queri check composit denot ffi step accomplish step comput composit composit ffi rewrit queri view comput comput ffi composit algorithm base extend resolut unif semistructur data algorithm essenc exponenti time size queri composit algorithm illustr formal present section step test ffi gener idea test find map map ffi map head ffi head condit ffi map condit map map ffi note ffi normal form order test continu test valid rewrit queri transform normal form norm final compar result queri norm norm map map norm map map norm norm stanford person properti person norm stanford person person set map rewrit queri appli condit variabl handl map extend map variabl set pattern queri view clear bind set valu subobject algorithm captur intuit develop map bodi bodi notic map stanford person stanford person properti candid queri creat head result appli head gener test algorithm exist full descript test algorithm section map suffici exist rewrit queri illustr test step algorithm queri view stanford person rewrit queri view correspond label valu attribut subobject imposs rewrit queri discov object object notic rewrit queri map base map algorithm deriv candid rewrit queri composit candid rewrit queri view result queri origin queri notic label object subobject object stanford person properti stanford person person formal defin map describ algorithm map composit subsect extend chase set deal kei depend subsect discuss algorithm exploit structur sourc data subsect present gener algorithm queri rewrit map formal defin map map composit map set structur form variabl rh transform object pattern conjunct object pattern rh term set object pattern pattern hand side variabl left hand side valid applic map oem object pattern result appli map oem object pattern pattern variabl left hand side replac hand side map applic object pattern result pattern valid oem set pattern label compat kei depend composit map denot ffi deriv appli variabl set pattern hand side deriv subsequ concaten map composit composit ffi map consist rh structur rh structur includ structur form rh rh complet algorithm discov map set singl path condit set singl path condit appendix extend chase set variabl object ident introduc function depend oem depend object id label structur constraint introduc function subsect rewrit algorithm chase techniqu deal depend techniqu extend case variabl bind set motiv present extens present case kei depend extens appli gener function depend variabl hand side stan student person person set variabl erron discov rewrit queri map condit condit kei depend infer set variabl transform notic variabl transform set pattern recal queri cyclic object pattern simpl extens chase termin depend chase extens object pattern queri term field ffl label field replac occurr ffl object pattern fo field replac occurr variabl ffl fo field fc replac field fo ffl constant replac occurr variabl constant ffl constant constant halt error queri chase queri satisfi kei constant field ffl ident drop order function depend involv chase rule structur constraint queri rewrit semistructur data accompani constraint partial defin structur object structur constraint express dataguid data sourc db previou exampl conform person alia address phone middl dtd describ flexibl structur sourc data specifi object label person subobject label phone affili subobject specifi subobject phone address atom infer inform form depend label rewrit algorithm discov rewrit case fail infer automat db subobject person object subobject object exist function depend label person label dtd person object subobject impli applic chase rewritten stanford person person chase depend chase extens deriv obviou valid rewrit queri oem support ignor order dtd descript stanford person illustr previou identifi case inform easili infer structur ffl label structur constraint specifi subobject object subobject infer ffl structur constraint specifi object label subobject label infer function depend variabl rewrit algorithm advantag inform perform label infer chase view candid illustr straightforward show appli label infer chase termin time polynomi length queri constraint descript easi show label infer chase affect sound rewrit algorithm presenc structur opportun queri simplif queri rewrit subject futur work gener case queri rewrit treat gener case queri rewrit number view number condit bodi queri appli chase techniqu function depend account sake view set view method gener trivial view set algorithm subsect cover gener case view notic semant properti object retain inform object origin properti queri person properti person stan student person person answer find ps subobject map bodi condit impli pick subobject map bodi condit impli head rewrit queri head bodi conjunct stan student person properti person properti check valid rewrit queri mean transform normal form check norm stan student person person person person notic make kei depend oid map bodi queri bodi chase infer stanford rewrit algorithm algorithm gener rewrit queri exist queri bodi convert normal form label infer chase appli appli algorithm queri singl path condit bodi set view fv set rewrit queri step find map bodi bodi map discoveri algorithm appendix step construct candid rewrit queri ffl head ffl conjunct condit view condit result queri continu candid perform label infer chase step test construct correct construct composit vn vn section perform label infer chase vn vn section includ continu candid notic algorithm construct candid queri step basic random effici algorithm substanti improv simpl heurist effect heurist ffl track condit queri bodi instanti view map condit ffl construct candid queri view condit bodi condit bodi variat heurist implement rewrit modul tsimmi system subsect formal defin composit queri composit queri perform step rewrit algorithm present section composit queri composit queri queri ffi oem queri composit accomplish resolv condit bodi head unif gener unifi defin unifi singl path condit gener condit unifi pattern includ pattern definit object pattern singl path pattern includ pattern label field field form fe field form fe pattern includ field form fg field form fe field queri composit easili gener multipl queri vn detail queri view exist unifi condit head exist unifi condit head mean result resolv condit view condit exist unifi consist notic multipl mgu gener unifi practic consequ result ffi conjunct union conjunct queri consist rule consist exponenti number rule polynomi observ theorem theorem queri composit exptim notic order resolv queri condit view head matter obviou queri composit view transform queri refer object pattern view head queri refer object view defin complet unif algorithm appendix queri queri oem result develop test base extens map assum chase appli queri problem complic restructur capabl queri head construct arbitrari answer graph rule contribut part answer graph make compon result graph requir decomposit spirit normal form decomposit queri bodi section step queri rule appendix show normal form decomposit determin queri queri graph compon queri correspond compon result node object rule type finer grain ffl top rule top level condit head queri correspond root oem graph construct head ffl member rule relationship head queri correspond edg oem graph construct head start end ffl object type rule object condit queri head object oem graph construct head describ label decomposit illustr reduc rule essenti set valu object possibl set includ object unbound depth prevent conjunct reduc datalog note member top depart syntax connect datalog decomposit graph compon queri recal oem graph root condit result graph compon queri easili theorem set fp png ft tm graph compon queri exist map exist map proof theorem straightforward gener theorem union relat conjunct queri theorem theorem queri queri decomposit graph compon queri straightforward deriv simpl test queri complex previou section shown queri rewrit step find map bodi view bodi queri view head construct candid rewrit queri step check correct rewrit step establish sound rewrit algorithm prove complet show find rewrit queri exist assum structur function depend kei depend presenc arbitrari function infer structur easi show rewrit algorithm complet simpl counterexampl case relat queri prove complet observ map view bodi queri view queri lemma queri rewrit queri view map bodi bodi bound number condit variabl rewrit lemma queri set view exist rewrit exist rewrit consist view number singl path condit bodi queri lemma exist rewrit queri set view exist rewrit doesnt variabl dont exist notic view head singl number singl path rewrit greater lemmata demonstr theori relat queri present gener notic lemmata hold presenc kei depend algorithm complet addit function depend infer kei depend disjoint set condit impli extra function depend disallow lemma justifi complet construct rewrit queri head ident head queri issu semistructur nest model trivial relat model head variabl head lemma exist valid rewrit queri exist valid rewrit queri lemma notic exist queri appli rewrit algorithm deriv queri head ident head theorem rewrit algorithm subsect sound complet algorithm step correct test complet queri composit algorithm correct final rewrit algorithm exhaust search space rewrit defin lemmata complex msl rewrit algorithm section exponenti time step gener exponenti size view bodi number map step gener exponenti number candid rewrit final construct vn gener queri composit algorithm arbitrari queri exponenti time relat work deriv mediat specif languag discuss msl gener languag arbitrari restructur sourc data addit restructur msl restructur close queri composit significantli reduc applic rewrit algorithm problem queri rewrit conjunct relat view discuss queri relat problem queri queri work problem rewrit semistructur queri view relev work awar problem queri struql section semistructur languag similar work deal restructur capabl struql work deal restructur capabl deal queri view regular path support regular path express relat rewrit work offer straightforward solut rewrit problem queri reduc restrict form datalog detail make conjunct queri rewrit result special form restrict lead decid complex result hold gener datalog program data model support object orient work relat problem object orient queri rewrit previou work problem object orient queri reli exist static class hierarchi work queri complex object present recent consid problem queri solv queri rewrit problem languag type semistructur recent work structur inform semistructur sourc graph schema queri process abiteboul vianu address problem regular path condit presenc path constraint isomorph oem data model node semistructur graph object ident unlik requir origin rewritten queri comput ident graph graph bisimul bisimul close isomorph isomorph approach oem object find object set subobject set valu isomorph approach base fact typic care care object subobject relationship creat url hypertext structur creat link import point view rewrit algorithm import rewrit queri produc result ident origin queri produc isomorph result reason conjectur rewrit queri result ident rewrit queri return result isomorph restrict form deal lack schema unbound nest semistructur object notic differ unbound nest depth semistructur object futur work present algorithm semistructur queri express conjunct set semistructur view find rewrit queri access view algorithm base appropri gener unif step map produc candid rewrit queri step candid rewrit queri view check composit origin queri algorithm similar rewrit conjunct queri challeng stem semistructur natur data queri composit rewrit queri view harder complex point lack schema restructur capabl view extend algorithm structur constraint discov rewrit case absenc rewrit incorpor algorithm tsimmi system capabl base rewrit adapt interfac tsimmi system serv rewrit queri cach view work extens algorithm handl extens regular path express queri bodi notic presenc regular path opportun present exist structur constraint dtd develop rewrit algorithm gener rewrit gener maxim rewrit spirit acknowledg grate jeff ullman victor vianu comment suggest earlier draft paper dan suciu yerneni fruit discuss comment refer zhuge view semistructur data sigmod workshop manag semistructur page wiener increment mainten materi view semistructur data proc vldb abiteboul vianu queri comput web proc icdt abiteboul vianu regular path queri constraint proc pod bowman al harvest inform discoveri access system extens markup languag recommend latest version suciu ad structur unstructur data proc icdt suciu queri languag optim techniqu unstructur data proc acm chan minim posit conjunct queri oodb proc pod chandra merlin optim implement conjunct queri relat ninth annual acm symposium theori page shim optim queri materi view proc chaudhuri vardi datalog program proc pod suciu queri languag xml submiss latest version duschka genesereth answer queri view proc pod duschka levi plan inform gather fifteenth intern joint confer artifici suciu catch boat experi manag system proc sigmod suciu queri languag processor manag system workshop manag semistructur acm sigmod fernandez suciu optim regular path express graph schema proc icd suciu queri conjunct queri regular express proc pod public al tsimmi approach data model languag journal intellig inform genesereth logic foundat artifici intellig morgan goldman widom enabl queri formul optim semistructur proc vldb griffin libkin increment mainten view duplic proc sigmod yang optim queri data sourc proc keller basu cach scheme architectur vldb jan subramanian languag relat system proc vldb page larson yang comput queri deriv relat proc vldb page srivastava answer queri view proc pod page ordil queri heterogen inform sourc sourc descript proc page ullman answer queri limit extern processor proc page levi rousset languag integr rule descript logic european confer artifici levi suciu decid queri complex object proc pod papakonstantin capabl base mediat tsimmi proc sigmod lotu lotu note maier logic object preprint workshop foundat deduct logic aug widom manag system semistructur data sigmod milo queri world wide web proc pdi mendelzon milo formal model web proc pod papakonstantin queri process heterogen inform sourc technic stanford object fusion mediat system proc vldb ullman mediat system base declar specif proc icd page widom object exchang heterogen inform sourc proc icd page haa queri rewrit mediat system proc pdi papakonstantin enhanc semistructur data mediat document type definit icd conf qian queri fold proc page widom queri semistructur heterogen inform proc page ullman answer queri templat bind pattern proc pod page sagiv yannakaki relat express union differ oper ng effici compil larg rule base logic access path inform subrahmanian al heterogen reason mediat system durbin syntact definit data base manag technic report mrc laboratori molecular ullman principl vol classic system comput scienc ullman principl vol technolog comput scienc vassalo papakonstantin describ queri capabl heterogen sourc proc vldb page vassalo papakonstantin express capabl descript languag queri rewrit accept journal logic program wiederhold intellig integr inform acm sigmod intern confer manag page yang larson queri transform proc vldb page widom view mainten wareh environ proc sigmod page queri composit figur map algorithm return singl path condit singl path condit input singl path condit output map method run function function appli oid label detail map oid return map appli ffi oid map label return map appli ffi oid ffi label term map return ffi oid ffi label ffi set form fr variabl map set fs return ffi oid ffi label ffi fs return ffi oid ffi label ffi fr return map describ brute forc algorithm discov map set singl path condit set singl path condit input set fc fc singl path condit output map condit method run function fc function fc function ng mg exit loop theta add map return notic map set algorithm exponenti time normal form decomposit simpler syntact condit queri base idea normal form queri attempt deriv condit normal queri head attempt show modifi version theorem conjectur set fp png ft tm queri bodi exist map exist map show conclud normal queri head simpl syntact queri consist order make point clear queri bodi notic rule queri creat object object object rule creat object object notic queri singl path condit queri creat result intuit queri head creat answer graph notic queri head bodi normal form notic map rule rule vice versa solv problem pose normal explain section rule graph compon queri input singl path condit rule head output set unifi method run function function return set unifi appli term unif result oid unifi appli ffi label return empti set unif result label unifi label appli label ffi oid ffi valu return empti set term term unif result atom object unifi term valu return ffi label ffi oid ffi variabl set return ffi label ffi oid ffi set fc variabl definit form fs return fc label ffi oid ffi return fc ffi label ffi oid ffi empti set set return label ffi oid ffi subobject condit set subobject label ffi oid return union result unifi call return empti set figur unif algorithm
ML/967 6 induct learn reason depart comput scienc ont abstract paper describ applic induct learn techniqu reason introduc main form defin reason present combin evalu call carri classif charact recognit show induct knowledg improv knowledg turn flexibl perform term classif scalabl introduct induct learn process gener specif fact observ basic strategi acquir knowledg main form induct learn system present independ repres class task induc gener descript class cluster problem object situat present learner task find class group object usefulli reason reli idea similar problem similar solut face system retriev similar case store case base adapt fit problem hand case input output feedback evalu reason cycl retriev adapt similar case adapt accur solut import task measur case relev similar close problem case case base similar measur flexibl retriev highli relev user prefer chang task retriev fewer retriev case result poor solut classif task involv associ case class base case classif system determin case belong class process consist gener set class classifi case creat class research support inform technolog research centr ontario author indebt glasgow john mylopoulo comment suggest canadian ai workshop induct class domain knowledg process associ instanc class call classif process system gener class term cluster techniqu util classif includ neural network genet algorithm induct learn reason individu approach compar base method accuraci achiev complex algorithm classif rule extract train exampl learn process rule classif unseen instanc store case learn process similar problem case case base determin proper class problem cluster algorithm divid basic tradit numer class creat minim similar object class maxim similar euclidean measur distanc conceptu cluster method structur data determin cluster attribut similar conceptu induct learn deploi reason system produc induct tree retriev speed process retriev similar case construct import featur class retriev introduc cbr describ combin cbr induct learn present evalu charact recognit task system reason system intend intellig support task desir knowledg repres form intend user novic expert rich effici process case correspond solut feedback case repres structur object relat case finit set pair relat defin individu attribut case attribut group categori group ascrib constraint group base relev problem flexibl reason present complex inform attribut irrelev problem retriev similar assess enhanc qualiti result obviou identifi categori reason partial equal exist attribut valu case match subset valu case order control partial defin context goal retriev exact match partial match context paramet similar relat map case base set similar term case context view case interpret context control consid partial match context defin finit set attribut constraint attribut valu context specifi import attribut attribut context similar uncertainti incomplet specif problem support exact similar match case satisfi attribut attribut case satisfi constraint match process constraint satisfact process result problem select method attribut accur rang similar attribut valu constraint pose system discov interpret input reason retriev highli relev case scenario creat initi context depend actual discuss context diminish problem learn algorithm perform degrad number irrelev attribut pattern discoveri involv collect case share case women pregnanc complic fourth cycl pattern identif suffici pattern set case label class shown match improv perform select approach repres case set set multipl level match import attribut requir match import attribut match problem find attribut group discov interpret case problem solv improv predict accuraci scalabl function discov context cluster algorithm function map set case case base context relev organ case base class semant similar case class organ system support control coverag termin criteria specifi percentag case relev order accept context task find minim context satisfi threshold algorithm factor analysi discrimin analysi similar algorithm system factor analysi locat relev attribut factor analysi statist techniqu identifi reason small number factor repres relationship set interrel variabl case characterist case base dynam organ class high variabl valu attribut good predictor class low variabl attribut valu suggest predict featur attribut system group similar attribut predict attribut separ attribut unsuit classif techniqu simpl scale larg case improv reason shown section organ reduc neg effect irrelev attribut perform expect improv appli discov knowledg perform group attribut improv knowledg valu algorithm decid valu consid evalu classif assign problem base similar case class membership case base set relev featur constraint assign problem return pair exist case similar case case belong class classifi class cb import note interpret denot compar similar case similar problem context form modif control qualiti quantiti retriev case classif result case similar problem belong closer match match differ individu attribut smaller evalu perform domain report letter classif test machin learn algorithm data set consist attribut base simpl basic system achiev compar classif accuraci system attribut group categori select cardin select match test relax strategi approach yield accuraci confid interv test effect case base size classif accuraci achiev individu situat method accuraci accuraci genet algorithm modifi approach attribut group categori select cardin simpl learn algorithm achiev similar classif accuraci obtain relax relax attribut valu includ valu case cardin relax perform obtain combin previou approach equal vote obtain categori group attribut previou categori letter recognit data classif accuraci obtain machin learn algorithm creat group attribut attribut extra induct find relev attribut recogn individu letter group attribut process conceptu algorithm gener cluster case base import featur induc featur case improv provid futur case import featur report similar assess induct learn flexibl comput give limit comput resourc result control time accur result return quantiti qualiti retriev item control analog system support retriev system retriev relev irrelev retriev system retriev relev relev item paper present approach combin induct learn reason appli induct knowledg improv task time perform cbr relev attribut problem accur result provid reason process effici evalu compar standard cbr approach induct learn classif charact recognit result show induct improv case turn system perform result complement previou experi report scalabl increment context modif evalu plan appli complex task structur domain refer featur select classif cloud empir comparison workshop gener case case studi proc intern confer machin page perform perspect ieee transact knowledg data engin special issu learn discoveri letter recognit adapt classifi machin restrict queri relax user constraint proc intern confer intellig cooper inform page induct bia reason system technic report yc modern factor analysi chicago nonstandard concept similar reason proc annual confer gesellschaft fur springer appli reason control robot robot system st classif relev assess submit perform analysi increment algorithm cbr system submit rf reason predict knowledg mine ai medicin special issu cbr medicin submit comput model reason st confer american societi reproduct medicin retriev relev proc aaai fall symposium seri pp extend version technic depart comput scienc retriev tool softwar repositori workshop ai softwar break constraint satisfact problem domain intern journal artifici intellig tool vol pp reason morgan san discrimin analysi hafner repres knowledg inform system acm transact inform editor machin learn artifici intellig volum morgan kaufmann lo inform dna promot sequenc domain theori journal artifici intellig research research note rc knowledg acquisit heurist classif domain technic report ai austin learn classifi incomplet exampl comput learn theori natur learn address real world task mit rs conceptu invent classif structur object pp symbol neural learn algorithm comparison machin analog retriev constraint satisfact artifici intellig empir evalu hybrid genet tree induct algorithm journal artifici intellig research
ML/968 6 klau jantk logic case memori foundat learn issu fur leipzig ev prof dr uw htwk fb leipzig klau jantk fit leipzig htwk leipzig germani comput ein immer mae und die die der paramet die ein und von da immer der einer de da immer im ein da da de den hat de und und gut die immer zu form von zu fallen mit mit mit der zu di zu problem auf im der informatik es fur da www ein er ein ander ein zur illustr ein ein oder ein klein programm zur auf dem comput da er ein programm da er von fur er ist fur es und der man da da fit leipzig de und ein der problem de da auf der informatik ist die dem einer und den um der auf zu der zu um im zu es der de case memori der der form und um de uniform zu programm der die de al formal oder und da der ansatz um zu und zu die ein man welch ansatz zur und zur auf report und welch ansatz theori und praxi wolfgang wittig abstract focu paper introduct gener type reason system call logic case memori system develop underli concept driven investig problem learn present develop target concept accompani discuss relat learn problem logic case memori system provid formal framework investig applic structur similar concept concept crucial advantag tradit numer similar result determin case similar experienc case directli basi perform case adapt logic case memori system consist partial order case base partial order set predic case logic problem predic determin view case base partial order predic similar concept formal learn similar concept turn learn partial order insight deriv basic result power limit learn firm basi wide spectrum investig research report partial support german research fund research project contract ja content motiv reason structur concept logic case memori system architectur logic case memori system semant logic case memori system gener logic case memori system basic version properti set term properti set predic integr properti learn case memori system logic case memori system applic scenario basic problem learn logic case memori system summari futur work acknowledg refer motiv reason modern area theoret appli artifici intellig fuel hope allevi bottleneck knowledg acquisit consid research paradigm wide area comput cbr suffer phenomenon level comput applic deal highli structur inher structur level knowledg acquisit fit bit byte world comput machineri extrem difficult develop implement autom reason procedur flat knowledg exploit structur inform origin object effici figur fresh air suppli return air net design fabel system author present work root experi larg applic orient project gener part industri build design object area highli structur understood repres object fresh air suppli network water suppli depict applic structur formal concept repres real object list pair bear evid relat structur similar concept set stage investig forthcom relat work aim axiomat formal fundament structur similar concept distinguish advantag structur similar concept tradit numer structur concept provid opportun exploit result determin problem similar experienc case directli case adapt nice exemplifi treatment similar similar spirit answer case memori system gener queri case present consist partial order case underli mechan sophist modifi system case system answer gener complet satisfi involv forthcom paper deal learn problem type set turn approach develop specif instanc gener approach develop present paper neg result illumin difficulti learn set enorm relev gener learn task formal develop sequel intent present work provid contribut ffl framework formal repres knowledg reason support structur similar concept support gener ffl framework learn partial order set case learn structur similar concept determin partial order learn approach spirit present preliminari work lead present reader direct reason structur concept concept present formal extract author work past year partial reflect refer mention strongli inspir approach excit problem learn partial order sit insid case memori system discuss bridg decemb knowledg repres form case similar measur gener form case collect knowledg process solv case repres experi retriev similar case chosen basi gener solut includ techniqu case adapt wide accept common understand reason base methodolog cycl consist main activ retain author refrain introduct direct reader topic literatur mention suffici present investig identifi case base similar concept basic constitut reason system kei concept introduc subsequ logic case memori system logic case memori system architectur logic case memori system consist case base similar concept peculiar constitu understood partial order set formal defin briefli discuss basic constitu separ chapter deal oper interplai determin semant collect case form set cb call case base case defin partial order note case partial order relationship assum concept express compon forthcom paper reader find axiomat suitabl type partial order case base relat case mean structur inform order understood carri properli inform situat case subsumpt subsum idea specif version partial order case natur suggest case abstract meet idea develop author public rule comparison ground unnecessarili addit constraint introduc chapter figur partial order case base figur intend illustr partial order case sit case base space left incorpor constitu consid constitu understood partial order set binari predic accept case argument abstract construct closer reveal idea standard prolog predic occur head total order reader adopt moment partial order predic repres view case base prefer conceptu interest approach formal process view tradit base cbr interest reader consult present formal order predic approach idea similar techniqu figur intend illustr partial order predic dualli figur space reserv descend line figur lead predic higher rank wrt underli partial order lower rank figur partial order collect predic combin figur illustr logic case memori system figur logic case memori system illustr specif relationship compon displai focu syntact aspect semant aspect consid chapter predic reason case formal case admiss argument case term chapter sum assumpt logic languag logic case memori system pair consist partial order set term partial order set predic simplest tradit case base left hand side figur set index mechan partial order set simplest approach binari measur oe cb calcul similar case similar measur oe frequent encod distanc measur cb present conceptu idea knowledg proof eat proce oper interpret introduc set logic case memori system semant reason system trigger present case mention gener perspect loop involv retain view applic scenario interrog focu specif respond stimulu present case approach outlin impli system partial order set case figur logic case memori system view perspect input term figur illustr situat term put predic find confin order predic calculu argument term case base complement input true figur figur understood predic displai argument list true term shade insert argument conflict complic specif system meet user expect figur show case higher rank predic prefer lower rank case contrast lower rank predic focuss higher rank case predic distinguish case lead semant sequel figur logic case memori system view perspect contrast figur figur displai situat compet predic share perspect input case similar case output necessarili assumpt neighbor semant case return approach system output partial order case displai shade area excess illustr readi introduc basic semant assum denot semant decor index auxiliari concept shorten notat term iew cb iew max iew knowledg sampl shown figur determin iew fp qg figur iew fp rg figur standard semant function relat form due conflict incompar predic maxim rank wrt desir distinguish std max cb gener approach upper index std std reader easili recogn formal admit side effect undesir std sampl system exclud system output narrow definit slightli std max std defin partial order semant return partial order set case formal understood defin po cb domain output relat conveni write po drop altern problem illustr figur suggest extens present basic approach present illustr idea sampl point conflict rule concept domin view view predic domin view case domain domin element wrt domain exclud predic definit domin formal sound intersect aim express common sketch approach gener partial order semant inherit underli partial order predic reason integr underli partial order suggest gener intent assum gener relat defin cb cb implicitli suggest cb fxg cb fxg note due reflex definit gener approach sampl set learn logic case memori system gener approach present paper gener point natur extens improv effici reason process enorm case base structur cluster minim approach cluster implicit sampl compon underli partial order form cluster approach exemplifi focu predic narrow remark introduc underli logic applic directli enlarg relax syntact requir talk account arbitrari partial order object set care defin predic oper predic extend express power remark mechan flexibl definit partial order semant concept support power descript logic case memori provid formal potenti infinit space predic author convinc investig lead extens account logic case memori system basic version approach present unconstrain gener framework formal minim collect semant concept specif reason approach view perspect logic case memori properti determin peculiar respect behaviour properti interest class approach system common worth make properti explicit studi properti implic result worth call theori logic case memori system present chapter intend initi step develop fundament class properti respect properti partial order case properti partial order set interrel properti refrain attempt complet treatment confin illumin exampl properti set term introduc studi axiomat structur similar concept base partial order term investig specif properti provabl relev ffl structur term supremum infimum defin ffl term infimum defin depend type case account chapter difficult partial order advantag properti valid properti set predic properti predic underli order essenti paramet similar concept emploi investig area exampl ffl predic true term ffl predic hold condit type intend formal usag predic view case base integr properti huge amount potenti approach integr constitu requir ffl instanc properti make mean subsum semant properti motiv search techniqu learn case memori system author mention advantag store episod knowledg maintain gener knowledg abstract form worth point advantag substanti reason system natur earli dai systemat softwar dream develop methodolog tool specif design system meet requir suffici formal extend dream correct proof systemat design implement system realiti dynam requir user expect chang design implement process system chang system reason paradigm tailor deal dynam environ adapt store episod case make essenc current chang explicit abstract form turn advantag closer chang system environ reason chang learn step desir learn behaviour system specif distinguish logic case memori system applic scenario logic case memori system fed case describ problem depend chosen semant chapter return individu list partial order set depend system knowledg process environ formal step knowledg process simpl current problem classif system output understood classif behaviour complex output provid basi case adapt solv problem investig system output satisfi case complet system unchang exist refin scenario situat system updat account present simplifi scenario complet system meet user expect case return simpli wrong complex applic return case useless case correct system behaviour reason put present case system fail case base essenti note pattern learn behaviour analyz pattern number ffl case insert partial order case place partial ffl insert case impli necess chang partial ffl requir insert system fed case respond satisfi ffl insert case impli inform predic potenti argument ffl happen chang partial order predic ffl circumst system failur case necess delet predic partial ffl recogn necess incorpor predic partial order predic case necess gener predic suitabl question involv exist version hierarchi approach solv question set refrain discuss gener level abstract question local deal react individu behaviour system life cycl account select question intend illustr global ffl chang perform achiev local effect local motiv ffl assum predic delet back turn chang ffl case exist theoret ideal partial order predic ideal support intend system behaviour hope approach detail question gener question characterist featur learn procedur phenomenon reach abandon target case opportun work depend recent bookkeep histori system life cycl note left dimens question comput complex learn task respect time space obviou realist applic subject sever restrict comput resourc imposs answer global question suffici satisfi manner difficult methodolog approach combinatori overwhelm amount local global phenomena relat closer reveal algorithm learn year provid methodolog systemat investig tradeoff local global learn behaviour gener exemplifi approach chapter left forthcom paper basic knowledg induct learn interest reader consult basic problem learn logic case memori system learn consist collect case tune similar concept systemat develop present chapter intend exemplifi learn logic case memori system clarifi ffl type ffl ffl analyz input inform potenti ffl type hypothet current ffl adopt criterion success learn reason choic question motiv present approach problem learn partial order sit case memori system investig partial order partial order case case author focu partial order determin similar concept concentr excit problem driven specif paramet present learn approach investig assum meet underli case base flat set predic finit learn worri insert case present case base learn focu learn similar concept tune partial order predic assum user target behaviour mind abstractli understood target partial order note number partial order collect predic gener system fed queri case assum system respond partial order case fix semant altern approach approach introduc chapter due flat case base system return partial order case sit case base requir ultim target behaviour complet condit exist minim case base cb system base partial order correct learn target system determin input case satisfi output order note ident relat empti meet reflex requir partial order applic area learn system act assum exist target behaviour meet cope environ requir properti system ffi ffi ffi meet cb cb ffi ffi correct wrt user note interestingli bridg gap research work induct learn theori system trigger queri case put partial order case relat symmetr differ target relat correct system behaviour learn inher difficulti explicit inform access user current input system enabl learn inform system incorrect fact contradict desir pair case order expect express ffi sum learn current system behav inform ffi learn step base applic individu learn step transform cb cb describ learn local target system initi system finit learn step transform stage learn kei exist method learn arbitrari satisfi requir finit case method requir suffici inform unit form learn method work secondari question condit weaken drop amount inform reach goal complex learn specif question motiv present question gener interest answer question knowledg transfer point result learn theori readi exploit set exhibit gener present result class present investig relat standard identif type induct exploit knowledg limit iter relev result good exampl induct infer present relat standard techniqu algorithm larg reservoir machin version space present present investig provid perspect classic machin learn techniqu suggest gener present approach larger class class structur case base class potenti infinit deal gener immedi redirect attent learn problem investig learn problem formul turn algorithm solvabl technic reason assumpt set predic simpl suitabl basi learn procedur call empti case base cb full relat predic note supremum version space potenti partial order predic theorem exist algorithm learn exhaust sequenc input case number occurr case unbound theorem present formul requir resourc difficult estim complex present learn problem tightli introduc formal present strong variant prefer learn algorithm start situat distinguish ffl fed current system output learn ffl present indic case base updat ad partial order predic remain unchang ffl present indic partial order predic updat delet relationship predic meet case base remain unchang plain learn step appli finit cut relat gener mean descend finit version space partial order suffici exampl construct eventu reach termin construct perform step extend case base inform provid suffici past collect element cb case condit case correct behaviour target system case base cb collect iter step step appli learn process termin corollari target learn start initi hypothet partial order predic present minim set summari introduc gener formal intend cover wide rang system deal reason express point view tradit attribut pair orient approach support applic advanc learn problem exemplifi problem learn area system expect return partial order attack present framework formal algorithm solut learn problem overwhelm amount problem remain open futur work area futur work present develop theori relat area sake mutual formal solv learn problem exemplifi direct briefli illustr express urgent learn paramet tune substitut reduct concept normal form relev side learn repres formal elementari formal class prolog theoret excit problem relat type learnabl identif type induct infer acknowledg idea develop present approach root author point larg joint research project fabel partner institut st augustin focu project develop methodolog integr gener reason applic industri build design version fabel system successfulli experi fabel project prove import structur approach similar author work algorithm learn theori survei relat joint project attempt made mimic typic ai approach reflect step learn final lead present investig research project comparison induct learn concept provid firm background present result author group leipzig technolog michael richter group kaiserslautern result project enorm impact develop present idea recent paper excit discuss bridg decemb final gave motiv write present formal scientif discuss learn steffen lang worth acknowledg substanti contribut develop numer idea refer dana angluin comput learn survei select bibliographi acm symposium theori page acm aamodt plaza foundat methodolog system approach ai dana angluin carl smith survei induct theori method comput dana angluin carl smith induct infer stuart encyclopedia artifici intellig edit page john wilei blum manuel blum mathemat theori induct infer inform kati klau siegfri im gesellschaft fur mathematik und datenverarbeitung kunstlich novemb kati structur similar adapt smith advanc european workshop reason novemb volum lectur note artifici page ralph bergmann wolfgang wilk role abstract reason smith advanc european workshop reason novemb volum lectur note artifici page volker dotsch klau jantk good exampl learn list werner michael jen andrea machin annual meet special interest group machin learn german comput scienc societi chemnitz page tu volker dotsch klau jantk solv stabil problem knowledg acquisit paul hiroshi tim pacif knowledg acquisit page south depart artifici wolfgang wolfgang bernd kati marku approach similar fabel report gesellschaft fur mathematik und datenverarbeitung kunstlich juli survei fabel fabel gesellschaft fur mathematik und datenverarbeitung kunstlich februari rolf wiehagen induct infer good exampl klau analog induct infer proc intern octob volum lectur note artifici page rolf wiehagen power induct infer good exampl theoret comput rolf wiehagen learn good exampl klau jantk steffen algorithm learn volum lectur note artifici page christoph klau steffen yasubumi sakakibara learnabl languag gener christoph globig steffen lang learnabl formal languag arikawa klau algorithm learn proc intern workshop analog induct infer intern workshop algorithm learn theori octob volum page klau jantk case base learn induct infer report technisch fb mathematik februari klau jantk case base learn induct infer proc annual acm workshop comput learn juli page acm klau jantk formal reason proc von fallen june page universit fb seki work paper klau jantk nonstandard concept similar reason wolfgang michael inform system data prospect foundat annual confer univ studi data knowledg page klau jantk volker dotsch necess user guidanc knowledg acquisit proc florida ai research klau jantk steffen lang base learn pattern languag klau takashi proc intern workshop algorithm learn novemb volum lectur note artifici page klau jantk steffen lang base learn pattern languag michael stephan frank european workshop base reason novemb page klau jantk steffen lang learn pattern languag klau jantk steffen lang lernen fur system van der ralph intelligenz und de page deutsch fur und klau rolf steffen lang lernen fur system de kunstlich page deutsch fur und janet kolodn introduct reason artifici intellig janet kolodn reason morgan reinhard rolf wiehagen research theori induct infer mathematician survei inform steffen jochen rolf wiehagen languag learn good exampl arikawa klau algorithm learn proc intern workshop analog induct infer intern workshop algorithm learn theori octob volum page daniel klau jantk axiomat structur similar reason proc florida ai research hugh osborn bridg case bae similar framework smith advanc european workshop reason novemb volum lectur note artifici page christoph riesbeck roger schank insid reason lawrenc erlbaum jorg walter fish shrink step effici case retriev larg scale case base smith advanc european workshop reason novemb volum lectur note artifici page yasubumi klau steffen lang learn languag collect case tune paramet arikawa kp algorithm learn proc intern workshop analog induct infer intern workshop algorithm learn theori octob volum lectur note artifici page research paradigm aaai daniel klau kathleen learn case classif improv learn werner michael jen andrea machin annual meet special interest group machin learn german comput scienc societi chemnitz page tu
HCI/969 4 anim pedagog agent deictic believ jame lester jennif stuart town charl multimedia laboratori depart comput scienc north carolina state nc abstract anim interfac agent learn environ provid custom advic support student problem solv strong visual hold substanti student learn experi kei problem pose agent inhabit artifici world deictic believ manner human refer object environ judici combin anim agent move point refer object appropri provid problemsolv advic paper describ framework achiev deictic believ anim agent deictic behavior planner exploit world model evolv explan plan select coordin speech behavior result behavior utter refer unambigu approach spatial deixi implement anim inhabit learn environ domain internet packet rout product larg multidisciplinari team comput graphic cosmo realtim advic student packet virtual world interconnect router introduct anim agent offer great learn environ deep affin children develop potenti pedagog benefit agent provid support work provid initi north carolina state equip donat appl ibm motiv benefit creat anim agent significantli time children seek spend educ recent advanc afford graphic hardwar begin make widespread distribut realtim anim technolog realiti endow anim agent qualiti subject grow bodi research rist bate al blumberg ling mae al whittak interest work examin social aspect interact user anthropomorph softwar al reev nass anim pedagog agent johnson stone lester constitut import categori anim agent intend educ applic believ kei featur anim pedagog demonstr recent studi conduct anim pedagog agent develop laboratori interact agent determin student perceiv agent entertain al kei problem pose agent inhabit artifici world deictic believ manner human refer object environ combin anim agent move point refer appropri provid advic deictic believ anim agent requir design agent behavior planner consid physic properti world inhabit agent agent exploit knowledg posit object rel locat respect prior explan creat deictic utter natur unambigu address develop spatial deixi framework achiev deictic believ build previou work dynam figur cosmo internet advisor world ing anim pedagog agent lester enhanc pedagog agent believ stone cassel al foundat work agent deixi al deictic behavior planner exploit world model evolv explan plan select coordin speech behavior result behavior rel proxim refer unambigu approach implement anim inhabit learn environ domain internet packet rout cosmo creatur hover virtual world router network advic student decid ship packet network destin behavior space action utter combin creation larg multidisciplinari team comput graphic anim student activ cosmo explan refer specif subnet address label environ carefulli select coordin behavior planner creat deictic refer natur unambigu deictic believ anim pedagog agent commun human constantli emploi deictic techniqu creat refer spatial studi phenomenon refer specif locat object physic world klein speaker techniqu narrow listen attent entiti popular framework analyz spatial model world categor common physic environ share speaker aspect ground speaker refer carefulli construct refer express speaker assist hearer refer interest abil handl spatial deixi effect critic anim pedagog agent inhabit virtual world provid advic student interact object agent refer object world explain function assist student perform task deictic mechan anim pedagog agent satisfi ffl lack learn anim agent clariti express import effect commun advic explan agent creat deictic refer unambigu avoid ambigu critic problem solv virtual ambigu deictic refer mistak foster misconcept ambigu challeng virtual environ multitud object similar ffl demonstr agent believ hold appeal children al simpl creat unambigu refer object scene object goal creat agent make refer manner human human environ gestur move walk scene cluster object point achiev agent behav requir impli deictic plan mechan make express world unambigu deictic refer made object highlight emploi stationari agent long rist requir suggest agent combin locomot anim agent testb investig anim agent learn develop agent testb learn environ inhabit environ agent design foster evalu mechan anim behavior sequenc realtim assist featur forc spatial deixi issu forefront world popul multitud agent advic explan refer task requir student make base factor present environ internet advisor laboratori consist virtual world popul router network inhabit creatur hint british accent internet advisor serv excel testb spatial deixi subnet varieti router attach addit internet advisor creat graphic artist voic programm agent refer unambigu student problem solv student interact cosmo learn network rout mechan navig seri subnet packet direct network connect router send packet router view adjac subnet make factor address resolut traffic learn fundament network topolog rout mechan bit cosmo explain comput rout type network physic address scheme network traffic plai student journei complet successfulli navig network deliv packet proper destin plan deictic speech student solv problem learn anim agent advic assist observ student attempt agent explain concept hint advic student request student extend period signal student commit error action interpret detect situat agent provid invok agent behavior planner agent behavior planner consist explan planner deictic planner explan planner determin content structur explan examin curriculum inform user current problem student solut construct sequenc explanatori behavior utter collect constitut advic deliv action perform student custom explan deliv agent deictic plan plai behavior planner determin explan refer object environ utter make refer explan planner invok deictic system suppli intend refer deictic system oper phase plan agent ambigu deictic system assess situat determin refer ambigu examin evolv explan record agent utter spoken current explan deictic planner evalu rs initi potenti ambigu assess contribut speech plan gestur locomot determin agent physic deictic system world repres rel posit agent object made ambigu plan agent point gestur movement proxim object deictic system comput agent point move move utter determin agent refer deictic system consid focu ambigu world model utter plan pai attent rel locat refer account plan locomot previou phase result utter plan refer express consist demonstr pronoun deictic system pass agent behavior utter back agent behavior planner integr final behavior specif typic includ varieti action utter behavior planner pass specif present extract relev behavior behavior space lester cue orchestr agent action speech environ ambigu utter evolv explan plan make refer object explan planner invok deictic system deictic depend critic accur assess context refer commun correctli plan agent deictic system determin situat potenti ambigu current explan focu promin refer current junctur deictic system focu primari predictor potenti ambigu situat combat combin gestur locomot refer potenti ambigu focu focu multipl object focu determin refer deictic system examin evolv initi phase ambigu assess consid spatial handl phase speech user learn environ agent present manag manag action interpret interact explan planner behavior space ambigu locomot world model curriculum inform network user model problem state physic behavior verbal behavior agent behavior planner deictic planner figur anim pedagog agent behavior plan architectur explan plan inspect previou deictic refer explan planner plan utter examin utter deictic refer ffl locat refer potenti deserv greater deictic emphasi student interact internet advisor send packet router lie optim path packet cosmo interrupt student make initi refer router provid proper introduct refer ffl uniqu locat refer introduc potenti ambigu cosmo explan consist multipl utter refer router uniqu focu special deictic treatment ffl multipl locat refer entiti situat potenti ambigu cosmo point router subsequ point student refer router multipl refer focu precaut make ambigu refer result determin record phase gestur locomot plan potenti ambigu endow agent abil point move object agent refer enabl improv clariti refer deictic system plan type physic gestur locomot determin behavior type warrant comput behavior determin agent exhibit point gestur physic design refer behavior planner inspect ambigu comput previou phase refer deem system plan point gestur agent enabl agent point object deictic system consult world model obtain locat agent refer environ determin rel orient vector la lr ascertain direct agent point cosmo hover upper corner environ point router lower corner point left router addit agent move locat clarifi deictic refer ambigu refer determin uniqu agent remain stationari refer potenti refer refer agent perform locomot behavior agent motion behavior bob blink action discuss section activ deictic system consid agent move object refer system determin condit ffl agent move object cosmo point router move router ffl multipl proxim object object agent move object nearbi router cosmo move router refer ensur refer clear ffl multipl proxim object ontolog categori object object agent move object cosmo refer router router move intend router ffl object unusu agent move object determin object system comput size bound box check threshold interfac control button small compar object environ cosmo make clear refer move deictic system determin locomot call plan determin agent obviat move object comput measur distanc ascertain proxim bound distanc agent intend object proxim agent move point remain current posit locomot system comput direct motion path agent current locat object point perform en comput rate locomot durat point action complet agent reach object deictic refer express plan effect commun intend deictic system combin speech complet gestur locomot deictic planner turn speech determin refer express agent speak perform deictic gestur deictic system examin result ambigu determin uniqu potenti ambigu introduc entiti compet student attent introduc simpl refer express techniqu similar outlin refer multipl deictic planner make determin demonstr categori call current examin ontolog type activ consid number categor situat deictic ffl proxim deictic planner determin agent move move emploi proxim demonstr ffl deictic planner determin nearbi agent move emploi demonstr determin demonstr categori deictic planner narrow select ontolog type previou utter evolv explan plan belong ontolog type entiti deictic planner select system determin proxim demonstr utter refer router refer router current router number make final lexic choic proxim demonstr final refer select gestur locomot pass behavior integr speech behavior pass interact manag present engin order agent exhibit agent combin behavior sequenc seamlessli provid convinc deliv advic integr speech implement anim pedagog agent cosmo realtim implement anim agent inhabit internet advisor learn environ head movabl antenna express blink arm hand larg number independ bodi torso speech suppli train voic actor router subnet virtual internet model render sgi result bitmap subsequ macintosh transfer pc user interact environ cosmo perform varieti behavior includ bend antenna verbal behavior includ utter rang durat behavior sequenc cosmo cosmo behavior planner oper behavior sequenc framework anim pedagog agent lester appli framework creat agent entail construct behavior coher structur develop behavior sequenc engin dynam select assembl behavior request explain concept provid behavior planner select explanatori content examin curriculum inform network partial order structur topic user model individu skill demonstr explanatori content determin larg part current problem includ logic state problem student solut problem internet advisor defin factor current packet destin ip number current network congest explan planner consult knowledg sourc note select sequenc commun act act includ react initi announc agent provid demonstr inform current show field address factor consid current advic current traffic foundat inform entiti cosmo internet advisor environ implement emploi microsoft game softwar develop kit cosmo behavior run color pentium mhz pc mb ram framework origin develop agent inhabit learn environ al stone explan router facilit student acquisit explan planner frequent suppli relev causal knowledg student request justif suggest cosmo remain onscreen time session accompani student journei internet remain aliv perform bob lean router student request commit error make incorrect rout fail action extend period action interpret invok explan turn invok deictic planner explan planner deictic planner seri utter action cosmo perform pass interact extract utter behavior space enabl cosmo exhibit individu frame select behavior posit displai environ motion path specif construct behavior planner mouth movement handl lip synch modul overlai mouth cosmo face peak select utter waveform net effect realtim behavior plan dynam creation onscreen persona convinc presenc present realtim illustr agent behavior planner produc deictic verbal advic assist situat internet advisor learn session student rout packet ethernet subnet medium traffic survei connect subnet select router believ advanc step closer packet intend destin chosen router technic suboptim excess slow packet progress behavior planner select behavior commun action interpret determin agent advic invok behavior planner cosmo begin speak hold hand gestur explan planner examin router select student evalu qualiti scale correct explan planner invok deictic determin comput focu cosmo move select point observ comput good explan planner insert comment prepar student upcom explan advic cosmo explan planner determin cosmo commun student network congest consid plan behavior cosmo point congest inform screen import previou explan planner construct advisori behavior cosmo point onscreen congest data traffic student explan planner determin commun congest problem current context student select invok deictic planner refer inspect previou utter determin subnet focu cosmo move point subnet medium explan planner creat demonstr strategi contrast student select subnet traffic subnet cosmo low provid final cosmo cross arm dont student correctli select ethernet subnet low traffic explan planner evalu cosmo hand shout strong anim pedagog agent captur student imagin plai critic motiv role deepli engag learn environ activ believ kei featur pedagog deictic believ import characterist anim agent inhabit artifici world dynam sequenc anim pedagog agent manner promot deictic design spatial deixi framework plan speech framework implement anim agent testb learn environ agent behavior planner evalu potenti ambigu exploit world model repres posit orient virtual world plan agent deictic action utter examin evolv plan ascertain focu statu refer inspect world model determin refer proxim similar object agent determin move point refer type demonstr utter agent behavior planner integr speech commun act specif produc seamless sequenc utter action unambigu believ net result behavior plan charact clear advic realtim strong visual presenc work repres step goal creat charact learn environ greatest challeng ahead lie creat learn environ extend believ accommod rich context learn environ internet advisor plan field learn environ cosmo internet world inhabit underwai acknowledg tim mike jim mari alex osborn north carolina state initi work environ design internet advisor special patrick north carolina state school design lead effort refer cope tempor constraint multimedia present plan thirteenth nation confer artifici role emot believ agent commun acm direct autonom creatur virtual environ comput graphic model interact speech gestur technic pennsylvania gener refer express mit press behavior control simul human agent symposium interact ed studi relat topic john wilei son control interfac anim chi believ anim pedagog agent intern confer autonom agent problem solv learn environ intern confer intellig tutor persona affect impact anim pedagog agent human factor comput pedagog design exploit task model constructivist learn intern confer intellig user aliv interact autonom agent comput anim confer agenc comput social actor intern chi confer comput person human person intern journal studi inform characterist media technolog give annual meet intern commun associ integr pedagog capabl virtual environ agent intern confer autonom agent refer explanatori model opac state york press dynam sequenc anim pedagog agent thirteenth nation confer artifici linguist social affect base agent person intern confer autonom agent
HCI/970 4 construct realist head anim mesh specif person ulrich dougla kim integr media system comput scienc usc abstract paper address problem construct realist complet anim mesh portrai specif person head geometri textur approach deform prototyp mesh delin muscl fit geometr model obtain stereo imag pair specif person head result person mesh facilit anim realism predict origin prototyp mesh model construct requir manual automat refin method reduc process passiv physic marker person face model produc method suit realist anim specif individu applic special teleconferenc introduct pioneer work freder park research attempt gener realist facial model anim recent interest facial model anim spur virtual charact film desktop process potenti commun metaphor interact complex human facial anatomi natur sensit facial difficulti model human facial subtl express recent work produc realist result fast process gener specif person head model suitabl facial anim entail extens human physic marker tediou tune creat realist model specif peopl multipl stereo imag pair approach requir interact user automat refin user input approxim target applic teleconferenc emerg technolog interperson commun distribut virtual environ applic requir anim model specif peopl figur illustr method volum morph fit prototyp mesh reconstruct model specif person model reconstruct stereo imag pair obtain complet model acquir frontal side view person produc separ reconstruct visibl head region system facilit merg multipl model fit prototyp mesh prototyp mesh polygon speed compar triangl fig approach morph prototyp mesh fit reconstruct model produc complet person anim mesh fit process implicitli simplif compress process prototyp mesh anim case inform fit anim person complet head anim model realism predict novelti approach integr stereo reconstruct textur volum morph textur blend advantag approach usual number correspond build specif face model hundr point mesh remaind paper organ section introduc prototyp mesh anim method experi initi experi scanner head model review section approach stereo imag detail section section describ volum morph refin method construct final model anim system target applic anim system mark model approach depend anim method polygon implement built prototyp mesh incorpor anim engin base work water terzopoulo implement mimic facial gestur jaw head pose system simpl backup control system maintain reason paramet case network sensor failur anim independ mesh resolut addit water select viewpoint mesh complet head enabl system run real time maintain visual realism geometr mesh prototyp anim mesh addit inform vertex water delin muscl model defin vector field insert point field extent defin cosin function fall factor produc cone shape visual height field water model mouth muscl simplifi parametr ellipsoid muscl contract center ellipsoid primarili deform mouth region model scanner scanner acquir model person head scanner produc artifact digit head gener digit hair artifici color destroi textur scanner cover full head user motion artifact experi requir geometri remov smooth add detail top head figur show scanner oper output person shown illustr loss fig head model water book polygon model viewpoint polygon addit muscl data make prototyp anim mesh fig water muscl orient mesh fig scanner textur scan scan scan textur hair digit outlier artifact figur show model hair paint white scan ensur digit approxim polygon output scan scanner data target fit prototyp mesh fit process greater detail stereo reconstruct model model stereo reconstruct stereo reconstruct activ area research comput vision stereo algorithm correl approach base class algorithm accur inform turn defin object descript calibr stereo camera pair method base develop sara calibr comput matrix relat point space project imag plane comput project coordin point world coordin frame high accuraci project point imag calibr fixtur object requir manufactur possibl planar pattern introduc dimens displac pattern calibr mechan linear motion platform platform provid control displac stereo camera color ccd soni camera mm calibr system meter full resolut calibr oper digit imag size camera fix configur baselin approxim approxim ensur accur geometri entir face momentarili project textur scene slide projector acquir stereo imag pair color imag textur final model acquir immedi disabl textur sequenc stereo textur imag acquir consecut video frame recov rang data project spatial point found left imag correspond problem reduc dimens region rectifi imag point lie scan line point coordin left rectifi distanc dispar modifi normal measur correspond review common correl correl score measur similar select window left imag usual window fig planar pattern stereo camera calibr textur imag textur imag dispar map match filter color imag textur mesh cull refin smooth reconstruct dispar map calibr data fig stereo reconstruct algorithm flow chart rectifi imag select correl covari varianc defin squar window assum gaussian distribut pixel left match produc correl profil rang accept integ dispar rang max fix depend camera configur scene distanc peak correl profil dispar result list posit form dispar volum dispar volum prune select procedur base visibl order dispar gradient constraint output procedur integ dispar map reconstruct proport dispar error correct integ dispar map obtain simpl interpol correl gener approach account perspect distort left correl window planar region surfac approach fastest reliabl dispar estim dispar map interpol filter fill hole cull outlier dispar point comput calibr triangul tessel defin facet mesh gener method smooth hole depend imag size mesh size approxim facet perspect project matrix acquir color textur textur map defin matric mesh fit volum morph scan reconstruct model variabl complex mesh arrang captur geometri color suitabl direct anim prototyp muscl paramet suit geometri textur match specif individu fit prototyp mesh reconstruct anim mesh shape color specif individu step fit process step volum morph transform deform prototyp mesh guid interpol set landmark point radial basi function landmark volum morph morph prototyp mesh accur landmark optim ensur qualiti morph step surfac optim minim cost function improv similar reconstruct model prototyp mesh base euclidean distanc vertic step textur extract gener spheric person textur map morph prototyp origin color imag multipl reconstruct model fourth step blend merg spheric textur map aggreg final textur map landmark volum morph set landmark point prototyp landmark set size reconstruct landmark base volum morph defin map satisfi fig exampl reconstruct model peopl appli map prototyp transform landmark point posit point qualiti interpol depend landmark point set map function radial basi gener global smooth interpol radial basi function defin function depend distanc point radial basi function interpol method simpli linear combin basi disadvantag equat doesnt affin affin transform recov gener solut add linear term equat absorb linear part morph interpol form mp rotat vector translat select hardi function paramet control stiff deform landmark point coeffici determin interpol constraint linear constraint surfac optim landmark point typic optim ensur qualiti morph defin cost function di spring di sum minimum distanc point reconstruct model surfac prototyp spring term measur energi prototyp place edg mesh spring rest length fix spring constant posit vertic prototyp iter adjust minim spring term exist minimum regular optim desir local minimum textur extract step creat map prototyp mesh reconstruct model textur prototyp defin textur coordin vertex spheric map transform mesh face posit center move origin vertex mesh project point unit sphere azimuth textur coordin vertex defin result coordin map suitabl aspect resolut imag stereo algorithm reconstruct map function relat point color textur imag volum morph surfac function defin map vertex prototyp mesh fig textur map prototyp mesh base spheric project rectangl center show region frontal textur appli reconstruct model textur imag reconstruct model prototyp mesh prototyp mesh textur fig morph textur map prototyp textur closest neighbor reconstruct combin project shown fig creat requir map textur imag textur imag blend final stage combin multipl textur map textur map merg textur imag textur insid rectangl fig frontal import region textur rectangl extract weight weight coeffici cosin angl normal point gener model view direct stereo imag figur illustr data flow entir fit process figur show result fit member research group gener anim model map spheric project textur map person mesh fit map stereo fit mr ms ms ms ms map fit blend mr mr figur fit process data flow illustr merg multipl stereo mesh textur summari present method creat head model anim method modifi prototyp anim mesh specif person minim interact integr acquisit multipl stereo reconstruct model creat complet head mesh fit process context anim system illustr util manual interact consist click correspond prototyp mesh stereo model correspond distribut mouth suffici fit prototyp mesh stereo model set imagin correspond automat initi futur inform provid vision face system refin step addit volum morph futur goal augment energi function addit constraint improv robust autom fit initi volum morph stage locat outlin import human facial featur ey mouth full knowledg prototyp addit correspond inform enabl fulli automat model fit accur model feasibl acknowledg research fund part advanc network servic center commun integr media system center refer comput gener anim face proc acm annual automat facial conform ieee model express facial comput pp make siggraph pp realist facial express siggraph pp websit advanc network water muscl model anim facial express comput graphic vol pp terzopoulo facial anim visual comput vol pp fig view complet fit anim mesh stereo reconstruct model view ty jy submit ra data acquisit interpret virtual realiti ieee workshop comput vision virtual realiti base pp januari structur stereo review ieee transact data acquisit interpret virtual realiti proc ieee workshop comput vision virtual realiti base human pp sara reconstruct environ virtual collabor ieee workshop applic comput lenz tsai techniqu calibr scale factor imag center high accuraci machin vision ieee transact pattern analysi machin imag binocular intern confer pattern oct yuill poggio gener order constraint stereo correspond technic report comput differenti properti shape stereoscop imag model intern confer comput vision pattern page june step facial anim volum ieee intern workshop robot human pp volum morph method landmark base imag spie int symp medic realist facial anim technic report mesh comput graphic
HCI/971 4 learn hierarch task model defin refin exampl andrew kathi charl rich mitsubishi electr research laboratori task model area comput scienc includ intellig plan interfac theori develop task model practic challeng present task model develop environ center machin learn engin infer task model exampl aspect environ support domain expert refin past exampl develop clearer understand model domain exampl constitut develop environ manag order verifi manual evolv task model unintend consequ introduct field comput scienc intellig plan interfac theori lot leverag appli algorithm task model approach rise notori knowledg acquisit develop accur domain model engin obstacl present develop environ task model acquisit process environ combin direct model machin learn base annot model verif regress test learn techniqu major compon environ graphic frontend develop problem develop task model consid context system collabor interfac agent engag dialog user jointli achiev task implement sharedplan theori collabor behavior driven algorithm interpret plan recognit action select behavior agent domain guid permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee copyright acm declar model underli task structur task model domain expert decid divid task involv abstract repres intermedi goal choic intermedi goal import collabor agent agent discuss accomplish task intuit user determin set intermedi goal number type paramet extrem difficult domain expert approach acquir task model base conjectur easier peopl gener discuss exampl accomplish task deal directli task model abstract design kind program demonstr system domain expert perform task execut action review annot log action prior develop machin learn techniqu infer hierarch task model exampl behavior gener domain expert provid minim annot exampl exhaust annot fewer exampl discuss type annot valuabl learn engin integr machin learn techniqu develop environ support expert gener task model involv remov refin past exampl defin exampl collect exampl regress test verifi behavior model develop process rigor check intern consist model design present paper reflect collect experi research group past year develop task model typic process initi version task model defin base small number exampl show common solut kei domain task model exampl frequent undergo substanti earli stage model gener cover addit exampl demonstr solut option altern order altern task decomposit defin addit exampl spur expert entir necessit rework previou exampl task model benefit provid exampl gener faster easier directli edit model learn tweak expert reason discuss organ complet accur task model inappropri collabor agent stage develop abil easili verifi behavior model collect past exampl critic section paper describ task model infer annot exampl provid empir result base implement learn modul section paper present design model build environ detail paper conclud discuss relat research machin learn exampl task model develop labor user user annot exampl learn system gener task model develop section describ domain expert partial annot exampl describ task model languag type partial annot empir result includ quantifi type annot influenc number exampl provid domain expert task model action recip action primit execut action call achiev indirectli achiev action action action type set paramet action includ explicit precondit effect recip method action recip achiev singl action recip specifi set step perform achiev action act paramet primit act paramet recip achiev step boil boil cook option bind constraint boil cook cook figur cook domain keyword task model languag bold collect object step step assum requir label option recip constraint partial tempor order logic paramet equal relationship equal paramet step paramet object recip call indistinguish constraint paramet step type order unambigu refer bind multipl step type figur sampl cook paper run cook domain chosen altern task model intuit easili modifi order conduct lesion studi task model form figur desir output learn annot languag input learn algorithm seri explicitli show correct perform task similar wai correct sequenc correct annot correct gener annot exampl base assumpt target model learn learner told correct target model repres partial order constraint pair order correct input learn engin annot ê tempor order list action constitut unannot demonstr expert pi primit pi intermedi goal semant case pi lieu flesh includ segment achiev pi segment pair call segment element element action segment group element mean collect achiev act type option partial map segment element boolean valu map defin expert remov element constitut correct domain unord partial map pair element segment boolean valu map defin expert switch order pair element constitut correct domain unequ partial map pair action paramet boolean valu map defin expert correct segment exist paramet figur formal notat defin annot cook domain action subscript instanc act type distinguish argument primit action specif domain item ê true true true figur sampl annot formal notat figur defin segment type primit action partial map bottom figur option requir order boil step annot common water paramet paramet graphic interfac design expert annot inform intuit mark node tree visual clear partial annot fulli annot exampl interfac tempt draw absenc annot figur step mark option interpret unmark step case expert step requir option handl learn techniqu distinguish posit evid annot step lack neg evid step exampl recip machin learn algorithm extend work bauer techniqu acquir task model unannot exampl task model primarili algorithm learn requir step accomplish goal task model support collabor discuss extend work learn hierarch task model includ option step kei featur learn algorithm infer paramet refer collect propag role propag enforc equal relationship paramet valu primit action task model cook spaghetti cook ad tomato mushroom equal relat cross boundari action local recip empir result experi run understand tradeoff inform expert exampl provid learn accur model domain built oracl simul human expert vari type annot approach result tradeoff elicit annot expert presum data base unannot exampl expert learner access exampl gener expert start target task model simul activ domain gener sequenc primit action annot determin algorithm produc task model target task model exampl determin inform impli previou intern data structur alter ran experi target task model model repres part sophist tool build graphic user call symbol editor model construct process develop collabor agent assist novic user tool model recip primit act typic primit action test model artifici cook world model design specif test learn algorithm model recip primit act typic primit action model recip segment action provid vari annot provid ran variat combin annot report subset tabl averag minimum determin exampl produc chang underli exampl label tabl order annot equal annot propag annot option step significantli impact result annot reason option cook symbol editor tation avg min useless avg min useless ep eo tabl kind annot provid influenc number exampl learn task model easiest aspect learn involv relationship step note annot equal add inform propag data result random sequenc exampl trial cook domain trial symbol editor main provid equal annot dramat reduc number requir exampl encourag oner human expert appar equal construct propag inform directli interest result tabl learn strongli influenc order exampl process reflect minimum number requir exampl averag number useless exampl imagin human expert provid exampl closer minimum averag present useless exampl design task model environ section present design task model develop environ aspect environ support domain expert refin past exampl develop clearer understand model domain exampl constitut develop environ manag order verifi manual evolv task model unintend consequ figur show ideal sequenc user follow develop task model model develop straightforward path model visual manual edit user arbitrari point develop cycl process figur present achiev combin program time overarch gui applic support task model develop integr current capabl singl tool reduc burden domain provid opportun provid assist text note aspect develop environ implement model build tool written java program languag import benefici consequ easi design system defin start set action defin construct appli machin learn techniqu gener model base visual result model model subject test qualiti refin prior exampl manual edit task model run regress test collect exampl figur typic step task model develop switch altern compon model viewer learn interfac java bean task model languag implement superset permit specif refin task model domain exposit integr show person system develop task model make meal task occur physic user construct exampl virtual walk process make meal mental actual comput applic graphic user interfac built person simpli run annot result log applic concurr expert virtual process creat exampl defin start set action step user gener initi list primit shown figur primit figur initi work set categor chang bootstrap process system assum exist hierarchi action domain determin hierarchi major part task model develop defin primit implement gui applic activ real world process difficult identifi correct set abstract action challeng construct annot list instanti action type specif valu constitut achiev goal domain user start construct unannot demonstr make shown figur boil figur unannot user paramet valu includ unknown action type system user ad work set primit act read action exampl section work user group relat action user describ segment user group step system recogn act part work add annot ad pass time action ad minim annot version shown figur element segment identifi visual level indent surround bracket boil figur minim annot gener model base user annot infer engin updat current task model incorpor learn tool process submit gener occur result learn cook world figur comparison figur show propag miss version task model bar guidanc domain autom techniqu recip base type requir sort recip step deriv type step import issu machin learn techniqu preserv manual edit task model issu environ human comput collabor person pin part problem hand comput modifi formul solut learn techniqu expert pin part open issu paramet act primit act recip achiev step boil boil constraint boil boil figur portion task model discuss previou learn techniqu free domain expert paramet expert number type paramet mix approach support requir heurist dialog expert combin imagin expert state paramet type learn engin infer slot type map paramet ambigu situat propag unclear area futur work investig integr multipl learn compon system defin addit exampl expert iter task model determin good user defin addit inconsist current model work wai user system interact resolv sole domain expert result resolv model chang chang action origin defin primit action segment type definit action chang expert make error common sourc inconsist number type paramet action figur figur make provid learn system user ad detail paramet process system add act work set move primit add paramet definit action system determin option step recip kitchen water prepar happen coincid lack annot relationship hold system infer propag enforc relationship figur show output learn act paramet water water primit act recip achiev step boil boil option bind constraint boil boil figur portion task model exampl futur model refin addit order learn recip recip learn exampl show paramet ti specif domain water prepar water prepar gener futur work includ investig mechan learn system type exampl benefit learn process visual model infer techniqu gener model account expert review result match intent futur addit bookkeep learn techniqu enabl expert find impli piec model recip step order equal piec model ti exampl model manual result expert refin delet featur system support multipl view task model figur textual portion task model figur current work version task model repres tree primit figur tree view task model action depict icon leaf recip repres icon expand show recip achiev recip expand show step recip current label ad recip option step visual ad futur version model subject test qualiti model test collabor agent exist gui applic expert decid task model make suggest accur recogn intent expert creat exampl manual edit model improv qualiti accuraci model kind analysi absenc exist gui applic facil simul behavior collabor agent absenc exist applic figur show figur sampl interact tori window sampl interact user collabor agent base task model ident figur differ equal constraint paramet specif domain liter remov sampl interact thought provid learn system interact domain expert identifi weak error current task model care read histori reveal agent automat constrain water paramet boil action similarli propag paramet refin prior exampl task model domain expert refin prior exampl show learn system paramet propag easili ad paramet valu defin figur show refin figur refin paramet figur mark placehold domain expert refin figur manual edit task model domain expert manual edit task result learn version recip prepar highlight small defect correct manual edit dialog involv prepar flow natur paramet type paramet correct expert replac automat gener recip step advantag flexibl gloss text mechan task model languag superset action recip includ arbitrari java code term system mean support expert manual add java code task model regress test task model easi make unexpect consequ current implement incorpor rigor test facil identifi task model influenc analysi store exampl regress test earli stage model action recip definit undergo rapid chang model develop older exampl obsolet number type paramet earli longer consist current version task model action ad potenti primit earlier exampl longer valid import develop environ alert user exampl exist provid explan longer usabl user disregard earli time updat earlier continu regress test relat research tecuci al present techniqu acquir larg number hierarch task reduct rule demonstr discuss human expert rule intend agent assist peopl gener plan expert episod system infer initi task reduct refin iter process human expert critiqu attempt system solv problem rule tecuci al specif address issu build model absenc predefin ontolog notion regress test ensur model updat preserv correct gil kim gil report wide rang issu relat build knowledg acquisit tool develop knowledg knowledg store languag includ express paramet condit form iter work focuss acquir knowledg plan evalu assess task contrast approach infer task model annot develop tool script assist peopl edit elabor task includ techniqu detect redund inconsist knowledg make suggest user knowledg add plan idea direct edit facil environ present graphic tool elicit hierarch task repres cooper activ tool highlight box facilit convert inform text descript scenario concept model languag tool user save formal scenario order manual verifi futur model consist save test case similar work tool check model error addit kei differ languag altern decomposit abstract action abil enforc arbitrari constraint tool support infer jr present techniqu learn task model intellig tutor system learn task model causal link step order support abil explain step perform learn causal constraint system perform seri experi simul environ initi demonstr human expert refer jr agent learn util demonstr activ understand technic univ southern bauer acquisit abstract plan descript plan recognit page bauer interact data plan cluster approach proc intl joint conf editor watch program demonstr mit lesh learn hierarch task model demonstr technic report mitsubishi electr research sidner learn task model collabor proc workshop adapt dialogu gil explicit strategi support knowledg proc nat conf grosz sidner plan intent page mit kim gil knowledg end put interdepend model test proc nat conf page sidner plan recognit collabor proc intl conf user page sidner collabor user imperfect commun proc int conf user editor program morgan lochbaum collabor plan model intent structur comput dec develop task model inform scenario proc acm sigchi page environ analysi develop task model cooper applic proc acm sigchi extend page rich sidner collabor manag softwar interfac agent user model lesh appli collabor theori interact artifici special issu intellig user interfac bowman integr shell methodolog rapid develop agent proc nat conf
IR/972 5 natur languag call rout jennif bob carpent lucent technolog bell laboratori lucent technolog bell laboratori paper describ domain automat train natur languag call router direct incom call call center call router direct custom call base direct prompt rout behavior train corpu transcrib call carri inform retriev techniqu term consist sequenc morpholog reduc content document repres rout destin consist weight term frequenc deriv call destin train corpu base statist discrimin power term extract caller caller rout transfer human disambigu question system dynam gener queri tailor caller request destin base extens vector model evalu call router perform servic call center accur transcript call fairli noisi speech recogn output demonstr robust face speech recognit error system show substanti improv perform exist system correctli rout call call human oper approxim degrad perform speech recogn output word error rate introduct call rout task direct custom call destin call center provid simpl current loan basi kind interact custom current interact typic carri system rigid navig menu primari disadvantag navig menu user time listen option difficulti match goal option problem compound necess descend nest hierarchi choic activ request simpl english phrase balanc car requir user navig nest menu option develop altern menu user interact call router natur spoken english dialogu human oper typic dialogu interact caller human oper respond caller request rout call queri caller inform determin call mountain murrai nj mountain murrai nj fl associ comput linguist comput linguist volum number rout develop automat call select option option send call human oper situat router recogn capabl automat handl call rest paper descript evalu automat call router consist rout modul driven applic inform retriev disambigu queri gener modul util vector rout modul dynam gener queri tailor caller request destin base extens vector model call rout system desir characterist train call router domain independ fulli system easili port domain disambigu modul dynam gener queri base caller request candid system tailor queri specif circumst system highli robust speech recognit error perform system substanti improv previou system transcript call correctli rout remaind disambigu spoken input process automat recognit perform word error system perform degrad relat work call rout similar topic identif document rout identifi topic case call close match caller request call rout distinguish activ requir singl destin request refin interact dialogu interest carri rout process languag work natur languag call rout date awar colleagu design autom system rout call oper select salient phrase fragment caller request system prompt made long distanc area code includ phrase syntact semant credit salient phrase incorpor finit state languag model speech comput refer call type comput posteriori probabl call type pass weight fragment neural network classifi util boolean formula minim algorithm combin result set call type base hierarchi call type algorithm basi determin goal request uniqu intent util outcom algorithm select set dialogu strategi gener corpu analysi examin dialogu analyz set transcrib telephon call involv custom interact human oper analyz call semant caller request dialogu action oper analysi semant caller request intend carpent natur languag call rout destin activ indirect request call call tabl semant type caller request mine subset class user utter call router handl automat transfer human analysi dialogu action oper intend determin type call router provid user utter order design gener compon call router semant caller request caller respond initi prompt bank servic call direct classifi user prompt base level destin caller explicitli specifi depart transfer request destin form answer oper prompt part complet speak auto caller descript activ expect oper transfer call depart handl activ descript ambigu depend level detail caller turn depend caller understand organ call center call center transact relat save account handl deposit servic request talk save rout deposit servic similar request talk car ambigu consum handl car loan handl exist car loan queri ambigu due caller provid check account balanc pai car indirect caller describ goal includ irrelev inform typic occur caller unfamiliar call center difficulti describ goal indirect request im call ah friend gave number ah told ah number bui car didnt explain call tabl show distribut caller request corpu respect semant type analysi show vast major request base destin activ corpu distinct destin handl fairli small number call center corpu depart receiv call chose base experi destin comput linguist volum number notif queri np call call tabl call oper dialogu action request base destin activ expect predict suitabl handl automat call router goal focu automat rout call base destin leav indirect request human oper dialogu action oper addit analyz caller phrase request oper initi analyz oper respond caller request found human oper notifi caller destin call queri caller frequent origin request ambigu origin request heard understood tabl show frequenc dialogu action emploi human oper corpu show caller request requir disambigu analyz call immedi rout note involv underspecifi noun request car loan exist car loan car loan remain involv underspecifi verb transfer fund account transfer miss verb direct deposit caller set direct deposit chang exist direct deposit base analysi oper decid focu router notifi caller select destin case caller request formul queri noun phrase disambigu case noun phrase caller request call satisfi call router simpli human oper call rout addit notifi caller select destin queri caller automat call router identifi unabl handl call rout call human oper process process determin rout gener disambigu call oper carri modul rout modul disambigu shown figur caller rout modul select set candid destin believ call rout call rout destin caller call analyz utter oper turn dialogu situat oper gener caller analyz utter oper turn carpent natur languag call rout candid destin potenti queri caller request queri rout modul disambigu modul human rout notif oper disambigu queri caller figur call router architectur multipl candid disambigu modul invok disambigu modul attempt formul queri believ solicit relev inform caller request rout uniqu destin queri successfulli pose system make attempt rout includ origin request caller call human oper approach call rout applic inform retriev techniqu rout extens dynam gener disambigu queri rout disambigu mechan detail section rout modul vector rout modul inform larg collect repres vector space queri vector comput compar exist document document vector similar queri vector return appli techniqu call rout treat destin repres destin vector space caller request vector comput similar request vector destin vector comput destin close request vector select candid destin vector destin queri illustr simplifi space figur order carri call rout vector issu address determin vector comput linguist volum number balanc car loan credit card servic deposit servic consum lend rout credit card fraud bank hour loan servic figur vector rout modul destin call center destin vector remain constant long organ call center remain unchang determin caller request map vector space comparison destin vector decid similar request vector destin vector measur threshold candid destin select train process goal train phase call router determin valu destin vector term subsequ rout process train depict figur requir corpu transcrib call rout destin rout call process procedur obtain desir document term vector document construct goal repres destin creat document destin document destin raw text caller contribut call rout call router constantli updat destin vector data collect system deploi leav ad learn capabl call router futur work transcript process carri human automat speech recogn experi report human transcript carpent natur languag call rout document construct morpholog filter stop word filter text rout text deposit svc text term extract rout deposit svc filter text filter text filter text matrix construct matrix decomposit singular term vector document vector rout deposit svc salient term salient term salient term corpu rout transcrib call figur train process rout modul utter provid vital inform rout document deposit servic utter check balanc check stop payment corpu call rout destin morpholog filter stop word filter rout concern semant word present morpholog form word filter produc document construct morpholog processor bell lab extract root form word corpu process reduc root reduc servic root servic verb form reduc root reduc root form caller utter filter ignor list stop order build accur term model subsequ process ignor list consist common spontan speech remov alter mean um uh word proper speak car uh word uh filter call subset call corpu analysi exclud call destin repres ambigu call resolv oper comput linguist volum number properli extract bigram stop list word ubiquit contribut discrimin morn modifi standard stop list distribut smart inform retriev system includ domain specif term proper occur train corpu note word ignor list remov word remov word form stop word remov placehold insert utter prevent word remov stop word form stop word caller utter check check result unigram check account extract bigram caller term check account utter ignor list word variat common transcript speech stop list includ function proper term extract output filter process set root form content word extract raw text origin document order captur word term extract filter text list term count gener filter text threshold appli count select salient term term occur suffici frequent salient term reduc filter text document bag salient collect term respect count note term lower order extract word sequenc account result trigram bigram unigram balanc select salient term unigram occur bigram trigram occur time result unigram train occur time manual examin term select salient term relev rout matrix construct bag salient term destin straightforward construct frequenc matrix number salient number element repres number time term occur call destin number associ term destin underli assumpt term occur frequent call destin train occurr term caller request call rout destin frequenc matrix row vector repres term column vector repres destin raw frequenc count element set term point remov unwant term result report paper automat select term carpent natur languag call rout weight term occur train corpu occur frequent unigram term occur frequent call multipl destin greater frequenc count trigram term vector rout term vector account contribut combin vector order balanc contribut frequenc matrix normal term vector unit length result normal frequenc element weight base notion term occur document import rout term occur document term occur call deposit import discrimin destin occur destin adopt frequenc weight scheme term weight number document occur score idf log number document number document term occur idf log occur idf log weight term occur document elimin weight matrix multipli row idf arriv matrix idf singular decomposit vector weight frequenc matrix term repres vector destin repres vector order provid uniform term document vector reduc document appli decomposit matrix orthonorm matrix orthonorm matrix posit matrix nonzero valu rank arrang descend order figur illustr result singular decomposit equat shade portion matric basi term document vector preserv common variant idf weight ffl comput linguist volum number figur singular decomposit row form basi term vector row form basi document vector posit diagon matrix valu scale term document vector actual term document vector scale element depend intend comparison term document similar document measur dot product vector repres document dot product column vector weight frequenc matrix similar ith jth document simpli recov element ij orthonorm diagon equat suggest scale vector element repres document row vector facilit comparison document reason hold repres term row vector comparison interest comparison measur associ term element weight frequenc matrix diagon repres term simpli row vector document row vector make comparison term document carpent natur languag call rout figur gener call rout discuss process carri call rout process vector construct repres caller request order facilit comparison request document vector method comparison establish measur similar vector document vector threshold determin select candid destin gener caller utter text form keyboard interfac output automat speech perform morpholog stop word filter term extract procedur train process extract relev term utter higherlevel term gener indic potenti trigram contribut construct turn contribut unigram assign weight extract term weight appropri creat bag term extract term occur wn time construct bag effect weight term wn extract present request vector element vector repres number time ith term occur bag term vector ad addit column vector origin weight frequenc vector shown figur find column vector repres reduc space orthonorm diagon note caller utter scale appropri comparison document vector simpli comput linguist volum number obtain multipli sum vector repres term bag term candid destin select vector repres caller request measur similar vector document vector number wai measur similar cosin score euclidean distanc manhattan distanc follow standard techniqu adopt inform retriev commun select cosin score basi similar measur cosin score vector cosin reduc contribut vector angl normal length kei maxim cosin vector point direct raw vector cosin score give indic close request note absolut close translat directli likelihood correct rout destin requir higher cosin closer order request correctli destin order select uniqu threshold candid destin select appropri appli transform cosin score destin sigmoid function specif fit destin obtain confid score repres router confid call rout destin call train cosin cosin destin vector request rout call rout destin train data set cosin pair equal number call train data subset pair rout equal number call rout destin train set squar error method fit sigmoid set pair assum coeffici fit sigmoid function destin confid function destin cosin conf score request vector destin vector request conf test rout perform cosin confid valu transcript unseen unambigu request select destin highest score target destin raw cosin call rout correct destin sigmoid confid call correctli rout yield error reduct rate illustr advantag transform raw cosin score uniform confid score accur comparison destin carpent natur languag call rout threshold figur router perform confid threshold obtain confid final step rout process compar confid valu threshold return destin confid valu greater threshold candid destin determin optim ran seri experi comput router perform vari threshold interv repres percentag call rout percentag call potenti rout correctli disambigu section detail figur illustr result set experi show threshold yield optim perform adopt confid threshold select candid destin rest discuss call rout illustr call rout process caller respond oper prompt call appli car caller utter pass morpholog filter obtain root form word result call appli car word stop list remov replac result call appli car filter router extract salient term form bag term loan request vector comput weight sum term vector repres salient cosin request vector destin vector comput cosin destin subsequ transform sigmoid function obtain confid score destin figur show cosin score confid score top confid threshold candid destin select consum lend caller request rout unambigu destin disambigu modul vector disambigu modul rout modul return candid disambigu modul invok attempt formul queri solicit inform caller determin uniqu destin call rout comput linguist volum number consum lend loan servic home loan control oper cosin score consum lend deposit servic pc bank loan servic auto confid score figur rank candid destin loan servic consum lend car loan figur vector disambigu modul occur destin vector close request illustr reduc space figur caller request loan ambigu caller interest exist car loan vector request fall vector repres candid consum lend loan close goal disambigu process solicit term caller vector repres term ad origin request refin request vector unambigu rout candid destin term vector mean goal find term vector close differ candid destin vector request highlight vector figur differ dynam gener destin request form basi disambigu queri gener queri formul disambigu modul select subset salient term queri gener subset term relat origin queri disambigu candid destin chosen filter term base shown figur goal disambigu process solicit term vector close differ step term select process compar term vector differ vector select term vector close differ vector cosin measur destin vector carpent natur languag call rout term vector term term share select close term select relev term differ vector term select select term disambigu power oper term select figur disambigu process request vector scale comparison differ vector repres space discuss section document repres space suitabl comparison term repres space differ comput cosin score differ vector term select term highest cosin score set close term reason select threshold number term cosin score twofold situat term vector close differ avoid gener overli larg set close term focu smaller set term situat term vector close differ select set close term hope contribut formul reason give disambigu process set close select set relev term term term origin request term consid relev combin term origin request form valid relev term result term term origin produc relev term mechan select relev term focu select term noun phrase disambigu elimin close term semant relat underspecifi noun phrase origin request contribut disambigu final criterion term select restrict attent relev term ad origin request result unambigu rout rout mechan section combin origin request comput linguist volum number relev term form refin request rout modul invok determin refin request unambigu rout uniqu destin set relev term disambigu power form set select term system queri formul relev term satisfi includ relev term set select term give disambigu process term predict resolv system pose question solicit inform caller move origin request step unambigu request disambigu queri system subsequ select set term request formul disambigu queri result select process finit set term relev origin ambigu request ad resolv ambigu actual queri formul base number term set featur select term shown figur select criteria rule call human oper process select question formul base term select term number term share common system gener queri type question form base term select set occur frequent train base heurist common term relev obscur term altern disjunct explor possibl figur show system pose attempt rout refin origin request augment caller disambigu queri case term extract caller case system determin answer term select formul disambigu queri consid caller treat note disambigu train process basic fulli util set term document vector obtain train call router port call router task requir domain specif work disambigu modul disambigu illustr disambigu modul call request request ambigu call center studi handl mortgag loan separ type exist loan loan handl depart call router perform stop ignor word filter result filter utter implement path select select term share common term share common current consid explicitli word discuss hockei question explicitli term leav incorpor sophist understand system futur work carpent natur languag call rout gram term extract filter result unigram term loan router comput vector repres caller compar turn destin vector cosin valu request vector destin vector map confid valu confid threshold candid loan servic consum disambigu modul invok disambigu modul select term term vector close differ differ candid destin vector request vector result list close vast major semant close ow relev term construct set close term select close term form valid term loan result list relev includ exclud constitut valid bigram step select relev term disambigu result disambigu term term share head noun gener base result queri type system user answer router add bigram unigram car loan origin request attempt rout refin request refin request ambigu loan servic consum lend caller exist car loan disambigu modul select disambigu result uniqu trigram system gener question exist car user respond trigram ad refin request call unambigu rout loan user car trigram extract call rout consum lend evalu call router rout modul perform perform evalu rout modul call router set call disjoint train corpu unambigu rout correct ambigu annot list potenti destin test caller utter system initi prompt direct record inform ambigu call rout disambigu evalu rout modul perform transcript caller utter output bell lab automat speech recogn base speech input caller utter term extract perform vector caller request comput base term vector repres term extract perform call router directli ti accuraci term extract caller utter set term obtain current system simpl templat fill gener util manual construct map term inflect exist car loan comput linguist volum number word accuraci term accuraci raw root unigram bigram trigram recal tabl word accuraci term accuraci asr output train accuraci extract term base transcript caller utter output automat speech recogn input call delet term present caller request insert term occur request affect term extract accuraci rout perform evalu output automat speech recogn base word accuraci term shown tabl word accuraci measur account word transcript recogn string set result word base raw form word base comparison root form transcript recogn string morpholog filter term accuraci measur account set word contribut rout transcript recogn string term extract process evalu measur recogn perform calcul recal percentag recogn output percentag found recal percentag transcript correctli return percentag actual found tabl show root form word result absolut improv rel recal raw form word comparison root word accuraci unigram accuraci show recogn perform content word word combin comparison term accuraci term show recal find correct trigram requir unigram make trigram correctli recogn low recal featur make recogn postul trigram high observ result present tabl speech recogn miss term call introduc extra term exist show delet insert affect call router perform destin select perform evalu perform rout compar list candid destin manual annot correct call rout call classifi shown figur group call consid ambigu potenti rout correct correct destin candid destin group call consid unambigu rout carpent natur languag call rout call rout call rout overlap request figur classif rout modul outcom unambigu request ambigu request request tabl calcul destin potenti destin evalu router perform subset test unambigu request ambigu request request combin set calcul measur percentag call correctli measur percentag call correctli rout potenti correctli rout tabl show comput base classif figur data set unambigu request number call rout correct destin divid number total unambigu number call rout correct destin number call router find ambigu correct destin divid number unambigu request call consid potenti correct call rout correct destin disambigu tabl show perform test set base transcript caller request output automat speech result show system perform case perfect recognit fall perform current automat speech recogn output fall actual perform system determin perform disambigu determin correct rout rate unambigu call consid ambigu router unambigu call transcript asr percentag call rout correctli ambigu call consid unambigu router ambigu call transcript asr note perform figur tabl base automat rout discuss perform disambigu determin comput linguist volum number unambigu request ambigu request request perform transcript unambigu request ambigu request request perform asr output tabl router perform threshold system show call human oper affect system perform disambigu modul perform evalu disambigu dialogu satisfi criteria caller utter ambigu oper follow question disambigu request subsequ rout call destin call met criteria test set disambigu modul note test set disjoint test set evalu call call set satisfi criterion call record transcrib caller oper test access transcript call origin speech file ambigu caller utter router input outcom router classifi case call rout select destin rout consid correct select destin actual destin incorrect case router attempt initi disambigu outcom rout call determin disambigu queri gener led correct destin disambigu queri gener lead correct destin router form queri unabl gather suffici inform user queri rout call human oper tabl show number call fall categori router automat rout disambigu automat rout call correct destin notic ambigu call router consid rout correctli call router distinguish case semant ambigu carpent natur languag call rout rout unambigu rout ambigu correct incorrect correct incorrect reject tabl perform disambigu modul ambigu call correct incorrect reject class class class class total perform transcript correct incorrect reject class class class class total perform asr output tabl perform call router request equal rout situat likelihood potenti destin overwhelm router rout call destin initi shown effect human oper prone guess destin base likelihood rout call disambigu perform final evalu perform call router calcul appli result evalu disambigu modul section result rout modul section tabl show percentag call correctli incorrectli appli perform disambigu modul call fall class evalu rout modul obtain tabl result tabl show perfect call router send call test set correct destin send call incorrect call human oper system attempt automat handl rout correct destin speech recognit error introduc rout percentag call correctli rout call incorrectli rout interest note reject rate indic system attempt handl larger portion call automat note result tabl system perform recogn perform disambigu modul present tabl evalu transcrib text obtain speech data record transcrib caller initi system insert delet term recogn output lead inappropri disambigu queri reject human oper comput linguist volum number destin transcript asr output reject rate correct rate reject rate correct rate system tabl comparison system perform perform comparison exist system discuss section colleagu experi methodolog relat caller utter call type system perform evalu compar destin return call type classifi caller utter manual annot list destin label base caller utter call consid correctli classifi destin return classifi present list destin evalu scheme similar method comput perform router discuss section evalu router evalu scheme reject threshold transcript recognit output origin set call evalu rout modul tabl show comparison system perform perform version system shown tabl system perform substanti exist system transcript speech recogn robust presenc speech recognit error evalu transcript caller system automat rout call correct rout rate achiev rout call human oper evalu speech recogn system achiev substanti higher correct rout rate substanti lower reject rate note comparison system base strictli perform account factor destin speech recogn perform futur work current perform morpholog filter word root form cluster interest cluster word similar relat regular morpholog process digit sequenc digit conflat singl car make kind hand cluster lexicon improv perform overcom inher data problem earlier latent semant analysi reduct attempt automat cluster word semant similar involv select rank origin matrix found perform degrad interest explor resourc automat cluster word extract cluster present system perform form reject rate correct classif rate reject rate rang correct classif rate rang report set result graph tabl lowest reject rate chose paper carpent natur languag call rout ing thesauri current version interfac automat speech recogn call router top hypothesi speech recogn speech input report tabl top hypothesi approxim error rate salient unigram improv error rate speech recogn produc probabilist word graph singl hypothesi term extract graph straightforward manner weight score recogn assumpt lead slight degrad recal chanc disambigu modul formul reason expect system perform improv result evalu domain automat train call router action caller request rout call destin call attempt dynam formul disambigu rout call human oper rout modul select set candid destin base term extract caller request comparison term destin disambigu question dynam gener term automat extract train data base disambigu power queri formul process system tailor disambigu queri caller origin request candid destin demonstr effect call router evalu call router transcript caller request output automat speech recogn request input call router free recognit system perform substanti exist system correctli rout call call human oper output speech recogn approxim word error router perform drop perform drop illustr robust call router face speech recognit error acknowledg jim wolfgang provid speech recognit dian litman comment earlier draft paper refer allen gener semant consist input dialog manag european confer speech commun technolog bob jennif natur languag call approach intern confer spoken languag process jennif bob carpent dialogu manag call rout annual meet associ comput linguist page comput linguist volum number susan georg thoma richard harshman index latent semant analysi journal american societi inform allen process semant inform spoken languag intern confer spoken languag process allen wright speech nanci sandra carberri hybrid reason model indirect answer annual meet associ comput linguist beth deborah matthew stephen isard predict stuff european confer speech commun page approach topic identif corpu intern confer speech signal page bob jennif wu chou languag model content select dialogu intern confer spoken languag process stochast languag model speech recognit understand intern confer spoken languag process gerald smart retriev system prentic sch david jan pedersen comparison classifi document rout problem sigir confer sparck karen statist interpret term specif applic retriev journal editor multilingu bell lab approach ma automat acquisit salient grammar fragment classif european confer speech commun technolog
ML/973 6 neural network interfac map gestur parallel speech control sidnei fel geoffrei hinton depart comput king colleg abstract system translat hand gestur speech adapt interfac hand gestur map continu control paramet parallel speech map hand act artifici vocal tract produc speech real time unlimit vocabulari addit direct control fundament frequenc volum version input devic parallel speech neural network task divid vowel conson product gate network weight output vowel conson neural network gate network conson network train exampl user vowel network implement relationship vowel sound requir train exampl user fundament frequenc stop conson produc fix map input devic subject train speak intellig speak slowli pitch variat research fund institut robot intellig system nserc geoffrei hinton fellow canadian institut advanc research introduct adapt interfac natur import class applic neural network person provid high bandwidth control complex physic compat map person movement behavior devic crucial devic map fix poor map devic difficult control adapt neural build devic interfac map adapt automat train phase adapt interfac simplifi process design compat map map tailor individu user kei featur neural network context adapt interfac ffl neural network learn function exampl provid user demonstr input lead output program requir comput ffl adapt interfac peculiar user simpl user creat data retrain network ffl network run serial machin neural network inher suitabl parallel comput neural network implement adapt call map hand gestur control paramet parallel speech user speak scheme convert hand gestur speech choic scheme depend granular speech produc figur identifi spectrum defin speech base durat sound granular interest coarser smaller bandwidth user granular speech order muscl movement artifici vocal tract high bandwidth control good speech devic implement model speech product music instrument produc speech sound user control time sound produc speech musician plai note produc music unlimit control pitch sound adapt interfac implement translat gestur speech model long histori begin late system develop includ reson tube auxiliari control actuat manipul tongu jaw posit interfac control set linearli space frequenc gener call demonstr world fair oper train continu year learn speak system suggest task speak gestur interfac difficult train time significantli interfac implement neural network system learn user interpret model speak paper begin overview system neural network train test result qualit analysi provid speech produc singl subject hour speak figur overview system convert hand gestur base model gestur vocabulari base model hand divid map task independ substanti reduct network size train time figur figur illustr system import featur includ input neural network label speech output devic input system measur polhemu keyboard cyberglov measur angl user hand msec includ flex angl finger proxim abduct angl polhemu sensor measur freedom hand includ yaw user hand rel fix sourc measur contact point finger thumb left hand measur depress angl input map speech artifici vocal tract word gener gener syllabl finger spell gener phonem approxim time gestur figur spectrum map base granular speech switch contact hand data thumb rotat wrist pitch yaw yaw abduct angl user flex angl speech foot fix pitch map network vowel network conson network preprocessor fix stop map combin function figur block diagram input user measur foot map neural network fix function paramet drive parallel neural network fix map network train data collect user decid produc vowel conson sound conson network train produc conson sound base exampl phonem sound defin initi gestur vocabulari vowel network implement fix map vowel phonem defin user contact point design stop conson dynam sound prove fast control user foot volum control adjust speech amplitud map fix fundament relat pitch determin fix map user hand height time system send control paramet sound imag parallel speech paramet amplitud frequenc amplitud high frequenc amplitud voic fundament frequenc control paramet quantiz bit initi user form hand shape sound intend produc depress foot sound vowel conson qualiti produc continu fashion hand foot motion word form make correct user form depress foot quickli move hand produc sound final sound user complet control time qualiti individu sound map gestur speech decid priori map base simplist phonet descript speech coordin map tongu posit height produc vowel user hand open configur figur correspond tabl typic vowel manner place articul conson determin opposit thumb capit letter phonem differenti phonem intern phonet alphabet xy coordin map close vowel user perspect link tongu movement index middl finger tabl ring finger control voic static configur train point neural interpol result learn explicitli train transit data train transit hard extract accur trajectori real speech train section describ structur train neural network figur tabl network network basi current configur user emit vowel conson sound quantit result report network sigmoid activ shown figur input ten scale hand paramet measur flex angl joint middl ring thumb abduct angl thumb rotat angl output singl number train repres probabl hand configur vowel output network determin mix proport vowel conson produc mixtur vowel conson paramet train data includ vowel conson sound network interpol hand configur creat smooth fairli rapid transit vowel conson figur quantit typic train data consist exampl conson configur exampl vowel configur conson exampl obtain train data collect conson network expert user vowel exampl collect user requir move hand vowel configur amount time procedur perform session test interpret network output repres probabl fact train data target interpret probabl vowel sound figur vowel sound map coordin rel origin sound coordin form horizont plane user sit cardin phonem target vowel network flex angl thumb abduct thumb rotat figur input flex angl middl ring abduct angl thumb index finger angl rotat thumb output probabl user intend vowel dh sh vowel tabl static map phonem gestur correspond static conson phonem gener set consist exampl conson squar error train test set normal speak network made perceptu error boundari feel quick transit vowel conson back vowel sound produc user hand unusu configur intuit expect produc conson sound produc conson sound vowel network vowel network feed forward network shown figur hidden unit normal radial basi function centr respond cardin vowel output sigmoid unit repres control paramet radial basi function ji oe output rbf ji weight unit unit output input unit oe varianc rbf normal normal output unit summat unit normal rbf unit deriv normal unit gradient base learn deriv appendix centr rbf unit fix valu vowel predefin map vowel network conson network train conjug gradient descent optim techniqu combin line search figur varianc rbf determin empir oe set figur weight rbf unit output unit train train ident exampl vowel gener posit provid exampl ad scale coordin ad uniformli distribut term correspond rang approxim cm rang cm test set creat test set exampl vowel total exampl test set addit uniform interv test set addit uniform interv squar error train set mse addit test set correspond expect error network perform perceptu kei featur normal rbf unit user overshoot cardin vowel posit produc rbf unit suppress normal magnifi slight differ activ sound produc domin cardin vowel centr closest hand space conson network conson network discuss qualit analysi network shown figur hidden unit normal rbf unit rbf centr hand configur determin train data collect user static conson phonem target conson creat tabl defin initi map conson sigmoid output unit repres control paramet voic paramet requir conson sound voic input hand paramet cyberglov rbf unit normal output unit figur vowel input posit user hand hidden unit rbf unit centr determin map figur varianc output unit sigmoid unit rbf unit normal output thumb rotat thumb abduct flex angl figur conson hand angl input network conson network hidden unit rbf unit centr determin class averag hand paramet collect train standard deviat rbf unit fix output unit sigmoid unit figur train test data conson network obtain user target data creat conson sound scheme collect data singl conson target conson plai msec speech user form hand configur user depress foot begin start record green time step hand data collect store paramet target phonem end data collect green squar turn user save data redo current target move procedur collect scale train data hand data averag conson sound form rbf centr test collect scale rbf standard deviat determin empir set squar error train set test set expect error low squar error necessarili speech produc high qualiti intellig squar error serv determin network work perceptu test perform listen output network reveal sound produc user hand held fix posit difficulti sound sensit motion index finger qualit perform accomplish train extens speak expect skill form finger pattern music train learn speak hour speech intellig find difficult speak pronounc speak spontan learn speak user progress distinct familiar user system initi train conson network train data individu phonem format simpl word pair word format pitch control short segment format pitch control sing passag read fine movement control phrase spontan speech progress stage linear suggest list aspect speak difficult substanti amount mix level occur practic higher level facilit perfect difficult sound practic lower level stage regular interv subject return lower level refin speech adapt suit requir subject good perform network critic user learn speak network perform poorli user hear mixtur vowel conson sound make difficult adjust hand configur utter import user comfort initi map train data collect lead network perform hour retrain time made user origin system section fewer retrain requir futur user ng sound ad conson list ad addit hand shape ng sound user touch thumb hand accomod conson network input ad repres flex angl conson network extra hidden unit ng sound conson network train rbf centr chang train weight improv weight rbf weight adapt notic improv perform user vowel map alter move closer ee sound entir map reduc size network feedforward sigmoid unit network anticip network suffici user understand interact user adapt adapt remain interest research pursuit summari initi map base model speech open configur hand correspond vocal turn gener vowel sound vowel sound produc movement hand horizont plane correspond movement roughli relat tongu posit conson stop produc close ring finger flex repres vocal tract stop conson produc contact switch worn left hand control hand height speak intens foot depress learn user interpret initi map network conson network learn map exampl gener user phase train vowel network train exampl comput map vowel volum map interfac applic map user gestur space control complex devic method build appli interfac subject train hour practic speak intellig speech fairli slow time slower normal sound similar speech produc natur inton contour greatli improv intellig express speech read passag intellig requir word intellig spontan speech found difficult anticip train trajectori estim significantli improv qualiti user speech open research issu extract accur trajectori automat peopl make commun made portabl current implement requir machin capabl approxim float point oper serial port parallel port comput fit requir glove devic tether machin limit mobil user solv limit input devic system wireless transmiss data host comput mount host comput user foot cumbersom complet portabl system design altern method control singl volum paramet technic issu provid artifici vocal tract devic assist peopl acknowledg john drew van peter mike mike contribut refer bell make page novemb train stochast model recognit algorithm network lead maximum mutual inform estim paramet neural inform process vol page san morgan kaufmann low multivari function interpol adapt network complex homer watkin synthet speaker journal franklin june fel hinton neural network interfac speech ieee transact neural fel build adapt interfac neural pilot studi technic report nonlinear adapt applic technic report lo alamo nation phonet brace lewi implement system technic comput scienc hugh iter paramet optim techniqu encod speech european confer circuit theori page william learn intern error versatil softwar speech technic report joint speech research wolfgang ritter von der mit einer und wolfgang wild boltzmann perceptron feedforward network boltzmann machin david advanc neural inform process system page san morgan kaufman publish appendix deriv gradient normal unit design neural network occas normal unit perform normal divid output group unit sum softmax unit common normal unit unit exponenti activ function output normal respect unit softmax group softmax unit typic output unit model probabl distribut activ sum error function classif correct class target set class set variat normal paradigm ffl activ function unit normal exponenti activ softmax unit neg exponenti activ case function ffl error function unit output unit ffl type divid activ unit sum activ unit normal divid unit activ norm group unit group output layer hidden layer discuss describ equat implement normal unit arbitrari activ arbitrari error function arbitrari normal function equat softmax output unit deriv gener formul equat softmax unit hidden layer deriv notat activ function unit normal group unnorm activ unit total input unit form dot product weight output unit layer deriv defin illustr normal output unit number unit group differenti function group unit activ suffic implement forward propag normal unit straight forward backpropag error signal unit simpl calcul term pj error implement backpropag procedur complic error propag back unit group affect unit group normal unit effect total input unit express express easier understand error backpropag unit refer error propag unit group exclud effect error distribut unit group unit unit equat term equat term obtain equat case radial basi function term calcul distanc measur oe ji output lower layer normal easili ji manner term form depend unit output unit hidden unit case show error function term deriv calcul deriv calcul backpropag error weight layer unit refer euclidean error function sigmoid hidden unit softmax unit illustr equat calcul specif case unit normal group unit effect error unit equat deriv import point notic equat chang error respect function chang error respect error local unit error signal propag back unit distribut unit complet equat term equat term equat term discuss equat gener differenti hidden unit output unit chang type partial deriv error obtain error function backpropag error function unit group normal unit consid unit error distribut unit total express equat calcul complex calcul requir partial deriv group normal unit number unit unit error distribut member group number unit group comput penalti posit respect method requir singl procedur comput deriv unit form gener work type normal function normal function write equat reduc simpl algebra manipul form calcul group calcul term calcul unit calcul requir partial deriv equat term equat calcul group reduc complex comput requir partial deriv compar gener reduct depend normal function mean complet case type normal reduct point becker person commun normal reduc similar form list figur spectrum map base granular speech block diagram input user measur foot map neural network fix function paramet drive parallel vowel sound map coordin rel origin sound coordin form horizont plane user sit cardin phonem target vowel network input flex angl middl ring abduct angl thumb index finger angl rotat thumb output probabl user intend vowel vowel input posit user hand hidden unit rbf unit centr determin map figur varianc output unit sigmoid unit conson hand angl input network conson network hidden unit rbf unit centr determin class averag hand paramet collect train standard deviat rbf unit fix output unit sigmoid unit list tabl static map phonem gestur correspond static conson phonem gener
ML/974 6 recent advanc softwar technolog potenti control system design paper describ softwar infrastructur complex control exploit emerg softwar technolog present open control platform complex includ reconfigur custom applic applic control system design autonom aerial vehicl introduct complex dynam power telecommun present major challeng control system design militari civilian sector economi demand highli sophist capabl system current offer abil adapt chang abil reconfigur control extens compon run open softwar architectur support tool algorithm varieti sourc domain meet challeng requir fundament chang control system recent advanc softwar technolog potenti control system design architectur encourag flexibl extens evolut system distribut object comput heterogen compon platform network protocol advanc made enabl dynam reconfigur evolut system run paper describ softwar infrastructur complex control system exploit emerg softwar technolog present open control platform complex includ reconfigur custom section describ state art control system design discuss featur desir control system section describ open control softwar infrastructur support desir overview prototyp infrastructur develop autonom aerial vehicl control applic paper conclud discuss ongo work open issu state art control system configur control system highli complex system process manufactur aerospac power complex notion expand tradit concept includ function coordin open softwar infrastructur reconfigur control system prasad georgia institut ga situat optim control system aerial vehicl vertic takeoff land helicopt type control architectur applic depict figur integr situat awar mode select function coordin aim facilit mode transit reconfigur control activ intellig oper interfac complement basic algorithm modul hierarchi intend respond vari time frame intellig behavior vehicl exhibit mission high level function situat react quickli chang condit mission custom act slower time frame model control situat awar reactiv control mode select control mode transit control stabil control augment system sensor figur hierarch control architectur architectur support varieti sensor plug plai capabl extern intern condit dai night vision capabl typic sensor view mission specif configur plug plai mode raw sensor data fed sensor manag modul data valid fuse provid usabl inform control modul output sensor manag modul feed high level situat awar fault detect isol lower level control modul high level modul react extern intern threat potenti failur mode select modul gener sequenc mode chang oper regim waypoint gener vehicl flight control transit dynam schedul mode switch reconfigur modul nonlinear logic control framework assist accomplish switch task stabl robust manner level control hierarchi set point command trajectori stabil control control architectur depict figur specif possess gener featur found complex engin system modern control system configur entail seri perform varieti function carri specif architectur control system view hierarch distribut combin limit state art state art implement complex control system tend common set tight coupl modul typic modern control system tend tightli coupl share state control inform make system faster make system harder achiev advent effici gain tight coupl import abil updat control system quickli easili inflex data interchang distribut control system util data interchang compon modif hardwar requir extens modif entir data transfer protocol control system oper stringent technolog constraint current control system meet constraint satisfi comput requir extrem perform system control firm provid custom proprietari hardwar softwar platform sever limit compon distribut concurr process open control platform design softwar call open control platform develop georgia tech collabor boe serv substrat integr innov control technolog prototyp version successfulli demonstr appli autonom control aerial vehicl illustr figur consist multipl layer applic programm interfac abstract domain specif higher layer manag virtual resourc network distribut comput figur open control platform build extend advanc middlewar technolog heterogen compon commun asynchron middl layer treat compon network resourc flexibl configur achiev desir function readili reconfigur dynam layer support reconfigur manag make reconfigur chang reconfigur explicit softwar architectur model layer detail section distribut object comput complex control system increasingli made heterogen hardwar softwar varieti type machin platform program languag underli network technolog place commun compon vari applic control algorithm modul run desktop pc interact math model vehicl run multiprocessor comput simul capabl provid realist graphic visual figur run special hardwar visual aircraft dynam provid battl inform algorithm commun actual hardwar sensor actuat suit vehicl compon commun wireless connect bu vehicl distribut topolog evolv system develop interact vehicl sourc mission open control platform gui interfac control control interfac interfac interfac trajectori control collect trajectori control rpm model rigid bodi dynam aerodynam dynam testb φ θ ψ actuat sensor suit attitud control plate servo dynam control dynam figur distribut commun pitch roll yaw δ δ δ δ collect lat ω tail import challeng provid commun heterogen compon leverag latest middlewar technolog distribut object commun common object request broker architectur standard set object manag group achiev seamless distribut commun object run comput network multipl network protocol extens made corba technolog washington boe distribut commun occur priorit commun kei extens provid washington event servic enabl compon interact tightli coupl event servic commun call event channel event channel mediat inform flow supplier consum system architectur reconfigur local chang connect event directli link compon minim architectur impact switch compon event servic support realtim event priorit manag extrem perform attitud data higher rate qualiti higher prioriti type event event servic facilit schedul support multipl strategi event dispatch preemption virtual resourc network core corba technolog mechan reconfigur inform interfac low level introduc abstract call virtual resourc network simplifi configur reconfigur system compon mission object configur control softwar mission defin interact compon system systemat fashion treat compon system network resourc multipl level granular resourc flock mission plan level individu intern resourc alloc occur fault occur resourc deplet resourc consid reconfigur level redund sensor control surfac mission sensor level configur defin relationship inform flow compon determin function network resourc abstract distinct mathemat model actuat hardwar actuat devic abil resourc flexibl interchang chang compon progress simul real standard interfac compon resourc network resourc address connect directli interact irrespect exist network distribut comput specif abstract softwar infrastructur support coupl control system compon provid layer abstract easili configur reconfigur local configur manag mechan ensur valid consist function nonfunct requir critic configur evolut maintain system integr global coordin consist approach reconfigur build semin work runtim softwar evolut reconfigur control system follow standard applic make violat consist constraint common control applic task activ time reconfigur control compon replac follow depend type control requir mix strategi discret switch chang polici dictat sequenc reconfigur place stabl transit time period reconfigur complet order control continu provid stabil control polici requir initi reconfigur resourc activ addit sensor start gener data requir compon work concurr compon replac gather state inform replac place reconfigur manag layer support explicit definit applic reconfigur polici specif control domain prototyp open control platform initi prototyp driven applic autonom control helicopt test reconfigur scenario demonstr helicopt main collect control replac rpm control collect actuat fail stuck altitud control helicopt achiev control magnitud lift produc main lift produc main chang vari collect pitch set blade vari rotat speed main collect primari control surfac chang lift produc main rpm freedom slower respond margin feasibl rpm chang helicopt small margin larger small unman helicopt exploit secondari control surfac case collect actuat fail stuck function setup scenario shown figur variabl shown control system consist helicopt attitud control trajectori control pilot stick provid trajectori mathemat model unman multimedia gui visual flight dynam fault detect reconfigur modul trajectori control command trajectori yc input gener attitud ψ θ φ track desir command trajectori collect δ collect rpm output ω control altitud attitud control input command attitud gener actuat δ achiev maintain desir attitud actuat signal fed simul model actual helicopt fault detect identif modul induc preprogram fault event gener reconfigur command function modul logic gener reconfigur assum modul replac mission planner fault toler control algorithm automat detect decid reconfigur system simul model eventu replac actual vehicl hardwar remot pilot helicopt yc ψ trajectori command pilot stick trajectori control collect trajectori control rpm φ θ ψ fault reconfigur attitud control pitch roll yaw δ collect reconfigur command multimedia gui δ lat δ actuat deflect helicopt flight simul model figur flight control configur figur show behavior simul altitud rate test reconfigur scenario vertic descent altitud rate command altitud figur show command altitud rate hc time point vertic descent rate approxim command respond actuat stuck point posit altitud rate command attempt recov aircraft continu helicopt fail respond reconfigur event occur rpm control substitut nomin rpm control time switch collect control helicopt successfulli recov altitud continu mission reconfigur helicopt continu descend hit ground high descent rate compon integr demonstr system commun run process written program languag fortran simul collect actuat fault trigger reconfigur replac main collect control redund main rpm control onlin switch made gracefulli simpl chang control connect event channel initi prototyp demonstr abil legaci compon plug replac compon system evolv legaci flight dynam model initi demonstr system written wrap standard corba idl interfac defin integr rest system exist dynam model origin system made easi replac legaci compon higher fidel dynam model version demonstr system month ongo work open issu control compon control integr addit control primarili fault fault toler develop integr term mission plan mode select algorithm incorpor futur neural net fuzzi algorithm automat limit predict avoid develop extrem perform area attent includ perform explor wai balanc tradeoff provid system flexibl modular maintain perform dynam schedul current prototyp static schedul event servic plan extend full advantag recent advanc dynam schedul event servic unifi reconfigur process explor unifi reconfigur process close coupl softwar architectur reconfigur control reconfigur inform type reconfigur share resourc paper describ latest softwar technolog enhanc capabl emerg control algorithm benefici synergi exist concurr develop control algorithm softwar infrastructur support control technolog enabl open softwar drive underli softwar technolog forward demand capabl support custom extrem perform acknowledg work perform darpa contract gratefulli acknowledg darpa softwar enabl control program continu support author acknowledg contribut brian mendel bryan boe phantom scott mark freeman georgia tech altitud rate time unit figur result onlin reconfigur perform refer marcel industri applic fuzzi logic gener electr proc ieee softwar ieee softwar special volum number glass overview product famili distribut comput levin schmidt design perform corba event ieee journal select area prasad control algorithm flight simul integr open control platform unman aerial vehicl proc digit avion pp st oct schmidt dynam schedul strategi avion mission comput proc digit avion system pp volum schmidt design perform object request broker comput volum control paper machin proc ieee confer control pp sept object manag group corba common object servic dec rn runtim softwar intern confer softwar engin pp wolf approach ieee intellig vol page command command command prasad synthesi helicopt nonlinear flight control approxim model mathemat comput model pp aug adapt nonlinear control synthesi flight test evalu unman helicopt proc ieee confer control august prasad reconfigur flight control rpm control proc european sept adapt model flight control aircraft journal vol june control intellig proc int confer control august compon softwar handbook fuzzi editor chief institut physic pp plan flight meet challeng intellig journal advanc comput oct waldo jini architectur comput commun acm volum number pp juli
HCI/975 4 anthropomorph agent spatial languag multimedia technolog system bielefeld abstract paper describ commun virtual environ main emphasi process spatial express natur languag instruct work part project interior design domain multiag system act intellig mediat user graphic system make commun spatial relat develop anthropomorph agent graphic visual scene gure explain qualit spatial introduct interact graphic system user concentr imagin free technic import improv interact virtual environ intuit commun form work interfac intellig mediat translat qualit express natur languag quantit command graphic system aim process verbal spatial express develop articul anthropomorph agent visibl instanc agent encourag natur languag conceiv cation user agent place user ey virtual environ commun situat spatial instruct paper concentr process spatial express interest simul human visibl robot control natur problem vari perspect import smooth exibl di erent perspect natur languag deictic frame view addit frame consid recent present approach comput empir evalu mean basic spatial relat space main emphasi clarifi depend distanc shape respect simpl ideal object fig anthropomorph agent virtual ce room project complex set visibl spatial issu realist gure kind gestur possibl simul natur index spatial express compar ed addit problem dealt select actual frame refer section rst explain system section describ commun space presenc anthropomorph posit adverb discuss idea give outlook futur work section project environ project research focu theme cial intellig comput bielefeld goal develop intellig form commun virtual environ applic chose interact design explor manipul scene detail research project partli support ministri scienc research feder state grant augment graphic db object hierarchi geometr scene descript bookkeep graphic system hamilton control virtual camera refer color space coordin control mechan input data structur parser type listen speech listen gestur listen observ verbal gestur input fig architectur system commun system natur languag set agent altogeth form multimedia user translat qualit instruct human user quantit technic command updat visual scene model instruct issu multimod input agenc combin input di erent modal consist input coordin listen type speech gestur track analyz sensor data data coordin analyz integr input receiv listen gener intern task descript post agent hamilton agenc mediat agent system track exact object locat negoti altern wai act space agent comput spatial transform virtual environ scale scene object inspect modifi color agent identifi object mean color descript red chang object camera agent calcul transform virtual camera enabl navig scene resolv ambigu refer qualit refer agent determin rank list candid refer scene object hamilton control agent realiz manipul articul gure bookkeep agent author access modifi augment graphic data base suppli current situat inform agent request agent realiz mean instanc slightli vari function visual scene anthropomorph move chang wai rotat agent move horizont plane turn vertic axi graviti resist solid bodi account user deal agent experi acquir physic world head agent rotat rotat vertic axi angl rotat horizont axi maximum optic restrict avoid user orient virtual environ short period time head turn back special frame refer head import current system point gestur object agent improv commun gestur implement gestur arm extend index nger stretch comparison fig form bodi gestur easi grasp commun agent turn view object idl time arm turn back automat chang size possibl bodi size explor exibl provid instruct shrink grow agent adapt individu size user includ applic demand addit point implement wave gestur answer input agent turn virtual wave arm action evok answer wave user simpl data glove chang perspect system switch extern view view place virtual camera forehead hamilton virtual camera posit part hamilton cap visibl cover screen user possibl explor virtual extern view agent visibl scene serv anchor frame bodi user direct agent move scene assess ergonom featur furnish size comparison featur fig hamilton involv view user adopt perspect eld vision anthropomorph scene fig show view hamilton point gestur commun space everydai life awar commun space di cult describ rout direct furnish room aspect structur di erenc space space languag base time aspect speaker listen di erent point view clari ed actual frame refer posit orient time solv problem contextu knowledg gestur deictic refer front import part dialogu focu topic subsect discuss applic interact graphic system type locat deixi posit deixi deixi deixi term direct depend posit orient speaker listen percept dimens determin biolog physic graviti asymmetri human bodi human bodi symmetr direct refer system descript spatial frame refer implicitli utter understood listen determin frame di erent coordin system chosen speaker deictic origin posit listen person ax determin human percept space addit bodi special frame refer head upper part import posit orient human bodi speaker make refer refer object orient refer object everydai front side desk side peopl sit depend front left ax structur wai call face align modal utter speaker explicitli mention frame refer posit express speaker awar ambigu stand face face chang left situat knowledg actual understand ambigu utter empir nding select frame refer depend geometr factor distanc user refer optic factor contextu factor situat applic impress frame fig set experi refer chosen actual carri simpl experi random subject subject stand distanc meter angl front desk locat subject instruct move fig user deictic hamilton deictic view left move posit turn subject pot posit pot posit tabl show fact signi variat prefer subject inclin judg orient tabl uenc subject posit subject appar chose posit deictic perspect case conclud solut observ individu di erenc account fig bowl desk user deictic hamilton deictic view applic system di erent frame refer hamilton direct move point view extern viewpoint user depend frame translat space carri di virtual agent user face face fig show possibl realiz instruct left transform object user fulli awar frame refer fig show realiz instruct move bowl point view featur bowl move posit deictic view move posit deictic view user realiz object move posit deeper understand frame evalu relev literatur similar experi result vagu contradictori miller conclud frame refer easier deictic consid descript furnish room peopl deictic point view postul static situat frame refer frequent studi show signi prefer deictic point set select actual frame refer highli uenc contextu factor explor peopl spatial perspect actual imaginari listen human perspect research speaker dont share viewpoint neutral perspect studi result show import interact feedback speaker primari goal understood reason speaker perspect perspect interest featur frequent neutral descript requir person perspect minim partner ort partner highli perspect open question optim relationship system user addit gener perfect express creat perfect build architectur accept understand repair observ choic frame refer mean perspect relev make varieti contextu factor consid individu percept situat individu languag import extract gener rule exibl account frame refer realiz instanc space agent calcul transform object instanc object view deictic view user deictic view hamilton hamilton agent calcul movement anthropomorph gure realiz deictic frame refer mention evalu system rst carri transform deictic point view realiz meet expect correct system state system gener solut di erent agent instanc comput transform base di erent instanc work deal adapt individu user prefer advantag realiz improv robust system instanc agent carri task unoccupi space goal instanc activ possibl solut futur simpl hand gestur data resolv ambigu refer fig instruct combin hand gestur movement hamilton point view posit deixi english languag adverb posit deixi posit space depend posit speaker vari interpret adverb di cult relev frame refer complic di erent place time speak listen origin coordin system move gestur verbal refer abstract place region expand di erent found region includ place speak region exclud place speak german languag mean refer shorter wider distanc speaker region interpret posit adverb system commun space restrict simpl instruct transform object move furnitur virtual user refer region visibl room region visibl room abstract region relev limit context make describ interpret adverb suggest system correct user interact chair deictic refer user posit di erent perspect user assum clari ed user extern user posit formal virtual camera determin current eld vision user view anthropomorph agent identi es posit agent user involv frame refer instruct mention chair move anthropomorph agent virtual front screen region displac gestur region user direct point arm desk verbal express combin di erent form facial point arm nger system anthropomorph agent carri point gestur arm subsequ express region direct point arm complement point gestur issu user data glove describ region object space easier point gestur issu agent visibl refer posit anthropomorph agent mean listen easili imagin interpret bit move desk clue locat posit line view user involv user move virtual room hamilton bit move desk larg part interpret instruct vagu real speaker give short hint head ey graphic kind gestur di cult understand support current system realiz comput instruct inform di erent agent bookkeep knowledg hamilton agent spatial knowledg comput goal posit instanc hamilton agent refer di erent frame refer instruct agent instanc bookkeep inform bookkeep decid adverb refer refer object gestur posit camera hamilton relev mention gestur gestur perspect gestur perspect gestur gestur perspect gestur perspect relev hamilton realiz task object current adverb repres posit extend region actual goal posit object move determin object close comput constrain detect futur work desir gestur interact discuss futur work spatial dialogu increasingli attract attent di erent research area paper present anthropomorph agent graphic system add comfort respect spatial languag introduc visibl illustr possibl virtual room carri point wave gestur psycholog reason gure encourag natur main interest improv situat spatial commun deictic investig adverb di erent frame refer dealt instanc agent realiz instanc expect user actual refer frame account visual system posit adverb percept gure instruct user refer posit orient anthropomorph agent point gestur agent posit object result present realiz process spatial express requir larg amount situat knowledg peopl pronoun vagu descript distanc posit visibl angl perceptu context context instruct current instruct gestur refer object frame refer direct posit fig contextu factor experi psycholog factor gener context di erent refer object qualit posit direct work possibl regard uenc contextu factor give fuller account contextu factor area futur research center fig show spatial aspect frequent ambigu arrow uenc divid gener context import process spatial express inform automat adapt system individu user prefer refer die der fischer und zur und deixi im und ch empir valid model comput spatial al advanc arti cial zur bei bericht nr au dem sfb und im contrast studi english klein studi deixi demonstr benjamin wo ist bericht learn adapt interfac agenc distribut arti cial intellig meet machin learn environ springer zur de und auf pn languag percept cambridg automat depict spatial nation confer cial intellig view spatial preposit ai magazin mf ect spatial perspect choic work note process spatial ijcai montreal interact graphic design situat agent graphic springer linguist strategi nativ articl process latex macro packag llnc style
DB/976 3 pergamon inform system vol pp fl elsevi scienc reserv print great britain activ rule analysi rock roll deduct andrew dinn norman paton howard william depart comput electr uk depart comput oxford uk decemb final form march abstract activ system provid facil monitor respond relev activ behaviour event condit action rule number system base data support rule experi activ show system power potenti hard program exhibit poor perform runtim document address issu examin analysi activ rule context power activ system shown rule analysi method develop straightforward activ rule languag relat data model extend account rich event descript languag power execut model shown result exploit rule multipl queri appli rang circumst elimin duplic work rule process copyright elsevi scienc kei activ rule rule deduct introduct activ system system enhanc mechan support automat reaction situat relev data intens applic activ behaviour gener express describ event condit examin context event action made event system support fundament characterist system understood experi system difficulti technolog put practic central problem issu relat perform activ applic activ rule provid power mechan describ behaviour aspect applic user activ system awar behaviour exhibit set rule straightforward anticip number research made static analysi runtim observ rule behaviour work static gener conduct context rule languag power found prototyp activ immedi obviou easili result extend system paper examin applic earlier work rule analysi power activ rule show result adapt extend activ extens rock roll deduct system addit problem design debug rule identifi perform kei concern potenti user activ system reason applic exploit activ rule poorer perform anticip rule design implement correct free stand unit repeat access trigger transact effect optim activ rule recommend klau dittrich andrew dinn al base identifi share retriev task common multipl simultan trigger exploit multipl queri optim techniqu exploit techniqu activ system block perform multipl queri optim context static rule analysi optim chang mean set rule paper show rule identifi context multipl queri optim describ techniqu exploit activ rule languag rock roll document structur section present princip characterist activ introduc terminolog describ earlier work analysi activ rule section outlin featur rock roll deduct describ activ rule languag section discuss rule analysi rock section show result area rule analysi appli activ rule section present context activ paper assum measur familiar activ line present terminolog consist subsect introduc term paper activ system monitor primit updat invoc composit number specif oper place order event detect rule monitor event trigger rule trigger condit evalu action rule fire varieti languag describ activ behaviour semant rule runtim import featur activ rule system semant introduc paper rule analysi activ section result earlier research static analysi activ rule static rule analysi involv identifi properti rule base rule definit view warn rule programm undesir behaviour pattern exhibit rule base properti identifi merit static detect rule process termin set rule process reach uniqu final state valid complet rule execut sequenc start legal identif potenti set rule warn programm compil time possibl infinit loop run identif potenti warn programm rule base exhibit nondeterminist behaviour section address aspect rule examin properti graph show set rule interact studi individu rule action condit relat rule trigger activ graph formal definit structur proof properti introduc section activ rule analysi trigger graph direct graph node correspond rule rule edg mean action rule gener event trigger cycl trigger graph rule set process involv rule termin trigger fail account detail interact condit action potenti rule updat attribut set trigger graph rule base involv action updat attribut turn trigger behaviour action assign condit true overcom limit trigger graph activ graph introduc activ graph direct graph node correspond rule rule edg mean action rule chang truth condit edg mean condit true execut action detect potenti made conserv trigger graph activ graph posit essenti rule set exhibit termin behaviour cycl trigger graph activ graph rule common activ graph rule condit true execut action trigger graph execut rule termin analysi confluenc built notion rule commut pair rule commut execut produc final state execut rule commut execut rule trigger rule action affect truth condit chang true vice action chang effect execut action condit hold rule set confluent pair rule algorithm explan correct proof yield set rule commut rule fr fr repeat fr fr function return set rule trigger argument base predic starburst rule rule prioriti order defin rule programm complex rule system requir sophist definit predic andrew dinn al approach section definit depend analysi pair determin rule interact issu consid subsect condit action work graph previou subsect conduct associ piec conserv gener applic seek establish wai rule affect base set oper notion trigger starburst activ rule system repres oper rule rule set abstract featur oper ffl return set oper trigger rule inform event descript rule ffl return set oper rule perform inform condit action rule ffl rule rule base return set rule trigger fr note sort simpl syntact analysi support notion trigger build activ graph base similar techniqu conserv definit oper requir detail examin condit action rule involv necessarili specif condit action languag research report show oper condit action relat algebra rule condit consist relat algebra condit consid true return result result action term relat algebra express made algorithm present propag descript action rule condit appli exist result rule analysi result section repres state art static rule analysi number limit reduc exploit rang system appli ffl execut model consid gener conserv larg made clear effect featur transit granular coupl vari system result rule ffl rule system provid context analysi work role explicit event notion net support role event eca rule assum rule ffl construct activ graph depend abil rule deactiv condit stronger requir conserv result requir rule activ deactiv rule system rule trigger accumul rule automat render condit standard semant activ rule mean featur activ rule analysi relat system mean system construct activ graph automat determin rule deactiv static offer benefit ffl depend declar languag express rule action common restrict condit languag eca rule system declar queri languag underli activ rule system gener provid extens declar facil describ rule action number research sought build result section develop trigger graph base analysi method appli rule system develop logic data differ notabl starburst emploi coupl condit action evalu tupl level transit granular featur requir modif method trigger analysi profit logic formal rule languag obtain refin trigger base stricter analysi relat method invoc rule action unifi event prune trigger graph call event specif fail argument incompat bind analysi condit action code emploi identifi constraint appli method argument point invoc compar constraint event condit specif trigger rule prune graph constraint incompat refin succe provid stricter analysi switch specif case set granular tupl granular event action languag restrict constraint analysi prune trigger graph depend fact rule fire immedi ensur method invoc event trigger experi analysi techniqu report report termin analysi carri activ system composit event aim work similar work report conduct rule analysi power activ rule scope paper wider reason amount work activ rule includ number semin paper provid foundat field paper build extend earlier indic adapt applic power activ system optim previou work optim activ rule system tend concentr monitor primit structur event exploit straightforward execut model work gener algorithm exploit convent optim techniqu treat algorithm join transform program exploit intermedi result rule process surprisingli work optim system work closest rule analysi detect opportun parallel evalu rule gener confluenc analysi defin provid wider notion compat rule basi parallel execut strategi gener cope defer coupl mode complex condit action languag attempt deal event algebra mix transit granular reli phase execut cycl defer rule execut simplifi confluenc analysi common work present rule analysi andrew dinn al work paper incorpor power event specif execut model featur analysi multipl queri parallel mean provid perform activ rule rock roll section introduc rock roll activ system paper context work rule analysi optim rock roll objectori system support gener activ rule languag execut model combin featur commonli found isol rule defer coupl set tupl transit simpl composit event specif varieti event consumpt polici rock roll repres work activ object challeng context seek perform rule analysi optim rock roll rock roll deduct system extend includ activ rule rock roll activ program system rock roll major object manag implement data imper program deduct program roll figur languag oper data model minim mismatch roll rock om fig rock roll architectur object manag support primit type number manipul predefin set type user type attribut construct attribut properti instanc type type primit kind construct list aggreg schema figur defin abstract class part base part composit part part includ gener attribut inherit subtyp instanc composit part extra attribut construct set part hierarchi assembl instal part member composit oper provid access updat aspect object structur method lifetim automat ad access assembl lifetim attribut class method test composit part part member type declar interfac describ method defin rock roll separ class definit implement method base part composit part implement method composit part rock method comput cost qualiti valu assembl composit part implement roll method activ rule analysi type type lifetim qualiti public cost type fig rock roll type declar identifi part includ compon composit part hierarchi rock implement function procedur method program block imper control oper creat delet object oper access updat object structur perform roll order logic implement deduct method queri term deduct languag roll essenti act richer data model base method object class exampl method written rock roll figur rock code invok roll syntax resembl list figur goal set vertic bar solv project left specifi valu retriev solut return caller empti project mean true return depend solut queri return singl singl tupl arbitrarili select choic tupl depend variabl mention keyword queri return set valu tupl solut solut exist empti set return roll method invok rock method provid free properti detect compil activ rule system knowledg model rap roll activ program activ rule languag develop extens rock roll activ graph complex action languag difficulti demonstr context action falsifi condit rap support rule defin syntax design activ rule system requir languag condit action specif defin detail execut model emploi select schedul rule execut roll condit rock action languag complet languag specif requir definit event specif languag remaind execut subsect andrew dinn al class begin begin var foreach begin var end begin end end end fig method rock method updat qualiti comput store qualiti composit part qualiti lowest qualiti compon roll method transit closur collect membership relationship symbol messag send oper begin var var var children parent cp end fig queri type logic variabl roll queri infer composit result assign variabl type composit part queri retriev part part rock variabl bind recipi argument goal queri retriev composit part part id activ rule analysi primit event event specif describ action undertaken system user program rule trigger initi complet user method invoc oper read updat structur object creat delet instanc class messag event definit goal written syntax identifi oper interest rule program bind type constraint met argument oper part match call oper retriev member set instanc type composit part user messag event definit put match oper attempt updat assembl qualiti composit part qualiti keyword detect event messag action substitut place put oper option retriev result oper return altern result event definit part bind object return oper event algebra event algebra identifi combin rule emploi specif descript circumst trigger algebra earliest event event earliest event event event event event repeat time event event oper unord order conjunct event singl rock roll program compon event detect program end relev number time limit composit event trigger keyword specifi disjunct event trigger compon trigger repeat keyword detect repeat occurr event match compon specif limit occur time keyword control mean detect absenc event composit event trigger event occur program run complet number subsequ occurr event keyword earliest latest consumpt polici conjunct event deal situat compon event trigger compon trigger polici occurr event combin event occurr trigger conjunct polici earliest earliest occurr event combin occurr event trigger conjunct unif match explain discuss put qualiti event constant suppli argument event specif select event actual argument match constant suppli specif repeat mention variabl event specif handl similar event combin event share bind repeat variabl select specif specif add part match composit part instal member attempt bind occurr cp lead unif occurr recipi argument object composit event detect andrew dinn al activ rule system execut model event languag mean identifi circumst possibl lead fire rule wai implement fire process execut model describ rule select schedul fire event project transit granular circumst rule event specif control time rule fire multipl event occurr event paramet retriev event condit evalu action execut complet event specif written syntax similar queri event specif hand side project left hand side vertic bar project specifi frequent rule fire multipl trigger bind event collect rule tupl transit granular fire time put qualiti messag base part updat rule keyword place rule fire end program multipl call method put qualiti multipl bind recipi rule emploi bind specif rule rule tupl level fire time call put qualiti variabl bound recipi messag pass input queri part refer part rule project emploi rule fire bind chosen arbitrarili occurr put qualiti event option set level granular rule fire fire bind project keyword bind specif differ rule ps case trigger event collect instal set bound variabl ps referenc condit action rule run end program run rule assert point fire coupl mode coupl mode determin rule fire time condit action rule execut rock coupl mode defer condit evalu directli rule trigger evalu defer condit queu end current program run user defin assert whichev arriv point evalu action activ rule analysi execut directli condit evalu defer action queu end current program assert point reach rule defer coupl mode trigger assert point process ad queue defer condit action current assert point prioriti schedul condit action execut depth order evalu condit action trigger rule condit action rule fire complet process origin rule event trigger rule simultan rule ensur execut determin order absenc prioriti order simultan trigger rule select fire arbitrari order rule defer condit action queu process assert point program end defer queue order rule prioriti higher prioriti rule execut rule defer await condit evalu run prefer defer await action execut defin complet order arbitrari select made rule schedul set rule part program figur rule cycl detect attempt link part hierarchi cycl intercept oper higher prioriti qualiti cost repair rule run respond chang qualiti cost compon part modif part hierarchi updat cost qualiti composit part compon trigger updat rule top hierarchi composit part updat cycl hierarchi trigger termin rule analysi rap section describ rule analysi present result termin confluenc termin termin analysi rap reli result detail rule program exhibit rule trigger fire cycl rule trigger graph basic result appli context event definit support rule trigger composit primit rule condit rule action event termin analysi rap start effect featur construct trigger defin section trigger graph event paramet section event definit rap defin match call made applic put match call put constant string argument type filter specif event definit event specif put part match part object composit part event paramet type filter relev construct trigger graph rule trigger call trigger rule match specif event definit rise notion unif method call rule bodi method specif event definit method call program specif primit method event event specif andrew dinn al rule pair condit action prioriti rule cp true condit defer action prioriti rule foreach cp condit defer action prioriti fig rule base part present valu type call method call program match method event specif event definit number argument compat valu argument call boolean unifi unifi argument boolean true trigger graph composit event rule system rule monitor primit edg trigger graph rule gener event turn trigger rule composit singl rule rule base trigger subset rule trigger activ rule analysi mean search nontermin rule cumul effect set call rule event rule notion captur unifi event fc boolean cs primit unifi unifi unifi unifi unifi unifi unifi repeat trigger condit evalu featur rap account condit evalu lead rule trigger rap event user method invoc rock invoc oper implement attribut fetch collect membership test mean uncommon system condit trigger event identifi set oper perform condit action call graph minor predic section cope extra complex ffl return set call condit rule perform ffl return set call action rule perform ffl ffl relat event definit rule condit action requir access call event ffl return set call monitor event rule nontermin algorithm definit trigger graph section assum trigger relationship exist singl trigger rule singl trigger rule rule monitor composit rule trigger result activ collect rule mean notion straightforward cycl trigger graph longer fulli captur natur potenti interact rule languag composit event languag composit rule particip nontermin rule execut belong group rule trigger indefinit group rule identifi comput trigger graph edg repres trigger prune graph rule fulli trigger complet rule base refer rule fact treat make analysi significantli separ arrang made account extens check incompat type valu event definit involv share variabl andrew dinn al fr rule rule collect rule involv cycl infinit rule trigger trigger directli indirectli refer set rule reachabl rs frg repeat unchang rs rs fr rs return rs collect rule reachabl account fact rule composit compon trigger rule reachabl process yield collect potenti rule rs repeat unchang rs rs fr jr rs unifi return rs summari section conduct rule termin analysi account event composit fact condit event algorithm present lean heavili analysi event specif context trigger graph work report perform significantli sophist event unif present suggest termin analysi base event unif highli effect practic confluenc confluenc analysi rap base method termin made extra complex rap knowledg execut model coupl mode transit granular confluenc analysi built method establish commut pair rule starburst activ rule languag starburst commut algorithm consid oper perform rule condit identifi rule subset extent read condit evalu action write subset schema extent written rule action identifi clash write set rule overlap read set write set rule overlap clash occur order rule execut affect final outcom pair rule order prioriti outcom clash rule set rule confluent rule commut success fire occur success cycl rule determin order determin outcom activ rule analysi result depend strongli fact starburst condit action execut transit granular set coupl mode ensur fire rule condit execut action atom oper rule fire occur condit evalu action execut identif clash compar rule condit action condit mode fire rule involv execut condit action immedi trigger rule read write set rule includ read write set condit action code execut result trigger set transit granular ensur fire cycl fire rule rule trigger multipl time defer condit defer action rule emploi tupl granular multipl fire rule execut order rule execut cycl rule read write set overlap fire order possibl final outcom rule prioriti mechan appli trigger order multipl fire rule determin order fire order deriv consequ confluenc rule program prove context declar languag rule tupl granular defer condit action mode consid potenti sourc execut note problem mode rule tupl trigger rule process trigger rule rule trigger determin order special circumst multipl instanc mode rule trigger time roll execut requir free ensur languag simpl clear queri termin evalu optim strategi evalu goal order trigger rule occur roll queri process roll evalu involv execut rule action side effect trigger queu process queri complet exact order evalu determin strategi adopt evalu impli order trigger process indetermin note complic share activ rule system declar condit languag event structur access oper invoc postgr multipl occurr rule trigger concurr rule event conjunct form consumpt mode conjunct repeat trigger collect combin occurr event event trigger event occur combin result concurr trigger rule special case treat potenti sourc execut comput read write set isol rule read set write set structur compon schema access updat class aggreg rock roll oper read write structur class method put class part write attribut type class part read set user method rule built method potenti invok involv intern rock roll identifi primit structur chang oper invok definit structur identifi call made rock roll program defin read write set provid auxiliari andrew dinn al identifi set structur relat evalu condit rule depend perform role rule combin result function depend identifi element data model rock roll method oper read attribut access compon access ti set access ti list access ae ti set test ti list test ti iter extent class ig iter member type identifi set structur relat action rule modifi function modifi identifi element data model method oper attribut updat put compon updat put ti set updat ae ti list updat delet ti oper ae modifi delet oper delet activ rule analysi definit modifi requir definit captur consequ delet modifi attribut tg modifi modifi set list compon tg aggreg comput read write set group rule comput read set rule requir comput total set rule trigger evalu rule condit directli indirectli requir comput transit closur section rule trigger execut condit action complet rule fire includ defer rule trigger rule prioriti equal defer rule trigger prioriti greater equal execut fire assess commut includ read write set interven rule read set algorithm comput read set includ immedi trigger rule defer rule prioriti greater equal set trigger rule comput rule trigger condit rule trigger action rule return run prioriti great rule rs fr repeat unchang rs rs fr fr return rs rule rs fr repeat unchang rs rs fr fr return rs rule prioriti paramet separ conduct rule optim section andrew dinn al invari properti rule set defin algorithm member coupl mode prioriti greater equal lower initi valu set subset rule trigger condit satisfi constraint subsequ part definit ensur rule ad trigger exist member set satisfi constraint note set intens part definit ensur rule trigger action includ action execut immedi prioriti action exce lower bound rule set defer action prioriti action execut rule prioriti greater equal trigger result action rule prioriti higher read set rule comput combin data read data read rule rule write set rule comput read action rule contribut write set rule condit side effect rule fs section discuss queri identifi read set rule condit rule condit write roll queri evalu free rule trigger condit evalu side effect rule postpon end condit write set condit rule fs jr commut confluenc definit commut provid term read write set rule prioriti prioriti rule order prioriti order rule updat data rule produc side effect data read rule captur condit read write set rule boolean activ rule analysi explain section rule multipl concurr emploi conjunct event consumpt mode combin defer condit action mode tupl fail commut cater definit commut rule conserv criterion adopt tupl granular rule action updat attribut constant order trigger net result updat attribut sophist analysi detect case definit defin confluent rule set set rule commut order conf boolean summari section rule confluenc analysi conduct languag make explicit step account featur altern coupl mode transit granular activ rule rock roll section queri optim underli rock roll system adapt extend activ rule concentr optim rule opportun event action optim attent paid condit optim eca major perform bottleneck singl rule roll compil includ logic optim gener process tree tree built node repres select project queri plan process tree supplement fix point node control comput solut method optim work rewrit tree logic plan perform characterist figur show process tree result compil condit rule cycl figur graph top section label sourc line make easier understand queri plan relat origin queri process tree regard dataflow graph node receiv stream tupl element repres partial solut tupl entri bind variabl method queri goal left hand section correspond base definit method constraint node gener pair composit part part instanc part member composit part project node pass pair union node fix point node collect solut method hand section start fix feed fed pair solut method fix point node constraint node select composit part solut find composit part append composit input tupl output tripl project node project node pick nest part outermost composit project solut solut left merg union node produc full solut set method andrew dinn al project project queri method project union fix feed cp fig process tree condit cycl rule queri method project union fix feed project project fig cycl process tree optim top section aggreg type constraint filter redund solut node reject solut part composit node test entri solut ensur equal respect compon aggreg pair retriev event specif unoptim plan highli ineffici gener solut goal reject optim involv propag constraint tree section includ propag bind type constraint structur constraint figur show cycl tree optim kei action optim involv push constraint result event paramet process tree type aggreg constraint argument method identifi activ rule analysi invari origin call call optim propag constraint constraint section left hand tree section aggreg constraint argument valid initi call propag lower tree section summari presenc absenc input paramet effect amount work comput truth import activ rule system optim mean exploit paramet inform section shown rap compil exist function roll optim achiev effect optim singl rule condit propag constraint event paramet queri execut plan multipl rule section show result rule analysi appli identifi opportun multipl queri optim activ system motiv observ activ rule program rule condit similar goal evalu condit involv repeat comput essenti data multipl queri optim appli condit set rule rule trigger time order rule chosen process effect result evalu condit condit address assumpt multipl queri optim appli rule compil principl opportun detect exploit rule execut time basi rule happen trigger simultan detect carri multipl queri optim felt net benefit accru optim rule execut multipl time optim scope futur investig area condit involv examin properti rule rule base identifi global properti condit set rule consid condit suffici stringent make met real rule base benefici small group rule trigger time section condit identifi set simultan trigger rule condit appli rule analysi multipl queri optim set simultan trigger rule candid multipl queri optim fire member rule affect result evalu rule condit rule order prioriti order candid multipl queri optim higher prioriti rule write set intersect read set lower prioriti rule condit write set rule overlap read set rule condit notion refer defin set andrew dinn al ca boolean rs identifi candid rule set challeng rule optim identifi collect rule valid benefici exploit multipl queri optim gener effect context appli rule condit coupl mode monitor call call candid fr ca candid algorithm return set rule carri multipl queri optim optim process affect outcom rule process assess benefici carri multipl queri optim judgement cost model rule coupl mode benefit multipl queri optim rule monitor event rule schedul condit evalu end transact rule assert rule trigger rang event place period result oper perform user program result rule process larger search space opportun perform multipl queri requir group directli relat rule algorithm identifi set rule consid dr fr defer ca dr rule algorithm identifi set defer rule interleav runtim rule algorithm set variabl dr bound turn set defer rule set bound dr rule dr defer rule trigger rule assert point rule dr interleav rule dr make result involv extens compil runtim support modul activ rule system compil extend search optim activ rule analysi opportun algorithm benefit deriv exploit multipl queri optim assess cost model queri optim runtim rule schedul ensur condit evalu rule optim make share queri plan subsect present multipl queri appli condit rule part applic optim potenti figur list rule ensur compon part longer lifetim composit part rule trigger common creation link part hierarchi effect insert composit part rule min life run highest prioriti ensur insert part lifetim greater part hierarchi rule min life lower lifetim children lifetim exce insert part note run min life origin lifetim insert part updat children exce instal rule min life rule parent cp begin var foreach parent end condit action prioriti rule children begin var foreach children condit action prioriti end fig rule illustr multipl queri optim rule good candid trigger concurr common insert part condit share common call method condit affect oper perform action action modifi part rule order prioriti make rule set fail commut overlap write set attribut lifetim class andrew dinn al project project union fix feed project queri method project queri method fig process tree respect read set case extent type part membership type composit intersect rule write set rule common bind condit rule merg condit rule compil common bind evalu share goal time trigger rule min life occur trigger rule min life min life trigger schedul rule execut compon min life trigger relev subset result merg condit cach trigger record min life trigger schedul cach result avoid execut condit compil merg condit requir split bodi merg queri common goal goal common goal goal part rule min life cp part rule min life process tree construct tree section rule condit figur process tree optim tree top tree section optim algorithm emploi work correctli irrespect number root node merg queri execut root node tree collect solut relev rule condit summari section result rule analysi benefit perform rule optim demonstr exploit system inform obtain rule analysi algorithm identifi collect rule benefit result process collect merg rule repres process tree schedul detect rule condit evalu share part process tree trigger set rule paper present approach analysi eca rule rock roll deduct repres activ oodb activ rule analysi rich event specif languag power execut model shown earlier result analysi extend power rule work analysi carri user inform anticip behaviour rule result plan effici evalu strategi rule paper present approach termin analysi exploit event bind composit event oper build conserv rule trigger graph present approach confluenc analysi account impact coupl mode transit granular rule confluenc demonstr depend rule condit action context rich data model power action languag rule paper event inform condit restrict search condit evalu shown result rule analysi exploit identifi opportun appli multipl queri rule condit context multipl queri appli depend coupl mode rule algorithm present account featur rule base acknowledg work support grant uk engin physic scienc research support acknowledg grate fernand care read paper comment result work activ benefit input member european activ rule network refer jm widom static analysi techniqu predict behaviour activ rule acm paraboschi improv rule analysi mean trigger activ graph proc int rule system athen pp springerverlag widom termin analysi activ nw paton mh proc int workshop rule pp barali widom algebra approach rule analysi expert system proc pp barali widom delta relat optim condit evalu activ proc int rule system pp springerverlag ml aaa nw mh ai design implement rock deduct system inform ml nw aaa mh dinn effect deduct objectori languag integr proc int conf larg data base pp visual tool analysi rule behaviour activ proc int rule pp mishra design dbm rule inform softwar kim composit event activ context detect proc int conf larg data pp andrew dinn al zhou explan tool debug eca rule activ proc int rule pp collet optim activ rule parallel proc activ real time system pp nw paton debugg activ rule context nw paton mh proc int rule pp grai rule manag object orient uniform approach gm intl conf larg data pp morgan kaufmann nw mh aaa fernand activ rule languag rock roll morrison proc british nation confer pp nw mh aaa ml implement deduct queri languag tw ao proc intl conf deduct pp kr geppert activ manag system featur rule proc int pp nh gehani hv jagadish od activ constraint trigger camp gm intl conf larg data pp morgan kaufmann en hanson rule condit test action execut ariel proc san pp acm ap sd urban condit term rewrit basi analysi activ rule widom proc ieee workshop activ pp ieee press ap sd urban refin trigger approach termin analysi activ widom proc data engin pp ieee press kim model queri intern confer larg pp koch complet refer osborn dp mirank match algorithm ai product system proc pp nw editor activ rule system nw paton diaz activ system acm comput publish small extend function dbpl proc int rule pp rosenth chakravarthi anatomi multipl queri proc lo pp simon realiti activ system proc int conf larg data pp partial differenc effici monitor defer complex rule condit proc ieee data pp ieee press potamiano cach view system proc acm atlant pp mk sd sw ap implement evalu refin trigger graph method activ rule termin geppert proc int rule pp kr dittrich investig termin activ system express rule languag geppert proc int rule pp van der enforc confluenc rule execut nw paton mh proc int workshop rule pp widom ceri activ system morgan kaufmann activ rule analysi widom sj finkelstein product rule relat system acm sigmod intern confer manag atlant pp zhou hsu theori rule trigger system bancilhon proc extend technolog pp
IR/977 5 effect metasearch engin wu meng clement yu li depart comput scienc state york ny depart illinoi il abstract metasearch engin system support unifi access multipl local search engin select main challeng build metasearch engin problem effici accur determin small number potenti local search engin invok user queri order enabl accur metadata reflect content search engin collect highli scalabl accur select method method featur metadata repres content search engin organ singl integr search engin exist approach repres yield comput effici storag effici select method base theori rank search engin optim result method effect oper prototyp system built base approach metasearch resourc distribut text word introduct world wide web vast inform resourc recent year februari approxim million page web find desir data popular wai web util search engin creat facilit retriev web page search engin text defin set document search search engin search engin interchang index document creat advanc term repres content word combin content index identifi document term quickli search engin support vector space queri queri repres set term boolean user queri boolean oper major search engin hotbot attempt index entir web provid search capabl web page central search engin suffer number limit index fraction page web due reason robot lack link major search engin higher percentag index inform obsolet peopl doubt scalabl central search engin technolog search entir web ten thousand local search engin focu document confin domain document organ specif subject area cora search engin comput scienc research paper medic world search search engin medic inform organ instal search engin everydai reason search engin provid coverag web major search engin combin altern approach provid search capabl entir web combin search engin metasearch engin approach metasearch engin system support unifi access multipl local search engin maintain index web page sophist metasearch engin maintain characterist inform underli local search engin order provid servic metasearch engin receiv user pass queri local search collect result local search engin addit potenti search coverag advantag metasearch engin search engin easier index data date local search engin cover small portion web run metasearch engin requir smaller invest hardwar comparison run larg gener search engin googl challeng implement effect effici metasearch engin main select problem user local search engin document queri object perform select improv effici send queri potenti search network traffic cost search useless reduc order perform select repres store metasearch engin content collect fusion problem retriev document select merg document object list document ahead heterogen multipl search engin make difficult achiev good fusion good metasearch engin retriev effect close document singl minim access cost approach perform select collect fusion method framework develop rank optim base similar similar document local section main contribut paper develop experi techniqu rank techniqu base repres featur highli scalabl term comput space scale virtual unlimit number local integr repres local contrast repres local exist approach occur frequent internet techniqu correct select depend term examin adjac term pair combin simul phrase result method scalabl accur method repres major step forward build extrem metasearch engin oper prototyp metasearch engin base method implement rest paper organ section relat work review compar section review framework perform select collect fusion similar similar document section present techniqu base framework result present section conclud paper section relat work larg number research paper issu relat metasearch engin distribut collect publish approach rank queri base measur ggloss sum document similar higher threshold cori net probabl relev document due term queri sum document frequenc queri term weight cue valid varianc document frequenc queri term similar queri descript approach expect number document similar higher threshold rank method heurist design produc optim order base optim criteria measur rank similar similar document shown rank descend order similar similar document suffici condit rank optim retriev similar document posit integ suffici condit rank optim consid queri structur data unstructur text data consid collect exist approach weight alloc retriev retriev document higher rank score cori adjust local similar document merg retriev document approach heurist aim retriev potenti document queri determin document retriev local approach find tight local similar threshold local base global similar threshold approach aim retriev potenti document select minim retriev useless document problem type approach local similar function search engin similar function proprietari inquiru metasearch engin real global similar document merg retriev document advantag high qualiti merg achiev disadvantag document fetch metasearch engin enabl comput global similar collect fusion approach util estim optim order determin document retriev real global similar merg retriev document select collect fusion framework paper base previou work framework rank local optim suffici condit mention algorithm determin search document search return metasearch engin global similar return document merg return document framework review section focu paper improv scalabl select framework main contribut paper select method method hand scale virtual unlimit number local metasearch engin term comput space requir hand essenti maintain retriev accuraci previou method major step forward build larg scale metasearch engin recent whitepap prepar work group resourc discoveri assert potenti million repositori web todai call develop method resourc discoveri exist metasearch engin hundr local search engin approach scale ten thousand local search engin time achiev good effect reason exist method compar queri repres perform select larg number base exist method order perform select repres mean piec statist inform term detail repres roughli size metasearch engin ten thousand local search total size repres ten thousand time averag repres store slower storag select comput slow integr repres separ repres exist method size integr repres number metasearch engin small constant number consid queri select method highli scalabl comput storag typic internet approach retriev close similar document theoret framework provid achiev optim result distribut environ recent result report show number document retriev compar number good retriev effect perform deterior substanti method show good result situat section theori differ substanti result demonstr retriev document distribut environ essenti effect data site result depend exist train collect similar coverag subject matter term collect search internet environ data highli unclear train collect fact construct collect storag penalti high order accommod heterogen shown properli cluster retriev document distribut environ essenti effect central environ internet clear feasibl cluster larg collect perform dynam techniqu requir cluster document review work metasearch engin distribut inform retriev area framework select collect fusion queri paper simpli set word submit user transform vector term weight term essenti content word dimens vector number distinct term term compon queri vector term weight weight term depend number occurr term queri total number occurr term term frequenc weight weight term depend number document term rel total number document weight term base inform call document frequenc weight document similarli transform vector weight similar queri document measur dot product respect vector dot product divid product length vector normal similar similar function normal cosin function document frequenc weight term comput base global df term number document term comput similar global similar note overlap local sum local df term local approxim global df term overlap local sampl techniqu extend estim global df term number time term global df weight queri vector document term frequenc weight normal weight jdj length base cosin similar global similar queri document jq jdj jdj jdj review framework select collect fusion framework introduc user interest retriev similar document queri dn posit integ framework summar definit optim suffici condit rank optim algorithm integr select collect fusion base rank definit set optim rank order dn respect queri posit integ exist similar document similar document order optim similar document queri suffici examin note order depend queri assum similar document queri distinct set similar document queri uniqu proposit dn optim rank order dn respect queri dn global similar similar document queri global similar similar document queri rank order queri similar document queri proposit remain essenti true chang optim order longer uniqu dm posit integ exist set document highest similar document document set document set similar document set base optim order develop perform select collect fusion algorithm sketch select select search engin return actual global similar similar document metasearch engin comput denot min valu search engin return metasearch engin document global similar greater equal min sim note document search engin return metasearch engin document return search sort descend order similar document return user optim order select process repeat total document return user note collect fusion base actual global similar document shown rank algorithm retriev desir document order appli framework problem solv figur obtain local document global similar queri greater equal threshold min sim iter note local search engin retriev document base local similar function term statist result local similar document global similar document problem address discuss paper proposit afford search obtain global similar similar document estim requir similar estim method type repres global repres store global df term separ repres store piec inform term estim method time complex linear term number term queri queri compar repres metasearch engin larg number method scale term comput effici storag space method rank method select base framework section kei step rank global similar similar document shown rank optim retriev similar document multipl previou method estim similar similar document directli substanti amount inform enabl accur estim method approach similar similar document rank rank base measur method appeal featur measur obtain inform estim similar similar document integr repres make obtain measur rank base measur match base similar similar document result report section rank measur term local maximum normal weight averag normal weight defin document weight term normal weight jdj norm maximum normal weight document max jdj simpli averag normal weight document includ document term global document frequenc weight user queri queri vector global similar similar document respect estim max compar formula formula intuit estim similar document maximum normal weight queri term yield half express brace queri document averag normal yield half maximum similar document maximum normal weight queri term normal queri jq yield equal drop jq present impact rel similar valu similar document chang larg number observ maximum normal weight term typic larger averag normal weight term comput document includ term featur impli formula queri term term frequenc weight reason assumpt typic term domin number queri small typic true internet environ rank high larg similar similar respect queri larg determin max discuss summar term adjust maximum normal weight term term queri defin rank score rs respect max fq rank score defin measur rank note formula linear time complex term number term queri rest attempt theori rank base rank score short queri internet queri rank close optim rank base similar similar document integr repres order comput rank score respect adjust maximum normal weight term obtain store document statist inform easili obtain situat document access control develop metasearch engin case intranet environ document independ obtain search engin search web page binghamton web page independ obtain web spider start home page local search engin cooper metasearch engin ncstrl comput scienc technic refer local sign join metasearch engin metasearch engin simpli local search engin provid statist inform select case document independ obtain local search engin techniqu queri sampl adopt estim statist rest assum adjust maximum normal weight obtain follow exist creat separ repres repres adjust maximum normal weight term queri receiv metasearch queri inform repres comput rank score algorithm review section select retriev document repres store piec inform term scalabl exist select approach term storag space requir metasearch engin hundr local afford separ repres store metasearch engin goal build metasearch engin hundr thousand local search engin entir web potenti search metasearch feasibl separ repres search engin comput hundr thousand rank score queri time consum solut problem creat integr repres posit integ term largest largest adjust maximum normal weight local integr repres local term set pair format integr identifi largest adjust maximum normal weight site id store idea store inform import potenti queri term evalu queri integr comput rank score id term queri rank score comput independ number internet small averag small constant method highli scalabl term comput determin metasearch engin design search search engin queri small suffici user relev search engin set integr repres scale virtual unlimit number local term storag reason rough bound number distinct number local particip metasearch total number distinct term exce small constant number quantiti largest adjust maximum normal weight store repres total size repres bound assum term occupi byte averag quantiti occupi byte memori capac equip server integr number piec inform store term constant factor independ number number piec inform store term constant factor number integr repres approach highli scalabl comput storag select method effect desir document small number select method section conduct experi evalu effect method base rigor measur proposit show queri constitut internet queri local select integr repres similar document respect queri proposit number document desir equal number adjust maximum normal weight store integr repres queri similar document queri local adjust maximum normal weight queri term store integr repres note maximum normal weight queri term similar similar document respect queri mean singl term rank descend order maximum normal weight rank optim queri note order base maximum normal weight ident base adjust maximum normal weight type weight differ weight term singl weight constant document adjust maximum normal weight store integr repres queri term rank ahead similar document respect queri similar document queri note weight multipl term queri combin term estim base assumpt term independ distribut assumpt realist term frequent document expect term independ distribut introduc method remedi assumpt incorpor type depend adjac term note phrase consist term method work queri examin adjac term pair combin treat singl term process gener candid term pair term candid term pair stopword matter candid term pair potenti phrase local determin candid term pair combin document normal weight nw nw maximum normal weight combin term defin ik max nw nw estim maximum normal weight combin term assum term independ ik ffi maximum normal weight ffi small posit constant ik involv averag normal weight term ti store integr small posit ffi implement ffi averag normal weight term combin ik ik term combin term worth combin local determin combin pair combin combin pair combin term involv combin pair pair combin choic made base yield benefit case combin pair queri combin case queri list combin term pair identifi worthi combin pair combin diff ik ik ik differ ik ik term pair diff xy largest worthi combin pair combin repeat case case list decid term combin local integr repres modifi term combin ik creat largest maximum normal weight ik store integr repres combin term incorpor combin term queri evalu adjust made queri select comput rank combin term term consid term term combin combin queri treat term combin term ik set largest adjust maximum normal weight identifi integr repres comput rank score set comput rank score respect case term combin formula directli comput term combin term ik formula modifi slightli compon replac ik ik weight combin term ik queri replac ik maximum normal weight ik slow determin term queri combin fly suggest solut address issu common phrase compil advanc store onlin dictionari phrase treat candid combin term combin local determin offlin procedur discuss user queri examin phrase phrase treat combin modifi formula comput rank phrase treat combin origin formula prototyp metasearch engin web page cs depart onlin dictionari comput dictionari phrase comput scienc phrase learn process implement track user queri submit system identifi phrase occur number previou queri adjac term queri submit system time small integ term treat potenti phrase potenti ad dictionari benefit futur queri result report result experi obtain trec collect creat nist institut standard technolog collect cr record fr regist ft time fbi foreign broadcast inform lat select articl lo angel collect partit size rang document document total document gb slightli million distinct term internet queri real user experi queri collect stanford evalu perform ggloss select method queri experi queri queri term stopword queri queri queri queri queri term queri term queri length distribut test queri match queri submit excit search engin analyz observ made internet queri term trec collect queri reason trec queri averag length longer typic internet queri perform measur method search similar document set measur effect retriev measur reflect effici retriev percentag correctli identifi ratio number similar document search method number similar document percentag denot cor iden db percentag correctli identifi ratio number document retriev similar document percentag denot cor iden doc search effort ratio number search algorithm number similar document ratio denot db effort ratio document search effort ratio number document receiv metasearch engin measur transmiss cost ratio denot doc effort set measur report paper averag queri set real term number document desir user number adjust maximum normal weight store integr repres term experi paramet fi origin algorithm termin document return metasearch engin local search engin section fi control termin algorithm fi chosen greater number desir document fi algorithm stop document return metasearch engin local search engin similar document present user experi desir document retriev larger fi valu result shown figur result summar fi vari correct identifi correct document identifi number search number desir document cor iden db beta beta beta figur result cor iden db cor iden doc beta beta beta figur result cor iden doc number document retriev desir number document perform improv measur good perform case user find similar document document store queri method search approxim transmit approxim document metasearch engin queri averag desir document found method db effort beta beta beta figur result db effort doc effort beta beta beta figur result doc effort fi correct document identifi search retriev document compar perform fi fi approxim percentag correct document identifi averag search approxim retriev approxim document fi approxim percentag correct document identifi averag search approxim retriev approxim document applic find high percentag correct document search small number addit retriev small number document worthwhil figur observ db effort mean averag number search number similar document reason phenomenon explain note rank base rank score formula rank rank optim similar rank ahead desir similar document actual global similar algorithm document examin similar return metasearch engin desir similar low find document examin similar retriev algorithm termin prematur search desir rank desir rank ahead db effort figur observ fi doc effort due fact number document entir collect posit similar queri queri fi document posit similar search doc effort result select document retriev method achiev close ideal perform document site figur show result combin term comparison result shown figur combin term improv retriev perform fi vari cor iden db beta beta beta figur result cor iden db combin term cor iden doc beta beta beta figur result cor iden doc combin term correct identifi correct document identifi improv case combin term vari percentag point cor iden db percentag point cor iden doc fi vari correct identifi correct document identifi close ideal perform perform improv measur db effort beta beta beta figur result db effort combin term doc effort beta beta beta figur result doc effort combin term proposit method correct retriev similar document queri result method perform queri method perform shorter queri tabl list result queri length number term fi result case similar total number queri tabl reason origin queri share common term experi queri combin term combin term length queri cor iden db cor iden doc db effort doc effort cor iden db cor iden doc db effort doc effort tabl result queri length fi prototyp metasearch engin scienc academ metasearch demonstr system system web page comput scienc depart web page fetch web spider implement duplic web page identifi remov treat search engin demo system web user enter search term user document search statist cor iden db cor iden method queri result page displai desir number similar document found metasearch algorithm retriev document global similar url displai option search rank number displai bold red color rank number color explain user retriev similar web page number red web page actual similar web page queri base ideal rank ideal rank obtain base document singl collect document collect rank queri receiv option search evalu perform base metasearch engin approach select collect fusion base ideal rank effect metasearch engin good rank number return document red conclud remark method solv select problem metasearch engin environ approach significantli improv scalabl previou method comput space method integr repres hand scale unlimit number hand permit effici select queri method incorpor depend term solut result good retriev accuraci achiev solut prototyp system base method implement issu studi adopt queri sampl techniqu estim adjust maximum normal weight term search engin pilot studi carri estim relat statist maximum normal preliminari result techniqu work support part nsf gravano provid set internet queri experi refer baumgarten probabilist model distribut inform retriev acm baumgarten probabilist solut select fusion problem distribut inform acm sigir broder techniqu measur rel size overlap public web search engin www april croft search distribut collect infer network acm du automat discoveri languag model text acm experi select search engin metasearch acm juli pp gauch adapt agent inform gather distribut inform sourc aaai symposium intellig agent cyberspac gener gloss broker hierarchi merg rank heterogen internet sourc thistlewait method inform server select acm transact inform januari saracev real life inform studi user queri web acm sigir srivastava inform manifold aaai spring symposium inform gather distribut heterogen environ kirsch futur internet infoseek experi search internet acm sigir pp lee gile search world wide web april lee gile neci meta search engin seventh intern world wide web lee gile access inform web juli rish statist method estim text ieee tkde meng discov repres search engin technic search broker usenix symposium internet technolog rish determin text search internet rish estim search engin liu detect heterogen multipl text environ liu build effect effici metasearch engin submit acm comput survei resourc discoveri digit librari work group salton introduct modern inform retriev etzioni metacrawl architectur resourc aggreg web ieee etzioni queri rout web search architectur experi collect fusion problem callan effect retriev distribut collect acm sigir pp xu croft languag model distribut acm rish find similar document multipl text ieee rish methodolog retriev text document multipl ieee transact knowledg data engin meng principl queri process advanc applic morgan kaufmann san rish effici effect metasearch larg number text rish effici effect metasearch text incorpor linkag document technic lee server rank distribut text resourc system internet dasfaa
IR/978 5 word disambigu applic internet search approv dr dan moldovan dr dr margaret dunham dr richard dr peter word disambigu applic internet search master thesi present graduat faculti school engin appli scienc southern partial ful llment requir master comput scienc major comput scienc rada technic acknowledg rst dr dan continu support graduat valuabl advic write thesi sta student comput scienc depart support iii rada technic word disambigu applic internet search professor dan moldovan master comput scienc confer master thesi complet select ambigu word sentenc central problem natur languag process solut impact task inform infer thesi present method attempt disambigu adverb adject provid wordnet rank sourc internet gather statist semant densiti pair measur wordnet hierarchi essenti aspect word disambigu method present rank associ word binari combin prove natur languag process task retriev inform relat input question import task highli bene word disambigu method internet search thesi present applic word disambigu techniqu improv qualiti search internet word input question enabl creation similar list word semant relat origin queri extens extend lexic oper de ned inform improv resolut search internet iv speci describ system address translat natur languag question sentenc queri queri extens wordnet extract paragraph render relev inform document fetch search engin tabl content acknowledg iii list figur viii list tabl ix chapter introduct background resourc lexic resourc wordnet gloss wordnet brill part speech tagger inform retriev resourc altavista trec topic word disambigu depend approach contextu rank word algorithm procedur evalu conceptu densiti algorithm algorithm vi evalu comparison method test comparison method extens pair larger window size natur languag interfac search internet search nlp solut drawback previou work type question system architectur lexic process queri formul oper result discuss limit extens work refer vii list figur figur page comparison internet search system basic internet search system search internet search system improv nlp techniqu dark rectangl repres stage search system perform nlp method wordnet hierarchi fragment tipster topic system organ viii list tabl tabl page number word concept wordnet semant concord statist gather internet word pair valu comput conceptu densiti conceptu densiti ij final result obtain word pair algorithm cd pair cd pair cd pair cd pair queri combin oper sampl result obtain randomli select question trec real set summari result test question top number number document bottom number relev document top total number relev paragraph resolut search perform altavista test question time measur disambigu method ix famili chapter introduct word disambigu open problem natur languag process nlp inform bene accur method method broadli classi ed make inform provid machin readabl case work report cowi miller li mcroi inform gather train corpu semant disambigu train method implement gale ng inform gather raw corpora train yarowski resnik present method hybrid method combin sourc knowledg lexicon colloc mcroi bruce ng statist method produc high accuraci result small number preselect word lack wide semant tag corpora exclud learn method solut automat acquisit tag corpora present corpora acquir method test statist disambigu word disambigu method disadvantag de ned statist method disambigu adject adverb method thesi attempt disambigu adject adverb provid wordnet recent disambigu unrestrict word text base idea depend word determin context sentenc spell rst wrote letter word di erent rst mean written correct select word determin combin word approach disambigu word base occurr pair hybrid method combin sourc inform rst internet gather statist word rank provid rst step input semant densiti word pair calcul inform provid wordnet hierarchi rank correct word task inform retriev sentenc investig report phrase ambigu due small result search base sentenc improv associ verb investig noun report determin applic method present system improv qualiti search internet word input question determin addit term semant relat origin number relev document found search base input question main problem current search engin document retriev gener queri total irrelev subject interest relev document miss queri exact keyword ned restrict boolean result document call natur languag interfac transform sentenc queri boolean oper accept search engin thing highli bene cial search word occur input creat similar list word dictionari mean input word signi cantli broaden web search area improv design retriev oper retain relev inform approach direct exist search develop great set document produc queri figur show internet search system improv make nlp techniqu gure present comparison architectur internet search left side gure repres basic scheme search side gure describ internet search system nlp techniqu involv nlp stage resourc repres rectangl natur languag improv system perform determin keyword input question inform similar list creat includ word semant relat list queri intend number relev document found search internet search system improv nlp techniqu lexic resourc basic internet search system retriev resourc inform queri search engin document boolean oper queri search engin document search engin wordnet gloss wordnet english sentenc brill po tagger lexic keyword xi similar list format similar list si lexic oper relev keyword xi boolean oper figur comparison internet search system basic internet search system search internet search system improv nlp techniqu dark rectangl repres stage search system perform nlp method extend queri input current search engin retriev document internet document lexic oper appli order fetch relev inform step search thesi organ chapter present resourc word disambigu resourc involv internet search system kind lexic resourc inform retriev present section word disambigu method chapter section describ approach section present algorithm involv present section result obtain summar section extens method discuss section applic method improv qualiti search chapter describ natur languag interfac search internet rst describ problem encount current search solut problem make natur languag improv search system section usag system result obtain present section previou work eld summar section work thesi present chapter chapter background resourc resourc develop test system thesi categor lexic machin readabl includ gloss de ned semant tag brill part speech tagger inform retriev resourc search engin text retriev research set topic test system design inform retriev lexic resourc step method make inform provid wordnet semant hierarchi gloss order distinguish word test accuraci achiev disambigu corpu word tag correspond wordnet search system present chapter process natur languag question order identifi keyword main concept part speech word input part speech tag version brill part speech tagger queri wordnet wordnet wordnet machin readabl dictionari develop princeton group led georg miller system gener similar list queri extens wordnet cover vast major adject adverb english languag word wordnet organ synonym call synset synset repres concept wordnet larg network organ synonym call synset tabl present number adject adverb de ned wordnet tabl number word concept wordnet part speech word concept noun verb adject adverb total rich set relat link word synset basic semant relat encod synonymi relat synset relat relat figur present snapshot wordnet semant hierarchi guard figur wordnet hierarchi gloss wordnet synset wordnet de ning gloss gloss consist de comment exampl gloss synset power attract hold interest unusu excit great color add interest de nition power attract hold comment unusu excit great interest primari color add interest room gloss multipl de nition multipl comment textual corpu word link wordnet view corpu word tag syntact lexicon sentenc found de nition text creat semant concord extract brown corpu link wordnet lexicon semant tag tool annot text wordnet semant tag le group semant concord base tag semant concord store separ shown tabl tabl semant concord content tag brown corpu le open class brown corpu le open class brown corpu le verb semant tag data codi ed sgml sgml languag pair form part word figur present fragment le figur fragment entri word present gure speci es part speech word vb base form base wordnet brill part speech tagger part speech tag import area tagger phase lexic process system role tagger assign part speech tag rst step perform lexic high order reduc propag error brill part speech tagger develop rule base system automat acquir rule tag appli process assign part speech word encount free text decid tagger result test perform text consid le world street journal manual tag project averag size le set token includ word punctuat total size word token tag assign brill part speech tagger manual assign tag brill accuraci prove tool suitabl perform part speech tag high accuraci inform retriev resourc rst algorithm method thesi gather statist internet occurr task perform altavista search internet search engin search system fetch document potenti includ relev inform respect input question test retriev system question deriv topic provid text retriev confer altavista altavista search engin develop digit equip corpor palo alto research lab characterist search servic make altavista power search engin altavista base size inform internet access grow index uniqu world wide web accept complex boolean search advanc search function featur make search engin suitabl develop softwar goal qualiti inform retriev speci relationship creat keyword queri accept altavista relat creat oper document speci ed word phrase mari lamb document word mari word lamb document speci ed word phrase mari lamb document mari lamb document retriev necessarili document speci ed word phrase word mari lamb document word mari word lamb restrict word separ maximum word main concern decid reli altavista search document regard reliabl search engin number hit obtain queri vari small rang search perform exampl altavista advanc http interv time test reliabl consid set word adject set built text brown corpu test run consist search internet record number hit obtain perform period time test run hour result test show av averag number hit time hit rang av time hit rang av size inform found internet fact inform highli small variat achiev altavista search internet classifi search engin reliabl trec topic text retriev confer part tipster intend encourag research inform retriev larg text inform data structur call topic tipster project distinguish di erent type ad hoc rout ad hoc queri design investig perform system search set document suitabl system impli speci search rout queri investig perform system search stream system task address gener rout queri view lter incom document search system design improv qualiti inform retriev case speci ad hoc topic order test perform system deriv natur languag question ad hoc topic provid text retriev confer topic ad hoc collect present figur topic data structur eld interpret section identi es section classi es topic section descript topic section intend initi search section explan relev materi intern organ crime identifi organ particip intern crimin collabor organ countri involv relev document minimum identifi organ type illeg activ export vagu refer intern drug trade identif involv relev figur tipster topic test eld deriv natur languag question form similar question user search internet corpu entri present question deriv organ particip intern crimin retriev inform deriv relev inform evalu base narr section topic chapter word disambigu depend approach method present advantag sentenc context word pair attempt made disambigu word context word search internet queri form di erent word xed rank simpli order provid number hit good accuraci number text internet larg word process rank rank comput complex step step ne order complet di erent semant densiti measur number common word semant distanc word closer semant relationship word higher semant densiti introduc semant densiti easi measur wordnet metric introduc appli combin word rank essenti aspect method present associ word binari combin control modul distinguish correct associ small pool contextu rank word internet largest collect text electron internet sourc corpora rank word algorithm semant untag word word pair rank word form similar list word pick form similar list word word synset word hypernym synset similar repres synonym number de ned wordnet form pair pair form search internet rank search perform internet set pair de ned result indic frequenc occurr experi altavista power search engin oper provid de ned set asterisk number hit morpholog relat word number hit noun rank relat similar algorithm rank constant procedur larg corpora similar correl result produc procedur procedur evalu method test le le le extract brown corpu queri form alta obtain result shown tabl tabl percentag correct rank top top top top list conclud top choic verb noun top choic adject cover high percentag upper relev di erent point mean procedur exclud save amount comput time word highli polysem queri form result obtain oper larger number hit rank remain tabl statist gather internet word pair top top top top noun verb adject adverb conceptu densiti algorithm measur word knowledg sourc nlp applic approach construct linguist context verb measur number common noun share verb noun context wordnet concept gloss act concept rich sourc linguist inform found determin conceptu densiti word algorithm semant untag verb noun pair rank noun determin algorithm tag verb noun pair pair denot verb noun wordnet algorithm noun rank rst rank consid rest drop reduc comput complex pair conceptu densiti comput extract gloss includ select explain determin noun gloss constitut verb noun store weight level verb concept gloss noun found determin noun noun includ determin conceptu densiti ij common concept noun obtain noun obtain ij ij ij number common concept hierarchi level noun hierarchi verb descend total number word hierarchi noun ij rank pair gloss explain concept exampl typic usag concept order determin noun verb perform experi conclud noun includ noun class verb hierarchi highest hypernym verb larger hierarchi provid synonym direct hyponym replac role corpora result achiev gloss consid enlarg context noun big hierarchi tend larger ij weight sum common concept normal respect dimens noun hierarchi size hierarchi grow exponenti logarithm total number descend experi metric run program formula algorithm provid result colloc law verb wordnet noun law algorithm appli search internet alta pair creat word similar list law rank number number hit set threshold algorithm appli rank combin verb time result summar tabl ij number common concept verb noun descend total number noun hierarchi conceptu densiti ij pair deriv formula present largest conceptu densiti correspond notat mean combin le tabl valu comput conceptu densiti conceptu densiti ij ij descend ij evalu comparison method test method test pair select rst tag le le pair pair tabl present summari result tabl final result obtain word pair algorithm top top top top noun verb adject adverb discuss result evalu gloss base calcul conceptu densiti advantag elimin larg corpu disadvantag gloss corpora determin noun verb error rate verb lexic ambigu noun wordnet futur work tag gloss wordnet improv result determin larger context sentenc work pair word advantag broader context disambigu pair protect court method pick court mean room law court reason court mean assembl conduct judici result sentenc context section extend method word disambigu time comparison method dicult compar long distinct resid approach consid statist word disambigu method disambigu unrestrict adverb adject text present attempt exploit sententi context base idea semant distanc lexic relat wordnet test report averag accuraci adject slightli result applic inform retriev top rank combin averag accuraci tabl method report literatur disambigu part speech word case pure statist focu limit number word result report yarowski larg train corpu noun yarowski obtain correct perform restrict accuraci extens pair method present appli similar determin conceptu densiti pair rst algorithm modi oper form word pair search internet larger window size extend disambigu method word cooccurr bomb damag injuri speci ed word consid combin word time conceptu densiti comput combin summat conceptu densiti word word result shown tabl conceptu densiti calcul word present column denot tabl cd pair tabl cd pair select largest valu conceptu word tag note word injuri di er determin method wordnet accid result physic damag provid de ned physic health typic mismatch ne granular wordnet translat human judgment clear cut select provid method justi damag injuri object verb class class randomli select exampl consid front tabl cd pair tabl cd pair sentenc extract sentenc show verb noun tag method discrep word due larg number word larg number explod tag encourag pair word sentenc tag correctli tag larger window size word correctli disambigu pair word consid accuraci multipl word consid disambigu process word disambigu dicult task diculti identi ed ne grain machin readabl dictionari wordnet method rank singl correct combin rst statist gather internet combin semant densiti measur calcul word describ applic method present process search internet result natur languag process techniqu order relev inform internet relat input rst phase includ assign inform queri phase chapter natur languag interfac search internet search nlp solut drawback problem current search engin point chapter includ fact document retriev gener queri total irrelev subject interest relev document miss queri exact keyword ned restrict boolean result document problem typic user tend natur languag complex simpl word combin word accept search engin nding presid unit state common user presid queri form boolean thesi examin bene ts natur languag process conjunct improv qualiti result thesi describ system address translat natur languag question sentenc queri queri extens extract paragraph render relev inform document fetch search engin perform search engin measur base relev inform retriev number relev document retriev evalu methodolog base resolut de ned ratio number relev document retriev total number document retriev case search paramet hard dicult check document return order determin relev user check return search rede ned factor measur number relev document found top hit term refer term refer mean number relev document retriev total number document retriev import fact determin user found answer question de ned call repres number answer question set pose question rst step queri extens intend number possibl relev document retriev step fetch relev inform step intend resolut previou work main approach consid research improv qualiti search internet larg collect text rst make multipl search engin creat meta search engin result number retriev base inform store multipl search engin hard task approach di erent search engin larg incompat solv problem impli uni cation queri languag type result return di erent search engin approach nlp techniqu work develop direct queri extens techniqu number document retriev improv qualiti inform retriev reason inquiri queri prove posit ect retriev relev inform queri extens broaden set document retriev retriev queri expand term similar word origin case procedur add complet term main techniqu expand origin queri rst consid machin readabl make wordnet enlarg queri includ word semant relat concept origin queri basic semant relat system synonymi techniqu extens semant relat deriv hypernymi relat techniqu consid research queri word deriv relev document smart develop cornel massiv queri ad term term deriv relev document report improv obtain experi method ishikawa origin queri extend word paragraph consid base similar measur paragraph origin queri lu evalu perform obtain experi perform tipster collect prove larger queri rang type question action question base knowledg domain process inform compon gener learn process question pose classi ed base inform formul level diculti nding answer present classi cation type question transform bloom taxonomi learn repres type question peopl process inform class level diculti level level class knowledg answer question found identifi inform type presid class formul answer kind question involv select fact eventu summar fact type stori describ event itali war class applic question dicult previou inform obtain appli order obtain result type relat comput class analysi class question involv show put answer question impli separ compon type classifi evid list featur class synthesi opposit previou type idea fact compound creat type predict solut suggest design class evalu hardest type involv make issu develop opinion judgment type import commerci citi easier class studi perform type question peopl prove question involv identi cation deeper analysi fact idea system thesi address task nding answer rst class question find answer type question involv text summar system architectur system architectur shown figur input queri sentenc express english rst present lexic process modul extract keyword sentenc queri format modul keyword form queri search engin document fetch search engin ltere lexic oper internet search system improv nlp techniqu lexic resourc retriev resourc inform boolean oper queri search engin document search engin wordnet gloss wordnet english sentenc brill po tagger lexic keyword xi similar list format similar list si lexic oper relev figur system organ lexic process modul adopt inform extract system develop muc competit sentenc boundari locat place part speech tag word version brill tagger conjunct wordnet phrase parser segment sentenc constitu noun verb phrase recogn head word elimin pronoun modal left keyword repres import concept input sentenc method present chapter identifi correct keyword import step lexic process word enabl expand queri word semant relat origin keyword queri formul main function perform modul construct similar list actual queri format rank word input easi rich semant inform wordnet identifi word semant similar input word chanc nding answer input queri wordnet provid semant similar concept level level consid descend order interest level word semant word belong synset level word express concept link semant entail level word belong sibl concept subsum concept number noun oper word wordnet synset rst includ word hypernym synset rst includ word activ activ synset similar list level de ned experi perform order measur perform achiev di erent level word similar drawn experi small collect text show synonym improv broader narrow select hierarch thesauru prove investig expand queri search larg text collect work develop investig wordnet experi expand synonym synonym descend isa synonym parent descend isa synonym synset directli relat synset result shown signi di erenc obtain expand strategi experi perform test drove import improv achiev broader narrow term result present includ level similar denot word question fx similar list provid wordnet word element list element word level similar word list actual queri boolean oper accept current search engin oper link word similar list oper link similar list di erent combin similar list link oper basic form give number document format gather thousand format null result document larg number document provid oper search engin fail rank top list sought oper ltere irrelev text oper approach ltere document rst search internet weak oper search larg number document power oper addit paragraph similar list paragraph oper search oper word similar list constraint word belong consecut paragraph inform request found paragraph entir document similar idea found sentenc similar list sentenc oper search oper word similar list constraint word belong sentenc answer queri found complex sentenc order appli document gather internet segment sentenc separ text sentenc prove easi make punctuat solv problem paragraph segment due rst highli unstructur text found web work develop direct present method work structur priori lexic separ empti line method cover paragraph separ occur text web paragraph separ consid html empti paragraph indent system oper present answer tax averag salari person pai unit linguist process modul identi ed po po po unit po po po notat mean part number actual wordnet result disambigu wordnet instanc adject averag system pick note word wordnet rank order util frequenc larg corpora keyword input step keyword high posit wordnet hierarchi level rst keyword wordnet revenu unit state usag tabl queri combin oper number queri document list formul queri search engin oper todai search engin adequ provid desir answer case tabl show queri number document provid consid search engin power set oper todai rank provid altavista lead document categori desir inform document fetch queri equal plan shift total tax burden tax capit busi tax salari incom tax payrol tax american pai peopl averag work dai pai feder work dai pai feder incom tax averag american work hour minut work dai pai tax analysi result tabl gap volum document retriev alta vista oper instanc oper document oper produc output oper fail identifi answer combin oper tabl great result paragraph oper system found relev american worker paid incom tax worker earn averag pai incom tax averag american worker pai greatli averag worker earn year gure result classi es queri concret queri abstract queri classi concret queri de ned queri base abstract queri base descript trec topic abstract user search concret queri test consid abstract question deriv descript section topic set concret question user search denot set trec real set tabl present ve randomli select question trec set ve question real result obtain tabl sampl result obtain randomli select question trec real set paragraph sentenc question trec question organ particip intern crimin control posit accomplish telescop endang passeng real question cheap airlin find price shop onlin averag event cell tabl includ upper repres total number document retriev total number paragraph retriev paragraph oper bottom number repres number relev document found top number relev paragraph column result search oper appli input word replac word similar list deriv number document retriev expect result obtain oper appli similar present column column number document extract oper paragraph consecut appli word similar list result encourag number document retriev small correct answer found case column show oper sentenc produc correct answer case summari question test present tabl box top number number document bottom number relev document top total number relev paragraph tabl summari result test question top number number document bottom number relev document top total number relev paragraph paragraph question averag question trec set averag question real set discuss interest observ queri extens determin number number time vari equal number document retriev extend number relev document found top rank search perform extend queri summari result present tabl queri extens number document number relev document top rank paragraph number relev document retriev signi cantli tabl present resolut search perform altavista set question de ned number relev document retriev top resolut measur number question answer found tabl resolut search perform altavista test question question averag question trec set averag question real set resolut averag question trec set averag question real set test perform obtain de ned section case trec case real question number answer case trec case real compar search perform shown tabl result question answer altavista explain fact resolut set smaller rst set case answer due gener speci term formul question hard compar system perform perform achiev system implement retriev answer narrow address speci design nding legal resourc internet address narrow domain system le usenet group result obtain trec comparison made work work relat task retriev inform larg collect internet report averag full topic statement result retriev inform narrow question heterogen domain encourag smaller achiev case real question explan fact user tend short lead larg number document found make harder task retriev relev inform explain higher resolut obtain trec set respect real set limit type present section system provid answer question rst class strong limit question user class question class subdivid abstract concret question method thesi improv nding correct answer abstract concret question relev answer found short question lead larg number document hard relev inform question land costa queri form boolean oper led document oper document relev inform top rank document queri phase brought modi cation structur synonym paragraph paragraph process nding relev answer question special term lead result question cartoon depict sugar act obtain document document queri phase number relev inform paragraph oper relev inform extens exibl search implement oper sequenc dw numer variabl distanc word list search sequenc oper requir sequenc word similar list maintain speci ed wai improv web search discuss thesi possibl index word wordnet impli disambigu document distant futur semant index potenti improv rank search inform extract object relationship improv web search compound noun colloc wordnet thousand group word mother stock point respect concept compound noun index term reduc storag space search engin chapter work wordnet ne grain make dicult pinpoint correct combin semant close applic machin ne grain disambigu work inform extract applic lump rank applic present method disambigu adject adverb text base idea depend found context method combin statist gather semant densiti calcul wordnet hierarchi import aspect method rank word context inform prove task inform rst correct word input highli improv qualiti inform retriev main drawback method time perform disambigu word algorithm rst algorithm gather statist internet good result rank word algorithm inher problem relat network site found long distanc site unreach algorithm calcul semant distanc wordnet section make semant hierarchi di erent time comput metric vari directli size larg hierarchi time order minut tabl present averag time execut determin pair tabl time measur disambigu method algorithm time algorithm algorithm total averag time disambigu pair word constitut big problem disambigu small question sentenc overwhelm larg text semant tag di erent approach consid robust system work larg small work improv po tagger concept identi cation brill po tagger recogn singl identi ed wordnet singl noun tag brill tagger separ solut problem combin lexicon provid wordnet po tag develop eric obtain improv tagger recogn lexic express identifi syntact relat input text basic relat identi ed plan syntact parser develop depend accuraci obtain test error rate introduc semant densiti fact gloss po syntact signi improv achiev build context word syntact relat make choic replac exampl provid gloss exampl found le po identifi syntact relat text origin algorithm modi ed comput syntact densiti word pair word syntact relat continu modifi po syntact inform includ base test accuraci achiev time perform decid approach lead robust system applic present system search improv nlp techniqu chapter perform main expand input search extend word semant relat keyword origin lexic oper fetch relev inform document found internet result obtain case trec case real question repres higher previou result eld type question present section system limit rst class involv basic identi cation inform hard limit studi perform eld prove question peopl includ class work address class system identifi fact relat subject eventu summar fact order give answer broad natur languag queri inform retriev capabl current natur languag technolog machin readabl prove tool web search search internet limit refer word disambigu conceptu distanc intern confer recent advanc natur languag process lexicon www infer corpor digit equip search system www american associ arti cal intellig spring pp taxonomi educ handbook cognit domain david mckai compani simpl part speech tagger confer appli natur languag process word disambigu model annual meet associ comput linguist june pp automat queri trec pp inform retriev text american associ arti cal intellig fall applic knowledg navig evid document retriev annual intern acm confer research develop inform retriev pp inqueri retriev system intern confer expert system applic pp lexic disambigu simul anneal intern confer comput linguist pp electron lexic mit internet legal resourc darpa speech natur languag workshop stanford protocol internet retriev search digit librari stanford enrich wordnet taxonomi contextu knowledg acquir text segment expositori text annual meet associ comput linguist pp tool navig retriev result american associ arti cal intellig fall symposium applic knowledg navig pp queri term base paragraph relev document pp sentenc process inform access world wide web american associ arti cal intellig spring pp concret queri special item feedback queri formul pp wordnet base algorithm word semant disambigu intern joint confer arti cial intellig queri impact retriev ectiv pp build larg annot corpu penn treebank comput linguist multipl knowledg sourc word disambigu comput linguist word disambigu base semant densiti workshop usag wordnet natur languag process system automat method gener tag corpora juli method word disambigu unrestrict text annual meet associ comput linguist june lexic commun acm semant concord identi cation arpa human languag technolog workshop pp semant concord darpa workshop human languag technolog pp interfac internet search engin descript snap system messag understand confer integr multipl knowledg sourc disambigu word approach annual meet associ comput linguist semant index type hyperlink american associ arti cal intellig spring pp select prefer disambigu acl workshop tag text lexic april perspect word disambigu method evalu acl workshop tag text lexic april combin lexic knowledg method word disambigu comput linguist comput evalu index text process prentic ing englewood cli pp search comparison metacrawl intern world wide web confer pp gener word disambigu method base full sententi context usag wordnet natur languag workshop juli text retriev confer queri relat annual intern acm confer research develop inform retriev pp word disambigu rival method annual meet associ comput linguist pp
Agents/979 1 repres coordin relationship influenc diagram research institut faculti scienc campu bs abstract necess manag relationship agent system achiev coordin behavior approach manag relationship consist explicit agent action base previou work area consid ideal fulli static relationship share mental state paper repres relationship agent entiti system influenc diagram advantag twofold enabl agent reason achiev goal uncertain environ inhabit multipl agent learn coordin relationship past experi introduct autonom agent intellig entiti act ration respect goal current state knowledg system concern studi autonom agent live interact common share negoti collabor achiev form coordin process agent reason local action anticip action ensur commun act coher manner import issu design coordin techniqu multiag system manag situat action agent affect oper agent action agent action facilit action enabl agent perform activ studi type effect agent activ central coordin agent ma account relationship activ wast perform fail agent inform relationship action exploit benefici relationship avoid conflict accur knowledg coordin relationship difficult maintain special agent act uncertain environ interact occur addit develop fulli detail environ interact make problem harder solv attempt usag explicit cr shown achiev coordin ma studi consid fulli relationship learn paper deal problem repres manag coordin relationship uncertain environ order achiev coordin behavior claim agent infer explain coordin relationship order behav coher agent pursu goal predict agent action facilit hinder achiev agent learn cr paper describ approach repres coordin relationship assum agent inhabit uncertain environ repres belief util action influenc diagram extens bayesian network agent repres infer activ affect agent inform achiev coordin behavior learn cr agent repres probabl conflict specif collabor agent knowledg decid action agent learn enhanc experi rest paper start overview coordin bayesian network influenc diagram section show repres cr id section describ usag id infer predict make account util cost section problem learn cr section introduc usag id ma section describ relat work section present direct work context coordin relationship simpl ma agent interact share environ agent affect environ execut action agent action influenc execut action action agent agent object inhibit agent interact task work singl agent call effect occur task work call coordin relationship worth note coordin relationship special case effect agent involv work shown effect coordin relationship repres domain consist multipl schedul coordin ma coordin relationship crucial design analysi coordin mechan common classif coordin relationship includ basic domain relationship enabl parent task subtask task requir method achiev task facilit task inform solut solut task enabl task complet begin graph gener coordin relationship subsum compet task overlap exist task parent task parent task tempor depend time task start finish estim real estim durat includ resourc final type relat resourc major coordin relationship domain factori schedul offic autom work coordin shown subset relationship achiev coordin facilit coordin ma charg hospit patient schedul paper repres cr influenc extens bayesian network section briefli introduc bayesian network repres relationship agent bayesian network bayesian network graphic joint probabl distribut set encod uncertain relationship paramet domain bn provid compact joint probabl distribut advantag condit depend provid effici mechan repres perform oper infer learn consist compon direct acycl graph vertex correspond random variabl variabl probabilist independ graph state parent graph captur qualit structur probabl distribut addit optim effici infer make compon collect local interact model describ condit probabl pa variabl parent pa compon repres joint probabl distribut set variabl pa variabl independ condit variabl agent interact share environ execut action execut causal relationship action relationship depict fig action repres node arc node model relationship understood execut facilit execut lack arc node assert belief occur unchang notic execut enabl action agent enabl action agent relationship action repres bn condit probabl distribut model strength relationship distribut arc shown tabl tabl conclud execut execut consequ facilit execut bn shown real world microsoft offic assist bayesian network tutor shell martin unman underwat vehicl usag field ma small section describ extens bayesian network addit repres uncertain knowledg make influenc diagram bayesian network repres provid framework infer reason section describ extens bn influenc diagram addit uncertain model action util order highest expect util treat problem framework util evalu basi consequ assum measur numer scale call util kind util involv scale common unit util action depend state variabl call determin variabl util treatment depend type infect patient model action influenc diagram id ch extend bn action node util node solv problem action node classifi interven forc chang state variabl action impact part model interven action node depict action diamond indic attach parent idea id predict expect distribut set variabl infer mechan bn base calcul expect util execut set action id restrict order action set variabl made order index set set variabl observ initi evid variabl set variabl observ observ induc partial order set set random variabl id defin restrict impact variabl calcul joint distribut knowledg state futur section describ approach repres coordin relationship id order infer predict ma behav set hypothesi model coordin relationship influenc diagram section show model coordin relationship influenc diagram assum agent accur inform environ agent repres belief probabl distribut encod id act reason base probabilist inform agent exchang share commonli develop commonli accept social cultur norm order learn commun worth note coordin relationship section repres id paper model type resourc facilit clarifi concept introduc previou section ma consist consult goal factori determin qualiti product maxim profit product pass type perform type evalu factori deleg activ factori decid perform perform evalu successfulli factori util minu cost evalu product complex laboratori fail fact model associ probabl laboratori laboratori process qualiti evalu product lab repres probabl success evalu process qualiti request factori price analysi depend qualiti process factori maxim util probabl minim risk result evalu includ report aspect laboratori account base factori evalu qualiti laboratori futur situat laboratori chosen base qualiti factori consult recommend laboratori perform type evalu consult charg factori carefulli consult base trust influenc diagram repres applic depict fig node repres top level evalu product minim cost repres result evalu node connect order model subtask achiev order accomplish node ae ae repres action evalu product qualiti medium high node connect result arc ae ae id requir exist linear tempor order action lower part id model relationship consult rest ma recommend repres action type action model situat possibl acquir inform order reduc uncertainti ae ae evalu evalu ae ae cost function util function ce cs recommend ce cs recommend ce ct ce trustworthi cost random variabl util node action node action node influenc diagram repres relationship ma addit influenc diagram shown fig condit probabl distribut relationship util function element detail paper state usag id model cr infer effici make base uncertain knowledg encod id factori determin previou experi consult opinion section describ usag id perform infer infer point easi acquir good cognit match mechan determin probabl proposit base prior uncertain knowledg current observ encod casual relationship effici optim make predict constraint relax advanc algorithm infer learn casual relationship gain understand problem domain updat belief probabl occurr event evid determin joint probabl distribut variabl ae ae goal ae probabl perform process qualiti perform process qualiti inform determin expect util option select conveni probabl ae probabl store directli comput comput probabl interest model probabilist infer gener method comput probabl bn consist fundament rule probabl calculu recov full joint probabl distribut answer queri ae calcul appli chain rule ae ae ae note ae obtain margin ce ce ct multipli ae order reconstruct full joint probabl distribut factor appli equat explicit reconstruct feasibl toi problem number oper involv solv rewrit equat normal commut properti matric algorithm heurist variabl elimin junction tree paper appli simpl method base heurist develop li appli heurist numer part equat simplifi wai reflect structur bayesian network equat simplifi account probabilist independ ae equat simplifi group factor order reduc number oper calcul distribut similar procedur appli denomin equat tabl show result obtain solv simplifi express ae ae ae low medium high low medium high tabl conveni factori probabl success higher probabl shown advantag id repres infer capabl model reason gener coordin relationship ma infer relationship determin probabl achiev goal set relationship agent determin agent relationship lead conflict point center analysi account util addit id calcul queri choic action order maxim expect expect queri easili calcul arc ae ae expect util action ae action evalu maxim expect argmax argmax easili probabl solv appli fundament rule chain rule similar manner infer influenc diagram ma previou section repres cr id section cr system infer explain cr agent goal repres cr id infer explain relationship uncertain environ system order permit agent infer explain relationship entiti system assum agent commun local view cr agent id view relationship ma relationship involv entiti directli relat transit relationship idea local id agent simpl distribut knowledg ma factori domain laboratori repres agent agent id relationship agent directli involv consequ distribut id agent algorithm infer explain id distribut ma agent local inform infer local inform agent agent inform interact agent exchang high level inform reason interact involv question trigger reason task explain agent receiv messag global id cr map ma distribut agent charg specif part knowledg reason id agent reason part id variat local condit algorithm infer distribut manner lc extens classic algorithm evid propag network basi lc process build tree id tree build depth search id detect break loop network result simpl variat distribut lc algorithm evid propag distribut bayesian network appli learn problem learn coordin relationship id predict opportun predict lead learn agent arriv term maxim expect util order learn cr agent follow strategi monitor execut interact evolut framework cr repres id classifi type learn learn condit probabl tabl cr learn cr structur influenc ma section interact factori decid task consult recommend fail perform factori trust consult reflect id updat condit probabl tabl ct rest section qualit relationship agent problem determin quantit inform repres condit probabl problem learn condit probabl distribut larg method big number case valu variabl determinist ma updat condit probabl tabl sequenti observ assum goal learn case find valu paramet condit probabl distribut maxim likelihood train independ case normal train set sum score function structur maxim contribut node independ paramet node independ estim condit probabl tabl boolean node set train count number time variabl true number time parent find maximum likelihood estim condit probabl tabl pa number time variabl learn amount count case multinomi gaussian comput sampl linear regress estim weight matrix kind complex procedur hidden markov model estim condit probabl tabl prone data solv dirichlet prior pseudo count result maximum posteriori estim factor make learn condit probabl tabl provid complet inform agent partial view ma variabl learn problem structur network partial observ solv expect maxim algorithm basic idea em knew valu learn comput expect valu node infer treat expect valu observ case node replac observ count event number time expect pa expect number time event occur train current guess paramet expect count comput indic function defin expect maxim recomput expect iter procedur converg local maximum likelihood surfac gradient ascent likelihood surfac em natur step size paramet care paramet constraint node infer subroutin call learn procedur research area theoret learn method suit learn coordin relationship extend algorithm paramet learn bn heurist relat cr effici learner accuraci relat work approach relat usag bayesian network ma area model method trustworthi negoti describ ma agent model agent desir intent influenc diagram learn predict agent behavior base past observ main shortcom approach larg volum inform model ma agent approach learn infer distribut ma approach present static id model relationship agent negoti relationship id learn attempt learn design specif type coordin specif domain agent algorithm classifi develop coordin domain navig resourc converg type algorithm achiev hundr approach effect domain agent repeatedli perform similar task ma discuss agent learn cooper procedur planner assum complet accur knowledg agent environ paper present approach repres coordin relationship uncertain environ mechan involv number agent select action maxim expect util refin model cr monitor execut action achiev coordin discov relationship bn id advantag compact uncertain knowledg optim action select learn ma enhanc level individu ma level develop ma base model paper ma develop java framework ma compar perform learner compon work mechan base reinforc learn plan expand model paper incorpor type relationship plan repres knowledg system form coalit evolv refer sandip sandip sen bayesian network aid negoti agent work note workshop settl conflict identifi opportun aaai technic report page barbuceanu fox design coordin languag system workshop agent intellig agent volum page august springer john daphn stuart kanazawa adapt probabilist network hidden variabl machin buntin oper learn graphic model journal artifici intellig research decemb bruce infer bayesian network ai dechter bucket unifi framework probabilist infer eric horvitz finn confer uncertainti artifici intellig page san august morgan kaufmann publish keith decker framework environ centr analysi design coordin mechan greg ohar nick foundat distribut artifici chapter john wilei keith decker victor lesser gener partial global plan algorithm intern journal intellig cooper inform june keith decker victor lesser design famili coordin algorithm thirteenth intern workshop distribut page juli aaai press technic report umass intern confer san aaai keith decker li coordin mutual resourc gpgp autonom agent june keith decker environ center analysi design coordin mechan phd comput keith decker task environ center simul simul comput model institut group aaai francisco local condit bayesian network artifici andrew richard learn cooper procedur aip workshop integr schedul execut dynam uncertain charl kahn bayesian network tutor shell artifici intellig david heckerman tutori learn bayesian network technic report microsoft march eric jack david david bayesian user model infer goal softwar user gregori cooper confer uncertainti artifici intellig page san juli morgan kaufmann jen coordin techniqu distribut artifici intellig ohar foundat distribut artifici page john wilei david michael victor lesser learn quantit knowledg multiag coordin nation confer artifici intellig confer innov applic artifici page menlo juli press finn jensen bayesian network ucl finn jensen influenc diagram encyclopedia john wilei kim pearl comput model causal diagnost reason infer engin intern joint confer artifici page morgan nagendra wagner evolut gpgp coordin framework technic report comput li effici infer net combinatori optim problem intern journal approxim autonom control logic guid unman underwat vehicl press missil space commun palo april ander finn jensen lazi junction tree infer algorithm base lazi evalu artifici thoma malon kevin crowston interdisciplinari studi coordin acm comput march thoma nielsen finn jensen welldefin scenario henri confer uncertainti artifici intellig page juli morgan kaufmann publish pearl bayesian network technic report lo comput scienc march pearl reason effect dean intern joint confer artifici intellig page juli morgan kaufmann publish stuart john daphn koller adapt probabilist network technic report juli sandip sen sekaran individu learn coordin knowledg journal theoret artifici munindar singh coordin requir heterogen autonom agent autonom agent june david spiegelhalt steffen lauritzen sequenti updat condit probabl direct graphic structur piotr gmytrasiewicz learn model agent influenc diagram intern confer user page juli springer frank von martial interact autonom plan agent demazeau decentr page north gerhard weiss adapt learn system remark bibliographi gerhard weiss sandip adapt learn volum lectur note artifici chapter page wooldridg intellig agent gerhard multiag chapter mit build system reusabl softwar compon lui workshop distribut artifici intellig system held conjunct confer artifici intellig brazilian ai symposium novemb
ML/980 6 simpl neural network model categor percept facial express curti cottrel comput scienc engin san diego la ca abstract perform neural network categor facial express compar human subject set experi interpol imageri experi human subject neural network make interpol facial express pictur facial affect differ materi human subject experi materi manner interpol imag construct morph versu pixel averag neural network accur captur categor natur human show sharp transit label imag interpol sequenc crucial demonstr categor percept model show highest discrimin transit imag crossov point model captur shape reaction time curv human subject sequenc network match human subject judgement express mix imag main fail model human subject attribut differ differ pixel averag stimuli imag qualiti morph stimuli result show simpl neural network access biolog constraint human emot access surround cultur categori label american subject facial simul fairli human emot express introduct research natur percept facial imag human task identif subject express uncov evid process categor young research human chang sequenc interpol imageri prototyp studi consist report categor transit sequenc categor percept typic involv demonstr boundari region subject chang rapidli subject show correspondingli greater abil discrimin stimuli previou work evalu type imag featur term efficaci input neural network model emot recognit facial express imag pictur facial affect categor rate human subject forc choic label imag model target emot categori network correctli recogn express displai face imag model predict human construct imag dissolv facial express imag test transit facial express model predict transit shallow transit curv human stimuli show similar variat human subject studi make ekman friesen prototyp show categor morph sequenc line draw extract ekman friesen imag morph sequenc natur origin imag young extens studi human young al henceforth show morph sequenc emot express express exhibit categor behavior contrast mage photo qualiti imag line draw contrast calder transit emot pair singl subject test studi human facial express inspir current studi section review result studi describ neural network model develop present result review studi import exhaust examin transit space pair emot face studi provid human classifi morph stimuli abil discern differ class boundari stimuli limit singl individu express imag step size imag amount kind data collect extrem focu studi demonstr account classifi term graphic denot fade imag fade term distinguish linear transit inher nonlinear process sad happi anger neutral disgust anger fear figur dissolv sequenc subject jj facial affect emot studi shown imag sequenc linearli interpol imag extrem tion base scale similar rate emot categori adequ account observ boundari behavior emot md result scale solut emot arrang circl scale space account base suggest morph pair emot opposit side pass neutral space center emot pair show categor behavior categori interest compar report result human subject experi neural network model previou studi data experi consist morph imageri singl subject serv endpoint transit sequenc experi morph construct emot neutral emot prototyp morph step size pair endpoint uniqu present random order made forc choic emot label neutral human subject curv figur time record found result rt curv fastest rt prototyp drop farther prototyp experi subject requir discrimin simultan present imag step transit subject show discrimin categori boundari standard requir categor percept experi young al test extent subject emot repres morph imag import imag perceiv expect subject poor judg emot mix imag subject give emot closest closest score includ prototyp imag order control similar emot imag bia result collect score subtract prototyp emot categori differ score averag averag prototyp move plot data plot figur show subject sensit secondari categori imag neural network model unabl obtain morph develop dissolv sequenc test transit behavior emot pair dissolv weight averag pixel express prototyp imag individu transit produc vari weight fix step techniqu work imag preprocess align ey normal bright artifact observ imag sequenc consist dissolv imag includ mix interv subject jj figur show exampl transit imag jj endpoint previou work determin extract featur ey mouth gener perform emot recognit featur princip compon pixel patch randomli sampl face imag form set basi imag resembl filter perform type cell primari visual cortex figur overlap patch ey mouth project featur result score input neural network model patch region shown left side figur patch project top princip compon random block result input pattern train pattern consist imag eleven subject includ male subject includ imag express eleven neutral subject express repres multipl occurr express number imag figur featur region normal test imag top random block princip featur construct input neural network ag attempt balanc train random sampl equal number emot drawn imag reserv train remain imag hold set stop network train subset train imag network network model consist ensembl fulli connect neural network network hidden output layer emot neutral unit input standard logist function train network back propag error cost function teach signal put express output network ensembl initi random random sampl train imag imag emot set train halt error set epoch network epoch train train network ensembl network ensembl gener imag accuraci good easi recogn young al imag human subject combin score network number techniqu winner weight averag method found consist give highest gener rate score output basi network ensembl output emot ij ij output ensembl compon network emot convert oe oe averag standard deviat raw ensembl output emot train pattern ensembl emot softmax number critic histor reason figur top graph show neural network emot transit top left graph top graph show bottom graph show discrimin model cosin consecut output vector output valu ensembl network gener stimulu button press studi highest output max input imag consid emot label button press extract time model standard measur reaction time neural network assum proport output error predetermin correct dissolv simpli differ maximum output network maximum output uncertain maximum farther slower rt discrimin pair stimuli measur experi stimulu pattern process output vector score treat store cosin vector similar stimuli network output similar stimuli cosin measur discrimin model rank subject experi simpli rank output vector time figur comparison neural network model human studi emot sequenc top graph neural network model middl graph show result studi final plot model time graph show interpol valu chang emot prototyp figur result experi examin averag curv subject give label mixtur emot prototyp vari stimuli present neural network model human subject transit face averag ensembl network present top figur averag human subject sequenc emot transit reproduc studi middl graph strike featur found ensembl model subject sharp transit region emot emot sequenc true human transit includ shown transit behavior sharp half instanc transit involv neutral stronger endpoint emot transit find emot case binomi lower endpoint emot similar fear intrud data network neutral account finer grain averag number imag neutral highest transit span step model behavior due dissolv face morph dissolv pure weight morph inher make mix resembl neutral prototyp morph neutral averag pixel space emot plan rerun experi morph elimin confound final graph figur present ensembl simul reaction time emot sequenc young al found result rt curv fastest rt prototyp emot drop farther prototyp lower show network rt emot model subject curv cutoff unabl obtain human data plot curv show shape paper figur present exampl ensembl model stimulu discrimin top graph show subject curv pair emot bottom graph depict discrimin score cosin output curv demonstr model sensit stimulu true discrimin test human subject model show discrimin score transit prototyp significantli mean score transit prototyp studi put worst foot forward model experi forc choic includ neutral fifteen transit result emot promin end restrict imag sequenc prototyp unrel express dissolv prototyp unrel express mix score figur graph compar neural network model actual human score comput method plot repres averag rate subject give emot face fall anchor prototyp text emot lump relat emot mix unrel emot neural network model human subject exhibit steep rise promin relat emot detect unrel emot experi strongli support categor percept emot categori experi young al consid extent subject sensit categori mix imag subject perceiv anger angri respond subject give emot closest closest score subtract averag score domin prototyp earlier differ score averag subject move call score unrel emot categori repres averag score averag plot data shown dash line figur methodolog rank order network output extract score result shown figur solid line circl squar show differ score emot repres dissolv morph network data li top human data case discuss shown feed forward neural network model featur base face featur region fix filter account observ found human studi model exhibit categor sharp transit curv higher discrimin categori boundari shape human rt model network model show good match human subject sensit prototyp mix imag unlik classic account categor human make result reflect model point departur data neutral replic experi preval experi differ due construct simpl pixel averag neutral imag true fall straight line endpoint perceptu space plan verifi conjectur appli model morph futur work result show neural network access biolog constraint human emot access surround cultur extent network instruct carv input space simul fairli human emot express neural network model object extract result output vector chang categori measur discrimin highest account result suggest model natur explan phenomenon categor percept reason neural network show categor percept simpl earli network show steep boundari chang transit shallow learn reduc error correspond sharpen boundari categori region ambigu shorten exemplar give result easili identifi jj give rise steeper morph subject pronounc agreement studi show familiar endpoint determin steep transit human subject futur intend show model complet account process learn classifi emot interest recent work shown case ident shown percept ident unfamiliar categor familiar stimuli suggest categor percept phenomenon natur fall learn process put increasingli sharper boundari stimulu categori familiar acknowledg andi young provid data reproduc figur member gari research unit comment work refer categor percept emot facial comput model human perform prepar editor foundat research mit cambridg categor effect percept face categor percept acquir neural workshop comput page london morph face face review categor percept morph facial express visual pictur facial affect facial action code system consult palo ca categor percept facial express categor groundwork cognit cambridg ny introduct statist infer dover york discrimin speech sound phonem boundari journal repres face imag classifi emot advanc neural inform process system ma mit press categor percept facial emot classif cognit scienc confer learn backpropag error reprint model affect journal person social model word recognit psycholog facial express test categori account emot recognit
ML/981 6 autom text categor support vector machin jame kwok depart comput scienc hong kong hong kong abstract studi support vector machin text categor unlik machin learn easi incorpor document exist train system dimens option svm adapt effici dynam environ requir frequent addit document collect empir result collect discuss introduct increasingli widespread inform servic made internet world wide web led inform overload problem million onlin document topic easili access internet inform inabl peopl assimil profit util larg amount inform appar develop automat tool effici effect retriev relev inform great demand internet world success paradigm organ larg mass inform categor document topic machin learn techniqu attempt autom text categor approach base vector space model document repres compon uniqu word extract document document vector thousand larg collect major block appli machin learn method exist techniqu reli heavili dimens reduct preprocess ad hoc comput concern view rapid amount onlin automat text categor tool handl steadi inform exist machin learn dimens reduct techniqu requir complet larger collect document investig approach integr dimens reduct appli techniqu support vector machin rest paper organ section review repres machin learn approach text categor section introduct svm section discuss applic svm text categor result corpu present section conclud remark section repres machin learn approach text categor approach earliest approach attempt constru system automat rule induct techniqu avoid labori construct rule base dimens reduct order reduc search space main advantag approach result rule readili interpret human neighbor classifi variant classifi shown good perform text categor categor larg amount comput power requir calcul similar train document linear model number linear model base linear linear discrimin logist iter learn algorithm rocchio algorithm tradit inform retriev full set term gener comput problem slow converg larg result linear model prone dimens reduct requir neural network boundari text categor problem nonlinear classifi artifici neural network produc result linear model allevi problem high larg network wiener al weight elimin earli stop addit dimens reduct result suggest nonlinear neural network yield substanti gain linear model probabilist model wide text categor experi exampl includ naiv classifi hierarch bayesian classifi commonli assumpt word train set probabilist independ dimens reduct obviou classifi model complex control occur except nn work static dynam environ requir frequent addit document incorpor document exist train system difficult support vector machin continu improv dimens reduct approach text categor integr dimens reduct classif support vector machin machin learn techniqu line svm classif problem train set input output label svm perform map oe input space space case data linearli separ exist vector scalar element train set svm construct hyperplan separ posit neg exampl maxim note hyperplan correspond nonlinear surfac shown hyperplan found minim kwk result solut written linear combin ff ff vector ff ff found solv quadrat program maxim respect constraint yn symmetr matrix element ij obtain ij find kernel ij comput kernel polynomi classifi notic posit local optima train exampl margin ff greater exampl call support vector figur separ data pattern class repres ffi extract support vector shown bold test vector comput ff classif pattern recognit svm successfulli appli problem regress estim time seri predict threshold class label assign label ae train set separ svm algorithm minim kwk time separ set minimum number error minim kwk satisfi paramet balanc contribut term minim transform qp maxim constraint unlik machin learn svm depend explicitli problem svm achiev superior perform number fairli data set outperform radial basi network recogn postal servic handwritten digit bitmap result report face detect input svm text categor success svm li automat capac tune minim extract small number support vector train data relev frame comput problem qp problem local optima motiv superior perform data set mention appli svm text problem high document topic mutual text categor analyz seri dichotom classif document belong topic section discuss suitabl svm dynam environ section consid combin svm latent semant index improv section discuss possibl svm identifi document abil incorpor document formul number variabl qp problem equal number data point quadrat form complet make optim problem challeng data set memori requir grow squar size data set chunk aim reduc comput storag complex break qp problem smaller train corpu divid number support vector extract combin decomposit algorithm algorithm advantag global final solut obtain origin optim problem svm larg train chunk make svm suitabl dynam environ document easili incorpor exist set support vector origin decomposit algorithm properti global optim qualiti final solut good document process sharp contrast tradit machin learn method mention section except classifi classifi requir train phase document larg storag comput requir corpu larg svm store support vector oper test number support vector number train pattern combin latent semant index formul minim kwk shrink weight spuriou version featur select perfectli remov irrelev featur textual document problem synonymi wai refer concept natur languag synonymi problem address gener framework svm method allevi problem combin svm latent semant index analyz correl structur term document seek linearli transform set document vector space allevi problem synonymi textual document appli lsi set support run svm result lsi make data support vector lie margin boundari essenti featur shape defin import pattern view svm step extract subset document lsi similar idea local region improv qualiti result lsi compon compar perform lsi comput demand significantli reduc set support vector small fraction corpu compar approach disciplin size subset membership determin learn process svm work data support vector ly margin boundari applic lsi circumst investig document human error introduc manual process categor document train svm locat error theori constrain lagrangian multipli sensit object function constraint svm sensit atyp pattern close boundari pattern larg lagrangian multipli atyp robust solut potenti gener perform omit support vector larg lagrangian multipli simul setup collect set reuter newswir stori year stori manual index topic support document rout retriev reuter custom stori date april earlier set train stori april test set document drop topic posit train exampl perform inflect stop word lower elimin word fewer document document final code tradit tf idf frequenc document qp frequenc word document total number number document local dictionari topic singl word found document topic enter local dictionari unlik frequent occur word local dictionari featur select step number featur local dictionari averag svm order polynomi correspond hyperplan tf idf space train pattern process maximum size mention section regard svm process train corpu increment manner train svm proce assum data topic separ proce case set perform measur recal combin recal obtain svm alter threshold point recal equal point singl summar measur comparison result text categor problem analyz seri dichotom classif collect anonym ftp arrang access made david lewi recal percentag total document topic correctli classifi percentag predict document topic correctli classifi evalu perform entir set topic show support except lagrangian multipli equal attain properti enabl svm output compar categori easili combin resort ad hoc scheme proport assign result topic reuter data set turn linearli separ tf idf space separ list tabl suspect text categor data set linearli separ explain success popular linear techniqu text categor observ nonlinear classifi outperform linear classifi figur show curv refer basic svm refer svm combin lsi remov larg lagrangian multipli plot perform classifi set tabl show point classifi categor method collect report plain vanilla svm good fact featur select perform experi ad refin section section boost perform prior featur attain compar perform method report gener classifi suscept situat irrelev attribut present explain inferior perform compar svm figur curv refer main text label figur show distribut number support vector perform lsi perform tabl topic ad recal comput perform measur comput separ result perform valu graph includ statist categori acq support vector small fraction size train corpu lead comput save compar perform lsi corpu figur histogram show distribut number support vector illustr svm detect document examin topic document exceedingli larg lagrangian multipli document topic label crude document label ga fuel figur content document basic miss label document mistak eia ga stock week march distil fuel stock held primari storag fell week end march energi inform administr weekli statu depart energi agenc gasolin stock week crude oil stock fell eia residu fuel stock fell crude oil stock strateg reserv rose total refin product stock fell figur reuter document eia ga stock week march distil fuel stock held primari storag fell week end feb energi inform administr weekli statu depart energi agenc gasolin stock week crude oil stock eia residu fuel stock fell crude oil stock strateg reserv total refin product stock unchang figur reuter document integr dimens reduct classif svm number advantag applic text categor unlik machin learn techniqu easili incorpor small compar size train perform lsi categori tabl list topic separ tf idf space bypass corn crude dlr ga grain interest loan ship soybean sugar trade wheat yen tabl point categor method report point proport assign proport assign proport threshold proport threshold document dimens intens larg train corpu result loss longer imper svm adapt effici dynam environ requir frequent addit document collect text categor problem formul seri dichotom classif svm output problem compar categori comput qp code reliabl effici nonlinear optim code requir neural network svm problem text inform retriev larg experi serv start svm domain svm preclud dimens possibl result obtain improv text categor experi document organ document set hierarch structur util addit structur inform newswir give emphasi word occur headlin refer apt damerau autom learn rule text categor acm inform juli burg simplifi support vector rule intern confer machin cort vapnik network machin st gw tk harshman index latent semant analysi journal american societi inform septemb vapnik discov inform pattern data clean um gp advanc knowledg discoveri data page pj pm ib lm schmandt shell text categor sixth confer artifici intellig joachim probabilist analysi rocchio algorithm tfidf text categor technic report carnegi mellon koller sahami hierarch classifi document word intern confer machin juli dd lewi evalu phrasal cluster text categor task sigir page june dd jp papka train algorithm linear text classifi annual intern page august girosi train support vector applic face detect comput vision pattern puerto june vapnik compar support vector machin gaussian kernel radial basi function classifi ai memo decemb vapnik natur statist learn theori springer jo weigend neural network approach topic spot fourth annual symposium document analysi inform page la april yang expert effect effici learn human text categor retriev annual intern page juli yang evalu statist approach text categor carnegi mellon
DB/982 3 visual queri languag vincent bing xu cheng paul depart comput scienc alberta canada abstract multimedia data varieti user rang naiv sophist make queri visual queri languag languag low express power queri processor effort made design queri languag proper semant facilit queri optim process exist system major multimedia system built top object system underli queri facil inherit system built top commerci oodbm chosen extend standard queri languag oql multimedia function result languag call paper present visual queri languag implement imag compon introduct paper present visual queri distribut imag manag system develop alberta topic investig includ develop dbm kernel flexibl classif support spatial queri imag content mean salient enabl reason spatial relationship queri develop queri languag primit queri imag provis scalabl open access imag repositori prototyp implement top objectstor system base textual queri languag multimedia oql extend standard object queri languag oql ad research support strateg grant natur scienc engin research council canada current ibm toronto present properti imag video data queri structur document implement imag part project queri translat make parser queri processor complex structur semant multimedia data make access classic queri languag media inher make provid visual queri capabl approach user request visual repres visual icon graphic languag graphic languag refer visual languag base semant model make repres object relationship defin icon languag queri express select combin icon produc express power visual queri languag low direct naiv user base textual queri languag capabl visual languag enhanc base power multimedia queri extens object queri languag visual queri languag enabl easi queri multimedia benefit queri facil provid manag system approach chosen present visual languag imag compon demo system descript demo provid remaind paper organ section overview section present section explain semant visual section discuss implement queri section discuss relat work system overview section overview queri languag imag annot process detail model found fulli defin model model main imag block salient object block defin block group semant relat entiti imag block made imag layer imag layer distinguish imag maintain independ imag user defin imag type classif categor imag view content imag set salient object interest entiti spatial relationship salient object block design handl salient object organ salient object defin user identifi imag mean annot process definit salient object lead type lattic distinguish kind salient physic logic logic salient object abstract salient object relev physic salient object syntact object imag semant logic salient object figur show exampl salient object imag class hierarchi athlet head torso limb politician person imag misc salient object hierarchi imag hierarchi imag catalog figur imag logic salient object hierarchi model address imag spatial independ imag applic distinguish exist ident logic salient object imag salient imag annot salient object spatial relationship assum detect object tackl issu project face detect reason choic drive applic imag pictur person imag process softwar detect face mark minimum bound rectangl spatial color textur valu assign logic salient object face imag descript properti date provid assum inform level salient object provid multimedia extens oql oql queri function return object type infer oper contribut queri express oql applic queri object support nativ program languag basic statement oql select project attribut queri queri identifi partit sort criterion sort extens introduc oql form predic spatial tempor similar express spatial express spatial extens includ spatial spatial spatial predic tempor express deal tempor predic video predic defin predic media object media object repres instanc medium imag video object media object deem interest applic car predic check salient object media object check media object similar respect metric model implement imag facil queri imag peopl imag build imag express select imag anim build person person imag person west imag build point visual queri interfac user clear idea kind imag interest express queri straightforward easier express translat implement imag part user queri imag semant imag semant base model view imag salient object properti user queri salient object imag queri refin defin attribut valu salient object user spatial relationship salient object includ topolog direct user properti imag data member defin imag photograph date ffl declar visual queri languag step step construct close peopl natur languag ffl defin semant base object calculu featur conduct theoret studi involv concept express power scope paper ffl combin queri imag semant salient compar attribut user start queri semant approach imag queri queri defin featur implement system model rich combin gener imag includ color salient object spatial relationship lead definit global imag similar function user similar global imag color salient salient object semant syntact featur refin similar measur work defin flexibl index handl similar measur make featur queri interfac window consist number compon design queri user specifi queri imag class queri salient object imag level refin depend type queri level user result queri startup window consist ffl select imag class imag store categor class system user select subset search root imag class set default ffl salient object class browser user object salient object attribut valu identifi popul organ salient object hierarchi root salient object class set default ffl horizont slider maximum number imag return result queri qualiti servic paramet queri result present interfac ffl horizont slider similar threshold queri imag target imag store color comparison qualiti servic paramet present interfac ffl work canva user construct queri step step ffl queri canva user construct compound queri base simpl queri defin work canva oper work canva work canva user construct modifi queri block user select imag select salient object class class browser insert select salient object canva press button object rectangl work canva rectangl determin spatial relationship object resiz move user defin attribut valu object canva dialog box shown figur user compar textual attribut default comparison predic chang variabl refer object translat shown object express join oper imag person express insert salient object type person work canva assum refer user edit salient object type attribut queri involv imag global properti photograph time imag global color textur dialog box obtain click button properti provid user enter inform figur dialog box edit object attribut topolog relationship ad automat intersect object direct relationship defin explicitli dialog box user specifi ax matter centroid rectangl repres salient object calcul direct relationship ax express complex spatial relationship user specifi axi spatial relationship west term refer queri block obtain work canva click valid user end specif move queri canva combin form final queri queri canva queri canva space user construct compound queri repres squar box queri canva queri compound queri construct combin smaller compound queri oper queri canva modifi stage edit button move work canva user press queri button submit queri translat visual system check queri canva make dangl queri link oper translat queri displai result string submit queri processor queri express queri imag peopl imag build imag queri combin peopl build final express queri figur express express imag west work canva figur express imag build express express imag build express imag peopl express express imag anim final express obtain combin connect express translat submit queri processor figur queri queri semant translat semant base object calculu work canva repres empti insert salient object work user express kind salient object queri result user attach addit condit salient spatial relationship salient object queri work canva level view queri canva view imag salient object class complex relat figur queri translat queri canva formula free variabl gener framework formula imag salient object express boolean condit salient object express condit imag imag class default imag class root imag class chang formula free evalu true queri canva combin boolean oper turn queri oe valid subqueri insur dangl case type oper queri canva safeti problem common calculu languag case queri rang queri give result depend appli specif user control problem solv quantifi free variabl variabl free variabl rang imag class salient object variabl rang salient object class simpl queri variabl imag class turn queri fi oe mg free variabl rang restrict oe neg fi oe mg make express imag class problem case imag set simpl rule insur safeti queri appli imag class root imag class set oe atom free variabl restrict imag class oe fi oe mg user express queri context rang exist imag class queri formula imag variabl rang imag combin result object type problemat determin imag class queri express understood independ semant common ancestor imag class imag type class imag imag class type imag type system common ancestor imag root class worst case check consist queri assum imag variabl rang oe variabl rang combin result queri algebra imag ffl oe case queri make ancestor type system hierarchi error detect ffl oe type queri result set common ancestor queri understood result set object final queri transform normal form child negat existenti quantifi formula normal formula obtain ffl variabl imag variabl rang distinct imag class ffl push replac oe oe queri peopl logic express build imag normal facilit neg existenti quantifi formula express set differ translat nest queri queri process objectstor queri facil declar queri languag fulli implement parser queri processor queri detail parser queri processor found result parser intern queri tree structur transform execut plan parser queri follow structur tradit design parser make basic rule defin sql parser rule defin top basic rule deal object introduc object parser check semant syntax extern form charact string string convert queri tree queri object store inform queri string main compon select object store inform select object store inform object store inform similar threshold number imag requir queri store queri object figur queri object select imag similar similar global similar imag requir queri engin prototyp queri queri tree directli gener unoptim execut plan figur show queri execut tree figur queri node condit intersect union perform result condit queri tree queri engin initi execut node leav queri execut tree figur repres class extent object extent satisfi condit case entir extent condit obj node obj condit obj global queri obj imag obj obj select obj node obj similar condit obj similar figur queri object textur similar select extent project select color similar project extent intersect imag project intersect project extent figur execut tree result condit set execut object color similar filter extent result condit logic connect node condit execut intersect oper branch result set satisfi condit imag return queri result relat work focu visual queri languag coupl intern queri languag type visual languag abstract set oper mechan express oper defin intern languag prototyp approach visual languag direct multimedia applic visual languag separ extern model queri intern queri languag visual queri languag base entityrelationship extern level sql intern queri express select path relationship condit express attribut valu delaunai mm framework queri multimedia data store distribut data repositori includ web delaunai mm queri interfac format user enter object queri queri translat syntax accept destin imag integr approach visual approach queri pose imag object layout visual queri interfac frame express queri imag man man user introduc object describ attach tor object descriptor spatial relationship draw line label man object car object queri gener shown separ window user specifi queri main differ user awar schema reason user assign valu attribut integr facilit charg queri reformul facilit consult terminolog dictionari replac queri user start queri schema find object interest kind imag implement point translat work translat user queri present visual queri languag implement imag featur queri processor implement demo system declar visual queri languag step step construct close peopl natur base defin semant object calculu featur basi theoret studi languag combin queri imag semant salient compar attribut user start queri semant approach imag queri complet approach implement similar function textur provid imag semant model combin gener imag properti includ color salient object spatial relationship lead definit global imag similar function implement similar match index structur trivial multimedia queri implement imag compon work progress extend queri interfac idea provid interfac type applic interfac interact achiev express power refer vianu foundat addison graphic queri languag ieee transact softwar visual queri taxonomi knuth visual page elsevi scienc publish editor object odmg morgan san cheng imag type system queri similar match msc depart comput cruz luca visual approach multimedia queri present acm intern confer page novemb del icon environ imag queri ieee transact softwar octob jr levin brown unix program lex yacc oreilli objectstor system commun multimedia object queri languag intern multimedia inform page septemb hara imag retriev system visual queri languag acm sigmod intern confer manag page model imag approach intern confer visual inform page san decemb defin view imag system ifip work confer semant issu multimedia page januari ozsu visual queri languag imag ifip work confer visual system page xu visual queri facil imag msc depart comput
IR/983 5 public knowledg inform system concept hierarchi base text categor meng wang sun clement yu depart comput scienc suni ny depart comput scienc illinoi il abstract document categor techniqu improv retriev document extens investig import issu metasearch engin select text document queri categor potenti ectiv techniqu good internet environ short queri submit evalu categor algorithm studi document categor algorithm adopt algorithm special characterist ectiv preliminari result provid compar categor algorithm prototyp categor system base algorithm develop concept select introduct internet vast inform sourc recent year ordinari user desir data search engin creat search engin de ne set document search search engin index document creat store search engin speed process user queri repres content word receiv xxx xxx accept xxx meng al combin content index identifi document term quickli search engin attempt provid search capabl document search engin web search engin focu document con ned domain document organ speci subject area ten thousand search engin exist internet inform user frequent store multipl search engin case user research paper subject area desir paper scatter number publish inconveni ineci user determin search individu identifi document solut problem implement metasearch engin top local search engin metasearch engin system provid uni ed access multipl exist search engin maintain index document sophist metasearch engin store characterist inform content underli search engin order provid servic metasearch engin receiv user rst pass queri local search collect result local search engin metasearch user task drastic simpli ed substanti bodi research work address di erent aspect build ectiv ecient metasearch engin accumul recent year main challeng problem select user local search engin document callan gravano kahl liu manber meng selberg yu yuwono object perform select improv ecienc enabl metasearch engin send queri potenti search reduc network trac cost search useless exist select method rank queri base qualiti measur measur base similar queri document similar comput base match term queri document measur ggloss determin qualiti respect queri sum similar queri highli similar document similar greater equal threshold develop scheme rank optim nding similar document multipl respect queri integ rank base estim similar similar document result averag similar document retriev method studi inform retriev queri larg number strong correl highli similar document relev document provid similar function term weight cosin function weight concept hierarchi base text categor formula queri correl weak reason long term queri provid context disambigu mean di erent term short mean term identi ed correctli queri submit user internet environ short averag number term typic internet queri similar document short queri user submit queri match term di erent mean gener retriev ectiv search engin improv techniqu develop remedi problem rst techniqu queri base method idea add term queri process train similar coverag subject matter term set actual util receiv train term extract ad queri retriev document actual place internet environ data highli unclear train collect fact construct collect storag penalti high order accommod heterogen techniqu linkag inform document determin rank incorpor rank retriev process link document determin popular author web page page weight sum document similar document rank determin relev document idea document similar queri highest rank base method extend rank relev relev document techniqu associ concept queri map number concept map concept search concept provid context term mean term accur determin manual assign concept user submit user speci es relat concept train queri assign method scale larg number due manual train natur method assign method cluster local requir document physic regroup cluster method requir local system logic cluster document assign topic cluster approach practic internet environ substanti cooper requir autonom local system method paper base exist requir document cluster studi method assign concept paper contribut meng al concept hierarchi util categor method manber assign space concept assign concept hierarch organ report categor document concept hierarchi improv retriev perform yang awar exist work categor util concept hierarchi method assign concept extend method document applic categor method assign concept fulli automat experi carri compar method complex method singular decomposit base method result fulli automat method perform outperform method base categor prototyp system develop automat categor search engin rest paper organ section describ concept hierarchi research section describ method categor base concept hierarchi section report result section describ prototyp search engin categor system conclud paper section concept hierarchi concept hierarchi larg number concept organ multipl level concept higher level broad mean lower level child concept speci mean parent concept concept assign di erent search engin concept hierarchi search engin good document relat search engin assign concept assign multipl concept di erent method assign concept concept hierarchi discuss section concept hierarchi search engin metasearch engin environ user document user rst concept hierarchi start root process yahoo categori hierarchi user identi es set concept match user submit queri metasearch engin metasearch engin select search step rst preliminari select perform base ed concept speci concept identi ed concept multipl concept identi option common identi ed concept identi ed concept select rst option produc produc option produc concept hierarchi base text categor select method yu yu select queri return rst step select approach relev document queri select step exact perform gain approach normal studi futur research report paper discuss concept hierarchi construct hierarchi featur ect breadth topic concept hierarchi support search document web concept properli relationship di erent concept construct concept hierarchi decid util categori hierarchi organ yahoo categori hierarchi categori hierarchi yahoo level concept lower level speci categor decid rst level yahoo categori hierarchi simpl program written automat fetch rst level yahoo categori hierarchi manual adjust concept hierarchi made improv qualiti hierarchi applic yahoo level categori includ topic consid prune advantag yahoo categori hierarchi internet user familiar order assign concept gener text descript concept repres concept descript concept descript sucient convei mean concept concept longer descript desir manual provid descript concept qualiti descript decid util inform yahoo categori hierarchi automat gener descript concept concept hierarchi approach sketch concept number child concept child concept cover di erent aspect parent concept base set term child concept concept descript concept stop word remov stem appli descript note order gener descript level concept child concept concept yahoo categori hierarchi mean concept hierarchi hierarchi descript gener top level yahoo categori hierarchi categor algorithm present method assign concept concept hierarchi assign assign parent concept meng al child concept parent concept assign parent concept child concept parent concept broader child concept high similar centroid local search engin set document document repres vector term dn weight term number distinct term comput wide tf idf formula tf repres term frequenc weight term idf repres document frequenc weight term vector document denot comput centroid vector wn obtain rst ad weight document divid sum number document section discuss repres concept descript note descript essenti document set descript concept level treat document collect descript repres vector term weight comput tf idf formula base descript collect similar concept descript centroid comput cosin similar basic product vector divid product norm vector rst strategi assign concept concept hierarchi base similar concept comput similar concept level concept hierarchi sort concept descend similar valu assign concept largest similar strategi retriev model standard inform user retriev document document similar queri retriev slight complic categor problem recal assign concept concept assign ancestor mean assign concept concept concept ancestor concept child concept share impli assign concept insist assign modi ed strategi find largest similar rst concept largest similar number concept assign number concept set ancestor assign assign ancestor concept hierarchi base text categor stop repeat process stop condit sati ed relat question determin number practic manual assign small number concept comput averag number concept assign averag number assign variat strategi assign similar threshold number assign concept similar concept greater equal variat advantag avoid assign concept low similar determin easi practic appli method categor search engin practic easi diculti due fact method requir comput centroid accur centroid obtain document access dicult identifi access document search engin solut sampl document search engin sampl document comput approxim centroid singular decomposit singular decomposit ectiv method document categor appli method categor rst review method assign set document set note document assign number concept matrix repres set input document matrix repres assign input document mk row matrix document ij denot weight term ith ith row repres assign ith document concept set ij denot extent ith document assign jth ij binari ij ith document assign jth concept ij ith document assign jth concept ij valu matrix obtain assign document concept set result question answer document meng al assign concept set base knowledg matric answer obtain solut linear squar fit problem discuss svd obtain solut problem map matrix minim sum residu squar fa matric ith row error assign vector vector kf ij matrix norm matrix problem solut convent method solv problem singular decomposit van solut matrix matric obtain svd left singular nonzero singular valu satisfi matrix call associ matrix element ij repres jth term relat ith process assign document vector format categori summar transform vector categori appli cosin function comput similar categori vector vector categori nonzero element categori categori space assign categori highest similar integ section discuss document categor algorithm appli categor repres document centroid section centroid matrix mention creat row correspond centroid column correspond term matrix creat base manual assign number set concept concept hierarchi matric associ matrix found svd assign rst comput centroid transform vector process assign concept assign transform document perform method sensit select train data vocabulari train data cover vocabulari document method perform concept hierarchi base text categor perform su er carri high qualiti train dicult practic select good train data requir trainer good idea real data train timeconsum task appli svd method categor su er problem method due centroid high averag similar retriev document treat concept descript queri queri repres vector term weight queri vector vector descript section strategi work calcul similar concept pair concept queri accomplish submit search engin retriev document largest similar integ calcul similar document calcul averag similar averag similar treat similar queri sort concept similar concept assign top concept integ section carri experi determin paramet section strategi featur easi appli practic strategi requir access document submit concept queri analyz small number return document method requir cooper local search engin uniqu categor strategi applic categor document experi report preliminari result test data document experi snapshot newsgroup randomli chosen list download web page collect fetch web site number document meng al homepag tabl document experi vari tabl inform test discuss section creat concept hierarchi base rst level yahoo categori hierarchi rst level concept level concept manual assign relat concept concept hierarchi result manual assign serv baselin ideal evalu di erent categor method ideal method achiev perform manual assign assign close concept column tabl number concept manual assign concept hierarchi base text categor perform measur categor method ratio number correctli assign concept number correct concept correct concept assign concept assign categor method assign concept recal method assign averag recal categor method test call recal method ratio number correctli assign concept number assign concept assign concept categor method concept assign correctli method assign averag categor method test call method recal measur perform ectiv categor method method achiev perform recal method assign set correct perform method perfect perfect perform achiev practic recal experi result compar categor strategi discuss section decid carri experi draw averag curv strategi averag recal point obtain curv drawn base point order achiev desir proper paramet chosen lead lower recal larger lead higher strategi experi carri directli paramet involv strategi addit paramet paramet involv test di erent valu observ good perform strategi obtain experi draw averag curv strategi test singular decomposit train set matric obtain select train build matric remain test evalu perform svd strategi matrix centroid train distinct term train manual assign concept concept hierarchi matrix matrix concept level concept hierarchi train assign entri entri meng al train set id id tabl train set test svd method mention section perform svd method sensit complet train set train build matric includ test assign concept test result base train chosen term remain test order inaccuraci experi base choic singl set train di erent set chosen experi train set list tabl list train train remain test note cross valid wide techniqu test perform test data partit subset integ test carri data subset train data remain subset valid averag perform test nal perform method valid techniqu consid modi ed cross valid train set requir term test set svd averag recal base train set averag curv categor strategi shown figur method consist substanti high recal svd method perform method recal small opposit true recal larg perform method measur averag comput averag valu method recal point averag method method method svd base averag method method svd method recal method svd method perfect recal averag method method mean averag method perform method svd recal concept hierarchi base text categor fig curv method implement prototyp system section describ prototyp categor system object develop practic system categor search engin url search engin provid algorithm chosen prototyp system due good categor perform easi implement order categor search engin program develop automat connect search engin pass queri achiev analyz sourc html le search engin page sourc http request method support search engin identi ed method attribut form cgi gatewai program search engin server identi ed action attribut form queri identi ed attribut input tag method send simpl request server queri term paramet question mark post method permit substanti amount data pass server data pass server entiti bodi request post wide search engin commerci search engin list site test support method support post method cgi program request program ed request queri search engin server identifi queri term request piec inform http request cgi program queri write code easi test connect program commerci search engin success rate achiev program develop identifi url retriev document result page search engin respect queri url download retriev document similar queri comput note commerci search result page url page unrel page addit url retriev document queri meng al program separ desir url unwant url program work result page search engin develop high qualiti ltere program discuss ltere algorithm program paper algorithm directli relat categor concept hierarchi prototyp system open directori obtain number search engin site includ googl site yahoo hierarchi main reason choic open directori hierarchi wide qualiti yahoo hierarchi rst level open hierarchi concept rst level concept level categor algorithm modi ed slightli prototyp system main chang algorithm longer automat assign parent concept assign child concept assign propag scheme emploi determin assign parent concept scheme search engin submit system descript concept level concept hierarchi search engin queri averag similar top return document queri comput averag similar ed threshold search engin assign concept user provid valu default valu search engin concept rst percentag child concept assign comput percentag exce ed percentag threshold assign assign user provid default assign averag similar child concept comput similar search engin assign higher percentag concept rst level concept search engin consid assign dummi root hierarchi declar search engin result present valu determin base experi prototyp system discuss summar categor algorithm denot descript concept concept denot set concept rst level algorithm url search concept top rank document comput avg similar threshold assign concept threshold assign concept root begin concept submit fetch top return comput averag similar avg sim document sim concept hierarchi base text categor fig averag similar distribut base level concept googl assign concept count number child concept assign comput averag similar child concept count number concept assign search concept assign print averag concept assign parent print averag figur show distribut averag similar googl search engin respect concept level figur list concept number level averag similar di erent concept descript concept submit queri googl search decent result return figur show averag similar distribut search engin assign propag concept rst level easi similar distribut uniform concept googl search engin recogn search engin categor system meng al fig averag similar distribut base level concept googl fig averag similar distribut base level concept figur show distribut averag similar center search engin respect concept level similar distribut uneven retriev good result small number concept return poor result concept figur show averag similar distribut search engin assign propag concept rst level clear figur search engin special search engin cover primarili area health refer categor select algorithm metasearch engin relev search user queri lead higher retriev ectiv metasearch engin studi categor algorithm studi method consid adopt document categor techniqu categor problem concept hierarchi base text categor fig averag similar distribut base level concept method applic categor problem simpl easi appli statist inform document train svd base perform method studi simpl categor algorithm account special characterist outperform sophist algorithm adopt document categor base categor prototyp system implement preliminari test base real web search engin system produc good result plan carri research futur plan expand testb includ enabl carri addit experi obtain accur result plan improv algorithm develop categor algorithm addit inform number document retriev search engin queri categor studi incorpor inform algorithm algorithm present section number paramet determin valu paramet improv ecienc algorithm hour categor singl search engin queri submit process interest issu investig determin number level concept hierarchi level concept hierarchi level extrem lead ectiv retriev acknowledg anonym review valuabl comment suggest work support part nsf meng al refer baumgarten probabilist model distribut inform retriev acm sigir juli pp callan lu croft search distribut collect infer network acm sigir pp experi select search engin metasearch acm juli fan gauch adapt agent inform gather distribut inform sourc aaai symposium intellig agent stanford march pp furna deerwest dumai al inform retriev singular decomposit model latent semant structur acm sigir june pp golub van loan matrix comput john hopkin gravano gener gloss broker hierarchi intern confer larg data septemb pp jansen spink bateman saracev real life inform studi user queri web acm sigir kahl inform system corpor wide area inform server technic report machin april kirsch futur internet infoseek experi search internet acm sigir kleinberg authorit sourc hyperlink environ symposium discret san januari pp koster index web comput network isdn hanson solv squar problem liu yu meng al statist method estim text ieee transact knowledg data engin manber search broker usenix symposium internet technolog pp meng liu yu al determin text search internet intern confer larg data york august pp meng liu yu al estim search engin ieee intern confer data march pp page brin motwani winograd pagerank citat bring order web technic stanford salton mcgill introduct modern inform retriev selberg etzioni metacrawl architectur resourc aggreg web ieee wang zhou sc build hierarch classi er class proxim larg data base septemb pp xu callan ectiv retriev distribut collect acm sigir pp xu croft languag model distribut retriev acm sigir august pp yang chute map method text categor retriev acm transact inform juli yu liu wu al find similar document multipl text ieee confer advanc digit pp yu liu meng al methodolog retriev text document multipl ieee transact knowledg data engin concept hierarchi base text categor yu meng liu al ecient ectiv metasearch text incorpor linkag document acm sigmod santa yuwono lee server rank distribut text resourc system internet fth intern confer system advanc april author biographi meng receiv bs mathemat peopl republ ms phd comput scienc illinoi chicago associ professor depart comput scienc state york binghamton research interest includ inform queri process optim book queri process advanc publish paper journal intern confer serv program chair program member intern confer wang receiv ms bs electr engin receiv ms comput scienc state york binghamton januari work programm analyst sb intern york particip system design develop sun receiv bs beij china receiv ms comput scienc state york binghamton work softwar engin open channel boston base compani interest java program system meng al clement yu professor depart comput scienc illinoi chicago obtain bs appli mathemat columbia phd comput scienc cornel area interest includ search engin multimedia retriev public journal ieee acm tod jacm confer acm acm sigir acm multimedia serv chairman acm sigir member advisori nation scienc foundat member editori board ieee intern journal softwar engin knowledg engin distribut parallel nation scienc foundat inform data manag program workshop princip investig year intern confer inform societi emerg technolog challeng held japan correspond print request depart comput state york ny usa
HCI/984 4 analysi awar presenc affect written peter ljungstrand plai research interact institut box sweden abstract present preliminari result studi awar presenc affect instant messag comput lab easili access web base awar visual larg comput student virtual locat commun instant messag system messag consciou act tick box cross sender locat sender statu messag content made result show awar physic presenc virtual presenc affect factor affect text differ student messag system support collabor work coordin social behavior keyword instant awar web social coordin introduct web base awar tool develop visual peopl locat larg comput lab access web page enhanc explicitli convei place inform real world user good overview student find find unoccupi comput lab fig messag normal email shortcut default email program system function short messag instantli pop topmost recipi comput screen visual comput system awar log support emerg collabor coordin distribut primarili lab build peopl situat student internet access home send instant messag peopl locat web page commerci instant messag system icq aol instant messeng gain high popular gener user recent phenomenon recent attract research deploi af depart göteborg box sweden figur screenshot menu activ shade box symbol room spatial organ show screen tional design specif support educ se tradit research field cscl collabor similar area investig cmc tool support instanc distanc educ research specif instant messag partli chaotic natur system cmc system cscl gener support learn situat teacher control student teacher fit awar support activ map research relat awar gain attent cscw hci commun system support awar involv overhead order specif hardwar softwar login explicitli state current system built visual dynam electron commun base log file system tend support synchron activ system present lightweight servic reli readili server statu refin visual easili access individu workstat web browser explicit action normal log procedur window student make onlin statu extens unix command graphic interfac displai locat messag command sourc inform script server system design support awar presenc real time displai overlaid locat inform peopl system deploi larg corpor offic set system base activ badg support infrastructur beacon spread environ run custom schemat map offic inform lightweight simplist locat easier deploi thread chat applic support multithread chat real design make easier user follow transient natur chat instant messag system coupl specif locat locat awar support churchil bly present studi virtual environ support commun conclud commun offer high rich fact lack visual auditori cue import collabor suggest simpl instant messag tool express commun major differ awar system primarili secondari student person workstat share typic sit physic locat lab time time case system design support awar presenc typic matter system intend support colloc offic distribut peopl geograph locat person system gener place room system person instal environ peopl offic tend low number case find student log virtual larg place workstat student engag interact import find person situat locat workstat lab place student log student coordin action work social interact comput lab consist number approxim comput workstat room ground level build locat higher level student comput lab tend busi time student work comput locat lab easili locat visual comput commun comput base fast network make transmiss time fraction visual comput lab support sender awar recipi present workstat receiv messag instantli aim studi aim paper attempt find awar presenc affect written messag facilit log instant messag commun true ident replac identif code made awar actual presenc visual web affect topic messag instant messag tool electron user level influenc messag messag log compar linguist email chat email messag system visual confirm presenc chat tool particip particip person knowledg chat particip share mutual context comput normal case commun predict tool student coordin work group assign coordin social activ awar receiv read messag time sender transmit affect topic messag predict awar presenc affect text messag visual physic presenc recipi lab room sender messag compar messag student lab physic awar talk directli lab room tool locat presenc awar access connect awar question student instant messag servic awar presenc affect content sender send messag anonym log show ident code person anonym receiv messag anonym messag identifi content system displai system user log moment inform map schemat view lab room displai web arrang map build student find whereabout friend find unoccupi physic search room floor build addit provid good overview screen menu access user homepag entri onlin photo catalog mention access messag standard email default email short messag instantli pop recipi screen instant sender option anonym recipi manual tick box send messag student share workstat onlin novemb publicli student extens instant messag typic coordin arrang physic meet break smoke short question answer detail solv program contrast student conceiv privaci year singl student complain fact onlin presenc locat web due fact option block annoi incom messag system base server data part system onlin photo unavail network domain commun commun todai commun network comput kind cmc set stage differ type commun user commun receiv messag onlin order commun commun synchron requir user log time studi shown topic medium commun plai part messag formul factor relat sender recipi ground closur action share whichev medium select commun impact potenti form manifest access send messag rel anonym influenc electron commun formul studi shown email inform term composit close form du studi featur messag mail list suggest spoken characterist written medium result constraint comput medium machin architectur comput medium permit cmc messag displai linguist characterist typic spoken languag form written languag addit linguist featur specif medium du bartel argu expect written languag articul nonstandard express speech expect expect grammat sudden topic shift spontan write cmc exhibit type grammat construct spoken languag partli result subject email messag frequent omit typic speaker email messag displai inform regist person unknown argu cmc written mark featur typic interact studi shown faster spoken languag written messag messag anonym recipi window similar system error messag analysi messag kind messag sender send data collect gather type log year frequenc overview frequenc instant messag usag network extract number messag instant messag servic messag anonym collect origin sender log essenti text messag quantit automat measur collect messag analyz automat order sort number messag word frequenc appli element sender locat lab home sender statu text search occurr order featur compar cmc corpora qualit manual messag topic carri categori sender locat categori sender statu order make closer analysi set messag extract categori result messag total number log messag period septemb decemb fig overview distribut messag categori messag categor topic main content categori topic task social coordin meta number categori task relat finish task click till sampl greet sampl meta comment test messag sampl sampl sexual sampl social coordin invit parti sampl activ request sampl system imit system comput sampl sampl encourag work sampl locat comput lab comput mine free sampl awar comment sampl sampl sampl extract messag success made order follow clue content interpret coordin social activ lunch coordin coordin social interact commun term feedback signal speaker listen monitor involv give inform vital comment facial express give receiv inform attitud comparison cmc email chat comparison log swedish email corpu swedish chat studi respect occurr show set dissimilar symbol frequenc order occur st place chat materi email corpu occur devic enhanc written mode convei tradit written languag dai featur cmc instant commun spontan number featur common spoken regist studi present paper preliminari research gain number messag task greet meta comment sexual social coordin activ request understand awar presenc affect written messag result diagram fig show cross categori messag sender locat sender statu largest number messag set sender statu locat total number lab room student instant messag servic touch social organ coordin group assign coordin messag lab student physic modem student contact perceiv log comput friend famili knew person log system imit encourag anonym anonym distribut anonym distant locat awar comment figur messag anonym sender high proport messag lab sender physic evid presenc physic awar presenc messag call lab room sender messag physic awar receiv messag set virtual awar presenc categori form call messag lab room total number total number messag comput lab form categori group call set messag inspect view comput lab web browser sender physic evid inform presenc virtual visual tool topic set number messag messag lab room relat social coordin lunch group messag assign coordin content messag room tend natur categori set task relat identifi sender major messag identifi distribut minor identifi colloc commun task work opportun interact lab send textual faster easier talk anonym sender major messag anonym minor anonym colloc send type messag anonym strang cooper group matter exampl found identifi identifi identifi distant task greet meta sexual locat social coordin activ request system imit encourag home figur messag identifi sender topic messag set messag lab room social coordin lunch group messag assign coordin content greet identifi sender major messag ic minor id anonym sender major messag anonym colloc check minor anonym strang thing sender feedback action wit reaction written repli meta comment identifi sender major messag identifi distant minor identifi distribut messag concern messag system messag messag anonym sender messag major anonym distant minor anonym difficult repli anonym sender confirm system work coloc anonym distant identifi distant anonym distribut anonym contradictori send messag locat turn head identifi sender major messag identifi colloc minor identifi distribut anonym sender major anonym messag anonym minor anonym distant strang send messag locat number messag anonym higher identifi sender easier tempt coloc identifi figur distribut messag type distribut identifi sexual identifi sender categori type messag identifi sender concern sexual rude identifi colloc anonym sender kind messag easier send major locat comput anonym colloc minor anonym distribut categori social coordin identifi sender messag coordin lunch break invit parti major identifi locat comput lab minor unexpectedli identifi colloc set easier conveni conduct matter spoken interact anonym sender strang messag social coordin anonym difficult arrang messag major place comput anonym distant messag kind anonym colloc easier explain possibl check reaction explan peopl messag coordin social activ sender share background knowledg activ complet wast funni contact experi messag system activ request identifi sender equal messag identifi colloc identifi minor identifi distribut anonym sender messag function major place comput lab lab function depend context total number messag anonym confirm suggest system imit identifi sender identifi messag imit system found identifi colloc suggest sender wit reaction anonym sender messag imit system direct found anonym distant anonym distribut categori minor found anonym categori expect resembl real system messag person student ident identifi sender messag peopl shut work natur major lab room peopl work nearbi disturb equal lab room strang student experi receiv chatti messag annoi touch function work ey anonym sender reason mention major anonym messag kind found anonym distribut categori anonym lab locat encourag identifi sender encourag messag comput student work group receiv lab room anonym sender larger number encourag messag anonym major locat anonym distant lab room locat identifi sender great major messag peopl question unoccupi comput identifi sender lab room student coordin whereabout workstat close collabor mutual assign messag fewer locat anonym sender messag locat comput whereabout anonym type log id give clue real ident temporari id log lab physic awar fellow comput actual physic person log comput awar comment identifi sender messag state identifi sender anonym sender messag concern topic lab lab room suggest sender reaction inform receiv sender locat identifi sender messag person home mother stai fell categori identifi distant student check lab web browser home anonym sender type anonym identifi sender messag fall admittedli vagu categori match categori exampl har comment kind type messag hard interpret relev contextu knowledg major lab room identifi sender anonym sender messag anonym lab fewer lab room discuss factor influenc messag awar presenc contribut discuss awar www instant messag tool respect topic affect awar physic presenc awar virtual visual awar tool web easili access tool demand user requir special softwar comput demand static user locat preliminari result follow anticip confirm tool extens coordin social activ collabor mutual assign messag sampl task relat social coordin tool messag sampl sexual form largest categori sampl send messag anonym good avoid result confirm intuit contrari expect exampl anonym messag sign elimin idea anonym peopl explicitli make messag anonym tick sign total number anonym messag sign major distant anonym categori case guess sender make receiv lunch close back april messag iron imit messag depart sender long lunch break messag februari case messag strang instant messag system peopl commun mutual assign difficult collabor mutual person send messag anonym nu du det solv instant messag awar tool support collabor work coordin social activ behavior import mean work matter acknowledg student dept göteborg year dept göteborg appli skill quantit automat measur special sweden provid comput research conduct refer activ base approach gothenburg paper theoret linguist dept göteborg forthcom black approach pragmat disagr research languag social lawrenc erlbaum support work activ lightweight tool group acm press hh languag cambridg press art commun internet inform project anim affin activ electron acm multimedia acm press coordin share pp acm press featur comput mediat al social social persist design acm pp af studi swedish chat onlin journal media cultur af letter citi council factor influenc composit email human made dec af written electron chat dian write lawrenc erlbaum associ variant electron messag mediat social perspect pragmat seri john benjamin amsterdam advantag mechan spoken express factor differ spoken written percept motor skill support student awar coordin supplement denmark visual tool locat awar support inform interact huc berlin interact instant messag action acm press abstract presenc support mutual awar pp acm press tree thread chat acm press support social awar design experi acm pp al commun collabor educ set supplement acm pp
Agents/985 1 manifesto scienc agent system pietro nichola jen depart electron comput scienc southampton southampton uk abstract pose motiv scienc multiag system scienc theoret richer concept methodolog extens comput model applic social simul step set meet challeng theoret provid model system reflect fulli explic concept individu collect level mechan principl underpin model examin emphasi contribut provid contemporari theori introduct paper social system gener evolv time integr major perspect design perspect basi scienc mass articl faith simpl engin mass cope wide rang phenomena problem constantli chang supplement system theori broader concept social motiv fact written aim requir interact flexibl face problem bound ration make ration adapt learn deal inerti nonlinear exhibit form behaviour current theoret tool principl ma research inadequ defici backdrop provid broader tradit theori discuss learn research explor direct ma theori practic specul rang principl analyt tool pave scienc mass undertak critic major pillar ma notion ma tradit concern ma commun design comput artifici agent coordin order accomplish common goal obtain systemat understand form knowledg network virtual increasingli larg number human artifici agent larg busi firm econom activ undertaken differenti coordin task rare object research agenda attempt offer plausibl cure approach distinguish notion subsum ma form joint behaviour carri differenti coordin task constitu member ma system cognit joint process undertaken knowledg distinguish ma refer intern structur coordin constitu part refer ma reli intern structur undertak joint behaviour build set altern view ma extend tradit semant captur rich complex wide rang form social analysi suggest notion ma convei idea form formal inform plan involv artifici human cognit agent section build conceptu develop model ma mechan joint cognit behaviour predic term cognit behaviour individu level heart model argument agenthood cognit occur individu emerg phenomenon interact multipl agent social term joint mental attitud joint behaviour build transcend mental attitud behaviour cognit social interconnect individu agent mechan principl underpin model examin draw contribut lead scholar theori decad pursu object attempt made offer critic assess school integr synthet perspect design behaviour strengthen model ma appeal analyt tool provid theori integr order gain insight fundament mechan social exist time pursu canon issu relat environ guid principl show issu address show contribut brought articul unifi diverg view step concept environ mass relat pave set implic condit mass behav type cognit process form behaviour rest remaind paper section introduc model ma section model discuss common thread theori discuss focu determin social main mechan social time section major find indic futur research set futur research agenda main contribut paper li paper repres manifesto futur landscap ma research time vision realiti model ma scienc primarili aim find order complex natur partit object analysi discret explain establish boundari ludwig von note drew logic observ scienc primarili concern problem gener scienc expect scienc core idea underpin system theori inspir work main wai build attempt made scholar develop appli system view behaviour social scienc perspect repres reason mass draw recent advanc cybernet social conduct analysi point view model cognit entiti feedback capabl perform mainten adapt autonom structur figur illustr model structur dynam interplai main compon give overview model critic discuss carri section theoret background outlin model definit definit ma social cognit identifi function continu basi coordin cognit autonom agent discuss definit compon order follow altern strategi reconstruct genesi definit adher path ma shape engag cognit behaviour produc outcom remaind section articul determin social introduc individu agent model main compon structur contextu factor variabl concept agenthood extend individu collect level outcom examin determin model rest assumpt ma locat environ constrain impact gener function ma model motiv depend set social depend relat hold agent environ depend network inher intertwin reason environ avail bring wai agent depend depend network impact back environ affect wai agent cluster turn affect product resourc wai alloc agent impact wai agent depend ad environ depend network influenc gener function ma affect structur process structur ma refer endur pattern systemat relationship compon system system process refer dynam integr structur compon consist set cognit behaviour joint activ heart complex mechan relat system structur process li concept agenthood build role explain section strength depend ma environ differ case ma determinist case environ effect ma case give opportun discuss notion environ section cognit plai individu joint level individu agent agenthood exist interrel individu collect agenthood express term cognit behaviour start analysi individu level compon centr box figur show set individu agent member ma repres basic structur compon individu agent regard entiti capabl individu social behaviour autonom mean oper independ agent term cognit endow mental attitud repres world motiv action cognit agent deem intent stanc repres agent cognit agent similarli endow mental attitud motiv properti individu agenthood model agent cognit structur capabl perform cognit process mainstream cognit cognit structur set basic mental cognit principl modifi oper ad mental cognit control social interact principl mechan gener social behaviour kei role cognit structur plai mental state set basic mental includ build cognit agent engag varieti cognit theoret practic process primarili intend modifi discard mental attitud compon cognit gener cognit structur cognit process relat cognit compon undertak affect modifi compon ad endow cognit structur capabl undertak cognit agent model capabl individu social behaviour aim produc effect agent agent behaviour social regul agent cognit orient agent regard cognit agent behaviour regul cognit structur set cognit process agent individu social behaviour rest cognit control principl social behaviour affect agent mental attitud individu social behaviour indirectli influenc cognit process impact mental attitud principl ultim trigger control behaviour individu social behaviour impact back agent cognit cognit process interact agent acquir fulfil modifi provid input agent cognit process section contextu factor agent cognit social behaviour constrain impact interrel compon system set contextu factor variabl middl centr box figur includ main subset situat factor techniqu equip process requir transform input technolog set codifi knowledg techniqu undertak social activ simpli manag social interact system institut function pursu ma system economi wai outcom activ alloc natur social extern opportun social profil natur social relat member reciproc clariti number type set role natur articul commun social influenc pattern agent govern interdepend make wai conflict agent subgroup manag structur properti social structur number form cliqu set physic object resourc system contextu factor consist constrain constrain consist set agent member system technolog affect activ carri relat physic resourc logist turn affect number ident agent member system control affect social relat subgroup form determin structur properti social network repres link turn impact effect effici system undertak institut social extern gener pursu social impact back choic technolog ad causal chain opposit start set agent contextu relat element order variabl variabl refer wai social activ divid distinct task coordin achiev task system turn variabl fundament structur mechan mean complet agreement make term definit convei idea notion refer stabl pattern task alloc member system order carri joint activ refer wai distinct distribut member coordin accomplish social activ exampl mechan procedur control evalu behaviour procedur collabor reward system form social activ carri mechan lie root equilibrium stabil system integr mechan set social contextu factor social compon structur combin structur dynam integr structur compon system social activ equilibrium brought social integr mechan joint cognit behaviour social mechan kei element understand path lead individu level agenthood collect individu fundament compon collect level joint cognit joint behaviour cognit static dynam compon mental state member system combin joint mental state ensu includ vari joint motiv deontic mental mutual joint joint commit joint cognit process rest transcend complex interplai individu cognit process joint behaviour process build transcend agent individu social behaviour fundament question intern structur function collect agenthood extent joint mental state relat set joint regul evolut cognit behaviour joint process relat mechan govern answer question lead elucid core principl underpin concept agenthood principl strictli build explain term kei function plai individu agent cognit behaviour note joint mental state joint process impact mediat cognit behaviour order gain insight understand mediat role plai cognit behaviour joint process find cognit root system joint mental causal chain involv agent cognit cognit individu social behaviour joint cognit root joint mental state impact individu agent mental agent cognit process mutual form share lead agent undertak individu cognit process reason combin joint cognit process knowledg creation joint behaviour process build system joint mental state impact agent mental state cognit process agent individu social behaviour joint commit achiev state affair agent mental state trigger control perform cognit process practic reason attain state outcom process provid agent cognit ingredi undertak individu social behaviour combin joint behaviour process negoti aim reach agreement agent attain state joint process feedback system joint mental state affect individu cognit structur joint process produc result directli affect agent cognit structur individu agent engag joint acquir fulfil goal modifi experienti wisdom accumul result posit neg reinforc prior mental attitud mental attitud led encod posit outcom led neg outcom modifi discharg result impact agent mental joint process affect system joint mental state cognit ground individu mental attitud failur successfulli undertak negoti lead agent gener belief agreement made agent exit negoti joint commit maintain drop light answer question cognit behaviour process relat straightforward individu process relat collect level individu joint cognit process directli link joint behaviour mediat individu cognit behaviour cognit behaviour joint process impact individu agent cognit behaviour affect show consist path coevolut joint commit achiev state joint action form result joint cognit affect agent cognit structur extent joint commit consist integr agent mental state joint affect agent mental gener control perform individu social behaviour converg joint behaviour joint cognit behaviour process rest impact outcom joint behaviour agent cognit structur link individu cognit process system joint cognit model convei concept joint cognit behaviour idea form behaviour group construct plai role consist anthropomorph imag ma theoret posit suggest notion ma form joint cognit behaviour root individu cognit capac undertak cognit behaviour process outcom conclud briefli examin role outcom effect system structur function mention outcom directli impact agent cognit structur system gener affect agent cognit structur modifi set inform belief configur instanti agent cognit structur impact structur depend network prefer drive depend wai agent depend ultim correspond wai system intern structur behav agent fulfil goal depend network exit system joint activ requir respect goal outcom impact contextu factor variabl activ bring refin techniqu impact type quantiti resourc impact directli outcom impact environ system resourc scarc alloc affect wai agent depend ma creat exist differ structur longer consist environ depend network theori mass begin critic discuss model introduc attempt firstli common thread research show integr perspect background describ reason wide rang form social accord intern articul start discuss factor thought determin social section devot critic evalu relationship discuss shed light complex ambigu role plai environ link ma shown mass product mechan reflect environ attempt determinist fittest form mass attempt adapt structur behaviour mass attempt shape structur behaviour remov constraint social shown figur determin ma ultim evolv time complex interplai environ network depend agent relev relat subject section environ subtract subset repres remaind author definit add isnt simpl issu defin environ delic matter theoret practic implic govern system real world notion environ relev long defin respect object ma environ identifi set causal factor thought determin gener ma exist problem defin environ identifi system boundari build definit ma cognit entiti relat assumpt conduct analysi mass intern perspect section boundari system consid relat question extern identifi regard boundari enabl factor impact order answer concept environ articul account exist establish definit ma environ set resourc phenomena determin system gener structur function ma environ set resourc phenomena cognit believ affect structur function resourc physic cognit properti institut valu phenomena simpl event action perform agent mass problem understand circumst factor phenomena thought extern note definit consist fact ma ignor resourc phenomena affect constrain structur function ma factor part system environ repres potenti target system address repres environ system viewpoint defin eventu fall rest insid system agent system attempt identifi resourc system bound fail circumv give attempt defin environ identifi specif resourc phenomena pertain identifi kei properti affect natur system behav build work suggest complex volatil capac environ refer avail heterogen substitut complex refer concentr alloc agent control resourc volatil dimens reflect instabl predict event action time defin properti turn question understand properti affect ma depend network fundament kei understand environ impact mass environ affect wai agent depend section shed light concept depend major determin social social depend long studi varieti rang sociolog scienc distribut artifici intellig complianc object offer synthet perspect social depend explor build major contribut lead scholar research thought decad studi depend provid spark subsequ develop concept incorpor theori gener point social depend agent depend proport resourc action provid proport avail resourc abil agent provid resourc action term defin environ time agent system viewpoint overlap perspect system build transcend perspect constitu agent theori straightforward note perspect relev understand condit establish relat agent fail possibl differ research led scholar explor extent social depend effect avoid sought idea condit agent maintain independ situat potenti condit agent meet ensur depend agent potenti emerson studi develop theori argu relat agent repres term interdepend build sought creat classif scheme gener deal rang interdepend found complex organ intuit type interdepend demand type coordin facilit effect cost draw thompson williamson show theori boundari develop link effect relat taxonomi interdepend agent econom constraint coordin cost williamson contribut primarili restrict econom econom transact good servic occur econom nonetheless offer invalu insight theori mass concern econom type social system relat transact agent necessarili involv econom exchang interest understand path led social depend ontolog extend theori gener theori mass fundament problem address note mass refer econom notion depend built notion exchang agent account econom transact good exchang emot exchang norm exchang exchang notion social depend agent happen depend exchang econom occur kei refin thompson notion pool interdepend unit contribut separ larger unit assum ma interdepend agent necessarili agent involv form exchang agent direct agent interdepend act total ma render discret contribut failur agent threaten agent support introduc notion social depend agent happen depend pool interdepend form place agent depend mediat agent suggest distinct symbiot exchang occur directli parti competit agent depend parti competit depend equat pool interdepend impli collabor effort depend agent achiev common goal involv form direct exchang depend agent interest simpli effect behaviour parti understand import competit depend fundament kei widen set system common theoret background competit depend essenc mechan govern larg number interdepend group common banner firm refer client competit depend depend resourc client control action perform impact social depend discuss notion social fundament intermedi link environ show properti introduc affect set social depend agent explor affect impact structur mass properti mention capac capac environ affect natur form social depend determin agent resourc pursu lean abund resourc extens varieti widen agent abil act isol lower incent form social activ scarciti resourc constraint perform tension function exist mass line emphasi distribut complex affect refer control determin potenti social relat agent simpl resourc enhanc agent possibl effect act highli complex resourc restrict constrain structur function exist mass instabl affect social depend impact accuraci inform agent maintain environ high unpredict environ highli volatil inform highli uncertain make difficult agent accur predict outcom act isol attract achiev expect result altern form joint activ creat stabl environ highli volatil environ tension exist make difficult assess predict effici structur effect behaviour environ act isol effect social activ exist mass easier effici effect carri leav interest note dimens volatil long studi form task uncertainti mainstream theori defin uncertain situat unabl assign probabl research articul longer interv time perform task gener uncertain task task uncertainti relat agent cognit inaccur inform perform uncertain task turn notion task uncertainti agent abil perform effect action impact environ consist notion volatil refer impact environ accuraci agent inform argu amount scarciti resourc order ma incent behav effici stimul innov thing variat mechan issu simplest present role environ versu role ma analog debat form influenc develop human sociolog interest topic determin condit question explan made salient studi complex form social ma depend environ ignor depend understand kei issu involv ideal paradigmat model variat select model ration select model place heavi relianc forc tendenc select fittest form activ role agent mass creat shape social present underli assumpt characterist step integr perspect bypass problem unambigu defin form social exist time uniqu concept regard system respect reactiv depend condit face prepar face case emerg theoret mass select environ mean reject implic inher theori societ develop base role model sourc variat social term mechan built unplan plan chang great deal variat introduc ma error random ration plan choic altern pursu system member reason ma gener exist ma structur behav understood attribut outcom system explain note ma ignor factor constrain structur behaviour factor activ natur select mechan lead ma unplan result focu attent select pursu factor part system environ definit activ effort ration select individu agent affect process gener structur order understand sourc variat social shift burden choic individu cognit work imperson hand drive forc emerg mass structur form behaviour exist mass idea ma emerg system environ mediat agent cognit implic set agent happen member ma decid exist ma happen structur perform behaviour total explain term figur process select repres relat wai relat depend network ma main reason explain emerg mass agent awar depend agent lead pursu natur behav form social brought priori repres mental structur exist form social chang result ration gener select directli affect bypass intermedi depend network case environ volatil attempt agent predict futur configur inevit fail attempt manag environ chang system structur tactic strategi structur condit ma persist chang inevit effect initi expect late seventi growth develop stand major landmark contribut favour extrem posit contribut label natur select popul ecolog view argu environ select type surviv basi fit structur environ draw biologi pe view claim surviv resourc structur dimens shift perspect long focu econom argu emphasi activ role environ limit freedom posit contribut mass cope constantli uncertain environ condit po favour activ mechan natur suit describ challeng todai mass deal condit high volatil environ relat complex uncertainti inform dimens conflict interest object agent involv social make system form integr holist make attempt intern structur costli cost techniqu technolog relat problem high cost inform barrier entri problem multipl interconnect true todai global commun behaviour effect undertaken singl agent turn simultan undertaken relat agent shift focu ma environ challeng term nonetheless pe view limit fact obscur mass power abil partial control environ act major limit todai mass maintain control insul failur argu model mass broad account varieti form rang mass control intern configur determinist constrain balanc challeng environ abil decid structur final mass complet control remov constraint order account type integr select mechan mechan gener mass possibl ration select structur behaviour topic section ration select ration select place relianc role agent mass cognit manag challeng pose environ set agent decid join establish ma exist decid configur structur set constraint environ impact social extent cognit repres agent cognit system joint mental state shown figur ration select repres relat wai role depend network depend ultim determin awar decid establish ma impact outcom system process compon structur system decid behaviour lead outcom affect contextu factor variabl impact system outcom affect system futur configur ration select built fundament process ration expect futur consequ current altern process learn experi feedback previou experi present altern process base assumpt environ set constraint ma adapt structur behaviour build reject assumpt partial control environ process ration proactiv ration calcul learn trial adapt constraint constraint chang remov process dealt turn ration plan ration plan repres mechan build individu cognit structur explain chang social result ration calcul inher rest form cognit regard form intellig agent belief link choic action subsequ impact action environ agent mass resort ration plan environ stabl provid schedul altern action part agent agent awar intent influenc mechan agent cognit behaviour transform mass cognit behaviour process agent mass freedom brought social agent gener ma mass effect effici structur claim system effect effici function combin structur environ regard main tenet structur theori theori repres domin paradigm research meet pressur structur proposit sc theori directli draw march simon cognit theori system process inform main concept borrow cognit differenti object distinct integr subobject differenti integr gener indic build structur differ capac capac process inform solv problem emphasi primarili econom wai indic enhanc ma theori practic draw sc claim principl similarli argu manag ma structur depend circumst environ ma manag practic situat ma manag sharpen diagnost thing time approach suppli manag mass diagnost method techniqu solv situat problem imper ma manag situat manageri task integr order ma react ration model respect varieti rang strategi design inform influenc system central role necess research dwell situat sc theori heavili content modern theori advoc possibl wai adapt environ occur section review built ration plan centr concept adapt dealt section main line argument scholar theori sc approach adapt environ repres law assign type effici structur reason strategi stabl uncertain strategi structur implic child point design product technic demand present technolog size argu variabl provid constraint set feasibl set choic solut depend strateg carri actor involv prescript type environ justifi environ abund capac resourc strictli effici structur structur equal justifi term effici nonetheless explain term higher freedom power constitu member uncertainti adopt flexibl sc approach intern differenti base integr mechan reli mutual adjust differenti unit gener slack resourc adapt extern pressur higher chang boundari main line argument research programm market hierarchi build kei behaviour assumpt actor bound ration shift emphasi unit transact address design problem transact cost issu crucial argument effici opportun offer incent redefin boundari intern unit transact cost possibl modifi boundari resourc depend research programm programm rest assumpt problem adapt structur environ resourc payment requir maintain explain term cope uncertainti attempt make ensur futur surviv growth primarili relat problem manag depend resourc control environ avoid weaken resourc depend gener depend drive forc number rang impact variat horizont vertic reli variat joint interlock emphasi approach sc principl admit condit abund burden weaker pressur met effici solut sc theori provid number tool principl adopt manag step scienc mass theoret empir satisfactori lesson learn condit ration plan issu structur ma difficulti relat problem agent bound effici structur rel desir wai depend interplai interest constitu agent set ma modif chang number member establish relat mass notion ma understand extent structur configur prima faci ineffici regard effici solut problem enabl achiev system object meet member fulfil privat interest adapt learn environ volatil predict suffici time stabl mechan select make agent cognit behaviour variat social place result ration calcul mean respect end agent mass resort process trial error built nonetheless form intellig experienti learn ration calcul expect imagin ma learn modifi behaviour increment basi feedback environ solut outcom subsequ occur condit volatil ambigu main condit mechan learn trial error effect feasibl altern ration plan agent mass partial unawar intent prefer ambigu mental attitud fundament factor affect social agent mass learn aim form commit structur prefer attitud chang time experi agent mass unawar learn improv abil experi learn abil lead compet activ compet activ undertaken agent cognit link behaviour situat reflect import inerti dynam mass abil inhibit modif individu behaviour basi individu cognit individu agent partial capabl affect system mechan cognit behaviour individu level relat cognit behaviour collect unknown ambigu assumpt ambigu opaqu effect mechan adapt learn chang social solut solut influenti background develop adapt experienti learn model identifi simon work bound ration individu limit gener cognit tendenc confront empir evid accuraci similar problem address respect scholar cognit psycholog background role time attent scarc resourc role stabl routin domin specul environ object independ perceiv decid adapt adapt intim environ relev problem attent devot notion fact bring perceiv adapt modif attempt adapt major model find root conceptu framework cognit indetermin behaviour adapt garbag model choic olsen view collect choic issu feel situat solut issu problemat unclear fluid particip make typic choic opportun garbag kind problem solut dump particip model mention theori march model adapt ration uncertainti problem maintain viabl limit capac system util build idea bound imperfect unresolv author attempt theori expect choic major relat concept introduc fundament understand undertaken busi concept quasi resolut conflict conflict member goal resolv local sequenti attent uncertainti avoid avoid uncertainti procedur arrang negoti search search stimul problem direct find solut learn exhibit adapt behaviour link conceptu framework ma research straightforward implic behaviour model discuss heavili reli comput simul methodolog research thread discuss potenti affect core conceptu tool adopt ma theori logic agent architectur mental attitud ambigu agent awar intent behaviour trigger agent mental state behaviour action specif instanti independ instanti mental attitud function agent action action ration plan basi mental attitud ration mental attitud ration adapt adjust action ration posteriori interest implic adapt learn framework role random mass condit unclear technolog agent ambigu number ident agent problemat mass structur behaviour process satisfi todai commun member randomli enter exit make commun size boundari extrem uncertain natur mass time problem solv depend complic rang mix choic opportun mix problem access mix solut problem extend concept ma cover tradit notion integr system coordin idea system behaviour coupl paradox consequ coupl phenomena ensur occur matter ration coordin control march argument specul deep understand actual behaviour comput mass rest good technolog distribut intellig good technolog ration proactiv tension resourc low enabl agent control time high ensur differenti agent control volatil low natur unplan select time high ensur reason amount differenti agent abil cope social gener mechan heavili reli agent proactiv issu proactiv delic rest radic boundari ma environ environ independ variabl determinist affect social make agent cognit ration plan adapt environ regard independ variabl provid set constraint agent impact social vari intens ration social outcom constraint proactiv draw idea environ effect social social ration select calcul select social gener time ultim depend agent mass line argument lead sociolog specul link proactiv ma mean decid act transform decid act constraint decid act environ proactiv ma environ mass notion structur behaviour cognit ration histor led role strateg choic power intern structur relat environ section mention contribut child explan term strateg event built prefer hold power studi prompt idea manag shape structur form american industri manag view act proactiv behaviour ration provid addit impetu view suggest larg product choic individu construct social realiti recent advanc cybernet system theori suggest idea cognit system coordin compon design implement autonom subordin behaviour maintain intern autonom boundari type environ act depend undertaken ma literatur concept mass partial consid research interest design match structur perform studi conceiv environ usual set constraint ma adapt concept proactiv ma research meant convei idea agent exhibit behaviour behaviour perform agent constrain embodi priori environ studi discuss section suggest idea proactiv agent creat serendip proactiv priori environ model maintain notion defin result agent set constraint behaviour futur work start paper scienc mass idea root observ form social coupl knowledg virtual larg busi adequ understood limit analyt tool offer mainstream ma research confront advoc possibl contribut lead scholar attempt defin richer complex notion social case advantag integr approach present paper number step concept ma distinct broader definit offer ma theori model centr notion ma develop main mechan underpin model discuss light integr perspect brought number diverg contribut preval centr relat environ scienc fundament articul combin theori examin explain methodolog empir evalu theori scienc mass built compon attempt made suggest problem confront ma commun step theori mass address problem theori articul model ma number implic structur behaviour ma expect exhibit condit theori appeal notion ma consist perspect ma analyt tool repres reason social ma set principl agent wide rang interrelationship interact theori enhanc understand social vari tool improv abil design manag effici architectur comput mass incomplet theoret attempt predict provid set proposit empir control test methodolog call variabl proposit theori express suggest avenu futur work progress epistemolog result effort evalu term meet initi challeng scienc mass scienc theoret term type theori address problem arena paper requir develop appeal scholarli field order provid increasingli richer articul notion social scienc find specif type methodolog method resort current ma practic comput engin system autonom make good scienc mass expect centr softwar engin design build comput mass benefit provid term applic electron system comput model enhanc understand system analog refer organ englewood prentic englewood prentic berger social construct garden exchang power social john wilei gener system theori academi manag carlei cognit foundat dynam social journal mathemat carlei comparison artifici human journal econom behavior strategi garden anchor book child organiz environ role strateg cohen march olsen garbag model organiz administr scienc cohen levesqu intent choic artifici coleman power structur march behavior theori blackwel publish intent mit press dimens organiz task administr scienc de jong evolutionari comput unifi mit press dinverno luck formal view social depend zhang australian workshop distribut artifici lectur note artifici vol springer pp emerson american sociolog structur theori social cambridg press design complex menlo addison weslei gasser social concept knowledg dai foundat open system artifici freeman popul ecolog american journal henderson pareto gener harvard press adapt select plan dynam boman van de weld lectur note artifici vol springer pp critic methodolog scientif research critic growth cambridg press lawrenc dyer theori organiz industri work harvard busi school lawrenc organ manag differenti harvard graduat school busi boston white structur individu social journal mathemat march simon john wilei son march basil blackwel mutual casual bucklei modern system research behavior varela cognit realiz reidel publish compani mile macro organiz santa publish mitchel norm mitchel social network urban manchest press takeuchi creat compani creat dynam oxford press jen norman collabor practic reason journal logic forthcom pfeffer extern control organ resourc depend harper row powel di organiz chicago press rao georgeff procedur bdi journal logic comput simon behavior model ration quarterli journal singh multiag theoret framework lectur note comput vol springer verlag design organ comput prietula carlei gasser simul organ comput model institut menlo mit pp thompson organ mcgraw hill tverski causal schema judgement tverski judgement heurist cambridg pp von histori statu gener system academi manag wasserman social network method cambridg press weber economi ed roth california press social psycholog weiss multiag system modern approach distribut artifici mit press williamson econom institut hierarchi relat free press williamson market hierarchi program implic van de perspect organ design john wilei pp wooldridg reason ration mit press environ depend network figur unifi framework repres reason system mental state cognit structur cognit process individu social behaviour agent joint mental state techniqu technolog social variabl contextu factor structur physic object social network structur institut profil system structur mechan variabl cognit process behaviour process process outcom
IR/986 5 automat extract web data introduct mecca paolo merialdo dia università di roma tre itali research project aim develop solut automat extract data larg html data sourc target research web site publish larg amount data fairli complex structur aim ideal data extract process web site input url entri point site home return output data extract html page site structur format paper describ softwar architectur specif design automat data extract process compon system preliminari experi show feasibl idea web site share number common data store html page dynam gener script content simpli script run queri possibl nest origin relat tabl return html site class content fiction ecommerc site page item sold site softwar page custom review page class gener page list price detail window gener script page page list book stephen king gener script site gener process result encod origin format script site perform encod function yield class page encod queri collect html sourc università della itali wrapper regular grammar wrap process form decod origin inform html page wrapper perform function implement encod script gener retriev gener queri html code store back structur form close correspond nest type regular express approach wrapper regular grammar html page retriev data item note respect gener regular grammar limit form basic hidden insid hook insid iter wrapper correspond regular grammar introduc limit express power wrap languag experi languag includ typic pattern occur fairli structur html sourc infer acm techniqu wrapper essenti html target specif page organ layout order extract data deriv wrapper page class site decod activ base similar exhibit html page belong infer grammar class page number grammar wrapper recent develop origin techniqu call acm match match extract infer wrapper class page analyz similar differ sampl html page class set sampl html techniqu compar sourc html order find match mismatch part base progress refin common wrapper output wrapper gener acm techniqu grammar page class extract data item system architectur experi demonstr effect effici acm techniqu report order automat extract thing worth note acm techniqu base comparison page critic assumpt html page site cluster class belong support adopt cluster techniqu html page quickli classifi page base techniqu aim give good approxim page class order carri decod site singleton page page site organ home page site fall categori page serv offer browsabl access path data acm base compar page find applic singleton develop specif techniqu wrap page infer nest schema page belong infer schema anonym field label order give semant extract field step manual dataset extract ultim goal automat data extract intrigu altern develop form wrapper automat discov attribut light design softwar architectur system support acm techniqu automat extract data web sourc figur show architectur system identifi main address specif classifi analyz page target site collect cluster homogen identifi page class offer site modul incorpor crawler navig target exploit number heurist produc good approxim page class note class candid page fed align wrapper class singleton wrapper gener class similar page perform modul call implement acm class figur road runner architectur align compar html sourc sampl page infer grammar wrapper class singleton page fed modul call infer wrapper wrapper gener expand base techniqu respect infer label associ semant mean data field extract run wrapper gener modul site page complementari method adopt extract sourc html page text string explicit mean publish method method inspir techniqu appli search mean data web refer brin extract pattern relat world wide web merialdo automat data extract larg web site technic report università di roma grumbach mecca search lost schema
ML/987 6 compar studi neural network base featur extract paradigm hugo mayer cambridg comput museum cambridg uk depart electr comput israel publish pattern recognit vol pp abstract project map deriv classif accuraci neural network implement nn perceptron featur extractor compar convent princip compon analysi test mlp highest classif accuraci cost deform data linear model preserv structur inferior accuraci neural data featur princip introduct process map origin featur effect featur term featur extract exist featur extract method ch map transform pattern pattern criterion exampl criterion squar error distanc error map map determin transform min map function form criteria mao jain group featur extract method versu linear versu exampl common featur extract paradigm tabl linear discrimin analysi ch author ch common group featur extract method exploratori data project enabl data understand data structur paradigm advantag reduc number featur comput complex classif larg number nn model learn mechan featur extract ch low mao featur extract paradigm adapt chang environ afford possibl easi hardwar implement overcom drawback classic algorithm enhanc perform classif mao mlp act featur emb map input featur space hidden layer nn implement map recent suggest mao jain kohonen map ch exampl featur extract paradigm featur extract nn implement evalu exploratori data project classif project map deriv classif accuraci method compar princip compon featur extractor paradigm repres famili model task project empir compar studi featur extract paradigm made mao paradigm mao jain compar exploratori data project classif al current extract arbitrari number project enabl applic map classif extend experi al compar paradigm empir studi perform find map data set true priori knowledg underli distribut data prefer criterion randomli paradigm involv paper suggest methodolog experi featur extract paradigm section paper briefli introduc featur extract paradigm section present experi section work featur extract paradigm featur extract paradigm accomplish feedforward project featur space network repres compactli mlp hidden unit output unit nn implement map method compar convent pca ch map featur space space span eigenvector largest eigenvalu covari matrix mixtur densiti descript paradigm interest reader refer nn textbook network forc perform ident map small hidden layer forc map proce small hidden layer ensur effici encod configur unit input output layer hidden unit hidden layer network train error ch repres kth output nth input vector number train pattern global minimum network perform project span pc data kamp claim cottrel al valid imag hidden unit useless model implement pca interest test domain comparison pca sourc data made part studi perform base pca refer base randomli restrict solv successfulli linear problem remov layer mlp featur extractor mlp hidden unit implement project featur space number appropri pattern repres project space span hidden unit easili separ network output layer hidden unit simultan suppli mean data project number input unit mlp featur extractor number origin number output unit number pattern class hidden layer dimens set exploratori data project classif criterion gener error ch kth target nth input pattern map map map error error distanc input ij project ij defin ij ij ij ij indic pattern distanc pattern commonli assess euclidean metric perceptron implement map base mao jain number input unit network set featur space dimens number output unit extract featur space dimens weight updat gradient descent method map error al exploit eigenvector sampl covari matrix estim train data set establish column network initi weight matrix inspect depend data varianc number priori suffici number weight vector set number hidden unit map compar common random fewer experi requir network configur set commonli map data project mao confirm empir result input space map arbitrari number project enabl map classif experi methodolog compar featur extractor data set deriv al chromosom gather medic israel chromosom pattern repres densiti profil featur intens section perpendicular medial axi found featur provid discrimin chromosom analysi obtain chromosom imag consist geometr pattern independ pattern consist intens featur chromosom pattern repres geometr index ratio short arm length total perimet area chromosom extract satellit imag statlog project pattern correspond intens measur spectral band red neighbourhood pixel imag consist featur pixel fourth research assess subject area higher educ institut uk variabl number activ postgradu valu grant award number public form assess research scale subject area institut iri data pattern repres attribut length chromosom chromosom approxim hundr pattern comparison extract hundr pattern class satellit data fifti pattern class iri data experi show choic lead pattern belong chromosom type soil type subject chemistri biologi fourth iri type obtain data set class consist hundr iri pattern dimens base methodolog al paradigm map pattern creat project map train test classifi classif fifteen data set deriv randomli partit train test set holdout method ch featur extract paradigm appli data set classif accuraci averag fifteen set ten classifi random section configur paramet mlp train backpropag algorithm ch linear logist sigmoid hidden unit input vector hidden layer dimens lower input dimens classif experi ensur effici map rang chromosom satellit rang chromosom iri set exploratori data project experi initi weight matric mlp paradigm randomli select classif accuraci averag experi ten ten initi weight matric al set paramet mlp nn implement map learn rate momentum constant train period epoch number hidden unit nn implement map avoid overfit eigenvector largest eigenvalu defin initi weight matrix initi weight matrix randomli select classif accuraci averag experi network output dimens set exploratori data chang rang classif input layer mlp pc featur extractor emploi eigenvector project experi eigenvector satellit eigenvalu classif experi classifi complex architectur perceptron consid candid classifi concern compar studi featur extract paradigm number input unit classifi set project space number hidden unit set number output unit number fair classifi paramet momentum constant train mlp featur extractor remain unchang featur extract paradigm train classifi perform fix durat epoch configur paramet check avoid provid suffici accuraci classif accuraci averag ten classifi randomli chosen initi weight matric result project map fig show project map base pc featur mlp chromosom random map prefer pc base classif found yield similar map pc featur extractor map fig obtain fifti test pattern class produc map case test classif experi data set interest ten test pattern class experi evalu project map base visual qualit evalu complex experi quantit evalu project mao jain error map quantit evalu project rank map project method visual map map interpret compar map mlp preserv data structur cluster shape base mlp lead accur classif ratio scatter scatter map larger compar map repeat project time random train set conclud project map specif typic small variat experi exist due random classif probabl correct classif test set evalu classif accuraci base featur extract paradigm probabl plot fig project chromosom satellit featur chromosom iri shown fig classif base featur extract mlp outperform classif base classif base pca pca implement map small differ result base paradigm attribut random linear map compar map chromosom satellit find accuraci classif due featur chromosom satellit number extract featur chromosom iri instanc success low percentag origin featur achiev ultim accuraci relat variabl shown fig limit amount data paradigm work complet addit al project mlp featur extractor distort data structur found paradigm yield highest classif accuraci featur extract method famili similar result support linear preserv data structur found provid gener altern model achiev high classif conclud michi ch model problem believ linearli separ applic iter model paradigm requir data project featur extract suspect desir gener featur extract paradigm data project classif experi problem care compar empir interest extend studi applic class domain linear method fail replac nonlinear pca work support part paul center robot product israel author mr peter lambert english correct improv paper readabl anonym suggest refer cm neural network pattern recognit oxford press kamp perceptron singular decomposit biol cybern munro learn intern ann conf cognit sci soc introduct statist pattern recognit ed academ york nonlinear princip compon analysi neural network journal medial axi transform base featur neural network human chromosom classif pattern recognit pattern classif nonlinear studi pattern recognit complet automat neural network base human chromosom analysi ieee tran syst man cyber part special issu artifici neural network tip neural network topograph map exploratori data analysi neural comput applic jain artifici neural network featur extract multivari data project ieee tran neural network murphi uci repositori machin learn depart inform comput scienc spiegelhalt taylor machin neural statist classif elli york jr nonlinear map data structur analysi ieee tran comput figur caption fig project map featur extract paradigm appli chromosom fig probabl correct classif test set number featur extract paradigm chromosom chromosom iri accuraci compar origin featur tabl caption tabl exampl common featur extract paradigm type type type pca project pca fig type type type project project map fig type type type mlp hidden unit mlp hidden unit mlp fig type type type hidden unit hidden unit fig origin pca mlp number featur probabl correct test chromosom fig origin pca mlp number featur probabl correct test chromosom fig origin pca mlp number featur probabl correct test satellit fig origin pca mlp number featur probabl correct test fig origin pca mlp number featur probabl correct test iri fig linear lda mlp som tabl exampl common featur extract paradigm
DB/988 3 shape cbr view xml cunningham depart comput scienc triniti colleg dublin case base reason found applic internet assist internet commerc store reason agent onlin technic support strength cbr area stem knowledg base provid ideal make configur technic inform internet user case data aspect compani entir corpor knowledg import integr case data easili compani industri specif vocabulari suggest xml candid provid integr applic begun xml case languag review present idea standard case view xml work vocabulari namespac develop specif industri earlier research produc version case base languag attempt case xml enabl distribut comput drawback implement outlin paper develop xml produc xml compani knowledg system detail benefit system industri gener term introduct ad intellig internet applic obviou role reason set sell product absenc human sale assist intellig softwar assist sale process catalogu data data user behaviour prefer cbr obviou technolog creat sale assist obviou case descript commod sale task identifi case configur meet user requir case describ packag hardwar real estat instanc standard distribut data type internet xml import cbr process deal data format shimazu watson cbr applic receiv case xml format present case descript languag base xml al doyl xml descript languag support descript domain descript applic interpret data mark onlin cbr applic conform exampl format descript document type declar dtd real estat attach semant document mark format gener dtd cbr call case mark format major drawback approach data mark cbr specif format evolv potenti xml improv idea situat domain specif dtd exist catalogu data mark format instanc emerg standard mark real estat data assist oper space access data xml namespac schema cbr view data approach describ approach advantag exist xml simpli cbr perspect data section review cbr applic xml case languag queri relat data base section examin critiqu earlier standard case languag xml find principl sound implement hamper failur necess retain integr data mark industri specif vocabulari inabl dtd describ structur data object case base brought light section review xml project domain real estat context past cbr work domain argu standard real estat list cbr techniqu integr easili exist data structur section introduc xml concept namespac integr cbr exist follow section case namespac applic system shimazu develop earlier work retriev case relat xml mark case natur languag text describ technic support problem solut support staff mark case xml document store relat system featur code data textual data code tag affect retriev mechan system work system inform retriev cbr integr relat manag system reason data data scalabl shimazu kitano shimazu cbr applic narrowli domain specif problem suggest case base system view medium conjunct mainstream corpor inform system share anticip standard mark case provid open respect retriev techniqu version call chosen retriev method outlin forbu algorithm chosen order sql retriev retriev record comput similar code tag featur calcul return rude subset case base reli client case adapt stream match queri doesnt textual part case retriev textual case base reason system retriev mechan easili appli type data appli idea system sale support system instal air condit unit air condit sale support system similar tabl send sql queri access data base exist instal watson java servlet retriev case convert xml url address java base client adapt issu http request xml file client perform nearest neighbour rank displai result implement outlin vocabulari tag dtd assum case consist featur list valu xml develop defin structur domain specif data xml data download issu http request client end implement highlight shortcom repres case data data type featur weight dtd creation difficult make standard dtd schema emerg industri specif data task scenario vocabulari dtd combin dtd render case form facil creat standard case view bare mind xml suit full integr data base xml document easili creat fly exist discuss section current dtd model power flexibl support task section earli attempt creat standard case languag shortcom implement anticip namespac recommend schema creat case view exist corpor data standard case base languag origin design xml applic facilit storag exchang case data network design motiv initi standard exchang case relat distribut comput al doyl al version influenc function languag specif develop interfac languag compon system intend serv standard exchang inform classif diagnost system case intend establish ground cbr commun build standard exchang storag case data internet shortcom emerg earli implement deal simplic earli requir case structur file case base file respect dtd file describ case file impli separ document case structur file case base file includ respect transmit requir minimum http request case base figur relationship document requir repres data implement significantli amount data requir describ case base case featur pair bath bath element featur attribut defin case base dtd describ pair defin tag xml featur pair bath clear intuit featur pair case attempt maintain gener languag portabl data describ softwar expect pose real problem softwar expect part pair repres attribut element elegantli merg element defin dtd element violat readabl bath holidai mark bath hypothet travel agent inform specif domain featur type weight defin element develop mark file specif case featur featur type defin defin element develop mark case base file case structur case base dtd respect type data bath drawback imposs case mix element tag defin domain type case occur complex compon base descript term xml document logic connect case structur document case base document shortcom dealt respect syntax document case set case instanc deriv implement part document contribut descript specif case structur domain amalgam document xml document architectur suggest descript inform dtd describ document structur power repres inform clear weak document architectur ti limit dtd describ type data requir case grow opinion dtd unsuit rigor descript demand data object mechan establish mechan call schema support data easili extens achiev inherit requir earlier address impact develop section case studi examin feasibl design xml base case base import examin situat languag interact current data storag techniqu inform examin benefit xml bring industri examin case case base reason technolog suit demand internet commerc al draw case base examin hinder transmiss inform mark industri specif languag facilit data mark dtd languag xml activ microsoft corpor xml schema data type xml schema tag standard tag travel make convert simpli cater document store travel data form case argu case base document consid differ document industri standard data concret develop real estat list languag develop world telecom facilit search web real estat offer sale agent usa motiv project recognit local knowledg import describ valu properti local real estat knowledg mark local publicli dtd data index crawler indic search perform web site provid standard languag real estat agent list properti form easili lose local knowledg system entail independ vendor level foot larger busi real estat list manag lisa busi list figur architectur real estat list project consist crawler middl tier central index real estat data xml real estat member site client queri repli deliv raw xml html depend abil client softwar integr cbr xml current technolog import case base chang daili basi system anticip emerg onlin brokerag facil wave internet commerc remain problem commun virtual shop front easi locat compar price servic issu establish easi find commun holidai queri product quickli entail exploit internet provid common languag vendor market good xml suggest solut respect applic xml document describ properti resid local real estat site download local site search broker end match virtual shop mall virtual brokerag type scenario system readili amen type inexact search suit cbr variat cbr index data real estat agent local search order determin properti valuat al mark slightli modifi case properti evalu domain illustr work microsoft corp improv onlin shop experi xml real estat agent real estat real estat agent real estat real estat agent brai brai real estat crawler index real estat web server user queri document address return real estat document return local site standard fulli captur detail real estat give indic benefit xml base industri standard mark languag case base search figur dublin properti mark case mark figur indic tag contribut case weight featur type permiss featur valu cbr applic process document hard code code chang time featur ad constraint drawback product rang updat requir xml methodolog provid standard cbr view data mark user defin tag provid searchabl data cbr applic time maintain structur road dublin activ real estat descript integr tag understand achiev briefli introduc concept xml namespac schema namespac schema namespac facil advanc featur outlin recommend januari namespac develop qualifi uniqu element relationship make avoid element defin vocabulari tag multipl space essenti data multipl sourc namespac xml identifi uri resourc namespac uniqu namespac user defin prefix tag namespac distinguish fact onlin bookstor defin tag element mail list tag person presid namespac defin distinct figur document referenc namespac import point view case base vocabulari namespac defin uniqu case namespac referenc mark data case format namespac featur term defin standard vocabulari section present case namespac provid standard case view xml data briefli discuss dtd benefit adopt bring case base data process schema section acknowledg insuffici earlier implement case base languag due factor implement made provis deal data mark exist dtd dtd document requir implement adequ task describ case data began view document world wide web consortium namespac fidel nutshel supplement case base supplement logic connect standard document architectur outlin xml limit applic hard code document structur solut amalgam descript properti dtd case base classic xml dtd descript addit inform fact legaci dtd descript syntax document interchang make ill suit demand data interchang al document interchang concern document structur hierarchi data interchang rigor requir abil constrain data provid easi extens inherit facil dtd unabl express data relationship inher relat provid support recommend namespac work begun find altern dtd descript power requir adequ data altern call xml schema consortium schema semant constitut superset provid xml dtd design specif data interchang unlik schema document xml document mechan analog express dtd constrain document structur schema work group publish requir document xml schema plan deliv work draft recommend year immatur schema decid section note basi design case namespac microsoft internet explor beta support schema data type base note detail schema syntax expect principl elucid note reflect issu surround xml data consortium extens languag xml activ page note jan microsoft corp xml schema data type preview case namespac xml namespac mechan creat uniqu set structur xml tag referenc xml document provid case essenti develop data standard case format data mark exist dtd schema convert case data namespac facil mix tag domain attempt present idea cbr medium shimazu diagram illustr document architectur case base view real estat data namespac schema mechan real estat case schema essenti real estat case templat creat case namespac real estat namespac tag set imagin case namespac piec case wrapper data tag namespac templat determin domain expert case namespac real estat namespac simpli question pick mix namespac rule compli case namespac case element element solut element real estat case schema xml case base compliant creat fly technolog activ server page figur document architectur mark real estat namespac case namespac decid travel domain basi comparison version small size case demonstr concept breviti figur illustr simpl case base xml case case namespac hypothet travel agent namespac element prefix letter belong case namespac travel agent namespac declar default namespac document element understood belong domain case namespac repres case schema real estat case schema real estat case real estat namespac figur case mark case schema holidai schema case namespac referenc figur delimit simpl case schema shown figur schema easili extend includ facil figur excerpt case schema base full explan syntax schema scope paper point make clearer schema xml document unlik dtd defin notat tag tag place element defin featur xml document base schema bath egypt plane april hotel white egypt tag list element permiss parent element constraint presenc number type defin attribut element defin line figur option weight constraint attribut featur element defin line paper present idea standard integr cbr view compani inform system abil xml integr relat system make suitabl candid repres view cbr system store case xml case format system make xml facil creat custom tag set domain explain good dtd creation easi domain specif vocabulari emerg make find standard repres case data violat syntax domain data industri initi real estat domain standard xml suggest role cbr scenario review initi implement standard case languag find lack number reason syntax subsum domain data complet document architectur understood applic design handl research solut led conclud current dtd model inappropri rigor requir data descript introduc initi stem xml project namespac creat power descript model data altern dtd present idea case namespac repres power case schema exampl present holidai domain work refin case namespac explor applic realm internet area internet brokerag schema offer advantag easi inherit datatyp support achiev current dtd model goal develop xml case schema fulli exploit featur refer al xml pg cunningham finn knowledg engin requir deriv analog topic case base lectur note artifici mm richter springer cbr smart technolog network tcd technic report model access map thirteenth annual confer cognit scienc societi erlbaum watson web base reason system sale support british expert system confer learn adapt rule case msc thesi comput scienc triniti colleg dublin cunningham doyl distribut cbr xml intellig system electron septemb tcd technic report common case experi share case studi softwar qualiti control lesson futur direct db pp aaai mit press menlo textual case base reason xml web advanc case base european workshop cbr springer verlag lnai intellig sale support cbr reason foundat applic burkhard lectur note berlin
IR/989 5 kernel unlabel exampl martin mit ai lab ma jaakkola mit ai lab ma abstract modern classif applic necessit supplement label exampl unlabel exampl improv classif perform present tractabl algorithm exploit unlabel exampl discrimin classif achiev essenti expand input vector longer featur vector label unlabel exampl result classif method interpret discrimin kernel densiti estim readili train em case discrimin achiev optim solut pure discrimin formul estim problem appeal maximum entropi framework demonstr approach requir label exampl high classif accuraci introduct modern classif problem text label exampl larg number unlabel exampl readili acquir method recent advantag unlabel exampl improv classif perform method includ em algorithm naiv model text classif framework transduct maximum entropi discrimin approach divid primarili basi emploi gener model motiv robust classif comput effort scale exponenti number unlabel exampl exact solut discrimin approach transduct approxim effect remain unclear formul complementari discrimin approach exploit unlabel effect expand exampl approach advantag includ abil repres true optim boundari make explicit densiti exampl feasibl state paper organ start discuss kernel densiti estim provid smooth assum label data subsequ introduc unlabel defin formul em algorithm discrimin train provid pure discrimin version paramet estim problem formal maximum entropi discrimin problem demonstr concern approach warrant kernel densiti estim classif start assum larg number label exampl yn joint kernel densiti estim written appropri chosen kernel function consist converg joint densiti fix number kernel function view condit probabl index observ point assum gaussian form label assign sampl point noisi incorpor probabl label result joint densiti model interpret prior probabl index variabl result model conform graph depict reminisc aspect model cluster dyadic data main differ number aspect equal number exampl model suitabl cluster search probabl observ adjust term scale restrict yield comput advantag object paper posterior probabl label assum uniform qualiti posterior probabl depend accur properti membership probabl smooth provid simpl condit membership probabl sampl label exampl preclud accur ensur condit probabl evalu accur basi sampl estim eq remov label altern set width paramet gaussian kernel simpl lemma obtain standard larg deviat ti choic kernel width squar norm membership probabl lemma ng collect distribut ijk ijk kp independ sampl ijk ijk probabl independ sampl lemma appli case set ijk repres sampl label note sign map rule lemma state long membership probabl appropri bound squar label classif distribut ijk kp impli condit achiev larg squar norm directli control kernel width lemma ti kernel width accuraci estim condit probabl algorithm adjust kernel basi present longer version paper em estim view result kernel densiti estim repres vector membership probabl mixtur distanc view fisher score vector comput respect adjust weight exampl classifi associ compon comput altern approach exploit kernel densiti estim classif assum label train data xn continu model defin estim free label exampl maxim condit log jx log summat label exampl object function jointli concav free paramet lend uniqu maximum concav optim easili perform em algorithm soft assign compon em algorithm iter recomput current estim updat procedur adjust case frequenc label train set deviat significantli uniform simpl rescal frequenc renorm suffic runtim algorithm discrimin formul suggest em provid reason paramet estim classif qualiti potenti smooth kernel smooth membership probabl converg extrem valu indic overfit actual classif unlabel exampl made basi basi function paramet discrimin estim altern discrimin formul sensit boundari probabl valu label condit probabl made basi sign discrimin function similar linear classifi wai estim weight discrimin weight remain long maintain kernel densiti interpret estim algorithm euclidean norm regular svm emploi maximum entropi discrimin framework reli relat estim distribut label yn paramet distinguish observ label show case maximum entropi solut factor exampl yn formul estim problem directli term margin maximum entropi formal encod principl label assign exampl remain uninform extent classif object set label exampl maxim subject classif constraint entropi rel margin specifi target separ slack variabl permit deviat target ensur solut exist solut sensit work problem advantag formul effort spent train exampl classif uncertain exampl classifi correctli margin larger effect optim problem algorithm explain appendix discuss expand kernel enabl repres optim boundari provid kernel densiti estim suffici accur em med algorithm estim boundari sensit densiti label point region influenc boundari region boundari partli follow unlik adher strongli label point estim techniqu limit effect point bound weight unlabel point affect smooth constraint membership probabl capac result classifi number unlabel exampl fat context maximum entropi point classif entropi maxim impli point effect boundari condit probabl interpret kernel free gener class function kernel longer integr term kernel special linear kernel reduc weight distanc point covari data distinct high varianc direct easier scatter greater scatter probabilist interpret simpl preprocess step support vector machin advantag unlabel expand input term kernel label unlabel point xn option normal featur vector result address potenti concern expand involv freedom result poor gener figur demonstr case test classif error approach limit asymptot rate exponenti fast problem consid dna splice site classif problem exampl vari size random subset label exampl unlabel exampl error rate comput basi remain exampl denot number label exampl result figur averag independ run exponenti rate converg limit rate evidenc linear trend figur test error shown figur pure discrimin train contribut substanti accuraci kernel width experi simpli fix median distanc nearest neighbor opposit class result method kernel width squar discuss longer version paper concern formul valid case larg number unlabel exampl method deterior rapidli kernel densiti estim longer assum give reason estim figur illustr valid interpret problem classifi dna experi basi type tissu arrai experi correspond input vector classifi consist express level gene includ probe arrai number exampl train test includ exampl unlabel point randomli select subset label train measur perform test exampl slightli type assess figur show rapid converg em discrimin med formul level correspond classif error test exampl result averag independ run provid complementari framework exploit unlabel exampl discrimin classif problem framework involv combin idea kernel densiti estim input vector simpl em label exampl label exampl svm em med figur plot test error rate em formul asymptot rate function label exampl linear trend figur impli error rate approach asymptot error exponenti fast test error med svm function number label exampl svm unlabel exampl number label exampl med em figur test error classif problem function number randomli chosen label exampl result em med formul algorithm suffici find global optim paramet estim shown pure discrimin formul yield substanti result framework extens includ kernel transduct algorithm enforc margin constraint unlabel exampl combin term captur lower structur data extens includ analysi framework similarli acknowledg author gratefulli acknowledg support ntt nsf thoma minka discuss insight refer nigam mccallum thrun mitchel text classif label unlabel exampl machin learn blum mitchel combin label unlabel data cotrain proc annual conf comput learn pp vapnik statist learn theori john wilei son transduct infer text classif support vector machin intern confer machin learn jaakkola jebara maximum entropi discrimin advanc neural inform process system hofmann puzicha learn dyadic data intern comput scienc tong koller restrict optim classifi aaai miller mixtur expert classif learn base label unlabel data advanc neural inform process system pp castelli cover rel label unlabel sampl pattern recognit unknown mix paramet ieee transact inform theori maximum entropi solut uniqu solut maximum entropi estim problem found introduc lagrang multipli classif constraint multipli satisfi lower bound inequ constraint upper bound linear margin penalti minim repres solut find optim set evalu partit function normal maximum entropi distribut denot observ label minim jointli convex function log respect lagrang multipli lead optim set optim readili axi parallel line search bisect requir gradient tanh ep gp essenti classif expect respect maximum entropi distribut yn compon label averag ep rule optim identifi readili evalu find solut involv oper number posit neg train label med formul adjust defin margin penalti equal penalti coeffici modifi adapt estim process balanc rate misclassif error class
HCI/990 4 distribut data manag concept locat awar applic steffen volz monika institut germani abstract mobil comput person digit cellular phone commun determin posit sensor socal locat awar applic advantag fact structur inform posit user order assign data inform system refer spatial comput model nexu support deutsch forschungsgemeinschaft german research aim develop gener infrastructur serv basi locat awar applic central task platform deal data manag intend establish scalabl middlewar capabl handl huge amount system organ distribut environ data made nexu fit kind locat awar applic multipl data set highli detail resolut provid introduct basic idea nexu project time possibl access inform difficult find quickli search grow effici method structur inform individu observ locat awar applic offer approach posit user provid inform special import current locat inform system refer spatial model assign data posit central part nexu platform consist manag spatial model repres physic world provid basi nexu infrastructur serv locat awar applic gener project carri scope research group cooper institut institut parallel distribut high perform system institut commun network comput engin stuttgart steffen volz monika extend scope inform deliv extern inform sourc digit librari world wide web access platform concept virtual object introduc virtual object augment nexu world function virtual inform tower spatial structur data store inform system locat predefin area visibl fig build locat homepag proce build build locat homepag fig virtual inform tower area visibl posit inform content provid visibl due fact spatial object model includ virtual call augment area model fig augment area model describ part nexu augment area citi detail interior room essenti model overlap includ transpar structur augment world interact nexu platform digit fig augment realiti comput nexu nexu distribut data manag concept locat awar applic applic resolut data spatial model manag data multipl highli detail level huge amount data store handl reason inevit larg distribut spatial model server function scalabl middlewar layer access multipl user function sm spatial select network analysi facilit support user nexu world respect comput aid facil manag system abil perform geograph queri interact control process interest object implement activ function system object real world control comput model vice versa particip nexu system identifi featur surround point special sensor integr user mobil devic determin direct technic environ nexu assum nexu station handheld comput person digit assist wearabl comput posit mobil commun sensor system acquir inform aspect state environ user attach mobil devic determin locat outdoor differenti global posit system combin support sensor indoor posit requir method base infrar signal radio network indirect posit techniqu imag interpret posit inform obtain sensor system manag distribut mobil form locat servic nexu station connect platform extern inform sourc internet wireless commun wide area network data servic mobil telephon system gsm futur system suitabl data transmiss insid wireless lan ieee standard emploi present firstli overview locat awar applic requir spatial relat function global architectur platform section concept develop distribut data handl demonstr approach appli order nexu characterist server compon spatial data handl prototyp approach section final conclud paper steffen volz monika characterist locat awar applic locat awar applic current posit mobil user receiv inform directli sensor system indirectli locat servic determin user locat spatial model provid inform import current posit user immedi locat awar applic offer special servic solut typic gi task navig spatial queri kind applic deal locat awar global approach emerg inform system stand opposit local applic depart store inform system regard requir nexu precondit user switch applic convei impress function nexu platform section illustr main idea mean applic scenario assum fictiti attend confer citi profit servic nexu arriv main station confer center handheld comput access user interfac provid applic user specifi destin util navig system lead locat confer place map photograph point voic output support orient arriv confer nexu client find locat area visibl virtual inform tower built event access inform schedul confer build compani present link www contact person work field activ leav messag virtual blackboard appli nexu search restaur locat vicin order dinner result queri show select object internet user inform menu restaur nexu guid nexu particip pass famou build telepoint devic includ pda identif object comput model inform build displai comput screen short audio signal call attent attract close current museum modern art interest museum nexu gener user regist spatial servic notifi surround object user decid visit museum dinner defin spatial relat requir locat awar client partli illustr applic case model specifi action platform perform fig gener relationship nexu distribut data manag concept locat awar applic black box call exist concret locat awar client present area load model navig chang object analyz model subscrib event gener zone calcul gener fig diagram show spatial relat servic demand locat awar applic present area locat awar client provid map show environ gener navig find analyz model perform queri attribut spatial gener zone gener buffer spatial calcul valu measur statist comput user locat awar applic util subscrib event order regist receiv notif spatial relat event occur access predefin area applic user author manipul geometri attribut spatial chang object appli load model determin client carri process simpli download data platform architectur nexu platform nexu platform design gener infrastructur support kind locat awar applic function platform claim system unit steffen volz monika user sensor commun inform data manag fig detail compon present nexu applic user interfac nexu platform fig architectur nexu platform area servic regist distribut data manag global feder mobil object regist commun sensor system locat servic nexu client locat awar access platform standard user interfac run mobil devic carri user account individu demand inform system facilit seamless interact infrastructur perform queri function straightforward manner visual result intellig interfac adapt kind nexu level comput amount level network connect displai pda requir complet user interfac wearabl comput nexu system platform independ usag oper system reflect user interfac sensor system hand measur global indic real world temperatur illumin detect object relat posit nexu particip nexu station equip sensor record data forward data manag compon augment world model highli current state data combin final case posit sensor digit yield individu measur aggreg coordin pair server side inform nexu distribut data manag concept locat awar applic sensor system relat function control object real world author user opportun chang properti object augment world model propag server nexu station modifi comput real world object induc perform event user select room displai comput chang attribut condit illumin send modif platform data manag compon carri command initi commun process trigger light switch illumin real environ commun unit data exchang compon infrastructur nexu environ consist network solv effici data transmiss mean cach techniqu commun compon realiz adapt system order prevent breakdown paramet bandwidth chang distribut manag heterogen spatial data nexu platform inform servic user huge amount data multipl custom handl central solut inadequ system lai claim scalabl data organ distribut environ process share server optim time spatial data offer multipl order meet individu applic algorithm deduc level detail implement data set vital aspect accept nexu deal privaci data protect illeg data manipul precondit mention impli problem solv project approach discuss section gener concept distribut data handl requir distribut data server lead necess establish global feder manag user posit demand optim procedur manag static object dealt storag process data divid separ part regard mobil user specif user access handl convent object user posit updat frequent administ separ locat servic suitabl steffen volz monika geograph area servic regist document assign static augment area model spatial model server spatial model server store manag comput model virtual object connect extern inform provid gi function fig call servic data ordbm gi return result spatial model server object regist yield engag sm registr nexu station global feder area servic regist lookup forward locat inform fig distribut data manag queri strategi nexu locat servic call locat inform queri updat request pose nexu platform global feder compon feder inform object regist locat servic specif current posit client queri area servic regist order find augment area model spatial model involv process demand task locat servic forward user posit relev sm call sm perform requir servic carri select sm instanc yield partial result back feder aggreg solut final propag client task shortest path strategi inadequ produc reason result case global feder abil load data server involv process queri possess gi function nexu distribut data manag concept locat awar applic heterogen data set augment world model repres featur physic world import locat awar applic data set detail applic data high prefer coarser import featur effici data analysi visual low data transmiss import provid adequ level detail applic task vital prerequisit spatial model manag spatial specif consortium account infrastructur deal heterogen data multipl differ resolut data set strategi homogen data multipl develop section present approach pursu heterogen data describ method deriv data set approach applic perceiv combin augment area model big singl model complex distribut manag heterogen data hidden order spatial data data format data harmon process requir definit relationship spatial data set gener manifold augment area model share relat equal import semant relat determin term refin geometri attribut describ relat augment area model clarifi model gener citi model model detail build model spatial complet semant refin geometri attribut build model differ resolut data relat link link individu object detail difficulti involv homogen techniqu approach find solut task present section topic affect queri strategi develop platform data set process queri depend kind applic type queri multipl spatial model perform possibl vari level detail steffen volz monika common usag homogen carri spatial model server provid suitabl reflect scheme displai figur extend global feder area servic regist suitabl data area servic regist find check meta inform data set involv requir resolut deriv feder initi commun spatial model server call carri demand task context specif plai import role nexu project interfac implement vector attribut spatial refer specif queri featur modif form basi nexu respect area servic concept catalog servic establish infrastructur search deal standard metadata integr present specif aim provid geospati technolog mobil devic featur ident relationship specif highli coincid demand nexu platform link heterogen data set data set differ repres physic entiti differ data discrep themat geometri result underli data acquisit oper captur sourc differ gross error data natur object result natur object boundari defin manag themat geometr miss data care integr data sourc provid mechan identifi link object link explicit implicit base common geometri integr data set similar geometri semant realiz conflat reli geometri includ context term relat data set resolut harmon respect semant geometri principl gener highli detail data set favor effect link object produc directli gener problem tackl cartograph comput graphic comput vision specialist depend data gener oper imag raster map transfer imag pyramid simpli smooth oper tackl mesh simplif algorithm approach geometri assum biggest object import order includ approach model base knowledg base techniqu reflect import behaviour object nexu distribut data manag concept locat awar applic show data set test area citi stuttgart highest level detail repres build complex structur acquir method combin digit ground plan height inform laser scanner data captur detail build geometri roof type automat level detail simplifi build singl entiti data set gener assign maximum height build ground plan level repres aggreg build term citi block structur deriv integr citi block boundari inform system data averag height build insid citi block hand gener data set highest level step combin inform case citi block process link object exploit system fig scene virtual citi model stuttgart level detail storag process spatial data sm manag augment area special server establish support storag process spatial data object relat dbm informix combin spatial data blade spatial engin sql geograph cover complet function gi geograph inform system integr distribut sm environ comparison central distribut gi offer sophist support data share improv reliabl opportun system growth import advantag concern effici achiev distribut costli oper multipl site parallel process gener concept data handl present section extend queri optim strategi regard distribut basic step carri order reduc queri steffen volz monika data global optim local optim queri decomposit divid queri execut global optim develop strategi process subqueri solv global feder area servic regist deal data local spatial model server optim subqueri individu site interfac sm spatial model server client vari comput power access platform interfac provid client feasibl receiv complet spatial model process data kind locat awar applic emploi custom api locat client side make gi function server simpl client support interfac system manag api prepar client locat awar applic simpl user system administr basic interfac interfac fig interfac spatial model server global interfac prototyp approach version develop java librari commerci gi product extens internet map server prototyp spatial model server servic defin section carri spatial select navig task attribut queri graphic present java packag locat client side shield applic intern detail gi sm access virtual platform mean applic form url denot demand servic argument forward basic feder compon web server web server extens emploi sm order accept servic invoc balanc work make capabl distribut servic call roughli equal ident instanc enhanc nexu distribut data manag concept locat awar applic perform sm select sm node suitabl demand task propag internet map server extens trigger execut server script handl servic result queri final produc spatial data sm resid remot ordbm capabl store object geometri prior sm sign area servic regist identifi object class level detail data set manag sm receiv posit inform user locat servic commun directli programm support rmi mechan appli nexu compon establish method mediat gi hand locat servic area servic regist hand fig area servic regist locat servic rmi sm server node dll rmi ordbm extens fig web server http feder effici commun amount data transfer client server minim sm preserv state locat awar map extent specif result previou queri data store client side import weak client stateless commun manag client integr server client open session invok servic sm state client store steffen volz monika tabl updat server script time session close demonstr capabl sampl applic develop make custom api invoc servic gui enabl user sign sm sm integr user mobil object spatial model enter distanc applic select highlight spatial object lie distanc user current set select closest determin object select attribut assign context applic applic accomplish navig task yield optim path visit point user result spatial queri prepar map client imag outlook nexu focu put develop effici techniqu manag spatial data order support kind locat awar applic concept distribut data queri handl evalu prototyp version spatial model server implement basi commerci gi order usag data servic server provid access nexu client sampl applic interfac interact perform advanc gi queri navig spatial select upcom task deal sophist integr feder compon data manag unit nexu platform implement strategi process queri distribut environ problem data handl multipl face prototyp nexu infrastructur year refer imag pyramid digit photogrammetri al digit karlsruh method data base interpret appli model gener larg medium scale semant model acquisit topograph inform imag map natur object indetermin boundari au vol de hierarch triangul multiresolut surfac descript acm transact graphic gsm servic protocol bg stuttgart germani nexu distribut data manag concept locat awar applic reason binari topolog relat advanc spatial symposium larg spatial ssd rapid product virtual realiti citi model gi nexu open global infrastructur applic intern confer mobil comput network unifi softwar develop process object technolog usa spatial topolog continu step seamless gi data int geograph inform vol architectur distribut locat servic european wireless confer report ica workshop map gener technic st june sweden insid specif engin remot vol gi open gi consortium level detail gener vrml siggraph symposium vrml einer für ein model nexu diploma thesi nr faculti comput stuttgart link object spatial data set integr visual context awar wearabl comput intern symposium wearabl comput usa relat match spatial data intern journal geograph inform queri optim distribut geograph inform system engin remot vol
Agents/991 1 submiss adapt fault toler distribut system olivi marin pierr sen laboratoir dinformatiqu du le rue philipp le cedex laboratoir dinformatiqu de pari pari cnr place pari cedex franc paper studi bring flexibl system system identifi valuabl basi reach reliabl shown rare attract featur system framework build applic provid adapt fault put forward result obtain test implement framework conclud draw perspect evolut work decentr program fault replic introduct main motiv system li distribut natur resourc action intuit fundament issu distribut comput system possibl host network failur notic current distribut platform applic systemat possibl failur main explan system applic develop small run singl comput highli coupl comput run experi distribut system commun abstract atom ensur depend critic system design applic depend protocol chang applic start import issu system resid dynam rel entiti involv chang comput applic domain field crisi manag system softwar develop order assist team process coordin knowledg action possibl failur high critic inform server agent evolv manag crisi concret ga spread urban crisi handl applic agent assist public servic team spot import team assist agent requir high final ga harmless panic popul moment law order team assist reliabl naiv solut appli depend replic element feasibl practic protocol appli optim architectur comput main convent distribut program architectur offer dynam softwar element replic spot chang current replic strategi fly develop solut interconnect architectur conduct simpl experi evalu architectur paper organ section briefli present replic issu quick insight replic distribut system section describ goal intend achiev develop solut elabor applic provid adapt fault toler section present gener design framework dedic reliabl system section report perform softwar implement basi solut perspect drawn section ii relat work fault toler system famili reactiv system offer high redund good system base metaphor ant nest common task fulfil multitud basic agent present behaviour characterist begin share code hard design applic term reactiv found simpl redund scheme appli cognit system advent inconsist copi singl advanc complex agent definit involv solut offer dynam clone specif agent system motiv improv avail agent case congest work restrict agent function task chang state doesnt repres support fault toler solut enabl reliabl persist stabl storag solv situat involv definit failur machin host agent recoveri delai hazard comput fulli restor replic distribut comput replic data comput effici achiev fault toler distribut system replic softwar compon defin softwar compon possess host main type replic activ replica process input messag passiv input messag process singl replica transmit current state period replica order maintain consist activ replic strategi lead high overhead replic mean replica treatment produc result passiv replic econom processor util activ redund replica case failur activ replica found replica elect set passiv execut restart save state techniqu requir cpu resourc activ approach involv checkpoint manag remain process time space activ replic fast recoveri delai kind techniqu dedic applic constraint requir short recoveri delai passiv replic scheme low overhead failur free execut provid short recoveri delai choic suitabl strategi directli depend environ failur applic requir term recoveri delai overhead activ approach chosen failur rate high applic design specifi hard time constraint passiv approach prefer toolkit includ replic facil build reliabl applic product flexibl implement adapt replic mechan metaxa implement activ passiv replic flexibl java author extend java reflect architectur interest featur provid replic scheme transpar support applic metaxa reli modifi java virtual machin realiz smalltalk machin activ replic similar meta level provid replic strategi iii object approach mention intend achiev work provid effici system select agent advantag specif platform develop suitabl architectur perform dynam applic applic reli collabor agent failur involv agent bring comput dead end replic specif agent identifi crucial applic bypass easili problem mind replic costli process commun softwar element critic point applic progress import back previou choic replic element properti fact flexibl point strong basi elabor mechan decid solut independ overli valid case drastic evolut platform constitut step enabl develop architectur reusabl eventu offer system portabl compat chosen architectur java languag specif jvm provid rel hardwar invalu featur distribut system great number exist platform implement java addit remot method invoc facil offer abstract elabor distribut solut final import order simplifi tackl hypothesi assum system model synchron obtain solut conceiv extend asynchron model impli upper bound commun delai assum failur upgrad prospect present vi group group task control unit fig applic architectur iv framework present roughli depict featur design architectur framework design reliabl distribut applic task replic unlimit number time replic strategi includ group membership manag dynam add remov replica atom order multicast insid replic group replic group opaqu entiti underli applic task number replica intern strategi specif task total hidden applic task replic group leader commun task leader act fix provid multicast failur detect replic group global rmi includ function applic task correspond gener independ current locat replic group element servic call ongo locat leader charg gener applic task request case failur servic elect set remain ensur time replic group leader order benefit fault toler abil offer agent inherit function object enabl underli system handl agent execut commun act intermediari commit agent suspend messag recept effect task wrap act replic group manag deliv receiv messag member replic preserv transpar support applic input messag intercept enabl messag cach messag process order replic messag duplic mistak discard replic replic group suspend copi newli creat request host resum group execut task commun remot disregard singl agent replic local proxi implement interfac refer distinct remot entiti consid leader replic group replic failur manag passiv activ replic strategi main origin strategi fix agent replic protocol tune intern paramet number replica period case passiv replic mention replic featur agent total transpar replic manag agent group inform track replica includ current strategi activ suspend restart group intern paramet number member chang function depend current strategi activ replic group impli send suspend order replica passiv leader suspend messag mean propag commun replic group function vari current strategi activ replic messag broadcast passiv messag comput leader replic group replic strategi replic manag carri chang current replic tune paramet switch activ passiv oper sole consist inform replica polici opposit group suspend replica updat resum execut replic manag repres fast handl failur recoveri activ replica replic group replica group possess inform order elect activ replica perform section present perform evalu basic compon measur obtain jdk set mhz link fast ethernet migrat cost ad replica runtim evalu task creat remot host leader send local data replica mechan close task migrat figur show time requir server function data size migrat observ megabyt time add copi perform server migrat mechan compar voyag migrat facil move agent network test server move pentium pc run linux jdk shown figur gener faster voyag anomali graph fact perform server size fig server migrat cost server size voyag fig comparison server migrat cost measur environ subject chaotic variat activ replic cost send synchron messag replic group activ replic strategi evalu time displai measur emiss messag size recept basic repli messag set replica figur present configur replic task local replic task replic remot host leader send host replica resid distinct remot host passiv replic estim cost induc passiv time updat remot replica measur messag size fig commun cost function replic task size fig updat cost function replic date local replica set obtain time small figur illustr measur perform updat replic group replic replic polici switch evalu time requir switch replic proce activ strategi passiv requir oper vi present paper framework system architectur provid mean build reliabl distribut bring amount flexibl softwar possibl decid part comput critic made bypass failur replic control dynam applic safeguard enabl reliabl comput fly architectur implement java rmi facil present interfac platform test conduct current version shown result issu left unsolv global system mention section constitut main weak spot central base synchron system model present studi creation distribut global servic fulli benefit characterist integr asynchron failur detect field work replic scheme chosen sole applic design decid replica replica strategi replic scheme modifi research artifici intellig side decentr solut observ applic behaviour provid optim fault toler agent inform collect pass system match agent semant automat reach intellig replic scheme research issu includ pinpoint common constraint multiag platform term mobil provid interfac offer simpl order valid work achiev applic develop includ distribut basic crisi manag system destin test viabil util architectur term softwar refer corradi secur open mobil agent program proc fourth intern symposium autonom decentr system march page ieee comput societi press system prevent technolog springer verlag drogoul result emerg ant societi artifici comput simul social nigel gilbert cont ucl sycara intellig adapt inform methodolog lectur note artifici intellig page activ object autonom special seri actor edit denni ieee platform mobil softwar futur oopsla workshop reflect program java octob british columbia design implement object orient parallel distribut lectur note comput scienc page springer verlag guerraoui schiper replic fault ieee april failur detector solv consensu april workshop distribut object program cheyer moran open agent framework build distribut softwar appli artifici suri overview nomad mobil agent van flexibl group commun april shen hybrid infrastructur model manufactur
HCI/992 4 mont jan media lab autonom kiosk justin tom tim yang abstract catherin mit media lab usa describ embodi kiosk build research embodi agent inform displai mix realiti kiosk format order displai spatial intellig eca leverag abil coordin inform displai multipl inform convei speech gestur mix realiti depend interact everydai object enhanc comput overlai describ mack lab autonom eca answer question give direct mit media research project peopl mack combin indic normal paper map user place tabl mack research issu involv differenti attent hand speech flexibl architectur embodi agent modal fuse input gener introduct research comput multimod comput autonom agent led develop increasingli sophist autonom virtual human year autonom charact sort import product face comput game increasingli autonomi underli model behavior simpl physic model human motion intellig increasingli refer abil abil engag human relev speech bodi behavior research concentr type virtual human social linguist abil carri call embodi agent embodi agent defin properti human abil recogn respond verbal input abil gener verbal output function turn repair mechan perform model negoti contribut proposit year continu trend situat public mation access system deliv resourc servic gener public kiosk system place interest constraint interfac design kiosk system stand tice casual user kiosk system time lengthi interact user base public space tend repres set system gear common demonstr abil recov error inform booth railwai depart store museum advantag inform staff member reli physic space share visitor order give describ travel spatial relationship place thing railwai personnel point proper train depart store unfold store map give direct museum staff illustr size dinosaur great hall paper describ intellig kiosk integr strength inform booth accuraci inform access station incorpor embodi agent inform kiosk applic includ input output modal paper map demonstr research input output account exist architectur embodi agent background human complex phenomenon involv understand synthesi multipl modal time scale head movement function interdepend form modal rise tone fall point oneself point essenti mean occurr modal work choic modal equal import tight synchroni commun modal human speaker accentu import word ing gestur word gestur turn ey listen end thought listen nod hundr millisecond gaze shift synchroni essenti mean speaker great length maintain repeat gestur ag utter accompani speech listen synchroni account understand contrast head nod head nod synchroni ferent commun modal low bandwidth satisfact trust outcom diminish synchroni commun modal manag nod place understand success modal work speech nonverb behavior manifest convei virtual compat ti serv reinforc semant pragmat attribut messag distribut modal full commun intent speaker interpret combin linguist bodi languag inform deictic gestur spoken word substitut express encod inform speech folder top stack left talk object speaker tend gestur aspect speech complementari aspect object talk locat shape tend redundantli hand speech describ thing semant pragmat compat relationship recal interact word graphic multimod present suggest gestur speech underli visual linguist relationship gestur speech essenti product mean choic modal natur speaker tend produc gestur introduc entiti dialogu tend shift gaze begin end speak turn comput applic user tend speech pen describ spatial inform shape object perform gener action spatial print user rare express multimod time research devot rout direct underli structur tic deni examin landmark oral found mark spoken frequent point rout landmark found construct mental unfamiliar ment prepar move tverski peopl speech map convei rout found common structur written direct step put listen point departur typic appar interlocutor begin implicit step iter goal design start progress prescrib action action orient continu direct investig print map direct give eleven subject told find distinct locat media lab stand map request tion understand set direct similar find tverski emploi method rel descript machin deictic rout plan method disambigu misunderstand provid short rel base assum establish landmark freight freight elev serv context descript locat kitchen rout plain speech deictic gestur rout person perspect perspect speech turn pronoun point imaginari hall front make flat gestur describ door left receiv remain rout defin trace rout map case switch walk person hall synchroni associ modal particip railwai personnel lost inform varieti modal understand commun approach question point view build commun humanoid agent interact human understand produc inform convei modal facial express hand gestur order comput system fulli understand messag convei collect inform varieti channel integr combin easi task daunt order gener includ speech proper inton system make distribut inform channel previou built system decid gener ture respect inform structur kind gestur gener system decid tion displai gestur inform convei speech depart store pull map user hand cate path restaur current gener indic paper map relat work kiosk research public inform kiosk effect interfac shown user accept onlin serv wide rang individu knowledg transfer kiosk user demonstr gain inform tend system repeatedli initi interact kiosk busi util likelihood reduc time physic staff provid advic current kiosk limit interact requir literaci part hand type inform replac text graphic eca result system wider user eca multimod input output produc tive interact commun protocol user user skill daili natur languag gestur full advantag share creat spatial bridg user agent research conduct find wai effect present wai user interact inform concentr touch screen intuit interact bodi inform addit research amin natur kind linkag bodi user engag trail pattern gener evolv interest system creat hypermedia public inform kiosk touch screen face short music graphic interact game engag user make feel comfort system improv standard requir user ideal public access system kiosk demonstr approach requir emploi natur languag input conjunct touch screen modal select goal creat intuit interfac requir user ing touch screen intuit keyboard remain limit primarili process flow eca address limit ad benefit requir user literaci multimod displai multimod input tion text graphic inform methodolog realiz goal graphic suggest appeal multimedia present advantag natur languag graphic find pave capabl natur languag nonverb behavior eca kiosk advantag refer actual physic object real world feiner mckeown make similar distinct function pictur word pictur describ physic object languag adept convei inform object relat research led system gener text graphic fly gener multimedia tailor tion base type commun act requir principl level mean replac graphic physic object involv interfac share eca refer object real world natur languag gestur spatial refer design interfac capabl spatial approach virtual realiti intellig medic interfac design surgeon interact virtual sue organ achiev continu voic recognit coupl gestur input point grasp simul medic instrument interfac user share virtual realiti eca kiosk idea slightli direct obviat head mount user interfac share physic realiti real world implement closer creat share physic devic accompani pda tour guidanc system refer object recommend exhibit interest interfac primarili accent charact icon give ad familiar vicin comput exchang inform kiosk present inform comfort natur user eca kiosk concept natur interact step anim charact capabl user spatial eca kiosk share spatial refer user abil refer space multimod address quickset user refer map pen voic input user creat open space map draw area multimod input user interact system natur intuit manner design creat system user refer share physic similar quickset pen speech multimod input addit user refer map natur physic map serv bridg real virtual world embodi eca serv wide varieti tutor sale examin past reveal strength system tutor eca serv anim pedagog agent taught student procedur task simul environ research anim agent provid kei benefit enhanc learn environ benefit embodi agent serv valuabl navig guid direct student show virtual learn environ repres advanc navig guidanc student develop spatial model subject matter eca kiosk conceiv logic extens eca navig guid virtual world eca virtual eca kiosk system user actual physic interact share physic inform realiti referenc past embodi proven effect engag user shown qualit advantag enabl exchang multipl level inform real time eca real estat agent capabl multimod input output user interact rea found interfac intuit human skill requir introduct carri eca kiosk interfac requir user capabl success public access implement cambridg research laboratori explor concept embodi creat peopl obtain inform public space began tradit public access enhanc anim head speech kiosk track face pass user deploi kiosk public foremost lesson learn peopl attract anim face watch crl avatar attract entertain success convei interact content anim head lack abil spatial hand arm reason chose eca visibl torso design mack oviatt inform kiosk admir fail acknowledg mode repres emerg technolog recogn manual head gaze strikingli uniqu differ type inform function integr basic suitabl incorpor interfac style mode simpl analogu requir support simpl translat architectur requir previou work construct comput charact tive particip requir control architectur input output human send receiv tion gaze architectur support transmit inform system speaker watch feedback turn send time modal architectur flexibl track thread commun wai thread ent thread time feedback interrupt occur architectur reflect fact process concentr activ understand synthesi proposit interact inform deal tional inform content commun requir build model user knowledg architectur includ static domain knowledg base dynam knowledg base present proposit inform requir plan modul plan present output manag order present interdepend fact understand interact inform process tail build model current state respect process current speaker listen understood function model explicitli repres function modular principl combin modal function model influenc core modul system oper function modul edg system translat input function output produc symmetr architectur function modal present input output figur illustr architectur properti input devic speech bodi po gaze gestur input manag mack hardwir reaction delib modul understand modul modul interact process proposit process planner figur eca softwar architectur knowledg base model gener modul speech gestur gen action schedul output devic speech bodi po gaze gestur system inform content gener understand limit queri form gestur narr languag plan fly answer utter replac plan complex gener modul simpl sentenc gener earlier gener gestur speech fly directli conceptu gener text gener text beat system nonverb express gener design creat addit requir place gener abil refer physic realiti system awar locat layout physic build locat architectur figur user presenc sensor map sensor speech recognit understand modul reaction modul gener modul figur mack system architectur anim modul anim modul mack plai import role inform kiosk gestur plai role interact gestur map indic tightli synchron anim modul beat system architectur shown figur beat advantag automat annot text hand ey eyebrow inton annot carri interact knowledg base domain discuss demo set behavior gener rule output schedul tight synchron maintain modal model knowledg base languag tag behavior gener behavior suggest gener set behavior elec tion filter set word time behavior schedul figur beat behavior modul translat anim featur give system function mack emploi type speech recognit mit technolog recognit user presenc chair recognit pen gestur paper map tablet tabl sit user mack signal sensori input aggreg process understand interpret mean input understand modul merg separ stream transduc approach user point specif research group mack respond inform group inform understand modul pass reaction determin mack process determin implement state mack put repres individu state input act paramet gener mack output mack default understand modul notifi user mack sensori input user presenc chair input ri mack specif reaction gener modul access inform formul sentenc templat abstract categori reaction modul translat beat gener speech hand head ey map indic multimod includ speech synthesi microsoft lcd projector output direct physic map highlight area draw path graphic output includ synchron arm ey movement mack screen blue robot seemingli share physic environ achiev video camera mount atop screen figur user interact mack displai screen mack direct video feed physic background mack awar physic locat thing point back thumb implement effect drawn result empir studi user direct mack begin give direct rel salient discuss approach mack give direct hand gestur speech face mack project rout map share user demonstr mack venu approxim peopl observ behavior interact person user act mack demonstr trustworthi inform good partner visit media lab mack gave locat point area user turn turn back mack nod mack success engag tain user demonstr mack serv highlight current technic limit area futur search speech recognit error common due extens vocabulari close match error fairli limit grammar account recognit error find origin gestur map protocol focu attent problem user difficulti map mack consist structur determin resolv issu mack demonstr eca interest addit public eca model comput architectur adequ task ing input output modal mode interact refer expert surgic intellig virtual environ multimod medicin meet virtual realiti health care inform ag io pp chi system design embodi embodi ed mit pp pretti protocol afford vol pp gener embodi behavior express anim siggraph lo christian annoi experi intellig chi feiner gener coordin multimedia ieee vol pp glass facilit spoken dialogu system content languag integr text graphic workshop content visual cole acl pedagog interact interact learn intern journal artifici intellig vol pp johnston multimod intent ieee symposium inform research triangl effect ieee commun multimedia explan commun read intellig user mayburi ed san morgan pp hand gestur reveal thought chicago visual landmark give confer spatial inform oviatt interfac process commun vol pp synchron input mode multimod chi interact techniqu public inform confer comput human interact special interest group ergonom societi charl stuart reev media peopl treat media real peopl place cambridg bridg intellig tutor collabor dialogu tenth intern confer ai experi interact inform kiosk casual sumi awar share interest experi intern workshop awar held acm cscw schema spatial schema abstract ed mit tverski verbal tool convei confer spatial inform illustr water automat algorithm synthet acm intern confer san francisco
DB/993 3 interv effici kriegel marco thoma munich munich munich institut comput scienc institut comput scienc institut comput scienc abstract modern applic show grow demand effici dynam manag tempor spatial data constraint handl common approach requir augment index structur support exist relat system relat interv tree emploi index basi easi implement function effici support relat perfectli encapsul data model requir disk block size store oper insert intersect queri produc result height virtual backbon tree correspond current granular data space depend demonstr evalu compet dynam interv access method outperform factor disk access queri time introduct grow demand applic handl tempor spatial data interv occur transact time valid time rang tempor line segment curv spatial applic inaccur measur toler engin hierarch type system handl interv finit domain constraint declar system permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow intern confer larg industri commerci integr rdbm ordbm essenti relat interv tree method effici support intersect report interv overlap queri interv typic extern memori data paradigm relat storag structur basic idea manag data object common relat index access raw disk block directli exploit robust high perform index structur exist advantag index basi augment intern data structur interfac sql level arbitrari rdbm immedi support techniqu proper integr exist rdbm essenti aspect industri commerci applic relat index strong perform integr transact manag recoveri servic concurr free lot implement effort code mainten avoid relat storag structur contrast typic extern memori solut effici due logarithm complex underli relat system rang queri point data rdbm qualifi weak requir typic implement popular virtual backbon structur origin method store interv relat high effici achiev addit effici support perfectli fit facil modern dbm includ server informix server ibm system support integr declar sql level relat queri optim patent pend manag interv relat index store interv occupi disk insert delet interv requir oper denot disk block size report interv intersect queri requir height virtual backbon reflect current granular data space number interv top good analyt empir perform superior competitor paper organ section survei relat work interv manag section introduc structur relat interv algorithm queri process present section section discuss integr ordbm evalu section paper conclud section relat work varieti method publish interv manag address tempor applic section survei interv handl gener special work structur transact time interv omit due lack space main memori structur context comput data structur support interv data develop segment tree prioriti search tree mccreight interv tree popular recent develop includ interv skip list hanson al major main memori resid data structur meet characterist secondari storag access small portion structur resid main memori time concept segment index overcom problem combin optim interv structur effici index techniqu approach paradigm exist index structur extend typic requir custom secondari storag structur secondari storag structur varieti secondari storag structur interv present literatur typic base augment exist index definit share limit support integr exist system commit commerci structur integr index extens user time index kim index structur valid time interv set linearli order index point maintain bucket pointer refer set interv interv regist index space requir store interv due time complex insert delet interv intersect queri process interv ang tan develop overcom weak time index regard implement interv tree augment binari tree origin main memori model transform effici secondari storag structur preserv optim space time complex disadvantag avoid complex structur interv tree dedic structur level augment support commerci interv secondari storag model interv tree differ interv tree fact lower bound interv primari kei queri refer upper bound interv meet support complex insert delet find singl intersect interv queri retriev intersect result scan intern node cover queri rang worst case time complex minimum interv tree concept time split introduc success heurist avoid larg scan augment obstacl integr commerci system ooi lu base transform interv triangular space duplic avoid index suit append interv data space grow dynam upper bound access method highli special suggest integr exist dbmss support similar map organ grid file present extern memori interv tree arg vitter extern interv tree backbon tree disk block size interv store list list structur requir page support insert delet requir answer queri report optim complex experi demonstr integr exist system support origin interv index structur index structur emploi task manag interv spatial access method variant includ behav interv long durat high overlap interv tempor applic induc sever perform problem solut sketch segment stonebrak combin main segment tree secondari split algorithm cut long interv span portion portion produc redund author recommend combin skeleton index perform data space order improv queri process perform perform similar skeleton version yield improv augment implement requir adapt structur provid exist target dbm approach special index structur suggest al relat storag structur method immedi meet core requir index structur augment index introduc structur integr typic support exist rdbm techniqu ramaswami static solut interv manag problem emploi optim complex space queri achiev updat nontrivi upper ad delet arbitrari interv deterior queri effici structur practic result demonstr tile index approach provid spatial product relat implement linear spatial object index fix level result tile set tile cover geometri intersect queri perform index sequenti scan tile appli tile index techniqu map interv set segment store find good fix level expect data distribut fix level set redund emerg due small low fix level overhead scan larg tile inappropri set time vastli fix level set index creation adapt chang data queri distribut requir dataset anew major drawback share transform goh al base encod interv curv call map boundari point linear space redund space complex data space upper bound explicit featur lower bound support solut remain unclear perform result report paper complex queri algorithm linearli depend resolut space method logarithm depend resolut dynam refin resolut support ist closer structur reveal strong correspond relat composit index quantiz composit index interv bound correspond index intersect index reveal poor queri perform select reli secondari attribut index intersect queri worst case complex simul index support queri refer interv length approach nascimento dunham behav similar ist composit index implement index static partit interv length intersect queri process requir long interv custom access method ordbm modern commerci ordbm informix server server ibm support logic custom system develop extens framework seamlessli bind access method queri optim queri applic program interfac physic layer block manag absenc gener search tree framework develop option store custom index structur extern file techniqu excel perform extern file particip transact manag develop implement maintain block manag includ concurr control recoveri servic altern store index singl larg object requir extens implement mainten builtin lock mechan entir environ natur avoid technic problem exploit function server map index structur fine granular relat schema organ access method follow approach present paper effici index structur interv data design oper logic top relat queri languag dbm code implement maintain minimum effort techniqu stabil transact show logarithm worst case complex interv intersect queri demonstr measur perform compar previou approach relat interv tree introduc relat interv effici implement interv tree top relat system origin interv tree structur interv tree optim data structur interv regist interv segment redund produc space complex structur illustr figur backbon tree primari structur balanc binari search tree organ valu bound point interv node list form secondari structur sort list lower upper bound interv interv regist highest node node hold descend tree tertiari structur addit binari tree support fast rang scan link node list nonempti structur relat interv tree basic idea techniqu reli primari structur materi nonempti node link tertiari structur dynam data space manag physic tree structur show system paramet occupi space requir figur structur interv tree secondari tertiari structur combin relat highli fit strength composit index provid rdbm space complex interv secondari structur map relat schema denot list lower nw bound nw interv regist node inform repres set tupl union node yield nw relat list upper bound correspond nw yield relat nw relat reflect inform secondari structur relat effici organ composit index index typic robust highli tune obei transact semant outperform userdefin structur kei compress techniqu avoid redund equal node valu index manag nonempti tertiari structur result relat schema attribut support composit index interv relat prepar ad singl attribut node index figur present respect ddl statement sql artifici attribut node omit base tabl encapsul tabl index creat tabl interv lower upper id creat index interv creat index interv figur sql statement instanti updat relat interv tree regist interv complet manag relat remain task primari structur organ data space order manag insert queri process origin interv tree root lower fork upper figur fork node interv tree built static set bound point interv dynam interv insert delet actual bound point advanc tempor applic requir ongo data space gener adapt techniqu requir solut simpl materi set primari structur manag pure virtual bound point interv restrict valu entir rang support reorgan structur insert delet interv basic root node set tree simpl integ arithmet consum oper interv regist topmost node call fork node extens origin interv interv begin end node leav point repres interv procedur determin fork node provid figur comput control step width depth tree function int int int node step step step node node return figur comput fork node interv fork node insert interv relat index effici perform dbm singl sql statement execut hold delet interv todai rdbm typic perform oper interv insert interv valu figur insert interv dynam data space basic data space fix rang valu yield tree height complex updat independ cpu time complex linearli grow suggest solut combin tree height adjust actual data distribut data space expand dynam upper requir typic tempor applic top data space lower bound support tree height affect root node search tree depth algorithm descend tree order control minimum tree introduc system paramet root dynam adapt paramet root yield tree height data space expand upper bound interv arriv root suffici manag interv lower upper adjust insert affect exist offset optim root height hold actual data space start locat rang origin result tree height height suffici data rang length shift interv lower bound data optim root height opt obtain amount shift store paramet offset chang offset paramet recalcul node valu store tree avoid unnecessari offset fix insert interv interv leftmost begin data arriv insert space expand lower bound upper bound global root manag left neg posit node singl paramet paramet maintain manag data space lower bound upper bound independ paramet trace lowest level min insert interv place level leaf level queri algorithm descend deeper level min structur node lower level empti estim obtain interv lemma interv regist level largest cardin proof assum interv regist level success multipl multipl multipl interv regist lower level contradict assumpt figur present final insert procedur includ updat persist tree paramet artifici node shift lower upper bound interv store modif paramet initi set initi infin minimum store implement integ work procedur int int initi offset shift interv offset int lower upper updat descend tree fork node int node node fork node node step step node node fork reach node fork node step insert interv valu figur insert interv updat tree paramet analysi tree height paramet form primari structur dynam adjust cardin current data space includ global root result tree height formula minimum term data tree height determin rang reflect data space regist granular data smallest interv proper handl point repres interv greater lower small interv regist high root node tree height depend number interv term interv tree height obei upper lower queri process present intern structur relat interv tree introduc algorithm queri process origin intersect search shortli review algorithm intersect queri process origin interv tree queri interv primari structur descend descend root node node fork node queri interv node path li left queri interv interv regist intersect queri interv lower report rw sort list upper bound scan time scan interv fulfil upper symmetr case upper descend fork node node closest lower node case scan report intersect interv regist lower queri interv intersect interv regist node interv report fork node descend fork node node closest upper analog step list regist interv respect node report note algorithm work lower support point queri effici interv queri figur illustr algorithm node tree affect search depict symbol root scan scan report lower fork figur queri process interv tree upper node node entri report note node cover queri lower upper translat singl sql queri basic idea approach exploit effici relat index scan list immedi translat index rang scan attribut attribut combin manag defin scan node lower upper support index immedi scan list descend algorithm respect node collect transient list obei unari relat schema transient relat manag transient session state effort interv insert virtual primari structur descend integ arithmet oper singl sql queri suffic retriev intersect interv basic version queri shown figur select id interv offset figur sql queri retriev intersect interv illustr figur node node lower upper distinct condit disjoint interv distinct option omit select duplic elimin simplifi sql queri transform typic perform relat optim split complex set simpler queri connect union queri effici support respect index index intermix subqueri address attribut support index order reduc cost intern queri combin subqueri subqueri lemma analog hold subqueri lemma condit substitut condit tween loss effici index scan condit offset restrict ad constraint proof obviou index scan search hit test proce test condit offset hold interv condit offset impli modif queri transient relat obei binari relat schema unari schema descend node insert pair singl includ origin pair upper insert lemma interv miss transform figur present result sql queri intersect search produc duplic select id interv left union select id interv figur final sql statement intersect queri figur show execut plan queri gener server rdbm provid easi queri plan chosen optim attribut id includ index analysi algorithm section observ tree height depend paramet determin quotient extens interv data space minim interv length depend number interv regist tree tree height upper bound number entri transient relat select statement nest loop collect iter index rang scan nest loop collect iter index rang scan figur execut plan intersect queri oracl entri transient index rang scan perform index rang scan consist phase search begin rang ρ scan ρ result object rang report typic index structur relat system requir oper search phase ρ scan phase report ρ result rang ρ theorem queri intersect queri relat interv tree height return result interv tree complex log bn proof entri transient relat index search complex perform scan report total result requir oper conjectur complex optim manag interv relat storag structur gener topolog queri addit intersect queri tempor relationship interv queri base special predic effici support relat interv tree addit potenti optim refer lower bound meet refer upper bound compet method ist effici support queri refer interv lower upper queri refer opposit bound process poor perform comparison requir worst case handl tempor interv context tempor special valu infin occur upper valu valid time interv straightforward solut manag interv separ yield major disadvantag addit sql execut overhead avoid manag valu fork node achiev natur integr relat interv tree infin set fork node infinit interv modifi algorithm tree high empti close root slight effect extens avoid result overhead queri artifici fork assign attribut node infinit interv queri process fork insert transient list lower bound interv end infin test upper bound queri interv desir note fork condit figur evalu correctli choic set fork avoid modif sql statement yield perfect integr infin constant interv end continu chang upper bound aim correct posit interv tree time requir perman modif node valu tree solut complet avoid overhead artifici node fork assign interv insert queri process fork insert transient tabl lower queri interv begin past sql queri test lower bound interv upper bound queri interv wrap relat interv tree easili implement top relat dbm featur procedur queri languag server informix server persist data dictionari conveni store index specif system paramet root queri tabl effici manag transient user session state mention section insert delet interv requir singl sql statement comput storag fork node updat index paramet perform automat trigger complet index mainten manag trigger queri process start manual invok store procedur modern dbm provid solut preserv declar paradigm sql queri mainten access procedur custom index structur complet hidden user extens index framework develop packag implement access method index data base server automat trigger mainten scan custom end user relat interv tree index cost model regist server gener effici execut plan queri interv data type evalu setup evalu perform integr relat interv tree oracl server packag store procedur experi execut pentium server mb main memori hard drive block cach set default block block size kb evalu perform interv intersect queri interv data distribut cardin tabl bound point interv lie domain distribut assum transact time valid time interv arriv tempor tupl poisson process time distribut exponenti start point distribut durat distribut uniform uniform exponenti poisson process uniform exponenti tabl sampl interv cardin mention section wide rang exist interv access method static list approach tile index transform techniqu design exist intern modif augment restrict perform comparison techniqu queri list produc oper dynam techniqu static storag investig evalu dynam structur tile index recommend hybrid index method tile document ensur compar reimplement hybrid index packag data space version complex show perform gain origin index entri data distribut ist db size implement tile index interv domain fix level paramet set repres sampl interv individu data distribut determin optim set fix level optimum queri perform found level transform experi implement transform integ interv bound index composit index attribut ident perform characterist rang queri interv express simpl sql statement test upper lower bound intersect queri present figur select id interv figur rang queri transform index figur number index entri vari size relat interv tree implement relat interv tree previou section data distribut tabl interv length granular respect data space maxim system paramet reach minimum index creation virtual backbon tree expand height note storag occup perform experi compar ist illustr storag occup techniqu figur distribut ist techniqu produc number index entri equal physic time data distribut queri select figur disk access time rang queri data distribut queri ber index interv requir index entri store interv cf figur redund factor index interv accur experienc major perform storag problem larg interv queri process queri experi subsect perform queri interv distribut compat respect interv experi compar number physic disk block access time access method depend select rang queri figur depict polynomi interpol result rang queri distribut queri select outperform techniqu factor disk access speedup factor relat interv tree show superior perform high low queri select fast time ist good cluster ist queri select ist physic time data distribut queri select db size figur disk access time rang queri data distribut properti bulk load index deterior dynam environ dataset measur similar result figur compar techniqu dataset grow store interv averag number disk access averag time rang queri present ist demonstr linear scale show perform gain access method speedup factor observ similar improv experi data distribut set experi investig influenc dataspac granular queri perform restrict domain interv length distribut minimum interv fewer level virtual backbon due larger valu shown figur time ist ist db size time data distribut restrict minimum length store interv figur time rang queri select restrict dent minimum length store interv result height virtual backbon empir time select illustr desir properti perform queri larg bound number result seri experi compar influenc interv durat queri perform techniqu figur depict averag result sampl rang queri dataset averag length interv requir time rang averag length index interv low short interv suffer spatial redund tile approach interv durat reduc pure point perform slightli benefit obviou higher durat ist perform longer interv store time data distribut queri select averag length store interv ist figur time data distribut vari interv length small outperform approach time figur time point queri data distribut ist higher distanc upper bound data space locat queri rang respect data domain exert strong influenc perform ist figur illustr effect queri point start upper bound data space bound index benefit high select index column comparison reveal interest aspect point queri perform retriev duplic slightli averag obtain result interv data distribut data distribut queri select queri point upper bound data ist present relat interv tree access method interv data creat relat tabl interv main design goal approach integr concept easili implement top relat dbm function index exploit addit intern layer server made effort code develop code mainten minim modern server featur applic program natur seamless integr achiev preserv declar paradigm sql perform analyt evalu show superior perform characterist compar previou approach achiev introduc virtual primari structur structur storag interv storag space wast empti region data space extens basic concept support wide rang effici applic specif extens illustr dynam data handl special tempor variabl discuss topolog queri type flexibl extens concept open number interest research problem applic extens applic skeleton index techniqu partial materi primari structur adapt expect data distribut manag string interv support refer ang tan interv inform process letter arg vitter optim dynam interv manag extern memori proc annual symp foundat comput kriegel curv object spatial extens proc int symp larg spatial lnc beckmann kriegel schneider seeger effici robust access method point rectangl proc acm sigmod int conf manag index valid time interv proc int conf expert system lnc salteni slivinska jensen develop datablad index proc ieee int conf data cormen leiserson rivest introduct algorithm dynam rectangl intersect search institut inform process report technic elmasri kim time access structur tempor data proc int conf larg bayer manag queri process interv tree phd conf extend faloutso roseman fractal secondari kei retriev proc acm symp principl goh lu ooi tan index tempor data exist data knowledg guttman dynam index structur spatial search proc acm sigmod int conf manag hanson johnson select predic index activ interv skip list inform hellerstein naughton pfeffer gener search tree system proc int conf larg hellerstein pfeffer index structur set technic report wisconsin oct ibm ibm applic develop version informix datablad develop kit guid menlo ramaswami vitter index data model constraint class proc acm symp principl kriegel relat interv tree patent applic stonebrak segment dynam index techniqu interv data proc acm sigmod int conf manag lee tempor grid file structur interv data data knowledg manolopoulo theodoridi tsotra advanc index chapter access method interv nascimento dunham index valid time ieee tran knowledg data engin oracl spatial cartridg guid rel redwood oracl data cartridg rel redwood oracl spatial guid rel redwood preparata comput introduct ramaswami effici index constraint tempor proc int conf lnc sharma experi extens proc int symp larg spatial lnc samet design analysi spatial data structur samet applic spatial data structur shen ooi lu dynam effici index mechan tempor proc ieee int conf data selli roussopoulo faloutso dynam index object proc int conf larg tansel clifford gadia jajodia segev snodgrass tempor design implement redwood
IR/994 5 output code text classif adam berger school comput scienc carnegi mellon forb pittsburgh pa abstract paper appli output code task document categor recent ai method multiwai classif problem binari classif combin result subtask solut origin problem recent interest machin learn commun algorithm integr subordin predictor singl output code techniqu provid result extract demonstr ecoc offer improv accuraci convent classif algorithm introduct output code recip solv classif problem work independ construct subordin remov uncertainti correct class appli vote scheme decid correct output weak learner recent work shown ecoc offer improv standard classif method domain rang cloud classif aha speech synthesi bakiri number theori success explor applic output code document categor idea larg number classifi number recent machin learn literatur techniqu involv gener multipl train set sampl learn classifi gener learn classifi vote correct class unlabel object boost view special case bag sampl concentr misclassifi train instanc freund vote method appli combin multipl neural network train data appli type classifi problem consensu algorithm work practic open question step theoret work recent establish combin multipl run classif algorithm reduc varianc unlik vote constitu classifi output code arent solv solv distinct binari classif problem kong shown properti ecoc algorithm addit properti vote abil correct bia constitu classifi paper appli ecoc problem text annot label set learn map document label text categor automat assign index term medic research paper yang central concern field bibliometr recent flood onlin text interest applic text categor classif research address problem learn collect interest post electron discuss group base user automat classifi web page content craven suggest web page user base express prefer pazzani focu restrict version gener classif imagin document correct mean map function emploi section addit conveni label repres data method naiv classif highli outperform techniqu excel section demonstr output code consist outperform naiv experi report suggest ecoc util domain paper proce section introduc techniqu output code applic text classif ecoc classifi reli binari section discuss select matrix section describ seri experi valid claim ecoc offer improv standard classif techniqu section relat ecoc naiv highperform classif section conclud outlin direct futur work text categor output code describ techniqu output code simpl task classifi newswir articl categori assign uniqu vector label log label code polit sport busi art view ith uniqu code label reason refer set code denot ith row write jth bit row ij step construct ecoc classifi build individu binari classifi column classifi case posit instanc classifi document label ij distinguish document label sport art label polit busi refer gener algorithm predict singl bit predictor document belong fix subset class algorithm train ecoc document classifi document label distinct desir code size log code matrix classifi gener code matrix construct consist label ij complement set construct binari classifi distinguish train ecoc classifi consist learn set independ binari classifi correct class unlabel document evalu independ classifi gener vector gener row closer ham distanc row categor document involv select argmin label closest row equidist select gener document receiv label busi extent row ham classifi robust pic idea code transmit point cube reliabl noisi map set recov origin find closest fix point point receiv origin cube algorithm appli ecoc document classifi train ecoc code matrix classifi unlabel document label comput confid pic believ calcul ij output argmin measur classifi confid document belong jth superclass search nearest neighbor ham distanc experi report section classifi output comput nearest neighbor distanc naiv classifi pic reli heavili construct ecoc classifi naiv classifi naiv assum document gener select label prior distribut independ select word document distribut probabl gener document fw wn word label naiv classifi select unlabel document argmax argmax argmax equal law ecoc classif standard classif algorithm backpropag rumelhart suit distinguish outcom natur combin algorithm predict outcom construct independ assign predictor task decid ith outcom obtain build construct individu posit exampl classifi document label appli classifi unlabel document select argmax label classifi produc highest score call versu rest strategi method special case ecoc classif ident matrix expect ecoc classif outperform problem learn classifi fruit imagin label set exampl train individu yellow fruit learn strong associ yellow color provid yellow train classifi close object question round red encount train close system misclassifi object ecoc classif distribut output mean subordin classifi wont necessarili result misclassif circuit ecoc reduc varianc individu classifi classif includ exponenti neural network capabl directli perform multiwai classif reason classif strategi algorithm construct monolith classifi monolith classifi face difficult task imagin class cloud featur singl classifi learn boundari pic ecoc classifi learn small number boundari suffici ecoc classifi learn boundari forgiv pic place input wrong side boundari kong good code empir work establish jame ecoc classif perform code matrix construct entri ij uniformli random section statist combinatori argument statist perspect pair empir distribut classifi argmax classifi assign document label term classif accuraci classifi strategi present reason assum document dont occur multipl time label classifi simpli select label document train document label access classifi appli classifi classifi turn definit theorem suggest classif algorithm built subordin classifi consist consist classifi construct accur pic accur properti achiev ecoc classifi theorem state condit achiev theorem assum construct ecoc classifi consist theorem ecoc classifi arbitrarili consist ecoc classifi doesnt pic arent produc estim theorem suggest random construct perform combinatori perspect code present earlier unfortun properti tenth column equal classifi learn task permiss desir permiss row code distinguish label binari code suffici probabl event code label probabl log approach quickli row close ham ecoc classifi built apt label write ham distanc row min minimum distanc codeword pic produc binari ecoc classifi recov min incorrect pic output earli work output code algebra code famili linear code matrix linear subspac vertic defin span binari matrix call gener matrix code measur minimum distanc linear combin code popular class linear algebra properti codeword linear combin row separ matrix ecoc classif reason earli work ecoc classif gener matrix code code ecoc valid codeword row binari linear combin thereof codeword linear code directli relev find good ecoc code subsequ ecoc work establish random matric outperform code theorem provid combinatori observ theorem binari matrix exist row differ bit proof minimum distanc row matrix select row replac select column probabl ik jk diff select column select row replac probabl ik jk greater combin inequ solv result show rel space half optim squar exist explicit construct achiev matrix gener matric awar explicit construct meet result suggest random construct good separ theorem defin binari matrix row minimum rel ham separ log probabl binari matrix proof fix row defin random variabl ae correspond ham distanc row interest probabl ae log log row probabl pair row close pr attent ecoc literatur gener concentr find good row equal import larg separ column column close give rise classifi perform extrem equal column ident classifi simpl chang theorem show random matric good column separ provid justif construct code randomli result appli output code classif text extract internet corpora subject remov convert date monetari amount number canon map word remov word occur tabl summar salient characterist dataset ffl collect cull post usenet discuss group document approxim evenli distribut label ffl dataset web page gather larg number comput scienc depart craven page manual classifi categori ffl yahoo baker automat extract entir yahoo scienc hierarchi earli form label collect class hierarchi level newsgroup dataset publicli collect document label word newsgroup yahoo scienc yahoo health tabl train dataset dataset partit separ time number statist trial column report number distinct word exclud ffl yahoo corpu collect scienc characterist class highli present difficult task classif algorithm label collect health hospit medic health care figur plot ecoc classif accuraci code size corpora code construct select entri uniformli random case column random permut vector implement larger incur penalti speed issu system text filter system design rout relev articl prefer figur suggest larger valu offer accur classif accuraci doesnt tail case learn algorithm prone overfit number paramet larg dataset collect ecoc classif didnt outperform naiv classif ecoc classifi perform collect error rate steadili point simpli column add collect label data model estim set standard naiv method highli competit naiv classifi pic ecoc classifi figur dataset naiv lack data ey explor classif approach ecoc pic train binari tree predict individu bit ecoc question node tree form word expect classifi match report perform mccallum provid evid classifi word occur document occur tend perform classifi access word count inform bit newsgroup figur perform ecoc classif function code tree pic bernoulli event model account multipl word document point reflect singl trial random partit newsgroup collect horizont line tree perform figur show suffici high combin tree ecoc classifi improv perform tree applic ecoc dataset point accuraci monoton improv isnt case figur plot accuraci code size partit method figur set test random partit web page washington effect make problem automat classif techniqu exploit notabl featur plot spike error rate rest result behavior bit code accomod entri place codeword adjac ham leav room error label code depart faculti project staff student tabl bit code partit experi subset code doesnt distinguish bit doesnt distinguish bit newsgroup bit bit yahoo scienc bit yahoo health figur perform ecoc classif function code size naiv classifi serv pic point reflect averag random bar measur standard deviat trial horizont line behavior standard naiv point averag trial random random split data bit partit figur accuraci code size singl trial partit dataset pic naiv classifi notabl behavior plot tabl show bit code notic bit dont distinguish student figur show occur largest prior ecoc predictor construct naiv pic effect predict class distribut test reflect figur highli skew spike codeword diverg code make document belong code correctli identifi project huge cost shown figur unusu behavior inconsist distribut label train test choic discuss result previou section suggest classifi perform improv simpl calcul show assum moment pic output binari error commit pic independ denot probabl error ith max train student faculti staff project depart evalu student faculti staff project depart document figur left distribut label train data partit collect test distribut test accuraci classifi logarithm scale clariti differ train test choic lead code strongli outperform code minimum distanc min classif robust min fewer probabl correct function quantiti min term binomi monoton min code section show eventu mean assumpt error uncorrel individu classifi train data expect correl column code present section relat naiv strategi special case ecoc classif difficult standard naiv approach implement ecoc classif notic naiv predict class requir construct classifi consist prior distribut select label amount code ident appli algorithm norm relat neighbor popular approach text competit larg nearest neighbor knn reli map document vector entri word count list featur valu knn classifi store imag train set document classifi unlabel document knn find vector closest weight vote label knn ecoc superfici similar classif data structur consist set search data structur linear size data structur import size train set ecoc data structur consist singl vector knn store vector document train set applic output code problem automat text categor recent avail onlin text lend extra suggest sourc data experi report section conduct data gather internet experi offer compel empir evid effect ecoc text categor paper report initi proof concept experi unexplor belief code theori classif class code digit transmiss robust fraction lost bit pic produc view classifi suffici ecoc classifi ignor attempt recov label document present evid suggest benefit random set expect structur code prefer perform search high space prohibit system reap benefit output code conduct full search determinist code user replac exhaust search search slight cost accuraci digit encod cd digit cell structur code theoret argument argu favor random code predic error made individu predictor uncorrel textual data strong classifi ignor astronomi space class yahoo scienc categori strong overlap word matric classifi construct data direct improv combin ecoc approach form word document design code captur inher data code reflect hierarch decomposit determin document belong astronomi decid class acknowledg author adam john kamal nigam suggest earli russel blum suggest lead materi section research support part ibm cooper fellowship refer aha aha bankert cloud classif output code artifici intellig natur baker baker mccallum distribut cluster text classif bakiri bakiri dietterich achiev machin learn data mine speech breiman bag predictor machin breiman arc classifi technic statist stanford craven slatteri learn extract symbol knowledg world wide web nation confer artifici intellig freund freund schapir gener learn applic boost journal comput system jame jame hasti error code method journal comput graphic jame major vote theori applic phd stanford kong kong dietterich output code correct bia varianc intern confer machin page lang learn filter intern confer machin page lewi naiv independ assumpt inform retriev european confer machin sloan theori code north mccallum mccallum nigam comparison event model naiv text classif workshop learn text pazzani billsu syskil identifi interest web site nation confer artifici perron improv regress averag method varianc reduct extens gener convex measur optim phd brown quinlan combin learn intern confer machin learn morgan rumelhart william learn backpropag error yang yang chute applic expert network clinic classif medlin index annual symposium comput applic medic care volum page
IR/995 5 open hypermedia lesli wendi hall multimedia depart electron comput southampton uk abstract paper describ attempt project defin deploi conceptu open hypermedia servic consist ontolog reason servic repres sophist conceptu model document term open hypermedia link servic offer rang facil scalabl integr form conceptu hypermedia system enabl document link metadata describ content improv consist breadth link www document retriev time reader author time author creat keyword open link metadata concept metadata metadata data describ data enhanc librari catalogu schema canon exampl metadata fall broad catalogu artist structur pictur color semant person hold joi copyright held hong kong acm sean carol gobl inform manag group depart comput scienc manchest oxford road manchest uk metadata activ major focu interest www inform publish digit librari extens markup languag concern applic express data recent defin resourc descript framework aim rdf provid standard framework express statement data statement give inform version keyword inform attribut standard dublin core ontolog formal model kind concept object real relationship ontolog varieti hierarch classif scheme directori model form includ vocabulari term specif mean term metadata link provid conceptu inform attribut web page import enabl search engin provid queri result pertin concept simpl keyword hypermedia system distribut link servic make inform provid rudimentari cluster document tag keyword retriev link document tag navig keyword effect classifi document cluster share set variat stem achiev kind associ requir nontrivi web document link dimens base content construct link manual inconsist obfusc chief reason associ content similar conceptu hypermedia system hypertext structur behaviour term conceptu schema type document includ conceptu domain model describ document content inform hypertext repres explicitli metadata reason domain model classif structur classifi document share metadata deem similar author link document activ author concept link document link open hypermedia system link servic common usag web involv link document html web consid hypermedia system inher web infrastructur prevent hypertext link abstract document manag link open hypermedia system link class store manag separ multimedia document cach instrument research hypermedia commun increasingli web publish applic adopt open hypermedia approach dl power framework aid navig author address issu distribut inform manag intermediari model dl add link annot document deliv proxi origin www server ultim client browser number softwar modul recogn opportun ad kind link creat navig overlai coher interfac set unlink resourc archiv address open citat project dl treat link creation resolut servic provid number link resolut engin resolv recogn peopl bibliograph citat potenti link anchor heurist knowledg base link resolv hardwir monolith system chain sequenti document link ad previou resolv inher synchron arrang mean delai delai critic path document process tightli coupl distribut link resolut servic link resolv distribut multipl server decoupl deliveri document aim complex involv implement conceptu inferenc logic provid ad document author deliveri core document queri system ad portfolio link resolv provid consist navig link base concept content multimedia page link servic integr browser consist java applet monitor interact browser set javascript function manipul html dom compon link servic brought bear web page receiv longer form obstacl deliveri document set link page refresh figur ontolog servic map natur languag term concept graph resourc servic obtain web page repres concept link gener ontolog term make link editori knowledg prune expand link ontolog semant figur ontolog servic map natur languag term concept graph resourc servic obtain web page repres concept link gener ontolog term make link editori knowledg prune expand link ontolog semant figur ontolog servic queri term concept relationship ontolog servic java shown oper figur manag set concept relat schema ontolog form concept relat store xml queri result mediat simpl xml document type link gener modul link servic contact ontolog servic obtain complet list languag term repres concept ontolog term occur gener ontolog servic prefer prefer term map concept identifi concept string link gener contact resourc servic obtain list document instanc concept number destin identifi link anchor editori modul evalu number qualiti potenti link obtain figur page figur term link correct number destin gener number link consist format request broader narrow term ontolog servic order expand cull set anchor destin term document constructor add hypertext link present style behaviour figur show link ad document control panel figur link behaviour shown debug link expand document metadata servic independ servlet document decor languag term specif ontolog servic harvest specif tag document appli extern document independ effect declar rang process specif region content correspond term ontolog figur link cloth figur prune part link resolut process editori knowledg compon advantag implicit structur ontolog make inform kind link make select set list link usefulli reduc whilst broaden concept strategi number link altern approach concept predefin ontolog candid anchor creat link section list system concern manipul wai repres mode deploi meta tag tag author inform web resourc highli uncontrol tag unconstrain term varieti page special thing applic metadata tightli bound document order discov metadata examin document central metadata process web robot harvest cach metadata figur simpl meta tag index duplic metadata easi access web issu mainten crucial difficult index date repositori index simpl gener ontolog list arbitrari keyword yellow page yellow page page classifi content taxonomi hierarchi subject area broken gener achiev classif hierarchi categor page manual page situat metadata store extern document real link classif figur yellow page problem classif date autom approach gear support human locat resourc provid knowledg shoe simpl html ontolog extens develop parallel understand system group depart comput scienc maryland shoe mechan definit ontolog assert claim resourc respect ontolog assert web page includ page html base meta tag inform agent page shoe assert form instanc assert membership class relationship instanc figur shoe shoe shown figur inform spread metadata attach explicitli document shoe html gather place robot queri browser user examin metadata situ reach shoe annot page ontobrok ontobrok system architectur karlsruh similar wai shoe annot web page ontolog metadata express framework specif annot data queri ontobrok shoe share characterist annot document reli web crawler harvest store knowledg base kb queri ontolog schema queri form differ coupl aspect shoe ontolog extens mechan explicitli place ontolog web clear gain access ontobrok ontolog make link instanc markup ontolog appli ontolog describ content document multimedia repositori metadata construct author present fit user metadata index emphasi ontolog order structur result close relat ontolog produc structur rdf rdf descript differ system shoe ontobrok framework implement system system ontobrok rdf format compar rdf framework talk metadata rdf data model base idea relationship intent rdf metadata held separ document attribut separ figur metadata document rdf document repositori access figur rdf figur show rdf descript work note rdf simpli number wai thing put rdf prescript ontolog specif rdf order minimum data set dublin core clear ontolog sit web rdf document form repositori collect metadata number resourc combin distribut link servic architectur conceptu model provid conceptu open hypermedia independ resourc metadata storag concept refer web resourc identifi match potenti navig origin dl abil map languag term hypertext link destin govern exist hypertext link process driven concept ontolog prototyp differ system rdf shoe support provid extra inform link exist web page note confin set web page specif web long mechan concept document involv simpli match word term extend addit explicit metadata resourc discuss system focu primarili metadata inform discoveri intend make metadata annot order build construct hypertext discuss issu relev issu discoveri versu author conclud describ space metadata applic base rich model system close system link associ resourc fix origin author tag html open system addit extra structur resourc document necessarili direct manipul amend origin proxi similar add link metadata resourc read approach metadata provid metadata resourc discoveri resourc annot metadata describ content user queri metadata order find present result open hypermedia concern resourc author process construct hypertext link ad metadata close world manner repositori metadata exist queri order discov find resourc discoveri close metadata thing resourc locat ad metadata framework resourc describ link resourc open metadata resourc figur show benefit ad metadata approach close metadata link resourc open metadata induc link resourc author resourc discoveri implicitli target link obtain figur ad metadata prototyp differ system support extra inform link exist web page note confin set web page link servic deal web long mechan metadata document involv match word term recognit explicit metadata resourc ontolog simpl richer model emploi stage project hypertext approach conceptu metadata web concern resourc discoveri user locat resourc inform web treat huge hypertext structur link resourc locat base content markup indic line link search blur gener resourc discoveri approach sit firmli search end spectrum contrast intend address problem construct hypertext build simpli provid resourc discoveri metadata annot discov author system agent locat resourc annot result simpli present rank list metadata index mechan link metadata author return notion link ad sourc document result metadata annot resourc determin metadata ascrib determin relev simpl index process retriev resourc index question approach involv insert metadata document repositori kind queri space metadata approach section focu issu metadata annot web resourc question metadata resid examin exist approach introduc space compar system term distribut addit materi notion express metadata figur attempt classifi metadata approach fit relat repres rich metadata move keyword ontolog final underli reason descript repres open distribut intent move simpl standalon file system distribut addit link final open hypermedia classif thesauru static hierarchi order index web resourc platt demonstr applic sit web open hypermedia point link gener runtim metadata model simpl keyword tambi system suppli access distribut inform sourc net descript logic model dwq wareh project descript logic approach problem improv schema integr distribut link servic keyword anchor ad link document figur metadata space dimens improv dimens improv gain addit metadata structur shown figur metadata rich author provid descript turn enabl reader pose richer queri meet inform searcher addit structur author power jump open hypermedia architectur enabl link author provis metadata holi grail upper hand corner graph open hypermedia richli express model reason futur work ontolog structur space languag term consist keyword descript difficult creat subsequ lead model concept inaccur document interpret commun develop control base thesauru languag art architectur thesauru wordnet gener languag thesauru base semant net acm comput classif system base abstract hierarch classif scheme classif scheme hamper larg static unsound singl classif hierarchi resembl base systemat ontolog declar specif concept principl linguist term phrase rigor fix interpret attribut human interpret lack make hard queri check extend principl reason terminolog resembl collect elementari concept assembl formal rule creat composit concept effect terminolog repres knowledg scheme express support dynam automat classif complex composit concept base scheme descript logic convent frame semant network logic concept subsumpt satisfi reason servic offer dl flexibl construct evolv conceptu network retriev stage develop ontolog servic incorpor dl control updat mainten ontolog encount term web system conceptu model form link document explicitli navig classif scheme implicit issu present render visibl ontolog link queri construct inform navig impli inform user potenti link document share relat concept user search term control vocabulari control constraint visibl ontolog link queri construct issu investig final editori activ link servic strengthen concept document calcul link concept spread evenli document space ontolog space strategi link cull valid instanc effect kind action depend design construct conclud remark aim conceptu hypermedia servic escap limit pure lexic string match approach link discoveri prototyp success link construct softwar interact independ suit servic fact offer reason altern link candid select link unsuit reason demonstr advantag approach subsequ work improv user interfac link improv sophist ontolog process mainten descript logic acknowledg work support epsrc grant refer transpar access multipl bioinformat inform sourc intellig system molecular biologi canada pp place produc manipul web seventh www brisban support public art galleri collect intern confer workshop expert system applic dexa septemb uk classif base navig pictur archiv ifip confer data kluwer wd terminolog terminolog server inform environ proc ieee conf softwar technolog experi pd model retriev document index express sigir forum pd aid search acm link queri intern project de open inform comput network isdn elsevi de distribut link tool author world wide web journal oreilli associ comput classif system current statu futur mainten report cc updat comput jan conceptu navig world wide acm hypertext june acm san texa ontobrok research advanc technolog digit librari springer verlag lnc xml link languag version candid recommend juli integr link resolut servic queri open hypermedia workshop hall hill distribut hypermedia link ieee comput societi press creation hypertext link document measur retriev effect journal american societi inform fellbaum electron lexic mit isbn access inform sourc world confer www internet hawaii open hypermedia metadata web intern world wide web confer browser proxi support open hypermedia structur mechan www eighth intern world wide web cope chang ontolog distribut aaai confer ontolog manag workshop aaai press knowledg languag internet applic dept comput maryland colleg technic report lagoz harnad develop servic open integr impact link acm confer digit librari concept base design data dwq acm intern confer manag data dalla usa resourc descript framework model syntax specif recommend hypertext engin approach wilei son structur type incorpor knowledg acm hypertext flag taxonomi open hypermedia acm hypertext introduct art architectur dublin core warwick review literatur march septemb lib automat construct manag larg open inform process navig automat link base semant close inform process manag
ML/996 6 distribut data mine issu approach andrea prodromidi comput scienc depart columbia ny philip chan comput scienc depart florida institut technolog fl stolfo comput scienc depart columbia ny abstract data mine system aim discov pattern extract inform fact record wide adopt approach object appli machin learn algorithm comput descript model data explor main challeng research develop techniqu scale larg possibl physic distribut techniqu seek comput classifi classif call integr principl fashion multipl classifi comput separ describ jam agent system data mine applic identifi import desiderata distribut data mine system system addit level complex compar central system distribut system deal heterogen multipl design implement scalabl protocol commun data select inform gather peer data site import data mine system abil advantag newli acquir inform model comput combin exist flexibl incorpor machin learn method data mine technolog explor issu context jam evalu solut extens empir studi introduct abil collect store data significantli abil summar extract continu stream input short list exampl place current situat nasa earth observ system orbit satellit instrument send terabyt data receiv station dai world wide web estim million site million page march year typic fortun compani project possess charact electron requir terabyt mass storag tradit data analysi method requir human process larg data set complet inadequ quot john inform field knowledg discoveri data mine emerg defici knowledg discoveri denot complex process identifi potenti ultim understand pattern data data mine refer step kdd process recent broad definit mine consist algorithm accept comput produc pattern relat typic data mine task explain predict attribut collect tupl attribut valu mean perform task emploi machin learn algorithm exist drawn treat train data learn algorithm comput logic concept descript predict varieti strateg tactic desir target attribut record desir attribut unknown field machin learn made substanti progress decad numer rang base stochast model base pure symbol rule develop appli problem area past machin learn evolv field laboratori demonstr field commerci algorithm deploi heart diagnosi predict level diabet patient detect credit card fraud steer vehicl drive autonom public highwai mile hour predict stock option price comput custom electron applic larg busi institut market analysi firm attempt distinguish potenti custom learn simpl categor classif potenti custom base intellig oper util similar methodolog vast inform sourc predict wide rang condit context data mine techniqu successfulli appli detect system main challeng machin learn data mine develop induct learn techniqu scale larg possibl physic distribut data set organ seek ad data deal overwhelm amount inform number size data grow faster improv machin resourc induct learn techniqu current gener learn algorithm complex requir data resid main memori realist problem notabl except includ ibm sprint algorithm provost hennessi algorithm learn data inher distribut local machin trust varieti practic reason includ secur fault toler distribut data competit constraint law physic mobil platform ship inspect data process site comput primari classifi techniqu recent develop deal problem comput classifi larg inher distribut aim comput number independ classifi appli learn program collect independ inher distribut parallel comput collect combin learn process seek comput integr principl fashion separ learn classifi boost predict accuraci main object advantag inher parallel distribut natur design implement power practic distribut data mine system assum system consist interconnect intranet goal provid mean data site util local data benefit data data site transfer directli access data materi learn agent execut remot data site gener classifi agent subsequ transfer site achiev goal implement demonstr system call jam agent jam implement distribut system distribut data mine system address practic problem central system distribut system complex practic depend scalabl distribut protocol number data site size method system resourc distribut system run heterogen platform oper schema import data mine system data mine system adapt environ data object chang extens support advanc data mine technolog highli intent studi identifi describ issu separ present overview exist approach detail discuss techniqu find public cite studi jam experi deal learn solv crucial problem fraud detect inform system object emploi infer system model transact behavior threat approach requir analysi larg inher distinct distribut inform transact behavior produc model transact rest paper describ jam view extens desiderata integr part design implement jam present approach predict fraudul credit card transact case studi section introduc process section present distribut architectur jam approach scalabl section address portabl section describ method overcom obstacl pose schema section detail techniqu incorpor newli comput model extend jam machin learn technolog section elabor data mine system section present result credit card fraud detect task section conclud paper induct learn meta learn induct learn learn exampl task identifi regular set train exampl knowledg domain exampl drawn set train unknown function interpret set attribut vector form class label task comput classifi model approxim correctli label featur vector drawn sourc train set common call bodi knowledg classifi data label concept class common gener classifi version neural distanc probabl distribut type algorithm extract type inform provid altern capabl common abil classifi unseen exemplar drawn domain tree declar human weight comput neural network architectur comput concept classifi unseen record tree concept repres conjunct term path root tree leaf rule pattern express consequ class label version space learn defin gener specif descript boundari concept restrict version order formula neural network comput separ hyperplan featur space classifi data learn distanc function learn algorithm nearest neighbor defin similar measur instanc condit probabl distribut bayesian classifi deriv frequenc distribut attribut valu reflect likelihood instanc belong classif implicit rule classifi maxim probabl defin learn learn knowledg concentr learn output concept learn system achiev learn predict classifi common valid data set interest output intern structur strategi learn algorithm scheme data present learn algorithm figur depict stage simplifi classifi train initi train set predict gener learn classifi separ valid set learn algorithm algorithm learn classifi classifi data train data train predict predict data valid final classifi system train data figur train set valid set predict gener classifi valid set final classifi train train set learn algorithm learn integr learn classifi predetermin fix integr integr rule learn base behavior train classifi section present strategi metalearn studi arbitr combin distinguish distinct strategi combin multipl predict separ learn classifi vote gener understood classifi major win weight vote preferenti treatment vote predict observ perform common valid set outcom vote simpli predict classifi major strategi entail judg predict select particip classifi reach consensu arbit final outcom base predict cogniz classifi predict combin refer knowledg classifi behav respect classifi predict class correct valid simpl fact lead power predict tool ignor classifi predict common outcom distinguish base classifi base classifi outcom appli learn algorithm directli train data base classifi program test datum predict unknown class combin program gener learn algorithm train predict produc set base classifi raw data arbit combin comput set predict hierarch manner arbit result learn algorithm learn arbitr predict gener base classifi arbitr decid final classif outcom base base predict left diagram figur depict final predict made input predict base classifi singl arbit rest concentr combin strategi detail combin defin notat instanc classif predict classif base denot correct classif attribut vector classifi classifi instanc predict predict final predict arbit arbitr rule arbit predict combin classifi classifi instanc predict predict final predict figur arbit classifi combin classifi combin strategi combin predict learn base classifi valid set form basi train set composit vari determin content train exampl gener call combin classifi base classifi gener predict base composit instanc gener classifi combin diagram figur aim strategi predict base classifi learn relationship correl predict correct predict combin comput predict base arbit predict base classifi arbit experi scheme composit rule detail valid set gener base classifi predict classif form set train input learn algorithm comput combin manner comput vari defin train instanc consist correct classif scheme class attribut vector base classifi predict tabl tabl tabl chair tabl chair tabl chair chair train set scheme instanc class attribut vector tabl chair tabl train set scheme instanc class attribut vector tabl chair tabl figur sampl train set gener scheme base classifi wolpert figur sampl train set train instanc form addit attribut figur sampl train set train instanc manner similar scheme binari number class produc binari train exampl label class special base classifi attempt learn correl binari predict correct predict figur sampl train set scheme composit rule defin context form train set combin composit rule similar manner classif combin comput instanc class attribut base base vector predict predict tabl chair tabl chair tabl chair tabl train set scheme instanc class attribut vector tabl chair tabl figur sampl train set gener scheme base classifi cation comput classif predict base classifi composit rule appli gener singl test classifi combin produc final predict class origin test datum benefit improv execut parallel process implement distinct serial subset train data set data reduct approach serial code process parallel learn small subset data fit main memori improv predict perform combin learn system induct bia search search combin separ learn expect deriv higher level learn model explain larg accur individu learner constitut scalabl machin learn method gener hierarch method report machin learn kdd literatur evalu combin ensembl classifi consid weight vote hypothesi gener classifi appli learn algorithm variant data set breiman tibshirani acknowledg multipl predict model reli crossvalid data analyt squar comput linear combin hypothesi method emploi metalearn combin appli arbitrari learn algorithm discov correl model advantag emploi arbitrari learn algorithm comput relat classifi gener intuit empir studi show compar favor vote algorithm partit data set method combin multipl includ merz pazzani merz algorithm integr ensembl regress model improv regress estim improv classif perform reli method similar princip compon analysi map estim model space comput higher level model sophist combin combin model domain model larg data set cubic number model suitabl distribut data mine fraud detect inform system institut todai typic develop custom fraud detect system target asset base recent bank search unifi global approach involv period share inform attack kei approach compani avoid share data number compani maintain transact behavior huge grow analysi highli desir updat model event detect easi distribut model network environ essenti maintain date detect capabl gener strategi mean learn combin integr number classifi model learn separ institut jam institut share model fraudul transact comput proprietari data describ incorpor jam detail fundament issu adapt extens distribut data mine system overview solut issu jam provid empir evid jam constitut system exemplifi credit card fraud detect domain scalabl scalabl data mine system refer abil system oper number data site substanti discern reduct perform refer system resourc depend protocol transfer manag intellig agent support collabor data site depend evalu filter agent minim redund combin scalabl sacrif predict perform intric problem understand issu tackl complex examin scalabl system architectur level data site level system architectur level focu compon system architectur assum data mine system data machin learn agent design protocol data site collabor hinder progress jam architect distribut comput construct support launch learn agent distribut site local import learn agent execut local comput data site local classifi data site import classifi peer data site combin local classifi agent agent local import data site base jam system manag execut modul classifi data set interest action place data site simultan independ jam system view parallel applic constitu site function autonom exchang classifi configur distribut system maintain configur manag independ simpl state system logic architectur jam system present figur jam site exchang base classifi share local view learn task user data site control learn task set paramet user configur algorithm imag anim fold cm run site end base classifi local import singl bayesian jam design distribut commun protocol enabl particip site oper independ collabor peer site elimin central control synchron point interest jam system detail configur file configur file dataset learner cm configur file control data messag transfer learn classifi agent configur configur data site data data site data site manag jam architectur classifi repositori classifi classifi repositori repositori base meta figur architectur system level emploi distribut address scalabl problem partial scalabl system depend greatli compon analysi depend manag agent data site constitut half scalabl problem defin collect classifi structur multilevel tree unnecessarili mean classifi wast resourc reduc system throughput denot rate stream data item pipe label studi investig prune base perform determin optim set classifi combinatori problem object prune util heurist method search partial grown classifi prune scalabl time achiev compar predict perform result fulli grown introduc stage prune prune prune stage level essenti complementari respect improv accuraci system prune refer filter classifi combin combin classifi brute forc prune introduc preliminari stage analyz classifi qualifi combin classifi particip final adopt approach evalu set classifi base input output intern structur denot evalu prune constitu base classifi complet construct implement experi prune prune algorithm search heurist prune algorithm rank select classifi evalu candid classifi independ algorithm decid examin classifi correl reli independ perform classifi manner predict respect respect underli data set prune algorithm detail prune algorithm prune techniqu techniqu cart tree learn algorithm seek minim tree reduc misclassif correl classifi algorithm detail primari object prune acquir combin inform multipl time manner gener prune techniqu prece phase conjunct combin techniqu examin section method evalu prune ensembl classifi studi provost fawcett dietterich provost fawcett introduc roc convex hull method intuit flexibl method evalu select classif model map true posit posit plane comparison metric intent select classifi group specif perform criterion adjust roc focu method potenti form ensembl classifi perform model substanti improv combin surpass singl model dietterich studi problem prune ensembl classifi set hypothesi obtain boost algorithm adaboost examin accuraci subset classifi achiev similar level perform entir set research restrict comput classifi appli learn algorithm subset train set jam gener set ensembl classifi obtain learn algorithm distinct vote predict classifi final adopt combin predict individu classifi prune method test credit card fraud detect domain result present section portabl distribut data mine system capabl oper multipl environ hardwar softwar configur combin multipl model jam system present distribut comput construct design extend os environ accommod requir impli agent portabl inher jam part denot java technolog build part system includ underli specif oper gener spawn graphic user anim facil monitor agent exchang process learn classifi agent term refer system method combin classifi agent constitut unifi machin learn approach appli larg amount data wide area comput network rang applic advantag algorithm examin intern structur strategi learn algorithm output individu classifi learn agent basic compon search pattern data classifi agent unit captur comput model share data site platform independ java make easi jam site deleg agent particip site jam successfulli test popular platform includ window linux jam site import util classifi comput platform case java comput speed jam design support nativ learn algorithm substitut slower java implement nativ learn program java wrapper interfac jam system subsequ transfer execut receiv site nativ program compat compat combin multipl model receiv attent literatur prior work combin multipl assum model origin subset necessarili singl data set mean probabl distribut instanc train stratifi mean integr distribut inform jam section address emploi integr classif model deriv distinct distribut feasibl case consid classif model assum origin ident schema classifi depend directli format underli minor schema deriv incompat classifi appli data format classifi target concept seek bridg dispar classifi principl fashion acquir data set credit card transact fraud institut learn problem distinguish legitim fraudul credit card institut seek exchang classifi incorpor system inform inaccess credit card institut record similar includ specif field import inform acquir separ predict determin fraudul transact pattern scenario schema evolv desir singl institut combin classifi past accumul data newli acquir data facilit exchang knowledg advantag incompat useless method schema integr inform captur classifi problem incompat schema reader schema integr compat problem jam advantag data site dba similar ident schema loss assum denot attribut dba class label label credit card fraud instanc loss assum attribut type drawn distinct domain problem reduc dual problem attribut assum attribut present attribut similar type slightli semant map domain type domain field time depend inform durat denot number time event occur window half hour denot number time event occur ten case present semant classifi aj deriv dba compat data directli vice versa dual problem distribut data mine system deploi learn agent classifi agent combin inform sourc section investig call bridg overcom incompat problem integr classifi origin schema bridg method describ method handl miss attribut detail approach found method learn local model miss attribut exchang remot classifi bridg agent dba train comput valu miss attribut data appli bridg agent data estim miss valu desir dba case attribut altern simpli add miss attribut data set fill null valu miss attribut high predict dba includ schema attribut common predict method ii learn local model miss attribut exchang dba learn local model attribut local subsequ exchang learn classifi agent miss attribut belong intersect attribut data set impli classifi make attribut common particip site issu exist integr remot classifi import dba assur involv predict miss local integr origin model emploi remot classifi simpli ignor miss attribut local data set approach address incompat schema problem problem model proce straightforward manner idea request miss definit remot site miss ra defin queri languag describ scheme handl process global queri access multipl distribut inform system site compil rule fact describ data belong neighbor site subsequ interpret correctli resolv queri pose queri unknown recent zbigniew ra elabor scheme develop algebra theori formal describ queri answer system solv dnf queri distribut knowledg base system queri relat categor partial order set aim comput rule consist distribut data resolv unknown attribut retriev record satisfi support categor continu limit specif syntact case consist gener rule emploi machin learn techniqu comput model miss valu adapt data mine system oper environ bound phenomenon concept drift medic scienc type data includ medic chang time profil custom includ credit card secur system introduc wai commit fraud break system tradit data mine system static classifi deploi tradit classif system obtain ing machin learn program histor db problem design classif system evolv case db address problem merg larger db machin learn program gener classifi constitut viabl solut learn program scale larg main memori requir major learn program pose physic limit size train altern emploi increment machin learn increment version nearest neighbor algorithm increment machin learn program denot machin learn program constrain retain train exampl main examin instanc time tune model classifi initi train db updat resum train db algorithm provid mean remov irrelev knowledg gather past updat model instanc accur noisi domain shortcom avoid emploi increment batch learn method method updat model subset data problem approach gener reli specif model implement knowledg increment machin learn algorithm increment batch learn method implement date describ mechan integr inform inform treat fashion similar inform import remot data site jam combin classifi remot data site adapt learn system combin classifi acquir time period emploi techniqu design learn system capabl incorpor accumul knowledg classifi captur emerg pattern learn data sourc set classifi gener latest batch data current set classifi union current classifi constitut set candid classifi prune process valid comput classifi current surviv prune stage repres exist remain classifi denot newli acquir inform kei point process select valid set prune stage straightforward approach includ valid set data proport reflect speed pattern approxim monitor perform current sophist approach weight data recenc weight decai time addit solv problem make learn system evolv adjust chang solut advantag make simpl classifi captur characterist pattern surfac period time combin manner integr uniformli exist approach combin classifi inform acquir remot sourc easi implement test compon build classifi combin older classifi similar ident compon standard modif base system repeat entir train process order creat model integr inform build independ model hierarchi train base classifi data emploi techniqu combin exist classifi overhead increment learn limit phase conjunct exist prune techniqu incorpor classifi hierarchi continu eventu result larg hierarchi classifi natur base system analyz compar contribut accuraci process decid substitut hierarchi newli obtain captur pattern strategi compat jam system time scalabl mean deal larg support machin learn algorithm strategi jam extend incorpor inform discard knowledg accumul time previou data mine treat issu comput classifi model retain manag older classifi model interest open question adequ treat work extens data pattern chang time advanc machin learn data mine bound give rise algorithm tool present time data mine system flexibl accommod exist futur data mine technolog rapidli render inadequ obsolet ensur jam design method implement independ machin learn program classifi combin techniqu learn agent design object jam definit parent agent class instanc agent program implement favorit learn algorithm ripper cart defin subclass parent class definit inherit agent parent agent class simpl classifi learner boolean classifi return boolean classifi boolean tree classifi boolean nearest neighbor classifi boolean probabilist classifi boolean classifi boolean tree figur class hierarchi learn agent minim interfac subclass compli long learn agent conform introduc immedi jam system jam agent method constructor argument jam instanti provid suppli owner data site local user configur file method agent subclass inherit method parent agent class jam suppli argument agent argument includ train test dictionari filenam output classifi method jam call method trigger agent learn train dataset method method jam obtain newli built classifi encapsul particip data remot agent dispatch easili accomplish class hierarchi method learn agent present figur cart ripper inherit method parent learn agent class classifi class defin similar class hierarchi jam infrastructur independ machin learn program interest long machin learn program defin encapsul object conform minim interfac requir exist algorithm similar interfac import directli characterist make jam power extens data mine facil latest version cart full java ripper store local nativ applic featur user emploi nativ program java agent comput speed crucial section seek measur evalu predict accuraci classif system contrari studi compar learn algorithm classif predict accuraci accuraci minim error altern realist measur interest includ true posit posit rate classif roc analysi problem specif cost model criteria relev problem learn task detail studi accuraci estim compar induct algorithm found credit card fraud predict accuraci inappropri singl measur predict perform transact model predict accur tp rate import fraudul comput model predict produc alarm predict legitim transact maxim tp fp spread measur success model find model tp rate correctli predict fraudul correctli predict lowest cost wrong top fraud cost model criteria judg subset set figur gener data subset data set classifi tp rate cost perform natur class distribut data set yield classifi distribut highli skew gener desir distribut remov data approach creat data subset desir gener classifi integr classif behavior aim chang natur skew distribut binari classif problem randomli divid major instanc partit form data subset merg minor instanc partit major instanc minor instanc replic data subset gener desir distribut figur depict process empir result approach distribut data subset train significantli reduc amount dollar loss due transact detail techniqu result size data set distribut percentag minor desir distribut number minor instanc desir number major instanc subset nx number subset number major instanc divid number desir major instanc ny ceil replic major instanc ensur major instanc nx minor instanc major instanc step appli learn subset subset learn process subset run parallel processor massiv amount substanti improv speed achiev learn algorithm gener classifi combin learn classif behavior empir evalu jam comput classifi agent possibl fraudul credit card transact section describ report result compar perform approach set learn algorithm induct learn algorithm cart ripper successor cart tree base naiv bayesian ripper rule induct algorithm learn task data set real credit card transact experi credit card data set provid chase union member servic technolog data set credit card transact label fraudul legitim bank suppli million record span year fraud distribut chase bank versu union bank schema develop year experi continu analysi bank personnel captur import inform fraud detect reveal detail schema record fix length byte numer attribut includ binari class label field numer rest number repres discret categori evalu compar adopt fp spread cost model fit credit card fraud detect problem accuraci express abil classifi provid correct fp denot abil classifi catch fraudul transact minim cost model captur perform classifi respect goal target applic dollar loss due credit card compani fix overhead serv threshold challeng credit card transact transact amount author transact automat transact predict fraudul requir referr fee author personnel decid final disposit overhead cost typic call accur predict identifi fraudul amt produc loss overhead cost seek produc fraud detector gener maximum save return classifi classifi correctli fraudul transact return classifi misclassifi legitim transact inspect transact amount amt transact return greater denot number exampl data set evalu save express favor classifi catch fraudul transact high amt distribut data set data site site store month prepar set candid base origin set base classifi prune algorithm call evalu comput classifi appli learn algorithm month creat base classifi classifi data data site import base classifi subsequ prune fp spread inform simpl metric perform classifi compar replac defin famili curv roc metric complet analysi roc space ensur classifi test data site half local data prune half evalu perform prune unprun detail found set experi correspond parallel cross valid bank exchang classifi agent addit local classifi import peer data site import extern classifi chase data site popul chase classifi union classifi union site popul union classifi chase classifi site half local data prune half evalu perform prune unprun ensur local classifi schema chase union defin featur semant chase includ featur present union data valu union data map semant chase data deploi bridg agent comput miss valu detail union classifi simpli disregard real valu provid chase data chase classifi reli common attribut predict bridg agent deliv predict union data site tabl summar result chase union bank tabl displai tp fp spread save fraud predictor examin column denot number ensembl classif system row tabl show perform chase cot system data set row present perform base classifi entir set tabl perform result chase credit card data set type classif model size accuraci tp fp save cot score system chase base classifi entir set base classifi subset chase chase union union tabl perform result union credit card data set type classif model size accuraci tp fp save base classifi entir set base classifi subset union union chase bridg chase bridg chase bridg singl month row detail perform unprun prune combin base combin intern extern chase base classifi bridg agent chase bank defin attribut union classifi agent similar data record tabl union except union cot perform made addit result obtain emploi special bridg agent chase comput valu union miss attribut appar outcom experi superior perform metalearn singl model approach tradit system data outperform singl base classifi categori bridg manag improv perform system combin classifi agent bank directli phenomenon easili explain fact attribut miss union data set model chase data set union classifi chase classifi chase chase classifi perform full strength union site bridg agent addit evid invalu contribut prune prune comput similar fraud detect reduc size improv detail descript prune method compar studi predict perform throughput found distribut data mine system aim discov combin inform distribut multipl wide accept approach object appli machin learn program discov pattern exhibit data comput descript call classif model classifi concentr problem acquir larg distribut jam distribut system larg scale data mine applic gener method facilit combin model comput independ machin learn program support scale larg data mine applic design implement jam identifi issu relat extens distribut data mine system address scalabl problem emploi distribut asynchron protocol architectur level jam manag learn agent data site introduc special prune algorithm data site level evalu combin essenti classifi preserv portabl heterogen platform built jam exist agent infrastructur internet achiev compat emploi special bridg agent resolv schemata distribut adapt attain extend techniqu combin exist classifi extens ensur decoupl jam learn algorithm introduc capabl object evalu improv data mine investig metric task appli distribut manipul techniqu task skew distribut design implement practic distribut data mine system requir extens research issu intent paper provid detail exposit techniqu overview import issu approach discuss techniqu find public cite area open activ problem fulli explor method empir evalu real credit card transact data provid separ institut target data mine applic comput predict model detect fraudul transact experi suggest distribut prune method bridg techniqu constitut highli scalabl approach mine distribut data set potenti contribut system broad applic refer michael inform overload comput juli breiman heurist instabl model select technic depart california breiman stack regress machin stone classif regress tree chan stolfo experi multistrategi learn proc intl conf inform knowledg page chan stolfo multistrategi parallel learn proc intl work multistrategi page chan stolfo parallel distribut learn work note aaai work knowledg discoveri page chan stolfo compar evalu vote partit data proc twelfth intl conf machin page chan stolfo share learn model remot partit local proc intl conf knowledg discoveri data page chan stolfo scalabl learn class cost case studi credit card fraud detect proc fourth intl conf knowledg discoveri data page editor work note workshop integr multipl learn model improv scale machin learn aaai freeman bayesian classif system proc intl conf machin page clark niblett induct algorithm machin buchanan increment batch learn sixth intern workshop machin page san morgan kaufmann cohen fast rule induct proc intl conf machin page cost salzberg weight nearest neighbor algorithm learn symbol featur machin tg dietterich machin learn current direct ai domingo rule induct intern confer knowledg discoveri data page august aaai press duda hart pattern classif scene analysi model comput diabet research diabet care comput method program special uthurusami advanc knowledg discoveri data mine aaai menlo freund schapir gener learn applic boost european confer comput learn page freund schapir experi boost algorithm proc thirteenth conf machin page hansen neural network ensembl ieee tran pattern analysi mach ra mi hinton adapt mixtur local expert neural michael jordan robert jacob hierarch mixtur expert em algorithm neural learn filter net proc intl conf machin page morgan krogh neural network cross activ learn advanc neural info proc sy page mit tibshirani combin estim regress classif technic report depart lippmann introduct comput neural net ieee assp april zbigniew maria queri handl learn distribut intellig system zbigniew methodolog intellig page north octob north holland dietterich prune adapt boost proc fourteenth intl conf machin page rissanen fast scalabl classifi data mine proc intl conf extend march merz correspond analysi combin classifi machin merz pazzani princip compon approach combin regress estim machin michalski theori methodolog induct learn machin artifici intellig page morgan papert introduct comput geometri mit mitchel gener search artifici tom mitchel machin learn ai neural network model estim option price appli david opitz shavlik gener accur member ensembl advanc neural inform process perron cooper network ensembl method neural network artifici neural network speech page pomerleau neural network percept mobil robot guidanc phd school comput carnegi mellon rep andrea prodromidi stolfo mine integr incompat classifi proc intl conf knowledg discoveri data page aaai andrea prodromidi stolfo prune distribut data mine system proc nation confer inform page octob andrea philip chan prune distribut data mine system knowledg discoveri data mine journal submit public provost fawcett analysi visual classifi comparison class cost distribut proc intl conf knowledg discoveri data page provost fawcett robust classif system environ proc aaai ron kohavi case accuraci estim compar induct algorithm proc fifteenth intl conf machin page quinlan induct tree machin quinlan program machin learn morgan san zbigniew ra answer queri distribut system rough set knowledg studi fuzzi soft volum page physica intern applic probabl algorithm diagnosi american journal schapir strength weak learnabl machin scalabl parallel classifi data mine proc intl conf larg septemb stanfil waltz reason comm chan credit card fraud detect issu initi result work note aaai workshop ai approach fraud detect risk wd prodromidi chan fraud detect inform system chan java agent metalearn distribut proc intl conf knowledg discoveri data page volker tresp combin estim weight function advanc neural inform process increment proc intl conf mach page morgan increment induct tree machin paul improv algorithm increment induct tree proc eleventh intl confer machin page stolfo mine audit data build model proc fourth intl conf knowledg discoveri data page aaai smith evolut synthet apertur radar system progress eo sar ieee transact remot wolpert stack gener neural wu lo increment induct pacif rim intern confer artifici novemb
Agents/997 1 investig interact agent agent control compon thoma brett victor ping xuan depart comput scienc massachusett amherst umass comput scienc technic report februari abstract explor agent context agent coordin research intellectu question major issu pertain interact agent chosen class explicit model interact address interact paper ambiti attempt address frame context coordin research introduct base long histori work agent agent control compon build distribut ai attempt frame address set intellectu question pertain agent interact li heart issu interact agent possibl occur level interact machineri hold agent underli machineri control individu agent henceforth term coordin protocol describ specif dialogu agent held coordin instanti protocol coordin denot larger group concern agent reason plan resolv carri commun activ return issu coordin mechan section notion mechan intertwin intellectu version paper workshop polici effort sponsor advanc research project agenc air forc research laboratori air forc materiel agreement number nation scienc foundat grant number number govern author reproduc distribut reprint notwithstand copyright annot thereon view author interpret necessarili repres offici polici express advanc research project agenc air forc research nation scienc govern ffl assum model agent engag multipl ramif interact interact account level underli agent control agent engag dialogu agent attempt task mutual task contract contract recoveri gener place decommit possibl penalti gener trigger agent control machineri ffl held coordin multipl agent gener entail exchang task goal inform tempor constraint inform view bind variabl machineri machineri queri oracl truth mainten agent bind provid result time multipl candid task negoti requir underli agent control mechan identifi constrain situat part interact involv queri underli oracl oracl inform order make prioriti accomplish result commit intend impact question interfac machineri lower level control ffl situat approach issu perspect ff agent hard deadlin loom lack suffici time coordin soft task interact coordin modul machineri reflect upcom deadlin option includ end exist dialogu refrain start modifi reflect hast case involv simpli termin standard requir dialogu includ branch tempor requir anytim problem neat cyclic inform obtain commun influenc agent belief impact intent plan action continu dialogu gain inform chang choic agent made result agent time time spent simpli detract domain problem solv question address issu implic machineri argu agent address issu address attempt frame question lead implic agent pertain matter deal activ level abstract discuss section interact conjunct interact agent control compon push harder issu interact question outcom effort modifi agent coordin gpgp support situat adapt issu clear resourc simpl object requir network perform action resourc degrad base state resourc degrad vari plicat domain current project interfac agent control technolog process view task send robot team hazard environ perform unman explor damag build access structur applic requir protocol behavior applic coordin agent intellig environ inform gather agent effort open gpgp applic adapt redesign reimplement import concept gpgp creat gpgp import note view agent control differ perspect agent question pose relev agent technolog question role agent research work coordin hand work structur dialogu agent formal implic inform exchang coordin work gener pertain make agent area research relat benefit cross fertil explor research context work akin begun abstract underli agent machineri simplifi agent task model addit context requir properli frame understand question interact agent machineri section describ view agent control domain independ architectur discuss machin approach coordin protocol specif return question pose section agent control compon approach agent control problem domain independ perspect domain problem process program sophist problem coupl domain independ task model taem modul agent coordin agent schedul possibl compon learn diagnosi problem solver translat intern taem structur pass control compon larger prototyp agent architectur shown figur control compon focu paper shown figur taem task model taem environ domain independ task model framework describ reason complex problem solv process taem model coordin research research collabor distribut design distribut situat assess surviv system intellig environ hospit patient schedul coordin softwar process typic problem solver repres domain problem solv action possibl level pass taem model agent control problem solver coordin modul schedul taem model hierarch abstract problem solv process describ altern wai accomplish desir repres major task major interact process translat transform abstract process program taem task structur schedul coordin task assessor execut subsystem execut monitor problem solver current goal organ organiz design problem solver detect diagnosi modul learn modul schedul knowledg agent network resourc inform knowledg organiz organiz design learn compon agent belief db gpgp coordin modul commit db exchang inform task structur client goal criteria exchang inform exchang inform detect system probe network inform schedul data flow except notif data compon state inform updat updat user exchang domain inform updat updat produc reschedul request updat reschedul request updat updat updat notif figur prototyp agent architectur problem solver problem domain solv option system constraint domain plan resourc constraint client goal criteria modul local control commit agent commit agent commit import criteria ramif local control context satisfi commit violat commit schedul select execut schedul coordin modul specif local problem solv action suit current local context modul context schedul select execut envelop defin rang accept action outcom data flow figur primari agent control compon resourc constraint describ intim detail primit action primit action call statist discret probabl distribut cost durat qualiti abstract concept describ contribut action problem solv applic notion correspond model qualiti durat describ amount time action model method execut cost describ opportun cost inher perform action uncertainti dimens implicit perform agent reason certainti action durat uncertainti appli task interact facilit hinder time facilit qualiti time qualiti quantif method interact taem regard perfect scienc task structur programm problem solver gener estim perform characterist primit action estim refin time learn reason typic replan reschedul unexpect event occur ground figur simplifi task structur emit big inform gather describ portion inform gather process task construct product model retail pc system term expect durat enabl arc gather task model fact review gather method product order gather review task interact model taem bound disabl task interact interest coordin research identifi instanc task assign agent interdepend implicit joint goal joint problem solv activ coordin motiv exist interact return join facilit hinder task interact model soft relationship result produc task benefici harm task case exist activ gener qualiti recipi task reduc cost durat monei resourc build pc product object basic product inform queri extract vendor queri extract maker gather review search process zdnet review search process pc world queri process consum report queri extract pc connect extract pc mall consum limit multipli multipli multipli task method resourc task subtask relat kei enabl figur simplifi subset inform gather task structur function defin perform subtask relat perform parent task method emploi achiev true seq subtask result qualiti sum determin qualiti parent altern wai achiev goal task order recent addit taem denot denot denot number children denot qualiti item qualiti task qualiti ith child qualiti task method perform sampl defin taem ffl subtask perform minu order ffl sum subtask perform order ffl nq subtask perform order task initi failur perform child min result qualiti parent task ffl nq number subtask perform gener task select ffl nq subtask perform ffl nq subtask perform order ffl seq seq seq seq prefix case denot sequenc prefer subtask suffix denot function perform result seq sum taem support model task arriv point individu deadlin earliest start time task belong schedul taem task structur process develop taem constant tension power inher work structur result model schedul optim lend flexibl approxim process strategi local agent control schedul agent local expert make control schedul role domain action domain problem solver action local agent goal criteria prefer type local agent resourc constraint express gpgp coordin modul gener idea evalu option light constraint prefer sourc find achiev select task address schedul problem frame term taem task structur emit domain problem solver schedul problem solv activ model taem languag major find set action achiev sequenc find sequenc action soft produc schedul meet dynam goal certainti client taem model multipl approach achiev task durat characterist primit specif enabl taem client reason action taem task multipl approach achiev task approach certainti characterist contrast classic schedul taem schedul object sequenc set unord action find sequenc set action suit client certainti examin current current option decid action target contextu make schedul requir sophist heurist approach schedul task inher comput complex exhaust search techniqu find optim schedul deadlin resourc constraint exist complex task prevent singl heurist produc optim schedul cope satisf respect goal criteria respect search solut space satisf translat techniqu reduc search space make schedul problem process includ gener partial approxim guid schedul goal design criteria desir approxim schedul call provid overview schedul solut space heurist make set action perform order consid cope complex group heurist action order task resourc commit made problem solv constraint heurist algorithm reduc action order problem polynomi level worst case heurist error correct secondari set improv heurist act safeti net catch potenti correct error produc heurist approach cope comput complex client goal criteria focu reason schedul approxim complet schedul approach methodolog effect aspect schedul problem soft amen satisf approach task interact commit made agent import relax gpgp manag interact gpgp partial global agent tool interact agent coordin joint activ gpgp domain approach coordin coordin modul local control post constraint agent local schedul gpgp coordin modul gener commun commun agent local commun make break task relat commit agent coordin modul modular coordin subset appli coordin depend coordin desir gpgp defin coordin mechan formal detail share view basic coordin mechan handl exchang local view agent detect task interact exchang local view agent detect coordin task interact mechan exchang exchang exchang inform exchang part local view exchang entir local view commun coordin mechan coordin mechan local view task understand exist task interact coordin commun result coordin mechan handl commun result method execut agent govern minim polici result satisfi extern commit polici minim result final result task group polici result commun mechan meaningless mechan mechan form commit avoid redund mechan deal detect redund pick agent random execut redund method question agent commit perform action agent commit denot agent carri task predetermin time type redund question simpl duplic contrast redund gener similar result method handl hard task relationship enabl pictur figur denot hard task relationship coordin mechan deal task interact commit predecessor enabl perform task deadlin handl soft task relationship soft task unlik hard interact option coordin mechan attempt form commit predecessor soft interact perform method question method receiv end interact mention gpgp coordin modul modul local control place call local schedul commit repres deal gpgp made perform method time deal gpgp make agent commit fall deadlin commit type commit denot agreement execut method time agent result method execut perform agent form deadlin agent plan activ base expect receiv result deadlin earliest start time commit commit denot agreement start execut method prior time type commit deadlin commit agent scenario commit denot agent execut time start execut time commit commit weak simpli denot commit execut method time dont commit commit denot agreement perform method interv coordin share resourc salient featur coordin includ domain independ approach exchang inform construct partial global worth driven view task action inform exchang polici coordin subset mechan independ depend current context loom coordin agent reli underli oracl analysi procedur determin bind variabl exchang agent dialogu agent good idea result provid agent order commit effect world inform gener provid schedul gpgp requir analysi code detect task interact determin inform polici gpgp mechan embodi analysi aspect coordin problem coordin protocol aspect problem integr concern make extend protocol difficult built code isol world address problem separ analysi procedur specif agent coordin protocol label current gener agent coordin tool primarili histor reason goal project develop approach coordin mechan separ coordin protocol support analysi code coordin protocol easili modifi adapt context step verif tool reimplement function includ fairli simpl coordin protocol coordin natur main object work territori cover gpgp gpgp group analysi function protocol specif singl bodi approach coordin protocol finit state machin model state denot state transit call commun action analysi code approach specif akin cool work differ interact underli agent control machineri fsm script process fsm interpret interpret emit java code incorpor coordin bean integr gener java agent framework coordin bean interact rest agent compon mechan direct invoc support featur framework featur fsm model interpret ffl fsm variabl enabl protocol store inform explicitli addit implicit inform state store commit time agent ffl share fsm variabl enabl interact set interrel task sequenti point synchron serial effort synchron phase entail share variabl pass bind inform pass coordin bean standard agent data structur knowledg intuit effici sort oper insid coordin machineri gener agent control structur design embodi issu handl interact approach unclear interact ffl timer enabl machin set timer wait event occur timer enabl produc window timeout durat specif global default ffl event registr creation event gener fsm agent class object agent framework term event gener event catch interact explicit priori knowledg interact ffl part event fsm initi fsm detect dialogu fsm handl dialogu ffl inherit coordin protocol subclass special facilit rapid protocol develop simpl special exist protocol ffl pre post condit transit transit set action test fsm place transit set action place transit complet ffl except fsm throw catch except fsm handl timeout condit event drastic chang execut flow succinct fashion altern complet specif except transit state messag receiv messag code execut messag process code execut messag process inform fsm environ watch condit test fsm variabl declar fsm variabl notifi ack comput commit time commit reject commit evalu commit set counter comput commit time commit reject counter branch reject branch accept branch accept add firm local commit accept add firm local commit notifi ack timeout resend track resend give number regist condit figur initi fsm coordin hard task interact messag receiv messag code execut messag process code execut messag process inform fsm environ watch condit test fsm variabl declar fsm variabl notif decid coordin set variabl ack commit evalu commit set counter comput commit time commit reject counter branch reject branch accept branch accept add firm local commit accept add firm local commit branch ack dont branch figur respond fsm coordin hard task interact figur show exampl fsm handl coordin hard task interact tempor sequenc task fsm figur design handl format singl commit outstand research question determin agent model task interact coordin case interact task ff fi fl chain interact requir coordin chain multipl independ multipl interact share variabl case agent agent multipl task interact current handl multipl concurr asynchron agent handl singl dealt multipl task interact interact fsm issu interdepend task coordin interdepend interdepend task interdepend task stem assign task agent interact revisit issu interact potenti larger section identifi issu interact interact machineri agent control machineri agent dialogu coordin mechan potenti oper held perform gpgp style coordin gpgp deal tempor sequenc task explor task constraint assign set agent style coordin feasibl analysi solut enact base assumpt task gener dynam problem solv agent problem solver extern client gpgp assum process determin set candid task schedul coordin note taem model altern wai perform gpgp problem simpli coordin schedul set primit action perform action perform base util feasibl gpgp choic limit set task action emit problem solver gpgp pertain detect sequenc activ resolv share pertain determin goal agent current work integr requir address issu task alloc agent determin task perform global perspect note issu task alloc problem assign member set individu agent belong set candid agent requir knowledg capabl resourc agent knowledg structur task view interdepend determin task agent network pursu matter process gener activ requir agent engag requir coordin convei inform capabl agent inform pertain state problem solv network gener respond reflect version reason singl fsm adapt interpret output version remov analyz fsm reachabl relat issu top level bottom level coalit format dialogu matrix organ joint goal remov joint goal joint goal agent attempt achiev task view commit accept commit result result result influenc constraint feedback influenc constraint feedback influenc constraint influenc constraint feedback gpgp result share gpgp coordin interact detect commit format bdi share plan task goal select task assign evalu agent capabl organiz structur figur level interact pertain concern oper level detail interact product assign member feasibl case face interact held determin held determin task held determin task feasibl task perform respect level simultan figur illustr idea made upper level set polici lower level decid pursu task ff fi upper level determin held end feedback process explor feasibl task select upper level situat set task select agent attempt perform requir action discov agent network lack suffici resourc carri activ address problem task interact tempor constraint make difficult ascertain process attempt coordin schedul choic task pursu network modifi return issu interact interact explicitli model handl requir negoti style interfac machineri level begin agent level obviou work organ comput organ system entail place level abstract agent determin structur problem solv place level interact explor integr base coordin bdi approach agent control bdi framework upper level agent control determin task perform perspect coordin schedul activ carri tool lower vice versa machineri hold stratif move food chain examin level gpgp agent exchang local inform construct partial global view rest world agent carri dialogu attempt handl task interact activ fall gener umbrella feasibl solut enact act commun result view type activ machineri commun result carri activ inher case machineri possibl interact level result commun affect exist result agent engag agent problem solv state evolv attempt identifi issu interact agent provid reason interact research question worth address agent commun coordin commun benefit integr technolog integr technolog lead issu interact level control level base work level scale system open environ main issu formal explicitli repres reason interact requir step notion level interact issu uncertainti uncertainti agent coordin taem explicitli reason certainti action begun reason role uncertainti coordin intuit uncertainti question ubiquit appli level agent refer martin andersson sandholm level commit contract myopic strateg agent fifteenth nation confer artifici page barbuceanu mark fox languag describ coordin multi agent syst ms intern confer system page ana lc victor ping xuan adapt organ design domainindepend diagnosi comput scienc technic report massachusett februari norman carver victor lesser testb research distribut situat extens model extern evid intern confer multiag pr cohen hj levesqu commun action artifici agent intern confer system page dean boddi analysi plan seventh nation confer artifici page st august sycara intellig adapt inform agent journal intellig inform keith decker li coordin hospit patient schedul intern confer system page keith decker environ center analysi design coordin mechan phd keith decker task environ center simul simul comput model institut group aaai keith decker victor lesser coordin assist mix human comput agent system concurr engin page concurr technolog corp umass cs mark david michael luck interact protocol agenti intern confer system page edmund thoma montgomeri coordin distribut search hierarch behavior space ieee transact alan keith victor lesser interfac schedul aaai workshop model conflict umass cs bryan horl reusabl compon architectur agent construct umass depart comput scienc technic report octob bryan victor regi ana ping xuan diagnosi integr part adapt comput scienc technic report massachusett januari eric horvitz reason vari uncertain resourc constraint seventh nation confer artifici august nr jen control cooper problem solv industri system artifici david michael regi victor lesser learn quantit knowledg multiag coordin umass depart comput scienc technic report stanlei sutton jr leon design process languag acm sigsoft symposium foundat softwar page septemb gal kaminka milind tamb wrong improv robust social diagnosi fifteenth nation confer artifici juli toru coordin protocol descript system intern confer system page yanni labrou tim finin kqml specif comput scienc technic report maryland baltimor februari victor michael bryan brett anita regi thoma ping xq zhang system intellig environ control intern confer autonom agent victor keith norman alan daniel nagendra thoma wagner evolut gpgp coordin framework comput scienc technic report massachusett januari victor bryan frank anita thoma xq zhang inform gather agent fifteenth nation confer artifici intellig juli umass cs technic report nagendra lesser cooper inform distribut problem solv approach comput scienc technic report journal softwar special issu develop agent base sandip sen effect misconcept reciproc agent intern confer autonom agent page munindar singh develop formal specif coordin heterogen autonom agent intern confer system page ira phillip jefferi mark design polici joint intent theori intern confer system sugawara victor lesser learn improv coordin action cooper distribut environ machin milind ali gal ion talli explicit model teamwork robot world cup competit tamb flexibl teamwork journal artifici intellig regi bryan thoma victor lesser surviv simul multiag adapt coordin intern confer model umass cs thoma alan victor lesser heurist task schedul intern journal approxim special issu version umass cs thoma wagner victor lesser ubiquit satisf agent control aaai symposium satisf thoma victor brett anita ping xq zhang improv divid conquer work ping xuan victor lesser handl uncertainti commit umass depart comput scienc technic report zilberstein stuart russel effici reason intern confer ai plan colleg june deal schedul reschedul iter repair zweben intellig chapter morgan
Agents/998 1 fast file access fast agent eugen michael depart inform comput scienc california ca usa abstract mobil agent power tool coordin gener distribut main goal high perform paper demonstr inher mobil agent exploit achiev fast file applic present file system mobil agent base local disk particip workstat mobil agent make file oper significantli reduc access time demonstr code file special system file handl effici environ introduct popular target todai mobil agent system internet comput import characterist system target internet secur heterogen achiev properti mobil agent system implement script languag java agent system special larg target parallel distribut requir secur import issu agent cooper work solv problem applic run set trust treat agent user program comput speed system critic aspect defin perform system includ load optim agent effici dynam comput resourc applic main issu affect perform system effici file main focu paper mobil agent system identifi type file includ data code checkpoint file figur illustr organ system connect type file system compon assum network workstat pc machin run special caller daemon manag agent machin daemon support place agent call logic node agent run logic topolog fig file type messeng global share file system machin local disk daemon file system file access machin file system resid fulli distribut file system benefit compar tradit file local access applic remov load central file util local checkpoint overhead fault toler describ type file system point specif problem file type solv absenc share file system data file comput requir agent file maintain result input comput mobil agent offer uniqu speed applic file system messag pass process share file system file move machin mobil option move code move file share file system unnecessari approach file logic attach logic node creat access agent present logic node figur illustr situat stationari process pd run machin access file store disk machin requir share file system make locat file transpar file explicitli copi figur show situat mobil agent execut logic node machin hop node file attach applic file access local code fs data checkpoint fig file access scheme messag pass system share file system mobil agent system file file logic attach logic node agent access file hop support load balanc logic node remap machin runtim file attach migrat node move logic node code file agent consist local current execut state agent hop compon made destin machin code largest portion optim transfer import perform wai agent code handl agent carri entir code hop approach agent work wide area search inform optim system copi agent code made particip agent dont carri code migrat code easili compil nativ code save dynam link avoid overhead interpret compil pa pd pb pc fs write write agent code minim agent size effici distribut code librari local file agent visit small subset particip machin agent spawn initi time agent code applic section present mechan solv problem distribut librari code demand configur file run mobil agent user system address initi set daemon interconnect inform suppli configur file unlik data logic code agent singl copi configur entir system file access run daemon ad system daemon daemon run system contact share file file discuss section provid central call checkpoint file checkpoint file failur recoveri snapshot daemon time checkpoint separ checkpoint file daemon checkpoint inform recov daemon failur store checkpoint file local disk entir node file defeat maintain checkpoint absenc share file system make imposs daemon write checkpoint file machin file system problem address section describ principl replic present comparison checkpoint overhead local disk nf detail descript solut problem local file system implement part messeng project agent messeng call term rest paper refer mobil agent applic file applic file logic physic machin logic node migrat daemon due load balanc daemon failur connect node file migrat illustr figur node file locat pack node structur node file overhead migrat present fig redistribut logic node daemon ad fail daemon remov messeng access file measur result perform gain compar time common oper share file system nf support oper perform local file system tabl present result faster nf open close file time write file time faster tabl file oper comparison nf buffer size read write nf nf nf main drawback applic file local disk share file system overhead file migrat investig problem quantit grid logic node node connect link node migrat daemon migrat consecut node start previou complet total migrat time migrat time node comput experi measur correl size node file migrat time tabl present node migrat time nf size node file case nf migrat time independ file file migrat node migrat time grow size node file file size kbyte migrat time nf overlap file migrat pack logic node migrat time node readi node file delai node migrat tabl migrat time logic node nf file size migrat time nf code file distribut local file system design master file system initi agent code librari daemon receiv agent code librari request daemon copi file channel store local file system futur avoid excess traffic hierarch approach code file distribut daemon share file system form group file system coordin daemon lowest ip daemon miss request fs coordin fs coordin talk transfer librari local fs coordin local fs coordin broadcast group librari maintain librari consist librari make daemon version librari order librari copi file time stamp file modifi daemon verifi modif store current modif stamp librari modif stamp copi librari load load librari daemon figur show librari load daemon ad system depend daemon creat current machin daemon run illustr figur simpler fig load librari daemon assum daemon ad system daemon run current local file system code file daemon lowest ip serv local fs coordin newli creat daemon contact fs coordin return list activ code librari daemon load local file system figur illustr newli creat current machin local file system code file find file daemon contact fs coordin repli return call daemon list activ code file daemon check exist local file system daemon simpli load local file contact master fs coordin send miss file messag daemon load save local file system futur load messeng librari demand section load code librari newli creat daemon section describ distribut code librari requir messeng migrat messeng daemon execut messeng code librari wai messeng arriv daemon messeng inject user messeng inject current node messeng hop node approach distribut librari load daemon system messeng creat advantag approach minim wait time load wait occur librari load daemon librari load node librari load demand case librari load machin time messeng wait librari load fig load messeng librari demand approach chosen cleaner design protocol integr system figur illustr protocol add messeng librari approach messeng arriv daemon daemon check librari load messeng daemon send request librari fs coordin coordin receiv broadcast messag daemon includ daemon broadcast messag fs coordin includ daemon fs coordin check latest version librari exist local file system coordin request copi coordin librari arriv fs coordin inform local broadcast inform master fs local fs messeng daemon load librari local file system daemon restart suspend arriv trigger librari load protocol dynam system configur configur file start user creat system configur profil user list physic node particip file system librari applic fig system architectur daemon share common file exchang configur inform mediat process call serv interfac user messeng system system structur present figur file system process start system initi phase load topolog system user command inject restart system protocol solv problem exchang commun port number activ daemon receiv command user add start daemon remot machin user daemon network command pass port number argument daemon user manual login remot machin run command provid daemon send messag port number send daemon list port number activ daemon send inform current system system librari daemon file system fig algorithm figur summar algorithm start messeng daemon remot pass argument der port number daemon establish receiv send port number send daemon list activ daemon port file system send list system user librari system daemon load messeng announc activ daemon activ daemon add daemon activ daemon port number file system command step skip protocol start manual step port number pass command line argument daemon step start messeng daemon step contact step add daemon list activ daemon send list activ fs list lib step load announc ad daemon checkpoint file fault toler system provid protocol system particip daemon period save state stabl storag collect checkpoint file daemon constitut consist system restart system case node failur share file system checkpoint file access daemon checkpoint store local data store disk inaccess node fail solut store checkpoint send copi neighbor machin case copi restart fail node replic file system potenti support system node uniqu file system id determin locat file system configur file file system host activ process arrang logic ring file system file system connect modulo total number file system daemon save state local file send copi checkpoint file daemon resid file system ring checkpoint file copi ring file system illustr figur lower rectangl repres file circl repres daemon run machin file system letter top rectangl repres daemon checkpoint log current file system fig replic system failur recoveri failur node system checkpoint case node fail daemon restart file lost copi checkpoint node fail checkpoint load node copi checkpoint file copi copi checkpoint file daemon copi system configur checkpoint shown figur detail replic mechan present file type discuss earlier replic applic file replic checkpoint part checkpoint replic depend file oper mode file open read replic failur support file system case write append data end increment written previou checkpoint append end replica file case write modifi entir file replic checkpoint profil messeng code librari replic activ file system replic file system fail case file copi activ file system perform compar overhead induc checkpoint nf experi logic node connect ring messeng continu travel ring complet applic termin messeng system size checkpoint measur result system consist number daemon number logic node daemon held checkpoint size result experi shown tabl tabl checkpoint size daemon checkpoint overhead nf repeat experi set machin connect ethernet set machin connect switch differ checkpoint overhead neglig checkpoint size overhead checkpoint nf similar checkpoint size result experi shown tabl differ perform checkpoint nf machin connect switch ethernet checkpoint overhead depend greatli checkpoint size configur underli network tabl overhead checkpoint checkpoint size daemon checkpoint overhead nf ethernet switch mobil agent paradigm suitabl coordin extend handl file access effici paper approach implement part messeng implement file local disk particip share file nf local file system support effici deal type file involv oper mobil agent fig file distribut data file access explicitli agent logic node util inher mobil oper file fast code file distribut demand agent hop node copi daemon request master daemon ad system bring date similar request copi code file distribut master daemon order join system daemon determin address execut daemon share file system special call profil data file fs data file fs checkpoint file fs cp file fs code librari activ lib profil replica data file fs data file fs checkpoint file fs cp file fs code librari activ lib data file fs data file fs checkpoint file fs cp file fs activ lib fs fs charg maintain configur file obtain relev inform daemon maintain checkpoint file permit uninterrupt oper case failur checkpoint file maintain current node copi neighbor node applic file duplic checkpoint file complet set messeng code librari profil file replic activ file system figur summar distribut replic file type messeng system base file system paper run solari linux platform refer introduct odyssei api bill architectur aglet april architectur ara platform mobil agent kurt proc intern workshop mobil agent april robert georg david daniela ru agent tcl william michael explan exampl man van introduct distribut technic report dept comput christian michael fukuda state captur comput intl workshop comput commun presenc april christian michael fast state captur mobil parallel comput tu netherland august eugen michael approach system proc intern confer distribut comput system april eugen michael local file system mobil agent depart inform comput ca tr messeng robert adapt load workstat cluster seventh symposium frontier massiv parallel comput robert handl load imbal parallel object public inform eugen michael interconnect structur dynam chang decemb java languag specif addison weslei telescript introduct languag white gener ca softwar press tcl tk toolkit longman secur mobil issu requir nation inform system secur
ML/999 6 applic machin learn rule induct pat langlei robot comput scienc dept stanford ca herbert simon depart psycholog carnegi mellon pa abstract import area applic machin learn autom acquisit knowledg base requir expert system review major paradigm machin includ neural genet rule analyt approach rule induct greater detail review recent case state rule induct statu result expert system identifi main stage field appli learn system draw lesson success applic introduct machin learn studi comput method improv perform mechan acquisit knowledg experi expert perform requir domainspecif knowledg engin produc hundr ai expert system regularli industri machin learn aim provid level autom knowledg engin replac human activ automat techniqu improv accuraci effici discov exploit regular train data ultim test machin learn abil produc system regularli paper examin recent success appli machin learn problem review basic learn focu method induc logic rule experi describ field applic method discuss number applic effort detail conclud discuss lesson suggest project affili institut studi learn palo ca applic machin learn paradigm machin learn machin learn held common goal similar evalu method gener aim improv perform gener approach involv find exploit regular train data evalu aim show learn method lead perform separ test realist perform test set learn research machin learn tend associ main share basic assumpt perform learn algorithm major area neural repres knowledg network unit spread activ input node intern unit output node weight link determin activ pass activ output node translat numer predict discret class input approach learn neural net framework typic improv classif predict accuraci modifi weight link common learn carri gradient descent search space modifi attempt minim error network make train data summar recent research neural network describ applic approach repres knowledg term specif case experi reli flexibl match method retriev case appli situat common nearest neighbor simpli find store case nearest distanc current classif predict learn typic store train instanc gener occur retriev power resid index scheme similar metric identifi relev sophist variant adapt retriev case situat allen describ recent applic genet paradigm machin typic repres knowledg boolean binari condit action rule common interpret knowledg emploi match strength rule resolv conflict architectur rule appli produc behavior standard learn oper genet call crossov mutat analog biolog genet gener candid rule parent high strength reflect measur perform train case genet method carri parallel hill retain set compet complementari descript memori goldberg review genet approach machin learn optim problem applic machin learn fourth call rule emploi similar knowledg structur perform element sort instanc branch tree find rule condit match typic match process inform class predict store action side rule leav tree learn algorithm framework carri greedi search space tree rule typic statist evalu function select attribut incorpor knowledg structur method partit train data disjoint attempt summar set conjunct logic condit quinlan describ algorithm detail final term analyt repres knowledg rule logic typic emploi perform system solv problem search process common techniqu repres knowledg horn prolog phrase problem search proof learn mechan framework background knowledg construct proof compil proof complex rule solv similar problem search local singl step work analyt learn improv effici dealt improv accuraci classif task reason distinct ident paradigm histor scientif commun origin reli basic metaphor propon neural network analog research human student genet algorithm specialist rule induct heurist analyt method reason formal logic question benefit differ notat rhetor obscur import underli similar recent comparison learn method break tendenc describ result learn term geometr boundari research current author hold neural network logic rule produc analyt method learn fewer instanc method logic rule necessarili easili understood domain expert claim increasingli back care studi rhetor statement research literatur reveal number healthi trend line hybrid method cross paradigm boundari increasingli common includ algorithm induc tree linear threshold unit techniqu transform rule neural network back research theori combin analyt method emphasi background knowledg rule induct emphasi heurist search recent work applic machin learn induct logic review bratko muggleton adapt algorithm rule induct logic languag prolog converg sign balanc matur field note research machin except work analyt simpl classif predict robust learn method design problem restrict classif complex process plan sequenc individu involv simpl classif predict effort approach remaind review applic rule induct matur analyt learn focu paradigm central machin learn robust current survei neural genet algorithm recent journal goal complement provid reader complet view recent advanc machin learn reader find addit refer approach machin learn field applic rule induct clarifi potenti rule induct section field applic approach case describ reformul term machin statu result knowledg base sampl exhaust field close mention briefli recent approach yield chemic process control fuel nuclear power plant commonli gener transform ga high expert predict batch good bad research statist method predict qualiti partial interact predict attribut limit effect approach path induct plai central role collect sampl batch high low manufactur control set paramet numer symbol ran train data transform result tree rule predict qualiti repeat process find rule predict space review grow literatur learn probabilist includ tree probabilist concept bayesian influenc network learn paradigm young produc field applic applic machin learn tive give structur knowledg base care present rule experienc process found plant technician began control process data repeat induct process produc accur rule field expert system led higher reduc busi ten million dollar year make credit loan compani regularli questionnair collect inform peopl appli decid make loan process long partial autom american express uk statist process base discrimin analysi reject applic fall threshold accept remain percent applic fell region refer loan offic record show loan offic accur predict borderlin applic default loan observ motiv american express uk method machin learn improv process start train case descript attribut ag year michi colleagu induct method produc node ten origin made correct predict borderlin applic addit achiev improv compani found rule attract explain reason applic project intend exploratori week effort develop american express uk impress put result knowledg base develop diagnosi mechan devic electr motor pump plai import role chemic prevent mainten common strategi reduc interrupt chemic branch larg italian oil regularli check pump measur vibrat point determin repair machineri includ motor shaft connect elast motor pump anchor ground elast support bear typic fault includ unbalanc faulti distort base domain expert reli fourier analysi vibrat aid diagnost saitta believ task benefit machin learn work expert produc expert system diagnosi motor repres knowledg term tradit applic machin learn ing techniqu infer knowledg code inform manual construct rule base research found expert measur vibrat place result mathemat diagnosi collect exampl pump measur domain expert label instanc exampl giordana al ran data induct algorithm produc set diagnost rule method causal glean constrain process likelihood accept result experi learn knowledg base accur induc rule replac origin diagnost system notic reduct idl time due improp halt learn rule greatli aid experienc person replac human expert retir automat classif object observatori sky survei produc terabyt imag billion sky object astronom classifi catalogu object photograph plate manual aim handl star visual inspect exist comput method attempt handcraft expert system task produc reliabl advanc adapt machin learn approach problem techniqu describ object set imag term standard numer object statist moment object core bright astronom assign label object research ran train data algorithm produc tree classifi object initi result yield low accuraci test object fayyad al work astronom addit predict defin term accuraci induc knowledg base level astronom scientif data analysi research result classifi manag system support varieti statist distribut system classifi object sky survei imag task impract human system classifi object rang magnitud catalog survei produc catalog time size achiev machin learn monitor qualiti roll commonli roll cold cool water properti qualiti steel depend critic applic machin learn steel work continu monitor properti oil concentr presenc base factori staff determin qualiti magnet filter replac complex staff consult expert sought manual elicit dialogu approach develop collabor local research induct exampl expert train data induc tree instal steel chang knowledg perform satisfactorili attempt manual adapt develop collect exampl expert induct method obtain tree success formul set attribut collabor expert result knowledg base regular factori reduc band print print involv press continu suppli paper copper cylind bath ink band develop cylind print process print page print run halt case cylind substanti cost reason band larg expert reliabl predict occur evan fisher decid induct reduc problem plant larg print compani work technician collect posit neg case factor potenti relev present case evan fisher ran data construct tree predict probabl band class situat research translat induc tree small set post plant floor print team technician rule set ink factor procedur greatli reduc frequenc band effect band incid drop print team accept rule improv separ ga oil crude oil extract oil natur begin process separ ga configur wai compon separ vessel british induct determin set paramet applic machin learn function rel amount temperatur similar factor complex configur task led develop approach call structur induct scheme incorpor made tree test branch higherlevel learn task induc tree separ report british develop collect train provid knowledg base rule organ set compani subsequ translat line fortran code softwar regular deal task ten minut requir human expert dai prevent breakdown electr transform util compani electr transform distribut power deterior joint problem costli breakdown expert predict failur accur ga reveal chemic trace transform oil reduc expert work steam insur industri fund develop expert system task rule induct result set rule check valid identifi presenc infer fault suggest correct action evalu test case show induc rule expert diagnosi case system regular automat produc report client insur compani addit field applic rule induct exampl constitut fraction field applic rule result publish scientif literatur donald michi report induc knowledg base fault circuit board routin european electron laboratori save million dollar year jean expert develop regularli siemen configur equip build gill mention develop partli south african bank evalu applic credit card david stirl similar approach develop rule predict effect roll steel australia softwar compani special applic rule induct david softwar report system advic share secur dealer european system predict mortgag leed perman build system public pai phone reduc visit engin speed system predict likelihood retain good applic machin learn insur system profil averag claim medic health insur compani monitor excess claim client provid similar describ support tool administr swedish site thermal analysi system control treatment iron swedish save ton minim reduc energi advisori system select paint metal coat commerci sweden system evalu capabl militari unit save swedish defenc materi administr ten million system predict breast cancer patient develop tumor year doctor central hospit sweden servic report compani field number system develop similar method appli work machin learn addit field applic previou mention number effort strong appli flavor system regular rang task cover addit evid robust flexibl method autom complet repetit form complet form tediou activ continu occupi enorm time busi govern partial autom process produc substanti cost write separ expert system form approach schlimmer develop advisori system learn predict user prefer observ increment version induct find rule predict default entri field term field user overrid predict learn rule experi show save keystrok effort correctli predict entri form system administr staff schlimmer depart hardwar end project support mainten knowledg base earliest set expert system automat design transform oper corpor year recur cost manual incorpor design knowledg technolog expert system clear approxim half lifetim cost incur maintain knowledg base regular mainten applic machin learn error introduc code problem devic user evolv greiner describ diagnost system tomographi scanner regular basi technician siemen oper error knowledg base start emerg langlei al consid exist induct algorithm theori handl method design knowledg repres horn exist diagnost system fault hierarchi research borrow search framework exist replac learn oper fault hierarchi method test preliminari evalu synthet realist data encourag speed interfac interfac increasingli flexibl coverag effici algorithm grow interfac slow respond improv parser lose user appli analyt learn method problem note linguist knowledg system definit easili transform analyt learn techniqu approach compil success tree sentenc handl analog sentenc phrase structur singl step system construct tree index result rule lexic categori constitu reduc factor time sentenc larg corpu base user actual queri test engin space shuttl main engin space shuttl requir extens test oper test fire produc megabyt data sensor locat engin team engin examin data determin test run engin perform meet stringent criteria decid test fire replac engin evalu process method british construct structur tree task describ result design handl data rule organ rule set knowledg construct analyz dynam data frequenc induc similar fashion larger softwar system support test process applic machin learn field test modul suggest extens system forecast sever numer model predict weather pattern dai local forecast reli human determin chanc sever factor amount potenti low high turn analyz data stabil indic describ expert system task nation sever storm forecast center system hierarch structur support explan test period sever made accur predict tradit method predict structur protein larg unsolv problem molecular biologi involv predict secondari structur protein inform primari amino acid sequenc theori predict abil disappoint sternberg attack problem induct logic felt relat domain protein ff treat posit protein train instanc includ background fact residu posit physic chemic properti residu initi rule gener induct algorithm moder accur ad rule predict background fact repeat induct rule set produc result repetit strategi gave predict rule accur separ test higher result protein literatur autom schedul steel mill materi schedul steel mill complex task expert divid major receiv incom materi transfer materi plant rout iron screen plant depend size lump blend send directli michi describ effort iron steel south construct expert system process structur induct applic team interview expert determin potenti relev attribut compon ran train data algorithm produc structur knowledg base result schedul includ rule perform compar domain expert oper test applic machin learn learn strategi flight control fly land small airplan emploi complex skill expert difficulti commun system task pilot aid train novic michi collect trace expert behavior flight store pilot action sensor read time step treat descript step train pass algorithm partit data distinct land result action task sensor control simul aircraft accur expert recent studi suggest ad simul lead robust fly behavior rang situat addit applic relat approach list exhaust exampl machin learn applic research explor broad rang diagnosi popular problem area el appli method diagnosi repair helicopt blade literatur abound exampl machin induct medic diagnosi human onlin data set fall area repeat demonstr induc knowledg base accur effort led field system problem lie induct gener knowledg doctor reluct adopt knowledg base techniqu machin learn independ develop statist produc similar method stone describ set method induc test varieti appli predict surviv recent patient relat line statist autom interact detect wide analysi survei data similar techniqu includ wide statist make technolog rule induct access wide audienc strategi lesson effort appli rule induct machin learn method follow standard seldom made explicit literatur section attempt main stage note lesson exampl present earlier draw tent sourc power success applic applic machin learn formul problem step machin learn solv problem reformul problem term handl induct method process schedul complex identifi compon involv simpl task exist robust induct algorithm repeatedli develop transform appar difficult problem classif task applic work langlei al al emploi learn method dealt directli complex perform element project produc field knowledg simpler approach number develop reli techniqu structur involv divid complex task provid train data separ produc perform system carri factor avoid complex induct process muggleton al ad predict produc learn rule background knowledg round altern learn task formul problem intuit research natur search rule tree directli predict valu process ink humid control task examin develop induct find rule predict directli effect process appar user familiar formul similar work report al michi gener drawn determin step appli machin learn techniqu settl effect train data knowledg learn refer tree neural attribut featur describ exampl result learn engin find effect phenomena central project examin involv talk domain expert advic attribut predict case fayyad al work involv search featur descriptor provid discrimin power obviou featur lack case featur comput establish method fayyad al reli heavili establish techniqu imag process transform digit imag descript handl tree applic machin learn incorpor tradit statist measur work forecast giordana al output fourier analysi primit attribut valu collect train data settl task collect train data induct process process straightforward pose challeng evan fisher work band research print technician record period valu process variabl technician reluct wast time collect data machin work effort persuad record valu machin work properli fail applic domain fall expert classifi train data gener avail data depend heavili instrument system studi ideal expert system ti directli flow data oper system instrument expert system instrument increasingli design machin access data stream gener data lack import part appli work machin learn evalu learn knowledg rule induc train data necessarili high qualiti perform knowledg acquir empir question answer knowledg regular basi standard approach evalu involv divid data train test induc knowledg repeat process number time averag result estim rule perform complet problem kibler langlei method sort broad class learn algorithm human expert ignor articul knowledg fulli import part evalu process expert examin learn knowledg problem emerg suggest problem formul evan fisher encourag iter process develop field work similar approach field knowledg base final stage applic field learn knowledg base intend term knowledg acquir comput system evan fisher simpl rule set written applic machin learn paper human make allevi band problem fayyad al user expect comput implement learn softwar support machin learn import learn knowledg graphic interfac chanc domain hurt explan capabl welcom user case giordana al work exist field expert system field learn knowledg base user convinc system benefici object improv knowledg fact machin learn gener knowledg mean easier introduc machin learn system extens expert system place introduc expert system learn compon time made number comment role user expert design learn system secur actual written import motiv user domain particip design applic introduc comput interfac usabl conveni appli design applic machin learn industri situat sourc power appli machin learn paper examin number applic rule regular move goal applic effort establish induct algorithm oper emploi sophist techniqu domin research literatur develop applic draw method prove versatil applic laboratori simpl method close inspect project suggest power specif induct proper formul problem craft make learn tractabl machin learn complet autom knowledg engin replac knowledg engin simpler problem design good develop plai reduc time effort develop short fall complet produc system great practic concentr question comment sourc power result emerg replac algorithm neural learn techniqu recent compar studi show roughli perform applic machin learn consist predict person comfort familiar accid procedur produc similar result applic similar phenomena notic appli manag scienc tool problem schedul result natur problem space global optima easi find local optima good global method produc compar perform accustom work complex situat admit analyt long awar fact river span radic reason machin learn replac knowledg engin framework construct exampl show progress autom anticip rule induct learn method increasingli preval benefit acknowledg peter donald steve muggleton point applic effort donald michi deserv larg share credit foster project develop comment ivan donald anonym review improv earlier draft articl work fund part grant author offic naval research advanc research project institut studi learn refer de method multiwai partit classif tree journal appli classif regress tree wadsworth bayesian method induct probabilist network data machin learn el industri expert system acquir machin learn appli artifici overcom process delai induct ieee expert autom analysi explor imag challeng journal intellig inform applic machin learn model increment concept format artifici autom learn industri diagnosi langlei kodratoff field applic machin learn san morgan kaufmann ten minut lai foundat expert system user complet repetit form ieee expert expert system cold roll mill steel work thirteenth symposium inform technolog yugoslavia machin learn scienc european work session learn theori fault hierarchi intern workshop princip diagnosi ny process control method feedback advanc current develop expert system quinlan applic expert system problem concept format quinlan applic expert system direct machin intellig comput induct knowledg case studi mcgraw read knowledg current practic trend elli horwood protein secondari structur predict machin learn protein engin program machin learn san morgan kaufmann induct knowledg case studi quinlan applic expert system transform fault detect diagnosi radian radian corpor applic machin learn quantit evalu learn optim tool natur languag system twelfth intern joint confer artifici intellig morgan kaufmann learn fly ninth intern confer machin learn morgan kaufmann expert system aid sever forecast fourteenth confer sever local storm indianapoli
ML/1000 6 fl kluwer academ boston manufactur netherland survei method scale induct algorithm foster provost bell atlant scienc white york depart inform pa fayyad abstract defin challeng kdd research commun enabl induct learn algorithm mine larg summar exist work scale induct paper serv establish common ground research address challeng concentr algorithm build tree rule order provid focu specif issu techniqu gener type data mine begin discuss import issu relat scale highlight similar scale techniqu categor main approach contrast constitu draw specif exampl publish paper analysi suggest proce deal larg futur research effort scale induct rule learn introduct knowledg discoveri data mine commun challeng develop induct learn algorithm scale larg data set smyth paper lai foundat kdd work scale compar contrast exist method restrict scope survei techniqu design scalabl issu effici file system storag network interfac problem relat design induct algorithm analysi primarili algorithm learn classifi includ structur relat form tree rule set studi specif topic gain gener understand scale data hope read paper address mean highlight import issu show similar exist method group categori discuss techniqu show similar differ techniqu provost type conclud suggest research practic emerg survei analysi scale organ larg repositori sort data fayyad al cite repres exampl gigabyt data kdd appli induct learn algorithm larg data set order discov knowledg question scalabl algorithm process larg data set build model exist larg data set suffici motiv scale effort select small subset data data commonli cite reason scale size train set accuraci learn classif model degrad accuraci learn smaller sampl stem overfit due program learn small disjunct porter element class descript cover data domain account larg portion class descript provost high accuraci depend abil learn small disjunct account special case exist data complic small sampl imposs differ special case spuriou data point overfit small data set due exist larg number featur describ data larg featur set size space model search evalu candid model likelihood program find model fit data cohen larger set thing difficult featur learn small disjunct larg featur set lead larg popul model program search model cover special case small disjunct data mine applic concern predict discoveri interest knowledg larg accuraci primari concern scale issu abil learn small disjunct interest scientist busi small disjunct captur special case unknown analyst common classifi order swamp spuriou small disjunct essenti data set larg instanc special case gener confid scale induct algorithm clear scale larg data set fast learn algorithm develop motiv fast learner interact induct induct learner human analyst interact real requir fast learn algorithm order practic wrapper problem algorithm iter search featur subset good paramet set buchanan requir fast learner system run learn algorithm multipl evalu condit wrapper evalu involv multipl run produc perform statist experi learn requir larg data set avoid overfit due bia select gordon final popular practic learn multipl model combin predict multipli run time larg kdd commun includ research includ machin promin work research machin accustom deal flat file algorithm run minut desktop platform instanc coupl dozen featur begin rang data set commun deal gigabyt mean gigabyt larger srikant data data mine simultan data preprocess techniqu reduc order magnitud size data set present algorithm data reduct preprocess restrict view learn algorithm fundament restrict data mine survei concentr algorithm mine algorithm perspect issu publish work million exampl consid larg data set huber assess statist invit talk data size megabyt qualit scale problem begin human algorithm theoret issu scale inher pragmat scale learn issu speed slow algorithm turn algorithm practic provost crucial issu seldom run problem deal point view complex scale problem limit factor data set number exampl relat algorithm question growth rate algorithm run time number exampl visibl publish number attribut describ number valu attribut stori space crucial scale absolut size main memori comput platform equip exist implement learn algorithm oper train set main memori matter comput complex main memori limit lead virtual memori algorithm scale goal learn consid evalu effect scale techniqu complic degrad qualiti learn permit vast major work learn algorithm classif accuraci metric algorithm compar interest method scale substanti accuraci problem requir mine regular data metric effect measur system scale agraw method scale techniqu implement scale induct algorithm similar techniqu appar categor main approach techniqu separ categori independ appli simultan main approach ffl design fast algorithm ffl partit data ffl relat fast algorithm approach includ wide varieti algorithm design techniqu reduc asymptot optim search find approxim solut exact advantag task inher parallel data partit approach involv break data set learn possibl combin result data partit avoid thrash memori manag system occur algorithm process huge data set main memori scale induct algorithm hennessi learn algorithm time complex linear number process sampl sequenti make constant term depend size subsampl system distribut processor mine subset concurr approach orthogon select subset select subset relev featur focu attent relat approach address data feasibl treat flat includ larg relat larg relat structur knowledg artifici intellig techniqu frame learn relat flatten learn augment relat background knowledg figur summar gener method make broad approach scale induct algorithm discuss constitu method detail section scale method main approach gener method fast algorithm restrict model space power search heurist optim parallel data partit instanc sampl featur sampl process sampl increment process sampl concurr relat repres data integr data mine manag figur method scale induct algorithm comparison method group method broad categori bring order wide varieti illustr techniqu consid relat similar summar method categori order highlight strength weak flesh survei descript specif instanti method literatur provost survei exhaust repres current state place recent work context number histor import exampl impact begin design fast learn algorithm fast algorithm gener method techniqu restrict model space tree power search heurist divid conquer increment reduc error prune avoid search reduct dynam restructur effici data structur optim bookkeep strategi optim comput infrastructur parallel parallel parallel match figur method design fast induct algorithm fast algorithm straightforward approach scale induct learn produc effici algorithm effici exist algorithm larg fast algorithm suffici practic data mine case larg featur relat fast algorithm fast induct algorithm problem work fast algorithm strive time complex number exampl line huber observ maximum toler time complex discuss analyt framework facilit discuss algorithm adopt commonli data mine frame search space model model perform respect criteria lea framework natur partit design categori method restrict space model base scale induct algorithm straightforward principl small model space faster search larg larg model develop power search mean heurist find competit model discuss exampl method proven effect effici discuss optim detail literatur discuss approach parallel speed induct algorithm restrict model space approach design fast learn algorithm restrict search model space exampl effect restrict learner viabl method learn classifi hart complex machin learn method typic justifi note captur relationship data research symbol neural learn shown simpl model perform problem shavlik al show accuraci perceptron distinguish complic learn simpl map valu attribut class label shown achiev moder high accuraci common benchmark langlei restrict model simpl learn algorithm train quickli haussler relat model space notion induct bia valiant theoret framework gist model space easi search simpli small special structur weaken power express linear tone research induct algorithm chang markedli accept restrict hypothesi space algorithm legitim competitor reason chang fast algorithm facilit competit benchmark competit perform simpl classifi make difficult justifi complex algorithm interest develop simpl classifi perform subsequ work auer al introduc theoret found call learn tree show fifteen data produc tree rival surpass de facto standard practic faster shih present power search heurist domain leverag gain search complex model size structur space size sampl learn comput provost complex algorithm search space intim relat search complex model harder haussler point larger hypothesi space strictli easier find consist hypothesi larger hypothesi space exampl space formula disjunct normal form induct algorithm design includ learn rule search space variant dnf formula haussler model space vast structur facilit power heurist navig effici vast model unusu learn algorithm search space directli gener altern model singl model built evalu compon evalu individu dnf class descript built space conjunct learn larg data data set evalu individu conjunct scale larg data set complex learn algorithm close linear number exampl algorithm design success approach build class descript chose learner popular cart stone fast typic produc competit classifi tree gener successor de facto standard comparison machin learn produc good classifi quickli data growth run time linear number exampl asymptot time complex number exampl train set number attribut numer data typic requir repetit add log term complex report tree built greedi achiev admir classif critic lack situat rule set desir modular common techniqu produc rule grow rule algorithm prune rule order accuraci prune system gener scale variant empir observ requir time algorithm effect find rule set time complex noisi domain describ speed parallel discuss scale induct algorithm furnkranz widmer increment reduc error prune speedup obtain prune rule learn appli strategi base prune rule formal analysi predict comput complex log verifi empir cohen accuraci class descript learn lower accuraci learn slower cohen detail modif improv includ stop produc algorithm ripper ripper shown competit term error maintain log time complex domingo improv effici grow rule full length place point commonli method induc rule evalu rule regard effect rule avoid superflu rule grown cw algorithm evalu context held rule set cw time complex approach similar approach algorithm style feigenbaum rule learner introduc optim style rule learn rl provost etzioni includ prune massiv search larg rule space webb introduc techniqu dynam restructur optim show search exhaust rule optim laplac accuraci estim categor benchmark data set uci repositori murphi optim previou subsect discuss main method design fast learn search restrict model space emploi power search heurist left literatur algorithm optim effici data structur bit hash binari search clever program techniqu good engin complement method scale practic give larg speedup optim remark publish work order perform exhaust search algorithm optim carefulli etzioni segal etzioni report train process rule run processor note addit speedup expect speed order magnitud machin clock rate notabl optim procedur learner rissanen deal learner reduc effici deal provost attribut train data sort numer attribut begin tree avoid multipl pass data mention induct algorithm load data main data set algorithm virtual memori thrash render useless altern approach load entir data set access secondari storag secondari storag devic typic provid random access algorithm design process data sequenti advantag singl pass data level tree grown breadth data structur step size proport number input size structur limit factor approach limit address sprint system mehta data structur sprint regard wide standard scalabl build honor scrutini lead advanc sprint maintain augment vertic partit copi data structur critic reason maintain data structur includ potenti tripl size scan cost chaudhuri bring remark data mine simpl bookkeep techniqu point recent independ research group main insight match data statist suffici infer result match learn statist queri separ gener suffici statist evalu treat data popul statist data structur oper data afford optim memori improv complex critic data mine node construct talli exampl point class label valu attribut straightforward data structur store statist tabl count index class av attribut valu long av combin size data structur smaller size data set john lent point data structur return sql group queri induct algorithm pass set node algorithm pass set level scale induct algorithm pair tremend effici achiev attribut larg set provost fast contemporari search algorithm etzioni gener conjunct match set comput statist complex depend averag number valu attribut domingo report time complex cw algorithm bookkeep techniqu reduc complex provost provost show similar techniqu learn hierarch structur data return discuss relat tree shown compar fast shih program similar analysi code show evalu node build decid split note preliminari experi addit optim show substanti addit speedup singl successor observ substanti faster predecessor ramakrishnan provid treatment suffici statist build tree size data set exce main memori discuss option data structur big main present famili algorithm moor lee lee present special data structur design advantag suffici statist speed induct algorithm moor doubt cost build worthwhil individu run fast learn algorithm obviou candid intens system run algorithm time data interact system wrapper discuss induct program comput infrastructur data mine read larg amount read data longer mine parallel system optim data layout make differ bailei parallel discuss techniqu design fast learn algorithm complet portion devot opportun parallel process process induct learn illustr main method parallel parallel parallel match discuss induct learn view search larg space search space processor search portion space parallel holder similar parallel form heurist search provost rao kumar load balanc commun add addit complex overhead cook holder parallel difficult provid benefit sequenti type parallel address problem larg data processor deal data discuss recent zaki al agraw success parallel advantag share memori avoid replic commun entir data set processor share memori develop effect load balanc techniqu holder success recent search space parallel scale data mine algorithm holder request match algorithm sequenti machin parallel machin instanc match routin search figur parallel match parallel learn success decomposit parallel match approach base observ search induct learn ai search induct learn cost evalu node highli node search space partial rule tree match exampl gather statist parallel match depict figur match process farm migrat set match routin parallel main learn algorithm run sequenti front end scale induct algorithm parallel match al provost parallel sprint algorithm mehta effort straightforward parallel match routin sprint processor build sublist attribut node send master portion statist determin split impress speedup report parallel minut learn million exampl connect machin processor learn million exampl ibm processor mehta parallel speed transform tree rule parallel match phase divid rule set report impress speedup averag learn task drawback parallel match approach easi obtain access massiv parallel hardwar zaki point multiprocessor system present parallel match approach design smp version sprint distribut process vertic partit sprint attribut list attribut list divid equal return match statist master access parallel hardwar concern data resid data parallel infrastructur freita make exist parallel server technolog approach similar shown figur parallel data replac exist parallel system commun match request replac sql queri commerci data mine system vendor cite approach confront issu technic detail specif data mine system discuss system sql queri scale detail section approach parallel partit data run learner concurr subset approach section parallel data mine treat detail recent book freita data partit previou section address design algorithm fast run larg set orthogon approach partit data avoid run algorithm larg data set data partit techniqu categor base separ subset exampl subset featur view data set categor provost data partit gener method basic techniqu instanc sampl random sampl duplic compact stratifi sampl featur sampl relev knowledg statist indic subset studi process sampl sequenti independ learn sequenti learn sequenti featur select process sampl concurr learn multipl pick combin class descript combin predict cooper learn figur data partit method respond select row versu select column figur illustr techniqu select singl subset learn multipl subset chosen process sequenc concurr figur depict gener model show similar approach system approach select subset sn data base select procedur learn algorithm ln run produc concept descript cn concept descript process combin select cn combin produc final concept descript system differ procedur select combin differ amount style interact learn algorithm learn concept descript instanc sampl common approach cope learn larg data set select singl sampl larg data set refer figur sampl form singl subset chosen differ sampl techniqu involv select procedur scale induct algorithm final set larg sampl select procedur combin procedur figur learn data partit catlett studi varieti procedur sampl larg data set compar empir result techniqu studi ffl random sampl select subset exampl randomli ffl duplic compact remov duplic instanc comput effort proport complet desir provost ffl stratifi sampl applic class valu uniformli distribut train set exampl minor select greater order distribut reader difficulti accept sampl method scale larg data sampl reduc size data set process import examin function algorithm perform classifi induct algorithm data set input produc classif model output discuss question scalabl algorithm process larg data set build model sampl produc model lower accuraci scale question sampl produc sampl effect scale mechan sampl accept statist observ power intens procedur oper subsampl data fact provid superior accuraci sophist entir data mine larg data import question process sampl answer depend data set massiv data set impli necessarili mine amount data rate accuraci form familiar learn curv ubiquit machin learn research sampl effect depend dramat rate slow larg data sampl difficult determin depend factor priori discuss depend minimum size special case learner discov order model phenomenon effect bia learner learn small special recent work determin suffici sampl size similar data mine problem relev result toivonen zaki al discuss determin suffici sampl size find associ rule smaller predefin base toler probabl error size error view suffici sampl sampl provid valiant theoret framework hypothesi space calcul number exampl suffici learn high probabl good approxim exist hypothesi space publish work differ view classifi learn curv level massiv data set catlett work show learn subset data accuraci advantag sampl improv accuraci classifi random sampl catlett conclud solut gener problem scale larg data set note time catlett data set smaller process time longer scale induct algorithm catlett base data set fewer instanc data set studi fit main memori modern desktop pc studi kdd benefit replic catlett current state stand decad technolog improv recent analyz relationship data set size accuraci larg busi data set estim learn curv empir found algorithm level case algorithm learner successor continu show accuraci entir rang data set size improv accuraci upper size limit difficult conclud continu order magnitud data set size author note import question benefit improv worth cost result catlett provid ampl justif mine data main memori data set size modern standard process main memori pc field benefit promin exampl scale reason main memori limit oat jensen studi learn tree nineteen data specif number exampl learn curv reach plateau regard plateau reach accuraci estim toler maximum nineteen data plateau reach train exampl data set exampl uci repositori murphi plateau exist massiv volum sampl accuraci famou applic induct fayyad al sampl techniqu reduc terabyt raw data import sampl effici scan entir data set order produc random advantag sampl lost return point address support scale data mine discuss call sampl determin complet induct begin catlett studi tactic sampl reduc complex learn algorithm process larg data set search good split valu numer attribut domin induc valu sort catlett found subset exampl search good split valu numer provost run time learner reduc substanti sacrif accuraci numer complex learner roughli quadrat number achiev linear complex subsequ al introduc measur assess risk evalu attribut induct show determin choic attribut made confid error determin larg requir featur sampl discuss sampl select subset exampl turn problem select subset featur data engin visibl literatur algorithm issu featur select issu receiv superfici treatment kittler mohri major exist work featur select directli scale phenomenon reduc size featur accuraci result class descript import clarifi close relat reason select featur subset discuss section size featur set chanc induct program overfit train set small train set select good subset accuraci number exampl featur select featur select perspect run time induct algorithm grow number rate linear select subset featur import practic algorithm independ select accuraci select subset featur common method reduc problem size neglect discuss scale set learn small set possibl relev variabl chosen restrict base data collect base knowledg relev interact domain expert variabl includ variabl describ auxiliari provid relat inform field link massiv demograph inform addit field ad reason relev prior relev knowledg method select subset featur approach describ problem featur empir studi select subset publish statist indic reduc scale induct algorithm number featur scale techniqu view straightforward includ public comput correl individu featur target select practic manag subset featur high correl michalski high inform gain dietterich simpl method miss featur combin chen yu address problem combin instanc sampl featur similar catlett al chan yu method attribut extract improv effici deriv classif rule larg train data set featur extract subset train data set analyz identifi relev subset featur featur combin extract featur evalu predic strong infer power identifi yu algorithm experi randomli drawn exampl identifi highli relev featur process sampl sequenti effort address learn multipl subset combin result approach sampl process sequenti differ method involv concept descript learn previou iter combin procedur oper approach section select procedur partit data set randomli subset figur show gener model learn figur show model independ interact learn form combin fayyad al sequenti independ approach rule set extract combin procedur greedi cover algorithm multipl sampl process advantag knowledg learn iter guid learn iter figur show approach sequenti learn instanc shown figur activ sampl class descript determin increment batch shown figur class descript input learner build sequenti techniqu research address learn larg data set quinlan instanc select call window call augment exampl classifi incorrectli select procedur candid provost larg set sampl final initi select instanc select instanc select combin procedur set larg random select final combin procedur figur sequenti instanc increment batch learn exampl randomli stratif combin procedur simpli cn final concept descript catlett studi window learn found effect window learn time vari problem factor speedup factor slowdown sever slowdown occur data noisi conclud window scale solut data set continu attribut window improv accuraci increment batch learner buchanan hybrid sampl increment learn class descript learn algorithm subsampl learn algorithm evalu basi build combin procedur cn final concept cn construct learn run increment batch learn approach scale set larg pure batch process limit main lead accuraci simpl sampl buchanan increment batch learn offer speedup discuss learner theoret scale linearli number entir set fit main oper system page thrash render learner useless increment batch learn approach domingo transform algorithm complex quadrat size set linear algorithm increment batch learn call increment lo sequenti techniqu degrad classif accuraci compar learn entir data set scale induct algorithm approach increment process instanc sampl featur sampl process iter sequenti featur select common statist treatment classifi format kittler common method sequenti forward select sequenti backward elimin note work typic address scale sequenti backward elimin simpl illustr iter run induct algorithm featur techniqu sequenti forward select accuraci scale wrapper approach john buchanan notabl unifi iter select iter featur select iter mention wrapper approach run underli induct algorithm attempt maxim criteria wrapper approach featur select fit framework data partit depict figur select procedur select column row kohavi john wrapper implement forward select backward elimin order maxim accuraci order scale past limit comput provost buchanan implement ad hoc featur select strategi programm wrapper implement increment batch learn sequenti featur select techniqu fall categori sequenti instanc select techniqu figur sequenti forward influenc select case select column row figur approach construct combin class descript learn featur subset found effect buchanan process sampl concurr approach parallel distribut subsampl multipl learn concept descript combin differenti approach parallel match autonomi afford individu learner simpli parallel exist return result techniqu coupl collect independ algorithm recent type algorithm call data subject workshop chan concurr preclud approach prior concept descript input subsequ learn increment batch learn independ shown figur learn concurr learn combin place sequenti parallel hall al discuss approach learn tree similar distribut version approach fayyad al system learn tree independ partit provost tree convert rule rule set merg method william resolv conflict similar rule chan stolfo concurr approach learn separ instanti algorithm independ approach kei differ method form hybrid combin construct select piec approach save combin predict approach pazzani domingo experi type combin increment batch find superior simpl union rule set learn batch potenti problem creat hybrid result loss prodromidi stolfo studi method prune hybrid classifi reduc size preserv improv predict perform approach creat classifi ensembl craven domingo guo author algorithm induc understand model complex learn classif system induc understand model complex classif system provost predict ensembl train learn tree model hybrid perform compar result singl tree understand hybrid shasha research group implement parallel version instanti framework figur select procedur random partit data tree learn subset exampl combin procedur evalu subset exampl accuraci final concept descript accuraci degrad compar run singl learn algorithm provost hennessi distribut depict figur individu learner cooper rule consid accept global consid accept monolith learner entir data set kei accept rule accept statist partit superset accept rule gener cooper form request learn algorithm server entir verif statist discov rule combin procedur union cooper request limit rule good learn scale induct algorithm set larg final select procedur combin procedur figur cooper concurr learner commun minim approach success scale larg data set sequenti version approach basi partit navath call effici algorithm term oper scale scientif discoveri cook holder found approach techniqu partit problem share evalu processor obtain global perspect provost work address distribut process featur subset build tree rule preliminari result suggest line inquiri concurr version independ shown figur featur subset select concept descript subsequ combin result increment featur select suggest class descript languag modul select class creat accur class descript run learner suitabl subset featur buchanan kargupta al distribut process featur subset concept turn gener approach scale relat relat exist induct learn program design handl larg data set major design assumpt data set repres tabl produc flat file relat problem process time substanti storag space flat file lead problem relat design avoid updat delet flatten manag data set longer fit main memori custom tabl million custom twenti includ address product state tabl fifti state eighti field inform product tabl ten product hundr field inform product assum averag size field byte vastli flatten result flat file flatten demand subset attribut describ place inflex restrict unexpect discoveri kdd system make mine smaller data set typic fit main abil relat compress data critic flatten extrem larg data set simpli practic mine repres effici describ repres data mine scale data store fast machin divid collect method depict figur discuss gener issu mine repres store discuss mine repres data set fit main memori integr data mine manag scale induct algorithm relat gener method techniqu repres data hierarch structur knowledg structur induct logic program integr data mine access sql queri manag push comput dbm util parallel engin mine distribut figur method relat system kei treat data integr separ approach uniqu set issu appli close section discuss mine distribut note combin orthogon scale issu privaci mine relat data argu storag effici afford relat mine data repres simpl form relat attribut receiv attent literatur induct learn data compress afford attribut tall tree geograph hierarchi rang descriptor data miner work flat file includ attribut subset limit result discoveri data miner repres hierarchi valu maintain econom data set instanc specif locat index hierarchi instanc finest granular hierarchi draw gener comparison effici mine attribut treat depth al improv provost attribut simpl isa pair relat separ tabl relat tabl tabl expand data mine gener relat provost advoc recent induct learn research circl buchanan abil handl compress unwieldi flat creat possibl augment learn system relat knowledg field learn exist addit tabl knowledg describ field note select auxiliari base beg question data requir identifi relev knowledg augment field relat augment addit field relat scale learn context massiv amount background creat higher scale data mine system view unifi learn relat learn larg amount background knowledg parallel techniqu aid augment induct learner larg network relat background knowledg provost work relat knowledg construct ad proposit concept descript languag al investig learn data item link addit relat background knowledg sake avoid construct induct logic program relat limit learn proposit concept descript field induct logic program concentr mine data knowledg express relat format ilp address harder problem type mine data repres result mine repres learn relat descript harder learn proposit scale problem correspondingli harder note recent work de demoen note full power standard ilp practic studi effici subset ilp learn interpret studi scale logic tree express proposit avoid ilp construct mine data express relat part blockeel al applic techniqu rissanen scale learn massiv data set result learn complex linear number larg data set mine effici rel ilp task approxim exampl process dai cpu scale induct algorithm time sun morik describ integr ilp algorithm facilit effici learn directli subject section data integr data store effici relat relat easili access commerci manag system data mine system access data store commerci mine relat data directli extract data dbm flat realiz benefit effici storag discuss previou subsect approach advantag dbmss effici data retriev relat store commerci mine directli implement core data manipul oper dbm discuss section speed induct program determin primarili speed match gather suffici statist oper cast sql request statist shim shim data mine program avoid massiv data upload problem due main memori advantag fast machin optim queri process sql interfac john lent discuss basic oper type data mine program cast sql queri fayyad chaudhuri show straightforward implement deriv suffici statist sql select union result unaccept poor perform poor perform stem manner system implement system implement union queri perform separ scan union deriv suffici statist union similar author advantag similar extend sql includ oper minim number scan requir produc suffici statist figur show schemat view system integr data mine dbm data mine system zaian prototyp integr data system data surveyor make data integr approach achiev competit perform larg data set sarawagi al discuss altern data integr focu mine associ illustr principl appli gener point effort extend sql provost user interfac induct algorithm sql server data figur data integr support mine discuss express mine algorithm sql paragraph parallel paper detail specif approach note common dbm data mine simpl sourc record dbm data mine program coupl cost switch context program prohibit true record read individu block transfer make tightli coupl approach push part applic program perform intens comput retriev set record bring record applic program method encapsul mine algorithm store procedur approach program share address maintain program flexibl hybrid approach read data temporari local transform effici format drawback cach approach addit storag space approach repres individu data mine oper store sql scale induct algorithm data scan queri run dbm address shim shim approach pass record function faster pass store procedur disadvantag cost rewrit entir mine algorithm function sarawagi al gener case preprocessor translat data mine oper form environ integr data mine dbm advantag storag effici relat exist fact dbmss typic resid power platform optim oper section scale extend make parallel server technolog speed sql oper freita achiev order magnitud speedup workstat dbm technolog make sql server data surveyor parallel engin fact data resid dbm reason integr data mine advantag dbm complex knowledg face complex relat scale problem realist applic address exist knowledg system provid access complex knowledg base greenberg show emploi dbm effect storag subsystem knowledg greenberg describ knowledg tool scale massiv knowledg base initi effici gain realiz due massiv made dbmss achiev effici effect dbm techniqu support inferenc data manag advanc effici handl knowledg base facilit futur effort mine augment data mine distribut enabl induct program learn relat make data mine vast amount data background knowledg distribut local scatter internet compani interest mine feder similar data chan digit librari research work facilit access network data inform desir advantag collect scale massiv amount distribut data background inform scale problem manifest issu discuss addit constraint opportun provost distribut data provid opportun concurr mine part similar straightforward parallel data distribut data requir distribut mine combin distribut question varieti reason simpli big combin local system bandwidth commun channel make combin long download data privaci issu prevent unrestrict access data interest access transfer feasibl mine distribut requir system oper separ data partit inform transfer limit bandwidth restrict data set row column method discuss section part stolfo al present approach implement discuss privaci concern restrict feder bank data chan chan altern distribut data mine tabl spread network simplist custom geograph product inform tabl resid machin practic work data mine locat relev tabl transfer carefulli select data mine platform network access provid sql tailor induct algorithm queri remot data mine kaufman describ method perform knowledg discoveri multipl valu augment tabl trace multipl learn individu knowledg segment world system buchanan learn multipl distribut spread spread activ techniqu requir limit commun pass set marker sql relev distribut identifi link manual digit librari effort succe establish ubiquit definit public data mine program metadata search network relev tabl link current problem view bring hard problem collect deal ontolog mismatch data mine effort benefit partial autom part kdd report account effort simon speed scale induct algorithm discuss recommend systemat bodi work scale induct clear area receiv deep clear recommend approach larg problem emerg discuss discuss research provid perspect statist huge data larg data set fit main restrict model space learner effect build competit classifi quickli result simpl classifi effect algorithm data set fit main memori extend direct suggest build algorithm strategi search classifi clear leverag obtain simpl classifi guid subsequ search address specif defici perform data set interest fit main data set fit machin huge main mine effici research learn data set larg fit main memori techniqu clear choic appli revisit briefli lack mine entir data set data mine benefit size data set data set size yield familiar learn curv qualiti result neglig simpli determin learn curv calcul tight bound size requir data set hard comput learn theori provid upper concept class kind learn algorithm bound weak fewer instanc theoret calcul method rel mine huge data conduct experi increasingli larger sampl order estim shape learn curv algorithm langlei conclud mine larger data set worthwhil subset exampl stratifi sampl class domin strongli subset featur empir studi determin relev chosen good subset good subset algorithm effici data accuraci provost learn data fit main modern comput memori slot fill capac straightforward method approach depend resourc massiv parallel match obviou choic access massiv parallel machin special program talent carefulli examin tradeoff match gather suffici statist advantag data good idea cycl engin readili approach requir invest plan mine set data loss flexibl modifi induct method problem engin larg portion kdd process special program talent requir independ learn show scale retain flexibl desktop data mine abil process subsampl concurr offer advantag larg number idl workstat network institut dearth technolog facilit special program talent requir notabl except jam agent download stolfo web site research issu data problem characterist dictat gener guidanc choic constitu method method studi exist studi compar rel merit research reach border stage stage theoret empir research claim understand treatment sampl kdd includ research achiev common understand sampl build artifact enabl effect stratifi sampl predict perform origin recent work chan stolfo time concept sampl data tent classifi contribut commonli cite kdd compon machin learn statist long rich histori theoret work directli applic tailor current context kdd embrac effort base past provid common theoret understand issu scale induct algorithm discuss sampl assum produc random sampl effici larg data set difficult larg simpli true produc random sampl requir scan entir tabl naiv implement obviou implic claim algorithm effici asymptot complex linear total number instanc understand sampl oper organ effici sampl remark advanc made learn effect larg number learn effect larg number featur data mine problem scale massiv number learn algorithm fast effect good deal type autom larg lee buchanan john exist algorithm provid strong baselin approach compar algorithm winnow effect detect irrelev straightforward augment algorithm reduc number featur automat number exampl grow total size data set area research effort mine larg relat link relat background knowledg research broad affect develop data integr algorithm learn main approach storag economi relat larger data set process main memori flat file abil mine structur data knowledg effici nice current effort make vast amount inform bring view research horizon drawn clear read organ hundr paper scale induct algorithm work establish kdd accept field studi seemingli product relev result interdisciplinari natur research undertaken benefit insight substanti similar work place place task research effort focu found strike similar effort complet independ fact time fundament ident technic advanc made simultan independ group provost hope survei establish common ground futur effort reach higher design fast algorithm stand clear effect increment clear chain advanc fast rule learn fast learn research approach mine repres data consist independ strike common exist approach area readi emphasi compar increment advanc gap literatur lack common understand power sampl data discuss dearth convinc exampl mine massiv data set acknowledg indebt includ john lar bruce jason pedro phil doug dan david rich sal anonym previou influenc view scale discuss point relev work peter huber gave invit talk larg statistician reaction kdd summari summari observ includ specif statement tom dietterich review state scale recent articl trend machin learn develop review occur independ benefit insight produc final version pedro tom rick doug anonym comment fayyad encourag turn inform summari formal survei work partli support nation scienc foundat grant note version paper technic report web overview run time illustr comparison infer experi conduct compaq comput ram run window nt run time exampl fifti minut minut justifi call link tabl recal direct correspond relat knowledg structur gain analyz extent prior knowledg reduc amount data effect learn scale induct algorithm rememb size set product number exampl number featur halv number featur elimin irrelev accuraci doubl number exampl occupi fix space refer shim develop applic ibm relat methodolog experi research report rj ibm corpor shim develop data mine applic relat system intern confer knowledg discoveri data menlo pp aaai press srikant fast algorithm mine associ rule research report ibm corpor pazzani error reduct learn multipl descript machin learn handl attribut tree learn twelfth intern confer machin learn morgan kaufmann massiv parallel match knowledg structur kitano hendler massiv parallel artifici intellig press buchanan knowledg discoveri multipl distribut florida artifici intellig research symposium provost effici construct relat featur background knowledg induct machin learn work note workshop knowledg discoveri seattl wa provost effici data mine algorithm breadthfirst marker propag intern confer knowledg discoveri data newport ca buchanan exploit background knowledg autom discoveri intern confer knowledg discoveri data menlo pp aaai press theori applic agnost small tree intern confer machin pp de demoen scale induct logic program learn interpret data mine knowledg discoveri stone classif regress tree wadsworth intern group morik direct access ilp algorithm manag system sponsor familiar workshop data mine induct logic program feigenbaum applic dimens artifici intellig applic artifici intellig chemic automat rule format mass mean program journal american chemic societi theori learn classif rule ph school comput australia test flight eighth intern workshop machin pp morgan kaufmann provost machin learn larg ph school comput australia stolfo parallel distribut learn work note aaai workshop knowledg discoveri pp stolfo accuraci scalabl data mine journal intellig inform volum pp stolfo scalabl learn class cost case studi credit card fraud detect fourth intern confer knowledg discoveri data pp yu data overview perspect ieee transact knowledg data engin yu predic mine classif rule technic ibm research report buchanan increment batch learn sixth intern workshop machin san mateo pp morgan kaufmann provost tool induct intern ieee confer tool artifici pp ieee effici prune method rule learn system intern joint confer artifici pp morgan kaufmann fast effect rule induct twelfth intern confer machin pp holder learn connect machin intern ieee confer tool artifici san mateo pp morgan kaufmann extract model train neural network ph madison technic report provost small disjunct learn error telephon network local loop tenth intern confer machin san mateo pp morgan provost small disjunct learn error telephon network local loop utgoff machin tenth intern pp morgan kaufmann gordon special issu bia evalu select machin learn kittler pattern statist approach prentic hall machin learn current direct ai magazin effici rule induct intern confer knowledg discoveri data menlo pp aaai press linear time rule induct intern confer knowledg discoveri data menlo pp aaai press knowledg acquisit exampl multipl model fisher fourteenth intern confer machin learn pp san kaufmann hart pattern classif scene analysi john wilei system massiv parallel knowledg ph depart comput colleg maryland editori data mine knowledg discoveri kdd scienc data issu exampl intern confer data mine knowledg menlo pp aaai press scale induct algorithm smyth knowledg discoveri data unifi framework intern confer data mine knowledg menlo pp aaai press machin learn system autom catalog larg scale sky survei tenth intern confer machin learn morgan kaufmann smyth data mine knowledg overview advanc knowledg discoveri data mine menlo aaai press commun volum morgan kaufmann sql primit parallel db server speed knowledg discoveri larg relat cybernet thirteenth european meet cybernet system pp mine larg parallel process kluwer academ publish data mine symposium interfac comput scienc statist widmer increment reduc error prune eleventh intern machin learn brunswick morgan kaufmann knowledg worth ton quantit studi data base statist empir induct sixth intern workshop machin san pp morgan kaufmann holder exploit parallel scientif discoveri system improv scalabl journal american societi inform scienc fast tree construct larg dataset intern confer larg data ny chaudhuri effici gather suffici statist classif larg sql fourth intern confer knowledg discoveri ny aaai press bailei tutori introduct high perform data mine tutori fourth intern confer knowledg discoveri data mine knowledg probe distribut data mine work note workshop distribut data pp privat commun combin tree learn parallel work note workshop distribut data pp zaian system mine knowledg larg relat intern confer data mine knowledg menlo pp aaai press sampl size work paper center advanc technolog induct ai learn algorithm valiant learn framework artifici intellig logic frame frame concept text pp de data search nugget parallel advanc knowledg discoveri data pp menlo aaai press simpl classif rule perform commonli dataset machin learn provost porter concept learn problem small disjunct eleventh intern joint confer artifici san pp morgan kaufmann larg statistician reaction kdd dm intern confer knowledg discoveri data menlo pp aaai press langlei induct tree ninth intern confer machin pp morgan kaufmann privat commun cohen multipl comparison induct algorithm machin learn langlei static versu dynam sampl data mine intern confer knowledg discoveri data pp aaai press lent data intern confer knowledg discoveri data menlo pp aaai press chan workshop distribut data mine scalabl data mine vertic partit featur space collect mine gene express base genet algorithm work note workshop distribut data pp knowledg larg intern joint confer artifici menlo pp aaai press greenberg storag system scalabl knowledg intern confer inform knowledg manag michalski method reason structur continu attribut knowledg discoveri system intern confer knowledg discoveri data menlo pp aaai press effici learn statist queri acm symposium theori pp acm press wrapper perform enhanc oblivi graph ph dept comput stanford palo ca cross academ machin learn commerci data mine invit talk fifteenth intern confer machin learn john wrapper featur subset select artifici intellig featur subset select wrapper overfit dynam search space topolog intern confer knowledg discoveri data menlo ca aaai press estim analysi extens relief bergadano raedt european confer machin learn overcom induct learn algorithm appli intellig gener product rule parallel fourteenth nation confer artifici intellig pp menlo press rao parallel part analysi intern journal parallel program simon applic machin learn rule induct commun acm scale induct algorithm winston massiv parallel symbol learn assist protein winston ai expand ma mit press shih empir comparison tree classif method machin learn learn quickli irrelev attribut algorithm machin learn rissanen fast scalabl classifi data mine intern confer extend technolog franc murphi uci repositori machin learn subset select regress chapman hall gener search artifici intellig learn gener technic report report rutger nj lee effici algorithm minim cross valid error eleventh intern confer machin learn morgan kaufmann lee cach suffici statist effici machin learn larg dataset journal artifici intellig research induct logic program academ press russel theoret subsampl induct larg tenth intern confer machin san pp morgan kaufmann jensen effect train set size tree complex fisher machin fourteenth intern pp morgan kaufmann haussler boolean featur discoveri empir learn machin learn overview issu develop industri data mine knowledg discoveri applic intern confer knowledg discoveri data menlo pp aaai press stolfo prune distribut data mine system work note workshop distribut data pp polici select bia induct machin learn ph depart comput pa scale induct learn massiv parallel machin learn buchanan induct pragmat bia select machin learn hennessi scale distribut machin learn cooper thirteenth nation confer artifici menlo ca aaai press scale induct overview intern confer knowledg discoveri data menlo pp aaai press survei method scale induct learn technic report intellig system pa iter optim polici select search bia eleventh nation confer artifici pp menlo ca aaai press hennessi distribut machin scale parallel intern confer intellig system molecular biologi provost learn effici classif procedur applic chess mitchel machin ai approach lo morgan kaufmann simplifi tree intern journal studi induct tree machin learn program machin learn san morgan kaufmann kumar parallel part implement intern journal parallel program kerschberg knowledg discoveri multipl intern confer knowledg discoveri data menlo pp aaai press agraw integr associ rule mine relat altern implic acm sigmod intern confer manag data navath effici algorithm mine associ rule larg intern confer larg data pp morgan kaufmann etzioni learn list homogen rule twelfth nation confer artifici pp aaai press mehta scalabl parallel classifi data mine intern confer larg data india towel comparison symbol connectionist learn algorithm machin learn lea problem solv rule unifi view knowledg pp lawrenc erlbaum associ agraw mine quantit associ rule larg relat tabl acm sigmod confer mgmt montreal chan credit card fraud detect issu initi result workshop ai approach fraud detect risk manag technic report menlo pp aaai press chan java agent distribut workshop ai approach fraud detect risk manag technic report menlo pp aaai press sampl larg associ rule intern confer larg data base increment induct tree machin learn theori learnabl commun acm effici admiss algorithm unord search journal artifici intellig research mohri review compar evalu featur weight method lazi learn algorithm artifici intellig review technic report naval research laboratori dietterich comparison nearestneighbor algorithm machin learn induc combin multipl tree ph australian nation australia lo increment induct pacif rim intern confer artifici pp scale induct algorithm scalabl data mine rule ph dept comput ny agraw scalabl parallel classif data mine share memori multiprocessor ieee intern confer data engin evalu sampl data mine associ rule seventh intern workshop research issu data engin
HCI/1001 4 structur object transport orient interact wang christin mackenzi school simon fraser bc canada summer booth depart comput scienc british columbia bc canada abstract experi conduct investig relationship object transport object orient human hand context humancomput interact work merg stream structur interact manipul hci natur hand human motor control found object transport object orient interdepend structur gener persist visual feedback condit notion concurr interdepend control structur provid framework interfac evalu design keyword direct input visual inform interfac virtual realiti introduct object manipul basic oper humancomput interact modern comput technolog advanc afford object manipul virtual environ typic provid freedom control graphic displai control spatial state rigid object space complet locat orient spatial state object locat independ orient descript level spatial state object chang object translat object rotat process parallel serial pattern robot manipul program move object predetermin posit arbitrari order translat rotat human hand case direct manipul point relationship object transport object orient longer simpl stream research relat relationship object transport object orient structur interact graphic manipul hci deriv perceptu structur visual research hand human motor control import question natur structur control object translat rotat readi answer question previou research studi address question explor structur object transport object orient human hand context implic interfac design perceptu structur visual inform control structur input devic theori perceptu structur visual inform object attribut integr structur separ structur visual inform integr structur attribut perceptu combin form light satur color visual object attribut demonstr perceptu distinct identifi separ light size object separ structur type perceptu structur object determin direct similar scale method integr structur show euclidean separ structur demonstr distanc perceptu attribut space jacob colleagu extend notion integr separ structur interact task observ manipul graphic object simpli chang valu attribut reason attribut object defin perceptu chang valu move real time perceptu space object predict interact movement integr space distanc movement separ space run parallel ax pattern euclidean distanc distanc type perceptu structur jacob al extend notion integr separ structur describ attribut input base natur move diagon dimens integr movement euclidean space cut dimens control separ devic constrain movement dimens show pattern human perform improv perceptu structur task match control structur devic conduct experi subject perform task perceptu input devic correspondingli control integr tracker separ integr task control graphic object locat separ task control object locat bright result converg support hypothesi conclud interplai task devic import determin perform task devic framework jacob al influenc todai interact area comput input devic evalu design notion integr separ structur automat applic object manipul includ object transport orient human hand origin notion integr separ structur deal properti visual size color locat orient object properti recent research show human separ visual action evid suggest perceptu structur object structur interact movement object arguabl structur perceptu space extend interact space jacob al framework explicitli address relationship object transport orient ware found subject easili achiev simultan object transport orient research report difficult human transport orient object time relationship object transport orient remain open question natur human hand substanti motor control research natur focu relationship hand transport orient hypothesi state independ neural pathwai control hand reach grasp separ reach compon relat properti target grasp compon relat properti independ channel hypothesi develop origin phase hand make contact target object descript phase recent review demonstr behavior evid support hypothesi empir data show object locat affect hand reach compon object size affect grasp compon separ object transport object orient inappropri draw relationship object transport orient base channel theori human object hand oper tactil inform grasp prior contact object warrant investig relationship object transport orient human hand hci research argu interfac design accommod perceptu structur task control structur input structur motor control system research hci gener address motor control aspect interact se motor control research examin object transport orient context hci assumpt underli theoret framework jacob al independ channel theori point opposit direct base notion integr separ perceptu object transport orient integr spatial attribut gener consid integr hypothesi independ channel suggest make control object transport orient separ result relationship object transport orient stream research object transport orient process domain jacob al framework relat aspect time studi motor control aspect interact process framework encompass aspect relationship object transport orient process defin structur object transport orient term concurr interdepend process concurr relationship time parallel serial notion parallel serial similar integr separ jacob visual motor control space process occur parallel special case process longer process domin shorter interdepend reflect interact object transport orient process input process affect output process interdepend main research hypothesi object transport orient parallel interdepend structur expect object transport orient process show weight object manipul process domin visual feedback condit structur object transport orient chang experi conduct test method setup virtual environ virtual hand set shown figur graphic displai present silicon graphic rgb monitor mirror parallel comput screen tabl surfac imag screen reflect perceiv subject tabl surfac light mirror shown control visual condit light subject visual feedback hand wooden cube present light subject hand wooden cube graphic target black background comput screen monitor ir mirror graphic target figur virtual hand lab subject comfort seat approxim height tabl surfac bodi mm front edg tabl subject wear obtain stereoscop view imag infrar marker fix side frame individu subject ey posit calibr rel marker movement head record motion analysi system measur posit ir graphic displai updat hz frame lag target imag wirefram cube project tabl surfac mm graphic cube posit locat orient object manipul wooden cube size mm mm target cube wooden cube weight gram ir top wooden ir center ir diagon mm ir data sampl record hz silicon graphic extrem comput workstat thin physic shown locat start posit wooden begin trial oper subject left hand control start end trial subject student volunt paid particip session subject normal vision subject experi comput procedur task align dock small wooden cube graphic target cube manipul task design requir object transport visual feedback condit subject held wooden cube thumb index finger pad opposit center cube face parallel frontal plane bodi start subject press left left gener graphic target cube tabl mm mm start rotat frontal plane subject subject match wooden cube graphic target cube fast accur subject satisfi press middl button end trial trial block visual visual feedback graphic object visual feedback subject hand physic cube subject start visual feedback start visual feedback condit target locat orient random block trial collect begin subject trial practic condit data analysi posit data collect ir top wooden cube analyz data filter hz butterworth digit filter remov digit sampl vibrat hand movement origin ir posit data interpol filter data manipul includ angular data gener comput program determin start end point movement transport orient process base criterion veloc start end process confirm visual inspect graph veloc profil trial reject program fail find start end disagr visual inspect comput result case occur subject made start primari depend measur object manipul movement time transport time orient time spatial error object translat rotat target mt defin task complet equal greater longer transport orient process tt transport time determin translat data ir center cube top ot determin data calcul horizont rotat cube ir result spatial error report wang al shown paper anova perform balanc design vision distanc angl repeat measur factor examin effect target locat orient vision condit anova full vision hand object hand object view vision experi setup provid realist visual world unconstrain control freedom object manipul perform vision condit consid vision condit consid visual separ data visual condit comparison visual condit perform studi result examin structur object transport orient term concurr interdepend process natur visual feedback action discuss result object manipul report visual feedback hand object unavail comparison visual condit made concurr concurr vision hand object total movement time vision condit averag ms averag transport time ms visual feedback ms shorter total task complet time averag orient time ms vision ms shorter mt averag mt sum averag tt ot concurr visual feedback condit mm deg mm mm mm deg mm target transport orient overlap concurr visual feedback condit mm deg mm mm mm deg mm target posit time transport orient overlap transport figur time object transport orient process white area transport dark area orient overlap transport concurr time process vision condit shown top part figur result demonstr object translat object rotat process parallel time domain object manipul start object transport process short averag orient process join transport process simultan execut process remain averag period ms orient process finish transport process continu ms averag object manipul end statist show earlier start end transport process orient process transport process total ms longer orient process total task complet time determin object transport process critic path parallel structur natur object manipul stabl condit detail analysi show overlap portion process chang condit orient process longer target distanc process target distanc process earlier anticip orient process longer transport process long complet orient process subject mind start orient process late differ end process target distanc end target angl object concurr vision hand object structur object manipul condit similar condit term concurr process transport orient process execut parallel orient process transport object translat start earlier finish object rotat differ start process tt ot significantli target distanc differ significantli target angl end process tt ot significantli target distanc differ significantli target angl differ mt visual feedback condit effect visual feedback concurr effect visual feedback object manipul examin pool data vision condit anova perform repeat measur vision target distanc target angl differ concurr vision condit gener examin compar top part bottom part figur depriv vision hand object significantli delai start orient process rel start transport process ms vision condit ms vision condit start differ affect interact vision target distanc interact vision target angl differ end process tt ot interdepend interdepend vision hand object object target distanc assum input transport process output target angl input orient process output ot shown figur tt significantli target distanc angl input process affect output process target distanc effect ot target angl affect tt significantli tt ot requir object transport distanc object orient angl total movement time significantli target distanc effect target distanc ot vice versa object transport orient process interdepend interdepend vision hand object similar effect found condit object manipul complet target distanc target angl process contribut transport process critic path determin mt tt target distanc target angl object rotat affect object show interdepend tt target angl target distanc output object rotat object translat interact target distanc target angl found differ ot target angl target distanc ot depend orient depend visual feedback condit mm mm mt deg deg visual feedback condit mm mm mt deg deg visual feedback condit mm mm tt deg deg visual feedback condit mm mm tt deg deg visual feedback condit mm mm ot deg deg visual feedback condit mm mm ot deg deg figur total movement time transport time orient time condit transport process interdepend structur process persist visual condit visual effect interdepend shown figur tt ot present similar pattern vision condit relat target locat orient variabl visual condit hand object main effect object transport orient time vision condit show interact target distanc rotat angl target interact target distanc target discuss parallel structur result demonstr parallel structur object transport support research hypothesi total object manipul time sum object translat time rotat time larg portion overlap object transport orient process object manipul cut object translat dimens rotat dimens show euclidean distanc space object transport orient characterist integr notion jacob al result object transport orient process complet overlap begin end object orient start late complet earli compar object final stage movement reflect object transport portion time object transport object object transport domin object orient evid made object transport orient distinct suggest separ structur base definit perceptu structur recogn jacob separ defin class perceptu structur mark endpoint continuum form sharp structur integr separ interpret mechan underli parallel structur object transport orient extend notion integr separ attribut result structur control perceptu structur visual inform object manipul involv visual inform structur task dictat visual inform result show vision condit hand object interact target attribut jointli affect object manipul act haptic kinesthet inform strong role plai object manipul task human separ visual system percept action impli structur object perceptu space interact space object manipul movement account attribut target inform includ visual displai task environ manipul relev determin structur notion concurr address object transport orient occur identifi process start end explor subtl import differ structur object transport orient parallel structur effici serial term task complet time achiev parallel structur object subject coordin process tempor domain interest note differ start transport orient ms vision consist target distanc observ result adjust object manipul start time short feedback adjust interpret subject form plan start orient process earlier transport process shorter achiev effici parallel structur interpret consist fact orient process start earlier subject anticip longer object rotat alloc time correct object transport phase movement evid show time process object manipul plan coordin process object manipul output coordin control object translat rotat interdepend structur evid studi support extens hypothesi structur object transport orient human hand result show strong interdepend object transport orient process object translat time depend target target orient vice versa result consist recent research hand transport orient spatial state object translat rotat separ coordin process object translat rotat execut interact human note empir data grasp base grasp orient grasp object size affect grasp apertur object orient affect transport orient hand import motor control hci research evid object translat requir extend object rotat larger object rotat result longer object translat process affect evenli transport process effect object manipul orient process evid show transport time orient time tt determin mt long time alloc transport phase object manipul tt critic path object manipul process effect visual condit object manipul structur similar vision condit term concurr interdepend transport orient process visual feedback hand object visual feedback transport time orient time process interdepend result unexpect mean visual feedback inform manipul object manipul import form structur object transport orient parallel interdepend structur object manipul persist visual feedback condit explan target locat structur program start movement explan structur insensit differ propriocept feedback visual feedback topic deserv investig depriv visual feedback object hand spatial error object translat effect translat error rotat error wang al implic hci design interfac design accommod natur structur object manipul constraint interrupt integr object manipul result structur ineffici case parallel structur transport orient process transform serial total task complet time significantli complet time process main goal interfac design achiev realism virtual remain natur structur human object manipul import approach benefici evalu design input point devic studi show orient control total integr transport transport control critic path task complet featur hand carefulli consid input devic design virtual environ qualiti visual present control import graphic object design virtual hand job fulli render hand graphic cost effect object transport orient interdepend structur fulli understood human control system structur object transport orient gener independ visual feedback condit object transport process domin object orient process research control structur object manipul framework hci design refer integr manipul plane confer human factor comput system chi integr control hand transport orient movement exp brain process inform structur lawrenc md ls visual pathwai mediat percept hand ed academ press ed cl physic versu virtual point confer human factor comput system chi jr integr separ input devic acm transact time natur movement journal motor cl grasp hand rw afford freedom extend abstract confer human factor comput system chi movement channel hypothesi revisit hand ed academ press interdepend channel locat orient sensorimotor transform reach grasp journal frame refer sensorimotor integr posit arm hand ed academ press object manipul virtual human consist individu differ extend abstract confer human factor comput system chi hand posit virtual object placement visual human perform evalu manipul scheme virtual environ proc ieee virtual realiti annual intern william buxton influenc muscl group perform multipl input confer human factor comput system chi
Agents/1002 1 activ object autonom agent submit ieee concurr special seri actor agent team object agent simul inform system laboratoir dinformatiqu de pari case place pari cedex abstract paper studi extend concept activ object structur agent discuss requir autonom agent cover simpl activ object extens singl behavior activ object set behavior schedul activ make concret base idea describ extend framework activ gener discuss extens implement final report applic simul econom model activ simul introduct concurr program technolog implement agent concept activ object consid basic structur build agent combin agent concept object paradigm lead notion context present paper uniform commun mechan object facil implement commun agent concept encapsul object enabl combin granular agent inherit mechan enabl special factor knowledg agent easili implement activ object concept activ object reli extern resourc activ behavior remain procedur reaction messag request agent perform number function activ extern extend time period achiev research add activ object function control messag recept process intern state basic question build bridg implement model requir system implement model facil techniqu provid gener structur defin main featur autonom accommod model gener implement structur paper attempt provid answer question deal model requir system provid gener modular agent architectur extens implement model facil describ extend model activ object gener modular agent architectur paper structur section present briefli activ framework limit activ object repres agent requir build gener agent structur section describ gener agent architectur section describ implement architectur section report applic autonom agent architectur model econom agent evolut discuss advantag architectur design implement system describ futur work activ object concept activ object introduc carl hewitt describ set entiti cooper commun messag pass concept bring benefit object orient distribut environ languag characterist open system base characterist model instanc select process activ actual comput messag behavior address recept address figur compon activ object framework implement kind activ object model singl program environ base smalltalk basic principl implement enqueu receiv messag mail dissoci messag recept interpret activ object compon figur instanc class address encapsul mail box activ object defin messag receiv enqueu instanc class activ repres intern activ activ object autonomi actor smalltalk process continu remov messag mail box launch interpret behavior instanc class repres behavior activ individu messag interpret build activ object describ behavior standard smalltalk object activ object behavior creat send messag activ behavior activ activ object activ method repres default compon class creat activ address compon custom framework mean defin subclass compon activ activ figur sampl hierarchi class user defin specif model activ commun protocol subclass class model activ synchron subclass class activ figur limit activ object build gener agent structur power foundat model implement agent power foundat provid gener agent structur activ object monolith procedur behavior spite commun subject activ object reason relat interact activ object activ object receiv messag stai inact cope research enrich concept activ object defin gener agent structur interest offer gener agent structur match spectrum system requir make clear quickli summar agent properti provid activ agent behavior includ symbol substanti reason mechan commun behavior integr knowledg agent acquaint reason mechan reason interact acquaint agent autonom entiti oper direct human agent control behavior intern state realiz agent autonom behavior commun behavior activ object commun mechan integr messag interpret autonomi interpret messag reli agent state messag content messag interpret differ interpret rule test mail box state prioriti receiv messag activ suitabl action condit mailbox size messag prioriti action messag agent entiti simpli act receiv messag agent econom agent section commun receiv messag agent interact environ made agent action current context percept agent manag behavior agent mechan manag set behavior accord agent world state call world union environ agent agent sociabl entiti agent consid form notion group rare provid activ object agent interact speak languag agent commun languag kqml queri manipul languag messag attribut receiv perform languag languag languag agent adapt entiti world continu evolv behavior adapt make agent capabl sustain perform realiz experi section result show difficult improv firm perform predict competit perform result reason predict competit model improv agent perform present gener agent architectur address requir gener agent architectur control data data method data method data method modul atn behavior behavior behavior figur architectur attempt defin gener architectur address previou properti extens singl behavior activ object set behavior architectur figur reli layer made interact modul modul repres concurr agent behavior reason perceiv provid agent properti section commun modul manag interact agent agent system higher level modul repres agent agent manag behavior behavior agent model complex agent combin cognit abil reason complex reactiv abil agent kind reactiv cognit behavior behavior behavior encapsul set data defin behavior state set method figur data updat behavior method asynchron event method scan percept behavior manag interact agent environ monitor sensor translat data defin set believ repres model agent acquaint environ method procedur standard method execut behavior procedur method call reactiv behavior call cognit behavior behavior engin control activ method procedur behavior engin simpl automaton percept behavior engin agent firm defin infinit loop activ singl method scan behavior figur control data percept behavior domain depend data scan scan figur procedur behavior engin behavior engin infer engin implement knowledg framework realiz neat integr program promin featur declar specif control rule oper control object rule base control fire rule number design user defin standard type control adapt chang individu control fire set procedur method section exampl behavior give exampl percept modul modul commun modul procedur ffl percept behavior manag interact agent environ ffl behavior repres intent knowledg agent gener adequ messag transmit commun detect percept achiev agent ffl commun behavior manag interact agent agent matter machin run defin mail box agent messag receiv enqueu interpret modul suffici applic domain section agent commun behavior percept behavior modular approach facilit integr modul learn modul agent issu hybrid architectur build agent compon reactiv cognit reactiv compon kind cognit schedul compon static compon view invok servic underli system block agent action complet kei problem architectur kind control manag interact fundament reactiv cognit compon percept figur static schedul simpl econom agent percept compon figur static schedul implicitli exist architectur agent activ summar loop underlin problem give time firm model competit firm greater price lower qualiti firm activ process parallel firm unit price improv qualiti product firm deal rapidli product consum avoid solut focu control attent prescrib static schedul agent adapt rapidli schedul world agent agent schedul static exist architectur solut system explicit separ control reflex aspect architectur tradit explicit separ agent architectur agent abil make control adapt behavior time circumst agent mechan dynam schedul behavior accord intern state world state solut behavior explicitli dynam schedul behavior explicitli interrupt adapt schedul event procedur behavior provid time granular singl procedur method fire behavior provid time granular singl rule fire method schedul perform rule fire solut accept industri applic reli fundament state transit natur build augment transit network figur atn describ econom agent state repres point transit transit transit label condit action repres step global schedul agent link input state output state condit transit test occurr asynchron event messag asynchron event true true figur atn econom agent oper behavior data test data occur import chang previou data action transit manag layer behavior termin activ activ behavior activ kill kill kill true true figur atn econom agent evalu behavior stop behavior agent condit action kill figur atn kill data updat remov behavior add evalu condit transit select behavior condit action transit execut agent state modifi repres agent mechan agent kind control behavior intern state defin agent restrict messag make agent autonom oper direct human agent make agent adapt deal rapidli event implement system set agent possibl set object repres agent environ implement implement collect simpl smalltalk implement agent custom languag bring benefit inherit mechan custom mean subclass hierarchi class figur agent agent agent engin figur class describ agent compon agent decoupl agent agent engin interpret expert system decoupl knowledg base infer achiev declar modular agent repres analog behavior activ implement class defin subclass class agent engin repres activ agent implement class defin subclass class activ figur class attribut defin attribut defin collect behavior defin agent class condit action atn method creat agent main step describ agent determin agent behavior implement class describ behavior exist class figur implement agent atn instanti class atn creation agent method defin class agent activ agent engin agent engin class activ repres intern activ activ object instanc method defin basic loop activ object serial process messag mail box activ bodi implement agent class activ defin class method bodi activ bodi atn atn state atn state atn atn note program cycl knowledg infer implement cycl messag accept agent activ limit messag recept send agent activ repres atn interpret made explicit programm advantag agent architectur architectur arbitrarili complex behavior agent collect small special behavior advantag architectur match agent properti discuss section state agent granular intern express architectur properti import design complex system classic dichotomi reactiv cognit agent dynam agent dynam creat kill integr behavior chang acquaint inform receiv perceiv behavior creat integr agent skill architectur implement model reflect agent govern order make control adapt behavior time circumst heterogen import issu multiag system exist system accept heterogen agent agent implement speak languag architectur separ agent commun behavior behavior commun behavior translat languag intern agent languag characterist languag system experi valid oper platform develop applic report applic simul econom model econom model chose result extens research conduct repres sampl manufactur firm collect french nation bank de set econom agent competit market agent percept section figur firm percept behavior percept behavior firm observ market build competit model observ data shown market data repres perform firm repres implement class behavior method aim build competit model observ data market scan collect perform elementari competit model defin data averag worst perform max averag min class implement set condit atn method figur mean observ collect data similar previou similar defin express jy jy ffl ffl constant weight perform variabl weight defin expert note firm behavior firm defin main state variabl repres type resourc firm variabl repres perform firm directli influenc vector firm strategi alloc resourc strategi order prioriti modif vector cost strategi concentr vector variabl relat product resourc intern paramet modif strategi choic applic modif paramet competit model send paramet transact zone comput figur firm behavior figur describ firm behavior box describ method procedur method method strategi method implement simpl knowledg base give rule condit action class subclass underlin section engin behavior infer engin system implement knowledg base system base set give exampl behavior firm evalu condit statu context exist action modifi firm evalu condit statu action modifi simul experi aim experi underlin properti agent architectur popul agent properti underlin agent ad dynam leav system agent figur transit condit relat applic domain econom defin capit figur market evolut ffl action kill kill agent behavior seri consid firm capit initi resourc set test effect entri market firm enter simul left market figur heterogen agent seri show defin heterogen set agent defin kind firm reason strategi kind agent agent fix process implement knowledg base agent build case base studi evolutionari path figur perform evolut firm learn abil simul show firm effici fix process figur result show merit adapt behavior discuss user facil implement system facil improv develop time econom agent system implement dai number agent fix begin user agent leav agent creat dynam inherit mechan enabl special exist class introduc behavior implement agent learn class describ simpl figur class redefin method implement strategi choic method reason implement agent requir chang atn agent figur architectur build agent compon cognit reactiv reactiv compon kind cognit kei problem architectur kind control manag interact fundament compon architectur behavior agent organ behavior manag interact behavior architectur main properti reactiv sociabl paper detail implement architectur activ object valid architectur manufactur process intens care patient model econom agent architectur offer interest framework studi multiag problem describ studi anytim reason techniqu realiz experi offer result limit studi aspect agent level agent applic suffici build system interest studi agent societi cooper solv global problem refer agha hewitt concurr program exploit larg scale parallel confer foundat softwar technolog theoret comput page experi classif special synchron scheme intern symposium object technolog advanc softwar page castelfranchi autonomi cognit agent architectur intellig architectur lnai volum page ferguson architectur mobil agent phd gasser overview dai kluwer academ gasser distribut artifici theori chapter concurr program distribut artifici page kluwer academ agent model asynchron object environ page januari springer verlag decentr chapter model autonom agent page elsevi muller pischel model reactiv behaviour vertic layer agent architectur page embedd product rule languag journal program page shoham program mckai fritzson kqml agent commun languag acm intern confer inform knowledg novemb wooldridg jen agent survei knowledg engin june concurr program mit
DB/1003 3 vldb journal scalabl featur classif signatur gener organ larg text hierarch topic taxonomi soumen byron rakesh prabhakar raghavan ibm almaden research harri san ca edit jark receiv januari accept abstract explor organ larg text hierarch topic aid filter internet digit patent manual organ topic call taxonomi similar indic relat taxonomi make search access effici exponenti growth volum textual inform make imposs maintain taxonom organ corpora hand describ automat system start small sampl corpu topic assign updat document corpu assign topic document high speed accuraci techniqu statist pattern recognit effici separ featur word node taxonomi build multilevel classifi classifi ignor larg number word document classifi small model size fast ow classifi accur comput document set term occur significantli class belong describ design implement stress exploit effici relat oper sort join report experi reuter newswir patent web document sampl discuss applic system improv search filter capabl introduct amount data form text grow extrem rapidli text repositori grow number size global connect press support effici effect inform retriev search filter manifest recent commerci text search engin crawl index inform multicast mechan structur overwhelm inform content web common manag complex hierarchi text except internet organ hierarchi ibm patent organ patent offic class form hierarchi digit librari mimic librari support form subject index librari congress hierarch explor opportun challeng pose topic call taxonomi taxonomi provid mean design vastli enhanc filter system reliev user burden sift specif inform larg popular search engin queri respect taxonomi reliabl depend presenc absenc specif keyword multicast system achiev higher qualiti regist user profil term class taxonomi keyword challeng build system enabl search navig taxonomi requir met document load index topic path reliabl automat hierarch classifi deep share make automat topic separ difficult document stock price impressionist art file martian taxonomi present hierarchi direct acycl paper deal tree user seri progress refin view document collect queri system conjunct crawler newswir servic system effici updat knowledg make mistak human increment updat made topic taxonomi describ system call taper node separ featur term comput discrimin node classifi featur term good featur class model small classif contrast exist classifi deal flat set featur set context document proce taxonomi filter common step boost accuraci dramat addit delet document easili handl discrimin recomput effici text model built node yield mean summar number document descript call signatur distinct necessarili relat addit algorithm describ design implement system term familiar relat idiom benefit system handl extrem larg number document limit essenti word size comput adapt wide rang physic memori maxim fast sequenti scan disk design lead insight text extend exploit core relat engin report experi taper reuter newswir benchmark patent sampl web document depend classifi document compar number process raw text mb memori largest train dai fetch web uniqu extens web page classif experi organ paper sect demonstr topic signatur greatli improv retriev sect studi problem solv provid function problem hierarch featur document signatur extract explor detail subsect section describ architectur prototyp proof qualiti signatur necessarili anecdot exampl found sect rigor evalu featur select classif present sect relat work review sect conclud remark made sect capabl featur discuss import context topic identif queri filter queri queri post search engin short queri routin suffer abund aspect interpret keyword type research altavista queri jaguar speed varieti span video footbal lan order page anim rank jaguar top classic doubt awar difficult find replac part true word car auto occur page cat sight page cluster car footbal jaguar speed top hit concern page includ term cat frequent page inform visit directori queri jaguar cat find suitabl page jaguar filter paradigm inform retriev continu stream document gener newsgroup system collect interest profil user implement collabor notifi user document interest simplest profil set term phrase explicitli user problem queri topic context discuss notion profil set document user score work small thousand user web system store level detail scale altern profil individu document level narrow canon taxonomi approach surf collabor recommend system identifi core capabl exampl text search base topic context keyword broad topic document term frequent compar topic model identifi document automat classif system separ word anecdot relat time write topic inform word essenti discuss length queri taxonomi keyword topic queri jaguar speed elicit list list topic busi automot game behavior user restrict queri keyword show user type issu search user restrict search topic path artifici limit length list search page car video crowd page relat cat shown enforc forbid addit keyword effect document bin topic path abil multicast channel user profil topic path keyword signatur exhaust keyword problem solut singl occurr term matter useless indic index ir literatur advanc exist prototyp extract signatur index signatur summari descript power compar favor arbitrari sentenc extract popular search engin effect describ document cluster claim common notion document abstract signatur function document limit util case argu signatur function document refer signatur includ term path root refer node car auto good signatur term top level recreat user zoom illustr document start babi sleep sleep doesnt monitor number wet babi classif health comput top signatur term respect health document treat classif shift refer comput signatur hormon document inform path signatur sect mean comput signatur improv search qualiti maintain function separ indic taxonomi signatur term document applic signatur find term associ phrase search classif potenti boost accuraci usual find phrase test set term occurr rate predict assum independ term associ strong section corpu strong global unnot visibl recal set document inform collect includ document machin tool comput signatur node make associ featur select separ featur term term central capabl talk car auto prune signatur featur term determin node taxonomi tricki stopword domain knowledg frequent includ stopword corpu wast manag content stopword list highli depend corpu issu loom larg search categori cluster hierarch import search term depend posit hierarchi sect design effici algorithm node term suit classifi document level taxonomi detect word distinguish document term select pattern recognit describ oper featur select enabl classif taxonomi classifi suffic document rout deep share make sophist featur select necess featur pick model class classifi option evalu spite naiv bayesian classifi accur sophist classifi fix number naiv faster complex classifi naiv typic featur find featur term node mitig problem fewer term lexicon suffic discrimin document node taxonomi greatli speed classif fast multilevel classif restrict time text popul inevit search remot site retriev result larg direct view tool forward queri number search engin combin hierarch view applic featur select featur select set salient distinct sought set document scenario set document keyword queri cluster annot cluster salient keyword regard cluster featur select find keyword applic includ differenti patent file compani time trend exampl applic sect algorithm data structur deal core compon system task comput term induc distinct subtop topic find term occur significantli frequent subtop compar show properti ow finit sampl make judgement basi statist model document gener discuss sect model lead natur classif sect find good featur classifi discuss sect perform function effici larg rang ten gigabyt perform issu discuss sect give detail data structur implement sect discuss class model extract document signatur document model statist model text gener earliest indic power simpl rule deriv quantit textual data zipf law model frequent ir commun poisson poisson mixtur distribut poisson rate denot distribut bernoulli trial denot distribut converg assum bernoulli model document gener paper document gener pick class class coin face repres term probabl turn train text classifi organ tabl axi string form replac call tid denot formula axi call formula axi class topic topic hierarchi defin assum tree hierarchi class assign id call denot formula measur maintain dimens call number time occur number mean term occur document mean sampl document train set class superclass ancestor topic inherit aggreg dimens give import statist corpu length document length document found group total length train document class denot total number time term train document class fraction time occur comput materi effici reason sum document class explain omit clear context number train document class occurr specif term denot number train document class denot describ detail arrang tabl sect assum bernoulli model paramet multinomi coeffici bernoulli model make assumpt term occurr correct term occur document occur compar term inform term frequenc distribut correl independ assumpt lead call naiv classifi naiv classifi essenc build densiti function class margin classifi data point base densiti function maximum term coin call die simpl classifi perform surprisingli compar sophist attempt approxim depend attribut phenomenon investig depth friedman classifi estim class densiti subject bia boundari shift model varianc boundari overfit noisi friedman analyz low varianc naiv densiti estim mitig high bia give simpl classifi beat sophist clear sect simplic design system handl enorm problem size rare event law success return issu estim model paramet rate term occur document class averag english speaker term english dictionari term occur document mean small sampl occurr requir estim maximum likelihood class reject document find call law pursu classic statist centuri laplac show result toss number time face correct bayesian estim probabl face denot pr result assum vector face probabl priori equal call uniform prior assumpt pr obtain rule evalu altern prior suggest justifi experi found laplac law win percent classif accuraci time refer reader paper detail adjust return earlier estim size lexicon class binari model model sensit number time term repeat document obviou critic term occur expect occur model extrem binari repetit count paramet fraction document class laplac correct appli taper framework make explor model bernoulli model term count threshold bucket detail investig predict accuraci model left futur work hierarch classif classifi input document output class document class output classifi match classifi misclassifi document classifi train give document class label attach system classifi intern node featur set document goal find leaf node posterior maxim leav danger greedili pick error made earli process path leaf root root subsum write log log log taxonomi mark edg edg cost log seek cost path root leaf comput condit probabl straightforward notat children probabl document belong child node belong parent node sibl note rule bernoulli model care probabl small scale condit probabl prevent maintain number small posit number store log log normal sum comput comput max comput ad term order magnitud featur select discuss select term classifi model set point euclidean interpret class fisher discrimin method find direct project point maxim result rel class separ measur ratio varianc point respect respect covari matric fisher discrimin seek find vector ratio project differ mean averag maxim shown achiev exist drawn multivari gaussian distribut optim discrimin threshold test point minimum error classifi comput involv gener eigenvalu problem involv covari matric applic signal process fisher discrimin typic hundr text typic covari matric suitabl effici comput hard interpret discrimin linear sum term possibl neg approach direct coordin axi term assign term figur call fisher base varianc figur case term unit vector direct discrimin power pick term greedili good discrimin class set class document class comput ratio socal scatter switch back term frequenc express inform theori literatur notion good discrimin mutual inform closer inspect show comput complic easili amen optim implement system bernoulli model discuss relat work text featur select sect remain sort term order fisher pick suitabl number term list term lexicon sort fisher index heurist pick prefix discrimin term includ featur exclud term small cach larger portion term statist memori result faster classif larg fit train data result degrad accuraci test due overfit techniqu prune featur set minim classif error set document model shown fig approach minimum descript length resampl randomli partit preclassifi sampl train set valid set comput fisher index term base classifi prefix number misclassifi document seek minim class maxim posteriori class probabl base bernoulli model introduc sect prior distribut class class data structur pseudocod modul part topic analysi system call taper build topic set goal handl thousand class million current limit uniqu architectur long datatyp easili class token document make reason assumpt hold simpl pointer taxonomi tree memori word node train essenti crawl index applic test appli interact sect train token test term train prefer make singl pass corpu statist modul maintain combin simpl increment updat fix taxonomi correct misclassif move document incorrect class correct reorgan entir topic sketch taper system shown fig train document randomli split subset collect term statist estim term subset model decid term taper support cross preliminari partit corpu train valid document result class model restrict featur store disk index access method statist effect cach main memori classif classifi model statist demand emit set class input document taper modul map term class id tree data structur store inform modul statist collect modul featur select modul appli classifi test document discuss detail select top rank featur valid store document class statist train document unlabel document random split crossvalid statist collect set model valid set construct class model restrict featur classifi class raw statist sort aggreg order featur discrimin power index statist fig sketch taper hierarch featur select classif engin tid smc sort uniqu kei term child class number document class term total count term document class parent class fig column frequenc tabl aggreg explicitli taxonomi tree store memori statist collect goal modul collect term statist document fast simpl stopword filter stem document convert sequenc tid main tabl maintain disk frequenc tabl shown fig tid correspond term occur document belong class class cid number onward repres parent numer field row number addit document term append row frequenc smc set set number time occur call set set smc binari bernoulli model run sort aggreg merg tabl tid smc store term statist tree scan append record fisher tabl clear tree term run fig scan frequenc tabl comput fisher index term fi tid kei class fisher index term discard featur select featur fisher index fig fisher tabl sort contigu run intern topic run featur suitabl featur set size truncat run produc tabl featur tid intern topic uniqu kei field aggreg store taxonomi tree store memori figur show content field smc number document class term tid total count term tid document class correspond class trade space frequenc tabl grow lot duplic kei depend disk space catch breath sort aggreg duplic kei larg vastli prefer disk hash tabl random sort superlinear good size current run frequenc tabl conserv disk faster sort simpl heurist start sort phase configur upper bound number row sort initi conserv space estim sort time number row averag number row document add tabl previou maintain estim fraction row compact aggreg guid recent sampl techniqu moment execut infinit suppli continu train hit upper bound dictat space sort estim time complet estim total time sort train number document creat sort estim initi sort current process document stop sort progress meet tough realtim open frequenc tabl fork aggreg run document continu accept chosen index access method frequenc updat scan document result index lookup random potenti term train set effici append statist log fashion frequenc tabl temporari file direct index access requir benefit phase avoid storag overhead index access control compact explicitli space overhead store tid redundantli rest row byte long featur select begin featur aggreg frequenc tabl elimin duplic frequenc tabl prepar scan row tid collect contigu cid tid occur fig children parent class collect prepar output call fisher tabl assum format shown fig row kei float point number fi stand fisher fix smc tid tid fi kei kei fisher tabl frequenc tabl sort merg hash index tid smc fig creat index topic model statist tabl classifi classifi document row sort order fi column tid cid fi column note notion fi intern node tid primari kei frequenc scan sequenc run fix tid topic node word statist start run clear scan tid frequenc locat node taxonomi updat statist larg node updat run node parent updat reset statist effici run run tid explor updat fisher index term intern node taxonomi eq append row fisher tabl sort fisher tabl kei collect class contigu order term valu fi case intern topic number featur pick taper directli section discuss determin pass portion train document set earlier model scan sort fisher copi row run class output discard remain term involv complet sequenti sort truncat fisher tabl merg frequenc sort row fisher tabl find begin row frequenc read long kei remain construct memori buffer form buffer written hash tabl disk shown fig find good cutoff term fisher index find good number chosen featur fix test document grow prefix misclassifi discrimin term point correctli classifi ow good featur includ larger term enter featur set misclassifi function iff seek find naiv approach naiv suitabl valu prepar model featur document determin add approach make unnecessari pass input wast time token map id disk part cost avoid store token closer determin reveal comput repeat determin model superset featur model comput effici provid document held fix success model built ad featur comput aggreg function pass intern taxonomi node valid document small number intern node assum function intern node held memori lexicon size larger memori usag associ output file intern node taxonomi requir open file resort simpl batch write handl start scan valid document document class locat earlier comput fisher score term node sort term document order term found discard term rank construct sequenc classifi term rank term rank classifi term rank correctli rout compar outcom term rank outcom record jump write record output file mean error error vice output file sort term rank cumul sum gener node discard perform step edg path root taxonomi document edg sort term order score term rank construct classifi term rank iff classifi misclassifi compar output delta repeat edg root node sort file term rank comput cumul sum column updat batch larg frequenc fisher tabl leav smaller index topic statist map system set document ad preserv frequenc tabl continu row append compact aggreg duplic kei run featur select integr data index statist run statist gener relat featur select interact oper averag document averag term coupl hour invok reason refresh statist improv classif automat detect time interest question issu delet document move document class classif poor erron featur select frequenc tabl place neg entri produc frequenc tabl row term delet document negat document delet ensur document origin includ preserv id train difficult issu reorgan taxonomi current system leav issu design make reorgan simpl notic parent class addit statist train document gener row topic node assign topic root envisag procedur reassign cid write frequenc tabl neg entri detach node attach node statist common ancestor remain unchang neg row append frequenc tabl class parent child link modifi taxonomi tree classif data organ earlier clear classifi invok document basic load taxonomi precomput submit document term classifi probabl document gener root topic definit path taxonomi api probabl cutoff node report back close match document intern node children taper intersect featur set surviv term class model space effici index statist includ record vector statist obviou pseudocod slightli modifi reflect denot log naiv index child initi term lookup term statist updat normal add optim index initi term skip kei index retriev record record updat normal document signatur user sift queri base topic path leaf class necessarili coarser individu support quickli document document detail search engin attach line document titl sentenc search term keyword extract signatur extract rel node taxonomi refer node approach concaten train document super document rank term order number standard deviat earlier simplist document model mention sect term occur document occur bernoulli model frequent term remain taxonomi path matter improv move binari model singl test document observ fraction train document class term simpli sort report top test document find fraction sort ts order correspond comput normal approxim binomi distribut perform studi perform system aspect extent paradigm assist text search accur techniqu featur select hierarch classif effici scalabl system item point matter qualit evalu techniqu qualiti featur select classif measur present result effici quot taper run time specif show scale favor corpu compar perform text classifi prior art dataset measur data reuter benchmark wide ir patent refer simpl scenario document belong class draw entri show test document class judg class call matrix import number comput matrix sum diagon entri divid sum fraction document correctli classifi document number recal defin lewi evalu perform data set document multipl class classifi requir output document set class highest set class defin recal defin chang achiev recal point recal equal call point evalu featur select reuter provid taxonomi data includ taxonomi code class header work corpora inform explicitli provid sampl node electr electron children level figur show taxonomi overlap vocabulari resistor make classif task challeng deal set topic classif error featur set size figur show result valid experi patent hundr train patent valid patent pick random leav fig fisher index order rapid reduct classif error hundr featur roughli term lexicon error slightli visibl rang minimum due overfit smallest minima error roughli electron minima featur set size question common practic pick fix number frequent term class featur discrimin applic list featur patent taxonomi notic set chang level amplitud circuit resistor appli featur select algorithm find salient differ set document social scienc health recreat refer scienc educ entertain govern art commun electr electron oscil amplifi resistor system transmiss motiv regul heat modul telephoni antenna patent yahoo region class code fig sampl topic taxonomi experi portion patent taxonomi numer class code level web taxonomi deriv total node fig evalu featur select applic find descript cluster document cluster queri hundr ibm patent server quickli zoom cluster run taper cluster treat class sampl result cluster cluster clean cluster imag binari bernoulli set fig choic bernoulli binari text model classif bernoulli consist superior experi verif train set adequ user easili refin queri context patent taper compar contrast patent portfolio time comparison sun microsystem silicon graphic sun microsystem silicon graphic programm digit comput system electr comput system integr interfac system organ data comput graphic surfac textur adjust resolut level detail interest compar intel patent taper detect line research patent programm digit comput system chip fabric input interact bandwidth reduct system involv differ transmiss field frame differ involv adapt transform code coher phrase patent effect store singl term choic system configur binari bernoulli taper support bernoulli count binari count text model discuss sect bernoulli model critic pai attent addit occurr compar bernoulli binari fig bernoulli classifi effect exploit count rest restrict model suffici train data compar taper ensur train set adequ train random sampl size train set verifi test perform satur shown fig reuter benchmark reuter benchmark train document test document class experi reuter ensur basic classifi accept qualiti tenth articl assign multipl class class label refin grain incorrect regard class class impli class assign document equal studi scenario result shown fig interpol breakeven point document polici return top class recal benefit hierarchi test effect featur compar implement perform singular decomposit origin project document lower bayesian classifi assum gaussian distribut person classifi accur spite simplic explan ignor class find project direct larg coincid direct separ document class recal fig reuter point tabl matrix weight cosin classifi row sum modulo round diagon element add total number document recal class modul antenna telephoni transmiss motiv regul heat amplifi oscil resistor system tabl matrix multilevel show larger diagon frequent correct classif recal class modul antenna telephoni transmiss motiv regul heat amplifi oscil resistor system evalu hierarch classif describ experi hierarch dataset compar hierarch classifi standard classifi document vector term class sum centroid document vector similar vector cosin weight term result relev rank variant scheme tune magic constant tabl benefit hierarchi prefix field row correspond intern node classifi prefix paramet recal flat ms taxonomi ms port pick version recommend max max number class max lg substanti gain accuraci standard classifi experi gain featur select hierarchi fix featur select classif chang taxonomi fig root leav care make fair make class model repres complex set count number paramet account sparsiti term frequenc direct control trial compar evalu shown tabl accuraci benefit hierarchi modest compar benefit featur select note flat classifi steep perform compar class gap dramat larger alloc fix number paramet taxonomi node classif interest issu show featur select classifi significantli accur compar flat set class hierarchi enhanc accuraci modest greatli speed run time taper undergon extens make effici maximum amount memori disk intellig stage larger data give exampl current compar preliminari version extens comparison exist packag common hardwar platform left futur work taper evalu rs mb mb ram train term test term time measur document account reorgan cost train reuter includ time run time perform classifi apt al classifi similar technolog similar accuraci call train time time train time taper larger corpora effici manag differ perform web document class train disk imag obtain taper process document hundr word long time disk access make directli connect taper web crawler popul search topic inform keyword fly relat work survei overlap area relat research point differ work ir system text data statist pattern machin learn data machin pattern recognit classif problem address statist theori classic bayesian statist pattern recognit machin learn classifi parametr nonparametr class classifi cart neural network featur set larger consid extrem larg document classif requir featur select result model featur ir system text matur idea successfulli integr commerci text search system veriti context involv process syntact stopword build invert comput heurist term comput similar measur document queri model recent work includ statist model cluster document label topic goal discov coher classif queri singular decomposit matrix found cluster semant relat document share keyword survei contrast work work perform issu featur select classif corpora rang ten hundr explor variant learn algorithm small corpora lexicon document close relat work concurr investig made koller sahami yang pedersen koller sahami sophist featur select algorithm bayesian net learn depend complex number featur quadrat number start term exponenti depend report experi restrict thousand featur document yang pedersen experi simpler method approach apt al pick fix fraction frequent term class perform danger fraction sensit corpu methodolog stem stopword poor perform simplist method observ recent work mladen goal techniqu good statist remain linear time pass featur select simultan node larg topic taxonomi koller sahami import greedi search leaf point potenti danger approach formul fix problem approach comput document signatur aid search extens type retriev interfac demonstr hierarch view text improv search navig present tool maintain navig combin featur document signatur greatli enhanc retriev experi work question futur investig taper find good featur set size independ intern space store result model explicitli control sect question design classifi maxim accuraci bound model bound time tabl suggest interest problem alloc total space node hierarchi accuraci resolv perform issu greatli cut space time prune term poor fisher index term statist issu relat accuraci classifi reliabl stop shallow level tree classifi document uncertain recent found ad hyperlink inform featur set taper greatli improv accuraci acknowledg mark alex bruce carol thompson ibm patent server chandra mike eli sunita sarawagi martin van den berg comment paper refer alon space complex approxim frequenc moment symposium theori comput pp exploit cluster phrase inform retriev apt damerau weiss sm autom learn rule text categor ibm research report balabanov shoham collabor recommend commun acm berger jo statist theori bayesian analysi berlin heidelberg york breiman friedman olshen stone cj classif regress tree pacif calif chakrabarti dom agraw raghavan signatur navig text vldb august greec chakrabarti dom indyk enhanc hypertext categor hyperlink sigmod chekuri raghavan web search automat classif sixth world wide web san calif cohen singer learn method text categor sigir cover thoma ja element inform theori chichest cut karger pedersen jo constant larg document collect deerwest dumai landauer furna harshman ra index latent semant analysi soc inf sci duda hart pattern classif scene analysi york oard dw survei inform retriev filter method technic report colleg md frake inform data structur algorithm englewood nj friedman jh data min knowl discoveri fukunaga introduct statist pattern ed academ york goldberg nichol oki terri collabor filter weav inform tapestri commun acm harman rank algorithm frake inform data structur chapter englewood nj hush horn bg progress neural network ieee signal process jain mao artifici neural tutori comput jone ks statist interpret term specif applic retriev document koller sahami hierarch classifi document word intern confer machin vol san calif langlei element machin learn morgan san calif laplac philosoph essai probabl ai dale french edit york lewi evalu text categor speech natur languag san pp lippmann rp pattern classif neural network ieee commun mag miller konstan ja experi make usenet usenix annual technic pp mladen featur subset select european confer machin web ibm mag bk machin theoret approach san calif papadimitri raghavan tamaki latent probabilist analysi quinlan jr program machin learn morgan san calif raghavan inform retriev survei symposium discret es natur law success research report princeton calif robertson walker simpl effect approxim model probabilist weight retriev pp salton bucklei approach automat text retriev inf process manag salton mcgill mj introduct modern inform retriev york schutz hull pederson jo comparison classifi document rout problem pp shardanand mae social inform algorithm autom word mouth comput human interact acm york van rijsbergen cj inform retriev oxford em wordnet disambigu word text retriev pp statist function york weiss kulikowski ca comput system learn san calif yang pedersen compar studi featur select text categor intern confer machin pp young tw estim pattern recognit elsevi scienc amsterdam zipf gk human behavior principl introduct human ecolog mass
AI/1004 2 prm workspac nanci texa colleg usa texa colleg usa texa colleg usa christoph texa colleg usa daniel texa colleg usa class random path plan probabilist roadmap method shown great potenti solv complic problem prm random construct graph repres path vertic correspond configur robot vertic connect edg path configur found local plan method work describ evalu node gener connect strategi probabilist roadmap method clutter workspac node gener strategi evalu term abil produc node difficult region result includ recommend select node gener strategi type default strategi object classifi easili analyz strategi connect roadmap local planner stage shown enhanc connect result roadmap significantli introduct automat motion plan applic area virtual realiti design motion plan method practic restrict robot freedom strong evid complet planner find solut determin requir time exponenti number dof robot attent focuss random probabilist motion plan method notabl random potenti field method work configur space exist simpl situat success class random motion plan method gain attent probabilist roadmap method random construct graph roadmap roadmap node correspond configur robot node connect edg path configur found local plan method queri process connect initi goal configur find path roadmap connect point probabilist roadmap method roadmap construct node gener connect node form ii queri process connect roadmap find path roadmap connect node prm shown perform practic roadmap construct difficult plan queri answer fraction prm suitabl multipl queri answer static gener prm strategi solv singl queri construct portion roadmap node gener node gener strategi method select robot configur node roadmap good node gener strategi produc node connect form roadmap repres connect complex roadmap node corridor requir costli comput constraint surfac random method seek avoid prm uniform sampl gener roadmap candid node configur roadmap enhanc sampl region method perform gener robot effect environ clutter uniform sampl yield configur narrow region obtain improv roadmap crowd prm inform environ guid node gener exampl includ execut random reflect surfac techniqu call geometr node ad gener configur robot workspac obstacl boundari connect roadmap candid node connect form roadmap basic idea attempt connect select pair roadmap node local plan success connect identifi edg roadmap save path found stage record quickli process queri method prm determin node attempt local select make connect crucial impact qualiti result roadmap run time prm prm greatli limit number connect attempt ten typic spend preprocess time connect phase gener strategi prm make connect sophist techniqu improv roadmap qualiti prm connect node closest node determin distanc common local attempt enhanc roadmap sampl node identifi region sophist local planner result paper prm sampl point surfac prototyp implement planar articul robot emploi simplest node gener connect establish method plan clutter environ describ sophist strategi node gener connect provid evalu matur implement method clutter mechan design move object object yield concentr techniqu prm motion plan approach studi heurist gener node surfac evalu effect roadmap qualiti result studi includ recommend select combin node gener strategi object gener shape composit symmetr surfac triangl roughli identifi default strategi unclassifi object connect strategi prm workspac shown significantli improv connect result control time construct stage attempt make connect invoc fastest local plan stage make number connect attempt increasingli power local plan method stage add roadmap node attempt join connect compon previou roadmap remark goal provid empir evid node gener connect strategi work type problem seek empir evid due random natur make difficult analyz number attempt made theoret explain success prm studi gener make simplifi assumpt natur prm compon local appli preliminari move object consid paper rigid object repres configur coordin defin posit defin orient orient coordin repres normal addit prm make heavi local planner distanc comput local planner determinist method make connect roadmap node build connect start goal roadmap queri distanc metric determin pair node connect local planner distanc metric base recommend distanc metric scale euclidean distanc scale place weight posit local planner implement common version planner call method suggest order appli planner success fill gap left faster planner move planner translat intermedi configur rotat intermedi configur final translat paramet repres fraction part translat distanc robot travel planner plan pair planner made connect planner situat explain fact smaller swept volum fairli long planner version success make connect planner planner vari number neighbor configur explor evalu function select number iter run support neighbor function yield fifteen neighbor common configur posit orient coordin increment goal addit neighbor configur coordin increment goal evalu function minimum distanc maximum clearanc workspac function approxim center mass relev object maximum number iter planner run multipl number step planner common valu note planner emploi strategi denot version planner significantli method make connect tight place node gener prototyp version articul robot workspac simpl strategi gener node contact surfac obstacl prototyp cin collid robot cfg random direct eman cin free cfg direct find contact cfg binari search endfor simpl strategi suffici establish potenti method clear sophist node gener strategi complex object produc distribut node region outlin method weve implement test spirit method emploi inform environ guid node gener method design gener type contact free configur contact set configur surround gener contact configur node gener strategi prototyp version attract due simplic effici gener typic account preprocess distribut gener node sensit shape seed binari singl seed yield good distribut configur surfac shape roughli spheric seed remov center yield configur region surfac closest seed method simpl binari search sensit shape avoid comput achiev multipl seed long chosen intellig manner current version seed node prob point robot pob point obstacl interest cin translat robot prob pob coincid rotat robot randomli random direct eman cin free cfg direct find contact cfg binari search type configur found manner depend shape robot select point rob obj point implement test method select point object tabl variant edg weve implement thought repres strategi gener free configur roadmap connect improv gener point constraint surfac configur give local planner room obstacl corner turn seed gener strategi easili adapt gener free configur select point prm workspac point select strategi strategi explan bia cm center mass object vertic center mass good spheric ensur point gener vicin center mass object rv random object vertex random vertex portion object vertic gener complex region ev select extrem vertic maxim minim coordin random extrem vertex find configur distribut region high descript complex captur random vertex rt select triangl randomli select point triangl random triangl portion object triangl region object shape wt select triangl probabl proport randomli select point weight triangl triangl triangl larg area part tabl point select strategi node gener rob obj robot obstacl method translat robot point coincid randomli rotat robot obtain free configur configur build shell gener idea roadmap plan hard plan difficult contact includ path roadmap leav clearanc robot obstacl roadmap node path found low cost node gener retain number configur found search uniformli space refer number shell gener object roadmap connect prm attempt connect node closest node determin distanc natur approach initi differenti configur strategi result connect attempt node difficult connect term roadmap connect gener stage roadmap connect strategi stage attempt make connect invoc fastest local plan stage compon grow make number connect attempt increasingli power local plan method stage add roadmap node attempt join connect compon previou roadmap reason strategi faster local planner capabl make crucial connect connect power local planner easier connect gener account major roadmap overview strategi appli stage choic local distanc base find current implement scale euclidean distanc metric emploi multipl local planner section method vari ideal planner adapt select distanc metric local plan method stage simpl connect connect stage similar origin prm main differ advantag extra inform stage set node number comput closest node connect node endfor endfor connect input paramet number connect attempt typic small local planner stage fastest planner connect connect result roadmap connect comput roadmap consist singl connect proce connect stage stage connect compon goal stage make connect connect compon stage roadmap strategi similar stage connect attempt node belong connect compon stage connect compon assum jvm connect jv endfor endfor connect iter loop attempt make connect connect compon size smaller constant connect attempt made node closest node jv connect attempt closest pair procedur return connect made stage strategi implement bit sophist consist pattern procedur outlin differ valu paramet set local planner make connect stage local stage local connect roadmap result updat enter stage grow compon connect stage make connect node creat initi node gener stage stage main goal stage merg connect compon current roadmap stage simpli make connect exist node connect compon stage individu connect compon ad node motiv connect compon easier make connect stage similar method prm prm workspac stage strategi implement seri stage expand fail path motiv method connect attempt connect compon make progress gener idea save valid node visit fail connect attempt configur add node stage connect compon cm compon minimum cm fail connect fail connect connect add endfor connect endfor method select connect compon connect compon averag configur pair connect compon select closest configur pair connect save valid node fail path attempt connect closest node fail attempt connect neighbor configur closest configur ad roadmap process repeat pair process repeat progress obtain small success current implement local planner connect attempt planner attempt stage expand small compon motiv method configur region smaller connect small compon prove instrument larger connect compon gener idea expand small compon gener configur configur compon stage connect compon jv random configur gener endfor run stage paramet select small number configur connect neighbor select number type neighbor local planner attempt connect current implement consid fifteen neighbor check method planner connect cs connect compon planner call stage connect evalu experi design evalu node gener connect strategi clutter workspac narrow corridor program written run sgi machin figur corridor figur corridor figur alpha puzzl environ consid workspac environ easili identifi interest puzzl figur workspac corridor dimens move object cube rotat easili block rotat roughli dimens block workspac corridor consist tunnel dimens bound box dimens consid move object small block dimens medium block dimens block larg block dimens block consid alpha puzzl environ tube twist ff shape triangl object separ intertwin tube sequenc rotat translat puzzl made easier scale obstacl tube effect shrink widen gap ff simultan transform tube circl increasingli longer ellipsoid node gener import criteria evalu node gener scheme abil gener node difficult region gener node connect roadmap corridor environ evalu criteria gener node difficult region natur corridor environ made easi determin gener configur corridor seed gener strategi chosen number shell attempt gener request number node total shell total shell result node classifi insid vertic insid border vertic insid valu report averag run increasingli difficult gener insid configur block hold border configur import repres entranc corridor border configur gener cube block reason longer cube block border configur strategi object combin strategi multipl true strategi indistinguish object random versu weight triangl extrem versu random vertic object suspect magnifi complex object studi strategi prefer type object adher expect list tabl cm good prm workspac symmetr object ev wt cover object rv rt assur good coverag find multipl shell gener insid border configur cube percentag configur approxim shell similar relat exist block experi show shell improv roadmap retain free node gener gener connect node connect result roadmap crucial criterion judg node gener scheme concern abil find path prune configur built stage roadmap insid border configur figur cube stage roadmap built seed gener roadmap construct local planner connect compon roadmap repres bar show number node compon fewer bar desir larg connect compon insid node roadmap obtain combin strategi figur seed strategi yield roadmap connect approxim averag shape advantag gain select node gener strategi suit object knowledg roadmap reason connect notic prune reduc connect remov node connect compon pass corridor workspac corridor obtain strategi simultan build small roadmap select strategi base roadmap connect success roadmap connect phase depend chosen local plan method strategi select candid node connect local planner test connect roadmap result local corridor gener set node analyz connect compon stage roadmap built planner figur figur show connect compon roadmap construct combin local planner clear connect result roadmap improv multipl local total redund case local planner make crucial connect connect compon roadmap figur show planner make connect planner obtain connect compon true connect greatli enhanc multipl local rememb impli larger cost connect sampl node gener connect time stage roadmap environ shown tabl note connect time corridor environ reduc set insid border node planner larg impact run time connect evalu multistag connect corridor environ gener roadmap seed strategi shell gener roadmap connect sec sec sec sec sec sec sec cube block alpha tabl preprocess comput time statist stage roadmap roadmap connect seed strategi shell gener roadmap connect stage stage stage stage stage sec sec sec sec sec sec sm sm md md md lg lg lg lg alpha alpha tabl preprocess comput time statist roadmap connect perform connect stage connect method appli roadmap produc stage result roadmap shown figur roadmap label correspond connect stage produc clear connect benefit obtain stage stage consid set node local produc connect roadmap time planner stage case improv connect stage stage roadmap true environ difficulti corridor environ tendenc connect side corridor medium larg sophist stage strategi prove crucial join compon interest note stage strategi discov crucial insid node enabl connect compon larg node gener connect time connect stage shown tabl stage stage gener fastest emploi faster local planner time spent stage depend number time spent stage depend number connect compon time spent stage stage gener significantli greater due planner clear method highli care order result method feasibl prm workspac hardest problem studi paper problem illustr problem requir type node gener strategi repres roadmap problem includ configur tube intertwin separ found configur easili gener strategi tube cm free gener node split roughli intertwin separ configur contrast corridor contact configur solv version problem obstacl tube scale tube version solv stage roadmap close gap ff version larg enabl tube escap complic sequenc rotat translat solv origin work problem connect strategi base preliminari result solv version obstacl tube scale describ evalu strategi node gener connect strategi clutter workspac evalu node gener strategi term abil produc node difficult region term connect result yield recommend select combin node gener strategi type object object classifi recommend default strategi essenti combin strategi give reason result problem weve studi rel import contact configur free configur determin recommend gener roughli half show roadmap connect greatli improv connect strategi multipl local planner improv connect requir comput studi aim techniqu prm motion plan approach work make adapt automat environ automat select seed gener refin connect strategi plan augment implement plan contact task acknowledg research support part nsf career award reu nsf grant texa higher educ coordin board grant support part ministri educ dale support part ge foundat graduat fellowship daniel leav universidad de la mexico support part scholarship robot group texa jeff li suggest work grate john latomb discuss comment alpha puzzl design bori comput graphic system group ge corpor research develop center ge provid product vision cad anim produc environ snapshot shown detect routin base code develop ge refer gupta motion plan base approach kinemat redund kinemat roadmap proc ieee internat conf robot page good distanc metric local planner probabilist roadmap method proc ieee internat conf robot amato wu random roadmap method path manipul plan proc ieee internat conf robot page april latomb robot motion distribut approach internat robot kumar parallel search algorithm robot motion plan proc ieee internat conf robot volum page chang li assembl maintain studi motion plan proc ieee internat conf robot page chen hwang motion planner perform proport task difficulti proc ieee internat conf robot page solv combin direct random search proc ieee internat conf robot page motion plan freedom random reflect obstacl proc ieee internat conf robot page motwani path plan configur space proc ieee internat conf robot page hwang ahuja gross motion plan survei acm comput hwang ahuja potenti field approach path plan ieee tran robot automat hwang chen heurist complet planner classic mover problem proc ieee internat conf robot page latomb analysi probabilist roadmap path plan proc ieee internat conf robot volum page latomb random preprocess configur space fast path plan proc ieee internat conf robot page raghavan random queri preprocess robot path plan proc acm symp theori page overmar probabilist roadmap path plan configur space ieee tran robot august latomb robot motion plan kluwer academ overmar random approach path plan technic report comput utrecht overmar probabilist learn approach motion plan proc workshop algorithm foundat page reif complex piano mover problem gener proc ieee symp foundat comput page hwang path plan everydai robot proc ieee internat conf robot page wu probabilist roadmap method path plan master depart comput texa prm workspac node roadmap node gener algorithm cube node gener local border insid roadmap node gener algorithm node gener local border insid figur node stage roadmap local corridor cube local node gener border insid local block node gener border insid figur local stage corridor rm rm rm rm rm medium block corridor boundari insid rm rm rm rm rm larg block corridor boundari insid figur connect stage corridor medium larg
IR/1005 5 resourc discoveri knowledg discoveri internet zaian school comput scienc simon fraser canada abstract year time modern comput didnt exist bush wrote multimedia digit librari human collect knowledg fill link materi topic end world war urg scientist build knowledg store make continu extend access consult closest materi dream web hypertext multimedia document collect access knowledg realiz extens research accomplish inform retriev search final adopt text repositori system late advent web text search routin million user search engin daili pinpoint resourc internet resourc discoveri internet frustrat useless simpl keyword search convei hundr thousand document result knowledg discoveri data mine web research topic attract tremend interest realiz inform data knowledg resourc document web tabl content introduct inform retriev technolog brute forc document scan convent document retriev document cluster document signatur invert index term weight assign hypertext multimedia survei resourc discoveri internet internet tool inform retriev commun servic inform storag inform exchang servic inform index inform retriev servic interact multimedia inform deliveri servic catalogu directori robot search engin search engin work relev rank document retriev agent inform retriev multimedia resourc discoveri data mine knowledg discoveri internet web content mine web page summar search engin result summar web structur mine web usag mine refer appendix glossari inform retriev web introduct johann introduc print press europ centuri spawn revolut publish reproduct public enabl larg scale todai web bring revolut electron publish wit mass product public sort text sound program made singl moment overwhelm product resourc difficult access end world bush wrote articl invit scientist join effort massiv task build system hold sum human make store inform bush difficulti publish unduli view extent varieti public extend present abil make real hypothet machin scientist store thought link materi thought web technolog conveni author tool partial mimic bush descript todai million user continu contribut remark wealth knowledg issu bush remain solv bush continu todai web consent storag extrem larg amount multimedia continu updat make cumul find inform retriev effici effect found inform retriev fertil research field techniqu implement success prevail advent servic accumul aggreg inform retriev techniqu adapt bring index model search engin find document pertin request resourc discoveri resourc discoveri process clarifi inform retriev request identifi retriev resourc relev request function search engin perform effect tool satisfactori irrit annoi result current search engin technolog invit research tackl challeng index special inform gather filter cluster trend research inform gather internet knowledg discoveri knowledg discoveri internet process usenet ftp http text postscript bibtex html imag resourc discoveri knowledg discoveri format servic method capabl autonom learn agent figur internet space extract discov resourc global network knowledg discoveri internet larg inherit data mine domain access worldwid data mine relat internet goal resourc discoveri find explicit goal knowledg discoveri bring light implicit knowledg necessarili state resourc evolv space myriad servic emerg varieti resourc exchang protocol document internet progress simpl text fulli structur document multimedia record tool inform retriev skill start manual sift tool resourc tool learn exploit servic inform deduc knowledg document content tool classifi class tool direct resourc access class resourc discoveri tool search engin class class encompass guid autonom agent target goal retriev filter inform sophist agent fourth class agent abil adapt learn experi infer user user profil resourc search access pattern web mine tool discov extract knowledg found resourc constitut class etzioni compar evolut food chain organ agent feed search engin document peterson metaphor biologi taxonomi compar inform retriev tool ax figur repres document prevail axi retriev capabl method evolv inform retriev method pertain set perform type enjoi retriev power retriev method categor axi depend retriev resourc knowledg internet paper survei techniqu resourc discoveri internet trend knowledg discoveri field appli internet survei text retriev technolog document technolog variat adapt technolog heart resourc discoveri method internet inform retriev technolog librarian adopt comput technolog earli librari scienc research dealt problem manual index text retriev introduct comput technolog librari scienc permit autom index retriev librari catalogu autom bibliographi creat past work inform retriev librari autom document retriev import area patent law offic text busi offic text retriev document inform retriev technolog drawn attent research materi network commun brought challeng stimul inform retriev term coin time paper field subsum topic rang data retriev knowledg relat inform process task regard synonym document retriev focu text retriev aspect inform retriev field text document distinct search rank index refer repres document retriev search refer process examin document attribut document search queri final rank refer process order document retriev respect relev search queri section examin activ document retriev techniqu inform retriev system evalu base effect measur effect typic recal document retriev search document collect divid group consist document retriev document omit group subdivid document relev retriev retriev document retriev document left total collect relev relev document document collect collect recal figur recal ir relev search queri relev figur show tabl present group document defin recal good inform retriev system minim maxim fraction retriev document relev queri system maxim obviou evalu inform retriev system easi maxim simpli retriev document document relev case recal fraction actual set relev document correctli retriev system number relev document retriev relev document inform retriev system maxim recal obviou simpli retriev document collect maxim recal relev document necessarili collect recal maxim found recal measur select effect recal insensit total size measur reject effect fraction document retriev inform retriev system minim calcul recal requir knowledg total number relev document collect larg practic imposs number retriev relev document estim sampl techniqu method pool estim number import note recal depend definit relev relev pair rate individu relev rate obtain expert user measur highli subject repres user avoid popul user collect recal compar inform retriev system perform time perform system evalu brute forc document scan obviou document match queri string document search string brute forc method locat document exact redund redund search scan document method index document document space overhead lack scalabl full text scan method larg document algorithm string match base automata theori automaton singl regular express approach search search simultan straightforward algorithm substr test document larg string string search string compar charact point pointer increment pointer match reset string pointer set charact increment document string pointer search string slide document simplic slow size string size algorithm comparison morri pratt boyer moor algorithm perform comparison algorithm slide string increment algorithm compar string left variat algorithm recent sundai suggest variat mention full text scan method larg collect document lack special hardwar implement function program languag perl script languag import mention advantag method ineffici full text scan method requir space overhead invert time size document index updat document updat document necessit updat index rank document base weight calcul frequenc string document frequent search string relev document convent document retriev clear inform retriev research commun index kei success inform retriev system research devot lot attent develop autom index techniqu myriad techniqu implement test heart modern techniqu resourc discoveri internet outlin index differ significantli inform retriev method method index techniqu index structur index invert file sort term bit string constitut index inform retriev bit presenc absenc word document index word occur high frequenc elimin index process list call stopword consult word encount document queri commonli occur word discard queri submit natur languag mean reduc set word includ index plural convert singular languag normal techniqu borrow natur languag process reduc word similar mean gener common concept call conflat techniqu reduc word root singl form strip root deriv inflect word transform canon form english strip suffix suffic conflat techniqu languag depend base dictionari common word dictionari class word morpholog term stem extract word reduc term cluster synonymi class subsumpt group class word normal reduc size proven improv select effect inform retriev system inform retriev system natur languag techniqu word normal system notori elimin stopword articl pronoun index full text document content size index importantli recal system includ phrase phrase recognit phase process stopword normal phrase origin form altern phrase base syntact word manual built phrase dictionari combin approach inform retriev system involv document process record featur assist match queri index associ term document phrase gener document queri process similar manner extract featur document featur queri featur compar separ document relev queri order select document prepar relev system relev step involv user mark relev document displai resubmit rank system judgment system modifi origin queri difficult formul queri retriev system document collect relev feedback yield progress refin reformul queri refer feedback significantli improv retriev perform tradit inform retriev approach librari scienc signatur file method cluster index document gener bit string system popular todai hybrid variat technolog invert file index commonli approach inform retriev system method outlin subsect artifici method neural network genet algorithm cover survei document cluster idea document cluster similar document tend relev request group similar document search space reduc search document cluster involv cluster index cluster search queri process match cluster techniqu oper vector document repres number select index term document term chosen repres vector posit document vector absenc term document presenc term term weight occurr frequenc term document calcul term weight base rel occurr term vector model yield document space document point space partit point group constitut cluster format cluster format method classifi type iter hybrid method method base similar method appli graph theoret techniqu requir similar function measur close document relat document similar measur literatur method class basic connect edg point repres document document similar measur exce threshold document maxim cliqu connect result graph cluster number document method requir method graph theori requir quadrat time iter method requir similar function necessit empir determin threshold number cluster size iter method oper order log log gener approach determin initi partit iter document cluster assign improv cluster base measur method overlap cluster document cluster appli term term relat relev group term cluster reduct cluster repres concept vector term repres concept term reduc keyword dimens hybrid method combin similar matrix iter method salton present method iter approach gener rough partit document method subdivid partit smaller cluster cluster search start process queri repres vector cluster queri similar function requir function compar queri vector cluster centroid search cluster similar queri vector exce threshold vector model cluster method relev feedback relev document retriev mark system reformul queri vector restart cluster search effect search shown iter cluster techniqu attract interest lee present similar base approach solv data problem cluster method techniqu appli word classif natur languag process document cluster speech recognit reduct document signatur signatur file document retriev document yield bit string call signatur filter signatur document collect signatur file form index signatur store sequenti order document document store pointer document document signatur gener transform word document bit string concaten code perform similar transform queri word compar result bit string document determin document queri word smaller document signatur file search faster hash function method gener document retriev relev signatur file method effici distribut signatur uniform import select good effect hash function techniqu aim uniform distribut variat signatur file method base choic hash function approach adopt combin word signatur document signatur prove signatur probabl posit occur minim number document signatur equal number space wast number pair match bit convei optim half bit set bloom automat select size document signatur convei probabl bit filter size filter calcul base distribut number word document collect number transform perform word signatur file suggest tree structur document signatur cluster signatur approach improv search speed signatur file low accuraci rate signatur file method popular low space overload requir method major drawback entir signatur file consult method term disk oper number document larg reduc cost robert suggest store signatur file organ signatur file row signatur bit signatur file organ signatur column bit document signatur store consecut bit signatur row structur random access file reduc oper drastic updat easi normal signatur bit slice signatur file costli mainten time document updat signatur file chang invert index relat model model commerci invert index commerci inform retriev invert index invert file term set document list document file order alphabet order term term compound word phrase term store sort invert file pointer post file document access number document figur show term document pointer point record post file pda pointer store pointer store consecut post file point document document file structur easili built document collect cumul counter select term search process simpli locat document specif term retriev document pointer post file point term entri invert file tree structur top sort invert search process extrem fast invert file structur permit easi process boolean express set oper document set term express simpl intersect document set point term set point term yield document satisfi union set term invert file pda doc ptr post file size ptr list doc list doc document file pda figur invert index file structur yield document satisfi oper process manner problem invert file structur storag overhead invert file structur requir origin document collect size depend term chosen overlap synonym disadvantag method mainten cost ad document involv updat document list post ad term necessit costli tree structur updat easi implement speed invert file outweigh make method larg todai web search engin applic simpl structur invert file convei addit inform rank document retriev relev rank document base heurist number term queri popular term collect inform obtain invert file structur enhanc inform file structur addit file hold posit term document chang post file schema ad pointer post file figur show structur term document pointer invert file point record post file consecut record structur figur record post file pointer document number occurr term term invert file post file size ptr list doc list doc document file pda posit file pda ptr doc ptr po occur figur invert index file structur posit file document pointer list posit term document list store posit file time document pda posit number occurr term document relev rel posit search term document rank relev document proxim term close term retriev queri term weight assign term document equal content term import give weight term import document rank document relev term weight approach order assign high weight term deem import low weight import frequenc term document respect frequenc collect term frequent document document term repeat document import term document weight equal term frequenc time frequenc term collect definit weight favour term high frequenc document low frequenc collect document collect repres weight term vector form weight term document number distinct similar measur calcul pair vector measur reflect text similar document queri process manner weight vector queri similar comput form comput document collect similar rank list document order similar obtain queri sampl document hypertext multimedia major resourc internet resid web web hypertext web start hypertext import provid hypertext develop hypertext basic concept introduc ted coin term bush idea ted nelson develop project aim place entir world literari corpu hypertext text provid access inform incorpor notion tailor present hypertext defin approach inform manag data store network node connect link node sourc form hypertext call hypermedia major origin concept hypertext concept link link node document hypertext system collect node interconnect unidirect link permit backward document link capabl organ text figur show hypertext document node link origin call node link point call refer start point link refer anchor button read user present node consid document part convei theme click link user node user interfac paramount hypertext system navig larg amount inform author document system cognit refer cognit task schedul problem author addit effort concentr maintain task track datamin discov pattern trend inform retriev resourc internet manag system knowledg discoveri internet extract implicit inform network collect network internet figur hypertext document link user interfac issu hypermedia author issu drawn attent research commun major inform retriev approach model approach simpl navig document node node link major user tendenc lose locat direct document problem aspect problem address user interfac offer browser effort put issu hci ui research solut cope queri mechan node tradit inform standard inform retriev index techniqu appli usual queri boolean oper combin user locat interest node give addit inform rank heurist exploit node relev rank survei resourc discoveri internet moon land event time advent internet greater impact societi rememb centuri atom bomb centuri centuri birth global commun network atom bomb reaction politician emot impact societi mean rememb bad experi civil internet collect servic continu grow level imagin todai internet necess afford lose entertain internet start initi advanc research project cold war build depart explor possibl commun network surviv nuclear attack initi network connect research centr connect introduct commun protocol earli interconnect research result internet backbon nation scienc foundat establish supercomput centr unit state dedic network fund connect centr internet backbon growth number host growth packet traffic backbon tabl figur graph figur show growth internet host domain number web site number growth internet advent web connect commerci provid growth import number softwar tool make multitud resourc network transfer protocol adopt creat resourc internet file transfer protocol frequent servic internet term data packet subspac million document estim terabyt scatter thousand subspac usenet space web space contribut size internet interest note attempt made index aim internet subspac archi index ftp veronica index gopher search engin cover web recent web index includ usenet subspac ftp gopher internet tool inform retriev section outlin widespread network inform retriev tool servic number tool todai larg grow quickli classif order popular servic internet resourc retriev resourc categori network inform retriev tool servic categori encompass commun servic electron synchron chat categori group inform storag inform exchang inform index inform retriev categori interact multimedia inform deliveri web fourth categori commun servic electron mail main internet applic send messag user comput recipi user destin user machin connect network messag text busi memo person letter multimedia imag video major document gener servic privat contribut larg public resourc internet corpor archiv offic memo exchang archiv person electron mailbox grow rapidli necessit inform retriev date host domain web site figur growth internet figur growth internet term number uniqu host figur growth internet term number uniqu internet domain figur growth internet term number web site techniqu locat data mine techniqu summar messag content usenet usenet collect host receiv network discuss group forum varieti topic network mechan broadcast messag host larg number host messag articl receiv host usenet peopl access usenet host read messag connect simul messag broadcast peopl access group read post repli messag group messag archiv access thousand group topic scientif polit larg collect articl post daili usenet contribut significantli rapid size resourc accumul internet relai chat textual chat popular earli dai internet unix facil servic interact commun remot user irc session archiv busi chat session save corpor intranet retriev refer grow popular commun servic ad enhanc regularli newcom net net video significantli contribut larg number resourc figur timelin internet inform storag inform exchang servic anonym file transfer protocol access remot comput ftp server portion file directori structur exchang file web wide anonym ftp archiv site publicli access ftp wide access sourc inform internet ftp site offer file relat topic interest file document execut data file comput store ftp archiv site maintain volunt effort file directori access anonym explain content file directori standard content structur readm file file free text describ file manual ftp server directori structur read readm file order find sought resourc techniqu implement find resourc anonym ftp archiv site archi section analysi file ftp site present anonym ftp million textual document anonym ftp ftp site contribut wealth inform internet thousand ftp site total million roughli terabyt data internet distribut document deliveri system origin develop effort provid minnesota student staff flexibl inform system dissemin kind inform commun simpl singl interfac made popular rapid adopt site internet gopher evolv system primarili intend distribut document environ provid access type network servic gatewai initi popular gopher gopher space shrink gradual web document index retriev system gopher develop veronica present section file system transpar read access file distribut anonym ftp site internet access ftp file log remot host copi file alex ftp file part local file system file directori ftp site local file system root directori internet domain ftp site code alex structur simon fraser ftp site ftp berkelei file call local unix tool grep find find retriev document remot site make local copi track remot file updat document file put anonym ftp site alex inform index inform retriev servic web servic internet term data packet transfer nsf ftp servic internet ftp account larg amount data transfer internet hundr ftp site offer raw order find ftp site file archiv directori structur ftp download readm file eventu find file sought archi electron directori servic implement mcgill peter alan bill locat file archiv anonym ftp site automat catalog system period retriev list file anonym ftp site directori anonym ftp list combin searchabl access internet archi inform system gatewai archi file modif date ftp site path file found index produc month mirror site reduc traffic problem archi file index mean order locat portion find file archi descript file file topic archi extrem web system implement cnet provid index free softwar ftp web server organ topic veronica easi index internet gopher system simpl user interfac protocol simpl stateless protocol server request return document menu close connect make autom gopher space easi search document hierarchi menu eventu locat resourc develop make easi search item gopher space titl veronica period gopher space request menu gopher server start set regist menu index titl text menu receiv search term result menu link gopher menu search term menu entri veronica popular gopher gopher space veronica useless wai area inform develop machin system user search retriev document type resourc index wai develop collabor appl comput dow jone initi busi execut contrast archi index file wai index keyword content textual bibliograph descriptor graphic file archi veronica central index singl global index wai address scalabl approach decentr index wai divid index server provid inform server index inform locali regist repositori index directori oper machin directori index classifi server knowledg inform wai server server special resourc topic search user connect directori server select server search queri submit natur languag select server elimin conjunct remain word phrase appli full text index find relev document document rank base heurist word weigh algorithm relev document fed back server refin search relev success search automat run alert user inform wai system underli index scheme web search engin wai index inform retriev spider section show gener architectur wai approach distribut index unifi comput scienc technic report built marc indiana servic searchabl index exist technic document broadli relat comput scienc store anonym ftp site index pull inform larg number regist anonym ftp site format readm file regularli visit regist ftp site automat download readm file find readm file free text format merg larg master index technic report index ftp site file descript found readm file index technic report academ paper system advantag complet autom mainten index cumbersom readm file written free text readm file differ site site time ftp site ad regist ftp site index builder rewritten updat order account structur readm file site figur server directori wai server server select user queri figur wai gener architectur show gener architectur system internet directori servic develop network resourc discoveri project colorado fact locat document servic worth mention exemplari methodolog resourc discoveri attempt locat electron mail address inform internet user dynam develop protocol collect regist user internet difficult approach exist network servic locat machin sought user resid address machin finger servic strategi adopt intellig agent internet section regularli usenet archiv servic retriev uniqu address build internet hierarchi address futur search search queri submit provid login keyword describ institut locat user sought resid set heurist locat host desir user account mailbox queri refin user select locat guess subset domain select user search parallel advantag exist network servic success scalabl growth internet exist network servic resourc prove viabl prevail method suppli servic internet master index file http search engin index builder queri pool user www client ftp server cs tech report figur gener architectur interact multimedia inform deliveri servic web interact multimedia inform deliveri servic internet advent hypertext text retriev system research hypertext focuss user interfac author issu hypertext project wide area distribut global system access intern project cern led tim robert attempt make distribut inform easi physicist work world exchang data web born project rapidli adopt internet user interact multimedia support web reli hypertext document format html markup hypertext link document travel current document html annot document hypertext link intermix text imag media document web browser mosaic web wide interfac mosaic internet servic share inform internet simpl web user larg collect inform network log advanc inform web technolog choic deploi inform internet major reason tremend growth internet term amount publish inform term network figur show exponenti number web site internet gatewai internet servic develop web synonym internet huge amount data rapidli cumul web web find inform cumbersom find real inform process user drift end read possibl interest page irrelev origin phenomenon similar dictionari section highlight evolut inform retriev techniqu appli web catalogu directori number web page small start web list web server maintain cern suffic resourc larg number web server web page todai prohibit method inform retriev web start build list interest link made list publicli list ncsa meta index maintain list refer list user access refer resourc collect web rapid web site web page made list obsolet attempt make list automat collect refer introduc centr universitair dinformatiqu geneva base automat retriev refer fix set document report site automat sift group articl automat collect list refer resourc size rapidli larg valuabl resourc make list list made searchabl search kei user find entri refer list interest real index construct search process real time list text match string time dynam natur web made list stale impract catalogu directori built repres wealth resourc web rapid growth internet mainten list scalabl success catalogu web page yahoo initi graduat student stanford yahoo classif topic built hierarch tree node tree categori visual menu arc tree structur leav link web resourc resourc review classifi manual editor author submit url resourc web page web titl descript resourc yahoo editor submiss accept refer resourc classifi ad yahoo directori searchabl index yahoo directori implement contrari yahoo search engin web resourc larg yahoo searchabl index resourc catalogu yahoo editor index keyword resourc content index entri word yahoo categori resourc titl resourc descript submit author classif resourc user hierarchi find inform relat topic origin yahoo fact resourc necessarili individu web page autom discoveri index submiss describ entir web site accept content web page index user search directori topic submit term search case match resourc categori search term resourc titl descript search term document result rank prioriti base term final descript success yahoo copi concept present friendli user interfac review directori site looksmart approach present user initi list topic topic classif topic present origin list remain screen retain list continu select document list displai easili path reach resourc concept hierarchi classif looksmart hybrid search engin search catalogu combin result result search web space search engin popular type catalogu special directori refer resourc pertain topic directori refer web page relat directori creat manual author gener result queri submit search engin build search engin top special directori creat special search engin ring type special resourc directori circular list maintain web site pertain common central list site figur ring site topic collabor insert hypertext link web site link previou site circl site link site list site form ring central orchestr ring accept maintain server list link site ring user jump site ring randomli access site request link central list server figur show ring web site interconnect robot search engin simpl automat collect resourc solv problem inform retriev automat discoveri make effect wealth inform web space program download analyz store inform index queri document found explor graph hypertext link form document initi web link extract ad queue url resourc process repeatedli select url retriev page extract link program wander robot crawl web mirror statist calcul size internet estim todai number web site academ work describ robot work jonathan fletcher stirl implement work oliv mcbryan develop worldwid web worm search paper eichmann reveal anatomi spider built softwar engin program fund nasa wwww index text titl header html spider full text index hope improv recal system architectur system major parser index spider program visibl web download document found import note visibl spider limit connect graph document commenc start point start document web indirectli connect set start point ensur coverag directori web site good start point spider elabor compon search engin manipul larg url respect visibl web import note spider web page access dynam gener web page authent index receiv document download spider extract url link found document refer pass back spider download text analyz extract term index extract term differ system index full select term depend locat document analyz begin document compon index result index depend larg inform retriev technolog chosen system invert file vector space model probabilist index model call search engin fact program sift index answer user request interfac user index automat autonom explor web structur build searchabl index simpl eleg solut inform retriev web involv ethic concern relat result impact spider continu retriev entir object discard retain content robot gener substanti load web gener traffic internet spider index entir web content download plethora search engin entir corpu circul continu internet spider gener local load overload inform server continu consecut request document spider flood server prevent serv user precipit controversi base guidelin implement program web allevi load server suggest standard robot mechan spider part server part access spider follow recommend exclud superflu web page avoid server send consecut request server short period time research advoc techniqu index web interest spider creat index web page author write descript regist index summari process remov problem server overload web crawler gener pertin inform index submit author web site manag requir extra work page author end describ resourc notifi aliweb exist harvest system multipl layer approach support distribut index architectur harvest solv problem server load network traffic move index task inform provid site system major gather broker gather collect inform provid index spider broker interfac index origin solut varieti configur gather broker network broker special provid custom gather resid host inform execut period multipl layer approach built distribut repositori metadata describ artifact internet special similar essenc execut inform provid site site maintain time extract pertin data build local structur success distribut gener form structur layer gener concept held lower level architectur offer user possibl hierarchi layer interact pertin resourc structur approach advantag high recal technolog present multipl layer architectur knowledg discoveri potenti techniqu offer search engin work parser index index search engin lv spider page page figur search engin gener architectur figur show gener architectur search engin search engin spider index replic parallel crawl index index distribut central compon url list manag share local simplest list url visit start found url store list process page url remov store list visit page list avoid revisit page list page visit conform robot guidelin avoid revisit problemat site spider select url download page move url lv page download pass index index page extract store extract term page index entir web index index search engin answer user request index rapidli rebuild index restart web initi start point list start point list augment url submit user site index scenario simplist web execut web spider challeng task involv perform issu issu high parallel implement web due larg size web index web exist strategi url select spider store modif date page visit order revisit page updat regularli static page domain popular site revisit select url spider account fact consecut request page server recent page present techniqu url select base backlink count url referenc select visit spider relev rank document due commerci search competit push spider crawl index resourc order assert complet index search engin claim index million document complet import factor long search result adequ index internet portion wouldnt matter set match document set match document make big differ user user larg set identifi document fit quest demonstr singl web search engin user relev document resourc search queri yield match search tradit inform retriev rank resourc found relev present order relev size model chosen index user import differ search engin rank mechan relev subject term difficult high confid real user queri queri present context search engin learn past experi search engin analyz term relat term document higher relev document consid locat term html document inform locat word phrase term titl header consid relev word bodi document frequenc locat factor determin relev search engin stimuli influenc relev relev rank capit success search algorithm secur guard rare factor calcul relev document heurist larg support document higher frequenc keyword rank document low keyword frequenc frequenc calcul percentag keyword document order normal document size count frequenc word weight base locat document locat respect word titl gener consid import locat consid url anchor begin document word consid import paragraph close keyword factor word weight search engin disadvantag isol word favour keyword complet sentenc number match keyword queri import factor determin relev term queri match word document relev queri search term consid term document rank bf entireti creat cluster document rank frequenc search engin favour smaller document larger date modif document access easili date favour document instanc track modif date search engin updat frequenc document favour rank document updat regularli hybrid search engin maintain directori favour document catalog site catalog consid import web page referenc page import popular web page estim count number link lead page rank search engin favour page link point link weigh base popular web page notion link qualiti dublin metadata workshop stress import document network document facilit discoveri extens html specif includ tag descript keyword content summari insid html document figur show excerpt html document tag tag enter document author keyword reflect real content document relev rank web search engin favour page keyword survei search engin engin figur snippet html document meta tag meta tag match search term match term document bodi term extract meta tag keyword higher weight internet domain web page retriev plai role rank domain rank search engin compani pai page rank match page occur rank document import rare user dig deeper page document list statist show user page rank web page author web page rank commonli call spam spam consist ad keyword page keyword user comment tag colour text visibl web crawler common techniqu put keyword meta tag relat page actual gener keyword frequent keyword copi meta tag site rank high search engin techniqu heurist detect spam search engin penal detect rank lower techniqu rank retriev document recent direct hit direct hit technolog clever ibm almaden research lab pagerank stanford direct hit relev feedback approach user select usual search result record document select relev time queri submit technolog queri frequent direct hit gather inform user select queri inform direct hit rank proce direct hit exclud rank strategi supplement ad rank strategi idea complet metacrawl present section exploit user chosen refer metric search result rank metric account origin resourc select pagerank search engin stanford base basic compon rank metric link popular larg link graph call citat construct repres present link web page graph attribut pagerank weight web rank page search result mechan calcul pagerank page number link number page point pagerank dump factor pagerank repres probabl page random clever heavili base link frequenc rank document measur link main state simpli rank document search find authorit resourc pool web page object build directori yahoo directori automat find authorit entri categori start categori categori queri gener standard search engin result gather search engin constitut pool document order rank document authorit topic queri current directori categori page point page point document pool retriev add pool document page collect weight iter calcul weight link point carri weight page cumul weight iter page point import page weight clever page text add weight link search term text sort page authorit select repres catalog categori clever search result calcul weight time depend size root set classifi clever knowledg discoveri approach find network inform base relationship find resourc internet retriev al show due widespread synonymi polysemi natur index method base occurr singl word perform adequ method match word similar mean string pattern search tool find relat document search word queri search document retriev document concept sibl synonym broaden scope search includ thesauri thesauru correl term search engin conjoin search term relat term thesauri static base built dynam statist track word commonli queri document relev rank favour match search term match similar concept stem common techniqu retriev consist extract stem search term concaten suffix gener term gener poor case stem gener word stem advantag substr match document similar search consid type retriev word weight techniqu gener term weight vector repres document compar document similar function similar function present section start document similar search find document document term live document leap anim share similar vector similar research knowledg natur languag process pave automat techniqu gener queri lead content retriev approach concept hierarchi match concept concept hierarchi built expert synonym languag built automat subject extract assumpt agent inform retriev spider sort inform gather type agent special inform retriev agent base inform retriev stimul great interest past year definit agent question gener research relat field product heterogen knowledg cognit learn commun distribut queri field interest inform gather desir characterist agent allud research singl agent agent prototyp todai compound desir characterist agent includ commonli characterist distinguish agent form softwar compon agent initi control action modifi dialogu user clarifi request invok agent agent static chang sequenc action environ learn interact user agent custom prefer user agent commun engag involv commun user agent dialogu user disambigu request commun collabor agent user paramount inform gather task deleg agent perceiv plausibl behaviour emot state agent charact effect commun avatar repres act behalf user virtual space agent typic run host retriev inform scatter internet make resourc transmit real mobil agent agent transport duplic execut host exist agent mobil agent inform gather amount inform server greater transmit client mobil agent execut server inform gather filter mobil inform gather agent great import client machin disconnect lack process power resourc perform filter inform retriev agent program learn user adapt react collect retriev resourc knowledg satisfi network inform retriev agent person assist act behalf user reli tool servic user state agent determin find inform internet retriev simpl agent allevi burden resubmit request search engin automat send simultan user queri popular search engin agent specif featur search engin adapt search queri user rememb specif characterist peculiar queri interfac agent merg result elimin unnecessari duplic download web page result list scan content search term filter present relev result list similar resourc select search engin queri savvysearch learn identifi search engin queri track perform search engin agent search experi rank special search engin queri savvysearch adapt user adapt resourc approach similar inform agent matchmak present intellig facilit match inform provid consum agent adapt user observ user activ recommend resourc queri user system similar profil retriev submit agent manag user profil updat regularli base user interest activ web commerci base user behaviour predict user automat download local cach web page potenti interest user regularli access set page time dai stock agent automat retriev page minut usual access time cach local prepar user popular task agent inform filter inform filter internet context extract relev inform larg volum dynam gener usenet electron mail commonli dynam larg document collect inform filter internet dynam natur document repositori bind requir inform filter system continu run process sift incom messag filter messag satisfi user requir interest similar agent listen group channel alert user interest topic discuss agent summar articl interest appli approach web monitor found relev page agent report interest breed agent inform filter gather worldwid web shop agent access vendor web page bargain compar price offer suggest present user automat order product initi jango web shop compar product price offer creat account user initi inform gather agent time inform retriev domain domain return inform knowledg return resourc agent perceiv web mine process multimedia resourc discoveri imag video index retriev interest research field drew attent advent worldwid brought challeng comput vision artifici intellig commun tradit pattern recognit imag analysi algorithm vision ai field dealt small set imag scale larg collect imag video frame internet requir scalabl effici interest imag video retriev system begin web main famili imag video index retriev base content imag base descript imag imag retriev system suffer poor due term extract process automat assign keyword imag tricki task imag retriev system visual featur index imag system differ extract visual featur index queri system queri provid imag sampl system search similar imag compar featur vector extract sampl featur vector imag retriev system imag surfer provid base type search system queri sketch imag featur shape translat featur vector match featur vector qbic imag webseek provid queri imag featur specif queri combin imag imag number face imag content distinguish photograph figur visual featur extract limit imag retriev digit exploit retriev combin conjunct disjunct imag featur descript queri imag retriev system retriev imag imag surfer qbic larg imag repositori base object major differ imag retriev system domain index qbic index sole imag imag intern present web imag multimedia orient retriev index imag web index imag internet pinpoint web page imag graph web page imag easili discov resourc imag descriptor imag system give satisfactori result regard visual recal optim data mine knowledg discoveri internet data defin process extract unknown potenti inform data larg data mine princip core knowledg discoveri includ data data relev data pattern evalu knowledg visual data mine appli wide spread web technolog made larg document collect web ground knowledg discoveri research contrast resourc discoveri find retriev resourc knowledg discoveri internet aim deduc extract implicit knowledg necessarili resourc tradit knowledg discoveri function put time seri appli global inform network function attempt internet appli document repositori success text mine instanc attract interest import asset corpor organ collect document regularli technic web collect free text document embodi corpor cumul time essenc inform retriev system pinpoint relev document insuffici text drastic improv inform retriev system extract relev knowledg document allevi retriev document manual search pertin knowledg text mine includ knowledg discoveri data clean knowledg visual domin categori text mine text text document document visual keyword associ classif cluster visual similar search term categor document visual document text analysi text interpret figur text mine pyramid text analysi text document content investig syntact correl semant associ term kei concept phrase extract repres document document section text interpret abstract document form document content document categor organ document collect document visual consist document concentr group group intersect figur show pyramid text mine theme order categori pyramid illustr relationship text mine function function extract relev kei document extract limit term concept pertin topic document extract relev kei inform document essenti idea document abstract synopsi similar search document similar concept document organ collect document predefin theme set class descript document classifi document belong class search predomin theme collect document categor document found theme text mine part technolog constitut knowledg discoveri internet primarili act textual content internet highli dynam multimedia environ involv interconnect heterogen web structur mine web content mine web usag mine search result mine gener access pattern track custom usag track web page content mine web mine figur taxonomi web mine techniqu interact user text mine limit grasp knowledg environ data mine commonli call advantag content usag resourc relationship resourc web intersect data mine grow includ technolog found artifici inform field inform inform retriev document rank hyperlink featur usag categor web mine web mine defin topic continu fall realm figur show classif domain akin web mine web roughli knowledg discoveri domain pertain web web content web structur web usag mine web content mine process extract knowledg content document descript web document text resourc discoveri base concept index technolog fall categori web structur mine process infer knowledg web organ link refer refer web web usag web log process extract interest pattern web access log web content mine knowledg web buri insid document current technolog bare scratch surfac knowledg extract keyword web page result user search engin emerg human assist search internet web content mine automat process keyword extract content text document present approach suggest restructur document content exploit machin web structur effect web mine case intermediari reli built structur limit type set document typograph linguist properti natur document internet task technolog harvest reli structur document retriev inform usual approach exploit structur document wrapper map document data model declar languag queri data model reli rule repres web document graph tree extract knowledg restructur web document relat tabl advantag relat power data mine possibl techniqu lexicon content interpret group web content mine mine directli content document improv content search tool search engin web page summar research work retriev inform structur suggest approach limit group wrapper map content document intern promin research result knowledg discoveri heterogen irregular web present shopbot project special discov person homepag inform internet servic search engin retriev resourc relat person data heurist identifi typograph syntact featur insid document document person homepag weboql queri languag web page restructur graph tree web capabl retriev inform site cnn tourist guid shop agent learn recogn document site offer search servic human assist structur catalogu extract price list special offer agent capabl compil inform retriev site discov interest bargain search engin result summar heterogen web absenc structur lead research mine subset document data document pertain topic subset search result queri search engin system present small relat tabl minim inform provid queri languag result refin system access document retriev search engin collect inform document data provid server content content modif link declar languag abil retriev pertin document search result zamir etzioni present techniqu cluster document retriev set search engin techniqu reli sole inform provid search result snippet descript line page induc cluster categor retriev document discov cluster present repres view top list retriev document facilit sift larg search engin result list web structur mine interconnect hypertext web reveal inform inform document link point document popular link document rich varieti topic cover document compar bibliograph citat paper cite import method advantag inform convei link find pertin web page multi layer multi level internet level obtain success transform gener perform lower level lowest level primit inform store internet higher level store broad concept concept lower level save local specif relat tabl depend scope record describ characterist artifact found internet web page imag mean higher level cumul number artifact subsum concept hold power structur content global inform system web declar defin queri structur exploit knowledg convei inform network explicitli state document queri return list european provid web site document select affili document europ affili belong field public year count web usag mine web grow local server provid resourc simpl structur collect web access log web server record accumul data user interact request resourc receiv analyz web access log web site understand user behaviour web improv design collect resourc main tendenc web usag mine driven applic gener access pattern track custom usag track gener access pattern track analyz web log understand access pattern trend shed light structur group resourc provid web analysi tool exist limit unsatisfactori techniqu data mine onlin analyt process present appli data mine techniqu access log interest access pattern restructur site effici pinpoint effect target specif user specif sell ad custom usag track individu trend custom web site user inform depth site structur format resourc dynam custom user time base access pattern innov studi adapt web site improv learn user access encourag excit potenti applic web log file import success applic depend valid reliabl knowledg discov larg illinoi maintain list web access analyz hypernew page access raw log data current web server store limit inform access script site store addit inform effect web usag mine import clean data transform step analysi inform revolut publish sort document amaz speed overwhelm public techniqu manag excess resourc retriev pertin document develop growth term resourc term user access show urgenc crucial effici effect resourc discoveri techniqu survei outlin major inform retriev approach internet pinpoint weak major problem current technolog relev problem relev document search result make current search engin useless research effort underwai develop retriev web mine survei report initi undertak research necessit contribut collabor commun artifici data inform natur languag field born refer serg dallan jason jennif janet wiener lorel queri languag semistructur queri data int conf mark brian michael pazzani effect social discoveri filter web proc assist inform search av aho mj fast pattern aid bibliograph search commun june ai intellig system ai intellig petkov retriev visual review int multimedia tool novemb alex ftp filesystem craig knoblock queri process sim inform mediat laboratori plan schedul initi arocena alberto mendelzon restructur web proc icd februari jr al virag imag search open framework imag manag spie storag retriev imag video februari gordon bell jim prospect inform dream commun tim world wide web initi tim robert ari henrik arthur secret web commun august michael provid inform system full hypermedia function proc hawaii int conf system eric rob winslett secur access data internet bloom space time tradeoff hash code error commun mic peter michael schwartz customiz discoveri access system technic report mic peter michael scalabl internet resourc research problem approach commun august rs boyer js moor fast string search algorithm commun octob de bra post inform retriev make search feasibl jeffrei bradshaw softwar agent aaai press mit sergei brin lawrenc page anatomi hypertextu web search engin int conf april peter buneman semistructur tutori princip system confer bush atlant juli sr tomkin experi topic distil acm sigir workshop hypertext inform retriev andrea jai jerom yen intellig meet agent ieee august junghoo hector lawrenc page effici crawl url order int conf april georg track growth commun august jeff introduct survei ieee septemb bruce croft howard turtl retriev model incorpor hypertext link proc page novemb daniel rissland approach intellig inform retriev proc acm daniel rissland approach intellig inform retriev proc sigir page archi electron directori servic internet martin erik mark carol assess inform provid librari servic commun internet spring weld scalabl agent web proc autonom agent eh dl wp birmingham agent architectur michigan digit librari ieee softwar februari david eichmann spider balanc effect search web load proc www david terri integr structur system han erickson multicast backbon commun august oren etzioni gold commun oren etzioni move inform food deploi softbot world wide web ai oren neal richard segal build softbot novemb preliminari report oren etzioni daniel weld interfac internet commun oren etzioni daniel weld intellig agent christo faloutso access method text comput march christo faloutso dougla oard survei inform retriev filter method technic report august david yesha approach resourc discoveri journal internet fletcher internet robot structur front al queri imag video qbic system ieee page septemb imag search engin world wide web technic report cs univ imag search engin world wide web technic report comput scienc august jeff meta tag organ web page jeff web net norbert fuhr ulrich pfeifer inform retriev combin induct assumpt acm transact inform tk lm dumai vocabulari problem commun commun david john robertson hypermedia author ieee page andrew legion worldwid virtual comput commun david grossman frieder inform algorithm heurist kluwer academ jiawei fu resourc knowledg discoveri global inform multipl layer approach technic report simon fraser novemb jiawei fu resourc knowledg discoveri global inform scalabl multipl layer approach proc conf advanc digit hardi schwartz resourc discoveri system base semant file index proc usenix winter page rl processor text retriev septemb navig hypermedia system acm page adel daniel metasearch engin learn search engin queri ai michael munindar tomasz global inform manag local autonom agent proc int symposium gener comput workshop heterogen cooper knowledg michael huhn munindar singh read agent morgan kaufmann inktomi technolog hotbot white paper karen sparck jone peter willett read inform retriev morgan kaufmann literatur inform retriev hypertext septemb de jh vr pratt fast pattern match string siam june konopnicki shmueli system www queri proc ieee cs intl conf data koster aliweb archi index web proc int conf world wild koster guidelin robot writer nexor koster standard robot nexor koster web robot nexor koster world wide web spider robot nexor daniel kuokka larri matchmak inform agent proc joint conf daniel kuokka larri matchmak inform agent proc int joint conf page subramanian declar languag queri restructur web proc int workshop research issu data jane lee approach natur languag process phd harvard michael lesk ag inform retriev alon avi divesh maria challeng global inform system proc vldb illumin invari object model imag video retriev journal visual commun imag submit review bing yan imag retriev imag repositori chromat recognit kernel technic report simon fraser februari bing yan imag retriev digit librari illumin invari recognit kernel proc int workshop storag retriev issu imag multimedia int conf expert system august manber peter connect web search facil bulletin maron jl kuhn probabilist index inform retriev journal oliv tool tame web proc www kenneth corpor inform manag electron ag mendelzon milo formal model web queri acm symp principl alberto georg milo queri world wide web proc decemb merit data hara multimedia world wide web inform retriev engin proc sixth int www santa ted nelson file structur chang acm nation nguyen srinivasan access relat form world wide web proc acm sigmod conf manag june doug oard kim inform filter resourc daniel daniel robert plant artifici intellig virtual organ commun roger palmer onlin refer inform retriev librari rw sclaroff tool manipul imag spie storag retriev imag video volum page san perkowitz etzioni adapt automat learn user access pattern proc int world wide web santa april richard einer peterson biologi taxonomi smith data mine knowledg overview um advanc knowledg discoveri data page jeff crawl guid web pc riloff text inform retriev handbook comput scienc ab tucker crc rissland daniel cbr drive ir proc ijcai page august cs robert retriev method code proc decemb se robertson rank principl ir journal salton automat phrase match read automat languag process american elsevi publish compani salton automat inform retriev ieee comput salton bucklei improv retriev perform relev feedback journal american societi inform salton mj mcgill introduct modern inform retriev erik signal detect analysi www search engin design empir octob kyle net grown guid kyle search engin web directori guid michael alan brewster clifford neuman comparison internet resourc discoveri approach comput selberg etzioni search comparison metacrawl intern world wide web erik selberg oren etzioni search comparison metacrawl fourth intern world wide web page etzioni home page finder proc sixth world wide web santa april avi mike jeff ullman opportun centuri report nsf workshop futur system john smith stephen weiss overview hypertext commun juli jr smith sf chang visual search web content ieee mathemat analysi code method american februari danni search engin watch danni sullivan richard web search page dm sundai fast substr search algorithm commun august gari index internet elizabeth queri base technic report marc unifi comput scienc technic report lesson index resourc proc int www octob winslett web fourth intern world wide web page ronald chri charl ward mosaic web ieee octob peter vigil onlin retriev analysi strategi john lynn ward explor power internet gopher dec jan stuart jean eric miller workshop metadata essenti element network object march core stuart jean eric ron daniel metadata workshop report essenti element network object march core daniel weld oren etzioni law robot call proc aaai william william principl autom inform retriev busi wa wood import issu knowledg proc octob tak yan hector electron librari access worldwid inform ly jerri lee world wide web resourc discoveri system fourth intern world wide web page ct method detect describ gestalt cluster ieee tran januari andrew stephen veronica paul tarau retriev control natur languag proc workshop applic natur languag inform system june andrew stephen veronica paul tarau resourc discoveri natur languag search june zaian jiawei han resourc knowledg discoveri global inform preliminari design experi proc int conf knowledg discoveri data man jiawei han discov web access pattern trend appli olap data mine technolog web log proc advanc digit librari page santa april robert hobb hobb internet timelin oren zamir oren etzioni web document feasibl demonstr proc acm oren oren richard karp fast intuit cluster web document appendix glossari inform retriev web page attempt give definit term relev inform retriev glossari compil glossari origin scott weiss agent agent autonom piec softwar act behalf user task inform gather inform filter anchor hypertext start point link button click anchor link node anchor boolean queri queri boolean combin term exampl classif process decid categori document exampl decid newsgroup articl belong folder email messag direct gener topic essai cluster group similar document vector space perform retriev compar queri vector centroid cluster continu search cluster collabor filter process filter document determin document user similar interest found relev call collect group document user inform test collect collect fusion problem combin search result multipl collect tricki measur idf differ retriev fix number unclear collect filter process filter extract featur text document determin document relev call crawler spider document piec inform user retriev text web newsgroup sentenc book hyperlink web context link anchor web page commonli call hyperlink anchor index process convert collect form suitabl easi search retriev inform extract relat area attempt identifi semant structur specif type inform unrestrict text inform filter larg amount return data user standard problem ir inform user queri approxim inform inform retriev studi system recal text unstructur form document frequenc abbrevi measur term document collect defin document common word low idf word uniqu document high idf typic weight paramet model invert file collect essenti index word term invert file list document perform boolean queri link hypertext associ phrase imag node relat inform node link connect inform document navig hypertext process click anchor point leap node anchor point connect node hypertext context part document document broken smaller part call node node text scene video resourc normali convei idea theme standard measur ir defin number relev document retriev divid total number document retriev document relev widget collect system return widget xs ideal easi achiev return system attempt maxim recal simultan high retriev record meet exact inform term process compound term describ document page index term retriev term process singl term describ document combin base queri page index word glossari wed combin term base queri probabilist model model consid probabl term concept document satisfi inform bayesian infer net good framework style model inqueri system success queri string word inform user seek note english languag question queri process build queri creat ad term relev ad synonym term queri found question answer problem find exact answer user natur languag question larg collect recal standard measur ir recal defin number relev document retriev divid total number relev document collect document relev widget collect system return widget xs recal ideal recal trivial achiev retriev system attempt maxim recal simultan high recal retriev record german inform relev abstract measur document satisfi user inform system retriev relev document subject notion difficult quantifi relev feedback process refin result retriev queri user document return relev queri system typic find term common add queri return document queri repeat desir call similar resourc discoveri extract refer document relev queri robot spider rout similar inform problem retriev data continu stream incom inform signatur file collect document hash bit string essenti compress techniqu permit faster search similar measur alik document alik document queri vector space interpret close vector popular method comput cosin angl vector spider call program scan web url start web access link graph form web record inform server creation index search facil search engin creat spider problem written make larg number hit server short space system perform decai softbot softwar robot agent web search resourc servic tool collect refer stem process remov prefix suffix word document queri format term system intern model group word conceptu walk user doesnt specif queri porter stemmer algorithm task download sourc code algorithm dont rememb download stem word porter porter stemmer port hit document boat wine stopword word preposit articl semant content refer word high frequenc collect stopword term remov intern model document queri system predetermin list stopword stopword depend context word comput stopword collect comput scienc journal collect articl consum report term singl word concept occur model document queri refer word origin text term frequenc abbrevi number time term occur document queri count weight paramet model test collect collect specif creat evalu ir system set label human decid document relev queri tipster preval test collect collect classif reuter text categor test collect document articl label varieti topic design vector space model document queri convert vector featur vector word document stem remov stopword vector weight give emphasi term exemplifi retriev queri vector compar document vector closest queri consid return smart famou system vector space model web mine web mine data mine web includ techniqu aim discov knowledg web weight refer process give emphasi paramet import term vector space appli featur vector popular weight scheme scheme boolean term term frequenc vector weight normal sum divid squar root sum squar
ML/1006 6 paper genet algorithm wai grow comparison evolv design problem peter bentlei kumar depart comput colleg london london uk abstract paper explor growth map genotyp phenotyp evolutionari system summari featur main type evolutionari comput identifi explicit implicit comparison evolutionari algorithm perform problem set evolutionari system evolv tessel tile order assess scalabl problem difficulti enlarg size tile evolv result implicit outperform techniqu show size genotyp accuraci evolut scale problem introduct comput evolv solut problem dramat popular success decad true design design great varieti evolv comput difficult design problem complex solut great care complex problem phenomena disrupt inherit prematur converg local minima prevent gener fit solut altogeth natur evolut complex life complex design make evolv design absurd simplic natur overcom problem evolv intric answer li evolv live creatur unlik evolutionari algorithm comput natur map genotyp phenotyp organ grown instruct provid genet materi live creatur grow result carefulli choreograph danc amino chemic electr signal movement convolut interact part grow creatur permit small amount inform gener complex form implicitli encompass concept adapt natur inher scalabl process evolv growth process open door evolut creatur fruit fly blue evolutionari begin explor possibl provid paper explain concept explor main type compar implement evolutionari algorithm growth process simpl design problem investig scalabl type unexpect result explain process growth defin genotyp map phenotyp note correct term refer term refer scienc studi main type evolutionari algorithm genet algorithm evolutionari program evolutionari strategi genet program ga treat genotyp separ ga made map stage begin develop map stage genotyp paramet phenotyp introduc evolutionari algorithm difficulti paper genet algorithm simpl map gene paramet regard elementari form strictli incorpor process special kind map process indirect correspond allel phenotyp effect genotyp regard set instruct recip defin phenotyp develop phenotyp trait produc multipl gene act combin provid benefit reduct search space permit highli compact genotyp defin phenotyp compress hierarch result genotyp fewer paramet reduct search smaller search space ea search space map permit differ space search space design easili search ea locat solut solut space complex solut solut space instruct genotyp defin phenotyp genotyp defin highli complex phenotyp repetit properli design improv abil evolut gener solut repeat structur subroutin adapt grow phenotyp genotyp constraint satisfi improv variabl correct malfunct design suffer drawback hard design type requir care research capabl perform difficult art demonstr success result hard evolv care introduc problem evolutionari algorithm disrupt child solut result carefulli design genet oper defin interact phenotyp effect environ develop defin main implicitli extern real complex design defin global extern genotyp evolutionari art system defin structur phenotyp construct gene genotyp advantag extern user retain control final evolv potenti improv qualiti evolv design care design type produc fewest harm effect requir genet oper disadvantag approach remain static unchang evolut genotyp necessarili impli evolv design design care ensur complex map process perform desir function william evolv art excel extern shape duplic simpl spiral depth duplic valu duplic evolv separ gener form bentlei gener evolutionari design system illustr adapt extern process design evolv system constraint satisfi map illeg genotyp legal phenotyp extern appli function symmetr design gener explicit step explicitli data resembl comput program design grown instruct instruct condit subroutin genet program evolv genotyp evolut paper genet algorithm simultan approach avoid emerg adapt map genotyp phenotyp initi condit act condit statement trigger growth creation suitabl difficult successfulli evolv difficult genet oper requir ensur disrupt type research koza team made extens studi evolut analogu electron circuit cellular encod explicit coat evolv architectur form system gero number type explicit work evolv architectur implicit natur evolut extern defin explicitli repres gene natur evolut highli indirect chain interact rule gener complex result develop live creatur flow activ complet predetermin parallel adapt simpl natur chemic surround cell activ suppress gene chromosom trigger pattern cellular growth cellular product chemic trigger gene live creatur grown egg chemic carefulli guid earli develop complex chain gene activ cell grow die form cell differenti perform function movement develop muscl affect develop placement cell research explor implicit evolutionari potenti advantag approach gene activ suppress time develop gene multipl inher parallel gene implicit todai genet program emerg implicit incorpor concept condit parallel process manual introduc explicit gp implicit type constrain gener holland resembl neural game theori classifi system evolv set simpl rule iter appli element grow problem tackl describ implicit defin pattern cell surfac extern defin morpholog shape mitchel evolv system design perform comput regard type implicit type approach work hugo de year successfulli evolv implicit grow artifici neural net scale compar explain main type rest paper describ comparison techniqu singl problem evolutionari system ga ga extern gp system explicit ga implicit problem chosen evolv morpholog tessel corner evolv tessel tile evolutionari system genotyp phenotyp fit function guid evolut shown left fig phenotyp repres simpl element fill empti calcul phenotyp tessel copi overlaid corner fig empti element overlap element central fit score increment illustr fig show tile tessel fig show perfectli tessel tile fig tessel fit paper genet algorithm fig perfectli tessel fit tessel tile construct search simpl set problem comparison creat optim softwar advantag problem aspect difficulti alter simpli size phenotyp grid problem scale permit studi genotyp chang effici term memori scalabl type explor evolutionari system act control subsequ test simpl ga binari string elit crossov ga map genotyp bit genotyp defin element phenotyp grid fill fig fig genotyp phenotyp extern evolutionari system simpl ga elit crossov manipul genotyp direct system emploi extern genotyp defin coordin set shape phenotyp gene pair predefin shape shape permit overlap edg fig fig extern defin set evolv coordin predefin phenotyp ten construct tile calcul tile fit half number element phenotyp grid number shape set ten calcul tile construct tile shape ten shape explicit evolutionari system gp evolv explicit form program tree begin seed cell centr phenotyp defin direct growth point function node tree branch path growth permit overlap fig show genotyp defin explicit root left fig explicit defin tree phenotyp gp system select crossov design disrupt cross parent point similar tree detail system crossov oper found bentlei gp addit fit function genotyp node implicit fourth final evolutionari system advanc ga evolv implicit genotyp variabl number rule rule paper genet algorithm precondit action precondit specif rule valu precondit field dont gradient left rule valu field precondit match disjunct rule action rule grow growth place phenotyp usual element order permit evolut rule provid detail specif area grid gradient direct similar gradient provid posit inform egg natur gradient divid grid number element phenotyp grid iter seed cell centr phenotyp grid model biolog cell rule appli fix number iter fill element current phenotyp grid unlik tradit cellular rule appli empti fill grid depend neighbour element current element exist strength gradient rule growth cell death phenotyp rule appli parallel result appli rule fill element effect end iter step rule perform updat action activ rule current iter appli prematur place cell phenotyp grid evolut number rule appli iter provid extra growth type rule action ad develop number iter found overli critic fig growth process left rule rule rule left precondit iter iter iter action fig implicit phenotyp iter ga crossov design cope variabl number rule genotyp detail ga oper found ch experi object paramet main object investig affect effici search investig scalabl tessel tile problem experi perform evolutionari system size phenotyp grid element twenti run system perform experi popul size system system evolv gener genotyp random explicit system random tree depth larger larger larger experi implicit system random rule genotyp number iter rule appli implicit set chosen genotyp size growth random crossov gener mutat emploi probabl approxim bit system result tabl result experi tile element method found perfect run tile element evolutionari system implicit found perfect solut run explicit obtain good fit extern fair slightli fit tile element ga implicit evolv perfect solut gener method found perfect solut fewer ten gener system match fit averag ea extern explicit unabl find perfect solut extern substanti explicit find chang solut size tile size implicit paper genet algorithm outperform approach term show chang evolv length genotyp experi stark contrast approach show dramat genotyp size explicit note ga implicit suffer addit fit criteria emploi reduc number rule lowest number implicit rule observ gener perfect tessel tile experi fig exampl perfect tile evolv approach ga gener set fragment full hole ga extern provid fragment hole gp system explicit produc tile typic subtl variat central diamond design tile fragment hole ga implicit evolv design fragment hole output system produc rectangl orient shown lack inher defin tile shape analysi result result experi prompt number question address approach favour type solut approach differ effici begin ga occurr fragment element hole high element phenotyp grid fill independ neighbour element smooth hole reduc approach suffer reduc perform phenotyp grid scale genotyp disrupt crossov gener requir order maintain good fit score ga extern demonstr varieti time varieti primit shape construct tile scale term genotyp compar quadrupl genotyp size genotyp size tripl problem scale exact number shape extern explicit implicit fig exampl perfect tessel tile evolv grid grid grid method size fit size fit size fit bit bit bit extern shape shape shape explicit node node node implicit rule rule rule tabl result experi paper genet algorithm depend size primit shape emploi primit shape scale number shape approach fare badli term fit primit shape ga simpli unabl evolv fit solut larger tile size fig illustr tile shown fig construct ga found intric wai fit overlap shape form perfectli tessel tile fig construct tessel tile ten primit shape fig gp system explicit provid tile equal probabl move direct central variant diamond shape tile evid move posit altern shape grown scalabl effici approach poor phenotyp grid averag fit fig evolv construct tile duplic path shown examin fig clear tile construct repeat pattern movement adl improv perform enhanc gp system overcom detriment genotyp size larger phenotyp grid unknown ga implicit show amount output experi fig initi random tile investig clear lack output combin number iter posit seed seed easier evolv grow rectangular tile shape seed move number iter shape central diamond evolv fig initi random tile grown implicit implicit displai remark effici evolv perfect solut ten gener tile genotyp size number number rule grow perfect tile size action rule rule rule rule fig evolv growth tile rule note extens updat rule amplifi growth rule grow tile implicit natur main benefit rule fire factor neighbour locat cell grid rule appli iter parallel mean implicit advanc capabl manual ad paper genet algorithm natur emerg implicit rule natur emerg structur task find function correct shape made substanti easier fig show small set rule grow tile iter note updat rule promot growth iter biologist long advoc benefit natur paper explor potenti benefit incorpor growth process evolutionari identifi research main type implicit perform comparison system work demonstr provid benefit evolutionari comput extern permit easiest todai success form adapt handl constraint explicit success evolv complex solut experi provid winner tessel tile design implicit provid good perform compar approach perform genotyp size problem scale permit evolut perfect solut tenth gener rest work work progress examin result achiev design problem abil implicit evolv complex shape investig ea evolv posit seed number thought implicit show greatli output acknowledg member nuclear comment discuss work refer voxel base evolutionari shape special issu evolutionari journal evolutionari design comput academ press london aspect evolutionari design comput advanc soft comput engin design london gener evolutionari design rk soft comput engin design manufactur springer part hierarch crossov genet algorithm workshop soft comput nagoya japan genet program explor design world jung kluwer academ munich de artifici brain gener comput springer verlag evolv design gener complex gene structur evolutionari design comput academ press london chao order oxford uk john bennett forrest martin genet program iii san morgan kaufmann make genet anim design blackwel scienc uk evolv fuzzi rule pattern classif intern confer comput intellig control autom revisit edg evolv cellular automata perform comput complex view hardwar system ieee transact evolutionari vol februari egg cambridg press configur design special issu evolutionari journal evolutionari art comput academ press method evolv legal phenotyp int conf parallel problem solv natur sept pp
DB/1007 3 intern confer expert system applic septemb vol pp deduct cad mengchi liu school comput carleton canada abstract design involv comput stage engin design larg volum data complex structur store manag cientli properli graphic object complex structur creat creat object data object refer object deduct comput complet data graphic object object idea develop system cad system built top relationlog deduct system facilit creation graphic object creat object system illustr cad system deduct store manag data perform comput perform applic program introduct design assist modi analysi optim engin design design process iter process involv step cad number compon stage design process compon cad system includ graphic packag geometri manag maintain data structur geometr numer method librari perform numer interfac connect user system data manag store maintain larg amount cad data cad data uniqu characterist make manag cult design cad object complex structur involv larg volum data cad design object aspect data store updat design complex turn consist lower level compon lower level compon higher level compon chang automat invalid di erent aspect data store dealt properli integr environ access di erent cad util cost maintain access object minimum advanc system provid gener program access manipul larg amount data store complex structur provid independ program access data import system store cad data ecient manner manag easi retriev number system system deduct system deduct system question suitabl store cad data base persist deduct system ideal support cad provid direct support ectiv storag ecient access larg amount data complex structur perform infer comput idea develop system cad system built top persist deduct system facilit creation graphic object creat object system illustr cad system advanc techniqu store manag data perform infer comput perform applic program paper organ section discuss design implement section illustr relationlog section show exampl section base current work suggest futur research design implement cad system built top relationlog deduct system facilit draw comput base input store graphic data relationlog read data store relationlog displai continu interact relationlog system base idea creation block facilit creation block draw primit group facilit creation block creat block block data store relationlog creat block enabl continu cyclic process persist queri illustr idea design part work special design implement aspect involv design develop graphic relationlog aspect relationlog system modi ed facilit interact relationlog design special store deduc data program environ develop tcl command graphic tcl program script bunch command batch le shell script tcl interpret languag interpret execut tcl script standard interpret call interpret set tcl function interpret tcl command tk extens tcl extra tcl command relat creat graphic interfac main tk provid tcl command creat manipul widget widget singl compon interfac text check button widget screen show tcl script execut widget perform di erent role depend type widget entri box canva widget entri box widget user input text inform canva widget draw primit drawn primit rectangl drawn canva base action tcl tcl interpret program facilit call tcl command program graphic interfac written call program method call relationlog interfac design window storag window draw primit drawn block creat design window window canva widget draw activ place number button perform di erent function storag window canva widget displai creat block block window block creat design window rel upper left corner canva widget block creat move storag window design user empti design window block creat block select storag window storag window act repositori creat block interact relationlog data input store relationlog geometr data block data geometr data coordin color data draw primit block data includ refer di erent draw primit form refer locat block refer draw primit uniqu identi er draw form block refer uniqu draw tag assign block storag window insert delet geometr block data relationlog relationlog program modi ed deduc complet data block insert deduct data result queri data result queri made access relationlog relationlog store data input design make block schema type de relat de nition rule de nition type de nition relationlog support number primit type support user de ned complex type list construct tupl rst type point coordin entiti type start point end point color relat de nition relat relat store data input intent relat store data infer rule relat store complet data block geometr data draw primit form block store separ primit data store part block draw primit data insert drawn avoid make depend main memori comput draw primit entiti referenc block relat retriev draw primit data involv simpl rule join block relat di erent draw primit relat store line id coordin locat start point end point line color store coordin locat upper left corner lower corner rectangl describ color store rectangl lled coordin locat upper left corner lower corner color store polygon number lled coordin locat set vertic form color store polylin number coordin locat seri point form polylin color store curv number coordin locat seri point form path color store text coordin locat text matter color store block set refer locat refer di erent draw primit form refer draw primit uniqu identi er draw form block refer uniqu draw tag assign block storag window schema line rectangl polygon polylin curv text block int refer block element refer line element refer element refer rectangl element refer polygon element refer polylin element refer polylin element refer text kind relat relat block id base point relat store result rule identifi composit comput schema shown kind store complet data block instanc block line relat store data line entiti form block schema shown block line relat store data line entiti referenc block line entiti referenc comput rel rule data draw entiti store similar relat rule de nition part deduc complet data partial data store deduct complet data block step process step rule step discuss direct data direct data block data draw entiti referenc block direct data obtain join block relat di erent draw entiti relat obtain data draw referenc part block complet data rule shown perform join block line relat deduc data referenc part block data block line relat store data line block block line block line rule state refer line lid block data repres variabl data made part block line relat tupl block line relat block line lid line data line entiti similar rule exist schema deduc data draw entiti form block rule identifi identi er hierarchi comput base point relat store data block block block block block block rst rule state block bid refer locat relat fact state block bid rule state block bid subblock refer block block bid due transit block relationship base point calcul ad locat repres data data draw entiti referenc repres deduc data rel base point rule join block block relat di erent draw entiti relat rule shown deduc data line form part complet data block block line block block line rule state block bid refer line data repres tupl ad variabl color comput data form comput part block similar rule deduc data draw entiti block sampl block show sampl block problem block illustr idea block block creat cap bear bear shaft creat nut shaft evolv evolv block ad extern detail evolv block ad di erent extern detail figur show window di erent block problem experi show block start basic compon nut bear end tupl block relat shaft entiti shown fig sampl block creat block id block nut bear bear cap screw shaft tabl block id sampl block shaft entiti refer di erent draw entiti form attribut store set tupl tupl set store int refer locat shaft entiti refer bear bear locat store extract show integ refer tabl show block correspond refer store relationlog partial data shown extract shaft entiti refer draw entiti form relationlog system deduc complet data block rule shown motiv design develop demonstr di erent approach develop cad advanc system plai major applic function cad system show deduct system store cad data infer comput mechan cad applic sampl creat show block creat block block repres reduc storag space amount work requir creat part block exist block current import system capabl deduc transit closur relationship block problem block identi ed achiev relationlog rule relationlog system support arithmet function comput complet data block design relationlog store block data input show data store redund block refer relationlog infer data subblock part problem redund data occur data duplic relationlog design updat block delet data infer delet updat data data duplic delet block copi delet current implement edg cad system user perform oper graphic scale rotat scale oper scale block number de ned user rotat oper rotat block rotat de ned user oper perform time block insert user input valu scale factor direct rotat angl block insert depend input cad applic program perform base data displai transform version block scale rotat oper involv complic comput base fundament geometr concept scale rotat oper comput applic perform relationlog rule rule repres comput involv scale rotat highli complic actual geometr mathemat step involv oper incorpor incorpor consid futur refer mp jr ew design manufactur stefan deduct object base meta data manag journal intellig inform kim introduct mit objectstor system commun liu relationlog system softwar practic liu guo real deduct languag intern confer conceptu model page nov lnc ullman survei deduct system journal logic seshadri coral deduct system vldb data model electron applic intern workshop concept page overview commerci manag sigmod stonebrak great wave morgan dl editor design addison complex composit object intern confer data page lo ieee comput societi yang enhanc data model system confer design page
IR/1008 5 paper intern journal cooper inform system world june minim cooper fail queri park godfrei armi research laboratori usa depart comput scienc maryland colleg park colleg usa abstract queri cooper identifi report empti answer set se queri worthwhil report part queri fail identifi minim fail subqueri queri mf identifi maxim subqueri user recast queri lead answer set system provid function type cooper algorithm approach find fail queri obviou search space subqueri larg work algorithm complex identif problem remain paper show complex profil mf identif shown exist simpl algorithm find mf subsequ length queri find hard shown find find fix remain polynomi optim algorithm develop present algorithm ideal perform find answer decai intract predict manner answer found complex result algorithm approach paper construct cooper facil identifi system result relev number problem find applic algorithm cooper queri queri process work support air forc offic scientif research grant nation scienc foundat grant author depart comput maryland colleg park june minim cooper content introduct background minim fail subqueri abstract find mel find mel find mel faster algorithm find mel gener search prevent queri domain complex domain issu address complex minim hard hard algorithm criteria algorithm factor lattic complex factor lattic algorithm factor minim number call test heurist issu convert probabl find mel futur work june minim cooper introduct queri fail evalu produc empti answer set empti answer set uninform user presum user expect answer queri queri user system cooper trace reason queri pinpoint failur type queri consid paper conjunct queri formula queri atom call subqueri iff fs ae kg subqueri queri fail stronger statement report failur subqueri report failur queri report minim fail subqueri refer page list abbrevi write queri paper datalog repres queri predic calculu syntax augment standard datalog natur attribut analog attribut relat work directli relev queri relat manag system section queri repres datalog sql queri ward ward infect queri patient matern ward infect answer subqueri infect fail inform coupl knowledg minim fail state implicitli patient infect db written datalog variabl queri formula tupl templat answer queri fail db queri queri logic presupposit system respond fail queri maxim subqueri queri system respond queri subqueri case user attempt confirm queri major case limit focu conjunct queri limit result disjunct queri consid union result disjunct consid independ queri fail subqueri minim iff subqueri fail note minim shorter subqueri fail maxim distinguish minim june minim cooper infect succe patient matern ward queri semant queri ward ward infect patient integr constraint ensur patient assign matern ward femal queri rule chang assum answer queri lead contradict queri necessarili misconcept queri misconcept stronger statement queri fail misconcept explan queri fail base contradict proof queri misconcept db strictli stronger logic definit queri presupposit identifi minim subqueri lead minim conflict subqueri mc queri ward ward patient worthwhil extend system facil find minim maxim minim conflict subqueri cooper featur make system easier cooper behavior fail queri requir search minim subqueri search minim focu paper research find minim fail subqueri work formal address complex find queri implicit assumpt cost exponenti time worst case find mf work devot heurist mean reduc search time find hope search render problem tractabl practic commerci system todai offer cooper featur academ system prototyp previou algorithm find queri shown averag measur avoid appar intract reason capabl remain mainstream inform system todai complex profil search problem paper address inher complex mc facil relat deduct system paper offer good bad possibl facil mf facil tractabl easi find mf queri facil intract worst find queri facil find queri warrant discuss find averag case achiev practic issu address report find mf queri shown cost subsequ queri number conjunct origin queri find number subsequ queri terminolog fact user queri necessarili user misconcept semant user thought queri result answer june minim cooper shown find queri size section review previou work mf work accomplish section defin abstract minim problem abstract involv find minim element respect test monoton respect subset set test superset test finit boolean lattic call minim element lattic respect test mel complex analysi algorithm find mel present section show previou approach type queri todai defin issu address rest paper section extend problem mel complex problem shown complex gener algorithm develop section techniqu evalu potenti improv perform section consid theoret issu mel problem issu remain futur work probabl distribut find mel shown mel algorithm offer probabilist attack section relat problem applic benefit algorithm mel mc present paper conclud remark made background student pass fall semest return answer leav student possibl hard semest student fail fall semest return answer student suspici taught fall semest answer kaplan call behavior initi question person answer immedi repli taught answer question answer mislead prior interest behavior avoid domain natur languag dialog claim statement truth presupposit true presupposit statement statement entail origin question king franc statement answer presupposit king franc steel consid issu relat inform system state truth logic condit true answer rigid condit queri consid presupposit grice number maxim adher order consid cooper state answer queri relev june minim cooper student car student figur quantifi tree made answer queri correctli answer mislead commonli queri presupposit address problem presupposit work translat natur languag queri logic formal emploi logic sentenc mark undefin presupposit occur translat natur languag sentenc call branch quantifi tree figur show statement student develop mean identifi presupposit user kaplan note relev presupposit subqueri conjunct relat queri consid presupposit steel view subqueri fail evalu queri necessarili fail domain kaplan equat presupposit problem find minim fail subqueri note problem independ natur issu formal queri languag queri answer system kaplan built system call cooper queri coupl natur languag queri system manag seed cooper simpl natur languag request relev data system test real nation center research user programm relat lee develop system detect present presupposit queri queri languag emploi call interact queri note independ mf problem natur languag studi comput feasibl report smallest subqueri fail consid conjunct queri set atom subqueri element power set subqueri conjunct queri disregard queri empti queri queri page subqueri naiv approach test incur exponenti cost length queri problem queri problem queri longer section size introduc algorithm find minim fail subqueri recogn inher intract connect queri exploit reduc number subqueri lattic consid figur show lattic queri introduct twelv subqueri absent disjoint june minim cooper ward infect ward infect ward infect infect ward infect infect infect ward infect figur lattic subqueri evalu section integr constraint reduc number subqueri evalu kaplan algorithm similar oper queri translat queri languag emploi comput issu involv point algorithm find presupposit independ domain specif knowledg techniqu applic domain kaplan introduc notion gener fail queri queri queri fail due fail fail part result queri answer serv tool correct error user give user inform relat queri al consid find conjunct boolean queri librari search system report number match found subqueri displai result graphic subqueri match intend user subqueri pursu motro extend notion presupposit subqueri defin consid gener queri logic presupposit queri queri gener obtain relax condit queri subqueri extrem condit complet remov part queri salari greater equal forti thousand dollar condit relax salari greater equal thousand necessit function predic relax suppli step size relax step decid instanc salari relax thousand dollar increment eventu liter relax true remov method combin notion relax queri gener queri search presupposit find minim fail system return maxim disjoint queri union connect subqueri power identifi maxim exampl introduct june minim cooper figur extend lattic subqueri gener fail queri potenti inform report motro method extend lattic presupposit compar subqueri lattic queri figur show start gener lattic condit relax paper find search consid briefli section argu cost find minim fail subqueri remain offset benefit cooper offer inform part queri user wast time question necessarili continu inform origin desir reduct cumul cost user spuriou queri kaplan exampl prevent user system effect number peopl concern detect misconcept queri mai explor emploi schema inform relat order correct world knowledg correct object relat misconcept user properti object class state consid integr constraint elimin subqueri provid explan queri failur realiz queri failur assur integr constraint exhaust failur motiv work cooper answer gal minker cooper answer system develop gal identifi integr constraint user base gal recogn provid address identifi minim subqueri misconcept survei background design implement cooper system gener lattic queri necessarili subqueri lattic june minim cooper tabl search strategi find mel detect explan kei compon address minim fail subqueri find mf queri potenti intract work literatur state case differ show case descent algorithm find mf queri subsequ queri present subsect find queri hard requir exponenti time worst case true due simpl fact exponenti number requir exponenti time report assum subqueri size queri liter exist subqueri natur question cost mf cost find exist possibl complex algorithm time requir find subsequ answer bound fix polynomi requir fix polynomi time respect find subsequ mf case offer decent behavior requir fix polynomi time respect number answer found point number answer time find answer respect time answer grow predict find find intract import determin constant relat size queri abstract present abstract mf problem finit boolean algebra form set fe respect powerset lattic consist top element bottom test unari relat monoton respect superset sake assum evalu unit cost call minim element lattic respect test mel mel iff ae assum loss gener definit asymptot upper bound asymptot lower bound asymptot tight bound emploi present june minim cooper mf problem easili map mel problem case queri system queri test return true queri answer test return monoton find exist answer trivial exist answer find minim simpl counterintuit initi divid mf problem test search space result strategi rare effici approach algorithm abstract shed light inher complex problem effici algorithm approach find mel find mel set monoton test requir search complet boolean lattic respect subset search space larg search direct breadth lattic search fare depth fix search fare tabl show search strategi fare find mel order exponenti simpli exponenti number mel number subset length search order exponenti time search assum mel smaller search assum mel larger subset length explor mel found result obtain search mel step lattic clear search proce intellig fashion test decid edg lattic graph search proce test advantag procedur algorithm find mel set respect test proce set initi fail proce element remov result subset test subset element chosen test possibl pass test subset mel subset algorithm proce mel subset mel defin test fail mel call set set singl fag select rule statement element set written set figur demonstr mel search solid line show edg lattic mel true underlin set respect search proce box set mel call theorem run time mel length set conveni case queri evalu empti true respect test case check queri queri evalu answer respect queri evalu definit june minim cooper boolean mel var test mel true return true return mel true var set top minim true minim set el set set set test mel true minim minim mel top algorithm algorithm find mel step fg fcg fbg fdg fag cg bg dg dg dg cg dg cg dg dg dg figur routin mel run dg find mel fag june minim cooper invoc test cost unit time run time mel bound step proof algorithm mel complet step determin subset mel worst subset test assum worst test descent mel step size input set reduc number test perform worst test perform algorithm mel run time fe ng fe loss select rule mel statement select element set set order invoc mel true remov remain subset set fe fe fe ng test fail final fe test succe constitut test mel true call call mel true perform test invoc stage mel true call call perform test verifi mel initi call mel execut test call mel true result call test run time mel algorithm mel run time descent method emploi mel observ al show algorithm abduct close relat mel problem show find answer find mel search strategi find mel set respect monoton good search strategi find number mel effici algorithm mel modifi simpl manner find principl algorithm mel show algorithm rework loop mel replac foreach loop mel path mel explor turn global variabl store mel arrai arrai type mel ad free slot integ point arrai posit mel fill mel found algorithm suggest mf search literatur essenti isomorph mel present algorithm algorithm work algorithm continu found procedur control mel motro present algorithm search extend lattic queri find maxim fail gener queri trivial case relax oper return true assum arrai mel dynam alloc fix length june minim cooper arrai mel integ boolean mel test mel true return true return mel true minim true foreach el set test mel true minim minim mel set algorithm naiv algorithm find mel search lattic space maxim fail gener algorithm reduc mel proce control mel find mel motro state algorithm find mf algorithm perform perform mel break immedi time find mel exponenti fe test yield mel respect fe fe algorithm mel find throw stage stage algorithm call find mel fe throw fe yield subset test true foreach statement invok mel redund exist invoc invoc mel fe arriv number time mel call fe spend step find mel fe find mel fe mel insert mel fe arrai exponenti number time consid easili correct check ad assur set ad chang time complex algorithm june minim cooper boolean mel fast test mel true return true return mel true set mel core el set test mel true mel true core algorithm algorithm find mel step algorithm find subsequ mel subsequ subsequ mel criterion algorithm modifi report mel time mel exponenti worst case possibl find mel find intract paradox order present fe mel fe found found quickli mel symmetr section shown find mel problem find mel shown call test algorithm mel faster algorithm find mel improv algorithm mel made find singl mel search mel shown step algorithm mel run step mel call test element input set result element thrown result element member mel construct observ make improv lemma mel proof assum mel subset monoton respect subset mel contradict theorem algorithm mel fast run time size invoc test cost unit time proof algorithm mel call test element input set element thrown show final answer ad core mel fast complet call test june minim cooper gener search establish abil minim fail subqueri queri exist techniqu inadequ prevent primari motiv state adapt facil prevent preval problem note kaplan section good cooper mean prevent user queri fail identifi queri user user determin cast queri ensur queri subsum fail section good algorithm present find singl mf queri identifi singl mf user allevi queri probabl queri subsum mf facil allevi ideal identifi queri good number effect section problem domain benefit number mention search lattic space subqueri straightforward section motro algorithm intract find queri runtim algorithm factori length queri discuss meant queri algorithm task evid literatur reason algorithm bad time complex visit node search space lattic repetit seemingli easi fix solut repetit trivial kei contribut paper algorithm avoid search redund develop kei contribut establish theoret comput complex queri domain seek good solut mf worthwhil subqueri search space suffici larg easili identifi queri brute forc simpli evalu subqueri queri consist subqueri unreason intellig search behalf save effort queri bit brute forc approach intellig search easili warrant variat queri section patient id ag ward ward infect infect type vector rate high queri patient respect matern year infect highli transmitt air presum rang set ordin valu convent valu variabl return answer valu variabl june minim cooper high order datalog queri consist search space subqueri definit syntax depend syntact queri queri repres result collect subqueri advoc canon form datalog queri maxim collect subqueri finer granular inform convei result constant queri high queri equal atom predic select relat algebra trivial rewrit datalog queri obei constant atom tabl replac equal variabl constant ad queri rewritten patient id ag ward ward infect infect type vector rate air canon form datalog queri call variabl substitut assum presupposit queri variabl substitut form queri length number tabl involv number select queri assum relat queri written sql select high easier subqueri datalog atom simpli elimin produc subqueri syntact direct produc subqueri sql clear effect queri ten subqueri search space size queri unusu todai user user commonli queri join join common select typic queri typic user longer queri fail find subqueri evalu evalu thousand queri system prohibit time consum benefici found fewer subqueri note normal fragment queri normal tend requir longer join chain accomplish goal queri note queri variabl substitut ad variabl join variabl variabl requisit atom share variabl worthwhil atom share join variabl atom join case queri june minim cooper sophist user expert sql programm complex nowadai modern rdbmss handl complex queri effici complex domain number tool result complex queri underli rdbm includ ffl higher level queri interfac autom queri formul natur languag interfac graphic queri languag ffl mediat heterogen collect ffl queri languag ffl analysi tool sophist applic support datamin tool engin tool higher level queri languag translat incom queri sql queri process underli rdbm work autom queri formul sought provid user simpler queri languag sql relat free user schema queri user queri underli schema complex user spend time learn abstract queri translat sql queri respect schema note translat result complex queri input queri simpl queri queri found effect long note natur languag queri system graphic queri simpl natur languag queri translat surprisingli complex queri search logic queri current work mediat collect heterogen feder system goal provid singl logic user unifi collect dispar underneath queri mediat queri languag schema translat collect queri underli translat result complex queri simpl input queri approach queri languag build top relat postgr queri ultim materi queri simpl queri involv path express result complex sql express applic tool support compani learn exploit valuabl applic gener necess complex queri check data data mine tool gener queri automat search gener pattern potenti rule data relat applic tool expert reconstruct semant legaci citat meant complet provid pointer literatur june minim cooper sophist applic interfac place greater burden rdbmss requir cooper technolog user understand result complex queri result applic consist twenti thirti condit correspond subqueri search space order order type queri gener complex gener applic gener applic emploi mf facil track failur point yield explan user result search larg space ineffici search brute pragmat imposs issu address abstract mel develop section extend approach section find mel algorithm mel kei specif question address remaind ffl subqueri lattic search clever avoid cost explor section ffl inher difficult test set size find mel set respect test section find inher previou algorithm discuss section demonstr mel mean priori found ffl problem inher hard mel abstract clever find queri respect sequenc subqueri outlin section clever shown complex section section section formal complex problem present algorithm approach good properti find complex complex find mel establish complex mel consid shown find jsj mel find fix polynomi time minim present version mel order algorithm complex june minim cooper definit defin mel pair set ture repres ffl defin domain ffl halt return input ffl run polynomi time fix input ffl return input ae return input close case ture machin decid set notat write machin return input pair ai repres element ai mel iff ae mel polynomi time evalu polynomi subset test evalu polynomi total definit defin exist exist iff hx ci call certifi exist interest class exist exist np mel exist demonstr algorithm mel theorem expand notion exist interest difficult identifi number certif exist definit defin iff exist distinct certif hx problem version exist problem mel problem shown linear function section shown constant function stronger result result exist hard show problem mel hard proof encod cnf proposit theori mel problem determin arbitrari cnf proposit theori problem term defin definit proposit theori cnf form form form lm repres proposit variabl negat thereof june minim cooper cnf theori repres collect set set repres disjunct liter set collect set consid repres conjunct call proposit theori proposit variabl negat posit theori definit disjoint pair set proposit variabl ht truth tabl denot truth assign true undefin defin proposit theori denot truth tabl satisfi ts shorthand fp png repres set proposit variabl call subset model iff tm model shorthand cnf proposit sat iff exist truth assign satisfi exist test mel problem close model cnf theori close fact tm model impli tn model oe posit cnf properti upward closur hold inher reason np exist definit defin transform cnf proposit theori posit cnf proposit theori pn proposit variabl theori introduc proposit variabl neg occurr replac posit occurr call result posit theori lemma posit proposit theori ta ae tb fm cg close proof assum ta ae exist atom assur truth atom tb argument theorem function linear exist polynomi restrict domain pair jt proof tupl jsj loss show np certif ai mel polynomi verifi check feg check polynomi time total check polynomi reduct sat present proposit variabl call atom text june minim cooper cnf proposit theori fp png set proposit loss size restrict constant factor loss fp fp assum constitut truth assign subproblem sat tupl ii construct respect fp posit proposit theori ture machin decid set fa ta ta ta cn combin test construct fix polynomi size respect size input problem sat size fix polynomi size respect size transform preserv size input assum ture machin decid smaller loss gener individu test ta monoton lemma union monoton show sat answer pass model answer model cn set fp ta note minim truth assign construct satisfi fp ag fp ag truth assign ta defin ta direct sat similar manner theorem independ address mf problem note similar theorem class abduct problem present al proof theorem similar manner reason restrict domain mel theorem pair jt show mel problem intract respect size input set respect size input set natur gener case restrict hard easi mf problem map mel problem discuss top element lattic queri queri consist lattic complet boolean lattic test evalu queri call test base edb queri edb iff evalu empti set db june minim cooper edb monoton respect subset subqueri evalu empti queri algorithm mel fast demonstr mf found queri shown find queri hard mel imagin smarter algorithm find intellig exploit shown show suffici hard exist proof theorem modifi show encod relat tabl definit set mf defin mf edb mi mel respect theorem function linear proof proof construct manner proof differ edb construct cnf proposit theori fp png set proposit variabl loss fp fp assum edb atom defin binari relat call relat db construct defin tupl relat ffl assum fc ffl relat fp png construct tabl fc atom relat insert tupl tabl consid ffl relat construct tabl fc atom relat insert tupl tabl ffl entri tabl queri qbe pn yn yn length liter note empti join tabl construct subqueri length singl atom truth assign satisfi form fp fp assign subqueri form mf show edb sat edb answer pass model call mf june minim cooper subset atom satisfi liter miss liter atom satisfi liter assign atom true constitut model impli model direct sat edb similar manner knew minim fail subqueri simpl procedur determin maxim subqueri queri subqueri mf definit reason assum subqueri maxim direct procedur determin ascertain easili vice versa reduc mel solv queri queri found construct test fs db test monoton respect reason test edb monoton mel found set test respect queri qs mel search find proven search difficult search mel case show suffici hard search definit set mss defin mss mi mel respect theorem function linear proof proof construct manner proof differ construct cnf proposit theori fp png set proposit variabl loss fp fp assum fp proposit variabl db construct defin tupl relat ffl assum fc ffl fc fp add ii tabl ffl construct view fc fs set shown section june minim cooper tabl add ffl entri tabl queri length liter show sat answer tupl form hx form fp subqueri answer tupl ii answer set construct call queri subqueri fp subqueri maxim answer tupl form hx tupl answer set check answer tupl assign true satisfi construct note construct exist model model found directli translat model direct sat similar manner linear queri necessarili queri lead necessarili failur special design predic call contradict assum answer tupl queri mc problem reduc abduct find smallest minim subset base set support definit set mc defin mc mi ae theori written atom monoton proof theori applic ground constant abduct problem explor classifi present proof reader june minim cooper theorem function linear proof proof construct manner proof cnf proposit theori fp png set proposit variabl loss fp fp assum fp proposit variabl theori construct base ffl assum fc ffl fc introduc proposit variabl add rule ffl add rule ffl ng add rule show hp sat form fp deriv mc set mean deriv rule form hc mc assign true result model satisfi model construct directli satisfi direct sat hp similar manner algorithm criteria algorithm section shown standard algorithm mel algorithm highli intract mel section shown find mel intract middl ground algorithm mel find subsequ mel quickli ffl run halt quickli priori mel ffl stop earli partial result mel exploit mel problem optim respect test test shown find mel shown find mel find mel bound section algorithm run bound mel sequenti problem find mel set respect test mel subset pass june minim cooper test mel set time find mel subset diminish complex factor smaller input set test case test evalu queri number call test minim factor lattic problem search strategi mel mel encount repeatedli fact lattic search algorithm mel search lattic tree problem prune search space mel found mel collect mel set call lattic found mel mel mel construct set explor find rest danger mel construct call oper factor lattic definit defin incompar iff defin factor factor fa factor respect iff factor defin max factor max factor fa factor factor ae ag maxim factor respect iff max factor theorem collect mel mel mel set max factor proof incompar set mel factor respect definit maxim proof max factor oe maxim factor mel set max factor approach mel collect mel find set max factor jsj step find emploi mel fast factor simpl contradict result theorem factor di shown number factor order jdj find factor satisfi requir examin lattic repres top set june minim cooper exponenti number factor satisfi intract shown respect jdj intract respect number respect size lattic top set complex factor lattic definit defin class set set collect subset di iff factor abstract factor problem introduc previou section garei johnson catalog problem author knowledg proof provid theorem proof reduct sat show conp di iff factor size size arbitrari cnf proposit theori set fc repres set proposit variabl negat proposit transform ffl set proposit variabl ffl construct fa ffl kg separ posit occurr proposit variabl neg occurr fa fa fs show di sat fa definit note negat proposit variabl show direct sat di model set fa june minim cooper loss loss loss gener loss theorem weak impli factor problem mel mel subset subclass show subclass emploi result theorem proof definit defin class incompar set set collect subset subset di iff factor theorem proof reduct show conp di iff factor size size input transform jdj fe ffl kg fe note incompar fs kg jg show di fe set construct construct loss fe note note june minim cooper show direct di fe shown member incompar ffl ffl ffl loss ffl fe loss ii empti fe fe construct fe factor iff max factor theorem demonstr find list mel inher hard algorithm factor shift comput workload mel repeat search lattic divid lattic factor offer approach problem factor approach yield good perform number perform decai slowli complex factor depend size factor set set found mel factor routin call mel call factor singl mel size factor comput reason number mel accumul section approach repeat search lattic intract mel found algorithm factor find maxim factor set respect found store arrai mel mel maxim factor return pass test approach mel consid call factor top superset element top mel remov order set construct superset mel set pass top call satisfi rest mel invoc end mel remain set return factor factor factor return superset mel search strategi mel found search intract june minim cooper arrai mel integ boolean factor return factor boolean factor index inv top mel inv justifi return factor index choic mel top found choic found el choic choic choic reduc inv inv shift mel found factor index return found test factor top return true return algorithm factor lattic boolean reduc inv inv inv inv el return true inv inv el inv inv el return reduc inv inv el inv el el return true return algorithm reduc june minim cooper boolean justifi mel return factor mel return true return justifi mel mel mel algorithm check mel justifi factor set return subset mel accomplish list top minu current mel stage factor remov element remov element list factor set construct subset mel routin return routin reduc inv implement routin requir routin factor return maxim routin justifi shift routin ensur factor maxim prefer routin factor find maxim factor mel sought found maxim consid maxim factor return explor factor candid test factor test candid return pass list justif justif element remov top construct factor set justif list mel element remov element top result set superset mel justif element remov justifi remov element result valid maxim routin justifi check current mel element remov current mel current mel ad element factor call mel current mel justifi element top mel remov mel ad element justif mel element store previou justif remov justif ad remov process leav previou justif construct factor fail routin factor easi design rest mel program algorithm mel remain factor test continu gener mel algorithm find mel factor note pass top return factor june minim cooper boolean shift steal el return true return boolean steal el el el return true selector steal el el append el el el el selector set set el set selector set selector set algorithm shift justif arrai mel integ mel factor mel true mel mel algorithm mel june minim cooper algorithm mel satisfi desir criteria outlin section find mel quickli mel limit find fix perform polynomi time lemma factor jlj jdj proof maxim factor respect incompar maxim factor mean jdj set set minu es miss maxim jaj jlj jdj limit number potenti maxim factor number subset size number jlj jlj jlj jdj theorem algorithm mel spend jsj time find assum call test cost unit time proof time mel true jsj step spent find mel time spent call factor loop depend strictli mel worst factor maxim factor search test true cost bound number maxim factor lemma show jsj maxim factor mel found worst test find mel algorithm satisfi remain criteria outlin section algorithm mel suboptim respect call factor origin mel found call add mel mel arrai call factor tend intract subsequ call larger input set redund comput perform repeat call factor find subsequ factor backtrack factor continu explor search space reconstruct local search space time algorithm factor core set mel true search space explor repeatedli redund call test made final algorithm present mel elimin call search minim element procedur factor rewrit procedur factor core set ad restrict ad factor return superset core procedur top level procedur initi check input set pass test mel find procedur true similar mel true emploi core set find mel step invok similar mel proce find mel input set set set top accomplish call factor june minim cooper factor factor factor index inv mel inv justifi factor index foreach el mel top reduc inv inv shift mel factor index cach test true algorithm factor lattic arrai mel failur integ test true true top mel core el top cach test current true mel core factor core true core algorithm mel june minim cooper set respect mel found procedur true factor interleav initi call factor iter call true find mel factor search space factor repeatedli call true proce invoc true find mel set core routin top remov result subset test mel set includ el element ad core remov true call work mel true algorithm procedur true split search space lattic set base ffl subset set ffl subset set el true call find mel set factor element el ad core assur invoc factor find mel set el el el found invoc factor mel found invoc true factor mel incompar consid notic factor call core found mel previou call true factor core futil algorithm satisfi criteria outlin section mel quickli properli exploit minim number call made test section explain meant minim call proof minim number call test search mel test procedur call repeatedli determin current set verifi set minim check subset fail execut test procedur benefici limit number call test procedur redund call test properti set test superset subset test test call set search recal algorithm mel call test repeatedli set properti relev test monoton respect subset algorithm exhibit properti inher exhibit inher call cach test explain june minim cooper boolean cach test fail fail set failur fail true fail return test return true add failur return add failur index offset set oe failur offset offset offset failur failur index index offset failur set algorithm test cach june minim cooper lemma set test execut superset test proof ai call true top made immedi time test activ true superset subset potenti test factor true invok mel record call factor test factor call true call return previou activ true call factor proce call factor make true incompar mel mel record test superset activ true invok test return activ factor call make true incompar mel mel record test superset note algorithm call cach test test routin cach test actual test call set subset accomplish cach failur routin cach test show implement effici routin hash element failur cach cach check check cach execut test time point highli intract due factor lattic mel question stop cach issu heurist offer good search strategi search strategi consid good heurist direct prune search lead improv averag case work past focuss heurist heurist light complex result mel present respect search strategi heurist mf consid point potenti subqueri consid search definit atom queri join iff share variabl common atom queri connect iff exist atom queri atom atom connect relat connect transit closur queri connect iff atom queri connect disjoint defin connect effect june minim cooper reason insist queri connect user disconnect part separ search fail connect subqueri subqueri ward queri introduct queri connect fail ward fail independ algorithm modifi test disjoint break connect subqueri test singl variabl liter queri share subqueri connect queri chain adjac liter share uniqu liter share variabl queri disjoint subqueri repres contigu subsequ connect great major subqueri disjoint probabl subqueri disjoint assum number subqueri queri disjoint handl disjoint queri speed search averag case motro suggest subqueri queri evalu answer set store tabl subqueri part queri subqueri recomput time materi initi comput shown optim respect test wai test queri queri test true empti answer queri test subqueri test section subqueri queri test true test answer candid materi clear good materi heurist fail subqueri materi repeatedli compon queri criteria decid idea warrant motro suggest techniqu optim multipl queri exploit mf work multipl queri test note comput answer subqueri comput answer easier comput relat system facil exist queri facil greatli speed test natur halt time spent search mel time measur number step algorithm number test made optim result june minim cooper mel reason worthwhil estim bound mel found algorithm step limit algorithm number step mel found algorithm halt case light complex mel heurist judg detriment motro bound depth search maxim gener fail queri special limit size search render manag discuss section depth lattic problemat breadth bound heurist easili exclud answer algorithm find longer minim depth limit algorithm issu mel problem algorithm develop number interest issu address issu section set deriv set section probabl find mel section outlin issu futur studi convert algorithm queri algorithm run test find queri section shown problem equal time complex queri queri deriv run queri invok test set deduc set mel stand minim element lattic true respect stand maxim element lattic respect test gener mel gener mf theorem collect mel collect collect subset fb ag max factor fa max factor ae bg proof max factor fa max factor ae bg depth limit search space effect hard search origin depth limit elimin high probabl case subqueri respect test mean answer queri june minim cooper max factor assum mel subset mel mel mel incompar set contradict aha superset superset mel maxim factor respect superset fa max factor ae subset mel minim superset ai superset mel superset max factor max factor fa max factor ae bg ae mel subset ffl ae assum max factor ae max factor argument mean contradict assumpt assum ae subset mel mean contradict assumpt fs max factor ae bg ffl equal mel mel subset incompar set feg mean feg superset mel max factor theorem deduc set set set set li proof theorem union maxim factor respect subset set maxim factor polynomi determin problem construct set max factor reduc deduc theorem show construct max factor construct theorem direct correl number mel set number theorem hold determin mel prefer approach collect mel run algorithm factor modifi find factor call test remov call test determin probabl find mel mel problem offer probabilist attack shown linear number mel find mel polynomi algorithm mel demonstr algorithm find mel set polynomi june minim cooper fg fcg fbg fag cg bg cg cg figur probabl find answer time note algorithm mel step remain element set elimin sequenc choic lead mel chanc mel mel return mel equal mel return mel offer probabilist attack problem recal proof theorem sat problem encod mel problem mel repres model cnf theori input sat assum mel equal find mel run number time search mel model determin cnf theori requir mel run find mel model linear number time respect confid mel equal found actual mel offer probabilist attack worthwhil mel find fag cg figur show lattic mel box tempt count number path mel top lattic path fag remov path remov path mel path equal count path suffici path consid equal lead probabl cg assum probabl mel element set elimin equal measur probabl mel return mel measur likelihood elimin result mel remain discoveri formal recurr relat probabl find mel determin set mel priori definit probabl mel return mel collect mel june minim cooper assum set repres venn diagram figur formula calcul probabl find cj element chosen mel probabl found term absent equat element exclud leav condit probabl found element elimin elimin condit probabl determin symmetr case gener recurr relat ps fag recurr relat hard gener requir set mel priori advanc solv specif case set fp ffl ng fp gg ffl ffl cnf theori convert posit cnf assum set proposit variabl fp png collect repres complet model repres collect repres contradict probabl run return set calcul recurr relat solv set size element elig chosen set necessarili set mel arriv set size set size equal set set algorithm return set eventu return probabl set return sterl ae limit jlj argument hold subset assum set assum mel show solv sat lead mel find mel smaller high probabl mean tend find mel smaller cardin find larger cardin tendenc good mel smaller cardin prefer small set condit larg set gener fact mel algorithm find smaller set benefici june minim cooper futur work worthwhil adapt algorithm present work extend lattic motro remov atom atom relax maxim gener fail queri found special case complex hard algorithm mel adapt extend lattic assum liter queri relax step number step find maxim gener queri modifi search extend lattic factor algorithm replac elimin issu address provid cooper techniqu relax oper relax atom queri provid step relax determin type inform inform manifest motro introduc gener architectur system decid relax atom taxonom inform repres inher rule deduct relax atom queri chu al extract emploi taxonom inform relat implement system heurist bound ensur extend lattic search finit figur lattic limit condit relax complex variat mel benefici interest explor condit mel qualifi problem stai complex bound desir condit push problem intract al issu abduct problem add condit answer mel minimum problem intract find condit ad make problem harder problem domain remain algorithm present identifi address factor routin set fail test found repetit factor routin evid modif made rid evid prefer modif effici point view variat algorithm lead number test call respect queri number minim respect search variant search space slightli lead significantli number call averag case hope gain insight variant establish version maintain benefici properti discuss effici minim call test empir algorithm design past search minim fail maxim subqueri ineffect highli intract larg due fact complex natur problem dynam algorithm june minim cooper paper present complex profil present algorithm approach build practic facil relat system find present facil enabl system give cooper user user queri make system easier grow size applic mean cooper identifi system organ valuabl data grow interest data mine data store examin gener data gener reflect hidden semant data larg queri fail evalu simpli data queri fail due semant distinct drawn section offer potenti data mine tool queri proof fail integr constraint queri repres miss integr constraint fail queri collect program administr fail queri promot integr constraint techniqu fail queri queri offer logic stronger integr constraint gener result mel applic number domain semant logic exist minim proof procedur deduct neg inform rule negat problem encount proof procedur stabl theori fernandez lobo answer proof procedur complex mel answer desir algorithm work domain abduct reason abduct reason task complex mel fair amount complex abduct reason algorithm domain algorithm abduct support interest minim fail subqueri origin interest presupposit natur languag dialog show identif problem presupposit independ natur languag problem find presupposit depend sole logic structur statement made presupposit problem address techniqu adapt natur languag system identifi presupposit occur natur languag dialog acknowledg number peopl contribut idea work jose alberto fernandez formal mel problem mf yuan liu lev contribut discuss search strategi carolina ruiz recurr relat determin probabl mel jack minker contribut support research discuss john william proof suggest led improv research support nation scienc foundat grant air forc offic scientif research grant arl support continu work area hope construct viabl mf facil work basi june minim cooper abbrevi cnf conjunct normal form definit incompar set satur page shown page iter search minim element lattic mc minim conflict subqueri mc definit page mel minim element lattic mel definit mel page mf minim fail subqueri mf definit page rdbm relat manag system sat boolean satisfi problem definit set satur page shown page maxim conflict subqueri maxim subqueri mss definit page maxim element lattic algorithm algorithm find mel step naiv algorithm find mel algorithm find mel step factor lattic reduc check mel justifi shift justif mel factor lattic mel test cach figur quantifi tree lattic subqueri extend lattic subqueri routin mel run dg find mel fag probabl find answer tabl search strategi find mel june minim cooper refer allen natur languag understand publish menlo steel logic question answer yale josephson comput complex abduct artifici minker foundat semant queri optim deduct proc workshop foundat deduct logic page aug chu chen structur approach cooper queri answer ieee transact knowledg data oct cooper system imielinski chapter page cole editor syntax semant academ natur logic gallair al page cooper boolean queri intern confer data page silver ieee comput societi press rivest introduct algorithm mit dahl editor natur languag understand logic program north editor nonstandard queri nonstandard answer studi logic comput clarendon fernandez lobo proof procedur stabl theori technic report maryland institut advanc comput studi depart comput maryland colleg knowledg discoveri overview frawlei chapter minker overview cooper answer journal intellig inform invit paper minker relax platform cooper answer journal intellig inform minker overview cooper answer imielinski chapter page cooper answer system logic program autom reason lectur note artifici intellig page st juli gal cooper deduct phd depart comput colleg june minim cooper gal minker natur languag interfac cooper answer confer artifici intellig decemb gal minker inform cooper answer integr constraint dahl page editor advanc volum plenum garei johnson comput guid theori npcomplet seri book mathemat scienc freeman architectur cooper system litwin intern confer applic lectur note comput scienc page springer june grant minker optim deduct convent relat data base system gallair al page grice logic cole morgan feasibl inform answer gallair al page editor element understand cambridg kaplan inappropri question joshi al page kaplan cooper portabl natur languag queri system artifici oct lee aspect interact intern confer larg data maier ullman maxim object semant relat acm transact shoshani abbrevi queri interpret extend orient approach design page mai correct misconcept structur correct misconcept proc stanford juli melton simon understand complet guid morgan san motro mechan verifi user presupposit queri system acm transact offic inform octob motro toler cooper user interfac ieee transact knowledg data june editor knowledg discoveri aaai press mit menlo qian semant intellig mediat intern workshop research issu data page apr june minim cooper queri process multipl heterogen knowledg server intern confer inform knowledg nov row stonebrak postgr data model confer larg lo sept morgan kaufman publish ucb june postgr paper publish read objectori edit morgan selli optim problem ieee transact knowledg data june system conceptu design knowledg queri formul fourth intern confer tool artifici page lo ieee comput societi press winkler integr reengin support data fusion journal system sheth larson feder system manag autonom acm comput sept rule discoveri queri optim frawlei chapter stonebrak row design postgr acm sigmod intern confer manag page introduct logic theori subrahmanian amalgam knowledg base acm transact ullman relat interfac system ifip world comput page ullman principl volum principl comput scienc seri comput scienc ullman principl volum technolog principl comput scienc seri comput scienc zhang mendelzon graphic queri languag intern confer page
Agents/1009 1 di di di guido dipartimento di informatica di torino torino abstract si il dei di dei di si intend una dei del di ed di di che una di la base il degli agenti che ad di part di di agent di con agenti del ha di render sistema dei con una del che le strategi person sistema di sistema capac di solo degli ma dei dell sistema se con del li con il di ha di di agent il del di che le con il sistema che utili le di di state applic dell strategi si di problemsolv di di da agent che piano le analisi di di tra le le di del che le di agent di che il di di di agent che produc la di essa di della ricerca la di di agent bdi sistema che ad di cui degli da murst dell di di al del quali agenti bdi intent agenti dai di che di ed di il di che di di di di litman allen di del che al di lambert ha la dei di di litman allen due di uniform di lambert usa il di le tra le input le di ma il da che le di di del il una di cui agenti ad una forma di di diversi cohen levesqu il di ji che solo le person quali il di dell sidner grosz la di form di il che agent con agent ad di dell di cui agent il partner ad del piano la di ad agenti il le degli agenti le la tra agenti di la di di di cui le person di al dei comput solo del se il pass il dei ed il del del la di del di dei di il ad il di di di di cui la di si di con la card di la di le lo del due ad si se ne una di due il ti di ps dell degli agenti di degli degli di agent cui wh wh wh wh wh int int const eff int int const eff wh wh act prec eff eff wh eff prec eff eff wh wh wh wh figur di di ps la di di di della base di di con da la part del ti di di dare il pass ad una ed il dell person che pass aver il di dei di con di dei di una se essa la dei di ps del tal si la al che di di ps che sta es chi di fare che le la se ha dell le di di la del di le ed di dell tre di una di ed una di la gh generali ad la dh la le le ed la una part della di ps le da diversi di archi di archi con le line da solo se le archi le sta la di il rang archi ed dell il di le la di di ps tre di cui di di agent che goal di agent ci due di il al che una il al che si che ed che le che tra che dell il di aver verif si una di che le se di solo il di dei se le solo se di ci tre al partner che stata con ad es se agent dice la ad aver con una la si di es di agent ad desiderata con di il agent il piano di ps stata es la la stata hai stata mi hai si fa se si ad agent di piano se con agent ad che il di agent che di agent di il una di che ha che il di il sistema input ne noi che il sistema che la del base dell di le di le usa la part del il di agent del di cm da carberri il di del che parti della dei di cm il ai di di le tre di di di il di il di background ed ai di ps man che il psm il di da cui le di il di dell di ps di psm che il ha di di di la di ps le di superior che il sta psm man che il del le di ps tra dei dei dm dei sam di psm del dm il la del goal il che goal cui ed con lo con agent cui con il eff il pass il lab dei eff prec wh il pass il lab dei prec figur del del sam il il di il goal del al prima di il sistema di con le al degli del se ci di se il ne ha analisi il pass il dei comput la che il pass da due di di il cm che la di sta il goal di di il opera di vista di che input le di di che ha una di il pass che il di il di la di ps ha di con che si della input di di al partner di dare pass ad request ha di una ne con che ha il goal che dia pass la di ad di di di le ed la con il se che tata di ps cui ha la il che aver il pass di piano una dell cui aver il pass la di stata di vista di lo da la di al cm che ha di la di che il di di una dell di che di la di che il sistema fa le di di una di di data la di che la di di la di mcroi traum del di la del gener dai vari della grand dei la tra di mcroi ed hirst che il di default di le da da di traum allen la tra agenti che ad che che se che agenti le dei noi che di di di del si che una del di problemsolv di sistema di se la di piano di noi una agent con di ps tra agenti di agent si piano di ps di ps del interlocutor le sue refer jf allen recogn intent natur languag utter bradi rc comput model page mit comput approach speech act recognit proc cognit scienc page recognit preliminari sentenc dialogu interpret lectur note artifici intellig topic artifici page springer dynam user model recognit plan user user model carberri plan recognit natur languag dialogu mit castelfranchi parisi il pr cohen hj levesqu confirm joint action proc page grosz krau collabor plan group activ page kautz formal theori plan recognit implement rj reason page morgan kaufmann lambert recogn complex model dialogu phd litman allen plan recognit model subdialogu cognit ke lochbaum knowledg precondit languag process proc page sw mcroi hirst repair speech act misunderstand abduct infer comput pollack plan complex mental attitud pr intent page mit la ramshaw model proc page rao mp georgeff abstract architectur ration agent nebel principl knowledg proc int conf page dr traum jf allen oblig dialogu process proc annual meet page la
IR/1010 5 facilit exchang explicit knowledg ontolog map martin technisch universitat munchen munchen germani georg universitat kaiserslautern kaiserslautern germani abstract give overview system facilit exchang relev document geograph peopl commun interest natur commun interest prevent creation enforc common organiz scheme commun member adher commun member organ document categor scheme exploit person essenti perspect user inform retriev relat document retriev concept granular level central commun document repositori find relat concept queri perform ontolog map ontolog map base consid concept ontolog implicitli repres document assign concept machin learn techniqu text concept person ontolog map concept commun ontolog system map provid document publish retriev servic commun user result prototyp system show approach valid altern exist techniqu inform retriev introduct coupl group peopl similar socal shown valuabl sourc knowledg broad platform commun interact support leverag synergi knowledg exchang expert world member commun interest dont work common task common goal relat defin task motiv particip commun member commun member forc adopt common standard inform exchang commun support exist tool team support cooper copyright american associ artifici intellig reserv work tool design special attent natur commun context increasingli larg collect document ontolog inform organ activ area research hafner benjamin agreement common definit work cite common denomin ontolog definit ontolog user inform retriev gauch al agent commun singh talk ontolog make applic context paper ontolog categor document content directori simpl ontolog finin ontolog concept serv document content class ontolog document repositori effici retriev store document structur ontolog context store document al user autom retriev commun websit collect document organ implicit explicit ontolog construct commun websit discuss al system work fairli problem discov order effect storag retriev categor scheme understood accept commun member commun member ideal perspect knowledg domain repres commun document repositori case real life commun commun member perspect commun repositori user interest inher render global perspect imposs shown central mandatori ontolog trust commun member lead particip distribut serv organ scheme user document user perspect world proper ontolog larg document desir support autom exchang document user perspect world paper show realiz ontolog map system ontolog map techniqu improv retriev relat classif inform document rest paper organ briefli describ system fit larger architectur support commun interest describ knowledg manag approach architectur design present servic system offer introduc algorithm ontolog base similar measur singl ontolog concept node technic realiz map singl concept node base text classif algorithm present section present evalu result contrast relat work paper end outlook futur system member commun interest organ document categor scheme exploit person essenti perspect user retriev publish relev document concept node person node commun ontolog identifi document assign node commun ontolog user vice versa approach map concept node ontolog base implicit ontolog concept node ontolog implicitli repres document assign concept machin learn techniqu text measur probabl concept calcul concept node person ontolog current prototyp system user bookmark folder hierarchi user side ontolog directori structur researchindex commun ontolog exchang explicit knowledg form map person ontolog folder commun ontolog structur system part larger architectur knowledg manag support commun interest briefli describ architectur design fit framework design knowledg manag perspect design collabor system commun lot issu technic problem consid main commun interest exchang knowledg manag perspect problem structur problem space commonli knowledg manag process model similar process model present process model identifi problem field commun support architectur offer support result gener framework knowledg manag support commun interest koch distinct process class identifi knowledg knowledg knowledg knowledg creation knowledg share knowledg applic knowledg conserv consid process class respect process commun support inform technolog detail characterist commun constraint design system result focu knowledg creation knowledg distribut process commun put result requir system knowledg creation support deliv person inform user inform deliv push proactiv push effect knowledg distribut greatli access retriev relev inform easi straightforward user mean inform index categor user understand accept goal achiev enforc standard commun knowledg commun organ due coupl member commun shown unsuccess practic case studi present mediat user ontolog commun ontolog build respect servic knowledg exchang top mediat infrastructur servic assum commun member organ collect explicit knowledg person categor scheme bookmark collect gener assum repositori user commun side store actual document link physic locat document offer servic document public retriev relat document servic configur push pull servic document public servic publish document user newli assign concept class commun concept class inform user classifi document repositori commun repositori commun repositori classifi document respect commun ontolog classif base document inform inform concept node user ontolog combin commun profit identif relev document commun member effort user effortless public inform crucial commun interest retriev relat document servic deliv newli ad document commun repositori user document retriev class document granular level document granular improv tradit retriev relat document exploit user side classif inform class granular user concept node ontolog find relat document user assign node person deliv user queri constant push user document repositori commun repositori balanc constant push servic document automat assign document concept node implement servic prototyp stage public time paper ontolog map order provid mention system map ontolog mean concept node ontolog graph concept node ontolog graph found calcul probabl measur node person node commun ontolog node node maximum probabl measur win perform map graph structur person ontolog expect map improv interconnect node person ontolog plan includ futur work graph structur commun ontolog account calcul probabl measur probabl node match differ node differ calcul probabl differ parent node differ threshold common parent node parent user node consid node probabl measur base map explain section find appli simpl concept node node calcul find maxim minim mark repeat parent node current node made calcul current node ii pick node iii parent node node common user decid node pick perform actual map estim probabl calcul section ontolog concept node map perform calcul probabl estim emploi machin learn techniqu text categor calcul repres featur vector concept node ontolog measur similar class vector simpl cosin measur repres featur vector concept node calcul modifi rocchio centroid vector repres vector concept node repres averag document assign concept node word class synonym concept node accord ir literatur al overview state art techniqu text categor comparison consid featur vector featur featur select final learn classif base design concept node map result present al classif featur vector document weight bow toolkit perform remov subsequ featur stem gener featur vector weight featur weight scheme document measur essenti aim assign weight import term al comparison classif techniqu present al show classif techniqu perform suffici lot applic circumst elabor classifi support vector machin perform term accuraci simpler techniqu chose rocchio classifi simpl cheap perform class ontolog repres featur vector make comparison class easi fast possibl class document vector retriev perform improv repres centroid vector class hold set document individu compon vector featur calcul fd ij fd ij ij weight featur document term fd ij introduc improv discrimin drop implement perform reason experi show influenc alter minim similar concept node ontolog calcul cosin jja jj jja jj vector repres respect concept node current implement consid flat list class classif plan implement hierarch featur select classif present al futur work ident treatment class document implement simpl power mechan balanc retriev public servic tradit scope scope calcul concept node vector linear combin rocchio vector document vector case document user assign concept node semant link rest document class word combin featur vector greatli improv classif perform vector concept calcul increment updat concept vector document ad featur vector ad evalu system prototyp stage conduct test qualiti map servic evalu conduct test set collect bookmark webpag map open directori project test stem algorithm naiv classifi calcul node map result unsatisfactori due fact webpag bookmark point titl page link number addit page held actual document plan implement special web page classif algorithm present sebastiani futur work testb consist user bookmark link document pdf ps format user repositori commun researchindex commun manag commun item tool conduct number experi show identifi node ontolog assembl person evalu case essenti ontolog larger number user relat work research applic ontolog map commun support system present perform collabor document recommend find relat folder user bookmark link relat folder peer user recommend user qualiti recommend link insuffici qualiti map folder judg satisfactori due fact map folder base naiv keyword comparison direct exchang document user perspect knowledg domain vari find suitabl map case map commun user perspect stabl commun perspect make feasibl find suitabl map time structur bookmark hierarchi consid kersten model express ontolog interdepend present algebra set oper ontolog construct sourc ontolog express articul ontolog articul ontolog consist concept subsum concept sourc ontolog sourc ontolog connect articul ontolog link term semant implic contrast addit ontolog creat map perform manual user explicit ontolog map perform base ontolog document document collect framework emploi ontolog map paepck al focu mediat sourc structur inform focu unstructur inform futur work import issu evalu map servic larger number user granular retriev relat document offer improv process ontolog map result interact user calcul measur node plan implement specif classif techniqu web page real hierarch advantag structur inform store ontolog structur side present techniqu map categor document knowledg work focuss implicit ontolog ontolog map document make repres content categori document label implicit calcul similar measur node ontolog map result show qualiti map good ontolog map servic part offer publish retriev servic user member commun user perspect document space work ontolog document manag facilit exchang explicit knowledg commun refer automat web page categor link context analysi european symposium hypermedia artifici distribut intellig paradigm knowledg manag aaai spring bring knowledg busi pp aaai press scalabl featur classif signatur gener organ larg text topic taxonomi vldb journal ieee intellig system mad mean ieee intellig system automat document evalu method symposium ur principl design ontolog knowledg share technic stanford groupwar social challeng develop commun acm ontolog agent ieee internet comput semant integr inform open dynam environ acm sigmod intern confer manag text categor support vector learn relev featur european confer machin learn integr commun servic common infrastructur proc intellig engin system alli pp ontolog categori describ document proc intl conf inform knowledg manag pp acm press knowledg manag framework proc aaai spring symposium pp ed knowledg manag handbook crc press mediat infrastructur digit librari acm digit librari model articul ontolog interdepend vii confer extend technolog state art ontolog design ai magazin ontolog base person search proc ieee intl conf tool artifici pp der ai web commun web portal proc nation conf artifici intellig innov applic ai conf aaai press discoveri share topic network peopl intern confer artifici intellig pp springer semant web proc semant web
AI/1011 2 implement knowledg john robert boyer greg depart comput scienc mc san diego drive la ca abstract system dicult design complex realworld knowledg repres paper compar experi build knowledg base hand di erent clip knowledg base consid peopl prefer interest nding paper consid horn theorem impact knowledg system introduct technolog autom increasingli part everydai bene cial enabl technolog applic area obviou implement emb knowledg base applic design good knowledg base trivial good knowledg base gener complet avoid bad ecient descript time paper present author experi implement knowledg base di erent knowledg clip knowledg base peopl prefer date intend applic suitabl match peopl paper discuss strength weak system point relat paper discuss bene ts shortcom horn theorem context current research literatur knowledg base applic chosen knowledg domain person trait prefer date partner intend applic autom person answer number knowledg base deduc person compat person copyright john robert greg reserv knowledg base chosen domain de ned questionnair sampl data readili construct clear distinct knowledg repres knowledg repres evalu function knowledg eld date knowledg implement di correspond establish program process chosen program clip program knowledg determin peopl match involv identifi quantifi person trait import relationship peopl potenti match similar score trait detail descript di erent measur scope paper inform part process trait sociabl religion person receiv score peopl match trait score di er trait describ person conform societi rate strong drawn wai idea make base tend societi enjoi lot wai idea accept idea proven rst enjoi lot wai idea rule gener follow structur order uncomfort uncertain ambigu situat peopl separ incompat clip clip languag integr product expert system tool develop nasa develop softwar model human knowledg norvig detail descript product system knowledg repres function fact simpl compat goal limit score distanc user id function execut action return primarili procedur knowledg ag compat rule comput rule product execut action constraint pattern prior sati ed rule primarili repres heurist knowledg base experi rule uniqu pair prospect determin goal evalu compat score fact compat knowledg base rule invok rule execut declar uniqu pair prospect incompat match fact requir prevent nite repeat rule provid fact futur refer identifi compat goal theorem prover develop argonn nation laboratori william knowledg repres logic form includ function oper integ resolut method search knowledg base question phrase proof contradict state question prove origin main axiom fol date knowledg base axiom determin numer score speci integ axiom declar object form categori match peopl match score categori axiom declar object match di er categori match categori axiom add function applic knowledg base nding date provid clariti applic discuss rest knowledg repres predic function male declar male person fred good imag fairli import trait date partner categori peopl ad knowledg axiom imag sociabl john fred ad avoid undesir model comparison clip clip uniqu advantag disadvantag wai search present knowledg gener knowledg clip standard knowledg er extens stick close standard import achiev separ knowledg base infer engin run knowledg base implement axiom base integ score oper implement boolean variabl conveni ecient implement integ oper standard knowledg knowledg underli infer engin costli issu implement knowledg base axiom logic context presenc axiom prove theorem rst axiom reason amount time behavior unexpect promot separ knowledg infer engin clip su er problem unexpect promot coupl knowledg base infer engin syntax bind kb provid control mechan knowledg engin resolv ambigu priorit rule clip capabl highlevel data structur program tightli bind kb advantag clip abil structur axiom data understand util clear method illustr shown clip support high level structur data requir data convert lower level predic data appli higherlevel rule conveni rule build intermedi knowledg fact base fact infer order eventu determin end goal construct reduc number rule perform clip order magnitud faster solv queri kei reason di erenc handl fol versu clip implement fact product rule result liter result ju possibl run possibl contradict sentenc written limit liter categori statement result liter clip work higher level granular fact pattern liter provid limit form context implement product rule product clip evalu order search pattern match place control unnecessari comput elimin restrict rst term liter save result reason form fact avoid costli reason futur situat clip greatli reduc branch factor signi cantli perform knowledg part knowledg base di erent dicult entir knowledg base problem disjoint underli data individu attribut highli reusabl true context axiom applic context reusabl data axiom applic invit peopl similar interest social nding peopl match axiom result present clip di er present result answer question proof print proof sequenc clausal sentenc resolv lead contradict knowledg discov fall directli path lead contradict part user verifi nding proof contradict simpli stop execut signi improp model proof clip handl knowledg proof substanti di erent clip automat provid proof result mechan user watch execut print inform knowledg engin program signi print statement show gener result knowledg gener store fact kb fact user complet run futur incorpor dynam knowledg larg di erenc clip handl dynam knowledg poor handl chang clip resili clip save intermedi knowledg achiev subsequ run clip adapt chang environ featur speci clip portabl featur abil save gain knowledg run remov fact knowledg base run mean fact user infer engin run start time consum redund complet sound import featur found domain expert select sound match depend valid model accuraci data collect singl match veri proof fact present date servic statist verifi sound model data nding success rate match eventu relationship develop result time good indic model work import complet depend kb goal larg knowledg base potenti match exist user interest nding ve match randomli complet kb small match top ve match complet import easi verifi complet model small knowledg grow exponenti dicult amount data complet clip exploit solv problem complet search knowledg base requir enorm amount time requir long time prove axiom fairli trivial hard provid knowledg base queri answer quickli caught extrem long clip perform consist improv made speed search give weight axiom describ order appli address perform issu horn theori major issu prevent gener fol knowledg system gain accept poor perform primari wai combat perform problem restrict express incomplet infer engin rst method shown patil limit practic option option expert system requir complet function accept concept horn horn theori develop attempt limit express knowledg base horn posit liter conjunct horn call horn theori import properti horn theori queri solv linear time gallier biggest disadvantag approach knowledg base repres horn theori selman kautz kautz solut problem call knowledg compil knowledg compil knowledg base restrict knowledg base horn theori input knowledg base horn theori horn knowledg base creat superset origin axiom input kb direct horn compil rest axiom compil horn approxim origin axiom find horn approxim requir nding horn question true easi horn approxim superset superset relationship bene bound end selman kautz present di erent method comput tight bound kautz algorithm gave exponenti complex desir tight bound fact proven develop horn approxim xed bound solv problem subset horn theori creat algorithm singl increment modi cation horn theori limit algorithm work modi cation horn theori modifi singl main motiv research develop increment knowledg recompil dynam system discov prove special case ed time horn approxim polynomi time tight bound found method degrad slightli addit modi cation open question creat research rst problem algorithm present work modi cation horn prove author origin algorithm nding algorithm sati es constraint complet realm possibl open problem determin ect reduc tight approxim date quantit measur ect measur prove disprov util algorithm recent technolog advanc continu place demand expert system paper show experi implement simpl knowledg base current technolog show larg tradeo reusabl made system achiev adequ perform current research show approxim fol knowledg compil show improv perform sacri express futur work futur work possibl literatur includ work algorithm combin increment updat horn approxim discoveri case updat dont restrict present area research quantifi impact knowledg base progress looser bound obtain method issu experi issu perform heavi perform penalti match compar clip trace er area futur work determin exploit knowledg infer engin conjunct quali er perform gain acknowledg experi paper clip indebt work accomplish author program refer autom deduct system linear time algorithm test sati proposit horn formula journal logic program knowledg languag taxonom classi util servic arti cial intellig clip user guid version nasa increment recompil knowledg journal arti cial intellig research horn envelop hypergraph symposium algorithm nasa tool build expert system ca usa arti cial intellig modern approach upper saddl prentic hall knowledg compil horn approxim mit press page
HCI/1012 4 extens zoomabl user interfac graphic toolkit java benjamin jon lanc good interact lab institut advanc comput comput scienc depart colleg md abstract paper investig scene graph gener approach implement graphic zoomabl user interfac scene graph typic found graphic packag sun sgi wide adopt graphic user interfac toolkit explor effect scene graph develop scene graph toolkit jazz implement java run platform support java paper describ jazz lesson learn jazz discuss scene graph appli applic area keyword zoomabl user interfac user interfac manag system jazz introduct graphic user interfac toolkit wide rang user interfac object control gui toolkit excel build hierarch organ standard widget text area fall short develop creat widget develop typic write widget subclass exist widget overrid method defin function gui level function implement gui widget write code draw develop write code handl drag keyboard keyboard focu tool context sensit popup anim implement fulli function widget daunt task figur screen snapshot applic written jazz problem exist user interfac toolkit follow design philosophi small number class provid larg amount function class tend complex larg number function provid class hard widget address code toolkit develop place gener code class inherit widget toolkit drawback approach lead complex class microsoft class method java compon class method java toolkit modern top level class applic develop forc accept function provid class add reusabl mechan enhanc toolkit applic develop creat custom toolkit complet control capabl widget applic investig zoomabl user interfac zoom princip method navig number uniqu detail displai scene zoom multipl view scene magnif implement gener widget support applic hard report experi develop jazz jazz toolkit develop applic build kind widget unlik prior gui jazz base design philosophi function deliv class inherit number simpl object scene graph hierarchi object frequent layout serv node beneath scene graph addit function select jazz tackl complex graphic applic divid object function easili understood node type node combin creat power applic base class jazz public method relat relat relat local global rest function scene graph import mechan support custom applic widget zoom motiv build simpl model prove applic combin object hierarch support multipl simplifi task write widget describ uniqu requir led creat jazz outlin relat work jazz motiv convent java swing toolkit start letter signifi java letter signifi zoom connect jazz open sourc softwar public discuss architectur jazz show jazz support ad function describ applic built jazz conclud describ experi build jazz outlin futur work requir zoomabl user interfac kind inform visual applic displai graphic inform virtual canva broad high resolut portion huge canva displai virtual pan zoom surfac uniqu requir support standard gui toolkit list requir kind build requir reflect complex natur widget similar provid support custom applic graphic tradit interact widget button slider larg number object support render interact perform doesnt degrad complex scene object support arbitrari transform hierarch group view navig smooth continu anim multipl object support object render differ scale multipl view surfac surfac object made stai fix spot screen view similar write interact event handler provid user manipul individu group object jazz platform support requir relat work influenti interview framework support structur graphic user interfac compon deriv interview unifi structur graphic user interfac widget singl hierarchi version interview support lightweight glyph class hierarchi structur similar jazz system support larg scene graph handl multipl view scene graph support advanc visual techniqu view context sensit object jazz add node type scene graph support addit featur number gui toolkit provid support creat custom applic provid support structur graphic tk canva support hierarchi extens amulet excel toolkit support widget custom support arbitrari transform semant multipl view gui toolkit closest meet typic gui toolkit orient tradit graphic user interfac innov constraint widget layout rich input monolith design support multipl camera arbitrari transform object view gui toolkit adopt scene graph structur integr structur graphic user interfac widget implement monolith design extend exist toolkit add support pursu design felt import research goal build applic exist scene graph work structur standpoint restrict render problemat render support busi graphic standard user interfac widget typic support import import import import public class extend public set basic frame canva add sampl text text leaf public static void app figur complet jazz program support pan zoom effici imag triangl direct support high qualiti scalabl complex line standard busi graphic discuss issu depth interest develop scene graph node appli applic domain node found scene graph system prior implement zoomabl user interfac toolkit includ origin pad system recent system develop individu research commerci wide access chapter previou system implement term hierarchi superfici similar jazz gui monolith class structur place larg amount function singl class class support spatial cleaner flexibl approach jazz toolkit jazz toolkit creat applic zoom graphic jazz built java run platform support java jazz organ support effici rapid screen high qualiti written jazz render pick clean design focu graphic opengl support busi graphic support swing imposs opengl jazz borrow structur element common scene graph sun sgi basic hierarch scene graph model jazz directli support varieti common interfac mechan includ hierarch group object affin transform rotat intern camera semant multipl figur show complet standalon jazz program displai user pan zoom view default navig event handler user pan left zoom button drag left zoom note jazz automat updat portion screen manual call jazz jazz design standard scene graph segreg function group node approach lead modular scene graph design jazz extens visual interact polici small set visual object welldefin mechan applic defin jazz support default interact design modifi applic scene widget built custom data structur support gener toolkit approach involv common oper applic applic scene graph reusabl solut common oper solut cost tradeoff scene graph comparison custom applic advantag scene handl scene graph scale handl complex scene scene graph decoupl compon make easier improv switch make tweak scene graph novic programm implement avoid implement common featur figur object hierarchi jazz scene graph make easier implement thing select pick scene graph make easi data multipl place gener solut scene graph memori custom solut typic effici write custom solut scene graph optim graphic uist found solut game ran time slower consum time memori scene graph place restrict avoid custom solut architectur jazz base primari visual camera figur show object hierarchi public object applic figur show object structur typic applic object camera node visual compon jazz scene graph consist hierarchi node repres relationship object base node type simpl complex node featur paid hierarchi node implement found draw facilit move collect object scene graph node visual screen special call visual attach node scene graph visual leaf node visual group defin geometri color attribut node establish scene graph visual compon node singl follow strict tree hierarchi visual compon visual compon multipl place scene multipl parent clear separ implement node handl visual compon node object characterist pass child node node provid affin transform shear child cull defin transpar group object characterist modifi node descend visual compon pure visual hierarch structur visual compon simpli specifi render bound pick detect split node visual compon separ code awar scene graph hierarchi code oper independ hierarchi enabl hierarch structur scene graph visual compon separ structur content visual compon make replac circl squar scene graph affect group posit object figur object structur typic applic scene singl camera layer rectangl group consist polylin camera camera visual compon displai view jazz scene graph specifi portion scene graph visibl affin transform multipl camera setup singl scene defin view scene graph draw surfac intern camera camera map draw surfac encapsul java support render draw surfac jazz user surfac displai jazz canva implement java swing interfac swing swing widget expect draw surfac output printer jazz surfac render buffer applic grab pixel render addit map draw camera treat visual compon jazz scene nest view zoomabl surfac scene camera call intern act nest window world world previou call layer camera list layer node layer scene graph camera render render render layer layer list approach applic build singl larg scene graph control portion scene graph visibl camera layer made temporarili specif camera remov camera layer list special node type call node insert scene graph make children layer chang order layer node layer list draw order entir layer render node render depth fashion visual compon render order node scene graph chang order node parent node chang render order visual compon cull scene graph object includ method comput bound rectangl jazz decid object avoid render pick object visibl view bound cach node current rel coordin system object regularli chang dimens bound volatil jazz cach queri object directli time bound make visibl event jazz support interact event listen follow standard java event model attach node jazz scene graph categori event input event object event input event result user interact graphic press object event result modif scene transform node insert event handl attach listen scene graph node multipl listen node unlik standard swing awt listen jazz default input event pass tree listen ancestor node listen consum event pass custom event listen written specif node correspond graphic item listen attach higher scene graph interact support entir listen event listen written specif gener manner depend applic jazz dispatch event node potenti return pick oper locat origin event jazz draw surfac dispatch jazz modifi event record reflect local coordin pick compon visual compon event handler work local coordin system jazz event handler basic hyperlink applic free defin function node type basic design goal jazz maintain decoupl design featur depend applic pai featur led core add extra featur introduc node type insert scene graph node core type transform transform node creat insert node transform develop encourag achiev complex function simpl node type scene graph subclass inherit valid practic idea develop number jazz node implement specif function suitabl remain small manag section discuss node type creat jazz includ node support spatial constraint section discuss node type select hyperlink node node type associ extra characterist portion scene graph extra node act standard object orient design pattern wrap core function node ad extra function written jazz select decor node draw draw select box jazz defin link creat spatial hyperlink link node associ destin spatial hyperlink modifi node knowledg user move link present arrow visual compon show link refer click link navig camera link object posit layout node posit scale object jazz insert transform node hierarchi activ layout manag util insert layout node hierarchi develop layout manag analog java awt swing layout manag layout manag insert level scene yield hierarch layout applic defin layout layout jazz layout hierarch tree layout layout scene graph standard tree path layout posit set node path hierarch tree layout manag interest show line indic linkag node tree special visual compon constraint node develop node dynam constraint posit children constraint node implement portion scene graph camera move camera viewpoint chang sticki node subclass constraint node transform modifi transform set camera view transform view root sticki constraint node move viewpoint stuck len cull node basic characterist zoomabl applic larg number object scene visibl view graph small object larg object shown import effici scene cull object simpl cull suffici develop addit mechan support cull group insert scene graph cull larger smaller magnif view group alpha blend smooth transit node insert scene graph provid fast access visibl children node spatial index node implement rtree index effect small percentag visibl time common typic occur view zoom custom visual compon defin visual applic extend class defin function object defin paint big visual compon defin pick method object jazz pointer object legaci java code motiv split compon scene graph node make easi import compon legaci applic zoom context visual compon easili defin wrap legaci java code written awar jazz compon zoom interact place scene graph code draw scatter plot make jazz visual compon zoom surfac techniqu wrap exist code larg system graphic simul system research group lo alamo nation lab defin visual compon wrap core visual place entir visual insid complet zoom multipl view interact half dai system develop larg inform framework system major visual compon similar wrap core object type jazz visual entir applic insid jazz swing visual compon lightweight java swing compon jazz scene graph place jazz visual compon scene graph swing compon pan zoom jazz compon mean fulli function exist java swing code complet gui zoom mix match custom graphic jazz swing interfac tabl button zoom surfac overlaid visual swing compon manipul jazz includ appli multipl view swing integr occur transpar swing widget node scene graph applet demonstr swing widget jazz jazz websit implement swing widget insid input output remap accommod transform render input swing screen locat directli swing local coordin system map straightforward swing widget arbitrarili transform visual compon regist listen forward event receiv underli swing compon coordin system visual compon alter request made swing compon jazz swing request assum render tradit gui arbitrarili transform visual compon rerout jazz scene includ multipl properli transform java object swing compon render creat applic specif widget test develop number prototyp widget widget explor aspect gener graphic applic design report briefli widget basic applic understand requir structur creat simpl zoomabl applic jazz built graph editor user draw graph node connect link link follow node user move user draw larg graph view zoom demand node group zoom node group fade replac group node repres abstract element group support user understand global context multipl view brought simultan zoom view show zoom view applic web applet difficult build applic exist gui toolkit gui toolkit dont directli support multipl multipl level applic manag detail build applic jazz straightforward multipl level multipl view directli support write graph draw applic matter ad node scene graph element applic jazz support interact event listen make easi add node edit graph object chang event gener object event listen attach node order updat connect arrow follow node jazz care screen hierarch simplifi applic program view scene graph model jazz make easi support advanc graphic featur jazz directli support geometr zoom entir creat visual object scale interest function implement simpl view jazz put special decor node object effect appli node special transform node dynam comput scale function simplifi view entir object scale distort ad function trivial explor techniqu jazz context sensit object jazz object support singl present style desir support multipl singl data model support visual displai object context applic easili jazz present visual data circumst kind context influenc call techniqu render applic context whatsoev control object render common context magnif size object render camera camera object render specif term semant zoom refer object chang base current magnif object differ view term len filter jazz standard visual compon render render lower resolut effici applic defin visual compon node paint method context sensit standard softwar engin approach call decoupl visual exist independ applic builder design modifi affect clean decoupl design support class visual data design accomplish make special visual compon act proxi visual deleg elabor deleg scheme fox deleg fairli straightforward build maintain list ancillari visual compon activ time defin pick method call activ visual compon implement simpl deleg sampl deleg support semant zoom select specif visual compon render base current magnif level approach properti decoupl visual screen control singl move node chang move zoom level figur show basic structur scene graph deleg support semant zoom lazi evalu drawback approach adopt jazz place burden applic programm manag scene graph node node type ad element scene step deleg rep rep rep figur implement semant zoom jazz deleg paint depend current magnif practic typic primari node applic care visual leaf decor node implement special support manag kind scene graph notion scene graph editor object editor instanc creat node scene graph method obtain parent node specif type lazi evalu creat parent node requir jazz maintain special bit node creat editor applic obtain transform node node scene simpli node transform node transform node creat insert node exist transform node return method call factori creat applic defin custom mechan edit node current statu paper implement java publicli open sourc softwar jazz activ number research commerci product develop jazz distribut sampl applic call demonstr basic featur build applic version collabor storytel tool author tool creat present author tool build experi make zoomabl present past year author tool work microsoft powerpoint exist present brought zoomabl space tool publicli paper describ architectur java toolkit support develop extens graphic zoom multipl descend previou zoomabl user interfac built past jazz introduc substanti individu bring varieti techniqu domain jazz scene graph screen interact techniqu function previou put element clean decoupl object orient design develop write zoomabl applic advanc visual clariti effici biggest contribut jazz creation graphic toolkit built design encourag composit jazz highli decoupl make code easier maintain extend compar monolith approach jazz build varieti applic proof demonstr approach potenti approach cost experi jazz show biggest concern jazz design effici downsid approach applic develop manag object tradit design pai featur node instanc featur attempt minim burden develop awar node type basic issu effici solut compar custom solut altern jazz visual build custom data structur repres build render method simpli walk render entir scene approach simpl effici simpl kind custom implement advantag approach applic requir featur spatial index number featur custom approach difficult maintain quantit data inform threshold complex jazz benefit cost perform rigor quantit perform jazz number applic consist found perform good primari bottleneck render larg number overhead incur maintain forward continu develop understand design chosen jazz gain experi carefulli analyz construct system compar altern approach acknowledg enjoi collabor involv jim jason allison georg furna ken perlin fellow member student seminar patienc earli version jazz identifi jim maria jump contribut jazz greatli care read earlier version paper jason allison druin user jazz understand requir jazz made jazz broadli import earli user david thompson lanl mike bob ward page darpa instrument support jazz wouldnt exist support work fund part equip grant sun microsystem refer java url url url url sgi url zoomabl graphic sketchpad explor altern interfac physic journal visual languag pp implement zoom user experi build practic pp control design spheric point motor ieee intern confer robot autom design storytel technolog encourag collabor young children human factor comput system acm pp analysi design applic design collabor educ human factor comput system acm pp magic human factor comput system acm pp user interfac system doctor york ny gener view human factor comput system acm pp design element reusabl orient softwar anim support user interfac toolkit user interfac softwar technolog acm pp john ousterhout tcl tk toolkit user interfac interview ieee pp amulet model effect user interfac softwar ieee transact softwar pp altern approach comput interfac comput graphic acm pp nest user interfac compon user interfac softwar technolog acm pp context interact zoomabl user interfac advanc visual interfac acm human interfac addison weslei design analysi spatial data structur movabl filter user interfac tool human factor comput system acm pp blend structur graphic layout user interfac softwar technolog acm pp
Agents/1013 1 system agent interact simon mile mike joi michael luck depart comput warwick unit kingdom abstract preliminari methodolog softwar engin base idea agent interact analysi approach interact undetermin agent primari compon analysi design agent basi softwar engin provid power intuit abstract complex design paper describ process design deriv interact occur system satisfi requir design structur includ identif agent suggest approach flexibl provid design open complex futur mainten extens system introduct agent paradigm recent rise larg amount research intern structur agent gener capabl effect intellig behaviour dynam environ concentr work develop agent architectur side aspect illumin agent metaphor agent abstract gener softwar engin paper explor method introduc preliminari methodolog basi design system full potenti system solv problem complex domain depend system design tailor condit vari domain suffici adapt fault toler cope domain due extens achiev methodolog produc design flexibl describ vari requir interconnect area open system address abstract social aspect agent system concept emerg methodolog provid describ system analog place heavi restrict behaviour concret agent runtim approach extend identifi pattern model repeatedli basi system choic model effect perform system applic domain effect connect system time account tailor behaviour group agent domain provid coordin media societi agent rule system influenc dynam form approach provid appropri constrain flexibl constraint infrastructur domain identifi explor agent interact base interact agent primari compon analysi mase methodolog approach constrain model late requir identifi agent interact translat requir agent interact system behaviour flexibl distribut design system connect system product step paper structur justif structur methodolog continu design process implement section detail term set scene rest paper section overview agent interact analysi section step process turn section examin initi analysi system requir explain inform agent interact analysi section describ system aim structur repres system function section describ concept interact agent detail part plai design process section deriv design inform interact system requir section show design reduc form implement final section describ process mainten mention work project agent goal term agent varieti relat wai literatur surround describ softwar artefact satisfi architectur requir order achiev function agent softwar engin abstract enabl complex softwar collect sophist interact compon share qualiti previou develop methodolog aim suffici flexibl gener appli design wide rang ti assum system compon thought assumpt enabl design develop system properti make rest design easier comprehend properti fairli standard agent consid flexibl reactiv entiti agent interact analysi concern social aspect agent directli address analysi reaction environ system design properti describ broad expect agent system result design approach requir architectur implement constraint advanc form agent open system paper describ direct agent autonomi term declar goal possess agent flexibl rang system methodolog goal varieti solut worth overview agent interact analysi primari build block approach interact agent approach agent interact analysi assum system arbitrari number flexibl agent properti section detail interpret system requir goal prefer achiev system goal independ hierarchi compar hierarch action achiev lowest level goal treat success engag agent pursu goal interact requir interact system prefer deriv form architectur coordin mechan make agent part interact behav fit prefer structur agent interact analysi process shown figur primari entiti written larger letter arrow transform entiti make design process requir requir extract structur multiag system usefulli implement goal goal describ desir state system prefer prefer denot encompass concept includ constraint relat inform requir goal type prefer agent interact qualiti repres domain restrict desir system properti requir account goal decomposit requir goal prefer interact requir analysi prefer analysi agent fig transform involv agent interact analysi interact agreement coordin agent agent interact section expand mean interact agent agent deriv entiti implement process fulli defin matur describ part methodolog benefici properti design remaind paper describ detail process work argument agent interact analysi requir develop earli stage design process deriv requir stage relev agent interact analysi goal prefer goal continu system lifetim depend regular interv invok user prefer form measur success goal restrict resourc exampl prefer tradit requir analysi attempt system function state understand problem agent interact concern reach implement solut techniqu end product artefact deriv requir agent interact analysi produc requir analysi highest level system context prefer attach term requir mean clarif definit state function achiev attent highlevel stage design process usefulli borrow requir analysi idea rang requir analysi techniqu aim system interest note techniqu deriv relat agent intern extern system design concern primarili explicit distinct class agent product simplist translat made user click button graphic interfac document edit translat interact agent cooper goal save document state fact press button interact goal temperatur place restrict system describ system goal temperatur goal consid part interact implement singl agent repeatedli cooper concept agent cooper reduc intern process agent valuabl provid overarch framework cooper part describ measur qualiti high temperatur low applic wider rang continu goal continu possibl regular system midnight sort interact cooper clock agent transfer file amount corrupt suffici describ set prefer result qualiti measur goal transfer file goal decomposit system goal examin system broken enabl design identifi agent labour design system goal mean find state goal state achiev easili find independ part goal state part achiev achiev graphic repres goal decomposit figur goal independ goal achiev achiev goal goal real world follow structur goal repres environ state goal state tabl move goal state end lift goal state end goal state lift tabl move goal state end move goal state end move goal sequenti goal goal goal goal goal goal fig goal decomposit task decomposit similar product hierarch plan goal reduc subgoal unlik hierarch structur necessarili possess individu group requir system goal achiev system run decomposit state enact decomposit occur system circumst correct weak implic decomposit essenti retain system agent flexibl tighten design stage multipl decomposit develop goal decomposit produc full design lose benefit approach fulli subgoal translat seri action achiev system goal form execut flexibl lose benefit system loss connect system reaction state domain scope extens leav system harder comprehend full construct entiti describ messag pass design goal decomposit specif achiev aim high level mechan function happen happen robustli design goal decomposit descript underli structur leav system interact stage process assum system arbitrari number minim defin set goal hierarchi suggest wai goal system requir implement set prefer restrict deriv requir step combin state system enact goal decomposit import retain tree subgoal decomposit agent share section problem system remain robust conform system prefer high level goal deleg extern connect system concern achiev notion goal decomposit mean goal pass system involv cooper agent cooper agent goal call cooper agent necessarili agent cooper achiev goal defin interact agent agent figur illustr structur interact cooper agent achiev label goal interact role goal interact role label goal interact role fig structur interact interact label goal complex interact messag pass object similar eventu effect control transfer system compon limit cooper place agent involv possess interact origin label goal involv agent interact interact deleg act monitor execut exact role depend goal part flexibl achiev agent involv interact agent fill interact insid design system agent import note due fact agent interact illustr success case origin eventu found cooper repres chain deleg agent chain continu decomposit complet point start refin design system mandatori system goal achiev interact prefer mean achiev deriv form system behav flexibl consist requir import aim methodolog make design implement level result potenti piec develop separ peopl consist complex stage design hard comprehend implement effici address area function goal understood develop separ prefer analysi continu process agent interact develop design system agent interact aspect interact account agent develop analysi agent coordin achiev ensur system goal prefer account discuss subsect class agent aspect concern set agent result aspect set agent applic interact set restrict number factor restrict set agent design part interact aid understand result system prefer resourc restrict expand set agent desir reduc complex number agent system prefer monitor conflict goal resolv conflict goal singl agent multipl goal decid action base combin goal requir overlap set interact prefer limit function avail effici secur reason design limit number agent abil achiev goal restrict extern system extern agent complet goal prefer state agent state agent restrict class belong local mobil agent suitabl interact likelihood high load goal requir achiev repeatedli requir lot resourc design expand set agent distribut task wide distinguish agent design achiev success interact system prefer agent adopt goal achiev effect effici specif design case agent goal achiev system balanc adopt goal distinct made agent design interact compel adopt goal discuss section assur analysi work develop coordin mechan includ commit trust system role social law mechan suitabl prefer rapid secur robust goal system serv mechan agent interact analysi find suitabl mechan agent case agent part set design tool point view singl agent fulfil goal system prefer call assur analysi examin agent measur alter likelihood success deleg assur achiev goal prefer due space limit discuss assur analysi list thing address prioriti cooper place rel goal method complet goal alloc pursuit goal error commun qualiti solut goal measur satisfact prefer gener implicit system goal achiev design decid extern system behav lot restrict design system achiev minim standard circumst goal possess agent act stage continu agent complet goal cooper request cooper reject cooper goal achiev address design make mandatori agent goal agent extrem form assur minimum standard restrict compar servic methodolog note agent goal agent reason agent possess deal multipl goal prefer vast amount analysi system interact interact similar form suggest structur agent system thing assum interact restrict occur design honest commun goal requir rapid requir low commun cost design collat agent interact analysi provid justifi structur flexibl system result design method set design lead goal prefer requir desir properti set agent involv interact final stage reach design coher implement prefer analysi produc descript agent restrict architectur system possibl includ physic locat highli distribut system collect agent reduc set implement identifi criteria situat agent system suitabl assur analysi suggest agent interact high assur make interact intern process goal function requir agent similar assur analysi suggest similar coordin mechan agent suitabl merg singl agent act gatewai reliabl connect system provid secur coordin low level goal deal requir similar action perform iter collat left system implement justifi design properti refer fact design system tailor demand applic place improv effici maintain flexibl robust mainten extens obviou flexibl system incorpor repair faulti softwar extend requir system aspect design methodolog affect easili design alter design provid highli separ entiti alter individu fall bound singl object simpl make agent interact analysi offer compar term goal appli design earli goal decomposit stage point function divid target assumpt restrict make featur system conflict made follow document earli late examin design replac final alter merg final version design minim effect rest system execut time system advantag form system adapt chang multipl independ commun balanc adapt treat differ option advantag provid scope adapt agent remain flexibl system requir permit interact agent limit interact agent system free good coordin strategi current form system summari paper idea form softwar engin agent interact abstract interact agent primari compon analysi system requir base exchang suggest robust tailor mainten produc shown interact examin determin effici form particip idea assur examin requir individu role term extract inform design effect coordin mechan work introduc gener principl issu remain tackl creation techniqu assur coordin judg respect rest design work rang specif techniqu assur analysi bdi agent techniqu agent architectur express compar varieti coordin mechan trust basic commit techniqu measur mechan agent refer agent static commit refer commit agent work left discuss due space limit paper describ full methodolog produc detail techniqu suitabl document design approach present paper distinguish notat concept illustr recent work extens uml futur aim develop fulli usabl methodolog agent interact test product suitabl applic work assur analysi describ assess coordin mechan develop mechan tailor domain approach agent interact suggest clear gener effect methodolog target design system complex open applic flexibl cope wide rang uncertainti dynam refer grai case map captur valid distribut system requir fourth intern symposium requir engin lang agent design element agent applic design intern confer autonom agent barbuceanu coordin agent role base social constraint plan fourteenth nation confer artifici intellig page odel agent formal multiag softwar system volum davi softwar state function prentic decker lesser design famili coordin algorithm intern confer system page deloach wood develop multiag system agenttool seventh intern workshop agent architectur languag requir specif design system graph role uml volum intermedi model inform system franklin graesser taxonomi autonom agent jp mj nr intellig agent intern workshop agent architectur languag page goldman rosenschein mutual adapt enhanc social law technic report hebrew huhn program volum gonzalez survei methodolog intellig agent intern workshop agent architectur languag jen commit foundat coordin multiag system knowledg engin wooldridg roadmap agent research develop autonom agent kendal agent softwar engin role model volum kendal role model agent system analysi design intern symposium agent system applic novemb rao methodolog model techniqu system bdi agent walter van de veld jw agent break seventh european workshop model autonom agent agent world januari landauer bellman inform infrastructur inform system luck engag cooper motiv agent model zhang distribut artifici intellig architectur australian dai page marsh trust comput concept phd depart comput scienc bauer repres agent interact protocol uml volum omicini societi infrastructur analysi design system volum softwar engin edit wood deloach overview multiag system engin methodolog volum kinni methodolog analysi design intern confer autonom agent kinni gaia methodolog analysi design journal autonom agent yu schmid conceptu framework agent orient role base workflow model inform system wooldridg abstract analysi design system volum
Agents/1014 1 compon base agent construct keith clark depart comput imperi colleg london accept final form abstract agent architectur integr compon provid domain depend agent function kei integr featur agent activ messag board commun board activ automat forward messag poll messag board basi messag pattern function compon place board messag function compon provid semant test content commun compon whilst appli addit agent manag call offer set agent manag servic toolkit consist number server store code compon symbol descript agent compon server inform facilit launch agent prototyp system present toolkit appli involv agent base system control condit agent base network manag applic kei agent base softwar compon orient agent content base rout introduct advanc object orient construct shelf compon construct larg softwar system fashion emploi design level involv abstract pattern concret level involv compon implement specif languag lead style softwar construct call compon orient distribut style program call agent orient style program entiti applic view agent capabl accomplish complex task number softwar architectur build agent common intern architectur keith clark separ agent function main domain independ domain depend domain depend part agent deal problem solv activ agent domain independ part deal commun orient activ agent featur knowledg base manag layer domain depend layer domain independ figur layer architectur domain depend part agent consist number agent collect modul design implement domain depend part hardwir compon commun disadvantag creat inflex architectur delet addit compon affect agent function result compon compon commun dynam addit modif compon standard approach messag share repositori messag compon commun bu advantag messag board compon program languag written independ code compon assum standard languag commun servic compon program place messag request messag board ident compon servic respond servic request request servic compon offer dynam upgrad reconfigur agent corba orb offer limit messag board facil compon offer messag rout implement independ object compon messag rout requir destin compon base agent construct address destin address found orb trader yellow page directori high level messag board automat rout messag base content messag rest paper explain detail activ messag board architectur integr compon base content rout messag destin compon messag board act intellig router activ forward messag agent compon base content messag wait poll compon kqml match messag board find compon compon send messag messag pattern messag board compon crucial differ messag board kqml match maker pattern kqml symbol express activ pattern test function appli messag messag board function messag board compon activ pattern interest receiv messag major advantag send messag pattern function incorpor semant test content messag semant test suppli addit code includ messag demand provid demand april program languag activ messag pattern commun extra inform accept messag test appli suppli semant inform messag messag board understand inform messag board simpli execut test function inabl kqml style matchmak support applic specif semant test behalf shortcom messag pattern appli messag board messag board messag forward depend sender sender destin attach option filter function appli list ident potenti destin prune set destin filter function emb client semant destin filter function keith clark directli queri potenti meta queri qualiti current task load destin offer qualiti servic left prune destin set messag control messag sender power mechan process rout power content rout kqml match maker power linda style tupl blackboard passiv messag repositori continu poll process messag interest messag board commun good polici commun open transact subsequ commun transact direct commun mention messag board implement april languag function languag offer code mobil commun call back java messag board part april base agent toolkit build agent base applic agent manag layer layer consist collect server offer set manag servic configur network agent base compon architectur section detail compon base agent architectur section describ agent section detail implement april languag section describ manag layer section present applic agent infrastructur emploi conclud remark discuss includ agent architectur agent architectur rang abstract agent concret artifact design specif kind applic common approach agent set interrel compon function contribut agent behaviour compon privat knowledg base agent wide knowledg base compon share knowledg base compon domain independ content domain depend compon base agent construct figur agent architectur domain independ compon agent commun extern agent dynam reconfigur domain depend compon fulli depict figur explain compon concurr execut compon knowledg base knowledg base compon inform share compon global memori compon agent privat store inform intent plan agent inform agent capabl behaviour domain compon knowledg base access updat agent compon current implement knowledg deduct extens call high level syntax retriev updat inform behaviour compon specif behaviour agent exhibit implement number behaviour compon behaviour compon gener differ agent agent behaviour compon agent agent structur behaviour compon changeabl lifetim agent agent reconfigur abil adapt keith clark requir environ manipul behaviour compon role messag board agent compon interact wai store retriev inform share knowledg base interact messag messag interact support activ messag board agent compon place messag intend compon messag board explicitli read messag board compon join withdraw disrupt function rest agent compon ad agent regist messag board symbol send messag board give set activ messag pattern messag board store symbol low level process ident compon messag page directori store link symbol page directori compon messag futur compon place messag messag board request servic requir format ident compon capabl servic request activ messag pattern form appli messag board messag filter pattern match auxiliari test code execut process test part messag extract result success match filter pattern make messag interest compon lodg arbitrari process behalf part process commun agent compon commun compon determin interest time test code potenti destin messag messag commun potenti compon destin found appli messag board activ messag pattern messag destin filter function sender attach messag appli prune set potenti destin compon base agent construct messag forward destin prune messag retain messag board sender time case compon subsequ activ pattern successfulli appli time receipt time provid compon satisfi destin filter messag forward default time broker messag case messag retain messag board retain suitabl destin found time receipt similar scenario messag commun messag board singl destin messag main differ forward compon destin retain messag board time retain time reach suitabl destin compon found messag receiv repli directli compon messag board assum sender field messag sender symbol regist messag low level process ident repli messag board forward messag requir white page lookup messag board messag commun bypass messag direct process process commun agent head agent process deal incom messag agent head commun extern commun interfac agent head commun secur wall world incom messag arriv put messag board order forward agent base content agent direct access messag board intern agent backbon head discard messag unknown syntact form keith clark travel agenc european airlin interfac asian airlin interfac reserv broker european airlin server asian airlin server compon meta messag board head figur travel agent scenario agent order illustr agent implement travel agenc contact ticket reserv agent offer ticket european asian flight agent broker compon deal custom request airlin interfac compon deal interact airlin price inform reserv airlin interfac compon deal geograph area agent maintain inform frequent address detail person inform assum messag price quot fare london tokyo arriv date constraint constraint fare messag forward broker compon interest request price quot broker consult data base inform softwar agent airlin prefer custom assum custom insist flight low fare broker place messag messag board flight reserv fare quot constraint repli european airlin interfac compon asian airlin interfac offer cheaper quot involv chang flight compon base agent construct implement platform implement platform april languag april offer number featur symbol list base pattern base commun process higher order advanc macro process featur extrem implement agent base applic agent platform implement macro extens april augment set predefin function process kqml messag april repres april data activ pattern compon messag board repres boolean function closur argument data april kqml messag broker compon send messag board content kb macro messag keith clark content destin destin sender kb true sender kb content function closur appli messag explain macro expand code detail discuss april macro code gener receiv messag store symbol pattern code store tripl tabl current activ pattern notic test condit kb activ pattern direct queri knowledg base compon agent ident held variabl kb messag expand explicit commun queri function knowledg base april messag send queri function appli data db knowledg base queri function return messag return power activ local process includ call arbitrari test function commun compon commun back compon activ pattern test function defin privat sender activ pattern code automat packag function closur activ pattern messag board adopt kqml approach messag messag board wrap outer messag perform indic compon base agent construct sender intent messag board action perform wrapper messag broker messag messag board accept forward messag give symbol destin compon ad thing regist messag board give symbol tabl symbol pair process ident compon regist white page directori messag board process ident corba object refer process ident sender messag provid april commun messag tabl regist activ pattern yellow page directori directli consult implicitli consult send forward broker messag messag board receipt board forward compon regist compon send list compon destin broker messag board messag board appli current activ pattern messag forward compon lodg pattern function find successfulli appli broker messag broker messag filter field give filter function express sender prefer respect destin destin filter filter destin knowledg base record current number task excess inform obtain queri assum multithread answer queri whilst concurr execut task queri answer ds privat knowledg base compon messag pattern messag board keith clark figur messag board intern structur messag symbol compon regist messag board intern architectur messag board depict figur compon list list record symbol regist compon low level process ident forward indirect compon symbol replac process offer messag interfac protocol process regist process forward messag filter symbol process process transpar replac compon messag board concern possibl compon upgrad reason messag board open commun transact broker forward messag activ compon list sublist regist compon registr compon send explicit activ messag put activ list send deactiv messag remov activ compon messag mechan compon temporarili suspend avail messag messag buffer process control unit access compon activ filter repositori behaviour compon compon implement april start execut immedi attach agent compon base agent construct ment involv send messag agent head messag registr activ pattern messag board implement reserv broker previou sketch inform agent specif input compon attach agent messag board handl form activ rest code compon implement argument procedur order maintain uniform view proven persist storag section compon fork process messag agent attach attach initi data compon plug symbol messag board identifi compon input list pair compon pick inform messag receiv statement execut compon specif creation reserv broker compon achiev fork fork process send inform init input messag identifi handl reserv broker inform receiv reserv call keith clark attach agent perform step attach compon agent mean agent handl identifi messag board process compon store local variabl db regist plug messag board hold messag board regist pattern execut rest compon code agent manag toolkit agent architectur support agent manag toolkit consist set server offer agent manag servic server persist store compon suppli compon implement closur store server dynam fetch server attach agent descript agent provid store separ agent librari descript compon agent consist descript base compon fetch code server attach agent integr mechan creat agent provid manag unit figur glue server figur agent manag compon control agent request creat agent add code server agent easili compon ad delet agent agent architectur layer call layer compon base agent construct set capabl launch launch compon ad replac code agent compon store special call code server process contact code server order retriev code agent start code compon retriev code launch section program sketch implement code tabl store compon closur definit schema load closur repeat ad closur retriev code abstract delet regist closur code server maintain tabl closur store store pair type symbol code abstract abstract symbol retriev delet code code tabl persist file system process regist piec code send add code messag code server messag includ closur closur procedur abstract input argument order regist code reserv broker process messag code delet code delet code messag provid closur retriev specif closur provid receiv code fetch back form messag april type argument procedur keith clark reason code exist wrong error messag gener retriev code process statement retriev code messag receiv execut special spawn compon provid fork compon process send input argument manner section fork compon fork suppli compon initi input inform messag receiv compon spawn compon procedur pass ident agent compon attach input inform compon attach agent code retriev compon launch wrap singl routin call launch implement retriev compon code fork compon compon base agent construct agent librari agent construct attach set compon messag board compon implement april process store code server describ agent symbol form basic includ list agent compon agent descript gener compon descript agent list compon travel agent descript similar compon descript descript agent consist compon central compon handl interfac airlin server airlin airlin airlin interfac compon compon code inform destin flight airlin deal librari agent descript entiti retriev symbol agent descript launch instanc develop server call agent librari april server maintain tabl agent descript server public fork delet provid descript base symbol client process send messag travel agent descript keith clark includ descript travel agent retriev descript launch agent fork gener agent messag fork retriev descript agent retriev list compon agent descript launch individu compon result launch agent call creat instanc agent proc process automat launch domain independ compon agent messag gener compon hold agent descript agent librari agent descript extract list compon descript launch time manag platform server procedur offer collect tool provid power open platform build agent agent manag platform top level interfac high easi interfac extern client creat manag agent extern launch agent simpli send messag manag platform capabl suspend kill agent compon base agent construct graphic interfac current state system invok servic offer platform case studi develop concret agent base applic agent layer manag telecommun network commun control softwar control condit offic accord locat prefer occup section provid descript applic sketch implement give detail account implement illustr agent architectur companion server easili prototyp complex applic energi save custom energi save custom applic intend address problem integr util servic comput devic develop softwar system commun control softwar control condit offic accord locat prefer occup system inform environ chang environ offic number sensor devic instal feed system inform environ inform room light intens devic input softwar affect build thermostat set radiat turn light call actuat devic devic connect electr infrastructur build electr suppli cabl exchang inform special hardwar chip attach inform gather maintain special hardwar devic call send inform extern softwar system provid mean chang devic behaviour system instruct devic specif action system keith clark figur top level view system system close map system real world offic environ number distinct agent type figur depict agent organ complex design implement compon agent architectur figur ma structur comfort agent agent maintain desir level paramet room agent listen sensori devic talk devic ec agent control receiv target temperatur level room agent receiv inform room temperatur sensor base read sensor request action link actuat radiat compon base agent construct ec agent rest ma actuat sensor figur paramet agent messag transfer ec agent link sensor actuat room agent desir condit calcul room agent agent condit maintain room base gener criteria time dai temperatur normal offic hour higher level account peopl room requir temperatur prefer consid meet room agent account schedul meet particip ensur room suffici heat meet place person agent human insid build provid main factor affect oper system movement insid build affect desir level comfort paramet person agent run person desktop commun messag pass room agent compon person movement insid build detect activ badg system interfac special server call badg server person badg server notifi turn notifi person agent person badg system person person agent start regist badg person agent notifi room agent room person exit agent room person enter suppli room agent person prefer keith clark temperatur light room agent chang condit room figur person agent badg system person agent plai role interfac diari person order make predict futur activ person scenario record person hour meet room notifi agent meet room lower temperatur offic person hour platform implement agent scenario platform custom gener architectur present implement room agent illustr figur figur room agent room agent consist main domain depend compon central compon receiv notif person movement condit requir messag compon requir special messag system compon temperatur ec agent light ec agent instanti ec agent present earlier agent compon room agent compon base agent construct implement ordinari april process compon store code descript input input data input data store agent librari descript describ room agent control room agent admin fetch descript agent librari launch agent base descript explain launch process code compon launch code server agent base network manag section show function offer implement agent tailor domain network manag collect agent control agent assign portion agent exchang messag order serv custom request agent implement facil easili domain applic applic involv manag telecommun network applic address domain intellig network control softwar compon support wide varieti servic current trend telecommun industri implement network logic servic separ network control facilit implement servic fashion independ underli network standard emerg type tina architectur main layer servic provid layer network layer layer concern network depend detail layer built top intern structur simpl requir full power architectur keith clark higher level view network servic develop low level network concern adopt similar layer architectur lower layer physic network layer top agent layer resid control physic physic network switch base network consist number interconnect node physic network number servic implement servic request node servic vari requir network differ bandwidth cost custom pai data base servic bandwidth video base long distanc connect cost short distanc request servic suitabl rout found servic establish criteria rout bandwidth cost connect rout collect node connect link end rout end point servic applic number featur physic decentr applic compon part network control control unit control unit involv negoti physic network custom request servic capabl control unit easili augment offer servic implement top implement scratch network subject failur capabl recov disrupt servic control unit part network control unit essenti period short agent control control part network local knowledg engag negoti neighbour agent order fulfil request servic servic request negoti custom part agent function agent interfac physic network custom compon base agent construct element physic network capabl perform basic direct servic singl link logic network complic function handl agent spirit tina approach telecom agent function prototyp system develop base initi system system simul system network manag start abstract function offer system group servic deal custom servic servic monitor servic establish link deal control physic network fault deal troubleshoot physic agent network base architectur figur agent compon implement agent function custom unit handl interact custom request network servic servic request custom unit forward servic unit establish network connect servic agent interact physic network link mediat offer interfac physic compon agent control fault occur fault unit inform depend type fault unit unit store inform custom unit interact number extern directori servic order enhanc qualiti servic user difficult architectur tailor match architectur unit compon agent unit agent subcompon figur depict result agent term architectur agent compon integr messag board client receiv keith clark figur agent architectur figur network agent agent messag board forward compon pattern compon servic specifi connect bandwidth unit maximum price custom accept unit extern program messag telecom agent local client messag forward custom compon initi process alloc proper resourc request servic compon base agent construct discuss softwar construct increasingli compon orient compon construct shelf construct complex softwar system agent architectur present paper adopt approach integr compon written april languag compon written convent languag java integr provid wrapper accept kqml style map intern procedur call wrapper send requir april java unix process written languag read write april messag implement compon main function program april integr compon agent messag board attach compon provid symbol messag forward specif compon identifi compon commun messag board dynam compon replac content base approach messag rout adopt compon activ pattern form code abstract messag board order rout messag suitabl destin compon agent direct access messag board messag reach messag board commun agent act commun mediat agent compon extern entiti network agent integr messag board function intern messag board agent compon agent messag board architectur characterist common kqml matchmak corba orb offer advantag explain addit infrastructur construct singl set addit server suppli provid agent manag toolkit persist store compon special persist server call code server provid descript compon singl agent store call agent librari central agent manag server glue keith clark receiv request launch agent interact server step launch agent infrastructur develop concret agent base applic agent layer manag telecommun network commun control softwar control condit offic accord locat prefer occup architectur present gener architectur target compon orient agent construct number design address aspect agent base bdi blackboard base architectur work present paper cover commun infrastructur point view explicit work semant messag exchang support complex protocol compon agent issu address detail protocol complex interact implement exist infrastructur refer tina ieee commun march anderson intellig network iee tutori intellig energi save ad custom intellig build al system pattern orient softwar architectur wilei barbuceanu fox architectur af agent build shell intellig agent agent page springer cooper intellig agent telecommun network manag applic technic bt technic open agent architectur huhn read page morgan agent commun semant base success satisfact intellig agent intern workshop agent languag lectur note artifici intellig cockburn jen distribut artifici intellig system industri applic foundat distribut artifici chapter page john wilei compon base agent construct agent object knowledg base state intern confer system decemb clark har languag cooper inform system papazogl cooper inform trend direct demazeau jean pierr uller artifici intellig demazeau jean pierr artifici page elsevi scienc foundat intellig physic agent agent commun languag technic al intellig network overview ieee commun march comparison tina servic scenario iee tutori intellig editor imagin final report lp kaelbl situat automata approach design system sigart kuokka kqml matchmak intern confer page kinni agenti agent interact model intellig agent intern workshop agent languag lectur note artifici intellig kendal design pattern develop multiag system zhang methodolog applic springer lesser daniel corkil distribut vehicl monitor tool investig problem solv network ai page fall mae agent network architectur sigart clark april agent process interact languag intellig april refer manual technic fujitsu laboratori compon papazogl cooper inform trend direct blackboard blackboard model problem solv evolut blackboard architectur ai page summer agent object knowledg base state ic februari harkei program java corba john wilei edward essenti distribut object surviv guid john wilei clark intellig agent telecom applic workshop european confer artifici august smith contract net high level commun control distribut problem solver bond read distribut artifici intellig morgan inou tina initi ieee commun march
DB/1015 3 search document intranet van peter mg aper twent depart comput scienc netherland abstract search document internet todai search base word satisfactori result improv content document account extens markup languag enabl semant tag make structur document explicit describ document syntact level ideal situat xml tag defin document semant level realiz author document describ relev concept mean tag design schema approach user search document present graphic descript describ concept defin intranet interfac user formul queri navig relev web page realiz idea build architectur base concept prototyp run semant organ introduct problem statement search engin improv search internet intranet current search engin provid desir function keyword interest topic search engin return huge list irrelev document approach find document search navig approach uncertain highli relev document miss path lead desir document chang time result improv structur document account extens markup languag semant tag make structur document explicit lead tag describ concept document syntact level ideal concept document defin semant level altern base idea exist idea technolog author document enrich document semant provid mean describ concept defin document semant design schema support search document semant graphic schema user select relev concept relationship queri process techniqu formul queri schema appli approach entir www gener agreement usag tag focu limit control organ familiar concept document defin semant mean relev tag document document intranet spread intent store document central make store refer concept defin document defin schema interfac gather semant inform objectori schema schema make class diagram notat unifi model languag schema built queri search document state art deriv xml data directli document tag result structur describ structur document syntact level context data structur examin approach queri tree weboql lorel approach work context document defin gener addit inform requir describ semant mean concept defin document describ semant document central issu project tag enhanc html document semant project templat access local search araneu concern model queri method web make web access approach semant schema model concept defin describ structur document organ paper content paper organ section describ scheme defin concept document semant level scheme form basi search base document structur illustr idea base lone planet destin page implement issu architectur design approach explain section section discuss futur work semant schema introduc schema describ concept intranet intend realiz goal syntact concept defin document author describ semant mean concept schema section describ semant schema deriv goal concern queri interfac interfac user graphic schema describ concept relationship select relev concept user construct queri section interfac discuss detail deriv semant schema concept document xml author longer limit prescrib set tag defin html markup document xml author free defin tag describ content document accur document type descript describ element attribut valid document make xml good vehicl describ concept document syntact level explain describ concept semant class diagram techniqu unifi model languag uml framework design techniqu model defin concept class mean attribut semant instanc concept defin tag figur relat tag xml document uml class diagram illustr uml class diagram repres semant concept defin instanti tag xml document figur map tag uml class diagram topic entir world wide web singl schema expect document deal relat topic assum control organ familiar context document organ made distinguish set relev concept set concept defin global repres main topic dealt document intranet prevent author redefin concept document concept inappropri schema grow arbitrarili larg unmanag defin concept advanc author defin introduc tag extend schema captur semant definit concept global enabl newli defin concept task defin semant concept schema simplifi author refer concept defin standard core rdf internet level integr standard approach larger domain internet cover illustr tabl fragment xml document dtd lone planet attribut associ uml class diagram relat tag xml instanc concept base destin page lone planet tabl xml fragment destin san francisco fragment document type tabl dtd describ concept syntact level deriv complet semant schema describ element attribut defin refer attribut associ uml class diagram figur class diagram class diagram easili element attribut declar dtd cover class diagram describ context syntax concept class diagram associ fact connect class destin belong categori class categori defin abstract found xml document contribut fold make schema add extra semant mean concept figur uml class diagram lone planet destin queri intranet base semant schema semant schema deriv describ concept defin user start queri intranet base schema graphic view part semant schema user view select relev concept adjust view desir concept queri fill attribut interest queri grow size schema grow larger prevent view schema user start view subset entir semant schema start point global previou schema describ relev concept question schema user easili chang view find concept lone planet user search destin give document describ specif keyword attract locat locat specif user find element interest select attribut associ fill valu keyword locat queri process underli object server give locat link destin classifi countri user follow procedur queri queri slightli expect document locat refer document describ destin countri queri search relat place constraint concept defin document implement realiz idea design architectur illustr figur architectur xml document left intact origin locat index concept document store system base architectur bottom layer implement object server physic layer extens parallel kernel base binari relat data develop amsterdam cwi provid data independ logic layer extens object data base object form basic structur primit concept case inherit monet kernel assum atom data model extens structur level structur type defin exist structur design structur set time process complex user defin object time case oodbmss structur object hidden physic level optim queri execut plan figur architectur search engin sequenc method call imposs object algebra consist oper defin type constructor applic geograph inform inform retriev integr structur semistructur data conceptu level compon schema interfac queri interfac function compon section schema interfac uml class diagram build store data dictionari queri interfac composit oql base map object algebra queri processor longer term aim realiz full fledg multimedia search engin engin support queri process semant content complex multimedia document framework base support content base inform retriev multimedia object realiz improv search facil document intranet introduc exist technolog search web keyword search document intranet base search concept defin concept defin level tag xml document describ concept syntact level defin concept semant author describ context concept defin schema class diagram model techniqu uml semant schema present user search intranet select relev concept relationship queri realiz defin schema interfac queri make object server base monet object server function store refer document concept defin intranet futur work futur work work idea implement level enhanc queri facil schema interfac desir function fulli support search document semant level hand concentr integr framework multimedia inform retriev search engin support search base concept content complex multimedia document refer arocena ao mendelzon restructur web fourteenth ieee intern confer data engin wiener lorel queri languag semistructur data page apr ml kersten architectur optim memori access intern confer larg buneman semistructur data ml kersten flatten object algebra provid perform df ac framework uml approach studer high idea intern flair confer konopnicki shmueli www inform gather queri languag system acm septemb milo queri world wide web journal digit page april merialdo queri web view technic dipartimento di informatica universita di roma march resourc descript framework technic world wide web consortium februari ap de vri multimedia queri process extens twent workshop languag technolog multimedia inform decemb wolf dublin core metadata resourc discoveri internet septemb van road intern advanc geograph inform novemb extens markup languag technic world wide web consortium februari van wilschut model queri semistructur data workshop queri process semistructur data data januari
ML/1016 6 ë ø áø óò øó óö ø £ òóø óö øó ë èöó natur hybrid speci scienc franci power equilibrium model abil produc structur game assumpt ration statist model learn strive parsimoni predict time path actual observ accur theori learn model formula predict futur choic past experi popul free paramet typic estim data paper describ theori learn game call paramet lite predict time path individu behavior game initi includ game behavior observ kei innov lite replac paramet valu tion player vari time period replac paramet function kill bird stone bird explain estim model paramet valu vari game earlier research function lite reproduc ferenc function interact experi game structur parsimoni replac paramet lite free paramet estim priori captur sensit player numer rate imposs theori predict game lite lite predict data data compar gener version belief reinforc equilibrium lite tend predict version reinforc predict forecast introduc criterion judg goal predict lite reduc theori set experi econom econom theori measur model forecast behavior player improv player forecast substitut player actual choic lite highest econom paramet gener game studi lite narrowli explain learn extens appli set evolut econom institut internet auction investor learn equiti market consum choic ant theori ho chong predict product choic consum reader interest learn set interest subject learn game understand learn lab understand learn learn limit earlier work model learn call attract theori ho learn attract base experi design hybrid reinforc belief studi learn game model wrap parametr skin special case boundari paramet space attract determin probabl strategi function strategi initi attract denot estim free paramet theori initi period denot jth strategi chosen strategi player theori fewer paramet lead theori market predict player indic function attract updat equat experi weight updat weight imagin psycholog strength counterfactu reliabl inform decai previou attract due forget ignor experi learn environ chang control rate attract grow attract reinforc decai lag attract cumul growth rate attract import model attract determin spread choic probabl initi experi weight strength prior belief estim data plai minor role predict restrict lite updat equat assum subject strategi chosen xin wang appli model game subject learn experi yan chen similar extens earlier work restrict experi updat inequ separ switch notat denomin denot singl notat shift make control cumul versu averag transpar function map attract sensit mi kei insight earlier work reinforc belief learn close relat interest rule model chosen strategi origin studi anim learn rule simpler form cumul reinforc model studi roth robert bush frederick john patrick brian rule averag reinforc model greg robert rule belief learn weight plai rule show belief learn fundament reinforc kind reinforc strategi reinforc strongli chosen attract averag relat learn rule cube show paramet valu figur point cube tripl paramet valu updat equat initi cube show famili learn rule corner vertic cube correspond boundari special case corner cube á dynam standard plai julia edg connect class weight plai rule previou work compar rule power function attract exponenti slightli depend evalu denomin attract updat equat rule divid power conserv freedom cheung daniel pp drew david pp ed edg averag cumul choic reinforc rule cube visual aid show relat theori bet psycholog plausibl learn rule paramet valu interior cube vertic corner franci suggest quot open hybrid work reinforc theori ignor belief learn weight plai ignor receiv put reinforc model assum receiv matter belief learn matter intuit plausibl includ intermedi estim valu result subject learn reinforc weight direct test heterogen show estim david shown data set gener predict accur special case reinforc weight game equilibrium model improv nash critic free paramet lite answer critic simpler reinforc belief model figur show estim paramet tripl twenti game point correspond game special case theori good approxim peopl gener behav paramet cluster corner vertex theori assumpt reject studi compar inform barri john van raymond frederick substanti evid peopl opportun cost compar cost daniel jack richard receiv opportun cost paramet tend cube estim coordin game high valu estim mix game tend averag reinforc corner critic estim paramet valu vari game parametr variat characterist learn vincent cheung al note earlier work found paramet similar constant sum game research lead pessimist imposs predict behavior lite map game paramet make predict game lite lite replac central paramet determinist experi function determin paramet valu player plug updat equat determin attract updat attract determin choic abil standard method optim function decai rate á interpret interpret carri reinforc model anim learn forget import variat game player percept quickli learn environ chang physic chang detector secur system smoke challeng detect chang mistak chang core function player strategi window period averag strategi previou period minim support nash function term rel frequenc inform strategi appli strategi row term element vector simpli count strategi plai period divid term pt rel frequenc count strategi period measur element frequenc squar sum strategi maximum function normal divid sum squar subtract normal recent observ deviat lot previou deviat strategi frequenc high low recent observ high kei model á close persist chang danger á low give low weight previou attract summar previou experi function dip lowest extrem case strategi plai strategi plai express declin gracefulli string ident choic grow longer valu make ident choic row choic bigger lower á put higher decai experi interest special case strategi plai period strategi plai period true game case game multipl frequenc count relev aggreg statist median action frequenc count median strategi player period larg strategi order strategi start asymptot neglect import smallest support nash equilibria number strategi plai posit game pure strategi game mix equilibria larger amount period period chang expect number strategi posit roughli variat previou observ averag smooth perceiv chang weight settl á appeal reason chang recogn fact good strategi environ obviou rout set belief learn poorli mix game close explor person histori judg custom valu player player move period anticip earn strategi int player simpli repeat previou choic give player score period player move repeat choic post score player averag score previou period approach person behavior identifi la consum theori approach captur import player game pure equilibria game mix equilibria lower mix game mix equilibria player choic lead low valu approach stronger axiomat earlier research guid opt research wai improv lite attack strateg environ chang inform past good guid futur choic receiv reinforc strongli weight reason essenti attract larg updat reinforc chosen strategi weight partial inform player lag attract previou choic strongli reinforc reason reinforc chosen strategi strongli environ model behavior player repeat danger environ chang reason greater game mix equilibria player lower á procedur ration player suspect sophist guess learn competit game mix make player choic make vulner exploit game match penni player strategi make multipli loss scale high impli switch win make predict exploit lose freez danger speci adapt predat detect movement recogn prei part human brain process emot commun cortex control joseph statu bia refer prefer choic made choic assign randomli william richard experi show statu bia stronger option switch option captur model put reinforc statu put reinforc altern strategi declin model switch strateg advantag characterist simpli predict familiar reinforc belief kei reason estim game gener game equilibria lower game mix equilibria push push close game mix enabl function predict game estim model promin special case exploit paramet paramet control growth rate attract attract weight averag lag attract initi attract scale attract bound grow mean predict sharp converg period probabl sharp converg probabl highest lowest choic depend enc multipli sensit attract bound attract grow larg remedi higher predict behavior sharp earli contrari attract cumul previou attract grow larger multipl choic probabl grow interpret extent player rel quickli learn switch constant choic strategi perform past player constantli track ag player commit averag previou larger averag strategi model move player shift exploit learn mean player basic reward strategi simpli chosen empir line argument suggest variat frequent player strategi track explor exploit player past behavior explor exploit switch explor versu exploit measur spread probabl player observ choic standard measur spread gini typic measur incom inequ gini choic proport akin player probabilist spread gini low player lock probabl alloc gini high calcul gini rank strategi observ choic denot choic proport strategi plot cumul probabl distribut measur total probabl strategi frequent calcul linear interpol creat function connect point gini area ident line interpol function pass normal gini rang strategi plai equal strategi plai normal gini strategi frequenc exploit studi formal literatur interest comput scientist design machin richard sutton andrew sum squar index measur industri concentr number low xm rank lowest function thought player track actual choic frequenc spread player explor attract low attract continu averag learn strategi begin exploit learn exploit requir strategi chosen attract strategi attract grow larger larger simpli chosen function strategi cumul captur exploit strategi relat idea familiar explain economi return urn start distribut ball red red ball red ball draw gener chanc occur simpl model return red make red interest mathemat properti gini captur similar process strategi chosen lead mean strategi cumul cumul favor chosen strategi chosen chosen urn median action rel choic frequenc player period action interpret lite paramet function ground principl familiar game theorist principl bayesian lead model lite strive altern model necessarili lite paramet function thought procedur nal herbert simon design accomplish predict perform wide rang game imagin optim learn rule maxim expect wide rang game conjectur rule lite familiar rule plai good properti environ respond rapidli environ quickli game mix equilibria weight plai stationari environ mix pick lite automat base observ deriv global ration approach approach work machin develop robust heurist learn wide varieti environ sutton barto good learn rule provabl optim perform tricki test case lifelik problem good robot perform rug pattern lite advantag easi free estim simpl plai reinforc theori empir analysi ground parsimoni easili conceiv ant problem compar valu game requir standard unit currenc monei earn constant produc behavior requir valu richard thoma roberto model implicitli assum strategi attract calibr monei term drive choic probabl frame matter player sensit percentag absolut implement lite attract advantag paramet lite natur vari time peopl principl captur individu experi experi game equilibria subject explicitli random strategi chapter subject plai pure strategi plai mixtur individu plai easili express tend paramet vari advantag lite mimic reduc form recal paramet correspond special rule cumul choic paramet chang rule switch rule rule player chang due experi dale tim time player switch dynam plai rise player switch reinforc belief learn rule learn gener rang learn permiss import competitor model paramet lite repair weak reinforc belief learn prove robust game reinforc learn fall short assum incorrectli player inform choic reinforc rate learn game larg strategi space player initi strategi part switch strategi part space game explain act lower posit constant ad john david show data price product categori eventu understood theori vari game develop goal ambiti scope paper divid strategi chosen late game rare pick earli reinforc reinforc movement game earn period reinforc auction labor evid travel dilemma game belief learn weak belief model learn quickli game shift support give readi explan decai rate previou observ game observ decai rapidli divid beauti contest game game mix equilibria patent race game confront brand belief learn theori guess dynam standard plai predict lite predict variat function initi condit game structur form lite model requir inform initi tion rel frequenc inform structur minim support nash equilibria practic pin boil guess game symmetr mix equilibria strategi applic game control guess larger hard lite interpret procedur ration learn rule attempt adapt natur learn featur environ good decai game player learn outcom noisi game mix good learn rule larg sampl past experi reinforc learn speed player reinforc rel ration level aspir level requir initi level adjust rate gener reinforc extra strategi probabl lag attract aspir evolv endogen time requir free paramet game learn player low stale experi quickli discard contest ho model error mix game game challeng creat function low high depend data player lite predict game section compar predict accuraci learn model paramet freeli check lite function produc paramet similar estim valu game uniqu mix strategi equilibrium patent race game order statist coordin game player richard coordin converg behavior extrem sensit initi condit joseph coordin game entri market size contest keith travel dilemma game jacob rosario gomez charl tabl summar featur game data game detail goal lite explain variat model sampl class game sampl wide good test robust model learn game game studi game studi van al player integ strategi earn linearli group median linearli squar deviat contest game player number player closest top time averag earn prize equal coordin game player simultan enter larg small market earn divid number enter larg market equilibrium estim method estim procedur lite sketch detail appendix game subject plai round player likelihood function observ choic histori joint likelihood observ player choic ps model initi attract correspond choic probabl match actual popul frequenc choic period estim data initi choic unavail theori initi plai detail appendix initi paramet valu initi valu averag valu determin weight initi function approach sampl randomli class result sensit class game chosen small departur earlier work estim free paramet estim game studi strategi integ price reluct ad hoc function form gener distribut mixtur random behavior belief behav gener good guess player period game behavior predict choic beauti divid larg pot choic game strong weak travel dilemma game combin guess random initi behavior good approxim player period initi attract initi paramet attract updat ing formula lite paramet updat function maximum likelihood estim data subject frozen forecast behavior entir path main subject convert dollar import addit estim model ho version reinforc model put model forc belief model initi attract consist common initi belief earlier simpli burn data model version reinforc version includ experi weight paper form model roth model roth roth al approach set á updat chosen probabl divid attract measur variabl appendix report result latest reinforc model perform earlier reinforc model similar equilibrium model appendix static departur earlier observ forecast earlier hybrid holdout sampl consist period entir path subject result method interestingli ignor interest approach individu rule learn rolf chapter detail switch belief model lot game game mix equilibrium strategi weakli rare chosen prior belief assign expect strategi expect strategi stochast domin strategi chosen competit nash equilibrium model predict accuraci question answer model predict basi paramet estim separ guard estim paramet subject mate predict choic remain estim report hit rate fraction choic predict bayesian inform criterion subtract penalti bic penalti inform criteria valid report hit rate ll tabl show result game criterion print hit rate statist indistinguish mcnemar good theori judg hit bic ll game lite higher equal hit rate model game reinforc pv bic game learn belief learn worst bic hit rate forecast worst game mix equilibria model equal good bottom line panel tabl show result singl set common paramet estim game lite captur paramet game predict compar game pool lite predict criteria data pool discuss model includ recent measur penal theori function form number free paramet note squar deviat squar error criterion measur penal complex theori bayesian model select reduc bic model prior paramet valu tough test robust estim paramet game paramet predict choic remain game game predict narrow class game game mix symmetr result test model coordin predict behavior game mix equilibrium tabl report result kind predict lite highest hit rate highest game reinforc pv predict game game biggest loser belief model lower model criterion point lite structur featur game player experi creat paramet valu close estim game figur show lite function valu estim pair connect point repres game pool estim open circl estim lite function close chord connect point short squar chord short half game deviat function averag estim á dimens correl estim function averag game pool estim detail report tabl appendix estim model standard tabl appendix show lite function valu vari time period peopl variat rang typic interest except game mix equilibria rang subject averag game mean subject roughli pure strategi mix strategi show potenti lite approach detect correspond basic estim vari lite individu show predict rel frequenc game ing graph game chose game interest enc visibl ey repres uniqu multipl pure game uniqu mix strategi patent race patent race game strong endow resourc compet patent race strong player endow invest integ amount endow player invest simultan earn minu invest invest strictli lose invest equal player game interest strateg structur strong player invest entir endow weak strictli domin invest elimin strong player domin make invest domin weak player iter player delet strategi iter applic strict domin uniqu mix equilibrium strong player invest time plai strategi time thirti pair subject plai game random match protocol time role switch pair divid group random match occur group choic frequenc chang visibl websit gauss program reader estim reader send receiv estim back lite model month time plot frequenc transit period strategi strong estim pool ject player result figur show empir transit matrix predict transit frequenc model strong player kei featur data lot transit roughli equal number transit vice versa model predict transit learn model predict transit belief learn poorli belief learn belief learn assum full predict player move chosen strategi strategi note equilibrium weak player abandon hope invest half time strong player invest half time earn earn invest weak player invest belief model predict switch invest evid data reinforc approach explain infrequ transit multipli higher case strong player invest weak player invest low switch avoid predict mistak inher belief learn game multipl pure strategi divid game van al studi coordin game multipl equilibria extrem sensit initi call divid game game shown tabl subject plai peopl subject integ depend choic median choic player matrix construct pure equilibria median bold correspond bifurc median start virtual sort learn dynam lead player equilibrium median start learn eventu converg equilibrium equilibrium shown bold ital half game captur possibl extrem sensit initi condit experi subject plai period end period subject learn plai group partner protocol amount penni figur show empir frequenc model predict kei featur data bifurc time choic middl rang equilibria choic cluster extrem group median converg low notic strategi chosen earli frequent chosen notic strategi frequent chosen earli period chosen period good model captur subtl low choic quickli frequent choic choic quickli frequent choic poorli predict movement belief learn reproduc asymmetri sharp converg high equilibrium frequenc low equilibrium reason diagnost subtl weak belief learn note tabl gradient equilibria number high low number high low cost belief learn comput expect rule mean expect choic fact gradient mean spread probabl equilibria belief learn predict similar probabl distribut high low equilibria reinforc model gener trick combin cumul high larger receiv time larger low equilibrium explain sharper converg reinforc pv predict frequenc choic low predict substanti earli choic strategi declin time model probabl grow avoid larg likelihood penalti miss rare choic game pure strategi travel dilemma al studi player number claim player receiv amount claim claim receiv lower claim person make lower claim receiv bonu person make higher claim pai penalti claim xi player median earn player receiv grow larger fall lite estim cumul averag contribut explain expect time game imperfect competit seller sell product lowest price consum shop seller lowest price earn reward seller reput loss nash equilibrium predict lowest claim chosen player predict insensit experi group subject vari level subject plai time plai figur show empir frequenc model valu give roughli similar result illustr model wide rang price round price gradual round round equilibrium round predict spike equilibrium equilibria move sharpli probabl price rang sharp spike intermedi explain combin initi sharp converg period model predict correct direct number interv choic problem incent travel dilemma undercut player price player frequent coupl period pai higher number belief model estim larg burden histor inform model react quickli frequent choic late game model explain sharp converg late period cumul player player chose reinforc reinforc strongli reinforc repeat choic belief subject unmatch avoid make ad hoc assumpt learn behavior unmatch subject reinforc predict move contrari reinforc model reason hit rate highest spike graph correspond spike predict learn data spike high player predict move model explain player learn rapidli model variabl á variabl term predict econom learn model criteria judg predict accuraci model pure roughli familiar statist econom applic theori demand measur good theori worth section measur econom learn theori ho theori econom subject substitut learn theori base theori predict actual choic treat theori similar advic servic measur econom qualiti client advic measur econom model paramet player observ period gener model predict predict probabl distribut choic produc choic highest expect compar make choic player target player actual choic econom good measur full distribut predict player econom impact choic method estim model estim appendix tabl estim game comput econom seventh game tabl data game give advic subject game client larg sampl experi situat analyst estim paramet data game client situat direct experi analyst estim paramet econom gener fall bound econom comput wai note control recommend choic futur behavior small case studi tabl show econom percentag improv subject model recommend actual choic model posit econom game gener estim higher paramet estim game method paramet lite econom game analysi tabl show lite add larg major subject estim pot note percentag improv small observ optim perfectli player put upper bound absolut player chose divid game theori futur period continu assum subject chose note coordin contest game median averag comput group chang player choic behavior travel dilemma player randomli chang player current choic current partner futur partner substanti mix patent race pot game small number subject obviou run experi subject learn model make compar perform actual subject game estim econom subject make choic learn theori recommend econom divid perfect forecast improv lite improv lite forecast improv largest improv belief learn posit econom game reinforc neg econom game divid reinforc rapidli player move middl gi player switch low high strategi quickli turn bad advic beauti contest game similar reinforc predict learn player chose number low learn import econom equilibrium theori suggest limit point learn process permit compar static analysi learn time path behavior select equilibrium theori prove ten theori individu learn game data laboratori game good control player inform incent reinforc learn plai belief simpl free paramet estim simpl theori advantag parsimoni miss import featur empir data improv ad featur judici theori complex appli game standard proof healthi controversi emerg model earlier theori parametr middl road hybrid featur reinforc belief necessarili add paramet estim dozen mental data set show ad featur improv predict paramet valu maxim typic ent game question predict advanc paramet valu game theori replac paramet learn model function chang time experi function á behavior player dip behavior á dip experi attract cumul averag previou diminish decai attract lot simpli á divid minim number strategi equilibrium function ti game mix equilibria function index concentr choic normal gini player lot yield low lock singl choic lite parsimoni learn theori free predict data game previou model ment equilibrium note lite free reinforc belief learn report complex theori bayesian inform predict accuraci complex model necessarili kei result lite solv potenti problem applic model game endogen paramet predict accur produc function paramet valu track estim valu close game lite erat paramet variat predict model game pool common paramet estim criterion judg call econom theori econom tal subject earn theori advic make choic lite add econom add posit major depend paramet estim provid advic reinforc model neg econom game bottom criteria theori result sensit game sensit perform criteria coordin lite predict add econom game reinforc model statist add similar econom belief model lite simpler learn theori reliabl step research appli lite wider set game axiomat underpin admittedli ad hoc extend function exploit inform order strategi prove lite build block extend learn theori includ sophist anticip explain behavior repeat game ho david cooper john theori develop bigger applic situat learn theori econom predict economi theori equilibrium institut match medic resid medic analog match colleg colleg bowl develop decad bidder ebai auction learn bid late hide inform object common ali consum learn time product learn market gener excess volatil return ration expect model thoma argu learn expect phillip curv public percept explain behavior coupl decad good theori learn explain pattern predict institut rapidli bidder learn product succe appli lite domain import goal futur research refer learn game group market depart work econom pp econom agent act human behavior approach bound american econom pp patrick reserv price endogen empir insight ebai work depart stanford travel paradox ration game american econom pp solut game fictiti activ analysi product john wilei robert stochast model behavior game experi strateg princeton colin attract learn coordin probabl heterogen nal mathemat pp colin weight attract learn normal form pp colin learn teach learn partial market depart work paper ing strateg teach repeat market depart work paper david learn call market depart work paper rosario behavior travel american econom june pp yan limit work depart ann learn normal form laboratori game econom pp david john learn transfer signal game ment case western reserv vincent dynam coordin pp franci mad theori adapt learn econom bridg peopl plai ment learn game mix strategi american econom pp ad reinforc learn model speed journal econom behavior pp drew david theori learn mit alloc dale empir model equilibrium select symmetr texa depart econom work januari evolutionari stabl journal ical pp dana adapt chicago work parsimoni model market depart work paper colin domin erat american econom pp compet model peopl learn edinburgh pittsburgh work jack richard endow loss statu journal econom winter emot mysteri underpin tional york simon patrick approach annal oper pp richard equilibria normal form game econom thoma magnitud heterogen behavior game uniqu mix strategi journal econom behavior behavior match penni game econom pp cost game econom pp import complex inn model journal mathemat pp david competit quarterli journal pp reinforc ing market entri game econom pp strategi iter tion strongli domin investig state journal econom behavior pp iter method solv annal pp imperfect institut relat time market american econom data simpl dynam model intermedi game econom pp ing econom predict harvard work learn learn behavior normal form caltech work william bia journal risk march pp american princeton reinhard behavior sequenc finit oner dilemma learn theori journal econom behavior pp dale ration rule learn guess game econom pp dale learn learn texa austin work dale rule theori game econom richard reinforc mit allan learn market gener excess volatil predict stock price quarterli journal novemb pp van raymond cooper strateg coordin american econom pp van raymond dynam adapt behavior work depart texa van joseph behavior coordin journal econom behavior pp appendix calcul initi attract initi actual observ frequenc choic subject period initi attract game player median action contest group player initi attract base group observ frequenc sensit initi attract chosen predict probabl choic match actual rel frequenc choic denot empir observ frequenc strategi period initi attract recov equat ke initi attract maxim likelihood period separ rest algebra show initi attract solv function initi attract lowest constant lowest frequenc circumv problem ad constant frequenc renorm fj chosen rel proport equilibrium point respect number strategi fj place solv attract function frequenc ensur model obtain unfair advantag burn period predict model model learn discuss provid model remain reinforc model updat rule predict probabl mi evid predict probabl function dict probabl sensit paramet predict probabl deriv nonlinear simultan equat solv nonlinear equat numer iter substitut converg set consist predict probabl reinforc model variabl updat rule updat replac chosen int chosen int number strategi updat expect random choic assum random choic player comput empir distribut player period choic model ensur reinforc model variabl foot model period burn initi attract expect absolut strategi paramet estim function valu tabl paramet estim standard error learn model note standard error suggest paramet statist tabl show rang lite function valu time subject rang small tabl descript game estim learn model game number number number pure number number match descript game player strategi strategi equilibria subject round protocol treatment mix strategi fix stake size game uniqu mix strategi equilibrium patent race random strong weak strong player invest higher invest win fix prize divid fix coordin game pure strategi van al equilibria median action fix game individu payoff van al distanc individu choic median pot game fix number player entri game player decid ho size enter payoff ratio size number entri travel dilemma random penalti size player claim al player lower claim player pai penalti player contest fix experienc inexperienc player simultan number ho al winner number time group averag note continu strategi discret integ strategi tabl model fit predict hit bic log sampl size bic calibr lite reinforc pv bic bic bic bic mix strategi patent race divid median action pot game travel dilemma contest pool valid sampl lite reinforc pv size ll ll ll ll ll mix strategi patent race divid median action pot game travel dilemma contest pool note number hit count occas maximum count adjust number strategi share maximum note bic inform ll number number subject number period note common set estim game game equal weight ll estim note entri bold denot measur game case hit multipl model share top rank differ hit rate model statist mcnemar test entri note calibr observ subject observ subject ho tabl model robust predict predict estim sampl size ll ll ll ll ll mix strategi patent race lite reinforc pv divid median action pot game travel dilemma contest note game made estim deriv pool game tabl divid van al median choic choic tabl econom valu estim total payoff percentag improv subject estim observ reinforc pv payoff mix strategi patent race lite divid median action pot game travel dilemma contest total payoff percentag improv subject estim observ payoff mix strategi patent race lite reinforc pv divid median action pot game travel dilemma contest note assum subject respect model predict behavior respond strategi yield highest expect payoff note expect strategi game comput simul instanc round due high comput burden actual deriv tabl subject equal payoff estim number subject equal payoff estim total lite reinforc pv subject improv improv improv improv improv mix strategi patent race divid median action pot game travel dilemma contest number subject equal payoff estim total lite reinforc pv subject improv improv improv improv improv mix strategi patent race divid median action pot game travel dilemma contest tabl paramet estim learn model φ δ λ lite mix strategi patent race divid median action pot game travel dilemma contest pool φ δ λ mix strategi patent race divid median action pot game travel dilemma contest pool φ δ λ mix strategi patent race divid median action pot game travel dilemma contest pool φ δ reinforc pv λ mix strategi patent race divid median action pot game travel dilemma contest pool φ δ λ mix strategi patent race divid median action pot game travel dilemma contest pool note averag paramet subject time note model common set estim game pool note fix paramet note bound note payoff game rescal averag game specif lambda report pool game tabl variat lite function valu rang time median rang φ δ median rang median rang mix strategi patent race divid median action pot game travel dilemma contest pool rang subject φ δ median rang median rang median rang mix strategi patent race divid median action pot game travel dilemma contest pool note averag time period percentil deriv rang note averag subject percentil deriv rang note median averag valu calcul respect note note percentil median fictiti plai averag reinforc figur model parametr space weight fictiti plai cumul reinforc rel freq rel freq rel freq figur empir transit strategi figur parametr strategi figur choic reinforc pv strategi figur transit matric patent race strategi strategi strategi rel freq rel freq rel freq figur lite strategi figur strategi figur equilibrium strategi strategi strategi strategi figur empir frequenc model predict divid strategi figur empir frequenc period strategi figur parametr period strategi figur choic reinforc pv period prob prob prob strategi figur lite period strategi figur period strategi figur equilibrium period prob prob prob period period period figur empir frequenc model predict travel dilemma figur empir frequenc figur parametr figur choic reinforc pv strategi strategi strategi prob prob prob period period period figur lite figur figur equilibrium strategi strategi strategi prob prob prob
Agents/1017 1 autonom web agent automat retriev identif interest public kurt bollack steve lawrenc lee gile texa austin nec research institut maryland tx nj colleg md abstract publish research paper world wide web poorli exist form quantiti daili amount time effort commonli find interest relev public web develop web base inform agent assist user process perform scientif literatur search set agent web search engin heurist locat download paper paper order extract inform featur abstract individu identifi citat sql agent web interfac find relev paper keyword navig link paper form citat link public addit simpl keyword agent find paper similar paper word inform analyz common citat made paper introduct scientif research attempt add bodi human realm research research potenti duplic perform work literatur search relev publish research result gener avoid duplic work publish scientif research paper document scholarli journal confer time lag complet research avail public world wide web import distribut medium scientif research web public print public journal confer order current quickli advanc research web download paper made author problem search current relev publish research exponenti growth literatur web make literatur easier public encourag intern acm confer autonom pp acm copyright acm public rate web base research public tend poorli organ institut research organiz spread web potenti import advantag web base scientif literatur articl web retriev process autonom agent easili print document agent search web provid autom mean judg relev publish research search engin web commonli method find interest public web combin web search engin manual web web search engin altavista index text web user find inform keyword search research public web made html make text paper searchabl web search engin publish research paper web postscript form preserv format html text paper index search engin requir research locat page link paper search paper titl author agent assist find relev public method find literatur search engin requir great deal repetit user order reach point user read part document determin interest paper immedi potenti interest paper practic order assist user find relev web base research develop improv manual process autom slow process find retriev web base public potenti relev paper guid user interest paper make searchabl relev paper user suggest relat paper similar measur deriv semant featur retriev document oper simpl set broad topic web search engin heurist locat download paper potenti relev user topic download paper extract semant includ citat word frequenc inform inform store user search citat base link find relat paper agent automat find paper similar paper interest semant featur inform previou research design benefit broad line previou research work area assist softwar agent line previou research investig semant distanc measur text document agent simul user concept document similar import featur form semant distanc measur citat index record publish research citat public assist agent assist agent defin agent design assist user softwar system perform task behalf make interact softwar system easier effici web base assist agent construct user find interest relev world wide web page quickli easili overview learn user feedback environ word vector featur find relev web page interest relev web page learn agent system agent learn feedback user heurist web agent find citat paper world wide web differ previou web agent creat custom part web local creat structur document download web easili search simpl list url present search insid postscript previou search engin agent semant distanc measur set document text interest estim human notion distanc measur document awar commonli type model string distanc edit distanc measur consid distanc amount differ string symbol distanc earli edit distanc differ text string simpli number substitut letter transform string recent sophist string distanc base algorithm optim weight match letter type text string distanc measur base statist word common set part corpu larg number document commonli form base word term frequenc document frequenc dictionari word corpu document common call stop comput effici stem word consid complet word stem heurist introduc porter return stem form word simpli document frequenc word stem fd number document stem ns highest term frequenc call tfidf scheme word weight wd calcul wd ds dmax ns dj dmax total number document order find distanc simpl dot product word vector document calcul type semant distanc measur knowledg document compon structur case research public citat paper paper creat citat indic gaug document parasit system link referenc web page html structur referenc web page indic referenc page citat index refer scientif articl give credit previou work literatur thought link articl citat index refer articl link articl cite work citat semant featur research public determin relationship public citat indic origin design inform retriev paper locat independ word keyword document citat index navig backward time list cite forward time subsequ articl cite current articl make power tool literatur search exist commerci citat index provid institut scientif inform isi produc citat indic includ scienc citat index multidisciplinari citat index scientif period commerci citat index legal offer west group index case scientif research public indic departur commerci indic scientif literatur due automat creation autonom extract abil user creat user real time previou commerci indic accumul date relev literatur web citat cameron bibliograph citat link scholarli work describ system world publish research searchabl scholar internet access highli make power tool academ literatur research thought partial agent implement cameron call citat agent gather work point time import differ cameron citat requir extra effort part author placement work web automat creat document citat download cameron system author institut make citat specif format agent architectur agent consist main subag automat locat acquir research document parser browser interfac support search keyword citat link figur diagram architectur search web browser interfac search download text extractor document web queri postscript file text file record queri sql queri result sql queri queri result document architectur figur agent architectur document acquisit user oper straightforward user explor instanc agent creat topic step invoc search web page link research paper interest user invok give broad keyword agent web search engin heurist search page word agent locat download postscript file identifi extens duplic url postscript file avoid support format web base document vast major web base public make minor limit format futur convert document document process download document extract semant featur document instanc agent invok control perform organiz error log hardwar usag manag program extract desir document featur place sql ffl piec text url uniqu articl id number ffl word frequenc inform bodi document referenc document tabl ffl text citat made document document tabl field inform record tabl uniqu citat id number field ffl word frequenc citat citat ffl cluster number weight inform group ident citat form inform automat similar document retriev document search document watch download directori begin process document step document extract raw text postscript file program dec virtual paper project program extract ascii text format inform origin postscript text format format ascii text verifi valid research document includ check exist list refer end document check document languag attempt made correct page order page order document invalid document record skip heurist identifi valid ffl inform begin paper inform actual document text identif featur insid header perform ffl abstract text extract ffl word introduct section extract ffl list refer made document extract ffl word word frequenc record word document citat stop word record word stem porter algorithm set refer individu citat extract citat heurist extract year page citat tag citat tag inform citat cite citat bodi document word frequenc citat stop word remov stem appli document word frequenc extract citat tag find locat document bodi text citat made extract context citat heurist citat construct philosophi subfield citat uniform syntact indic posit composit previou year public exist citat digit number begin digit regular featur citat trend syntact relationship subfield identifi identifi guess desir subfield exist author inform titl publish titl compon agent document browser consist queri process user queri proper syntax return html format queri program web browser interfac queri process capabl user easili navig document search keyword emphasi link document find relat research paper access public keyword search queri user creat initi keyword demonstr note attempt index neural network public web user find cite paper jointli author gile chen citat word figur show result queri sampl neural network number document cite refer bracket refer total refer paper author neural network ident citat group algorithm group instanc cite document format cite page result keyword search document shown figur header inform document keyword bodi detail document found link page detail item figur shown figur list refer made document initi keyword search user link user find paper cite public paper cite includ context citat return paper author gile user paper cite articl learn unknown grammar recurr neural shown item figur refer work sampl neural network link refer send queri queri return result page shown figur user exact form link url cite context citat cite document user retriev detail cite document link cite document result queri format figur semant distanc measur mention refer previou semant distanc measur bodi text measur implement semant distanc measur applic word frequenc edit distanc group form citat develop mean citat frequenc inform find document relat user interest ident citat group citat articl made significantli wai extract neural network jh ra cj stone classif regress tree pacif olshen classif regress wadsworth breiman al classif regress tree suggest citat problem complet implement ident citat group method step method normal citat rule lower case remov punctuat match algorithm group ffl sort citat longest shortest citat ffl citat find group highest number match word ratio number word number match word ratio number phrase number match phrase phrase set success word section citat word add group creat group citat end citat close exist citat includ start group perform formal quantit evalu compar algorithm simpl baselin method base method found algorithm perform includ detail comparison due space find similar document user find document interest find relat document manual semant featur research public venu document mechan automat retriev relat document base distanc measur semant featur extract document home suggest citat articl higher order recurr network grammat advanc neural inform process system ds touretzki morgan san yc learn extract finit state automata recurr network neural extract learn unknown grammar recurr neural advanc neural inform process system san mateo chen transform invari high order correl neural net architectur ieee intern confer page octob singl layer recurr neural ieee transact neural vol pp gile machin learn higher order correl network physica nonlinear vol pp citat found figur result keyword search citat neural network comparison previou research previou web assist agent word frequenc inform automat measur relat document uncommon word share document simpli give evid document relat limit approach ambigu word phrase human limb weapon previou citat index agent index process complet automat autonom index articl found world wide web public delai print journal confer mean access articl recent document distanc measur method document similar measur common semant featur gaug document topic similar word vector implement tfidf scheme measur word stem document vector word stem valu repres document truncat top compon document comput evid truncat larg affect distanc measur string edit distanc measur determin document similar string distanc measur edit distanc header document match substr larger common word titl tend reduc distanc header common singl word power repres topic concept discuss research paper citat work hand pick paper author relat document intuit citat inform judg document common citat make estim document download research paper close relat document pick user citat document analog word orient tfidf word weight algorithm calcul document document interest document ident citat group algorithm entir document count frequent cite paper occur frequenc weight citat store valu tabl sql step execut time queri determin list citat weight document queri sql find set document fb share citat determin document sum weight citat share sort valu return document highest valu assum uncommon citat share weight home suggest neural dynam speech categor stephen ian michael depart cognit neural system center adapt system boston similar reson percept music meter edward larg john ohio state similar document found figur result keyword search document neural network highli citat made larg number document perform formal perform measur practic found perform word vector base automat similar document retriev combin citat base similar document retriev proven subject superior word vector base combin method document similar result final similar distanc measur accur singl method weight sum document similar measur combin similar comput combin calcul word citat similar measur normal measur scale repres semant ident repres complet document label normal similar measur document wv target document set candid document fb measur similar document measur step weight respect similar measur weight valu normal find combin similar measur document weight wv retriev document highest valu combin scheme weight properli logic perform singl similar measur method limit case weight perform method show true intend explor learn techniqu order automat determin weight function combin implement similar document document recommend mechan part process specif target user similar figur detail document return displai web browser futur work assist agent autom enhanc task find interest relev research public world wide web work practic tool save research great deal time effort process literatur search direct intend develop system semant distanc measur assist recommend interest document research paper automat download paper similar paper notifi user potenti interest research direct futur work collect statist number time journal cite give indic influenc academ commun rank paper number citat made rank base perform recommend user watch interest paper influenti author journal statist chang indic research trend intend measur enhanc perform exist bibliograph larg bibtex web bibtex inform potenti accur postscript home suggest reson percept music meter edward larg john ohio state document download connectionist approach music expect music composit question overshadow equal import question escap tempor percept music meter view percept metric structur dynam process tempor organ extern music event listen intern process mechan articl introduc connectionist base mathemat model capabl period compon incom rhythmic pattern network unit tempor structur rhythmic pattern result network behavior embodi percept metric structur articl conclud discuss implic approach theori metric structur music expect connect reson percept music meter similar citat made harvard dictionari music press harvard press track music beat real time intern comput music confer comput music associ van frequenc frequenc bifurc dynam movement system ge tutori motor behavior ii elsevi scienc publish model percept structur neural net comput music tempo adjust time delai learn advanc neural inform process system san morgan kaufman neural theori gate biolog citat figur detail document inform neural network inform simpl titl match made bibtex file creat postscript test data set measur citat perform refer institut scientif adapt web page recommend servic intern confer autonom agent citat catalyst reform scholarli commun mondai exploit learn technolog world wide web agent ieee colloquium intellig world wide web concept citat uniqu innov tool navig research literatur current content januari binari code capabl correct spuriou insert delet russian intellig agent citat find web technic report dept comput home suggest lee extract learn unknown grammar recurr neural network advanc neural inform process system paper cite learn sequenti task increment ad higher order mark ring unit ad reach arbitrarili distant past experi grammar demonstr speedup order magnitud recurr network introduct recurr network proven power train complet back propag time demonstr recurr network increment add node recurr algorithm superior recurr network network present combin advantag approach network lee extract learn unknown grammar recurr neural network advanc neural inform process sequenc learn increment neural network mark ring output ijk term notabl posit effect shown learn difficult task small number train sampl network weight number order good true gradient descent cumbersom method good perform recurr lee extract learn unknown grammar recurr neural network advanc neural inform process system figur detail citat inform neural network adapt retriev agent heurist neighborhood inform discoveri machin fourteenth intern confer pp inform discoveri filter multiag evolv ecosystem confer practic applic agent multiag technolog identifi interest web nation confer artifici intellig algorithm suffix program automat index bibliograph citat journal document weight approach automat text tech report dept comput cornel specif term valu automat index journal document mine structur inform web sixth intern world wide web confer chang web aaai spring symposium machin learn inform access technic paper intellig string comparison facil nec institut tech report data structur algorithm nearest neighbor search gener space symposium discret algorithm pp
HCI/1018 4 futur multimedia user interfac blair steven feiner columbia matter power eleg technolog underli multimedia user interfac ultim determin system provid overview emerg area research plai major role futur multimedia virtual environ ubiquit comput discuss describ relationship current multimedia system user interfac provid access virtual environ involv interact address spatial modal research goal provid video ubiquit comput requir multimedia network infrastructur support extrem interact larg number mobil wireless user arriv understand potenti introduc terminolog explain basic system architectur lead discuss kei current research issu futur direct introduct glanc recent confer interact reveal multimedia activ area research commun work current desktop comput environ workstat video displai keyboard audio goal examin companion set research area exist hardwar technolog peopl interact futur comput physic place comput occupi live function network technolog displai extrem larg graphic remain option handwrit speech recognit matur except wireless network connect comput stationari comput comput peopl gener justifi led mental singl supplement portabl comput capabl price current commod justifi situat chang major paradigm eventu redefin interact comput virtual environ ubiquit comput virtual environ world creat coupl interact devic displai power multimedia comput ubiquit comput term coin mark weiser describ futur surround everydai life multitud comput bare examin work field explor head review terminolog provid histor overview field reli larg larg hardwar provid introduct import hardwar issu descript kei approach system architectur current research build background provid section lai set current research issu direct futur work attempt wai virtual environ ubiquit comput complement creat excit form multimedia comput power approach make multimedia system multimedia system futur multimedia user interfac terminolog term refer concept discuss articl begin prefer term virtual world virtual environ commonli virtual realiti term virtual realiti technolog deliv media mean describ user interfac rang physic environ present displai ordinari graphic displai convent game virtual world virtual environ refer gener comput system interact devic attempt provid spatial tactil devic displai stereo displai visual hand haptic describ artifici realiti term coin krueger intend describ virtual environ refer virtual environ requir user wear special hardwar experi control virtual environ krueger built system base project displai track vincent augment realiti refer displai overlai graphic user view real world current system hmd al feiner al reason displai user head track enabl system render accur graphic regist properli real world refer precursor virtual environ hmd coupl pair camera remot locat user head remot camera move give strong system claim provid partial feel system user perform task typic manipul master control remot slave effector mimic master control movement slave effector signal back master forc feedback telerobot system control robot remot ubiquit comput refer environ larg number rang hundr unit seamlessli integr connect wireless network comput commonplac awar tool accomplish task weiser draw analog electr motor major small cheap awar motor dozen electr motor oper electr ignit ubiquit comput peopl comput track move comput adapt transpar prefer person notion comput comput awar user prefer respond predict unlik comput central focu simpli assist ubiquit comput comput stai background peopl concentr task ubiquit plenti term past small comput ambiti person digit assist begun market current system offer function popular imag devic head exemplifi appl hypothet knowledg navig devic intim detail inform intellig assist owner manag daili life enabl softwar technolog futur pda agent agent small program perform specif activ behalf comput user comput program part popular videotap present knowledg navig earlier scienc fiction inspir agent depict human persona impli broad rang skill person assist butler comput augment environ term pierr wendi rich gold al refer technolog add comput power real world virtual ubiquit multimedia tional broad rang physic machin ubiquit comput overlaid graphic project displai displai virtual ubiquit multimedia propon ubiquit comput weiser vision notion virtual attempt make world insid note applic benefit strongli virtual game virtual walkthrough inaccess argu averag user weiser term refer virtual environ todai opaqu hmd glove shut user rich real world version technolog virtual environ limit virtual environ gener plai major role futur ubiquit comput extend vision ubiquit comput includ descend technolog current augment realiti research hmd point peopl wear bulki hardwar daili basi treat todai hardwar improv predict peopl carri comput weigh comput todai bulki hmd replac attract displai displai potenti soni earli centuri virtual environ ubiquit comput inher multimedia paradigm virtual environ involv auditori tactil compon combin creat convinc virtual world world involv materi comput record materi case augment surround real world ubiquit comput natur integr tradit digit graphic video larg number displai potenti intens multimedia significantli current technolog entir displai devot video connect imag left long period time audio import displai identifi sound call attent import inform minim issu address convent multimedia network oper system vital success virtual environ ubiquit comput histor overview section briefli highlight import mileston histori virtual environ ubiquit comput histori virtual introduct ubiquit interest exampl virtual environ comput morton develop machin call demo user virtual ride york address visual auditori haptic invent stereoscop hmd auditori stimul earli flight simul creat virtual environ aid comput live gener shoot model board tv camera ivan sutherland gave talk ifip confer notion room object convinc real object develop virtual environ hmd sutherland system present vector graphic small crt worn side user head optic path fold mirror make augment realiti system inspir sutherland talk ultim fred brook began work haptic displai present forc combin test prototyp model applic futur multimedia user interfac earli michael built prototyp forc feedback devic posit small knob vertic shaft motor control forc exert knob user hold knob move cube explor simul surfac vari dynam hard start krueger built number system carefulli avoid technolog user bulki wearabl displai opt displai track approach trade physic comfort appeal research nasa al develop kei idea modern virtual environ includ color stereo hmd spatial sound foster mid research creat dataglov popular gain media attent dozen virtual environ develop consult research form root ubiquit comput lie histori person begin pioneer work alan kai colleagu xerox parc power comput intend children adult interest pda grew research pda dai serv intellig agent perform varieti search bui airlin ticket prospect world fill anthropomorph assist ubiquit comput research began xerox parc late explor altern view place futur comput occupi everydai life hardwar technolog section provid overview hardwar current virtual environ ubiquit comput spatial haptic displai interact devic offer includ detail reader understand capabl user interfac spatial tracker varieti spatial track system exist measur report inform joint angl sensor provid posit orient inform tracker technolog popular electromagnet ultrason electromagnet produc polhemu stationari transmitt mutual orthogon cube rang inch foot side coil sequenc electr signal produc magnet field smaller cube inch coil transmitt magnet enabl system determin receiv posit orient depend receiv track distanc figur popular spatial track technolog electromagnet technolog flock courtesi ultrason fly courtesi spatial tracker twenti feet transmitt electromagnet tracker requir direct line sight tracker sensit metal object magnet field ultrason stationari transmitt small sourc arrang emit seri ultrason receiv small microphon base delai transmit system determin distanc speaker rel posit microphon orient receiv recov ultrason tracker affect presenc metal magnet sensit requir direct line sight transmitt receiv accuraci electromagnet ultrason tracker leav measur posit small fraction inch orient small fraction technolog requir cabl receiv electron box optic track system video camera track object approach optic track refer system posit camera world object track accur track control condit system requir object track visual aid attach led mark system attach camera object track watch world move posit orient camera object determin exist system work gener environ north carolina chapel hill tracker ceil tile grid led al technolog track posit orient explor includ magnet creat wearabl system requir extern transmitt receiv track accomplish worldwid global posit system gp receiv receiv signal posit satellit maintain signal determin absolut posit gp receiv antenna earth accuraci report posit inform ten meter accuraci obtain posit addit receiv transmitt posit broadcast correct base differ comput posit techniqu call differenti gp result accuraci meter accur kind gp system compar phase gp signal stationari receiv phase signal receiv move achiev accuraci real time figur north carolina chapel hill optic track system ceil user instrument grid led system comput user head posit base set led visibl camera mount head ronald north carolina chapel futur multimedia user interfac track system base wearabl activ badg al activ small infrar transmitt period transmit uniqu identifi owner badg transmiss detect short rang receiv room hallwai build monitor make room section hallwai occupi person wear badg ir fairli direct requir clear user desir privaci simpli put badg prevent receiv pick transmit signal instrument dataglov al dexter hand provid inform finger joint angl dataglov accomplish set ten joint hand finger cabl run loop back damag pass assign joint tini led end cabl measur amount light pass cabl finger bent joint measur light provid indirect measur joint angl posit orient part glove measur electromagnet sensor technolog build glove appli track user part system finger track prototyp acceleromet finger develop system wearabl solid surfac serv chord keyboard approach make track hand bodi requir user wear special apparatu gener comput solut eventu process user silhouett recogn hand bodi pose real time vincent wellner technolog develop decad infrar light illumin user ey camera track dark reflect infrar rest ey system measur ey orient requir user wear camera posit front stationari camera altern approach monitor electr muscl system discrimin larg area user entir visual field system contend involuntari ey movement user fact ey motion part normal ey point result unfortun consequ graphic displai input graphic displai creat virtual environ categor surround viewer basic kind provid presenc fill larg amount user field displai surround displai hmd mount user displai view special design user focu displai comfort figur displai stereo displai design view ey hmd conjunct tracker materi view depend posit orient user head make build virtual environ surround user move surround displai system surround head accomplish build room possibl floor displai approach make surfac video screen al deer shown figur provid sensit head system stereoscop displai system head posit tracker current stereo displai technolog suit applic reli liquid crystal opac control impress voltag left ey imag altern displai screen doubl standard frame rate control synchron left len transpar left ey imag len transpar ey imag displai distinct opaqu displai opaqu displai block user view real world present user visual environ displai overlai graphic displai input graphic user view real world opaqu displai stationari current displai optic combin overlai graphic merg video imag world graphic opaqu displai optic combin mean overlaid graphic user real world full field view visual system provid opac control level individu pixel reduc user visual experi real world resolut field view opaqu hmd introduc addit lag video circuitri hmd camera locat posit user imag world offset displai rang convent crt displai combin exploit technolog surround system term virtual world desktop virtual world system term deriv cubic volum insid crt describ group work ubiquit weiser mention basic class tini held palm point ubiquit comput virtual environ present polar displai virtual environ plai import role ubiquit comput describ lcd fit movabl window inform space classifi ubiquit comput virtual environ devic techniqu appli natur displai creat richer inform space ubiquit comput virtual environ emploi wide rang interact devic vari displai class ubiquit comput devic discuss pen input figur displai virtual figur cave user wear liquid crystal stereo glass perceiv effect imag project directli floor mirror fold optic path video projector minim amount space cave carolina futur multimedia user interfac suitabl input devic displai tradit keyboard devic enter larg amount data virtual environ research explor kind input devic techniqu includ simpl hand gestur recognit instrument digit imag design shown figur figur parctab displai ubiquit comput environ low resolut pen button infrar link wireless commun xerox pad size displai data system figur xerox liveboard displai xerox figur interact devic virtual environ flat front face left cricket microphon ultrason track system arrai small circular bump handl cricket haptic feedback digit imag audio displai input audio displai input virtual environ ubiquit comput comput graphic displai input research area explor sound virtual work concentr audio output express properti virtual difficult speech input replac gestur ubiquit emphasi integr portabl comput wireless telephon servic creat person commun current multimedia sound output treat companion graphic present flat displai stereo audio wed screen graphic creat compel visual sound listen surround audio environ similar imag object space depend distanc orient rel viewer sound object function distanc orient rel listen ear case left ear hear sound left ey object differ sound listen make audio clutter parti listen pick attend ongo listen mono main cue hear sound direct differ sound amplitud arriv time left ear strong direct cue account abil hear sound head sound sourc equidist ear reach time equal sound travel circl front asymmetri asymmetr head shape sound spectra depend direct sound sourc rel head filter call transfer function insert small microphon subject ear measur waveform real sound sourc locat posit mathemat model develop sound spatial system foster digit signal process technolog process sound sourc real time appli simplifi version index desir locat sourc rel ear result stereo pair signal present listen ear sound sourc eman rel locat simpl system model locat sound sophist includ addit effect absorpt reflect room surfac haptic displai haptic displai address user touch addit sensat forc torqu interact convent input devic keyboard touch forc import difficult touch type membran keyboard kei offer tactil feedback tradit keyboard kind passiv haptic feedback direct result physic keyboard mechan construct control comput haptic displai activ comput control build mention section number research system provid exampl power haptic displai motor driven held user biologist experi molecular forc simul molecul jr al explor surfac sampl scan remot electron inspect modifi featur atom level control microscop ii al joystick produc feel patch textur materi al end simpl tactil displai form arrai small pin dramat tactil feedback user cricket architectur softwar architectur virtual environ ubiquit comput evolv set goal virtual environ system develop support singl hardwar platform small number tightli coupl intent creat applic futur multimedia user interfac system origin model tradit interact program evolv solv problem virtual environ exist system ignor issu applic larger requir realist virtual world work develop infrastructur support virtual environ network oper system level work ubiquit began vision environ futur prototyp system built design address infrastructur issu process model virtual environ earli virtual environ applic simpl head hand handl sequenti problem approach frame rate tightli coupl time iter main event sum time requir read input process step virtual environ gener displai frame moder complic virtual time process step simul nontrivi singl timestep scientif visual minut virtual environ displai respond track user ten time simul determin displai user head posit determin obviou solut problem distribut system multipl decoupl comput step simul loop al result displai updat fast head posit inform displai continu fast step current virtual environ distribut process tightli coupl process master creat initi process system easili reconfigur fault toler difficult construct master applic configur control devic problem kind encount share draw messag traffic demand virtual environ typic volum larger number user interact devic data commun support distribut simul allevi dv al dive structur applic larg set process process independ commun messag protocol problem exist system scale gracefulli build virtual distribut comput load significantli larger number machin current system design handl exist system distribut tend central comput virtual environ simul detect commun result interest parti fundament problem central algorithm scale huge number primarili bandwidth commun media quickli overwhelm larger number machin inform result comput system address problem scale arpa simul network project al develop hundr thousand simul train militari person collabor tactic recent al similar run graphic hardwar distribut interact simul protocol understood consist dozen network packet type heterogen simul commun uniqu featur protocol larg number particip veloc inform posit messag object particip simul vehicl typic travel fairli predict posit object calcul local reliev send entiti continu error real calcul posit exce posit inform broadcast approach success hand head motion human move predict wave system system develop goal deal requir larg scale distribut virtual environ commun media vari bandwidth gener fashion infrastructur ubiqu infrastructur ubiqu main compon ubiquit comput mobil comput softwar infrastructur ubiquit wireless network tie network requir discuss section current rate technolog comput displai requir met decad leav softwar infrastructur develop wireless infrastructur suitabl test displai scheme network rout activ explor al ioannidi maguir weiser gener oper system issu deal heterogen network discuss al problem includ deal widespread effect intermitt connect wireless handl intermitt connect filesystem mobil comput transpar local cach allevi problem cach applic determin file oper result applic unpredict user oper investig deal structur cach filesystem inform inform user oper file issu inform applic environ chang custom interfac appropri applic told nearest explicitli printer approach problem modifi semant environ introduc notion dynam environ variabl automat inform interest applic valu chang al applic simpli configur print system inform applic local printer variabl ubiquit comput environ capabl devic comput creat offic environ user intellig control surround make automat adjust light heat system base prefer room occup al al addit system save amount energi scale turn equip room displai gener model popular imag virtual realiti fulli graphic current technolog provid peopl feel ultim goal displai gener research strive environ potenti provid visual complet complet unnecessari inappropri technolog achiev fulli virtual environ futur discuss displai gener model virtual fulli render augment realiti imag process fulli render scene straightforward common approach creat virtual environ render fulli frame user viewpoint model virtual world user head paramet synthet camera user ey scene render tradit comput graphic techniqu scene render stereoscop scene render point view ey small displai close user fix respect user head ey constantli move respect world desktop displai user head fix respect constantli move rel user head ey conceptu major differ user standpoint graphic differ displai small differ paramet suppli synthet camera render graphic kei featur environ virtual world clever approach reduc number complex object render frame textur reduc number polygon user creat system obviou disadvantag approach extrem futur multimedia user interfac power comput creat realist environ real time augment realiti altern fulli graphic render select object combin user real world unlik fulli entiti exist real world render highlight suffici draw wirefram box circl shown figur virtual world commun wealth inform annot real world creat hundr line polygon al user cut rich real mundan object pen paper peopl comput imag process render entir scene viewpoint render wide imag scene singl posit imag process techniqu produc imag render viewpoint user pose work object distant user user posit roughli arbitrari direct potenti import approach broadcast video game nearbi object ad render separ simpli overlai distant background closer rest scene share live video imageri roller ride overlaid imag interior roller gener user inform gener share virtual experi broadcast group peopl research issu direct number issu address virtual environ ubiquit comput current approach obviou improv track processor commun network substanti improv virtual environ ubiquit comput hope gain widespread accept time technolog technic pursu time figur augment realiti addit world render mainten assist al user shown pull printer paper trai current desir posit paper trai highlight line style arrow drawn show user direct trai move columbia hardwar requir interact techniqu develop paradigm autom assist applic hypermedia agent support collabor privaci area ripe explor hardwar requir import hardwar issu mobil comput speed comput wireless network connect work network portabl comput power wireless network mobil virtual environ applic increasingli limit track displai technolog speed comput network primari limit system tracker lag ubiquit import hardwar factor physic size comput bandwidth wireless network processor continu faster requir power hold true tradit displai technolog sort requir tab pad bandwidth speed wire network advanc futur ubiquit comput virtual avoid discuss specif requir ubiquit comput virtual environ differ mainstream applic tracker virtual environ ubiquit comput complet track system virtual environ requir extrem ubiquit comput long wireless system system deliv high tether system versu low wireless system total rang track system virtual environ compar smallest unit accuraci typic ubiquit import mind paradigm good advantag system ubiquit comput environ custom base occupi room higher environ custom base displai problem current track discuss section categor accuraci rel import attribut depend specif head tracker hmd locat tracker virtual requir differ depend system augment realiti low latenc user head track azuma point rang accuraci requir complet virtual environ stringent requir virtual suffic approxim posit orient user visual overrid conflict signal rang tracker user navig virtual world physic move desktop virtual environ system requir rang user close stationari track user head feet displai room displai suffici augment realiti requir extrem high accuraci low latenc ensur virtual imag regist properli real world ubiquit potenti applic requir track scale magnet ultrason system scale transmitt rang limit requir locat matter feet object environ produc requir filtrat research long highli accur track optic track project mention section track system scale exhibit uniform high accuraci low latenc entir rang bishop major drawback current system size room requir camera head ceil restrict head problem insurmount major bulk hmd due size weight video bigger miniatur camera gener visual track algorithm futur multimedia user interfac requir room instrument remov addit benefit make track system singl transmitt receiv conceiv gener track algorithm determin posit dynam object conjunct inerti tracker gp wireless locat track provid track system unlimit rang optic track techniqu uncommon find comput displai attach video camera camera track person posit rel captur video inform determin posit user head gener imag displai person point view track inform section track system latenc improv critic import virtual environ al azuma bishop measur track object move data structur displai affect user experi manifest augment delai result graphic real world current system head motion predict extrapol filter reduc appar posit orient lag al unc optic hmd estim addit acceleromet predict orient posit head displai displai requir ubiquit comput devic power higher resolut interest requir simultan multipl pen address liveboard al liveboard color displai system multipl function meter displai surfac group interact natur user reach displai surfac capabl displai displai virtual environ present set current solut current hmd readi widespread obviou requir hmd resolut field view approach fidel human visual system ey field view approxim vertic ey provid horizont field view approxim stereo hmd pixel arc minut visual angl requir ey displai resolut human visual constant finest detail resolv field view receiv field pixel wide resolut render graphic high resolut entir visual field visual fall rapidli object move rang vision displai wide field view low resolut simultan displai user gaze equal effect approach electron figur imag ax overlaid corner object world improperli regist imag properli regist imag ronald north carolina chapel processor bundl transfer imag light valv projector hmd ey present imag field view ey higher resolut field view direct regard user ey displai present great challeng render softwar ensur visual artifact introduc object move region hmd made lighter displai eventu construct individu pixel transpar opaqu subtl problem depth field displai pixel singl imag stereo pair displai addit forc visual system deal conflict depth visual clutter focu time problem notic augment realiti virtual object focu real object colloc focu displai construct individu pixel depth program control processor video plai larger role ubiquit comput virtual manipul video stream video present produc show vision comput interfac point video window displai remot particip rotat perspect give particip effect real time broadcast video effect accomplish digit video stream multimedia comput graphic processor textur map surfac overhead graphic pipelin creat textur data structur raw imag preclud modif textur earli hardwar network success ubiquit comput hing develop wireless network exce capac plan commerci system decad commerci system aim connect fairli wide rang huge number ubiquit comput devic suggest significantli higher bandwidth network support design provid high volum unit area weiser suggest build wireless demand requir aggreg bandwidth easier achiev network provid high bandwidth unit area cellular system cell size radio frequenc hundr time attempt build long rang wireless network figur rotat imag remot particip video particip rel posit bruce futur multimedia user interfac devic displai video tradit bandwidth requir order magnitud higher video preval virtual happen displai hardwar begin support section virtual environ lower bandwidth stricter latenc requir data millisecond latenc perceiv user lag system movement combin virtual environ ubiquit comput virtual environ ubiquit comput put forward compet complementari obviou area overlap involv virtual realiti peopl run applic ubiquit comput environ graphic assum track technolog matur state ubiquit comput devic user track reason advantag inform displai graphic weiser augment realiti displai ubiquit comput live room window overlai user view path neighbor friend morn weiser user head regist graphic imposs graphic gener viewpoint viewer assum displai base current displai technolog viewer graphic viewpoint chang track user move problem solv individu hmd advantag ubiquit comput environ materi present person devic requir displai simpli notifi infrastructur virtual inform user present ubiquit comput devic displai individu custom number simultan user current ubiquit comput research care peopl disabl person track disabl ubiquit comput control environ al al user turn affect advantag augment limit visual displai activ audio displai environ annoi graphic displai person spatial audio avoid pollut sonic environ user investig accommod larg number comput user interfac physic visual virtual world feiner hybrid user combin real virtual displai common user interfac displai person comput virtual inform surround present hmd prototyp hybrid user interfac window flat panel serv primari work space window move freeli flat panel inform space provid context work extend account larg number varieti devic popul ubiquit comput feel concept hybrid user interfac kei effect integr ubiquit comput augment realiti approach address problem discuss support collabor colloc user augment realiti section place video video plai increasingli import role multimedia interfac advantag integr video camera highlight section potenti fix track peopl front displai addit provid inform gener posit inform determin portion video imag transmit video applic ensur transmit imag view user achiev camera mount move enabl remain point user technolog bederson spheric point motor accur posit camera mount rotat speed hundr render camera enabl transfer stereo imag camera posit appropri remot viewer reason stereo pair imag displai construct dynam model visibl part user head transmit recipi system displai remot user desir al varieti approach develop captur depth map environ al make mix graphic view unfamiliar environ visibl relationship properli maintain technolog tradit video integr fulli ubiquit comput virtual abil map video stream discuss section facilit place video stream virtual environ arbitrarili posit render mention section major current system strive render virtual world approach commun inform technic illustr found architectur illustr structur typic line draw view vari convei clearer understand object build realist render scene discuss autom approach gener imag hidden edg render line style depend object hide approach render import augment realiti convei inform minimum augment graphic feiner develop method automat gener view al al describ system produc imag inspir architectur render virtual realism import scene amount render time devot object percept hidden user graphic system long varieti facil build graphic object adapt transform posit size object cull scene render lower level base size project render requir virtual environ research suggest cull imag degrad techniqu base physiolog human percept pausch integr exist user interfac paradigm research tradit displai remain relev ubiquit comput virtual environ kind inform effect displai techniqu displai surround ubiquit comput environ similar wai kind displai discuss ubiquit comput virtual environ benefit incorpor major paradigm examin direct common techniqu virtual environ shift attent gener issu surround wimp studi class interfac discuss techniqu adapt accomplish environ manag direct manipul direct manipul refer interact techniqu object interest visibl user manipul directli increment action complex command languag direct manipul tout featur virtual environ natur learn reach grab conveni effect direct manipul turn critic tediou command line interfac replac problem compound poor qualiti current tracker glove complet lack haptic feedback virtual environ perfect hand user grab object manipul impli object arm length object user easili grab fast move futur multimedia user interfac small present similar problem direct manipul requir user hold hand physic support extend period time long date back light complic fact screen rest hand solut problem give user select object point problem farther object harder select virtual user chang distanc manipul pointer explor techniqu work object extrem larg quick difficult manipul directli wimp exist wimp techniqu applic adapt fit newer rang handheld manner familiar devic requir modifi techniqu direct wimp techniqu virtual environ attempt typic success simplest interact devic user physic devic virtual world virtual practic virtual keyboard poor track lack haptic feedback button pad successfulli emul posit set larg virtual button plane physic desk provid haptic feedback passiv physic prop instrument tracker provid user facil control virtual object al adapt wimp techniqu virtual panel system provid mr toolkit al mr panel essenti arbitrarili orient rectangl hierarch text manipul accomplish base intersect rai cast user hand surfac panel due problem current tracker compound lack haptic user experi problem panel analog exist techniqu found virtual world virtual environ advantag user tradit input keyboard mice monocular system pointer devic straightforward treat view plane larg displai cursor move manipul scene object manipul line sight cursor al devic stereo system straightforward task pointer tradit techniqu work straightforward line sight pass user ey system input straightforward approach devic cursor move view plane link eman fix point user ey intersect cursor ubiquit comput voic mice keyboard larg bodi research exist input techniqu tablet comput run oper microsoft window pen comput shafer common pda newton handwrit recognit gener major complaint comput print write slower form input keyboard research investig wai speed handwritten input goldberg richardson develop input techniqu specif design alphabet call significantli recogn input higher handwrit print richardson altern charact correspond gestur determin placement set pie menu commerci simplifi alphabet improv print pda appl newton techniqu faster accur print tradit requir addit train understood differ input techniqu requir size displai manner radic point interfac interfac reli thing reserv portion displai widget adapt small environ manag user point specif area displai top bottom edg adapt larg larg small displai manner chang current graphic user interfac base displai size sheet share displai applic remain displai creat effect assumpt reach import user window system provid window manag user manag larger set window fit displai exist window system inappropri environ microcomput window system microsoft window appl macintosh desktop requir program run local make unsuit distribut environ popular network window provid suffici gener layer abstract applic window system window move displai mention move displai size capabl attempt made modifi rectifi problem al satisfactori window move virtual ident modifi transpar window mobil difficult achiev window nelson provid layer abstract applic window address requir move window significantli displai develop suitabl window system provid capabl exist system challeng environ manag previou discuss problem encount attempt current window system ubiquit comput virtual environ prime motiv exist window invent desir support huge number exist futur applic al adapt window system issu address involv window manag screen real estat surplu real estat spread hundr devic user organ window small crowd organ order magnitud object scatter environ extend notion window manag environ manag simpl problem current window manag forc user posit window manual automat posit window nontrivi displai ubiquit comput augment potenti displai real environ manag freedom make reason choic object placement augment potenti overlaid object block displai person al environ manag user avoid problem move exist virtual object approach window manag interfac metaphor explor wong al displai set document stack pile paper set document typic convei exist group approxim content rel order pile metaphor advantag abil form recogn pattern complic data document pile mean owner virtu shape manual label learn disciplin commun gener pai attent happen disciplin increasingli import user interfac attempt user learn disciplin older matur continu comput power improv interact readili advantag experi learn anim motion squash futur multimedia user interfac techniqu ungar perceptu cognit psychologist studi peopl understand sensori architect landscap design structur real space effect integr hypermedia al stress import make hypertext capabl oper separ hypertext applic extend notion hypertext link make link arbitrari physic virtual object solomon al develop prototyp augment realiti system hypertextu link creat window physic object environ make automat find note made book attach remind peopl locat similar calendar program attach date attach hypertextu link follow room author author materi individu medium difficult creat qualiti multimedia document requir individu media skill make media work effect effort author multimedia document rare attribut sole defici process research direct address difficulti autom design goal explor mckeown al multimedia gener project system ai techniqu creat explanatori text graphic fulfil set input coordin materi gener media make gener text refer gener graphic al author made harder media includ full set possibl dynam virtual environ feiner al address aspect creat virtual environ automat design desktop virtual environ present visual multivari account criteria interact control amount time displai render vari resolut data calcul displai compon guid user equip mainten task creat graphic overlai user view physic world design account posit orient user head object inform present redesign user move annot object annot physic obscur object major challeng develop robust virtual environ design system handl broader rang media product includ tempor anim speech agent situat design multimedia present complet framework develop tool assist creation present inform agent assist collect inform monitor electron newswir articl roam comput network gather inform remot charg carri task part owner agent provid assist video edit process unannot footag recogn find shot includ particip locat al suggest previou full set output possibl dynam virtual ubiquit comput environ greatli complic multimedia present select output devic displai possibl wide vari task knowledg ubiquit comput displai agent automat select displai migrat inform displai agent assist organ inform singl augment realiti overlai larg displai captur journal person experi captur journal person experi bush suggest scientist wear small camera microphon select photograph thing interest enter note annot vocal work lab technolog make extend vision captur user experi tini pair camera microphon frame pair glass improv compress techniqu memori cost size eventu make idea feasibl myriad issu search lifetim record experi collabor virtual environ ubiquit comput addit issu address current research collabor cscw support collabor user displai interact devic mobil particip collabor pda ubiquit comput devic provid high resolut displai displai share inform augment realiti applic support privat view inform virtual world share presenc mean user virtual environ classic metaphor work user view share inform privaci privaci issu ubiquit comput virtual environ track volum data collect weiser discuss implic wear activ potenti interest person long spend room build activ badg track user granular tracker potenti user time possibl employ inform pleasant implementor pai special attent ensur privaci maintain weiser suggest combin technolog social solut employ video camera comput activ monitor watch gener social legal climat discourag technic feasibl measur technic solut ensur privaci ubiquit comput environ succe hamper util current attitud person attitud adjust appropri global activ monitor individu obviou automat forward phone call interest applic exist automat diari gener record user area dai al make easier fill time rememb involv check check talk back innoc intent inform secur system place prevent approach uniform global avail provid inform make posit inform physic talk hallwai back rememb necessarili find meet possibl peopl pool inform reconstruct underscor weiser point technic solut privaci electron inform pool requir problem address social imagin inform servic pai peopl contact inform pool inform sell pai privaci requir interest interfac question easili part huge volum inform collect queri meet back state light possibl complic combin public privat futur multimedia user interfac privaci issu address technolog eavesdrop confidenti inform current interfac provid prevent displai read work public place protect easi read displai person sit front plane train augment realiti solut problem displai virtual imag wearer hmd possibl read shoulder elimin collabor environ previou select part person inform augment public displai confidenti ubiquit comput provid straightforward solut case document group discuss perform automat close inappropri enter room survei state art virtual environ ubiquit user interfac paradigm shape futur comput show complement provid capabl multimedia user suggest set issu multimedia research explor paradigm differ preval current multimedia part hardwar displai interact case virtual larg number comput integr ubiquit comput paradigm addit requir oper system network current multimedia applic virtual environ involv transmiss inform gener tracker small amount inform comparison digit latenc requir stricter multipl user interact effect ubiquit comput requir high bandwidth extrem short result extrem high aggreg bandwidth entir network consequ assumpt made multimedia support system reexamin rang current user interfac wimp current comput static network configur refer testb dynam virtual environ spatial sensor proc acm uist page graphic comput graphic acm siggraph annual confer page appl human interfac appl desktop interfac publish ma track requir augment realiti improv static dynam registr optic hmd comput graphic acm siggraph annual confer page merg virtual object real ultrasound imageri patient comput graphic acm siggraph annual confer page miniatur activ vision phd york ny technic report sound virtual realiti multimedia academ ma design interact multivari visual ieee comput graphic grasp realiti graphic serv scienc proc acm chi page refer project displai scientif visual comput graphic page atlant virtual world architectur proc ieee vrai page virtual realiti system proc ieee vrai page power ny cartoon user interfac comput graphic annual confer page toolkit develop distribut virtual environ proc ieee vrai page virtual design implement cave comput graphic acm siggraph annual confer page make virtual realiti experi virtual portal proc graphic interfac page knowledg navig video appl larg interact displai support group present remot collabor proc acm chi page xerox parc tech report de offic environ ubiquit comput offic comfort energi manag technic report xerox palo alto research center window window augment realiti proc acm uist page augment realiti autom gener coordin multimedia explan ieee satisfi visibl constraint dynam illustr visual hybrid user breed virtual bigger interfac physic smaller comput proc acm page virtual environ displai system proc acm workshop interact page situat inform space spatial awar palmtop comput interact visual medic data visual scientif page reprint ieee august pp wearabl interfac proc acm chi page futur multimedia user interfac seri posit track system promot literatur research system global posit system ieee stylu user interfac manipul text proc acm uist page stylu proc acm page program network portabl comput proc fourth workshop workstat oper system page system render proc acm chi page text input softwar appl newton palm lo ca virtual environ system proc comput graphic confer iri hypermedia servic apparatu individu unit state patent number file reprint comput page simul unit state patent number file august passiv interfac prop visual proc acm chi page design implement mobil internetwork architectur proc winter page scienc virtual realiti virtual environ ma enhanc treatment hidden line acm transact experi wireless environ proc usenix symposium mobil page militari network technolog appli theme park home entertain system comput microelectron person comput scientif make design architectur distribut virtual environ proc ieee vrai page artifici realiti ii publish ma make real world virtual user interfac issu mobil comput proc fourth workshop workstat oper system page realism virtual realiti environ proc acm uist page applic optic comput graphic comput refer manual technic digit system research refer centr research report pile metaphor support casual organ inform proc acm chi page gener multimedia explan proc aaai page microsoft window applic design guid microsoft wa feel issu forc displai proc acm symp interact page focu rang sensor proc intl conf comput page gener automat track technic xerox user interfac guidelin publish tactil commun sid reproduct human imag virtual space teleconferenc proc ieee vrai page issu interfac technic report xerox palo alto research center interact graphic displai architectur proc ieee vrai page intellig agent comput imag gener john york window system acm transact sc parctab mobil comput system proc fourth workshop workstat oper system page custom mobil applic proc usenix symposium mobil page decoupl simul virtual realiti mr toolkit acm transact inform optic design criteria binocular mount displai displai system spie volum direct step program languag ieee render frame influenc peopl comput graphic sun toolkit refer manual sun part ultim displai proc ifip page virtual realiti interfac scan tunnel microscop comput graphic page oper system issu pda proc fourth workshop workstat oper system page video prototyp case histori proc acm chi page futur multimedia user interfac properti specif achiev grace disconnect oper intermitt mobil comput environ technic report xerox palo alto research center interact dedic multimedia author system proc acm chi page alphabet proc acm chi page virtual world virtual applic explor academ press design illustr languag product influenc graphic gener proc european chapter assoc comput page activ badg locat system acm transact inform warp develop kit refer manual warp ca synthet visual environ hand gestur voic input proc acm chi page comput centuri scientif comput scienc issu ubiquit comput ubiquit comput ieee interact paper digitaldesk introduct realtim digit synthesi virtual acoust environ proc acm symp interact page illustr comput graphic acm siggraph annual confer page hand gestur interfac devic proc acm chi gi page construct virtual world proc acm symp interact page
DB/1019 3 framework integr exist algorithm data mainten task xin zhang elk rundenstein depart comput worcest polytechn ma abstract recent view mainten algorithm tackl problem concurr data updat happen autonom ev system address mainten data schema iss concurr schema data updat remain unexplor problem paper solut concurr view definit evolut view extent mainten dw defin distribut iss introduc framework call chang data updat concurr system integr exist algorithm design address view mainten view extent mainten data view definit evolut schema view extent adapt view definit system provid protocol enabl correctli collabor track potenti faulti updat dw conflict concurr conflict updat local correct call local introduct background view mainten data wareh data built gather inform iss integr virtual repositori custom user data wareh import applic environ work support part nsf grant dr rundenstein ibm ibm partnership award ibm fellowship student numer heterogen distribut www queri answer analysi perform quickli effici integr inform materi directli differ resolv environ plagu dynam continu chang modifi data queri capabl practic research view mainten propag data updat iss except gupta al mohania al algorithm materi view extent view definit explicitli chang user user drop attribut select view ev project attempt address problem preserv view definit iss view simpli undefin modern distribut iss typic inform provid independ autonom impli updat data schema independ possibl concern affect dw defin awar wait dw manag successfulli process previou iss updat appropri assum recent driven view mainten approach eca strobe sweep updat order time updat affect process view mainten underwai previou updat current view mainten algorithm handl concurr data updat paper address concurr problem data updat schema environ data mainten evolv iss illustr current technolog fail handl problem concurr data updat schema assum inform sourc relat figur show initi extent view data defin sql creat view select assum schema chang sc schedul attribut drop relat drop attribut middl layer handl report sc assum view human view administr automat view synchron tool creat view creat view select compar view definit schema note schema chang effect trigger view definit chang appli view gupta al approach order extent evolv view definit send adapt queri addit tupl select result execut queri addit tupl dw assum data updat happen dw handl detail protocol shown section adapt queri add tupl exist view extent queri drop condit queri execut basic assumpt paper breviti hide detail process queri distribut system add tupl drop tupl effect data updat data execut shown tabl vm row figur assum sc du long middl layer handl sc queri result denot shown tabl va figur correctli comput tupl data updat handl middl layer sweep view mainten algorithm drop tupl insert determin row figur final data denot figur consist iss assum sc du short complet effect du occur happen fulli process iss shown tabl va queri concurr row figur affect wrong tupl result wrong extent dw shown row data updat handl middl layer drop tupl insert dw row final data denot figur duplic tupl consist iss solut approach approach address problem util exist solut procedur view mainten view synchron view adapt view mainten adapt address concurr mainten problem select newest solut task sweep data updat va view definit ev schema iss integr solut approach algorithm easili plug subtask va vm develop control strategi handl messag data exchang modul support function view mainten order put view mainten algorithm design view definit creat view select view adapt select view mainten select dub view definit creat view select data updat relat result va queri result va concurr result vm queri inform sourc space queri data initi state view adapt view mainten final state extent relat view legend queri result separ state origin extent intermedi state extent dw queri path origin extent figur process schema chang affect concurr data updat level control call chang data updat concurr control protocol coordin design algorithm handl faulti queri detect algorithm correct faulti queri result local correct queri call lc prove system successfulli solv problem concurr data updat schema neglect overhead perform view mainten work make formal problem concurr schema data develop strategi detect faulti data updat develop solut approach call exploit exist techniqu view mainten introduc local mechan middl util local correct algorithm correct updat develop prototyp context ev data wareh system solut relat work effort issu maintain data dynam environ concern maintain view extent data context data updat algorithm develop handl concurr data updat independ iss zhuge al introduc eca algorithm increment view mainten concurr data updat restrict singl strobe extend approach handl multipl iss concurr problem data updat schema iss assum static agraw al ensur consist data larger number case compar strobe famili algorithm data updat control issu schema data updat iss ev project studi problem maintain data data schema develop ev view system add flexibl view evolut process autom process find replac order rewrit affect view call view synchron concurr schema data updat consid focu current paper mumick rao introduc solut updat view extent data user definit view underli iss static data schema updat user explicitli request modif directli view specif background tabl defin main notat remaind paper sequenti uniqu gener system updat messag reach system explain section number denot tabl definit sql view dw assum queri conjunct primit creat view select rn dn rn cm primit subset attribut relat definit type schema ffl schema chang denot primit chang occur schema iss current sc ffl view definit chang denot primit chang view definit notat mean inform sourc subscript updat sequenc number sequenc number updat uniqu updat du data updat sequenc number sequenc number updat uniqu updat sc schema chang sequenc number sequenc number updat uniqu updat queri handl updat queri result queri result primit view definit chang subscript queri adapt view queri result queri result local queri gener system address concurr concurr queri result tabl notat mean explicitli request user automat gener view evolut system ev schema indirectli affect view definit relationship sc set view trigger sc depict tabl adapt queri adapt extent view technic report base tabl set adapt queri requir order fix view affect singl sc definit mainten concurr problem definit denot du sc tabl bnf mean mean mean order express show order execut dw schema chang view definit chang tabl relationship sc definit updat updat denot receiv dw answer updat receiv dw updat exist sc dw qr qr du figur mainten concurr data updat figur illustr concept data updat defin definit time line illustr assum dw assum schema chang sc occur du sc receiv dw du occur adapt queri sc arriv du qr point du sc definit remot queri send inform sourc space possibl includ adapt queri view extent requir remot queri technic report framework architectur data wareh middl layer chang data updat concurr major compon maintain view ffl view maintain maintain extent view data updat ffl view adaptor adapt extent view definit chang ffl view synchron rewrit view definit schema framework gener restrict view mainten algorithm order fit exist increment view mainten algorithm extend modifi view definit work add capabl updat data structur depend view definit chang exist algorithm sweep equip extens straightforward order synchron execut va major compon concurr control layer updat messag queue control center collect sc du relat messag establish order assign uniqu number base order arriv middl layer control center handl cooper protocol data inform sourc make data updat correctli queri engin concurr control layer common modul va vm connect modul underli iss qe process queri receiv queri result analyz find data updat happen queri result back invok lc correct queri result return queri result upper va modul qe detect du simpli reconstruct modul sweep view definit queri result receiv queri engin attribut part denot updat gener updat sequenti number denot fact queri result qe check updat du definit queri engin make system vm algorithm easili plug system socket ad data mainten modul assign number queri modul number set ident sequenti number updat process sequenti easili updat queri work qe assign sequenti number queri result queri track messag transfer insid middl easili detect du detail algorithm qe qe queri queri result send receiv exist updat messag queue concurr du happen end return end procedur lc concurr control layer design gener queri fix fault affect queri result concurr data updat detect qe detail algorithm lc section mean chang actual queri process queri gener run destin system queri engin cooper protocol ffl send du notif finish du send sc notif plan schema updat wait ack dw execut schema updat ffl middl layer middl layer send ack notifi mainten data sc complet send back middl layer notifi schema updat complet cooper protocol creat base assumpt iss justifi technic report execut schema chang middl layer permit send notif intend schema freeli protocol restrict execut data updat space execut strategi system major thread run parallel system thread initi system continu collect data updat schema report store thread updat handl properli updat data invok vm process handl view extent updat updat schema invok synchron view definit synchron invok va updat extent modifi view definit case mainten concurr du happen qe call lc process send ack initi handshak protocol receiv process thread repeat updat synchron fail extent affect view adapt case request directli send ack detail view refer ev paper lc mainten concurr updat kind concurr problem sc du sc sc du du sc due chang sc handl dw isol sc sc sc du problem current treatment problem context framework du du problem address literatur focu solv du sc problem case sc possibl conflict du present local algorithm assum va modul algorithm gupta al paper lc algorithm work queri gener va care gener local strategi local concern queri affect data updat lc fault data updat queri result return back data middl layer section describ concurr data updat detect procedur determin queri result potenti faulti determin queri affect data updat order design lc correct local lc algorithm gener queri base templat affect queri effect updat faulti queri result return queri result correct made consist origin state space occurr data updat order effect data updat affect queri perform queri origin queri data updat faulti tupl achiev lc creat temporari tabl conflict data updat appli queri temporari tabl faulti assum relat simplifi subqueri treatment lc result number data updat updat messag adjust effect creat temporari relat tabl creat local queri queri templat relat tabl creat step execut lc queri tabl minu end procedur figur local procedur tupl lc correct affect queri result subtract ad faulti tupl lc procedur call system affect queri result detect collect inform queri queri result data lc procedur correct affect queri result inform base algorithm shown figur detail explan algorithm found technic report local algorithm ffl send queri inform ffl local data conclud ffl lc problem ffl lc effici correct effect du due perform local remot network request correct lc scope refer lc algorithm give illustr lc algorithm correctli solv problem section recal relat view definit evolv view definit schema evolut sc drop attribut relat adapt queri adapt extent view consist definit data updat affect queri result final result wrong extent view tupl queri result shown figur detect order execut queri distribut inform break queri inform sourc queri queri queri assembl queri creat select creat select select queri denot queri affect data updat qr extent extent appli lc algorithm correct faulti queri order correct result view adapt queri creat local tabl data updat sign tupl tupl sign abstract queri templat select templat equat queri equat select lc queri result queri tupl data updat insert remov qr add remov tupl queri result qr add tupl qr correct base correct correct queri result view adapt queri data wareh wide techniqu gather integr data heterogen autonom inform sourc data mainten algorithm develop data kind view mainten maintain extent data data iss chang view synchron maintain view definit schema iss chang view adapt maintain extent view view definit chang algorithm independ concurr data updat schema happen iss simpli put expect data consist maintain concurr data schema updat previou algorithm reexamin algorithm develop present framework make algorithm work requir modif solut system support lc algorithm successfulli solv problem concurr du sc system shown correctli maintain data initi evalu analyz cost factor number messag data traffic suggest system add overhead cost integr data mainten algorithm successfulli solv problem affect system perform acknowledg author student system research group wpi feedback research grate li implement ev system lee michigan interact ev project refer singh effici view mainten data page effici updat materi view page algorithm defer view mainten page gupta mumick mainten materi applic ieee data engin special issu materi view ross adapt materi view redefinit acm sigmod intern confer manag page integr rewrit rank phase view synchron acm intern workshop data wareh olap novemb rundenstein queri rewrit intern hong juli rundenstein virtual inform resourc run ibm centr advanc studi confer paper page novemb mohania dong algorithm adapt materi view data intern symposium cooper system advanc decemb increment mainten materi view expert system page view evolut support inform integr system dynam distribut inform space phd michigan ann progress rundenstein cv algorithm view synchron evolv inform system intern confer extend technolog page march rundenstein view rewrit constraint ev technic report worcest polytechn dept comput rundenstein view mainten view synchron intern engin applic symposium canada evolv view environ demo session preserv view evolv environ int workshop knowledg meet intellig access heterogen page august widom research problem data wareh intern confer inform knowledg page novemb zhang data mainten concurr schema data updat master worcest polytechn zhang rundenstein data mainten concurr schema data updat technic report worcest polytechn dept comput august zhang rundenstein flexibl data mainten concurr schema data updat ieee intern confer data special poster page australia widom view mainten wareh environ page wiener strobe algorithm consist intern confer parallel distribut inform decemb multipl view consist data wareh ieee intern confer data page
Agents/1020 1 corpor memori manag agent comma consortium philipp karp rose olivi alain joel giovanni joachim abstract comma project memori manag aim develop platform manag corpor memori advanc result user interact level focu methodolog requir engin knowledg acquisit approach introduct improv share intern extern knowledg improv newcom learn integr enhanc technolog monitor knowledg manag aim solv problem research commun offer partial solut support km integr result research field approach motiv comma ist european start februari main object implement test corpor memori manag framework integr emerg agent knowledg xml inform retriev machin learn techniqu integr technolog system challeng definit methodolog support design process project intend implement system context scenario insert compani support technolog monitor paper present technic choic methodolog approach final achiev comma technic approach implement scenario address common retriev relev knowledg import mass solut comma base architectur cooper adapt support retriev relev inform cm agent commun deleg make elementari reason support choic document infer mechan exploit ontolog author document annot perform technolog monitor internet acquir innov idea interest compani project focu case cm materi xml annot rdf order offer intellig search function improv document retriev project exploit machin learn techniqu order make agent adapt user context figur show complet schema system part describ technic compon solut figur schemat view comma solut knowledg manag agent technolog realiz system simplifi softwar framework develop agent applic call jade jade make develop agent applic easi compliant fipa specif jade offer extens agent model agent platform high perform distribut agent system implement java languag commun architectur agent platform offer flexibl effici transpar transport leverag distribut object technolog java runtim environ jade open sourc project download rdf ontolog extens markup languag descript languag recommend world wide web consortium creat access structur data structur document text format internet comma project exploit resourc descript framework simpl data model express xml syntax repres properti web resourc relationship rdf enabl describ content document semant annot search inform rdf make assumpt applic defin semant priori annot base ontolog share rdf schema idea commun specifi concept relationship ontolog document commun annot ontolog annot search memori navig detail machin learn techniqu machin learn method aim gener set exampl produc gener knowledg appli situat exampl learn capabl reli chronicl made event repres success action knowledg model model user model rdf ontolog rdf annot ontolog author system index document author corpor memori author agent group interest agent user agent xml document annot document sampl level depend goal learn chang chang chang user comma complementari learn techniqu consid learn quick adapt user session remot enhanc behavior system session lazi learn reason base index account specif case aspect methodolog approach start user end tool support km compani inevit structur knowledg maintain tool kind model hand system user model support specif specif user hand model handl differ exist activ inform user model acquir interview knowledg keeper system inform model acquir interview knowledg peopl organiz document trial solut km system fail due complex problem reduc complex limit scope project scenario ne tm start technic end main user cm ma ma main manag adapt user interfac connect cm user interfac method emploi design ma domain transport traffic distribut cooper expert system hybrid design method base softwar engin idea includ strategi simul system build identif agent problem domain specif world basic plan abil world agent act activ defin offer servic gener law provid prevent agent act definit world agent action request agent perceptu inform world specif agent coordin extens plan abil joint plan joint activ gener idea fill model sequenc iter iter phase model analyz consist task orient design method defin check consist interact activ method identif task agent perform step cope problem defin interfac agent extern cm user decomposit complex distribut task task manag singl assign task definit interact agent perform complex distribut task avoid conflict task case diagram order describ interact respect entiti uml suitabl defin tradit system proactiv behavior behavior system complet driven user action reason dynam diagram collabor state agent extern actor show behavior achiev scenario interview interview involv group free open discuss part structur clarif synthesi result interview build scenario requir analysi ne problem encount fact km compani lot peopl view uninterest spend time idea distinguish gener type ne personnel depart peopl ne result underlin function interact organiz chart date time enhanc person indic find complementari interview observ perform reveal point user system support capit retriev inform share retriev inform collect search inform interest abil system provid indic capabl repli queri time fashion inform manipul system type characterist inform clarifi problem organiz inform learn inform automat contextu refin queri inform rich relev pointer organiz inform provid electron inform provid member organ sourc expert relev inform answer narrowli specif queri complement start perform tour newcom web site web site handl annot tour imagin interest featur comma interfac present inform term provid topic list elabor term task relat document current task user find pointer monthli custom present inform term presenc ne organ provid inform import ne month access ne provid feedback inform provid suggest updat tm interview identifi task goal peopl involv inform manag case isol kind involv tm process oper technic expert involv technic project manag charg collect inform specif technic process owner manag requir collect system necess monitor sourc tool taxonomi document classif repositori date inform analysi knowledg user profil person support commun interest agent typolog system architectur inform retriev output requir analysi exploit identifi major task user requir system accomplish task map suitabl member agent societi comma ma import issu configur adapt comma instal corpor structur carefulli administ network environ expect corpor structur polici network comma system instal agent acquaint relat graph sensit corpor administr polici descript comma architectur focu actual agent categori role obtain system defin architectur adapt heterogen configur major benefit comma project expect agent technolog case inform retriev system comma agent societi divid main area user agent deal directli human adapt individu learn past action act behalf resourc agent manag kind resourc make agent societi suitabl thin agent mediat agent act user resourc agent yield configur adapt system fall mediat agent deal user comma separ concern user interfac aspect technolog access system client user support aspect proactiv action user user interfac agent care dialogu human user profil agent perform dynam user model proactiv action user interfac agent user activ user log comma user profil agent persist session comma ma featur kind resourc ontolog server agent annot server agent agent high autonomi simpli act agent comma field trial involv push select inform interest ontolog server annot server agent sort proactiv agent categori foreseen agent user annot document agent discov user common flavor mediat agent merg rdf conceptu graph final ma central elementari sequenc interact agent search base rdf annot send queri request agent archiv repli prototyp search engin enabl infer rdf annot translat rdf tripl conceptu graph vice versa combin advantag standard languag rdf express exchang queri inferenc mechan cg formal artifici intellig knowledg cg wide appreci base strong formal model provid power mean express good readabl infer queri mechan develop manipul cg reason cg suit implement km system rdf introduc recommend world wide web consortium wide standard enabl descript resourc attach semant annot reason map rdf cg adequaci rdf class properti smoothli map cg concept type relat type rdf statement map base cg class hierarchi defin rdf schema map concept type hierarchi cg formal hierarchi properti rdf schema map relat type hierarchi cg concept type hierarchi relat type hierarchi constitut call support cg defin conceptu vocabulari cg consid applic prototyp built cg platform rdf parser queri rdf statement wildcard charact describ pattern found valu return rdf queri translat cg project cg base isol match graph extract request valu translat back rdf project mechan account hierarchi special relat cg support obtain rdf schema tune match enabl approxim match gener investig develop complet queri languag base rdf map cg project work extens function develop engin order implement agent behavior relat archiv search document cm comma project start summar fly lesson learnt interest reli xml rdf materi cm suggest flexibl adapt enabl ma approach techniqu complex build ontolog human agent understand interest difficulti build explicit model futur system organiz problem solv order realist system integr good adequaci corpor cultur comma project innov approach corpor km ma exist recent studi ontolog order guid inform retriev ontobrok shoe webkb basi ist project comma reli model user model retriev inform cm close orient approach km system exploit model corpor work process model user task agent interest kei item softwar market exampl system agent perform simpl task limit interact user agent system system agent execut main part work guid commerci system agent user task comma project support promot standard give feedback organ project fipa agent technolog give feedback fipa project xml document annot rdf give feedback version languag comma project fit current evolut world wide web semant web refer technolog organiz memori ieee intellig poggi jade agent framework proc fourth intern confer practic applic intellig agent multi agent technolog pp semant web road map rv guha ed resourc descript schema recommend march conceptu graph model resourc descript framework proc intern confer conceptu structur august germani studer enabl intellig access www musen proc april fipa specif jade project home page lassila web matter semant internet vol lassila swick ed resourc descript model syntax recommend februari hendler web agent proc int confer autonom eklund knowledg web document eighth intern world wide web pp tm mitchel machin hj mueller agent system intern journal data knowledg special issu distribut pp elsevi hj mueller formal system specif flexibl manufactur symposium intern feder automat control inform control graham scalabl inform retriev engin annual confer autonom agent marina del california usa februari acm press acm corbi exploit xml corpor knowledg manag proc european workshop knowledg manag springer lnai univ rdf ic refer
DB/1021 3 gener electron commerc server tuoma sandholm januari gener electron commerc server tuoma sandholm depart comput scienc washington st mo januari abstract paper present gener electron commerc server demonstr wai algorithm game theoret incent engin jointli improv effici ecommerc configur auction includ varieti gener combinatori price set bid mobil user support auction type level commit contract optim determin optim contract price decommit penalti varieti level commit contract account ration agent decommit nash equilibrium safe exchang planner enabl anonym exchang divid exchang chunk sequenc chunk deliv safe altern buyer seller compon base type game theoret equilibrium requir develop algorithm gui design make feasibl materi base work support nation scienc foundat career award grant grant academ commerci contact author introduct electron commerc full power algorithm game theoret tool har improv effici paper present gener electron commerc server demonstr wai techniqu improv ecommerc term process outcom result implement effort web compon auction level commit contract safe exchang planner exhibit interest interplai algorithm game theoret incent engin success commerci internet auction site ebai interest academ auction recent internet motiv develop auction server prototyp gener test feasibl term user comfort servic internet auction prototyp call user internet set auction parti seller buyer trust execut auction protocol state implement match algorithm inform auction store relat reliabl server auction support combinatori bid graphic drawn mobil agent offer wide rang auction type chosen support user choic featur discuss order combinatori auction sequenti item auction time bidder prefer combin item case electr equiti bandwidth auction transport exchang bid auction difficult determin valuat bidder guess item receiv auction requir specul bid futur affect item receiv bid futur depend introduc comput cost wast overhead auction reason number lookahead game tree bid ration bid ration involv optim trade cost lookahead gain depend strike tradeoff lookahead uncertainti remain bid agent exact inform lead ineffici alloc bidder fail combin parallel auction item open auction simultan bidder place bid time period advantag bid partial signal bidder bid end uncertainti lookahead drastic sequenti auction problem prevail sequenti albeit mitig form combinatori auction overcom lookahead ineffici stem uncertainti rothkopf combinatori auction bidder place bid combin item bidder express complementar item specul item valuat impact possibl complementari item capabl import highli market unsur acquir item desir bundl time auction server support varieti combinatori auction subsect discuss combinatori auction set commonli discuss bidder bid combin bid join mean number bid accept combinatori auction desir featur avoid lookahead bidder tend lead effici complex auction auction determin winner nontrivi task feder commun commiss desir combinatori bid bandwidth due perceiv intract winner determin winner determin problem decid bid win maxim sum bid constraint item alloc bid gener polynomi time bid proposit winner determin proof winner determin weight set set pack approxim winner determin hard interest worst case proposit algorithm alloc bound optimum ffl np equal probabilist proof base present bid exhibit special approxim achiev polynomi time optimum irrelev auction practic polynomi time winner determin achiev restrict combin agent bid agent bid combin similar econom ineffici prevail auction recent gener approach optim winner determin motiv ffl bid combin ffl strive optim alloc ffl capit heavili bid practic space bid necessarili extrem popul longer life bid person world submit bid bid impli alloc check algorithm construct check alloc posit construct alloc algorithm gener part search space popul bid disadvantag run time depend bid receiv achiev goal tree search algorithm capit heavili fact space bid necessarili popul practic provabl suffici select gener children search method fast child heurist accur optim method preprocess search space paper discuss algorithm detail submit review method conquer intract winner determin base common assumpt bid happen agent bid auction alloc item agent agent bid combin current techniqu focu situat combin bid introduc captur synergi item real world set local occur bid land slot bidder host address bidder submit bid combin combin accept bidder express gener prefer posit neg complementar current work develop optim winner determin algorithm gener set natur problem harder basic winner determin problem special case neg appli set current winner determin algorithm set optim effici alloc desir extract truth valuat revel bid auction bid made incent compat domin mechan mean bidder motiv bid irrespect bid render unnecessari mechan appli combinatori auction set win bid determin maxim auction revenu constraint item alloc bid amount agent pai sum win bid agent submit minu sum win bid actual optim alloc winner determin problem solv win agent agent bid make fast winner determin crucial note remov win bid time constitut incent compat mechan incent compat lost winner determin price determin approxim addit tractabl winner conveni combinatori auction import issu bidder express gener worst case involv place bid number item shorter prefer loss express power richer input languag idea direct present earli al bidder place combin bid state maxim number combin accept special case number auction user submit multipl tabl row combin row combin figur multipl bid combin user submit multipl tabl method maintain full express natur input lead shorter input descript enrich languag basic full express express view suffici condit fulli express input languag comparison criterion conveni applic domain question gener combinatori auction input figur combinatori doubl auction auction multipl buyer multipl seller addit doubl auction combinatori auction agent bid multipl unit item combin number unit cell split case depend match unit exact partial match develop optim match algorithm gener combinatori approxim match algorithm server bid graph graph support bidder express continu figur bidder bui larger figur combinatori auction server electr market scenario agent bid combin electr hour multipl mega watt hour hour dai oper consecut hour electr plant prefer start suitabl time run plant time requir electr start feasibl accept lower unit price bidder accept curv color quantiti lower price seller accept curv figur graph user express continu prefer auction server figur correspond user hold altern pictur resolut requir bandwidth mbp auction item combin item virtual circuit la pragu network link backbon provid curv linear draw conveni conveni winner determin singl side auction graph winner determin algorithm work sum demand unit price loop price endpoint linear piec curv pick aggreg solut maxim unit price constraint demand bidder amount bid unit price doubl suppli demand curv separ point suppli meet demand chosen curv match exist hold singl doubl auction prevent continu slope linear segment finit assum curv figur support auction type auction server support wide varieti auction type user set auction parti decid auction type space auction type auction server user make choic choic base game theoret econom experi provid altern expert system restrict choic auction type auction figur auction user kind bid price determin scheme auction set differ base singl doubl multipl multipl unit item unit bid type includ regular price bid user specifi price graph bid figur price scheme charg buyer price bid scheme lead singl unit ascend bidder domin strategi bid small increment current stop valuat reach auction common knowledg assumpt prior bidder auction set bid type price scheme graph bid regular price bid price vickrei grove middl price singl unit item singl multipl unit item singl multipl unit singl multipl multipl unit doubl unit item doubl multipl unit item doubl multipl unit doubl multipl multipl unit figur show valid combin choic paramet privat valuat nash equilibrium analysi conduct determin agent function valuat auction charg win bidder price highest bid restrict bidder domin strategi bid true valuat vickrei auction gener vickrei auction set multipl unit multipl indistinguish good bidder submit multipl bid unit assign highest bid downward run win bid charg price bid displac set win bid achiev incent bidder motiv bid independ bid gener vickrei auction set charg bidder price highest bid win auction server method incent fall prei demand reduct li bidder auction unit discuss gener vickrei auction bidder domin strategi bid doubl server split gain equal standard price half bid auction ffl match exact auction ffl older bid newer bid overrid ffl clear specif time time bid bid receiv time ffl auction perman bid receiv auction owner cancel ffl bid retract winner determin ffl bid retract winner determin ffl inform reveal bidder highest ffl inform reveal bidder win mobil agent auction particip auction support mobil agent user agent activ particip auction disconnect user launch agent phone airplan disconnect mobil agent execut agent dock host machin auction server reduc network issu kei import bid michigan internet auctionbot messag protocol agent particip auction auction server differ provid support mobil agent auction server commerci concordia agent dock mitsubishi provid mobil agent safe execut platform observ set move user full flexibl java program design mobil agent provid html interfac user agent system automat gener java code mobil launch mobil agent inform agent auction send email user event occur user poll notifi import event immedi agent implement domin strategi user behalf ascend privat auction bid small increment current highest stop user reserv price reach agent user follow domin strategi set report valuat agent optim user behalf auction number bidder privat valuat independ drawn uniform distribut symmetr nash equilibrium strategi bid user valuat time user motiv reveal true valuat agent control agent auction submit low bid specul tool artifici bidder auction mislead seller interest submit control agent bid higher discov agent comput expect gain bid small amount current highest price agent current distribut valuat intend set user exact valuat probabl distribut probabl distribut updat bid unlik current electron commerc server provid auction type servic facilit ecommerc level commit contract safe exchang planner discuss section level commit contract optim includ optim level commit contract normal full commit contract unabl advantag possibl futur event provid agent follow matter futur event unravel contract profit agent view profit view futur event post contract low expect payoff realiz futur desir contract suggest util potenti provid futur event agent contract oblig made futur event game expect payoff parti compar full commit contract contract impract space combin futur event larg unknown event mutual observ agent lie level commit contract method capit futur event condit contract futur mechan built contract decommit achiev contract level commit decommit agent agent freed oblig simpli pai decommit penalti parti method requir explicit condit futur agent condit dynam event verif mechan ly requir decommit possibl agent expect payoff gener assumpt analyz contract situat perspect risk neutral agent attempt maxim expect contractor pai task paid handl task handl task type constraint method specif classic task alloc contractor minim contract price ae pai maxim payoff ae receiv studi set futur agent involv uncertainti agent receiv offer contractor offer probabilist ant probabl densiti function contractor receiv correspond outstand offer payoff receiv contract made offer probabilist probabl densiti function receiv correspond outstand offer payoff variabl assum statist independ contractor option make contract wait option make contract contractor wait agent make full commit contract price make level commit contract contract contractor decommit decommit restrict attent contract agent paid decommit contractor decid decommit offer offer decid decommit offer framework interpret model situat agent cost structur handl task task handl chang due resourc back game agent futur subset game game probabl mass point contractor realist practic contract perspect nash equilibria contract concern ration agent reluct decommit chanc parti case agent freed pai collect penalti show decommit level commit featur contract parti expect enabl contract set full commit contract benefici parti contractor decommit low task handl low cost denot decommit threshold decommit probabl decommit high paid handl task denot decommit threshold decommit probabl sequenti decommit game sequenti decommit agent reveal decommit parti decommit implement analyz order discuss set decid case contractor decid analog altern level commit contract differ agent pai penalti decommit contractor move decommit hold contract agent pai decommit penalti decommit contractor move decommit ae contractor ae decommit decommit contractor ae def simultan decommit game simultan decommit agent reveal decommit simultan discuss variant pai penalti decommit contractor decommit equat rule contract agent paid decommit equat ae def decommit equat rule contract agent paid decommit equat ae def type simultan decommit agent pai decommit contractor decommit equat rule contract agent paid decommit equat ae bp def decommit equat rule contract agent paid decommit equat ae def contract optim implement calcul nash equilibria amount solv simultan equat easi comput agent expect payoff contract develop algorithm contract price decommit penalti maxim sum agent expect divid gain long parti benefit optim algorithm account agent decommit nash equilibrium user input graphic textual contract optim separ vari base reveal decommit simultan protocol agent pai penalti decommit optim contract protocol present safe exchang planner contract execut difficult electron commerc physic commerc parti anonym disappear easili shop agent vanish simpli kill contract parti entiti agent repres problem lack uniform law electron commerc commerc countri import aspect contract execut make seller buyer good risk parti receiv motiv vanish deliv part contract avoid trust parti payment carri transact parti deliv part intermediari todai electron commerc implement variant parti payment seller buyer verifi receipt good disadvantag parti compani cost run recov fee contract price contract parti method tackl problem parti develop exchang divid chunk parti deliv small amount exchang proce altern method suitabl set divid good chunk case inform good comput servic sequenc call safe parti motiv follow exchang step anticip profit rest exchang vanish parti deliv safe sequenc execut perfect nash equilibrium chunk safe sequenc sequenc deliv chunk safe part built safe exchang planner call case singl good user input graph buyer valuat accru function graph show seller cost accru case multipl distinguish user list good unit good state exchang good deliv unit good deliv user input buyer valuat seller cost note combin indistinguish good unit singl good significantli reduc state space number unit deliv user input gain seller forego avoid reput cost defect gain buyer forego base planner find safe chunk minim number chunk safe chunk sequenc exist user alert chunk algorithm chunk sequenc algorithm highli topic longer futur paper code join gui complet prototyp exemplifi featur facilit effici ecommerc futur configur auction includ varieti gener combinatori price set bid mobil user support auction type level commit contract optim determin optim contract price decommit penalti varieti level commit account ration agent decommit safe exchang planner enabl anonym exchang divid exchang chunk sequenc chunk deliv safe altern buyer seller mechan exhibit interest interplai algorithm game theoret incent engin futur plan add gener reput product evalu vote coalit format sit top auction web acknowledg program auction alan contribut develop mobil agent compon zhou contribut analyz program level commit contract optim refer lawrenc peter demand reduct ineffici auction technic report depart chandra magnu greedi local search weight set pack approxim annual symposium discret algorithm januari clark price public good public grove incent team magnu lau graph partit local search applic constraint max journal graph algo magnu approxim independ set graph jansen intern workshop approxim algorithm combinatori optim problem page juli springer lnc johan cliqu hard approxim acta royal institut earli proc ieee symposium foundat comput scienc effici bound stabl vertex set pack problem discret appli karp reduc combinatori problem raymond miller jame complex comput page plenum john mcmillan analyz auction journal econom john mcmillan sell spectrum journal econom raiffa art scienc negoti harvard univ eric game inform basil combinatori auction mechan airport time slot alloc bell juan pablo carl electron auction intern confer practic applic intellig agent technolog michael ronald manag combinatori auction manag earli rutger center oper research technic report tuoma sandholm victor lesser advantag level commit contract protocol nation confer artifici intellig page august tuoma sandholm implement contract net protocol base margin cost calcul nation confer artifici intellig page juli tuoma sandholm limit vickrei auction comput multiag system intern confer system page decemb tuoma sandholm transact ieee internet special issu electron commerc tuoma sandholm algorithm optim winner determin combinatori auction technic report washington depart comput vickrei competit seal tender journal peter michael william walsh michigan internet configur auction server human softwar agent intern confer autonom agent page minneapoli
IR/1022 5 crawl world wide web arbitrari predic abstract aggarw ibm watson ctr yorktown ny enorm growth world wide web recent year made import perform resourc discoveri cientli idea kei techniqu crawl topic portion world wide web quickli explor web page concept intellig crawl learn characterist linkag structur world wide web perform crawl speci intellig crawler inlink web page candid url behavior inlink web page sibl order estim probabl candid crawl gener framework crawl techniqu base ned understand topic structur web techniqu discuss paper applic crawl web page satisfi arbitrari ned predic keyword queri combin unlik provid repres topic crawler learn topic refer techniqu intellig crawl adapt natur adjust web page linkag structur learn crawler capabl knowledg gain crawl order provid cient crawl close relat predic keyword world wide queri introduct rapid wide problem resourc collect world wide web relev past year user search index collect document base topic copyright held hong kong acm ibm watson ctr yorktown ny philip yu ibm watson ctr yorktown ny keyword queri anumb search engin technolog lyco recent year standard method search queri engin collect larg aggreg collect document provid method queri strategi run problem billion document web web continu grow document dai result problem scalabl term storag perform interest method recent year fish search crawl essenti idea crawl short rang topic local web local order design ectiv techniqu resourc discoveri start chosen point maintain crawler rang topic hub author di erent web page identi ed crawl idea framework resourc topic occur form hub page page link larg number page author content correspond hub topic link author method model addit techniqu order perform crawl ectiv start recent work crawler concept order improv cienci crawl relat work found basic idea crawl select attract perform crawl techniqu reli restrict model base notion linkag structur world wide web behav speci crawl assum kei linkag web page topic link topic sibl web page point web page point page topic page refer hub highli page point refer author typic hub subject point author order achiev cientli nding resourc crawl techniqu start set repres topic forc crawler stai topic gather web page topic de ned hypertext classi er repres data set topic class crawl system depend hierarch scheme order ectiv crawler web page close relat current topic relev forc crawler hard soft rule rule class hierarch relat order identifi candid document suitabl explor observ greater level focu forc relev crawler stagnat show sensit system arbitrari predic classi cation system combin di erent kind constraint web page provis train hierarch classi er repres web resourc structur practic perspect stagnat result crawl techniqu highli sensit qualiti hierarchi user arbitrari predic order perform resourc discoveri arbitrari predic simpl keyword search engin data topic search hypertext classi er similar topic linkag predic implement subroutin content url string web page order determin relev assum user exibl modul comput predic assumpt crawl model avail start point repres topic area discoveri user awar start point repres predic clear crawler start gener page select mine web page suitabl predic valuabl perspect resourc discoveri focuss crawl xed model assum web speci linkag structur page speci topic link topic evid document world wide web show topic local broad topic clear understand translat arbitrari predic method larg amount inform readili exact content inlink web token candid url data provid valuabl inform order direct account crawl model expect arbitrari factor turn order di erent factor vari crawl interest signi cantli gener altern crawl intellig speci model web linkag structur crawler gradual learn linkag structur statist progress web page larg number featur content inlink token candid predic satisfact inlink web sibl predic learn featur candid connect probabl satisfi predic expect exact natur depend predic document show topic true predic token candid url indic exact content inlink page provid valuabl evid import di erent featur predic assum intellig crawler learn crawl relev page intellig crawl system start gener start point collect web page relev ed predic crawler behavior random gener gradual start encount document satisfi predic crawler insensit start point learn topic good start point stabil learn crawler ensur remain topic entir process aim paper illustr depend natur import factor short rang content vari bit learn crawler advantag crawler design xed notion structur world wide web creation arbitrari predic depend critic hierarch classi cation scheme order crawler topic world wide web rapidli evolv time desir repeat queri di erent time period desir perform crawl close relat predic learn crawler kei learn inform gain crawl order improv cienci empir speci exampl case paper organ discuss gener framework factor section provid overview statist model crawl actual implement algorithm detail discuss section section discuss empir summari discuss section gener framework crawler implement graph search algorithm work treat web page node link edg time web page order text content resourc locat link crawler track node potenti list candid page web page crawl web page hyperlink link crawl page figur illustr candid crawl web page link crawl set candid illustr figur amount inform base web page link exact token url address candid inform crawler decid order visit web page aggreg level inform collect crawl model relationship featur candid actual predic satisfact probabl prioriti node order satisfi predic base inform collect crawl denot inform featur current candid relationship point crawler maintain candid node crawl calcul prioriti node inform node satisfi predic page crawl statist inform collect base relationship featur candid url predic satisfact crawl web page statist inform creat model learn structur web page crawl statist model creation order creat ectiv statist model linkag search speci featur web page make page link topic featur includ restrict content page link candid url set url token candid url ski web word url highli discuss featur extract mechan token insid candid url url web page highli relev web page server chosen randomli natur inlink web page candid url inlink web page satisfi candid satisfi predic number sibl candid crawl satisfi predic page sibl candid link page candid candid url larg number sibl satisfi good evid candid sati es predic import ofth kind featur predic crawler job learn expect crawl web page satisfi predic encount system show high speci citi nding web page satisfi ned predic overview statist model model input consist featur linkag structur portion world wide web crawl output prioriti order determin candid url crawl web visit statist model maintain dynam updat set statist inform learn set featur web page comput prioriti order web page inform set featur type includ content url linkag sibl inform prioriti order dictat candid pick crawl prioriti order determin calcul interest factor likelihood featur candid web page make page sati es predic probabilist model prioriti discuss probabilist model calcul prioriti order calcul comput ratio signi es set event make candid satisfi user de ned predic order understand point case search web page onlin mall assum page web correspond predic happen word occur insid inlink page probabl candid page belong onlin mall interest ratio event word occur inlink page order explain model develop notat terminolog event crawl web page sati es user de ned predic candid page equal probabl web page satisfi ned predic crawl estim fraction web page crawl satisfi user de ned predic fact candid url fact type fact content inlink web page candid fact set token string repres fact linkag structur url explor option slightli knowledg event probabl web page sati es predic case candid url link web page belong topic evid earlier result crawl result web page satisfi predic order evalu idea valu calcul inform accumul crawler data accumul time crawl process calcul interest ratio event event note event favor probabl candid satisfi interest ratio event interest ratio rang situat occur event make candid desir crawl set event composit event de ned occurr event composit interest ratio de ned composit event interest interest ratio larger proce examin di erent factor intellig crawl content base learn order identifi content determin predic satisfact candid set word web page link web word order decid import candid page term determin sati es predic set word lexicon small subset word present page candid de ne event qi true word present web page point candid fi event qi trueg word wi event qi true event candid url satisfi calcul remain estim paramet hand side equat order estim reli evid web page wehav crawl exact detail estim discuss section note word convei noisi calcul interest ratio word bear probabl predic ltere featur import reduct ect word high statist signi canc order calcul level signi canc satisfi predic page crawl satisfi user de ned predic total number page crawl signi canc factor event condit qi denot calcul note absolut express larger smaller correspondingli interest ratio smaller larger ned signi canc threshold de ne signi composit ratio includ term threshold note process appli word word rare statist signi subset word result free evalu level signi canc import web page interest ratio content base learn denot calcul product interest ratio di erent word inlink web page happen satisfi statist signi canc condit recal denot number standard deviat presenc greater word assumpt distribut result level statist signi canc chose consist result test url token base learn token insid resourc locat carri valuabl inform behavior web page process discuss content url appli token url url word web page ski relat inform rst appli step url order url charact url separ de ne event ri true token present url point candid assum event candid sati es predic denot interest ratio event ri denot set token present candid url case content base de ne interest ratio tabl topic local learn inform type link expect actual pred pred estim paramet hand side equat discuss section note token interest token provid signi inform order token signi canc calcul signi canc de ne composit interest ratio token base scheme product interest ratio token signi canc threshold threshold chosen reason discuss previou subsect link base learn idea link base learn similar crawler discuss crawler work assumpt high short rang topic local web fact true predic intellig crawler learn signi canc link base inform crawl signi canc learn maintain updat statist inform topic local crawl predic show crawler learn ectiv crawler collect url fraction satisfi predic linkag structur complet expect fraction link sourc destin web page satisfi predic short rang topic local discuss number higher equal interest ratio greater impli greater short rang topic local justi ed random behavior tabl illustr di erent case link encount crawler inlink web page crawl case page illustr rst column tabl column illustr expect proport web page belong linkag structur web complet random continu collect inform actual number kind link encount fraction illustr tabl web page point web satisfi assum page inform predic inlink page candid crawl web page satisfi interest ratio ofth web page satisfi interest ratio nal interest ration sibl base learn sibl base interest ratio base idea candid satisfi predic sibl satisfi parent children satisfi predic hub good place relev candid visit sibl satisfi predic web number sibl expect satisfi predic higher number sibl satisfi predic indic parent probabl candid satisfi predic comput base number sibl satisfi expect random posit evid candid satisfi predic visit dont satisfi interest ratio candid suggest candid satisfi predic denot interest ratio combin prefer aggreg interest ratio product interest ratio individu factor combin prefer sum weight logarithm individu factor alu wc wu wl ws valu wl ws weight order normal di erent factor weight import prioriti chose weight prioriti equal averag candid interest outcom strategi di erent factor perform di erent depend natur predic start perform combin factor superior individu factor provid insight issu empir section implement issu basic crawler algorithm illustr figur algorithm work crawl web page speci subroutin discard element prioriti candid subroutin calcul prioriti candid element recomput prioriti highest prioriti item occur rst algorithm begin start seed begin rst element fetch web page delet candid add outlink sati es ned store updat content link inform end end figur intellig crawler algorithm iti order base inform collect algorithm crawl time candid url unvisit candid link url ad prioriti list list maximum length depend main memori system denot figur truncat list order account achiev procedur experi limit truncat candid order track candid visit maintain hash tabl inform prioriti adjust iter procedur algorithm termin element interest ratio high interest perspect satisfact correspond termin criterion figur data consist content base learn url token link base learn inform sibl base inform speci maintain number nt url crawl number nc url crawl satisfi predic number ni web page crawl word occur number web page crawl word satisfi predic number mi web page crawl token occur url number web page crawl token occur url sati es predic number nl link crawl link sourc page page link crawl note necessarili crawl pointer page number link type tabl number denot qi denot event word occur inlink web page denot event token occur candid url number crawl web page inlink candid number satisfi predic inform valu kei paramet estim nl nl nnp quantiti calcul probabl predic satisfact word occur inlink web page slightli cumbersom maintain perspect implement time web page analyz content inlink web page comput content candid inlink page note heurist found reason algorithm inform maintain arrai counter speci counter maintain item arrai order track item item requir frequenc inform time web page counter element arrai updat algorithm figur order candid list hash tabl store inform web page link list inform page visit candid interest page content crawl candid add candid link web page list link ad web page crawl earlier check made lookup hash tabl node link list remov candid visit hash tabl inform candid url determin obtain quick access link list candid prioriti maintain hash tabl page visit mark tabl fetch page empir result primari factor evalu perform crawl system harvest rate percentag web page crawl satisfi predic ran experi di erent learn factor di erent kind predic start point section show behavior web heterogen term factor ect crawler set content base inform set url token provid greatest amount knowledg intellig crawl model composit model ectiv order discov relev resourc learn factor uenc crawl ectiv result robust composit model insensit natur start point predic tend model base xed understand behavior web discuss inher shortcom learn model address ectiv note method critic depend hierarch classi er chosen start point order perform topic resourc discoveri provid techniqu resourc predic paper crawler start gener point homepag crawl system reli gener realist result directli compar discuss provid good frame refer natur speci citi predic wehav includ result random crawl techniqu random candid fetch random order experi show set predic random crawler obtain averag hit ratio ectiv mean randomli crawl page relev predic intellig ran experi vari predic repeat crawl singl factor studi individu factor fare versu composit order illustr present curv illustr gradual improv harvest rate number url crawl lift curv illustr crawl system initi slow relev web gradual improv harvest learn natur relationship predic di erent featur web page lift curv illustr figur averag perform crawler predic sport ve di erent start point predic case classi er provid numer relev categori assum predic sati ed numer relev higher threshold shown perform random crawler clear amount lift signi result crawl system set web page major relev predic graph figur averag multipl averag perform composit case combin factor illustr di erent factor perform individu individu predic start point wehav curv natur improv term harvest rate descript classi er found individu lift curv predic categori seed art subsect illustr figur show crawler learn art relat section sport relat directori note link base interest ratio depend critic topic slower learn curv content base token base interest ratio interest aspect curv wide variat harvest rate interest composit curv outperform individu graph note behavior sibl base interest ratio point crawler hit site sport relat site high connect sport site point curv show improv perform sibl base interest ratio perform lower factor outperform random crawler token url tend show similar behavior token high relev predic encount experi start point categori crawler eventu hit site token url crawler learn close relationship token actual predic point crawler cientli leverag inform order quickli page satisfi predic base url crawler token url repres techniqu factor composit greater import robust choic predic obtain consist result varieti predic predic combin speci token url predic consist combin categor speci cation keyword illustr figur result crawl initi seed predic travel relat site keyword token base perform poorli unlik previou case link base ratio perform slightli perform composit ratio crawl trend di erent observ figur term order factor import figur illustr crawl seed predic automot relat site keyword strike aspect predic linkag base predic show low harvest rate poor topic local predic topic local factor show good harvest composit crawl techniqu result discuss figur reinforc fact di erent factor contribut di erent depend natur harvest rate harvest rate lift curv random crawler number page crawl figur averag lift curv composit content base sibl base token base link base number page crawl figur seed predic categori predic factor creat composit learn ratio show robust di erent crawl robust choic seed interest observ relev di erent factor sensit choic seed start case illustr figur predic correspond relat initi start seed clear gure order harvest rate linkag base content base ratio spite composit crawl system robust di erent seed figur comparison crawl predic di erent seed figur ve start point lead similar behavior factor seed perform yield harvest rate ectiv term harvest rate harvest rate composit content base sibl base token base link base number page crawl figur seed predic relat site keyword harvest rate number page crawl composit content base sibl base token base link base figur seed predic relat site keyword toyota harvest rate composit content base sibl base token base link base number page crawl figur seed predic categori harvest rate tabl perform di erent kind crawl predic harvest rate random start seed url url categori url composit content base sibl base token base link base number page crawl figur seed predic categori harvest rate number page crawl figur comparison crawl predic di erent seed addit test crawl system wide varieti predic start point ran system page crawl case present summari result tabl note predic rst column consist wide vari structur depend di erent kind constraint token url url keyword web classi er combin result harvest rate crawl illustr column higher perform random crawler harvest rate illustr intellig crawler cient option nding highli speci resourc behavior composit factor observ previou chart behavior composit factor relat individu chart composit factor perform factor desir composit factor weight averag crawl behavior di erent time di erent factor show high evid predic factor show evid composit factor typic highli uenc factor show interest factor signi cantli larger factor uenc prioriti case content url token base learn method techniqu built di composit creat domin individu factor moment time result cumul advantag singl factor evalu period crawl learn inform dynam case queri execut repeatedli period time crawl crawl start scratch amount inform learn crawler collect inform relat featur page candid predic satisfact expect data collect previou crawler initi learn ort reduc case illustr figur predic sport categori start seed correspond clear curv inform previou crawl start high predic satisfact harvest rate origin crawl number page crawl figur inform seed probabl high predic satisfact begin save amount initi ort slow learn phase low harvest rate abil inform potenti knowledg learn start seed crawl di erent seed close relat predic queri shop relat site keyword perform crawl start seed store learn inform perform case modi ed predic predic constrain extens url crawl start uk homepag predic interest shop book unit kingdom crawl uk section start inform learn crawl start inform collect data rst web page found crawler learn inform show harvest rate crawler inform show harvest rate clear advantag learn memori crawl ectiv crawl leverag crawl techniqu discuss inher static natur summari intellig crawl techniqu mechan dynam adapt structur relev predic learn featur inher exibl retain ectiv factor crawl order evalu includ content web url linkag url behavior show di erent factor relev erent predic base di erent creat composit crawler perform robustli di erent predic illustr advantag learn crawler term abil learn inform crawl order improv subsequ crawl refer merit cluster build categor system sigkdd improv algorithm topic distil hyperlink environ acm sigir de post search arbitrari inform mosaic www al automat resourc compil analyz hyperlink structur text www chakrabarti al mine web link structur ieee august van den dom focuss approach speci resourc discoveri www van den dom distribut hypertext resourc discoveri exampl vldb diligenti al crawl context graph vldb shivakumar comput geograph scope web resourc vldb al approxim aggreg queri web page random walk vldb page cient crawl url order www evolut web implic increment crawler vldb kleinberg authorit sourc hyperlink environ mukherjea system collect analyz web inform www
Agents/1023 1 softwar engin nick jen dept electron comput scienc uk softwar develop difficult complex construct task human undertak scienc engin disciplin complex object creat limit skill creator limit strength raw materi steel beam infinit strong bend matter complic brian reid true model techniqu appli essenti complex fred brook softwar engin model techniqu make easier handl essenti complex softwar develop harder develop lifecycl ambiti requir requir greater scope chang challeng environ greater dynam greater open softwar continu plai catch model compon design pattern softwar architectur interact agent process light method heavier method abil imagin complex applic exce abil develop booch adequaci hypothesi approach enhanc abil design build complex distribut softwar system talk outlin essenc comput ii case softwar engin iii potenti drawback iv talk outlin essenc comput ii case softwar engin iii potenti drawback iv word agent comput situat capabl flexibl autonom action environ order meet design agent comput situat capabl flexibl autonom action environ order meet design control intern state behaviour agent comput situat environ capabl flexibl autonom action environ order meet design control intern state behaviour experi environ sensor act effector agent comput situat capabl flexibl autonom action environ order meet design control intern state behaviour experi environ sensor act effector respond time fashion chang act anticip futur goal definit guess program structur program favour manufactur promot product support manag pai lip servic programm practic guess comput objectori program favour manufactur promot product support manag pai lip servic programm practic multipl agent singl agent insuffici thing singl agent system multipl agent natur multipl loci control multipl perspect compet interest agent interact interact agent inevit achiev individu manag interdepend place flexibl initi cf natur extant approach paradigm shift previou percept comput interact manufactur control order store part redo store part buffer store part manufactur control order store part redo store part buffer store part manufactur control store part redo store part store part buffer manufactur control store part redo store part buffer store part manufactur control store part redo store part store part buffer manufactur control store part redo store part store part buffer manufactur control store part redo store part store part buffer manufactur control store part redo store part store part buffer manufactur control store part redo store part buffer store part manufactur control store part redo store part buffer store part manufactur control store part redo store part buffer store part manufactur control store part redo store part buffer store part manufactur control store part redo store part buffer store part manufactur control store part redo store part buffer store part agent achiev behalf part wider problem solv initi underli relationship agent influenc behaviour relationship made explicit peer coalit author relationship subject ongo chang provid comput apparatu maintain structur interact sphere influenc canon view agent environ relationship talk outlin essenc comput ii case softwar engin iii potenti drawback iv make quantit softwar metric product reliabl maintain object agent kind li make qualit make qualit softwar techniqu tackl complex tackl complex make qualit softwar techniqu tackl complex natur complex system complex system complex form control hierarchi collect relat level abstract distinguish interact subsystem interact frequent arbitrari choic compon primit system support evolutionari growth develop quickli intermedi make qualit softwar techniqu tackl complex natur complex system comput make qualit softwar techniqu tackl complex match natur complex system comput match process show decomposit effect partit problem space complex system show kei abstract natur mean model complex system match process show decomposit effect partit problem space complex system show kei abstract natur mean model complex system agent term entiti persist thread control control make engin complex system natur multipl loci control system compet object repres reconcil context sensit fashion interact agent make natur scope interact run time make engin complex system unexpect interact expect interact set design time simplifi manag control relationship compon coordin occur basi continu activ entiti match process show decomposit effect partit problem space complex system show kei abstract natur mean model complex system suitabl abstract design model gap unit analysi construct solut paradigm oo techniqu natur model world complex system system compon interact compon relationship compon complex system system agent compon interact compon relationship compon complex system system agent compon agent interact compon relationship compon complex system system agent compon agent interact level find collect entiti collabor achiev higher level relationship compon achiev common resolv complex system system agent compon agent interact compon relationship compon chang time treat collect singl coher unit achiev common resolv explicit mechan repres manag relationship structur model collect adequaci hypothesi approach enhanc abil design build complex distribut softwar system establish hypothesi suitabl design build complex agent succe softwar engin paradigm complementari exist softwar model agent consist trend softwar engin conceptu basi root problem domain world autonom entiti interact thing agent consist trend softwar engin conceptu basi root problem domain encapsul appli state behaviour agent consist trend softwar engin conceptu basi root problem domain encapsul greater support design program compon agent system structur flexibl interact contract net auction protocol agent support system develop synthesi agent stabl intermedi form oper achiev object interact flexibl wai construct bring agent watch function emerg interplai suit develop open system talk outlin essenc comput ii case softwar engin iii potenti drawback iv moment suddenli argument blind argument georg bernard shaw autonom softwar make interact recip expect throw agent coher effici system desir simul softwar default system engin system appropri interact engin engin provid custom quot process provid quot produc consum custom servic agent provid custom quot process provid quot produc consum custom servic agent custom vet agent provid custom quot process provid quot produc consum custom servic agent design agent legal agent custom vet agent provid custom quot process provid quot produc consum custom servic agent design agent survei agent legal agent custom vet agent interact servic provis negoti agent condit servic execut price qualiti start end time design negoti protocol vet custom negoti negoti seller auction effici mean agent quickli find partner highest valuat english auction english auction initi buyer announc declar util function maximum price pai minimum accept price time wait offer minimum percentag offer exce lie auction seller submit offer lie specul offer accept protocol termin offer exce accept buyer make accept bid public termin accept offer analysi protocol prove negoti termin point buyer ly truth domin strategi point seller specul competitor bid current reserv level domin strategi interest suggest protocol protocol auction direct yield result engin survei dept part design common goal object design agent power survei agent relationship explicitli repres agent survei agent autonom impact relationship negoti cooper natur reject request meet quickli move region agreement agreement produc exist search negoti solut concept fuzzi similar talk outlin essenc comput ii softwar engin iii potenti drawback iv seldom attribut good de la comput provid power concept techniqu design implement complex distribut system practic methodolog design system useabl industri strength toolkit start scratch technolog librari interact protocol pattern acknowledg castelfranchi ed le gasser carl hewitt mike huhn vic lesser müller simon parson van parunak carl sierra mike wooldridg franco zambonelli refer sierra jen similar criteria make negoti proc int conf nr jen softwar artifici intellig agent busi process int appli artifici intellig jen mechan suppli servic int support system
IR/1024 5 machin understand bioinformat resourc robert carol ian horrock sean bechhof depart comput scienc manchest oxford road manchest uk march abstract complex question pose data resourc requir fusion evid independ develop heterogen resourc web enabl excel mechan data public transport success exchang integr depend share languag commun share understand data mean kind semant heterogen remain problem human machin mean deal heterogen bioinformat resourc terminolog found ontolog bioinformat resourc tend rich human readabl understand resourc terminolog resourc machin machin understand ontolog role machin reduc semant heterogen resourc promot flexibl reliabl bioinformat resourc paper describ solut deriv semant web machin understand ontolog infer layer solut semant bioinformat resourc natur heterogen problem present descript metadata domain ontolog allevi problem companion paper issu develop oil understand introduct conduct larg distribut data set made biologi disciplin conduct global scale rang data offer reflect disciplin complex task area molecular biologi gener data repositori form free text immedi access necessarili data access machin inform abil comput data natur languag annot meant human reader comput languag process reach stage mean natur languag annot handl ad problem terminolog differ inform readili machin access featur tabl sequenc comput process term collabor scienc extend approach data descript publish repositori commonli data access mechan user terminolog plethora specialist interrog analysi tool typic format resourc develop complex question pose biologist cross artifici boundari set data bank kei task fusion link piec evid inform compar infer test gener insight varieti inform combin expand relat complex dynam understood wai metabol pathwai signal bioinformat world wide web doubt web prove excel mechan readi public avail data effect technolog support cultur share rapid dissemin inform greatest achiev set wide establish standard level http html provid common straightforward infrastructur retriev present document exchang inform depend share common syntax inform exchang syntax applic xml interchang format vocabulari word vocabulari miss level make data understand data mean inform requir consist share understand mean inform knowledg molecular biologi interpret resourc respect essenti task combin resourc answer queri perform autom process requir explicit knowledg encod head integr softwar depend elev statu inform resourc world wide web consortium machin machin readabl bioinformat resourc problem face bioinformat respect reflect face web idea semant web site page www metadata describ content metadata machin understand natur content site page idea semant web bioinformat resourc similarli inform resourc defin link mean explicitli interpret softwar process implicitli interpret human understand share machin peopl requir terminolog metadata data describ content mean flat descript keyword schema implicit easili difficult determin type conceptu inform captur specif data record terminolog metadata useless resourc languag terminolog provid share common vocabulari search author user commun ontolog common good mean thing mean featur tabl ontolog provid share common understand domain commun peopl applic resourc overlap vari view meant reusabl refer ontolog biolog concept prerequisit inform integr ontolog plai major role support inform exchang discoveri bioinformat ontolog attempt develop bioinformat ontolog exploit biolog inform ontolog repositori potenti reusabl biolog common framework queri control vocabulari genom annot success biolog depend fidel clear commun ontolog prevent error data entri interpret gene ontolog control vocabulari annot gene molecular biolog process involv cellular locat found form phrase hierarch classif ontolog schema signal transduct ontolog describ guid user analysi data knowledg model tambi access multipl bioinformat inform ontolog user queri bioinformat tambi ontolog descript model ontolog varieti includ vocabulari term specif mean term typic classif scheme concept usual mean child concept kind parent concept isa kind dna relationship chromosom axiom assert addit fact concept rna dna disjoint instanc class support product larg existenti knowledg base refer part class definit class instanc phrase base vocabulari simpli seri taxonomi semant hierarch relationship advantag easili suffer difficulti consist mainten mainten multipl hierarchi system taxonomi relationship clearer semant coupl easili access intuit model reminisc object view world frame class slot attribut frame encapsul properti classif phrase base essenti suffer inconsist logic mistak difficult evolv dl differ form concept term properti logic reason automat classifi concept base descript classif scheme automat infer logic properti concept concept classif scheme accommod chang defin semant logic reason support dl logic consist ontolog maintain concept express logic unsatisfi term rest reason support inform model mistak descript logic base ontolog full complement ontolog compon avoid problem suffer complex model style ontolog infer layer prerequisit widespread ontolog joint standard descript exchang ontolog languag comfort cater varieti form ontolog infer layer languag knowledg languag web applic languag origin effort commun develop exchang difficulti varieti knowledg form coupl model primit commonli clean semant express descript logic frame primit facilit tool build ontolog dl facilit provis autom reason consist subsumpt check model offer world develop ontolog oil lightweight repres ontolog express present model tambi ontolog oil map syntact semant encod languag web oil potenti manag devic semant web paper introduc oil languag unit knowledg world logic base knowledg form companion paper issu describ build oil detail oil languag develop oil result effort combin featur frame dl base knowledg time compat emerg web standard make easier ontolog consist mean element web intent design languag intuit human provid adequ express power realist applic oil major familiar frame syntax model primit part knowledg model make oil daunt expert dl style syntax facilit model style ontolog start simpl term descript gradual design refin user familiar advanc featur frame paradigm facilit construct adapt editor integr tool adapt oil underli map express descript logic defin semant clear understand formal properti dl oil abil flexibl class slot form express boolean unlimit nest class transit gener defin suffici condit concept condit autom reason support automat comput subsumpt relat check consist coher classif concept highli collabor build substanti ontolog ontolog merg map mechan provis practic reason servic exploit implement dl fact system mean ontolog express oil reason fact reason section syntact encod languag web includ syntact languag xml schema semant metadata languag work group web site rdf mechan deploi metadata ontolog vehicl creat metadata oil defin extens make oil ontolog access applic ontolog oil agent oil awar rdf awar oil potenti manag devic gener semant web layer avoid throw core mix featur reason limit clear explicit oil definit descript class slot individu axiom ontolog section describ basic featur oil languag space give exhaust account featur syntax companion paper issu exampl languag class express kei compon oil notion class express class express repres concept consist collect superclass option list slot constraint class call constraint includ describ properti promot reaction call similar frame system oil class anonym class express slot constraint list superclass gene indic gene found part arbitrari boolean combin class express class class describ class instanc instanc class dna class contrast convent frame slot constraint filler superclass class assert individu slot type constraint slot filler assert kind constraint call includ quantifi restrict filler existenti quantifi restrict filler explicit cardin restrict filler describ coupl receptor region coupl receptor constraint defin remov present frame clear semant interpret existenti quantif oil differenti slot constraint defin individu data valu instanc defin class relat figur present rdf dna chromosom chromosom note filler slot compon anonym class express singl slot class definit class definit associ specif class defin primit option class express describ class class descript suffici class explicit subclass descript class iron defin class instanc iron properti transit defin dna chromosom chromosom slot definit figur oil slot definit slot addit properti slot slot symmetr function properti slot form figur assert slot slot cell cell domain rang restrict slot constrain relationship express domain rang gene protein assert gene protein class domain rang restrict arbitrari class express anonym class express boolean combin class class extend express tradit frame languag assert made slot induc hierarch relationship class axiom area express power oil exce tradit frame kind axiom assert fact class relationship standard class definit restrict form axiom assert disjoint cover cover assert instanc cover class instanc cover class cover case instanc cover class instanc cover class disjoint rna dna assert class dna rna instanc common axiom restrict class involv arbitrari class express state explicitli chemic element compound build assert reveal inconsist contradict individu limit function provid support introduct descript individu intent oil individu class support product larg existenti knowledg base directli defin class protein bind class individu concret type express concret express concret max class descript fact reason support reason concret present applic simpli ignor concret restrict reason ontolog theori underli concret understood work progress extend fact reason support concret reason oil reason servic offer descript logic support develop increment mainten ontolog highli implement sound complet tableaux subsumpt algorithm express dl spite high complex ontolog express oil verifi fact reason kei reason servic subsumpt check concept subsum set individu instanc subset individu instanc classif collect concept express partial order base subsumpt check lattic rang gener specif definit posit implicitli determin automat classif dynam process composit express ad exist hierarchi concept satisfi check concept descript instanc inconsist contradict model verif ontolog translat knowledg base reason classifi knowledg base queri oil check inconsist class implicit subsumpt relationship result report user highlight inconsist class rearrang class hierarchi displai reflect discov verifi number subsumpt relationship discov class definit note reason extend express advanc featur oil function simpl frame languag forc reason oil construct hierarchi term descript properti mean autom support build evolv classif lattic classif scheme coher consist model shown figur class definit cellular locat introduc class express definit concept concept definit layer oil oil layer avoid throw core mix featur reason limit clear explicit includ mainstream primit includ instanc includ knowledg base exchang reason support oil includ default defin defin enzym promot figur oil arbitrari order express idea includ carefulli preserv bound reason exclud featur desir discuss issu address biologi commun version issu address web commun move web inform machin readabl human inform machin process intellig servic inform search agent inform filter oil develop intern collabor part effort vision semant explicit mean similar ontolog languag call daml develop part darpa agent markup languag initi oil daml commun joint languag produc scalabl technic sound languag describ knowledg web daml oil languag merg oil lightweight repres simpl taxonomi ontolog obstruct express present model tambi point part ontolog languag offer evolutionari develop path progress introduc express construct requir companion paper issu describ initi stage build method oil power languag express power oil ontolog deploi varieti activ softwar api offer servic seri static includ xml schema rdf oil effect exchang publish ontolog sacrif express forc abandon prefer model formal current oil activ applic manchest produc version gene ontolog oil develop gener tambi ontolog oil descript experi companion paper issu exampl oil ontolog found tool fact reason logic suffici reason implement effici make reason empir tractabl corba idl clean api tool develop includ oil editor manchest extens adapt ontolog integr www metadata languag oil effort major contributor darpa attempt defin ontolog languag develop extens rdf includ logic rdf map rdf semant absent time announc semant web activ oil central role issu unresolv oil limit default reason gener axiom bioinformat commun major issu number bioinformat resourc solut describ resourc scale resourc dynam resourc chang notif resourc fall emerg relationship resourc chang relev popular resourc scientif knowledg state ontolog reflect demonstr practic oil chang environ chief challeng companion issu describ earli construct ontolog cover bioinformat resourc bioinformat full potenti web resourc requir open share control vocabulari ontolog defin fundament develop underli infrastructur prerequisit widespread ontolog joint standard descript exchang oil problem fuse bioinformat data problem face develop machin understand web ontolog gain popular bioinformat commun describ resourc data consequ problem share ontolog led birth oil oil ambit knowledg mechan note origin inspir earli develop bioinformat commun robert steven support grant sean bechhof support epsrc grant refer xj whirl ro nf system collabor molecular biologi ieee intellig baader scheme integr concret domain concept languag proc page pg steven transpar access multipl bioinformat inform sourc overview sixth intern confer intellig system molecular biologi page june aaai press work group web site pg ca nw brass ontolog bioinformat applic descript logic interfac intern workshop descript page weav web busi vr guha resourc descript framework schema specif candid van horrock enabl knowledg web extend rdf schema world wide web hong chaudhri al programmat foundat knowledg base proc fensel al oil nutshel proc ca gobl support web base biologi ontolog ieee emb intern confer inform technolog applic page al knowledg model millennium design evolut proc hendler mcguin darpa agent markup languag ieee intellig jan horrock benchmark analysi fact proc tableaux page tobi practic reason express descript logic proc page karp strategi journal comput pd sm nucleic acid wilder environ merg test larg ontolog proc staab maedch ontolog engin model concept relat proc workshop applic ontolog bechhof knowledg bioinformat gene ontolog consortium gene tool unif biologi natur
DB/1025 3 tractabl queri answer indefinit constraint basic result applic queri spatiotempor inform koubaraki dept athen build greec dept electr comput engin nation technic athen greec abstract scheme indefinit constraint koubaraki scheme repres indefinit inform spatial spatiotempor applic main technic problem address paper discoveri tractabl class queri scheme start assumpt class constraint satisfi variabl elimin problem solv ptime show gener class queri queri evalu ptime data complex search tractabl instanc area tempor spatial constraint class constraint tractabl satisfi problem easili found literatur largest class class horn disjunct linear constraint ration variabl elimin horn disjunct linear constraint discov subclass tractabl variabl elimin problem class constraint largest class show properti restat initi gener result rang newli discov tractabl class tractabl queri answer problem indefinit tempor spatial constraint identifi research partial support european project chorochrono framework grant greek research technolog support postgradu fellowship nato introduct linear constraint recent constraint research repres spatial spatiotempor inform inform repres linear constraint type absolut occur rel point north point indefinit indetermin combin type point north west point queri evalu presenc indefinit inform hard problem case relat situat case indefinit inform spatiotempor remark contrast indefinit inform crucial applic spatiotempor geograph inform system imag video system import determin exist interest case queri evalu indefinit spatiotempor ptime paper scheme indefinit constraint koubaraki scheme repres indefinit inform spatial spatiotempor applic move object main technic problem address discoveri tractabl class queri scheme result origin summar start assumpt class constraint satisfi variabl elimin problem solv ptime demonstr gener class queri queri evalu ptime data complex find instanc area tempor spatial constraint class tractabl satisfi problem easili found literatur largest class class horn disjunct linear constraint ration horn disjunct linear constraint disjunct weak linear inequ linear number inequ exce variabl elimin horn disjunct linear constraint ptime discov subclass tractabl variabl elimin problem class constraint largest class show properti constraint linear constraint variabl ration number class constraint includ form result paper hold constraint set real number result constraint origin extend result full paper provid effici algorithm consist check global consist enforc constraint restat result item rang newli discov tractabl class tractabl queri answer problem indefinit tempor spatial constraint identifi extens tractabl problem identifi result interest spatiotempor constraint research peopl work tradit constraint satisfact problem methodolog paper appli problem queri tempor constraint network paper organ section review scheme indefinit constraint method queri evalu section identifi tractabl case queri evalu section present subclass linear constraint satisfi problem variabl elimin problem solv ptime section result section identifi tractabl queri answer problem tempor spatial domain section discuss question left open analysi proof omit found full version paper scheme indefinit constraint section present scheme indefinit order constraint languag ml intend structur intend interpret symbol paper constraint languag linear inequ lin languag polynomi inequ polynomi inequ express form integ variabl rang ration natur number linear inequ express form integ variabl rang ration integ languag sublanguag lin interpret set ration number obviou denot symbol constraint model constraint languag distinguish class formula call class exampl section linear inequ polynomi inequ form class lin section consid specif class lin paper class admit variabl elimin weakli close negat negat disjunct interest constraint class properti class polynomi linear sort countabl infinit set attribut sort set denot sort attribut denot associ set valu ml call domain relat scheme finit subset call assum exist disjoint countabl infinit set set uv ar set ev ar uv arl ev arl denot uv ar ev ar intersect set uv arl ev arl domain attribut empti variabl constraint scheme mark null denot letter english possibl subscript denot letter greek possibl subscript definit relat scheme indefinit tupl scheme map uv arl wff uv ar distinct conjunct free variabl includ rg ev arl call local condit tupl call proper part definit relat scheme indefinit relat scheme finit set indefinit tupl definit rule express form rn rn relat scheme ij term constant function rule form iff rn paper rule assum definit scheme sequenc rn relat scheme sort structur denot domain structur wff denot set formula notic indefinit constraint scheme rule introduct rule present paper simpli conveni relat defin exist rule assum express power respect queri ad scheme definit indefinit db scheme rn tripl sequenc indefinit constraint relat scheme rs set rule cs conjunct ev arl call relat part rs call rule set cs call constraint store definit extend constraint scheme kuper revesz introduc addit kind variabl call semant mark null valu constrain constraint store semant scheme usual semant discuss interest reader consult detail show power scheme tempor inform plan medic laboratori track patient appoint year set ration time line year assum start time interv repres dai time interv repres endpoint assum form endpoint indefinit lin applic domain implicit constraint languag union simpler order languag linear constraint tempor order languag equal infinit number constant administr appoint patient treatment begin end con smith true smith true smith radiat true constraint store repres inform schedul appoint patient smith repres tupl relat appoint appoint schedul singl dai radiat appoint schedul consecut follow strictli definit tupl reason economi express clariti exampl easili made conform definit introduc ad equal constraint local condit tupl dai inform repres constraint inform individu appoint appoint smith place month dai show spatiotempor inform captur scheme motiv work object move straight line motion vector speed assum initi posit time posit object futur time comput concret assum indefinit inform move object object id con true init po id time con true vector id con true speed id con true constraint store futur object init relat indefinit inform speed speed mile time unit futur posit object comput rule defin relat futur po pose queri comput posit object time queri evalu koubaraki defin modal relat calculu declar queri languag indefinit modal calculu essenti relat calculu modal oper append front relat calculu express modal queri distinguish possibl queri necess queri semant queri languag queri evalu procedur sketch semant queri appoint patient possibl start dai queri express app treatment answer queri app patient treatment con smith true smith radiat true constraint store true queri appoint patient necessarili place month queri express app treatment answer queri app patient treatment con smith true smith true constraint store true queri futur posit object time queri express po queri data sort po con constraint store true definit inform speed line segment return answer queri scheme express queri move point discuss express queri involv special function introduc framework queri move region express shown spatial region repres gracefulli constraint model base nest relat level nest extend scheme direct topic current research definit inform case queri evalu indefinit view quantifi elimin theori quantifi elimin framework admit quantifi elimin possibl queri free variabl db queri evalu quantifi elimin formula form vector sort formula depend db certainti queri free variabl queri evalu quantifi elimin formula form queri queri evalu elimin quantifi smith smith smith radiat result elimin smith smith shown relat queri notic instanc relat futur po deriv instanc relat object init ector speed appli rule tupl queri evalu elimin quantifi result elimin shown relat tractabl queri evalu indefinit constraint complex queri evalu measur notion data complex introduc data measur complex queri evalu function size queri schema consid fix case assum size integ constant logarithm size assum data complex easi hard answer queri indefinit constraint answer depend primarili type constraint involv type queri previou koubaraki provid upper bound modal calculu queri indefinit point constraint point constraint restrict inequ form interpret ration integ good work lower bound ptime case indefinit order artifici intellig exhibit class indefinit interv constraint class conjunct possibl queri queri answer problem ptime data complex similar result indefinit point constraint point constraint consid paper start assumpt arbitrari class constraint satisfi problem variabl elimin problem show class modal queri involv queri evalu ptime data complex reach tractabl case queri evalu restrict class queri framework introduc concept queri type type make distinct express complex combin complex deal paper view formula constraint assum integ constant formula oe assum size assumpt made queri type queri type tupl argument queri type distinguish close open queri queri open free variabl close free variabl argument modal repres possibl necess queri argument denot relat calculu express queri posit existenti form oe involv logic symbol denot queri form op vector vector relat op modal oper fourth argument constraint denot class constraint queri condit db binari relat queri belong queri class type indefinit constraint ariti class constraint constraint class local condit attribut ariti valu monad ariti predic attribut constraint class local condit tupl attribut constraint class constraint store predic local condit conjunct linear constraint constraint store set linear constraint repres type result type consist singl constraint constraint store belong class local condit tupl consist singl constraint class type repres result definit rest section definit class constraint class constraint defin constraint iff disjunct negat definit class constraint problem decid set constraint satisfi denot sat problem elimin arbitrari number variabl set constraint class denot number variabl fix problem denot fv present result assum data complex measur close queri rest section sort queri variabl omit breviti class constraint member refer lemma class constraint evalu queri class indefinit constraint class decid consist set formula form cs conjunct polynomi size theorem class constraint sat fv solv ptime indefinit constraint class queri class problem decid solv ptime data complex lemma class constraint evalu queri class indefinit constraint class decid consist formula form cs conjunct polynomi size theorem class constraint sat fv solv ptime indefinit constraint class queri class problem decid solv ptime data complex turn attent tractabl queri evalu open queri lemma class constraint evalu queri class indefinit constraint class elimin quantifi set formula form cs conjunct vector free variabl polynomi size theorem class constraint ptime indefinit constraint class queri class problem evalu solv ptime data complex lemma class constraint close negat evalu queri class indefinit constraint class elimin quantifi formula form cs conjunct vector free variabl queri number tupl singl relat refer queri theorem class constraint close negat ptime indefinit constraint class queri class problem evalu solv ptime data complex section present result tractabl queri answer problem scheme indefinit result special model indefinit lin thing find subclass linear constraint nice properti assum theorem section class constraint linear constraint subclass studi area comput recent tempor spatial reason interest class linear constraint good comput properti definit horn disjunct linear constraint disjunct dn weak linear inequ linear number inequ dn exce shown horn disjunct linear constraint subsum interest class tempor spatial constraint set horn disjunct linear theorem satisfi set horn disjunct linear constraint decid ptime nice theorem variabl elimin horn disjunct linear constraint variabl elimin ptime set linear inequ set linear describ result variabl elimin oper set linear inequ size exponenti number elimin variabl weaker result consid horn disjunct linear constraint fix number variabl theorem elimin fix number variabl set horn disjunct linear constraint ptime luckili subclass linear constraint variabl elimin ptime turn definit diff constraint linear constraint form constant constraint class extend class differ constraint diff constraint studi tempor reason ad form theorem set diff constraint consist decid time number variabl elimin number variabl time number number variabl extend class diff diff constraint sacrif nice comput natur extens mind class constraint definit constraint linear constraint form variabl constant class constraint give exampl constraint interest subclass linear constraint spatial express order constraint approxim arbitrari region approxim bound box present class limit form neg inform remov point straight line theorem main result section show constraint give express power diff constraint sacrif nice comput properti theorem set constraint consist decid time number variabl elimin number variabl time number number variabl acronym linear inequ unit coeffici variabl inequ constraint integ studi present constraint logic program system constraint applic solv finit domain constraint natur question extend theorem class constraint linear constraint form ax variabl ration constraint consid paper includ open problem variabl elimin constraint ptime consid monoton constraint constraint form show condit involv graph variabl elimin strongli polynomi time polynomi depend coeffici tractabl queri answer indefinit inform tempor spatial domain recal queri type tupl form type tupl form argument constraint vari constraint class class diff obviou encount class case local condit tupl consist singl constraint case constraint constraint class tempor spatial ia interv algebra allen ia includ interv relat translat conjunct order constraint endpoint interv ia includ interv relat translat conjunct constraint endpoint interv constraint disjunct weak inequ form form addit constraint number inequ exce gener ia dimens base concept rectangl rectangl defin coordin lower left upper corner basic relat describ configur rectangl includ relat properti oe conjunct constraint variabl conjunct constraint variabl pa pa point algebra pa includ relat theorem result section identifi tractabl queri answer problem indefinit linear constraint theorem evalu queri queri queri queri perform ptime data complex part theorem extens ptime result possibl queri conjunct diff constraint theorem mention constraint object explicitli luckili true result interv constraint deduc immedi account subsumpt relat class interv point constraint part theorem impli evalu queri ptime data complex extens ptime result possibl queri conjunct constraint part theorem impli evalu queri ptime data complex interest result spatial indefinit inform result gener defin algebra theorem constrain ariti predic result van der meyden constrain consist monad predic van der meyden discov tractabl queri answer problem certainti queri order constraint result theorem theorem evalu queri ptime data complex move binari queri answer problem unlik proven lower bound result show boundari tractabl hard queri answer problem respect class queri consid boundari identifi easili respect constraint class consid horn disjunct constraint constraint class intract consist check problem ia tractabl result theorem invalid gener research draw inform pictur tractabl intract queri answer problem deal express complex combin complex paper queri problem consid theorem shown hard combin complex measur introduc addit restrict queri arriv queri answer problem ptime combin complex simpl case pa constraint similar detail studi complex queri answer framework left research final mention work tractabl tempor reason framework similar detail comparison work easi stage formal kind deduct rule encod model refer grahn queri set world acm sigmod intern confer manag page jf allen maintain knowledg tempor interv commun novemb lf del tempor relat june catania manipul spatial data constraint scholl proc int symp spatial number lectur note comput page juli springer berlin comput complex queri bound differ constraint artifici chandra harel structur complex relat queri journal comput system dean boddi reason partial order event artifici pearl tempor constraint network intern confer principl knowledg page dq constraint queri algebra phd dept comput brown dq kanellaki constraint queri algebra grahn problem incomplet inform relat technic report report depart comput publish lectur note comput scienc springer system complex spatial queri acm sigmod intern confer manag page grumbach su finit acm symposium principl page linear constraint logic comput complex springer verlag lnc spatial reason base allen tempor logic technic report rh mh cs na vazirgianni foundat repres queri move object technic report harvei stuckei unit variabl inequ integ constraint solver constraint logic program australian comput scienc confer comput scienc page ds naor simpl fast algorithm linear integ program variabl inequ siam journal imielinski incomplet inform relat journal michael peter ronald finit domain volum lectur note comput page springer linear program approach tempor reason pc gm pz revesz constraint queri languag acm symposium principl page pc gm pz revesz constraint queri languag journal comput system koubaraki model infinit indefinit tempor inform inform march koubaraki foundat indefinit constraint intern workshop principl practic constraint program volum lectur note comput page springer koubaraki foundat tempor constraint phd comput scienc dept electr comput nation technic februari electron koubaraki tempor semant complex clifford recent advanc tempor intern workshop tempor septemb workshop page koubaraki local global consist tempor constraint network intern confer principl practic constraint program volum page septemb koubaraki tractabl disjunct linear constraint intern confer principl practic constraint program august koubaraki local global consist tempor constraint network theoret comput februari invit submiss special issu dedic intern confer principl practic constraint program montanari rossi koubaraki complex queri evalu indefinit tempor constraint theoret comput januari special issu uncertainti deduct lv lakshmanan koubaraki queri tempor constraint network ptime forthcom gm su spatial extens sql page thompson fundament spatial inform system academ bernhard nebel reason tempor maxim tractabl subclass allen interv algebra journal januari egenhof topolog relat world minimum bound studi acm sigmod intern confer manag page paredaen spatial final frontier page pz revesz close form datalog queri integ order intern confer page robert decid linear inequ comput loop residu journal ap dao model queri move object ap dao queri uncertain posit move object tempor research volum page springer subrahmanian principl multimedia system morgan peter van beek tempor queri process indefinit inform artifici intellig peter van beek robin cohen exact approxim reason tempor relat comput van der meyden complex queri indefinit data linearli order domain acm symposium principl page full version pp vardi complex relat queri languag acm symposium principl page vardi queri logic journal comput system marc henri kautz constraint propag algorithm tempor reason page marc henri peter van beek constraint propag algorithm tempor report ds weld de read qualit reason physic page morgan yannakaki express combinatori optim problem linear program proc acm symposium theori page
AI/1026 2 execut schedul autonom robot offic michael dept comput scienc abstract schedul task autonom robot offic carri schedul task reliabl effici pose challeng problem autonom robot control carri job reliabl effici autonom mobil servic robot act human work environ view job everydai accomplish longterm effici optim episod exploit opportun avoid problem flexibl robot forc gener schedul base partial inform implement control schedul activ emploi concurr reactiv plan reschedul action perform action plan repres transpar easi transform schedul schedul repair method implement plan transform rule introduct carri job reliabl effici autonom mobil servic robot act human work environ view job everydai activ instanc everydai perform offic servic schedul everydai activ differ schedul task job schedul space shuttl schedul transport schedul ffl effici goal schedul everydai activ optim effici episod compet offic distribut empti envelop expect consumpt profil perform deliveri job distribut envelop chanc robot pickup empti envelop deliv letter miss deadlin prepar action make perform individu job slower expect improv perform significantli ffl robust flexibl schedul gener base partial inform environ task incomplet task specif letter wolfram desk deliv lack proper descript envelop destin letter robot postpon execut inform act requir robot watch opportun exploit detect avoid problem execut schedul activ ffl experi inform acquir extend experi exploit comput schedul knowledg time individu user upload unload item exploit estim requir time accur import schedul autonom robot offic interleav deliveri reschedul problem exploit opportun schedul predict exploit opportun detect failur activ thread miss deadlin import comput schedul minim path length load unload amount time implement control schedul activ emploi concurr reactiv plan reschedul action perform action plan repres transpar easi transform schedul schedul repair method implement plan transform rule fig rhino research schedul everydai activ carri context structur reactiv control design robust effici execut deliveri plan autonom mobil robot rhino fig robot main contribut paper show instal modular transpar schedul complex concurr reactiv robot control explain design schedul control robust execut schedul describ plan transform techniqu schedul reschedul everydai activ schedul method work deliveri routin implement plan program subroutin place construct synchron parallel physic action make plan reactiv robust incorpor monitor reaction trigger observ event programm construct schedul activ complet descript control carri kind primari action accomplish robot monitor maintain condit success effici execut primari activ mean primari activ execut satisfi polici polici concurr process run primari activ activ interrupt primari primari activ handl interrupt due make suitabl prepar success continu reactiv primari activ separ opportunist primari activ primari activ primari robot accomplish order subplan activ primari execut order constraint order navig task activ primari task opportunist primari robot accomplish autonom complet wait enabl condit action open door wait door open order complet deliveri open door opportun complet user command experi carri rhino schedul capabl schedul plan transform method found rhino receiv red letter meet tabl room desk room green book librarian desk room desk room fig librari classroom hallwai fig environ offic carri primari activ outermost polici ensur command receiv process integr command primari activ receiv command polici put plan command activ primari activ src integr command primari activ plan deliv red letter plan deliv green book insert command trigger schedul polici order navig task primari activ figur show formal transform rule schedul offic deliveri task transform rule primari activ ad polici hat gener bug assumpt underli current schedul detect violat rule activ primari par plan figur plan rule instal task schedul ad order contraint schedul constraint primari activ schedul rule applic set condit bug categori navig task activ primari accomplish order constraint order satisfi accomplish activ primari task fast avoid deadlin violat overload problem rule appli set user command algorithm order navig task sort destin side hallwai fig ascend descend order initi schedul iter resolv problem miss deadlin carri object ident schedul routin implement plan transform rule appli plan plan execut applic rule integr command reschedul close primari activ plan deliv red letter pick deliv plan deliv green book pick deliv pick red letter meet tabl left room notic door room close meantim complet deliveri red letter command fail failur trigger replan polici violat schedul assumpt trigger applic rule shown figur rule control trigger close door figur user command fail rule delet fail plan user command activ primari activ add plan opportunist primari activ ad polici watch door open integr command reschedul close primari activ notic room open interrupt current complet deliveri red continu remain mission red letter successfulli deliv fig complet trajectori deliveri figur pictur rhino trajectori accomplish deliveri job start deliveri red letter head meet tabl letter load seq figur plan rule deliveri task complet close door moment door close enter hallwai deliv red letter michael estim open angl door room moment detect door close complet deliveri navig librarian desk pick green book room moment room open head deliv green book pass room point door estim process signal interrupt current deliveri complet deliveri red letter deliveri red letter complet continu deliveri green book behavior gener door stai open shown fig close open fig fig trajectori stai open fig trajectori close discuss focuss applic schedul techniqu plan control autonom mobil servic robot contribut paper lie complex concurr reactiv plan facilit schedul specif plan method mean plan transform applic schedul method robot carri schedul activ accomplish job successfulli subplan made interrupt restart control structur synchron concurr reactiv behavior achiev adapt plan schedul implement detect invalid assumpt plan techniqu perform requir adapt modular transpar specif concurr reactiv behavior distinct polici primari activ modular significantli polici enabl opportunist behavior achiev reliabl oper make simplifi assumpt research earli stage perform simpl experi valid control schedul reliabl monitor schedul assumpt schedul deliveri job execut open issu investig carefulli futur issu includ develop sophist schedul method applic learn techniqu acquir inform exploit heurist schedul method investig effect schedul techniqu behavior exhibit autonom servic robot refer plan execut autonom robot offic submit structur reactiv control submit causal model mobil servic robot behavior fourth intern confer ai plan morgan mcdermott improv robot plan execut kri intern confer ai plan page morgan mcdermott express transform structur reactiv plan recent advanc ai plan european confer page springer schedul execut automat telescop zweben intellig page morgan kaufmann fox smith isi factori schedul expert hart cohen predict explain success task durat phoenix planner proc intern confer artifici intellig plan page san cohen isol depend failur analyz execut trace proc intern confer artifici intellig plan page san veloso learn improv plan probabilist robot execut autonom agent veloso execut learn robot agent mcdermott reactiv plan languag research report yale learn improv schedul artifici zweben fox intellig schedul morgan
IR/1027 5 collabor mainten barri smyth depart comput nation dublin dublin ireland introduct paper examin classic ai problem innov solut inspir recommend techniqu collabor filter concept web commun entertain web site user autom plan techniqu provid user entertain guid dublin describ collabor mainten facilit distribut mainten user encourag maintain inform repositori background origin conceiv entertain planner object develop capabl monitor profil individu produc entertain guid user implement web site layer artifici intellig technolog care user plan content recommend system develop issu mainten sharpli focu natur domain sourc inform constantli chang inform subject natur present maintain current inform rate inform item correctli recommend user time reason limit resourc idea dedic content editor decid artifici intellig techniqu potenti solut core technolog success web shape develop number import concept firstli idea virtual commun idea onlin user automat cluster group similar tast prefer close ti concept techniqu collabor approach inform filter recommend virtual commun idea inform user filter recommend user membership commun target user recommend inform item member virtual commun inform item commun tend filter recent year wide varieti system built collabor filter recommend usenet group recommend programm kei success collabor filter abil accur associ relev inform item individu user recommend reli semant descript inform item fact user dislik item import idea research inform retriev commun concept distribut applic relev assess idea judg relev inform item distribut multipl human left singl judg tradit concept led collabor mainten strategi central idea mainten distribut popul user user ad inform item detail case review item crucial innov cm intellig framework support mainten control dissemin review inform item profil potenti review subscrib collabor mainten action collabor mainten process model introduc distinct user necessarili mutual firstli inform consum correspond tradit type user interact inform system search inform read review type user inform supplier maintain review central cm idea activ particip mainten updat inform resourc question user contribut mainten system ad data review select section assess accuraci item grade collat correl assess valid submit inform item basi process review result inform item return sourc maintain unaccept figur subscrib user submit descript item restaur system post select turn rate accuraci descript click icon repres grade agreement disagr user find descript inaccur partial accur chanc resubmit requir add suggest comment dont place interest sound import point cm system monitor activ user site order build model prefer behaviour build virtual commun user reflect inform prefer behaviour prefer collabor filter techniqu inform filter guid mainten process select review assess review result section cm strategi support select inform individu found regular reliabl sourc highest qualiti mainten inform figur user type collabor mainten concept system architectur system consist main inform perform major retriev plan commun manag handl data maintain creat manag user review manag process feedback profil manag administr acquisit user profil section describ task perform part system focu compon rel cm process figur collabor mainten architectur reason strategi construct entertain plan user suggest night retriev engin server retriev modifi suitabl entertain plan plan solut user request process ad user profil modifi plan good grade updat ad plan case user satisfi solut pass replan basi inform enter user part standard system user submit rate inform item main activ raw data plan process part system benefit cm cycl commun manag commun manag manag user commun built inform commun pass incom data sourc select target user review ensur data item undergo collabor accuraci check target user target user made group user tast similar sourc user inform percentag randomli select inform consum commun manag appli cluster techniqu profil support select target user involv cm process present time simpl cluster techniqu group user similar profil cluster process account type user user inform item rate user describ level type cooper system select group make commun group identifi type activ user rate group consist inform identifi strong collabor behaviour activ regular particip collabor mainten process higher number addit review averag user subscrib identifi date subscript post month subscript inform consum regularli read access data ad system contribut mainten system activ review manag review manag process feedback post activ review updat data relev profil manag bring date review calcul correl origin descript version prototyp result review submit select user high correl mean accuraci descript submit sourc user user submit reliabl sourc inform inform process updat data system problem inconsist inaccuraci retriev review manag activ week updat data dai origin post sourc user profil manag profil monitor user tast behavior track catalog onlin activ review inform sampl profil shown figur refer plan index commun prototyp object correl accuraci person averag rate review beer middl text review userid review userid sourc user figur sampl user profil outlin collabor strategi support mainten dynam onlin inform system user system collabor mainten user profil cluster techniqu manag addit review inform implement comput system collabor mainten concept comput architectur futur work focu evalu techniqu mean effect mainten bibliographi cohen recommend system recommend social content inform workshop recommend system aaai menlo park california acquir relev assess multipl user machin learn inform access aaai spring recommend evalu choic commun chi usa point activ collabor filter chi usa mae social inform algorithm autom chi usa build interfac high volum chi usa smyth surf digit gener guid recommend intern confer reason germani lh foster cluster method collabor filter workshop recommend system aaai menlo park california
HCI/1028 4 techniqu mobil interact ken jeff mike eric horvitz microsoft microsoft wa abstract describ techniqu motiv uniqu aspect interact handheld devic mobil set special featur mobil interact includ chang orient chang comput auxiliari activ talk gener devic introduc integr set sensor handheld demonstr function record memo devic held cell switch portrait landscap displai mode hold devic desir automat power devic user pick devic start scroll displai tilt present inform initi usabl test user reaction techniqu keyword input interact mobil mobil sensor introduct rapidli grow market mobil devic person inform manag cellular wearabl comput offer tremend opportun introduc interfac design innov marketplac compar desktop intim user carri wear daili present hci design opportun intim user experi peopl mobil devic chang design luxuri forc user work case desktop comput user accept qualiti environ light sound proxim peopl attribut context interact mobil devic remain unawar import aspect devic adapt interact suit current task situat inabl acm uist symposium user interfac softwar chi letter pp paper award detect import event properti physic world view miss basi leverag deeper share understand human comput buxton observ technolog complex result forc user explicitli maintain context interact fig prototyp pc augment proxim rang touch tilt sensor set natur effect token form build block interact mobil devic desktop comput user pick put walk put mobil devic natur occur integr part interact devic user simultan engag realworld activ walk busi talk drive typic session devic minut hour interact minim disrupt minim demand cognit visual attent augment mobil devic sensor potenti address issu georg made observ coin phrase capabl sensor sensor enabl interact modal type devic adapt unresolv research issu interact techniqu servic benefit problem implic explor research work design goal provid interfac user construct prototyp mobil devic base pc add linear acceleromet capacit touch infrar proxim rang sensor sensor combin low power consumpt cost potenti captur inform gestur sought explor rang interact techniqu gain experi gener issu explor issu integr techniqu conflict implement techniqu voic memo record speak devic speak cell switch portrait landscap displai mode hold devic desir automat power user pick scroll displai tilt suggest point design contribut design implement issu discuss challeng posit neg recognit present initi usabl test result user reaction inform experi suggest gestur voic memo record demand visual attent tradit techniqu relat work research ubiquit comput led interest provid system support background interact passiv gestur foreground interact tradit buxton describ vision contribut gener foreground background model interact import part enabl background interact develop sensor softwar detect infer inform physic activ harrison al pressur sensor detect hand user hold mobil devic hincklei al describ zhai al integr ey track tradit manual point sensor augment environ al add electron tag object assign uniqu mobil devic sensor determin ident nearbi object techniqu uniqu identifi stylu transfer inform devic context awar subject recent research idea commerci product light sensor adjust displai qualiti schmidt al describ cell phone combin sensor context sit outdoor state modifi behavior tone volum ring schmidt al explor number includ power devic base portrait landscap displai mode detect walk report usabl aspect interact behavior explor horvitz al describ architectur techniqu infer attent locat integr event sawhnei schmandt explor contextu notif schilit al describ proxim nearbi make easier user select note techniqu background support foreground activ number research effort explor sensor provid addit input navig task mobil devic rekimoto tilt menu select map harrison al small ishii bartlett tilt sensor scroll select inform handheld devic digit pen tilt sensor digit ink trail augment palmtop devic tracker creat virtual window inform space review technolog hardwar configur sensor sensor electron integr directli make devic total mobil digit input microchip interfac control microprocessor captur sensor valu pic transmit data serial port pic processor remain power devic power softwar featur execut pic processor featur implement window ce applic processor pic continu sampl sensor transmit packet host sampl touch sensor larg touch sensor cover back surfac side detect user hold devic sensor detect capacit hand manner similar sensor divid region area encount problem detect capacit singl sensor pad small mobil devic touch sensor left side screen tilt sensor devic analog devic linear acceleromet sensor detect tilt devic rel constant graviti sensor respond linear result shake devic figur show data author enter hold devic final walk meet fig tilt data top trace bottom trace tilt tilt sensor accur held increasingli insensit tilt angl approach follow curv form angl sin tilt sensor tc sensor gain paramet sensor detect sign graviti unabl determin user hold devic displai face side augment sensor simpl switch work implement limit tilt sensor respond rotat axi parallel graviti ad digit magnet found mountain overcom miss freedom futur work proxim sensor proxim sensor infrar transmitt receiv pair posit top devic timer drive ir diod beam khz ir receiv type typic receiv remot control signal receiv automat gain control output measur strength receiv signal pair close receiv reflect ir light hand signal proport distanc object fig show sensor calibr sensor measur actual distanc hand lit offic environ sensor reach maximum approxim user object move user touch sensor return maximum data noisi dark object reflect light ambient light affect practic found direct sunlight reduc rang coupl inch fig curv proxim sensor curv cm max α approxim data cm distanc raw proxim max maximum sensor α nonlinear paramet gain factor proxim sensor consum power reduc power consumpt led time user reduc duti cycl ir led output softwar architectur implement softwar context inform server act broker pic sensor applic server continu receiv sensor data packet convert raw data logic deriv addit inform applic access context data poll block share memori context server maintain latest context server notif specif piec inform implement function send messag applic applic share inform submit context server context variabl shown fig describ interact techniqu font repres context variabl thought item repres valu context variabl interact techniqu creat smarter interfac give comput sensori apparatu perceiv world nonetheless exampl interact techniqu implement specif explor point design uncov design implement reveal preliminari user reaction specif usabl problem usabl test discuss usabl issu context techniqu test user ag current user particip inform usabl test palm window ce devic philip occup particip requir devic store commonli control context variabl descript hold durat user hold long read touch dur user touch screen long contact tilt read transform fig refresh refresh event post app updat orient domin frequenc fft tilt angl dur user displai move durat devic move shake devic walk durat user walk proxim estim distanc cm proxim rang transform fig durat fig bright ambient light scroll user scroll scroll record voic memo voic record fig sensor data deriv event context server voic memo detect current devic includ voic record dedic digit voic record market find button activ control screen requir visual attent user record voic memo simpli hold cell phone microphon speak implicit gestur requir cognit overhead direct visual attent gestur specif context result combin devic devic specif impress speak devic make record implement concept hardwar user hold devic prevent activ user hold devic close approxim speak user tilt devic natur postur hand make bring object head fig describ exact criteria accept angl condit hold true devic make distinct click give earli feedback gestur start standard voic record control control issu singl sharp beep start user leav voic memo length finish user natur move devic automat stop record stop record devic enter proxim return flat orient user stop hold voic record control issu sharp beep record stop audio feedback crucial feedback gestur cue user start confirm memo record fig accept angl voic memo detect left candid angl fall line segment shown collect candid sampl devic hand neg fit pose model mx inform experi explor hypothesi voic memo gestur requir cognit visual attent tradit collect quantit data test user perform visual track task track task simul visual intens realworld drive data suggest studi separ control full subject attempt track move cross displai tradit comput standard comput gener motion sum sinusoid typic manual track experi amplitud pixel base frequenc subject perform track task simultan hold devic left hand record voic memo gestur requir user put devic record messag user record messag simultan track move cross symbol manual subject record button record voic memo button locat left side held record subject perform control condit order manual condit subject attend result user manual user click center cross start trial calcul rm error posit cross updat posit track symbol averag rm error trial outcom measur fig show result fig result inform experi tabl show averag rm error standard deviat rm error order subject perform manual condit manual condit exhibit worst averag rm error control error condit condit exhibit perform control condit test reveal manual condit condit differ significantli control condit averag subject report condit requir statist differ manual condit margin result small number subject high varianc manual occur due differ subject strategi pace record voic memo definit method carefulli control pace level perform actual voic memo record test subject prefer manual current data suggest techniqu requir cognit visual attent futur studi resolv issu usabl problem observ main usabl problem gestur easili current user expect devic react instruct subject talk cell test user comment gestur bit focu voic record work user gestur necessarili report requir find push hold listen figur show analysi workflow voic gestur support user goal record messag natur phrase task singl cognit chunk normal button hold gestur pick devic find button posit hand press button press maintain tension listen beep record messag button confirm pick devic listen beep record messag relax devic confirm complet fig workflow analysi voic record interfac subject felt concentr requir find acquir rememb maintain continu tension button particip prefer gestur button user gestur comment put face observ instanc posit user trigger voic record demonstr put devic held devic hand top displai trigger record tilt angl condit elimin transit proxim close state previou case harder note memo turn drop devic pocket hold mind tradit button solut suffer posit neg hold condit portrait landscap displai mode detect unlik stationari desktop user mobil devic tilt rotat displai orient tilt detect gestur automat reformat displai suit current view orient user read inspect spreadsheet find portrait landscap displai mode pleasant depend document content user hold natur tilt process tilt angl format window nearest rotat note assum simpli rotat bitmap fig user interfac reformat accommod displai suggest work rotat user interfac applic rotat orient input direct previou page maintain correspond displai fig portrait landscap displai mode detect applic displai automat rotat reformat ui fit screen orient spreadsheet applic user small displai digit camera orient photograph captur implement draw program reformat screen real estat accommod desir proport sketch implement draw present test user rotat displai draw curv comfort angl experienc artist constantli user place devic flat desk displai reformat undesir time fig show convert tilt angl displai orient grai zone dead band prevent chang displai tilt angl pass grai region fall white angl stai white region tilt angl fall center region devic rest flat chang displai orient fig plot tilt tilt orient import implement detail center screen center rotat render screen rotat user switch displai mode intuit transform point document point screen translat rotat matrix user place devic flat user tilt displai set chang displai mode solut simpli extend timeout switch displai mode default introduc annoi lag process displai mode switch desir maintain fifo queue recent displai orient user put devic flat search queue find stabl recent orient event displai mode chang net result devic strong tendenc maintain current displai mode user put test user pick put devic user felt expect expect revert portrait user felt easi switch displai mode turn displai rate user techniqu snow explain easi chang direct show screen user switch displai tradit menu drop menu bar prefer switch displai mode averag rate user prefer user dislik drive control test user comment easili show inform screen friend seat tabl simpli tilt displai person switch technolog afford inform share displai respond minim interrupt flow test user express concern displai chang orient twist show seat schmidt automat portrait landscap techniqu screen orient adapt devic orient stabl chang orient descript behavior issu bartlett switch displai mode user stand devic edg algorithm quickli determin orient contribut approach integr tilt scroll displai tilt scroll portrait landscap mode idea tilt scroll displai mobil devic document previou work contribut issu signal twist due time user screen real estat optim contact screen initi scroll scroll continu user contact advantag touch sensor engag scroll sensor larg surfac area requir muscl tension maintain contact inadvert contact flat tradit button pressur sensor prefer bartlett tilt gestur lock scroll previou system set predefin rel scroll place system orient user initi devic displai mode comfort postur observ applic menu top start bar bottom scroll user hide widget reappear user user touch view document screen transfer function experi transfer function calcul rate scroll tilt basic form α calcul veloc scroll control chang angl size dead α nonlinear paramet perform optim studi calcul veloc tilt substitut tilt valu equat set dead band user hold full screen dead band prefer implement variat basic transfer mix axi dead band cutoff squar shape consid give input map slight affin move principl ax move aid adjust dual axi adjust dead band size normal unit vector multipli result compon axi result circular dead band region fluid motion move tilt ax singl axi method motion occur principl axi time appli equat axi maximum veloc compon axi set rapid scroll long distanc accomplish drift cost make diagon movement difficult feel approach requir dexter prevent user larg space unintend drift behavior fit spreadsheet demonstr emploi usabl user transfer function permit user trial transfer bartlett similar method base videotap felt concern walk devic fig linear significantli affect tilt angl walk user walk linear perpendicular displai contamin tilt signal present problem user make scroll motion order contrast lcd appar contrast film activ matrix lcd view angl screen dim user tilt displai scroll gener approxim calibr curv contrast effect view screen angl manual adjust contrast level contrast approxim result equat contrast fig view angl contrast set assum user start scroll good view appli model adjust contrast user scroll prevent requir tilt angl chang previou contrast set readjust user stop continu contrast tilt displai return orient origin scroll action return contrast origin reset contrast immedi user stop scroll undesir drastic chang current approach subtl flash screen lessen effect intermedi contrast set hardwar test user notic contrast tilt tilt effect appar contrast integr portrait landscap mode integr portrait landscap mode detect present difficulti interact techniqu tilt control action screen chang orient scroll applic share scroll event context server applic determin user scroll rotat scroll consist user stop scroll screen screen tilt displai orient screen chang displai mode tilt applic rememb logic displai mode scroll end displai mode remain fix updat displai mode receiv event orient problem remain user switch orient stop unnatur move displai orient back desir user combin scroll detect encount usabl problem displai mode switch orient devic scroll displai held time chang test felt tilt good scroll averag implement scroll direct pad direct pad scroll larg averag user felt tilt intuit direct comment easier oper easi leav hand simplifi find user neg bit spreadsheet power manag find power button mobil devic physic awkward demand attent power button balanc desir easili access danger hit power button held carri devic pocket test user report anecdot drain observ peopl typic hold postur press power button elimin explicit button press power user hold devic displai portrait state persist pic power devic result devic power pocket user hold devic turn user simpli touch push rest desk user set true tilt tilt greater implement automat portrait displai orient timeout prevent power due transient short user wait base usabl timeout slightli shorter user discov pick devic devic turn test user devic carri intend test user experienc result tilt inabl recogn user hold devic back devic face devic power problem address ad switch disambigu orient problem subject held devic lap put devic devic tilt sensor prevent undesir screen dim due default system inact devic user continu hold assum user left devic reason prevent devic power proxim secondari indic user activ devic ly flat tabl user refer calcul comput dimens project reset idl timer proxim motion signal prevent object left devic maintain power indefinit reaction featur posit user love constantli hit power prefer button huge press button devic turn averag rate user prefer button exist devic provid function similar automat mean nokia cell phone answer call turn displai cover open harrison demonstr prototyp turn user open book cover devic similar function requir user open close easi schmidt describ techniqu user devic hand case applic switch user put devic hand switch give detail discuss integr individu interact techniqu coher system hard problem true integr interact techniqu time found adapt interact techniqu prevent undesir interact tilt displai mode current prototyp integr interact techniqu fairli prototyp continu scale add interact techniqu experi prototyp lead sensor fusion data multipl essenti expand capabl support addit interact techniqu earli version voic memo sensor devic tilt angl recogn gestur suffer posit condit made gestur casual easi neg condit made difficult perform reduc paramet space gestur multipl sensor provid gestur uniqu easi perform rare ad sensor power futur research determin optimum balanc factor reson work autonom ui work demonstr care analysi posit neg interfac design necessarili annoi design care design grace failur event incorrect infer method quantifi effect posit neg failur invalu research determin provid user mental model sensor work mitig failur quantit approach measur result failur determin effect incorrect infer bad system plan explor approach problem futur work contextu awar increasingli reli futur interfac mobil devic accomplish techniqu understood exampl contribut research suggest dumb sensor plai import role futur mobil interact recogn techniqu offer panacea ui mobil care design tast select featur subset action mobil devic support lend solut task complex ambigu hybrid design integr sensor tradit techniqu prove practic unexpect case defeat sensor care sensor deliv devic simpl pleasant direct control futur work support contextu notif benefit awar activ prototyp devic fast fourier transform hz window sampl walk exhibit domin frequenc approxim hz continu signal suffici magnitud manipul signal share event elimin algorithm correctli detect walk test suggest inform notif servic interact techniqu provid opportun poor design strength weak design space understood tradit gui design experi quantifi user perform longitudin studi determin user find techniqu annoi posit strongli research ultim deliv excit softwar fulfil ubiquit mobil devic steve touch sensor david thiel video product refer rock scroll stai ieee comput graphic chunk phrase design integr peripheri graphic interfac ipaq pocket pc framework provid explor support orient user situat inform space spatial awar palmtop virtual realiti palmtop comput acm handbook modern sensor squeez hold tilt explor manipul user input principl user lumier bayesian user model infer goal softwar pp uai pp issu develop tilt oper small screen direct manipul techniqu multipl comput wave innov institut forecast nomad scaleabl contextu notif wearabl audio comput proc mobil comput system santa ieee implicit interact workshop human comput interact mobil edinburgh van van de advanc interact al context proc intl interact applic mobil comput germani design spatial awar graspabl inerti propriocept toi tool ibm system bridg physic virtual world electron comput centuri scientif british telecom partial util human comput interact gaze input cascad
DB/1029 3 power increment evalu languag leonid libkin bell laboratori mountain avenu murrai nj usa wong kent ridg digit lab singapor summari kind increment queri evalu gener kind queri defin ambient languag increment evalu main problem find effici algorithm perform kind queri defin ambient main interest paper main question address set deal condit evalu queri increment motiv kind increment queri evalu simpl relat calculu ambient languag pariti queri return true iff cardin set queri express relat increment evalu insert replac current answer pariti negat intact delet negat current answer answer unchang algorithm defin denot class queri increment evalu languag auxiliari relat ariti ffl class queri increment evalu auxiliari data pariti union frequent consid class relat calculu ambient languag exampl queri belong defin fo complex queri express logic enhanc count transit closur oper ariti hierarchi ae ptime queri transit closur remain open belong prove lower bound difficult prove circuit lower bound part work visit inria kent ridg digit lab part work visit bell lab commerci system speak sql practic implement sql express relat algebra aggreg function group construct motiv increment evalu system base relat calculu group aggreg discov queri transit closur increment evalu core sql queri algorithm present ad ariti hierarchi core sql level goal investig deeper increment evalu capabl languag find nice descript class queri increment evalu set result show class larger suspect defin languag sql extend relat algebra group show queri data complex polynomi hierarchi defin exist queri ad determinist transit closur sql result languag increment evalu queri pspace data complex part compar hierarchi case order unord type show hierarchi level case order type paint complet pictur relationship class order unord figur reason enorm power languag term increment evalu creat maintain larg structur number code queri ineffici demonstr code algorithm increment evalu transit closur sql simpl shown perform adequ larg class graph proof gener lend effici algorithm show evalu intract increment techniqu practic prove queri increment evalu sql complex bound separ complex cf organ give preliminari theoret languag sql captur group aggreg featur definit increment evalu system nest relat relationship increment evalu system base nest languag aggreg section prove increment evalu system base core includ queri data complex polynomi hierarchi give queri belong show sql augment determinist transit closur oper increment evalu queri pspace data complex section slightli version denot sql base type equip order relat show hierarchi explain relationship class hierarchi preliminari languag sql nrc languag captur essenti featur sql studi number paper syntax slightli affect express power work version present languag defin suitabl restrict nest languag type system base rt base base rt base type domain infinit set disjoint product semant cartesian product domain type semant ftg finit powerset element type notat rt record boolean type schema oe collect relat type form relat denot type tp oe express languag fix relat schema oe shown figur adopt convent omit explicit type superscript express infer context briefli explain semant set free variabl express defin standard induct structur write explicitli free variabl express fe fe bind variabl free express fix schema oe express defin induct structur respect substitut assign variabl type write denot context shorten equal test base type order usual arithmet oper tupl oper project tupl feg singleton set comput union empti set defin semant assum set fb fe defin fe oe tp oe rt feg rt fe rt fe rt figur express sql schema oe properti sql relat part languag arithmet essenti power relat algebra standard arithmet aggreg languag power code standard sql aggreg featur groupbi aggreg function present commerci version sql languag frequent nest relat calculu nrc type system ftg set nest arbitrarili deep express nrc express sql involv restrict flat type set oper increment evalu system idea increment evalu queri languag increment evalu system consist input answer option auxiliari finit set function correspond kind permiss updat input updat function input input answer auxiliari collect produc output updat input updat answer updat auxiliari main condit input output updat function express languag previou section gave increment evalu system pariti queri relat calculu system auxiliari relat queri oper relat store element base type queri input type form fb bg queri increment evalu studi invari permut domain type exampl includ queri defin varieti classic queri relat languag criteria permiss updat restrict insert delet singl tupl input relat inform definit suffici understand result give formal definit similar definit foi type relat input rt rt record type form elementari updat form del type rt object type appli updat result insert delet ith set set type sequenc denot result appli sequenc object type queri type express type free variabl type type aux auxiliari collect function fq init aux init aux del rt aux del rt aux aux rt aux rt aux aux elementari updat associ function function aux defin del del similarli defin aux aux aux sequenc updat fu defin induct collect init aux aux init type product empti aux aux aux aux defin fq exist increment evalu system type aux collect fq type sequenc fq express maintain aux product flat type rt express nrc sql function definit appli languag properti queri express belong ffl make interest queri express increment evalu transit closur undirect graph belong remark fact mention ariti hierarchi queri ptime data complex number result exist literatur sql unabl maintain transit closur arbitrari graph auxiliari relat transit closur arbitrari graph remain sql presenc auxiliari data bound constant posit bound constraint auxiliari data transit closur arbitrari graph maintain sql queri altern path queri belong hierarchi result time paper fact maintain order queri prove section increment evalu queri data complex polynomi hierarchi queri express order sketch end base abil maintain larg set suffic model express queri theorem sql increment evalu queri data complex polynomi hierarchi posit result limit increment evalu sql queri theorem show class queri increment evalu sql larger class tractabl queri problem question replac equal view proposit exist problem complet pspace belong note suffici conclud pspace notion reduct dynam complex class restrict usual reduct notion complex pspace mild extens sql languag power increment evalu pspace queri addit determinist transit closur oper graph set edg edg determinist transit closur iff determinist path path node complet prove result proposit sql increment evalu queri pspace data complex pspace sketch proof result notat powerset cartesian product set fbg atom object proof theorem involv step show maintain nrc updat show domain order quantifi made order logic formula translat nrc step proof proposit abstract lemma lemma nrc increment evalu fbg updat proof sketch pb pb symbol nest relat immedi updat proce induct simpl base case powerset unari omit induct case case updat insert element set induct nrc maintain creat nest xg pb function form cartesian product function easili defin nrc function tupl set return set set union function defin nrc number combin fix difficult pb fx updat delet exist element set delet pb pb set compon defin nrc proof sketch theorem queri input relat rm type defin formula free ariti rt formula ff formula languag qs quantifi ariti maintain activ domain rm note definit put restrict type auxiliari relat singl insert delet relat result fix number insert delet bound maxim ariti conclud lemma increment evalu nrc power logic conclud increment evalu maintain powerset evalu queri proof sketch proposit hard show increment evalu reachabl deadlock proof sketch proposit pspace queri express underli structur order order relat activ domain maintain sql form oe formula show maintain activ domain order relat maintain flat relat type fq bg subset tupl belong subset code proof defin binari relat type fq pair appli oper defin oe subset code yield routin verifi defin note node transit closur determin partial fixpoint oper limit increment evalu sql captur polynomi hierarchi insid prove lower bound area dynam complex hard sql appar except establish easi limit address question powerset increment evalu nrc continu hold iter powerset maintain set maintain shown pspace turn lemma close limit note data complex proposit queri restrict flat exist number total size input answer auxiliari updat proof sql queri ptime data complex size output auxiliari obtain appropri chosen claim induct powerset time cartesian product set atom object maintain nrc iter corollari maintain nrc updat iff proof sketch show maintain fbg denot input denot answer initi empti initi updat insert atom object fu desir doubl powerset sql ae ffl ae sql ae ffl ae ae figur hierarchi updat delet object simpli delet set mention oper defin nrc maintain easili bound major constant low level hierarchi class queri evalu increment sql larg earlier work restrict class auxiliari ptime queri maintain investig low level hierarchi partli sever restrict element base type auxiliari relat recent result express power languag local tool theori paint complet pictur relationship level hierarchi increment presenc order essenti order base type make differ binari auxiliari relat maintain order auxiliari differ case restrict ariti auxiliari relat extens sql denot sql obtain ad rule interpret order domain base type main result relat level hierarchi theorem relationship shown diagram figur hold ae mean proper subset oe mean proof sketch shown paper hierarchi mainten order note increment evalu queri size activ domain maxim number sql sql produc polynomi size activ domain maxim number store show half ffl sql input type queri ae jxj power queri belong maintain set jxj standard techniqu test power ffl insert mainten queri produc integ exponenti size input show half ffl proof proce similarli proof reduc ariti ariti maintain larg initi segment natur number code tupl element base type code rel posit order activ tupl code standard pair function impli remain local techniqu theori queri tupl flat relat type fb bg relat type form input tupl relat defin graph activ domain undirect graph edg tupl distanc distanc graph tupl set element activ domain distanc element neighborhood consid schema restrict relat tupl isomorph biject tupl element impli impli connect theorem queri local exist integ iff fact queri pure relat type sql local local fact sql express queri defin logic count order structur violat local queri input type fb bg output type fbg refer graph part input set part input pair pair good graph successor initi segment queri good properti input jpj number node transit closur initi segment defin jpj shown good queri sql count power encod fragment monad small portion input show good belong show half ffl half show sql prove reduc problem good queri sql presenc addit unari relat input answer insert transit closur segment defin show local sql withstand ad numer type fq long order prove code sql logic modifi induct argument prove local presenc extra numer relat finit unari relat type amount color node graph color assum defin auxiliari unari fix number wit big ident color disjoint neighborhood point tupl distinguish complet proof open problem shown remain open larger complex class subsum possibl pspace queri maintain sql show problem pspace queri gener close usual reduct problem complet pspace stronger defin belong proof lend effici algorithm queri lower complex clear algorithm exist disprov close ti deep unresolv problem complex code mainten algorithm queri transit sql easi fact mainten effici graph special form gener result area restrict class input lead effici mainten algorithm refer vianu foundat vianu comput logic jcss wong principl program complex object collect type theoret comput septemb wong imposs decrement recomput queri relat calculu sql wong local properti queri languag theoret comput extend abstract su wong maintain transit closur graph sql int inform dong su ariti bound increment evalu definit polynomi time queri journal comput system scienc topor increment evalu datalog queri annal mathemat artifici dynam tree isomorph updat relat page monad np monad inform local herbrand logic colloquium north mumick subrahmanian maintain view increment page gupta mumick mainten materi applic data engin bulletin libkin notion local logic finit model wong logic aggreg oper languag captur complex class siam journal libkin count logic local properti page libkin wong queri languag bag aggreg function journal comput system scienc libkin wong increment recomput queri nest set aggreg function program languag est cluet springer lnc volum page papadimitri comput complex addison parallel dynam complex class journal comput system scienc ta schultz adept advanc environ plan track bell lab technic
Agents/1030 1 oper schedul ea dept comput ny aarhu denmark abstract optim choic variat oper mutat crossov paramet perform evolutionari algorithm type oper gaussian remain entir run probabilist frequenc applic determin constant xed mutat rate recent studi shown optim usag variat oper ea run combin idea mutat oper schedul ea agent model spatial structur variabl size subpopul model select di erent oper type appli speci subpopul result optim choic oper problem vari handl approach oper schedul improv perform power superior compar classic advanc ea approach introduct evolutionari algorithm entail issu set popul mutat crossov variat oper previou studi shown set depend actual problem optim set chang run ea author tackl problem possibl ea paramet part genom evolv evolutionari process approach relat model ea individu mobil agent oper set prefer interpret spatial posit world oper paramet valu idea approach individu attract good paramet set track cluster good set optim set chang run problem suitabl variat oper type oper arithmet found deal problem paramet oper problem depend chang time uniform crossov valuabl begin evolutionari abil creat solut gradual diminish end ea run genet varianc left lawrenc davi introduc scheme deal problem oper idea adapt oper probabl base observ perform reward oper success closest approach techniqu present oper schedul variabl size subpopul approach structur popul subpopul type subpopul oper goal oper compet control shift subpopul success subpopul gain individu speci oper size subpopul determin global qualiti gain criterion updat gener subpopul model correspond classic island tag model structur insid subpopul previou introduc ea partli resembl idea di model world interact restrict neighbour model mobil island model motiv studi present paper superior perform compar simpl spatial ea techniqu possibl extend approach assign speci mutat oper subpopul call method oper schedul compar subpopul spatial structur insid relat subpopul size result local competit recruit individu di erent subpopul oper schedul ea interest human cultur religi concept histori impact human serv great sourc inspir popul model inspir line emerg ect religion popul religi rule typic includ commit convert provid mean propag religion member acquir reproduct religi educ strong competit di erent religion main inspir real world religion competit believ restrict mate individu belong religion result hybrid evolutionari algorithm spatial system compet subpopul consist popul individu world repres grid gure cell neighbour edg grid wrap form toru size world determin world dimens paramet refer cell individu religion de ne subpopul individu group individu grid cell movement direct interact rang fig world religion membership individu centr interact individu interact mate black individu top left convert grai individu religion vari run bound minimum believ maximum believ popul size remain constant individu consist attribut genom religion attribut de ne religion individu belong chang individu convert religion individu posit world determin locat genom de ne posit search space extend origin associ speci mutat oper individu mutat oper religion studi present number religion gaussian mutat xed gaussian mutat varianc anneal gaussian mutat varianc oper section algorithm shown gure procedur begin ea popul begin random individu mutat oper speci ed individu religion end end fig work individu evalu object function individu consecut perform action random evalu random walk action move individu randomli select neighbour provid individu chang religion believ convert individu convert neighbour di erent religion tness constrain individu convert religion minimum believ member left religion size convert individu larg maximum believ constraint avoid growth religion prematur mutat oper convert scheme simpler probabilist scheme origin turn superior preliminari experi execut mate action creat spring neighbour individu religion arithmet crossov spring parent substitut parent worst tness individu belong small religion size equal minimum believ mate individu religion neighbourhood mate action execut random walk convert action ensur spring replac parent parent opportun convert individu individu mutat mutat probabl pm mutat oper speci ed religion attribut tness score entir process repeat xed number tness evalu note indic individu transform avoid artefact sequenti applic convert random walk action mutat oper mutat oper studi gaussian mutat oper di erent varianc xed varianc scheme varianc anneal scheme varianc scheme introduc varianc xed pl power law distribut power law distribut number gener model shown simpli uniformli determin shape distribut studi xed experi order evalu perform experi commonli numer benchmark problem section short descript algorithm comparison simpl ea varianc mutat origin varianc mutat algorithm test instanc benchmark problem present section number tness evalu dimens experi repeat averag tness individu evolutionari process record fair comparison combin variat oper uniform arithmet gaussian mutat xed anneal varianc found arithmet crossov varianc mutat yield superior result compar oper choic benchmark problem report result combin oper set paramet popul size mutat probabl crossov probabl tournament select tournament size mention section gaussian mutat varianc arithmet crossov variat oper elit elit size solut found popul set popul size world dimens minimum believ believ mutat probabl paramet crossov oper part mate action gaussian mutat variant gaussian mutat oper section algorithm arithmet crossov elit size appli religion benchmark problem experi numer benchmark problem sphere step problem task global optimum result access qualiti oper schedul extens compar numer benchmark problem section tabl result experi column show tness found run tness evalu column show found solut run standard deviat small compar di erenc tness valu algorithm found solut benchmark problem compar converg speed turn slower begin run compar lower gene ow model restrict mate converg slower run inferior result indic problem perform robust nal result end run test algorithm perform compar figur show averag tness tabl result obtain experi numer benchmark problem problem sphere sphere step step curv individu algorithm benchmark illustr characterist case sphere step benchmark problem shown gure perform converg speed similar evolutionari process observ shift balanc power believ chang frequenc appli speci mutat oper gaussian mutat xed varianc favour begin mutat anneal varianc candid solut figur show exampl oper execut problem discuss paper introduc spatial oper schedul techniqu call extend origin ea algorithm hybrid ea spatial system compet subpopul subpopul speci mutat oper result experi show extens improv perform signi cantli capabl obtain good solut benchmark problem converg speed end run remark fast compar note algorithm superior compar simpl ea origin benchmark problem fig perform comparison graph show averag tness individu run versu number tness evalu iter anneal varianc iter anneal varianc varianc iter anneal varianc varianc fix varianc iter anneal varianc iter anneal varianc varianc iter anneal varianc varianc fix varianc fig religion size dynam religion process experi tness evalu problem obtain good solut low requir tness evalu interest real world applic tness evalu typic comput part algorithm good perform partial contribut spatial structur popul religion addit mate restrict reduc ow genet genet varianc popul high assign special oper religion advantag suitabl oper respect schedul oper control manner qualiti individu feedback mechan scheme success convert strategi investig preliminari experi interact rang world plai kei role converg abil investig paramet lead addit perform improv result optim choic oper vari run problem depend futur studi plan investig method advantag real world multipl sequenc align evolut hidden markov model topolog problem bene oper evolutionari process interest compar oper schedul compet subpopul scheme oper reward strategi davi acknowledg author colleagu valuabl comment earli version manuscript work support danish natur scienc research council refer paramet control agent base model congress evolutionari comput vol san usa genet algorithm pb european confer arti cial life mit press compet crossov adapt ga framework ieee intern confer evolutionari comput je adapt mutat rate steadi state genet algorithm ieee intern confer evolutionari ieee press adapt oper probabl genet algorithm jd intern confer genet algorithm strategi adapt compet subpopul intern confer parallel problem solv natur spatial model evolutionari algorithm hp parallel problem solv natur cellular genet algorithm intern confer genet morgan kaufman al handbook evolutionari comput iop publish oxford press appli critic evolutionari algorithm hp parallel problem solv natur introduc spatial model critic evolutionari algorithm master denmark
AI/1031 2 handbook knowledg discoveri data oxford press predict telecommun equip failur sequenc network alarm gari weiss lab abstract comput telecommun industri reli heavili expert system manag perform network expert system develop knowledg interview domain expert extract pertin knowledg knowledg acquisit process labori typic captur qualit knowledg quantit knowledg domain telecommun enorm amount data readili analysi data mine hold tremend develop expert system monitor network perform automat identifi pattern data case studi describ project tempor data mine system call identifi faulti telecommun equip log network alarm messag project overview manag perform comput telecommun network extrem complex network thousand compon problem compon quickli propag network identifi isol fault network import aspect manag network perform order maintain avail critic import identifi fault result total failur hardwar compon expert system develop monitor network expert system answer system ro singhal answer network surveil expert monitor switch rout major traffic network compon switch experi switch gener alarm forward technic control center technic control alarm insert relat forward answer answer analyz alarm rule acquir domain expert answer determin alarm requir action forward alert describ problem technician process switch network gener excess alarm critic alarm transient problem filter result alert import function answer distinguish recur fault kei busi goal answer minim number servic affect block lost personnel mainten cost accept level expert system answer requir highli train knowledg engin extract knowledg domain expert encod knowledg useabl form knowledg acquisit process captur import quantit relationship human expert occurr messag specif time action requir data mine offer intrigu make acquir knowledg directli network alarm data task case studi identifi pattern network alarm log predict telecommun equip failur pattern incorpor rule exist answer system data mine team project singl individu familiar telecommun domain previou involv answer system project approxim time spent develop data mine softwar kdd process kdd process emploi case studi similar process project step relat section understand data mine problem step process involv gain understand applic domain goal kdd task understand acquir previou work answer expert system goal project influenc previou effort attempt data mine techniqu predict catastroph failur switch eddi weiss catastroph failur function entir switch previou effort hamper catastroph failur record studi result wide gener goal predict individu compon failur data mine previou defin term defin predict appli specif time period predict compon failur correct predict occur warn time monitor time actual failur warn time minut monitor time predict occur minut hour prior actual failur failur consid successfulli predict warn time paramet ensur suffici time respond failur predict prior actual failur monitor time paramet user control specif predict predict set pattern pattern identifi data mine occur stream alarm switch pattern pattern languag develop project kei featur languag identifi base knowledg telecommun domain alarm gener result unrel pattern languag provid pattern presenc alarm prevent pattern match fault manifest slightli wai due activ occur faulti pattern fix order alarm pattern time import behavior system chang associ time period pattern pattern alarm alarm minut pattern languag addit detail chapter select target dataset target dataset form collect week worth alarm technic control center result dataset alarm approxim variabl base knowledg domain variabl import variabl select describ alarm variabl time alarm uniqu identifi devic type diagnost code sever alarm alarm repres tupl dozen type devic hundr diagnost sever level switch recogn compon failur automat gener alarm addit effort requir order record failur alarm stream preprocess transform data compon fail varieti reason distinguish type failur alarm replac common failur alarm routin mainten test fail compon gener addit failur simpl softwar program appli target dataset prune failur alarm result dataset yield failur alarm distinct compon failur data mine task predict failur alarm data mine major step kdd process involv select data mine task algorithm appli data mine task predict task alarm record repres observ occur specif instant refer event predict task tempor data mine algorithm requir dataset predict compon failur requir identif tempor relationship data import select data mine method includ fact compon failur rare difficult predict data mine algorithm find pattern occur infrequ data low predict data mine method suit problem characterist data mine algorithm develop solv data mine task chapter interpret result data mine algorithm produc set pattern predict compon failur pattern view rule form devic recal valu comput pattern pattern recal percentag total compon failur predict percentag time predict correct note view associ recal correspond support confid select subset gener data mine softwar order pattern order gener curv curv gener view pattern pattern plot recal solut curv shown figur point curv evalu cost compon failur predict cost incorrectli compon fail correctli identifi failur valu optim point curv determin domain real cost valu estim solut domain attract solut base recal valu kdd process iter process common result feedback earlier stage kdd process project warn monitor time paramet data mine preliminari result feedback modifi paramet valu valu select evalu partli base result paramet small monitor time significantli improv abil correctli predict explor addit point neighborhood explor provid insight natur predict problem shown warn time enabl predict made inform predict failur occur shortli actual failur consolid knowledg final step involv consolid discov knowledg accomplish document distribut kei result result incorpor answer expert system form rule carri unrel dramat chang switch monitor data mine algorithm data mine task requir algorithm identifi predict sequenti tempor pattern network alarm data exist method softwar packag suitabl perform develop data mine softwar packag data mine system evolv popul predict pattern order solv event predict problem util genet algorithm base factor import exist method readili applic data mine task rule tree learner suit task oper classifi task involv stream event requir find pattern event method search directli space pattern natur data mine task requir pattern space pattern enorm difficulti predict task belief relationship alarm critic identifi felt greedi algorithm suffici explor search space reason genet algorithm method wide abil effici search larg search space issu design genet algorithm encod individu popul individu repres pattern pattern repres sequenc roughli correspond event data set alarm context pattern featur valu wildcard order constraint success pattern durat pattern pattern match sequenc event pattern match event order constraint pattern event involv match occur time period exce pattern durat telecommun form sampl gener pattern match major alarm minor repres indic diagnost code repres specifi rel order event note presenc alarm alarm stream prevent pattern match pattern gener combin exist pattern crossov oper modifi exist pattern mutat oper pattern select combin mutat select proport fit fit predict pattern base recal comput defin equat control import rel recal fit recal recal fix found lead poor perform genet continu vari high low high recal low pattern evolv tend respect gener specif pattern continu remain popul emploi recal fit function genet algorithm find pattern perform predict rare event fit genet algorithm quickli converg extrem specif search space remain unexplor detail genet algorithm weiss interest reader find gener introduct genet algorithm mitchel goldberg result target dataset split disjoint train test set place alarm switch train set remain alarm test set appli train set pattern evalu test set figur displai curv gener monitor time held constant hour warn time vari predict recal predict figur demonstr perform rule heavili affect warn time shorter warn time predict alarm occur actual failur predict failur mine pattern list domain expert curv form approxim thirti recal sec sec min figur predict perform predict pattern altern approach relat work approach solv data mine task consid approach involv reformul event predict problem classif problem transform event sequenc data classifi exampl michalski approach typic involv slide window data event fall window encod classifi base proxim event window event predict drawback approach sequenc tempor inform inevit lost transform inform import preserv advantag approach wealth exist classif method appli transform perform approach evalu telecommun predict problem network alarm data transform classifi exampl slide window result exampl fed ripper popular classif system learn rule competit gener hirsh limit amount sequenti tempor inform preserv transform process similar sophist encod emploi eddi weiss predict catastroph failur weiss identifi chronic network problem data mine approach analyz network alarm data telecommun network alarm sequenc analyz special data mine algorithm formul rule describ frequent occur pattern sequenc network alarm toivonen rule filter redund locat network problem predict network fault common pattern identifi necessarili predict specif data mine event predict extrem common pattern alarm data predict compon failur refer effect rule twelfth intern confer machin learn edit pp menlo aaai press pattern sequenc artifici intellig genet algorithm machin earn discoveri telecommun network alarm twelfth intern confer data engin pp ieee comput societi press introduct genet algorithm mit press quinlan program machin learn san morgan kaufmann mine forecast telecommun ieee expert telecommun intellig edit pp boca crc press network monitor objectori tenth confer innov applic artifici intellig pp menlo aaai press genet algorithm identifi predict pattern sequenc genet evolutionari comput confer edit pp san morgan kaufmann predict rare event event fourth intern confer knowledg discoveri data mine edit pp menlo aaai press
ML/1032 6 dynam cluster state approach symbol learn da lucent bell lab innov north room michael mozer depart comput scienc colorado august introduct research understand develop hidden layer neural network train interpret difficult typic highli distribut continu construct scatter plot hidden unit activ space pattern obtain examin scale reveal pattern broadli distribut space continu natur obtain input space activ dynam continu continu task domain benefit discret select finit set altern domain includ machin data languag higher cognit discret symbol categor standard neural network learn produc continu inappropri august accept state start state figur finit state machin languag research describ involv design induct bia learn procedur order encourag format discret intern recent approach explor learn discret neural network mozer mozer towel approach domain make strong assumpt natur task research gener methodolog make assumpt domain fact discret desir finit state machin induct illustr methodolog domain machin induct fsm defin class symbol string call languag consist string repetit posit neg figur show fsm languag fsm consist finit set state function map current state current symbol string state state fsm design mean fsm end string member languag induct problem august output hidden input figur gener recurr network architectur fsm induct box correspond layer arrow depict complet connect layer time symbol present input input hidden integr form hidden infer fsm parsimoni posit neg underli languag gener recurr network figur fsm emul induct string present symbol time input layer activ pattern current symbol end string network train output string belong languag train gradient descent learn perform relat task gile closer hidden unit activ train activ valu scatter wide activ space earli phase train network train activ tend achiev stabl valu order perform task correct expect hidden activ pattern point string present correspond state underli fsm train string languag expect distinct activ valu hidden unit underli fsm august activ hidden unit figur scatter plot hidden activ space gener recurr network hidden train languag circl correspond hidden state vector train phase cluster hidden state correspond state infer fsm consist state consequ success hidden unit activ valu tend form distinct cluster figur show typic scatter plot hidden activ space network distinct cluster evolv result train region hidden activ space identifi state present input induc state make transit correspond transit underli fsm hidden unit activ state drift state evid input string present longer train set figur plot hidden activ space figur present string train set distinct cluster emerg blend test set present model success learn emul continu intern august oo oo oo oo oo oo activ hidden unit figur scatter plot hidden activ space gener recurr network train languag string train set present distinct cluster emerg conjunct train blend test set longer string present august output hidden input cluster modul test train figur quantiz hidden activ pattern oper hope rectifi problem drift activ state dynam network match discret behavior fsm prior research achiev robust quantiz hidden state approach quantiz explor net train manner hidden state space partit disjoint region hidden activ pattern discret map center region gile basic depict figur da da pursu approach cluster scheme defin region gile al evenli segment activ segment membership consid state quantiz enforc train map hidden state time step nearest corner hypercub test hidden activ pattern discret map center region belong approach limit learn hidden activ pattern result learn lie natur cluster quantiz step group activ pattern august hidden input cluster modul output figur basic architectur correspond state quantiz process error surfac discontinu flat local neighborhood weight space gradient descent learn algorithm heurist approach requir overcom limit pursu approach quantiz integr part learn process approach incorpor cluster modul recurr network shown figur hidden unit activ process cluster modul pass layer network cluster modul attempt map region hidden activ space singl point effect partit cluster space model region correspond induc state underli state machin region adapt chang learn architectur call dynam cluster state extract architectur explor cluster algorithm forgi gaussian mixtur ball vector quantiz train august identifi cluster perform error fsm induct task effect oper cluster intern criterion good cluster primari measur affect good cluster perform error train cluster algorithm incorpor pressur produc small number cluster elabor algorithm soft cluster order integr learn procedur explor possibl dimens incorpor cluster modul involv forgi algorithm call model gaussian mixtur model mixtur model paramet adjust minim perform call model induc machin learn model continu quantiz intern state adapt cluster scheme determin number cluster partit state space train intern state interpol actual quantiz gradual weight interpol quantiz state learn progress call ff weight factor contrast prior gradual discret train variant forgi cluster algorithm simplic forgi algorithm primari reason prefer versatil intens figur outlin main step version forgi algorithm august iter pat form cluster centroid pat comput averag distanc pat centroid cluster fc pat pat form cluster centroid pat pat pat pat centroid cluster closest pat predefin paramet goto step cluster form goto step categor pat closest cluster comput cluster centroid pat pat goto step iter iter pat cluster center settl upper bound iter reach goto step goto step stop figur outlin forgi algorithm number cluster identifi algorithm algorithm begin equal centroid pattern hidden input cluster modul output arbitr figur architectur august architectur basic neural network architectur figur standard connect input context hidden connect hidden layer order gile mean net input hidden unit ijk repres activ hidden unit time repres activ input ijk repres order weight connect pair hidden layer connect output layer standard order weight architectur includ cluster modul connect feedforward feedback hidden layer time hidden layer receiv sourc extern input repres current symbol input intern input result previou hidden state task network infer fsm underli set posit neg exampl string regular languag symbol input complet string network target output posit usual sum squar differ output target error signal string cluster incorpor network epoch hidden activ state collect time step train string forgi algorithm run set vector determin number cluster august partit state vector cluster result cluster membership function map cluster membership function appli hidden state time determin hidden found interpol actual hidden state centroid state state call hidden state paramet ff determin quantiz state earli stage hidden state volatil cluster centroid noisi poor indic target intern state train make ff shift weight prefer quantiz state raw state set ff base train ff averag error string scale rang oe constant determin sensit ff respect error oe determin set insensit valu oe discuss valu smaller larger ff invari approach degrad perform test problem network train set regular list tabl defin symbol languag studi tomita includ gile al soda pollack kuhn fix train corpu string randomli gener equal august tabl tomita languag languag definit string substr string substr string number number number multipl number posit neg exampl maximum string length vari symbol total number exampl vari depend difficulti induct task tabl list maximum string length number string learn tomita languag list tabl simul detail languag input unit depend current input symbol output unit repres judgement string member languag start simul hidden unit number hidden unit learn train data number hidden unit learn languag list tabl network initi random weight rang paramet valu set magnitud obtain small variat affect august tabl train corpu languag maximum string length total number exampl tabl number hidden unit learn tomita languag languag number hidden unit august phi figur standard deviat gener error plot choic oe tomita languag valu oe order network converg train omit graph manc figur show insensit paramet oe string present symbol target output indic string posit neg languag back propag error time train network weight train continu converg set weight train exampl misclassif train error train set successfulli learn happen train simul restart initi random weight discuss train point due discontinu natur express equat complet gradient descent perform gradient cluster algorithm comput august propag error back portion hidden state origin hidden state assum small hidden state affect cluster state belong consequ assumpt network ff error propag back net describ result discuss variant architectur induc machin learn basic neural network architectur includ order weight connect input hidden layer unlik cluster gaussian mixtur model conjunct learn quantiz hidden activ space motiv incorpor gaussian mixtur model argument approach solid theoret foundat assumpt underli approach assum task face requir finit set intern true fc simpli motiv line work assum observ hidden hidden activ pattern result present symbol corrupt due inaccuraci network weight assum gaussian learn progress weight adjust perform assumpt depict figur base construct gaussian mixtur distribut model observ hidden august figur typic hidden activ space true state perform task observ hidden state assum corrupt roughli gaussian distribut denot observ hidden oe varianc corrupt state prior probabl true state hidden state space pedagog assum time paramet mixtur section discuss paramet determin noisi observ hidden comput maximum posteriori estim estim replac noisi state subsequ comput map comput probabl observ state gener true state state comput posterior probabl true state state state state map estim argmax state gradient descent train procedur requir dynam version map involv state incorpor paramet oe justif motiv august approach import paramet mixtur model number true state directli correspond number state target chosen capac emul fsm set larg includ elimin unnecessari true state initi select larg train procedur converg error train procedur restart larger train methodolog network weight mixtur model adjust gradient descent cost cost includ perform squar differ actual target network output present train complex entropi prior ln regular paramet complex cost minim gaussian nonzero maxim prior equal cost encourag unnecessari compon drop mixtur model gradient descent procedur gener back propag time incorpor mixtur model condit search space avoid constrain optim perform oe directli oe express term inspir nowlan hinton global paramet fi scale spread correspond level model perform train set assum network weight approxim target level fi ti perform error august train success train figur schemat depict hidden activ space train horizont plane repres space bump compon gaussian probabl densiti form mixtur model observ hidden state repres open circl gaussian spread shorter spike repres fact gaussian acquir prior contribut mixtur model anneal schedul robust variat result fi set note fi probabl densiti gaussian infinit greater densiti soft map map estim transform hidden state discret schemat depict probabl landscap train depict figur simul detail requir singl input unit repres current input output unit repres grammat judgement train set languag studi train number hidden initi weight rang ident previou set simul start gaussian initi random locat hidden state space standard deviat oe initi set larg set network weight august set initi valu chosen uniform distribut train random initi weight learn rate regular paramet chosen languag quick aim maxim likelihood converg train set paramet simul order learn rate order result figur show scatter plot hidden activ space typic simul languag initi condit ident cluster remov simul depict figur figur show distinct cluster evolv time similar pattern occur converg compact state compar lower plot figur network state infer activ pattern induc cluster transit state infer walk train network input pattern forc make transit state transit trivial extract induc fsm exampl fsm infer depict figur approxim time simul converg set weight yield train error run stuck local optimum error stabil nonzero case run restart perform compar studi approach tomita gener recurr shown figur cluster abbrevi version rigid quantiz train compar approach smyth version forgi algorithm quantiz hidden state train august epoch epoch epoch epoch figur scatter plot hidden unit activ stage train learn tomita languag cluster remov ax repres activ hidden unit network point plot time step train total point scatterplot repres network state train epoch august epoch epoch epoch epoch figur scatter plot hidden unit activ stage train learn tomita languag network start initi condit figur previou point plot time step train total point larg open circl cluster center august languag languag languag languag languag languag languag figur exampl fsm infer tomita languag circl repres state fsm circl label start state doubl circl repres accept state bold symbol arrow input state transit repres arrow august nc rq lq du ds misclassif nc rq lq du ds nc rq lq du ds nc rq lq du ds nc rq lq du ds nc rq lq du ds nc rq lq du ds languag languag languag languag languag languag languag figur bar graph show gener perform tomita languag altern neural network cluster rigid quantiz learn quantiz mode forgi algorithm mode mixtur model vertic axi show number misclassif test string bar averag result ten replic initi weight error bar repres standard deviat august compar earlier work da da altern architectur cluster procedur select learn paramet optim perform train ran ten replic replac run train set architectur figur compar gener perform lq approach gener perform test string part train half posit exampl half neg version outperform altern neural network consist outperform approach incorpor bia learn algorithm order encourag discret emerg train approach gener appli domain discret fsm induct grammat judgement approach specif recurr work equal feedforward network techniqu incorpor bia attract work simpl remain perform problem task suffici understood natur problem domain safe incorpor knowledg learn process acknowledg research support nsf presidenti young investig award award august refer method data analysi pattern classif technic stanford research menlo california induct discret stabil continu recurr network cluster comput scienc special issu neural comput hybrid descent architectur finit state machin induct advanc neural inform process system page san morgan kaufmann find structur time cognit cluster analysi multivari effici versu interpret classif learn extract finit state automata recurr neural network neural rule induct integr symbol subsymbol process advanc neural inform process system page san morgan kaufmann discov structur reactiv environ explor neural connectionist symbol manipul discov structur languag advanc neural inform process system page san morgan kaufmann simplifi neural network soft neural induct dynam recogn machin word space advanc neural inform process system page san morgan kaufmann august grade state tempor simpl recurr network machin interpret artifici neural map neural network rule advanc neural inform process system page san morgan kaufmann induct finit state languag recurr network advanc neural inform process system page san ca morgan kaufmann publish learn finit state machin recurr network neural
ML/1033 6 intellig control architectur applic coordin underwat vehicl kumar dept electr univ ky jame appli research pennsylvania state pa februari work complet rst author sabbat leav appli research laboratori invit prof rai dr arl support provid arl oc naval research grant author dr jerri arl valuabl input formal concept intellig control mr assist develop gure model control underwat vehicl research support part nation scienc foundat grant part onr grant abstract paper present intellig control architectur design control base observ sensor comput discret control action control action serv lower level control approach yield intellig control cascad control extract relev symbol inform incom continu sensor enabl execut behavior control discret event system comput discret control action execut enabl behavior behavior approach yield hierarch layer complex manag input rst comput higher level call comput lower level call action paper discret event control illustr intellig control architectur discuss applic design intellig control autonom underwat vehicl ocean sampl mission complet set discret event model control underwat vehicl applic formal veri cation discuss intellig discret event hierarch control autonom underwat ocean sampl introduct dynam system call highli oper uncertain unpredict environ result dynam system amen accur model convent control techniqu reli plant suitabl control design system diculti extract model plant physic law plant behavior complex model dicult plant behavior subject unpredict plant behavior stochast convent control design primarili regul disturb model perform plant model control design control requir complex system mention includ addit requir recon learn failur except capabl manag dynam chang mission elast control room inadequaci convent control techniqu reason control system accur meet speci cation scope convent led research control call intellig control intellig control er altern convent control design control structur consequ output extern command condit determin empir observ behavior refer mathemat descript plant exposur intellig control techniqu reader refer edit volum gain intellig control plant model control requir fall scope convent control reason control gener hierarch structur shown figur lower level convent control higher level intellig control control convent control convent plant intellig control figur control hierarchi intellig control lower level convent control er convent control higher level intellig control oper model construct empir evid er control capabl convent control task deleg higher level lower sensori feedback pass lower level higher level intellig control plant model ned control requir scope convent control inher techniqu control design includ expert fuzzi logic arti cial neural genet algorithm altern techniqu intellig control activ research ort direct design intellig control architectur architectur hierarch execut layer coordin layer organ layer top main idea architectur principl intellig nest hierarch control architectur design intellig control autonom system architectur consist model recoveri model systemat achiev control high autonomi gener approach model develop present architectur consist network intellig node levi model distribut intellig system intellig node consequ situat inform task command select call control system refer model architectur albu rc arrang node hierarchi perform sensor world behavior gener level abstract resolut posit node intellig control hierarchi sensor process subsystem receiv sensor input environ predic valu world model updat world model compar signal extract relev featur sensor evalu signi canc judgment subsystem pass world model subsystem updat behavior gener subsystem gener base current state world model subsystem knowledg mission goal world model subsystem receiv plan behavior gener simul send result simul judgment subsystem evalu judgment subsystem pass plan evalu behavior gener subsystem plan behavior gener subsystem issu actuat command control comput call model articul control albu model control comput intellig biolog system hierarch architectur emb intellig control special hierarch organ base physic structur system node hierarchi systemat assign intellig function accomplish task procedur accomplish call subsumpt brook architectur base idea level compet intellig identi ed begin design phase design proce construct control system achiev compet control layer ad examin signal inject signal inhibit replac exist signal layer aid achiev paper present call intellig control design intellig control control base input sensor signal mission goal comput control action shown figur control action serv lower level convent control intellig control architectur cascad input output interfac extract relev symbol inform incom continu sensor control discret event system comput discret control action discret input approach design intellig control behavior behavior high level activ independ determin manner system react chang condit execut subtask mission task behavior con gure di erent behavior mode execut execut primit call action behavior approach intellig control design natur subsystem task extract featur incom continu sensor signal enabl execut behavior control subsystem layer lower layer consist behavior control higher layer consist singl coordin implicit advantag hierarch structur control complex manag approach design intellig control requir identifi high level system control identifi di erent mode nalli identifi primit action execut execut speci behavior mode action primit activ execut execut uniqu algorithm comput lower level control design identifi condit lead enabl behavior control paper detail control introduct subsystem found section describ ocean sampl network autonom underwat intellig control underwat vehicl design architectur present overview intellig control architectur present section architectur detail control discuss section section discuss interact automata base discret event system model control analysi veri cation section detail intellig control design autonom underwat vehicl architectur discret event model control underwat control speci cation model veri present section section conclud work present preliminari introduct discret event system present appendix result paper present confer paper applic intellig control architectur sampl mobil network autonom underwat vehicl illustr intellig control architectur control applic design intellig control architectur present schemat diagram shown figur tc figur schemat diagram ocean typic ocean sampl mission begin seed ocean oor region interest number xed sensor packag deploi group autonom underwat vehicl explor region gather data capabl paramet data commun record data sonar explor region serv posit refer group capabl navig point commun sonar group consist number supervisori commun radio tactic coordin locat commun sonar subordin shown figur layer hierarchi consist group perform initi selforgan determin number locat subordin sonar surfac report avail ocean sampl oper tc radio tc contact determin resourc issu mission order gather search region coordin distribut search region subordin determin rendezv point time meet subordin develop itinerari explor gather sampl data subregion rendezv point make sonar contact collect surfac make radio contact tc download data receiv mission instruct recon gurabl layer hierarch distribut architectur node hierarchi intellig control base observ sensor signal signal lower level comput discret control action serv lower level control ector subsystem appli intellig control architectur present paper design control typic intellig control architectur intellig control architectur design base observ sensor comput discret control action serv lower level control intellig control cascad output shown figur discuss function subsystem output interfac control input interfac figur system intellig control architectur rectangular block depict oval block depict signal input intellig control receiv sensor data form data packet network raw sensor signal process signal process system input interfac read sensor data packet network store form sensor data achiev execut event sensor data read data sensor extract featur store form stimulu data transform continu signal discret symbol fuzzi pattern classi call continu inferenc net invok execut event percept control read data stimulu comput discret control store control data discret event system receiv discret sensor maintain discret output discret control action control comput control action hierarch manag stimulu data input rst comput higher level call comput lower level call action correspond shown figur control consist top level coordin base stimulu data input select behavior lower level behavior control determin control action exhibit select behavior control comput control action time event comput execut achiev sequenc event form shown figur detail function output output interfac read control action store control data gener data packet form network network receiv control action data intellig control transmit lower level control process achiev execut event send control data detail descript interfac scope paper control detail introduct base present sequenc sensor comput send control data execut invok input output execut time sensor data packet arriv occur intellig control wait sensor data packet arriv maximum time determin sensor data packet arriv time execut sequenc event sensor data packet arriv complet control cycl case control cycl initi execut diagram shown figur figur event sequenc control cycl control control subsystem intellig control architectur make control comput control action approach design control behavior high level activ independ determin manner system react chang condit execut subtask mission task mission sampl region ocean oor network order perform exhibit form team commun tc commun team reconnaiss avoid exhibit commun commun reconnaiss avoid design phase begin identifi higher level call system control exhibit execut subtask mission behavior con gure di erent mode mode behavior gure commun tc establish contact commun tc download gather data set behavior mode identi identifi lower level primit call properti behavior mode execut execut sequenc primit action behavior mode tc establish execut execut sequenc primit send receiv acknowledg radio behavior mode tc download gather execut execut sequenc primit send download request receiv download acknowledg transmit gather data radio action primit atom activ execut sequenc result execut behavior mode action primit speci es uniqu lower level control control intellig control figur action speci es speed control action action speci es messag radio commun control design intellig control requir identifi high level system control identifi di erent mode nalli identifi primit action execut execut speci behavior mode action primit activ execut execut uniqu algorithm comput lower level control design identifi condit lead enabl behavior control behavior approach design intellig control natur lead control layer hierarchi lower layer consist behavior higher layer consist singl coordin hierarchi shown figur coordin receiv sensor input stimulu select behavior suggest mode behavior monitor progress behavior modi es select case send report case failur task behavior control hand monitor sensor input coordin receiv mode con gurat input select behavior mode issu input lower level control execut sequenc primit monitor progress action sequenc inform coordin case failur function coordin behavior control layer control previou paragraph achiev combin function rectangular block figur signal oval block figur figur depict domain rang space oval function rectangular control discuss function individu order maintain coordin behavior control structur ident consist enabl function planner maintain intern state variabl call direct coordin enabl function coordin check arriv order stimulu data higher level tc level level enabl behavior set coordin direct coordin enabl behavior select execut behavior behavior behavior enabl function check arriv relev input stimulu data impli behavior enabl behavior enabl function set coordin inform coordin behavior arriv input stimulu data coordin task coordin planner fold depend current state coordin inform set enabl gener coordin sequenc enabl enabl behavior execut assign order set enabl behavior set behavior direct enabl behavior con gure mode execut coordin control control figur detail control behavior behavior planner current coordin plan begin planner owner base current behavior inform enabl behavior planner select behavior mode gener behavior plan mode behavior plan sequenc select behavior mode execut action action executor check current behavior plan execut rst action execut action comput lower level control pertin inform stimulu output control data output interfac function send control read control form data send network lower level control action function evalu success action execut check current behavior plan determin rst action behavior plan action evalu act compar assign control data result lower level control report sensor data stimulu data action successfulli delet action behavior set behavior direct inform behavior control behavior function evalu success behavior execut check current coordin plan determin rst behavior coordin plan behavior evalu act check behavior direct determin problem execut action problem behavior control unabl set coordin direct inform coordin check behavior determin behavior successfulli case delet behavior coordin plan list function control domain rang coordin enabl stimulu data coordin direct behavior enabl stimulu data coordin direct coordin planner coordin direct coordin plan direct behavior planner coordin plan direct behavior plan action executor behavior plan control data action evalu behavior plan control data stimulu data behavior plan direct behavior evalu coordin plan behavior plan direct coordin direct coordin plan control invok execut event comput execut time control cycl sequenc event shown figur time intellig control receiv sensor data packet occur function comput function achiev function control execut sequenc shown figur situat evalu oper execut oper plan figur event sequenc achiev comput sequenc execut function classi ed phase activ situat oper oper execut discuss situat achiev step ect action evalu execut action evalu behavior evalu execut function modi es coordin plan behavior plan action gener coordin direct behavior direct arriv input stimulu data evalu behavior enabl execut coordin enabl behavior enabl behavior execut function gener coordin direct behavior direct oper achiev execut coordin planner behavior planner individu behavior base current state coordin direct behavior planner gener coordin behavior plan oper achiev execut action execut rst action behavior plan gener lower level control control data control phase situat oper oper execut make control discret event system model control control discret event system discret state chang discret event function model control collect interact detail appendix deriv formal discret event model control aid analysi veri cation model formal veri cation control meet mission speci cation mission speci cation repres discret event system de ne sequenc behavior mode control system execut order accomplish mission task control design veri ed show sequenc design automata speci cation automata formal veri cation problem languag perform standard tool model autom code gener control design formal veri standard tool automat gener softwar code implement behavior model interact automata avail automata model easi redesign mainten design chang due system mission speci cation easili incorpor formal model control incorpor design easili veri ed convert execut softwar code avail model facilit softwar automaton discret event system model control track evolut state variabl automaton state variabl control control state coordin direct set behavior coordin plan behavior plan discret event system model control consist collect interact automata order simplifi complex individu automaton conveni repres collect interact automata control model consist automata direct plan initi initi state automata empti set event set automaton set control function rang space state variabl automaton track tabl event set automaton list automaton event set coordin direct coordin behavior behavior enabl direct coordin action evalu coordin plan coordin behavior evalu behavior plan action action behavior planner interact automata base de model control consist share stimulu control data share variabl stimulu data modi ed share variabl control data modi ed control guard condit state transit occur event predic set share state variabl domain space control function event correspond tabl list set variabl predic guard condit de event guard variabl coordin enabl stimulu data behavior enabl stimulu data coordin planner coordin direct behavior planner coordin plan action executor stimulu behavior plan action evalu control stimulu behavior plan behavior evalu behavior coordin direct state transit occur event action executor assign function modifi share variabl control data figur figur figur figur depict transit type automaton track evolut state coordin behavior coordin figur type transit de model control applic section sampl mobil network autonom underwat vehicl intellig control design intellig control architectur present present design vehicl endow di erent behavior deem accomplish mission goal sampl region ocean stand behavior exhibit commun commun commun occur sonar base mode con exhibit send queri establish contact exhibit issu order issu order task assign exhibit report acknowledg report complianc report gather sampl stand behavior execut commun tc commun occur radio base mode con exhibit provid statu report tc exhibit report gather sampl tc recon stand behavior exhibit vehicl survei design region ocean oor oper mode behavior behavior exhibit vehicl move design point oper mode behavior behavior exhibit vehicl visit dock oper mode behavior behavior exhibit vehicl remain idl maintain current mode behavior vehicl endow behavior control vehicl applic consist behavior singl coordin coordin behavior monitor stimulu data gener coordin direct enabl behavior mode automata repres evalu direct plan event depict figur set direct partit count point direct stimulu data share applic consist vehicl consist order receiv higher tc level level monitor vehicl coordin enabl list order applic consist resum search variabl set true order receiv consist list receiv queri establish contact monitor enabl variabl set true queri receiv consist list establish contact monitor vehicl enabl variabl set true contact list variabl set true establish contact vehicl consist list sampl data gather vehicl assign depend vehicl role chang role vehicl chang dynam set time system timer time determin minimum fuel level vehicl determin maximum amount drift posit error monitor stimulu data consist enabl gener coordin direct coordin planner gener coordin con gure enabl behavior mode gener behavior direct coordin plan case sequenc enabl behavior belong set planner rst behavior coordin gener behavior plan behavior direct rst action plan execut action gener control lower level convent control lower level convent control exist navig sonar commun radio commun subsystem primit action execut result execut behavior send sonar send statu sonar send queri radio send sampl radio move design posit maintain present posit tabl list di erent behavior sequenc primit action execut behavior mode behavior mode action sequenc recon goto figur depict automata track state variabl intellig control underwat vehicl state transit automata place event oval box occur event occur order depict figur dictat order state transit figur state transit coordin direct depict execut behavior evalu state variabl evolv depict top portion middl portion depict evolut coordin enabl recon execut transit edg pair label transit edg guard condit predic share variabl set state transit execut label transit edg result modi cation state variabl transit edg top branch figur execut event behavior evalu coordin plan rst behavior guard cp vehicl guard author state transit push coordin direct stack place state transit interpret easili point cp cp cp cp cleanup point order order resum order search author figur coordin direct nil order order fuel figur coordin direct author true figur direct bp interrupt interrupt nil figur direct cleanup point cp cp cp dh nil bp figur direct dh interrupt bp nil count point figur point count direct pop pop pop coordin plan figur coordin plan behavior plan pop nil nil resend nil transit surfac pop nil pop interrupt order bp nil figur behavior plan model speci cation veri cation mission control speci intellig control achiev repres automata model speci cation automata repres sequenc behavior mode control system execut order accomplish mission task figur show speci cation automaton figur show order resum fuel order search recon order search fuel recon order resum order dump figur speci cation automata control design veri ed show sequenc design automata speci cation automata veri cation problem languag perform standard tool present intellig control architectur design intellig control intellig control convent control inadequ due lack accur plant presenc control requir fall scope convent control approach design intellig control behavior behavior high level activ determin manner system react extern condit execut subtask mission task behavior approach natur yield cascad architectur consist subsystem control subsystem task extract featur sensor signal enabl execut task control monitor featur execut enabl behavior control complex manag system oper complex environ carri complex task behavior base intellig control architectur present paper motiv function model control design architectur architectur successfulli appli design intellig control applic discuss paper applic includ ship damag control medic applic work make architectur realist function model enhanc perform task learn control design current architectur adapt chang condit manner program unabl control scheme system capabl learn refer design hierarchi distribut intellig control introduct intellig autonom page kluwer academ albu data storag model articul control journal dynam albu approach manipul model articul control journal dynam albu refer model architectur intellig system design introduct intellig autonom page kluwer academ editor introduct intellig autonom control kluwer academ brook robust layer control system mobil robot ieee transact robot cassandra discret event model perform analysi deshpand borg de coordin applic automobil submarin control ieee confer man gupta editor intellig applic ieee editor advanc intellig control taylor hopcroft ullman introduct automata languag comput kumar model control logic discret event system kluwer academ kumar intellig control architectur ieee intern symposium intellig page septemb kumar intellig control architectur applic underwat vehicl ieee transact part submit discret event model intellig control architectur joint confer inform page octob veri cation coordin approach prentic levi model design distribut intellig system introduct intellig autonom page kluwer academ nest hierarch control introduct intellig autonom page kluwer academ gibson mobil distribut network autonom vehicl technic appli research pennsylvania state analyt formul principl intellig intellig machin gibson fuzzi logic architectur autonom multisensor data fusion ieee transact industri white editor handbook intellig control van chi architectur concept autonom system design implement introduct intellig autonom page kluwer academ discret event preliminari discret event system system discret chang asynchron occurr discret call event exampl includ manufactur commun reactiv comput manag autom trac system detail introduct reader refer de model nite collect interact automata automaton nite set state share nite set variabl automaton transit state execut event provid guard condit sati ed guard condit predic state automata valu share variabl state transit modifi valu share variabl fg nite collect automata index denot nite set share variabl variabl valu countabl domain denot domain set share variabl automata nite set nite set nite set state initi state transit state transit event state state result execut guard predic share variabl state sati ed transit share variabl assign function assign valu share variabl transit repres simpl manufactur system consist machin bu er shown figur buffer machin machin figur simpl manufactur system manufactur rst machin fetch part nite suppli idl state arriv part denot event chang state idl work nish part deposit bu er event state work idl machin fetch part bu er idl state bu er nonempti denot event occurr machin chang state idl work nish process part depart manufactur denot event return idl state model manufactur system pair interact automata automaton model machin automaton work idl initi state event set automaton consist fa number part bu er denot share variabl set transit automata shown figur figur de model manufactur system start initi state idl event occur transit state work return initi state event increment share bu er start initi state idl event occur transit state work provid share variabl exce decrement share variabl return initi state event occur collect interact automata fg model de combin synchron composit form singl automaton model de loss de ne synchron composit interact automata fg share variabl set synchron denot kg automaton kg set transit st st st set transit occur synchron particip set transit occur asynchron particip synchron composit automata shown figur
HCI/1034 4 introductori visual santo departamento de universidad de portug abstract visual offer elect msc electron telecommun present bibliographi teach method difficulti encount prepar lectur identifi introduct visual import introductori valid contribut curriculum postgradu scienc technolog consid adequ elect msc electron telecommun offer program includ thesi aim larg spectrum encompass area electr engin signal analysi process comput mean give format futur consum facilit visual techniqu system context refer introductori meant gener object introduc student area evolv address fundament provid basic good encourag appli proce work area state object introduc student visual make benefit current tool exploit applic intend give perspect perspect serv gener object relat train student perform kind work expect involv train bibliograph adequ work method correct technic commun write section descript gener bibliographi teach method introductori visual present difficulti encount author prepar lectur identifi gener content design hour spread lectur dedic activ justifi section list address present focu specif bibliograph refer section goal principl visual overview visual applic human visual system visual quantit inform framework visual techniqu foundat enabl comput digit imag process human comput interact data characterist visual product topic gener introduct area made present definit goal approach visual data present mean select adequ techniqu analysi present data main refer book keller keller lectur great intend motiv student establish focu fundament idea visual concern explor data inform graphic mean gain understand insight data present methodolog select visual exist approach keller keller section text present set imag produc data book keller illustr increment process expect seek visual data topic meant give idea larg quantiti applic visual find great scientif engin disciplin make student awar import understand topic overview present larg collect visual imag obtain varieti disciplin kind inform reveal detail visual techniqu number exampl extract bibliograph refer book brown keller topic concern visual essenti capabl limit human visual inform process system briefli stress import implic design spite share common capabl individu differ human visual system main subject lectur base document prepar author includ tutori specif bibliographi topic fact visual concept principl produc good scientif draw data plot appli comput visual lectur base interest work tuft text support colour topic present framework model describ visual system abstract framework present data product applic remain lectur introduct model scientif investig visual process present lectur base chapter refer al concept visual introduc previou topic gener manipul graphic set data investig user develop topic main element visual techniqu model classif notat visual techniqu introduc author support studi rang gener natur tailor applic techniqu illustr exampl refer brown keller topic address main aspect comput digit imag process human comput interact understand visual techniqu address issu geometr transform view overview problem method achiev illumin histogram filter imag transform gener principl user interfac design explan subject mind visual exampl includ visual techniqu introduc topic concern data classif suitabl describ type data identifi refer model present overview data format data compress techniqu overview support refer graphic file format brown shepard visual system integr provid mean support effect explor complex data topic present classif visual softwar varieti exist softwar product adopt classif hybrid classif al brown al softwar guid includ brown al illustr great varieti exist commerci product relev characterist consid choic product studi subject complement demonstr student make product part gener content curriculum present appli academ year initi main chang correspond substanti number lectur devot enabl disciplin author initi plan spend lesser amount time subject elect subject imag comput graphic human comput offer depart reason expect student visual background subject fact academ background fact student made choic order format area author decid substanti amount time devot enabl controversi point view visual reason choic possibl benefit current content commun visual educ expect experi time author expect evolut occur specif topic sequenc durat structur teach method lectur lectur distribut topic previou section practic student perform time high autonomi student work full time make difficult work session involv reason lectur assign left open activ perform extra hour session devot present select siggraph video exampl applic visit facil peopl visual regularli work present assign lectur peopl make visual siggraph video review issu scientif visual spite interest recent issu siggraph video review issu siggraph visual interest visit relat earth scienc insid laboratori remot data laboratori includ field demonstr acquisit ground penetr radar data visit guid research show student kind work involv visual techniqu tool laboratori exist visit year chemistri environ lectur extern peopl concern visual archaeolog data geograph inform great varieti subject interest gener object includ train student bibliograph adequ work method correct technic commun write object easier achiev evalu base practic assign expect number student elect msc type evalu academ year student student consist give oral present minut subject demand consist work gener involv implement develop code languag visual assign teacher profil student student told assign present extend reject offer author interest present visual student decid choic subject oral present assign relat current interest teacher student interest peopl collabor specif visual task academ year oral present consist demonstr iri explor address volum render algorithm assign relat interest visual archaeolog data xv centuri exist visual data obtain ground penetr radar visual data relat model facil develop hardwar processor volum render implement fpga develop evalu methodolog visual studi involv data obtain modal surfac depth tomographi magnet reson imag develop evalu method visual obtain develop evalu method involv model human visual system assign author invalu collabor colleagu work enabl technolog applic area assign bibliograph research work interest implement part small technic report document written scientif paper student put lot work enthusiasm assign support student typic long time finish task spite fact research orient bank recommend difficulti present author choic subject final prepar paper correspond burden solut viabl small number student type assign result stimul interest motiv student demand result frustrat student teacher author possibl maintain assign volunt student give altern examin commit visual main difficulti write student write special attent part work prepar oral difficulti write gener problem extra effort devot teacher stress import commun correctli work gener instruct student start prepar oral present bibliographi subject write speak recommend teacher encourag student write english technolog process prepar paper iter iter teacher peopl invest review paper final version paper readi publish intern note submit confer natur qualiti develop work achiev paper publish intern modifi version accept confer portug submit confer assign involv port platform exist develop longer work spite fact student work succe obtain result justifi public risk kind assign care author feel imposs complet elimin possibl paper accept confer present student opportun view student good work institut perspect consid valuabl contribut qualiti good reason find institut support reason constraint submit paper confer impli low travel bibliographi search bibliographi import part msc level fundament level lectur meant give basic underli theori point import present reason good bibliographi fact select bibliographi student import capac obtain adequ bibliographi stress due fact visual text book exist longer establish disciplin comput graphic digit imag overcom type difficulti altern book paper write note support view interest msc student consult bibliograph experienc teacher write note convei perspect topic author experi lectur write note question book al gener support state book framework scientif visual system understood capabl overview data facil human comput requir scientif visual system wai scientif visual appli wide rang applic recent detail date detail refer support topic mention section ii attempt provid student bibliographi futur author select small set bibliograph refer cover subject address lectur section gener usag bibliograph refer comment bibliographi provid list refer instanc support practic provid comment prepar student strongli familiar sourc interest refer journal confer method data librari inform system remot bibliograph search servic student urg bibliograph research gener usag select bibliographi bibliograph refer list present provid gener guidanc refer list support definit goal overview visual data visual product case studi interest refer tuft support studi histori principl visual refer graphic file format overview relev issu file format data compress refer consid text book call enabl technolog comput human comput interact digit imag student obtain background technolog refer support introduct human visual system list main bibliographi scientif techniqu springer book written refer guid visual commun technic aspect framework present data product applic spite date aspect good overview main issu address introductori visual comput graphic explor data present john background field visual give overview design visual market visual product illustr wide varieti applic case studi visual ieee comput societi intend peopl confront problem discov mean data set practic exampl illustr visual tip rule produc inform imag scott scientif visual acm siggraph educ hypermedia document develop address fundament topic scientif visual displai quantit graphic concern design statist graphic commun inform simultan present number pictur review graphic practic centuri seek account differ qualiti graphic design graphic file refer man prentic guid file format comput graphic relat area discuss implement design file format basic issu evalu develop data organ van comput principl consid standard refer comput graphic deal fundament topic area adequ comput addison updat coverag subject field comput imageri separ text comput imag process comput vision coher overview design user strategi effect human comput ed addison complet current introduct user interfac design offer practic techniqu guidelin great care discuss underli issu support empir result human comput prentic text book provid multidisciplinari perspect subject cover basic psycholog comput technolog involv interfac usabl advanc topic digit imag addison commonli text book cover fundament concept methodolog digit imag process brain addison integr approach human machin knowledg area comput cognit biologi anthropolog psycholog bibliographi bibliograph refer support specif topic lectur practic assign refer includ paper publish journal confer book list book author consid reader includ graphic present collect exemplari design repres type wide distribut time design excel complex data identifi explain includ interest chapter colour introductori guid scientif springer book intend reader quick summari scientif visual easi read introduct subject effect color theori academ address displai colour model practic guidelin effect disregard theoret foundat text design colour recent trend volum ieee emb intern summer june survei volum visual trend focu applic scientif visual advanc ieee comput academ demonstr examin applic area address relev issu scientif visual perceptu issu springer address issu field appli problem address effect inform displai introduct volum prentic introduct volum render concept present logic progress volum render sourc code result practic assign subject encyclopedia graphic file detail technic inform file includ chapter graphic file format basic offer easi task encount hope work give posit contribut interest prepar visual main difficulti encount prepar relat lack text book offer approach impli great effort search adequ bibliographi great effort topic address problem tackl experienc educ area publish workshop maintain site inform initi effort put curriculum make decid approach kind student expect collect specif materi lectur subject type practic assign evalu choic time offer base accumul experi teacher feedback student search bibliographi choic prepar practic assign result interest greatest concern author work concern expect main concern year curriculum base similar offer european american expect evolv specif topic sequenc durat structur refer introductori departamento de universidad de vol visual activ educ eurograph workshop graphic scott educ ieee visual pp scott acm siggraph educ graphic visual research comput vol write speak technolog practic ieee ce acknowledg author prof chair educ visual great initi definit curriculum bibliographi present
DB/1035 3 model schema select john roddick school comput inform south level south australia australia fabio mandreoli maria dipartimento di informatica università di vial itali abstract schema version mechan handl chang structur system investig context static tempor grow interest spatial data mechan hold spatial context data format issu paper present model accommod schema version spatial relat schema schema introduct motiv schema version regard applic tempor semant schema provid mechan handl chang real world data independ fashion structur addit delet split coalesc addit delet achiev minimum impact data applic mechan version structur facilit altern structur data previou survei field review area glossari tempor concept schema evolut system support schema evolut permit modif schema loss extant data support previou schemata requir schema version system accommod schema version queri retrospect version interfac develop spatial spatiotempor import research topic recent research shown similar problem consid spatial problem experienc data chang schemata tempor schema version provid solut structur time abil version schemata spatial analogu locat schema appli abil appli schemata data applic differ applic land administr author paper investig lesson learnt theori develop tempor orient schema version examin appli spatial acknowledg spatial domain differ fundament wai solut handl time carefulli spatial context paper structur section review tempor schema version background model present section investig analog tempor spatial domain motiv spatial schema version section schema select model discuss research direct provid section tempor schema version revisit research schema evolut schema version undertaken number year result number schema handl discuss briefli issu data queri languag relat research survei found concept complet schema develop idea clifford warren complet relat enabl time access concept complet introduc discuss detail overarch schema time valid retriev complet schema detail defin minim superset relev schemata capabl hold data loss princip data mechan emploi event chang data simpli coerc format lazi mechan data convert access data physic convert access interfac queri languag extens accommod schema tempor queri languag orthogon ad exist function specif design schema data retriev statement shown figur specifi data held retriev schema format extant default effect resili compil program includ set schema date note set schema oper queri level heterogen queri singl dimens effect expand support schemata pre data retriev number time dimens identifi case make distinguish time event occur fact true realiti set schema date select dept overlap overlap figur queri refer time data repres real world event fact record time determin structur format data store simpli term arguabl version abil time determin structur real world wide data real world manipul natur partner data time current schema updat time applic program compil applic static data structur program time invok event term paper repres simpli shown figur actual occur object model data structur figur data structur time dimens augment diagram tempor schema dimens defin tempor data shown figur real world object model schema schema applic figur real object model schema time dimens statement data event time £ version happen record structur record £ structur applic compil applic access data store multipl valid singl queri record notabl discuss literatur work includ aspect multipl dimens head common posit literatur assum dimens time ident spatial schema version commonli state perceiv dimens space time time dimens number sensori physic attribut make simpl scale solut difficult time unidirect system consid linear relat concept easili understood argu space dimens treat differ graviti accommod space geograph commonli time space consid continu time discret isomorph larger granular select specif granular consid isomorph real number common calendar preval singl express point time adopt inform system multipl set rule govern space uncommon frequent system spatial coordin handl inform system notwithstand translat tempor spatial domain made develop accept convent make volum work schema includ relat tempor schema version extend spatial spatiotempor model data gener research schema integr applic spatial popular area research adequ schema version problem evid system spatial schema version mechan schemata applic locat import legal collect method indic rule data collect manner interpret data collect countri collect protocol collect method provid local ownership interpret central held author provid rule data collect author interpret spatial system rural map region method type entiti depict agricultur natur heritag nativ airport flood ignor quantum inform provis requir freedom inform privaci task combin map similar facet area global schema combin element local schemata determin data locat data refer note aspect discuss section spatial analogu tempor exampl statement data fact £ ¥ locat happen £ structur record spatial structur applic locat £ record ¥ clear spatial correspond investig incorpor gener model schema select spatiotempor model schema select initi discuss model schemata label region default time option label space time suppli model degrad multipl static schema model option label suppli degrad schema version time suppli model degrad convent tempor schema version la limit case degrad version model embrac concept complet schema introduc construct minim schema capabl hold data loss complet relat scheme relat scheme ¢ minim union explicit attribut defin relev spatiotempor span relat domain attribut syntact gener hold data store version implicit primari kei defin maxim set kei attribut scheme relev span version schema view space ax time figur schema version pertin time label coordin figur schemata defin assum dimens time expand schema activ appli transact applic area schema point schemata valid region differ respect test schemata valid region resp shown time schemata construct queri area queri rang determin area union area defin output schema includ area determin step complet schema construct area schema includ queri view queri execut compil schema coerc data conform complet schema inform lost step lost result convert output transform rule output schema format requir note queri bound region queri spatial region multipl schemata time compil complet schema problem gener problem schema integr coupl accommod tempor spatial semant schema version parallel version model schema data select model gener appli flexibl model support seamless integr spatial parallel version facil treat uniform coordin system mean coordin impli special select tempor spatial parallel version combin intent part set schema version part set data schema version structur schema definit part schema definit part includ data structur definit set catalogu tabl relat set class definit objectori coordin part defin area repres pertin schema version made set spatial region tempor notic tempor spatial coordin xyz coordin bitempor time schema version defin coordin system schema version select mean select function coordin suppli repres point version singl schema version select schema version time coordin omit set point singl point composit function obtain complet schema composit function typic base union intersect semant depend applic requir label coordin select function defin notic result complet schema version set support schema version schema select function defin coordin combin singl coordin version dealt interv set coordin schema construct gener definit function previou exampl definit complet specif composit function complic simpl union intersect oper requir applic complex schema integr techniqu issu investig literatur overview method schema integr relat semant found objectori problem activ research solut semant syntact aspect consid fa part data organ adopt organ describ logic aim effici support queri process organ data repositori common store augment differenti number schema version figur common store logic structur definit common schema version schema version attribut definit type integ real attribut type includ common store structur structur defin compat element maintain common store data replic differenti store organ common δ δ figur organ data structur differenti store defin definit common part data instanc schema version retriev common store differenti store notic data retriev common store type attribut integ number store real number common refer suitabl function store differenti store case organ effici data retriev complet schemata involv assum data belong schema version £ requir complet schema £ comput intersect data found common store data store differenti store belong schema version discard complet schema comput union data found common store differenti store £ step queri process list section area queri complet schema construct mean function data access queri common store differenti store schema version involv data retriev process complet possibl function differenti store appli research paper discuss initi idea attempt date accommod schema version spatial research continu refin model issu queri languag support concern relat architectur issu lazi strict data speed access data current schemata consult experi discuss research albeit spatial schema version adjunct system interest investig util discov extent natur spatial schema version acknowledg work conceiv author attend integr spatial tempor workshop schloss dagstuhl novemb gmbh kind hospit provid conduc work comment refer jf survei spatiotempor press manag schema evolut proc seventeenth intern confer larg tempor orient data manag schema evolut tempor orient data knowl hj hf schema evolut persist proc sixth advanc compar analysi methodolog schema integr acm comput ds formal semant time acm tran de mr schema version relat inf mr formal model tempor schema version orient technic report università di research issu spatial sigmod rh introduct spatial system vldb al consensu glossari tempor concept februari version tempor research lectur note comput berlin heidelberg hf schema version view proc inform technolog harmon sr schema evolut oodb class version sigmod gt schema evolut system data knowl ca schema evolut design integr schemata research practic issu australian confer world la spatial final frontier theori dj class modif gemston dbm oopsla ip ic import metadata engin spatial data infrastructur proc western australia jf dynam chang schema model comput jf queri languag extens support schema evolut sigmod jf rt schema version support tempor queri languag kluwer academ boston jf survei schema version issu system inf jf model schema version tempor system comput sc rt tempor queri languag kluwer academ york meta oper type manag lazi mechan schema evolut proc intern confer deduct orient dood schema integr confer advanc inform system engin
Agents/1036 1 distribut agent network thing nelson matthew oliv patti mae mit media lab street ma usa august abstract hive distribut agent decentr system build applic network local system resourc paper present architectur concentr idea distribut implement practic java base system hive agent ontolog agent mobil graphic interfac distribut system appli hive problem network put comput commun everydai place bodi ttt share challeng potenti ubiquit comput network applic found flexibl distribut agent architectur suit applic enabl easili build applic reconfigur system fly hive enabl make environ network aliv paper dedic memori mark guid distribut comput chang comput longer isol number devic home offic comput constantli commun wireless internet realiti comput demand paradigm build comput system softwar agent import abstract build distribut system softwar agent program excel build block complex network applic creat softwar system implement ecolog distribut agent appli hive creat applic network comput connect thing design hive strongli influenc world wide web lesson success import decentr system simpl abstract web deepli decentr web page link central hive system built relationship agent kei web web mirror hive softwar agent web distribut system static hive dynam comput make internet aliv ecolog distribut agent metaphor build network system ecolog distribut agent ecolog applic creat interact multipl agent network agent locat place call local resourc agent commun share inform access resourc applic made commun action agent programm hive agent distribut object execut thread hive agent build block activ distribut system agent provid conceptu wrapper agent system carri goal agent encapsul comput activ agent ontolog agent capabl describ discov servic agent work complet task agent mobil agent provid simpl abstract dynam distribut system ecolog distribut agent decentr system decentr essenti system grow decentr agent locat resourc find negoti relationship host protect unwant agent consist singl place point center work challeng realiti distribut system todai detail manag problem paper hive embodi ecolog distribut agent paper describ specif hive applic built lesson learn test hive real system introduc primari applic domain thing goal thing project media lab power comput network put everydai object ttt enhanc physic world comput commun ttt make comput network complex capabl light socket begin full explic thing scope detail descript agenda share research mark weiser detail relat idea comput consum comput common technolog bluetooth bring network consum devic toi leader network toi microsoft industri initi intel plai comput industri tackl problem network system applic technolog jini ubiquit network present varieti challeng applic infrastructur devic scatter system fulli distribut administr overhead mean system central devic easili requir open architectur peopl add devic creat thing system foreseen design system flexibl ecolog distribut agent good match requir hive agent ontolog mobil make flexibl agent descript capabl mobil code part system network evolv hive good infrastructur ttt good problem hive build agent system system understood build ttt applic hive valid design principl taught lesson design distribut system hive architectur hive consist agent hive network decentr collect cell hive cell analog web program run specif comput publish network address cell set local resourc call shadow encapsul capabl screen displai digit camera cell host agent local resourc commun analog convent oper cell shadow devic agent process schemat diagram hive architectur present figur hive set java system consist roughli class line half gener infrastructur half specif code devic agent addit basic java hive make extens java remot method invoc serial agent commun mobil ontolog support hive rdf librari node decentr network hive cell program particip network cell perform primari host softwar agent manag access local resourc shadow ideal model place hive cell devic hive cell requir fair amount cpu power run comput proxi devic typic cell devic provid input resourc motion digit tag output resourc comput small hive locat depend model distribut system hive cell cell specif shadow cell agent figur hive architectur set shadow specif popul agent access contact agent cell access devic shadow model contrast distribut system abstract concept locat hive explicitli locat shadow agent organ partit system thing place hive cell creat repres intend process hive cell equal peer network agent cell commun agent complet decentr system feder hive cell form hive cell typic run list contact registri maintain membership global hive cell free arrang feder local resourc hive cell simpli cell interest shadow term suggest role encapsul local resourc physic devic hive cell hive cell digit camera plug camera shadow softwar interfac method agent directli move camera cell camera invok shadow standard java method call shadow api access specif resourc shadow abstract structur system shadow static part hive system design write shadow encapsul devic freez code place flexibl system mobil shadow provid static layer agent access shadow provid place hive cell enforc secur resourc control polici shadow trust code shadow commun directli network export devic function local agent mediat shadow network activ comput shadow local compon agent network aspect hive agent network interfac polici resourc hive agent combin java execut remot interfac network simpl piec creat autonom process distribut system agent live specif access shadow resourc agent export select function network commun share function camera agent export pictur function camera shadow remot agent imag agent invok method implement simpl remot pictur applic hive applic built collect interact agent agent mobil discuss section user interfac hive graphic user interfac distribut system comput displai simpli agent draw screen send java graphic compon shadow hive user interfac implement agent graph view state system control interfac commun system agent agent system hive benefit distribut agent approach screenshot user interfac shown figur user interfac displai major aspect agent connect agent agent repres icon agent left simpl camera applic agent system manag agent agent commun path shown arrow icon visual dynam agent messag messag shown anim connect arrow interfac displai multipl show user interfac control agent creat menu agent connect draw line agent move kill pop menu hive user interfac make easi user experi agent popul creat applic stroke simpl imag shown section basic applic demonstr hive system core consist button digit camera imag displai applic user click camera pictur displai screen agent work build displai button displai send graphic compon cell comput screen camera shadow local digit camera camera agent creat cell access camera access grant agent pictur send network agent left connect imag displai agent connect camera camera agent connect button agent user click button agent send event camera agent camera agent interpret command pictur send event displai agent imag data camera agent agent commun network creat applic distribut applic make hive interest simplic flexibl applic built applic easili built connect exist agent agent detect motion door open connect camera pictur room face recognit agent camera discov visitor agent hive network camera build photo galleri entir build mobil agent drop dynam upgrad chang piec applic flexibl alter agent code power ecolog distribut agent hive agent implement hive agent live live possibl travel network agent interact base simpl distribut object techniqu hive agent rich ontolog java type system resourc descript framework descript languag creat practic system network thing balanc work deep agent research question creat softwar everydai programm hive draw techniqu part agent research includ agent agent ontolog extract essenti bypass complex unsolv problem agent anatomi hive agent root common agent base class adopt minim approach design ad field method absolut drawn inspir mobil agent system aglet agent simplifi agent store cell agent live pointer object semant descript applic agent subclass typic addit intern state comput agent class subclass basi remot object rmi class method agent execut remot rmi agent commun mechan simplifi hive agent simpli remot requir extra agent commun system cost simplic manag agent commun rmi hive explicit control agent place figur hive camera applic understand messag decid act agent agent interact agent interact hive complet make requir agent individu agent decid talk agent commun occur rmi remot method agent synchron call method ad asynchron call rmi agent decoupl interact java strong type syntact structur agent agent free defin semant agent true type agent subclass agent remot subtyp agent dualiti common system initi write type split agent remot interfac local implement agent bookkeep administr method inappropri agent call agent access remot sensit method protect java type system practic agent simpli inherit remot elimin defin base agent interfac method call remot method remot method strang method make remot agent manag agent agent remot agent necessarili compli agent remot method manag abstract agent aspect agent method pure advisori agent free defin mean ignor request found simpl commun event broadli connect jini distribut event specif pass event object system addit standard agent applic agent defin extra method interfac hive agent manag system function cell remot method agent user interfac commun agent control remot cell decid method agent implement secur polici syntact ontolog hive reli abil agent describ make agent interact coher agent hive term orthogon syntact semant hive cell provid queri servic base descript agent find remot agent list agent provid motion data room syntact ontolog agent hive free java agent syntact descript simpli java type overlook type object capabl refer class hierarchi system refer easi learn type support messag understand interfac hive cell request list type hard problem solv syntact ontolog class fact version type hive consist mobil code mean syntact ontolog hive agent class hive agent type queri messag solv problem answer fundament epistemolog question practic bent hive system chosen defer work issu hamper abil creat system build practic applic peopl engin agent work creat ontolog project consensu practic semant ontolog syntact ontolog describ bit inform agent fit rigid class hierarchi fact agent repres devic room easi codifi syntact add method agent part method make agent physic locat limit java class hierarchi semant descript compound fact agent assum capabl runtim agent filter event stream assum ident depend event sourc connect java add interfac object type object static circumv hive orthogon ontolog describ inform agent ontolog util resourc descript framework base xml rdf structur attach noun verb agent agent semant descript state physic human readabl owner devic descript mean data hive agent carri rdf call agent inspect descript learn cell queri interfac support match set rdf descript agent free chang descript runtim semant ontolog solv deep philosoph applic design express solut expect applic design develop schema make agent commun semant consist schema complet strictli defin sgml dtd schema expect user collabor defin schema common consensu build hive system hive network ontolog emerg common practic mobil final aspect hive agent mobil hive mobil mobil code mobil agent mobil code enabl softwar hive cell updat dynam mobil agent build mobil agent move hive network hive agent weak mobil agent make arrang preserv execut state transport strong mobil prefer difficult implement java coupl system achiev strong mobil modifi standard mechan defin advantag mobil agent understood agent lot bandwidth access effici agent move resourc cell commun network hive cell network move agent stabl hive cell make system robust interest mobil achiev flexibl properti import heterogen network system hive cell deploi softwar smart small easili upgrad hive softwar easili updat simpli send mobil agent mobil agent function cell custom mobil agent turn camera motion detector camera agent simpl method compar agent decid move motion detector agent creat move host save bandwidth ship imag network motion detector function remain separ camera agent simpl hive mobil enabl effici conceptu attribut build applic hive mobil agent futur expand mobil ultim enabl form distribut agent travel network freeli perform task network aliv comput hive applic experi design hive motiv specif requir applic thing iter experi build applic hive greatli influenc design applic built hive demonstr ecolog agent effect creat distribut system shrunk part ii simpl system built hive physic interfac applic user select poker chip song written drop song select start plai poker chip physic icon activ scene complex poker chip rf id tag tabl tag reader tag pass id serial port tag reader agent watch serial port shadow broadcast hive event tag event pick agent map tag id song broadcast dj agent plai file agent work machin make work system agent hive cell watch failur restart earlier version system implement monolith applic hive version roughli half effort implement robust flexibl factor piec system easi add interfac standard remot web agent pick music base peopl prefer tangibl interfac ambient displai shrunk cd tangibl form human comput interfac physic object standard crt media lab activ tangibl interfac research build varieti creativ thing devic anim soft light displai subtli convei inform past difficult displai hardwar interfac devic hive creat hive cell shadow devic devic hive agent internet hive interfac creat craig wisneski person ambient displai thing small object input output capabl object grow warm vibrat touch object control hive connect warm hook extern inform sourc start vibrat stock portfolio drop precipit hive simpl experi connect devic devic wearabl comput research project media lab wearabl make peopl put comput cloth media lab beacon broadcast room brad rhode wearabl comput figur build brad wearabl comput hive hive agent make inform agent peopl easili find agent offic inform plai walk dj agent shrunk cd plai music wearabl offer opportun applic decentr hive make preserv privaci agent control person data counter intellig largest applic built hive date project make kitchen smarter counter intellig kitchen ingredi counter scale ad automat set bake temperatur recip plan agent strip procedur net run bake cake counter intellig work implement eighteen agent run comput hive infrastructur simplifi process manag interact ontolog system kei agent coordin dynam adapt newli plan agent inspect inform kitchen data effect recip system devic ad network kitchen mother countri bake counter intellig good testb place strong demand agent infrastructur summari applic applic give flavor thing network hive hive proven applic infrastructur connect thing real power hive network thing hive network open flexibl connect made cost trivial hive network wearabl comput tangibl set devic control kitchen agent written repres hive connect agent build distribut applic experi power synergi lesson hive experi build real system distribut agent educ perspect softwar distribut agent continu experi hive uncov practic lesson pointer futur work asynchron messag java languag build distribut agent system thing java make pleasant gener distribut system strong type hive syntact ontolog free simpl object orient split interfac make easi build class hierarchi agent awt make easi write portabl graphic agent java secur model make build system execut untrust code java fairli advanc internet found option distribut java bit lack hive start voyag base system voyag nice capabl distribut includ messag mobil voyag good toolkit build order give flexibl messag mobil give option move year rework hive java rmi interest experi port surprisingli easi agent isol detail transport major advantag chang rmi robust forc handl commun error argument made note distribut voyag provid transpar model messag failur agent explicitli caught danger approach network failur agent explicitli deal potenti error commun rmi requir catch make easier build robust distribut system rmi limit wai rmi java implement limit make difficult scale system concurr agent rmi design synchron work agent commun synchron commun mean agent unduli depend wait respond messag synchron messag inappropri distribut event sender typic care event deliv asynchron messag fundament requir distribut agent system ad asynchron messag top fairli complex implement requir avoid scalabl problem decentr learn decentr strategi level ultim advantag decentr scalabl central system break central manag decentr system spread load hive network small technic scalabl advantag found organiz advantag decentr hive user simpli start cell join network lower barrier hive individu free develop agent central coordin make kind devic send devic deploi agent repres agent explicitli teach system agent type free softwar commun found decentr softwar develop effect quickli build larg system advantag robust decentr server bookkeep task hive agent care maintain feder broadcast server control displai user interfac agent crash agent fail system di user interfac stop rest applic agent continu user creat user interfac agent send fix sort robust appeal decentr drawback desir function requir global maintain list hive cell run network current implement function hive naiv scale make decentr system consist reli central architect make thing portion system small distribut system decentr essenti system grow manag singl administr mobil mobil proven challeng detail implement mobil code gener pictur mobil agent move voyag rmi implement small mobil agent system standard serial network class implement detail java class loader tricki experi point deep problem mobil code unsolv issu code common multipl version class network time java tool manag version incomplet subtl load agent code java late class agent decid class file long host current solut gener requir static code base closur requir class honest reveal problem mobil benefit mobil mobil agent problem current applic agent wander network practic exampl mobil agent send agent comput easier walk demonstr system user send agent cell static local manag agent popul classic argument mobil improv limit support disconnect oper appli hive applic expect system grow system flexibl benefit mobil agent idea happen section interact found agent interact hive suit open natur agent interact make hive system unpredict inconsist agent agent ignor agent interpret method hive applic correct uncertainti realiti learn work peopl cooper agent design work build compat softwar restrict paradigm formal correct hamper growth hive formal agent commun mechan tend understood specialist requir central develop restrict agent commun hive view import enabl system design build thing prevent build wrong thing hive treat wrong thing secur problem rest bug agent interact paradigm chosen make simpl build system user write hive program write convent program familiar strong advantag gain user interact scale long hive commun remain commun person work consist class hierarchi semant ontolog hive grow thousand friendli coordin longer work concern remark love problem dai pass understand shape problem solut futur work ultim goal hive make internet aliv agent run interact discoveri move host host reach goal address larg topic add capabl hive stabl cell run persist cell run week time problem main difficulti hive rapid version system incompat quickli find handl issu version experi applic user user interest network make open sourc hive end summer research commun build distribut applic secur plan major miss compon hive full secur system mobil agent secur break protect host protect agent protect agent host problem larg solvabl combin java sandbox model hive shadow abstract main limit java model resourc restrict cpu time memori agent effort underwai address problem excit research opportun appli econom model resourc control protect agent address combin java strong type authent credenti system problem protect agent malici host solut partial hive architectur explicitli state agent execut cell cell owner applic assum user incent cooper mobil mobil code proven mobil agent plai big role hope fact larg symptom matur system hive network grow mobil attract solut manag agent popul ideal decentr user add function consult central author mobil agent straightforward enabl expect mobil agent make hive prepar handl larger distribut system anticip applic mobil agent hive agent wander hive explor cell agent world expect creat inform gather agent travel move advantag spare cpu cycl cell cell captur pictur dawn mobil essenti part make hive flexibl grow encompass possibl open distribut system relat agent hive model ecolog distribut agent draw experi agent gener practic simplic program formal provabl core method build applic distribut agent inspir part actor albeit strong formal actor theori hive mobil wai reimplement system dagent aglet mole implement simpl version ultim intend creat solut hard problem version ship complet code contrast hive formal model agent commun negoti distribut system built conceptu overhead theori applic understand problem occur practic higher level commun mechan kqml ad top basic rmi commun layer made choic design hive system theori distribut system built todai address problem network applic sun jini system lead architectur domain comparison hive jini highlight detail hive ecolog distribut agent case make hive jini hive advantag hive jini distribut applic base reli rmi distribut object mobil code system discoveri lookup implement hive jini make extens event hive jini distribut event specif system repres devic capabl proxi jini servic roughli analog combin hive shadow agent jini conceptu split distinct shadow agent hive tion trust code untrust code autonomi hive agent clear place place comput activ system import differ hive model agent cell import agent resourc access jini actual place servic host major part jini model locat depend hive contribut technic conceptu jini hive reli mobil code argument mobil differ jini singl hop servic upload smart proxi user proxi migrat network make hive mobil import system grow jini hive java type system syntact ontolog hive rdf semant descript agent jini java type jini lookup attribut system close rdf model flexibl due abil perform deepli structur queri jini lookup attribut system support queri attribut hive support jini transact agent enter commun consist hook hive agent explicitli negoti agent express work agent limit period time practic hive jini integr encapsul jini servic hive shadow make hive agent present jini servic hive stai insid media lab network design hive expand work internet abstract inherit ecolog distribut agent conceptu model organ worldwid network interact process present implement ecolog distribut agent idea agent research put coher applic infrastructur thing proven agent good abstract build distribut system found agent commun ontolog mechan suffici build system mobil agent applic larger distribut system agent fundament build block coher distribut ecolog distribut agent grow inhabit global network million comput thing acknowledg todd marc brad review comment refer agha abstract interact program paradigm open distribut system formal method open distribut system chapman ken ann bryan robert jim waldo jini specif joachim baumann mobil mobil agent system mole ronald john ingo simon st laurent document definit markup languag technic tim jean extens markup languag technic report decemb jonathan david daniela ru resourc control mobil agent intern confer autonom kershenbaum mobil good jan vitek christian mobil object programm volum lectur note comput scienc thorsten von resourc account interfac java acm oopsla sean rob david leo denni howard philip oper system bell lab technic winter richard fike nil nilsson approach applic theorem prove problem solv read page tim yanni jame mayfield kqml agent commun languag jeff softwar agent mit neil thing start henri holt matthew grai infrastructur intellig kitchen master mit media robert grai agent flexibl secur system phd dartmouth hiroshi ishii ullmer tangibl seamless interfac bit atom chi page acm march david robert daniela georg cybenko agent target mobil comput ieee internet danni lang mitsuru oshima program deploi java mobil agent aglet danni lang mitsuru oshima good reason mobil agent commun march lassila ralph swick resourc descript framework model syntax specif technic mark miller eric market open system ecolog page elsevi scienc nelson minar design ecolog distribut agent master massachusett institut septemb joel saltz mobil program usenix technic page eric raymond bradlei nelson josh weaver wearabl comput meet ubiquit reap world intern symposium wearabl comput octob html simpl rdf parser sacerdoti nonlinear natur plan intern joint confer artifici intellig toma sander christian tschudin protect mobil agent malici host giovanni mobil agent volum lectur note comput chapter page thad steve bradlei jeffrei jennif dana rosalind alex pentland augment realiti wearabl comput presenc issu augment marku joachim fritz hohl mole java base mobil agent system ecoop workshop mobil object page juli giovanni vigna mobil agent volum lectur note comput scienc jim ann sam kendal note distribut comput jan vitek christian mobil object programm volum lectur note comput page april mark weiser comput centuri scientif page septemb craig wisneski design person ambient displai master mit media wooldridg jen agent architectur survei intellig page intel plai mail list voyag core technolog
DB/1037 3 type word constraint peter buneman fan scott weinstein depart comput inform scienc pennsylvania abstract gener depend found relat word constraint studi semistructur data objectori model assum data entiti uniqu entiti equal identifi decid implic finit implic problem word constraint establish question left open problem decid context model support complex valu nest structur complex equal paper answer question schema term type constraint equal investig interact constraint word constraint show presenc equal type implic finit implic problem word constraint give small model argument introduct word constraint introduc gener depend commonli found relat queri optim varieti rang semistructur data model root direct word constraint defin logic sentenc support partli armi research offic nsf grant support graduat fellowship institut research cognit pennsylvania support nsf grant constant denot root path repres logic formula edg label binari predic word constraint school constraint state student student student constraint express implic finit implic central question word studi semistructur data model semistructur found model root direct unconstrain type system schema oem assum data entiti graph uniqu entiti equal ident equal relat call ident equal model similar studi support atom record finit set construct view collect oid basic atom record consist basic valu set consist basic valu oid support complex valu nest structur set record record set compon equal relat defin ident equal schema view type constraint instanc schema understood semistructur satisfi type constraint semistructur data decid word constraint implic establish system studi complex valu nest structur common complex uniqu ident equal relat complex valu simpli treat ident equal equal relat system call complex equal denot defin valu atom type object class oid equal object defin compar object ident set type vice versa valu type stand project attribut natur question answer word constraint implic decid context simpl extens support complex valu nest structur complex equal word constraint implic question problem complex equal sever impact word constraint implic schema schema class player type record class team type class player defin instanc type instanc complex nest structur schema jone smith object creat jone smith instanc instanc rank rank rank rank figur repres graph shown figur denot root denot set membership word ensur consist player constraint fact state record type easi object oid reason defin set equal long consist player shown context instanc impli context schema impli show differ definit equal rise outcom word constraint implic illustr complex equal interact word constraint make life harder context shown schema term type constraint interact type constraint path class constraint gener word studi presenc complex equal constraint addit type captur semant schema interact form constraint type word constraint address paper investig interact type word constraint focu central issu simplifi defin model flavor nest relat model set record constructor requir altern set set record record compon schema term equal addit type constraint develop repres instanc logic structur satisfi type constraint equal constraint show implic finit implic problem word constraint decid context present elementari proof decid give small model argument finit set fg word show model size exponenti length note complex equal notion call shallow deep equal shallow deep equal object oid equal definit deep equal defin logic clarifi give definit predic ffl shallow equal denot defin equal case object valu ffl deep equal denot valu atom type object valu set type vice versa valu type rest paper organ section present model specifi type constraint equal abstract section formal defin word constraint context justifi abstract section respect word constraint implic section establish decid implic finit implic problem word constraint context section summar main result paper equal type constraint present model defin equal type give abstract term constraint compar model studi data model begin describ model assum fix countabl set fix finit set atom definit finit set class set type denot type defin abstract set record set fbg fcg record ffi set notat repres record type set reserv rang type definit schema tripl ffl finit set ffl type ffl record type type assum uniqu entri schema specifi type entri point entri point collect set definit schema spirit found note definit ffl schema convert type continu substitut pure set record constructor altern set set record record compon flavor nest relat model ffl simplifi requir set consist basic valu oid complex valu nest structur limit valu record record consist basic valu set restrict remov affect decid result paper schema ffl ffl map player rank ffl schema ffl ffl defin student ffl definit instanc schema tripl ffl oid assign map finit set ffl map oid fv denot domain atom type ffl repres entri point instanc denot set instanc schema instanc ffl ffl player rank defin jone rank smith rank ffl defin equal type constraint line present abstract term logic schema mean logic call type constraint equal constraint determin repres logic structur satisfi type equal constraint structur depict root direct graph assum standard notat logic defin type equal vocabulari determin schema import compon vocabulari defin definit schema set binari relat symbol set type determin defin smallest set properti ffl ffl finit note distinguish symbol denot set membership defin vocabulari definit signatur determin schema quadrupl ffl constant denot ffl finit set binari relat symbol defin denot edg ffl finit set unari relat symbol defin fr denot ffl finit set binari relat symbol defin denot equal symbol sort signatur determin schema ffl instanc schema intend ffl ffl fr tg vocabulari determin schema type constraint equal constraint determin count quantifi semant structur satisfi exist uniqu element detail discuss count quantifi definit schema type constraint determin logic sentenc oe defin ffl oe ffl oe ffl oe ng type constraint determin sentenc defin oe definit schema equal constraint determin sentenc oe defin ffl oe ffl oe ffl oe equal constraint determin sentenc defin oe note ffl definit defin term class defin equal object defin compar oid ffl type constraint logic discuss equal constraint express ffl type equal constraint defin logic abstract type equal constraint defin give abstract definit abstract schema finit denot set abstract schema denot set satisfi ffl ffl respect finit set rule set type finit node finit outgo edg note defin logic justif abstract section comparison compar contrast support complex valu nest structur assum section set type defin ftg equal object defin oid equal equal relat simpli ident equal definit schema instanc similar definit signatur determin schema defin tripl defin definit equal simpl schema type constraint defin definit abstract defin finit satisfi defin set satisfi respect finit set rule word constraint formal defin word constraint context present notion path defin word constraint implic finit implic problem justifi abstract section respect word constraint implic path begin descript path term finit state automata definit schema finit state automata determin defin ffl set state set type determin ffl alphabet set binari relat symbol determin ffl initi state ffl set final state ffl transit function ffi defin defin function ffi ffi ff ffi path ff element ffi defin languag accept initi path element type initi path defin ffi easi verifi ffi function type initi path empti path ffl finit state automata determin schema shown figur student student string student start figur finit state automata determin schema repres path ff logic formula denot tail head node defin ff ffl ff fi ff fi formula repres path fi write ff understood context assum path form formula defin concaten path denot simpli ff defin ff ffl ff ff length path defin ff ffl ff fi ff fi definit schema ff fi path ff prefix denot ff exist path fl fi ff fl import properti lemma schema ff path satisfi node straightforward induct definit word constraint notion path defin word constraint definit word constraint schema sentenc form fi denot fi denot set word constraint schema pw pw languag vocabulari word constraint schema oe student instanc oe interpret mention stand project record attribut constraint oe student student student constraint express referenti integr borrow standard definit model implic logic schema structur constraint pw write model finit subset pw denot impli structur denot finit impli structur write understood context definit schema implic problem word constraint problem finit subset fg pw justif abstract justifi abstract defin section illustr word constraint schema natur interpret instanc notion defin instanc constraint pw agreement abstract respect word constraint implic reveal lemma lemma schema pw iff hold construct pw iff defin smallest set satisfi ffl element ffl record object attribut distinct node ffl jgj ffl ffl jgj iff type ffl relat defin ffl iff iff straightforward verifi ffl finit ffl pw iff easili verifi defin pw iff simplifi assum atom type domain infinit similar proof finit case found exist inject map unari relat denot sort defin map jgj ffl ffl atom type ffl jgj ffl note finit ffl ffl jgj easi verifi iff lemma immedi corollari corollari schema fg finit subset pw word constraint implic establish decid implic finit implic problem word constraint context theorem arbitrari schema implic finit implic problem pw decid prove theorem give small model argument schema finit subset fg pw show model model size mn length maximum record width defin give describ techniqu establish small model properti simpl filtrat argument show model size mn note equal constraint filtrat argument suffic techniqu refer identifi oper construct size larger size slightli stronger filtrat argument identifi oper prove theorem filtrat argument present simpl filtrat argument note model support complex valu nest structur flavor nest relat argument suffici establish small model properti word constraint implic begin definit schema fg finit subset pw defin oe fgg ae straightforward verifi lemma length cardin defin ae defin label respect fg import properti lemma model show oe assumpt jgj oe contradict assumpt show exist jgj assumpt present filtrat argument proposit schema fg finit subset pw model size mn length maximum record width defin ffl record ffl record type distinct node defin function jgj defin ffl ffl ffl popul iff exist jgj ffl iff jgj lemma assumpt ffl defin show structur proposit size ts lemma size mn lemma assumpt easi verifi uniqu definit easi verifi ffl ffl base type set oe ng definit shown record loss exist definit exist jgj definit definit class type record type contradict assumpt suffic show claim claim lemma show ff ff iff ff verifi induct base ff ffl note uniqu node ffl ffl iff iff iff ffl induct assum claim show claim hold ff ff ff jgj induct ff definit ff ff exist definit exist jgj induct ff ff definit ff claim hold complet proof proposit identifi oper introduc oper call identifi oper construct structur satisfi equal constraint schema fg finit subset pw satisfi construct size larger size defin identifi present basic properti data model schema bc denot set lemma schema properti bc path ff definit easi ff suffic show claim ff ff bc set type claim bc set type statement lemma hold statement verifi claim ff ff ffl ff claim lemma contradict claim show claim induct base ff definit set type claim hold case induct assum claim show claim hold ff ff induct bc set type ff definit bc set type set bc claim hold ff corollari schema fg finit subset pw fr size larger size substructur fa ff easi verifi lemma lemma fr sequel assum fr corollari assumpt affect outcom word constraint implic defin identifi oper definit schema satisfi distinct node jgj identifi bc condit satisfi ffl iff ffl iff structur result identifi defin ffl jg fo ffl ffl jg identifi figur identifi oper iff iff iff ffl fog fo ffl jg iff iff stand substitut occurr relat identifi oper shown figur note structur definit ffl root fo assum fr corollari ffl class type defin term ffl jgj iff iff show identifi oper properti lemma definit properti ff jg iff iff statement lemma easili verifi prove statement induct base ff ffl note fo iff iff iff statement hold case induct assum statement show statement hold ff ff assum definit jgj assum ff exist fo definit jg induct hypothesi definit fo induct hypothesi definit ff assum ff exist jg induct jgj definit induct definit assum assum ff ff loss assum ff exist fo definit jg induct definit ff assum ff exist jg induct jgj definit ff ff complet proof lemma lemma studi impact identifi oper word constraint implic introduc notion definit definit word constraint pw respect identifi exist jgj fo corollari definit fg finit subset pw respect identifi show exist oe jg lemma jgj contradict assumpt lemma contradict assumpt oe show respect identifi jgj fo jg lemma lemma illustr construct structur satisfi equal constraint identifi oper definit schema finit satisfi ultim identifi structur construct defin structur gm structur result identifi identifi node gm structur construct stage distinct identifi node ultim identifi structur properti proposit definit statement hold ultim identifi structur construct exist size larger size finit subset pw stage construct definit respect identifi ultim identifi structur construct sequenc structur construct definit sequenc finit finit size strictli size exist size larger size statement proposit verifi straightforward induct stage corollari statement proposit lemma show statement induct easi show show oe exist jgj case definit definit easi iff oe contradict assumpt identifi contradict definit identifi contradict definit oe complet proof proposit decid word constraint implic show theorem schema fg finit subset pw show model small model size mn length maximum record width lemma bc filtrat argument identifi oper suffici establish small model properti corollari schema fg finit subset pw bc model model size mn proposit proposit model structur size mn ultim identifi structur construct proposit size mn definit proof proposit proposit proposit lemma bc definit shown straightforward induct jg structur construct stage definit definit identifi node jg respect proposit assum structur construct proof proposit ultim identifi structur construct corollari proof proposit easi fr identifi node construct proposit small model structur construct stage definit node jg construct identifi jg prevent slightli stronger filtrat argument give definit illustr motiv strengthen argument proof proposit definit schema word constraint pw satisfi isol condit respect exist exist lemma proposit assum satisfi isol condit respect satisfi isol condit respect exist definit identifi respect identifi node structur result identifi identifi node satisfi isol condit respect notic definit form ff record label node fo statement hold ff definit easi verifi identifi violat isol condit respect straightforward induct shown construct definit satisfi isol condit respect respect identifi identifi node proposit introduc stronger filtrat argument ensur isol condit give argument step convert arbitrari model model properti refin notion defin proof proposit base properti recal notion lb introduc section defin relat jgj iff denot class respect definit definit jgj properti respect satisfi exist ffl ffl ffl uniqu node call isol node lemma schema fg finit subset pw model properti respect model exist jgj jgj exist jgj modifi ffl exist jgj add edg label ffl exist jgj isol node ffl jgj remov edg label structur result modifi easi properti respect lemma easi verifi lemma present stronger filtrat argument proposit lemma model model satisfi isol condit respect size mn length maximum record width lemma exist model properti respect exist jgj jgj exist isol node recal notion proof proposit refin definit ffl jgj true ffl ffl jgj defin function structur proof proposit shown easi verifi size mn verifi lemma assumpt show satisfi isol condit respect definit jgj definit easi show iff iff iff iff isol node jgj definit shown satisfi isol condit respect corollari complet proof theorem corollari lemma model model size mn length maximum record width lemma model properti respect proposit satisfi isol condit respect size mn ultim identifi structur construct lemma proposit size mn definit proof proposit proof proposit proposit provid answer open context objectori data model support complex word constraint implic introduc equal addit type schema establish decid implic finit implic problem word constraint presenc type equal constraint address interact type path paper elabor interact constraint equal word constraint refer abiteboul intern confer theori abiteboul van den bussch equal intern confer deduct vol lectur note comput pp vianu foundat publish abiteboul kanellaki ident queri acm sigmod intern confer manag pp lorel queri languag semistructur journal digit abiteboul vianu path queri acm symposium principl gurevich classic problem buneman tutori acm symposium principl weinstein constraint presenc technic report depart comput inform weinstein constraint semistructur structur acm symposium principl weinstein path type technic report depart comput inform cattel morgan san mathemat introduct logic academ hopcroft ullman introduct automata languag comput publish anthoni transform data structur phd depart comput inform
Agents/1038 1 distribut calculu local area commun tom ian stark laboratori foundat comput scienc informat edinburgh august abstract paper introduc process calculu design captur phenomenon refer local inform system extend channel scope disjoint local area channel commun transmit inform area area arrang hierarchi distinguish singl network give oper semant develop type system proper channel local area illustr model internet servic protocol pair distribut agent introduct comput program make assumpt environ facil programm freeli function expect compil code execut librari load print format text java model lightweight applet travel web reli browser support standard interfac larg collect librari notion program hop place interrog local directori local servic access method common theme access local resourc global count typic static user manual list librari servic offer address paper offer calculu begin investig interact scope local area oper system base establish framework reason commun work variant carri tupl singl valu asynchron action succe add coupl motiv origin observ issu mobil code studi simpli mobil oper servic protocol direct internet browser contact web server fetch person oper finger list user connect number remot port web port finger list work side port number system file hold list map number servic level machin run gener internet listen port receiv port consult file identifi program provid servic start program hand connect caller model procedur client carp ci server pike system client machin carp contact server pike finger request client transmit prepar print result server pike replic gener internet finger daemon channel pike internet address server free finger repres port number carp send request pike finger servic repli channel internet daemon pike handl retransmit contact channel finger finger daemon collect pass inform back wait process carp fair shortcom finger visibl internet daemon pike collect request protect finger daemon server handl back carp restrict scope finger host carp formul request servic break extend local area assign channel level oper system net host repres fact carp pike separ host resid singl network system identifi oper net host commun finger print channel span singl channel pike oper network distinct scope determin finger wide ident finger daemon host introduc level distinguish concurr commun singl system host repres area level host net subnet level commun thread applic typic charact host total order level express includ abund port number suffici overview section develop formal descript local area calculu give oper prove correctli limit commun correct local area expand internet servic present illustr program calculu oper semant incorpor dynam check make channel correctli section type system captur inform static finger channel type channel carri valu channel commun string prove process deduc omit dynam check oper semant section paper conclud relat work earlier dam investig behaviour block oper essenti cc restrict block commun singl channel bind specif observ break reduct contribut local area level provid systemat framework kind static restrict rang project address locat similar local area aim investig semant causal locat model local failur distribut system limit rang commun system mobil agent locat commun agent interact agent move talk case cardelli gordon mobil ambient system hennessi approach distribut system select disciplin local global commun type system distinguish channel reach restrict singl local area join calculu requir channel transmit chosen process singl site receiv notion uniform recept similar type structur channel survei paper good overview calculu local area syntax calculu built class channel queri repli chan level host net level channel drawn countabl infinit chan behav level assum prior choic finit total order set level exampl paper app host net formal descript metavari level process base asynchron process inact process parallel composit ah bi output tupl input replic input local area level fresh channel level standard construct local area repres process run local area level bind specifi level channel oper contrast system tag identifi definit agent process form singl area channel bound free process bind prefix usual input prefix restrict write set free process identifi process term structur congruenc defin smallest congruenc relat bg bg bg stand simultan substitut congruenc bound algebra properti parallel composit flexibl scope channel point mean freeli expand contract scope provid includ bind scope area point note structur congruenc equat commut bind area boundari consequ scope channel determin independ layout scope determin chang process area determin fix structur process descript fix structur nest area accord predetermin order level net host vice similarli host host write relat total order requir nest area definit agent process subterm intermedi area process ab agent definit process level agent level level agent level make formal distinct scope area oper occurr bound channel process subject scope local area occurr level area singl disjoint local area scope occur local area case treat commun oper type enforc behaviour oper semant give local area calculu oper semant standard regular refin make commun channel local area area depend oper level captur inform level context finit partial map channel level write level context notat bind finger declar pike channel remot commun net finger print global restrict host interact level context write denot process level dom process fact singl agent omit annot write oper semant induct defin relat index level context transit form ff ff transit ff ah bi output input silent intern action transit free bound function fag fag valid transit deriv rule figur make observ rule attach ah bi ah bi dom dom par ff ff comm bg bind ff ff area ff ff ff ah bi figur oper semant local area calculu ffl activ structur congruenc essenti make full process term rearrang make progress symmetr form par rule ffl order appli comm rule structur congruenc expand scope commun cover sender recipi ffl late bind enforc dom input ensur input chosen readi substitut bg comm rule process achiev comment simpl tidi standard specif local area ffl rule prevent channel read written high level transmit host process process attempt stuck ffl area rule prevent commun escap local area notic necessarili requir side level result show oper semant successfulli captur intuit area area retain structur action channel observ oper level proposit deriv transit ff ffl process level dom ffl transit ff ah bi proof structur induct deriv ff carp host ci pike host finger inet finger finger net figur process local internet server daemon make transit corollari deriv sequenc transit ff properti hold proposit proof repeat applic proposit exampl introduct met small model internet servic provis figur formul system term local area net recal host carp contact finger daemon run host gener inet daemon appli oper semant action net ci finger extend scope ci finger expand inet ci finger commun inet finger expand finger inet main hci probe hci load net host load host load figur process local load manag agent commun finger commun finger sequenc intern commun net host host carp readi print inform host pike restor origin configur small exhibit interest scalabl ffl pike support multipl simultan finger channel provid privat commun link ffl system support finger server agent code finger global act local figur present time simpl model program host carri agent load report current system load agent host main program host compar load probe agent share privat channel link process execut net host load host load host load host numer ratio load host output residu main probe discharg system arrang simplif load ffl load agent distinguish identifi ffl address channel load ffl requir host commun oper independ authent kind advantag put forward show local area calculu repres agent begin evalu properti static system type area result end section show local commun remain action channel observ level oper reli oper semant figur form essenti runtim level check section show suitabl type system provid static inform make check unnecessari rule area figur deal propag action remain essenti level test accompani check action attempt process proce level oper process reason trivial elimin execut result substitut host host applic send fine host transmit process halt intend commun applic type system handl oper level level channel pass type system type simpl grammar type oe type declar form state channel carri tupl valu type vector base type empti channel type concret exampl assum addit base datatyp int string incorpor difficulti formal present syntact chang requir introduc type process process fresh channel type oe bind input prefix explicit type type fix type channel replac level context type context finit partial map channel type figur present rule deriv type assert form state process level context connect type calculu untyp notion oe level type bp process type replac bind replac throw detail type basic level declar type context level context proposit process level type context bp level level context bp proof structur induct type deriv oe ah bi figur type process local area calculu exampl give type exampl section sensibl reflect oper internet daemon figur pike finger servic servic servic print type servic finger expand mean channel valu carri level host commun inet finger commun origin case machin carp channel pike type act gatewai read servic channel servic send repli agent compar load type load link print interest type load captur fact request load agent repli pure local procedur call larger distribut environ correct oper semant process replac rule figur omit show section safe make omiss step show oper semant preserv type proposit process level context deriv transit ff ffl ff ah bi ffl ff proof structur induct deriv transit ff extrem tight connect behaviour type process term untyp proposit process ff bp ff bp bp ff untyp type process bp ff proof structur induct deriv transit combin proposit corollari obtain demonstr term theorem process deriv sequenc transit ff ff ah bi level establish process attempt channel level explicit check oper semant work local area calculu reason set explor global act local oper semant prove correctli captur intuit illustr exampl includ internet servic protocol pair distribut agent type system channel prove remov local check area applic explor layer network level commun local outermost layer engag actual commun order level applic transport network link encod local area pure explicit apparatu control process enforc level commun marshal local area built compon implement provid insight design choic calculu channel oper distinct level applic possibl tune observ process inspect singl level interest work notion bisimul filter action level attent local area give opportun captur spatial inform fact commun calculu restrict area form weak make connect relev version encrypt decrypt messag repres commun channel privat carri small area prevent eavesdrop dam illustr block order level immedi suggest notion subtyp place host break pass type constructor turn invari left essenti channel input output direct worth pursu step static agent properli mobil wai incorpor calculu retain separ handl scope area encod mention classic emul mobil area dynam attend router process refer model mobil theoret comput elsevi preprint russel compil standard ml java bytecod acm sigplan intern confer function program acm asynchroni rapport de recherch sophia cardelli gordon mobil ambient foundat softwar scienc comput lectur note comput scienc page reflex confer record popl acm symposium principl program page acm hennessi resourc access control system mobil agent concurr electron note theoret comput scienc page hennessi type languag distribut mobil process confer record popl acm symposium principl program languag acm internet assign number author protocol number assign port number lang oshima good reason mobil agent commun march milner tutori technic report laboratori foundat comput local semant calculi mobil process theoret comput disciplin recept languag intern colloquium lectur note comput scienc reason concurr system type foundat softwar scienc comput lectur note comput scienc page march subtyp capabl infer distribut languag intern colloquium lectur note comput scienc dam presenc static oper concur concurr theori intern lectur note comput scienc
IR/1039 5 effect ad ir system combin christoph vogt chapman comput math physic dept dr ca usa abstract present result experi solv data fusion problem system experi address question combin result multipl inform retriev system linear combin model investig combin ir system show expect potenti amount improv perform system combin system number candid point diminish return reach system queri gener relev correl perform train set test make difficult test set improv multipl system rel past perform candid strategi lead combin perform fewer system introduct head appli inform retriev problem belkin gauch ng central idea combin result list independ ir system techniqu call obtain perform individu system combin result ir system desir ir system make sourc evid system return document accur estim relev document ir system oper collect relev document combin result system lead higher recal possibl higher potenti perform gain studi adhoc entri combin adhoc entri averag combin entri emerg import valid combin model web search engin kind metacrawl savvysearch queri multipl search engin start protocol internet retriev project primari goal standard protocol search engin index individu web site commun engin piec evid support preval combin model patent award infoseek patent number entitl retriev network rank relev score comput client multipl describ method collect fusion problem schwartz suggest distribut queri multipl search engin subsequ combin human machin searcher shown pool human judgment superior individu predictor machin learn techniqu exploit order achiev perform pool human judgment lead suspect techniqu work machin gener judgment previou work understand make combin ir system combin system work show type pair ir system show improv combin improv depend system reason assum combin system lead combin lead greater likelihood improv occur belkin al conclud ad system improv perform base combin result submit form queri ir combin ir system found combin relev judgment human biggest gain judg attempt amount improv achiev ad system process call present result test combin subset entri aspect improv ad system system improv method problem address common distinct fusion research differ data fusion collect fusion place set ir system involv access text collect collect search ir system disjoint trec consist list fewer work fall label data data fusion document list return system list chose data fusion experi found consist improv harder set collect fusion resort system import close mimic situat found total overlap set page index individu search engin distinct made type ir problem distinguish main adhoc rout adhoc retriev occur text collect queri constantli submit user rout stand document arriv filter queri chose concentr rout problem combin model work set found consist improv adhoc data fusion set requir sophist model choic analysi basi materi adhoc entri data set run submit queri provid total list treat separ ir chose submiss readili repres typic expect search engin list top rank document score subset entri set ir system order avoid combinatori repres typic number major search engin web subset chosen maxim idea set system order adequ sampl distribut ir system object similar measur chose ir system aggreg pair measur similar metric detail document relev guttman point alien pair document overlap relev nonrelev measur divid standard averag queri measur gener singl measur pair chose system put system furthest increment ad system minimum distanc system subset largest result subset system research institut australian nation contribut automat manual approach differ term perform approach note system subset list top contributor number uniqu relev document contribut relev assess pool nist uniqu document correl ir feel strengthen claim chosen subset subset select techniqu outlier space ir claim desir combin model select combin model linear combin weight sum linear combin model calcul relev ρ document queri base weight individu ir estim relev wi ρ relev rank document previou found lc model perform simpler model data fusion set combin result system studi conclud complex combin model base weight system content document score gener lead result lc model lc model fast requir small amount storag weight run consist number ir system divid set document test set weight chosen optim perform metric train appli model test calcul averag origin system combin measur correl tradit ir perform measur base recal train regim found produc combin gener test set test set run consist roughli data assign set equal tradit data adequ amount data set conjug gradient implement press al train converg toler run replic time initi random seed vari initi random weight partit ir system subset queri suffici number relev document ensur relev document set document condit order perform metric real mean queri subset queri averag number relev document similar entir set versu slightli harman hard measur result view effect interest expect perform ad ir system combin view reflect prior knowledg perform candid ir system realist approach add whichev remain system perform approach assum estim past perform candid report result view figur graph test set averag system approach schedul ir system base train horizont line repres averag singl system perform test set figur present result typic queri good result exhibit monoton perform expect perform perform techniqu surpass individu expert figur present queri failur perform oscil system time combin exce perform system figur displai plot ten queri graph present reader result make qualit assess result graph queri present appendix examin plot averag line error belkin ad system pai plot uniformli monoton point diminish return reach system expect perform combin singl system expect perform exce amount varianc distribut chang slight amount mean estim averag perform add system set find set stop train optimum set weight guard overfit model figur expect averag combin function number system compar queri figur expect averag combin function number system compar queri figur expect averag combin function number system compar schedul rout queri idea randomli system includ combin optim account perform compon overlap graph show result variant approach dash line plot perform schedul techniqu quickli improv combin system reason techniqu perfect past perform futur perform directli graph note point plot horizont dot line dot line repres test set perform test set point plot test set perform system train set phenomenon directli measur correl train test set perform measur linear regress show tabl correl coeffici linear regress portion queri correl train test set perform interest question type queri amen rough measur count number relev document exist queri queri averag combin singl system total relev document tabl note relev document test remain queri total relev document interest note queri smallest set correl fewest number relev document number relev document correl set correl queri correl relev tabl correl train test set perform queri figur present view experi plot averag rel combo show improv graph queri save graph appendix note schedul repres plot ignor queri improv due reason note common trend amount improv level system chanc high system system make difficult squeez improv larger combin interest point figur averag improv queri function number system combin figur averag improv queri function number system combin figur averag improv rout queri function number system combin note plot lower end error bar consist line mean amount includ system combin interest note absolut amount asymptot averag improv queri vari averag repres notic gain perform pai simpl combin strategi tabl queri fewer relev document tend show improv trend question verifi larger data set import realiz absolut valu improv figur higher expect oper set reason system data set outstand individu mean easier improv subset system tend contribut uniqu relev document potenti boost averag improv number recal work suggest reason gain perform set tend greater system involv return similar set relev document queri relev tabl approxim asymptot queri shown system queri relev linear combin ir system perform test data individu expert good heurist system includ system techniqu cost depend factor avail speed compon system shown amount improv diminish number ir system combin subset improv level exact point asymptot depend number system larg caveat result queri relev document common difficult achiev improv beat system due fact queri low correl train test set perform natur step research expand scope experi term number number problem address verifi put point improv correl number relev document suitabl adhoc problem close mimic situat investig prove requir combin model similar experi collect fusion set lead qualit result collect fusion amount improv greater asymptot due effect recal refer gw rk automat combin multipl rank retriev system sigir seventeenth annual intern confer research develop inform retriev ea ja combin evid multipl queri inform retriev inform process ae experi select search engin metasearch acm transact inform intellig fusion distribut search engin journal comput stanford internet acm intern confer manag data statist dk text retriev confer nation institut standard technolog special public dk text retriev confer nation institut standard technolog special public dk overview text retriev confer text retriev confer data fusion learn method rout task text retriev confer bp numer recip art scientif comput cambridg press le report data fusion collect fusion text retriev confer ma xerox trec combin exact fuzzi predictor text retriev confer web search engin journal american societi inform metacrawl architectur resourc aggreg web ieee combin expert opinion approach probabilist inform part conceptu model inform process cc adapt combin evid inform retriev doctor depart comput scienc san diego cc gw predict perform linearli combin ir system sigir twenti annual intern confer research develop inform retriev acm press cc gw fusion linear combin score inform collect fusion problem text retriev confer wj knowledg multipl human relev judgement acm transact inform appendix perform graph queri improv graph queri
IR/1040 5 hidden web hector comput scienc stanford ca usa abstract crawler retriev content publicli index set web page reachabl pure hypertext ignor search form page requir author prior registr ignor tremend amount high qualiti content search larg searchabl electron provid framework address problem extract content hidden web built hidden web crawler call hidden web describ architectur present number techniqu design implement present result experi conduct test valid techniqu hidden content html form introduct number recent studi note tremend amount content web dynam dynam number form section web page dynam program creat page request page receiv client page dynam includ code execut client machin retriev content remot server page applet retriev displai latest stock base studi conduct lawrenc gile estim close content web dynam number continu major softwar vendor technolog make dynam page gener simpler trend continu dynam content crawl index search categor servic cover portion web call publicli index web refer set web page reachabl pure hypertext ignor search form page requir author prior registr address problem crawl subset dynam web content concentr extract content portion web hidden search form larg searchabl call hidden hidden web organ larg amount inform censu patent trademark term deep web refer refer portion web media place content onlin typic achiev build web queri standard html form element content access dynam gener deliv user queri crawl hidden web challeng problem fundament reason issu recent studi estim size content searchabl onlin time larger size prudent attempt coverag hidden web access provid restrict search intend human crawler restrict interfac extract relev problem address approach crawl hidden web aim select crawl portion hidden extract content base requir user profil provid framework human expert custom assist crawler activ counter issu scale market analyst interest articl press pertain semiconductor industri militari analyst interest polit inform countri analyst exist search servic obtain url site relev instruct crawler focu site paper directli address resourc discoveri problem section citat relev work work address issu autom content locat potenti sourc critic enabl crawler submit queri hidden web relev market analyst provid list product compani crawler encount form requir crawler automat fill form analyst fill form process labori encod knowledg speed process dramat crawler potenti compani product visit analyst simpli initi seed set crawler submit form collect save repositori queri gener repositori hold static page crawl convent fashion index built page search index reveal hidden static target applic repositori cach import militari intellig direct web access desir crisi hide interest set page copi cach site intermitt net submarin analyst submarin access import page access cut submit queri origin sourc built prototyp hidden web crawler call web experi design implement make contribut present systemat classif dynam content dimens relev type dynam gener mechan place work context crawl web model form form succinctli captur action crawler successfulli extract content cast content extract problem identifi domain form element gather suitabl valu domain describ architectur crawler describ strategi build list pair techniqu handl actual mechan crawl hidden web analyz form deduc domain form present experi demonstr effect approach techniqu note crawl dynam page significantli easier site host cooper crawler organ gather index page local intranet web server run intern network configur recogn request crawler export entir predefin format approach emploi recogn request crawler major search engin compani export entir index gener case crawler visit site public internet cooper exist big advantag special agreement visit site requir advantag import site studi drawback crawl process inher automat crawler miss page fill form incorrectli index cach subset hidden classifi dynam web content attempt classifi dynam import notion dynam page adopt definit dynam content gener request è receiv program execut server client contrast static page è entir content è exist readi transmit client request receiv aim crawl index dynam definit encompass dynam dynam user interact page static script tag dynam modifi visibl object satisfi definit categor dynam web content import type mechan implement dynam categor base type dynam common reason make web content user user input lead type tempor page dynam content exhibit tempor dynam page displai stock ticker list latest world headlin fall categori request tempor dynam page point time return content crawler crawl tempor dynam page kei issu crawl page fresh measur date crawl collect compar latest content web site crawl strategi present cho al maxim applic context page content custom gener client exhibit dynam common dynam person web site custom page term suit user commun user entail gener page inform cooki explicit identifi user page dynam custom crawl page applic target heterogen user popul crawler gener web search restrict equip cooki login inform usernam crawl fix set site input page content depend input receiv user exhibit input dynam prototyp page gener web server form submiss queri onlin searchabl form gener page search result result page fall categori input dynam page hidden web exhibit input dynam focu crawl page note dynam page exhibit combin class dynam page amazon web site exhibit book recommend base user profil tempor dynam latest miscellan sourc dynam fall categori tool web site creation mainten content store server note simpli modifi content static page web server constitut tempor dynam definit requir dynam page gener program term restrict crawler refer crawler limit crawl activ specif set site figur classifi web content base impact crawler nativ text file tool provid program gener page raw clean separ content present page dynam content static categor base gener mechan number mechan technolog assist creation dynam web content mechan divid program execut server gener complet html page transmit client oldest commonli method gener web page fly varieti specif common gatewai interfac java servlet control interact web server program gener page program process gener form submiss implement input code dynam web page server static html text code snippet request page code snippet execut server gener output replac actual code page unlik program produc complet html page code snippet gener portion page script languag implement code snippet code previou web page html text code refer code code download execut client typic control environ provid browser java applet activex control exampl technolog support mechan figur sampl label form page emploi program code execut pose special challeng page receiv crawler receiv html page process process static content page execut pull content requir special environ java virtual execut code equip crawler greatli complic design implement page hidden web gener address techniqu paper figur summar classif present section vertic axi list gener mechan horizont type content portion web repres region grid model form form submiss fundament differ action hidden web tradit crawler treat page form describ model form form submiss section describ model extract hidden content model form model set element domain form element standard input select text text radio button domain element set valu form element element finit set valid valu page select list html set valu list element note submit reset button manipul provid input figur html markup sampl form figur text box infinit domain set text valu chosen form element descript text user understand semant element refer descript inform denot label form element figur show form element notat figur piec html markup gener form notion label domain valu distinct intern form refer figur note intern label element set è set intern identifi intern identifi form submiss visibl form displai meant human consumpt indic true semant mean model set user form associ piec text element form crawler perform similar assign select suitabl valu domain form element choic depend semant form perform crawler element small finit potenti exhaust domain figur crawler retriev relev relev press final relev report infinit domain crawler decid valu domain semant relev applic fill element figur crawler access list compani assum requir crawler access finit set concept attribut element attribut element valu section describ data sourc crawler obtain valu show crawler crawl experi add list valu data sourc equal reliabl crawler confid valu valu gather base crawl experi model valu input sourc organ tabl call label set tabl entri lv tabl form î label î ú set valu belong label fuzzi set î membership function assign rang member set repres potenti assign element ä repres estim assign lv tabl support notion label label share fuzzi set handl synonym repres concept gener assign form crawler gener assign textual match element label label lv tabl gener fuzzi set valu infinit domain element î denot lv entri label ä close match section î finit domain ü î ë î ¢ î ¢ denot set assign form current content lv tabl denot maximum number time crawler submit form upper bound number submiss ensur crawler spend time singl form extract relev content visit crawler assign gener form submiss notion assign base rank assign î ë experi rank function repres rank function ú denot assign associ element fuzzi rank assign minimum constitu valu treat assign standard boolean conjunct individu fuzzi set approxim element label match set label lv tabl assum match paramet pass crawler startup figur compar basic execut loop tradit crawler ú rank assign averag weight constitu valu ú ò rank function treat weight probabl likelihood choic likelihood likelihood assign comput ú note conserv assign rank assign high rank assign individu weight high averag assign rank great rank fuzzi conjunct assign aggress assign low rank assign individu weight low section present detail experi compar rank function hidden web basic action hidden web similar tradit crawler figur flowchart left typic crawler consist url page page process extract link note tradit crawler distinguish page figur architectur form shown flowchart execut sequenc addit step page form detect perform sequenc action form form process form build intern base model outlin section assign gener assign submit complet assign analyz page check submiss yield valid search result match feedback tune assign step page hypertext immedi link visit ad depth note ad link page url queue chose navig page upto step execut assign iter sequenc assign gener model section architectur figur illustr complet architectur crawler includ basic function modul intern crawler data structur basic crawler data structur url list url crawler discov start url list initi seed set url crawl manag control entir crawl process decid link visit make network connect retriev page web crawler configur stai figur action form analysi modul set target site crawl manag link point site crawl manag hand download page parser modul parser extract hypertext link page add url list structur sequenc oper repeat termin condit number hour satisfi refer reader exist crawl literatur detail design crawl manag modul process form extract hidden emploi addit modul lv tabl form form analyz implement iter sequenc step outlin previou section lv manag manag addit access lv tabl interfac data sourc suppli entri tabl discuss section design issu techniqu form analysi form includ list element select text form label element element finit list valu constitut domain submiss inform submiss method submiss submit complet form collect form analyz execut sequenc step figur begin construct logic tree structur html base document object model specif dom api obtain list form element submiss inform refer reader dom specif detail form processor navig step form analyz techniqu remaind section extract label domain valu normal extract inform section integr inform dom api produc intern form label domain accur extract label domain valu prove hard nest relationship respect form element fix figur commonli entir form laid tabl piec text repres label word domain valu word form control element interleav arbitrarili tag tabl markup layout label occur column actual form element widget column tabl natur type layout markup explicit space line break control align label form widget structur base dom directli yield label domain valu address adopt partial page layout techniqu kei techniqu realiz restrict rel locat domain form render relationship entiti obviou user irrespect phrase figur visual adjac widget word visual adjac radio button widget lai form similar browser lai page prior physic render heurist identifi label form element analog heurist domain identifi piec visual adjac form horizont vertic direct base comput actual pixel distanc center form widget center text piec step yield list candid candid left candid drop candid ti broken favor render bold larger font size tie candid pick random note select list extract domain valu valu directli nest element note text piec word default crawler label short word short phrase observ form place label left form widget figur prune partial layout note calcul visual complet layout page locat form respect rest page relev prune origin page isol element directli influenc layout form element label figur show form directli main bodi tabl prune tree construct form element node path form root layout implement simpl custom layout engin discard ignor font default ignor style inform bold ital break ti mention ignor style sheet experi section visual adjac robust effect strategi extract label domain valu studi evalu techniqu match label input element techniqu develop context displai form small devic normal gener piec text label domain extract html page match piec text store lv tabl ensur spuriou differ result miss text piec subject normal process form analyz normal extract label valu lv manag normal entri lv tabl normal consist sequenc counter error extract piec text search html tag html entiti refer tag entiti refer remov charact charact replac space charact convert lower case stop word remov word result text standard potter algorithm form process main issu design form processor modul figur algorithm match element label label lv decid form process match recal label found obtain valu input submit complet form find label search lv tabl domain find good domain lv valu element label match form label label lv emploi approxim string match algorithm larg bodi work design analysi string match algorithm choic base abil algorithm account type error word reorder type error captur standard string match notion edit measur minimum number charact replac requir transform string word reorder requir distanc measur label identifi block edit model succinctli repres type error word reorder model defin concept block edit gener tradit notion edit distanc handl movement famili algorithm implement label match system base block edit model match form element lv entri minim block edit distanc subject threshold denot block edit distanc string block edit distanc match repres minimum block edit distanc match lv entri comput ä ignor crawler process page encount form directli relev task extract content form local site lv tabl match relev form polici decid form ò submit iff match lv configur paramet repres smallest form size crawler process crawler ignor singl element form form simpl search note ignor form unabl associ match lv entri infinit domain element form form requir input provid form search user enter partial form input model analysi aim analysi automat distinguish search result error report match found submit queri idea inform tune assign strategi analysi turn challeng number absenc commonli accept format report error mean web site free custom error notif messag match result error page includ varieti textual content site code actual error messag text error messag simpli search page match text lead drop form multipl type error web server base logic tackl modul techniqu base identifi page portion page obtain discard side site identifi heurist page laid portion visual middl page case page format inform frame size layout page identifi frame retriev treat content portion page page custom layout engin identifi html element visual laid center page page construct dom locat dom tree present treat entir tabl content portion page present treat entir page content page page receiv form submiss portion techniqu identifi error page techniqu search portion page occurr list error messag techniqu base hash content portion form analysi modul comput hash portion maintain list hash form hash occur assum futur page gener hash error page initi experi techniqu analysi modul success distinguish page search result page error messag tune investig approach modifi assign strategi crawler base feedback analysi modul analysi modul error page receiv crawler attempt isol form incorrect led error popul lv tabl crawler support mechan popul lv explicit suppli label set startup time load lv tabl crawler initi explicit initi equip crawler valu label crawler encount configur task section suppli list relev compani list label entri lv tabl commonli dai applic wrap data lv manag commun receiv entri lv tabl queri data sourc interfac interfac includ kind support give data return fuzzi set label return valu belong set section describ built wrapper program onlin yahoo directori data sourc lv tabl crawl form element finit domain sourc pair process crawler glean pair finit domain element add lv data sourc wrap program export interfac set site crawl explicit initi entri lv tabl set data wrap label match threshold maximum number submiss form minimum form size assign rank function tabl configur crawler visit form label finit domain element form infinit domain element notic experi crawl task section form set subject categori select deal semiconductor technolog form text box label expect user categori crawler valu set form effect fill set form directori topic hierarchi data sourc discov onlin categor yahoo directori open directori project structur inform effect data sourc popul lv tabl directori expand exampl valu belong set row lv entri set lv manag present set wrapper program yahoo data wrapper submit separ search queri valu set yahoo directori return list categori pertain queri wrapper construct intersect categori list identifi state yahoo categori common valu wrapper retriev list entri yahoo list turn list state list entri categori turn wrapper return top entri start small set conjunct exist topic hierarchi expand set integr valu lv tabl set model fuzzi set ad lv assign suitabl weight valu obtain explicit initi categori note pair extract form process submit fail satisfi criteria list section multipl categori result wrapper randomli weight repres maximum confid valu directli suppli weight valu receiv data sourc comput wrapper interest case comput weight valu gather crawler crawler encount form element finit domain treat fuzzi set membership function ü ü case incorpor lv case crawler successfulli extract comput î replac î entri lv tabl entri î î standard fuzzi set union oper defin membership function å î å î ü ü ü element set exist element case crawler successfulli extract creat lv membership function defin ü ü case final crawler unabl extract label problem label extract identifi entri lv tabl set valu entri add valu set entri entri î comput è defin ü express numer score measur î denomin normal score size identifi entri maximum score maximum score fuzzi set deriv membership function ü ü replac entri entri configur aspect requir explicit custom tune meet applic introduc configur paramet control action crawler tabl summar input user provid initi crawl activ experi perform number experi studi valid architectur techniqu emploi summar result experi fuzzi set score î î total number form number site form pick total number element total number finit domain element averag number element form minimum number element form maximum number element form tabl statist pertain form test label domain extract techniqu test label domain extract recal part form analysi crawler extract label domain valu finit domain element select list analysi import compon crawl conduct extract experi set randomli chosen form tabl summar relev statist test set ensur varieti rang simplest search box complex includ test set form manual analyz deriv correct label domain valu element extract algorithm execut set form observ extract techniqu achiev extract label accuraci extract domain valu manual inspect html markup random sampl notic associ domain valu form widget significantli affect complex layout associ label form widget expect simpler base analyz html perform domain extract layout techniqu extract overhead layout inform extract domain valu crawler perform metric tradit deal publicli index metric crawl scalabl page import fresh measur effect crawl activ metric captur fundament challeng deal hidden web process submit form consid number option measur perform abil extract content conceptu appeal difficult estim comput inform question extract content german difficult comput exhaust manual inspect final chose submiss effici metric defin total number complet form crawler crawl extract accur match obtain manual activ denot number submiss result page search result defin strict submiss effici metric ø note metric penal crawler submiss yield search result content match queri paramet defin submiss effici metric penal crawler form submiss semant incorrect submit compani input form element intend receiv compani denot number semant correct form difficult form submiss compar manual actual decid semant correct submiss larg experi involv hundr form comput highli cumbersom ø measur crawler perform submiss effici metric estim work crawler period time crawler submiss effici rate crawl amount crawler higher rate expect retriev content experi paramet number site visit number form process number form submit label match threshold maximum number submiss form minimum form size assign rank fuzzi conjunct minimum accept rank assign tabl paramet valu perform experi experi present section base configur execut crawler onlin technic press pertain semiconductor year tabl list default valu experi obtain manual inspect inform analysi modul addit restrict number submiss condit assign submit form greater equal constant tabl addit form set assign submit set irrespect rank function addit restrict compar assign rank function present section site url semiconductor research corpor semiconductor refer site hoover onlin busi network lyco compani onlin tabl sourc inform initi crawler configur requir target set site inform initi lv tabl tabl list onlin sourc gener basic lv entri requir crawler entri includ partial list semiconductor manufactur compani list semiconductor industri sourc list tabl extract inform explicit initi remain sourc wrap custom wrapper interfac lv manag automat provid valu yahoo directori section act sourc valu crawler provid list site includ gener semiconductor industri specif press product product tabl present sampl site target crawler crawler encount process form satisfi criteria section discard form small search form search box submit button site url ieee spectrum semiconductor onlin semiconductor busi yahoo total semiconductor intern solid state technolog intern magazin cnn technolog tabl sampl target site crawl effect assign rank studi effect assign rank function crawler execut initi rank function ø tabl crawler perform rank function figur variat perform set data sourc rank function occas tabl show result execut rank function submiss form submit submit form gener success submiss significantli crawler effici maximum content crawler primari choic rank function perform poorli submit form achiev lesser number success form result success ratio function good identifi assign effect figur illustr effect chang minimum form size figur valu percentag figur repres ø note crawler perform larger form smaller form tend descript consist unlabel text box button crawler ignor form unabl find match element label larger complic form tend descript label number finit domain contribut improv perform effect crawler input lv section process crawler contribut entri lv tabl figur studi effect techniqu perform crawler gener data figur crawler execut crawler contribut lv number success form submiss crawler input enabl crawler input disabl number form process figur effect crawler input lv perform contribut disabl figur show initi stage presenc absenc crawler contribut impact perform form crawler encount number finit domain element contribut entri lv tabl lv manag entri retriev addit valu data sourc section end contribut crawler directli addit success form submiss relat work recent growth web stimul interest studi web crawler studi address design implement crawler work sole publicli index portion web figur previou report publicli techniqu architectur crawl hidden web approach crawl similar approach adopt work crawler tune seek retriev page relev predefin set topic crawl approach present applic page publicli index web address issu match form element descript text context enabl html form support small pda present varieti techniqu extract label conduct extens perform experi techniqu base detail studi common wai form laid web page onlin servic easi access thousand onlin organ pointer searchabl topic hierarchi web page autom intellig agent human creat maintain hierarchi onlin servic claim automat tent store hidden web techniqu proprietari detail publicli address problem crawl extract content portion web hidden searchabl html form specif approach hidden web crawl argu tremend size hidden coverag possibl crawl specif design configur crawler benefit knowledg applic domain present simpl model search form process fill form base architectur hidden web crawler illustr autom content extract hidden web present techniqu design implement crawler present result experi conduct valid techniqu result show crawl hidden web form incorrectli refer web site activ server page technolog deep surfac hidden soumen martin van den byron dom approach web resourc discoveri eighth intern web junghoo cho hector evolut web implic increment crawler intern confer larg junghoo cho hector synchron improv fresh intern confer manag junghoo hector lawrenc page effici crawl url order seventh intern web document object model level specif mari daniela alon dan suciu websit manag system intern confer manag page daniela alon alberto mendelzon techniqu survei sigmod form html document html recommend frake englewood inform retriev data structur algorithm prentic fuzzi set theori kluwer academ allan heydon marc najork extens web crawler world wide decemb page tm technolog oliv hector andrea paepck effici web form entri pda submit steve lawrenc lee gile search world wide web steve lawrenc lee gile access inform web daniel andrew tomkin block edit model approxim string match theoret comput juli paolo alessandro paolo giusepp manag system intern confer manag page robert miller krishna bharat framework creat web crawler seventh intern web open directori hypertext processor java servlet tm technolog yahoo incorpor
DB/1041 3 dix system ss multi agenten system vu ss tu wien auf system mit june es und logic base coalit auf heterogen activ agent mit ein ansatz der formal au dem auf prolog call agenten statu um overview dix system ss distribut make contract coalit format impact architectur legaci data code call action agent program regular agent meta agent program overview chapter action agent program system ss action agent program action base overview execut concurr action constraint agent syntax statu set feasibl statu set ration statu set reason statu set overview chapter detail discuss semant action agent program chapter action agent program system ss action state oo messag singl agent agent program code call messag legaci data sem conc set statu atom action execut updat figur agent architectur overview chapter action agent program system ss underli softwar basic set data structur legaci code top agent built set data type manag softwar call state agent time tt state agent vari time integr agent finit ic integr constraint reflect part design state agent satisfi overview ic chapter action agent program system ss agent set action action implement bodi code implement suitabl imper program languag action creator agent prevent agent concurr execut action feasibl agent overview chapter action agent program system ss agent agent program set languag creator principl agent polici govern action agent plethora action agent program agent encod agent overview chapter action agent program system ss action base definit action action consist written root variabl written type type action bodi code execut action action base chapter action agent program system ss condit call precondit denot safe modulo set set condit action atom formula ti object type action base chapter action agent program system ss item classic ai framework agent state set logic atom arbitrari data structur precondit logic formula code call condit list set ground atom code call condit action implement add list delet list arbitrari program code action reason add list delet list add list delet list comment assum add delet list correctli describ behavior action code action action base chapter action agent program system ss supplier agent chain updat supplier select uncommit amount supplier select uncommit supplier select commit supplier select uncommit supplier select commit action base chapter action agent program system ss action updat access uncommit commit stock supplier agent make amount request consult uncommit stock supplier agent updat uncommit stock reduc amount request add entri commit stock request compani action base chapter action agent program system ss autopilot agent action comput current locat comput autopilot locat autopilot locat autopilot autopilot veloc autopilot action base chapter action agent program system ss action requir satellit report produc gp agent merg gp data comput current locat plane base report alloc flight rout plane action base chapter action agent program system ss profil agent updat profil profil profil action updat user profil user high order determin high invok code call obtain target list updat entri user profil profil agent similar action low medium action base chapter action agent program system ss definit action ab finit collect action action base chapter action agent program system ss execut concurr action result execut definit ss underli softwar code access agent ground instanc execut state oo exist solut γ wrt oo state oo feasibl execut tripl oo denot set pair feasibl execut tripl state oo execut concurr substitut θ variabl ground precondit occurr free variabl occur ground valu variabl solut respect current state oo variabl view action interest action execut chapter action agent program system ss definit feasibl execut tripl state oo result execut wrt state odel oo odel odel oo state result object solut call condit oo object solut call condit oo insert execut concurr chapter action agent program system ss simultan execut set necessarili feasibl execut tripl wai defin definit notion concurr object oo set execut tripl return singl execut tripl singleton state oo execut state oo execut concurr chapter action agent program system ss definit concurr set feasibl execut tripl agent state oo weakli concurr execut oo defin agent state odel odel odel oo oo execut concurr chapter action agent program system ss set execut oo execut set feasibl execut tripl stem ground action denot result state execut concurr chapter action agent program system ss definit set feasibl execut tripl agent state oo execut state oo exist permut π sequenc state oo oo oo action state oo oo oo execut final state result set ac action execut agent state oo set execut oo execut concurr chapter action agent program system ss definit set feasibl execut tripl agent state oo execut state oo permut permut final state result execut ident set ac action execut agent state oo set execut oo execut concurr chapter action agent program system ss set action updat updat updat uncommit stock commit stock weak concurr execut action attempt execut delet list supplier select uncommit supplier select commit supplier select uncommit supplier select commit execut concurr chapter action agent program system ss import note code call copi weak concurr execut consid union delet list union add list action add list supplier select uncommit supplier select uncommit supplier select commit supplier select commit supplier select uncommit supplier select commit execut lead intuit inconsist state commit stock claim number commit item widget execut concurr chapter action agent program system ss return situat page set action execut updat updat updat assum uncommit stock tupl page set action execut execut state supplier permut action result final agent state execut sequenc result uncommit stock execut concurr chapter action agent program system ss comment rest assum develop agent chosen conc concurr action execut agent vari agent agent singl notion concurr talk agent phrase concurr consid synonym phrase concurr execut wrt notion conc agent execut concurr chapter action agent program system ss action constraint definit action constraint ac syntact χ action χ code call condit action constraint chapter action agent program system ss action constraint supplier agent chain updat updat part part supplier select uncommit action constraint chapter action agent program system ss respond request respond request part part constraint state updat action updat part id total amount sum request action concurr execut constraint state compani request part supplier agent respond concurr supplier agent process request time action constraint chapter action agent program system ss action constraint autopilot comput adjust action constraint state action comput adjust execut concurr adjust action requir current locat plane comput action comput requir input action constraint chapter action agent program system ss show action constraint gp collect data merg data satellit collect data merg data satellit action constraint state gp agent concurr execut action merg data collect satellit collect data satellit data merg action constraint chapter action agent program system ss action constraint profil agent store updat updat profil updat classifi user action constraint chapter action agent program system ss action state user classifi high profil agent execut updat updat concurr action constraint state profil agent classifi user profil updat profil user action constraint chapter action agent program system ss definit constraint set ground action satisfi action constraint ac state oo denot legal assign θ object oo variabl ac true hold concurr execut action exclud ac includ satisfi set ac action constraint oo denot ac ac ac ac ac action constraint satisfact wrt set action ac impli ac action constraint chapter action agent program system ss state consist uncommit stock tupl page ac action constraint page consist consist satisfi ac updat updat updat updat updat updat ac part unit part action constraint chapter action agent program system ss agent syntax introduc import softwar code call singl framework piec softwar state describ data object manag softwar packag point ic integr constraint specifi softwar state ab action base set action agent physic execut precondit action satisfi softwar concurr notion function merg set action agent attempt execut coher ac action constraint specifi set action incompat statu atom action rule chapter action agent program system ss definit statu action vector term match type schema formula action statu atom set call action statu set mean agent permit action mean agent forbidden mean agent oblig action mean oblig action mean agent action statu atom action rule chapter action agent program system ss definit action rule form action statu ln action statu code call negat sign statu atom action rule chapter action agent program system ss definit requir rule safe safe modulo root variabl occur explicitli root variabl occur statu atom action rule chapter action agent program system ss variabl rule implicitli quantifi front rule rule negat sign occur front action statu atom bodi rule form denot atom head collect liter neg liter posit liter atom neg liter index set denot restrict liter involv action statu atom code call statu atom action rule chapter action agent program system ss definit agent program pp finit collect rule agent program pp posit rule posit statu atom action rule chapter action agent program system ss supplier agent agent program shown supplier agent make messag box variabl order extract supplier agent invok code call messag box domain updat process request supplier rule ensur invok updat amount request exce amount statu atom action rule chapter action agent program system ss updat process request process request part updat amount amount supplier statu atom action rule chapter action agent program system ss rule ensur invok updat amount unit part amount exce amount agent finish updat action amount unit part statu atom action rule chapter action agent program system ss order part process request supplier low threshold supplier suppli part id fall suppli low oblig order amount order unit part note amount order suppli low repres integ constant statu atom action rule chapter action agent program system ss order part process request supplier low threshold supplier suppli part id fall suppli low order amount order unit part suppli low suppli rule reduc number time invok rule note amount order suppli low repres integ constant statu atom action rule chapter action agent program system ss order part process request supplier low threshold supplier supplier part part id oblig order amount order unit part suppli fall suppli low threshold rule statu atom action rule chapter action agent program system ss request process request order part decid order amount request unit part part request plant supplier servic determin supplier provid amount request unit part id note supplier agent plant agent decid manufactur plant statu atom action rule chapter action agent program system ss request process request process request plant order part decid order amount request unit part part ship servic determin request amount request unit ship part determin plant agent part supplier extract messag plant agent supplier request supplier servic statu atom action rule chapter action agent program system ss process request rule agent oblig process request messag box agent respond posit request delet msg process request rule agent delet messag process messag box statu atom action rule chapter action agent program system ss discuss formal semant agent quickli revisit architectur decisionmak compon shown figur page agent manag set data type set method data type method includ messag box data manipul algorithm chapter point state reflect set data item agent access data item data type allud time agent receiv set messag constitut chang state agent statu atom action rule chapter action agent program system ss trigger rule agent program true base select semant agent program subsect agent make action rule govern behavior encod agent program comput made execut program call comput semant agent action perform mention semant concurr execut notion conc select design state chang consequ perform action messag box agent chang cycl continu statu atom action rule chapter action agent program system ss algorithm agent ic integr constraint ac action constraint ab action notion set messag true ic ac ab find set action execut base messag receiv curr result execut singl action end statu atom action rule chapter action agent program system ss agent program supplier agent page time sell agent consult rule ensur amount request exce amount request multipl compani concurr request part consid supplier page request individu current satisfi agent program question adopt prefer strategi replenish rule fire suppli part part id fall suppli low threshold agent order suppli suppli rule eventu fire suppli part part id fall suppli low threshold agent oblig order part oblig part part id discontinu rule statu atom action rule chapter action agent program system ss order rule fire supplier agent consult plant agent determin supplier supplier supplier agent ship agent provid ship schedul order part deliv easi rule messag request part consid rule ensur messag delet messag box statu atom action rule chapter action agent program system ss multiag reader agent multiag applic interact provid discuss appendix book full work code agent autopilot agent δ unit autopilot agent receiv messag clock agent messag includ request autopilot agent wake agent program autopilot action turn trigger action execut action sendmessag servic request gp agent request current locat plane statu atom action rule chapter action agent program system ss gp agent execut retriev messag autopilot agent program gp agent execut request execut action sendmessag answer request made autopilot agent autopilot agent execut action retriev messag gp agent program autopilot agent check locat plane gp flight plan plane execut action sleep sleep δ unit time execut action sendmessag request terrain agent send elev plane current locat determin gp send area statu atom action rule chapter action agent program system ss terrain agent execut action retriev messag autopilot agent program terrain agent execut request execut action sendmessag terrain autopilot answer request made autopilot agent autopilot agent execut action retriev messag terrain agent execut replan action terrain locat plan terrain area statu atom action rule chapter action agent program system ss statu set agent agent program pp question agent set action statu atom form true respect pp current oo underli set ac action set ic underli integr constraint agent defin set action agent execut concurr execut concurr chapter action agent program system ss feasibl statu set constitut semant agent semant defin agent program build basic definit feasibl statu set consist assert statu assert compat necessarili forc true rule agent program underli action integr constraint execut concurr chapter action agent program system ss definit statu set set ground action statu atom ss oper op denot set statu set repres inform statu ground action atom occur mean statu op true execut concurr chapter action agent program system ss definit action statu set call deontic consist satisfi rule ground action oo denot existenti closur free variabl govern existenti quantifi condit mean action fact execut state oo statu set call action consist ac hold execut concurr chapter action agent program system ss presenc atom entail presenc atom expect execut concurr chapter action agent program system ss definit action deontic closur statu denot closur rule ground action deontic hold action closur statu set denot closur rule ground action statu hold execut concurr chapter action agent program system ss proposit statu set impli statu set consist close assign statu ground action note ground action occur statu mean commit statu made definit specifi statu set rule express agent program pp execut concurr chapter action agent program system ss definit pp agent oo agent state defin set ground action statu atom exist rule ground instanc form code call χ succe oo code call χ succe oo atom op action execut state oo execut concurr chapter action agent program system ss feasibl statu set approach base semant agent program consist close statu set account rule program integr constraint lead notion feasibl statu set definit statu pp agent program oo agent state statu set feasibl statu set pp oo condit program action deontic action action action close deontic ic oo ic state result action state oo feasibl statu set chapter action agent program system ss action program feasibl statu set illustr exampl simpl agent program rule rule manag messag box order part process request supplier low threshold supplier feasibl statu set chapter action agent program system ss current state agent supplier number item part fall suppli low threshold part compani make request amount request amount order agent program multipl feasibl statu set feasibl statu set order part order part feasibl statu set order part order part feasibl statu set chapter action agent program system ss agent program rule page amount part stock low threshold amount agent program rule order part process request order part forbidden place order agent program feasibl statu statu atom form order part relev messag process action statu atom feasibl statu set chapter action agent program system ss show agent program feasibl statu set current object state statu set satisfi closur program rule deontic consist requir proposit feasibl statu feasibl statu set oo oo feasibl statu set chapter action agent program system ss note feasibl statu set includ action strictli chain return feasibl statu set page agent program multipl feasibl statu set feasibl statu set order part order part feasibl statu set order part order part immedi appar action statu atom order part order part present feasibl statu good reason fact perform action order part agent program question mandat order part feasibl statu set chapter action agent program system ss ration statu set notion ration statu set postul accommod kind reason base principl action execut suffici agent program evid rule agent program action execut unaccept action occur rule agent program ration statu set chapter action agent program system ss definit ration statu statu set exist statu set satisfi condit feasibl statu set statu set ration statu feasibl statu set ground ration statu set chapter action agent program system ss chain return page immedi appar feasibl statu set order part order part order part satisfi ration ration statu set chapter action agent program system ss observ definit includ condit feasibl statu set moment reflect show omit condit recal integr constraint maintain current agent state chang includ condit happen agent forc execut action program order maintain integr constraint ration statu set chapter action agent program system ss defin posit program pp agent state oo oper tp map statu set statu set definit pp agent program oo agent state statu set tp ration statu set chapter action agent program system ss lemma pp agent oo agent statu set satisfi tp tp theorem pp posit agent oo agent state ration statu set pp oo feasibl statu set corollari pp posit agent program agent state oo ration statu set pp ration statu set pp oo ration statu set chapter action agent program system ss return agent program page augment fax order augment agent program page rule fax order process request order part fax order fax order process request order part ration statu set chapter action agent program system ss easi ration statu statu atom fax order fax order introduct negat statu atom rule bodi lead potenti problem ration statu set chapter action agent program system ss shown page corollari page longer true presenc negat action statu atom note properti exist necessarili ration statu set proposit pp agent program ic pp ration statu set pp feasibl statu set ration statu set chapter action agent program system ss reason statu set attack ration statu agent program semant ration statu set logic contraposit program rule program ration statu ration statu set obtain appli contraposit ration set intuit explicit rule program justifi deriv reason statu set chapter action agent program system ss introduc concept reason statu set reader note ration statu set reason statu set approach definit statu pp agent oo agent statu set pp posit agent reason statu set pp oo ration statu set pp oo reduct pp wrt oo denot red program obtain ground instanc rule pp oo remov rule remov atom remain rule reason statu set pp wrt oo reason statu set program red respect oo reason statu set chapter action agent program system ss return case agent program present page ration statu fax order fax order ration statu set statu atom fax order reason reason rule list explicitli page infer fax order infer fax order implicitli provid higher prioriti ration statu set fax order reason statu set chapter action agent program system ss simplist present program pp reduct pp wrt agent state oo program uniqu reason statu set red reason statu set pp reason statu set chapter action agent program system ss reason statu set benefit respect knowledg rule action execut explicitli forbidden precondit default reason statu set rule deriv inappropri default rule proposit pp agent program oo agent state reason statu set pp oo ration statu set pp oo reason statu set chapter action agent program system ss summari chapter make compon decid action current state introduc action classic logic code call atom action implement code concurr execut assum conc action semant statu set agent agent program consist rule feasibl statu set set statu atom satisfi properti ration statu set feasibl reason statu set ration contraposit summari refer walker theori declar knowledg minker foundat deduct logic pp washington morgan kaufmann knoblock retriev integr data multipl inform sourc intern journal intellig cooper inform system krau platform collabor agent ieee intellig system al semant integr inform open dynam environ acm sigmod confer manag pp subrahmanian heterogen multimedia reason ieee comput al tsimmi integr heterogen inform sourc meet inform process societi japan anonym ftp host file subrahmanian tempor agent program technic report dept colleg md submiss journal subrahmanian probabilist agent reason transact comput logic pick meta agent program journal logic program pick heterogen activ semant artifici intellig roger heterogen activ polynomi implement agent artifici intellig subrahmanian heterogen activ algorithm complex artifici intellig ketchpel softwar agent commun acm roger theori function effect comput ross heterogen activ agent intellig integr inform acm sigmod confer manag pp guid protocol suit artech
Agents/1042 1 agent tucson alessandro andrea enrico denti università di bologna itali vial itali intellig infrastructur comput technolog progress chip processor speed network cite lead class network centric comput import area interest intellig smart environ promin case applic aim environ peopl live explor servic provid intellig softwar subsystem mobil devic agent origin dai central softwar suitabl support applic develop engin integr coordin open dynam set call concept societi technolog explicitli face design singl agent societi social social collect behaviour consid constitut system social global intellig manag light insid build simpl case repres applic aim show applic design develop agent societi illustr social aspect system engin mean suitabl coordin model analysi infrastructur develop coordin infrastructur coordin model technolog develop includ environ id tool light manag case studi work inspir current research agent infrastructur intellig environ case studi repres broad class autonom mobil agent interact open internet agent coordin requir manag resourc share autonom agent desir prefer call coordin chang adopt dynam applic goal manag light room build automat adapt intens visitor respect exist constraint gener appli light polici chang time room light rule behaviour light polici ad remov dynam visitor agent freeli roam room light sourc intens zone visitor insid sourc zone determin sourc intens sketch engin process case studi extend report found analysi design soda analysi design carri soda softwar engin explicitli model design social aspect system analysi individu role build social role room basic term individu social social task assign room group set light intens current room light polici room visitor prefer design individu role map agent class social role societi design coordin media light coordin emb interact rule social role express coordin law develop tucson applic develop carri mobil agent platform base tucson coordin infrastructur tucson coordin model base multipl independ interact tupl centr agent access local transpar global internet local interact space agent access local resourc environ meet agent coordin activ tupl centr basic programm tupl tucson logic coordin directli coordin gener commun fashion left agent tupl govern agent interact commun social rule express term tupl centr coordin written respect languag tupl centr understood social make constrain agent interact explicitli enforc coordin cooper activ defin agent aggreg societi tucson coordin infrastructur base main java main standard internet languag support commun coordin commun coordin base logic infrastructur full integr java interact exchang logic tupl logic tupl respect ordinari tupl space specif space tupl centr repres logic theori topolog assum distinct tucson node tucson node repres build coordin media manag inform build topolog access room store address room tucson node agent class identifi design stage implement tucson mobil visitor light coordin medium room map directli tupl centr locat tucson node room interact rule light program respect behaviour light tupl centr class tool java tucson technolog special id gui agent develop oper tupl centr debug monitor inspector edit control tupl centr pend queri specif provid commun coordin view space agent control capabl requir manag effect evalu lesson learn main benefit emerg engin case studi tucson coordin infrastructur dynam social rule encapsul coordin law tupl centr chang inspector seamless issu involv chang polici handl automat tupl centr reason inspect tupl logic natur commun respect enabl sound reason interact occur tupl centr involv coordin activ histori agent design observ visitor satisfact light evolut inspect tupl centr reason dynam content agent adapt behaviour tupl centr enhanc perform coordin activ logic natur respect make autom inspect coordin law adapt artifici agent easi prescript tupl centr model consist enforc coordin law repres light tupl centr enabl system consist maintain inher open distribut environ object coordin tupl centr dynam chang light polici perform affect visitor increment develop tupl centr provid direct support increment design develop agent behaviour tupl centr inspect enhanc ad coordin activ necessarili exist work benefit coordin model infrastructur support engin complex applic plan experi tucson technolog complex demand intellig environ applic refer michael huhn network ieee internet vol rune agent power commun vol alessandro andrea enrico denti enlighten agent tucson andrea septemb andrea omicini societi infrastructur analysi design system softwar paolo michael lnc andrea franco zambonelli coordin internet applic develop autonom agent vol
HCI/1043 4 april acm isbn video plan tool construct design matthia rauterberg morten helmut krueger institut appli physiolog swiss feder institut technolog switzerland abstract time establish approach humancomput interact augment realiti design strategi human behav natur behavior human real world human real world object fundament constraint natur interact deriv set recommend gener user natur user interfac concept present form runnabl comput interact techniqu plan tool construct design task keyword augment digit natur user comput interact introduct embodi comput work place tremend impact field interact graphic displai desktop workstat defin frontier comput world real world spend lot time energi transfer inform world reduc integr virtual world comput real world user argument ishii buxton graspabl user interfac encourag hand shift context sensit input parallel input specif leverag develop skill physic object intern comput facilit interact make interfac element direct manipul physic afford collabor conclud design empow human comput martin bichsel uw marku meier institut construct design swiss feder institut technolog switzerland user behav natur bring action bodi part interpret natur express power intellig pattern recognit techniqu demonstr inspir idea sun wellner digit desk design system base primarili concept natur user interfac task context plan activ plant design system call realiz support engin design assembl line build implement realiz design room figur enabl user sit tabl act interact space top mixtur virtual real world object tabl vertic area side view background figur perspect design plant figur design tabl top view side view back hardwar tabl white surfac horizont project interact area top high resolut lcd projector project top view comput graphic scene vertic tabl video acm isbn white project screen vertic project area side high resolut lcd projector project perspect view comput graphic scene horizont project screen ccd camera resolut pixel vertic tabl small brick special surfac physic interact handler silicon graphic indi mhz standard comput power video signal user interact render interact result view softwar consist independ process commun socket connect real time analysi process video read imag extract contour move contour determin posit orient interact handler applic built top framework applic interpret user action base posit orient interact modifi virtual scene user render top view scene vertic side view scene horizont applic design support provid assembl line plant earli design process read render arbitrari cad model machin vrml format input model virtual object realiz connect import origin figur object menu virtual machin top view hand move brick support user select posit deselect move virtual camera select virtual object specif virtual machin store place interact handler project imag machin menu area tabl chi april posit machin virtual plant move interact handler posit project plant layout tabl posit includ machin orient coupl orient interact handler deselect fix machin cover surfac interact handler hand remov machin place interact handler specif machin delet machin move back menu area virtual machin figur move virtual camera render perspect view displai vertic project screen side figur figur deselect object chang side view virtual camera move level ey virtual person bodi height virtual camera select move virtual object current view posit view direct correspond current posit orient virtual camera icon plant layout system empir test manag engin compani produc assembl line plant test show system intuit easi peopl enjoi person assembl virtual plant introduct system refer develop multimedia softwar base applic framework segment simpli connect move object static scene transact pattern recognit machin intellig vol nov pp lai foundat graspabl user interfac proc chi pp pattern recognit kei technolog gener user interfac proc pp piscatawai tog softwar design read interact paper digit desk commun pp
DB/1044 3 normal form logic mj maher griffith qld australia abstract logic import base nonmonoton reason formal effici implement make strict superior relat result import assimil concept confin attent critic aspect paper deriv result logic show superior relat add express power simul ingredi modular fact simul strict rule final show simplifi logic modular strict defeat form minim set independ ingredi logic introduct normal form plai import role comput scienc exampl area normal form prove fruit includ logic normal form formula proof theoret result theorem relat normal form drive forc develop theori principl good data model potenti benefit normal form instrument implement logic assum formula specif form simplifi facilit develop algorithm resolut normal form classifi object relat normal form dont specif kind anomali main benefit normal form assimil concept confin attent critic aspect kind benefit expect result paper prove result logic present logic approach nonmonoton reason distinct design easili implement unlik approach fact implement straightforward extens prolog long time research approach practic difficulti approach recent attent logic kind featur strict superior relat rule essenti superior relat inform rel strength inform rule overrul rule result present normal form theori strict rule separ complet strict rule subject overrul logic express sceptic drawn reason contrari invalid superior relat rule contradict rule draw overrul idea appli result superior relat add express power formal theori superior relat construct theori empti superior relat support logic languag main tool modular transform appli unit independ context transform basi compil theori effici execut form modular natur transform modif origin theori requir recompil entir theori increment chang made compil theori show strict defeat constitut minim set ingredi logic prove modular elimin strict rule defeat preserv express power basic logic inform present begin present basic ingredi logic theori consist kind strict knowledg base logic superior relat fact denot simpl piec inform deem true knowledg item typic fact tweeti strict rule rule classic rule appli rule statement true definit fiat strict rule written rule rule defeat contrari evid rule typic written idea conclud evid suggest fly defeat rule draw prevent defeat rule produc evid contrari bird main point suffici evid conclud bird fly evid bird fly superior relat rule defin prioriti rule overrid rule rule republican contradict made pacif person republican introduc superior relat conclud turn defin superior relat rule contradictori notic cycl superior relat make logic discuss requir acycl superior relat element straightforward express knowledg form theori seri exampl logic found technic detail paper restrict attent proposit assum reader familiar notat basic notion proposit logic denot complement posit liter rule consist finit set consequ liter kind strict rule denot rule defeat empti omit state rule set denot set strict rule set strict rule sd set rule df set defeat denot set rule consequ superior relat acycl relat transit closur call superior inferior rule call inferior iff inferior rule theori tripl finit set liter finit set superior relat tag liter ffl mean strictli provabl provabl strict rule fact ffl mean prove strictli provabl ffl mean provabl ffl mean prove provabl refer form definit inform ad form call defeat inform ad provabl defin base concept proof proof deriv finit sequenc tag liter satisfi condit denot initi part sequenc length sd sd element proof call line proof tag liter provabl denot iff proof line definit idea intuit appeal condit state establish provabl show provabl find rule provabl establish provabl counterintuit deriv definit reason rule prove provabl rule stronger appli essenti rule head form team rule head rule win deriv deriv manner normal form logic normal form theori main normal form provid separ definit strict rule particip superior relat particip effect definit affect theori occur normal form definit reason separ practic definit call theori normal normal form iff condit liter defin sole strict strict rule rule strict rule particip superior relat theori transform normal form establish fact formul mislead theori discuss unnecessari defin transform explicitli outlin proof transform preserv languag definit theori languag defin defin function map proposit rule rule extend obviou liter conjunct liter df fg fr strict rule rg fr strict rule rg fp liter rule deriv rule distinct clear transform normal satisfi condit notic strict rule alter unchang longer concern strict rule easi liter iff iff structur strict rule remain superior relat affect proof definit notic structur superior rule defeat ident structur rule deriv liter involv differ presenc rule remaind proof detail verif prove induct length proof proof proof vice languag theorem theori signatur effect construct normal theori program normal form simpler form proof condit section omit mention omit condit simul superior relat section show superior relat contribut express power logic repres inform natur defin transform tran elimin superior relat rule introduc posit liter denot express overrul superior rule definit theori defin rg strict rule rule defeat theori sh sh dog sh dont dog construct theori replac sh sh sh inferior rule break rule insert liter give rule mimic intermedi liter mean inferior applic intermedi liter provabl inferior applic rule aim accomplish ad rule similar construct elimin prioriti rule abstract credul argument framework result show restrict attent signatur disregard theorem theori signatur signatur base theorem case provabl normal transform theori simplifi shown definit rest paper note accord comment end previou number retain consist condit section sd sd minim set ingredi result discuss theori view finit set rule kind defeat section show imposs simul type modular show strict rule proposit strict rule theori strict theori fa pg signatur signatur fa strict rule pg strict rule contradict statement proposit proposit rule theori theori fa pg signatur signatur fa rule pg claim proposit consist strict rule defeat inspect definit proof support show pg contradict previou result trivial theorem difficult state simul defeat modular strict rule constitut main result paper theorem defeat theori theori fa pg signatur signatur fa defeat set behav pg pg pg behav pg pg pg behav pg proof pg length occur condit definit proof rule consequ regard proof differ rule miss contribut rule inspect definit proof show rule add line deriv doesnt contribut rule deriv proce case doesnt occur shown simpl induct length proof case occur defin deriv proof concaten construct easili proven induct length proof proof intuit miss rule problem deriv deriv establish proce case proof rule note pg imposs deriv concaten proof theori proof turn attent presenc deriv proof length line occur definit exist rule argument transform proof exist rule exist rule pg properti condit definit show pg shown imposs deriv contradict discuss discuss cyclic superior relat theori briefli explor effect possibl result theorem continu superior relat cyclic proof independ form superior relat theorem extend cyclic theori theori case proof theori conclud shown situat superior relat cyclic minor result section continu hold superior relat cyclic proof theorem reli theorem unclear theorem extend cyclic theori comparison default reason approach section summar result relationship logic default reason approach concentr essenti face proof remov rule doesnt occur contribut deriv deriv approach logic program base make explicit prioriti approach consid default logic full exposit result includ futur paper logic strictli sceptic reason approach contrast approach sceptic reason realiz intersect credul reason chain default logic sceptic reason obtain intersect extens fundament approach lead point paper default logic ambigu predic propag logic true prioriti logic knowledg languag theori consist logic prioriti relat mean prioriti relat rule includ rule inferior automat block includ argument prioriti logic gener framework support credul sceptic reason fair comparison make assumpt includ restrict restrict prioriti relat rule complementari head differ prioriti logic logic default logic mention prioriti logic extens propag ambigu logic program introduc recent simpl effici form default reason basi intellig agent approach share basic idea logic logic program implement sceptic base compet team prioriti relat differ logic program negat failur shown fact negat failur simul rule negat prioriti relat observ show logic program strictli special case logic introduc approach default reason negat failur simul prioriti relat paper introduc proof theori argument framework support credul sceptic reason approach care comparison reveal import argu basi individu logic argu basi team rule head logic make easier case rule head rule prioriti inform logic deriv shown proven provabl logic logic literatur featur logic provid natur express standard exampl motiv logic behaviour occur theori alter ad fact theori modul rule ad simplifi modular simplif essenti shown result modular simplif theori ffl fact loss express power ffl superior relat loss express power ffl strict rule rule ffl strict defeat elimin loss express power main consequ result loss simpler form logic deeper result semant logic relationship logic formal access acknowledg research support arc larg research grant refer antoni nonmonoton reason mit press mj maher result logic technic griffith mj maher sceptic logic program negat failur technic griffith logic stabl journal logic comput ef codd normal data base relat model data base courant comput scienc seri prentic hall ma prolog program depth prentic hall kaka logic program negat failur proc mit press bn grosof priorit conflict handl logic program proc int logic program mit ra kowalski toni abstract artifici intellig law journal kluwer academ publish introduct mathemat edit van nostrand reinhold reason proc hawaii intern confer system ieee press logic dm cj hogger ja robinson handbook logic artifici intellig logic program vol oxford press decid quantifi logic methodolog philosophi scienc elsevi reiter logic default reason artifici intellig ja robinson machin orient logic base resolut principl journal acm jf horti rh thomason clash current state nonmonoton multipl inherit system proc morgan kaufmann yuan nonmonoton reason monoton infer prioriti constraint nonmonoton extens logic przymusinski lnai springer yuan logic program default negat revisit proc ieee intern confer intellig process ieee
Agents/1045 1 framework massiv distribut comput david evan david depart comput scienc submit novemb project summari comput environ futur involv larg number small commun interact physic surround accomplish task develop program tool method produc scalabl program comput environ comput environ requir fundament comput paradigm differ substanc scale previou work concurr program distribut system unlik current processor futur system direct link physic environ distribut sensor actuat thousand tini comput element place smaller number larger comput devic enabl comput medium finer granular actuat comput capac seamlessli physic target spot dust comput element data comput equip drop myriad small augment sensor disast area search determin structur damag hardwar enabl develop softwar face challeng challeng dynam system massiv interact physic environ reason emerg aggreg properti individu compon behavior research develop method tool massiv comput succinctli refer swarm state swarm comput todai similar sequenti comput earli develop produc swarm program design program action individu converg accept program extens simul skeptic programm believ mechan process possibl produc code compar qualiti produc highli skill machin coder cost machin time high outweigh save programm effort state swarm program todai devic resourc limit applic construct produc accept result problem chang cost devic capabl human time requir develop swarm program domin cost develop languag tool enabl principl effici develop swarm program kei contribut program languag develop tool enabl programm construct reason program environ level abstract languag programm express program level aggreg behavior behavior individu devic develop control resourc consumpt level detail requir applic hand code program collect devic oper physic provid programm abil write program automat adapt requir experi determin swarm program behav seek develop principl tool predict behavior framework massiv distribut comput advanc memori radio technolog made build small cheap devic capabl alter commun nearbi devic wireless store small amount perform limit amount comput deploi thousand million devic perform wide rang applic monitor poorli access danger environ disast hostil territori activ nuclear field hostil danger terrain make imposs build fix infrastructur power host swarm comput advoc myriad devic arbitrarili environ left larg capabl swarm drawn network scale power individu compon result high fault toler failur devic margin effect applic develop program languag swarm devic programm express applic term desir aggreg behavior explicitli program individu devic produc program automat gener devic program implement aggreg behavior program draw librari primit combin produc complex applic scale properti addit analyt test approach simul physic swarm wireless devic sensor actuat multidisciplinari team combin feel combin skill experi tackl problem network control theoret approach system david special multiag system david evan research program softwar engin secur scientif object design program languag comput swarm pose challeng stem interdepend peculiar physic ratio scale swarm comput main massiv number devic deriv system properti emerg number devic properti necessarili hold smaller number devic import evalu criterion languag implement minimum number devic exist program properti hold call critic mass critic mass limit scalabl limit tradit distribut comput typic design algorithm scale number compon scalabl distribut algorithm defin maximum number compon perform accept primit swarm program languag distribut implement requir minimum critic mass design swarm applic concern provid desir behavior number devic low probabl theori rich vehicl formal analysi scalabl algorithm properti stochast process typic approach determinist valu number trial swarm applic elicit behavior emerg stabil scale implement filter slightli propag higher prioriti traffic result strict predict priorit scheme number hop larg note exist algorithm complex critic mass priorit enforc strict prioriti hop basi strict algorithm minimum critic mass difficult implement due distribut content share medium multipl sourc carri traffic prioriti implement algorithm simpli higher probabl send higher prioriti traffic share medium easier requir larger path larger critic strict priorit emerg solut gener tend reli simplest behavior analyt determin provid desir global properti critic mass observ implement flavor algorithm differ system ag point number activ node critic mass simplest intens algorithm invok maintain properti resourc constraint physic swarm comput devic typic equip sensor actuat make capabl interact directli physic environ capabl set swarm tradit network infrastructur main problem control flow inform algorithm develop control exchang inform swarm comput network implement distribut action environ physic permit program paradigm current program vehicl manipul abstract comput hardwar data structur oper perform abstract manipul content memori locat regist swarm comput manipul medium extend comput hardwar encompass physic environ object physic environ attribut read swarm program depend initi event manipul state object elimin object environ battl chang object attribut nearbi actuat program system rich program physic interact environ program manipul logic data structur todai focu physic mechan affect develop manipul observ primit semant suitabl physic develop algorithm exploit share state physic environ ratio typic environ small number comput system administr individu act system administr singl machin larger singl system administr hundr machin swarm thousand million comput devic administr expect peopl repair manipul individu devic swarm comput applic oper larg presenc devic failur due mode swarm devic attent automat group failur swarm applic expect human administr repair malfunct swarm program reli identifi individu devic impli algorithm support stateless oper store state fashion summari primari scientif object work develop techniqu tool reason scalabl massiv distribut program develop techniqu analyz swarm program construct combin primit defin interact group defin class primit scale properti method languag describ function properti background advanc hardwar reduc cost comput commun point reason imagin deploi applic thousand million independ comput commun devic sensor actuat summar recent trend hardwar devic survei relat work program multiag system relev work devic steadi improv microprocessor lead devic cost dollar capabl desktop comput recent advanc led dramat reduct size power consumpt requir electron wireless system hardwar model sensor node primari rockwel win node berkelei smart dust project berkelei build cubic autonom devic abil perform comput commun devic run mhz microcontrol kb program memori byte data memori version devic develop radio laser commun sensor magnet field current version devic week continu oper construct smaller cheaper devic molecul expect prototyp molecular electron devic built simpl comput decad ag comput commun devic horizon build devic question program thing program paradigm work amorph comput produc result program paradigm massiv distribut system amorph comput similar applic domain devic gener power consid techniqu program amorph comput medium grow point languag metaphor grow point secret pheromon act messag nearbi lai materi alter state particl amorph comput medium demonstr model suffici power program complex structur interconnect topolog cmo circuit emphasi techniqu describ reason behavior swarm program tupl space model concurr program obviat devic individu address tupl space global share associ memori method read inform valu tupl space synchron valu provid coordin tupl space approach desir number challeng overcom swarm comput scale mobil present major assum node entir tupl space partit tupl space neighborhood offer partial requir substanti program model approach explor lime tupl space system design mobil environ tupl space transient share distribut mobil host network proxim swarm comput practic maintain tradit tupl space transient space tupl broadcast neighbor node unclear weaker semant support program worthwhil explor weaker variat tupl space semant swarm program network principl swarm comput necessarili ti wireless interest swarm comput environ wireless chemic light wireless commun technolog radio effort develop ieee wireless network bluetooth standard small area network improv wireless network protocol heidemann al studi locat estim gp beacon amorph comput group mit studi problem organ global coordin system local inform geograph forward dynam address fail region network estrin geograph adapt fidel algorithm class node form rout perspect intent system resourc discoveri servic locat system design support dynam network system requir devic period specifi central manag commun group swarm implement requir elimin altern protocol suffic arbitrari structur network limit comput abil node make develop network primit swarm comput challeng research area rout messag specif work sensor network explor protocol transmit inform devic base applic constraint typic scenario collect sensor drop battlefield monitor movement commun relev find back command center techniqu commun paradigm direct distribut messag sensor devic produc data form pair task dissemin sensor network set gradient draw data match request attribut request origin devic direct send data back direct request rout data specif origin devic gradient enabl commun complex rout algorithm techniqu advantag algorithm aggreg sensor data subramanian katz gener techniqu develop architectur build system larg number sensor automat coordin achiev task swarm comput techniqu organ devic produc network suitabl program goal research produc method devic base desir properti requir explicit program multiag system biolog mechan insect swarm provid sourc inspir swarm comput behavior fish demonstr varieti group behavior studi extens past centuri distribut behavior ant produc select approach rout inspir behavior ant coloni find rout food sourc insight gain circl search home forag food grow hive anim demonstr group minim loss hostil environ inspir biolog attempt duplic produc swarm program attempt fly mimick attempt copi biologi directli underli principl behavior understood produc fly behavior machin artifici intellig research build simul robot system util group behavior research demonstr hierarch combin simpl behavior primit result coordin search soccer plai research project explor influenc commun uncertainti task perform comput graphic research made contribut simul group distribut control algorithm reynold accomplish earli progress simul group behavior develop simul flock bird bird inform nearbi neighbor simpl algorithm fail work global knowledg group anim system develop comput graphic research thalmann demonstr simpl behavior combin creat complex behavior research investig wai simpl behavior blend behavior truncat compet research multiag group simul agent possess dynam investig wai physic limit affect group behavior system demonstr simul group simpl behavior adapt dynam environ research plan research plan creat program system shown figur main design program languag describ applic combin primit behavior build librari primit behavior defin group design specif languag devic environ model languag suffici detail autom reason devic environ abstract flexibl reason scale million interact devic implement develop compil mechan execut program collect small devic physic environ program process deploi program comput swarm involv combin primit behavior implement applic set devic oper environ main tool task abstract hierarchi abstract remov detail physic devic environ concern explor abstract provid conveni mechan programm express interact group size hierarchi abstract control propag inherit primit behavior systemat analyz subsect describ compon architectur section discuss platform georg painter paint techniqu paint construct paint small dot stronger hue creat carefulli place dot pure color report appli hope achiev similar effect swarm program programm construct emerg program principl method program languag swarm comput applic descript environ model devic model program primit librari build swarm tool creat individu devic program desir behavior design program languag describ desir aggreg behavior collect devic artist paint point repres shape program determin devic program accomplish function properti properti desir programm aggreg behavior specif swarm program desir aggreg function properti applic aggreg function properti express combin primit primit custom order higher order paramet import behavior specif program individu devic directli restrict enabl program produc scalabl applic swarm program function descript search rescu applic express scan broadcast listen home primit move swarm state devic distanc paramet depend larg region devic combin scan function identifi target locat combin scan scan satisfi broadcast primit transmit swarm attract devic locat listen primit direct devic listen devic switch home primit direct devic signal locat listen home preempt behavior compet resourc actuat move properti note function descript provid guidanc primit behavior unlik tradit program languag typic perform primit oper determin meant reflect actual syntax semant give flavor languag idea vision program combin primit defin aggreg behavior figur detail syntax semant challeng part research rough syntax semant flaw address final languag definit devic program figur swarm program system devic unit program devic unit operand wai implement primit swarm behavior singl set implement exhibit nonfunct properti scale type devic program combin implement satisfi requir applic properti devic environ deploi properti includ resourc secur surviv program languag provid construct express properti vari level detail home applic clean floor resourc consumpt requir import devic batteri recharg frequent search rescu applic hostil environ concern secur surviv applic function implement differ concern detail separ function requir applic defin requir level abstract depend applic requir aggreg behavior control kei mechan realiz properti li abil gener primit implement resourc perform consist properti requir guid object function express global perform requir implement devic program construct achiev global perform requir achiev break problem independ relat local perform devic global perform metric control global perform adher specif provid analyt foundat answer develop control branch distribut comput describ mathemat properti control massiv distribut softwar system compon achiev desir perform assur theori relat inform commun stimuli intern softwar state repres languag primit goal progress theori provid proxim actual primit behavior behavior translat specif transient perform control loop load investig altern swarm perform control theori main distinct describ swarm dynam independ accur load resourc requir model lack prior estim load resourc affect integr model perform control investig appli control theori successfulli case studi involv distribut comput applic includ perform web server internet server delai control proxi cach rel hit ratio control microprocessor thermal manag success differenti equat model softwar system unlik queu model schedul differenti equat model describ system dynam independ input load describ liquid flow model system control deadlin miss ratio show commerci server model differenti equat handl overload describ subsystem deriv system model automat extern extend model massiv distribut system preliminari result show pid control effect enforc resourc alloc larg softwar system system paramet equat constant element adapt robust control theori appli situat system paramet unknown chang deadlin miss realtim system nonlinearli resourc util investig adapt feedback control robust control techniqu account system paramet uncertainti variat control system multipl multivari control scheme develop implement devic algorithm achiev aggreg behavior choic manipul physic environ program languag typic includ abstract address space programm creat manipul object object provid abstract manipul bit repres machin hardwar storag system assum distribut machin includ tradit hardwar memori local singl myriad sensor actuat constitut integr part architectur programm abstract program construct manipul physic environ programm todai abstract program construct manipul acquir valu machin regist storag abstract deal state physic remain discov unlik tradit comput state repres physic environ subject physic process evapor time time variabl prime import system interact directli physic environ team includ adapt comput phd topic investig goal develop program primit predict time perform techniqu predict control time behavior investig length system commun interest li extend techniqu massiv distribut system interest develop theori relat time primit behavior network bound impli satisfact system behav unpredict microscop scale tend predict aggreg properti develop algorithm deriv aggreg perform model util provid time exampl includ util bound meet individu primit deadlin long aggreg resourc util remain limit initi deriv bound task unknown arriv time result implement program primit execut bound time build primit librari implement languag primit requir design distribut algorithm achiev aggreg behavior primit collect algorithm constitut primit librari compil code gener import note primit librari system librari tradit fix function primit encompass larg class implement adapt scale environ behavior requir unlik swarm program level aggreg implement librari primit defin behavior individu devic program tradit program method java program api abstract oper devic sensor challeng analyz primit describ behavior formal scale number devic adapt devic environ earlier factor underli obviou differ natur algorithm develop implement swarm primit previou research tradit distribut comput provid primit level abstract lowest primit deal specif primit highest behavior primit swarm program select implement primit level commun primit commun support swarm comput pose challeng distinct properti swarm system physic administr ratio challeng address project address thousand devic exist ident singl devic irrelev address techniqu develop reli identifi scheme reli set logic coordin creat gradient geograph dimens network rout current rout algorithm reli devic identifi map rout messag destin network individu devic rout reli mean physic clue environ gradient creat address scheme call clue physic context geograph rout algorithm forward messag specif locat specif devic geograph attribut physic context messag destin calculu develop develop rout algorithm address base abstract coordin system forward data destin transport layer servic current network reli commun abstract socket devic establish data connect devic inform exchang model devic perman connect individu devic connect endpoint pool devic share context devic centimet locat pool devic dynam chang preserv abstract congest control perspect global network elementari kei problem ensur network overload perform basic function convei inform function achiev algorithm promin algorithm tcp congest control tcp work environ natur lack ip similar layer export node address form congest control implement organ primit organ primit provid function group hierarchi format develop scalabl behavior primit scale organ devic adapt hierarchi organ primit design resili succe implement fraction devic primit implement wai properti organ primit team manag individu devic import comput import creat abstract entiti address perform comput function dictat programm entiti implement lower level dynam evolv team elementari node team manag import challeng environ data manag storag import function network collect process data data remain network explicitli critic event identifi propag immedi user data manag storag import network function problem tightli relat web sensor network data updat origin node network node power act central data cach storag facil fulli distribut solut prioriti control network emploi perform distribut task data commun team presenc multipl task limit resourc system consist priorit oper protocol develop determin prioriti activ distribut manner maxim system util mechan prioriti enforc implement carri prioriti order comput algorithm behavior primit behavior primit program system servic devic code devic provid devic provid standard interfac creat primit underli servic librari provid set behavior primit provid suffici function behavior larg class complex swarm applic written theoret question address small set primit larg class applic creat librari provid implement primit provid nonfunct properti area explor kind primit implement combin primit implement combin mechan provid access larg design space properti determin set behavior primit part research exampl behavior primit includ scan home introduc section expect final librari twenti behavior primit defin class swarm comput program creat librari primit implement end state satisfi constraint form devic distanc naïv implement program devic detect number devic transmit messag power cover distanc region surround devic move randomli short distanc naïv implement time power simplic symmetri make easier reason altern implement offer tradeoff time power cost comput movement explor conduct preliminari experi implement devic commun hierarch locat area low densiti move low densiti area approach achiev time naïv commun cost conduct preliminari experi fraction swarm run naïv implement rest run densiti driven implement illustr point design space trade quick result commun cost achiev implement environ devic gener devic implement program awar applic properti devic swarm environ execut capabl rel cost action comput environ determin combin primit implement devic failur likelihood hostil exogen event import degrad gracefulli type failur affect implement choic program system design separ factor behavior program provid specif environ devic program select implement kei challeng devic environ specif determin level abstract specif complex human program tool quickli unmanag suffici inform select combin primit implement approach base variabl level detail applic describ commun cost properti environ great suffici radiu distanc commun success programm level detail base requir reli program system make assumpt case detail provid plan explor method describ hostil intrud destroi cluster devic jam commun work work describ simul vulner offer good start point explor deploi swarm program program model tradit ship execut sequenc unlik tradit system adequ send ident binari anticip program execut wide rang devic varieti environ combin primit select implement program depend heavili capabl number devic physic properti environ dai individu swarm devic home initi discoveri program learn surround environ configur number kind devic owner program download provid program program devic instal program devic launch carri applic happen owner select applic deploi short term goal modest assum devic environ specif provid focu problem select combin primit implement applic behavior nonfunct devic environ specif crucial aspect applic develop debug massiv distribut program difficult nondetermin lack reproduc environ exacerb problem develop tool programm monitor adjust applic varieti level examin state oper singl devic debug higher level attempt debug swarm program examin state individu devic debug program examin state individu electron machin core develop tool programm monitor evalu properti swarm preliminari work area produc tool simul log evalu function produc snapshot world state programm evalu function time simpl tool point adapt power techniqu debug evalu swarm program platform conduct experi physic simul environ physic experi valid approach reveal import issu hidden simul limit number devic physic experi make imposs test scale suffici larg rang focu simul physic experi test realism simul physic experi lab limit number berkelei run oper system call sensor includ mhz program memori byte data memori byte data program memori futur version expect januari time memori resourc repres point design space swarm comput devic simul experi conduct experi simul augment analysi code gener tool develop deal behavior physic devic model power consumpt commun behavior collect million simul adequ aspect project team experi simul span design space santa fe swarm simul santa fe swarm simul easi interfac model devic behavior decent tool visual swarm program scale thousand slow larg scale experi preliminari swarm simul implement swarm primit program interfac simpl good undergradu student quickli develop begin experi primit behavior simul surviv research develop uva scale support ten thousand node model inject control catastroph failur larg network experi involv hostil environ robocup soccer server soccer server physic simul robot soccer field includ model physic commun vision soccer server experi behavior swarm primit hostil realist environ santa fe swarm simul commerci simul system softwar system permit develop accur physic simul devic environ exist anticip softwar accur model scatter devic uneven terrain simul movement mobil devic wide network simul todai ip network extens support wireless simul simul larg set devic physic environ simul sensor network access machin cluster develop uva successfulli larg scale simul experi run massiv scale simul experi develop impact summari goal develop program paradigm massiv distribut applic decad unreason expect meet challeng goal expect make concret progress front expect design program languag swarm semant develop librari organ behavior primit function multipl implement properti develop theori combin implement primit identifi defin class implement combin predict properti gain understand scale properti swarm program develop tool method manag massiv scalabl applic request year fund anticip achiev mileston end year design program languag languag nonfunct requir devic environ properti produc result simul combin primit environ develop preliminari theoret foundat tool analyz aggreg behavior larg number devic analyz critic mass number primit behavior valid result simul experi invent techniqu cast assur problem feedback perform control problem year develop prototyp swarm program nonfunct requir primit devic environ model produc individu devic program produc formal descript semant program specif languag investig composit properti class implement primit behavior develop theori composit address scale nonfunct properti expand primit librari includ adapt algorithm resourc consumpt perform develop physic test bed static sensor radio transceiv implement distribut protocol aggreg behavior control base theoret result year simul physic experi implement commun stack small devic includ transport layer function address concern section year produc complet swarm program capabl gener devic program larg class applic rang number capabl devic environ produc librari swarm primit suffici produc swarm program wide rang nonfunct properti produc analyt result composit primit implement set implement properti lead predict composit properti extend physic testb includ mobil devic alter environ conduct experi physic testb applic store manipul state environ dissemin result web materi softwar success track record distribut support softwar worth effort requir make softwar research valid work foster research commun result prior nsf support fund nsf career award architectur activ web content nsf grant framework absolut delai adapt data nsf grant approach perform grant develop distribut algorithm cach content manag web environ develop perform feedback control algorithm softwar system grant result multipl public softwar prototyp provid good analyt foundat softwar control leverag deepli distribut system context perform assur david recent nsf cise research resourc award fund hardwar requir build displai system hardwar support research simul level detail perceptu accept simplif techniqu comput anim david evan fund nsf career march work complement research educ work career work fund nsf contribut public paper submiss grant fund graduat student secur properti resist vulner class attack undergradu support juli reu supplement ten undergradu student work independ studi undergradu thesi pi research directli connect project david evan distribut support extens tool lightweight static analysi exploit program annot detect secur memori manag common error program thousand activ user articl book direct work programm refer geoffrei placement web server replica proc ieee ramesh govindan deborah estrin direct scalabl robust commun paradigm sensor network sixth annual intern confer mobil comput network august massachusett john fabio ramesh deborah build effici wireless sensor network symposium oper system principl lake acm octob ya john deborah estrin energi conserv ad hoc rout seventh annual intern confer mobil comput network juli heidemann estrin low cost outdoor local small devic ieee person special issu smart space vol pp octob organ global coordin system local inform amorph comput mit ai memo august ko mobil ad hoc network fourth annual intern confer mobil comput network octob perkin demand distanc vector rout ieee workshop mobil comput system applic februari charl perkin highli dynam vector rout mobil comput sigcomm symposium commun architectur pp sept db constant factor approxim algorithm problem st annual acm symposium theori comput improv combinatori algorithm facil locat problem proc annual ieee confer foundat comput heidemann estrin adapt beacon placement intern confer distribut comput system april john fabio ramesh deborah build effici wireless sensor network symposium oper system principl lake acm octob tomasz imielinski goel dataspac queri monitor deepli network collect physic space ieee person commun special issu network physic octob philipp praveen seshadri queri physic world ieee person vol octob page special issu smart space environ system architectur direct network sensor asplo develop platform wireless sensor network proc ground sensor technolog vol np optim problem distribut sensor network proc ground sensor technolog applic vol simul distribut oper system andrew tanenbaum prentic hall van tanenbaum web technic report vrije februari case geograph push cach annual workshop hot oper multicast oper distanc vector rout proc intl confer mobil comput network aug survei multicast technolog vincent serg septemb kevin techniqu thermal rc model accur local dynam thermal intern symposium high perform comput feb scalabl base inform distribut servic industri annual confer ieee industri electron decemb john tian mike control schedul distribut ieee system decemb analysi util bound highli scalabl ieee technolog applic june jack feedback control approach rel delai web ieee technolog applic june kang web server accept ieee transact parallel distribut system ying cach intern confer distribut comput april perform control internet invit ieee confer decemb john son michael specif metric adapt ieee system decemb profil subsystem ieee technolog applic washington june kang provis web multimedia ieee system decemb content deliveri web server intern workshop qualiti june content adapt improv server overload intern world wide web kang architectur ieee technolog applic june adapt phd august john robert kevin system research distribut surviv uva technic report august william oliv analyz group develop tool evalu swarm program uva senior thesi expect complet swarm develop group ryan investig fundament swarm comput uva senior thesi march itsuki noda soccer simul robocup legion group applic page keen jon adam david evan david behavior combin swarm virginia team descript robocup intern symposium lectur note artifici intellig david john jim horn yang meng tan tool specif check code sigsoft symposium foundat softwar engin decemb david evan static detect dynam memori error sigplan confer program languag design implement pa david evan david improv secur extens lightweight static analysi ieee david santo code linux static check program linux march david hanson interfac techniqu creat reusabl softwar addison weslei comput richard lawrenc kirbi sam michael cryptographi joel david evan structur except semant concurr loop fourth workshop scientif comput octob antonio david evan alexand wolf secur issu requir system hawaii intern confer system januari david david evan static detect buffer overflow vulner usenix secur august david molecular comput technolog review katz centuri mobil network smart dust intern confer mobil comput network august ieee std short descript standard bluetooth forum david gelernt gener commun linda acm transact program languag system volum number januari organ global coordin system local inform amorph mit ai memo jl jm shortcut ant jl goss trail select shortest path ant journal theoret pattern effect forag alloc food sourc bee coloni journal theoret biologi thoma wisdom hive harvard handbook behavior volum social behavior commun shaw method measur structur fish anim volum rc arkin dimens commun social organ robot system intern confer simul adapt anim animat page mj matar territori task ieee transact robot oct page stone veloso reinforc learn technic carnegi mellon april cw reynold distribut behavior model siggraph page acm juli bm blumberg ta direct autonom creatur realtim virtual environ siggraph page acm august tu terzopoulo artifici behavior siggraph page acm juli sr thalmann model human crowd behavior comput anim simul eurograph page suzuki distribut motion coordin multipl mobil ieee intern confer robot group behavior system dynam autonom dynam simul charact virtual environ ieee comput graphic group behavior system dynam intern confer intellig robot vol pp obrien anim human athlet siggraph comput pp rosenth sherman symbol eric bonabeau gui swarm smart scientif american march al hunt bee swarm insect volum number januari gilbert million bunch bug find strength number harvard press paul domain concept facil network work rfc novemb william elliot jeremi design implement intent system acm symposium oper system principl decemb subramanian randi architectur build configur system workshop mobil ad hoc network comput august ramesh govindan deborah estrin direct scalabl robust commun paradigm sensor network acm mobicom eric susann ken arnold javaspac pattern practic addison stephen peter wave ibm system august gian pietro ami murphi roman linda meet mobil intern confer softwar engin daniel approach gener interconnect topolog amorph comput mit phd thesi decemb don daniel chri georg thoma erik gerald jai ron weiss amorph comput commun volum number
Agents/1046 1 behavior model case crowd tip barri michael kevin rachel silverman center advanc system approach pennsylvania pa softwar human behavior util abstract paper describ effort integr human behavior model rang motiv literatur framework goal creat common mathemat framework simul environ research explor altern behavior model add realism softwar agent human reaction constrain emot cultur influenc base approach evolut equilibria markov chain repres state world agent act world util deriv deep model cognit intent achiev includ assess emot rel concern subject stress relat constraint present progress date mathemat environ edit element cognit util concern markov chain summar prototyp train game crowd manag futur research elabor includ valid issu gap behavior literatur agent develop struggl introduct common concern agent develop realism behavior cognit peopl anthropomorph technolog item slot atm strategi begin emerg beat competit includ greater human mode interact synthesi car navig emot persona facial accur oper simul grow realiz greater cognit subtleti behavior sensit agent lead greater abil explor altern strategi tactic plai higher level skill attain human behavior agent chang alter arrai behavior cognit variabl agent behavior realist chang function cultur mission forc level fatigu stress time group effect loss close relat topic emul human behavior agent basic charact react person circumst grow graphic anim agent literatur believ topic work great person mask lack deeper reason abil paper interest media broadli appeal type behavior react importantli human behavior literatur fragment difficult agent develop find integr publish model deeper behavior research involv develop integr framework emul human behavior order make publish behavior result construct agent model attempt basic research human model work agent set framework present intend experi integr exploit publish behavior improv realism agent behavior definit intellig agent defin softwar program effect freedom make lower level plan carri higher level goal agent adapt accomplish intent intellig agent concept attribut make agent interest architectur model behavior artifici agent paper particip game agent observ interact limit subset agent commun form belief action strategi belief predict nearbi agent plai current guid action maxim util iter cn cn class type agent game von game theori dictat agent attempt maxim util iter nash equilibrium solut payoff matrix uncov except game cyclic agent wind game multipl ne clear priori agent settl maxim iter step ne strict optima pareto effici fact dilemma axiom ration dictat player settl ne li reduc util point game articl player assign util perceiv probabl valu dynam game unfold stress emot situat stress constrain agent time drive util maximum step emot hand redefin ne occur payoff tabl redefin entir game emot agent recogn shift plai higher level system terrorist role emot concern ontolog agent behavior link agent state facial bodi vocal humor anim recent theori identifi emot vital process manag compet motiv integr emot model agent yield realist behavior provid deep model util agent delic threat elimin versu believ peopl theori suggest ad emot agent focu balanc set step altern action larger case cortex damag patient spend entir dai highli logic cost surviv import implement idea theori attempt movement seek improv believ behavior fiction set emot model occ model wide implement emot model explain mechan object world activ emot oz affect reason emot larg model reactiv capabl charact recogn situat reflect broad believ person version oz includ behavior link emot behavior choic articul publish account concret extend occ model event planner deeper delib reason mode agent constru plan plan element happen current extend agent constru plan element constru impact object behavior standard area unconsci time physiolog pressur mean attempt fairli full implement occ model reaction type object approach generaliz solut issu occ model occ model emot object world emot action agent result connect emot world theori suggest link concern ontolog readili open literatur ten command moral militari doctrin action readili util implement agent type framework present tie concern ontolog directli emot process situat recognit util action deriv emot ontolog react affect emot cognit architectur framework research cognit architectur agent algorithm reason framework contribut literatur extend framework includ arbitrarili separ subsystem memori form capabl agent shown figur larg number similar framework comparison model found sherman model depict show agent receiv stimuli formul act stimuli limit subsequ system flow process pure reactiv system start interest delib ponder run seek stimuli support altern test figur top level integr architectur research altern human behavior model gener agent stimuli physiolog system moder signal merg perform impact emot system world valu situat emot gener agent system procedur express action cognit system probabl mood criteria work memori histori recent past observ action fear task order agent model interest modifi markov process agent seek hierarch markov chain set nest game depict partial case studi order agent awar chain place work memori set goal task agent work game unfold work memori store process intent bdi agent belief process game theoret observ world form rememb simpl statist model action situat interest desir bdi defin affect state fear gener emot system intent plan action set order agent seek carri stress physiolog subsystem physiolog subsystem figur initi react set stimuli perceiv experienc environ subsystem includ sensori group number physic process thought reservoir deplet replenish capac present model physiolog reservoir light physic detail larg number moder abil perform case send pain occur threshold import criterion modul support studi common question perform easi addit delet reservoir interest studi train world pain virtual stress proxim land individu differ react model reservoir behavior linearli present vital criterion modul support studi altern mechan combin low level perform moder function singl stress level stress effect framework show comput integr level subsequ modul capabl reflect function effect emot judgment stress act figur classic perform moder function effect repli optim repli error time avail risk chang chang adher vigil panic recognit prime panic avoid panic low complet low low adequ adequ low high model integr stress result prime determin event stress track posit time pressur normal ratio requir time task effect fatigu integr normal metric base current level physiolog reservoir quantit deriv filter constru fact differ nervou type section describ emot filter quantit factor modifi summar linear addit thing quantit deriv integr metric call interpret mean translat mean agent cope style approach adopt accomplish translat deriv provid wide site taxonomi strategi cope time risk interpret taxonomi step invert figur defin taxonomi includ balanc sheet time risk drive maker cope strategi depict item figur framework elabor label cutoff point integr variabl constrain make stress level dictat abil collect process inform action altern adher current select chang mission plan task order select whichev repli pick highli experienc br turn recognit prime decisionmak klein avoid occur level ignor threaten prone current spot cope pattern regard jani adapt routin minor lead poor vital choic made pattern adapt gener reduc dm chanc loss author danger immin gener lead author refin idea klein show expert work effect mode immedi recogn altern vigil scan altern jani mann provid threshold valu maker trigger chang cope insight integr determin stress time pressur risk present logic rule combin factor rule account fact high factor push agent panic panic factor high high factor high moder panic result end factor low result adher rule list similar exist threshold cutoff present empir verif threshold work simul attempt panic high high high medium high medium high adher low low low result physiolog stress bound paramet guid cognit subsystem dictat cope style select paramet style constraint provid guidanc constru turn emot subsystem emot deep model util emot subsystem reciev stimuli sensor adjust moder physiolog system includ long term associ connectionist memori concern ontolog activ situat stimuli intern recal stimuli stimuli impact concern ontolog act altern emot intens level emot activ turn provid marker serv situat recognit recogn problem potenti act order support research altern emot theori subsystem includ easili alter set equat paramet variabl number emot base concern modul serv concern ontolog processor editor simpli author altern concern captur behavior altern peopl organ differ assess artifact world requir emot modul deriv element util payoff cognit system access altern action section examin combin multipl emot util estim state examin emot confront reaction state number ξ emot intens correl import valu concern set concern succe fail state question express ξ intens due kth state world set agent relev set consist set consist union weight import valu agent succe fail ith concern set list path ith ontolog agent trigger condit state function captur strength posit neg relationship agent object effect spare state function captur tempor factor state discount merg emot futur express captur major dimens concern emot tempor aspect sake assum linear addit multipl emot set valu state precipit emot model psycholog literatur provid greater detail class model cognit theori includ model mention earlier input set thing agent concern effect determin emot result fit structur equat strength bring bear present decid pursu occ model occ pair opposit valenc emot pair pair mention earlier futur event experi emot pair time intens cancel util perspect occ model assum make agent type concern tree goal standard peopl prefer object figur terrorist agent concern tree standard agent act prefer object artifact world agent concern tree richli fill suffic sake stop rule fill concern tree agent limit behavior scenario question figur concern tree bottom leaf node test element nearbi current concern tree hold learn valu import weight link concern tree label sum child weight sum sake conveni children strictli conjunct disjunct figur ontolog show part standard prefer sampl terrorist standard agent prefer artifact object research deriv structur weight tree manual part process build agent principl deriv tree machin learn knowledg discoveri interact event dataset terrorist group tree equat evalu function wi state world leaf node fail lead wi multipli branch tree leaf node wi concern tree comput express ci root parent ci ci ci child concern node parent node equat tree figur result weight strategi result dead agent contempl death prefer succe fail dead emot emot gener object prefer ontolog effect standard tree standard directli succe fail feel pride attempt mission current fulfil commit attempt correct perceiv attempt current attempt current ci attempt fulfil attempt act root current commit current act fulfil commit cognit unit feel singleton set dead pride mission involv return home thwart fail surviv feel shame act act dead shame act current pride slightli outweigh shame subsystem function ω level current goal tree topic omit due space illustr goal tree omit discuss dimens reason social exampl constru relationship scenario agent explicit model partial knowledg emot guid assign action manag likelihood tempor factor occ model number handl address number open research game theori cognit cognit subsystem serv model point factor integr action transit state return markov process node markov chain tick agent process state transit action state transit current intent provid task list plan intent prior expect agent state base recent histori desir action base pair emot scale ξ cope level discuss inform agent select defin process stimuli produc maxim discount reward util current iter game cognit subsystem govern repli subject defin altern valu ω perceiv probabl em umn equat δ memori coeffici τ number period back action relev em action relev δ expect coeffici action set integr stress section assum util state emot activ previou section occ model gener pair emot intens current state iter plai util thought simpl summat posit neg emot action lead state pair opposit valenc emot occ normal sum util vari ξ argu idea aggreg individu summat consist marker theori learn singl impress feel state action bring avoid state util deriv dynam iter emot util action strategi rel concern ontolog minu cost carri strategi introduc modifi emot function discount heavili weight game achiev closer agent end stage game agent conserv constru surviv import earli make dare maneuv end point term perceiv probabl equat present simpli hand eventu hope introduc factor agent discount vulner probabl lower estim probabl lose battl nervou soldier tend overestim probabl failur prospect heavi bring earlier discuss time pressur effect make present action carri ideal time complet estim simul gener time earlier mention equat tp deriv omit idea tp directli impact probabl time complet task task outcom success turn discuss process style ω larg literatur style function discuss rich set possibl explor framework begin indic compon cope level impact choic style rule select process style matter extend current focu goal show illustr set rule work idea provid mechan evalu altern rule exist literatur refer mention postul balanc emot valu vigil moder stress level event stress approach close drop cope state invok emot capabl situat recognit recognit prime decisionmak event stress approach upper physiolog concern panic set place run wildli assum fatigu put state world slow reduc import valu higher level goal physiolog remot object guid adjust set equat present paper emot stress compon event initi task plan call emot model situat ignor probabl appli criterion optim high event panic fatigu reduc posit posit emot ignor probabl appli criterion time pressur primari impact reduc probabl success action tp altern cope strategi classic expect util formul event stress ignor emot reduc probabl di thing base choic action minimum criterion panic vigil panic equat ignor situat randomli action base choic minimum feel safe current remain root drop artifact run blindli threat hope mood guid choic criterion subsystem complet discuss earlier figur turn modul librari store procedur agent interact displai motor express output base stimuli motor subsystem adjust relev store procedur perform action intend reach state attempt carri action motor system seek carri repli action perform limit physiolog system express emot domin support procedur includ function portrai altern behavior fatigu lead slower rate movement motor system serv stimuli system long period emot case emerg crowd behavior attempt prototyp implement cognit agent architectur demonstr appli model impact altern persona motiv crowd behavior final word model crowd motiv attempt illustr rang flexibl architectur support diverg theori crowd turn spread commun opinion polar ideal enabl model altern theori observ impact simul commun scenario construct figur involv consist poor popul live half land popul half group poor area larger group seek establish author conduct number mission shift popular opinion support favor fear popul enemi point shown figur successfulli bomb target area felt compel construct close access part town side figur turn job area control organ protest event checkpoint group intend send protest figur show small group outset march line format front secur guard checkpoint scenario prospect research integr low level contribut human behavior number crowd fatigu physiolog individu level secur behavior emerg social interact potenti media impact popul larg simpl scenario requir model crowd popul opinion support view intern left side figur set agent window tab user select type agent civilian type civilian emploi agent fit descript highlight permit select specif agent type agent id agent highlight red box select tab window left side figur strategi inspect agent accessor sensori capabl includ agent feel memori physiolog includ factor present damag stress turn summar accessor physiolog integr level view current fatigu event time pressur perform integr stress emot tab reveal pair occ emot agent feel level sort prefer standard displai feel type agent exist strategi tab displai action agent util assign action choic ongo task action stack agent attempt process detect agent attempt carri plan set task attend march return home interrupt plan opportunist task abandon intend task escap area return tab piec intent moment basic mode usag intend particip analyst present particip mode develop realtim interfac support particip realtim human player direct polici behavior act leader secur forc player interact world effort manag potenti bomb crowd protest activ role human particip analyst mode editor doctrin polici scenario unfold differ polici doctrin place secur forc view panel left figur permit observ altern set particip work interact figur screen shot protest scene land show observ hold sole secur agent face crowd panel left show detail emot layer male examin portion scenario detail analyst mode work agent determin mo carri action agent group protest portion markov chain deal attend protest altern action encount precipit violent reaction figur reveal sourc deriv repres concern ontolog motiv act protest scene concern ontolog shown figur includ strong weight goal belong terrorist action tend young male due reach ideal freedom lower level goal posit action secur forc standard reveal tendenc react strongli deni freedom element permit carri mission assign checkpoint guard attempt provok guard commit act escal scene emploi civilian male markov chain model concern ontolog feel inhibit observ avoid altogeth due fact higher weight goal avoid secur forc job standard front author figur portion markov chain show hierarchi game engag protest scene level protest level secur encount level protest site protest prepar enter protest approach secur violent conflict protest site daili routin motion protest observ secur encount secur evalu home leav social psychologist studi factor contribut aggress crowd uniform agreement gener common factor tend contribut presenc line draw line dramat issu make larg spatial concentr presenc camera crew violent crowd behavior fairli rare gener requir tension seri perceiv poor perform agent social control polic secur tend tend young male children scenario includ major contribut factor bulk drawn particip protest social inhibit concern ontolog exist emploi member concern ontolog closer terrorist term goal untrain handl secur concern person gain suscept crowd tip event set includ tip event occur checkpoint guard proper crowd event observ front commun simpl tip chain reaction atop number conduc condit presenc type peopl secur forc inabl effect sudden creation action contribut intens emot crowd moment realiz protest confront number issu primari fact protest likelihood lead hope remov dissolv disappoint face increasingli real possibl target lead fear allevi leav protest depend resolv hope involv major case vigil dead secur figur overview goal portion concern ontolog agent find opportun insuffici secur forc present rel size densiti fact young male notic chao perfect solv problem unwil local fear encount polic process protest check shame act standard suppress physiolog benefit tempt ignor equilibrium event tip young male target nearbi store materi item address varieti problem cash pai rent entertain period end due simpli arriv larg secur forc factor effect return inhibit time due emot standard satisfact motiv item grow shame destroi properti scene time secur forc arriv equilibrium eventu restor violent model propag emot media impact group messag spin event sake influenc apparatu propag messag set process hope add step commun interest todai build realist behavior virtual persona anim graphic approach lead kinesthet appeal reactiv agent investig seek make behavior cognit realist reach artifici evolutionari comput ration agent approach approach offer ground behavior literatur faith human behav behavior directli encod model agent architectur set stage goal object current research major challeng valid concern system ontolog behavior model deriv literatur integr framework concern valid perspect includ model ontolog extract coher choic rel theoret correspond behavior emerg collect actual dynam observ real world term conduct extend review behavior literatur found great physiolog studi legitim ground possess model paramet statist tend restrict perform moder function feed individu reservoir compon physiolog subsystem integr moder effect rapidli depart ground theori enter realm inform opinion problem grow emot cognit layer hope incorpor behavior crowd inform opinion encount behavior literatur consist opinion leader make forego deeper toss movement resist believ forward progress swamp assist integr roadmap skelet structur miss provid roadmap paper penultim roadmap present structur simplifi assumpt linear current bank model subsystem drawn hope revisit replac piec piec time version literatur initi satisfi workabl test set attempt learn gain viabl model integr subsystem factor subsystem effort date success integr fabric model vari opinion leader easili plug opinion model plai framework studi strength weak made progress hardwir set progress term valid colleagu point claim model differ ontolog creat stereotyp agent ontolog theori individu propag theori central realiti peopl differ prefer standard creat nuanc hope captur faithfulli critic part part relev present explain inaccur agent ident concern ontolog fact constru world agent experi virtual world effort expend date fatigu agent oper stress level rest agent event encount fact random number gener perturb weight slightli agent class creat number individu differ fact emerg integr framework term type train system attempt acquaint stereotyp crowd prototyp ira type mission mission central tendenc tendenc vari group group subject time program numer ontolog distinguish individu group offer present failur conduct correspond test true agent observ progress ω level adher daili vigil arriv panic occ model make crowd arrai standard gener emot consist crowd feel simpli matur research point recreat specif histor crowd event real model simul actual emerg behavior vital step improv model past simpli trust produc valid lesson learn literatur improv realism behavior model tendenc engin commun construct subsystem model believ good consult behavior literatur complet survei literatur found number model basi cognit model agent behavior fact problem fact integr bulk effort date document figur integr common mathemat framework benefit model process integr topic attempt creat integr benefit approach realist deal interplai dimens connect abil address simul open larg number possibl improv agent behavior confront realist scene benefit term game time learn adapt fit scenario interest singl valid theori integr result appeal concern ontolog vital requir ontolog approach present paper reli common mathemat framework integr dispar model theori agent assess prefer standard determin action find desir subject stress induc limit bia tendenc properli simul requir extens ontolog engin flesh lower level concern ontolog current effort aim ad set tool visual ontolog emot model util make express relat contribut paper li emot anim effect believ deriv util dynam standard theoret model basi agent comput util function deriv subject matter expert insert directli agent approach postul subject matter expert interact stage stage defin concern ontolog agent deriv util tradeoff approach free expert infer place debat squar open literatur account set concern ontolog acknowledg author acknowledg support model simul offic lt col dr phil great bill refer nass media peopl treat media real peopl place cambridg press autonom agent rw model human organiz applic militari nation academi press build cognit rich agent toolkit commun acm myth mad de ethnic uc van killer interact comput game artifici intellig pp role emot believ commun special issu juli theori game econom emot person effect util altern terrorist target select case conf comput gener forc behavior simul terrorist emot prefer model affect process model emot doctor northwestern evanston error human gerald clore allan cognit structur cambridg martin paul test theori discret person social pp emot oxford interplai emot web emot base agent architectur proc avail lm review command control model septemb realist human behavior model agent virtual technic make psycholog analysi choic commit free press target york st martin ce make model method engin data human percept wright patterson tech report
IR/1047 5 extract inform network web research plan park assoc prof prof ramamohanarao centr ultra broadband inform network depart electr electron engin melbourn content novemb introduct problem statement literatur review retriev text understand music identifi imag extract video work complet progress research plan list publish work introduct introduct world wide web document internet huge amount inform resourc grow rapid rate decad main resourc inform peopl larg interest web due fact uncontrol easili singl person add web brought lot due fact uncontrol inform found web necessarili point view straight lie tool filter garbag find inform relev trust read breakthrough download latest view cricket score inform wide varieti topic difficult find internet search engin made start construct index text found web method accept internet commun index imag video problem statement world wide web vast amount useless requir inform found easili main form data web text plain imag audio video lot effort put text retriev search engin effect time effort imag sound retriev main method imag sound retriev examin text hypertext link point method index file success video extens sound imag standard work includ meta data video order assist search type meta data great includ kei frame part kei tune kei object assist build index audio imag file problem face extract kei kei imag kei similar task determin topic kei word describ literatur review literatur review retriev text lead search engin establish revolutionari method method examin web structur order page link page link page page consid vote page page examin page googl ass import page import vote page method great vote popular page shown page peopl discov web peopl discov search engin circl popular page ignor unknown page paper marchiori detail current search engin advantag hyper inform found html search engin give higher relev page visibl visibl impli higher higher popular examin search engin suscept simpl search engin method marchiori suggest page relev document link page similar topic suggest method score relev page link page relev topic perform number level tree document hypertext method inform retriev reduc risk link page set local server method solut give link remot page higher relev due numer search engin found user problem suit queri view metasearch engin metasearch engin queri send multipl search engin process parallel top result displai user result find engin produc result adopt idea extend metasearch engin queri multipl search observ user search engin simpl machin learn techniqu gather search engin visibl relat number page link design call vote googl artifici repetit keyword index system literatur review queri great search peopl link observ page find impli page interest consid highli relev topic peopl link find search engin learn techniqu search engin includ natur languag queri assist web situat set exact keyword australian anim begin queri work good idea advanc spertu list heurist topic infer web author state hypertext document found web treat hypertext document found static collect major differ web document cross site web miss repeat web constantli chang author heurist advantag spatial tempor local web hypertext link directori structur search engin easili find relat page sampl page web commun builder individu home simpl tool develop find relationship internet commun idea methodolog easili insid site web page design set page site boost score page link kazman design system link hypertext document initi result obtain keyword search link examin connect page found consid hot spot web consid relev connect method classifi popular site relev major problem current internet huge amount document search engin send web robot call gather inform creat index web larg task time complet great idea wu recommend site spider quickli easili find inform site locat assist user find cd music articl journal commun visit search engin spider gather inform site faster pace inform style major spider web moment literatur review metacrawl spider form queri send multipl popular search engin process parallel result displai usual list form intellig home page finder inform person institut belong search page learnt belong institut institut home page locat found queri metacrawl home page index search good idea find autom travel assist spider find optim flight user internet softbot prototyp user easili find inform internet occam list site descript queri output plan gather request data internet learn agent prototyp inform resourc locat user stai inform resourc internet jango base retir find product bui web jango creat index product found web store user find store spider origin design web call etzioni gener spider feed inform compil spider obtain accur talk expert expert easier talk friend paper kautz al show social web extract world wide web examin home offic club list social type extract perform entir graph web commun show web connect graph find shortest path person talk person link introduc peopl literatur review servic search dai googl million altavista million inktomi million direct hit million fast million goto million jeev million tabl number search dai lead search engin obtain peopl eventu meet person type system access inform type introduct program list work creat due web number search dai tabl easili web affect million peopl live everydai vast amount inform browser creat peopl access situat requir browser technolog futur spider user view result access inform easier time spent wast time monei search method respond correct reli thing search techniqu resourc finder assum search engin classifi web page correctli pagerank method googl import page page topic link pagerank method fail page gave vote classifi incorrectli classifi web page examin long web consortium establish set document keyword field keyword creator page explain page system creator assign keyword peopl search web page design freedom add correctli identifi topic document examin simplest method count occurr word literatur review document word relat topic document understand music amount music web explod size qualiti format introduc sole music compress audio layer compress techniqu compress ratio ten popular song store megabyt file compact fast compar uncompress qualiti virtual indistinguish prompt peopl put music servic creat browser music member member comput listen music peopl join music pc listen major problem found servic similar music file identifi instanc occur song download song titl lot peopl made song peopl hear current pop hit theori person song matter major peopl download send straight trash made fool avoid type music content file extract identifi instrument identifi style music paper martin al explain current attempt discov pattern music wrong track disassembl music note natur listen music song listen easili turn simpl hum classifi style compar song find knowledg music theori build system perform type task search theori assist peopl learn structur music brain process express music free natur captur essenc composit studi perform find aspect piec music listen identifi word document gener common word literatur review identifi instrument human limit ignor understand music build sophist music analysi spend time transcrib notat tabl concentr real music system intend music score written stage popular music section repeat rhythm music split section improv frequenc analysi chu logan explain acoust featur found perform short time fourier transform signal tempo easili found expect spectrum extens examin music music split tempo section main frequenc extract remov type wavelet transform perform discov effect short fourier transform suffic situat human object taxonom child ball matter type learn cricket ball listen peopl class instrument exact instrument person involv music classifi instrument comput perform paper martin kim show easier natur develop method instrument recognit begin basic level studi found classif algorithm chanc identifi instrument correctli instrument top level qualiti sound show properti studi assist classifi instrument group fastest record type speech store sound transcrib problem find specif speech set audio record transcrib record easi search time perform audio text great overcom compaq creat world web search site spoken audio content speech recognit scan internet site index speech audio file content quick easi search save user literatur review listen record manual search add correct found web page link audio inform info audio file label file index current voic recognit techniqu usag aid steer identifi topic file direct standard end build standard includ video content easier search index paper lindsai method standard repres music descript scheme suggest ds inform sourc physic ds comput featur correspond human percept power frequenc perceptu ds peopl perceiv listen music transcript ds encod origin composit write music notat architectur ds describ relat annot ds place place comment note analysi comment emot ad descript easili find piec music matter type inform identifi imag popular form data web text natur make index imag peopl find search find pictur web textual inform user suppli find pictur text search engin result reli web page author label pictur suppli imag search engin kei pictur search engin proce compar data describ content file literatur review kei imag index produc list site pictur mr problem compar simplest method creat histogram imag count number time colour imag imag similar similar effect method give match imag colour requir entri index length grei imag colour imag photo dai colour complet person paper chen al detail invari descriptor match method magnitud fourier transform signal translat invari transform signal convert rotat scale translat remov rotat scale fourier remov convert fourier transform remov phase index imag compon center origin comparison method give result histogram method account structur imag colour problem method found convert back origin numer imag descriptor notic produc analyt transform differ form satisfi complet requir inform lost perform continu form transform explain great discret transform approxim continu version discret consid detail paper method approxim compar term imag reconstruct imag comparison direct basic sampl continu method integr sign summat polar call fast algorithm make similar fft convert imag fourier transform fast fourier transform algorithm handi call cartesian perform transform cartesian polar simpl test show cartesian algorithm longest perform cartesian fast algorithm give result similar descriptor method introduc paper bui literatur review chen label invari descriptor descriptor assum imag consist imag search head give bodi due scale perform size imag rotat invari perform convert polar fourier transform radial match wavelet transform perform angular natur discret wavelet transform produc vector consist transform vector scale compar scale check match process stop finer level check experi perform wavelet charact charact rotat scale differ compar descriptor result show match capabl matter wavelet extract video extract kei portion video understand part consid kei portion video consist frame imag sound imag relationship sound aspect found highlight import piec video show sport highlight crucial part fact peopl watch present sport event occur imposs manual search lot highlight csiro develop automat system call collat highlight sport match system search video audio includ sound crowd camera oper pan zoom highlight present user make final piec footag rule sport select highlight select highlight includ time team obtain ball time point cricket highlight includ time ball bowl time event happen great good event bound camera cut scene problem caption film programm birth visual medium film problem reli total caption dai caption design assist hear impair translat foreign languag program make view experi pleasur work complet progress inform successfulli caption film caption type caption cue video exact frame begin end speech long time hour minut csiro develop piec softwar call align caption speech automat detect dialogu shot boundari caption present caption caption listen select interv type text softwar select region understand context speech rule segment caption type programm rule segment programm work complet progress begin extract kei understand kei inform simpl text word describ current method suggest word document suffici singl topic consist kei phrase find kei spatial inform determin word method fd fd inform obtain fourier transform document determin spread posit word document word period document consid kei phrase document fourier transform signal convert signal spectral form word document thought signal transform compar signal word similar frequenc phase inform frequenc high word part document topic compar method cosin measur latent semant index lsi map data trec result search engin web result show fd superior case due fact cosin measur case fd interest idea obtain paper method compar imag find similar invari descriptor method characterist fourier transform remov inconsist due scale rotat imag similar method analyt transform work complet progress invari descriptor test perform set sampl imag result compar histogram method found method gave fair result margin error due background colour imag background consid overcom detect transform perform imag test run result improv fair margin popular music split section hum peopl hum vocal tune work perform chu logan show identifi song pattern chang song split compon repetit section section al match simpl tune hum voic extract simpl tune section find song index song simpl tune tune song base instrument short time fourier transform wavelet transform isol instrument frequenc remov effect extract major frequenc compon histogram method involv creat histogram colour similar imag similar histogram research plan research plan investig applic fourier transform text type wavelet transform examin wavelet transform replac cosin transform jpeg unlik fourier chang basi signal finit domain finit domain qualiti enabl higher compress ratio imag enabl data store document index examin effect princip compon analysi text natur step proce independ compon analysi document word space uncov event occur space techniqu interest appli imag sound investig effect wavelet transform suitabl wavelet independ compon analysi text retriev index give result good fd requir disk space index explor area descriptor independ compon analysi imag descriptor index imag examin structur scalabl vector graphic format vector comparison techniqu compar imag similar find method break music smaller identifi piec examin spectral content examin strip music extract tune instrument spectral method observ waveform produc plai tune multitud instrument remov properti convert tune extract kei frame video imag audio method sport highlight found listen video complet thesi list publish work list publish work ramamohanarao internet document filter fourier domain score european confer principl practic knowledg discoveri septemb refer refer bui chen invari descriptor pattern linear algebra intellig inform retriev technic comput scienc decemb sergei brin lawrenc page anatomi hypertextu web search engin comput network isdn michel symmetr match filter transform imag registr recognit ieee transact pattern analysi machin decemb rick kazman search web connect comput network isdn stephen chu beth logan music summari kei phrase technic report crl cambridg research april robust effici transform imag reconstruct complet invari descript februari oren etzioni move inform food chain ai volum page american associ artifici summer fan word wide deni action lot faster wire digit novemb complet invari descript imag harmon analysi approach pattern recognit octob refer garrett david word wide simon haykin neural network foundat prentic edit adel daniel savvysearch ai page summer henri bart shah hidden web ai volum page american associ artifici summer adam lindsai werner hear multipl music journal music marchiori quest correct inform hyper search engin comput network isdn keith martin kim music instrument approach societi mit media machin listen group rm ma octob keith eric bari music content analysi model audit proc acm multimedia workshop content process music bristol septemb lloyd ian salli jo cunningham digit music tune retriev acoust input daniel weng wu site agent increment explor world wide web comput network isdn william pratt digit imag process john wilei internet site index stream spoken audio technic compaq comput cambridg research cambridg refer robert scott caption ellen spertu mine structur inform web comput network isdn nation institut standard technolog text retriev confer world wide danni sullivan word wide ian alistair timothi bell manag gigabyt compress index document imag morgan kaufmann
DB/1048 3 view holder util custom materi view creat servic suitabl mobil applic susan submit graduat faculti art scienc partial fulfil requir doctor philosophi pittsburgh pittsburgh faculti art scienc thesi present susan defend juli approv prof pano chrysanthi prof siegfri prof martha pollack prof ii view holder util custom materi view creat servic suitabl mobil applic susan mobil comput user util mobil comput access comput locat user time dai condit mobil environ chang rapidli compon environ respond unpredict power resourc affect work perform mobil user data cach provid mean support disconnect mobil oper context mobil data cach form materi view person inform gather mobil client increasingli import due storag differ mobil devic laptop amount inform todai environ internet dissert present develop customiz view mainten call view holder middlewar mechan fix network dynam maintain version view meet data consist currenc requir mobil client gener view holder support commun mobil client common interest motiv maintain version data occur materi view disconnect reduc cost wireless commun order maintain custom view mainten perform data sourc translat mobil machin request materi program trigger constraint monitor routin materi program creat advantag latest mobil agent technolog mobil agent autonom program migrat machin network behalf client perform task machin agent host mobil agent ideal mobil comput environ due abil support asynchron commun flexibl queri process task deleg mobil agent mobil client disconnect view mainten strategi level view consist give mobil client varieti person view mainten option reduc client depend fix network offer finer grain control balanc data amount wireless maintain consist fine grain approach creat manag materi view mobil environ advantag strength fix network order adapt wireless condit extend usabl mobil devic enhanc person product iv tabl content list tabl viii list figur ix introduct requir mobil environ facil mobil environ problem statement solut approach contribut dissert relat materi view data wareh environ relat materi view materi view motiv view mainten problem view consist problem serializ access view consist data updat scenario level view consist data wareh strobe algorithm view mainten data chapter summari challeng mobil environ mobil environ asynchron mobil oper util version mobil problem introduc solut mobil environ data currenc view consist custom chapter summari classif mobil architectur ad mobil tradit model adapt dimens classif mobil model rover server model comparison classif classifi view holder approach view holder solut mobil queri process view holder client cach agent creat view holder view view holder agent logic tupl version updat view holder agent commun version cach agent discard version view holder agent algorithm version algorithm link list initi updat commun view holder agent relat manag system chapter summari program view mobil client person data access commun profil condit view mainten prefer custom sql statement detect data sourc problem custom queri process mobil client view holder architectur custom view currenc recomput mainten custom view currenc build view holder materi program coordin condit evalu partial materi view currenc custom view consist custom recomput consist increment view mainten condit perform recomput increment view mainten perform evalu recomput mainten perform evalu increment mainten perform analysi implement view holder mobil agent chapter summari view holder data process chain motiv conflict detect commit result data process chain vi view holder propag model rule propag propag commit updat base tabl util asynchron cooper chapter summari bibliographi vii list tabl tabl data server data view materi view pennsylvania strobe view view data materi view updat materi view tabl queri condit updat scenario number messag view mainten mobil agent size messag view mainten mobil agent analysi condit recomput increment mainten tabl data server view holder view viii list figur element triangl mobil environ materi view queri view consist updat scenario strobe algorithm sequenc updat level consist materi view data sourc strobe famili mobil network materi view queri mobil environ mobil environ view mainten scenario classif mobil comput model origin function ship architectur architectur architectur architectur server architectur overview view holder architectur view version view mainten logic tupl version ix store multipl version tupl version list version store algorithm algorithm algorithm relat differ increment recomput view mainten view mainten fix wireless network queri tree queri recomput materi program view evalu conjunct condit partial view materi level view consist recomput view mainten level increment recomput view mainten consist perform model recomput queri perform model increment mainten mobil client data process chain mc view holder execut model result data layer logic tupl version view holder propag result data layer figur view holder store resolv conflict chapter introduct requir mobil environ advanc comput telecommun technolog affect comput chang busi cellular telephoni short replac person digit assist integr telephoni pen comput notebook portabl comput replac equip wireless interfac network user mobil mobil comput user util mobil machin access comput locat user time dai network commun locat mobil enabl inform traffic weather stock quotat activ yellow page recent mobil commerc servic enabl web develop mobil consum shop flower reserv plane ticket technolog advanc make type applic telemedicin distanc learn emerg busi involv mobil comput system commun cooper process inform multipl form user globe expect user interact mobil system manner easi oper cellular phone minimum technic train mobil salesperson involv custom queri minimum knowledg corpor structur complet report return perform queri kei select minimum type research mobil comput wireless network mobil client integr part distribut comput environ stationari counterpart due frequent disconnect wireless inform store mobil comput crucial maintain product data complet task present mobil remot access elimin process continu disconnect occur data cach provid mean support disconnect mobil oper mobil machin autonomi mandatori period autonomi lead network commun faster time time enabl mobil machin reduc number request made data server fix network frequent commun result slower time due limit bandwidth wireless constant deplet comput batteri doubt number mobil engag busi orient grow kei issu address mobil comput viabl wide accept ffl larg data mobil machin carri replic data found corpor data server data size todai data wareh environ internet abil provid vast amount inform shown todai user wai handl ffl complex transact user perform complex transact valid complet inform system ffl continu user begin finish activ util synchron protocol perform offic continu interact network resourc ffl limit transact perform minim capabl mobil machin limit inher wireless commun highli variabl bandwidth greater monetari cost find solut problem significantli qualiti servic inform provid mobil user order solut term introduc identifi state mobil host collect data potenti futur applic execut anticip disconnect dynam customiz accommod individu chang environ user amount type data store mobil user match avail cost network capabl mobil machin motiv requir investig data chang fix network mobil machin facil mobil environ distribut commit protocol current system web cach data consist overcom mobil limit data avail currenc figur element triangl mobil environ design servic suitabl mobil kei element consid overcom limit inher mobil devic oper wireless network note limit specif mobil properti problem examin normal distribut environ network addit element address made current data specif applic final element correspond consist data present mobil devic respect data data server data figur show kei element relat technolog gener accept achiev point obtain facil extrem difficult situat imposs exampl provid data avail data consist todai relat servic chang consist state ensur integr constraint met data consist user user remain contact data server order perform work lock individu data make mobil imposs todai distribut commit protocol step mobil user function distribut ensur consist data occur long compon distribut environ part commit protocol awar updat due inabl predict mobil compon contribut commit provid reliabl data avail data currenc challeng approach mobil high data avail consist data deliv data sourc exampl principl todai web cach scheme mobil user cach access web page page consist page sourc eventu consist page ag eventu replac consist provid problem statement reach dead center triangl shown figur continu extrem goal dissert enter triangl provid servic enabl mobil design method make kei element problem address dissert provid method creat servic suitabl mobil applic greater flexibl custom amount data avail data consist achiev mobil client function period disconnect weak connect data mobil devic period triangl show mobil client high data avail consist data sourc goal provid option finer grain control current data access client data consist achiev mobil solut approach observ data cach client subset case relat focu cach data tupl deriv base tabl applic cach data materi view broadli materi view store cach result queri method present dissert view materi materi view basic build block compon mobil maintain multipl consist version materi view system asynchron replic method queri process design effect cope inher limit memori power mobil disconnect mobil comput substanti restrict commun high monetari cost wireless commun dissert develop customiz view mainten mechan mobil environ call view holder mechan construct maintain materi view data sourc cach mobil client disconnect updat concurr execut updat directli data sourc custom account avail cost wireless network capabl client oper mobil comput environ main advantag approach view holder program maintain multipl version view order data occur materi view disconnect data cach provid mean support disconnect mobil version asynchron replic strategi mobil system design opportun enter triangl shown figur view holder ffl enhanc overcom mobil environ view holder mechan fix network storag reduc comput commun cost wireless link view holder buffer data fit mobil client due inadequ storag proxi mobil client order receiv send updat perform period inadequ network condit ffl flexibl data view holder version mechan adjust currenc data store mobil user disconnect plane flight read updat deriv data necessarili discard work perform older data flight view holder dynam state respect individu mobil respond mobil client queri inform adjust data currenc account prefer mobil reduc cost comput commun ffl level data context group applic mobil client specif subset data data sourc data commun client inform system view holder combin comput deriv offer level consist data deriv data client multipl mobil client work sale team creat contract result newli result view holder process integr work individu mobil client check data inconsist view holder provid mobil comput flexibl data level data mobil develop make tradeoff kei element view holder preserv applic request data sql statement mobil machin approach requir modif made exist data sourc unlik solut present view holder design full advantag latest data ship mobil comput model model pair agent minim data transmiss wireless link move storag comput intens task mobil machin contribut dissert contribut dissert taxonomi mobil architectur chapter review current mobil system present classif base system mobil adapt capabl system includ taxonomi coda web odyssei rover explain view holder approach mobil comput exist classif mobil agent entiti network design perform task behalf mobil client classif divid agent scenario case account agent locat server modifi due presenc agent locat agent greatli affect differenti analyz strength weak current mobil system contribut dissert creation fix network middlewar consist view holder agent view holder agent agent maintain version view requir mobil client commun mobil client common interest view small special portion inform found data sourc version dynam maintain view holder agent incur huge storag requir view holder agent respond mobil client queri commun differ version chapter show mechan fix network reduc comput commun cost buffer data fit mobil client due inadequ storag proxi mobil client order receiv updat data sourc period inadequ network cach fix network repres individu mobil client view holder agent maintain version view order effect handl disconnect oper greater flexibl custom amount data currenc consist achiev view cach mobil comput data data sourc view holder gener data maintain state respect individu mobil client support view holder requir maintain view specif program specif time view view view holder monitor sourc data mobil host resourc work view holder execut materi program contribut dissert explain chapter introduct extend form sql mobil client custom view materi program addit inform mobil client give view holder agent host work import data plan custom data view currenc reduc cost materi materi program design emerg mobil agent technolog mobil agent autonom program migrat machin network behalf client perform task machin agent host capabl chapter fourth main contribut dissert provid understand view consist affect mobil client view currenc custom type view mainten algorithm approach recomput mainten construct version materi increment view mainten updat slowli incorpor exist version chapter formal defin recomput consist introduc level materi view consist correspond specif view currenc custom chapter explain increment view mainten affect mobil view currenc custom translat extend form sql level increment view consist chapter conclud perform analysi recomput increment view mainten fix network metric evalu number messag messag size requir view mainten algorithm approach construct materi program util mobil agent version data cach avail older version input mobil client applic period client eventu learn valid result produc respect current data valu present chapter data valid result propag process detect inconsist newer version data reconnect view holder comput period time consist measur result mobil client applic consist valid chapter suppli rule govern creation share result show inconsist detect chapter show asynchron cooper dynam establish view holder agent version view holder custom data provid optimist replic strategi flexibl consist view cach mobil comput data form cooper work repositori view holder chapter relat materi view data wareh environ relat materi view relat emerg manag system wide manag system support applic relat data structur set tabl view defin function subset base tabl deriv tabl view materi physic store tupl view deriv base tabl materi view save tupl import frequent queri amount corpor data organ relat manag system due abil make data constantli provid mean effici execut larg number small transact data develop order summar data multipl data sourc support analyt process support system data repositori extract integr data heterogen distribut data sourc data store inform materi view deriv multipl base tabl sourc updat base sourc mainten transact figur data amount comput commun answer repetit queri significantli reduc client data perform queri view provid materi view larg data consid gener stateless respect individu client materi view motiv standard applic compon execut comput call request servic data compon execut comput call server structur fix network includ relat server store base data store materi view deriv maintain base tabl sourc figur import understand data hold static view summari inform queri client answer materi view data deriv data sourc view data server data server data data server data mainten transact applic data cach client materi view queri processor creat view client queri mainten transact figur materi view queri data server base tabl sport good store tabl tabl shown includ sale individu item transact inform data suppli summari inform base materi view call tabl period total sale store item line current price video golf store sid citi manag dunham pittsburgh ms dunham eri mr rei sport pittsburgh ms atkin sale sid quantiti sale price date tabl tabl data server sid line dunham golf dunham dunham golf rei sport tabl data view attribut attribut period updat mainten transact item sold tabl show materi view client start applic user perform rough calcul equip sale order inquir equip sale made store client request inform data data sourc sourc uniqu identifi dw refer data db refer sourc base tabl creat view select price global queri client queri processor locat network queri compon queri data result tupl queri materi view tabl distribut environ materi view store client support local queri process materi view oper fashion similar data cach data access quickli materi view queri remot server retriev data materi case tabl made faster indic materi view figur client machin cach materi view queri view mainten problem show materi view data manag system commun inform user form materi view materi view faster answer common queri respect view continu recomput answer scratch data sourc iew pennsylvania golf golf golf tabl materi view pennsylvania made data materi view data cach client fundament question answer data client ffl mainten polici maintain materi ffl mainten techniqu ffl perform view updat base view mainten protocol describ effect updat commit data server data client protocol chosen decid extent view consist achiev determin accuraci consist data store materi view time question effect resourc question determin role compon perform order ensur view mainten view consist problem store locat track number unit sold product line relat materi pennsylvania tabl held data provid inform user make simpl calcul percentag unit sale philadelphia store serializ correct criteria emploi concurr control system maintain correct mean transact share data execut erron result introduc system data execut group transact consid serializ creat output effect serial execut transact serial serializ execut execut leav consist state satisfi integr constraint difficulti serializ materi view maintain separ base tabl shown read materi materi view base tabl execut emploi strict phase lock rl read lock read wl write lock write view date rl rl wl unlock commit user calcul unlock commit client data sourc figur view consist assum view pennsylvania maintain begin reader transact figur latenc inher defer view sourc updat transact separ view mainten transact updat base tabl commit updat materi entir base tabl sourc client temporarili enter inconsist state reader inconsist state violat serializ user make incorrect calcul assum philadelphia account total sale serializ view consist problem due fact coupl system base data sourc materi view interdepend tradit concurr mechan work defer view mainten disrupt serializ base tabl updat materi view maintain serializ research recogn consist problem histori transact involv read materi view updat base sourc view depend develop serializ theori base conflict serial graph materi view access graph test decid histori serializ view maintain defer manner idea user read view consist read oper conceptu map data sourc transact serializ data sourc transact provid similar provid serializ data replic materi view data build graph costli term comput commun access view consist materi view bill queri read base view data answer reflect current state data case approach recogn inher depend base tabl philadelphia view pennsylvania read perform client serial updat read updat pennsylvania show import applic maintain applic data wareh exist weaker form consist applic user current number golf unit sold pittsburgh read number directli base matter latest updat reflect view show applic prefer access recent data weaker consist project integr distribut data util materi view materi relev portion base comput final view compon copi copi knowledg tabl consist activ rule describ consist maintain definit consist requir global timestamp sourc order achiev fix order event adm project creat cach materi queri result evalu futur queri group pointer tupl base tabl construct view client execut adm maintain period receiv updat log provid eventu consist materi view data wareh snapshot consist step examin defin varieti consist level reflect correspond deriv data data view base sourc examin scenario data reader perform transact materi updat perform write base tabl unlik snapshot consist concern concurr control problem transact read base tabl expect effect updat read deriv materi view snapshot consist examin algorithm vari amount consist data sourc deriv materi view maintain defer manner section data updat scenario incorrect result produc section happen client read inform view base data chang similar problem occur data view manag updat view base tabl data server chang problem call view mainten occur view mainten decoupl autonom data sourc insert delet oper anomali data updat delet insert tradit distribut solut involv lock view mainten eager algorithm creat data view chang consist state respect data sourc prevent incorrect comput introduc view maintain data eca work multipl data sourc combin produc data problem multipl sourc anomali level view consist data view involv multipl sourc defin success level increasingli complex difficult strobe famili algorithm develop provid distribut view mainten level consist avoid multipl sourc anomali strobe algorithm provid level consist depend sourc long base data sourc view deriv provid addit inform execut order individu updat transact strobe algorithm divid type updat occur individu data sourc separ updat scenario match updat scenario strobe algorithm shown achiev level view consist figur strobe algorithm mainten server data server data data view applic cach client client data queri mainten transact updat updat view algorithm strobe updat scenario level view consist updat scenario strobe algorithm level view consist figur updat scenario strobe algorithm kei algorithm data view includ kei base tabl involv format view complex creat algorithm maintain level view consist ti complex transact updat data sourc updat scenario order singl updat transact updat transact report data separ commit achiev relat system trigger creat site send messag data transact commit chang legaci system includ categori transact updat sequenc action perform data sourc transact data sourc local serial schedul transact updat batch report data reflect updat action atom data relat trigger work updat scenario global transact updat action perform multipl data sourc part global transact data sourc global serial order global transact global transact reflect atom data data transact global transact solut site coordin commit global transact report updat data final commit import rememb strobe algorithm provid level consist specif updat scenario data sourc updat scenario updat scenario consid complex level view consist data wareh tabl relat materi view sequenc content pittsburgh philadelphia pennsylvania golf golf golf phil phil phil figur sequenc updat data defin sourc state seq ss ss final base data state updat commit base data tabl pittsburgh sourc state seq assum updat perform serializ fashion permit base data consist state sourc state sequenc materi view sequenc view state view mainten seq final sourc state state sourc data moment time repres content base tabl sourc sourc uniqu id moment time sourc state vector element compon vector visibl state sourc tabl view pennsylvania view state deriv sourc state vector phil specif view result comput view sourc state vector case show unit equip unit golf equip sold view snapshot consist sourc state view consist sourc provid snapshot consist similar provid serializ vari data sourc state combin consist level achiev sourc state vector phil creat view state pennsylvania unit equip unit golf equip sold phil figur show level materi view consist data wareh environ base data sourc dw dw dw converg complet weak consist dw strong consist figur level consist materi view data sourc circl repres state site arrow show data state construct figur show view data defin base tabl separ base sourc set transact darker circl end timelin show final updat perform level consist final updat perform base tabl util creat final state data materi view ensur execut set transact data eventu reach state deriv consist base sourc rememb constitut transact depend updat scenario assum initi view data consist synchron data level progress converg view dw achiev consist base data complet complet map state view state base data level subsum prior level ffl transact final state data view reflect final sourc state data sourc sourc state vector final final final final final ffl weak converg hold view state reflect valid sourc state sourc sourc state vector data sourc execut serial schedul transact creat xs entri sourc state vector view state reflect valid state data serializ schedul data sourc view reflect set commit transact data sourc ffl strong weak consist hold order time view state match order sourc state sourc state vector state data sourc set transact execut exist map view sourc state execut transact view state reflect valid sourc state view state reflect execut transact view state match order sourc ffl strong consist hold sourc state reflect order view ss ss strobe algorithm consist consist strong weak converg inconsist complet updat multipl sourc global eca strobe strobe strobe correct figur strobe famili famili strobe algorithm figur show level consist algorithm provid specif updat scenario algorithm achiev level consist updat achiev level consist updat scenario complex strongli consist global transact involv weakli consist global transact scenario creat depend data sourc updat perform strobe algorithm increment build materi view global updat scenario requir addit sequenc number individu updat transact receiv updat data data wait prior updat global transact process mechan deliv updat execut strobe algorithm includ sequenc number simpler strobe algorithm lower form consist ablex tabl strobe view rest section demonstr strobe work provid multipl sourc anomali strobe offer solut tabl separ site view maintain data view defin origin empti tabl insert delet insert receiv data site queri site data data receiv answer site queri site data data receiv delet site view action data receiv answer insert tupl view incorrectli anomali interleav queri updat arriv data sourc multipl sourc involv updat occur queri complet queri overlap process updat strobe algorithm track updat occur data sourc queri process action answer appli materi view insert receiv data site queri site data data receiv answer site queri site data data receiv delet site add sourc action pend queue data receiv answer delet queue happen evalu delet result view maintain correctli oper queri data sourc reflect action queue strobe strong consist updat materi view creat reflect state data sourc insert delet oper complet view mainten data view mainten requir base tabl eventu propag materi view store data todai data notifi updat mainten transact creat data server made base tabl data server batch materi view data maintain period execut long run mainten transact algorithm strobe famili achiev view mainten batch updat data server consid long run transact view long run mainten transact perform night normal busi hour view reader client perform view reader access data base tradit transact process algorithm updat data long run mainten transact present unreason delai applic view reason view frequent queri block delai execut mainten transact busi global access data dai night unaccept block reader specif view mainten hour concurr desir type solut discuss context data wareh mainten transact tend long introduc multipl version data view version view long run mainten transact work separ version eventu reader consumpt version algorithm version lock end group mainten transact signal version view reader older version eventu reader forc end current work reader session creat version data older expir reader session sequenc queri version data data reader session reader data consist entir sequenc queri execut period time import data analysi unaccept result chang subsequ queri multipl version lock data block transact longer reader mainten transact execut concurr place lock addit cost space requir store version updat attribut assum view shown tabl data maintain version algorithm tabl show materi view data maintain multipl version view multipl version attribut version number mainten transact updat tupl assum tupl largest number belong recent version view notic mainten transact creat version view includ sale transact made store sid tabl version creat time includ sale transact mainten transact make version version remain view reader chapter summari chapter examin problem inher relat materi view data sourc decoupl view data wareh environ chapter examin fundament question underli view mainten techniqu view consist problem difficulti emploi serializ correct criteria maintain materi view discuss techniqu sid line dunham golf dunham rei sport dunham golf dunham dunham golf rei sport tabl view util data wareh environ materi view reader mainten transact execut concurr goal dissert develop customiz view mainten mechan mobil call view holder view holder construct maintain materi view data sourc cach mobil client custom view currenc view consist order overcom limit work mobil environ techniqu view consist import issu develop mechan mobil environ chapter revisit materi view techniqu view holder program data occur materi view disconnect chapter revisit updat scenario strobe algorithm discuss mobil client custom view currenc view consist chapter challeng mobil environ mobil environ fix network mobil client mobil support station figur mobil network mobil devic wireless network resourc mobil client chang dramat unpredict design viabl mobil environ requir overcom fundament constraint mobil assum mobil internetwork origin shown figur fix network host data server mobil client laptop small displai smaller portabl comput pda equip wireless commun interfac batteri oper order retain network connect move remain contact special stationari host equip wireless call base mobil support station mss broadcast area call cell mc commun mss cell mc enter broadcast rang mss regist mss kind mobil constraint ffl asymmetr level mobil stationari machin lack processor memori disk capac ffl wireless wireless commun slow bandwidth variabl time connect high content link low bandwidth ffl batteri limit batteri mobil machin power period disconnect order save power ffl asymmetr mc mss smaller bandwidth capac mss ideal broadcast data dissemin techniqu highli variabl constraint inher mobil member environ respond rapid power resourc affect work perform mobil client adapt qualiti make design mobil environ uniqu challeng asynchron mobil oper asynchron commun mobil client receiv result reconnect figur show mobil client pose queri section mobil environ mc send global queri wireless network mss contact mss forward global queri queri processor locat fix network depend mobil comput queri processor part agent job answer mc request queri compon queri data data result tupl queri materi view process server data server data data server mss mss cell cell mobil network interfac mc mc mc queri result mc queri data data transact mainten transact mainten mobil network fix queri network figur materi view queri mobil environ relat mc locat wireless network materi view commun mss final mc queri process fix network save batteri power resourc mobil client result commun mc cach local process materi view connect disconnect fix network mobil cach materi view make queri process significantli reduc amount commun mobil machin data sourc period cach view provid mean mc continu work view mainten question mainten polici maintain difficult answer mobil client asynchron commun possibl achiev view mainten forc individu mc mobil store current locat mc home agent host receiv inform made exist cach materi view view mainten strategi suitabl due disconnect potenti mc mobil updat propag determin amount resourc mobil client machin stationari host fix network view mainten method offer handl disconnect effect recal chapter type solut discuss context data wareh mainten transact tend long introduc multipl version data view version view view long run mainten transact work separ version eventu reader consumpt motiv util multipl version mobil environ provid version materi view view mainten occur separ version eventu mc similarli data wareh multipl version case view mainten transact execut concurr place lock addit cost space requir store version updat attribut util version mobil revisit queri mobil client request result materi respect version data view shown tabl mc materi time receiv current sale figur version due travel commun delai applic spreadsheet graph tool start user creat slide upcom present recent result commun condit improv user dial hotel room recent sale figur incorpor spreadsheet show version cope disconnect applic access recent data invalid work note mc receiv recent version user run applic session access separ version view time applic session user receiv updat inform time plane discard work perform older copi data applic session contrast reader session data wareh consecut queri version session reader user forc stop work expir reader session start finish explain data wareh view mainten strategi suitabl potenti mobil environ problem introduc solut mobil environ mobil client directli access data server data pose wide rang difficulti problem stem limit resourc mc wireless network ffl conveni mc receiv version view time period disconnect poor network condit ffl mc receiv version work period disconnect expir version discard reconnect ffl mc adequ storag hold version materi view entir version problem stem static natur data data server contact individu mobil client inform updat perform ffl updat data send entir version view time comput differ version ffl time mc materi view updat data data sourc queri order reconstruct materi view scratch creat great deal traffic fix mc request view queri ffl data data sourc creat maintain index queri commun mc discuss point direct interact mc data sourc support flexibl manner servic mechan fix network creat materi view cach mc maintain dissert util materi view fix network servic mechan order support mobil applic overcom limit oper mobil environ examin effect mobil kei element mobil data currenc consist data currenc view consist custom dw mc strong consist agt figur mobil environ view mainten scenario mobil client enter period weak connect mechan fix network build queri result form materi view mechan provid view consist mobil client cach consist import offer mobil applic user varieti data currenc view consist option commun capabl vari fix wireless custom level data currenc view consist applic view mainten oper match network cost prefer user access consist mobil applic trade consist commun cost improv order accomplish gener level consist mechan collect data multipl data sourc queri custom view mainten occur data prevent commun wireless link updat client cach time data sourc updat figur show state mobil client creat state agent mc creat data state attribut current price updat occur data updat fix network agent subsequ mc updat reach state state reach question data currenc custom effect level view consist chapter summari chapter discuss problem access mobil provid motiv maintain version materi view repres data mobil client disconnect granular relat system includ data tupl sql queri oper disconnect issu queri cach materi view mobil agent entiti fix network design perform task behalf mc mc resourc work agent perform queri maintain materi view result materi view mainten custom mc order reduc comput commun amount data currenc achiev data sourc level view client cach consist effect mobil client face rapid network condit resourc avail strategi techniqu develop system applic respond order find mobil comput model util version materi view mobil dissert present current state mobil comput architectur structur deal modif model made order creat mobil adapt show impact structur compon function chapter classif mobil architectur ad mobil tradit model standard server central provid secur system administr chang group numer client receiv standalon servic ad mobil distinct client server lead mobil model oper perform client server due resourc limit oper perform server emul client due poor connect simpl occur client emul function server disconnect order continu work function servic perform classic model classic model base request ship tradit commerci architectur client commun queri servic perform server result acknowledg pass back client discov concurr client request creat heavi server load network traffic architectur emerg advantag usabl disk cpu cycl client machin order reliev server data ship client cach queri result local disk order maintain partial replica data server updat propag log maintain cach consist client enhanc client process data machin architectur approach integr request ship function ship term function ship mobil agent applic mobil section data ship paradigm adapt dimens design model mobil import type function assign mobil unit approach focu lack resourc mobil client mobil client dumb termin run user adapt requir system fix network exist client applic modifi approach call adapt opposit call adapt avoid system support opposit approach stem wireless link monitor power consumpt mobil mobil client autonom adapt develop individu client applic extrem li wide rang call adapt case system notifi applic chang avail resourc adapt mobil client applic free make adapt possibl input user decid mobil made transpar client applic extrem import creat mobil model mobil comput model emploi adapt model effect classic model enhanc compon classic model classif mobil model review current mobil system present classif base system mobil adapt capabl system includ classif coda web odyssei rover figur chang approach origin term order clarifi scenario client applic creat modifi explicitli awar oper mobil environ odyssei adapt applic applic modifi server unmodifi server mobil awar transpar web browser wireless strategi rover view holder view holder coda figur classif mobil comput model server wireless fix applic mobil client figur origin function ship architectur figur show origin function ship architectur mobil environ applic client make request wireless network server fix network figur show data ship approach call model coda introduc model small group server export unix file system larger group client mobil client carri client emul file system oper perform server venu handl disconnect prefetch file interest cach mobil emul server disconnect maintain log reconnect detect updat conflict coda support optimist concurr control strategi tent write made server wireless fix client applic agent mobil client figur architectur disconnect client log client hope write eventu commit reconnect reconnect conflict recent transact develop detect addit conflict disconnect detect conflict impli applic specif resolut program perform transact commit server system call perform client applic trap venu client applic interact directli server coda adapt approach requir applic oper server fix wireless server agent applic mobil client figur architectur mobil entiti fix network design perform task behalf mobil client task assign proxi storag comput intens proxi knowledg specif mobil client client applic proxi fix network task interfac proxi call server agent shown figur wireless web system present mobil client run browser applic send request web server emploi model impli server agent form web proxi creat fix client request web proxi order reach web server web proxi reduc commun server mobil client manipul data varieti wai includ combin page web proxi creat knowledg compress format client browser recogn web proxi prefetch page relat client interest cach client browser applic approach consid unlik web proxi provid direct assist mobil client disconnect server fix wireless server intercept agent client agent intercept applic mobil client figur architectur agent client side server side found enhanc tradit disadvantag observ conveni modifi modifi client applic legaci oper client agent mobil agent server model fail mobil client continu work period disconnect matter agent optim commun happen direct vice versa allevi latest model develop pair client intercept resid client mobil server intercept run fix network server side shown figur client agent intercept client request deliv client ordinari local server process commun wireless fix network pair agent fix server agent pass request ordinari client resid fix network type pair agent minim data transmiss wireless link move storag comput intens task mobil machin optim easili integr pair agent work model call term adopt web compar addit system model rover rover applic distribut mobil client intercept agent offer system servic similar object conflict detect resolut synchron rpc inadequ mobil environ disconnect pair intercept agent commun util mobil object conjunct special queu remot procedur call design hold method invoc perform disconnect mc stabl log reconnect mobil client log server mobil object rover call dynam object form mobil object carri program data move wireless fix rover server rover support optimist consist control primari copi home server client fetch secondari copi move tent updat back home server reconnect conflict detect client weakli client log period flush back server small increment enabl adapt applic determin locat depend network condit applic move fix network execut rover program construct build programm defin data type requir data method order support program divid pair intercept agent util requir programm semant knowledg object oper requir specif applic abil creat modifi exist rover data server flexibl infrastructur support transact process mobil environ system unit data replic call compact compact similar encapsul cach method access data state inform compact oblig consist rule level consist make compact flexibl consist method rang pessimist concurr control scheme optimist object semant concurr improv client autonomi client applic request data server repli form compact client intercept agent resid mc call compact agent commun handl manag compact store mobil transact manag transact execut mc server intercept agent fix network separ part part mobil resid manag commun wireless fix receiv updat data server behalf client disconnect work conjunct compact goal creat compact client request hide detail mobil environ data request treat ordinari fix client compact manag server resid locat fix avoid problem legaci applic model section compact agreement server client server deleg control data mc local process client violat condit rule accompani compact compact contract negoti resourc realloc mc chang result server oper perform mobil period client contact server compact move respond dynam mobil environ unlik compact embodi adapt approach client applic server modifi creat intent compact motion capabl provid compact requir includ method invoc involv input user client applic order respond server wireless fix client server agent applic mobil client distil figur server architectur contrast odyssei adapt approach system fix network mechan adapt monitor resourc applic notifi chang mobil free adapt polici video player applic displai color imag compress algorithm view imag black white applic fidel level repres data client match copi server applic explicitli awar environ due mobil make adapt encapsul resid mobil client user space client agent commun server cach data client applic make request system call order individu resourc window toler avail resourc leav request applic notifi mechan similar unix signal client applic window toler correspond fidel level data fix network obtain fidel level accomplish requir data replic server format video clip store server color black white fidel level exist method feasibl approach creat compon server convert data server fidel send result client layer distil server mobil model creat applic adapt logic resid client form modifi server shown figur ca mod server agent model incorpor compon server model figur black area top graph repres make model server agent intercept pair modifi server server modifi order present option specif group mobil client make repeat function server agent intercept pair grei area classif make specif exampl includ exampl adapt approach avoid system adapt design individu mobil applic gener exampl present describ model wireless web system user activ select qualiti pictur type compress depend network condit similar exampl creat model comparison classif classif bear resembl present satyanarayanan complet descript enhanc tradit model classif present pitoura classif divid agent scenario case account agent locat server modifi locat agent greatli affect differenti analyz strength weak current system util agent classifi view holder approach solut approach dissert present chapter call view holder emploi mobil comput model address problem maintain data inform form materi view system present approach client cach prefetch maintain data mc disconnect view holder approach allevi problem discuss chapter requir modif exist data unlik solut present view holder preserv applic request data sql statement mobil machin approach solut mechan fix network maintain version materi view request mobil client call view holder agent addit cach request cach agent data prefetch send extend sql statement view holder agent extend sql statement design ad benefit view built reduc commun view holder data currenc consist appropri adjust mobil creat custom person view provid effici materi view process directli issu complex queri data sourc pai high bandwidth commun cost view holder approach list figur belong model approach requir modifi server provid adapt chapter view holder solut mobil queri process view holder client cach agent transact environ focu optim transact mobil comput util version materi view write transact perform directli data sourc materi view store mobil client work complement exist research mobil readonli transact effici dissemin data larg number mobil comput explor broadcast characterist wireless commun view holder solut approach maintain version materi view order support disconnect mobil oper line mobil comput model view holder intercept pair fix network view holder agent cach agent resid mobil devic intercept agent hide presenc mobil mobil client data server mobil cach agent local server process cach agent emul server disconnect data view holder agent standard fix network client intercept agent work reduc cost frequenc wireless commun view holder agent similar data store materi view contrast view view data larg data consid gener stateless respect individu client data reduc cost answer repetit reduc cost commun answer case small differ view respond mobil client queri commun differ answer view holder agent extens sql creat view order maintain multipl version view data occur materi view disconnect view holder thought customiz data creat view holder applic mobil client subset data exist data sourc ds includ data applic superset sv inform applic materi view defin queri appli data sourc specif applic cach agent request view holder maintain sv data applic possibl cach agent cach subset sv period disconnect weak connect section mobil machin abil store data store sell equip citi queri user travel data store citi download mobil machin request queri call creat view messag form request inform pittsburgh view holder call mc cach messag view holder track updat perform queri specif data pittsburgh increment maintain sv data commun mobil client view holder reduc amount wireless commun requir updat mc shown figur layer system architectur data server data close coupl fix network materi view maintain view holder agent data server layer period construct mainten transact updat data view static data view mainten techniqu number consecut version view remain static version view holder agent data sourc stop maintain view holder agent maintain version long applic session view holder agent server data server data data server data transact mainten creat wireless network cach agent cach agent fix network applic session mss mss mc mc condit monitor creat view mc acquir version cach creat view metadata view holder agent creat view version queri process librari commun profil manag figur overview view holder architectur buffer fix hold version special view space alloc updat attribut view dynam version maintain number version approxim ass execut mobil client time base rule rule appli evalu interact state comput user effect manag activ comput task figur mc pose queri creat view messag extend sql creat view statement statement sql extens call state condit invok view mainten creation version materi view statement cach agent mobil devic view holder agent resid fix network view holder agent creat view send sql statement queri begin monitor data sourc part condit relev occur view mainten queri request mobil client queri processor version creat view holder agent store version comput view cach agent asynchron obtain updat issu cach messag receiv view view holder agent current size data support tb preclud simpl solut duplic data mobil machin dynam maintain version request data avoid huge storag requir version dynam maintain incur huge storag requir view holder agent store version variat version store version entireti view request special portion inform data server data order magnitud smaller size view view holder agent view holder potenti support mobil client mc view holder agent aid mc stationari host fix network greater storag capabl incur commun cost main view holder agent maintain version latest version support disconnect oper asynchron commun view holder store version tradit scheme view holder agent offer support mobil client ffl maintain latest version data view holder agent prefetch data sourc mc wait updat comput connect prefetch perform client side network condit good mc cach agent gather data view holder agent ffl comput variat view version materi view mc request updat view holder agent reduc amount wireless commun perform commun view latest version mobil devic latest version store view holder agent view view holder agent reduc storag cost fix network maintain multipl version differ version store entir materi view view mainten transact transform materi view newli updat materi view materi view mainten separ consecut version view view holder agent view mainten transform order store net view mainten version materi view figur show relationship store version materi view view mainten comput commun differ version view mainten transact view mainten view mainten consecut view holder agent version version net view mainten figur view version view mainten order understand view holder agent section section present logic structur maintain version materi view illustr structur maintain commun cach agent logic tupl version version view maintain view holder agent logic data structur call logic tupl version version repres set version data tabl recent version interest smaller view equip shown queri cach agent contact view holder agent view holder agent answer util version data view holder agent maintain version cach agent latest top figur logic structur kei attribut attribut tupl maintain kei relev relat effici easier implement concurr control algorithm kei applic interpret store materi view data updat carri version current version garbag collect count show tupl version kei updat count dunham view holder vn view holder vn kei dunham updat count rei sport rei sport figur logic tupl version updat view holder agent mainten transact updat view version view recal tabl show materi view data version commit mainten transact execut version mobil client request latest version version prefetch view holder bottom figur dunham tupl chang version applic session version version version count reflect session util version requir view holder agent store version applic version store version view holder agent stop maintain version data maintain data view holder agent latest version attribut held show net effect version place request data sourc support explicit version view holder agent queri data sourc order extract data moment time attribut price extract data server integr data data case attribut view holder agent associ timestamp extract attribut order implicit attribut creat store queri catalog data determin time tabl modifi timestamp store data view holder agent build indic tree structur attribut base provid faster access repetit updat queri cach agent structur view holder agent store cach transfer cach agent indic built view holder agent materi cach messag cach agent reconstruct indic tree memori algorithm version mechan manag materi view view holder agent made maintain multipl view behalf mobil client addit data structur track set materi view maintain commun version cach agent process updat view holder agent exact differ version implicitli view version view holder agent comput latest null dunham version store vh version figur store multipl version cach agent tupl exist applic session suppli version number receiv view holder agent match version number order return request version proposit state largest version store equal proposit applic session request version exist map function version version content version correspond applic session request version requir view holder agent shown figur largest version store equal differ valu version version tupl differ version version updat differ version version delet tupl content view view holder agent send version part version cach acquir exact updat send valu mobil commun version save resourc happen valu tupl experienc chang commun reconnect cach agent differ latest version view obtain view holder agent data work disconnect store variat version applic save resourc view holder agent discard version mc complet applic session util version cach agent send discard version messag view holder agent count ass util version count safe delet version view holder agent tupl older version touch newer version section proposit develop garbag collect procedur delet tupl longer proposit tupl belong version belong version proposit implement garbag collect routin version view order creation main idea find version number tupl immedi determin delet safe exist version figur notic version mc make version number oldest version mc longer requir version number util version version oldest version question garbag collect routin safe delet tupl recal access version tupl view holder agent order return request version largest version store equal order find tupl question delet find result case delet tupl inform requir version possibl version tupl part version tupl safe delet version view requir tupl view holder agent algorithm concentr view holder agent prefetch maintain data possibl decid exact role view holder agent plai fix network success role list requir storag space fix network view holder ffl view holder agent store latest version found fix network cach agent order comput view build requir indic data valid procedur view holder comput differ view disconnect current ffl full replic view ass view holder agent mc exhaust resourc suspend activ applic reclaim space respect version process finish view holder agent copi data cach agent issu resend version messag ffl view holder maintain sv inform requir mc applic session cach agent subset data disconnect reconnect subset version mc perform calcul equip version view perform calcul golf equip long tupl part sv mobil machin possibl carri replic huge data volum corpor data server data view holder design dynam maintain version request tupl tupl request special portion inform smaller size question smaller expect data volum requir mobil client answer version carefulli access data materi view organ relat model manag sql statement relat model view holder oper citi product date total sale pre insert pittsburgh null updat pittsburgh ball insert eri glove null updat lancast magazin tabl data materi view interfac small commerci manag person oracl process data receiv sourc request data addit commun mobil host execut similar environ mobil client palmtop run expect data volum commerci convert sql code manag multipl version tupl simpl link list structur illustr assum view holder agent role data view shown tabl maintain version version reader time block materi view algorithm requir addit attribut oper pre version number mainten transact updat oper logic oper perform attribut date attribut total sale period updat mainten transact copi version updat attribut made current version held total sale previou version pre mainten transact updat current version held total sale reader version creat pre mainten transact previou current version attribut read figur view holder agent access version data oper attribut tupl attribut determin total sale pre attribut read tupl mc start applic request view data inquir dai dai sale equip store citi select total sale group date version algorithm link list data structur view holder agent call tupl version list figur maintain data version tupl data kei attribut attribut tupl link list version updat attribut mc list current version tupl current version number view holder agent local integ latest order list version number maintain latest version prefetch commun cach agent demand standard addit indic built desir facilit faster access repetit updat queri attribut latest version link list number mc kei attribut flag set latest request mc figur tupl version list main view holder maintain version latest version time version commit data space alloc latest version overwritten mc anytim mc start request latest ad link list version prevent overwritten mc send sql queri creat view view holder agent obtain latest result queri data origin version view holder agent deriv version data tabl show materi view data version commit mainten transact execut oper attribut tupl store data reflect net effect oper perform tupl execut mainten transact similar newest version attribut held latest pointer show net effect version place mc request view holder agent maintain version mc latest version view holder side figur recal flag latest version tupl mc tupl version version latest version number null version longer support latest version number version mc version mc null null null null null null null null pittsburgh pittsburgh pittsburgh ball pittsburgh ball eri glove eri glove lancast magazin lancast magazin figur version store oper citi product date total sale pre insert pittsburgh null updat pittsburgh ball delet eri glove updat lancast magazin tabl updat materi view initi updat mainten transact origin data server execut data creat version tupl structur mainten transact effect data mainten transact commit version data version tupl label version touch belong version consid expir mainten transact version view holder agent read version store latest version job view holder agent period monitor data server data updat version creat chapter time view holder agent request version view data suppli version number algorithm shown describ updat mc start applic cach agent track version session mc start applic spreadsheet graph latest version version number maintain view holder agent latest version tupl part link list save futur overwritten flag latest field mark tupl mh set time updat space alloc dynam latest version tupl side figur chang version version tupl notic version maintain view holder version latest version construct view holder agent data version mc space reclaim view holder hold save version view holder agent custom cach mc store version found data side figur demonstr version longer mc commun process updat view holder agent exact differ version implicitli calcul tupl entri null tupl delet differ version view holder comput easili chang latest version tupl latest version store cach predetermin token happen valu tupl experienc chang commun cach agent algorithm shown describ updat valu view holder agent relat manag system maintain larg amount data view holder agent version carefulli access data materi view organ relat model manag sql statement relat model view holder interfac commerci person oracl mobil client devic oper similar environ applic queri arrang relat tabl fix attribut updat attribut updat attribut total sale attribut version view maintain tabl latest hold prefetch valu data mc request version attribut uniqu id fix attribut local view holder agent creat tabl fix attribut integ citi product date date null creat tabl updat attribut integ vn integ total sale integ creat tabl latest oper citi product date date total sale integ gener tabl requir materi view maintain view holder agent tabl fix updat latest valu prefetch data sourc individu attribut tabl match specif materi view maintain shown algorithm figur relat tabl tabl latest prefetch result data mc request inform version figur version latest view read version tabl updat attribut read algorithm total sale version equal figur work view mainten perform data oper attribut commun view holder agent logic oper perform individu tupl oper attribut simplifi algorithm make easier inform requir view holder agent order comput view logic oper implicitli calcul view holder agent compar tupl version view older version exist tabl fix attribut chapter summari mobil cach data form materi view order maintain materi view disconnect dissert present servic mechan call view holder maintain version view requir mobil client data sourc stateless respect mobil client fix view holder agent made data sourc disconnect weak connect offer servic mc mc resourc remain contact data sourc perform view mainten due variabl network conveni mc receiv data time expir chapter present viewpoint implement view holder agent depend amount data cach buffer agent version dynam maintain view holder agent incur huge storag requir view small special portion inform found data sourc store variat variat reduc commun cach view holder agent mediat export view mobil updat comput deliv flexibl batch manner order maintain view holder agent creat custom view mainten mechan translat mobil machin request trigger constraint monitor program detail custom present chapter vn latest version queri version vn select sale vn group tupl find match kei found true append set end oper latest total oper latest end creat insert kei attribut latest total end end updat latest version number vn figur algorithm element true send mc cach agent send token end end append latest version number list version send latest version number mc cach agent figur algorithm tupl tabl latest queri fix attribut select fix attribut latest found oper insert updat valu oper insert updat valu end creat integ insert updat valu insert fix valu end end figur algorithm relat chapter program view mobil client person data access size todai data wareh environ internet abil provid vast amount inform shown todai user wai handl custom person inform gather mobil client increasingli import due storag differ mobil devic laptop amount inform commun profil condit view holder maintain state respect individu mobil client support view holder requir maintain view specif program specif time view view view holder agent program maintain multipl version view order effect sustain mobil client period disconnect greater flexibl custom amount data currenc consist achiev view cach mobil comput data data sourc view holder agent monitor sourc data mobil client resourc connect perform work part intercept agent resid mobil devic call cach agent pure data maintain deriv mainten procedur view holder agent execut materi program introduc extend form sql mobil client custom materi program addit inform mobil client give view holder agent client work import data plan custom reduc cost materi commun result deliv result queri mobil environ standard distribut environ due rapidli chang condit wireless commun requir user term data cost user pai commun tradit queri process facil gener concern minim time commun delai optim queri order minim resourc prefer user mobil user introduc delai chang data accuraci order save servic charg dissert concern user viewpoint queri data commun provid custom introduc type manag order make tradeoff decid data commun user view holder gather wireless network inform dynam current bandwidth avail cost match paramet prefer user suppli option user applic provid varieti view currenc consist option reduc commun comput fix wireless network obtain user inform view mainten commun capabl prefer addit ca select data maintain view holder ca make specif request data maintain commun view mainten prefer ffl role view holder plai interact mc number version view holder maintain ffl constraint determin view mainten occur commun ffl specif data import applic session ca view mainten prefer list user option respect data currenc option chang depend user applic queri scenario upcom plane flight user suppli gener commun prefer appli applic session user commun profil ffl maximum wireless commun cost ffl applic compress format queri result ffl maximum materi view tabl size cach agent accept ffl maximum minimum bandwidth capabl prefer view mainten prefer goal extend sql creat view statement creat view messag includ view mainten prefer ca user applic section show request servic view holder agent describ materi view requir sql statement includ criteria materi describ data invok updat view holder agent introduc condit data monitor view holder agent mobil user view view holder agent updat version data attribut contribut data sourc updat version gener attribut current price tabl item updat current price attribut updat version gener view holder agent data view relev data current price incorpor calcul attribut view holder agent monitor data version creat view select price updat transact condit creat customiz data summari requir ass condit creat version view data gener gener condit determin materi includ updat mainten transact commit transact individu price condit individu price combin price price transact chang occur specif data sourc chang occur sourc amount time minut minut ca plan disconnect specif number version data dw version custom sql statement extend sql creat view statement mc consist ten select mandatori option creat view select join logic express part typic sql statement creat view set select list attribut function retriev specifi tabl queri specifi condit select tupl tabl group specifi group specifi condit group select individu tupl order specifi order displai commun content materi view class provid custom sql statement mainten view mainten strategi view holder recomput increment chapter examin view mainten strategi section role role view holder agent present chapter role reflect version maintain role default role scenario view holder agent maintain version variat latest version mc latest obtain data sourc logic express condit materi price increment view mainten requir recomput view mainten addit option full partial recomput mainten full partial view mainten discuss section option provid full recomput view mainten default detect data sourc view holder agent receiv custom sql creat view statement mc includ condit describ view mainten occur custom request submit view holder queri process fix network perform sql queri repres view specif condit extens separ part materi view evalu condit evalu creat view statement tradit distribut queri processor subqueri individu data sourc involv sql statement result queri result formul origin version materi view time condit view mainten subqueri gener data sourc view maintain sql statement view util increment view mainten strategi strobe perform work view evalu part view holder agent materi program exampl tabl mainten transact version data view view holder agent read version prefetch applic session view holder agent learn relev occur data order answer question construct condit evalu solut ffl monitor view holder agent materi program period queri relev data order monitor data server data updat version creat ffl monitor view holder agent materi program queri catalog determin time tabl updat materi program compar inform timestamp data obtain determin relev ffl built trigger data server data sourc notifi queri process facil relev occur data server constraint base view holder agent receiv request cach trigger construct remot inform view holder agent relev data data data server stateless track interest ongo trigger option util monitor option valid possibl initi condit evalu part materi program monitor catalog scenario assum catalog inform time tabl attribut modifi store view data time creat monitor loop period check made queri catalog similar monitor monitor data scenario materi program monitor loop period monitor check relev attribut tabl condit distribut queri processor condit separ subqueri evalu condit remot data server problem custom queri process mobil client mobil client request queri process facil access data server fix network obtain result tradit queri process util remot procedur call messag fix execut view condit evalu part view holder materi facil directli access independ heterogen data server involv pose wide rang difficulti difficulti stem presenc ffl number messag bandwidth monitor data catalog requir constant messag exchang fix network data sourc involv evalu condit condit satisfi view evalu requir repetit view mainten queri relev data sourc high speed poll data sourc consum resourc view mainten strategi pick fewer sequenti round messag ffl late transform distil data time resourc fix network make reduct amount transmiss wireless link compress data obtain data sourc applic specif reduc amount data transmit data server provid function requir extens program enhanc data server form store procedur problem stem client dynam mobil compar stationari placement queri process facil fix ffl fix locat data tradit queri process facil advantag current locat mc answer queri replic data server data server closer current locat mc reduc commun cost latenc ffl static queri evalu tradit queri process facil make dynam choic data sourc evalu queri order account mobil devic resourc result data server larg compar storag capac mobil devic wireless connect refin queri filter requir transfer larg amount data fix network access mc discuss point tradit queri process method provid flexibl requir mobil client view holder servic mechan fix network support mobil applic perform queri process knowledg mobil client resourc custom queri process mobil agent mobil agent autonom program typic written java migrat machin network perform task machin agent host capabl unlik remot procedur mobil agent execut code migrat host host state mobil agent suspend transport resum commun share result obtain mobil agent applet java program download base user action execut host mobil agent ideal mobil comput environ task deleg mobil agent client disconnect improv latenc bandwidth usag cost wireless connect deleg task manner benefici standard distribut system problem load balanc mobil agent dynam move depend system current statu mobil agent resili common commun problem mobil agent decid altern host solut dissert explor emerg technolog construct view holder view holder agent materi program mobil agent equip capabl connect remot data server execut queri arriv data server pass secur attempt connect correct driver connect execut result store time travel host program queri trip plan execut queri search data dictionari find tabl attribut queri offer opportun send gener queri dynam refin inform obtain data dictionari execut specif data sourc asynchron commun scenario find inform send result back time view holder agent dispatch order perform queri process inform view holder agent underli schema tabl present remot data server execut view specif send queri result back view holder agent version materi view creat view holder agent creat materi program monitor data remain contact remot data server awar relev invok creation version receiv updat issu perform queri condit view holder process creat version present mc specif view data version request materi program execut flexibl requir queri trip plan action dynam adjust view holder architectur section describ individu compon view holder architectur shown figur section fix view holder agent cornerston architectur queri process commun profil logic tupl version element includ mobil support cach agent resid mobil individu data sourc ffl mc view holder agent maintain materi send queri creat view messag request version materi view cach messag view holder agent prior knowledg underli relat tabl view obtain knowledg queri catalog data server knowledg relat tabl relat kei return addit inform includ altern replic data site answer timestamp time data sourc tabl approxim size tabl inform access routin queri process librari ffl queri process set routin distribut queri process sql queri condit subqueri perform data sourc order fulfil request view holder agent present stationari host fix view holder agent share librari distribut queri process routin compil materi program avoid scenario view holder agent contact central queri processor ffl logic tupl version algorithm present chapter maintain version materi view requir mc comput commun view version algorithm requir overhead access maintain previou version tupl relat deliv variat version tupl requir access tupl relat tabl effect data sourc modifi order store multipl version data mc order occur disconnect maintain version applic addit version requir lot overhead case summari tabl attribut updat algorithm reloc fix network order closer mc maintain view close mc fix network mc move ffl commun profil manag job commun profil manag provid feedback ca chang effect queri profil inform storag limit mobil devic materi view mobil client request larger present mobil commun profil manag cach agent addit group attribut data broken manag unit laptop devic handl result smaller devic typic pda stringent storag limit mobil devic applic vari effect abil handl specif data encod mobil devic bandwidth approxim kbp cellular network user commun profil view holder agent prefer user commun afford compress format data encod accept inform construct distil procedur program queri result distil site fix network expect data server provid wide rang distil procedur transform data cach part view holder agent version transmiss time user chang profil request data form mobil support station exchang request inform view holder agent cach agent provid commun profil manag inform current statu wireless cellular network term current bandwidth capac cost commun profil manag collect inform set mobil devic contact recent order knowledg commun condit user area travel specif work cach agent intercept answer request applic session present mobil devic store version materi view receiv fix network track version applic session cach agent prevent applic session incorpor data session version match user awar inconsist incorpor excel tabl cach agent job emul data server provid applic transpar hide applic detail oper mobil environ data sourc agent host capabl server support java environ captur java base data sourc suppli inform intern schema altern replic data site data sourc awar client mobil version mechan creat cach materi view custom view currenc sql queri repres view specif condit extens separ part materi view evalu condit evalu initi materi view choic view evalu mainten base tabl data sourc maintain view recomput view increment view mainten recomput mainten custom view currenc view view store chang view updat occur queri evalu adjust view perform queri comput collect exact updat data sourc view implicitli calcul store increment view mainten recomput view mainten break view specif subqueri data sourc combin queri result creat updat view store newli updat view tupl view figur differ increment recomput view mainten increment view mainten strobe algorithm present chapter updat perform data sourc report mainten mechan mechan queri data sourc learn made materi view queri result return mainten view due latenc inher receiv action addit queri requir recomput view mainten view specif complet recreat view scratch relev subqueri perform data sourc result combin order materi view materi view creat compar older materi order learn exact occur view mainten figur summar differ basic view mainten paradigm multipl sourc anomali increment mainten anomali occur latenc inher receiv queri comput view comput view updat occur data sourc account recomput mainten requir exact data sourc comput view multipl sourc anomali occur increment view mainten suitabl data wareh environ volum data larg limit time prohibit run long recomput view mainten transact increment view mainten data slowli absorb incom updat increment modifi materi view block data reader long period time type mainten requir storag space intermedi result data transfer fix network cost increment view mainten collect updat perform data sourc order comput view send possibl round queri queri data sourc dozen data inform system increment view mainten techniqu scale view holder environ data wareh environ amount custom data request mobil client order magnitud data mobil client view holder agent fix network recomput view mainten method suitabl perform recomput captur updat perform data sourc comput view reconstruct natur period disconnect weak connect recomput result store view holder agent recomput mainten easier implement incur fewer latenc round queri longer requir small amount data storag space requir intermedi result order magnitud smaller requir data wareh environ subqueri request data sourc recomput recomput view fix network agent travel data sourc transport result reconstruct materi view backtrack perform queri site visit view holder approach shown figur recomput complex increment view mainten occur fix network view increment commun wireless link cach agent resid mobil devic view holder agent comput possibl version materi view section provid distribut queri process librari routin construct materi program perform recomput view mainten monitor loop evalu condit view fix wireless agent applic mobil client view holder client agent increment view mainten recomput increment view mainten dbm agent server figur view mainten fix wireless network perform analysi section show recomput view mainten typic perform increment mainten fix network custom materi view mobil client perform recomput view mobil agent full advantag small size custom materi view held view holder agent view holder agent middlewar compon provid benefici option commun comput fix wireless network tabl tabl queri build view holder materi program start queri reflect join data tabl data server requir monitor data sourc tabl show state base tabl construct materi view queri creat view select updat role mainten recomput queri reach view holder metadata inform tabl inform obtain individu data sourc inform gather queri process materi program form type construct materi ffl coordin part materi program coordin coordin resid data sourc dispatch condit evalu data sourc monitor condit coordin launch view evalu version coordin dispatch view evalu ffl view evalu version materi view view evalu travel data execut perform join ffl condit evalu data sourc monitor condit evalu dispatch resid data sourc notifi coordin condit satisfi version construct data server creat materi program coordin perform monitor launch view evalu recomput view chang tabl occur creat materi queri express queri languag valid scanner identifi languag parser check syntax queri determin grammat correct intern queri queri tree creat queri tree creat execut strategi access data obtain result execut strategi combin monitor loop condit call materi program strategi execut strategi determin code gener gener code execut plan code execut data server project view holder agent queri tree recomput view evalu figur queri tree queri view queri tree figur execut queri tree consist execut intern node oper operand replac intern node tabl result execut operand queri tree figur reflect queri trip plan view evalu order perform join data server condit satisfi data join result join data select tabl queri tree built modifi suppli effici strategi execut distribut queri current distribut queri process algorithm goal reduc amount data transfer execut optim criteria distribut queri execut strategi modif approxim tabl size metadata tabl size code gener perform join strategi reflect queri tree order reduc amount data transfer fix network code gener distribut queri process view holder agent build launch coordin evalu condit view evalu recomput materi view queri complet materi program shown figur recomput version materi view launch view evalu mobil agent process data sourc view holder agent order launch associ version number view evalu data mobil agent buffer execut order version number note method requir notion global version number local maintain variabl coordin materi program present reflect worst case scenario brute forc method perform condit evalu compar valu tupl tupl special differenti util reduc cost comparison delet differenti detect rememb total number tupl tabl count compar current result arithmet oper requir order determin view evalu launch note retriev attribut queri select local variabl version number start view suppli queri trip plan queri result launch view evalu queri trip version number begin select version number start view suppli queri trip plan queri result launch view evalu queri trip plan current version number end end figur recomput materi program view coordin condit evalu condit evalu part materi program requir multipl condit evalu cond cond cond cond examin separ requir coordin resid launch condit evalu resid coordin condit evalu version number condit result coordin current version number version number prevent materi view version recomput case multipl condit evalu send result coordin cond cond requir mobil mobil agent work creation view version store result time condit true condit evalu data server time condit satisfi materi view built condit satisfi version condit cond cond figur show state data server combin form state materi view time condit satisfi version materi view start coordin condit satisfi entir version materi view creat view evalu satisfi condit coordin view holder agent initi view condit satisfi site version number figur evalu conjunct condit import rememb remot data server part condit part recomput materi view condit view evalu remot data server visit queri trip plan partial materi view currenc inform user custom creat view statement view mainten occur inform condit avoid full recomput materi view condit satisfi condit data import user queri condit updat reflect tabl hold interest user applic session updat order process deliv partial materi version view creat combin detect condit evalu data store view holder agent perform entir view recomput condit evalu separ requir messag updat deliv condit evalu view holder agent directli updat chang specif variat save wireless bandwidth requir full recomput view view holder agent initi view final view figur partial view materi figur show partial materi user applic session receiv specif inform data transfer wireless commun partial view faster fewer mobil agent recomput part materi program view fulli recomput valu data server involv view specif period order creat view state correspond state data sourc shown final converg view creat figur custom view consist mobil client enter period weak connect disconnect addit limit batteri view holder agent build queri result form materi view view holder agent provid view consist mobil client cach consist commun capabl vari fix wireless custom level view consist applic view mainten oper match prefer user applic access consist mobil applic trade consist commun cost improv condit effect view currenc goal understand level materi view consist applic view holder approach recomput view mainten recal chapter strobe algorithm offer level materi view consist order difficulti weak strong complet level consist reachabl view mainten algorithm depend updat scenario singl updat global data sourc involv view specif dw dw strong consist dw dw weak consist partial consist progress consist figur level view consist recomput view mainten understand view consist affect mobil view currenc custom recomput view mainten addit view consist level call partial consist analog view consist achiev partial materi section call progress consist repres view consist achiev view fulli recomput time condit satisfi figur show level relat snapshot consist level defin level weak consist strong consist view holder access data sourc complet list consist level recal chapter data defin sourc state seq ss ss final base data state updat commit seq final state sequenc view state creat view recomput perform individu view state seq store version view holder agent mobil client applic session request state sourc state state sourc data moment time repres content base tabl sourc sourc uniqu id moment time sourc state vector element compon vector visibl state sourc view state snapshot consist sourc state defin partial progress consist form view consist slowli advanc weak strong consist note constitut transact depend sourc updat scenario definit weak converg hold view state reflect valid sourc state data sourc sourc state vector data sourc execut serial schedul transact creat xs entri sourc state vector definit partial view state data sourc entri sourc state vector denot ds ds data sourc ds partial consist mean weak consist hold exist data sourc ds ds ds ds definit progress view state data sourc entri sourc state vector denot ds ds data sourc ds progress consist mean weak consist hold exist data sourc ds ds ds ds definit strong weak consist hold order time view state match order sourc state sourc state vector ds ds state data sourc set transact execut exist map view sourc state execut transact ffl view state reflect valid sourc ffl view state reflect valid state data sourc schedul updat data sourc view reflect set commit transact data sourc true progress consist updat occur data sourc visit queri trip plan number figur compar recomput view state make currenc data made visibl queri trip plan progress consist make success view state data currenc predecessor partial consist reflect condit evalu recomput entir queri trip plan execut condit satisfi progress consist reflect full recomput view mainten due separ condit view evalu materi full recomput activ chang level view consist partial progress view consist data sourc oper updat scenario weak consist applic mobil agent scenario mobil agent possibl read older version data data sourc read version data run assum rest chapter mobil agent read recent attribut valu data sourc custom recomput consist level view custom data access monitor trigger individu data sourc requir strong complet consist algorithm execut updat transact perform data sourc recomput mainten chapter requir collect exact happen data sourc examin updat scenario recomput view mainten defin recomput consist reason custom recomput correct recomput consist explain view state sequenc creat make ensur monitor updat data sourc chronolog reflect view state mobil agent recomput view creat view visit data sourc perform subqueri view specif content data sourc ds view evalu compon sourc state vector assum entir view recomput monoton sequenc sequenc number process data sourc view holder agent order definit custom recomput sourc state vector reflect current state data sourc view state sequenc seq final reflect mobil agent recomput view mainten consist exist function view state sourc state vector ffl converg final final mean final view state deriv final state data sourc ffl weak consist data sourc execut serial schedul updat transact creat xs entri mean sourc state vector valid reflect actual updat occur data sourc ffl data sourc view mainten view state correspond current state data valid state exist time ffl view state success view state correspond success sourc state vector ffl custom condit data exist vector entri ds activ monitor trigger condit sourc state vector reflect updat custom data currenc theorem partial progress consist stronger weak consist properti weak hold partial progress consist view state base valid data sourc partial progress consist call view state order view state view state view state sequenc definit recomput consist weak consist properti theorem progress consist stronger partial consist proof progress properti partial updat custom data currenc expect data sourc compon sourc state theorem strong consist stronger partial progress consist strong consist requir view state compon sourc state vector correspond data sourc set transact execut sourc state vector ds ds state data sourc set transact execut partial progress consist strong exist map view sourc state execut transact view state reflect valid sourc state vector case data sourc recomput view creat state obtain data transact arriv transact execut exist map strong consist hold lemma monitor trigger progress consist updat scenario assum monitor trigger read current valu attribut base tabl condit satisfi long entir view recomput monoton sequenc sequenc number process data sourc view holder agent monitor trigger view currenc custom progress consist strong consist mean order time view state match order sourc state set transact execut updat past execut data sourc queri trip creat view strong consist hold complet requir sourc state reflect order materi view period queri catalog data skip updat occur data complet weak consist occur state materi view reflect valid updat occur data view reflect set commit transact data sourc global transact gt site gt site weak consist result gt scenario state materi view deriv sourc state gt sourc state gt execut view creat reflect commit global transact weakli consist respect data sourc lemma monitor trigger weak consist gt updat scenario case global transact atom commit protocol global transact gt condit ds ds loss assum monitor trigger condit evalu initi recomput view gt commit monitor trigger awar complet global view version creat reflect commit global transact version cach mobil client weakli consist respect data sourc case global transact atom commit protocol global transact gt gt condit evalu ds monitor trigger condit evalu recomput view gt commit global transact atom commit gt commit gt commit updat obtain transfer order complet recomput view obtain result creat commit gt arriv gt commit result gt part materi view version reflect commit global transact lead weak consist respect data sourc increment view mainten condit discuss recomput method view holder agent data sourc strobe algorithm increment maintain materi view built distribut data sourc algorithm collect insert delet oper perform data oper increment build newli updat materi view comput portion view updat oper condit evalu mobil agent util trigger constraint collect updat transact occur relev data sourc strobe algorithm creat version materi view maintain method view holder agent condit satisfi action list creat strobe appli order increment gener version materi version commun mobil client condit satisfi strobe mobil client execut period weak low batteri mobil client capac send strobe messag messag complet increment algorithm major advantag view holder agent fix network free mobil client condit determin level view consist achiev trigger data sourc view holder agent introduc condit account determin updat scenario level view consist maintain strobe algorithm updat scenario depend type transact updat data sourc tabl show updat scenario creat view holder agent updat scenario data sourc condit updat scenario figur section level view consist strobe algorithm data sourc oper updat scenario condit match case updat determin level view consist strobe algorithm mobil agent perform recomput increment view mainten view holder agent fix network order achiev custom view currenc relationship level materi view consist data sourc condit updat scenario gt case individu attribut gt price case specif tabl data sourc gt case condit case gt case sourc gt case individu attribut condit gt price case mainten commit dw gt transact case specif number version gt dw version case specif amount time gt minut case condit gt case condit case gt tabl condit updat scenario achiev view mainten paradigm fix network shown figur perform recomput increment view mainten view holder approach recomput complex increment view mainten occur fix network examin oper recomput increment view mainten fix network evalu perform mobil agent achiev paradigm issu metric assess impact algorithm approach fix network resourc main network resourc evalu fix number messag messag size metric goal weak partial complet strong progress converg figur level increment recomput view mainten consist perform analysi establish respect cost mobil realiz view mainten paradigm measur context size messag reflect amount data transfer bandwidth usag relev network lower throughput older network number messag sequenti exchang high speed wan lan recomput increment view messag sequenti algorithm smallest number messag round build version perform network metric context perform evalu construct number messag exchang size algorithm approach updat transact evalu compar perform basic strobe algorithm increment view mainten recomput view mainten queri discuss section materi program strategi shown figur queri requir condit evalu data server condit satisfi version materi view mobil client applic session perform evalu recomput mainten figur show materi view queri recomput condit evalu data server condit evalu host data sourc data captur incom condit evalu authent load jdbc driver connect made trigger instal condit recomput launch visit remain site order reconstruct view queri dbm agent dbm agent recomput rebuild view tupl subqueri updat tupl subqueri updat tupl subqueri updat trigger view view holder agent step step step instal entir view time figur perform model recomput queri data data server dsi valu number updat updat transact commit site dsi process updat halt due arriv queri recomput view evalu number tupl result evalu subqueri data server dsi concern larg base tabl data number result tupl gener transfer correspond amount data transfer bandwidth recomput view evalu travel data sourc data condit evalu visit site recomput view evalu visit remain data total number messag term size condit evalu gather data data sourc recomput transfer tupl data sourc join primari kei perform creat messag size number tupl result tabl recomput travel result data sourc final recomput version size version transfer recomput mobil agent view holder agent number data sourc sourc number messag size transfer site messag size creat transfer site recomput view data ffl total number ffl total size messag data perform evalu increment mainten figur show queri increment maintain data server strobe algorithm mechan awar updat transact host data sourc data captur incom authent load jdbc driver connect made trigger instal condit evalu data server report updat evalu condit condit satisfi messag view holder agent make version client updat occur data notifi view holder agent strobe algorithm mechan strobe queri messag data sourc join made strobe queri messag gener updat join newli insert delet tupl report data sourc tabl data sourc data server strobe queri data server repli strobe queri answer return increment updat eventu insert appli materi view result updat occur data server shown figur exact chang comput view appli materi view addit updat occur data sourc strobe process addit queri order adjust final result view messag similar strobe messag relat overlap pend strobe messag eventu answer store action list strobe algorithm mechan pend queri answer final result action list appli creation version materi view updat assum updat process concurr updat creat lower bound number size strobe answer messag gener increment mainten similarli section data data server dsi valu number updat updat transact commit site process updat halt due condit satisfi number tupl requir dsi order recomput entir view data singl report sourc updat messag resid data sourc di strobe messag comput part view strobe addit answer return view holder agent strobe mechan condit condit evalu send messag view holder agent version client total number messag correspond condit sourc updat strobe answer term size sourc updat strobe final condit messag size strobe messag part view singl updat process creat lower strobe messag reach data sourc answer return size portion total number tupl exist final version view answer messag portion final view integr comput view size ffl total number ffl lower bound total amount data condit messag sourc updat messag strobe answer messag dbm agent dbm agent view holder agent strobe algorithm coordin increment action list view insert period make view dbm agent trigger sourc updat queri updat updat updat total tupl total tupl total tupl strobe queri answer figur perform model increment mainten number messag recomput increment tabl number messag view mainten mobil agent size messag recomput increment tabl size messag view mainten mobil agent perform analysi cost condit recomput strobe increment view mainten mobil agent evalu metric comparison number messag size tabl clear fewer messag harder evalu size messag bandwidth cost observ total size messag recomput depend primarili size valu reflect size subqueri evalu recomput data sourc dsi total size messag increment view depend primarili number sourc answer messag requir messag order comput exact view comparison recomput view increment domin factor comput total size messag updat data infrequ condit tabl make strobe increment mainten choic data wareh environ larg materi view tabl handl infrequ updat data sourc batch sourc strobe algorithm design specif data wareh environ updat data tabl ae make recomput mainten choic updat mean higher chanc condit satisfi recomput total size messag small increment view frequent updat number messag total size prohibit strobe larg updat small updat larg tabl size recomput high speed network increment small ae tabl size recomput recomput high speed network tabl analysi condit recomput increment mainten updat data sourc condit infrequ tabl probabl algorithm approach similar messag size bandwidth cost high speed network small messag size order reduc transmiss delai import number recomput choic show scalabl recomput view mainten number data sourc increment view mainten techniqu scale algorithm collect updat oper perform data oper increment build materi view comput portion view updat process happen incur oper occur data sourc overlap view queri creat oper view increment built increment mainten updat collect held latenc inher receiv answer strobe messag request commun delai delai send receiv add number subsequ messag number data sourc latenc receiv answer strobe mean sourc updat process messag number data sourc process increment data valu remain constant number data sourc ae recomput view mainten choic major advantag recomput mainten fix network free collect inform updat occur data sourc recomput view mainten scalabl fix network increment import applic includ current internet applic view remot web maintain client implement view holder mobil agent due common implement virtual java increasingli popular languag creat distribut applic java program run wide varieti support secur remot method invoc emerg mobil agent technolog develop mobil agent system develop specif java mobil agent system similar architectur server machin captur incom agent agent current state inform load environ agent resum execut java base system server run agent thread server process compil agent execut faster overview current mobil agent ffl aglet aglet lightweight mobil java object develop ibm japan carri program uniqu trip plan binari java code simpl aglet kilobyt varieti messag facil interag commun aglet equip capabl data sourc oper server support java environ incom pass secur attempt connect load correct java connect driver jdbc driver desktop distribut system includ driver creat specif microsoft sun system correct driver connect execut result store dispatch method perform destroi agent send code object state machin ibm agent transport protocol ffl concordia similar java base mobil agent system agent carri itinerari site visit dynam adjust time agent object code data save persist store machin order protect agent loss due machin crash agent encrypt move ffl jump bean java base mobil agent system central server agent pass machin simplifi agent administr weaken perform data sourc machin host mobil agent run jump bean agenc jump bean domain central server domain server center track agent authent mobil agent move agenc agenc carri send messag time agent domain ffl nomad java base mobil agent develop west florida institut human machin cognit agent execut captur code control state incom mobil agent resum exact point suspend determin entri point agent state input separ instanc java virtual machin vm share code class librari nomad suppli strong secur measur strictli control cpu usag agent agent grant write access ip address flood network continu write address oasi support multipl handler migrat messag includ agent send result network agent state compress transfer ffl voyag distribut process queri reliabl heterogen problem allevi mobil agent system built interact corba java base mobil agent system integr corba develop objectspac call voyag agent move code data locat autonom time invok method arriv agent object invok method choic agent object move leav forward object send messag locat agent made persist facil group multicast commun dynam view system dynam view system prototyp develop pittsburgh system group collabor util voyag creat system compon view holder approach view remot web dv consist type mobil java internet remain ffl assist agent resid server incom jdbc perform sql queri ffl dictionari central compon prototyp locat data server maintain metadata track materi view maintain view holder agent mobil view agent locat initi access point client creat queri materi view dv mobil java internet agent mobil ffl dictionari agent resid client obtain dictionari gui queri sql ffl dictionari messeng agent creat dictionari dispatch client dictionari ffl creat dictionari order obtain metadata inform remot data server queri catalog ffl view agent holder agent creat demand dictionari creat materi view data perform view execut queri view view materi algorithm implement store separ java object implement task view agent load librari dynam chang view materi algorithm view agent reloc closer client serv client mobil client queri request creat client dictionari dictionari dictionari messeng agent materi view dictionari contact view agent client request client creat dictionari obtain metadata view data messag assist agent agent metadata inform store client queri formul dictionari receiv view agent maintain view dv viabl infrastructur mobil agent dynam materi view remot architectur maintain inform remot client defin view maintain fix network futur client view agent reloc stai closer client serv creat view mobil client oper wireless environ prevent mobil devic directli queri remot data sourc deplet limit resourc asynchron commun support mobil client pose receiv mobil agent dv platform independ deploi web chapter summari person inform gather mobil client import due storag differ mobil devic vast amount internet data chapter present extend form sql mobil client custom materi program execut view holder agent materi program condit evalu view monitor data sourc updat view sourc occur extens condit criteria materi describ data invok creation version view holder agent creat view statement tradit distribut queri processor subqueri individu data sourc time condit satisfi view recomput increment maintain tional queri process facil execut materi explain difficulti inher approach due presenc custom client mobil view holder approach custom view mainten ideal util emerg mobil agent technolog mobil agent equip capabl autonom travel data sourc execut queri chapter individu compon view holder queri process commun profil logic tupl provid show materi program creat differ recomput increment materi program strategi discuss increment view mainten requir sourc updat report view holder agent queri perform view comput recomput view mainten view specif rebuild view data sourc view comput reconstruct view holder approach increment recomput view mainten happen fix view commun wireless network mobil comput order process deliv updat introduc partial materi condit evalu incorpor view updat perform entir view recomput commun capabl vari fix wireless custom level view consist mobil applic trade consist commun cost improv understand view consist affect mobil view currenc custom recomput view mainten introduc addit level view consist level view holder agent make ensur monitor updat data sourc oper updat scenario chronolog reflect version maintain mobil client chapter formal defin custom recomput consist prove properti consist hierarchi view state chronolog properti recomput consist success view state correspond success sourc state vector explain increment view mainten affect mobil view currenc custom translat condit level increment view consist perform analysi recomput increment view mainten fix network present metric evalu number messag messag size requir view mainten algorithm approach util increment view mainten suitabl data wareh environ volum data larg limit time messag small order comput exact view recomput view mainten smaller amount data requir build view transfer fix data sourc updat frequent client view holder agent make view mainten request recomput scalabl view comput reconstruct overview current mobil agent technolog dynam view system develop creat maintain materi view remot web show feasibl util build underli system compon view holder approach chapter view holder data process chain data cach mean support disconnect mobil oper view holder maintain specif version view greater flexibl custom amount data currenc consist achiev view cach mobil comput data sourc mobil machin autonomi mandatori period autonomi lead network commun faster frequent commun result slower time due limit bandwidth wireless deplet devic batteri view holder reader mobil client store data deriv base data sourc updat concurr execut updat directli data sourc applic session run mobil client read view data deriv consist state data sourc subsequ queri applic session answer materi view version result obtain chang queri queri calcul perform mobil client consist sequenc queri execut period time version view applic session mobil client case time pass client requir recent higher data currenc discuss view holder agent version adjust view currenc cach mc cope disconnect oper underli assumpt ass independ execut isol result updat affect result mobil execut environ assumpt hold present enhanc view holder servic facilit propag result ass servic identifi data depend view version result detect inconsist order result produc older version incorpor newer util recent data process call result propag provid clear benefit mobil client persist time applic session submit result view holder agent store fix network view holder agent persist store mobil devic devic version requir result produc mc exhaust resourc suspend activ reclaim space respect version finish view holder agent copi version requir intermedi result store extend lifespan version materi view store view holder view repres exact appli commun mc tupl read produc result coincid view holder result version materi view result produc submit view holder agent determin calcul incorpor newer applic util recent version view result produc propag version view extend lifespan result continu util extend recent applic session share result view holder agent comput period time lifespan measur result applic session valid store result creat increment access data remot data server order obtain increment step data data creat content view version result store data read extend long inconsist detect data process chain refer notion data propag incorpor success applic session item line current price glove video golf store sid citi manag manag bonu dunham pittsburgh ms dunham eri mr rei sport pittsburgh mr atkin sale sid quantiti sale price date tabl tabl data server earli detect result produc incorpor version view view holder agent awar conflict result produc updat occur base data sourc disconnect view holder agent notifi inconsist user applic session decid abort discontinu action applic specif reconcili inconsist illustr concept benefit discuss formal subsequ section motiv data server base tabl sport good store tabl shown includ store sale individu item transact inform recal view holder agent materi view deriv base maintain separ version view materi call period total sale store version number transact updat tupl assum tupl largest number belong current version view tabl show materi view version sid line dunham golf dunham rei sport rei sport dunham golf dunham rei sport rei sport tabl view holder view condit satisfi recomput increment view mainten perform note view mainten transact creat version view includ sale transact made store sid mobil client request queri equip sale result materi respect version view mc cach materi produc rough calcul sale equip rei sport store spreadsheet valu rough calcul sale equip dunham store base worth equip mc receiv current sale figur version due airplan flight commun delai plane user start applic graph tool upcom present point recent inform version incorpor applic session question previou result older version data valid tupl inform rei sport store chang version calcul produc respect tupl valid version calcul incorpor calcul perform amount equip sold dunham tupl chang updat tupl reflect view comput commun mc version request calcul incorpor import note version materi view maintain view holder agent continu conflict detect commit tradit lock timestamp concurr control algorithm impract mobil environ due possibl long period disconnect transact mention chapter introduc coda file system order detect conflict failur atom perman user cach edit sourc file build program disconnect librari file updat data server link updat conflict program automat detect conflict reconnect make file access program remain unchang begin program creation point time valid similar goal view holder servic provid detect conflict result share propag ass version type data data mobil client intermedi final result made visibl data sourc directli mobil client data commit data server view holder agent ffl data written back base tabl data deriv view maintain view holder agent data result comput perform ass written back base tabl result store futur constitut result view updat perform base data storag propag process result share ass ffl data written back base tabl attribut materi view maintain view holder agent base data updat ass written back base data sourc amount equip sale gener affect updat manag bonu attribut shown tabl store attribut part view maintain view holder ass modifi bonu updat commit data sourc ass activ final valu complet formul propag process updat creat multipl ass mc integr view holder agent order make data consist current version view written back base data sourc result data process chain data server data server data server view holder agent version version locat input input input process view mainten final version depend queri www result propag mc figur mobil client data process chain disconnect mc execut ass creat result view base tabl updat cach view holder agent view lock data data server view holder agent oper mc comput solut involv cach data reconnect improv commun attempt integr result ass view holder agent applic session run mc read view data deriv consist state data sourc view state view holder agent view state seq mc receiv recent version client run ass access separ version view view time figur show data process chain work creat view holder agent version materi view request input input possibl combin inform geograph locat mobil devic order produc result data layer disconnect period qualiti store view holder agent coupl tupl materi view version addit applic session start recent version view state input coupl individu tupl ass comput finer granular inconsist detect version produc access ass oper materi view propag process success view version extend lifespan result view updat increment comput success view version ass consid consist success view version input creat consist success tupl creat updat gener definit definit consist propag version tupl creat updat version result data layer propag call lifespan window state version view holder agent expir data sourc stop maintain propag latest version obtain view holder agent older version produc check view holder agent order persist store access view holder capabl store state mc recoveri lifespan window goal result propag result gener mobil offer higher avail data organ gracefulli degrad amount consist achiev result creat mobil client data sourc consist level consist offer chapter build version materi view refer consist version construct store view holder agent result produc mobil client consist desir larg lifespan window depend view result updat creat mc achiev desir consist lifespan window depend avail cost wireless network capabl mobil client divid creation view holder agent consist lifespan result updat produc disconnect older data valid long consist specif number version view holder agent scenario result gener period time group version repres month sale figur result integr month gener earn graph analysi applic lifespan window version span month sale integr version window integr span applic lifespan window abort recalcul integr applic lifespan consid commit final version lifespan scenario lifespan window includ final version mobil client store result part final version view holder agent view long mc result propag final applic session abort forc run reconcili procedur mc condit commit final version view holder agent creat result propag final version reconcili requir lifespan window span initi version final version store mc updat written back data sourc ass complet long consist final version view holder agent submit updat base tabl commit figur show entir execut model mc view holder agent updat written back data sourc lifespan window includ final version view lifespan window requir submit view holder agent cach version produc send view holder agent valid propag version resolv abort invalid notifi mc send result view final storag invalid notifi mc send updat base tabl lifespan window valid figur mc view holder execut model view holder propag model figur show conceptu view holder agent maintain result mc mc start request specif amount data sourc maintain view holder agent materi view subset view data store depend storag capac mobil machin individu ass read tupl cach subset creat set core tupl read version materi view call read set oper mc read version view holder agent materi denot produc set tupl read creat ass result mc data layer creat disconnect submit propag layer integr version data read produc layer version creat data sourc tupl applic oper mc request data tupl creat result store condit version data view holder version set tupl version show made read tupl data server data server materi view version version version cooper data forward propag backward propag view tupl view tupl applic figur result data layer version integr result depend content version case figur ffl read case result exist version part chang call backward propag data layer ffl read case result exist version exist creat tupl modifi version version call forward propag ffl read case result exist version propag version tupl part version rule propag result propag provid rule share propag creat mobil client ass result updat thought materi view deriv view holder agent tupl granular detect inconsist tupl defin set tupl result updat deriv tupl call core depend definit core depend set core tupl version view holder agent set result data layer deriv core tupl set version set core tupl ass result deriv set core ffl forward ass result deriv set core version view holder agent produc forward propag version version ffl backward ass result deriv set view holder agent produc backward propag version version addit rule integr version view holder ffl attempt forward backward propag layer version view ffl view version attempt forward propag forward propag latest version view depend lifespan ffl commit commit successfulli forward backward propag applic lifespan abort reconcili ffl final version condit commit final version view holder agent materi view ass complet mobil client integr commit successfulli forward propag abort reconcili propag view holder agent oper granular materi view tupl view holder agent creat ass cach subset inform sale issu cach creat view select ts holder figur show content cach inform version materi view addit ass start latest version recal chapter proposit order read version materi cach agent receiv largest version number equal tupl view holder agent attribut chang version version rei sport tupl store kei sid refer dunham store sid rei sport view holder vn kei dunham sid rei sport sid kei view holder vn updat count dunham sid rei sport sid updat count figur logic tupl version view holder propag store view holder agent layer automat propag forward backward version tupl implicitli calcul version view tupl consist ass figur show scenario build shown version mc request version start applic session read rei sport tupl creat result tupl rei sport version occur base tabl data view holder agent build version view incorpor dunham tupl version ass tupl rei sport part mc read version tupl read unchang tupl version impli data layer tupl rei sport automat propag forward version mc mc mc cooper mobil read rei sport rei sport dunham view version cooper data dunham materi view version dunham dunham rei sport rei sport rei sport figur result data layer figur figur version integr data layer dunham read tupl dunham propag order produc result data note read core set dunham rei sport tupl definit core depend result deriv core set core set set core dunham rei sport build data layer cascad manner includ data layer read ensur result view updat produc propag forward due data layer note figur concentr circl includ result data layer store view holder logic structur similar figur show view holder extend store individu produc ass figur core set tupl read materi view store lifespan window repres core primari kei tupl read store version store view holder incorpor end kei view holder vn dunham sid rei sport sid updat count core rei sport dunham rei sport dunham result data layer lifespan window begin figur view holder store version attempt propag version view version rule sg end lifespan window updat includ version commit updat base tabl discuss creation detect conflict version materi view maintain view holder agent granular conflict detect tupl level core figur resolv conflict conflict detect propag compar tupl version concentr circl mean innermost circl consid valu submit store view holder agent outermost circl repres valu written creat core set shown figur integr valu order circl matter order import resolv conflict interpret committ innermost circl produc remain place read data layer chang valu accord valu submit possibl outermost circl replac innermost recent produc part final valu submit base tabl ass complet interpret notifi ass conflict resolv lifespan window data layer produc ass maintain view holder agent includ final version materi view valu submit base tabl util asynchron cooper dv prototyp section system architectur view holder compon mediat data sourc mobil client dictionari track materi view maintain view agent locat view agent creat materi view data perform view execut queri view view agent store result creat mobil client util view view agent cooper work repositori cooper facilit ass execut mobil client share produc extend tradit function proxi capabl facilit cooper user ffl flexibl data view holder agent mechan adjust currenc data store mobil particip client client join cooper effort read newli updat deriv data result produc version view respect ffl cooper work individu result view updat newli cooper work provid process integr creat mobil client check data rule definit defin ass mc hold ass multipl mc applic session execut mc integr process rule integr share remain chapter summari mobil data cach form materi view previou chapter agent mechan fix network view holder agent maintain version view requir mobil client applic session view holder design reduc comput wireless commun view version cope disconnect applic session access current data invalid result creat result propag inconsist detect view result updat creat disconnect integr view holder agent origin data input data layer consid valid long propag lifespan window updat propag final version view commit base data sourc rule suppli govern creation share group applic session possibl execut mobil client show inconsist detect view holder agent share proce asynchron cooper dynam establish view holder agent chapter dissert present develop customiz view mainten servic client oper mobil environ middlewar mechan enabl servic call view holder view holder gather maintain materi view data sourc cach mobil client custom view currenc view consist order overcom limit work mobil environ access consist mobil client trade consist comput commun cost improv contribut dissert taxonomi mobil architectur view holder emploi mobil comput model address problem maintain inform form materi view agent cach agent intercept applic call emul server disconnect request data mobil client applic session granular cach relat system tupl sql queri oper disconnect issu queri cach materi provid applic request data sql statement run mobil devic contribut cornerston view holder creation fix network middlewar consist view holder agent view holder agent agent maintain version view request mobil client cach agent interact data sourc behalf mobil data server remain unawar mobil vari connect client mobil client resourc remain contact data sourc perform view mainten order provid servic mobil client dissert present notion person view mainten view commun custom cach applic suppli view holder agent addit inform reduc cost materi commun result person suppli wai commun user mobil devic suppli inform affect commun distil wireless cost prefer extend sql statement criteria call specifi view mainten occur role view holder affect number version version data occur user disconnect plane flight read updat deriv data necessarili discard work perform older version flight main contribut dissert introduct extend form sql mobil client custom view materi program view holder agent queri process librari creat custom materi program translat mobil devic extend sql request trigger constraint monitor loop view recomput increment maintain fix view commun wireless network mobil comput execut materi program tradit queri process facil drawback late filter state queri evalu high messag bandwidth fix locat data manag dissert examin mobil perform view mainten fix network arriv data server pass secur attempt connect correct driver connect execut result store time travel host materi program queri trip plan execut queri view holder agent creat materi program monitor data remain contact remot data server awar relev invok creation version version store view holder agent logic data structur logic tupl version algorithm discard version store implement code link commerci relat manag sql statement data currenc custom condit materi program condit specifi condit exist data sourc view mainten occur updat data sourc batch period prefetch view holder agent view latest version cach mobil client latest prefetch view holder agent comput net effect batch updat version partial materi occur perform condit activ view evalu part materi program condit satisfi applic session receiv specif updat reduc amount data transfer wireless commun obtain faster fewer mobil agent fourth main contribut dissert provid understand view consist affect mobil client view currenc custom understand view consist affect view currenc custom recomput view mainten addit view consist level creat call partial consist analog view consist achiev partial materi call progress consist repres view consist achiev view fulli recomput time condit satisfi level view custom data access monitor trigger individu data sourc requir strong complet consist algorithm execut updat transact perform data sourc recomput mainten chapter requir collect exact happen data sourc algorithm approach level consist give mobil environ varieti person view mainten oper mode reduc mobil client depend fix network offer finer grain control balanc data amount wireless maintain consist materi view consist demand fix network fine grain approach creat manag materi view mobil environ advantag strength fix network order adapt wireless condit extend usabl mobil devic enhanc person product dissert formal defin custom recomput consist order reason properti hold order ensur monitor updat data sourc chronolog reflect success version maintain explain increment view mainten affect mobil view currenc custom translat extend form sql level increment view consist perform mobil achiev view mainten paradigm evalu clear fewer messag data sourc harder evalu size messag bandwidth cost observ total size messag recomput view mainten depend primarili size valu reflect size subqueri evalu recomput data sourc dsi total size messag increment view depend primarili number sourc answer messag requir updat data infrequ condit relat strobe increment mainten choic updat data relat recomput mainten recomput view mainten increment mainten fix network custom materi view mobil client mobil full advantag small size custom materi view held view holder agent number data sourc increment view mainten techniqu updat data sourc import drawback current internet applic view remot web maintain client dynam view system prototyp util view remot web show feasibl view holder approach todai emerg agent technolog version data cach avail older version input mobil client applic period client eventu learn valid result produc respect current data valu contribut dissert develop result propag process detect inconsist newer version data reconnect view holder agent comput period time consist measur result applic session consist valid rule suppli govern creation share result group applic session possibl execut client show inconsist detect view holder agent share proce view holder agent provid addit servic group mobil client access materi view asynchron cooper dynam establish cooper client updat remot perform integr share view holder agent natur extens work futur integr view holder approach workflow manag techniqu order autom execut step complex busi activ workflow research accur model captur data control flow requir step workflow examin correct consist requir view holder data process learn work cooper user mobil common goal merg workflow specif accord semant specif applic provid control exchang synchron content individu replica materi view result deriv base data addit import issu mobil network condit part workflow environ workflow involv restor consist task complet complet improperli complet task import statu maintain log activ particip incorpor graph structur view view holder approach mobil access area futur research relat materi view content cach graph structur view repres form data web page node graph repres element data edg repres relationship data graph affect formul materi addit custom view mainten defin investig graph structur materi view offer greater person usabl mobil client graph repres entir materi prefetch view holder agent cach agent easili filter queri subset data web cach examin visual data view holder agent bibliographi bibliographi jump bean ad engin incorpor web chrysanthi effici data dissemin mobil client applic proc intl workshop electron commerc web page zdonik dissemin updat broadcast disk proc intl conf larg data page zdonik broadcast data manag asymmetr commun environ proc acm sigmod intl conf manag page aglet workbench ibm japan research group web oneil critiqu ansi sql isol level acm sigmod chrysanthi group scalabl data share protocol ieic tran inform wang effici increment view mainten tag distribut technic report univ br satyanarayanan conceptu framework network adapt ieee mobil network goodman concurr control recoveri system chapter page agent mobil comput ieee person oct mumick support multipl view mainten polic acm sigmod chrysanthi ramamritham synthesi extend transact model acta acm tran sept carei nsf workshop industri academ cooper sy web html widom wiener trace lineag view data wareh environ technic nov chang establish virtual mean mobil agent proc research issu data engin page mar kumar adapt broadcast protocol support power conserv retriev mobil user proc ieee intl conf data page deli roussopoulo manag updat enhanc dbm intl conf distribut comput june elmasri navath fundament system chapter page livni transact cach altern perform acm tran sept kossmann perform tradeoff queri process acm sigmod june zhuge distribut parallel comput issu data wareh proc acm principl distribut comput page ross adapt materi view redefinit acm sigmod van den van gucht object model ieee tran knowledg data aug java connect chapter page idg book system optim web wireless environ proc intl conf mobil comput nov hull zhou framework support data integr materi virtual approach acm sigmod page jun badrinath queri highli mobil environ vldb page aug badrinath data organ access ieee tran knowledg data kaashoek mobil comput rover toolkit ieee tran special issu mobil keller basu cach scheme architectur intl parallel distribut inform sy page sept kotz grai mobil agent futur internet acm oper sy aug joshi approach wireless web access proc intl workshop wireless network mobil apr ross concurr control theori defer materi view intl conf jan satyanarayanan disconnect oper coda file system acm tran comput feb enabl cooper disconnect mobil user coopi sept static adapt locat manag mobil wireless network comput mar labio effici snapshot differenti algorithm data wareh vldb page sept lu satyanarayanan improv data consist mobil comput comput widom prototyp data creation mainten acm sigmod chrysanthi visual queri complet encapsul object proc intl workshop research issu data distribu object manag page mar chrysanthi achiev consist mobil local proc tenth intl workshop expert sy page sept chrysanthi cach constrain mobil data csd technic univ chrysanthi support mobil access queri icon distribut parallel jul walker agil adapt mobil proc acm symp oper sy oct olap research technolog olap council web technic overview objectspac web pitoura chrysanthi scalabl process transact broadcast push proc ieee intl conf distribut comput pitoura chrysanthi exploit version handl updat broadcast disk proc intl confer larg data perkin johnson mobil support proc intl conf mobil comput nov park park altern correct criteria concurr control applic advanc system proc intl workshop expert sy page aug mobil agent www distribu access intl conf data apr pitoura data manag mobil comput chapter page prasad dao model queri mobil object intl conf data apr cc content negoti contextu proc acm intl conf mobil data jan chrysanthi dynam view system mobil agent support web view intl conf data page apr quass widom view mainten batch updat acm sigmod page papakonstantin adm view ieee data engin jun roussopoulo materi view data sigmod mar satyanarayanan mobil inform access ieee person feb satyanarayanan fundament challeng mobil comput proc acm symp principl distribut shneiderman design user strategi effect interact strong mobil resourc control nomad proc intl symp agent sy applic fourth intl symp mobil agent sept ramamritham effici concurr control broadcast environ proc acm sigmod intl conf manag comput model wireless environ proc intl conf apr winter giant walk vldb survei program sept winter big vldb survei program aug pk chrysanthi manag mobil transact acm annual symp appli mar ed widom special issu materi view data wareh ieee data engin jun chrysanthi program view mobil client proc intl workshop expert sy page aug chrysanthi util version view mobil environ journal comput infrastructur collabor mobil agent proc intl workshop mobil page wang row cach consist control dbm architectur proc acm sigmod intl conf manag page zhuge graph structur view increment mainten intl conf data feb widom view mainten wareh environ acm sigmod wiener consist algorithm view mainten distribut parallel jul zhuge increment mainten consist data phd depart comput stanford multipl view consist data wareh intl conf data feb
IR/1049 5 metaseek imag metasearch engin develop explor queri onlin visual inform system current implement integr user feedback mechan relev feedback imag metasearch ieee internet comput ieee juli august internet search ana chang columbia onlin document search engin past year motiv develop metasearch act gatewai link user automat transpar multipl compet search engin current metasearch engin varieti techniqu work fundament search unit text autom visual inform retriev system work imag combin text relat inform queri store imag data web vir system pose special problem heterogen perform motiv develop metasearch engin domain develop prototyp metasearch engin call investig issu involv effici queri distribut onlin visual inform sourc metaseek select queri target imag search engin success similar queri condit previou search current implement track target engin perform integr user feedback visual queri perform begin articl review issu visual describ current metaseek implement present result experi evalu implement comparison previou version system baselin engin randomli select individu search engin queri conclud summar open issu futur research internet search juli august ieee internet comput visual queri text document retriev base word specif search unit visual addit process requir obtain adequ compar visual content featur imag data view arrai featur vector constitut effort visual content distanc function comput close featur vector provid approxim measur visual similar imag visual queri initi select queri imag initi set imag return random keyword search input url extern imag input search engin comput imag visual featur retriev match similar imag search match imag subject natur narrow search scope techniqu cluster index develop effici handl visual queri retriev larg visual imag categor basi criteria follow gener classif method special learn techniqu index techniqu sort visual data storag devic base visual featur special index algorithm imag retriev appli imag featur vector visual access effici vir system support specif set visual featur featur extract distanc cluster index algorithm visual repositori queri combin visual featur text relat inform metaseek uniqu integr tool heterogen environ onlin vir system metaseek metaseek metasearch engin imag web automat link user multipl imag search engin onlin visual inform sourc architectur metaseek shown figur main compon system standard metasearch includ queri queri displai interfac compon receiv dispatch select target search engin queri consult perform metaseek site perform score past queri success failur support search option queri translat translat user queri suitabl script conform interfac select search engin target search engin queri translat metasearch engin queri dispatch perform monitor displai interfac result merger format convert target search engin queri translat target search engin queri translat client perform figur metaseek includ basic compon common metasearch queri queri displai interfac compon imag metasearch ieee internet comput juli august displai interfac compon merg rank result search present user metaseek evalu qualiti result return search option base user feedback inform modifi entri perform fundament principl design metaseek web resourc effici provid qualiti result principl underli implement queri search engin provid good result similar queri condit avoid download imag feasibl altern queri submit metaseek underli system implement run platform metaseek socket program commun individu target search engin manner transpar user http command remot search engin pose queri download result manner similar web browser netscap mosaic remaind section describ metaseek queri queri dispatch perform displai interfac compon queri interfac metaseek support onlin search relat work metasearch tool classifi automat manual queri dispatch autom dispatch decid search engin queri direct control user queri support target search engin select group specif queri base sort knowledg manual metasearch select process user manual metasearch engin activ search engin time displai result data origin format search engin produc approach metasearch overview highlight contribut work metaseek gloss project estim potenti queri construct integr index target number document word includ approach main requir search engin cooper metasearch suppli index number complex prohibit savvysearch tool emploi approach select relev search engin base term user queri previou experi queri success failur track enhanc select qualiti system combin automat manual queri dispatch queri savvysearch search plan target search engin order step user regard disregard find suggest approach effect make search engin select potenti larg amount knowledg requir make question effici system system web metasearch engin support manual automat queri dispatch automat queri analyz incom categor automat pick search engin queri base priori knowledg repres suitabl search engin categori confid factor merg search result list return remov duplic broken present final list user perform compar individu search engin demonstr abil retriev relev inform present fewer duplic page refer effect gloss text discoveri proc acm ae select search engin acm tran inform vol juli pp center metasearch internet search juli august ieee internet comput virag system present individu function limit virag accept imag match imag visual featur color textur visualseek qbic support custom search user interact draw visual sketch extern virag user weight import featur search qbic support imag retriev base keyword semiautomat imag video search catalog engin support search color histogram metaseek support search capabl webseek current metaseek user interfac support random imag retriev base visual content keyword queri base visual user select imag support input url extern imag metaseek search match imag base visual featur select individu combin figur illustr user interfac metaseek search engin target search engin queri metaseek queri dispatch program search capabl send queri search engin dispatch mechan explain metaseek queri multipl search option simultan target search engin user number search option search maximum wait categori interest menu number queri individu search engin adjust account network load period low network user number concurr queri maximum wait time prevent queri system stall search engin experienc delai select categori natur user expect submit input imag belong categori queri dispatch process inform improv recommend mechan target search engin queri dispatch perform receiv dispatch select target search engin search option queri search option defin queri method specif search queri visualseek search engin dispatch make select type queri submit metasearch engin user request random imag sampl keyword system simpli pose queri search engin action visualseek support random qbic webseek support keyword visual select target search engin base perform score indic search option perform past queri imag visual queri queri group semant categori receiv metaseek search perform retriev queri imag perform score queri dispatch select search option highest score user featur semant categori select imag queri perform score simplest solut randomli select search option queri metaseek recommend remot search option relat queri past perform data exist queri imag perform cluster class base visual content system maintain cluster structur featur combin user issu queri queri system download imag match cluster structur obtain list similar cluster imag closest cluster select present user dispatch recommend suitabl search engin base averag perform score cluster select user imag ad perform futur queri imag metasearch ieee internet comput juli august approach cluster visual data support effici imag retriev decid cluster algorithm simplic reduc comput requir cluster algorithm execut time imag ad imag metaseek tamura algorithm comput textur featur vector imag color histogram algorithm color featur vector distanc featur vector calcul euclidean distanc note featur vector framework gener accommod featur vector semant categor semant categor constrain search scope visual special type imag observ qbic includ imag virag imag categori user interest find pictur qbic yield result time metaseek offer possibl search specif categori maintain separ perform cluster structur categori activ user select categori menu current version metaseek includ transport structur metasearch featur vector perform cluster semant categori imag queri metaseek inform dispatch recommend suitabl search engin incom queri organ hierarch structur imag classifi semant mean categori select user cluster algorithm cluster imag semant categori class basi featur figur page present conceptu structur lowest imag entri inform shown tabl imag complet url address locat local remot site featur vector color textur calcul color histogram tamura cluster algorithm featur vector organ imag base visual content queri dispatch perform score decid target search score updat user feedback time imag queri score na mean search option accept imag score queri input virag accept extern imag queri queri imag select imag tabl extern score virag search engin set na perform monitor expect perform individu search engin chang time improv algorithm add imag decid construct perform metric accumul user feedback imag perform vector figur metaseek queri interfac preview imag displai queri gener total result url upper left corner identifi queri imag internet search juli august ieee internet comput perform index search option support individu search engin shown tabl perform search option sign integ posit number good perform neg number correspond poor perform perform metric result imag updat time user submit imag queri input visual queri select result imag increment perform metric search option return visit imag imag perform score remain unchang user dislik result turn increment decrement perform metric search engin tabl list modif bootstrap perform feedback method acquir knowledg search engin perform requir continu process iter user queri session accumul result process gener nontrivi entri seed train period select target search engin train period search engin randomli select engin approach gener ineffici train result view offlin probe process establish initi perform score probe procedur carri prior train period initi probe process establish perform score train period perform score base user feedback train period onlin perform continu updat user feedback find metasearch engin text suggest perform index approach effect make search engin select potenti larg amount knowledg requir make question effici system automat probe search engin set sampl imag solv problem probe base perform knowledg start train metasearch engin knowledg accumul train queri dispatch discard knowledg base search engin select accumul train perform strategi probe search engin collect initi perform data emul user judgment result imag relev nonrelev probe imag select semant categori probe imag set pose search option search result download analysi result imag visual distanc probe perform anim art transport color textur color textur imag imag imag semant categori featur group cluster class queri imag figur conceptu structur metasearch metaseek imag metasearch ieee internet comput juli august score search option return imag perform score search option return imag result imag visual distanc sampl imag probe cluster algorithm appli imag sampl probe base featur determin threshold subject evalu queri result featur distanc expert strategi train metasearch engin begin select train imag semant categori pose imag set expert user evalu result return search option relev nonrelev set probe imag set train imag complet independ queri displai compon result retriev individu search metaseek displai compon organ present user process depend type action request random keyword imag search result random imag keyword search merg randomli present user order result import visual displai mechan elabor imag search base visual content return rank list imag start imag vector close match queri imag metaseek perform addit rank imag score perform result imag return queri option interleav displai user perform score queri imag determin displai order number imag interleav group result search option imag retriev search option perform score displai compon displai imag search option score imag search option score return imag displai merg algorithm meant replac rank algorithm target search engin cope heterogen unlik consist distanc metric text search visual search engin algorithm metric evalu similar return imag engin queri common set featur comput compar local metasearch engin costli network imag download comput featur vector merg method avoid problem simpli rank interleav imag ignor actual distanc imag imag lower similar measur input queri displai imag higher similar metaseek show icon result imag imag requir featur extract process experi evalu develop version metaseek primari object investig recommend search engin incom queri import object determin util semant cluster categor improv metasearch engin perform conduct set select imag semant categori set target imag begin random find target imag success queri metasearch engin base visual tabl perform metric assign valu event score visit visit dislik tabl imag entri metaseek imag url color featur vector textur featur vector perform score search option qbic color percentag qbic color layout qbic textur visualseek color percentag visualseek color layout visualseek textur virag color na virag composit na virag textur na internet search juli august ieee internet comput tent select result imag queri input iter monitor number queri find target imag averag recommend queri experi perform evalu improv recommend mechan experi find target find procedur recommend measur accuraci search option recommend calcul number relev recommend search option total number recommend search option respect queri calcul queri queri maximum search option simultan search option posit user judgment imag minu number dislik consid relev queri collect data compar current version previou version baselin metasearch engin previou version metaseek lack semant cluster categor current system previou version receiv queri encount dispatch recommend target search engin averag perform score imag closest queri imag term visual featur distanc baselin metasearch engin past perform search engin select target search engin receiv randomli select set search option queri queri submit current previou version system queri search option provid desir result inform perform number queri requir find imag expect system accumul knowledg baselin number queri expect chang randomli variat present similar pattern valu result report figur system search number target imag locat search number correspond imag graph tabl show number queri pass percentag search produc number queri higher pass current previou version metaseek train set train imag set train imag set target imag common imag current metaseek offer perform system number queri requir retriev desir imag knowledg system recommend time previou version metaseek outperform baselin system higher lower number queri find imag experi conduct set target imag semant categori result obtain similar present figur futur work ongo work metaseek address research issu relat queri distribut imag repositori user feedback perform monitor result demonstr imag metasearch engin effici search engin search option select perform class queri determin user feedback import perform monitor user feedback metasearch sophist approach implement stage poor result system count collabor user custom search metaseek engin improv ad capabl support custom search qbic visualseek user custom search manual visual sketch queri input custom search system support color percentag color user color amount color imag metasearch ieee internet comput juli august number queri search number pass pass number queri search number pass pass number queri search number pass pass figur number queri find target current metaseek previou metaseek baselin metasearch engin number queri search number pass pass number queri search number pass pass number queri search number pass pass figur trend current metaseek previou metaseek baselin metasearch engin tabl summari result categori number queri pass pass pass improv improv current metaseek implement previou metaseek implement baselin metasearch engin internet search juli august ieee internet comput custom search requir addit user interfac program approach mind creat imag visual content user specifi visual sketch imag submit input imag visual content queri search engin support url search visual featur current version visual featur imag queri system comput color histogram tamura textur algorithm featur select simplic execut effici optim dozen textur accept ultim solut featur offer solut human percept highli subject explor system larger set featur adapt automat semiautomat user prefer system recommend search engin featur train exampl rapid growth imag make scalabl import properti vir techniqu cluster algorithm categor collect imag lack scalabl minim limit wait imag comput appli time imag ad categor mechan permit extend chang structur target search engin ad metaseek manual time autom procedur futur version search engin investig program onlin search engin regist metasearch engin regist program regist search engin interact target metasearch begin blindli knowledg search engin provid statist data reflect content visual data resubmit adapt capabl metaseek search engin probe set sampl imag learn algorithm machin learn address question build comput program improv perform task experi algorithm prove varieti applic domain welldefin learn problem requir perform sourc train experi metaseek system design learn recommend suitabl search engin incom user queri improv perform measur retriev search result experi obtain user feedback metaseek classifi review approach machin learn relat research area onlin search engin visualseek webseek academ visual inform system built columbia qbic virag onlin demo commerci system design choic extract method cluster unrestrict access visual system feel control individu search engin evalu compar effect approach design choic face creat network individu search engin solv problem network search engin emul heterogen search engin network extens experi reach suitabl design option commerci vir demo queri success approach integr current version metaseek refer jr smith fulli autom imag queri proc acm conf acm imag metasearch ieee internet comput juli august jr smith imag video search engin symp electron scienc storag retriev imag video flickner imag video qbic vol sept pp bach imag search open framework imag symp electron scienc storag retriev imag video chang inform retriev larg distribut comm vol dec pp ab metasearch engin symp electron scienc storag retriev imag video search multimedia kluwer academ ro duda pe pattern classif scene ae select search engin acm tran inform vol juli pp ana benitez phd student columbia research interest visual queri visual distribut receiv telecommun engin higher technic school telecommun engin polytechn master columbia student member acm beigi phd student columbia research interest qualiti servic network monitor receiv bachelor electr engin state york stoni brook ms field columbia work watson research center chang associ professor depart electr engin media technolog center columbia activ columbia digit librari project current research interest includ visual network video video commun receiv phd electr engin comput scienc california berkelei chang hold patent area visual search compress video process recipi onr young investig award reader contact author columbia dept electr engin media technolog ny email ieee internet comput activ solicit varieti articl design develop work domain internet technolog applic ic articl technic accuraci accept public subsequ edit present broad audienc comput articl includ gener introduct explain subject matter reader place articl broader context internet technolog kind describ research develop project potenti actual includ environ applic hardwar softwar type peopl build suffici reader judg work relev situat review specif technolog appli problem solv todai industri research develop activ advanc give instruct solv specif problem perform specif develop task criteria technolog applic effect extent materi broad audienc comput appli internet technolog work sound technic method clariti express suitabl broad audienc profess submit articl abstract url full articl member ieee internet comput editori board articl accept refer public offic instruct begin process detail author guidelin author guidelin
Agents/1050 1 introduct intellig agent model simpl ration behaviour wide rang distribut applic intellig agent receiv gener show social combin reactiv behaviour success architectur agent bdi number academ industri applic agent orient softwar pty base built jack intellig agent tm framework java system develop aim provid platform industri research applic framework suppli high implement bdi easili extend support agent model specif applic requir paper section introduc jack intellig present approach ao design outlin major engin characterist bdi model discuss briefli section section outlin build applic jack intellig agent section discuss framework benefici engin research refer jack intellig agent simpli jack approach major design goal jack provid develop satisfi varieti practic applic technolog transfer research enabl appli research design extens properli train familiar agent concept articl jack intellig agent compon intellig agent java paolo ralph andrew andrew luca agent orient softwar pty australia agent model simpl ration behaviour wide rang distribut applic architectur base model successfulli situat model human reason team behaviour simul tactic air oper command control structur applic includ intellig telephon call air traffic manag jack intellig agent tm framework agent orient softwar bring concept intellig agent mainstream commerci softwar engin java jack intellig agent gener agent design set compon high perform strong data type present design approach major technic characterist jack intellig agent outlin typic develop process involv framework discuss benefit softwar engin develop sophist distribut research explor agent model architectur sound understand concurr program whilst applic built ground adopt agent orient methodolog possess depend larg legaci softwar system jack agent design compon larger environ agent coexist visibl simpli object softwar jack programm easili access compon system type safe access reliabl support proper engin process kei requir kind environ similar jack agent bound specif agent commun languag prevent adopt symbol protocol la possibl integr softwar exist public domain jack gear industri middlewar messag pass infrastructur pvm di simul jack nativ commun infrastructur situat high perform requir overview jack framework engin jack consist set compon address requir specif agent architectur suppli version end octob includ support bdi model applic jack consist main extens java set addit host languag divid small number keyword identif main compon agent plan set statement declar attribut characterist compon inform belief carri attribut strongli set statement definit static relationship plan adopt react set statement manipul state addit goal interact programm java statement compon agent conveni background jack support logic variabl cursor queri state belief semant logic program languag addit type check java sql extens java compil convert syntact addit pure java class statement load call java code compil partial transform code plan order obtain correct semant bdi architectur set class requir support gener code automat manag concurr task pursu parallel bdi default behaviour agent reaction failur action nativ high perform commun infrastructur multiag applic jack kernel support multipl agent singl process conveni save system resourc agent perform short comput share code data group jack programm extend chang architectur agent provid simpli mean overrid default java method provid kernel suppli class support add syntact extens handl jack compil commun infrastructur suppli overrid method futur version jack extend base bdi model add number develop monitor tool agent bdi agent model support jack root philosophi cognit work bratman ration agent ration agent bound limit understand incomplet knowledg environ live agent belief world desir drive form intent act intent commit perform plan plan partial time formul exact step perform depend state environ eventu execut activ ration agent consist perform action intend execut forc intent belief desir desir intent call mental attitud mental agent observ bdi agent depart pure deduct system tradit ai model concept significantli reduc extent requir bdi demonstr suit model type applic standard oper procedur train staff successfulli adopt field simul militari applic busi rule diagnost telecommun network base previou research practic rao georgeff comput model gener softwar system implement bdi agent system program reaction instanc chang environ bdi agent adopt plan intent plan precompil procedur depend set condit applic process adopt plan intent requir select multipl candid agent execut step plan adopt intent happen event failur success exist intent step plan consist ad goal desir achiev agent chang interact atom action state extern world abstract bdi architectur implement number system relev jack repres predecessor gener procedur reason system develop sri intern mid dmar built mid australian artifici intellig institut gener system dmar develop platform number technolog demonstr includ simul tactic decisionmak air oper air traffic manag applic develop jack ideal develop build applic jack start identifi distribut compon system design applic requir sound understand distribut system develop distribut ai principl discuss observ practic situat distribut function dictat number extern exist legaci system specif commun infrastructur assum function provid agent identifi bdi model chosen main activ perform necessarili order identifi elementari class abstract data type oper requir manipul resourc agent extern arm gui intern specif mathemat data structur repres spatial identifi element constitut mental state agent boil extern event drive agent messag goal agent set belief influenc adopt final procedur plan bdi requir accomplish achiev goal react event context implement agent mix normal java code elementari class extend java compon plan jack agent sequenc oper elementari manipul mental state submit chang interact agent observ jack plan repres procedur logic flow state coordin diagram similar notat methodolog uml jack extend framework support event driven procedur logic concurr execut addit benefit sensit context sophist manag failur provid bdi architectur give sampl code jack extract tutori part version user manual show agent program illustr jack code straightforward java extens section pass familiar java agent exchang empti messag messag exchang repres event origin agent notifi event extend int note place java event declar mean notifi drive jack bring requir commun support statement declar event gener invok java method integ plan handl notif event repli sender event back simpl sensit restrict state belief agent applic plan extend plan event event repli sender event trivial defin singl plan handl singl event method notifi agent call infin agent extend agent event plan event void ping applic instanti agent desir agent network address determin commun mechan jack high perform messag system simpl scheme benefit jack approach jack number advantag comparison agent framework artifici intellig world standard architectur adopt java wide execut environ addit languag run sun expect number softwar tool train engin year ai adopt languag java mean lose express power offer framework base logic function languag avail mention modular approach jack previou compon framework tune tailor make jack suit agent architectur order function mental addit type knowledg studi perform characterist specif context compar framework base tradit ai jack distinct advantag due proper java import strong reduc chanc program error introduc simpl basic version control make interfac compat make execut speed agent code written jack compar direct implement engin develop sophist distribut jack offer interest effici express high level procedur logic objectori environ rapid applic develop clear distinct abstract data type oper side applicationspecif behaviour requir evolut system oper base high highli reusabl ultim express plan easili context sensit sophist semant mental attitud bdi architectur characterist enabl level adapt chang integr legaci system increment approach distribut system develop compar framework origin research jack clear advantag industri strength access larg commun engin train program jack intellig agent framework extend java languag current version support bdi modular enabl extens model easili support jack provid framework solut found artifici intellig research practic compar pr dmar system mention similar agent framework academ jack ai system constitut success marriag vision agent research softwar bring power agent technolog enrich host java confid jack provid benefit softwar engin develop distribut system academ research acknowledg author prof ramamohanarao melbourn valuabl suggest refer practic harvard ma georgeff make reason intern joint confer artifici mi formal specif intellig agent agent rao lnai rao abstract architectur ration intern confer principl knowledg reason swartout nebel morgan kaufmann wooldridg theori knowledg engin vol pp copyright agent orient softwar pty
HCI/1051 4 commun search assist glanc xerox research centr europ de franc abstract paper describ softwar commun search recommend relat search user search engin commun search assist enabl commun user search collabor fashion queri submit commun store form graph link made queri found relat user network relat queri order path cousin set search result kei idea queri graph determin depend document return actual term queri kei idea construct queri graph transform singl user usag inform network collabor user tap knowledg base queri submit introduct main problem user internet search properli inform form find item relev inform express judg qualiti relev item return search engin great deal progress domain inform retriev address problem internet search engin fairli good job discov item relev primarili statist techniqu match www page queri recent work advantag collabor user user rate document hyperlink deduc qualiti www page deem relev user queri ishii ura kleinberg page step address user fundament inform accur search engin answer recent analysi onlin search librari set found fail search workshop ai web search semant error semant error occur user fail terminolog user fail term level specif inform high probabl person formul good queri inform recent past trace search engin excit reveal queri submit account syntact variant queri word suggest collect knowledg onlin embodi set search tap individu user articul inform terminolog concret user search www page confer mobil comput recal novic type mobil comput confer prefer search engin hundr top top ring modifi queri gener search mobil comput relat search altavista wireless internet mobil comput philip mobil search confer web site rememb intern symposium handheld ubiquit find desir result confer keyword handheld comput mobil comput advantag fact enter queri inform term queri overlap comput huc queri term relationship induc document return criterion top ten document return list document common turn path queri consist sequenc relat queri section describ construct graph queri submit search engin period time kei idea determin depend document return actual term queri kei idea construct queri graph transform singl user usag www collabor user tap knowledg base queri submit commun search assist interfac queri graph commun search user search assist user network relat queri order path cousin set result search assist record search queri updat queri graph increment search back inform commun search find handheld comput confer cousin mobil numer exact relat queri return depend user googl refer search queri return contextawar comput top ten www connect graph juli term handheld ring follow graph direct present handheld comput cousin handheld comput confer cousin origin queri common www page bring handheld comput build web page return top ten document queri rapidli find set relat queri order cousin origin user kind make queri huc rest paper organ present approach construct queri graph describ commun search assist provid detail implement present result obtain analyz queri construct initi set search engin result queri graph properti highli depend search engin highlight characterist search engin emploi paper close section relat work discuss broader util commun search assist queri construct build initi queri graph requir access set queri made search engin set search engin period time set queri user base broad www limit user base compani intranet advantag broader user base probabl overlap inform inform advantag restrict user base potenti tighter focu demonstr commun set uniqu queri obtain hour period august list queri metacrawl filter remov queri includ sexual term queri truncat charact set construct initi queri graph node queri node connect queri calcul relat measur number item common top return refer search engin refer search engin measur search engin set user queri build queri graph set defin queri relat queri return url common top track number url common start filter set queri obtain uniqu queri build save list return submit search engin retriev top save list save date queri find save list relat find queri empti queri add save date figur queri graph construct algorithm relat queri fig outlin algorithm build graph implement shell script serv backend save queri graph data built version queri googl determin altavista section analyz describ differ queri graph obtain exampl relat search found set queri submit kill ey de measur determin construct queri graph queri defin relat pair url overlap match overlap exce threshold possibl match queri retriev content summari content rel rank match item account determin strength queri search commun search assist agent maintain queri graph kind search engin free text entri agent work parallel search engin return list relat search html search engin includ addit tradit result list screenshot illustr commun search assist work conjunct altavista search engin shown figur demonstr extract basic search function av portal user search engin return list relat queri addit list item match queri relat queri clickabl queri submit turn commun search assist user enter http request host search engin refer search engin search engin return list item match queri list item return av present list item return refer search engin calcul list relat queri increment updat queri graph user queri figur show algorithm process user increment updat queri present result user altern wai maintain queri graph updat process invok queri order speed time link queri graph period recalcul prevent stale reflect current content network current usag form calcul set relat queri queri cheap figur screenshot search assist figur process user queri submit refer search engin retriev top save list find queri save empti queri add save date present result filter queri keyword return user relat order heurist strength user select set relat repeat order queri graph size queri calcul linear indic relat search present user order item highest top relat item present click relat user present set relev document relat set relat search hop origin queri click sequenc relat user follow path queri graph user backtrack button browser click previou necessarili relat queri list symmetri user interfac search engin augment provid graphic user interfac queri tree origin queri root tree present convent tree sophist visual hyperbol browser rao user interfac implement graph viewer queri analysi construct queri graph initi set googl refer search altavista result queri graph summar tabl percentag queri neighbor larger graph time translat neighbor queri node neighbor queri node av graph tabl queri graph googl altavista refer search engin googl altavista queri queri graph isol queri link relat queri node relat queri node relat queri node relat queri node max neighbor cluster coeffici median number neighbor node node googl graph node av graph cluster coeffici googl graph cluster coeffici extent node connect common node connect perfectli cluster graph cluster coeffici figur show probabl densiti number neighbor node googl graph av distribut displai long plot googl distribut plot av distribut tail fig exist queri node neighbor googl queri graph av graph node qualit dispar queri graph differ methodolog emploi search engin account dispar googl emploi algorithm calcul import page function web hyperlink page googl circular algorithm figur probabl densiti neighbor queri googl queri graph figur probabl densiti neighbor queri altavista queri graph calcul page high import page high import point hub site authorit site match queri rank higher altavista index web page invert index retriev url match page match keyword rank higher googl av return url semant relat googl result depend keyword return url good distinguish close relat queri return result specif gener search engin account popular import yield rich link queri graph interest understand googl graph larg cluster sift queri hundr find cluster queri everydai word distinguish kei word queri song titl thing queri return url happen word queri assum commun search assist perform badli kind queri googl refer search engin work expect commun search assist simpl heurist rank relat order relat queri count url common techniqu work surprisingli find queri semant relat half top relat queri song titl queri song titl alphabet order relat search song titl filter mechan work addit url common typic music interestingli av graph spuriou relat queri meaningless time add text page long list keyword search engin oper invert indic retriev page frequent av queri graph larg cluster point page appar complet unrel queri compon list page reconstruct queri graph week spuriou cluster av longer return url queri cluster av mechan recogn page short lifecycl spuriou cluster replac disappear note explain dispar differenti find hold number queri construct graph find hold test larger result base subset queri shed light stabil result percentag isol depend number queri construct graph work find greater percentag isol densiti link remain greater googl subgraph av subgraph relat work recent work inform retriev commun address collabor search approach similar past queri automat expand kind order relev feedback document correspond similar queri provid feedback origin queri dent raghavan sever measur similar queri function overlap document return queri document analyz linguist produc combin queri vector improv search process augment procedur costli gener cost search greatli method view critic search system dent similar complement search result data item user search session similar session progress al search result commun increment construct basi relev feedback provid member time research work collabor judgment qualiti www page jon kleinberg graph theoret approach identifi author page hub page adam discov www small world suggest properti small world graph identifi high qualiti www page hub page approach mine web googl pagerank algorithm recommend system emerg commun peopl collabor evalu qualiti www page document ishii ura search engin begin incorpor simpl techniqu collabor search built popular oper simpl vote mechan search engin emploi popular engin simpli track queri input user link user follow user vote queri yield result order account previou user action enter queri search engin emploi popular engin return popular result queri relat search technolog work broaden narrow user queri subset user queri searchenginewatch describ relat search featur major search engin altavista relat search featur work narrow user queri origin queri queri mobil altavista recommend relat search wireless internet mobil comput philip mobil comput excit suggest kei word add origin queri kei word term commonli document return origin queri search engin user enter queri form natur languag question process answer user search engin match user question templat question technolog match mixtur linguist interest peopl peopl queri discuss introduc collabor search softwar agent collect queri increment construct queri graph interact recommend relat queri main contribut search assist enabl form collabor search user tap collect histori search simpl effect heurist identifi relat assist recommend relat queri tend contextu similar perform costli linguist analysi secondari result present paper reveal effect search assist depend strongli refer search engin construct queri graph experi show queri graph construct googl order magnitud link construct altavista collabor search assist augment kind search engin enhanc knowledg provid kind commun search commun queri memori limit search network servic overlap content respect answer identifi relat question assist augment relationship applic www acknowledg gregori grefenstett implement initi set script find relat search set queri point refer small world web franc document vector modif smart retriev experi automat document gerald englewood nj collabor inform activ learn classifi recommend document cooper inform agent ii mobil electron commerc inform discoveri internet ed lectur note artifici intellig seri larri mei automat feedback past social pa make recommend system work organ england germani author sourc hyperlink environ symposium discret ed hyperbol focu context techniqu visual larg hierarchi journal visual languag cach search engin result ic technic report comparison initi queri ensu question develop onlin search human refer interact ca pagerank bring order web stanford digit librari work paper vv past optim queri wa search assist relat search
ML/1052 6 appli formal concept learn system valid volker dotsch universitat leipzig institut fur informatik germani gunter grieser tu darmstadt fachbereich informatik germani steffen lang universitat leipzig institut fur informatik germani present paper materi paper tic toolkit valid formal languag learn dotsch jantk paper formal concept learn system valid lang intern florida ai research societi confer aaai page abstract problem area evalu complex softwar distinguish area applic identifi buzzword valid perspect adopt verif formal base support formal reason tool theorem instanc scope verif approach limit difficulti find suffici complet formal built paramount realist problem valid stringent charact valid result definit aim paper exemplifi valid approach base clear formal theori valid verif brought closer suffici clear author select applic domain algorithm system learn formal languag mean valid toolkit seri valid experi perform result present sake illustr underli formal concept compar valid learn approach invalid interest result motiv introduct power comput system bear abund evid methodolog tool system evalu legal formal german digit signatur act make high expect depend system explicit european inform technolog secur evalu criteria common criteria inform technolog secur evalu kei requir meet larg varieti secur properti high evalu level formal model present reason step verif plai case suffici complet formal model formal reason procedur find system meet user expect necess applic valid term denot area deal problem slightli inform verif wai verif valid closer attack problem possibl verif valid express essenti approach term present paper contribut endeavour author develop formal concept learn system valid grieser al present demonstr concept work practic exemplifi specif valid scenario implement scenario valid toolkit success separ valid learn system invalid valid meet verif benefit concert action depend softwar system paper organ section introduc applic domain case studi describ concret learn system german inform commun servic zur der fur und august offic offici public european commun inform technolog secur evalu version common criteria inform technolog secur version resp algorithm subject valid describ relev constraint valid learn system meet section main step valid process test data assess briefli introduc formal concept al demonstr concept adapt order valid scenario implement section describ tic toolkit featur support valid learn system section report result experi tic discuss question experi estim valid resp invalid learn system applic domain paper interest valid type learn system learn algorithm resp system subject valid learn formal languag accept list learn task minim collect formal introduc inform semin paper underli learn paradigm invok smith excel survei respect target class formal languag learnt concept acceptor call list learn theoret investig sakakibara siromonei drawn attent simpl type list inform list finit sequenc label word label final word equal empti word list easili understood classifi word underli alphabet word fed cdl check node check reveal subword input word classifi determin word accept case accept case input word pass check equal subword process termin manner cdl illustr alphabet bg roughli languag accept set word squar complement consist word identifi cdl languag accept meant clear context wai present inform formal languag learnt basic approach defin kei concept text text sequenc word exhaust target languag inform sequenc word label altern word label form text remain word label form text complement target languag confin learn inform learn mechan receiv success grow initi segment inform unknown cdl input produc output sequenc sequenc converg hypothesi correctli describ learn learn collect cdl provid learn cdl inform fundament result gold impli exist learn mechan learn collect cdl knowledg cdl potenti acquir process finit label word languag accept doubt suffici power learn algorithm implement concret algorithm learn cdl describ learn algorithm literatur algorithm learn fashion induct algorithm cdl express past gener hypothesi learn algorithm aha al present simpl learn algorithm design acquir knowledg cdl finit case select collect case subsequ present extend adapt similar concept hope learn cdl main idea remain assum case base cb case pair consist word underli alphabet classif assign weight case case base case present correctli classifi case base nearest neighbour respect underli similar concept carri classif chang opposit case cb misclassif influenc case reduc adapt weight appropri misclassifi case ad case base cb result process finit case base consist case weight weight express relev assign experi similar word similar word subword globig al similar concept suffici express learn arbitrari cdl collect case suitabl tune weight collect case case base cb classifi unseen word select case cb subword case simpli select case lowest weight case conflict case minim weight word classifi inherit classif select case nearest neighbour select algorithm case base cb vector weight word case nearest neighbour cb subword wg cb fc exist case output case readi formal present algorithm case base cb vector weight empti algorithm case base cb vector weight case case base cb vector weight cb cb fcg label cb cb cb fcg output cb weight sakakibara siromonei induct learn subsequ call find receiv set label word exampl output cdl start empti shortest word search exampl subword poss label label word append actual cdl exampl subword exclud process iter word actual cdl constitut subword algorithm defin algorithm find set exampl cdl empti list fw fw fw fw select shortest word fw append end fw append end output gener discuss reader direct literatur al sakakibara siromonei present valid learn adopt theoret concept learn system valid develop grieser al concept set section valid scenario focu present paper interact approach valid complex interact system exemplifi abel al inspir ture advoc al subsequ public type approach system valid systemat interrog specif class target perspect adopt adapt base grieser al develop investig formal framework valid induct learn system valid interrog perform essenti stage test case assess test case gener depend intend target behaviour respect peculiar system valid interact valid perform feed test data system receiv system result subject evalu ultim valid assess total evalu outcom adapt scenario valid system design learn list case system emploi basic face valid learn principl jantk valid problem induct learn system type tripl ffl set ffl learn algorithm ffl criterion success question learn cdl respect consid criterion success valid ongo debat necess system knowledg question extent black box valid process extra system knowledg success learn system valid jantk herrmann assum learn algorithm inspect meet properti test data gener test case gener matur research develop area larg varieti approach rang mathemat background al found human kei question suitabl test relat system deriv present applic gener approach cdl test data cdl pair word classif assign ci set test data test case consist cdl set test data tc ei set potenti test case cdl deal problem set learn algorithm learn infinit test learn algorithm abil finit initi approach select randomli idea select cdl complex select typic cdl hand set test data individu cdl infinit probe learn algorithm finit fraction data finit fraction select suffici larg learn target cdl special bound size suffici larg test data set sakakibara siromonei dotsch jantk deal test data set size theoret bound relev literatur test data basi kei activ scientif gener goal investig narrow valid artifact systemat deem essenti gonzalez scenario determin interact target system learn subject process input finit list test data finit set awar output algorithm depend order frequenc test data occur complic slightli deal note word accept cdl learn algorithm gener output input contrast al yield simplif procedur test case ei tc intens paramet determin finit collect list length target learn algorithm test list test data possibl repetit list creat draw randomli independ test data intens paramet learn algorithm output process initi segment length tripl call protocol evalu protocol individu experi subject expert evalu mark number express opinion experi wit learn algorithm abil learn target cdl realiz map eval expert evalu function tupl bi consist protocol expert evalu eval report question invok comput program evalu protocol yield result grieser al impress evalu learn algorithm resp system requir comput program achiev human expert involv rate qualiti protocol learn domain learn algorithm implement suffici express evalu function languag cdl defin regular uniformli decid word belong languag actual hypothesi learn algorithm resp find measur fix length word longer individu proport correctli classifi word length equal determin averag proport comput length denot set word length equal hypothesi number word correctli classifi respect target cdl qualiti individu hypothesi estim evalu function averag qualiti eval set evalu protocol establish elementari build block valid assess assess complex huge step evalu local featur qualiti assess author suggest numer approach combin set sequenc result interact monolith valid assess prefer structur combin result complex chart repres knowledg acquir grieser al finit set report form valid sequenc statement call valid dialogu system valid respect criterion success result success valid inform dialogu experi basi larger larger test data set report expert evalu eval converg discuss section experi provid initi segment potenti infinit valid dialogu learn algorithm inspect meet properti exploit deriv valid statement small number report algorithm work conserv chang respect long contradict data properti extrapol algorithm behaviour note case learn mechan output correct hypothesi receiv data contradict conserv learn algorithm request repeat correct hypothesi subsequ step observ conserv process finit segment inform cdl output correct learn perform special toolkit section toolkit tic valid support environ toolkit tic develop support valid learn algorithm high level framework interact inspect algorithm mean specif valid gener test data visual document result system learn formal languag easili adapt domain introduc abil tic set learn problem tic possibl regular cdl finit determinist cdl automaton fix deriv test data gener test data control wai rang explicitli train data complet random select assum select learn algorithm target languag fix cdl gener train data td tic test algorithm grow subsequ train data td observ algorithm behaviour detail tic evalu individu hypothesi priori languag algorithm probe qualiti individu hypothesi estim comparison expect comparison evalu statist approach instanc tic support statist tic lot learn process exampl number hypothesi statement final hypothesi algorithm converg interest measur size lot figur ratio numer graphic figur displai evalu window figur experi suspend save continu paramet test learn target system store tic support user wai discuss interest reader direct jantk turn attent actual experi valid find valid result case perform coupl experi order valid learn algorithm find probe learn algorithm perform learn cdl experi valid toolkit select test cdl cdl defin acceptor word termin alphabet cdl classifi word larger termin alphabet cg probe learn algorithm case cdl fix test data set consist test data form word length equal select randomli list length element creat protocol reflect algorithm behaviour initi segment length figur displai essenti result valid show protocol rate evalu subsect varianc vertic interv figur displai essenti result valid dialogu case cdl defin target learn task randomli select list length form element test data set consist test data word length equal figur curv tempt conjectur learn algorithm find pretti good learn target cdl closer analysi protocol prove process complet list length find output target cdl find conserv learn prove find learn cdl inform process list length initi segment curv depict learn algorithm show accuraci remark closer protocol output correct hypothesi perform good find account unabl learn situat find perform conjectur find valid valid statement deriv nice fit insight theoret analysi learn algorithm find discov sakakibara siromonei formal prove find learn cdl inform dotsch jantk provid figur strong evid cdl inform unabl learn cdl inform depend complet knowledg assess system qualiti base formal method tool high tool support desir requir problem confront formal prove correct system implement formal interest system behaviour meet inform user expect necess applic question valid verif attack author develop formal concept learn system valid grieser al bring tion closer formal standard verif approach present exemplifi formal concept provid applic basi practic valid problem concept adapt domain algorithm system learn formal languag implement valid toolkit tic appli concept successfulli prove learn system valid demonstr learn system invalid valid scenario knowledg system properti lead definit valid result articl exemplifi techniqu base inform approach valid clear formal theori author convinc futur li sophist integr valid verif acknowledg author express gratitud klau jantk introduc excit field learn system head work version articl refer aj util criteria reduc set test case expert system valid florida ai research symposium ai research pp aj gener minim set test case function exhaust system valid florida ai research symposium ai research pp mk learn algorithm machin ch survei induct theori method comput automat construct test theoret approach baltic comput lectur note artifici volum pp kp valid cbl principl intern florida ai research societi confer pp kp solv stabil problem knowledg acquisit pacif knowledg acquisit workshop south depart artifici pp kp tic toolkit valid formal languag learn intern florida ai research societi confer pp learnabl languag gener em languag identif limit inform aj valid verif intellig system journal theoret issu kp valid induct learn system intern workshop algorithm learn lectur note artifici volum pp kp lattic knowledg intellig system valid intern florida ai research societi confer pp rm de expert system verif survei tutori artifici intellig kr logic scientif discoveri model learn set string acm workshop comput learn theori pp gl psycholog aspect human factor test evalu militari system vd verif valid complex human factor nato asi seri comput system volum pp valid complex behavior issu vd verif valid complex human factor nato asi seri comput system volum pp guidelin expert system evalu intern journal intellig comput machineri intellig figur figur figur
HCI/1053 4 implement express joseph ari environ group mit media abstract interest wireless express applic wearabl develop versatil interfac foot wireless remot acquisit paramet autonom sensor cluster develop sensor card measur continu quantiti transmit wirelessli remot base updat variabl hz integr pair devic feet dancer measur continu pressur point dynam pressur bidirect bend height foot conduct strip angular rate foot angular posit foot earth local magnet tilt shock kick posit integr paper describ sensor electron outlin project appli shoe interact danc captur gestur conclud outlin applic sensor system draft ibm system journal introduct design implement express wearabl technolog long applic music express extrem histor concept date back long dawn electron figur show modern mount conveni respond action limb control motion instrument made kind map essenti static order attain rich approach instrument scatter bodi appar perform adorn charm audienc music express appropri dawn situat evolv instrument didnt mount perform replac set electron sensor pick motion cue control remot music midi standard digit synthesi brought system comput easili recogn motion analysi sensor signal produc softwar map sound action liber sensor system freed bodi bear burden instrument advanc synthesi data interpret freed sound ti simpl causal definit project electron music wearabl earli found work gordon adorn dancer acceleromet control analog perform perform artist anderson public concept show activ bodi suit adorn pickup transduc music keyboard system sort mark digit danc interfac base place set resist bend sensor dancer joint obtain dynam articul commerci packag complet includ finger control wireless set shoe tap toe shoe wire central transmitt foot train dancer multimod capabl articul simpl tap shoe interfac music domin tap implement havent appreci diversifi applic result adopt technolog foot essenti instanc concentr small set paramet treatment center product develop group sport shoe compani pressur sensor observ dynam pressur distribut shoe sole walk run shoe tether data acquisit system cabl coarser pressur sensor arrai portabl commerci devic warn patient potenti damag shoe interact coach dynam balanc incorpor develop nation center supercomput applic incorpor foot gestur virtual realiti instal phantom instal shoe activ ir optic system track translat posit small enabl user step anim insect project floor brought market inerti sensor quantifi estim distanc devic break nich sensor suit measur paramet detect essenti foot data back remot host comput leav shoe interfac concentr measur gestur express hand devot attent feet develop interfac break measur paramet articul foot sensor system shoe hardwar instrument shoe initi refin perfect figur show diagram sensor system current shoe figur show photograph origin shoe system figur show final design air electron obscur protect remov figur show final version shoe electron advanc initi work prototyp figur standard dot arrai tactil sensor standard resistor left forward region yield continu pressur respond dancer rock foot forward angl sole respond downward pressur shoe vertic sensor insid shoe move reliabl perform vari feet easier foil cabl run side sole fig dynam pressur strip foil respond forc resist bend sensor middl measur bend strip copper mesh adher bottom act pickup capacit coupl transmit electrod atop stage broadcast constant sinusoid khz dancer atop signal receiv shoe distanc shoe plate give indic height shoe stage electrod shown fig connect local electron ground break symmetri pickup electrod isol local shoe electron effect coupl bodi ambient coupl enabl current flow transmitt plate shoe system capacit receiv transmit khz signal height foot infer detect signal strength small circuit board edg shoe atop metal addit sensor electron origin orient foot vertic foot level obtain analog compass small gimbal magnet posit measur pair hall manufactur instrument corpor michigan monitor orient foot rel ambient magnet field devic adequ captur slower motion initi hour mechan start fail gimbal larg forc shock encount foot hostil fragil devic subsequ compass replac state devic bridg magnet sensor modifi oper higher gain sensor reliabl gave prompt rotat bridg drift time element magnet set pin provid shoe momentarili connect sourc magnet bridg subject current magnet satur maximum sensit normal procedur adequ oper spin import gestur mount rotat compact gyroscop murata devic sensor align axi provid direct measur angular rate give clear spin twist mem acceleromet analog devic measur tilt shoe respect graviti vector respond moder foot swing impact shock higher measur tripl acceleromet measur small cm sonar receiv detect khz ping locat stage time recept translat posit shoe track current shoe system receiv ping distanc roughli feet current standard diamet khz sourc pair addit rang attain power emitt independ shoe gener detect signal projector present perform configur sec fix posit plane stage interfac microcomput microchip clock shoe card digit signal produc serial data broadcast base station small rf seri shoe stream data separ frequenc peak transmitt data rate enabl full state updat rate shoe approach hz shoe stub antenna fig enabl transmiss easili receiv normal successfulli feet base perform local rf environ transmitt output strong fcc run band emiss mhz limit european transmitt liber rule restrict oper present system outlin section develop commun hardwar legal oper multipl transmitt meet requir onboard shoe electron drain ma volt origin shoe system onboard volt camera provid hour life move stabl continu perform oper extend significantli substitut switch regul seri regul power compass modul consum half batteri life span ampl perform addit design complic warrant shoe system easier work type wearabl interfac put shoe flip power worri sensor system implement locat devic concentr shoe greatli simplifi setup dancer work system encount problem mechan locat electron modul antenna antenna prove limit dancer work interpret modern tradit style tap involv constraint engin loop antenna distribut electron system made current devic larg extent hardwir addit design make system clip shoe adjust adapt wide rang foot size base system integr section describ electron design integr shoe system compon detail found ref fig show block diagram electron shoe system sonar acceleromet produc analog rout cmo digit convert onboard pic signal condit sensor simpli emitt voltag gain seri resistor larg provid adequ toe present low input signal buffer junction transistor sourc enabl resist limit set back bend sensor fed differenti amplifi give capacit pickup signal condit passiv lc filter tune khz transmitt ambient background fed gain block envelop detector extract posit amplitud receiv signal shock acceleromet signal stretch similar envelop reliabl digit pic data acquisit cycl lose polar raw acceleromet signal narrow pic reliabl detect hz sampl updat signal directli murata gyroscop perfectli volt digit rang signal output compass custom mention earlier regul suppli rf transmitt modul digit pic transmit data continu monitor suppli input grow latest version shoe electron card analog analog input analog channel shoe system extra input brought devic card system mention section acceleromet output digit khz detect respect axi input directli pair pic digit input pic digit analog acceleromet retain bit resolut signal sonar receiv amplifi head highli rout wave envelop detector discrimin adjust threshold sonar discrimin output appli pic digit input gener interrupt discrimin execut tight segment code start timer set flag pic transmit byte serial data record dedic check flag ping send timer send paramet latenc time ping receiv time sonar byte transmit make sonar threshold manual adjust user set tradeoff sonar sensit rang khz background dancer land hard jump acceleromet detect state spuriou sonar spike occur remov subsequ pc softwar primari suppli shoe hardwar condit seri regul produc trip batteri drop volt gate read pic encod data transmiss figur block diagram base station consist pic microcomput hardwar design smallest pic hardwar serial receiv serial input rf receiv transmiss send serial output driver commun pc serial order provid appropri rf serial pic variat manchest send data byte full record sensor send binari compar data byte record transmit rf recept error individu bad byte rest record intact order enabl base station quickli synchron data byte record mark uniqu code depend subsequ valu figur show block diagram entir express system current base station shoe base station listen shoe rf frequenc base deem onboard khz gener driver electr field transmitt plate pic gener gate sonar produc burst khz ultrasound trigger master sonar gate tenth round robin connect pic timer measur interv send ping receiv valid byte shoe sonar byte shoe latenc subtract timer acoust transit time shoe result amount time ping reach distanc shoe sonar system work provid bit posit resolut rang figur master synchron slave base station master send ping interrupt pic start enabl sonar algorithm work master slave base station track sonar head send address host pc data record current system produc pair serial stream master slave base station combin analysi content softwar run host pc hz cycl primarili limit rf data edg capabl transmitt receiv modul effici scheme speed effect data rate factor data interpret algorithm run host pc layer error protect ignor spuriou sensor signal data jump baselin return directli baselin subsequ introduc delai ms data cycl system perform data stream produc shoe system provid detail gait foot dynam sampl data plot figur show excerpt raw output sensor subsystem singl instrument wirelessli receiv host pc begin data user walk sonar start roughli feet distant end foot sonar rang plot top individu creat structur sonar projector ping hz regular signatur gait pressur bend plot sonar differ provid pressur toe bear give differenti signal respond attack heel signal note fig slightli insensit convent yield rang dancer pressur higher walk foot move note drop consist pressur signal roughli foot rotat perpendicular wearer press front shoe tip pressur plot graph left action data good candid trigger import sole bend modest sole easili bent except end foot rotat push step made atop khz electr field transmitt extrem simpl reliabl signatur gait dynam leav trace twist gyro acceleromet signal jump part foot move wildli channel addit respond fast twist foot mute trace gait shock acceleromet trace set foot stand primarili sensor ax direct differ foot strike evid balanc amplitud acceleromet insensit transient respond produc narrow modest spike analysi softwar reject acceleromet complimentari channel pick foot swing sensor nice detect shock magnet field lower follow foot pitch cyclic walk give foot rotat swing end compass show foot pitch tip press floor danc applic figur set photograph illustr artist project collabor shoe chronolog develop emploi danc athlet talent resid mit student affili commun system suffici robust advanc engag choreograph perform extend public show video clip express project onlin softwar map sensor valu sound ran standard drive extern rogu set librari written media lab handl midi music map essenti sonic event ti set simpl gestur direct control dancer sophist gestur analysi interest research risk remov strategi dancer rule relationship exploit evolv compel perform practic system prototyp shoe design exhibit ieee confer wearabl comput octob press actual stage perform dai subsequ event wearabl comput fashion held mit media laboratori base station map singl shoe except provid usabl data intend simpl easili limit scope music consist drum bass melodi voic drum voic ran steadili piec gave rough feel fit mood fashion show volum bass drum bass voic control θ tilt electr field height sensor control volum drum instrument tempo adjust slightli bend sensor bass voic melodi voic switch combin detect shock acceleromet bass voic produc harmoni specif harmoni select rotat shoe φ bass voic articul chang octav detect rear sensor melodi voic plai harmon tone upper rang melodi voic control front pressur sensor pan voic control detect compass direct attach acceleromet trigger heavi kick pan wind sound produc quick φ detect twist gyro mit student practic perform fashion show top applic athlet built fig map pedestrian trigger modifi simpl sound accord dancer provid audienc direct causal link ti random note toe heel bend sole select harmoni chord chang volum accord pitch tilt roll tilt fade addit harmoni chord height shoe electr field transmitt carpet dictat volum bass note volum shoe approach fast movement detect shock introduc fast rate introduc stream random piano note perform mit time mia media lab gestur narr languag group map brian train student media vision model group perform place wearabl comput fashion show tokyo back action background pedestrian music origin note ti toe pressur bend attach spin sharp sonic transient compass perform approach portion stage electr field sensor track fade addit effect introduc specif sharp fast spin detect point finish loud land shoe system reliabl perform danc collabor byron choreograph cornel danc depart map start work byron make music result control demonstr piec background sequenc enabl dancer launch modifi varieti sensor system simultan toe heel produc tone assign harmoni sensor feet present insur bend sole toe melodi depend bend pressur toe tip sensor trigger crash gyro pick launch cascad burst white fast shock sensor launch left foot shock turn note chang harmoni plai toe forward pitch tilt launch note left foot digit pad sidewai roll tilt adjust octav rang sound control pitch tilt version system function shoe approach singl sonar rhythm grow dancer approach dancer step electr field sound chord fade volum foot lift electrod sound chord voic chang foot rotat deriv compass map live demonstr intern danc technolog confer temp arizona dancer fig show boston dancer dawn kramer perform sonic rich dancer hour gave causal motion danc work left fig sonic routin score regular public perform tokyo toi fair map complex develop perform demonstr juli american danc festiv pair dancer activ lower middl fig choreograph byron refin york mark solo perform fig confer auditorium octob stage setup perform shown figur sonar system fulli projector deploi corner squar capacit transmit plate figur photo mark result track zone stage discret label quantiz gener dynam music music mode depend region dancer locat visit quiescent background sound map select loop music sampl start plai stai stabl region left foot face center squar sampl music excerpt rang music select region rang trigger occur sampl continu plai dancer point front shoe left foot toe tap time foot plai portion minimalist midi sequenc written cornel david part dancer add subtract addit toe tap shoe lift tilt continu audio effect ad voic sequenc music sampl depend angl tilt shoe control mix effect pressur sensor sole sound note melodi music sampl point trigger soft sound back bend shoe dancer zone sole pressur sensor plai pitch speech phrase pronounc dancer put music sentenc movement phonem sole effect similarli introduc tilt sonic event ti shock acceleromet signal rate previou map shock sensor process determin intens activ shock sound domin motion shock sound progress intens shoe enter electr field transmitt stage effect produc previou background note sampl produc fast foot swing region detect launch sound time dancer enter leav central electr field voic plai note trigger pressur sensor chang voic load cycl visit transmitt map advanc shoe system stage suffici depth variat dancer work entertain audienc extend perform project prototyp classif algorithm develop detect danc style shoe data discrimin waltz analysi danc music accompani fade complet data stream shoe system rich descript project repres step trajectori appli sophist analysi data stream extract danc sport train therapi applic develop demonstr wireless sensor circuit card fig research group media lab sponsor commun began inquir devic place danc shoe applic tactil cue open interact kind digit sensat helmet closest unusu bruce synthet charact group produc item shown fig left photograph show wireless interfac instal exhibit siggraph toi shoe card center prototyp control anim chicken agent screen shoe card measur inerti motion queue twist wirelessli transmit paramet back host algorithm run result data appropri instruct anim agent photograph fig show evolut shoe sensor concept form inerti measur unit fit insid common complet rf loop batteri dai continu oper stream data hz pair devic built instal shown siggraph user control virtual danc draw inspir famou scene gold rush creat pair input devic outer case fork stuck mimick pair leg insid varieti gestur recogn similar algorithm control virtual charact transmit rf signal enabl identifi capacit receiv tabl set dinner plate futur direct develop cycl lesson learn experi perform chronicl develop versatil interfac foot devic usabl addit design make electron enabl easi shoe size final shoe size span wider rang feet ad subtract layer simpl power manag regul optim extend continu batteri life significantli current span rf solut devot fix frequenc stream data shoe fig ineffici illeg oper part world devot separ base station superior strategi shown fig scheme address wireless sensor packag involv significantli complic rf hardwar data scale easili instrument full ensembl dancer place discret wireless sensor packag bodi access addit gestur feet commerci packag make potenti solv bluetooth transceiv appeal consum applic bluetooth devic limit node base station devot overhead dynam network capabl potenti perform applic sort paper develop system diagram fig static network topolog priori program commun set fast transceiv sensor packag place sensor feet technic adjust modern dancer gestur entir bodi current interact danc system base video track monitor bodi proper adequ address feet hour dancer learn direct gestur music system present environ standard tap produc output contact floor system slow tap perform hz state updat rate coupl process delai incur host foot dynam continu measur tactil system elev enabl express freedom bare begun subject descript data stream shoe system gestur area bear fruit autom danc sport research data acquisit system open vista sport upcom era digit exploit similar sensor data stream directli figur blade glove entertain map inform potenti includ parametr adjust music explor shoe music system blend music composit articul cunningham recent map give perform access complic music palett link devic logic requir level music talent coincid dancer adept musician work shoe system acknowledg stage project benefit collabor colleagu mit media laboratori eric josh matt chri electron ari adler aid andi wilson sensor analysi hsiao music bruce blumberg synthet group support collabor colleagu danc commun invalu enthusiasm happi acknowledg byron mark mia dawn brian rachel rose sarah bradi david music contribut launch collabor byron cornel media laboratori sponsor donat compon provid relat technic jack analog mem park measur specialti amp support thing consortium sponsor mit media laboratori refer de band spain instrument metropolitan museum journal american music instrument vol innov electron music articl music box monthli onlin period american music octob music ieee spectrum decemb pp danc space time saturdai review ny electr past electron stori nerv challeng interact overview case comput music vol winter pp di keyboard juli pressur foot pp gestur detect applic virtual ieee intern confer cybernet comput cybernet vol oct pp phantom report tokyo institut siggraph confer abstract acm siggraph circuit octob pp danc proc intern symposium wearabl ieee comput societi oct pp ky hsiao interact proc xii colloquium music septemb pp wireless multisensor interfac dancer proc intern danc technolog temp feb pp music instrument danc proc intern comput music octob pp interlink model pressur sensor vol septemb pp circuit issu pp interact behavior common ibm system vol pp seri bend imag ny applic electr field comput music vol pp tg area ibm system vol pp mj sensor theori sensor vol march pp express ms mit depart electr engin comput scienc mit media cambridg propriocept toi ibm system vol pp work silicon circuit june pp realm silicon circuit august pp ultrason catalog oem compon cambridg ma part theori circuit januari pp wireless sensor network smart intellig transport ms mit depart electr engin comput scienc mit media technic document rogu midi manipul versu path softwar jm mit pp pc slip busi oct saul person commun vector tape measur measur confer human factor comput system april acm pp jerri barri british person al toi direct autonom anim siggraph confer abstract acm siggraph toi direct synthet human factor comput acm acm pp compact inerti measur unit gestur recognit ms mit media cast confer abstract siggraph acm august pp gold unit written stare min bluetooth radio ieee person vol februari pp wireless smart sensor ms mit depart electr engin comput scienc mit media sept interact danc nervou proc connecticut colleg symposium art connecticut pp biographi joseph mit media cambridg ma dr princip research scientist mit media lead environ group technolog director thing consortium prior held posit draper laboratori massachusett swiss feder institut technolog zurich design physic spacecraft control sensor system receiv bs electr engin physic tuft phd physic massachusett institut technolog ct fellow design interfac electron recipi discov award entertain mit media room cambridg ma mr hsiao graduat student mit media lab environ work interest physic sensor technolog interact music receiv bs mit electr engin comput scienc interest music start earli ag ari mit media room ma mr research associ environ group media pursu research real time gestur recognit algorithm inerti sensor interest includ smart sensor system design transpar intuit interfac interact exhibit receiv engin physic british canada mit media st ma ms joint graduat student mit media lab mit microsystem technolog laboratori work lightweight transmitt reconfigur softwar radio base station asymmetr wireless project collabor joe design build hardwar bruce blumberg exhibit receiv bs electr engin comput scienc mit figur figur simpl band electron wearabl technolog music express figur function diagram express electron sensor suit figur origin work prototyp shoe figur perfect protect electron cover remov figur recent sensor circuit card figur block diagram circuitri figur block diagram figur configur express system figur sampl segment data show shoe sensor figur photo galleri express interact music project figur layout stage american danc festiv perform figur recent collabor synthet charact group express interfac figur asymmetr rf network develop wireless perform project
AI/1054 2 make www intellig dieter stefan michael rudi studer institut germani abstract world wide web view largest knowledg base exist support queri answer autom infer limit formal ontolog mean enrich web document repres semant inform overcom bottleneck ontolog enabl inform search deriv knowledg repres www paper describ softwar tool call ontobrok support realiz idea basic formal tool formul defin annot html document ontolog inform introduct world wide web huge amount knowledg subject html document enrich applic provid knowledg anim virtual hypertext link web document repres relationship knowledg entiti base html browser present materi user distribut inform knowledg unit metaphor knowledg base www bring bottleneck web mind support autom infer limit deriv knowledg exist knowledg support main infer servic web search facil carri search web web web catalogu engin collect set knowledg portion web keyword limit infer access exist knowledg stem fact main type standard knowledg web html standard repres knowledg defin link knowledg unit english languag repres knowledg unit deriv semant inform automat sentenc natur languag unsolv problem infer keyword search deliv result lead lot unrel inform time miss lot import inform recal ontolog improv automat infer support knowledg base www ontolog explicit specif ontolog discuss literatur mean support knowledg share noi approach base assumpt model explicitli number share knowledg expect ontolog web user ontolog annot web page negoti standard repres knowledg subject metaphor newsgroup defin role ontolog group peopl share common subject relat point view subject annot knowledg enabl automat infer base share ontolog creat term refer group web user joint ontolog design implement coupl tool enabl ontolog enhanc web develop broker architectur call ontobrok core queri interfac formul infer engin deriv webcrawl collect requir knowledg web provid languag formul ontolog subset formul defin queri languag formal semant defin enabl automat reason infer engin annot languag offer enabl knowledg provid enrich web document ontolog inform strength approach tight coupl semiform formal inform knowledg support mainten provid servic gener knowledg manag integr reason semiform document content paper provid gener motiv approach section section sketch gener architectur ontobrok part languag repres formul annot web document ontolog inform discuss section section discuss main tool graphic queri infer webcrawl discuss possibl limit ontobrok provid section relat work section bottleneck www bypass ontobrok www huge amount inform inform kei factor enabl success stori formal simpl retain high freedom present inform strictli follow basic design paradigm web document approach restrict inform provid decid repres inform modifi format web document hamper techniqu introduc difficult languag defin semant introduc small extens html discuss extens relat emerg web standard xml rdf approach incorpor basic paradigm made www success sketch shortcom www motiv approach freedom inform simpl formal bottleneck access inform web grow amount inform factor led success hamper basic search techniqu human textual graphic hyperlink keyword base search engin retriev hyperlink process queri answer infer servic www limit compar relat deduct enabl queri infer servic deriv knowledg discuss exampl illustr limit current www access imagin find research subject research smith feather consult search engin result huge set page kei word feather present limit page string feather return page complet irrelev import page miss imagin headlin page import frame homepag page assum keyword page person identifi requir human search effort investig page page requir inform found search engin special retriev homepag person make inform research special retriev address inform make sophist queri person format queri list hyperlink textual graphic inform denot requir human read extract relev inform inform sourc research subject mr feather list research topic wide knowledg softwar requir human extract retriev inform burden web user addit loss time limit inform retriev automat agent miss common knowledg requir extract inform textual consequ outcom web queri directli process softwar tool human extract repres fit standard mention problem trivial compar queri refer content page imagin find research subject research group figur written central page research page determin member research group page requir search effort lack recal make queri impract distribut heterogen group peopl web imagin extract research topic research work ontolog show fairli mention case cook current inform access www handl inform distribut locat page current retriev servic retriev inform repres www sound trivial significantli limit queri answer capabl imagin feather write homepag cooper research motta investig formal specif method complet miss inform motta repeat inform homepag consult page answer mechan make implicit symmetri cooper provid answer smith research cooper research issu motta deriv motta research receiv inform explicitli state motta page make type inform relationship sum discuss identifi limit inform access www bypass semant inform guid queri answer process enabl answer syntax semant directli understood process automat agent softwar tool enabl homogen access inform physic distribut heterogen repres www provid inform directli repres fact www deriv fact background knowledg architectur ontobrok gener architectur broker servic ontobrok shown figur consist main queri infer webcrawl element accompani formal queri languag formul languag annot languag annot web document ontolog inform user commun infer engin queri interfac interfac graphic hide syntax queri languag enabl direct access text base user directli type queri queri languag interfac realiz intranet technolog graphic interfac realiz execut modern web browser netscap explor specif techniqu inform present ontolog access exploit structur queri languag ingredi enabl guid queri formul textual queri interfac ontobrok realiz user type queri plain text infer engin receiv queri client inform sourc deriv ontolog chosen client fact found www basic infer mechan infer engin deriv minim model set horn section languag repres ontolog syntact enrich idea rid limit horn logic requir infer mechan languag richer epistemolog primit predic logic provid frame logic languag ontolog incorpor relationship semant framework improv access servic realiz translat ontolingua section detail search fragment www make ontolog collect knowledg fragment implement wrapper translat annot web document fact formul languag infer engin queri client awar syntact fact repres web abstract mechan knowledg provid annot languag provid ontolog annot knowledg portion index annot document annot languag ontolog ontobrok annot document answer queri collect fact web decoupl current architectur collect fact independ queri effici reason queri period cach annot start knowledg provid submit knowledg fragment web experi show stronger coupl mechan requir subsequ discuss languag tool provid ontobrok fact queri knowledg ontolog fig architectur ontobrok infer provid index ontolog engin languag annot languag queri languag queri interfac languag ontobrok discuss formal ontobrok describ formal defin ontolog discuss queri formal client inform final discuss annot formal knowledg provid annot web document ontolog inform formal ontolog formal approach defin ontolog approach base descript ontolingua conceptu graph syntact extens full predic horn logic orient approach deduct logic program make choic paradigm kei requir design choic abil provid effect effici infer servic enabl queri answer ontolingua kif intend portabl ontolog specif provid infer support infer engin languag base full predic full fledg theorem prover support languag system base descript logic loom provid kind consist check ontolog subsumpt classif instanc applic scenario queri answer instanc techniqu deduct evolv relat explicitli design type queri answer facil infer techniqu deduct logic program develop return ground instanti predic answer effect effici queri evalu procedur languag base infer engin horn logic simpl horn logic epistemolog point view epistemolog primit simpl predic logic horn logic subset rich support adequ ontolog artifici express logic relationship horn subsequ discuss bypass shortcom elementari express ontolog defin concept axiom adequ languag defin ontolog provid model primit concept model primit integr logic framework provid horn logic subset contrast descript logic express ontolog recent extend descript logic step direct directli part ontolog class citizen instanc valu concept attribut provid answer variabl substitut slightli modifi variant suit elementari model primit mean class subclass instanc mean instanc class attribut mean instanc class attribut instanc attribut mean instanc attribut mean part syntact convent transit exact behaviour applic domain depend predic express usual logic base term object express compar origin skip function attribut function attribut defin kind integr constraint syntact valu function attribut appli object semant equal set axiom knowledg provid web redund slightli differ present knowledg provid decid includ integr constraint basic primit languag complex express elementari express complex built distinguish complex doubl queri fact ground elementari express rule consist implic sign head conjunct elementari express bodi complex formula built elementari express usual predic logic connect impli variabl introduc front head bodi exist doubl rule express head head bodi conjunct elementari express doubl rule understood abbrevi head bodi bodi head rule predic elementari express foral foral exampl doubl rule tabl syntax descript complet languag figur illustr ontolog defin languag consist resp concept defin subclass relationship attribut definit part split readabl reason set rule defin relationship concept attribut part ontolog entir defin small concept attribut rule relat concept provid tabl concept hierarchi consist elementari express declar subclass relationship attribut definit declar attribut concept valid fig languag start rule queri rule fact molecul molecul formula formula formula formula formula formula molecul identifi molecul refer specif refer object specif identifi path object specif path object path method method method object identifi path attribut rule ensur symmetri cooper rule person public vice versa kind rule complet knowledg free knowledg provid provid inform place reduc develop mainten effort translat ontolog usag ontolog defin plan provid translat languag investig translat ontolingua ontolingua translat languag kif main build block formul ontolog ontolingua sketch translat base syntact transform ontolingua translat ontolingua provid support class attribut definit rule class definit translat class definit ontolingua row tabl subclass express addit attribut translat relat addit relat definit rule defin attribut valu incorpor relat definit attribut tabl ontolog definit concept hierarchi attribut definit rule person object person research firstnam lastnam email public affili author titl year abstract foral foral definit sixth work translat process queri formal queri formal orient defin notion attribut valu gener schema tabl translat ontolingua definit ontolingua definit object person foral person person research foral research mean object instanc class attribut posit scheme constant arbitrari express ontolog part knowledg base ontolog definit valid knowledg base provid queri illustr approach foral queri instanc class research object identifi research queri result larg list url simplest queri interest interest inform research properti email address research richard achiev foral em scenario ontobrok answer research richard knowledg base obj ln benjamin em foral interest point queri ontolog rule symmetri cooper research motta cooper ontobrok deriv research cooper ontolog strong rule abduct complet type relat defin research instanti cp cooper motta research ontobrok deriv instanti element class research rule exampl ontobrok deriv knowledg directli repres www ontobrok collect distribut inform queri figur collect research topic member research group system institut retriev research topic research group distribut homepag research possibl queri knowledg base inform ontolog queri queri rule head foral class defin ontolog subclass class object queri foral attribut class research class queri interfac ontobrok directli queri languag abstract queri form graphic significantli simplifi queri process naiv user section provid annot ontolog inform knowledg www formul languag develop extens html syntax enabl ontolog annot web page provid gener idea introduc detail significantli annot effort knowledg provid overview extens html definit fig textual queri interfac annot languag provid figur extract page figur make extens markup languag defin annot languag extens html exist html page xml document type html defin xml restrict html wide compar section fig annot languag anchor bodi attribut attribut cdata url cdata cdata cdata host class host relat object host object object class id relat id object url cdata richard benjamin richard benjamin artifici intellig research institut spain dept social scienc informat netherland fig html page gener idea idea approach html start point add ontolog relev tag origin html page knowledg page annot made access fact ontobrok approach knowledg provid annot web page complet formal knowledg page remain readabl standard browser netscap navig ms explor sourc consist reduc develop mainten effort factual ontolog inform html page class relationship provid ontolog defin languag section denot instanc attribut relationship defin annot languag identifi handl identifi object handl global uniqu unambigu chose url resourc www denot natur exampl url defin definit uniqu determin entiti refer internet identifi call object figur provid epistemolog primit annot ontolog inform web object defin instanc class attribut set relationship object establish kind express extend version frequent html anchor anchor tag defin locat web page hypertext link locat www attribut href fulfil ontolog annot web page ad attribut syntax anchor attribut attribut inform describ object relev ontobrok typic provid inform defin object state class ontolog instanc richard benjamin defin class research express html extens line home page line state object denot handl uniqu denot address point address equal type handl gener equal axiom equal type introduc web server instanc class research handl url richard benjamin home research denot url home page class possibl set attribut instanc class defin valu attribut defin attribut web page knowledg provid object defin attribut associ ontolog attribut email object class research richard benjamin provid email line home page line state object denot handl attribut email object attribut defin singl web object relat explicitli relat rel object handl obj obj definit obj obj obj list exampl esp long object handl due write inform browser ontobrok annot languag mean annot web page rid big portion clumsi redund section provid exampl illustr kei idea improv conveni defin web page object instanc richard benjamin kind term class substitut concret class defin underli articl object denot handl host defin instanc class possibl defin host object special keyword repres url host equal string url process html page defin handl host object tag defin url page tag instanc class person clumsi origin url ontolog inform readabl describ annot syntax lower case special charact read liter upper case term replac actual url host equal string tag string current region defin current anchor tag instanc class case tag ontolog semant enrich subnet www tag defin region object class articl assum page tag creat object handl al belong class articl host equal string page anchor tag refer host object work correctli anchor tag kaw canada tag defin page hyperlink refer object class workshop global url url object handl newli creat object part page embrac clickabl host assum concret object actual url url defin belong class kaw canada tag defin page url object class result fact previou variant region clickabl improv conveni defin attribut valu relationship similar techniqu provid special keyword support iiia artifici intellig institut tag defin keyword page href tag defin affili attribut object denot url current page attribut plain text complet keyword keyword enforc mark portion web page attribut richard annot defin richard attribut firstnam object denot page convent annot web page redund avoid annot relationship web page special keyword actual url freeli relationship meet relationship call appoint defin defin relationship attribut object denot current richard home denot object denot actual liter refer text bodi titl meet tool set ontobrok ontobrok mediat client knowledg provid tool queri interfac client formul queri receiv answer infer engin deriv answer base ontolog fact found web webcrawl collect annot web translat fact process infer engin queri interfac ontobrok queri text base interfac expert user graphic interfac naiv user text base interfac direct formul queri queri languag direct formul queri string user syntax queri languag mean type syntact express user learn queri languag search engin peopl make mistak type good interfac lead user avoid mistak user formul queri bigger miss knowledg queri knowledg ontolog formul knowledg organ ontolog interfac present ontolog easi access remedi structur queri languag gener structur elementari express guidanc design queri interfac part depict elementari express relat entri field valu entri field select menu variabl free user type understand logic express simpl express combin logic connect shown figur research benjamin email address resolv support select class attribut ontolog select ontolog present manner ontolog repres larg hierarchi concept handl hierarchi user scan vicin class suitabl formul queri user overview hierarchi easi quick navig class hierarchi class requir met present scheme base hyperbol geometri class center depict larg class border surround circl mark small circl figur techniqu quick navig class center close examin class vicin user select class hyperbol ontolog class class user select attribut attribut choic preselect class determin attribut interfac program java execut major platform java support exist hyperbol ontolog view base written vladimir fig advanc queri interfac base interfac ontobrok deriv automat queri textual form present result queri figur infer engin ontobrok infer engin ontobrok kei translat process rich model languag restrict evalu express restrict languag describ process input infer engin consist collect fact web queri formul decid direct evalu express rich model languag due conceptu rich languag evalu techniqu complic difficult build techniqu evalu support languag semant full order rule direct evalu approach small chang input languag result system situat similar compil languag compil directli target intermedi state languag bridg conceptu gap languag target languag adopt input process translat step translat express logic express tabl idea translat catch complet fig hyperbol ontolog view complex express translat output stage gener logic program translat output translat normal logic program tabl principl translat frame logic predic logic frame logic mean predic logic class subclass instanc class instanc attribut instanc instanc attribut part fig textual queri interfac transform entir translat process survei figur result obtain normal logic program standard techniqu deduct applic implement fixpoint evalu procedur negat bodi carefulli select semant evalu procedur result program simpl stratifi semant evalu techniqu call dynam filter translat frame logic result logic program limit number result program stratifi figur reason model comput stratifi semant deal stratifi negat adopt model semant gelder comput semant dynam filter altern fixpoint approach input output ontolog instanc queri normal logic program fixpoint procedur transform frame logic predic logic variabl frame logic substitut languag variabl substitut variabl substitut rich languag primit object model restrict languag relat horn fig stage languag infer engin foral foral translat neg cycl fig stratifi due neg cycl infer engin complet written java bound system perform reason gener machin code version compil simpl period cach annot page web find page consult index page provid provid regist discuss approach futur work provid inform knowledg ontobrok requir design ontolog annot web document bottleneck hamper success ontobrok discuss problem design ontolog time consum activ aim formal consensu model aspect realiti build model pai back dimens improv web present document compani refer model intern data inform standard establish standard repres inform area ontolog found popular support knowledg manag area initi colleagu research group knowledg annot initi insight merit difficulti establish ontolog part initi establish ontolog describ research group knowledg subject initi coupl interest question tool support ontolog engin heterogen distribut environ organ social process establish consensu attract critic mass particip core ontolog establish broad rang research group particip usag maintain knowledg kei problem solv knowledg manag ontolog support process ontobrok support usabl maintain document strength ontobrok tight coupl semiform formal knowledg identifi main requir success knowledg manag textual semiform knowledg directli coupl annot describ formal semant mainten deal problem introduc redund repres inform time textual knowledg formal ontobrok integr semiform knowledg infer rule express ontolog automat process knowledg coupl automat deriv knowledg bit sourc enabl appli ontobrok project work orient design knowledg system develop knowledg manag system industri design ergonom page ergonom knowledg make retriev knowledg infer system case knowledg numer provid input problem solv method parametr design annot web document ontolog inform easier train person basic html knowledg annot ca page hour thousand provid sophist tool support process annot written text editor queri interfac make graphic ontolog process produc annot possibl stabl web sourc replac annot effort write wrapper mention inform sourc cia world fact book yahoo list countri sourc stabl format inform deriv wrapper extract inform wrapper directli deriv factual knowledg infer engin ontobrok scenario wrapper replac annot process translat process annot fact decid design annot languag small extens html document web formal trend awar intern world wide web consortium develop promot standard introduc extens markup languag standard express structur web document xml languag defin syntax structur document commun applic due common specif document syntax annot xml document develop resourc descript framework format add meta inform includ semant inform document approach show number similar approach aim content inform enabl autom process web resourc url repres entiti www pair defin properti object profound differ annot inform tightli integr html ontobrok reduc redund inform web page minimum meta data defin rdf provid extra page insid element web page text fragment link directli annot semant element repeat enrich design problem maintain web document due redund inform final version rdf recommend easi task implement wrapper automat gener rdf definit annot ontobrok join standard enabl agent read meta inform annot languag ontobrok mainten tool rdf descript direct annot element web page separ content descript gener automat automat gener rdf descript make annot knowledg agent broker servic search web inform knowledg ontobrok answer direct question human user autom search mechan read rdf make ontolog relat work infer capabl world wide web limit restrict search facil offer web search engin paper introduc method tool enhanc web www ontolog mean annot www document semant inform metaphor newsgroup defin collect peopl share common view subject common ontolog defin subnet www ontolog annot web document frame logic defin ontolog subset queri web annot languag attach ontolog inform web document offer avoid redund ontobrok tool includ queri interfac formul infer engin deriv answer pose web crawler search subnet translat ontolog annot fact infer engin web crawler implement wrapper hide syntact structur annot infer engin queri client ontobrok basi realiz knowledg acquisit initi develop knowledg manag system industri design ergonom question knowledg human infer system twofold piec knowledg enabl tight coupl semiform formal knowledg ontobrok present ontobrok tool enhanc inform access mainten distribut heterogen inform sourc import topic steadili amount knowledg provid semiform knowledg sourc web document annot part document semant inform enabl automat support modifi document search hand document part inform chang automat propag modif chang semiform natur document approach close shoe introduc idea ontolog annot inform www html page annot ontolog support inform retriev base semant inform exist main differ underli shoe provid inform introduc arbitrari extens ontolog central provid index defin queri client ontolog term annot html page web crawler miss knowledg fragment entir www answer miss import inform web crawler miss knowledg portion entir www ontobrok reli notion defin group web user ontolog subject inform provid client complet knowledg ontolog term provid index complet collect annot html page ontobrok deliv complet answer pose queri philosophi ontobrok tailor homogen intranet context knowledg manag shoe ontobrok differ respect inferenc capabl shoe descript logic basic formal offer limit inferenc capabl ontobrok reli support complex inferenc queri answer comparison reason situat ontobrok gener context approach support integr distribut heterogen inform sourc carnot infomast inform manifold herm sim tsimmi assum global data scheme system mediat translat user queri inform sourc integr wrapper content descript inform sourc provid connect inform sourc mediat approach assum inform sourc stabl syntact structur wrapper extract semant inform heterogen larg collect web page assumpt fulfil applic area deleg semant enrich inform sourc provid make assumpt format inform sourc wrapper approach complementari distinguish type inform sourc sourc type stabl format wrapper extract inform type cover home page person layout standard stabl time write wrapper type sourc activ write wrapper stabl inform sourc automat gener factual knowledg process ontobrok enabl broaden approach structur inform sourc make annot languag acknowledg richard benjamin rainer comment provid ontolingua translat special angel develop infer engin ontobrok refer ambit agent inform ieee de model der mit st hsu retriev integr data multipl inform intern journal intellig cooper inform ashish wrapper gener internet inform sourc ifci confer cooper inform system south reifi concept descript logic intern joint confer artifici intellig august michael knowledg annot initi knowledg acquisit commun banff knowledg acquisit system workshop april benjamin commun banff knowledg acquisit system workshop april resourc integr larg knowledg base ieee decemb principl knowledg corpor memori cooper creation knowledg base banff knowledg acquisit workshop novemb ontolingua tool collabor ontolog intern journal studi ontolog semant enrich subnet www intern workshop intellig inform integr german annual confer artifici septemb workshop compar descript frame data knowledg engin noi noi state art ontolog ai florid prototyp intern confer data engin exhibit inform integr system acm sigmod intern confer manag genesereth knowledg interchang version refer report stanford june translat approach portabl ontolog knowledg kandzia dood dl integr krdb august logic foundat journal framework effici implement deduct advanc otto andrea corpor memori knowledg manag industri prospect journal comput special issu inform technolog knowledg springer scienc august lamp lai visual larg tree hyperbol space acm symposium user interfac softwar peter techniqu base hyperbol geometri visual larg hierarchi acm sigchi confer human factor comput jw foundat logic edit algorithm inform agent august lloyd make prolog journal logic knowledg discoveri web workshop inform system august web agent intern confer autonom loom user scienc design choic internet search ieee reason hybrid lnai garcia object exchang heterogen inform sourc ieee intern confer data engin march java ahead time compil confer technolog system resourc descript selberg metacrawl architectur resourc aggreg ieee hybrid integr knowledg web aaai spring symposium artifici intellig knowledg heterogen reason mediat technic distribut ontolog banff knowledg acquisit system workshop novemb uniform resourc van altern fixpoint logic program journal comput system gelder van semant gener logic journal mediat architectur futur inform ieee extens markup
Agents/1055 1 grand cliff autonom agent fl kluwer academ boston manufactur netherland entertain softwar agent artifici life stephen grand technolog bridg cambridg uk dave cliff artifici intellig massachusett institut technolog cambridg ma usa nick jen abstract present technic descript commerci softwar packag creatur exist number synthet agent user interact agent intend sophist intern architectur creatur strongli inspir anim biologi creatur neural network behavior model simpl energi metabol system interact neural network model modul neuron activ stage develop biolog inspir learn mechan neural network adapt lifetim creatur learn includ abil acquir simpl languag network architectur detail biochemistri creatur evolutionari adapt sexual reproduct platform late offer user opportun engag artifici life technolog addit describ technic paper conclud discuss scientif implic system artifici adapt evolutionari entertain softwar introduct autonom softwar agent potenti applic entertain industri paper cliff discuss interact entertain product base agent techniqu origin develop artifici life adapt behavior research call human user interact synthet agent inhabit close environ artifici neural network control artifici biochemistri energi metabol hormon regul network biochemistri possibl evolutionari adapt sexual reproduct commerci aspect creatur interest scienc engin commun paper discuss aspect product relev autonom agent research grand cliff europ late japan north america summer run macintosh platform section discuss relat work section present descript technic aspect section conclud specul comment scientif impact product background artifici life adapt behavior ten distinct close relat field scientif inquiri artifici adapt behavior artifici life research commonli studi artifici system exhibit view occur planet earth root instanc space live offer possibl live digit organ exist virtual space artifici life research potenti address wide rang emerg evolut speci cultur social dynam occur evolv agent learn commun adapt behavior research issu studi autonom real biolog agent artifici autonom commonli refer adapt behavior literatur animat autonom mobil softwar agent virtual space emphasi adapt behavior research mechan agent coordin percept human extend period time order surviv environ gener mistak popular book levi kelli academ literatur artifici life adapt recent confer edit brook mae cliff al moran al mae al langton husband harvei artifici adapt behavior research strong emphasi model biolog draw inspir biologi develop artifici system autonom agent develop adapt behavior research artifici neural network coordin percept action gener background neural rumelhart mcclelland arbib studi address issu idea biolog form genet algorithm goldberg genet program koza aspect design agent valu paramet govern structur encod agent popul agent initi creatur random genom agent assess measur intend task environ agent select reproduct genet materi agent creat combin randomli alter materi genom parent figur agent replac agent process replac continu period peak averag fit agent popul design task environ direct human artifici evolut view form parallel stochast search space design offspr mutant mutat crossov point parent parent figur fundament genet oper genom select reproduct basi repres string charact sexual reproduct model randomli point form copi genet materi parent crossov copi remaind parent genet materi mutat model randomli select posit genom replac genet materi randomli materi autonom agent entertain briefli summar work artifici life adapt behavior research relev creatur semin work reynold establish possibl autonom agent behavior techniqu movi sequenc show behavior synthet agent produc human anim give broad detail pose specif subsequ relat terzopoulo al grand cliff faith kinemat simul fish model impress visual accuraci biolog plausibl behavior share reynold origin work relianc skill manual design agent physic behavior control requir invest skill labor mae review academ research note bate world pioneer provid virtual world inhabit artifici agent user interact keyboard input directli control behavior specif individu exhibit emot vari basi intern creatur develop independ clear similar conceptu level recent loyal bate work publish autonom agent literatur compar creatur includ van gent lester stone face difficult task design lifelik synthet agent entertain research drawn inspir biologi blumberg develop behavior control mechan inspir find etholog scienc anim control synthet dog inhabit simul interact human user virtual agent object environ research work develop techniqu reduc relianc skill labor incorpor type automat adapt learn mechan agent softwar reynold explor genet program develop control program synthet agent move world simplifi kinemat sim emploi similar artifici evolut techniqu develop physic morpholog artifici neural network control synthet autonom agent inhabit world realist kinemat creatur introduc creatur environ section detail creatur neural network section section describ biochemistri creatur determin neural network biochemistri section environ creatur inhabit effect platform environ depth cue object rel front typic world measur approxim screen horizont screen window scroll smoothli follow select creatur world number object creatur interact varieti creatur wai system written program virtual object world script attach determin interact includ creatur agent static part environ object elev button press addit object environ subsequ acquir download ad world show view part world shown figur figur screenshot show view part creatur world user pointer environ pointer imag human hand user move object environ pick drop attract attent creatur wave hand front stroke gener reinforc gener reinforc typic creatur shown figur creatur minor morpholog detail color hair type genet grow size creatur approxim life creatur genet creatur manag surviv ag gene eventu kill creatur creatur simul touch model grand cliff approxim techniqu simul vision involv simul optic process retin imag object line sight neuron repres presenc object visual field activ approxim sensori process fairli common neural network research sound attenu distanc object creatur object creatur ey point direct simpl figur creatur creatur learn simpl keyboard input plai interact creatur environ typic target ten creatur activ time degrad occur section describ detail neural genet creatur neural network creatur brain heterogen neural object call defin chemic morpholog characterist group cell cell lobe form connect cell sourc lobe perform function net figur show schemat interconnect lobe network architectur design biolog comput construct creatur figur sampl interconnect lobe initi creatur brain approxim group interconnect roughli paramet genet control vari structur neural architectur design satisfi ffl effici world ten creatur requir process neuron synapt connect addit load displai rest ffl capabl support initi brain neural configur control gener creatur ffl capabl express neural initi ffl mutat recombin fair chanc construct system equal higher util parent section describ compon neural section explain compon organ give creatur brain model compon neuron singl lobe share characterist vari wide rang possibl aspect neuron dynam determin simpl scalar numer defin complex mathemat express factor control genet construct lobe paramet neuron grand cliff tabl exampl explan state sum input ad previou state state minu input excitatori inhibitori state sum input input fire previou state state time state current input modul ffl input cell possess class input signal sourc lobe ffl input modul input high effect input valu low effect input valu reduc ffl rest neuron intern scalar numer comput genet defin express absenc neuron state equal rest state ffl relax perturb alter neuron intern intern state return rest state approach rest state rate determin relax rate ffl output neuron intern state greater threshold case output intern state ffl genet defin function map input signal comput intern state neuron intern state comput genet defin function interpret control aspect synapt behavior express design interpret extrem genet mutat syntax error comput state valu wai tabl function present provid order power futur evolutionari improv system neuron state function appli exponenti return defin state import relax function act damp neuron state faster harder disturb tension input relax creatur figur state relax system provid integr input state neuron reflect intens frequenc stimuli neuron fed signal cell carri class characterist sourc integr type data main paramet ffl modul input signal ffl weight act rest state statist reinforc ffl relax rate relax back ffl relax rate rise ffl current suscept reinforc ffl suscept relax suscept paramet ffl control migrat ffl reinforc express comput ffl suscept express comput sensit reinforc ffl strength gain express comput strength ffl strength loss express comput grand cliff signal arriv modul provid output rise trigger reinforc activ relax exponenti slower react strongli individu reinforc effect comput move averag creatur meet situat find chosen action immedi strongli repeat incent present situat bad experi creatur interpret sweep initi wire defin birth small number genet migrat process activ life wire alter dynam neuron attempt connect lobe direct spatial multipl fan distribut side optimum sourc cell figur individu migrat form connect sourc strength chang comput chemic strength fall disconnect rule find connect migrat rule chosen order fulfil requir initi brain model current research direct aim develop gener migrat scheme extra migrat involv competit cell repres input implement part model gener problem left disconnect brain model architectur gener engin circuitri defin genet section describ specif organiz model system implement gener creatur figur show arrang lobe creatur brain model neural circuit devot minor task lobe implement mechan stimuli arriv object environ cell fire input lobe cell repres class signal map output sum intens frequenc stimuli time simul inhibit cell compet control creatur attent creatur gaze sensori fix recipi action creatur mechan limit creatur mode serv reduc sensori neural process accept net object time creatur figur arrang lobe creatur brain model bulk remain neuron connect make combin group sensori input larg region concept event memori laid small massiv lobe call relationship memori store action model base reinforc drive reduct cell concept space simpl comput output calcul logic function analog signal percept lobe sensori system fire input fire cell randomli wire seek pattern occur cell commit remain connect strength fall biochem feedback loop attempt maintain pool uncommit neuron leav repeatedli cell connect long period percept lobe sensori total number cell requir repres sensori permut input larg migrat mechan design round problem record portion input space turn relev number problem work layer repres singl grand cliff object neuron highli feed concept space job form relationship concept cell record synapt weight action sensori circumst decid current synapt sensit modul reinforc conduct signal cell cell fire connect repres condit current decai exponenti time sensit repres relationship current sensori schemata latest action remain sensit period order respond share defer reward punish connect action concept capabl migrat search sourc signal biochem feedback loop control repeat reinforc strength cell sum input current state fact sum type input subtract sum type relax rate cell cell accumul number short base number concept cell intens cell winner creatur invok action script neural network includ mechan gener concept space seek repres permut input exist total sensori situat obtain system capabl gener learn relationship situat sensori situat deem relat share individu sensori situat evok memori relat situat repres learn experi relat situat offer advic react situat find green thing stare iv rememb thing stare ey kiss good hit big green doesnt work ill situat turn qualiti experienc total learn reinforc long fire strongli long reinforc suppli proport cell creatur gradual learn discrimin acquir memori form gener futur learn provid layer weight exist reward chemic excitatori creatur punish chemic inhibitori chemic gener directli stimuli chemic reaction involv creatur maintain set chemic repres drive avoid drive reduc higher concentr press drive stimuli product drive drive chemic react level drive creatur activ respond reduc drive reduc produc punish reward chemic drive punish drive reward drive reduct weight excitatori drive reinforc inhibitori reduc drive balanc punish reward action object return net punish net creatur intern state time creatur learn eat hungri full brain model ambiti sever limit rang cognit function primit reinforc mechan serv provid learn logic creatur doesnt suffer side gener mechan reduc arbitrari face dynam albeit damp close produc satisfactorili complex believ sequenc surprisingli free limit cycl repeatedli cycl fix sequenc point attractor determin dynam neural network stabl challeng topic current research beer biochemistri central function neural net simul biochemistri control widespread inform intern feedback loop extern system mechan simul function basic metabol simpl immun system biochemistri straightforward base class receptor combin object form biochem structur grand cliff chemic arbitrari numer label rang repres chemic numer repres current concentr chemic inher reaction undergo defin restrict base chemic physic characterist molecul emitt chemic produc genet defin attach arbitrari byte valu system neuron brain output sensori system locu attach defin descriptor start emitt repres code chemic emit gain characterist emitt byte emitt attach automat emitt adjust code chang awar emitt exist reaction chemic undergo transform defin reaction reaction form ia determin ratio option compon bracket transform normal reaction product exponenti decai breakdown reaction defin immut chemic law reaction product reaction exponenti time receptor chemic concentr monitor attach set arbitrari byte defin locu emitt receptor gene chemic receptor respond threshold nomin output part brain bodi receptor chemic biochem structur attach receptor emitt loci brain lobe widespread feedback path combin reaction path implement control synapt provid learn reinforc interact control creatur wait evolut discov control vital neural biochemistri implement system compulsori digit expect gener public simpl metabol system simul base energi select biochem reaction produc effect plant emit synthet inhabit environ carri invok product simplifi immun popul mutat offer potenti popul popul strain harm rapidli spread popul creatur creatur genet suscept kill reduc chanc surviv long reproduc creatur resist immun rel genet resist spread creatur reduc strain harm rel strain popul shift genet constitut popul trigger genet shift interact potenti continu indefinit figur summar process interact creatur environ genet creatur structur function determin gene genom provid inherit user expect creatur show characterist identifi drawn parent troubl ensur genom capabl evolutionari includ introduct structur brought duplic mutat gene genom string divid isol gene mean mark gene type characterist length byte interpret specif byte genom gene safe mutat fear crash system grand cliff figur summari interact creatur environ creatur genom form chromosom parent gene cross splice gene boundari crossov error introduc gene omiss duplic small number random mutat gene bodi appli prevent excess failur rate due reproduct error critic gene header specifi oper duplic perform perform gene linkag proport separ link characterist expect facial genom prevent characterist simpli inherit creatur opposit sex gene carri genet instruct gene express form individu sex determin male femal gene express gene header determin time genom gene express cater creatur gene simpli code outward speak red human vast major code function emul fact real gene code produc turn produc characterist stai true principl genotyp phenotyp separ order abstract gene creatur genom code structur reaction brain outward phenomena strength discuss difficult provid project essenti scienc object creat biolog behavior suffici satisfi expect gener public result sale unit creatur product sold week unit sold quarter time approxim unit sold worldwid evid success subject achiev behavior creatur dynam vari learn exampl appar emerg behavior cooper plai scene result difficult establish genuin confer observ tendenc anthropomorph dynam behavior agent environ configur usabl genotyp requir grand cliff approxim interact paramet point belief complex synthesi achiev aim justifi creatur commerci product home user interact artifici autonom behavior control neural network interact biochem breed success gener agent creatur coordin percept action extend period maintain suffici intern energi surviv matur point capabl sexual plausibl argu instanc artifici exhibit suffici condit instanc life formul list condit number philosoph claim creatur aliv note philosoph debat possibl requir strong artifici mind user creatur discuss philosophi artifici collect edit boden engag artifici life technolog complet manner creatur entertain softwar familiar assum user run creatur sale unit million creatur exist provid machin global creatur user commun continu growth global creatur figur measur ten user commun creat digit similar advoc rai ongo work major global artifici life research experi issu discuss length approxim independ creat creatur concentr creat breed creatur chose monitor evolut featur group local scale nation global comparison reveal diverg evolutionari path creatur learn human studi spread emerg move machin machin electron mail web upload teach behavior languag variant reason commun creatur user part intern artifici life scienc experi fun acknowledg creatur develop technolog trade millennium interact publish europ gt interact creatur north america japan core artifici life techniqu develop creatur refer tm web site note standard biologi refer neuron refer websit arbib handbook brain theori neural network mit press role emot believ commun acm dynam small recurr neural adapt behavior dynam system perspect interact artifici intellig evolut dynam neural network minim cognit al page blumberg select lesson al pp blumberg etholog interact unpublish phd mit media lab boden philosophi artifici life oxford press mae brook mae artifici life iv workshop mit press al meyer sw anim animat intern confer simul adapt behavior mit press miller cliff red measur adapt progress al page grand cliff global digit manuscript submit sixth intern workshop artifici life frontier complex faber faber websit malhotra artifici life autonom softwar agent home johnson intern confer autonom page acm press sussex school cognit comput scienc technic report genet algorithm machin learn addison weslei van gent van johnson intern confer autonom page acm press harvei husband harvei fourth european confer artifici life mit press control fourth estat koza genet program comput mean natur select mit press grand cliff langton artifici life mit press stone lester believ anim pedagog johnson intern confer autonom page acm press levi artifici quest creation penguin bate loyal believ agent johnson intern confer autonom page acm press mae life meet lifelik autonom commun acm al anim animat intern confer simul adapt behavior mit press websit al advanc artifici european confer artifici life websit rai report network unpublish document rai creat unpublish document herd distribut behavior comput graphic reynold corridor noisi al mcclelland rumelhart mcclelland parallel distribut volum foundat mit press sim morpholog behavior mae al terzopoulo al artifici fish autonom behavior physic world mae
DB/1056 3 manag time consist activ data environ robert tjoa institut softwar technolog vienna technolog austria abstract gener discov delai comput system typic updat pattern tradit data weekli basi enlarg propag delai inform knowledg worker tradit data focu summar data detail data activ data detail data individu entiti requir check data condit trigger action data current consist context easi task paper present approach model conceptu time consist problem introduc data model deal time delai support knowledg find activ system respond state data model enabl analyt process detail data valid base knowledg state instant time state system point time consist introduct observ event comput system delai propag delai time interv monitor system realiz occur state chang oper system thing design meet time focu data gener strateg analysi data integr heterogen system data integr process complex cover transform load data connect data support characterist conflict continu updat workload oper system poor analysi concurr data load frequent updat window analysi capabl affect till requir rel avail data support process timet requir perform restrict data cite time varianc silent characterist view aspect data strong influenc delai system realiz state data approach enabl react chang custom suppli chain concern activ data wareh combin activ mechan base eca rule integr analysi power environ extend system reactiv activ data event react busi make tactic oper action wait period report design technic aspect high data mix integr activ deal kind propag delai discov captur delai comput system typic updat pattern tradit weekli monthli basi enlarg propag delai knowledg worker requir consolid aggreg inform analysi case tradit delai recognit event result number addit data integr aggreg updat analyt process histor analysi result repeat addit inform time period integr delai summari chang unexpectedli user complex analysi data access requir place typic queri scope system address type autom rare accomplish passiv data current consist context easi higher refresh frequenc shrink propag time consist busi rule formul eca structur trigger delai execut rule unexpect undesir concentr develop examin schema model cope delai time consist inform distinct interest inform valid detail data typic restrict time frequent updat import note aim approach necessarili shrink delai pragmat ensur propag delai reduc main contribut paper introduct overlap valid time interv remaind paper organ section consid research issu relat work time consist introduc section viewpoint section describ case studi assess give section research issu relat work import data qualiti organiz success underestim long time qualiti manag inform process establish manufactur store gigabyt terabyt manual qualiti control feasibl data qualiti mit total data qualiti manag project consid socal qualiti dimens contextu data qualiti interest practic approach view time fact captur electron format knowledg worker data captur sourc upload central propag delai dai unaccept implement tightli integr busi process network organ tempor provid support futur data sophist queri time state research tempor grown recent year transact time valid time investig field data wareh concentr shortcom star schema context slowli chang dimens easier analyt process queri perform observ regular event formal approach manag time consist tempor data tempor view address recent research activ aim extend power activ rule respond extern trigger complex pattern tempor event import issu accommod investig tempor activ paper concentr delai young disciplin activ data time consist notion time fundament exist import aspect realworld phenomena reflect past event futur reason event domain time time independ variabl determin sequenc state system continuum real time model direct timelin consist infinit set instant point underli time axi section timelin call durat time period event place instant durat event occur ident event occur simultan time interv determin durat instant figur describ comput system observ state person live boston assum matter mr smith stai state observ comput system mr smith address york captur inform reveal mr smith live york model situat time find system mr smith live instant piec inform integr base knowledg determin strategi custom relationship manag packag citizen unsuit instant event past futur state state event boston ny valid time state valid time state revel time event revel time fig sequenc captur histori entiti interest conceptu model time consist time consist inform requir reliabl view histor data point time independ propag delai knowledg state determin instant consid inform integr order relat instant impli move forward time knowledg state grow gener analysi time interv instant interest ii interest start ii end st ks ii orthogon time dimens independ analysi capabl data model enabl time consist set condit list tabl satisfi combin store dataset subject gener store state determin instant valid time time interv xs xe combin ii ks analyt process retriev correct system ks retriev state entiti interest tabl relat figur describ time correct state retriev analyt process retriev state view output function appli ks ii conceptu model handl past futur valid period import deal propag delai support plan read exampl tabl describ major contribut conceptu model convent tempor model restrict valid time tabl conceptu model time consist knowledg state interest retriev state ks ii ii ii ks ii ii ii ii ii ks ii read exampl point time analysi base ks ks figur state valid till entri tabl system move forward time appli knowledg state ks reveal state valid till entri tabl assumpt overlap valid time model tempor consist data issu model time consist central environ challeng due deal addit propag delai electron captur data sourc system section integr distribut sourc system time delai data data stage effici approach separ issu extend logic physic data model handl complic due tempor order issu section data stage affect analyt process enhanc time dimens model accomplish time simpli ad timestamp data load weekli basi model fact captur electron organ identifi propag delai implement repres valid time properti relat base event instant describ time interv valid instant piec inform revel time revel time describ point piec inform realiz sourc system concept tightli relat notion transact time tempor retriev state time correct electron captur input data mean case valid time overlap context call properti clarifi transact result record sourc analyt process reveal interest relat fact load timestamp load timestamp time integr dataset environ determin fact activ mechan presenc load timestamp repres point time automat make action refer environ conceptu model mention type time inform valid time relat instant interest analyt process typic knowledg state relat revel time accur pictur entiti interest relat load enabl knowledg worker observ control activ mechan logic design tempor data import central aspect choic timestamp fact time interv abbrevi set point practic reason singl timestamp approach store start time record valid applic event face defici context gener state inform store simpli return temporari valu user analyt process integr data model lead product dim past futur boston time dim fact tabl rt rt vt vt lt locat dim boston chang lt load timestamp rt revel time rt revel time vt valid time vt valid time fig state piec inform reveal februari valid time februari st april st load februari order model past futur instant symbol instant time dimens commonli model integr load timestamp fact analyt process tradit effect support revel valid time fact integr separ logic time dimens model time interv physic implement bitempor model figur combin featur repres realiti accur approach suitabl analyt process support creation cube analyz averag propag delai valid revel drill distribut oper system locat geograph region time consist aggreg handl fact integr fact inform previou data affect aggreg aggreg delet store time consist adjust valid time recomput timestamp physic tempor logic model present permit design mix tempor nontempor aspect appli strategi fact star implement logic data model support time consist influenc provid physic symbol instant date constant index import tempor relat due size focu tempor analyt process coalesc tupl interv overlap tempor join requir index tempor conjunct inequ predic harder frequent improv cost model optim tempor oper appli data stage sourc system store partial nontempor sourc store current state data storag identifi delai possibl occur automat make model time consist manner data stage tradit establish deliveri order manag time consist requir tempor account store fact aggreg data stage issu order singl version truth time data time zone distribut differ observ event oper system record order cancel bill system observ propag section issu address establish global time base field distribut system manag approach time consist integr data enhanc knowledg state subject updat exist data structur end date revel modifi valid time overlap import note valid time state provid data stage tempor sourc chang tabl show physic dataset situat exemplifi figur figur kind tempor integr method slow data stage case overlap valid simplifi analyt process dramat mention earlier method applic tabl tempor order overlap valid time locat valid time revel time load timestamp boston chang locat valid time revel time load timestamp boston ny chang result usabl approach evalu applic industri project found introduct knowledg state viewpoint enhanc analyt process plan monitor includ scenario version support aggreg valid time suitabl present futur state focu approach manag time consist enabl knowledg worker establish control activ behavior environ case project project industri project domain accid insur implement big austrian insur author start continu till focu project manag time consist introduct activ behavior autom routin task initi control stop accid payment due reason technic project implement data mart oracl tightli integr workflow manag system organ bill system data model fact star tempor fact star sourc system partli enhanc provid addit tempor inform deal delai legaci data integr valid time reconstruct sequenc state subject import analyt applic public insur author period gener time consist statist report classifi investig accid viewpoint offici statist european statist approach manag time consist reduc effort gener maintain statist dramat gener statist tempor support report consist aggreg figur previou month year drive forc establish kind tempor data mart limit tradit cash differ captur delai person accid june receiv due typic delai data made juli bill statist june complet tradit ignor revel time store june invalid cash flow statist assess manag time consist present approach achiev consist analysi result point time knowledg state approach base formal model strong guidelin implement bitempor tabl enhanc time dimens suitabl applic domain improv data qualiti data stage store data structur introduc point time tempor inform legaci regular valid revel time interv data structur enhanc analyt capabl instant restrict entir data permit design mix tempor nontempor aspect cover time relev aspect data qualiti manag perform updat time attribut exist row bulk load row fact tabl repres chang occur previou easier feed data analyt process slow queri question state object period time result comparison timestamp row research base relat model emerg candid data model model adequ address issu relat histori data time core issu data advantag provid time consist support data includ data effici captur organ analyz sequenc histori shown provid knowledg worker effici support environ present approach enabl time consist view analysi valid detail data typic restrict time frequent updat captur delai ignor tempor issu lead impoverish express power question queri semant scenario import futur research direct field mainten dynam inform system schema dynam enhanc activ behavior automat action field refer activ manag system featur acm sigmod pp enhanc data qualiti data environ commun vol pp systemat chang manag data wareh technic report januari versu tempor data model proc intl conf ieee comp societi pp effici support time granular ieee tran knowledg data vol pp improv data busi inform qualiti john wilei build data john wilei consensu glossari tempor concept tempor research lnc pp tempor data manag ieee transact knowledg data vol pp accommod delai tempor activ confer ieee comput pp maintain data chang inform sourc commun vol pp comparison access method data acm comput vol pp make data activ intern confer lnc pp effect timestamp vldb vol issu pp total data qualiti manag commun vol pp data model morgan kaufmann san tempor view intl conf lnc pp advanc system morgan kaufmann san
DB/1057 3 scalabl continu queri system internet chen david dewitt feng tian yuan wang comput scienc depart abstract continu queri persist queri user receiv result continu queri system transform passiv web activ support million queri due scale internet exist system achiev level scalabl address problem group continu queri base observ web queri share similar structur group queri share common tend fit memori reduc cost significantli group select predic elimin larg number unnecessari queri invoc group techniqu distinguish previou group optim approach wai increment group optim strategi dynam queri ad exist queri regroup instal queri scheme requir minim queri engin group queri uniform insur emploi techniqu includ increment evalu continu pull push model detect heterogen data sourc memori cach paper present design system result perform scalabl introduct continu queri user obtain result issu queri repeatedli continu queri environ internet larg amount frequent chang inform user issu continu queri notifi price dell stock drop price intel stock remain unchang month order handl larg number user continu queri system capabl support larg number trigger express complex queri data set goal niagara project develop distribut system queri distribut xml data set queri languag part goal larg number user regist continu queri queri languag queri tend similar hope handl million continu queri group similar queri group optim benefit group queri share comput common execut plan group queri resid significantli save cost compar execut queri separ group make test condit continu queri avoid unnecessari invoc previou group optim effort find optim plan small number similar queri approach applic continu queri system reason handl larg number queri design environ continu queri dynam ad remov approach increment group optim approach queri group signatur queri exist group consid optim choic queri system queri merg exist group signatur match queri increment group optim scheme emploi scheme signatur queri signatur replac scan output file produc match group optim process continu remaind queri tree fashion entir queri analyz case group signatur queri group signatur creat system continu queri split smaller queri input queri monitor techniqu input userdefin continu queri main advantag approach implement gener queri engin minor modif advantag approach easi implement demonstr section scalabl queri continu ad remov time qualiti group lead reduct perform system group requir effect continu queri classifi categori depend criteria trigger execut continu queri fire relev data continu queri execut time interv submit user previou dai trader desir price inform investor satisfi notifi hour continu queri provid wast system resourc instantan answer requir continu queri support queri system support continu queri scalabl user overlap time interv continu group queri difficult group pure queri approach handl type queri uniformli continu queri niagara net data manag system develop wisconsin oregon graduat institut support scalabl continu queri process distribut xml file deploi increment group optim idea introduc number techniqu make scalabl effici support increment evalu continu queri chang portion updat xml file entir file frequent small portion file strategi save amount comput advantag increment evalu repetit evalu avoid result return user monitor detect data sourc push poll model heterogen sourc due scale inform continu queri temporari result held memori cach mechan obtain good perform limit amount memori rest paper organ section command languag briefli group optim approach present section implement section section examin perform increment continu queri optim scheme relat work section conclud paper section command languag defin simpl command languag creat drop continu queri command creat continu queri creat queri action delet continu command delet user write continu queri combin ordinari queri addit time inform queri effect queri execut queri continu queri delet system automat default valu time valu set action perform queri result complex store procedur process result queri user delet instal queri explicitli delet command increment group optim approach section present increment group optim strategi scale larg number queri strategi appli wide rang group optim method specif group optim method base approach section section introduc scheme requir minim queri engin section appli group optim method select join oper discuss system support queri section section discuss cach mechan make system scalabl gener strategi increment group optim previou group optim strategi find optim global plan small number queri techniqu queri environ small number similar queri enter system short time interv advanc naiv approach group continu queri appli method directli queri queri ad contend approach accept larg dynam environ perform overhead increment group optim strategi continu queri paper group creat exist queri repres similar structur queri group common part queri share individu queri queri group share result execut group plan queri group optim consid exist group potenti optim choic queri merg exist group match signatur exist queri approach strategi result reduc cost group optim significantli importantli scalabl dynam environ continu queri frequent ad current group ineffici part queri period system perform degrad threshold left futur work increment group optim express signatur base increment group design scalabl group optim method express signatur express signatur repres syntax possibl constant queri specif implement signatur concept express signatur queri stock quot construct construct figur queri exampl queri figur retriev stock inform intel microsoft user submit similar queri stock symbol express signatur creat select predic replac constant predic placehold express signatur queri figur shown figur constant figur express signatur queri figur queri plan gener niagara queri parser figur show queri plan queri figur lower part queri plan correspond express signatur queri oper ad top queri plan queri express signatur queri syntact structur group share comput express signatur queri discuss user queri destin data sourc file posit give dtd user continu queri data sourc group queri optim easili extend support capabl map mechan offer niagara search engin lose gener increment group assum continu queri defin specif data sourc paper group trigger action select symbol file scan figur queri plan queri figur group creat queri base express signatur group gener queri figur express signatur group discuss group consist part group signatur group signatur common express signatur queri group express signatur figur dest dest trigger action select symbol file scan figur group constant tabl group constant tabl group constant tabl signatur constant queri group constant tabl store xml file store tabl tupl produc share comput direct correct individu queri destin inform store constant group plan group plan queri plan share queri group deriv common part singl queri plan group figur show group plan queri figur file scan trigger action trigger action split join symbol group plan file constant tabl figur group plan queri figur express signatur queri group constant result share comput result queri result filter correct destin oper process perform filter combin special split oper join oper base constant valu store constant tabl tupl data sourc join constant tabl split oper distribut result tupl join oper correct destin base destin buffer tupl constant split oper remov destin buffer tupl put output subsequ oper queri modifi queri constant share output stream featur significantli reduc number output buffer gener number activ group order thousand ten group plan store hash tabl group group signatur hash kei group constant tabl larg store disk increment group algorithm section briefli describ group optim perform increment group optim queri group optim queri plan bottom match express signatur signatur exist group express signatur signatur figur match signatur group figur group optim break queri plan part lower part queri remov upper part queri ad group plan constant tabl entri ad destin buffer alloc construct figur queri exampl trigger action select symbol file scan figur queri plan queri figur case signatur queri match group group gener signatur ad group tabl queri signatur merg group system match process continu remaind queri plan top plan reach increment group effici requir queri plan discuss scheme describ increment group optim perform select join oper queri split materi intermedi file destin buffer split oper implement pipelin scheme intermedi file initi design split oper pipelin scheme tupl pipelin output oper input oper pipelin scheme work group continu queri queri fire output tupl retain fire time difficult split oper determin tupl store long store pipelin part queri plan group combin group result singl execut plan queri group singl plan disadvantag structur direct tree plan complic queri engin execut combin plan larg requir resourc limit system larg portion queri plan execut queri invoc figur price intel stock destin buffer microsoft upper part microsoft queri action execut problem avoid execut engin abil select load part queri plan manner capabl requir special implement ql queri engin file scan trig act file scan split join symbol file scan constant tabl trig act file scan group plan constant file file intermedi file figur scheme intermedi file split oper input stream multipl ten output split oper bottleneck part queri consum output tupl split stream wide vari rate queri group simpl select queri involv multipl join queri process input split oper block simpl queri pipelin scheme system support small number continu queri goal support million continu adopt approach scalabl easier implement gener queri engin maxim extent design split oper write output stream intermedi file queri plan cut part split oper file scan oper ad upper part plan read intermedi file treat queri normal user queri intermedi file monitor ordinari data continu queri overlap multipl queri queri split queri total number queri system exce number group number origin user queri assum thousand group gener million user number queri system slightli intermedi file store constant tabl group continu queri constant share intermedi file advantag design queri schedul queri execut figur price intel stock queri intermedi file schedul small amount data instal continu queri fire comput time system resourc usag significantli reduc queri split oper queri format schedul execut gener queri engin queri system size common user execut consum unusu amount system resourc approach handl intermedi file origin data sourc file uniformli materi intermedi file process monitor origin data file potenti bottleneck problem pipelin approach avoid potenti disadvantag split oper block oper execut upper part queri wait intermedi file complet materi continu queri run data impact block read write intermedi file incur extra disk data anticip buffer memori upper part queri consum disk case queri long time interv data accumul data written disk matter strategi discuss section special cach mechan reduc cost increment group gener select predic primari focu predic format op attribut path express wildcard op includ format domin select queri predic format handl discuss paper figur show rang select queri return stock price figur express signatur group plan queri signatur figur join condit constant gener valu column repres bound constant tabl entri constant tabl join condit special index evalu predic interv skip list interv fit memori develop index method handl case effici construct constant figur rang select queri express signatur potenti problem group intermedi file larg number duplic tupl rang predic queri overlap intermedi handl case virtual intermedi file store rang actual result tupl output split oper store real intermedi cluster index rang attribut modif virtual intermedi file trigger queri ordinari intermedi file rang virtual intermedi file retriev data real intermedi file scheme chang handl virtual intermedi file queri multipl select multipl express signatur predic data sourc repres conjunct normal form group optim select increment group predic evalu upper level continu queri split oper construct figur queri select predic figur show queri select retriev intel stock price fall queri express equal select predic symbol rang select predic express signatur equal select predic group select select oper select predic rang select ad file scan oper increment group join oper join oper share common join oper significantli reduc amount comput figur show queri join oper retriev price stock profil signatur join oper shown side figur join signatur approach data sourc predic join group optim group join queri join signatur constant tabl case output intermedi store split oper file hold result share join oper construct symbol symbol figur queri join oper signatur wai group queri join oper select oper figur show retriev stock comput servic industri relat compani profil group optim place select group sequenc increment group optim process group optim base cost model discuss altern queri figur construct figur queri join select oper select oper pull join group optim group queri join signatur select intermedi group advantag method join oper share queri select oper disadvantag perform gener larg intermedi file small number queri join group highli select select group method evalu queri individu group optim push select oper avoid comput join signatur select oper match exist group file scan oper intermedi file produc select group ad join oper rewritten intermedi file input group optim increment group join oper signatur compar approach creat join group overlap overlap exist approach method outperform approach group optim select strategi base cost model date implement approach futur plan implement strategi compar perform approach group continu queri queri period execut significantli reduc comput time make system scalabl queri group queri time inform record instal time group larg number queri pose challeng hard monitor timer event queri share common comput difficult due time interv user request queri figur time weekli monthli queri monthli interv repeat weekli work queri time interv share result produc event detect type event trigger continu queri chang event timer event data sourc classifi data sourc inform interest data chang data sourc check period continu queri fire time queri execut input file modifi timer event store event sort time order entri list correspond time instant exist continu queri schedul queri uniqu id queri id store entri timer event relat file check queri entri fire data sourc modifi fire time fire time queri entri calcul queri ad entri list increment evalu increment evalu queri invok chang data reduc amount comput significantli typic amount chang data smaller origin data file continu queri recent queri run delta file origin file case complet data file increment evalu join oper techniqu handl delta file ordinari data sourc intermedi file store output split oper calcul sourc xml file merg delta file intermedi output split oper directli append delta file order support time stamp ad tupl delta file queri fire time defin delta file data longest time interv queri file input queri execut fetch tupl ad delta file queri fire time group plan result execut store intermedi file queri defin intermedi file fire immedi subsequ invoc group queri repeat previou comput upper level queri defin intermedi file fire schedul execut time share comput total transpar subsequ oper memori cach due desir scale assum inform requir continu queri intermedi result fit memori cach obtain good perform limit amount memori cach queri system data data file perform group queri plan tend memori resid assum number queri group small queri cach lru polici favor frequent fire queri queri shorter fire interv prioriti longer interv cach recent access file small delta file gener split oper tend consum discard cach polici favor small file save lot disk event list monitor event larg million continu queri avoid maintain list list window front part list hour implement develop niagara project initi version system implement java valid xml parser ibm xml document describ system architectur section continu queri process section system architectur figur show architectur niagara system niagara handl continu queri consist continu queri core modul system continu queri interfac continu queri processor group optim figur system architectur cq manag event detector user invok niagara queri engin execut fire queri group optim perform increment group optim event detector detect timer event data sourc niagara data manag enhanc support increment evalu continu queri process continu queri figur show interact continu queri event detector data manag continu queri execut continu queri process discuss section continu queri instal continu queri enter queri queri plan fed group optim increment group group optim split queri queri scheme section continu queri manag invok niagara queri optim perform common queri optim queri optim plan store futur execut timer inform data sourc queri event detector figur event detector data manag monitor relat sourc file intermedi file figur turn cach local copi sourc file step order detect subsequ file event detector monitor type timer event event event event detector notifi continu queri manag queri fire data sourc data manag niagara monitor web xml sourc intermedi file local disk handl disk ordinari queri continu queri support niagara gui queri parser queri optim execut engin data manag data sourc internet niagara queri engin niagara search engin data sourc data data manag inform file chang notifi event detector activ event detector period data manag check modifi time continu queri manag queri engin add continu queri file timer inform enabl ed monitor event ed dm monitor file timer event ed dm modifi time file dm inform ed data sourc file timer event ed list fire cq invok qe execut fire cq file scan oper call dm retriev select document dm return data fire time current fire time figur continu queri process event detector data manag continu queri delet system uniqu gener continu queri user retriev queri statu delet queri queri automat remov system expir execut continu queri invoc continu queri requir seri interact continu queri event detector data manag timer event event detector data manag relev data sourc modifi figur data manag return list modifi sourc file data manag notifi event detector data sourc chang figur continu queri queri id modifi file continu queri manag figur continu queri manag invok niagara queri engin execut trigger queri figur execut queri engin request data data manag figur data manag recogn request continu queri return delta file figur delta file sourc file comput perform oper origin file version file result expect continu queri system increment group optim provid substanti improv system perform scalabl compar increment group approach approach show benefit share comput avoid unnecessari queri invoc experi set experi conduct sun ultra run solari quot quot quot figur dtd compani compani compani address figur dtd data set experi run stock inform consist xml stock inform nasdaq compani size mb relat compani inform store size dtd xml file figur data gener artifici simul real stock market continu queri trigger file chang experi give descript assumpt made gener stock uniqu symbol industri attribut randomli set valu repres chang percentag current price close price previou session normal distribut standard deviat time spent calcul sourc file group run experi directli data number modifi byte queri user submit queri similar express signatur type queri repres effect group queri stock environ express signatur construct queri notifi intel stock chang construct queri notifi stock price rise percent construct queri notifi intel stock trade dollar construct queri notifi stock comput servic industri relat compani inform queri express signatur equal select predic symbol queri express signatur rang select predic queri common express equal select predic rang select predic express signatur equal select predic group queri select rang predic queri express signatur select join oper select oper push join oper increment group optim group select signatur join signatur queri gener normal distribut standard deviat queri type gener constant uniform distribut rang valu data interpret result paramet experi number instal import measur system scalabl number fire queri group case number fire queri vari depend trigger condit group case intel stock queri defin schedul execut common comput group paramet affect queri number tupl modifi group queri consist group part part tg repres execut time part execut time evalu queri sum tg fire group portion execut strategi scan xml data sourc file multipl cach xml file memori approach scan xml file ensur comparison approach fair product xml file retain memori long period time queri scan xml file multipl time result singl type queri studi effect increment group optim work type queri measur compar execut time queri type group approach experi result queri experi tupl case queri fire approach execut time approach grow dramat appli highli load system group approach consum significantli execut time share comput select oper grow slowli singl queri ng smaller case queri invok group approach group execut time case constant fix execut time group approach depend number fire queri total number instal queri reason share comput execut small portion total execut time execut time upper proport number fire queri domin total execut time execut time approach proport queri schedul execut experi queri experi explor impact number modifi perform approach vari tupl tupl queri execut time total execut time proport select oper instal queri execut group execut time sensit chang count small percentag total execut time sum ng fire queri chang select experi result queri discuss influenc express signatur set experi figur figur show group optim work select predic queri group rang select signatur queri signatur group optim equal predic group queri select figur show result queri queri select signatur join signatur select oper push join oper queri group select signatur industri test data set output select group written intermedi file hundr join group creat join group consum intermedi file input differ execut time group larger previou experi join oper select oper experi result mix queri queri previou experi studi type queri separ show effect kind express signatur increment group optim limit group type queri type queri group common execut time execut time execut time number queri figur figur figur £ £ number queri number queri signatur queri queri group select signatur figur show perform differ group case system statu futur work prototyp version includ group continu queri event data manag core increment group group optim increment group select join oper increment group optim preliminari stage increment group optim shown achiev good perform scalabl intend extend increment group optim queri oper select join share comput effect interest futur direct intend explor relat work discuss terri al notion queri issu run continu increment evalu approach avoid repetit comput return result user approach restrict execut time execut time execut time data size figur number queri figur number queri figur suitabl target environ increment queri evalu method limit data sourc includ action timer event niagara continu queri continu queri similar trigger tradit system trigger wide studi implement trigger system model gener issu implement trigger found tradit trigger system wai main support continu queri process maintain data integr intend support million continu queri defin larg number data sourc tradit limit number trigger instal tabl trigger defin singl tabl monitor autonom heterogen data sourc internet tradit trigger system handl local tabl event support support continu queri web data sourc function similar differ explor similar larg number queri group optim achiev system scalabl project method implement scalabl trigger system base assumpt trigger common structur special select predic index trigger cach achiev scalabl share assumpt work borrow concept express signatur work focu increment group subset frequent express format op op major differ increment group optim strategi scheme share comput individu queri monitor execut slightli modifi queri engin special predic index evalu express signatur support group capabl consid work find optim plan small group queri lower recogn relationship select predic queri select join oper approach group optim extend larg number queri recent work group optim appli group optim solv specif problem approach fall categori alert earliest activ system part passiv dbm implement activ goal develop continu queri system group optim base assumpt continu queri internet similar previou group optim approach group small number queri time scalabl million queri methodolog make group optim scalabl previou approach idea appli gener group optim method group method scheme requir minim gener queri engin continu queri group event detect group capabl found system techniqu make system scalabl includ increment evalu continu pull push model detect heterogen data sourc cach mechan preliminari experi demonstr increment group optim significantli improv execut time compar approach result experi show system scale support larg number queri acknowledg xu discuss author initi write paper grate david maier care review comment paper anonym comment fund work provid darpa contract nsf award refer chakravarthi minker multipl queri process deduct queri graph vldb confer suciu queri xml scalabl trigger process page hanson johnson select predic index activ interv skip list ci zhou differenti evalu continu queri icdc tang continu queri internet scale inform deliveri tkde mccarthi dayal architectur activ manag system sigmod rosenth chakravarthi anatomi modular multipl queri optim vldb selli multipl queri optim acm transact goh potamiano cach view data base system sigmod confer realiti activ system vldb mohan architectur transform passiv dbm activ dbm vldb oki continu queri sigmod widom sj product rule relat system sigmod confer shukla simultan optim evalu multipl queri sigmod
ML/1058 6 cabin framework knowledg acquisit iter schedul improv reactiv repair electr industri osaka japan katia sycara robot institut carnegi mellon pa usa septemb paper submit artifici intellig journal abstract practic schedul problem gener requir alloc resourc presenc typic conflict set constraint optim criteria solut space desir object make schedul problem difficult formal paper describ learn method acquir user optim prefer tradeoff increment improv schedul qualiti predict schedul reactiv schedul manag unexpect execut event implement cabin acquir user prefer dynam modifi search control guid schedul improv iter case exploit repair action evalu intermedi repair result recoveri failur method system dynam switch repair heurist oper respect local view problem offer select repair advantag applic repair action tune search procedur characterist local repair problem achiev dynam modif search control bia priori amount modif requir repair action initi result show approach captur effect util user schedul prefer present schedul produc schedul high unduli sacrif effici predict schedul gener reactiv unpredict execut event varieti criteria recogn import real oper environ introduct schedul task assign limit number resourc activ time consist avoid violat constraint resourc capac activ constraint date goal schedul system produc schedul respect problem constraint optim set minim tardi minim work process inventori maxim resourc minim cycl time produc schedul respect user prefer schedul difficult autom comput complex schedul problem subset problem tight constraint interact due tight interact schedul constraint natur schedul gener predict effect local optim global simplest object object prefer practic schedul desir multipl optim object minim weight minim work process maxim resourc satisfi optim object interact conflict optim object optim object relationship global object extrem difficult model schedul difficulti balanc conflict object tradeoff tradeoff typic reflect presenc user prefer domain constraint captur schedul model incorpor user prefer constraint oper schedul environ increasingli recogn good techniqu lack dynam environ oper environ schedul system dynam unpredict machin breakdown oper happen schedul execut schedul predict creat assum world static brittl clear effect schedul system perform schedul unforeseen event schedul execut schedul problem address gener type construct schedul schedul construct approach schedul construct increment construct merg partial schedul approach complet suboptim initi schedul increment repair heurist simul anneal predict schedul gener increment repair schedul unanticip event schedul execut approach analyz implic specif schedul featur match behavior characterist reactiv action select control model approach assum exist explicit optim function assumpt gener limit optim criteria reflect user prefer express term singl global object function describ implement cabin unifi framework acquisit user optim prefer improv schedul qualiti base reactiv schedul manag unforeseen event unlik system util iter repair find feasibl solut execut schedul end repair cabin produc execut schedul repair monoton qualiti time exhibit anytim execut behavior desir qualiti reactiv context limit amount time system react approach integr reason fine granular schedul mechan base integr cbr schedul stem varieti motiv schedul assum exhibit domain regular albeit case case repres applic action activ express depend featur repair context suitabl repair action section detail descript case cbr captur depend knowledg dynam adapt search procedur differenti bia schedul futur similar situat tightli coupl natur schedul part schedul constraint violat part constraint propag techniqu determin rippl effect spread conflict part schedul repair action appli specif schedul made evalu criteria judg accept outcom repair action context depend reflect user judgment tradeoff difficult describ evalu criteria tradeoff simpl manner case base incorpor distribut exampl collect implicitli captur user schedul evalu prefer tradeoff problem solv circumst enabl cabin induc tradeoff case base user prefer reflect case base prefer select repair action depend featur repair evalu prefer repair outcom result select applic specif repair action approach attract solv practic schedul problem effici search algorithm schedul optim limit set simpl object amount comput requir find solut gener unpredict construct cheap suboptim schedul increment repair meet tion object prefer interrupt repair process interim result execut time repair dispatch heurist low comput due myopic tailor optim object gener address issu balanc tradeoff respect varieti optim object result suboptim schedul wide point research combin repair simpl gradient search neural network advoc dispatch driven schedul creation initi schedul real world schedul environ result report section cabin produc substanti schedul improv start schedul gener method number dispatch heurist constraint base schedul approach evalu extens control job shop schedul problem report section show approach potenti effect captur user prefer optim tradeoff difficult improv schedul qualiti irrespect method initi schedul produc high qualiti schedul lower comput cost compar simul iter repair suitabl reactiv schedul method maintain high schedul qualiti minim disrupt face execut time failur rest paper organ section background job shop schedul present techniqu cabin section introduc schedul optim section present case retriev applic schedul retriev present extens section present result valid approach section discuss relat work section futur work job shop schedul job shop schedul deal alloc limit set resourc number activ set domin constraint job shop schedul tempor activ resourc capac constraint activ constraint job date due date restrict set accept start time activ capac constraint restrict number activ resourc point time creat conflict activ compet resourc overlap time interv goal schedul system produc schedul respect tempor relat resourc capac optim set object model substitut resourc activ deal parallel machin job shop complic version job shop schedul problem base approach creat initi schedul util method dispatch improv suboptim schedul gener step incorpor user prefer tradeoff rest present job shop schedul problem framework constraint present search strategi propag effect repair action cabin constraint job shop schedul problem requir schedul set job fj set physic resourc fr rm job consist set fa schedul process rout specifi partial order activ job date signifi earliest time job start job due date dd job finish activ fix durat du variabl start time st domain start time activ initi constrain due date job activ belong order successfulli activ requir resourc mill ij pool physic resourc ij fr ij ijk ij mill problem defin variabl vector variabl activ start st resourc ij activ altern constraint constraint problem constraint defin process rout translat linear inequ st du st capac constraint restrict resourc activ time translat disjunct constraint ip jq st du st st du st constraint simpli express activ overlap time assum activ start time end time integ valu resourc requir ij select set resourc ij constraint includ due date activ job perform object prefer schedul object conflict mathemat problem extrem difficult simplest object defin constraint gener deal resourc capac larger common literatur develop perform evalu cabin object mathemat simplif object difficult model optim criterion ip induc cabin user gave consist evalu easili repres wai explor tradit schedul approach wait time time complet activ start process total wait time sum wait time activ belong complet time time process finish du late simpli differ complet time due date dd tardi delai complet due date dd note amount time spend system du max latest complet time entir order max summat total wait time ip weight tardi weight averag tardi weight consid penalti cost tardi qualiti schedul function extent achiev user prefer illustr necess user prefer schedul system simpl assum simplest factori singl machin job job consist singl activ process factori machin assum job factori floor time due date due date date tardi job job job job job time horizon job job figur conflict object figur show schedul result problem gener job finish due date job tardi job figur job schedul reduc tardi job simpl repair switch posit job job schedul result switch job tardi job larger extrem simpl difficult decid schedul higher qualiti prefer user simpli ad weight tardi minim sum realist rel import object sum reflect tradeoff user make tradeoff depend import client past ship load combin factor produc enorm number context user prefer make user prefer difficult captur repres priori problem model reason author acquir prefer adapt import search procedur search procedur cabin appli select repair action section base search interleav applic consist enforc mechan order heurist attempt avoid state search state partial solut search state defin constraint satisfact problem variabl variabl instanti constraint initi problem constraint constraint reflect current assign schedul built opportunist select activ schedul assign resourc start time time activ constraint ad initi schedul constraint reflect activ reserv constraint propag inconsist constraint detect system backtrack schedul select activ schedul reserv activ process termin activ schedul successfulli search proce oper schedul step appli consist enforc detect backtrack select altern reserv left back step select oper schedul order select reserv oper order creat search state ad reserv assign current partial schedul back step detail step consist enforc consist enforc procedur hybrid procedur differenti constraint capac constraint state occur result capac constraint violat consist respect constraint enforc updat search state pair start time oper consist enforc respect capac constraint significantli due disjunct natur constraint capac forward check type consist check gener carri system resourc alloc oper time forward check procedur check set remain start time oper requir remov start time conflict assign variabl order schedul import focu search wai avoid state accomplish util good variabl order heurist variabl order determin activ schedul order determin reserv assign select activ variabl order heurist util system call activ resourc relianc select critic activ activ highest probabl involv capac constraint violat time interv detail order activ schedul order heurist determin reserv assign activ order heurist relev paper constrain order heurist select reserv prevent activ schedul figur prefer start time activ start time latest start date figur greedi order heurist select reserv base local prefer express static linear activ figur order prefer activ start time high util valu schedul problem substitut static util express differenti resourc prefer select activ reserv experi small job shop problem variabl order order produc suboptim schedul minim variabl order gv order static predetermin util henceforth refer schedul shown produc high qualiti schedul compar heurist schedul proce activ time set activ involv constraint violat result repair activ conflict set repair repair process activ conflict set modifi bia util experi run randomli gener schedul problem function bia reflect effect learn user prefer evalu repair outcom store case base search procedur modifi util variabl order gv order schedul conflict set activ repair time activ cb reschedul subset activ member conflict schedul util function adapt modifi base inform case base section describ repair process detail schedul optim order optim schedul user contextdepend user prefer repres schedul system exploit reason process potenti captur tradeoff requir knowledg acquisit effort approach reason potenti deal noisi data acquir user knowledg complex domain expend effort knowledg acquisit compar knowledg acquisit system characterist schedul domain previou section interest captur context depend user cbr natur method knowledg acquisit appli cbr schedul numer optim challeng cbr symbol plan legal reason argument conceptu design medic diagnosi primari concern plausibl correct result artifact comput effici process artifact qualiti challeng face decid constitut case domain schedul optim case indic intuit answer schedul case solut attract inform transfer schedul scenario problem solv rel high nonlinear schedul constraint small differ input problem specif problem case base gener result larg variat result term amount modif qualiti result schedul difficulti respect schedul case form indic index case term goal achiev problem avoid good guidelin serv cbr system goal achiev optim explicitli state reflect user prefer tradeoff optim object nonlinear retriev schedul achiev object desir current problem give adapt retriev schedul current problem specif unpredict rippl effect constraint propag tight constraint problem avoid discov causal model schedul assum imposs judg priori effect schedul optim schedul appli schedul outcom evalu term result effect schedul object singl schedul case provid advantag term focu traceabl problem solv process focu traceabl captur user evalu result singl schedul result appli schedul schedul entiti schedul exhaust accept result obtain clear singl schedul job schedul appli result schedul evalu regard optim prefer schedul clear construct method increment augment partial schedul schedul point unsuit contextu provid complet appli cbr schedul chosen underli schedul methodolog case describ applic schedul singl activ job schedul mean schedul repair action identifi class schedul repair action strategi detail section constraint propag propag effect schedul repair action rest schedul applic repair result schedul search space cabin space complet schedul incorpor accept user optim tradeoff predict case featur suitabl case index captur good tradeoff schedul optim make hypothesi regular domain albeit approxim featur indic divid categori categori consist global featur result schedul singl activ pertain global featur express characterist schedul relev oper contextu inform select repair action local featur categori predict gener bound repair necessit applic repair action constraint rippl reason effect repair action schedul priori amount unlimit lookahead analysi gener confin rang lookahead analysi limit repair time horizon section time local featur cabin estim effect repair action schedul result applic repair action evalu term tradeoff user predict effect modif action schedul correct qualiti modif result worsen schedul qualiti introduc constraint violat user perform consist evalu result schedul evalu record case part case repair histori repair histori constitut categori case featur case base incorpor distribut exampl collect captur repair perform tradeoff schedul circumst cabin search space complet schedul control search provid cbr search control provid select repair action appli evalu outcom schedul result applic select repair action global local featur indic retriev case suggest repair action appli featur repair histori retriev case suggest evalu repair outcom detail descript case section cabin overview gener type repair strategi repair tactic repair strategi high level descript class schedul defect repair strategi varieti repair tactic repair tactic special defect class identifi gener type repair local patch model modif local patch select repair action result chang sequenc activ alloc rearrang resourc assign local patch gener costli disrupt factori oper repair goal reduc job specif local patch strategi includ slack activ tardi resourc activ tardi model modif reformul problem chang model number job global constraint chang due resourc capac number shift model modif strategi facilit solut amount global constraint relax model modif strategi costli implement bui pai extra shift subcontract job default cabin strategi local challeng task system improv schedul relax constraint due date local patch unsuccess fulfil repair repair episod consid failur experi run stringent assumpt figur depict architectur cabin cabin initi schedul interact schedul repair modul autom schedul repair modul cabin oper mode exhibit level ffl knowledg acquisit interact mode acquir user prefer gener case base ffl interact model acquir case base incorpor user prefer suggest action evalu outcom user accept suggest overrid suggest ffl automat mode acquir user prefer guid schedul interact user experi report section cabin oper autonom repair process autonom oper mode basic job initi suboptim schedul randomli identifi repair random job select cabin explicit optim criteria select job repair inform fashion job current repair call focal job activ current repair call focal activ repair perform activ time activ focal job repair forward fashion start earliest activ job upstream slack mechan attent activ slack avoid unnecessari limit amount rippl effect move repair repair cabin retriev similar case appli repair tactic evalu result case acquisit incomplet domain knowledg schedul problem schedul suboptim schedul optim schedul train data test data evalu criteria contextu domain knowledg repair tactic featur valu figur cabin architectur activ tightli schedul move constraint violat repair select current problem cbr appli applic repair tactic section consist identifi resourc time interv involv current conflict chang util function activ conflict schedul util assign step make resourc reserv activ identifi step repair cbr predict evalu repair outcom context current repair deem find activ repair outcom cbr invok select repair tactic repair current focal activ case repair process exploit knowledg relat continu valid schedul flexibl current time capac impli repair success unsuccess user judgment figur show inform content case appendix show case instanc case base case describ applic repair action activ case featur heurist approxim reflect regular schedul regular repres repair notion freedom current schedul move activ posit global case featur reflect potenti repair flexibl schedul high resourc tight schedul current upstream slack heurist determin tardi focal job case global featur weight tardi salienc resourc util averag salienc resourc util deviat salienc repair histori tactic outcom type local featur salienc predict shift gain salienc predict alt shift gain salienc predict swap gain salienc predict alt swap gain salienc wait time salienc salienc salienc figur case act act wait time repair time horizon figur repair time horizon focal repair flexibl high standard deviat resourc util presenc highli resourc turn low repair flexibl local featur reflect flexibl schedul limit tempor bound tempor bound cabin time interv call repair time horizon repair time horizon focal activ time interv end activ focal activ focal job end focal activ figur local featur identifi spirit util predict gain achiev move current focal activ earlier time horizon predict reduct focal activ wait time move left repair time horizon repair histori record sequenc applic success repair repair effect repair outcom repair effect describ impact applic repair action schedul optim object weight typic effect reflect tradeoff object repair outcom evalu assign set effect repair action valu set judgment made train phase record case base outcom tradeoff involv set effect current applic repair action judg accept case outcom judg applic repair tactic consid failur explan express tradeoff respect balanc favor unfavor outcom optim object provid cbr repair repair outcom deem tactic select success case repair indic global local case fail indic fail outcom cbr invoc retriev similar past failur tactic successfulli repair tactic eventu success fix past failur assumpt similar outcom tactic impli similar causal structur past current case eventu success tactic similar failur potenti success current problem case acquisit session start empti set train problem present user interact cabin repair schedul hand user select repair tactic deem tactic applic procedur section appli chosen tactic current schedul effect repair calcul effect describ result repair respect repair object effect pertain schedul job effect pertain schedul weight averag resourc deviat resourc total schedul effect pertain job tardi resourc assign tradeoff util prefer machin reduc job tardi reflect effect due tight constraint effect ubiquit job shop schedul make schedul optim extrem hard applic repair tactic produc feasibl user decid result schedul accept base calcul effect effect shown appendix outcom judg schedul result applic heurist make improv respect user criteria happen harm effect user effect improv reduct job tardi enforc util total cost repair user worri qualiti result product low repair judg unaccept user judgment balanc favor unfavor effect relat optim object constitut explan repair outcom user suppli explan term rate import effect figur end repair appli repair effect repair user judgment explan repair outcom record case current problem featur effect accept repair outcom record user repair activ user tradeoff incorpor repair outcom current repair tactic effect calcul cabin salienc assign user record repair histori case user util repair tactic repair activ process continu accept outcom failur declar failur declar tactic repair user find repair outcom unaccept sequenc applic success repair user judgment explan case fail applic record repair histori case remark order respect case acquisit case acquir activ repair activ repeatedli repair due unaccept repair tactic applic case repair histori case augment success repair tactic effect outcom number case accumul section describ case experi acquir section report current result investig tradeoff incur cabin oper size case base case retriev cabin construct train perform schedul repair interact user retriev case select repair tactic evalu result schedul applic select repair case retriev tactic fix previou similar failur cabin util set indic case retriev order retriev case select repair global local featur current case current focal process appli repair tactic section repair appli result feasibl repair evalu perform cbr effect featur cbr invok return outcom set outcom current decid cabin perform cbr invoc indic conjunct current outcom fail heurist case global local featur find possibl applic heurist invok cbr indic retriev case fail past similar manner current cbr space failur method failur recoveri problem solver access past solut failur result cabin proce repair activ case retriev situat cabin neighbor method case retriev space neighbor calcul set featur retriev situat case retriev select repair space defin valu global local featur calcul find constant current problem train data base similar measur simplest singl nearest neighbor found chosen classif result select reason schedul clear predict featur due lack causal match nearest match potenti contribut accur classif larg number neighbor case categori suggest swap tactic higher confid classif result neighbor categori suggest left shift suggest decid repair tactic appli current current implement set nearest neighbor left shift similar current problem swap similar left shift select repair tactic nearest retriev case similar left shift success tactic occurr multipl case suggest classif result high similar potenti sum similar neighbor select frequenc class order avoid situat dissimilar case undu influenc classif result previou swap select repair tactic cabin total similar left similar case current problem comput cabin distanc dev similar salienc salienc featur case featur featur current dev standard deviat featur case distanc dissimilar case current problem similar similar case current problem util normal euclidean distanc measur dissimilar case problem prevent featur domin distanc calcul larg numer valu repair cabin repair schedul perform appli repair tactic select repair iter cbr repair tactic cabin method successfulli appli domain clear causal english word pronunci text classif left slide move focal activ resourc left timelin repair time preserv sequenc activ left shift move focal activ resourc left timelin repair time horizon minim disrupt left shift alt move focal activ substitut resourc left timelin repair time horizon minim disrupt swap swap focal activ activ left resourc repair time horizon disrupt swap alt swap focal activ activ left repair time horizon disrupt chang resourc assign focal activ substitut resourc give give repair current focal activ recent work expand set tactic perform addit experi process appli repair tactic determin predict start time focal activ repair predict start time activ temporari start time calcul repair tactic desir start time focal activ rippl effect conflict consist activ due constraint violat move focal activ predict start time note predict start time start time result execut repair ffl left shift left shift start time start time minim capac result move focal activ resourc focal activ repair time horizon ffl swap swap start time start time amount constraint violat resourc focal activ repair time horizon project effect move focal activ predict start time design resourc perform constraint propag identifi capac constraint violat adjust reserv activ conflict set simpl conflict resolv chang bia start time util function fig activ conflict set favor start time calcul step tactic appli involv substitut chang resourc substitut resourc util higher resourc focal activ schedul chang util function select start time order heurist favor higher util reflect prefer encod case base focal activ member conflict set opportunist schedul variabl gv order util function defin step restor start time affect activ reflect bia repair iter process result conflict free schedul effect cbr invok effect relev indic evalu repair outcom note activ move situat move current focal activ move conflict set focal activ figur detail graphic show local repair action left shift appli simplifi job activ current focal activ left shift chosen repair tactic step find start time activ left shift dictat activ start repair time horizon util function reflect prefer start late figur function adjust util function function step find conflict set consist affect activ move left member conflict set shown figur util function activ conflict set adjust reflect show adjust util activ util function focal activ activ conflict set schedul call result repair schedul shown bottom figur briefli illustr repair process simpl schedul repair shown figur row show assign activ white box correspond assign activ number insid white box identifi job activ belong activ activ identifi text write ith identifi jth job identifi kth activ job ten job job activ linear constraint resourc resourc bottleneck current focal job current focal activ indic retriev similar case calcul global weight weight tardi schedul resourc constraint propag constraint propag focal conflict machin machin machin machin machin machin time horizon function repair adjust function util util repair adjust figur repair tactic left shift resourc util featur calcul ratio util resourc avail resourc featur resourc util deviat resourc util resourc equal local wait featur defin time complet activ start present focal activ equal predict shift gain comput cabin predict start time current start time wait time repair predict start time defin section current start time wait time paramet focal activ heurist estim repair repair time horizon hyperbol tangent function predict shift gain predict alt shift calcul featur similar predict shift gain requir resourc activ bottleneck substitut predict alt shift gain predict swap calcul predict swap cabin formula predict shift predict start time calcul differ section predict swap gain predict alt swap featur requir bottleneck resourc substitut resourc figur origin schedul result case base retriev perform global local indic turn retriev found case shown appendix similar select swap repair tactic focal activ appli cabin calcul activ swap cabin select activ swap result amount constraint violat figur activ repair horizon activ swap finish earli choic swap lot downstream rippl effect contrari primari intent repair effect local calcul estim cabin decid swap job weight weight tardi effect appli swap tactic start time start time activ prior due larger durat activ rippl effect constraint violat activ successor activ resourc activ affect reschedul section constraint propag discov constraint conflict shift activ resourc figur schedul result repair result repair schedul shown figur effect repair calcul cabin estim local effect focal job calcul global effect schedul machin util chang estim weight tardi time unit estim unit weight tardi unit unit global weight tardi global cbr invok effect appli repair tactic indic determin repair outcom accept success case failur case retriev consid effect reflect tradeoff user prefer weight outcom consid accept failur case outcom consid reflect user prefer minim weight tardi cbr invoc effect indic retriev closest match case shown appendix effect match effect swap repair tactic outcom deem determin activ repair evalu approach conduct set experi test approach potenti effect captur user prefer optim tradeoff difficult model approach improv schedul qualiti irrespect method initi schedul gener approach produc high qualiti schedul lower comput cost compar simul iter repair method approach suitabl reactiv schedul method maintain high schedul qualiti minim disrupt face execut time failur difficult test due subject natur user obviou correl schedul result captur prefer defin qualiti schedul evalu subject address method test consist manner optim criterion implicit case result evalu experi report explicit criteria reflect user optim criteria built reason repair process optim schedul construct select repair action applic select repair tactic evalu repair action give repair applic repair action gather repair histori case activ repair repair effect calcul predefin evalu evalu repair outcom consist rule time gener case explicit optim object cabin implicitli indirectli reflect case base design object reflect case baselin evalu schedul gener cabin evalu approach benchmark suit job shop schedul problem number rang due date activ durat vari cover broad rang parallel machin job shop schedul problem instanc benchmark problem problem order activ order linear process rout sequenc order visit bottleneck resourc fix number resourc content make problem tighter paramet cover schedul rang control distribut order due date bottleneck control number bottleneck resourc ensur hardwir knowledg problem solut problem gener function embodi problem structur gener parallel job shop schedul instanc problem paramet vari control wai group problem randomli gener valu rang paramet valu bottleneck configur bottleneck slack adjust function rang bottleneck paramet demand bottleneck resourc close major part problem durat activ order randomli gener gener problem instanc problem control variat problem paramet method oper research schedul commun evalu perform schedul method problem randomli share featur problem structur problem machin substitut machin exist bottleneck machin cbr exploit captur regular structur problem transfer problem solv interest note transfer carri number order vari tabl benchmark problem variat problem origin report benchmark number research problem set substitut resourc solv parallel machin simpl job shop schedul due date order problem tighter percent origin problem method evalu capabl cabin problem set class divid half train consist repair gather case explain section case acquisit case acquir activ current focal activ number tactic number tactic activ activ repair repair repair focal activ activ conflict set focal move activ focal activ problem give maximum case train sampl optim activ focal activ repair upstream slack section train cabin train approxim case case repair valid problem repeat process interchang train test set report result valid problem set theoret predict bound repair global cabin run repair cycl prefer acquisit test hypothesi cabin acquir user construct case reflect user prefer repair minim weight tardi reflect complex criterion minim combin weight tardi case constitut sourc knowledg cabin object cabin explicitli base sourc suitabl sourc advic repair evalu graph fig show comparison perform cabin case base graph perform cabin tardi case base graph observ gener higher qualiti schedul respect minim weight tardi problem class gener higher qualiti schedul respect weight tardi cabin problem class optim schedul term weight tardi neglect account tradeoff weight tardi schedul repair result cabin acquir subject user prefer tradeoff object schedul case unlik tradit heurist schedul approach heurist suit optim criterion chang optim object unlik tradit schedul approach dynam tabu simul anneal approach doesnt requir explicitli repres object function cabin potenti induc complic form user object handl except case true user object elicit intens interview domain expert repres form rule construct modul gather case experi knowledg acquisit extrem labori schedul problem domain expert suffici knowledg make good schedul effici methodolog cabin induc effici control model case obtain applic insuffici rule set experi object repair set test problem tabl show repair cabin effici repair improv qualiti schedul repair potenti explan weight tardi problem set weight tardi problem set problem set figur schedul result case base tabl repair cabin wt cpu sec repair repair cabin result section cabin effect util failur inform store case detail predict reactiv schedul evalu cabin schedul method standard criteria evalu schedul qualiti criteria plan criteria attend schedul qualiti respect desir optim amount origin schedul effici quick process schedul execut execut proce rapidli subscrib view schedul gener schedul repair view iter repair experi separ subsect schedul qualiti effici import predict schedul gener reactiv schedul manag schedul process crucial handl schedul execut failur patch schedul quickli execut proce minim schedul disrupt import reactiv manag schedul schedul start import preserv continu domain substanti cost attend discontinu introduc reactiv schedul cost resourc assign criteria balanc trade result show predict schedul methodolog improv qualiti schedul gener varieti schedul method gener schedul higher qualiti varieti optim object lower process cost compar simul iter optim method recov execut time approach attend schedul qualiti term optim continu execut delai execut failur predict schedul repair predict schedul primari object experi optim schedul qualiti low comput cost investig compar cabin simul anneal simul anneal iter improv approach combinatori optim report yield solut qualiti cost larger comput effort number combinatori optim design integr imag process neural network theori sa appli schedul domain object report potenti find shorter tailor shift bottleneck procedur detail sa implement gener initi schedul select activ randomli repair action select repair action remain repair appli chosen repair tactic activ evalu result repair schedul respect explicit object result schedul schedul repair term procedur repair procedur repair activ probabl defin differ schedul evalu repair repair temperatur temp updat fix percentag fix number repair action appli procedur termin maximum comput effort reach ran experi time report result separ run sa incorpor probabilist result necessarili order test gener repeat set experi time initi schedul gener set regard dispatch heurist schedul dispatch rule select gener initi schedul wide practic job shop schedul earliest due date weight shortest process time rule order time urgenc factor rule heurist report good reduc tardi schedul condit schedul variabl order heurist gv order heurist start time section user object function assum minim weight linear combin inventori weight tardi function difficult optim heurist weight tardi compat situat weight tardi tabl present averag result problem benchmark base make varieti observ cabin improv initi schedul schedul method object note dispatch heurist extens oper research good result initi schedul gener dispatch heurist consid local tabl repair cabin sa base method initi schedul gener wt cpu sec schedul repair cabin repair sa schedul repair cabin repair sa schedul repair cabin repair sa schedul cb repair cabin repair sa easili improv initi schedul machin idl conjectur difficult improv initi schedul higher qualiti difficult improv schedul result support conjectur schedul improv percent schedul improv observ qualiti initi qualiti repair result cabin gener schedul compar qualiti averag time effici simul anneal contextu inform captur cabin case base system failur inform repair histori effect guid search prune path make cabin effici random search simul anneal investig behavior vi vi initi schedul gener train test set resourc wt cpu sec initi schedul repair cabin repair sa tabl repair cabin randomli gener initi schedul problem initi schedul problem randomli gener scratch account constraint resourc constraint due date gener execut schedul qualiti initi schedul low gener dispatch heurist tabl cabin perform randomli gener initi schedul behavior cabin regard method initi schedul gener confirm intuit oper research commun higher qualiti initi repair solut consist behavior behavior simul anneal heurist behavior constraint satisfact problem interest result ffl evalu control model learn conduct set experi ascertain effect learn control model select repair action result learn obtain select applic repair tactic activ repair result show repair improv schedul qualiti approxim problem ffl evalu scalabl test scalabl approach gener addit set problem resourc real oper factori configur number tabl repair cabin resourc order problem wt cpu sec schedul repair cabin schedul repair cabin schedul repair cabin schedul cb repair cabin type remain long period number fluctuat due vari custom demand econom factor base vari number job number resourc problem gener problem gener function vari paramet set control wai knowledg acquisit method acquir train case base problem job resourc cross valid approach pattern result set problem result shown tabl ffl evalu knowledg transfer order test gener issu learn transfer acquir collect case solv resourc job benchmark problem collect step solv resourc job problem result shown tabl result base resourc job tabl cabin perform bigger problem origin resourc job pattern cabin improv schedul qualiti independ initi schedul gener hold wt cpu sec schedul repair cabin schedul repair cabin schedul repair cabin schedul cb repair cabin tabl repair problem collect problem knowledg acquisit practic point result encourag show cabin potenti applic oper factori knowledg transfer allevi knowledg acquisit burden affect system perform qualiti schedul result repair unpredict execut event reactiv schedul repair involv recognit conflict introduc schedul result unexpect uncontrol chang execut propag select applic repair action present discuss evalu criteria present reactiv repair step cabin step reactiv repair recognit conflict introduc schedul result unexpect event execut environ type conflict tempor conflict reflect inconsist schedul actual start end time activ resourc conflict reflect inconsist resourc capac capac requir process activ effect introduc conflict propag downstream point time unexpect event happen involv undo reserv inconsist result unexpect event propag effect determin consequ unexpect event rest schedul result step feasibl schedul typic qualiti predict schedul occurr unexpect event cabin repair suboptim schedul result step mechan cabin reactiv repair predict optim attempt made repair activ execut unexpect event unexpect event loss capac machin activ process resourc time breakdown illustr repair process figur show predict schedul problem predict schedul optim section problem static start time job weight tardi unit comput predict machin breakdown creat middl schedul broken machin breakdown time occur total execut time effect rest schedul estim durat breakdown time averag durat activ problem assum process end time breakdown effect breakdown propag downstream activ schedul broken machin schedul reserv overlap time interv figur schedul result machin breakdown figur schedul result machin breakdown figur schedul result reactiv repair sequenc end time breakdown call activ typic result constraint conflict relat activ fix constraint propag mechan cabin feasibl schedul result figur show schedul result machin breakdown propag effect weight tardi schedul worsen qualiti delai schedul execut till option practic import schedul repair enabl execut continu cabin appli repair schedul figur big delai consequ capac assum optim weight tardi repair object figur show schedul result repair cabin weight tardi system occurr unexpect event execut attempt repair strategi result advantag opportun activ finish earlier schedul end addit resourc incur execut delai entail event partial total loss resourc activ finish schedul strategi suboptim repair strategi throw rest point occurr unexpect event specul literatur strategi effici produc high qualiti schedul schedul disrupt measur disrupt previou repair strategi increment exist schedul argu literatur increment repair process achiev effici gener high qualiti schedul continu execut minim schedul disrupt desir date evid provid favor increment schedul repair exhibit increment repair approach perform repair object simultan demonstr reactiv capabl respect execut time typic happen schedul system guard set experi cabin repair predict schedul unexpect capac loss cb result demonstr increment repair methodolog cabin superior perform reactiv schedul repair execut failur desir evalu criteria measur disrupt respect differ start time repair schedul origin predict schedul occurr unexpect capac differ resourc assign activ repair versu origin schedul differ sequenc activ resourc repair versu origin schedul repair origin schedul qualifi measur schedul disrupt attend resourc process expect job finish time manufactur start time plan product materi prepar product shipment chang resourc assign chang product rout factori floor result chang program materi handl equip autom guid activ sequenc machin machin worker assign difficulti smooth continu schedul execut factori floor sever depend natur manufactur process factori floor layout unifi measur disrupt schedul hard formul compar perform reactiv repair cb machin breakdown ten set problem machin durat time averag activ simul resourc similar machin breakdown simul set problem cabin start time disrupt rout disrupt sequenc disrupt repair wei tar cpu time tabl reactiv repair tabl show averag result experi result show term disrupt qualiti cabin outperform cb effici cb problem cabin spend time time cb result mislead reason rapid monoton repair behavior cabin shown figur cabin achiev result qualiti cb time point cb finish figur cabin achiev weight tardi unit compar unit achiev time period contrast method provid increment schedul cabin increment reactiv repair result feasibl schedul repair repair process stop schedul produc cabin execut higher qualiti produc cb time period behavior consist exhibit experi system reactiv context great concern result robust breakdown repeat experi variat durat machin breakdown breakdown durat time averag activ durat figur show result graph show reactiv repair effici satur improv characterist cabin repair process suitabl reactiv repair continu cpu time weight tardi reactiv repair figur repair cabin problem execut minim delai schedul qualiti loss repair case graph figur compar perform cabin size result obtain base cabin type case approxim case gener repair cycl train set problem activ case base number case situat randomli select delet approxim size case base method gener case base random delet case bigger case base similar ablat studi perform initi schedul gener method cb viewpoint knowledg interest question knowledg acquisit termin suffici knowledg acquir enabl high qualiti perform knowledg base system knowledg question case knowledg captur satisfactori perform difficult answer question gener due schedul problem approxim natur cbr causal model exist size give satisfactori result term schedul qualiti excess overhead case acquisit case retriev case base result support hypothesi larger number schedul qualiti margin payoff case base size explain partial fact number case captur characterist problem addit case give redund inform size time case inform part problem space result higher qualiti improv term effici observ graph cpu time repair weight tardi machin breakdown averag machin breakdown averag machin breakdown averag machin breakdown averag figur repair ratio problem set weight tardi case case case case number case cpu time figur effect size qualiti effici case optim choic term cpu time qualiti case outperform case term schedul qualiti case base case provid payoff proport case base size discuss result show repair method potenti captur user optim prefer perform term produc schedul high qualiti compar construct schedul method compar simul repair produc schedul compar qualiti substanti comput save repair exhibit desir anytim characterist outperform construct method term minim disrupt maintain high schedul qualiti attempt answer question make approach power approach stem reason point approach make complet assign complet schedul provid inform guid search compar construct method partial assign method captur relev inform global case featur exploit contextu inform case retriev job shop schedul optim belong categori case featur captur import domain repair flexibl complement inform fail applic repair case histori fail case case memori failur exploit cbr prune path search space futur similar situat result discuss present section support hypothesi case cabin acquir report experi cover solut space fairli evenli distribut repair advantag coverag conjectur good qualiti solut evenli distribut search space backtrack potenti disadvantag good solut part search space dispatch heurist myopic advantag search path regular structur problem captur case train phase inform transfer solv test problem inform transfer problem size result tabl tabl show case acquir train set problem effect solv test problem job question extent inform captur case set problem transfer job shop optim problem problem structur albeit great theoret practic difficult answer theoret contrast problem travel insight analysi perform structur properti problem similar job shop schedul optim problem open research problem due tight constraint job shop constitut featur problem make difficult easi make problem substanti similar reason simpl optim minim problem proven heurist find optim imposs theoret prove schedul optim techniqu problem solut extens research understood facto difficult good approach problem structur job shop explicit optim analysi cabin explicit object aim captur implicitli user prefer relat work work share motiv goal work motiv interact user manipul schedul present system monitor user manipul request reason made inform system knowledg approach test approach root concept mechan long line research schedul sol schedul gener increment construct merg partial schedul work extens investig properti aspect schedul methodolog sophist procedur techniqu schedul research tradit view schedul opportunist repair oper static design assumpt determinist applic variabl order heurist static determin control level model applic repair action approach advanc state art learn dynam adapt mechan search procedur adapt repair model current problem solv circumst user prefer tradeoff gener schedul repair base schedul space complet schedul respect similar simul anneal perform iter repair knowledg form constraint type evalu criteria ad basic simul anneal framework shown improv converg speed studi tradeoff minim perturb speed converg conflict free schedul schedul qualiti measur term number violat resourc constraint repair heurist repair minim number conflict result lookahead investig perform analyz heurist shown power solv shown inadequ type job shop schedul constraint satisfact problem initi assign random reli good initi assign repair hand shown improv schedul qualiti irrespect initi schedul gener percent improv qualiti final repair schedul vari schedul modif procedur encod small snapshot schedul call focu search inform gain increment schedul process classifi resolv bottleneck plausibl explan base learn appli learn search control rule search effici schedul task nasa space shuttl payload ground process pebl enabl system gener target concept chronic resourc distribut exampl cost function minim number remain conflict schedul unlik cabin doesnt explicit object appli learn techniqu acquir user optim prefer record user repair optim schedul base acquir object schedul method consid relat method plan system previou system increment solut motiv primarili concern comput preserv plan correct improv plan assum exist strong domain model inform plan correct chef assum exist simul evalu deriv plan detect plan failur domain rule select repair research base hypothesi plan built planner causal cbr find satisfi plan effici cabin knowledg acquisit system relat previou knowledg acquisit system proto approach requir causal explan expert teacher acquir domain knowledg schedul repair embodi user program assum possess causal domain knowledg user give solid explan select repair predict effect select action plan tight interact user li abil perform consist evalu result problem solv impart program case problem solv experi histori evalu tradeoff futur work advoc framework knowledg acquisit iter repair schedul optim approach util mechan record user repair tactic schedul applic select repair tactic approach predic exist set schedul repair oper respect local view problem offer select advantag improv schedul captur user schedul prefer judgment capabl acquir user optim prefer import domain strong domain model explicitli express object unavail optim heurist evalu implement complic design mainten system cabin framework allevi problem result show potenti approach captur effect util user schedul prefer present schedul model result schedul object implicitli reflect case base differenti bia schedul repair procedur result show defin object reflect case cabin produc schedul higher qualiti compar schedul simul anneal cabin robust improv qualiti schedul method gener seed schedul effort expend captur larg number case amort futur repeat case base high qualiti schedul effici cabin acquir case user interact process solut improv undu overhead user cabin potenti accommod acquisit user prefer chang time futur work investig issu issu autom hierarch abstract repair deal complex object larger problem acknowledg research partial support advanc research project agenc contract work perform author visit scientist robot institut carnegi mellon support electr industri mr zeng insight discuss appendix case instanc slot slot featur salienc slot featur salienc slot featur salienc slot featur salienc slot featur salienc slot featur salienc slot featur salienc slot featur salienc solut solut effect effect salienc domain gain effect salienc domain gain effect salienc domain gain effect salienc domain gain effect salienc domain gain result appendix case evalu slot slot featur salienc slot featur salienc slot featur salienc slot featur salienc slot featur salienc slot featur salienc slot featur salienc slot featur salienc solut solut effect effect salienc domain gain effect salienc domain gain effect salienc domain gain effect salienc domain gain result solut effect effect salienc domain gain effect salienc domain gain effect salienc domain gain effect salienc domain gain effect salienc domain gain effect salienc domain gain result refer shift bottleneck procedur job shop schedul manag david denni marc albert learn algorithm machin kd ashlei model legal reason case hypothet phd baker introduct sequenc schedul textbook rai bareiss knowledg acquisit unifi approach concept learn academ cooper bottleneck identif process chronolog intern joint confer artifici intellig page acquir implicit knowledg complex domain expert system taylor hard problem twelfth intern joint confer artifici intellig robert stephen david waltz mip memori knowledg engin commun editor nearest neighbor nn pattern classif techniqu ieee comput societi lo dean boddi analysi time depend plan seventh nation confer artifici page saint aaai mark fox case studi shop schedul phd depart comput carnegi mellon simon french sequenc introduct mathemat elli kristian hammond plan view plan memori task academ optim simul part oper optim simul part ii color number oper mark johnston ai nasa space telescop sixth confer artifici intellig page santa ieee cs kambhampati jame hendler theori plan modif artifici fox issu design workshop report ai reason evid causal explan reason page john electron tool shop schedul manufactur sycara process reason problem solv ninth intern joint confer page lo ijcai david yun methodolog constrain resourc problem eleventh intern joint confer page ijcai peter van jan job shop schedul simul anneal oper langlei systemat search strategi san aaai lm dv sj brown reason solut problem redund engin larg scale manufactur intern journal expert liu sycara distribut constraint satisfact constraint partit coordin reaction intern workshop distribut artifici hidden schedul knowledg miss link ifip work confer knowledg base product manag laird solv constraint satisfact schedul problem heurist repair method eighth nation confer artifici page aaai laird minim heurist repair method constraint satisfact schedul problem artifici thoma morton david heurist schedul applic product system product manag john wilei son ron stuart russel long page san aaai accur myopic tardi schedul technic report graduat school industri carnegi mellon katia sycara learn control knowledg case schedul optim problem tenth ieee confer intellig page san ieee muscettola schedul iter partit bottleneck conflict ninth confer ai page march ieee reactiv plan seventh nation confer artifici page aaai develop manag expert proven techniqu busi industri el rissland kd ashlei credit assign problem compet factor reason reason page david denni kibler learn episod optim machin learn ninth intern workshop page norman sadeh techniqu job shop schedul phd school comput carnegi mellon smith sf cheng cc heurist constraint satisfact schedul eleventh nation confer artifici aaai norman sadeh mark fox variabl order heurist schedul fourth intern confer expert system product oper page hilton head synthesi tool engin design intern journal expert rl simpson comput model reason problem investig domain disput mediat phd school inform comput scienc georgia institut js miller applic cbr desk applic reason page muscettola integr multipl schedul perspect gener detail product plan sme confer ai long septemb craig stanfil david waltz reason commun sycara patch plan tenth annual confer cognit scienc sycara plan agent plan eleventh intern joint confer artifici intellig manuela veloso learn analog reason gener problem solv phd school comput carnegi mellon learn improv schedul artifici deal reschedul iter repair workshop product schedul san aaai deal iter repair schedul reschedul ieee transact man anytim reschedul darpa workshop innov approach schedul page san darpa
DB/1059 3 readi feder solut jr art kaufmann suit el california abstract paper describ feder system exploit activ storag hierarchi activ storag hierarchi system storag media store retriev data disk detail discuss atom data store data concept found describ commerci relat manag execut sql queri directli data store complet storag hierarchi paper applic requir emerg feder technolog analysi base product develop refer feder system includ conclud describ candid applic emphasi feder exploit combin activ storag hierarchi feder technolog introduct commerci manag system design util disk storag activ debat disk technolog evolv point store larg amount data posit happen topic discuss academ forum paper describ analyz storag system capabl trend storag devic measur document system applic primarili disk media storag support optic media provid part hierarch storag manag option current solut requir extens administr custom program written support optic media major tape backup restor portion system tape direct data storag queri term activ storag hierarchi queri execut data store media research term current econom storag media store data tape approxim cost store data disk cost store data optic media store data disk figur illustr tradeoff storag media cost raid xx gb magnet xxx gb optic xx tb tape xxx tb capac millisecond millisecond figur storag triangl minut perform anc paper organ section briefli describ section describ feder technolog product section analysi conclud section describ candid categor storag space argu requir activ storag hierarchi order system support queri activ storag hierarchi system design optim store atom data media handl data placement issu work conjunct manag administ movement relat data sql access platform varieti protocol sm rm engin run sun microsystem ultra famili comput figur show architectur built top list support storag devic media found list constantli updat rm consist tabl data user store access option locat tabl data metadata describ compon rm logic physic structur user tabl index resid user metadata resid system user metadata store sm file rm user tabl consist tabl segment tabl segment separ sm rang index rm restrict number segment improv perform magnet manag manag api manag raid optic figur manag tape feder feder provid system data product integr sourc provid uniform access data product migrat data tape optic storag data sourc product area includ ibm microsoft approach legaci applic excel candid feder solut import softwar design accommod legaci data legaci data file load feder data sourc system activ storag hierarchi data sourc feder system data sourc feder system wide vari capabl perform characterist differ feder oper feder requir metadata describ locat data capabl data sourc feder receiv develop access element plan queri data sourc feder combin refin result set return data sourc feder deleg data sourc depend capabl feder task data locat feder job initi assign data item data daili migrat replic data sourc wai feder accomplish job data locat vari account capabl data sourc natur access pattern data explain simpler obviou logic horizont partit logic vertic partit horizont partit recogn row logic tabl assign data sourc common data row sourc figur show item product price migrat rule ag strategi predic item product price rdbm migrat im figur logic horizont partit tape optic column tabl assign data sourc storag figur show text video column store tape optic scalar valu store disk kei product price text video kei product price raid kei text video figur logic vertic partit optic tape relat undergo evolut call relat evolut base type function ad relat system object queri languag ad navig support paper concentr base manag system relat sql repres market section describ candid applic storag hierarchi store retriev data base content argument appli oql oodbm implement larg applic exampl illustr larg object udf capabl provid analysi udf librari capabl section provid candid usag show sql tabl scalar column creat tabl stock price earn report text film video ic id show queri udf project list select predic similar store stock data time row dai stock select column column major differ column valu mean column valu interpret server udf retriev queri row scalar valu column retriev base content simpl step applic add text document column data exist retriev scalar predic evolut function retriev data base content column vendor realiz provid udf librari written domain expert user develop udf function packag librari provid good head start applic lead udf librari shown system udf librari candid applic ibm extend oracl cartridg informix datablad fundament point paper system directli support form activ storag order larg applic experi talk custom prospect show applic written lack critic function due limit system busi issu discuss referenc technolog system cost issu busi issu cover complex issu process fund scope paper tabl classifi repres applic size number drive disk storag realist applic terabyt applic byte system document largest commerci instal nation retail point sale telecommun call detail system continu scalar valu data petabyt applic byte text form imag form pictur import data type incorpor applic product document storag retriev text document larg extranet requir abil search base document content udf special index intern handl index concept match issu concept match search oper system return document keyword mv nt imag column retriev base great deal research imag featur extract result research begin commerci product reader learn featur support evalu udf librari capabl ibm extend text udf librari capabl document manag extend petabyt rang size store current print record document librari congress estim terabyt academ research current storag requir estim petabyt applic byte patient clinic diagnost record maintain paper organ incent integr patient inform patient complet record famili medic recent laboratori result complic unnecessari delai treatment duplic test consequ situat uncommon fatal reaction incompat medic prescrib healthcar insur compani feder agenc access data includ data text medic progress written imag data audio data verbal progress diagnosi video data surgic patient nutrit nation medic knowledg bank program address issu assum gigabyt storag citizen add total storag applic byte spatial solar system planet earth digit earth store retriev data base properti data type domain rang simpl complex time dimens weather inform provid volum data grow tremend rate candid applic mention section potenti creat larg video special class issu address digit compress decompress video network stream avoid futur retriev applic store retriev video blob retriev base content size applic terabyt byte telecommun call detail nation retail point sale data petabyt byte text imag product descript byte nation medic insur record byte spatial terrestri data video audio data archiv byte size tabl applic size potenti video messag provid inform inform video archiv video numer exist movi archiv video intercept intellig agenc estim tv station world gener petabyt data year assum futur station start broadcast high definit data requir factor add sourc video feed total data year estim storag audio call world add year imagin ad video audio sourc internet data applic byte applic expect technolog advanc make level storag feasibl assum famou law expect storag econom cost effect middl centuri administr user find wai fill storag storag paper briefli restat case system directli support storag optic major feder system feder enhanc develop applic feder logic horizont vertic partit row column exploit storag hierarchi tape provid function librari function major paradigm shift facilit ad capabl govern applic conclud describ applic requir activ storag hierarchi manag directli manag system refer legaci interfac increment morgan heterogen dbm confer method tool offic octob pp manag storag hierarchi system storag system applic socrat vldb septemb optim place data tertiari storag vldb pp schedul onlin tertiari storag sigmod pp measur tertiari storag vldb pp tune archiv storag ieee mass storag system march san california sum human scientif juli object data manag queri languag storag larg scale data mine vldb pp manag binari larg ieee mass storag system march san pp ansi nation medic knowledg vldb pp data elev hierarch multimedia storag vldb pp winter corpor vldb
IR/1060 5 effici effect metasearch larg number text clement yu meng liu wu rish dept illinoi il dept comput suni ny school comput florida intern fl abstract metasearch engin facilit ordinari user retriev inform multipl local sourc metasearch content local repres repres user queri evalu set repres order determin search number order ten thousand tradit metasearch engin ineffici queri evalu repres storag requir site metasearch engin larg hierarchi repres improv effici provid algorithm search hierarchi show retriev effect algorithm evalu user queri repres show algorithm effici altern alloc repres site storag burden site metasearch engin reduc introduct internet vast inform resourc recent year ordinari user find desir data search engin creat search engin text defin set document search search engin invert file index document creat store search engin term repres word combin index identifi document term quickli inform user store multipl search engin case user find research paper subject area desir paper scatter number publish substanti effort user search identifi paper retriev paper solut problem implement metasearch engin top local search engin metasearch engin interfac maintain index document sophist metasearch engin maintain inform content underli search engin call repres search order provid servic metasearch engin receiv user pass queri local search collect result local search engin queri user invok multipl search engin closer examin metasearch approach reveal problem number local search engin metasearch engin small percentag search engin suffici document queri order avoid reduc possibl invok useless search engin identifi search engin provid result queri pass queri identifi search engin exampl system emploi approach includ wai aliweb ggloss savvysearch problem identifi potenti search select problem select compar queri repres user similar document local posit integ document retriev identifi retriev collect fusion problem present integr solut select problem collect sion problem number emploi hierarchi root node repres repres virtual global logic document local leaf node repres local suffici condit rank optim result provid show superior perform approach result essenti demonstr retriev method distribut environ yield result data store site number local hierarchi effici organ repres hierarchi level provid effici search algorithm search hierarchi show search yield retriev result repres hierarchi retriev perform hierarchi search algorithm yield equal good retriev effect show method effici rest paper organ section present solut select problem collect fusion problem repres organ hierarchi section solut extend hierarchi level effect effici issu algorithm address conclud paper section due space provid proof result proof detail found access web relat work larg number paper issu relat metasearch engin distribut collect publish research result close relat differ identifi review work area ggloss project similar rank measur suffici condit optim rank algorithm determin document return organ repres hierarchi search mention algorithm search lack evid search hierarchi level yield retriev effect search hierarchi suffici condit rank optim consid queri structur data unstructur text data consid paper theoret framework provid achiev optim result distribut environ approach depend paramet difficult estim practic result provid result demonstr retriev document distribut environ essenti effect data site result depend exist versatil collect term relat queri extract ad queri actual retriev document place internet environ data highli unclear versatil collect fact construct collect storag penalti high order accommod heterogen algorithm search hierarchi repres larg number retriev hierarchi section metasearch architectur approach review architectur suitabl moder number search engin repres content construct local repres global form user queri compar repres rank similar document user queri ahead section provid suffici condit rank optim condit arrang descend order similar similar document section describ similar similar document estim user repres repres global strategi retriev document individu stop search addit merg retriev document search sketch section result provid section assum similar document queri distinct queri paper simpli set word submit user transform vector term weight term essenti content word dimens vector number distinct term term compon queri vector term term weight weight term depend number occurr term queri total number occurr term term frequenc weight weight term depend number document term rel total number document document frequenc weight document similarli transform vector weight similar queri document measur dot product respect vector dot product divid product norm norm vector xn pp normal similar similar function normal cosin function sake paper version cosin function queri document frequenc weight term frequenc weight document term frequenc weight architectur metasearch highest level root repres global addit level level repres local user queri process metasearch engin repres rank metasearch engin invok subset search engin retriev merg document individu search engin optim rank assum user interest retriev similar document queri rank optim exist similar document document suffici condit rank optim ffl rank optim similar similar document larger similar document queri similar similar document rank result appli similar function function assign relev document estim similar similar document estim similar similar document repres global queri repres consist term quantiti maximum normal weight averag normal weight term term denot aw jdj norm document dn maximum document normal weight ith term aw simpli averag valu document includ document term repres consist term document frequenc number document term global gener weight document frequenc weight term denot idf term similar similar document respect queri idf idf term frequenc queri estim max idf aw idf intuit estim similar document maximum normal weight ith queri yield half express brace queri document averag normal yield half maximum similar document maximum normal weight queri term normal queri yield equal drop jqj present impact rel similar valu similar document chang estim slightli earlier estim easi comput time linear number term queri estim improv combin term adjac posit process queri experi section coordin retriev search engin rank order briefli review algorithm determin document form list document return user invok metasearch engin search engin turn similar similar document metasearch engin comput minimum valu search engin return document metasearch engin similar greater equal minimum document sort descend order similar document return user invok process repeat document return user shown rank optim desir document ahead algorithm retriev similar document respect queri result experi form articl pose newsgroup internet articl collect stanford newsgroup articl form separ smaller newsgroup merg produc larger altogeth queri submit real user data queri ggloss project obtain subset queri subset consist term refer short queri subset consist queri term long queri tabl provid comparison method method ggloss number tabl repres percentag similar document retriev method method hc method short queri method hc method long queri short improv method method rang long improv rang short method retriev averag similar document internet queri typic short averag number term internet queri result retriev similar document multipl essenti effect document store number search algorithm number similar document number document transmit search gener hierarchi repres definit repres architectur repres architectur suitabl moder number search engin search engin interchang logic search engin retriev document logic number thousand ten storag effici problem amount storag repres enorm estim similar similar document time consum larg number introduc gener hierarchi repres search algorithm hierarchi number estim significantli reduc address storag issu defin hierarchi repres lowest level repres individu local local logic group document logic exist level hierarchi repres form local repres directli repres call construct repres level physic construct consist quantiti term repres quantiti maximum normal weight maximum averag normal weight term maximum normal weight term repres ij maximum normal weight term rs max ij maximum averag normal weight term rs obtain maximum quantiti compon repres number level figur illustr comput term group higher level repeat process root node repres inform root node hierarchi case discuss section global document frequenc term local figur illustr process deriv quantiti singl term hierarchi quantiti node weight quantiti maximum averag normal weight algorithm search hierarchi rs logic local lower level hierarchi parent similar similar document queri idf idf estim rs root repres estim max idf idf maximum normal weight term aw aw averag normal weight term estim formula estim similar similar document children lower level chang replac aw maximum averag normal weight term eth child provid search algorithm search hierarchi repres main idea algorithm children select repres yield largest estim similar repres local search engin invok document retriev section intermedi node similar similar document child repres estim child repres node arrang descend order similar merg current list node descend order similar form list repres node order estim similar due repres local largest largest repres local search engin invok document retriev section search process execut node largest estim similar detail number document root root node hierarchi minimum similar retriev document search initi set highest similar similar document child root estim child node arrang list descend order estim similar remov repres local step local similar document similar return csim send document similar ii document receiv similar document local send document similar csim ii iii document receiv similar document end step step similar similar document child child node arrang list descend order estim merg form descend order estim repeat step result merger mention algorithm softwar compon metasearch engin collect transmit document search form list document present user effect algorithm algorithm gather document retriev local document receiv step process decid document select form document present user section arrang list descend order estim similar step execut order list algorithm intermedi node interleav list node descend order estim similar local step execut determin document retriev local node replac children execut step order arrang descend order estim algorithm give retriev perform hierarchi section proposit establish fact proposit local estim similar similar document higher similar document step algorithm execut execut proposit search descend order estim similar method estim similar similar document result hold estim method long estim method function maximum normal weight maximum averag normal weight averag normal weight case local effici algorithm give simpl illustr effici search hierarchi comparison architectur disjoint group level root highest level level consist repres local architectur estim comput carri queri estim comput carri largest estim estim comput local estim similar highli rank local estim similar similar document addit estim comput carri similar document found local altogeth estim comput comparison estim order magnitud save achiev establish result show search algorithm effici number similar document note bound height hierarchi number children node hierarchi result proposit singl term queri number estim comput assumpt requir situat queri multipl result true properli cluster similar belong logic denot maximum normal weight term defin similarli definit set suitabl cluster hierarchi respect queri term condit hold number similar document queri similar document motiv definit figur statist term shown figur illustr suitabl cluster figur illustr suitabl cluster mean maximum normal term weight averag normal term weight term figur similar definit suitabl cluster respect queri reason inequ reason high valu statist term cluster similarli low valu term cluster condit true queri hold queri cluster properli figur show violat definit true high valu statist term mix low valu statist term impli suitabl cluster proposit suitabl cluster respect queri number similar comput bound number similar document height hierarchi number children node placement node hierarchi assum discuss hierarchi repres complet site metasearch engin reason choic potenti problem approach amount storag requir store repres larg problem potenti remedi illustr size repres size local case set local level hierarchi assum size repres averag size compon repres recal quantiti term repres assumpt base compon lot term common number distinct term number distinct term compon previou involv illustr storag requir size total size store repres repres storag requir local made level amount storag repres approxim number node level leaf node number node bottom level order heavi burden site metasearch term storag process repres site power search hierarchi repres carri site repres site resid storag requir approxim describ process execut queri local repres store local site queri submit site metasearch engin global document frequenc term root document frequenc queri estim similar similar document execut algorithm parent local repres reach queri global document frequenc term child child site estim similar similar document forward estim global site continu execut search algorithm algorithm execut distribut multipl site consist site site local store repres versu tradit repres store site incur higher commun cost process estim local site execut parallel method storag burden site repres local storag repres site shown distribut environ involv reason number hierarchi repres estim algorithm yield effect document site number hierarchi repres number level provid algorithm search hierarchi shown search produc effect hierarchi show search hierarchi effici singl term queri submit frequent internet environ assumpt cluster show search queri effici plan implement hierarchi search process number level futur perform experi incorpor inform term linkag web affect relev document solut select problem collect fusion problem research support nsf nasa aro grate gravano provid collect document queri experi refer baumgarten probabilist model distribut inform retriev acm sigir bruce croft search distribut collect infer network acm sigir gauch adapt agent inform gather distribut inform sourc aaai symposium intellig agent march gomez intellig fusion distribut search engin journal comput gener gloss broker hierarchi vldb metasearch engin learn search engin queri ai inform system corpor wide area inform server technic report machin april srivastava inform manifold aaai spring symposium inform gather distribut heterogen environ koster index web comput network isdn search broker usenix symposium internet technolog system rish determin text search internet vldb rish estim search engin ieee data engin liu challeng solut build effici effect metasearch engin technic dept suni salton mcgill introduct modern inform retriev etzioni metacrawl architectur resourc aggreg web ieee learn collect fusion strategi acm sigir callan effect retriev distribut collect acm sigir meng rish find similar document multipl text ieee confer advanc digit meng rish methodolog retriev text document multipl tech illinoi meng principl queri process advanc applic morgan san rish effici effect metasearch larg number text tech illinoi lee server rank distribut text resourc system internet intl conf system advanc
IR/1061 5 intern confer intellig text process comput linguist dan lectur note intellig artifici contextu rule text analysi instituto de de universidad de la herrera cam cnr université pari bd pari franc tel abstract paper describ formal analysi label text segment rule contextu rewrit rule restrict form negat underspecifi text segment consid relev task base context parser rule present consist complet issu discuss result implement parser set rule orient segment text proposit shown introduct paper describ formal analysi consequ label text segment rule identifi portion text label function portion text portion text portion text satisfi condit label mean rule includ element punctuat portion text specif order rule determin element present order element contigu portion text rule state maximum size list element portion text section describ background introduct kind rule thought tool specif text process contextu explor system section present detail rule main underli text exampl result analysi obtain run system fulli implement intern confer intellig text process comput linguist dan lectur note intellig artifici section deduct system inact chart parser contextu rule present search strategi ensur consist complet concept briefli discuss line futur work mention background text analysi inform extract text widespread dai avail larg quantiti textual inform pose challeng tool capabl field natur languag process requir requir complet analysi text object fulfil textual inform sourc term object process text analysi incorpor domain depend knowledg order accomplish desir shown highli product text basi gener linguist knowledg inform extract system muc confer kind system case goal extract kind inform text inform terrorist inform joint ventur contextu explor methodolog develop group linguist motiv research line relev achiev repres mention kind text process system rule system present paper tool descript analysi text hypothesi inform relev specif task made base relat relev item contextu item present section describ detail contextu explor greatli inspir rule contextu explor develop base observ textual process task knowledg extract automat solv unit provid linguist context account cognit observ shown themat lexic marker search strategi linguist work text analysi shown interest identifi locat linguist marker combin order lend mean textual unit textual process call identifi studi semant textual categori involv text independ text domain causal definit themat announc studi perspect categori level causal reli cognit model themat announc base empir observ textual organ intern confer intellig text process comput linguist dan lectur note intellig artifici contextu rule text input contextu rule defin comput model oper rule model text basic unit text word lexic punctuat mark occurr term token design occurr textual unit token occur specif order text account text directli model finit sequenc set word punctuat mark call model length text wi token inform structur organ present featur distinguish portion text inform extend basic model text process add inform text tagger add categori word desir repres inform homogen form lead extens initi model inform initi present text ad essenti qualif subsequ contigu segment text model basic compon segment text label repres segment text pair indic denot posit denot place text model finit set defin text token addit qualifi element token word punctuat mark set σ set addit label qualifi segment total set label assum finit set span pair span span partit size span set distinct span extent pair span element γ set extent token posit γ addit element label qualifi segment posit posit γ element γ intern confer intellig text process comput linguist dan lectur note intellig artifici refer text depend model case refer token case length text denot number token γ extent token addit extent piec inform task linguist correctli identifi concept underli label notic set extent obtain depend inform repres section γ simpl text found similar defin text clark al paper algebra structur text search descript contextu rule contextu rule express identifi label portion text portion text label satisfi condit function portion portion text portion text portion text satisfi condit label includ element punctuat portion text specif order rule determin element present order element contigu portion text rule state maximum size list element portion text defin notion syntax contextu rule finit set contextu rule express label bodi set specif label bodi string type element label belong zone string string bodi string bodi empti string stand string refer condit rule string label surround zone zone express form set label size natur number definit set mention zone rule set empti label surround zone consid belong part present addit constraint reason constraint discuss section label belong zone rule label condit check prior rule execut compil intern confer intellig text process comput linguist dan lectur note intellig artifici contextu cr string bodi string cr defin final part complet syntact descript contextu rule extend bnf notat figur label rh rh oi od oi od label label oi od identifi identifi integ fig syntax contextu rule mean contextu rule give mean set contextu rule term result applic text cr contextu rule set γ text length α condit string span bodi condit cs defin span satisfi condit contextu rule cr element ad text span satisfi condit part cr restrict definit partit span satisfi α partit size span span ti satisfi ti satisfi label iff extent belong γ ti satisfi zone iff span greater size measur ii exist span satisfi span satisfi condit part contextu rule cr partit span satisfi element bodi span satisfi extent deriv intern confer intellig text process comput linguist dan lectur note intellig artifici repres function applic rule cr text γ span partit defin γ exist extent extent deriv γ rule cr span partit ii γ text γ deriv step extent rule cr exist span partit extent deriv rule span partit real situat rule set rule scr interact defin relat scr text extent γ scr extent deriv γ mean rule scr set result set depend order applic rule span choic defin deriv relat mean sequenc elementari step deriv scr set γ scr exist finit sequenc rule finit sequenc span finit sequenc partit pi partit span si addit restrict rule prefer order applic made order obtain independ step deriv order deriv result γ scr notic deriv context rule ambigu problem occur framework finit state calculu replac oper defin kaplan kai negat implicit zone make set result order elementari deriv step relat possibl studi definit properti stratif set contextu similar properti defin lloyd normal logic program illustr previou concept mean man recent father inform ad tagger previou stage analysi model set γ cr contextu rule cr appli γ span satisfi span satisfi span satisfi intern confer intellig text process comput linguist dan lectur note intellig artifici span satisfi span satisfi condit part rule cr satisfi span result applic rule cr γ obtain γ easi span satisfi span partit span satisfi rule remark explanatori claim rule rc adequ descript class rel proposit english worth notic similar rule includ system segment french text proposit show output system result satisfactori categori intend rule rc cover varieti case rel proposit man recent park father man john mari minut ago father recogn rule inform previou restrict system label denot textual organ inform rule state basi categori le de la station de recherch au sud qui se trait cancer du le de va par avion qui est à sur la base de de franc fig segment proposit french text structur natur natur languag analysi essenti segment text proposit figur show french text proposit retriev system rule present describ briefli rule rule label rel proposit state roughli text segment rel proposit start rel pronoun finit verbal unit end end sentenc condit zone satisfi zone text segment rel pronoun finit verbal unit text segment verbal unit end sentenc zone intern confer intellig text process comput linguist dan lectur note intellig artifici admiss part rel proposit text segment label verbal unit initi part proposit size equal empir adjust rule similar differ kind rel proposit set rule proposit corpu accid identif text mandatori stage system aim displai sequenc imag interpret text logic text analysi contextu rule previou work grammar system view deduct system point view wide categori grammar infer rule mimic grammar rule string transform deduct lexic categori input string rewrit context free rule infer rule rule deduct process set set start symbol set product rule deduct string relat reflex transit closur deriv relat product rule schabe paper principl implement deduct approach explicit input string posit atom formula logic develop logic contextu rule similar deduct system mention system infer rule condit consequ infer rule formula syntact metavari instanti term rule formula deduc obtain consequ infer rule finit number applic infer rule axiom formula deduc system axiom infer rule provid order defin logic definit goal relat control deduct engin intent obtain item deduc axiom infer rule defin goal view deduct clarifi detail process set framework discuss correct complet algorithm relat search strategi space deduct intern confer intellig text process comput linguist dan lectur note intellig artifici contextu rule present logic contextu rule method left scan input string left scan hand side grammar rule inact chart rule trigger rightmost symbol hand corner chart method context free grammar interest properti breadth search process categori exist ad chart logic inact chart contextu rule γ text length total set label token alphabet scr set contextu rule alphabet letter denot posit formula hold addit constraint explicit state greek letter denot substr hand side contextu capit letter denot element atom formula kind proposit atom formula schemata inact chart element categori cover posit input text intend mean γ scr α activ chart element rule scr dot signal scan posit index scan posit input text index initi scan posit intend mean exist span satisfi string β slash content axiom axiom element present input text axiom form inact item infer rule defin infer rule trigger contextu rule rightmost symbol process contextu rule gener inact item rule predict α α intern confer intellig text process comput linguist dan lectur note intellig artifici rule predict α α inact element label trigger rule rightmost symbol end sequenc case belong context complet rule symbol scan symbol left rule complet α α forward slash signal rightmost posit rewrit posit element label final deduc rule complet α α backward slash signal leftmost posit rewrit posit element label final deduc rule complet α α simpl left complet scan index modifi start exist element rule seek complet zone repres zone compil make explicit previou label rule label act cut zone zone rule set exclud previou label rule maximum size zone rule process zone rule complet α α intern confer intellig text process comput linguist dan lectur note intellig artifici rule complet α α set exclud cut label maximum size zone absenc cut label current text posit absenc label belong exclud proce scan zone maximum size string posit left side condit ensur arriv maximum size zone arriv begin input string rule activ inact rule creat inact item activ complet item dot begin hand inact item label label side span posit input string neg element neg inform deduc axiom infer rule form horn logic program negat understood failur prove posit inform infer failur prove condit deduct test system side condit rule simpli amount test exist inact element form rule neg element illustr behaviour infer rule present deduct rel proposit rule input sentenc rule realist give flavour intend system stand finit verbal verb finit finit past participl rel pronoun input sentenc man yesterdai intern confer intellig text process comput linguist dan lectur note intellig artifici father rise axiom grammat categori lexic unit shown figur repres axiom input token man yesterdai father fig axiom input sentenc man yesterdai father present deduct rel proposit yesterdai sentenc axiom predict complet complet complet complet activ inact predict complet predict intern confer intellig text process comput linguist dan lectur note intellig artifici deduct axiom infer rule grammar rule comput result success applic grammar rule found form inact element deduct step infer rule negat explicitli shown manag set chart method select suit manag inconsist negat zone contextu rule corner symbol rule trigger recognit recognit guid rule proce left categori text span length greater occurr label label appli posit text posit decid label problem relat negat grammar symbol context rule configur belong process symbol corner rule rule assumpt extent label rule process corner rule condit deduc rule longer valid order avoid kind inconsist restrict negat categori deduct includ rule empti context constraint defin section adequ search inform conclud extent text span chart element conclud negat search complet logic defin previou section commit search strategi deduct inact item deduc search strategi hold deduct inact item intern confer intellig text process comput linguist dan lectur note intellig artifici scr strategi produc consist previou section natur negat failur semant forbidden element zone label zone deduc rule empti context search strategi neg item present correspond order infer complet negat activ inact predict altern appli inact item index chosen deduct inact correctli comput zone present notic complet infer rule higher prioriti stage applic includ inact activ form complet item infer trigger deduct mention search strategi complet respect relat consist deriv text extent deduct process natur proce rule appli end infer element found form inact item parser contextu rule infer rule search strategi futur work present framework natur languag text main featur provid context condit rule applic text segment mean restrict form negat parser rule reli definit deduct extens present studi extens atom categori structur term order rule express power effici ambigu issu interest decid compet text segment fewer item subsequ rule process acknowledg author acknowledg contribut professor offer valuabl suggest stimul discuss work work develop support eco grant csic grant de la refer adam de passer du text à de informatiqu université intern confer intellig text process comput linguist dan lectur note intellig artifici ben design task identif complex pattern text filter pp automatiqu de text natur languag process industri pp canada la se form son sa dan le text work progress université de pari pari plan clark cormack algebra structur text search framework implement comput pp textual process contextu explor method context universidad feder rio de pp calcul du sen claud press universitair de pp garcia automatiqu de text pour causal de action du informatiqu phd université pari mellish natur languag process prolog hobb appelt israel cascad transduc extract inform text languag process ed schabe mit press hopcroft introduct automata theori languag comput usa la notion de pour le de phrase dun text natur languag process industri canada pp de la dan le text contribut au par informatiqu université kaplan kai regular model phonolog rule system comput linguist vol replac oper ed schabe mit press mathemat sentenc structur american mathemat monthli lloyd foundat logic program ben automatiqu par dan de text de la tsi categori logic linguist aspect calculu phd amsterdam pour pari du discour en peter lang interact de schabe pereira principl implement deduct mitsubishi research cambridg research center
DB/1062 3 algebra rewrit optim regular path queri grahn alex concordia abstract rewrit queri view power techniqu applic queri data data wareh queri rewrit relat investig framework semistructur data problem rewrit receiv attent paper focu extract inform algebra rewrit optim regular path queri case find complet exact rewrit queri set view inform inform partial introduc partial rewrit provid algorithm comput rewrit algebra algebra view definit comput rewrit fact make main memori product reduc secondari memori remot access give algorithm util partial lower partial possibl rewrit context queri optim introduct semistructur data structur natur model irregular captur relat data model kind data formal term label graph repres data found applic web inform xml data digit commun queri languag data provid possibl user queri regular express design queri languag regular path express base observ queri practic amount graph queri essenc graph pattern answer queri subgraph match pattern answer queri regular express ref find path point edg label number edg edg ref final edg label ullman widom base practic part answer queri semistructur data find graph pattern regular express regular express describ arbitrari long path mean turn arbitrari number physic access clear good optim answer regular path import optim broader class full fledg queri languag semistructur data semistructur data model relat object import util view recogn simpli problem queri set view fv find mean view answer queri basi paper investig problem case conjunct queri method base queri fact number liter minim rewrit bound number liter queri obviou method rewrit regular path queri requir techniqu rewrit regular regular express set regular express comput function approxim author method comput function approxim conwai base deriv regular express introduc provid ground develop algebra theori factor regular algebra turn tool comput approxim function method al automata base method comput rewrit queri method model full path path label spell word belong regular languag queri case infer view full path queri view cover partial path satisfactori long optim complet mention method give partial rewrit order inform provid view inform provid view partial complet problem partial rewrit touch briefli problem consid extens complet enrich set view elementari materi queri evalu choic elementari view materi brute forc cost criteria depend applic paper approach word regular languag queri view word view view evalu present gener queri answer algorithm access subpath algorithm view note materi consult outlin paper section formal problem queri rewrit view realist framework cach view discuss util algebra rewrit show realist complet rewrit empti partial inform provid view complet inform section introduc formal defin exhaust replac simpli languag result exhaust replac oper special word occur word occurr word word word subword section give theorem show result exhaust replac repres intersect ration transduct regular languag proof theorem construct algorithm comput exhaust replac oper section present partial possibl rewrit gener introduc exhaust replac oper section defin partial lower rewrit largest subset word partial possibl rewrit alphabet queri languag section review typic queri answer algorithm regular path queri show modifi algorithm util partial lower possibl rewrit comput complex studi section show algorithm comput partial possibl partial lower rewrit essenti optim background rewrit regular queri finit call alphabet element denot fv set view finit infinit regular languag call fv outer view alphabet set def substitut def associ view alphabet languag substitut def appli regular express usual queri finit infinit regular languag refer regular express repres languag write denot express maxim lower rewrit user queri languag includ word maxim possibl rewrit user queri languag includ word view sr semistructur edg label graph graph model typic semistructur node graph repres object edg repres attribut relationship object figur graph assum object object denot db pair set node set direct edg label symbol figur graph path label node node write queri db answer db defin db graph figur rewrit good scenario materi view relat cost compar cost access view depend applic assumpt valid rewrit answer user queri view investig case relat survei case al show obtain discuss inform integr applic present author show obtain profit inform integr graph unavail paper show run view graph produc subset desir run produc superset desir answer queri view easi empti depend section develop formal algebra framework partial rewrit framework flexibl easili tailor specif applic section demonstr usabl partial rewrit queri optim replac algebra oper section introduc studi algebra exhaust replac word languag languag symbol alphabet defin ae fw fwg set word alphabet defin ae ae defin power ae ae ae ae ae smallest integ ae ae set ae ae clear number symbol exhaust replac languag languag special symbol simpli defin ae exhaust replac replac word nonoverlap occurr word special symbol occurr word nonempti word subword union ae ae ae comput replac oper section present algorithm comput partial rewrit queri give construct proof basic algorithm comput result languag construct base finit transduc finit transduc consist finit set state input alphabet output alphabet start state set final state function ffi finit subset finit subset instanc mean transduc state read word state emit word word word output exist sequenc state transit write denot set output input word languag defin posit state theorem theorem regular languag alphabet exist finit transduc regular languag proof sketch nondeterminist finit automaton accept languag finit fs ffi fs written ffi ffi fg ffi transit set ffi transit automaton modifi produc output transit set leav symbol output transit set jump initi state state automaton reachabl step initi state transit give output transit fourth set handl special initi state final state reach step case replac symbol word accept special symbol transit set mean automaton transit final transduc addit transit final state transduc decid leav state suffix input string enter automaton return back prefix case replac subword input special symbol word finit transduc replac arbitrari occur word special symbol symbol figur replac transduc rst automaton accept languag figur drawn solid arrow ration transduc shown figur consist automaton transit produc output state addit transit drawn dash arrow simplic drawn output transit shown yu yu word transduct word replac arbitrari number word arbitrari exhaust replac word goal intersect languag regular languag serv word set candid replac occur insid word final result partial give natur gener definit replac oper case exhaust replac subword languag finit set languag finit set view word fm set languag fy set symbol alphabet defin ae fw fwg gener exhaust replac fm languag special symbol ae defin notion partial queri set fv view definit definit partial queri set fv view definit fv set special symbol gener theorem give result partial queri set fv view definit theorem partial effect comput proof sketch ffi nondeterminist finit automata accept languag finit fs ffi fs ffi ffi ffi ffi ffi transduc perform word replac nondeterminist word input special symbol proof claim similar previou theorem word replac arbitrari number word exhaust replac intersect languag regular languag serv mask extract word exhaust replac note partial queri gener substitut map regular view languag symbol substitut extens def substitut alphabet call def partial set word subword result def empti intersect conceptu similar partial observ chang mask result partial partial defin queri set view definit fv set word view substitut def queri languag spirit defin partial set word subword substitut extend def queri condit subword fact partial subset partial definit partial queri languag fu def give method comput partial algorithm comput complement queri construct transduc partial comput transduct complement queri comput complement previou transduct intersect complement mask denot result theorem languag partial proof set word def complement word substitut def condit word partial intersect mask word subword condit word partial prove direct contradict observ partial set subset partial word mask word word subword partial def mean mention word belong partial mask impli complement mask def def partial contradict queri optim partial rewrit view section show util partial rewrit queri optim scenario set precomput view materi view local cach result previou queri environ scenario view assum interest answer queri consult view access fv view alphabet fv set view definit edg label symbol defin view graph induc set ell edg straightforward exact def al case obtain exact rewrit queri view rare gener view part inform answer queri ignor partial inform previou section show partial inform captur algebra partial rewrit partial rewrit avoid complet minim access order util partial requir def test exact optim algorithm exact partial evalu queri access describ lazi review queri answer semistructur typic work algorithm regular express graph db construct automaton aq set node fs set state aq initi state node comput set reach initi reach repeat reach longer pair reach symbol transit aq edg add pair reach set reach final state aq modifi algorithm lazi algorithm answer queri partial respect set cach exact view algorithm automaton aq exact partial view graph set node fs state aq node comput set reach initi reach expand symbol aq transit initi state access add subgraph db induc repeat reach longer pair reach view symbol transit aq edg add pair reach expand set expand access add subgraph db induc edg origin set reach final state aq theorem queri set exact partial discuss util partial queri comput answer set algorithm case partial proper superset answer note contrari algorithm case partial exact theorem queri set exact partial pair valid discard view materi algorithm associ pair view graph deriv pair connect view ab start state final state fbg pair graph automaton db ab initi state final state fbg easi ab db ab automaton view readi formul algorithm partial queri answer algorithm comput algorithm execut algorithm view graph extend edg node call extend view graph replac edg label view object automaton ab deriv call graph set ab theorem queri set exact partial complex analysi theorem establish upper bound problem gener exhaust replac regular languag theorem gener exhaust replac regular languag languag exponenti time proof refer cost step construct proof theorem construct automaton languag construct transduc polynomi comput transduct regular languag polynomi order comput subset word replac exponenti intersect mask languag extend regular languag complement theorem alphabet regular languag problem decid empti pspace complet proof theorem appendix posit prove result theorem exist regular languag exhaust replac comput polynomi proof regular express alphabet test empti loss gener assum exist symbol restrict problem empti pspace imagin simpli tape symbol definit transit function ture machin symbol set denot special symbol substitut symbol regular express result regular express polynomi size polynomi time algorithm produc polynomi size polynomi construct check empti mean empti check corollari algorithm proof theorem comput partial queri set fv view essenti optim theorem queri set fv view comput partial proof refer construct proof theorem comput complement queri exponenti transduc polynomi complement exponenti total comput mask exptim intersect polynomi exptim partial lower rewrit theorem present algorithm comput partial queri set fv view essenti optim proof polynomi intersect partial optim comput doubli exponenti time algorithm essenti optim refer abiteboul queri semistructur data proc icdt pp buneman suciu data web relat semistructur data xml morgan hull vianu foundat widom wiener lorel queri languag semistructur data int digit librari pp buneman semistructur data proc pod pp fernandez suciu ad structur unstructur data proc icdt pp deriv regular express jacm pp equat regular finit sequenti network tc pp lenzerini vardi rewrit regular express regular path queri proc pod pp lenzerini vardi answer regular path queri view proc icd pp lenzerini vardi queri process regular path queri proc pod pp rewrit aggreg queri view proc pod pp conwai regular algebra finit machin chapman hall suciu queri languag xml comput network pp duschka genesereth answer queri view proc pod pp suciu optim regular path express graph schema proc icd pp suciu queri conjunct queri regular express proc pod pp grahn mendelzon tableau techniqu queri inform sourc global schema proc icdt pp grahn optim techniqu answer regular path queri proc webdb hopcroft ullman introduct automata comput hunt cover problem regular languag journal comput system scienc pp insert delet formal languag phd depart finland levi answer queri survei submit public srivastava answer queri view proc pod pp mendelzon find regular simpl path graph siam comp mihaila milo queri world wide web int digit librari pp milo suciu index structur path express proc pp vassalo queri rewrit semistructur data proc sigmod pp ullman inform integr logic view proc icdt pp vardi model logic independ ieee softwar yu languag handbook formal languag rozenberg springer verlag pp appendix theorem alphabet regular languag problem decid empti pspace complet proof observ problem problem test regular express pspace complet exist algorithm run polynomi space decid problem show problem languag decid ture machin run polynomi space constant reduct map input pair regular express explain denot alphabet consist symbol comput histori tape alphabet assum configur length pad blank symbol short moment organ configur tableau row tableau configur mark begin end marker organ window window legal window violat action transit function window legal configur correctli prove claim proof theorem top row tabl start configur window tabl row tabl configur legal encod set configur singl configur separ symbol shown figur describ set word illeg window regular express set configur sequenc illeg window extract set sequenc accept comput histori input assur illeg window start configur symbol accept condit regular express condit accept configur regular accept put regular express accept accept comput input finish proof size express polynomi
Agents/1063 1 agent inform integr bergamaschi cabri leonardi vincini zambonelli £ università di modena reggio emilia ¥ dsi modena bologna bologna abstract larg amount inform spread internet import resourc peopl introduc issu face dynam uncertainti heterogen sourc inform main technolog paper approach base mobil agent integr inform integr infrastructur mobil agent significantli improv design develop internet applic characterist autonomi adapt open distribut internet momi environ multipl inform infrastructur inform integr deal integr queri heterogen inform sourc xml aim paper show advantag introduct momi infrastructur intellig mobil softwar agent autonom manag coordin integr queri process heterogen data sourc introduct provid integr access multipl heterogen sourc challeng issu global inform system cooper compani equip data store system build inform system data relat heterogen substanti problem face field due structur applic lack common semant differ inform sourc semant differ kind rang simpl contradict sourc similar structur conflict repres complic factor respect convent view integr techniqu relat fact semant heterogen occur heterogen involv domain respect bergamaschi al function aspect inform meet requir inform import tool develop support activ scalabl face issu relat scalabl paper exploit mobil agent inform integr integr momi captur reason semant aspect schema descript heterogen inform sourc support integr queri optim mobil agent recent technolog significantli improv design develop internet applic characterist agenc featur permit exhibit high autonomi regard carri task proactiv react environ host mobil featur advantag wide environ internet mobil agent significantli save move local resourc carri code manag mobil agent deal network connect suit mobil comput system featur suitabl inform retriev area momi environ multipl inform infrastructur inform integr deal integr queri heterogen inform structur semistructur data momi support system semiautomat integr heterogen sourc schema xml semistructur carri integr semant approach descript cluster techniqu extend model repres extract integr refer describ sourc momi support design gener integr view sourc virtual express xml standard xml definit global virtual view momi infrastructur open integr inform system interchang xml data file show advantag introduct momi architectur intellig mobil softwar agent autonom manag coordin integr queri process heterogen data sourc outlin paper section present momi system architectur role mobil agent section momi approach data integr section present relat work final section report sketch futur work system architectur refer integr project momi inform integr base conceptu inform architectur figur system mobil agent inform integr common data defin describ sourc schema integr defin momi subset standard mediat languag develop work group introduc constructor support semant integr wrapper translat metadata descript sourc common translat global queri express queri languag queri express sourc languag export queri result data compon queri manag compon process integr descript receiv wrapper agent deriv integr inform sourc qm compon perform queri process optim start queri pose user global qm gener queri wrapper agent exploit queri mobil agent qm automat gener translat queri set sourc unifi global answer user integr design user applic user interact corba interact corba object gui user softwar tool global schema metadata repositori wrapper agent relat sourc creat queri agent wrapper agent xml sourc wrapper agent object sourc wordnet artemi servic level momi mediat wrapper agent gener sourc data level fig momi system architectur origin contribut momi relat avail set techniqu design face common problem integr preexist inform semistructur structur data momi capabl explicitli introduc kind knowledg integr design suppli domain knowledg common role share ontolog sourc built common thesauru set intra subset bergamaschi al describ knowledg class attribut sourc refer base identif class candid integr subsequ deriv global momi support inform integr creation integr view sourc virtual autom perform valid kind knowledg integr momi combin reason capabl descript logic cluster exploit common ontolog sourc construct lexic knowledg wordnet valid integr knowledg global virtual view express xml open integr system prototyp role agent agent main role sourc wrapper agent convert sourc inform react sourc qm exploit mobil agent carri retriev inform sourc integr mobil agent move site sourc resid agent check sourc type autonom instal driver convert sourc inform fix call wrapper left site presid sourc interact queri agent wrapper agent monitor occur data structur chang occur wrapper agent creat mobil agent move momi site inform updat global schema qm work user queri global gener set made singl sourc exploit queri move sourc site interact wrapper agent choic number queri agent determin analyz queri deleg search singl queri perform visit sourc start sourc reduc search continu visit sourc perform queri basi inform deleg queri sourc search perform concurr high parallel peculiar featur mobil agent exploit make momi search suitabl internet environ move local sourc queri agent permit significantli save transfer larg amount search comput perform local data resid momi queri sourc continu queri agent move sourc site connect perform local search connect unstabl return qm site connect fit mobil mobil devic host perman connect fix network infrastructur perform mobil agent inform integr fig fiat interact agent occur protocol comparison kind coordin internet applic base mobil approach gain ground base programm tupl space run compress fuel cod drive citi km highwai km cod fig order illustr momi approach integr car manufactur involv datasourc collect inform vehicl semistructur xml inform car italian car factori figur report figur relat inform kind car schemata built analyz web site factori integr process momi approach perform global virtual view articul bergamaschi al gener common thesauru common thesauru set terminolog describ intra knowledg class attribut sourc schema express intra knowledg form terminolog relationship hypernymi class attribut extract lexicon deriv relationship wordnet affin analysi class relationship common thesauru evalu level affin class intra inter sourc concept affin introduc formal kind relationship occur class integr point view affin class establish mean affin coeffici base class class structur relationship common thesauru cluster class class affin sourc group cluster hierarch cluster techniqu goal identifi class integr describ semant relat inform gener mediat schema unif affin cluster lead construct predict schema class defin repres class union attribut global schema analyz sourc class deriv basi pose queri sourc introduc gener common thesauru start lexicon relationship definit wordnet gener common thesauru common thesauru set terminolog describ intra knowledg class attribut sourc refer defin identif class candid integr subsequ deriv global common express knowledg form relationship relationship class attribut common thesauru construct increment process relationship ad relationship hold level relationship extract analyz schema separ rt relationship extract specif foreign kei relat sourc schema complex attribut object orient foreign kei primari kei mobil agent inform integr origin referenc relationship extract show relationship automat gener terminolog relationship hold schema level extract slim modul analyz sourc schema wordnet suppli ontolog sourc lexic relationship deriv net ratio syn relationship suppli directli captur specif domain knowledg sourc schemata vw model entiti consid special vehicl entiti relationship automat extract lexic structur suppli crucial relationship forc belong common thesauru gener global integr schema mean wrong relationship subsequ integr process produc wrong global schema system design detect wrong relationship perform relationship valid step valid base compat domain attribut complet descript refer common thesauru result show relationship control denot valid invalid consumpt rt km infer hold infer exploit infer capabl descript logic base tool develop modena reggio emilia examin domain system infer bergamaschi al relationship ad common thesauru consid subsequ phase construct global schema detail descript process terminolog relationship defin step hold level definit step design terminolog relationship bt nt class establish hold defin relationship specif impli insert relationship common thesauru enabl subsumpt comput infer consist check class global class map tabl start output cluster global class repres mediat view class cluster global class set global attribut map local attribut attribut local class belong global attribut obtain union attribut class belong fusion step redund elimin account relationship store common thesauru global class persist store map tabl column repres set local class belong cluster row repres global attribut final step integr process export global virtual view xml ad xml tag repres map tabl relationship xml definit global virtual view momi infrastructur open integr inform system interchang xml data file common thesauru translat xml momi share ontolog semant ontolog languag refer global class sourc class global attribut sourc sourc consumpt sourc sourc class detail descript map select tool assist design integr phase dynam local schema modif mobil agent inform integr modif occur local fiat dtd case local wrapper agent resid fiat sourc creat mobil agent momi site check permiss modifi global agent enabl directli perform integr phase common map schema modif notifi integr design action agent deleg integr integr design element insert em local wrapper agent vehicl global class map perform queri manag agent user applic interact momi queri global virtual view languag phase perform qm compon gener queri wrapper start global queri formul user global schema descript logic qm compon gener automat translat gener queri involv local sourc queri agent mobil agent charg bring data sourc site interact local wrapper agent carri report data result qm achiev global qm merg local result unifi data set process involv solut redund reconcili due incomplet overlap inform local object fusion global virtual view build previou section car price power level present obtain select vehicl vehicl process global queri individu local class queri reformul process defin local queri express sql xqueri bergamaschi al select return process execut parallel queri agent move local sourc perform queri agent return data result momi qm fuse obtain final result fusion obtain join power autonom class queri fusion data deriv local sourc data process move local system minim data transfer perform provid queri agent local servic queri obtain intermedi queri agent perform fusion local site servic queri local queri languag select distinct return servic queri execut queri agent local sourc data result exchang agent singl sourc intermedi data set join local queri obtain fuse result join attribut extract map tabl queri agent select distinct select distinct union result obtain shown data transfer amount momi central site drastic request data move agent mobil agent inform integr shown effect relat advantag exploit agent infrastructur coordin data retriev manag relat work approach area inform integr signif mcc project system inform gather analysi task perform network autonom inform sourc kei motiv infosleuth system real inform gather applic requir monitor integr inform level abstract infosleuth agent enabl integr technolog extract semant concept autonom inform registr integr semant annot inform tempor inform identif trend sourc inform network experi retsina infrastructur inform retriev descript languag defin realiz agent matchmak process syntact semant signatur constraint match differ infosleuth retsina advantag mobil featur fundament dynam uncertain environ internet area heterogen inform project base mediat architectur develop tsimmi project approach model repres heterogen data msl specif enforc sourc integr pattern match techniqu perform predefin set queri base queri templat differ momi mi predefin queri execut sourc modif manual mediat rule rewrit perform garlic project build complex wrapper architectur describ local sourc oo languag definit garlic complex object manual unifi local sourc defin global schema sim project creat global schema definit exploit descript logic loom describ inform sourc global schema garlic sim project support user queri schema predefin subset inform manifold system sourc independ queri independ mediat input schema inform manifold set descript sourc system creat plan answer queri underli sourc descript algorithm decid inform sourc gener queri plan implement integr schema defin manual approach bergamaschi al infomast integr access multipl distribut inform sourc give homogen inform system base global complet model core system dynam determin effici plan answer queri translat rule harmon heterogen sourc main differ project wrt momi lack tool design integr process futur work paper present system inform integr improv exploit mobil agent agent manag open dynam scenario spread chang uncontrol mobil featur permit overcom limit tradit approach distribut system regard futur sketch research direct relat dynam integr inform sourc sourc ad momi system restart aim sourc integr possibl exploit mobil agent search interest sourc check request administr integr sourc permit face high dynam internet evalu compon system model advantag mobil featur fact compon mobil permit deploi system flexibl adapt area worth explor interact occur wai languag complex languag knowledg exchang mobil agent promot adopt simpl uncoupl coordin protocol refer cy knoblock retriev integr data multipl inform sourc intern journal intellig cooper inform hsu queri process sim inform mediat advanc plan navath analysi methodolog schema integr acm comput tool intellig integr inform intern confer system scienc januari mobil agent inform integr vincini inform momi project demonstr amr el michael sharma gunter vldb intern confer larg data septemb page morgan vincini tool semant queri optim oodb int confer data engin vincini semant integr heterogen inform sourc journal data knowledg vincini semant integr semistructur structur data sourc sigmod march ullman mediat languag april zambonelli agent inform issu mobil coordin journal system decemb zambonelli programm coordin architectur mobil agent ieee internet zambonelli coordin model internet applic ieee februari zambonelli xml dataspac coordin internet agent appli artifici januari mj lm pm wf aw jh el wimmer object exchang heterogen inform sourc technic stanford editor object odmg morgan kaufmann san queri languag xml work draft februari feb garcia widom tsimmi integr heterogen inform sourc ipsj daml joint daml project van klein oil nutshel european knowledg acquisit confer lectur note artifici intellig tim yanni jame mayfield kqml agent commun languag jeffrei softwar chapter page aaai press mit semant infosleuth sigmod duschka inform integr system acm sigmod eurowordnet multilingu semant proc spring symposium text speech bergamaschi al hull king al arpa refer nichola jen michael editor agent market karnik anand tripathi design issu program system ieee ordil queri heterogen inform sourc sourc descript proc vldb page vldb larg data deal semant heterogen vldb int page ag miller lexic english commun object fusion mediat system vldb int septemb unruh inform aggreg agent interact pattern fourth intern confer cooper inform mt roth scrap wrap wrapper architectur legaci data sourc proc int conf larg inform manag adapt collabor intellig agent intellig inform page klusch ed lu dynam servic matchmak agent open inform environ sigmod march
ML/1064 6 protein structur predict evolutionari algorithm intellig comput system centr univ west england unit kingdom william hart sandia nation laboratori po box nm jim smith intellig comput system centr univ west england unit kingdom david dept de ciencia de la artifici universidad de granada abstract evolutionari algorithm successfulli appli varieti molecular structur predict problem paper reconsid design genet algorithm appli simpl protein structur predict problem analysi consid impact algorithm factor conform energi formul conform penal empir evalu impact factor small set sequenc analysi lead specif recommend ga heurist method solv hp model introduct protein chain amino acid residu fold specif nativ tertiari structur physiolog condit protein structur determin biolog function method solv protein structur predict problem valuabl tool modern molecular biologi exhaust search protein conform space feasibl algorithm strategi small protein sequenc recent comput shown problem intract simpl lattic model heurist optim method reason algorithm choic solv problem evolutionari method varieti research articl examin basic design principl guid prior work ga problem hp model focu simpl lattic model lattic model captur global aspect protein design test problem conform structur small protein problem hp model good test problem evalu ga complex understood lot prior work develop heurist global optim method problem basic algorithm factor affect ga appli problem evalu commonli problem describ oper search domain method formul energi potenti hp model make energi potenti continu preserv integ rank order conform search domain describ penalti method safe enforc constraint hp protein fold model studi simpl protein model model dill hp model abstract interact process protein fold reduc protein repres predetermin pattern amino acid classifi polar amino acid classifi sequenc pg repres amino acid repres amino acid hp model restrict space conform path lattic vertic label amino acid energi potenti hp model reflect fact amino acid form core captur featur protein hp model add ffl pair form topolog topolog contact form pair amino acid adjac lattic consecut sequenc ffl typic figur show sequenc squar contact highlight dot line conform figur energi conform figur energi figur hp sequenc squar lattic triangular lattic method hp model simplic hp power captur varieti properti actual protein problem hp model shown squar lattic cubic lattic perform approxim algorithm develop varieti lattic model hart wide varieti global optim techniqu appli paper al ga proven robust effect global optim techniqu sequenc lattic repres number wai common method cartesian coordin locat acid lattic intern coordin protein sequenc move lattic acid distanc matrix acid locat infer acid earli applic ga ga intern coordin absolut direct squar cubic lattic individu code sequenc bg correspond forward backward move cubic length ga consid feasibl conform path lattic mutat crossov ga iter feasibl conform gener al describ standard ga significantli outperform ga emploi intern coordin rel offset current method ga search feasibl conform standard form rel offset repres conform sequenc dg case direct interpret rel direct previou rel ax defin lattic advantag solut avoid move author penalti method enforc constraint object function add penalti amino acid lie posit lattic amino acid li posit amino acid add contact potenti energi consid perform goldberg simpl genet algorithm intern coordin absolut move object function defin hybrid random energi model hp model includ penalti penalti lattic site amino acid penalti lattic site al empir evalu mix evolutionari oper solv problem hp model experi evalu ga appli oper combin probabl result strongli suggest point crossov transfer build block act power local search instanc combin paramet small crossov probabl high mutat probabl algorithm design section critiqu algorithm factor impact perform gener applic ga energi method constraint conform encod intern coordin work lattic protein repres intern coordin compar studi evalu absolut rel al effect prior research select encod explicit numer comparison algorithm paramet chosen difficult assess impact choic encod ga perform section illustr fit landscap induc encod standard genet oper import differ affect global search behavior ga discuss consid squar extens discret lattic straightforward mutat rel encod effect mutat structur figur rel encod rel view amino acid point mutat sixth posit produc rel rel shown figur figur point mutat structur sixth gene mutat produc lever effect mutat produc lever effect point mutat rel encod produc rotat effect structur mutat point produc effect absolut encod perform gene simultan mutat produc chang structur defin rotat oper absolut encod point produc remain gene chang map depend angl rotat work figur encod ab mutat structur ab figur ab mutat absolut encod mutat absolut encod leav orient rest structur unchang achiev effect rel chang subsequ valu encod restrict map mutat absolut encod mutat rel encod point mutat absolut encod produc structur rel encod potenti energi formul figur illustr conform sequenc form domain connect chain hp model reward direct compact contribut energi conform clear figur closer form optim conform figur figur conform equal energi hp model figur lower energi modifi hp model type dispar energi conform remedi augment energi function potenti distanc amino acid form countabl construct potenti preserv rank order conform hp model enabl finer level distinct conform number contact ij distanc rotat amino acid eh ij ae ij ij nh ij nh equal number squar lattic triangular cubic lattic constraint manag broad class constraint enforc defin feasibl connect chain conform strongest motiv intern coordin handl constraint explicitli cartesian coordin basic approach manag constraint intern coordin search constrain conform method suit shortest path compact feasibl conform long compar shortest path space conform figur hp sequenc move conform conform gener sequenc feasibl conform perform move larger approach enforc constraint penalti guid ga feasibl solut penalti method solv hp model penalti ad pair amino acid lie lattic point penalti penalti ad lattic point amino acid penalti al extend prevent amino acid contribut object function lie lattic point amino acid figur compact conform move evalu penalti import correctli bia search strategi feasibl region ga discuss section penalti method appli fix constant penalti term violat polici problem penalti method appli extens al fix valu construct exampl structur optim energi penalti method correspond optim energi hp model import efficaci penalti method understand facilit optim extend formul al lead effect search method amino acid prevent contribut object function fit landscap larg flat make optim problem difficult recommend fix penalti approach adapt base number protein nh idea select suffici larg ensur valid constraint formul squar lattic penalti larg conform posit energi feasibl conform energi optim conform hp model strictli penal conform method result ga experi select mutat appli structur probabl mutat chang absolut mutat chang consecut valu rel encod uniform crossov oper probabl run ga consist gener comparison encod modifi energi potenti pair amino acid map lattic posit penal constant depend length instanc sequenc short length instanc found rel absolut encod order evalu effect encod abil ga find low energi seri experi run ga find optim configur number protein encod perform metric fit individu final gener run order distinguish effect encod choic lattic experi run squar triangular lattic squar lattic protein instanc differ length difficulti chosen lattic type lattic separ experi run uniform crossov mutat oper phenotyp effect encod twenti run combin figur summar result experi combin crossov protein comput rank trial experi absolut rel encod protein conform maximum rank trial experi pair figur show rel rank final result lattic maxim rank method plot rel encod good squar lattic ab rel ab rel ab rel rank test case figur distribut rel rank rel absolut encod cubic triangular lattic tabl result comput valu test null hypothesi fit encod tabl rel absolut encod squar cubic lattic confid level robust rel encod degrad triangular lattic suspect import consequ lat uni uni uni tabl summari denot denot encod denot standard distanc energi set experi elucid modifi energi potenti improv search capabl ga lattic instanc previou section crossov run simul crossov trial assign instanc lattic crossov test result experi show substanti impact modifi energi potenti test problem comput valu test null hypothesi final protein configur energi potenti found energi potenti perform instanc crossov triangular lattic slight effect instanc triangular cubic differ discuss paper directli compar encod intern coordin mean rel absolut move shown search space induc rel absolut encod map mutat absolut rel encod genet modifi energi potenti facilit ga search preserv rank standard hp model identifi weak standard constraint manag strategi constraint method ensur feasibl optim solut algorithm issu explor common lattic squar lattic triangular lattic result support rel encod explain superior perform ga al compar ga argu intern coordin standard crossov fail transfer build block work studi direct comparison rel absolut encod altern base intern coordin research heurist hill result support rel encod absolut modifi energi potenti provid improv optim perform suspect longer protein differ formul clear modifi energi formul import effect hybrid ga local search method modifi energi exist larg energi landscap local search find descent direct effect perform random search acknowledg universidad de la de ciencia departamento de informatica david support project program european work support part sandia nation multiprogram laboratori oper sandia martin unit state depart energi contract refer berger protein fold model npcomplet comp editor optim applic part molecular structur volum volum mathemat applic yannakaki complex protein fold comp dill theori fold stabil protein chan principl protein perspect simpl exact model prot hart lattic side chain model protein linear time structur predict optim comp protein structur predict hard optim genet algorithm approach molecular volum page de la genet algorithm protein fold critic view engin intellig system icsc academ editor global minim nonconvex energi molecular conform protein volum dimac seri discret mathemat theoret comput scienc american mathemat rhode goldman standard ga approach nativ protein conform predict proc intl conf genet page morgan applic evolutionari algorithm protein fold predict improv genet algorithm protein fold problem cartesian combin oper protein genet algorithm protein fold simul proc intl conf genet page morgan genet algorithm protein fold simul journal molecular
DB/1065 3 explor tempor object bp bp grenobl cedex abstract complementari famili task identifi data data analysi data involv extens explor subset navig interact techniqu classic object browser provid mean navig collect object object relationship tempor object techniqu suffici adequ support studi snapshot collect object detect tempor attribut relationship visual data analysi dedic extract valuabl knowledg exploit human visual percept capabl tempor exampl data analysi task includ observ layout detect regular compar evolut valu histori identifi task relat tempor visual techniqu address dedic tempor object orient analysi quantit histori techniqu shown satisfi ergonom properti tempor object data visual techniqu introduct effect assist exploit larg user profil open challeng domain human comput interact address issu design visual explor techniqu maxim amount readabl inform perceiv satisfi basic ergonom properti interact softwar main task perform user identifi context schema queri analysi queri output kind visual interfac design provid commerci schema browser visual queri data visual tool data visual tool data browser reli simpl interact metaphor tabl form visual data analysi reli sophist interact metaphor dedic knowledg extract applic domain data browser visual data analysi tool tempor object track evolut object state relationship tool design list user task ergonom properti tempor object tempor object defin schema includ tempor class properti class tempor properti tempor properti denot evolut object characterist period time tempor properti call histori sake defin histori collect data wai repres histori struct date date struct supervisor interv struct interv struct long date struct float interv struct interv struct interv class kei attribut string attribut attribut attribut class kei attribut string attribut class worker extend attribut class supervisor extend attribut figur odmg schema tempor figur present schema tempor paper track evolut product supervisor worker assembl line factori track evolut salari factori worker histori assembl line assign class schema tempor histori properti repres collect properti repres interv histori observ granular dai address task tempor time orthogon compon object data visual tool support navig task specif address explor snapshot set relat tempor object fix point time analyz quantit histori histori goal detect regular trend evolut support interact visual techniqu call tempor object basic idea techniqu displai snapshot tempor object instant user interact navig object relationship classic object browser modifi refer instant result interfac stress simultan instant time support explor provid interact devic instant chang occur visual path express support develop techniqu mine concentr trend histori concentr consist set circl radii common center circl repres period visual histori data item repres graphic object size convei valu techniqu user identifi period pattern retriev correl synchron valu quantit histori line repres evolut histori period techniqu user identifi hot observ layout histori detect period pattern ergonom properti ergonom properti featur interfac chosen subject analysi evalu ergonom properti necessarili good bad simpli serv defin absolut design space prune design possibl visual techniqu design fulfil ergonom properti properti extens discuss interfac flexibl render state element interfac system track evolut temperatur room time support altern evolut thermomet exact instant graph import detect articul input output express refer previou past copi command typic exampl user free decid action perform system user inspect inform relev task relev inform necessarili case user notic interfac ensur critic inform perceiv user interfac user correctli interpret graphic object symbol screen transit state interfac differ state easili perceiv spatial gap relat graphic object convei perceiv object strict adher properti main origin work respect relat paper structur rest paper structur section present tempor techniqu section describ concentr circl agenda techniqu discuss techniqu address task fulfil ergonom properti compar techniqu exist section draw section tempor object overview browser interfac figur made window tree snapshot window snapshot window displai snapshot tempor object instant instant respect object snapshot determin object tempor tempor properti window subsequ call refer instant refer instant constrain resid interv call tempor rang worker chang instant main snapshot window window exit year granular slider month dai main slider supervisor supervisor product worker refer instant snapshot window snapshot window visual path figur tempor object browser schema underli figur properti tempor window role window fix refer instant begin refer instant middl tempor rang posit vari user interact slider button window simplest window slider main button end slider button simpl user move refer instant forward backward unit pair button move refer instant instant navig path visual instant visual path call chang instant chang instant visual repres vertic mark ly horizont line beneath main slider figur chang instant supervisor worker chang due fact worker assign assembl line assembl line supervisor previou fact supervisor assembl line worker assign addit main window granular user move refer instant calendar refer instant user specifi calendar figur granular slider move refer instant step step step dai limit snapshot window snapshot window structur form line properti visual object object line left label label refer properti refer instant tempor properti instant equal histori defin instant histori repres collect equal object collect timestamp equal object null instant histori repres collect equal object collect timestamp instant object null button snapshot window denot liter valu figur button snapshot window begin singl snapshot window snapshot window increment ad tree user interact clickabl button denot object refer exist form object displai snapshot window main equal object referenc button window open configur shown figur obtain displai worker success click button label supervisor user click button label properti button left column semant interact select properti visual path express set attach window updat click button label product window figur set visual path vertic mark drawn line main label corner window modifi time restrict exampl snapshot window displai singl object object snapshot discuss collect accommod properti printabl type class label user modifi refer refer instant notifi main snapshot window receiv main window comput snapshot refer object updat reflect snapshot tempor properti transmit depend window main window propag notif refer instant depend process carri figur show result modifi refer instant figur window worker exit window supervisor supervisor coutaz product worker year month dai window figur modif refer instant configur figur tempor rang state refer instant rang interv call tempor rang order fulfil observ ergonom properti section rang smallest interv instant tempor properti object displai main snapshot window call main defin main object worker assembl tempor rang interv notic definit entail main object rang empti presenc properti implicitli assum properti displai snapshot window valu properti snapshot window properti refer instant set updat occur properti tempor histori tempor properti defin refer case null situat occur middl tempor rang includ instant tempor properti main object defin visual denot null fill rectangl solv problem null worker displai figur assign assembl line element histori timestamp refer instant set properti depend form window figur modif refer properti displai snapshot window properti snapshot window attach window stem properti inact inact snapshot window visual render hide window activ modifi element grai label denot properti label denot properti valu label restor window activ figur illustr approach approach hide window violat screen stabil ergonom properti section window worker exit window supervisor product worker year month dai window figur modif refer instant configur figur window inact result interact collect tempor object accommod augment browser concept synchron navig defin object browser collect tempor object displai singl snapshot window coupl button top window displai snapshot refer object collect click arrow switch previou object collect figur worker worker exit supervisor product supervisor worker duma exit configur supervisor product supervisor worker configur figur collect tempor object configur result click arrow main snapshot window configur tempor rang defin respect object visual main snapshot window object rang recomput reason transit configur configur figur notic chang instant recomput circumst comput involv larg amount data figur visual path express mean path comput chang instant involv histori assembl line histori supervisor line visual work histori supervisor histori referenc previou item order ensur accept time transit object good histori join algorithm involv histori cluster disk studi issu interest perspect work report state tempor object browser orthogon navig dimens object collect button top snapshot window denot collect object relationship clickabl button column snapshot snapshot window denot singl object collect object time dimens compon window respect browser address task analyz data supervisor worker assembl line date compar respect supervisor assembl line assign find composit assembl line supervisor implement note prototyp techniqu tempo extens odmg standard featur set type model tempor valu addit extens oql tempo implement top dbm librari class preprocessor widespread approach area interact prototyp structur function kernel data metadata present modul gener user control bridg compon current version gener present modul carri toolkit base provid rich set graphic object choic toolkit guid adequaci design window techniqu quantit histori visual section focu visual quantit histori valu number histori correspond tempor properti histori daili product assembl output tempor queri possibl involv data aggreg histori monthli product assembl daili total product assembl describ interact visual techniqu kind call agenda concentr circl benefit techniqu list justifi design choic ergonom properti section techniqu orient retriev period evolut concentr similar valu task identifi requir analysi phase applic involv survei activ displac individu ski resort dai scope kind quantit data involv applic domain economi clinic data detect trend earli stage lead effect agenda interfac agenda techniqu consist matrix color cell cell color intens fulfil observ properti order fulfil honesti intens cell reflect visual histori higher intens correspond higher valu exact cell displai place cursor top shown figur cell group row partit tempor domain visual histori partit determin granular granular visual histori partit carri respect granular line consist twelv cell month year agenda techniqu appli involv granular mutual month visual area perfect line longer granular involv granular visual granular user bar slider navig navig row figur bar slider column horizont complet month year present granular mutual regular function integ select cancel zoom jan feb mar apr jun jul aug sep oct nov dec posit figur visual monthli product assembl line agenda techniqu screen bar slider row vertic complet fill mean tempor domain visual histori extend deduc figur tempor domain visual histori end septemb cell novemb decemb year mark mean denot null valu notic time slider involv agenda techniqu slightli involv browser role time slider fix point time refer agenda time slider fix interv time time window displai addit navig agenda interfac support kind user interact user select subspac visual order visual techniqu click button label select control draw arbitrari contour matrix unlik exist interfac offer similar subspac select contour shape contour dialog box open assist user techniqu emploi visual select cell properti user scale factor click zoom panel smaller rate smaller numer squar agenda agenda techniqu orient user observ data layout identifi gener assembl product histori displai figur product volum higher recent year retriev period agenda figur product assembl line decemb higher product volum attain juli time detect similar figur show high valu juli august year interest note agenda user perceiv data continu space spatial continu properti gap cell big act cell user feel discontinu space depict figur select data subspac easier intuit perform concentr circl jan feb mar apr jun jul aug sep oct nov dec jan feb mar apr jun jul aug sep oct nov dec jan feb mar apr jun jul aug sep oct nov dec figur histogram describ concentr circl techniqu compar techniqu visual serial period data spiral techniqu depict figur concentr circl techniqu design visual quantit histori interfac essenti consist set concentr denot evolut visual period time histori valu denot rectangl figur visual monthli product assembl line spiral techniqu adjac circl height rectangl intens proport quantiti denot insist circl arrang reflect time order data address identifi gener navig data identifi correl evolut compar valu period time observ data layout identifi gener trend spiral user data space spiral observ data user directli observ evolut data period year period figur product attain januari tend higher rest volum low june decemb navig data space output tempor queri constitut huge space explor time axi spiral time axi continu fix origin size spiral proport number period clear larg number period spiral due limit screen space face problem number circl correspond number period address interfac ident agenda techniqu displai circl correspond period fall novemb octob septemb decemb august januari juli februari june march april work area place circl move order compar data evolut figur visual monthli product assembl line concentr circl techniqu time interv defin slider graphic time axi set spiral data item repres fill circl proport valu reach limit larg number element circl data item repres polygon width comput number element circl honesti properti satisfi correl evolut histori user frequent rapidli interact retriev correl variabl evolut time order address support visual quantit histori time histori repres repres rectangl color orient opposit direct figur rectangl denot valu histori orient valu histori orient center straightforward evolut product volum assembl line tend evolv assembl line histori tempor domain correl tempor domain instant common result time axi union tempor domain histori miss data valu repres grai novemb octob septemb decemb august januari februari june march april novemb octob septemb decemb august januari juli februari figur visual monthli product assembl line concentr circl techniqu distinguish data valu equal compar evolut histori period time possibl locat visual figur left figur difficult compar data item posit screen interfac visual area locat left figur refer circl order time locat figur work enabl user place select circl arbitrari order user copi circl left area drag figur user copi period arbitrari order final notic facil straightforwardli integr spiral constitut singl graphic object put circl close facilit comparison data valu belong period ratio height rectangl denot depend radiu circl place circl reduc effect user compar valu easili observ area figur detect product assembl line exhibit similar valu month conclud interest note applic data june march april repres econom develop set countri fix includ foreign trade circl correspond countri radiu denot observ variabl implement note develop concentr circl agenda techniqu basi reusabl java softwar compon implement javabean implement requir line sourc code agenda line sourc code adopt architectur separ data extract interfac implement techniqu independ underli dbm relat work tempor data data visual receiv attent tempor research notabl except remark specifi interfac tempor relat tempor relat repres sequenc displai tabl denot snapshot relat interfac interact devic limit record relat navig time dimens set inform techniqu graphic displai tempor data consid techniqu orient quantit time period seri numer data item adapt concept develop work design interfac visual legal medic person record involv tempor data histori text complex object tempor object browser extens data browser super extent techniqu navig collect base concept synchron navig refin browser differ treat time dimens se browser account impact properti synchron issu complet neglect visual queri languag tempor discuss function address scope present paper quantit histori visual distinguish categori quantit histori visual techniqu depend mode elementari data item categori data valu map graphic object drawn space data valu easili distinguish user easili compar element mode exploratori data analysi visual data mine tool statist mode reach limit displai huge amount data techniqu augment data space deform categori made techniqu data map pixel color intens huge amount data repres limit screen area disadvantag techniqu user compar global data space conclud depend user mode data adequ aim provid intuit visual tool detect period techniqu develop belong categori futur work paper visual techniqu famili task interact exploit tempor queri data data analysi interact techniqu explor tempor object techniqu orthogon support type navig navig object navig element collect present interact techniqu dedic analysi quantit histori techniqu address task retriev regular period detect evolut retriev concentr similar valu fall interact data mine domain complementari comput data mine techniqu tool intend conjunct mathemat statist algorithm oper tempor order ensur techniqu design set establish ergonom properti carri evalu measur abil assist user fulfil valid refin design choic user test softwar carri earli stage system life part iter design process data tempor reflect evolut model realiti time data rollback timestamp data respect model realiti lead limit studi tempor manag singl time dimens extend constitut challeng research avenu research intend extend applic scope area long aim design techniqu interact data mine identifi constraint characterist data associ time establish list task manipul refer sander order point identifi cluster structur acm sigmod int conf manag kriegel visual interact approach tree construct acm sigkdd int confer knowledg discoveri data mine graphic graphic inform process walter de visual queri system journal visual languag june william integr object proc int confer larg august interact visual serial period data proc acm confer user interfac softwar technolog san spaccapietra visual interfac object relationship data model journal visual languag explor easi web proc acm sigmod int confer manag wa june nh hv srinivasan queri graphic interfac journal visual languag appli tempor geograph data analysi proc dexa workshop data model languag ieee comput septemb scholl independ tempor extens object queri languag act de base de page shneiderman geograph categor aggreg view coordin case studi highwai incid data technic report decemb catarci visual queri oper tempor proc int workshop tempor reason gram design principl interact softwar st jensen dyreson consensu glossari tempor concept februari version springer lnc keim visual techniqu explor invit tutori int confer knowledg discoveri newport object orient browser proc int confer expert virginia april benjamin cum card perspect detail context smoothli integr design method interact techniqu larg inform space proc int confer advanc visual interfac acm press jc build user interfac stori morgan schneiderman visual person histori proc acm chi april visual environ queri manipul tempor applic technic report sarkar brown graphic view graph proc comput human interact confer shahar cheng intellig visual explor clinic data technic report tr stanford tuft visual displai quantit inform graphic
Agents/1066 1 layer approach agent tool job ronald dept electron comput scienc southampton uk abstract clear agent technolog wide technolog open environ depend provis infrastructur support rapid develop applic argu element requir develop infrastructur span great overlap middlewar mobil agent intellig agent research contribut make holist approach infrastructur make clear distinct requir level explain integr provid clearer focu exist technolog view requir infrastructur support system form experi develop agent implement environ base formal agent framework argu order provid support infrastructur address conceptu concern relat type relationship agent entiti technic concern paper describ gener requir specif contribut effort progress introduct applic develop support provis infrastructur typic address import issu element design abstract gener infrastructur determin framework set concept applic design manipul element construct ultim aim make develop applic underli function provid applic design focu specif problem worri subsidiari detail network commun protocol comput platform michael luck dept electron comput scienc southampton uk develop infrastructur system challeng due larg spectrum issu research address inher interdisciplinari approach agent includ area distribut econom distribut artifici make hard provid solut critic issu gener form part support issu left open infrastructur support network commun inadequ substanti infrastructur forc develop plan overli specif constrain attempt retain import lose sight fact specif aim infrastructur support gener distribut system suggest agent infrastructur touch issu structur individu agent interact issu suggest layer approach agent infrastructur servic rang middlewar level intellig agent level paper offer analysi requir infrastructur support develop oper inform experi develop agent implement environ base conceptu agent framework begin ground discuss short descript environ applic system identifi relev area research contribut task build import close relat area middlewar mobil agent intellig agent address import albeit infrastructur system describ relationship field attempt identifi requir level complet approach system infrastructur move outlin initi effort attempt realiz set requir develop agent implement environ conceptu technic tool review relat work suggest wai proce heterogen environ rang devic access network diversifi coupl number user access creat approach distribut comput recent methodolog tool develop distribut applic call abstract locat assumpt made reliabl perform forc account physic virtual boundari due latenc inform due partit network network ownership solut deal constant chang due fluctuat natur organiz replac compon underli infrastructur limit infrastructur salient characterist environ consid attempt develop practic agent system emerg comput environ devic access inform servic vari greatli capabl end power desktop comput typic network end mobil devic limit comput poor displai capabl uncertain network support host devic occupi point multitud oper environ network access protocol mobil user chang geograph ten chang servic problem secur devic support infrastructur continu chang upgrad effort offer support capabl mobil devic support mobil mean applic provid consist method access inform servic user geograph posit oper platform access servic entail agent migrat desktop comput servic provid order continu offer support user term effici comput power bandwidth agent migrat power platform order perform demand task return devic result main challeng provid support agent applic extrem heterogen environ find effect mean enabl agent adapt environ adapt behaviour execut mechan base comput channel commun user entiti environ network displai reconfigur agent enhanc oper capabl base user upgrad devic agent adapt improv addit remov characterist relat adopt creation goal achiev wai achiev goal autonom agent kitchen applianc modifi deal devic kitchen ad goal reason negoti autonomi intellig agent societ aspect commun coordin resourc control secur code state captur locat bind mobil agent mobil code middlewar network protocol secur reflect access discoveri figur aspect agent infrastructur plan achiev capabl specif applianc control interact person assist agent resid desktop comput reduc normal set action minim set essenti order migrat mobil pda retain inform relat user relev import inform agent infrastructur support effort provid develop oper support kind environ discuss larg develop distinct overlap middlewar technolog aim address issu network account heterogen environ mobil agent system research aim move integr heterogen develop agent migrat remot resourc mobil agent made import contribut term effici code mobil mechan resourc discoveri mechan intellig agent research concern develop mechan intern reason behaviour agent enabl deal effect complex task field close view relationship illustr venn diagram figur diagram illustr locat origin aspect agent infrastructur support relat field imposs arriv seek contribut middlewar mobil agent research address issu code mobil dynam resourc discoveri mobil agent intellig agent research touch common ground term attempt offer aspect behaviour avenu achiev typic turn middlewar middlewar softwar layer resid underli host network oper system applic layer provid common set program interfac develop creat distribut system ware wide ¢ ject manag develop attempt provid answer problem heterogen distribut system corba design static object address dynam distribut system technolog emerg aim specif network central support system breed middlewar technolog similar concept wai implement vari wide main competitor jini common approach defin discoveri registr protocol dynam discoveri registri act yellow registr servic announc protocol defin servic join network differ lie focu jini direct invoc servic underli remot method invoc vendor specif protocol clear direct invoc mechan automat configur devic network dynam host configur protocol work requir infrastructur system transfer middlewar level relat system level facil aspect descript mechan system depend suitabl mechan provid descript environ entiti environ middlewar provid mechan describ system compon system metadata level middlewar independ actual middlewar softwar enabl distribut order provid descript jini servic registr bound servic descript schema type set java object retriev descript costli underli remot method invoc reflect mechan argu level descript fine grain system view requir easier mechan retriev inform note middlewar system benefit integr markup languag xml standard provid possibl manipul data semant level agent manag creat robust distribut power manag mechan requir system administ mechan control access registri servic vital compon level desir secur perspect denial servic attack achiev simpli registri agent commun support level agent underli transport mechan agreement type languag middlewar robust protocol requir enabl entiti exchang messag actual implement vari order cater type network access mechan devic agent authent author mobil involv larg number secur risk distribut mechan requir ensur agent properli authent suitabl author perform requir action clear implement secur mechan middlewar mention make plug product secur packag tight difficult provid reliabl solut agent coordin work provid support system tupl space incorpor coordin rule mar base javaspac jini servic distribut mobil agent code mobil enabl technolog middlewar regard abil reloc code disengag set bind transfer locat resum oper mobil agent join tradit mobil code concept agent concept autonomi tradit migrat made extern code eventu mobil agent migrat mobil code unit eventu migrat written merit mobil agent import advantag local high adapt natur repres mobil issu agent mobil import issu facilit infrastructur type environ requir mobil typic mobil code system requir higher level autonomi benefici mobil agent facil level part infrastructur support system mobil agent secur requir special place secur risk usual mobil code system due rel autonomi mobil agent resourc control central issu mobil agent dynam mobil agent revolv abil access resourc maxim effici system vital level infrastructur agent clear notion ownership relationship owner user defin standard crucial order enabl scalabl open system intellig agent mobil agent commun main focuss develop infrastructur facilit develop mobil produc system aglet system make claim behaviour agent refer transport mechan intellig agent focuss specif issu empow agent reason capabl order maxim effect attribut social abil consid salient issu level kei problem address point identifi level gener encapsul kind infrastructur requir provid applic develop function enabl rapid applic constrain flexibl agent construct attempt point import clear understand agenthood order develop press ahead solv problem hand infrastructur offer clear conceptu view agent program critic aspect agenthood requir action behaviour integr system intellig agent infrastructur make clear fundament compon control thing plan algorithm goal mechan requir mechan clear structur develop mechan relat agent entiti simpli ing clear agent explain relat entiti environ inadequ system integr legaci applic servic network equip relationship entiti made explicit order enabl easi integr suggest requir form function entiti assum function requir modular approach agent design order enabl system develop design agent wai suit provid view agent deal separ compon isol import aspect distinguish compon brought make agent develop focu issu build agent capabl form part agent capabl easili ad agent requir modular approach dynam reconfigur featur view unpredict natur network environ benefici separ issu relat descript agent relat behaviour agent agent descript provid compon make object agent autonom agent figur entiti hierarchi entiti includ goal agent behaviour determin compon insid agent architectur execut rang complex concern goal capabl select separ descript agent concern execut make good softwar engin term modular enabl enabl agent cope kind environ layer approach discuss identifi level multiag system infrastructur middlewar technolog mobil agent address issu close relat overcom heterogen limit underli host system network intellig agent focu enabl complex task perform system infrastructur layer start mobil agent move intellig agent issu servic develop address higher level make lower level servic layer approach enabl area concern cleanli import defin concept theoret level order facilit implement access section describ effort concern provis infrastructur envisag conceptu infrastructur discuss strong clear conceptu underpin requir level infrastructur guid develop subsequ develop agent seri paper luck provid conceptu foundat develop framework agent system support featur list smart agent framework encompass structur differenti agent entiti specifi agent composit framework hierarchi includ gener abstract notion java jini javaspac jvm rmi formal agent framework agenthood autonomi coordin network commun figur overview xml entiti agent autonom agent deriv figur show venn diagram describ level outlin wai relat offer detail exposit review kei concept entiti defin term set attribut describ featur environ object simpli entiti set action object perform chang state environ agent object set goal defin desir autonom agent agent gener goal motiv drive motiv regard prefer desir autonom agent produc goal execut plan attempt satisfi desir addit basic order explic consequ luck introduc addit neutral object object server agent agent autonom relationship neutral object server agent neutral object give rise server agent ascrib goal agent environ goal achiev longer feasibl server agent revert back neutral object conceptu framework basi reason agent entiti coher time provid requisit level differenti underpin behaviour descript move discuss concept encapsul technic framework provid infrastructur system technic infrastructur line aim discuss base conceptu infrastructur develop agent technic infrastructur develop agent applic unit theori practic implement attempt provid access ground set tool agent develop kei understand simplic abil eleg adapt chang overview present figur top agent framework conceptu tool guid design agent defin relationship consid implement framework standard technolog lower level discuss opt standard technolog underli function proprietari system robust rout enabl interact make access overarch conceptu theoret issu easier argument advanc justif behalf develop relat agent system relianc technolog seek ensur case recent converg field autonom system distribut system contribut effort agent arena decoupl behaviour descript order achiev desir decoupl descript behaviour implement level made clear distinct task agent assembl requir build capabl goal relat compon mechan descript entiti collect xml document document set compon type attribut simplest seri definit declar constant variabl capabl descript type capabl link code implement capabl spirit dmar plan enabl implement vari order suit execut provid newer version capabl envisag eventu develop access librari capabl link agent descript plan motiv elabor structur vari desir level complex requir develop simpl plan structur defin seri capabl entiti complic structur includ invoc condit element remain true execut plan descript piec base requir develop insert execut platform xml document interpret capabl retriev execut environ coupl entiti mechan order effect execut complet process agent creation execut illustr figur divid initi oper agent creat suppli requir build block plan motiv mention capabl requir specif locat made part descript element requir autonom form control mechan capabl implement capabl implement capabl implement attribut goal plan xml capabl xml xml xml motiv xml interpret classload interpret interpret interpret interpret initi dtd dtd dtd dtd dtd factori factori factori factori factori chang state environ figur illustr enabl adjust motiv state environ current implement motiv tupl identifi strength salienc rate boolean indic strength variabl control compon simpl set rule indic valu motiv strength attribut environ equal provid sophist set constraint inform interpret check agent construct factori base requir execut environ question success execut environ execut suppli agent descript show essenti compon collect inform maintain acquir inform share plan goal select unit approach complet decoupl compon agent agent develop execut platform trivial chang platform order suit order incorpor desir advanc provid descript requir develop dtd xml schema replac current factori compon evalu implement attribut capabl goal plan motiv motiv figur agent creation agent oper execut oper remain environ provid conceptu infrastructur stage develop process captur state agent back set xml file set xml descript reflect agent easi transport agent platform agent make mechan implement capabl optim platform interest departur current mobil code limit program languag order achiev agent mobil actual code load reduc capabl integr mechan secur concern slightli xml descript move untrust trust code implement capabl trust environ attach agent requir problem untrust platform remain open enabl agent commun main challeng level distribut support agent involv provis middlewar infrastructur layer support dynam commun entiti constant chang part agenda chosen jini featur closest requir discuss section execut environ neutral object registr call capabl implement interfac descript retriev jini lookup servic review jini infrastructur support implement luck framework outlin illustr kei point entiti execut platform time make facil order announc exist network note requir desir feasibl perform announc import term separ issu relat cooper discoveri agent issu relat oper singl agent make announc attempt discov repres jini lookup servic lookup servic entiti guid platform inform make inform regist jini lookup servic proxi interest parti make direct contact entiti lookup servic manag mechan requir regist entiti renew interest retain inform lookup servic inform discard jini requir network connect administr infrastructur support heterogen commun make suitabl environ implement conceptu framework figur illustr neutral object discov agent devic softwar repres neutral object solid circl creat descript regist requir inform relat attribut capabl jini lookup servic proxi dot access agent stick decid devic download proxi creat server agent relev wrap proxi server agent achiev goal discard neutral object disengag figur neutral object server agent execut environ instanti autonom agent case autonom regist proxi interfac implement commun protocol agent retriev implement commun agent interest dynam commun interfac act translat commun protocol vari entiti autonom agent commun environ bandwidth reliabl implement interfac direct messag messag rout ensur messag lost discuss relat work attempt address wide rang issu start identifi concept support system rang technolog implement concept term approach distinguish relationship agent separ issu descript issu thought system integr strand agent research similar work control base system program main goal provid infrastructur enabl integr heterogen system middlewar layer make jini network technolog similar registr agent jini lookup servic descript mechan agent commun rmi term layer requir infrastructur discuss address middlewar layer facilit manag commun address higher level issu mobil intellig agent approach transfer burden address concern applic develop act integr infrastructur provid requir function mainstream develop agent concept directli work ¤ system vital role plai develop applic servic distribut increasingli comput fabric everydai environ converg relat field distribut comput develop extra support impetu adopt agent technolog mainstream opportun condit hold mainstream technolog infrastructur underpin agent applic enabl integr kind applic build construct wai facilit potenti secondari capabl critic applic mobil main problem delai wide system lack integr system agreement common infrastructur enabl infrastructur made standard system found wider jini middlewar level construct technic infrastructur conceptu support decoupl agent behaviour agent descript achiev aim fulli function execut develop platform build real work paper fulli implement stage develop level build broad rang applic demonstr examin mechan requir dynam agent capabl refer wollrath jini specif luck agent implement jini eleventh intern workshop expert system page ieee comput programm coordin architectur mobil agent ieee internet design distribut applic mobil code paradigm intern confer softwar page acm wooldridg formal specif dmar intellig agent fourth intern workshop agent architectur volum lectur note comput page finkelstein markup meet middlewar proc int workshop futur trend distribut page ieee comput societi reflect base tool observ jini servic reflect softwar volum lectur note comput page arnold pattern practic ru secur mobil agent system mobil agent volum lectur note comput page ru mobil motiv state art handbook agent technolog lang oshima program deploi mobil agent lang mobil object mobil futur distribut european confer luck formal framework agenc autonomi intern confer page aaai press mit luck engag cooper motiv agent model australian dai volum lectur note artifici page springer white omg mobil agent system facil intern workshop mobil volum lectur note comput page shoham program artifici agent mass workshop high perform problem solv applic practic tschudin mobil agent secur intellig inform page wooldridg softwar state volum lectur note artifici intellig
ML/1067 6 boost appli word disambigu gerard german research center lsi depart universitat de girona barcelona abstract paper schapir singer boost algorithm appli word disambigu problem initi experi set select polysem word show boost approach surpass naiv repres accuraci order make boost practic real learn domain thousand wai algorithm reduc featur space studi call test largest corpu exampl frequent ambigu english word boost compar favour benchmark algorithm introduct word disambigu problem assign mean word text mean distinguish potenti attribut word resolv ambigu word central problem languag understand applic task machin inform retriev hypertext spell refer automat text import open problem natur languag process field wide rang approach investig larg effort devot tackl fact date broad coverag highli accur word disambigu system built success current line research approach statist machin learn algorithm appli learn statist model classifi corpora order perform approach learn semant annot obtain result method small set select highli ambigu artifici research partial fund spanish research depart project research depart consolid research group wordnet project grant standard ml algorithm learn naiv learn list neural network moonei compar cite method restrict domain includ tree rule induct algorithm direct comparison altern method ident test data commonli accept naiv neural network learn repres accuraci method suffer lack wide semant tag construct broad coverag system acquisit ng estim manual annot effort build broad coverag semant annot corpu extrem high overhead overhead commonli algorithm scale real size explain method question due recent work reduc acquisit cost method line research design effici sampl method lexic wordnet www search engin automat obtain internet arbitrarili larg sampl word algorithm estim statist model paramet belief bodi evid acquisit bottleneck futur worth investig applic ml method resolv problem boost algorithm main idea boost algorithm combin simpl moder accur weak highli accur classifi task hand weak classifi train sequenti train exampl difficult classifi weak classifi algorithm appli paper gener freund schapir adaboost algorithm studi extens shown perform standard task standard algorithm weak learner natur languag successfulli appli tag attach disambigu text categor good result text categor domain share properti usual set high featur consist test concret presenc irrelev highli depend fact learn concept resid featur space applic choic note excel result obtain nl advantag theoret found easi implement paper organ section devot explain detail algorithm section describ domain applic initi experi perform reduc set word section altern explor learn process reduc featur space altern fulli test section section conclud outlin direct futur work boost algorithm section describ schapir singer algorithm multiclass notat author boost find highli accur classif rule combin weak weak moder accur assum exist separ procedur call acquir weak boost algorithm find set weak call weak learner repeatedli seri round weak combin singl rule call combin hypothesi ym set train instanc belong instanc space subset finit set label class size denot present figur maintain matrix weight distribut exampl label goal algorithm find weak hypothesi moder low error respect weight distribut boost algorithm updat weight round forc weak learner concentr pair hardest predict distribut round weak rule acquir sign interpret predict label assign magnitud predict jh interpret measur confid predict order understand correctli updat formula piec notat defin clear updat function weight make good variat proport jh note classif problem uniqu expect word context algorithm run procedur set train exampl initi distribut weak hypothesi updat distribut normal factor return combin end fig algorithm explain set reduc uniqu combin hypothesi forc output uniqu maxim remain defin form schapir singer prove ham loss algorithm train set normal factor comput round upper bound guid design attempt find weak hypothesi weak simpl weak test boolean predic make predict base predic section form featur word base predic interest li weak make predict ae hold jl real number predic bear minim valu jl calcul subset exampl fraction train exampl label sign differ predic hold subset exampl predic hold predic hold current distribut real number calcul label jl jl jl weight respect distribut train exampl partit label shown minim predic jl jl jl set impli jl jl predic chosen smallest small valu paramet jl jl predict larg infinit magnitud larg predict numer problem tendenc overfit suggest smooth valu jl appli boost corpu experi boost approach evalu corpu semant annot occurr noun verb correspond frequent ambigu english word corpu collect ng colleagu linguist data consortium group word noun frequent relat literatur select word left tabl goal acquir classifi row repres classif problem number class rang number train exampl number attribut mf column tabl show percentag frequent accuraci naiv classifi obtain attribut describ exampl correspond binar featur refer narrow linguist context context consecut word exampl tag set label minor wordnet ldc word disambigu featur mention correspond colloc consecut word benchmark algorithm methodolog compar naiv naiv bayesian classifi classic set avoid effect count estim condit probabl simpl smooth techniqu learn exampl store memori classif base nn algorithm ham distanc measur close exampl greater result weight major nearest neighbour vote strength proport close test ti resolv favour frequent ti comparison algorithm perform seri control experi train test set method methodolog consist accuraci rate figur paper averag result fold statist test perform cross valid pair student confid result figur show error rate curv averag refer number weak rule word plot show error obtain lower obtain nb eb choic paramet number test number rule show error rate slightli approach maximum number rule report plot figur overfit observ number rule word strategi rule shown number round determin individu word behaviour adjust number round valid train suggest valid insid gener experi gener prohibit overhead simpl stop criterion maximum number round consid effici reason weak rule mf naiv exemplar base fig error rate relat number weak rule consist stop acquisit weak rule error rate train set fall upper bound rule refer ab sc obtain compar result ab gener weak rule word repres moder storag requir combin classifi numer inform experi includ tabl tabl show accuraci detail eb eb ab ab sc result word print boldfac result correspond boost algorithm compar global accuraci ab ab sc significantli greater method note accuraci nb eb compar suggest ks greater crucial make base learn competit make boost practic simpl competit algorithm task achiev accuraci perform superior naiv algorithm test paper drawback comput make algorithm scale properli real domain thousand word space requir number train exampl number includ call weak learner cost unavoid adaboost mh inher sequenti order learn weak rule calcul weak properli updat matrix insid iter process attribut decid number accuraci word po attrib mf nb ag art car child church cost fall head interest line set speak work avg noun verb tabl set refer word result main algorithm minim thousand time consum straightforwardli reduc number attribut relax examin attribut iter method test order reduc cost search weak rule consist aggress reduc featur frequent appli text categor fourth consist reduc number attribut examin round boost algorithm frequenc filter method consist simpli discard featur event occur time train corpu idea criterion frequent event inform rare local frequenc filter method work similarli freq consid frequenc event level select frequent featur method consist make rank attribut distanc measur select relev featur measur commonli attribut select tree induct algorithm distanc belong famili attribut select function select show perform method filter attribut reduc number examin iter boost algorithm small proport attribut randomli select weak rule select idea method proport suffici good rule found iter chanc good rule learn process high import characterist attribut discard avoid risk elimin relev attribut method compar set refer word figur averag curv obtain variant level attribut reduct top horizont line correspond mf error bottom horizont line stand error rate work attribut result figur calcul run boost algorithm round word reject attribut freq fig error rate obtain weak rule respect percentag reject attribut main drawn ffl method work import degrad observ perform valu lower reject attribut irrelev highli depend attribut domain ffl slightli indic prefer make frequenc count global altern experi tree induct po tag method call refer work samuel colleagu appli techniqu learn algorithm dialogu act tag system ffl inform rank perform reduct method freq ffl confirm worth inform provid featur accept perform obtain attribut explor weak rule achiev perform run time faster adaboost mh work select experi section evalu algorithm test full semant annot corpu stop criterion section refer ab averag number averag number train exampl ab algorithm learn averag rule dai cpu time complet note time includ overhead elimin estim cpu dai time acquir word disambigu base system cover word ab compar benchmark algorithm methodolog section averag accuraci result report left tabl figur correspond algorithm ab differ statist pair accuraci mf nb ab ab nb ab noun verb averag tabl result benchmark method corpu tabl show comparison ab versu nb eb cell number loss compet algorithm count statist differ includ bracket import point eb beat significantli ab case nb case superior ab eb nb observ current implement written run sun machin ram futur work present schapir singer algorithm evalu word disambigu hardest open problem natur languag process boost approach outperform naiv repres accuraci faster variant suggest call variant scale algorithm real accur detail found extend version paper futur work plan ffl extens evalu task includ account addit test algorithm manual annot corpora automat obtain internet ffl confirm valid approach languag learn task work text categor ffl mislabel exampl result annot error tend hard exampl classifi tend larg weight final distribut observ identifi noisi exampl boost improv data qualiti suspect corpu current work worth boost improv refer boost appli tag attach joint confer empir method natur languag process larg empir comparison vote classif boost variant machin learn journal special issu improv scale machin learn arc classifi annal pattern classif scene analysi comparison method construct ensembl random machin learn sp minim manual annot cost train corpora riloff statist symbol approach learn natur languag boost appli word disambigu technic report lsi experi boost algorithm proc intern confer machin gener learn applic boost journal comput system select sampl base word disambigu comput introduct special issu word state art comput corpu statist wordnet relat identif comput lopez de attribut select measur tree induct machin machin learn approach base tree phd lsi automat method gener tag corpora nation confer artifici paper wordnet special issu intern journal compar experi disambigu word illustr role bia machin learn confer empir method natur languag ht integr multipl knowledg sourc disambigu word approach annual meet associ comput word recent improv confer empir method natur languag word disambigu workshop text lexic case studi agreement workshop lexic knowledg lean disambigu nation confer artifici boost nation confer artifici lazi learn intern florida ai research symposium improv boost algorithm predict machin learn system text categor machin learn disambigu highli ambigu word comput list lexic ambigu applic accent restor spanish french annual meet associ comput
AI/1068 2 contemporari workload edit ec texa usa ann mari ibm austin research usa oper system activ kluwer academ chapter oper system activ benchmark tao li john kluwer academ publish laboratori comput architectur depart electr comput engin texa tx narayanan anand lab depart comput scienc engin pennsylvania state pa complet system simul understand influenc architectur oper system applic execut identifi crucial system design problem interest context java applic invok kernel underli java virtual machin implement run program jvm style compil manner jvm compon garbag collector class impact kernel activ investig chapter complet system simul benchmark simul platform execut benchmark compil interpret profil detail kernel activ applic constitut execut time larg dataset small dataset kernel miss handl file system call page alloc routin domin applic addit execut ilp user kernel mode quantifi java code limit exploit parallel aggress instruct issu effici benchmark kernel mode execut exhibit ilp user mode kei java virtual complet system oper workload introduct kluwer academ publish java offer develop portabl softwar standard interfac span spectrum hardwar platform java virtual machin cornerston effici execut portabl java bytecod crucial success widespread adopt java step build effici jvm understand interact underli system hardwar oper identifi bottleneck chapter present result complet system profil oper system activ jvm implement style chapter popular techniqu interpret compil interpret portabl java byte code approach easiest implement compil repres translat machin nativ code runtim sophist direct execut increasingli clear accur perform analysi requir examin complet system architectur oper system behavior complet system simul studi workload context java program jvm implement jvm environ significantli requir support tradit fortran base code major differ due execut frequent virtual method call dynam object alloc garbag dynam link load multithread consequ synchron softwar interpret dynam compil differ affect behavior oper system kernel manner convent applic dynam link load class result higher file dynam object alloc garbag collect requir memori manag oper multithread influenc synchron behavior kernel detail profil interact hardwar oper system understand intricaci jvm restructur perform profil architectur oper system perspect identifi enhanc boost java perform kluwer academ publish oper system activ benchmark goal studi profil complet system oper behavior execut java chapter specif attempt answer time spent user kernel kernel activ overhead incur java studi os activ repres aggreg java execut time spent execut instruct spent synchron kernel user part jvm execut suit underli parallel modern characterist portion influenc instruct level parallel ideal speedup set answer question benchmark complet system simul find kernel activ applic constitut execut time larg dataset small dataset kernel miss handl file system call page alloc routin domin applic find dynam wide issu retir effect kernel code user code rest chapter organ section overview platform workload section present execut time detail statist user kernel activ workload section investig cach memori perform section explor ilp issu section summar contribut implic work identifi direct futur research methodolog platform perform studi complet simul environ model hardwar compon detail boot run commerci oper system version run silicon graphic oper system interpret compil version java develop kit sun microsystem simul top irix oper system studi base program suit tabl set program intend evalu perform combin hardwar softwar aspect os jvm client platform common comput featur integ float point librari call awt graphic benchmark run input size refer observ data size scale suggest tabl workload benchmark descript compress modifi method compress decompress file jess java expert shell system base clip expert system db perform multipl function memori resid jdk java compil compil line code decod decompress audio file jack parser gener lexic earli version annot machin architectur java run time system kluwer academ publish workload disk boot os set system mount disk figur simul flow chart execut applic dump simul result mx file cach profil execut posit applic checkpoint kluwer academ publish oper system activ benchmark includ multipl processor simul model cpu level detail fastest cpu boot os perform detail cpu model conduct perform measur shown figur larg complex boot initi phase execut ten billion instruct checkpoint abil hardwar execut statu content regist main memori save set file simul resum checkpoint featur conduct multipl run ident initi statu ensur accur simul complet execut write annot automat invok studi workload checkpoint restor exit simul execut complet os prompt return avoid interact input control simul begin make run compar perform result present studi gener detail cpu model model pipelin processor result latenc repeat rate effect model perspect detail processor perform provid valuabl inform instruct detail memori system behavior gener basic knowledg memori system behavior studi workload perform evalu mx model microprocessor multipl instruct regist dynam specul execut except baselin architectur model issu processor mip instruct latenc unlik mip processor model instruct reorder buffer buffer function unit handl type instruct branch predict implement tabl satur counter predictor indirect branch handl target address ra address branch predict algorithm fetch unit fetch unresolv branch memori subsystem consist split instruct data unifi main memori processor mip kluwer academ publish base page size instruct cach cach line size data cach line cach line hit cach servic hit cach servic cycl cach lru replac write back write miss alloc polici miss statu handl regist main memori consist mb dram access time simul machin includ valid hp disk model singl consol devic architectur simul cycl cycl instruct data access applic oper system model kernel activ figur show execut time profil benchmark compil interpret mode execut input dataset result dataset shown figur measur period includ time load verifi class compil fly compil execut nativ instruct stream simul hardwar profil present term time spent execut user stall incur execut instruct memori pipelin time spent kernel stall due kernel synchron oper kernel remain idl time figur show flat steadi execut profil bulk execut time made steadi state execut region consist singl outer loop set loop iter data size db make heavi errat kernel make execut behavior irregular observ neglig synchron time execut partial due java runtim librari function design thread synchron tabl summar breakdown execut time spent user idl benchmark input dataset small input dataset kernel activ constitut execut time program spend execut time kernel fact impli ignor kernel instruct workload studi repres complet accur execut behavior oper system activ benchmark percent execut time percent execut time percent execut time percent execut time compress db kluwer academ publish time time time time idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel percent execut time percent execut time percent execut time jess time time time jack execut time workload idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel separ time spent idl mode cpu model user kernel mode subdivid instruct execut kernel memori stall kernel synchron kernel figur execut profil workload compil percent execut time percent execut time percent execut time db kluwer academ publish time time time idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel percent execut time percent execut time percent execut time jess time time time jack execut time workload idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel idl user stall user kernel sync kernel stall kernel separ time spent idl mode cpu model user kernel mode subdivid instruct execut kernel memori stall kernel synchron kernel figur execut profil workload interpret kluwer academ publish oper system activ benchmark execut time workload separ time spent idl mode cpu model user kernel mode subdivid instruct execut kernel memori stall kernel synchron kernel figur execut profil workload compil kluwer academ publish execut time workload separ time spent idl mode cpu model user kernel mode subdivid instruct execut kernel memori stall kernel synchron kernel figur execut profil workload interpret oper system activ benchmark tabl execut time percentag benchmark input user compress jess db mpeg jack kluwer academ publish user inst user stall kernel kernel inst kernel stall kernel sync interest observ fact idl time file smaller data set mention idl time due disk activ oper miss file cach oper invok repeatedli lead higher hit percentag file cach data set observ percentag kernel time spent read call compar smaller data set execut profil reveal kernel behavior execut workload level kernel time servic level kernel routin behavior set state machin annot track current kernel page fault interrupt disk hardwar except attribut kernel execut time specif servic perform idl tabl os kernel workload db compil bench compress jess db jack servic kluwer academ publish num cycl read clock open read open write read write open exit fork read clock oper system activ benchmark tabl os kernel workload mpeg compil bench mpeg servic kluwer academ publish num cycl read open exit close write fork read open write exit clock fork close read clock open tabl os kernel workload compil bench compress jess db mpeg jack servic kluwer academ publish num cycl read clock clock read clock read clock read clock read open fork clock read read clock oper system activ benchmark tabl os kernel workload interpret bench compress jess db mpeg jack servic kluwer academ publish num cycl clock read clock read clock clock read fork clock read read clock kluwer academ publish tabl break kernel activ dataset specif servic tabl give number invoc number cycl spent execut routin break cycl actual instruct stall synchron memori cycl instruct execut servic breakdown instruct data portion read write kernel servic involv disk access subsequ copi data file cach user data structur note time spent disk access account read write kernel figur idl time execut profil process block read write overhead due memori copi oper fault reload user address block clear oper occur oper system alloc page data page read system call transfer data kernel address space applic address space clock clock interrupt page fault handler execut profil bulk time spent execut user instruct true compress mpeg subsequ execut domin user oper oper comput intens substanti spatial tempor local lower user stall compar applic tabl local result high hit rate make handler invoc infrequ reason percentag kernel time spent lower mpeg compar applic tabl benchmark jess observ spike kernel activ execut spike introduc file activ attribut applic behavior jvm characterist time spent spike memori stall kernel routin initi page process clock interrupt routin contribut stall addit uniform presenc kernel instruct execut evid tabl due handl miss process memori copi clear oper os kernel workload dataset compil shown tabl kluwer academ publish oper system activ benchmark cach memori perform tabl show percentag memori stall time spent data instruct workload show data user kernel mode dataset user mode data stall time domin total memori stall compress db jack applic demonstr uniform distribut data instruct stall time fraction oper system time spend wait data approxim equal instruct data stall time instruct stall data stall tabl memori stall time percentag benchmark input user stall data inst kernel stall data inst compress jess db jack note simplist processor model necessarili introduc varianc result compar order model mx faster model simul complex benchmark larg input size complet accept simul time previou studi show kluwer academ publish perform improv model appli user kernel code prefer kernel execut time expect kernel execut fraction complex order model examin cach miss behavior cach size chang data instruct cach unifi cach form shown figur cach set associ cach lru replac polici cach miss behavior present cach miss instruct miss number includ cach miss occur kernel user mode perform data cach vari configur summar figur number data cach miss higher benchmark show neglig cach size observ cach miss drastic cach size data cach miss continu cach size suggest larger cach benefici workload figur present instruct miss workload benchmark db higher miss number due larger instruct footprint frequent branch runtim librari oper system call mpeg show fewer miss singl set tight loop work data consum bulk comput time constitut small instruct footprint figur show instruct relat cach miss satisfi instruct cach associ instruct cach benefici instruct cach perform perform data cach cach shown figur cach size size instruct cach cach miss behavior follow rule thumb doubl cach size half benefit previou doubl instruct stream effect cach data access difficult data footprint larger instruct footprint benchmark investig impact cach perform line size cach size model associ cach line size vari byte byte miss instruct oper system activ benchmark miss instruct user miss kernel miss data cach compress jess db mpeg jack miss user instruct instruct data miss instruct compress jess db mpeg jack kluwer academ publish user miss kernel miss compress jess db mpeg jack inst cach compress jess db mpeg jack figur impact cach capac line size figur show cach perform line size user kernel mode figur workload advantag larger cach miss kernel instruct instruct data user miss kernel miss compress jess db mpeg jack kluwer academ publish cach block size perform benefit larger block size highli depend block size branch behavior applic mpeg realiz instruct cach miss rate improv due loop characterist sequenti access natur jack workload exhibit random branch pattern code tree perform tight iter loop workload comput arrai data larg block size improv data miss behavior workload reduc miss user mode line size byte byte figur show effici reduc instruct relat cach miss effect data miss instruct miss stabl cach line size byte byte kernel previou line size discuss held observ oper system kernel experi higher instruct data miss user applic symbol code oper processor read link list complex data structur indirect low spatial local figur show memori stall time express memori stall time instruct stall time shown separ kernel user mode instruct data stall stall shown occur due cach compil interpret mode observ kernel routin experi higher user code indic memori system behavior kernel mpeg kernel compar neglig user mode kernel portion form maximum execut time benchmark mitig impact observ figur user mode interpret mode compar mode bursti write dynam compil addit instruct execut interpret bytecod result behavior observ stall due data refer due instruct access due cach access small compress mpeg workload exhibit data local benchmark benefit stall reduct techniqu emploi cach oper system activ benchmark memori cycl instruct memori cycl instruct figur memori stall time kernel user mode dataset made gener observ jvm execut style identifi differ behavior interpret compil miss microsecond kluwer academ publish compress jess db mpeg jack figur miss behavior benchmark import differ mode shown figur observ miss rate higher compil local interpret loop translat higher hit rate compar compil miss rate db jack lower compil detail investig interpret behavior code lead reason benchmark db method uniqu method call execut repeatedli access data item random perform transact local data item poor poor data local access local bytecod stream interpret bytecod treat data interpret loop method bytecod stream high effect amplifi result higher miss rate interpret mode execut amount time spent user kernel stall read file execut overshadow differ miss behavior style execut differ miss rate automat translat differ percentag kernel execut time applic miss handl overshadow kernel servic ilp issu kluwer academ publish section analyz impact instruct level parallel techniqu suit execut complet workload detail cpu simul mx effect featur wide issu retir studi due larg slowdown mx cpu reduc data size data input section model instruct data access applic os figur illustr aggreg execut speedup singl pipelin microprocessor execut time sp ss simul machin model section ss aggress hardwar exploit ilp instruct window reorder buffer hold queue hold branch predict tabl entri cach support cach access cycl focu studi perform differ memori subsystem figur show techniqu exploit ilp reduc execut time workload ss total ilp speedup show wide variat jess averag ilp speedup origin applic user kernel kernel speedup ilp processor lower speedup user code issu width observ factor perform improv applic compar perform gain obtain wider issu retir result suggest ipc oper system activ benchmark aggress ilp techniqu effici applic workload featur workload explain poor stack base isa result tight depend instruct execut spec java involv runtim librari branch runtim librari os except benchmark db idl compon data aggreg ipc low kernel user code individu exploit reason ilp ilp speedup total sp ss ss jess db jack jess db jack jess db jack simpl compress jess db mpeg jack kluwer academ publish user figur ilp speedup cach stall cach stall pipelin stall actual ipc ipc kernel compress jess db mpeg jack figur ipc breakdown processor dataset give detail breakdown ideal ipc actual ipc ipc lost instruct data cach ipc lost pipelin stall classif techniqu attribut graduat unit stall time data cach stall graduat unit stall load store outstand miss data cach entir instruct window empti fetch unit stall instruct cach instruct cach stall record pipelin attribut pipelin stall figur show breakdown ipc processor jack lost ipc instruct cach stall partial due high indirect branch frequenc interrupt control flow studi applic show ipc loss data cach stall data cach stall time includ miss compil compil actual execut compil code data set figur show amount ipc lost due pipelin stall ipc loss pipelin stall processor processor fact impli aggress complex ilp hardwar achiev desir perform gain due inher ilp limit applic applic show limit instruct cach ipc stall data cach ipc stall processor normal speedup kluwer academ publish jess db jack mpeg avg figur normal execut speedup jvm implement style figur illustr execut speedup interpret compil simul machin execut time interpret mode speedup compil span compress averag perform gain compil costli process analyz syntax perform desir perform bytecod time execut run time compil java method nativ instruct avoid costli interpret preserv portabl secur cost dynam compil kluwer academ publish oper system activ benchmark amort method compil perform interpret speedup method execut time method benchmark method domin execut run short compil cost perform detail analysi branch behavior user kernel execut java run time system implement behavior fare typic branch predict find pessimist branch predict perform hardwar constraint predictor size organ approach identifi bottleneck quantifi effect optim evalu interest java underli tailor augment support wide spectrum hardwar portabl devic server instrument mx simul perform select profil condit indirect branch branch shown figur skip uncondit branch target address comput easili super fast obtain baselin simpl typic predictor type branch user predict accuraci condit branch fall rang mode interpret predict accuraci mode interpret mode kernel predict accuraci mode interpret mode averag predict accuraci mode interpret mode indirect mode predict accuraci averag interpret mode predict accuraci averag kernel predict accuraci indirect branch high achiev mode interpret mode procedur exclud indirect branch predict return address stack user ra achiev averag accuraci mode interpret mode predict accuraci address kernel mode interpret mode accuraci condit branch predict accuraci condit branch predict user jess db jack kernel percentag correctli percentag correctli fall jess db jack kluwer academ publish accuraci indirect branch predict accuraci indirect branch predict user jess db jack kernel jess db jack accuraci return address predict accuraci return address predict user jess db jack kernel jess db jack figur baselin perform branch predict structur java run time system branch instruct separ kernel user mode benchmark invok compil interpret breakdown indirect provid baselin satur condit entri indirect entri return address stack stack pointer figur show condit branch kernel code predict simpl predictor previou studi show transfer control flow oper system typic technic applic execut tight control flow oper system frequent transfer handl process servic system call core routin involv context switch frequent invok instruct sequenc mix basic block bypass condit branch low indirect ipc ipc ipc oper system activ benchmark branch predict accuraci user code interpret mode stem fact multipl target indirect branch interleav dynam instanc scheme simpl hash function direct incur high rate histori path base captur pattern specif branch site improv perform total kernel user compress number branch number branch total kernel user total kernel user jack number branch kluwer academ publish ipc ipc total kernel user jess number branch total kernel user number branch ipc ipc total kernel user db number branch total kernel user number branch figur impact branch depth ipc figur illustr rate ipc execut benchmark branch predict depth vari differ level perform flatten unresolv branch studi workload ipc consist frequent branch branch predict accuraci benchmark kluwer academ publish popular widespread adopt java necessit develop effici java virtual machin chapter provid insight interact jvm implement underli system hardwar oper major find chapter kernel activ applic constitut execut time larg data set small data set compil mode consum larger portion kernel servic execut except found db data high method bytecod data local interpret mode benchmark spend time execut instruct user mode spend time stall cycl user execut kernel stall mode jack significantli higher file small kernel execut found higher user mode kernel activ benchmark due invoc read servic routin observ dynam behavior influenc kernel activ significantli smaller dataset contribut read servic routin averag ilp speedup processor benchmark execut compil mode found time found speedup kernel routin lower speedup user code aggress ilp techniqu wider issu retir effect benchmark observ perform improv move issu issu width time compar time time perform gain achiev pipelin stall due depend major impedi achiev higher speedup ilp issu width involv dynam runtim librari tend control transfer runtim librari routin os servic user averag predict accuraci condit branch simpl branch predictor mode interpret mode kernel averag predict accuraci oper system activ benchmark mode interpret mode indirect mode predict accuraci averag interpret mode predict accuraci averag acknowledg research support part nation scienc foundat grant career award state texa atp grant sun refer kluwer academ publish java bytecod nativ code prototyp preliminari intern symposium page wilson compil java ieee vol page effici intern confer parallel architectur compil page fast effect code gener java confer program languag design page direct execut engin java ieee page oct issu design java processor architectur phd colleg south juli memori system commerci annual intern symposium comput page complet machin simul understand comput system phd stanford feb complet comput system ieee parallel distribut system page winter impact architectur trend oper system acm symposium oper system page kluwer academ publish user java platform product fast flexibl machin acm sigmetr confer measur model comput bennett perform factor technic report comput system stanford feb microprocessor product mip open risc oct mip ieee page apr hardwar softwar support oper system exploit mp memori ieee transact vol page complet system simul intern confer page ba wilson case intern confer architectur support program languag oper page
DB/1069 3 system complex spatial queri stephan grumbach philipp rigaux luc di roma tre inria inria technic report abstract paper present spatial system intend overcom limit current system provid abstract data model queri languag manipul spatial object reli logic model base linear gener constraint model classic constraint spatial data convex hole fit practic applic logic spatial data slightli costli advantag simplifi algorithm reli nest sort data store uniform fashion data model support declar queri intuit effici manipul spatial object formal foundat constitut basi practic queri optim describ evalu rule tailor geometr data give specif optim modul spatial queri system fulli implement prove effect approach design spatial system introduct introduct spatial inform system import specif issu perform due larg volum spatial main challeng design data model gener power handl convent data spatial object system offer sound data model uniform sort support declar queri languag complex spatial queri power sql queri languag design advantag spatial queri languag extens limit simpl expert user independ physic level algorithm queri respect standard constraint framework offer spatial data nest relat explicit hole gener manag system relat store manipul spatial complex structur work support part tmr project chorochrono contact luc tel fax rocquencourt bp le franc rue st pari cedex franc geometr inform intric topolog relationship set spatial relat object costli oper involv geometr object manag glanc prevent approach base simpl data structur manipul limit set simpl oper relat main trend addit logic compon carefulli design geometr structur comput geometri algorithm order provid effici evalu spatial oper partli specif implement spatial object exist geograph inform system reli strict distinct data geometr data extend effici modul manipul geometr topolog inform relat modul manipul inform geometr object research model prototyp favor ad hoc algebra extens convent model abstract spatial data type encapsul geometr structur oper commerci dbm oracl illustra provid latest version separ modul devot spatial data common drawback system lack uniform data constraint data introduc kuper revesz offer paradigm sort data unifi framework linear constraint ration number shown fit spatial data vector mode spatial infinit set dealt class citizen explicit contrast spatial object boundari vector mode lead cumbersom data model ad hoc standard emerg fundament differ approach reli explicit definit spatial object data model polygon explicitli infinit set point versu implicit definit sequenc border manipul spatial object standard set oper relat user intersect system evalu differ depend input basic idea constraint model repres spatial object infinit collect point satisfi formula convex intersect set defin conjunct inequ defin convex polygon union set convex polygon initi framework subsequ public constraint formula assum disjunct normal form lead decomposit spatial object convex compon restrict kind spatial object store forc convex compon load decomposit size simplifi subsequ manipul spatial object queri evalu open problem favor data size result lower hole data introduc logic gener classic constraint spatial object hole data offer strong advantag practic maintain low complex basic oper data model normal form relat level nest inform easili repres unnest attribut level set nest spatial data model solid logic foundat data model design declar queri applic requir expert user unlik queri languag provid spatial inform system follow trend initi constraint develop base algebra queri languag addit function relat data structur model fundament spatial oper fo languag constraint enjoi low data complex suffer restrict express topolog connect metric oper distanc express introduc languag metric topolog oper significantli express preserv fundament featur input output algebra oper linearli result power algebra cover classic oper requir spatial fundament geometr structur oper convex hull voronoi diagram express natur intric queri address topolog relationship simpl sql queri languag user write complex spatial declar algorithm aspect queri illustr power languag larg list queri robot relat problem queri section difficult express languag easili express import characterist algebra fact optim optim queri languag current spatial system insuffici address high level queri languag user write proper sequenc languag primit system architectur base extens convent dbm geometr render dbm optim modul obsolet presenc spatial lead drastic ineffici execut plan evalu techniqu differ classic account geometr natur data show recogn pattern queri specif problem effici convex hull spatial larg evalu queri time consum improv parallel evalu spatial queri studi queri languag base potenti lend parallel implement implement top object dbm current queri evalu partli reli standard oql constraint oper manipul set point fulli access yield set physic oper data structur valid implement oper relat algebra spatial relat present advanc queri evalu optim rule principl present sequel implement geograph applic run base dataset produc french institut sequoia project queri present section successfulli evalu applic system demonstr possibl build effici spatial system unlik classic respect fundament distinct logic physic level paper organ present logic framework spatial data hole section introduc nest data algebra user queri queri illustr power languag context section architectur present section guidelin design specif optim rule oper spatial data logic manipul spatial data present logic framework spatial model infinit relat admit finit term defin relat algebra oper spatial relat gener framework spatial data model infinit set ration space polygon plane infinit set point insid pyramid infinit set point insid facet abstract spatial data consist infinit relat ration number infinit relat manipul finit trend constraint logic repres relat defin symbol level linear constraint languag structur hq linearli order set ration number ration constant addit constraint linear equat inequ predic denot variabl integ constant note ration constant avoid linear equat inequ multipl symbol stand oe fr schema oe relat symbol distinguish logic predic relat oe linear constraint relat defin definit relat relat linear constraint relat exist formula distinct free variabl class linear constraint relat constitut drastic restrict class infinit relat restrict ensur reason queri complex suffici encompass spatial data comput wide demonstr literatur drastic restrict constraint repres relat quantifi free formula restrict quantifi free construct effect spatial object repres quantifi free formula quantifi free result reason queri complex restrict enforc formula disjunct normal form restrict harmless formula put motiv complex dnf figur dnf polygon hole formula dnf gener finit set gener conjunct atom formula term dnf formula enforc specif view spatial object relat union finit set convex object term impli polygon convex compon polygon call previou restrict convex normal form note doesnt restrict class spatial object transform object prior decomposit convex compon gener motiv logic simplic algorithm object situat frequent spatial applic definit formula convex hole normal form form formula set differ figur show spatial object repres formula dnf dnf union polygon polygon minu instanc map associ relat symbol oe linear constraint relat ariti exhibit view relat symbol level relat algebra oper appli linear constraint variant depend normal form algebra introduc codd finit relat case infinit oper appli finit infinit refer algebra abstract level infinit relat abstract algebra shown abstract algebra logic class linear constraint proof similar classic relat algebra calculu finit structur combin select cartesian product yield complic form select symbol free formula normal form dnf symbol oper appli formula repres possibl infinit return formula symbol effect oper formula emul effect infinit relat normal form assumpt symbol algebra set ae formula defin defin elimin quantifi formula free variabl defin defin ae defin variabl replac variabl oper classic oper relat repres formula defin distinct defin defin defin defin oe defin ae defin ae variabl attribut complex oper oper oe calcul constant time size oper calcul algorithm roughli size number variabl elimin addit oper fundament symbol algebra boolean oper return empti formula return transform input formula simpler remov redund term conjunct term impli rest replac satisfi conjunct remov disjunct disjunct verifi iff complex test ariti relat size formula defin focu algebra relat normal form studi normal form motiv spatial applic lower complex previou test oper depend oper normal form chosen oper symbol algebra admit simpler definit case relat normal form relat convex normal form algebra oper perform set gener formula disjunct normal form convex defin dnf formula consid set gener tupl ft elimin method tupl defin polyhedron inequ coeffici rang ft set tupl disjunct dnf formula previou symbol oper suffici emul abstract relat formula complex oper dnf formula simpler gener case calcul constant time size formula calcul algorithm number variabl elimin number constraint project quadrat elimin size output quadrat input quadrat time dimens exponenti dimens complex test log dimens normal defin elimin empti tupl redund insid tupl time log dimens final oper symbol algebra relat convex hole normal form algebra ae ff ff fi fi formula ff fi fi defin fi defin symbol algebra domain qf formula dnf formula formula oper effect comp effect comp effect comp fi fi fi ff fi oe oe oe figur summari algebra function dimens data number variabl elimin project oe defin oe ff defin fi fi ff fi defin ff fi calcul algorithm slightli complex quadrat elimin variabl output fl fl obtain comput intersect point ff extract part boundari fl complex oper differ algebra convex normal form easili show cartesian project linear set differ constant time test relat empti test ff ae ff negat dnf formula time dimens exponenti gener case normal defin elimin empti tupl redund insid tupl negat ff fi restrict fi fi ae ff normal calcul time dimens inform complex refer data complex linear constraint queri investig shown gener polynomi constraint queri nc data complex linear complex nc shown data complex linear constraint queri restrict class linear constraint input ac class linear constraint relat individu linear constraint tupl relat occurr addit integ spatial data model languag present data model implement foundat spatial queri languag spatial data base logic framework previou section data store normal form relat manipul infinit set point class citizen level set nest suffici achiev goal spatial object type built atom object ration set tupl constructor assum exist infinit set attribut atom infinit set atom constant type complex type domain defin fq set type ariti domain fr fr denot set finit subset atom set attribut tupl type domain tupl ftg relat type domain denot set finit subset relat denot object relat set object set type distinct fundament note relat set infinit data strongli type except relat ration attribut set type distinguish distinct atom exampl relat type geographi owner geometri fq relat admit symbol descript gener formula previou section languag distinct sort variabl type fq variabl type occur atom form variabl type linear variabl type fq express variabl type spatial relat type figur forest owner bob grass owner alic figur symbol previou relat geometri tabl owner geometri bob fx alic fx introduc algebra extend relat algebra oper specif type algebra tupl constructor build tupl tupl object atom set type distinguish valid invalid tupl tupl valid attribut set type empti invalid invalid tupl discard intuit semant choic reli fact space store object empti space consid void natur number attribut project extract attribut undefin undefin note tupl project reli test test empti set requir comput empti tupl tupl ariti denot set set construct set tupl ration formula set construct algebra singleton relat construct relat tupl algebra boolean constant true denot ffl empti model rue relat set note definit true idempot ffl membership defin object type object type model rue element algebra variabl denot function variabl type fq denot function perform translat geometri algebra oper ffl set set appli pair input set relat type ffl oe appli input relat set type atom constraint variabl attribut posit constraint linear form set membership constraint ffl appli input set relat type ffl cartesian appli pair input set type relat type ffl map appli input relat type algebra express tupl type tupl variabl relat type map defin relat type ft tupl replac ffl unnest appli input relat type nest produc output set flat relat unnest tupl ffl appli input relat type nest attribut replac tupl valu attribut singl tupl attribut union valu attribut interpret oper input set type correspond semant oper linear constraint relat present section interpret input relat type correspond semant classic relat algebra finit relat note semant coincid abstract level list oper defin primit oper introduc ffl nest appli input relat set output relat type attribut nest type independ result finit cardin fi set attribut relat fj set attribut nest map oe ffl compl appli input relat type replac attribut type fq complement fj set attribut compl map ffl similar comput intersect attribut valu union compl introduc boolean select ffl boolean oe appli input relat set type atom constraint oe oe primit oper introduc realiz basic set oper nest object power express spatial import topolog metric properti defin restrict set includ oper requir languag close relat set attribut independ set attribut relat set formula repres attribut occur attribut constraint preserv linear set complex queri tractabl practic oper respect requir introduc fundament geometr oper note oper gener higher dimens ffl fp fp point defin undefin line includ half plane delimit line ffl fp fp point defin undefin median half plane delimit median languag previou oper linear interest queri express convex hull voronoi diagram convex hull finit collect point defin map voronoi diagram finit collect point defin map metric great care due object linear feasibl circl point easili defin unrestrict distanc unrestrict select condit distanc express arbitrari polynomi condit euclidean distanc boolean distanc set preserv linear feasibl ffl oe rue hold oe predic ff region relat fq distanc ff region fq defin map previou illustr boolean function invalid tupl tupl region distanc ff tupl map invalid tupl import topolog queri express previou oper note long linear concern freeli ad algebra extens present algebra topolog oper linear suggest addit oper connect nest relat adopt uniform spatial data store set ffl defin topolog connect verifi evalu queri defin oper introduc polynomi time user queri languag section present user queri languag exampl queri languag meet requir hide underli complex data model rule relat type restrict nest structur transpar languag direct easi translat design optim gener effici evalu syntax languag reli syntax algebra oper oper set spatial tabl limit set primit introduc algebra augment express power tabl simplifi express common spatial data manipul tabl note simpl shortcut complex algebra primit consid extern function respect algebra oper tabl list algebra oper introduc languag attribut set type fq attribut relat set attribut denot input argument syntax algebra type inter fq fq fq union fq fq fq cross fq fq fq minu fq fq fq restrict oe fq fq proj fq fq empti fq bool tabl syntax algebra oper boolean version algebra simpli defin empti give tabl list primit macro type comment axi fq fq fq section median fq fq fq section dist fq comp bool true comp bool section tabl primit oper type comment max yield min respect variabl fq bool true adjac triangl fq fq singl point output triangl boundari connect region output boundari vertic connect region output vertic tabl easi express min max express triangl section algebra express boundari vertic found select structur conveni express map oper invalid tupl reject select map oper algebra express set point freeli introduc order defin complex spatial queri spatial attribut manipul attribut project oper variabl simpli denot queri user languag illustr small sampl queri commonli accept set typic spatial queri sampl queri follow classif distinguish spatial select topolog spatial spatial function applic set oper includ nearest give complex queri illustr abil handl complex geometr oper give express user queri languag schema stand ground relat simplifi schema geo fq parcel point map oe express simpli denot empti test result oe result select oe return empti cross product empti tupl invalid select note express spatial select window similar give part parcel rectangl map select inter rect part road forest map select inter forest parcel adjac lake join topolog map select lake south orang join direct strategi project orang map oe orang select citi orang cross proj orang map oe orang select citi dist orang nearest citi intuit solut problem select distanc respect citi minim comput distanc function queri languag section queri express citi nearest voronoi polygon li defin median map select express defin voronoi polygon naiv evalu optim obtain effici evalu strategi optim rule present section give road roman region point region triangl defin express defin queri map select road observ naiv evalu comput convex hull strategi clever rewrit queri optim phase give boat km st malo mondai queri relat applic object world evolv queri select mobil boat locat chang time schema relat boat fq compon attribut denot time map oe st malo select citi dist st malo displai coupl harbor connect channel sea model object schema shape fq coordin shape repres depth fourth time map citi select citi union union proj note primit boolean queri region output inform connect compon region region sourc point give subregion visibl queri similar art galleri room model polygon part room cover guard locat point insid assum set type fq set vertic boundari defin assum set type strategi comput queri consist draw straight line point comput set intersect point straight line boundari triangl creat coupl point lie algebra express defin set map comput triangl finit set map final visibl subregion comput map select defin union inter queri process present architectur framework implement strong focu modul involv queri evalu illustr core function queri section exampl show logic express express declar complex geometr oper translat effici evalu classic techniqu tailor spatial queri access path queri rewrit translat logic express physic queri execut plan introduc intric queri naiv express geometr oper relat fundament structur comput convex hull voronoi diagram rewrit rule pattern recognit queri identifi process effici architectur implement top manag system reli exist standard oql evalu part queri attribut queri evalu mechan relat spatial set algorithm access path figur illustr architectur prototyp consist graphic user interfac queri paramet point displai queri result includ map themat data optim lexic syntact analyz queri requir access data dictionari store semant analyz transform algebra express queri execut plan queri processor control split individu oper atom attribut process standard oql spatial data retriev access path process function constraint engin modul dbm provid data storag schema inform optim compon architectur current queri process reli oql standard evalu object valid choic constraint gui displai data queri oql evalu access path semant analysi syntact analysi constraint engin queri evalu queri schema inform result optim processor figur architectur primit constraint manipul carri function call oql work detail descript algorithm involv constraint manipul oql awar specif semant algebra current implement yield process queri mix atom attribut lack spatial index make difficult tailor standard oql evalu queri queri implement evalu principl present suppli adequ tool effici process queri acc path physic primit dbmss provid access path data fulfil physic access scheme hash provid system structur variant structur reli effici cluster featur difficult handl build system top system evalu scheme variant implement store object complet partial obtain heurist insert approach proce simpl grid linear linear order cell automat structur advoc numer paper advantag dbm nativ cluster mechan possibl optim concurr control provid dbm spatial index behav slightli differ data structur classic instanc exact predic spatial index construct approxim geometri bound involv index filter step deliv superset result refin step evalu predic exact spatial object behavior repres rule relat set point appendix physic oper evalu logic algebra express similar commonli found classic relat main differ semant oper appli set point predic filter data subject lazi evalu compli constraint case simpl concaten oper result inconsist tupl invalid carri intermedi evalu step queri execut plan depend lazi oper perform denot normal evalu normal elimin redund detect result set tupl unsatisfi normal algorithm work constraint scan order count number constraint predic equal number type larger tupl equal constraint repres linear object mean constraint defin case intersect comput convex polygon convert constraint place execut plan carri normal process essenti part queri process open issu motiv perform remov invalid tupl final result lazi oper evalu empti set point project set reduc size intermedi result motiv easili introduc rule illustr highli depend cost topic scope paper access path physic reli algebra translat rule convert logic queri effici queri execut plan illustr main principl remaind style sampl repres queri technic materi appendix evalu sampl queri exampl show declar languag classic strategi easili extend handl spatial data highlight issu tupl normal execut queri plan topic specif constraint impact normal strategi effici deserv care perform evalu relat schema geom fq assum index geom exist geom attribut parcel intersect rectangl rect logic express map rect empti test remov rewrit rule consid access path full scan spatial index geom push predic insid index express index express map convert physic physic oper oe norm lazi yield solut express geom rect lazi ea geom rect norm climb oper project express project set attribut result lazi normal express normal simpl relat project suffic rel rel candid differ posit norm oper queri lazi select perform result index normal carri scan constraint concaten evalu process scan spare scan case queri give parcel intersect rect rel rel foo rel rel foo process relat select normal costli choic give part orang rectangl map orang access translat map oper oe orang oe orang geom bound box rect rect index express refin step oper perform lazi normal mode oe orang mode nl oe orang geom rect mode nl appli translat rule select select push express rel orang mode nl rel orang geom rect mode nl postpon normal relat mode set lazi result set tupl final norm oper perform final rel orang lazi nl rel orang geom rect lazi nl remain evalu cost express save full scan part road forest map concentr featur spatial indic limit choic road road forest forest choic exchang join relev synchron tree suggest focu develop express bound box road tupl criteria access forest collect index forest mode nl final classic scan road access spatial criteria bound box spatial attribut current tupl road final perform intersect depend final normal oper process conclud execut queri pattern recognit conclud optim principl reli identif queri pattern frequent spatial queri correspond geometr problem effici algorithm pattern rewritten order exploit effici evalu techniqu illustr optim principl sequel exampl start convex hull finit set point defin instanc queri map complex naiv evalu queri bad complex compar complex effici algorithm base divid conquer strategi follow divid conquer strategi improv queri evalu permit gener pattern defin convex hull union triangl construct set point finit set point rule hold convex hull geometr union set convex definit convex hull union triangl point result declar languag remain show identifi pattern rewrit queri illustr roman rule appendix map naiv evalu result rule map rule hold rule map part queri match convex hull pattern defin rule comput separ convex hull log intersect road linear voronoi correspond class problem finit set point hold pg rule state intersect half plane defin median segment point point set defin voronoi polygon respect tp voronoi point defin rule applic previou rule illustr optim nearest neighbor queri section map appli rule order extract oper map map rule commut map hold map map rule express citi pattern defin voronoi diagram comput nearest neighbor queri order log voronoi diagram comput log map oper scan voronoi collect execut point queri oper averag number edg voronoi polygon bound map oper process stage develop demonstr design spatial system clear separ logic physic design declar queri formal turn develop power optim techniqu prototyp run set geograph applic optim spatial queri express declar languag knowledg address literatur demonstr issu complex queri involv cascad geometr oper rewritten queri lead optim standard algorithm comput geometri design high level queri languag spatial data depend success practic optim declar spatial queri optim modul check larg benchmark applic involv spatial reason acknowledg author michel scholl serg abiteboul care read present manuscript greatli indebt michel contribut begin initi featur refer abel jl smith data structur algorithm base linear kei rectangl retriev problem comput graphic imag catania manipul spatial data constraint intl conf advanc spatial page springer lnc delobel queri languag system int program languag page editor build stori morgan san hp seeger effici robust access method point rectangl proc acm sigmod intl symp manag page ef codd relat model data larg share data bank commun van gucht decid set implic spatial proc acm symp principl freytag view queri optim proc acm sigmod symp manag page san optim redund spatial system intl conf advanc spatial page springer verlag lnc grumbach kuper tractabl geometr data intern confer constraint goodman joseph handbook discret comput geometri crc graef queri evalu techniqu larg acm comput spatial constraint intl workshop program languag rh gute schneider spatial data rose algebra vldb grumbach su queri arithmet constraint theoret comput invit special issu linear constraint queri express power complex logic comput springer verlag lnc guttman dynam index structur spatial search proc acm sigmod intl symp manag page rh gute extens relat system geometr applic proc intl conf larg data base rh gute introduct spatial system vldb oracl spatial data option technic oracl al build scalabl dbm evalu proc acm sigmod symp manag kanellaki constraint program queri languag revesz constraint queri languag proc acm symp principl page van den bussch lossless topolog spatial data egenhof advanc spatial int page kozen algebra cell decomposit np proc ieee foundat comput page architectur proc intl symp page kc grid adapt symmetr file structur acm transact orenstein spatial data model queri process imag applic ieee transact softwar preparata comput introduct springer van den van gucht theori spatial queri proc acm symp principl page selli effici pictori system ieee transact softwar samet design analysi spatial data structur publish compani theori linear integ program sequoia benchmark proc acm sigmod intl symp manag point window queri linear spatial evalu technic report faloutso dynam index object proc intl conf larg data base page scholl themat map model proc intl symp larg spatial lnc page geograph inform system cartograph model montag extens datablad architectur proc acm sigmod intl confer manag jd ullman knowledg base system comput scienc appendix appendix present technic rule relat evalu queri focu manipul specif give main rule algebra express optim reorgan queri order exploit pattern subsequ evalu describ physic languag current implement final translat rule algebra express physic oper defin constitut basi queri evalu optim modul specif complet cost model oper involv queri search strategi defin heurist prune costli topic subject futur work rewrit rule rewrit rule includ classic rule occur relat omit rewrit rule relat behavior oper oper set point rr restructur oper map map remov empti test insid map map map comput separ oper op addit attribut project valid tupl empti check translat rule cascad restructur map map alg alg valid algebra express yield set binari set oper commut map map map map express alg alg map commut map oe map oe address attribut rule special oper push op op op duplic commut map unnest map op op alg express yield attribut type fq physic algebra main specif queri evalu lazi constraint manipul introduc physic oper deal specif ffl normal output ffl true condit exist branch lazi oper node norm node nn nn true output case invalid tupl oper appli symbol manipul mark lazi expon oper carri actual evalu mark norm expon note op norm oper op lazi ffi norm evalu predic carri scan input evalu process success scan notat ffl set relat extend notat handl predic set relat occur ffl set attribut sch rel set attribut attribut domain sch geom set attribut type fq ffl true index built vector ffl true true relat access path type access full index scan direct access tupl address ffl full scan deliv full set unord tupl ffl addr direct access list address addr ffl ip index ip predic deliv set tupl address logic oper consid set physic oper algorithm found map map appli input set algebra oper physic oper simpli denot ffl op op lazi result defin oe distinguish relat select directli evalu criteria constraint select involv complic algorithm evalu lazi ffl rel relat select evalu tupl ffl lazi lazi select make conjunct tupl ffl norm add tupl normal order remov empti tupl rel relat project peculiar algorithm dimens normal project bound box axi result normal fm project input relat return relat variabl elimin norm appli tupl normal usual join nest nest loop index access lead physic oper join rel sm relat merg join assum sort attribut sort oper carri join rel nl relat join join lazi nl join lazi evalu join norm nl join normal evalu lazi nl join relat sort algorithm differ gener join algorithm bound box overlap filter norm nl evalu tupl produc union duplic remov lazi union duplic remov diff rel nl relat differ diff rel sm differ diff geom geometr differ gener notat denot join tupl tupl predic notat cover special join empti predic translat rule rule express translat algebra express logic level physic style access path map rule map op op oe depend type relat relev algorithm appli select map restructur index scan predic augment relat access ff oe rel relat rel access ff oe rel set map mode mode mode map mode relat index permut prefix oe spatial index express form map spatial index attribut address attribut map rule express classic process relat spatial filter refin project set carefulli check attribut empti project tupl valid test lazi oper perform project candid oper proj fm valid tupl project set sch geom norm ffi proj rel relat project geom proj rel algorithm dimens proj intersect cross product oper uniformli translat gener binari match stand convent intersect predic binari match join predic relat index permut prefix ae algorithm reli relat attribut access sch rel sch rel join rel sm loop sort index sch rel sch rel join mode nl mode set map mode nl mode bound box index map map sch geom denot bound box algorithm type trivial concaten possibl duplic remov
IR/1070 5 measur similar abstract problem measur object measur match text document comput overlap complementari applic domain measur similar structur context object base relationship object comput measur object similar relat similar gener similar call base simpl intuit model rank combin similar measur suggest techniqu effici comput provid result applic domain show comput feasibl effect approach introduct applic requir measur object obviou tradit text corpora web similar measur cluster collabor filter recommend system user item group base prefer aspect object determin depend domain definit similar domain document match text collabor similar user identifi common prefer gener approach exploit relationship found domain interest page relat hyperlink similar approach appli scientif paper document corpu inform case recommend prefer item constitut relationship user item domain natur model node repres object edg repres relationship present algorithm analyz work support nation scienc foundat grant stanford jennif widom univ figur small web graph simplifi graph score paramet shown node graph deriv data set comput similar score node base structur context concept made clear shortli intuit algorithm similar object relat similar object object similar relat object similar base case object similar tini web graph shown figur repres web page professor student home page univ edg node repres hyperlink page fact referenc infer previou algorithm base inform gener idea observ conclud similar refer conclud similar continu infer similar univ logic repres comput graph node repres order pair node node point node point point simplifi view shown figur score explain shortli score clariti figur draw singl node union simplif figur explain section run iter algorithm comput call score score node measur similar node repres score thought node neighbor iter propag score step forward direct system stabil score node repres pair similar propag pair pair object similar referenc similar object import note gener algorithm determin similar structur context algorithm appli domain relev relationship object base notion similar relationship similar aspect import combin relat similar similar measur web page combin tradit textual idea appli scientif paper document corpora recommend similar item similar user spend similar combin similar score comput base prefer order produc similar measur main contribut paper formal definit similar score arbitrari deriv algorithm comput score model intuit mathemat insight comput result initi implement real data set show effect feasibl discuss relat work basic graph model provid section relat work structur context analyz specif hypertext classif gener problem find similar object studi inform retriev recommend area bibliometr studi citat pattern scientif paper relationship paper infer noteworthi field method bibliograph coupl similar paper base number paper cite bibliograph similar base number paper cite natur resembl pagerank googl web search engin comput import score web page section discuss pagerank iter algorithm relat work method appli cluster scientif paper topic method cluster web page discuss section algorithm thought gener cocit similar cite document term graph score node comput algorithm entir graph structur determin similar node gener benefici node neighbor document rare properti discuss section comput similar base structur explor specif context work deal pair node graph reli metadata node edg structur relationship iter algorithm web graph comput score web page result show structur greatli improv web search versu text algorithm analyz individu page respect global similar measur analyz relationship pair page classifi web page present classif neighbor web page improv textual classif probabilist model rank comput score pair page singl compar neighbor algorithm limit discret categori comput pure structur score independ inform similar document textual content studi extens field inform retriev discuss section work address similar structur combin textual method process make recommend user base prefer data user collabor filter approach collabor filter reli identifi similar user similar item good overview techniqu includ numer method similar pearson correl found method comput similar set object prefer list list algorithm deal similar context graph structur approach advantag extern inform object hierarchi item categor intuit underli model similar measur base concept provid intuit model pagerank algorithm formal extend model gener properti appli person web search definit properti work survei basic graph model model object relationship direct graph node repres object domain edg repres relationship object web page homogen node repres direct edg correspond refer document document repres user item node direct edg correspond express item person result case bipartit user item side note edg weight repres vari consid work node denot set individu denot individu denot motiv recal basic intuit approach object similar referenc similar base object maxim similar assign similar score object similar human input text similar refer back figur similar referenc univ univ similar note figur similar score node score node obtain similar referenc similar node notic similar score node figur section state justifi basic equat formal motiv section modifi equat bipartit graph recommend system discuss section actual comput valu discuss section includ prune techniqu make algorithm effici section discuss benefit scenario inform limit basic equat denot similar object earlier write equat defin constant slight technic infer similar set defin summat equat equat form written pair object result set equat graph size defer discuss constant equat comput iter pair sum similar pair divid total number normal similar averag similar discuss similar object defin appendix show simultan solut equat exist uniqu defin score object solut equat easi score section similar thought pair pair make connect deriv graph node repres pair node edg exist iff edg exist figur show simplifi version deriv graph graph figur similar score comput mention drawn symmetr pair singl node type node omit figur singleton node effect similar node similar propag node node propag pair pair sourc similar singleton node notic cycl presenc cycl similar flow back similar score mutual reinforc constant thought confid level decai factor simpl scenario page refer conclud similar similar conclud mean confid similar argument hold distinct page cite view term similar flow rate decai similar flow edg section discuss empir motiv basic measur similar difficult reason similar adjust paramet algorithm recogn domain intuit feel comput valu section address issu intuit model bipartit extend basic equat bipartit domain consist type object continu recommend system motiv person itemset graph relationship shown figur buyer bake good recommend person reason conclud similar egg sugar sugar egg figur shop graph simplifi version deriv graph bipartit score shown similar similar similar item similar peopl peopl similar similar item item similar similar peopl equat formal notion analog equat denot similar person denot similar item discuss section direct edg peopl write equat write analog neglect equat similar person averag similar item equat similar item averag similar peopl constant semant equat figur show deriv graph graph figur simplif made figur similar score node comput shown notic sugar similar similar egg node score egg versu sugar normal equat percentag time item absolut number time easi incorpor absolut number section bipartit homogen domain turn bipartit equat appli homogen web page scientif paper bipartit distinct explicit case element role page page import give inform scientif paper similar survei paper cite similar result paper similar result paper cite similar survei paper analog hit associ similar score pair node similar score write equat domain depend domain score combin minimax variat basic equat bipartit encod mathemat notion similar present possibl bipartit inspir real data set find similar undergradu student base histori student group relat due requir comput scienc major group requir cs elect formal present compar meaningless compar cs vice result interest compar elect choic elect choic approach address problem compar similar notat conveni write equat defin intermedi term max max score prefer score prefer good match common similar student requir interest interest similar equat minimax variat analog possibl minimax variat appli equat homogen domain comput naiv method solut equat bipartit graph reach iter number node iter entri length score iter success comput base start lower bound actual score comput equat iter updat similar similar score neighbor previou iter equat valu show appendix converg limit satisfi score experi rapid rel rank stabil iter section fix number iter perform analyz time space requir method comput space requir simpli store result rk averag time requir score updat valu pair correspond roughli squar averag constant respect domain resourc requir bipartit version similar mention typic case expect averag small prohibit larg exce size main memori special disk layout index techniqu techniqu scope paper subsect briefli prune techniqu reduc time space requir prune run experi main techniqu prune reduc resourc requir prune logic graph assum similar score comput significantli neighborhood node radiu typic node small percentag entir domain node node neighborhood overlap tend lower similar score node effect intuit section prune techniqu set similar node node radiu underli undirect graph criteria averag dr neighbor time space complex averag page close dr constant respect type approxim algorithm linear possibl larg constant factor qualiti approxim verifi actual data set case scientif empir result suggest good approxim comput carri main memori corpu object detail found section problem document document scarciti contextu inform make difficult document tend harder human find true unpopular time notic cite interest document unlik simpl effect analyz document contextu inform intermedi score result iter basic algorithm essenti weight score number document cite divid product score success iter thought improv case demonstr answer queri document cite document cite situat shown figur equal similar expect citat equal document rest group page affect similar score document ai cite document similar higher similar figur inform cite shown match similar demonstr case interest document similar document inform complementari case interest gener document includ list document similar case citat safer document inform elimin unpopular document popular document favor queri elimin constant factor equat document high popular high similar score document weigh final result algorithm asymmetr formula sp constant paramet adjust end user section discuss weight scheme note document exampl unpopular idea appli item rare rare random model discuss section import intuit similar score produc algorithm provid intuit model base interest underli model proce directli section show score measur random surfer expect meet node start node randomli walk graph backward detail involv develop remaind section model present context gener direct variat bipartit rank easi deriv leav interest reader expect distanc strongli connect graph path exist node defin figur sampl graph structur expect distanc summat tour start end touch end tour length number edg probabl travel note case special case tour length presenc infinit tour infinit sum expect distanc expect number step random step random reach start expect meet distanc extend concept expect distanc expect meet distanc expect meet distanc expect number step requir start meet walk emd symmetr definit formal exampl emd distinct node figur surfer walk loop follow forev figur meet suggest similar distinct node emd suggest lower similar higher defin emd formal deriv graph node thought present state pair surfer edg origin graph surfer move move tour length repres pair tour length emd simpli expect distanc singleton node singleton node repres state surfer node literatur undirect hit time develop idea differ present sum tour start touch singleton node end end strongli connect case tour summat intuit definit case figur discuss definit problem defin distanc node tour lead singleton node lead discuss solut problem section meet distanc wai circumv problem discuss previou section make surfer small probabl random node graph solut suggest pagerank yield equat map distanc finit comput expect length comput expect monoton function bound domain replac meet distanc exponenti function constant benefit choic valu rang domain equat gener simpl easi solv closer node lower score distanc distanc match intuit similar defin similar base meet constant summat tour singleton node note similar score figur distinct node figur figur distinct node complet graph figur lower score figur show model origin definit score show satisfi equat assum edg graph edg move step backward origin graph aid give intuit inform argument expect distanc idea appli meet distanc pose surfer time probabl written equat term step expect number step travel base case account step travel intuit deriv similar equat show path singleton case easi equat similar flow edg tour singleton node step correspond tour singleton deriv append edg begin biject length length probabl travel split sum step tour write equat ident equat swap solut theorem theorem paramet node meet distanc travel node high score thought common similar result algorithm comput similar score node mathemat properti depend graph structur comput graph report preliminari primari show score fact refin simpler notion structur similar graph structur deriv practic data set experi illustr effect vari paramet algorithm perform scalabl issu extrem score citat score versu iter iter focu paper experi fact run experi larg data set show gener feasibl approach ran experi data set corpu scientif research paper researchindex crawl web research paper content citat inform metadata inform titl paper data set transcript undergradu student school engin stanford transcript list student undergradu averag student featur distinguish definit manifest iter process expect intermedi similar score success iter compar algorithm simpl discuss section similar iter good evalu method measur similar domain difficult perform extens user studi reliabl extern measur similar compar result report simpl approach properti rough metric similar admittedli definit approach serv illustr empir import aspect object domain gener list object similar procedur evalu similar score object algorithm gener set top top object similar algorithm top comput σ similar measur return averag score score figur scientif paper titl score versu iter iter number averag similar top object algorithm decid similar valu rang increment set object candid simpl proper comparison restrict experi object candid averag object randomli chosen measur perform algorithm object differ amount random assign similar averag final score algorithm algorithm simpl scheme scientif paper scientif base extern similar metric σ citat titl similar paper cite common paper common word titl evalu function σ fraction citat cite σ fraction word titl titl titl word stem standard porter algorithm question citat evalu algorithm base citat structur ran bipartit variant algorithm similar paper comput experi valu paramet equat found differ differ absolut magnitud score behavior expect view base exponenti function map distanc finit interv prune creat node share score citat score versu score titl score versu figur scientif paper vari common similar share common similar calcul experi show differ rel rank radiu confirm good approxim make valu found set corpu result shown figur plot score total object intermedi valu comput iter iter number score score shown comparison score initi vector shown provid random rank random baselin iter comput base score thought iter advantag definit similar subsequ increasingli suggest rapid term metric result agreement numer differ observ figur plot final score valu score averag improv simpl evalu measur downward curv show score expect paper similar note high resembl plot metric confirm appropri metric indic similar student data student extern similar metric reason metric student extern metric base σ score depart score versu iter iter iter iter figur iter σ found bipartit minimax variat perform found paramet effect rel rank result shown minimax variat student paramet figur plot score intermedi result total trial poor shown graph score result plot show improv success iter futur work summar contribut start basic domain tween object infer similar neighbor approach gener previou approach comput similar common neighbor wrote mathemat equat formal notion defin score term equat present variat rank applic domain present algorithm comput method reduc time space requir defin model interpret solut relat score intuit properti model base concept expect meet distanc ran experi repres data set result confirm applic algorithm show improv simpler measur number avenu futur work address effici scalabl includ addit prune heurist algorithm approxim differ prune heurist section divid corpu comput accur similar score separ chunk combin global solut area futur work ternari relationship comput similar domain includ professor taught grade receiv student extend entir framework encompass relationship straightforward similar compon similar plan explor combin similar measur refer ricardo modern inform retriev addison john david carl kadi empir analysi predict algorithm collabor filter confer uncertainti artifici juli hanna lisa meet time random walk graph inform process soumen byron piotr indyk enhanc hypertext categor hyperlink acm sigmod intern confer manag june hector jennif widom exploit hierarch domain structur comput similar technic stanford june david david brian dougla terri collabor filter weav inform tapestri commun decemb jennif widom scale person web search technic stanford kessler bibliograph coupl scientif paper american jon kleinberg authorit sourc hyperlink environ ninth annual symposium discret san januari joseph bradlei david jonathan lee john riedl appli collabor filter usenet commun march rai larson bibliometr exploratori analysi intellectu structur cyberspac annual meet american societi inform octob steve kurt lee gile index retriev scientif literatur eighth intern confer inform knowledg kansa novemb random walk volum page societi mathemat sergei hector similar versatil graph match algorithm eighteenth intern confer data san februari lawrenc sergei rajeev terri winograd pagerank citat bring order web technic stanford jame pitkow peter pirolli law electron frontier confer human factor comput gari steve lee gile cluster identifi tempor trend document ieee advanc digit martin porter algorithm suffix strip juli shardanand patti mae social inform algorithm autom confer human factor comput henri small scientif measur relationship document journal american societi inform appendix prove exist uniqu simultan solut equat uniqu solut construct section correct iter algorithm simpl fact valu induct equat fact sequenc bound bound complet axiom sequenc converg limit limit sum sum show limit satisfi equat show uniqu solut equat differ max maximum absolut differ show case case averag score equat term cm
IR/1071 5 broadcast retriev system dave david kirbi steve renal toni robinson depart comput uk research uk uk abstract paper spoken document retriev system british north american broadcast system base larg vocabulari speech recurr network acoust probabilist text retriev system discuss develop realtim british english broadcast integr spoken document retriev system detail evalu perform similar north american broadcast advantag trec sdr evalu methodolog report result refer effect queri automat segment algorithm introduct esprit long term research project area speech retriev concern construct system perform good recognit broadcast speech radio produc multimedia index data princip object project construct spoken document retriev suitabl bbc applic construct system base north american broadcast french languag version develop paper describ develop british american english system british english main target work american english enabl evalu system perform trec spoken document retriev track system larg vocabulari continu speech recognit system probabilist text retriev techniqu section discuss collect applic specif acoust textual data discuss section section outlin bot refer estim pronunci languag model british english broadcast section describ text retriev method attent queri develop automat algorithm segment stream work support esprit long term research project broadcast audio suitabl text retriev result system evalu framework spoken document retriev discuss section implement system section includ issu pertain user interfac approach princip approach task spoken document retriev approach process audio data lightweight speech recogn produc phone transcript kind phone lattic data directli index word spot approach appli complet larg vocabulari speech recognit system audio track produc point problem treat standard text retriev speech recogn project adopt approach spoken document similar emploi group approach requir comput full larg vocabulari decod appli entir archiv enabl constraint pronunci dictionari languag model text retriev robust appli word phone comput frequent cite drawback approach problem word outweigh advantag approach topic past trec evalu queri word vocabulari rel word vocabulari experi report paper rate correspond typic observ recogn broadcast data data collect cover wide rang speaker acoust textual data train british english version gather varieti bbc current affair programm tal hour record programm major radio bulletin programm polit natur transcript carefulli check ensur accur repres standard practic depart normal practic ad fine granular time end sentenc speaker found labour intens time major acoust condit note ad synchron mark minut develop speech align softwar time inform provid word phone align textual data acquir wider rang sourc centr access bbc text provid materi march onward supplement materi relat programm total sourc provid million word speech recognit system develop cambridg sheffield develop differ system acoust model base connectionist network typic recurr network train data applic word pronunci trigram languag model characterist make suitabl spoken document retriev applic includ realtim close decod low latenc simpl architectur evalu system broadcast task connectionist acoust model outlin develop british english broadcast north american broadcast system acoust acoust model train transcrib corpora order reduc manual effort check transcript filter train data measur confid align fact true transcript confid measur chosen simpli averag log probabl label phone scope measur pronunci pronunci dictionari similar beep includ common acronym case depend entri facilit process check dictionari accur pronunci conduct ir experi compar scheme languag north american broadcast languag model construct involv estim languag model text data provid evalu process data british english system trigram languag model north american text british english newspap newswir data million word transcript script bbc current affair output million word mar sep transcript cnn output million word search space huge bot system adopt stack decod search strategi embodi decod search algorithm make direct posterior probabl estim produc neural network acoust model prune phone estim local posterior probabl threshold develop decod search task recognit run unix averag decod typic memori usag import task final system target hour audio show decod effici memori usag decod show enabl onlin acoust altern common techniqu confid measur decod continu audio error rate vari order magnitud integr confid measur weight term frequenc compon text retriev cross sentenc decod common languag model special sentenc boundari give symbol acoust short period silenc decod sentenc fit desir function multipl sentenc decod speech recognit primari object effici inform retriev speech recognit perform weakli correl goal section give word error rate configur system case prepar accept wer order system perform tabl show wer system evalu bbc bbc februari baselin system set run languag model onlin acoust cross sentenc decod emploi confid base train acoust model baselin wer higher report north american broadcast system part decod complet broadcast score singl hypothesi transcript time system show make error order run speed desir select train data languag model perform decod improv error rate slightli system wer baselin system train data north american lm tabl word error rate variat baselin british english system text retriev inform retriev compon base probabilist model document produc speech recogn preprocess stop list porter stem repres bag process term okapi term weight function match term document cw frequenc term document normal document length dl length document number term term measur proport collect refer collect frequenc log number document collect number document term paramet control influenc document length term frequenc weight function set spoken document retriev work typic valu queri repres bag term match document queri obtain sum term queri collect rank respect relev queri queri bag word relev document term document retriev aim queri reduc mismatch expand queri word phrase similar mean statist relat set relev document procedur greater import spoken document word mismatch problem presenc error automat transcript spoken document obviou danger relev document retriev automat transcrib spoken document queri includ recognit error avoid problem secondari corpu document similar domain recognit error applic obviou choic corpu newswir newspap text secondari collect rank respect queri queri algorithm appli rank find term secondari collect largest mutual inform relat queri term interact human mark document relev document train data relev feedback queri approach pure automat relev judgement assum top nr document relev process term feedback base local context analysi algorithm xu croft queri weight term queri secondari collect base nr top rank document secondari log potenti queri term simpli term relev document term measur term frequenc correl term collect document nr nt term largest weight ad origin weight note algorithm document practic valu nr nt maximum threshold document score greater time score document term averag effect queri transcript queri figur effect queri term chang averag compar queri recal sdr queri figur effect queri sdr refer transcript output recogn greater threshold ad experi queri algorithm sdr corpu figur show effect interpol curv refer speech recognit effect queri sdr evalu shown figur segment speech rare arriv mark segment speech recognit research control trec includ hand segment broadcast featur typic applic corpu collect bbc applic record segment develop sdr system enabl object evalu automat trec sdr corpu relev judgement segment adapt enabl automat segment experi simul unseg condit segment stori segment boundari remov side effect remov due materi sport automat segment document time index segment enabl trec relev judgement time index convert origin document id evalu time substanti amount work automat segment document text retriev callan zobel investig socal passag retriev document broken passag typic document markup window fix number word algorithm automat segment document semant separ topic investig recent benefit retriev includ retriev relev portion longer avoid normal problem possibl interfac return relev portion document claim passag retriev improv averag return short passag highest queri word densiti princip problem passag retriev segment possibl dramat number collect situat spoken data text kind prosod analysi kind coarser level averag topic length shorter broadcast compar text document investig straightforward approach automat segment window base time number word case rectangular vari length vari overlap initi experi carri sdr queri standard system result averag figur show averag vari window length rectangular window base fix time interv fix word length maximum averag system occur short window length word overlap depend averag window length overlap smoother window experi repeat window paramet queri la washington post corpu broadcast data corpu manual segment stori queri expand top term top document section queri averag data similar improv automat segment case document queri tabl final experi appli automat segment queri corpu word window overlap result shorter queri document number relev document queri method work averag rise dramat averag segment document high result manual segment averag segment document passag queri tabl evalu direct evalu system bbc difficult trec methodolog pool relev assess difficult implement singl make accur recal statist difficult obtain bbc data transcrib medium word error rate relev assess twofold strategi evalu north american broadcast system evalu bbc system result bbc system report tabl report result sdr includ automat segment note paramet segment window develop evalu set note automat segment result rel reduct averag compar passag retriev word secondari queri collect result small improv averag compar document boundari collect consist result report queri averag segment manual time word document manual document time document word passag manual passag time passag word tabl averag sdr evalu data condit includ queri queri newswir corpu time washington post passag document manual segment automat segment base fix rectangular time word window demonstr system current system bbc speech recognit inform retriev strategi discuss queri perform secondari collect deriv british press associ rectangular window automat segment addit standard keyboard interfac submit experi spoken queri interfac assess system practic easi user access requir offic environ dictat access gener desktop pc essenti web browser interfac keyboard initi queri approach permit spoken queri interfac assess aspect assess control condit dedic workstat system conveni implement dedic central system core function speech recognit index carri automat daili basi size fact updat programm requir window size unseg averag time window overlap averag window size unseg averag word window size overlap averag figur effect averag automat segment window length ful amount data process handl practic decid build main english languag main bbc broadcast radio channel amount hour audio mean full output cover major break stori dai result size larg assess effect speech retriev oner manag prototyp demonstr workshop base archiv hour bbc output refer recurr network continu speech automat speech speaker recognit advanc topic ch pp kluwer academ battl proc sixth text retriev confer pp sparck cambridg spoken document retriev proc ieee int conf speech signal connectionist speech hybrid approach kluwer system transcript broadcast proc darpa broadcast william measur deriv acceptor proc pp renal search larg vocabulari continu speech ieee tran speech audio press robinson search larg vocabulari speech proc ieee int conf speech signal robertson sparck proven approach text tech rep cambridg comput xu local global document proc acm evid document proc acm pp retriev proc acm segment text comput vol pp van hidden markov model approach text segment event proc ieee int conf speech signal
HCI/1072 4 autonomi autonomi symbol system evolv lui rocha complex system model comput research applic group lo alamo nation ms lo nm usa lui york academi scienc press abstract type agenc discuss base dynam coher coupl environ privat syntax discov dynam coher interest type closur autonomi syntact autonomi process select evolut enabl agent addit symbol ad level dynam interact environ syntact autonomi enabl interest type closur agent share syntax investig studi emerg syntax dynam experi cellular automata lead emerg comput solv task discuss rna edit mention process obtain biolog code evolut evolutionari dynam artifici cellular genet situat rna edit closur agent understand closur evolutionari distinguish evolv system typic includ system notion closur discern sort autonomi system environ establish system context evolutionari understand natur distinguish system capabl evolv separ system environ refer autonom place kind loop system environ ii separ impli kind start discuss notion agent term agent todai mere subroutin consciou entiti agent web retriev comput robot agent ventur agent object refer agent possess distinguish environ kind function boundari possess kind ident identifi environ make definit agent requir agent autonomi engag task environ direct extern control lead import definit agent xiii due thoma entiti capabl choic import definit entiti refer step dynam make action natur environ choic term load connot cognit prefer discuss abil agent step dynam interact environ explor behavior altern physic refer process dynam comput von base work ture comput refer system system system capabl engag environ concurr interact memori store descript environ agent dynam state action sole depend previou stabl memori access chang dynam interact iii system dynam coher environ function reaction present input state iter map state space refer view agenc dynam engag coupl strong view agenc ident autonomi dynam present discuss type closur identifi ii discuss type evolv refer iii stabl memori materi dynam level stabil memori token rel stabil dynam coupl memori token discuss detail coher coupl weak agenc strong agenc explicit requir memori abil effect explor select altern weak agenc subject definit ident larg arbitrari dynam coher discuss posit exist symbol memori token establish identifi autonomi turn lead evolut dynam coher situat process system compon tend reach set cycl small volum state space extern attractor behavior recogn level observ spontan format organ random initi condit system studi behavior refer discret dynam system current state depend previou state possess larg number compon state space comput model physic matter construct boolean network cellular automata transit rule interpret law physic chemic system observ attractor behavior matter selforgan matter law physic model emerg characterist word matter materi understood reflect notion physic comput environ emerg semant emerg attractor basin refer observ access system perform classif classifi neural selforgan system produc dynam stabil interact rout observ interact small set attractor basin produc small set behavior system classifi environ small subset behavior process obtain classif environ refer gener emerg classif emerg result interact basic compon system dynam interact environ dynam coher coupl system environ establish semant attractor state lead small set behavior produc selforgan system classifi cope environ attractor state refer observ discuss emerg pursu select effect deal chang system capabl relat intern stabil chang dynam order produc basin attract classif behavior system structur coupl extern system act structur induc form explicit implicit select dynam process refer select select occur intern vehicl classif altern rang attractor landscap system offer altern conceptu attractor landscap distribut memori bank attractor basin store classif configur abil system select dynam classif configur deal chang environ refer dynam coher select dynam coher categor context cognit scienc biolog select implicitli defin rate reproduct individu vari cognit realm form explicit select refer learn simpl appli extern algorithm select weight neural network order achiev desir evolutionari strategi reli intern random variat ultim extern select select explicitli dimens system dynam coupl environ classif impli semant select impli pragmat influenc dimens mean classif system make ground feedback repercuss trigger environ dynam coher agent environ sourc mean select act memori token intern classifi system repercuss trigger environ semant dynam coher agent pragmat mean privat agent understood context situat environ specif select pressur abil coupl select attractor state cope environ closer select behavior altern select requir select process iv amount agent real altern notion select lead kind select process importantli present choic altern exist requir kind autonomi iv studi select process outlin extens discuss left futur work dynam von neumann syntact advantag von model criteria evolut base notion construct descript threshold complex system observ complex unlik situat agent dynam coher environ model reli distribut local kind memori von descript entail symbol system construct command cast descript distribut pattern activ compon local structur time sort random access memori compon dynam state set arbitrari semant relat environ genet system von model conceptu sequenc equal inform larg independ dynam behavior sequenc genet inform express dynam sequenc dna mediat arbitrari code relat translat sequenc sequenc dynam characterist ultim express genet inform environ dynam irrelev sequenc make ideal candid local carrier genet inform arbitrari genet code dna carrier genet inform biolog organ virtual dynam inform construct protein retriev time book retriev librari recent organ carri gene organ produc protein role inform dynam substrat gene dna larg irrelev von neumann show advantag local memori pure memori symbol descript direct organ replic part system grow difficult exist symbol sophist form replic dynam structur replic simpli construct descript part enzym replic properti assembl pool exist part intern portion copi produc genet complic function molecul simpli fold messag method detail discuss model gener function molecul produc happen unfold fold reproduc part genet symbol util open behavior function pure dynam evolv behavior function describ genet protein produc introduc level classifi system situat syntax defin construct code type select coupl refer select argument idea languag provid enabl syntax cognit system recombin distribut memori system manner pursu comput system activ recommend inform network develop model cognit categor cognit type coupl capabl refer select evolutionari process result semiot coupl biolog cognit level yield activ passiv evolutionari trend beg identifi model descript materi code vi von neumann notion construct comput scienc construct level complet program scheme descript encod complet blueprint automata construct constructor automaton complet specif construct automata actual machineri genet select live system term descript speak biolog gene encod complet specif protein mean produc gene encod inform fold protein free law matter true physic encod physic law henri warn comput gene descript data dynam machineri cell explor issu detail von constructor interpret descript construct semiot code util map instruct comput action perform copi syntact aspect replic languag code set comput primit instruct descript depend set comput primit interpret devic set primit complet ture establish process vi issu meant descript moreno meet issu fundament argument pursu section bypass nonetheless interest topic point materi construct code genet code set materi primit follow physic law materi code refer materi constitu chang alter descript materi organ von scheme symbol control materi constraint close semant repercuss environ howard call principl semant closur descript refer semiot closur semiot dimens pragmat syntax account materi code defin number symbol encod finit number primit part countabl number function structur construct set part defin power materi symbol system code potenti infinit number product construct product dynam symbol dynam characterist ultim messag encod stand arrang part part arrang dynam form complex dynam compound physic law materi symbol system ti specif construct build block richer smaller requir smaller number construct product conrad refer tradeoff programm high evolutionari plastic effici comput resourc von neumann simpl build block gate build code turn requir state cellular automata lattic complic descript arbib simplifi von model greatli util complic logic build lose gener genet system describ characterist protein chain function configur reactiv properti set part amino dynam rich symbol system construct command cast make descript smaller establish higher evolutionari plastic cost plastic effici abil genet code thing construct chain establish nonetheless materi symbol system describ conceiv chain von neumann util symbol lead evolut easili model abil compress descript symbol system base richer dynam part defin comput code complet encod build block artifici life indirectli encod genet genet descript encod cellular boolean solut interpret higher level observ simul specif show kind indirect encod solv optim problem smaller observ materi system descript materi specif encod initi condit constraint materi comput cellular system descript semant closur symbol control materi constraint view genet inform data machineri cell escap comput add metaphor conceiv machineri cell comput data neumann view genet inform descript initi condit reason symbol materi aspect evolv system delin symbol descript encod materi constraint initi condit view select treat descript program encod process argu random access memori genet system complic syntact dimens result subject observ similar argument pursu discourag kind theori complementar notion requir argument level result necess complementari mode descript describ observ pattern regular level rule stop genet dimens establish hierarch level evolutionari system greater level control pure dynam fail recogn symbol prevent distinct system live system replic genet memori effici replic templat evolutionari system core claim natur select sole explan evolut stress aspect evolutionari plai import role group stress symbol sole drive forc evolut group matter histor equal import evolut pragmat evolutionari acknowledg factor plai import role aspect evolutionari system theori model incorpor symbol dynam characterist conceiv evolv agent pure observ dynam coher select discuss capabl semant emerg select environ introduct syntact level prescrib von neumann defin richer evolut agent capabl full situat environ section discuss autonom agent weaker syntact autonomi semiot lead symbol simpli abstract memori materi tool situat classifi system requir definit compon interact law environ semiot code pure dynam system mysteri biolog cognit comput experi investig emerg symbol activ code present recent result discuss implic notion semiot select autonom agent agent particip close loop agent environ classifi system autonom process establish sustain dynam intern produc system capabl autonomi closur system abstract demand point arbitrari identif boundari kind system environ behavior situat agent coher result product rule agent law environ autonom system follow form situat argument select environ ultim select dynam configur classifi system dynam coher coupl system environ situat base requir pragmat extern scaffold semant defin conjug system situat agent dynam semant autonom semant loop closur establish agent entir discuss situat semant pragmat situat semant closur observ creat loop agent entir abandon notion altogeth adopt pure dynam view agent indistinguish dynam compon network compon accur dynam system theori explanatori scheme vii kind profound semiot autonomi closur evolutionari system requir level explan model dynam system biolog system develop system structur perturb base code essenti implement von scheme symbol descript syntact code complet organ read construct machineri found autonom code defin specif syntact rule condit affect decod circumst code remain fix abil gener power system assembl encod compon vii paper discuss autonomi closur term dynam term agent environ autonomi closur discuss term thermodynam understand import explanatori nonetheless theoret describ phenomena explain live system construct evolv classifi defin characterist life produc code autonom syntax effici situat environ includ syntax situat agent environ discuss speak kind autonomi closur identifi entail interest type closur introduct syntact code kind recombin dynam descript construct organ lead evolut includ scheme von neumann commun descript system possess semiot code interest type closur agent enabl semiot loop closur establish agent agent share syntax includ entir environ biolog organ share genet establish full semiot closur syntact dimens includ agent produc human protein kind technolog find tighter semiot closur organ commun recombin genet descript effect pure situat agent exist dynam coher possess week agenc autonomi environ dynam intertwin environ semant emerg repercuss situat action environ physic semiot autonomi semiot loop closur identifi includ entir environ includ dimens section identifi interest type autonomi closur group agent agent possess syntact reli exist symbol memori possess element dynam environ strong addit dynam situat predecessor question symbol dynam substrat approach studi process syntact autonomi comput environ emerg particl comput interest problem genet algorithm successfulli evolut cellular automata rule solut task ca rule capabl solv global task assign transit rule local cell comput current cell task refer densiti randomli initi lattic configur ca converg global state cell turn major cell state rule trivial local rule compon cell access entir act state neighborhood mitchel ga evolv ca rule task ga found number fairli interest run evolv interest rule high creat intric system lattic commun group adjac cell propag pattern interact pattern solut lattic intric system signal pattern commun syntax establish emerg comput evolv emerg signal refer border pattern develop diagram area insid pattern boundari identifi system signal definit emerg logic grammar syntax base small number small number rule mean signal signal result refer refer detail experi interest interact select simpl semant emerg select pragmat ca rule classifi initi lattic configur correctli incorrectli ca rule evolv set show simpl solv problem larg neighborhood state exist initi expand block rule solv task typic dynam account local inform system particl comput signal capabl integr distant global inform solv task ca rule reli system grammar signal commun lattic comput answer sign system grant great select advantag rule capabl develop particl comput system introduc qualit solv emerg rule gain access global lattic inform system possess rich scheme von show emerg syntax grant simpl dynam system abil move trivial classif interact environ logic task signal emerg particl comput system small set discret symbol section possess arbitrari requir pure syntax specif task solv similar signal grammar evolv solv synchron task class develop similar signal solv problem arbitrari emerg syntax evolv rule good solv task conduct experi evolv ca rule radiu solv densiti task relat logic task implement logic divid ca lattic halv center cell half interpret half bit bit major cell notic boundari condit lattic lattic boundari halv bit cell neighborhood boundari comput valu cell case make comput boundari global commun expect local error boundari relev global lattic grow size defin logic task valu bit valu bit lattic converg bit task relat densiti task densiti halv bit lead desir final lattic cell differ case halv lattic densiti task perform densiti task integr task inform half rule evolv ga initi popul rule evolv densiti fit function deriv present rule initi analyz densiti task rule present densiti task densiti uniformli distribut unit interv experi rule present task uniform distribut lattic lead bit bit gener time case bit make rule tend favor rule evolv solv densiti task logic task unlik densiti perform logic task lattic boundari error earlier relev case densiti situat bit larger lattic resolv expect behavior consequ tabl perform gener ca lattic dimens rule rule fed initi popul ga rule rule evolv ga rule den veloc particl analysi left futur research detail analysi particl comput system recent evolv rule forthcom tabl present rule evolv format digit convert binari digit obtain ca left bit relev experi show famili particl comput rule mutat develop system particl comput solv task rule evolv popul rule solv densiti task particl comput system ca abil adapt environ requir solut similar task abil evolv system syntax effect solv relat class problem singl task case class task includ densiti task logic task coher densiti task abil solv task arbitrari emerg syntax syntact rule particl comput comput task arbitrari show system develop larger scope comput particl regard arbitrari symbol recent result experi conduct wim viii show set particl grammar discov solv task scope task ca rule grant higher arbitrari surviv abil respect demand environ requir task solv particl comput cope chang environ requir pure dynam ca strategi rna origin syntact autonomi discoveri messeng rna molecul inform code persuad research molecular biologi mechan cell alter genet mechan call rna edit coin illustr alter rna sequenc occur region result page term identifi mechan produc molecul inform specif encod dna term refer insert delet base sort base rna edit good review refer idea life origin pure rna world scenario life form reli rna molecul symbol carrier genet molecul hypothesi function rna edit assum rna world origin life posit rna edit offer process dual role rna molecul inform carrier catalyst easili kei problem rna world origin life hypothesi separ function rna hand rna molecul viii recent experi publish stabl carri hand reactiv perform function rna mean fragment genet inform rna edit integr reactiv molecul understand process mediat role rna molecul inform carrier molecul base rna offer clue problem origin semiot code dynam substrat random distribut reactiv rna sequenc studi easili reactiv sequenc construct rna edit molecul studi process forthcom discuss notion closur autonomi evolutionari agent term dynam term agent environ base work von privat syntax discov agent exist dynam coher situat environ includ agent stage interest type closur autonomi syntact autonomi select evolut establish agent depend symbol ad level dynam interact environ syntact autonomi enabl interest type closur agent share syntax particl comput cellular automata experi discuss studi emerg syntax dynam rna edit mention process obtain kind syntact autonomi code refer cliff control closur complex semiot york academi scienc volum lui cliff artifici virtual world simul confer landauer kl bellman societi comput pp st thoma introduct st thoma modern random howard limit formal model appli mathemat comput vol pp lui semant close commun cognit artifici intellig vol pp lui system research vol pp lui evid set contextu genet explor context embodi cognit biolog system phd dissert state york binghamton lui semiot evolutionari evolutionari biolog epistemolog perspect select van de kluwer academ pp origin select evolut oxford press van tim survei concept philosophi connectionist theori ramsei al lawrenc erlbaum lui recommend intern journal human comput studi lui cybernet human pp von theori automata illinoi press howard semant commun cognit artifici intellig vol pp jon guid notion ground artifici advanc artifici life jj pp sign languag mean dna houghton lm rocha consensu select cybernet intern journal vol pp dw chang morpholog complex vertebr evolut vol pp dw evolutionari evolut vol pp sj full spread excel darwin river press artifici life iv brook mae mit pp cellular comput program bulletin mathemat biologi vol pp howard evolutionari approach cognit brain theori vol pp michael theori guid interfac comput human system research vol pp ma simpl inform control vol pp ma theori part theoret biologi vol pp frank beer evolv model develop autonom agent artifici life iv brook mae mit press pp metabol artifici life iv ra brook mae mit press pp selfish gene oxford press dc darwin danger evolut mean life simon schuster battl scientif revolut simon stanlei develop complex biologi mit press perspect comput dynam debat cognit twentieth annual confer cognit scienc societi embodi autonom joint confer scienc technolog intellig system ieee press jp mitchel evolut emerg proc nation comput scienc vol pp pr emerg genet code physic journal theoret biologi vol pp varela tree biolog root human understand scienc librari stanlei role select theori understand evolutionari evolutionari system van de kluwer academ publish dynam system perspect artifici intellig vol pp andi put world mit press insid origin agenc cybernet human vol lui genet evolv advanc artifici life jj springer pp jp mitchel comput evolv cellular physic comput press santa fe institut preprint van den jpj jh van mc transcript gene encod cell vol pp rna alter protein code sequenc rna elli horwood publish gj evolut rna edit acta vol pp step perspect evolut oxford press life molecular evolutionari advanc artifici life jj pp
DB/1073 3 model infinit granular jef wijsen universit de abstract concept time granular defin glossari time granular concept publish definit view time granular sequenc time granul view conceptu extrem ineffici practic imposs repres time granular manner present practic formal finit infinit granular formal symbol extend multipl dimens space introduct formal repres reason tempor spatial granular develop area comput scienc research definit time commonli view time granular possibl infinit sequenc time time granul subset fix time domain al jajodia wang al time granular defin map integ number subset time domain defin time granular possibl infinit comput partit natur number definit conceptu address import practic repres infinit structur finit amen manipul comput complex problem involv granular depend effect time granular glossari al problem partial address concept period slightli adapt glossari granular finit repres term copyright fl american associ artifici intellig reserv suffic granul consist granul granul coincid granul pattern repeat granul de investig express extens basic formal challeng import issu deserv attent reason effici period granular granular lattic time granular defin term easili comput supremum infimum studi depth period pattern relat reason problem simpl syntax effect describ infinit time granular syntax call filler call call separ granul construct filler delimit separ repeat pattern introduc denot gap symbol denot gap recogn gap repres common time granular typic granular repetit period separ weekend gap formal account finit infinit repetit finit pattern busi week work dai saturdai free dai figur show time instant repres time instant fridai time granular time instant observ repeat pattern consist weekend work work week gap tuesdai wednesdai repeat pattern denot tt infinit repetit offset repres granular order pair compon figur granular repeat pattern current tt call common practic repeat pattern coincid granul formal repeat pattern start end middl granul time granular repres figur repetit tt empti offset end repeat pattern coincid end granul granular present interest question address shortest verifi distinct repres question concern reason time granular formal interest perform reason task symbol manipul time granular construct found literatur typic formal extend multipl dimens extra dimens tempor spatial tempor time call transact time valid time spatiotempor spatial tempor dimens dimens typic olap ng extens concern move infinit string infinit natur repres granular level tempor structur investig area tempor logic argu practic problem infinit circumv fix end date decemb line reason miss import point fix end date end date complic reason task result incomplet granul granular paper organ notion granular regular granular defin class granular granular repres introduc uniqu canon turn descript comput regular granular perform symbol manipul extens give theorem proof term automata induc ultim period word alphabet og link theori word applic result granular view time isomorph natur set natur number denot start point approach time granular rao granular constitut partit set granul finer granular unlik definit granular partit relat construct defin granular possibl infinit relat subset class interleav wrt natur order class time granular figur time granular pair mean belong definit granular relat subset distinct explicit index set easili deriv granular figur obtain argu previou absenc explicit index set simplifi reason issu common relat time granular coincid set set granular order set lattic theorem set order lattic fr granular rg set granular close intersect granular coincid infimum supremum coincid set granular close union lattic granular infinit studi assum finit partial order granular al calendar order pair finit string alphabet string repres repeat pattern defin infinit string relat infinit string repres establish function ff ff infinit string repres ff ff trace produc ff ff ff trace produc fi ff fi denot ff jt fi definit fix alphabet og symbol call filler separ symbol string sequenc symbol alphabet denot string empti string denot string concaten defin usual finit string time ww length finit string denot finit denot number occurr denot cardin set fi jvj og symbol finit string denot pair finit string call offset repeat part trace produc denot equal infinit string ff fi denot ff jt iff ff fi string infinit symbol repres granular relat infinit string granular repres establish function string infinit granular repres symbol symbol filler separ filler string produc ff introduc repres granular class granular repres trace produc fl ff fl denot ff jg fl note ff fl substitut string chang granular repres definit infinit string denot number occurr symbol equal notat finit string string infinit symbol induc denot iff exist separ occur posit granular express call regular granular ff fi denot ff jg iff tabl show string introduc figur separ occur posit theorem string infinit granular granular show linearli repeat pattern time instant case common busi granular class regular regular granular repres show ff fi fi align ff jt fi fi align ff jg fi figur overview ff fi ff fi impli ff jt ff jt fi turn impli ff jg fi true ff jg fi impli ff jt ff jt fi impli ff ff jg fi impli ff fi theorem transform preserv jg jt theorem placehold ov jg ov ow jg ow ov jg wt ow jg jg jg ow jg jg jg ww jt jt address decid ff fi defin uniqu canon ff fi share canon form canon form introduc step defin align separ directli filler produc trace show ff fi ff jg fi impli ff jt fi canon defin restrict class align step summar figur align ff align occurr ff immedi occurr eventu occurr definit ff align iff satisfi repeat part occurr ff ff ff ff ff theorem align iff string theorem state align achiev theorem exist align fi ff jg fi obtain desir result theorem ff fi align ff jg fi ff jt fi proof theorem appendix canon align theorem introduc canon form distinct canon repres distinct granular canon align offset repeat part end repeat part repetit smaller pattern definit canon iff impli canon form achiev theorem exist canon fi ff jg fi proof ff theorem exist align ff ff jg ff repeat applic obtain ff canon ff ff jt ff canon form proof theorem appendix state desir result regular granular repres uniqu canon theorem ff fi canon ff jg fi ff fi easili check rewrit canon form test canon ident length canon compar align requir lengthen align canon shortest align theorem canon align jg jvj jv jw align offset shorten move symbol repeat repeat part shorten repetit shorter pattern result show possibl symbol comput theorem state set granular order lattic lattic turn reason tempor function depend al wijsen reason problem involv comput lower upper bound lattic product process number failur product process number failur report busi busi week index number failur process number failur month time total number failur number failur interv number failur interv time imposs exact total month divid evenli busi time interv evenli divid month busi exact sum obtain interv granul supremum busi week month effect construct show set regular granular order set coincid finer lattic shown theorem bottom top element repres theorem provid effect construct supremum show formal comput supremum regular granular symbol manipul combin infinit string observ occurr occur granul string tt tt tt tt figur insert separ front occurr chang granular repres separ repres tt occurr occur subsequ occurr occur granul observ gener definit definit string infinit symbol separ iff string obtain insert separ front string shown figur separ figur show calcul supremum infinit string supremum repres string symbol align symbol filler symbol gap separ copi separ vice versa separ copi separ separ copi separ definit string infinit symbol write string obtain remov separ ts tt figur supremum construct theorem string infinit symbol infinit string lattic granular order iff ffl ae ffl separ iff separ combin discuss comput supremum granular form ff fi combin ff fi explain previou section string result combin ultim period difficulti concern delimit string offset repeat part figur string produc canon tt note singl occurr offset supremum occurr offset produc canon assum supremum correspond number symbol offset repeat part loss ff exist align ff fi ff fi correspond number symbol offset repeat part ff fi ff fi ff jt ff fi jt fi ff fi symbol symbol repeat part theorem ff ff exist align ff ff ff jt ff ff jt ff ff theorem distinguish offset supremum string repres supremum theorem ff fi granular occurr infinit string smallest number smallest number posit note theorem impli comput suffic symbol ff tt fi figur filler symbol filler symbol theorem symbol occur posit note symbol occur posit offset supremum found repeat part extens repres granular infinit string sketch natur extens infinit string granular model extens concern infinit tree granular express term singl base granular natur defin granular term defin base defin term defin term natur flat model granular layer area tempor tempor structur underli structur logic unlik linear time tempor deal time granular extens deal multipl dimens extra dimens tempor spatial air traffic statist subdivid control regular corridor comput number daili flight corridor involv tempor spatial dimens suffic replac string empti ff produc trace shown class extens higher dimens defin line present formal finit infinit granular linearli repeat possibl gap granul granular express string alphabet introduc uniqu canon form turn granular show reason task perform simpl string manipul formal extend natur multipl dimens acknowledg anonym provid number valuabl comment refer de symbol time granular proc int workshop tempor reason ieee comput societi press glossari time granular concept tempor research number lnc survei gener framework time granular applic tempor reason annal mathemat artifici intellig gener structur tempor domain tempor aspect inform system effici support tempor granular technic report tempor logic de liber birthdai johan van benthem logic design tempor multipl granular acm tran system tempor depend gener spatial dimens proc int workshop manag lnc springer reason qualit trend inform system tempor fd complex object acm tran system proof theorem proof assum ff fi align ff fi ff fi ff fi case role ff fi ff fi fi fi ff ff fi ff fi ff jg fi show induct ff fi base situat depict figur ff ff align fi ff fi figur construct base theorem ff fi figur construct induct step theorem fi align ff ff contradict conclud ff fi ff contradict conclud fi induct step induct ff fi situat depict figur ff fi ff fi ff belong ff contradict ff fi belong ff contradict fi conclud induct step ff fi ff contradict conclud contradict ff fi ff fi ff fi proof theorem give recal result theorem power common left factor length equal power word proof theorem proof ff fi canon ff jg fi ff fi ff fi ff jt fi theorem case jvj jvj jvj jxj case similar jvj jxj string www www ff fi contradict jvj jxj www theorem string ff fi ff fi contradict
IR/1074 5 maxim coverag mediat web queri yerneni stanford felix naumann zu berlin hector stanford abstract mediat built larg collect sourc provid integr access web content order minim visit larg number mediat subset sourc contact process queri fewer sourc particip process mediat coverag queri studi develop techniqu mediat maxim coverag queri time visit subset sourc formal studi algorithm solv analyz theoret perform algorithm studi perform algorithm simul experi introduct web sourc provid limit inform type inform sourc search lyco northern light yahoo search engin index larg number close cover entir web recent articl report northern light cover web yahoo lyco cover similar web store offer limit digit librari focu topic ncstrl comput scienc technic goal coverag queri pool inform multipl sourc provid search engin broader construct mediat engin user submit search queri queri search northern yahoo lyco result queri integr construct answer user queri mediat addit process integr rank result user person prefer criteria benefit queri coverag queri comput larger bodi yield result user web page singl search engin metric web page engin index mediat potenti find larger find page interest user note user data mediat singl engin case user link web mediat answer higher qualiti effect expect find low price cd consult multipl music compat date visit multipl servic factor complic mediat process inform sourc charg coverag trade higher sourc provid overlap sourc necessarili sourc temporarili figur coverag low price hard briefli describ issu turn web sourc offer free servic end charg servic commerci mediat search engin gener substanti portion revenu popular model charg base number page view metric thousand standard yahoo quot mean charg thousand page view user inform search engin effect lose chanc displai lose revenu opportun mediat make revenu case displai result user screen order loss search engin enter arrang mediat search engin charg mediat amount monei thousand queri receiv mediat order reduc mediat decid submit user queri subset inform provid coverag queri case coverag cost crux problem studi paper develop techniqu mediat achiev highest coverag queri cost limit impact heterogen cost sourc search engin valu charg differ mediat queri variabl cost complic problem significantli sourc mediat simpli visit sourc descend order coverag cost mediat smaller sourc larger cheaper complex factor deal overlap coverag search engin index web page mediat effect pai multipl time page depend profil content overlap mediat select sourc provid inform low cost good idea search northern light northern light lyco index fewer page yahoo charg queri lyco overlap northern light yahoo complex factor potenti intermitt sourc unavail queri web sourc timeout transient problem sourc network congest mediat gather inform rest albeit poorer coverag sourc unavail complic problem significantli illustr mediat built top search northern lyco excit cost limit queri sourc cost impli queri sourc content overlap search engin option mediat visit combin northern light lyco combin yahoo excit mediat pick option queri northern light mediat realiz lyco unavail mediat switch option visit yahoo queri visit northern light note mediat find sourc unavail simpli sourc web sourc time answer machin ping physic machin web sourc resid give mediat inform unavail sourc answer queri find send queri sourc request timeout charg made charg servic find sourc problem achiev high coverag mediat queri challeng due arrang introduc sourc content sourc unavail studi problem techniqu solv effect make formal defin problem studi complex show simpl case problem prove imposs solv gener case problem optim identifi scenario problem construct effici algorithm gener optim solut develop approxim algorithm gener case problem studi qualiti approxim algorithm analyt perform experi relat work web mediat system emerg trend system prototyp literatur main focu system integr data multipl deal limit queri capabl sourc problem trade qualiti mediat answer process cost receiv attent system queri paper union queri form union union sourc unlik tradit union requir complet answer answer cost limit semant consid union queri convent context union algorithm tradit algorithm complet tradit algorithm deal overlap recent work studi effici obtain initi part queri answer obtain partial cost object function tradit recent work initi comput answer iter improv qualiti studi aggreg queri amen good approxim comput base partial data deal trade qualiti cost mediat queri summari result inform web base answer small initi set answer yield good answer answer queri effici base statist cach data mediat popular topic recent literatur work queri process base statist handl queri comput aggreg inform perform support task gener type queri mediat answer statist cach data mediat effici queri process mediat deal intermitt sourc failur techniqu complementari work cach data sourc mediat addit issu cach data data relev context alter queri plan run time cope sourc failur studi literatur unavail sourc particip delai visit unavail sourc retri goal comput complet answer eventu alter execut order queri plan compon goal comput complet arriv good answer cost limit mediat encount unavail skip sim project sourc fail execut queri rout altern site unavail sourc plan plan execut problem coverag altern sourc restrict search sourc studi describ coverag data web search engin improv engin notion coverag measur qualiti answer provid discuss techniqu enhanc coverag mediat queri coverag system defin formal metric measur qualiti answer consid framework sourc set object index web size sourc number object object defin coverag sourc simpli ratio size sourc size user pose queri mediat send queri obtain answer process answer arriv answer user queri order mediat contact subset sourc process user queri defin coverag mediat queri total number distinct object queri comput divid size sourc mediat built top coverag object repres coverag assum sourc overlap content mediat sourc coverag mediat queri mediat coverag mediat queri coverag note definit coverag independ queri hand defin coverag sourc number object sourc satisfi queri divid total number object satisfi queri sourc coverag hold queri coverag estim tradit estim techniqu note gener definit chang natur algorithm present work gener notion differ algorithm coverag gener base amount data sourc goal maxim coverag mediat expect larg coverag yield qualiti answer cost sourc queri flexibl cost model monei time sourc queri monei cost time cost depend sourc queri sourc cost amount depend size total monei cost mediat queri sum monei cost sourc queri involv total time cost comput point view time mediat initi sourc queri parallel achiev smaller time cost obtain cost factor monei time queri cost monei total cost search northern yahoo lyco assum queri northern light monei cost unit time cost queri yahoo monei cost unit time cost queri lyco monei cost unit time cost unit mediat northern light lyco yahoo sourc unavail cost strategi depend avail northern light lyco monei cost unit time cost unit altern strategi yahoo lyco northern light sourc unavail yahoo lyco monei cost unit time cost unit decid strategi factor case sourc mediat care set cost strategi unit unit strategi mediat care set cost unit unit strategi monei time import cost strategi cost strategi strategi coverag overlap set object sourc overlap quantit qualit inform overlap overlap set index page search set page fulli set engin note quantit overlap inform hard inaccur focu qualit overlap inform case qualit overlap pair sourc object common notion queri yield disjoint result set sourc sourc set object sourc inform respect queri hand collect object sourc subset collect object sourc relationship absolut natur rel queri hand set object sourc independ set object sourc probabl data object queri sourc sourc coverag sourc cov sourc share object site probabl cov object comput coverag mediat content overlap particip sourc sourc coverag mediat comput subset cov cov cov cov proce increment comput combin coverag treat singl sourc combin search engin northern yahoo lyco total number index web page million search engin index million million page coverag northern light coverag yahoo coverag lyco assum page index engin mutual independ combin coverag northern light yahoo coverag engin unavail sourc sourc temporarili unavail queri due network congest sourc overload mediat priori avail knowledg mediat find sourc send queri hand discuss ping suffici detect sourc figur execut tree simplifi assum mediat observ unavail sourc rest time user queri process mediat elimin sourc mediat notic sourc unavail assum monei cost involv send queri unavail sourc time cost fix base timeout period problem definit goal determin mediat achiev highest coverag expend cost limit gener execut strategi mediat achiev object repres mediat execut strategi flexibl structur call execut tree execut tree action run depend avail sourc root tree specifi set sourc queri root mediat depend whichev sourc node reach group sourc execut continu cost limit reach sourc mediat built top sourc fs assum sourc cost queri limit sourc visit simpl execut tree scenario shown figur root fs initi queri parallel follow left follow middl follow branch branch case case reach cost limit rest node figur proce avail scenario execut tree repres set happen depend avail sourc figur sourc execut involv send queri avail execut tree local optim execut tree yield larger coverag cost defin notion execut tree local optim respect avail scenario problem address paper find execut tree queri cost limit note mediat explicitli construct full execut tree shown figur start execut queri mediat algorithm make tree run time net effect algorithm path execut tree dynam fashion run time present dynam queri execut algorithm complex problem complex due varieti factor involv sourc unpredict sourc variabl monei time cost theorem full problem unsolv case execut tree algorithm optim execut mediat queri case due space present proof theorem lemma appendix problem deal investig scenario practic lend effici algorithm exact approxim solut adopt step simplif assum develop effici algorithm optim solut scenario good approxim section scenario execut queri parallel improv time simplif case cost profil simpler sourc cost complex sourc cost section deal case sourc arbitrari sourc imposs construct algorithm optim solut overlap present effici algorithm optim solut scenario case arbitrari algorithm optim effici approxim algorithm section deal variabl sourc cost simplif overlap profil make problem tractabl theorem develop good approxim algorithm problem discuss perform yield algorithm section studi perform algorithm experi involv gener case variabl arbitrari sourc overlap unpredict sourc avail discuss benefit parallel queri execut consequ monei compon cost uniform sourc cost simplifi variat problem sourc cost situat sourc simpli charg fix fee queri sourc mediat pick largest sourc send cost limit queri cost sourc queri mediat care sourc unavail sourc overlap content present algorithm account sourc unavail ignor sourc overlap section present algorithm consid sourc overlap algorithm simpl algorithm simpl implement greedi sourc descend coverag order shown figur algorithm notic sourc unavail increment cost access sourc sourc queri cost unit cost limit simpli sourc sourc queri sourc lemma theorem establish complex perform algorithm simpl lemma algorithm simpl run number sourc note actual time queri sourc comput run time algorithm theorem execut tree conceptu algorithm simpl global long sourc mutual disjoint theorem execut tree conceptu algorithm simpl global optim sourc independ theorem establish algorithm simpl produc optim result long sourc mutual disjoint mutual independ situat algorithm algorithm simpl queri sourc cost limit result execut answer execut collect result return answer algorithm algorithm care queri sourc cost limit overlap info result execut answer chosen subset sourc execut collect result chosen chosen return figur algorithm simpl care case homogen relationship gener complex overlap relationship heterogen mix algorithm simpl follow optim execut tree behavior illustr sourc coverag assum subset disjoint cost unit cost limit unit assum sourc mediat queri queri sourc algorithm simpl yield execut includ largest sourc coverag execut contribut set coverag algorithm simpl miss optim solut sourc subset algorithm care case uniform sourc cost sourc overlap complex wai present call inform sourc overlap idea algorithm care greedi strategi sourc descend order weed sourc contribut coverag content sourc queri algorithm formal present figur complex perform algorithm care state lemma theorem lemma algorithm care run number sourc theorem execut tree conceptu algorithm care global sourc overlap limit disjoint relationship theorem execut tree conceptu algorithm care global sourc overlap limit independ relationship illustr differ algorithm simpl recal sourc subset disjoint algorithm simpl made suboptim choic algorithm care correctli optim set sourc queri illustr sourc overlap includ mix independ disjoint algorithm care gener optim execut sourc coverag assum disjoint cost unit cost limit unit assum sourc mediat issu queri sourc algorithm care yield execut includ largest coverag execut involv yield coverag algorithm care miss optim execut mix independ disjoint overlap variabl sourc cost section relax condit sourc cost uniform cost sourc algorithm ratio start simpl case sourc variabl sourc overlap account variabl sensit sourc cost coverag small sourc larg sourc simpl extens algorithm simpl sourc highest ratio call simpli sourc descend order ratio algorithm ratio present formal figur note line call function obtain sourc send queri assum function elimin sourc cost larger search sourc cost limit ratio largest greedi strategi base ratio care algorithm produc optim execut demonstr algorithm ratio produc execut arbitrarili bad sourc coverag cost unit coverag cost unit sourc mutual disjoint cost limit unit ratio smaller sourc slightli higher larger sourc algorithm ratio queri unit larger sourc queri anymor violat cost limit algorithm ratio stuck execut time optim execut queri larger sourc illustr trick algorithm ratio miss optim solut miss arbitrarili larg margin show algorithm ratio algorithm simpl scenario algorithm simpl produc optim execut execut time execut produc algorithm ratio good algorithm ratio simpl algorithm run effici perform practic bad optim solut unlik section effici algorithm optim solut sourc cost vari simplif sourc problem remain hard add simplif assum sourc intract problem state theorem theorem simplifi sourc sourc algorithm domin problem deal algorithm ratio view simpl approxim algorithm perform algorithm algorithm ratio queri sourc fs cost fc limit result execut answer execut collect result return answer algorithm algorithm domin queri sourc fs cost fc limit result execut sourc answer greedi singl execut collect result return answer figur algorithm ratio domin term bad solut produc section present power call achiev bound optim algorithm domin consid sequenc sourc greedili base ratio algorithm ratio send queri select coverag greedi sequenc compar coverag largest sourc largest sourc higher coverag total greedi greedi sequenc largest sourc queri techniqu domin singl sourc prefer greedi sequenc sourc protect algorithm domin notori bad case algorithm domin find optim solut queri larger base ratio smaller sourc queri techniqu incorpor algorithm domin literatur relat problem knapsack problem techniqu optim knapsack problem simpli carri solut knapsack problem order solv problem sourc techniqu longer illustr sourc coverag cost coverag cost coverag cost unit cost limit unit sourc mutual disjoint unavail algorithm domin consid greedi sequenc compar combin coverag sequenc coverag largest sourc decid greedi sequenc execut algorithm attempt queri discov unavail algorithm domin stuck small sourc larger sourc longer queri cost exce current algorithm domin end coverag optim solut achiev coverag limit potenti impact unavail algorithm domin incorpor larg sourc sequenc high algorithm domin greedi sequenc sourc singl larg execut queri sourc descend order coverag idea sourc greedi sequenc matter rel order sourc queri sourc sourc queri greedi sequenc reconsid larg dynam adapt recalcul sourc algorithm domin encount unavail sourc execut queri greedi sequenc reassess continu chosen greedi sequenc possibl abandon suffix greedi sequenc queri singl larg sourc larger sourc suffix put exploit techniqu algorithm domin reassess suffix greedi sequenc earlier sourc greedi sequenc unavail algorithm domin formal present figur comput coverag greedi sequenc line coverag largest sourc line note case algorithm assum call elimin sourc cost larger lemma state complex perform algorithm domin lemma algorithm domin run number sourc lemma algorithm domin select largest sourc iter sourc achiev optim theorem algorithm domin solut factor optim number sourc bound theorem construct exampl algorithm domin reach optim practic situat algorithm domin yield solut optim fact demonstr excel perform algorithm domin studi section algorithm super drop restrict sourc overlap section depend sourc sourc relationship independ deal situat modifi algorithm domin arriv algorithm super differ algorithm super algorithm domin greedi sequenc line algorithm domin figur algorithm super elimin sourc content subset sourc visit due space algorithm super present appendix theoret bound optim algorithm case arbitrari sourc overlap perform experi section demonstr perform practic perform evalu section studi perform algorithm present goal address ffl optim simpl optim solut poorli perform gener remain algorithm solv problem good approxim ffl algorithm optim compon ignor time compon add parallel solut gener algorithm answer obtain add monei cost time cost answer question conduct perform experi analyz result object answer question absolut paramet coverag avail vari base web order gain insight understand implement creat simul testb repres synthet ran algorithm exhaust comput optim solut compar perform algorithm optim solut due space present select result paramet simul main paramet simul coverag cost variat sourc sourc avail testb sourc size chosen reflect result studi web coverag search engin size sourc randomli chosen coverag overlap cost chose base chose sourc unavail mean sourc unavail probabl averag sourc unavail queri experi studi effect sourc vari unavail base assum relationship sourc independ remain relationship evenli distribut subset relationship assum pair sourc case search engin default sourc cost rang unit cost queri uniformli distribut studi effect cost lower bound cost rang fix upper bound vari compar algorithm experi ran cost limit comput averag behavior algorithm randomli gener sourc base paramet set pick cost ran comput coverag answer gener comput maximum coverag subset sourc obtain error margin algorithm respect optim solut comput averag error margin trial report graph present figur show behavior algorithm sourc unavail vari horizont unavail plot vertic axi repres averag error respect optim solut figur show algorithm unavail behavior due reduc chanc algorithm make bad choic sourc percentag error wrt optimum unavail effect unavail simpl care ratio domin super figur vari avail sourc percentag error wrt optimum max cost effect cost variat simpl care ratio domin super figur vari cost rang sourc figur show effect vari cost rang sourc queri sourc cost vari shown horizont axi vertic axi show averag margin error result show cost rang algorithm tend perform rate perform loss algorithm simpl care algorithm domin super behavior understand make simplifi assumpt sourc queri cost assumpt violat directli relat cost rang experi vari show result note rel perform algorithm simpl worst super held experi care super perform number subset relationship ratio domin perform poorli percentag overlap note algorithm perform wide rang scenario care super consist super perform algorithm experi involv variat sourc cost rang sourc overlap experi show result domin perform ratio observ ratio perform room improv domin parallel queri execut algorithm section assum maxim coverag account monei cost problem substanti algorithm decid order sourc decid queri submit parallel reduc full treatment gener problem scope paper studi impact parallel execut monei hard parallel execut start modifi algorithm execut queri parallel step set sourc comput sourc origin algorithm select sourc algorithm chosen sourc sourc chosen sourc sourc select sourc larger higher probabl make mistak sourc algorithm discov select set similar fashion parallel time cost reduc higher monei cost decid run queri incomplet avail inform experi monei cost parallel desir reduc time cost monei penalti percentag error wrt optimum parallel avail simpl care ratio domin super figur parallel queri execut percentag error wrt optimum parallel vari avail figur parallel avail figur show perform algorithm sourc experi chose sourc unavail relationship higher parallel mark effect algorithm algorithm show affect simpl ratio expect loss perform respect monei adopt set sourc visit remain irrespect parallel remark stabl perform domin super pleasant observ super perform monei cost account insensit parallel solut problem emploi super largest practic parallel vari sourc observ perform degrad algorithm care avail behavior report result experi figur easi explan fewer sourc chanc mistak care due parallel reduc error margin vari profil studi effect parallel execut alter perform algorithm observ sourc overlap penalti monei factor parallel super turn algorithm remain insensit overlap problem maxim coverag mediat queri mediat cost check discuss complic sourc coverag cost profil intermitt unavail complex problem studi dynam algorithm develop problem present complex analyt perform result algorithm conduct extens perform experi base scenario engin experi studi practic characterist algorithm draw tradeoff time monei cost involv process mediat queri refer poosala fast support system approxim queri answer proc vldb al system construct mediat internet sourc proc sigmod shahabi intellig cach inform kr base approach proc krdb broder techniqu measur rel size overlap public web search engin proc www partial answer unavail data sourc proc flexibl queri answer system al heterogen multimedia inform garlic approach ride sql proc sigmod gravano evalu select queri proc vldb al tsimmi integr heterogen inform sourc find replic web collect proc sigmod johnson comput guid theori npcomplet widom system implement prentic duschka inform integr system proc sigmod summari statist improv approxim queri answer proc sigmod weld systemat plan formal foundat plan washington comput scienc technic report wang onlin aggreg proc sigmod knoblock replan inform gather proc ijcai gile access inform web vol juli ordil queri answer algorithm inform agent proc aaai estim qualiti proc flexibl queri answer system freytag integr heterogen inform system proc vldb ioannidi approxim queri answer histogram ieee data engin valduriez scale access heterogen data sourc disco tkde queri scrambl initi delai proc sigmod internet solut compani excit search engin lyco search engin metacrawl engin northern light search engin search engin supplement materi algorithm proof theorem main full problem unsolv case execut tree algorithm optim execut mediat queri case prove theorem construct scenario execut tree sourc object set cg dg sourc monei cost unit cost limit unit dont care time time focu execut tree node refer sourc time proce assum execut tree loss root node tree node indic sourc visit indic sourc visit respond clear execut tree root node execut tree start global optim execut tree algorithm optim coverag mediat queri case lemma main algorithm simpl run number sourc iter loop algorithm simpl figur time involv find sourc clear number iter loop iter sourc remov remain list sourc consid theorem main execut tree conceptu algorithm simpl global long sourc mutual disjoint set sourc answer queri pose execut produc algorithm simpl chosen show optim execut set sourc chosen execut produc algorithm simpl optim optim execut visit set sourc opt note chosen sourc assum opt sourc opt sourc fewer sourc extend opt queri addit optim execut show opt chosen differ specif sourc construct optim set closer chosen sourc chosen opt exist sourc opt chosen number larger chosen algorithm simpl ahead replac end set good reason replac produc set sourc mutual disjoint bring sourc larg replac sourc produc optim set closer chosen continu construct optim set set sourc ident chosen theorem main execut tree conceptu algorithm simpl global optim sourc independ proof similar theorem lemma main algorithm care run number sourc iter loop algorithm care figur time involv find sourc check superflu clear number iter loop iter sourc remov remain list sourc consid theorem main execut tree conceptu algorithm care global overlap limit disjoint relationship show exist optim execut set sourc set sourc chosen algorithm care sequenc sourc visit algorithm care chosen collect set sourc optim execut order size sequenc sourc opt note opt chosen number sourc sourc extend sourc contribut coverag result posit chosen opt differ chosen opt posit sourc chosen ith posit sourc opt case smaller larg case smaller algorithm care consid reject subset sourc posit chosen drop opt lead suboptim solut construct execut replac newli construct execut optim sequenc sourc chosen posit case larg sequenc obtain replac opt disjoint sourc chosen disjoint sourc opt newli construct sequenc disjoint sourc newli construct sequenc correspond optim replac smaller larger opt sort order sourc subset sourc opt sequenc suboptim execut superset sourc opt replac occurr sourc obtain sequenc compar sequenc differ set sourc queri substitut sourc subset construct sequenc correspond optim execut chosen posit shown make chosen optim sequenc posit optim sequenc posit appli argument valu chosen opt differ construct optim sequenc sourc complet chosen algorithm care produc optim solut theorem main execut tree conceptu algorithm care global overlap limit independ relationship proof similar theorem theorem main simplifi sourc sourc proof reduc knapsack problem simplifi version problem knapsack set item benefit cost find subset largest benefit total cost cost limit translat problem problem item knapsack creat sourc popul uniqu object benefit item creat set mutual disjoint sourc coverag proport benefit knapsack item cost sourc queri cost item knapsack problem cost limit queri problem equal cost limit knapsack problem find effici algorithm optim solut algorithm solv knapsack problem run algorithm instanc problem construct knapsack problem observ set sourc chosen algorithm process list item solut knapsack problem knapsack problem deduc problem lemma main algorithm domin run number sourc note algorithm domin figur number iter loop iter sourc remov remain list sourc consid iter algorithm find greedi implement preprocess step construct global greedi sequenc begin effici deriv greedi sequenc iter construct global greedi sequenc accomplish time deriv greedi sequenc iter time iter loop iter preprocess step involv algorithm domin run time lemma main algorithm domin select sourc iter sourc achiev optim coverag sourc algorithm domin pick sourc iter larg combin coverag greedi greedi sequenc sourc highest coverag unit cost ad extra sourc extend greedi sequenc regard cost limit addit sourc make total cost sequenc larger sourc highest ratio coverag remain sourc coverag sourc larg optimum coverag larg larg optimum algorithm domin pick sourc larg optimum coverag achiev algorithm domin larg achiev optim theorem main algorithm domin solut factor optim number sourc prove theorem induct base case sourc unavail algorithm domin produc optim albeit return result user queri sourc sourc cost limit algorithm domin correctli sourc produc optim result optim result empti algorithm domin empti result sourc sourc queri combin cost lower algorithm domin queri sourc obtain optim result sourc algorithm domin yield optim result answer object sourc algorithm pick larger sourc obtain optim result sourc cost limit cost algorithm domin obtain optim result execut queri sourc algorithm domin produc optim solut solut factor optim induct base lemma algorithm domin decid singl largest sourc sourc achiev result factor sourc unavail greedi sequenc chosen examin largest sourc greedi sequenc execut queri largest sourc greedi sequenc algorithm domin solut achiev optim coverag sourc goal problem reduc induct optim algorithm super figur present formal algorithm super line greedi sequenc assum call elimin sourc subset sourc addit elimin sourc cost assum coverag greedi sequenc comput sequenc sourc subset sourc sequenc lemma algorithm super run number sourc note algorithm super figur number iter loop iter sourc remov remain list sourc consid find greedi sequenc time elimin subset sourc total run time algorithm algorithm algorithm super queri sourc fs cost fc limit overlap inform result execut sourc answer chosen greedi singl execut collect result return figur algorithm super
DB/1075 3 cach digest alex duan wessel nation laboratori appli network research april abstract paper present cach protocol optim techniqu cooper web cach cach digest proxi make inform cach content peer compact form peer digest identifi neighbor document cach digest altern tradit scheme discuss design idea cach digest implement proxi cach perform cach digest compar web cach oper analysi show cach digest outperform categori outlin improv techniqu work introduct difficult problem design web cach hierarchi effici locat object held neighbor cach cach forward origin server cach oper todai util internet cach protocol work add delai cach miss neighbor cach locat close organiz delai troublesom paper altern call cach digest cach base bloom essenti lossi compress cach kei lookup capabl digest made cach download neighbor digest startup check neighbor cach neighbor hold object cach digest drawback bloom filter perfectli repres item encod bloom filter incorrectli report item fact web mean gener remot cach miss expect cach hit penalti addit memori requir store cach digest work support grant nation scienc foundat paper describ design implement cach digest measur effect ran cach digest support cach period dai special modif made cach digest half cach half studi collect measur servic network memori usag result show cach digest successfulli elimin miss cach digest consum lower network bandwidth bursti traffic compar memori usag cach digest requir addit problem connect web cach hierarchi mesh offer addit benefit web cach technolog determin member cach group cach miss forward cach lightweight internet cach protocol messag transmit udp messag consist byte header url cach send queri messag neighbor cach neighbor repli hit miss messag presenc absenc object cach disadvantag addit delai introduc exchang cach process queri delai network time pair cach delai penalti depend cach proxim delai necessarili wan cach figur show delai experienc cach date pb uc sv sd figur delai experienc cach week valu median amount time send queri cach flat curv cach network time node rang millisecond curv cach cach cach zealand oper cach shown plot util disadvantag effect drop notic send queri cach miss scale poorli number network messag proport product number neighbor number http request provid coupl import advantag udp repli lack inher current network condit network path repli delai longer drop receipt repli neighbor cach serv request advantag src featur featur repli includ measur network neighbor cach origin server logic mechan neighbor return miss request forward neighbor closest lowest origin server section present altern method object locat elimin step delai cach digest search techniqu cach effici inform content delai approach transfer entir list cach kei cach cach hold million averag url length byte result data transfer approxim mbyte hash result transfer mbyte reduc size select subset standard accuraci bit reduc directori size reason mb hash number unaccept larg hope small directori size low occurr bloom field offer small directori size low probabl bloom filter bloom filter arrai add entri bloom small number independ hash function comput entri kei hash function valu bit filter turn check specif entri calcul hash function valu kei examin bit bit entri filter bit probabl entri filter size bloom filter determin probabl lookup correct smaller filter size result error larger data term hit miss bit bloom filter predict object filter term true describ correct predict true filter correctli predict entri cach filter incorrectli predict entri cach true filter correctli predict entri cach averag url length calcul byte filter incorrectli predict entri cach distribut number effect algorithm maxim true valu minim bloom filter number hit price paid compact bloom filter perfectli synchron miss cach digest perfectli expect number miss cach digest design layer build bloom filter tradeoff cach digest size miss probabl hold bit percentag hit relat question optim densiti bloom filter object ad densiti cach object treat equal cach digest size hit alloc fewer bit object request penalti variabl number hash function higher miss probabl note peer check cach digest number hash function hash fresh object access hash function stale object access hash function number optim virtual unlimit object properti determin futur request object clear effect optim local storag cach digest larg data structur kb tempt local digest disk proxi gener cach digest benefit neighbor digest rebuilt scratch updat rebuild digest cpu intens tradeoff memori util cpu overhead make thing note rebuild digest requir alloc temporari memori store digest built period peak memori cpu usag constant lower memori util delet digest digest rebuilt scratch period basi stale bit prevent digest pollut local updat delet kind updat local digest entri ad enter cach object purg desir undo effect local digest ad entri local digest simpl updat propag applic histori recent updat delet entri standard bloom filter bit arrai set due number entri uniqu kei turn bit support delet integ counter singl bit necessarili digest check overflow updat histori includ delet support digest dissemin updat propag transport protocol exchang fairli establish lightweight altern http commun cach digest transmit messag design toler gap lost implement messag retransmiss scheme reliabl tcp make choic tcp develop custom digest exchang exchang digest http exchang cach emploi push pull push model put server control distribut updat client push server rapidli cach content requir server client cach support digest client receiv data specif request digest client updat digest slowli number hit miss effici increment updat cach send entir digest remot storag proxi peer digest memori consult miss make store copi digest disk proxi disk resid digest fresh note expir inform store disk digest disk resid digest share digest proxi make fetch cach digest neighbor origin neighbor closer store digest treat cach object greatli simplifi implement handl hit hit sibl toler number hit violat definit sibl relationship requir featur http detect hit deal appropri design layer independ balanc architectur result good perform scalabl section describ motiv design choic approach balanc design altern layer fine art goal find simpl robust combin perfect optim solut choic leav lot freedom optim tune build digest cach digest built fix set hash hash valu simpli byte section standard byte comput url string hash modulo digest determin bit turn cach determin size digest independ peer hold number bit object size digest depend current cach size maximum cach capac note scheme effici lookup implement foreign digest great flexibl build digest reduc number proxi decid appli fewer hash function stale entri affect cach digest comput lookup algorithm peer remain unchang cach digest separ digest comput digest store digest proxi maintain memori disk resid copi digest copi fast updat memori copi request digest satisfi copi memori resid copi requir proxi decid recomput digest scratch constantli updat copi digest written treat cach object proxi emploi special algorithm share local digest peer peer retriev cach document retriev cach digest complic access control address local digest recomput configur time interv smarter algorithm monitor densiti current digest trigger rebuild number bit turn exce threshold trigger base cach object expir rate altern presenc qualiti local updat algorithm transpar proxi proxi attach expir date cach digest peer digest time peer requir discard expir digest note awar potenti secur issu list url cach discov object present cach dissemin digest pull techniqu dissemin cach digest pull fit current distribut access control scheme web object push requir parent proxi maintain state data children child cach accept digest arbitrari time select parent proxi similar problem proxi serv digest child exist pull approach techniqu resolv conflict develop wast bandwidth transmit potenti huge put receiv neg repli preserv bandwidth proxi peer request techniqu refresh neighbor digest desir fetch digest remot parent local neighbor rememb digest treat web object dissemin exist cach hierarchi digest updat proxi digest digest longer synchron content neighbor cach differ condit hold digest neighbor add lot popular object unpopular document purg neighbor cach condit inconsist digest harmless affect document request client condit desir proxi notifi digest user recent cach content obviou frequent notif frequent updat reduc number hit miss requir amount bandwidth updat updat messag http repli custom http header request notifi recipi origin accept digest updat repli messag header repli send current updat piggyback scheme major requir protocol handl except http care extra messag gener cooper proxi parent requir maintain state inform child cach practic limit amount inform place http header real problem significantli messag size updat header limit fraction messag upper limit kb bandwidth charg scheme potenti secur problem exist cach digest object corrupt case updat condit hold true common suggest purg unpopular hold support delet addit notif support delet simpl consum extra memori proxi maintain digest accuraci cach digest uncertainti level cach request miss lead lower hit ratio peer reduc hierarchi util miss rare occur hit simpl mechan handl hit proxi request object base cach digest hit request sibl forward miss add standard http cach control direct call request turn proxi send repli receipt origin proxi forward request parent directli origin server request parent forward direct ad note resourc discoveri protocol face problem uncertain inform time repli subsequ http request reach object result hit probabl hit lower solut work cach digest implement methodolog built cach digest support version cach build digest content digest built file continu updat object enter cach delet entir cach digest rebuilt period transfer cach digest http messag digest individu udp messag limit system socket buffer size rang numer commerci cach product support http chanc cach digest implement product peer cach digest request demand request peer digest cach digest serv standard http expir header base digest rebuild period request fresh digest peer cach digest repli swap disk standard cach cach serv digest copi cach swap peer digest peer return http repli updat request properli handl hit parent problem proxi cach miss parent sibl hit dealt properli discuss intend direct problem fulli program properli recal cach digest produc miss handl repli request parent cach directli origin server coupl mechan peer lowest origin server src neighbor repli cach select neighbor closest prefer select peer closest origin server receiv peer measur measur emploi approach peer digest report forward src featur parent closest origin directli origin server cach closest present cach digest implement forward directli origin peer digest miss measur effect cach digest categor request true true miss calcul valu cach configur neighbor support cach digest ffl true hit peer digest object http repli header specifi hit ffl true miss peer digest object header specifi miss state request forward neighbor digest count true miss section describ count miss studi ffl hit peer digest object header specifi miss ffl miss peer digest object header specifi hit count miss gener section describ approach studi present updat cach digest http header real evid updat make impact digest accuraci framework result modif instrument addit support cach digest modifi specif wai studi import modif compar perform cach digest singl machin machin locat receiv similar request cach digest modifi give machin randomli gener number determin futur implement bulk exchang network measur standard http repli header extens header request hit miss cach add header cach digest request cach miss split balanc half time half cach digest techniqu count true miss select check peer cach digest find predict request cach digest predict header count miss cach digest header true miss instrument servic time histogram cach digest mode servic time time accept close client http connect servic time time begin neighbor select process includ read byte server repli count number size messag receiv network ad similar counter cach digest network traffic tradeoff cach digest memori usag count number byte requir store local remot cach digest util addit process memori cach modifi version run april collect statist cach minut interv data present section understand understand cach peer arrang locat configur summar tabl citi network exchang point mb cach gb pb pa uc il sv silicon ca sd san ca pa palo ca digit sj san ca pa sj cach includ analysi pa intern cach client test cach digest implement remain cach receiv million request serv gb client cach world summar cach peer ffl sd form cach forward request net org gov mil domain case mean persist connect time read request byte write repli byte backbon oper nation scienc foundat servic msec proxi digest pb uc sv sd tabl median client servic time cach data collect hour period cach digest consist outperform larg margin note differ time significantli larger cach wait repli select peer cach send queri local cach miss request receiv origin server domain ffl sv intern cach peer sv peer except bo domain ffl sd intern cach peer ffl pb intern cach peer unit pb receiv request cach european domain ffl cach host acl configur line ensur request pass cach overview result compar differ cach neighbor select interest servic digest network traffic present tabl valu cach valu includ plot pb cach data gather dai period servic time tabl list median client time hour period experi cach digest perform notic cach digest elimin queri delai local miss advantag cach digest number peer slow client request scale number client figur show cumul distribut servic time period pb includ cach miss pb cach digest select cach plot left show cach digest provid percentil millisecond digest percentil millisecond digest figur servic time pb cach left logarithm plot show cach digest provid lower servic time cach client linear show cach digest median median msec millisecond client server client server figur median servic time valu pb durat studi median valu interv smooth function elimin delai evid cach digest perform select significantli lower servic time remain ident servic indic client connect bottleneck side figur show area curv cross median linear improv easier cach digest median ms figur plot pb median servic time entir dai period studi graph show cach digest consist perform time dai show peak internet congest congest affect bit cach digest digest accuraci tabl essenti analyz digest accuraci smaller digest result higher hit ratio stale digest gener miss number miss neglig server disappoint high hit percentag intend investig properli count count tricki forward queri request directli origin server hit miss total proxi true true true hit miss pb uc sv sd tabl digest accuraci ratio cach low miss document enter cach request delet notif requir digest hit ratio constant hit ratio high work identifi solv problem total true ratio cach digest attract practic true true miss hit true figur percentag true true miss pb note percentag cach restart percentag true guess hit miss complimentari add true guess thing header cach differ refresh paramet produc remot miss hit expect figur plot rel percentag true true miss pb note percentag cach restart left top curv number time peer digest accur request object curv peer digest accur specifi object peer digest incorrectli specifi object final visibl plot sum percentag wai plot valu time cach digest predict true time time hit miss ratio equal traffic proxi digest receiv receiv pb uc sv sd tabl transfer rate cach digest valu traffic calcul cach digest approxim accuraci incom outgo bandwidth differ slightli cach digest smaller transfer rate direct compar analysi show cach digest traffic bursti special optim appli discuss figur network traffic tabl summar incom outgo traffic cach higher traffic volum gener messag compar cach digest differ cach digest figur proxi due cach size access pattern small proxi cooper larg larger proxi send inform receiv back lead interest agreement problem asymmetr traffic specif cach digest cach proxi control amount data transmit hierarchi larg proxi limit number request small peer give cach digest fewer bit turn figur show amount network bandwidth consum pb cach digest calcul amount traffic exist absenc cach digest calcul traffic includ messag cach make lose accuraci figur tabl show pb receiv slightli byte send note cach pb send receiv sd cach significantli small number child cach pb pb figur show theoret point cach digest determin digest refresh period result lower bandwidth util deriv cach size averag queri rate digest refresh period draw line averag traffic rate cach digest equal bit bloom filter object cach size gb averag object size size cach digest mb pb receiv queri queri messag includ extra byte present repli messag proxi digest receiv receiv pb uc sv sd tabl number messag transmit hour cach digest cach digest requir significantli fewer messag cach digest messag digest updat digest expir hour interv number digest receiv approxim number cach peer support cach digest send digest messag receiv messag peer dead cach digest support mb receiv receiv receiv receiv figur cumul network traffic cach digest elimin traffic cach show rate traffic method minut sampl cach digest traffic bursti smooth cach digest traffic result improv digest updat algorithm prior cach request digest peer time graph show time digest receiv gap line marker correspond number digest transmit minut unwant synchron led larg peak cach digest traffic rate peak start dissolv introduc lower bound frequenc digest updat queri peer cach size gb gb gb gb figur theoret point cach digest line repres cach size larger cach size larger cach digest messag cach queri rate estim digest refresh period result lower bandwidth util point line repres lower bandwidth cach point line repres lower bandwidth gb cach receiv averag queri peer benefit switch cach digest updat period hour cd cach digest traffic cd traffic assum averag messag size queri byte equat solv function cd term cach size averag object size memori usag size digest depend cach size experi present bit object assum full cach capac gb cach digest approxim mb digest size calcul base actual amount disk space cach size growth total memori requir run cach digest proport number peer digest cach peer neighbor requir mb ram store digest digest peer digest memori usag stabl relat work cach arrai rout protocol design pennsylvania request determinist forward set neighbor cach algorithm forward request url neighbor carp work intranet internet cach peer harrison distribut internet primarili target elimin upper level bottleneck scale issu upper level web cach replac serv object server receiv addit delet lower level cach upper level server content lower level cach redirect cach object author simpl modif exchang messag chase develop similar system label central map servic ti number cach map servic direct proxi fetch cach object crisp system work autonom manag cach network cach crisp server introduc delai pei cao student madison develop object locat techniqu base bloom filter call summari cach extend bloom filter parent cach children updat support summari cach maintain special tabl track delet bloom filter size tabl time size local bloom filter tabl notifi peer object purg cach research test idea simul small scale benchmark instrument version cach digest design develop independ pei cao group knowledg summari cach project complet leav opportun influenc develop design object understand practic matter differ push technolog suit cooper cach gener push parent proxi maintain state children accept fresh bloom filter parent proxi gener summari cach piggyback updat messag requir special messag updat support delet bloom filter worth overhead purg object request cach digest requir common set hash function digest creator free algorithm build bloom filter give prioriti digest consum detail algorithm summari creator full algorithm consum recogn bloom filter useless hypertext cach recent replac protocol primari differ queri includ full http request repli includ full http repli header address inabl accur predict cach hit due lack http request header acknowledg dancer beta tester cach digest work support grant nation scienc foundat futur work shown cach digest base bloom object locat function similar delai median servic time cach improv millisecond cach digest cach digest paramet updat carefulli techniqu consum network bandwidth cach digest memori approxim mb digest studi gener steadi stream small cach digest transfer occur burst mb cach digest suitabl highli congest network path remain area futur hope receiv good feedback user commun drawback cach digest number high cach realist expect digest sibl relationship number reduc top prioriti task identifi primari reason high hit ratio relat modifi properli handl repli request hit digest sibl relationship support short studi support idea cach digest fulli updat period hour increment wit essenti chang ratio investig reveal increment updat intend implement function custom http request repli header continu tune cach digest gather addit perform data cach refer wessel cach protocol version network work group rfc septemb wessel internet cach protocol version network work group rfc septemb hash code commun vol pp juli scalabl web cach share tech rep depart comput februari field transport protocol network work group rfc januari text cach protocol march prototyp web cach research project fund nation scienc foundat arrai rout protocol februari txt distribut internet australasian comput scienc confer februari approach build larg internet workshop hot topic oper system april internet object
DB/1076 3 broadcast consist data transact mobil client au edward chan depart comput scienc citi hong kong tat chee work support part citi strateg grant abstract studi inconsist problem data broadcast data item mobil comput system updat transact instal valu data item execut updat transact broadcast data item interleav mobil gener mobil observ inconsist data valu call order concurr control mobil transact updat transact mobil transact assum schedul serializ import properti algorithm mobil transact set lock read data item impact adopt broadcast shown effici method data dissemin mobil comput minim introduct recent advanc wireless commun technolog greatli function mobil inform servic made mobil comput applic realiti number mobil inform mobil shop aid larg shop mall inform distribut user mobil phone palmtop implement innov traffic inform navig stock inform doubt continu emerg user requir instant access inform palmtop notebook comput matter locat due constraint mobil comput limit limit electr power suppli design effici cost effect mobil comput system requir solv consid distribut system support wire network import issu effici data dissemin transact mobil client problem complic limit bandwidth low transmiss qualiti mobil network recent data dissemin method meet data requir mobil client approach dissemin data item inform server transact mobil client data broadcast data item requir transact inform server request approach simpl scale number mobil client wait time data item long larg number transact wait data item broadcast inform server period continu broadcast data item mobil client transact wait data data item broadcast cost data dissemin independ client number data broadcast satisfi multipl request data result effici bandwidth suitabl dissemin substanti amount inform data larg number mobil client bandwidth effici major concern import data dissemin transact mobil client provid consist data valu data transact inform server set lock server access data item data item data item broadcast updat transact observ inconsist data valu updat interleav data broadcast import maintain data item problem concurr control concurr control protocol phase optimist method timestamp order suitabl kind system requir lot overhead set lock detect data conflict studi inconsist problem broadcast data item transact mobil client call order assum updat server assum transact mobil client mobil comput system gener transact mobil client retriev type inform stock traffic inform updat lot common broadcast system weather traffic inform system number updat transact number transact assum number data conflict updat transact mobil transact low organ remain part paper section review relat work concurr control data broadcast section defin transact model mobil comput system data broadcast section discuss data inconsist problem exampl section introduc order discuss correct implement futur work paper section relat work research mobil comput system receiv lot attent recent import issu concurr control data broadcast greatli tradit concurr control protocol suitabl mobil comput system due heavi overhead phase lock requir transact set lock data item access data item overhead lock lock conflict detect high mobil environ data transact mobil client access data item time inform server data item broadcast basic data broadcast set lock impract due poor qualiti servic mobil easi ensur data consist detect data conflict common solut relax consist requir consist model semant relat data group cluster data insid cluster mutual consist inconsist data cluster studi concurr control data broadcast control matrix concurr check data matrix size broadcast control matrix broadcast addit data item mobil client requir perform consist check matrix read data item broadcast schedul check ensur transact live set current transact write data item read mobil client abort restart transact client issu updat transact addit read transact write oper perform local copi data item client end transact includ read write oper cycl number perform server commit updat model conceptu central updat server major drawback approach larg overhead maintain matrix concurr control conflict check matrix substanti percentag broadcast bandwidth size data item small size larg larg matrix impract applic maintain control matrix involv complic process server undesir characterist client server observ serial order updat transact impact mobil client featur depend natur applic desir observ global updat serial order review lack effici data consist control broadcast introduc order algorithm section algorithm maintain serializ updat transact server mobil transact algorithm minim overhead appli broadcast model algorithm aim reduc number abort mobil client transact model mobil comput system consist inform server number mobil client connect server mobil network cellular radio system mobil client repres user equip mobil unit commun low bandwidth wireless channel inform server inform server maintain track inform extern environ data item highli dynam stock traffic weather condit maintain valid data updat transact instal statu object extern environ chang captur current statu object refresh valu data item valu data item stale useless assum updat transact short consist sequenc read write oper assum concurr control phase lock optimist method concurr control updat transact data broadcast inform server broadcast data item continu end broadcast cycl length broadcast cycl fix variabl start broadcast cycl immedi data item requir time broadcast select data item broadcast perform broadcast algorithm broadcast algorithm suggest select data item broadcast base deadlin transact access frequenc data item assum broadcast process model call broadcast transact long transact execut bt updat transact interleav mobil client issu call mobil transact request data item inform server assum mobil transact collect simpl data request transact assum data request perform order short transact data request assumpt transact model summari updat transact server mobil transact unord data item requir mobil transact receiv order conflict updat transact mobil transact low case lot common broadcast system weather traffic inform system mobil transact drop period mobil transact abort restart requir data broadcast program drop period data inconsist data broadcast broadcast data item perform concurr execut updat mobil transact read inconsist data valu due uncontrol interleav execut updat transact broadcast process adopt serializ correct criterion transact execut serial graph schedul serializ illustr problem data broadcast final schedul updat transact mobil transact data conflict updat transact mobil transact updat updat data item data item mobil read schedul broadcast transact broadcast mt read updat updat broadcast transact broadcast mt read mobil transact mt observ inconsist data valu serial graph cyclic mt mt reason mt read data conflict updat read conflict data updat mobil transact conflict updat transact serial order updat transact mobil transact final serial graph cyclic due transit depend updat updat updat schedul broadcast transact broadcast mt read updat updat updat updat broadcast transact broadcast mt read serial graph cyclic mt involv broadcast transact mobil transact find requir data item singl broadcast cycl occur broadcast transact schedul bt broadcast mt read end bt updat updat bt broadcast mt read serial graph cyclic mt note determin serializ serial ignor broadcast transact consid real effect consist function provid data item mobil transact read reason treat transact facilit analysi mobil transact read data item broadcast serial order bt data inconsist problem exampl resolv serial execut broadcast updat transact execut concurr execut broadcast defin uniqu base arriv time execut order final schedul serial serial approach main problem concurr control system greatli affect note wait time updat transact long broadcast transact long transact affect valid data item serial approach problem unresolv order algorithm biggest problem implement concurr control data broadcast mobil transact read broadcast data item time broadcast server gener notic detect data conflict mobil transact updat algorithm check data conflict broadcast transact updat transact basic principl algorithm ensur data conflict occur broadcast transact updat serial order bt imposs mobil read depend directli transit exist conflict broadcast transact updat transact bt mobil transact complet start updat mobil transact read data item broadcast serial order bt mt serial order updat transact mobil transact mt final serial graph mobil transact updat transact serializ correct algorithm discuss detail section execut updat transact assum concurr control protocol phase lock adopt resolv data conflict updat transact execut updat transact divid execut phase updat phase perman updat updat phase maintain short durat updat reduc block time broadcast transact updat transact updat broadcast data item stop execut updat transact execut data conflict updat transact resolv adopt concurr control protocol updat data item written privat workspac transact execut phase oper transact enter updat phase perman updat perform copi valu privat workspac case explain detail section detail algorithm updat transact start updat system detect data conflict updat transact broadcast transact current previou broadcast cycl start time updat set data item updat updat transact oper complet set data item read broadcast transact result broadcast algorithm set data item compar data conflict conflict resolut method resolv data conflict depend updat phase start respect broadcast conflict data item action serial order bt problemat case broadcast conflict data item arriv updat transact resolv discuss section broadcast transact problem resolv detect data conflict mobil transact span broadcast cycl read broadcast cycl case section check data conflict current broadcast transact suffici straight forward solv problem includ broadcast transact previou cycl data conflict check cycl cycl overhead heavi practic turn drop defin deadlin mobil transact minu arriv estim cycl number previou cycl dp max time broadcast cycl dp max maximum drop period mobil transact mobil client due low time requir complet broadcast cycl long broadcast data requir broadcast data item set drop period check cycl algorithm state algorithm formal defin quantiti bt bt current broadcast cycl bt set data item broadcast bt set data item updat bt broadcast perman updat algorithm bt bt depend serial order bt data item data item serial order bt end end give exampl algorithm discuss properti correct algorithm exampl refer exampl section serial graph acycl algorithm broadcast transact broadcast mt read compar data set bt updat updat bt mt read updat bt continu process broadcast mt read serial graph acycl mt bt broadcast mt read compar data set bt updat updat bt mt read compar data set bt updat updat bt continu process broadcast mt read serial graph acycl mt bt broadcast mt read end bt start bt compar data set bt bt updat updat bt mt read bt broadcast mt read serial graph acycl mt correct implement algorithm properti import properti algorithm impact adopt broadcast algorithm ensur schedul mobil transact mobil client updat transact serializ implement algorithm simpl requir mobil client mobil transact read data item broadcast server permiss check server overhead data conflict detect server low note overhead algorithm execut updat transact check data set broadcast transact updat transact updat transact start updat broadcast process stop updat transact updat conflict data item case broadcast conflict data item occur updat phase updat transact start divid execut updat transact phase trivial incur heavi overhead similar defer updat approach overhead check conflict data set low number data item updat updat transact small speed check data item updat sort id wait time broadcast transact updat transact long length updat transact short execut divid number small probabl data conflict low data requir case conflict data item broadcast updat phase updat transact data conflict data algorithm affect basic mechan underli broadcast algorithm advantag time data item updat version correct algorithm low overhead minim impact broadcast mechan prove serial graph mobil transact updat transact acycl concentr serializ updat transact broadcast transact serial order serial mobil transact updat transact mt mobil transact read data item bt proof case data conflict bt consid case section algorithm defin section serial graph consid sg set node repres set transact transact case bt set order pair repres pair conflict oper oper ot repres order pair case occur summar overlap bt updat data item broadcast case case case case case correspond part level loop case overlap set data item bt bt conflict oper bt result sg unconnect node bt acycl case case correspond part level loop case overlap set data item bt bt bt broadcast updat phase start bt result sg acycl case case correspond part level loop overlap set data item bt bt bt broadcast updat phase start point bt ow mobil transact commit point sg acycl broadcast transact continu origin broadcast schedul updat ad bt cyclic schedul algorithm updat phase clear depend bt ou result sg acycl reduc number data normal number data due data conflict cost size conflict data item larg video file reduc number data data item conflict updat transact data conflict broadcast transact updat transact reason serial order bt risk cyclic serial graph updat transact conflict transact data conflict involv updat serial graph cyclic data conflict broadcast transact updat size conflict data item serial graph conflict updat transact updat transact broadcast transact maintain check period equal maximum drop period mobil transact time set data item updat updat transact updat updat transact broadcast transact data cancel graph destroi immedi implement algorithm adopt broadcast model broadcast disk model broadcast channel hybrid model period broadcast data exampl describ algorithm appli broadcast disk model server broadcast data item period broadcast schedul comput begin broadcast cycl algorithm implement separ updat process execut updat transact divid execut phase updat phase updat process interrupt broadcast process updat phase began algorithm execut conflict data item identifi hybrid model channel channel period broadcast request data item algorithm implement separ updat process broadcast disk model updat transact begin updat interrupt period broadcast process broadcast process data conflict check algorithm data conflict broadcast place channel futur work updat order algorithm effici concurr control broadcast environ minim impact client broadcast schedul server requir check updat data item transact fall broadcast set broadcast schedul server data item updat refresh client data item client requir listen broadcast schedul captur item requir broadcast side broadcast includ conflict data item overhead process bandwidth minim client server view serial order updat transact thread futur work appli algorithm environ order read oper client account write oper mobil transact detect data conflict complic integr algorithm broadcast approach inform index tree signatur structur broadcast data item case mobil client mode wake captur data item inform broadcast schedul receiv data item broadcast schedul obsolet inform algorithm modifi case issu assumpt data conflict updat transact mobil transact low high data number impact broadcast model algorithm enhanc minim bandwidth requir possibl broadcast invalid messag updat item updat item order save bandwidth refer push pull data acm concurr control recoveri publish push technolog acm sigmod algorithm schedul singl multipl channel data technic report depart comput feb wireless challeng data commun vol oct sand organ ieee transact knowledg data vol pp hv broadcast strategi multipl wireless intern confer inform knowledg page novemb hv cach comput journal volum number page issu research technic purdu nov consist data mobil distribut intern confer distribut comput pp data manag mobil kluwer academ concurr control broadcast technic depart comput fernandez effici time dissemin data mobil ieee technolog applic
Agents/1077 1 approach vehicl monitor enrico maurizio martelli mascardi itali disi universita di genova itali fax abstract paper describ prototyp environ multiag system adopt develop distribut industri applic caselp emploi architectur logic procedur languag model ma architectur procedur behavior agent instanc execut specif obtain emploi rapid prototyp quick implement solut capabl appli distribut applic order assess polici data commun alloc concret implement applic consist remot traffic control surveil servic area italian emploi automat detect car plate read monitor gate caselp predict data commun perform statist polici alloc introduct polic control wide section repres power mean individu vehicl trace movement proper action control place distribut network car detect licenc plate read servic send transit inform control center detect match suspect law kind car monitor vehicl transit park area urban zone restrict access scenario vehicl monitor extrem complex involv larg number heterogen entiti human entiti insert monitor receiv alarm suspect physic entiti camera commun softwar client applic server remot sensor control imag process licenc plate due heterogen complex scenario assess real framework mascardi vehicl monitor requir care design full understand involv relat mutual influenc distinguish featur entiti involv physic abil autonom accomplish specif task interact entiti achiev common highlight suitabl system approach model scenario agent commonli entiti situat perceiv capabl flexibl autonom action order meet design object flexibl react time fashion happen pursu social interact agent human belong definit match featur entiti vehicl monitor applic understood ma metaphor properli adopt model identifi method follow order develop real monitor start initi specif requir develop work prototyp good choic easili test modifi design choic feedback impact global scenario comput scienc depart genova intern compani work servic autom develop work prototyp vehicl monitor applic model ma prototyp improv applic properli dimens commun final provid formal specif implement stage implement complet successfulli vehicl monitor apparatu instal section italian polic organ traffic monitor aim paper describ prototyp environ ma develop logic program group model prototyp vehicl monitor applic organ paper section describ section describ vehicl monitor applic section show prototyp applic model realiz caselp section compar approach simul present futur improv conclud paper industri applic benefit prototyp environ system develop applic ma metaphor delic ma approach adopt applic model term complex entiti process interact commun protocol act autonomi clear develop methodolog greatli applic develop job ma approach vehicl monitor comput scienc depart genova author develop prototyp environ ma develop method set tool languag support develop stage acronym caselp stand complex applic specif environ base logic caselp origin conceiv environ specif agent provid logic languag research caselp specif languag ad caselp order make closer habit user accustom lp caselp integr specif languag mean translat execut program written extend prolog commun capabl safe manag state updat execut agent control engin maintain trace event user monitor statist simul execut caselp framework graphic depict fig integr extern compon shown high level specif agent written specif languag section futur uml specif languag integr work describ agent suitabl subset uml translat uml agent execut prolog agent textual uml high level execut spec compil process specif agent legaci softwar specif agent execut high level commun link integr legaci softwar caselp engin fig caselp framework prototyp deal implement execut carri defin experi mascardi methodolog section describ section describ tool caselp support step methodolog caselp approach ma develop separ task defin agent agent intern compon control flow task defin knowledg agent agent reactiv set conceptu term humanlik data structur control flow make architectur work agent architectur multipl applic agent involv vehicl monitor applic share reactiv reaction trigger recept margin face issu relat definit architectur consequ choic agent architectur sake method paper simplif complet caselp method limit step develop vehicl monitor applic tool languag give overview section exemplifi adopt vehicl monitor applic prototyp method caselp method summar static descript applic architectur step applic develop class agent applic class kind agent belong yellow page interfac extern architectur servic requir provid agent instanc class form interconnect servic provid agent link servic requir agent descript commun agent provid request servic specif agent provid requir servic step sequenc exchang content descript procedur knowledg agent class agent instanc belong agent step share procedur knowledg depend agent class commun protocol agent adher step method agent procedur knowledg state formal depend agent architectur ma approach vehicl monitor verif test agent specif languag adopt specif agent execut verifi properti ma behavior implement prototyp prototyp implement specif agent previou step translat execut piec code order implement detail architectur complet burden task fall applic develop caselp approach provid applic develop librari architectur architectur librari verifi test emploi execut test final step method prototyp test order evalu behavior situat kind test ensur prototyp exhaust test initi condit place good choic test case high confid prototyp correct prototyp develop import feedback system behavior flaw previou step method refin cycl method step prototyp obtain prototyp tool languag simpl architectur descript languag step method architectur descript languag adopt describ main defin class agent ma defin instanc class defin agent constitut defin direct link instanc servic provid agent servic requir agent vehicl monitor applic section full syntax tool model step method describ model ma agent commun languag subset kqml model defin sequenc messag perform content messag relat sc defin eventu start fm messag sc denot start messag handl receiv agent denot eventu start messag handl receiv agent start receiv agent step method agent procedur knowledg defin caselp languag describ simplest suitabl simplest kind reactiv proactiv defin reactiv proactiv rule reactiv mascardi rule form messag msg check condit rule fire messag agent condit action execut condit express true current agent state order execut sequenc action satisfi action deal state updat commun proactiv rule similar reactiv depend state condit agent vehicl monitor applic section syntax found hhf applic agent involv conceptu term mentalist emot requir complex architectur reactiv proactiv situat descript agent formal hhf extrem languag share common architectur procedur knowledg initi state specif intern structur control flow caselp agent separ specif knowledg design describ agent architectur knowledg hhf conceiv languag proven suitabl complet descript describ adopt hhf architectur specif languag procedur knowledg specif languag ma agent state data chang execut part procedur inform chang execut engin control execut flow agent provid metainterpret program data program oper order describ agent architectur support hierarchi concept descript agent abstract concret complet definit term knowledg initi state approach combin featur borrow paradigm architectur fulli abstract agent class share concret architectur extend class domain agent instanc plai role object oo simpl procedur languag describ engin agent agent program express languag engin develop engin exist agent work extend librari featur make suitabl adopt industri user accustom imper paradigm logic ma approach vehicl monitor hhf linear logic languag hhf execut languag model concurr resourc sensit system base gener specif logic languag forum hhf logic combin featur extens logic program languag goal implic notion formula resourc basi linear logic hhf collect guard kind consum resourc order appli resolut step reason profit model dynam agent state agent move state support hhf easili model autonom concurr entiti form ma adopt hhf suitabl safeti critic model check ensur specif correct wrt critic properti relev featur applic model hhf prove properti specif prolog agent target languag implement extend prolog languag defin standard prolog extend commun capabl safe state updat predic state updat safe backtrack predic commun agent send messag perform block messag recept compil hhf caselp simul visual obtain prototyp test caselp simul simul mean set simul time grain simul paramet commun network set latenc reliabl commun channel coupl commun agent associ weight messag repres measur applic repres number byte code messag rate messag simul complet trace event state chang develop decid monitor statist inform messag maximum averag number messag type time unit time maximum averag weight messag time unit time interv standard deviat graphic version simul execut statist provid caselp visual vehicl monitor design integr remot surveil includ automat detect read licenc appli gate servic park urban sector traffic commerci area mascardi applic user distribut configur base call plate softwar compon host standard pc equip frame grabber link camera relev call appli camera video specif vehicl pass sensor motion detect limit number relev video imag segment local region charact segment detect licenc plate special ocr recogn context process feedback region segment camera adapt chang specif model implement monitor vehicl enter exit servic area reggio specif characterist heavi traffic dai main connect south vehicl enter exit servic area peculiar traffic monitor automat alarm consist detect signal improperli rest transit defin recogn car plate number relat stamp refer imag side detect black list list signal licenc plate number alarm transit licenc plate match item black list configur distribut protect cabl satellit link limit includ physic softwar execut center client site manag client visual vehicl modifi black requir oper user applic central server machin server coordin commun execut center surveil area dispatch alarm ec request list ec alarm manag central surveil area host intellig sensor pc locat servic video frame local gener transit alarm store local black send transit alarm applic server commun topolog applic ec sa link repres fig direct link ec sensor sa direct video function emploi camera part intellig alarm system commun place messag dedic session protocol current evolut higher standard middlewar corba server corba http ec server main messag ec applic server ma approach vehicl monitor fig monitor applic architectur request transit relat request black list relat answer black list specif signal licenc plate number limit subset incom alarm request attent main messag applic server sa request updat sa local black list fast alarm detect directli server care dispatch alarm incom transit incom alarm data alloc central transit distribut commun strategi model order solut achiev physic implement real wan model entiti behavior entir messag exchang system deadlock absenc perform applic prototyp mean caselp prove section care work made make specif modular extens account possibl applic server manag exchang inform track mascardi realiz prototyp caselp section exemplifi tool section step method languag provid caselp environ applic aim caselp develop suitabl languag applic featur static descript applic architectur introduc section class agent identifi execut center surveil area common server sa call applic server previou section reason develop work prototyp understand maintain distribut monitor transit maintain surveil inform transit occur specif central ec sa transit occur surveil static descript central distribut set small differ monitor transit case central surveil area asynchron send updat transit ec sa server frequenc updat experi order ec inform interact ec sa server answer surveil area send inform transit ec sa ec ec sa server obtain inform queri forward sa involv answer combin uniqu answer ec rest deal ma specif central solut transit specif distribut case similar ec sa ma approach vehicl monitor ec sa link descript commun agent space reason describ complet model agent ma limit describ relat alarm transit vehicl place surveil area start surveil area recogn alarm ec sa execut center interest forward alarm sc relat start messag messag written style sa inform ec inform relat descript procedur knowledg agent describ procedur knowledg agent fragment code describ action ec server receiv alarm surveil area coher previou action agent perform forward messag execut center interest reaction messag formal similar fashion messag check mascardi mean fragment alarm agent ec server assert repres current knowledg match interest list interest symbol variabl match find forward inform relat alarm interest execut center commun action send messag list recipi prototyp implement languag agent execut verif step directli prototyp implement partner industri quick phase requir complet clear formal agent perform method greatli make implement quicker fact translat code implement action agent perform easi action concern state updat messag primit fragment code describ rule agent ec sa server appli manag alarm implement rule rule provid execut test obtain statist inform execut weight assign messag exchang repres number byte messag weight evalu account overhead due protocol simul prototyp central case prototyp distribut simul execut assumpt paramet chang run dealt frequenc vehicl transit surveil frequenc oper requir oper execut center updat queri vehicl final amount circul vehicl ma approach vehicl monitor frequenc assum valu transit frequenc oper execut center total number circul vehicl central maximum length batch transit reach surveil area ec sa maximum time success updat transit left parametr simul establish kind messag monitor tabl alarm tabl relat messag alarm tabl organ result simul compar distribut central case understand condit prefer solut tabl report subset result comparison tabl messag alarm run id amp sim sim sim sim sim sim sim sim sim char simul identifi central distribut simul run sim sim sim transit sa oper ec minut circul vehicl sim sim maximum length batch wait time sim sim sim transit sa oper ec minut circul sim sim sim transit sa oper ec minut circul vehicl stand number messag time weight byte time standard deviat messag weight time slot length set simul time result obtain comparison mascardi coher behaviour alarm messag chang distribut central case initi condit manag alarm messag depend vehicl transit surveil area organ remain messag concern messag alarm distribut solut turn central case vehicl transit oper execut center minut group sim sim sim reason assumpt transit oper minut group sim sim sim differ central distribut solut provid maximum length transit batch maximum time success updat transit central set chosen properli note transit interv repres low refer lane surveil area main lane decid adopt central solut real apparatu fact bandwidth requir case threshold due satellit develop compon relat futur work disi cooper year model rapid prototyp complex distribut applic unlik commerci softwar packag simpli sold instal autom system tailor custom base common present configur function order reduc integr custom minim possibl import predict impact commun configur strategi resourc correct perform larg distribut system simul tool good answer electron mechan suit model distribut case tool power focuss intern object design commun distribut aspect model prototyp ma caselp fulfil intermedi understood rule express suitabl languag present easili extend ma specif ad function agent rewrit specif scratch applic ma model defin mind extens realiz futur drawback industri environ languag prolog ma approach vehicl monitor relat encount conceptu resist poor knowledg softwar design ongo work research uml integr caselp aim bridg gap habit industri user function provid caselp tool foreseen develop model detail behavior common frequent model system focuss describ specif applic architectur commun agent step section integr legaci softwar consolid packag model physic distribut caselp emploi standard middlewar applic scope model approach envisag distribut control electr power inform servic optim mail transport automat postal sort complex govern softwar control join strategi compat modular plant refer zini logic program synerg combin applic semant kr vw ds logic program page springer zini system develop softwar engin proc san januari lnc delzanno logic program linear logic phd universit di dipartimento di wooldridg roadmap agent research develop autonom agent kramer distribut softwar engin proc intern confer softwar page ieee comput societi press zini specif heterogen agent architectur proc intern workshop agent languag zini logic program framework softwar prototyp proc intern workshop softwar develop comput logic septemb zini specif simul system caselp proc septemb finin evalu kqml agent commun languag intellig agent ii lnai miller specif logic theoret comput
Agents/1078 1 dialogu model techniqu system virtual environ bw van faculti comput twent po box netherland march abstract text present result ongo aim develop framework develop multimod natur languag dialogu system oper virtual environ aspect multimod presenc virtual environ chosen main focu research argu specif techniqu form basi framework gener overview evalu exist specif techniqu interact base literatur previou research result includ process interactor agent system agent system subdivid intent product rule agent commun agent agent architectur agent system base updat notif mechan found interactor facilit function found agent platform commun proce buffer channel agent manag number channel agent queri agent inform properti environ argu awar constantli chang virtual environ system illustr exampl agent system arbitrari languag argu languag base product rule natur choic content project descript natur interact framework develop natur interact current state research process commun model model discuss process algebra discuss model process algebra interactor dataflow discuss agent intent logic product rule system task negoti scheme agent platform agent architectur agent commun languag standard discuss agent system prototyp discuss futur research develop guid overview api small design guidebook exampl refer project descript text result work phd student part en group van op den review part version text natur interact comput peopl attempt make interact comput system useabl learnabl attempt natur languag dialogu simpli call dialogu system dialogu system system understand mimick natur human linguist behaviour human interact learn interact gener framework build dialogu system includ methodolog framework design guidelin solut templat specif techniqu evalu techniqu jone clear framework dialogu design remain hard problem attempt dialogu system impli system rigid deal user utter limit domain nl knowledg dialogu manag remain hard problem gener theori provid gener solut exist develop dialogu system matter iter develop engin framework engin framework ensur qualiti point problem offer solut practic develop framework requir gather extens data peopl argu improv made complementari inform channel displai graphic dialogu effect enabl control dialogu make easier manag human cue complement process lead improv lead idea multimod dialogu system virtual environ unlik regular dialogu system involv concurr dynam architectur dynam ve highli specif structur techniqu exist manag complex graphic user interfac basic form ve depict domain form passiv manipul complex issu show exist complex manag techniqu develop gui dialogu gui design attempt provid natur interact mimick physic object system combin dialogu system obtain multimod natur graphic combin ve concept ve manipul multipl dialogu system physic presenc world current virtual music centr make multipl simultan user combin network ve user dialogu system gener framework develop framework develop natur interact goal research develop framework design interact pattern dialogu system chosen model multimod lot progress made framework specif techniqu specif languag guag defin standard librari includ design solut softwar librari evalu techniqu includ evalu setup metric methodolog prescript develop kind specif evalu order start develop specif techniqu ve provid basic facil structur ve provid awar dialogu system situat extend exist specif techniqu specif techniqu obtain extend standard shorthand librari obtain exist framework gui dialogu experi subject futur research evalu techniqu methodolog defin requir hci extens practic experi expect fall scope project specif techniqu consist specif languag languag mean explicitli leav aspect system specif problem specif techniqu specif languag part techniqu highli unambigu relat realiti languag languag defin mean formal coupl predic call formal languag fundament differ formal specif languag program express program languag unambigu defin comput behaviour level detail program languag consid high tractabl tractabl properti specif languag program function languag ly border specif languag program languag express theoret describ domain languag limit make theoret imposs fulli describ system languag weak languag complement languag fact system express mean languag necessarili model form model cumbersom practic useless tractabl properti cover situat tractabl write larg formal specif make mistak hard detect actual test comput feedback extrem costli write larg comput program test prototyp abstract version program peopl troubl write small specif mean specif languag execut great advantag kind comput feedback simul user behaviour automat verif intern consist formal theorem autom syntax type check cognit tractabl highli readabl relev parti includ user design relev aspect problem obviou read reason specif techniqu provid meant aspect stress import note softwar develop reli heavili extern specif memori aid develop expert develop note languag describ model specif languag pure specif larger system system thousand million make unread larg model tractabl gener model languag specif process algebra note properti similar found similar overview evalu emphasi hci specif softwar engin ai techniqu aspect properti treat cognit tractabl properti shown techniqu test larg great techniqu interact limit number gener approach identifi greatest common denomin techniqu model system collect separ modul privat data explicit specif interact world list wai model softwar engin aspect ve proven difficult list give indic kind model issu list current practic issu develop identifi inform observ strictli modular structur modul explicit limit interact modul make softwar develop gener cognit simpl reason modul meaningfulli examin isol mainten made easier knowledg model dialogu system ve requir knowledg object ve specif ve object modul make knowledg easier model formal abstract specif made exist directli knowledg dialogu system simpl list ve object locat enabl linguist refer made complex knowledg object behaviour behaviour enabl dialogu system track idea object interact specif wai concurr interact multipl agent oper structur ve highli concurr modular concurr problem manag level modul concurr process privat data modul enabl basic concurr data access problem manag easi agent track relev inform environ model modul interact make easier model chang notif multipl user distribut servic unavail multipl user connect disconnect time easi describ case modular exist avail servic client defin level modul present absent model interact model easier modul identifi handl failur interact modul addit softwar engin explicit facil human factor issu model framework enabl commun peopl typic involv ve develop gener human factor facil develop framework provid specif conceptu model user task model user proper conceptu task model highli compar describ languag provid framework dialogu system develop framework model user goal manner consid essenti determin system reaction user utter prototyp framework enabl prototyp built easili prototyp import feedback tool usabl engin evalu evalu log relev proper tool abstract properti number oper visibl relev dialogu system common practic collect user utter data prototyp built jone system modul zoom level model techniqu specif focu level micro perspect singl modul model techniqu meant model structur behaviour singl specif system multipl modul built macro perspect system specif languag provid overview system obviou dataflow framework offer guidelin structur standard set modul current state research research start literatur give gener overview field dialogu design hci result studi publish technic report model languag predic logic notat process algebra csp csp turn interest describ dynam easili attempt complet coverag csp model workshop paper csp model web includ found csp high comput tractabl enabl intuit descript aspect limit facil data specif parallel process cumbersom find detail section examin advanc interact system model decid model techniqu overview exist approach includ review establish techniqu exampl process commun model model classifi process interactor agent system agent system subdivid intent product rule agent commun agent agent architectur properti process commun framework review classifi set featur commun protocol interfac compat updat reaction data depend knowledg base uniform knowledg model task negoti flexibl architectur lookup servic open system rout migrat network commun commun protocol messag process send order basic main featur process algebra object model provid model provid mechan react propag effect chang occur process system relev process interactor dataflow model provid agent system knowledg base mention import featur agent system kb typic store number rule set defin behaviour agent kb agent typic languag agent behaviour uniform agent exchang knowledg uniform agent model provid task negoti mean facil model task possibl includ task task incorpor plan mechan classic ai agent request task request negoti decid task achiev flexibl account agent happen present failur model model possibl task note exist task negoti model limit negoti strategi task qualiti task failur task structur agent lookup servic servic provid separ maintain knowledg agent system descript agent match properti featur system constantli vari number open system migrat reloc program comput disturb execut rout pass messag comput network rout physic medium agent comput visibl practic network commun problem address model concept mechan found process algebra agent system found system view model commun gg model oldest date back consid model made oo develop popular conceptu view gg model commun abstract data found exampl smalltalk book cite point view close recent model section exampl smalltalk book typic exampl model instanc object consist number intern determin state number specif method depict specif paramet return oper intern variabl object method object class object method object refer object call method call method call method call messag pass subset method refer determin class object refer class class object hold refer class gener order classif class defin inherit properti import method variabl class defin term call subclass call class superclass class class defin method defin method class call abstract actual method fill subclass class model provid classif call class class object class object factori object method object class stand return refer arbitrari number object class creat call method class object extra method variabl manag object class object hold refer class object point execut method execut comput call locu execut thread thread run simultan comput thread run insid exist refer object object run object delet object gener delet forc refer drop idea method call messag pass suggest abil object execut separ thread object object react immedi messag pass make sender wait finish uniqu defin control flow model singl thread case multipl thread coupl specif object separ thread class multipl thread run insid singl object discuss oo model techniqu good specif techniqu gener remain open question comparison softwar built oo softwar built tradit program techniqu yield result problem point oo design invit modular mean modul close coupl experi show understand behaviour typic object class difficult process appar requir understand class wai class control flow program hard locu control constantli jump object behaviour class depend superclass mean understand inherit class requir understand superclass optim inherit structur crucial depend natur problem domain domain inappropri choic made easili close coupl modul inherit result inflex maintain program final note origin smalltalk languag close integr gui fact provid gui descript model gui compon correspond send messag result user oper compon gui program librari arrang similar manner import contribut oo model model provid gui process algebra inform descript process algebra csp cc conceptu compar procedur program languag lead process algebra model commun section process algebra describ system number parallel commun channel identifi process thread process creat process unlik oo automat creat thread process process effect delet dynam process form similar finit state automaton long total number state system remain system dynam behaviour verifi main advantag process algebra commun process proce identifi initi particip process signal readi specif set call commun determin process system csp sequenti commun symmetr order determin process channel set channel process particip execut start set call chang lifetim process process subset alphabet process channel alphabet commun channel proce cc commun commun asymmetr process reader writer commun proce channel reader writer process alphabet order determin system behaviour csp commun model atom particip particip simultan particip process submit process remain block case commun channel channel typic chosen randomli data pass conceptu channel data pass channel model arrai obtain concaten origin channel data domain pass byte repres end string write data channel model request specif channel read request channel arrai reader subset forbid valu written possibl read fundament differ rang process limit constraint eventu chosen cc slightli data model capabl writer write specif valu reader simpli read constraint offer constraint reader read unlik reader read rang reader enabl constraint eventu written csp creat process order combin scheme creat channel process scheme found csp languag channel hide renam construct process set channel privat commun start process creator call channel hide process channel renam startup scheme commun structur system chang arbitrarili section altern model discuss mention section evalu csp specif languag dialect minim subset channel hide shorthand pass mean system fix number parallel state automata gener consid suffici advantag system model system architectur modul interfac specif explicitli task model csp task hierarchi natur express establish task model gom task model execut system model gener prototyp csp descript coupl implement make csp event trigger function translat user input event csp event prototyp gener illustr dynam aspect verif system dynam properti verifi model check track bug formal identifi usabl problem limit requir write parallel state automata cumbersom problem csp specif behaviour complex agent state automaton larg remain abstract csp make specif smaller split agent process multipl process clear forc languag complex agent necessarili ensur process correct alphabet increment chang specif process turn ad temporarili comment process alphabet made part error made specif alphabet problem limit facil data model practic model pass complex data practic model process maintain lot data intern complementari notat includ data dynam separ aspect found loto facil verif data aspect limit abil model process arbitrari commun channel system dynam number process direct commun parent children cumbersom extra shorthand wai model cation address section central synchron commun model ineffici distribut environ mean dynam system directli transcrib final modifi automat transform simpl solut prohibit commun model obtain greatest common denomin found csp cc cc improv csp term cognit tractabl origin reason csp chosen cc csp descript map close logic constraint make easier describ addit constraint system ad extra make easier transcrib system logic specif note concept multipl constraint form specif written mean alphabet specif problem mention part fundament problem system argu separ alphabet specif kind similar type comput point program error effect unlik type process specifi wrong alphabet result system clear deadlock situat kind clear error indic kind doubl check produc compil error mismatch alphabet specif action behaviour specif type check typic caller call format call reduc back caller specif alphabet check specif belong problem found write csp work csp system order model lone reader multipl writer scenario easi fit natur asymmetr model final gener cc model closer tradit procedur program languag csp mean transfer program knowledg easier cc peopl ad process mean limit behaviour rest system term procedur process rest program action model process algebra clarifi correspond object model process model csp cc model offer describ arbitrari address problem mention section model serv step formal account dynam advanc model directli model privat commun process creator achiev add explicit notion pointer refer pass kind refer privat channel data channel process receiv refer access channel refer scheme complet substitut channel hide scheme found extens cc simplist readili closer ident object channel pointer scheme adopt scheme found model mean process separ set uniqu number process channel process obtain process ident separ set channel model concaten similar process obtain separ set channel concaten ident channel commun obtain concaten method object analog method call method read written enabl possibl commun process impli separ channel pair process commun privat concaten mean refer process concaten channel origin process alphabet determin refer channel refer channel process channel csp system channel defin concaten complet set method process ident id alphabet id id access alphabet alphabet process set access set method process access process spawn class factori alphabet channel process class finish start potenti call call process exist long caller block process execut method privat solut make class factori block channel belong caller exist model effici depend facil shorthand offer model checker model checker examin power deal kind composit model remain sketchi cc version turn readili implement ad arbitrari commun easier worri requir set channel process enabl method call stand process call verif languag easili channel arrai construct channel defin chart arrai channel defin chart readi write channel readi read type loop defin od defin chosen execut iter loop oper signifi sequenti execut action program start execut init process construct found program languag defin arrai channel maximum process system chan chan chan chan id handler channel process creator obtain id commun id handler chan chan byte endless handler wait process creator queri id process creat expect process read id od process byte process ident intern data process read id process set method order compli dynam method call return caller remain block finish unlik restrict tempor order constraint od startup procedur init byte refer process creat run start id handler creat id request process read id run caller call method state space remain model check exhaust state space smaller csp maximum set channel note process delet account id handler eventu run total number process remain limit hard id handler track exist privat boolean process signal delet exit note real garbag process automat harder add note semant constraint present model enforc process prohibit channel obtain valid refer refer model closer refer model real objectori constraint model refer data type limit assign variabl type model style thread separ process thread creat creat process method run return thread start call method process retain regular structur similar java thread scheme process algebra style concurr introduc simpli process deviat strict interactor dataflow object model process algebra form basi describ interact interactor dataflow model extra featur make chang propag interact system easier manag interactor basic special kind object exampl interactor model interactor store actual data model abstract object view modifi data made data object modifi tor propag object structur restrict wai system packag notif data flow system relev propag scheme fig main differ respect regular model interactor provid standard facil defin call structur usual object call structur provid callback enabl object call method registr interest parti regist specif updat messag interactor restrict system dynam manag pac prescrib strictli hierarch structur establish interactor model provid standard form softwar librari vr specif languag vrml model conceptu close interactor model vrml world consist data node specif input output point event arriv input point trigger procedur insid chang node produc event output point basic case simpl data input point chang output point notifi node output point spontan gener timer event arbitrari rout connect input point output point mean rout long input data type match output point rout lead similar rout model found event event listen method analog vrml rout command sensor declar user click drag oper group node node physic conceptu arrang hierarchi sensor enabl detect oper sibl node hierarchi sensor sphere influenc overridden sensor situat fig model analog event propag fig advanc dataflow model found gui develop kit amulet gui object number attribut specif attribut ad delet runtim attribut determin mean attribut formula determin formula term object attribut state vrml formula implicitli defin rout object attribut attribut time updat arriv amulet group defin system hierarchi object unlik amulet formula explicitli term hierarchi amulet illustr file edit iew window ellen reset oct public access messag po reset newsgroup list group id control node header list list ellen id figur model netscap applic netscap built interactor approach window scrollbar control pan posit list window notifi select control react select reload content window root node sensor set detect node figur vrml sensor detect scheme node specifi physic object special script sensor node node arrang tree sensor node enabl click drag physic object sensor includ object tree sensor node overridden sensor node locat tree return return creat set set set set set set set set set statement defin formula return integ return width height object owner return width height attribut object owner rest statement defin group object circl rectangl insid width height defin defin circl size group rectangl size circl group object size circl rectangl automat adapt size rectangl insid group find insid adapt size object size structur queri design compon amulet defin standard interactor compon oper sibl object vrml find oper owner user event window hierarchi root window event event propag store queue event event discard store queue discard figur event propag mechan hierarch window structur window root window call parent user gener locat specif window window subscrib specif type event event gener window subscrib store window event process process manag window window subscrib gener propag parent window discard event spontan gener event model special made system node oper parallel recent java node connect sync denot synchron area node connect sync node execut model event sync event synchron connect node node chosen subscrib specif type event discard type event node send asynchron messag sync node delai send deliveri arbitrari figur synchron event asynchron event figur event model figur show sync node node indic synchron area synchron messag sync send node time instant asynchron messag thick arbitrari delai discuss distinguish kind explicit implicit event node explicitli send event event stand creation chang variabl reaction receiv node arbitrari effect event lead notat depend defin form valu valuei implicitli gener event updat event gener result chang depend structur system diverg path node node uniqu race condit occur node receiv multipl updat result singl chang fig path node uniqu multipl path graph exist node cycl figur propag graph structur node top spontan number time step event pass rout tempor order shown case dataflow implement ordinari method call leftmost extra node shown spontan chang valu note spontan chang result propag structur distinguish kind explicit rout implicit rout addit usual explicit model provid hierarch structur mechan structur implicitli determin exist addit rout find posit posit children typic rel posit parent event propag event sensor structur facil amulet gener model implicit facil node queri structur depend specif lead declar declar rout term properti node lai rout directli specif node interactor model give detail account dynam constraint model place system structur reliev dynam descript dynam classifi type fig sender receiv sender buffer receiv sender buffer buffer receiv data data synchron buffer sender receiv process process send turn serial asynchron sender sync receiv receiv parallel figur sequenc diagram event pass mechan axi denot time vertic line denot node lifetim solid process readi receiv dot process readi horizont arrow denot arrow denot network commun solid commun dash commun data synchron synchron event handl sender wait event receiv receiv event arriv order synchron model basic model process algebra provid basic node handl event readi receiv event send output event immedi mean receiv readi receiv type sender wait readi buffer special case synchron commun commun buffer mean incom event store queue part receiv handl node eventu mean sender wait receiv reach readi state process algebra typic provid standard shorthand describ buffer commun asynchron asynchron model distribut commun case requir sender wait network typic store outgo event local event transfer eventu mean event arbitrari time event sourc arriv order model found commun model constrain asynchron model model specifi event sourc arriv order practic part data network transfer lost order arriv data serial event handl propag arriv includ interactor java event listen amulet method call return model section instanc serial model send action sender forc wait return signal event handl complet relev process ensur event gener call concurr problem execut order serial prevent event arriv current handl complet parallel event gener handl simultan model model enabl possibl model resolv cyclic time updat handl subsequ updat ensur simultan handl data multipl object stai rel posit move unlik object process algebra interactor model facilit macro issu micro issu structur mvc pac provid structur design guidelin rout independ part declar separ object commun make data depend facilit dataflow part system standard facil treat program data implicit rout scheme agent agent term definit classif agent system exist lectur classif typic defin agent term social classif includ gener applic area softwar properti inform internet interfac agent argu import aspect agent concept metaphor design metaphor view modul autonomi action flexibl request handl offer model robust softwar easi understand intuit fit neatli possibl offer internet internet search electron perceiv group comput user comput expert user interfac smart autonom advantag metaphor mention literatur lectur idea complex commun protocol modul make design system coarser composit granular oo granular oo system prove fine section practic wrap legaci system insid agent hope call idea discuss argu agent paradigm creat describ modul term complex possibl vagu human modul behaviour clear simpl paper address electr load balanc problem approach complex issu problem system collect converg solut issu address control system theori problem made easier model approach plain control system theori complex move commun protocol data complex exampl agent commun prolog commun languag problem mind complex languag interpret prolog version engin prolog interpret fatal problem process messag languag approach directli execut code suppli program behaviour system consist modul commun send arbitrari code execut hard understand intern includ program freeli word agent type softwar modul process privat data explicit long metaphor fit spirit view give overli long definit agent attempt definit found literatur suffici refin concept interact system develop framework develop framework rest descript techniqu standard librari fundament includ techniqu emerg focu recent interest agent concept intent logic varieti literatur discuss logic agent distinguish characterist languag avail construct describ intent product rule languag product rule languag special kind program conceptu close logic tradit method ai program meant se interact intent concept interact world show natur product rule base specif techniqu task negoti scheme softwar system incorpor task negoti scheme agent platform agent program focuss practic network commun typic provid softwar librari internet commun scheme rout locat agent agent architectur agent architectur model prescrib complex agent built smaller compon agent commun standard context agent agent commun languag attempt worldwid commun standard languag reflect lot exist idea subject interact discuss detail intent logic intent logic gener logic framework describ agent mental state level belief argu explicit model agent system framework defin extra set oper top exist logic framework describ time event exampl bdi desir base tempor abil result base dynam logic oper bdi sheet dx hold qx hold hold believ hold privat goal achiev intend achiev believ intend achiev believ exist agent achiev assum privat goal doesnt privat discuss ideal situat agent complet rule simpler rule agent behaviour mean rule section easi write kind advanc logic small expert make mistak problem meyer exampl intent framework popular agent commun standard form logic requir reason predic verif modal logic comput behaviour tractabl comput feedback tool remain theorem prover syntax checker relat express intent logic comput program point includ class logic enabl model knowledg knowledg agent enabl express intent logic light requir section specif languag question model languag model gener framework framework specif fill concret framework note peopl word refer bdi kind explicit model intent section product rule system basic product rule specif complement state automata order event explicitli state system number behaviour number rule condit express term action chang fact condit hold criterion product rule found expert system pressur normal abandon patient action note condit rule made rule trigger goal plan system action make condit perform fact chang unexpect possibl chang action initi action fact execut sequenc action mean system reaction fact split process state maintain part fact set product rule process state form pend goal note correspond interpret goal intent found intent complex model knowledg state model behaviour set sequenc goal long histori hci task softwar engin illustr complex formal hci task model languag move cursor move cursor rule defin user delet word text editor rule defin cursor top word case case rule defin word cursor delet unlik structur program plain hierarch task model enabl arbitrari manipul goal state mean pattern match product rule system kind pattern match facil built found actual cursor posit match goal cursor posit illustr monkei object goal weight statu type object statu activ type hold object hold grab hold statu liter statement defin tupl data type length number tupl exist type set tupl set fact system pattern match consist match specif fact test condit part rule match rule trigger valu field match found action part rule specifi monkei pick goal pick object object locat pick goal mark satisfi pattern match view abil sql type queri condit part rule fact set fact form found sql type mean pattern match regular queri engin interact agent interact world model fact chang spontan model exist specif build system product rule interest desir hierarch composit agent turn agent agent connect fix channel disabl enabl system run agent rule set rule world interact manag compon search fix setup number discret locat impass screen place absent fact updat world inform mainten assert output compon illustr data constrain pattern match posit data type specif subset set fact data type part type separ activ naiv implement product rule system endless condit check system check condit iter case sleep event world occur fact system implicitli rule method rule queri subtl model figur condit chang subset rule altern usual type event trigger rule subset condit true result event immedi obviou activ condit form event condit action mean simplest rule implement plain event handl loop plain event handl loop simplest type product rule system activ regular updat made directli rule consist regular updat translat updat condit action condit action denot updat denot updat finish abort rule client order amount order stock case order amount stock rule stock order monei pai order client order result stock order paid abort discuss product rule system enabl descript complex successfulli ai applic complex behaviour rule system rule easili descript softwar mainten product rule base specif offer complement process enabl complex part agent easili success histori show useabl peopl comput expert task negoti scheme provid gener model task negoti ambiti goal model exampl task negoti model describ model team format intent logic team form singl goal tn relat action ti address detail number potenti team member queri abil individu action initi convinc individu agent cooper goal mean work detail set agent determin collect achiev broadcast signal task alloc begin achiev goal decaf task hierarchi goal task eventu atom program written languag program input specif output data flow task action rout coupl output input action task model dataflow node multipl output produc output input task sequenc subtask call atom subtask remain task recip data model world state action occur note similar global variabl properti atom exist determin global group util function agent determin optim recip task achiev discuss task tempor order atom similar usual hierarch task model qualiti specif durat chanc semant atom action gener system issu manag scope flow data action address detail overview remain actual negoti part task negoti make model regular immatur agent platform agent platform agent oper provid librari make program easier dozen agent platform recent model open distribut dynam number perform lookup function lookup function gener perform separ agent call matchmak jatlit appar popular agent applic system layer agent layer bottom abstract describ abstract api provid commun concept messag agent commun modul provid method react receiv send messag base implement abstract layer tcp kqml basic support receiv messag messag kqml section detail descript kqml router rout messag queue separ rout agent call agent messag router email locat messag relai protocol api access exist internet layer locat kqml expect router jatlit wrapper standard internet servic task knowledg function provid kao kao agent exist environ call agent domain domain track exist agent domain proxi agent commun agent domain matchmak obtain agent capabl descript capabl commun protocol agent automata agent plai specif role protocol protocol part coher set call suit specif suit requir agent capabl particip specif agent discuss model typic agent platform found provid internet includ process migrat provid facil formal protocol specif agent lookup servic facil model physic domain rout mechan consid case prove deleg lower layer interest featur agent platform agent lookup servic agent lookup gener perform special type agent call broker facilit find descript properti agent facilit model import mean obtain ident agent properti descript facilit assum protocol modul object class facilit conceptu close dynam unix ld java classload multipl facilit specif agent facilit stand specif context agent platform explicitli discret locat agent resid migrat similar autonom robot insid locat track agent locat model physic locat defin conceptu context start screen displai window sound distribut environ assum distribut system gui user assum agent find agent task displai window task window displai screen assign task gui gui agent access screen task made displai window specif user inflex option send request directli agent commun assum agent option restrict request specif user make user implicit agent physic context doubl address mixtur implement conceptu issu older version jatlit user bound specif physic uniqu defin access gui physic context constrain action autonom robot system distinguish gui gui thing tradit system flexibl conceptu good idea separ physic context layer manag physic issu context disjoint facilit global facilit local local facilit specif agent context overlap user context user facilit class context screen facilit displai user oo ow screen figur facilit conceptu physic context figur illustr request figur displai window specif user specif type screen describ situat found agent physic context conceptu constraint user implicit describ illustr conceptu arbitrari physic context screen class implicit describ scheme agent kind refer facilit figur refer type ve object agent physic presenc ve context visual user situat ve user interfac window user interact user screen simultan agent user dialogu object topic current physic relat view agent system agent facilit kind stand kind distinguish label refer facilit type basic facilit lookup scheme system straightforward manner figur agent architectur agent architectur provid standard librari composit guidelin build complex agent simpler macro aspect agent design simpler agent address specif aspect function complex reaction social maintain world model complex agent call hybrid agent overview agent architectur found section agent architectur interrap interrap agent local plan cooper plan layer layer agent specif capabl interrap includ softwar librari specif meant type agent architectur offer part composit guidelin desir model section desir agent task agent interact mainten agent world interact mainten world process cooper manag discuss basic composit structur system similar layer found bottom layer split separ modul agent specif task configur agent chang found interrap interrap architectur detail workabl standard librari develop complex agent applic built agent commun languag standard kqml queri manipul acl foundat intellig physic attempt intern agent languag standard messag indic illocutionari mean request messag messag type number valid type repli messag content section bodi messag format content languag ontolog sort protocol determin messag follow separ languag gener leav detail open exist notabl addit messag type inform messag bid sl auction messag type defin bulk document languag describ number messag suggest frequent specifi formal requir messag type agent knowledg note semant remain specifi primit messag messag built overview type classif partial kqml action negoti unlik type acl elabor kqml specif perform action action type action request acl cfp request cancel failur kqml achiev unachiev knowledg inform action call action accept perform action reject request action action request agent stop action inform action fail request action make content true request undo effect previou achiev give command directli manipul anoth knowledg simpli suppli inform note kqml perform state versu suggest agent knowledg base acl inform confirm disconfirm kqml deni insert knowledg queri acl kqml error signal acl kqml error content sender knowledg base content found sender knowledg base negat content sender knowledg base insert content undo previou insert delet sentenc match queri delet sentenc match queri undo previou delet insid request question insid request question object descript truth specif proposit object descript exist specif content variabl instanti content true variabl instanti content true signal error previou messag signal agent understand unabl process previou messag automat request manag contin stream data kqml acl perform request updat agent knowledg acl offer request action result knowledg inform kqml enabl queri result answer stream messag kqml offer gener stream control perform acl subscrib request action condit true request action time condit true object subsequ object kqml subscrib updat perform messag instanti eo signal end stream messag standbi signal readi respond messag readi signal readi respond previou messag previou messag rest rest previou messag discard discard previou messag find agent specif agent call queri find agent facilit enabl messag forward agent perform regist facilit unclear acl acl propag proxi kqml regist unregist forward broadcast messag agent properti descript propag constraint agent assum exist agent messag propag request send messag agent specif properti bug document capabl agent capabl agent cancel regist addit inform facilit cancel previou regist cancel made facilit announc chang address forward messag agent forward messag agent receiv messag agent receiv messag agent receiv agent respond messag agent respond messag make agent respond messag make agent respond messag respond discuss languag essenti gener messag syntax format syntax involv content left open set suggest messag type mean messag type underspecifi agent platform support languag kqml popular retrospect remain unclear mean support messag trivial part languag facil messag sequenc protocol protocol suggest messag underspecifi separ protocol field standard necessarili gener fill standard includ suit messag type deal aspect section includ updat reaction agent lookup servic discuss interest distress note composit issu model larg toi scale full size show larg softwar system larg work final kind concurr problem necess handl kind complex commun protocol knowledg base turn granular agent system techniqu exampl classifi action capabl task negoti facilit hard find action hierarchi structur good weak structur program respect data document maintain action intent task negoti acl offer dialogu system ve rel immatur make applic question agent model base interactor model agent incorpor interest featur micro level specif languag develop part base product rule specif featur agent architectur incorpor top exist model agent system system attempt updat notif model encompass concept found exist model updat notif basic arguabl featur model main idea agent system system view data agent local awar similar interactor section facilit model section limit tree data interactor model gener case direct label graph agent queri graph structur rel posit graph agent valu queri agent unlik agent send messag directli arc connect refer oo model unlik oo commun proce symmetr parti initi commun arc call relat prototyp feasibl idea test build prototyp applic simpl implement dai quick feasibl stabl prototyp week complet extens implement adopt prototyp implement java remot method invoc provid distribut commun agent run standard web browser current architectur moment agent number properti involv number properti agent valuei agent send messag relat model modif relat attribut relat attribut common construct model agent attribut make notifi agent relat similar refer oo model oo process easi defin protocol determin valu type sequenc protocol formal automata process algebra specif kind ternari relat relat model basic commun model chosen version buffer synchron provid process algebra practic process wait process handl number network improv perform significantli model emul buffer model agent privat control agent behaviour delet properti relat establish consent parti initi queri queri updat remain activ termin initi queri result automat notifi figur view relat attempt establish relat kind queri queri mailbox result ad queri properti figur architectur agent agent number public properti relat determin outgo commun privat part kind execut code privat make properti relat separ set rule determin behaviour privat part initi result collect messag agent relat server client request provid request provid agent id note syntax correspond java statement defin regular queri graph structur queri paramet relat result set assum agent note relat valu queri parti complex queri provid futur version set join intersect term server client particip relat suggest parti capabl role distinct case altern written call call client term subject object altern server client defin queri establish paramet relat parti id parti start queri relat request parti start relat parti receiv acknowledg messag queri receiv messag parti order request provid queri issu import agent request relat agent id request provid pass result queri notif chang properti relat immedi relev mailbox arriv order view parti obtain situat moment read mailbox date program queri assign arbitrari ident number number assign messag ad mailbox mailbox messag easili mean simpl construct current queri handl central accept chang time easi ensur inform remain consist updat messag queu order actual event happen distribut implement subject futur research server maintain exist relat valu properti practic advantag central comput run server run rmi registri client standard java facil small applic built figur small ve room agent talk easi multipl standard scheme implement easi move room agent queri room inhabit relat agent speak updat shape properti object room brain control action remain pick drag pick establish hold relat object automat posit holder relat establish enabl agent track object agent point type user enabl object control user ai part sentenc relat theatr perform ai react user close easi multipl user multipl agent system discuss applic meant model work practic practic improv made observ section natur updat queri make amount data pass small queri channel knowledg server implement modul figur prototyp implement knowledg shown left public properti relat shown top knowledg server dash line partner relat dot arrow point channel correspond agent relat relat number queri bottom left shown bottom middl channel read agent shown messag arriv mailbox assign ident number shown channel knowledg server agent program shown program handl agent solid arrow commun knowledg server agent program control mouth instanceof instanceof control sh sh object locat figur simpl ve kind agent brain object posit shape repres object simpli visibl object enter room establish accept number relat object accept control relat brain send properti updat accept hold follow posit hold server shown top sketch code control object brain agent enter room object receiv posit shape inhabit individu notifi agent posit pass agent model suit ve complic vrml load normal object make vrml descript notifi buffer model ensur amount network call limit typic ve agent fetch messag updat displai multipl agent move receiv list time multipl singl updat turn perform overhead rmi call overhead network gener buffer model improv effici model agent read mailbox poll abil block mailbox empti provid futur version chang larg rmi call chang properti scheme properti commit sing significantli network perform problem work put inform chang singl properti agent behaviour turn easi inform failur handl turn problem bug emerg specif agent actual interact remain expect interact ve complex model provid basic commun facilit function model intellig highli agent program simpl program queri initi relat begin main loop consist sleep execut plan handl messag loop turn suffici agent applic messag mean channel ident number work readabl program structur neg aspect model place current raw java red tape code separ list number channel separ list variabl track queri result send handl messag relat method case failur case messag type check unlik obtain refer establish relat requir request wait accept special macro languag automat gener code case develop limit limit queri applic extens found miss discuss extens mention set intersect union strictli perform separ queri individu perform oper abil ad set oper directli queri format effici issu limit fiat set queri result agent room queri agent hold client turn bypass rule queri oneself absolut refer point agent set singl queri creat delet queri agent enter leav room introduc possibl queri result run sync queri result set object agent room result hold coupl addit oper result set set great improv option adopt exist engin support updat queri effici simpl queri futur research attempt complet overview interact system model made overview meant document previou provid suffici model overview necessarili remain sketchi fragment possibl gap overview fill futur develop model shown work simpl ve warrant investig thing build larger order test feasibl model version ve applic develop incorpor origin vrml environ rest section describ aspect model develop agent specif languag argu provid standard macro program raw java languag structur similar specif languag plain procedur program languag agent program typic event handl product rule activ type languag detail evalu process intent detail account product rule specif point document check agent program agent model complex dynam requir techniqu document check agent behaviour readi mention possibl protocol describ sequenc valu natur automata sequenc combin relat defin agent kind relat combin sequenc intern behaviour descript agent complex mix product rule type specif java code part specif abstract depend practic experi refin model capabl setup model part determin implement extens mention queri extens wai commun abil send messag directli relat cycl queri enabl agent kind agent accept relat relat order type similar object model gener specif queri access restrict relat properti reliev requir central knowledg server central knowledg server easi circumv concurr problem handl queri updat natur model agent maintain part knowledg local facilit concept liter order ensur inform remain chang parti concern chang modif properti relat achiev agent awar agent observ inform creation relat mean parti transfer queri inform relat achiev commun exist relat possibl implement distribut model knowledg server knowledg server commun inform cross border knowledg domain server requir inform time relax develop guid section attempt develop feel system interest practic develop guid consist api overview small guidebook overview api agent particip agent system deal special object class rmi object messag object agent channel identifi valu incorpor set set element addit attribut thing agent contact mean rmi lookup obtain ident mailbox agent agent registri void delet agent mailbox mailbox agent agent agent id agent obtain uniqu id agent agent obtain uniqu id agent mailbox messag arriv read agent mailbox channel ident channel ad mailbox channel separ type ident set messag receiv messag origin easili distinguish void add channel futur messag mailbox channel void delet channel mailbox close channel fetch messag mailbox properti relat knowledg access modifi rmi object properti relat class method set queri return channel stand channel queri result messag pass note channel turn input enabl complex queri made channel input multipl add channel queri input mailbox channel test agent set specif properti channel obtain void object assert agent properti chang void assert agent properti channel channel defin queri queri set agent serv agent suppli queri channel channel defin queri queri set agent client agent suppli queri channel agent channel agent request set channel event relat develop relat channel creat channel monitor channel request agent void enabl parti relat send messag agent parti messag agent messag void void agent void agent delet relat neat request delet request provid messag messag class incorpor inform pass channel list constant messag type field messag int type int content agent sender long timestamp messag type prefer subclass messag class messag type channel type messag origin undefin messag read mailbox messag actual content sender null state set messag pass channel type defin queri set messag type content set attribut set agent satisfi queri messag moment queri set set agent ad origin queri result set agent delet origin queri result messag indic transit relat state relat sender field set particip side accept abort warn parti queri relat parti accept relat parti relat abort miscellan messag type request queri messag type sender field set agent meta channel close user defin type content lifecycl relat pair method lead state messag gener state diagram figur main establish note call point revert relat state nonexist small design guidebook model design preliminari design idea guidelin illustr note guidebook address macro specif techniqu develop implement agent softwar modul conceptu relat agent softwar modul figur agent program simpl wrapper commun privat softwar independ data structur insid softwar separ file file server separ window screen modul data view part agent user control agent view part agent modul handl agent agent system requir regular entiti model agent rest agent awar program handl larg data structur access uniform import larg model singl agent queri messag pass maintain view common practic model physic gui ve object separ modul coher group model agent screen agent repres displai maintain ii ii client request server request relat msg nr figur diagram graphic csp specif line text insid box circl denot state state order save space multipl action occur fix sequenc drawn singl save space messag repres underscor parti receiv type messag end intern variabl access repres underscor begin action relat correspond method mailbox agent note transit main state trigger method intern variabl access messag occur relat return main state agent privat commun modul agent implement separ program modul agent agent handl singl program figur correspond implement modul agent graphic object privat commun screen good choic gui object observ singl user displai depend relat object properti describ commun relat good choic object ve ve multipl autonom agent obviou choic model agent user separ object avatar user input output view avatar user view maintain avatar queri environ comput avatar possibl find relat structur environ graphic model physic world maintain physic model physic constraint object model addit advantag semant readili useabl comput agent object top model relat system similar model model scene manipul stack object model explicitli support relat agent pick object easili made client relat bottom object top object easili made move object object accept depend shape spheric object model object request exampl room border possibl separ room object insid attach avatar hold object highli complex physic relat agent handl separ constraint check send result agent concern room agent locat natur place hear rang checker approach similar vrml constraint program system constraint maintain send updat constraint send back correct command constraint violat semant inform strictli physic model graph structur user point object model relat obviou advantag comput agent easili track user point behaviour point made observ object highlight point exampl manipul visibl model write access write access agent proce establish relat relat impli queri specif properti writer valu written commun relat depend agent valu model properti queri agent agent attempt write data concurr problem circumv agent establish write relat time starvat problem circumv agent break write relat text editor scrollbar similar found multipl user simultan edit text user edit made pan posit edit window user observ user awar locat figur show version system assum pan posit chang gui scrollbar jump button enabl save current posit restor save posit kind concurr user access document compon ing pan posit notifi write model updat relat read agent read written valu simpli queri server open store result properti agent observ mean text increment updat scheme implement commun displai updat relat user observ mean queri client arbitrari number user posit compon simpli document window arbitrari number displai posit server model fluid anim multipl possibl run anim concurr shape posit updat proce automat notifi agent agent run frame rate anim agent run low frame rate interpol scheme detail inform interpol asynchron scheme contrast parallel scheme concurr anim asynchron scheme updat document text scrollbar figur editor multipl text posit compon thick line updat relat dash line data flow result current relat structur accept object move advantag requir central problem occur anim agent interdepend block stack bottom block top move top block queri bottom posit lag make anim convinc scheme address problem offer figur possibl make top block rel regular posit durat relat block move rel posit chang independ relat observ revert regular posit possibl emul synchron model local sync node block sync node observ determin updat receiv valid block rel po block block block block stabl sync node sync ps block top posit delai wrt bottom rel posit follow bottom posit posit valid true figur posit block exampl conclud small sketch larger applic figur scrollbar anchor scrollbar window scrollbar scrollbar displai select select titl newsgroup titl messag messag figur agenc similar netscap figur note resiz model system model standard gui compon easi model mail compon similar setup note window separ agent area window number relat explicitli posit relat posit size modifi anchor compon middl specifi point window meet window rel anchor relat relat displai select determin content expect lead agent relat item pick properti item expect lead agent bodi properti actual model hierarchi server agent top agent handl wrapper actual server wrapper implement load item displai select relat establish plai plai select ipo shape user plai plai es pod displai shape lip shape poster lip entranc main hall figur agenc figur show sketch agent model bottom structur music model web room agent connect determin physic area room navig view singl room size site arbitrarili client load part site locat distribut machin navig helper agent structur user find rout specif place ideal case locat convex ve convincingli navig walk straight gate gate room ve agent inform board conceptu displai relat determin show karin maintain dialogu nearest maintain select relat latest queri result shown privat user displai hit user point inform board click select relat plai similar relat establish user point poster easi karin observ point click resolv linguist refer karin inform board queri relat return agent relat queri result refer refer role prior experi task characterist empir studi intern journal logic epistem action van der foundat applic collect agent base system logic approach build activ repres reason action lectur note design interact speech idea user test springer verlag util base approach cooper agent van der foundat applic collect agent base system introduct iso specif languag comput network isdn analysi edit distribut reactiv machin technic report franc agent negoti load balanc electr intern confer distribut comput system page taxonomi evalu formal specif interact system peopl comput confer natur languag dialogu servic appoint schedul agent confer appli natur languag page architectur design gener softwar architectur model cscw chi annot vrml refer edit softwar agent environ construct system technic report mit ai usa program morgan kaufmann publish common base languag norwegian comput center effect inherit maintain empir studi intern confer softwar mainten strategi comput program peopl comput hci confer dialogu team mal approach van der foundat applic collect agent base system van specif techniqu modal dialogu technic report centr telemat inform technolog combin csp technic report handbook standard resourc spoken languag system de berlin languag program languag inform structur psycholog program peopl page support formal reason system high integr formal model techniqu interact acta commun sequenti process prentic york design valid comput protocol prentic hall compar mvc pac architectur workshop formal aspect human comput interfac john agent work sixth intern workshop agent languag simul social anim behaviour intern confer industri engin applic ai expert system volum page agent concept agent introduct part handout interact decemb inform broker agent appli architectur intellig websit part handout interact decemb dialogu manag natur languag interfac phd depart comput inform scienc modern system chang identif object orient softwar mainten intern confer softwar mainten intellig en part handout interact decemb calculu commun lectur note comput vol springer verlag tutori springer verlag jp design intellig layer approach springer verlag amulet model effect user interfac softwar develop ieee transact softwar speech dialogu facial multimod comput annual meet associ comput linguist usabl engin academ york embedd product rule languag journal intellig ieee decemb philip dialogu descript develop overhead sheet philip constraint describ object behaviour vrml interact agent workshop confer constraint describ behaviour virtual world design heurist md pm distort distribut virtual environ intern virtual world confer evalu strategi select utter verif spoken natur languag dialog confer appli natur languag page mainten readi inter confer softwar mainten sparck evalu natur languag process analysi review springer verlag formal method human commun workshop formal aspect human comput interfac van de van der oper semant agent commun languag van der foundat applic collect agent base system van model interact virtual ment process algebra interact virtual world van build framework develop interact overview current research dialogu interact system technic report centr telemat inform ogi miscellan sheet interact system system part handout interact decemb framework evalu spoken dialogu agent annual meet associ comput linguist understand natur languag academ york verifi semant agent commun languag intern confer system ieee press intellig chapter mit press methodolog analysi design agent intern confer autonom agent
DB/1079 3 probabilist deduct condit constraint basic event thoma institut fur universitat germani abstract show probabilist deduct condit constraint basic event focu special case probabilist deduct condit constraint tree elabor effici global complet techniqu probabilist deduct exact condit constraint present local approach global complet probabilist run linear time size condit constraint tree gener condit constraint show global complet probabilist deduct solv global nonlinear program elabor nonlinear program transform linear solvabl polynomi time size condit constraint tree introduct repres reason uncertain knowledg gain grow import recent decad literatur formal methodolog tackl uncertainti directli indirectli base probabl theori focu probabilist deduct condit constraint interv restrict condit consid probabilist deduct problem consist probabilist probabilist queri give classic probabilist probabilist knowledg cent bird cent bird probabilist entail greatest lower bound entail upper bound rate bird solut probabilist deduct problem cent entail greatest lower cent entail upper bound long controversi probabilist commun solv kind probabilist deduct problem global approach linear program local approach iter applic infer rule global approach linear program perform rich probabilist languag capabl repres facet probabilist knowledg probabilist deduct linear program global produc request tightest bound entail probabilist gener run exponenti time size probabilist deduct problem provid explanatori inform deduc result obtain overcom research start work local techniqu base infer rule local approach gener perform restrict probabilist languag iter applic infer rule rare restrict languag global complet global complet local probabilist deduct restrict languag global complet local probabilist deduct anymor local techniqu gener expect effici global elucid deduct process sequenc appli infer rule probabilist deduct condit constraint proposit event immedi gener satisfi problem probabilist logic npcomplet crucial contribut show probabilist deduct condit constraint basic event introductori restrict class probabilist deduct problem difficult algorithm effici solv probabilist deduct problem condit constraint basic event hope effici approxim algorithm focu elabor effici algorithm concentr probabilist deduct condit constraint tree interest subclass probabilist deduct problem condit constraint basic event condit constraint tree undirect tree basic event node bidirect condit constraint basic event edg node bayesian condit constraint tree repres probabilist differ bayesian requir knowledg probabilist independ exact condit constraint present function deduc tightest lower upper bound linear time size condit constraint tree gener condit constraint show greatest lower bound deduc linear time size condit constraint tree comput upper bound turn difficult solv special nonlinear program show nonlinear program transform linear program linear program number variabl linear inequ linear size condit constraint tree deduc upper bound run polynomi time size condit constraint linear program run polynomi time size linear program contribut paper relat controversi perform probabilist deduct condit constraint linear program iter applic infer rule provid effici techniqu global complet probabilist deduct exact condit constraint tree show extend local techniqu gener condit constraint tree result solv global linear program previou work similar deduct problem rare exist provid result global complet rule quantifi gener rule appli set bidirect condit constraint basic event deduct techniqu gener global complet tree bidirect condit constraint basic event examin framework deduct system system infer rule global complet deduc lower bound rest paper organ section formul probabilist deduct problem consid work section complet probabilist deduct exact gener condit constraint tree section summar main result work paper extract work extend result comput complex probabilist deduct condit constraint basic event improv significantli probabilist deduct techniqu gener condit constraint tree formul deduct problem introduc syntact semant notion relat probabilist knowledg gener condit constraint tree probabilist knowledg detail condit constraint give gener introduct kind probabilist knowledg consid work deal condit constraint proposit event repres interv restrict condit probabl proposit event formal background introduc section commonli accept literatur work assum nonempti finit set basic event fb bn set conjunct event cb closur boolean oper abbrevi conjunct event cd set proposit event gb closur boolean oper abbrevi proposit event gh gh true event event abbrevi condit constraint express form real number proposit event call defin probabilist interpret proposit event condit introduc atom event binari relat atom proposit event set atom event ab defin ab fe en atom event framework coincid commonli world probabilist logic atom event proposit event iff ag proposit contradict probabilist interpret pr map ab pr ab sum pr extend proposit event pr pr extend condit constraint pr iff note entail pr work semant condit probabl notion logic consequ condit constraint defin classic probabilist interpret pr model condit constraint iff pr pr model set condit constraint kb denot pr kb iff pr model kb kb satisfi iff model kb exist logic consequ denot kb iff model kb model condit constraint set condit constraint kb denot set real number exist model pr kb easili verifi logic consequ kb iff inf observ yield canon notion tight logic consequ condit constraint condit constraint tight logic consequ denot kb tight iff inf set close interv real number note assum inf iff kb iff kb tight iff kb base introduc notion probabilist deduct problem solut formal probabilist consist set basic event set condit constraint kb gb kb probabilist queri probabilist express form gb variabl tight answer substitut oe fx kb tight correct answer substitut oe fx kb defin notion sound complet relat infer rule techniqu probabilist deduct infer rule kb sound iff kb condit constraint kb set condit constraint sound local complet iff kb tight techniqu probabilist deduct sound iff comput correct answer probabilist queri sound global complet iff comput tight answer probabilist queri comput complex framework condit constraint proposit problem comput tight answer probabilist queri gener satisfi problem probabilist problem comput tight answer probabilist queri remain condit constraint basic event theorem problem comput tight answer probabilist queri basic event direct probabilist basic event proof problem graph problem comput tight answer probabilist queri basic event direct probabilist basic event proof similar line proof undirect graph construct probabilist initi node basic event node kb node kb jb edg vg kb jb show iff fx tight answer probabilist queri iff kb exist map edg vg cyclic permut member defin node edg vg ab iff node pr ab defin fa ab fa pr model kb model pr kb atom event ab defin iff node edg vg effici algorithm comput tight answer probabilist queri basic event direct probabilist basic event effici algorithm solv special probabilist deduct problem rest work deal probabilist deduct condit constraint tree section motiv evid practic import kind probabilist deduct problem motiv senior student mathemat describ experi success success student influenc student reach interview professor senior student influenc time invest book hobbi estim cent student cent success student cent success student cent student success probabilist knowledg complet probabilist estim probabilist fig set node kb set condit constraint arrow label su wp st ho pr bo wi figur condit constraint tree success interview studi spend time studi book spend time probabilist queri yield tight answer fx fx fx fx deduc result studi book posit effect success invest time hobbi act neg success student interview studi spent time studi book spent time probabilist queri yield tight answer fx fx fx fx result make biggest part success student small part spent time hobbi note probabilist interpret proposit event repres rel cardin set object probabilist proposit differ probabl set world probabilist logic condit constraint tree formal defin condit constraint tree queri condit constraint tree provid addit subsequ run exampl condit constraint tree probabilist undirect tree singli connect undirect exist kb pair condit constraint pair adjac node condit constraint tree exact iff kb queri condit constraint tree probabilist queri conjunct event disjoint basic event path basic event basic event basic event common queri condit constraint tree iff basic event iff basic event complet iff ef leav fig show condit constraint tree left side exact queri condit constraint tree fig complet queri condit constraint tree fig figur condit constraint tree probabilist deduct problem comput tight answer queri condit constraint tree divid subproblem comput tight answer queri tight answer queri queri condit constraint tree fig comput tight answer fy queri tight answer fz queri gener condit constraint tree replac node pair condit constraint node condit constraint act basic event comput tight answer queri condit constraint tree restrict work comput tight answer queri subproblem reveal main kei idea main theoret interest result comput tight answer queri detail comput tight answer interest reader refer result problem comput tight answer queri reduc special problem calcul tight answer complet queri queri condit constraint tree complet queri slightli transform condit constraint tree gener correct condit constraint tree transform iter remov leav ef leav ef transform basic event condit constraint ad condit constraint tree ef leaf kb pair condit constraint queri transform replac leav loss restrict subsequ work comput tight answer complet queri exact condit constraint tree exact condit constraint tree comput tight answer complet queri start defin direct tree direct acycl graph node root iff closer direct tree uniqu determin condit constraint tree complet queri fig show complet queri exact condit constraint tree fig left side strata figur direct tree set node partit strata lowest stratum node children highest stratum node parent node fig show strata node comput tightest bound logic entail kb tightest bound node comput exploit tightest bound comput children iter comput tightest bound node start node lowest stratum termin node highest stratum distinguish wai comput tightest bound ffl initi leaf ffl chain arrow common node ffl fusion common node complet queri exact condit constraint tree fig left side fig illustr wai comput tightest bound node common node chain fusion fill tabl show greatest lower upper bound comput node stratum st ff inf ff fi fl subject pr kb tabl abbrevi fusion tabl show request tight answer fx tightest bound comput initi fusion chain arrow figur local comput tabl local comput tightest bound st ff ff fi fl note comput request tight answer classic linear program approach result solv linear variabl linear inequ focu technic detail present function comput greatest lower upper bound prepar definit kb node leaf children leav node conjunct children leav conjunct event conjunct leav descend node node case refer initi leaf case node chain arrow common node case node fusion common node defin function comput greatest lower bound note exist framework deduct system ff ff fusion leaf ff chain ff fusion ff formul comput greatest lower definit node descend node set condit constraint kb set model function sound global complet respect iff ff infimum pr subject pr theorem show sound global complet theorem ff pr pr exist pr ff pr proof proof full detail present function comput upper bound note unknown literatur function exist function crucial result exact condit constraint local probabilist deduct techniqu sound global complet ff fi fl ff fi fl fusion leaf fi fl chain ff fi fl fusion ff min fi min fl min min function sound global complet respect iff ff fi fl supremum subject pr theorem show sound global complet show enabl proof induct definit theorem ff pr pr fi pr pr fl pr pr exist pr ff fl exist pr fi pr pr fl pr proof proof full detail note theorem show min definit fl fusion replac ff fi effici comput fl exploit comput valu ff fi theorem tight answer complet queri fx time complex comput tight answer complet queri function analyz section condit constraint tree focu comput tight answer complet queri gener condit constraint tree condit constraint tree complet queri local deduct techniqu exact condit constraint tree previou section easili gener condit constraint tree true comput greatest lower bound concern comput upper bound gener easili exact condit constraint tree condit constraint tree gener comput upper bound result solv global nonlinear program nonlinear program solv illustr condit constraint tree complet queri defin request upper bound maximum subject nonlinear inequ ux ux ux ux transform nonlinear program linear program maximum subject nonlinear inequ equal maximum subject system linear inequ xb xa xa xb xd xa xb xd xb xd xd xa xa xb xa xb xb xd upper bound complet queri condit constraint tree express similar nonlinear similarli transform linear program complet queri condit constraint tree fig side request upper bound maximum subject system linear inequ fig gener linear inequ trivial subsum request upper bound comput solv linear program variabl linear inequ xa xa xb xd xa xb xa xb xa xb xd xg xa xb xd xh xa xb xd xa xb xb xd xb xb xd xd xd xd xg xh xa xa xb xa xb xb xd xd xg xd xd xh xd xd xd figur gener linear inequ note comput request upper bound classic linear program approach result solv linear program variabl linear inequ focu technic detail subsequ gener function section straightforward comput greatest lower bound condit constraint tree present linear program comput request upper bound condit constraint tree kb node section node node refer defin gener function comput greatest lower bound condit constraint tree note exist framework deduct system ff ff fusion leaf ff chain ff fusion ff function sound global complet respect iff ff infimum pr subject pr theorem show sound global complet theorem ff pr pr exist pr ff pr proof claim follow theorem concentr comput request upper bound formul linear program similar exampl defin function variabl xb admiss instanti variabl correspond exact condit constraint tree instanc consid condit constraint tree admiss instanti upper bound exact condit constraint tree obtain upper bound condit constraint maxim subject admiss instanti variabl ff fi fl ff fi fl fusion leaf fi fl xb chain ff xc xb xc fi xc fl fusion ff min fi min fl min min remain admiss instanti variabl system linear inequ defin set linear inequ xb xe xb xc xb kb parent note relat final comput request upper bound implicitli perform variabl transform exampl lemma show variabl transform correct condit constraint tree lemma xb satisfi condit constraint kb exist uc xc uc xb uc kb exist xb xc uc xb node parent proof node parent uc defin uc xc xb xe node parent xc defin xc uc xb readi formul optim problem comput request upper bound theorem maximum subject pr pr pr exist pr pr proof kb theorem request upper bound maximum subject uc kb lemma maxim subject solv gener optim tackl linear program techniqu solv optim interest rough idea time complex comput request upper bound interest improv effici topic discuss gener optim problem linear program easili transform linear program transform elimin easili due remain outer elimin introduc linear inequ operand linear operand outer upper bound rough idea time complex comput request upper bound analyz size gener linear program number number linear inequ number linear inequ extract number fl produc fusion fl ff chain due cross number gener linear inequ tree branch order avoid introduc auxiliari function variabl xb ff fi fl ff fi fl fusion leaf fi fl xb chain ff xc xb xc fi xc fl fusion ff min fi min fl min min note definit ff case separ simpli ff xc reduc number gener linear inequ lemma show function express term auxiliari function lemma xb satisfi ff fl fi fl fl fl proof sketch claim prove induct definit theorem theorem lemma tight answer complet queri fx maximum subject fx tight answer queri condit constraint tree fig side time complex comput request greatest lower bound request upper bound analyz section complex exact condit constraint approach comput tight answer strata function run time denot number node result consequ observ direct tree comput time initi leaf constant number assign perform leaf direct chain constant number arithmet oper perform arrow direct tree initi leav perform chain run time fusion branch direct linear time number branch fusion run time gener condit constraint request greatest lower bound analog comput time request upper bound comput polynomi time result fact linear program run polynomi time size linear program size gener linear program number variabl number linear inequ number variabl number linear inequ induct definit shown number ff fi fl limit number linear inequ extract limit number gener linear inequ limit note rough upper bound condit constraint tree branch lower complet binari tree compar section compar tree chain basic event number gener linear inequ linear shortli focu classic linear program approach probabilist deduct run exponenti time special case comput tight answer queri exact gener condit constraint linear program variabl linear inequ summari show probabilist deduct condit constraint basic event present effici global complet techniqu probabilist deduct condit constraint tree exact condit constraint greatest lower upper bound deduc linear time size condit constraint tree gener condit constraint greatest lower bound deduc linear time size condit constraint tree comput upper bound difficult solv global nonlinear program show transform nonlinear program linear solvabl polynomi time size condit constraint tree condit constraint tree analyz probabilist deduct problem relat interest practic applic bayesian repres probabilist intuit graphic differ bayesian condit constraint tree requir probabilist independ assumpt competit bayesian condit constraint tree understood complement bayesian applic independ assumpt hold difficult access acknowledg grate thoma eiter valuabl comment earlier version paper refer adam logic volum librari reidel publish prade constraint propag condit probabl proc confer uncertainti artifici page morgan kaufmann andersen bayesian logic support bacchu repres reason probabilist logic approach probabl mit logic foundat probabl chicago de theori probabl duboi prade fuzzi comput de symbol approach reason linguist quantifi proc confer uncertainti artifici page morgan kaufmann infer numer quantifi ra intellig chapter page elli megiddo logic reason probabl inform frisch haddawi anytim deduct probabilist logic artifici garei johnson comput guid theori npcomplet freeman papadimitri probabilist satisfi journal halpern analysi logic probabl artif probabilist descript logic proc confer uncertainti artifici page morgan kaufmann de column gener method probabilist logic orsa journal papadimitri linear program approach reason probabl annal mathemat artifici uncertain reason concept lattic proc european confer symbol quantit approach reason volum page probabilist deduct taxonom knowledg doctor universitat effici global probabilist deduct taxonom probabilist conjunct event proc intern confer inform knowledg page acm taxonom uncertain integr constraint top approach proc intern confer inform knowledg page acm comput bound probabl uncertain data comput nilsson probabilist logic artifici papadimitri combinatori algorithm complex englewood pearl probabilist reason intellig network plausibl infer morgan kaufmann san theori linear integ program uncertainti incomplet deduct system doctor universitat probabilist bound propag proc conf uncertainti artifici page morgan kaufmann
Agents/1080 1 mobil activ network architectur hu depart electr engin nation taiwan roc chen institut comput scienc nation roc abstract activ network enabl custom network function lengthi process work literatur util capsul activ packet mean transfer code inform activ network activ network infrastructur base mobil agent technolog prototyp mobil agent build block carri function activ node offer softwar applic agent process mobil custom facilit network function integr discret oper model network custom support protocol develop abstract protocol structur protocol load mechan present provid agent mechan protocol manag mechan improv network function achiev introduct rapid internet network behavior network user chang domin network architectur quick emerg network servic technolog improv network perform function architectur current network environ revolut network commun technolog preval extens internet servic crucial problem todai internet infrastructur identifi difficulti integr technolog standard share network difficulti accommod servic exist architectur poor perform due redund oper protocol due gener architectur exist hung network replac preserv upgrad strong demand facilit network employ network technolog servic confin concern lengthi standard widespread increment activ network shown address issu fundament chang natur layer compar tradit network activ network aim offer softwar programm paradigm intermedi network node perform dynam network custom activ network fulfil rapid evolut network technolog introduct servic applic lengthi process standard packet format protocol activ network messag carri specif program custom servic configur network network element perform specif comput pass messag base agreement program encod execut environ network element support messag legaci network packet process ordinari servic brought rapidli requir increment construct overlai activ network amelior network comput capabl function main approach integr introduc creat activ network discret ant dan program inject node actual data packet network node integr ip option smart packet messag treat messag program fragment includ data network node mix approach capsul activ packet suitabl transfer miniatur program discret approach ultim goal activ network establish flexibl architectur exploit programm architectur introduct mobil agent establish activ network elegantli support approach mobil agent abil roam wide area autonomi oper asynchron foreign perform task behalf methodolog mobil agent technolog support program make mobil agent suitabl build block construct activ network compar capsul activ packet code transfer network mobil agent support code transfer mechan inherit crucial featur mobil agent technolog benefit mobil agent includ reduc network protocol asynchron autonom dynam integr heterogen achiev robust past develop open mobil agent pathfind demonstr agent distribut comput capac exploit capabl mobil agent construct mobil agent base activ network architectur prototyp basic support weak abil code transfer activ network proactiv reactiv remot clone strong mobil appli mobil agent common capsul approach code transfer network element essenti scheme mobil agent adapt approach experi shown mobil agent effect deploi specif custom demand monitor mechan mobil agent manag absent incomplet make mobil agent approach viabl activ network construct activ network architectur flexibl provid rapid servic introduct protocol develop integr integr transfer model mobil agent util introduc network applic servic mobil agent mobil agent carri main specif code object depend activ compact mobil agent contact servic agent indirectli perform custom instal configur servic agent similar discret approach note emploi serv servic provid authent promot servic effect perform mechan servic propag simplifi rest paper organ section present background relat work section describ abstract activ network architectur design individu architectur network commun servic section discuss implement architectur prototyp section conclud remark futur research topic background relat work section describ activ network comput model relationship mobil agent technolog activ network current activ network research work introduc activ network comput model activ network programm network intermedi node perform comput applic program network inject program natur network servic defin behavior individu node user control behavior code inform packet activ network network element function dynam control network behavior messag consist program data program provid control data replac payload tradit form customiz structur program messag inject carri program network element custom specif servic configur network element network element perform custom comput subsequ messag path prior specif messag specif function deploi network effort servic user relationship mobil agent technolog activ network activ network architectur code mobil paradigm close mobil softwar agent technolog idea activ network gener term protocol servic mainten differ activ network concept network layer mobil agent system run applic program gener mobil agent system design support construct ubiquit internet comput environ primari activ network enabl commun eventu offer dynam programm network infrastructur mobil agent paradigm treat network multipl mobil agent programmat entiti migrat locat perform task activ network conceptu network collect activ node perform collect activ packet carri program point mobil agent regard specif type activ node tradit network regard specif type activ node activ network research research defin gener architectur activ network element multipl execut environ achiev compon activ network backbon test execut environ implement applic major challeng implement gener architectur determin perform concern due space list relat work literatur mit ant featur packet java carri specif custom data payload node java virtual machin export api capsul interpret execut capsul instal state invok class granular control level pennsylvania base layer sane script languag call plan enabl strong resourc manag secur packet instal state network node columbia establish middlewar program function intermedi network node explor altern model activ network servic introduc data transfer network manag user bbn appli activ network assist problem manag network languag design languag program compli code yield small encod program georgia institut agent server activ modul applic applic agent server legaci modul activ modul legaci modul activ end node activ node legaci node legaci end node mobil agent sourc destin figur mobil agent base activ network attempt construct trustworthi servic util reduc program model set base servic control inform packet header advantag design limit requir secur analysi dan washington similar approach dan network finit sequenc identifi function paramet dan aim set topolog code server larg scale simplifi code distribut work complementari activ network effort util mobil agent build block activ network explor potenti mobil agent technolog standard jvm access transmiss resourc implement limit basic network capabl similar ant java bytecod jvm speed develop process architectur mobil agent base architectur section describ architectur design activ network environ agent comput model enhanc network function simultan provid activ network architectur architectur overview illustr figur activ network architectur consist group activ node interconnect local wide area share medium channel agent server sit top layer activ node base agreement program encod execut agent server handl mobil agent carri specif custom provid transient execut environ specif servic deploi network agent header agent data agent specif custom agent payload figur logic format mobil agent activ node node term transport mobil agent dynam code load mechan util remot load refer protocol code object network element support process network messag default protocol activ network node compat legaci network mobil agent logic format design mobil agent specif program data payload activ network environ data mobil agent customiz structur comput state mobil agent portabl depict figur mobil agent agent header identifi network messag agent data file includ mobil agent attribut relat argument inform agent execut activ node activ network agent specif custom field involv specif code object execut activ node agent payload field deliv data agent comput result comput agent commun protocol agreement mobil agent commun protocol prerequisit mobil agent activ network implement protocol base agent transfer protocol specif origin atp aim demonstr mobil agent endu ubiquit comput capac manag control mechan absent complet mobil agent architectur activ network architectur demand monitor mechan mobil agent activ paper architectur enhanc atp ad manag control figur show life cycl mobil agent architectur mobil agent arriv activ state complet agent server design shown figur basic activ node runtim environ logic divid lower layer physic network node higher layer agent server agent server abort run suspend suspend resum termin termin retract retract complet stop normal termin report report figur life cycl mobil agent agent context atp handler agent manag repositori manag file system resourc control channel oper system agent platform middlewar agent secur manag interfac polici agent server physic node figur activ node runtim environ node interfac real entiti mobil agent contact network custom consist mobil agent indirectli access local resourc facilit agent comput commun compon agent server agent context transient agent execut environ mobil agent constrain achiev local resourc interfac primit agent server agent secur manag check oper agent filter malici agent behavior unwant interact practic uniform control system resourc mobil agent atp handler distinguish activ messag incom channel pass evalu procedur atp handler transfer wrap mobil agent activ messag atp format agent manag record mobil agent instanti servic manag deploi protocol node repositori manag store inform agent coordin collabor primit agent server initi set primit agent server decid process routin mobil agent activ affect applic servic mobil agent deploi activ node effici aspect applic protocol set primit applic compact effect mobil agent scheme suggest initi set includ primit local storag primit access local node local file local environ primit obtain activ node environ port statu agent repositori share argument object perform cooper applic agent manipul primit mobil agent access agent specif custom payload manipul agent execut agent commun channel access network commun channel achiev agent migrat activ node mobil agent control agent manag suspend termin oper scheme abstract protocol structur rapid protocol develop abstract data structur protocol abstract protocol structur protocol inform servic agent mobil code protocol develop extend protocol abstract protocol uniform structur activ network environ activ node enabl administr maintain deploi protocol protocol mechan integr discret approach suit activ firstli mobil agent combin transfer model emploi servic assist protocol activ node prohibit arbitrari inject code custom grant authent user safeti secur reason reason amen emploi authent launch trustworthi mobil agent promot protocol mechan parti repositori respond code mechan protocol propag simplifi effect perform prototyp implement section firstli list characterist mobil agent base architectur section introduc environ section describ implement encapsul mobil agent section explain agent server work mobil agent oper model introduc section mobil agent manag mechan section section describ protocol manag mechan characterist architectur mobil agent includ schedul agent mobil schedul inform agent transfer activ agent inform agent server individu incom mobil agent transient execut environ mobil agent perform task bound individu agent context activ node resourc conflict overlap happen atp commun protocol agent mobil oper extens add manag control oper specif servic agent agent server mobil agent specif multipl servic agent instal agent server multipl servic feasibl activ network servic agent facil design abstract protocol structur enabl dynam protocol activ node prototyp environ prototyp implement java program languag program agent server mobil agent compil jdk platform includ window linux solari support java virtual machin prototyp enhanc agent transfer protocol applic layer lower layer convent protocol encapsul mobil agent figur depict syntax structur agent encapsul agent header field identifi atp atp header result class userid argument sourc frequenc itinerari protocol identifi paramet argument servic provid protocol server agent header agent data agent specif custom agent payload figur mobil agent encapsul cation protocol prefix header identifi kind atp messag atp specif content agent data field open network design defin user id identifi servic provid argument relat inform refer modifi custom agent id uniqu id manag control agent specif custom field store lead class class agent server receiv mobil extract execut custom agent payload field store comput result string type agent server implement prototyp agent softwar applic run activ node support custom behalf mobil agent function agent server agent server incom activ gener agent export transient execut environ mobil agent code depend intermedi result activ dispatch activ node pass mobil agent servic agent agent server appli agent control oper atp control messag manag server agent server instanti activ network agent server activ node initi prototyp properti util itinerari agent activ node mechan forward profil store local file system load local regist protocol servic mobil agent agent server trigger process incom atp messag evalu mobil agent activ network activ node implement agent procedur model model entiti mutual turn atp handler distinguish atp messag incom network transform wrap mobil agent activ node atp parser atp messag atp handler code inform extract instanti mobil agent atp loader initi agent execut context instanti mobil load mobil agent agent server start specif custom agent context atp creator mobil agent mobil agent finish assign activ node atp creator encapsul atp agent agent relat inform mobil agent atp specif mobil agent execut agent server safeti secur implement mobil agent permit indirectli primit provid agent server agent context interfac custom confin transient agent context direct oper scope forbidden oper repositori agent manag local resourc access requir assist agent context interfac interfac mobil agent oper model interact mobil agent agent mobil agent oper model mobil agent protocol custom activ node agent carri main code object depend model mobil agent heavi agent evalu execut degrad make perform activ node design agent server complic reason agent server interact mobil agent servic agent stationari agent activ provid assist mobil agent custom activ node servic agent separ entiti agent function servic agent flexibl design develop meet specif applic demand agent server intermedi pass mobil agent respect servic agent multipl servic agent resid activ node servic complic agent server design prototyp util multipl servic agent facil enabl develop mobil agent manag control tabl agent launch servic tabl manag tabl record manag control inform prototyp agent server emploi agent tabl record inform arriv mobil agent servic agent start servic agent server assign port servic record mobil agent request servic agent assign servic tabl agent port manag tabl locat manag server record inform launch mobil agent activ network mobil support server launch mobil send inform manag server manag server launch mobil agent record note manag server activ trace launch mobil agent inform manag tabl inform locat mobil agent protocol develop abstract data structur protocol prototyp implement data structur maintain abstract inform depend protocol figur show constructor vector class group record class dynam protocol vector agent group record mobil agent multipl mobil agent group protocol perform collabor coordin agent server string servic agent record servic agent protocol vector argument serv temporari repositori store argument paramet protocol public class public string string vector vector string vector arg argument figur constructor agent server permit agent custom protocol statu order meet ultim goal dynam protocol prototyp emploi trustworthi servic provid facilit protocol locat servic provid default flexibl assign locat argument vector agent data field note reason creat default channel util protocol commun servic provid agent server compar ant implement protocol propag mechan refer activ node mobil agent prototyp perform mechan order reduc complex implement emploi central servic provid facil effici handl protocol propag protocol manag control implement support multipl protocol simultan agent server mobil agent specif custom deploi protocol activ node order maintain effici deploi agent server emploi protocol show figur record inform deploi protocol protocol manag control activ node agent server store inform deploi protocol protocol tabl protocol deploi activ inform record tabl trustworthi parti grant author deleg mobil agent adapt configur deploi protocol activ node user id protocol id statu servic agent deploi time updat time figur protocol tabl present activ network architectur base mobil agent technolog speed network innov appeal architectur support integr discret approach simultan oper interact mobil agent specif servic dynam protocol mechan introduc facilit network evolut compar convent activ network dedic code transfer develop manag mechan control network oper network function design implement agent encapsul activ node custom process agent coupl prototyp demonstr mobil agent suitabl altern construct activ network research effort activ network provid mean mobil activ network provid basi futur standard commun standard object manag group mobil agent system facil foundat intellig physic agent work mobil agent standard investig issu relat integr standard activ network architectur refer al activ network encapsul protocol rfc juli al activ network architectur ieee page composit activ network ieee comput commun septemb modest approach activ network ieee comput commun septemb al direct activ network ieee commun octob chen lin mobil rai trace agent autonom agent al open infrastructur mobil agent mobil comput workshop mobil page al mobil manag mobil agent intern confer autonom da activ servic darpa activ network march distribut code cach activ network ieee march vigna understand code mobil ieee transact softwar al packet languag activ network intl conf function program lang agent transfer protocol draft ibm tokyo research march lang oshima good reason mobil agent commun march nwana ndumu introduct softwar agent technolog jen wooldridg agent page activ architectur ieee commun quarter al smart packet activ network ieee march al activ progress report ieee april activ network architectur multimedia comput januari toolkit build dynam deploi network protocol ieee april introduc internet ieee page activ ip option acm sigop european septemb
ML/1081 6 ieee pp santa extract classif visual motion pattern hand gestur recognit yang narendra ahuja beckman institut depart electr comput engin illinoi il abstract present method extract classifi motion pattern recogn hand gestur motion segment imag sequenc gener base transform attribut graph match region frame produc region correspond affin transform color inform motion region determin skin region human head palm region identifi base shape size skin area motion affin transform defin region motion success frame concaten construct region motion trajectori gestur motion trajectori classifi neural network train backpropag learn algorithm result show hand gestur recogn motion pattern introduct paper concern problem detect motion imag frame classifi motion pattern hand action classif aim recognit action repres motion pattern capabl central human applic domain extract motion pattern interpret carri domain hand gestur recognit work result easili extend scenario past work gestur recognit static hand attent dynam characterist gestur work aim recogn gestur american sign languag analysi gestur motion trajectori perform motion segment group pixel similar motion region find region correspond frame motion region movement palm region inform gestur palm motion extract asl expert point gestur interpret requir motion pattern rel locat hand respect landmark part bodi head shoulder human head region extract refer gestur recognit distinguish move color geometr characterist head palm region skin color similar ellipt differ size motion region skin color connect compon analysi perform merg neighbor region shape merg region approxim ellipt head palm region discrimin base differ size palm region extract frame affin transform region success frame comput concaten obtain gestur motion trajectori recognit motion pattern perform neural network error backpropag learn algorithm studi shown network capabl classifi signal recogn motion pattern input data organ tempor data sampl time window input network simultan time sequenc output window move time experi verifi gestur motion pattern classifi relat work gestur recognit consist major pattern extract classif gestur recognit applic special color glove marker electromagnet sensor stereo vision experi locat signer video pfinder adopt maximum posteriori probabl approach detect track human bodi simpl model recogn asl sign color motion appli signer local approach requir signer wear special glove ground color system provid excel mean interact overcom limit individu fusion cue explor face local fulli exploit hand local describ method combin color geometr analysi hand local motion trajectori comput combin achiev robust accuraci extract motion turn recogn complex hand gestur classifi extract pattern approach recent year hunter jain hidden markov model imag recogn visual gestur hmm util starner pentland recogn asl special color glove darrel pentland appli dynam time warp model correl recogn hand gestur video wilson bobick extend standard hmm method gestur recognit includ global parametr variat output probabl state order recogn interpret parametr gestur appli successfulli speech spell recognit forecast time seri shown achiev lower error rate phonem classif simpl recogn util recogn gestur motion pattern motion segment order captur dynam characterist hand segment imag frame region similar motion algorithm process imag sequenc success frame time pair algorithm identifi region frame structur region scale match frame affin transform comput match region pair affin transform paramet region scale deriv singl motion field segment identifi differ move region frame section describ major step motion segment algorithm imag segment segment perform transform extract hierarchi region imag gener form map imag famili attract forc defin oe oe oe oe paramet oe denot homogen scale reflect homogen region pixel belong oe spatial scale control neighborhood forc pixel comput homogen pixel euclidean distanc vector pixel valu color spatial scale oe control spatial distanc homogen scale oe control homogen distanc form function satisfi criteria discuss unnorm gaussian oe oe oe ae oe forc field encod region structur manner easi extract region boundari correspond diverg forc vector region skeleton correspond converg forc vector oe homogen structur encod oe larg structur encod leftmost imag figur show frame video sequenc imag show segment frame pixel region scale replac respect averag grai valu extract region boundari align perceiv boundari scale obtain paramet transform select elimin make priori assumpt geometr homogen characterist structur figur result segment region match match motion region frame formul graph match problem scale scale refer level detail captur imag segment process partit imag creat slice pyramid preselect valu oe region partit adjac frame match coarser scale match guid finer scale match partit repres region adjac region repres node region adjac repres edg region match scale consist find set graph transform oper edg node node cost creat isomorph current graph pair cost match pair region account similar regard averag expect posit estim region motion previou spatial relationship region neighbor region imag partit homogen scale match obtain region frame frame pair identifi motion segment modul previou frame pair match frame motion region union set finest scale region motion region fourth match pair imag consid scale set match util affin estim detail algorithm found affin transform estim pair match affin transform estim iter ith region frame match region coordin pixel ij ij jr jr cardin pixel nearest centroid ij ij map affin transform point ij ij ij ij ij ij ij ij subscript denot iter denot vector oper round vector compon nearest integ affin transform deform ak translat defin indic ae amount mismatch measur ji affin transform paramet minim estim iter local descent criterion motion field integr comput affin paramet give motion field scale motion field combin singl motion field motion field perform comput scale match imag predict error gener current motion field motion field finer scale compar region predict error finer scale motion improv current motion replac finer scale motion result set region accept scale motion field segment result motion field segment area similar motion heurist consid pair match share common merg relat satisfi ik ik jl jl spatial adjac jj ik ik jl jl ik ik jj jl jl oe oe constant determin motion similar region merg segment motion region repres ms match region match frame region ms scale region affin estim modul frame pair note motion segment necessarili correspond move object scene motion segment singl motion field segment rigid region fast object move rate pixel frame identifi handl situat requir examin motion field multipl frame figur show frame imag sequenc figur show result motion segment motion region displai grai level notic motion region head palm region rigid region similar motion color geometr analysi motion segment gener region similar motion motion region carri import inform gestur recognit recogn hand gestur consid suffici extract motion region head palm region color segment find motion region color uniqu chromat color space order minim depend lumin tabl creat base statist analysi valu skin color pixel train imag region classifi human skin color pixel fall train skin color cluster coupl motion motion region skin color effici extract video shape human head palm approxim human hand rectangular motion region skin color merg shape merg region approxim ellipt rectangular paramet rectangular shape obtain bound box region easili orient calcul moment inertia extent major minor ax approxim extent region axi direct fit determin number pixel fall shape comput paramet ellipt region larger rest view human head palm region ellipt region smaller head region hand rectangular area size figur show result color segment geometr analysi motion region motion trajectori motion segment gener affin transform captur motion detail match finest suffici coarser motion trajectori identifi palm region gestur recognit affin transform palm region frame pair comput base equat section affin transform concaten construct motion trajectori palm region figur show motion trajectori palm region imag sequenc motion pattern classif gestur recognit pattern recognit problem signal demonstr success emploi classifi gestur motion pattern palm region dynam classif approach network small window motion pattern window slide input data network make seri local local integr global time semin waibel al demonstr excel result phonem classif show achiev lower error rate achiev simpl hmm recogn design attract compact structur econom weight make network develop gener featur detector hierarchi delai optim featur detector scope layer tempor integr output layer make network shift invari insensit exact posit figur show architectur posit valu shown black squar neg valu grai squar input vector frame gestur imag posit respect magnitud veloc output gestur learn mechan error backpropag learn algorithm result show motion pattern classifi accur effici window window slot slot slot slot window gestur integr output layer hidden layer hidden layer hidden layer input layer figur architectur figur imag sequenc asl sign left top figur motion segment sequenc figur left top figur extract human head palm region sequenc figur figur imag sequenc asl sign left top result video asl sign experi video consist asl sign frame figur show kei frame video asl sign figur show result motion segment imag sequenc note head palm signer consist motion region motion segment singl motion field discuss motion region skin color identifi chromat characterist region merg palm head region base geometr analysi shown figur affin paramet match palm region yield motion trajectori shown figur note motion trajectori palm region match movement real scene axi motion trajectori palm region figur motion pattern gestur experi classif extract motion pattern gestur sign figur show motion pattern gestur sign extract motion pattern video sequenc train rest test tabl show classif result gestur tabl result classif test gestur gestur gestur recognit rate test pattern method recogn hand gestur base motion pattern deriv imag sequenc system develop extract motion pattern base motion color geometr analysi motion axi motion trajectori palm region figur motion pattern gestur pattern encod dynam characterist hand gestur classifi neural network experi show result work ongo recogn asl sign sign index pattern queri acknowledg support offic naval research grant gratefulli acknowledg refer ahuja transform imag segment integr edg region detect ieee lexic borrow american sign languag silver pentland gestur analysi interpol view ieee fel hinton neural network interfac speech ieee tran neural januari freeman control hand gestur intern workshop automat face gestur pp huang visual interpret hand gestur review ieee jain vision base hand gestur interpret estim confer system starner pentland american sign languag recognit video hidden markov model intern symposium comput ahuja motion estim match set region primit ieee submit ahuja imag segment integr edg region detect ieee tran imag lang phonem recognit neural network ieee tran wilson bobick recognit interpret parametr gestur sixth pp
DB/1082 3 tempor object data model comparison martin erwig marku schneider ralf hartmut informatik iv germani present approach tempor data model base gener notion tempor object tempor object mean abstract data type approach express tempor discuss combin tempor spatial object object explain altern data model compar express introduct spite research spatial tempor data model larg develop independ spatial research integr geometr topolog inform model spatial object spatial data type identifi effici abstract model geometr structur spatial phenomena oper base definit spatial object point set approach point set topolog spatial object assum repres gener infinit point set properti structur boundari interior identifi reason spatial object model point set approach effici implement easili lead specif subclass linear spatial object linear polygon approxim vast major optim method index techniqu build linear approach fit nice model tempor object tempor research concentr record tempor evolut fact notion time transact extend knowledg store current past state real world tempor data model relat restrict view essenti prevent treatment continu chang tempor data gener research partial support chorochrono fund eu train mobil research contract erb view offer definit tempor object function map time codomain contribut present gener model tempor object definit base observ time express function time integr effort strive combin space time data model discuss evolv problem present approach data model paper exist deal integr model space address paper view topic fundament perspect make tempor object spirit abstract data type approach appli integr complex object spatial spatial data type integr adt attribut relat schema tempor essenti base atom standard data type extend explicitli implicitli type time tupl time tupl describ valid featur fact object show tempor base adt approach power current simpl extens differ class tempor object demonstr broad spectrum integr option tempor spatial object object compar express varieti tempor spatial data model offer possibl combin tempor spatial object object discuss design space explain altern spatiotempor data model main object special case tempor object compar express data model focu object defer treatment oper queri languag subsequ paper data model establish hierarchi interest visual object linear case view form move point form polyhedra move region wide spatial support adt approach repres inform spatial object set tupl flat relat show polyhedra model compar model hierarchi rest paper structur section defin model spatial tempor object describ express tempor model altern section deal design space obtain combin spatial tempor object data model number relationship model shown section conclud paper spatial object spatial spatial object space assum infinit correspond euclidean space ir spatial featur regard possibl point set ir adt approach spatial data type point region abstract spatial phenomena element spatial data type call spatial object set spatial object denot point region point region set point region speak mathemat definit region base point set avoid anomali regular close set regular set oper implement finit descript point emploi linear approxim spatial object set linear spatial object denot implement select approxim region type polygon consist set polygon possibl polygon hole point remain unchang spatial object relat scheme written attribut relat tupl form valu interest shown method integr spatial object relat method emb spatial object directli singl attribut complet spatial geo appli model relat data model call denot set relat attribut spatial data type simplic assum relat spatial attribut method lead denot set relat model spatial featur atom standard attribut type polygon repres set tupl store coordin point repres segment boundari polygon detail descript full paper tempor object tempor model tempor object defin model tempor object decid model time consist spatial domain time time ir time express function tempor version object type function type time call tempor function type tempor function time deal tractabl mean arbitrari tempor function determin time domain restrict comput function import comput valu time tempor object specif restrict result integr tempor object relat model compat chosen model spatial object restrict domain finit set time point interv type total order interv encod continu part fs domain domain tempor object finit set disjoint interv time point repres interv defin type constructor tempor object time mean tempor object defin set disjoint interv associ interv domain tempor function domain interv set tempor object denot speak reason linear tempor function restrict tempor difficult comput gener linear tempor function straightforward import integr store function valu boundari interv predefin interpret deriv function valu interior interv order formal notion linear argument type algebra structur call type linear nontrivi type function condit scalar multipl rf function function yield valu function captur hold virtu scalar valu interior interv comput ir usual linear transit captur scalar multipl defin reason defin return function simpli differ linear interpret geo affin map section function view easier handl approach linear tempor object model defin linear special special denot arbitrari time tempor function time linear lim lim linear function linear canon minim decomposit interv minim maxim linear minim decomposit defin partit type linear tempor object defin type constructor linear smooth note simpli restrict linear refin condit finit partit interv linear behavior notion linear obviou linear tempor object strict subset tempor lemma tempor object integr tempor object relat princip tempor object directli singl attribut complet tempor appli model data model call denot set relat attribut tempor object type simplic assum sequel relat tempor attribut denot relat atom attribut type defin unifi view tradit model tempor tempor object repres gener case requir time domain tempor object find common interv refin map make definit longer set tupl store type time flag indic futur specifi valu time tupl relat time denot inform model spline interpol suggest interpret compat flag ib distinguish close open true valid deriv valu interior order compar defin tempor object repres relat relat tupl describ tempor object project attribut yield relat singl deriv set tempor function interv repres map interv tempor function note final tempor interv tempor object normal merg tempor function adjac interv function ij tempor object denot relat final relat properli repres tempor object defin linear tempor object relat partit interv ws domain maxim subinterv tempor function linear subinterv obtain minim decomposit note repres function jump model correspond close adt view interpret definit complet undefin discret valid definit constant continu linear constant part spent interv attribut type mean repres function evolv linearli continu function sequel partial defin tempor function lim lim undefin relat repres tempor function tempor object relat repres complet linear tempor object express tempor data model compar model oper nf relat model describ map nest oper addit set attribut nest function appli result store attribut unnest oper appli function attribut rs tupl produc relat schema compar tempor data model show express simpl extens mean adt approach essenti simpl tempor relat model linear tempor behavior concern show gener power differ li essenti fact tupl repres set tupl defin simpl transform map relat transform relat simpli relat transform relat theorem proof total clear transform fact proper ground partial linear function jump repres import differ lost lift attribut exist independ domain tempor attribut addit rule distinguish tempor attribut reflect fact tempor model express model extend store addit end repres linear tempor object flat relat call model redefin extend theorem gener restrict linear behavior direct corollari lemma theorem data type data model model spatial tempor object integr combin landscap data model straightforward approach fact type obviou appli type geo immedi obtain object type model move restrict linear tempor spatial obtain model note appli geometr type geo ensur linear smooth identifi reason type choic point arbitrari vector region polygon affin map provid gener model geometr transform amen scalar multipl model linear compon type spatial tempor spatial tempor ferenc oper scalar multipl defin vector affin map oper defin point usual vector addit subtract simpli record vector translat scalar multipl defin intermedi posit point move lie straight line connect polygon differ defin polygon matrix vector altogeth variabl fulli determin pair point point pair point obtain equat suffici comput paramet scalar multipl defin affin map vector infer affin transform imposs defin tabl list adt integr relat altern distinguish encod object set tupl appli spatial tempor object part model combin model give attribut type object tabl mention adt version spatial tempor object integr model denot model spatial object integr tempor snapshot valid version spatial object store expon express tupl repres snapshot denot model spatial object encod tupl segment tupl tempor behavior linear tempor object mean evolv polygon repres tempor object store behavior segment unrealist model notic number compon chang linear area model split merg region give type point entri column column point region polygon line st tempor object model exist spatial object model exist model describ option simpli combin exist technolog spatial tempor omit model unconstrain tempor object store segment difficult arbitrari tempor line object complement proper polygon simpl model adt st model repres chang polygon km tupl tupl repres polygon snapshot common time stamp express model model present form hierarchi describ obtain hierarchi shown arrow model model mean express edg label serv indic theorem combin gener result spatial object full theorem aggreg spatial tempor object separ mean aggreg st extens total function map extend st extens st observ full fact theorem st st proof part directli fact part deserv simpli appli spatial attribut hidden tempor unpack care total defin true subset map extend st mean extend unnest function st aggreg spatial object part aggreg tempor object obtain corollari theorem part directli theorem result st st theorem st theorem express relationship flat relat model wrt adt model show relationship result polygon special case gener region theorem theorem essenti fact corollari lemma obtain result express relat linear tempor object express relat gener tempor theorem corollari theorem obtain part theorem theorem instruct imagin object model present relat directli featur restrict describ arbitrari volum curv case restrict region object polygon face parallel plane restrict straight translat scale rotat wrt translat sever restrict result affin number compon number vertic polygon chang linear facilit effici imagin move region repres polyhedra interest note polyhedra compar express polyhedra repres model number compon polygon vertic present model tempor object tempor offer model option investig rel express model clear pictur relationship model compar tradit view tempor adt approach versatil offer control tempor linearli constrain object futur work specif object model detail refer rr berman stonebrak system manipul displai geograph data comput vol pp rh schneider vazirgianni data approach model queri move object acm symp geograph inform erwig schneider vagu region int symp advanc spatial lnc pp schneider rh tempor object data model comparison technic report version point set topolog academ rh schneider spatial data rose algebra vldb vol pp rh model queri languag geometr system int conf extend pp rh introduct spatial system vldb vol pp jw van design spatial data structur relat normal form int journal geograph inform vol pp schneider spatial data type system finit resolut geometri geograph inform system lnc huang queri languag spatial data analysi int symp advanc spatial pp applic abstract data type abstract indic cad data base conf engin design pp schek mh scholl relat model attribut inform vol pp segev tempor data model base time sequenc chapter pp stonebrak type relat data base system ieee int conf data pp scholl themat map model int symp design implement larg spatial pp au segev snodgrass tempor implement publish rb set membership unifi approach geometr intersect problem ieee transact vol pp mf worboi unifi model spatial tempor inform comput vol pp ts yeh de time geometr dimens model evolut approach int conf integr gi
HCI/1083 4 digit physic surrog mediat commun privaci media space saul greenberg cite digit physic surrog mediat commun privaci media space person januari digit physic surrog mediat commun privaci media space saul greenberg depart comput calgari alberta canada abstract institut engin mechan system tsukuba japan digit physic surrog tangibl remot typic member small intim posit offic digit control surrog select collect present awar inform peopl repres react explicit implicit physic explicit act includ grasp move implicit act includ move surrog respond appropri physic action surrog control commun capabl media space natur surrog balanc awar privaci limit abstract activ offer level salienc user combin attribut mean surrog make easi intim collabor smoothli move awar casual interact mitig privaci distract concern explor surrog design work good infrastructur place awar server base distribut automat store distribut event packag surrog physic widget make easi programm plug surrog awar server control gener awar view displai event surrog implement present issu step ubiquit media tangibl ambient casual cscw digit physic surrog greenberg introduct digit physic surrog physic remot typic member small intim posit environ surrog creat media space embodi awar inform present opportun react appropri explicit implicit control commun channel devic repres activ distant peopl idea summar section artist research alik built system plai notion breakthrough work time deepli wai idea structur appli ambiti research agenda place current understand convent graphic user interfac design requir thirti year research evolutionari develop breakthrough made sutherland belief physic devic present opportun design media space goal design leverag surrog goal support smooth transit casual goal mitig privaci distract concern awar system describ idea digit physic surrog facilit casual interact intim collabor briefli review casual interact collabor benefici technolog happen collabor separ distanc includ summari small set design goal altern approach casual interact base physic devic section present variat idea illustr varieti digit physic surrog built laboratori section broaden discuss reason surrog mitig concern distract portrai limit abstract present salienc section briefli describ underli architectur section summar usag experi recogn work begin broader research close paper indic research issu step casual interact problem backbon everydai coordin work team member casual spontan initi meet occur dai glue interact inform peopl track maintain gener work physic environ casual interact problemat distribut commun casual interact drop exponenti distanc awar opportun interact diminish peopl sight substitut electron commun channel groupwar readili peopl troubl establish realtim electron contact casual interact system provid commun member measur awar person digit physic surrog greenberg mean move awar encount commun work convent approach cscw research awar develop method provid inform awar mediat casual interact distribut commun media peopl select offic common area remot site switch view site continu video video remot offic creat connect parti extend glanc full call period video commun present screen arrai small low fidel imag updat minut icon styliz icon portrai abstract awar inform figur illustr built design goal tradeoff varieti design goal tradeoff underli system support casual interact summar provid awar inform peopl interpret effort figur icon indic imag fade remot interest local person light color text time pass person touch comput bar chart graph motion time saul recent enter activ offic support smooth transit peopl move awar issu open separ commun amount work person open channel balanc effect give inform present run risk distract issu inform present foreground high risk background risk balanc awar privaci issu includ reciproc maintain intrud control inform present channel maintain social cue peopl prepar space design concern fact media space approach channel awar commun singl devic typic comput lead implic media space develop convent graphic user interfac awar displai compet comput program dourish bly report porthol user video snapshot hidden digit physic surrog greenberg experi share icon indic screen busi place displai awar inform comput seldom devic peopl attend awar inform attend comput singl displai repres commun groupwar applic consequ overli complex interfac establish commun peopl switch altern physic devic partial solv problem satisfi awar design goal physic devic comput captur present remot activ mention system develop artist summar varieti art instal suggest approach physic devic support abstract awar devic present tradit comput underli commun control system comput approach promot interperson distanc feather manipul surrog present event feather drift pleasant discuss awar present pure abstract approach promot manipul toi encourag respond counterpart encourag symmetr shake send devic receiv devic vibrat hand pair devic design movabl connect ball move ball devic partner ball move peopl plai develop pattern movement rhythm haptic devic peopl manipul physic devic consist cylindr roller mount base person rotat roller remot object rotat forc partner counter motion approach network furnitur promot awar internet bed relai abstract presenc intim bed presenc motion person bed translat sound bed bench warm bench locat reflect person sit bench make interest bench gradual open voic channel sit spot enrich direct commun channel varieti everydai physic devic situat buxton ubiquit media space devic advantag media build convent work concentr integr video space exampl includ hydra unit unit small video speaker act video surrog remot person awar support situat devic strateg mount hydra unit offic door mean peopl video offic occup respond desir digit physic surrog greenberg mention reflect physic devic opportun design media space solut digit physic surrog combin singl devic artist physic devic notion tangibl interfac video surrog commun ubiquit media space notion reactiv devic room control automat infer intent action room goal creat set develop devic appli creat surrog explicitli intim work collabor move awar encount commun work surrog design mitig privaci concern transmit select awar inform peopl control transmit receiv explicit implicit action set scene illustr exampl digit physic peopl move awar interact defer discuss surrog balanc privaci distract section move awar interact goal support smooth transit casual work contend surrog design satisfi goal briefli present progress surrog wai combin video document exampl surrog activ avail remot surrog local person interest remot surrog embodi commun channel manag media space mention devic construct hobbi simpl sensor technolog give form factor surrog chang significantli product surrog activ avail class surrog illustr activ remot person embodi physic surrog locat local offic assum inform remot person captur local displai section class surrog present inform local person awar aspect infer avail surrog motor model alter motor digit control activ correspond burst activ remot person detect motion sensor remot person gener inact inact person enter room flap wing audibl quickli slow gentl quiet wing motion minut person open offic notic larg movement inhabit share space portrai state activ digit physic surrog greenberg surrog surrog figur surrog indic activ avail light show surrog surrog attach atop servo motor surrog face wall remot person unavail inact person rotat face local person remot person notic surrog slight sound produc attract attent larger longer long person surrog continu face forward surrog eventu face backward estim avail time glanc person present aspect surrog surrog repres current state orient light surrog displai activ movement light pattern ceil room inspir ishii light reflect water ceil creat ambient displai project light glass trai trai color motor comput control water remot activ notic illustr surrog present inform background ambient surrog abstract entiti discuss surrog act physic counterpart icon indic figur show abstract activ inform show transient event happen surrog rememb state digit physic surrog greenberg advantag part physic heard person attend comput posit placement influenc perceiv foreground background devic architectur term light surrog interact exist light level varieti design instrument everydai applianc act surrog suffer problem similar icon indic serendipit opportun moment contact difficult person advantag opportun surrog disconnect commun channel person forc select activ commun channel explicitli mechan expect opportunist interact establish contact involv explicit choic extra work show shortli limit remov surrog interest class surrog illustr person explicitli express interest remot person avail interact manipul surrog facilit initi encount mutant surrog locat offic repres transmit present avail inform greenberg hold instrument heat notifi greenberg interest surrog mention section rotat back time attract remot light surrog higher level intens mutant surrog respond surrog figur surrog interest respond surrog posit rel surrog defin interest remot person figur local person explicitli posit respond surrog rel surrog posit stage face remot person notifi mechan section local person interest commun lesser interest avail move digit physic surrog greenberg interest tip light sensor stage base respond surrog detect posit proxim surrog repres remot person instrument ultrason sensor measur close local person unit local person interest remot person simpli move close surrog shown discuss surrog react action wai requir explicit act part local case hold act posit act proxim surrog react implicit natur interest automat calcul function distanc assum surrog posit place interest side effect interest transmit person move close open door opportunist encount surrog interest person wai interest avail shown hold mutant close proxim surrog respond surrog rememb interest continu state shift reposit surrog embodi commun channel manag media space previou exampl illustr surrog embodi awar manipul transmit interest difficult move interact connect commun channel show surrog embodi commun channel form part media space peopl control awar deliv commun channel activ hydra surrog embodi video audio connect singl remot person proxim surrog recreat hydra unit integr singl compact camera microphon captur local video displai speaker present remot audio imag instrument unit ultrason make behav type proxim surrog actual sensor rest atop hydra unit unlik origin hydra presenc absenc audio qualiti video portrai presenc groupwar comput displai control implicitli posit rel surrog close hydra full channel peopl move audio disabl move degrad video space video visibl black activ hydra mimic proxim implicitli peopl peopl notic move begin peopl close commun awar peopl move digit physic surrog greenberg figur activ hydra surrog embodi commun combin close medium close audio video medium video video tabl relat proxim activ hydra unit combin surrog combin merg surrog type provid awar manag commun qualiti explicitli implicitli peopl respond surrog avail control qualiti servic deliv commun channel embodi activ hydra unit displai figur state tabl shown tabl determin commun manag function explicit placement respond surrog proxim peopl surrog medium audio number digit physic surrog greenberg close medium tip tip tip close tip medium tip tip tabl qualiti servic function proxim respond surrog state audio number servic level valu partial servic letter qualiti servic level full valu repres partial servic tabl omit surrog react state discuss surrog react implicit explicit creat natur situat model mutual avail intent full commun channel establish peopl close hydra unit posit respond surrog stage cell upper left corner person show move hydra surrog st cell row valu tip respond surrog st cell row valu st cell row valu model peopl bump move intent talk surrog show video peopl close case audio channel automat enabl commun channel degrad surrog provid basic awar inform chanc serendipit mediat effort implicit action consequ commun groupwar channel function implicit person proxim surrog explicit posit respond surrog surrog peopl easili stai awar move intuit casual interact combin surrog present balanc privaci distract goal mitig privaci distract concern awar system contend surrog mitig concern distract privaci portrai limit abstract present salienc valu implement system wai st version analog video control signal interpret version digit video audio distort stream algorithm function surrog state section digit physic surrog greenberg limit abstract activ portrai risk privaci violat high surrog activ limit abil express inform surrog suit portrai limit notion avail abstract activ provid gener lessen risk surrog design includ measur activ avail captur section video measur map surrog abstract sourc inform gather orient doll impli fairli liter notion remot presenc activ level light surrog present inform abstract aesthet manner tradeoff abstract protect infer avail abstract error unwant interrupt lost opportun qualiti commun servic preserv privaci minim distract previou activ hydra limit direct view space combin explicit control channel implicit proxim commun devic guard privaci reciproc view fidel depend state surrog detail tabl mutual interest balanc visibl commun channel salienc awar salienc awar awar inform perceiv foreground absolut inform high salienc wait tap window likelihood distract greatest displai inform conspicu high salienc unavoid extrem ambient displai low salienc minim risk overlook opportun collabor physic surrog express level salienc posit room affect close normal field highli salient devic posit direct line background salient devic actual design surrog embodi level salienc beat notic attract gentl flap larg visual light surrog subtl salienc correspond small result small movement slight increasingli larger produc salient movement sound architectur implement surrog control architectur center distribut system implement control input instrument situat environ collect inform activ make digit form model awar model collect digit inform distribut site view surrog behavior depend state data store model illustr work describ awar give exampl input instrument digit physic surrog greenberg site site control model model view motion detector keyboard detector proxim sensor figur simplifi awar model architectur control site updat valu awar model valu propag view alter reflect valu site control view attach model valu describ local remot user control surrog react data describ surrog packag physic awar model built softwar portion system groupwar toolkit architectur manag commun distribut process activ confer session awar model implement share replic data structur kei valu share environ data replica locat process machin automat updat awar model instanc confer process propag awar model instanc illustr figur code fragment initi model set set set set set type sound media space qualiti st creat share environ call return uniqu identifi local user remain line add initi kei valu awar inform person activ person offic describ long person touch comput interest local person talk person store close person surrog control input instrument hook control model control simpli input instrument gather inform translat store awar model illustr proxim sensor measur distanc activ hydra surrog analog compon case sensor produc ultrason digit compon counter measur time ultrason sound echo custom softwar run basic stamp ii board parallax collect digit inform serial softwar local comput poll digit physic surrog greenberg basic stamp ii board digit inform store awar model input sensor work similar manner mutant surrog notic held heat sensor detect bodi transform store model respond surrog set measur light light base determin surrog stage tip activ detector compar success video snapshot differ convert abstract notion activ store slot idl time detector softwar calcul long person touch comput watch keyboard store view surrog awar model data reflect state gener view view surrog react manner awar model attach callback execut automat awar model interest react activ kei includ line code bind callback control surrog respond correctli illustr surrog mount servo motor control basic stamp turn control local comput attach callback paramet model shown paramet callback check activ chang inspect variabl return part user repres code callback direct basic stamp ii rotat angl consequ low activ model surrog face high face valu transform intermedi rotat surrog monitor model behavior respond valu model control motor activ reflect monitor beat wing moment attract attent activ hydra control valu model callback inspect valu scheme similar shown tabl decid displai media space implement analog audio system basic stamp ii control relai switch turn audio tabl implement digit video softwar progress mask channel digit physic surrog greenberg surrog advantag distribut system begin devic physic widget convent gui import idea present programm easili entiti defin detail entiti hidden commerci electron devic develop fujitsu person comput system signal email arriv red green light intern electromagnet lower head press head produc electron signal program raw devic awkward serial serial port open configur correct set light electromagnet control transmit seri bit control intern regist user interact caught monitor state line simplifi devic activex compon behav standard widget portion gener event head updat model portion widget packag control model visual basic code segment adjust view compon event indic remot statu arriv updat select case distant person turn light put hand head case distant person head green light case true true distant person flip surrog hand head time case true true figur fujitsu devic red green light head turn hand head detect head press point descript packag devic make extrem easi program surrog includ architectur discuss architectur distribut architectur extrem power awar model high embodi awar inform digit physic surrog greenberg detach view control design craft control gather awar activ captur motion detector environ instrument chair surrog repres inform light show respond activ map surrog respond combin valu chang affect control affect valu variabl ad type inform model straight requir modest effort kei callback packag devic make easi program devic found easi experi control treat applianc plug awar model inform model control surrog icon indic displai shown figur usag experi prototyp physic fragil limit deploi research group live space popul evolv version physic digit surrog month greenberg version system illustr figur activ similar system activ hydra control respond surrog proxim media space extrem effect similar experi found media space felt fairli due media space feel connect attenu system frequent casual interact common episod includ quick social coordin inform introduct visitor offic distant person experi differ shape natur surrog ambient posit surrog activ hydra balanc privaci commun surrog ambient displai visual sound produc surrog prove effect ambient displai cheap motor bit remain awar found awar move smoothli natur opportun moment icon indic run parallel comput displai figur rare surrog posit posit surrog activ hydra side sat typic direct line vision posit meant directli turn head move close activ hydra chair lean forward consequ posit easili maintain awar surrog glanc video displai hydra unit desir chang surrog move surrog initi commun surrog posit unconsci situat apparatu place suit type intim awar collabor desir digit physic surrog greenberg surrog balanc privaci awar activ hydra control simpler version state diagram illustr tabl found natur provid reason balanc awar privaci author greenberg student potenti overhear find distract prove problemat reason natur chair posit offic meant visitor seat activ hydra disabl audio overhear peopl close activ hydra produc slight hum sound provid ambient feedback audio turn greenberg tip respond surrog limit channel explicit act mediat offer implicit situat final experi mention visitor offic found media space interest natur grasp concept immedi issu step advantag digit physic surrog compar comput counterpart window cover posit room advantag physic space depend person attend comput surrog embodi entir commun content channel mediat seamlessli peopl interact explicitli surrog recogn surrog present limit issu suggest research agenda issu understand activ estim avail understand activ equat activ captur displai effect surrog requir understand human factor peopl perceiv avail space work area research educ guess inform captur portrai remot peopl issu design surrog behavior audienc accept surrog depend greatli extern behavior surrog present appeal collabor busi associ prefer institut style wireless activ hydra form factor similar pda posit offic surrog devic anim rotat slight motion children prefer familiar research exploit toi microsoft barnei embodi inform adult friend desir contemporari aesthet style fit home relat surrog situat integr effect offic home architectur plenti room remain industri digit physic surrog greenberg figur progress distort effect function pixel algorithm issu wai mediat privaci commun alter qualiti servic creat experi method manipul commun channel order automat reveal inform channel awar preserv privaci collabor michael experi digit method alter video includ automat resolut reduct refresh contrast figur illustr version activ hydra distort run digit video imag function distanc pixel test distort techniqu user determin measur level distort mask reveal understand level map proxim function ambiti extens work mitig privaci distort period video snapshot experi method alter includ volum issu scale surrog work larger group system built point point system architectur advantag easili surrog extend group relat work hydra unit number edg peopl accept offic rememb surrog design intim impli small switch mechan work matrix compact ambient tangibl devic show avail statu slightli larger group peopl subgroup select touch devic figur awar repres movement cave avail hit hammer establish video connect digit physic surrog greenberg video hydra unit switch person illustr figur modifi behavior game act surrog devic repres remot move cave amount reflect remot presenc activ level local person move desir hammer video connect peopl establish desktop futur version make hydra unit note video connect made cave mean peopl peer unoccupi offic type interact hit persona origin game issu extend surrog facilit peopl move easili work experi link surrog groupwar applic share automat comput displai peopl close proxim tabl extend make groupwar function proxim issu system evalu usag experi surrog accept group environ issu judg surrog ensur reason level privaci recogn awar devic present risk surveil knowledg design safeguard summari previou system demonstr notion physic devic awar indic reflect role devic act surrog remot peopl part discuss surrog support facilit awar smooth transit interperson interact includ show surrog activ interest embodi commun channel act integr part media space discuss surrog balanc awar privaci limit abstract activ offer level salienc abil explor surrog design work argu good infrastructur place awar server base distribut architectur automat store distribut event argu import packag surrog physic widget make easi programm plug surrog awar server control gener awar view displai event left paper small step larg research agenda understand role physic devic mediat commun privaci media space acknowledg research sponsor part nation scienc engin research council microsoft research ministri educ japan fund dr visit work place fujitsu digit physic surrog greenberg suppli devic laboratori michael boyl insight preserv privaci digit media space akira built surrog indebt children favorit toi refer media bring peopl audio comput environ commun tangibl bit remot collabor commun acm confer comput support cooper pp impact video imag distort filter media space project comput calgari live augment ubiquit media reactiv environ video mediat commun pp interfac videoconferenc video mediat commun pp make group commun groupwar acm confer organiz comput pp kc reactiv throw keyboard commun medium intim commun acm extend abstract confer human factor comput pp dourish bly support awar distribut work group acm confer comput support cooper pp place learn commun comput support cooper field threshold door english research center augment human intellect pp system inform commun acm confer comput support cooper pp evalu video technolog inform commun acm confer human factor comput pp devic interperson haptic entertain acm confer human factor comput pp low cost awar commun acm chi companion confer human factor comput pp digit physic surrog greenberg techniqu address fundament privaci disrupt tradeoff awar support system acm confer comput support cooper tangibl seamless interfac bit atom acm confer human factor comput pp principl harvard mass judg avail interact video snapshot ieee hawaii intern confer system scienc softwar tool programm embodi agent acm confer human factor comput pp pattern contact commun scientif collabor acm confer comput support cooper pp mediat awar commun digit physic surrog video extend abstract acm confer human factor comput system initi user reaction redesign implic acm intern confer support group pp abstract presenc support mutual awar acm confer human factor comput pp peopl presenc room support awar distanc acm chi companion confer human factor comput pp awar driven video qualiti servic collabor virtual environ acm confer human factor comput pp build real time groupwar groupwar toolkit march acm transact comput human support simpl poster acm confer comput support cooper work graphic commun system spring joint comput support distribut group montag lightweight interact acm confer comput support cooper pp rapid prototyp awar servic share inform server acm sigchi red green awar avail improv time spontan commun short paper acm confer comput support cooper digit physic surrog greenberg
HCI/1084 4 proc aalborg user interfac interact virtual environ thoma st erik laboratori comput vision media institut electron system aalborg aalborg denmark abstract paper natur human comput interfac interact virtual environ point direct user virtual environ estim monocular comput vision posit user hand extract imag plane map direct knowledg posit user head kinemat constraint point gestur due human motor system test system show result implement real time system progress expect run introduct recent year concept virtual environ emerg virtual environ comput gener world imagin virtual world virtual realiti visual entranc vr screen act window vr ideal feel virtual world believ user wear displai locat front larg complet surround larg screen applic area vr train doctor train simul flight collabor work entertain chat virtual museum product develop present construct urban plan data mine art applic user interact pinpoint select menu point number point devic advanc develop support interact technic devic surround interfac base comput term natur intuit gener problem human comput interact activ research area trend develop interact method closer speech bodi languag author depart virtual environ side figur stylu point devic interact applic posit orient stylu regist magnet track system gener bright line virtual world indic user point similar paper replac point comput vision system capabl natur point gestur hand marker special assumpt make interact cumbersom intuit explor achiev camera paper focu interact side suffici initi feasibl usabl studi expend side camera point gestur point gestur belong class gestur deictic gestur describ point concret gestur depend context person direct pinpoint object direct orient lower arm compar instal cave tm automat virtual electron visual illinoi chicago crt projector crt projector crt projector screen camera camera user fig schemat view size note projector camera shown user insid interact point stylu held hand direct pinpoint object depend user distanc object object close user direct index finger idea activ contour estim direct index finger stereo setup identifi object user point extrem case user touch object index finger object user point locat surfac comput close user user point text imag project desk tip index finger found camera desk point larger length user arm pointer index finger tip pointer found background subtract object point approxim meter point direct line span hand visual focu experi shown direct consist individu line avoid occlud object result propriocept unknown line good approxim top point head index finger estim extrem point belong silhouett user inform object point found search triangular area imag defin extrem point depth map scene user point subtract data classifi point belong arm point belong rest bodi index finger top head found extrem point class camera estim posit index finger found extrem point silhouett produc phase user point mark posit screen visual focu point estim converg point line span mark mean locat visual focu adapt individu user point habit mean user chang bodi posit point context scenario distanc user screen approxim meter object displai close meter case mention occur point object meter point direct line span hand visual focu user wear figur magnet tracker mount glass measur posit orient user head updat imag screen user point view simpli posit orient tracker point direct consciou head movement point shown unnatur possibl transform syndrom problem neck region due mida touch problem practic sound posit tracker estim visual focu posit hand estim order calcul point direct replac point devic natur intuit action point gestur estim exact posit hand camera difficult task requir reduc make user part system feedback loop user point direct line start hand point direct system point user adjust point direct fly method focu interact side assum user torso respect screen estim posit shoulder base posit head vector glass shoulder call displac vector discuss section point direct estim line span hand visual focu order estim posit hand singl camera exploit fact distanc shoulder independ point direct impli locat surfac sphere radiu centr user shoulder ys zs xs ys zs coordin origin system origin centr floor ax parallel side cave rest paper cave coordin system camera system calibr cave coordin system calibr enabl map imag point line cave coordin system estim posit hand imag obtain equat straight line optic centr camera direct unit vector line posit hand found point line intersect sphere obtain insert row equat equat result order equat complex solut intersect real solut exist uniqu elimin solut solut respect tracker elimin elimin requir posit previou posit simpl order predictor point direct found line span intersect point visual focu point line express line space similar equat point direct valid posit tracker hand constant amount time estim posit hand imag author depart equip miniatur camera upper corner usabl studi comput vision base user interfac illumin sourc imag captur imag side figur ambient illumin insid colour depend displai imag bright insid determin displai imag averag bright normal applic colour machin vision auto gain camera set maximum shutter switch maximum open result noisi imag colour figur al recent system segment user background order gener video avatar infrar camera cope poor light condit simul refer background imag subtract infrar imag user satisfi result tai calibr method full rai tube projector projector consist crt equip fl projector simul background inform illumin user estim intens threshold segment user due orient camera calcul intens camera field view cover part mean background imag imag process place lot data transfer project camera priori knowledg scenario camera field user time present posit orient user head magnet tracker background brighter imag side side shorter higher reflect human skin skin good reflect long wavelength figur show algorithm segment user hand estim posit imag firstli imag area user hand point estim posit orient user head magnet model human motor system kinemat constraint relat camera paramet field order predictor estim posit hand posit previou imag frame describ algorithm entir imag illustr constrain search area adapt threshold intens imag satur label object determin posit largest object hand posit estim previou imag frame map imag plane head posit orient magnet tracker map imag plane estim posit hand rgb imag camera red channel threshold fig segment algorithm posit estim hand camera imag histogram intens imag bimod brighter pixel origin background darker origin figur segment user background optim threshold distribut found weight sum group varianc estim threshold dash line figur result binari imag appli threshold colour variat camera imag poor colour close grai vector satur imag colour empir factor red channel segment pixel maxima skin area long user wear cloth high reflect long wavelength histogram red channel threshold weight sum group varianc threshold label appli figur show segment result largest object posit head associ skin area exclud remain object user hand posit imag calcul central moment evalu section present evalu part system accuraci point section test segment hand test implement real time system test visual feedback user segment hand camera imag imag sequenc user point insid background illumin condit posit estim hand fig segment user histogram intens imag dash line threshold found weight sum group varianc threshold imag fig red channel camera imag threshold red channel label largest object grai valu imag invert test sequenc qualit result posit estim work robustli mixtur colour case major applic skin segment fail displai imag dark colour red crt displai measur red channel camera small noisi implement real time system progress calcul intens part estim hand posit work version entir imag reduc region pixel imag pentium iii tm expect introduc reduc search area code point experi visual feedback subsect describ point experi evalu accuraci point direct estim section user point point displai screen shown figur visual feedback user show natur point gestur experi user imag point gestur data magnet head tracker displac vector head tracker shoulder measur user evalu data turn posit estim head magnet tracker direct moment calibr devic order achiev higher axi axi axi fig setup point experi visual feedback user distanc approxim screen point raster displai accuraci error larg head posit inform method previou section order accur posit user head visual focu point segment imag data measur posit posit visual focu point estim posit estim posit shoulder displac vector section figur show result repres point experi circl real posit displai screen asterisk connect dash line respect estim posit user point error figur estim column left intersect sphere span user arm line span camera user finger axi axi axi axi axi fig result point experi circl figur real posit screen asterisk estim point direct system result repres constant displac vector result repres displac vector circl show averag error experi outer circl show maximum error experi error user point left due incorrect assumpt section displac vector constant direct magnitud displac vector tracker shoulder vari illustr figur figur illustr direct magnitud displac vector tracker shoulder user head straight ahead head rotat left shoulder rotat illustr figur result wrong centr sphere wrong estim hand posit error illustr angl rotat shoulder squeez make relat tracker rotat displac vector figur show compon displac vector estim dx tracker shoulder displac vector hand posit estim hand posit shoulder posit estim shoulder posit fig user displac vector tracker shoulder side illustr error introduc assum torso shoulder posit imag data tracker data user lookup tabl displac vector function head rotat build figur show result repres point experi lookup tabl displac vector order estim posit shoulder averag error notic posit shoulder correct estim left column point fig compon displac vector function figur tabl show averag error maximum error point experi mm respect point screen error illustr figur circl averag error outer circl maximum error averag error point experi discuss paper demonstr technic interfac devic replac natur finger point point gestur estim line span posit hand visual defin centr point ey visual focu point moment estim imag data measur futur form posit orient electro magnet tracker tabl averag error mm respect point screen axi axi mount stereo glass worn user posit hand estim intersect line hand sphere centr shoulder user radiu equal length user arm point experi user user point point screen distanc due movement shoulder point error estim real posit screen observ reduc error correct posit shoulder reduc averag error maximum error find accur result user stand meter error larg depend applic final system estim point direct bright line stereo glass start user finger end object point error critic user part system loop correct fly effect error hinder user accur point feedback accept system applic feedback effect sourc error error origin imag definit point assumpt torso respect assumpt constant deriv explicit express error sourc present set test scenario measur effect error experi accuraci usabl real time implement finish show method replac tradit point devic suggest test issu intend investig futur mida touch problem inform system point gestur present simpl test scenario gestur easi determin perform mention gestur posit hand constant number frame realist scenario multipl gestur problem difficult type solut present thumb bottom gestur spoken input path follow decid refer improv interact ad gaze agent environ master aalborg thoma track data associ academ sl visual data mine lb tb kg workbench environ build multimod system intern confer cooper multimod dj virtual design implement cave comput graphic page acm august pa nj uncalibr stereo vision point interfac iapr workshop machin vision decemb mase point interfac imag process comput gonzalez paul digit imag process publish integr live video environ ieee juli huang detect estim point gestur dispar map fourth intern confer automat march kahn mj swain understand peopl perseu system intern symposium comput coral novemb erik creat plan intern confer comput urban plan urban septemb ritter neural recognit human point gestur real imag neural process blair macintyr steve feiner futur multimedia user interfac multimedia hand gestur reveal thought chicago mase gestur interfac virtual workshop perceptu user threshold select method histogram ieee transact polhemu stylu magnet tracker fast track hand fingertip infrar imag augment desk interfac fourth intern confer automat march jl taylor di point behaviour brain
HCI/1085 4 prototyp special adapt dirk henrik michael gmd german nation research center inform technolog sankt augustin abstract paper present prototyp www wide call special adapt physic blind visual impair adapt includ miss implement sophist advanc speech output evalu usabl test conduct prove suitabl implement special adapt futur goal work user interfac standard regard reactiv approach react shortcom common proactiv integr standard softwar layer user underli applic easili adapt varieti person handicap illustr special adapt includ futur version common order move step inevit improv user interfac disabl elderli peopl scope project discuss introduct comput technolog import part everydai life found home place comput tool handl mass exist data import includ peopl special access peopl exclud share cultur econom activ commun problem solv design user interfac gener design establish softwar ergonom principl clariti variabl order meet text manipul virtual realiti modal mean system present inform user wai blind user speech output monitor output kind inform store modal independ modal redund modal independ inform offer wai ascii text modal redund mean inform store enabl system present pictur text descript pictur system provid interfac common assist technolog displai speech adapt refer user defin set prefer determin font usabl peopl special easi learn peopl physic handicap blind directli indirectli affect mobil internet www import sourc possibl access work opportun lot widespread inform familiar ubiquit environ futur goal work suppli common inform www obtain call recent version common microsoft internet explor netscap navig sought improv user interfac peopl special import improv complet access keyboard benefit physic impair depend navig environ anymor introduc special adapt integr includ futur version common order move step part master written scope gmd research project disabl mean proactiv integr standard softwar layer user underli applic interfac easili adapt varieti person handicap horizon master thesi illustr special includ futur version common order move step standard increment insuffici account varieti person human comput reactiv react adapt shortcom common common function store context sensit function addit adapt visual impair physic handicap peopl intent prototyp illustr possibl includ adapt peopl special affect ui user due restrict resourc implement prototyp implement microsoft visual basic activex activex tool retriev miss toler miss integr enabl user select button toolbar pointer close directli touch button benefit physic impair user closest button pointer highlight case featur activ serv visual feedback user button select button hit widget select left button usual miss toler implement toolbar extens imag map implement due interfac problem program environ implement miss toler suitabl base applic automat applic approach realiz implement markup guidelin provid specif instruct web design program access web side peopl special appli guidelin affect aesthet user disturb adapt implement appli automat lot implement guidelin realiz present screen reader screen reader softwar read textual screen content user altogeth found implement user adapt appli current document technic point guidelin appli chang document adapt provid adapt physic impair minimum size clickabl imag good physic impair enlarg imag hit easi adapt visual impair turn background imag hard read text background pictur adapt blind replac acronym screen reader problem letter featur enabl user replac acronym express insert dot end list screen reader lower voic end list item point end sequenti present tabl screen reader read tabl line line total listen screen reader cell item find header row column tabl case cell entri column bold find transform tabl sequenti cell cell tabl featur chapter approach access tabl origin tabl present sequenti tabl insert dot abbrevi gmd screen reader letter read abbrevi word abbrevi defin capit immedi wrong interpret abbrevi exclud letter header capit label list number blind end user quicker overview list structur list label list label project access approach modifi realiz access blind project proxi server common chang adapt modular select adapt block select proxi modular select adapt implement adapt provid list link sight user quick overview document blind user abil featur enabl blind user quick overview impress document list link provid list header list list header quicker overview sight user click header user jump header document keyword stand mean link point posit web insert place web document blind end user inform object type screen reader displai search keyword jump link link integr screen reader synthet speech output frankfurt integr synthet speech integr browser product work integr speech read reveal advantag contrast ordinari screen read screen content process visual turn explicit structur inform implicit structur inform hard imposs structur inform advanc speech output interfac option interact monitor turn input devic keyboard object assign shortcut user tab object activ window interfac make system access blind user assign speed volum assign fast low voic high voic list item structur present acoust read read link select press option system read current link link select jump structur element kei current element step step provid step rang combin kei user step rang fix jump list element tabl element select perform gener prefer kei step kei set read posit immedi list link header press jump back begin document tabl navig row cell current row header column cell current row header tabl cell option current row column number spoken kei press acoust navig tabl start column row kei press abort kei speech output jump end tabl acoust navig hypertext system implement similar research project tabl navig al implement fast forward function integr extens current system adapt visual show aspect visual impair user unchang version current web blind user sit comput listen adapt version document kei control element focu form program load read statu function order enabl blind user start quickli rest load order inform user system busi user interv speech feedback evalu implement accomplish usabl system investig test speech interfac end user comput frequent comput monitor turn order simul circumst blind peopl navig comput system test miss toler physic impair end user dortmund frequent comput test speech interfac blind visual impair end user goal evalu gain qualit result order assess implement special adapt term suitabl extens user interfac common research enhanc small number subject suffici test scenario structur establish test principl account user descript procedur usabl interview perform order determin comput skill subject subject perform predefin standard task repres typic navig procedur navig gmd homepag find inform homepag open local file observ note remark subject work standard task final interview conduct particip usabl test consist open close format question item questionnair select principl suggest develop evalu dialogu system dialogu principl interest redesign user interfac implement suitabl clear open question serv enhanc present user interfac subject encourag express construct critic main goal verifi standard interview guidelin correct run reveal bug chang phrase standard task test item questionnair speech interfac sight end user show result usabl test blind visual impair particip expect sight user problem handl feedback easi user remind shortcut suggest improv possibl determin user fast forward function tangibl inform size load document approxim read compar chapter mention user group summari evalu show easi suitabl perform standard task list link blind user navig web site structur element header list item recogn adjust voic good control speech interfac miss toler facilit select button toolbar physic impair end user subject express improv extens suggest kei acoust kei statu inform chapter feedback implement suggest acoust navig provid step rang user defin shortcut fast forward function tangibl inform size load document approxim read compar chapter test user difficulti handl inform document miss toler select object object toolbar user profil speech interfac user store lot paramet activ voic lot subject miss option store user profil combin paramet paragraph recogn function number link extend read process immedi link order distinguish easili suggest improv consid redesign process improv user interfac improv user interfac adapt accomplish order achiev import improv suppli suffici interfac common assist technolog list improv user interfac implement common microsoft internet explor netscap navig improv appli altern format inform present descript field png graphic blind user textual descript fade detect screen reader document exampl tabl content text sequenti bigger font make process user navig arrow kei tabl chapter present textual inform tabl axi order distinguish current row column posit inform facilit orient tabl blind end user navig frame object combin feedback frame user requir program control keyboard import blind user provid exact inform current statu system element error accomplish process present altern descript java applet blind user altern text descript consist alt attribut multimedia element includ applet extens html html lot improv peopl special html design work group web access initi html css review work group gmd member particip launch occas confer santa ca april function function provid inform current posit user document document cursor list element ten element list function facilit orient document blind user page summari web document page summari function enabl blind user achiev quicker overview structur page summari navig keyboard featur enabl user user blind peopl navig quicker determin special keyboard command order tab link select step rang blind end user select tab link sequenti structur sequenti shorten defin link step rang visual acoust feedback user interact occur event speech output interfac addit feedback occur event provid acoust signal artifici sound real sound paper blind end user specif button size button color visual impair end user select button color individu physic impair end user button size order hit button easi present visual impair end high contrast mode san background normal text visit link link zoom modu recognit word letter type physic impair end user perform keyboard input slowli case reduct input length netscap internet explor provid featur text field select link type letter link label select icon input letter link label highlight letter press link label link label letter final select link perform kei reduct input length physic impair end user integr scan mode select object object group highlight user time long object remain highlight highlight object select press kei enabl physic impair user object kei search word highlight found word detect screen reader word belong label link select kei enabl blind user straight forward interact work introduc prototyp special adapt miss implement sophist advanc speech output evalu show adapt peopl special adapt improv enhanc improv scan function chapter continu present project research project plan gmd aim implement mention improv api program common order proactiv move extend standard valuabl benefit user special enabl access rapidli evolv applic social grow number applic offer internet manag everydai life rise number elderli disabl peopl assur access medium appar futur scenario suppli ubiquit interfac enabl blind person access individu tailor system railwai station person user interfac place effort suppli access suffici order achiev import advoc design access web page mention chapter appli automat import guidelin altern descript multimedia element autom integr web author tool wai access refer takashi interfac home page ibm asset intern acm confer assist april marina del acm acm adapt technolog research jan write access adapt technolog research mike web access blind visual internetwork html paul center inform technolog gener servic dc access html center access technolog user interact design guidelin version compar audio html sixth intern world wide web confer april santa clara convent isbn henrik michael disabl peopl pitfal ongo alistair dn wolfgang page isbn jon wide web browser access jon dirk michael disabl usabl evalu interfac adapt internet base cooper michael genesereth anna patterson sixth intern world wide web santa isbn dirk design master august sarah helen peter navig design evalu hypermedia system blind asset intern acm confer assist april marina del acm acm academ press isbn distinguish design user octob comput der und walter de isbn product develop dual user interfac integr blind sight homer acm confer human factor comput system pp scan techniqu access user window object hci intern san august pp inform www tip guidelin access peopl support interfac ercim workshop user interfac novemb guidelin comput isbn chri access world wide anytim access gener intern world wide web confer april santa clara convent isbn research wendi research ian jacob access page work access blind institut eth wai access work web page lynx
IR/1086 5 submit aaai spring symposium mine answer text knowledg text mine inform extract yong raymond moonei depart comput tx abstract text mine concern pattern unstructur text relat task inform extract locat speci item document paper present framework text call text learn inform extract system transform text structur data mine interest relationship initi version integr modul acquir learn standard rule induct modul approach problem extract entiti featur repres similar ident string di erent document develop altern rule induct system call partial match textual item encourag preliminari result present appli techniqu corpu internet document introduct problem text discov knowledg unstructur attract attent grobelnik paper suggest framework text mine base integr inform extract knowledg discoveri aka data mine inform extract locat speci piec data corpu text kdd consid applic statist method discov relationship larg relat tradit data mine assum inform form relat electron inform form unstructur document structur address problem transform corpu textual document structur construct modul provid kdd modul mine knowledg copyright american associ arti cial intellig reserv construct system dicult signi recent progress machin learn method autom construct system kushmerick manual annot small number document inform fairli accur system induc label corpu appli larg corpu text construct accuraci current system limit automat extract inevit signi number error import question knowledg discov signi cantli reliabl knowledg discov cleaner paper present experi show rule discov automat extract close accuraci discov manual construct standard data mine methodolog integr compon initi implement framework text string tradit nonstandard variat heterogen textual problem appli exist data mine techniqu similar object refer di erent textual string learn rule text modi cation rise algorithm hybrid learn method good match text mine rule induct interpret soft match base similar metric remaind paper organ present background inform text data mine inform extract describ system call text combin tradit kdd technolog discov predict rule text present partial match text mine final discuss relat outlin futur research present submit aaai spring symposium mine answer text knowledg background text mine text mine de ned process nding interest rule unstructur techniqu text mine includ conceptu associ rule episod rule rule induct method inform retriev techniqu wide task document form soft match util inform typic superior result text process problem cohen yang inform extract framework consid inform extract kei compon text mine goal inform extract system speci data text darpa messag understand confer concentr evalu perform particip system base blind test set text document data extract typic templat speci es list slot lled substr document figur show pair document templat inform extract task resum domain templat includ slot lled string directli document slot multipl ller domain area varieti seminar job post rental ad suggest machin learn techniqu extract inform text document order creat easili searchabl make onlin text easili access inform extract job post usenet newsgroup build searchabl job concern aspect transform unstructur text structur inform extract system built hand automat construct complex system began consid research recent cation research inform extract impli possibl compon larger system document window nt softwar engin seek perman posit small quiet town mile york citi nineteen year experi aspect develop applic recent focu design implement system involv past implement window nt servic visual design implement multithread applic java work window program year fill templat window nt softwar engin york citi visual java window year nineteen year figur sampl messag lled templat resum post integr data mine inform extract discuss detail text mine framework task construct inform extract system usenet newsgroup post inform extract framework text plai import role preprocess corpu text document order pass extract item data mine modul inform extract rapier autom product inform extract wrapper kushmerick train corpu document annot lled acquir knowledg base extract rule test document rule induct construct system extract desir set slot construct corpu text appli extract pattern document creat collect structur record standard kdd techniqu appli result discov interest relationship speci induc rule predict piec inform eld inform record submit aaai spring symposium mine answer text knowledg html languag languag xml languag illustr applic flash applic applic web design area applic ms excel applic ms access applic odbc applic languag perl languag html languag linux platform figur sampl rule post order discov predict treat pair extract distinct binari graphic learn rule predict featur featur similar slot ller rst standard term appli ripper induc predict rule result binari data ripper run signi cantli faster abil handl featur avoid step explicitli translat slot ller larg number binari featur standard associ rule mine algorithm appli discov interest associ item sampl rule mine extract usenet newsgroup shown figur rst rule induc ripper apriori srikant wellknown associ rule mine algorithm result discov knowledg inform accur import measur accuraci discov knowledg independ test data primari question address experi section knowledg discov automat extract data reliabl compar knowledg discov manual construct methodolog order test accuraci discov predict inform disjoint exampl test predict present absent inform averag perform featur test exampl comput job post newsgroup collect manual annot correct extract templat cross valid gener train test set rapier place part ripper kdd part rule induc predict ller area lled multipl ller obviou potenti relationship valu classi cation accuraci predict absenc presenc slot ller inform perform metric high accuraci achiev simpli assum slot ller absent set potenti slot ller larg xed small fraction ller present evalu perform perform metric regard predict slot ller metric de ned resent recal alu harmon recal comput weight measur result construct ltere irrelev document newsgroup text categor rapier train label point accuraci extract inform extract extract recal train rapier small corpu order demonstr label small number document result good set extract rule capabl build accur knowledg discov di erent train phase question train set train illustr di erenc mine show comparison disjoint train set train data thrown train rapier crossvalid perform remain exampl evalu data mine part set train exampl provid kdd di erenc train data automat extract rapier train disjoint set submit aaai spring symposium mine answer text knowledg number train exampl recal recal figur data data rule accuraci exampl figur show learn curv system random guess strategi random guess predict base frequenc occurr train benchmark obtain bound perform measur small amount result achiev perform fairli compar train manual construct recal curv figur rst train quickli improv addit exampl result present emploi label exampl train system examin ect number train exampl obtain accur extract modul found train set data mine automat label modul larg achiev fairli good perform small amount ort devot label train exampl moonei mine rule text import task text mine discoveri rule relat speci word phrase exist method task learn tradit logic method util inform gener work textual data section present rule induct partial match featur combin learn present initi result appli corpu book descript scienti paper retriev web mention manual similar ller extract data canon form typic ller extract platform slot usenet post domain map uniqu term dictionari rule mine step treat attribut requir creat canon ller match develop algorithm partial match ller discoveri process rise algorithm rise induct set algorithm integr learn rule induct unlik combin model rise uni ed singl algorithm behav classi er rule induct system requir rule match order make rise make predict select closest match rule standard distanc metric typic method flexibl match rule acquir speci induct algorithm start maxim speci rule repeatedli minim gener rule cover nearest result perform rule base perform rule base measur conduct test train data rule make predict algorithm rise directli applic mine rule extract text similar metric learn rule classi cation text predict address issu repres document list bag word bag slot ller elimin perform stem figur show shorten research paper descript bow standard extend bag obviou learn rule repres conjunct bow subset slot predict bow slot figur whirl standard cosin measur vector similar metric similar ller calcul vector space model text document submit aaai spring symposium mine answer text knowledg research paper raymond moonei integr abduct induct machin learn articl discuss integr tradit abduct induct reason method induct learn abduct diagnosi abduct induct learn author titl abstract bibliographi figur research paper es train set rs rule set function rs es comput repeat rule pick es maxim cover replac replac obtain return rs figur algorithm vector real compon correspond word compon frequenc document similar document cosin angl vector repres algorithm extend algorithm classi cation text de ne measur accuraci rule set averag cosin similar predict ller exampl es ller predict rule set rs algorithm learn rule figur algorithm straightforward modi cation rise similar metric rule induc predict ller slot valu slot bag intersect comput minim gener bow minim gener exampl rule minim gener bow slot rule cover titl review subject author subject titl titl subject review titl comment figur sampl rule book descript exampl bow nding nearest comput similar exampl rule minim distanc rule implement make bow librari text process rule sampl rule learn book descript figur slot book subject publish custom comment number word denot number occurr bag research paper data gather cora paper search engin al emploi bibliographi data set figur show sampl rule learn domain note rule predict bibliograph item word bibliographi section rule gener rst map cite paper uniqu token appli algorithm consequ bow find relationship rule shown predict slot learn algorithm restrict xed form rule predict slot book titl impli life biologi mine fundament modi cation algorithm slightli chang rule learn rule involv relationship modifi exampl rule speci de nition rule ed elimin consequ part slot predict slot submit aaai spring symposium mine answer text knowledg abstract bibliographi domain author author abstract engin titl abstract bibliographi gener learn applic figur sampl rule cs research paper titl subject titl review subject ction figur sampl rule children book descript slot predict slot origin version rule cover slot gener exampl slot rule produc algorithm relationship term implicitli rule frequent occur subject version work cluster algorithm result rule gener rule close rule produc algorithm view centroid cluster consist exampl closer rule rule sampl rule produc version present figur clear version work cluster algorithm appli collect book descript document genr rule learn book put constraint subject subject slot ller view label subject physic astronomi scienc natur qualiti titl physicist scienc subject scienc figur sampl rule descript cluster collect semant rule potenti chang gener algorithm semant hierarchi wordnet term gener hypernym hierarchi wordnet rule subject wave subject wave minim gener rule subject wave semant lexicon provid wordnet util common hypernym tree current implement gener empti ller slot subject slot case recogn semant relationship slot ller chang requir rede nition distanc word term wordnet implement simpler version semant expand semant parent wordnet initi bow augment semant parent word bow word disambigu problem account consid primari mean word figur show rule gener appli version domain rst rule shown figur word origin document expand word rule gener child node result evalu perform compar standard predict strategi detail descript experi found moonei methodolog book descript domain emploi evalu manual develop simpl system automat extract label eld origin html submit aaai spring symposium mine answer text knowledg number train exampl nn figur averag similar book data document text extract slot process remov remain html command book data set scienc literari children book titl randomli select genr unlik standard rule learner predict presenc absenc speci slot predict slot evalu perform measur averag cosin similar predict slot valu actual ller slot compar system standard method predict made select closest text slot test inform extract show bene text mine experi perform book descript cross valid result learn curv predict titl slot shown figur graph show con denc interv point result statist evalu pair result worst show successfulli summar input data form predict rule conduct experi found similar result predict author slot relat research relev system approach kdt discoveri textual dagan fact hirsh system allud text text manual tag limit number xed categori label autom text categor recent extens kdt web mine suggest discov conceptu knowledg web document autom text categor de oliveira limit approach requir substanti amount domain knowledg ghani al appli rule induct method corpor automat extract web rule induct system induc rule rule match extract text futur research main drawback term perspect quadrat time complex rule discoveri strictli base rise requir time number number attribut plan address ecienc issu modifi algorithm speed search randomli pick rule introduc sampl techniqu good metric evalu rule idea hierarch network measur semant distanc word prefer rule distanc larger algorithm wordnet al wordnet gener huge hierarchi speci domain smaller taxonomi nding interest rule rank rule beer food product closer product hierarchi altern metric measur textual similar explor short extract string edit distanc measur textual similar cosin measur show system develop rapidli evalu easili exist corpora util exist inform extract data mine technolog present approach automat learn system extract structur text mine tradit kdd tool preliminari result demonstr knowledg discov automat extract close accuraci knowledg discov manual construct due variabl form soft match base textual similar discov submit aaai spring symposium mine answer text knowledg rule text present hybrid system learn method discov rule textual automat construct inform extract empir show approach induc accur predict rule heterogen automat extract textual acknowledg research support nation scienc foundat grant refer fast algorithm mine associ rule intern confer larg modern inform retriev acm press evalu novelti rule lexic knowledg seventh acm sigkdd intern confer knowledg discoveri data relat learn techniqu natur languag inform extract phd depart comput tx arti cial intellig laboratori technic report ai ed paper sixteenth nation confer arti cial intellig workshop machin learn inform extract aaai press fast ectiv rule induct twelfth intern confer machin learn provid access web queri base textual similar acm sigmod intern confer manag data ed seventh messag understand evalu confer morgan kaufmann unifi induct machin learn knowledg discoveri textual intern confer knowledg discoveri data mine mine associ text presenc background knowledg intern confer knowledg discoveri data mine ed sixteenth intern joint confer arti cial intellig workshop text techniqu applic electron lexic mit press boost wrapper induct seventeenth nation confer arti cial intellig data mine symbol knowledg extract web sixth intern confer knowledg discoveri data mine workshop text ed ieee intern confer data mine workshop text mine publish ed seventeenth intern joint confer arti cial intellig workshop adapt text extract mine aaai press de knowledg discoveri text extract web sigkdd explor autom construct internet portal machin learn inform retriev toolkit statist languag text classi cation cluster ed sixth intern confer knowledg discoveri data mine workshop text mine inform extract aid discoveri predict rule text sixth intern confer knowledg discoveri data mine workshop text mine rule textual data seventeenth intern joint confer arti cial intellig program machin learn san morgan kaufmann automat text analysi retriev inform comput evalu statist approach text categor journal inform retriev
DB/1087 3 support queri relat manag system chun jeffrei david luo depart comput scienc madison abstract virtual queri xml includ class queri term clear substanti amount xml data store relat system question support queri invert list technolog underli inform retriev implement technolog separ ir nativ tabl queri execut machineri option twenti year work rdbm queri queri concurr control recoveri immedi extend queri structur implement oper irrelev perform option lag explor perform implic option nativ implement commerci relat system special invert list engin perform studi show rdbmss gener poorli suit condit outperform invert list engin analysi identifi differenti perform ir rdbm join algorithm emploi hardwar cach util result suggest contrari nativ implement rdbm support class queri effici introduct virtual queri languag xml lorel xql quilt gener sgml queri languag queri plai promin role queri base proxim relationship content permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee sigmod santa california usa copyright acm gui lohman ibm almaden research center san california great deal work support queri languag special queri engin clear futur great deal xml data store relat system evid notic major dbm vendor includ oracl invest substanti resourc improv system support xml queri import aspect queri xml rdbmss support storag queri xml question support queri invert list technolog underli inform retriev implement technolog ir nativ tabl queri machineri commerci product oracl text text extend option special ir engin coupl engin user emploi oper oracl form text system rout part queri ir engin queri result engin combin return user type modul ir engin main engin handl concurr control recoveri optim choic engin execut part engin dictat special predic queri frame option directli util storag process power process queri twenti year work queri queri concurr control recoveri immedi extend queri structur implement oper approach advantag unifi optim execut framework queri irrelev perform nativ implement lag implement paper step explor option compar implement queri nativ support commerci relat system special invert list engin transform invert index relat tabl convert queri sql queri turn nativ implement rdbm process queri difficult imposs process invert list engin perform studi show rdbmss gener poorli suit condit outperform invert list engin experi point differenti perform ir rdbm join algorithm hardwar cach util achiev invert list engin merg join term merg join join oper algorithm standard merg join index join differ impact perform isol algorithm differ implement standard merg join index join compar join algorithm great detail result show standard rdbm join algorithm order magnitud queri main memori size larger memori hierarchi research recogn import hardwar cach util perform conduct experi differ invert list engin rdbm answer paper studi compar merg join multipl predic standard join algorithm show impact hardwar cach util rest paper organ section describ process invert translat invert index relat queri sql queri section detail perform studi analysi compar type invert list engin rdbm section discuss relat section conclud queri process queri class queri base relationship content class subsum path express regular path inform retriev boolean proxim queri section exampl illustr queri establish show invert index relat system process basic queri complex queri reduc sequenc basic basic queri shed light fundament determin focu simpl queri queri descript path express found lorel quilt quilt path express base abbrevi syntax xpath quilt xml queri languag satisfi xml queri requir xpath recommend novemb quilt style path express wide adopt syntax describ queri select titl section document author lead root element predic restrict element content symbol repres indic direct indic indirect ir boolean proxim select document author includ document word distanc word lorel defin class regular path wildcard repetit express select titl titl section subsect chapter note express differ select titl section includ titl caption figur note lead insid document heart queri simpl element word queri process invert index invert index popular inform retriev system support rank queri effici classic invert index data structur map text word document word posit document order process structur document invert index extend simpl text word index similar tradit ir element index map element invert list figur illustr structur index sampl xml file invert list record occurr word refer occurr index document posit nest depth document denot figur begin element text word begin end document gener count word number document tree posit gener tree sequenti assign number visit node visit children number leaf node number invert list sort order order begin end xml document strictli sort inform retriev rdbm simpl translat extens ir featur inform retriev fragment fragment figur sampl xml invert list term occurr index properti occurr term encod occurr term encod nest direct properti occurr term direct nest direct tight properti occurr term tight nest tight nest structur tight impli direct vice versa proxim properti occurr term distanc term distanc exact definit proxim element attribut depend applic support properti varieti oper invert list process express invert list retriev occurr list merg satisfi properti express similarli process merg invert list direct properti proxim properti process string queri distanc final tight properti process express framework invert list process queri construct oper basic build implement prototyp system central framework merg invert list view invert list order merg invert list effect join order suffic properti merg essenti join predic type join effici paramount import section compar perform type join invert list engin commerci rdbmss queri process rdbm introduc relat schema store invert index map queri sql illustr addit type queri process result util power extens rdbm schema process queri rdbm map element text element tabl store occurr xml text tabl store occurr text word occurr store tabl row figur show translat invert list merg oper sql merg invert list translat properti appli merg translat join predic show element text word involv join element tabl text tabl element involv element tabl leverag power rdbm implement queri process queri difficult imposs process invert list engin show exampl type join search join queri bind multipl path express common variabl queri express languag difficult imposs express involv search term search condit difficult express sql bib entri cite queri impli path addit requir select element text select element text select element text distanc select text text figur translat basic sql element content element sql express queri found full version paper type queri mix data store invert index index access relat data make conveni invert index augment search relat data vice versa kind queri call web invert index dblp xml graduat tabl hold data graduat student find student dblp entri sql queri queri straightforward dblp file index separ system graduat tabl natur build addit modul top system pull graduat row dblp invert index entri join modul concern construct modul join algorithm implement duplic featur present rdbm process modul costli larg number graduat row invert index entri satisfi queri effici tightli integr optim potenti push select order avoid gener larg number intermedi cross boundari multipl save messag copi overhead perform analysi turn perform studi compar implement queri invert list engin relat system goal studi explor perform seek reason provid insight strength weak rdbm queri set methodolog hardwar softwar platform find commerci system support queri xml built invert list engin written librari store invert list berkelei db toolkit access method extend linear fix queue invert list store record experi commerci interest report result result similar confirm observ specif system experi numer combin set rdbmss result report obtain default buffer pool size set hash join enabl experi set alter experi rdbm index combin column index kei interest report repres cluster index cluster index column tabl call index cover index index kei cover note term overload paper ir invert index rdbm make term qualif refer rdbm index invert list engin run mhz machin run linux redhat run mhz machin run microsoft main memori size machin mb dataset queri xml dataset studi set shakespear plai set dblp bibliographi file set synthet xml document synthet data gener produc random element tree tree templat number occurr element text content vari gener document synthet data number occurr text word distribut constant number occurr element distribut constant statist dataset list tabl tabl show raw size size invert list store relat tabl size includ show distinct total number element text word note total number element text origin archiv consist small file averag byte combin file bigger obtain dataset averag kb document shakespear dblp synthet text size mb mb mb invert index size mb mb mb relat tabl size mb mb mb distinct element distinct text word total element total text word tabl dataset number number result row tabl number occurr term number result row word cardin element tabl text simpl queri perform queri studi core perform issu complex methodolog simpl queri full workload advantag experi complex discuss found full version paper report result thirteen simpl queri form xml element text word note discuss paper appli case term element element process ident element text word xml element strictli element element check begin posit nest term queri code queri number respect dataset term queri larg number select queri cover combin determin sensit perform select term tabl show number term occurr number result queri sql version queri shown figur note queri requir merg list invert list join element queri inv list index cover index tabl raw time figur list perform ratio tabl text tabl rdbmss requir merg invert list mb join row row rdbmss result compar invert list engin tabl show raw time thirteen queri invert list engin hot run figur show perform ratio show outperform invert list engin perform invert list engin perform cover index index point easi cover index suffici answer index row fetch tabl index scan cover index perform compar invert list engin rdbm perform rdbm perform index row retriev row term index figur index join avoid retriev row term nest loop join index scan index scan sort merg join index scan index scan index index index index figur queri plan index join queri plan merg join rdbm perform recal invert list list store index easi extract portion entir list small portion list turn join entri list examin rdbm index built row term select save cpu time queri perform common term queri highli term select rdbm optim discern index join element tabl text put tabl select term tabl select term result row satisfi join predic retriev join outer row figur illustr figur show queri plan import point note save cpu larg overhead incur rdbm chose index join invert list engin queri expect case rdbm invert list engin figur percentag cpu cost rare predic combin multipl queri highli case join tabl effici rdbm perform concret shown rdbm perform consid long list answer cost bind result engin applic actual process optim produc good rdbm cpu cost due code interpret overhead buffer pool briefli examin possibl main find cost plai reject domin cost appar small fraction total execut time note queri return result row queri msec return row assum time due result bind row msec return row percent total execut time figur show plan cover index standard join found pick match intuit constitut good plan figur show percentag cpu cost thirteen queri report perform monitor queri fulli oper buffer pool overhead queri domin perform procedur merg begin set begin set begin end end mark end end mark mark merg valu end mark endif endwhil endif endwhil end figur invert list merg algorithm begin answer question perform deeper analysi algorithm invert list engin dbmss join method invert list engin standard merg join figur present basic algorithm merg invert list engin actual implement slightli optim version fact merg join standard merg join implement commerci system recal sql version benchmark queri multipl join standard merg join algorithm equal join predic merg set inequ predic appli pair row match valu view join process logic step equal predic produc pair row valu match inequ predic appli match row merg join algorithm invert list engin join column guid merg avoid row comparison standard merg join call merg join merg figur illustr join list line connect row attempt join comparison fewer comparison standard merg join standard merg join choic rdbm algorithm process hash join index join hash join inequ predic inequ predic appli pair row match standard merg join hash join disadvantag index join standard index join queri plan index join cover index shown figur join predic push figur illustr join oper outer valu term seek index start root reach record start kei bottom index index scan conduct index record stop kei reach record scan attempt join outer row seek scan repeat outer row refer point index scan start stop rdbm kei kei find point start stop kei predic outer tabl tabl start kei predic term stop kei predic term outer tabl tabl start kei predic term end stop kei predic term begin start stop rdbm select retriev examin row join outer row figur illustr line row attempt join comparison standard index join fewer comparison perform true order select examin index comparison index record call process index retriev row index process join outer row index scan call number comparison index seek index seek number comparison index scan index invert list predic implement condit predic predic appli comparison determin stop doc begin end outer tupl doc doc begin end doc doc begin end doc standard merg join standard index join index seek start kei index scan index scan length figur stop kei index seek length outer tupl record seek record seek length record scan figur oper merg form join scan length index seek simpl calcul assum index level index page hold binari search find pointer follow level index page index seek length worst case log averag case mean outer row pai comparison row join addit comparison costli due poor hardwar cach util review memori hierarchi modern comput system data instruct higher memori hierarchi access faster lower hierarchi level cach access miss cost cycl costli level cach penalti higher cach consist multipl cach hold multipl instruct data datum miss fetch lower memori data resid cach line brought subsequ data brought fill cach line access nearbi subsequ data result hit fast benefit exist data access sequenti access pattern detect processor random access result cach miss sequenti access binari search effici reduc number comparison index access contigu record index record comparison incur cach miss height index merg join essenti form seek directli data record join perform outer seek row record scan conduct row scan attempt join outer record scan end seek start start begin record scan merg join row outer row sort figur illustr oper join record seek analog index record scan analog index scan queri record scan outer row requir seek cost number comparison index record seek cost index seek cost merg join cach util outer row retriev examin sequenti straight sequenti row loop multipl time loop possibl cach hit disadvantag record seek record seek comparison altern index seek comparison join algorithm perform impact join implement standard merg join index join compar section standard merg join implement appli inequ join predic pair standard merg ratio ratio figur ratio standard join queri standard merg join tabl number row pair compar standard merg join row valu match emul standard index convert invert list relat row schema present section store make cover index index join implement simul optim tabl shorter list outer start stop kei predic run time algorithm includ cost extract individu column valu cost gener print cost includ assum data cach buffer pool reason assumpt shown queri cost minim figur show perform ratio standard join algorithm note result confirm perform standard merg index join queri index join perform queri index join queri perform invert list engin figur understand perform number comparison avg index scan length avg index seek length avg record seek length figur seek length scan averag outer standard merg tabl show number row pair compar merg algorithm figur compar seek scan queri outer row requir seek scan queri obtain averag outer row figur show long seek perform short scan queri record seek length shorter index seek length queri index join wide margin rest record seek length longer index seek differ dramat index join rest queri record seek length longer index seek perform sequenti scan demonstr sequenti scan random amount extra work exce point hardwar cach util main memori size larger memori hierarchi research recogn effect good hardwar cach util perform conduct experi exist differ invert list engin rdbm queri show result section set experi conduct machin mhz intel processor run linux kernel machin kb level instruct cach kb level data cach kb level unifi cach data instruct access level cach measur separ processor support prefetch instruct execut impli fetch overlap detail descript hardwar paramet found measur number cach access miss hardwar counter interest discuss hardwar cach util queri figur show number access miss inv list engin inv list engin figur queri inv list engin inv list engin figur queri inv list engin inv list engin figur queri thousand number cach access significantli larger cach access cach access cach miss notic data number miss number instruct number miss number access reveal instruct prefetch data prefetch examin queri turn queri index perform invert list engin invert list engin time fewer access cach time fewer access cach compar invert list engin time fewer miss time fewer miss cach achiev data cach miss queri index join queri invert list engin clear figur win access cach miss except instruct figur record seek length dramat larger index seek length queri mean invert list engin seek larg number row find join outer row index find row work queri standard merg join join algorithm happen number comparison queri implement algorithm perform invert list engin perform order magnitud faster figur insight differ time access cach cach time miss cach time miss cach time miss queri data cach miss instruct cach miss ratio potenti optim critic execut path algorithm amount cach util system cach distinct factor affect perform relat work substanti amount work integr inform text system exampl integr text search includ commerci exampl includ text extend oracl text integr text search lore simplifi version text index locat string specif text word group text word previou work explor perform implic special nativ implement function rdbm advent sgml trigger research integr content structur text work queri found work queri differ previou work target xml sgml data xml element strictli concern overlap reduct function overlap extent work focu develop implement algorithm rdbm work consid rdbm store retriev xml includ paper focu techniqu convert xml document relat complementari perform implement option class queri xml data describ relat system inform retriev work differ relat schema retriev invert index multipl encod occurr term store relat storag compact flip side applic program bit tabl oper post retriev power flexibl rdbm fulli ir queri process integr structur text compar rdbm ir approach florescu al schema store invert post distinct xml element text word store tabl line tabl tabl implement option discuss appli equal needless model tabl requir store invert index compar implement rdbm ir altern dust settl debat xml queri languag role rdbmss eventu plai xml queri thing clear queri import part xml queri workload great deal xml data store relat system commerci world approach ir index system relat domin argu compel reason tightli coupl queri involv support nativ rdbm data queri queri processor tightli coupl approach viabl perform satisfactori experi show current commerci rdbm gener nativ rdbm implement queri support substanti slower special ir engin sought quantifi perform gain insight situat remedi singl factor account entir perform differ type modifi rdbm perform match invert list engin discov import contribut factor perform join algorithm invert list call merg join hardwar cach util achiev join gener algorithm order magnitud faster standard rdbm join algorithm addit join algorithm critic part success effort make rdbm competit special ir engin xml queri experi rdbm lower cach util ir system research main memori cach awar system produc gener rdbmss cach util prematur make concret optimist combin join algorithm cach rdbm nativ support queri effici acknowledg author measur hardwar cach util fund work provid darpa contract refer wiener lorel queri languag semistructur data intern journal digit april dbmss modern time intern confer larg data page septemb ricardo navarro integr content structur text retriev sigmod march manag harmon sql sgml intern confer applic page june don peter jonathan robi xml queri requir work august don jonathan daniela florescu xml queri languag heterogen data sourc lectur note comput algebra structur text search framework implement comput retriev heterogen structur text fourth annual symposium document analysi inform page invert text index xerox palo alto research center technic report xerox robin cover xml cover page januari juli jun rao kenneth ross make ron jame cach consciou main memori sigmod index structur text queri page relationship australasian ron timothi justin zobel system structur document stefan nelson integr sql intern symposium search engin advanc technolog integr vldb page octob mari daniela sahuguet alon dan suciu queri languag xml eighth intern world wide salton mj mcgill introduct modern web inform retriev daniela florescu donald store queri xml data rdbm ieee data design specif technic engin daniela donald ioana manolescu integr keyword search xml queri chun david jeffrei naughton process relat queri xml limit opportun intern organ standard vldb septemb inform offic markup languag michael bruce berthold effici publish gmd xql engin relat data xml document vldb august septemb cach roi goldman jennif widom consciou algorithm relat queri process practic approach combin queri vldb web sigmod softwar berkelei page ibm text extend elf data model queri juli languag structur document inria project australasian page intel intel architectur softwar tak yan jurgen integr volum basic retriev system xml path languag system vldb version recommend septemb novemb chun jeffrei david gui lohman support index semistructur data queri relat manag system stanford technic januari full version manag system semistructur data sigmod xml queri languag washington data integr system wisconsin niagara system oracl text zipf human behavior principl effort read steve relat
IR/1088 5 ieee transact neural subspac inform criterion regular model select muller gmd germani comput biologi research japan tokyo institut japan germani abstract norm regular yield solut gener work gener subspac inform criterion predict gener error famili regular show technic assumpt asymptot estim gener error demonstr good perform experi norm regular compar network inform criterion larg sampl case small sampl fail captur optim model due larg varianc version achiev reliabl model select relev challeng scenario high data sampl subspac inform criterion regular introduct learn techniqu estim underli unknown statist relat train data process care overfit train estim underli statist data gener learn machin gener good estim unseen data avoid overfit restrict function class estim chosen introduc prefer complic model simpler model model small vc dimens introduc regular intuit amount select smoother model paper regular enhanc gener capabl paramet learn machin determin weight sum train error regular term call regular constant regular constant estim estim smooth gener error larg select overfit high frequenc estim result problem model case determin regular constant essenti good gener perform larg bodi literatur regular constant neural network ideal criterion gener error approxim worst averag case set consid worst gener error achiev train set method base vc theori consid ensembl averag train network inform criterion subspac inform criterion success criteria cross valid bayesian evid framework approxim evalu ensembl error train data focu predict method ensembl averag gener error predict gener error easier addit unlabel input data point gener inform criterion typic method make distribut unlabel addit data point assum data essenti distribut train sampl text classif addit unlabel sampl accur estim input distribut train data sic gener cl make addit unlabel data shown perform small sampl set technic featur sic predict gener error util refer estim true paramet sic subspac inform criterion regular applic linear regress quadrat includ weight decai sparsiti induc regular popular good gener properti solut model paramet found train process base regular regular term origin sic criterion appli work gener subspac inform criterion predict gener error famili regular interest theoret assumpt show asymptot estim gener error experi larg achiev good perform compar small sampl fail captur optim model due larg varianc allevi introduc version deriv refer estim regular quadrat regular version introduc model select determin regular constant refer estim quadrat regular regular constant determin algorithm experi norm show excel compar rest paper organ sec formul problem gener error predict detail sec gener sic regular asymptot bia investig sec introduc version small sampl case sec consid applic experi sec give comparison method cross valid sec conclud remark preliminari linear regress target function approxim parametr model linear paramet assum target function parametr model principl select paramet featur select techniqu scheme complex algorithm structur harder analyz regular simpl subspac inform criterion regular basi function paramet vector describ true paramet train exampl consist input point output degrad addit assum random variabl independ subject symmetr distribut varianc focu case paramet determin find minim weight sum squar error regular term call regular constant defin solut optim argmin gener error denot distribut input assum solut uniqu solut consid implicit function train exampl model optim determin gener error minim depend random variabl gener error random variabl order compar random focu gener error jg assum true paramet strong regress common start larg number basi function subsequ reduc number minim induc error function subspac inform criterion regular call ensembl abbrevi sake geometr defin product paramet space matrix element ij rewrit ensembl averag gener error norm paramet space jg matrix calcul input distribut unlabel sampl assum uniform distribut domain gener error predict deriv gener error predict method call gener subspac inform criterion basic idea fig illustr idea respect train paramet valu form gener error jg averag distanc underli true solut inform introduc paramet estim typic choic squar estim distanc broken line fig rough estim gener error deriv estim gener error ad modif term distanc note techniqu estim introduc sic norm vanish nonzero li null space theoret discuss hold null space notic squar estim subspac inform criterion regular figur basic idea evalu gener error gener subspac inform criterion deriv estim jg jg bia varianc bia term express term directli averag term term yield term vanish approxim yield estim jg call gener subspac inform criterion subspac inform criterion regular definit subspac inform function defin gener subspac inform note includ sic special case quadrat regular calcul estim varianc term requir show calcul term linear regress quadrat regular result origin sic matrix element call design matrix estim term calcul term calcul denot sum diagon element defin matric defin final yield origin sic quadrat regular sic estim jg varianc estim estim replac properti conserv subspac inform criterion regular regular concern obtain analyt obtain optim method evalu term approxim assumpt hessian lr loss function invert approxim matrix element deriv approxim appendix definit function call gener subspac inform criterion regular term origin sic replac sic regard relationship gener error jg theorem theorem assum repres order polynomi moment order regular asymptot estim jg jg proof theorem provid appendix ii order discuss theoret properti mathemat obtain version theorem assumpt finit order polynomi scope explor practic perform subspac inform criterion regular practic common basi function train exampl gaussian function center input point solut larg make varianc larg model select unstabl reduc replac obtain weight decai regular ident matrix distribut illustr fig small bia true paramet varianc smaller observ regular slightli varianc drastic reduc regular constant determin adjust accur estim error expect improv expect support simul easier determin weight decai regular determin weight decai error comput denot ident matrix sophist method cl result weight decai regular paramet good estim varianc obtain note slightli bia varianc call techniqu appli regress norm regular lead paramet practic detail review weight decai regular subspac inform criterion regular distribut distribut figur illustr distribut varianc smaller longer coincid true paramet gain shrink varianc expect exce bia automat select basi function solut save comput cost loss function minim respect convex quadrat program element nonneg minim respect obtain find minim constraint briefli explain solv problem lead optim solut optim reduc violat constraint implicit constraint subspac inform criterion regular figur learn target function train exampl problem obtain substitut equal constraint appli directli order appli approxim regular term continu function slope diagon matrix element ii comput calcul investig gener error approxim interest topic approxim minim gener scope contribut experi perform experi notic experi demonstr work gener error predict subspac inform criterion regular illustr regress function exp templat sampl equal space obtain true paramet squar estim sin input point chosen randomli uniform distribut output valu obtain independ subject normal distribut standard deviat target function train exampl displai fig regular constant select cross valid addit unlabel sampl uniform distribut distribut addit input point estim empir distribut unlabel true gener error measur error dx perform measur gener error select experi consist trial criteria work cv work tend give larg gener error order investig error actual valu displai fig note valu figur term irrelev model select essenti contribut varianc estim shape curv close true explain model select carri successfulli subspac inform criterion regular opt cv opt cv opt cv opt cv opt cv opt cv figur gener error select respect model select criterion shown standard box plot box plot notat specifi mark percentil valu denot gener error optim subspac inform criterion regular error cv log error cv log figur valu criterion trial shown standard box plot horizont axi denot log solid line denot valu subspac inform criterion regular cv log log figur gener error select chang horizont axi denot log result cross valid shown comparison gener error chang cv accur curv curv longer accur graph show inaccuraci curv characterist curv tilt show smaller regular constant figur essenti lost small sampl huge varianc domin shape averag curv varianc larg regular constant small explain failur bia plai main role varianc primal import order reduc varianc version top graph fig show gener error select function weight decai paramet bottom graph fig displai true gener error chang graph show minimum curv approxim mean determin true gener error perform expect approxim true gener error determin sec note varianc estim subspac inform criterion regular comput time cv figur comput time horizont axi denot number train exampl vertic axi denot comput time plot show comput time includ model select procedur plot cv show comput time perform cross valid procedur repeat solv quadrat program problem fig show work method work perform compar cv fig show shape curv shadow true curv nice note term irrelev model select similar reason varianc curv reduc compar shape coincid true curv impli introduct regular paramet obtain refer estim drastic reduc varianc irrelev bia work small sampl comput time cv plot fig plot show comput time includ model select procedur plot cv show comput time perform cross valid procedur repeat solv convex quadrat program problem experi faster advantag larger illustr experi show perform unstabl small sampl case heurist work compar cv case studi cv comput error weight decai subspac inform criterion regular experi data inspect perform studi number data set provid delv report result boston data work boston data set point variabl output input variabl divid maximum normal randomli sampl train sampl unlabel data remain test sampl measur gener error regress function anova decomposit kernel ik jk ik jk ik jk construct linear spline kernel train sampl templat sampl candid valu regular paramet equal space point log scale candid valu note cross valid process basi function train sampl fewer basi function result trial summar fig includ result cross valid cross valid challeng situat number sampl number perform compar cross valid cross valid conclud remark gener error predict method make distribut addit unlabel input point extend rang applic limit quadrat regular bia shown vanish asymptot work larger sampl origin regular variant work excel small sampl size interest model select techniqu aspect make refer estim understand techniqu achiev good model select refer subspac inform criterion regular opt cv loo figur gener error select trial boston dataset number sampl result shown standard box plot loo denot result cross valid transfer regular knowledg learn machin model select refer estim case save good amount comput time futur work focu theoret aspect refer estim interest question optim transfer regular inform refer estim learn machin gener learn machin analyz bia varianc instanc line plan appli classif learn acknowledg gratefulli acknowledg partial support dfg contract ja mu eu project takashi sebastian valuabl discuss special anonym strongli improv paper ms gmd warm hospit deriv show deriv assum solut learn problem consid function deriv subspac inform criterion regular denot express taylor residu element express estim element written ij express approxim term term replac analysi error due approxim proof theorem assumpt obtain deriv regular base estim trace estim subspac inform criterion regular deriv obtain saddl point equat respect matrix matrix element ij lr matrix element ij lr substitut deriv substitut proof theorem show order error due approxim assum repres order polynomi moment order bound ia ia ka ka show lemma lemma denot set indic relat odd subspac inform criterion regular lemma order order deriv proof lemma appendix iii iv note lemma hold set deriv order term ia lemma ia odd order equal lead term focu term taylor term side independ lemma odd order equal lead term substitut relat proof lemma task deriv order subspac inform criterion regular defin index vector assum uniqu valu number indic valu denot denot cardin set defin set index vector rewritten defin subset exclud index vector number odd time distribut symmetr definit sec independ rewritten moment bound exist posit constant odd null set number uniqu valu bound cardin proof lemma describ order deriv indic step prove prove function subspac inform criterion regular construct proof induct obviou assum order deriv function order deriv prove deriv order proce prove obviou assum order order proven refer vn statist learn cm neural network pattern oxford learn poggio algorithm learn vol pp radial basi function tech centr cognit orr neural trick vol springer fm vn complex control regress vc gener ieee transact neural vol pp inform criterion determin number hidden unit artifici neural network ieee transact neural vol pp estim regular workshop induct scienc juli pp subspac inform criterion regular inform criterion model neural vol authorship problem compar studi discrimin method appli authorship disput journal american statist vol pp cl comment vol pp bayesian pp press djc neural vol pp statist model ieee transact automat vol pp schuurman adapt regular criterion pp rg introduct theori neural design regular term regular paramet subspac inform technic report depart comput tokyo institut pm prune laplac neural vol pp kp bennett ol linear program discrimin linearli insepar optim method vol pp ol program data data mine knowledg vol pp ps ol wn select mathemat inform journal vol pp aj pl rc proxim data willshaw ed vol pp iee press subspac inform criterion regular aj ol kernel featur tech rep data mine aj smola greedi matrix approxim machin pp ak pattern ieee tran patt anal mach vol pp network neural vol pp decomposit neural vol pp evalu subspac inform machin special issu method model select model rj introduct chapman vv theori optim academ mathemat program approach kernel fisher neural inform process system spline model observ vol seri appli societi industri appli philadelphia repositori collect artifici data set vn vector regress anova decomposit advanc kernel method support vector aj pp mit sw vector method function regress signal neural inform process system pp applic multipl comparison techniqu model annal institut statist vol pp
HCI/1089 4 augment realiti person applic bruce ben john john phillip de michael morri wayn piekarski school inform scienc universit south australia bruce au abstract er present augment person applic develop extens desktop game investig convert desktop person applic mobil augment realiti applic present low moder accur freedom track system base digit fiduci track usabl issu monster input devi discuss applic ar architectur design present introduct current applic place user person perspect view virtual world architectur design viewer geograph inform system medic applic paper project move form applic displai relev inform augment realiti sider game quak view arc design research place applic spatial context physic achiev emploi comput system con comput applic posit user bodi user head techniqu develop genuin comput laboratori design interact user physic confin comput artifici realiti kei excit practic technolog augment realiti user wear displai world overlaid inform enrich user percept unlik virtual comput gener entir user augment realiti place comput role physic model quak graphic model augment realiti inform object displai ed spatial context physic world quak model physic world shown displai user actual ceil floor model intern incid actual structur virtual structur kei ar applic model exist physic outdoor omiss render imag displai effect render techniqu aim aim construct perspect plicat applic situat physic world point view applic show user complet determin posit orient user head relev inform displai augment displai user mobil walk inform space applic oper outdoor indoor environ user interfac requir simpl button devic research issu number research issu area user con version desktop applic ar en user interfac augment realiti applic simultan displai ph comput gener imag requir special care choic screen colour pure virtual imag applic displai requir attent light condit background colour outdoor keyboard interact intern symposium wearabl comput usa copyright ieee visit inform fourth intern symposium wearabl comput ieee replac movement simpl button layout user interfac accommod ar natur applic freedom track ment form applic address requir low moder accur track system king requir indoor outdoor environ larg usual test environ campu gp posit error notic effect registr augment inform xe address posit error regist augment inform close distanc track system tourism gi paper architectur tion modifi quak game accommod ar natur applic user movement rel movement mode absolut mode game coordin system calibr physic world field view displai calibr physic world progress date ongo complet time paper submit clarifi statu portion system present paper game port comput platform oper gp digit compass mean track keyboard interact game complet replac user movement tw fulli function accuraci track system model quak outdoor section campu interior wearabl comput laboratori graphic game run frame gp updat compass updat time colour graphic game user displai outdoor environ major hurdl left vision base track system vision base system ing common coordin system system issu accuraci speed prevent state portion system function paper present current state achiev regard background kei technolog emploi review track appli quak platform suppli track previou research establish outdoor ing differenti gp commerci grade magnet compass inaccur augment applic approach combin number system gp combin optic track gp magnet pass number research investig fiduci track base optic track system fiduci marker track tem art develop billinghurst art set comput vision librari calcul camera posit orient rel physic marker real time featur includ singl camera fiduci track simpl black pattern match softwar pattern calibr code video optic fast perform realiti applic fiduci marker high contrast pattern centr figur show marker art determin distanc orient marker camera incorpor calibr applic determin placement camera rel user line determin proper placement graphic object ar applic origin quak game chose quak primari applic number reason quak fit gener model ar applic autonom agent interact user applic public open sourc code quak graphic engin quick run wide rang comput platform oper system quak shoot em game quak state stai aliv place base perspect screen larg top part screen view show monster architectur statu inform bottom screen move quak jump shoot pic king object weapon aim chang view direct fire press kei button open user walk door button user pick item walk art game fourth intern symposium wearabl comput ieee find special object secret pressur plate motion detector quak incorpor platform move follow track room level pressur plate motion detector sensor open warn monster wearabl comput platform wearabl comput system hardwar mount rigid item attach firmli process perform toshiba notebook mb run freeli lin program der tool laptop latest comput unit substitut capabl singl serial port ment serial port commun card connect laptop navig digit compass orient gp receiv receiv ed accuraci head mount displai altern unit displai soni devic present small keyboard data connect cabl adaptor construct backpack direct modif wearabl system support outdoor ment realiti research system number interact librari modul number soft librari form write code graphic interfac top coordin datum col librari transmit structur net high level low level interfac unix system asynchron string event error check librari turn implement soft individu unix perform actual task system softwar modul process input hardwar devic pass output modul interest valu commun tw modul perform system distribut net wearabl machin collabor share inform origin system outdoor augment realiti na support topdown wire frame system extend share inform standard vr entiti col simul real entiti outdoor wearabl machin back indoor displai goal bring intuit ture interfac game user don wearabl comput place hmd hold simpl input devic user perform simpl calibr align hmd start plai game keyboard control replac inform input devic movement aspect game engin fit physic concept command move form user movement determin rate direct movement remaind tion describ quak lev el user interact monster sixteen type monster quak world attribut make unsuit type level limit movement track monster walk leap relativ eli easi destroi extrem damag user attack chose type monster includ lev el monster type creatur weapon ell suit system monster skin colour textur hang male easier distinguish physic world choic colour textur map skin monster base user test section campu level creat quak level repres portion level campu south australia wall quak wall extern wall render black game mode grid pattern test mode graphic object quak locat wall game mode black wall user game quak graphic engin render item region interest quak level architectur draw campu provid architect draw ei portion fourth intern symposium wearabl comput ieee figur user head displai figur quak campu level size model area metr metr figur depict view level creat hai monster level enforc top floor rest spread ground level item ground user pick piec ten health box system track system make user agil agil found normal game includ support equip found normal weapon walk system user move level view user view game physic world shown figur bottom portion screen statu bar con rain inform weapon major screen reserv ar imag monster game object origin action perform user locat quak level retain action door open user attempt walkthrough user pickup object origin quak walk rap trigger stand move predetermin locat action easili reflect physic world remov secret lock door track user posit orient user head handl major interact user interact user perform shoot chang current weapon emploi tw button index finger devic physic input devic action thumb button chang index finger button fire current weapon direct weapon fire center current view hmd field view align quak world physic world incorrect perspect field view highlight inconsist virtual world default field view game reason coi world fit comput screen field view suffer fish ey distort effect compar object quak world real object hmd approxim horizont field view calibr adjust hmd quak chang game field view set scale graphic object field view artifact introduc user posit farther forward investig graphic model determin differ tradit graphic model track goal system provid continu indoor outdoor system track combin system system track categor area outdoor outdoor indoor requir maintain posit orient fourth intern symposium wearabl comput ieee format common format wg posit inform angl orient inform visual landmark improv registr tw ow firstli system correct final imag align landmark graphic landmark extract rel posit camera landmark chosen option inv gener track solut outdoor build gp posit inaccuraci problem quak applic user larg distanc object requir orient error remain constant angular deviat user field view extrem ampl posit error reduc registr error effect distanc game flat open system requir graphic regist physic object ground scenario wall occlud monster item interest game slave user displai game believ user current view user action perform correctli context game case build visibl user larg distanc inaccuraci low distract problem monster occlud properli physic build visual effect poor monster walk wall pop thin distanc error detract game problem exist visual user gener move head oper game meter differ metr track user posit approxim error user horizont field compass error outdoor build ing metr poor monster object physic due gp appar user move closer inaccuraci gp posit inform preval system requir slave world real real time user ten metr build posit equat error approxim half full size horizont field view hmd error greater horizont field virtual object visibl hmd figur fiduci marker build enhanc accuraci user build extend version art fiduci marker specif engin outdoor clariti metr marker setup real world object accur locat inform obtain figur show fiduci marker corner build quak world marker provid correct align world multipl fiduci marker reduc uncertainti due marker light issu extend develop suppli posit format transpar track system initi approach determin inform method inform confid regist fiduci marker art toolkit return confid system ha threshold hover toolkit confid inform indoor user walk build fiduci insid wall track system start compon track system form track similar work al system low andi track error accuraci applic error user horizont field view experi place marker wall ceil figur show configur ear wall mount marker marker track camera forward size posit pattern wall fourth intern symposium wearabl comput ieee figur fiduci marker wall usabl system user close wall chose pattern size era ve found system regist pattern rang era era wall ra room rang suffici initi stage accuraci cm longer distanc import matter user room pattern visibl order pro vide ve implement pattern wall sole mean trac king requir size target target pattern insid larger larg target smaller target user close target approach place mark er track camera point upward camera problem variabl area visibl wall distanc ceil constant main differ vari height user instanc implement small rang head tilt head roll ly crawl investig futur pattern ceil er time pattern reliabl identifi camera mount backpack height era room height current len camera view boundari pattern era size colour choic colour import outdoor augment realiti colour difficult distinguish natur surround bright sunlight origin quak game incorpor colour scheme give game feel dark colour hmd monster item ferent colour visibl outdoor ment ran small inform experi determin start point pick colour outdoor set inform studi gaug visibl opaqu solid fill polygon displai hmd interest colour textur larg area monster item game colour necessarili textual inform studi requir form ar inform test view colour stand shade stand shade sunni stand sunni area stand sunni area sunni area test colour intens colour intens combin colour follow ed intens highest lowest intens test perform wearabl comput hmd combin score visibl opaqu view condit scale ten strongest set criteria score view minimum score condit colour satisfi qualiti applic requir larger weaker criteria score abo score addit inform user studi gaug game appeal perform simpl inform user studi peopl system user prompt felt aspect system subject thought visibl system ma subject found bright light made displai difficult system user found hand held input devic easi quick learn user found point devic gun fashion fire target report feel system subject believ easi pick item difficult item pick form confirm fourth intern symposium wearabl comput ieee peopl dislik colour statu bar thought rang colour limit monster colour good easi user er easili identifi monster ed augment real peopl thought movement rel real world comment lag rotat head ed easi shoot subject found lag made difficult align cross hair target actual process fire weapon easi implement origin modul construct ha requir modif support extens mention paper addit modul ad provid featur modul perform pattern recognit art read posit orient valu devic detail architectur implement exist modul found modul pattern nition extend refin posit orient pass back system modul process integr perform tabl describ modul connect case system camera recognit gener posit gp function indoor modul extract inform posit con udp local network modifi quak program receiv es udp convert data local coordin scale translat quak inform render displai locat correct head control game physic found ha ring individu soft advantag task process camera data tend process turn en tire system stop process base user thread architectur applic applic domain outdoor ar ear improv architectur design question architect ar visual tool aid architect convei idea prospect client common figur bridg complaint arc relationship arc assum believ client understand design visual tool provid client accur method understand idea show design outdoor ar environ client move gain understand design issu space form easier client view design locat final bridg architect show client design partial bridg roof structur consist materi transpar roof fulli perman fix window architect demonstr prospect client design idea client build tw initi requir build level directli exist ground level client specif requir materi size wide high support column figur show system oper depict bridg provis light locat central don approxim meter high design construct design pac design translat render ar displai paper report ongo research project augment realiti person applic implement fourth intern symposium wearabl comput ieee interest result user interfac issu ar augment realiti architectur low moder accur implement issu con desktop applic ar applic time submit game run wearabl comput platform track system game oper accuraci track system model outdoor section campu interior graphic game run frame gp updat compass updat time result research point report includ design implement user interfac augment realiti guidelin iden inform set colour account light background colour outdoor successfulli map keyboard interact applic movement simpl tw input devic simpl user interfac layout incorpor applic game con time investig hv overcom difficulti registr error indoor close build low cost moder accur track nov el combin optic track trac king provid absolut track system solut restrict overcom registr provid gener track solut fiduci marker corner build provid accur posit inform fiduci marker view head mount accur track mation data vision base track fulli continu investig solut shown system appli applic architectur ha en work applic incorpor architectur design cycl specif technic achiev work point work serv proof augment readili achiev translat applic set desktop incorpor physic world bring closer possibl ubiquit comput support advanc comput research south john defenc scienc technolog refer azuma challeng make realiti work outdoor intern symposium mix realiti page march fp brook dynam graphic system simul virtual build workshop interact octob situat real world intern symposium wearabl page san octob id softwar quak view billinghurst marker track hmd calibr augment conferenc system ieee acm intern workshop augment realiti page san octob confluenc comput vision interact graphic augment realiti virtual august park augment realiti track natur environ intern symposium mix neumann pose robust accur augment realiti track ieee acm intern workshop augment realiti page san octob thoma integr virtual augment realiti outdoor applic ieee intern workshop augment realiti san octob victor architectur outdoor wearabl support augment realiti multimedia applic pr intern confer intellig inform engin august ieee livingston superior augment realiti registr integr landmark track magnet track siggraph page august acm fuch realiz needl siggraph page august acm gunther men ted realiti arc design outdoor environ intern journal special issu design comput net novemb sydnei fuch demonstr optic tracker scalabl work area displai system symposium interact page march fourth intern symposium wearabl comput ieee
DB/1090 3 evalu transact manag issu mobil system depart comput engin inform scienc turkei abstract critic issu mobil data manag respond data access requir support applic difficult handl constraint mobil comput environ due physic constraint mobil comput hardwar wireless network technolog present mobil system model account time requir applic support mobil comput system provid transact execut model altern execut strategi mobil transact evalu perform system mobil system number mobil host handoff coordin site wireless link failur perform result provid term fraction requir satisfi introduct mobil comput system dynam type tradit distribut system link mobil comput mobil support station provid wireless interfac mobil comput chang dynam mobil comput user carri mobil comput access servic locat requir maintain fix posit network exampl applic support system mobil comput includ locat depend transact requir migrat data mobil transact inventori sale credit onlin inform servic local yellow stock market travel mobil comput manag system basic requir mobil data manag provid transact underli applic critic item agenda mobil data manag research support mobil comput system dbmss resourc constraint mobil comput system make difficult satisfi time support applic low wireless frequent disconnect overhead commun mobil host static part system mobil host make locat inform dynam result cost search updat mobil host locat research result obtain area system adopt mobil comput system obtain reason perform presenc constraint mobil present mobil system model account time requir applic support mobil comput system mobil transact execut model construct system implement simul perform system analyz evalu impact mobil system number mobil host handoff process coordin site wireless link failur perform result provid term fraction requir satisfi organ paper section discuss recent work mobil transact manag section mobil system model perform configur inform connect mobil comput switch mobil support station evalu transact manag issu detail simul program discuss section result perform experi present section provid section relat work execut strategi mobil transact discuss transact submit mobil host mobil support station execut fix part result execut return back mobil host submiss mobil host disconnect network perform task approach support interact mobil host transact gener host transact input user mobil transact execut model support call weak oper divid cluster semant relat close locat data data item insid cluster requir fulli consist inconsist data cluster lack strict consist toler semant order maxim local process cluster reduc network user interact local consist data achiev weak read weak write oper oper local consist data introduc standard read write oper call strict read strict write oper local consist data access issu weak transact consist weak read weak write global consist data access issu strict transact consist strict read strict write oper mobil transact model base transact model support report transact minim commun mainten cost reloc transact mobil transact consist set independ compon transact interleav mobil transact report transact compon transact mobil transact share partial result execut report transact control pass transact time share partial result report transact reloc execut host approach transact process mobil system object semant inform mobil transact process view concurr cach coher problem disconnect state mobil host support util object semant inform provid finer granular cach concurr asynchron manipul cach object mobil host mobil system model mss mss fix network mobil host wireless link wireless cell figur mobil comput system typic mobil comput system consist number mobil fix host fix host connect fix wire network constitut fix part system mobil host capabl connect fix network wireless link fix call mobil support station augment wireless interfac commun mobil host link mobil comput chang dynam geograph region mobil host commun mss call cell mss mobil host local mss insid cell mss mss act interfac local mobil host fix part forward messag data local mobil host fix network locat mobil host regard data item user cross boundari cell locat server fix host maintain locat answer queri order commun mobil requir find current locat mobil system forward pointer mechan find locat mobil comput mobil host address deposit locat messag mobil host forward address assum fix host act mobil support station mss server enforc strict data consist mobil host coordin mss coordin oper transact submit mobil host assum coordin site mobil host fix transact execut type transact coexist mobil transact fix transact mobil transact gener mobil host execut gener host fix host fix transact gener fix host execut fix host transact time constraint term deadlin transact execut model extens model mobil comput system mobil transact exist system form mobil master process gener mobil fix master process coordin mss gener fix process site requir data page resid fix gener host site access data transact process site mobil transact consist write user interact oper fix transact consist read write oper data request messag read write oper process relev data site coordin read write oper global data dictionari refer find relev data site data site copi global data dictionari assum write set transact subset read set data page access randomli transact user interact oper handl gener host mobil transact consid read local data item gener mobil host request repli fix host mobil host submit transact transact result figur mobil transact execut strategi mobil transact execut entir transact submit singl request messag fix network execut control execut transact complet execut return result call execut strategi site fix data request messag read write oper transact submit handl request fix network data process oper perform mobil host execut strategi call site mobil request repli request repli mobil host fix host figur mobil transact execut strategi cpu power mobil host process transact approach suitabl mobil host power cpu execut fix transact control complet transact gener host transact uniqu prioriti base time constraint order resourc data access request transact transact assum carri firm deadlin transact miss deadlin abort discard system assum system apriori knowledg transact execut page access execut time estim transact transact abort due data conflict expir restart deadlin prioriti concurr control serializ ensur adapt lock scheme prioriti abort protocol resolv data conflict low prioriti transact abort lock request conflict mode high prioriti fix site system schedul manag lock request process execut site process obtain share lock data item lock data item write global serializ ensur strict phase lock hold lock transact commit atom commit atom commit transact provid modifi version phase commit protocol modifi adapt mobil comput environ design process execut data site act particip transact updat process store local handoff mss mss wireless cell wireless cell figur handoff oper due mobil mobil host cross boundari cell order connect mobil host fix network handoff process implement cell mss provid wireless interfac mobil host process transpar user handoff protocol similar assum mss broadcast beacon wireless link beacon carri sender address mobil host monitor wireless signal strength receiv neighbor mobil host decid initi handoff process signal receiv mss substanti stronger receiv current mss mss current mss coordin site mh mss mss coordin site figur link list structur coordin site current mss shown figur distribut link list structur construct locat inform mobil host coordin site current mss mobil host handoff process disconnect characterist mobil comput system frequent disconnect mobil host due limit batteri power wireless bandwidth disconnect commun mobil transact order prevent mobil transact block transact due data conflict deadlin abort transact execut control transact control transact commit abort transact disconnect reconnect mobil inform transact abort commit simul model implement mobil system model simul program written csim simul model paramet list tabl mobil comput system consist fix mobil host fix network connect fix host fix host assum mobil host connect fix part wireless link assum content wireless link bandwidth fix host cpu disk resourc share user mobil host cpu cpu mobil user fix host local size page memori size execut strategi number fix host number mobil host time local size page page size byte memori size page fh number cpu fh cpu time process data page fh cpu time process messag fh rel power fh cpu mh cpu number page access transact number user interact execut mobil transact io time access page disk fraction updat transact page write probabl updat transact slack rate wire link bandwidth wireless link bandwidth control messag size byte handoff interv handoff probabl connect interv disconnect probabl tabl simul paramet fix host number data page number read user interact oper transact paramet transact updat transact probabl page access updat transact updat probabl transact prioriti resolv data conflict schedul hardwar resourc prioriti assign polici model earliest deadlin transact earliest deadlin assign highest transact submit host transact gener host transact wait submit transact featur mobil simul paramet mss mobil host chang begin time interv probabl mobil host stai connect averag time connect mobil host disconnect begin time interv probabl disconnect mobil host reconnect begin time interv probabl system compon resourc manag disconnect predictor handoff handler transact gener transact manag messag server resourc manag data manag transact manag schedul transact gener locat server messag server local mobil host fix host fix network figur system compon compon simul model shown figur mobil host system transact transact messag handoff disconnect mobil transact execut fix host transact transact messag locat data transact transact submit oper transact gener transact gener transact model paramet submit local transact manag deadlin prioriti assign transact perform transact gener transact manag mobil host initi host send messag relev mss initi coordin site transact manag fix host receiv transact initi messag check coordin site gener host transact initi transact send request locat server locat coordin site messag server transmiss messag host send messag site organ basi prioriti messag mobil manag messag highest prioriti system transact oper messag carri prioriti sourc transact due mobil host chang locat access fix network point time order locat mobil host coordin fix link list structur construct locat server construct list list redirect messag site current mss mobil host disconnect reconnect mobil host initi disconnect handoff oper initi handoff handler relev paramet model execut transact oper control execut read write oper order access data process request lock page schedul schedul serializ execut transact make concurr control protocol model emploi prioriti abort protocol concurr mention process grant lock data process access page page main data manag fetch disk cpu servic request order resourc manag site cpu schedul polici prioriti schedul polici prioriti schedul experi default paramet set simul experi present tabl valu chosen system high resourc util fix host experi run continu transact execut system page byte page page mbp mbp byte tabl default paramet set perform metric evalu success fraction transact satisfi deadlin order interpret perform track number conflict data access request transact averag number mobil site search request transact transact load vari number mobil host success ratio figur success ratio increment number mobil host correspond total system load rang transact load obtain experi led cpu util case case rang util observ perform result obtain execut strategi term success ratio shown figur rememb repres case execut site mobil transact mobil repres case execut site fix host perform system degrad strategi transact load rang transact load perform involv addit wireless link delai data access power cpu mobil host reason perform execut strategi load physic resourc number data conflict user interact user interact oper issu mobil host execut transact gener oper consid read local data item requir continu execut mobil transact user interact request satisfi wireless link commun wireless link delai experienc gener mobil host current mss satisfi user interact requir mobil transact vari number user interact oper mobil transact increment evalu perform impact frequenc mobil user interact perform result obtain term success ratio mobil transact provid figur user interact perform bit due execut overhead user interact oper success ratio figur success ratio mobil transact steep degrad perform observ number user interact result explain amount wireless link delai addit interact request execut mobil transact handoff mobil user cross boundari cell order connect mobil host fix handoff process occur handoff distribut link list structur construct locat inform mobil host exchang coordin site current mss mobil host handoff process introduc commun search overhead system success ratio figur success ratio mobil transact perform result obtain vari handoff probabl shown figur simul time divid time interv handoff process occur begin time interv probabl vari handoff probabl increment correspond case handoff process occur set number user interact perform affect frequenc handoff process submiss mobil transact coordin messag transmiss coordin site mobil host transact complet search process tor site requir rare affect perform handoff case perform handoff case nonzero valu handoff probabl perform result rememb forward pointer mechan determin current address mobil mobil host move averag length link coordin site current mss nonzero valu handoff probabl mean averag cost commun search coordin site current mss mobil host posit emploi handoff process lead perform frequenc handoff introduc addit degrad perform order frequenc user interact affect system perform handoff vari number user interact increment assign illustr figur perform pattern affect chang number user interact success ratio handoff handoff figur success ratio mobil transact observ similar result present section number user interact perform degrad system sharper compar obtain handoff result due cost search coordin site number user interact averag number coordin site search transact averag number mobil host search request transact valu perform measur reach valu number user interact disconnect mobil host disconnect frequent fix part system save success ratio figur success ratio mobil transact limit energi unavail wireless link part mobil host longer submit transact oper system disconnect neg impact perform system evalu perform system vari disconnect probabl mobil host increment recal probabl mobil host disconnect time interv assign perform system term success ratio mobil transact degrad disconnect probabl rel perform affect frequenc disconnect coordin reloc due distanc current mss mobil host coordin site reloc coordin site reduc overhead commun search current mss coordin site experi evalu perform impact reloc coordin site mobil host overhead introduc reloc coordin site due exchang commun messag relev fix host success ratio reloc reloc figur success ratio mobil transact experi measur perform system vari handoff probabl figur execut strategi reloc coordin site lead bit perform degrad due cost reloc explain handoff experi figur perform affect handoff probabl perform system improv coordin reloc improv valu handoff probabl mobil host commun coordin site transact prevent cost search coordin reduc amount commun provid substanti benefit system perform success ratio reloc reloc figur success ratio mobil transact vari number user interact perform result shown figur execut strategi valu number user reloc perform reloc lower valu number user reloc perform system improv due cost reloc higher cost commun search coordin outweigh cost perform obtain reloc wireless link failur experi measur perform system vari failur probabl wireless link simul time divid time interv interv wireless connect mobil host fix part network fail probabl success ratio figur success ratio mobil transact perform result experi shown figur set failur probabl chang increment failur probabl perform system execut strategi rel perform affect probabl wireless link failur result similar obtain disconnect experi provid mobil system model support real time transact underli applic construct mobil transact execut model implement simul program order evalu system perform execut execut strategi data request messag oper mobil transact coordin site fix part network complet process data access request fix data provid mobil host gener transact transact oper grant data execut mobil host execut strategi mobil transact submit coordin transact execut fix user interact request transact handl gener mobil host process requir transact satisfi fix part network perform experi evalu impact mobil system issu perform system investig issu handoff coordin site wireless link failur perform metric experi success fraction transact meet deadlin observ experi cpu mobil host wireless link bottleneck system perform impact handoff process observ user perform strategi affect handoff process observ handoff process lead perform frequenc handoff introduc addit degrad perform perform impact number user interact requir execut mobil transact evalu execut strategi user interact lead degrad system perform due requir wireless link commun user interact investig perform impact reloc coordin site mobil host reloc aim reduc commun cost coordin current mss mobil host observ reloc lead improv perform user interact number user interact perform improv provid reloc coordin site higher observ perform impact disconnect failur show differ current work mobil system area includ develop concurr control recoveri protocol mobil comput evalu protocol mobil manag system model present paper acknowledg research support research council turkei ub grant number nato collabor research grant crg refer schedul perform evalu acm transact concurr control recoveri system ma transact process mobil comput environ ieee workshop advanc parallel distribut system fast scalabl handoff wireless internetwork acm mobicom mobil comput sigmod challeng mobil comput ieee data manag mobil comput sigmod evalu transact manag issu mobil realtim system ms turkei tempor survei ieee transact knowledg data maintain consist data mobil distribut environ intern confer distribut comput system transact concept mobil comput ieee workshop mobil comput system applic distribut parallel csim user guid mcc technic report number process transact replic system intern journal distribut parallel data manag mobil comput intern workshop issu applic support transact process mobil applic ieee symposium reliabl distribut system submiss transact mobil workstat cooper process environ intern confer distribut comput system
IR/1091 5 shop agent automat construct wrapper onlin vendor yang lee choi depart comput scienc korea school electr comput korea abstract paper shop agent robust induct learn method automat construct wrapper semistructur onlin store strong assum exist system weaken real store complex document structur handl method treat logic line basic recogn posit structur product descript find frequent pattern sequenc logic line inform output html page method capabl analyz product descript multipl logic extra miss attribut test site show successfulli construct correct wrapper real store introduct shop agent mediat system extract product descript onlin store user behalf store procedur extract content inform sourc call wrapper built maintain store wrapper gener consist set extract rule code appli system extract rule wrapper written human wrapper suggest automat build wrapper learn set resourc sampl page previou system unabl cover real store reli strong restrict structur document analyz assum product descript resid singl handl case miss attribut algorithm deal miss item fulli automat user involv prepar train exampl wrapper gener power automat wrapper learn limit heurist obtain user learn shop agent simpl robust induct learn method automat construct wrapper onlin store strong assum system weaken store handl product descript multipl logic line extra miss attribut method treat logic line basic assign categori logic line html page product search result convert sequenc logic line categori main idea wrapper learn recogn posit structur product descript find frequent pattern price inform pattern regard extract rule wrapper overview comparison shop agent wrapper learn method implement prototyp comparison shop agent call architectur shown fig consist modul includ wrapper wrapper uniform output gener fig architectur wrapper gener main learn modul construct wrapper store wrapper gener learn thing learn queri store recogn queri scheme html page searchabl input box analyz queri templat gener learn extract store content product descript store search result page recogn repeat pattern determin wrapper interpret modul execut learn wrapper current product inform modul form actual queri combin store queri templat keyword user type send shopper site search result store collect fed uniform output gener modul uniform output gener integr search result store gener uniform output learn wrapper onlin store kei function wrapper gener learn format product descript result page success search page product descript match sampl queri product descript sequenc item describ attribut product bookstor displai search result attribut product includ reader review wrapper learn find start end posit list product descript entir result recogn pattern product descript method divid phase html sourc page broken logic line logic line conceptu similar line user algorithm recogn logic line examin html delimit tag phase algorithm categor logic line assign categori number maintain categori includ categori number titl denot product price denot denot tabl tag denot html tag logic line text denot gener string recogniz categori simpl heurist categori assign titl assign logic line line keyword sampl price assign recogn dollar sign symbol repres price digit fig show html sourc product descript obtain amazon bookstor queri assign categori number logic line intern confer theori applic cryptolog inform secur matsumoto fig html sourc book categori logic line categor entir page express sequenc categori number phase algorithm find repeat pattern sequenc find pattern product descript count frequenc distinct pattern frequent find candid search price backtrack sequenc search gener assum titl attribut price attribut reliabl heurist correctli recogn price higher heurist recogn titl subsequ logic line titl price result pattern pseudocod algorithm seq input sequenc logic line initi posit pattern search number distinct pattern find candid exit store frequenc count increment save increment pattern start point search element arrai maximum learn pattern shown fig shop wrapper interpret modul appli learn pattern modifi noisi attribut ignor extra attribut put dummi valu miss attribut result implement built web interfac shown fig user select store learn learn store ad store list comparison shop evalu test real onlin store correct wrapper gener assum proper test queri learn phase output page match product produc order verifi correct wrapper result wrapper learn displai fig learn pattern product price shown data consist main interfac learn result fig interfac obtain directli access store regard correct wrapper gener tabl show test data site test collect relev inform output page site test queri learn number number frequent wrapper gener algorithm work satisfactorili store site fail pattern unnecessari product inform header output page tabl experi data wrapper gener site store url test queri pattern total gift ring school video video compaq java java gift java discuss futur work develop robust method automat wrapper gener domain comparison test result shown successfulli construct correct wrapper real store characterist method comparison previou research summar strong assum exist system weaken real store complex document structur handl exploit domain knowledg make learn algorithm simpl domain work satisfactorili learn process quickli incorpor separ modul remov redund fragment limit current system assum proper keyword test queri human heurist provid proper test queri automat investig product descript price attribut sever restrict store produc product inform price except restrict reduc gener algorithm appli domain requir price inform solut featur attribut exist product descript paramet program extract price inform product descript attribut extract inform exploit proper domain progress refer system construct mediat internet sourc acm sigmod intern confer manag data structur data back acm sigmod workshop manag semistructur data scalabl agent world wide web intern confer autonom agent wrapper tsimmi system acm sigmod intern confer manag data wrapper induct inform extract intern joint confer artifici intellig hierarch approach wrapper induct intern confer autonom agent
IR/1092 5 exploit geograph locat inform web page junghoo cho hector lui gravano narayanan shivakumar abstract inform resourc web relev primarili limit geograph commun web site inform rental relev primarili web user geograph proxim locat inform resourc relev broader geograph commun newspap relev user unit state geograph scope web resourc larg web search engin make case identifi exploit geograph locat inform web site web search engin rank resourc geograph sensit addit tradit strategi comput geograph locat web page exploit inform specif applic implement discuss exampl introduct web uniform access inform globe web site store bank institut interest web user web site inform primarili interest web user geograph bai area palo alto current web search engin geograph scope page comput queri result search engin queri result includ resourc geograph relev user issu queri find rental specif region simpl task current web search engin scenario geograph scope zip web presenc exploit inform varieti improv search web user queri search engin search engin identifi user user regist inform search engin profil search engin inform rank italian restaur base distanc restaur user return refer italian restaur world note strategi user queri search engin queri miss refer restaur area close palo alto mountain view menlo park addit inform restaur qualiti price inform search engin factor dimens rank depart comput stanford ca depart comput columbia amsterdam ny identifi web user find web web page topic web search engin googl hit count number distinct hyperlink point web page indic import web page heurist larger number web user made hyperlink web higher import page approach count good indic relev site stanford student palo alto resid link stanford daili daili campu cover relev local commun number hyperlink import newspap york time smaller simpli concentr web site stanford palo alto largest world exploit geograph inform web estim global web entiti data market analyst interest exploit geograph inform target product sale web sourc inform market analyst identifi web data outdoor activ bike popular resid bai area analyst recommend open addit sport good store area princip problem exploit geograph locat inform entiti comput geograph section discuss techniqu determin locat web page techniqu primarili easi comput locat inform versu accur inform exploit locat question inform discuss earlier applic inform section concentr applic discuss initi visual prototyp develop specif task comput geograph scope identifi geograph scope web page approach comput geograph locat human page approach prohibit explor automat wai attach geograph scope resourc inform automat analyz web page extract geograph entiti palo area zip code user type search term search engin denot geograph locat textual search term locat search term web page word italian menlo web user palo alto search italian associ menlo park geograph locat search term web page search engin rank web page user palo alto approach complementari approach present paper approach attempt captur geograph scope web resourc actual word place mention network ip address relat approach determin geograph scope web resourc focu locat host web site defin geograph scope web page locat web site resid web page queri assum web page relev palo alto stanford region side found repeat request intern internet domain registri unix tool identifi locat palo approach problem heurist work case geograph scope web page host correspond aol web server locat locat content global relev ip address alloc fashion inher connect ip address physic locat tool give locat site tool slow typic ten respond web site tool scale find locat hundr thousand web site show find locat web page accur educ institut extens describ exploit inform determin geograph scope web resourc prototyp applic discuss section varieti applic benefit geograph locat inform explor map web page geograph locat origin map understand geograph scope web resourc develop prototyp show geograph inform determin web site map web page geograph prototyp number download internet tool slow comput geograph locat hundr thousand web site site download phone number network administr class domain extract area code domain administr built tabl area code inform ip address belong class class address origin phone number area code administr class domain address base maintain area code inform ip address handl class address analog area download map citi area code entir state correspond area code big citi multipl area code lo wrote script convert data tabl entri maintain area code set figur geograph distribut hyperlink download map zip code rang longitud latitud download map citi zip code comput ip address latitud longitud web site locat area code cover entir longitud latitud ip address state longitud latitud averag extent state discuss process yield correct answer arbitrari ip address found techniqu work practic educ institut ip address class class domain alloc web site campu restrict educ obtain accur geograph inform web page locat institut geograph built gui java perform task map unit state latitud prototyp place point locat map citi prototyp place point locat map citi ip address textual prototyp place site geograph locat map infrastructur built prototyp top googl web search engin user type url prototyp issu queri googl http retriev set page educ site hyperlink url user type figur geograph distribut hyperlink prototyp extract googl web page hyperlink url prototyp map page extract geograph locat map figur sampl screenshot system url onlin websit san francisco chronicl prototyp draw circl geograph locat link radiu circl number link locat normal total number link circl exce maximum draw circl smaller circl cover larger circl chronicl popular primarili bai area california reader distribut state figur show similar screenshot york time daili campu newspap minnesota screenshot york time newspap chronicl daili newspap minnesota popular commun newspap minnesota similar queri onlin newspap observ similar result issu queri identifi region point stanford group web visual identifi research group countri observ due close interact queri domain web observ state unusu high number link site washington make case exploit geograph inform improv web search engin data mine applic discuss approach comput geograph locat web discuss prototyp visual web site base geograph distribut web page point web site figur geograph distribut hyperlink prototyp initi build applic exploit geograph inform fashion explor inform includ rank queri result plan investig identifi geograph locat web resourc inform extract approach mention briefli plan compar inform extract approach network ip address base approach adopt understand techniqu stanford group built web crawler archiv million web page plan implement run geographi extractor data refer amazon barn nobl jango comparison shopper page googl web search engin page anatomi hypertextu web search engin seventh intern world wide web confer apr kleinberg authorit sourc hyperlink environ ninth annual symposium discret page jan kleinberg automat resourc compil analyz hyperlink structur text seventh intern world wide web confer apr salton introduct modern inform retriev uri find host geograph locat html
HCI/1093 4 universit de centr universitair dinformatiqu group vision octob june technic report vision extens standard multimedia queri benchmark draft wolfgang muller de vri david mcg squir hen muller thierri pun comput vision group comput scienc geneva rue du gener ch geneva switzerland laboratoir de commun group de de intellig institut de ecol polytechniqu de switzerland depart comput scienc netherland happi test work abstract technic report introduc describ multimedia retriev markup languag markup languag basi open commun protocol imag retriev system initi design mean separ cbir engin user interfac extens basi standard perform evalu procedur tool essenti formul implement common benchmark cbir common protocol bring dynam cbir make develop system faster open door cbir research field disciplin interact freeli introduc technic report multimedia languag introduct develop research move direct ffl search queri interact paradigm ffl deeper research improv perform system adopt queri paradigm search perform queri paradigm led system similar interact give set interact capabl user visibl research move system enabl user formul queri order improv result consequ ffl common mechan ship queri result mechan assur queri processor process queri ffl paradigm common formul queri paradigm fulfil enabl commun share user interfac present group interfac suit interfac alik fulfil enabl commun share implement share code compar result system group research domain make access script publish actual code queri design constrain ongo futur research search optim queri formul paradigm research queri paradigm queri mechan separ commun problem queri formul research group evolv freeli find good domain specif queri formul scheme technic addit requir state design make simpl group develop environ current version complet solut qbe initi xml base languag commun server user interfac technic report demonstr util framework provid give system technic report organ describ gener framework emphasi extens give applic cbir system circu interfac written design queri ship framework common posit limit freedom individu case design easili extens section develop strategi preserv freedom individu research standard design lead extens main concern provid framework permit independ growth product research group period code prefer implement languag leav develop freedom choic implement languag standard adopt research work comput environ independ librari commun protocol independ parti librari group provid tool finit time choic xml markup dtd type definit specif commun specif transmiss extens protocol make choic altern java method remot procedur call fear strong link languag larg program packag advantag xml xml commun directli impli common human readabl log file format commun attract xml exist free tool numer program languag xml design explicitli simplifi parser design xml determinist simpl implement parser structur xml structur xml similar stem common sgml gener markup xml document tree element content node document tree list sequenc node interleav structur encod call element element type attribut set element free structur constrain document type definit grammar tree structur detail found grace degrad kei success independ extens basic principl summar ffl server client recogn xml element attribut encount text complet ignor ffl extens design standard inform remain gener user exampl modif standard local creat global dismiss standard parser exampl section principl provid guidelin independ extens avoid conflict differ extens plan maintain promot central registr document extens facilit user log extend walk commun structur remot procedur client connect send stai connect server server break connect server shut connect send messag answer request protocol advantag implement server limit perform loss frequent send request part singl messag extens protocol permit negoti perman connect plan current specif support ffl request capabl descript ffl select data collect classifi queri request collect queri ffl select configur queri classifi queri permit configur run ffl formul qbe ffl transmiss user interact data final featur reflect strong belief affect comput plai role field multimedia retriev support log user interact data case function interfac log cbir server server listen port messag tcp socket client request basic properti wait answer skip standard xml code server inform client capabl messag empti current version extens similar simpl client request list collect descript wai queri client open session configur user client request algorithm request answer send list algorithm handshak mechan interact client program agent automat obtain inform describ server similar simpl client open close session configur algorithm chosen user enabl server learn queri processor interfac configur client request properti sheet descript server algorithm relev paramet featur speed offer weight function varieti method level prune paramet irrelev circu properti interfac adapt specif paramet specifi interfac turn data xml send back server short interfac featur specifi displai element user enter attribut caption featur valu user enter integ attribut mechan complex properti send xml text multipl element interest reader refer appendix detail queri formul queri step depend queri paradigm offer interfac search engin includ design extens paradigm basic qbe queri consist list imag relev level assign user user mark imag posit imag neg queri imag refer url server return retriev result list repres url queri group transact formul log complex queri appli system process singl queri varieti version system lee al import case preserv log knowledg queri logic relat extend order demonstr easili extend queri give qbe imag user annot assum user invit associ textual comment imag mark relev irrelev tag exist add attribut element prefix ad avoid clash extens group import note server recogn attribut make remain inform element extend give extens semant respect principl grace ad attribut exist element element defin kind server recogn element exploit relev inform futur work specif main direct work relat goal enhanc clear time incomplet incorpor ffl region queri ffl text queri hope cooper work group queri techniqu system make languag specif implement date close analysi futur found provid opinion advantag creat pool common tool exchang research commun state futur implement implement ffl multiset properti sheet ffl enforc subset size constraint ffl visibl attribut ffl client side enabl meta algorithm implement demonstr refer extens markup languag recommend lawrenc john li queri taxonomi multimedia al symposium video data catherin zhang inform base user relev feedback imag retriev al symposium video data wolfgang david mcg hen thierri pun hunt move extens bayesian method multimedia al symposium video data jai editor multimedia storag archiv system iv volum septemb symposium video data rosalind picard affect comput mit gerard salton chri bucklei term weight approach automat text retriev technic report depart comput cornel york novemb document state machin commun sequenc connect connect singl request small group request answer server singl messag small group messag state machin fig describ commun start point make contact server client establish contact server send messag client receiv empti standard messag import stub extens concern connect find server session perman connect receiv configur client list session tag repli client open session return open session requir default state queri open server receiv user password inform collect algorithm user forc configur possibl open client possibl request list collect algorithm collect algorithm paramet algorithm attribut id collect figur state grammar commun list collect list client inform configur session configur client send signal algorithm attribut set attribut suitabl algorithm session fulli configur queri queri group transact group queri log learn intermix client send server user data tag user interact inform log learn algorithm element unspecifi number attribut attribut present valu attribut present extens main queri paradigm list enabl client determin collect algorithm algorithm match pair match set pair tag attribut match tag algorithm algorithm element turn specifi collect queri inform client properti client user decid proce algorithm algorithm possibl type uniqu statement client kind meta queri decid tag algorithm algorithm tag match properti sheet properti sheet method work fact common set configur paramet imag difficult find awkward suggest achiev send code build gui subset configur specif gener piec xml code gui state code xml inher secur hole simpl system invert file index imag imag translat sequenc featur describ imag featur assign weight determin depend frequenc featur imag collect depend weight function retriev perform process speed system depend weight function possibl weight function attribut algorithm element properti sheet possibl weight function system retriev perform test comparison interest choic algorithm wavelet histogram choic list fulli ffl defin list user chose subset size choic ffl state list gener text ffl attribut determin properti element ident structur denot element set select unselect select send text attribut text depend list item chosen user piec enabl interfac set properti sheet list select depend interfac send server client properti sheet gener messag gener xml describ gener document featur immedi circu explan text gener previou includ messag import fact gener framework describ entiti send xml imagin algorithm run queri imag seri filter run simpl queri processor research filter filter number filter simpli defin tag permit describ sequenc filter output properti sheet show user choic sequenc filter filter gaussian blur horizont gabor filter toi gaussian blur configur give number attribut gabor filter configur paramet configur panel filter select sequenc section describ text dialog dynam formal descript properti sheet clear gui properti sheet fact tree properti sheet xml gener properti sheet dialog dynam defin simpl rule dialog dynam properti element visibl ancestor visibl ffl parent select ffl parent attribut set select properti element defin properti element ancestor activ parent select activ properti element defin element enabl gui screen gener xml xml gener properti tree ffl xml string gener sequenc activ element equal concaten xml string gener element sequenc concaten equal physic sequenc properti element text ffl xml string gener inact element empti ffl xml string gener activ element properti element begin open tag xml gener ancestor properti end ad text gener properti element gener begin open tag xml element attribut space content attribut element attribut content attribut gener output children evalu sequenc close tag element gener open tag begin open tag xml gener ancestor properti sheet text gener begin open tag xml gener ancestor properti sheet nonempti gener text valu attribut definit properti lead text output empti begin attribut definit attribut lead text output actual definit provid current properti inher boolean attribut definit end definit provid child attribut begun ancestor sibl properti text gener inher attribut properti element gener code dtd document dtd deriv dtd perl script remov attribut tag extens ad highlight basic messag text order make easi server messag assign id session attribut author wolfgang mueller lot suggest correct david de vri christoph id id messag client send server connect messag inform basic server configur empti messag messag hold descript nonstandard empti messag permit user request session user client directli prior activ activ give server possibl inform user send properti sheet class render part visibl work group empti cdata password cdata session send session empti session cdata cdata list collect server empti list collect server collect list queri paradigm queri id index collect method server collect collect cdata cdata algorithm describ kind queri perform empti cdata list algorithm usabl collect empti cdata cdata return list algorithm collect server algorithm algorithm option properti option queri paradigm list option specif algorithm algorithm cdata cdata cdata id cdata cdata tag specifi algorithm kind algorithm children algorithm specif children properti sheet algorithm empti id begin transact id end transact id configur session give algorithm basic send properti sheet specif xml output back configur id caption cdata visibl attribut children cdata cdata cdata cdata cdata step cdata cdata cdata cdata algorithm algorithm empti element attribut talk server server properti tree algorithm configur meta queri properti power tool algorithm begin renam session give user possibl save current state case user class goal advanc user request session request chang session end session afford depend user end session tempt programm interfac side send desir feedback method session empti cdata password cdata cdata cdata empti cdata cdata empti cdata empti cdata empti cdata simpl user command log back forward command present empti command step cdata present provid queri search random imag send empti cdata cdata cdata cdata list url user relev qbe imag relev vari empti cdata cdata result imag accompani user similar calcul base featur space calcul similar vari empti cdata cdata cdata error messag error empti error messag cdata
AI/1094 2 posit estim mobil robot dynam environ dieter wolfram sebastian thrun armin cremer comput scienc depart iii school comput scienc bonn carnegi mellon germani pa abstract mobil robot navig safe popul dynam environ recent research led varieti local method track robot static lack method robustli local mobil robot dynam peopl block robot sensor extens period time posit furnitur chang paper extens markov local algorithm enabl local mobil robot popul environ filter determin sensor read emploi filter design detect sensor read corrupt human unexpect environ techniqu recent implement appli part mobil robot gave interact tour visitor museum extens empir test involv dataset record peak traffic hour museum demonstr approach accur estim robot posit case highli dynam environ introduct oper mobil robot mobil robot process determin track posit mobil robot rel receiv attent past year accur local kei prerequisit success navig global model topolog cad model murphi demonstr recent survei local method feng number exist approach mobil robot local techniqu categor local global approach static dynam local global local local approach local design error base sensor data requir initi copyright american associ artifici intellig reserv cation robot capabl track locat robot major exist local approach fall categori global approach gener local robot determin locat knowledg initi locat handl robot problem research local call markov enabl robot local global uncertainti global approach import advantag local initi locat robot provid addit level due abil recov local failur static dynam environ dimens local method group concern natur environ master major approach cope static environ robot aspect chang time robot locat approach typic brittl environ dynam perceiv robot sensor approach camera point ceil perceiv occur typic offic environ approach applic ceil structur accur posit estim develop method local robot dynam environ import goal research mobil robot navig paper local algorithm local robot difficult local global uncertainti highli dynam environ approach base markov local markov local robot maintain multipl robot weight numer probabl factor approach inherit markov local abil local robot global uncertainti al markov local base assumpt posit robot state world assumpt violat aspect environ cover world case dynam environ markov local found robust dynam effect peopl walk door typic fail local robot crowd environ unlik markov approach activ filter sensor data elimin damag effect sensor data corrupt extern dynam compar filter sensor data base entropi incorpor addit knowledg natur corrupt extend markov local compar origin markov local filter experi conduct data gather mobil robot rhino museum shown figur al comparison show convent markov local fail track robot locat filter successfulli accommod environ dynam approach reliabl recov local error rhino fig rhino surround visitor highli corrupt sensor scan remaind paper organ introduc markov local describ comparison discuss section markov local section briefli outlin basic markov local algorithm approach base kei idea markov local recent appli great success site simmon koenig kurien burgard al comput probabl distribut locat environ denot locat state space robot coordin cartesian refer robot orient distribut locat express robot subject belief posit reflect initi state robot initi center correct robot initi uniformli distribut reflect global uncertainti robot robot increment refin markov local appli probabilist model updat action model incorpor movement robot percept model updat belief sensori input robot motion model condit probabl probabl measur movement action execut carri robot updat gener formula domain markov chain term repres model robot kinemat implement assum error odometri distribut sensor read integr wellknown bayesian updat formula denot sensor read likelihood perceiv robot posit updat ff ff normal ensur sum strictli updat step applic problem past sensor read independ futur read locat robot markov assumpt assum world static approach appli environ peopl violat markov experi report scale popul environ paper state approach al resolut robot orient ffi spatial resolut optim techniqu thrun robot effici updat larg state space restrict power approach notic primari advantag high resolut result accuraci posit estim abil incorpor raw data proxim requir specif applic domain local highli dynam environ standard markov local approach found robust static environ argu introduct paper demonstr result prone fail popul environ violat underli markov assumpt robot natur accompani crowd assumpt violat illustr figur show typic situat rhino project map correct posit line current proxim measur shade measur class belong black valu correspond static obstacl part human violat markov assumpt measur proxim peopl robot belief close model effect robot frequent lose track posit reli sensor measur approach concurr estim state world posit robot lu milio burgard requir comput resourc appli approach solv problem develop filter select read complet scan high likelihood due static obstacl map make system robust kind section describ filter aim detect corrupt read robot track locat difficult read mislead filter gener method filter sensor data dynam environ select read robot measur entropi belief filter design proxim attempt filter read high probabl shorter expect model environ current belief state robot entropi filter filter implement call entropi filter entropi distribut defin log entropi measur larger higher robot uncertainti entropi filter measur rel chang entropi incorpor sensor read belief denot measur sensor case singl rang chang entropi defin posit chang entropi incorpor robot neg chang certainti rhino entropi filter sensor measur entropi filter make robot percept highli consid sensor read confirm robot current belief novelti filter entropi filter make assumpt natur sensor data kind disturb expect dynam filter design proxim sensor detect addit obstacl environ filter call novelti select sensor read base measur assum reflect obstacl repres map proxim measur case detect measur shorter expect novelti filter remov proxim measur probabl higher threshold set shorter expect dn discret set distanc measur proxim sensor denot probabl measur distanc sensor detect obstacl map distribut describ expect distribut finder distanc obstacl shown dash line figur thrun discuss proxim sensor model deriv pn probabl shorter equat pn ji order deal situat posit robot absolut averag locat robot obtain probabl shorter pn pn select scheme novelti filter exclud measur pn differ filter entropi filter confirm current belief robot novelti filter forc incorpor sensor measur long result local entropi filter central compon robot deutsch museum bonn accur posit estim crucial distanc probabl distanc meter hour popul sparc popul time fig probabl shorter expect fig path robot dataset fig percentag noisi sensor measur obstacl robot sensor glass metal accur local obstacl avoid al markov local entropi approach led singl involv obstacl local error slightli larger safeti margin dai rhino approxim km averag speed approxim entropi filter novelti filter develop post base analysi report attempt prevent similar effect futur instal evid museum pure anecdot investig merit approach extrem condit interest local result environ popul robot suffer extrem error dataset dataset record differ amount disturb dataset collect hour robot robot meter data collect museum robot guid remot museum robot top speed limit dataset environ extrem robot move slowli figur show repres meter robot motion crowd period hour dataset collect peak traffic hour crowd dai entir exhibit collect robot frequent face situat illustr figur top speed dataset dataset consist log odometri finder scan collect robot move museum time stamp test conduct simul dataset dataset laser scan reader notic obstacl shown black figur detect reliabl figur show estim percentag corrupt sensor read time dataset dash line correspond dataset solid line illustr corrupt dataset half measur corrupt extend durat time number estim obtain analyz laser read obstacl repres map evalu local gener refer path independ run filter dataset small random determin locat sensor scan visual inspect made result refer locat correct accur order estim accuraci method select repres refer manual determin robot locat close care comparison sensor robot environ local popul environ seri interest compar local perform approach plain markov local entropi local novelti filter normal work condit tabl summar result obtain approach row percentag failur confid filter dataset posit estim consid estim locat deviat refer path approach work nice track robot posit empti museum exhibit neglig error filter entropi novelti track abil failur failur ii accuraci dataset ii recoveri rec rec ii tabl result tion result obtain challeng plain markov local fail filter techniqu show failur rate label averag euclidean error estim posit refer posit gap convent markov local approach larg reader notic accuraci filter techniqu higher grid resolut shed light question markov local perform poorli compar algorithm analyz sensor read method consid local figur small fraction endpoint measur incorpor robot belief figur illustr approach manag focu attent sensor convent markov local incorpor massiv amount corrupt measur filter show similar behavior figur approach produc accur result result demonstr approach scale popul dynam environ markov local recoveri extrem local failur kei advantag origin markov local techniqu li abil recov extrem local failur failur difficult global local robot detect current belief wrong global approach incorpor sensor data clear maintain abil recov global local failur experi normal oper condit lead failur method manual introduc failur data test robust method extrem experi robot random point time locat chang robot orient shift robot perturb introduc probabl meter robot motion incid make robot lose posit method test differ corrupt dataset result posit failur failur measur time method reloc robot correctli assum distanc estim posit refer posit smaller bottom row tabl summar result dataset rec repres averag time recov situat posit lost convent markov local extens novelti filter effici recov extrem posit entropi approach order magnitud effici result illustr fact sensor read process novelti approach recov effici extrem local error convent markov approach find specif interest light fact deutsch museum bonn filter led poor recoveri extrem failur experi suggest local algorithm novelti filter local robot crowd retain abil effici recov extrem local error paper approach global robot local demonstr reliabl local mobil robot extrem challeng dynam environ environ presenc dynam crowd peopl frequent block robot sensor approach base markov popular method mobil robot abil recov arbitrari failur local extend markov local approach filter sensor damag effect corrupt data reduc specif filter consid condit entropi select sensor account addit knowledg effect environ dynam approach essenti oper robot successfulli crowd museum comparison data collect demonstr techniqu paper superior local method result demonstr process sensor read approach distanc final cm certainti final final posit final posit distanc final cm certainti final distanc final cm certainti final final posit fig estim real path robot endpoint integr sensor measur entropi novelti filter retain abil recov global failur local addit test offic environ shown techniqu deal situat outlin environ world model case sensor read reflect furnitur successfulli filter result essenti oper mobil robot highli dynam popul environ fig outlin local environ includ furnitur specif result problem mobil robot filter entropi applic wider varieti state estim problem dynam environ filter make robot percept highli sensor read consid confirm robot current belief filter rest variabl estim repres sensor read sort corrupt authent measur applic filter failur problem address futur work aim analyz extent filter make robot robust sensor failur refer navig mobil system techniqu estim absolut posit mobil robot posit probabl grid proc nation confer artifici intellig interact museum robot nation confer artifici intellig markov chain stationari transit probabl springer publish passiv map learn visual place recognit phd depart comput yale hybrid avoid method mobil robot proc ieee intern confer robot autom activ markov local mobil robot robot autonom system accept public comparison scan match approach indoor environ proc euromicro workshop advanc mobil robot ieee comput societi press act discret bayesian model navig proc intern confer intellig robot system autonom mobil robot navig system proc spie confer mobil volum ed artifici intellig mobil robot mit press global consist rang scan align environ map autonom robot classifi recov failur autonom mobil robot proc nation confer artifici intellig robot ai magazin probabilist robot navig partial observ environ proc intern joint confer artifici intellig probabilist approach concurr map acquisit local mobil robot machin learn autonom robot
IR/1095 5 alert servic digit librari environ institut comput scienc universit germani abstract classic paradigm find inform www initi retriev ineffect techniqu consid automat deliveri content user filter profil interest requir current implement alert servic content provid side drawback research project evalu method techniqu alert servic special respect area digit librari intend provid framework support design build alert servic depend infrastructur desir system paramet introduct imagin morn arriv offic switch comput recent special field research pictur topic interest document arriv icon find instanc announc interest tabl content favorit scientif announc book field descript complet scienc fiction techniqu inform user interest event forc activ search inform quantiti scientif public doubl year urgent alert system system user inform document event interest varieti techniqu system exist softwar develop find solut system base simpl cdf channel detail survei section person alert servic ensur client notifi event interest interest client defin profil servic match event profil inform interest user subject alert servic close relat area event servic profil definit inform retriev research project evalu exist techniqu notif format method inform deliveri digit librari project free darwin serv testb alert servic evalu implement work close relat alert servic bmbf project global info close contact publish inform provid demand set problem exist common languag deliveri standard data deliveri exist suitabl applic space digit librari varieti techniqu model applic common set descript term definit incompar easi term alert servic aka notif servic aka select dissemin inform implement data deliveri servic exist implement alert servic programm varieti techniqu common set criteria valuat exist implement techniqu support design remaind paper structur section overview relat research topic exist dissemin technolog section outlin deriv open question research plan state work conclud section direct futur work discuss state art relat work applic domain project applic stock common weather report notif item digit librari travel inform system rang servic data dissemin reach awar servic event base infrastructur distribut control awar servic ensur actual repositori replica send updat librari catalogu updat delet book publish alert servic digit librari deliv notif event provid data alert servic greater number client person highli requir due testb darwin focu digit librari environ bibliograph alert servic profit servic ariadn offer client notifi document match profil arriv profil servic offer bibliograph sophist profil definit publish offer alert servic push content subscrib offer springer springer link alert elsevi content direct user subscrib select journal tabl content link email elsevi offer notif servic base web channel user topic keyword list subscrib journal control keyword notif chang channel content email desktop icon swet offer awar servic librari electron deliveri catalog updat subscrib librari defin interest profil bibliograph data profil isi alert servic offer institut scientif inform defin similar larg number offer side user miss import inform regist provid servic individu situat forc user train oneself servic provid defin special interest requir provid interfac tool send email full irrelev inform user tool modern technic possibl deal endless stream email notif function bound offer individu publish distributor inform provid combin person rare implement forc user give person data person compani mention servic profil match document sophist profil match document set problem lead instal mediat alert servic user subscrib access notif scheme provid servic unifi user client privaci protect architectur alert servic shown figur find cooper provid cooper provid notifi alert servic occurr event repositori uniform interfac client profil schedul provid queri interfac filter analysi notif notif repositori client profil repositori notif notif analysi filter schedul client profil uniform interfac schedul notif notif analysi filter alert servic alert servic provid directli regist client provid client figur architectur mediat alert servic provid offer notif wrapper implement queri provid repositori remain choic techniqu notif provid alert servic servic user interest problem publish maintain alert servic servic activ search inform user analyz page structur extern program search interfac provid agent technolog conceiv mobil autonom search provid inform document topic approach found profil project amalthaea gener digit librari project transport user profil document provid side expect faster vice versa match document profil happen provid side data transport avoid concept intellig mobil agent inform gather context inform retriev primari task agent retriev referenc document evalu defin special constraint digit librari environ constraint high number client intersect profil consid profil check evalu deliveri model system evalu deliveri model profil scheme design recent system network data dissemin substrat support applic varieti deliveri semant basic data deliveri collabor group commun part architectur maintain channel subscript servic publish data object attribut list attribut list match persist queri defin profil subscrib sift stanford inform filter tool user subscrib inform dissemin servic submit profil document transmit sift store central repositori publish forward document system system suitabl publish electron document journal provid support system dbi base inform infrastructur notif system gener classif architectur system implement broadcast disk system broadcast document satellit system mention siena event notif servic wide area network system mention exploit deliveri method infrastructur notif system implement deliveri model push adapt evalu restrict method underli techniqu design restrict due infrastructur technolog notif introduc techniqu implement alert servic corba event servic applic commun matter locat design object request broker establish relationship object client transpar invok method server machin network event servic decoupl process server commun asynchron client supplier push pull object activ platform implement alert servic main drawback current activ technolog action perform insid manag system invoc regist client softwar digit librari inform provid hold inform document user profil match newli enter document user profil hard imposs internet channel cdf open specif definit submit defin open industri standard data definit content push cdf technolog explicitli support person channel support provid implement perform schedul pull short valuat section compar evalu exist technolog serv platform alert servic step compar channel technolog event notif system alert servic build top event notif servic distribut control mechan devic monitor conceiv techniqu corba event notif java distribut event messag servic underli model servic differ condit found digit librari environ event consid model belong object limit number state event defin state transit context digit librari event state transit repositori object interest journal part work develop clear definit similar inequ model order make compar languag standard area digit librari found standard alert servic import standard mention type servic low level method rmi distribut protocol gener event notif architectur base event notif protocol due restrict express suitabl digit librari context approach found standard internet xml prime candid notif deliveri languag drawback critic evalu op protocol support simpl person filter servic discuss languag protocol notif internet begun contribut experi applic field influenc upcom goal develop demand common notif protocol languag base research work cooper publish global info project choic profil definit languag profit experi inform retriev contrari retriev alert servic user defin inform document set chang constantli approach set profil featur defin distinguish type set identifi journal list keyword select arbitrarili thesauru alert set predefin group scientif queri retriev support relev feedback document queri document addit data document match time content notif hyperlink abstract complet profil languag cover give measur power languag plan state work research research project divid survei exist notif architectur model definit special requir digit librari environ classif techniqu implement alert servic order find criteria support design classif consist number term provid criteria give qualiti term classif deliveri method synchroni asynchroni locat profil stateless store client candid term criteria profil definit simpl keyword profil full fledg queri filter scalabl number document particip compar implement alert servic base technolog techniqu implement evalu mobil agent evalu implement measur base found criteria defin testb defin set document measur test condit develop implement servic includ darwin project test exist environ real data valuat result depend result design framework develop framework support develop techniqu implement alert servic constraint exist techniqu fulfil requir digit librari environ recombin technic structur analyz valuat influenc notif languag protocol start research year ago literatur research area alert intend explor exist technolog implement system time darwin project start contact publish global info establish project plane finish year work move forward step order unifi method techniqu found literatur research work common model notif servic item method model intersect notat found notat definit brought cooper model exist model describ abstract level unifi parallel theoret research implement part start notif servic channel definit format implement darwin project work addit person featur implement java servlet result valuat cdf support cooper provid implement notif provid channel mediat cdf support definit addit keyword metadata addit administr notif content data base notif inform number import event posit depend desktop notif work workstat user subscript email notif wider channel cdf small number extend notif channel addit inform filter addit simpl cdf channel easi implement provid offer restrict rang possibl sophist person exist implement client softwar internet explor techniqu hard evalu interf implement realiti step implement independ cdf client result research project provid support design alert servic internet applic special emphasi digit librari area notif servic model event notif exist contribut common model notif servic opportun compar techniqu classifi criteria classif internet base servic scalabl deliveri commonli commonli defin term push depend abstract method call push thesi provid set classif criteria valuat implement alert servic criteria base hand theoret model demand provid user develop criteria techniqu made compar develop design tool support implement aspir refer zdonik balanc push pull data broadcast buneman sigmod acm sigmod intern confer manag volum sigmod san brandt ander web push internet notif servic talk held workshop push septemb septemb antonio architectur event notif servic scalabl network phd politecnico di decemb channel definit format technic submit march alert digit librari environ channel meet technic report number free lc spiliopoul build wrapper queri publish site peter research advanc technolog digit librari european volum lectur note comput scienc franklin zdonik framework scalabl system acm sigplan confer objectori program languag applic volum sigplan oct craig knoblock jo lui ambit agent inform gather krishnamurthi david rosenblum gener system transact softwar gr subramanian distribut substrat internet applic usenix symposium internet technolog decemb volum inform retriev inform infrastructur mouka inform discoveri filter multiag evolv ecosystem confer practic applic intellig agent hiroshi technic aspect gener digit librari project intern symposium develop practic digit tsukuba scienc novemb loss good tradit journal intern journal sift tool inform dissemin usenix technic confer unix advanc comput confer page jan usenix usa van van der weid retriev engin dj page april robert gordon ariadn object manag corba event specif digit librari project fu berlin elsevi content direct elsevi scienc channel global electron inform system natur scienc engin innov programm bmbf alert research alert direct london parallel applic london centr high perform comput open profil standard platform privaci prefer springer link alert
IR/1096 5 incorpor qualiti metric inform retriev world wide web zhu susan gauch depart electr engin comput scienc kansa contact inform dr susan gauch snow hall dept eec kansa ks abstract inform retriev system internet reli primarili similar rank algorithm base sole term frequenc statist inform qualiti lead problem document retriev regard qualiti present approach combin similar rank qualiti rank central distribut search environ qualiti includ investig search effect significantli improv ratio page metric incorpor central search improv metric incorpor site select incorpor popular metric inform fusion result improv result show incorpor qualiti metric gener improv search effect central distribut search environ inform distribut merg search synthesi research partial support nsf career award primari author full time student present paper accept paper elig student paper award introduct web search engin root inform retriev system origin develop manag inform librari inform sourc system carefulli tend compar qualiti retriev algorithm develop regard qualiti inform sourc qualiti control web page creat inform qualiti vari wide internet inform retriev system appli web search account qualiti web content paper explor varieti automat calcul qualiti metric evalu abil improv search result relat work inform retriev system classifi broad categori base distribut central inform retriev system typic requir document resid local singl site queri handl site distribut inform retriev system user simultan access document collect distribut multipl remot site central qualiti individu page compar retriev process distribut qualiti metric calcul collect augment queri broker result fusion central search typic central search system maintain search fetch document singl site document rank determin term distribut statist regard document qualiti typic formula tf ij idf calcul weight queri term tf ij frequenc term document idf calcul number document total number document term collect central search system inform qualiti form document popular approach calcul popular metric count number link point page similar approach googl calcul pagerank web page web page high pagerank page high pagerank link approach calcul popular observ user behavior web search engin direct hit track result link click user long user stai site inform popular metric examin page distribut search distribut inform retriev system perform task site queri select merg search result site site site inform fusion import issu distribut search environ goal site select direct queri site potenti answer process guid summar content site site overlap queri identifi inform rank stop content summari site repres document profil site pearc list token repres content site al list pair site similar matric produc corpu linguist analysi distribut rank assign document collect compar rank collect due size collect rank algorithm emploi retriev effect sever degrad collect simpli order rank techniqu merg inform develop construct distribut inform retriev system approach inform fusion find number document select collect maxim total number relev document approach inform fusion weight score base collect collect assign score base final score document determin score return collect weight collect fan qualiti metric critic issu evalu qualiti web page select qualiti criteria criteria investig research select base criteria web site provid rate internet scout lyco top argu www virtual librari group magellan site internet public librari review rate system identifi metric qualiti popular select wide amen automat recent web page updat number broken link web page proport inform web page size reput organ produc web page web page cite web page content page topic research approach section decid object wai obtain qualiti metric section describ metric individu page metric accumul summar qualiti entir web site qualiti web site calcul inform metainform queri rout inform fusion measur qualiti web page qualiti metric chose measur currenc measur time stamp modif document avail calcul number broken link page divid total number link ratio comput total length token preprocess divid size author author web page base yahoo internet life review assign score rang review site web site site review author assum popular number link point web page measur popular web page inform link point web page obtain altavista site determin close relat major topic web page section measur metric base categor web page topic refer ontolog vector space classifi refer ontolog node download magellan site topic ontolog web page attach topic train document concept train document concept vector space index creat vector concept ontolog calcul cosin similar measur vector repres web page classifi vector repres refer ontolog return top match topic weight match web page determin distribut top match topic refer ontolog close relat top closer topic refer ontolog higher formula calcul web page set xx maximum number top match topic request minimum number match topic length share path topic divid height ontolog formula reli topolog distribut match topic ignor weight match experi section formula includ match xx wij wij sum weight topic construct site metric previou section relev individu web page evalu effect qualiti metric distribut inform summar site repres augment concept refer concept quantiti qualiti valu calcul metric site calcul quantiti metric web page site summar classifi top relev topic ontolog approach previou section match weight document classifi concept accumul determin quantiti inform relat concept site studi inform quantiti measur augment inform qualiti metric shown tabl site includ inform quantiti relat topic ij currenc ij avail ij ratio ij author ij popular ij qualiti topic produc sum qualiti measur web page categor topic site individu topic distribut quantiti weight ontolog site determin tightli distribut top match calcul formula section qualiti topic id quantiti currenc author popular tabl site central inform search goal develop search algorithm incorpor quantiti qualiti metric match process queri match process return similar rank tf idf section qualiti metric evalu metric combin final score web final score document normal score return search normal qualiti metric includ weight repres import qualiti metric central search weight qualiti metric improv made incorpor qualiti metric comput section divid sum improv made incorpor qualiti metric central search site select goal research quantiti qualiti base rout queri site process inform qualiti incorpor equat calcul score queri rout top score mean inform popular site top topic relev site weight repres import qualiti metric site select weight qualiti metric comput section improv made incorpor qualiti metric divid sum improv incorpor qualiti metric site select inform fusion simpli merg result base score return search site sever degrad search effect score web page local site adjust good measur site present user good site determin inform quantiti inform qualiti mean inform popular site topic relev site weight repres import qualiti metric inform fusion weight qualiti metric comput section improv made incorpor qualiti metric divid sum improv incorpor qualiti metric inform fusion score document return site adjust incorpor qualiti metric site evalu evalu abil qualiti metric improv search effect queri document queri inform fusion establish baselin perform task tradit evalu perform qualiti metric turn qualiti metric combin qualiti metric found significantli improv search resourc twenti target site topic gener select base review download page site vari base review forti queri select queri record log file similar site queri select relev topic queri length vari term averag term queri result retriev algorithm pool present human subject random order creat testb queri result relev judgment subject particip judg web page provid judgment depend document relev queri experi introduc set experi result design test effect qualiti metric combin central site inform qualiti metric central search document download web site combin singl collect baselin search effect obtain qualiti metric consid search effect measur top search result test differ pair alpha set statist probabl erron declar pair experi hypothesi search effect central search improv retriev enhanc qualiti metric turn combin qualiti metric weight qualiti metric set weight qualiti metric set qualiti metric weight incorpor qualiti metric calcul improv made incorpor qualiti metric divid sum improv made incorpor qualiti metric individu weight qualiti metric incorpor set varianc weight web page top topic small formula ignor match weight result tabl summar result qualiti metric experi central search result tabl sort magnitud improv column improv statist central search guid inform quantiti qualiti row list result obtain inform quantiti currenc metric incorpor central search obtain incorpor ratio metric similar rank significantli higher baselin search effect produc incorpor author popular metric subject higher differ statist condit improv quantiti metric tabl effect inform qualiti metric central search obtain incorpor qualiti significantli higher obtain incorpor qualiti metric suggest incorpor qualiti metric significantli improv system effect produc worth note incorpor qualiti metric incorpor qualiti metric significantli improv search effect compar singl qualiti except improv made incorpor ratio significantli made incorpor qualiti indic ratio plai import role improv effect central search qualiti metric site select queri classifi concept refer ontolog classifi web page site assign score determin inform quantiti inform qualiti base topic top site select queri search effect obtain site select guid inform quantiti baselin base result experi document rank central search determin inform quantiti qualiti metric final result list produc simpli sort score return multipl site experi hypothesi search effect collect site improv site select enhanc qualiti metric turn combin method equat calcul score site qualiti metric weight qualiti metric set weight qualiti metric set qualiti metric weight incorpor qualiti metric calcul improv made incorpor qualiti metric divid sum improv made incorpor qualiti metric weight qualiti metric incorpor set result result summar tabl obtain incorpor popular significantli higher baselin incorpor currenc author produc higher differ produc incorpor weight distribut match topic metric includ weight distribut improv suggest weight distribut topic plai import role calcul varianc weight web larg condit improv quantiti weight metric weight tabl effect inform qualiti metric site select obtain incorpor qualiti includ popular site select obtain incorpor qualiti metric suggest leav metric site select hurt search effect note combin qualiti metric significantli improv search effect obtain incorpor qualiti metric site select obtain incorpor individu suggest incorpor qualiti metric produc result good produc incorpor combin qualiti metric inform fusion base result experi central search guid inform quantiti combin qualiti metric central site select guid inform quantiti popular metric site select baselin obtain inform fusion guid inform quantiti experi hypothesi search effect inform fusion improv retriev enhanc qualiti metric turn combin method equat calcul good site qualiti metric weight qualiti metric set weight qualiti metric set qualiti metric weight incorpor qualiti metric calcul improv made incorpor qualiti metric divid sum improv made incorpor qualiti metric weight qualiti metric incorpor set origin equat result result summar tabl popular qualiti metric significantli improv search effect inform ratio improv margin obtain incorpor popular ratio metric significantli obtain incorpor qualiti metric suggest leav metric inform fusion hurt search effect condit improv quantiti weight determin site metric tabl effect inform qualiti metric inform fusion obtain incorpor popular ratio qualiti metric inform fusion significantli obtain incorpor ratio metric popular individu suggest incorpor qualiti metric produc result good produc incorpor combin discuss qualiti metric improv search effect incorpor central search effect produc author popular metric singl metric ratio improv result qualiti metric combin improv baselin achiev suggest qualiti inform extrem import central search incorpor qualiti metric site made improv search effect effect produc currenc author metric singl metric metric improv combin multipl qualiti metric improv result achiev individu metric data collect inform fusion experi show improv made popular metric improv fairli minor site select process work qualiti variat select incorpor qualiti metric inform fusion author metric impact central site inform fusion author metric relat search effect author rate accur ratio qualiti metric improv search effect incorpor central site select inform fusion consid qualiti metric central distribut search futur work inform qualiti metric test experi subset criteria import inform qualiti grammar html tag error give clue qualiti web page log file server provid rich resourc inform exploit number time page serv estim popular site addit link count refer altavista anatomi hypertextu web search engin inqueri retriev intern confer expert system septemb argu rate system statist properti text creat ieee metadata confer april select architectur network inform workshop network inform retriev direct direct agent inform gather distribut inform aaai symposium intellig agent cyberspac stanford agent conceptu search world wide web techniqu fund nation scienc award number corpu analysi approach automat queri extens multipl acm transact inform system stanford internet retriev search zobel distribut inform intern confer distribut comput relev hyperlink vector workshop network inform retriev juli lyco lyco magellan magellan experi dynam hypertext environ degrad multilingu journal american societi inform scienc april scout internet scout project scout scout report select criteria queri rout search report distribut collect fusion strategi inform annual machin learn lake juli merg strategi search public privat workshop network inform juli zdnet web site map inform acm confer inform knowledg manag
DB/1097 3 filter algorithm implement fast system jacobsen francoi jo ao pereira kenneth ross denni shasha abstract paradigm user express interest agent event job softwar send event owner subscript sati ed event user subscript consist interest airplan exce price publish event consist er airplan properti includ price subscript consist conjunct comparison predic subscript close resembl trigger condit queri action inform gener trigger data structur implement enabl creation high perform publish system paper describ attempt construct algorithm implement combin data cach queri process system handl event typic workload million subscript problem descript human inform web ten year web chang inform yahoo sourc current world event inria work pereira partli support fellowship program praxi xxi columbia work ross partli support grant unit state nation scienc foundat courant institut mathemat york work shasha partli support grant unit state nation scienc foundat permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee acm sigmod santa usa copyright acm print newspap reason point system captur chang inform notifi user interest event search decid alert item cheaper food conveni market alert user bene system desir alert item match desir met tool implement function scalabl ecient manag million user demand noti cation handl high rate event million notifi interest user short delai provid simpl express subscript interfac ecient cope high volatil web user demand user user york california hour ight model system system manag stream incom subscript stream incom data item subscript event time interv consid valid system store valid subscript valid event complementari subscript system evalu subscript valid event event system identi es subscript match event send event interest user describ system support million subscript high throughput incom event event problem support high rate subscript event match problem subscript system collect predic tripl consist relat oper event conjunct pair consist attribut pair attribut event event pair match subscript predic match share attribut event sati es subscript predic match pair event sati es match problem en event set subscript subscript sati ed notat rest denot set equal predic repres set attribut occur equal predic subscript movi trigger approach examin system perform subscript match directli tradit system scale million subscript high event throughput system design fast evalu queri store data set er trigger function check subscript item valid data item store singl tabl form attribut subscript de ned sql trigger subscript implement sql trigger creat trigger insert referenc row row begin end manag million subscript system support million trigger singl insert data item execut million trigger make solut system implement optim techniqu trigger execut project global optim techniqu trigger execut solut close spirit data exact natur data structur di erent contribut paper present ecient main memori match algorithm match subscript handl larg number volatil subscript support high rate incom data item event algorithm nice creat data structur tailor complex subscript languag schema essenti ensur scalabl trigger algorithm cach maxim tempor spatial local techniqu avoid cach miss processor prefetch command match algorithm schema base cluster strategi built main group subscript base size common conjunct equal subscript evalu singl comparison hash index subscript attribut evalu singl comparison provid algorithm knowledg subscript statist incom data item comput increment adapt optim cluster subscript data item pattern experi algorithm show support million high rate event event high rate subscript section gener descript match algorithm section present approach comput optim cluster section present adapt algorithm deal subscript event pattern section present relat approach algorithm section present perform studi section conclud solut overview main memori algorithm emerg cheap comput larg random access algorithm run main memori access secondari memori pc processor small cach processor cach memori static ram memori hold data recent referenc run program insid cach memori refer process processor speed refer found call requir fetch cach block main memori higher cost cpu cach miss occur processor idl fetch perform cach miss sever program perform main memori algorithm perform sensit number instruct cach behavior main trend ram size processor speed grow exponenti processor cach size linearli main memori algorithm sensit processor cach behavior processor cach manag polici simpl evid process cost modern processor provid prefetch command permit run program forc fetch cach block speci ed posit actual prefetch comput continu program predict advanc cach block avoid cach miss prefetch cach block instruct limit cach miss design algorithm index predic cluster list refer vector detail cluster predic line subscript bit vector map list cluster list cluster figur algorithm data structur awar tempor spatial local spatial local achiev data consecut algorithm consecut memori address tempor local achiev data manipul consecut instruct paper match algorithm speci calli design cach consciou lot match algorithm literatur awar cach behavior match algorithm algorithm data structur depict figur recal subscript de ned identi er set predic form comparison event set pair algorithm set predic bit vector vector refer subscript cluster call cluster vector algorithm index comput set predic sati ed incom set cluster relev event index predic occur subscript singl entri predic bit vector entri serv repres result predic evalu set predic sati ed event predic refer list subscript cluster access predic subscript cluster list predic access predic subscript match event veri es subscript cluster list check sati ed insid cluster subscript group subscript cluster size figur detail descript subscript cluster subscript predic check subscript cluster subscript size organ consist collect arrai call predic arrai refer bit vector entri arrai call subscript line subscript identi er entri predic arrai bit vector refer predic subscript identi er store posit subscript line subscript match event bit vector entri referenc column predic arrai equal event instanc global set index bit vector set subscript cluster local candid set cluster set subscript candid predic index predic reach refer bit vector access predic cluster list lc candid candid lc subscript match cluster candid cluster return figur event match algorithm event match algorithm depict figur algorithm execut time event predic bit vector initi algorithm consist step rst step index comput set veri ed set entri predic bit vector collect list cluster veri ed access predic step consid candid cluster appli cluster match algorithm comput match subscript cluster match cluster match algorithm special group subscript predic collect similar method special small number current ten fewer gener method deal subscript predic gener method time consum addit loop subscript small number gener code call import featur algorithm notic subscript store subscript entri separ subscript arrai reason choic improv data local loop subscript partit loop unfold chosen unfold arrai entri cach line end execut prefetch instruct prefetch subroutin implement directli assembl languag prefetch cpu copi ram cach cach line full arrai process futur lookahead chosen data arriv cach cpu readi process data transfer mean overlap comput data transfer cach storag mean entri consult condit test consult entri case avoid cach line arrai storag method forc touch cach prefetch pai avoid read cach line reason cach line made cach time processor limit number simultan outstand cach request pentium limit processor reserv drop prefetch instruct limit prefetch instruct essenti correct prefetch cach line make cach access fewer cach ect drop prefetch instruct reduc larger number found empir pai prefetch arrai prefetch instruct compet limit avoid prefetch arrai frequent consult arrai prefetch algorithm analysi section rst analyz properti approach term memori cach match time subscript discuss problem design cluster introduc section space space cost linear number size bit vector equal number distinct predic subscript store singl cluster bit vector refer predic total size subscript cluster linear total number predic addit space index hash index equal predic simpl inequ space cost index linear number distinct predic cach term tempor entri bit vector check time match process bit vector small number predic resid processor cach spatial local simplic code assum number subscript multipl unfold small separ piec code deal remaind subscript achiev put close cluster subscript check independ predic match subscript match optim main memori data structur predic test size criteria number group subscript organ cluster integ arrai asynchron prefetch oper cluster match algorithm order reduc number cach directli ect time match subscript group cluster list access predic subscript cluster list match event verifi cluster list access subscript access predic veri ed check perform challeng de ne access predic incom event match minim number cluster section cost base approach comput optim cluster simpl equal predic conjunct equal predic access predic insert delet algorithm ad subscript system similar event match algorithm consist phase algorithm insert predic predic index algorithm access predic insert cluster cost insert algorithm close event match cost delet made fast maintain subscript identi er cluster cost insert ad delet subscript make obsolet cient optim cluster event pattern degrad perform section present adapt algorithm maintain local optim cluster support high rate subscript incom data item schema base cluster schema base cluster consist group subscript term common conjunct equal predic access predic hash subscript cluster set subscript cluster instanc cluster access set hash tabl call hash con gurat tabl con gurat set call access cluster predic schema hash gurat cluster instanc set tabl cluster tabl entri referenc lter event schema match incom event incur lookup hash tabl con gurat schema includ schema remain tabl access collect subscript independ distribut attribut index updat predic system mention subscript attribut valu attribut probabl million subscript subscript equal condit nonempti subset cg million subscript equal predic attribut cluster instanc involv access predic simpl equal predic subscript mention attribut equal cluster distribut popul access hash tabl million subscript cluster subscript involv access predic simpl predic conjunct equal predic ab bc subscript ac uniformli distribut subscript abc uniformli distribut ab bc hash tabl popul million size cluster cost match event mention consult cluster total cost hash tabl lookup subscript check consult ab total cost hash tabl lookup subscript check base expect cluster instanc prefer kind event event match cost algorithm main cost comput predic bit cost comput refer relev cost check set access subscript gener build cluster instanc set cost sensit subscript problem ecient cluster section describ approach comput optim cluster match algorithm choic cluster base cost function statist subscript event section organ rst de ne notion access hash con gurat cluster instanc give match cost space cost incur match set subscript cluster final pose cluster problem term minim match cost space search space greedi algorithm produc local optim solut cluster access predic de ned conjunct equal predic access predic de ned pair id identi pred set equal predic di erent attribut set attribut occur pred call schema access predic hash con ap set access predic order test predic incom event hash structur hash structur intend check predic schema hash structur set access predic de ned pair set attribut call schema hash function event return identi er access predic sati ed call hash con gurat set access predic ap set hash structur hn ang denot set schema access predic ap set schema call schema con gurat cluster set subscript group access predic subscript cluster de ned tripl id identi access set subscript subscript predic occur cluster instanc set cluster subscript subscript cluster write denot cluster subscript ap denot set access predic cluster access predic ap write denot set cluster access predic cluster di er size de ne hash con gurat hash con gurat entri predic ap match cost cluster assum set cluster instanc hash con gurat cost match event includ cost retriev relev index hash cost relev cost check access subscript event cost idx idx cost retriev probabl incom event schema includ schema cost run hash function probabl event satisfi access predic check cost cluster total cost check subscript cluster set access predic cost account fact group predic remain predic check assum cost retriev relev index linear number structur hash con gurat hash cost independ size hash structur linear size schema hash cost check set subscript linear number subscript assumpt consist implement assumpt lead simpli ed cost repres number index size schema kr ch kh repres cluster access predic space cost cluster space cost cluster instanc hash con gurat includ cost store hash cost store cluster space cost initi space creat empti hash space manag entri access predic hash structur size cluster data structur cluster section size equal repres constant comput cluster instanc set subscript problem cluster instanc minim cluster check cost depict constraint total space occupi subscript cluster hash structur amount space exhaust algorithm examin cluster instanc algorithm build cluster instanc pick predic group subscript match cost space number cluster instanc examin exhaust algorithm jp number equal predic averag number equal predic subscript repres number subscript complex make exhaust algorithm greedi algorithm worst case complex repres number set attribut group occur subscript repres cardin number bound jaj denot set attribut occur equal predic algorithm start cluster consist group subscript simpl equal predic access predic equal predic access predic incur addit hash cost hash structur de ned predic test phase global match algorithm improv initi cluster de ning addit hash tabl addit tabl chosen increment step step step bene function decid hash tabl add bene function base notion cluster instanc hash gurat schema rst explain give bene function describ algorithm algorithm produc local optimum result section show match time improv realiz algorithm cluster instanc hash con gurat set hash gurat schema set cluster instanc hash con gurat schema call cluster instanc cluster instanc match cost cluster instanc cluster instanc built iter subscript predic access gp minim match cost formula show cluster instanc hash con gurat schema di er total check cost line denot cluster instanc denot cost cluster instanc denot space cost bene addit hash set hash con gurat schema match bene ad hash structur schema respect denot de ned space cost ad denot de ned bene unit space ad hash structur schema bene unit space nite match bene posit ds space greedi algorithm input set space bound return hash con gurat schema cluster instanc ts set space bound ga attribut involv equal predic sg schema ga schema maximum posit bene unit space wrt exist end return dynam cluster goal cluster minim number subscript check static approach present cluster global knowledg subscript system knowledg statist incom event stream subscript event pattern chang degrad initi optim cluster cope problem rst solut consist period recomput scratch cluster instanc adapt situat due complex solut suit applic subscript event pattern stabl larg time interv static approach pattern evolv continu section describ dynam cluster algorithm increment adapt cluster subscript event pattern algorithm dynam decid redistribut subscript cluster pro tabl delet hash tabl redistribut subscript creat hash tabl tabl creat reli metric call cluster bene hash tabl bene cluster redistribut bene margin high hash tabl creat bene sucient high remov bene small cluster bene bene margin number check save cluster instanc access predic cluster subscript bene margin equal pc access predic maxim group equal predic probabl incom event sati es pc superset pc bene margin cluster note de ned sum bene margin subscript equal rst approxim de ne size cluster hash tabl bene bene hash tabl note averag number check save hash tabl bene equal ji number subscript hash tabl averag number subscript access hash tabl access rst approxim de ne mainten algorithm mainten algorithm threshold cluster redistribut bene margin hash tabl creat bene remov bene bene margin cluster insert subscript select access predic bene hash tabl subscript delet implement metric updat period number subscript number incom event mainten algorithm call time metric updat gure depict part algorithm react chang bene margin cluster input set exist hash tabl set potenti hash tabl maintain potenti tabl set candid cluster subscript move algorithm act bene margin rst step call procedur cluster distribut redistribut subscript exist tabl updat bene metric potenti hash tabl algorithm consid tabl bene reach creat popul redistribut candid cluster function cluster distribut work redistribut subscript exist hash tabl minim probabl subscript check subscript equal predic attribut initi hash tabl schema move hash tabl schema bc redistribut cluster margin excess function consid creat hash tabl consid potenti tabl receiv subscript add set candid increment bene ts bene exist hash tabl drop threshold mainten algorithm simpli redistribut subscript exist tabl shown mainten current cluster hc hash tabl set hash tabl creat ph set potenti hash tabl candid cluster set pair belong ph cl set cluster bodi cluster excess bene margin cluster ph ph fhg foreach cluster cluster end bodi cluster foreach subscript hash tabl minim move mark foreach tabl ph delet mark od redistribut improv bene margin foreach subscript mark foreach tabl ph add mark od cost maintain hash mainten cost proport number subscript move subscript arriv insert algorithm hash tabl absolut bene move hash tabl lifetim insert event statist bene margin cluster trigger creation hash tabl choic threshold valu uenc number move uenc number hash tabl creat uenc number candid cluster hash tabl section studi perform mainten algorithm term improv match cost mainten cost relat work lot main memori match algorithm context content base system trigger system stand dissemin basi algorithm main techniqu rst consist phase algorithm test predic rst comput match subscript result rst step phase algorithm cite count algorithm step count algorithm consist subscript number number sati ed predic achiev algorithm maintain associ tabl give subscript occur time predic sati count subscript increment system user subscrib text document set weight keyword match document discov base techniqu close count approach system handl subscript written xpath xml document enforc xml ltere convert xpath queri nite state machin react xml event algorithm perform improv index techniqu limit number fsm execut document algorithm simpler subscript consist conjunct predic match algorithm pereira al similar approach algorithm work improv approach hash dynam cluster techniqu consist compil subscript predic test network ala network tree intern node repres test leav network refer subscript event enter network root network test intern progress node node node test succe event successfulli sati ed test path reach leaf obtain refer match subscript subscript leav leaf rst case incom event follow path tree gener follow path rst solut ecient space consum algorithm system compar phase algorithm su er drawback poor tempor spatial space test network data structur complex costli maintain respect insert updat make solut suit high rate subscript trigger develop permit user noti ed occur evalu condit combin predic incom event predic current state make imposs system scale million queri check million complex condit state time event modi es state scalabl xml continu queri studi scalabl trigger studi case algorithm work rst ltere step content incom event order select condit candid complet evalu candid condit evalu global optim techniqu discrimin ltere amount comput evalu step select signatur select predic equal chosen initi select perform ltere step sophist consist conjunct equal predic signatur index techniqu improv ltere equal predic algorithm work conjunct equal inequ predic event content enhanc ltere phase permit power event ltere equal inequ predic subscript algorithm entri point common queri plan check condit ltere limit equal predic cost base algorithm improv perform index con gurat perform experi section show index con gurat consist simpl equal predic consist systemat maxim conjunct equal predic show cost base algorithm approach con gurat perform evalu section evalu perform algorithm compar ect cluster strategi version simpl propag algorithm singl equal predic access predic evalu ect prefetch command section compar implement propag propag prefetch propag wp static dynam algorithm cluster strategi advantag conjunct equal predic static algorithm cluster built static cost base algorithm depict section dynam algorithm cluster increment maintain mainten algorithm depict section algorithm implement prefetch final comparison relat work implement count algorithm section system algorithm implement system prototyp system evalu simul account subscript event emit system setup ran experi pentium workstat cpu ram oper linux system run process workstat wait subscript event process implement workload gener workload speci emit subscript event system workload gener task ran separ process workstat system subscript event emit system batch batch size set workload speci cation subscript event drawn randomli workload speci cation determin attribut requir attribut subscript call attribut subscript set predic xed set subscript attribut common attribut subscript workload speci es total number subscript gener ns batch size ns determin number subscript submit system number predic subscript np number predic xed subscript np fix np np np fix number predic respect predic workload speci cation predic determin domain cardin domain determin valu predic speci ed lower upper valu drawn govern uniform distribut predic drawn prede ned set attribut set attribut draw attribut event total number determin set di erent lower upper bound predic domain simul subscript predic data skew refer subscript event determin number event gener ne batch size event submit system ne number attribut pair event na determin lower upper ua valu drawn uniformli distribut domain experi interv posit integ domain set di erent lower upper bound attribut domain simul event attribut data skew refer event tabl summar workload speci cation paramet valu experi time millisecond workload gener start event subscript submit system process end system respond system respond event submiss noti cation id match subscript time includ commun time individu time account process entir batch subscript event submit paramet descript rang global paramet total number predic attribut subscript predic determin paramet ns total number subscript number subscript ns submit system np number predic subscript np fix number predic xed subscript limit domain predic predic event determin paramet ne number event number event ne submit system na number attribut pair event ua limit domain attribut tabl paramet de nition rang valu ran experi multipl time notic signi di erenc result report varianc lower run repeat experi total system throughput system scalabl seri experi assum publish system subject larg number subscript stai system long system handl high rate event basic assumpt design match algorithm repres kei requir system oper experi measur event memori size subscript load time system di erent match algorithm figur compar system throughput algorithm workload speci cation np na ns ne workload figur dynam algorithm show count algorithm perform perform propag algorithm li prefetch techniqu appli implement propag algorithm improv perform factor larg number subscript event throughput system load subscript con time spent comput predic veri ed event ms time algorithm match time ms number subscript match process time event count propag dynam match process time ms number subscript match process time event dynam dynam np np fix ns vari np np fix ns vari memori byte number subscript resid memori size count propag dynam time ms number subscript subscript load time count propag dynam static np np fix ns vari np np fix ns vari figur event match process memori resid size subscript load time comput sati ed predic method comput match subscript sati ed predic ms dynam method ms propag instanc predic match perform improv highli optim index structur predic domain primari goal highli optim subscript match techniqu notabl featur dynam algorithm fact match time independ number subscript nice behavior ensur dynam creat hash tabl size cluster larg ran experi compar dynam static algorithm static algorithm produc cluster instanc similar obtain dynam algorithm addit hash signi cantli beat dynam algorithm show metric dynam algorithm provid good approxim cluster bene ts figur compar system throughput dynam algorithm propag prefetch algorithm di erent kind oper predic workload speci cation set np np np xed predic equal chosen freeli predic ns np np np fix np xed predic equal list valu di er workload speci cation sen freeli predic result show algorithm sensit predic perform constant factor predic process number sati ed predic comput rst phase algorithm greater predic gener workload perform di erenc algorithm equal due fact algorithm cluster propag algorithm handl predic algorithm bit vector entri inequ predic subscript check equal predic veri ed algorithm test similar subscript workload probabl situat perform gain dynam algorithm due improv handl equal predic hash tabl figur show memori util subscript load algorithm individu graph follow natur intuit process time memori due data process storag term memori propag algorithm intern data requir amount close count dynam algorithm requir dynam algorithm memori subscript load time figur smallest count deploi simpl event maxim throughput time hour event dynam strategi strategi event maxim throughput time hour event dynam strategi strategi chang subscript schema ad subscript event skew figur evolut event throughput vari condit data highest static static comput scratch optim cluster gurat compar static dynam algorithm improv load time signi cantli reorgan increment intern data structur process suit subscript encount addit result match perform obtain increment comput cluster good obtain static algorithm adapt subscript updat real world system deploi internet subject constant stream subscript updat modi event subscript event chang structur content distribut time similar pattern neighbor element stream observ subscript event chang term predic domain dynam match algorithm aim handl condit order studi adapt behavior comparison algorithm context simul condit set experi experi situat system handl concurr incom event high rate incom subscript assum subscript live time hour subscript rate subscript insert system process roughli million insert ag subscript begin delet system system reach number delet balanc number system reach equilibrium experi investig behavior algorithm system equilibrium experi system rst popul million subscript workload speci cation state remov subscript oldest insert hr insert subscript system manag insert delet remain time tick send event system measur number event system handl remain time measur system evolut applic scenario subscript event pattern chang rst experi depict figur investig impact subscript schema experi model situat subscrib subject interest chang time start workload ns np np na ua subscript focu attribut system event provid uniform valu attribut equilibrium cluster con gurat optim rst hour subscript event workload insert subscript workload similar attribut address hour system reach stabl state subscript system continu run experi hour insert delet subscript figur show evolut averag event throughput time averag compar opposit strategi cluster dynam strategi dynam algorithm adapt cluster subscript creat hash tabl chang strategi chang initi cluster con gurat figur show chang strategi vulner perform degrad subscript schema chang end test period event throughput half hand dynam strategi adapt cluster situat hour subscript pattern stabl system handl event event chang strategi transit dynam algorithm perform irregular due addit mainten cost occur hash tabl creat cost quickli match bene tabl make dynam strategi chang strategi time experi depict figur investig impact subscript skew combin event skew experi model situat area interest subscrib publish typic exampl dissemin dai elect candid inform publish subject model phenomenon design experi start workload ns np np na ua equal predic attribut valu uniformli distribut valu rst subscript event follow workload hour creat event skew subscript skew event subscript insert workload similar skew di erent valu attribut valu predic xed attribut subscript hour system reach stabl state subscript system run system hour insert subscript figur show evolut averag event throughput time dynam chang strategi figur show chang strategi prevent perform degrad skew subscript system end test event throughput reduc hand dynam strategi adapt cluster situat end subscript pattern system manag throughput begin transit phase cost maintain cluster remain slightli compar match bene match bene obtain cluster reorgan overcom mainten cost paper main memori algorithm ltere event content respect conjunct comparison predic algorithm nice algorithm cach maxim tempor spatial local techniqu avoid cach miss processor prefetch command algorithm schema base cluster strategi order minim number subscript check subscript cluster access multiattribut hash cluster strategi base cost model comput optim hash con gurat cluster statist incom event dynam algorithm creat remov cluster hash tabl dynam set subscript modi ed insert event pattern chang perform studi show algorithm support million high rate event hundr event workload million high rate subscript ltere algorithm implement system ecient support subscript languag consist disjunct normal form due subscript event subscript match end experi incur addit cost cluster reorgan condit event algorithm ecient ltere modul power system sql trigger continu queri refer chandra match event subscript system eighteenth acm symposium principl distribut comput michael franklin ecient ltere xml document select dissemin inform vldb antonio david alexand wolf achiev express scalabl event noti cation servic acm symposium principl distribut comput wang scalabl continu queri system internet proc acm sigmod conf manag bernstein al asilomar report research acm sigmod smith ecient recognit event distribut system hanson rule condit test action execut ariel acm sigmod int conf manag scalabl trigger process int conf data wang predic match algorithm rule system era network kenneth denni shasha web extrem demonstr overview vldb denni shasha ecient match system proc int conf cooper inform system jun rao kenneth ross cach consciou index main memori intern confer larg data bill segal david arnold left noti cation servic data prefetch mechan acm comput yan sift inform dissemin system acm tod
HCI/1098 4 copyright ieee press wearabl devic regist wearer anticip adjust behavior avoid redund interact user relev properti activ recogn depend applic user requir adapt recognit activ teach devic case studi connect pair pant acceleromet laptop interpret raw sensor data combin machin learn techniqu kohonen map probabilist build system learn activ requir minim user attent approach context awar requir priori knowledg context user introduct make devic awar activ user fit bigger framework context aim awar environ state devic exist mobil devic mobil phone person digit assist grow technolog awar current disturb user context arrai hardwar sensor improv applic chang intens displai light sensor present lot bigger challeng found fuse data multipl sensor map high level context research philip merl exampl approach interest work specif teach kristof van laerhoven starlab research belgium acceleromet read keyboard detect hu work pressur sensor pair danc shoe control music graphic perform glove project activ recognit hand gestur base acceleromet inform context broad make hard defin research defin word respect research dei abowd provid survei context applic handheld ubiquit comput requir inform situat entiti entiti object consid relev interact user includ user applic lot activ context person person overcom recognit user teach context descript devic word technolog enabl awar project starlab investig machin learn algorithm make adapt context awar result form basi system paper gener system overview inform context larg amount sensor sensor experi includ acceleromet passiv infrar carbon pressur temperatur figur graph depict behavior sensor light light copyright ieee press section discuss system design attain context awar time figur sensor simpl context section describ specif sensor preprocess sensor cue raw sensor valu input machin learn perform system fall short sensor benefici small preprocess routin enhanc qualiti futur cluster bright result easier distinguish type artifici light sensor microphon infrar sensor similar raw sensor data valu call cue featur literatur case experi simpl preprocess routin standard fast fourier transform introduct adapt context awar machin learn algorithm section discuss algorithm appli reach adapt context awar kohonen map principl similar neuron function simpl unit recruit topolog task depend sensori input som handl noisi data make choic cluster input explicit teach feedback requir user cluster algorithm order input assign kind result map topolog similar input activ neighbor unit visual data displai kohonen som base earlier work willshaw von der malsburg basic unit kind input competit input present unit select winner adapt bit input adapt adjust intern weight vector codebook prototyp input α input vector xn α α call learn rate network number train sampl rule find winner fairli straightforward distanc calcul input vector weight unit closest weight vector win kohonen introduc topolog relat win neuron adapt weight unit locat neighborhood winner requir unit organ grid figur unit arrang dimens grid updat rule unit α learn rate η neighborhood function output layer figur kohonen map neuron start organ topolog sensor input activ neuron activ neuron monitor plot landscap ax repres coordin axi repres time neuron won figur visual advantag copyright ieee press lack insight behavior complaint neural network activ mark user figur activ landscap plot som simpl context context mark hill kohonen map tradit algorithm start highli adapt larg learn rate huge neighborhood radiu gradual fix capabl learn pose obstacl system remain adapt algorithm stai overwrit occur store prototyp field machin learn dilemma catastroph forget problem fact learn slow number input previou hierarchi kohonen map figur lead design issu solut hundr input mitchel explan problem classif result cluster layer mere identifi link label provid user dictat user feedback irregular label nearest neighbor algorithm search cluster vote closest label multipli distanc unlabel result probabl label system complet base hardwar sensor give noisi signal layer favor layer primarili intend transit context probabilist finit state machin architectur context repres transit repres edg state sensor cue cluster stand board movement light sound misc infrar talk walk frequenc activ run tea sensor board sit loud nn lab kitchen touch locat stair lab figur diagram start top cluster end bottom describ context activ locat symbol model probabl measur chang time transit model check transit state enter mechan initi row transit μ probabl transit state state size buffer µ copyright ieee press counter transit state depend previou state make model markov chain state track time spent control flexibl newer flexibl adapt map method prevent spike system give faulti output result time model gener direct graph depict behavior user relat context visit user context context context reflect connect strength schemat entir system activ locat depict figur experi chose implement hardwar captur data reason requir process reli hardwar gp beacon minim focu sensor posit issu activ contribut highli context awar import stress combin acceleromet pair pant result attract experi figur board small sensor board acceleromet acceleromet sensor measur posit depend type analog devic set sensit valu devic read pic microprocessor digit send laptop serial port figur depict class hardwar board made experi demonstr sensor fusion techniqu basic effect order sensor placement acceleromet fix waist made small list basic activ dai jump run observ knee posit sensor optim posit sensor integr pair connect conduct thread make wash small sensor modul board power data wire wash pant softwar laptop run window oper system written paramet system list tabl tabl system paramet experi layer paramet cue layer cluster layer kohonen map neuron learn rate neighborhood radiu classif layer neighbor search layer markov chain raw sensor data process map context descript store enabl comparison reproduct result choic set basic activ context recogn base establish class movement dai wear list includ climb descend stair ride bicycl design choic defin preprocess routin raw sensor data cue layer top plot figur show data ly chosen basic explain research philip copyright ieee press acceleromet stand walk sum maximum standard deviat sampl gave formula easili distinguish activ distinguish system flexibl cue combin tabl cue algorithm implement microprocessor feasibl lightweight simpl threshold suffici limit gener time time time figur plot depict sensor valu sum maximum standard deviat stand walk suffici distinguish activ gener system hierarchi kohonen map number input limit result experi list tabl activ time activ minut press design kei repetit began actual fourth cycl tabl experi result cycl test cycl preorder kohonen som activ recognit cycl sit stand walk run climb stair descend stair ride bicycl graph figur show result activ landscap plot kohonen map experi main activ bubbl repres jump walk bubbl includ bit found back result recognit activ success specif cue benefici case tabl show averag result experi result improv start kohonen fill small random valu safer avoid overwrit explain section result system activ descript figur result activ landscap plot markov chain show activ link link weak period script assess part system extend feasibl prototyp system experi show user decid activ learn time interact user press assign descript activ descript copyright ieee press string link context modifi user typic scenario start walk press button walk stop walk press button stand sit press button sit time user start system recogn activ longer system recognit simpl experi recognit train context tabl train activ retrain user put descript press train button figur experi progress acceleromet knee futur work clear improv sensor enhanc entir system ad make number includ acceleromet enhanc recognit speed accuraci experi paper show combin data sensor enhanc level improv ad ad redund sensor posit logic step hope research lead improv adapt deal obstacl remain requir experi test longer period hardwar worn month smaller process unit context laptop bulki wear batteri long implement applic autom diari store link activ user dai reliabl evalu perform behavior markov chain probabilist model intend pda laptop softwar requir lot storag excess process power context awar adapt behavior limit user decid context valuabl applic autonom inconveni user paper demonstr simpl sensor obtain flexibl requir minim limit consist adapt harsh constraint learn system issu dilemma problem machin learn titl easi feel combin artifici intellig wearabl comput vital context awar hope eventu lead stabl system deal massiv number sensor acknowledg paper written framework technolog enabl awar sponsor european esprit project peopl starlab omega gener teco tea partner vital research copyright ieee press walter van de creator supervisor anonym review comment paper refer context keyboard proc intern symposium wearabl comput san dei understand context context vu technic report esprit project technolog enabl awar church sensor badg sensor jacket context proc intern symposium wearabl comput san rm catastroph forget connectionist network trend cognit pp gold navig set wearabl intern symposium wearabl pp machin learn danc proc intern symposium wearabl comput cambridg jk glove proc intern symposium wearabl comput san ka van laerhoven van de interact gellersen handheld ubiquit lectur note comput scienc pp hw gellersen context interact applic mobil comput nov reprint comput graphic volum decemb pp van context proc workshop situat chi pp von der orient sensit cell striat ga carpent grossberg pattern recognit neural mit pp exampl product soni eco sensor planar displai compaq monitor
AI/1099 2 approxim discret probabl distribut bayesian network jon williamson intern confer arti cial intellig scienc decemb abstract argument liu show bayesian network satisfi arbitrari constraint approxim probabl distribut mutual inform weight give practic procedur nding approxim network evalu applic rang data set arti cial intellig requir abil reach expert system medic diagnosi symptom patient provid diagnosi background knowledg symptom inform determin problem patient probabl theori plausibl model reason expect diagnosi symptom paper address practic issu implement probabilist reason plan rst discuss approxim problem link bayesian network theori identifi optim bulk paper devot approxim algorithm sacri ce optim favour practic investig theoret basi perform approxim strategi approxim problem store manipul discret probabl distribut work distribut depart king colleg london uk store probabl valu long calcul probabl statement interest question approxim distribut sucient accur reason number valu kei import liu partial answer question innov highli practic method brie outlin answer languag bayesian network theori bayesian network direct acycl graph node cn set probabl valu jd node liter form fv valu node state conjunct liter jn direct predecessor parent fc jn independ node independ condit bayesian network suce determin probabl atom state form jd liter parent state node consist factor uncondit probabl depend connect bayesian network probabl function dramat reduc number probabl valu requir function call number probabl complex bayesian network complet dag node requir maximum complex bayesian dag requir speci signi save chow liu show bayesian network induc probabl distribut approxim target distribut measur distanc distribut log atom maximum weight span tree arc node weight mutual inform log chow liu gave algorithm obtain maximum weight span stage arc addit ensur graph remain left tree orient dag prove valuabl ecient approxim probabl function partial answer kei sucient accur approxim problem network give approxim close approxim probabl distribut arbitrari bayesian network subject constraint constraint node constant bound number parent serv restrict complex bayesian network instanc discret network note node probabl liter determin due addit assum redund probabl left speci cation requir tree complet network determin target distribut easi variabl complex network equal bayesian network complex approxim discret network complet network give target distribut depend problem hand resourc balanc approxim complex graph singli connect graph ensur bayesian network calcul requir probabl ecient time polynomi number node note network space complex practic constraint limit space complex approxim straightforwardli chow liu proof approxim maximum weight span tree distanc probabl function determin bayesian network target function log log log jd consist log log jd log log log entropi function mutual inform parent entropi restrict node entropi independ choic bayesian network distanc network target distribut total mutual inform find good approxim ideal network constraint plai determin maximum weight bayesian network sati es maximum weight bayesian network node parent doubt ecient maximum weight network sati es arbitrari involv weigh network satisfi constraint search space vast absenc practic exact method pursu gener algorithm yield network approxim maximum weight pearl approach constraint give procedur distribut repres bayesian network subject found follow algorithm notic chow liu weight attach mutual inform weight usual set parent gener call weight detach attach weight arrow weigh arrow graph jd log jd jd jd set parent liter involv state involv algorithm roughli stage arrow ensur hold graph remain dag stop arrow ad suggest base log log log log parent node fd iter relat jd total detach weight result graph sum arrow weight distanc network distribut target distribut sum arrow weight algorithm greedi search maximum total weight individu arrow weight note weight chang stage greedi search necessarili maximum total ad maximum weight arrow subsequ arrow theori greater weight lead larger total greedi search good heurist make algorithm algorithm action order complet de nition algorithm note stage maximum weight arrow consist dag structur case previou graph spawn graph arrow ad give rise number graph investig stage elimin graph longer maximum graph fewer optim arrow add chow liu constraint complex network binari variabl probabl distribut speci ed tabl start discret graph induc bayesian network complex work uncondit mutual chow liu give tabl highest spawn arrow arrow graph give rise network complex stage recalcul mutual inform valu involv condit jc jc note comput jc log jc jc jc log log tabl probabl atom state probabl tabl valu jd tabl valu jd tabl valu jd altern ident jc log jc jc calcul valu tabl valu valu tabl jc greatest stage elimin add obtain figur graph rise network complex arrow complex tabl contend maximum weight bring graph maximum complex spawn ve nal graph ad figur tabl valu jd graph rise closest approxim target subject chosen constraint perform algorithm direct chow liu origin algorithm context constraint node network parent node set node calcul pick inform add arrow node iter ensur graph adher dag structur greedi search optim network work detach weight addit multipl arrow time call algorithm distinguish algorithm examin algorithm ecienc highli depend rst stage inform valu found discret dag expect chow liu algorithm larger render method larg algorithm fact add multipl arrow arrow time suggest weaken constraint algorithm open search space ad requir dag procedur reach approxim ad arrow restrict addit arrow algorithm greedi surprisingli algorithm perform slightli appar gener method experi compar algorithm small valu due comput intract algorithm select random target distribut gener bayesian network random determin distribut network select dag chosen order node number express denot uniform choic nite partit probabl chosen figur comparison successor order chosen children pick successor weight complex highli connect disconnect graph probabl gener uniformli random machin real gener network ran algorithm detach produc maximum weight graph rel distribut determin found maximum weight graph algorithm arrow turn graph bayesian network ad probabl speci cation obtain target network measur term network target network network repeat experi estim averag di erenc distanc rang valu total number node result figur result show network averag margin closer target distribut network margin test strategi unknown quantiti encourag start altern gener graph pair node decid join arrow random arrow arrow decid direct random direct reject graph turn dag graph turn procedur similar result trend figur success constraint compar strategi deriv bayesian network test simpl test success approach measur success deriv network measur distanc distribut determin target network discret network ad arrow move discret network target network success deriv network percentag total distanc cover earlier reason show sum arrow weight success measur easili calcul figur show success algorithm rang node constraint target network gener random procedur deriv network gener greedi method experi repeat averag success estim front row show percentag distanc gain constraint result graph tree forest constraint chow liu consid row constraint graph parent approxim averag signi cantli closer target distribut approxim improv note constraint drop fourth back complex limit figur structur constraint machin learn repositori test approach rang success measur pose extra issu calcul distanc distribut discret network calcul probabl frequenc liter chow liu demonstr instanc liter form number divid number node calcul cross entropi sum state ln distribut speci ed discret network ln liter consist problem care calcul frequenc occur case miss valu case miss valu provid inform probabl calcul mutual inform valu aim distribut speci ed case miss tangibl distribut randomli data miss due systemat bia knowledg alter target distribut di erenc distribut true target distribut make success measur inappropri accur quantifi true target distribut altern concept success measur frequenc simpl probabl calcul ly accept bound true suscept merz assum sampl bia bia account bayesian prior repres probabl liter sampl restrict measur involv comput time consid focu miss valu algorithm run rang target distribut nal percentag success measur figur show improv relax structur constraint make approxim averag deriv network limit parent node percent target distribut deriv network constraint percent closer averag strategi ord signi distribut real data simul data note requir excess sacri ce term net averag percent complex tree net percentag maximum complex complet net averag percent complex tree net approxim discret probabl distribut bayesian network subject arbitrari constraint detach mutual inform condit mutual inform weight attach arrow theori approxim practic reason prefer greedi give good approxim constraint depend applic stop ad arrow distanc distribut determin level practic reliabl approxim network network solv diagnost problem give diagnosi distribut percent prepar stop ad arrow reliabl achiev fact approach hing constraint stand favour practic expert provid qualit causal knowledg shown structur constraint complex constraint simul figur context continu variabl variabl valu complex constraint low lower complex tree instanc gener complex constraint account rang make complic binari case hand close approxim target sacri ce order lower complex approxim network domain investig causal dag satisfi independ assumpt provid inform appli method outlin add arrow causal graph order independ assumpt close sati ed yield methodolog bayesian network rst elicit causal graph transform graph bayesian network bayesian network found acknowledg art human research board fund research refer merz cl blake cj repositori machin learn depart inform comput scienc liu ck chow cn discret probabl distribut depend ieee transact inform theori page eld williamson david cor eld jon kluwer appli logic pearl georg recoveri causal statist uncertainti arti cial intellig page jon arrow causal report pai jw jon bayesian eld williamson
DB/1100 3 scenario model manag philip microsoft microsoft wa usa abstract model manag framework support relat applic model map manipul class object oper demonstr show model manag scenario relat load data case studi illustr model manag methodolog approach relat problem clarifi requir semant kei oper detail scenario provid evid gener model manag implement introduct applic involv manipul model map model applic includ data data schema schema xml wrapper messag map web site data transform data complex discret structur repres design xml interfac relat transform semant workflow definit make easier develop relat applic make model map object gener oper simplifi call capabl model manag exampl algebra oper specif applic oper defin gener applic domain vision provid gener power model manag environ enabl rapid develop relat applic domain end defin oper step goal investig detail semant oper walk design specif data scenario addit provid evid model manag approach solv realist scenario er confer leav leipzig institut comput scienc demonstr methodolog reason problem model manag oper design focu strategi manipul model map choic oper order solut strategi similar develop paper appli applic domain begin section definit model manag oper section describ applic oper data scenario section summar learn case studi model oper section summar model manag approach introduc repres model object relationship distinguish relationship model identifi root object consist object reachabl relationship model relat object object call map domain point object properti express variabl includ object referenc domain express defin semant map object fig show custom relat repres model associ object model map object domain rang expr similarli rang expr map custom firstnam lastnam compani contact phone fig simpl map map model model manipul repertoir oper includ match creat map model appli function object model differ set object delet delet object model updat appli individu object model control vocabulari implement gener match oper reli auxiliari inform dictionari analysi ultim human arbit approach perform automat schema match investig analog outer join relat ensur object input model repres match result creat return map map object rang object empti match fig make valid result add node map manipul model oper specif return composit map merg merg model base map repres creat map map relat model relat composit map relat instanc instanc left depend map drive composit complet repres defin definit composit support map object domain rang set domain map object cover proper subset rang map object fig map object domain member map object cover fig domain cover union rang map map map map map map map map cover fig composit domain rang multipl map object provid input map object fig object provid input exampl input rang choic object provid input give gener definit composit handl case choic input gener composit oper object domain map object map object provid input defin function provid input creat copi map object replac domain domain object provid input defin set object provid input base defin composit respect defin construct creat shallow copi copi map object object connect map object replac object copi definit extend return set object input sourc defin explicitli choic choic obviou context definit leav open construct express map object result base express map object roughli step refer object replac express object produc fig replac refer explan detail replac depend express languag sql merg oper copi object model guid map detail critic exampl hand discuss varieti semant data scenario integr data sourc data support extract set data sourc data mart support extract data illustr model manag scenario extend exist data ad data sourc data mart challeng scenario commonli occur practic assum simpl data configur cover gener order process relat data sourc schema fig relat repres star schema map note observ payment custom citi countri order quantiti discount brand fig relat schema product geographi sale quantiti discount fig star schema data firstnam lastnam titl extens quantiti discount product time date month year quarter holidai weekend custom state territori region order custom territori region product brand map time sale custom geographi product structur map detail structur grai box fig structur dot line relationship solid line relationship domain rang map object posit author book isbn titl year price tax fig relat schema map product brand custom firstnam lastnam sex street citi state zipcod product categori payment expir tabl sql statement defin semant map creat view creat view select select order order creat view creat view select concaten select case case excel good excel good averag poor averag poor averag averag state creat view creat view select distinct weekend select distinct case case creat view creat view select distinct select null drop requir tr attribut exist creat view creat view select null select drop requir attribut exist chose write express sql view shown column tabl statement map object fig tabl simpli materi view tabl part subset attribut map typic data wareh schema integr feder strive complet map avoid inform loss fulli cover sourc data sql statement perform attribut map substitut type complex transform involv join userdefin function date transform custom map true aggreg valu deriv map integr sourc sourc cover book order relat schema fig integr requir defin map exist schema possibl chang includ inform introduc simplifi integr exist map extent achiev depend similar tabl attribut similar author categori present solut integr task solut figur illustr model manag step solut element shown boldfac notat show subset mean row tabl solut exploit similar attempt requir match identifi element match result creat map map map map map map map map map subset map map map merg map fig sequenc model manag oper integr data sourc match match unnecessari schema part map assign macro notat conveni program construct physic avoid identifi irrelev overlap wrt payment map easi simpli consist tabl attribut sql statement object match driven correspond tabl tabl specifi attribut attribut express tabl consist attribut correspond match attribut concaten match tabl correspond tabl attribut result match oper element match counterpart proper superset quantiti discount attribut order tabl brand region sql statement requir attribut miss ensur match captur step fig explain section object empti domain altern strategi perform match exploit surround structur present produc larger match result manipul extra composit step achiev desir issu composit work map object domain creat view statement repres map object attribut tabl domain map object cover map object analog cover fig composit creat express map object combin express map object requir substitut object map express sql replac attribut tabl counterpart defin column tabl show result sql statement make automat gener sale map select result deal object empti desir outcom modifi sql express substitut null item accomplish extend ad dummi object desir default valu ad dummi object empti model manag oper appli function make substitut default valu automat fig shown creat view tabl default valu attribut quantiti discount repres unmatch attribut replac null note queri simplifi join geographi product queri substitut implement composit straightforward problem complex match transform aggreg directli replac attribut aggreg express lead invalid sql aggreg express substitut requir complex rule simpl variabl substitut exist transform transform specif sourc custom map entail specif express custom classif sql statement tabl set custom situat handl user defin transform final step final integr step check part cover previou step incorpor add author dimens data determin part integr automat requir userdefin specif addit map fig merg result element exist schema requir combin tabl preliminari match actual merg observ match kei oper solut achiev exist map sql express languag requir oper support map object domain rang combin provid default valu complet exist map power abstract level model manag oper result short solut huge product gain specif program work involv current tool remark gener tailor data wareh main remain manual work support match oper implement partial map requir deriv exist schema map effort data instanc level data altern solut altern solut integr illustr fig contrast previou identifi part directli match schema exist map remain part step start match schema result map identifi common tabl attribut direct popul call copi data note expect part deriv map domain rang map map map text detail map map domain map map map map merg map map map map map merg map map map map map map fig altern sequenc model manag oper integr sourc part schema match directli exist map creat copi remov object rang object part primari remov sql statement avoid delet primari kei attribut map produc step merg exist tabl step delet sql statement involv delet creat view delet term select defin relev restrict join condit delet addit simplif statement tabl complet sql statement elimin result map model manag algebra structur sql inferenc make modif sql statement match domain call fig suffici perform match map object object map object problem input map directli ensur result map includ element previou add default map element correspond element result map comput consist match merg step popul tabl merg simpl union tabl work preliminari match form tabl common creat view statement combin involv manipul sql wrt kei column step map element add fig overlap previou map merg creat view statement step directli match tabl custom geographi tabl book custom attribut relationship involv avoid unwant appli time match step map express time transform join queri map refer union step complet map deriv sale tabl step match tabl creat step remain attribut step step elimin attribut creat view select sale statement reduc queri time leav attribut modifi sale perform requir join obtain map statement creat view select creat view select order notic retain match step drive merg step result correspond sql statement column row observ approach appli similar step distinguish featur partial exist applic complet sourc match lead merg map solut gener preexist data sourc multipl map schema partial integr data sourc data scenario ad data mart usag model manag oper section data scenario illustr recur briefli scenario assum star schema data mart map dw add data mart task determin map dw map complet respect solv problem solut pattern similar section give compact descript possibl illustr fig solut simplest appli dw schema differ subset dw solut match dw match dw match unmatch part part remain part deriv map merg solut maxim exist map section data mart similarli structur complex transform worth match rest cover map match dw element deriv map solut solut partial dw map map map map map map map solut dw map map map map map map map map map map fig altern add data mart map map map map map map map map map merg map map map map map map map map map map map merg map map evalu applic gener model manag approach data scenario relat star sql express languag map altern solv typic map problem gener integr data sourc ad data mart solut exist map larg extent combin model oper wai user interact requir provid semant inform match oper map requir deriv exist model studi deepen understand kei match introduc notion show composit semant cover map object domain rang gener provid default valu emploi oper expect idiom commonli map express manipul manag modul plug algebra framework modul handl sql exampl paper show modul found model manag notat level abstract design altern map abstract design encourag map rang set interest main technic factor deriv solut introduc enabl quick comparison design figur solut fig exampl show notat compact highlight approach differ studi provid evid gener model manag approach manag model map gener consid level detail suggest model manag vision implement effect acknowledg alon sergei rachel suggest improv paper grate microsoft sql server group provid schema exampl refer gener metadata manag vldb vision manag complex model june learn sourc descript data integr proc webdb pp algebra semant semistructur data proc ieee knowledg data engin exchang workshop nov semant integr heterogen neural network proc tool identifi attribut correspond heterogen neural network data knowledg schema bridg theori practic inform system schema match simplifi heterogen data translat proc wiederhold integr knowledg sourc proc fusion juli model articul ontolog proc extend edbt lnc springer verlag partit inform base context proc pp semant discoveri properti schema proc automat techniqu detect type conflict schema proc data process restructur system acm tod
DB/1101 3 aachen technolog research group theoret comput scienc approach model queri video data jacqu extend version articl intern confer data rwth aachen informatik aachen germani abstract index video data essenti provid content base access technolog offer integr framework model queri video data concern video model found provid interest angl attack problem video applic system provid nice basi futur video system research provid solut video issu partial fragment video applic provid beauti challeng gener system provid support multimedia data data type requir techniqu manag solut paper develop data model queri languag video content base index retriev data model design object constraint paradigm video sequenc split set fragment fragment analyz extract inform interest put search find inform interest type inform entiti interest domain video video frame entiti repres data model fact object constraint present constraint queri languag infer relationship inform repres model languag clear declar oper semant work major consolid access queri constraint queri languag introduct recent progress compress comput store huge amount audio video media wide todai commun form home educ scholarli corpor effici comput exploit lack creat face develop advanc video virtual internet interact video conferenc video partial advanc applic integr video data complex manipul video analysi content retriev base semant requir research effort area comput imag data inform video data manag pose special challeng call techniqu easi develop applic facil user view video materi navig build sequenc facilit semant object featur video appropri index keyword free text describ semant object suffici addit techniqu state issu address video inform form facilit retriev organ inform effici present retriev video sequenc deriv adequ content descript satisfactori retriev condit end mandatori video data model power express sophist content proper usag queri video natur video import develop adequ data model queri languag featur system desir video secondari storag concurr support video inform share inform applic make analysi advantag gener video abil repres complex open extern world languag tradit system exist technolog design manag digit video class techniqu requir retriev automat process present visual content tool video exploit amount displai video model method develop specif queri languag concentr extract capabl queri video data mean set ad hoc incorpor investig theoret framework argu queri languag appropri design support video specif featur form sound basi queri languag point video data present interest challeng futur system cover rang task manag video content includ featur develop scheme oper data model express captur characterist inher video queri languag kind virtual edit perform exact partial fuzzi match consensu central role video plai research work find semant foundat repres queri video inform paper contribut direct framework present integr formal develop object sequenc paper build work hybrid data model video data constraint queri clear declar oper semant make develop simpl video data model basi object constraint paradigm object interest relationship object attach gener interv pair relat constraint queri languag infer relationship inform repres relationship object high level specif video data manipul model queri languag approach repres period time gener interv queri conveni declar natur previou research power constraint implicit specif tempor data gener interv set overlap fragment video sequenc model queri languag core video document archiv prototyp channel nation institut formal queri languag queri video data paper paper organ section discuss relat work section inform introduc index video sequenc section present definit section formal introduc video data model section describ underli queri languag section draw relat work advent multimedia comput standard power compress techniqu digit store common human video stream worldwid store minim function expect power aim content index retriev main approach fulli autom content index approach base interact fulli autom research system jacob weak content analysi focu specif exploit aid video content index system avi fascin issu context video data multimedia gener note present context imag video queri formul fall broadli textual visual system develop retriev visual data base imag relat bibliograph data focu textual languag work present closest complement retriev model imag base logic languag span main map content queri imag address dimens combin object attribut entiti mean relat object shape state declar equat case model tanaka data model focu capabl featur support schema evolut provid mechan share descript data video frame sequenc model object attribut attribut valu describ content semant scene sequenc video frame interv pair start frame end frame denot continu sequenc video frame introduc notion inherit base interv relationship mean notion share descript data successor interv merg overlap defin object object provid user queri languag retriev model descript definit relationship object content term semant object consid valu attribut adali al develop formal video data exploit spatial data structur store data kind inform object event role video divid sequenc frame constitut logic video set frame sequenc view frame segment event set attribut describ context event give parti attribut host valu philip attribut guest object event complex structur relationship object implicitli descript event develop simpl video queri languag retriev video interest extract relev segment video satisfi queri condit provid approach repres period time frame interest video sequenc gener video data model combin idea stratif segment approach object develop framework share video data model built model simpl video queri languag tempor interv oper provid work concentr structur part video order support video themat index base give textual descript content frame sequenc elabor structur descript content frame sequenc regard extend work descript content video sequenc mean class citizen object data model relat attribut explicit relat lead express relationship link object video frame call gener semant object interest gener model manipul level special spatial tempor express declar manner gener semant object relationship element make video sequenc applic model video overview inform introduc video index model discuss fundament aspect video present approach gener interv object discuss briefli relat convent approach video index mean defin inform carri part content video sequenc video data consist sequenc share attribut imag data posit rel layout video addit tempor relat attribut video data hierarch structur video index model provid facil effici captur addit attribut tempor natur inform abstract video content true time tempor manag video inform requir segment approach video index scheme sequenc split independ contigu time segment annot individu figur show basic segment broadcast easili timelin document partit individu handwritten descript public speak minist walk maneuv figur index segment segment light quick descript video document applic broadcast archiv approach critic davenport strict tempor partit result rough descript video document introduc call annot fact individu element interest singl tempor interv call shown figur stratif overlap user level descript figur show level decomposit document idea stratif interest fact descript extend stratif approach defin call gener interv contrast stratif time segment set time segment descript gener interv defin set interv provid time boundari descript handl singl object occurr entiti video document index annot period time object interest screen object report minist simpli associ object gener interv shown figur object interest applic depend tax armi educ polit financ broadcast cannon tank soldier talk public talk minist armi move figur index stratif gener interv trace presenc screen singl instanc refer occurr document gener interv occur report report minist time object interest figur gener interv index basic definit section preliminari concept design video data model underli constraint queri languag definit concret domain consist ffl domain ffl set predic symbol predic symbol ariti relat concret domain set integ comparison assum entail conjunct disjunct decid definit linear order inequ order inequ constraint formula form negat assum constant interpret countabl infinit set binari relat order interpret order concret domain complex constraint built primit constraint logic connect special denot entail write entail satisfi constraint unsatisfi techniqu check satisfi entail order constraint domain studi express power complex linear constraint queri definit domain constraint constant type set constant type denot set variabl rang finit set element type constraint restrict form set constraint involv set function note constraint deriv form rewritten fcg satisfact entail conjunct constraint solv polynomialtim quantifi elimin algorithm class constraint plai import role declar constrain queri answer definit interv consid order pair real number definit refer predic concret domain ir time interv repres conjunct primit linear order inequ constraint definit time gener time simpli gener set overlap interv gener time interv repres disjunct time interv basic video formal mathemat structur central notion video data model gener interv decid split video sequenc set gener interv analyz extract inform index basi content assum inform describ content interv length interv user basi index video materi establish link inform tempor locat video sequenc convent approach segment stratif tackl problem approach assign continu tempor interv video inform approach extend relat inform set tempor call gener interv semant scene sequenc continu video interv complex video handl main sourc inform ffl machin deriv detect color basic raw ffl applic specif desir video higher level semant data semant object refer semant video index natur video semant object index respect time video data model fact object defin video sequenc ffl set gener interv video sequenc split set arbitrari gener interv note gener interv overlap gener interv abstract object identifi ffl set entiti describ inform video sequenc applic inform interest exploit consid object determin analyz gener interv ffl set atom valu valu drawn concret ffl set relat relat relat object gener interv ffl set constraint describ time interv defin gener interv ffl map gener interv subset ffl map gener interv linear order constraint describ period time gener interv disjoint video data model ffl object object ident object entiti interest video sequenc refer object logic object syntact term queri languag logic oid uniqu identifi object word refer id logic level essenti type gener interv abstract object result split video sequenc set smaller semant object entiti interest video sequenc ffl attribut object attribut attribut defin object ffl relat argu time object model real world natur situat relat combin object lead natur relat encod natur handl relat prefer relat languag construct assum exist countabl infinit disjoint set atom ffl relat fr ffl attribut fa ffl constant fd ffl object ident oid id fid id distinguish object ident entiti object ident gener interv order associ time interv gener interv restrict form linear order inequ constraint valu attribut defin set element ffl primit constraint form ffl disjunct primit constraint definit set valu smallest set id fv definit video object consist pair ffl oid object identifi element ffl distinct attribut valu denot set attribut fa denot denot model framework recal concern movi alfr movi minut durat philip decid commit perfect crime prove privileg group peopl kill sake kill receiv punish kill friend david hide insid chest live room sign give parti invit friend david janet parent father mr david mr individu talk suspect david bodi room stand addit mentor intellig suspici prove worthi reput immedi understand circumst movi question gather clue find wrong gener correspond period time sequenc crime commit interv object chest object david call role philip david correspond period time sequenc parti interv object chest simpl extract content gener interv gi gi gi fo durat subject victim murder fo gi fo durat subject host fo guest fo role role role gi gi statement gener interv gi durat interv entiti interest fragment sequenc fragment sequenc deal murder attribut object object murder statement fact defin relationship object gener interv gi gi note tempor integ gener interv necessarili correspond singl continu sequenc video frame scene correspond singl continu sequenc frame describ period time gener interv disjunct atom constraint simplifi attribut durat gi gi mean constraint approach treat constraint organ class constraint attribut method attach addit inform featur video data model constraint queri languag present queri languag reason fact object video data model languag consist constraint languag top relat defin mean definit languag semant base notion extend activ domain extend domain gener interv object concaten languag interpret function symbol build gener interv concaten construct term form interpret concaten gener interv extend activ domain fix queri evalu gener interv object creat concaten object result concaten exist ad extend activ domain syntax manipul gener languag interpret function symbol construct complex term gener denot concaten languag term disjoint set constant symbol set union disjoint set atom set call object set gener interv object set variabl call object denot set variabl call gener interv denot denot gener interv gener interv construct interv construct interv term concaten oper defin structur result element defin structur ffl id id follow idea object id object gener function id id ffl ffl note mean obtain concaten result concaten lead termin execut construct rule definit construct formal definit constraint concaten gener interv definit defin predic ffl ariti predic symbol ariti ffl special unari predic symbol interv class gener interv object ffl special unari predic symbol object class object gener interv object definit predic symbol atom denot object object att att attribut constant negat call inequ atom definit rule languag constraint rule prefix constant symbol refer head rule refer bodi rule note restrict construct term head bodi rule construct term head call construct rule recal interest order arithmet constraint involv arithmet function restrict form set constraint involv set function definit rule variabl rule occur bodi liter variabl occur head occur bodi liter definit program collect rule definit queri refer queri tupl constant variabl give simpl exampl queri letter stand variabl letter stand constant queri object domain sequenc express constant output variabl gener attribut set semant object interest gener interv queri involv atom constraint comput answer set check satisfi constraint instanti queri gener interv object express queri object domain tempor frame express tempor variabl queri involv primit constraint complex arithmet constraint comput answer set check satisfi constraint queri gener interv object express fo queri pair gener object relat gener express queri gener interv object attribut express val infer relationship rule infer exist object defin relat hold gener interv object time interv overlap time interv express relat constraint entail defin relat pair gener interv common write object rule construct concaten gener interv common concaten fo fo semant languag declar semant semant recal denot set variabl call object denot set variabl call gener interv variabl var countabl function assign syntact express subset set variabl occur express syntact abbrevi ground atom atom ground rule rule definit program interpret consist ffl domain ffl map constant symbol element domain ffl map predic symbol relat definit valuat total function set element extend ident extend map free tupl tupl natur fashion extend constraint straightforward gener interv definit rule constraint valuat map variabl element rule true interpret valuat present ffl ffl present definit program interpret model rule valuat map variabl rule element definit mean program uniqu minim model theorem program interpret admit model includ admit minim model proof program interpret admit model set model show satisfi rule rule valuat base ext satisfi satisfi model satisfi rule instanc model minim model semant semant defin term consequ map interpret interpret interpret program subset ground atom formula built predic symbol languag element applic oper creat atom object construct show monoton continu comput iter fashion recal languag term countabl disjoint set atom valu set entiti set gener interv constant gener interv element defin definit set gener interv extens written ext set object ffl element ffl pair element element result concaten definit activ activ domain interpret note set element subset extend activ domain denot ext extens subset ext lemma interpret ext ext definit consequ program interpret ground atom consequ exist rule exist valuat base ext ffl ffl ffl satisfi definit oper program map interpret interpret fa consequ pg lemma oper interpret proof interpret show atom consequ consequ case ffl ffl exist rule valuat base ext satisfi lemma valuat base ext satisfi theorem oper interpret infinit proof atom show case ffl exist ffl exist rule valuat ext satisfi exist exist satisfi set variabl rule result appli variabl finit subset ext base ext satisfi ext lemma model iff proof interpret denot set ground fact consequ fa consequ pg element case ffl definit ffl exist rule valuat model satisfi interpret program rule valuat satisfi lemma model proof immedi lemma theorem program input minim model minim model coincid proof program denot minim model lemma model minim model minim model model minim model datalog set order queri shown evalu close form data complex rule languag arithmet order answer queri comput ptime data complex obtain lower bound complex queri evalu rule base queri languag futur work grow interest video theoret set understand relat model queri problem lead develop power system manag exploit video inform address problem develop video data model constraint queri languag definit retriev content video data primari motiv work object time interv relev video model absenc suitabl support structur tradit data model queri languag repres obstacl data model queri languag abstract visual video support model retriev semant data model style video independ content inform relat associ object video sequenc paper make contribut develop simpl video data model integr object constraint object maintain view inher video data attribut relat captur relationship object simplifi index video sequenc develop constraint queri languag reason object build sequenc function virtual edit applic languag declar natur express queri due complex natur video queri languag present facil user construct queri base previou queri properti inher imag data part video framework present natur appli imag data interest direct pursu ffl import direct activ research extend framework incorpor abstract mechan gener ffl import direct studi problem sequenc present exist research system approach provid automat sequenc capabl set sequenc templat predefin confin user explor sequenc order problem approach reli avail suitabl templat queri framework base declar graphic languag offer possibl flexibl specif sequenc present investig import research direct refer subrahmanian advanc video inform data structur queri process multimedia smith davenport stratif design environ random access video technic media movi context usenix usenix page dan video queri formul wayn niblack ramesh storag retriev imag video iii san page februari alexand aiken edward wimmer solv system set constraint ieee comput societi annual ieee symposium logic comput santa page timothi multimedia system version retriev wayn niblack ramesh storag retriev imag video iii san page februari alberto del icon environ imag queri ieee tran softwar alexand yoram queri constraint object acm sigmod intern confer manag data san page ns chang ks fu pictur queri languag pictori system novemb jan chomicki tomasz imielinski relat specif infinit queri answer acm transact june video retriev sequenc system acm transact inform system octob jacqu model queri video hybrid approach ieee workshop access imag video librari santa jacqu model queri video euromicro confer workshop multimedia david scott semiautomat video system wayn niblack ramesh storag retriev imag video iii san page februari myth semant video retriev acm comput decemb le video compress standard multimedia applic commun le mpeg compress review commun stefan grumbach su constraint symposium principl system san page june stefan christoph linear constraint queri languag express power complex daniel intern workshop logic comput complex page octob bernard paul victor jame norman iri hypermedia servic commun januari ramesh terri index video wayn niblack ramesh storag retriev imag video iii san page februari kato queri visual intern confer extend technolog page march rune roger model queri video data intern confer larg marku smolka definit relat constraint languag report ibm stuttgart octob john wei video manag system base advanc techniqu sethi ramesh storag retriev imag video iv san page februari joseph af high level queri languag pictori manag ieee tran softwar michael kifer jame wu logic logic program symposium principl system page march la jacob queri system video wendi mackai davenport virtual video edit interact multimedia applic commun juli marcu subrahmanian foundat multimedia system mecca anthoni bonner datalog transduc symposium principl system san page carlo logic reconstruct imag retriev sethi ramesh storag retriev imag video iv san page februari qbic queri imag content shape symposium electron san februari katsumi tanaka design implement system ieee transact knowledg data august jan peter letizia tanca declar graphic queri languag claud michael intern confer deduct volum page decemb peter revesz datalog queri set constraint georg gottlob mosh intern confer theori page januari lnc divesh raghu peter revesz constraint object intern workshop principl practic constraint program number page springer acm toi special issu video inform system acm transact inform system octob david toman point queri languag tempor symposium principl system page june video handl base structur inform hypermedia system intern confer multimedia inform system page mcgraw ichikawa video retriev motion journal visual languag zhang implement video present system sethi ramesh storag retriev imag video iv san page februari
DB/1102 3 optim queri object updat fegara depart comput scienc engin texa arlington yate po box tx abstract provid power data abstract model facil lack suitabl framework queri process optim number recent oodb queri queri optim presenc object ident destruct featur support realist oodb languag paper present formal framework optim queri presenc side effect queri object updat place form present languag extens monoid calculu express featur give formal mean extens method base denot give formal mean imper program languag semant languag extens express term monoid fundament chang basic framework method maintain referenti queri practic optim oodb queri optim techniqu appli regular queri minim oodb queri updat introduct kei factor oodb system successfulli compet relat system meet perform requir applic develop effect queri optim aspect oodb queri optim problem benefit relat queri optim kei featur oodb languag make problem uniqu hard solv featur includ object type larg multimedia multipl collect arbitrari nest nest queri express number recent oodb queri optim handl nest collect convert path express join unnest nest queri handl encapsul method queri optim presenc object ident destruct featur support realist oodb languag earlier work effect framework solid theoret basi optim oodb queri languag call monoid shown captur featur odmg oql good basi express optim algorithm includ queri unnest translat path express join extend framework handl object ident object updat object ident complic queri optim program base modif object store modern oodb provid declar queri languag associ access queri languag invok includ perform side effect object creation common oodb side effect insert object class extent oql select creat person queri free side effect modifi extent class person insert person queri part queri queri scan extent class extent modifi outer queri semant queri reflect fact person extent modifi execut queri failur result incorrect lead invalid execut plan problem assign semant queri object state modif arbitrari place oodb languag oql queri select earn semant queri reflect fact salari modifi iter situat queri mix freeli updat occur frequent oodb support set iter comput complet program languag languag begin disappear favor declar surg interest provid comput power exist declar queri languag sacrif perform queri type queri kind code insid includ code modifi earlier research queri optim shown queri form hard optim problem set bag combin side effect result unpredict due commut queri end execut program depend scan understand extent function assign bodi return execut yg equal side effect place prove oodb express hard make task express verifi optim rule difficult accomplish transform term valid queri perform side effect order execut side effect chang transform chang semant program patch error attach guard transform rule prevent execut term side effect approach conserv miss optim side effect fundament problem algebra oper side effect valid translat declar declar queri defin execut order optim realist oodb queri address problem object ident properli handl implicit explicit side effect due object ident highli desir exist optim techniqu minim captur handl object ident framework regular queri side effect extens difficult incorpor exist optim framework understand level equal oid equal predic evalu left object ident function comput predic function call return true unfold call previou express substitut bodi function definit function call valid transform goal give formal mean oodb queri side provid equat theori queri optim highli desir theori seamlessli incorpor monoid possibl discov monoid captur mean object ident goal object updat queri treat treat basic optim object extens approach paper present framework incorpor impur object monoid calculu earlier import give semant extens preserv referenti transpar referenti transpar substitut equal subexpress context larger express give equal result queri languag lack transform rule queri optim depend context express appli research program languag formal denot solv problem denot semant impur featur languag captur pass state object oper program piec program updat state propag modifi reflect updat state copi state creat approach destruct matter small object store entir creat techniqu unaccept applic solut problem state manipul small number primit preserv referenti effici implement primit defin pure function implement perform destruct updat state deriv effici program maintain referenti queri optim catch solut work state roughli state program program undo state modif strict sequenc state updat program state replac access singl global variabl state oper made side effect preserv oper properti assum statement assum execut statement local state modif discard complet program bind discard statement requir local copi state execut form stack state handl nest assum backtrack previou state complet execut rollback transact oper common wai state manipul languag detect violat perform semant kind abstract interpret linear type system detect violat adopt restrict syntax languag state problem mention denot semant pass state oper sequenti oper restrict good idea commut miss optim opportun rang assign evalu scan set end depend scan solut valid consid optim address problem gener solut gener altern stage optim select end perform cost approach gener exponenti number solut appli constant practic provid queri larg number union oper altern solut correspond typic final state solut chosen optim queri queri collect correct answer decid solut report error solut exist program fall categori altern queri optim prove program prove equal plan gener optim select altern framework inspir work repres object ident monad contribut mix state transform set bag appli theori queri languag satisfi strong normal properti normal remov unnecessari state make approach practic optim program calculu import contribut work develop method map program state transform remov normal imper express program regular imper result program effici written hand rest paper organ section describ earlier result monoid calculu section describ object extens monoid calculu section monoid captur object ident side effect section describ framework handl object ident denot semant section address practic build optim base framework section present prototyp implement framework section extend framework captur updat discuss theori appli solv view mainten problem monoid calculu section summar earlier work monoid calculu formal treatment present monoid calculu base concept monoid abstract algebra monoid type pair associ function type binari function valu return call accumul merg function type call element left ident element satisfi accumul function uniqu identifi accumul monoid exampl monoid includ boolean monoid integ boolean call primit monoid construct valu primit type list monoid call collect monoid collect monoid requir addit definit unit merg construct valu type unit function set monoid input construct singleton set fxg output list monoid satisfi satisfi monoid monoid form express call head term term sequenc rn call gener form rang variabl express gener construct filter predic shorthand denot set monoid defin reduct collect possibl ae collect monoid rule reduc leftmost qualifi rule reduc leftmost qualifi gener bind bind free occurr calculu semant requir idempot commut monoid gener idempot commut monoid valid monoid map set monoid commut list monoid commut valid requir easili check compil time restrict monoid set monad captur nest relat algebra oql express direct translat monoid calculu oql queri select distinct hotel select exist num select translat hotel shorthand repres bind variabl mean construct express substitut free occurr syntact pattern place lambda rang variabl bind pattern compil standard pattern decomposit techniqu retriev element pair function paramet return sum monoid calculu put canon form effici rewrit call normal algorithm evalu canon form gener produc fewer intermedi data structur initi unnorm program normal algorithm improv program perform case gener optim techniqu relat fuse select select import rule normal beta reduct pred idempot sound normal rule prove definit monoid rule flatten gener domain requir variabl renam avoid rule unnest existenti quantif previou oql queri normal appli rule unnest set rule unnest existenti quantif object monoid calculu monoid calculu extend captur object ident extend calculu call object monoid calculu valid creat list object variabl rang list state increment refer object return state object result comput list translat state transform propag object heap bind object ident object oper oper creat object modifi state object translat captur semant object ident extend base model equat theori valid optim queri introduc type constructor captur object state repres valu type extend monoid calculu polymorph oper style ffl type oper creat object state ffl type oper object return state ffl type oper state object return true languag wai construct manipul object oql object constructor creat object requir explicit object dereferenc oper languag featur easili express term primit mention give formal primit choic deal detail object optim real address properli oper place monoid exampl object oper object defin variabl synonym state object oid equal result true fx true maxf maxf object distinct object equal state ninth comput cardin set duplic set count interest order set result permut set result valid optim construct plan end gener result practic queri set depart depart manag state transform monoid handl side effect denot semant map term comput valu type function type type state side effect place term type map function initi state type input gener type state denot function type call state transform term perform side state transform map state reflect state remain unchang constant map state transform propag state note comput depend input state side effect captur pure function map state state add side effect program multipl due commut result highli desir captur interpret optim select end handl type function input state transform return multipl valu multipl return multipl pair state transform type captur interpret program definit state transform type state type type show monoid type defin primit state transform contrast monoid monoid instanc monoid function definit import prove correct transform rule safe skip reader interest proof present simpl definit work monoid extent captur monoid definit transform state transform monoid monoid primit monoid defin oe oe oe function appli state type construct merg function propag state state transform merg result valu easi prove oe oe vn oe oe oe state monoid simpli monoid state transform monoid state type state integ count list element state increment element list state count list state transform monoid properti monoid introduc semant inconsist commut captur redefin behav oe oe defin ae oe commut ae idempot fx oe oe propag state oe oe oe oe contribut factor element remov evalu integ state count set element propag state left equal counter count list element prove appendix valid compat monoid commut captur object ident discuss state type captur state entir interest captur object ident state state transform captur object ident view pair call object map object type instanc type valu type map oid object state integ counter comput oid primit manipul ref int store ext lookup ref map integ oid refer object type initi object store ext extend object store bind oid state lookup access object store retriev state object oid lookup int int ref int ref int return state object type oid abov primit satisfi ref ref ext ext ext ext lookup lookup lookup figur present denot semant import construct monoid calculu object extens object state figur denot semant monoid calculu state transform propag chang semant object extens form interpret semant give mean syntax bracket term pure monoid calculu type lt lt domain term object monoid calculu type type denot defin function type recal state type pair notat compon access rule figur handl function term type translat appli state rule assum interpret evalu appli rule translat monoid rule monoid monoid propag state element collect notic head state transform state transform merg valid type collect monoid compat monoid term modifi object store time object construct state propag chang rule appli elimin state propag correct rule straightforward rule give denot semant object ref oper oid object state object store extend bind ref state rule destruct chang object extend store bind oid left part part rule simpli object store request oid appendix proof theorem state modif oper output state input state canon form deriv normal similar canon form pure monoid calculu theorem basic state transform sequenti program perform state normal algorithm remov unnecessari state transform exampl translat normal term object monoid calculu state interest increment element set integ type set cardin express counter maxf support bag set object inconsist valid express equal assign freeli move insid set translat object effici program previou section express term basic monoid calculu denot semant rule figur result program ineffici manipul state state ineffici reduc normal algorithm algebra equal object primit part result program normal program similar program write object primit directli section effici execut program reduc program normal algorithm translat object monoid calculu basic calculu altern due commut oper absolut prove program equal normal complet algebra equal check program optim safe discard altern select random altern practic choic made cost function program object calculu initi state system evalu final altern select pair function defin rule figur choic case miss rule altern state monoid state monoid remov normal algorithm effici implement crucial system perform default implement state monoid loop creat state transform iter state transform merg function state transform monoid approach ineffici find algorithm evalu state faster solut compil loop found imper languag translat loop initi state initi result retriev pair updat result updat state return set cardin translat state monoid map return loop ineffici manipul object store step loop result program implement effici store global arrai object primit program directli manipul global arrai rule object creation undon rule enforc singl arrai pointer fetch state return pointer pointer store implement global store updat updat primit oper object store destruct store global arrai mention domain element type store defin object primit implement ref lookup ext implement sn evalu statement sn order return lookup translat result program state transform evalu effici real program previou loop correspond set cardin return global arrai implement object primit implement built prototyp implement framework translat oodb queri shown paper gener program sourc code exampl illustr translat object queri system notat exampl bit theoret framework sn execut statement sn sequenc return execut statement sn return evalu object queri type translat express type return void correspond state int oid counter assum oid counter execut queri equal object queri object translat pair construct pair valu null type void ae ae ae ae ae path ae ae ae ae figur denot semant updat assign store set return queri execut correspond gener block execut sequenc fourth queri gener state monoid translat loop return sum element queri earn return number assum salari updat view mainten monoid state transform express destruct updat term basic algebra updat queri optim singl framework db current state db type db aggreg persist object applic analysi previou translat updat monoid algebra propag state entir updat captur state transform entir updat captur pure function map exist make approach defin set updat primit express similar object updat pure effici implement approach requir extens formal normal queri optim improv perform updat express qualifi qualifi path destruct replac store path qualifi path merg singleton qualifi path delet element path equal qualifi fundament construct defin path path path path ug num insert hotel arlington total number hotel denot semant express updat ae ae bind list bind rang variabl current state rule figur slightli modifi includ bind list term map ae rule figur map rule figur rule figur map rule figur ae includ bind rang gener bind list ae rule semant updat qualifi express ae reconstruct state copi compon reach replac defin ae ae ae ae ae type ae ae type path possibl empti path sequenc express replac occurr db rule appli state collect type rule appli state record rule condit forc reconstruct collect replac element point updat previou bind list ae bind ae equal ae ae hotel num gi predic hotel citi chang implement ae path destruct modifi part reach path explain motiv denot semant simpli give formal mean destruct construct semant actual translat construct translat queri optim defin function translat updat program gener destruct updat optim reconstruct state copi number place valu gener list destruct updat form path composit ae construct state function defin list ae return origin updat semant program term state transform state reconstruct normal queri optim elimin unnecessari reconstruct state transform number destruct updat leav futur work demonstr framework effect framework handl object updat optim framework destruct updat handl view mainten problem gener view function state db domain materi store view recogn case directli comput possibl view queri easier queri normal unnest unnest flatten function interpret updat view mainten problem express term materi view view recognit problem mention transform updat primit appli db attain express state transform term updat primit normal result comput materi view term appli techniqu materi view gener effici destruct updat plan show futur research framework requir minim extens basic practic effect present formal framework handl object updat oodb queri optim framework appli monoid adapt work optim framework type object manipul construct express term basic languag construct denot semant queri optim applic basic languag construct minim remov ineffici due composit translat program denot semant implement object store primit side result program evalu effici program written hand author grate david maier comment paper work support part nation scienc foundat grant refer agraw gehani design persist queri process facil program languag intern workshop program page morgan kaufmann june wong syntax sigmod march cattel object morgan cluet delobel gener framework optim queri intern confer manag san page june cluet moerkott effici evalu aggreg bulk type technic aachen octob technic report cluet moerkott nest queri object base intern workshop program septemb colbi algebra queri optim nest relat acm sigmod intern confer manag page ross support multipl view mainten polici acm sigmod confer manag page queri optim overview ieee data eng june fegara uniform calculu collect type oregon graduat institut technic report anonym ftp fegara optim oql texa arlington technic report fegara queri unnest acm sigmod intern confer manag page june fegara maier algebra framework physic oodb design intern workshop program septemb fegara maier effect calculu object queri languag acm sigmod intern confer manag san page fegara maier optim object queri effect calculu submit tod august gupta mumick mainten materi applic data engin bulletin kemper moerkott advanc queri process object base access support relat sixteenth intern confer larg page morgan kaufmann august lieuwen dewitt approach optim loop program languag intern confer manag san page june repres object ident pure function languag intern confer page decemb lnc ozsoyoglu wang kei method nest relat manag system proc ieee cs intl conf data februari ml work programm cambridg simon peyton jone implement function program languag read element function program addison schmidt detect global variabl denot specif acm transact program languag april sutton small extend function languag updat complet thirteenth british nation confer philip wadler comprehend monad acm symposium lisp function page june wadler essenc function program nineteenth acm symposium principl program page januari theorem state transform monoid valid monoid compat prove left proof monoid similar proof exist commut idempot monoid oe oe oe oe oe associ prove oe oe oe oe oe oe oe oe oe oe oe oe oe oe oe oe oe oe definit oe oe definit equal set oe oe exchang oe oe theorem express monoid calculu object normal normal step structur prove theorem rule proof similar rule rule assum theorem true properti normal rule assum theorem true gg prove theorem term properti canon form
DB/1103 3 ad compress block address invert index navarro silva de ricardo depart comput univ chile depart comput univ feder de brazil abstract invert index block address sequenti search compress text techniqu separ develop text retriev modern text compress techniqu reduc text size search directli faster uncompress text invert index compress obtain reduct origin size process speed block address make invert list point text block exact posit pai reduct space sequenti text scan work combin idea singl scheme present compress invert file index compress text block address techniqu compress index studi perform respect block size compar index separ techniqu vari block show index superior isol approach extra space overhead index scan text exact search error match text invert block text introduct larg size todai text collect demand special index techniqu fast access document search user index persist data structur built text advanc speed queri process simpl index structur larg text collect invert index invert file witten invert index popular index techniqu larg text store natur languag document work partial support grant grant navarro ricardo cape scholarship silva de miner technolog group scholarship grant fl kluwer academ publish print netherland invert index typic vector distinct word text collect lexicograph order call word list text posit word occur call list search word invert index locat word vocabulari retriev list text posit search phrase proxim pattern word consecut close word search separ list occurr intersect care consecut close word posit text recent present import evalu effici index scheme updat queri space requir time space requir function granular defin unit inform repres type invert index identifi faster process slower build index space slower process faster build index space demand call address invert appropri fastest index solv queri simplest index point posit word text construct time space requir higher occurr text size reduc omit stopword vocabulari stopword word carri mean remov user queri stopword repres text word extra space high space requir larg text techniqu exist reduc space list occurr type address invert index document address index list occurr point exact occurr word document word save space occurr word document referenc pointer smaller document text posit normal space requir document address index text size singl word queri solv directli document address access text word document document retriev phrase proxim queri solv inform index store word document form phrase close queri search directli text document relev word call address step divid text block fix size span part document overlap document index store block word block space occupi index small chosen user queri solv sequenti search text document block word index devic filter block collect match index scheme wide system block address index interest transpar index file user index space updat period user file pattern index web provid fast search web page low overhead index techniqu orthogon techniqu reduc space requir invert index compress text index compress reduc space requir kei idea reduc size invert index list occurr word gap consecut posit store absolut valu compress techniqu small integ gap smaller longer longer list compress recent work shown document address index reduc origin size degrad perform improv reduc text compress difficult combin invert index access text random posit present sequenti search part text requir document block address demand uncompress text begin reach desir part recent text compress techniqu reduc text origin size direct search compress text decompress faster search uncompress text compress techniqu base huffman code symbol tabl vocabulari text make coupl invert index invert index block address sequenti search compress text combin singl work present compress invert index index compress text block address studi special techniqu compress block address index studi perform respect block size index built memori compress scheme improv perform reduc cost index construct scheme index user file result improv index search time space compress text compress index origin uncompress file index make arrang transpar system implement compress index file system layer applic file system care compress uncompress text write read web server applic work transpar file system small index find time file user queri show gb text index overhead warm search word pattern phrase pattern work organ section present compress techniqu base huffman code word section explain search effici compress text section present block address scheme section present techniqu compress occurr invert special compress block address index section show complet scheme combin block index compress text compress section present result combin approach isol techniqu section present futur work direct huffman compress larg natur languag text inform retriev effect compress techniqu huffman code bentlei idea huffman code assign uniqu bit encod word compress achiev assign shorter code word higher frequenc compress proce pass text encod make pass text obtain frequenc text word perform actual compress pass tradit implement huffman method adopt charact symbol alphabet success idea merg requir compress algorithm ir system symbol compress word charact word atom ir system built word symbol mean tabl symbol vocabulari natur integr invert index huffman compress method import size text vocabulari empir law wide accept ir heap law state vocabulari text word size fi fi depend text shown fi vocabulari space proport squar root text size larg text overhead store vocabulari minim law relat vocabulari zipf law state frequenc text frequent word time frequent constant depend text text word frequent word constant make frequenc add natur languag text word separ effici deal word separ method call word word word encod word separ encod decod assum space symbol correspond separ figur present compress huffman code oper file export system current compress form word method set symbol case frequenc rose origin compress rose rose figur compress huffman code word show code symbol organ huffman tree huffman method tree minim length compress tree achiev left children exchang node prefer choic applic canon left case figur canon tree effici decod time memori requir algorithm build huffman tree symbol frequenc requir log worst case due zipf averag time linear decompress accomplish stream bit compress file sequenti sequenc bit read huffman start root leaf node word constitut decompress print tree restart tree figur presenc code compress file lead decompress symbol origin method huffman binari code huffman code assign text word sequenc byte huffman tree node huffman huffman code word code result present shown degrad compress ratio experienc byte bit code word vocabulari decompress search byte huffman code faster binari huffman bit shift mask oper import consequ byte huffman code possibl perform fast direct search compress text search algorithm explain section techniqu speed sequenti improv index scheme combin invert index sequenti search sequenti search compress text explain compress text search start gener techniqu search complex pattern speedup gener techniqu present simplest complex scenario final setup larg number form languag origin defin search error call pattern match queri pattern number system retriev occurr word transform queri error delet replac charact search retriev search class pattern posit match set charact charact interest ffl rang charact mean letter ffl arbitrari set charact mean word text ffl complement ab mean singl charact mean singl charact ffl arbitrari charact mean charact charact ffl case insensit pattern text text consid search regular express exampl ffl union mean word text ffl arbitrari number repetit mean word begin ai time ffl arbitrari number charact middl pattern customari denot combin exact match part approxim match part mean exact occurr te occurr xt match nonuniform cost cost insert defin cost gener search techniqu search singl word preprocess consist search vocabulari mark leaf huffman tree search effici binari search hash scan compress byte time huffman tree decompress text time reach leaf huffman word check leaf case report occurr leaf mark return root huffman tree resum text scan pattern simpl perform direct search vocabulari case preprocess phase correspond sequenti vocabulari search mark word match pattern special sequenti algorithm search class error regular multipl pattern combin vocabulari small compar text size fi recal section sequenti search feasibl altern consid section text scan phase differ leaf huffman tree mark search phrase queri phrase sequenc simpl complex pattern extend previou approach brute forc fashion phrase occurr overlap word match phrase phrase set bit mask bit word leaf huffman bit word set match element phrase queri element phrase turn search vocabulari mark bit word match note element simpl word search binari search hash complex pattern sequenti search preprocess scan text time arriv leaf retriev bit phrase element word match search phrase organ nondeterminist automaton state automaton move state state element phrase recogn state activ occurr report state activ automaton nondeterminist moment state activ prefix phrase match time reach leaf huffman send bit mask automaton activ state activ state bit mask activ automaton make transit word text figur illustr phase pattern rose error mean word start word vocabulari match pattern posit huffman tree vocabulari rose row road mark nondeterminist search automaton figur gener search scheme phrase rose error scheme disregard separ word phrase phrase pattern found separ word coupl space space achiev ignor leav huffman tree arriv separ stopword phrase match difficult typic sequenti search algorithm uncompress text avoid phrase span account separ period leav huffman tree bit mask phrase occurr remain problem implement automaton effici algorithm choic simul automaton state length bit comput perform constant number oper text charact mean solv phrase depend extrem fast longer phrase machin word simul techniqu idea algorithm map state automaton bit comput word text word reach leaf suffix activ state activ simul shift bit mask match current phrase element simul oper bit mask found leaf huffman tree shift oper text word search state updat origin algorithm bit search time fi worst term search vocabulari text search oper byte compress faster filter previou scheme gener cope complex search search faster interest examin charact compress text simplest case search singl word previou simpli find word compress search code compress text directli standard pattern match algorithm result algorithm fast fastest search uncompress addit benefit reduc term search faster text read disk problem solv possibl compress pattern present text match insid concaten compress code solv bit byte compress code signal begin set synchron point compress text code align case potenti match verif start synchron point complex case case singl complex find code match word perform search compress text case element search directli verifi surround text match complet phrase occurr element search chosen make search faster longest code code search averag time search text improv scheme search singl obtain length byte compress pattern complex search close express block address block address techniqu reduc space requir invert index system call idea text logic divid occurr point exact word posit block word space save block text posit pointer occurr word singl text block referenc figur illustr block address index block word search block address index similar search word address pattern search vocabulari list block pattern retriev obtain exact pattern posit sequenti search qualifi block index filter avoid sequenti search check reduct space requir obtain higher search cost point reader advantag point artifici block point document natur text collect case simpl queri requir return list match point document adequ choic shown reduc space requir respect word block word block word block block text word occurr index figur block address index block fix size block fix size pack short document logic match block simpl determin document insid block match case requir deliv exact posit match pattern case sequenti qualifi block document find exact posit import type queri phrase proxim index word order determin form phrase point document size good idea larger document search higher probabl search cost expect cost search directli relat varianc size point document suggest document size good idea partit larg document block put small document block size block address analyz import result analyt prove block address index yield sublinear space overhead time sublinear queri time tradit invert index point word document achiev goal shown order obtain space overhead fl set case queri time obtain fi ff relat queri ff vocabulari word match ff exact queri ff fi complex queri time complex sublinear fl space queri time obtain exact queri block size tradeoff relat case correspond word address space requir time singl word queri fi exact mean vocabulari fi space search time index compress show section compress invert index order achiev space reduct fast access invert list describ section simpl techniqu improv compress block address idea avoid store list word text reduc size index amount process queri work show compress invert index found literatur moffat witten block address type invert index previou work techniqu compress invert index classifi code produc output depend adjust code scheme characterist input compress code scheme inform element output fix input necess previou knowledg input requir pass list symbol drawback interest good perform inabl gener invert list directli compress form translat higher index pass merg pass obtain approxim decompress slower code method produc slight compress ratio compar method main focu build block address index improv perform scheme work previou studi shown method invert index compress witten sake complet repeat import unari code block number assign increment pointer invert list ascend order pointer substitut differ previou number list process sequenti start begin origin block number recomput sum gap list smaller integ obtain compress encod repres shorter valu fewer bit unari simpl scheme code integ call unari code unari code number shown tabl studi encod integ code repres integ concaten unari code xc code xc bit xc binari total code length xc exampl present tabl code scheme introduc ffi prefix indic number bit part code code unari code integ requir log xc bit tabl small valu code shorter situat grow present experi method compress index work techniqu combin method direct access list period interv permit speed phrase conjunct queri involv long short list techniqu present work tabl sampl code integ integ unari improv index compress techniqu present previou section develop compress document word address index special featur block address index improv compress perform system block word half block phenomenon common document word address occur frequent block address index larg block size simpl idea improv index compress repres list frequent word word occur half block store block number occur call list complement list altern form compress word run length compress gap half economi space similar length run gap complement list minu block word list gap run length compress list gap yield format repetit complement list list gap note run length compress store inform gap complement list advantag complement list oper effici convert normal list describ perform boolean oper normal complement list time proport normal complement depend result left normal complement form invert index common index stopword save space stopword index cost vocabulari decompress bucket compress compress invert scheme gener invert list proce stage compress stage compress parametr list gener text occurr gener text order occurr sort word repres final sort list separ word gap gener order compress list code global inform list order compress addit list gener memori compress form gener occurr text order sort gener separ word store separ list occurr word text occurr ad end occurr list word comput gap store compress form fly techniqu gener occurr unsort form prefer space store list occurr word wast space pointer store empti space import zipf word occurr store separ advantag avoid final save time combin advantag separ list list gener compress form space improv space usag translat index time text index memori resort disk index scheme avoid sort occurr present harman effici approach store list occurr word adapt typic word frequenc idea repres list occurr word link list node bucket occurr bucket pointer bucket term stream bit repres portion compress list term bucket point structur continu stream bit import scheme size bucket larg extra space pointer small reduc extra memori lost empti space bucket term chosen byte bucket term byte bucket remain bucket term reason smaller bucket term occur collect smaller bucket save memori term figur show list occurr term block code scheme shown list convert list gap code scheme list gap convert stream bit bucket size bit remain bucket bucket term shown figur empti space bucket space repres pointer bucket link list pointer repres dlog number bucket fit memori buffer figur pointer repres bucket main memori block block figur link list bucket compress scheme bucket compress techniqu index larg text make pass text gener index gener appli construct kind invert word document address index index dump partial list disk make pass merg dump integr approach present section combin design includ text block address index compress singl approach result structur figur vocabulari symbol tabl huffman code invert index vocabulari canon huffman tree small extra structur ad search decompress text recal separ present huffman tree searchabl vocabulari word list block word list block number compress techniqu section separ vocabulari decompress build list occurr common choic invert index filter word map letter appli recov origin file filtrat fly search time block block form logic layer natur file structur file physic split concaten implement list file posit file list sort identifi list block block number word span continu rang list file necessarili match file boundari block store identifi file span offset byte file belong block text origin file collect compress separ file singl huffman code space index analyz shown vocabulari fi space occurr fi space heap block fi refer exist list list block file neglig compress vocabulari block canon structur occurr huffman tree text file compress figur structur index size occurr compress reduc space factor independ space fi shown fi small block larger asymptot converg close small block construct index effici built notic process merg singl pass text huffman compress pass pass build index index construct process stage stage stage correspond find global inform interest determin set file index number block comput vocabulari collect frequenc determin list repres complement requir simpl linear pass memori requir store vocabulari list file output disk end comput list file vocabulari text frequenc end total number word collect defin number block collect frequenc paramet number time word occur number block word occur huffman determin list word store simpl complement form statist relev rank number time word occur easi number block requir store word block number block current block increment time word read occurr word check current block increment number block updat block word move stage run huffman algorithm vocabulari build canon huffman tree replac frequenc inform vocabulari word compress code assign tree immedi swap disk small data structur build effici find memori stage vocabulari store memori hash tabl trie order provid averag access stage stage heavier part text file collect order dictat list file word text search vocabulari data structur search huffman code output compress file finish compress version replac origin construct list occurr time word found output compress add entri list repres shown section entri ad store word block recal process word occurr list store complement word block previou block current previou add list block interv current block occurr occurr current block number increment time word process add entri list block point current file process store number byte written compress version file list disk gener map block number physic posit block collect list occurr disk compress form save vocabulari disk pointer place list occurr word start file occurr problem scheme fact index store occurr list memori construct time problemat rest small buffer disk gener final entri list list solut chosen time memori fill store occurr comput disk free space start empti list stage end stage set partial occurr list merg order word correspond list word concaten order gener auxiliari inform store partial list identifi word belong word identifi length list analysi collect vocabulari text linear time provid adequ data structur trie word worst case linear time hash tabl averag linear huffman construct linear expect time word follow statist rule wide accept text shown process stage linear time neglig practic stage linear discuss data structur find text word vocabulari compress code output total space text linear ad block number end list occurr constant time text word linear stage merg list memori index partial occurr list gener merg total merg time stage avoid resort virtual write partial list disk merg faster practic interest merg phase commonli compress block index tend small machin mb ram word block length small block index collect size close gb stage search describ search process divid step explain search singl element show search phrase step step search find queri pattern vocabulari singl regular data structur index time speed resort sequenti binari search save space explain section list word match built binari mask case phrase step advantag block simpl sequenti search queri pattern match set vocabulari word search singl list block word occur merg singl order block number block exclud final list occurr queri element list merg compress form decompress fly time merg list element decod bit compress gap add gap element list process techniqu reduc size list complement long list oper complement list time proport complement list complement list complement result intersect complement word simultan sort alphabet order requir canon huffman extra indirect arrai requir complement result intersect appli complement proce set step final step sequenti search find exact document posit queri occur block mention list occurr match word search block structur determin portion file sequenti search algorithm sequenti search index choic respect search sequenti compress code match word simultan inform word clear search perform degrad number pattern search grow index inform block vocabulari word match imagin queri match word block block search search word make search text block price pattern preprocess block set pattern search depend block small idea mention test phrase search queri pattern sequenc regular main idea search phrase intersect occurr list involv block element phrase block block boundari proce pattern list occurr pattern obtain make union list vocabulari word match pattern list pattern intersect perform sequenti search block pattern time unlik case simpl search block occurr complet queri natur question point avoid lose phrase lie block intersect method fail solv consecut block overlap word index time determin search phrase word block end word start word small overhead solv elegantli phrase word complet insid block main problem limit index time longest phrase search word longer modifi list intersect contigu block verifi word phrase block word block solut slightli relax rule block word long move block boundari make match end sentenc separ case phrase cross block boundari make block overlap limit length phrase search text bit complic sophist proxim search sequenc word correct order interv text accommod similar sequenti search techniqu search sophist block boundari made overlap word analysi analyz perform search process step analyz section phrase element fi fi time depend complex search step merg intersect list analyz section word occurr list averag cost merg list log cost intersect list phrase pattern log list store compress form long list compress repres complement effici handl cost step neglig compar step search cost text remain determin percentag text block index pattern block word fi ff random word fi vocabulari word select probabl block select word search fi block cost total search cost fi fi cost approach word address index phrase search shown zipf shortest list random word constant length mean averag search block phrase time cost intersect list similar sequenti process total search cost fi fi singl pattern fi phrase consid constant simplifi final complex updat final issu updat index document modifi procedur updat normal invert index extra complic block index remov document simpli handl remov refer occurr point block document overlap remov complet block total remov altern block size incorrect degrad perform insert document handl ad block document compress index occurr list merg index shown block size grow text size grow choic handl updat type index period index complet rebuilt period interv daili choic impli limit updat frequenc maxim size handl updat manner make light paid slight degrad index perform period rebuild document mark delet list document physic delet alter index block sequenti document skip make block word anymor remov file collect fast good choic compress add incomplet block index creat block add entri block list word document fulli integr document collect time choic add identifi document special block index includ sequenti search file index search sequenti time rebuild degrad slightli perform make insert fast index forc rebuild user determin extra block larg handl replac delet insert complic fact compress text case period avoid text frequent handl increment modif huffman code alter frequenc word alter optim code word huffman tree choic leav placehold tree fake word frequenc node word time placehold creat word total disappear discov occurr list place tree left placehold word ad begin expect word disappear low techniqu placehold yield neglig degrad compress accumul mechan recov optim huffman code choic period period larg shown section challeng altern perform small modif tree optim minim number file open research issu pursu altern method studi escap code word huffman tree repres explicitli text special scheme method avoid compress degrad accumul time show good idea word low put tree improv tree reduc lot vocabulari merg invert index word vocabulari avoid text word found vocabulari infrequ word interest ir frequent search vocabulari size problem current comput server problem solv addit escap track vocabulari word result present section result evalu effect combin approach test literari text trec collect chosen gigabyt ap newswir doe short abstract doe fr feder regist wsj wall street journal articl comput select disk collect put singl file consid word contigu string charact set separ charact set test run pc pentium ii mhz megabyt ram run linux perform task disk interfac scsi ultra show time construct time space start evalu time space build index function block determin effect compress techniqu figur show time main memori requir construct index compress text collect vari block size word ram requir includ structur space store data compress algorithm space list bucket term collect index gb built minut mb ram build ram build partial index merg differ block size grow due reduct number entri index compress text index main cost text share index includ time index collect mg block size control ad artifici document termin insid uniqu file mg time slower includ comparison control block size split input real file slow index time point make comparison useless size block mg size block main memori figur time build index main memori usag mb index vari block size compress ratio space overhead space overhead final index figur show number bit entri block size grow gap valu tend smaller larger reduc number bit repres index entri code plot show differ method part figur show size index function block size index size reduc quickli block size grow due main reason reduct bit entri explain number index entri reduc block size grow figur show gain compress obtain complement modest complement list size block gamma complement list gamma complement list delta complement list size block gamma complement list gamma complement list delta complement list figur bit entri size compress index percentag uncompress text vari block size search time search time measur randomli pattern text experi pattern averag pattern pattern size figur show time exact approxim search block size vari word sequenti search algorithm fast filter section match problem solv synchron point search time includ load correspond run server vocabulari load memori answer request user size block word word word size block word word word figur time exact search error pattern word vari block size figur show amount text experi small percentag text small index search time percentag text drop quickli search number block involv word smaller size block word word word size block word word word figur amount text exact search error pattern word vari block size note block size word jump search time counterpart amount text fact correspond cach show complex paramet involv complet tune index type made select good block size practic target system compar figur relat index built gb text case produc index text size build index space overhead index smaller translat search construct index minut index minut includ text compress exclud mg comparison retriev function total mg retriev document rank index retriev exact posit insid document includ comparison sequenti search show gain due sequenti search softwar base softwar sequenti search compress text sequenti search algorithm index result shown tabl ii time methodolog time includ time load vocabulari memori notic search time index improv lot block word occur search note gain tabl ii comparison search time exact search word index error word index sequenti search higher warm evid figur final note faster exact search phrase word due fact suffici long amount text sequenti small paramet interest overhead find relev block effici prototyp aspect updat text finish show experi behavior compress ratio text updat techniqu discuss section implement leav special escap symbol huffman tree escap code string code byte escap symbol list newli insert word search algorithm alter account escap code figur show delet affect compress qualiti trec text compress separ remov text collect mb compress ratio basic mean frequenc word total text approxim small fraction text part figur show success insert affect compress qualiti wsj file file insert rest exist code escap code curv permit compar optim compress obtain compress build huffman code text insert rest compress ratio modest price text process ap doe wsj compress ratio text process figur compress ratio obtain delet portion file insert text wsj test pessimist huffman code built collect text complet delet collect insert figur show compress ratio obtain increment compress ratio compress ratio text process ap wsj ap doe ap figur compress ratio obtain replac collect paper shown combin idea reduc size invert index text block invert index compress text permit direct search index compress techniqu specif block address index integr idea fine tune paramet result suggest block size word gb point reason index space search time block size index mb text cach memori construct mb repres text search time warm state reason percentag text space overhead result index text compress origin text size achiev search time gb shown index time faster number issu boolean effici boolean oper invert document address clear advantag oper translat set oper list occurr smaller index oper list block reduc text scan structur add support structur limit occurr occur insid text shown invert index significantli support structur text queri index structur tag distinct word translat structur queri oper word tag word tag block address index filter block occurr flexibl pattern block address index filter text sophist pattern approxim search word effici reflect index updat text collect period rebuild larg collect storag manag techniqu contract occurr list interest integr idea problem search web block address distribut search space size comput load central search engin handl smaller index current index scalabl pure central architectur server distribut queri small number local server local index case block size uniqu local index block text compress vocabulari block integr advantag local compress depend architectur system scalabl main disadvantag cooper site problem singl network traffic idea pursu relat harvest refer text search error proc south american workshop string vol pp distribut search architectur web person commun approach text search commun acm content structur text retriev acm special interest group manag data record indic approxim text retriev journal american societi inform scienc de la model visual queri languag structur text proc south american symposium string process inform retriev pp algorithm multipl pattern match proc scandinavian workshop algorithm theori pp modern inform retriev addisonweslei text compress prentic hall local adapt data compress scheme commun acm harvest inform discoveri access system proc intern world wide web confer pp increment index inform retriev proc larg data base confer pp codeword set integ ieee transact inform theori encod ieee transact inform theori invert pp text retriev confer proc text retriev confer pp text retriev larg digit librari peter proc european confer digit librari pp inform retriev comput theoret aspect academ press method construct code proc institut electr radio vol pp index full posit inform larg text proc intern acm sigir confer research develop inform retriev pp winter tool search entir file system proc usenix technic confer pp text compress softwar practic experi larg text file comput system assoc gener compress invert file journal american societi inform scienc compress dynam document ieee transact knowledg data engin time sort skew distribut proc symposium string process inform retriev pp flexibl word search compress text acm transact inform system previou version intern acm sigir confer research develop inform retriev symposium string process inform retriev file search text compress proc australian comput scienc confer pp effici structur phrase queri roddick proc australasian nz pp manag gigabyt morgan kaufmann edit text search error commun acm human behaviour principl effort
DB/1104 3 repres semistructur oem di abstract paper discuss possibl repres synthet semistructur inform notion data semistructur structur complet requir tradit manag system base graph base languag www site inform show inform encod typic semistructur inform repres queri mean tsimmi web queri system integr site content explor exploit mean introduct data semistructur structur complet requir tradit manag system survei semistructur inform semistructur structur data vari wrt wrt data fairli structur evolv rapidli tradit system forc data adher explicitli rigid dynam data applic involv larg amount semistructur data drawback data irregular conform rigid schema relat presenc irregular data forc null handl research issu relat commun complex object ident inherit enabl difficult design schema accommod irregular data difficult decid advanc correct schema structur data constant data element type data conform previou structur ad work partial support project italian ministri scientif semistructur inform data integr heterogen data sourc data integr naiv fashion heterogen discrep data inform miss attribut sourc entiti repres type sourc effort typic spent ensur integr data structur conform uniform schema addit effort requir inform sourc sourc ad data store world wide web typic web data vari structur site web site store inform web user advantag abil pose queri involv logic data relationship site creator made queri semistructur expect user fulli awar complet structur evolv dynam import requir full knowledg structur express queri system featur frequent schema reason synthet data adapt applic involv semistructur data manag fact strength dbm effici concurr crash project schemata prove good convei inform data reason kind schema essenti process queri formul heritag world paper discuss possibl repres synthet semistructur inform notion schema applic refer project involv schema queri languag www includ architectur web queri system show inform encod typic semistructur inform oem repres queri mean tsimmi web queri system integr site content explor exploit mean web queri system set integr tool effici effect retriev inform world wide web repres semistructur oem refer scenario inform web site content repres oem exchang automat translat schema user formul queri system translat queri lorel languag queri present answer user schemata site schema queri transpar user paper organ section concern major research stream tsimmi project section recal model section present translat oem schemata map queri schemata lorel languag architectur web queri system integr tsimmi section section draw relat work main research stream recogn queri manag www program focu approach gener program facilit queri data retriev directli sourc wrapper accept queri standard queri inform fetch relev inform document case return result approach found sim project wrapper gener order provid queri semistructur www sourc infosleuth project develop wrapper translat standard sql queri inform retriev support classic schema repres semant data sourc actual data note data format remain intern data schema conceptu queri formul ground idea convert data base common inform store repositori order queri standard queri repositori origin semistructur data queri initi formul inform code wrapper time convert sourc data common data answer user queri approach data integr adopt system araneu strudel wrapper sourc origin format client queri sourc result queri result queri queri sourc format chang languag sourc origin format client queri result queri common model queri resolut wrapper model initi data request sourc data retriev initi fig program base approach approach araneu project semant base standard relat web site crawl emploi induc schemata web page fine grain page schemata combin build relat view result relat view queri standard autonom web site tsimmi project born stanford aim develop tool rapid integr heterogen inform sourc includ structur unstructur data sourc interest endow wrapper main convert underli data common inform model oem exchang process consist user defin oem class data extract techniqu base textual filter appli initi object site data oem data model basic idea object label describ mean label extract inform object repres underli data task tsimmi wrapper convert queri languag common call lorel request sourc execut oem object obtain extract process fix provid usual benefit dataguid introduc dataguid sort dynam schemata gener oem inform emploi order make index queri easier repres semistructur oem interest note tsimmi project inspir sourc data dataguid index queri semistructur provid facil charg schemata context strudel singl graph data model similar oem data sourc uniformli queri languag data integr data store strudel graph data repositori extern sourc view graph commun data sourc set wrapper wrapper map extern sourc data strudel collect object translat strudel queri queri oper understood sourc approach defin virtual schema map content data sourc categori classifi resourc descript framework data model base direct label graph repres web site metadata rdf formal consortium web facilit synthet web site content industri commun reach convict web site semistructur data repres sort schemat order fulli access understand orient approach structur queri www data base briefli section descript queri languag specif design web site base graph queri languag extend includ standard hypermedia design express model entiti relationship navig concept approach requir total semistructur data common data complement site content inform semant choic graph orient approach observ oem idea project graph formal visual languag unifi navig logic aspect web site model languag main languag support queri web differ approach semistructur data explicitli schema easili deriv design phase web pose answer queri site real issu long schema remain queri base schema give result period refresh schemata repositori toler amount case site evolut affect structur site point answer www queri portion www site point schema reflect site answer queri access point site user navig real page approach altern classic search web kind inform normal browser instanc queri depict direct label node repres edg relationship object detail languag found recal main node type indic simpl slot perceiv abstract entiti properti mean aggreg simpl person kind node describ index entri hypermedia structur graph edg logic navig label indic relationship program goal queri restructur inform web site page rule arrang program view web site user goal appli isol desir inform arrang present style horn rule string string string string string string string string string string string string string string string string string string string string string string string string string fig sampl schema repres semistructur oem log repres implic distinguish bodi rule head graph repres part correspond bodi color red part correspond head green thin bold black queri includ dummi match type node schema yield great flexibl queri express includ schema repres restaur chain main entiti depict rectangl rest area restaur attribut entiti depict node depict triangl special node repres page singleton home page site fig outlin sampl queri aim select restaur green node access point queri result mean queri result present list select string result fig sampl queri easi presenc schema necessarili restrict cite section schema deduc oem data irregular data repres notic express atom complex object schema situat depict introduc slot directli link entiti link rate slot link entiti opinion link redund repres problem relat schema instanc queri fig aim select restaur rate rule captur queri node list link restaur mean uniqu result list request select rate part rule pertain note rule simpl cut past part schema graphic queri editor string great rate opinion string great restaur restaur rate fig queri schema base approach apt repres data structur method obtain compact data approach appli structur data worst total unstructur sort data schema instanc tend ident aim exploit structur data lose capabl describ unstructur data sourc import underlin initi develop gener data case flat file file repres data anim relev inform speci text photo anim imag file cri audio file data domain knowledg exploit creat schema fig repres larg amount inform provid string string string string string string locat famili string string audio imag anim environ countri contin class order food photo cry fig sampl schema anim presenc schema refer data compact instanc graph multimedia file consid mean refer softwar modul advantag answer queri submit base abstract repres semistructur oem section outlin translat data sourc dataguid schemata express oem section idea repres data graph inspir project deal queri semistructur data tsimmi project adopt orient approach base graph base data model relat lore oem graph shown fig type price opinion rate restaur rate fig sampl oem graph standard main object oem object object identifi ffl label describ object ffl data type object object atom complex case type string data consid type object complex ffl variabl length atom object object collect oem subobject link parent textual label compon oem structur captur semant object oem structur flexibl encompass type inform oem object translat standard textual format format inform semant content easili program format text fig textual oem complex atom object semistructur oem fix schema advanc place standard lore project altern tool repres structur oem oem call straightforwardli gener oem dynam maintain order provid function provid mean schema interest remark oem dataguid repres summari structur strong dataguid induc straightforward correspond sourc target set object dataguid dataguid atom valu essenti program user explor oem formul queri dataguid oem object translat standard textual fig repres dataguid previou oem graphic depict fig repres semistructur data synthet basic aim straightforward dataguid deriv graph base oem sourc data oem syntax express navig web instanc queri involv kind relationship web express oem dataguid data lack explicit navig inform object complex type exist exploit inform logic connect object outlin section schemata type repres complex object class repres atom object repres complex oem object node label atom oem object mean printabl node label oem bind complex object subobject relationship repres semistructur oem restaur restaur type price opinion rate restaur rate opinion rate fig oem instanc dataguid textual scenario mean logic link parent object subobject textual label subobject complex set label link compon object translat algorithm fig oem entri point identifi obj translat oem object graph persist entri point procedur child oem object creat cycl add oem complex object node procedur complex object add link visit object atom oem object translat slot fig algorithm translat oem object graph oem object correspond oem dataguid object fig textual format notion object identifi object includ children multipl complex object oem persist requir serv entri point persist entri point appli previou method start order obtain entir oem data sourc note figur depict schema deriv dataguid textual fig entri point translat process outlin section appli oem object produc graph dataguid oem repres semistructur oem string string string fig oem dataguid textual format translat graph translat dataguid translat gener oem instanc translat queri lorel queri queri translat algorithm condit complex readabl paper describ simplifi version algorithm show work sampl queri queri depict fig list restaur target oper repres green consid result list target inform includ select lorel queri set default complex queri translat constraint result set satisfi express sampl condit restaur written slot visit queri graph node obtain proper path express translat algorithm lorel translat queri select root charact lorel variabl length path start root note languag constraint navig start entri point similarli queri depict fig translat lorel select restaur root string string result return node insert select root string select label string path queri string null node visit string constraint return fig algorithm translat queri lorel queri worth notic queri ad boolean oper express disjoint translat queri integr web queri system translat defin project base distribut architectur main focu descript web site mean schemata schemata made user special modul repositori schemata client pose queri data sourc apt user base inform schemata queri execut perform remot queri manag run target web work intern site data depend site extract html page exist begin site life kei concept web site develop matter defin techniqu common idea graphic site structur inform extract extern data sourc develop effort exploit gener schemata creation resolut queri repres semistructur oem keyword answer schemata remot site schema instanc instanc present issu local queri manag present issu instanc queri answer queri partial answer user interfac queri schema robot queri manag remot schema search area client area remot site area repositori schema thesauru fig architectur approach includ automat process induc schemata exist interest exploit result obtain project topic chosen inform induc mean tsimmi system tsimmi wq mediat architectur element aim receiv lorel queri client forward wrapper queri resolut mediat collect result heterogen data sourc send back client wrapper distinct aim resolv queri access data sourc translat queri result oem object back mediat integr project fig tsimmi site logic structur descript knowledg instanc inform dataguid inform typic translat oem section store descript tsimmi site schema robot repositori user interact schema queri formul user convert lorel queri translat lorel queri site wrapper execut tsimmi mediat queri queri result produc wrapper oem object back client translat result instanc worth notic kind queri translat navig queri queri client client tsimmi schemata tsimmi remot queri manag wrapper sourc mediat mediat sourc side oem side mediat sourc wrapper schema robot tsimmi fig integr architectur issu schema deriv oem navig queri involv logic translat lorel difficulti futur work paper present techniqu queri semistructur effect coupl approach queri world wide web shown feasibl integr base site content object exchang model experi easili transfer base web queri araneu environ seamlessli manag inform site content deriv approach plan produc complet toolkit studi extens approach base system acknowledg author baldi discuss subject due goldman assist tsimmi system repres semistructur oem refer serg queri intern confer vol pp jan knoblock wrapper gener internet acm sigmod intern confer manag data build relat view web intern confer data engin page washington brussel april ieee widom wiener lorel queri languag semistructur data journal digit novemb jr cichocki fowler kashyap martin nodin rashid rusinkiewicz unruh semant integr inform open dynam acm sigmod intern confer manag vol pp acm structur queri web languag proc june widom tsimmi integr heterogen inform sourc octob chawath chang detect structur acm sigmod intern confer manag tanca semant approach structur queri web site ifip work conf semant web site manag acm sigmod intern confer manag vol pp acm mchugh standard textual interchang format object exchang model manuscript goldman widom enabl queri formul optim semistructur intern confer larg data pp crespo extract semistructur inform web paper swick resourc descript framework model syntax technic oct papakonstantin object exchang heterogen inform intern confer data ieee comput societi mar tanca declar graphic queri languag ieee tran knowledg data pp lightweight object repositori semistructur acm sigmod intern confer manag jun
Agents/1105 1 system boundari abstract joseph robot institut carnegi mellon forb avenu pa introduct robot institut carnegi mellon forb avenu pa katia sycara robot institut carnegi mellon forb avenu pa multiag design ma commun membership capabl architectur matchmak agent queri architectur diagram oaa retsina queri tabl retsina oaa queri tabl translat queri translat protocol ad cross registr repli translat specif messag retsina agent session layer retsina commun repli queri agent persist queri tabl oaa agent session layer oaa agent librari facilit queri api layer layer agent session layer messag translat translat translat queri answer preliminari evalu relat work refer
IR/1106 5 text element context displai search result inform retriev system model research result abstract offer inform system hebrew jerusalem tel fax inform retriev system displai search result method paper model displai list search result mean textual element util inform unit replac inform unit paper includ short descript studi support model introduct growth number scope global special approach requir locat perspect user interfac exist outstand internet search engin displai inform serial order list result partial attempt rank list includ document url line document displai incomplet insuffici search queri requir user read document list discrimin search engin search transact yield list hundr thousand studi show averag user result find solut paradox present challeng research field paper suggest locat relev document read list document model displai textual search result deal challeng present section defin hierarch structur level displai search result figur search result displai textual reli basic visual textual compon design list result articl sole textual compon displai search textual compon consist intern document inform extern document inform result base intern document inform number techniqu includ inform compon relat search topic descript method sentenc sentenc descript sentenc base defin paragraph sentenc relev search queri includ term reason document chosen word word document keyword frequent repeat word author determin produc automat frequent repeat word comput gener stop list yield result similar exact winograd inform html tag languag tag provid inform document paragraph subtitl head locat gener tabl content tag inform document record document amount account tag commerci rate studi util tabl al chimera shneiderman addit inform addit inform gener actual document includ citat titl cite document assum subject common pirolli sentenc word intern document inform displai search result techniqu inform html tag displai search result textual techniqu addit inform graphic techniqu document classif figur model displai search result extern document inform cite document inform data base result base extern document inform categori util number method includ inform compon base subject field actual document descript method document classif method displai categori document search engin manual defin document categori creat categori aid subject associ document establish cluster search result al etzioni cite document refer situat document cite subject common cite document locat directli scienc citat index cite document titl cite paragraph al inform document locat provid indic subject number wai subject orient subject field attempt made determin subject field titl addit document research displai search result research object locat inform compon search result displai relev order make task locat inform effici effect research question import inform detail displai search compar method displai search result method prefer term accomplish research agenda includ perform search task number user group task carri interfac research creat includ document defin search queri studi interfac effect user check object time accuraci subject relev inform compon particip research group includ student school busi administr technic support personnel comput inform specialist librarian inform field statist includ anova test examin differ test determin result standard statist standard initi particip work interfac subject examin contribut made displai line inform document addit titl interfac titl titl line document head intern document sentenc model figur titl line search context intern document sentenc relev search queri comfort confid research differ method relev differ found method method line search prefer aspect subject dimens feel confid relev object dimens search method advantag case complic method advantag handl simpl moder complex task research snap shot interfac time method difficult task simpl task particip work interfac subject check contribut made displai keyword inform item displai studi keyword refer intern document descript model figur interfac tk titl titl line document head titl line search context keyword research snap shot interfac differ found method method search context prefer subject dimens method possess advantag case search time moder difficult task comfort confid research differ method relev tk differ found method method search context prefer subject dimens method possess advantag case search time moder difficult task particip work interfac subject check contribut made displai document categori addit line document refer extern document classif model figur interfac titl titl line titl line search titl line search context categori comfort confid research differ method relev differ found method method possess advantag subject dimens search time task difficulti level examin search result displai paramet import user find show confid answer import paramet search time abil find answer read document user conveni found import paramet search process time time tk method method difficult task simpl task difficult task simpl task research snap shot interfac particip work interfac subject check contribut made displai document common word organ publish paper addit line document refer extern document classif model figur document address refer extern document data base common word refer intern document word organ publish paper refer extern document data interfac titl line search context titl line search context titl line search context common titl line search context organ comfort confid research differ method relev differ found method method possess advantag subject dimens search time task difficulti level examin search result displai paramet import user find show abil find answer read document import paramet confid search time user conveni found import paramet search process time method difficult task simpl task research snap shot interfac find object studi examin compon search result displai model studi perform enabl definit inform unit replac unit found addit altern inform unit includ line search indic document categori document categori accomplish common word author articl administr benefit includ suggest inform compon document standard mean interest find reveal feedback paramet user consid import data retriev system feel confid system perceiv higher prioriti speed locat answer read list document user assign low prioriti studi plan includ evalu addit inform compon model acknowledg excel suggest research alon assist gather data research assist gather data research refer interfac navig cluster document set return acm confer organiz comput system empir evalu user interfac topic manag web acm pittsburg interfac support contextu evolut user exploratori evalu interfac larg tabl acm transact inform octob user interfac text retriev sigchi juli behavior evalu analysi hypertext chi queri onlin studi user interfac interact acm transact june infoseek experi search sigir vol num keyword context index technic american xi law electron chi april dynam cluster interfac web search
ML/1107 6 estim mixtur model imag infer spatial transform em algorithm frei beckman institut advanc scienc technolog illinoi abstract present ieee confer comput vision pattern ft mixtur model cluster algorithm simpl wai repres imag set data center situat imag includ background clutter transform shear method extract data center includ clutter repres di erent transform essenti data face imag di erent cluster repres di erent pose clutter version di erent scale rotat includ clutter transform latent variabl mixtur obtain mixtur invari speci ed set transform show em algorithm model jointli estim mixtur model data infer transform imag show algorithm jointli align imag human head learn di erent pose algorithm perform nearest neighbor mixtur gaussian handwritten digit recognit introduct interest develop algorithm learn model di erent type object unlabel imag includ background clutter spatial shear warp fig show greyscal imag handwritten digit greyscal imag person walk clutter background chang pose origin imag handwritten digit high easili normal horizont vertic scale translat digit written di erent amount shear ect remov simpl fashion imag figur imag handwritten written di erent amount shear imag di erent posit di erent pose human head includ background clutter multipl align imag trivial task gener statist method jointli learn mixtur di erent pose suppress background clutter normal spatial transform method assum data order case time seri video tempor coher valuabl model data show techniqu cluster add latent imag transform crop observ imag figur gener process mixtur extend account tempor coher approach solv vision problem train recognit model accur predict class membership input imag video sequenc approach includ method nonlinear regress techniqu neural network bayesian approach train gener model accur model data includ graphic enter pictur fig schemat show transform mixtur gaussian model face mixtur model background clutter independ gaussian model spatial transform distribut discret set matric act vector pixel stage speci set paramet cluster mean probabl model gener imag gener cluster randomli chosen mix proport randomli chosen pattern ad cluster obtain latent imag transform select random appli latent imag result crop small amount sensor ad pixel obtain nal observ imag model train em adjust paramet likelihood set data input learn procedur consid transform cluster adjust cluster mean model appropri transform cluster pair comput train case cluster mix proport level adjust gener model pattern classi cation train model class data model train set classifi test case select gener model highest posterior probabl test case gener model mg speci es probabl densiti vector observ pixel model prior probabl uniform loss function argmax class data ad simpli train extra gener model formal de ne transform mixtur gaussian describ model train set em algorithm give result synthet show extract translat invari cluster outdoor video sequenc clutter background compar cluster cluster found tradit mixtur model rst princip data transform mixtur gaussian cluster index cg cluster mix proport probabl densiti vector pixel valu latent imag cluster latent imag diagon covari matrix speci es variabl pixel latent imag data interest diagon covari matrix full covari matrix di erent cluster repres di erent type latent imag varianc map region background clutter true transform variabl latent variabl introduc complic integr em learn algorithm assum xed set transform set speci ed algorithm simpli ed assum vector pixel valu transform imag obtain multipli vector pixel valu latent imag matrix permit broad class includ rotat rotat lg index set transform repres matric transform matrix implement crop simpli produc pixel crop imag pixel observ imag depend small number pixel latent imag matrix number column equal number pixel latent imag number row equal number pixel observ imag probabl densiti vector pixel valu imag transform latent imag diagon covari matrix speci es observ pixel varianc pixel latent imag di erent varianc pixel observ imag model pixel valu cluster coher latent imag transform model observ pixel depend transform scale rotat select ahead time set transform ectiv cover rang transform data time small learn time reason assum xed prior probabl assign transform learn train data joint distribut cluster transform latent imag observ imag gener cluster transform index latent imag unobserv variabl gener imag consist draw cluster index draw latent imag draw transform index draw imag number paramet roughli equal number paramet standard mixtur model number cluster sec show ml estim model obtain em algorithm set model comput likelihood imag sum integr latent variabl turn latent imag integr close cluster transform imag covari matrix probabl densiti comput likelihood linear time observ imag turn comput likelihood includ comput covari matric scalar oper comput linear due transform matric notic number pixel latent imag translat integ number singl row row scale singl row scale row transform matrix nonzero element nonzero element invert scalar oper nonzero comput scalar oper class singl remind reader factor analysi model factor likelihood comput requir scalar oper select number transform number scalar oper likelihood comput linear mind attempt exhaust set transform grow polynomi horizont vertic rotat meant deal moder number transform algorithm kalman lter base face track align data extract detail cluster em algorithm transform mixtur gaussian describ iter expect maxim algorithm estim maximum likelihood paramet repres paramet gener model assum iid deriv train set respect paramet log log deriv rearrang rewritten log log expect base posterior updat set ignor depend expect solv obtain modifi chang posterior distribut expect deriv equal expect maxim algorithm consist iter comput set paramet recomput expect base updat paramet procedur consist likelihood train data xed number iter number iter determin monitor valid set maxim set solv paramet obtain updat equat base expect statist comput averag train set vector diagon element matrix diagon matrix diagon element vector comput product vector denot updat paramet hp hp hp hp hp diag notic transform index sum expect transform probabl hp order avoid tting set diagon element equal expect statist comput singl pass train set comput covari matric matric depend comput express obtain rearrang term expon obtain distribut pass train cluster transform pair train case normal constant comput margin normal obtain comput deriv margin obtain expect expect comput expect comput perform em iter linear time turn em iter scalar number pixel observ imag reason show matrix comput scalar oper nonzero element multipli vector scalar oper train comput statist scalar oper extract shape synthet data fig show exampl train set case imag imag larg larg small lled squar small background produc randomli select pixel intens independ uniform distribut background includ xed distract form pixel set maximum intens figur extract transform invari structur synthet data train includ background clutter xed distract mix mean varianc mix mean varianc mixtur gaussian princip compon figur imag person walk clutter background camera cluster mean varianc train iter em algorithm train cluster translat transform horizont shift vertic iter em algorithm weight initi random valu mix proport initi equal fig show mix cluster mean diagon element cluster covari matric extra cluster rst cluster model remain cluster model remain shape notic varianc pixel background pixel high versu foreground pixel low fig show paramet learn iter em algorithm tradit mixtur model cluster model view special type ident transform shape sever blur model distract number cluster model captur di erent transform di erent cluster shape distinct cluster train set pattern train mixtur model cluster pattern result sever tting fig show rst princip train data cult imagin compon reconstruct data accur extract translat invari structur outdoor video sequenc clutter background fig show exampl video sequenc person walk highli clutter background camera figur mix cluster mean cluster varianc train iter em algorithm note cluster account data mix cluster mean cluster varianc tradit mixtur model princip compon train data train cluster translat transform horizont shift vertic iter em algorithm synthet weight initi random valu mix proport initi equal fig show cluster mean varianc background detail face retain fig show exampl video sequenc individu chang pose train cluster translat transform horizont shift vertic iter em algorithm fig show result mix cluster mean cluster varianc cluster suppress background signi movement object eld vision cluster includ part cluster low mix proport fig show mix cluster mean cluster varianc tradit mixtur knn figur estim error rate con denc interv mixtur gaussian transform mixtur gaussian task handwritten digit recognit complet disjoint train set test set partit obtain estim imag experi train set exampl digit test set exampl digit number lower box give pair null hypothesi method ident perform dot low method di erent statist signi canc model train iter em algorithm cluster mean signi cantli blur comparison mean found fig show rst princip compon train data compon shown account wai perturb data obtain vertic diagon shift handwritten digit recognit train class handwritten digit small subset archiv classifi test case transform captur combin number cluster determin set train data valid make problem model train imag fig compar perform tradit mixtur gaussian classi perform summari introduc type gaussian mixtur model invari transform present em algorithm learn model paramet algorithm capabl suppress background clutter learn translat invari structur synthet natur imag gener statist method appli varieti type includ extend account tempor coher time seri explor compon mixtur model replac probabilist form pca wai approxim infer number comput iter em scale refer jepson model optic ow ieee confer comput vision pattern june pp wang move imag ieee transact imag special imag sequenc vol pp septemb motion segment nonparametr mixtur ieee confer comput vision pattern june pp transform mixtur submit neural inform process system confer turk journal cognit vol moghaddam visual learn object ieee transact pattern analysi machin vol pp juli sung learn human face mit ai memo paper invari neural face ieee confer comput vision pattern june pp rubin algorithm ml factor vol pp frei compon joint estim spatial transform imag submit intern confer comput
Agents/1108 1 environ center analysi design coordin mechan keith decker umass technic report depart comput scienc massachusett amherst ma work support darpa contract offic naval research contract nsf contract cda content inform necessarili reflect posit polici govern offici infer environ center analysi design coordin mechan dissert present keith decker submit graduat school massachusett amherst partial fulfil requir doctor philosophi depart comput scienc fl copyright keith decker reserv decker iv acknowledg left gener electr return graduat school appli work victor distribut ai deepest victor support vic push thought id member paul cohen suppli invalu guidanc statist remind fail rememb tuft graphic principl paul act mentor umass interest methodolog ai catalyst made structur thesi crystal year complet jack stankov tough reader avoid dai work open comput remind work interact tradit distribut comput doug point methodolog fail bit organiz theori encourag open thesi reader comput scienc dai research commun friendli id intellectu susan ed steve piotr mike frank jeff katia sycara special le continu remind social aspect dai research support direct work special technic alan wrote local schedul part collabor fruit id bart ship beer tast wine peopl friend offer support encourag year special extend suppli wash machin garden advic indoor outdoor recreat parti current member di lab happi exchang idea put research dave marti dan bob alpha sue lander note dave provid style file marti provid parallel schedul talk chapter saddl read paper start made friend year remain friend clair lauren alan sue doug ellen riloff friend iv hospit softwar experi scott carol toni alic joe mccarthi rubinstein david skalak amalgam give summer real return graduat school phd due support encourag remain indebt special jim drag amherst back fun peopl cmu interest taught ai cognit perspect social perspect dai natur elain john anderson doc moor convinc math major physic major mike joan drag amherst big parent emot support long vi abstract environ center analysi design coordin mechan keith decker carnegi mellon renssela polytechn institut massachusett amherst direct professor victor lesser professor paul cohen professor john stankov professor dougla act manag interdepend central research issu distribut artifici intellig research shown singl organ coordin mechan environ problem coordin activ distribut intellig agent control distribut sensor schedul peopl distribut diagnosi error telephon concurr agent inform gather design coordin mechan group comput agent depend wai agent task environ depend structur task uncertainti task structur task structur includ scope problem face complex choic face kind pattern interrelationship occur task exampl uncertainti includ uncertainti priori structur action outcom agent action depend hold system comput mixtur design coordin mechan depend properti agent thesi design coordin mechan reli principl construct agent reli structur characterist agent task environ presenc uncertainti high varianc task structur lead perform coordin algorithm adapt episod structur characterist environ central guid design coordin part eventu theori partial develop vii approach develop directli repres salient featur comput task environ uniqu featur includ quantit repres complex task divid task environ model subject level extend standard methodolog framework appli publish predict agent perform distribut sensor network problem predict effect ad chang rel cost commun chang agent organ show coordin mechan design respond featur task environ structur develop gener partial global plan famili algorithm gpgp cooper coordin compon uniqu built modular mechan work conjunct fulli function agent local schedul gpgp differ previou approach ti singl agent exchang global commun multipl level separ local schedul compon prove gpgp adapt learn perform simul conjunct heurist local schedul randomli gener abstract task environ viii tabl content acknowledg abstract vii list tabl xiv list figur xv chapter studi repres task environ analyz distribut sensor network environ design famili coordin mechan place work context scope applic chapter summari relat research task environ task environ coordin social view coordin ration system coordin natur system institut coordin open system coordin econom system environ affect coordin social view environ affect coordin theori definit environ affect coordin inform process environ affect coordin theori transact cost econom theori ix transact cost econom environ affect coordin social structur analysi environ affect coordin social view coordin dai perspect malon organiz model partial global plan hierarch behavior space distribut ai concept agenc distribut ai distribut process decentr control theori team theori distribut os job schedul game theori dai model summari framework model task environ gener framework model summari object task structur summari subject map agent action coordin problem distribut sensor network object level model local subtask relationship local method qualiti effect effect exampl facilit expand model resourc subject level model agent action subject map decid control comput method execut commun inform gather subject model sugawara network diagnosi system gener level model framework exampl gener level simul gener exampl hospit patient schedul airport resourc manag internet inform gather pilot associ summari design analysi coordin task environ model simpl environ task environ simul expect number sensor subtask distribut binomi max order statist expect number task group expect number agent work involv task structur execut model simpl object model model summari static dynam organiz reorgan balanc system load analyz static organ control cost analyz dynam organ dynam coordin algorithm reorgan analyz dynam restructur algorithm task durat commun summari gener partial global plan partial global plan issu extend pgp mechan heterogen agent dynam agent xi agent gener partial global plan mechan uncertainti task interrelationship gener partial global conceptu overview agent architectur local schedul coordin mechan substrat mechan mechan updat viewpoint mechan commun result mechan handl simpl redund mechan handl hard coordin relationship mechan handl soft coordin relationship interfac coordin mechan local schedul schedul input schedul output interfac coordin mechan local discuss summari experi gener partial global plan initi effect facilit power likelihood calcul delai simpl model util detect facilit detect commun facilit facilit perform delai gpgp issu gener perform issu advantag coordin add mechan famili member environ return load balanc dynam reorgan comput organiz design burton obel experi explor famili perform space summari xii repres task environ analyz distribut sensor network environ design famili coordin mechan limit work futur work refer xiii list tabl averag percent qualiti commit delai valu paramet gener random episod overhead individu mechan paramet set perform central parallel schedul balanc gpgp coordin decentr schedul perform simpl gpgp coordin balanc gpgp coordin paramet gener random episod complet linear cluster output agent cluster perform paramet standard block complet linear cluster output agent continu perform paramet standard block xiv list figur secret agent captur decid exampl organ object task structur singl vehicl track object task structur visit post offic bui stamp mail packag assum agent local method task simpl model task method qualiti task group time previou figur object task structur agent effect object task structur method share limit resourc capac method execut tempor overlap time durat method lengthen object structur method consum method replenish finit state machin describ agent comput subset agent belief repres inform method execut learn network diagnosi correct schedul strategi object knowledg situat occur object task structur subject view typic hospit patient schedul episod top task ancillari object entiti unit task link diagram object task structur small airport resourc manag episod object task structur independ queri resolv point singl machin xv object task structur singl queri review macintosh product show relationship dynam situat pilot associ task accru qualiti min exampl organ grid comparison probabl distribut outcom act flip coin time binomi compar outcom agent flip coin number head agent flip head max order statist actual versu predict load sn valu actual versu predict maximum number task group agent actual versu predict averag number agent singl task group object task structur singl vehicl track track thick dark grei box outlin default static overlap detail previou figur process place track run actual system termin versu analyt expect analyt determin likelihood interv run arbitrarili order expect termin time left static dynam reorgan result agent attempt reduc area unit corridor run north south move closer unit reduc load agent column comparison termin static dynam system environ task durat set simul comparison termin static dynam system environ task durat set simul comparison termin static dynam system environ task durat set simul comparison termin static dynam system environ task durat set simul likelihood interv expect termin system coordin number likelihood interv expect termin system coordin number likelihood interv expect termin system coordin number likelihood interv expect termin system control vari amount likelihood interv expect termin system control vari amount likelihood interv expect termin system control vari amount effect commun cost expect termin static organ dynam restructur likelihood demonstr larg perform varianc number task group random small varianc dynam restructur coordin random expect agent bs subject view typic object task group overview gener partial global plan agent bs local view receiv viewpoint commun mechan previou figur show agent initi state continu previou figur agent commit mechan receiv initi mechan remov agent bs redund commit complet input specif schedul output schedul problem histogram size task cluster pr fac calcul delai effect power facilit relationship rel qualiti likelihood effect power facilit relationship rel qualiti likelihood effect power requir util rel qualiti effect system load absolut qualiti agent system effect system load absolut qualiti wai calcul delai plot probabl modular simpl coordin style final probabl task qualiti accumul min probabl partit style probabl mlc load balanc termin quickli static load fit model actual simul data randomli gener object task gener paramet previou tabl local view agent team share privat inform creat partial view standard perform coordin style effect overlap task environ standard method execut perform coordin style spline fit studi ancient time believ implicitli philosoph stone provid kei solv problem quest coordin respect twentieth centuri mediev search philosoph stone find formula reconcil harmon compet wholli diverg overcom govern make hard polici choic power coordin process manag interdepend activ dissert problem repres interdepend coordin problem detail agent entiti knowledg belief world perform action problem coordin occur situat ffl agent choic action choic affect perform ffl order action carri affect perform ffl time action carri affect perform problem realiti complex agent difficulti tempor order action ffl incomplet view structur task action part ffl task structur chang dynam ffl agent uncertain outcom action agent find situat call potenti action interrel agent exist isol agent environ set environ impli pattern characterist individu episod structur task episod iv appli singl agent final complic multipl incomplet possibl chang view current episod potenti action agent relat agent choic order action time occur call relationship coordin relationship distribut sensor network comput agent physic distribut sensor area agent overlap area nearbi agent vehicl move agent work track vehicl vehicl move region agent entir track perform metric system typic long track comput termin agent choic process data slow algorithm data insid overlap case agent process agent redund wast matter order agent task type process low level process higher level process vehicl track call hard predecessor relationship soft relationship domain agent faulti sensor collect noisi signal noisi signal long time process agent faulti sensor receiv inform type vehicl track agent faulti inform filter noisi data job quickli multipl vehicl order track process make differ agent face deadlin process time action carri make differ agent environ make choic tempor order action dissert demonstr framework task structur comput environ instanti exist methodolog analysi design framework analyz comput environ sensor predict verifi perform simpl coordin algorithm environ dissert design famili gener coordin mechan soft comput task environ demonstr perform famili mechan singl static algorithm repres task environ state dissert repres coordin problem abstract detail leav basic coordin choic tempor order action solut problem framework call stand task environ simul reason simul comput environ uniqu featur ffl quantit task interrelationship hard posit neg relationship repres relationship environ extend task work separ call coordin relationship coordin relationship crucial design analysi coordin mechan set relationship extens relationship enabl task enabl task complet begin relationship facilit task facilit task complet begin work produc complet work longer produc lower qualiti answer previou case complet task complet task ffl structur problem multipl level abstract highest level abstract call task task explicit comput interrelationship task simpli set subtask execut method compon task explicitli defin effect qualiti encompass task lowest level abstract call execut method execut method repres schedul blackboard knowledg sourc chunk code input plan recal instanti task method instanc human activ level patient left ffl make assumpt defin agent locu subject belief action acquir subject inform current problem solv import studi principl agent construct activ area separ notion agenc model task subscrib agent architectur assum adapt task environ question inher social natur task environ hand concept societi concept individu agent concept uniqu comput approach adapt shoham agent orient program terminolog specif agent intern architectur chapter ffl task structur viewpoint view gener model problem solv episod statist view task structur view object view instanti task structur present episod view subject view agent object realiti gener model describ gener episod gener model describ gener number vehicl involv gener object task structur vehicl result object model describ task start gener problem solv episod task relat gener gener model inform portion gener object task structur agent agent execut action agent receiv subject model portion object task structur action correspond agent request data sensor ffl concept subproblem import ai schedul approach discuss differ algorithm garvei defin concept minimum durat schedul achiev maximum qualiti ffl dissert comput task method thing blackboard knowledg sourc instanti describ extens repres physic resourc constraint object task structur intend schedul plan inform formal system simul gener random provid subject inform track perform simul written portabl clo common lisp object data collect valid framework build detail model complex environ distribut vehicl monitor testb model includ featur repres approxim faulti sensor low qualiti solut sensor configur vehicl track phenomena train ghost track simul simplifi model show characterist describ model hospit patient post offic airport resourc internet inform pilot associ valid framework parallel diagnosi error local area futur model softwar engin activ analyz distribut sensor network environ major result report detail analysi simplifi environ methodolog analysi instanti mad methodolog provid model simul compon part dissert return work corkil show singl coordin algorithm uniformli outperform dissert explain predict perform effect ffl number agent ffl physic organ agent rang sensor region ffl averag number vehicl episod ffl agent coordin algorithm ffl rel cost commun comput predict verifi simul chapter deriv verifi express time termin set agent arbitrari simpl environ static physic organ coordin algorithm total time termin agent receiv initi data set size time local combin result build complet commun inform gather sd eq predictor combin probabl valu verifi model simul compon analysi explain observ made extra overhead commun balanc perform work repres detail analysi statist analysi distribut ai system sen work distribut meet schedul agent import earlier work area ad base small number exampl design famili coordin mechan major result report design evalu famili coordin mechan cooper comput task environ call collect result algorithm gener partial global plan famili algorithm gpgp gener extend partial global plan algorithm approach uniqu ffl mechan defin featur current subject task environ mechan remov activ portion episod mechan initi set mechan examin ffl gpgp work conjunct exist agent architectur local schedul result report achiev soft local schedul develop garvei ffl unlik ti singl domain ffl gpgp agent heterogen pgp respect agent capabl ffl gpgp mechan gener exchang inform pgp inform gpgp mechan exchang level abstract pgp agent gener commun complet schedul fix level abstract gpgp mechan commun schedul commit conveni level abstract gpgp coordin mechan handl simpl method redund agent method accomplish agent schedul method commit execut notifi agent commit agent happen commit redund mechan care retract redund commit fact gpgp coordin mechan commit agent local schedul constraint reason gpgp famili algorithm requir cooper agent underli task structur requir agent simpli verifi gpgp famili show duplic subsum behavior pgp algorithm gener examin gener perform complex mechan complex mechan member gpgp famili comparison comparison central schedul refer implement upper perform measur total final qualiti achiev amount work number deadlin termin time central schedul refer system solut gener coordin cooper group ffl central schedul agent singl point failur entir system fail decentr gpgp ffl central schedul agent requir global view view mention earlier easi achiev account cost build global view refer implement upper bound dynam episod task structur requir ffl central refer schedul optim schedul start point problem schedul action fairli simpl task structur optim schedul perform grow exponenti number method schedul central refer schedul global view schedul action size central problem grow faster size schedul problem gpgp agent partial view size episod small central refer schedul find optim schedul reason amount run time perform set agent defin gpgp coordin mechan good comparison central refer agent produc averag qualiti central upper bound refer miss deadlin ad demonstr addit mechan improv system perform famili design demonstr rang perform exhibit member gpgp algorithm obtain simpl individu coordin mechan show environ requir famili member load demonstr sixth load balanc defin integr mechan show cost mechan balanc perform improv larg varianc amount work agent default result similar result distribut process commun decentr load balanc comput organ recreat set experi burton obel examin effect technic interdepend organiz structur perform gpgp coordin mechan defin organiz task structur defin problem burton obel linear reach burton obel argu futur applic tool comput organ design place work context comput design coordin mechan multipl comput face problem subtli scientist studi coordin organiz economist explain coordin mechan describ perceiv versu work tradit economist simpl fairli coordin proper mechan ideal agent organiz theorist explan past observ mechan predict futur behavior distinct comput scientist build sociolog descript coordin process organiz theorist attempt design coordin mechan comput dai distribut market coordin mechan complex game theoret mechan zlotkin gmytrasiewicz team theori older school thought invari quantit qualit method descript task environ agent studi descript environ explain economist make assumpt environ predict correct great deal work economist assumpt organiz theorist predict outcom coordin mechan show mechan ration environ descript domain gener characterist environ artifici grow goal model individu replic augment primarili individu choic action larg effort describ principl construct agent act ration predict base goal fairli research concern perform realiz simon critic suggest econom march hold realist situat individu ration bound comput boddi russel garvei distribut ai part chapter charact principl construct individu agent hasnt concern question bound ration problem solv principl construct individu agent worst fail bring environ center stage build analyz distribut problem solv system organiz scienc commun regard task environ central variabl explain complex branch research grown commun rare formal natur present rich descript term chapter framework repres coordin problem unlik exist focuss coordin issu problem richer express game theori team theori typic game team theori problem statement concern singl typic object problem solv episod repres outcom sequenc choic repres game theoret boil singl made agent face task structur game theoret problem uncertainti chapter rich inform concept organiz scienc section differ tradit distribut comput task task episod put part dissert analysi simpl distribut sensor network present formal quantit analysi dai sen analysi distribut meet schedul system analysi system answer explain phenomena observ work distribut vehicl monitor testb algorithm perform differ situat work move anecdot data design rule system major contribut extend work partial global plan domain ad time agent requir commun multipl level detail gpgp cooper algorithm assum agent act ration agent make priori knowledg agent util competit game theori approach agent gpgp mechan make ration schedul attempt maxim util subject inform scope state coordin act manag interdepend activ coordin behavior divid roughli specif behavior share plan behavior potenti set task strategi accomplish schedul behavior task group creat share plan alloc work primarili concern schedul behavior coordin behavior turn rest basic agent behavior creat commun negoti conflict resolut mechan agent comput mixtur type specif household busi nation govern appli specif behavior mechan arriv consensu share goal robot run busi decid product govern decid initi pursu specif place robot social fabric robot robot design make arbitrari robot pass human owner japan constantli find danc common american tourist walk street countri point specif pass behavior household robot place robot control plan share multipl plan achiev goal plan involv multipl agent laid explicitli robot behavior pure busi unit carefulli construct compar potenti govern embark potenti conflict plan simultan schedul plan lack thereof lead schedul robot move integr obstacl avoid behavior plan achiev busi unit task assign resourc explicit schedul organ govern chang standard oper procedur alter criteria incorpor polici class close relat agent plan meet multipl schedul action multipl plan schedul action includ deriv goal local agent thesi focu schedul behavior discuss goal plan occur subject studi exist potenti incompat potenti incompat plan applic work develop applic mind section briefli describ coordin problem domain offic concurr engin independ agent control access intellig assist offic worker real activ place central control detail global view rare social intellig offic assist coordin algorithm appli provid guidanc offic worker comput priorit task import thing discov relationship worker goal goal coordin algorithm suppli solut problem negoti outcom resolv dispar avoid neg interact agent goal plan action conflict action action recogn posit interact potenti agent send predict coordin process trigger process negoti similar argument appli concurr engin product myriad schedul domain distribut meet schedul involv comput agent imagin heterogen local area network set distribut network diagnosi agent assign detect network commun problem imagin situat commun link subnet agent diagnosi method link problem due agent execut copi diagnosi method link agent problem sugawara discuss solut problem agent learn coordin rule discuss problem lead gener sugawara solut applic agil manufactur schedul todai manufactur system move product schedul quickli product suppli distribut factori schedul system oper compani contractor supplier compani singl distribut schedul schedul task conflict dai equip faulti reschedul happen process develop resist error workload shift failur custom deliveri accur date ad potenti order exist schedul give telephon switch network sophist distribut statist control applic basic problem rout call side comput support cooper work research concentr act intellig assist discov goal human countri switch neighbor switch rout call overload switch current solut problem statist techniqu call balanc load local statist correct solut overload switch servic nation talk rerout call talk show deni implic statist rout supplement process account symbol inform call type inform distribut deliveri task applic request deliveri arbitrari locat region truck center deliveri number worthwhil lower exchang job center center end distribut search coordin process truck compani situat central schedul coordin behavior distribut sensor network applic distribut vehicl monitor testb discuss great detail thesi state problem agent physic distribut sensor task track vehicl move combin area coordin opportun includ avoid redund work area sensor balanc process provid result sensor faulti data open interpret distribut inform gather applic origin user queri transform set plan gather plan element deal coordin activ construct final queri agent assign concurr pursu sourc answer aspect queri make altern type sourc text gener answer agent proce work asynchron coordin agent result work agent suggest exist agent gather addit inform sourc altern result suggest addit agent agent deal uncertainti avail sourc workload requir task agent comput organ design tool comput model coordin work includ virtual design team simul civil engin project design organ stress busi process handbook project model softwar engin process action system electron manufactur organ work describ dissert model comput agent environ design coordin mechan chapter summari coordin problem consist occurr episod structur task episod activ relat choic tempor order activ affect perform criteria agent incomplet task structur chang problem agent uncertain outcom action basic problem dissert address state coordin problem approach develop directli repres salient featur comput task environ uniqu featur includ quantit repres complex task divid task environ model subject level extend standard methodolog framework appli publish predict agent perform distribut sensor network problem predict effect ad chang rel cost commun chang agent organ show coordin mechan design respond featur task environ structur develop gener partial global plan famili algorithm gpgp cooper coordin compon uniqu built modular mechan work conjunct fulli function agent local schedul gpgp differ previou approach ti singl agent exchang global commun multipl level separ local schedul compon prove gpgp adapt learn perform simul conjunct heurist local schedul randomli gener abstract task environ chapter present discuss model framework detail chapter present analysi verif model simpl distribut sensor network chapter present verifi gpgp famili cooper coordin algorithm chapter discuss work relat dissert chapter summar work point research pathwai relat research organ organ equal effect jai intent show overli special organiz structur effect network perform organ situat expect dimens resolv conflict situat expect dimens applic level vari result subsect discuss briefli reason task environ model approach section discuss question coordin task environ affect coordin section concentr organiz theori comput scientist ill return distribut ai conceptu view gener background distribut ai publish author introduct distribut ai testb publish author task environ reason built framework task environ model root desir produc gener theori ai framework featur languag state causal form theori form task environ model framework drawn sourc foremost work similar domain environ simul lesser cohen decker carver decker decker work basic model execut interrel form creat simul tileworld hard state good featur simul input form model mathemat formal work dai rosenschein cohen gmytrasiewicz reason complex occur earlier simul work clear semant exist complex optim carri malon formal classic organiz econom coordin devic product function central decentr analyz queu theori analysi orient task assign time assign execut commun vulner structur failur task assum independ exponenti arriv task complet work cohen levesqu make assumpt model individu agent situat possess complet correct belief world changeabl goal subject interrupt extern cohen levesqu concentr give formal definit semant term explor idea appli comput system reason rosenschein gmytrasiewicz tractabl process work prison dilemma game theoret environ game theoret model environ assum great deal static knowledg structur environ work provid bound comparison complex situat desir characterist task environ model framework provid clear semant forc person model simplifi thing optim solut found hope build richer realist simplif real problem make simplif analyt solut deriv prison dilemma section analysi chapter simul techniqu dont make simplif chapter input form task environ model desir avoid approach ai dai view call sort individu agent faulti back reason task environ model length avoid mental structur agent interact environ featur model adapt semant shoham environ model build conjunct agent architectur explor agent behav environ fairli agent architectur demonstr gpgp chapter back quot cohen model framework provid dynam world incorrect incomplet changeabl interrupt model fabric action agent activ flexibl construct reconstruct ad subtract resourc chang boundari collect problem solv knowledg definit potenti open system social perspect usual dai research final problem remain form model address mutual construct agent environ organ world wholli dictat peopl individu environ task environ discuss concept chapter refer task environ simul develop phoenix distribut vehicl monitor testb simul network vehicl monitor node node problem solver analyz acoust data track pattern vehicl move space node sensor sensor simul domain vehicl gener sound locat discret grammar term signal term detect signal frequenc analyz abstract simplif problem chapter phoenix phoenix testb domain simul primarili dai multipl agent oper highli dynam environ fairli complex fire simul base weather nation park physic data burn rate land work coordin multipl negoti consid resourc coordin social view begin environ affect earli gener difficulti face effect environ learn question meet criteria problem state vagu investig pinpoint investig concept environ learn abil vagu learn psycholog textbook problem conceptu vagu consid reason extens mathemat model environ discuss previou cautiou set basic agent behavior inform reason causal model product local schedul constraint measur output base behavior section discuss research view coordin discuss research environ effect coordin behavior cover view research dai impoverish view equat coordin behavior commun profit idea return dai perspect chapter recurr problem sociolog conceiv corpor studi wai anthropomorph reduc behavior individu human aggreg gui task sociolog school thought sociolog manag scienc view coordin ration system natur institut open system econom system school research separ norm predict assum observ behavior section briefli summar point view school coordin behavior coordin ration system ration system view import featur organ specif goal norm structur organiz activ interact coordin achiev goal explicit includ criteria activ agent interact explicitli rule norm describ role interact separ person attribut agent occupi role fundament ration system norm structur term technic norm structur promot type coordin rule creation adher rule regul coordin behavior observ rule regul appli individu agent subgroup ffl justifi action ffl control interact environ creation standard special case regul put place reduc organ interact environ hierarchi skill resourc commun inform hierarchi outlin nomin power structur make construct access hierarchi coordin behavior individu group tightli coupl commun requir function coordin behavior exist natur tension hierarchi task special hierarchi group routin relat situat hindranc coordin wide separ group modern ration open system creat special task group set routin hierarchi transfer make power closer point situat result perman chang organ creation special task group coordin behavior properli classifi open system coordin natur system institut natur human institut view common fact reaction ration system view point organ made ration system view suffici account studi coordin distribut problem solv organiz actor provid easi insight ration ration system view cover view light shed mix coordin behavior amount fact facilit effect problem solv person node skeptic idea advoc indirect organiz agent decid accept organiz role node guid organiz structur decid interest import freedom import organiz structur uncertain incomplet inform incorrect fraction node result robust organ face chang observ made refer coloni bee common tenet view concept organiz structur explain examin function impli explan organiz behavior primarili formal structur announc goal output good servic li larg myriad process inform conflict recruit depend group strive commun local commun power legal institut institut organ theori explain action organ attempt manag extern imag secur support extern sourc organ prefer pattern structur oper copi institut attempt maxim effici measur meyer argu congress enact affirm action organ creat equal symbol genuin intend primari coordin behavior observ natur system institut research construct inform channel commun channel exist formal creat formal mechan commun channel exist organ part organ environ coordin open system origin concept ration natur system view tend view organ isol static set particip goal surviv organ open system point view stress environ organ oper particip organ organ obtain resourc physic scott summar open system definit coalit shift interest group develop goal structur outcom strongli influenc open system view coordin behavior ffl negoti adopt share goal group individu complex coordin underli mention ffl construct execut action negoti coordin strategi includ contract coordin larg system strong mutual coordin relationship overlap area coordin activ simpli involv repres organ process agent transmit plan simpli make choic bs palett choic inform factor view style strategi exist larg network agent agent trade merg perman temporari organ ffl commit behavior defin commit relat initi unrel negoti potenti negoti outcom situat hand commit flow constraint flow resourc schedul time budget monetari commit ffl power share independ organ share seat board coordin behavior deleg author categori coordin behavior ffl complex problem solv give complet control singl agent agent make execut task ffl slack creation slack resourc inform physic coordin behavior work reduc tight coordin ffl code preprocess organiz input reduc uncertainti complex turn elimin simplifi coordin behavior ffl forecast predict typic coordin behavior environ ffl growth forward backward vertic integr control part environ elimin reduc type growth view coordin behavior coordin econom system newest school organiz theorist influenc economist drive forc coordin behavior agent maxim individu util game theoret approach dai rosenschein gmytrasiewicz theori strong argument argument base natur system view convinc appli collect engin system dai work area focuss make ration outcom affect multipl agent problem distribut schedul problem address gpgp econom theori postul explan exist behavior explain hierarch organiz behavior agent maxim individu util transact cost encompass approach explain hierarch organiz structur bound featur environ explain relationship section section briefli discuss perspect coordin behavior origin ai commun section reader idea coordin mechan perspect mechan section briefli summar perspect relationship task environ coordin mechan exhaust list environ affect coordin social view social concept environ organ exist complex set relationship environ environ constrain type particip make organ includ organ particip belong environ sourc input sourc technolog process sink organiz output thing goal organiz point view special function organ environ point view complex environ reflect complex organ structur organ environ influenc decid level analysi world individu agent virtual singl locu network applic network analysi process model control influenc relationship organ boundari singl hospit clear boundari network organ make environ larg fuzzi local labor support construct model singl organ refer network part error interact unit level sourc market regul environ place resourc physic inform organ depend physic uncertainti lack inform sociolog studi shown causal effect variabl organiz depend uncertainti scott mention ad exampl phoenix ffl dimens affect depend easi resourc call capac phoenix limit number fight potenti unlimit amount built time consid resourc fix sensor limit resourc resourc spread environ sensor evenli distribut vehicl move cost time lost fire entiti environ execut orchestr structur vehicl mean work skill technolog sociolog comput scientist term resourc part singl act coordin multipl fire fire dont decid joint plan burn independ ffl dimens affect uncertainti similar entiti environ organ vehicl notic differ easili imagin addit type terrain lead qualiti fire entiti environ stabl environ phoenix environ variabl consid chang wind weather studi vulner environ error organ result phoenix organ secur entiti studi link entiti environ entiti affect phoenix agent partial isol fire directli affect destroi agent multipl phoenix strong dimens effect uncertainti environ depend resourc control scott note independ variabl orthogon entiti environ highli uncertainti depend reduc number independ resourc point mind analyz clear analysi environ link cognit work particip structur inform characterist goal organ function environ link agent architectur desir agent behavior scott point differ characterist reason partial global plan coordin algorithm work goal reinforc remot goal compat local combin goal rate good thing domain extent believ goal reinforc true world similar encourag environ entiti perceiv characterist percept predict entiti action output problem characterist affect result interact output environ agent dont hurt scott demonstr market percept held record industri execut predict record record sell illustr outcom output case ghost track ghost track weakli vehicl track sonic reflect real occur nearbi ghost track coordin track vehicl ghost fact true earli environ knowledg ghost perceiv coordin ghost track vehicl blind characterist environ environ affect coordin theori theme dissert develop method design coordin algorithm system special coordin algorithm provabl good behavior restrict condit zlotkin algorithm claim greater gener larg number paramet cooper paramet task reorder organ paramet predict believ perform class situat situat date coordin algorithm gener interest design coordin algorithm intellig make design coordin algorithm human human organiz design face myriad design good situat notic organiz design flourish industri technolog solv method industri extern chang place quickli slowli clear singl good organiz remain shown structur matter good lawrenc built model studi relat uncertainti environ differenti integr organiz structur model elabor call theori lawrenc defin independ depend variabl definit appli definit clear level mind organ made part organ part organ organ servic core note level analysi necessarili human org chart lot reason doubt interest formal org chart start place organ agent control compon domain compon knowledg sourc phoenix group group group helicopt group individu set studi set numer measur definit orient busi world build model system variabl tremend difficulti determin chang profit made partial global plan easili test found confid execut fewer give origin definit order encourag concept transfer data develop theori exampl give plastic environ organ plastic environ appli product part part interact plastic industri uncertainti measur clariti uncertainti input measur environ research part organ plastic industri higher uncertainti input part organ plastic industri agent faulti sensor high uncertainti input measur uncertainti causal relationship plastic perform characterist requir custom research perfect question duck attack great deal uncertainti causal deduct relationship agent time span definit feedback make plastic year research program pai pan error plastic product notic week research product part organ plastic industri measur amount time made ks correct theorem suffici note feedback time significantli agent organiz part consid differenti differ formal rigid structur product part plastic organ formal rigid deep hierarchi manag frequent review perform rare line author breach plastic organ research lab hand lab manag support staff report research lab encourag monetari collabor staff member agent intern structur orient solv problem plastic product sale concern problem schedul research plan project year agent orient attent goal equal interest qualiti solut simpli measur smallest studi part part organ perform accord organ state goal part behav consist goal research orient product sale goal assum state research goal attend system goal fourth interperson sign troubl concept measur unit organiz part requir partit organ amount achiev uniti requir part environ oper measur binari linkag critic routin environ plastic critic link product research innov sale research custom innov idea find wai creat custom link sale sale appli routin manufactur part critic link critic linkag industri occur product sale product research control classic environ place critic linkag agent sensor area spatial reinforc discoveri track part pattern effect effect measur technic busi rank chang sale product introduc past year incarn rank qualiti number ksi cpu time memori usag model express effect differenti part organ vari uncertainti environ part environ measur part organ environ effect organ poorli perform organ tend forc part organ remain face differenti environ requir analyz agent classic environ case model predict agent explain point individu agent equal amount uncertainti present uncertainti uncertainti causal time span feedback agent effect organ achiev integr critic linkag effect organ busi qualiti integr measur survei manag unit sound full uniti effort achiev averag sound problem achiev joint effort couldnt bad relat problem exist measur qualiti integr top measur percentag joint solut discov pair spatial adjac critic agent model predict discov greater percentag joint solut spatial adjac agent spatial agent ill break relationship integr differenti part organ highli differenti highli interdepend organ develop complic mechan achiev integr organ relationship discov comparison organiz part measur amount differenti definit measur qualiti integr achiev theorem organ differenti part lower qualiti integr part relationship discov organ oper environ measur perform higher qualiti integr organ achiev high qualiti integr highli differenti rest studi explor mechan organ achiev high qualiti integr highli differenti organiz part part predict agent amount resourc devot integr part doesnt make predict weak meant illustr import point lawrenc work show singl good choic structur matter illumin model examin uncertainti environ kei independ variabl lawrenc correl ad causal greater amount uncertainti greater amount inform process maker execut task understood prior perform activ actual execut task knowledg acquir lead resourc prioriti requir inform process task perform correl observ lawrenc explain strategi abil organ flexibl adapt face level perform requir solv problem environ affect coordin inform process newer work return structur uncertainti face econom organ basi theori arguabl transact cost organ grow structur sourc inform import actual mechan result structur result ration unintend select trial error learn inform organ grow forecast predict inform inform outcom certainti futur import inform uncertain futur progress distinct social locat resolv uncertainti earliest inform show direct futur world turn popular organiz model talk detail model environ affect coordin theori transact cost econom hierarch organ dai arent contract protocol dai coordin problem theori transact cost econom answer question deni benevol agent assumpt genesereth zlotkin dai illustr exampl drawn hypothet style system illustr drawn author refer dai imagin contract net agent put task bid benevol agent assumpt system agent accept bid specif amount agent accept imagin agent capabl accept equal capabl agent examin bid specif capabl accomplish contract agent capabl spend level agent capabl find reward offer insuffici task agent find reward gener eagerli accept contract situat refer term select agent task bid worst agent thing happen time real hire experi im worth sell insur low rate found string equip nuclear plant owner mr burn problem select mitig design job common dont averag packag skill point select employ run wai individu doesnt job entail capabl aw work condit time grad student suspici cover similar problem occur contract start task contract result judg multipl criteria complet term water number process contract agent resourc constantli monitor progress progress report agent judg set simpler hard origin contractor agent orient work secondari criteria origin goal sleep rest dai contract bare term situat moral hazard real orient evalu manag homer fire real reason practic fire safeti plant wont burn uncertainti inform asymmetri agent involv charl complex organ theori theori moral hazard basi exist hierarch organ assum agent work track gain global util result divid benevol agent trust truth individu effort complex interdepend process distanc sensor input final hard imposs object determin individu agent contribut agent split thing agent bear cost part agent save accru reduc reward split agent ration agent depend exact cost work agent benefit accru situat view similarli prison pinpoint theoret solut agent hire princip spend comput resourc monitor determin individu effort safeguard princip alloc reward agent abil fire hire agent rid monitor give princip excess reward left agent share princip agent theorist assert result arrang type set spot contract enter ration parti involv type analysi appli employ manag politician citizen politician discuss idea critic rang simpl exact optim form specif environ agent part princip posit rotat attack model suffer wildli unrealist assumpt agent leav princip princip fire hire agent assum princip bring system stabl point princip agent author unequ possess power effect rao argu concentr moral random primari contributor uncertainti perform theori overlook critic sourc uncertainti ffl incomplet knowledg relationship effort outcom ffl lack agreement measur theori prefer measur quantiti qualiti type effort rao argu theori ignor facilit agent directli effect outcom market oliv market hierarchi transact cost econom williamson transact cost approach combin theori tradit organiz concern bound ration uncertainti question answer hierarch organ williamson answer show condit contractu transact identifi hierarch organ effici market transact ration organiz boundari linkag distinct featur task environ agent approach gain support simpl explan vertic integr firm small firm oper market linkag agent bound ration point time coordin simpler presenc complet ration make cooper commun phoenix structur environ unlimit servic market fire easili price make tradeoff comput problem isnt phoenix planner make finit number featur complex fire uncertainti speed bound ration induc planner finit comput resourc phoenix system vertic acquir control dynam certainti environ complex linkag small number agent market opportun intent part agent imagin phoenix imagin central planner inform spread fire inform asymmetri lie size inflat bigger share tend work larg number tend damp opportun small number wont matter act opportunist make twin featur small number note fit view inform futur realiti behavior market ineffici respect hierarch organ williamson point market origin small number advantag compani depart ti supplier parti inform asymmetri incomplet market contract problem occur hard judg unambigu complet outcom task question williamson point market hierarchi market contract written effect organiz blur distinct critiqu point origin treatment transact remov uncertainti make easier respond opportun occur hierarchi power monitor environ affect coordin social structur analysi social structur analysi approach understand behavior organ organiz structur compon social structur social structur pattern organ import social gender social structur involv physic environ pattern commun social structur theorist shown action influenc social structur attribut individu agent involv individu prefer marri ethnic group larg number mix ethnic show correspondingli larger number mix marriag exampl includ effect percentag women law school class percentag women particip class effect size amount environ affect coordin social view section view environ affect agent coordin behavior import thing recognit organiz commun import characterist task structur type repres return dissert time theori view reason featur repres model framework section describ state dai field respect coordin behavior chapter includ organ larger field earli dai ration system view rule fragment polar agenc formal power author longer pfeffer claim organiz studi coordin dai perspect introduct read distribut artifici intellig bond gasser familiar sociolog organiz devot section discuss coher coordin notabl breadth coher refer evalu system includ thing solut grace degrad properti interact set agent perform collect bond gasser set coordin behavior exhibit distribut ai categori behavior includ form hierarch decisionmak author market malon work contract net structur commun scientif commun metaphor behavior orient interact includ special agent reduc depend agent special refer ration system growth refer open system local activ involv make local consid coordin behavior drive note lesser work local capabl agent plan potenti lead coher synergi occur agent coordin effect local plan mechan classic consid exhibit coordin behavior construct local node plan plan coordin behavior coordin element extern bond gasser break finer multiag agent plan georgeff work distribut plan construct mutual agent pgp distribut ephrati work ephrati plan refer open section work advantag posit plan interact von martial work exploit favor relationship contextu coordin behavior exchang inform agent role influenti behavior creat model agent predict action relat commun abstract manag coordin behavior observ agent carefulli manag commun behavior manag term complet expect driven commun discriminatori diagnost content carver manag resourc agent manag resourc consum limit includ engag coordin behavior manag resourc includ creat relax commit strategi slack refer open section resourc depend refer social concept section manag kind uncertainti behavior reaction aspect uncertainti environ impact agent organiz coordin behavior section section fox discuss type uncertainti algorithm behavior affect organiz theori transact cost approxim process view coordin behavior creat slack resourc decker organiz behavior multipl agent group attack problem viewpoint exhibit form coordin behavior paradigm cite bond gasser negoti multipl conflict viewpoint arriv share viewpoint temporari solut due process coordin behavior abstract idea form commun exchang state coordin import coordin behavior idea embodi pgp line exchang inform schedul remot node avoid redund work work abstract reduc commun detect activ interact system coordin behavior contract relat repres style agent creat temporari organiz structur contract incom task style gasser ishida agent creat knowledg move chang task load descript work work start rest section describ relev piec dai work detail malon organiz model commun node coordin behavior measur malon malon measur amount commun individu order assign task fix constant organ studi hierarchi central market function proport number agent decentr market malon compar organiz structur consid factor fix malon assess impact environ assess impact organiz structur call coordin algorithm coordin vulner cost system malon model exhibit coordin behavior part negoti behavior model partial global plan partial global plan develop distribut control techniqu insur coher network problem solv behavior flexibl approach coordin assum distribut node coordin current situat node repres reason action interact group node affect local activ call partial global plan part network plan achiev global goal node maintain set pgp independ asynchron coordin activ behavior system constru coordin behavior malon ffl avoid redund work node notic interact local plan notic node plan ident intermedi work time region occur interest reliabl node overlap sensor goal assign task group commun ffl schedul gener partial result transmit node assist correct time estim time activ infer relat node estim time node complet intermedi goal spatial node provid predict inform node task commun resourc ffl alloc excess task overload node idl node node plan provid inform determin node underutil node underutil idl particip pgp node estim complet time subgoal goal complet time subgoal task group resourc ffl assum goal correct compat goal node goal repres process task ascertain vehicl move region time goal wrong base erron sensor data basi preliminari task analysi gener goal node local plan work base highli rate pgp receiv intermedi goal node part work intermedi goal local plan node node rate local plan higher local task group conflict resolut thesi partial global plan mechan claim exhibit coordin ffl form parallel ffl form solut construct graph show partial result deliv ffl exchang predict inform ffl assign import task multipl agent ffl exchang task agent ffl avoid redund activ ffl verifi agent result ffl gener independ work ffl select exchang messag discuss section work gener partial global plan describ chapter extend pgp idea agent exchang partial global inform multipl level separ schedul return partial global plan detail introduc gpgp section hierarch behavior space earli assert coordin behavior divid gener specif share instanti goal task subdivid schedul recent montgomeri work specif side develop set agent behavior arbitrari nonetheless hierarch standard mechan goal subdivid potenti heterogen agent montgomeri present inform schedul mechan gener commun avoid bad interact advantag posit work prescrib good behavior environ quot section recent work shown abstract fact result commun chapter gpgp discuss mechan construct extend famili coordin algorithm mechan minim argu time mechan implement hierarch reduc commun distribut ai concept agenc concept agenc dai scope direct theori section primari theoret focu call long histori mathemat logic knowledg belief extend back ai modern comput scienc link greek studi epistemolog studi larg amount work comput cohen levesqu comment start chapter explor idea intent joint appli comput system bdi architectur state agent action base current set belief current set desir intent link desir goal plan achiev action good comput express idea shoham express genesereth rosenschein cohen zlotkin gmytrasiewicz clear construct agent architectur subject refer point talk agent interact environ document compar agent architectur gpgp algorithm chapter shoham simpl interpret base gener idea program aop special idea program actor object agent formal defin mental state capabl send messag type inspir speech act theori commit type desir goal speech act request pass explicitli exclud complex intent goal desir agent program consist initi set unord commit rule commit rule refer mental state agent current incom messag result commit rule commit action futur point time underli interpret make agent honor previou commit interpret process incom messag local belief updat commit run commit carri commit made current time inform agent mark belief agent achiev common belief perfect commun inconsist belief remov simpl singl fact happen fairli institut belief program note import precondit part capabl commit retract belief fact commit longer carri agent longer retract commun agent distribut ai distribut process problem techniqu distribut ai pure comput system relat distribut comput commun chamber differ importantli scope distribut process research problem data consist transact process focu dai research dai research avoid creation consist global view build dai system handl bank build dai applic search instanc fraud top system distribut process approach control schedul issu central reason effici solut system bottleneck problem mitig special hardwar distribut schedul approach assum task newer schedul work admit schedul task group relationship spring stankov research dai distribut comput system malon scope distribut process work provid structur effici implement dai system section briefli discuss interfac schedul make applic hard garvei decentr control theori classic modern control theori orient control continu physic process singl control observ output environ set input current environ state determin output control theori mathemat basi engin larg bodi work exist introduct comput scientist dean wellman control theori ai control continu system robot type environ model dissert gener continu work discret control theori dissert interest control term activ surfac vari continu plant input variabl direct robot travel temperatur cure process extrem gener natur control theori express type standard control theoret solut techniqu discret task environ complex interrelationship model dissert satisfi superposit homogen properti requir system linear differ model discuss dissert highli structur dynam control theoret model scope easier develop autom tool build model arbitrari dynam model comput program physic extens control theori includ stochast uncertainti environ input uncertainti control observ output usual control theoret approach observ uncertainti kalman filter approach approach map observ set linear dynam model choic model assum evenli distribut gaussian model match uncertainti system assum error measur durat execut method time extens includ decentr control theori multipl control situat closer system focuss continu linear system final import point make applic control theori comput algorithm develop ai commun system commun continu control theoret techniqu adapt team theori team theori formal simpl distribut control problem state problem find rule set agent agent set agent set potenti uncertain observ rule minim expect predetermin loss criteria base agent true state natur team theori formal compon state vector random variabl distribut repres uncertainti bear problem set observ vector base function true set variabl maker rule agent agent variabl agent observ vector loss payoff function base valu agent variabl true state natur fairli static problem rule agent minim expect gener intract comparison state natur vector similar object level problem solv enforc structur task object time agent make static team theori current state natur extern team theori similar subject level addit structur note stankov set observ made fact function true action agent rule set control action execut control strategi gpgp garvei dynam distribut os job schedul realm distribut comput lot research distribut close relat type problem discuss dissert work priori decomposit task alloc techniqu assign task processor applic uncertainti structur central author make case mix system collect work tightli coupl distribut system share memori scope success earli version work dissert schedul blackboard system knowledg sourc instanti true parallel share memori processor decker work distribut comput schedul job coupl distribut system priori fix decomposit job arriv inform job central problem difficult requir heurist solut optim criteria feasibl previou work similar distribut schedul approach gpgp local schedul present chapter decentr job schedul approach make assumpt gpgp oper lower level detail stankov describ adapt decentr job schedul algorithm equat task group algorithm differ gpgp famili algorithm wai algorithm constrain oper priori knowledg job knowledg durat resourc job separ process schedul handl job process discuss static task decomposit chapter job schedul longer involv job view schedul independ algorithm simpl import oper system level similarli job arriv rate node commun observ busi date commun node amount time stankov discuss decentr job schedul bayesian theoret approach work al heurist schedul similar cheng approach deal group task execut method interrel cheng case relationship task group share deadlin task singl group divid cluster turn execut processor knowledg task group task group arriv node system differ work approach includ task group task execut node bid decid transfer task group subclust game theori game theori model decisionmak situat face interact agent show exist ration strategi make model distribut ai show system agent cooper design agent rosenschein genesereth rosenschein earli work repres situat payoff matrix show util gain agent choic action simpl strong result care definit term respect comput agent fairli restrict condit payoff matrix repres singl aspect choic util priori agent involv repres simpl situat figur show tradit prison dilemma problem agent suspect crime held separ cell author agent author charg minor crime author charg cooper set free charg repres agent individu util task qualiti initi qualiti chang due interact choic shown figur restrict condit agent creat payoff matrix task structur dissert style repres game theori easili ad gpgp set coordin mechan focu environ consist schedul sequenc action uncertainti local effect action defect defect cooper cooper method execut agent method execut agent max task qualiti function max subtask relationship figur secret agent captur decid work relax constraint axelrod talk effect continu sequenc game solut prison dilemma problem evolut larkei discuss addit subject probabl rosenschein earli highli influenti work led recent result distribut ai rosenschein experi probabilist agent gmytrasiewicz extend model model belief agent payoff matrix matrix believ matrix believ believ basic form model repres singl easili repres class problem rosenschein student begun work complex gener domain rosenschein zlotkin coin term increasingli complex task orient worth orient domain task orient domain bundl job set homogen agent postal zlotkin state orient domain specif goal agent action block world worth orient domain util function world work plan repres environ simpler type dai model absolut distribut ai system gener produc methodolog sole except sandip sen work distribut meet schedul work time work sen analyz perform ratio schedul effici commun total time meet schedul heurist heurist includ announc bid meet confirm strategi sen probabilist view case current schedul agent fix time comput formula success ratio total time sen verifi simul agent unlik sen run agent exhaust start condit summari form framework describ dissert detail structur model organiz thompson notion reciproc process burton obel linear program malon queu model influenc import depend open system view organ start chapter build task environ model thing design coordin algorithm task environ hand told form task environ model inspir social concept task environ dai research bulk chapter discuss social discuss coordin behavior conceiv school discuss environ impact coordin point view chapter conclud discuss dai view coordin behavior system chapter introduc describ detail model framework repres reason task environ chapter show mathemat analysi simplifi distribut sensor simul implement gener partial global plan framework model task environ creat world intim real actual countri map karl import call world object world thing world subject world world object content thought de call world world mind sampl unknown sourc chapter discuss model intens task environ call environ decker exist formal captur rang interrelationship occur intens ai task environ simplest model task environ specifi action agent action relat perform system framework studi coordin relat behavior studi plan schedul comput realist parallel task environ garvei reason creat framework root desir produc gener theori ai difficulti face condit local schedul produc accept overhead coordin algorithm accept frequenc subtask interrelationship framework featur languag state causal form theori clear specif comput task environ strong analyt includ ablat paramet optim exist languag state gener theori system simul simul written common lisp platform simul support graphic displai gener task agent statist data collect ti explor dec lisp interfac clip lisp instrument packag chapter describ detail give introduc core model framework introduc sensor environ exampl chapter analyz chapter section describ languag build object model task structur instanc environ section describ model subject view agent object task structur instanc previou chapter section briefli describ wai model process statist gener object subject task structur environ section give exampl model hospit patient schedul gener framework principl model predict perform system compon establish perform provid kind perform tempor interv task qualiti execut result qualiti term instanti environ set perform criteria exampl qualiti measur includ complet task result assum qualiti singl numer term absolut algebra extend vector term intens ai qualiti produc execut time perform time task task arbitrarili affect execut task problem altern task execut method time qualiti agent unlimit access agent believ point view agent locu belief action agent exist task agent state comput agent store inform task structur agent execut method part task structur believ call execut agent gain knowledg task structur problem solv episod task structur execut method agent execut amount time agent accru amount qualiti action effect action agent environ model task characterist subject gener level describ statist characterist requir gener object subject episod workload gener gener level model consist descript gener process distribut rang altern problem instanc studi rest refer inform agent agent inform believ common epistemolog distinct knowledg belief modal logic knowledg belief dont lose gener perform rang problem avoid exampl object level describ task structur episod situat time roughli formal descript singl situat present inform agent subject level describ agent local view object situat time agent cost find uncertainti agent point subject level essenti evalu control agent make subject inform current episod rest describ object link definit gener object task determin agent subject view object task object level core model summari section lai mathemat detail model exampl reader prefer introduc skip ahead section inform summar section repeat chapter descript start environ end agent perceiv defin coordin problem final subsect model discret state agent system time comput state previou time environ gener function arbitrari set paramet set produc episod gener model specif includ random environ chapter continu environ produc episod frequenc discret environ produc episod invoc object task structur summari describ object task structur episod episod consist set task group ht task group arriv time deadlin task group repres set relat action task group repres direct acycl graph node graph call task task denot root simpli symbol entir task task children call execut method short task root straightforwardli call subtask structur task group meant reflect problem task structur edg graph form subtask relationship task task group qualiti time base subtask relationship qualiti function construct organiz theoret subject percept predict agent action object characterist affect perform environ busi umass campu episod consist task handl trip task group handl relat garvei trip seattl subtask relationship defin set direct subtask qualiti function return qualiti time semant environ model choic qualiti function arithmet write qualiti achiev task group time mean current qualiti root task execut method repres domain execut blackboard knowledg run instanti execut piec code data execut method function defin current maximum qualiti achiev execut time durat current durat method time number time unit spent execut definit fix qualiti time function model constrain obei qualiti maximum qualiti execut method complet task method start execut execut method finish potenti affect execut effect write relat label arc task structur ps paramet specif class effect outcom applic effect durat effect chang qualiti effect chang effect class function method time durat qualiti paramet paramet comput method initi maximum qualiti durat defin effect consequ effect appli order model defin sixteen effect chapter subject map agent action defin subject map map element current episod agent subject view element map empti element core subject level model chapter discuss simpl default definit agent perform type execut commun perform gather execut method action execut obviou extens make return set action amount time model execut method time defin earlier main effect execut product amount qualiti node task structur chang qualiti task group root execut method defin earlier method method task structur chang current durat maximum qualiti method execut action part environ model commun action inform gather action part environ agent commun result task defin special qualiti avail return maximum qualiti local qualiti commun agent commun fix amount time agent model denot agent set belief time agent belief extern inform agent belief inform gather action default inform gather action place commun arriv belief place subject version element current episod belief coordin problem defin perform measur system function episod default sum task group qualiti defin control function control agent agent current belief time return action agent time statement cooper coordin control problem spirit specif team theori find set control agent attempt maxim expect perform measur entir system agent similar problem studi dai coordin agent control function attempt maxim perform realiz agent framework involv build gener model environ produc episod turn object task structur subject model describ map object structur inform agent agent execut inform gather descript environ design analyz coordin mechan section introduc distribut sensor network environ chapter analyz environ control function detail rest chapter focu specif object task complex fulli develop part chapter discuss subject gener give short exampl problem solv environ obviou extens includ extra complex commun subnet lost random variabl connect distribut sensor network discuss formal basic compon object turn environ build model framework grow set singl instanc exampl distribut sensor network problem present author paper compar perform coordin algorithm conclud algorithm result view central tenet theori classic type result framework creat explain predict algorithm situat chapter extend analysi account statist view characterist level detail build model depend question identifi characterist organ algorithm outperform problem recal chapter movement independ vehicl detect period time distinct sensor agent perform agent environ base long creat complet vehicl includ cost commun organiz structur agent impli portion vehicl track agent task environ model natur distribut problem assum independ group task arriv multipl locat period time distribut sensor network episod movement independ vehicl detect period time distinct sensor agent perform agent environ base long process data complet vehicl includ cost commun sensor intermedi task organiz structur agent impli subset task group agent cost agent overlap multipl agent potenti work data overlap area extra commun cost make simplifi assumpt agent homogen capabl respect receiv process agent cooper maxim system perform maxim individu data episod simultan agent initi structur constraint subtask task group singl episod list task part task group organiz structur chapter base statist properti episod singl instanc episod properti episod environ summar tupl specifi variabl number gener complex interrelationship subtask affect schedul facilit expect number task variabl structur portion organ rang agent overlap specifi templat structur task group model repres vehicl track separ task correspond vehicl track length agent sensor assum arrang squar rang paramet specifi physic rang agent sensor width overlap paramet specifi wide overlap area nearbi agent figur show section describ detail task group structur figur exampl organ summari environ tupl episod environ tupl random variabl gener poisson distribut locat paramet gener complex process random point side bound box agent sensor pick line comput chapter analyz distribut detail gener episod environ gener valu gener model model problem vehicl track model task group task group occur simultan singl problem solv episod simplest object model task group track length object base simplifi version ffl vehicl locat method repres process raw signal data singl locat result singl vehicl locat hypothesi ffl vehicl track method repres short track connect result time result time ffl vehicl track complet method repres merg complet vehicl track hypothesi relat execut task exist shown figur enabl enabl lone structur fairli common larg amount detail work result collect singl locat agent process hierarchi coordin accomplish transfer result agent avoid redund work part agent overlap potenti balanc workload min min min min min method task qualiti function min subtask relationship enabl relationship figur object task structur singl vehicl track model develop express expect distribut time termin set agent arbitrari environ static organiz structur coordin algorithm model analyz reorgan algorithm shown extra overhead worthwhil versu static algorithm case predict effect ad chang rel cost commun chang agent organ rang overlap result achiev direct mathemat analysi model verifi simul describ result discuss detail gener level chapter object level model object level describ essenti structur situat instanc time task interrelationship dynam affect qualiti durat task basic idea task group episod induc task execut agent studi task group independ task singl task group interrelationship task group task deadlin qualiti execut result task influenc qualiti task group result quantiti evalu perform system individu task subtask call method smallest schedul chunk work schedul algorithm method schedul schedul multipl level method accomplish method amount time produc result qualiti qualiti agent perform individu task function time choic agent action possibl task execut local effect exist task call coordin relationship basic object model formal execut time task affect measur qualiti local subtask relationship task task group qualiti base subtask relationship qualiti function construct task group consist consist individu execut task reach subtask relationship defin set direct subtask qualiti function return qualiti time valid direct graph induc relationship acycl task direct indirect task subtask call method method repres comput physic qualiti method section semant environ model choic qualiti function arithmet min min min case qualiti task minimum qualiti subtask popular task qualiti combin function minimum qualiti gener minimum subtask refer averag qualiti parent remain minimum subtask complet subtask task complet gener make method qualiti min min maximum refer xor sum subtask execut gain qualiti parent task model situat subtask complet receiv construct situat complet addit subtask gener addit task potenti maximum qualiti agent achiev agent time back achiev qualiti max max sum mean qualiti gener task sum qualiti gener subtask common mean averag mean qualiti gener task qualiti gener subtask consid avg jtj function model environ function repres diminish return fix similar linear lin function defin convex curv function sum averag possibl task environ carri comput task structur repres search process agent optim qualiti model task turn attent method local method qualiti method time potenti produc execut section maximum qualiti amount time defer definit function discuss effect section execut method multipl method singl task agent switch altern method tradeoff time model effect partial result effect section set aggreg oper includ basic duboi prade shown triangular norm averag oper triangular max gener famili binari function satisfi semant requir basic class aggreg oper duboi current amount progress execut interrupt execut start time finish typic model qualiti produc method linear growth function lin lin model linear qualiti concav qualiti function execut task qualiti begin convex qualiti function qualiti achiev earli small occur option part qualiti function desir easili defin power main school thought qualiti anytim algorithm camp garvei repres idea anytim algorithm model partial result definit lin model result task definit differ approach show gener subject addit assum fix estim actual method deadlin task group individu qualiti accumul defin work task deadlin qualiti effect task method start execut execut method finish potenti affect execut effect write relat ps paramet specif class effect outcom applic effect durat chang qualiti chang boddi assumpt made monoton gain effect class function method time durat qualiti paramet paramet amount direct effect depend rel time method qualiti effect inform commun agent execut method effect depend current qualiti effect effect trigger rise edg qualiti past effect defin helper function return earliest time qualiti surpass st commun effect depend avail inform agent commun inform time task agent delai ffi ffi model commun channel commun primari concern simpl model time delai ffi defin effect depend avail defin helper function avail repres qualiti task agent time execut avail execut qualiti calcul commun receiv agent prior time comput method initi maximum qualiti durat defin effect consequ effect appli order model maximum qualiti function defin task task group definit depend set qualiti function model qualiti function discuss definit maximum qualiti task max max min min jtj current durat function object definit appli task gener useless concept concept minimum durat requir achiev maximum qualiti explor clear specif concept benefit framework effect exampl effect import part suppli characterist make task environ uniqu channel ad descript agent control coordin algorithm describ commun occur commun action section concept agenc section typic model defin class resourc enabl section definit common class effect model environ effect occur method call coordin relationship enabl task enabl method maximum qualiti complet result maximum qualiti chang initi maximum qualiti view effect start enabl ration schedul execut method enabl facilit pgp algorithm formal facilit effect organ defin facilit effect relat spatial properti activ recogn comput facilit transmiss inform facilit occur inform form provid reduc search space make task easier solv simpl understand relationship comput relationship sort search faster retriev item sort data sort retriev sort task facilit retriev task task provid result task facilit task durat qualiti partial result facilit effect constant paramet power oe oe effect durat effect vari power qualiti facilit task work facilit task start ratio defin note work start formula evalu execut avail oe oe oe oe complet maxim result receiv durat percentag equal durat power oe facilit effect definit commun start process effect chapter explor effect coordin facilit effect effect hinder hinder effect opposit durat maximum qualiti consequ express model repres situat reduc baselin perform measur repres situat occur multipl method task fail provid constraint hinder model distract inappropri constraint commun agent lead agent wild chase defin effect combin enabl hinder task task task suffer definit model behavior infinit durat maximum qualiti qualiti accru durat drop initi maximum qualiti initi ratio maximum qualiti effect power paramet oe formula easili understood mind ratio qualiti maximum qualiti method execut oe oe avail oe oe avail task method complet execut complet execut action explicit commun action properti complet ensu causal relationship rare comput schedul domain work gener class facilit relationship model effect partial result switch task model paramet ae retain time percentag ae switch task start ae method credit time origin method assum method durat assum agent start switch method time defin share result share note final qualiti limit maximum qualiti method definit expand hinder method method typic agent move method method higher share result credit time spent cumul cancel cancel complet time favor favor relationship von martial express combin relationship put presenc posit coordin relationship von martial describ favor action predic hold action call favor action action agent execut local agent execut von martial defin favor relationship plan hold exist favor action directli enabl plan enabl ad set action plan favor action worthwhil cost repres von martial concept relationship method favor task repres potenti plan favor relationship method task hold method posit effect execut agent agent task agent possibl agent schedul execut depend local util execut point view agent offer favor agent current favor essenti free commun tempor includ deadlin complet current schedul potenti set action execut definit broader von martial favor action case execut agent agent figur show canon von martial post offic assum agent agent method task pictur assum agent bui stamp agent mail packag fact agent execut method presenc subtask relationship packag task mean agent agent packag task agent bui post offic favor fairli notic packag mail post offic stamp bought machin agent tight longer durat counter method favor relationship exist stamp task favor agent bui stamp agent commit extra wait involv talk gpgp coordin mechan chapter briefli discuss implement von martial coordin mechan cooper agent mechan commun task agent achiev qualiti call task agent loop favor action von martial action execut case gener definit method task relat posit coordin relationship favor action posit affect coordin relationship task structur agent packag favor action definit subtask coordin relationship post offic bui stamp mail packag return post offic machin counter max task qualiti function max subtask relationship enabl relationship figur object task structur visit post offic bui stamp mail packag assum agent local method task agent mark potenti favor agent part algorithm straightforward restat von martial algorithm von martial comput cost queri local schedul effect ad commit favor action facilit task group relationship figur depend view method execut agent discuss section ffl execut begin time ffl time agent switch method ffl commun result task task occur complet time ffl linear qualiti model lin ffl method schedul task qualiti task method accru time shown figur max max sha su ha lt figur simpl model task method expand model add complex distribut sensor network model length track mention earlier gener model paramet set gener construct object model specif episod figur show gener structur episod environ model displai actual object assum concret vehicl track length proce model standard featur work past year add characterist agent method deal normal produc qualiti full method requir decker approxim similar techniqu model agent capabl processor agent data execut agent execut enabl condit met figur displai episod descript ad fact agent faulti sensor durat grai method longer explor implic discuss subject level framework section assumpt made redund work gener max combin function agent redund method good assumpt environ independ deriv result posit alter assumpt simpli chang function characterist literatur share result method singl presenc share relationship pair normal time figur qualiti task group time previou figur share result method faulti sensor method min task qualiti function min subtask relationship enabl relationship method min min min max max max max max max type agent figur object task structur agent add final featur make model low qualiti result tend make thing harder process higher level impact qualiti affect qualiti durat enabl solut model relationship method enabl hinder execut enabl result low qualiti execut inform slightli shorten execut vehicl track sensor properli configur correct signal process algorithm paramet similar facilit effect occur track level effect occur local result share effect import motiv agent behavior agent send preliminari result agent bad sensor data receiv agent disambigu data figur repeat object task structur previou omit method clariti task ad model facilit vehicl locat vehicl track level highest qualiti initi work vehicl qualiti function maximum progress full summat qualiti function note task ad make model method track method easier remain model implic episod model describ effect commun time commun partial result agent delai potenti impact agent qualiti agent delai examin question detail chapter min task qualiti function min subtask relationship relationship facilit relationship min min min max max max max max max vl max figur effect object task structur end return add subject inform cost resourc physic comput resourc import model domain cheng ramamritham shen sycara dissert concern model comput task structur extern physic resourc resourc section briefli describ extend model physic resourc rest dissert concentr pure comput carri simul experi physic resourc dissert import futur futur work section chapter real effect work data point bring effect model replac summat max sum linear exponenti recent extend resourc repres directli task structur point view task environ effect respect comput chang durat qualiti repres set effect link add resourc node task structur associ state inform point view mathemat section resourc qualiti nomin state vector durat subtask relationship idea similar ad task repres amount work vehicl locat vehicl track figur section method relat resourc kind run resourc method chang state affect durat max qualiti usual situat commun link agent diagnosi method link diagnosi method execut link satur durat method lengthen repres situat shown figur defin oe oe method agent method agent limit bandwidth commun resourc figur method share limit resourc capac method execut tempor overlap time durat method lengthen amount limit resourc capac method paramet ff figur diagnost method unit commun resourc capac arc label limit resourc maximum capac oe point durat affect percentag oe oe defin function level figur commun satur point oe resourc satur diagnost method resourc satur method happen overlap execut effect activ durat method note method lengthen method durat due block resourc lengthen amount continu block method interrupt comput perform method longer block import note develop resourc argu time futur work chapter extens includ addit task resourc major advantag excit thing lowest defin resourc effect ad simpl mechan note formula qualiti variabl hold state inform resourc requir state variabl repres qualiti note start chapter figur object structur method consum method replenish similar defin repres consum resourc oper figur ff oe figur method consum unit resourc amount method execut replenish resourc resourc case replenish note object gener model method consum unit resourc amount drawn distribut subject model make method method consum believ consum gener model subject level model agent action subject level model environ describ portion object model situat answer question piec inform cost agent piec descript agent interact option agent acquir inform act inform chapter discuss agent execut commun build descript introduc concept agenc model descript comput task environ formal inform descript concept agenc section add notic formul defin notion comput environ agent part formul notion belief appli concept inform agent view locu belief action state introduct chapter form rest section ffl environ affect belief level model ffl belief agent affect basi coordin control problem rest dissert describ analyz mechan accomplish step ffl action agent affect model describ section state environ agent agent act type agent method inform gather action subject map agent thought symbol denot set belief agent time modal oper agent subject believ time defin subject map map element current episod agent subject view element map empti element core subject level model defin map agent probabl believ maximum qualiti method object probabl believ maximum qualiti object object assert subject includ qualiti relat comm paramet section describ exampl map defin action call inform gather amount time result addit inform agent belief defin task arriv inform gather action action place subject version inform object episod agent belief decid control belief agent affect action control mechan focu research local control discuss chapter chapter agent control mechan agent current set belief updat special subset belief ae defin set inform method execut action comput subset describ agent intent agent intend execut method creat method execut action method execut agent add method execut action set intend method execut section describ agent intend action agent build typic divid control local schedul coordin chapter requir describ agent belief entail commit inform method execut control compon model describ durat featur analyz question cost control implement detail processor execut agent time limit execut monitor extens part dissert understand detail control cost algorithm implement earli stage research inform control durat simul comput model support parallel breviti describ singl processor comput sequenc agent state agent current state uniqu provid agent function divid part figur control previou assert method execut method inform gather inform gather action commun commun action star control inform gather commun method execut figur finit state machin describ agent comput subset agent belief repres inform method execut control mechan assert method execut action action comput cycl repeat simpl model parallel similar implement inform commun run multipl method execut processor import interact method execut parallel repres effect method execut action agent affect object environ qualiti execut subject map inform affect execut simpl method execut preemption follow discuss lin section simpl model singl processor method agent enter method execut state method time remain state time method execut action similar shoham term action consid method method execut action set upper time comput proce agent monitor execut long interleav execut action formal definit simpl method execut method agent execut identifi part object model extern true maximum qualiti time comput initi effect section true durat time comput initi effect section mathemat model qualiti accru execut start execut time state environ updat agent state environ includ valu comput section agent time state believ depend model qualiti qualiti time trigger state arbitrari time environ move state time updat valu addit start time method agent execut finish time agent finish execut agent move state time agent remain state believ finish add belief object model assert simpl model execut agent modifi execut singl method capabl ad extend model method execut intent pair mean execut time finish earli simpl extens monitor improv model local schedul intend action task monitor point commun action agent affect commun action agent affect belief limit extent peopl work formal note actual object durat time agent belief durat aspect semant commun action freeli defin environ simplest commun act send agent effect chang qualiti avail remot agent messag receiv commun recept chang qualiti trigger effect influenc behavior agent control algorithm commun action time delai commun agent discuss section inform gather inform gather action comput resourc spent execut inform environ inform gather action task arriv inform gather action section queri environ arriv task task group inform gather action commun arriv agent agent belief kind inform gather identifi coordin local effect span multipl agent chapter commun inform gather action period time necessarili model fourth type inform gather call subject model return began section demonstr ad subject level model repres effect faulti sensor defin default subject map simpli return object agent true object qualiti durat method local effect alter default case faulti agent faulti sensor initi realiz subject level artifact work model easili framework view method subject believ maximum qualiti fact object maximum agent discov method execut strength initi data model lower subject perceiv maximum qualiti weakli data track subject complet task group agent actual vehicl subject accru qualiti agent execut point true qualiti track span multipl agent sensor agent potenti identifi track commun belief track agent suffer imagin agent control environ notic method unusu realiz sensor faulti subject map agent class agent model situat agent simpli differ sugawara network diagnosi system briefli return sugawara network diagnosi introduc section figur sugawara system make schedul coordin diagnosi task base perceiv view environ subject view wrong diagnosi system monitor progress progress match subject gener explan discrep updat subject view subject view result task schedul coordin differ figur show subject view resourc essenti situat result coordin execut diagnost method real object situat lower problem occur method execut simultan diagnosi system spot inform gather action ad detect situat occur coordin action ad schedul avoid overload bottleneck resourc agent subject view object realiti method agent method agent limit bandwidth commun resourc method agent method agent limit bandwidth commun resourc se method agent method agent limit bandwidth commun resourc se limit se im figur learn network diagnosi correct schedul strategi object knowledg situat occur explain object subject level model present moder complex task structur turn gener level statist properti environ episod gener level model framework exampl gener level object subject level model individu ad gener level model determin expect perform algorithm long period time individu problem solv episod model view workload gener environ work statist gener model task time amount work task group task durat likelihood effect task chapter decker garvei gener level statist paramet agent subject reason agent make control base knowledg expect durat method gener level model construct care analysi real environ observ statist properti real episod paramet real world made variabl model question affect thing care approach verifi assumpt environ simpl statist approach detail model verif import framework optim paramet real focu dissert dissert focu learn gener effect paramet coordin algorithm chapter excel proce build gener model gather detail object subject task structur specif episod examin determin obviou endogen featur episod provid environ number length track set test order patient hospit schedul arriv late resourc failur rate airport resourc manag problem develop task structur episod constrain futur work examin possibl induc gener paramet observ episod task structur model singl episod list task part task group organiz structur base statist properti episod singl instanc episod properti episod environ summar tupl specifi number expect number task structur portion organ rang agent overlap agent specifi homogen task group structur discuss section episod environ tupl random variabl drawn poisson distribut expect gener section extend gener model cover featur ad object subject model section add likelihood sensor faulti likelihood ghost assum agent start squar agent agent arrang simul gener order test coordin schedul algorithm gener simul random task structur gener describ gener give model abstract task environ construct gener gener structur applic structur gener abstract work applic problem random craft match specif environ abstract environ gener perform analysi schedul coordin algorithm random environ gener gener paramet commun gener subject potenti class task group object default gener subject templat list agent simpl probabl overlap chanc overlap method object method gener overlap chanc agent overlap method object valu pass unchang agent agent execut action receiv inform method execut parent default gener subject templat subject properti random environ consist gener subject templat list gener object templat potenti class task gener object templat averag number children task task structur poisson distribut averag depth task structur count leaf poisson distribut averag initi durat method exponenti distribut averag initi method exponenti distribut distribut potenti qualiti accumul function task custom discret distribut deadlin tight deadlin task group set fi estim singl agent execut time actual instanti task ff fi paramet calcul estim ignor effect time arriv instanc task group class exponenti distribut qualiti accumul function combin overlap method method max choic random structur gener specif relationship top basic structur pattern paramet addit gener object templat paramet gener hard soft relationship probabl pattern hard relationship gener sibl prevent loop pick test remain pick remain sibl continu sibl pattern discret distribut potenti relationship nil relationship discret distribut potenti relationship nil relationship pattern presenc method complet subtask task figur exampl pattern gener method subtask task enabl subtask task pattern simpl probabl method gener environ schedul multipl wai achiev task method execut agent sever time pressur call method pattern gener method altern exist method leav task structur pattern probabl method altern specif tradeoff repres fast method faster quick dirti end hurt hinder relationship structur figur specifi paramet hinder relationship fast method parent task parent task exampl section present exampl model environ demonstr flexibl discuss impact task environ coordin issu sketchi distribut sensor network focu exampl repeat hospit patient schedul descript actual case studi patient gener hospit resid unit organ branch physician request test therapi perform part diagnosi treatment patient test perform distal locat ancillari depart hospit radiolog servic receiv request number unit hospit min task qualiti function min subtask relationship enabl relationship method type min physic therapi min draw blood test test min min min min min min min min unit min min min min min min min min ancillari ancillari ancillari min task commun ancillari requir delai inhibit unit resourc patient patient patient figur object task structur subject view typic hospit patient schedul episod top task ancillari object entiti unit task link diagram test interact test relationship requir delai perform inhibit perform invalid test bs result perform time period rel note unit secretari schedul minim patient stai ancillari secretari schedul maxim equip minim setup time gener level model environ focu time patient number distribut patient test gener paramet includ specif number unit number type ancillari resourc machin parallel ancillari episod gener ow hospit fix number unit fix set test templat physic blood templat durat distribut long postul arriv rate patient distribut test set patient link patient uniqu task structur patient figur show object task structur episod subject view unit ancillari schedul agent test order min repres qualiti gener unit ancillari chang doctor test prescrib figur earlier explicitli repres patient resourc constrain repres pair note patient portion test blood work blood sampl note repres patient travel time import differ airport environ section reason repres scale problem patient travel time fix assum patient deliv room point futur implic travel hospit chang coordin schedul face travel delai ancillari happen smaller hospit afford mr scanner cat scanner doctor prescrib mr cat scan hospit patient requir mr cat scan facilit effect task structur scan consecut affect coordin structur requir delai relationship amount ffi time pass execut method enabl ill repeat definit gave chapter requir ffi ffi ffi examin hospit current coordin structur enlighten show mismatch structur current hospit environ mismatch trigger studi mismatch guess environ chang assum current hospit structur fact good structur origin put place current hospit structur ow receiv request unit secretari convei test request secretari relev ancillari depart ancillari secretari determin time test run unit secretari notifi immedi prior schedul time slot sooner actual time patient schedul ancillari secretari relai back request ancillari schedul independ conflict patient schedul overlap time slot ancillari conflict ow call resolv unit secretari unit secretari made awar schedul ancillari time request patient slack time remain resolv schedul conflict disrupt care patient structur lack compar current time low overhead arrang past doctor order fewer test complex ancillari equip medic technolog interf relationship technolog structur adapt task environ al describ set coordin comput adapt hospit current task environ type comput agent unit subsystem monitor test request result schedul patient ancillari subsystem receiv test request unit subsystem schedul commun protocol rest unit subsystem inform ancillari test request part task request includ soft deadlin due task ancillari schedul test share primari perform criteria miss secondari local criteria minim maxim criteria ancillari pick earliest slot slot schedul slot call commit discuss gpgp chapter commun back unit subsystem slot schedul patient slot broadcast effect block slot ancillari test patient diagram resourc constrain relationship thing note system explicitli handl interact test ancillari gpgp famili coordin algorithm configur respond interact elimin broadcast commun airport resourc manag umass arm resourc manag arm system solv airport ground servic schedul problem function system ensur airport flight receiv requir ground servic baggag time meet arriv departur deadlin addit problem ensu case sequenc multipl test wrong sequenc result patient stai delai residu effect test influenc earliest start time test suppli resourc task consist servic action resourc task subtask airplan servic parallel task task simultan choic resourc assign constrain start end time task select specif arriv gate plane limit choic servic vehicl due transit time previou servic locat limit option due presenc lack underground fuel tank gate resourc specif type consid interchang domain gener model environ includ nomin flight model error schedul late arriv airport resourc plane set episod time period includ nomin flight schedul addit gener model failur rate servic resourc nomin flight schedul airport fix ahead gener episod concern variat arriv time equip breakdown arriv flight spawn task group servic flight figur show object task structur small episod fuel baggag truck gate underground fuel enabl local fuel deliveri fuel truck slightli unusu relationship hold gate servic gate held entir time servic strict sequenc subject inform agent arriv time task group tent min task qualiti function min subtask relationship enabl method agent servic plane gate fuel baggag local servic plane gate fuel baggag local gate gate fuel fuel bag bag gate resourc figur object task structur small airport resourc manag episod notic differ structur hospit structur resourc import connect substructur necess repres effect equip travel time repres hospit case point doesnt travel hospit travel time patient import classic coordin travel action resourc fuel relat action complex chang effect potenti success action talk section strongli connect structur impact potenti coordin mechan real schedul central manner fix set resourc resourc baggag truck system agent slave obei command central central schedul process complex term comput project provid perform improv central system multipl schedul subject view problem schedul simplifi assign schedul control resourc schedul airport gate number fuel baggag schedul local schedul servic plane arriv problem agent simpler separ similar problem agent agent solv problem parallel downsid total separ solut potenti wast resourc combat system agent lend resourc lend act connect initi unrel task group resourc relationship make agent schedul harder solut suggest task structur servic provid plane schedul servic constant kei busi closer morn rush fix slot plane arriv assign slot techniqu remov uncertainti plane arriv system airport gate assign made earli custom autom baggag solut similar basic corpor organiz direct schedul appli resourc central offic turn central rapidli chang inform modif structur matrix organ separ agent track class resourc baggag truck fuel truck agent servic draw resourc pool internet inform gather task environ mention briefli overview thesi distribut inform gather popular commerci grow leap bound provid rich vari sourc inform quickli effici retriev inform view set interrel task uncertain dynam environ piec data point time locat subset method extrem common nowadai answer found undertak sequenti search find resourc access method singl multipl agent search multipl locat parallel coordin action result work agent suggest exist agent gather addit suggest task agent gener level inform task environ includ frequenc type queri agent result usag includ inform dynam frequent connect link physic inform sourc physic sourc inform sourc physic sourc physic resourc min task qualiti function min subtask relationship method agent mac queri librari info mac queri specif wai ftp mirror max sourc specif movi queri wai http cm figur object task structur independ queri resolv point singl machin figur show part object level descript episod queri macintosh inform movi mac queri encompass gener sourc mac electron electron file usenet standard librari articl search queri construct interact human user persist mac queri intellig agent task search inform sourc broken access method sourc agent telnet access class librari access method impli multipl physic resourc back issu found mother site mirror site work retriev mirror site redund site oper fast accept imagin enforc user perform criteria agent carri task user necessarili answer wait agent find answer find queri continu inform retriev futur point note figur presenc share resourc link unrel queri share physic resourc machin store wai similar exampl includ popular mirror archiv site min task qualiti function min subtask relationship method enabl facilit agent review librari info mac wai ftp mirror max onlin paper seller retriev locat fax onlin librari seller magazin uncov uncov figur object task structur singl queri review macintosh product show relationship figur show detail macintosh queri episod review mac softwar product review found onlin form origin publish paper form onlin user view publish product inform higher qualiti onlin product inform found review portion collect product inform exchang product usenet find paper review product reduc locat citat actual articl tabl content popular macintosh magazin index free period indic seller product inform net citat review product citat retriev hand onlin sourc cost note part structur facilit gener level question uncov citat easi articl fax price task structur environ lend great deal parallel lot work parallel interrelationship fix effici plan search user prefer quick make coordin problem intellig task decomposit pilot associ global coher problem address occur system pilot associ system situat occur potenti complex dynam chang coordin relationship goal spread agent agent pilot associ system subtask agent receiv task agent fulfil assum tactic tactic planner control figur order turn activ sensor situat detail rout plane movement tactic maneuv mission turn activ sensor plane easili detect time plane passiv situat assess agent interfac pilot confirm activ sensor plot escap rout plane screen case thing wrong pass task mission planner tactic planner mission planner produc detail rout tactic maneuv task mission planner act local tactic planner request tactic planner task high prioriti global mission planner plan escap pilot order author turn activ tactic planner system perform goal handl tactic situat mission planner escap rout plan describ gpgp detail chapter briefli describ scenario term deadlin tactic situat inherit tactic rout subtask enabl relat pilot confirm activ trigger gpgp mechan place earlier deadlin pilot confirm task commun pilot vehicl interfac task escap base earlier escap rout earlier deadlin tactic mission planner obtain inform schedul task time task earlier deadlin schedul ration escap rout plan escap rout plan tactic rout respond tactic situat turn activ sensor show escap rout min task qualiti function min subtask relationship enabl relationship method type pilot vehicl interfac mission planner situat assess tactic planner pilot confirm pilot figur dynam situat pilot associ task accru qualiti min summari chapter discuss featur model process intens task environ call environ exist formal captur rang interrelationship occur intens task environ simplest model task environ specifi action agent action relat framework studi coordin subject relat behavior discuss negoti respect studi plan schedul comput realist parallel task environ garvei contribut base describ environ shown exampl end section behavior agent design control show gpgp chapter thing includ analysi chapter work limit address work describ environ dissert concentr object viewpoint deal uncertainti agent subject work aspect gener model dissert construct statist episod valu random variabl set dynam task structur chang dramat time complex model gener gener model set model human agent address call uncertainti thing real human extern forc chang structur environ essenti unpredict wai factor influenc measur chang agent prior warn bound uncertainti surround discuss chapter problem gener framework achiev extern valid doesnt requir constant domain comput doesnt human system task environ smallest unit schedul action relationship mean depend environ set task abstract organiz unit intend schedul plan inform dynam featur ffl dynam stochast arriv partial task ffl dynam interrel task durat qualiti action agent stochast process ffl dynam agent local view time progress local action concept agenc base simpl notion inform gather agent locu belief action separ notion agenc model task subscrib agent architectur assum adapt task environ exist alongsid blackboard shoham agent orient agent architectur concept uniqu comput approach talk agent architectur similar shoham agent orient program chapter framework gener base abstract applic domain model specif sensor interpret fire fight show model environ episod expand simpl distribut sensor network model chapter uniqu featur framework direct interrelationship task resourc constraint coordin relationship crucial design analysi coordin chapter formal function specif arbitrari task section basic subset chapter model built gener captur singl problem instanc previou approach system hospit exampl final wider class problem stochast vari featur statist subject chapter design analysi coordin task environ model simpl environ problem physic wont resolv color acid wont dissolv place wise hope strong answer game live previou chapter framework includ simpl distribut sensor network environ chapter model analyz problem depth previou approach analyz organ distribut sensor network effect organ analyz organiz effect exampl work focuss analysi gener extrem abstract sen analysi similar spirit present domain schedul develop test mathemat express import characterist object episod express develop analyz coordin algorithm agent environ end chapter develop express primari perform criteria coordin algorithm valid mathemat model simul dynam organ agent reassign base develop view problem hand agent dynam organ option current state problem solv commun solv problem due uncertainti explicitli repres task environ clear perform tradeoff static dynam organiz structur environ chapter serv concret impact differ coordin algorithm discuss algorithm implement algorithm environ varianc environ larg agent commun build dynam organ put expand earliest inform resolv uncertainti current agent creat effici organ situat task environ simul test model develop simul problem solv simul episod place grid concept length size correspond directli physic distanc figur illustr simpl organ grid simul simul assum vehicl discret integ locat randomli enter edg leav edg point vehicl travel track move diagon time unit simpl algorithm figur averag length track actual length track rang unit distribut organ calcul locat sensor agent inform locat travel vehicl determin part task group initi agent agent part complet task group section detail structur task group simul figur exampl organ grid gener level model process discuss back section properti episod environ summar tupl specifi variabl number expect number task variabl structur portion organ rang agent overlap specifi templat structur task group episod environ tupl random variabl gener poisson distribut locat paramet gener process explain specif applic interest environ task group type agent respond type subtask multipl agent respond type paramet expect number sensor subtask system agent confront agent amount low level data track vehicl move agent area order analyz perform proport task group agent process upper limit proport agent rang agent process upper limit static organiz structur task termin system ti complet task heavili load agent averag part task group focu analysi termin problem examin expect maximum portion task group section develop equat expect maximum workload agent count expect number sensor subtask individu vehicl maxim load agent amount singl task group agent number sensor subtask view random variabl probabl densiti function cumul distribut function probabl function empir heavili weight simplifi correspond number subtask singl task group creat random variabl equal agent maximum bernoulli distribut paramet chanc agent maximum amount task group assum number task group maxim load averag agent singl task group remov assumpt number time agent maximum task group coin binomi distribut agent flip distribut maximum number agent call binomi max order random variabl refer random variabl refer maxim load agent probabl function steeper shape larger expect binomi figur amount task group agent maximum amount averag model sensor recept process simplif common interchang chapter built simul count random episod complet analysi discret distribut add effect model needlessli complic discuss detail deriv result tech report empir determin simul mention probabl figur comparison probabl distribut outcom act flip coin time binomi compar outcom agent flip coin number head agent flip head max order statist coin head maximum data coin tail convert back easi analyz random variabl variabl interest call equat random variabl model data point agent complet track rememb definit expect sum product probabl outcom case probabl max order statist agent number data point function expect load agent agent task group probabl probabl task group maxim load agent maximum random time eq show expect random variabl number sensor subtask maxim load agent task group episod random distribut section figur show load observ averag plot expect track squar organ color point refer lighter grei correspond larger valu estim max figur actual versu predict load sn valu distribut binomi max order statist expand formula section amount singl task group agent view random variabl probabl densiti function cumul distribut function number agent initi part singl task group elementari densiti max order statist max max af expect load sg probabl function heavili weight simplifi correspond number subtask singl task group introduc random variabl equal agent maximum bernoulli distribut paramet chanc agent maximum amount task group correspond number time agent maximum agent task group binomi distribut paramet agent task group distribut max max squar correl measur good fit interpret proport total variabl observ data explain model order statist binomi easili deriv probabl function cumul distribut function binomi distribut assum track independ deriv cumul distribut pr pr pr pr pr probabl function pr expect number task group maximum number task group agent calcul expect agent load equat beg question maximum number task group individu agent actual expect number entir system solut agent task binomi process number task group agent binomi distribut paramet number agent singl task group total number probabl agent track give equat deriv max order statist probabl function expect sg figur show actual maximum number track agent run versu predict track squar organ overlap expect number agent remain term analyz deriv express system perform expect number agent singl task group depend total number agent organ task group agent overlap agent task group agent squar environ number track predict maximum number track actual number agent track predict number agent track figur actual versu predict maximum number task group agent actual versu predict averag number agent singl task group approxim relationship ratio area sole cover agent area overlap total area cover note random deriv directli paramet figur show regress actual averag run predict organ work involv task structur deriv model number sensor subtask heavili load agent number task group agent averag number agent task group turn question work agent data point task group order solv problem hand model perform system base structur task involv describ structur briefli restat basic previou chapter object level describ essenti structur situat instanc time task interrelationship dynam affect qualiti durat task chapter concentr durat perform metric individu task subtask call execut method smallest schedul chunk work qualiti durat agent perform individu task function time choic agent action possibl previou task execut basic object model formal execut time task affect qualiti durat dissert case effect avail result task alter qualiti durat result effect chapter consid task task maximum qualiti complet result maximum qualiti chang initi maximum qualiti execut model chapter extrem simpl model execut earlier section agent perform method inform gather control compon agent determin action agent perform base agent current set belief method execut method begun time conclud time inform gather action durat updat agent set belief inform arriv data start commun agent commun action durat commun make inform method execut agent agent receiv side perform inform gather action commun affect local belief simpl object model recal chapter summari environ tupl episod environ tupl random variabl drawn unknown distribut locat paramet note make assumpt characterist differ environ descript simul earli section note physic process vehicl track gener length track distribut task group track length basic object base chapter ffl vehicl locat method repres process raw signal data singl locat singl vehicl locat hypothesi ffl vehicl track method repres short track connect result time result time ffl vehicl track complet method repres merg complet vehicl track hypothesi enabl effect exist method level method level shown figur enabl enabl lone min min min min min method task qualiti function min subtask relationship enabl relationship figur object task structur singl vehicl track assum initi durat initi durat task structur task group total execut time singl processor agent task structur simplif real task structur sensor facilit relationship track ad featur task structur interest phenomena discuss section section explain add featur basic task structur model summari section basic model begin basic paramet episod environ task group structur mention section develop express number sensor subtask heavili load number task group heavili load averag number agent singl task group result deriv probabl distribut system agent total task distribut sj final eq deriv amount process involv singl task group structur section combin result simpl local schedul coordin algorithm static dynam organ describ perform system agent organiz algorithm episod environ static dynam organiz reorgan balanc system load background analyz static dynam organiz structur defin static structur chang episod dynam structur chang agent redistribut process overlap region sensor rang equat maximum expect number subtask agent number task group maximum expect number task group total number predict number agent part task group kei static structur divid overlap area priori agent redund work overlap area kei dynam organiz structur shift divid line overlap transfer agent resourc effici repeat assumpt discuss start section page agent homogen capabl respect receiv process agent cooper maxim system perform maxim individu data agent episod simultan agent initi structur constraint subtask task group note agent data sensor region analyz static organ static agent divid overlap area rang evenli result area agent overlap figur task structur section shown figur raw data commun task result provid inform gather agent time build list execut method set time agent build list method constraint met commun action algorithm broadcast highest level result task group agent work join partial track construct agent partial track construct produc longer track agent control algorithm raw data termin task group complet local recept result reason overlap appar dynam agent work overlap area pai cost commun raw data overlap provid redund case agent failur set execut method set method wait figur track thick dark grei box outlin default static overlap analyz algorithm assum task group present environ repres largest amount data task group total number agent task group agent defin equat amount time agent construct complet solut equal amount time initi inform gather action amount time local work commun work agent result amount time combin result agent time produc final complet task group result commun result simplic assum figur detail previou figur process place track run constant depend amount data note agent heavili definit agent finish work commun time agent finish local work figur show mean formula respect singl track figur run point point number data point agent agent execut time join vehicl locat local partial track number agent track work connect partial track case gener system total task expect amount sensor data initi data maxim load agent deriv margin expect joint distribut similar singl task group total time termin agent receiv initi data set size time local combin result build complet commun inform gather sd eq predictor combin probabl valu eqn similar treatment eq test predict equat versu termin time simul repetit randomli chosen environ design space durat task set gener random environ uniformli integ variabl state rang valu time durat inform gather commun demonstr discuss effect assumpt paper simul valid statist suggest predict output analyt model output predict varianc result test standard normal tabl unabl reject null hypothesi actual termin equal predict termin ff level good thing null hypothesi predict actual reject test problem reason prevent reject null hypothesi approach avoid problem report alpha level test test power statist hypothesi test unabl reject null hypothesi realiti true unabl reject null hypothesi realiti type ii error reject null hypothesi realiti reject null hypothesi realiti true type error ff level essenti probabl type error power test fi essenti probabl type ii error null estim power test requir detail knowledg distribut test statist condit altern hypothesi true turn requir comput power altern futur work involv comput power develop test base statist power characterist figur show repetit environ versu expect likelihood interv likelihood interv includ give idea shape underli system design interv point section analyt model describ implement fairli analyt model design good static organ standard heurist optim techniqu simul anneal control cost control algorithm present simpl necessarili optim commun local work agent chanc agent composit task group increment transmit result set result singl task maximum potenti save balanc cost multipl commun predict varianc equat easili deriv statist ident run number likelihood interv likelihood interv expect termin actual termin termin time figur actual system termin versu analyt expect analyt determin likelihood interv run arbitrarili order expect termin time question commun increment transmit partial rest directli cost commun rel depend basic method durat agent organiz agent singl track intermedi commun simpl control algorithm analyz unlik system control cost view cost control time spent agent perform action inform algorithm run constant time action test set execut set method worst case requir test element full task size control relat organiz structur analyz dynam organ dynam organiz agent limit origin organ initi distribut data agent chang initi static boundari overlap ship raw data agent process assum section agent commun current local state problem solv directli section thought clearer distinct dynam organ agent make initi chang boundari ship raw access inform commun situat agent access local inform summari local state agent case dynam chang organ made start episod case reorgan overlap agent shift initi static boundari send messag overlap agent work overlap area effect local agent chang effect rang paramet static chang term equat ad commun action shift extra inform gather action receiv result section discuss implement idea partit overlap area reduc expect differ agent load averag compet desir partit multipl agent agent commun proport initi data work commun result back alter effect rang method directli reduc term equat proport proport chosen dynam similar partit overlap agent dynam reorgan function agent local util load agent concentr agent load local local work initi static organ task load agent static boundari shift process agent time short short short commun action potenti cheaper result commun mention calcul balanc load local action time long ps long potenti commun action mention earlier involv send larg amount raw agent work simpl comparison equat suffici design rule decid static dynam organ assum agent busi solut assum agent averag amount work deriv priori estim averag initi work agent equat replac probabl function max order statist simpl binomi probabl function system agent intellig dynam overlap reorgan dynam load balanc constraint dynam coordin algorithm reorgan section describ implement gener idea earlier dynam reorgan partit agent simul implement agent area relax compet constraint agent quickli associ order messag arriv affect eventu messag agent request movement corridor surround agent northern corridor agent northern agent organiz boundari share agent row agent figur organ corridor row column figur left static dynam reorgan result agent attempt reduc area unit corridor run north south move closer unit reduc load agent column coordin algorithm work local schedul algorithm earlier section consist view coordin modul behavior modif local schedul prevent schedul local method execut action initi commun complet initi recept coordin algorithm initi phase local schedul schedul initi inform gather proce recept phase local inform decid organiz design paramet valu design calcul estim durat local work estim durat altern agent local work domain comput eq amount data shown agent organ reorgan paramet minim absolut expect differ amount work local amount work remot agent impact chang dynam overlap agent choic reduc area agent unit organiz design paramet ae decid proper reduct agent comput local work eq actual comput assum agent area reduc ae agent find ae minim differ local work averag work equat restat eqn deriv eqn case maxim agent binomi probabl function max order statist ae agent restructur ae agent send messag affect agent request reduct amount ae corridor agent set current area interest includ uniqu portion area enter phase phase regular local schedul earlier control method execut action method uniqu agent coordin algorithm check current time time pass messag agent arriv depend commun delai coordin algorithm schedul action retriev messag note agent reach point agent larg amount uniqu local work agent work wait idl length commun delai time system point agent relax border agent relax algorithm chosen fairli simpl similar choic algorithm symmetr respect corridor surround discuss relax northern corridor set messag move amount move posit neg vote magnitud relax algorithm sum return sum larger maximum vote smaller minimum case max min point agent enter final normal process local schedul schedul action earlier analyz dynam restructur algorithm section develop express termin time episod agent follow algorithm start basic termin time random variabl equat deriv eqn ae comput section valu turn predict express probabl term eqn produc express expect termin test predict equat versu termin time simul repetit randomli chosen environ durat task set time durat inform gather commun except environ section valid statist case unabl reject null hypothesi actual termin equal predict termin ff level task durat figur compar termin static dynam restructur organ ident episod environ ten episod gener environ order benefit dynam restructur chose task durat environ similar note dynam organ significantli static rare episod dynam organ agent decid static pai constant overhead static organ extra commun action extra inform gather time messag reach agent longer commun action agent vote move vote move corridor move caveat discuss section appli idea method correspond lowest ksi method correspond singl ksi durat commun action termin time dynam termin time static termin time figur comparison termin static dynam system environ task durat set simul termin time dynam termin time static termin time figur comparison termin static dynam system environ task durat set simul termin time dynam termin time static termin time figur comparison termin static dynam system environ task durat set simul termin time dynam termin time static termin time figur comparison termin static dynam system environ task durat set simul commun environ organiz choic load long environ choic clear varianc system perform choic optim perform long run optim episod essenti equat local work section comput likelihood interv predict perform organ coordin regim combin local likelihood interv expect load load likelihood interv averag agent load likelihood shown figur assum inform gather action durat commun figur highlight relationship perform static organ dynam load balanc organ number agent load balanc desir number agent relat averag number averag agent load offset cost transfer task figur perform differ static overlap reorgan remain constant rel number agent figur point dynam reorgan overlap area perform static organ amount overlap result consist result graph assum agent shrink entir area minim differ maximum versu averag work section maxim visual differ graph graph show dynam calcul reorgan algorithm shrinkag paramet high level overlap dynam reorgan organ predict high level overlap expect perform differ static organ load balanc remain constant chang valu figur short long differ valu move curv directli seri figur demonstr effect ratio comput durat commun durat subsequ figur assum dynam restructur shrinkag paramet ae set minim differ maximum averag local work section figur show expect likelihood interv system termin durat method execut action equal commun action time commun action task structur remain section figur clear separ emerg static dynam termin experi chang commun delai agent fix time data episod arriv continu environ delai import section figur assum number task group reason highlight varianc implicit minim influenc extern environ figur show extra varianc ad termin time number agent static load balanc reorgan figur likelihood interv expect termin system coordin number termin time number agent static load balanc reorgan figur likelihood interv expect termin system coordin number termin time number agent static load balanc reorgan figur likelihood interv expect termin system coordin number termin time overlap static reorgan figur likelihood interv expect termin system control vari amount termin time overlap static reorgan figur likelihood interv expect termin system control vari amount termin time overlap static reorgan figur likelihood interv expect termin system control vari amount estim termin cost execut commun static organ dynam restructur figur effect commun cost expect termin static organ dynam restructur likelihood expect assum number task group vehicl occur episod poisson distribut expect discret probabl function poisson statist probabl conjunct eqn calcul expect likelihood interv termin static dynam organ note figur larg varianc random top bar bar importantli small varianc dynam restructur organ note termin time dynam organ slightli static organ figur bring final point system perform improv significantli dynam rare improv averag dynam algorithm comput assum overlap sensor area trade comput commun agent local load small commun pinpoint true cost benefit organiz inform organiz made agent make restructur load balanc assum averag provid interv reader imagin shape underli distribut likelihood interv likelihood interv estim termin time poisson poisson var var var var figur demonstr larg perform varianc number task group random small varianc dynam restructur coordin random expect agent actual load neighbor agent proper organ exploit inform resolv uncertainti current environ agent creat effici organ situat summari shown shown build model task environ analyz conjunct simpl algorithm coordin behavior chapter show variat termin time explain predict variat agent coordin satisfi answer weaker algorithm earlier work chapter demonstr methodolog analysi design coordin schedul base mad step build model environ section point analysi endogen featur individu gener place reader notic fact detail structur plai part analysi import point give specif tool task structur method model proce provid gener provid output gener model task structur set task greatli focu gener model extran assum simpl view agent loci belief action mathemat analysi chapter formal specif action agent base current agent function inform method chapter combin algorithm agent action static algorithm section dynam algorithm section control algorithm section chapter show methodolog develop express expect likelihood interv time termin set agent arbitrari simpl environ static organiz structur coordin algorithm total time termin agent receiv initi data set size time local combin result build complet commun inform gather sd eq predictor combin probabl valu verifi model simul compon model start extend analyz reorgan algorithm shown extra overhead worthwhil versu static case predict effect ad agent chang rel cost commun comput chang agent organ chang rang overlap figur result achiev direct mathemat analysi model verifi simul repres step forward work model dai system special mad gener model varianc number track load heavili load demonstr import varianc respect agent load balanc commun section return question section framework describ complex task environ design bring work complex environ formal work principl construct agent act ration predict base goal shown appli formal method task coordin opportun complex game matric simul requir implement abstract round pictur hope approach idea carefulli express approach ai commun continu demonstr chapter develop commit styliz inform gather action repres action extern sensor explicit inform gather uniqu discuss section build model level rel question power abstract mechan replac complex reason process simpler tradeoff model complex system design inform gather action repres gross behavior compon anticip system interact explor interact design coordin formal techniqu complex environ chapter move simpl coordin mechan chapter famili coordin algorithm construct expand set simpler coordin mechan algorithm complex move environ specif properli gener test gener partial global plan relat call consist continu interact tendenc necessarili synchron barbara altern perspect critic research shown singl organ coordin mechan environ chapter discuss design implement extend famili coordin call gener partial global plan form basic set coordin mechan team cooper comput agent import featur approach includ set modular coordin compon call subset task gener specif mechan involv detect abstract coordin relationship incom task structur ti separ coordin mechan agent local schedul job design compon mechan ad requir reaction environ agent find part individu algorithm famili defin set activ mechan paramet chapter discuss interact mechan decid mechan draw data simul experi multipl agent team work abstract task environ gpgp approach specifi basic area agent coordin commun construct view current problem solv exchang partial result problem make break commit agent result gpgp approach recogn react characterist coordin relationship share von martial work favor relationship commit gpgp famili algorithm base idea research agent heurist local schedul decid action agent base current view problem solv situat commit util function coordin mechan suppli view problem solv local includ result local schedul creat monitor execut schedul attempt maxim group qualiti local action action discuss overview gpgp approach view coordin modul local level process make clear distinct coordin behavior local schedul process occur set coordin mechan post constraint local schedul import task time initi complet concentr creation local schedul avoid sequenti schedul origin pgp algorithm occur multipl plan separ modul coordin local advantag advanc schedul algorithm produc cooper distribut problem solv system respond deadlin advantag local schedul great deal domain schedul knowledg encod approach termin issu gloss pgp work termin handl extern discuss decid mechan mechan draw simpl model gener task structur data simul experi multipl agent team work abstract task chapter famili algorithm situat interact local import lead eventu construct librari reusabl coordin compon chosen respect attribut target applic coordin mechan dramat effect perform ident crowston observ restaur servic fridai chain task structur process fridai restaur essenti ident crowston discuss fridai locat equal size wait time seat period heavi lunch dinner newer locat reduc averag minut hour differ restaur structur coordin mechan enabl relationship tabl buss custom food cook assembl coordin poll consum side relationship host scan free check kitchen tabl food order faster restaur consum enabl relationship notifi comput screen host station show free tabl updat remot clean staff tabl page kitchen order chang coordin mechan dramat improv perform peak time organ section chapter describ detail origin pgp algorithm cover chapter discuss extend section deal gener face agent coordin behavior coordin relationship facilit section introduc gener partial global plan approach section describ assumpt agent architectur assum agent local schedul schedul local action attempt maxim util measur defin task structur assum local schedul agent understand special type call local describ chapter assum agent gpgp coordin modul set coordin mechan describ coordin modul local schedul interact section describ interfac local schedul coordin modul detail partial global plan partial global plan develop distribut control techniqu insur coher network problem solv behavior flexibl approach coordin assum distribut node coordin current situat node repres reason action interact group node affect local activ call partial global plan part network plan achiev global goal node maintain set pgp independ asynchron coordin activ pgp ffl object inform pgp includ eventu goal larger solut import prioriti rate reason pursu ffl repres node includ major plan step node concurr expect result ffl inform node includ specif partial result exchang exchang ffl statu bookkeep inform includ pointer relev inform receiv node inform receiv pgp gener structur repres coordin activ term interact relationship node scan current network model node action plan node identifi node work goal piec larger network goal global combin inform plan build pgp achiev partial global goal form separ plan interleav plan major step predict step place repres concurr node activ improv reorder activ expect predict util examin procedur cheapli find order reorder modifi local plan pursu major plan step coordin fashion build repres interact node examin identifi partial result exchang order node integr complet inform repres partial global plan work ffl avoid redund work node notic interact local plan notic node plan ident intermedi gener interpret region time space occur interest node overlap sensor ffl schedul gener partial result transmit node assist correct time estim time activ infer relat node estim time node complet intermedi goal spatial node provid facilit inform node ffl alloc excess task overload node idl node node plan provid inform determin node underutil node underutil idl particip pgp node estim complet time subgoal goal complet time subgoal ffl assum goal correct compat goal node goal repres process task ascertain vehicl move region time goal error sensor data basi preliminari task analysi gener goal node local plan work base highli rate pgp receiv intermedi goal node part work intermedi goal local plan node node rate local plan higher local ffl termin extern reach correct intern termin criteria partial global plan framework node converg common pgp stabl environ plan chang fail unexpect effect characterist chang commun channel delai limit node local respond cooper potenti effect inconsist pgp pgp framework deal conflict physic resourc origin pgp algorithm order intermedi cost comput vector comput factor global cooper paramet give weight term calcul inform captur symbol task structur pgp commun fix level correspond directli task activ origin pgp algorithm local assign prioriti origin pgp evalu sophist local schedul understand complex constraint delai deadlin pgp hill climb schedul work comput order plan activ earlier factor comput cost plan activ relationship factor origin pgp evalu function term term differ usag term work distribut oper pgp defin number node perform plan activ high score move plan gpgp local schedul equal subtask relationship task structur determin redund pgp defin number node perform goal definit pgp redund pgp defin durat gpgp local schedul obtain measur task structur pgp defin goal durat provid predict inform goal durat predict measur minimum activ distanc number goal definit gpgp gener concept facilit relationship similar relationship consid relationship pgp defin minimum activ distanc number goal goal execut effect measur node jump time construct extend exist partial solut prefer gpgp local schedul hierarch construct task structur gpgp doesnt requir absolut stabil local schedul long commit made agent met defin goal occur goal initi local node plan measur intend origin local node plan origin late order tend stai late pgp order independ measur goal depend initi local node posit goal plan goal initi order higher independ measur pgp algorithm swap procedur creat order higher independ measur made goal harder swap gpgp local schedul receiv local order local order prefer local schedul separ relationship directli defin goal deriv redund goal deriv redund inform goal measur minimum activ distanc goal goal effect plan work redund work gpgp coordin mechan detect redund coordin relationship measur issu extend pgp mechan heterogen agent pgp mechan extend handl agent local problem solv ffl agent system human local criteria adequ fulli model ffl agent system local criteria design problem pilot problem pa scenario section classic heterogen agent share global goal differ local pgp mechan assum share local global evalu function inform arriv conflict agent agent lack data data agent exchang negoti criteria assumpt simplifi pgp homogen agent assumpt local criteria pgp mechan assum agent pursu goal time goal agent excess capac fill task goal plan simultan achiev multipl goal support modular pgp mechan separ local agent increment planner close permit heterogen local criteria problem reorder node plan agent pgp plan evalu function develop global schedul term avoid upset order agent plan measur distanc current order origin node plan measur distanc current order regular time domain portion order fix suggest mark schedul commit soft local schedul rule imposs order avoid replan target node advoc separ coordin mechan local schedul node work complet schedul pass schedul constraint dynam agent mechan extend handl agent great deal latitud method solv method effect characterist complet time certainti agent human system system agent approxim process anytim algorithm techniqu boddi pa scenario section mission planner solv dilemma algorithm respond plan request fast inaccur algorithm suffic give pilot idea corridor complex algorithm bulk comput resourc plan tactic maneuv method exist accomplish goal set criteria exist determin consid accept pgp mechan exchang goal plan accomplish singl level detail node plan exchang goal agent produc track characterist plan consist order time agent work expect map start end time respect node problem solv time extens made commun task singl level detail inappropri potenti wast complex detect interact task simpl method exist effect task characterist make exist pgp node plan structur chang rapidli problem solv method chang dynam agent react problem node plan structur modifi hold rang current estim agent reason negoti predict versu reliabl issu node plan structur expand plan expect predict face chang environ agent make commit task add explicit slack agent time integr part local share dynam agent modifi task durat trade task task deadlin garvei pa scenario section mission planner dilemma fact constraint deadlin pilot tactic mission planner reason prefer alloc comput resourc pgp mechan estim time task goal complet order spot idl process handl deadlin expect anchor complet plan activ map experi conduct local increment planner abil plan meet deadlin singl agent decker extend architectur agent goal hard add constraint construct plan activ map addit hard deadlin domain constraint natur interact node local problem solv mechan pgp mechan local order remain local prefer due hard discuss section exist algorithm schedul longer reason advoc separ coordin local schedul initi experi local show larg part distribut perform emerg sophist local schedul real time situat plan current situat control agent action includ local global sequenc action plan detail execut agent respond agent uncertain outcom action chang world state plan futur intellig agent make period occur predict build opportunist plan framework agent paint corner pure reactiv plan exhaust plan uncertain futur detail reflect plan garvei gener partial global plan mechan observ singl organ coordin algorithm situat common studi human organiz theori cooper distribut problem solv decker kei featur task environ demonstr thread work lead coordin mechan includ relat structur environ kind pattern interrelationship depend occur uncertainti priori structur episod outcom agent presenc uncertainti high varianc task make import gener approach coordin appropri overhead activ term commun vari depend characterist applic environ made import ampl evid singl coordin algorithm describ famili coordin algorithm famili algorithm briefli discuss famili organ abstract mechan describ independ set total combin combin show significantli perform randomli gener discuss experi specif applic mechan ad expand famili enlarg make mechan mechan paramet set map dynam measur agent load amount pressur mechan individu class task specif coordin environ cross product dynam cue larg easili space potenti coordin amen adapt coordin mechan time standard machin learn techniqu section dissert mechan reader mind read coordin techniqu explicitli state situat carefulli describ mechan interact applic made analyt present section uncertainti uncertainti environ mean uncertainti exist extent task uncertainti local agent complex coordin behavior partial cooper commun fact task structur agent chapter agent priori inform structur inform subset structur start problem singl agent work construct view entir problem face group lack inform form local schedul make uncertainti dispar object task structur subject task structur agent true durat method execut varianc high good estim chapter environ characterist larg varianc object characterist subject estim focu sourc structur agent partial subject view current episod task interrelationship task interrelationship includ relationship task perform criteria evalu control structur agent make mechan kei set mechan environ min task qualiti function min subtask relationship enabl relationship method facilit relationship agent min max max min max group min max agent initi subject view agent initi subject view min max max min max figur agent bs subject view typic object task group perform task simul effect task interrelationship object subtask relationship relationship task system perform subject map initi belief agent control effect enabl facilit execut task affect durat qualiti task relationship extend part task structur subject believ call coordin relationship basic idea gener partial global plan detect respond appropri coordin relationship kei point coordin relationship abstractli defin catalogu coordin strategi link potenti featur task environ figur show object task group agent subject view task group notat formal defin chapter gener partial global conceptu overview section provid quick overview gpgp approach figur show simpl agent part architectur belief local schedul back chapter local schedul inform belief schedul method execut action agent attempt maxim perform add coordin modul charg commun inform gather make break commit complet task task structur coordin modul consist coordin notic featur task structur belief respond commun inform gather commit coordin mechan rest share coordin modul substrat track local commit commit receiv multipl schedul local schedul return multipl schedul agent coordin modul local schedul local schedul coordin modul agent belief belief max min max max min max max min max max min max max min max max min max finish qualiti violat altern finish qualiti violat commit deadlin qualiti commit deadlin qualiti finish qualiti violat schedul constraint schedul altern commit deadlin qualiti commit deadlin qualiti commit object task group subject task group object task method environ subject agent task min local task qualiti function min subtask relationship enabl relationship local method execut facilit relationship durat qualiti finish qualiti violat idl schedul altern schedul constraint figur overview gener partial global plan short intend give reader feel approach detail cover bodi chapter figur agent execut initi inform gather initi view task structur agent belief shade task relationship touch shade coordin mechan updat perform inform gather action determin task relat task agent coordin task exchang result belief shown figur shade mechan react task structur mechan handl soft notic task agent facilit task agent order agent schedul advantag agent ys mechan make local intermedi deadlin commit complet task time minimum qualiti infer intend execut method local inform part commit made made local agent local schedul made commun agent involv note deadlin version commit account commun delai time agent mechan handl simpl notic agent task agent eventu commit task process bit complic explain commun commit agent case agent local schedul inform task structur belief local construct schedul local schedul return multipl schedul reason explain schedul evalu dimens perform criteria total final qualiti termin local commit violat commit local schedul suggest altern relax qualiti intermedi deadlin coordin modul schedul handl retract violat commit rest chapter describ local coordin coordin mechan detail agent architectur mention time framework make assumpt architectur agent loci belief agent control mechan decid action agent current belief class method inform gather method execut action qualiti accru task group task commun action send result method execut turn trigger effect task inform inform gather action add newli arriv task agent set belief write agent subject believ time shorten write agent belief agent time clear context agent subject belief current episod includ agent belief task group agent belief task group includ belief task task group relationship task gpgp famili coordin algorithm make stronger assumpt agent architectur briefli architectur figur assum presenc local schedul mechan decid method execut action place assum agent lie told agent agent time commun delai ffi ffi earliest time commun arriv agent perform commun inform gather action read messag agent commun subject transmit inform inconsist object view phenomena gpgp famili approach requir code detect predict presenc coordin relationship local task structur dissert refer code inform gather action describ action section local schedul gpgp agent local schedul input subject believ task structur produc schedul method execut inform subject structur potenti potenti relationship order execut method attempt maxim util measur task group chapter garvei local util function sum task group qualiti local schedul attempt maxim util function denot qualiti time defin subject task local schedul accept set commit coordin compon commit extra constraint schedul produc local schedul method execut agent method execut agent method agent coordin mechan commit agent method local social direct agent work shoham castelfranchi commun commit agent bs coordin mechan record agent descript commit implement dissert type commit qualiti satisfi time type dl commit time dl satisfi time dl schedul produc local schedul consist set method start hm hm ig schedul includ idl local schedul produc schedul invoc situat commit met schedul repres wai partial satisfi set commit section function return set commit believ violat schedul violat deadlin commit dl function return altern commit dl dl min nil violat commit altern lower minimum altern final piec inform local schedul set commit made agent inform local schedul coordin action agent local schedul properti method execut agent method enabl method agent agent bb ba bb schedul produc agent hm ti function est return estim util end episod agent schedul commit defin local schedul function return set schedul note qualiti accru task group deadlin earliest start time prove fs sm inform interfac local schedul coordin compon found section extrem gener definit local minim gpgp coordin modul stronger definit predict perform optim local schedul find schedul maximum util su schedul maximum util violat commit heurist local schedul produc set schedul schedul highest util su necessarili su coordin mechan role coordin mechan provid constraint local schedul modifi portion subject task structur episod make commit local schedul construct object schedul modul fulfil role commun privat portion task structur commun result fulfil make commit respond coordin relationship portion task structur control agent portion control multipl agent mechan describ dissert form basic set similar function origin partial global plan algorithm explain mechan exchang privat view task mechan commun mechan handl redund mechan handl hard soft coordin relationship mechan updat util agent discuss balanc load agent mechan independ combin inconsist constraint local schedul return violat constraint dealt discuss section local schedul ration constraint inconsist search substrat mechan specif coordin mechan rest common substrat handl inform gather action task group arriv receiv invok local schedul schedul execut deal violat decid termin inform gather start problem agent idl readi commun expect agent commun expect event arriv task set commit minim gener inform gather polici task structur control agent agent execut method minim polici examin element appoint time local schedul chang recept inform longer inform gather action skip termin task group occur agent agent idl task expect outstand commit schedul complic set schedul return local schedul schedul highest util su commit schedul sc schedul chosen examin sum util commit assign estim util est task group part util updat time agent depend schedul largest posit chang util abandon commit result higher util coordin substrat local schedul util estim est directli entir schedul base local coordin mechan receiv inform place higher util commit local method schedul set gpgp solut time agent make commit task result schedul initi acquir estim util task group est ba commun commit agent part bb agent commit improv est bb coordin mechan detect discrep commun util back agent agent consid discard coordin substrat recogn util commit greater local util schedul negoti chosen commit negoti index difficulti reschedul commit broken index set individu coordin mechan hard coordin relationship enabl trigger commit low negoti schedul shorter chosen random schedul commit replac altern commit made agent inform chang commit potenti cascad schedul multipl gener mention previou paragraph import commit broken resili local schedul solv problem multipl wai damp agent time cogniz reason interleav execut schedul agent spend dai argu schedul detail meet observ phenomenon plan analyz futur work clear polici system agent perform clear situat occur perform hit futur work examin cost benefit reason includ mechan examin dissert local schedul mechan updat viewpoint rememb agent subject view current episod agent commun privat portion subject task structur develop view current episod commun privat structur attempt develop global subject view inform commun import area studi dai ten year work carver work call distribut oper system gpgp mechan commun privat inform global intermedi approach partial agent commun agent privat structur relat coordin relationship structur agent process detect coordin relationship privat share part task structur gener domain experi present dissert model process inform gather fix amount agent time action chosen task group arriv add inform agent privat task updat occur level detail task select commun similar hierarch commun discuss von martial montgomeri set privat believ task method agent believ arriv time fx set agent arriv time action return set privat coordin relationship fr privat mutual believ task action return task relationship exist unknown task physic organ agent detect agent task overlap sensor area fact relat unknown task agent ba decker view coordin mechan commun coordin privat commun agent set agent fa ba figur show local subject belief agent commun due mechan agent initi local view shown figur element agent bs privat set task oe oe facilit relat privat task mutual believ complet local agent relat privat start section mention coordin relationship exist portion task structur control agent portion control multipl agent denot complet set coordin relationship includ element relationship task relationship privat concern local schedul coordin mechan exchang inform expand set coordin relationship cr mechan min task qualiti function min subtask relationship enabl relationship method facilit relationship agent min max max min max object task group min max min max agent view commun min max max min max agent bs view commun figur agent bs local view receiv viewpoint commun mechan previou figur show agent initi state cr consist primari focu coordin mechan creation social commit coordin relationship mechan indirect benefit environ make commit mechan select manner mechan commun result result commun coordin mechan commun result satisfi commit agent minim commun inform final result task group commun result extra result commun broadcast minim commun agent commit made commun result set agent fa mechan handl simpl redund potenti redund effort multipl agent occur place task structur task qualiti accumul function semant absenc subtask subtask complex involv coordin agent avoid redund process address gener redund avoid problem dissert origin commun result commit enabl relationship task agent pgp algorithm domain sensor primari form potenti redund simpl method result deriv data number sensor coordin mechan meant address simpler form potenti redund idea simpl redund coordin mechan agent execut redund agent randomli chosen execut send result interest agent gener organ algorithm discuss decker lesser load commun action gener case agent method redund mechan consid set potenti redund fr cr method current schedul time method potenti redund commit send commit agent method est top figur agent commit method commit agent refrain execut method question commit made simultan arriv commun delai time mechan watch multipl commit redund set bb uniqu agent chosen randomli ident commit commit agent retract commit bottom figur show situat agent retract commit agent follow commun channel assum messag agent redund implement ident random choic made give method uniqu random agent method identifi execut commit initi redund coordin mechan mark highli negoti redund commit negoti remain commit lower medium commit import detect redund method discuss earlier talk direct redund exact method detect read commit min max min max min max max min max agent view commun agent bs view commun durat qualiti commit made commit made min max min max min max max min max agent view reciev bs commit agent bs view receiv commit durat qualiti commit made commit made figur continu previou figur agent commit mechan receiv initi mechan remov agent bs redund commit mechan handl hard coordin relationship hard coordin relationship includ relationship execut order obtain qualiti redund hard coordin relationship cull set cr hard coordin mechan distinguish direct current implement creat commit predecessor enabl relationship ae cr set potenti hard predecessor coordin relationship hard coordin mechan situat current schedul time produc qualiti predecessor commit execut deadlin local est est earli question time earli commit provid usabl local schedul fit gener descript section min est local schedul queri facil commit satisfi agent end relationship advantag abil hard coordin mechan ad commit est local commit invok local schedul produc set schedul highest util schedul su violat local schedul simpli return schedul replac current schedul potenti earlier finish time provid earli complet commit enter local low subset interest agent redund commit made earliest commit made agent commit agent commit highest qualiti remain ti randomli broken method previou section hard coordin mechan proactiv provid inform agent put individu agent extra effort futur coordin mechan ad famili reactiv request agent task behavior analyz separ mechan handl soft coordin relationship soft coordin relationship handl analog hard coordin relationship start high negoti current implement predecessor facilit relationship trigger commit hinder relationship present posit relationship oe oe execut durat factor relat oe maximum qualiti factor relat oe version coordin mechan ignor relationship low relationship oe oe neg durat maximum qualiti coordin mechan design hinder similar neg ad famili proactiv exist hinder mechan work successor schedul commit earliest start time successor figur show agent make commit method turn agent advantag method half time produc time qualiti interfac coordin mechan local schedul work ai problem solv prior dissert found interfac schedul complex bidirect argu interfac usefulli model negoti process previou work interfac schedul applic simpl assum applic pass task schedul schedul react schedul unabl schedul task deadlin provid low qualiti solut complex interfac applic question schedul modul behavior idea implement date work found interfac interfac environ wai solv problem multipl criteria judg potenti solut briefli discuss interfac schedul negoti process schedul discuss part interfac implement effici effect omit part situat multipl agent work problem agent method enabl execut import method agent point agent realiz schedul schedul method associ commit method mean request schedul build schedul execut method agent schedul return schedul complet execut method time agent commit give result method time time commun agent receiv messag pass report back time result time agent maker inform agent invok deadlin commit complet method time time agent schedul return schedul commit complet method time agent commun inform complet method deadlin meet tighter schedul make local qualiti produc violat commit schedul agent commun requir step arriv satisfactori solut commun direct requir layer obviou question separ subsystem reason distinct separ exist schedul includ effici reusabl modular suggest separ function separ modul defin interfac gener difficult current problem solv criteria encapsul evalu function transmit decid evolv comput process schedul transmit potenti inform schedul difficult ineffici reason separ exist subsystem work level abstract role maker constrain search commit schedul part task structur focu schedul inform make effici reason maker constrain search space schedul reason separ schedul schedul gener activ schedul multipl applic undesir reproduc schedul time problem area investig discuss maker interfac exampl environ address hard environ address futur necessarili inconsist scenario multiag scenario discuss section method execut agent ident method achiev qualiti task goal coordin work produc highest qualiti task group attempt maxim global util measur agent part total task case agent entir structur maker simpli schedul optim global criteria kind inform agent commun inform task structur gpgp mechan updat coordin activ avoid redund method execut relationship extend agent exploit avoid gpgp coordin mechan role schedul schedul execut local method criteria provid scenario scenario work task group arriv requir multipl reusabl physic resourc robot consum resourc resourc complet task attempt maxim total util task group maximum payoff maxim criteria mix problem solv role schedul execut control code multipl hardwar consum resourc task repres oper system constantli present execut absolut schedul input schedul solut newli arriv task group ad schedul method execut basic request schedul consist task structur set set runtim indic min max min max max min max deadlin min task qualiti function min subtask relationship enabl relationship method facilit relationship durat qualiti figur complet input specif schedul task structur schedul includ indic aspect structur chang schedul invok write agent believ time schedul agent time access set commit constraint invok schedul satisfi defin type ffl commit qualiti satisfi time commit ffl dl commit time dl satisfi time dl shorthand ffl est start time commit begin work time est satisfi time est iff est import local commit soft constraint solut schedul schedul method execut deal hard constraint deadlin earliest start time hard commit provid requir commit satisfi valid schedul soft commit handl coordin multipl agent solv task soft coordin relationship facilit shown spring commit violat import task arriv invok schedul queri suppli symbol valu deadlin commit earliest start time schedul attempt satisfi commit earli late schedul provid abil soft situat achiev result repeat execut schedul queri hard commit chang task effici add abil interpret soft constraint schedul plai guess game invok schedul multipl time set commit commit schedul assum satisfi form commit mention schedul expect receiv result time schedul concern reliabl determin sophist schedul concern reliabl schedul assum inform reliabl commit commun work agent compon achiev coordin behavior complex domain commit creat run time deriv law agent construct satisfi import compon agent organiz role set commit forc agent adher effect problem trigger effect deadlin impli earliest start time end relationship hard relationship enabl impli hard earliest start soft relationship expand search space affect task start earliest start time problem commit import domain hardwar control oper system fact gener standard earliest start time nonzero amount work long qualiti threshold standard earliest start time model robot arm run separ hardwar separ special execut control rt schedul function robot hardwar make commit execut time physic activ directli control schedul commit give partial flesh task structur direct schedul potenti make effici element max node provid initi lower bound min element provid upper bound type prune search max node prune sibl local min node local prune node task food parti consist subtask prepar food food agent commit prepar food prune entir substructur schedul food parti consist subtask ingredi food commit ingredi prune subtask schedul food ingredi potenti commit direct search schedul commit question assum qualiti achiev part task advantag part task structur situat cost inform gather expand task structur potenti larg situat schedul successfulli produc schedul satisfi part task structur focu schedul attent part begin execut schedul work complet situat commit reduc search schedul prune commit portion task structur mechan control runtim schedul hard deadlin schedul satisf schedul schedul complet schedul tradeoff function ad spend time find schedul versu execut element current import long runtim schedul small compar grain size applic task scenario crucial predict perform schedul schedul output output schedul invoc includ valid list satisfi list violat commit indic task schedul indic return schedul respect fix set criteria set valid schedul return satisfactori job satisfi problem schedul individu schedul consist set method start hm hm ig output form initi negoti process remain item provid explan item return violat commit schedul schedul deriv mathemat schedul set commit practic schedul inform collect schedul recomput set input commit satisfi schedul return ae schedul support symbol local commit deadlin commit earliest start suppli indic commit expect satisfi schedul min st est set input commit violat schedul return violat modif commit schedul satisfi return earliest start time deadlin commit involv time minimum qualiti commit involv recommend retract reduc minimum qualiti violat deadlin commit dl function return altern commit dl dl min nil knowledg commit satisfi violat absolut domain indic schedul return object criteria object function measur includ total qualiti schedul task number task group complet amount slack time schedul easi schedul task time task longer expect number weight commit satisfi schedul criteria section complex real problem invari involv multipl evalu criteria balanc view balanc role schedul attempt maxim current return multipl schedul satisfi current abil evalu schedul respect criteria implement abil attempt optim criteria schedul agent make commit agent time agent make abandon schedul find schedul bypass execut schedul make evalu schedul local criteria agent result produc high qualiti solut produc bs notifi weight sum task group import complex function desir updat util commit posit decid abandon local commit schedul process involv agent exchang knowledg current schedul chang criteria occur time pressur constant normal schedul process task attempt produc maxim qualiti feedback schedul unabl successfulli schedul task switch mode schedul direct produc minimum qualiti task behavior direct feedback schedul work shown behavior schedul effici minim list task task structur schedul provid qualiti qualiti task group achiev qualiti task result schedul local method gener qualiti task task structur distribut agent task method agent inform gather determin method task result schedul schedul execut method deadlin constraint final total commit time commit time final total final total commit altern figur output schedul problem summari output schedul problem shown figur schedul return bottom schedul gener minimum durat gener produc low qualiti violat deadlin commit qualiti gener commit task middl schedul gener highest qualiti gener produc highest qualiti fastest satisfi deadlin commit time top schedul gener minimum relianc gener produc highest qualiti complet reli satisfi deadlin commit time schedul chosen depend current evalu criteria fastest accept result larg workload bottom schedul chosen result minimum time middl schedul chosen result reli agent desir work agent concern agent top schedul chosen interfac coordin mechan local discuss return main reason bidirect interfac separ schedul effici reason develop complex bidirect reusabl argument clear schedul compon attempt find optim method execut time arbitrari task structur evalu criteria distribut problem solv compon import relat question extra capabl requir interfac provid cheapli reusabl schedul examin input find input task structur specif problem handl constraint addit burden standalon schedul amount prefer deadlin earliest start time part standard schedul specif mechan control runtim schedul schedul task deadlin potenti uniqu featur input commit commit face make effici discuss earlier examin reusabl schedul output characterist effici find schedul commit satisfi part schedul list violat gener altern gener altern violat commit execut method gener schedul return actual execut suggest retract commit gener altern task commit depend intern structur schedul inform effici mention output characterist assign schedul effici comput comput maker schedul commit thing true schedul evalu multipl experi schedul effici calcul evalu maker schedul comput evalu part search process uniqu potenti output characterist product task list schedul desir qualiti produc behavior enabl sophist contract behavior part maker behalf part standard definit schedul problem undoubtedli extra overhead plan analyz behavior effici provid circumst futur work reason complex bidirect effici close ti effici primarili abil search attempt specif criteria effect defin carefulli delimit schedul limit search construct effici schedul multipl schedul optim search criteria violat earliest finish lead directli modular gener difficult encapsul problem solv criteria singl evalu decid correct criteria evolv comput process handl separ summari chapter discuss develop gener partial global plan famili coordin mechan gpgp algorithm famili specifi basic area agent coordin commun construct view current problem solv situat mechan updat exchang partial result problem solv mechan commun make break commit agent result handl simpl redund hard soft agent heurist local schedul decid agent base current view problem solv situat commit util function coordin mechan suppli view problem solv local includ result local schedul creat monitor execut schedul attempt maxim group qualiti local action action gpgp attempt extend pgp wai permit agent heterogen schedul autonomi agent consid cooper share global util gpgp permit agent local view schedul work partial global plan origin pgp algorithm agent gener commun complet schedul singl priori fix level gpgp agent commun schedul commit action dynam decid level agent heterogen capabl agent faster task uniqu capabl gpgp famili coordin mechan address problem heterogen system creat share languag commun gpgp cooper distribut problem solv current set mechan vulner ly situat gpgp extend pgp dynam environ problem solv architectur plan singl level detail practic extens includ commun inform vari level detail react appropri situat accomplish high level task gpgp extens problem addit hard deadlin flexibl tempor commit algorithm underli local schedul garvei strong comput spring schedul work futur research discuss section gpgp assum agent consist view problem solv algorithm approach view coordin mechan modul local process make clear distinct coordin behavior local past present work corkil work distinct local control dynam natur separ gpgp advantag recent advanc plan schedul comput gpgp mechan reaction presenc quantit featur coordin relationship coordin gener task environ definit relationship quantit properti difficult effect coordin algorithm defin term detect exist properti produc schedul gener written specif applic modular research applic design share idea easili gpgp famili mechan independ set total combin specif famili member chapter algorithm algorithm mechan updat view commun commit finish task group combin show significantli perform randomli gener discuss specif applic mechan ad expand famili enlarg make mechan mechan paramet set map dynam measur agent load amount pressur mechan individu class task specif coordin environ cross product dynam cue larg easili space potenti coordin amen adapt coordin mechan time standard machin learn techniqu reason approach extens fall head futur work section dissert mechan chapter evalu show perform set experi deal perform gpgp mechan real implement common lisp multipl implement submodul real implement garvei schedul experi gener partial global plan doubt show understand professor watch relat figur scientif realiz figur extract instrument displai imag layer end result long process laboratori start observ longer text read ey ey imag imag made hand element make final graph modifi produc visual outcom gut gut pig surgic slice open paper world articl blood slightli extract creatur admir rhetor abil professor author realiz abil requir order write convinc paper pig text convinc part ti glass chamber hook text add convict professor art convinc reader extend paper prepar calibr tune bruno scienc action experi involv complet implement gpgp separ develop local schedul garvei show decid mechan famili member perform rel central space coordin algorithm mechan defin analyz perform famili algorithm simul conjunct heurist local schedul randomli gener abstract task environ agent attempt maxim total util quantiti call execut sequenc interrel agent initi complet view problem solv execut method agent posit neg affect execut method agent show exampl effect environ perform gpgp famili show environ famili member environ return demonstr inform larg amount varianc episod environ final section discuss experi conduct implement ffl decid addit mechan ffl perform system mechan compar system broadcast compar system central ffl perform space gpgp delin exist state time mechan collect form gpgp famili coordin algorithm evalu mechan term cost benefit cooper problem solv analyt analysi place respect gener task environ correspond domain produc gener weaker deriv singl fix domain perform varianc problem episod greater perform varianc algorithm singl episod determin broad characterist algorithm famili reduc search set mechan paramet domain machin learn discuss statist techniqu deal larg varianc occur problem section chapter describ set experi simpl simul task structur effect facilit relationship agent effect power relationship likelihood exist rest chapter devot explor perform gpgp famili coordin mechan previou chapter initi effect facilit power likelihood simul chapter section driven agent characterist discuss chapter task repres abstract comput structur simpl hierarchi experi full framework discuss rest begin section experi abstract task group group task time subtask arriv task arriv uniformli randomli agent facilit relationship gener task base probabl linearli differ task arriv reader worri experi report show environ probabl facilit relationship drop exponenti system characterist similar linear environ number detect relationship task base probabl interrel task group cluster approxim distribut histogram figur facilit facilit cluster size indic web commit potenti exist total number wai distribut task agent number wai distribut task agent agent task stirl number kind expect number total agent involv cluster size number cluster figur histogram size task cluster pr fac agent local schedul base concept approxim garvei schedul method task base amount time task task agenda schedul chang method execut task monitor experi work chang method lost schedul ration deadlin modifi ration delai constraint start task result task class task method vari qualiti task execut monitor schedul time actual durat qualiti valu method task randomli gener normal distribut mean equal estim valu varianc combin share global util function agent judg total qualiti individu task solut schedul algorithm agent ensur normal circumst requir util task miss deadlin properti exist low qualiti approxim observ experi follow made averag statist gener run simul world time unit number task gener depend arriv vari vari priori likelihood fac facilit relationship task class effect time facilit task power cr measur percent reduct time run consist set agent receiv set task origin schedul algorithm schedul algorithm modifi ration respect delai constraint detect commun coordin relationship agent receiv set task counterpart coordin agent calcul delai figur commit coordin agent simpli break fail commit primari perform metric experi present percentag qualiti pair agent receiv task set pair averag agent pair metric figur percent qualiti variabl manipul time arriv compar rel qualiti base averag util requir set task averag requir util greater mean imposs complet task approxim simul environ make actual environ system ffl interpret environ task rest chapter discuss complex simul work ffl simul assum approxim result local effect reduc qualiti group relat task ffl simul model relationship fact task doesnt fact facilit relationship doesnt exist measur schedul algorithm factor account addit extra characterist task structur requir addit coordin relationship part chapter section discuss gpgp full task structur framework calcul delai comput long delai task facilit task figur ffl util function result qualiti function qualiti miss ffl local schedul assur minim qualiti task result ffl facilit affect durat task directli agent attempt produc highest qualiti solut task facilit estim latest start time task order produc highest qualiti estim finish time task task latest start time estim finish delai minimum latest start time task figur time calcul commun time account local schedul ration respect qualiti estim latest start time modifi estim effect facilit relationship maxim assur minim qualiti result task task deadlin task estim finish time task latest start time minimum latest start time extra time delai figur calcul delai simpl model util detect facilit agent test facilit agent potenti test presenc facilit relationship local task task agent cost task includ process cost test relationship task cost commun inform test result uncertain detect note test domain facilit relationship gener relationship benefit includ util qualiti facilit fac benefit accru fulli schedul constraint impli detect relationship facilit task accomplish cost incur relationship includ direct cost commun ad schedul updat model indirect cost delai task fac priori likelihood pr fac facilit relationship build express form expect util pr fac fac fac detect express detect constant fac fac depend includ task current system experi section detect benefici separ detect relationship commun detect commun facilit suit experi involv effect quantit properti likelihood fac durat power hypothesi simpl expect util model section instanti rule agent agent react facilit relationship altern simpl linear relationship fact secondari characterist cluster size facilit relationship length chain facilit schedul error benefit facilit relationship fac respect power relationship test gather raw data simul agent react facilit agent simul durat power likelihood data point figur averag comput percent qualiti experi pair agent experi simul frequenc task arriv averag requir util high task complet maximum qualiti high satur direct commun cost detect cost fix examin figur find power exploit facilit relationship cost indirect cost worth indirect cost primarili agent delai task rearrang schedul unnecessarili section postul form expect util react cr pr fac fac fac detect instanti model detect make benefit proport durat power fac cost constant arriv rate held fac appli linear regress achiev fit explain observ varianc paramet ff chanc benefit accru serendipit detect relationship task structur advantag reduc coordin cost power averag percentag qualiti likelihood figur effect power facilit relationship rel qualiti likelihood formula rule agent decid worthwhil react coordin relationship mechan environ figur depict surfac defin curv figur cubic interpol succinctli show posit effect durat power grow likelihood note flatten high end power likelihood ceil effect region task accomplish maximum qualiti facilit perform suit experi show averag rel qualiti result commun agent versu agent grow requir util system harder task set import detect facilit cr low power left side figur show durat power versu rel qualiti requir util side figur show effect requir util rel qualiti durat data point util left clariti power likelihood power likelihood figur effect power facilit relationship rel qualiti likelihood power priori likelihood presenc cr fix figur expect benefit cost chang requir util question data experi disprov qualiti grow linearli requir util power averag percentag qualiti power requir system util averag qualiti figur effect power requir util rel qualiti figur show import miss deadlin shown similar high load requir agent set reach asymptot qualiti perform maximum qualiti figur unbound number miss deadlin figur depict absolut qualiti singl agent system approxim run major util absolut qualiti grow quickli number task task maximum schedul begin trade low fast approxim maximum slow method avoid miss task schedul fastest method asymptot qualiti miss deadlin grow bound absolut qualiti requir system util figur effect system load absolut qualiti agent system effect commun react facilit cr move curv upward indirect cost delai task due exploit facilit heavi averag rel qualiti remain commun agent continu execut task minim qualiti method indirect cost show miss deadlin schedul satur util figur show rel perform coordin agent grew figur absolut perform line repres task complet maximum imposs ideal achiev requir util greater achiev qualiti max qualiti absolut qualiti requir system util figur effect system load absolut qualiti delai ran final suit experi valid effect delai time perform assum task facilit task shown figur amount delai task bound figur task estim finish time bound figur minimum latest start time task start finish calcul includ predict effect receiv maximum qualiti result task result task reduc amount time requir task task latest start time figur delai minimum latest start time comput result figur show choic highest expect util agent pair environ power oe likelihood pr fac time arriv achiev averag percentag qualiti shown tabl task deadlin task estim finish time task latest start time extra time delai task latest start time facilit result figur wai calcul delai tabl averag percent qualiti commit delai valu shortest delai normal delai longest delai agent commit finish task soft task schedul finish soft deadlin time monitor switch lower qualiti method hard deadlin threaten commit hard deadlin order advantag facilit relationship complex agent weigh cost potenti local loss qualiti potenti gain qualiti reduc remot node shorten delai hurt qualiti facilit task finish time hard facilit task begin result lengthen delai hurt qualiti task complet requir qualiti current schedul respect minimum qualiti delai task suffer delai time similar slack time investig lesser predict result indic import design made agent local long delai execut facilit method explicit commit facilit agent gpgp mechan coordin soft predecessor solv problem commun explicit commit move initi limit experi experi full gpgp implement gpgp issu model abstract task rest ten tabl list valu experi section discuss detail section figur show small task group gener paramet tabl similar tabl paramet gener random episod paramet valu valu branch factor depth durat redund method max max number task group task distribut hard cr distribut soft cr distribut chanc overlap facilit strength primari sourc overhead coordin mechan includ action execut inform call local algorithm overhead mechan tabl summar total amount overhead sourc coordin mechan set coordin substrat repres length process gener densiti measur coordin relationship amount deriv paramet tabl measur interact presenc coordin mechan quantiti number method task depend view number coordin relationship subset coordin predecessor coordin predecessor coordin depend number task method number commit depend mechan make commit gener perform issu question perform fulli configur system compar optim perform optim parallel schedul compar singl agent optim schedul heurist parallel schedul optim schedul start point examin gener perform complex mechan complex mechan member gpgp famili comparison tabl overhead individu mechan paramet set mechan set commun inform gather schedul overhead substrat comm min tg redund hard soft comparison central schedul refer implement upper perform measur total final qualiti achiev amount work number deadlin termin time central schedul refer system solut gener coordin cooper group ffl central schedul agent singl point failur entir system fail decentr gpgp ffl central schedul agent requir global view view mention earlier easi achiev account cost build global view refer implement upper bound dynam episod task structur requir ffl central refer schedul optim schedul start point problem schedul action fairli simpl task structur optim schedul perform grow exponenti number method schedul central refer schedul global view schedul action size central problem grow faster size schedul problem gpgp agent partial view heurist schedul conduct pair algorithm refer mechan partial view commun commit result complet task group refer mechan view broadcast commun result refer central refer schedul heurist parallel optim singl agent schedul complet global view experi base paramet facilit experi import thing note class ffl size episod artifici small central refer schedul find optim schedul reason amount run time ffl experi low enabl relationship low number min qualiti function penal simpl demonstr section high number enabl constraint tend hurt agent mechan handl enabl low overlap exchang appli simpl rule exist enabl method ffl deadlin pressur low make simpl algorithm perform central parallel schedul outperform gpgp agent time distribut total final qualiti criterion agent produc qualiti central parallel schedul averag result understood proper central schedul process time distribut schedul scale larger number method task group central schedul start global view entir episod tabl show result measur criteria summar comparison total final qualiti number deadlin simpli refer episod algorithm question greater total final qualiti miss fewer respect method execut time measur system termin refer fact algorithm produc higher qualiti miss fewer deadlin algorithm algorithm lower total method execut time termin sooner perform episod gpgp agent produc averag time final qualiti agent coordin agent execut fewer method abil avoid redund redund execut method prove hinder element agent act sever time pressur tabl summar result advantag coordin add mechan practic question simpli addit mechan benefit perform system agent give respect soft coordin make commit facilit relationship ran randomli gener episod paramet shown tabl agent soft coordin mechan varianc randomli gener episod advantag commun measur fairli central parallel schedul instantan commun agent instantan access result termin time unit consid algorithm fix startup cost averag task durat time unit tabl perform central parallel schedul balanc gpgp coordin decentr schedul parallel balanc total final qualiti method execut time deadlin miss termin time tabl perform simpl gpgp coordin balanc gpgp coordin simpl balanc total final qualiti method execut time deadlin miss termin time pair natur data run wilcoxon test test easi comput make primarili variabl compar block pair block calcul differ total final qualiti achiev group agent exclud block leav block replac differ rank absolut replac sign rank final sum posit neg rank separ standard score calcul small mean consist larg occur treatment consist outperform null hypothesi system soft coordin mechan altern system soft coordin mechan term total final result highli reject null hypothesi mechan effect famili member environ section show famili member environ concentr distinct famili agent cr modul commun commit complet task agent cr modul broadcast complet paramet vari screen data collect section percentag task min qualiti accumul function hypothesi modular agent simpl agent task ran experi level vari time overlap task agent run perform term total final coordin style significantli wilcoxon test differ perform widen figur show probabl coordin style simpli plot graphic differ style figur show inform probabl partit outcom determin logist regress hash mark edg box show base partit valu comput data ignor modular agent simpl agent probabl figur plot probabl modular simpl coordin style final probabl task qualiti accumul min probabl partit probabl partit figur probabl partit style return load balanc dynam reorgan question examin effect task structur varianc perform load balanc algorithm work logic analysi negoti reorgan detail chapter static organ divid load case randomli assign redund task agent dynam analyz chapter assign redund task basi expect load agent commun reorgan assign redund task basi actual inform episod hand requir extra mlc reorgan extra inform pai varianc static agent load grow mlc coordin mechan implement gpgp implement chose work alter redund commit handl commit modifi includ current load agent make commit amount work agent current redund commit made agent mechan soft successor relationship load agent redund commit account point ti broken randomli agent lowest load commit load tie broken randomli effect mechan gener gpgp environ agent default schedul minim heurist schedul provid highest total final qualiti agent violat termin schedul heurist paper effect delai load balanc simpl distribut system prefer earlier termin time task method assign agent randomli rare chang termin time recal result chapter rememb mlc coordin environ high varianc task structur present agent experi calcul endogen input variabl run repres amount varianc redund task potenti elig mechan figur show probabl termin quickli mlc load balanc algorithm grow standard deviat total durat redund task agent grow probabl termin load balanc initi std redund task expect probabl actual probabl figur probabl mlc load balanc termin quickli static load fit model actual simul data comput organiz design applic model tool answer question organiz discuss chapter final section replic classic comput organ design studi burton obel gpgp agent burton obel experi section simul explor interact characterist question explor burton differ perform due choic organiz structur technolog equat technolog task linear program task structur clear interv measur probabl task interrelationship defin task structur base probabl coordin relationship task structur base probabl figur continu pure comput task physic resourc repres burton obel explor differ hierarch analyz gpgp famili coordin algorithm structur variabl vari commun view modul contrast situat agent make commit commun result base local inform agent freeli share task structur inform coordin relationship figur show case agent global view figur burton obel profit index perform deriv percentag optim profit achiev schedul arbitrari task structur problem access optim solut compar perform directli number commun amount time spent execut final qualiti termin time simul run combin view polici level task match randomli gener episod combin except coordin relationship overlap ad task structur burton friedman analysi varianc rank test assumpt test block randomli gener independ block match observ rank respect null hypothesi popul block ident gener random episod singl task episod replic combin block team consist paramet gener task structur summar tabl typic randomli gener structur shown figur figur show differ local view agent creat partial view test major technolog manag scienc physic method resourc convert product tabl paramet gener random episod paramet branch factor depth durat redund method max number task group task distribut decomposit paramet hard cr distribut soft cr distribut chanc overlap min task qualiti function min subtask relationship enabl relationship method facilit relationship agent min max max max max max max min max max max max max max figur randomli gener object task gener paramet previou tabl hypothesi differ perform agent partial view commun method execut perform reject null hypothesi level reject null hypothesi differ final qualiti termin time team comput agent exchang inform local view consist exchang messag work time unit due avoid hypothesi differ perform due level technolog commun method execut perform reject null hypothesi level reject null hypothesi differ final qualiti termin time team comput polici exchang local inform commun messag work time face comput task structur burton test interact effect view polici level technolog calcul differ perform level test view polici test base result section potenti comput organ scope dissert min max max max max max partial agent view agent min max max figur local view agent team share privat inform creat partial view explor famili perform space perform space famili coordin algorithm perform measur abstract mechan independ set total coordin algorithm cluster method deal larg algorithm space prune search combin mechan appli standard statist cluster techniqu develop smaller set significantli algorithm result combin behavior start point search algorithm famili member environ balanc mute myopic simpl tough balanc mute myopic simpl tough commun action method execut action balanc mute myopic simpl tough balanc mute myopic simpl tough total final qualiti deadlin figur standard perform coordin style analysi gener random episod randomli chosen ran episod collect perform total number method number commun termin time data standard perform measur environ measur repres number standard deviat environ summari statist measur group agent boil case summari case summari correspond averag standard perform perform measur hierarch cluster algorithm join linkag produc gener prototyp agent class chose repres algorithm commit broadcast result commit mechan view mechan agent make soft commit commun whatsoev figur show valu typic perform measur type perform measur standard shown mean percent quantil agent perform significantli tukei kramer method execut total final qualiti deadlin miss analyz effect characterist agent perform figur show effect priori amount overlap number method execut action agent type note balanc tough agent significantli work lot overlap perform tough balanc agent similar tabl half experi present power linear cluster produc similar result hierarch produc perform measur fact agent high neg averag standard execut method averag produc final qualiti termin slightli quicker averag commun execut fewer method edg return qualiti averag termin time redund work idea kei featur gpgp algorithm complet output agent type list tabl agent type summar alphabet genotyp letter mechan letter mechan letter mechan fourth letter state mechan final letter state mechan commit commit task group note cluster group put cluster chose distanc calcul farthest point cluster distanc measur pearson gave similar result algorithm make commit commun send commun agent mechan set omit method execut action overlap balanc tough myopic mute simpl figur effect overlap task environ standard method execut perform coordin style spline fit separ interest mechan exchang basic uninterest exchang view fool work wait forev result commit result commun commit summari chapter experi gpgp algorithm chapter differ chapter focu examin perform comput abstract mathemat analysi problem comput program verif chapter simpl experi show effect facilit power likelihood rest chapter gener partial global plan chapter show decid addit gpgp mechan show gener perform gpgp famili algorithm compar central parallel refer gpgp mechan produc qualiti central refer schedul implement random environ perform reason feel made develop local schedul algorithm coordin mechan chapter demonstr featur task environ probabl task qualiti accumul gpgp famili member prefer chapter discuss sixth load balanc mechan tabl complet linear cluster output agent cluster perform paramet standard block cluster member statist case distanc variabl minimum maximum simpl na comm rna na sa sa myopic cluster member statist case distanc variabl minimum maximum st sc term cluster member statist case distanc variabl minimum maximum nt tough st sc tabl complet linear cluster output agent continu perform paramet standard block cluster member statist case distanc variabl minimum maximum rsa rst balanc cluster member statist case distanc variabl minimum maximum nt mute nc mea nc commun show varianc durat agent overlap task high section back discuss end chapter commun transmiss local load varianc initi agent high chapter present version burton obel task experi gpgp agent team hierarch organiz structur burton obel show task structur organiz structur state view commun effect gave perform space mechan cluster techniqu cluster method deal larg algorithm space prune search combin mechan method lead wai learn knowledg applic mechan situat reason thing chapter talk chapter includ comparison coordin algorithm section ablat studi mechan effect perform examin method organiz design chapter set experi dealt perform gpgp mechan real implement common lisp multipl implement submodul real implement garvei schedul gpgp basi coordin conjunct librari coordin mechan learn mechan intend develop librari reusabl coordin mechan mechan work successor hard soft relationship negoti mechan behavior mechan agent environ mechan built exist work dai research futur work examin expand mechan machin learn techniqu paramet valu learn mechan set begin work gpgp approach applic rang provid human coordin assist distribut inform gather discuss chapter futur work section final summar previou chapter discuss extrem interest area research dissert lead decentr develop close qualiti organ adapt condit coordin effici economi appar coordin decentr easi concept appli alfr year gener motor coordin process manag interdepend activ dissert problem repres interdepend dissert demonstr framework task structur comput call instanti exist methodolog analysi design framework analyz comput environ sensor predict verifi perform simpl coordin algorithm environ design famili gener coordin mechan soft comput task environ demonstr perform famili mechan singl static algorithm repres task environ dissert repres coordin problem domainindepend abstract detail leav basic coordin choic tempor order action solut problem framework call environ reason simul comput environ uniqu featur ffl quantit task interrelationship hard posit neg relationship repres relationship environ extend task work separ call coordin design analyz coordin mechan demonstr coordin relationship creat coordin mechan chapter gave definit fifteen relationship chapter set relationship extens ffl structur multipl level abstract lowest level abstract call execut method method repres schedul blackboard knowledg sourc chunk code input plan recal instanti task method instanc human activ level patient left task group task explicit comput interrelationship ffl structur viewpoint view gener model problem solv episod statist view task structur view object view instanti task structur present episod view subject view agent object task structur ffl make assumpt defin agent locu subject belief action acquir subject inform current problem solv import studi principl agent construct activ area separ notion agenc model task subscrib agent architectur assum adapt task environ question inher social natur task environ hand concept societi concept individu agent concept uniqu comput approach ffl concept subproblem import ai schedul approach discuss differ algorithm chapter garvei defin concept minimum durat schedul achiev maximum qualiti ffl dissert comput task method thing blackboard knowledg sourc instanti extens repres physic resourc constraint formal simul written portabl clo common lisp object data collect valid framework build detail model complex environ distribut vehicl monitor testb model includ featur repres approxim faulti sensor low qualiti solut sensor configur vehicl track phenomena train ghost track simul simplifi model show characterist model hospit patient post offic airport resourc internet inform pilot associ valid framework parallel diagnosi error local area futur model softwar engin activ analyz distribut sensor network environ major result report detail analysi simplifi environ methodolog analysi instanti methodolog provid model simul compon part dissert return work corkil show singl coordin algorithm uniformli outperform dissert explain predict perform effect ffl number agent ffl physic organ agent rang sensor region ffl averag number vehicl episod ffl agent coordin algorithm ffl rel cost commun comput predict verifi simul chapter deriv verifi express time termin set agent arbitrari simpl environ static physic organ coordin algorithm express predictor combin probabl valu verifi model simul compon analysi explain observ made extra overhead commun balanc perform work repres detail analysi statist analysi distribut ai system sen work distribut meet schedul agent design famili coordin mechan major result report design evalu famili coordin mechan cooper comput task environ call collect result algorithm gener partial global plan famili algorithm gpgp gener extend partial global plan algorithm approach uniqu ffl mechan defin featur current subject task environ mechan remov activ portion episod mechan easili defin initi set mechan examin ad sixth simpl load balanc ffl gpgp work conjunct exist agent architectur local schedul result report achiev soft local schedul develop garvei ffl unlik ti singl domain ffl gpgp agent heterogen pgp respect agent capabl ffl gpgp mechan gener exchang inform pgp inform gpgp mechan exchang level abstract pgp agent gener commun complet schedul fix level abstract gpgp mechan commun schedul commit conveni level abstract fact gpgp coordin mechan commit agent local schedul constraint reason gpgp famili algorithm requir cooper agent underli task structur requir agent simpli develop mechan enforc agent commit contract environ verifi gpgp famili show duplic subsum behavior pgp algorithm gener examin gener perform complex mechan complex mechan member gpgp famili comparison comparison central schedul refer implement upper perform measur total final qualiti achiev amount work number deadlin termin time central schedul refer system solut gener coordin cooper group ffl central schedul agent singl point failur entir system fail decentr gpgp ffl central schedul agent requir global view view mention earlier easi achiev account cost build global view refer implement upper bound dynam episod task structur requir ffl central refer schedul optim schedul start point problem schedul action fairli simpl task structur optim schedul perform grow exponenti number method schedul central refer schedul global view schedul action size central problem grow faster size schedul problem gpgp agent partial view size episod small central refer schedul find optim schedul reason amount run time perform set agent defin gpgp coordin mechan good comparison central refer agent produc averag qualiti central upper bound refer miss deadlin ad demonstr addit mechan improv system perform famili design demonstr rang perform exhibit member gpgp algorithm obtain simpl individu coordin mechan show environ requir famili member load demonstr sixth load balanc defin integr mechan show cost mechan balanc perform improv larg varianc amount work agent default result similar result distribut process commun decentr load balanc citat comput organ recreat set experi burton obel examin effect technic interdepend organiz structur perform gpgp coordin mechan defin organiz task structur defin problem burton obel linear reach burton obel argu futur applic tool comput organ design framework repres coordin problem unlik exist focuss coordin issu problem richer express game theori team theori typic game team theori problem statement concern singl typic object problem solv episod repres outcom sequenc choic repres game theoret boil singl made agent face task structur game theoret problem uncertainti chapter rich inform concept organiz scienc section differ tradit distribut comput task task episod put part dissert analysi simpl distribut sensor network present formal quantit analysi dai sen analysi distribut meet schedul system analysi system answer explain phenomena observ work distribut vehicl monitor testb algorithm perform differ situat work move anecdot data design rule system major contribut extend work partial global plan domain ad time agent requir commun multipl level detail gpgp cooper algorithm assum agent act ration agent make priori knowledg agent util competit game theori approach agent gpgp mechan make ration schedul attempt maxim util subject inform limit work work limit framework repres task structur comput limit address work describ environ gener viewpoint individu episod object viewpoint actual structur subject viewpoint agent dissert concentr object viewpoint deal uncertainti agent subject work aspect gener model dissert construct statist episod valu random variabl set dynam task structur chang dramat time complex model gener gener model set idea task structur chang dramat time import model human organ human organ face extern forc structur environ govern enact law affect busi factor influenc organiz behavior measur organiz perform chang organ discuss section symbol dissert deal unbound organ decid symbol genuin discuss period recur task structur sourc futur work result analysi simpl distribut sensor network chapter limit simplic domain vehicl fairli simpl vehicl move invalid part model vehicl tend stai path underwat inform give priori distribut agent load averag load agent unequ work calcul chapter hold main limit analysi autom final major gener partial global plan famili algorithm limit exist set mechan adopt definit includ attribut symbol altern method low high extern low true chosen stress situat cooper agent antagonist agent advantag commit mechan cheat agent great deal work mechan avoid problem cost commit view contract enforc parti repetit episod bring ration axelrod strategi prison dilemma limit suffic arbitrari environ exist mechan hierarch organ learn design mechan limit discuss section futur work futur work work dissert lead directli direct subject level present subject level great extent exampl work begun describ type subject uncertainti present task environ previou schedul work consid simpl type subject durat actual qualiti method subject level extens includ indic method provid subject inform provid estim durat schedul decid schedul action method execut resourc excit basic mechan handl physic resourc section notat bit ponder improv sugar steel resourc relationship defin singl doubl relationship semant pair relationship begin develop adapt local schedul schedul task structur resourc spring schedul shen dss schedul exampl begin develop coordin mechan handl flexibl resourc usag idea found sycara paper sycara hard hint section gpgp concert true hard oper system part involv interfac schedul spring part involv gpgp method spring task group result larger system hard interest spring mean distanc wrap gpgp system footbal team interact plai hard load balanc demonstr section subject justic amount effort put develop set gpgp load balanc mechan analysi mechan attempt simplifi environ chapter make assumpt properti local schedul respect termin learn start end chapter gpgp famili mechan independ set total combin mechan load balanc mechan ad expand famili enlarg make mechan mechan paramet set map dynam measur agent load amount pressur mechan individu class task specif coordin environ cross product dynam cue larg easili space potenti coordin amen adapt coordin mechan time standard machin learn techniqu reason approach gpgp dai infrastructur gpgp develop portabl set coordin modul link exist applic provid coordin assist applic suppli task structur code stub resolv discov coordin possibl local schedul mechan chosen programm learn mechan societi creat agent environ affect agent environ agent ai work address question gasser ishida work system gasser talk year problem agent societi comput scientist conceiv societi creat visa versa gasser ishida paper present model problem exist creat normal process problem environ simpl set rule clear forward direct task structur rule task environ kind rule format individu individu environ creation organiz assum relat point comput organ design futur work includ analysi tradit hierarch organ form addit concept role accomplish commit accompani simplest agent organiz role set continu commit class task make continu commit agent avoid commun episod futur structur predict reason lead natur learn organiz role open system concept temporarili settl question current set continu algorithm question task environ develop algorithm lead explor concept agent conveni bundl organiz role gasser organ act agent commit role commit coordin paramet effect class relat applic fall popular buzzword busi process comput organ theori relat cod idea produc comput version tradit organ theori huang formal jd thompson organ action action logic book comput organ theori comput book editor pure comput model present crowston talk produc entir book comput version famou organiz complet student experi williamson transact cost econom theori model negoti agent direct consequ agent negoti solv conflict global evalu conflict equal global local agent charact earli partial solut impact style coordin earli partial result show poor data low coordin mechan encourag redund deriv result area share parallel deriv result agent algorithm pilot associ scenario section occur short negoti pilot associ scenario profit negoti techniqu pgp mechan share global plan evalu function extens paramet redund vari problem solv negoti facil develop agent usefulli alter global interest agent develop partial view agent work criteria pgp mechan exchang local extens process agent commun inform believ relev issu hand agent contextu sensor shut system statu project resourc requir tactic situat tactic planner system statu negoti amount time damag sensor situat inform resolv conflict agent agent automat acquir inform agent perform problem solv activ negoti interact sophist local schedul capabl analyz potenti futur schedul gpgp system area mechan incorpor selfish agent commun mechan develop deal possibl ly potenti behavior result game theoret dai commun adapt fairli easili dynam episod interrelationship uncertainti directli gener model explor uncertainti varianc differ object subject model relationship model lead organiz structur case uncertainti gener model show wide varianc perform system agent static organ episod led commun reorgan agent adapt episod hand expand concept environ encompass dynam import sourc uncertainti tower problem agent pile number block tower numer order agent solv problem central tend bottleneck tower bump ishida solv problem divid agent collect block bring group stack tower point task structur low level chang agent track relationship agent block posit rapid chang environ mean agent subject view date divid agent bottleneck resourc control uncertainti face agent stack agent satur agent longer resourc uncertainti longer impact agent process coordin assist mix human comput agent system oper vision lab plan initi network workstat enabl concurr distribut plan analysi group human comput cooper monitor crisi manag manufactur plan problem opportun distribut cooper environ area futur work develop support tool cooper work group human comput base gpgp arpa air campaign plan develop target situat identif mix initi process place carri forc air compon staff planner make focu enemi creat task intellig staff member comput staff uncov inform impact back main plan task problem pattern interrel task structur partial share multipl agent mix initi task militari commerci environ target hospit manufactur coordin larg softwar develop interrelationship provid potenti problem avoid forget requir opportun advantag task agent favor person comput agent involv distribut cooper work set initi unrel task target collect intellig dispar assist user task select develop user coordin assist agent track workstat user current agenda task present schedul task prefer agenda develop distribut coordin process multipl coordin mechan trigger coordin relationship task structur agent involv similar agent coordin modul develop pure comput agent acm provid agenda manag servic coordin comput agent context user prefer set tool develop system support command control plan plan involv peopl multipl workstat comput agent assist tool manag organ workload type agent task depend task time inform differenti task lost critic situat ad hoc coordin mechan inform simpli task assign task coordin relationship commun user comput agent request due date potenti task assign time estim load request commit complet task support negoti approach ty coordin mechan kind coordin relationship exist task environ reusabl tool foundat interact human acm interfac comput customiz set coordin mechan applic environ singl coordin mechan environ task coordin coordin schedul assist softwar engin environ argument similar item appli concurr engin product repres manufactur work develop product extens product explor technolog manag larg softwar engin project schedul task perform programm resourc part taylor environ directli concern repres track state softwar develop process product resourc inform applic provid schedul coordin facil user uniqu featur domain presenc high level uncertainti task durat manufactur distribut inform gather distribut inform gather applic internet technolog develop origin user queri transform set plan gather plan element deal coordin activ construct final queri agent assign concurr pursu sourc answer aspect queri make altern type sourc text gener answer agent proce work asynchron coordin agent result work agent suggest exist agent gather addit inform sourc altern suggest addit agent agent deal uncertainti avail sourc workload requir task agent refer mr ab rw conflict resolut strategi distribut agent gasser distribut artifici vol page pitman publish coin technic report philip agr titl undecid publish cambridg press posit paper present aaai fall symposium knowledg action social organiz graham allison essenc explain crisi brown dl question decker privat commun axelrod evolut cooper basic pm je schwartz social test theori group relationship academ mark boddi thoma dean solv plan problem eleventh intern joint confer artifici page august alan bond le gasser analysi problem research dai alan bond le read distribut artifici page morgan keith decker select uncertainti calculi experi complex kanal uncertainti artifici intellig north lesser role plan recognit design intellig user interfac ieee cybernet page cal rs structur theori action network model social action quantit studi social relat academ richard burton obel design effici model north stephani david randal strategi cooper distribut problem solv eighth intern joint confer artifici page august km carlei mj editor comput organ theori lawrenc erlbaum norman victor lesser sophist cooper distribut problem solv system ninth nation confer artifici page juli carver note inform retriev privat commun castelfranchi individu intent group organ michael ai theori group conceptu empir research aaai work note fb da gp editor distribut volum studi data process academ chandrasekaran natur social system metaphor distribut problem introduct issu ieee transact januari ja ramamritham dynam schedul group task constraint distribut hard system system decemb ramamritham schedul algorithm hard system hard system ieee donald coordin inform structur system california philip cohen hector levesqu intent choic commit artifici paul michael david adel trial understand design requir agent complex environ ai fall paul cohen survei eighth nation confer artifici pull pull ai spring paul cohen tactic gener note design meyer multistag negoti distribut constraint satisfact ieee transact novemb daniel corkil victor lesser control coordin distribut problem solv network eighth intern joint confer artifici page august daniel corkil hierarch plan distribut environ sixth intern joint confer artifici page coin kevin crowston coordin restaur analysi fridai process present workshop mathemat comput organ april crowston professor michigan school busi daniel appli nonparametr statist davi smith negoti metaphor distribut problem solv artifici januari dean wellman plan control morgan kaufman san thoma dean control darpa plan decemb keith decker victor lesser extend partial global plan framework cooper distribut problem solv network control workshop innov approach schedul page san novemb morgan kaufmann coin keith decker victor lesser gener partial global plan algorithm intern journal intellig cooper inform june keith decker victor lesser analyz quantit coordin relationship group keith decker victor lesser approach analyz commun thirteenth intern joint confer artifici page august keith decker victor lesser dynam coordin algorithm distribut sensor network eleventh nation confer artifici page juli keith decker victor lesser quantit model complex comput task environ eleventh nation confer artifici page juli keith decker victor lesser quantit model complex environ intern journal intellig system decemb special issu comput model model characterist agent keith victor robert extend blackboard architectur approxim process journal keith alan marti victor lesser effect parallel blackboard system schedul twelfth intern joint confer artifici page august extend version intern journal pattern recognit artifici intellig keith alan marti victor lesser blackboard system control approxim process hawaii intern confer system januari extend version intern journal pattern recognit artifici intellig keith alan marti victor lesser control heurist schedul parallel blackboard system intern journal pattern recognit artifici keith alan marti victor lesser control architectur approxim process blackboard system intern journal pattern recognit artifici keith decker distribut problem survei ieee transact septemb keith decker distribut artifici intellig testb ohar foundat distribut artifici chapter wilei forthcom keith decker environ center analysi design coordin mechan phd keith decker framework analysi design coordin mechan ohar foundat distribut artifici chapter wilei forthcom duboi prade criteria aggreg rank altern framework fuzzi set theori hj br manag volum page elsevi scienc edmund victor lesser partial global plan coordin distribut problem solver tenth intern joint confer artifici august lesser predict coordin problem solver dynam domain seventh nation confer artifici page st august edmund victor lesser increment plan control problem solver ieee transact aerospac electron septemb edmund victor lesser negoti task decomposit alloc partial global plan gasser distribut artifici vol ii pitman publish eh vr lesser partial global coordin framework distribut hypothesi format ieee transact septemb edmund thoma montgomeri hierarch protocol coordin multiag behavior eighth nation confer artifici juli montgomeri coordin distribut search hierarch behavior space ieee transact novemb edmund victor daniel corkil coher cooper commun problem solver ieee transact novemb corkil cooper distribut problem solv handbook artifici volum page addison eh pj gmytrasiewicz reciproc ration mix strategi equilibria eleventh nation confer artifici page washington edmund unifi approach dynam plan action interact distribut problem solv network phd ephrati js rosenschein divid conquer plan twelfth nation confer artifici page aaai press mark fox organiz view distribut system ieee transact januari organiz design alan garvei victor lesser schedul ieee transact alan garvei victor lesser survei research delib artifici intellig journal alan marti victor lesser task interdepend schedul eleventh nation confer artifici page juli alan keith victor lesser interfac schedul cs technic report le gasser toru ishida dynam organiz architectur adapt problem solv ninth nation confer artifici page juli le repres organiz knowledg distribut ai system gasser distribut artifici vol ii pitman publish le gasser social concept knowledg action artifici rosenschein cooper commun nation confer artifici page august michael georgeff commun interact multiag plan eighth intern joint confer artifici page august michael georgeff theori action multiag plan fourth nation confer artifici page august life american sociolog piotr edmund david approach coordin multiag interact twelfth intern joint confer artifici page august goldman rosenschein emerg coordin cooper rule twelfth intern workshop distribut hidden joseph halpern yoram mose guid modal logic knowledg preliminari draft ninth intern joint confer artifici page august joseph editor theoret aspect reason confer morgan kaufmann march davidson cooper oper system develop environ alan bond le read distribut artifici page morgan carl hewitt offic open system offic inform juli carl hewitt open inform system semant distribut artifici intellig artifici flexibl system solv dynam schedul problem phd depart comput septemb ho team theori inform structur june eric horvitz reason vari uncertain resourc constraint seventh nation confer artifici august lesser intellig assist support softwar develop process acm symposium softwar develop novemb editor comput organ design aaai spring work note toru ishida tower problem solv workshop distribut artifici page jen commit foundat coordin system knowledg engin jb pd larkei subject probabl theori game manag februari issu encount build flexibl softwar develop lesson project acm sigsoft symposium softwar develop environ page decemb jack statist tool simul marcel craig knoblock search reduct hierarch problem solv ninth nation confer artifici juli william carl hewitt scientif commun metaphor ieee transact januari editor distribut system architectur implement susan lander victor lesser framework integr cooper system ieee intern symposium intellig page septemb bruno scienc action harvard paul lawrenc jai organ environ harvard victor lesser daniel corkil function cooper distribut system ieee transact januari victor lesser daniel corkil distribut vehicl monitor testb ai fall updat distribut vehicl monitor testb comput scienc technic report victor edmund approxim process problem solv ai spring lesser retrospect view distribut problem solv ieee transact novemb hector philip jo nune act eighth nation confer artifici page juli pg jc jin virtual design simul organiz structur commun tool affect team perform km carlei mj comput organ theori lawrenc erlbaum lin carlei proactiv analysi effect agent style organiz perform intern journal intellig system decemb special issu comput model model characterist agent zhao algorithm schedul comput ieee duncan luce howard raiffa game introduct critic survei john wilei thoma malon kevin crowston interdisciplinari theori coordin center coordin scienc technic report mit sloan school howard task schedul distribut comput environ technic report mit center inform system octob howard task schedul distribut comput environ technic report mit center inform system march thoma kevin brian pentland tool invent handbook organiz process center coordin scienc technic report mit sloan school thoma malon model coordin organ market manag thoma malon coordin nation scienc foundat coordin theori februari march simon organ huang logic organiz formal jd thompson organ action action logic paper depart statist bill organiz systemat california jw meyer formal structur myth american journal jw meyer wr scott organiz ration sage mi environ model simul softwar engin process ieee transact knowledg data septemb stankov analysi effect delai load share ieee transact novemb terri econom organ american journal polit novemb decentr approach distribut plan problem group thoma montgomeri edmund search reduct hierarch distribut problem solv eleventh intern workshop distribut februari de dw vr tw sandholm exploit inform distribut schedul system twelfth nation confer artifici august rao agenc theori uncertainti evalu organiz sergei victor lesser provid intellig assist distribut offic environ alan bond le read distribut artifici page morgan tim nagendra victor lesser cooper inform distribut problem solv approach technic report depart comput septemb hsu configur system organiz issu exampl multipl agent support expert system page john theori american journal march editor distribut comput commun academ predict perform distribut model approach nation confer artifici page august charl complex organ random pfeffer organiz ll cum bm research organiz volum jai pfeffer theori structur perspect manag journal decemb pfeffer barrier advanc organiz paradigm develop independ variabl academi manag martha pollack marc ringuett introduc evalu agent architectur eighth nation confer artifici page juli john effici schedul algorithm multiprocessor system ieee transact parallel distribut april taxonomi game societi gener system research page eric game introduct game theori basil reed vr lesser labor bee distribut focu attent coin technic report novemb william robinson stephen ficka negoti freedom requir engin technic report depart comput inform april rosenschein interact ration probabilist approach gasser distribut artifici vol ii pitman publish rosenschein genesereth commun cooper technic report stanford heurist program rosenschein genesereth deal ration agent ninth intern joint confer artifici page august stuart russel eric wefald studi limit ration mit stuart russel zilberstein system twelfth intern joint confer artifici page august tuoma sandholm implement contract net protocol base margin cost calcul eleventh nation confer artifici page juli richard scott open system englewood sen design adapt meet schedul ieee confer ai john stankov resourc reclaim multiprocessor system ieee transact parallel distribut april shoham tennenholtz synthesi social law artifici agent societi tenth nation confer artifici page san juli yoav shoham simpl agent languag interpret ninth nation confer artifici page juli decentr control complex system academ herbert simon model man herbert simon model bound volum mit david smith martin plan coordin support expert system integr darpa plan page decemb distribut problem solv infrastructur comput network manag intern journal intellig cooper inform june ma rm token empir test hypothesi american journal stankov ramamritham design spring kernel system decemb spring kernel support ai applic euromicro workshop stankov perspect distribut comput system ieee transact decemb stankov simul decentr job schedul algorithm comput stankov applic bayesian theori decentr control job schedul ieee transact februari arthur construct social theori chicago arthur inform organ california sugawara victor lesser learn coordin plan comput scienc technic report fox distribut constrain heurist search ieee transact rn fc la ww jc al young foundat environ architectur acm softwar engin symposium practic softwar develop page novemb jame thompson organ action distribut system design frank martial model resolv conflict distribut offic activ confer offic inform page april frank martial coordin plan autonom agent lectur note artifici intellig max weber theori social econom organ oxford translat edit henderson parson michael wellman program environ applic distribut flow problem journal artifici intellig robert frederick john carl network structur distribut situat assess ieee transact januari dl sd dm pr cohen common lisp instrument user manual technic report depart comput oliv williamson market analysi implic free stankov schedul task resourc requir hard system ieee transact softwar zlotkin jeffrei rosenschein postal natur decept negoti tenth intern workshop distribut octob zlotkin rosenschein incomplet inform decept negoti twelfth intern joint confer artifici page august
IR/1109 5 steve lawrenc context web ieee data engin volum number pp context web search steve lawrenc nec research independ nj abstract web search engin gener treat search request isol result queri independ context user made request search engin make context explicit implicit context inform implement addit function restrict context greater context web search competit web introduct web increasingli repres area societi inform web author organ million expect contrast tradit inform retriev web term content structur current web search engin similar oper tradit inform retriev system creat index word return rank list document user queri web search engin good return long list relev document user method improv rank search result result return search engin valuabl user document valuabl depend context queri previou experi inform current request user compani sell technic detail user site search engin googl fast make inform easili access wide web gvu studi show peopl search engin locat inform search engin consist rank top site access web major web search engin limit index fraction publicli index index document authent requir document search index site equal popul task perform search servic increasingli import understand context search request web search engin gener treat search request isol result queri independ context user made request context inform provid user form keyword ad user homepag individu add keyword queri provid context form difficult limit add context inform search request search engin specif request inform ad explicit context inform inquiru project nec research institut request context form categori inform desir addit provid keyword user categori introductori inquiru metasearch engin oper layer regular search engin inquiru queri context attempt context inform find relev document regular web search engin context inform select search engin send queri modifi select order polici queri research paper send multipl queri search engin queri transform addit keyword improv find research paper queri ident origin case transform success inquiru proven highli effect improv search result categori recent research relat inquiru includ learn method automat learn queri modif automat infer context inform inquiru greatli improv search requir user explicitli enter context inform search context automat goal watson project watson attempt model context user inform base content document edit microsoft view internet explor document user edit analyz heurist term weight aim identifi word indic content document inform font size weight word user enter explicit watson modifi queri base content document edit forward modifi queri web search automat ad context inform web search addit explicit watson oper continu document web relat document user edit view mode oper similar remembr agent remembr agent index file email messag research continu search relat document user edit document emac editor relat project margin note rewrit web page includ link relat person haystack project aim creat commun interact person inform autonomi program automat suggest content web local base document user read edit relat agent learn user interest profil recommend web page fab letizia webwatch syskil webert person search step complet person search search engin previou request inform tailor result request rank link professor comput scienc statist highli link famou individu interest person search engin server search engin googl track user previou queri select inform infer user interest user search comput scienc relat materi homepag comput scientist rank highli queri user search person search servic track document edit view order obtain model user interest servic local access larg scale index limit function servic rank homepag comput scientist highli queri search servic return page maximum number result client retriev client modifi queri retriev document relat difficult entir interest user watson exampl person web search engin watson extract context inform current document user edit view cost run larg scale search engin person major web search engin major search engin light provid alert servic notifi user page match specif queri advanc comput resourc make larg scale person search feasibl time internet compani devot substanti amount storag individu user compani offer free disk storag user import problem person search servic user expect consist receiv result person search engin return result user engin learn user import address privaci user limit storag person inform search engin compani guess user increasingli common techniqu web guess context user queri search engin excit lyco googl yahoo provid special function kind queri queri excit lyco match artist compani produc addit result link directli artist compani inform yahoo recent ad similar special result type queri stock symbol provid stock quot link compani sport team link team leagu inform exampl yahoo includ car major drug dog tv nation park googl identifi queri street direct link map googl track recent link match articl effect guess user articl explicitli requir user enter context inform stock techniqu guess context relev user easili identifi context interest techniqu limit case potenti context identifi base keyword queri improv guess search context person search engin queri return link list prof michael jordan public scientif user interest comput guess user list public prof jordan cluster search perform northern light relat northern light dynam cluster search result categori user narrow result categori restrict context search engin add context web search restrict context search creat special search engin specif domain thousand special search engin exist servic provid similar function regular web search inform publicli index web fraction index regular search inform regular search engin york time search number special search engin provid function provid regular web search specif domain inform extract domainspecif process researchindex special search engin scientif literatur researchindex free public servic researchindex world largest free fulltext index scientif index articl million citat incorpor featur specif scientif literatur researchindex autom creation citat indic scientif easi access context citat special function extract inform commonli found research articl special search engin inform extract process includ deadlin confer workshop inform newsgroup mail job inform index homepag comput inform extract analysi link sourc order determin geograph locat scope web resourc northern light servic call northern light attempt extract address web incorpor concept geograph scope resourc york time locat york interest larger geograph local york newspap interest search engin automat extract inform web page method inform identifi commun web search engin index inform publicli index web method locat subset web domain flake al recent shown link structur web selforgan commun highli relat page effici identifi base pure connect web commun defin collect page member link insid commun commun definit gener identifi commun size vari level discoveri import central author process govern format link web discoveri identif commun web independ specif word algorithm effici identif commun found method locat commun relat page web locat special search engin thousand special search user locat interest user effort locat special search engin queri serv special servic major web search engin overhead locat special engin great exist method locat special search engin research area method select search engin base user queri gloss maintain word statist order estim queri relat research includ great benefit major web search engin attempt direct user special search engin search engin incent provid servic prefer maxim servic provid size fit limit competit typic search engin view size fit user receiv queri argu model optim serv larger state benefit web equal access inform equal web distribut traffic link site extrem skew approxim power law share traffic link small number popular site evid trend behavior market share popular servic largest convent book retail market largest onlin book retail market share search engin contribut statist prior consum locat store store list phone book number consum locat store search engin imagin web search keyword result site rank popular measur incorpor select rank criteria small percentag peopl search engin find peopl creat link web enhanc bia locat store experi locat item web common experi compar previou mean locat item phone walk note trend concern trend common experi watch number cabl fewer peopl watch program access inform limit search servic queri search store major web search engin return user find list onlin yellow page phone directori search presidenti candid februari differ major web search engin probabl offici candid homepag return page result similar search special polit search engin provid result exist servic prevent bia inform access peopl major web search engin search directori site yahoo open directori unequ delai list site list directori extent effect depend peopl search engin locat kind search engin search servic incorpor incorpor context exist search mitig neg effect access inform web summari search engin make amount inform quickli easili access contribut web societi enorm size fit model web search limit function context web search web search import function search servic increasingli import refer stein inform environ confer inform knowledg gravano extract relat larg collect acm intern confer digit mitchel learn world wide web marko balabanov adapt web page recommend servic intern confer autonom page acm barabasi albert emerg scale random network carol barri identif user criteria relev document topic approach inform retriev phd bharat mr improv algorithm topic distil hyperlink environ sigir confer research develop inform joachim machin learn architectur optim web search engin aaai workshop inform brin extract pattern relat world wide web webdb workshop edbt brin page anatomi hypertextu web search engin seventh intern world wide web kj hammond user interact everydai applic context inform access intern confer intellig user acm press kj anticip inform everydai applic interfac internet inform server world confer internet aac press jai kristian larri marko similar workshop artifici intellig web search aaai garc shivakumar exploit locat inform web page acm web rajagopalan automat resourc list compil analyz hyperlink structur text intern world wide web soumen martin van den byron dom approach web resourc discoveri world wide web junghoo hector garc lawrenc page effici crawl url order seventh web fran eric steve lee gile featur select web applic roc inflect symposium applic san januari hawk server select world wide web acm confer digit page slatteri learn extract symbol knowledg world wide web fifteenth nation confer artifici aaai page wu appli link analysi web search eighth intern world wide web page fran steve lee marco gori crawl context graph intern confer larg vldb septemb lui narayanan shivakumar comput geograph scope web resourc intern confer larg vldb septemb experi select search engin acm transact inform gari steve lee gile effici identif web commun sixth acm sigkdd intern confer knowledg discoveri data page august susan mario gomez intellig fusion distribut search engin journal comput raghavan infer web commun link topolog acm confer hypertext eric gari steve william lee david pennock improv categori specif web search learn queri modif symposium applic san januari eric steve william lee gile architectur metasearch engin support user inform eighth intern confer inform knowledg cikm page kansa novemb eric steve michael william lee gile web search commun accept public usabl center gvu tenth www user survei octob garc paepck stanford internet acm sigmod intern confer manag page garc discoveri internet acm transact lui gravano hector garc gener gloss broker hierarchi intern confer larg page ba je rm strong regular world wide web surf kleinberg authorit sourc hyperlink environ symposium discret page san januari lee fran eric gari steve cristian build nich search engin ninth intern confer inform knowledg cikm novemb kushmerick wrapper effici express workshop ai inform doorenbo wrapper induct inform extract ijcai page steve kurt lee gile index retriev scientif literatur eighth intern confer inform knowledg cikm page kansa novemb steve lawrenc lee gile context page analysi improv web search ieee internet steve lawrenc lee gile search world wide web steve lawrenc lee gile access inform web steve lawrenc lee gile search gener scientif inform access ieee steve lee kurt bollack digit librari autonom citat index ieee hammond select sourc retriev workshop intellig inform menlo aaai press lieberman agent assist web intern joint confer media media announc top digit media properti site januari rish estim search engin intern confer data stefano histori journal american societi inform billsu syskil identifi interest web site nation confer artifici ivan png competit convent preliminari studi nec research renni mccallum reinforc learn spider web effici sixteenth intern confer machin learn bradlei rhode inform retriev phd institut bradlei rhode margin build contextu awar associ memori intern confer intellig user iui bradlei rhode thad starner remembr continu run autom inform retriev system intern confer practic applic intellig agent multi agent page salton automat text analysi retriev inform comput andrew rosenfeld learn hidden markov model structur inform extract aaai workshop machin learn inform soderland learn inform extract rule free text machin sullivan find search engin februari xu callan effect retriev distribut collect intern acm sigir confer research develop inform page zobel collect select lexicon inspect australian document comput page
DB/1110 3 integr analysi data sourc deal problem result potenti heterogen activ address problem call data prepar support tool tool process manner support iter explor natur integr analysi process work present framework import data prepar task base languag languag offer featur solv common integr clean problem part queri process combin data prepar mechan queri facil permit appli evalu integr clean strategi explicit load materi data paper introduc languag concept discuss applic individu task data prepar introduct prepar data import preprocess step data analysi part data wareh data mine main reason qualiti input data strongli influenc qualiti analysi result data prepar clean reduct discret data task state percent time effort data analysi project requir data prepar remain part actual analysi phase tool prepar partial integr product microsoft data transform servic data prepar framework base languag sattler depart comput scienc magdeburg germani oracl builder tool base batch input data read process main memori task final written back place tabl consequ initi dataset overwritten prepar step addit copi requir data extern sourc auxiliari load step prepar prepar task implement procedur script problem data subject analysi distribut possibl heterogen larg dataset examin begin analysi prepar analysi techniqu requir approach enabl appli major prepar step declar part queri virtual integr dataset prepar task profit capabl manag optim parallel memori manag approach combin gatewai interact explor prepar analysi explicit materi base observ investig paper extent import widespread problem data prepar solvabl appli standard sql featur languag featur recent research literatur implement queri languag languag power queri oper address problem integr transform heterogen data suitabl platform build framework data prepar paper structur section discuss process data assign subtask common techniqu individu step section introduc queri languag construct support integr transform data clean techniqu present section problem reduct discret address section section discuss relat work section conclud overview usag part workbench data integr analysi point futur work major task data prepar section mention import data prepar analysi mine discuss individu task process understand sketch process analysi view analysi process depend applic requir data analysi method view dm consortium standard process data mine refer model describ individu phase data mine process dm data mine project consist phase phase busi understand address understand project object requir busi phase data understand describ explor data examin step data model phase model techniqu cluster select appli paramet set adjust model evalu order fulfil qualiti requir phase consist task report gener document part process data prepar activ requir construct input dataset model initi dataset includ data identifi data relev analysi select requir attribut tupl data combin data multipl sourc relat construct tupl valu data transform data structur syntact level meet requir analysi normal deriv comput valu tupl data improv data qualiti select clean subset fill miss remov resolv inconsist elimin outlier data obtain reduc compress dataset order reduc analysi effort aggreg discret reduc volum deriv sampl practic task prepar part process form strict sequenc techniqu data prepar analysi appli interact explor manner techniqu evalu time order find suitabl method combin result method effici data access queri facil data prepar phase benefit extend queri languag support standard sql basic featur filter transform subtask discret reduct requir advanc oper discuss queri primit provid support oper integr transform analyz data heterogen sourc requir transpar access sourc order combin transform relev data load data physic special stage area data environ dedic analysi defin virtual view system virtual integr approach support languag respect data integr transform languag gener languag transpar access extern integr relat sourc join union resolv structur semant conflict renam map advanc schema transposit resolv resolv data reconcili function aggreg describ featur detail illustr scenario scenario describ simplifi data applic relat region sale inform product cost product prod euro scenario measur collect relat measur consist actual valu geograph posit point timestamp classifi measur access integr heterogen sourc extens sql access relat host extern relat structur document websit access implement adapt loadabl runtim translat queri queri result global level sourc level base data model view integr sourc relat tabl manag global data distinguish kind import view map relat sourc global relat integr view combin multipl view tabl import view defin term type attribut map sourc attribut defin simpl renam appli explicit map tabl convert valu integr view view global relat combin oper outer join featur provid solut data transform schema transform base global view transform schema instanc level appli schema level transform includ standard sql oper project join restructur transposit mean convert row column kind restructur relat fig product year product cost region year figur relat transposit relat cost product group relat definit requir pose row oper gener form tupl input relat ò tupl structur gener output relat relat transform select row oper row pose column subset input relat column construct output tupl column repres tupl valu transform back structur relat select column year part specifi attribut identifi group tupl tupl oper implement similar group result group transform tupl group data transform transform instanc level mean fact convert valu depend requir analysi task approach feasibl simpl perform builtin function function support builtin function string manipul function standard sql function substr split split string common kind transform normal valu attribut valu normal lie fix interv minimum maximum valu case appli attribut ó ó minimum maximum ò ò interv boundari normal ó ó ó ò ò ò normal implement max doubl min doubl doubl doubl doubl return techniqu map valu attribut interv standard deviat attribut implement norm requir standard deviat attribut valu doubl doubl doubl return normal techniqu requir scan input comput aggreg actual normal select select class oper appli virtual affect origin data simplifi evalu techniqu integr transform heterogen data subject analysi clean integr transform step data prepar due origin data result convent error miss valu simpli addit clean step concentr identifi reconcil fill miss detect remov handl data duplic elimin tight connect integr problem solut duplic elimin base extend join union oper conjunct reconcili function introduc section usag reconcili function restrict binari oper addit power solut base extend group aggreg group oper support group arbitrari tupl input relat comput group express base tupl assign group assum code comput region geograph posit function group criterion region averag measur select rc measur group region code group oper group consist tupl repres entiti final step tupl group merg comput conflict attribut inform implement aggreg aggreg function implement java class predefin public interfac void init boolean iter object result object produc method init call tupl iter method invok final result obtain method result method produc earli return introduc class instanti relat aggreg store show return valu newest tupl simplifi form omit implement detail class newest implement timestamp doubl void init boolean iter timestamp return doubl result return java class regist queri system aggreg creat aggreg newest return doubl extern featur data discrep semant overlap resolv shown measur station combin collect valu attribut return measur select rc union union group region code essenti approach base attribut equal object refer sourc slightli kei duplic identifi base similar criteria shown process duplic elimin consid step process step identifi entiti possibl relat real world reconcil step fit concept group aggreg relat reconcili accomplish extens aggreg concept includ function shown group problem similar criterion establish relat similar tupl relat consid establish relat requir group describ construct group gener concept userdefin aggreg function group build base similar transit closur similar maxim group tupl build group tupl similar chosen repres group contrari group approach tupl deriv group tupl context input relat consequ interfac group function public interfac void init boolean iter tupl void finish int tupl init method function initi begin group descript similar function regist function perform group action requir build group place iter finish queri engin retriev inform group membership surrog tupl group identifi intern simpl group function group product base similar product integr view sourc select union union group similar group initi comparison algorithm string threshold compar return algorithm descript simpl group algorithm repres function assum group build transit closur similar tupl iter tupl identifi product pass function product compar product previou iter step string comparison function return tupl ad group previou tupl multipl relat group merg group tupl creat iter call finish method case thing set flag indic inform group membership retriev approach disadvantag effort implement group function complex criteria advanc group algorithm opportun optim group separ queri process queri evalu implement concept mention queri languag primit combin fuzzi comparison function atom strategi establish relat miss valu problem miss null describ solut simplest approach remov affect tupl null select time measur null problemat percentag miss valu larg altern fill miss valu comput averag median attribut attribut tupl class requir group cluster group assign averag attribut class miss averag valu store temporari insert tmp select measur group updat measur set tmp handl data data random error varianc approach handl bin histogram method regress histogram method data partit bin bucket base attribut attribut domain divid ò interv item bucket distinguish bucket interv length bucket number item simpler construct scale histogram relat relat tupl repres bucket valu ú ú averag òø number valu bucket histogram easili construct number bucket obtain domain boundari attribut select histogram attribut ü mean bucket construct insert select id measur group floor partit smooth bucket bucket median bucket boundari bucket smooth valu attribut select time creat histogram slightli complex frequenc occur valu determin select measur group number tupl number bucket height bucket comput iter sort frequenc tabl collect item maximum bucket height reach bucket boundari comput current item standard sql step formul singl queri implement extern procedur eleg solut advanc aggreg featur provid introduc aggreg function earli return power mechan increment evalu aggreg support earli return special part interfac aggreg function return true result invoc case call queri processor order obtain intermedi aggreg implement comput move class implement int doubl void init num boolean iter return doubl produc return doubl result return produc earli return simplifi construct histogram lb comput lower ub comput upper boundari comput bucket queri obtain histogram bucket height attribut insert select select cnt measur group order asc implement sketch forb ub class bucket ub implement int doubl boolean iter int int height lower upper comput split height return upper return doubl comput split int return height doubl produc return notic implement orient numer attribut ordin attribut exist attribut chosen split comput boundari base histogram data smooth mean bucket shown histogram detect outlier histogram tool detect outlier frequent techniqu regress linear regress squar method goal find straight line model dataset line ý paramet calcul valu attribut ü ý ü ý ò ò hold è ü ý è ü ý obtain paramet line straightforward alpha select select calc alpha beta ya alpha paramet alpha beta remov data item regress line simpli decid base absolut distanc remov ò percent item largest distanc approach express singl queri express comput select measur criterion requir mechan limit cardin queri result support limit cut result set number tupl queri remov percent tupl largest distanc outlier written select dist measur order dist limit data reduct subproblem data prepar address framework reduct volum data larg effici analysi reduc dataset produc analysi result solut aggreg data perform data environ discard dimens approach implement group approach requir project approach directli support sampl discret sampl mean obtain repres subset data kind sampl develop recent random sampl present implement sampl relat queri result size deriv limit sampl select measur limit sampl sampl data store relat effici process sampl reduc number tupl subset discret aim reduc number distinct valu analysi method requir discret attribut valu solut discret discret base discret approach numer valu replac repres discret bucket discuss section kind histogram applic altern approach build histogram hand domain knowledg concept incom class price classif interv boundari independ kind histogram illustr relat work recent year effort support individu task data prepar data wareh data mine transform problem commerci tool etl tool address kind data rang gener tool tool suit special tool common format call audit tool detect elimin discrep tool support limit set transform transform implement script procedur perform transform manner support explor interact approach approach address special data clean transform problem clean tool support cluster merg duplic base declar specif languag primit schema evolut data transform approach schema transform part languag offer restructur oper declar transform languag autom translat base schema similar discuss method detect maximum number duplic item deriv clean rule approach resolv attribut conflict base assign probabl attribut data model global attribut consist origin resolv conflict type present individu valu access global queri attribut threshold predic determin toler differ resolut function automat conflict resolut defin approach introduc notion semant valu enabl heterogen sourc repres context inform advanc applic statist data analysi deriv map function numer data recent work dedic middlewar support integr heterogen languag msql feder system pegasu ibm tsimmi inform manifold disco garlic pegasu offer function data manipul languag call base dbm mediat system tsimmi mediat set rule rule map set sourc object virtual mediat object transform defin rule problem combin object sourc mediat discuss total approach whirl deal instanc heterogen integr textual similar comput join relat sourc permit integr normal valu restrict textual data work queri languag extens address prepar analysi task aggreg earli return applic data mine discuss present queri languag offer featur sampl approach partial inspir queri extens combin languag featur data prepar import task data wareh data mine part process problem dealt data integr detect inconsist data multipl remov suppress reduc data write dedic routin address individu subproblem process inform fusion integr analysi data heterogen sourc paper present framework data prepar base queri languag benefit languag virtual integr combin abil appli transform clean oper copi physic manipul initi dataset check strategi integr clean reduc effort object work invent languag add oper identifi lightweight extens dedic data prepar analysi add queri languag implement extens primit open possibl profit inher capabl manag system present languag extens implement part queri processor form core engin inform fusion task engin offer extens set oper data prepar analysi task oper gener execut queri present paper combin user interfac visual tool interact iter approach data analysi achiev futur work support advanc clean entiti analysi mine oper plan refer tool data translat integr ieee data engin shan pegasu heterogen system ieee decemb wimmer heterogen multimedia inform garlic approach proc int workshop research issu data engin distribut object page chaudhuri dayal overview data wareh olap technolog sigmod rundenstein schema evolut flexibl framework acm int conf inform knowledg manag page melodi xu primit knowledg discoveri proc acm sigkdd int confer knowledg discoveri data mine san ca page cohen integr heterogen common domain queri base textual similar haa sigmod proc acm sigmod int confer manag june page acm consortium crisp process user fayyad irani discret attribut classif learn proc int joint conf artifici page morgan simon extens data clean tool acm sigmod intern confer manag volum page widom tsimmi approach data model languag journal intellig inform selli queri languag relat vldb han fu dynam gener refin concept hierarchi knowledg discoveri workshop knowledg discoveri page han data concept techniqu morgan kaufmann hernandez stolfo data data problem journal data mine knowledg graham schema architectur system modern chapter page acm subramanian languag relat system proc int conf larg data mumbai page morgan ordil queri heterogen inform sourc sourc descript proc int conf larg data mumbai page morgan lim chiang global object model accommod instanc heterogen conceptu model er intern confer conceptu novemb volum lectur note comput page shekhar resolv attribut incompat evidenti reason approach proc ieee int conf data februari page lo ieee comput societi press cheung discov reconcil semant data mine perspect ifip work confer data semant random sampl phd uc april object fusion mediat system proc int conf larg data mumbai page morgan sattler saak support inform fusion feder technolog proc int workshop engin feder inform page sankt saak ad conflict resolut featur queri languag feder australian journal inform rosenth semant valu facilit heterogen inform system acm transact june raschid distribut inform search compon world wide web sigmod acm mod intern confer manag page acm zhang heterogen queri optim proc int conf larg data york page morgan vitter effici algorithm sequenti random sampl acm transact mathemat march wang zaniolo aggreg datamin acm sigmod workshop research issu data mine knowledg
HCI/1111 4 symbiot interfac wearabl face recognit bradlei thad starner colleg georgia institut ga abstract introduc wearabl face detect method exploit constraint face scale orient proxim particip social interact method describ wearabl system perceiv wearer begin interact individu applic improv interfac portabl consum cellular avoid interrupt user interact system prove accur test wearabl video data captur confer hundr individu data separ independ train test set goal incorpor user interfac mobil machin recognit system improv perform user provid feedback system subtli cue system typic daili turn face condit recognit favor introduct casual social easi forget ident meet consequ rang reintroduc miss busi contact organ social tag assist memori electron tag rememb contact inform everydai situat tag wearabl face recognit system provid associ aid recal prior interact person stand front wearabl user starner system complex creat drain limit batteri resourc wearabl comput social engag weak constraint exploit face recognit search scale orient limit typic social interact distanc desir lightweight system detect social engag face recognit wearabl comput balanc interfac human burden wearabl comput interrupt user social interact alert wireless telephon disrupt detect social engag block delai interrupt appropri visual identifi social featur social process ey pattern chang head social chang visual spatial content relev uncertain featur induc set behavior assist comput wearer align xs displai ey subject recogn learn applic method sampl data extend recognit algorithm includ behavior face recognit algorithm literatur consid potenti solut problem rowlei schneiderman leung task recogn social engag context human behavior environ face presenc import featur segment engag examin standard face found background content variat scene obtain camera everydai life highli vari scene background addit presenc exploit movement face respect wearer camera prior work visual model human interact starner starner chose hidden markov basi recognit system engag dataset collect video data wearabl camera academ set repres social interact wearer acquaint captur environ highli unconstrain rang direct sunlight darken confer hall approxim subject captur time hour imag figur locat video annot wearer face prototyp wearabl camera video captur system figur consist color figur repres data set figur mark user align face captur apparatu sensit black white ir digit record video charact audio tone soni ion batteri output camera record dv hmd augment user view charact charact repres locat subject ey video feed captur face wearer approach subject align person ey charact video annot user press button inject audio tone dv stream locat face data method video data automat extract partit divid class frame annot wearer class number engag gestur hour interact smaller number exampl garbag class wearer line xs ey view presenc face safe frame subregion dv frame annot locat video face present engag larg respect subregion convert correct imag pixel subregion downsampl preprocess region video imag linear heat equat gaussian level pyramid subsampl level result gestur greyscal subregion element model face class figur engag class state hmm shown figur class complex model requir state ergod model captur interplai garbag type scene shown figur plot valu state output probabl presenc face import accept face model state rough blob state repres align portion gestur final state sharper featur state consist engag class imag horizon dark light scene complex model wider variat scene loss accuraci background model improv build locat awar model environ specif featur repres result evalu metric tabl accuraci engag detect experi train set independ test video stream train engag engag test engag engag accuraci result matric shown tabl leverag detect social engag compar continu run face construct wearabl face recognit system engag combin social engag detector local face recogn cost social engag detector small larger cost local recognit inequ total resourc fix cost run engag detect fix cost run local recognit method rate suppli respect detector frame maximum determin fraction posit fp multipli maximum input frame rate rate user ident ui fp ui note fixat camera true face frame deliv face recogn assum user updat quickli repeatedli ui assum rate posit greater rate user leav fp comparison assum averag time frame process local recognit process repres multipl averag detect time multipli determin maximum rate posit face detect process fp note local recognit process run faster face detect process situat impli perform face detect separ face local recognit save process time local recognit run continu face recognit primari posit rate fp solv equat determin maximum time local recognit process compar detect set heurist determin separ face detect face local recognit profit fp fp appli metric previou section fp solv recognit method time slower engag detect method limit frame rate frame detect algorithm run knowledg princip compon analysi base face recognit align run faster roughli time feel engag detect success foundat wearabl face recognit output detect elimin posit recognit due final state output method provid reason estim locat fine grain local cue includ detect head ey gestur reduc selker platform built captur video wearabl user perspect detail method engag detect test system repres scenario metric evalu part face recognit scheme demonstr design user interfac awar social context constraint posit recognit system bodi detect social engag improv interfac portabl consum devic refer thing augment tag ibm system integr portabl system suspect identif track assess technolog law enforc visual augment memori fourth intern symposium wearabl ga ieee fast accur face detector base neural network pattern analysi machin silent languag wearabl face recognit aid confer signal process ieee video surveil interact cvpr workshop visual fort ieee find face clutter scene random label graph match inter confer comput vision recognit action context phd georgia institut ga hidden markov approach face detect recognit phd georgia institut ga statist model human interact cvpr workshop interpret visual page santa ca ieee face interest motiv neural face detect ieee transact pattern analysi machin find locat omnidirect video wearabl comput platform intern symposium wearabl ga ieee statist model object detect appli face car comput vision pattern recognit ieee ey motion detect interfac acm augment realiti wearabl comput presenc special issu augment realiti american sign languag recognit desktop wearabl comput base video pattern analysi machin intellig visual contextu awar wearabl comput intern symposium wearabl comput learn human face detect pattern analysi machin
ML/1112 6 learn inton rule gener phd thesi pan depart comput scienc columbia ny septemb ii content introduct motiv overview plan contribut structur architectur gener architectur nlg compon prosodi model compon prosodi gener compon interfac languag learn prosod rule introduct prosodi citat style sentenc problem data experi interest combin salient predictor influenc context result comparison ct tt architectur prosodi structur problem data experi result merg homogen rule set weight rule assign weight transduc merg rule weight finit state automata gener prosodi gener multimedia applic system statu plan work system statu plan work prosodi model deep semant prosodi model develop gener ct gener evalu schedul complet prosodi model deep semant prosodi model develop gener ct tool improv contribut relat work nlg theori system inton theori tt system ct research relat work fsm fsm merg homogen rule set fsm gener prosodi schedul tabl ii list figur ct input spoken dialogu system semant gener system architectur plan magic output sentenc planner prosod rule disagr judg dtd inton featur rule set prosod model iii list tabl patient record medic domain featur extract surg perform model model select featur versu complet model system perform window size perform model versu comparison ct tt featur perform perform cross valid perform cross valid schedul complet iv abstract aim design develop gener speech synthesi system produc speech semant integr languag gener speech synthesi focu issu emploi newli accur syntact inform produc natur languag gener system improv qualiti speech extend exist gener natur languag gener system gener tool integr rule induct ct architectur separ prosod rule prosodi gener compon design speech interfac languag facilit flexibl open ct architectur build prosodi model explor multimedia synchron unlik previou ct util linguist constraint provid gener natur languag gener emploi automat prosodi model approach provid quantit measur focu design flexibl open ct architectur illustr issu exampl specif ct applic produc coordin spoken languag graphic present medic domain chapter introduct motiv peopl speech enabl commun long time develop speech speech interfac applic commonplac commerci system voic interfac inform includ provid airlin train ticket person credit inform applic brought tremend benefit busi involv current speech technolog leav lot room improv error rate speech recognit unrestrict domain frequent high practic applic speech synthesi system low intellig natur commun machin easi human focu improv natur intellig speech framework gener input system determin phrase commun speech ct system produc spoken report data test ct system part multimedia present gener system cardiac intens care patient magic produc spoken languag present patient statu multimedia environ patient record larg medic ct system output channel spoken dialogu system user queri render spoken languag ct addit output channel inform system commun environ input concept ct system entiti input concept patient medic includ patient statu treatment receiv tabl show simplifi patient record field semant relationship entiti unambigu defin creat speech gener magic produc output jone year diabet patient undergo figur show input concept spoken bypass surgeri id gender ag surgeri joan jone femal diabet tabl patient record medic domain chapter introduct figur ct input spoken dialogu system dialogu train schedul inform litman input concept organ templat fill critic inform spoken dialogu system gener output east coast express train leav boston august arriv york citi gener receiv attent past decad exist speech synthesi system system tt system gener speech text semant input text produc separ natur languag gener human capabl speech synthesi system li util underli semant syntact pragmat inform analyz suppli inform tt system limit amount syntact constitu structur inform accur due limit current text analysi technolog lack full understand input text major reason poor tt qualiti todai unlik ct possess set rich accur underli inform record tabl nlg compon provid text syntact semant structur speech synthesi compon figur show semant structur produc nlg system nlg system produc inform shown figur nlg system produc hierarch deep semant pragmat inform rich accur ct system capabl gener speech tt system major motiv work make newli inform produc natur languag gener system improv natur intellig speech overview plan contribut major goal improv qualiti speech shown previou research collect speech featur relat sentenc major element natur intellig speech provid accur prosodi model make underli syntact pragmat constraint produc nlg system syntact structur constraint produc wide natur languag gener produc prosodi model extend exist nlg system spoken languag gener tool variat tempo rhythm overview plan contribut lex figur semant ad prosodi gener compon semant syntact constraint produc sententi level build prosodi model hierarch structur sententi semant constraint similar featur studi tt interest studi deep semant constraint prosodi inform text analysi direct includ speech corpu collect magic project studi prosodi commun abnorm unexpect inform goal improv speech interest design ct system reusabl appli domain integr automat prosodi model compon ct architectur speech gener implement fix prosodi model provid prosod model interpret appli prosodi model compon automat deriv set rule base corpu speech corpu speech gener compon unchang portabl gener compon automat prosodi model compon investig pattern facilit reusabl speech gener compon concern design open ct architectur integr ct compon ct tt produc speech signal ct system emploi tt system tt system requir input implement fix format ct specif tt feasibl standard gener markup languag design speech integr markup languag facilit easi integr repres tobi beckman inton featur tt system realiz tobi inton featur demonstr prosodi model built facilit chapter introduct multimedia coordin graphic speech action spatial temporarili synchron order gener coordin multimedia present object refer speech highlight expect action start end time prosod phrase boundari inform add extra place provid flexibl tempor constraint speech major contribut work identifi analyz sententi semant syntact constraint produc nlg system exemplifi prosodi construct domainindepend prosodi gener system gener ct tool produc extend natur languag gener tool prosodi gener compon provid gener ct gener tool identifi constraint languag hierarch segment boundari deep semant prosodi featur typic produc content planner nlg system featur explor prosodi model facilit design reusabl speech gener compon design ct architectur integr automat prosodi rule learn compon emploi automat featur select procedur prosod rule concentr salient featur featur select total reli human result procedur facilit machin learn task framework systemat combin rule gener design prototyp speech integr markup languag interfac languag integr ct compon featur result open ct architectur provid flexibl tempor constraint speech facilit multimedia synchron structur chapter overview system architectur introduct major modul chapter describ build prosodi model corpu analysi machin learn techniqu includ section acquir domain independ prosodi rule sententi constraint provid nlg acquir prosodi rule commun hierarch merg homogen rule finit state machin chapter explain prosodi model produc abstract prosodi chapter illustr specif applic learn prosodi model multimedia synchron chapter summar current statu futur plan chapter summari contribut work limit place relat work section exampl finit state transduc applic chapter architectur gener architectur figur show gener architectur system major compon prosodi model compon deriv prosodi rule speech speech gener compon produc speech input concept speech gener nlg system produc semant grammat sentenc input prosodi gener gener prosodi sentenc rule provid prosodi tt system produc speech prosod annot text addit design interfac integr nlg prosodi gener tt compon describ compon detail nlg compon nlg compon construct semant syntact structur text input concept major subcompon nlg content sentenc lexic surfac realiz prosodi model speech corpu nlg compon prosodi gener gener compon concept speech structur text annot text prosodi model compon machin learn figur gener system architectur chapter architectur overview detail view demograph care plan blood product line therapi figur plan magic content planner organ semant input group order coher structur maintain nlg system approach produc hierarch structur plan librari store plan select base constraint plan doctor figur show plan magic present includ overview detail view demograph inform line patient therapi receiv list detail view includ blood product patient vital lab care plan addit inform includ event detect system detect high blood requir treatment event present sentenc planner decid content sentenc semant constraint semant unit sentenc syntact constraint unit sentenc planner decid inform fit sentenc sentenc planner core sentenc structur augment addit depend relat core structur semant syntact constraint realiz inform input shown tabl sentenc planner produc output figur domain knowledg lexic knowledg lexic modul select word desir semant expect syntact function commun semant unit concept figur properti concept sentenc planner decid convei modifi lexic search find realiz adject noun lexic decid commun adject form convei noun form preposit lexic decid adject form lead realiz lexic contextu inform realiz refer express concept realiz determin depend previou refer output lexic sentenc figur shown figur prefix mean word word commun concept prosodi model compon figur output sentenc planner surfac realiz compon gener sentenc base constraint produc previou compon grammar continu produc output text jone year diabet patient undergo realiz compon independ applic gener realiz tool map semant structur shown figur syntact structur sentenc gener process requir extens knowledg support domain specif lexic semant syntact order make proper prosodi model compon build prosodi model automat base speech corpu analysi aim formul map linguist constraint prosod constraint automat prosod featur prosodi model includ inton pitch phrase boundari tone break index pitch accent inton make word syllabl stream speech correspond local maximum minimum fundament frequenc valu tobi beckman appar tone target accent syllabl upper part speaker pitch rang appar tone target accent syllabl lowest part speaker pitch low tone target accent syllabl immedi sharp rise peak upper part speaker pitch high peak target accent syllabl immedi sharp rise vallei lowest part speaker pitch clear step accent syllabl high pitch account high phrasal tone end phrase high pitch accent phrase phrase accent pitch level extend tone break index chapter architectur figur prosod rule nuclear accent intermedi end intermedi phrase boundari tone tone type end inton low boundari high boundari tone break index perceiv junctur adjac word word strong phrase accent boundari intermedi phrase inton phrase boundari tobi interest model pitch rang variat speak rate variat prosodi model figur show exampl prosodi rule system aim discov rule mean current word pitch accent current word rule mean boundari word boundari word break index current word prosodi gener compon prosodi gener compon produc prosod inform constraint produc natur languag gener compon prosodi model creat prosodi model compon implement prosodi gener compon straightforward output nlg system automat extract languag constraint requir prosodi model word inform prosodi system extract po tag word input system construct finit state automaton input input finit state automaton prosodi finit state transduc construct prosod rule deriv prosodi model compon output finit state automaton repres regular express prosod featur gener output word prosod featur transform tt independ interfac languag order put nlg prosodi gener tt system design prototyp speech integr markup languag pan base standard gener markup languag mark syntact structur semant structur systemat output nlg system nlg system produc markup approach languag gener interfac prosodi gener compon tt annot text prosod tobi inton featur annot text produc speech tt system chapter learn prosod rule introduct address deriv prosod rule automat speech corpu machin learn techniqu research investig inton semant syntact deep semant inform concentr work includ build prosodi model citat form sentenc syntact semant constraint gener pan build prosodi model magic hierarch topic structur chapter discuss work plan build prosodi model deep semant prosodi model result present chapter obtain cross valid train set prosodi citat style sentenc problem explor sententi semant syntact semant syntact predict prosodi interest semant semant prosodi data isol cover wide rang linguist creat test case develop testb annot output nativ speaker read sentenc speech record dat record environ result speech transcrib base tobi beckman break pitch phrase accent boundari tone label speech analysi tool split corpu train prosodi model test result left repeat procedur time present averag error rate chapter learn prosod rule categori label descript exampl bb semant constitu boundari word particip boundari circumst boundari ba semant constitu boundari word particip boundari circumst boundari semant semant featur word semant featur sp semant role plai parent semant constitu word sp gener semant role plai parent semant constitu word po part speech word common proper noun syntact gpo gener part speech word noun gpo common noun proper noun syntact function word part speech parent semant constitu word gener part speech parent semant constitu word syntact syntact function parent semant constitu word complement misc posit word sentenc lex lexic form word tabl featur extract surg figur page show input function descript sentenc jone year diabet patient undergo fd unifi syntact result fd includ hundr syntact lexic featur pick featur manual studi featur shown tabl close relat previou research inform produc semant role inform relev speech synthesi investig chosen featur applic word avoid unspecifi valu train data extract simpli appli verb tabl includ descript featur divid describ syntact properti semant constitu syntact function semant constitu featur attempt aggreg smooth data hand base linguist knowledg expect word posit actual word extract directli linear string featur tabl inton featur predictor inton featur reason includ inton featur predictor assess interact prosod featur predict pitch break index word accent final corpu sentenc includ noun sentenc averag length word base speech corpu singl baselin perform achiev pitch accent addit predictor break phrase boundari tone break index predictor pitch accent model prosodi citat style sentenc model pitch accent phrase accent boundari tone break index baselin simpl model semant model syntact model complet model tabl perform model frequent class break index break index pitch accent phrase accent phrase boundari tone boundari baselin boundari tone high boundari tone end sentenc train data speaker inton briefli discuss experi experi data speaker baselin conduct experi prosodi result show model significantli improv baselin model result suggest featur select hand irrelev emploi automat featur select procedur salient predictor prosodi model reduct featur set facilit experi machin learn perform investig sententi context improv prosodi model perform compar result similar work comparison task complex corpora order compar directli ct prosodi model advantag tt design experi result show clear advantag ct prosodi model experi interest combin set experi design test featur contribut inton newli semant featur inton interest find select featur essenti make inton start simpl model includ type semant constitu boundari semant constitu boundari boundari primari semant role secondari semant role type experi test model limit number paramet appli ripper base rule induct simpl model yield rule significantli improv perform baselin model accuraci rule learn break index averag improv baselin inton featur ran addit addit syntact featur addit semant featur result show model behav similarli inton statist semant model featur addit syntact model addit ran experi inton featur perform achiev predictor similar model chapter learn prosod rule model select featur drop featur model accuraci rule condit initi initi initi break index bb ba gpo lex po sp accent pitch accent bb ba po gpo index lex sp phrase accent bb ba po gpo accent lex sp boundari tone bb ba lex po gpo sp accent tabl model select featur versu complet model statist tabl show result model experi show model receiv improv baselin model model suggest redund featur complic model fail achiev improv simpl model addit semant inform impact prosodi conclud set experi featur improv perform featur inton model salient predictor ripper abil select predictor rule clear featur ripper rule tree base approach sensit experi suggest irrelev featur damag perform ripper model featur perform semant model reduc featur model resourc demand experi requir manual annot corpu reduc featur prepar larger corpu experi find salient predictor elimin redund irrelev prosodi model result studi gain understand relat featur inton break index pitch categor gener linear model gener linear model extend linear model accommod distribut transform linear map inton featur binari valu requir framework pitch accent map result data analyz gener linear model iter refin predictor select drop base model fit data break index model achiev perform initi model suggest predict break index highli correl featur model map process remov distinct origin simplifi model perform origin model confirm simplifi model perform simplifi model test ripper learn rule prosodi citat style sentenc size break index pitch accent phrase accent boundari tone accuraci rule accuraci rule accuraci rule accuraci rule tabl system perform window size base select predictor tabl show perform model versu origin model shown half predictor drop factor model achiev similar perform boundari accuraci rule learn model higher origin model accuraci slightli close model statist interest observ pitch accent model complic model twelv featur includ semant inton featur model fewer featur boundari tone model simplest featur select half featur system achiev compar result similar experi data combin speaker addit variabl call ad model data analyz gener linear model result show consist select system import factor model mean speaker result inton model base experi singl speaker combin data speaker singl model carri experi speaker futur work influenc context simplifi model acquir previou experi reduc complex remain experi design context inton featur isol word context adjac inton intermedi phrase boundari assign boundari boundari assign order account type extract featur word window size featur previou adjac adjac word current word extract salient predictor select previou experi explor result tabl show context import improv perform inton model perform achiev window size accuraci break phrase accent boundari tone shown accuraci pitch accent model perform phrase accent pitch accent model window improv significantli model context inform chapter learn prosod rule featur predict model categori corpu approach perform simpl sentenc automat pitch accent hirschberg simpl sentenc manual hirschberg ati simpl sentenc automat prosod phrase ati question automat boundari sentenc manual hirschberg ap automat tabl perform model versu result unlik previou prosodi linguist featur provid gener nlg tool build inton model rule consist perform inton featur accuraci break phrase accent boundari tone model pitch model accuraci yield improv baselin model compar tt evalu tabl show comparison result close relat work compar pitch accent model pitch accent model present hirschberg higher accuraci pitch accent model complex sentenc corpora similar classif task simpler classifi pitch accent categori hirschberg pitch accent test data corpora ati domain broadcast prosod phrase boundari wang hirschberg model similar result corpu includ question ati classifi data inton phrase boundari break index classifi boundari categori compar result work system speech corpora conduct classif number carri experi compar ct prosodi model versu tt prosodi model corpu task comparison ct tt architectur ct question sound inform tt true realiti bit compar perform input featur produc nlg system featur produc typic text analysi tool featur produc nlg system featur ct featur deriv text analysi tool inform typic tt system test featur produc nlg system perform inform produc text analysi tool prosodi model ct system demonstr advantag tt speech corpu studi corpu section citat form sentenc prosodi input featur semant syntact constitu boundari compar perform learn prosodi model po tag produc typic po brill tagger compar perform prosodi model prosodi structur featur sourc break index pitch accent phrase accent boundari tone po brill tagger boundari collin parser po boundari tagger parser tabl comparison ct tt featur perform semant constitu boundari produc syntact constitu boundari produc typic syntact collin probabilist parser tagger parser typic text analysi tool perform compar model po boundari inform result tabl show po big po model po tag produc brill tagger perform bit po tag produc perform brill po tag system gener regular sentenc corpu accur po tag produc advantag po tag produc tagger tag gener gener lack detail po inform contribut statist conclud perform tag set compar futur experi test po tag produc nlg show advantag complex sentenc semant constitu boundari produc strong influenc prosod boundari achiev perform break phrase accent boundari tone syntact boundari inform produc syntact parser suggest inform semant constitu predict prosod featur error produc parser hurt perform semant constitu boundari produc predictor prosod phrase boundari featur featur outperform featur produc text analysi tool pair underlin statist result show ct research find featur relat citat form sentenc prosodi semant ct show influenc system perform prosodi structur problem previou research prosodi synthesi shown prosod pitch structur unclear featur systemat speech gener current speech synthesi system simpl insert long major segment pitch rang begin segment studi chapter learn prosod rule structur produc inton featur relat research inton featur predictor structur grosz hirschberg inton featur successfulli predict local global structur accuraci structur predictor inton featur rule identifi structur directli gener prosod featur undetermin rule prosodi accuraci assum pitch pitch rang speak speak rate length identifi structur typic rule predict structur length rang major boundari length pitch variat minor boundari length segment boundari featur strongli featur pick rule rule prosodi major predict length pitch rang predict prosod featur major boundari prosod featur present rule predict inappropri rule directli prosodi gener explain learn rule map structur prosodi directli structur repres hierarch topic structur smallest unit hierarchi inton phrase ct intend structur creat content plan modul nlg system corpu analysi human identifi structur exist speech corpu emploi formal rst mann grosz sidner theori grosz achiev high agreement relat simplifi topic agreement judg problemat describ experi build prosodi gener rule automat hierarch structur data separ minut record spontan speech male femal speaker collect cardiac intens care unit columbia medic center record physician give patient statu icu major part speech physician interrupt question record environ beep medic equip occur frequent background speech record dat judg identifi hierarch topic structur listen record provid orthograph transcript materi transcript separ inton phrase manual boundari inton phrase mark comma place candid posit segment boundari prosod featur shown relat structur previou research hirschberg label prosod featur pitch approxim maximum vowel accent syllabl inton phrase pitch rang prosodi structur figur disagr judg ratio pitch rang previou inton phrase divid current inton phrase speak averag speed inton phrase speak rate ratio speak rate previou inton phrase divid current inton phrase length current inton phrase pitch contour type boundari boundari tone clear final clear rise fall end inton phrase miscellan experi deriv prosod rule commun segment boundari corpu judg identifi topic answer figur histogram segment boundari judg clip level boundari hierarch topic structur rang largest segment boundari mean boundari adjac inton phrase number boundari combin result normal boundari number maximum boundari judg prosod pitch target featur prosodi model base predict continu numer valu systemat transform valu categor valu featur normal data gener speaker combin pitch map valu high mild high mild low low averag half chapter learn prosod rule featur accuraci averag rule averag condit rule contour type length pitch rang pitch rang variat speak rate speak rate variat tabl perform cross valid averag half speak rate transform categori pitch rang variat speak rate map averag valu averag valu larger separ baselin speaker prosod featur achiev frequent pitch pitch rang speak speak rate pitch contour length speaker similar distribut start ripper learn map rule structur individu prosod featur call learn rule initi prosod segment rule result figur show pitch contour model speak rate model significantli improv baselin model statist improv interest pitch contour signal type segment boundari show similar research hirschberg explan low level segment list format typic segment fluid unit unit cell typic speaker rise tone segment media boundari fall tone segment final boundari pitch contour type segment boundari rule weak directli practic constraint attempt contextu inform adjac segment boundari inform result prosod model major segment boundari previou inton segment boundari current inton phrase boundari major segment boundari inton phrase current inton phrase form major segment expect pitch rang current inton phrase pitch contour type signal continu end current inton phrase aim find set prosod segment rule contextu inform improv perform ripper learn rule window current inton phrase tabl show perform model cross valid result suggest contextu inform improv perform pitch contour improv model achiev improv merg homogen rule set featur accuraci averag rule averag condit pre rule contour type length pitch rang pitch rang variat speak rate speak rate variat tabl perform cross valid result experi show structur influenc prosod featur segment inform systemat improv system perform baselin result inform contextu account lot variat prosod featur accuraci prosod model similar research area grosz hirschberg similar prosod featur predict structur read speech accuraci mention task rule directli prosodi gener direct assess rule prosodi gener read spontan speech investig correl inton featur structur found genr result evid construct rule gener inton structur direct quantit measur success rate construct directli compar result merg homogen rule set order avoid tree train data set cross valid measur gener error rule set prosodi model call homogen rule set ident larg train set rule rule set rule partial conflict reason cross build prosod model gener unknown exampl combin rule rule set systemat transduc weight rule automata theori gener mathemat framework type rule interest rule compil gener algorithm combin transduc build complex machin simpler access machin librari mohri gener grammar librari develop lab chapter learn prosod rule research rule learn ripper repres weight rule mohri rule interpret replac repres left context applic rule regular express alphabet ration power regular express alphabet rule term weight weight correspond probabl type rule consid depend obligatori direct left left simultan applic weight rule compil weight transduc mohri tool provid librari compil rule weight transduc illustr transform merg process shown appendix assign weight transduc number ripper learn rule posit neg exampl cover corpu number produc weight transduc gener rule number posit number neg total number exampl weight neg logarithm probabl rule merg rule weight finit state automata construct transduc rule set composit transduc transduc rule set repres ruleset number rule rule composit transduc rule merg result rule set simpli weight disjunct transduc neg logarithm probabl correct predict rule set union oper appli combin transduc find probabl prosodi output input automata transduc merg rule set appli algorithm weight calcul determin probabl output chapter gener prosodi gener merg homogen rule set build complet prosodi model includ prosod featur predict prosodi model citat form rule set pitch phrase boundari tone break index creat finit state transduc prosod featur composit individu finit state transduc citat form sentenc prosodi final finit state transduc fsm fsm fsm fsm bt fsm bi fsm transduc pitch fsm transduc phrase fsm bt transduc boundari fsm bi transduc break index composit oper transduc finit state transduc prosod prosodi gener process straightforward fsm finit automaton output prosodi gener compon fsm fsm fsm appendix simpl illustr gener process output prosodi gener compon design prosodi output prosodi gener compon flexibl integr tt system tt system requir input output design specif tt stop work tt system input similar concern motiv research design tt markup includ sproat java speech markup languag spoken text markup languag speech synthesi markup languag taylor chapter gener bt bi figur dtd inton featur pan speech integr markup languag address integr ct prosodi gener tt compon design standard output nlg system emploi nlg system standard output includ tag syntact inform relat speech product easi task research group work close specif resourc initi project assembl resourc support research compat exist ongo relat incorpor result lot inform requir speech gener compon semant syntact inform inform cover prototyp tt incorpor featur defin repres exist tt markup languag defin featur applic prosodi gener compon produc detail specif inton featur exist tt markup languag repres featur pitch boundari tone add tobi inton featur output car mean pitch mean phrase bt mean boundari tone bi mean break index formal document type definit repres tobi inton featur shown figur chapter multimedia applic ct system design magic system abstract gener intens testb system gener multimedia present inform caregiv statu patient undergon bypass surgeri media gener graphic gener speech gener pan text gener text gener fly show prosodi model built facilit tempor synchron multimedia present magic commun goal convei patient statu caregiv anim graphic speech simultan achiev goal multipl item displai graphic magic synchron speech highlight user focu current topic find illustr inform refer speech order achiev coordin work negoti arriv order spoken refer compat order highlight highlight order regular jump speech natur addit coordin spoken refer synchron time item stai highlight verbal surfac structur sentenc produc base compat sentenc speech determin default durat end time refer commun object gener base time inform phonem produc speech inform synchron speech graphic action durat spoken refer synchron highlight occur quickli blink fashion avoid durat spoken refer predict ad speech intellig natur overlap highlight spoken materi refer speech gener wai adjust speech durat conflict speech graphic constraint durat speech gener comput length rang prosod constitu boundari base result break index assign default length type break index chapter multimedia applic vari greatli natur intellig speech gener adjust durat spoken refer modifi durat surround prosod phrase boundari adjust time constraint chang speak rate natur peopl adjust speak rate frequent emphasi inform base prosodi model built speak assign default speak rate categori prosodi model section type speech adjust speak rate significantli speech qualiti adjust durat word occur spoken refer graphic object word correspond commun object present correspond object depict graphic sentenc pair year patient medic histori boundari refer commun object word pair word speech gener determin word natur link spoken refer sentenc word spoken refer refer ag highlight ag synchron refer ag synchron graphic highlight graphic gener turn highlight retain highlight refer word spoken remain highlight switch highlight graphic object refer refer ag highlight combin method turn highlight short time undesir graphic point view inform prosod constitu boundari provid input synchron word spoken word break index greater form singl unit unit spoken spoken refer break index greater graphic highlight stai refer ag prosod model systemat produc tempor constraint speech refer adjust tempor constraint base prosodi model make significantli natur intellig provid flexibl tempor constraint speech facilit multimedia coordin futur direct speech gener multimedia synchron investig graphic constraint speech gener graphic highlight influenc accent explor prosod featur tempor synchron result vowel durat model adjust tempor constraint speech chapter system statu plan work system statu work establish gener framework creat system shown feasibl machin learn techniqu automat deriv prosodi rule fsm base approach creat prosodi model individu rule set appli techniqu area deriv prosodi model sententi semant syntact constraint produc provid evalu perform prosod model learn result intend learn model develop ct gener tool show deriv prosodi rule map hierarch structur prosod featur shown contextu segment inform significantli improv model baselin model show strong correl structur prosodi inform shown perform prosodi model structur gener good implement directli prosodi gener compon put futur collect speech corpu magic begin conduct experi studi deep semant inform influenc reach result plan work direct comput featur provid languag gener influenc prosodi focu prosodi model constraint explor creat prosodi model investig inton commun deep semant constraint concentr typic featur produc languag gener extens studi tt research prosodi model spontan speech plan prepar speech experi magic medic doctor requir give formal present experi natur extens practic chapter system statu plan work prosodi model perform structur prosodi model learn good practic problem structur weak account prosod variat pragmat jointli predict prosod variat direct includ rst relat prosodi model structur strongli correl pitch contour model explan relev segment structur corpu sequenc relat commun inton pitch contour appli relat pragmat constraint identifi read linguist literatur listen record problem current design inconsist human judg identifi structur inconsist persist pursu analysi task structur produc nlg system uniqu inconsist involv formal speech target speech produc magic design avoid inconsist result plan sentenc produc nlg system subject read speaker fulli awar structur produc system read mark structur speaker familiar materi structur process similar movi product director commun script produc writer nlg audienc consult expert avoid problem design design speaker construct content structur speaker read inform structur speaker similar type movi director writer produc decid act act convei scenario design design problem understand scenario specif custom magic result directli implement magic design make speaker understand topic structur ensur intend structur part research determin experi deep semant prosodi model focu research find deep semant inform prosodi inton commun deep semant inform lot data systemat categor class medic infer base patient blood patient categor interest find prosodi notifi listen abnorm inform plan work success reason physician gener present front patient bypass surgeri voic calm emot sever patient data big challeng captur inton signal abnorm content word order pursu plan design experi similar prosodi experi basic piec inform categor abnorm data convei categor featur open question experi speaker awar abnorm defin term accur categor consist speaker read present experi time prosodi model record speaker read present investig inform convei prosod lexic prosod featur plan studi includ pitch accent type locat speak rate lexic convei abnorm ripper explor automat commun strategi convei type inform type semant convei prosod mark lexic mark learn deep semant prosodi model systemat convei type semant inform develop gener ct gener plan develop ct tool augment exist languag gener packag prosodi gener compon semant syntact constraint sentenc prosodi model build includ prosodi model develop citat style sentenc incorpor exist result tool prosodi refin exist prosodi model extend current speech corpu complex sentenc major work task includ collect speech annot inton featur repeat experi section measur result implement prosodi gener compon evalu build prosodi model ct gener evalu system perform prosodi model provid detail quantit measur perform object assess result achiev evalu speech qualiti produc speech gener system prosodi model sentenc disambigu conduct perceptu experi subject evalu natur intellig version speech prosodi model sentenc show clear advantag ct system tt system sentenc pair word sequenc syntact tt chapter system statu plan work inform produc inton analyz sentenc produc syntact structur produc inton listen perceiv intend structur tt unfair evalu base specif task perform perceptu test test perform design experi complic peopl sensit prosod subject prefer care ct improv shown result plan conduct evalu final stage work order assess perform global local schedul complet ct research broad area involv gener issu system design prosodi model creat prosodi model gener includ seri design collect speech annot conduct corpu implement prosodi model task depend time individu task item list complet time item success dissert assign higher prioriti item mark asterisk list plan concentr prosodi model deep semant prosodi depend yield result time estim task shown appendix prosodi model design experi structur identifi nlg system speaker speaker present collect present speech corpu annot present speech corpu prosodi pragmat inform conduct machin learn experi data evalu prosodi model implement model magic evalu ct system prosodi model deep semant prosodi model identifi deep semant featur prosod featur studi design experi collect data schedul complet annot speech corpu prosodi semant lexic inform machin learn build deep semant prosodi model evalu prosodi model deriv implement deep semant prosodi model magic evalu ct system deep semant prosodi model develop gener ct tool extend current speech corpu complex sentenc annot speech corpu prosodi sententi semant syntact featur repeat experi evalu prosodi model implement system convert output regular convert regular express fsm input fsm prosodi model gener output prosod featur convert output format evalu system prosodi model improv boost improv perform machin learn tool explor automat featur select system refin prosodi rule learn ad heurist long distanc depend captur current prosodi model compon appli prosodi model multimedia synchron built prosodi model vowel model guid specif speech tempor constraint extend prototyp featur identifi research chapter contribut focu build prosodi map linguist constraint semant syntact level automat machin learn improv speech qualiti featur typic inform produc nlg system featur explor fulli investig previou tt research preliminari result show approach result studi natur extend build domain independ gener ct gener tool augment exist languag gener tool prosodi gener compon process build prosodi automat featur select procedur total reli human intuit pick languag constraint fsm base approach systemat build prosodi model rule learn ripper build prosodi model gener individu rule set prosodi gener process automat standard fsm oper gener architectur creat system integr automat prosod rule induct compon make separ domain depend prosod rule domain independ speech gener compon flexibl speech gener compon design speech integr markup languag make easier integr ct compon show prosodi model built facilit multimedia synchron aspect util prosodi model creat appendix relat work gener research build close relat speech synthesi natur languag gener system nlg system make extens theori techniqu develop area devot section nlg theori section inton theori tt section latest develop ct system nlg theori system typic nlg system consist strateg part decid tactic part decid part separ pipelin integr compon content planner make content relev commun explicitli convei languag make tactic organ content high level commun goal achiev coher major approach plan schema base approach schema repres common pattern strategi nest fill produc coher paragraph rhetor structur theori mann approach moor common rhetor structur structur base rhetor predic repres relat level inform unit rhetor relat primari satellit auxiliari materi support nucleu approach popular plan languag media share plan magic realiz compon transform input concept relat phrase sentenc make extens lexic constraint grammar languag depend function unif wide approach design realiz nlg packag function featur function descript nest pair merg unif oper linguist constraint appendix relat work lexic constraint ad fd systemat constraint resolut uniformli concern inform provid nlg system give descript inform repres typic nlg system point exist nlg tool facilit ct task mention linguist constraint level formal inform prosodi gener rst theori theori grosz influenti theori organ hierarch structur unit level relat rhetor relat organ hierarch structur unit hierarchi underli intent wai relat intent domin relat relat content plan compon nlg system produc hierarch structur young young approach produc hierarch structur hierarch structur produc schema focu common element prosodi model emploi hierarch topic structur semant theori adopt nlg system semant grammar primarili base system grammar system process realiz core semant structur obligatori semant call process particip convei involv process process semant role call circumst circumst answer question system grammar nlg system import grammar repres semant syntact phrase structur grammar pollard semant semant role inform explicitli syntact inform nlg system adopt semant choic nlg tool semant inform prosodi gener compon semant inform mention surfac semant interest deep semant semant focu semant focu describ prosod promin serv pragmat semant function semant focu phonet semant pragmat interpret model semant focu success semant constraint kind includ type inform select restrict grammar formal explor techniqu syntact gener provid similar syntact syntact constitu syntact function repres grammar formal includ lexic function grammar kaplan tree adjoin grammar joshi categor grammar softwar packag implement implement base function unif inton theori tt system primarili nlg tool wide gener nlg system emploi function unif linguist constraint stage accumul final function descript semant syntact constraint speech synthesi singl final fd final fd natur place investig languag constraint provid gener nlg tool inton theori tt system prosodi inton phenomenon extens studi research area long time influenti work inton theori includ chomski work adopt tobi beckman base inton theori tobi inton pitch contour set inton featur pitch contour sentenc form inton phrase inton phrase consist intermedi phrase boundari tone intermedi phrase pitch accent phrase accent base featur critic decid placement inton intermedi phrase boundari index tobi annot convent beckman type boundari phrase accent boundari local maximum minimum pitch expect fulli recov contour inton featur prosodi model predict inton featur syntact constraint produc nlg compon literatur build comput model prosodi wide describ close relat work prosodi model linguist constraint previou studi suggest inform inton silverman model paragraph prosodi tt made assumpt rule paragraph level prosodi base linguist observ design percept experi verifi valid paragraph prosodi model major featur model includ pitch rang variat model basic linear model research hierarch structur prosodi model hirschberg hirschberg theori adopt grosz sidner theori result confirm global local structur reliabl identifi prosod featur result show presenc absenc inton promin combin lexic syntact inform mark shift attent local global level structur prosod featur studi experi includ pitch pitch pitch rang amplitud speak rate studi role speech synthesi applic extens literatur syntact structur inton appendix relat work set rule determin neutral prosod phrase research improv manual develop rule acquir prosod phrase rule machin learn tool wang classif regress tree produc tree predict locat inton phrase boundari similar method emploi predict pitch accent tt featur exploit includ part speech inform statu cue phrase relat work prosodi syntact structur includ prosod constitu boundari deriv acoust length result disambigu mean syntact ambigu sentenc pair relat work syntax prosod phrase boundari includ ct research limit model inton ct davi young fawcett implement set inton rule produc inton base semant polar adopt hallidai inton theori emploi framework system function grammar davi set inton assign rule design specif domain direct assist inform repres messag result show clear advantag simpl tt approach prevost produc contextu contrast accent concern system emploi gener architectur base combinatori categor grammar provid uniform platform repres syntact inton structur unlik previou ct system emploi rule system design specif applic relat work briefli descript system tool research emploi base standard gener markup languag prosodi model speech integr markup languag languag pan design uniform interfac integr nlg prosodi tt speech analysi tool prosodi label wave entrop research tobi beckman align machin learn tool emploi acquir prosodi rule ripper emploi statist method base gener linear model provid chamber packag select salient predictor input ripper relat work standard finit state machin librari mohri combin homogen induct rule librari compil prosodi rule fsm automat appendix fsm fsm merg homogen rule set figur show hypothet rule set illustr merg rule set finit state machin rule set rule number rule exampl cover rule corpu assum featur left hand side part speech boundari assum po boundari target featur pitch accent input car repres regular express det adj noun recent compil weight context depend rule weight finit state transduc includ mohri kaplan order make repres ripper learn rule context depend rewrit regular left context regular express rewrit rule transform finit state transduc automat task simpl make context depend rule compil standard rule set cl rule set cl figur rule set fsm gener prosodi pitch phrase boundari break index figur prosod model librari develop lab context depend rewrit rule rule figur noun noun mean restrict left context rule transform finit state finit state transduc rule set composit individu finit state transduc merg rule weight disjunct finit state transduc built rule set fsm gener prosodi assum predictor left hand side prosod po boundari po boundari prosod featur pitch accent phrase accent break index boundari tone assum rule prosod model hypothet prosod rule prosod model shown figur input input regular express reg input construct concaten individu regular express word reg det reg adj reg car noun reg input reg reg reg car mean concaten mean disjunct input regular express construct step word input separ step appendix fsm illustr compil regular express finit state automaton trivial assum input finit state machin fsm input fsm input pitch accent repres finit state output regular express reg det reg adj reg noun reg reg reg reg continu result phrase accent boundari tone break index final regular express repres reg det reg adj reg noun reg reg reg reg result input fsm input composit prosodi model assign predict prosod featur word input process automat fsm librari appendix schedul tabl year month implement sept jan prosodi model write paper acl feb jun semant prosodi model juli oct implement ct tool nov dec evalu thesi write jan mar thesi write write paper acl april tabl schedul complet bibliographi jf allen natur languag understand menlo prosod pattern spoken studi correl prosodi grammar lund function pitch rang spontan read speech present linguist societi america annual fitzpatrick comput grammar prosod phrase english comput john bateman grammar text escal exchang aaai workshop text plan page st beckman mari beckman julia hirschberg tobi annot convent technic ohio state theori pitch accent english accent predict inton jh ra cj stone classif regress tree wadsworth eric brill advanc part speech tag nation confer artifici brown prosod structur distinct model page sad emot comput voic speech tech page bibliographi chamber john chamber hasti statist model wadsworth advanc book pacif chomski chomski hall morri sound pattern english harper william cohen fast rule induct intern confer machin michael collin statist parser base bigram lexic depend annual meet santa steve kathi michel tobia jame yong negoti autom gener tempor multimedia present acm multimedia page robert dale gener refer express domain object process phd centr cognit synthesi spoken messag semant intern confer comput page davi davi hirschberg assign inton featur spoken annual meet associ comput page elhadad argument control lexic function unif implement phd columbia entrop research entrop research manual version entrop research robin fawcett comput gener speech semant motiv inton intern workshop natur languag page gener linear model statist theori chapter chapman perform psycholinguist linguist cognit grosz grosz hirschberg inton characterist structur intern confer spoken languag page grosz barbara grosz candac sidner structur proper treatment interrupt ninth intern joint confer artifici page lo bibliographi grosz barbara grosz candac sidner structur comput hallidai spoken inton oxford michael hallidai introduct function grammar edward hirschberg julia hirschberg barbara grosz inton featur local global structur speech natur languag page hirschberg julia christin barbara grosz convei structur inton variat workshop spoken dialogu julia hirschberg pitch accent predict inton promin text artifici merl horn model english sentenc work paper lund depart linguist joshi joshi yve schabe grammar lexic grammar tree automata languag elsevi scienc publish joshi introduct grammar alexi mathemat page john kaplan ronald kaplan joan formal system grammat joan mental grammat chapter mit kaplan ronald kaplan martin kai regular model phonolog rule system comput martin kai function unif formal machin translat tenth intern confer comput linguist annual meet page stanford robert inton phonolog cambridg benoit owen fast portabl realiz text gener system confer appli natur languag mark liberman inton system english phd massachusett institut bibliographi litman dian marilyn walker evalu strategi web spoken dialogu agent mann william mann sandra thompson rhetor structur descript construct text structur gerard natur languag result artifici psycholog page mark mayburi comput model explan tactic mission planner symposium command control page mark mayburi enhanc explan coher rhetor strategi fourth european meet page april gener linear model chapman mckeown text strategi focu constraint gener natur languag text cambridg pragmat interpret english speech phd texa mohri mohri richard sproat compil weight rewrit rule meet associ comput linguist santa california mohri fernando michael rilei ration design weight finit state transduc librari workshop implement mohri fernando michael rilei ration design weight transduc librari lectur note comput mohri weight grammar prepar moor moor cecil pari plan text advisori captur intent rhetor inform comput decemb christin barbara julia hirschberg structur spoken studi speech corpora aaai spring symposium empir method interpret christin comput process inton function prosodi perspect phd harvard hierarch stochast model automat predict prosod boundari locat comput bibliographi rel durat syntact disambigu speech natur languag page hidden pan pan kathleen mckeown spoken languag gener multimedia system volum pan pan kathleen mckeown integr languag gener speech synthesi concept speech system concept speech pan pan mckeown learn inton rule concept speech gener janet phonolog phonet english inton phd massachusett institut pollard carl pollard ivan phrase structur grammar chicago prevost semant contrast inform structur inton spoken languag gener phd jacqu robin gener natur languag summari provid histor background phd columbia mat associ focu phd mat theori focu interpret natur languag jame shaw aggreg linguist knowledg intern workshop natur languag kim silverman structur process fundament frequenc contour phd cambridg cm guidelin electron text encod interchang sproat isard markup languag synthesi eurospeech mark steedman depend coordin grammar dutch english taylor taylor isard speech synthesi markup languag speech bibliographi distribut pitch accent instruct function structur languag mari comput model map spoken languag system phd boston wang michel wang julia hirschberg automat classif inton phrase boundari comput speech colin david align entrop research mari mcgee wood categor grammar young young speech synthesi method speech output inform system journal acoust societi young rm young jd moor principl approach plan intern workshop natur languag young rm jd pollack principl plan sixteenth annual meet cognit scienc michel zhou autom visual heterogen inform coher visual journal intellig inform
DB/1113 3 queri finit structur real jan paredaen jan van den bussch dirk van gucht siam comput societi industri appli mathemat vol pp decemb abstract investig properti finit relat structur real express sentenc predic relat structur arbitrari polynomi quantifi rang set real constraint program correspond boolean real polynomi constraint queri finit structur fact quantifi rang real observ sentenc theori real evalu quantifi rang finit set real number chang truth inspir show polynomi queri express uniformli finit structur sentenc quantifi rang finit domain structur linear constraint program finit structur reduc ordinari queri evalu usual finit model theori queri show reduc prove queri express sentenc polynomi inequ simpl form kei word linear relat constraint program subject classif introduct paper motiv field comput scienc heavili reli relat constraint program perspect classic relat theori model relat structur domain structur fix data element natur typic infinit relat model finit tabl hold data activ domain consist data element occur finit queri map fix relat true basic express queri sentenc relat signatur inform children queri parent hobbi express sentenc domain quantifi sentenc express queri natur rang infinit al show order obtain result queri quantifi rang activ domain augment finit set addit data number quantifi variabl formula express queri receiv editor februari accept public octob publish electron june depart mathemat comput belgium depart belgium comput scienc indiana van den van gucht intuit result data element activ domain alik respect quantifi rang activ domain obtain semant natur interpret singl unari relat symbol sentenc natur interpret true obviou queri express natur interpret express interpret hull su establish implic hold implic hold interpret easili simul natur interpret bound recent attent paid program languag revesz demonstr idea constraint program appli queri languag introduc framework queri import instanc framework real polynomi constraint data element field real number relat structur relat longer defin finit boolean combin polynomi inequ relat structur subset basic queri real polynomi constraint firstord polynomi inequ addit predic symbol relat signatur hold set point queri point lie common express note quantifi natur interpret rang order evalu sentenc replac predic symbol formula polynomi definit obtain sentenc pure theori real theori decid truth obtain sentenc yield result queri real polynomi constraint queri comput finit relat finit relat real form import special case real polynomi constraint model hold finit number store full extent result infinit set point rectangl term linear inequ obviou store corner point result finit relat present investig result al hull su mention begin carri classic queri relat polynomi constraint queri finit real classic give altern semant constraint sentenc loss express power quantif natur constraint program mean reason potenti rang valu obviou result mention carri found natur analog al queri real establish verbatim analog theorem case linear polynomi case practic result finit linear constraint program reduc ordinari queri evalu usual finit model theori develop base observ normal form sentenc theori real finit set real exist sequenc finit set real sentenc evalu quantifi rang chang sentenc truth activ domain finit analog real case al theorem reader familiar method quantifi elimin field cylindr algebra decomposit observ directli obviou adapt cad construct give proof principl abstract pure algorithm aspect cad construct logic proof basi show case linear construct sequenc depart activ domain simul linear constraint formula obtain analog real case theorem final section queri distinguish isomorph gener natur criterion context classic relat work gener criterion base geometr intuit remain interest investig classic gener queri express linear constraint sentenc sentenc polynomi inequ express gener moment sentenc simpl inequ form exampl gener queri express simpl inequ simpl inher view express gener queri natur question gener linear polynomi inequ answer question neg paper organ start gener section introduc notion domain sequenc develop hing section introduc subject queri real section focu linear case section discuss gener queri present origin idea present paper confer research gener result provid summari gener section provid partial kuper origin intuit incorrect van den van gucht domain sequenc basic terminolog mathemat logic structur finit relat vocabulari domain denot formula written normal form tupl element truth substitut denot subset write evalu true quantifi rang consist integ predic sentenc prove theorem theorem sentenc finit subset exist sequenc finit subset trivial consist integ predic sentenc empti set prove theorem introduc auxiliari notion reli section natur relat definit point call denot atom formula basic type consist real predic polynomi describ circl line depict figur figur show class extend relat induct lower dimens class dimens class lower dimens definit assum defin figur class queri real fig class plane induc circl line fig class class note lemma lemma finit index proof proof downward induct base case trivial number atom formula finit assum finit relat assum set class intersect line impli finit index finit number valu finit index relev relat defin demonstr lemma stand formula equal equal van den van gucht fig point formula satisfact lemma point proof proof straightforward downward induct base obviou case note prove implic left direct symmetri exist exist induct case similar exist induct continu exampl sentenc illustr figur deduc class notion domain sequenc defin definit sequenc finit subset call domain sequenc queri real fig domain sequenc construct continu figur domain sequenc finit index lemma finit exist domain sequenc start technic lemma directli impli theorem lemma domain proof proof downward induct denot case trivial assum case implic left assum exist definit exist lemma conclud van den van gucht implic assum exist trivial conclud case implic left assum hold conclud implic assum arbitrari definit exist lemma conclud corollari sentenc domain sequenc proof set lemma queri real fix relat vocabulari consist finit number relat symbol ariti real structur type set real number assign relat symbol ariti finit relat rank activ domain denot set real number relat queri map type true basic express queri queri standard formula built boolean connect quantif atom formula multivari polynomi real relat symbol ariti polynomi previou item queri formula truth denot defin standard express queri yield true input assum queri point lie common express form express term condit form queri point coordin greater equal express note quantifi natur interpret rang formula mention relat call real formula real formula variabl occur queri real set polynomi inequ occur set polynomi variabl definit definit structur structur domain set real relat relat formula refer note natur evalu structur queri sentenc produc real sentenc natur atom subformula relat symbol finit relat consist tupl ma replac ia obviou assum queri sentenc normal subset satisfi written evalu true quantifi rang corollari immedi impli theorem queri sentenc real domain sequenc context structur theorem view analog real case al theorem mention introduct linear case focu linear express queri sentenc occur polynomi linear prove linear queri express linear queri sentenc quantifi rang activ domain input introduc construct domain sequenc start activ domain base gaussian elimin show construct simul uniform linear queri formula set linear polynomi variabl recal definit structur context structur point defin definit polynomi form defin sequenc linear polynomi induct definit set linear polynomi obtain gaussian elimin van den van gucht point respect term polynomi lemma lemma element order domain exist exist hold proposit respect polynomi proof proof downward induct case definit assum polynomi deal kind element kind element hold lemma deduc queri real definit proven argument implic simpli prove implic linear queri sentenc normal recal definit real formula previou note linear definit fix set polynomi occur form occur atom formula sequenc definit import note polynomi occur point respect impli respect structur mention theorem observ lemma finit union set form number set set depend proof proof downward induct base case clear good form assum union induct set good form induct set finit union set form readili good form posit defin domain sequenc respect structur base sequenc sequenc induct empti construct set ith coordin point hyperplan van den van gucht coordin add result obtain point add pair element element element result make definit definit linear sequenc respect sequenc induct defin equal proposit linear sequenc respect domain sequenc respect proof definit show assum definit term definit distinguish possibl put put put maxim element minim element queri real obviou invit reader convinc polynomi sign proposit proposit final lemma state prove main result section lemma exist finit set linear polynomi ith member linear sequenc respect equal independ proof proof induct case trivial assum definit term definit form consist polynomi form form combin express tediou straightforward substitut obtain desir form theorem linear queri sentenc linear queri sentenc construct denot quantifi rang activ domain proof linear sequenc respect theorem proposit write explicitli lemma written rewrit formula rang replac similar obtain desir sentenc empti strategi work sentenc obtain modifi test special test fix truth return fix truth result evalu denot empti activ domain gener queri relat signatur call isomorph biject relat symbol queri yield result isomorph call gener except occur signatur relat symbol ariti uniqu fix finit number sentenc test deal return truth van den van gucht assum consist singl binari relat symbol type view finit direct graph node real number queri express languag pure sentenc polynomi gener exampl gener queri graph number edg languag consist queri sentenc inequ simpl form queri easili point gener queri express prove similar gain express move full linear queri sentenc theorem linear queri sentenc express gener queri queri sentenc construct theorem denot quantifi rang activ domain theorem interpret loss gener present elementari proof theorem base lemma auxiliari definit fact easi prove lemma polynomi real max min sign make definit definit linear polynomi real variabl associ function associ weight defin defin maxim nonzero weight illustr definit exampl reader note theorem special queri sentenc gener result proven direct argument similar proof theorem queri real relev stem observ lemma natur number exist number sequenc integ zn proof note zn sum rang set indic consist distinct zn view univari polynomi max min rang partial sum satisfi condit lemma zn sign lemma proof theorem note lemma fix polynomi predic express formula proof crucial observ depend actual valu rel posit order type number order type formula simpli consist disjunct order type posit express proof theorem replac inequ formula lemma obtain queri sentenc show cardin polynomi occur lower bound lemma larger biject van den van gucht hold hold lemma hold monoton formula truth formula preserv isomorph inspect proof show theorem sharpen bit express gener queri yield result isomorph biject conclud gener queri express express linear queri theorem interpret natur hold mention begin test connect cardin finit graph real corollari graph connect cardin express linear queri sentenc proof show queri express quantif activ domain obtain result linear complex argument show context ration real linear queri complex class ac cardin connect point readili technic develop appli equal ration conclud remark present origin idea present paper confer research gener paper consid queri structur real arbitrari fix infinit theorem otto van den bussch shown theorem gener arbitrari fix infinit structur al gener theorem quantif activ domain consequ result gener corollari graph connect cardin express necessarili real queri natur interpret interpret gener theorem finit consid possibl infinit defin real formula involv simpl inequ libkin shown theorem hold order structur satisfi properti admit elimin quantifi result impli theorem gener nonlinear case structur real addit multipl admit elimin proof proof result present paper elementari construct result acknowledg grate bart care read earlier draft materi present alex queri real comment present anonym point mistak submit draft paper refer foundat aho data retriev proc acm symposium principl program acm pp geometr reason logic artifici pp cylindr algebra basic siam pp reduc relat model infinit domain case finit pp tech report rutger relat express power constraint queri proc acm symposium principl acm pp structur queri constraint queri proc ieee symposium logic comput ieee comput societi lo pp constraint logic select mit geometri chandra comput queri relat data comput system pp quantifi elimin real close field cylindr algebra lectur note comput scienc pp mathemat introduct academ linear constraint queri express power logic comput lectur note comput scienc pp hull domain independ relat acta pp constraint queri comput system pp express power relat calculu arithmet lectur note comput scienc abiteboul pp otto van den queri infinit inform process pp van den van theori spatial proc acm symposium principl acm pp van den van queri finit structur real proc ieee symposium logic comput ieee comput societi lo pp linear order constraint ration proc acm symposium principl acm pp van den alfr tarski elimin theori real close symbol pp
Agents/1114 1 architectur mobil bdi agent paolo busetta ramamohanarao technic report depart comput scienc melbourn victoria australia abstract bdi matur commonli adopt architectur intellig agent bdi agent autonom entiti work team react chang condit current comput model adopt bdi problem prevent develop mobil agent discuss toma orient multi agent address issu combin bdi distribut nest transact paradigm algorithm present enabl agent toma mobil introduct intellig agent activ area ai research agent architectur bdi matur adopt industri applic bdi agent autonom entiti work team react chang condit mobil bdi system advantag ffl perform task closer sourc ffl leav join ffl balanc load network comput current comput model adopt bdi problem concurr control limit prevent develop mobil bdi agent toma orient multi agent address issu toma inspir previou work combin comput aspect bdi distribut nest transact natur problem discuss paper face distribut system model tackl problem appli situat common futur combin intellig agent transact process make ai technolog part softwar engin mainstream section overview intellig agent bdi situat mobil intellig agent advantag present section section discuss prevent current bdi agent mobil section present extens bdi toolkit written java prototyp toma built toolkit section discuss comput model toma enabl mobil agent section briefli compar toma system present futur research direct bdi agent architectur ai commun research field intellig agent decad authorit definit intellig goal environ led develop varieti languag architectur research gener comput program environ sensor effector ka librari monitor interpret intent structur goal gener command figur procedur reason system system structur call ration dynam partial unpredict environ show characterist ffl autonomi oper contin ffl social abil interact agent possibl ffl reactiv percept world insid act react quasi ffl behaviour reactiv driven intern initi approach studi ration agenc receiv great deal attent intent architectur bdi architectur product number applic rang air traffic control air telephon call centr handl malfunct nasa space shuttl bdi approach base studi mental attitud tackl problem tradit plan situat requir reactiv discuss figur extract show basic compon typic bdi agent belief repres inform state bdi world desir goal motiv agent achiev typic bdi agent procedur knowledg constitut set plan defin sequenc action test perform achiev goal react specif situat intent repres delib state plan agent chosen eventu execut agent react gener modif addit goal messag arriv extern world event invok agent commit execut intent intent execut step time step queri chang perform action extern suspend execut condit submit goal oper perform step gener event start intent intent step fail condit guard execut test action perform report agent appli set default polici select plan schedul activ overridden user defin invok intent mechan recent lot research area collabor work team bdi agent architectur extend manag commun inspir paradigm speech act theori messag qualifi inform direct member complex relationship organ share goal reciproc cooper order accomplish task bdi abstract architectur famili parallel distribut system work team dynam environ bdi high sophist sensit context decid react chang condit depend design implement bdi agent show level reactiv plan behaviour descript behaviour cognit attribut mental attitud research undertaken number area relev comput cognit instanc cooper work social commit recognit intent mobil bdi agent time awar specif work area mobil bdi agent level matur field mobil industri standard publish product system benefit integr mobil servic ffl team form mixtur cognit complex agent dispatch task lightweight agent pursu goal lightweight agent leav move host possibl rejoin team accomplish goal number benefit team organ effici improv move lightweight agent perform queri larg host secur privaci restrict satisfi easili collect anonym statist sensit result queri primit data transfer integr legaci system build lightweight agent act flexibl bridg time avail improv perform interact network link subject long delai interrupt servic control robot mar earth interact human portabl ffl variat previou scenario complex agent clone order accomplish specif goal specif host capabl interest agent make sporad valuabl share resourc special user high speed graphic ffl mobil bdi agent balanc comput load host make easier build highli servic improv robust system ffl dynam load plan distribut agent servic benefit infrastructur provid mobil agent shortcom current bdi exist bdi system number shortcom prevent mobil agent architectur lack paradigm concurr control intent perform conflict manipul set belief time problem resolv write context specif polici addit write discov handl race condit challeng task problem concurr perceiv implement number clever choic made system design spite inher bdi agent implement sequenti machin execut step activ intent time justif analysi agent behaviour chaotic default polici appli agent extrem simpl restrict typic system intent prioriti intent prioriti order fifo criteria schedul schedul pick execut intent highest prioriti level run termin suspend agent reactiv behaviour perform fast plan combin sequenti default polici short result intent run atom avoid concurr problem spite precaut architectur system design extrem easi build agent suffer race condit comment easi write polici prevent condit develop agent concurr issu mind write ad cognit burden design implement process boil ad hoc engin disciplin limit exploit parallel system disciplin hard enforc prove robust final softwar scale agent small larg applic term varieti situat manag complex behaviour extrem riski load number intent pursu maintain light inadvert break subtl assumpt order event receiv manag intent select execut opinion issu concurr agent essenti face oper concurr languag sort system support task execut time import featur miss bdi architectur except handl mechan prescrib report fault infrastructur agent team network happen asynchron execut intent left applic develop provid adequ failur detect recoveri mechan addit previou consid requir scenario section argu current bdi architectur lack adequ comput model express activ agent perform time relat justifi rememb bdi agent pursu multipl intent time intent complex relationship agent current belief goal histor sequenc event handl state world chang agent specif intent possibl origin goal altogeth move agent host checkpoint disk recov matter snapshot agent memori copi clone world meantim state account agent defin transfer comput state describ agent achiev point reason circumst comput state union motiv delib state desir mental attitud section ffl belief move reconstruct agent probe ffl goal distinguish context independ goal short term subgoal gener specif situat chang agent ffl intent move reconstruct agent list goal updat belief architectur exist languag resolv issu situat complex agent member team agent part network relationship built pursu privat social goal exist bdi system support explicit express boundari state cooper work current research bdi cognit issu multiag concern notion share goal commit built commun directli address mention comput problem issu part level abstract design high level architectur strictli depend capabl infrastructur implement order build robust argu bdi architectur incorpor comput model model provid framework solv issu concurr except handl clarifi relationship activ perform mental attitud work team model analysi behaviour agent level abstract write effect includ requir mobil comput requir address prototyp discuss section toolkit order investig solut issu section perform varieti experi built basic toolkit call toolkit develop prototyp robust bdi toma orient multi agent discuss section design toolkit toma discuss detail java unavoid choic languag offer number attract suffici rich standard class librari includ network program support dynam load suitabl rapid prototyp miss power logic function level abstract experi architectur avail softwar tool java includ support mobil agent toolkit main layer java definit basic element bdi agent defin interfac applic specif agent system framework support stereotyp implement bdi architectur base extrem simpl comput similar adopt bdi system goal provid simplest support show underli problem final provid basic set reusabl kernel goal belief java compon outgo messag incom messag compon user written compon event notif plan intent messag goal action agent belief run figur model mechan refin architectur packag framework develop agent work team figur depict model adopt compon design extrem simpl independ specif architectur classifi mental capabl execut compon mental compon agent includ event intent object simpl data structur manipul applic cooper system control behaviour agent belief model record relat belief qualifi applic volatil volatil belief repres state world chang control transient inform intern agent volatil messag data structur exchang agent set reserv applic system goal conceptu analogu messag remot procedur identifi goal set initi pair set fill goal accomplish event type identifi happen goal submit belief assert retract messag argument belief messag event intent event trigger intent plan discuss instanti react event capabl agent suppli applic develop set compon deriv abstract plan plan repres recip perform task aggreg variabl step step manipul send receiv messag queue submit interact human oper step execut plan subplan plan repres queri queri satisfi execut termin step termin step execut case success case failur plan trigger condit order execut step graph sequenc step accept order invoc success execut link plan creat set applic coupl event react system invok relev creat applic queri current belief agent determin intent plan instanti intent execut compon architectur specif suppli system repres core notifi invok collect intent applic select intent execut schedul instanti type direct applic call step plan provid oper interfac interfac access commun submit goal perform action applic intent event commun user interfac belief start fail java thread select run run intent event event creat figur model type applic select polici execut plan polici differ order invoc backtrack view mechan messag characterist inform current state plan maintain call execut context suppli default suit prefer mode execut specif type specif request invok combin polici intent provis relat meta plan encapsul execut compon perform specif instanti startup specif type select execut plan simplifi parallel implement mimic compon behaviour figur depict compon cooper singl share run intent gui rudimentari support number dialogu human oper requir intent execut concurr team commun support transmiss channel type support execut step plan sequenc plan graph step backtrack limit step altern sequenc attempt continu sequenc complet altern found plan start satisfi failur forc mainten condit longer satisfi prior termin sequenc step termin requir serial access lock execut step manipul belief event gener execut plan perform oper belief submit goal event gener commun subsystem messag receiv event gener java object part agent order submit goal provid initi set goal start java thread event notifi thread invok relev collect applic intent run request execut plan similar action repeat plan termin successfulli applic intent gener requir interrupt servic event time alert applic goal pursu interrupt forc failur plan current intent serv event plagu problem discuss section good foundat toma discuss section team set agent commun commun organiz function structur left applic toma toma orient multi agent extens compon toma addit abil interpret hierarchi intent pursu parallel team agent relat causal chain goal messag distribut nest transact transact transact system common wide includ transact oper concurr commonli defin acid unit work atom mean action happen happen transact system atom transact correct transform perform problem develop write transact transact system automat enforc constraint invari relat forc abort transact violat isol properti transact run parallel system run transact time isol obtain lock scheme prevent transact updat data conflict manner transact manag track resourc affect transact transact eventu successfulli failur commit transact manag inform coordin resourc manag coordin obtain adopt phase resourc manag make modif durabl work transact affect resourc manag distribut process host network transact call distribut involv multipl applic multipl transact manag system support nest distribut common support normal transact nest transact root top transact number subtransact subtransact root transact subtransact subtransact subtransact transact plan transact plan plan transact plan transact figur nest transact insid singl agent transact nest transact acid consist isol durabl subtransact local roll back due abort parent transact hierarchi form toplevel transact descend call famili advantag subtransact abort action perform descend sibl parent affect nest transact provid framework manag partial failur plan nest transact addit toma support famili call execut plan acid root subtransact parent plan interpret refer transact plan oper interfac offer step transact plan manipul transact resourc lock automat order isol transact kind type concurr access resourc support lock manag support transact lock grant implicit grant subtransact lock inherit parent root care transact resourc order consist view inform manipul effect nest transact perman part state plan root famili termin successfulli failur transact plan transact resourc forc failur transact descend tree modif commit plan explicitli requir plan invok implicitli default appli toma transact plan creat check precondit transact root plan creat subplan serv goal messag gener transact case subtransact figur show nest transact singl agent applic control extent nest transact transact plan freeli mix execut singl intent applic programm suffici care make choic toma main transact belief messag queue resourc relat object orient store forward messag print electron mail resourc intern extern easili ad belief repositori multipl view view design transact reason main store relat view manipul transact plan consist main store modifi assert retract perform plan parent branch famili view view subtransact merg view parent subtransact commit eventu commit root nest famili merg modif main store event relat assert retract belief gener root nest transact commit note volatil belief transact control plan directli manipul main store care consist view subtransact root subtransact subtransact agent subtransact agent agent transact messag transact plan plan plan plan transact plan transact transact messag goal messag figur simpl case distribut nest transact transact case messag queu transact plan store transient repositori root transact commit discard section discuss manag inform direct messag exchang agent transact cooper work distribut nest transact commun subsystem toma support connect agent cooper distribut transact manag agent support transact propag standard phase commit protocol request inform messag transact plan nest transact mode automat extend destin agent parent transact perform agent agent subtransact run agent team figur depict simpl distribut nest transact team agent agent initi work servic messag destin consid transact action plan messag implic receiv agent successfulli react intent successfulli termin previou intent messag receiv handl forc failur transact default intent serv messag sender plan distribut transact famili commit involv agent root initi agent commit agent affect branch transact involv automat fail surviv crash agent case partial failur nest transact current state limit toma test experi attempt extrem simpl set bank agent act branch agent central develop adopt agent plagu inconsist belief due race condit exampl manag trivial error withdraw monei agent behav incorrectli unexpectedli simpli select toma exampl automat perform correct serial access belief behav correct reliabl error detect plan agent crash appropri organ plan partial failur automat manag event servic mechan section burden phase commit subtransact distribut transact substanti algorithm implement toma automat reduc number messag exchang avoid phase commit circumst acid transact long term activ common industri break activ sequenc short term adopt transact model case long term intent plan invok sequenc transact subplan submit goal serv transact plan transact requir failur control transact comput state toma resolv issu section start tackl problem core transact move state belief team agent consist state acid properti make analysi state transit extrem easi arbitrari sequenti execut step concurr intent failur occur lifetim nest transact manag automat restor consist state involv agent partial failur address combin nest transact model event servic mechan section make fairli easi build agent resili categori fault distribut comput perform transact team agent clear boundari time space sacrif flexibl reactiv bdi model toma flexibl transact process clear set engin techniqu adopt defin cooper work team agent smaller relev work mental compon agent classif belief volatil partial answer question section volatil belief reconstruct probe belief primit inform repres histor memori accumul activ perform agent intim part ident agent preserv move restor goal messag propag nest transact classifi event activ root transact feasibl design possibl perman store event gener part event call root event toma agent move locat adopt algorithm receiv event carri ffl checkpoint state agent forc failur intent activ transact roll leav consist state belief affect agent ffl transfer root event serv locat ffl transfer ffl invok applic startup routin restor state volatil ffl restart servic transfer root event agent redefin intent origin event context world algorithm ineffici expect subtransact roll back appli ffl event program event fire agent state current transact ffl agent delai movement conveni cost move case algorithm safe appli independ state agent research toma investig checkpoint execut context plan recov forc support transact execut context move intent algorithm outlin comparison toma strong similar concurr languag environ support fault toler comput mobil object interest recent stream research inspir advanc transact interact orient program iop essenti concern coordin agent cooper achiev common possibl long period time aim provid reliabl flexibl framework directli involv intern comput perform singl agent futur work intellig agent extrem live area research applic artifici intellig advantag mobil servic complex distribut system bdi architectur intellig agent research team cooper bdi agent current bdi agent mobil identifi problem bdi comput model altern make agent easier predict bdi model toma directli address suit support algorithm move agent step research mobil toma defin transfer store event examin ad model execut plan transact model core toma gener applic research illustr gener interest bdi issu tackl solut reusabl type ai industri applic acknowledg author evan harri preciou comment research support australian research council kei centr knowledg base cooper research centr intellig system busetta support australian postgradu award refer australian artifici intellig australia dmar system activ agent system comparison intern workshop rule lnc page septemb busetta agent toolkit design technic report comput distribut object migrat environ technic report school comput carnegi mellon georgeff ingrand make reason system intern joint confer artifici grai reuter transact concept techniqu morgan kauffman object manag group mobil agent facil draft june werner plan team activ castelfranchi artifici social volum lectur note comput page springer australian artifici intellig institut technic note australia ad group commun corba usenix confer gd sk sm mc design implement usenix comput system rao plan theori reactiv recognit fourth intern confer principl knowledg reason anand rao bdi agent speak logic comput languag european workshop model autonom agent lnai januari anand rao michael georgeff abstract architectur ration agent swartout rich intern confer principl knowledg san morgan kaufmann publish john searl speech essai philosophi languag cambridg yoav shoham program artifici singh program intern confer multiag system singh commit autonom agent environ european workshop model autonom agent world wooldridg jen intellig theori practic knowledg engin
IR/1115 5 infrastructur support inform share francisco christoph richard nguyen cs rutger technic report depart comput rutger nj abstract storag technolog trend provid massiv storag extrem small packag declin comput cost result rise number devic person confluenc trend present critic challeng storag file system enabl user effect share huge amount data store multitud devic present middlewar storag design principl semant index storag layer make design choic meet challeng concentr queri inform retriev assum unit storag index arbitrari data search retriev applic creat manipul data adopt avoid central storag index make suitabl inform share ad hoc group manag data distribut multipl devic target group result studi commun peer run cluster pc scale threshold describ semant file system implement valid util introduct storag technolog trend provid massiv storag extrem small packag declin comput cost result rise number devic person confluenc trend present critic challeng storag file system enabl user effect share huge amount data store multitud devic current model hierarch storag singl machin increasingli inadequ meet challeng typic user face complex problem manag system typic user possess multipl pc laptop work plethora devic digit camera complet comput capabl run modem oper system store gigabyt inform present middlewar storag design principl semant index storag layer make design choic storag layer unit storag pet markup languag choic make index support search data applic creat manipul data size storag person make search retriev vital properti storag file system support success search engin strong evid search retriev intuit paradigm user leverag manag access larg volum inform search high relev document routin return user billion choic aim provid person search built storag enabl group user share manag data distribut multipl devic aspect design ground system mean design oper fluid peer join leav system dynam explicitli recogn refer xml document snippet xml document small user copi data spread multipl devic user inform local devic cell phone order maintain access period weak nonexist connect introduc problem find document maze directori explicit support manag synchron replica address problem altern design approach reli central storag central index search central storag tempt system design practic user storag inevit cell pda store data central repositori central index search proven valuabl approach web search engin approach includ replic data central place data chang ineffici toler commerci search engin back compani larg administr budget ad hoc group user limit resourc kei element success model trace back abil small medium size group share inform design scale level group trust user manag singl storag volum multipl devic target regim possibl spread internet target commun size node larg system target effort assum member track membership entir group advantag assumpt individu summari form bloom filter member group approach advantag peer peer inform search search place load commun larg bulk data search peer queri local store bloom filter contact peer match snippet directli disadvantag approach time spread inform requir inform spread commun address peer collabor implement inform brokerag servic consist hash approach similar spirit order export process implement file user build hierarch semant directori structur top describ current statu file system leverag provid build directori repres collect repres collect file logic relat content repres refin queri content remaind paper organ section describ design implement section preliminari evalu perform section describ section briefli examin perform section discuss relat work section conclud paper discuss plan futur work explain section middlewar storag layer distribut storag queri data made transpar actual locat node particip search retriev function distinct featur storag layer queri made base content logic block number queri persist queri persist commun long notifi event request peer data match queri enter system combin featur place closer system tradit storag layer describ differ system tion kei question unit index membership list queri perform unit storag xml snippet made choic assumpt xml index support search arbitrari data applic creat manipul plan xml tag provid addit semant queri peer write snippet oper publish publish provid set kei map publish associ kei snippet snippet found featur make extens keyword document text kei handl text string intend extend type kei xml tag plan build automat keyword extract mechan index commun data store summar kei snippet peer publish bloom filter commun peer queri content commun queri bloom filter collect maintain membership inform peer maintain local list activ member absenc join member eventu local directori set bloom filter global approach advantag place load commun search bulk slowli chang data disadvantag approach rapidli chang inform spread necessarili spread time minim spike commun bandwidth address peer implement inform brokerag servic consist hash publish locat inform index servic support time locat exchang inform subset peer involv entir commun queri pose perform search list bloom filter comput subset peer snippet match forward queri subset contact inform broker kei queri contact peer broker process repli return match xml snippet caller persist queri queri peer queri broker inform publish broker match persist broker forward inform peer post queri queri peer persist queri check bloom filter arriv figur show current architectur hash tabl store publish xml snippet local directori list bloom inform member brokerag server implement inform brokerag servic peer shut brokerag persist queri local peer figur current architectur local file system store content call storag system remaind discuss algorithm spread inform brokerag servic queri handl give current program interfac export inform combin al algorithm demer al algorithm maintain consist local directori member commun algorithm work member maintain gossip call randomli target cal directori send summari local directori call gossip messag receiv gossip determin contact updat local directori default gossip interv set prevent instantan commun spike piec inform enter system reduc gossip system reach stabl gossip interv adjust dynam simpl algorithm work maintain count number time contact peer inform xs local directori count reach gossip interv receiv gossip messag updat inform reset gossip interv default constant found work current pc connect ethernet lan valu modifi dynam gossip interv advantag defin termin condit algorithm small chanc termin condit result peer consist view system global consist bandwidth neglig short time peer skew random select gossip target heavili peer contact chanc member view make gossip member join happen brand member join member inact back simpli start gossip back member contact peer commun inform brokerag addit bloom filter summar mation share commun support inform brokerag servic flexibl inform share member join commun support brokerag servic devic suffici commun resourc avoid host servic servic work inform publish brokerag servic xml snippet set kei network broker consist hash partit kei space implement activ member uniqu broker id predetermin rang member arrang ring id map kei comput hash kei send snippet kei broker id make successor ring broker id kei snippet broker broker smallest id greater send kei snippet broker complex implement servic li handl dynam join leav member member join commun contact activ member commun obtain copi member local directori randomli id conflict id activ member copi local directori obtain global check conflict peer successor local inform successor presenc id successor predecessor id join member contact successor member join broker id happen member join wide inconsist local directori member simpli compar join time duplic ident discov inform member lowest join time rerun join algorithm id snippet kei publish member transfer win member leav leav peer contact successor ring forward data publish member leav publish data lost avoid loss data hash function publish replica broker support depend fact data summar bloom filter publish brokerag inform lost peer leav forward found bloom filter commun join departur messag contact successor join origin messag initi local chang ring structur piggyback algorithm spread activ peer membership state extrem high join leav requir number activ member search support basic queri languag queri string interpret conjunct kei separ white space word doubl present search bloom filter local directori obtain list candid peer data match queri bloom filter arrai bit repres set filter comput obtain index member typic hash set bit index bloom element member comput index check bit bloom filter give posit neg membership test perform constant time queri xml data snippet snippet url point match data found return xml snippet list match snippet node point url ad candid list broker queri peer queri candid node xml snippet return candid node ad list match snippet candid list match snippet return caller handl conjunct straightforward queri candid base bloom entir queri match snippet satisfi conjunct queri peer maintain buffer maintain hash snippet compar match snippet present persist queri languag regular differ user asynchron post persist user object invok match snippet found persist queri match broker bloom time bloom filter match local queri kei ad user repeatedli match queri applic mean resolv type conflict interfac support peer set member onlin call function contact peer join commun note assum peer member commun extend framework user join multipl commun futur gracefulli leav commun share snippet commun list kei map queri kei find snippet subset kei store data directli brokerag import content share peer limit size xml data publish prevent overload broker publish snippet brokerag servic timeout broker drop snippet time timeout find publish xml snippet match queri call find publish xml snippet match queri make queri invok time snippet match intend final api api shape design implement expect api chang significantli time perform assess perform run commun cluster pc note contribut abil manag share data distribut hundr absolut perform secondari concern effici user effect provid function evalu assess perform evalu abil scale show user expect reason perform environ run commun cluster quad mhz pentium iii machin mhz pentium iii machin machin gb memori mb machin interconnect switch ethernet lan machin run red hat linux kernel written java stand line code experi form java version resourc requir java jvm instabl effect limit peer machin machin gave maximum commun peer coordin implement central coordin coordin run separ machin oper cost bloom filter insert bloom filter search kei bloom filter compress kei bloom filter decompress kei insert search tabl cost basic oper cost present fix overhead margin kei cost insert kei bloom filter spawn slave daemon machin run slave process run commun peer machin coordin process listen multicast socket commun command ter coordin word figur normal size number kei filter compress filter give approxim error rate summar word show length encod effect compar averag half size cost join micro benchmark start measur cost basic manipul bloom filter manag tabl list oper measur cost measur perform mhz machin observ ing java shorten develop time java collect framework implement complex data extract cost perform basic oper fix overhead ten margin kei cost ten microsecond constant size bloom filter investig combin filter inform reduc bandwidth consumpt drawback bloom filter size larg summar largest introduc posit reduc bandwidth compress bloom filter compress scheme compress code encod run figur show compress scheme effect compress bloom filter assess member join establish commun start commun peer wait view membership consist peer attempt join measur time requir member consist view commun requir bandwidth time peer set share kei rest commun bloom filter member join inform brokerag servic kei servic figur plot time reach consist number join peer algorithm origin algorithm figur show total bandwidth peer process figur plot averag bandwidth number join member result show commun doubl member reach stabil hundr number time reach global consist ten minut reason commun size growth shown figur consist expect run time underli algorithm note optim significantli reduc time bandwidth requir reach global consist observ averag bandwidth requir node figur averag time requir reach stabl state join amount node stabl network node node figur averag data node join amount node stabl network node node figur averag bandwidth node ad amount node stabl group node node figur averag time propag updat bloom filter commun period high activ constant number join member gossip interv effect space trade time view inconsist lower averag bandwidth usag success scalabl regim order peer examin time requir bloom filter stabl commun import estim long peer contact order updat inform peer oper start commun size rang commun coordin inject piec data random peer measur time peer bloom filter entir commun figur plot measur time commun size slow growth time scalabl inform brokerag servic final test perform brokerag servic presenc join departur start commun peer share kei brokerag servic wait achiev stabil coordin randomli select node leav commun return peer forward brokerag inform correctli time figur search time broker network find kei studi vari percentag node leav join network time figur search time broker network find kei studi vari percentag node leav join network overcom tempor inconsist node time kei give peer start empti local directori test bed coordin random peer activ queri random kei origin measur time requir repli figur plot result onlin peer curv number peer activ time search time curv search time sequenc queri percentag activ peer mean larger number join leav commun instant time extrem member leav join activ time flux past commun join search time start significantli queri entir time experi find match data tempor inconsist bulk failur occur commun figur show experi queri peer retri fail queri time search time significantli flux membership fraction fail queri drop bulk failur occur commun experi show brokerag servic robust face dynam commun membership normal expect member commun activ join leav implement middlewar semant file top valid util similar function semant file system defin gifford al novelti li fact content queri dynam commun user data potenti distribut multitud requir central index call middlewar system manag storag directli file store local file system file share commun publish make entir commun search file base content semant file directori creat user pose queri creat link file match queri result directori file creat modifi match file semant file file index postscript file pdf cumul size file figur overview file explor figur comparison time requir index total cumul size file updat directori link file directori chang content user publish oper add file ing remov limit build refin queri directori user creat directori creat content includ file match queri file system figur show basic file file semant file system user publish pass file textual content file separ set kei file index index postscript note function file index arbitrarili extend user publish file local pathnam file file basic simpl web server file server return url request arriv file server return content file emb url xml snippet publish extract kei call file commun local directori recal set kei publish work extend capabl similar hac publish inform brokerag network publish slower bloom filter top kei highest count set kei publish set member commun find file short time public search kei file newli publish file found bloom filter system scheme kei structur document complex method www search engin googl combin font capit posit rank import word respect page resid leav futur work automat updat directori addit persist queri updat file delet owner modifi longer map directori difficult user open check time directori updat time greater fix rerun entir queri rid stale file implement week design graphic interfac perform evalu feasibl everydai comput share idea larg set kei user cost index file cumul size file figur number kei found index amount text file receiv time public time number uniqu kei figur time publish inform test set consist postscript pdf text file postscript file pdf file obtain text file obtain project figur plot index time cumul size set file index run mhz pc postscript pdf file convert text file graph show index approxim rate impli comput power index file updat index figur show number kei gener approxim mb text file file line total number kei publish file basi total line number uniqu kei file approxim upper bound kei deal affect size bloom filter note file experi digit book french file consid worst case publish complet text space lost format graphic languag approxim mbyte number uniqu kei exce impli maximum size hundr kb bloom filter current kb bloom filter size strain capac devic limit resourc explor method reduc overhead work bloom filter figur show cost publish set kei brokerag servic ran commun peer measur time requir publish file vari number match kei time shown time requir peer persist queri post kei publish brokerag servic notifi file set kei publish brokerag servic small order hundr public ms kei number heavili optim kei publish broker time linear public time relat work infrastructur support system recent popular research topic work scale larg storag system network concentr scalabl mechan id object map tapestri provid similar featur inform brokerag servic base al approach system focu smaller lead significantli design focu inform support tradit file system servic similar approach chord chord consist hash map kei broker scale larg commun concentr find inform member global view system chord wai differ tapestri id object map algorithm design larg system consist hash compat target leverag fact member view entir system optim perform ad resembl previou work tupl space model introduc idea space time decoupl publish post tupl receiv pick tupl ad concept flow mean node poll notifi asynchron event occur infrastructur leverag function bodi work previou work ea reli assumpt server base scheme commun member recent system start studi organ solut environ similar build system replic server network heavili reli previou work area consist hash implement version similar dont assum malici user kei distribut pick random kei implement hash kei claim hard adversari kei overload node similarli chord extend origin consist hash algorithm support concurr node join leav file file orient built peer peer infrastructur includ system interest provid semant file tradit hierarch system respect design file closest semant file system hac file system system provid function main contribut design implement support share ad hoc commun challeng loom horizon design storag file enabl user effect share huge amount data store multitud devic semant storag semant file system built top make design choic meet challeng concentr queri inform retriev assum unit storag snippet index arbitrari data search applic creat manipul data adopt avoid central storag index make suitabl inform share ad hoc group manag data distribut multipl devic studi perform cluster machin commun size peer result scale target size peer scalabl abil organ locat inform base content import aspect belief guid fact routin web search engin locat format dont bother organ familiar hierarch structur reli search engin consist return relev document billion choic search term aim carri paradigm ad hoc group user manag share data distribut multipl devic futur work intend pursu direct continu work explor requir exact kei match possibl includ phonet string match techniqu stem match queri approxim word explor ad semant queri includ awar xml extend queri languag significantli explor extend includ function provid system hac studi secur implic refer hash code error commun acm anatomi hypertextu web search engin comput network isdn system achiev global event notif servic workshop hot topic oper system consist hash random algorithm cach distribut network master depart cooper storag cf acm symposium oper system principl epidem algorithm replic mainten sixth annual acm symposium principl distribut comput rate chang live studi world wide web usenix symposium internet technolog system persist storag util workshop hot topic oper system commun linda acm transact program languag system semant file system acm symposium oper system principl encod ieee transact inform theori integr access mechan hierarch file system usenix symposium oper system design tion resourc discoveri distribut network symposium principl distribut comput consist hash random distribut cach protocol reliev hot spot world wide web acm symposium theori comput architectur persist storag wave hawaii intl conf system scienc januari patrick pascal face publish tech rep aw access nearbi copi replic object distribut environ acm symposium algorithm architectur scalabl content network acm sigcomm el confer comparison file system usenix annual technic june al sign framework event observ notif sixth european softwar engin confer distribut object locat rout system middlewar effici tribut tupl space implement network workstat scalabl lookup servic applic acm sigcomm confer sun microsystem javaspac specif infrastructur locat rout technic report april
AI/1116 2 quantit knowledg multiag coordin david michael regi victor lesser comput scienc depart massachusett amherst ma abstract central challeng multiag coordin reason action agent ect action knowledg interrelationship coordin agent prevent exploit bene cial relationship action explor interlock method learn quantit knowledg ect framework multiag coordin simplic ectiv method demonstr agent learn knowledg extend util coordin framework explicitli repres coordin knowledg introduct major challeng design ectiv multiag system manag ect situat action agent impact perform agent action agent action hinder action agent poor account ect multiag activ deadlock wast repres reason central featur framework multiag coordin lesser barbuceanu fox multiag coordin framework assum agent possess accur knowledg relationship action basic perform characterist action cost knowledg agent schedul activ wai exploit bene cial avoid patholog accur knowledg di cult maintain heterogen open system agent design futur oper environ complet set action open effect action agent abil multiag system autonom learn coordin knowledg copyright american associ arti cial intellig reserv ical coordin framework lesser investig implement techniqu learn statist knowledg repres framework multiag coordin found combin simpl learn techniqu surprisingli ectiv learn knowledg accur predict perform context set action execut agent agent success method demonstr coordin knowledg learn learn coordin polici implicitli repres knowledg associ context learn multiag coordin popular topic past year exist work aim equip agent ectiv polici function map condit directli coordin action wei investig reinforc learn techniqu improv coordin perform reactiv agent tan investig extend rl creat coordin multiag polici explor learn explicit quantit knowledg delib agent agent explicitli plan sequenc action trace assumpt plan assum coordin framework ms encod relev characterist environ guid coordin agent knowledg coordin action separ knowledg coordin mechan opportun coordin strategi chang alter cost knowledg requir explicit theme learn multiag coordin learn predict futur action agent predict produc coordin action explicit commun agent hu wellman wellman studi type learn context simul doubl auction zeng sycara sycara studi learn predict agent action context sequenti negoti focu learn agent action ect knowledg predict reason directli predict action work closest learn ect context outcom agent action utgo al tree learn state action produc sensor valu mobil robot veloso veloso learn cost action execut trace robot navig work similar work relationship action notion close alli focu action ect multiag context work consist action desir knowledg concern coordin action multipl agent task investig learn techniqu exist framework multiag coordin ms lesser repres quantit inform agent includ candid action action combin achiev task ms repres task tree root task leav primit action refer method intern node repres subtask task method intern node constitu method task combin success execut execut singl altern execut addit structur inform task ms repres type statist inform probabl distribut describ valu perform paramet method qualiti method cost ect method reason knowledg repres ms al evalu durat action ect agent action reason select meet current gener action select problem ms exponenti reason gener sati approxim strategi al case necessarili denot optim constraint condit agent sacri ce solut pai larger produc result speci ed deadlin detail discuss ms provid lesser wagner al ms coordin task assign di erent depart hospit depart coordin execut task produc maximum medic bene patient time cost constraint radiolog depart schedul sta draw blood diagnost provid patient exist method complet task impli speci order execut eat disabl diagnost test element hinder obtain accur result blood test constraint impli schedul blood speci figur show partial ms task structur hospit agent li coordin servic singl patient radiolog task patient task requir execut provid solut patient produc exposur interpret exposur solut enabl interpret interpret exposur enabl interpret sta conduct test patient blood rst method draw enabl test test hinder patient solut hospit polici requir blood drawn solut administ patient empti radiolog agent agent agent interpret method enabl task enabl draw blood disabl disabl blood test test test enabl enabl hinder figur ms task structur hospit patient servic paper learn statist knowledg encod ms distribut left gure focu learn common hinder de ne relat task method task method clariti ect qualiti ect durat cost infer text term method successfulli complet execut prior begin execut method enabl achiev qualiti multipl method task enabl order enabl disabl complement enabl achiev qualiti multipl method task disabl fail facilit qualiti multipli power factor facilit modifi perform characterist multipl facilit method multipl ect facilit ac hinder complement multipli power factor learn method work learn accur knowledg distribut assum agent method ms knowledg produc ectiv schedul learn distribut agent monitor perform schedul nite set method partial order learn instanc consist perform characterist method schedul set method schedul successfulli complet execut prior method assum method schedul execut directli learn learn agent inform execut agent requir infer exist hidden method assum schedul execut method execut schedul ect method execut schedul limit scope method consist origin assumpt ms goal learn instanc infer distribut una ect perform characterist method infer exist power factor acquir built ms point refer gener term learn system tl simpl learn empir frequenc determinist properti linear regress discuss method individu discuss interact method ectiv empir frequenc distribut estim distribut perform paramet cost frequenc distribut method perform paramet deriv move window instanc execut method goal estim distribut una ect qualiti method ect method facilit valu assum ect divid current estim factor render estim una ect qualiti method thought ect ac altern approach learn result method execut una ect result method execut start empir approach prove slower method report figur show result experi top line show error learn qualiti valu una ect bottom line show error learn valu correct base estim power factor error estim unaffect unaffect schedul execut figur error di erent method estim distribut determinist properti schedul learn enabl disabl deriv total prove experi report enabl state success execut method point exclud method enabl condit ms requir enabl method method execut disabl state success execut method point schedul exclud method disabl condit ms speci es disabl method method disabl linear regress infer exist estim power factor recal ms speci cation facilit hinder ect perform characterist method qualiti method determin una ect qualiti power factor method facilit hinder ms speci es xn mn xn log equat classic form linear regress correspond log ect qualiti correspond log respect power factor combin correspond una ect qualiti distribut correspond random deviat valu ect search equat power factor signi cantli di erent regress coe cient signi cantli di erent conduct search standard statist linear regress smith regress conduct simpl local search regress start equat end equat number method schedul term ad equat coe cient signi cantli di erent remov coe cient signi cantli di erent cient exist term equat chang term assumpt linear regress creat potenti problem appli techniqu learn power factor soft rst independ variabl hard success execut method depend success execut introduc depend variabl xn enabl introduc posit correl xa disabl introduc neg correl regress robust moder violat strong violat greatli varianc estim coe cient regress equat estim power factor extrem de tl address problem wai check strong violat assumpt refer perfect doesnt alter current state knowledg case violat typic occur small dataset tl regress greatli reduc total number variabl regress reduc probabl depend distribut error term regress equat normal error term repres log una ect qualiti distribut match distribut reason qualiti reason experi altern distribut linear regress robust moder violat assumpt assumpt ect test statist signi canc test run determin coe cient di er signi cantli test determin probabl error reject null hypothesi singl coe cient singl perform paramet method exist tl test exist probabl make type error larger probabl tl probabl error tl small base case probabl error test smaller process call adjust adjust import context explicit implicit hypothesi test made cohen tl adjust set valu tl small experi measur ectiv tl metric directli measur qualiti learn indirectli measur ect agent coordin approach evalu tl avoid confound tl perform perform system compon schedul coordin al inappropri credit penal tl learn knowledg unimport infrequ guard review util learn knowledg section show knowledg gener learn quickli agent creat learn data gener execut schedul experi report agent oper explor execut attempt learn knowledg gener maxim ectiv schedul agent mix explor exploit learn direct explor option explor work agent access perform paramet execut schedul valu cost method schedul ect initi unknown set actual una ect distribut hidden determin valu perform paramet observ agent consist project discret probabl distribut method learn hard soft appli equal case continu probabl method densiti estim langlei estim continu probabl distribut empir data experi conduct phase base case run set assumpt learn linear regress set systemat alter test ect violat assumpt base schedul uniqu execut random order method perform control ms task structur task structur avoid case singl method ect valu soft deviat moder uniti facilit discret probabl distribut perform paramet method approxim learn empir frequenc tl window size learn soft tl show result base result depend qualiti soft small deviat larger number soft measur learn error appli pair learn method learn knowledg tl error learn distribut empir frequenc measur di erenc area cumul probabl plot actual learn distribut gure show calcul method simpl case normal divid total rang qualiti vari measur averag method actual learn figur di erenc cumul probabl learn actual distribut tl error learn hard determinist properti measur proport misclassi hard experi report paper begin assumpt hard exist hard method determinist properti elimin hard true remain determinist properti tl preserv actual hard measur extra system unabl elimin tl error learn soft linear regress measur di erent metric rst measur error tl infer soft measur error tl estim power factor infer rst proport true soft learn correctli soft learn number true soft base case soft averag di erenc actual power factor learn power factor soft di measur averag soft result figur show valu rst error metric base condit set outlin fewer distribut hard learn low error tl continu reduc number spuriou hard reach time schedul execut exist soft correctli infer schedul infer schedul explor robust test altern base depend independ qualiti distribut facilit hinder facilit hinder soft soft hard figur show sum error power base condit altern condit tend number schedul execut base condit fastest converg deviat power factor long plateau su cient data accumul begin learn small deviat depend hard prevent method depriv regress data infer soft distribut larger error power factor result gure convei distribut learn correctli figur show cumul probabl plot compar actual distribut learn distribut method ect singl hinder base condit plot show distribut schedul learn distribut close approxim actual distribut learn actual figur cumul probabl plot actual learn distribut qualiti figur show content gure altern condit outlin altern distribut hard learn speed soft infer gener reduc experi reveal unexpect di culti learn low error rate mask subtl limit prevent tl accur learn relationship depend figur situat shown gure demonstr case limit disabl elimin schedul disabl valid hard connect simul disabl hinder learn spuriou disabl elimin valid enabl method prevent knowledg made inaccess limit concern schedul execut practic futur version tl account minor patholog disabl hinder φ disabl disabl enabl relat learn correctli relat learn incorrectli relat miss figur depend prevent learn error graph gure import coordin knowledg learn quickli tl learn larg power factor quickli small learn hard enabl quickli soft shown empir probabl distribut learn probabl frequent valu distribut rapidli result tl robust learn hard method distribut small number schedul schedul tl infer exist soft power requir moder larger number schedul learn act local method method di erent agent hospit schedul experi singl agent learn quantit coordin tl fulli learn multipl agent agent access schedul execut characterist method design distribut version agent exchang execut schedul learn agent tl learn affect method dedic learn agent learn commun error error error base case distribut soft hard schedul execut delta comparison delta learn case depend uniform distribut power factor low soft base case schedul execut base case result averag error power factor case depend distribut soft hard schedul execut error uniform distribut distribut soft hard schedul execut depend distribut low power factor distribut soft hard schedul execut error soft distribut soft hard schedul execut small deviat power factor soft figur error learn hard soft method distribut di erent condit acknowledg ort partial sponsor advanc research project agenc air forc research laboratori air forc materiel agreement number govern author reproduc distribut reprint notwithstand copyright annot materi base work support nation scienc foundat grant view author interpret necessarili repres cial polici express advanc research project agenc air forc research nation scienc govern refer barbuceanu mark fox languag describ coordin multi agent system intern confer system page keith decker victor lesser quantit model complex environ intern journal intellig system decemb special issu comput model model characterist agent keith decker victor lesser design famili coordin algorithm intern confer page san june aaai press longer version umass keith decker li coordin hospit patient schedul intern confer system page nr draper smith appli regress edit seri probabl mathemat statist wilei mm veloso learn improv plan probabilist robot execut intern confer page hu wellman onlin learn agent dynam multiag system intern confer autonom page wasserman appli linear statist model david jensen paul cohen multipl comparison induct algorithm machin forthcom georg john pat langlei estim continu distribut bayesian classi er eleventh confer uncertainti arti cial page md mt pr utgo learn relev ect action mobil robot intern confer page sugawara victor lesser learn improv coordin action cooper distribut environ machin tan reinforc independ cooper agent mp singh mn read chapter adapt page morgan thoma alan victor lesser complex goal criteria applic schedul fourteenth nation confer arti cial page juli umass cs thoma alan victor lesser heurist task schedul intern journal approxim special issu version umass cs thoma victor brett anita ping xq zhang gp gp support situat speci protocol agent coordin comput scienc technic report massachusett octob wei learn coordin action system mp singh mn read chapter adapt page morgan zeng sycara bene ts learn negoti fourteenth nation confer cial page
DB/1117 3 journal intellig inform kluwer academ boston manufactur netherland design implement rol system mengchi liu depart comput canada abstract rol deduct system implement regina uniform declar languag de manipul queri integr import featur deduct support object complex class multipl inherit overrid schema de nition support structur valu functor object treat rst class provid power mechan repres partial complet inform set paper describ design implement import featur combin evalu strategi automat select strategi base natur queri data deduct queri rapid system introduct past lot ort made integr deduct gain approach includ featur declar rm logic foundat deduct object complex class schema de nition approach number deduct languag iql rock roll languag stai theoret level technic complic clear fulli implement ecient basi practic system implement rock lack declar queri formal logic semant provid imper languag design implement deduct system call rol base rol object languag origin present extend rol languag uniform languag de manipul queri integr import featur deduct languag support object complex class multipl inherit overrid schema de nition support structur valu functor object treat rst class power mechan repres partial liu complet inform set rol extens standard deduct languag datalog subsum special make di erent deduct languag support import integr constraint function depend uniform framework rol system class de nition persist directli class de nition queri evalu dynam select rule queri evalu dynam rewritten base data partial retain memori evalu dynam time dynam mechan select remov data memori space evalu strategi select automat base natur queri data user pure declar languag provid queri updat rule queri support conveni user rol describ design implement rol paper organ begin summari declar languag support rol section section present conceptu architectur rol section illustr storag manag rol section discuss queri process includ rol support featur section compar rol deduct highlight featur section conclud comment futur work languag overview present summari rol declar queri languag reader refer detail introduc rol object rol object class object distinguish class denot collect object share set attribut object collect denot class instanc class kind object identi er functor set class class relat aggreg gener kind object identi functor class object attribut relat design implement rol system rol object consist set set rule schema set class de nition isa dm dm attribut de ne class directli de ned attribut class superclass dm class inherit attribut superclass dm overrid block introduc addit attribut local instanc class instanc superclass exampl class de isa person isa fact rule rol provid inform object attribut fact repres form om fo om om object identi er functor object partial set rst form speci es object primari class valu attribut form speci es functor object primari class valu attribut nal form speci es set fo valu attribut exampl rule express ln head object express bodi ln sequenc object negat object arithmet comparison express object express fact variabl occur place attribut class exampl liu rol object consist rule schema set class de nition fact rule inform class attribut valu rol object run detail follow schema person ne oid class person parent ancestor isa person ne subclass person ne functor class famili ne set class fact person ag tom person ag joe ag salari sam ag salari bob person ag parent liz person ag parent ann person ag parent pat person ag parent jim person ag parent rule design implement rol system object class object identi er class person attribut attribut number parent object identi er class subclass person inherit attribut class person attribut salari functor class famili attribut children set class attribut cardin mean number element set person fact give inform primari ag object rule deriv valu attribut object identi functor object set construct hx xn partial set term construct fx complet set term deriv partial complet valu attribut rol object creat rol updat command set rule rol object requir strati ed order handl negat set properli strati cation automat determin depend graph mark graph construct add node class attribut rule object add edg rule head mark edg diagram negat object express object express partial set term exist rule hq qn head depend graph object shown figur ancestor parent children famili cardin person figur depend graph set rule object strati ed depend graph cycl mark edg set rule strati ed mark edg cycl strati cation determin order rule evalu datalog negat ldl relationlog liu rol queri languag user queri rol object directli textual user interfac indirectli graphic user interfac rol queri command queri ln ln queri express kind queri support schema object queri rol answer schema queri schema queri retriev inform attribut de subclass relationship schema queri answer base object list class de ned queri person subclass person queri isa person list attribut de nition directli de ned inherit overridden block queri list class attribut de ned integ queri cardin object queri user queri inform object repres fact rule object result queri base nal evalu combin inform queri pam queri queri design implement rol system queri queri instanc class person older person cardin set fact rule queri object queri obtain inform object repres inform object repres object queri fact rule origin form exampl queri list rule deriv valu attribut ancestor queri list rule deriv attribut valu instanc famili queri list rule class person queri queri output handl queri result displai list shown kind displai result user rol write command handl queri result result queri queri displai screen pam tom queri result store le desir valu variabl queri write command discard architectur rol current implement rol emploi convent architectur shown figur server includ system dictionari queri commun modul client includ user simpl lexic syntact commun modul client accept queri rol syntax ship server execut result return client displai commun liu server client process remot procedur call run commun modul system dictionari manag queri optim rule manag class manag fact manag storag manag type check type check commun modul commun channel lexic syntact analyz client server answer schedul fact base class base rule base textual interfac graphic interfac browser interfac figur architectur rol rol client client organ user lexic syntact analyz commun modul user interfac layer graphic web receiv process user invok procedur modul organ result displai user simpl input request browser view feedback server layer lexic syntact parser perform lexic syntact analysi user request rewrit intern form lter output process command store futur layer commun modul ship intern form user request receiv feedback server rol server rol server organ ve layer rst layer commun modul accept user request invok design implement rol system system dictionari manag queri optim process request ship result back client layer optim system dictionari manag optim process queri updat good execut plan send plan schedul system dictionari manag valid oper de nition schema rule inform check integr constraint layer execut execut plan optim invok fact rule manag class manag layer fact manag maintain data structur provid support rol queri rule manag process intent class manag store schema de nition process queri updat command class base layer storag manag rapid access class meta inform disk main job storag manag move data disk memori recent algorithm identifi data move memori disk design implement rol care attent paid ensur system ecient process queri larg volum data describ interest design implement issu detail storag manag rol rol storag manag perform rol data le manag memori manag retriev rule class disk index lookup updat support di erent kind data set class abstract data type repres kind rol fact rule di erent disk extern format input output method switch di erent user request rol rst check inform main memori inform main rol invok memori manag routin load data disk main memori data main memori rst rol continu process liu describ rol data le structur fact rule storag file structur rol data store number unix le rol le le header number node address logic node number le grow shrink link list node maintain activ list store current rol delet list link delet node le header pointer rst node activ node activ rst node delet highest node le node storag manag rst clear node data add begin delet node list node storag manag rst check delet node delet node list rst delet node system request addit le space node class rol class repres structur order achiev high speed structur class includ class boolean distinguish simpl class set class link list attribut class superclass link list explicit super class class subclass link list direct subclass class link list functor class item structur link list detail attribut class restrict integr constraint includ lower upper bound attribut inherit boolean indic attribut de ned class inherit superclass structur shown class id attribut attribut type mode boolean distinguish attribut type integ declar data type user de relationship shown figur fact fact rol store activ list fact le structur fact includ design implement rol system mode superclass subclass class restrict inherit mode type figur schema structur rol system ag indic fact individu object set object link list object repres fact set valu set store link list pointer class fact belong attribut link list store attribut fact structur attribut includ inform attribut mode integ indic type simpl data partial set complet set type store attribut pointer link list function refer attribut unknown ag repres unknown rule rule deriv inform object class attribut valu wide spectrum rule rol rol union structur store kind rule save storag space ecient data structur store rule id rule option oper delet posit rule negat mode type singl partial set composit set calculu set semant restrict simpl semant restrict set semant restrict semant restrict individu class de set class de class string restrict nition union store kind rule includ kind express set calculu restrict arithmet string set rule descript de nition structur liu index rol indic persist fact object store balanc tree object identi er kei bottom node store kei kei sequenc kei consist kei index provid object object node id fast rang search algorithm provid tree remain number level root node bottom tree matter branch search indic store index le fact primari kei secondari kei queri process user queri object object rst open open object rol load main memori meta inform rule class de nition base user rol meta inform main memori decid underli class de nition load main memori fact rule remov main memori memori space track main memori kind evalu strategi process user match evalu evalu gener uni cation altern strategi ecient applic perform poorli rol automat decid mechan user base natur queri knowledg data object match unlik deduct implement ldl coral rol inform deriv rule main memori memori space permit inform made persist inform rol result user queri main memori addit evalu case fact rule queri repeat object queri involv rule rol simpli match result user queri main memori design implement rol system object object queri queri involv fact object rol load relev fact main memori answer queri user object identi er belong class queri person fact queri load main memori previou rol answer immedi disk oper rst scan object identi er class scan object identi er subclass person strategi strategi forward chain xpoint comput start fact appli rule arriv queri approach studi semant logic main techniqu deduct featur rol introduct complet partial set term deduct languag partial set term partial attribut valu complet set term complet attribut valu major challeng implement implement featur ecient queri object queri rule gener answer queri number possibl extrem case rule evalu strategi recent result main memori rol match gener answer extrem case result main memori rol rst load fact rule main memori evalu rule strategi case handl approach uni cation dicult queri unifi partial set term complet answer gener uni cation involv complex functor set undecid rol doesnt support gener uni match liu queri evalu approach gener uni cation note queri queri evalu carri rol number fact irrelev queri gener magic set method kind queri rewrit rule base bind pattern queri relev fact gener view di erent irrelev fact queri evalu queri queri queri queri queri simpl match gener answer magic set method rewrit rule evalu queri list note queri worst case magic set method end evalu magic set method implement rol queri object queri rol rst check answer found match check rule evalu load main memori rule queri inform ancestor previou parent main rol evalu rule strategi inform ancestor main rol rst evalu rule ancestor strategi backward framework provid sld resolut start queri unifi queri subqueri ect restrict search space set fact produc queri main techniqu logic program languag prolog design implement rol system set good choic queri base object queri rule gener answer queri evalu subset set instanc person gener repeatedli cardin evalu perform accept rol approach gener uni cation kind queri partit set subset base rule convert queri subqueri arithmet final process subqueri perform turn reason approach queri set partit base rule queri queri directli gener uni cation set person base class de instanc person set person approach answer queri altern strategi good queri object queri match head rst subqueri evalu match rule partial set term subqueri evalu base discuss rol rst queri rst subqueri queri subqueri process depend bodi liu rule head match rol altern number time order answer queri ectiv combin evalu strategi rol gener answer user queri reason speed queri evalu rol algorithm divid part rst part subqueri evalu match part subqueri evalu part subqueri evalu result rst part subqueri evalu result previou part queri partit algorithm rewrit queri express queri number simpl queri express attribut class put queri express evalu match bottomup part evalu part put neg object set comparison express part evalu depend result part put part merg queri express part base rule fact object part evalu part shrink grow queri process rol altern eventu empti queri base object queri bob queri partit algorithm rst rewrit queri bob gener sg fy rol queri manag start queri evalu rst match comput answer set design implement rol system set lter irrelev answer approach process subqueri set result queri process rol call queri partit algorithm put subqueri set repeat evalu process parent ancestor queri partit algorithm gener part parent simpl queri express merg inform ag parent person found directli fact rule deriv piec inform object rol rewrit rule start evalu deriv minim maxim salari total salari set user issu queri comput rol rewrit rule start evalu queri process rol support rule queri conveni user write rol rule issu gener queri rol object schema liu class object isa object isa object fact object class class class john smith rule class rule object class instanc element set attribut extens rule object express rule bodi class variabl variabl class attribut rule queri rol dynam rewrit set rule rst evalu class attribut class attribut variabl rule slow object express rule rol rst evalu substitut valu variabl rule rewrit set rule object object student student rule de ned rol simpli class queri handl queri base object isa object rol rst evalu queri express isa object subclass attribut de nition rewrit queri group queri student student design implement rol system comparison relat system discuss major di erenc similar rol relat deduct object system term queri process rol memori base system support persist fact rule directli rol memori manag manag memori space memori space memori manag remov recent ldl coral support rol object speed queri answer avoid redund comput ldl coral discard object queri evalu begin featur rol mechan dynam rewrit rule ectiv combin approach user issu kind queri long syntact correct system di erent evalu strategi di erent stage achiev object model comput reason perform execut queri ldl coral evalu approach magic set rewrit compil time user provid queri form program compil predic queri form speci ed queri form limit evalu strategi user issu queri queri form system relat queri form queri match mode reject user point view coral support approach mechan system prolog system mechan strictli separ comput interleav user declar predic evalu fashion make call prolog system execut predic user ensur termin rol pure declar system user issu queri state worri term approach rol similar ek evalu rol support featur conveni user de ne gener issu gener queri syntax base semant rol support schema queri uniform framework liu discuss design implement rol version rol implement regina latest version internet world wide web home page run sun workstat sgi workstat dec workstat pc compat machin linux rst januari rol data applic teach advanc deduct deduct number world version rol paper develop regina public access end queri process rol system extend edg system acknowledg author anonym detail comment suggest signi cantli improv paper peopl particip implement min xing jun shu work partli support natur scienc engin research council canada refer vianu foundat addison abiteboul kanellaki object ident queri languag primit acm sigmod intern confer manag page apt van emden contribut theori logic program journal bal deduct type languag intern confer deduct page springerverlag lnc ullman magic set strang wai implement logic program acm symposium principl page design implement rock deduct system inform beeri ramakrishnan power magic journal logic zicari integr data model program paradigm acm sigmod intern confer manag page design implement rol system tanca logic program zaniolo ldl system prototyp ieee transact knowledg data design implement system acm sigmod intern confer manag page deduct evalu vldb topor declar procedur semant deduct objectori system journal intellig inform xie deduct system prototyp intern confer inform knowledg page acm wu logic foundat languag journal kifer wu logic program complex object comput system krishnamurthi naqvi real horn languag intern confer larg data page lo morgan kaufmann liu deduct object base languag inform liu overview object languag journal intellig inform liu type extens datalog set tupl journal logic lou ozsoyoglu deduct languag method method inherit acm sigmod intern confer manag page maier logic object technic report oregon graduat naqvi tsur logic languag data knowledg base comput scienc seshadri coral deduct system vldb smith smith aggreg gener acm tran sudarshan ad logic languag intern confer larg data page morgan kaufmann sterl shapiro art prolog mit ullman principl volum comput scienc db pj ts harland deduct system vldb db pj design overview deduct system intern confer data page ieee comput societi
IR/1118 5 introduct glean answer web nichola kushmerick comput scienc colleg dublin posit paper summar recent ongo research web inform extract retriev describ wrapper induct verif techniqu extract data structur boost wrapper extens techniqu handl natur effici express languag xml inform techniqu applic text genr stochast model xml schema align unifi theme research project develop enabl technolog facilit rapid develop larg web servic data access integr wrapper induct verif wide varieti valuabl textual inform resid form xml content html markup encod design human consumpt inform extract task automat popul content glean inform sourc web page wrapper import special case gener inform extract task wrapper special inform extract modul tailor sourc engin distinct wrapper underli search engin posit aaai spring symposium mine answer text knowledg base wrapper fairli simpl applic document process highli html text emit cgi script autom approach wrapper construct essenti scale applic integr data dozen thousand sourc wrapper induct involv machin learn techniqu automat gener wrapper input wrapper induct algorithm set train exampl document annot inform extract output wrapper contribut includ identif class wrapper suffici express wrap numer real web sourc site handl wrapper effici learnabl wrapper learn hand train learn algorithm consum fraction cpu wrapper induct import research ignor import complic applic consum extract data rare control remot deploi wrapper suddenli fail format regular reli violat automat repair wrapper ultim challeng simpli determin wrapper oper correctli problem move content wrapper verifi distinguish type chang develop wrapper verif algorithm train data learn probabilist model data correctli extract wrapper verifi output evalu model estim probabl wrapper oper correctli boost wrapper induct wrapper induct algorithm design regularli format document approach extend natur text newspap articl email messag extract rule learn wrapper induct simpl contextu pattern telephon inform successfulli extract natur text simpl rule telephon explor machin learn techniqu improv accuraci learn algorithm high accuraci low simpl wrapper induct algorithm result boost wrapper induct algorithm competit numer extract task algorithm hidden markov model superior demonstr boost wrapper induct xml inform retriev xml emerg power standard interchang structur document structur xml rise languag filter transform xml content languag develop inform retriev languag support rank grade queri spirit tradit inform retriev exist queri languag retriev section xml document phrase imposs rank result satisfi queri section variant retriev lower fill gap effici express languag xml inform retriev extend exist xml queri technolog grade textual similar oper unlik relat languag effici support similar essenti capabl data applic noisi textual identifi identifi duplic list book similar join identifi pair titl mutual similar demonstr text genr classif text classif research object class reflect document topic classifi newspap articl examin subject genr classif task newspap articl express product review articl amount technic knowledg assum exist text classif algorithm exploit word reliabl correct class investig suggest techniqu inaccur subject task shallow natur languag process techniqu tag estim term topic deriv document featur yield accur classif experi newspap domain confirm tag yield significantli perform term featur emploi techniqu inform filter heterogen digit visual inform retriev search result demonstr text classif techniqu stochast model xml schema integr schema integr challeng data retriev heterogen sourc integr map remot schema global mediat schema focu automat construct map heterogen sourc xml data export data data integr problem receiv attent effort larg ignor constraint nest structur address develop stochast model call stochast document markup model similar hidden markov state link stochast state emit token distribut state emit xml tag emit actual element content main essenti differ hmm decod time tag emiss distribut state emit xml tag tag demand path cyclic xml consist state emit tag emit decod harder examin heurist find path probabl constant factor path consist properli nest acknowledg research fund grant offic naval nation scienc colleg dublin research award list grate colleagu washington colleg dublin refer kushmerick effici express languag xml inform retriev journal american societi inform scienc press kushmerick express effici rank queri xml data proc acm sigmod workshop web kushmerick express retriev xml document proc acm int conf research develop inform page smyth web genr visual submit confer human factor comput system smyth fact classif digit librari proc workshop person recommend system digit smyth genr classif domain transfer inform filter proc european inform retriev freitag kushmerick boost wrapper induct proc nat conf page kushmerick wrapper induct inform extract phd univ kushmerick regress test wrapper mainten proc nat conf page kushmerick wrapper effici express artifici kushmerick wrapper verif world wide web doorenbo wrapper induct inform extract proc int joint conf page
Agents/1119 1 simplifi develop intellig agent technic report school comput scienc inform technolog rmit michael lin jame harland paper publish australian joint confer artifici intellig abstract intellig agent power artifici intellig technolog show paradigm mainstream softwar develop intellig agent scarc market place kei reason develop intellig agent softwar requir train typic develop undergradu struggl develop good agent system belief desir intent model similar paper identifi concept set found import develop intellig agent system relationship concept concept set develop intent easier current approach describ briefli project work illustr concept import design develop intellig softwar agent ai distribut multiag reactiv softwar agent introduct intellig agent power artifici intellig technolog show paradigm mainstream softwar develop agent offer wai fit natur view world agent orient program consid natur successor object orient program potenti chang build softwar agent natur model real world entiti show autonomi proactiv social agent natur model rang busi structur process militari command structur number applic agent technolog intellig agent make ration blend proactiv show ration commit exhibit flexibl face uncertain chang environ intellig agent scarc market place real technic reason develop intellig agent softwar requir train skill experi experi typic develop undergradu student struggl develop good agent system belief desir intent model similar decker discuss problem undergradu student approach agent orient develop includ lack suitabl background ai goal orient poor softwar engin lack experi deal concurr distribut commun protocol found kei problem student identifi piec break program tend build monolith plan handl creat collect plan appli context difficulti interfac agent environ reason develop intellig agent system difficult immatur tool lack good debug tool tool integr intern agent architectur suitabl middlewar infrastructur tool research prototyp lack support process programm familiar design object orient system design agent orient system differ number wai identifi interact pattern design guidelin design collect plan achiev goal design singl procedur perform function differ fundament develop intellig agent program paradigm learnt taught buzzword common complex concept intent difficult isnt lack agreement concept inconsist terminolog lack suitabl text work intellig agent scatter research paper collect process work number agent teach student assist build agent develop run workshop academia industri develop initi process agent design develop bdi system process explain fulli technic report refin develop paper identifi concept set found import develop intellig agent system relationship concept reli heavili standard belief desir intent concept found clarifi differ concept initi philosoph work logic theori implement dmar jack found import place emphasi concept percept action gener model agent import interfac agent extern environ found separ event goal dmar jack provid greater support execut engin reason goal bdi agent system work gener focuss system paper concentr concept requir intern intellig agent system team societi agent bdi model bdi model popular model intellig agent basi philosophi offer logic theori defin mental attitud intent modal system number implement architectur applic demonstr viabil model central concept bdi model inform inform aim undergradu develop detail answer question build intellig workshop develop deliv associ agent orient softwar primarili dmar australian artifici intellig recent jack agent orient softwar object possibl object motiv chosen delib mean achiev futur world state plan abstract specif mean achiev desir option agent plan bodi describ primit action achiev plan execut invoc condit specifi trigger event context condit specifi situat plan applic bdi model develop year strong relationship theoret work implement system paper describ abstract architectur instanti system dmar jack show relat bdi logic concept found develop system necessarili match concept develop theoret work necessarili concept arisen implement system jack addit complic small differ similar desir receiv differ emphasi work time desir understood thing agent achiev plai import role philosoph logic theori deal primarili assum consist set desir implement level motiv concept reduc event goal implicit creation goal treat event trigger plan event theoret framework plai kei role implement theoret model plan simpli belief intent implement plan central concept kei differ implement viewpoint bdi shown tabl belief desir intent belief goal intent relat db arbitrari event run plan concept intellig agent describ set concept develop intellig agent applic suffici build sort applic appropri approach bdi hope explain work develop formal semant framework develop event consid figur agent situat closer link theoret framework implement develop work progress build descript intellig agent begin properti situat figur action percept agent make set action select action perform descript agent intern work statement form made type made depend intern agent architectur action agent move north agent action basic agent abil effect environ simplest form action atom instantan fail succe gener case action durat behaviour produc partial fail move action chang agent locat addit action directli affect agent correspond abil agent isnt structur term plan goal abil piec code exist benefit written agent imag process vision percept input locat fire indic intens agent obtain inform environ action essenc intellig agent ration make number question intellig agent action perform goal work attempt mobil interact social mechan answer kind question core intellig agent process result fulfil ration expect persist revisit good reason import answer question agent singl goal time singl mean goal reduc agent special case convent program figur proactiv agent reactiv agent event scope make intellig behaviour note concept fundament intellig repres explicitli choic goal repres variabl updat made intern work agent figur intellig agent proactiv reactiv proactiv agent pursu agenda time agent proactiv impli goal modifi agent intern execut select action select goal persist constrain select action reactiv agent chang behaviour environ import aspect make balanc proactiv reactiv aspect hand agent stick goal hand environ account kei reconcil make agent suitabl identifi environ event distinguish percept event interpret percept agent fire percept percept give rise fire event fire control event depend histori possibl factor goal call agent work rescu civilian goal defin state world agent bring definit rule mainten goal avoid safeti constraint move tabl robot goal give agent autonomi proactiv import aspect proactiv persist plan achiev goal fail agent altern plan achiev goal question found goal requir greater emphasi typic found exist system import develop identifi top level goal agent subsidiari goal achiev main goal modifi execut engin significantli reason goal usual bdi implement includ reason goal select goal consist pursu figur ad plan belief differenti top level goal subsidiari goal subsidiari goal import treat differ reason process goal event occurr event extract gener intern basi clock event trigger inform action perform immedi action gener directli event correspond execut event import creat reactiv agent identifi import agent react agent realist applic limit comput resourc limit abil environ auxiliari concept plan belief belief effect cach perceiv inform plan effect cach wai pursu goal figur concept aid option belief essenti agent limit sensori abil build knowledg world time plan essenti reason pure comput plan technolog comput speed plan action descript incompat real time make reason provid librari plan avoid action precondit provid action mean perform repres effect continu action oper time space uncertain world suffici detail principl plan unrealist larg applic plan plan achiev goal fire plan rout follow rout fire put concept plan common agreement detail point view adopt specif notion abstractli plan achiev goal function return action perform function account current state world action involv figur agent execut cycl plan comput reason desir includ requir construct plan runtim action descript belief aspect agent knowledg inform agent agent fire concept relat bold execut cycl agent agent execut cycl agent situat part cycl involv ration consist figur percept interpret give event belief updat inform percept event yield reflex action goal goal includ complet goal select plan current plan plan requir plan chosen chosen plan expand yield action schedul perform bdi abstract execut cycl consist event trigger match plan select subset updat intent execut extern drop success imposs attitud execut cycl present differ bdi execut cycl number wai includ reflex deriv event interpret process goal plan reason goal primari contribut role top level goal distinguish event achiev role event creat suitabl reactiv agent case applic work recent describ greatli simplifi version part applic order illustr concret concept identifi project goal creat robot deploi disast earthquak task carri includ rescu evacu peopl control fire challeng face includ lack inform environ obstacl obstruct potenti limit commun simul number compon simul aspect disast scenario intent aspect combin synergist provid realist complex challeng environ number type agent system includ fire polic agent simul cycl agent receiv visual inform possibl heard inform due space limit paper focu singl agent type simpl set behaviour focuss fire design fire engin agent concept earlier concept identifi instanc agent system process design plan agent piec inform impli addit belief impli addit goal plan methodolog detail design agent system concentr illustr instanc relev concept identifi defin consid question agent answer run arent specif applic specif agent architectur detail design agent work plan design task scope paper requir extens methodolog focu initi aspect process identif relev concept class concept instanc inevit identifi design progress percept repres interfac partial predefin type percept visual auditori auditori inform broadcast inform case agent messag civilian cry state heard cry messag direct specif agent agent content messag agent center aspect perceptu inform control design decid visual inform current view environ includ thing fire percept process build knowledg environ extract event case visual inform process order add inform map world built increment process extract posit fire assess event gener updat knowledg environ action agent perform part interfac environ addit action defin affect start point case agent perform extern action reduc fire current move move agent unspecifi number step messag move action appli repeatedli achiev desir fire multipl time agent move time reach destin identifi earli action plan rout point intern action rout paramet move code exist plan rout current posit clear advantag goal plan achiev exist code initi set part extern interfac simul intern obviou major goal fire engin agent put fire identifi goal discov fire addit thought yield goal assist teammat put fire coordin team effort fire goal agent motiv extern defin percept action set goal earli design made tempt treat goal impli belief exist fire impli goal fire approach number issu hard fire pursu agent deal difficult add goal directli prompt cue goal find fire exist independ cue result exploratori behaviour goal inhibit goal addit identifi goal adopt drop goal plan achiev part achiev goal rel prioriti interact goal section thing happen result adopt goal event receiv messag request fire result goal assist team mate put fire event notic fire result goal fire move event identifi occurr make agent add delet chang goal chang agent pursu goal occurr affect belief event result process percept extract inform fire check list fire obtain event event gener intern result agent behaviour send request assist agent gener event event updat trigger plan gener reflex action larg set event develop iter process develop full design detail design methodolog layer identif event conjunct increment refin set plan initi event identifi typic occurr alert agent instanti top level top level goal event includ instanti goal reflex action broadcast exist fire event agent goal event fire grow larger threshold design lead goal team effort lead current prioriti lead goal assist set plan relat event jack capabl identif event determin interpret process percept receiv order event turn affect inform environ repres gener fire event visual percept explicitli repres fire belief knowledg agent maintain inform form special knowledg inform arbitrari suitabl data structur applic primari inform intern map environ includ locat updat data structur part import process percept belief tend primarili wai extract event fire knowledg exist fire determin plan achiev goal situat inform altern wai achiev goal achiev depend belief belief identifi import addit fire attend current prioriti rout locat due insuffici inform plan describ wai achiev goal full power bdi approach advantag defin simpl initi straightforward achiev variat ad modular fashion develop simpl agent manag straightforward case addit variat complex case plan set check coverag overlap situat simpl pair plan achiev goal fire plan simpli fire agent locat plan obtain rout move fire agent altern plan put fire plan fire shown plan locat posit fact plan simpl implement reactiv set trigger store approach target coordin approach unabl handl sequenc action trigger arent environ unabl manag commit reason plan intern state track sequenc action discuss present concept found import build bdi agent system relationship concept found concept clearer easier teach bdi model concept distinguish goal percept event goal bdi distinguish merg type feel distinct import goal event plai role achiev reactiv proactiv goal persist achiev explicitli repres goal vital order enabl select compet deal conflict correctli handl goal pursu time creat delai highlight goal select import issu bdi system simpli assum exist select function import percept action highlight role event creat reactiv agent introduc reflex concept concept intent found difficult explain simpler notion provid stage present concept design process refin explain fulli focuss detail design view complementari methodolog gaia focu higher level design analysi requir aspect agent system choic concept driven sourc experi work number agent teach student assist build agent develop run workshop academia industri survei rang agent system deriv concept principl consensu delib agent research commun bdi model reason common foundat intellig agent shortcom model order avoid survei rang agent system address intern intellig softwar agent detail work includ continu appli concept design process applic start survei student concept regard natur develop agent system develop formal semant concept develop support tool high prioriti concept identifi extend support creation social intellig agent acknowledg support agent orient softwar pty arc grant refer bratman practic reason harvard cohen levesqu intent choic commit artifici decker decaf agent plan smart schedul present workshop infrastructur scalabl ma autonom agent wooldridg model agenc jen wooldridg applic intellig agent chapter agent market jen approach build complex softwar system commun inform system engin intern workshop inform system june methodolog agent orient softwar design technic report school comput scienc inform rmit rao georgeff model ration agent principl knowledg intern page apr rao georgeff abstract architectur ration agent intern confer principl knowledg page san morgan kaufmann publish home page russel norvig artifici modern approach prentic shoham program artifici goal honour lin kinni gaia methodolog analysi design autonom agent
IR/1120 5 metric textur imag retriev abstract metric textur imag base sign distanc imag boundari chosen queri metric boundari distanc measur insensit sampl retriev result obtain respect visual retriev perform improv boundari obtain statist learn algorithm call support vector machin boundari simpli repres vector combin coeffici result brodatz textur significantli retriev perform achiev compar tradit euclidean distanc base approach techniqu develop learn pattern similar textur class relev feedback imag textur distanc support vector learn similar introduct content base imag retriev emerg import research area applic digit librari multimedia primit visual studi twenti year techniqu develop textur textur analysi made contribut area content base retriev larg imag video textur visual queri retriev similar pattern base textur properti imag convent textur imag euclidean mahalanobi distanc imag queri imag calcul rank smaller similar pattern stan li microsoft research china district beij queri kind metric retriev result queri visual similar retriev perform sensit sampl topolog retriev accuraci low problem illustr fig class repres similar imag queri belong class retriev result euclidean distanc metric util queri retriev pattern belong class retriev pattern belong class problem classic effort made address issu context imag address difficulti class class class class class fig exampl imag featur belong class queri class nonlinear boundari separ sampl class class distanc metric term similar kei compon imag retriev metric call measur imag similar basic idea boundari separ similar imag remain boundari pattern insid fig boundari separ pattern class class sign distanc nonlinear boundari rank imag boundari learn train exampl construct imag proper learn algorithm applic content base imag retriev good simpl comput common requir learn import larg imag support vector machin learn boundari foundat svm develop vapnik embodi structur risk minim shown superior tradit empir risk minim principl emploi convent artifici neural network voronoi tessel partit featur boundari difficult repres center repres cell retriev base nearest center criterion boundari learn svm gener properti simpl support vector combin coeffici base similar measur retriev perform insensit sampl result obtain respect visual metric improv retriev accuraci paper organ section describ basic theori svm section present rank scheme boundari distanc metric retriev perform evalu section metric extend learn pattern similar interact learn section section support vector machin set train vector belong separ ü ê ò find hyperplan separ data fig fig maxim margin distanc hyperplan nearest data point linear classifi term optim separ hyperplan svm solv optim problem ä û lagrang multipli solut û £ û £ £ û £ support vector margin hyperplan fig classif class arbitrari hyperplan optim separ hyperplan largest margin identifi dash pass support vector support satisfi £ ö svm realiz discrimin kernel map fig sampl input space separ linear linearli separ map featur space typic kernel polynomi ã ý ü ý polynomi ý gaussian radial basi function ã ý width gaussian function layer percept ã ý ü ý paramet perform chosen imag retriev experi input space φ featur space fig featur space relat input space nonlinear map surfac nonlinear input space cort vapnik introduc slack variabl penalti solv problem solut ident separ case modif lagrang multipli constraint boundari distanc metric rank recal pair defin separ hyperplan boundari equat û ü kernel boundari £ ü £ £ equat £ ã ü ü £ ð support £ £ combin coeffici £ ã kernel function definit distanc sign distanc £ ü £ £ point ü boundari £ ü £ £ kernel function ã defin ü £ £ £ ü £ £ è ñ case group similar boundari definit distanc boundari £ separ class sign distanc pattern ü boundari comput £ £ £ ü ü £ £ ü £ support vector construct £ optim £ boundari distanc pattern class posit distanc pattern neg distanc boundari definit distanc sign distanc imag boundari £ calcul sort rank pattern respect boundari queri imag pattern õ boundari index £ found £ £ equat calcul sign distanc imag boundari definit sign distanc valu rank imag respect queri retriev perform brodatz textur textur class evalu metric textur imag retriev ¢ imag divid overlap ¢ center ¢ grid origin imag train set retriev kind similar textur imag form textur imag test retriev perform textur featur calcul gabor filter bank scale orient appli gabor filter imag result filter imag standard deviat filter imag calcul featur vector subscript repres scale orient featur vector dimens nonlinear boundari learn svm train set kernel queri boundari index found distanc valu pattern boundari calcul sort order ideal top retriev origin imag measur retriev calcul averag retriev accuraci defin averag percentag number pattern belong imag queri top match correct pattern top retriev imag retriev accuraci obtain euclidean distanc measur lower boundari distanc measur retriev perform top entir retriev consid comparison measur respect number top match shown fig obviou perform metric consist euclidean distanc base approach relat issu previou evalu metric textur imag retriev goal retriev class imag top match visual similar textur retriev top match ma manjunath discuss problem learn vector quantiz learn similar metric extend natur solv problem basic idea averag retriev accuraci boundari distanc euclidean distanc number top match consid fig retriev perform comparison euclidean distanc boundari distanc measur partit origin featur space cluster visual similar pattern brodatz textur class group perceptu similar cluster detail discuss result base boundari distanc metric metric relev feedback posit neg exampl submit feedback learn refin boundari queri consist natur part corel photo collect internet manual classifi imag class number imag class equal vari gabor filter extract featur channel result featur dimens preliminari result shown fig retriev accuraci reach work compar perform base relev feedback classic larger ongo averag retriev accuraci number relev feedback fig retriev perform number relev feedback present metric call textur imag retriev boundari learn effect support vector machin boundari simpli repres retriev perform significantli improv boundari distanc metric develop learn pattern similar interact learn refer niblack qbic queri imag content proc storag retriev imag video vol pp feb tool content base manipul imag proc storag retriev imag video pp feb minka learn societi technic manjunath featur retriev imag ieee vol pp ieee vol pp evalu dissimilar measur color proc pp statist learn john wilei swet discrimin analysi imag ieee vol pp cort vector machin vol pp photograph album artist ma featur learn proc pp similar textur imag proc pp power tool interact imag ieee tran circuit system video vol pp sept
IR/1121 5 stanford internet lui gravano comput scienc depart stanford chang comput scienc depart stanford hector comput scienc depart stanford andrea paepck comput scienc depart stanford abstract document sourc intern network organ internet individu organ search engin vendor index intern document collect search engin typic incompat support queri model return inform queri result adequ merg export metadata collect index assist resourc paper describ emerg protocol internet retriev search facilit task queri multipl document sourc start develop uniqu group effort coordin stanford digit librari involv compani organ object paper give overview start protocol discuss process led definit introduct document sourc intern network organ internet sourc content hidden search interfac model vari sourc sourc individu organ search engin vendor index intern document collect organ benefit servic provid unifi queri interfac multipl search engin user singl combin document materi base work support nation scienc foundat cooper agreement fund cooper agreement provid industri partner stanford digit librari project recommend express materi necessarili reflect view nation scienc foundat sponsor sourc paper describ start emerg protocol internet retriev search goal start facilit main task metasearch ffl sourc evalu queri ffl evalu queri sourc ffl merg queri result sourc start develop uniqu group effort involv compani organ object paper give overview start protocol discuss process led definit ffl describ histori includ current statu refer highlight exist inform provid search engin builder ffl explain tradeoff make design ffl comment work close relat start histori digit librari project stanford coordin search engin vendor kei player inform design protocol search retriev inform distribut heterogen sourc initi contact steve presid infoseek june idea stanford collect view search engin vendor address problem hand act design protocol reconcil vendor idea kei motiv inform procedur avoid long delai involv definit formal standard start effort pl start stand protocol internet retriev veriti wai microsoft network join initi group novemb circul preliminari draft describ main problem address sourc evalu queri merg queri result schedul meet peopl compani discuss problem feedback met individu compani show coupl slide problem discuss solut problem detail base comment suggest produc draft produc draft feedback origin organ start particip compani organ excit gil harvest laboratori netscap held workshop stanford major particip august goal workshop iron controversi aspect feedback final draft defin start interest design protocol power address problem hand adopt common denomin approach solut interest interact imposs solut incorpor sophist featur search engin challeng driven simplic walk fine find solut express complic imposs quickli implement search engin vendor aspect made experi challeng deal compani proprietari rank document section compani reveal algorithm export inform metasearch queri result mention specif complet refer implement protocol built cornel carl lagoz commun design profil standard base start profil origin call chang profil simpl distribut search rank find sponsor present start web consortium formal standard emerg goal present paper sigmod confer sigmod commun involv effort internet central mod search resourc discoveri internet import problem sourc sourc resourc queri result client figur metasearch queri queri evalu sourc resourc metasearch model problem section describ basic metasearch model underli main problem metasearch face todai problem motiv effort start view internet potenti larg number resourc dialog inform sourc resourc consist sourc sourc collect text document comput dialog search engin accept queri client produc result assum document nest document document data geograph protocol simpl sourc collect paper written collect web page index metasearch end typic issu queri multipl perform main task metasearch sourc evalu queri submit queri sourc merg result sourc present user issu queri queri multipl sourc metasearch issu queri sourc resourc figur sourc evalu queri figur resourc elimin duplic document queri difficult metasearch queri sourc independ build metasearch nowadai hard task search engin larg incompat text search ffl queri languag section ffl rank document queri result secret algorithm section ffl export inform sourc standard form section sourc constitut emerg librari comput scienc technic report visit metasearch problem discuss illustr agreement search engin vendor metasearch work effect section summar metasearch requir facilit agreement problem metasearch submit queri multipl sourc interfac capabl sourc vari dramat basic queri model sourc support vari search engin support boolean retriev model queri condit document satisfi queri result set document queri return document word commerci search engin support variat retriev model queri list document assign score similar queri queri result rank document queri return rank document typic base number occurr word document queri result word word vice unlik case sourc support boolean retriev queri syntax differ queri document word express problem field search sourc sourc support queri document word sourc support abstract field queri complic result stem algorithm list implicit queri model sourc make queri retriev document stop word process word user document rock group behavior sourc disallow elimin stop word queri sourc result metasearch translat origin queri adjust sourc syntax metasearch characterist sourc work illustr complex involv queri translat section queri multipl sourc easier sourc support common queri languag support languag queri translat simpler sourc reveal portion languag support rank typic depend number document sourc queri problem sourc support retriev model rank document document queri wai comput similar make matter rank algorithm proprietari search engin detail publicli merg queri result sourc unknown rank algorithm hard algorithm merg multipl document sourc report document score sourc report document score queri merg result singl document rank higher vice search engin design top document queri score hard merg queri result sourc rank algorithm reason algorithm rank document differ base collect document sourc special comput word document word tend low weight formula comput weight word high weight sourc total unrel comput scienc document word assign document low score queri word assign document high score queri similar document receiv score sourc rank metasearch addit inform merg queri result problem metasearch thousand sourc queri sourc charg sourc larg time crucial metasearch contact sourc document queri metasearch inform sourc content sourc freeli deliv entir document sourc inform type sourc export content web critic describ collect metasearch metasearch grab sourc content summar altavista perform requir sourc export succinct descript sourc inform search import sourc describ content sourc export kind content hard metasearch assess kind inform sourc cover metasearch requir sophist metasearch perform task order effici queri multipl ffl extract list sourc resourc period find sourc ffl extract metadata content summari sourc period decid sourc potenti user ffl issu queri sourc resourc ffl result multipl merg present user protocol section defin protocol address metasearch requir section protocol meant user write queri queri instanc commun sourc sourc stateless deal secur error report main motiv protocol simpl easi implement protocol describ architectur describ facil sourc provid order metasearch facil provid sourc rang simpl kei challeng develop protocol decid level sophist metasearch search simpl sourc sophist import minim function simpl sourc compli import sophist sourc export richer featur protocol requir option featur sophist sourc protocol deal inform exchang sourc metasearch result inform format harvest transport transport gener heat debat start workshop expect start inform deliv multipl wai practic start specif exampl give illustr content deliv start includ mechan format content object encod structur queri languag section describ basic featur queri languag sourc support cover function offer commerci search queri boolean filter rank express section queri properti queri result queri specifi maximum number document thing section filter rank express queri filter express boolean rank express filter express specifi condit satisfi document queri result document answer rank express specifi word order document queri result document answer rank time word queri filter rank queri return document author word titl document match filter express rank text match word queri filter express assum document qualifi rank rank express queri rank express result queri set object match filter express search engin support filter rank support filter sourc support type express sourc type support part metadata filter rank express multipl term filter rank express combin term oper rank express combin term simpli group set term rank express weight indic rel import rank express defin express power filter rank express balanc search engin builder metasearch builder gener power featur engin call metasearch simpler filter rank search engin support advanc featur simpler filter rank express engin common easier metasearch main market internet search prefer simpl express custom simpl queri search engin builder cater broader mix custom custom requir sophist queri capabl defin filter rank express start defin basic build block queri show string adorn field modifi build atom term describ construct complex filter rank express atom term heavili discuss issu workshop support multipl languag charact set initi design support queri multipl charact set languag search engin vendor felt strongli limit decid earli workshop includ question support queri document spanish word handl queri document abstract includ english word issu handl document british english american english workshop discuss make support submit english queri english explicitli languag design settl english ascii give queri writer substanti power languag charact set term queri languag modifi unord list attribut queri languag string string qualifi languag countri mean string repres word american english qualif format rfc support multipl charact actual string unicod sequenc encod nice properti encod code plain english string ascii string unmodifi attribut field modifi term field modifi term match document modifi august make decid defin set attribut sourc support set larg user express queri set simpl choic recommend attribut set heat attribut requir sourc support requir sourc support attribut make protocol harder adher sourc consid candid attribut set defin standard effort section exist attribut set attribut determin discuss decid pick gil attribut turn inherit attribut section gil set attribut simplifi includ attribut ad attribut gil set consid discuss set attribut field attribut recommend sourc support attribut mark gil attribut set explain attribut set sourc cover ffl field specifi portion document text term author titl term field assum field mark requir mean sourc recogn field sourc freeli interpret rest field option field correspond field titl author linkag languag field pass document sourc part relev feedback relev feedback user request document similar document found linkag field document return queri result document retriev protocol document mime list url mention document field pass sourc queri express queri ad flexibl search engin vendor capabl inform metasearch sourc richer nativ queri ffl modifi specifi valu term repres treat term phonet modifi govern inform locat effort facilit access inform term modifi search engin support modifi correspond attribut modifi default phonet stem stem thesauru thesauru truncat left truncat case insensit modifi make field filter stem document satisfi express word word complex filter express complex filter express base simpl subset queri standard oper build complex filter express term set oper easi support suffici express filter express oper sourc support filter support oper ffl ffl ffl ffl requir distanc order term matter term filter document match filter express word word order matter note prevent user document sole qualif word queri evalu oper queri compon proxim oper interest search engin vendor found initi unidirect bidirect unaccept complic implement simplifi proxim oper unidirect word distanc search engin vendor thought oper inform found unreason limit final manag current specif complex rank express oper build complex rank express term rank express oper simpli group set term oper repres common construct queri typic flat list term origin design oper rank express search engin vendor felt languag express oper includ sourc support rank support oper sourc simpli ignor oper rank process rank express oper interpret oper search engin order rank illustr rank sourc document weight determin local search word weight word search engin assign document score rank express oper minimum engin score algorithm queri assign document score rank express interpret oper list oper build rank express sourc provid richer semant user queri term rank express weight number indic rel import term queri rank weight express search engin treat term import term rank document queri result result specif complet specif queri queri includ inform addit filter rank ffl drop stop sourc delet stop word queri metasearch turn stop word sourc sourc metadata ffl default attribut set languag queri notat queri includ attribut attribut set term correspond languag english ffl sourc evalu queri addit sourc queri submit section ffl answer field return queri answer field sort queri order ascend descend score document descend document minimum accept document score maximum accept number document complet queri repres list provid filter rank answer queri encod harvest discuss section encod start inform illustr queri content encod object queri number bracket attribut number byte facilit start stem titl author queri specifi sourc elimin stop word filter rank express process word filter express stem document word titl match subexpress stem queri result titl author addit linkag return document score rank express answer document top score return merg rank type complic interpret queri result multipl sourc sourc execut depend local queri capabl sourc ignor part queri complic sourc algorithm rank document queri result sourc reveal rank algorithm complic rank inform insuffici merg multipl queri sourc execut queri rank algorithm actual document rank depend content section discuss protocol cope issu mention sourc requir support featur queri languag section sourc decid ignor part queri sourc return queri process queri illustr includ report error mechan assist metasearch interpret queri result sourc support part queri queri filter stem rank sourc simpli ignor rank actual queri sourc process filter stem empti rank express actual queri return queri result merg queri result multipl sourc sourc return inform document queri ffl unnorm score document queri ffl id document ffl statist queri term rank express modifi queri number time queri term document weight queri term assign search engin sourc normal tfidf weight queri term weigh term document search engin number document sourc term inform provid part metadata sourc ffl size document ffl number token determin document result queri start object type seri object templat type object correspond document queri result result queri sourc start stem start comparison deduct system jeffrei ullman object report properti entir queri result learn elimin term rank express word stop word find document queri result document satisfi filter score lower rank express object correspond document queri result url linkag score rank satisfi filter express word document titl share stem author document document object statist crucial rank merg word time word time size document word metasearch rerank document obtain criteria retriev illustr object describ document result queri sourc start achiev opportun centuri avi mike jeff ullman document lower score document document match queri lower score artifact rank algorithm sourc due characterist hold sourc metasearch simpli discard sourc comput score document base number time word rank express document metasearch rank document higher document word document word show metasearch document multipl queri result sophist scheme document frequenc queri unresolv issu merg document rank multipl sourc possibl rank document belong larg document sourc inform origin sourc design final document rank goal protocol resolv simpli provid metasearch experi varieti formula approach combin multipl queri result discuss search engin clear hard provid statist queri result reason time result return typic comput document lost return document score queri result rank sourc provid queri result sampl document collect set queri part metadata investig design sampl collect queri metasearch treat sourc receiv queri produc document rank metasearch approxim sourc rank document knowledg sampl collect sampl queri carefulli metasearch draw calibr queri result order produc singl document rank sourc metadata select sourc queri queri inform sourc content capabl section describ piec metadata sourc requir list metadata describ properti content summari sourc piec separ metasearch retriev metadata piec retriev singl sourc support sophist search export data section describ inform resourc export inform identifi metadata sourc resourc sourc metadata attribut sourc export inform give valu metadata attribut metasearch inform rewrit queri send sourc support part queri languag section attribut set attribut set defin describ sourc set attribut determin discuss defin set metadata borrow attribut gil attribut set ad mark attribut particip organ conclud attribut mark sourc support field linkag abstract contact attribut sourc list option field support sourc addit requir field linkag titl field option accompani list languag field sourc requir field list languag list attribut list modifi support sourc modifi option accompani list languag support modifi stem languag depend metadata object requir sourc support field retriev sourc report languag document queri accept queri involv field sourc report combin field modifi legal sourc attribut author stem illeg author field stem modifi support context sourc attribut specifi sourc support rank express filter express attribut list minimum maximum score document queri sourc inform merg interpret score sourc attribut form identifi rank algorithm sourc actual algorithm sourc algorithm merg rank attribut valu mean sourc token extract index token string american token string spanish metadata attribut origin requir sourc export list charact token separ mean blank delimit inform suffici complet token metasearch decid queri includ term case separ sourc export regular express describ token gener describ token arbitrari languag charact deem complic support settl current simpli requir sourc token metasearch learn token work submit queri sourc examin actual queri sourc queri result metasearch token attribut url queri result sampl document collect linkag attribut report url sourc attribut url content summari sourc object metadata attribut sourc start phonet rf es stanford db group sourc support author field addit requir phonet modifi accept queri filter rank document score produc rang document american english spanish queri submit sourc content summari sourc content summari content summari metasearch sourc queri summari manual abstract metadata attribut section approach yield outdat incomplet burden sourc administr end sourc summari simpli entir content sourc approach similar web addit requir sourc export partial data content data automat order magnitud smaller origin proven distinguish sourc queri content summari ffl list word sourc list inform indic word list stem word list includ stop word word list case sensit word list accompani field document occur word list includ stop word word case accompani field shown word qualifi languag ffl statist word includ total number post word number time word document frequenc word number document ffl total number document sourc object part content summari start titl titl es content summari report statist case insensit word qualifi field inform english word titl spanish word titl document summari document sourc metasearch inform decid queri good match resourc definit sourc discuss section model sourc group singl resourc dialog inform resourc export contact inform sourc resourc simpli export list url metadata attribut sourc access format data metasearch learn contact sourc resourc object contact inform resourc object report sourc queri url obtain object start relat effort effort aim support major function digit librari acquisit inform section discuss work relev standard architectur inform retriev discuss attribut set mechan describ document sourc comment exist internet metasearch relev standard effort term share goal standard function explain facil requir server export client dynam configur match individu provid option support common denomin server standard specifi queri languag queri section scan servic client access sourc content increment similar simpler simpl main concern specif tailor facilit requir inform export term document statist part queri result merg multipl document rank step bridg gap librari commun wide internet search commun mention effort defin simpl profil standard base start addit standard project focu provid framework index queri multipl document sourc harvest includ set tool gather access inform internet harvest gather collect extract index inform sourc broker retriev inform broker broker provid queri interfac gather inform project relat harvest netscap descript index access structur metadata descript inform object work complement harvest defin inform function sourc export metasearch harvest broker act benefit start inform sourc export relat effort focu defin attribut set document sourc discuss built effort defin protocol relev attribut set document includ attribut set dublin core warwick framework attribut set regist larg set bibliograph attribut wide adopt librari catalog focu dublin core primarili develop simpl usabl set attribut describ essenti featur network document web intent set warwick framework architectur mechan incorpor attribut valu set singl inform object chose support document albeit abil mix attribut model attribut notabl effort includ attribut set gil profil base attribut set metasearch exist internet queri multipl web index support major metasearch task section select sourc queri merg queri result exampl metasearch includ metacrawl savvysearch metacrawl savvysearch support metasearch task provid sort sourc select savvysearch rank access sourc queri base inform past search estim network traffic support unifi queri interfac access underli interfac common denomin underli sourc queri featur support uniformli underli step requir metasearch local implement miss function metacrawl process phrase search metasearch document queri result metacrawl document retriev analyz savvysearch simpli report document origin sourc rank mention stanford design digit librari project host varieti metasearch discuss metadata architectur architectur base requir start inform sourc export internet web import compon data manag system search resourc discoveri internet resourc central start protocol simpl fundament facil access start significantli streamlin implement enhanc function offer discuss issu emerg start experi provid lesson deal internet data access refer lui kevin hector andrea paepck stanford protocol internet retriev search technic report stanford august access gerard salton automat text retriev inform comput addison hector andrea paepck boolean queri map heterogen inform sourc ieee transact knowledg data august hector andrea paepck predic rewrit translat boolean queri heterogen inform system technic report stanford access jame bruce croft search distribut collect infer network annual sigir ellen narendra ben collect fusion problem text retriev confer lui hector anthoni effect gloss discoveri problem acm sigmod lui gravano hector gener gloss broker hierarchi intern confer larg data base page septemb nation inform standard organ inform retriev applic servic definit protocol specif access profil simpl distribut search rank draft octob access mic peter michael duan wessel customiz discoveri access system technic report depart comput august access hardi resourc descript messag juli access mainten agenc attribut set semant access septemb stuart jean eric ron jr metadata workshop report access dublin core march carl clifford ron jr warwick architectur aggreg set metadata technic report cornel comput scienc june christian applic profil govern inform locat servic version octob access prof erik selberg oren etzioni search comparison metacrawl intern www andrea steve hector scott steven martin terri winograd digit overview select highlight stanford digit librari project ieee comput michel lui andrea paepck stanford digit librari metadata architectur technic report stanford octob intern journal digit access
DB/1122 3 effici index structur oid index parallel tempor system depart comput inform scienc norwegian scienc technolog norwai abstract system base logic oid index convert logic oid physic locat tempor objectori system timestamp object version previou paper studi perform simpl index studi shown mainten object tempor updat time object updat convinc index suitabl describ effici oid index structur call tempor oid index main goal support tempor index perform close version effici easi tertiari storag migrat partit index part parallel show index effici partit parallel introduct tempor system object updat make previou version previou version object access queri tempor support transact valid transact time context system maintain timestamp object version timestamp commit time transact creat version object valid time time interv denot time interv object valid model world object system uniqu identifi object identifi retriev object disk oid physic logic physic oid disk block object resid directli logic oid oid index convert logic oid physic locat earli oodb storag manag physic oid perform commerci oodb physic oid major reloc migrat object schema difficult show logic oid assum access current version object access effici benefit object current object previou version histor object updat previou version move histor version store current updat time object updat note long modifi od written log updat server group server group server group server group server server server server server server server server server server server server server server server server server server server server server server server server server server server server server server server server fig system server group server previou paper studi perform index studi shown mainten updat object convinc index structur benefici requir context parallel tempor oodb report parallel index structur support index partit object declust organ rest report sect give overview relat work sect give short overview descript parallel sect describ index effici sect describ tempor sect describ physic data organ sect describ algorithm oper sect give overview larg object support sect conclud report outlin issu research relat work oid index altern oodb studi al previou paper develop cost model oid index lookup cost nontempor studi memori util buffer page index entri studi extend tempor oodb tempor simpl extens tradit assum work access method secondari index tempor good survei index time evolv data salzberg tsotra shown tradit access method suitabl oid index previou studi issu overview oodb system design high strategi achiev base design parallel server data declust set call server group server server group cooper task data bandwidth close aggreg bandwidth cooper server benefit parallel server server server server group connect kind high speed atm organ desir data distribut demand support distribut satisfi hybrid distribut server group object cluster server group base local common tradit distribut server group comput kind object store server group declust server group declust strategi object identifi object descriptor object identifi server group identifi identifi server group object creat identifi identifi physic object belong partit sect uniqu serial number object creat server includ larger previou alloc entri call object descriptor od inform map oid physic locat od administr includ timestamp object version declust object object declust node index object resid node object declust strategi hash partit base oid declust strategi emploi collect collect oper move object collect declust updat index node updat refer object forward import low cost addit cost improv index physic object perform improv index entri object access close cluster index node index cluster product creation access pattern close object creation pattern reli page server object store call put object decid object part oid identifi object store defin cluster tree system basi cluster typic exampl cluster strategi object relat subobject access member set access scan oper similar approach index structur object cluster page reduc number page read cluster relat index descriptor reduc cost index access object member physic object belong encod forward migrat desir impli extra lookup access object migrat size fix part oid reduc number bit repres uniqu number object number object exist reduc avoid size oid compar size index cluster emploi impli extra cost cheap compar altern approach larger oid make object object refer access cost smaller number index node retriev reduc updat cost throughput realiz logic set bag class extent scan queri collect effici import note physic oid support maintain class extent costli hash base signatur object retriev reduc disk bandwidth usag minimum interest note flexibl decid length search path object store hot spot object small short search path index object descriptor version object index structur support access od histor object present solut index discuss start characterist oid oid search characterist oid oid search index index retriev index import mind properti assum uniqu part oid oid assign monoton valu insert kei valu exist kei kei uniformli distribut domain kei commonli object oid index entri modif happen tree base essenti potenti troublesom oper delet index modif batch background activ index space util close combin knowledg properti techniqu tune split similar cluster insert space util index access perfect kei rang search class search perfect match object navig search entri case scan access object result addit navig access subobject import rememb gener correl oid object ordinari object kei rang search impli oid rang class extent collect object class search kei rang search kei object addit secondari index tempor properti necessarili exploit extent possibl time rang retriev object valid time interv section studi altern wai organ tempor oid discuss advantag disadvantag index current histor version index structur current link histor version nest tree index version separ index current histor od index structur fig structur concaten oid commit index kei composit index concaten oid commit im index illustr fig od oid cluster leaf sort commit time search current version oid retriev time interv od effici version concurr control current recent data frequent access futur applic tempor system access histor data case todai drawback access current version object effici index organ physic leaf node mix current histor od current version cluster make scan current version ineffici space size order size unreason case migrat version object tertiari practic part migrat difficult current histor version resid leaf page variant index structur tempor object store base texa object store physic oid current histor object separ physic object updat object creat hold previou version previou version copi version store previou object resid access histor base histori index index oid current concaten index kei leaf node entri oid current time interv version oid histor version physic hybrid index structur bad altern current version cluster histor index separ current index case make easier migrat tertiari storag gener access method gener access altern aim support tempor index perform close version system index structur give support tempor effici oper frequent oper gener access method storag space index insert altern method incur redund good support search index oid queri perfect oid rang problem high lookup cost current version search frequent suitabl secondari typic realiz tradit access method mention index version link fig version link avoid advantag previou index current od index histor version link list start od od current version object reduc access cost histor link object version od similar approach postgr link exist version link list od object lot disk access retriev version effici kind extra index case nest tree index version root surrog time data tupl fig nest st index nest tree index current version histor version nest tree index st index illustr fig surrog index kei valu implement leaf node direct pointer current data pointer time time time kei time kei origin st conveni deal relat data access object common index time effici index concaten oid commit im kei effici access od cluster time cluster current version od index time kei depend number version object separ index current histor version applic queri current data make read access current version effici separ index current data separ index histor data index histor data organ previou index organ problem time version updat index case previou altern mind tree gener smaller height index index od size index current version nest index tree note sect physic oid special separ histori index effici tempor oid index fig tempor oid index main goal design tempor oid index support tempor index perform close version system index structur give support tempor effici oper frequent oper effici oper achiev physic easi tertiari storag migrat partit index hierarchi tree level index physic index physic pointer leaf node point current version oid current version oid index index od current version object od object version histor version nest tree similar index sect leaf node current version previou version separ call histor version leaf node separ version od resid resid actual leaf node note version bottom level hierarchi strict hierarchi index result higher number index level solut part factor dictat separ part reduc number od node long upper level tree benefit od leaf node extra cost higher number level separ index easier maintain high space index migrat tertiari storag easi describ index approach physic data oper index physic data organ section describ import detail data organ node binari tree insid node reduc cpu cost entri node organ effici access sequenti search access entri reorder content node time insert delet assum entri node maximum number entri index overhead approxim byte entri node level link make oper effici index consist separ index version content version physic make index manag storag version implicit object valid time current version oid index index id case server group server index object creat actual server number od index store part oid uniqu serial number part oid number od leaf prefix compress rest histor version oid index od current version object leaf node pointer od previou version object actual node concaten oid commit index kei insert search tree commit time cf sect optim space leaf node share worst case end entri member version expect space util accept share index delet object mean object od remov tempor od object delet od repres delet store commit timestamp transact delet store od leaf node od current version store make scan current version effici decid store od leaf node od current version object aliv note oid repres leaf aliv oper section describ import oper result object oper assum respect start discuss case entri physic delet emploi empti strategi node merg space util node threshold node remov commonli merg risk split happen strategi result low space util oid insert delet oper involv empti index reli background reorgan index creat delet creat simpli mean append entri standard insert algorithm physic delet delet entri oper delet children index physic delet consequ troublesom case delet access nonexist delet object refer object delet current version object referenc delet previou version object refer object leav altern requir applic code kind except handl tempor queri access delet index flag updat attempt error search current object version search current version search belong part search leaf find entri pointer root node oid search object actual oid exist found leaf node standard search algorithm creat object object oid od append index tree actual leaf node found algorithm free space actual leaf od object insert leaf node entri store overflow parent node alloc level appli top standard insert content split node distribut node case discuss result tree low space space util reason distribut entri node store entri node similar monoton techniqu call tune split updat object object od version insert tree step find leaf node current version od store case object turn tempor individu od replac case tempor od replac od insert histor version kei comparison insert concaten commit index kei note gener insert append oper standard insert emploi tune split delet object step find leaf node current version od store case od simpli remov actual leaf node resid case tempor current od addit od insert od od physic locat timestamp commit time transact delet cf sect current od delet mention remov empti node merg space util node threshold node remov node entri insert neighbor node vacuum version object delet version vacuum od resid delet standard delet algorithm search object version valid time search find leaf node current version od resid timestamp od od result search search find od largest timestamp note od delet object resid oid found od leaf search match leaf node search start end time object find time object lookup find version object find end time lookup find version object search current version object tradit scan oper tradit return entri leaf node search version object oper retriev node od current version object retriev version object search object valid time leaf node search match od delet object repres leaf search od delet object valid time case search od leaf node repres contigu area od delet object od leaf node timestamp older frequenc queri type futur difficult kind queri frequent justifi delet object leaf node timestamp avoid search object repres leaf node delet time updat object object valid oper essenti current version updat migrat tertiari storag migrat node determin physic locat address node level address bit physic locat address physic locat address storag devic interv address storag determin address devic repres content node tertiari storag necessit rewrit branch belong directli tertiari storag larg object object smaller object written contigu object object larger threshold segment larg object index subobject maintain subobject index variant exodu larg storag object oid index pose great challeng updat easi bottleneck system previou studi oid index shown achiev accept perform difficult fit main memori index expect perform system larger main memori buffer capabl fulfil goal lookup perform close convent system current good perform easi tertiari storag import futur system data physic vacuum tertiari storag migrat work analyt studi implement simul expect averag perform higher index structur altern acknowledg valuabl comment improv work present report refer shekita object file manag exodu extens system vldb august kossmann perform evalu oid map techniqu vldb time index monoton tempor design implement publish grai reuter transact concept techniqu morgan kaufmann segev effici index method tempor relat ieee transact knowledg data guttman dynam index structur spatial search acm june lomet salzberg access method data acm weikum perform histori data access method vldb tempor object storag intern workshop expert system analyt studi object identifi index intern confer expert system optim oid index cost tempor system intern confer foundat data salzberg tsotra comparison access method time evolv data technic report wilson portabl persist store intern workshop persist object stonebrak design postgr storag system vldb suzuki develop perform analysi tempor persist object store australasian
ML/1123 6 gener cost function support vector regress alex bernhard muller gmd berlin abstract concept support vector regress extend gener class convex cost function shown result convex constrain optim problem effici solv interior point path method comput feasibl improv estim demonstr experi introduct risk minim problem regress probabl densiti function cost function find function minim risk function observ hand drawn iid identi guess replac empir densiti deriv observ minim empir risk advantag easi comput uniformli consist hypothesi class bound complex attempt minim directli lead heavi poor gener case power class model minim complex term reg regular constant control tradeoff model complex approxim order ensur good gener perform cost function find minim reg cost function lead difficult optim problem minim function differ replac minim reg case support vector regress form introduc gener pattern recognit algorithm inherit type cost vapnik call loss estim measur predict error penal ffl jj ffl ae jj ffl jj ffl chosen ffl advantag cost function lead decomposit quadrat program problem restrict jj ffl strong lead good minim correct cost function stem real world applic assumpt sampl gener underli function depend addit densiti optim cost function maximum likelihood log desir extend class cost function sv regress vapnik huber robust type cost function admiss lead quadrat program problem convex cost function result complic convex program problem harder solv standard techniqu paper show case problem solv effici interior point path approach spirit section formul convex program problem effici solv shown section subsequ present result give comment section extend framework basic idea sv algorithm regress estim comput linear function high featur space dot comput nonlinear function space input data function form natur choic complex term function featur space reg convex program problem sake simplic assum discontinu ffl interv form ae jxj ffl slack variabl remov discontinu transform problem convex constrain optim problem lead minim subject ffl ffl note similar vapnik loss straightforward extend special choic simplic gener convex cost function nonzero cost function interv addit pair slack variabl cost function valu ffl ffl sampl addit lagrang multipli dual formul addit discontinu care standard lagrang multipli techniqu detail comput wolf dual defin kernel dot product featur space ij exist gener condit symmetr function formul mercer correspond dot product space basic idea diagon decomposit posit construct shown set lead maxim problem term slack lagrang multipli ff ff ij ffl ff ff subject ffg ff ff ff note defin monoton function ff due convex note free variabl transform equal constraint observ prove solv optim problem approach solv convex program problem special choic special case loss origin sv regress case definit ff ff detail kernel simplic notat omit indic polynomi loss superlinear cost function squar fit special set yield ff substitut ff ff ff polynomi linear loss appli simpl modif cost function make robust limit maximum steep oe oe oe oe oe similar reason obtain oe ff ff similar box constraint lagrang multipli cost function bound deriv rang lagrang multipli ff bound ffl set yield cost function huber robust cost function optim algorithm conveni mention result theori convex optim detail strictli convex constrain optim problem uniqu solut dualiti feasibl primal dual variabl primal object function convex minim greater equal dual object function equal obtain optim solut set primal dual variabl feasibl satisfi condit optim solut constraint dual variabl deriv admiss cost function section fi fi fi defin diverg cure cut small interv ffi cost function substitut ffi ffi mention result enabl find effici solut convex optim problem stem gener sv approach briefli sketch interior point algorithm convex program nutshel idea gradual enforc condit iter find feasibl solut dualiti gap primal dual object function determin qualiti current set variabl special case quadrat program detail primal dual formul order avoid tediou notat slightli gener problem minim subject ff inequ vector hold convex function ff feasibl region fulfil add slack variabl rid inequ posit constraint minim subject ff ff ff free wolf dual maxim subject free suffici condit optim solut found primal dual variabl satisfi feasibl condit condit proce solv system equat iter solv equat resort method call satisfi solv modifi version place iter difficult solv nonlinear system equat interest obtain exact solut aim find feasibl solut iter linear system solv result equat approach dualiti gap small solv system ff ff variabl method great detail quadrat program iter decomposit ij domin factor algorithm typic converg number iter entail independ comput hessian iter sv case assum form ff ff ff ff ff ff ij diagon part ij depend ff updat hessian cost neglig comparison decomposit comput optim solut gener sv problem equal complex origin problem final converg determin size dualiti differ primal dual object function worth observ dual variabl case equal reason problem dual dual dual approach case mean solv linear system variabl predictor step substitut variabl quadrat term solv linear system advantag method approxim equal perform attempt solv quadrat system provid term small lead robust comput scheme result result carri twofold firstli demonstr algorithm feasibl shown improv exist approach term approxim qualiti comput complex shown interior point path method effici comparison classic techniqu compar implement algorithm quadrat standard sv problem modifi version cope gener cost function figur show number number float point oper converg sampl size flop standard sv algorithm modifi sv algorithm fig float point oper regress problem size modifi sv algorithm fast standard gener cost function result quadrat program problem float point oper measur matlab flop command algorithm dataset achiev converg modifi algorithm cost function section ffl width gaussian oe dataset sampl drawn uniformli interv normal standard deviat approxim qualiti aim show addit freedom suitabl cost function respect lead gener comput experi perform data gener addit model standard deviat cost function optim maximum likelihood gener error measur term norm chose gaussian oe cost function polynomi type ffl polynomi function depend data distribut interv sampl size order obtain reliabl result gener error averag run regular paramet select crossvalid run independ vari expon cost function measur expon perform observ polynomi cost function fig gener error depend model minimum close expon exponenti distribut gener observ improv wrt huber robust valu boundari interv prove addit freedom adapt model improv gener perform sv regress perspect framework gener cost function sv machin demonstr dealt effici comput cost classic sv set solv result optim problem interior point path algorithm larg error bar due variat gener error run turn fact sampl size signal ratio small techniqu minim actual cost function directli restrict cost function experi show lead improv gener perform sv machin method appli sv pattern recognit straightforward simpli remov variabl asterisk similar set nonlinear cost function pattern recognit case solut nonlinear case updat hessian diagon effici work set method conjunct convex program approach long diagon term hessian updat optim procedur drop replac exist strategi acknowledg author vapnik discuss work support grant dfg ja refer cort vapnik support vector network machin fletcher practic method optim john wilei huber robust statist john wilei girosi improv train algorithm support vector machin ieee smola scholkopf regular oper support vector kernel nip san submit neural network muller smola scholkopf base method pattern approxim oper interior point code quadrat program technic report princeton vapnik natur statist learn theori springer smola support vector method function regress signal process nip san vapnik estim depend base empir data
ML/1124 6 titl page voxel base evolutionari shape peter baron robert fisher depart artifici forrest edinburgh uk andrew depart citi uk frank mill andrew depart mechan sanderson king mayfield edinburgh uk number number number abstract keyword page voxel base evolutionari shape abstract shape integr evolutionari algorithm offer number potenti advantag shape topolog geometr constraint easili adequ shape approxim arbitrari accuraci lack boundari length chromosom small hole final shape state problem paper describ experi perform attempt address problem design problem small comput cost evalu candid shape testb design genet oper shape oper refin design problem costli finit element evalu conclud voxel care design genet shape shape evolutionari voxel introduct shape attempt find optim shape compon subject design constraint typic problem interest research commun area concern structur load bear compon aerodynam profil work report area thermal conduct heat sink manufactur cost structur shape studi aim amount materi cost support load aerodynam aim drag subject constraint lift geometri work date shape singl criterion research interest problem structur shape usefulli integr geometr structur analysi algorithm finit element method candid shape earli research shape fe mesh geometr model manipul techniqu base mathemat method function typic gradient base fe mesh design variabl appar mesh geometr model impract due difficulti ensur mesh adequ calcul stress shape boundari smooth research move separ geometr model fe mesh commonli boundari compon model control point design variabl spline properti smooth local shape control mesh gener techniqu gener adequ mesh descript candid shape boundari find optima design evalu extrem import engin time perform design evalu order magnitud greater time produc candid design difficulti deal local discret design variabl gener small design variabl mesh topolog address stochast genet algorithm due holland simul anneal shape popular area research research retain descript shape boundari geometr model work paper investig possibl replac boundari shape cellular cellular chosen work voxel partit design space rectangular region box assign binari full empti approach motiv number potenti advantag shape repres arbitrari accuraci straightforward convert exist engin solut map natur frequent domain knowledg readili geometr constraint easili topolog candid shape predefin contrast success applic techniqu geograph earlier work state object scalabl voxel occurr small hole final long length expect crossov oper lack smooth shape outlin potenti advantag voxel author consid worthwhil address difficulti aim work determin suitabl voxel geometr model shape outlin design suitabl oper ga overcom investig identifi issu confront scale problem work aim produc system return improv solut problem concern strateg scientif question investig resolv issu pertain construct practic system experi experi order investig voxel simplifi beam design problem formul cost evalu small problem number oper design design problem tackl finit element analysi comput cost evalu case greater oper design experi evalu difficult design problem relat scalabl issu investig baron detail experi undertaken investig restrict exampl voxel reason conveni speed solut evalu fe dimens demand assumpt made studi problem result present higher problem simplifi beam design prototyp mechan engin problem beam support load minim amount materi evalu candid made bend theori symmetr normal stress suffici test potenti problem voxel outlin pose problem practic maximum stress constraint physic model experi voxel max maximum stress area bend distanc voxel neutral axi moment area candid neutral axi shape defin horizont line pass centr mass shape voxel area uniform size centr mass found averag posit occupi voxel moment area approxim discret sum moment ay area voxel real solut problem correspond requir web connect beam design base full calcul shear web counteract addit stress shear stress repres connect requir form repair step pixel connect seed pixel centr top edg beam vertic central voxel enabl provid straight web connect repair step form prevent format web physic model prevent improv slightli result obtain ensur alter improv made ga prove benefici decid concentr paramet focu design oper oper parametr variat restrict absolut minimum determin approxim valu requir gain reason advantag oper paramet set remain constant mention beam dimens bend moment nm voxel grid voxel max stress nm experi nave ga set experi treat chromosom long binari string wrap vertic edg line form standard crossov mutat conjunct gener ga popul size select fit count activ voxel maximum stress maximum stress constraint penalti multipli result form difficulti lai valid solut experi unsuccess result gener full small hole extrem uneven edg typic result shown figur number repres fit valu typic end run result nave stress concentr vertic extrem materi middl contribut beam abil withstand mass materi usefulli emploi extrem beam simpl standard rapidli remov materi middl stage experi observ move materi low stress area high stress area hole left extrem nave ga approach extrem larg number evalu order make accept experi greatli evalu time due integr fe packag rate improv run level end run mean ga find improv chromosom result visibl gener weak oper appli attent concentr improv ga order achiev greater benefit earli search produc qualiti final result smooth mutat oper smooth oper experi attempt address directli weak voxel aid search reduc number small hole edg produc ga oper intend capabl easi twodimens order continu case higher problem voxel oper select rectangl random posit size rang pixel dimens grid common pixel area select found written pixel area smooth ga paramet oper appli addit previou mutat oper applic oper chromosom popul form give result ga configur number gener limit case compar figur displai typic popul member earlier result figur show effect domain specif approach oper design elimin isol hole reduc edg typic result smooth crossov oper crossov oper point treat chromosom string bit suffer problem linkag voxel adjac grid necessarili adjac string separ possibl build block grid contribut higher fit disrupt crossov procedur harri describ crossov specif design overcom limit convent crossov oper swap rectangular area grid swap crossov area overlap edg grid made opposit side convent adopt effect edg smooth unclear size locat area swap select implement area restrict minimum size voxel dimens order oper effect appli crossov oper standard probabl chromosom made standard algorithm paramet set earlier graph figur show result ten trial altern crossov includ oper crossov oper standard crossov uniform crossov effect crossov result confirm oper perform crossov uniform crossov techniqu problem rate descent line indic popul converg good solut faster approach eventu end result gener slightli fit produc techniqu mutat oper mutat oper design scrambl content randomli select rectangular area voxel refer oper oper easili modifi work affect small area chromosom intens select rectangular select area smooth mutat oper alter version mutat oper design test experi call area mutat oper oper fix mutat squar voxel design appli voxel mutat area activ theori oper modif made surfac interior evolv shape benefit result flip isol voxel middl void area choic fix area motiv observ irregular surfac fit area sixteen permut binari probabl mutat poor qualiti area fit variat high oper appli addit origin mutat probabl chromosom appli applic probabl oper appli probabl applic half previou time experi perform ten time altern mutat period fifteen hundr gener graph figur show effect mutat oper alongsid result obtain appli gener number plot horizont axi averag fit individu popul gener plot vertic effect mutat addit oper gener result perform oper line meet gener steeper descent oper line earli perform final result fifteen hundr gener significantli oper offer similar rate improv earli stage slightli perform gener final converg oper line gener offer earli benefit oper long run mutat oper design intent directli address perceiv problem prior oper found effect previou uninform produc benefit rate earli improv final qualiti solut gener absenc distinguish oper experi offer speed advantag mutat oper outlin beam design problem result shown nave ga suffer problem suggest small select oper inform domain knowledg effect solv difficulti typic result complet improv usefulli combin produc desir improv figur figur depict number typic result complet system oper activ earlier result show complet system produc superior result hole larg improv perform final system term solut tradeoff surfac exhibit shown figur perform comparison naiv final final system normal mutat oper addit mutat smooth oper rapidli cut unwant area materi earli stage smooth edg fill small hole mutat oper highli effect smooth edg fill small hole materi occur undesir place crossov oper replac fulli exploit structur problem design problem fe analysi experi undertaken simplifi beam design problem outlin section led design effect ga oper manipul shape section detail experi undertaken appli oper difficult design problem problem chosen design finit element method chosen design techniqu voxel shape descript directli finit element mesh design problem full origin specif problem problem design subject load due rotat due attach turbin blade outer part axi reduc shape problem shown figur involv reduc mass whilst observ seri separ stress constraint discret locat constraint relat stress outer radial stress centr line stress constraint observ descend order hub stress rim stress radial stress outer radial stress fit function ga fit function defin object weight factor total sum penalti term stress constraint broken function constraint penalti appli constraint limit measur constraint order import import order import contraint limit list result basic system gener ga popul size select smooth mutat oper appli sequenti probabl basi form voxel grid repres constraint set set dimens design space radiu hole blade forc rad young modulu materi densiti kg revolut speed rad basic system appli modif problem tightli meant attempt solv problem random popul violat stress constraint larg amount rate improv extrapol time period alloc valid solut found number gener circumv popul select variat design suppli origin modifi aggress random mutat oper ad remov small area materi surfac design kind intellig thought reason user start ga exist design order improv made total shape user expect final easili popul intellig approach meant initi popul unreason stress suppli suffici variat popul rapidli converg singl solut result basic system figur show member popul gener result basic result shown figur poor lack symmetri horizont axi uneven edg visibl fail set result problem occurr larg stress corner element edg shape fail address claim scalabl made improv made system attent turn resolv issu shortcom highlight investig turn symmetri solut design problem symmetr radial axi decid domain knowledg reduc search space problem ga modifi reconstruct final shape entireti produc element definit file access fe packag simpl modif reduc search space typic size voxel voxel repres voxel voxel central line voxel axi symmetri mirror enforc ga turn central line element stress measur mesh improv found initi experi design problem directli voxel descript geometri fe mesh problem high stress corner mesh decid separ geometri model mesh approach approach consid interpol spline form smooth edg voxel act spline mesh gener produc mesh densiti independ voxel model prototyp system decid simpli add triangular element corner whilst eleg solut simpler implement triangular element creat connect group node element connect file triangular element ad shape suitabl identifi convolv voxel shape seri match templat mask squar mask match voxel surround empti voxel triangular element creat convolut mask triangl insert shown figur convolut mask triangl insert design oper remov hole mutat oper fix hole modifi mutat area voxel turn voxel turn result modif mutat oper mutat boundari shape reduc number small result improv system improv ga set basic system paramet chromosom grid set voxel mirror due symmetri produc voxel grid height voxel analysi permit continu gener approxim hour total final popul creat improv ga shown figur displai twenti individu show clear improv qualiti result gener small total elimin member popul small hole rate valid solut found faster basic ga continu improv solut pass trial shape produc unusu present thin neck due inadequ specif method constraint violat stress constraint defin discret point specif intend shape descript specif adequ voxel remov materi greater flexibl optim solut stress constraint inact remov materi stress maximum ga improv fit ad materi posit high stress move point constraint long amount materi ad remov explan problem lie voxel solv improv specif method constraint violat final improv fe packag examin solut produc confirm triangular element smooth boundari work expect reduc amount stress region immedi surround step figur show stress valu calcul fe packag voxel surround step typic run show triangl permit excess stress distribut pattern darker shade higher stress level pictur result smooth design final set design problem found unmodifi oper beam design problem unsuccess oper account knowledg held design result success difficulti encount direct voxel shape fe mesh extent allevi smooth triangular element full decoupl primari shape descript fe mesh desir futur studi due flexibl voxel remov ad materi coupl ga abil exploit search found specif problem tightli defin unwant present final solut note author number problem formul parametr differ suitabl problem hand abil repres feasibl solut sever critic voxel amount requir identifi suitabl constrain problem formul unwant comparison mass produc voxel compar origin design produc parametr ga achiev mass kg design satisfi stress design evalu fe treat caution voxel ga perform regard time solut parametr ga found solut evalu compar evalu requir ga felt result ga search larger constrain search space voxel voxel found viabl shape evolutionari algorithm problem number potenti advantag boundari descript topolog domain knowledg easi geometr constraint easili straightforward convert exist solut descript order initi popul shape experi undertaken design problem investig effect scalabl simplifi beam design design finit element analysi experi number difficulti inher primarili specif design genet algorithm oper domain knowledg held problem tackl crossov oper provid linkag adjac row voxel avoid slow converg found convent crossov oper oper design remov unwant hole produc candid shape smooth boundari edg design direct voxel finit element mesh found convolut mask base solut issu work regard involv decoupl voxel mesh flexibl voxel ga exploit expand search space uncov defici specif design lead unwant solut obtain result obtain roughli term mass compar poorli number evalu requir find solut note ga easili modifi interact system case comput reli engin practic experi knowledg problem domain direct kei choic process shape problem flexibl requir deal constraint handl issu note lack initi assumpt voxel advantag engin rasa start work constraint solut obtain express directli amount requir find good problem formul parametr voxel interact approach highli desir case research principl method user interact system recommend acknowledg engin physic scienc research council partli fund work research refer pj voxel evolutionari shape msc depart artifici uk bentlei pj gener evolutionari design solid object genet algorithm phd hm sp analysi distribut pollut genet algorithm mk genet algorithm approach configur topolog design transact journal mechan sm approach geograph data phd thesi monash jm sp mechan engin california de genet algorithm machin learn york jh adapt natur artifici system michigan ann arbor review structur shape comput industri applic genet algorithm compon design select aisb workshop evolutionari lectur note comput scienc pp springer berlin cd mp optim simul anneal roll intern report manufactur plan depart mechan uk investig voxel base shape technic manufactur plan depart mechan uk interact neighbourhood search schedul workshop uk plan schedul studi genet shape design intern confer genet pp morgan san mateo rank base alloc reproduct trial intern confer genet pp morgan san mateo figur legend figur figur provid copi figur present order figur typic end run result nave ga figur smooth oper figur typic result smooth oper figur effect crossov oper figur effect mutat oper figur typic result complet system figur perform comparison naiv final ga figur figur result basic gener figur convolut mask triangl insert process figur final improv ga figur result smooth triangl figur design final set experi electron copi origin diagram author blade forc hub axi rotat rim
ML/1125 6 simultan learn neg correl neural network yong liu xin yao comput intellig school comput scienc south wale australian defenc forc australia abstract approach design neural network ensembl recent studi regress task shown approach perform significantli previou paper present algorithm design neural network ensembl classif problem algorithm regress task idea similar idea algorithm encourag individu network ensembl learn part aspect train data ensembl learn train data neg correl network train correl penalti term error function encourag individu network train simultan sequenti opportun network interact experi problem demonstr algorithm produc neural network ensembl good abil introduct neural network ensembl increasingli recent year improv classifi method design neural network ensembl follow design process gener individu combin individu network train independ disadvantag approach loss interact individu network learn feedback combin stage individu network design stage independ design individu make contribut ensembl paper algorithm design neural network ensembl idea algorithm encourag individu network learn part aspect train data ensembl learn train data unlik previou work neural network ensembl design individu network train individu network train simultan algorithm simultan train opportun individu network interact order encourag individu network learn neg correl neural network train correl penalti term error function shown ensembl neg correl neural network perform significantli previou system regress classif problem correl penalti term regress task work overfit train data correl penalti term studi paper shown effect classif problem rest paper section present algorithm train ensembl neg correl neural network simultan section describ result appli algorithm solv realworld problem section conclud paper neg correl neural network train set scalar assumpt output scalar made simplifi exposit idea loss gener function relationship express ffl function vector ffl random expect error reflect fact simultan specif set input uniqu output ffl function defin statist expect oper exact function relationship unknown neural network learn explain predict encod empir knowledg repres train set set synapt criterion weight error actual network error function express sum term term independ suffici term explicit depend train set approxim function rewritten error function estim defin ed expect oper ed repres averag pattern train set section estim form simpl averag set train train data set number individu neural network correl penalti term introduc error function individu network individu network train simultan error function individu defin number train error network present nth train output individu network nth train correl penalti function individu error error rest ensembl paramet insert strength penalti adjust function chosen classif problem output combin system nth train pattern partial deriv respect output individu nth train pattern standard algorithm updat weight adjust ensembl weight updat individu network perform simultan present train case complet present entir train set learn process call epoch sum observ train individu network interact penalti correl penalti term error function individu individu network train independ bp independ learn bp individu network special case algorithm term error function ensembl point algorithm learn task ensembl number subtask individu adjust strength paramet control covari ensembl achiev perform studi section describ applic australian credit card assess problem breast cancer problem problem classif problem previou regress task output continu illustr applic wide rang problem assum priori knowledg problem domain data set obtain uci machin learn benchmark repositori anonym ftp directori australian credit card assess problem australian credit card assess problem assess applic credit card base number attribut case total output class attribut includ numer valu discret valu breast cancer data set breast cancer data set origin obtain wisconsin madison data set classifi benign malign base cell descript gather microscop examin data set attribut exampl benign exampl malign exampl setup data set partit train set test set test set neural network train phase test neural network ensembl train insuffici number exampl set result vari significantli partit number set specif partit data set frequent obstacl reproduc compar publish neural network learn result data set partit ffl australian credit card assess data exampl train rest exampl test set ffl breast cancer data exampl train rest exampl test set input attribut rescal linear function output attribut problem encod output class output highest activ design class ensembl architectur experi consist perceptron hidden layer individu network hidden node hidden layer hidden node function output node function defin logist function number train epoch set learn rate strength paramet set paramet chosen limit preliminari experi meant optim result tabl show result run run initi weight architectur initi weight setup independ train bp correl penalti term result shown tabl classif combin method regress simpl averag defin appli decid output ensembl system simpl result similar independ train phenomenon contradictori claim effect correl penalti term encourag individu network ensembl learn part aspect train data order verifi quantifi compar output individu network train correl penalti term individu network train correl penalti term notion introduc correct set individu network intersect correct set individu network test set consist case test set classifi correctli individu network denot size set denot size set tabl show size correct set creat independ test set intersect evid tabl individu network creat part test set tabl size correct set size intersect size individu network ensembl creat independ train bp similar size correct set size intersect set reach case correctli classifi individu network ensembl simpl individu combin weight treat equal individu equal import individu network creat part test output specialist consid make final ensembl part test set method appli select individu case test output ensembl decid individu output highest activ tabl show averag result run combin method combin method improv significantli good poor individu case test set select individu improv independ train individu network creat independ train similar sa train test test sd min max sd min max comparison error rate independ train bp australian credit card assess problem result averag run combin simpl averag sa train test test sd min max sd min max comparison error rate independ train bp breast cancer problem result averag run combin simpl averag size correct set individu network creat test set intersect australian credit card assess problem result obtain run run size correct set individu network creat test set intersect breast cancer problem result obtain run run australian credit card assess result compar obtain evolutionari approach tabl compar averag test error rate algorithm breast cancer setiono hui recent publish ann construct algorithm call test error rate produc run report result manual construct ann test number ann architectur breast cancer problem result produc ann averag result run clear tabl superior algorithm algorithm ter algorithm ter cart rbf castl bp comparison evolutionari ensembl learn algorithm term averag test error rate australian credit card assess problem ter stand test error rate tabl paper describ approach design neural network ensembl classif problem approach regard larg problem smaller subproblem dealt individu neural network easili correl penalti term error function encourag format specialist ensembl australian credit card assess problem breast cancer exampl demonstr effect approach issu resolv individu neural network architectur current algorithm optim automat gener construct individu network ideal size ensembl fix moment desir develop learn algorithm vari ensembl size dynam empir studi benchmark problem carri order evalu algorithm acknowledg work partial support australian research council small grant scheme refer liu cooper ensembl learn proc ieee intern joint confer neural network accept combin artifici neural connect vol yao structur evolutionari artifici neural proc ieee intl conf evolutionari comput ieee artifici neural statist neural vol pp neural macmillan colleg publish set neural network benchmark problem benchmark fur universit yao evolutionari system evolv artifici neural ieee transact neural vol yao popul inform evolutionari artifici neural ieee transact vol april michi spiegelhalt machin neural statist elli horwood setiono method feedforward neural network construct ieee tran neural vol
IR/1126 5 global integr visual wendi chang murthi zhang depart comput scienc state york buffalo ny xerox research center ny abstract visual design locat global integr enabl user access data world transpar manner investig approach design creation integr inform system support global visual queri access visual internet includ hierarch metasearch queri manag design support integr abstract data individu remot visual support visual abstract data reflect semant visual queri manag extract featur content queri metasearch agent process queri match featur content metadata list relev site deriv effici retriev queri select perform system refin base user feedback system implement java environ introduct visual distribut remot locat made locat inform retriev digit librari design support integr multimedia provid global retriev access access increasingli import number applic includ medic pharmaceut distribut publish commerci system develop multipl text access internet odbc perl technic issu due natur visual imag video data critic issu capabl enabl server current depart electr comput state york ny perform intellig select relev visual queri visual data repres retriev base content remot select relev site base similar queri data site site select work handl text inform system includ gloss system emploi statist approach record frequenc occurr text keyword site construct index relev site direct queri gloss glossari server statist estim potenti queri boolean retriev model document retriev approach infer network text discoveri problem paper focu design implement integr inform system support global queri access visual distribut internet design support integr includ metasearch queri manag organ metadata data remot visual queri capabl queri manag extract featur content queri metasearch agent control distribut user queri relev site site server address perform refin system base user feedback system implement java experi present rest paper organ section present system architectur design support visual queri section present design metadata formul section discuss queri select perform refin implement system result report section conclud remark offer section system architectur present design distribut multimedia inform manag retriev system support global integr visual structur figur show architectur term main compon system multimedia system remot consist metasearch queri set visual displai applic client machin internet medium access multimedia site involv accept user queri accept select process queri site present result back user text imag video queri manag meta agent client client client client browser browser browser browser metasearch figur global integr distribut multimedia data manag retriev system visual discuss design principl visual support effici retriev internet focu imag method imag featur extract literatur includ method extract inform current research visual data consid featur vector repres content data visual queri support match featur queri featur vector similar metric similar measur rang repres highest similar repres similar support effici visual queri approach develop classifi visual data meta metadata agent queri manag queri queri relev feedback queri visual user metasearch figur architectur cluster cluster repres featur denot gener centroid cluster cluster classifi repres centroid benefit approach hierarch index built templat support effici queri retriev focu paper design integr multipl visual assum cluster index structur design visual support effici visual retriev role accept user extract inform queri suitabl match produc rank distribut queri select figur show architectur main compon includ search queri manag metadata templat addit metadata templat builder metadata design support integr metadata templat metadata templat metadata refin modul constitut manag system illustr figur collector gather metadata visual time regist time resubmit metadata templat builder organ creat templat metadata templat store metadata refin modul period initi metadata updat process resubmit metadata queri manag consist queri process modul queri refin modul queri process modul accept user extract featur vector submit featur vector metasearch agent relev queri process modul accept imag judg relev irrelev origin queri metadata collector metadata refin builder templat metadata metadata templat templat refin templat templat templat visual figur manag system user extract featur vector forward featur vector queri refin modul queri refin modul construct refin queri imag featur vector queri process modul figur show function queri manag queri process present section process queri feedback queri queri refin relev feedback featur imag user queri refin queri metasearch agent figur queri manag metasearch agent invok site select algorithm match queri featur templat select potenti relev queri queri forward select visual select approach discuss section design organ inform site select metadata includ type data expect queri special algorithm statist data imag templat inform monetari latenc site provid metadata dynam refin compon updat hierarchi organ hierarch structur lowest site group group base number similar imag templat imag similar templat group specif templat defin imag similar templat similar measur imag greater threshold site group templat higher templat group featur includ textur color shape node repres gener categori color shape hierarch organ templat similar imag cluster organ present individu visual templat present gener superset templat present individu visual figur present conceptu view color shape textur db db db site templat featur class figur conceptu view statist metadata outlin central metadata formul select relev visual queri distribut user queri simpl strategi pose queri feasibl perform queri visual intens natur imag search make imper intellig select site select method text discoveri maintain index relev site text inform text inform deriv text annot imag metadata type queri type data aerial imag inform monetari cost latenc site provid addit metadata enabl earli prune costli site visual text inform perform prune site prune visual inform queri relev determin visual queri avoid detail examin imag desir move complet machineri imag search engin distribut site determin relev creat index set site relev imag requir anticip visual queri address intermedi approach inform imag summar repres suitabl abstract form regist similar imag templat comput db denot set denot similar imag templat similar imag imag templat measur method figur show similar measur imag templat similar imag intend closer rang similar measur templat imag templat visual abstract base observ figur templat imag brodatz album templat imag similar high similar imag similar low similar figur cluster rang cluster rang respect imag templat figur imag similar templat imag similar high similar close similar templat note imag similar similar base statist data comput record distribut similar imag templat store statist data repres visual relationship templat relev queri determin match process involv determin similar queri rank site base visual inform record templat select approach develop statist data number sampl comput support select approach introduc queri process present queri process strategi base metadata approach select discuss perform refin queri address queri receiv queri metasearch agent extract set subqueri fq subqueri repres featur class textur color shape similar subqueri templat comput denot templat exist set match templat ft select base ft similar subqueri templat threshold metasearch agent invok select subqueri similar match templat statist inform db return list relev site subqueri rank subqueri merg yield final set queri set subqueri match multipl independ templat select approach determin set relev subqueri determin final set relev set relev relev calcul imag similar db approach design calcul set discuss issu subsect select approach similar interv queri respect templat similar rang center similar predefin offset select approach develop statist inform deriv similar distribut templat select approach term select approach examin select approach make varianc statist rank site select make distribut rank site select approach similar distribut respect templat calcul varianc distribut number imag db similar templat greater equal threshold inform calcul store metadata subqueri match set templat ft calcul confid interv db db respect templat db db normal distribut determin substanti number imag similar fdb db db db rank select subqueri order db db select approach similar distribut respect templat repres histogram similar imag db templat number imag similar inform calcul store metadata number imag db similar rang respect templat subqueri match set templat ft calcul match templat determin maximum number imag similar fdb db db threshold select rank base valu refin base relev feedback present refin process improv perform select approach refin process base relev feedback procedur extens inform retriev commun improv perform queri process modifi queri formul base user judgment initi retriev document relev feedback process implement graphic displai establish commun system user initi list initi retriev imag displai pointer design imag relev irrelev user queri process modul extract featur relev irrelev forward featur queri refin modul set featur fq origin queri set relev imag retriev initi search ir set irrelev imag retriev initi search determin user imag fg ir queri refin modul construct refin subqueri ad featur relev imag subtract featur irrelev aq ir ir number relev imag ir number irrelev imag ir weight determin search agent modifi subqueri produc set relev subqueri result merg gener final list relev formula implement valid describ prototyp term develop base framework effect design evalu select approach implement develop base framework implement java program languag consist major central remot user shown figur implement function central server central server interact user interfac java socket interfac receiv user queri central server process queri return list relev site user user search central server forward queri remot interfac distribut queri chosen accept form support imag store file objectstor remot interfac user interfac html form invok www browser user interfac interact user central server run java interfac user submit select desir remot interfac queri central server meta queri manag relev feedback list relev db user interfac imag retriev visual queri meta search agent figur visual inform system initi mark relev retriev initi subsequ feedback search figur show user interfac user enter queri type filenam open box queri imag displai upper window imag access internet queri queri complet imag portion imag mark figur queri size shown upper window rightmost imag queri retriev imag shown window bottom page user send queri server click send imag button receiv list relev search user interfac displai list user search highlight click send button queri imag forward chosen local search retriev imag fed back user interfac view remain part user interfac relev feedback mechan user mark retriev imag judg relev irrelev queri highlight imag click button relev indic submit system process user click feedback refin list relev shown system evalu perform queri randomli construct grayscal imag size rang imag similar imag templat calcul similar comparison techniqu develop perform queri match singl queri match multipl templat threshold select templat set similar valu queri templat rang figur user interfac threshold determin number similar imag approach set approach determin default calcul select queri compar top ideal rank top rank rank algorithm ideal rank site determin measur similar queri imag imag high similar sim respect queri consid relev queri relev rank base number highli similar imag top rank experi top ideal rank chosen site set top site select select relev site set top site judg imag relev select calcul perform experi measur level repres high medium low experi queri singl templat multipl templat averag histogram singl templat multipl templat averag histogram tabl select function number match queri queri refin port tabl show averag valu function number match templat approach offer perform queri match singl perform compar match multipl templat observ similar queri templat low templat longer provid sound basi estim experi refin appli refin process queri match multipl templat queri match singl templat analysi show good perform select approach case select return refin process compar result initi select perform origin queri note initi refin select conduct evalu effect refin process made list relev imag visual inspect imag top retriev imag list relev imag assum relev imag top retriev imag assum relev result report tabl refin improv perform select queri match multipl templat perform improv approach approxim select queri match multipl templat discuss base observ approach offer high select queri match singl templat similar queri templat high queri match multipl perform approach improv relev feedback recommend threshold formula determin match templat compar exist templat similar greater option creat templat queri function perform templat builder modul note compar inform retriev design requir high storag space approach requir storag statist number templat pair approach requir higher storag approach storag requir approach cut store portion histogram cover similar rate interest test store portion histogram cover similar rate rang interest similar rang develop system framework support global visual queri access visual internet framework includ creation visual metasearch queri manag formul metadata achiev abstract visual inform visual templat captur statist similar distribut visual data indic refer select queri distribut achiev search metasearch agent similar queri store templat rank templat perform system refin base user feedback prototyp system support visual inform retriev implement java refer special issu imag retriev editor gudivada ang raghavan ieee croft search distribut collect infer network annual sigir search agent multimedia access internet fourth ieee intern confer multimedia comput system page june effici resourc select distribut visual inform system acm multimedia novemb chang zhang metadata distribut visual access ieee metadata silver septemb xu algorithm discov cluster larg spatial intern confer dom al queri imag video qbic system ieee gener gloss broker intern confer larg data page jain murthi similar measur imag spie confer storag retriev imag video page support retriev larg imag system intern journal multimedia tool march robertson relev weight estim queri journal rocchio relev feedback inform retriev smart system experi automat document page prentic englewood probabl statist comput scienc applic prentic tian raghu livni effici data cluster method larg acm sigmod intern confer manag page
ML/1127 6 intern comput scienc institut center st ffl suit ffl california ffl ffl fax learn dyadic data thoma hofmann intern comput scienc ca comput scienc uc berkelei jan puzicha institut fur informatik iii germani decemb abstract dyadic data refer domain finit set object observ made pair element set includ event histogram singl stimulu prefer data special case dyadic data natur applic rang comput linguist inform retriev prefer analysi comput vision present framework learn dyadic data statist mixtur model approach cover model flat hierarch latent class structur unifi probabilist model structur discoveri mixtur model provid parsimoni flexibl probabl distribut good gener perform structur inform group structur anneal version standard expect maxim algorithm model fit empir evalu varieti data set domain introduct past learn data highli activ field research distribut disciplin rang pattern recognit neural comput machin data mine learn architectur underli theori learn data vector point euclidean space restrict substanti progress achiev focu metric data disregard varieti import problem fit set exampl recent receiv attent proxim data replac metric distanc weaker notion similar rank prefer data varieti type data literatur context scale correspond analysi dyadic data introduc gener framework learn dyadic data notion dyadic refer domain set fx fy observ made dyad simplest case focu sequel elementari observ consist case provid scalar strength addit observ featur object restrict attent case pure dyadic observ exemplari applic area dyadic data ffl comput context imag correspond imag discret categor featur dyad denot occurr featur imag locat ffl inform correspond document dyad repres occurr token content document ffl comput linguist statist analysi word applic probabilist languag word cluster word disambigu discrimin autom thesauru construct ffl prefer analysi consumpt behavior identifi individu object dyad correspond singl stimulu prefer type data start point machin learn techniqu collabor filter model goal principl main task plai fundament role learn dyadic probabilist learn joint condit probabl model structur identifi cluster data hierarchi statist model dyadic data trivial object set nomin scale empir frequenc suffici captur data difficulti model dyadic data data frequenc problem product set major pair small probabl observ sampl empir frequenc typic significantli corrupt sampl problem urgent case higher order observ languag model typic techniqu natur languag process appli smooth deal frequenc unobserv event promin techniqu katz method model interpol data smooth techniqu statist approach present famili latent class finit mixtur model principl approach deal data problem mixtur cluster model dyadic data investig titl model distribut cluster aggreg markov model natur languag process approach recov special case gener learn framework close relat cluster method qualit data inform cluster approach model principl latent variabl model specif joint probabl distribut latent observ variabl unifi statist model structur probabilist model observ obtain rule induc posterior probabl latent space structur wrt observ crucial exploratori data analysi extract natur structur data group data hierarchi essenti goal latent class cluster common trait mixtur model assumpt underli latent class cluster membership observ set observ start point observ sequenc realiz underli sequenc random variabl possibl defin latent class model dyadic ffl direct introduc latent class dyad latent variabl finit set fa ak realiz effect partit observ class type model call observ share class simpli refer aspect ffl latent class introduc object result model refer asymmetr cluster model loss gener latent variabl fc denot realiz partit role result model ffl latent class defin set simultan latent variabl fc partit variabl fd partit type model call symmetr cluster model differ aspect cluster model latent class structur aspect model partit cluster model provid group structur object space ident observ latent class aspect latent variabl share set observ cluster model underli latent class structur show sequel cluster model deriv constrain aspect model rest paper organ section give overview mixtur model dyadic data includ extens hierarch structur latent class follow convent util subscript indic uniqu member superscript indic number observ figur graphic model aspect symmetr asymmetr circl denot random variabl circl correspond observ repres rectangular frame util multipl instanc direct graph structur repres condit independ properti standard model deriv expect maxim algorithm maximum likelihood model fit section discuss gener modif pure maximum likelihood framework anneal cross number techniqu varieti result applic domain present section mixtur model dyadic data aspect model model specif aspect model built assumpt sampl iid pair random variabl independ respect latent class random data gener process aspect probabl select probabl select probabl complet data joint probabl data hypothet instanti latent ja ja graphic model aspect model depict figur sum realiz latent variabl group ident dyad obtain usual mixtur probabl distribut observ repres empir frequenc margin count object denot expect maxim algorithm maximum likelihood estim requir maxim log respect model concaten vector notat conveni overcom difficulti maxim log appli expect maxim framework altern ffl expect estim posterior probabl unobserv map paramet estim ffl maxim involv maxim expect complet data log posterior probabl respect em algorithm observ likelihood converg maximum mild assumpt aspect continu equat class posterior probabl aspect model deriv rule sequel simpli denot straightforward deriv formula differenti wrt compon introduc lagrang multipli ensur correct normal obtain unnecessari store effici interleav asymmetr cross entropi minim achiev understand aspect elucid switch asymmetr figur arriv interpret aspect model term condit probabl interpret vector span subspac span simplex multinomi distribut determin optim approxim subspac paramet correspond coordin subspac span fp role dual formul obtain show aspect model condit distribut fix obtain convex combin prototyp notic estim decoupl paramet maxim joint predict likelihood maximum likelihood estim state minim cross entropi empir distribut model distribut case empir distribut asymmetr rewrit likelihood log log estim carri maximum likelihood estim remain paramet minim sum cross entropi empir condit distribut model distribut weight symmetri decomposit obtain interchang role set probabilist factor analysi discret data reduct obtain aspect model similar spirit factor analysi factor analysi data latent semant analysi matrix count singular decomposit orthogon matric diagon matrix singular valu approxim obtain threshold largest singular valu rank optim norm aspect model repres matrix ja ja joint probabl model matrix notat written product weight sum outer product row reflect condit independ assumpt factor correspond mixtur compon mix proport substitut singular valu svd import advantag aspect model compar lsa aspect model util statist diverg probabl measur qualiti approxim lsa base squar principl approxim count addit gaussian assumpt adequ frequenc tabl mixtur approxim yield probabl distribut factor clear probabilist mean term compon distribut defin properli normal probabl distribut neg entri aspect model understood factor analysi approach count data util likelihood object function make addit assumpt loss function associ measur cluster model model specif asymmetr cluster model differ aspect model latent class variabl object singl observ cluster model strict assum definit partit group make connect aspect model modifi introduc addit latent cluster variabl fc latent variabl figur graphic model cluster model hierarch cluster model state cluster aspect cluster variabl consist constraint aspect ffi ac notat ffi ac identifi ffi ac constraint restrict latent variabl space observ share latent aspect identifi graphic model shown figur notic compar asymmetr aspect paramet condit distribut replac free determin consist constraint omit graphic model figur directli read complet data distribut cluster model aspect variabl replac respect cluster variabl constraint sum latent space cluster effect defin mixtur denot set observ involv notic independ paramet aspect coupl share latent variabl expect maxim algorithm straightforward deriv em algorithm cluster model updat equat posterior probabl contrast equat aspect model likelihood contribut observ combin calcul posterior probabl share variabl paramet updat equat obtain altern posterior calcul paramet defin converg maximum likelihood procedur cluster naiv classif illumin rewrit class posterior probabl exp log compar standard model gaussian mixtur model probabilist vector quantiz demonstr cross entropi empir condit probabl serv distort measur cluster model notic number posterior approach extrem valu asymptot behavior differ aspect model obviou compar eq give cluster model interpret term inform theori identifi object sourc alphabet condit probabl correspond sourc code asymptot expect codeword length log data encod stage code util repres code asymptot averag codeword length code base cross entropi govern latent class posterior probabl cluster model view version naiv give interpret featur space sampl set correspond set featur valu assum independ estim perform train data class posterior data unknown label comput equat possibl weaken condit independ assumpt aspect cluster substitut multinomi distribut markov model tree depend model pursu paper cluster model model specif cluster latent structur consist cluster partit defin condit model defin ir cluster associ paramet weight probabl observ dyad cluster pair rel uncondit independ model order defin proper probabilist ensur correct global constrain choic cluster associ figur graphic model cluster model paramet prior probabl complet model specif cluster model enforc strict partit principl approach infer cluster structur simultan set level singl simultan cluster space impli observ latent aspect pair compon identifi latent class similar side cluster interpret cluster model term constrain aspect model identifi set compat condit ffi ac ffi bd graphic model cluster model figur obtain rule condit independ impli graph figur rewrit ffi ac ffi bd result ffi ac ffi bd compar suggest cluster associ paramet correspond ratio aspect probabl product margin probabl aspect pair formul cluster model maximum likelihood approach cluster associ oe hand constrain aspect model hand proven paragraph order figur correct graphic model demand technic condit cluster empti notic similarli conceptu prior probabl object latent class probabl latent observ approxim expect maxim algorithm main difficulti cluster model latent map coupl cluster associ strength made explicit perform maxim complet data likelihood constitut em procedur insert maximum likelihood estim maxim oe log oe respect oe solv lagrang multipli reveal differenti yield oe oe ih oe straightforward verifi express numer equat obtain paramet graphic model figur formul start point em term denomin correspond margin remain updat equat simpli oe oe posterior joint probabl oe comput order perform exact likelihood maxim preserv tractabl model fit approxim adequ perform variat approxim field replac exact comput posterior factori oeg oeg util approxim paramet approxim probabl distribut chosen order minim true posterior distribut approxim equat oeg exp oeg log oeg exp oeg log notic field condit form highli coupl system equat solut found iter altern comput latent variabl space approxim posterior base intermedi solut vice versa altern comput interleav updat set oeg term cancel exploit deriv result altern scheme optim common object function step maintain valid probabl distribut markov chain mont carlo method appli approxim requir posterior probabl field approxim advantag effici due determinist natur mutual inform cluster elucid hard cluster limit cluster model substitut continu paramet obtain measur defin instanti log log identifi expect mutual inform random variabl hard cluster cluster model reduc maxim mutual inform aspect variabl formul state mutual inform partit maxim hierarch cluster model model combin aspect cluster aspect model cluster model defin latent class structur context structur import find hierarch data organ learn architectur hierarch mixtur expert fit hierarch model data case dyadic data altern defin hierarch model combin aspect cluster hierarch cluster aspect identifi node hierarchi complet binari tree cluster identifi termin node latent aspect structur latent cluster structur introduc order enforc hierarch organ aspect intend structur relat compat symbol express read path root compar constraint cluster model immedi reduc hierarchi node cluster observ involv hierarch condit weaken observ aspect singl path tree graphic model hierarch cluster model ident cluster differ constraint weaken cluster structur complet determin aspect variabl freedom introduc addit paramet figur addit fulli parsimoni model entropi maxim model addit paramet provid interest altern em approach cluster model converg inferior local minimum start random posterior typic approach uniform distribut solut cluster model util initi set latent variabl implicitli assum model cluster suggest fit mix proport weight abstract level hierarchi data sum hidden variabl obtain nest mixtur formul hierarch compar cluster notic probabl replac mixtur mixtur axi hierarchi expect maxim algorithm hierarch model perform stage manner mixtur formul straightforward gener posterior probabl cluster constraint cluster posterior aspect variabl condit valu comput deriv equat standard procedur yield complet deriv em algorithm discuss point give systemat overview present model stress model deriv constraint basic aspect model model systemat arrang simpl venn diagram figur partial order distinguish constrain model aspect model constrain cluster model possess strongli restrict latent aspect space compar model predict probabl summar tabl regard tabl make ffl essenti differ paramet posterior probabl latent variabl cluster distribut aspect replac posterior probabl latent class asymptot approach boolean valu necessarili true paramet aspect model mix weight free hierarch hierarch model cluster model model model model aspect model figur venn diagram famili latent variabl model paramet aspect weight cluster model induc posterior uncertainti valu latent variabl ffl consequ interpret distribut aspect prototyp group object obtain convex combin cluster model attempt identifi characterist group object ffl hierarch gener cluster model class condit replac flexibl weight combin cluster model restrict cluster model proport margin probabl time modul factor depend class reflect addit induc group object relat model previou work brown al inform criterion model languag model word class form mutual inform class adjac word maxim model close relat cluster model main differ word class predict predict word identifi brown al hard cluster variant introduc greedi cluster merg algorithm idea present paper solicit pioneer work lee distribut cluster aspect model mixtur distribut start latent aspect variabl em algorithm deriv pereira al cluster method similar cluster base posterior class distribut obtain minim criterion entrop regular paramet result maximum entropi cluster membership exp fi log fi identif advantag term predict doubt identif pose addit altern scheme cluster model longer appli model aspect cluster hierarch cluster cluster tabl systemat overview present dyadic mixtur model differ equat cluster model factor expon class prior probabl reason object treat irrespect number observ sampl set centroid condit deriv maximum likelihood insert maximum entropi cluster membership probabl principl consid equat iter scheme remain unresolv underli common object function exist formul type equat deriv rigor theoret ansatz mutual inform principl offer perspect foundat learn maximum likelihood basi work saul pereira independ work model call aggreg markov model util model context languag model approach aspect model asymmetr restrict bigram model deriv em emploi anneal method section gener extens anneal em anneal em import gener model fit pursu main ffl avoid overfit control effect model ffl reduc sensit em local ffl gener tree topolog hierarch cluster model anneal em close relat determinist techniqu appli cluster includ cluster cluster context data distribut cluster kei idea introduc temperatur paramet replac minim combinatori object function substitut free energi present anneal method refer statist physic gener case maximum likelihood estim em algorithm definit comput posterior averag complet data maxim anneal temperatur perform averag wrt distribut obtain gener formula likelihood contribut power prior likelihood amount influenc prior turn result larger entropi posterior case aspect model cluster anneal gener fix anneal perform regular base entropi reason anneal em reduc sensit local minima control effect model complex potenti improv gener overfit model learn problem cf recent theoret investig benefit anneal avoid overfit phenomena advantag determinist anneal investig section statist determinist anneal fin limit stop temperatur fin data hard cluster applic perform anneal limit theoret determinist anneal find global minimum independ empir studi typic solut obtain significantli optim explain fact anneal origin object function smooth larg hierarch anneal em algorithm offer natur gener tree topolog adapt vector quantiz start high success lower typic lead sequenc phase transit phase effect number distinguish cluster grow maxim number reach anneal stop suggest heurist procedur start singl cluster split cluster sequenc split track respect diagram tree topolog note tree topolog success paramet posterior probabl latent class drastic chang anneal process expect maxim data analysi dyadic data neglect problem maximum likelihood estim share empir risk minim method maxim likelihood base train data automat perform unseen data effect overfit sever data cross valid conceptu simplest criterion model model train part data test remain observ procedur repeat data split averag predict serv model score great model directli modifi model fit procedur order obtain gener perform earli stop common util model iter fit method test error perform start degrad make specif assumpt natur fit method indic earli stop optim circumv overfit phenomena context discuss em simpl modif lead effici approxim modifi paramet estim comput posterior probabl correct subtract influenc observ relat latent variabl question basic aspect model neglect observ latent variabl lead modifi equat denot modifi estim obtain occur posterior probabl estim comput amount remov influenc observ paramet estim em iter remain indirect influenc lead problem cluster model observ remov estim posterior effici comput correct base addit bookkeep quantiti straightforward interpret cluster posterior probabl calcul base averag statist object assign cluster predict observ involv order preserv strict optim modif carri slightli care elimin observ found empir naiv correct discuss typic lead converg stabil problem simpler equat experi em em algorithm import advantag method problem converg speed em restrict applic larg data set simpl em algorithm discuss context mixtur model recent titl em found method fit procedur discuss model essenti estim gener paramet modifi usual typic found good choic speed converg case posit normal constraint violat perform paramet vector project back admiss paramet space neg probabl small posit overview elabor method em refer aspect hierarch tabl compar result unigram model discuss model cranfield ir test collect result base cross valid em optim approach cluster algorithm neighborhood structur exist object imag natur assumpt adjac imag site belong high probabl cluster imag segment fact exploit significantli estim process maxim suitabl nest sequenc variabl subspac manner achiev temporarili ty adjac site joint assign variabl notat conveni restrict present cluster extens cluster straightforward formal hierarchi nest sequenc relat ae xg context imag analysi relat typic correspond pixel grid obtain subsampl minim level constraint form scale optim level simpli yield constrain aspect model comput advantag reduc number posterior comput perform class maxim procedur resolut level optim proce level prolong found solut subset defin initi optim level solut level contrast multiresolut optim optim advantag maxim origin resolut level set hidden variabl effect reduc constraint set hidden variabl appli optim imag analysi experi result typic factor compar optim applic result section present applic domain discuss applic statist model dyadic inform data mine text comput imag segment comput vision concept present larg theori learn dyadic attempt perform detail perform comparison state art techniqu accompani forthcom public deal applic separ show suffici model appli realist problem report repres result optim current form applic aspect model diff diff diff diff diff diff figur anneal experi dataset model compon subsampl factor upper left lower denot number document data number temperatur util respect train curv data model evalu data domain variant extens em discuss section systemat compar main goal demonstr relev dyadic data model import applic investig question model model fit domain inform retriev intellig inform retriev kei topic data mine problem sever case queri formul natur languag interfac document collect digit librari imag obtain entri match queri similar measur difficult reliabl estim queri possibl relev keyword occur queri document unigram model seri investig gener question mixtur model perform predict occurr word context document thought iter iter iter iter iter figur anneal experi document number compon temperatur unigram languag model standard procedur statist set word occurr divid valid test set statist point view canon measur averag test set context natur languag process customari report perplex relat averag test set valid set determin optim choic comput temperatur anneal em algorithm standard ir collect document mechan engin evalu perplex result preprocess step infrequ common word word porter stemmer gener word stem result number compon summar tabl main ffl lowest perplex perplex reduct compar unigram model obtain aspect model hierarch cluster model perform constrain flat cluster model term perplex constraint mixtur model prefer cluster model ffl aspect model consist standard em algorithm cluster model optim gener perform requir higher temperatur recal method queri tf tfidf ml ml ab baselin rel baselin queri tf tfidf tfidf ab baselin rel baselin tabl retriev result percent evalu medlin cranfield collect macro averag denot term weight ml refer aspect model train em anneal em maximum ffl complex control restrict number compon aspect model compon suffer train em stress advantag anneal investig effect regular detail order sampl set size util topic detect track corpu consist approxim million word document larg subsampl experi focu control overfit problem local model train fix temperatur figur show perplex curv temperatur function number anneal em iter temperatur perform earli stop perplex data subsampl experi repeat run time order evalu solut variabl initi condit effect model vari number compon subsampl level result curv depict figur observ ffl temperatur yield consist improv sampl size figur model larg vari number paramet ffl expect benefit anneal diminish larger data set vanish infinit data effect temperatur full million word dataset overfit import problem data set ffl earli stop success prevent overfit experi perplex figur model perform cranfield collect term perplex gain temperatur fact advantag model huge number paramet figur observ overfit sever train curv perplex respect minima compar anneal train approxim time paramet achiev perform anneal solut qualiti obtain earli stop em ffl comput complex anneal em fix slightli higher compar standard typic iter converg experi achiev prespecifi perform roughli comput time memori requir standard em iter model compon roughli iter compon compar effect predict em variant show slight consist improv aspect model addit comput calcul practic predict em limit aspect model predict em shown stronger effect combin cluster correct term case em variant proven valuabl tool simul typic factor converg process anneal em import combin earli stop em train probabilist latent semant index popular famili techniqu util inform retriev vector space model introduc salton al smart system document repres term vector frequenc count term occurr compon import ingredi vsm function measur similar typic cosin vector term weight scheme cluster result model data present model observ distribu densiti studi model neuron process author inform cluster surfac state defect particl galaxi function correl author scale cluster object problem algorithm design fuzzi data algorithm classif featur ion increa atom temperatur concentr system test theori gener analysi galaxi magnitud evid blue nonlinear simul densiti hierarch approach point fuzzi genet init process model applic architectur structur cluster learn input quantiz vector segment object estim approach base atom format particl size concentr degr target grain coupl dynam network lattic matrix equat control case complex sampl alpha correl survei earthquak event time region distribu particl probabl univ radiu power scale correl spectrum map imag featur spatial partit method algorithm size processor distribut graph partit system machin manufactur learn cell format center function estim equal vector network neural learn control kohonen speaker speech train continu recogni imag region segment iter color map scale multilai activ adapt codebook design compress channel model chip phone sourc hmm ellipsoid concept shell pitch phrase tissu brain famili patient reson pixel textur contour motion spatial converg filter init mountain cost entropi membership bayesian figur upper level cluster hierarchi node probabl term condit probabl influenc term successfulli appli weight scheme tfidf frequenc document transform count denot fraction document term similar document queri comput ji angular similar measur scale replac count empir probabl kei idea probabilist latent semant index replac empir condit multinomi word distribut deriv aspect model linear interpol empir probabl condit distribut deriv model intuit aim exploit semant relat extract aspect synonym word similar improv match word queri occur condit probabl base aspect model high similar approach pursu standard lsi test method number standard document test collect relev assess comput curv curv report sequel obtain macro averag queri determin list pair comput singl pair obtain total number relev document queri number relev document network neural function result gener network algorithm learn train problem model neuron process author inform function weight learn error perform network process data model dynam time model synapt neuron learn algorithm rule network map net state neuron continu arbitrari method error gener learn perform classif train target featur classifi control neural design inform network neuron activ spike respon burst network neural learn algorithm dynam visual imag motion cell process memori associ pattern learn function number hidden machin bound algorithm backpropag minima updat rate energi delta valu memori associ model regular basi term architectur imag charact classifi featur constraint fuzzi map function boundari model nonlinear statist optim linear time robot domain level algorithm fire cell spike rate record oscil circuit local spatial electr control motor problem robot inhibit cell reinforc exten stochast recept field orient map cortic object featur recogni perform segment pattern memori node paramet rule optim size hebbian averag paramet assembl synchroni optim pyramid rat auditori threshold machin center conduct phase oscillatori coupl retin shape human enforc region oscil invari pattern line rotat transform invari recogn rotat filter local digit detect gabor continu art univ threshold circuit node theta transfer figur upper level neural hierarchi node probabl term condit probabl recal defin prec rq rec rq rq tabl summar result medlin collect cranfield document frequenc term weight model obtain em anneal em train main draw aspect model estim word distribut yield substanti improv term retriev regim high rel gain averag number irrelev document return rec level halv observ improv word perplex retriev strongli correl stress tabl compar overfit model train likelihood criterion perplex optim model train anneal likelihood exemplari run anneal em optim stop temperatur compar simultan develop word perplex curv shown figur crucial control gener perform correl perplex notic model obtain maximum likelihood estim deterior retriev perform data mine text structur visual larg kei topic data mine applic rang interact inform access effici data manag focu applic hierarch cluster model structur larg text repositori cluster document popular appli mix success context retriev great import interact retriev frequent method context linkag algorithm complet ward cf hybrid combin agglom method cluster robust segment channel glass figur exemplari rel word distribut node cluster dataset keyword channel probabilist interpret number disadvantag hierarch mixtur model provid sound statist basi addit featur make suitabl candid context perform experi inform retriev collect abstract facilit assess extract structur investig dataset document abstract paper cluster titl word dataset document abstract journal neural comput neural network data amen interpret reader standard text collect cluster hierarchi cluster neural gener hierarch cluster model visual figur figur hierarch organ document topolog relat cluster captur import aspect similar contrast approach distribut node hierarchi obtain procedur typic perform sort averag respect hierarchi abstract mechan fact lead special node special effect make probabl suitabl cluster summar node captur specif vocabulari document cluster specif term automat probabl word compon higher level node account gener term demonstr abil hierarch cluster model identifi abstract level visual distribut observ involv index word interest exampl figur tree word show occurr document explain common featur occurr assign root word found level indic typic word algorithm orient document assign node left branch paper physic astronomi index term occur approach point fuzzi genet initi process model applic architectur structur cluster learn input vector quantiz segment object estim approach base algorithm method cluster paper propo model observ distrib densiti studi cluster object problem algorithm design fuzzi data algorithm classif featur galaxi function correl author scale cluster surfac state defect particl tissu brain famili patient reson pixel textur contour motion spatial center function estim equal vector network neural learn control kohonen imag region segment iter color speaker speech train continu recogni figur run interact retriev session document imag segment level cluster hierarchi highli specif mean context stabil analysi aspect term broad mean robust method algorithm word occur document comput vision languag larger extend field specif term solid state found lowest level hierarchi context physic commun theori bimod distribut captur fact exampl demonstr extract hierarch organ reflect interest structur inher data demonstr depict virtual interact cluster hierarchi retriev session textur segment figur comput linguist comput statist analysi word lexic structur object recent receiv attent potenti applic method problem occur linguist task rang tag machin translat data util test model consist pair extract tag version penn treebank corpu corpu perplex result penn dataset report tabl result qualit similar obtain cranfield document singular plural form identifi aspect hierarch fi fi fi fi tabl compar perplex result pair treebank corpu applic inform retriev support drawn result simultan hard cluster data report figur visual matrix reveal group space prefer combin group complementari space adject group occurr noun cluster group respect group adject group head textur segment segment textur imag challeng numer approach textur segment past obei scheme model characterist featur extract textur input spatial frequenc cluster stage featur group homogen homogen featur typic formal cluster optim criterion featur interpret vector euclidean space segment obtain minim sum squar distanc featur vector prototyp featur vector group process base similar measur imag similar measur statist test appli featur distribut surround neighborhood similar cluster indirect group featur distribut reduc inform distribut mixtur model dyadic cluster formal group featur distribut direct manner contrast similar offer sound gener model textur class descript util subsequ process stage edg local comput larg matrix similar score imag greatli reduc process time memori requir compar techniqu significantli flexibl distribut model textur segment applic class featur exhibit main reason success similar cluster approach cluster model compar standard appli cluster model segment textur object correspond imag locat number observ featur ident simpli set adopt framework util imag base modulu complex gabor filter empir distribut coeffici surround window determin report segment result base filter bank twelv gabor filter orient scale filter output discret equal voic face bodi head light work idea book job manner word line impress statement style power war size test weapon behaviour floor trip leav companion place field person section studi life natur spirit worker demand inform acid glanc parti countri system market societi famili court child commun experi reason result knowledg featur posit unit trade control express desir space note world town method movement view water ey hair fish milk attitud thought tradit programm deal friend night bird land music metal blow stone thing hand area side author govern paper council figur piec shape sound wind soil spot iron ship drink number amount scale report major chang term properti action effort man time peopl year dai level rate price cost smile frame crowd babi phrase effect qualiti solut pictur colour interest condit develop meet activ servic school class agreement part form problem case type feel love letter silenc heart complet natur offici separ grow good great fine bad close strang thin soft plain sudden sharp power friendli curiou true hard excel ancient famou wide left opposit young earli short high final low ordinari averag nuclear western appar atom potenti human holi peac continu special import basic larg total annual common foreign technic open medic small big suitabl light tini perfect nativ distant violent empti endless clever slight vertic sever aw similar singl strong regular obviou electr massiv gentl cool cheap doubl huge tremend firm nation gener public social privat real origin simpl present modern exist royal extend close reciproc long poor happi golden beauti red cold black dark hot heavi literari familiar pure solid full militari free music deep daili quick mix squar local white central legal eastern interest usual success remark histor polit person econom individu industri figur cluster visual matrix cluster probabl word size bin consequ condit independ result featur space size gabor coeffici sampl local window size proport scale filter finest scale rectangular window util simpl spatial prior util class distribut suppress small region prior em essenti comput high qualiti solut excel segment qualiti obtain acm histogram cluster algorithm illustr result fig mixtur brodatz textur partit accur error rate error basic correspond boundari site result obtain aerial imag satisfactori due miss ground truth qualiti quantifi disconnect textur region type identifi problem occur textur boundari segment qualiti achiev outdoor imag fig visual semant satisfi detail evalu cluster model textur segment scope paper publish main contribut paper class statist model analysi cooccurr data evalu introduc discuss model distinguish systemat point hidden variabl effect constraint compon distribut mixtur recent statist model turn special case model sound statist foundat defin gener fit em algorithm proper select method choic problem crucial depend model goal requir detect group structur hierarch term statist accuraci perplex order extract structur interest figur mixtur imag textur brodatz error depict black mixtur imag textur extract aerial imag model deriv extract group structur simultan object space model hierarch depend cluster strongli framework flexibl adapt task gener develop method stress reveal benefit context broad rang potenti applic addit model address comput improv variant basic em algorithm experi underlin advantag anneal version fruit combin idea method statist statist physic acknowledg author michael peter joachim buhmann comment suggest author grate carl de joshua goodman share data natur languag process du buf provid imag data depict fig appendix anneal em free energi minim shown em free energi criterion fact deriv approxim denot gener latent variabl realiz famili object log log sampl paramet correspond comput temperatur sum expect complet data entropi posterior distribut deriv wrt ident maxim wrt probabl distribut variat paramet intend figur typic segment result imag segment obtain acm recov posterior probabl prove maxim wrt wrt free energi lyapunov function em algorithm arbitrari motiv anneal em optim principl approxim em field approxim optim principl offer systemat approach deriv approxim restrict optim wrt distribut approxim chosen tractabl typic simplifi factori form gener formul approxim probabl distribut chosen maxim shown variat principl minim approxim true posterior distribut model util gener principl cluster set constraint insert express make factori form obtain relev part lagrang multipli term enforc log log log perform maxim wrt set yield exp log provid eq simpli equat approxim posterior probabl assur variabl ident order simpl express optim framework util deriv modifi strict optim principl demonstr idea aspect model introduc variat paramet posterior probabl substitut equat paramet obtain log log log maxim wrt deriv stationari condit involv technic algebra manipul refer anderson introduct statist analysi categori data latent variabl model factor analysi number griffin statist monograph oxford salton automat rout retriev smart inform process pf pv rl vj della jc lai model natur languag comput jm buhmann vector complex cost ieee transact inform singer updat rule paramet estim bayesian network annual confer uncertainti ai rhode august bock und zur und von number studia mathematisch und buhmann empir risk induct principl learn technic report institut fur informatik data cluster model granular magnet neural carrol scale annual review dr dr jo pedersen approach larg document collect seventeenth annual intern acm sigir confer research develop inform theori data john wilei singer learn order thing advanc neural inform process system cover thoma element inform theori john wilei pereira estim word probabl associ comput pereira method word disambigu associ comput ap nm db rubin maximum likelihood incomplet data em algorithm royal statist soc dumai furna tk landauer index latent semant analysi journal american societi inform cooccurr smooth stochast languag model ieee confer signal page dong boundari detect constrain optim ieee transact pattern analysi machin terri collabor filter weav inform tapestri commun ij good popul frequenc speci estim popul paramet ij good estim probabl research monograph mit hofmann jm buhmann data cluster determinist anneal ieee transact pattern analysi machin noun classif structur page minim global energi function visual recoveri problem imag jm buhmann textur segment determinist anneal framework ieee transact pattern analysi machin jordan learn dyadic data advanc neural inform process system ak jain rc dube algorithm cluster data prentic englewood nj jelinek develop discret dictat jain textur segment gabor filter pattern mi ts lk saul introduct variat method graphic model mi learn graphic page kluwer academ mi jordan ra jacob hierarch mixtur expert em algorithm neural jelinek mercer interpol estim markov sourc paramet data workshop pattern recognit sm katz estim probabl data languag model compon speech ieee transact speech signal ja herlock appli collabor filter usenet commun kruskal scale sage ldc linguist data tdt pilot studi corpu document ke lochbaum la compar combin effect latent semant index ordinari vector space model inform retriev inform process gj mclachlan mixtur model marcel york mao jain textur classif segment multiresolut simultan autoregress model pattern jordan estim depend structur hidden variabl advanc neural inform process system gj mclachlan krishnan em algorithm extens rm neal ge hinton view em algorithm justifi increment variant mi learn graphic page kluwer academ jan puzicha joachim buhmann anneal textur segment intern confer comput vision page healei markov random field model segment textur color imag ieee transact pattern analysi machin puzicha hofmann histogram cluster segment imag retriev technic preprint submit pattern recognit buhmann theori proxim base structur detect optim pattern muller anneal competit expert segment classif switch dynam neural nz lee distribut cluster english word page peter walker iter procedur obtain estim paramet mixtur normal distribut siam journal appli fox statist mechan phase transit cluster physic review fox vector quantiz determinist anneal ieee transact inform determinist anneal mixtur expert model statist regress ieee intern confer signal volum page ieee comput soc salton bucklei global text match inform retriev august hierarch imag segment cluster boundari refin pattern schutz automat word discrimin comput salton mcgill introduct modern inform retriev saul pereira aggreg markov model statist languag process intern confer empir method natur languag schutz jo pedersen thesauru applic inform retriev inform process nz tishbi pereira person commun dm ue statist analysi finit mixtur distribut john wilei van rijsbergen inform retriev ih witten tc bell estim probabl event adapt text compress ieee transact inform whittak graphic model appli multivari statist john wilei willett recent trend hierarch document critic review inform process sl lauritzen substant research condit independ graph graphic chain model journal royal statist societi seri
DB/1128 3 approxim evalu olap queri integr statist data £ jose lui ambit shahabi rolf schmidt andrew philpot digit govern research center inform scienc institut comput scienc depart southern california marina del ca usa abstract develop mediat architectur integr statist inform energi product govern bureau labor energi inform california energi commiss architectur dual mode oper system retriev live data web sourc agenc user obtain complet data complex analyt queri typic requir larg amount data live access offer level interact user requir system inform data sourc complex analyt queri execut effici data recent updat data paper describ architectur focu perform analyt queri data effici present result fast techniqu progress evalu queri techniqu return approxim result queri effici fast converg exact result user explor complex queri fast approxim result guidanc obtain exact result queri deem interest present result show effici approxim exact queri introduct govern produc wealth inform gener public analyst govern agenc make inform varieti text web site static data interfac limit form data import statist data collect publish part mandat data refer analysi sector econom activ find data relev applic domain requir user gather inform multipl agenc inform gener user analyst greatli facilit singl point access uniform access mechan requir data £ research support nation scienc digit govern program contract shahabi schmidt support part nsf grant contract nr darpa usaf agreement nr unrestrict gift intel sun user worri terminolog agenc integr access data import analyst evalu complex queri data obtain fast energi data collect digit govern research center address type inform integr problem energi data collect project build integr system access dissemin energi data sourc bureau labor statist censu depart energi inform administr california energi commiss build previou work project architectur fast evalu olap analyt queri integr data place construct data energi data integr multipl agenc describ effici method process queri base wavelet techniqu schmidt queri olap queri wavelet method provid fast approxim answer converg rapidli exact answer comput exact answer competit approach type queri rest paper organ describ integr approach support live queri access materi local data describ progress olap queri evalu base wavelet result energi domain conclud discuss approach futur work inform integr phase project develop mediat architectur integr data web site agenc bureau labor statist censu energi inform administr briefli present mediat architectur model data refer reader detail describ extend architectur incorpor local data effici process olap queri architectur system figur princip manag access overarch ontolog term defin interfac ontolog descript concept interest domain addit common concept queri planner ambit answer user queri concept descript find sourc relev data interfac intuit mechan user queri system time seri ontolog conjunct hierarch product type premium properti measur area measur unit fragment ontolog show dimens figur time seri sourc specif valu hierarch dimens sourc provid monthli price consum price premium gasolin state california dimens metadata describ seri actual data model set measur date domain model describ sourc footnot data construct extend year domain model text analysi area usa period month ca ny subclass week gener relat sourc map integr ontolog global terminolog sourc descript sourc user interfac ontolog browser queri constructor queri processor reformul σ cost optim figur mediat architectur unit measur time seri footnot point sale date text tag regular premium user queri access creat db queri retriev data figur dimens time seri ontolog product gasolin premium qualiti price volum lead architectur dual mode oper system retriev live data web sourc user obtain complet data complex analyt queri typic requir larg amount data live access offer level interact user requir system inform data sourc complex analyt queri execut effici data recent updat data extend architectur shown figur figur show process load data sourc model ontolog retriev store local data normal common schema local evalu queri effici describ section figur show data user interact friendli interfac pass formal queri queri planner queri planner analyz queri decid retriev data live local data paper address reason task mediat decid live sourc section describ mediat effici evalu complex analyt queri data data remot sourc sn user interfac remot sourc load data data figur support integr system data sn data local sourc fast progress evalu olap queri rang sum queri basic type support techniqu evalu scale poorli dimens data domain schmidt introduc algorithm produc exact rang sum queri result effici produc accur estim queri result long exact comput complet combin deliv progress queri provid quick approxim queri increasingli accur comput progress paper appli statist data integr ple agenc section present introduct main idea refer reader schmidt detail technic descript section show result data energi domain progress algorithm queri evalu exact queri complex ç æ variat algorithm storag complex ç æ larger problem execut memori cost updat techniqu ç æ knowledg exist algorithm lower queri complex higher updat cost lap produc accur approxim queri result termin exact comput complet demonstr implement approxim queri result small fraction complet progress provid user increasingli accur queri estim process exact queri evalu rang queri simplic restrict attent data lie data cube dimens point entir domain æ point definit rang rectangular region form ê é addit rang queri defin sum measur attribut point lie rang simpl gasolin domain sum gasolin volum consum state grade sum written integr rang product measur function data densiti function formul make definit definit measur rang ê point densiti function ê rang queri é defin é ü ü ê ü ü ê denot characterist function set ê function ê refer rang function queri core definit show associ queri rang function fundament idea express rang function sum basic compon function compon function thought decomposit data storag format comput constant time queri sort order import final result evalu import progress accur estim eventu exact result algorithm progress queri evalu simpl high fundament challeng approach order find good decomposit rang function decomposit uniformli small number term rang queri complex depend natur rang evalu quickli approach satisfi requir wavelet decomposit rang function evalu easili wavelet transform function sum orthogon ü ê ü rewrit sum definit ê ü é ê decomposit rang function basi wavelet perform effici store valu evalu ê quickli comput wavelet transform ê approach practic decomposit wavelet coeffici typic rang function ê turn remain coeffici comput quickli fact wavelet queri sum small number easi comput carri high level progress queri evalu strategi perform evalu implement wavelet implement test real data gasolin domain result compar favor approxim olap algorithm shanmugasundaram attempt direct comparison demonstr show quickli converg exact converg affect size queri rel size domain number access proxi number error measur report queri error averag rel error normal absolut error attempt absolut error normal divid error largest partial sum found normal error good conserv class divid averag absolut error averag magnitud nonzero queri result measur estim distinguish queri progress nonzero exact answer queri gener test varieti rang shape size present detail result repres queri class select dimens give datacub million cell dimens execut count queri class larg small rang edg small constant size dimens medium rang side length proport squar root dimens size larg rang side length equal dimens size rang size chosen wavelet transform small rang fall primarili high resolut wavelet transform larg rang fall primarili low resolut wavelet transform medium rang concentr middl resolut level restrict attent queri return result restrict interact olap user issu queri interest region region queri thousand queri rang size gener uniformli data domain error statist accumul queri evalu produc result report result figur demonstr rate converg exact result data set figur show normal absolut error queri result plot versu percentag total complet curv graph repres rang result displai larg rang result averag absolut error rang type averag nonzero queri result averag absolut error af averag queri result observ converg quickli larg rang small rang figur similar figur report averag rel error absolut error rel error similar trend averag rel error rang type complet improv larg averag rel error complet normal absolut error small medium larg percentag complet discuss averag rel error small medium larg percentag complet absolut error rel error figur queri evalu progress gasolin domain integr architectur oper virtual mode materi mode system work mediat integr virtual actual data resid remot sourc data integr model queri process mediat system materi data local data system process complex analyt queri effici massiv data set queri evalu algorithm produc exact answer competit algorithm fast approxim answer futur plan explor combin virtual materi approach shown figur mediat answer user queri materi remot sourc evalu time optim area futur research integr data set multipl granular advantag summar properti wavelet recal descript hierarch attribut seri monthli measur yearli measur obtain data yearli granular aggreg monthli data data monthli plan properti wavelet infer lower granular data distribut data approxim evalu queri imposs answer integr system refer simplifi data energi data collect project ieee special issu digit flexibl scalabl queri plan transform approach artifici intellig queri reformul dynam inform integr journal intellig inform special issu intellig inform build base machin translat twelfth nation confer artifici page wa fast techniqu progress evalu olap queri submit wavelet base densiti estim model olap data set workshop mine scientif conjunct siam confer data mine compress data cube olap aggreg queri approxim continu dimens acm sigkdd inter conf knowledg discoveri data mine data cube approxim histogram wavelet proc conf inform knowledg page acm
IR/1129 5 effici queri heterogen environ germani abstract applic multimedia inform manag system meet challeng effici retriev match object vast collect data present algorithm process queri heterogen data sourc data distribut specif kind combin function present retriev strategi essenti speed output relev object introduct modern inform system increasingli reli rank queri model model queri grade match assign object queri result fix set list object order descend score valu sort list refer output object deliv start object output stream gener featur call atom complex queri answer combin output stream atom part queri rank queri model proven advantag field similar object document relev set keyword visual similar set imag case similar depend singl approxim set classifi classifi assign score valu rank object individu relev object determin aggreg individu score suitabl monoton combin function rank queri model handl multimedia document retriev facil sql multimedia standard object rank result set perform complet scan remain difficult problem retriev heterogen environ classifi inform system retriev data problem larg unsolv recent research multipl classifi combin develop classifi determin effect combin classifi assign weight optim combin function applic inform portal digit librari shift mere effect retriev effici issu combin multipl classifi speech recognit number candid recogn sentenc small grammar aim find adequ improv effici find candid entir set sentenc relat work gener middlewar garlic visual retriev system kind internet sourc inform portal integr heterogen datasourc strongli differ type featur offer retriev todai task solv middlewar technolog architectur system shown figur offer middlewar solut queri engin split complex queri pose underli system extend advanc retriev facil combin engin collect incom output stream combin algorithm find object quickli result multimedia object document retriev deliv internet exist combin algorithm design homogen environ tend deterior complex linear scan heterogen environ figur architectur system previou approach field queri combin gener divid statist approach correct statist approach assum score distribut output stream estim stream fetch calcul object arbitrarili high type algorithm correct result set benefit real score distribut stream favor remain paper refer algorithm deliv correct result set algorithm reli main sort access random access sort access mean access object object output stream suitabl number object order bulk access random access specif score object retriev classifi heterogen environ random access imposs algorithm mention differ exact number random number random access termin present algorithm retriev top object combin atom output stream random access algorithm correct result set output object success found heterogen environ assumpt made integr result local attribut identifi easili map global domain normal case assumpt hold determin constant consid ident requir detail knowledg combin output stream heterogen environ perform random access lead compar object stream object stream linear scan random access combin algorithm sort access break complex compar object object occur output stream object retriev sort access stream decid ident object occur stream global identifi assign handl object global identifi map local identifi object data sourc algorithm atom output stream combin function number result object atom output stream initi object tupl initi global object identifi object local oid score object occur local oid score object initi null previou step object stream qi compar object stream qj prove object tupl global oid initi local oid score stream qi updat exist tupl object belong updat score stream estim aggreg score partial unknown score valu set lowest stream valu upper bound unknown score calcul aggreg object aggreg score calcul exact local score estim upper bound step check final object object local oid score check object estim aggreg score higher output object object output algorithm termin stream object expand stream local oid object maximum aggreg score miss proce step show test final result correct result set state theorem object calcul score larger equal calcul estim score object object entir object larger aggreg score aggreg score larger upper bound aggreg score object occur output stream score valu equal lowest score stream score object occur stream score descend sort output larger equal lowest score stream due monoton combin function aggreg score larger equal score contrari assumpt short understand work lead heurist improv answer complex queri instanc consist text queri imag queri atom output stream retriev understand oid object heterogen stream assign global oid imagin interest object entir equal weight arithmet mean combin function queri keyword rank score object queri visual similar rank score object start element stream object access store tupl suitabl global oid score stream inform stream upper bound aggreg score object bound object stream continu collect object altern stream lowest score stream estim miss object bound stream reveal miss score object object bound object complet aggreg score lowest object interest expand stream reveal score object object bound time find object calcul score higher estim score output object entir object analyz sort access improv improv perform algorithm combin simpl heurist earli termin algorithm output stream test equal object stream effici algorithm major task runtim detect score aggreg score calcul elimin object higher estim score highest calcul score achiev stream reveal miss score valu object estim score suffici retriev set object aim success retriev set object classifi rank base abstract exact rank object import speed perform preselect object rank leav final object relev expert user advantag retriev strategi user earlier start work part correct result set retriev object satisfi execut queri stop user quickli impress final result set repres clear result set queri refin relev feedback earli retriev time wast improv basic algorithm check final result note retriev model deliveri algorithm result set consist object object rank demand retriev full set set object wait object top score object output adapt theorem object set highest estim object belong object note final rank occur rank object calcul final score object found object output object find object top estim final find object score higher estim score object rank aggreg score final sort optim choic stream forc earli termin stream indic select stream improv task indic stream show distribut rapidli score valu stream contribut aggreg score stream estim score maximum number object distribut score rel rank occur distribut total differ output stream output stream score fall monoton declin stream score slightli chang rank stream start high score valu declin rapidli exist output stream score chang forc declin estim stream show behavior declin score rapidli rel rank prefer evalu obviou measur deriv function correl score valu rank occur output stream function behavior estim differ output score assum element stream stream provid compar larger estim output stream global small valu detect local stream indic import stream aggreg score declin stream low weight natur regard import declin highli weight stream prior evalu weight express combin function weight arithmet simpl measur import stream qi partial deriv combin function task indic count estim object improv expand stream expand stream score object estim score reveal inform avoid object improv stream inform deriv indic count number object possibl benefit stream respect atom score miss state count number improv object object atom score reveal estim indic score object object rank zi lowest rank stream qi expand indic stream qi element calcul prune search space object stream aggreg score due theorem total object higher aggreg score object stream object updat object occur object collect tupl initi object account comparison updat algorithm atom output stream combin function number result return counter number object object atom output stream calcul indic equat stream counter set initi object tupl initi global object identifi object local oid score object occur local oid score object initi null object previou step stream qi compar object stream qm prove object stream object tupl global oid initi local oid score stream qi updat exist tupl object belong updat score stream estim aggreg score partial unknown score valu object set lowest stream calcul aggreg object aggreg score estim check final object ox check object estim aggreg score higher ox ox output top tupl object algorithm termin stream object expand stream maximum indic calcul indic expand stream proce step stream arithmet mean combin function time retriev object indic simplic order smoother runtim behavior larger valu spite abrupt score heurist work initi phase calcul indic object stream tabl indic arithmet mean object bound score differ object stream improv indic object expand stream object bound calcul indic expand stream expand stream object bound object mean expand stream lead relev indic expand stream object bound object tupl remov output output counter set improv object expand stream object bound final aggreg score calcul larger score object indic essenti improv perform time sort access basic object indic prevent invest sort access provid inform note due indic calcul irrelev aggreg score object unlik previou summari outlook paper present call retriev object set rank result list random access modern inform system tend rank queri effici retriev top result vital field heterogen datasourc retriev system current approach fail due excess random access exist algorithm design homogen environ shown linear scan object innov approach combin perform gain heterogen environ turn random access control flow heurist pick stream improv earli termin algorithm forc set object retriev success result deliv algorithm run futur research focu studi applic develop iter sort access heterogen environ essenti real world benchmark obtain feel complex practic applic refer al queri multimedia data multipl repositori garlic project proc work confer visual system pp switzerland wagner project multimedia support histori human scienc annual confer german comput societi pp septemb merg rank heterogen internet sourc proc intern conf larg vldb pp optim queri imag proc intern conf larg vldb pp fagin algorithm merg rank result multimedia middlewar proc intern conf cooper inform system pp great cohen integr heterogen common domain queri base textual similar proc intern conf manag data pp multipl classifi lnc bunk combin acoust visual classifi recognit spoken sentenc proc intern conf pattern recognit icpr pp spain gravano optim queri multimedia repositori acm symposium pp acm fagin combin fuzzi inform multipl system acm symposium pp acm inform technolog languag sql multimedia applic packag part imag
Agents/1130 1 spatial agent implement logic express languag frieder oliv jan bj informatik universit institut ur rheinau koblenz spatial agent implement logic express languag frieder oliv jan bj abstract present architectur spatial tempor agent focu laid declar make agent script express understand realiz logic program logic descript languag express action plan autonom cooper agent robocup system architectur host constraint technolog qualit spatial quantit data basic layer process agent sensor inform interfac transfer data logic facil access preprocess data suppli basic skill layer perform spatial reason top layer enabl complex skill fourth layer establish act team emerg explicit cooper logic deduct provid clean mean implement teamwork behavior introduct task solv team autonom agent complex order achiev singl agent set complementari subtask action perform pure reactiv meet requir task requir amount plan reason led idea combin advantag procedur logic program decid hybrid system layer architectur layer architectur advantag build clear architectur independ modul distinguish urgent task perform pattern requir time care plan cognit task implement agent logic contrast approach provid architectur system logic deduct formal specif languag implement languag widespread architectur origin mean modal logic axiomat kind architectur recent implement languag describ system architectur show deduct constraint robocup system combin bdi approach multipl agent perform collect action agent autonom implement manner similar logic program major goal undertaken ffl modular system architectur meet requir robocup agent agent react desir complex behavior agent program easili declar manner ffl handl format knowledg environ inform quantit pictori proposit natur deduct express plain logic constraint technolog integr axiomat approach spatial constraint theori numer sensor data ffl agent act autonom cooper agent develop script languag specif collect action intend plan applic situat script translat logic program straightforward manner outlin approach discuss layer system architectur function respect layer fig show complet architectur lowest implement interfac layer implement logic program languag basic skill percept spatial reason qualit behavior cooper abil complex prolog figur system architectur basic layer host reactiv behavior implement prolog extens extens enhanc robocup interfac time critic comput task handl exchang data modul atom command complex action logic formal kick environ posit determin settl layer sect specif facil soccer scenario dribbl ball intercept spatial cognit requir spatial cognit content layer player recogn pass ball player approach pure qualit disregard quantit inform transfer qualit inexact vagu logic connect formal access data level abstract reason exact requir present approach detail sect layer host complex possibl requir singl plan question remain teamwork invok explicitli commun suffici robust implicit teamwork kind agent work current implement implicitli exploit knowledg implement agent except clone cooper behavior requir implement detail problem commun languag case gener approach exchang knowledg agent knowledg queri manipul languag domain applic kqml gener reliabl commun intern architectur unknown agent commun prolog predic directli advantag approach interpret receiv inform disadvantag success commun agent intern structur basic abil action lowest layer system architectur handl basic skill percept environ basic skill action perform immedi turn kick ball complex action spatial dribbl ball ball intercept current complex action part written prolog modul depend hardwar percept includ object local complex requir process simplest percept mean read data agent sensor data order make tractabl comput program note aim logic present combin advantag declar effici addit make constraint technolog logic descript languag introduc agent program written interpret manner similar clp line distinguish class action percept execut percept predic return request data data argument predic real number percept predic return distanc measur meter real number main matter action perform action action predic primit action assign truth depend success failur action note truth predic depend actual time action request data execut interfac ffl request sensor data agent knowledg base updat period request inform object visibl recent inform agent store inform object simul time step agent memori recollect ffl data process complex inform global posit inform sect direct relat object refer actual agent relat obj depend rel posit obj obj agent independ properti ffl pass time model wai mean creat snapshot world defin calculu track actual simul step time ignor ffl prolog predic provid request current statu sensor inform demand data synchron agent action initi posit determin import piec inform agent posit system extens librari make object local give overview work inconsist inform agent egocentr view world actual sensor data provid inform posit landmark point border line rel posit orient agent polar coordin intern coordin system note agent obviou face bodi direct rel posit inform suffici complex task addit egocentr view scenario yield frame refer absolut global map environ extern coordin system robocup geometri plai field convert posit inform cartesian advantag absolut posit agent identifi locat respect object visibl moment absolut frame refer order commun agent situat cooper action system host procedur object local wrt extern coordin system introduc requir direct visibl landmark rel orient agent provid posit agent form circl lie straight absolut posit orient agent comput time complex linear number landmark equat system complex number data procedur estim posit appli squar method refer actual posit question li segment circl shown fig figur angl inform procedur limit sensor data landmark border line procedur posit determin requir case posit agent uniqu determin distanc angl landmark suffici posit determin rel posit landmark point border line center line view axi agent cross line provid point ident track movement estim current posit method implement order lai solid quantit basi qualit reason higher layer basic skill agent move environ basic requir practic robot system robocup scenario agent handl ball mean run kick dribbl ball import task ball intercept agent recogn comput ball trajectori comput point ball intercept stop ball macro execut situat qualit reason larg set abil robocup scenario state sight ball consid part architectur agent task requir deep comput quantit data made action reason reason classifi action basic skill complex action requir reason content layer sect basic skill implement describ special skill ffl agent search account knowledg time ball ffl dash kick agent condit avoid obstacl dribbl ffl extrapol ball trajectori time futur enabl agent intercept oppon pass block shot qualit spatial reason human soccer player enter lot decid decid compar situat situat handl build provid client situat connect action recogn situat client experi plan action rare case client situat fit store situat pattern set abstract pattern similar situat heurist action execut modifi order identifi situat abstract quantit data qualit level class addit class mention sect qualiti qualit predic defin quantit percept logic rule relat case qualit predic relat base case speak pure qualit predic relat left reduc qualit predic left dist left dir left left distanc agent ball robocup scenario aspect interest distinguish close ball agent detect detail short shoot data remot quantit distanc interv map qualiti chosen plan scheme instanti quantit data actual execut relat work present reason qualit level provid fig illustr correspond quantit qualit distanc short distanc area figur distanc quantit qualit constraint reason approach qualit spatial reason reli region connect calculu renz advantag qualit inform seemingli complex situat reduc pattern concentr relev portion inform qualit descript rough approxim reason pure qualit level vagu question make quantit qualit inform sensor data good idea make quantit data abstract qualit level quantit inform pure qualit reason knowledg prefer combin quantit reason qualit spatial implement constraint system formal integr gener deduct framework constraint logic program process spatial reason context lai basi action perform problem ffl sourc inform numer sensor deriv qualit knowledg control mechan decid request inform obtain current quantit data simpli convert qualit present rare case pure qualit reason perform appli transit rule topolog relat ffl difficult decid situat option current simpli make backtrack facil prolog good idea emploi reason process axiomat approach investig problem model situat pattern mean logic program full theorem prove system protein pass ball situat player player reach player opposit model situat top logic relat properti qualiti axiomat possibl model top gener geometr axiom collinear basic concept natur order version base assum sensor data inform order order inform requir plan action detail axiomat approach neg inform oppon prolog negat failur problem complex queri led full logic protein theorem prover problem determin pass check logic rule negat rule pass intend mean rule pass oppon agent partner question negat existenti quantif protein classic negat usual theorem prove existenti quantif treat replac existenti quantifi variabl constant function potenti infinit player consid finit domain player visibl agent implement close world constraint domain reason complet termin system sophist kind negat context note compon integr actual koblenz axiomat situat higher abil task requir deeper express bdi agent architectur belief qualit predic negat conjunct belief goal achiev goal test goal qualit predic desir goal index list satisfi desir perform action build rule situat form written belief precondit intent strictli intend intend plan acycl graph desir design start node edg label actor subset actor edg outgo test goal label addit possibl delai subgraph wrt edg actor requir tree start node binari branch test node subgraph repres role respect actor achiev goal perform activ index wait achiev extern interrupt occur messag robocup agent return default applic precondit doubl pass collect action doubl pass actor actor kick ball actor actor run expect pass actor illustr fig order initi agent simultan recogn respect role current situat belief state belief doubl pass situat nearest neighbor belong player ball player oppon dribbl straight intend plan dash pass pass figur doubl pass situat pass ball run final pass ball respect rule express shown fig dribbl figur doubl pass script experi implement doubl notic main problem actor simultan recogn agent possibl agent commun agent lot cooper partner coordin belief state made similar experi simpler kind simpl pass main problem agent partner agent pass make order initi complex action probabl success action complex decid action agent remain autonom robust translat rule clp distinguish type basic plan actor complex plan actor plan implement higher abil realiz teamwork bdi script translat clp rule straightforward manner achiev test goal introduc rule default recip extern event updat main differ clp approach handl extern event concurr congolog giacomo qualit reason perform constraint realiz time account situat role bdi script translat directli logic program possibl concurr constraint reader notic situat role correspond clp rule rule ident wrt head precondit action differ actor role part actor plai role respect situat instanti plan actor doubl pass rule fig role role dribbl recal achiev goal convert test goal control sequenc give shown translat clp rule time complex decid action role perform problem partial overcom commun action directli partner implement send call prolog predic robust system case fail action fail commun summari present logic descript languag line implement languag understood gener clp quantit qualit spatial reason pure qualit reason effici calculi context quantit inform system clean mean program soccer agent declar koblenz player implement team peopl conduct test game score local mbit ethernet result success game shown fig koblenz link op pentium ii sun sparc mb main sun mhz gb main koblenz sun mhz gb main sun sparc mb main figur success soccer simul game problem solv small identifi main huge effect player ffl execut collect action fail imperfect implement low level facil activ agent recogn situat special role intend plan pass agent reach agent minim improv skill implement work adapt skill cmunit simul predict local optim skill ffl point situat doubl pass implement agent frequent stick default situat unclear agent problem solv axiomat situat provid script agent work concentr requir except situat concurr mechan inform acquisit area research logic mechan lower level approach deduct build complet view agent world time agent set logic rule rebuild agent spatial applic techniqu real robot step research activ robust process improv mean reason specif commun languag reason formal investig refer peter baumgartn ulrich furbach prover theori extens interfac alan intern confer autom lnai page york anthoni combin multipl spatial reason system ieee intern confer tool artifici intellig page newport leonid mobil robot local landmark ieee transact robot april foundat geometri michael bratman practic reason harvard von und mit fachbereich universitat marku jan wendler artifici soccer ai page di daniel hernandez qualit posit inform artifici klau fredrik johan helmut itsuki patrick peter version giacomo giusepp de yve hector levesqu reason concurr priorit exogen action situat calculu martha intern joint confer artifici page volum jurgen frieder pablo autom reason logic program german workshop inform intern comput limit user manual extens user manual volum lar axiomat approach spatial relat underli front gunther steffen advanc artifici intellig annual german confer artifici lnai page york christian kai zimmermann util spatial structur cognit plausibl effici reason ieee intern confer jaffar michael maher constraint logic survei journal logic christoph jung layer agent robocup simul asada hiroaki robot soccer lnai yanni labrou tim finin kqml specif technic report tr comput scienc electr engin maryland baltimor md februari jan murrai goal castl die ein de fachbereich universitat itsuki noda soccer simul robocup oliv user march oliv ein zum robocup soccer server fachbereich universitat anthoni cohn spatial logic base region connect int conf knowledg page san morgan kaufmann anand rao bdi agent speak logic comput languag walter van de veld john agent break european workshop model autonom agent lnai page springer jochen renz bernhard nebel effici method qualit spatial reason henri european confer artifici intellig john wilei peter manuela patrick rilei champion simul team asada hiroaki robot soccer lnai research report frieder oliv jan bj spatial agent implement logic express languag kurt carlo simon zur hybrid system frieder stolzenburg power model gener peter jd bruce spencer merg path improv minim model hyper tableaux urgen roger uh worldwid peter norbert ulrich furbach confluent connect calculu bernt andrea winter queri enabl technolog softwar reengin urgen georg pick program urgen ulrich ilkka niemel nonmonoton effici calculi implement urgen steffen infer mechan theori applic ws ki stefan urgen teodor przymusinski super logic program urgen dix logic program paradigm stefan urgen burkhard ulrich zukowski comput model manfr kamp greql ein ur da peter urgen angelika manfr andrea winter und formal grundlagen peter da org thoma marx workflow model wfmc dieter obel schedul criteria ag constraint process hard system ulrich furbach disjunct logic program horn program control program andrea schmid solut count infin problem distanc vector rout ulrich michael frieder stolzenburg proof debug peter sch model elimin simplif applic softwar verif bernt andrea peter urgen ebert program system urgen jorg lobo logic program nonmonoton reason kurt carlo jan technischen anwendungen manfr kamp manag softwar repositori program tool gener approach peter baumgartn hyper tableaux gener jen agent architectur model ma social scienc marcel softwar global illumin research marcel de urgen bernt andrea cycl step jose urgen mauricio osorio confluent rewrit system logic program semant lutz note nondeterminist comput stephan system model lutz mauric finit test tube predict peter baumgartn der der ag jen thoma marx angelika franzk object orient system angelika franzk recommend improv urgen lui moniz teodor przymusinski logic program knowledg ilp lutz uniform approach interleav semant petri net ulrich furbach workshop model base autom reason urgen frieder stolzenburg framework incorpor reason constraint logic program carlo thoma marx petri net tool andrea winter doctor consortium advanc inform system june urgen roger omt metamodel stefan urgen teodor przymusinski super logic program urgen mauricio osorio semant suitabl aggreg peter baumgartn ration effici algorithm view delet wolfgang dieter obel integr fix prioriti static schedul maintain extern consist urgen alexand oper semant visual notat thoma marx april der urgen manfr andrea winter gener system support understand heterogen softwar roger urgen ebert booch metamodel urgen lui teodor przymusinski logic program reason angelika franzk gral refer manual ulrich furbach view autom reason artifici intellig urgen ilkka niemel research project disjunct logic program
ML/1131 6 hierarch reinforc learn depart comput scienc michigan state east mi sridhar mahadevan depart comput scienc michigan state east mi depart comput scienc michigan state east mi abstract paper investig hierarch reinforc learn speed acquisit cooper task extend maxq framework case agent maxq hierarchi task learn agent learn interrel perform order coordin agent coordin skill agent learn joint action highest hierarchi node highest hierarchi con gure repres joint space multipl agent agent agent level unawar lower level action hierarch approach agent learn coordin faster share inform level attempt learn coordin account primit joint valu appli hierarch reinforc learn algorithm complex schedul task compar perform speed learn includ singl agent sel sh multipl agent maxq agent act independ commun heurist rst rst queue station compar tradeo learn speed perform model joint action valu multipl level maxq hierarchi introduct send team robot carri reconnaiss indoor environ check intrud agil ca permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee canada copyright acm problem natur view task ectiv strategi requir coordin individu robot natur decomposit task assign di erent part di erent robot interest learn algorithm cooper multiag agent learn coordin skill trial error main point paper simpli coordin skill learn ecient robot hierarch task structur robot learn primit action robot instanc learn coordin knowledg util search search adopt framework reinforc singl agent multiag domain reinforc learn recogn number paramet learn dramat number agent agent carri action environ address aspect learn paper approach success past agent learn polici mode interact prior work reinforc learn work competit model cooper model littman hu wellman studi framework markov game competit learn primarili interest cooper case work cooper learn separ base extent agent commun hand studi tan extend qlearn learn joint valu approach requir commun state action step hand approach crite barto agent share common state descript global reinforc model joint action studi multiag learn model joint state action balch matar robot maintain posit format depend locat commun state action agent work reduc paramet qlearn learn action valu set deriv featur stone veloso deriv featur encod construct learn algorithm approach di er kei explicit task structur speed cooper reinforc learn hierarch method constitut gener framework scale reinforc learn larg domain task structur restrict space polici altern framework hierarch reinforc learn includ option ham maxq assum agent initi hierarch decomposit task adopt maxq hierarch learn distribut agent local view state space agent learn joint abstract commun subtask task long time commun fairli infrequ signi advantag advantag hierarchi learn make learn skill level abstract action agent learn joint action valu highest abstract framework skill agent low level detail agent local state ignor agent locat base idea agent rough idea state agent high level action perform agent track inform greatli simpli es underli reinforc learn problem bene ts potenti accru type hierarch learn paper describ result maxq framework reason decid adopt maxq framework basi algorithm fact maxq method store function distribut node subtask graph function propag upward lower level node high level node evalu propag enabl agent simultan learn subtask high level task agent learn coordin skill individu low level task subtask gener maxq framework make applic learn broad class optim view dynam system termin predic maxq rede ned care fact complet subtask depend occurr event state environ extend maxq framework mdp discuss extens paper maxq framework reinforc learn algorithm introduc paper extens maxq method singl agent hierarch learn approach involv graph store distribut function task rst subtask desir level task graph construct illustr idea simpl search task shown figur case robot assign task pick trash trash extend area accumul central trash recycl task agent work oc connect type environ shown gure repres agent gure note agent learn skill navig perform putdown action agent learn order subtask instanc collect trash head agent learn coordin agent pick trash servic strength maxq framework extend serv substrat learn type skill corridor dump locat trash locat trash final destin locat deposit trash figur robot trash collect task trash collect task subtask result task graph shown gure task graph convert maxq shown gure maxq graph type max node node repres di erent action parent note maxq learn share subtask navig task nav common parent task navig navig put pick root navig follow wall align wall find wall navig figur task graph trash collect task root max node node pick put put nav follow align find follow find locat trash locat trash locat dump pick align figur maxq graph trash collect task learn scenario investig paper illustr imagin robot start learn task maxq graph structur distinguish learn approach sel sh robot learn maxq make attempt commun cooper maxq structur ed node immedi root task includ joint action robot robot learn joint navig trash robot navig dump ut action show complex domain cooper agent result superior learn perform sel sh case agent task hierarchi maxq method mdp set subtask subtask tupl de ned termin predic partit state space set activ state set termin state polici subtask execut current state set action perform achiev subtask action primit action set primit action subtask pseudo reward speci es transit state termin state desir termin state subtask primit action primit subtask maxq termin immedi function uniformli project function execut hierarch polici start state root hierarchi complet function expect cumul discount reward complet subtask invok subroutin subtask ma state function task state calcul subtask independ parent complet depend parent task composit primit action subtask state context parent task valu valu learn standard erenc learn base sampl trajectori import point note subtask tempor extend updat rule base process model assum agent state task subtask execut subtask termin step result state qlearn rule updat complet function hierarch polici set polici subtask project function hierarch denot execut hierarch polici start state start root task hierarchi optim polici mdp maxq decomposit hierarch polici subtask polici optim de ned set state set action state transit probabl function reward function sum origin reward function function maxq learn algorithm proven converg uniqu optim polici mdp maxq graph discount nite horizon mdp discount factor maxq graph de ned subtask maxq algorithm maxq decomposit reli kei reward function parent task function child task equat show idea extend valu salient featur extend maxq top level immedi lower hierarchi con gure store complet function valu joint action agent complet function de ned expect discount reward complet subtask agent context agent perform subtask decomposit equat calcul project function form agent max highest lower highest joint action valu action perform agent compar decomposit equat equat maxq hierarchi highest level equat sucient good approxim true trash collect subtask immedi root good good perform reduc number joint state action valu learn illustr maxq trash collect set joint highest level maxq function decomposit repres task context root task note subtask complet cost remaind task multiag maxq decomposit embodi heurist subtask independ algorithm learn valu agent start root task subtask till primit action primit action reward leaf valu updat subtask valu updat state visit execut subtask task level root task valu updat maxq learn algorithm schedul task autom guid vehicl exibl manufactur system materi handl typic pick part drop locat process locat correspond workstat storag locat load point workstat wait pick point process locat pickup point machin workstat output bu er fm system face problem optim schedul path move request occur part nish workstat vehicl vehicl servic request select vehicl multipl move request made request servic vehicl schedul obei set constraint ect tempor relationship activ capac limit set share resourc uncertain chang natur manufactur environ make virtual imposs plan move ahead time schedul requir dynam dispatch depend state system number part bu state process workstat system perform gener measur term onlin travel time ow throughput import factor throughput measur term number nish assembl deposit unload part load machin drop station pick station assembl figur multipl automat guid vehicl optim task agent carri raw materi nish part machin unload deck unit time problem analyt heurist combin gener schedul heurist perform poorli constraint movement reduc tadep studi schedul task reinforc learn task studi complex figur show layout system part type carri drop station workstat assembl part brought back travel unidirect arrow termin predic rede ned care fact complet task depend occurr event state environ subtask problem figur state system begin subtask system dynam part continu arriv machin start end work part random interv action number agent ect environ kind discret event model make termin subtask de ned term event subtask termin event subtask trigger robot perform subtask termin materi drop station machin event occur state abstract state environ consist number part pickup station station part type agent track locat state part state space root load put nav load put forward left left forward navig station navig load deck deliv assembl station max node node deliv materi station figur maxq graph schedul task size state space part bu state carri valu part enorm maxq state abstract reduc state space relev state variabl store complet function node task graph navig locat state variabl subtask learn valu highest level relev state variabl lower level state action largest state space navig valu state abstract compact repres speed algorithm result rst describ experi simpl trash collect turn complex task trash collect task rst provid detail implement trash collect task singl agent robot start middl room learn task pick trash deposit dump goal state reach trash deposit dump state space orient robot compon base percept assum ring sonar enabl robot wall perpendicular side wall wall door side corridor wall open area middl room divid corridor state locat robot trash object trash basket carri trash object trash basket carri dump total number environ state singl agent case case trash carri robot size state space grow environ fulli observ state direct robot combin percept includ room agent uniqu locat primit action consid behavior wall align wall left follow enter exit align south north move corridor trash collect examin learn polici figur reveal robot nice learn achiev order coordin agent figur con number step trash collect task greatli reduc agent coordin compar singl agent attempt carri task learn polici agent root navig trash locat trash room pick trash navig bin exit room enter room locat dump room put trash dump end learn polici agent root navig trash locat trash room pick trash navig bin exit room enter room locat dump room put trash dump end figur gure show polici learn cooper maxq algorithm trash collect task domain present detail result schedul compar learn number trial averag run agent perform task singl agent perform task figur number action complet trash collect task time start simul maxq selfish maxq singl agent maxq figur gure show cooper maxq approach outperform sel sh maxq approach travel time compar assembl time ing singl agent sel sh multipl agent maxq agent act independ learn optim maxq approach agent result gener model paramet time part uniformli distribut sec varianc sec percentag part arriv process time requir assembl part distribut mean sec varianc sec experi conduct ve time result averag figur show throughput system type approach figur agent learn faster initi sel sh graph show algorithm result perform due fact throughput system time start simul multipl agent multipl selfish agent figur gure compar cooper maxq approach sel sh maxq travel time time averag assembl time throughput system time start simul flat learner figur learn domain extrem show hierarch task structur agent select rst agent complet agent wait long time complet due constraint number part store place system throughput achiev cooper maxq method signi cantli higher singl agent sel sh case di erenc signi gure agent longer travel cost make mistak greater figur show result implement singl agent bu er capac station set plot algorithm converg extrem slowli throughput sec compar hierarch singl agent case figur compar cooper maxq algorithm schedul show improv perform reinforc learn method time start simul maxq serv heurist highest queue heurist nearest station heurist figur plot show maxq outperform wide heurist schedul time start simul top level hierarchi top level hierarchi figur plot compar perform maxq algorithm joint action top level joint action top level figur show top level hierarchi con gure repres joint learn slower number paramet signi perform lack improv due part fact layer maxq hierarchi concern navig ad joint action improv navig coordin environ turn ad joint action multipl layer converg due task perform futur work approach scale reinforc learn extend maxq hierarch reinforc learn method joint action valu decomposit reli kei parent task factor subtask independ joint action complet cost depend joint action ectiv decomposit appar task agent rare interact carri cooper task robot servic larg build rare exit door interact model abstract coordin skill learn rapidli approach easili adapt constrain environ agent constantli run robot small room leav room joint level hierarchi result larger set action valu learn slower present detail result complex schedul show hierarch cooper maxq approach perform singl agent sel sh maxq method approach util hierarchi learn skill show approach appli complex domain primarili explor maxq hierarch framework hierarch method adapt speed learn success approach depend provid good initi hierarchi acknowledg work support advanc research project darpa contact refer model analysi manufactur system john wilei balch arkin format control team ieee transact robot crite barto elev group control multipl reinforc learn agent machin dietterich hierarch reinforc learn maxq function decomposit journal arti cial intellig volum page hu wellman multiag reinforc theoret framework algorithm fifteenth intern confer machin page klein kim dispatch intern journal product lee composit dispatch rule system littman markov game framework reinforc learn eleventh intern confer machin page matar reinforc learn domain autonom parr hierarch control learn markov process phd markov process wilei stone veloso reinforc learn intern confer autonom page sugawara lesser learn improv coordin action cooper distribut environ machin sutton barto introduct reinforc learn mit singh mdp framework tempor abstract reinforc learn arti cial tadep scale averag reward reinforc learn approxim domain model function intern machin learn tan reinforc independ cooper agent tenth intern confer machin page wang mahadevan hierarch optim process sixteenth intern confer machin weiss multiag modern approach distribut arti cial intellig mit
DB/1132 3 ieee intern confer data san march gener isol level definit barbara liskov patrick oneil microsoft microsoft wa laboratori comput massachusett inst ma univ ma abstract commerci support isol level programm trade consist potenti gain perform isol level defin current ansi definit ambigu definit correct problem constrain pessimist implement paper present specif ansi level specif appli lock optimist concurr control scheme unlik earlier specif handl predic correct flexibl manner level introduct paper definit isol level unlik previou definit correct rule bad specif wide rang concurr control includ optimist techniqu mechan meet goal isol standard concept isol level introduc consist goal work provid improv concurr workload sacrif perfect isol work research liskov support part arpa depart contract monitor fort armi intellig nsf grant research mit research oneil support nsf grant refin suggest set stage definit isol level goal develop standard subsequ paper show definit provid ambigu paper definit avoid ambigu state definit simpli version disallow optimist mechan definit fail meet goal respect standard intend lack definit meet goal import flexibl lead perform optim outperform lock larg distribut system optimist mechan scheme choic mobil gemston oracl provid serializ snapshot optimist implement undesir ansi standard rule implement gemston serializ meet rule paper present specif correct problem exist definit definit cover weaker isol level everydai vendor programm advantag level serializ level achiev read commit default product vendor recommend level serializ high perform desir definit enabl vendor develop innov implement level wide varieti concurr control mechan includ optimist mechan specif handl oper correctli isol level paper make ffl specifi exist ansi isol level manner definit correct rule bad complet good provid difficult prove complet lower isol easili show definit permiss ffl specif handl predic correctli flexibl earlier definit incomplet approach defin addit level includ commerci level cursor stabil oracl snapshot isol read consist develop addit isol level call weakest level consist read causal consist respect transact detail found definit combin constraint transact histori type cycl serial graph isol level graph similar serializ correct criterion defin extend transact model approach appli techniqu defin ansi commerci isol level specif theori present work describ condit serializ commerci isol level system unlik definit predic account work substanti definit present specif handl optimist system deal predic correct flexibl manner isol level relax correct condit base semant extend transact model suggest past work exist ansi commerci isol level larg number applic programm rest paper organ section discuss prior work detail section show current definit inadequ motiv work section describ model section definit exist ansi isol level close section discuss accomplish previou work origin isol level introduc serializ concern lock consequ definit refin level provid date form basi isol level definit ansi standard goal definit constrain earlier approach type bad behavior call restrict consist level disallow phenomena serializ permit phenomenon isol level read read level intend correspond work analyz standard demonstr problem isol level phenomena miss provid definit isol level defin disallow phenomena phenomena miss requir transact write object uncommit transact modifi simpli lock requir acquir long lock held transact lock immedi transact complet read write trigger lock requir acquir long acquir requir long read write lock phenomenon deal queri base predic requir transact modifi predic delet row modif result queri execut uncommit transact base predic avoid acquir long phantom predic definit histori occur system lock lock serial transact prevent situat concurr transact lock isol level phenomena read lock data item phantom write lock data item phantom short write lock lock read uncommit long write lock lock read commit short read lock long write lock lock repeat read long read short phantom read lock long write lock lock serializ long read lock long write lock figur consist level lock isol level modifi refer approach prevent approach figur summar isol level defin relat implement read uncommit level read mit repeat read level serializ restrict prevent approach show prevent approach overli restrict rule optimist implement approach disallow histori occur lock scheme prevent conflict oper execut concurr author ensur constraint constraint observ violat transact request isol level serializ show histori interpret ansi standard serializ isol observ inconsist state observ invari histori prevent rule rule optimist mechan provid serializ disallow histori legal histori permit prevent approach disallow implement rule histori occur practic implement occur optimist implement uncommit transact modifi local copi object forc abort serializ provid disallow rule optimist implement condit preclud transact read updat uncommit transact read disallow optimist desir mobil commit long time client disconnect server read uncommit transact desir high traffic histori read valu serial histori occur mobil disallow commit assum happen client machin transact observ modif tent transact client reconnect work check determin consist violat relev transact abort dirti read cascad abort histori abort problem allevi action phenomenon disallow modif object read uncommit transact rule similar situat respect uncommit transact object concurr optimist implement harm transact commit order histori read valu transact serial order real problem prevent approach phenomena express term histori properti interest multiobject constraint avoid problem phenomena restrict individu object approach avoid difficulti specif captur constraint multipl object directli definit prevent approach applic system term object term version specif deal histori approach scheme provid run commit transact implement optimist mechan provid weak transact run provid strong serializ commit transact definit isol commit run present commit transact model transact histori describ transact serial graph model similar present unlik model incorpor predic predic behavior base system model consist object read written relat row tupl object transact read write object total order oper occur object version transact interact term system map oper object specif version object transact read version creat abort constraint isol level prevent type read version creat abort transact transact write object creat version transact modifi object multipl modif object denot version denot final modif perform commit abort transact commit execut success commit abort oper transact commit state reflect modif commit transact transact version creat part commit state instal system determin order rel commit version part commit state initi commit state exist result run special initi init transact init creat object exist object initi init call version applic transact creat object insert tupl model creation visibl version transact load creat initi visibl version object insert transact delet object delet tupl model creation special dead dead version object version kind order relationship version discuss section object delet commit state insert incarn distinct object transact perform insert system select uniqu object select insert creat visibl version commit assum object version exist forev commit state simplifi handl insert simpli treat write oper implement maintain visibl version implement maintain visibl version time applic transact real system access visibl version transact histori captur execut system histori histori set transact consist part partial order event reflect oper version total order commit version object event histori correspond oper abort write oper object transact denot written transact read version creat denot notat partial order event histori obei ffl preserv order event transact includ commit abort event ffl event exist transact read version object produc note version read necessarili recent instal version commit uncommit occur ffl event interven event condit ensur transact modifi object read observ updat ffl histori read write event mention transact commit abort event histori complet complet append abort event uncommit transact ad event intuit correct implement commit transact read uncommit transact legal abort present event histori exampl total order left consist partial order part histori version specifi total order version object creat commit transact order version due uncommit abort transact refer version due commit transact commit version constraint histori version order kind commit ffl version order object initi init commit dead dead ffl init xs version version order dead version commit visibl version init dead constrain system read visibl ffl occur visibl version show version order visibl version case dead version illustr show version version order histori order write commit event flexibl optimist implement version version version order instal commit state version instal histori system chosen version order commit note constraint version correspond uncommit abort note transact commit histori serial predic discuss predic handl model assum predic relat relat system type modif oper insert insert delet chang number tupl relat divid relat tupl exist relat dead version exist tupl tupl insert delet import point note tupl relat model initi init tupl insert applic transact assumpt conceptu level system relat tupl creat tupl xs relat insert predic identifi boolean condit sql relat condit relat tupl match condit read modifi depend read write consid definit version set oper transact execut read write base predic system select version tupl ps relat set select version call version set oper denot version set defin state observ evalu predic discuss ps boolean condit appli version determin tupl satisfi select version tupl ps set larg includ possibl dead version exampl show visibl version version explain show dead version approach observ version tupl handl phantom problem simpl manner constrain implement perform index read transact perform read base predic sql system access version system determin tupl match predic evalu ps boolean condit version tupl dead version select previou step match system read match version part read show separ event histori queri base predic repres histori version match read version read match event show simpli count tupl match transact execut sql select dept queri access version visibl tupl relat version tupl relat init version match predic recal version init match predic read shown histori show dead version version set note read show separ event determin number tupl match predic select event histori show read version observ modif modif base predic model read write oper tupl match approach weaker model behavior commerci transact execut code discuss updat sal sal system select init oper match predic init event ad write delet dead version instal match tupl tupl transact delet sale depart event ad note event delet updat similar delet dead version illustr shown put updat insert handl similar manner statement copi commiss exce salari bonu tabl statement execut transact insert bonu select comm emp comm histori execut match read gener tupl insert bonu tabl conflict serial graph defin type conflict occur system serial graph defin kind direct conflict captur conflict commit transact object intersect predic separ definit conflict regular conflict read depend read depend occur transact read relev version produc transact definit definit chang match read transact match read instal immedi version match match read definit identifi transact chang occur match set definit directli directli transact directli directli directli directli instal object version read directli transact directli perform oper match perform read read depend perform write transact chang match read note tupl version set read consid includ tupl match predic version read transact show normal read event version version set essenti ghost valu observ read establish rule captur idea matter predic set tupl match match valu transact tupl match latest transact chang occur latest transact instal version rule ensur captur minimum conflict read transact insert object sale xs depart phone number depart transact select sale depart version set add updat irrelev read note histori serializ order occur transact overwrit version observ transact defin defin mean overwrit oper definit overwrit read transact overwrit oper instal match defin definit directli transact directli transact directli directli directli directli transact read object version instal xs version version order note transact wrote version directli transact read earlier version directli directli overwrit oper instal version object match read perform treat similarli add edg predic match set chang differ similar overwrit transact produc version read simpli produc version match tupl predic definit handl insert delet scenario section visibl version tupl execut queri select sale queri version set version version sale transact directli add sale move remov delet lock implement provid transact perform read base predic insert object cover ps predic delai till finish read init creat version match note predic delai chang object match definit flexibl permit implement proce lock granular lock write depend write depend occur transact overwrit version written transact definit directli transact directli instal version instal xs version version order note notion modif model queri write individu tupl serial graph defin direct serial graph graph call base direct conflict discuss graph denot direct wr direct ww direct rw figur summar notat review definit direct depend conflict descript conflict notat directli instal instal xs version ww directli instal read perform match earlier version read wr directli read xh instal xs version perform read overwrit read rw figur definit direct conflict transact definit direct serial graph defin direct serial graph histori denot node graph correspond commit transact direct edg correspond type direct conflict edg transact transact directli captur inform histori replac record inform commit transact histori histori condit serial figur show histori transact serializ order ww rw wr ww wr figur histori serial addit depend definit depend transact directli depend directli directli depend path consist depend edg gener isol specif present specif exist ansi isol level develop condit studi motiv origin definit problem address phenomena enabl develop specif captur essenc ansi disallow undesir situat histori permit varieti implement previou defin isol level term phenomena avoid level phenomena prefix denot fact gener lock optimist phenomena analog refer level pl level pl stand avoid isol isol level disallow phenomenon ensur write perform overwritten uncommit reason simplifi recoveri abort absenc system write happen place recov abort transact simpl undo log approach updat overwrit abort system restor abort restor serial transact base write updat object overwrit object write order write reason relev system base implement implement thor system maintain temporari version object uncommit transact discard version abort serial transact base write properti ensur updat conflict transact interleav properti captur phenomenon defin level write cycl histori exhibit phenomenon direct cycl consist edg histori disallow updat occur opposit cycl graph figur show histori ww ww figur histori specif permiss concurr transact modifi object interleav write oper uncommit transact long interleav disallow commit transact abort implement disallow concurr modifi write follow write note modif model queri normal weak updat histori transact increment salari add sale depart init init init updat transact interleav histori salari updat ys salari interleav cycl edg isol level system disallow place constraint transact read modif made abort transact phenomenon meant ensur updat read uncommit reason disallow addit prevent transact commit read updat transact abort prevent transact read intermedi modif transact serial commit transact base transact depend depend disallow captur prevent transact read write object written transact uncommit address issu abort read histori show phenomenon abort transact commit transact read object modifi phenomenon repres histori ensur read abort call cascad abort real condit impli read uncommit transact commit delai commit intermedi read histori show phenomenon commit transact read version object written transact final modif histori fragment repres ensur transact commit read final version object creat transact note disallow ensur commit transact read object state exist instant commit state circular inform flow histori exhibit phenomenon direct cycl consist depend edg disallow ensur transact affect transact affect unidirect flow inform note includ defin weaker version concern cycl simpler phenomenon captur essenc defin isol level phenomenon disallow weaker read uncommit transact implement disallow combin long short ensur read version produc commit read version produc definit treat read normal read extra approach flexibl requir oper atom respect discuss isol level system transact read inconsist data make inconsist updat disallow phenomenon prevent situat present section prevent legal histori discuss section optimist concurr control scheme prevent transact perform inconsist read write commit accomplish cycl histori exhibit phenomenon direct cycl edg defin isol level cycl preclud level implement disallow lock provid complet serializ weaker transact modifi object uncommit transact read definit histori section disallow prevent definit condit specif shown theorem present realist implement provid condit provid consid serializ wr predic rw figur direct serial graph histori phantom isol level level call repeat read full serializ respect predic long lock oper predic read short ensur serializ respect regular read similar predic read cycl due predic occur level defin level item cycl histori exhibit phenomenon direct cycl edg sum init perform sale show visibl version sum salari compar maintain depart perform final insert sale updat commit read find inconsist phantom shown figur histori rule permit cycl predic edg consid mix isol level discuss system transact provid applic run transact level understand transact interact section discuss model mix system real sql statement transact execut atom level phenomena disallow inform descript commit write complet isol write transact read updat transact commit time commit complet isol transact respect data item read complet isol oper oper transact figur summari portabl ansi isol level execut lower isol level mix system individu sql statement execut atom discuss mix transact specifi level start inform maintain part histori construct mix serial graph msg msg node commit transact edg depend relev transact level obligatori depend show edg graph transact obligatori conflict transact run higher level conflict conflict relev level edg transact transact obligatori edg overwrit read matter level edg ad relev retain edg node read ad add outgo edg transact node defin correct mix definit histori acycl phenomena occur transact restat definit analog isol theorem mix histori transact provid pertain level theorem hold level histori independ synchron implement note provid level respect state impli transact observ consist state lower level transact modifi transact observ consist lower level transact updat consist observ inconsist state msg reason msg consid presenc transact level simpli construct edg msg determin correct transact ensur correct make assumpt oper lower level transact mix system implement lock standard combin short long implement techniqu optimist implement attempt fit commit transact serial order base requir oblig transact run higher abort transact optimist implement present discuss summar isol level discuss section figur level defin constraint transact constrain transact bad transact observ forc abort analog level constrain execut transact definit slightli node commit transact node execut transact paper present specif isol level unlik previou definit wide rang concurr control includ lock optim definit handl predic correct flexibl manner isol level meet goal standard paper behavior system mix user level transact system transact provid constraint transact run lower level approach applic level addit discuss paper develop specif commerci isol level snapshot isol cursor defin level call detail found weakest level consist read causal system broadcast environ definit implement independ make suitabl industri preclud clever implement exist todai develop futur provid implementor opportun perform concurr control mechan environ acknowledg chandra miguel andrew member program methodolog group comment grate dimitri elizabeth oneil carefulli read paper improv specif phil jim david comment refer weak gener theori optimist implement distribut transact phd mar effici optimist concurr control synchron clock san liskov lazi consist synchron clock proc acm principl dist santa aug singh consist correct criteria acm sept distribut optimist concurr control reduc rollback distribut ansi american nation standard inform system languag nov badrinath ramamritham concurr commut acm mar oneil critiqu ansi sql isol level proc san goodman concurr control recoveri system addison chrysanthi ramamritham synthesi extend transact model acta acm sept date introduct system shasha danger replic solut proc june granular lock consist share model data base manag system elsevi grai reuter transact concept techniqu morgan kaufmann publish gruber optim studi concurr control phd disconnect oper thor system ieee workshop mobil comp apolog versu optimist concurr control abstract data type acm march satyanarayanan disconnect oper coda file system proc acm symp oper sy pacif oct sudarshan system concept mcgraw kung robinson optimist method concurr control acm june safe effici share persist object thor proc june develop proc sept oneil transact method acm dec oracl corpor concurr transact isol serializ juli ramamritham effici concurr control broadcast environ june terri al manag updat conflict weakli connect replic storag system proc copper mountain dec
ML/1133 6 learn human arm movement evalu connectionist architectur aud billard maja matar comput scienc southern sal lo angel usa abstract paper concern evalu model human imit arm movement model consist hierarchi artifici neural abstract brain region involv control spinal primari cortex tempor cortex biomechan simul develop model muscl complet dynam freedom humanoid input model data human arm movement record video track system model perform evalu reproduc reach movement oscillatori movement arm result show high qualit quantit agreement human data model reproduc featur reach movement curv veloc hand trajectori model perform compar human perform imit task shown model reproduct compar human introduct goal robot robot part human everydai role caretak elderli assist surgeri machin pet toi children goal robot program interact wai natur effici current counterpart kei challeng make develop flexibl motor skill order give robot abil program interact easili assist human task challeng excit area current research concern develop robot assist human medic surgeri provid everydai task elderli disabl replac human industri task unsaf area wast manag provid robot sophist motor skill flexibl difficult requir import program high fine tune motor paramet sensor process altern provid robot learn adapt optim predefin motor control paramet challeng problem teach robot motor demonstr robot learn motor sequenc replic demonstr human instructor tune motor program descript successfulli achiev task method interest robot program interact human natur simpl mean make robot flexibl respect task taught facilit robot system robot work address imit assembl observ seri visual imag human perform simpl object task repeat industri robot arm effort constitut bodi research contribut video segment understand provid highli flexibl appli algorithm imit type movement task recent includ orient analyz underli mechan imit natur system model artifici build biolog plausibl model anim imit develop architectur control learn robot show flexibl natur system work complement investig connectionist base coupl complet biomechan simul humanoid follow neurosci studi primat motion recognit motor control work driven observ visual recognit movement egocentr frame refer neural mirror neuron encapsul link visual motor motor control learn hierarch modul primit motor program pattern locat primat spinal model hierarchi artifici neural network abstract neurolog structur underli primat brain pathwai spinal primari cortex tempor cortex model evalu pair humanoid avatar learn imit gestur complex movement involv avatar limb evalu model perform reproduc human arm movement biomechan simul develop model muscl complet dynam freedom humanoid aim experi evalu realism model dynam simul model human imit rest paper organ section describ detail visual process data learn algorithm section evalu model perform seri experi reproduc human arm reach movement oscillatori movement arm compar model perform human imit task section conclud paper short summari present work model develop highli simplifi model primat imit abil figur model biolog inspir composit modul function similar specif brain modul artifici neural architectur figur base neurolog find primat incorpor abstract model brain area involv tempor cortex spinal primari motor cortex area descript modul visual inform process tc recognit direct orient movement demonstr limb rel frame refer locat demonstr bodi tc modul input cartesian coordin joint demonstr limb frame refer origin fix rel visual track transform coordin set coordin rel egocentr frame refer assumpt exist cell egocentr frame refer tc support neurolog evid monkei human vision system incorpor simplifi attent mechan trigger chang posit posit previou time limb observ stage model simplic attent modul relat specif brain area attent mechan creat prevent inform flow pm learn movement chang limb posit observ section describ motion track system experi explain detail stage visual process tc modul motor control model hierarch lowest spinal cord primari neural circuit pattern gener made motor neuron section motor neuron simul activ muscl humanoid section modul monitor activ spinal network node distribut topograph map bodi previou implement model partial dynam simul dof humanoid calcul physic intern humanoid neuron common terminolog describ spinal cord neuron direct direct input muscl attent modul inhibit learn observ chang limb posit visual system learn system modul modul learn coordin spinal network movement reach grasp activ node learn tempor sequenc movement control movement learn inhibit observ imit motor control motor set node code activ network cpg walk stretch retract modul spinal cord sensori joint angl motor neuron command muscl frame ref transform visual data eccentr egocentr tc modul pm modul fig architectur consist modul give abstract brain area involv process modul attent tempor cortex primari motor cortex spinal cord cortex modul learn movement pm modul modul implement dynam recurr associ memori architectur learn time seri invari input section modul control transit observ reproduc motor inhibit pm neural activ due tc input flow motor implement set rule direct biolog inspir neuron pm modul respond visual inform motor command produc give abstract mirror neuron mirror neuron refer neuron locat part inferior area monkei shown fire monkei grasp object observ monkei human perform similar grasp describ detail learn part model visual segment data experi section record human motion set data record system system capabl select collect featur move base constrain initi posit kinemat model gener adult human detail track base imag frequenc hz system track upper bodi vertic bodi featur correspond stick figur figur calcul posit frame point locat lower neck head set human arm gather matar joint interdisciplinari project conduct nation institut health resourc studi neural model rochest subject watch imit short video arm speed orient spinal cord leg left elbow leg left elbow tc pm fig schemat neural structur modul interconnect fig motion track system human movement simul wear marker mechan record posit marker upper hand cartesian coordin input tempor cortex modul process stage data transfer frame refer rel demonstr calcul joint angl elbow shoulder filter appli calcul angular veloc joint stage correspond attent mechan figur elimin small arm movement experi small motion due locat point refer track coordin extrapol time step interact torqu movement limb result small motion rest bodi small movement recogn voluntari movement movement made interact shoulder elbow due length muscular appli filter paramet appli filter process depend set paramet dof threshold defin minimum displac joint detect minimum time delai displac greater observ consid stop motion noisi movement tabl show valu experi report section note dof record track system figur show result visual segment oscillatori movement arm larg movement segment tabl threshold visual filter dof left shoulder le left elbow minimum displac detect motion record minimum time delai displac greater observ experi le calcul direct movement limb rel limb attach rel shoulder shoulder rel direct movement posit neg depend limb move upward fourth tc modul activ seri cell code joint angl distribut cell freedom code posit neg direct output cell encod direct speed movement faster greater output excit cell cell pair activ time cell limb move decomposit limb motion easili map muscular structur dof limb direct pair muscl upward downward direct movement correspond activ visual modul perform level process transform frame filter small noisi movement term speed segment base veloc movement direct motor control spinal cord modul motor control hierarch lowest level motor control spinal cord modul primari neural circuit made motor neuron muscl muscl activ spinal circuit encod extend retract arm rhythmic movement leg arm involv biolog model walk neural circuit vertebr neuron spinal cord modul model comput averag fire frequenc membran potenti neuron govern dm repres neuron averag fire neuron time constant passiv properti neuron synapt weight connect neuron neuron motor cortex primari motor cortex modul motor map bodi brain area divid layer neuron activ distinct muscl pair figur network independ regul amplitud frequenc oscil similar oscil limb segment gener activ small time delai activ creat asymmetri motor neuron activ muscl contract motion singl muscl obtain activ amplitud frequenc node speed speed contract control output amplitud neuron motor neuron spinal cord amplitud movement case control durat neuron activ longer activ amplitud neuron subsequ motor longer durat muscl larger movement receiv sensori form joint angl spinal cord modul motor area receiv sensori feedback relat sensori area area receiv feedback joint posit shoulder modul amplitud speed smaller larger output node sensori feedback larger slower movement experi section modul reach movement movement sensori feedback minimum input amplitud node maximum arm reach half requir sensori feedback maximum input maximum arm stop shortli torqu produc muscl motor neuron section equat graviti cortex pm pm modul creat direct map observ movement visual motor control observ motion segment term direct durat movement delai veloc motion limb section speed direct movement limb cpg spinal control amplitud node project relev pm node transfer activ tc node specif activ pattern node command larg output activ tc cell lead import output pc node activ amplitud node durat movement proport durat activ amplitud node learn movement store sequenti activ amplitud time tc map node explain section modul execut movement motion section start activ node node encod sequenc muscl activ node pass node encod muscl specif step sequenc section node layer primari motor cortex activ node layer activ node spinal cord activ motor neuron simul muscl avatar learn modul time delai weight fig schemat connect unit unit connect drama network weight time paramet weight correspond synapt time paramet specifi synapt delai unit connect retriev rule weight learn motor sequenc updat connect primari cortex cortex modul pm modul consist dynam recurr associ memori architectur fulli recurr neural network hidden unit similarli time delai network connect weight ij time paramet ij figur weight correspond synapt time paramet specifi synapt delai time requir propag activ neuron paramet modul learn order repres spatial tempor regular input node paramet updat hebbian equat learn start weight time paramet set differ repres predefin connect section ji ji ji ji ji constant factor weight increment present learn consist build connect node modul repres pattern activ tc pm connect construct simultan repres isomorph visual motor neuron activ function linear order differenti equat equat ii ji ji ident function input valu satur input valu greater retriev function equat ji ji ji ji ji ji ij ji ji ij function threshold function output factor error margin time paramet equal ij record time delai unit term ij threshold weight equal max ji ij ij experi maxi ji maximum weight connect activ unit unit satisfi tempor condit encod ji unit network time paramet memori unit rate decai repres term dy ii obtain equat put term equat output unit network valu input unit node input pm pm node input activ sum activ provid network unit suffici pass threshold time repres function equat repres memori past full activ biomechan simul humanoid ad dynam graphic humanoid simul freedom avatar head dof elbow knee trunk made segment dof limb attach extern forc appli joint graviti balanc handl support ground contact model avoid modul angular link depend forc exert torqu due pair muscl forc due constraint mass moment inertia link posit vector joint compar center mass link dynam equat solv comput intern forc link forc due extern forc muscl forc due graviti damp due air user muscl torqu muscl simul combin spring damper torqu exert joint determin pair muscl muscl contract input signal motor spring reduc rest length torqu act joint determin activ differ actual angl joint default angl coeffici stiff damp coeffici muscl experi present seri experi measur perform model reproduc featur human arm movement reach model reproduc sequenc oscillatori arm movement compar model perform human perform imit arm movement model implement set human arm motion set record video track system consist oscillatori movement arm vertic plane shoulder bend set record system complet consist oscillatori movement left arm reach movement evalu model perform reproduc reach movement left arm data record system section model target trajectori desir angl dof shoulder input reproduct valu spinal cord modul model modul sensori feedback learn model predefin connect reach pc exploit gener motion test model reproduc main featur human arm veloc curv curvatur hand trajectori space figur show veloc hand path avatar hand reach movement direct point direct direct figur show valu trajectori human hand similar reach avatar human veloc profil biggest direct movement follow curv direct small movement result intern torqu movement veloc profil made small oscillatori movement avatar human similarli human avatar hand trajectori reach slope middl distanc fact reflect veloc slow veloc half distanc due smooth neural activ motor neuron motor neuron output directli proport elast constraint model equat sigmoid equat plateau veloc start due damp factor equat muscl properti input pm motor neuron receiv sensori feedback posit joint spinal cord modul indic half request distanc achiev fig human data avatar data graph trajectori veloc profil path hand direct reach movement direct point direct direct oscillatori arm movement section describ result motion set record video track consist lift lower left upper arm rotat bend extend lower arm motion repeat reproduct movement driven target joint angl previou section observ motion limb fed continu tc modul chang movement trigger tc cell encod orient speed pass pc modul learn sequenc movement end pc activ modul trigger learn sequenc figur show trajectori left shoulder elbow avatar human set motion black vertic line show instant movement visual segment trigger start end motion base veloc direct avatar reproduct show qualit quantit agreement human movement reproduc larg movement shoulder similar amplitud good reproduct amplitud movement obtain model good measur speed observ movement speed movement transmit amplitud output tc cell section record pm weight transmit motor neuron spinal amplitud pm node output chose speed record vari approxim human make similar measur discuss section comparison human imit perform data gather human imit arm evalu human reproduc arm movement figur show trajectori left hand human human demonstr avatar reproduct trajectori time step angl avatar human time step angl avatar human time step angl avatar human fig trajectori avatar human movement sequenc top time sec avatar fig trajectori hand motion human subject avatar imit oscillatori movement left demonstr human subject top human row imit human imit humanoid avatar imit human subject qualit similar correctli reproduc oscil direct subject produc movement direct amplitud time movement reproduc avatar reproduct good human measur imit qualit similar demonstr imit limb trajectori path coordin reach elbow joint angl obtain compar number maxima minima quantit similar trajectori term amplitud speed measur ratio maxima ratio time differ maxima durat straightforward measur observ dissimilar futur feedback tune learn improv reproduct direct measur amplitud differ indirect measur speed differ movement present measur similar trajectori reach task present discuss perform tabl qualit comparison human avatar imit perform ratio maxima amplitud ratio time differ maxima durat demonstr human avatar trajectori data valu standard deviat imit data set avatar human tabl show valu measur imit data set human imit avatar replic avatar human perform measur quantit similar show percent averag reproduc amplitud speed movement similar human avatar data long term goal studi design model human abil learn movement imit work focu develop measur trajectori similar determin influenc paramet model biomechan simul model perform paper present seri experi evalu perform connectionist model imit human arm movement model hierarchi artifici neural network give abstract function brain area involv motor control spinal primari cortex tempor cortex model implement biomechan simul humanoid avatar freedom data imit record human arm motion reach oscillatori movement valid model real simul complet biomechan simul import goal implement system real robot platform result show model reliabl reproduc data highli noisi measur good quantit agreement simul real base error measur amplitud speed movement measur error model reproduct rang error made human engag imit task result suggest connectionist coupl biomechan good approxim human imit futur work aim evalu model perform data compar perform model human motor acknowledg preciou comment project stefan weber provid data vision base motion track softwar robot institut dortmund provid simul work support part nation scienc career award matar part offic naval research aud billard support partli fellowship york refer human arm trajectori format ra hs dc xing multimod space posterior cortex plan movement review ak develop robot aid subject workshop robot motion page kuniyoshi learn robot imit intern confer intellig robot system page billard mean enhanc learn synthet autonom robot nehaniv imit anim mit billard learn motor skill biolog inspir robot model cybernet system special issu imit anim billard connectionist architectur control learn autonom robot adapt vol page vr de space robot ieee transact neural movement imit mechan robot human phd dept artifici kuniyoshi defer imit human head movement activ stereo vision head ieee intern workshop robot human page ieee sept di understand motor neurophysiolog studi brain de camera robot system ieee intern confer industri control hiroaki control hypothesi examin measur arm stiff movement goodman analysi kinemat invari reach movement biolog jj hopfield neuron grade properti collect comput properti neuron nation academi volum page washington skill acquisit human demonstr hidden markov model ieee intern confer robot page aj willshaw evolv swim control simul inspir neurobiolog adapt takashi assembl task recognit mechan contact ieee intern confer robot takashi peter mark wheeler assembl plan observ technic carnegi mellon univeristi robot institut annual research ishikawa suzuki develop human robot collabor system inspect patrol nuclear power plant ieee intern workshop robot human page michael kaiser transfer elementari skill interact adapt inou action acquisit framework humanoid robot base kinemat dynam adapt ieee intern confer robot volum page gf model learn human reach movement biolog issu dm futur robot home factori intern symposium humanoid page mark role posterior cortex visual guid reach movement human brain issu mi kuniyoshi inou learn extract reusabl task knowledg visual observ human perform ieee transact robot page jf simul studi control postur movement limb biolog ma lewi ga bekei autom robot prospect problem chapter page pa learn topolog adapt neural network world congress neural volum page research directli programm surgic robot engin medicin biologi bridg disciplin annual intern confer matar primit basi link percept action biologi robot nehaniv imit anim artifact mit mj matar marc fixat behavior observ imit human movement cognit brain spatial control arm movement brain cerebr cortex clinic studi function aj aj jk je ortega framework analysi neural anim object action journal aj aj stage classif bodi movement visual neuron hb al imag page cambridg marc maja matar evalu metric result human arm movement imit submit sep cortex recognit motor action cognit brain method industri robot calibr ieee intern confer robot freund project virtual bridg gap virtual realiti robot ieee transact robot special section virtual realiti robot june schaal learn demonstr advanc neural inform process schaal programm pattern gener intern comput intellig page research triangl scott hand joint path reach movement vision biolog issu ai dg stuart network motor behavior bradford mit thrun neural network learn learn approach kluwer le system comput egocentr spatial frame refer human brain stefan weber simpl human torso track video technic report southern institut robot intellig song lee kim intellig robot system disabl elderli annual intern confer engin medicin biologi
ML/1134 6 join price parallel social dynam price algorithm applic internet price dube manjunath project school technolog comput scienc electr engin rout de bp tata institut fundament research indian institut sophia antipoli cedex franc road india india system ident parallel queue serv singl server distinguish price charg entri poisson stream custom join queue greedi polici minim combin price congest special case linear analyz shown individu optim greedi queue join polici social optim queue markov theoret framework formul dynam price gener case queue system applic price internet servic introduct tradit price model internet servic fairli simpl flat rate connect time charg retail user flat rate depend interconnect bandwidth bulk user price model account traffic volum distanc travel traffic telephon network provid differenti grade servic term delai packet drop recogn tradit price structur internet econom sustain volum varieti traffic internet grow rate issu price increasingli import econom price provid simpl mechan traffic control system complex amen analyt tool tradit control theori rapidli bodi literatur price internet true internet traffic process amen sophist price model categori charg congest qualiti develop price structur access charg effort develop mechan usag base bill currenc al discuss pro con usag base bill ip network review commerci usag base bill product larg bodi literatur congest charg kelli consid congest price model user share rate depend price pai share depend maxim util function paper model price qualiti price multiclass servic system model ietf price scheme compat differenti servic basic idea divid bandwidth multipl class traffic static dynam manner node network maintain separ logic queue class outgo link servic rule bandwidth share polici simplest provid multiclass servic tradit prioriti queue model lower class queue serv queue higher class empti preemptiv preemptiv servic obviou disadvantag lower prioriti queue extend period time altern prioriti model friendli lower prioriti custom call pari metro price scheme scheme network logic partit static manner partit alloc fix share network resourc access price class differenti price specif case equal resourc multipl class similar pari metro till recent class similar model call price scheme excel overview bibliographi internet price issu model found aim simpl scheme appeal simplic implement provid theoret justif claim origin fashion queue manag scheme practic major center india suffic oper effici leav casual visitor greatli impress background dub discuss scheme refer queue system easi discuss includ case feedforward network contribut paper analyz social optim price model user behaviour price model similar system ident parallel queue ieee shortest join polici individu social optim show differ social cost optim price system system constant ɛ defin possibl contribut paper dynam price dynam program equat reinforc learn base onlin price algorithm paper organ section describ gener queue price model special analyt amen model singl class custom section iii analyz simplifi model extens point section iv introduc dynam price problem gener framework section introduc learn algorithm dynam price section vi simul result perform conclud section vii ii price model simplest formul scheme singl server serv queue total servic rate servic rate equal share empti queue queue join price pk arriv form poisson process rate λ custom belong distinct type arriv custom independ custom custom inform queue length price queue join queue offer defin tie resolv random queue serv round robin fashion fcf disciplin queue scheme similar spirit multiclass price scheme pari metro scheme price scheme differ easi scheme defin work conserv pari metro price model capac server partit class scheme congest level term queue length queue post enabl custom calcul scheme explicitli involv model custom behaviour base calcul post price congest level note retain spirit internet simpl implement flat price model similar extens queue system internet fairli straightforward continu discuss queue system analysi base markov theori earlier work spirit model analysi analysi make simplif gener model replac singl queue parallel queue effect servic rate µ ignor fact queue extra servic made evenli distribut remain queue round simplifi pictur opt simplif simplifi analysi heavi traffic situat interest empti queue suffici rare small error make comment end section custom type arriv time number custom queue queue length vector denot queue vector queue custom map ψ argument admit constant prescrib type custom join queue queue strictli greater true custom leav join simpli finit queue finit buffer bi custom time custom join queue minim bj call minimum cost short polici optim custom custom individu optim note mechan custom induc reflect sensit system induc reflect implicit priorit special case singl qi notat denot assum pi integ custom join queue strictli exce pi queue case amen provid section aim evalu perform comparison queue join polici gener class polici repres process valu zn index queue join arriv zn set equal custom call queue join polici markov zn suitabl map arriv instant custom note discuss shortest markov polici polici queue join price analyz literatur remark singl class offer differenti servic make flexibl optim revenu loss custom argu simpl monoton wait time singl queue lead queue join process introduc social ieee defin lim social cost essenti averag custom limit case markov polici zn markov chain uniqu stationari distribut arriv time equal expect respect stationari distribut reduc denot success event time arriv potenti departur time potenti departur true departur queue question problem control markov process minim social cost standard markov theoret result suffic markov polici main prove heavi traffic optim iii analysi linear case analysi base comparison process call denot dynam origin valu departur empti queue queue length long drop neg price ˆ ˆ ˆ defin ˆ ˆ legal queue length process polici correspond polici ˆ ˆ denot respect state space ˆ defin lim ds lim ds lemma minim minim ˆ relationship queue ˆ claim suffic prove prove part appendix adapt argument section corollari minim social cost standard markov suffic minim markov polici relationship ˆ suffic show minim ˆ markov expect wrt stationari distribut recal zn index queue custom join markov relat hold stationari λ µ term wait time claim lemma compar social cost real queue compar stationari distribut common markov polici heavi traffic condit refer heavi traffic exist markov stationari probabl event ɛ requir λ smaller µ lemma heavi traffic exist constant markov social cost real queue differ fix markov polici fact transit probabl state note addit state transient probabl stationari distribut ˆ denot transit probabl matric respect stationari written column vector denot vector ee ˆ ee π ˆ ee ˆ suitabl fact ˆ differ row state queue empti ˆ row row claim corollari minimum social cost differ ɛ theorem social cost optimum combin corollari lemma corollari result state optim heavi traffic condit simplifi version price model ieee conclud section point extens approxim made begin pass round robin nonempti queue parallel introduc error shown line similar fact extend case servic split nonempti queue round robin fashion argument appendix extend share relev virtual circuit switch network queue model correspond virtual path custom correspond virtual circuit link bandwidth divid vp bandwidth vc bandwidth vp evenli divid vc vp analysi depend arriv departur remain choic remain remark interest extend theorem multiclass case case multiclass threshold class social optim extend case multiclass custom prove line proof theorem iv dynam price dynam price refer case adjust price vector time maxim revenu reason assum custom follow individu optim fix behaviour price polici point view system markov detail gener introduc begin singl linear case standard markov theoret argument show discret time markov chain control process dynam adjust price pi price join queue nth event time event time potenti departur queue µ probabl real departur queue nonempti probabl arriv type join queue minim queue block assum pm compact system aim maxim expect revenu lim price paid arriv event time arriv instant zn valu process price vector event observ irreduc markov chain stationari polici standard markov problem dynam program equat ek denot unit vector coordin direct dynam program equat max λ λ µ rm bk pk µ γ optim revenu equat γ uniqu addit constant minim zn optim price polici optim polici comput standard method polici iter linear program case transit probabl emploi approxim method base reinforc import transit probabl depend arriv process servic function approxim section present algorithm solv dynam program equat algorithm belong class algorithm note onlin adapt offlin learn base simul accumul statist type algorithm state space mdp finit finit action space set valu price vector denot probabl state current state current action price stationari polici map µ assign state probabl distribut action space set random stationari polici θ rn parametr term vector θ pair denot probabl action state polici θ assumpt assumpt θ rn averag cost function γ rn expect wrt stationari probabl markov chain pair ieee aim find maxim θ end emploi algorithm deal emploi exponenti approxim featur actor paramet vector job critic comput approxim actor updat polici approxim gradient direct establish requir comput critic project quantiti subspac span valu function θ ln defin emploi linearli approxim architectur project qr θ φ θ rm denot paramet vector critic φ θ critic featur vector technic algorithm present updat step actor critic place singl sampl path simul control markov scalar estim averag revenu ˆ elig trace kth ˆ paramet paramet vector actor ˆ obtain action ˆ pk appli action ˆ gener critic ˆ ˆ ˆ rk ˆ dk ˆ ˆ ˆ ˆ ˆ rk ˆ ˆ ˆ ˆ ˆ ˆ ˆ fix state ak posit paramet actor ˆ ˆ ˆ ˆ scalar control ak actor step size bk ak satisfi bk ak ak bk function assum satisfi inequ posit constant vi simul result show preliminari simul result simpl queue system singl class custom linear extens simul includ nonlinear case arriv process assum poisson rate λ server exponenti servic time rate µ µ queue initi queue length initi price vector actor featur xi pi pi xi critic featur φ θ ak bk critic actor weight estim averag revenu plot fig fig plot valu note converg typic reinforc learn tune adapt control learn speed prior knowledg free vii round robin servic parallel queue singl server differenti join price call price directli applic provis differenti qualiti internet servic provid shown singl class custom linear function system social optim argu linear reason assumpt gener model congest post virtual circuit connect long live flow internet congest inform number activ flow case bandwidth arriv connect reduc direct proport number activ connect system flow short live throughput ieee critic iter fig valu critic featur number updat actor iter fig valu actor featur number updat directli affect loss probabl reason buffer manag determin number packet queue congest inform case number packet queue dynam price algorithm present fairli gener multiclass custom gener function futur work involv detail studi perform algorithm multiclass custom environ function threshold appendix prove lemma custom arriv time find queue block estim averag iter fig estim averag revenu number iter estim averag iter fig estim averag revenu number iter threshold join minimum length unblock queue show minim averag total queue length lim proof close mimic argument section import differ fill subtl detail gloss analysi partial order random variabl xi fine ieee permut arrang order nonneg random variabl exist random variabl common probabl space law prove pp lemma impli realiz denot common probabl space arriv departur instant initi condit ident obei govern polici assum potenti departur largest queue point affect joint distribut individu law show turn impli claim view lemma prove assum prove case case departur system departur rank queue make queue move rank place place impli queue rank equal length rank equal length suffic equal wehav denot rank queue contradict repeat show inequ rank queue move place equal prove equal fact contradict case departur system case time tn departur rank queue rank queue easi case departur rank queue move rank case lead contradict hold case arriv block queue block arriv tn join rank queue rank queue easi case arriv block arriv tn easi matter case queue block arriv custom process arriv custom join rank move rank queue equal length queue strictli higher length loss assum arriv join set queue ident rank highest rank chang arriv custom join queue queue similarli replac ieee case argu case conclud repeat replac case case jr queue rank rank order order block contradict fact hold case custom join queue easi custom permut queue block time contradict refer bertseka algorithm markov process averag siam control braun approach qualiti servic van high perform pp architectur differenti ietf rfc dec program optim vol athena scientif price network tran vol pp apr causal analysi bill ip optim join shortest queue ieee transact submit siam journal control feb overview price concept broadband ip ieee commun sept pp rate control elast european transact vol pp learn algorithm markov siam control optim pp folei shortest stabil exact submit annal appli metro price proc acm conf electron pp markov john introduct queue prentic englewood high perform commun morgan optim markov reward ieee tran automat control pp ieee
IR/1135 5 detect heterogen multipl text environ meng clement liu dept comput scienc dept eec suni binghamton illinoi chicago ny il abstract number text retriev system grow rapidli world wide build search broker top task build effect effici metasearch engin hinder heterogen underli local search engin analyz impact heterogen build metasearch engin present techniqu detect promin heterogen multipl search engin applic util detect heterogen build metasearch engin provid metasearch distribut document knowledg discoveri introduct internet vast inform resourc recent year world wide web increasingli popular exchang inform organ individu million peopl web regular basi number rapidli find desir data popular wai internet util search engin creat facilit retriev web page web search engin text defin set document search search engin index document creat advanc term repres content word combin content index identifi document term quickli search engin support vector queri queri repres set term boolean search engin attempt provid search capabl document alta search engin web search engin focu document confin domain document organ specif subject area inform user frequent store multipl search engin case user find research paper subject area desir paper scatter number publish inconveni ineffici user determin search individu identifi document solut problem implement metasearch engin top local search engin metasearch engin interfac maintain index document sophist metasearch engin maintain inform content underli search engin provid servic metasearch engin receiv user pass queri local search collect result local search engin metasearch user task drastic simplifi substanti bodi research work address aspect build effect effici metasearch engin accumul recent year main select problem user local search engin document queri object perform select improv effici metasearch engin send queri potenti search cut network traffic cost search useless document select problem determin document retriev search engin invok avoid retriev excess number useless document local retriev document neg effect local higher commun cost ship document higher cost merg result merg problem combin document return multipl search engin singl rank list good metasearch engin retriev effect close document singl minim access cost search engin internet design implement independ substanti heterogen exist search engin similar function search engin exist heterogen primari sourc difficulti develop effect effici metasearch engin detect specif heterogen set local search engin facilit develop metasearch engin top local search engin present techniqu detect specif heterogen multipl search engin techniqu base carefulli design probe queri retriev document analyz retriev result search engin paper main contribut identifi major heterogen exist local search engin analyz impact heterogen effect effici retriev document metasearch engin environ heterogen tradit system impact build system studi extens studi text system present techniqu detect specif heterogen multipl text retriev system appli probe queri discov knowledg search engin research area author probe queri discov term local statist inform term rest paper organ section identifi major heterogen local search engin analyz impact build effect effici metasearch engin impact autonomi local system discuss section present techniqu detect specif heterogen section discuss applic knowledg discov section develop metasearch engin conclud paper section heterogen impact section identifi major heterogen uniqu metasearch engin environ heterogen common system regular os platform section discuss impact heterogen autonomi local search engin build effect effici metasearch engin heterogen local search engin particip metasearch engin built maintain independ search engin decid set document index provid search servic decid document index updat similar document user queri comput similar function complet search engin decid similar function commerci search engin regard similar function implement proprietari inform make gener public direct consequ autonomi search heterogen exist local search engin index search engin wai determin term index repres document term document subset term index lyco emploi order save storag space scalabl search engin web anchor term web page index referenc web page search engin exampl index techniqu involv remov stopword word perform stem transform word stem stopword list stem algorithm search engin document term weight import term repres identifi document repres numer method exist determin weight popular scheme number time term document term frequenc term weight frequent term import term repres content document weight term document function term frequenc term variat scheme exist section popular scheme term frequenc document frequenc term determin weight term number document term fewer document term differenti document document weight term document function document frequenc term number variat incorpor document frequenc term comput weight term section system distinguish occurr term font term occurr term titl web page consid import occurr term titl distinct made queri term weight vector model text queri consid special document short document term multipl time queri queri term weight scheme util frequenc term queri differ comput weight term queri local search engin emploi queri term weight scheme similar search engin emploi similar function measur similar user queri document search engin dot product term weight vector queri document comput similar queri document search engin divid dot product product length vector normal similar valu similar function cosin function similar invert file invert file index standard data structur support effici evalu user queri larg text index invert list distinct term list list pair id document term weight term document locat term document store facilit evalu phrase queri proxim queri aspect address paper focu vector invert file index implement varieti wai possibl store actual weight directli possibl store raw statist data term frequenc document frequenc comput weight queri process implement evalu user queri faster comput advanc support updat remov updat flexibl term support term weight scheme search engin implement suitabl static expect implement dynam document text search engin differ level level domain medic document legal document domain domain easili determin document multipl domain domain divid multipl subdomain level set document set document substanti disjoint document document modifi true world wide web environ web page modifi author web page search engin index web page notifi modif search engin robot detect modifi page due high cost enorm amount work attempt revisit page made period week depend document fetch index search engin base older version newer version document local search engin highli system index version document case web page uniqu identifi result search engin present retriev result descend order local score search engin provid similar return document impact analyz impact heterogen search engin local system autonomi develop effect effici metasearch engin discuss impact implement document select result merg strategi impact select select determin search respect queri determin made estim search engin rank score number potenti document similar queri suffici search engin order estim metasearch engin inform content document call characterist inform repres depend select method requir repres detail statist inform term document frequenc term sum averag weight term maximum weight term select affect autonomi local search engin heterogen select larg due fact heterogen document local search engin domain queri document found select diminish due local search engin unwil provid repres metasearch engin forc send user queri search engin search engin solut problem track past retriev experi search engin experi predict search engin futur queri savvysearch metasearch engin solut solut submit probe queri search engin extract repres retriev document due autonomi type repres search engin metasearch engin repres extract past experi retriev document search engin provid repres search engin provid repres prefer metasearch engin search engin provid repres desir metasearch engin search engin store document term weight invert file index metasearch engin repres averag weight term comput formula formula desir metasearch engin local search engin local search engin provid repres metasearch engin search engin wai repres comput term weight implement invert file repres provid result select techniqu develop impact document select document select determin document retriev select search engin potenti document respect queri retriev local search engin scenario user submit queri metasearch document desir posit integ document return user document queri local search engin find document similar queri local search engin document potenti similar document local search engin heterogen local search engin impact document select problem determin potenti document continu retriev similar document queri select search engin question mind defin similar similar function local search similar comput local search engin directli compar factor index term weight queri make local similar compar similar function local search engin section local similar sole determin document similar document queri local search engin solut problem emploi global similar function global similar comput function determin similar document queri find potenti document global similar document local similar document local search engin comput potenti document low local similar question ensur global similar document retriev local search engin time minim retriev useless document retriev excess number useless document local search engin incur higher local process cost retriev higher commun cost return document metasearch engin higher global cost find global similar document document solut problem global threshold gt estim total number document search engin global similar greater gt local search determin local threshold lt document search engin global similar higher gt local similar higher lt set document local similar greater lt local search engin document search engin global similar higher gt order minim number useless document retriev local search find largest lt local search engin problem determin lt gt studi local search engin wai comput local method determin lt local search engin impact result merg provid local system transpar global result return local search engin combin singl result document merg result rank descend order global similar ideal merg hard achiev due heterogen local system local document similar local search engin compar due differ similar term weight scheme queri index method document directli rank return document local search engin provid local similar return document scenario version document term uniqu document url web index local search engin document return local search engin problem provid estim global similar document situat number solut local search engin time document index system time made metasearch similar document local system index document recent search engin index recent version document wai comput document local similar document combin gener global similar reflect fact document retriev method possibl fetch document comput global similar directli term weight scheme affect compar local similar similar queri document comput weight term queri weight term document term weight yield similar local search engin document frequenc inform term comput document term weight local search engin document repres weight vector search engin closer reveal term weight scheme local search document repres differ case idf inform term comput weight term document observ local idf tendenc reward rare term local system penal common term local system local research paper comput scienc research paper medic scienc term mention paper paper local idf weight document close larger queri singl term issu document term similar queri document lower document condit highli idf term local system idf term term weight scheme big impact compar local similar problem document index method index method differ varieti wai local system perform full text index system emploi partial text index partial text index affect term frequenc document frequenc term local system emploi stem system emploi stem term frequenc document frequenc term affect similar return document local system similar function emploi local system detect heterogen investig problem detect heterogen multipl local search engin solut problem summar discov specif method term similar situat document local search engin compar specif method situat determin type heterogen exist search engin section discuss specif natur heterogen develop solut problem heterogen metasearch engin environ heterogen discuss section identifi easili result detect invert file recent paper sampl queri discov list term document statist inform term discov inform repres special method find domain examin frequent discov focu discov specif implement method index term weight similar local search engin techniqu emploi discoveri queri sampl techniqu basic idea submit carefulli chosen queri search engin analyz retriev result develop tool call engin discov implement inform search engin report discov techniqu implement discuss discov document index method section discov document term weight scheme section discov document index method section document index method exist stopword remov stem implement index stopword remov stopword word frequent document convei inform document remov stopword reduc storag space store document index improv retriev effect stopword result match drawback remov stopword match phrase lost phrase frequent consist stopword phrase stopword search engin support stopword remov excit dont infoseek stopword recogn stopword list search engin due applic domain simpl method determin stopword remov search engin common stopword form queri submit search engin document stopword rigor method retriev queri identifi commonli stopword submit queri consist stopword document stopword remov stopword remov determin exact stopword list search construct superset set stopword search engin superset set term search engin union wide stopword list term superset queri search engin document return queri exist document term determin stopword search engin document term stopword reduc number queri evalu group stopword superset term form queri word group submit queri search engin case occur document return word word queri stopword document indic word queri stopword divid word queri multipl smaller group repeat process actual stopword identifi stem word variat word variat extent variat similar match directli perform variat word map word stem document retriev queri determin stem implement local search proce collect word variat variat submit queri local search engin seek case document retriev variat assum stem implement search engin note stem implement local search engin search engin implement queri scheme thesauru bring variat queri term queri effect stem present local search engin local search engin treat stem implement document retriev variat variat queri attempt retriev conclud stem case occur process repeat word case encount determin stem algorithm local search engin difficult task stem algorithm differ stem small number word larg number word examin order differenti stem algorithm research find effici method solv problem index assum search engin remov stopword word consid perform stem loss assum stopword remov stem perform search engin search engin emploi index index import term document word subject term consid term special tag html bold face larg term begin end document consid import text end typic articl correspond introduct articl term short document term occur frequent document base determin index emploi local search engin submit queri local search engin select larg document line result select document remov import term list remain term ascend term frequenc term list form queri submit search engin retriev conclud index retriev index reason start term low term frequenc attempt reduc number queri process reach term lower term frequenc import term higher term discard index scheme potenti problem step unimport term retriev queri search engin return document small similar problem overcom form queri term discov document term weight scheme discuss section wai assign weight term document due limit discuss discov term weight scheme focu popular scheme term weight scheme assign weight term document weight product factor comput base term frequenc tf formula function tf comput base document frequenc idf formula function df tf formula idf formula exist formula constant paramet valu system exampl tf formula idf formula tf tf denot term frequenc term document tf max tf tf avg dl log tf log max max term number term document avg dl averag number term document constant paramet idf df denot document frequenc log df log df df log df number document constant paramet potenti infinit number wai comput term interest local search formula comput valu constant paramet order carri understand similar comput document repres vector weight wm weight term term space consist distinct term comput product discuss user queri repres vector weight term space document note queri term multipl time queri comput term document comput tf formula document queri similar comput dot product simpl dot product function yield larger similar longer document remedi similar comput simpl dot product function normal length document frequent length queri wide similar function cosin function incorpor document length queri length jdj jqj jxj denot norm vector note cosin function consid special case simpl dot product function vector similar function normal formula reduc dot product function comput document term weight queri term weight special assum similar function dot product function base typic search engin comput similar document queri base queri term weight term document term document term document length normal queri length normal factor incorpor factor queri term weight document term weight case consid paper type formula paramet discov formula paramet valu due space present method discov document term tf formula paper method discov formula similar reason assumpt facilit discoveri term strictli function tf term queri simpli mean frequenc term fix frequenc term term queri formula queri discov shown formula comput queri discov formula discov methodolog discov document tf formula consist step creat knowledg base tf formula survei research paper report design set queri submit local search engin analyz retriev result determin formula knowledg base formula knowledg base found correct thing declar discov fail creat formula explain retriev result time satisfi basic properti tf formula produc valu function formula add knowledg base assum formula knowledg base correct determin valu constant paramet identifi formula note formula tf idf queri tf document queri length normal similar retriev document valu constant paramet formula determin suffici number document retriev return equat involv unknown constant form equat unknown constant found solv equat analyt numer fourth step methodolog solv formula unknown paramet valu identifi rest discuss concentr step methodolog step carri find set term document frequenc integ find document term find term pair term submit sequenc queri term term frequenc search engin object queri pair term find queri similar equal frequenc effect frequenc effect sequenc queri find ratio frequenc step methodolog outlin document document idf idf denot frequenc term queri idf denot denot frequenc term document denot normal factor queri denot normal factor document similar equat express obtain idf dft idf document frequenc base formula comput queri term determin queri term frequenc obtain step determin denot comput denot term frequenc function denot function notat studi pair valu determin form mathemat express formula document linear relationship point straight linear function term frequenc sampl tf formula begin linear relationship function express formula linear function sampl tf formula begin subsect logarithm function discuss assum local similar return document provid local search engin gener solut rank order retriev document found experi rank document similar comput discov formula webcrawl rank achiev averag accuraci rank gener webcrawl discov knowledg detect specif heterogen multipl search engin identif specif method situat individu search engin posit effect build metasearch engin effect effect select discoveri list term document statist inform term benefit knowledg decid select perform select method highli homogen similar select highli heterogen highli select method base short descript repres suffici repres produc discov process independ specif implement search engin repres determin search object fair cheat prevent extent repres produc discov process type inform mean method estim respect queri effect document select mention section interest issu document select document local global similar retriev potenti document minim retriev useless document queri metasearch engin set global threshold gt global similar function document satisfi gt retriev document potenti problem determin proper local threshold lt local search engin potenti document local search engin retriev local similar function gt lt note order potenti document retriev local unwant document retriev local system challeng minim number document retriev local system potenti document retriev queri local desir determin tightest local threshold lt gt lt techniqu tackl problem solut requir similar comput local search engin mean discoveri similar function formula local search engin solv document select problem effect result merg discuss section difficulti merg return document singl rank list local similar incompar document index differ similar comput method weight similar specif document index similar comput method local search posit figur local similar adjust local similar compar comput compar similar illustr discov local search engin select answer user queri emploi method index local document comput local idf inform similar local search engin consid compar directli merg return document differ local search engin remov stopword stopword list queri adjust gener compar local similar term queri stopword local search engin stopword local search engin order gener compar remov submit modifi queri matter origin modifi submit idf inform adjust local similar comput global similar directli overcom problem global idf local idf term note ideal global similar document rank return document case case queri consist singl term similar document local comput local section local idf formula discov global document frequenc estim local document frequenc local search similar adjust global similar multipli global note local search engin emploi stem care determin local document frequenc term stem local search engin local search engin desir local df queri term df comput number document variat df estim df variat assumpt case queri multipl term global similar comput metasearch engin order find find find retriev document submit queri local similar return note formula comput metasearch engin local formula addit queri comput global similar document retriev identifi heterogen uniqu heterogen multipl text system analyz impact heterogen build effect effici metasearch engin present techniqu base queri sampl method detect heterogen multipl search engin discov knowledg solv problem metasearch engin understand aspect local search engin essenti develop effect effici metasearch engin sampl queri discov knowledg search engin approach research techniqu report research find effici autom algorithm knowledg area work support part nsf refer baumgarten probabilist model distribut inform retriev acm sigir pp sixth text retriev confer pp joachim machin learn architectur optim web search engin aaai workshop inform page anatomi hypertextu web search engin document retriev rout inqueri system text retriev confer nist special public croft search distribut collect infer network acm pp du automat discoveri languag model text acm sigmod croft experi document retriev system inform research pp meng structur html document improv retriev usenix symposium internet technolog system experi select search engin metasearch acm juli pp dumai latent semant index pp semant heterogen oo edit prentic gener gloss broker hierarchi gener gloss broker hierarchi technic comput scienc stanford merg rank heterogen internet sourc larg data base inform system corpor wide area inform server technic report machin april resolv schemat heterogen modern system edit index web comput network isdn pp rout retriev threshold experi rish discoveri similar comput internet technic depart illinoi rish statist method estim text ieee transact knowledg data engin search broker usenix symposium internet technolog system pp mauldin design choic internet search servic ieee expert februari mcbryan tool train web rish determin text search internet intern confer larg data york august pp rish estim search engin intern confer data engin march salton introduct modern inform retriev automat text retriev inform comput addison salton bucklei approach automat text retriev inform process pp etzioni metacrawl architectur resourc aggreg web ieee gifford content rout system distribut inform server intl conf extend larson feder system manag autonom acm comput septemb pp bucklei mitra pivot document length normal acm sigir collect fusion problem interact brow rank inform system journal inform pp rish find similar document multipl text ieee confer advanc digit librari meng principl queri process advanc applic morgan kaufmann san lee server rank distribut text resourc system internet intl conf db system adv appli april pp
IR/1136 5 speaker track broadcast audio materi framework project laurent polytechniqu de lab mon email abstract present approach build automat system broadcast segment base system develop framework project segment chop procedur distanc investig reclust procedur reli cluster segment obtain repres hierarch cluster scheme test experi bbc broadcast record show system detect real speaker high accuraci error fair alarm rate alarm rate reclust procedur produc homogen cluster robust tackl complex classif task introduct index spoken esprit long term research project investig develop system speech natur languag process text retriev main goal build system bbc applic broadcast record daili recogn transcript index inform retriev requir main industri advisor retriev engin return ident speaker section correspond queri submit system input audio stream recogn segment speaker ident automat segment audio stream frequent introduc effici method improv perform adapt speech recogn problem acoust segment address year work support esprit long term research project chop front end mel segment limit segment speech signal cluster figur algorithm speaker track audio materi cluster audio segment homogen cluster speaker clean speech noisi channel condit microphon speech telephon framework primarili concern identifi speaker individu time speak program speaker track broadli defin segment label spoken audio stream unknown number unknown speaker homogen region speaker ident mean speaker constant background channel acoust necessarili correspond speaker acoust broadcast programm chang microphon speech telephon chang clean speech noisi clue speaker segment algorithm base acoust featur hard discrimin speaker acoust featur similar scheme perform automat segment audio stream speaker ident algorithm gener base chop split procedur reclust merg procedur approach detect acoust speaker report split segment boundari set inform provid recogn decod spoken audio stream speaker silenc split speaker model train audio stream term model speaker identifi model split speaker found maxima distanc signal measur contigu window shift speech signal method speaker model priori decid implement acoust distanc comput pair window speech signal peak detect threshold criterion threshold minimum peak avoid close segment group cluster member similar cluster algorithm vari agglom method method result agglom method present paper major problem cluster scheme stop criterion assum number speaker broadcast programm merg process repeat number group equal number speaker element partit true speaker inform enrich index paper organ section describ segment algorithm chop split procedur reclust merg section result experi perform show effect procedur radio broadcast bulletin provid bbc full integr system test perform discuss section compar system previou work improv approach order achiev effici robust algorithm algorithm paper rest split consid easiest implement approach speaker track problem hierarch call cluster merg similar segment desir cluster depict figur procedur base acoust cepstral featur split procedur speech signal express term acoust featur vector classic split speaker found maxima acoust distanc signal measur neighbor window shift speech signal collect featur vector fv fv featur vector left window window discret time distanc measur cluster perform vector collect member cluster assum drawn multivari gaussian distribut cluster index window estim column vector full covari matrix cluster acoust distanc collect distribut comput lr lr max lr ij min lr ij lr ij lr denot cluster distanc gaussian cluster left window gaussian cluster cluster distanc base singl gaussian cluster previou defin distanc pair window cluster distanc distanc gaussian distribut cluster distanc test distanc full covari matric mahalanobi euclidian distanc diagon matric assum distanc gaussian distribut express kl log oe oe express exist distanc gaussian distribut assum oe oe exp oe oe oe oe oe oe oe acoust distanc comput pair process find relev maxima threshold criterion threshold correspond minimum detect peak threshold minimum delai consecut elimin adjac close peak highest valu peak threshold maxima discard justifi cluster window estim acoust suggest cluster discrimin power distanc observ exist peak strengthen method cluster peak locat disturb peak detector cluster featur vector comput acoust distanc comput burden depend number cluster chosen judici order centroid current analysi window initi centroid previou analysi window work hope strong adapt centroid acoust chang merg procedur audio track chop hierarch cluster perform segment fs acoust featur step agglom nearest cluster merg partit obtain fc cp start termin time figur acoust acoust distanc window acoust distanc window cluster distanc window window overlap shift set real speaker correspond chang microphon speech telephon speech remind number speaker programm assum cluster stop partit segment reach hope cluster ideal segment speaker appli defin agglom scheme distanc segment segment replac model estim cluster featur vector segment segment codebook initi featur vector current segment centroid split centroid cluster perform centroid binari split appli process continu desir number centroid reach cluster converg distanc segment codebook fm fm defin pw ff pw fi fi ff min ij fi min ij ij denot euclidian distanc centroid codebook centroid codebook number featur vector segment assign centroid number featur vector segment centroid codebook train distanc measur segment distanc matrix build segment figur distanc group neighborhood cluster scheme scheme test figur singl linkag distanc cluster defin distanc closest member complet linkag distanc cluster defin distanc farthest member averag linkag group distanc cluster defin averag distanc pair segment cluster averag linkag group distanc cluster defin averag distanc pair cluster result combin cluster result evalu data segment algorithm previou section test broadcast programm provid bbc programm complet transcrib speaker background condit channel condit evalu data consist radio minut long max speaker programm number speaker programm max shown figur true segment length distribut unimod distribut mode interest mention segment alloc uniformli speaker programm gener main reader speak altern rest speaker segment segment length frequenc figur observ distribut segment length length standard deviat oe pronounc main reader speaker share remain segment segment programm segment speaker main multipl session process programm process separ procedur base featur vector comput raw speech cepstral vector extract analysi window split procedur valu window window overlap window shift test short window overlap order maxim longer window overlap observ paramet global smooth effect signal peak window window overlap window shift set speed accuraci peak detect algorithm distanc signal base threshold set automat depend distanc definit threshold stai constant programm perform chop procedur express term detect rate true successfulli alarm rate erron detect error error estim true function toler defin maximum time interv accept detect true shown figur split algorithm detect speaker reason cluster distanc number peak admit real speaker depend maximum accept delai detect error stai low toler kl figur detect error versu toler cluster distanc chop procedur cluster distanc det rate fa rate kl tabl comparison detect rate alarm rate cluster distanc split procedur toler mean ad higher toler outlier major drawback method alarm rate tabl threshold peak detect algorithm small miss real peak detector trigger merg procedur merg procedur perform true segment programm separ nonparametr segment codebook codebook size chosen comput burden suitabl segment minim admiss distort set experi cluster label assign repres speaker puriti defin ratio number segment speaker total count cluster observ cluster algorithm produc cluster high puriti agglom scheme work figur notic part cluster group segment gener spoken erron merg earli cluster procedur tabl show classif rate result account constraint cluster speaker final partit cluster label puriti puriti figur cluster puriti merg scheme singl complet averag linkag averag linkag group merg scheme classif rate singl linkag complet linkag averag group averag group tabl comparison classif rate merg scheme sign repres observ misclassifi segment shortest codebook suffici good speaker notic difficulti classif task grow number segment number speaker complex problem gener solv produc pure cluster complet procedur full algorithm appli bbc record merg procedur directli fed segment boundari extract split procedur record process separ cluster distanc chop audio stream averag linkag group scheme chosen reclust segment algorithm gener enhanc perform adapt speech recognit perform term error rate reduct concern segment produc result observ final segment obtain true speaker extra number segment lead complex task shorter segment boundari defin featur vector multipl speaker codebook discrimin cluster process discuss al segment algorithm base metric acoust distanc threshold method detect acoust report detect rate evalu test set beigi al similar split method discrimin distanc obtain detect rate data chen al appli maximum likelihood method base bayesian inform criterion perform split cluster algorithm detect true toler alarm rate test data segment cluster algorithm produc automat cluster high puriti cepstral featur compar previou algorithm work improv split procedur made effici accur threshold peak detector tune automat merg procedur robust complex task problem address speaker model repres segment advanc cluster scheme full process time consum cluster perform procedur window size window shift split number centroid segment codebook merg solut suggest speaker acoust analysi window segment paper present segment broadcast develop framework project speaker track system base algorithm split procedur rest techniqu detect speaker maxima distanc signal measur window shift audio stream chop procedur extract segment reclust agglom cluster method base neighborhood scheme audio segment repres model codebook train featur vector belong acoust distanc split procedur test hierarch cluster scheme appli merg procedur good detect rate true speaker fair accuraci boundari reason alarm rate full procedur lack robust produc high puriti group high classif rate typic task segment speaker broadcast refer renal broadcast proc vol pp renal broadcast retriev system proc workshop access inform spoken cambridg april measur signal process pattern signal vol pp mae distanc measur collect distribut applic speaker proc vol pp beigi channel environ chang proc world congress chen environ channel chang detect cluster bayesian inform proc darpa broadcast transcript understand speaker proc darpa speech recognit cambridg engin johnson cluster direct proc raj classif cluster broadcast darpa proc speech recognit pp
IR/1137 5 question answer web radev michigan fan virginia polytechn institut state hong qi michigan harri wu michigan michigan abstract search engin googl northernlight return document relev user answer user question develop architectur augment exist search engin support natur languag question answer process entail queri document passag phrase answer rank paper describ probabilist approach stage show techniqu appli number exist search radev al present result contrast method question answer probabilist phrase rerank proxim question type featur achiev total reciproc document rank corpu techniqu implement call introduct amount inform ideal sourc answer larg varieti question problem exist front end web fast search engin design retriev document relev user pose idiosyncrat question formul human languag english claim natur user type question wrote king largest citi northern queri written user search engin return actual possibl context document occur process retriev answer question natur languag question answer introduc method question answer call probabilist phrase rerank fulli implement call exist radev al system closest jeev mulder jeev accept question return answer engag dialogu user mulder longer web comparison fast base local cach file provid access full web note search engin user enter natur languag tion queri search engin remov frequent stop word treat rest question queri search engin behav handl stage form provid document answer output result question largest citi northern googl search result back full list truncat reason full coverag mile airport largest citi northern held comment cach similar page world di northern largest dai led protest bomb similar page result consist short summari relev document pointer document clear document return search engin radev al relev input question answer return document top rank document problem identifi correct answer top relev document return search engin similar produc alltheweb shown figur figur sampl output alltheweb review relev previou paper describ method techniqu phrase reli exist search engin return document answer user question stage extract rank answer question stage queri document passag phrase extract answer rank detail section radev al experi paper perform author northern light period septemb novemb relat work start qa system question geographi mit knowledg base answer question earlier encyclopedia knowledg base answer question shallow parser extract potenti answer section encyclopedia base phrasal relationship word question larg number qa system emerg recent follow direct trec data test corpu develop search engin answer extract techniqu top direct www potenti answer sourc gener search retriev inform relat question extract answer question review recent work section relat work trec trec question answer evalu motiv forc recent surg question answer research system particip trec identifi short passag text corpu answer list factual question ibm team radev introduc techniqu predict methodolog index text relat work trec radev al question answer idea approach text document annot label anticip target kind question system retriev set passag answer potenti answer extract passag rank linear rank function learn logist regress hovi al develop system call base ir nlp techniqu question creat queri retriev top rank document top rank document split segment rank potenti answer extract sort rank function involv match question type pattern question manual construct classif question potenti answer pattern rule learn base grammar parser abnei al method base entiti techniqu set relev passag answer identifi candid set entiti extract retriev passag question extract entiti classifi set categori entiti match categori requir question retain frequenc posit relat inform clark al appli passag retriev techniqu initi preprocess passag rank algorithm util semant match inform queri type document measur spread word phrase document term weight inform term coverag queri relat term passag statist context free grammar parser base wordnet determin relat work web radev al question categori top rank passag scan pattern match answer categori potenti answer extract rank qualiti heurist integr form semant pragmat present question reformul construct queri semant inform base entiti recognit techniqu emploi ensur high qualiti passag retriev potenti answer extract rich passag match question type candid answer justifi abduct pass test retriev score high recent trec evalu contest system recent trec contest uniqu approach call approach answer identif nlp techniqu longer pattern type question defin pattern match answer select rank potenti answer relat work web trec confer offer excit environ competit research answer question answer fix text corpu trec limit effort port exist techniqu larger context world wide web earlier studi show current www search larg index offer sourc question answer relat work web radev al al present techniqu learn search engin specif queri transform question answer similar transform techniqu idea current queri interfac gener search provid capabl direct question answer natur languag mode transform initi natur question format includ domain specif dramat improv chanc find good answer top search hit list set transform rule learn train corpu appli question search experi shown result improv chanc high qualiti document search engin provid mechan identifi true answer search result gener framework queri transform discuss total queri modul oper identifi train em algorithm wide rang train question oper tailor question identifi appli onlin question answer web search engin system discuss recent techniqu similar trec confer appli web user question process parser learn syntact structur order extract answer make tion task question classifi numer tempor similar techniqu radev queri modul queri noun phrase transform appli initi question high qualiti result answer extract answer extract modul util idf inform radev al word distanc extract answer extract answer assign score base context document cluster group ber highest score group select repres group present user potenti answer system deep natur languag parser author admit mulder web approach slow usabl web faster parser hardwar mulder system run workstat parallel etzioni daniel person make scalabl replac part approach base classifi probabilist phrase rerank achiev reason perform singl sun workstat shown addit offer scalabl approach web context previou work probabilist approach phrase rerank gener architectur system gener approach includ queri modul process convert question queri option stage approach queri modul paper present approach queri modul answer natur languag question gener architectur system radev al largest citi northern queri modul citi document retriev sentenc retriev largest town locat region mile airport largest citi northern answer extract answer rank figur architectur system question type recognit stage question subdivid depend type answer document retriev process return document input question passag retriev process identifi retriev ment textual unit answer answer extract relev sentenc passag split constitu potenti answer candid phrase rank phrase extract previou stage rank goal answer top hit list evalu metric radev al evalu metric evalu total reciproc document rank sum reciproc valu rank correct document top extract number return phrase main reason main perform measur multipl correct answer question correct answer multipl document rank system retriev correct defin similarli sentenc level phrase level base rank correct sentenc metric similar metric trec evalu differ top rank answer count distinguish correct answer place correct answer eighth tenth place metric emploi make finer distinct perform departur trec scheme inabl perform manual evalu due larg number judgment evalu method paper reli automat evalu scheme document sentenc check program presenc expect answer sort evalu similar evalu show manual automat evalu consist radev al reason automat evalu mechan measur perform larg system note experi paper corpora nist total pair tune system base question period train experi conduct mulder system metric user measur total number word shown page correct answer identifi chose metric closer spirit establish metric trec manual automat evalu consist case document match answer pattern support answer answer tion light railwai automat tion document railwai construct event happen distinct human judg correctli question extent automat evalu consist human judg experi examin consist result automat manual evalu ran question alltheweb search engin evalu hit automat manual perform score comput question method formula pearson correl data xy radev al reciproc perform score manual evalu matic pearson correl score deriv formula show correl manual automat perform score justifi automat evalu manual tion ten thousand note automat method evalu contrast manual evalu question type identif identifi semant type question import step extract actual answer question expect person answer question list tabl method implement categor rule induct ripper heurist algorithm question experi automat identifi question type compar manual annot question type person place date number definit organ descript abbrevi rate length monei reason durat nomin tabl list question type machin learn approach radev al descript question seek descript question invent paper label person nomin describ question nomin phrase assign specif categori person organ question belong type fall machin learn approach ripper machin learn tool question categor question repres semant featur base wordnet semant featur check hypernym noun sentenc monei relat word question process yield featur featur list tabl tabl featur question experi ripper question type identif question increment ad train data set manual ad data point train data produc robust rule mean question length noun categor length type manual data point heurist algorithm radev al ful ripper train data set produc data ripper gener hypothesi repres length ripper predict question type test data question mile england england expect length answer result ripper identifi question type list tabl train test train error test error tabl result error ripper identifi question type heurist algorithm method type identif categor question heurist natur question categor trivial question word good indic semant type answer true question question examin respect map question type tabl small number determin question question cover type except simpl rule list tabl syntact semant analysi heurist algorithm radev al type tabl analysi type templat type descript organ tabl sampl rule heurist algorithm radev al po tagger tag question tag state unit state cover largest wp popul base noun phrase determin question type select noun noun phrase inform noun determin question type tic analysi question base noun phrase card compani inform noun categor tion organ compar question wp complic task verb question categor question verb question type definit number question word remain system extract inform noun gener heurist find inform noun locat noun base noun phrase question averag salari base noun phrase averag salari salari inform noun question heurist question russian astronaut head heurist appli question film law act type left inform noun implement lexicon built manual map noun heurist algorithm radev al length inform noun question categor length type wordnet build map lexicon tabl show result heurist determin question type line result heurist gener includ line show result heurist modifi trec question set disappoint addit trec question train test perform trec question train test tabl result error heurist identifi question type accuraci greatli improv heurist train error rate test error rate train test tabl train error rate test error note train error rate exist question hard categor addit inform question won expect person answer won nobel peac price expect organ won document retriev radev al offlin interfac major search northern googl input interfac queri question output list url top match document perl modul retriev actual document split sentenc phrase retriev top document search engin evalu section show perform document level passag phrase level retriev paper perform late octob earli novemb sentenc rank sentenc rank reduc comput complex phrase rank stage produc phrase directli download document substanti comput perform sentenc model system base model base tradit vector space model question submit user gener trigram lexic statist sentenc rank formula score sentenc proxim word queri model score normal actor total number occurr radev al trigram sentenc linear combin weight set weight experi term frequenc idf document measur unigram normal actor defin sentenc length sentenc sentenc length sentenc rank function design base modif okapi rank function document rank defin tf idf sentenc length sentenc tf sentenc length length sentenc word sentenc averag sentenc length top document return search tf idf similar mean linear combin calcul base singl term evalu show perform sentenc level phrase extract rank potenti answer identif convert retriev document web chunk typic download top hit search produc ten thousand phrasal chunk question author iron biographi margaret phrase return phrase rank radev al correct answer hugo young phrase scatter phrase identifi automat address current algorithm util proxim text question phrase queri term high phrase phrase queri term slightli lower score figur show effect proxim score phrase phrase larg number queri word higher score phrase activ weight phrase rank figur proxim featur answer extract rank modul addit sourc format improv perform previou modul phrase signatur identifi question answer type expect answer type tion margaret biographi person comput probabl signatur phrase type phrase posit phrase rank radev al phrase signatur phrase hugo young determin nnp nnp probabl call probabl ture score multipli proxim score previou subsect signatur score current subsect ur show common part speech signatur phrase type correspond part speech symbol gener text past participl form jj dt determin nnp proper noun system commerci grade entiti tagger approach benefit tagger phrase signatur work signatur phrase type dt nn person number org nnp person place date dt jj nn number place org nnp nnp place person org dt nnp org place date figur common signatur phrase type mean signatur answer type question frequenc deriv manual annot corpu text unrel trec corpu note step answer identif rank base sentenc origin download document compar perform approach experi section radev al question american expect correct answer alan shepard submit question googl search engin result back figur note number person hit list includ occurr correct answer top document return googl question total approxim peopl total system pick instanc alan shepard figur googl result question difficult figur articl top hit list american american gener correct answer question run kwok al paper hit output system sentenc level shown figur american space alan shepard american space alan shepard jr launch space mind alan shepard american space man american woman salli ride american woman salli ride salli ride american woman travel space submit anonym contributor american woman salli ride physicist salli ride american woman space particip mission space shuttl challeng american space flight involv human privaci copyright disclaim american space live small town florida call beach mercuri astronaut chosen american space american dare unknown enter space radev al figur top rank sentenc system person shown bold correct answer figur show top phrase retriev system directli document proxim featur figur reflect featur account top rank sentenc figur show phrase account top sentenc return document featur show combin featur improv system perform factor top rank phrase figur space flight oper contractor signatur dt nnp nnp nnp nn signatur expect question type person place nnp nnp nnp nnp nnp nnp rank probabl phrase dt space nnp flight nnp oper nnp contractor nn intern nnp space nnp station nnp alpha nnp intern nnp space nnp station nnp vb dt joint jj ventur nn unit nnp space nnp allianc nnp nasa nnp johnson nnp space nnp center nnp md form vb dt nn prime jj contract nn nnp american nnp dt bulletin nn board nn space nnp nn space nn februari alan nnp shepard nnp radev al figur document proxim question trec correct answer posit phrase phrase rank sole base proxim combin probabl alan shepard place phrase proxim score featur addit phrase move tenth place score score product proxim score score score equal term actual note modifi output ripper top candid categori question person place candid question type question phrase alan shepard move higher list sixth list phrase limit phrase highest rank sentenc return sentenc rank compon question rank probabl phrase space nnp administr nnp space nnp calendar nnp nnp american nnp intern nnp space nnp station nnp alpha nnp jj space nn mission nn nasa nnp johnson nnp space nnp center nnp dt american nnp commerci nnp launch nnp industri nnp dt red nnp planet nnp nnp american nnp alan nnp shepard nnp februari nnp space nnp intern nnp space nnp station nnp al nnp nnp spirit nnp radev al figur document proxim question correct answer move place base proxim question type rank probabl phrase nnp beach nnp februari nnp nnp space nnp nnp alan nnp shepard nnp nnp american nnp space nnp nnp nnp american nnp woman nn life nnp scienc nnp space nnp shuttl nnp discoveri nnp nn dt moon nnp intern nnp space nnp station nnp space nnp research nnp nnp session nnp nnp american nnp salli nnp ride nnp salli nnp ride nnp figur document sentenc proxim question correct answer move place sentenc filter extract answer phrase comparison radev al perform experi level granular studi effect improv chanc find good answer search result mention wai prune search space answer phrase compar rank scheme search search engin document level perform question search engin averag compar compar sourc alltheweb alltheweb alltheweb northernlight googl googl googl tabl perform comparison search engin document level score mean top rank document singl correct answer correct hit sum reciproc rank equal perform document level engin summar tabl averag averag total reciproc score number time correct answer identifi top document number parenthesi total number question evalu track result alltheweb result northernlight googl alltheweb good googl complet domin categori googl improv chanc find correct answer googl return document sentenc level perform radev al correct answer question improv alltheweb googl engin sourc potenti answer question answer list tabl document level perform result googl question sentenc level perform tabl summar perform result sentenc rank result search engin sentenc rank result linear combin formula list row similar result modifi okapi formula list okapi question search measur averag percentag compar percentag compar sourc engin upper upper bound alltheweb bound alltheweb alltheweb upper linear okapi upper light linear okapi googl upper linear okapi googl upper linear okapi googl upper linear okapi tabl sentenc rank comparison trec question cell row valu report total cal top sentenc improv improv engin baselin engin alltheweb perform obtain calcul total score sentenc answer assumpt sentenc rank top list total sentenc sentenc rank perform radev al ideal phrase rank algorithm achiev upper bound give upper bound stage perform stage measur separ similar definit phrase rank evalu discuss subsect result tabl linear combin sentenc sentenc extract top search result result column report number question correct answer found sentenc produc sentenc rank comparison line engin alltheweb linear combin formula googl engin note lose correct answer question due fact sentenc answer rank top sentenc rank formula manual evalu result show problem simpl sentenc segment simpli reflect exist spuriou answer test sentenc level perform appli sentenc rank formula question googl backend summar tabl show linear sentenc rank okapi sentenc rank result perform phrase level perform shown tabl mean phrase gener rank origin download document mean phrase creat rank top sentenc sentenc rank type perform radev al question search engin upper proxim proxim sourc bound order alltheweb northernlight googl googl googl googl tabl phrase rank perform perform report definit similar sentenc rank order mean phrase order base posit phrase order origin rank document proxim util proxim overlap phrase user rank phrase proxim proxim signatur inform phrase essenti phrase approach tabl approach produc result advantag approach simpl heurist trec googl perform categori search engin examin test sentenc googl show perform dramat improv approach approach demonstr sentenc extract rank origin retriev document improv perform origin document directli final perform reciproc document significantli lower trec top perform multipl reason discrep radev al question pull directli trec corpu exist sentenc question answer corpu trec corpu consist clean articl web significantli heterogen text test googl question find compar question result summar tabl futur work present probabilist method natur languag question ing implement robust system test realist corpu question thing address paper scalabl issu current system perform faster question answer current perform question answer remain improv thing deserv attent extens found step page sentenc part speech time parallel process speed download depend exist web search engin answer sourc bottleneck system expect improv perform significantli pre snapshot search content question depend number document download web radev al number phrase extract current version includ queri modul process convert question queri search futur plan add queri modul fine tune phrase experi addit heurist answer select plan combin approach effici heurist improv final perform system acknowledg michael data timothi allison luo refer radev al refer answer extract anlp learn search engin specif queri transform question answer world wide web confer hong kong learn natur languag case studi part speech tag comput question answer passag select experi nist special public ninth text retriev confer page learn tree rule featur thirteenth nation confer artifici intellig eighth innov applic artifici intellig page menlo park aaai press mit press improv categori specif web search learn queri modif symposium applic saint san california boost knowledg answer engin refer radev al nist special public ninth text retriev confer page question ing nist special public ninth text retriev confer page sentenc process inform access world wide web natur languag process world wide paper aaai spring page robust linguist approach question answer encyclopedia sigir pa scale question answer web world wide web confer hong kong document center approach text normal sigir page predict annot question answer nist special public eighth text retriev confer page answer natur languag queri web journal american societi inform scienc technolog rank suspect answer natur refer radev al languag question predict annot enc appli natur languag process washington mine web answer natur languag question acm cikm tenth intern confer inform knowledg ga okapi fourth text retriev page nist special public pattern potenti answer express clue answer nist special public text retriev confer page md question answer track evalu nist special public ninth text retriev confer md question answer track evalu text retriev confer md
AI/1138 2 boston comput scienc technic report bu novemb recognit human action featur comput scienc depart boston ma abstract perform classif approach evalu approach motion approach comput vision imag process techniqu regist process video sequenc motion call motion energi imag motion histori imag construct tempor compon explicit tempor analysi sequenc match statist descript comput featur reduct techniqu hu invari scale translat princip compon analysi reduc system train subject perform set exampl action recogn gaussian mixtur classifi recogn action experi conduct instanc human action perform subject comparison perform classifi condit analyz report main goal test importantli compar advantag classif approach recognit task introduct motiv classifi motion object challeng import problem comput vision motion low imag process techniqu high space repres sourc kei difficulti encount analyz visual motion method repres motion space desir import requir method power higher descript essenti count result support effici demonstr power import motion recognit problem evidenc attent receiv recent year main area research analysi human motion numer domain motiv research video robot motion object semant rich static configur scene import necess analysi area limit establish evalu perform due difficulti uniqu defin accur describ action exhibit action deal gener problem motion recognit work focu small set human action comput import give high level interpret motion classifi perceiv motion video sequenc goal test action importantli compar advantag classif approach recognit task classif approach neighbor gaussian gaussian mixtur classifi mixtur number minimum descript length classifi determin probabl densiti mdl approach base measur determin balanc number paramet perform achiev classif clear classifi level necessarili true complex classifi complex task classifi handl relat characterist problem expect obtain depict sourc complex human action recognit task approach recognit organ report sec introduc previou work area relev approach present sec overview sec explain action featur extract sec detail exposit techniqu motiv choic sec describ gener set sec show detail discuss sec present discuss extens background previou work fundament idea motion percept work johansson move light displai demonstr inform set select point perform motion recognit task approach relat watch peopl real environ due hogg semin comput vision idea motion recognit work data consist synthet imag constraint satisfact techniqu emploi current technolog motion recognit divid group approach relev excel review motion understand group base fit explicit structur model reconstruct overlap group techniqu achiev motion understand recogn sequenc static requir explicit reconstruct knowledg relev group approach relat achiev recognit motion directli sequenc imag explicit static imag repres motion give overview fundament recognit repetit motion achiev basi bottom identifi specif part classif object approach estim local veloc undo translat loom make object stationari respect spatiotempor templat match motion order recogn motion requir comput featur vector motion magnitud compar pattern implement requir processor pixel imag main goal recogn human facial express dynam system motion patch face motion directli repres instanc facial express davi techniqu repres recogn action motion histori imag motion energi imag repres recenc motion repres motion occur present method recognit tempor templat templat match nearest neighbor approach exampl motion learn main restrict method requir object undergo global translat motion perceiv imag unsuit deal multipl object insuffici discrimin similar motion action view work relev moment base featur repres classifi action classif approach test avoid requir multipl motion object registr techniqu develop author techniqu track trajectori recoveri multipl object segment object center obtain techniqu motion analysi overview descript approach comput vision imag process plan recogn specif action perform set predefin action set assum static fix major peopl perform action subject extern agent assumpt relax sec due space system approach motion templat tempor compon fulli explain explicit tempor analysi sequenc match featur vector action function motion tempor properti partial drop approach sensit view motion produc featur construct action recogn view action statist constrain implement deal problem motion recognit specif view assum view cost train camera person perform action captur featur motion singl view test potenti chosen work order test discrimin power system view action recogn present view view straightforward extens singl view provid accur recognit cost detail give overview approach set human action directli video sequenc label user registr system design work action user class belong data subject condit collect label system gener action consist describ motion occur tempor properti motion energi imag motion histori similar recognit task imag function motion properti action tempor compon static vector high process statist properti gener set moment base featur invari rotat scale mei superset directli extra process step princip compon analysi princip compon analysi reduc dimens space statist optim assum class gaussian distribut featur vector rotat vector train system classifi action classif compar gaussian mixtur gaussian classifi result experi shown perform classifi compar action order analyz motion occur sequenc method captur repres directli initi tation interest analyz motion occur window time construct view specif motion base motion occur tempor characterist result process time dimens static depict action static call motion energi imag motion histori imag function observ motion properti spatial imag locat imag sequenc motion detect input video consist sequenc color frame rgb space simpl linear standard perform color space grai scale color model channel input frame time motion detect mechan base simpli chang differ consecut incom frame differ threshold form binari map show high likelihood motion present ae process differ imag locat time select threshold low level process necessarili captur motion repres motion interest order complic data acquisit assum static background possibl separ motion object camera object comput vision techniqu partial solv problem concentr recognit action simplifi registr process accept level assum static background motion energi imag mei basic cumul motion imag simpl observ motion spatial locat motion time dimens fulli drop calcul ae ft tg repres durat time window captur motion figur action top row show singl frame middl bottom row respect mei calcul frame notic mei threshold version motion histori imag tempor characterist motion import analyz action mei drop tempor compon kind account tempor compon action ae result function recenc motion pixel bright pixel proport recent intens consequ motion mei construct sit chair action comput video fig motion sequenc singl imag vector problem relat part motion lost due overlap motion imag plane repres typic human action perform featur extract high perform recognit space good discuss sec extract featur classif chosen specif choic hu moment modifi achiev ti modifi set repres featur comput statist descript mei action hu moment base central eq show adapt imag space reason explain pq number pixel row column number pixel bright pixel view desir properti descriptor invari translat imag object scale hu moment invari imag translat rotat obtain scale definit radiu planar pattern radiu normal obtain vector properti invari scale camera plane comput featur mei obtain advantag disadvantag fact difficult reason intuit featur vector provid reduct discrimin power test comput vision recogn shape reduct princip compon analysi current defin full featur vector reduc compar mei ran relat problem preliminari test estim class distribut occur sampl probabl densiti region gener probabl discret approxim introduc sampl gener probabl distribut region close estim probabl densiti function estim accuraci indic probabl area case problem reduc sampl vector train data space likelihood option slightli extend approach problem princip compon analysi reduct achiev solv eigenvalu decomposit problem eigenvector matrix covari data diagon matrix eigenvalu eigenvector largest obtain matrix defin featur vector experi determin notic experi train data obtain varianc data choic pca find minimum error reconstruct data base assum data gaussian distribut numer problem experi solv transform space recognit descript discuss evalu classif paradigm variat mixtur gaussian classifi discuss theoret implic directli appli classif problem present descript motiv normal neighbor approach recogn action base neighbor algorithm nearest neighbor pattern recognit statist estim begin knn simpli sampl train data instanc suitabl basic idea reason assum observ close classif mention reason motiv choic advantag techniqu consequ make assumpt parametr form underli distribut class distribut case high space simpler classifi give result knn directli estim posteriori probabl classif probabl function directli knn simpl solut problem size window data estim function data knn classifi theoret properti amount train data error reason chose knn classifi good perform classif train data reliabl estim order statist true high featur space instanc data train occur rare real environ featur properti individu spread differ simpli calcul knn euclidean featur higher varianc tend domin distanc measur featur weight differ distanc simpl solut normal featur varianc distanc measur commonli call mahalanobi statist comput train singl gaussian classifi method base bayesian classif assum distribut prior inform class discuss reason implic choic main theoret reason gaussian distribut root central limit sum independ ident distribut random variabl gaussian distribut data result sum contribut larger number independ central limit theorem model total gaussian distribut exampl factor variat light slight perturb orient camera respect move quantiz error digit possibl background foreground comput differ camera sensor note slight camera point view rotat possibl model major gener requir learn class perfect featur vector descript variabl model argu countless engin applic demonstr sec possibl model solv inher problem deriv assumpt theori base pose problem probabilist term assum relev probabl valu approach support describ priori probabl class classifi natur repres term discrimin function class maximum discrimin function correspond minimum condit risk interest obtain minimum error simplifi make maximum posteriori replac monoton function omit detail present main log log rule optim model turn procedur give result classifi assum featur mutual yield diagon covari matrix class class distribut paramet featur vector eq normal distribut obtain discrimin function log resembl resembl simpli mahalanobi distanc measur extra shift term estim base train data class eq mixtur gaussian classifi assumpt distribut suffici give good approxim underli densiti distribut consid case distribut mixtur gaussian theoret foundat approach similar sec correct bayesian notic verifi reason mixtur gaussian accur previou approach investig experi motiv mixtur distribut fact action singl perfect tempor due defin sec standard bodi configur singl tempor variabl result variat bodi possibl extend span space standard configur action interest find repres set mode model select techniqu number paramet paramet estim expect algorithm em algorithm method obtain maximum likelihood paramet estim observ data incomplet techniqu increasingli estim discuss implement detail estim paramet gaussian mixtur mixtur mode unobserv assum gaussian covari diagon mutual em algorithm base expect likelihood complet data observ data case repres ik log oe ll il ki oe ll ik indic mixtur model em number observ number gaussian mixtur vector paramet defin distribut repres find expect likelihood complet data function basic reduc find ik ik jz jz paramet arg max due space omit detail deriv give final solut step ik ik oe ll ik il kl ik ik il order select model mdl mdl arg max log number paramet model number sampl train data implement em stop criterion chosen iter initi valu chosen ffl chosen randomli uniform distribut paramet minimum maximum valu train data dimens ffl oe ll chosen estim covari train oe ll il repres compon popul ffl chosen uniformli distribut number mode em algorithm set classif techniqu test defin sec describ context common test collect train sampl action recogn train system intens train registr system design action label user easili train system instanc action perform subject experi test train data approxim label action action consid occur set translat motion effect train system track system develop track segment subject sequenc produc object center sequenc action process sequenc input train system object consid present global translat motion compon action present global translat compon treat action motion classif paradigm assum mutual independ instanc exampl train data set train data set test data set independ order improv valid account issu collect train data relat collect data ffl action perform subject watch action perform subject perform action independ subject train data ffl action argu instanc action perform subject total independ case larg number subject perform action collect data higher independ action ffl span repres featur subject variabl characterist chosen variabl span rang variabl present subject ffl environ sourc depend creat environ train place chosen scenario light condit train session ffl subject train test effect independ train test set subject set train system set subject test disjoint set subject denot train test set oe gener variabl collect varieti condit mean import issu reli fact variabl system prepar handl perform system measur simpl error count result classifi human motion present test domain similar probabl error rank correct move close top result present categori base classif approach hidden markov model estim techniqu obtain report accuraci chanc give maximum probabl error figur singl frame action classif row show action row show action experi consum hand held video standard sgi uncalibr camera record pixel video jpeg notic reduct resolut frame fig show complet set test action illustr singl kei frame video sequenc respect action gaussian gauss mixtur gauss mixtur tabl classifi rotat action tabl matrix indic classifi rotat notic action action correspond view angl action sit walk classifi neighbor gaussian mixtur gaussian classifi mode mixtur gaussian classifi mdl principl find number mode class estim underli densiti result discuss gener set experi descript classif techniqu sec present detail experi complement gener set result conduct experi variat train data collect explain experi evalu properti potenti approach test data subject experi goal classifi action shown fig test classif techniqu rotat data set rotat set approx action class chosen uniform number gener select action train notic possibl action chosen test rotat system train rest action tab show classif result obtain action tabl matrix indic gaussian mixtur classifi action tabl matrix indic gaussian mixtur classifi mdl notic action subject system part train data set intuit mean perform system strongli affect knn classifi gaussian mixtur classifi gaussian classifi suffer statist comput class train set subject experi differ sec train system set subject test set subject overlap previou set goal measur abil system gener definit action subject perform action train set chose record action subject test data rest action train data chose move action test data classifi train data process repeat time subject train data tab show result experi expect recognit perform degrad action perform test subject consid train result system gener small loss perform result action subject similar action perform subject error rate highli influenc higher misclassif class occur due similar statist error action gaussian gauss mixtur gauss mixtur tabl classifi subject rotat instanc action test subject part train data action tabl matrix subject experi indic classifi gener problem data overfit translat motion test experi test recognit system action action differ rest extra compon motion translat motion due locomot track system develop obtain object center action reli due motion subject respect rest subject spatial coordin project imag mechan undo effect translat process sequenc input train action experi decid rotat mechan sec classif result shown tab tab recognit rate compar show action gaussian gauss gauss mixtur tabl perform classifi translat motion rotat action tabl matrix translat motion experi indic classifi rotat extend idea initi handl complic multipl object translat motion discuss result neighbor approach perform similar perform obtain gaussian mixtur classifi mdl principl observ make reason close specif advantag classifi knn mixtur gaussian problem deriv greater amount train data possibl overfit gener properti classifi reduc class present local point knn classifi weak data reduct properti basic knn requir store possibl search data obtain train mixtur gaussian classifi reduc descript data distribut mdl principl put constraint descript length distribut time avoid overfit inform theoret approach data reduct overfit main reason mixtur classifi knn advantag requir model form distribut risk assum data distribut high task mixtur gaussian good model data perform good assum form data distribut observ make prefer gaussian mixtur classifi test applic action perform recognit rate limit similar class descript featur vector main sourc error classifi perform tendenc concentr error misclassifi action action action similar statist easili fig sourc error direct consequ simpl motion detect mechan motion harder detect object textur differ imag comput person wear cloth solid sophist motion detect techniqu robust sourc error due lost accuraci obtain repres sequenc mei action similar standard video make lot loss motion detail limit action chosen human action form distribut compar result classifi experi roughli infer distribut class data subject class repres compact set point space consequ differ action perform subject note perform differ obtain knn classifi test relat insuffici establish clear boundari class classifi reli strongli local characterist space support infer underli distribut class result obtain classifi distribut unimod gener reliabl estim obtain mdl principl mdl gaussian found averag number mode repres underli distribut indic suitabl multimod distribut describ data estim classif risk data higher class classifi correctli unimod densiti estim class experi exampl observ mode estim distribut affect recognit rate appreci posit averag perform obtain experi show test classifi advantag train data obtain subject test subject part train perform natur action perform subject closest action train set perform clear consequ interdepend action subject perform action experi subject show train data action subject featur chosen good gener action experi show extend classif system handl complic case adequ registr mechan multipl attent problem handl part futur research direct intend explor refer azarbayejani pentland track human bodi imag black yacoob track recogn rigid facial motion local parametr model imag motion bobick davi action bregler learn recogn human dynam video sequenc campbel bobick recognit human bodi motion phase space constraint davi bobick recognit human movement tempor templat rubin maximum likelihood estim incomplet data journal royal statist societi duda hart pattern classif analysi john wilei aircraft identif moment invari tran davi track recognit human approach intl workshop automat face gestur hogg paradigm walk person imag vision hogg interpret imag move object phd hu visual pattern recognit moment invari ir tran inform johansson visual percept biolog motion model analysi percept yacoob cardboard model articul imag motion proc gestur nelson qualit detect motion move observ intern journal comput badler imag analysi human motion constraint propag expect algorithm note boston colleg pentland horowitz recoveri motion structur nelson low level recognit human motion proc ieee workshop articul kanad track articul object increment recognit pedestrian imag sequenc sclaroff improv track multipl human trajectori predict model cvpr workshop interpret visual shah jain recognit kluwer pentland real time track human bodi technic report tr mit media
ML/1139 6 reason support continu improv process frank wolfgang marku nick fraunhof institut softwar engin kaiserslautern abstract goal project collabor fraunhof institut manufactur engin autom stuttgart fraunhof institut softwar engin develop technic infrastructur support continu improv process describ approach detail focu implement system ongo evalu healthcar sector give outlook intend extens system applic domain introduct legal rule situat public health care sector forc hospit germani increasingli compet patient fund result interest join form larger establish continu improv process qualiti awar reduc cost attract patient major group hospit staff administr personnel experi qualiti manag continu improv larg potenti improv found knowledg implement improv activ result lesson learn share store result demand support continu improv process hospit start point process qualiti joint effort fraunhof institut appli research technolog fraunhof institut manufactur engin autom stuttgart fraunhof institut softwar engin kaiserslautern contribut method technolog learn ipa contribut qualiti manag hospit kei issu solv project organiz procedur combin inform technolog support involv knowledg recommend approach system learn experienc exampl suggest machin learn approach technolog root field reason provid method techniqu technic system implement cbr view organiz procedur complet carri human consequ suggest althoff wilk cbr strategi learn problem solv base experi level basic cbr cycl consist step retriev aamodt plaza complet carri human experi factori approach underli qualiti improv paradigm build learn organ ef physic logic infrastructur learn experi store collect experi experi base shown althoff integr technic implement eb chose commerci cbr project success applic practic technic implement eb successfulli pass number field test approach project map organiz defin introduc hospit ipa strategi cbr base interest tool build technic start point tool base ipa hospit project case document paper case knowledg develop interest knowledg languag call present machin learn method plai import role organiz learn learn develop organiz memori support continu improv process hospit futur extend system scope enhanc clinic organiz knowledg manag hospit accompani data mine method gener clinic knowledg extend organiz memori induct learn knowledg memori gener overview support intend abstract implement techniqu fulli integr experi factori tool architectur aim gener knowledg manag task combin cbr technolog step automat support learn process support integr data mine case base popul induct learn knowledg base analysi result power broadli applic knowledg manag support environ section describ approach section implement softwar section ongo evalu give outlook intend extens system section approach goal project develop support continu improv process health care hospit detail analysi procedur introduc practic ipa year result descript continu improv process figur inform ger control observ author manag protocol ij activ surveil improv tea solut problem solv work assess figur continu improv process hospit depart improv team establish led inform manag idea problem report staff work depart collect improv team store idea memori improv team decid idea problem investig tackl includ member improv team staff affect depart work action plan confirm improv team hospit manag interest mean retriev storag instanti interest publicli access present recent instanti system implement improv team control actual statu implement process inform author final outcom inform manag evalu develop continu improv process time hospit manag involv import expenditur chang organiz procedur process sketch support softwar system implement idea intellig process qualiti manag system gener scenario system present figur includ basic enter improv idea problem statement system develop solut altern includ estim evalu solut altern implement solut altern write protocol shortli summar actual statu implement process control actual cost benefit captur contribut solut busi excel european qualiti award european foundat qualiti manag analyz appli procedur learn experi step system provid support retriev similar problem idea feedback problem idea solut implement control lesson learn solut find solut implement solut control figur process support system implement technic implement system base interest tool knowledg formal interest joint collabor gmbh kaiserslautern implement part top commerci reason tool core part interest interest base case import subobject call concept case object concept combin textual explanatori formal formal attribut retriev standard similar measur figur type hierarchi implement data similar measur instanti german hospit small adapt effort implement knowledg case model heavili base experi ipa made hospit project develop terminolog fulfil requir terminolog formal clarif similar retriev formal inform part includ case addit explan guidelin develop write user system easili understand base current evalu system data type similar measur introduc type measur requir happen formal attribut attribut remov user interfac system present figur system figur show intend usag hospit hospit consortium hospit knowledg base improv team case knowledg base replic knowledg base share hospit consortium hospit share knowledg base main reason share replic knowledg knowledg base confidenti inform shown hospit case share knowledg base configur underli technic infrastructur intranet hospit connect line connect hospit line direct access share knowledg base figur prototyp system hospit improv team improv team improv team improv team hospit improv team improv team improv team hospit figur distribut knowledg intend usag evalu project start septemb end project case base case entri recent project evalu held june qualiti manag encourag result hospit extend juli system daili work end period workshop held discuss experi made system collect improv suggest system present interest peopl qualiti manag hospit feedback system posit comment push qualiti action make activ problem transpar link demonstr step audit qualiti process discuss user evalu workshop end juli show perceiv tool document qualiti work prototyp concern adjust taxonomi data adapt similar improv user interfac work distribut system keyword taxonomi control central person role inform initi set case gener natur consid quicker start system outlook ipa plan detail evalu technolog underli system select hospit plan extend field test mention research goal extend possibl consortium intern architectur enhanc clinic organiz knowledg manag tal organiz memori knowledg knowledg artifact repositori format filter verif knowledg continu feedback updat goal set figur architectur knowledg manag healthcar main shown figur provid support healthcar base continu improv knowledg manag system embodi organiz clinic knowledg critic healthcar organ achiev high import consist incorpor appli wide varieti knowledg type knowledg artifact rang except comput entir system architectur provid flexibl effici mechan learn improv exist knowledg artifact central element architectur figur knowledg artifact repositori compon reflect knowledg storag design hold handl knowledg artifact arbitrari intern complex structur kei versatil mechan formal mean underli system characterist descript captur essenti properti knowledg artifact refer organiz memori provid access type relev knowledg artifact repositori addit form formal characterist introduc enabl similar base access complex reason newli introduc knowledg acquisit mainten task small discuss issu organiz memori facilit support level detail sophist rang retriev relev passiv item case model outcom predict consult knowledg knowledg attach inform describ experi made access item context episod inform annot experi feedback knowledg artifact retriev subsequ consult feedback serv basi knowledg evalu continu improv feedback loop depict bottom diagram figur wai knowledg artifact creat lesson basi knowledg annot knowledg evalu modif continu feedback updat process provid facil evalu subsequ updat exist add knowledg artifact repositori knowledg base establish knowledg verif knowledg artifact elicit subject matter expert ad repositori data sophist data wareh data mine techniqu enabl architectur establish knowledg artifact suitabl transform clinic organ data system built base interest tool system special healthcar experi made hospit project technic extens improv gener knowledg manag applic softwar engin corpor inform network potenti extens interest includ idea data mine popul organiz memori experi cbr technolog interpret gener knowledg integr manual acquir improv knowledg base methodolog induct learn extend interest cbr capabl case base analysi knowledg abstract evalu provid input provid support inform knowledg techniqu collect valuat data includ acknowledg alexand ralf thoma wagner fraunhof institut manufactur engin autom provid qualiti manag healthcar domain knowledg captur knowledg model system architectur develop detail discuss contribut werner anand refer der industri uim foundat methodolog system approach vol march pp evalu reason system springer lectur note comput scienc seri potenti reason experi base construct softwar system busi process support bergmann wilk proc german workshop reason centr learn system reason strategi build learn softwar organ accept ieee journal intellig special issu knowledg manag knowledg distribut reason softwar knowledg proc intern confer reason juli pp hd experi factori encyclopedia softwar volum john wilei manag softwar engin experi proc intern confer softwar engin knowledg engin june softwar knowledg base cbr method lenz proc sixth german workshop reason technic fraunhof institut softwar kaiserslautern concept experi factori implement develop proc eleventh german workshop machin learn technic depart comput technolog page von formal softwar engin ontolog proc german confer system shop knowledg organiz march fraunhof institut softwar kaiserslautern experi factori realiz learn experi softwar develop organ friedrich proc tenth german workshop machin learn page learn softwar engin rough set friedrich proc tenth german workshop machin learn karlsruh von intellig retriev softwar engin proc intern confer softwar engin knowledg engin june autom construct case base proc workshop intern confer artifici intellig juli issu result panel discuss intern confer softwar engin knowledg engin june intern journal softwar engin knowledg engin panel knowledg complic cbr perspect proc intern confer softwar engin knowledg engin june althoff facilit practic evalu organiz memori techniqu accept twelfth workshop knowledg model manag oct
Agents/1140 1 achiev coordin combin joint plan joint learn gerhard institut technisch technic report juli abstract major approach activ coordin multiag system endow agent capabl jointli jointli gener hypothet activ sequenc endow agent capabl jointli jointli action execut basi experi interdepend action paper describ algorithm call plan joint combin approach primari motiv algorithm bring advantag joint plan joint learn avoid disadvantag initi result provid illustr potenti bene ts shortcom algorithm motiv multiag system intellig autonom entiti call agent pursu set goal perform set receiv steadili grow interest research applic past year main reason interest ma capac plai kei role design realiz modern comput inform environ environ tend tightli connect close interact comput requir act ma technolog concept method design realiz environ ma capac plai import role develop analyz model theori interact human societi interact process human aggreg human pure ma technolog explor sociolog psycholog foundat kei issu address deal ma activ capabl carri speci decid activ sequenc carri order accomplish common answer agent jointli gener hypothet activ sequenc kind lookahead order determin jointli plan potenti advantag approach probabl carri activ sequenc low inher approach limit agent knowledg relev individu action goal attain di erent state determin state reach goal state answer agent jointli action execut basi experi interdepend ect jointli learn make approach appeal agent path activ success amount priori knowledg agent equip system design low inher approach requir number learn trial tend grow rapidli number action carri agent work paper aim integr joint plan joint learn singl algorithm bring advantag approach avoid disadvantag basic idea work agent jointli learn inform order evalu hypothet activ path gener plan jointli plan order reduc number uninform learn trial paper structur section describ algorithm call plan joint integr joint plan joint learn section present initi result perform featur algorithm section brie summar pointer relat critic discuss limit algorithm algorithm basic work cycl algorithm conceptu figur gure activ result repeat execut major action learn agent jointli search space futur state action agent jointli decid action carri base plan result chosen execut select agent jointli learn updat estim action activ detail descript simpl notat base elementari assumpt nite set agent capabl carri action ag refer set ac refer set action carri environ agent act state set featur identi ed true agent denot denot real hypothet set featur true case real assum true agent case hypothet tradit strip approach agent associ list action set pre precondit featur ful lled action carri set del featur execut action set add featur true execut action agent assum action carri current state impli state agent featur set awar pre true assum agent maintain action set true featur awar true execut time pre true plan basic idea algorithm agent maintain estim awar ac estim adjust agent featur true action execut agent interpret estim higher execut true valu condit action carri state real actual lan depth maxim lan depth state goal state agent determin applic action hypothet successor state result appli action state state successor ffg agent jointli estim action action agent determin action sequenc gener plan base individu action estim agent select sequenc highest probabl rst action select sequenc carri agent updat estim action base observ ect action execut goto figur conceptu descript basic work cycl algorithm basic action jointli realiz involv agent approach ect di erent featur di erent relev di erent matter agent carri action real hypothet state consid agent state denot figur agent announc action carri agent blackboard commun potenti action agent check uenc announc action wrt action inform announc agent speci assum announc order agent state state arbitrari current version prede ned system design current real state hypothet state hypothet state hypothet state hypothet state potenti action potenti action potenti action hypothet state estim estim estim figur illustr hypothet search space algorithm depth list add del determin potenti successor calcul action wrt ac def add awar del awar call evalu function wrt calcul inform valu add valu inform result estim state def maxf number agent respond rang agent interpret joint evalu function repres calcul distribut agent result start current real state figur expand state plan depth view jointli gener tree potenti futur state arc repres potenti action estim figur illustr interpret action select denot current real assum hf ji def jointli gener plan path path root leaf search agent potenti action transfer successor state estim appli state maxim plan depth estim path de ned sum valu individu action hf def potenti path hf ji select probabl hf hf rang potenti path gener plan mean path probabl select estim path hf ji rst action path execut learn learn realiz jointli adjust estim featur adjust distribut manner agent carri action speci assum select execut real state updat estim true constant call learn rate actual extern reward receiv execut case delai equal updat spirit tempor di erenc learn aim chanc carri action jointli estim high action result extern reward figur illustr updat rule note featur true time execut precondit execut probabl action made featur turn execut probabl result initi analysi seri synthet scenario captur characterist multiag learn plan obtain indic result section present result scenario summar tabl case scenario select process iter action select execut current cycl result obtain scenario er number number number qualit ident present action made featur true add del add true awar pre del jointli estim pre awar true influenc estim subsequ action figur illustr updat rule environ consist featur task solv agent transform start state goal state agent capabl carri di erent action agent carri agent carri agent carri action make task complic agent execut action di er precondit list ect add delet execut action di erent precondit result di erent ect action agent execut action requir featur featur true execut action featur true featur true time true thing analog scenario solut sequenc scenario action agent action agent action agent action agent action agent action agent action agent solut sequenc scenario action agent action agent action agent action agent action agent figur show perform pro le scenario plan depth shown result set goal state reach initi valu estim mean initi behavior learn proce repeat execut trial de ned sequenc basic work cycl transform start state goal state state goal state featur set ff start state ff goal state ff agent action context context context pre del add pre del add pre del add pre del add pre del add pre del add pre del add pre del add tabl speci cation scenario rang start goal state agent action trial start start state initi data point show reward achiev previou averag independ run curv algorithm result clear perform improv time maximum reward close approach di erent plan depth cycl case scenario cycl case scenario result show choic plan depth crucial system perform major observ ect plan perform curv shown figur summar smaller plan depth tend result slower perform curv featur set ff start state ff goal state ff agent action context context context context pre del add pre del add pre del add pre del add pre del add pre del add pre del add pre del add pre del add pre del add pre del add tabl speci cation scenario larger plan depth tend result perform curv smooth earli faster risk plan depth result larg undesir averag reward cycl figur perform curv scenario averag reward cycl figur perform curv scenario observ plan depth critic paramet chosen extrem carefulli experi feasibl neg ect badli chosen plan depth modifi paramet learn rate result ort eventu succe algorithm aim enabl multipl agent achiev coordin activ combin learn plan ort primari idea algorithm learn plan singl algorithm learn evalu result plan plan reduc number requir learn trial algorithm realiz kind primari characterist algorithm learn plan jointli realiz multipl agent kei mechan underli algorithm agent maintain estim featur result report paper show algorithm lead clear improv system perform area multiag system lot work activ coordin joint learn activ coordin joint plan approach combin joint learn joint plan except relat algorithm rst work sugawara lesser basic idea approach enabl agent learn rule captur relev inform order improv local plan reason idea investig context distribut diagnosi system comput commun network approach nagendra prasad lesser central idea endow agent capabl learn coordin strategi set strategi idea implement system call collag extens gpgp framework primari di erenc approach algorithm case agent requir priori possess deep domain knowledg case collag agent requir priori possess sophist coordin knowledg order appropri coordin activ case coordin evolv requir domain coordin knowledg priori agent current form algorithm limit algorithm assum agent perform complet search plan tree restrict plan depth feasibl small larger due commun overhead coordin plan activ number potenti applic action cost commun method heurist enabl multipl agent prune plan tree appli hold applic work solv limit algorithm assum plan depth xed prede ned result desir handl exibl cope limit plan depth vari time start low depth exibl agent learn adopt depth plan experi order understand plan depth system design agent assum agent awar ect agent world model perfect domain ect action agent necessarili carri solv problem commun ect obviou condit cost commun time requir commun process prevent algorithm fail domain signi ect action easi detect cope type limit extend algorithm distribut model diagnosi work relev respect algorithm limit appli directli continu domain joint learn joint plan approach emploi discret state restrict algorithm requir broader research ort wrt learn plan multiag system limit encourag initi result achiev algorithm justifi continu research direct mention limit algorithm start point explor possibl combin joint learn joint plan greater detail current work concentr limit reactiv behavior ectiv combin multiag set acknowledg research report paper nancial support deutsch forschungsgemeinschaft dfg nation scienc contract refer rh crite ag barto elev group control multipl reinforc learn agent machin ks decker environ center analysi design coordin mechan phd ks decker framework environ center analysi design coordin mechan ohar nr foundat distribut arti cial page york eh pg kc integr plan execut unman ground vehicl intern confer autonom agent page eh vr lesser partial global coordin framework distribut hypothesi format ieee transact ks decker vr lesser gener partial global plan intern journal intellig cooper inform ks decker vr lesser quantit model complex comput task task environ eleventh nation confer arti cial page ferber system introduct distribut arti cial intellig john wilei son fike nj nilsson approach applic theorem prove problem solv arti cial georg commun interact plan nation confer arti cial intellig page mj huber eh initi assess coordin system intern confer system page vr lesser model system behavior ieee transact vr xuan design distribut diagnosi system technic report technic report comput scienc massachussett xuan diagnosi integr part adapt technic report technic report comput scienc massachussett ishida search autonom agent multiag system autonom agent synchron multiag plan tempor logic intern confer system page reinforc learn domain autonom mv nagendra prasad vr lesser learn coordin cooper system autonom agent ono learn coordin behavior continu environ distribut arti cial intellig meet machin lectur note arti cial arti cial vol page berlin ohar nr editor foundat distribut arti cial intellig john wilei son le parker learn advanc model distribut plan intern confer multiag system page sugawara lesser learn coordin plan work paper intern workshop distribut arti cial sugawara lesser learn improv coordin action cooper distribut environ machin sen sekaran multiag coordin learn classi er system adapt learn multiag lectur note arti cial arti cial vol page berlin sugawara past plan distribut plan intern confer system page rs sutton learn predict method tempor di erenc machin stone veloso collabor adversari case studi robot soccer coevolut learn multiag system paper aaai technic report page aaai menlo von martial coordin plan autonom agent lectur note arti cial arti cial vol berlin watkin learn delai reward phd king cambridg watkin dayan machin action select learn environ anim animat intern confer simul adapt page learn coordin action system intern joint confer arti cial intellig page editor multiag system modern approach distribut arti cial intellig mit yokoo multiag introduc competit cooper search intern confer system page
IR/1141 5 web bilingu text philip dept advanc comput studi colleg md umd abstract strand independ system automat discoveri text parallel translat world wide web paper extend strand result ad automat languag scale order formal evalu manc recent acquir parallel corpu document mate million word languag introduct text parallel translat valuabl sourc natur languag process method machin translat typic reli larg quantiti bilingu text align sentenc number approach field languag inform retriev exploit parallel corpora place addit ping languag base inform bilingu dictionari landauer hull util sourc bilingu text subject limit usag restrict domain date text canadian sourc simpli exist work support depart contract tract research grant sun microsystem laboratori author gratefulli knowledg comment anonym discuss dan doug assist jeff allen evalu languag pair interest major web content show great sourc multilingu content figur survei multilingu web mate der primarili web rang languag investig server parallel english page link parallel english page found page languag identifi studi michael person continu size trend busi organ cross nation high level competit consum global imposs view content web expand resourc dynam chang content world present confer observ perform inform retriev hurt lexic gap illustr highli topic miss pair static lexic resourc base wordnet observ retriev commerci machin translat gap lexicon make differ tween individu queri present algorithm call candid pair gener pair candid figur strand architectur translat recognit acquir natur design explor web sourc parallel potenti ation base author judgment briefli review strand architectur preliminari result paper preliminari work wai framework extend filter stage automat guag identif elimin import class document structur parallel translat fact languag interest system run larger scale formal english spanish measur agreement independ human recal algorithm scale gener larg number parallel time english ject formal evalu concret end result report ical acquir parallel corpu web document document approxim million word guag strand preliminari section summari strand system report preliminari strand architectur organ begin candid gener stage candid pair document parallel translat figur implement gener stage queri altavista search engin gener page view page page portion anchor text readabl materi string fix distanc anchor text ing string match cess gener good pair point hyperlink read click english sion click spanish bad page tain link english literatur close spanish literatur candid gener stage candid evalu stage repres core filter bad set gener page pair emploi structur recognit algorithm exploit fact web page parallel translat invari similar structur strand figur structur recognit algorithm run document transduc reduc linear sequenc token html markup token text transduc replac html sourc text confer home token number insid chunk token length text count point length text chunk structur filter algorithm complet languag independ transduc output structur filter stage align stream token appli wide dynam program rithm find optim align linear sequenc align match ident markup token identifi run unmatch token exist sequenc mark pair token forc match order obtain align programm diff highlight practic seminar aj fm sw mm thai inch wire code ij ¢ board bell id pm fail de ration le ia ml cn la la de de qm lu pu oat ib pn du au fair du ill de de il cu figur structur similar parallel translat web sibl unmatch candid pair prima faci unaccept immedi filter algorithm extract align pair chunk token match order obtain align comput length text chunk linear relationship length text translat small piec sourc text late piec target medium larg larg appli standard statist hypothesi conclud length reliabl correl accept page pair translat candid page pair filter anonym review observ diff prefer align chunk similar case lead poor align good exist result failur identifi true translat worth investig token equal length reason detail algorithm level select algorithm chang threshold reject due mismatch maximum distanc hyperlink preliminari gener test set date candid gener stage evalu date identifi true translat pair strand identifi true translat recal gener addit translat pair ad languag identif origin strand tional filter stage envisag sibl figur includ depend process automat languag identif comparison align document segment match exist bilingu stage initi avoid order system independ linguist tion stage paramet algorithm determin develop small amount arbitrarili select data load web valu work tice vari valu fix advanc preliminari evalu chang complet test set judgment preliminari evalu found http ol free atr ur lip fiat wt tat figur structur similar page translat conduct error analysi explor characterist parallel web evid process address larg class potenti posit figur show document gener page hyperlink pass structur ter fly color problem acut gener stage yield pair page line catalogu web site larg number page convent structur obviou solut handl make page written guag written order filter candid page pair fail statist languag identif base charact ad system introduc train data languag mild form languag dun shown classifi string order hundr thousand typic text web discrimin languag accuraci high rang languag pair charact languag train materi languag filter stage criterion document dl languag document pair iff english late simpl requir page english page spanish english languag identif form version page charact model languag construct train data european pu initi tic data consortium formal strand languag identif stage run english start top hit yield altavista candid erat lead set candid pair test set item gener annot human pair mark good strand pair pass structur guag identif filter pair filter languag random sampl pair filter structur impract manual evalu pair filter ow time judgment desir depend judgment pair order assess reliabl judg nativ speaker spanish high profici familiar project work web browser access test pair fashion view pair side side judg told evalu system identifi page web translat instruct make pair page intend show materi reader english reader phrase criterion requir previou experi man judg translat found judg frequent unhappi iti translat present requir document pair repres perfect tion good test abil determin translat criterion parallel iti facilit task locat page pair includ corpu qualiti potenti filter judg permit translat translat unabl comput evalu page pair classifi categori man exclud comparison tabl evalu tabl show agreement measur strand individu agreement strand intersect judg annot strand evalu case judg item highest confid tabl show cohen agreement measur correct chanc agreement import tabl human interpret suffici high cate task defin rule classif task gener thought suspect number pair exclud human judgement undecid case judg consid basi comput recal set includ sampl full set evalu extrapol judg set full set order comput figur report estim estim proport page judg good strand judg good judg figur recal estim number pair judg good strand reciev strand mark good ur result read eri document pair includ strand parallel corpu acquir fulli automat fewer pair averag includ error result corpu confid judg strand agreement combin human judgment human judg recal figur true translat pair strand incorrectli ject true translat pair interpret filter process system identifi half pair principl found candid produc tion stage error analysi suggest recal cost make structur filter ignor type markup comput ment presum number translat pair web half larg focu total yield attempt bring number gener candid pair closer section scale candid gener preliminari experi report previou section made altavista search engin locat point multipl languag version text basic mechan easili extend locat case page languag link directli late page languag explor web suggest parent page ling page cover major relationship parallel translat web site bilingu text arrang complet monolingu singl home page ing root page sion site step number gener candid page strand extend permit parent sibl search criteria relat issu futur work altavista queri candid gener stage enabl strand locat page pair index meet search criteria upper bound comparison tabl evalu obtain build web crawler dedic altavista distinguish featur size index user face altavista limit number hit return break barrier featur altavista includ rang date queri select criteria redesign strand ation compon permit multipl queri order search parent sibl queri queri set form set mutual queri base sion queri restrict result page updat novemb novemb solut granular perfect search dai bump maximum parent sibl queri strict queri product candid gener compon der magnitud system run document pair late gener compon produc candid page pair plicat previou experi elimin page pair exact duplic strand structur filter remov candid page languag identif compon remov remain pair identifi good strand consid parallel translat corpu document pair formal conduct fashion previou yield agreement data tabl case human judgment ground system mate recal comparison tabl evalu stricter languag id criterion strand error quickli identifi major sourc error shortcom languag identif implicit assumpt document french assumpt set candid test pair dutch page french languag identif adopt previou section requir dutch page case true problem easili resolv ing exist languag identif nent wider rang adopt stricter filter criterion requir guag meet requir french lead result tabl translat estim yield approxim million word languag count remov html markup reason admittedli languag identif comparison human subject suggest acquir corpu trivial essenti system exclud page natur verifi evalu fresh data id wide rang languag difficult obtain set freeli cmu stochast languag set sun languag id engin demo set languag identifi languag id method previou section train profil swedish paper place acquisit parallel text web solid empir ing number contribut preliminari studi system extend autom languag scale point trivial parallel corpu english french produc complet automat world wide web er lightweight languag restrict languag pair favor strategi includ identif wide rang languag rigor evalu human judg suggest techniqu duce extrem clean corpu mate man requir resourc languag small sampl text train automat languag cation direct futur work ent experi languag common web pair includ inspect web site bilingu text fi strand suggest strategi altavista gener candid pair improv cantli ad true web crawler site bilingu text site uncov pass system altavista engin order magnitud bilingu text web uncov earli stage search natur direct tion parallel text applic lexic acquisit inform retriev effect core strand algorithm align segment found correspond base align markup preliminari experi small amount data suggest standard ical uncov data refer della della statist approach chine translat comput jean assess agreement classif kappa tic comput june mark davi ted dun trec evalu queri translat method text retriev fourth text retriev confer nist ted dun statist identif languag comput research laboratori technic memo mcc mexico state la mexico david hull dougla oard symposium text speech retriev technic report american associ artifici menlo march thoma landauer michael littman fulli automat ment retriev latent semant index sixth annual enc uw centr oxford english dictionari text page page uw centr text ber dougla text retriev research usa delo workshop european research informat mathemat march philip resnik parallel investig mine web bilingu text confer associ machin translat lectur note artifici octob harman seventh text retriev confer nist special novemb http nist html
HCI/1142 4 virtual oper environ explor virtual interfac design simpl vr imag viewer novemb submit partial requir bachelor scienc rhode matthew abstract paper explor virtual interfac design perspect simpl virtual realiti imag viewer applic test varieti produc virtual interfac design refer set virtual interfac design guidelin acknowledg massiv guidanc mike system expert fred studio max colin detect work rhode document team content introduct problem statement introduct virtual realiti research goal document structur relat work virtual interact usabl evalu virtual interfac interfac link virtual interfac method system develop test creation test result perform measur feedback observ imag viewer problem improv result summari futur work origin testb applic realworld abstract screenshot questionnair realworld imag viewer abstract imag viewer data collect kei realworld viewer data abstract viewer data realworld result captur tester feedback tester observ feedback problem program abstract result captur tester feedback tester observ list figur escap virtual builder virtual notepad realworld imag initi view grab book turn page displai imag abstract imag initi view grab ring bring set imag displai imag tester ag perform time comput experi versu perform time virtual realiti experi versu perform time virtual interfac design refer model introduct chapter begin state problem address introduc virtual realiti research goal rest document summar problem statement hardwar combin slowli provid mean softwar system creat creat realiti applic creat softwar system live mimick desktop comput requir develop implement front research focuss human comput link vr virtual interact aim research investig higher level aspect human comput link depend coexist virtual virtual interfac investig aim isol import aspect virtual present set guidelin virtual interfac develop introduct virtual realiti simpl descript virtual realiti abil explor interact spatial environ softwar system power comput creat maintain spatial environ user similar characterist world live combin technolog input displai data user part creat explor interact world user world produc refer virtual present world user combin mechan world function form user interfac normal comput action perform user call human comput interact user vr environ willi term descript highlight vr move comput desktop base domain arena stretch system aim creat world user fulli system system work enhanc normal view world augment realiti paper refer vr impli virtual realiti perspect consid depth vr thought creation layer process person extern sensori input manipul input order enhanc recreat world present person practic undertaken varieti wai common method stereoscop headmount displai input devic glove tracker headmount displai produc slightli perspect environ ey attain stereoscop vision ad depth hmd user world pair track system input world tracker make electromagnet signal track posit orient part system movement glove user arm chest monitor track system glove similar track job measur sidewai inform tracker glove combin state environ comput creat continu world displai user extens situat user share common environ network vr excit part vr research environ present singl user matur network vr requir addit virtual interfac research present system reli person abil block inform focu cue provid enabl virtual environ head mount forget equip part environ formal vr interact graphic combin displai technolog user model direct virtual realiti involv comput creat environ user environ form lack characterist environ user fun product research goal goal research work creation ultim human comput interfac aim investig aspect virtual interfac design includ develop understand natur virtual import aspect interfac design point view improv understand user virtual reason user perform environ formul set guidelin design virtual interfac hope achiev goal observ simpl applic number user document structur chapter relat work area virtual usabl virtual interfac present method applic creation test chapter chapter present result applic test detail fashion collect perform feedback summar context virtual interfac design refer model chapter short summari process includ idea futur work relat work vr research activ divid virtual interfac environ summari relev area virtual usabl virtual interfac interfac virtual interfac develop virtual interact mention larg part virtual interfac design concern method interact implement interfac associ comput special interest group interact workshop discuss give good overview method design virtual interact studi interact undertaken section acm sigchi confer workshop acm sigchi intern special interest group focuss human interact comput system year chi confer involv talk workshop focu theme workshop investig challeng result overview interact focuss part design user interfac summar workshop suggest task perform user interact object creation object select object placement viewpoint control navig percept program design issu includ task virtual environ discuss paper viewpoint control made virtual environ lack detail compar real world counter cue referenc navig process exampl cue landmark horizon textur shadow ad object assist distanc percept requir navig natur visual audio stimul creat basic orient mechan move object direct user attent view similarli natur turn sound suggest user face direct user percept task perform extract cognit inform environ guidelin design environ easili percept inform result result object easili visibl method environ appeal mental user metaphor everydai life comput reduc user cognit load voic gestur enhanc environ perceiv workshop produc challeng problem found interfac metaphor translat action synthet virtual world fulli transfer virtual environ copi design maximum advantag user knowledg everydai object perform wide varieti task singl input devic input devic chosen determin interfac interact model style interact interfac design workshop focuss borrow idea disciplin suggest idea realworld success realworld gener found depend factor physic environ screen resolut displai lag disciplin consid borrow cinematographi industri design conclud view manipul cinematographi light audio improv mood feedback industri design show colour code symbol creat link relat object colour sound skill level user commun environ fundament interfac design appar novic user tend spend time requir easi understand environ feedback expert idea oper give design freedom idea mention interfac design includ exploit user perceptu spatial reason work simpl rule user read label understand object special relev primari mode interact environ shift indirect control widget direct manipul object follow chi chi workshop entitl issu virtual environ held summari outcom publish sigchi websit find relev virtual interfac design summar realism focu virtual realiti research topic workshop realism virtual environ drawback environ slower comput larg amount visual inform hamper perform task thought realism restrict creation experi base support give user abil textur import introduc realism provid optic time light comput pictori materi relat illustr subject focu workshop virtual environ usabl import aspect user navig natur environ surfac extend provid navig support natur normal human navig walk involv movement plane transit normal movement motion found virtual environ prove constraint build usabl navig metaphor system depend user task hand choic depend hardwar design current challeng design navig virtual environ prevent user back object structur creat environ determin usabl structur useabl virtual structur usabl highli expert user usabl enhanc borrow architectur object shape carri inform locat light enhanc orient consist languag virtual environ design discov workshop thought logic structur environ faster learn featur result languag interact techniqu common task dougla georgia institut present doctor june focuss interact virtual environ research entitl techniqu common task virtual environ evalu present design evalu methodolog testb compar techniqu perform lowest level compon task virtual environ methodolog appli task consid fundament virtual interact viewpoint manipul object select object manipul system consid separ context research result testb evalu task produc dataset interact techniqu applic dataset appli applic design anim habitat zoo call vr applic travel task divid compon start orient stop move posit divid veloc veloc control techniqu provid result travel mechan test user point virtual rai light destin homer select object combin hand movement navig relat select map drag posit icon handheld environ extens hand motion move viewpoint measur perform travel techniqu statist analysi travel time total time map techniqu highest homer object manipul extend techniqu base extens arm object manipul techniqu introduc icon movement object select perform travel place rotat map cognit load greatli time map techniqu found steer choic point method provid fastest travel favor user perform techniqu homer techniqu result user discomfort object manipul depend object select treat singl taxonomi task compon manipul travel compon divid produc basic part combin techniqu evalu techniqu produc taxonomi techniqu natur hand manipul object select extens arm techniqu combin techniqu attach manipul user object exist singl plane front provid select attach select object hand perform move hand scale user hand touch object manipul provid object posit techniqu move object linearli movement button posit object closer analysi result testb evalu show select slower similar expect bigger closer object found easier variabl perform mark techniqu number select error object distanc select techniqu show user discomfort experienc hold hand view decid factor perform base choic made displai perform perform found attach manipul variat techniqu interest result time techniqu indirect button press manipul faster direct linear map hand movement suggest speed essenc good downsid user prefer perform obtain select techniqu scale attach techniqu user discomfort select experienc result scale make faster choic applic system shorter period time testb evalu method perform task object select object manipul provid larg set data decid interact techniqu emploi environ test research present set guidelin design virtual reproduct virtual environ interact guidelin gener virtual environ interact assum techniqu base metaphor intuit perform provid redund interact techniqu singl task travel techniqu design make simpl travel task simpl techniqu avoid provid smooth transit motion locat steer techniqu train user strategi acquir survei knowledg techniqu spatial orient requir train constrain user travel dimens reduc cognit load techniqu rel motion task rel motion steer reduc cognit load select techniqu design techniqu speed remot select requir ensur chosen select techniqu integr manipul techniqu design environ maxim perceiv size object manipul techniqu design reduc number freedom manipul applic provid gener constraint manipul aid direct manipul virtual hand tool avoid frequent scale user environ indirect depth manipul accuraci bowman work form part graphic visual usabl center georgia institut technolog institut number research group work relat interfac design visual lab experi virtual environ manipul multivari data tool menu workbench data manipul interfac work tool usabl evalu collabor virtual prototyp simul technolog naval research laboratori virginia polytechn institut state focuss method evalu design virtual environ research center virtual discuss expert heurist form evalu summ present methodolog involv iter expert heurist form evalu method expert heurist test interact design expert user assess system set interfac design guidelin recommend improv made prefer involv develop process research note expert heurist test virtual environ guidelin exist bowman research set guidelin creation aspect virtual environ begin form evalu applic involv collect qualit quantit data iter test program user qualit data form critic incid perform task incid user perform task satisfact interfac qualit result speed number error evalu relat baselin metric type task problem lack compar result virtual environ surfac part summ perform version statist compar techniqu perform task methodolog work involv short cycl heurist form evalu ass design compon interfac summ evalu combin improv compon test heurist form evalu process appli produc optim design system user interact similar heurist form combin made member group assess medic visual virtual virtual interfac virtual interfac design design everydai norman explor psycholog peopl interact thing characterist good design thing guidelin drawn object found everydai notori video equal applic virtual creator design object peopl easili learn crucial design combin knowledg psycholog peopl knowledg thing work provid user good conceptu model conceptu model user mental stimul natur oper design explain user devic hole pair place insert constraint limit function devic fewer possibl make easi user devic pair size hole limit number user doesnt number hole applic constraint virtual map constraint creat map user object natur requir action put hole logic natur conceptu model formul user natur good conceptu design object provid clear idea oper part principl implement complet design feedback feedback user awar state task perform gener good idea concept appli directli design virtual environ design natur object process creat good conceptu model object action map feedback construct georg washington comput scienc depart human comput interact group experi focu exist comput interfac construct virtual environ studi sibert involv empir evalu widget basi virtual interfac work describ current interfac techniqu menu natur improv interfac window world window maintain posit world move user view maintain posit rel object interest form special type categori window implement physic interfac interact virtual window move posit physic devic feedback obtain touch window harp augment realiti handheld physic user select stylu research test window interfac virtual world interest result feedback user interfac task perform time pen tabl metaphor virtual world provid support action ballist action action menu window provid freedom movement made space work environ user gener prefer interfac work user prefer widget view object research introduc interfac techniqu involv indirect method involv user environ result futur virtual realiti system concept techniqu combin direct techniqu aim explor direct method present environ task user thought virtual realiti reach matur stage form comput manipul object primari mode interact interfac link brown scienc technolog center comput graphic visual present interfac devic call virtual interfac link physic virtual interfac provid virtual replica physic interfac devic freedom map point view tactil feedback experienc user interact actual devic repres virtual improv realism experienc research successfulli implement navig object select manipul virtual claim indirect good task exist natur metaphor rang interact tool direct virtual complement exist techniqu creat metaphor user arm tool virtual environ similar project physic interfac research brown doesnt link physic devic directli virtual interfac lego rapid build vr input devic brick mount electron devic design zeleznik found system quickli assembl interact devic solid prolong applic rapid prototyp process suggest good area appli toolkit larger brick physic interact devic ishii introduc concept graspabl user interfac oper top horizont displai coupl virtual act tactil version object handheld devic figur escap virtual figur builder devic robust altern glove stick ii initi version stick simpl handheld devic button attach polhemu tracker button press press signal present combin inform tracker creat virtual hand virtual interfac advanc interfac group manchest focuss build larg scale virtual environ applic system build vr applic similar rhode system work aig concentr intens complet underli realiti creation environ applic world figur virtual notepad citi crowd control algorithm citi interest interfac perspect realworld metaphor level part project bring european institut provid interconnect multipl environ plan project build experi interact user interfac builder applic figur emploi interact devic move environ resiz reposit interest form interact washington human interfac technolog lab research direct aim develop interfac techniqu metaphor hope provid interfac builder guidelin techniqu produc interact virtual environ interest applic develop virtual figur handwritten input virtual environ tablet pen stage research group carnegi mellon develop lexicon interact techniqu lexicon vr widget similarli fade stanlei method research methodolog interfac explor interfac virtual environ center version singl involv process system test test step individu system develop found chi workshop psycholog interact section choic design equip depend vr system research fair common vr setup present system lack slightli rel render implement advanc hope issu avoid base rhode vr setup silicon graphic intern dual processor workstat mb memori input output devic consist gener realiti compani set polhemu simpl glove stick ii section data input devic collect pentium transmit network vr applic run applic build librari rhode vr toolkit albeit setup meant program forc object world lack featur system choic applic develop support text displai option manual textur map imag graphic intens time develop start support textual input keyboard wear headset speech input open sourc ibm product import develop applic quickli test evalu meant ad function requir simpl applic combin factor rhode vr system avoid add special facil applic cover gener rang virtual interfac issu consid result choic build applic manag imag viewer made creat imag viewer simpler thought manag ad enhanc part imag viewer stage manag close associ tradit percept system made attract desir test applic design independ logic comput system born rhode vr special interest code base applic decid develop version real world mimic object everydai abstract move everydai object creativ method interact appendix show origin produc applic hand virtual interact develop system hand action point press movement direct map polhemu tracker attach stick mean select distant object problem object user reach made modifi virtual hand produc metaphor real world builder applic shown section produc abstract version program realworld time consum implement made earli movement applic viewpoint manipul restrict manipul orient user environ move develop result implement simpl short descript applic real world imag viewer version imag viewer aim copi real life action object favour hand interact metaphor world consist room hand pictur book pictur idea set imag held book book remov point displai set imag imag select displai pictur book page turn displai set book return bookshelf abstract imag viewer origin thought abstract imag viewer surfac grid place bookshelf shade block grid select produc plane hold imag network grid surfac envisag start experi wai access system virtual world realworld version develop clear complex chang direct replac realworld version figur realworld imag initi view grab book turn page displai imag imag pictur frame displai dine room move realworld surround spheric room replac user book open book ring board user remov ring cylind produc board show set imag board function book realworld version applic develop applic develop vr guidelin set individu real world imag viewer natur realworld imag viewer implement larger imag figur show initi view environ version imag appendix object simpl object model model textur ad make checker improv depth percept touch wall colour make edg clearer assist depth percept initi view shown figur current imag imag visibl frame hang back wall interact function page turn imag select left open develop choic method shown screenshot initi view figur natur hand work restrict code object action place book remov book turn page book select imag displai frame placement remov book action user move hand object perform grab gestur pick book book move suitabl posit view initi hope turn page book grab edg page move middl book prove reason recognit gestur object sensit detect provid advanc provid clear idea happen point gestur book page turn page turn book loop back set imag work side book made sensit turn page backward forward gestur select imag displai book nice advanc grab imag book throw back press simpl avoid system book grab pictur abstract imag viewer abstract version shown figur creat explain object creat studio max sphere place room enhanc make individu face give sphere checker colour shade similar blue made attempt environ everydai life ring sphere idea slight twist firstli front ring provid posit ring board face forward cylind decor seri parallel red singl green ring top idea green mean imag red lack imag tricki reason cylind bare object ring cylind sensit cylind work red ring forc green ring remov top cylind action perform realworld viewer smaller imag initi perspect figur show action grab bring set imag displai imag frame expert user opinion applic complet experienc vr interfac creator observ provid comment direct mike master student rhode creator figur abstract imag initi view grab ring bring set imag displai imag hand facil ran realworld version comment posit suggest imag open book posit book orient user simpler pictur smaller size displai book book size space environ decid chang book hope open book orient grab book realworld metaphor similar function abstract experi gain develop test decid expert user requir opinion abstract viewer test creation test format test decid combin observ perform measur chosen feedback form questionnair retriev standard tester inform comput experi vr opinion system questionnair abstract imag viewer version realworld viewer questionnair aim questionnair basic applic compar fairli questionnair appendix question focuss gener aspect interfac appar import develop question draw enlighten user main topic question cover object object physic gener attitud test applic averag user run test make part test result hamper averag user consid fair amount comput vr system import function format test consist compar format work seat dark room tracker chair hmd head level calibr calibr record physic posit orient user head initi match initi present user set user comfort head posit match initi displai world stick tracker combin introduc combin stick tracker work hand control control hand movement tracker gestur hand explain goal imag letter point left devic initi environ present book imag viewer pictur displai frame action includ time perform task complet questionnair realworld notic focuss gaze head level small rocket ad user perspect fun check user format carri test test set vari comput vr test applic result tester involv realworld test abstract test stereoscop displai abstract poor displai qualiti imperfect displai view ey counter posit tester realworld viewer male tester rang ag comput experi rang master comput studi experi half tester vr exposur experi form vr system involv develop environ group abstract viewer similar characterist unlik realworld tester femal test group rang ag comput experi comput liter studi comput scienc master half tester vr exposur sort exposur vr experi develop main hint consist tester tester frustrat suggest left book bookshelf ring cylind thought idea leav tester deadlock provid tester posit realworld version tester told face thin part close book forward edg open book nice posit ring made posit board abstract version easier tester struggl told mimic orient red ring cylind obviou tester forgotten press gestur remind tester told place hand center object perform action object tester time sensit high sensit consid result result glean sourc feedback observ chapter summar tester present virtual interfac design result sourc short imag viewer program chapter end summari present virtual interfac design refer model perform measur viewer appendix full version feedback observ data perform measur view imag singl task perform environ task subdivid separ task requir perform imag viewer view imag natur divid find imag displai imag frame tester imag viewer time spent perform subtask record time accomplish point press time gestur amount room error book ring grab immedi happen time minim due experienc book posit time spent includ time subtask tabl viewer grab point press posit total realworld abstract tabl task perform time compar perform subtask realworld version realworld viewer object resembl everydai quicker learn abstract viewer long time grab ring account strang user shi slow abstract point time possibl due fact chang set imag board turn page book logic possibl ring cylind tempt tester search board red imag open board press mean closer slower perform abstract viewer result frustrat user time displai result slower perform time figur tester ag perform time small interfac design larg impact usabl perform case realworld imag book posit slow tester doubl time environ abstract imag viewer ring speed book posit averag time spent posit board abstract viewer half realworld viewer part data record test compar relationship type tester subtask perform time graph figur gener downward trend applic tester ag small ag group older tester displai perform mislead older tester vr comput experi phenomenon argu comput graph figur convinc comput experi relat directli perform virtual environ figur show perform displai relat vr exposur slight perform vr experi notic realworld mark relationship appar abstract inform perform virtual world relat previou vr experi graph hint obviou idea vr experi result vr perform obviou comput experi evalu deeper statist analysi bigger base test subject prove fair evalu perform variabl spatial reason domin hand amount everydai activ user undertak emploi percept figur comput experi versu perform time figur virtual realiti experi versu perform time feedback tester happi test work complaint left made complet task equip setup produc surround hmd stick tracker combin hmd strain ey minut wear glass stick shape hand held press make oper tester note control singl virtual hand low frame rate output system result amount notic hand head movement tester feedback group natur object realworld viewer book colour brown textur similar brown colour tester complain made book hard bookshelf half tester comment relat realism object suggest scale import maintain complain object real label obviou visual orient comment show import object repres virtual copi object everydai life creat design ensur object object lost tester note cylindr holder set imag bit mysteri judg observ avoid hint provid red green ring understand cylind tool experienc problem unusu object cylind virtual environ user experi explain object tester induc user hint colour make unusu object obviou evalu user natur reaction total interfac metaphor explor issu hand note section tester remind hand gestur remind rememb suggest hand action easier term relat hand dai hold grab virtual point obviou correl point real life grab point show turn page book reason explan user prefer grab point press forgotten relat everydai hand action press involv singl surfac palm larg surfac press call gestur press drawn button logic cylind press gestur tester immedi rememb gestur user found hard gestur perform hand number reason hand pass object collid hand hidden view hand singl combin lack depth percept make part hand indistinguish creat singl object movabl part design ensur colour scheme cloud feedback provid object depth percept depth percept import function program tester complain judg depth object observ user battl realiz hand ring top cylind thought high qualiti stereoscop displai improv situat tester suggest clue sound background sound object denot object close hint improv depth percept process depth percept user close hand understand interact improv interact learn time introduct tester introduc system displai virtual environ tester suggest improv voic messag overlai open environ level user report fairli high scale high level averag level suggest improv method introduct mention lead easier system environ abstract low displai awkward head movement brought displai factor hamper believ tricki act measur environ featur environ target improv applic behaviour find orient green disk requir board produc suitabl orient subtl tester ring correct posit notic realiz ring posit red face bring board easili usabl posit correl imag holder grab drop make ring posit mechan easier grasp larg ring displai imag posit manner smaller grab posit unsuit user reposit small show posit larg interfac design carefulli object occur user action easili add speed object easili make object obscur observ inform obtain note tester action test process feedback chapter divid natur collect observ data object tester tend copi object everydai life tester fail grab gestur retri lack physic rule made virtual environ model realiti abil close move object number time attempt grab physic law real world move open hand possibl close hand grab grab involv combin state hand object veloc surfac type situat constitut grab law exist environ virtual real environ appar tester time spent imag viewer program possibl fact hand move strongli suggest hand work real hand fact hand move object relev design expect user quickli familiar deviat realiti hand gestur focuss grab mention feedback grab gestur object world book half tester grab pictur start show displai frame show tester expect gestur perform action didnt expect gestur action highlight possibl familiar hand gestur easier imagin applic gestur user gestur imag start object abstract imag viewer understand frame object relev view pictur happen realworld tester move option possibl indic problem approach area hold strongest visual connect visual focu visual basi applic put user frame mind visual continu logic action tester point imag book altern attempt orient visual continuum meant action perform expect visibl except tester select pictur displai press point frame uniqu attempt action stem user comput action cut past make involv move object text limit workspac refresh user comput type interact natur realworld tester abstract tester check room develop test system suggest front tester stuck didnt program make user feel object initi forward orient behaviour relat unidirect natur normal comput truth obviou imag viewer complet virtual environ user arriv imag viewer room distinct scan room stock tool assum program lai tool fashion logic tester ignor logic approach problem hand result hidden logic develop hardwar softwar virtual environ base logic everydai world attempt avoid separ set logic comput design bear mind virtual environ complet copi real result system base logic realworld copi part environ base comput logic worth system present problem tester obviou action solv move solut present board book tester grab hope frame held fail work solut put board throw board gestur frame system provid imag hope gaug user action queri problem tester sort demonstr tester type system summari idea show kind user interest rememb tester exposur current comput system tester claim comput exposur exist system approach proactiv tutori introduct video demonstr walkthrough show entir system capabl suggest larg portion suggest involv singl object lead virtual book question mark question mark object user perspect desk corner gestur invok visual system version metaphor audio form suggest object emerg telephon invok audio system short period time solv make visual system load space audio system good provid topic object audio system provid user judg recent action perform suggest special gestur object result messag object capabl audio similar popup form suggest messag displai object touch gestur nice idea room displai textual diagrammat relat user imag frame displai touch special gestur idea wizard geni stand room point object action perform highlight function object similar speech recognit softwar add interest possibl system design command issu produc form combin input virtual interact devic voic command provid audio visual object interest observ test situat tester desir obviou exampl tester put book pictur frame tester attempt throw entir book frame opportun program give user hint achiev entir book collid mechan user press imag displai frame system made friendli turn easi wai delv inform imag viewer problem improv section problem experienc idea improv suggest tester discov test process realworld viewer grab book nice open posit program left program maintain level analog easili improv program built improv forc board face displai board immedi book select improv posit abil place book posit realworld book improv abstract ring make front top provid book posit copi highlight problem design copi realworld metaphor tester prefer frame posit closer good poor resolut displai move alongsid user free space bigger frame book complex detail imag hard insid open book bigger larger imag frame hidden board tester struggl posit frame board space work problem give user abil size object viewer good extend provid user choic object nice set object creat save creation possibl vr displai imag book board implement simpl mention earlier page turn improv natur page turn work direct user suggest displai page number total number page show problem complet copi realworld vr metaphor inform immedi visibl real world row book shelf book pictur pick virtual environ exact inform user made immedi visibl put pictur indic spine virtual book pictur shade pictur show book pictur virtual world featur facil found everydai metaphor copi realworld inher restrict test program imag viewer perform function good applic point view main reason make good space provid environ design entir program make abil environ program tile form sort shape user simpl gestur part mass imag provid choic view set imag graphic intens suggest wai view imag virtual realiti tester creat galleri user move user select imag larger displai displai head movement chang current imag left movement chang set imag suggest nice idea magnifi glass tool carri held pictur displai zoom version metaphor object form action form interact figur virtual interfac design refer model thought book board replac rotat polygon entir set make page turn unnecessari interest note select imag doesnt manner result idea move hand book select posit hand map posit book movement hand move map book gestur select imag touch map grab gestur hand posit book grab wouldnt book object work map book immedi obviou make quickli learnabl solut kind idea usefulli appli menu object displai text environ result summari section design perspect present summari result featur aspect virtual interfac import creat environ appar test process combin aspect interfac design view virtual interfac form action combin metaphor physic percept provid divid object form form suggest individu form object aid design place situat environ attempt give design good frame mind concentr suitabl context action event chang environ encompass user system action divid part interact action partit work section common task broken basic compon design basic higher level action part process envelop user system form action produc virtual interfac design refer model shown figur design model frame refer virtual interfac creation process frame refer context summari result object form visual basi virtual realiti make design choic object object form care object lost colour textur object cloud feedback provid object import object move experi gestur hard distinguish object relat object everydai object add speed action virtual slow learn obviou object place program situat explicit design hint object colour make work object easili deduc object creat interest environ anim interact easi grasp hold sort logic progress word obviou connect exist initi form object make applic easier master ring placement abstract imag improv obviou link initi ring result board perfect interfac user environ reach problemat practic applic present user problem approach solv problem gener begin object hold form close problem tester realworld viewer regularli start imag frame didnt immedi understand metaphor form form object environ design forget form object creat collect entir environ design orient aspect entir form surfac test attent paid space environ poor space imag viewer book board obscur view imag displai improv gain move frequent part direct space interact object applic improv redesign make user abil depth percept import virtual realiti awar rel posit object fundament system stereoscop displai hint checker improv gener percept depth lower level object hint distanc interact tool trick shade insid room improv depth percept area environ interact viewpoint manipul techniqu imag viewer simpl movement head result equal movement orient virtual perspect techniqu user advantag lead suggest present set object room hint user carri environ object scatter user front user imag act spark explor environ object select hand provid rememb hand interact object close user advanc interact object emploi improv imag viewer note test user treat gestur interact program gestur common everydai familiar forgotten show easier rememb facet interfac directli relat everydai design applic action action creat combin interact perform task environ design understand relationship user action visual continu action expect attempt test attempt action action notic record user expect gestur action depend tester action task type object common user expect action pattern understood built design understand probabl reaction system import design deviat natur expect object situat pitfal highlight suggest user ignor construct design environ select imag book board improv map hand show construct design metaphor interfac form action provid virtual interfac metaphor user obviou realworld attempt realworld viewer problem metaphor experienc problem mention chi workshop section inabl transfer entir metaphor virtual world experienc imag viewer tester found hard gestur occur real environ displai imit real world problem experienc real world limit inform restrict virtual world base virtual displai inform user mention imag viewer exact copi real world environ inher easi grab perform time realworld viewer show advantag metaphor easi adapt result captur relat virtual interfac design design expect user quickli familiar deviat realiti design virtual interfac account user initi understand underli comput base part logic applic virtual form action combin metaphor paper present evalu user version simpl virtual realiti imag result set satisfi research goal section investig aspect virtual interfac develop understand natur virtual interfac design perspect improv understand user virtual interfac formul set guidelin design virtual interfac natur user attribut user perform measur characterist explor section simpl graphic analysi perform measur record test conclud seemingli obviou posit relationship user vr experi task obviou lack relationship comput experi task perform thought larger test wider varieti tester proper statist analysi requir valid likelihood thought refer model introduc section displai good develop understand natur virtual interfac basic idea virtual form action combin divid result object action metaphor import aspect interfac design natur section strong set aspect collect test includ object chang object depth interact techniqu issu choic visual construct metaphor choic result evalu process present refer model serv set guidelin virtual interfac satisfi project goal sound knowledg natur virtual interfac fundament guidelin separ part model describ natur virtual interfac part explicitli instruct produc weaker set design guidelin futur work mention deeper statist analysi correl user perform user interfac section suggest closer user react total interfac chi workshop mention section site consist languag virtual environ design logic structur faster learn featur base construct virtual environ form mathemat prove interest applic test order add improv design issu guidelin present design refer model lead develop virtual interfac design refer framework hold inform form action aspect situat virtual relationship form action man turn half librari make samuel johnson refer zeleznik lego interfac acm symposium user interfac softwar technolog implement virtual realiti system technic document rhode novemb techniqu common task virtual georgia institut june techniqu virtual technic colleg georgia institut technolog evalu techniqu grab manipul remot object virtual technic colleg georgia institut technolog interfac constraint virtual environ applic technic paper visual usabl colleg georgia institut technolog issu virtual environ interfac chi octob escap homepag gw lai foundat graspabl user interfac toronto dynam graphic ntt human interfac lab alia research base select virtual environ technic nsf scienc technolog center comput graphic brown evalu method assess usabl medic visual san van challeng sigchi octob design evalu visual virtual ieee virtual realiti paper issu virtual realiti august human interfac technolog lab virtual web base version draft jl usabl empir studi user interfac virtual technic institut comput georg washington builder languag center design everydai interact nonlinear map direct manipul acm symposium user interfac softwar handwrit hit conjunct hiroshima start paramount tv realiti interact rhode virtual realiti special interest group hierarchi overview gener interfac real virtual march stage research mellon advanc interfac group escap virtual virtual environ manipul analysi multivari data virtual realiti special interest group rhode comput scienc gener virtual realiti interfac real paper present realiti uk quicktim virtual realiti simpl vr mit inform system back januari mm virtual technic depart comput brown march origin testb applic small applic test aspect interfac design varieti user simpl navig imag applic provid good rang interfac principl program realworld form abstract form realworld user environ model everydai surround shelf hold book page quickli select displai pictur frame figur figur sketch realworld applic select plan thing simpl avoid part interfac select book imag hand grab move relev place page book grab blank part page abstract form user symbol disk space amalgam view grid network view node grid landscap figur show sketch network view amalgam view larg singl disk space block click block grid bring imag select imag displai frame similar frame realworld figur sketch abstract applic select realworld version simpl select block node grab hand pictur frame envisag user move collect node disk space grab node possibl separ movement widget hand understand human comput link basic interact grab place move network give idea wai simpl oper environ interfac comparison drawn real world drawn imagin abstract associ switch form ad provid mechan test import part oper environ insight control applic gain mechan move view abstract version program movement imag grid book provid interact matthew march screenshot figur press imag book figur point turn book page figur grab book figur book case figur press imag board figur point set imag board figur grab ring figur ring sit cylind questionnair realworld imag viewer virtual realiti questionnair usabl evalu questionnair program test aspect virtual realiti system answer question test run choic mark block option suit question dont feel oblig answer inform treat complet enjoi virtual experi background section ag sex give short descript comput skill comput scienc master virtual realiti system give feedback section enjoi imag fun thing iv week letter displai imag minut scene present start dislik suggest introduc easili forget environ real easi feel easili easili improv feel feel object dai life contribut feel contribut contribut experi problem discomfort physic stick ii hand menu pictur frame room long hand menu pictur frame room problem experi hand menu suggest wai object hand menu pictur frame room good provid experi imag wai suggest view imag strang interact comput imit usual strang easi transit transpar interact absenc visibl comput monitor distanc close headset displai serv constant remind interact normal setup transpar vr setup transpar object gener feedback section comment comment test input evalu matthew abstract imag viewer virtual realiti questionnair ii usabl evalu questionnair program test aspect virtual realiti system answer question test run choic mark block option suit question dont feel oblig answer inform treat complet enjoi virtual experi background section ag sex give short descript comput skill comput scienc master virtual realiti system give feedback section enjoi imag fun thing iv week letter displai imag minut scene present start dislik suggest introduc easili forget environ real easi feel easili easili improv feel prefer object mimic thing everydai present object everydai object experi problem discomfort physic stick ii hand red board ring tube pictur frame long hand red board ring tube pictur frame problem experi hand red board ring tube suggest wai object hand red board ring tube pictur frame room good provid experi imag wai suggest view imag strang interact comput imit usual strang easi transit transpar interact absenc visibl comput monitor distanc close headset displai serv constant remind interact normal setup transpar vr setup transpar object gener feedback section comment comment test input evalu matthew data collect kei head mean comput experi vr experi time point press action po time posit object tot total time init satisfact initi environ imm level experienc contribut realworld object mimic prefer mimick realworld object distant notic rocket background tabl kei head perform data questionnair comput experi liter equiv equiv equiv honour master prof tabl kei comput experi virtual realiti experi exposur partial vr system exposur partial vr system exposur full vr system vr develop tabl kei virtual realiti experi realworld viewer data ag sex grab po tot init imm tabl realworld viewer data abstract viewer data ag sex grab po tot init imm mimic tabl abstract viewer data realworld result captur fifteen peopl vr experi level rang experi develop test imag viewer idea lot problem room improv program questionnair section section numer result record test section issu appar observ tester test program bug make gather result time uncov issu wouldnt notic section deal test tester feedback number bracket alongsid comment show agreement number tester object problem grab book nice open posit half tester battl book easi object realism rememb gestur hand textur insid give cover menu written front make posit easier ensur realism make scale object wrt correct improv object hand improv shade part make easier smaller move wall closer object label identifi problem movement orient hand tricki similarli object select maneuv problem provid told room problem suggest provid virtual assist request explan popup object touch notic board room displai user tester suggest similarli pictur frame notic give inform request user action gestur emerg phone object link audio system similarli object button link separ system messag voic react action give contextu introduct user system improv suggest improv put alongsid user anim open environ good transit quickli darken object part room make easier user world function show bound box attempt grab detect work bigger thumbnail pictur book avoid problem posit open posit select work restrict book solut face correct user provid indic total number page current page number suggest wai move zoom environ stereo displai improv depth percept map posit hand open select imag move hand move map select gestur map pictur polygon select page sound improv feel background ambient sound accompani action suggest wai thing experi displai environ arent real life magnifi glass tool bigger version cool custom displai put glass displai larger version world stage quak appar tester environ faster equip tester experienc problem head mount displai uncomfort doesnt rest nice wear glass ey stick ii ergonom control singl hand hold darker door stai open organ commun tester watch sgi suggest improv make stick bigger shape palm hand mount hand tracker directli stick creat tracker calibr face virtual hand forward tester observ feedback feedback glean observ tester tester nervou thing hand straight grab book open vr user uncertain tester interest situat tester assum hand couldnt pass spent pictur book open perspect summari observ tester page backward tester tend stick button object wasnt grab point gestur push gestur forget tester grab pictur book open expect book touch press pictur frame move book frame place rememb select press frame shelv book tester expect gestur work object interact pictur frame hand posit start edg book face forward open correctli gui turn face tester move head forward closer object imag user pictur room problem program detect sensit detect meant occur part object collid make assum gestur action good detect easi select object book grab book book shelv book select posit posit book tester made time action discoveri harder program posit open book posit close book held posit close book hand grab tidi set explicitli drop bug time book drop didnt open tester pick carri program restart im broken thumb thumb movement wrong direct hand mention gui found irrit abstract result captur full feedback observ record abstract imag viewer realworld result number bracket alongsid point agreement number tester tester feedback tester feedback divid follow gener interest comment tester vr experi expect feel insid interact directli disk problem experienc tester thought system explain tester gestur tester set good idea introduc user test hope learn system explan clearer instruct includ tester thought depth percept made hand move type feedback give depth clue comment visual judg distanc stem lack stereoscop displai introduct system suggest voic textual messag smooth user system high depth unfamiliar environ distract distanc rang sharp possibl tester experienc world displai low resolut hmd object gener didnt sharp test organ replac femal serv voic lead system introductori wizard improv process environ awkward movement system progress long lag bad viewer resolut object problem frame closer visibl board doesnt honour face board number hard determin function tube green disk orient tester match orient red tube board good bit subtl room larg ring tower bit obscur write shelf made suggest improv garden scene nice background ring tube orient improv provid clearer pictur board text ring made easier object improv displai resolut problem object movement manipul hard manipul board hard orient board interest percept ring tube tower issu surround detect hand object hard press imag rememb gestur hard current gestur user reaction question happi explor told improv demonstr applic watch tester discov system suggest wai provid video demo function hand popup object hand touch book question mark constantli visibl question mark desk corner act wai system vocal command activ form wizard geni charact point object requir special gestur object produc descript equip object capabl demonstr improv suggest wai improv program object provid clue function tactil glove displai resolut enhanc foreign abstract object base object tradit interfac comment comput liter tester sound feedback sound action user movement system suggest wai dont board face user expert user suggest board orient suggest wai screen front user displai imag head movement left chang pictur head movement chang set pictur galleri user pictur select closer pictur rotat cube pictur face suggest build applic user abil move equip feedback head mount displai ey latenc problem due poor frame heavi easili forgotten stick ii insensit button grip oper uncomfort hold stick press cabl block easili isnt notic hmd polhemu tracker tightli hand control hand movement easier due requir tracker make hand control due displai stick tracker combin feel hand tracker suggest improv hold stick hand combin stick tracker tester observ summari tester observ test process tester good room tester lost straight cylind ring tester thought frame start problem tester ignor approach situat expect system tester work gui slow faster gui rush thing hand pass object couldnt term tester unsur grab ring pretti quickli assum drop board point seri attempt reveal pictur tester time tester notic chang angl point continu attempt happen tester experienc ey tester index thing tester tend gestur gestur mid air tester put board frame touch grab letter displai grab imag frame throw board frame tester expect object perfect tester thing thing window observ notic page turn obviou board tester expect happen line sight board frame
ML/1143 6 guid oper genet algorithm base optim khale comput scienc depart rutger nj usa algorithm extens domain mean global optim simpl reliabl manner chanc global optima method converg local ga tendenc moder close optima small number iter close ga larg number optim close local optima small number iter paper describ crossov oper design endow ga abil comput gradient sacrif global optim oper work guidanc member ga popul select direct explor empir result engin design domain demonstr oper significantli improv steadi state error ga optim introduct genet algorithm search algorithm mimic behavior natur select ga attempt find solut problem maximum gener collect potenti solut problem mutat recombin solut gener current set potenti solut process continu accept good solut found ga advantag search includ abil deal qualit type continu variabl discret quantiz variabl variabl domain continu domain local search method algorithm tend advantag abil extrem close local optima small number iter ga larg number iter close optima ga higher probabl reach global optimum method classic approach solv dilemma ga optim run local search method complet optim approach problem problem decid ga reach good region thought basin attract global optimum case highli multimod region small run local search method time select point final ga popul problem local search method suffer paper present crossov call capabl improv steadi state error ga optim distanc point found global optimum search continu gradient inform method demonstr merit oper ga optim realist engin design domain domain explor section design repres number continu design potenti solut vector vector space determin qualiti point involv simul comput relev physic properti artifact summar singl measur merit simul amount rang fraction dai gradient extrem comput tabl lookup high search space make difficult method high reliabl demonstr util guid crossov set benchmark domain engin design optim studi skolnick remaind paper present detail descript oper present number experi oper realist engin design task conclud paper discuss relat effort futur work ga architectur ga research detail al hirsh individu ga popul repres parametr descript paramet continu interv fit individu base sum proper measur merit comput simul takeoff mass penalti function relev legal limit permiss oper appli element popul select scheme select perform rank actual fit function wide rang fit valu penalti function rank select prevent discov point domin popul steadi state ga model exist point popul replac newli gener point replac strategi replac strategi fit proxim point ga goal select replac point low fit close point introduc ga stop maximum number evalu exhaust popul complet lose practic converg singl point search space ga architectur includ screen modul hirsh hirsh mainten modul turn sm save time prevent ga evalu point close encount bad point learn techniqu maintain prevent ga evalu candid point extrem close evalu point attempt restor oper sever loss detect earli stage optim section describ crossov oper detail guid crossov guid crossov work candid point select ga popul normal select rule call candid candid point select ga popul point ga popul candid quantiti mutual mutual euclidean choic maxim mutual candid point fit current ga popul candid candid swap make candid point higher fit result crossov point line join candid candid select random small region candid result candid candid uniformli distribut random number interv function number iter total number iter gc examin direct form join randomli select candid point point current ga popul direct rank base contribut give object function move end point rel distanc end point direct rank small step direct vicin end point magnitud step ga optim progress guid crossov oper crossov oper ga greedi natur substitut crossov oper fraction time current random choic made iter gc convent crossov oper probabl gc linearli maximum number iter maximum maximum extern paramet default intuit guid crossov endow ga close optimum advantag claim method ga costli comput gradient potenti evalu highdimens space quantiti mutual rank direct serv crude form gradient calcul entail singl addit evalu fit result evalu ga oper appli design problem modern engin design conceptu design superson transport design case point fit candid effort forc point end optim local optimum tabl aircraft paramet optim paramet exhaust converg length exhaust diverg length exhaust extern length exhaust engin size wing area wing aspect ratio taper length effect structur wing sweep design mach angl wing taper ratio fuel width superson missil benchmark engin design domain note merit competit optim approach respect tradit optim method domain demonstr research effect crossov oper ga ga behavior demonstr merit guid crossov ran experi guid crossov guid crossov guid crossov replac heurist crossov oper heurist crossov oper similar principl guid crossov heurist crossov oper work parent fit newborn random select uniformli interv heurist crossov view simpl version guid crossov section discuss result domain superson transport aircraft design domain concern conceptu design superson transport aircraft summar briefli detail al figur show diagram typic airplan automat design softwar system ga attempt find good design mission vari aircraft conceptu design paramet tabl continu rang valu ga evalu candid design multidisciplinari simul current ga goal minim takeoff mass measur merit commonli aircraft industri conceptu design stage takeoff mass sum fuel figur superson transport aircraft design system rough approxim oper cost rough approxim cost build aircraft complet mission simul requir cpu time dec alpha desktop workstat aircraft simul model base implicit explicit assumpt engin approxim numer optim human domain design paramet set correspond aircraft violat assumpt physic realiz simul detect fact reason set constraint introduc safeguard optim process violat penalti function approach incorpor effect constraint violat penalti function ad takeoff mass return simul result sum quantiti optim minim serv fit assign point ga specif penalti function simpli larg constant multipli evalu figur effect guid crossov aircraft design domain sum amount constraint violat violat constraint presenc constraint induc partit search space mutual unevalu point repres design violat model assumpt simul complet simul process produc inform point larg fictiti takeoff mass gener object function evalu point repres aircraft type extent model violat moder simul complet work report constraint violat inform penalti function ad takeoff mass return simul account model violat feasibl simul succe evalu mass point violat occur process penalti function point ten random popul point popul ga proce iter iter denot call gc time heurist crossov replac gc result experi shown figur graph plot measur merit point found number iter curv repres averag run ten start popul solid curv repres averag ten run default paramet includ guid dot curv repres averag run heurist crossov dot curv repres tabl inlet paramet optim param definit initi cone angl final cone angl axial locat throat radial locat throat axial locat end cross section intern lip angl ej height end constant cross section fk height begin constant intern cross section averag run paramet adjust guid crossov figur gc improv steadi state error domain fact hc averag final improv intermedi perform ga search perform run gc gc hc superson missil inlet design domain concern design inlet superson missil summar briefli detail al missil inlet design mix compress inlet mach feet altitud minim manufactur cost inlet techniqu boundari layer bleed variabl geometri perform inlet reli sole aerodynam design rigid extent extern intern contract inlet start throat throat shock train diverg simul domain program call develop unit technolog research center inlet tool al design paramet continu tabl coordin term axial radial posit object optim minim total pressur quantiti commonli measur perform inlet aircraft experi consist ga run guid crossov heurist crossov replac guid start random initi popul domain popul consist random individu popul ga proce iter iter denot call evalu figur effect guid crossov missil inlet design domain tabl benchmark domain domain dim constraint inequ result shown figur plot measur merit pressur function iter number figur demonstr amount improv stage optim realiz guid crossov benchmark domain problem introduc eric phd thesi engin design optim research benchmark recent experi involv domain report skolnick ga packag call numer optim packag call compar domain domain repres sampl origin ran experi domain minim problem properti benchmark summar tabl column tabl show problem number thesi unabl comparison domain unbound variabl evalu figur effect guid crossov benchmark problem evalu figur effect guid crossov benchmark problem column show problem dimens number design variabl fourth column show number inequ equal constraint sixth column show optima problem detail descript domain detail descript experi compar optim domain found paper focu studi effect guid crossov perform experi perform random start popul domain run gc hc replac gc time gc result shown figur figur clear gc enhanc perform domain final perform gc exclud benchmark problem final analysi run setup find feasibl point unabl qualit comparison evalu figur effect guid crossov benchmark problem evalu figur effect guid crossov benchmark problem evalu figur effect guid crossov benchmark problem evalu figur effect guid crossov benchmark problem evalu figur effect guid crossov benchmark problem perform gc stage optim domain final comparison final remark crossov oper continu space search present result demonstr merit oper domain aircraft missil inlet design benchmark engin design domain research effort appli genet algorithm engin design optim problem varieti includ control system design architectur civil engin design al vlsi design mechan design deb aircraft design al effort includ innov ga oper crossov oper contribut lot improv ga optim idea step prove power direct select join line point ga popul line interest idea creat direct combin line plan explor method futur acknowledg aircraft design gene invalu assist research member haym donald keith research partial support nasa grant part project support advanc research project agenc depart contract bibliographi chapman genet structur topolog design complianc topolog simplif journal mechan deb robust optim design techniqu mechan compon design evolutionari algorithm engin page al andrew don smith model knowledg guid design space search fourth intern confer artifici intellig design al john vladimir thorsten genet engin design problem evolutionari algorithm engin page david goldberg genet algorithm machin learn al sobel inlet design analysi final report report kundu ai control system design paradigm design fourth intern confer artifici intellig design jen genet algorithm channel rout vlsi circuit evolutionari zbigniew michalewicz genet algorithm data structur evolut program al nakamura multiobject genet algorithm multidisciplinari design wing platform journal skolnick powel skolnick genet algorithm engin design optim constraint intern confer genet page morgan juli hirsh khale haym hirsh learn improv design optim seventh intern confer genet algorithm morgan hirsh khale haym hirsh learn select design optim artifici intellig analysi al khale haym andrew genet algorithm continu design space search artifici intellig elsevi scienc khale genet algorithm continu design optim technic report depart comput rutger januari phd gener form evolutionari approach evolutionari algorithm engin page eric util nonlinear program algorithm technic purdu phd thesi al don mark khale andrew doyl knight high perform superson missil inlet design autom optim aiaa symposium multidisciplinari analysi optim
Agents/1144 1 intellig mobil agent program intersect java prolog paul tarau depart comput scienc north texa po box texa abstract infer engin network logic program intend flexibl script tool glu knowledg process compon java object distribut applic thread coordin local process associ search base term unif variant basic synchron mechan thread control tini interpret script languag base subset prolog mobil implement captur order continu compact data structur remot high perform server knowledg process compon internet synergi featur make conveni develop platform distribut build intellig autonom agent applic latest version intellig mobil distribut java base logic program linda remot mobil code introduct paradigm shift ubiquit comput brought number challeng requir wai deal increasingli complex pattern reactiv mobil comput entiti care unforeseen optim flow offer person view end user requir natur lead emerg agent program increasingli sophist infer autonomi logic program intend flexibl script tool glu knowledg process compon java object network applic thin client environ support multipl control mobil infer suit develop intellig mobil agent program support synchron transact latest version high prolog system abil gener code standalon execut acronym read java infer engin network statu network agent program equal good reason basic user view base simpl agent borrow mud thing repres prolog basic tree record constant variabl instanti tree place process run comput server compon listen port blackboard compon synchron linda remot predic call mobil code oper agent collect thread execut set possibl spread set place execut remot local transact coordin agent thread mobil visit multipl place bring back result variabl bind linda oper state behavior agent distribut network place form dynam prolog linda fact typic hierarchi place agent built thread move place express complex agent behavior modular number mobil thread wait data satisfi constraint eventu produc remot blackboard local thread serv state current place provid pattern agent wait local blackboard place abstract content protocol differ processor code base depend applic requir kei softwar architectur engin give transpar access underli java thread implement local lazi eager answer collect oper implement prolog dynam oper term local linda oper basic control construct sourc level infer engin run separ thread cooper easi flavor linda coordin protocol remot local dynam updat synchron provid top basic linda oper fulli garbag collect data advantag java automat memori manag built portabl java lightweight consist set interpret run separ blackboard local process socket base network layer kei featur implement compact packag combin build block trim syntact subset multipl asynchron infer engin run separ share blackboard commun engin simpl linda coordin base associ high level network oper code mobil remot straightforward translat packag program java class abil load code directli web show parti web document control applet context browser backtrack assumpt implement overrid undo support assumpt variant prolog definit grammar coordin distribut compon synchron local remot thread mechan built top coordin framework associ search implement unif base pattern match mobil code oper place melt scalabl network form interconnect world synergi mobil code linda coordin implement blackboard oper implement local thread local blackboard interact remot blackboard thread simpli move place locat proce local interact network compon code separ linda coordin code kernel oper remot express commun coordin put blackboard wait object match blackboard read list xs match blackboard run thread execut goal local default remot place fetch list match term backtrack altern solut network note block oper block easili emul term emul deriv oper put term blackboard instanc work return failur match term absent effici blackboard produc reader xs internet consum world fig basic linda oper program engin process organ launch multipl interpret engin state engin abstract produc stream solut creat comput start call goal instanc handl uniqu java object denot assign thread kill engin answer engin note answer instanc pattern pass engin creation engin engin virtual garbag collect process engin simplifi prolog backtrack independ stack trail comput answer answer copi engin master engin initi extract answer engin base monitor object synchron produc consum answer stream answer reach simpli fail resolut process engin discard time stop avoid cost backtrack case singl answer show extract solut call start execut goal thread crete term form return answer synchron thread perform special monitor object extend monitor answer easili implement specul execut bound number answer comput advanc answer collect emul easili iter oper note lazi variant design introduc concept lazi list implement special tail engin overrid default unif call engin instanti tail empti list advanc agent coordin blackboard constraint natur extens linda enabl agent constraint solv select match term plain unif implement wait wait term constraint remov result match blackboard oper constraint singl goal list goal execut server notifi notifi term block client wait match constraint trigger execut client issu blackboard constraint fact suggest stock market applic linda trigger atom transact data verifi simpl arithmet inequ requir repeatedli term network put back client verifi constraint hold server side implement check blackboard constraint match occur incom data head suspend thread constraint check basic index mechan avoid useless comput mobil client thread perform oper atom server local oper back result server side fragment show implement wait notifi match pattern constraint hold note time head wait match incom bodi interest explor memo reduc overhead termin constraint check left programm thread affect loop server integr improv implement technolog blackboard constraint solv rise challeng open problem incorpor symbol constraint reduc fd interv dramat improv perform larg scale problem build basic agent program construct agent behavior implement easili term synchron linda oper mobil code simpl chat part standard window reactiv channel listen window select channel publish implement front end associ abil gener pattern reach user interest instanc publish unrel channel reach listen channel pattern unifi stock market agent compon trigger match bui transact run background thread parallel bui oper thread set blackboard constraint wait constraint solv true sell transact server side mobil code server side local oper note multithread design thread launch blackboard constraint solv abil notifi note multipl market implement provid semant local agent send mobil thread describ network level abstract mobil express obviou slow prolog process java base system nativ method simplest prolog process includ dynam librari java implement latest version gener usabl applet nativ method invoc remot achiev transpar mobil code state comput mobil oz distribut program make object mobil mobil entiti state live code mobil live code call comput mobil requir interrupt move state runtim system site resum execut hard complet imposs achiev gener magic telescript agent program ibm java base aglet luca cardelli obliqu pioneer implement technolog achiev comput mobil live code mobil case comput mobil express lift devic live thread migrat faster remot cpu intens work back result back linda simpl ensur atom secur complex network transact agent code move site follow exist secur access possibl larg back result simpl oper transport comput server back client simpli wait comput bind solut propag window mobil thread back window server case return comput proce end transport continu note mobil comput express effici remot predic call move execut server futur comput current branch return instruct remain continu back compar real time execut speed queri time send remot task move full comput server execut requir network commun note pair cut nondetermin transport segment current continu avoid transport state stack implement complex multipl answer return tediou distribut backtrack synchron strong programm simpli collect solut remot side explor local backtrack return mechan deal case remot queri mutual bring wine principl login password mechan remot includ mobil code combin comput mobil open door experi secur mechan problem mutual protect mobil agent host host agent protect host agent basic simpl achiev build sandbox code interpret java sandbox filter instruct local file oper forbidden protect agent inject malici continu execut return basic open problem sketch solut deal problem languag interpret comput static decid execut static predict interpret halt arbitrari code main idea mobil agent bring interpret give host static check sandbox complianc note suffici condit interpret sandbox compliant reflect call builtin provid sandbox static ensur protect host malici agent protect mobil agent brought simpler run unpredict interpret provid host presenc order agent check properti futur comput execut potenti malici code note bring inspir restaur canada appli avoid pai bring subtl side effect custom mind system base resourc attack interpret made run thread host server mechan case mobil return continu unifi left natur propag bind comput remot continu malici action attach visit host agent make secur check mechan static detect host contrari impli malici host solv halt problem applic domain client server script abil intend support platform vendor independ bidirect connect net integr effect infer technolog develop year field logic program mainstream internet product iter bring plain english script languag compil line speech base connect microsoft agent counterpart geni high prioriti task left grow commun potenti target base lightweight rule base program assist custom web base tv mobil cell phone car requir knowledg compon adjust increasingli sophist user expect stock market simul implement base featur user programm intellig agent plan connect real world internet base stock trade support fetch filter web page kei featur recent port support similar network model higher engin transpar mobil remot predic call linda transact project show logic program languag suit basic glue eleg cost effici internet program abil compress function tini packag show build logic program compon integr emerg tool java practic mainstream recognit widespread logic program technolog emphasi function express integr multithread hint prioriti import futur logic program languag design sustain growth insur style develop similar linux recent netscap client product acknowledg support nserc group special de phil veronica bart ed don armin stephen yu zhang fruit interact relat implement test refer mud bharat cardelli applic annual acm symposium user interfac softwar nov cardelli mobil ambient technic cardelli mobil comput vitek mobil object system programm page lnc carriero gelernt linda context ciancarini enhanc coordin modular mechan languag ciancarini proc int conf coordin model volum page april springer li assumpt grammar process natur languag fourteenth intern confer logic page mit de tarau prolog technolog virtual world page apr de tarau extens prolog softwar practic jan ibm aglet black mobil emerald system acm transact comput februari collabor hypermedia system www comput network isdn tarau logic program virtual world nov keynot address tarau advanc program extens guid technic fall backtrack state linear affin implic assumpt grammar jaffar concurr lectur note comput scienc page dec tarau de virtual world brokerag netscap de workshop logic program tool internet sept van brand mobil make transpar distribut practic manuscript quick introduct start applet latest version applet enter queri applet displai result prolog consol style lower window command line consult read memori file program replac similarli predic shorthand accumul similarli file interact open shell window java window window enter command window activ window server window window commun word return result queri window talk talk server cin command remot execut queri start unrestrict server start password protect accept remot predic call mobil code default run accept limit set linda oper form sandbox understand command client multipl thread synchron remot execut queri natur java server larger applic commun prolog client client server secur oper perform login password facil support comput mobil command transport execut client server execut instanc trigger execut faster server number print remot determinist restrict segment current return valu comput local backtrack client side combin show implement code mobil determinist remot execut segment current limit express follow demo link web base applic
DB/1145 3 tempor match uncertainti ahm school comput scienc canada greg scott princ edward island pe canada abstract tempor match problem match observ predefin tempor pattern templat problem applic includ medic tempor work examin sourc uncertainti tempor match present probabilist techniqu perform tempor match uncertainti techniqu appli problem find onset infect introduct tempor match process match limit set observ tempor evolut pattern order identifi stage evolut determin onset tempor evolv pattern sequenc tempor evolut tempor match consist sequenc observ map observ time point pattern set tr set time point measur rel pattern onset time set tempor evolut state defin tr set observ turn defin ae ta ta set actual time point measur respect arbitrari time origin tempor match problem find match map tr ta obtain pattern instanc consist tempor match applic diagnosi physic system tempor match check tempor constraint identifi failur pattern fuzzi tempor match algorithm determin onset infect medic diagnosi techniqu identifi matur technolog analyz relev patent entri rate comput probabilist stochast techniqu appli track move object human form tempor match daili live determin observ angl direct sun consist motion pattern observ match observ pattern approxim deduc time note tempor match work differ match tempor aim find instanc match tempor queri result coincid work bidirect persist view special case tempor match discuss bidirect persist consid simpler evolut pattern persist fluent work organ section examin sourc uncertainti tempor match section present probabilist approach problem section show appli solut problem find onset time infect remaind section introduc tempor match evolut pattern state variabl time shown figur time ob variabl shown figur variabl reach level state tempor match observ tempor pattern ob figur tempor pattern match observ start evolut time start note observ level occur pattern match observ level instanc pattern start time uncertainti tempor match absenc tempor match formul constraint satisfact problem tempor constraint network repres tempor pattern graph node correspond state edg correspond tempor constraint tempor constraint set interv indic durat separ state network test set tempor assign consist find match correspond find tempor assign observ state case pattern observ uncertain case constraint satisfact techniqu yield result sourc uncertainti ffl pattern pattern exhibit tempor uncertainti state uncertainti pattern exhibit tempor durat separ consecut state persist state uncertain probabl distribut repres time state figur pattern exhibit uncertainti state pattern reach probabl ffl observ observ uncertain time reflect state certainti ffl low sampl low sampl rate make imposs fulli reconstruct observ pattern observ sampl rate number match threaten effect tempor match ffl repeat pattern includ repeat observ state inform prefer situat add state definit addit attribut discrimin similar state ffl pattern amount histor data limit abil accur infer pattern probabl distribut ffl pattern cross valid group match pattern properli match observ figur illustr fact presenc observ state determin pattern onset time desir case assign probabilist belief match state state transit probabl state probabl probabl pattern time transit probabl repres probabl move state pattern time onset interv consist onset interv observ onset interv observ time time time figur onset interv consist observ obtain intersect onset interv deal limit uncertain persist tempor match limit uncertain persist defin observ time ta tempor pattern limit uncertain persist requir find probabl match pattern rel time tr consist constraint satisfact formul discuss observ limit match restrict set interv timelin solut satisfi observ li intersect interv figur show intersect interv consist observ pattern observ uncertainti detail call pattern variat line describ pattern figur band envelop band defin pattern onset time observ interv set intersect set onset time consist observ set onset time obtain candid improb state probabl identifi improb state transit probabl identifi tempor evolut tempor match problem solut condit similar met condit probabilist evolut pattern term state transit probabl avail set empti valid observ valid state compat intersect pattern time onset interv empti pattern observ belong singl pattern occurr combin pattern addit assum process markovian transit probabl depend previou observ independ probabl sequenc observ time state sequenc jx jx tempor pattern match requir perform learn phase match phase learn pattern probabl distribut acquir data match observ assign pattern time tempor pattern acquisit train set assum consist sequenc time stamp record record describ state member train set time time measur respect onset time acquir tempor prior probabl state time probabl transit state state evalu transit probabl captur probabilist persist probabilist chang tempor match algorithm set observ tempor pattern algorithm aim find observ match pattern identifi pattern time observ state set pattern onset time form identifi pattern time onset time assign prior probabl equal probabl state pattern time intersect set onset time individu observ evalu probabl distribut time point obtain set onset time consist observ onset time transit probabl estim likelihood reach observ state start onset time probabl pattern start onset time progress observ state obtain algorithm evalu posterior probabl onset time observ tempor match algorithm appli problem find onset time infect find onset infect medic diagnosi indic person infect individu danger individu pregnanc test measur recent infect high concentr test measur routin screen pregnanc common countri diagnost guidelin develop organ canadian determin recenc infect combin standard test ig test interpret test result complic collect late pregnanc statist infect data pregnanc difficult obtain obviou ethic health reason studi involv establish time primari show larg varianc immun attribut factor strain sever quantiti infect individu variat women studi durat rang week year test result obtain data prepar due small number individu limit number group test result level linear interpol extrapol obtain addit data point calcul state transit probabl lack intern train data unit test data unit conduct data prepar phase result test dataset consist test result patient evalu perform tempor match algorithm clinician classifi data infect infect uncertain inconsist tempor match algorithm estim probabl onset compar onset time week concept determin infect probabl rang consid uncertain case test gave conflict result label inconsist tempor match algorithm clinician case make case clinician found uncertain program correct case tree induct algorithm fine tune rang uncertain class determin test found test patient program perform program reach rang acut uncertain latent total clinician acut uncertain latent total tabl tempor match result tabl tempor match algorithm miss case clinician acut clinician latent case uncertain case classifi acut latent necessarili misclassif infect acut latent respect date case classifi acut algorithm consid latent clinician algorithm uncertain case consid latent clinician work present method approach tempor match uncertainti approach reli markov model probabl perform quantit match approach appli problem determin onset infect result obtain compar system custom built perform task onset tempor match algorithm present view probabilist extens constraint satisfact solut transit probabl weak constraint solut probabl distribut set valu variabl tempor match select solut base likelihood acknowledg research author support natur scienc engin research council author dr friedrich dr michael provid test data refer tempor constraint network artifici canadian societi immun common question diagnosi manag child scholl handl tempor group queri tempor object model seventh confer knowledg manag probabilist region persist european confer symbol quantit approach isard blake condit densiti propag visual track intern journal comput develop specif infect women journal clinic octob patent analysi strateg inten patent record competit intellig tempor distribut symptom technic volum lectur note artifici intellig tempor distribut symptom diagnost applic artifici intellig dechter process disjunct tempor network artifici method deriv time onset infect find method inform chang causal theori probabilist tempor reason journal theoret artifici
Agents/1146 1 drive agent agent approach tactic drive autonom vehicl traffic simul thesi patrick delft technolog faculti inform technolog system januari graduat dr dr prof dr ir prof dr patrick januari drive agent approach tactic drive autonom vehicl traffic delft netherland faculti inform technolog system knowledg base system group artifici intellig autonom tactic drive traffic microscop traffic simul trademark sun microsystem corpor trademark borland corpor trademark gener magic trademark lego group trademark properti respect owner pictur autonom guid vehicl ect termin port drive agent simul program develop part project thesi copyright patrick prefac prefac thesi describ research graduat project knowledg base system group delft head prof dr research kb group involv trail research head prof dr ir trail school research infrastructur report make contribut area project project report start year ago suggest supervisor leon studi intellig agent autonom drive vehicl urban environ give thought work graduat project start read agent autonom vehicl analysi phase enthusiast subject decid design model drive agent design method evalu develop research simul techniqu studi traffic simul clear develop agent model traffic simul separ entiti function model system agent design expand type drive behaviour simul type driver spend time search suitabl simul test decid creat prototyp simul program result li form report report overview report part part describ theori project function short introduct intellig system part describ design implement drive traffic simul simul creat test agent part project evalu present appendix report paper drive agent microscop traffic simul paper function extens summari report make report access knowledg comput program difficult term concept explain glossari found end report part design agent difficult grasp peopl program confid larger part report understood famili friend comprehend work time acknowledg leon guidanc advic project enjoi weekli andré van stefan rob van de advic number program problem proof read part thesi christian van der comment part report special due famili friend moral support patrick januari summari summari autonom vehicl reduc solv problem traffic emiss lot interest autonom practic applic limit sensor technolog expect drive support system introduc market gradual evolv drive task time ultim drive support system fulli autonom intellig vehicl autom drive task present gener model intellig agent control autonom vehicl environ intellig agent entiti capabl environ act intellig base percept drive agent perform drive consist drive select achiev object control intellig agent control simul vehicl traffic simul expand function drive agent simul drive style ensur fast reaction drive task divid compet reactiv behaviour rule set behaviour rule deal aspect drive urban environ agent implement test prototyp traffic simul program simul model traffic light control vehicl vehicl simul control drive agent agent equip set behaviour paramet simul individu driver preliminari experi shown agent exhibit behaviour rang slow care fast aggress drive iii tabl content tabl content prefac chapter problem drive task intellig autonom traffic traffic test studi human project drive agent report part theoret background chapter intellig sensor object rang posit driver support autonom guid research techniqu autom highwai system save project chapter intellig histor agent definit agent properti agent type agent agent advantag chapter system interact cooper knowledg queri manipul languag agent commun languag knowledg interchang format tabl content chapter build agent construct process knowledg reason knowledg base program languag java architectur subsumpt architectur part design chapter drive agent design choic global sensor commun control planner behaviour rule avoid inform overload agent chapter dynam drive agent traffic exist driver driver type import drive agent influenc drive task chapter drive agent vi build implement choic motion sensor implement user simul environ implement drive agent interfac dynam behaviour tabl content part result chapter evalu reason sensor inform activ behaviour drive critic remark improv drive agent type agent behaviour chapter futur autonom appendix implement detail object agent behaviour appendix glossari appendix paper vii chapter introduct chapter introduct subject studi intellig agent control autonom vehicl applic traffic simul section problem set explan term concept tactic drive intellig vehicl traffic simul section describ goal project method reach goal section overview structur report problem set automobil view greatest invent centuri netherland travel car countri number higher decad drawback car appar problem accid happen fatal consequ estim drive accid human error drive problem emiss car affect environ unsolicit manner scientist suspect emiss slowli heat automobil intensifi dramat traffic jam common expect mobil peopl continu trend grow internet method attempt solv problem exampl dedic variabl messag autom system netherland autonom vehicl driven intellig agent reduc solv problem mention intellig drive agent control vehicl human directli control comput make mistak user programm problem distract intellig vehicl drive safe reduc amount accid recent studi shown intellig driver support system road capac reduc traffic jam occurr expect fulli autonom vehicl road capac research proven vehicl produc time emiss normal drive intellig drive agent make speed vehicl remain reduc total amount emiss intellig drive agent found traffic comput program simul traffic flow traffic simul studi traffic effect human drive behaviour intellig agent simul drive behaviour individu individu peculiar drive style vehicl traffic simul behav simul interact driver studi drive task drive traffic great extent matter deal incom sensor inform adjust speed vehicl perform drive sourc inform chapter introduct driver observ environ notic vehicl traffic sign watch polic drive fast drive base observ driver driver inform vehicl car show fuel oil temperatur driver inform engin exhaust cognit abil skill driver inform sourc base experi common road user anticip situat happen driver learn drive case knowledg drive inform sourc exampl includ radio traffic servic variabl messag sign give inform current traffic situat drive task separ hierarch structur oper level highest strateg goal determin rout plan base goal year commerci system system driver enter destin onboard comput direct destin global posit system tactic level deal select achiev object driver primarili deal road traffic system vehicl road behaviour dictat current influenc goal set strateg level actual action perform driver form lowest oper level drive involv control vehicl steer car control typic action includ steer shift gear lot research strateg oper level requir tactic level complic perfect control system found date tabl drive task type knowledg strateg tactic oper navig control slip student driver unfamiliar area car ici road lesson choic pass car drive unfamiliar familiar rout car commut travel negoti familiar road intersect corner drive task divid type knowledg perform task distinct made perform tabl perform driver opposit perform driver perform highli task automat perform classifi driver experi task time predetermin set rule appli prove success process rule rule action carri automat task element perform simultan driver handl speed time watch vehicl experienc driver student driver find difficult chapter introduct distinct automat control behaviour automat behaviour parallel independ peopl unawar process control behaviour serial workload awar process intellig autonom vehicl discuss field artifici intellig deal definit term discuss present reader mean intellig specif mean intellig relat autonom vehicl defin intellig abil entiti perform task intellig reveal behaviour human good problem solv machin tool invent fifti year human make aspect possess knowledg world work knowledg integr part intellig appli definit vehicl intellig case subtask drive perform task vehicl equip knowledg drive intellig vehicl drive human direct autonom practic case car possess bit form navig system driver find driver control car decad autonom guid vehicl appli automat transport materi type vehicl adjust environ function ideal intellig autonom vehicl drive road special modif exist infrastructur traffic simul traffic simul common traffic test studi human behaviour drive traffic analysi infrastructur improv costli improv carefulli evalu impact traffic flow comput traffic simul form method make evalu simul evalu modif normal hypothet situat difficult creat real world simul model accur model situat predict outcom traffic simul todai macroscop mathemat model describ flow vehicl model deriv fluid dynam treat vehicl advanc model differenti vehicl type vehicl treat equal vehicl type real life type vehicl driven kind behaviour make traffic flow unpredict microscop call element model interact local element element individu result traffic flow emerg behaviour simul microscop simul model traffic flow realist macroscop simul note thesi term autonom vehicl intellig vehicl denot chapter introduct test algorithm traffic simul test control algorithm intellig vehicl accur test algorithm put vehicl potenti danger situat obviou reason real simul safer cheaper traffic simul kind good simul design test drive algorithm simul highwai intellig vehicl algorithm simul al studi human behaviour drive simul studi human drive behaviour simul consist larg screen show simul environ control person steer wheel exampl research topic area includ evalu road evalu electron behaviour assess driver train simul cov drive simul cov drive simul project descript goal project studi intellig agent control autonom vehicl applic traffic simul agent autonom entiti capabl environ act intellig base percept emphasi agent perform drive distinguish drive agent agent step creation intellig vehicl design gener model agent control type vehicl equip agent drive style model individu driver traffic simul main focu research agent drive simul vehicl urban environ choic urban environ made difficult scenario drive agent work citi lot unexpect event happen agent deal situat drive agent drive agent form intellig control system autonom vehicl agent inform sensor vehicl agent make base inform made assum requir sensor signal process technolog reach high standard sophist applic note realiti discuss detail section sensor interfac comput sampl sensor cover report navig system assum drive agent order system special plan navig agent agent reli explicitli commun vehicl capabl function autonom difficult develop system work perfectli deal easi expand adjust agent adapt made function ad agent complet redesign agent function chapter introduct special modif environ environ surround exclud intellig vehicl control simul adapt flexibl intellig agent make ideal model type vehicl drive style microscop traffic simul project studi agent driver part equip agent varieti behaviour drive style design agent test simul studi exist simul reveal usabl simul suitabl publicli made creat simpl prototyp simul program show possibl drive agent phase project tabl tabl gener overview phase project studi analysi agent technolog autonom vehicl design gener drive agent model studi analysi traffic design dynam agent behaviour design traffic simul prototyp implement simul prototyp program implement drive agent simul test implement evalu result report structur structur report chapter show intellig vehicl work exampl intellig vehicl todai chapter discuss concept intellig agent system chapter continu discuss intellig agent design implement techniqu design intellig drive agent present chapter chapter show made design order creat type agent driver traffic simul chapter discuss implement simul program test implement drive agent chapter discuss result investig chapter recommend present part theoret background part chapter intellig vehicl chapter intellig vehicl chapter describ intellig vehicl present applic introduct section section briefli explain sensor technolog intellig vehicl section form intellig vehicl appli todai section exampl applic studi introduct field intellig transport system deal system appli control technolog improv oper transport network part intellig vehicl equip control actuat intellig vehicl capabl perform part drive task sensor process inform environ send data control system control system intellig reason task determin action current situat action user form messag relev inform figur messag observ sensor control system figur basic layout intellig vehicl transmitt actuat messag user vehicl lot interest applic intellig practic rare lack suffici fast reliabl control system human abil understand behaviour dynam entiti observ predict impact drive task effort autom reason process turn complic due larg amount circumst program short amount time determin correct action sensor technolog advanc imag process recognit difficult slow usag hard determin type exact posit difficult condit intens snow make constraint work environ partial lack good sensor technolog autonom vehicl magnet strip road enhanc navig disadvantag adapt feasibl make introduct intellig vehicl public road costli process safeti import issu compani introduc intellig vehicl quickli market technolog prove public accept accid intellig vehicl appli extens test chapter intellig vehicl part peopl dislik idea public accept chang intellig vehicl introduc larg scale main reason train human technic legisl chang order determin case accid involv intellig vehicl imposs produc softwar issu regul clear requir met drive intellig vehicl public road due problem mention expert field expect autonom vehicl appli public road decad subtask drive autom intellig driver support topic discuss chapter expert assum continu develop driver support system mean autom vehicl drive task gradual time sensor sensor primari convert transform inform subject measur electron signal job sensor system pinpoint exact posit rel intellig possibl determin import properti size orient inform intellig vehicl requir data gather sensor exampl wheel fuel level object recognit object recognit task determin posit natur object perceiv camera object recognit detect road pedestrian road sign camera step process determin posit interest object separ imag background call segment step actual identif object deal assign label class segment object object compar model object pose object imag determin process pictur time call process reduc error process compar result process multipl subsequ pictur process object track determin speed move object problem object recognit difficult process due problem illumin weather partial motion camera viewpoint rang detect sensor sonar finder measur distanc angl nearbi obstacl sonar laser send signal reflect back object distanc object measur base time send receiv signal angl object determin check signal return demonstr figur part chapter intellig vehicl intellig vehicl vehicl distanc object figur rang sensor return distanc angl object object measur time delai send receiv signal hard produc reliabl data signal reflect back surfac approxim angl signal beam object flat surfac sharp edg reflect direct aircraft work reflect back beam strike surfac reflect back sensor case time delai correspond physic object norvig due problem sonar finder short proxim oper adapt control system sensor rang order human observ good visibl condit posit wheel vehicl equip wheel encod measur revolut wheel base odometri provid estim locat accur express rel previou locat techniqu call slippag vehicl posit error wheel motion accumul posit global posit system measur posit earth approxim metr differenti gp beacon posit combin gp system driver support system driver support system driver give partli drive task rang driver support system vari pure inform system complet system driver support system inform system instal type car buss system alarm driver hit park back inform system rout navig system driver support system drive task adapt control call intellig control acc function normal control capabl maintain distanc vehicl ahead slow car prevent set acc sale luxuri passeng car driver support system intellig speed adapt automat reduc speed vehicl drive local speed limit unlik mention system isa requir commun vehicl suitabl inform sourc sourc traffic sign emit signal onboard inform system combin global posit system isa oper recent experi test isa netherland angl chapter intellig vehicl part autonom guid vehicl commonli vehicl exhibit intellig autom guid vehicl refer autonom automat guid vehicl design convert guid wire ceil factori wire move ceil floor induct follow electromagnet field produc gener optic system track line paint tape floor drawback electromagnet optic system inflex vehicl stai rout lost induct guid wire guid system recent equip advanc navig technolog laser microwav ultrason camera vision system advanc gener develop navig drive freeli common applic todai factori transport good materi europ combin termin port automat stock crane automat transport ship ect odometri magnet identif point ground navig frog compani develop ect built shown figur transport peopl airport area figur airport research centr traffic transport delft start autom guidanc order intellig effici ect work project call dutch abbrevi underground logist deal transport flower underground research techniqu fulli autonom exist techniqu applic research phase current sensor technolog enabl creat lane tracker follow road clear visibl research automat control led vehicl capabl autonom car put techniqu singl applic research applic vehicl highwai reason highwai form easi predict environ consist part chapter intellig vehicl separ lane exit entranc sign speed limit direct chanc unexpect event happen highwai lot smaller urban environ reason gain vehicl autom highwai expect larger environ netherland travel highwai year focu research develop chang techniqu full autom belief earli year fulli autonom vehicl short period turn expect contribut driver support system high exampl intellig vehicl research project autom highwai save project autom highwai system autom highwai system concept larg number intellig vehicl improv highwai capac reduc traffic accid vehicl enter ah human control success intellig vehicl switch comput control vehicl travel high speed reduc reach destin point human driver regain control vehicl compet design ah support idea lane ah vehicl lane comput autonom vehicl share road intellig vehicl reli protocol establish commun dedic smart vehicl capac vehicl drive close train approach advantag smart vehicl appli road special modif drawback intellig vehicl compet drive uncontrol traffic human driver technolog demonstr prototyp ah test track san diego year ago similar demonstr held netherland unclear ah capac improv traffic flow estim lane capac factor oppon argu procedur fast congest autonom land vehicl neural network system artifici neural network autonom robot navig project dean pomerleau carnegi mellon artifici neural network simplifi model brain consist element call neuron capabl learn basic network architectur singl feedforward neural input neuron output neuron output layer linear direct vehicl travel vehicl road prevent collid nearbi obstacl output unit repres straight unit left centr repres sharper left turn train imag camera mount drive vehicl action human driver drive autonom speed environ vari pave road road environ cooper carnegi mellon project call hand research comput system steer time drove chapter intellig vehicl part pittsburgh san mile robot institut figur bit mislead vehicl follow road research handl throttl brake save project effect assess driver state vehicl control emerg work prototyp temporarili control save system design situat driver fall incap safe control vehicl save equip make system constantli monitor driver alert driver wrong detect steer car safe side road stop domin view literatur gradual chang present car base absorpt slowli intensifi introduct smart separ system intellig avoid system navig system step combin individu longitudin system system combin longitudin control system follow dedic lane ah section introduc expect process year introduct fulli autonom vehicl capabl drive dedic lane year part chapter intellig agent chapter intellig agent term buzzword comput softwar program short histor background agent section section discuss agent section describ commonli found agent type section agent classif present short overview applic section chapter close discuss advantag disadvantag agent section histor develop mccarthi selfridg develop idea call intellig agent flexibl system carri detail comput oper receiv advic human term system live work comput carl hewitt refin idea interact concurr execut term actor comput agent mail address behaviour actor commun carri action actor object encapsul intern state respond messag similar object distribut artifici intellig distribut artifici intellig studi distribut coordin knowledg action environ multipl entiti dai divid distribut problem solv solv problem divid work number cooper knowledg share modul node system studi coordin group autonom intellig agent late system emerg subfield dai dai research ma delib agent symbol reason model cooper coordin agent research began investig method possibl result increasingli wider rang agent type growth internet advanc artifici intellig larg amount attent intellig agent receiv coupl year agent sophist peopl internet agent directli program indirectli search engin agent expect peopl agent futur agent entiti act behalf carri task assign agent effort tediou spell agent understand natur fashion agent context request good agent account peculiar user specif situat expect agent commun agent cooper move place chapter intellig agent part place agent exist todai sophist softwar program agent exist physic robot agent definit concept field artifici intellig term difficult defin definit research work subject fact word refer wide rang comput definit research work agent intellig agent comput system situat capabl flexibl autonom action environ order meet design wooldridg agent entiti state view consist mental compon choic agent program capabl initi form construct plan commun respond appropri event directli control human mean agent connect portrai user describ program characterist anim defin agent refer compon softwar hardwar capabl act order accomplish task behalf user umbrella cover rang specif agent definit refer aspect commonli found adapt abil task hard qualiti program entiti classifi agent shoham phrase state make hardwar softwar compon agent fact chosen control mental shoham mean program agent decid agent definit research field synonym distinguish kind agent exampl person person autonom crawler gener agent oper real world call agent oper internet refer spider crawler agent user perform task program act behalf user call person agent person assist comparison made agent object program languag main differ agent consid higher level concept actual implement detail agent hidden neglect sophist object autonom thought intellig agent properti defin agent describ properti characterist ideal agent possess order intellig wooldridg part chapter intellig agent agent perceiv environ capabl perform action base percept abil perform action constant guidanc user agent determin problem solv act initi agent capabl adapt adapt gener regard import characterist intellig agent agent learn prefer improv experi agent interact cooper agent human order carri complex task handl activ agent capabl commun agent human express commun languag languag resembl speech act gener regard import properti wooldridg norvig abil agent move system access remot resourc meet agent capabl show charact emot inferenti agent act abstract task specif prior knowledg gener goal inform agent explicit model situat agent agent simpli act perform behaviour initi wait told make suggest user individu world agent model extern world agent reproduc evolv adapt chang surviv skill main research topic artifici life softwar agent design applic agent outlin agent internet pass ture test gener consensu artifici intellig commun intellig agent creat agent type type agent creat base properti agent possess agent type construct properti mind delib agent delib cognit agent agent possess explicitli repres symbol model world make symbol reason process agent perform action predict outcom base knowledg dynam world evolv delib agent goal explicit plan reach goal reaction action decid action perform instruct appendix explan chapter intellig agent part negoti agent resolv conflict disadvantag delib agent reason process problem intellig reason superior agent type reactiv agent reactiv call reflex react rule current state environ perceiv sensor symbol model environ incap happen main advantag reactiv agent robust fast fact pure reactiv agent memori sever limit simplic function behaviour sign intellig agent complex pattern behaviour emerg interact multipl reactiv agent delib reactiv agent agent classifi combin approach figur figur control system spectrum interfac agent interfac agent cooper user accomplish task function person assist interfac agent interfac user comput program observ interact user program learn interact user program interfac agent design train teach multipl user work interfac agent capabl learn adapt habit prefer user patti design identifi wai learn interfac agent observ imit user receiv posit neg feedback user base perform action receiv explicit instruct user agent advic interfac agent offic assist found microsoft offic program part chapter intellig agent mobil agent agent migrat machin call mobil agent work environ mobil agent popular distribut inform retriev telecommun network rout reduc constant commun central comput remot system inform agent inform agent popular type agent inform agent found internet design manag growth inform provid user request data search internet specif filter sort exampl inform agent internet agent compar price product sold onlin store mobil agent call spider crawler search index web page comput regard special type agent work migrat comput multipli goal spread infect comput system alter delet comput data process heterogen agent combin agent type lead heterogen hybrid agent system heterogen agent common agent commun languag protocol commun cooper discuss chapter agent classif wide rang agent develop make difficult agent definit agent classif research approach dimens ax measur mobil demonstr figur al mobil script mobil object servic interact applic interact data interact user asynchroni static mobil agenc agent intellig agent expert system prefer intellig plan reason learn figur scope intellig agent defin intellig mobil agenc refer autonomi agent repres user applic comput system intellig deal abil agent knowledg abil solv problem hand agent chapter intellig agent part mobil move system network dimens ad dimens easier franklin graesser classif approach base biolog taxonomi live tree structur shown figur structur expand easili type biolog agent autonom agent robot agent comput agent softwar agent artifici life agent agent entertain agent figur franklin agent taxonomi classif found agent literatur nwana dimens classifi softwar ideal primari agent exhibit ideal primari attribut learn cooper agent classifi static mobil reason delib reactiv section inform process control internet combin secondari tempor abil fail mentalist emot qualiti collabor agent smart agent cooper learn autonom collabor learn agent interfac agent figur part view agent typolog base ideal primari attribut note distinct agent figur strict collabor agent emphasi cooper autonomi learn impli collabor agent learn interfac emphasi autonomi learn cooper agent equal object realiti part chapter intellig agent agent applic applic agent fall simplifi distribut comput act intellig resourc manag problem solv distribut case agent solv local problem commun agent locat move network agent autom process overcom user interfac problem current user interfac static agent flexibl run search filter oper deleg task schedul adapt situat exampl applic domain agent industri applic process control archon manufactur traffic control commerci applic inform manag filter gather inform electron commerc busi process manag medic applic monitor inform exchang learn user learn comput entertain virtual charact comput rang firm activ work agent technolog broad list grow includ small compani gener delft real big concept intellig agent receiv interest telecommun british telecom research work agent comput mobil phone network advantag disadvantag clear agent ideal peopl perform task task complet advantag agent flexibl agent learn adapt situat person agent agent adapt prefer abstract agent form good abstract function correspond gener idea peopl smart autonom comput program part agent replac function chang interfac human replac complet agent similar improv agent user adjust agent good reason system resolv situat case error misunderstand possibl agent work parallel agent work speed execut task chapter intellig agent part advantag true intellig agent agent technolog import role plai develop comput applic agent built techniqu number drawback common applic system control global action chosen agent determin local state realist agent system complet global knowledg mean agent make solut domain global constraint maintain time sophist agent function longer agent reach make difficult complex agent function environ learn agent substanti amount time learn learn task peopl agent task mean agent function agent clear time complex hidden user order trust individu comfort idea deleg task trust individu accustom confid notion autonom softwar wide user gain confid agent work behalf legisl user held malfunct matter resolv part chapter system chapter system system form multipl agent combin perform task section show approach section describ agent work solv task requir kind commun subject section introduct system system agent interact accomplish cooper coordin action mass approach part field distribut artifici larg influenc field biologi artifici life research mass mechan creation agent accomplish complex task work concept intellig agent revolutionari glanc inform autonom behaviour adapt control successfulli applic differ agent combin techniqu form intuit creat smart applic idea call sum part larger book societi intellig found central collect behaviour larg group interconnect entiti group simpl highli complex intellig emerg result interact care select behaviour applic mass import fall agent directli model action behaviour individu simul environ simul call microscop denot level individu collect group robot cooper accomplish task individu robot coordin action order bump ma team robot plai soccer work score goal team robot world creat team plai attempt promot ai intellig robot research program mass comput capabl possibl order provid flexibl user cooper interfac negoti agent behalf user distribut problem involv situat agent solv problem mention problem agent distribut homogen agent appli solv distribut problem send heterogen agent solv central problem robot creat industri chapter system part interact interact occur agent form dynam relationship influenti action agent interact seri contact contact agent indirect mutual environ direct interact interact agent occur send messag interact place mutual environ commun interact situat classifi relat object intent agent incompat relationship agent resourc skill agent achiev goal situat shown tabl tabl type interact goal resourc skill type situat compat suffici suffici independ compat suffici insuffici simpl collabor compat insuffici suffici obstruct traffic compat insuffici insuffici coordin collabor industri incompat suffici suffici individu competit incompat suffici insuffici collect competit team incompat insuffici suffici individu conflict resourc incompat insuffici insuffici collect conflict resourc cooper coordin tabl situat ma agent cooper cooper improv agent resolv conflict surviv capac cooper perspect case agent cooper compat goal agent agent cooper good cooper extern point view agent cooper observ cooper behaviour group agent decid coordin problem question agent agent inform agent resourc limit coordin form cooper behaviour consist extra action order manag group agent directli product serv improv activ carri easiest resolv coordin problem break task hand subtask distribut subtask agent task alloc techniqu perform specif design coordin central disadvantag cooper agent fairli easi implement alloc separ alloc hierarch agent order subordin alloc trader special agent capabl agent mediat part chapter system distribut open set possibl coordin cooper exist obligatori agent individu obtain servic agent distribut alloc separ alloc agent agent send request agent perform task alloc contract bid request agent agent make offer perform task emerg cooper characterist reactiv system agent design perform task negoti job reactiv agent potenti imaginari attract repel avoid agent task subtask agent task alloc suffici task requir sophist method rule behaviour commun import aspect system commun agent commun agent intent good commun system agent commun effect exchang inform differ hardwar oper program reason system commun synchron asynchron case agent send messag wait receiv repli agent send messag continu work wait answer commun implement messag pass share variabl messag pass consid approach simpler implement method semaphor comput maintain model commun cost agent store local comput requir maintain world model reason lower commun overhead agent commun protocol import acl kif relationship shown figur commun messag content figur composit agent messag mechan commun uniqu kqml logic commun kqml content messag chapter system part knowledg queri manipul languag stand knowledg queri manipul languag protocol exchang inform knowledg softwar agent kqml develop part darpa knowledg share effort consortium develop techniqu methodolog build knowledg base sharabl al kqml defin messag format protocol support runtim knowledg share interpret compil languag set rule commun kqml call express attitud content inform exchang agent find agent process request perform combin form kqml exchang content field perform dictat kqml kind data kqml implement ignor content field begin end predefin set kqml agent process perform perform reserv perform implement standard specif full set reserv kqml perform found finin kqml prolog word kqml messag perform perform agent queri agent prolog languag truth agent interpret content messag evalu queri word provid addit inform domain relat content messag kqml messag identifi earli experi kqml start current kqml implement standard commun messag protocol transport http corba attempt draw semant kqml finin common peopl perform mean agent commun languag fipa agent commun languag european counterpart kqml foundat intellig physic agent intern associ specif gener agent technolog provid high level target fipa creat physic devic intend mass capabl execut action accomplish goal set collabor human intellig agent high intellig fipa produc specif agent commun languag similar kqml defin semant exact specif found fipa homepag internet term advanc research project literatur denot organ term share share refer consortium part chapter system knowledg interchang format knowledg interchang format formal languag interchang knowledg comput program base order kif specif design act mediat interlingua translat languag translat occur transform statement languag kif kif languag kif common languag agent nativ languag describ program script agent follow meant program languag intern knowledg prefix syntax similar scheme clip kif sentenc bachelor sentenc variabl man marri kif part darpa knowledg share unlik kif languag descript includ specif syntax semant complet specif kif found fike chapter build agent part ii chapter build agent section briefli outlin gener agent construct process section cover import aspect knowledg languag knowledg base section shortli address agent program section describ exist agent architectur guidelin templat construct agent construct process literatur written construct gener design process paper book deal construct specif agent agent type design depend type agent case guidelin gener agent construct problem identifi object featur applic domain percept agent encount kind action influenc defin goal perform measur agent respond choic knowledg languag reason base domain knowledg model choic made knowledg languag reason model build knowledg store fact rule knowledg base behaviour defin test design agent test verifi agent work correctli requir met design construct phase depend type instanc creat learn design graphic user ad specif commun protocol agent order fill knowledg base inform knowledg reason human store knowledg part brain figur work comput agent altern comput memori fill number charact repres fact belief symbol repres object idea call knowledg languag defin syntax semant express knowledg capabl express descript effect agent expect domain impact type knowledg import featur abil repres kind knowledg applic inferenti abil knowledg deduc inform abil repres creat knowledg procedur solv problem learn abil easili acquir learn inform integr exist knowledg structur part ii chapter build agent relat choic knowledg languag reason call infer system reason system consist data structur store knowledg procedur manipul structur deduc knowledg choic knowledg dictat type reason commun protocol mention earlier section form knowledg languag exampl knowledg reason system predic semant product bayesian network fuzzi system knowledg exist interest reader refer norvig detail inform predic calculu predic calculu formal logic predic object defin attribut relat object call resolut process predic statement check statement true resolut algorithm prove fact true show negat fact true unif techniqu sentenc predic logic match replac variabl algorithm form basi program languag prolog predic calculu score high inferenti low effici difficult implement learn method due complex predic integr knowledg fairli easi modular semant network semant network graph node repres situat arc node repres relat semant network suit repres knowledg difficult repres process inferenti capac fairli learn capac low due difficulti ad node exist network frame frame collect attribut defin state object relationship frame frame slot repres attribut filler attach procedur call slot frame link hierarchi repres hierarch structur object frame level inherit knowledg higher level frame frame semant net close repres object relat advantag disadvantag main differ syntax product system product system repres predetermin adequ repres knowledg object rule product system easi understand knowledg ad easili reason product system popular form declar knowledg ai typic product system consist knowledg perman memori rule work temporari memori deriv fact infer engin match reason logic produc data conflict resolut procedur decid rule execut chapter build agent part ii product system work match fact store work memori rule store knowledg base conflict resolut mechan rule match rule rule execut product system languag integr product clip short bayesian network theorem condit probabl event occur event occur provid prior probabl condit probabl occur occur mathemat equat bayesian call belief causal network probabilist data structur theorem repres depend variabl variabl node condit probabl tabl defin relationship parent node primari bayesian network probabl theori reason uncertainti fuzzi system fuzzi control system produc action set fuzzi rule base fuzzi logic convent logic assert world true valu true refer exact mean fuzzi logic variabl valu determin belong set fuzzi logic variabl refer linguist mean membership function measur similar instanc variabl fuzzi set fuzzi logic control system consist map set crisp input collect fuzzi input set fuzzi rule collect rule fuzzi infer map fuzzi set fuzzi set membership function map fuzzi output set set crisp output command main advantag fuzzi system flexibl convent method understand human due linguist variabl knowledg base difficult problem develop intellig agent encod knowledg knowledg base modif knowledg learn reason knowledg base set fact world individu call express knowledg languag drawn store knowledg infer fact fact true store knowledg base rule draw part knowledg base process build knowledg base call knowledg engin good knowledg base clear correct relat fact matter defin irrelev detail construct intellig knowledg base divid phase part ii chapter build agent systemat elicit expert basic terminolog develop conceptu structur knowledg base knowledg languag chosen knowledg base knowledg base extend debug phase knowledg base complet correct provid solut problem knowledg base knowledg base improv effici knowledg base creat choic made knowledg earli dai expert system knowledg build knowledg work domain expert transform knowledg domain expert form usabl reason system disadvantag approach domain expert formul knowledg domain expert reluct work knowledg engin fear job develop expert system approach machin learn techniqu histor data exampl gener expert agent train perform classif predict task knowledg acquisit process verif learn knowledg test data set learn perform build maintain knowledg base easier agent build good learn engin easi task difficult start blank knowledg base fill knowledg machin learn techniqu rasa combin hard encod knowledg machin learn techniqu success program languag agent program sort program languag languag todai languag popular program style program basic unit construct object model counterpart object consist attribut procedur call method attribut model specif properti object method implement behaviour method initi call procedur object instanc class function object templat main advantag languag tradit imper languag reusabl mechan provid inherit object properti modular style program design sort program languag languag extens support creation agent applic languag extens focu creation mobil agent exampl languag telescript develop gener telescript commerci languag support mobil agent telescript accept accommod telescript agent agent issu command suspend execut resum instruct place agent commun interact agent issu command chapter build agent part ii java java languag popular short time java languag agent program design simpler version pointer support singl inherit limit form multipl inherit call advantag java portabl mean java code compil network execut target machin long java virtual machin java extens agent program java expert system product system java architectur agent architectur defin methodolog build agent specifi part agent assembl accomplish action part interact architectur origin design system blackboard architectur wide architectur symbol multiag system blackboard architectur specif architectur implement architectur blackboard model base independ modul commun data interact share data common storag shown figur inform sourc inform sourc inform sourc blackboard control unit figur blackboard model number asynchron inform sourc commun place read inform share resourc call blackboard resourc time access blackboard special control unit regul access inform unit access blackboard send request control unit schedul request blackboard form good commun heterogen inform sourc sourc thing blackboard part ii chapter build agent subsumpt architectur rodnei brook develop subsumpt architectur brook argu tradit artifici intellig commun good believ complex behaviour necessarili complex control system result multipl simpl rule work idea time subsumpt architectur layer architectur arbitr strategi augment finit state machin basi behaviour subsumpt architectur repres separ layer individu layer work parallel individu goal lower layer awar higher layer higher layer ad work control system modif lower layer behaviour agent simpli avoid object figur higherlevel behaviour move direct behaviour domin behaviour suppress output actuat object close higher level subsum lower architectur sensor build map explor wander avoid object actuat figur subsumpt behaviour decomposit autonom robot subsumpt architectur foundat reflex agent robot approach largest influenc subsumpt architectur direct coupl percept action simpl behaviour scheme archon archon part european esprit programm stand architectur cooper heterogen system archon consortium architectur gener goal archon creat heterogen system industri specif electr manag archon agent control part total system cooper archon agent archon agent consist commun handl commun agent acquaint inform agent plan initi cooper request deal request agent abstract model system agent plan control interfac compon control check start stop task system relat compon shown figur chapter build agent part ii commun plan coordin monitor control system archon agent model figur archon agent architectur develop anand rao michael agent mental state compon georgeff belief agent model world desir goal reach intent action agent decid order fulfil commit perform plan agent receiv sensor updat world model belief function agent gener option action option gener function filter function updat intent current desir past intent end cycl action select function action expect perform current intent part design implement part ii chapter drive agent chapter drive agent chapter describ design intellig drive agent control intellig autonom vehicl short introduct section section state requir agent section describ design choic made section overview design section describ part agent detail section close chapter drive agent design introduct mention chapter goal project studi intellig agent control autonom vehicl chapter present gener model drive agent control type vehicl agent make base receiv input sensor instruct translat control oper vehicl control discuss agent model gener drive task agent give gener rule agent drive urban environ attent possibl alter function redesign agent capabl control type vehicl environ design requir drive agent design perform drive decid perform situat constraint import lot commonli agent techniqu architectur applic restrict limit possibl requir drive agent agent watch environ constantli react appropri appropri agent respond normal human driver prefer agent respond situat realtim safeti vehicl driven agent road user easi test valid correct function easi make modif add function agent redesign agent make applic futur sensor technolog requir simplifi agent start basic function expand iter manner agent found sophist perform task understand knowledg expand requir impli knowledg languag easi understand knowledg base alter effort effect function studi main requir state improv chapter drive agent part ii agent agent commun languag kqml fipa commun agent respond situat traffic jam agent flexibl learn past experi program knowledg base easier implement learn engin design choic main difficulti tactic drive good made tradit agent architectur appli artifici intellig sensor inform creat world model world model process standard artifici intellig techniqu plan construct agent achiev goal plan execut seri action plan method defin initi state goal suffici method find optim solut reach goal state tradit approach drawback constraint uncertainti world model incomplet possibl tradit plan method function noisi uncertain condit complex domain tactic drive plan complet path initi state goal due larg amount searchabl state inabl perfectli predict outcom action amount state realist abort lane emerg brake account result make tradit plan method unsuit tactic drive constraint constraint exist agent architectur techniqu approach project combin tradit world subsumpt architectur robot emphasi fast time import sensor inform store memori form temporari world model reactiv procedur call behaviour rule behaviour inform memori quickli gener multipl perform action behaviour work speed calcul process plan tradit appli modul call planner simpl linear extrapol calcul expect posit move object arbit determin action base prioriti rate action includ behaviour rule safeti safeti conserv driver chanc accid happen due unforeseen circumst control limit safeti requir state drive agent make accid special behaviour prevent agent collid object modul activ agent crash object modul halt vehicl maximum overrid behaviour rule decid equip agent learn creat mechan encapsul set behaviour rule problem learn make implement difficult contradictori safeti requir give agent learn capabl agent part ii chapter drive agent exhibit unexpect newli learn make difficult correct situat expand understand knowledg make design modular order meet expand test requir step reason process perform separ part agent work independ knowledg base separ set behaviour rule function test individu set rule implement design long gener output time limit drive agent fuzzi rule base product system fuzzi product system robust normal product system linguist variabl fuzzi system simplifi creation behaviour rule make creat rule easier human interpret adapt global layout design choic discuss previou section lead structur tactic drive agent shown figur drive agent order plan agent human supervisor give instruct move turn road stop agent provid addit local speed limit import sourc inform agent sensor type sensor inform inform inform object vehicl commun modul receiv inform drive agent incom messag transfer memori access memori regul control activ compon commun modul messag planner make fast predict posit move object environ environ sensor vehicl statu planner supervisor agent commun modul input output vehicl control memori behaviour rule chang direct overtak stop traffic light road car obei traffic avoid figur layout drive agent arbit chapter drive agent part ii knowledg base divid separ part call behaviour rule situat behaviour action base sensor data predict made planner action talli prioriti rate arbit select behaviour base prioriti rate send commun modul commun modul translat command messag understood receiv exampl command vehicl turn turn complet loop receiv sensor messag send output messag reason time control drive agent react agent complet reason cycl sensor sampl process sensor inform difficult process artifici detail assum action sensor inform agent sensor regard sensor agent send messag receiv assum object object properti detect road lane align head vehicl rel current lane posit lane lane vehicl drive curv distanc sharp intersect distanc direct distanc end road vehicl vehicl control drive distanc rel angl veloc rel head occupi lane traffic light distanc light stop line rel angl colour light lane regul light traffic sign distanc rel angl type sign move object object chang posit detect distanc rel angl rel head part ii chapter drive agent veloc occupi lane object nearbi object close vehicl bump distanc rel angl separ sensor report state vehicl control speed wheel angl head fuel level fuel statu varieti sensor order gather ultrason microwav infrar sensor camera physic implement sensor detect object measur object properti mention remain extrem difficult task adequ solv main problem build complet function intellig drive agent autonom vehicl oper real world commun modul commun modul knowledg commun protocol deal incom messag supervisor agent commun modul separ part work input output part agent advanc messag schedul arriv input part commun modul readi accept messag messag input modul messag sender content messag understood warn messag back origin sender messag found input section temporarili store write receiv messag memori temporari storag data memori read written time outgo messag immedi conflict advantag commun modul number commun protocol expand easili limit amount commun protocol commun modul equip commun modul kqml fipa acl kif section agent commun agent agent protocol commun sensor vehicl control memori control memori close relat control initi reason cycl regul access memori combin control memori kind activ blackboard request action inform process passiv wait access request control start reason cycl input section commun modul write temporarili store data memori make data written correct place memori easi refer control planner access data start plan expect posit move object detect sensor behaviour rule read data chapter drive agent part ii write back action control activ arbit select action send human agent length reason cycl determin reaction time agent averag human approxim tenth similar reason cycl length easi refer memori separ agenda order plan agent supervisor perceiv divid latest sensor inform data previou reason cycl expect posit move object calcul planner list action behaviour rule agenda static chang time cycl data object chang cycl data ad obsolet data remov order reduc amount memori space total time complet cycl reduc separ memori part access list behaviour perceiv object agenda behaviour rule finish written action arbit start select time control give access commun modul write data memori process demonstr figur input modul plan behaviour arbit output modul receiv messag predict posit send messag memori determin write output send messag action cycl conflict resolut receiv messag receiv messag predict posit determin write output cycl predict posit conflict resolut figur reason cycl overlap cycl determin write output cycl conflict resolut planner planner complet plan system tradit ai predict posit agent move object base current sensor data move object move head base posit object predict extrapol vehicl move front agent agent head speed agent metr closer vehicl trivial head vehicl rel agent calcul bit complex part ii chapter drive agent behaviour rule action drive task agent divid independ subtask function similar manner layer subsumpt architectur subtask cover set behaviour rule set behaviour call behaviour plan script type traffic situat behaviour specifi strength approach behaviour ad chang modif exist behaviour behaviour speed comput process specif behaviour implement whichev ai techniqu natur neural network approach restrict behaviour return output form understood system choic implement behaviour rule depend task agent environ agent vehicl project chosen difficult situat tactic drive agent work urban environ drive agent road behaviour vehicl drive road control posit base distanc road lane behaviour influenc speed make car slow curv straight road desir speed reach intersect chang direct intersect behaviour form link tactic strateg level drive order supervisor plan agent store memori vehicl approach speed rule vehicl instruct order agent request direct fit behaviour split type intersect consist fact human strategi handl type intersect exampl intersect type intersect sort traffic light behaviour search traffic lane traffic light belong make vehicl stop red yellow light car behaviour ensur vehicl bump vehicl car drive front agent close speed reduc match speed exact amount brake depend speed differ vehicl distanc agent make amount cross threshold overtak switch lane relat behaviour overtak behaviour slower vehicl front decid overtak vehicl depend differ veloc vehicl space overtak front left vehicl overtak difficult behaviour implement agent deal type sensor inform determin current chapter drive agent part ii situat safe overtak overtak abort sensor inform turn incomplet wrong case agent make return previou lane safe appli traffic rule traffic light rule traffic rule exampl drive speed local drive side road turn street behaviour track traffic sign restrict encount current road memori agent clear data regular basi save behaviour track sign privat memori space memori space behaviour note behaviour track sign rule appli turn road reset current restrict detect emerg brake behaviour special kind safeti measur activ agent bound crash object object stationari move time behaviour ensur vehicl halt hit object action behaviour highest prioriti overrul behaviour arbit arbit examin action gener behaviour determin action action commun modul translat command execut intellig vehicl arbit start examin list action memori control action consist prioriti rate steer left longitudin longitudin command set case arbit ignor command arbit select longitudin command base highest prioriti rate action longitudin command necessarili part action command behaviour suggest steer set longitudin command longitudin command chosen action set provid note arbit knowledg task agent whatsoev function independ behaviour rule design address import problem design implement behaviour behaviour paramet behaviour depend number intern set threshold gain distanc traffic light agent start speed accept drive curv depend sharp methodolog determin correct effici rang paramet test experi genet algorithm creat good correct behaviour hard iter manner start simpl refin add part ii chapter drive agent avoid inform overload potenti problem drive agent control vehicl inform overload comput time process sensor data incom data pile human instinct irrelev detail simpli close deal import matter agent control extract relev inform sensor data challeng task time constraint prevent process inform agent intellig select inform critic task solut make assumpt object environ observ agent note posit veloc vehicl time close distanc time resembl visual orient strategi human solut activ percept activ sensor behaviour case extra step reason control start check sensor activ inform overload problem simul abstract real leav detail provid agent relev data agent respond traffic control system stimuli presenc surround human behaviour basic reactiv plan time decid divert presenc traffic driver possess complex reason capabl type reason actual trip strict time limit driver make base tradeoff cost agent norvig basic structur driver plan agent multipl plan agent work improv perform plan agent send updat current road situat reaction traffic jam made instantli drive agent type agent acquir static local agent road track current traffic situat chapter dynam drive behaviour part ii chapter dynam drive behaviour chapter discuss type drive behaviour behaviour integr drive agent section start short overview agent traffic simul section type driver distinguish section show exist design drive agent alter accommod driver type section influenc effect drive behaviour discuss agent traffic simul method produc intellig transport system intend improv exist road capac method improv capac directli influenc human behaviour pattern model uncertainti human behaviour essenti traffic analysi simul techniqu suitabl approach repres human behaviour traffic simul human agent autonom ration interact capabl learn system form basi microscop traffic simul microscop simul interact autonom entiti model system driver definit plai central role simul regard main compon ma import element road network traffic control system dictat movement rule driver traffic light environ compon model task specif defin exist program program model vehicl separ publicli find number good simul frank publish report approach model traffic idea simpli model import object agent commun relev data year msc student edinburgh implement idea final msc project simul architectur creat multipl agent function vehicl traffic road cross emphasi project creat necessarili creat smart vehicl agent simpl rule base gap accept speed advanc behaviour overtak model due simplic agent simul environ soar phd thesi describ allen cognit model tool product system soar soar model behaviour human driver approach unord intersect goal studi cognit load human drive model control simul car simul traffic environ vehicl model deal visual speed lane steer navig human limb movement perform task simon simul model traffic gener vehicl microscop traffic simul develop studi impact adapt control part ii chapter dynam drive behaviour driver support system traffic flow simul vehicl equip acc system simon capabl simul individu human drive behaviour base individu prefer speed reaction time exist system reason reason system implement system explicitli encod rule algorithm perform drive task system motiv materi develop improv human driver perform tree deriv correct action improv implement call reason object singl aspect drive similar drive behaviour previou chapter object observ traffic nearbi vehicl upcom examin project interact entiti action system deal drive highwai test simul call stand simul highwai intellig vehicl algorithm simul design test algorithm fast creation test scenario simul run fast sgi machin publicli driver characterist object drive agent control vehicl real world drive safe effici goal agent simul world agent simul design imit human drive behaviour order provid realist behaviour simul accur simul model realist complic agent process speed ultim imit human drive behaviour realist complet model human reason aspect feasibl balanc found size complex agent realism behaviour driver type primari goal driver reach destin avoid accid time goal independ situat person motiv driver execut task highli depend individu habit motiv driver requir economi comfort reach destin road user encount street roughli distinguish type conserv aggress driver averag driver classifi conserv driver care drive speed lower maximum speed limit prefer larg gap pull slowli traffic light start brake bit earli low kind drive observ older peopl peopl search correct road aggress driver peopl quickli slower road user front aggress driver close car brake quickli pull traffic light aggress driver tend risk chang lane lot driver aggress chanc break traffic rule run red faster maximum speed overtak type behaviour view peopl late commut travel rout dai dai chapter dynam drive behaviour part ii averag driver driver traffic drive speed correl legal speed limit slightli risk import paramet descript driver type mention extract paramet larg influenc style drive import factor choic speed choic larg effect drive overtak driver prefer high speed overtak car slower driver factor rate aggress driver tend faster slower driver factor distanc driver call gap accept aggress driver smaller gap slower driver paramet mention choic rate gap relat aggress driver drive quickli small conserv driver drive slow smaller rate aggress driver relat amount risk driver tendenc brake traffic run red light aggress constant peopl traffic jam cut driver aggress drive agent model creat type agent drive wai exist drive agent model discuss chapter equip agent set depend type driver build driver requir lot work solut give agent set rule store set paramet influenc rule figur sensor vehicl statu planner behaviour paramet prefer speed rate gap accept reaction time commun modul input output control memori behaviour rule chang direct overtak stop traffic light road arbit car obei traffic avoid figur drive agent design includ behaviour paramet dynam drive behaviour part ii chapter dynam drive behaviour behaviour rule activ depend distanc red traffic light trigger brake amount determin base amount brake behaviour paramet static dynam requir extra step reason cycl sensor data store paramet modul determin event happen impact paramet aggress aggress driver clear road front drive speed prefer driver aggress end traffic cut influenc drive task behaviour factor mention previou aspect influenc drive reaction time agent reaction time alter chang length reason cycl weather condit influenc drive fog heavi rain reduc visibl driver forc drive carefulli bad visibl simul chang sensor rang vehicl result wet road harder implement vehicl properti model add realism traffic simul vehicl control agent normal truck type car determin maximum fast brake fast make turn car drive brake turn quickli bu truck import agent knowledg capabl vehicl chapter drive agent simul part ii chapter drive agent simul chapter describ implement prototyp simul program creat test design drive agent discuss chapter section discuss reason build simul exist section describ choic made design simul implement simul program topic section section describ implement drive agent simul section detail describ behaviour rule paramet function drive agent build hardest part develop intellig agent identifi rule determin agent behav explor tactic algorithm real world close proxim vehicl unsaf coordin multipl move entiti creat test scenario difficult cheapest easiest creat test environ comput simul simul intellig vehicl drive design worri accid damag equip simul scenario set alter easili real world creat test scenario develop design test simpl behaviour rule progress add complex behaviour agent simul realist result found simul control vehicl real world traffic simul thirti simul capabl desir design intellig vehicl algorithm review exist model shown simul tool analysi traffic flow traffic manag project small percentag traffic simul control vehicl tactic level al problem exist simul simul concentr highwai traffic deal phenomena traffic traffic weav situat larg number car head direct unexpect situat simul simul urban environ type traffic possibl object commonli found citi addit prefer control drive interfac simul program drive agent studi traffic simul result find suitabl simul section decid creat prototyp simul program advantag creat program creat simul interfac satisfi perfectli simul interfac work disadvantag start scratch spend amount time creat simul program implement choic aim prototyp simul program provid evalu correct agent model previou chapter reason program monitor reason process speed program languag build simul program borland delphi nt chosen languag part familiar delphi easi suitabl quick prototyp part ii chapter drive agent simul motion model import choic design traffic simul choic motion model motion model determin simul object move inaccuraci model vehicl simul lead unrealist behaviour rule drive agent type motion model distinguish simplest motion model slot car model divid road piec call cell slot vehicl occupi slot time result lane instantan vehicl orient tangenti local road curvatur kinemat motion model bit advanc deal aspect motion mass forc kinemat model implement smooth lane vehicl move realist trajectori forc vehicl perform slip dynam motion model simul vehicl respond realist forc simul forc includ interact involv engin transmiss model dynam simul effect graviti drive corner stabil ad tabl involv choic motion model model benefit drawback slot car execut simpl code unrealist lane kinemat smooth realist lane fast execut unrealist corner dynam tire engin unrealist slow vehicl dynam realist brake complic realist simul comput time larg number vehicl involv weigh benefit drawback motion model tabl chosen kinemat motion model slot car model simpl larg part tactic drive lane road dynam model realist difficult implement feel loss comput speed difficult program outweigh advantag sensor level detail simul unrealist perceptu assumpt easier make result usabl practic simul program meant prototyp decid simpl code sensor order simplifi implement highlevel sensor return inform process usabl implement sensor map vehicl rel road tracker vehicl rel veloc inform move object provid directli sensor compar sensor sweep calcul speed base speed differ posit vehicl sweep chapter drive agent simul part ii implement simul simul program roughli consist user interfac provid visual simul environ simul drive agent section discuss basic oper part detail inform delphi appendix user interfac interfac simul consist standard delphi applic shown figur larger part window show pictur environ agent drive simul run environ load simul menu environ defin text file extens stand map data file properti paramet object make environ object traffic light traffic light control vehicl ad click road environ map figur main window drive agent simul program addit inform agent control user shown statu inform window activ agent menu figur window show intellig activ behaviour action agent complet reason cycl depend simul set fast human simul slow chang time factor top main window set option menu simul time agent complet reason cycl part ii chapter drive agent simul figur statu inform window monitor reason process save action agent log file reason cycl add approxim byte run simul minut produc file agent complet reason cycl save memori hard disk log file maximum size data store basi simul control task simul control stop simul track time give order environ updat data start button main window press simul control start drive agent control regularli send order environ environ calcul valu object send relev visual feedback screen updat process shown figur simul control timer main window pictur environ updat visual feedback traffic light control set color updat light traffic light figur simul updat loop environ vehicl simul object calcul statu road intersect chapter drive agent simul part ii simul control timer activ updat loop time period default updat frequenc time rate adjust program run slow comput time factor simul control frequent simul user awar result simul run slower environ simul object road traffic form simul environ load map data file environ object file store environ environ track posit statu object simul updat object order simul control current implement environ traffic traffic light control vehicl road road static repres environ rectangl start coordin end coordin determin line side left side road side width lane except street lane side road connect intersect intersect curv intersect connect road intersect repres circl radiu middl circl posit coordin intersect intersect list connect road start coordin end coordin road intersect boundari curv special type intersect curv connect road traffic light traffic light control traffic light defin lane number statu traffic light simpli colour light lane number refer lane road control light traffic light control virtual shown environ regul colour group traffic light posit intersect base cycl time traffic light control regularli colour light current implement light time set green vehicl contrari discuss environ vehicl ad simul program start environ user creat vehicl click road shown main window simul program vehicl repres rectangl random length width specif properti vehicl wheel statu type vehicl hit traffic statu set vehicl move rest simul run vehicl hit vehicl vehicl crash vehicl control individu drive agent implement drive agent implement drive agent base design discuss chapter agent made commun behaviour behaviour arbit note planner chapter implement inform part ii chapter drive agent simul provid planner inform calcul behaviour rule vehicl environ drive agent agent simul focu attent user mean user chang set behaviour paramet follow reason process statu inform window thread agent implement separ thread simul run prioriti bit lower main thread schedul execut thread depend number processor oper system oper system support true multipl processor window nt simul schedul routin call time slice simul program construct run window mean action simul run main schedul front agent thread prioriti higher advantag thread program run thread parallel oper system agent run autonom main thread disadvantag limit number thread overhead manag multipl thread impact perform delphi recommend limit assum thread wait extern event run simul pentium iii mhz mb run agent number bit low step execut loop agent request data sensor agent finish process send order vehicl figur agent finish reason cycl time denot thread put rest cycl time prevent agent cpu time benefici side reduc amount inform agent receiv default cycl time agent perform reason cycl agent finish reason cycl set cycl complet reason sleep cycl time screen updat rate high result process time agent traffic light control traffic light environ vehicl simul object road intersect send order inform figur agent updat loop agent reason sensor sleep chapter drive agent simul part ii interfac chosen integr drive agent simul reason simplifi interfac agent simul interfac consist messag agent agent send order chang chang wheel angl agent make environ receiv sensor data send messag messag sensor start poll environ data store messag sensor messag agent behaviour section address drive implement behaviour initi run behaviour parallel implement thread reduc number thread order run agent decid execut behaviour sequenc execut order matter arbit wait behaviour finish determin output actual implement behaviour test behaviour ad behaviour implement order low high road chang traffic car switch lane short descript implement behaviour task detail found appendix road behaviour divid drive prefer adjust speed base prefer stai make adjust vehicl cross lane boundari adjust speed lower speed base prefer speed radiu curv make correct turn brake end brake dead end agent drive task chang agent drive back nearest road behaviour action creat longitudin command initi command set task chang run task order mention result task overrid made task task task overrid chang command traffic light behaviour search sensor data traffic light detect case task deal yellow determin agent brake time yellow traffic light speed base outcom stop red stop reason imposs stand time case agent run red light part ii chapter drive agent simul chang direct behaviour consist adjust speed reduc speed approach intersect fast cross intersect agent random direct task vehicl direct time turn dead agent close dead task turn vehicl agent car step behaviour find closest vehicl front agent task match adjust speed match agent drive faster make distanc remain agent vehicl exact distanc depend speed vehicl switch lane behaviour separ switch agent drive lane road space agent switch lane overtak vehicl front agent vehicl drive slower prefer task overrid behaviour overtak vehicl behaviour behaviour task independ case depend avoid agent decid brake traffic switch lane behaviour output behaviour dynam behaviour behaviour paramet order reach amount determin specif function depend prefer linguist desir amount linguist amount maximum implement function driver type shown figur actual amount normal linguist amount slow driver averag driver fast driver figur function vehicl normal maximum linguist amount chapter drive agent simul part ii behaviour paramet determin determin desir gap vehicl margin brake task halt vehicl distanc front light distanc determin paramet paramet determin desir speed straight road curv desir speed curv calcul interpol function design franci research driver horizont curv road found driver adjust speed comfort approxim function ln equat ln equat denot speed drive comfort speed speed drive difficult variabl radiu curv metr base equat interpol draw function determin desir speed curv equat upper limit fast driver equat function averag lower limit slow driver determin slow ln ln equat ln rel prefer speed paramet equat equat part result part iii chapter evalu program chapter evalu program chapter demonstr reason process implement drive agent make critic remark prototyp program start situat section explain agent deal section discuss experi show agent exhibit drive behaviour section make comment implement simul program section close chapter discuss drive agent worth reason demonstr reason process implement drive agent situat shown figur consist vehicl intersect traffic light agent control vehicl mark red dot moment agent approach intersect drive vehicl figur situat consist intersect group traffic light colour vehicl repres current rate green vehicl faster case vehicl colour red vehicl brake colour vehicl figur turn intersect chapter evalu program part iii sensor inform situat receiv sensor messag messag inform vehicl control angl fuel level messag agent reason cycl sensor messag inform road agent drive messag includ distanc left edg distanc left edg head agent rel road messag inform intersect agent includ distanc agent intersect rel angl direct agent messag messag sensor detect visibl traffic red light upper corner intersect light face direct visibl sensor ignor messag receiv vehicl sensor detect vehicl area agent messag vehicl sensor inform head rel head activ behaviour rule implement behaviour rule section shown figur lowest level behaviour reason behaviour notic vehicl drive prefer set approxim behaviour notic vehicl close left edg current turn steer wheel figur agent statu inform window belong agent situat activ behaviour behaviour behaviour notic red light nearbi light compar current speed agent drive slow behaviour start brake activ import behaviour behaviour notic slower vehicl front agent content sensor messag appendix figur part iii chapter evalu program vehicl brake red traffic light agent decid match brake situat behaviour activ vehicl intersect slow speed account reason alter behaviour overtak slower drive vehicl front intersect nearbi decid behaviour chang direct arbit select suggest activ behaviour suggest chang behaviour highest prioriti longitudin combin behaviour vehicl drive behaviour valid simul drive behaviour paramet preliminari experi shown implement agent exhibit drive behaviour rang slow care fast aggress drive behaviour section present result experi experi consist driver approach intersect stop front red traffic light driver perform task traffic present driver care driver low prefer larg gap accept low prefer rate call driver driver driver young aggress high prefer small gap accept high prefer rate driver start distanc intersect speed vehicl experi shown figur figur speed driver young aggress driver experi driver drive lower start brake closer intersect young aggress driver due lower speed differ brake pressur visibl driver brake stabl consist human brake behaviour experi case shown graph roughli stop posit vehicl approxim experi young aggress driver tendenc brake late stop front stop line driver hand full stop ahead stop line stop posit vehicl experi compar figur chapter evalu program part iii figur compar stop posit young aggress driver driver critic remark improv aim simul program test design function drive result current implement ineffici speed implement suggest agent part chapter program agent send request sensor data extra storag messag commun input part program unnecessari messag transfer memori directli agent continu work sensor inform cycl receiv main focu correct drive behaviour reason creat fast execut agent comput implement test program intel pentium mhz mb run microsoft nt oper system program languag recommend limit thread assum thread wait extern event experi demonstr agent run simul simultan number bit low drawback simul unrealist assumpt made agent percept perfect agent field view object obscur cover object vehicl action atom brake rate occur instantli action vehicl real life occur gradual model abil react unexpect event accur test test design deadlock deadlock situat movement vehicl inhibit due current statu vehicl close environ program deadlock occur due unforeseen reason vehicl crash block road plan agent implement replan agent stop crash vehicl wait road clear good experi borland delphi program enthusiast newer delphi version nt project bug slow implement process problem delphi debugg problem deal thread averag time debugg gener error messag debug lock delphi program environ part iii chapter evalu program drive agent back discuss definit intellig agent chapter drive agent construct intellig agent follow statement shoham piec hardwar softwar agent chosen control question trivial chosen design implement agent feel simplist realist properti agent check drive agent possess drive agent perceiv environ sensor act base percept agent autonom user agent drive run implement version agent adapt alter behaviour rule learn experi note agent design discuss chapter show agent chang paramet occurr design small amount adapt conclud current implement agent main trade intellig agent chapter state agent capabl learn program call agent possess trade feel safe call drive agent real moment year agent outdat technolog insight prove make drive agent program type agent drive agent strictli agent subsumpt architectur behaviour rule oper subsumpt behaviour temporari memori strictli reactiv reflex architectur process cyclic tradit ai architectur pure reactiv architectur behaviour activ moment input stimuli receiv clear design agent trade tradit ai approach reactiv reflex agent approach main function agent li behaviour rule result feel agent reactiv agent delib agent behaviour argu behaviour drive agent fact simpl reactiv agent agent system competit agent control vehicl true behaviour construct idea subsumpt reactiv layer call domin lower layer behaviour function entiti memori commun modul part fail behaviour work autonom autonomi main properti agent feel behaviour agent chapter part iii chapter chapter result studi draw section give short overview work mention advantag disadvantag approach section present suggest futur research result report investig intellig agent control autonom vehicl agent perform make drive task survei exist techniqu design gener model drive agent appli control vehicl type task expand design agent model type driver agent act individu driver set characterist prototyp simul program construct test improv agent design preliminari experi simul program shown drive agent exhibit drive behaviour capabl model drive rang slow care fast aggress drive behaviour main advantag microscop traffic simul tradit macroscop simul realist gener traffic emerg properti interact agent advantag simul flexibl traffic scenario made quickli alter posit individu vehicl chang paramet disadvantag comput resourc higher number paramet set valid agent microscop traffic simul simul agent model vehicl sort aggress factor model driver type approach differ simul studi simul differ environ microscop traffic simul model highwai traffic simul deal drive urban complic agent multipl behaviour paramet set produc desir drive behaviour paramet sever limit possibl model behaviour independ behaviour rule function expand alter easili complet environ improv perform traffic drive agent step control autonom vehicl vehicl necessarili car robot autonom guid vehicl prove confid agent equip behaviour rule control vehicl futur work moment experi type agent scenario goal studi current possibl simul program drive agent order improv current direct improv realism simul program drive behaviour order creat realist simul improv agent control autonom vehicl simul part iii chapter simul current state traffic simul drive agent implement meant prototyp simul environ made realist ad object emerg pedestrian traffic tree build simul improv object function extend deal object simul environ valid realist valu vehicl turn road size set prove inaccur studi human drive behaviour extens order valid drive style model improv random stochast vehicl drive environ map creat drive typic driver improv enhanc techniqu moment simul viewpoint interest includ viewpoint environ perspect add human control interfac steer wheel simul program studi real human drive behaviour reaction driver drawback improv simul environ agent comput time run slowli recommend distribut approach futur drive agent run comput environ simul control discuss section act server agent client commun server autonom vehicl ultim drive agent control simul make real intellig vehicl ultim agent drive type vehicl circumst situat perfect commun intellig provid receiv inform road traffic jam unexpect event agent design present chapter good control real provid sensor technolog develop long implement complex agent step current project creat realist sensor simul agent moment implement sensor sensor read possibl object obscur object neglect current implement drive agent adapt deal uncertainti noisi sensor read plan navig agent give direct drive agent agent real move robot step end experi simpl drive agent control lego robot shown figur result posit simpl behaviour call lego robot explor environ note lego limit intend expand robot advanc sensor research area futur chapter part iii figur lego robot bibliographi internet address check oper decemb bibliographi model driver behaviour soar dissert netherland robot mit massachusett jp construct intellig agent guid smarter applic wilei approach model urban traffic scenario research report forschungszentrum für septemb bradshaw softwar agent aaai press mit massachusett ra robust layer control system mobil robot mit ai lab memo septemb ieee journal robot autom vol march page carnegi mellon robot institut traffic simul msc depart artifici edinburgh kw traffic simul junction traffic msc depart artifici edinburgh clip pam artifici intellig autonom mobil robot research delft technolog introduct distribut artifici intellig addison weslei longman york kqml agent commun languag intern confer inform knowledg manag acm novemb fipa agent commun languag technic report foundat intellig physic agent fipa taxonomi autonom agent intern workshop agent intellig agent page bibliographi frog knowledg interchang version refer manual logic group report stanford ibm intellig agent ibm corpor blackboard architectur control artifici intellig vol page view control structur pattern pass messag artifici vol page drive intellig drive behaviour adapt control accept individu driver trail thesi seri novemb delft netherland pa autom highwai system plenum york mj agent market germani kqml specif technic report februari semant agent commun languag read mp morgan kaufmann fifteenth intern joint confer artifici intellig august lego agent reduc work inform overload commun vol page acm juli mm support impact traffic flow trail thesi seri trail research delft netherland societi mind simon york hs softwar overview knowledg engin review vol novemb understand intellig mit massachusett neural network percept mobil robot guidanc kluwer academ boston bdi theori practic intern confer system san page robocup drive simul artifici modern approach save project bibliographi di review tool institut transport august artifici intellig page overview program softwar agent jm aaai press mit agent object knowledg base state imperi colleg london ka drug traffic safeti road user traffic ja de ra van page situat awar tactic drive technic report robot carnegi mellon januari simul design system tactic drive algorithm artifici simul plan high autonomi system build intellig multistrategi learn tool case studi academ san california trail autom car explor societ impact condit van decemb trail studi transport delft netherland contribut visual object detect classif driver assist system dissert april aachen germani road canadian research test driver horizont curv road manag engin journal architectur system elli horwood england appendix implement detail appendix implement detail object model section import object implement prototyp drive agent simul program order reader import oper object model note unlik standard omt object model object note shade object complex object shown detail figur chang set chang set send command memori behaviour arbit vehicl sensor log start resum stop drive agent order sensor data timer clock statu request updat environ road curv intersect vehicl updat reset figur main object simul program appendix implement detail commun vehicl size posit speed head statu memori log drive agent start resum stop paramet behaviour figur drive agent object sensor arbit control control posit statu traffic light height width scale environ updat reset vehicl size posit speed head statu belong appendix implement detail road figur environ object connect posit intersect appendix implement detail speed chang head head fuel level statu rang sensor sensor send figur sensor object sender recipi time size distanc angl messag size distanc angl angl statu lane figur sensor messag sender recipi time messag distanc angl speed accel head lane agent behaviour rule appendix implement detail section simplifi version agent behaviour rule task function return action procedur speed speed action action action procedur head road action steer road direct action steer straight distanc lane edg action steer left distanc left lane edg action steer procedur direct distanc action procedur head action steer direct direct set action steer straight procedur end distanc distanc road action distanc road procedur action steer back nearest road appendix implement detail function return action procedur end action turn procedur random direct distanc action procedur head action steer set action steer straight function return action procedur light distanc stand action action procedur light distanc stand action action function return action vehicl vehicl exist procedur distanc appendix implement detail procedur action action function return action vehicl vehicl exist procedur vehicl close intersect traffic light action steer procedur left vehicl ahead left intersect traffic light action steer left appendix glossari appendix glossari adapt function normal car control maintain distanc car vehicl ahead agent commun specif agent commun languag design fipa consortium autonom guid vehicl drive rout guidanc system vehicl environ autom highwai system highwai intellig vehicl drive intend improv highwai capac reduc accid autonom land vehicl neural system artifici neural network track road edg perform autonom robot steer artifici part field artifici intellig studi natur live system evolutionari comput techniqu entiti artifici life system rate denot success success entiti lead popul increasingli entiti artifici neural backward deduct rule true note necessarili true section approach robot variat subsumpt architectur total behaviour robot divid separ behaviour consist relationship ccd camera light sensit diod creat pictur distribut artifici studi distribut coordin knowledg action environ involv multipl entiti situat entiti stuck wait initi action object situat set properti model make node tree correspond test properti branch outcom test dedic special lane road limit type vehicl expert system base classic ai techniqu expert system base idea knowledg extract expert human store comput foundat intellig physic intern associ develop specif gener agent technolog provid high level applic target fipa physic devic intend mass capabl execut action accomplish goal set collabor human intellig agent high intellig appendix glossari forward deduct rule true fuzzi logic determin truth statement function truth valu compon statement statement partli true depend fit membership function global posit system system determin posit earth accuraci approxim meter deduct knowledg base rule fact intellig speed system reduc speed vehicl wrong vehicl drive local speed limit knowledg interchang formal languag interchang knowledg comput program base order kif specif design act mediat interlingua translat languag knowledg set fact rule deduc fact world knowledg syntax semant languag store fact rule knowledg queri manipul languag protocol exchang inform knowledg softwar agent machin studi comput algorithm improv automat experi simul gener model abstract total behaviour system system agent interact accomplish cooper coordin action subfield distribut artifici intellig simul separ entiti function model system neural simplifi model brain neural network consist number process unit call neuron connect link link numer weight neuron activ level weight modifi network specif output input neural network place neuron layer input receiv neuron output neuron neuron input output layer form hidden layer specif abstract simplifi view applic domain ontolog import concept entiti exist area interest relationship hold potenti field method robot gener imaginari field repres navig space base chosen potenti function goal present attractor obstacl treat system fix time constraint process time constraint system fail system effect assess driver state vehicl control emerg design interven situat driver fall incap safe control vehicl appendix glossari subsumpt type architectur autonom creat rodnei independ parallel process call connect sensor actuat intern process tactic part drive deal reason section lightweight process share resourc peer thread main program creat thread run parallel thread main program oper system ture experi creat alan ture determin comput program intellig human front comput termin question termin human distinguish answer comput comput intellig variabl messag sign road provid traffic inform appendix paper appendix paper appendix paper reactiv drive agent microscop traffic simul abstract pam knowledg base system group depart inform technolog system delft technolog netherland comput traffic simul import make strategi microscop traffic simul model traffic flow realist manner ideal vehicl control paper describ model reactiv agent control simul vehicl agent capabl drive drive style ensur fast reaction drive task divid compet reactiv behaviour rule agent implement test prototyp traffic simul program simul consist urban environ traffic light control vehicl vehicl control drive agent agent individu behaviour set preliminari experi shown agent exhibit behaviour rang slow care fast aggress drive behaviour reactiv microscop traffic drive behaviour introduct traffic congest problem countri reduc govern invest improv infrastructur explor strategi problem infrastructur improv costli modif carefulli evalu impact traffic flow comput traffic simul form method make evalu traffic simul evalu improv normal hypothet situat difficult creat real world simul model accur model circumst predict result intellig smart autonom comput simul drive behaviour individu driver adapt flexibl intellig agent make control type vehicl drive style agent equip behaviour set simul drive behaviour simul vehicl behav realist interact multipl driver studi paper describ model reactiv agent perform drive drive consist drive select achiev object base current situat agent continu make control order vehicl road reach desir destin safe microscop traffic simul appendix paper traffic simul todai macroscop simul macroscop simul mathemat model describ flow vehicl model deriv fluid dynam treat vehicl advanc model differenti vehicl type vehicl treat equal vehicl type real life type vehicl driven kind drive make traffic flow unpredict microscop call element model interact local element simul vehicl individu result traffic flow emerg behaviour simul microscop simul model traffic flow realist macroscop simul system form basi microscop traffic simul main compon ma traffic simul vehicl vehicl control individu agent import element simul environ model traffic light agent control group traffic light frank publish report ma idea simpli model object agent commun relev data year msc student edinburgh implement idea final msc project simul architectur creat multipl agent function vehicl traffic road intersect emphasi project creat necessarili creat realist drive vehicl agent simpl rule base gap accept speed advanc behaviour overtak model due simplic agent simul environ advanc simul environ stand simul highwai intellig vehicl algorithm simul design test drive algorithm fast creation test scenario phd thesi reason system call test drive algorithm drawback simul special sgi machin run publicli approach drive agent resembl reason system implement simul implement urban environ traffic simul model highwai traffic agent multipl behaviour paramet set produc desir drive behaviour simul paramet gap accept prefer independ behaviour rule function expand alter easili agent complet environ tradit versu reactiv agent intellig agent autonom entiti capabl environ act intellig base percept tradit agent architectur appli artifici intellig sensor inform creat world model world model process standard plan construct agent achiev goal plan execut seri action tradit approach drawback sensor constraint uncertainti world model incomplet possibl tradit plan method function noisi uncertain condit complex domain tactic drive plan complet path initi state goal due larg amount searchabl state inabl perfectli predict outcom action amount state realist appendix paper abort lane emerg brake account result make tradit plan method unsuit tactic drive reactiv call reflex inspir research robot control primari inspir sourc rodnei subsumpt architectur robot reactiv agent rule react current state environ perceiv sensor pure reactiv agent symbol model environ incap happen main advantag reactiv agent robust fast fact pure reactiv agent memori sever limit reason reactiv agent enhanc drive agent model design model reactiv drive agent control simul vehicl agent design perform drive decid perform situat base receiv input sensor agent reach instruct translat control oper vehicl drive agent modular design part replac improv directli affect modul part sensor perceiv commun memori control store data regul access multipl behaviour rule behaviour arbit select action behaviour rule pictur layout shown figur user command sensor vehicl statu planner behaviour paramet prefer speed rate gap accept reaction time commun modul input output control memori behaviour rule chang direct overtak stop traffic light road figur drive agent layout arbit car obei traffic avoid agent tradit reactiv method perform emphasi fast time import sensor inform store memori form temporari world model reactiv procedur call behaviour rule behaviour inform memori quickli gener multipl perform action plan tradit appli planner simpl linear appendix paper extrapol calcul expect posit move object arbit determin action base prioriti rate action includ behaviour rule discuss reason behaviour rule behaviour paramet detail subsect reason complet loop receiv sensor messag send output messag vehicl reason cycl time reason cycl activ part control regul access memori drive agent react agent complet reason cycl activ part shown figur input planner behaviour arbit output sensor data predict posit move object determin action reason cycl length figur reason cycl regul control conflict resolut agent type sensor inform type inform distanc angl width current lane sensor type return inform vehicl includ wheel fuel level agent receiv order user inform agent receiv commun modul knowledg commun protocol messag commun modul messag sender content messag input section commun modul temporarili store receiv messag written memori temporari storag data memori read written time outgo messag immedi conflict incom messag transfer memori planner make fast predict posit move object environ actual reason process agent perform behaviour call behaviour situat base data behaviour action action talli prioriti rate arbit select base prioriti rate send commun modul commun modul translat control instruct understood vehicl behaviour rule drive task divid subtask autom independ behaviour rule function expand easili modif exist behaviour behaviour rule depend environ highwai environ traffic chosen agent drive urban environ reason urban environ send output appendix paper difficult complex traffic scenario citi lot unexpect event happen agent deal situat show potenti drive agent concept note design agent drive environ behaviour rule adapt expand citi environ design road behaviour agent drive road control posit base distanc road lane behaviour influenc speed make slow curv straight road desir speed set behaviour paramet reach intersect chang direct agent approach speed rule agent direct chosen set user behaviour split type intersect consist fact human strategi handl type intersect traffic light behaviour make agent stop red yellow traffic light behaviour check traffic light regul current lane slow vehicl brake depend prefer brake pressur set behaviour paramet car behaviour ensur agent bump vehicl car drive front speed reduc match speed brake pressur depend speed differ vehicl distanc set gap accept agent overtak switch lane relat behaviour behaviour slower vehicl front decid overtak vehicl depend veloc differ vehicl space overtak front left vehicl appli traffic rule traffic light rule traffic rule exampl drive speed local drive side road turn street aggress driver tendenc break rule behaviour track traffic sign restrict encount agent memori agent clear data regular basi save behaviour track sign privat memori space memori space behaviour note behaviour track sign rule appli turn road reset current restrict detect emerg brake behaviour special kind safeti measur activ agent object time behaviour ensur vehicl halt hit object action behaviour highest prioriti overrul behaviour behaviour paramet appendix paper order creat drive style behaviour rule influenc behaviour paramet import factor choic speed choic larg effect drive subtask driver prefer high speed overtak vehicl slower driver implement factor distanc driver call gap accept aggress driver smaller gap aggress driver paramet prefer rate aggress driver tend faster aggress driver behaviour aspect influenc drive reaction time agent rang sensor reaction time alter chang length reason cycl sensor rang determin visibl agent simul fog bad weather condit implement construct prototyp traffic simul program test drive agent design program languag build simul borland delphi nt chosen languag part familiar delphi easi suitabl quick prototyp simul kinemat motion model deal aspect motion mass forc model implement smooth motion lane vehicl move realist forc vehicl perform slip prototyp simul simul program roughli consist user interfac provid visual simul environ simul drive agent model task simul control stop simul track time simul control start stop drive agent control regularli send order environ environ calcul valu object send relev visual feedback screen loop shown left part figur default updat frequenc time rate adjust program run slower comput environ form simul object environ load map data file file descript road network traffic control system load map data file environ data simul object file store environ current simul implement traffic traffic light control vehicl simul control timer user interfac pictur environ updat visual feedback traffic light control traffic light environ vehicl road simul object intersect send order inform figur simul agent updat loop agent reason sensor sleep appendix paper drive agent vehicl environ drive agent focu attent user mean user chang set behaviour paramet follow reason process agent statu inform window shown figur agent implement lightweight process start simul program advantag thread simul run thread parallel oper system agent run independ simul program disadvantag limit number thread overhead manag multipl thread impact perform execut loop agent shown part figur agent finish reason cycl thread put rest cycl time set simul control prevent agent cpu time default cycl time agent perform reason cycl implement behaviour rule rule behaviour divid task task execut serial import task import task import task action import task execut behaviour rule case execut order matter arbit wait behaviour finish determin action figur screen shot prototyp simul test drive agent result discuss present model reactiv drive agent control vehicl microscop traffic simul prototyp simul program construct test agent design valid paramet preliminari experi shown implement agent exhibit drive behaviour rang slow care fast aggress drive behaviour experi behaviour rule discuss section plan test behaviour present result experi experi consist driver approach intersect stop front red traffic light driver perform task traffic present driver care driver low prefer larg gap accept low prefer rate call driver appendix paper driver driver young aggress high prefer small gap accept high prefer rate driver start distanc intersect speed vehicl experi shown figur figur speed driver young aggress driver experi driver drive lower start brake closer intersect young aggress driver due lower speed differ brake pressur visibl driver brake stabl consist human brake behaviour experi case shown graph roughli stop posit vehicl approxim experi young aggress driver tendenc brake late stop front stop line driver hand full stop ahead stop line stop posit vehicl experi compar figur figur compar stop posit young aggress driver driver aim simul program test design function drive result current implement ineffici speed main focu correct drive behaviour reason process comput implement test program intel pentium mhz mb run microsoft nt oper system program languag recommend limit thread assum thread wait extern event experi demonstr agent run simul simultan number bit low drawback simul unrealist assumpt made agent percept perfect agent field view object obscur cover appendix paper object vehicl action atom brake rate occur instantli action vehicl real life occur gradual model abil react unexpect event accur test futur work main advantag microscop traffic simul tradit macroscop simul realist gener traffic emerg properti interact agent advantag simul flexibl traffic scenario made quickli alter posit individu vehicl chang paramet disadvantag comput resourc higher number paramet set valid preliminari experi shown drive agent exhibit drive behaviour capabl model drive rang slow care fast aggress drive behaviour moment experi type agent scenario goal studi current possibl traffic simul agent order improv simul environ made realist ad emerg pedestrian traffic tree build simul improv object function extend deal object simul environ valid realist valu vehicl turn road size set prove inaccur studi human drive behaviour extens order valid drive style model intend improv random stochast vehicl drive environ creat drive typic driver drawback improv simul environ agent comput time run slowli distribut approach futur drive agent run comput simul control environ act server agent client commun server refer introduct distribut artifici intellig addison weslei longman york approach model urban traffic scenario research report forschungszentrum für septemb traffic simul vehicl msc depart artifici edinburgh kw traffic simul junction traffic light msc depart artifici edinburgh artifici intellig page appendix paper simul design system tactic drive algorithm artifici simul plan high autonomi system situat awar tactic drive phd technic report robot carnegi mellon januari architectur system elli horwood england bdi theori practic intern confer system san page ra robust layer control system mobil robot mit ai lab memo septemb ieee journal robot autom vol march page robot mit massachusett
IR/1147 5 knowledg retriev world wide web philipp martin peter griffith web search engin effect retriev entir exploit retriev semant web document content automat extract content gener document manual structur web retriev inform web robot weblog approach retriev inform document structur exact form knowledg languag support logic infer achiev flexibl knowledg retriev industri develop metadata languag peopl index web inform resourc knowledg store web document metadata languag insuffici satisfi requir scalabl inform retriev basi argu favor gener intuit knowledg languag web distribut mass simpl hypertext document web search engin altavista infoseek capabl retriev inform result author present interpret semant statement store document conceptu graph direct languag user repres knowledg level detail simpl notat restrict knowledg case techniqu user leav knowledg term built tool support approach user combin techniqu exploit gener web document webkb ontolog server direct web robot sidebar list relat metadata languag requir requir metadata languag intuit peopl easili short train current metadata languag built resourc descript framework ontolog markup languag choic xml underli format standard xml tool exchang metadata languag xml metadata languag built difficult special editor editor elimin peopl languag repres knowledg editor fill predefin write inform machin human standard xml tool requir special ieee ieee intellig system infer engin manag languag reduc inform ontolog guid inform retriev annot html document access notat pair insid tag author tag delimit element implicitli refer element knowledg statement tag element wrapper ad ontobrok gener rdf definit automat ontobrok metadata author make knowledg statement visibl reader obviou requir intuit make graphic visual languag write sentenc control subset natur languag elimin ambigu visual featur handi notat document explan knowledg statement store integr knowledg base document document access classic search navig tabl search ontobrok metadata languag design reduc inform user show html tag ontobrok metadata languag essenti notat pair gener basic hard read document author index part index document element html tag limit element access url metadata languag suffici gener user repres inform desir level impli metadata languag base express formal model notat user exploit formal express formal logic permit context candid knowledg interchang format cg good exampl import restrict effici search engin ignor featur knowledg relev url cgi server conceptu graph harvest knowledg interchang format ontobrok ontolingua ontolog server resourc descript framework shore visual languag webkb weblog wordnet word wide web consortium xml ment search engin ignor refer set cg exhibit adequ cg refer set ontobrok metadata languag rdf gener orient repres entir document arbitrari part convent repres quantifi oper limit capac statement webkb requir scalabl inform retriev impli easi notat possibl insert web document webkb interpret chunk knowledg statement web document satisfi requir special html mark string delimit group statement chunk visibl author hide html comment tag author knowledg languag chunk webkb interpret linear notat cg notat formal english cg linear notat notat automat translat cg chose cg graphic linear notat easili cg infer peirc exploit subsumpt relat defin formal term calcul special relat graph queri fact knowledg base make statement queri level granular requir user explicitli declar organ term knowledg statement declar organ term tediou complex work detour user main reason hypertext system requir semiform languag concept map formal kif statement knowledg access rapid express increment refin knowledg special command webkb accept cg includ term inform featur webkb accept notat set webkb ignor search displai retriev cg figur webkb tool menu inform retriev handl tool queri show document index imag load browser webkb processor command special conceptu retriev cg imag index select option knowledg present form enter html xml user refer index part document creat webkb index notat document element refer content occurr document simpli repres knowledg document command handi document result automat insert place command hypertext literatur refer techniqu dynam link call gener document dynam virtual document idea adapt content user procedur declar languag combin command result web robot perform document gener current metadata languag knowledg webkb user gener virtual document combin data manag command search join file manag command work simpl unix script languag combin command user insert command document interfac figur show webkb tool menu inform retriev handl main gener interfac webkb approach scalabl limit knowledg queri webkb user directli assert knowledg load command load web document includ knowledg exploit user benefit knowledg user extend webkb handl cooper built knowledg repositori knowledg languag versu metadata languag repres knowledg advoc knowledg languag metadata languag compar figur show repres simpl sentenc cg webkb kif rdf sentenc believ mari cousin cg figur simpler semant network structur cg restrict knowledg format knowledg encourag user fulli describ relat concept languag frame permit visual relat concept cg readabl restrict prefer simpler notat figur show notat webkb accept tc tc mean term knowledg statement user time declar order term repres knowledg case user index sentenc document privat knowledg organ ieee intellig system load ontolog ag ag subtyp properti type load ontolog ag rdf assum type figur compar knowledg knowledg interchang conceptu resourc descript framework suffici input text structur html tag convent formal english part knowledg design input output figur complementari notat simpl knowledg statement mon sep red damag vehicl mon sep figur languag knowledg index connect document element figur knowledg custom queri interfac document sampl queri show command special conceptu retriev imag cg index permit system perform minim semant check knowledg casual user repres knowledg basic declar relat type leav term concept type method knowledg statement made concept link basic complex manifest concept type relat limit set relat type applic webkb ontolog basic relat type collect common argument relat type webkb relat signatur give suitabl type term concept type toplevel ontolog webkb relat type defin concept type process argument previou webkb infer subtyp process merg natur languag ontolog word link concept ontolog user implement initi webkb share repositori webkb semiautomat relat term concept type concept type link word concept type constraint relat signatur cg user declar term cat ieee intellig system cat mean tabl mean webkb relat type connect concept type concept type webkb infer beat intend mean arrai postpon intend mean tabl identifi intend webkb prompt question cat refer tabl refer knowledg statement readili compar follow convent convent basic relat import opposit convent primit concept complex relat harder mari year convent concept type ag user predefin relat relat ag solut impli infer engin expand relat type definit compar graph cg engin perform type webkb enforc declar term cg linear notat permit term simpler notat figur command decl decl default mark type explicitli system type left quot webkb understand individu concept type descript facil webkb parser html ignor html tag definit list knowledg statement statement displai displai exact form includ html tag user combin html xml featur knowledg statement user put type ital make sourc hypertext link figur html sourc code imag index figur index document element knowledg document element textual html refer imag entir document definit exclud binari data includ textual knowledg statement webkb user index de document knowledg statement connect de relat figur show case xml wai isol refer de html webkb exploit capac web webkb user xml mechan xml user annot de referenc author explicitli delimit webkb facil refer de content occurr number simpl index notat figur statement index de document user index element document web figur present gener interfac queri show document knowledg load webkb processor queri webkb author document index imag knowledg statement directli store field html tag imag special index case simpl illustr featur figur good synthesi repres gener mix index sourc data collect custom interfac queri singl document figur show part document illustr index figur displai result queri figur lexic structur queri command webkb knowledg queri script felt give lexic structur queri languag weblog implement text process command exploit document gener echo ad hyperlink path explor command command list document directli indirectli access document maxim number hyperlink command list html document access includ string knowledg html sourc grep knowledg knowledg queri command webkb command displai figur document gener figur queri gener concept relat entir cg knowledg base queri cg special retriev connect processor retriev path concept queri retriev cg index document present cg gener hypertext link reach sourc answer origin present slightli modifi copi origin document instruct web browser displai highlight select answer sourc document assum file index figur gener concept type load spec sourc repr repres de spec red damag vehicl sourc queri special give user freedom express search gener level subsequ refin result exact type improv webkb user give substr type queri cg prefix string charact webkb gener actual request replac substr manual automat declar type includ substr webkb discard replac violat constraint relat signatur individu type displai execut remain request spec trigger gener execut spec user combin knowledg queri command script languag gener complex perform consist test knowledg solv problem procedur webkb site exampl queri script solv room alloc problem invit test exampl knowledg gener command type knowledg gener command webkb command join cg defin kind join webkb join set creat cg special sourc cg insert result cg repres true user devic knowledg collect automat merg cg relat type spec result serv basi user creat type definit concret maxim join scalabl cooper built knowledg repositori ontolog server support share knowledg ontolingua ontolog server usabl manag larg quantiti form index retriev part document support cooper user ieee intellig system limit consist annot structur extend webkb handl knowledg repositori address scalabl implement system visual techniqu handl term gener avoid lexic conflict user focu kind protocol user solv semant conflict insert term relat common ontolog knowledg convent repres knowledg improv automat comparison knowledg user consist retriev inform retriev techniqu give answer question overcom current trend web user annot document metadata languag webkb user combin techniqu exploit gener web document scalabl knowledg repositori build permit fusion knowledg sourc oper featur combin tradit inform retriev idea give search capabl knowledg retriev describ refer jf conceptu inform process mind martin index document navig conceptu proc ieee conf intellig process icip ieee pp martin knowledg web proc world wide web pp decker ontolog base access distribut semant issu multimedia meersman kluwer academ publish de de sur le graph conceptu graph phd montpelli ii jan manag complex phd dept comput queensland hypertext access proc lectur note comput vol pp wordnet concept catalog relat hierarchi knowledg proc peirc exploit de graph de document structur conceptu graph structur document knowledg inform phd nice sophia trade servic telecommun proc conf conceptu lectur note artif vol pp philipp martin research fellow griffith gold coast australia main interest knowledg retriev engin phd softwar engin franc contact griffith school inform gold coast qld peter eklund foundat chair inform technolog griffith gold coast campu kei research distribut system technolog center brisban main interest knowledg manag graduat mathemat brighton phd comput scienc linkop sweden contact griffith school inform gold coast qld
DB/1148 3 critic note stabl model semant wang peter school comput studi leed april abstract argu stabl model semant version conceptu flaw introduct semant logic program deduct extens studi past decad spectrum semant theori logic program rang infer inform logic program infer great deal skeptic semant semant credul stabl model semant includ model partial stabl model prefer extens chief drawback stabl semant stabl model defin logic program variant model defin model leav atom undetermin origin problem stabl model reappear determin show exist profound problem stabl model semant version argu underli definit stabl model extent inconsist essenti characterist negat logic program kind inconsist underli exist stabl model semant argu essenti characterist negat logic program nonmonoton review definit stabl model discuss problem review definit stabl model problem nonmonoton negat negat logic program negat firstord logic complet unrel main idea negat piec neg inform implicitli assum suffici evid exact mean depend semant logic program semant common characterist form negat nonmonoton piec neg inform assum default inform call kind negat nonmonoton negat nonmonoton argu directli recal datalog negat syntact relat queri relat algebra relat calculu relat algebra negat express exploit set differ oper rs ss notion negat initi learn add lose previou neg item inform extend datalog negat preserv semant appli datalog result relat convent relat theori remain nonmonoton stabl model semant problem stabl model semant origin motiv gelfond moor autoepistem logic subsequ discov gelfond lifschitz stabl model semant defin refer autoepistem logic achiev transform call transform stabil base idea stabl model logic program set atom reproduc defin equat stabl model discuss base transform recal definit logic definit normal logic program simpli logic consist finit set rule form atom liter atom negat atom call head rule denot liter bodi rule denot liter call subgoal program term definit logic program herbrand herbrand base defin usual hb stand herbrand base assum rule logic program ground assum variabl logic program instanti rel herbrand definit logic program set atom hb stabil transform respect denot definit logic program obtain ffl rule neg liter bodi ffl neg liter bodi remain rule transform make inform decid neg subgoal rule neg occur rule bodi elimin rule depend item neg inform suppli posit neg occur rule bodi neg subgoal consid satisfi failur commit set transform program definit logic uniqu minim model minim model definit logic program fix point consequ oper central argument recal definit definit logic program set fp hb xg fixpoint oper smallest set definit logic program fixpoint fact comput ordin power obtain appli ignor limit ordin reach fixpoint minim model atom gener process observ process success ad inform set atom stabl model logic program provid minim model stabil transform definit logic program set atom call stabl model minim model satisfi stabl stabl equat repres initi global process comput lfp consist ad truth process ad posit inform result time reduct exist neg worth point stabl model minim herbrand model made inform decid posit subgoal rule size result size relat algebra model negat structur stabl model semant reduct occur neg fact fix outset true aim model essenti nonmonoton negat tension heart exist anomali stabl semant exampl illustr trivial typic program difficult check stabl model complet case start initi comput stabil transform assign fix point transform program repres final assign initi assign stabl model provid final assign tabl show assign satisfi stabl model program transform fixpoint qg fpg fqg qg qg point model turn stabl comput process transform program manag gener correct solut fpg stabil test contend inevit element strictli monoton hope adequ repres nonmonoton negat strictli monoton process admit prove introduct mechan enabl assign proper mean program fpg qg uniqu model program borrow easi program rule stabl bg fnot bg rule ad result program stabl model effect undesir rule independ atom relat rule note logic impli reason expect pg fnot pg intend mean point fourth rule effect stabl semant logic consequ addit fourth rule effect minim model give uniqu stabl model full program show sort oscil stabl motiv belief anomali comput negat process retract assum neg inform light posit negat requir logic program comput process process withdraw held neg inform hope adequ model negat semant logic model negat ow stabl semant mechan withdraw assum neg inform system pg fnot pg model addit rule chang mean expect stabl semant problem version stabl model semant introduc argu section critic continu appli version stabl stronger origin version stabl semant requir extend basic notion definit logic program introduc bodi rule special atom repres unknown true case proce transform logic program definit time bodi rule transform program stabl stabil transform rel set liter set atom atom subgoal rule replac liter subgoal rule replac subgoal replac stabl model comput fixpoint procedur lattic consequ oper defin usual lattic oper extens consequ oper enabl infer neg fact addit posit matter detail order present critic gener content fulli satisfactori account nonmonoton negat retract assum light newli discov inform stabl semant stabl equat requir neg fact effect fix true durat comput critic appli semant program section fnot explicitli assum rel transform similarli stabl semant simpli exclud stabl model initi assumpt reach intend true note program show similar problem stabl semant introduct cost problem illustr logic program program ag bg stabl model note logic consequ reason expect true stabl stabl model empti set addit ag problem concern transform logic program rel set liter semant atom replac consequ oper infer posit neg inform infer occas initi unknown occur bodi rule subsequ establish rule replac constant amount reason establish refut fix outset comput fix fix unknown outset infer subsequ assign atom incompat critic philosoph conceptu technic claim stabl semant technic flaw claim conceptu model nonmonoton negat process model apt subject matter model refer vianu foundat dung foundat logic program journal logic page van emden kowalski semant predic logic program languag van schlipf semant gener logic program journal associ comput gelfond stratifi autoepistem theori nation confer artifici page gelfond lifschitz stabl model semant logic program kowalski intern confer symposium logic page mit moor semant nonmonoton logic artifici przymusinski semant coincid stabl semant fundamenta zaniolo stabl model logic program negat acm pod page acm wang semant logic program research report school comput
HCI/1149 4 interact haptic paint virtual brush bill baxter vincent ming lin depart comput scienc north carolina chapel nc present paint system intuit haptic serv express vehicl interact creat work introduc brush user natur control complex brush stroke forc feedback enhanc realism tactil cue enabl user manipul paint brush develop paint model enabl easi load complex blend virtual brush gener interest paint effect canva result user artist conceptu paint environ user test start creat origin art work minut human comput paint applic introduct art paint refer aesthet aspect work craft paint deal studi includ paint manipul materi express intent art craft paint close artist divorc recent technolog advanc comput graphic larg center art attent craft commerci paint system recent research gener work final product word describ fusion feel sight produc imag artist impress focu primarili render equal merit recreat action artist process design set peopl freeli creativ express tradit paint comput graphic serv conduit craft main contribut primari goal provid express vehicl interact creat origin work comput system present deform brush user control complex brush stroke intuit haptic feedback enhanc realism tactil cue enabl user manipul paint brush develop paint model enabl easi load complex blend brush gener interest paint effect canva attempt provid minimalist interfac requir complex control offer great deal express power haptic paint paint creat figur origin work creat system devic space bar keyboard comparison exist comput paint approach offer natur express mechan manipul paint includ paint simpl easi load complex blend virtual realist brush footprint gener automat brush intuit familiar feel paint process requir train haptic paint test number user novic user start paint minut simpl instruct fig show paint creat amateur artist familiar conceptu paint artist control virtual brush real brush interfac combin exist interact paint program effect train system paint prior work number research develop automat method transform ordinari imag imagin render siggraph develop method simul paint ca commerci packag painter achiev realist simul natur media clever textur composit trick drawback comput paint system amount train requir complex involv obtain stroke desir model attempt accur model real brush base heurist model brush arrai swept trajectori defin cubic spline curv work account number effect achiev actual vari wet wong ip defin complex set interrel paramet vari shape footprint account behavior round brush result stroke inform physic behavior physic gener method partial interact approach brush model share similar theme work model physic brush sumi paint techniqu gener flexibl term brush advantag graphic hardwar user al user paint directli standard graphic hardwar map brush screen space model commerci deep paint user paint directli accomplish standard brush footprint project surfac object brush advanc commerci support input sophist tablet posit pressur paramet ignor tilt input sensat move pen hard surfac give feel control brush draw canva idea paint explor rigid brush control input devic color surfac paint system implement brush organ rest paper organ section overview approach user interfac present model paint brush section forc displai haptic devic section section describ techniqu render paint briefli highlight implement prototyp paint system haptic interfac demonstr featur actual paint volunt section approach section give overview approach user interfac haptic paint system overview develop deform brush model integr haptic interfac haptic stylu serv physic metaphor virtual paint brush figur system architectur posit orient brush displai contact forc brush canva user brush model surfac particl system skeleton brush deform expect collid canva framework wide select brush type made artist paint model support import featur bidirect paint complex brush load surfac palett coat paint model schemat diagram shown fig illustr system compon integr user interfac phantom haptic devic pentium iii pc ii graphic card processor serv haptic host comput brush dynam paint transfer blend fig show physic setup system figur haptic paint system artist haptic stylu paint directli virtual canva haptic paint system user paint directli virtual canva displai screen space bar user bring virtual palett paint mix brush put palett paint directli canva user present wide select virtual brush mimic type shape brush tradit paint simpl menu present save load clean paint undo brush quickli dry canva partial fig show snapshot graphic user consist virtual canva figur graphic user virtual canva brush portion palett brush palett color mix siggraph tabl tabl show real model structur surfac stroke gener paint brush deform physic user move brush canva user creat stroke behav real brush actual footprint brush paint effect gener base manipul brush virtual canva model brush paint brush regard import tool good set brush enabl compet artist creat virtual effect intric detail subtli blend shift hue sunset describ techniqu model paint brush introduct brush figur basic brush anatomi fig show anatomi typic brush brush head made varieti natur soft anim synthet materi common style brush paint round simpl shape great varieti stroke flat wider round squar point flat typic longer wide bright shape construct flat typic width equal length thicker collect abil hold paint head type specialti fan versatil wide column tabl show imag type overview model approach model paint brush requir develop geometr model model dynam behavior requir interact haptic paint system place addit constraint brush dynam run interact rate remain stabl type user manipul model brush head surfac mesh wrap particl system skeleton particl system reproduc basic motion behavior brush deform mesh skin skeleton repres actual shape head deriv approxim implicit integr method base exist numer techniqu cloth simul larg integr step maintain stabil brush model simplist design captur essenti qualiti physic brush satisfi dual constraint maintain interact requir minim comput cpu share paint subsystem base gener brush adjust kei paramet gener type shape brush mimic physic behavior tabl show geometr structur construct brush section show deform brush make contact canva brush dynam difficulti simul paint brush paint brush numer stiff dynam suffer numer instabl mass energi store induc larg veloc brush behav highli damp system properti improv stabil solver consid evalu numer method particl system found approxim implicit integr present effect primarili stabil simul brush larg numer method present variat base dynam dynam motion particl system repres brush mathemat order differenti pair coupl siggraph order differenti ú ò vector spatial coordin ò ú ò vector particl ò vector forc particl ò ¢ ò diagon matrix diagon entri form mass particl method simul deform object approxim solut equat motion implicit integr linear forc compon approxim account forc compon deform constraint enforc prevent excess stretch result solut accur integr present al stabl demand speed advantag separ linear forc solv equat motion multipli step step á ð ü ú ð ü linear forc compon handl integr á ü constant method work gener weak bend brush approxim effect forc compon lead local error angular readili appar observ brush solver effect ignor stiff bend lead brush angular motion achiev stiff brush behavior depend skelet structur section discuss brush construct detail final step method applic deform constraint particl assum travel induc excess stretch materi correct simpli alter posit iter contract spring materi elimin deform constraint plai major role stabil system ensur end spring physic plausibl configur constraint modifi system model forc make method unsuit drive haptic output handl contact particl found penetr canva project nearest point surfac add friction drag forc collid particl realist result friction coeffici friction dynam real empir obei model lack inertia model object move durat forc appli inspir simplifi model simul brush advantag case usabl dynam motion particl system repres singl differenti å object stop move instantli absenc result motion heavili brush behav order simul damp requir ad larg damp forc system cancel larg veloc induc stiff spring physic circumv step modifi approxim implicit integr formula order ð á ü ð ü equat form eqn integr techniqu remain unchang except omit friction damp forc modifi order model effect fulli implicit method drawback approxim implicit method limit model intern forc stretch spring experi fulli implicit integr method explain limit fulli implicit type forc deriv comput desir bend stretch natur fit model fiber brush deriv implement numer techniqu bend spring fulli implicit specialti brush deriv includ supplement materi brush surfac surfac geometr brush head abil repres arbitrari topolog vertic arbitrari valenc easili brush head surfac defin control point anchor rel mass particl interpol approxim scheme surfac interpol scheme task reason control vertic rough limit surfac pass vertic level limit facilit chang tessel level mesh unfortun downsid conveni frequent high curvatur result surfac interpol surfac deform smoothli expect brush approxim scheme gener surfac gener smoother difficult place control point achiev desir surfac extens loop approxim scheme present accur model sharp featur fine taper point round brush implement chose triangular base mesh subdivid interpol rule make task gener brush control mesh easier result tabl brush gener dynam model full set brush suitabl creat wide varieti paint type brush model singl spine linear chain ò particl integr method model softer style brush call brush work order dynam make brush solid elimin oscil siggraph model oil complic skelet structur basic build block stiff brush mass particl connect spring form pyramid round structur tabl consist pyramid element particl form base rigidli fix brush handl directli driven user input particl serv point brush find order model suffici brush paper experi brush type desir inerti effect achiev model tabl show summari brush model exampl stroke gener wide brush form pyramid element gener outer shorter brush structur defin entir famili brush size parametr vari scale cardin ax haptic displai import aspect paint system abil provid suffici good forc feedback emul sensat appli brush stroke canva input devic serv forc output devic align virtual physic posit point forc deliveri coincid point head meet handl virtual brush present approach forc displai issu requir ideal forc dynam simul gener realist forc feedback difficult approxim implicit behavior influenc step forc deliv continu motor haptic devic emit distract significantli distract user larg danger research field haptic haptic feedback requir updat rate order brush dynam simul run gener updat khz rate simpl forc displai model minim comput run dedic cpu basic forc model root forc model simpl linear function penetr depth brush point penetr depth length brush head project canva forc model ò ò small posit constant model light spring larger posit constant simul actual brush handl canva spring constant normal absolut forc deliv handl hit brush length orient chang simul brush vari stiff compress effect real brush contact canva close stiff initi act strong compress transmit abrupt forc handl pressur compress forc reduc bend forc brush make contact obliqu compress effect plai lesser role forc felt extend linear eqn curv curv defin seri control tupl penetr depth forc linear stiff spring model point deriv empir observ brush head behav compress initi segment curv model compress forc assign initi control tupl fairli strong linear spring constant simul initi strong compress forc modul compress forc angl multipli forc control tupl coeffici angl canva normal negat direct factor result compress forc strongest brush contact canva angl compress forc taper brush approach angl canva friction forc final compon forc deliv user small amount tangenti resist small friction forc larg effect perceiv abil control brush damp small oscil hand model friction ø forc opposit current brush ad feedback ø ò ò coeffici friction paint model complement express present paint model capabl captur complex effect interact paint model incorpor variabl wet conserv paint transfer algorithm support oper techniqu expect oil paint blend mix multipl obtain desir color transfer transfer paint brush back canva brush complex brush load fill portion brush head variabl control blend paint previou layer paint partial dry paint layer color opaqu color paint thick volum paint addit medium user gener similar result advanc paint program paint manipul virtual brush similar real order automat gener intend paint effect paint transfer paint inform store canva brush multipl textur section brush surfac tessel polygon surfac surfac intersect canva geometri brush consid contact canva transfer correctli modifi siggraph figur paint transfer demonstr drag yellow paint stroke wet purpl paint purpl paint appli dry paint paint textur simul paint volum interchang surfac figur displai brush stroke paint transfer transfer problem reduc dimens simplifi comput introduc slight inaccuraci gener project plane chosen maxim area project intersect curv brush canva surfac implement canva plane orthograph project brush achiev polygon raster speed implement refer project textur brush footprint brush textur updat simul paint transfer mix blend footprint canva discuss section simul brush produc discret instanc brush produc continu stroke blend oper perform line connect current footprint previou centroid footprint polygon endpoint method smooth stroke footprint chang dramat blend updat textur reappli surfac repres achiev render variat brush surfac mesh surfac vertic project footprint textur coordin updat footprint textur origin surfac textur coordin vertex locat render back textur map paint brush transfer method present combin media type system includ model approxim oil famili paint paint surfac color layer refer layer surfac cover thin surfac underli deep layer surfac layer boundari paint transfer object occur surfac layer complet wet deep layer repres paint complet dry deep layer repres reservoir paint paint transfer surfac layer occur object brush transfer reservoir layer surfac perform surfac layer longer satur paint remain reservoir dry paint surfac layer dry layer occur time interv request user surfac deep layer store color textur volum paint layer store attribut textur surfac layer brush reservoir layer fix point dry layer canva special rel height section paint mix amount volum transfer surfac layer depend volum paint layer volum comput initi transfer ì ì ê result paint comput weight portion remain volum incom volum color î ð optic composit gener realist paint wet dry layer canva composit paint volum illustr fig volum wet multipli optic alpha blend wet dry layer dry canva paint model support variabl wet shown fig variabl wet accomplish gradual move paint complet wet surfac layer canva complet dry deep layer figur variabl wet displai yellow paint paint purpl color stripe composit color paint chang dry optic blend function constraint solv dry layer remov wet layer dry layer canva rel height field unlimit volum paint constraint rel chang height convolut kernel transfer paint rel height field light inform height field store attribut textur directli light contribut siggraph implement result develop prototyp paint combin virtual brush haptic interfac paint paper mention section graphic user interfac consist main palett brush discuss palett intuit interfac creat paradigm explicitli support previou comput paint system advantag color convent paint user term coordin difficult time find color main advantag brush palett exist system load brush complex blend simpl blend color simpli drag part brush color pick stroke creat canva consist color blend expect convent oper support requir defin gradient fill offer level intuit control blend effect afford simpli rotat brush instanc brush select brush brush make simpl size shape task defin set paramet describ brush footprint inform brush model directli current state dynam simul user expect brush short instruct requir user start creat express work art system demonstr user feedback fifteen user paint system group user includ amateur art male ag rang earli late prior experi comput paint program user interfac user pick haptic stylu start paint train detail instruct small select artist creation shown fig addit imag art work creat detail screen supplementari materi user work paint program found paint system intuit artist prior paint paint system substanti easier adapt paint offer similar undo brush dry appeal peopl artist painter comput absenc stereo introduc shadow graphic displai user infer rel posit paint brush virtual canva addit forc feedback made dramat differ haptic user difficulti determin brush made contact canva contact difficulti maintain shadow visual depth cue futur work user type found compel work aspect system extend forc effect model current forc feedback equat handl realist output dynam simul improv accuraci continu investig integr method similar plan incorpor feel paint textur plan investig possibl evok sensat type brush hair canva made materi paint medium current paint model extend depict advanc characterist oil paint effect due anisotrop light multipl wet layer volum render expand set virtual tool includ brush tool interest initi observ small group amateur art ordinari volunt approach effect interest conduct extens formal user studi substanti larger group user confirm evalu effect contribut factor interfac design refer andrew marc paint scan surfac symposium interact page april david andrew witkin larg step cloth simul proc acm page proc page corel painter england model textur paint comput graphic forum barr interact anim structur deform object proc graphic lin interact multiresolut model paint haptic interfac proc ieee vr stuetzl smooth surfac reconstruct acm page deep paint render curv brush stroke multipl size proc acm page pat paul direct paint textur shape comput graphic volum page august thompson cohen paint textur haptic interfac ieee virtual realiti process imag video impressionist effect proc page mayer handbook materi techniqu barbara meier render anim siggraph confer page august physic base brush model paint confer abstract page full version pp brush comput graphic witkin physic base principl practic acm wong ip virtual synthesi comput siggraph figur paint baxter rebecca figur paint rebecca figur paint rebecca figur paint andrei state figur paint lauren adam figur paint sarah hoff siggraph
Agents/1150 1 engin formal comput model mark school comput michael depart comput abstract success agent base framework wealth research accumul formal practic aspect remain gap formal model implement system build earlier work rao aim narrow develop comput model languag program base procedur reason system distribut reason system determin behaviour agent implement develop add rao identifi progress descript languag give formal specif gener bdi architectur basi provid formal specif sophist system agent intellig bdi formal specif introduct system comput system independ entiti perceiv act environ order achiev goal agent autonom reactiv respond time fashion proactiv attempt achiev goal characterist includ social gener consensu contrast agent architectur success base framework bdi agent continu monitor environ act chang base mental attitud desir repres motiv capabl true number wealth research accumul formal theoret aspect bdi agent develop practic aspect develop implement bdi agent logic vol pp fl oxford press engin formal comput model area gap formal model implement system implement typic involv simplifi assumpt result loss strong theoret foundat logic small relat practic problem fragment theoret practic aspect effort made attempt address fragment relat area system remain bring strand work progress made bdi rao attempt unit theori practic wai provid abstract agent architectur serv ideal implement system mean investig theoret properti effort start implement system formal oper semant agent languag result view abstract implement procedur reason system distribut reason agent program written interpret build work develop comput model languag specif languag paradigm formal method softwar provid specif check anim dinverno hu hypertext specif techniqu hewitt al provid prototyp formal systemat refin produc provabl correct implement develop add origin work progress descript give formal specif gener bdi architectur basi provid formal specif sophist system spirit similar garlan reusabl formal framework underli abstract specif enabl refin instanti notion framework specif instanti refin system similar class adopt area line specif paper check anim refin implement obviou step paper reflect architectur section set stage provid overview system introduct specif languag section introduc defin type primit specif includ plan intent section proce specif agent section give detail agent plan address actual oper agent cycl paper end discuss contribut work continu rao origin effort unifi practic theoret base develop formal specif implement bdi dmar engin formal comput model system rao attempt provid oper semant languag view abstract implement bdi system pr dmar languag base essenti similar oper semant languag construct pr includ simpli make task program effici basic oper agent base desir intent agent belief desir term state achiev intent adopt plan agent maintain repositori plan librari agent respond goal result packag data structur call repres belief goal respond select plan plan repositori chang instanti plan intent intent action goal plan possibl give rise addit plan intent oper agent ffl event select ffl retriev plan librari plan trigger event execut current circumst ffl select execut plan gener instanc intend mean ffl add intend mean intent intent case extern event exist intent case intern event result attempt satisfi goal intent ffl select intent step top plan perform add event set event process ffl top plan intent intent remov set intent descript captur essenti oper agent detail ad oper cycl elabor formal specif provid detail notat notat specif languag current adopt specif languag major reason suffici express unifi structur account comput system oper view build program schema suitabl squar demand formal model implement engin formal comput model transit specif program approach formal specif pragmat formal concept remain directli connect issu implement qualiti increasingli framework system ai relat area paradigm formal method softwar engin wide usag industri support larg collect tool syntax formal specif base set theori order predic calculu extend languag addit mathemat type schema type schema upper declar declar variabl lower predic relat constrain variabl type schema consid cartesian product type notion constrain schema predic modular facilit schema includ schema select state var write introduc type abstract actual content element notion set write repres set node state variabl set valu order pair valu write node node relat type express relationship exist sourc target type type relat sourc target relat set order pair element sourc type relat element target relat function total function element sourc set partial function element sourc relat sequenc special type function domain contigu set number number element sequenc relat defin function defin sequenc node sequenc written domain relat function element sourc set rang element target set relat exampl ran ran set element defin set express denot set squar natur number greater fx engin formal comput model definit declar identifi predic sequenc express set relat declar abbrevi definit set ii free type declar uniqu ascript local variabl definit logic logic negat logic conjunct logic disjunct logic implic logic ffl quantif ffl existenti quantif set set membership empti set set fx set element order tupl cartesian product pa power set power set set intersect set union set differ gener union size finit set fd ffl xg set relat relat domain relat ran rang relat relat restrict relat overrid function partial function total function sequenc seq set finit sequenc seq set sequenc empti sequenc hx sequenc sequenc concaten head element sequenc tail element schema notat vertic schema axiomat definit schema oper schema compon select convent input oper state compon oper state compon oper state schema oper state schema oper chang state chang state op op oper composit fig summari notat engin formal comput model ffl xg write predic state squar natur number greater greater write ffl state natur number greater equal simpli write ffl select uniqu element type satisfi predic detail notat introduc requir definit provid appendix summari notat figur complet treatment interest reader refer numer detail formal semant issu paper type primit underli bdi system primit repres basic mental attitud compon section defin basic type requir build formal model explain part assum familiar illustr type exampl base rao origin descript set constant variabl denot set functor symbol denot specif content set directli elabor term functor symbol sequenc term paramet term seq belief belief typic includ fact static properti applic fact gener oper system essenti descript predic calculu rao defin belief specif build construct introduct set predic denot belief atom predic symbol sequenc term argument atom head term seq term belief liter atom negat atom engin formal comput model liter element liter equal set fnot po po belief belief conjunct belief belief liter belief ii set ground belief call base atom variabl base belief variabl order defin auxiliari return set variabl belief requir specif auxiliari return set variabl atom term atom belief const var seq belief ffl fvg simpl matter defin set ground belief fb belief plan plan agent accomplish vital delib agent bdi task gener plan librari plan agent select plan goal achiev action perform plan invoc state trigger perceiv state belief hold plan select move specif defin goal action precondit determin applic motiv attitud desir compon bdi architectur manifest goal system standard ai goal system state agent bring engin formal comput model type repres predic symbol sequenc term prefix identifi achiev agent bring system state atom true achiev identifi test agent test atom true queri identifi goal order achiev goal accomplish agent perform action set action symbol set denot set action action term seq term precondit plan relat goal belief updat trigger event trigger event occur perceiv chang goal acquir defin trigger belief trigger event involv addit delet trigger trigger belief ii trigger compon ffl invoc condit detail term belief plan trigger event ffl context specifi belief agent hold plan select execut ffl part plan specifi sequenc formula agent plan bodi determin agent formula action achiev goal test goal answer illustr figur invoc condit sequenc formula arrang order address invoc context belief formula bodi seq formula plan inv invoc context context bodi bodi engin formal comput model plan bodi context invoc plan intent fig plan intent simpl trigger robot find car order select robot car empti plan detail gain control consist sequenc formula robot perform primit action move primit action achiev subgoal start car actual achiev subgoal requir plan inv belief context bodi plan instanc partial instanti plan plan variabl bound refer intend mean intend mean repres copi origin plan serv mental attitud direct behaviour recip behaviour distinct plan recip plan mental attitud import studi bdi agent specif distinguish call plan plan instanc plan instanc type plan bdi system procedur reason system plan instanc plan type plan engin formal comput model intent intent plan commit execut made commit avoid infinit evalu altern forc action intent stack intend make contribut achiev intend mean lower culmin achiev origin intend mean bottom schemat intent figur number repres order intend mean gener origin intend mean bottom stack subgoal lead addit intend mean carri task requir achiev subgoal intend mean top stack execut execut subtask remov formula intend mean attempt formula execut plan continu possibl requir intend mean ad turn repres intent sequenc plan element sequenc repres top stack intent seq event provid basi agent oper cue reason action event result extern case extern trigger event unrel execut current case trigger event explicit connect intent defin event type int repres option intent definit option relat defin undefin found appendix event trig int option state extern intent intern defin undefin int defin int order construct auxiliari creat instanc event constitu part option event option ffl event engin formal comput model agent formal mental compon data structur describ agent bdi agent gener compon put defin agent bring dispar group compon agent consist distinct item ffl plan librari repositori plan agent plan requir actual plan part agent schema defin capabl set action evalu action bodi plan plan librari gener defin appendix ffl function select event process set event event accumul set perceiv agent ffl function select plan plan plan librari applic current circumst ffl function select intent execut set current intent compon oper consid section write agent definit schema note state agent set plan select function defin set plan intent intent plan plan event event capabl action capabl fp action ffl ag state describ agent defin ffl compon agent schema ffl set belief ffl set ffl set event process ffl set action agent perform engin formal comput model intent plan event action belief percept action fig agent state figur illustr agent complet determin intent action clear goal agent wai defin possibl goal agent determin retriev goal achiev queri current intent possibl defin schema agent redund goal repres goal bodi plan instanc set current intent record current intent activ suspend motiv statu record consid predic schema state current intent statu statu activ suspend belief belief intent intent event event action statu intent statu goal dom statu intent goal fi intent goal ffl gg agent begin initi set knowledg event intent action shown figur engin formal comput model intent plan event action belief fig initi state action intent event agent cycl oper agent oper overview state model oper agent essenti similar bdi system pr dmar mode oper involv respond event execut intent illustr figur agent select event agent gener plan invoc condit match event plan relev plan relev agent identifi satisfi respect agent belief plan applic plan plan relev chosen form plan instanc intend agent intent updat select event intent select event plan instanc ad head intent post aspect agent oper place intent execut intent intent select chosen set intend mean top intent stack identifi execut formula plan identifi execut formula depend select intent execut formula execut action engin formal comput model event plan action belief event plan action belief event plan action belief event plan action belief intend mean select unifi fig updat intent perceiv event execut formula achiev goal event gener post set event await process case intent suspend goal achiev select execut made explicit rao origin descript restrict introduc avoid suspend intent incorrectli select formula queri goal unifi set gener unifi queri goal set belief appli rest execut plan appendix provid detail formula current plan buffer futur perform execut formula remov formula execut plan select mgu invoc condit plan stack invoc execut plan substitut appli plan stack formula intent remov set intent note possibl address rao origin oper semant import case demand explicit descript specif compon agent oper formal oper repres chang state oper schema defin true oper place state affect dash state variabl repres state oper engin formal comput model state variabl repres state oper variabl agentspeak agent variabl defin chang convent state state variabl chang convent state dash variabl equal counterpart state remain oper percept agent trigger event extern event mention part cycl outlin set event updat appropri schema event event event undefin determin relev applic plan begin start plan recip incorpor procedur agent gener plan adopt mental attitud guid action agent behaviour determin sequenc execut plan plan select execut deem relev event set event wait applic respect current belief agent condit relev applic gener set bind associ variabl term substitut detail standard aspect bind unif includ main part paper due space detail appendix plan relev respect event exist gener unifi bind invoc plan event equal pass event set gener set relev record unifi make relev event plan event lib ffl lib fp oe substitut oe ffl engin formal comput model relev plan applic context logic consequ belief agent defin hold context condit set set agent belief logic consequ defin applic plan belief belief origin descript notion logic consequ explain true wai implement choic underli mechan constrain resourc leav question open applic plan defin set pair set return plan applic bind context relev plan logic consequ belief oe refer applic refer correct answer substitut definit substitut composit found appendix belief bel belief ffl bel substitut rel ffl ffl oe agent oper actual agent agent select repres local defin gener plan relev gener applic illustr earlier figur determin relev plan amount applic function select event plan librari determin applic plan involv appli function relev plan belief applic applic found appli function intend gener instanti plan applic unifi intent agent updat event intent consist intend mean gener set event intern intend mean push intent gener intern earlier execut updat intent statu set activ statu remov intent domain statu engin formal comput model set updat intent activ defin local defin function extract element defin member type option introduc earlier definit appendix event event ffl ffl belief ffl ffl ffl ffl intent statu statu ffl ffl statu agent updat intent intend mean process move part oper concern execut intent refer part agent cycl schema includ state variabl order make specif agent oper make stronger connect formal specif subsequ implement defer discuss variabl paragraph state relat intent plan formula activ intent select execut schema select repres plan intent formula plan note precondit state explicitli event queue empti nonempti intent contrast rao origin execut intent set predic assert select intent activ engin formal comput model event event intent statu activ head head possibl case formula top intent vari depend formula achiev queri goal action case detail formula achiev assum immedi goal event creat event ad set current event process agent alert agent find plan achiev goal execut current intent stack continu ran ran achiev ffl event event goal statu intent execut set suspend statu statu formula queri goal unifi set current result mgu appli rest execut plan repres queri mgu gener unifi goal variabl result appli mgu ran ran queri ffl mgu ffl mgu engin formal comput model formula ad set action perform ran action action origin descript explicitli address action perform success queri goal unifi belief omiss system previou case achiev queri goal ad action set execut formula explicitli remov bodi execut plan tail tail intent formula formula current plan plan intent stack current plan finish plan readi execut addit bind constraint introduc result execut current plan achiev trigger goal bind carri plan order achiev mgu goal trigger execut plan plan invoc condit current execut plan bind appli plan stack schema local variabl defin repres plan execut intent formula head bodi repres led instanti plan achiev gener unifi invoc condit execut plan denot mgu execut plan gener appli mgu intent updat defin predic schema subgoal event gener plan achiev isol remov set event oper necess consid origin descript engin formal comput model ffl ffl mgu ffl mgu intent event event event tail top formula trigger end section achiev plan complet plan execut intent achiev remov agent set intent extern event origin gener intent remov attempt problem rao event highlight extern event identifi complet intent intent compon event undefin variabl invoc condit achiev plan bound previou plan simpli compar trigger event invoc condit plan identifi extern event complet intent identifi extern event trigger unifi invoc condit complet plan make assumpt gener case associ event uniqu identifi record part plan instanc gener intent intent event substitut ffl agent achiev plan remov formula engin formal comput model procedur aspect oper show schema defin put give complet action ad set perform queri goal achiev altern possibl plan case formula plan remov gener complet plan intent plan achiev formula total precondit defin disjunct schema oper schema denot oper agent execut formula execut outcom achiev goal ad set event intent action ad perform action formula queri goal achiev goal formula remov formula plan check provid formal specif attempt address distinct concern share rao origin state bring dispar strand theori bridg gap formal specif implement system claim specif present directli animat make full implement closer provid clean explicit state oper state underli implement anim specif made simpler exist tool standard specif tackl problem softwar engin perspect make specif access amen implement identifi data structur requir oper reform reveal number error omiss origin includ relat specif aspect bind omiss case agent oper incorrect assert intent stack execut event queue inappropri engin formal comput model identif error due process fact precondit oper enabl identifi miss case origin properti specif check syntax type correct obviou step move forward regard develop proof relat possibl proof tool develop work aim anim implement specif specif base specif sophist system dmar choic place start statu simplifi version sophist abstract instanti complic provid specif implement examin aspect model detail concern map architectur formal agent framework construct order closer link altern agent model specif step path relat point final concern develop librari agent architectur agent compon ti implement platform kei project goal pursu work formal specif agent system support principl develop practic system envisag collect specif exist system distinct agent compon select problem basi implement specif paper part larger ambit acknowledg anand david kinni michael georgeff provid illumin insight discuss author develop specif paper australian artifici intellig institut support host author develop work anonym made valuabl comment specif document check fuzz packag refer bowen formal specif document case studi approach intern thomson comput craig formal specif advanc ai architectur elli introduct formal method john dinverno specif implement interact conferenc system ieee usa publish dinverno hu specif hypertext model formal specif lectur note comput page engin formal comput model howel formal framework design methodolog softwar improv wooldridg formal specif dmar intellig agent fourth intern workshop agent architectur languag springer dinverno luck contract net goal direct system van de veld agent break seventh european workshop model autonom agent lnai page luck formal framework hypertext system iee softwar pischel pragmat bdi architectur intellig agent workshop agent theori architectur lnai page garlan role formal reusabl framework acm softwar engin genesereth nilsson logic foundat artifici intellig morgan georgeff lanski reactiv reason plan sixth nation confer artifici page aaai press mit goodwin formal specif agent properti journal logic haddadi architectur ohar foundat distribut artifici page john wilei experi anim formal specif lectur note comput page jen specif implement belief desir architectur collabor problem solv journal intellig cooper inform luck dinverno formal framework agenc autonomi intern confer page aaai press mit luck dinverno engag cooper motiv agent model distribut artifici intellig architectur australian workshop distribut artifici lectur note artifici page springer dinverno agent theori agent case studi intellig agent intern workshop agent architectur lectur note artifici page specif soar architectur technic report school comput carnegi mellon rao bdi agent speak logic comput languag van de veld agent break seventh european workshop model autonom agent lnai page rao georgeff abstract architectur ration agent knowledg page system formal specif lectur note comput page engin formal comput model spivei understand specif languag formal semant cambridg spivei manual comput scienc spivei notat prentic davi refin proof prentic wooldridg jen formal cooper problem solv process thirteenth intern workshop distribut artifici notat definit detail provid extens ran dom addit law explain oper appli found dom px ran py ffl fx ffl xg ran fx ffl yg auxiliari definit gener definit specif includ complet defin map function argument appli element list set map ys seq ffl map map hxi hf xi map map xs map ys xs px ffl xs fx xs ffl xg assert element option definit provid option exist predic defin undefin test element option defin extract element defin member option option fx px xs engin formal comput model defin undefin option xs option ffl defin xs xs undefin xs xs xs option defin xs ffl xs bind substitut provid detail standard definit bind standard definit substitut map variabl term variabl term domain map repres partial function variabl term variabl map term function return variabl defin end section substitut ff var term appli substitut appli ident map variabl variabl domain appli substitut domain substitut var term var ffl var ffl var defin mean substitut appli term substitut term term ts seq substitut functor ffl ran const ran var ran functor term map ts function appli substitut atom simpli matter appli bind term term list appli function defin analog substitut atom atom substitut ffl engin formal comput model substitut action action substitut ffl function appli substitut trigger formula plan construct similarli defin substitut belief belief belief liter substitut ffl liter liter substitut belief substitut ffl belief belief belief belief goal goal goal goal goal goal goal goal substitut formula formula act atom atom ffl substitut plan plan plan ffl plan map composit substitut substitut oe variabl bound oe composit written obtain appli term oe combin bind oe variabl bound oe oe case oe engin formal comput model substitut oe substitut ffl oe fx var term oe ffl unif substitut unifi term appli make equal substitut ffl similar predic defin unifi trigger event substitut ffl predic unifi express defin similarli substitut gener substitut exist substitut mg oe substitut ffl oe mg substitut ffl gener unifi express substitut unifi express unifi gener defin partial function express unifi specif function goal set belief trigger event goal due space definit function simpli signatur defin analog substitut oe substitut ffl oe substitut ffl mg substitut substitut receiv august
IR/1151 5 queri data georg gottlob christoph koch artifici intellig group technisch universität austria abstract monad queri languag tree receiv interest problem select node tree basic widespread queri problem context xml partli survei recent work author group logic queri languag problem paper number result relat complex languag axi relat motiv presenc xpath standard util data extract introduct speak term distinguish featur monad queri singl free select subset domain input defin monad logic predic variabl ariti primarili studi queri monad conjunct queri monad datalog context tree implicit order sibl conveni abstract web document xml monad conjunct queri conjunct queri unari head predic monad datalog program set conjunct queri interpret datalog rule queri languag natur formal select subset node tree monad queri languag appli data primari xpath heavili standard similar languag select node document root work support austrian scienc fund project eu research train network game xpath queri incorpor import includ xpointer xslt xml schema xml queri languag constitut core xml data access function select interest applic monad queri languag extract inform web document tree wrapper defin set inform extract function filter relabel tree node monad queri languag defin wrapper requir express power earlier paper studi express monad datalog discov languag captur monad logic tree focu conjunct queri datalog queri languag concert monad conjunct queri build block monad datalog program studi independ monad datalog serv natur formal encod effici evalu monad conjunct problem paper elabor defin studi languag constitut logic core xpath core core xpath nice fit logic compar acycl monad conjunct queri queri compar conjunct queri classic relat set give account previou work monad queri tree extend state art respect aim surpass express monad datalog carri complex studi languag shown monad datalog tree evalu time linear queri result heavili depend tree data repres obtain tree repres term natur label relat data tree paper author titl chandra merlin model xml document inform research paper repres titl paper fc author ns fc fc ns chandra merlin relat interest question gener binari relat queri axi includ transit relat quadrat retain favor comput characterist extens express power monad datalog remain improv practic queri languag queri titl paper xml document queri formul write monad conjunct queri label axi pain provid monad datalog singl monad conjunct rule formul predic earlier result directli extend mention complex obtain queri evalu problem polynomi relat work base wealth eleg regular tree logic automata recent research activ relat theoret aspect xpath queri languag show xpath combin combin complex result monad datalog tree research result good reason algorithm process xpath similar languag publish serv yardstick algorithm emphasi combin complex queri evalu queri data consid linear data complex queri languag captur theorem long time note unlik set conjunct queri relat queri queri evalu languag problem differ strongli natur hard address queri evalu refer work queri xpath contribut give overview earlier result monad express power show acycl monad datalog rule complex regular path express relat effici rewritten rule primit relat express regular path express conveni express xpath axi relat monad datalog program consist sole acycl rule evalu linear time present core xpath languag build earlier work present show combin complex describ analog core xpath monad datalog tree ctl show monad datalog rule effici rewritten acycl rule transit closur simpl procedur give favor answer open question combin complex practic web wrap linear contrast previou point limit tractabl show close relat queri evalu problem boolean conjunct queri regular path relat defin term acycl boolean conjunct queri variabl rang tree node label boolean conjunct queri edg relat dag show monad datalog acycl transit ax descend combin queri evalu complex structur paper section provid basic notion section discuss earlier result monad datalog tree section present result acycl queri section address core xpath section present method elimin lead combin complex result section discuss result section conclud studi queri preliminari basic notion tree finit unrank tree consid tree defin normal node assum children node fix order node label finit nonempti set symbol alphabet unrank tree consid relat structur tu dom set node tree relat defin intuit mean binari denot relat node children true iff children common parent true iff label tree monad logic tree logic languag consist variabl rang set equal structur obtain ad predic defin structur formal remov redund variabl rang set boolean connect quantifi node set relat symbol tree structur node syntact possibl boolean oper relat symbol set refer sentenc form pn pi set variabl ψ formula easi defin natur total order dom parent call document order context wrap html document unari queri unari predic defin formula free tree languag defin iff close formula ϕ tree structur regular tree languag recogniz number finit nondeterminist descend tree automata nondeterminist determinist ascend tree automata determinist nondeterminist tree automata provid definit determinist tree automata definit determinist unrank tree automaton tupl finit set σ δ transit function σ st regular languag state set final state semant tree defin induct consist leaf node label ɛ label children tm qm run call success tree tree iff set accept denot definit tree languag regular iff accept determinist tree automaton classic result rank shown hold unrank tree proposit tree languag regular iff defin remark context repres html xml document data model unrank worthwhil infinit alphabet merg html tag attribut assign label requir gener notion relat structur consist domain dom countabl possibl set finit number nonempti result cite shown paper proposit proven finit trivial hold infinit alphabet case symbol alphabet node part label domain element express predic imposs quantifi symbol σ queri languag refer finit number symbol σ relat discuss preliminari note encod tree structur binari relat domain node label encod problem hard level polynomi hierarchi avoid problem assum finit set σ attribut assign list charact symbol model document tree conjunct queri queri graph basic definit theori interest monad conjunct queri base predic ariti exce refer simpli section cq form zm necessarili distinct pn necessarili unari rm necessarili binari predic arrow call bodi denot call distinguish head variabl occur call head bodi consist conjunct written list satisfact queri map θ dom variabl replac bodi conjunct true head variabl queri return node iff exist satisfact θ assum maintain set fashion deal duplic queri graph cq graph obtain variabl node binari atom edg annot node graph unari atom assum reader familiar common notion tree direct undirect form state explicitli undirect notion term talk queri graph binari relat repres tree intuit improv inform content visual direct queri graph read undirect queri graph queri introductori edg type acycl arrow shown visual mean arrow point parent children note direct acycl graph wrt arrow cyclic undirect interpret count cyclic queri graph cq call acycl iff queri graph acycl notion special case compat wealth previou work hypergraph graph acycl iff forest forest tree connect cq variabl ear iff occur singl binari atom monad datalog tree syntact restrict fragment standard datalog adher usual minim model defin consequ oper tp extens datalog stratifi negat standard monad datalog program set monad conjunct queri predic head rule program call call extens set ground atom assum true predic fix extens input signatur denot finit set predic signatur repres tree tu denot extens order compar monad make assumpt monad datalog denot function assign predic node tree select subset result part proposit arbitrari finit monad datalog queri monad datalog power defin unari queri shown simul queri automata captur express defin unari monad datalog proposit unari queri monad datalog queri st queri return result monad datalog program dedic predic accept tree iff ω root node infer extens monad datalog program recogn tree languag accept result similar result monad fixpoint logic tree express tree languag shown straightforward simul tree automata monad datalog proposit tree languag regular iff defin monad datalog complex shown gener data complex queri finit structur bound linear time unrank label tree shown monad datalog queri tree evalu time linear size queri proposit monad datalog stratifi combin complex size input program size data program complex complet linear time proof sketch observ binari predic function depend column column monad datalog program appli transform split connect part head creat rule proposit head predic add proposit predic origin rule replac remov part rewritten easi transform linear size program rule transform program variabl function determin variabl connect binari predic graph function variabl reachabl linear number relev ground instanc size comput linear time fixpoint ground program comput time linear size program fact gener ground program stratifi process strata algorithm composit step requir time upper bound combin complex linear time data program complex problem respect program gener proposit acycl conjunct queri regular path express set binari relat σ regular express concaten kleen star disjunct alphabet σ regular path express support express form induct interpret binari relat reflex transit closur shortcut rr document order relat standard xpath defin order open tag document tree node reach read document flat left encod document order regular path express lemma set binari relat defin regular path express unari predic algorithm comput monad datalog program defin unari predic pr true proof regular express translat nondeterminist finit automaton alphabet linear time construct disjunct oper found introductori book automata theori present construct δ repres regular path express build proce translat automaton singl final state state link obtain automaton replac transit transit relat ɛ replac exchang final state creat monad datalog program defin pr basi ar tupl tupl tupl easi verifi encod node reach node st true path match datalog program produc encod comput relat defin regular path express unari predic monad datalog encod lemma regular path express label relat defin linear elimin complet rewrit rule form obtain encod proposit formal techniqu evalu acycl conjunct queri long theori commun appli special case relat binari proposit monad datalog program unari binari predic rule head variabl assum variabl ear set atom alter program obtain replac atom atom ad paper introduct proposit rule translat theorem τ signatur consist number binari predic defin regular path express monad datalog program τ rule acycl rewritten monad datalog program linear time proof tree ear queri graph acycl rule arc emphasi defin regular path express iter elimin proposit direct monad datalog signatur τ linear time combin complex program data tree upper reduct show monad datalog captur requir acycl conclud proposit monad datalog τ rule captur tree monad queri languag tree hand express low evalu complex remaind appli practic problem xpath process web inform core xpath point xpath import languag queri xml fragment xpath logic core lack account express power defin number regular path express found promin axi relat xpath inspect standard document reader verifi definit regular path express coincid list complet ax simul axi conjunct singl check label definit ɛ child parent child descend child ancestor descend child definit languag core xpath defin abstract χ χ pred pred pred pred pred pred pred start χ stand axi definit label σ mean label dom semant core xpath queri defin function dom dom dom result queri π exampl standard syntax xpath abbrevi version make axi explicit core xpath fragment syntact semant core xpath acycl conjunct queri axi relat core xpath encod monad datalog stratifi negat make obviou provid encod core xpath languag definit datalog sr sr sr sr sl χ sl sl sl sl sl core xpath queri π return node tree iff sr true fixpoint program obtain defin predic sr term simpler predic observ proposit core xpath linear time combin complex result obtain techniqu framework author report experi wide xpath show system queri behavior evalu complex number encompass fragment xpath full effici algorithm problem present method cover pend patent proof encod map core xpath queri monad datalog negat signatur τ translat monad datalog stratifi negat linear time conclud section put core xpath context logic languag point suciu fragment xpath express comput tree logic cf extend fragment xpath treat call xp full core xpath core xpath queri consist locat path sequenc locat statement form χ number condit bracket assum locat path length entail loss core xpath queri rewritten satisfi requir addit condit ax main locat path queri length goal select titl node children paper node queri locat path consist step obtain queri queri tree make queri select root fragment core xpath encod plain ctl extens ax definit ef ef true ax dealt ctl oper denot past version past version queri translat ctl titl remain requir multimod modal denot denot multimod ctl past oper check linear time queri translat suitabl fragment datalog lite obei complex bound translat requir simpl gener ctl datalog lite ad axi signatur label unrank monad datalog captur practic languag desir state rule make child relat necessarili acycl machineri introduc rewrit rule rule queri complex bound gener npcomplet result conjunct queri hold predic ariti complex signatur τ rel fs function depend column mean defin ls chase classic method appli logic depend conjunct queri linear time function depend definit rule function depend binari cq function depend atom replac occurr function depend atom replac occurr algorithm monad datalog rule rule τ replac occurr atom variabl replac occurr atom variabl rule appli chase rule replac atom fs theorem rule signatur rule obtain appli algorithm algorithm run time step mean chase procedur kind implement run linear time theorem rule rule obtain appli algorithm graph rule cycl unsatisfi proof sketch binari predic show distinguish number case direct atom defin reflex transit closur direct cycl consist atom creat algorithm kind direct permut entail unsatisfi true point loop undirect cycl atom rule unsatisfi atom distinct rule unsatisfi algorithm produc cycl belong class left undirect cycl consist atom virtu atom graph direct cycl forest theorem shown appli algorithm rule elimin rule unsatisfi obtain program renam atom replac variabl shown section theorem monad datalog program rewritten program rule acycl transform effect linear time size program queri rewrit acycl queri graphic translat lc ch ns fc lc ns ns consequ previou corollari evalu algorithm monad datalog time applic tree wrap import applic rule axi requir wrap defin wrap languag call basic simpli monad datalog predic defin modulo check simplifi function fragment kernel wrap languag system previou monad datalog linear time term queri corollari wrapper languag linear time queri complex rule obei syntact restrict facilit visual captur visual wrapper specif process system creat wrapper program acycl made simpl mean limit tractabl acycl conjunct queri regular path express defin relat evalu complex queri acycl restrict theorem queri complex boolean conjunct queri binari predic defin regular path express tree proof membership np hard reduct result true tree simpl path length structur fc short graph encod boolean conjunct queri bodi atom edg graph natur definit iff true set dom defin fc fc fc fc regular path relat complex result conjunct queri child relat tree linear robustli edg relat dag theorem evalu boolean conjunct queri edg relat dag proof reduct graph assum arbitrari total order node queri bodi atom edg vi add data dag consist node bi edg δ γ satisfi dag iff note conjunct queri edg relat graph gener long final part illustr remark show evalu acycl conjunct queri extend label variabl label refer variabl rang label document node binari predic label unari predic label label iff node label tree conjunct queri label variabl match tree iff queri label atom satisfact θ dom pair atom label label label label theorem queri complex acycl conjunct queri label variabl tree proof membership np clear hard reduct undirect graph loss assum node node add node arc creat queri easi verifi queri satisfi data tree root node label descend queri report number favor complex result acycl queri queri show opposit side provid result gener conjunct queri motiv search interest fragment cyclic conjunct queri tractabl report fragment queri evalu support transit closur ax investig addit class work chart tractabl frontier goal section find effici algorithm evalu queri signatur child child pi unari predic algorithm boolean conjunct queri tree truth dom chang pi st st return return child child theorem boolean conjunct queri unari child child tree algorithm return true iff true proof show sound algorithm complet fact rule elimin assign enforc requir local hold solut satisfact algorithm elimin singl assign restrict case queri graph connect gener case shown argument proof proposit extract satisfact θ dom θ empti θ undefin tree encount variabl assign add set induct show induct boolean queri consist atom variabl satisfi θ comput final θ satisfact variabl assign elimin algorithm satisfi unari atom binari atom variabl ad atom claim hold trivial assum variabl ad current step atom hold addit previou step assum θ satisfi form child elimin rule algorithm node path root st node visit proce defin node assign node document order assign node encount occurr left path root node assign queri shown left binari atom form child assum variabl queri unari atom show data tree label node assign easi verifi elimin algorithm return xi label xi show map θ obtain tree ad encount variabl θ θ satisfact queri note algorithm answer monad head branch node tree incorrectli label algorithm theorem boolean conjunct queri time combin complex proof sketch theorem connect boolean conjunct queri true tree iff encod fixpoint comput algorithm monad datalog consist rule regular path express lemma proof abbrevi node children properti defin leaf node leav node coincid child properti earlier sibl properti parent sibl atom atom root atom program comput complement obtain algorithm construct exploit order inform tree check predic variabl assign node true node region tree descend program gener time monad datalog program evalu time linear size size theorem corollari monad datalog polynomialtim combin complex proof evalu monad datalog program monad conjunct queri bodi head variabl evalu run algorithm boolean conjunct queri queri time fix desir head variabl set auxiliari relat fixpoint obtain iter appli evalu method monad rule atom deriv ground atom idb predic atom set true monad rule entail true atom set algorithm monoton fixpoint reach step refer vianu foundat abiteboul vianu regular path queri constraint gottlob inform web wrap proc gottlob web inform extract proc neven formal model express fragment xslt cl lnc page wood tree languag unpublish symmetri xpath technic report short version tanca program chandra merlin implement conjunct queri relat data confer record ninth annual acm symposium theori comput page voronkov express power logic acm comput survei deutsch tannen integr constraint xpath krdb ceur workshop gallier algorithm test satisfi proposit horn journal logic emerson modal van handbook theoret comput volum chapter page elsevi scienc publish evalu proc intern confer deduct queri languag model acm transact comput gottlob koch datalog express power web inform extract proc acm symposium principl system algorithm process xpath proc intern confer larg data base hong aug hopcroft ullman automata publish ma han enabl wrapper construct system web inform intern confer data maier theori relat comput scienc suciu xpath proc acm symposium principl system vianu xml acm symposium principl system page simplifi unit resolut algorithm horn formula comput inform process neven express effici pattern languag data proc symp principl system page acm press neven automata finit theoret comput scienc papadimitri comput complex sahuguet intellig web applic lightweight data knowledg thoma infinit van handbook theoret comput volum chapter page elsevi scienc publish thoma rozenberg handbook formal volum chapter page springer ullman principl base system vol comput scienc ullman principl base system vol technolog comput scienc wood xml pattern cl lnc page world wide web consortium world wide web consortium xpath world wide web consortium xsl transform recommend version world wide web consortium pointer languag version candid sept world wide web consortium schema part primer
Agents/1152 1 model design system david kinni michael georgeff australian artifici intellig institut melbourn australia abstract agent technolog appli develop commerci industri softwar system system involv thousand press system model techniqu permit complex effect principl methodolog guid process system design adequ techniqu support design system suffici maintain difficult element present techniqu model agent system adapt extend exist methodolog clear conceptu framework guid system design specif develop techniqu system agent base sought provid framework descript agent system suffici gener applic agent extend wai introduct agent paradigm ai base notion entiti uncertain world perceiv act agent technolog appli develop commerci industri softwar system area air traffic airlin resourc spacecraft simul busi process deal commun network manag system involv thousand press system model techniqu permit complex effect principl methodolog guid process system design adequ techniqu support design system suffici maintain difficult element work support part cooper research centr intellig system australian govern cooper research centr program foremost model techniqu methodolog develop design specif convent softwar system approach base central notion object encapsul state inform collect data valu provid behaviour interfac oper inform oo methodolog guid kei step object permit abstract object class inherit class hierarchi attempt develop methodolog model provid adequ support process agent system pragmat explor exist oo model techniqu extend appli bdi agent system oo techniqu achiev widespread accept advantag larg commun softwar develop familiar exist build adapt advantag matur aim develop model methodolog easili learnt understood familiar oo paradigm reach similar intuit model techniqu agent system emploi set model oper level abstract extern system model inherit hierarchi agent individu agent instanc agent class servic inform world requir extern interact intern emploi set model structur inform motiv state agent control structur determin behaviour plan design methodolog base identif kei role applic guid elabor agent class hierarchi analysi agent class lead identif servic provid extern goal event respond progress decomposit produc model produc concret agent inher modular agent boundari defer late stage design process assum reason level familiar oo model techniqu contrast similar differ oo ao approach focu detail model techniqu develop section outlin ao model techniqu section present detail goal plan model describ individu section agent model describ structur system section present essenti methodolog guid develop refin model model techniqu model techniqu describ system identifi kei object class applic behaviour relationship class essenti detail system design captur type model object model captur inform object describ data relationship oper support dynam model describ activ interact system behaviour function model describ flow data system system compon dynam function model serv guid refin object refin oper object provid fulli refin object model complet specif object base system object concept appli uniformli level abstract agent found highli desir adopt special set model oper distinct level abstract extern system model complex object servic inform requir extern interact intern element requir agent architectur model agent agent plan descript agent system extern viewpoint captur larg independ bdi architectur agent model describ hierarch relationship abstract concret agent identifi agent instanc exist exist interact model describ agent servic control relationship agent class includ syntax semant messag commun commun agent system user interfac intern agent class specif bdi describ inform motiv state potenti behaviour belief model describ inform environ intern state agent class action perform belief agent chang belief set belief state instanc belief set defin agent initi mental state goal model describ goal agent possibl event respond consist goal set specifi goal event domain goal state set ground goal agent initi mental state plan model describ plan agent possibl emploi achiev goal respond event perceiv consist plan set describ properti control structur individu plan implicit execut properti architectur determin event goal give rise intent lead action belief goal detail ensur intent evolv ration architectur ensur event respond time belief maintain plan select execut proce manner reflect notion ration commit agent system model techniqu emploi object class instanc describ kind entiti system level abstract unlik standard oo mean relationship inherit instanti distinct kind entiti partit type entiti separ model maintain import simplifi process consist model result commit bdi execut emploi oo dynam augment notion directli execut specif gener agent plan advantag oo approach program object method guid dynam model plan requir total specif success mean achiev inher architectur oo object dynam model techniqu suitabl extend serv basi specif model suppli agent design form diagram develop special edit text file serv input compil process produc execut system model individu agent belief model belief model consist belief set belief state belief set set object diagram defin domain belief agent class belief state set instanc diagram defin instanc belief set tank regul tank valv tank tank leg statu posit boolean pressur pressur type statu statu statu regul action action type posit posit posit valv type pressur real type quantiti real pressur quantiti quantiti pressur pressur pressur boolean leak pressur vessel connect belief class associ deriv predic function fig belief class deriv predic function belief set belief set set predic function argument term set type domain function domain directli deriv class definit belief set associ class definit defin oper associ defin predic function schema belief set diagram acycl graph node denot abstract concret belief class belief class repres class abstract class distinguish presenc adorn upper section icon edg graph denot inherit distinguish triangl vertex point superclass aggreg associ belief class permit class defin belief set diagram real object applic unlik oo object definit defin behaviour object implement repres agent belief object belief class serv defin type signatur attribut function appli predic appli includ special role plan belief set formal defin definit set fd dn set type set belief properti specifi attribut pair type domain type attribut denot predic denot tupl st ae function denot tupl st ae belief set tupl set predic schema zg set function schema zg defin binari usual attribut accessor function gener predic function defin special oper notat object class oper defin implicitli argument deriv predic function predic defin binari higher order associ class multipl associ usual figur show belief class nasa shuttl diagnosi predic function deriv predic function implicit argument attribut oper anonym class extend standard notat attribut oper option properti properti deriv predic store belief chang predic negat semant belief properti predic function constitut agent belief set classifi predic store relat belief function automat gener predic function binari predic deriv attribut definit associ evalu predic function comput requir extern suppli function underli program languag action special evalu predic effect bring chang extern environ tank regul tank valv tank tank leg posit cl connect deriv predic instanc belief instanc associ fig belief instanc deriv predic predic stand properti associ rememb moment moment major role definit abstract goal function evalu evalu predic function static dynam repres fix relat function definit depend evalu chang time predic dynam predic negat semant evalu predic semant predic negat properti predic function keyword properti list associ default predic function properti class repres properti list adorn class icon figur attribut class pressur vessel properti indic attribut pressur properti indic unknown class adorn indic abstract belief state belief state specifi state agent initi initi mental state consist set instanc predic set belief diagram object instanc associ predic instanc deriv instanc diagram manner analog predic deriv class figur show fragment instanc diagram nasa rc predic instanc belief state belief model formal defin definit belief set instanc predic tupl belief state set instanc predic belief model pair set belief state goal model agent class goal model consist goal set goal state goal set specifi domain goal agent class goal state set ground instanc element goal set initi agent initi mental state goal set set goal formula signatur formula consist modal goal oper appli predic belief set modal goal oper achiev denot goal achiev oe verifi denot goal verif oe test denot goal determin oe hold goal formula occur activ bodi plan activ event activ perform find set plan activ event match goal execut determin success failur activ modal determin activ perform depend type agent initi belief execut sequenc occur goal achiev succe predic believ hold match plan execut successfulli sequenti goal fail postcondit success complet predic believ hold function deriv separ state evalu predic function initi goal verif succe predic believ fail predic believ hold case predic unknown plan execut result match plan execut successfulli goal fail postcondit success complet predic believ hold goal determin succe predic believ hold hold case predic unknown plan execut result match plan execut successfulli goal fail postcondit success complet predic longer unknown definit belief set goal set set tupl set goal properti specifi goal state set pair qi ground instanc predic definit requir agent goal base predic belief set combin modal oper predic goal determin appli evalu predic succe combin permit plan model plan model consist set plan set individu plan plan denot form class icon plan restrict set predefin reserv attribut gener plan diagram figur lower plan state transit similar oo dynam model unlik oo plan descript system behaviour develop analysi directli execut prescript agent behav achiev goal respond event element plan graph type start end state intern type direct transit start state denot small fill circl ffl end state pass fail denot small target small entri sign intern state passiv activ passiv state substructur denot small open circl activ state activ denot instanc icon activ denot formula agent goal iter includ case graph graph call subgraph plan plan attribut plan graph plan bodi ffi fl fi ffl activ formula uh event action event condit fi event condit action uh condit action activ event activ condit activ action uh pass pass action fail fail action abort condit abort action document fig gener plan diagram action attach transit state transit state occur event provid condit true transit occur action perform condit predic agent belief set action includ defin belief action includ assert retract updat belief state agent failur unlik convent oo dynam base harel statechart plan graph semant incorpor notion failur failur graph occur action transit explicit transit fail state activ activ state termin failur outgo transit enabl graph bodi graph activ state termin failur graph plan plan termin failur plan activ perform subgoal activ result activ termin depend avail altern plan perform activ plan execut initi transit plan graph label activ event activ condit determin context plan activ activ event belief event occur agent belief chang extern lead goal event occur result execut subgoal activ lead activ option activ action permit action plan activ plan consist belief goal model agent class goal event occur plan defin belief goal model plan model includ plan respond event plan respond event goal possibl intersect plan respond event context multipl plan applic event activ parallel activ sequenti success termin activ transit activ state label event pass fail denot success failur activ state transit activ state label event occur condit activ interrupt special case abort transit plan plan time execut bodi abort condit true termin failur final transit plan graph label action failur abort plan plan properti plan properti reserv attribut influenc plan execut proce goal event prioriti properti determin order multipl concurr activ plan execut properti determin order plan respond goal success properti specifi goal retri plan fail absenc set plan applic goal execut arbitrari order plan succe properti order determin properti system design ensur plan plan lower goal properti import modifi behaviour inherit discuss section wind data profil flight plan radar data ffl ffl predictor planner monitor ffl gener aircraft ffl wind model coordin ffl ffl ffl coordin fig atm agent class instanc diagram model system detail model captur state behaviour individu proce describ system model begin describ agent specifi hierarch relationship abstract concret agent identifi agent instanc exist system model agent central problem give semant relationship class issu detail illustr model techniqu emploi model layer architectur distinct wai agent model agent model agent class defin abstract concret agent class captur inherit aggreg relationship agent instanc identifi agent instanc properti system small number agent class instanc combin singl diagram figur show simplifi combin agent diagram air traffic manag applic domain note attribut agent class diagram agent class model acycl graph node denot abstract concret agent class agent class repres class abstract class distinguish presenc adorn upper section icon edg graph denot inherit distinguish triangl vertex point edg denot aggreg diamond adjac aggreg class associ agent class agent class oper attribut restrict set predefin reserv attribut class plan attribut plan multipl inherit permit denot aggreg context agent model relationship special semant agent inherit refin plan model superclass note set plan individu plan aggreg denot incorpor agent subag access plan instanti captur properti exist clone figur monitor abstract agent subag gener aircraft monitor radar data agent flight plan agent subag gener wind aircraft profil flight plan agent monitor predictor share belief flight monitor belief wind data aircraft predictor belief radar data detail inherit aggreg section follow attribut agent class includ determin initi mental state element set default initi mental state agent attribut belief model abstract aircraft profil agent defin belief state aircraft type concret aircraft agent inherit data valu belief state set initi belief state inherit agent model inherit fundament relationship agent class form basi structur agent class model agent class goal plan describ intern state behaviour inherit agent class defin extens restrict goal plan model superclass extend special subclass inherit belief agent class inherit belief model superclass section belief model consist belief describ potenti belief agent class chang belief state set belief valu agent initi mental state element agent classs belief set set predic function argument term predefin userdefin type domain predic function directli deriv belief class definit agent class combin belief model superclass predic function directli deriv belief class associ defin subclass belief diagram includ belief model type defin superclass belief set includ provid type defin superclass predic function defin superclass belief set includ provid attribut type includ predic instanc defin superclass belief state includ provid predic definit includ net effect process definit subclass overrid incompat definit superclass resolv subclass inherit definit prefer straightforwardli defin belief class subclass inherit directli prefer refer unambigu fulli qualifi includ superclass prefix set predic function deriv set belief refer predic function uniqu type requir associ belief model uniqu method inherit belief model combin preserv desir properti approach inherit belief agent class overrid extend belief model superclass agent class special element belief model superclass redefin function chang predic inherit goal agent classs goal model determin goal event occur activ event plan subgoal activ bodi plan section goal model defin modal goal oper subset predic belief set oper appli event handl similar manner goal event defin agent class combin goal model superclass inherit goal event predic inherit belief model approach goal inherit consist maintain case agent class special goal event inherit superclass redefin goal retri inherit plan agent class inherit plan model superclass section plan model set activ event specifi event goal activ condit specifi context valid plan agent class superclass combin plan defin subclass includ plan model plan superclass plan model includ provid compat belief goal model plan defin subclass superclass net effect process plan model agent class affect plan defin superclass extend ad plan achiev exist goal exist ad plan achiev exist goal ad plan achiev exclud plan redefin modifi prioriti inherit plan note behaviour inherit plan affect indirectli belief goal model subclass chang properti predic occur goal affect plan execut goal inherit plan lower defin order applic plan execut goal reflect order agent inherit hierarchi default order explicitli defin mechan fulli qualifi goal formula qualifi agent class search plan activ event match search begin design class plan inherit behaviour subclass special agent class defin plan respond goal defin agent class inherit restrict context activ ad conjunct oe activ condit defin plan properti respond fail immedi oe post subgoal activ result directli activ goal fail aggreg agent model aggreg secondari relationship agent class group class inherit call form part aggreg separ modul goal plan model independ aggreg class goal plan model subag directli affect interact asynchron messag pass physic distinct agent model techniqu develop distinct drawn sort agent logic agent encapsul state develop system design independ physic agent actual logic share ident extent coexist singl process aggreg system structur construct boundari physic agent system set differ individu logic agent physic agent simpl system figur physic aircraft agent consist logic independ monitor subag object orient system process agent system process intern agent question agent depend logic physic agent consid number type logic agent system decoupl physic defer late stage system design process consequ flexibl system structur construct offer layer agent architectur view system coupl individu agent extend individu layer implement system abil model architectur uniform framework strength approach instanti agent model relationship occur agent relationship agent class instanc class captur properti exist clone agent instanc model instanc diagram defin static agent set set agent instanti dynam agent set set agent instanti distinguish adorn fl upper section icon commun subag faster reliabl agent separ process agent instanc instanc icon link concret agent class instanti repres dot vector instanc class static instanc dynam instanc defer till instanti multipl notat instanc end instanti link dynam class multipli instanti initi mental state agent instanc valu element belief goal state set agent class default valu agent class dynam agent instanc attribut overridden time agent creat implement layer architectur layer layer layer layer agent layer agent fig combin agent layer inherit aggreg abil agent model techniqu architectur support physic agent system highlight properti abil straightforwardli implement special architectur layer agent interrap tour machin state behaviour layer separ logic agent class straightforward wai combin illustr figur combin creat agent class inherit layer class approach lead tight coupl fact requir goal plan layer class disjoint serv implement emploi aggreg creat agent class layer subag constraint content exist separ namespac layer share commun messag physic distinct agent design methodolog methodolog support design specif agent system provid clear conceptu framework enabl complex system manag decomposit abstract methodolog advoc decomposit system base kei role applic identif role relationship guid specif agent class hierarchi agent instanc class analysi agent class lead identif servic provid extern interact issu creation durat role interact determin control relationship agent class develop extern model detail captur agent interact model section methodolog elabor refin express major step identifi role applic domain dimens analysi role organiz directli relat requir system implement identifi lifetim role elabor agent class hierarchi initi definit agent class assum granular agenc identifi servic provid fulfil servic provid agent servic includ interact extern environ human user requir agent monitor notic event respond appropri perform includ notifi agent user induc requir agent notifi condit detect agent user agent class servic level identifi interact provis perform requir inform content identifi event condit action inform requir determin control relationship agent point intern model agent class perform refin agent hierarchi common inform servic agent introduc agent exist agent class encapsul common agent inherit guid common inform similar servic introduc concret agent account implement depend commun cost refin control relationship base lifetim introduc agent instanc servic descript behaviour level role set set servic servic activ natur term ident perform role initi identifi serv start point agent result process analysi role level servic intern model model agenc produc accord mention concret agent result reflect group servic differ origin role identif agent boundari defer inform procedur perform servic elabor result concret agent intern structur inher modular simpl servic relationship interact agent repres associ agent chosen describ separ model model agent interact subject intens model develop address issu inform content linguist intent protocol coordin negoti hold strong view gener suitabl techniqu model methodolog model framework design select model applic domain interact model captur control relationship agent creation team format model techniqu relationship subject ongo research develop intern model methodolog develop model begin servic provid agent event interact defin determin goal agent achiev analysi goal breakdown subgoal lead natur identif goal achiev appropri manner plan carri gener depend agent belief state environ possibl inform agent belief context includ belief repres work data context repres term data entiti relationship analysi context result elabor belief agent methodolog intern model express step analyz mean achiev goal analyz context goal achiev goal repres action analyz order condit activ action failur dealt gener plan achiev goal repeat analysi subgoal build belief system analyz condit control execut activ compon belief analyz input output data requir subgoal plan make inform belief output prior subgoal plan step iter model captur result analysi progress refin refin intern model feed back extern build plan belief agent class clarifi inform requir respect monitor notif analyz interact deriv lead redefinit servic unlik primari emphasi methodolog goal kei abstract manag complex analyz applic domain term context focu type behaviour lead primari emphasi oo methodolog small paradigm subtl lead substanti analysi compar behaviour stabl applic domain correctli identifi goal lead robust system behaviour accommod wai achiev goal analysi result modular design plan modular plan context ad chang exist plan goal result extens design cope frequent special permit increment develop test primari contribut paper provid element rigor framework model complex system present model techniqu describ extern intern perspect base bdi build adapt model agentori emphasi permit analysi agent boundari chosen flexibl result system design extens semant aggreg instanti relationship agent class instanc power flexibl mechan enforc modular state behaviour share agent relat plan encapsul separ class group aggreg inherit abil agent class refin addit plan composit framework system design encourag encapsul make tractabl task analyz interact crucial process design verif build adapt aim advantag matur develop model methodolog easili learnt understood familiar oo paradigm import mainten system carri softwar analyst engin research successfulli appli scale commerci industri applic refer barbuceanu mark fox languag describ coordin system intern confer multiag san booch analysi design applic benjamin redwood jennif sandra carberri gener subdialogu consult fourteenth intern joint confer artifici page philip cohen hector levesqu commun action artifici agent intern confer san inn ferguson integr control coordin case agent model intellig workshop agent languag lnai springer verlag tim finin al specif kqml agent commun languag technic darpa knowledg share extern work barbara grosz candac sidner plan intent commun mit haddadi reason interact agent pragmat theori phd manchest institut scienc unit harel statechart overlap acm transact softwar engin david kinni distribut reason system architectur languag specif australian artifici intellig david kinni michael georgeff commit effect situat agent thirteenth intern joint confer artifici page david michael anand rao methodolog model techniqu system bdi agent agent break seventh european workshop model autonom agent maamaw lnai springer verlag thiel model reactiv behaviour vertic layer agent architectur intellig workshop agent languag lnai springer verlag pan tenenbaum intellig agent framework integr ieee transact man anand rao michael georgeff abstract architectur ration agent intern confer principl knowledg kr page jame michael william frederick william model design prentic englewood candac sidner artifici languag collabor negoti twelfth nation confer artifici page
IR/1153 5 automat text summar multipl document thesi jade goldstein languag technolog institut carnegi mellon pa june abstract electron text inform exponenti grow time critic virtual imposs user read larg number individu document import explor method user locat inform quickli collect document automat text summar multipl document fulfil inform seek goal provid method user quickli view highlight relev portion document collect work singl document summar subject focu year summar differ singl issu redund passag select critic format summari summar subject area independ natur languag understand statist approach rapid passag select speed maxim margin relev metric provid novelti passag select passag meet criteria relev reduc redund maxim individu passag approach build previou work summar inform document set relationship properti individu document underli framework easi account document genr corpora user linguist properti languag enhanc summar result princip question address summar effect textual content document collect assist user rapidli find desir explor question evalu system domain newswir web time comput scienc technic report thesi jaim carbonel mittal yime yang jan pedersen content introduct evalu domain expect contribut relat work summar singl document preliminari person work gener summari text extract maxim margin relev singl document summar evalu data properti featur result summar requir system design complex scale research plan summar work passag unit choic cluster queri user interfac web page evalu preliminari studi perform search content option research long document evalu summar statist translat retriev addit evalu summar thesi time schedul introduct exponenti growth onlin textual inform world wide web intern document increasingli import provid improv mechan find present textual inform effect convent ir system find rank document base maxim relev user queri system includ relev assess convei inform user techniqu text tile singl document summar system provid autom gener abstract summari summari minim indic inform content document user read effect summari content user search ir summar function challeng summar system greater true ir context situat user issu search instanc retriev system find hundr document document repeat differ part summari individu document similar summar system account summari gener todai time critic summar capabl summar complet document singl document context summar essenti situat thesi focu creat summari serv user inform seek goal summari kei share relev inform document inform uniqu individu document directli relev user queri summar handl type document collect user present collect document access inform landscap user collect document find kei point user piec inform search engin world wide web engin retriev thousand relev user summar extract kei featur inform space thesi focu summar natur languag understand princip question address summar system effect textual content document collect assist user rapidli find desir question examin newswir web time comput scienc technic report remaind section present object expect contribut thesi section discuss previou work summar section present preliminari work summar evalu section describ research plan complet includ evalu time schedul complet section conclud review summar research goal expect contribut field inform retriev thesi examin util summar inform retriev provid overview document collect mean quickli retriev desir portion text document summar address singl document summar singl document consist text document collect concaten techniqu summar redund inform group articl higher redund articl apt describ main point share background method crucial group articl tempor typic stream report unfold event inform overrid earlier tent incomplet account compress ratio size summari respect size document typic smaller collect dozen hundr topic relat document singl document summari evalu test compress summar compress level requir summar significantli difficult compress demand small user vari summari size access context text span retriev origin inform user interfac support function kei compon problem summar present greater challeng summar summari text span document text span summari pronoun indic prior refer leav reader insuffici inform understand text span summar emerg subtop summar columbia approach problem integr machin learn statist techniqu languag gener reformul word summari upenn collabor duke produc summari refer link select piec text approach summar consist main compon statist linguist featur base select relev text span summari base modifi version maxim margin relev metric build previou work summar inform text collect relationship individu document address item list user featur view summari abil add view cluster weight attribut evalu domain domain item previou section newswir domain daili redund due report multipl sourc origin tempor redund due fact event tend occur vari time window background inform repeat abil high compress ratio select multipl articl inher tempor dimens due natur focu singl document summar newswir articl domain internet due natur web page vari amount inform summar engin assist user rapidli locat page section interest report user tend return list search result search follow hyperlink link chose import displai relev inform search user make inform choic expect contribut addit build function complet thesi expect ffl evalu featur singl document summar summari newswir domain ffl integr summar individu cluster document set summar ffl develop user interfac retriev desir inform document cluster mention ffl qualit quantit evalu mention user interfac term speed retriev desir inform ffl evalu qualiti summari base abil cover kei point document set minim redund newswir domain ffl model text summar web vari amount textual inform ffl demonstr multilingu featur summar creat summari languag ffl examin summar input output paramet scienc technic compar newswir articl relat work summar summar young field section present current approach singl document summar summar singl document autom document summar date back luhn work ibm fifti research continu investig approach problem seventi eighti resourc devot address problem grew order magnitud advent web larg scale search engin innov approach began linguist approach statist approach combin tipster phase iii inform retriev initi depart fund project summar difficult achiev natur languag understand variat write document lexic syntact build summar work case gener effect summari requir summar order aggreg item inform relev subject task approxim ir techniqu select passag document previou work summar except attempt method select portion text delet irrelev provid approach summar ideal text summari includ relev inform user exclud extran redund provid background suit user profil coher qualiti difficult achiev natur languag process handl issu exploit regular pattern lexic repetit document structur gener reason summari document genr natur languag understand dimens ffl natur languag gener summari creat semant reflect structur main point extract summari piec origin text ffl gener summari document summari present content close relat search queri user model ffl indic summari user overview content document document inform summari relev inform user extract kei inform inform summari act replac origin text ffl number summar singl document summari overview summari function ffl document length individu document redund present newswir articl intend summari event minimi amount redund scientif articl written present expand point reiter ffl inform document genr provid linguist structur inform summari creation genr includ opinion letter scientif web page speech transcript ffl user user inform search specif impact type summari return research focu summar newswir articl web page possibl scientif comput scienc technic newswir articl web page short comput scienc technic report medium long document medium defin approxim page long indic inform summari extract gener summar continu examin queri relev gener singl document summar newswir domain summari evalu tipster confer perform task indic document relev indic categori document task answer specif question summari evalu extract relev portion text focu research past summar subject great interest due rapid textual made virtual imposs user read individu document research extend aspect singl document approach summar includ compar templat fill extract inform domain specif knowledg sourc gener natur languag summari templat compar extract special list document select relev section find chain document set identifi common section interest build activ network relat lexic item extract text span document set approach differ wai attempt base statist explicitli deal issu reduc modul genr corpora characterist account easili preliminari person work section describ statu summar system singl multipl document gener summari text extract human summar call produc gener summari reflect kei point deem import user interest fact gener motiv summari physician effect elderli femal patient retriev engin produc lengthi report clinic abstract mention inform effect elderli patient summari physician passag differenti effect elderli male buri page clinic assembl summari user inform requir summari document approach text summar gener summari score sentenc respect statist linguist featur singl summar gener centroid queri vector calcul high frequenc document word titl document sentenc score formula order summari rank order set statist featur set linguist featur queri weight featur set weight tune type data set type summari desir user summari attempt answer question linguist featur place boost weight ge featur section tipster formal evalu success linguist featur includ themat phrase document genr assign weight reflect individu linguist method ge fact summari newswir stori includ sentenc articl tabl featur high weight genr statist featur includ standard inform cosin tfidf feedback techniqu local context analysi thesauru method wordnet queri vector user interest method elimin redund maxim margin relev maxim margin relev maxim margin relev passag rank method passag rank list select combin criterion queri relev novelti inform measur dissimilar passag consid select rank list user prefer drill narrow panoram sampl bear relev queri maxim margin relev discuss modern ir search engin produc rank list retriev document order declin relev user queri summar engin base techniqu tend includ passag principl potenti superior criterion approxim measur relev novelti measur relev novelti independ provid linear combin metric linear combin call document high margin relev relev queri articl case gener minim similar select passag idea maxim margin relev summar prior work document retriev method label margin def arg max max sim document collect document queri user rank list passag retriev ir relev threshold retriev passag match number subset passag rn set set unselect document sim similar metric passag retriev relev rank passag sim sim metric comput increment standard list paramet comput maxim rank document intermedi valu interv linear combin criteria optim user sampl inform space set smaller focu multipl potenti overlap reinforc relev set closer summar small newswir work provid relev inform larg order page small overview inform user focu import part reformul queri singl document summar evalu jone gallier defin type summari measur system measur system perform task automat produc summari text extract result reason summari summari fall short optim summari length summari inform user seek extract tipster recent aspect summar evalu evalu consist task determin document relev topic summari indic determin categor gener summari indic establish summari answer set question inform comparison ideal summari summari rate term confid intellig length jing al perform pilot experi examin perform summar system found system achiev perform length found result determin document relev topic tipster summari sanderson found queri relev summari significantli improv accuraci speed user relev judgement static predefin summari titl sentenc retriev relev tipster found differ relev judgment speed summar system recogn relev topic queri creat summari list index tabl label summari inform summari relationship np summari sentenc underli unit summar system evalu stage summari creation coverag relev sentenc system paragraph summari unit paragraph consist sentenc inform suitabl type suitabl construct unit summari due addit context paragraph solv includ addit inform issu summar evalu penal extran inform summari data set section examin perform vari featur summar model summari base person extract sentenc articl provid summari articl regard seri question relev sentenc data base peopl mark relev sentenc articl provid topic evalu baselin measur random sentenc interpol recal curv order account fact compress summari opportun return full set relev normal version recal normal version measur recal number relev sentenc summari number relev sentenc document number relev sentenc summari number sentenc summari standard definit recal defin summari data set comparison relev sentenc data comparison reuter lo angel time doc rel doc doc properti summari summari summari rel rel rel task gener gener relev relev relev human human user user user sourc tipster extract extract studi studi studi document featur number doc avg median max min queri format topic topic topic summari featur doc length incl sentenc avg size median size size tabl data set relev sentenc data summari consist major vote relev sentenc normal version defin type relev sentenc measur standard comparison document set fix document compress summari relev document high proport relev sentenc tend low recal artifact high proport relev sentenc sentenc chosen summari summari perform score high recal reflect high proport relev sentenc capac accur indic summar perform produc relev summari data properti featur ideal text summari relev inform user elimin irrelev redund inform step build summari identifi summar extract piec articl relev user queri methodolog improv summar perform end relev sentenc examin system extract piec relev sentenc consist set document tipster evalu set articl span set topic descript document includ relev document topic articl cover subject elimin result document evalu rank sentenc document relev relev relev treat relev final score sentenc determin major vote sentenc mark relev topic receiv major vote document relev sentenc score method tabl evalu mark document relev relev topic select relev sentenc articl sentenc mark relev relev sentenc data set sentenc set averag sentenc document relev sentenc summari sentenc note relev summari includ sentenc set due fact topic document relev data data collect sentenc select evalu reflect subject matter document data set summari creat train evalu set question answer portion tipster evalu set formal evalu tabl summari consist sentenc directli extract mark section document answer list question topic improv gener summari analysi properti summari articl summari reuter lo angel time analyz tabl summari gener sentenc manual written order analyz properti extract base summari convert extract summari match sentenc summari smallest subset sentenc stori kei concept mention sentenc match process autom defin threshold minimum number concept noun requir match detail inspect set sentenc transform highli document genr newswir articl transform result summari length averag tabl document sentenc includ extran document summari extract length compress compress dataset reuter la time tabl compress ratio summari extract base summari normal recal document begin random sentenc figur queri effect fix summar output sentenc relev sentenc result queri method shown improv perform monolingu inform retriev previou result suggest effect summar rel benefit form queri summar evalu form queri top rank sentenc document feedback document sentenc result document shown figur figur examin output summar fix sentenc relev sentenc data select evalu section figur show summari perform document charact compress nearest major vote relev sentenc data relev relev figur compar effect queri length figur compar short queri full queri medium queri set data includ concept section topic descript full queri medium queri elimin term concept section short queri includ topic header data set prepar research reuter articl cover period lo angel time articl success techniqu depend consist vocabulari usag articl true newswir articl applic techniqu document genr requir knowledg word variant compress reflect averag document compress data tabl interpol averag normal recal document begin random sentenc figur queri effect document relev relev document normal recal document begin random sentenc figur queri effect document rel data set rel doc summari length proport document length rel rel rel rel rel begin document rel random sentenc summari begin document random sentenc figur compress effect queri relev sentenc data summari short queri summari show slight score improv queri techniqu initi retriev sentenc perform due small size queri small queri return rank sentenc ad addit document relat term summari includ addit sentenc irrelev longer effect titl addit effect neglig sentenc document slightli perform case relev sentenc data summar output fix summari initi sentenc higher accuraci short queri summari initi sentenc reflect fact sentenc high probabl relev level compress effect summar qualiti summari qualiti figur vari term compress ratio summar output percentag document figur suggest perform drop document length reflect occur summar select sentenc low compress statist approach ad titl improv result data set long queri significantli baselin perform random select document begin document long queri summari improv raw score short queri import queri format summar result score relev sentenc data highest rank sentenc summari full queri short topic queri ideal score result improv method retriev relev sentenc focu ongo singl document summar improv summar summar result singl document summar extract relev passag document requir summar extend singl document summar due natur multipl articl requir preliminari summar system discuss section requir type situat summar user face collect document assess inform landscap collect extract larger collect result cluster collect larg make cluster categor document sampl summar cluster constitut visual inform featur cluster summari thereof build synthet textual summari main augment background inform elabor focu work report includ necess elimin redund inform content multipl relat document user inform seek goal vari tremend group peopl creat summar articl microsoft trial summari detail present gist dai high level view goal outcom trial ideal summar address level difficult natur languag understand interfac summar system permit user enter background interest profil relev feedback mechan list requir ffl abil cluster similar document passag find relat inform ffl abil find extract main point document ffl abil minim redund passag summari ffl summari abil combin text passag manner reader document text segment highest rank segment highest rank principl present relev inform reader maxim inform content stop read summari group passag topic cluster passag similar criteria present inform cluster centroid passag rank time line text passag order base occurr event time ffl summari gener readabl relev user ffl includ suffici context summari understand reader ffl identif sourc articl error billion report summar recogn report sourc inconsist ffl summari summari account previou summari gener summari system track categor inform outdat inform ffl effect user user easili access sourc passag singl document summari user view relat passag text passag highlight inconsist sourc user select elimin sourc user elimin inform reliabl foreign report sourc user zoom context surround chosen passag user highlight part synthet summari give command system indic part weight heavili part lesser weight summari user vari size summari depend inform desir view present inform bullet separ run text method includ item highlight inconsist report inform system design previou section requir summar system discuss section discuss current implement summar system design produc summari discuss section relev novelti metric minim redund maxim relev extend maxim margin relev metric defin def arg max ij ij ij max sim ij sim ij ij ij ij ij ij sim ij ij cluster ij ij ij ij ij type time max max min cluster ij jc ij vw document jd iw sim similar metric relev rank sim metric document collect passag document collect ij passag document queri user rank list passag document retriev ir relev threshold retriev passag match number subset passag select rn set set unselect passag set passag cluster set document vw subset cluster passag vw subset cluster passag document number passag individu cluster jc vw ij number cluster intersect vw ij weight optim word passag ij type type citi time document max time latest document set min time earliest document set sim sim defin reflect properti discuss section sim term cosin similar metric queri document term comput coverag score passag passag cluster size cluster term reflect inform content passag account statist linguist featur summari queri posit passag document final term tempor sequenc document collect recent inform higher weight sim term cosin similar metric comput similar passag select passag system minim possibl includ passag similar term penal passag part cluster passag chosen increment comput standard list addit score factor paramet comput maxim rank passag document intermedi valu interv linear combin criteria optim order sampl inform space gener vicin queri elimin redund exist document small valu focu potenti overlap reinforc relev set closer differ retriev sentenc found figur summar work ffl segment document index invert indic ir passag paragraph ffl identifi passag relev queri cosin similar threshold passag discard ffl appli metric defin depend desir length select number passag comput passag redund cosin similar defin summar term equat metric passag similar score method cluster passag user select number passag amount compress ffl select passag summari document criteria section result report paper base smart search engin comput cosin similar smart weight queri stopword elimin index data stem turn complex scale complex system sim sim index set complex time vocabulari size number entir collect document build cluster passag cosin similar term equat sim time order term order cluster format restrict factor summari size top relev sentenc return term sim full cluster format time reduc target summari size term order sim term reduc term order complex term time index score constant complex term space restrict number passag cluster case gener queri comput high frequenc kei word document collect passag obtain highli indic content document collect case procedur appli obtain addit passag rerank addit passag potenti score high aspect provid repres predomin inform present data collect number document requir space comput time grow solut situat summari document solut summar store index restrict cluster reduc comput time larg document collect tipster evalu corpu provid set topic cluster summar appli set document press wall street span period addit term factor web page detail analysi time space complex complet thesi result report base smart search engin comput cosin similar smart weight queri stopword elimin index data stem cape south africa presid fw de major pillar drew gener posit black african nation congress leader nelson call intern commun continu econom sanction south africa govern step canadian group issu statement urg govern sever econom link south africa aid african nation group fight govern south africa canadian group issu statement urg govern sever econom link south africa aid african nation group fight govern south africa south africa main black group fight south africa white major militari base govern base close quot statement main region south africa south african attack neighbor creation arm group carri denial polit black major south africa anc main group fight south african govern end system segreg south africa black major vote nation affair south africa main black group fight south africa major militari base base close anc fight south african govern polici nation million black voic nation affair million white control economi domin govern african nation congress main movement fight south africa govern black group fight independ administ south africa secretari state georg meet oliv head african nation voic concern soviet influenc black south african group anc struggl figur sampl summari order tipster provid topic descript queri document averag sentenc total sentenc sentenc summari unit gener summari sentenc long result sentenc compress ratio charact compress approxim order magnitud compress ratio singl document summar result summar turn secretari state georg meet oliv head african nation voic concern soviet influenc black south african group anc struggl relat foe long anc heart nation black south group surviv govern green wsj april south africa main black group fight south africa major militari base base close south africa spoken govern polici million black nation affair end emerg lift group individu condit includ remov south africa black polit prison end polit trial govern commit free polit discuss anc remain vision south anc simpl major rule govern claim lead black domin insist constitut protect includ white south africa african nation congress suspend arm struggl white minor clear start negoti constitut base power share african nation south africa main black liber forg sanction strategi mean pressur govern abandon rule meet south africa african nation major black expect tough line st govern cape south africa presid fw de major pillar drew gener posit black african nation congress leader nelson call intern commun continu econom sanction south africa govern step figur sampl summari order document set set queri set queri relev shown figur summari figur illustr reduc redund maxim inform summari shown figur fact anc fight govern mention time constitut sentenc summari sentenc exact duplic sentenc sentenc ident sentenc summari figur gener set show improv elimin redund fact anc fight govern mention sentenc addit inform summari retain sentenc earlier summari count distinct proposit yield greater inform content summari length document ad set topic yield queri relev summar system produc result figur standard ir techniqu queri extract relev passag longer suffici summar due redund queri captur tempor sequenc data set construct effect featur measur term affect summar qualiti research plan previou section previou result singl document summar section discuss work thesi evalu method summar work thesi research expect fulfil contribut list section section step ffl singl document summar system foundat summar ffl evalu singl document summar test perform techniqu extract relev section document ffl summar system cluster cosin similar time compon score document aspect miss ffl evalu cluster method summar determin sophist cluster method ffl evalu passag unit multipl ffl implement user interfac retriev paramet section ffl extens summar system web page domain ffl comparison input output paramet summar system newswir comput scienc technic report web page ffl perform evalu summar integr summar document cluster demonstr summar multipl item princip foci work passag unit choic sentenc unit suitabl singl document summar demonstr evalu result result tipster evalu clear unit summar incorrect refer quickli mislead reader sentenc pronoun multipl document investig multipl sentenc includ refer type resolut cluster cluster relev subtop document set import determin relev item document set evalu effect cosin similar passag comparison determin cluster cluster methodolog techniqu investig document segment subtop passag method text tile passag cluster cluster longer shorter text segment extract summari subtop passag form displai user interfac queri singl document summar result perform improv regard cover relev segment summar system built examin wai improv queri techniqu linguist indic queri method improv relev result includ local context good result inform retriev summar linguist indic user interfac section requir user interfac discuss includ attribut view sourc relationship similar sourc select elimin context select redirect weight type summari size present style implement user interfac function explor present aspect summar interfac form basi evalu section web page web page addit featur metadata link investig featur format summari actual text summari easili passag page incom hypertext link higher weight passag page user predominantli access data receiv higher weight web search engin googl rank web summari hypertext link relev document time investig group present result summar possibl custom search folder search engin northern light evalu section discuss method evalu summar preliminari studi outstand item determin summar passag unit paragraph order address perform user creat summari short document size set articl relev section text extract procedur human gener gener summari text extract determin type text document time score function summar examin item chosen summari document set perform data evalu set score summar similar relev sentenc data set discuss section creat perform iter user studi evalu mark set short newswir document topic set document type includ document singl event document event span period document gener topic task evalu select sentenc summari task form group fix number put sentenc document cluster provid label pick sentenc reflect group merg except sourc select redirect option featur implement depend time natur data set cluster cluster cluster chang sentenc summari titl document sentenc chang sentenc summari task select cluster evalu select perform task task cluster portion standard cluster user varianc evalu placement sentenc cluster task evalu creat sentenc summari short document rank sentenc order relev titl document task chang sentenc summari data perform summar term cluster find good summari sentenc evalu overlap sentenc singl document summari summari determin baselin evalu perform improv summar system summar document concaten treat singl document search evalu system assist user find compar summar system standard search engin web page data set quantit user find desir time user number qualit measur includ user system student reflect grow number content order compar summari manual count uniqu proposit content time autom portion process section option research section describ research perform extens evalu long document evalu newswir articl web page gener short medium document length set medium long evalu redund summar qualiti set time permit evalu comput scienc technic report includ long approxim evalu manual proposit content summar statist translat retriev berger lafferti approach inform theori map document queri obtain higher perform score inform retriev tfidf modifi approach appli singl document summar compar cosin similar metric addit evalu summar evalu creat synthet set newswir stori reflect time element topic content set ideal summari comparison synthet perform system measur similar manner section evalu method implement analyz content produc summari count noun phrase conjunct verb phrase provid measur inform content summari compar summari noun phrase overlap entiti verb count redund extens comparison text span entiti synonym verb text span onlin thesauru check text span treat similar inform ideal includ subject object noun phrase analysi evalu methodolog examin possibl tradeoff thesi time schedul ffl june ongo singl document summar improv ffl system integr document cluster summar june preliminari studi summari creation pass summar complet decoupl content evalu system pass queri passag select method dec content evalu system pass content evalu pass dec sigir paper summar ffl interfac interfac system interfac improv extens summar web page search evalu ffl extens summar web page ffl demonstr capabl ffl write thesi ffl juli thesi complet util summar assist user find inform standard search provid reason overview content document passag chosen summari result evalu discuss section question present section answer affirm develop summar understand flexibl summari affect inform retriev develop model summar web page show system easili extend languag muse extend state art demonstr flexibl system assist user locat view inform refer workshop intellig scalabl text summar yang topic detect track pilot final report darpa broadcast transcript understand larsen scalabl summar system robust nlp page baldwin morton dynam summar confer empir method natur languag process june goldstein gener extract base summari handwritten summari align text span juli elhadad lexic chain text summar page berger lafferti inform retriev statist translat august kennedi salienc base content text document page bucklei implement smart inform retriev system technic report tr cornel carbonel goldstein rerank reorder document produc summari aug editor electron lexic mit goldstein carbonel rerank document rerank summar twent workshop languag technolog multimedia inform page decemb carbonel summar text sentenc select evalu metric august hand evalu text summar system workshop intellig scalabl text page juli hearst segment text subtop passag comput march hovi lin autom text summar page elhadad summar evalu method experi analysi aaai intellig text summar page mar jone gallier evalu natur languag process analysi review klavan shaw lexic semant summar annual workshop ifip work group nlp apr chen trainabl document summar annual int confer research develop page juli luhn automat creation literatur abstract ibm page mani summar graph search merg page sundheim tipster text summar evalu technic report octob marcu structur text summari page design evalu model summari gener info proc select text span document heurist metric juli bucklei automat text summar paragraph extract workshop intellig scalabl text page juli carbonel select text span document heurist metric juli construct literatur abstract techniqu prospect info proc radev mckeown gener natur languag summari multipl onlin sourc comput septemb salton automat process foreign languag journal american societi inform salton automat text retriev inform comput salton bucklei improv retriev perform relev feedback journal american societi inform salton mcgill introduct modern inform retriev comput scienc seri shaw aggreg text gener associ comput page wise robust practic text summar system aaai intellig text summar page mar automat summar english text phd sentenc extract classif task workshop intellig scalabl text page juli tipster text phase iii workshop va tipster text phase iii md sanderson advantag queri summari inform retriev aug van rijsbergen inform retriev xu croft queri local global document analysi page liu learn approach topic detect track ieee special issu applic intellig inform carbonel studi retrospect event detect ann int acm sigir confer research develop inform retriev page
DB/1154 3 accur estim cost spatial select jeffrei naughton comput scienc depart wisconsin madison west dayton street wi abstract optim queri involv oper spatial data requir estim select cost oper focu estim cost spatial window queri window data object gener polygon cost estim techniqu literatur handl rectangular queri window rectangular data ignor cost exact geometri comparison refin step queri process cost exact geometri comparison depend select filter step averag number vertic candid object identifi step introduc type histogram spatial data captur complex size spatial object locat captur attribut make type histogram accur demonstr investig estim approach sampl yield select estim histogram polygon high cost perform exact geometri comparison sampl object june introduct system fulli support spatial optim queri involv data requir queri optim estim select cost spatial oper focu estim select cost spatial window queri window region call queri window queri retriev object data set overlap region focu paper estim select cost window queri queri window underli data object gener polygon system process window queri spatial oper step filter refin strategi filter step identifi set candid object minimum bound rectangl overlap mbr queri window set candid conserv approxim result filter step index exist refin step test exact geometri candid object identifi filter step determin set object overlap polygon queri window cost model window queri literatur cost model assum queri window data object rectangl estim select cost filter step ignor refin step ignor refin step make cost model inaccur reason estim select filter matter upper bound significantli actual select queri refin step incur cost refin step involv fetch exact geometri candid incur cost involv test candid object determin overlap queri window comput geometri algorithm high cpu cost import properti cost incur refin step depend select number queri window data object shown spatial cpu cost refin step domin queri execut cost cost refin step estim cost window typic applic spatial involv object high complex larg number data set sequoia benchmark repres land state california polygon data set averag vertic issu random window queri data set system queri window random polygon vertic gener rectangl cover space data object section descript polygon refin step queri select time long filter step ignor refin step estim cost mistak accur cost estim base knowledg underli data distribut introduc type histogram polygon data captur properti data distribut requir estim cost filter refin step spatial oper present simpl cost model histogram estim cost window queri queri window data object gener polygon investig sampl estim select cost window queri rest paper organ section present overview relat work complex test log total number vertic polygon test section present cost model window queri section introduc approach build histogram spatial data histogram estim paramet requir cost model section present evalu techniqu section conclud remark relat work techniqu estim select cost oper tradit data type integ string techniqu base histogram approxim data distribut wide current system histogram data literatur approach select estim error bound cost sampl data queri optim time sequenti sampl algorithm upper bound estim error number sampl present tradit histogram point polygon spatial data type polygon extent histogram captur locat data sampl approach tradit data spatial data deal spatial data cost sampl cost model window queri develop independ cost model assum data consist uniformli distribut rectangl estim number disk answer rectangular window queri paper suggest framework studi cost window queri base knowledg queri data distribut author suggest concept data set repres distribut spatial data data set repres fractal dimens paper present model develop base concept estim select window queri point data cost queri fractal dimens departur uniform assumpt typic made previou work cost model window queri cost model base densiti averag number data object point space author densiti repres point space captur data distribut ramaswami studi partit build spatial introduc partit scheme base notion spatial skew work close relat detail comparison section mention work assum queri window rectangl data object point ignor refin step except work present gener solut accur approxim spatial data distribut approach estim select spatial select work assum index spatial attribut entri store number tupl repres select estim tree augment sampl approach ignor refin step requir select make approach main appeal approach work spatial data type paramet descript sourc number page relat catalog number tupl relat averag number entri node height page cost sequenti read calibr page cost random read object cost read polygon vertex cost read polygon cpu cost test rectangl overlap cost coeffici test polygon overlap number vertic queri polygon mbr mbr select estim averag number vertic candid polygon tabl paramet cost model obtain index gener search tree cost model window queri present cost model estim cpu cost filter refin step window queri model assum queri window data object gener polygon cost filter step depend sequenti scan index access cost refin step assum independ access method filter paramet cost model tabl filter sequenti scan input relat access sequenti cost filter cf cf number page page cost sequenti read sequenti mbr tupl relat test determin overlap queri mbr cpu cost number tupl cpu cost test rectangl overlap index estim cost filter step index access assum retriev data object overlap queri window mbr requir minimum number disk rectangl overlap test assum buffer pool manag requir node read disk filter step retriev mbr mbr mbr select defin fraction tupl relat identifi candid filter step fraction tupl relat mbr overlap queri window mbr assumpt impli tupl retriev filter step minimum number leaf node number estim mbr averag number entri node extend estim number node read level leav mbr level mbr reach root node read cost cf cf mbr mbr mbr mbr height level includ root cost page random read assum encount search mean read node account formula notic typic valu number intern node read small filter step test entri node read disk overlap queri window mbr node cpu cost step estim mbr refin refin step retriev exact candid polygon identifi filter step estim cost read polygon compon compon fix cost independ size call compon variabl cost depend number vertic polygon number vertic polygon refer complex estim compon cost vertex cost read polygon averag number vertic candid polygon cost refin cr io estim cr io mbr cpu cost refin step depend algorithm test overlap detect gener polygon overlap log plane sweep total number vertic polygon formula estim cpu cost refin step mbr log number vertic queri constant system algorithm plane sweep test overlap polygon complex overlap test algorithm function number vertic variat formula typic system replac log term formula complex overlap test algorithm note ffl estim cost window queri requir actual select requir select filter mbr select candid polygon identifi filter step test refin final result queri ffl paramet requir cost model obtain sourc system catalog calibr constant provid system implement system develop instal time constant depend specif system environ queri optim time mbr estim section introduc histogram accur estim paramet ffl cost model present estim model queri simplif realiti captur thing system overlap cpu time refin step polygon time fetch variant equat variant accur system kei point remain reason model involv paramet mbr introduc approach build histogram repres distribut polygon data histogram captur inform locat data size complex call histogram structur captur structur data polygon base partit space estim mbr select window mbr averag number vertic candid polygon identifi filter applic requir approxim spatial data distribut partit space possibl overlap rectangular bucket partit base object group similar object bucket object assign histogram bucket store inform number object averag complex data bucket assum uniformli distribut built part updat rebuilt period ensur accuraci presenc updat partit data bucket goal partit data bucket bucket repres set object make assum uniform bucket accur result accur data distribut minim variat bucket common goal histogram techniqu properti data account partit algorithm ffl locat object bucket repres object close space minim bucket similar rule histogram tradit data ffl size object size object bucket determin expect number object bucket overlap queri window larger object overlap queri window accur estim requir averag size object bucket close true size object mean group object wide vari size bucket avoid ffl complex object estim cost refin step requir averag complex candid polygon desir estim accuraci averag number vertic object bucket close approxim true number vertic group object wide vari complex bucket avoid built data structur data structur node repres rectangular region space node repres quadrant region parent node repres partit input space quadrant partit quadrant partit space bucket partit algorithm build start build complet level space paramet histogram construct algorithm level complet repres size partit space partit space resolut properti separ data polygon size locat polygon assign node level polygon assign maximum level furthest width height mbr polygon equal width height node level inform mean polygon node level higher level level node level center polygon mbr polygon assign node figur demonstr assign polygon node figur complet assign polygon complet accur histogram node repres number polygon similar locat size polygon mbr center lie polygon wide vari size assign node level algorithm assign polygon node account complex polygon algorithm assum polygon vicin similar size nw ne se nw ne nw se ne sw sw se figur partit assign polygon node assign similar complex present solut case assumpt hold problem complet built initi phase construct algorithm memori system typic limit amount memori algorithm build histogram fit assign memori constraint translat upper bound number bucket histogram reduc number bucket reduc number level complet limit granular space partit start complet level final histogram fit assign memori satisfi start histogram bucket correspond node complet repeatedli merg bucket sibl node data distribut number bucket drop requir bound method measur variat data distribut histogram bucket sibl node varianc number polygon repres bucket maximum differ number polygon repres bucket measur comput variat data distribut set bucket sibl node set sibl node level consid comput merg histogram bucket sibl node variat data distribut merg replac bucket repres object repres bucket repres region space repres parent node node bucket merg bucket correspond parent node parent node correspond histogram merg correspond bucket import note bucket repres region repres object size assign level object assign combin object level object histogram bucket similar size algorithm build complet height repres data scan data assign polygon node size set histogram bucket correspond node current number bucket requir number bucket merg bucket sibl node minimum variat data end end figur algorithm build merg oper repeat time bring number histogram bucket requir number merg comput variat data distribut bucket correspond sibl node object assign level merg bucket minimum variat merg bucket sibl partit space remain merg procedur repeat time histogram boundari bucket set mbr object repres step requir polygon extend boundari node assign produc histogram bucket repres overlap region space region repres histogram bucket longer correspond region repres node index search bucket overlap queri window build search cost estim time cost estim sequenti search determin bucket overlap queri window figur present outlin algorithm build note algorithm requir scan data handl object vari complex algorithm account complex polygon creat histogram bucket handl data set polygon similar size locat wide vari build build determin minimum maximum number vertic polygon data set requir extra scan data number build paramet algorithm rang vertic data set divid equal number equal requir number repres object number vertic build requir number complet assign data object node complex decid object assign base number vertic object start bucket node repeatedli merg requir number bucket merg bucket sibl repeatedli bucket variat log prioriti queue figur mbr queri object bucket node merg bucket variat data distribut sibl node assum uniform bucket estim paramet requir window queri cost mbr assum uniform distribut histogram bucket figur present mbr queri mbr overlap upper left corner li shade region uniform probabl queri window overlap bx width height formula ignor fact queri window extend bound bucket partli possibl modifi previou formula bx width height rectangular overlap region estim fraction object bucket result filter step window formula width height rectangular overlap region queri window mbr mbr mbr averag width height mbr object repres width height bucket histogram bucket store number object averag width height mbr averag number vertic object bucket store coordin lower left upper corner region space repres estim estim mbr sequenti search histogram bucket identifi bucket overlap mbr queri window estim requir quantiti queri data figur difficulti estim actual select queri polygon overlap data polygon mbr mbr set indic histogram bucket overlap queri window number object bucket averag number vertic object bucket provid estim mbr select window actual select attempt estim actual select window requir inform exact layout vertic queri data polygon estim gener polygon overlap base number vertic demonstr case present figur case queri polygon overlap data polygon polygon case ident queri polygon flip vertic queri polygon overlap data shape number vertic case queri optim mbr select estim upper bound actual select queri estim prove base accur data distribut actual select queri estim sampl comparison partit ramaswami recent partit scheme build histogram spatial data call partit partit base mbr data object partit start build uniform grid cover input space determin number object overlap grid cell grid approxim data partit construct histogram algorithm maintain set bucket histogram set bucket repres space algorithm repeatedli bucket set split bucket number bucket histogram reach requir number bucket split split point chosen give maximum reduct spatial skew spatial skew defin varianc number object grid cell constitut bucket algorithm consid space multipl resolut build grid resolut gener equal number histogram bucket grid reduc comput split base margin frequenc distribut grid cell bucket partit partit space intract larg number possibl deal problem partit space partit restrict binari space partit grid gener set partit partit base margin frequenc distribut measur variat construct measur variat kei advantag variat object size account partit consid number object overlap grid size object assign small larg object level place bucket import issu compar partit inform complex object inform essenti accur cost estim experi section demonstr accur add number vertic inform store bucket evalu present evalu cost estim techniqu polygon window queri real synthet polygon data set studi perform sampl estim mbr bucket partit store averag complex object addit inform requir partit estim gener synthet polygon gener random polygon test queri synthet data set gener start rectangl space polygon gener rectangl specifi size locat polygon number point random insid rectangl point vertic polygon random horizont line cut divid point point lie line point lie point group sort connect sort order creat point leftmost rightmost point chain move vertic lie split line avoid gener polygon chain point connect form polygon rotat polygon random angl avoid gener polygon horizont align algorithm gener monoton polygon gener class polygon figur polygon gener algorithm figur show initi figur synthet gener polygon split chain point figur show final polygon gener connect chain rotat setup data set present result real synthet data set result synthet data set corrobor drawn real data set set polygon repres land state california sequoia benchmark data set consist polygon averag vertic polygon synthet data set present consist polygon gener procedur polygon averag vertic polygon polygon distribut uniformli polygon distribut cluster part space rectangl point polygon gener area area aspect ratio uniformli distribut rang queri workload number vertic polygon queri window randomli chosen rang polygon gener insid rectangl area rang area space workload queri total queri issu workload data center rectangl queri polygon gener random center mbr data object rectangl follow distribut similar data experi workload queri uniformli distribut space type queri select lower uniform workload workload data set experi sequoia data averag select queri size shown figur figur show mbr select select filter actual select select queri filter select defin usual fraction object result queri size mbr select actual select figur queri select data environ experi conduct pentium pro mhz machin mbyte ram run solari disk disk disk softwar system test experi conduct version system server client program run server buffer pool size set mbyte error metric measur estim accuraci averag rel estim error error metric rel error estim defin measur xj measur set averag rel estim error defin queri result size comput error metric remov test queri distribut similar data encount queri result size estim accuraci demonstr accuraci estim mbr compar partit assum uniform compar partit identifi winner techniqu compar assum uniform simplest approach absenc inform data distribut kbyte memori built start complet level accommod vari complex data object histogram built differ number measur variat distribut node detail queri size uniform queri size uniform mbr figur estim error data queri size uniform queri size uniform mbr figur estim error data studi effect paramet histogram partit kbyte memori start partit grid grid progress refin final bucket gener grid figur present error estim mbr sequoia synthet data point figur repres averag rel estim error queri size figur show histogram accur assum gener accur partit figur show accur absolut queri optim irregular figur due small number queri estim error greater queri accuraci window queri cost model tabl show set calibr constant window queri cost model present section set constant cold buffer pool warm buffer pool paramet cold buffer pool warm buffer pool base tabl calibr constant queri size actual time estim time queri size actual time estim time cold buffer pool warm buffer pool figur execut time data constant calibr cost model environ figur show actual execut time workload sequoia synthet data figur show execut time start cold buffer pool queri buffer pool flush buffer pool warm flush index queri optim queri larg area larg expect select figur show estim execut time calibr constant tabl mbr estim built paramet previou section point figur averag execut time queri size figur show variabl execut simplifi assumpt made cost estim error introduc cost model estim execut time window queri accur estim time match actual time good queri optim cost model accur warm buffer pool cold buffer pool warm buffer pool reduc variabl queri execut make cost estim easier cost model accur sequoia data set synthet data set queri sequoia data set longer execut estim accuraci import data set short execut time queri synthet data set make small estim error pronounc queri size actual time estim time queri size actual time estim time cold buffer pool warm buffer pool figur execut time data memori figur effect memori accuraci estim mbr data paramet histogram construct turn attent effect paramet construct algorithm default histogram experi kbyte built start differ number measur variat data distribut vari histogram construct paramet turn show histogram robust variat error shown section averag error queri workload figur show effect amount memori histogram accuraci figur show error estim mbr sequoia data set partit occupi amount memori accur partit rang memori memori result estim accuraci error kbyte slope error point small figur show effect number level initi complet accuraci estim mbr sequoia synthet data set start number level sequoia synthet figur effect number level initi estim mbr level gener histogram space finer granular level separ object size level error creat histogram unnecessarili larg number small bucket import error flat wide rang initi level histogram construct algorithm overli sensit paramet compar construct measur variat data distribut experi measur variat maximum differ number object bucket maximum differ number object bucket rel maximum number object bucket varianc number object bucket bucket merg base total number object bucket merg bucket total number object minimum scheme construct histogram bucket number similar histogram tradit data figur present error estim mbr construct measur variat maximum differ winner tini margin notic histogram robust method interest present result start number object complex number affect histogram effect small sampl sampl select estim figur present accuraci sampl estim mbr select actual select sequoia synthet data set figur present error sampl size sampl inaccur queri low select sampl neg sampl satisfi select figur present averag error queri workload actual select sampl accur estim mbr select kei advantag sampl access test actual data sequoia synthet varianc total number maximum differ rel maximum differ figur effect measur variat estim mbr mbr select actual select sampl sampl mbr select actual select sampl sampl sequoia synthet figur estim sampl accur estim actual select histogram provid summari inform reflect exact layout data estim actual select mbr select estim histogram estim actual select lead larg error disadvantag sampl cost sampl involv cost fetch sampl high cpu cost exact geometri test object sampl found posit sampl polygon sampl polygon overlap queri ms requir index buffer neg sampl detect test mbr queri polygon sampl ms index buffer pool argument sampl made context tradit pronounc context spatial data estim accuraci number sampl reduc error desir number sampl accur estim cost spatial select requir account cpu cost refin step requir estim mbr select queri averag number vertic candid polygon identifi filter step effect estim quantiti provid accur cost estim robust wide rang histogram paramet sampl estim quantiti sampl work select queri sampl offer addit benefit accur estim actual select queri addit mbr select sampl spatial sampl requir polygon overlap test estim cost spatial requir inform complex data object demonstr effect captur properti accur estim cost spatial select refer paul aoki avoid build datablad cost proc int conf scientif statist juli swarup sridhar ramaswami select estim spatial proc acm sigmod int conf manag page june samet cost model queri optim acm workshop advanc geograph inform decemb alberto christo faloutso estim select spatial queri fractal dimens proc int conf larg data page septemb thoma ralf bernhard seeger process spatial join proc acm sigmod int conf manag page de van comput geometri algorithm applic christo faloutso kamel uniform analysi concept fractal dimens proc acm symposium principl system page guttman dynam index structur spatial search proc acm sigmod int conf manag page june joseph jeffrei avi pfeffer gener search tree system proc int conf larg data page septemb kamel christo faloutso pack proc int confer inform knowledg page novemb rj jf da schneider practic select estim adapt sampl proc acm sigmod int conf manag page david dewitt histogram estim select factor queri proc acm sigmod int conf manag page june joseph comput geometri cambridg jack orenstein spatial queri process system proc acm sigmod int conf manag page patel al build scalabl evalu proc acm sigmod int conf manag patel david dewitt partit base join proc acm sigmod int conf manag page june poosala yanni ioannidi select estim attribut independ assumpt proc int conf larg data page august shekita improv histogram select estim rang predic proc acm sigmod int conf manag page peter analysi rang queri perform spatial data structur proc acm symposium principl system page samet relat hierarch data structur acm comput june michael jim jeff sequoia storag benchmark proc acm sigmod int conf manag page yanni theodoridi timo selli model predict perform proc acm symposium principl system page june
IR/1155 5 program demonstr inform agent gabriel marku meyer dfki germani introduct softwar agent intend autonom perform task behalf user agent compet suffici produc desir outcom simpli give leav task altern identifi current problem commun agent expect result carri achiev origin goal ideal candid role support agent user system expect interest obtain cost interven time time consequ ration system troubl paradigm program demonstr feasibl framework kind dialog requir situat user agent individu capabl complement order overcom current object extend agent enabl successfulli deal class problem avoid similar addit train futur concret applic scenario imagin travel agent make dynam inform locat web site order configur trip satisfi user prefer constraint typic inform sourc case includ web site possibl weather server web site tend chang structur agent rest articl refer user femal agent refer male form flexibl deal unexpect situat recogn fact exist problem wouldnt good agent user problem similar situat occur remain section elabor scenario describ agent system intend provid servic round role exchang user system servic provid end agent remain passiv trainer activ particip train dialog guid teacher give lesson solv problem rest paper organ section describ typic applic scenario introduc basic approach underli train dialog briefli describ insight discuss potenti summar result applic scenario illustr kind situat train dialog place collabor natur assum user prepar trip web browser enter relev data citi visit budget leav rest travel agent expect fill miss detail suggest journei satisfi user prefer plan process agent make inform local fetch web plan time exampl includ departur time train flight figur typic applic scenario price hotel room hidden trip plan agent formul inform request answer inform broker queri inform sourc data base figur simplifi outlin framework trainabl inform work answer travel agent question found user present final result browser interest case occur relev piec inform found web site typic reason failur modif site layout structur make inform extract procedur useless store data base site tradit approach deal kind problem drawback ffl user frustrat agent produc desir error messag exist altern site chang recent provid ffl poor gui charg maintain data base inform broker program procedur deal web site kill bird user assum bit system mainten updat agent knowledg base exchang good answer suggest user improv system perform problemat html document hand inform extract trainer current inform request agent question answer expect preprocess remain hidden document open user browser extra frame guid train dialog user initi simpli mark relev portion extract possibl system hint facilit identif piec inform end inform extract procedur insert data base futur order avoid frequent train web queri languag target languag navig web relev document part abstract level document modif affect feasibl procedur train dialog object train dialog gener inform extract procedur wrapper term web queri languag specif design support navig robust identif relev portion document script gener consist number compon option gener ffl select repres document portion ffl select term syntact featur color ffl context repres larger region document ffl optic salient object document document part close semant relationship select serv exact identif target intend make navig html document identif target robust typic exampl context includ tabl identifi syntact region horizont line tag typic landmark graphic object select head describ inform hope navig aid easi identifi document path landmark begin context modifi reason assum close proxim head time inform preserv modif train dialog base paradigm program demonstr user task simpli mark relev document portion possibl give hint syntact properti relev reliabl point context system comput wrapper inform version interfac initi complet left user system make suggest landmark context valid user choic formal studi usabl obviou user repeatedli face similar problem prevent reach close optim result system produc work wrapper long user correctli select intend document robust crucial depend care composit wrapper broadli user miss insight system current state made hard step current version train interfac paul emploi task librari suggest potenti benefici step user consist number action identifi lead gener wrapper deal inform tabl combin syntact landmark user action provid inform learn check wrapper class feasibl type inform user requir order advanc task candid action rank comput highest expect util altern comput system account ffl numer assess curr wrapper gener inform comput explain ffl numer assess wrapper gener success execut action ffl probabl user successfulli carri action ffl penalti annoi user action numer assess intend reflect estim robust wrapper order measur concret system librari templat implement wrapper compon combin instanti section problem discuss detail compon assign number repres level confid robust document modif configur wrapper initi valu combin adequ assess final result exact comput scope basic idea prefer wrapper detail descript target concept fuzzi short access path longer complex search occurr concept prefer search figur part user interfac train dialog expect util action advanc activ task comput curr expect wrapper qualiti justifi user system suggest finish train dialog action present user order reflect respect expect util total free ignor suggest case carri action system simpli acknowledg result figur depict part interfac train dialog upper window action suggest system order reflect respect estim util button make system perform action user control lower window check constitu wrapper defin document hand current situat user check part select wrapper concept identifi subsequ task model serv estim effort complet line action user decid enter subtask case user inform number action arriv result observ suggest user tend lost work mandatori tempor order step carri current version system offer user linear action carri enter subtask execut lesson learnt perform rigor evalu dialog strategi sketch gener lesson deriv prototyp environ version provid rank suggest futur user simpl graphic interfac left user problem observ interact system order make user idea benefit learn agent action user case tutori system intern hidden relat point question user continu train process make provid inform learn agent acquir knowledg task hand gener good solut make user reason potenti impact action qualiti learn result problem difficult applic uniqu reach total freedom user case suffici background knowledg make inform bother user technic train dialog guidanc previou section address problem ffl suggest potenti effect action carri ffl finish train session qualiti level wrapper gener ffl linear mandatori tempor order constitu exist note system suggest safe user feel complet applic scenario peculiar applic scenario exchang role servic provid consum user system made carefulli account user contrast concentr learner state applic involv train session benefit care design trainabl compon fact approach implement system paul naiv user configur inform servic satisfi individu inform applic tradit wright user train system recogn type situat dealt remov factor assess expect util system suggest experi show version user accept paper task model person qualiti measur guid user interact explicit goal state exist framework present adapt applic enabl system design account role user inform test user train mechan provid enabl end user successfulli deal delic problem identifi extract inform inform sourc applic scenario sketch framework instanti number applic instruct inform agent rang intellig notif servic data refer configur person inform servic intern confer intellig user interfac trainabl inform assist cooper problem solv intern confer autonom agent instruct agent web mine intern confer intellig user interfac train agent recogn text intern confer autonom agent learn lesson artifici intellig
Agents/1156 1 electr comput engin carnegi mellon pennsylvania gupta robot institut carnegi mellon pennsylvania abstract spatial layout problem arrang set compon enclosur set object constraint satisfi constraint includ access requir connect cost limit spatial layout problem found primarili domain electr engin mechan engin design integr circuit mechan tradit approach includ genet algorithm simul anneal approach synergist combin approach modular agent base fashion open addit agent modif task requir translat modif agent mix paper describ modular base optim solv spatial layout problem introduct number design manufactur problem requir spatial arrang part subject wide varieti spatial constraint set arbitrarili shape rigid solid arbitrarili shape option goal arrang object insid violat spatial constraint optim object exampl includ design design spatial layout asm design engin technic confer septemb usa institut complex engin system carnegi mellon pennsylvania electr comput engin carnegi mellon pennsylvania pack materi nest rapid prototyp refer problem spatial layout problem spatial layout problem type constraint object function spatial layout problem conflict constraint object function make softwar solv problem difficult develop research spatial layout problem found integr circuit design extens problem dimens consist pack layer object rectangular shape problem materi handl pack pack box shape research oper industri engin electr engin commun pack mechan engin problem hand natur work area due lack comput resourc recent comput power attempt autom optim spatial layout recent develop technolog rapid prototyp creat spatial layout tool copyright asm spatial layout problem solv genet algorithm simul anneal heurist advantag structur problem fast fragil ga sa robust differ problem structur slower method optim respect singl merit express weight sum object user decid rel import object develop approach solv spatial layout problem attempt combin extend strength exist methodolog approach determin good spatial layout physic compon satisfi requir compon separ individu object constraint captur softwar agent interact autonom asynchron manner share memori candid solut agent implement distribut fashion reconfigur instanc captur design requir design weigh constraint optim pareto optim frontier solut comput visual approach core technolog compon addit constraint object function easili agent combin varieti human particip problem solv system base distribut architectur comput power asynchron team organ autonom agent agent entiti input output space maintain control system complet decid work agent collabor modifi result result collect share memori agent consist input schedul determin agent selector solut input oper modifi select solut write result output memori class agent constructor produc solut modifi solut organ agent memori repres direct node repres memori arc repres agent graph call dataflow dataflow destruct agent primari memori secondari memori construct agent figur consist memori construct destruct agent arc lie close loop complet set descript prescript found addit detail theoret work found al power li modular design solut solut relat problem provid hint solut problem store memori heurist oper solut encapsul autonom agent work independ asynchron central control hierarch problem solver agent ad remov affect exist agent team agent independ multipl copi agent run simultan parallel easili scale processor configur chang dynam ad remov agent develop varieti comput includ nonlinear equat solv al travel salesman problem high rise build reconfigur robot design diagnosi fault electr network control electr network job shop schedul steel paper mill schedul train schedul protein fold al constraint satisfact asynchron copyright asm team find good scale solut qualiti speed improv addit agent comput spatial layout problem method primari area research spatial layout problem oper research industri engin problem refer electr engin problem call mechan engin problem relat problem provid survei work research spatial layout problem mechan engin domain prototyp manufactur typic requir pack compon complic subject varieti constraint spatial layout problem focu ee connect cost object freedom size shape object lie neighborhood problem deriv transform circuit consist set modul net connect layout implement silicon make integr circuit step consist partit circuit placement modul fix size overlap surfac repres chip minim wire rout wire modul compact final arrang placement impli locat rectangl fix size placement rectangl vari size main concern fit rectangl minim length measur number wire connect compon good current survei ee problem found problem ee primarili due planar natur integr circuit technolog extens consist stack layer consid set problem object rectangular shape problem simpler object object found assembl focu maxim pack densiti compon mechan assembl pack rigid straint stabil access work problem relat theoret orient knapsack problem work pack rectangl rectangular boundari literatur develop heurist object nonlinear program method due extrem difficulti problem formul disconnect charact feasibl region spatial layout problem exploratori investig method simul anneal tabu search gener survei pack problem describ main type problem consid classifi problem dimens paper describ base method branch rectangl requir comput time small problem literatur pack ignor constraint access separ requir problem involv pack pack box addit pack addit constraint locat center graviti pack low center horizont consid spatial layout method main categori method pack rigid genet simul anneal gradient base optim method nonlinear program method appli layout problem difficulti set requir problem formul wide literatur state approach seri heurist rule deriv common experi suggest method manual method section pack absenc method work circl sphere primarili mathemat recreat literatur point exist heurist design rectangl difficult extend problem heurist locat object time kind layer rule object search space limit place object copyright asm corner align object exampl heurist found genet algorithm principl natur select solut repres binari string popul candid solut maintain member popul rank base merit function optim solut gener combin solut perturb solut call model natur select solut fit chanc select reproduct genet algorithm store solut make encod decod map solut string actual solut pack solut consist locat orient object order object map actual locat combin order orient encod part determin translat genet algorithm approach pack typic partial complet encod pack heurist locat part extend heurist method random pack heurist greatli limit size search space ensur feasibl term overlap ga appli pack optim locat center graviti plane extens hole object thick recent al relat work pipe rout object speed evalu requir ga complex object consid simul anneal method optim base physic process anneal metal sa iter method solut subject random perturb perturb lead merit function valu accept perturb lead valu accept base time depend paramet amount chang merit function perturb accept current solut replac perturb solut proport accept time algorithm evolv continu fashion behav random walk behav hill climb sa extens layout problem integr circuit design led sa pack object demonstr sa work pack cylind show exampl sa pack cylind subject connect cost object latest develop model fast reduc time requir evalu facilit pack object sa atyp approach pack found nonlinear program approach formul problem extrem complic object repres union intersect half object approach competit heurist method approach consid tabu search state work sa empir evid confirm deni claim real world problem larger term complex object consid number complex constraint method tackl heurist method fragil difficult extend number characterist constraint chang method work gener order random method sa ga broadli applic requir restrict applic fairli simpl object problem larg number symmetri spatial layout explor solv complex problem main modular constraint handl flexibl organ custom effect object tessel boundari combin method heurist gradient base algorithm singl solver paper describ modular constraint handl thrust base spatial layout tool design copyright asm solv problem multipl restrict number type constraint easier develop algorithm heurist solv problem fewer partit problem constraint object independ heurist develop improv solut respect constraint object heurist encapsul organ refer agent work small number constraint object special agent expert constraint object ignor abil special agent knowledg constraint solv problem multipl constraint demonstr domain nonlinear program al hope special agent develop custom solver class problem set overlap constraint agent simplifi reconfigur custom solver set special agent assembl repositori agent work parallel network comput coordin assembl team agent rel copi incorpor team work solut simultan pareto frontier work popul solut requir singl merit set solut pareto construct user provid set weight object good solut found function team extend construct displai pareto frontier ad agent agent retriev solut memori plot user determin solut pareto frontier plot shown figur user view rel tradeoff object set solut found solut domin good object set solut solut domin solut lower connect cost lower access penalti figur pareto compar tradeoff object identifi uniqu number plot problem definit select small set constraint order develop demonstr spatial layout tool constraint select repres type constraint found procedur agent constraint method deal method differenti constraint set constraint ci ci cj min wij ci min solid model volum ci solid model compon face compon wij cost connect compon ci minimum requir separ ci distanc solid bodi gener sweep face face infin copyright asm tion volum solid bodi connect object measur total cost establish physic connect compon separ constraint compon electromagnet thermal face compon requir access block instanc batteri compart portabl radio access face defin abil sweep face direct normal swept volum intersect object altern definit access demonstr reconfigur base tool altern problem definit measur access abil sweep requir face distanc face boundari volum measur intersect swept face volum volum object design repres differenti continu object constraint repres discontinu constraint region violat constraint repres procedur defin constraint constraint highli discontinu make difficult solv gradient base method typic assembl design problem instanc class problem task consist pack set compon unit subject set constraint access constraint compon heat sink connect requir compon connect separ constraint compon electromagnet thermal close artifact optic missil seeker shown figur ten compon ccd camera digit signal voltag serial parallel connector amplifi connect requir digit signal camera connector amplifi suitabl camera microprocessor connector access compon block front camera len hole compon cover rang shape size shape object constraint illustr figur object repres cad model aci figur seeker assembl missil optic format aci class librari api manipul process model solut repres vector translat object refer locat world coordin system secondari discret solut repres list grid point centroid locat object aci evalu access requir agent view solut inventor displai render solut solver permut list type ga list identifi order object decod solut consist translat object identifi locat explicitli type memori collect agent develop agent easili assembl resembl dataflow provid figur categor construct agent creator gener solut popul modifi creat solut modifi exist solut evalu evalu solut respect object constraint independ evalu constraint object evalu start work detect copyright asm convert voltag stabil convert serial connector parallel connector unevalu solut memori simultan updat evalu solut work solut independ modifi constraint object constraint difficult agent separ connect attempt violat constraint agent varieti restrict avail good method heurist connect gradient connect cost improv solut modular natur team multipl agent constraint run agent algorithm improv connect work parallel current set creator classifi order object combin decod pack heurist found oper research literatur genet random placement object simul anneal tabu discret grid locat object describ creator secondari assist optim discret grid ignor place access amplifi microprocessor dsp amplifi figur problem optic compon constraint camera access connect separ ject grid boundari separ connect approxim integr manhattan distanc grid goal subsidiari gener good start configur solut domin memori memori full arbitrarili select solut destroi make space creat agent toolkit memori implement activ repositori toolkit agent commun share common commun protocol toolkit implement primarili memori store class data user provid read write method data class user specifi class store memori templat provid heurist encapsul agent ad schedul determin agent work selector determin work case layout schedul amount time iter depend copyright asm figur toolkit user configur execut graphic solut uniform distribut solut equal probabl bia solut fewer creat agent user provid code heurist algorithm encapsul call oper agent user creat schedul selector provid toolkit user input output data schedul selector compil agent templat provid toolkit user regist memori agent configur execut graphic interfac provid toolkit user add memori agent connect graphic data flow interfac user control execut add remov agent dynam execut copyright asm test tool find placement object constraint share singl workstat hour find good layout hour find layout similar qualiti total network workstat figur layout problem definit access solut satisfi constraint shown figur abil custom solver demonstr definit access consid insuffici face connector reachabl access redefin give prefer placement connector heat sink amplifi closer boundari design modular respect separ agent design improv constraint clear distinct assign agent make easi reconfigur team task requir chang shown modifi specif reconfigur replac access relat agent remain agent unchang fact continu work access relat agent reconfigur figur layout problem definit access solut found modifi team shown comparison figur compon move closer solut domin term access final choic left user summari futur work develop base tool spatial layout tool separ agent constraint adapt solut approach specif problem tool reconfigur remov ad agent team demonstr set independ agent work parallel small subset constraint organ solv larger problem develop tool set random pack problem test spatial layout problem repres assembl highli constraint extend test set includ exampl layout compon hood car tool open heurist exact evalu base heurist alongsid approxim base extend set agent includ evalu base heurist copyright asm extend tool object tessel techniqu extrem initi detect faster work integr tool paradigm facilit interact cooper human comput agent solv difficult problem abil spatial layout problem human good identifi distinguish layout number human algorithm numer process extend tool synergist har pattern recognit abil human numer abil comput extens tool includ altern object rotat addit ad simul anneal team acknowledg research fund part darpa contract onr institut complex engin system robot institut carnegi mellon refer local search combinatori john wilei van layout ch box stack model truck transport comput pp introduct sequenc net power system fault ph electr comput engin carnegi mellon team asynchron workshop schedul handbook genet van nostrand de organ algorithm ph dept electr comput carnegi mellon experi simul anneal techniqu pack european journal oper european journal oper comput base heurist pack pool shipment european journal oper pp orsa journal vol summer vol winter constraint satisfact problem vol pp plan shipment low densiti european journal oper pp person rapid prototyp internet confer dec issn genet algorithm pack object intern confer genet michigan state east tune pack rule genet intern workshop intellig robot system iro pp locat compon assembl transact journal mechan decemb pp simul vol number compon base resolut asm design engin technic copyright asm product schedul steel make ibm combinatori algorithm integr circuit john wilei chichest probabilist method assign backbon reson journal cooper design manipul task phd depart electr comput carnegi mellon design architectur ph depart carnegi mellon henri system integr schedul complex manufactur ibm pipe rout genet algorithm tessel asm design engin technic product layout simul phd mechan engin gener optim direct compon advanc design pp simul base approach compon transact journal mechan june pp cyber rule hawaii intern confer system scienc januari procedur parallel ieee tran vol nov de cooper scheme autonom journal fish system control theori power vol institut mathemat parallel global optim algorithm applic power industri comput applic collabor strategi highli special symposium intellig system advanc octob train schedul problem phd electr comput engin optim center graviti locat genet design methodolog sc copyright asm
HCI/1157 4 technic note ubicomp techniqu user easili establish connect smart artefact lar erik holmquist bernt schiel michael beigl gellersen plai research interact eth distribut system eth perceptu comput comput vision lancast depart abstract ubiquit comput vision connect success applic quantiti qualiti connect matter concern qualit relat select connect establish smart user retain control artefact interconnect context proxim select artefact context artefact matchmak suggest empow user simpl effect mean context number artefact prove point implement small devic connect user hold shake introduct drive ubiquit comput rise smart object everydai live augment inform technolog artefact retain origin comput expect provid ad background ad expect interconnect smart artefact advanc wireless network principl enabl interconnect larg number specif relationship establish user retain control inform exchang technic note base artefact relationship describ techniqu user explicitli establish artefact connect work describ conduct earli stage project technolog everydai inspir previou work project project object develop rang devic platform augment interconnect artefact gener integr process commun variat perceptu comput capabl sensor percept techniqu integr facilit autonom awar independ infrastructur wireless commun ad facilit share context artefact earlier work explor applic enabl context acquisit share research focu project collect behaviour collect percept environ area investig correl context artefact foundat collect function correl matchmak enabl artefact discov similar context idea connect establish base context discuss section point context user context proxim exploit explicit interfac section describ prototyp implement friend interfac user establish connect smart artefact simpli hold shake context proxim basi connect artefact tradit approach connect comput entiti network select mean uniqu address mobil comput paradigm emerg support spontan connect comput node requir priori knowledg connect dynam establish base discoveri devic send rang paradigm emerg ubiquit comput support connect temporarili artefact requir proxim defin network instanc basi specif techniqu connect artefact spatial proxim handl connect higher level instanc situat commun spatial locat relai messag spatial proxim gener notion context proxim system serv context space time establish inform flow context proxim paradigm connect artefact interest artefact enabl context awar context gener refer inform system environ obtain sensor context raw sensor gener percept extract inform result abstract term context proxim experi similar situat condit gener wai exploit context proxim connect implicit connect explicit connect implicit connect base context proxim mean artefact automat connect individu context depend suitabl distanc metric artefact devic worn person experi similar context movement establish privat bodi network easili fool provid inform access devic detect context proxim explicit connect user action emploi context user perform gestur kind context explor interfac concept prototyp implement friend commun friend processor core board context recogn applic sensor board processor sensor control gener percept figur devic architectur sensor devic base modular design separ sensor unit core unit main compon data control flow devic illustr figur acquisit data alloc sensor dedic processor sensor control extract gener featur devic commun alloc core unit process comput context abstract sensor data commun interfac support kind network gener assum commun share wireless support addit network implement gatewai devic prototyp implement explor friend concept shown figur board size mount top devic pic board sensor unit equip acceleromet simpl ball integr core board directli connect interrupt core processor enabl devic energi preserv mode movement wake instantli movement core board equip interfac wireless commun commun base detect send rang share broadcast base simpl carrier avoid protocol figur prototyp implement devic valid friend techniqu explicit connect smart artefact connect base devic acceleromet read hard sampl rate interv short durat lower soft sampl rate minim energi consumpt movement data captur interv pass sensor unit core processor data id broadcast share medium listen rang receiv movement data devic compar data recent movement pattern differ threshold accept friend establish dedic connect specif connect connect physic break move send rang close recogn friend connect depend make connect time context wai shake artefact user interfac behaviour built friend user interfac friendship artefact augment user simpli devic connect move instanc hold briefli wave shake movement pattern devic pattern measur time rule unintend connect interfac techniqu easi matter kind movement carri matter simultan devic connect note implement orient devic matter simpl match algorithm requir devic held top devic held reflect movement pattern prototyp explicit disconnect devic applic friend built simpl awar applic friend friend applic notifi user beep notif occur friend temporarili rang disconnect kind awar support similar provid colleagu group awar devic hummingbird consid unit attach augment friend techniqu peopl arriv crowd parti maintain mutual awar briefli put augment awar devic give shake devic notifi user close creat awar similar applic icq similar applic friend child enhanc worn child shake connect establish child parent notif kind applic imagin friend connect person object user connect credit card person item car kei pen smart credit card function friend render card useless lost discuss friend techniqu obviou applic potenti dynam creat logic proxim relat commun channel worri underli protocol method type program smart artefact user interfac perspect program ubiquit comput artefact artefact explicit input output devic import find wai program artefact natur activ friend mechan achiev natur extens concept introduc chang behaviour artefact hold augment object modifi shake behaviour chang modifi modifi slider distanc child wear alarm simpl object start pai attent data audio sensor start listen object turn visual percept child monitor open audio channel parent hear sound child make monitor activ smaller children aural inform import movement point add function access instanc ad button intend make interact simpl intuit act physic icon comput desktop call program make function physic manifest achiev comput interfac give easier access complic function ubiquit comput applic acknowledg project fund part commiss european union swiss feder offic educ scienc inform project refer experi design everydai object comput vol special issu march pp framework creat applic electron publish pp ad smart devic everydai thing ieee workshop mobil comput system applic dec ieee press falk support group collabor person awar devic person vol pp access digit inform intern symposium handheld ubiquit comput pp spatial awar local commun system workshop interact distribut multimedia system octob pp augment situat commun digit physic space ieee intern symposium wearabl comput pp
Agents/1158 1 la ricerca povo itali rapid prototyp environ agent base softwar zini decemb technic report istituto di limit distribut notic report itc copyright accept public issu technic dissemin content view copi tot distribut public limit peer commun materi form author copyright owner dipartimento di informatica scienz dellinformazion rapid prototyp environ softwar zini seri di genova itali degli studi di genova dipartimento di informatica scienz dellinformazion di ricerca informatica phd thesi comput scienc rapid prototyp environ softwar zini di ricerca informatica dipartimento di informatica scienz dellinformazion degli studi di genova univ di genova itali phd thesi comput scienc submit zini degli studi di itali date decemb rapid prototyp environ softwar prof maurizio martelli degli studi di itali ext prof alberto martelli dipartimento di informatica degli studi di itali prof leon sterl depart comput scienc softwar engin australia abstract intellig agent system increasingli recogn innov approach design implement heterogen distribut softwar applic view er power high level conceptu softwar engin exploit improv softwar realiz softwar engin recent interest research area due evid practic develop applic direct import dissert present caselp applic speci cation environ base logic environ base logic program rapid prototyp softwar applic caselp develop prototyp method set tool languag realiz execut prototyp softwar applic societi interact agent prototyp built task knowledg organ interact organ task organ concern speci cation task perform distribut task servic agent provid request accomplish task caselp tool task architectur descript languag adopt describ prototyp term agent provid requir commun link knowledg organ concern descript knowledg agent manipul order behav properli order execut servic ontolog caselp explicitli structur knowledg prototyp applic unambigu describ characterist properti agent languag de ne procedur knowledg reactiv proactiv agent interact organ concern agent interact tool descript caselp de ne sequenc messag exchang provid hierarch relationship sequenc prototyp implement extend languag visual simul tool includ caselp visual trace prototyp execut collect statist dissert investig high level speci cation languag describ sophist agent architectur linear logic languag bdi architectur imper languag speci cation heterogen agent architectur present discuss languag fulli integr caselp repres good candid caselp method speci cation special agent architectur research caselp undertaken main object rst goal show logic program facilit realiz environ develop prototyp goal demonstr environ ectiv rapid prototyp complex softwar applic argu caselp good rst goal sati demonstr applic environ dissert present detail prototyp support system european trac oper manag freight train movement centr yard project inform system italian railwai comput scienc depart itali acknowledg maurizio support guidanc year special mascardi collabor real pleasur fundament realiz thesi delzanno marco contribut part research work privileg work leon sterl invit depart comput scienc softwar engin australia kind stai teach research philip ed subrahmanian interest discuss uenc content thesi student disi contribut research marco de simon extern alberto martelli leon carefulli read thesi gave suggest peopl gave support month conclud work paolo paolo mark fundament improv qualiti express thesi friendli warm work environ fundament peopl disi isa special constant friendship year felt close physic distant tabl content list figur list tabl chapter introduct prototyp combin prototyp innov softwar system logic program goal thesi overview thesi chapter agent base softwar engin de nition agent system applic area agent technolog industri applic commerci applic virtual realiti applic develop agent softwar iter approach speci cation ma speci cation agent agent architectur philosophi motiv tool softwar engin jack method bdi ma ma commonkad chapter environ softwar prototyp caselp architectur agent caselp kind agent agent architectur agent interpret agent servic caselp prototyp tool ontolog kqml tool speci cation execut tool caselp prototyp method step inform descript featur applic step servic analysi step ontolog analysi step prototyp architectur descript step speci cation step initi state program descript step prototyp implement step prototyp test simul applic caselp plan good transport vehicl monitor chapter ontolog caselp ontolog system domain ontolog sport result model domain ontolog ad ontolog caselp ontolog domain independ part ontolog domain depend part exploit ontolog lp agent discuss chapter languag speci cation agent architectur prototyp method linear logic languag hhf speci cation implement bdi engin basic featur languag agent model hierarch structur ma syntax exampl oper semant oo implement speci cation comparison chapter caselp freight train trac manag project background oper scenario tool process train load author prototyp caselp step inform descript featur applic step servic analysi step ontolog analysi step prototyp architectur descript step speci cation step initi state program descript step prototyp implement step prototyp simul discuss result result disi chapter futur develop achiev result futur work bibliographi list figur prototyp bdi architectur open framework nding agenc schema de nition agent templat languag ma architectur descript kqml messag languag agent state program speci cation schema implement speci cation engin agent caselp initi window caselp visual execut caselp trace execut caselp detail event caselp prototyp method abstract hierarchi bdi abstract architectur partial de ned procedur de nition concret architectur bdi de nition concret architectur bdi ma de nition schema bdi abstract architectur java bdi concret architectur java program bdi diagnost robot agent java instanc bdi diagnost robot agent java railwai line connect bern la interact actor nt interact actor la interact actor da servic analysi ontolog analysi ontolog analysi prototyp architectur descript prototyp architectur descript ontolog analysi speci cation program descript agent ithaca program descript agent ter op trace nt process trace la process list tabl place trac oper activ process involv actor chapter introduct adequ technolog realiz increasingli complex softwar applic dramat middl product softwar began transform industri activ cost hardwar year emerg softwar crisi main produc softwar fulli exploit power program satisfi demand poor design hinder mainten softwar softwar engin fashion answer problem earli valid de nition se fritz bauer softwar engin establish sound engin principl order obtain econom softwar reliabl work ecient real machin major point softwar product scalabl handi person easili build shed exploit person skill scale creation oor oc build mean se princip disciplin appli team produc high ectiv softwar sati es user maintain extend time activ includ se process driven method step method perform set enabl softwar engin gather client initi requir transform languag machin execut code method guidelin softwar build tool softwar engin applic automat order produc correctli function valid veri cation fundament softwar engin method valid process check softwar product conform requir veri cation process check output step softwar develop method input veri cation valid softwar gener complex formal approach formal method model behavior comput softwar system mathemat verifi system design implement satisfi system function safeti properti speci veri cation varieti techniqu formal method wide develop softwar dicult requir mathemat background formal approach facilit realiz applic base softwar compon model system legaci compon coexist compon speci ed softwar engin approach permit speci cation partial develop softwar product base exist pro mix choic realiz larg scale softwar product prototyp di erent paradigm focu prototyp softwar prototyp gener simpli ed ecient version end develop test possibl modifi initi requir softwar applic develop figur illustr activ constitut prototyp requir gather stage function function featur softwar product realiz collect basi quick design implement perform prototyp evalu mean test interact nal user custom evalu result end product engin requir ned quick design realiz pattern quick repeat converg product readi engin compar se prototyp main advantag softwar prototyp design quick build refin engin product prototyp start stop evalu prototyp gather requir figur prototyp low iter develop rapid mean earli avail product evalu custom earli detect inaccuraci softwar requir time modi cation cost softwar prototyp gener lower cost end product dramat reduc monei risk develop process prototyp iter process softwar engin exibl requir design choic time avoid prematur critic featur softwar product advantag prototyp ectiv realiz method tool gener realiz softwar prototyp formal feasibl adopt formal techniqu realiz nal version product combin prototyp innov softwar thirti year research experi success softwar system dicult engin correct reliabl true distribut softwar system set entiti cooper coordin order exchang inform distribut system make exist softwar modul integr inform potenti larg number di erent sourc integr di erent kind inform softwar tool urgent necess softwar product address realiz reliabl softwar applic exist softwar data solv complex problem extrem relev fundament success innov se approach brie present paradigm realiz environ develop complex system system intellig agent system repres innov design implement heterogen distribut softwar applic view er power high level conceptu softwar engin exploit improv softwar realiz emerg paradigm permit high level model applic intellig interact entiti system interact share integr coordin order achiev common compet order satisfi person interest agent driven rm belief capabl meet demand complex interact compon applic assum de nition agent reactiv proactiv piec softwar servic commun agent common agent commun languag approach prototyp applic legaci softwar integr distribut system facilit composit approach softwar favour realiz prototyp perform global task aggreg perform individu agent agent facilit access function provid legaci perform coordin activ function provid function extern user behaviour coordin compon depend incom compon intern chang compon goal result interact entiti system enabl easili program behaviour compon logic program logic program declar high level program paradigm blur distinct speci cation code declar languag academ world imper paradigm develop industri softwar motiv reason ecienc advantag lp se lp languag provid high level abstract amen formal reason make detect correct contradictori knowledg easier lp softwar develop easili applic program perform function logic program execut speci cation encourag rapid prototyp declar knowledg modular exibl imper knowledg abstract world natur lp encourag provid support integr di erent kind knowledg give exibl polici drive behaviour applic logic languag natur target languag anim execut speci cation languag side integr heterogen logic program pro address semant integr process method resolv con pool inform de ne oper base oper belong di erent domain lp suitabl candid prototyp innov mix formal suitabl develop valid prototyp complex set intellig distribut entiti cooper coordin exchang integr knowledg fact lp pro model determinist evolut set autonom dynam modifi behaviour agent extern input intern modi cation ration reactiv repres agent goal repres structur agent ontolog goal thesi softwar engin recent interest research area due evid practic develop applic direct import dissert present caselp applic speci cation environ base logic environ base logic program rapid prototyp softwar applic caselp develop prototyp method set tool languag realiz execut prototyp softwar applic societi interact agent basic idea design caselp creat environ accommod speci cation implement languag legaci softwar ma prototyp built rang techniqu integr common framework base logic program research caselp undertaken main object rst goal show logic program facilit realiz environ formal develop prototyp goal demonstr environ ectiv rapid prototyp complex softwar applic caselp suit prototyp applic involv issu todai distribut integr primarili concern organ interact di erent compon make applic relat integr legaci softwar essenti aspect method develop softwar product open respect exist softwar distribut method account compon legaci system nal provid model techniqu tool mean speci cation prototyp level detail veri ned overview thesi dissert structur chapter rst introduc concept agent system review applic area agent technolog successfulli appli chapter present main issu relat softwar develop softwar applic model ma realiz softwar architectur individu intellig agent chapter present gener research framework caselp insert chapter brie present tool method develop agent base softwar chapter present caselp includ set prototyp tool develop method de ned build ma base prototyp chapter conclud present transport applic prototyp caselp chapter ontolog mean run ontolog environ repres knowledg relat speci applic domain chapter present ontolog formal de ne featur caselp agent abil realiz softwar applic incorpor agent heterogen architectur import agent built optim perform task chapter present speci cation languag investig speci cation heterogen agent architectur languag linear logic languag hhf chapter discuss languag integr caselp framework chapter present detail import testb system present chapter concern realiz prototyp support system european trac oper manag freight train movement centr yard project inform system italian railwai comput scienc depart itali chapter conclud dissert summar main research result obtain discuss futur research direct caselp evolv chapter agent base softwar engin agent basic program attack increasingli complex softwar realiz agent enhanc provid level abstract facilit develop softwar applic natur view system realiz agent design implement softwar applic set interact commun achiev common goal compet satisfi person interest agent base view er power repertoir metaphor improv peopl conceptu implement type softwar chapter introduc rst de nition agent system present main applic area agent technolog section issu relat engin agent develop ma singl agent present classi cation agent architectur describ hybrid bdi architectur section present approach aim realiz open framework base logic program rapid prototyp heterogen system approach share intern lp research group includ lp group comput scienc depart genova research caselp intend contribut di approach section present exist tool softwar engin de nition agent system scienti commun accept de de nition agent ma easi give de nition receiv greatest consensu rst ned de nition agent comput situat capabl exibl autonom action order meet design object kei concept de autonomi exibl mean agent receiv input environ oper perform action chang environ exampl environ includ physic simul environ kind input includ percept physic messag recept interact human legaci softwar modul autonomi context simpli mean agent act human control action intern state flexibl articul properti mean agent perceiv environ respond time fashion occur simpli act environ exhibit behaviour initi social interact agent human gener sophist commun languag system simpli de ned societi interact agent agent ma competit system global goal set agent ma possibl perform order achiev global goal typic system perform distribut problem solv distribut problem solver uniqu high level goal nding plan solv parallel activ perform set agent agent fundament perform plan system agent set agent goal case ma infrastructur agent pursu person goal defend interest typic kind ma system electron commerc agent gener repres bui sell good agent pursu goal person goal con ict featur agent ma incomplet inform environ oper limit capabl act environ agent procedur knowledg perform subtask complex agent access data procedur knowledg appli global control agent autonomi gener agent model inform distribut access gener agent system comput commun asynchron agent intern clock execut independ agent agent gener commun asynchron messag pass commun intens applic area agent technolog year agent technolog increasingli appli di erent eld solv problem section brie outlin main area agent technolog appli industri applic industri applic agent technolog rst develop todai industri eld agent technolog activ process control process control basic reactiv autonom system ideal applic eld agent technolog applic agent eld system control distribut electr system monitor fault nuclear power plant control spacecraft system climat control telecommun telecommun system larg distribut network compon monitor manag agent appli eld face problem featur network transmiss servic network manag review eld present air trac control rst eld work applic realiz system call oasi oper sydnei airport australia transport system agent technolog suit develop transport system applic eld geograph function distribut subsystem high autonomi dynam trac manag larg process implement test trac optim assign suppli trac demand econom condit import integr interconnect di erent trac mean infrastructur interest review transport system present chapter dissert present transport applic realiz caselp commerci applic commerci applic agent technolog tend orient mass market industri usag applic encount everydai life main applic eld area present inform manag inform manag basic concern select retriev relev item inform enorm amount inform internet problem inform overload view complementari perspect inform ltere inform gather inform ltere studi wai prevent user present dai amount useless inform develop techniqu select lter retriev item relev user inform gather aim user nding haystack inform internet discuss applic eld present electron commerc agent nding natur applic autom eld control human agent technolog exibl realiz arti cial entiti oper marketplac behalf human make autonom strictli depend current context agent oper gener program priori applic realiz virtual realiti applic realiz virtual environ challeng eld agent technolog agent obviou role plai interact virtual human player interact attitud capabl realist virtual scenario simul relat civil virtual scenario simul emerg earthquak develop agent softwar repres advanc softwar system gener complex distribut agent turn high complex import distinguish develop softwar applic ma develop softwar artifact present featur agent rst goal realiz softwar product applic domain softwar engin aim develop gener realiz applic applic context iter approach softwar engin realiz applic model softwar agent basic view bodi servic agent human mean interact environ iter approach softwar implement nal applic speci cation ma phase concern descript servic agent ma model descript procedur agent suppli servic respond stimuli environ proof speci cation correct speci cation properti formal veri inform test ma behaviour perform mean work prototyp rst phase explicitli account architectur agent pro abstract intern organ structur singl agent speci cation clearer applic develop burden model detail servic agent complex gener involv manag heterogen inform di erent behaviour applic incorpor agent emploi heterogen applic compon optim perform task control system industri machineri implement reactiv planner mainten activ control system implement delib agent agent incorpor applic monitor activ plant provid softwar engin ned librari architectur applic architectur librari speci veri ed test speci cation involv descript intern compon agent interact speci cation ma order applic softwar engin describ section explan reactiv delib agent set function servic agent suppli agent human input event agent messag agent receiv agent human output action agent messag agent send agent interact agent entiti procedur knowledg agent order suppli servic respond stimuli environ prototyp nal applic addit speci cation environ agent live evolut due agent action provid servic agent repres public interfac human agent extern entiti servic agent servic request agent share common intend mean term denot servic agent reactiv provid servic request event initi provid servic entiti decid requir servic descript event agent perceiv depend applic domain agent control industri chemic plant current oper temperatur chemic avoid due excess heat agent lter email human user current state user mailbox rst agent equip sensor enabl acquir inform physic environ agent interact email demon process run user order noti ed messag put mailbox agent physic descript set action perform action depend applic domain case agent control chemic action involv ignit cool devic lter agent action involv delet messag interest user inter agent commun gener messag pass proper descript input output messag agent fundament import agent understand messag order properli provid servic agent send understand agent agent commun languag commun languag gener distinguish perform messag content perform repres type commun act content repres piec inform transmit receiv request act content messag di depend perform messag perform impli receiv truth messag content perform inform impli receiv inform messag true sender di erenti perform content messag impli level descript input output messag rst level concern descript type messag agent send receiv level independ applic domain ma level descript concern content domain depend agent understand messag give mean messag messag content provis servic place mean interact agent human interact rang simpl synchron messag exchang type complex form involv exchang messag softwar engin describ interact relat servic place agent procedur knowledg applic domain servic provid softwar engin de agent proper set rule plan procedur knowledg procedur knowledg includ mechan negoti mechan group agent achiev goal common involv case agent reach agreement price provis servic procedur knowledg describ agent extern behav provid servic intern state agent modi intern action speci cation agent intern architectur agent gener de ned modul act interact possibl complex wai speci cation model intern compon mechan control activ interact architectur compon gener model ma agent di erent intern simpl abstract encompass exist architectur agent repres current imag agent set rule plan repres agent behaviour pattern procedur organ agent intern activ determin actual agent behaviour actual behaviour agent determin action obtain appli agent program agent state mean agent engin extern behaviour agent determin action extern physic action commun action agent intern behaviour agent determin action extern updat action agent intern state state agent data chang execut state typic includ local knowledg base de ne current belief agent environ agent ma program inform chang execut agent agent program term high level rule give oper oper applic domain agent program de ne agent updat belief act environ commun agent human engin control execut agent agent select behaviour pattern current conveni pattern applic engin program belong di erent abstract engin consid program data program oper actual behaviour agent strongli depend engin implement polici chang engin polici mean situat agent adopt di erent behaviour appli di erent rule ect action agent perform agent architectur brie present classi cation main kind agent architectur literatur aim identifi interest class agent classi cation broad famili agent reactiv delib ration hybrid agent reactiv agent behav rule express agent receiv extern input input messag agent signal environ intercept agent sensor reactiv agent symbol belief goal perform reason reactiv agent intern behaviour emerg properti agent exhibit activ behaviour achiev goal di erent reactiv agent action directli driven extern event autonom decid action perform class agent goal remain behaviour agent explicitli repres intern state ration delib agent base symbol world explicit knowledg encompass belief goal behaviour explicitli agent agent exploit di erent plan achiev goal ascrib plan chosen basi current belief goal agent dynam modi ed belief goal chang ration agent consid theorem manipul symbol order prove properti world implement agent theorem prover techniqu develop arti cial realiz expert system agent architectur immedi realiz de ne agent featur includ de nition present section fail combin plan reason research hybrid architectur import build survei agent architectur agent oper wide rang face complex problem fashion gener approach build hybrid agent architectur de ne agent hierarchi interact layer layer manag di erent aspect agent lower layer concern reactiv agent perform quickli respond extern input sophist behaviour program higher agent long term plan rapid reaction environ hybrid architectur agent engin control interact layer implement mechan activ priorit activ gener engin includ exibl account great number situat agent oper engin decid situat layer activ activ layer order agent optim achiev goal adopt hybrid architectur knowledg base agent pro partit realiz di erent kind behaviour di erent agent emploi di erent applic exploit di erent layer concurr work determin actual behaviour agent bdi architectur famou hybrid architectur architectur figur show main compon agent architectur bdi architectur gener abstract present section compon state program agent includ engin organ intern activ bdi agent state bdi agent mental set belief express agent state world oper gener includ agent correspond actual state world belief denot atom logic formula desir set desir goal speci es agent prefer futur world state action goal gener conjunct disjunct achiev test current state belief plan librari bdi engin goal intent action event figur bdi architectur set intent goal agent commit state process program bdi agent set repres procedur knowledg agent plan import implement partial instanti execut plan plan trigger context bodi mainten sequenc success sequenc failur action engin bdi agent execut observ world agent intern updat event queue gener set plan trigger event match event event queue context sati select set match plan push select plan exist intent event select intent topmost plan execut step current step perform post event queue trigger event activ plan event perceiv agent messag receiv correspond updat agent belief correspond execut subgoal plan plan context logic condit sati ed order trigger plan consid execut plan bodi sequenc atom action subgoal atom action action send messag updat agent belief execut subgoal impli gener event post event queue event plan solv subgoal chosen agent procedur knowledg put oper plan mainten condit logic condit remain sati ed plan execut mainten condit plan plan immedi interrupt sequenc success action execut plan successfulli complet sequenc failur action execut plan fail mainten condit execut failur action aim restor state agent plan start case action perform gener dicult undo ect commun act bdi agent reactiv activ event perceiv messag receiv updat occur knowledg base agent ration decid base plan applic current situat polici adopt order guid ration behaviour agent polici adopt event event plan activ event candid intent activ intent execut actual behaviour bdi agent determin reactiv ration trade reactiv ration depend includ time perform engin cycl sophist polici mention base rapid prototyp environ good global inform approach advoc logic program realiz open ma framework support speci rapid prototyp engin heterogen softwar contribut research lp group depart comput scienc lp se group depart comput scienc softwar engin lp group comput scienc depart itali basic idea present posit paper american partner work year mediat approach softwar develop mediat system herm interact maryland platform agent collabor build impact agent built top arbitrari piec de ned program languag whatsoev impact agent applic program interfac set function manipul data structur manag agent question api system consist set procedur enabl extern access util requir detail knowledg system intern data structur implement method impact agent servic descript speci es set servic er agent australian partner develop great anim logic speci order execut test design requir project aim improv outcom requir analysi formal mathemat analyz verifi requir logic program provid basi light weight approach improv speci cation analysi analysi involv explor speci cation includ limit support form theorem prove logic program model approach contrast heavi weight approach gener interact theorem requir develop detail knowledg underli mathemat theori proof strategi light weight approach give level assur autom reason level assur provid adequ signi cantli overhead anim speci cation develop formal speci cation anim highli autom cheap perform anim ectiv detect problem speci cation mean test model properti interact properti anim make suitabl earli softwar develop model incorrect incomplet evolv caselp contribut methodolog aspect model implement prototyp integr di erent languag speci cation implement execut prototyp philosophi illustr philosophi descript open framework consist assum compon depict figur top pictur speci cation suitabl aspect ma prototyp architectur behaviour prototyp develop necessarili speci cation languag respect speci cation languag base speci cation languag base logic set execut speci cation languag ec base linear model high level interact agent global evolut system speci cation languag base algebra suitabl describ static structur execut speci cation languag eb model dynam behaviour singl agent develop speci cation pictur arrow label top layer figur execut speci cation languag ea speci cation languag speci cation execut assum exist automat compil produc execut form speci ed logic program target languag arrow label left pictur repres compil step speci cation describ architectur detail agent petri net easi describ agent tediou describ agent structur tool enrich speci cation default mandatori detail build execut prototyp prototyp ma creat compil compon interfac agent agent legaci legaci modul agent spec spec spec spec spec spec spec spec interfac languag system specif lang lang lang lang lang extern softwar modul specif agent hybrid agent execut specif logic logic logic agent logic agent system specif languag languag ea execut specif specif execut languag sy sy languag modul extern prototyp execut system specif modul extern system specif specif develop access specif compil specif execut prototyp refin extern softwar commun lang ea lang eb exec exec lang exec execut ma prototyp execut specif legaci extern modul figur open framework speci execut prototyp conduct experi detect problem speci cation anim power mean test model interact prove formul model anim obtain similar level con denc correct complet model program anim trade complet speed advantag approach mix posit aspect formal approach satisfact closer real world assum exist interfac agent job integr extern softwar compon agent speci ed high level compil interact interfac provid integr exist softwar compil form high level speci cation mix execut form agent speci ed di erent target languag agent compil detail develop execut agent explicitli speci ed ad compil agent homogen interact execut speci cation languag directli interpret speci cation compil anim direct execut anim provid understand facilit nement speci obtain execut prototyp behav expect figur arrow label repres nement stage speci cation languag analyz speci cation behaviour ne develop execut ma prototyp speci cation languag formal approach verifi properti speci nement formal loop arrow describ nement cycl compil bring closer actual behaviour nal system incorpor legaci compon bottom rightmost part figur repres legaci softwar data integr prototyp legaci data modul extern speci cation speci cation languag de ning describ behaviour extern modul execut speci cation languag develop execut speci cation extern treat piec legaci softwar languag compil process produc animat form speci cation arrow label part execut ma prototyp implement logic program target mercuri sicstu prolog herm type agent accomplish complex task typic ma logic show capabl carri symbol manipul theorem interfac provid interfac extern softwar modul access extern softwar distinguish agent extern modul piec softwar provid function commun insert system agent interfac modul pro industri industri resum industri imag recogn legaci softwar execut ma prototyp multimedia charact resum modul herm figur nding agenc repres line label figur kind hybrid combin skill type agent commun agent occur messag pass agent commun languag channel depict line label figur motiv understand natur role compon figur hypothet scenario applic model involv nding agenc figur cooper industri job candid agenc main compon public relat oc model logic candid process oc model interfac agent pro engag dialog model logic solut parti involv process imag candid exist multimedia exist modul recogn type charact modul index content standard text index techniqu implement full text index system access herm mediat system interfac agent model interfac exist legaci softwar charact recogn request autonom regular time pro interact peopl match requir pro job peopl combin industri request optim number engag interact industri candid adjust plan industri pro emploi reason mechan enabl behav ration task interact extern modul integr provid nal answer pro behaviour task perform complex start describ compon belong execut ma execut prototyp speci cation stage nding agenc stage start choic speci cation continu model interact pro nish anim speci cation analyz behaviour system ne speci cation languag model detail aspect di erent anim ned speci cation lead improv system nement step behaviour implement prototyp match initi requir tool softwar engin section brie review exist approach softwar engin rst present jack toolkit develop system outlin method softwar method realiz system bdi agent ma commonkad method consist sequenc step enabl softwar engin build agent base macro micro level method necessarili support automat softwar tool perform gener high level give guidelin realiz ma applic jack jack intellig agent agent orient softwar agent orient develop environ built top fulli integr java program languag includ compon java develop environ er speci extens implement agent behaviour bdi jack intellig agent autonom softwar compon explicit goal achiev event handl agent set belief world data set event respond set goal desir achiev request extern consequ belief set plan describ handl goal event jack jack agent languag actual program languag describ softwar system jack agent compil jack agent languag sourc le convert pure java java sourc code compil java virtual machin code run target system jack agent kernel runtim engin program set class give jack agent languag program function jack agent languag jack agent languag introduc ve main construct construct agent agent construct de ne behaviour intellig softwar agent includ capabl agent type messag event respond plan achiev goal capabl capabl construct function compon make agent aggreg capabl made capabl serv give agent abil agent made number speci function attribut construct gener relat design speci calli queri logic member logic member normal data follow rule logic program jack de nition relat logic program queri logic program goal event event construct describ occurr agent action plan agent plan analog function instruct agent achiev goal handl design event jack agent languag close relat java extend regular java syntax programm develop compon de ne bdi agent behaviour plan implement java class inherit fundament properti base class extend base class meet speci base class de ned kernel form hold jack program jack agent languag construct includ declar reason method statement declar de ne properti jack agent relationship depend exist jack agent class declar plan agent event plan handl reason statement jack speci statement reason method reason method repres peculiar jack greatli simplifi program agent term bdi attitud step post send messag agent wait condit true express reason method statement method bdi ma georg rao present model techniqu bdi ma extend object orient model method adopt doubl view extern viewpoint system servic inform requir extern interact intern viewpoint element requir bdi architectur goal model extern viewpoint point view extern observ ma agent model describ hierarch relationship di erent abstract concret agent identi es agent instanc exist exist interact model describ agent servic control relationship agent class includ syntax semant exchang messag extern model elabor identifi role applic domain identifi lifetim role elabor agent class hierarchi identifi servic provid ful ll agent class servic level identifi perform requir interact inform content perform intern model agent speci ed paragraph ne agent hierarchi introduc concret agent class introduc agent instanc intern viewpoint agent identi ed agent model bdi architectur bdi agent fulli speci ed event action belief goal plan give rise intent speci cation execut properti architectur left implicit develop intern viewpoint includ speci cation bdi engin model provid captur bdi element agent belief model describ inform environ intern state agent class action agent perform belief agent belief set belief state de ne agent initi mental state goal model describ goal agent adopt event respond goal model consist goal set goal de ne agent initi mental state plan model describ plan agent emploi achiev goal consist plan set describ individu plan elabor intern model start top level correspond servic identi ed elabor extern model intern model de ned plan analyz di erent context goal goal subgoal gener plan achiev repeat step subgoal belief build analyz requir context condit execut analyz input output subgoal plan assur inform belief output prior subgoal plan model techniqu techniqu adopt develop includ extern intern viewpoint base model techniqu object orient system develop agent model belief model method adopt object emploi object class instanc describ di erent kind entiti ma di erent level abstract set class diagram agent model class diagram de ne abstract concret agent class captur inherit aggreg relationship agent class model de abstract concret agent inherit aggreg reserv attribut agent plan agent class set instanc diagram give agent instanc identi es group agent static agent instanti dynam agent possibl instanti develop speci cation plan object orient dynam model plan model consist plan set individu plan speci ed plan diagram main part plan diagram plan type start end intern passiv activ activ node activ iter subgraph transit plan diagram label condit agent belief action ned belief set ma commonkad ma commonkad method softwar develop extend method engin knowledg base object orient protocol engin techniqu give structur knowledg agent enabl speci cation interact messag exchang agent system realiz ma perform build set captur di erent aspect system built agent model model express agent reason servic task model model describ task agent task problem solv method model model describ agent knowledg organ model model describ organ ma introduc coordin model model describ protocol ad requir capabl commun model model detail interact design model model collect previou model consist network design network agent composit decomposit agent includ agent model select architectur platform select develop platform agent architectur develop method develop method base integr approach di erent part system isol construct system method analysi design describ conceptu analysi phase conceptu phase produc preliminari descript oper scenario ma work object orient softwar engin notat messag sequenc chart give set prototyp scenario interact user system interact chart describ high level messag exchang user system analysi phase concern develop system approach rst agent model develop produc initi descript system agent strategi model system term agent case actor delimit extern agent similar actor singl agent syntact analysi problem statement identifi agent subject goal servic verb conceptu distanc organiz identifi agent intern case case develop conceptu case top approach build task model task tree tree repres task decomposit goal ingredi task task short input output task frequenc task requir capabl perform coordin commun model describ interact coordin protocol agent human user system coordin model formal speci es prototyp interact agent system environ develop coordin commun commun channel rst de ned describ prototyp scenario interact agent messag sequenc chart model exchang messag agent interact de ned model interact state transit diagram speci cation descript analyz interact determin asynchron futur interact agent order determin interact requir protocol protocol phase combin fourth model domain infer agent task knowledg domain knowledg consist declar knowledg problem describ concept properti infer knowledg relat infer process solv task gener infer structur adapt order execut singl step infer process relat task task knowledg repres order applic infer structur task execut organ model describ organ ma introduc intern organ ma model show inherit relationship agent graphic notat base object model object model techniqu notat design mental state intern attribut extern sensor ector method build softwar system base kei notion agent notion mental attitud agent idea phase softwar develop unlik cover earli phase requir analysi softwar design deeper understand environ softwar oper target realiz ma autom process carri group human organ support ve phase softwar earli requir phase concern understand problem studi exist organiz set output phase organiz model includ relev actor respect depend actor goal unabl achiev isol late requir system realiz oper relev function qualiti descript model system number actor social depend actor environ architectur design system global architectur de ned term interconnect data control ow subsystem repres data control interconnect correspond actor depend actor capabl agent type special kind speci ed phase nish speci cation agent system detail design agent system de ned term intern extern plan agent commun protocol implement actual implement system carri consist detail design earli requir model requir engin primit concept actor depend earli requir assum involv social depend goal task resourc provid includ actor diagram describ network social depend diagram analyz ful ll goal analysi actor diagram node repres link node actor depend order attain goal link label object depend actor depend actor achiev goal unabl achiev depend actor fail provid object actor ect abil achiev goal earli requir analysi continu extend actor diagram increment ad speci actor depend deriv perform analysi goal diagram analysi speci ed basic obtain explod goal actor diagram idea goal subgoal contribut subgoal goal speci ed late requir oper environ system repres actor number goal depend actor environ depend de ne function function requir goal intern subgoal system decomposit diagram analysi actor repres system ful lling goal architectur design phase consist ning system actor identifi capabl assign agent rst step system actor diagram extend design pattern provid solut heterogen agent commun incorpor nonfunct requir step consist de ning capabl actor order carri goal capabl set belief ful llment actor goal step consist de ning set agent type assign capabl de nition agent uniqu depend design detail design aim detail design phase agent capabl interact capabl speci cation consist model extern intern event trigger plan agent belief agent perform reason step involv subset auml diagram capabl diagram auml activ diagram design model capabl point view speci actor extern event de ne start state capabl diagram activ node model transit model belief model object plan diagram plan node capabl diagram speci ed auml action diagram agent interact diagram auml sequenc diagram asynchron messag exchang agent implement implement perform agent platform bdi architectur natur support mental concept base target platform implement jack section jack system develop sophist construct direct correspond notion introduc detail design auml extens uml chapter environ softwar prototyp caselp applic speci cation environ base logic prototyp environ complex distribut softwar applic model ma caselp develop logic program group comput scienc depart itali basic idea design caselp creat softwar develop framework base logic accommod speci cation implement languag legaci softwar ma prototyp built rang techniqu declar natur logic program languag make suitabl interact develop test agent softwar logic program languag agent ma proper level abstract provid work prototyp formal verifi properti fundament safeti critic applic develop caselp encourag widespread logic attempt bridg gap technolog speci cation tool program languag softwar engin caselp simplifi adopt extend logic program languag suitabl formal veri cation system caselp ongo research project prototyp environ constantli evolv chapter present current statu project caselp iter prototyp method set tool languag support rapid realiz execut prototyp ma prototyp realiz caselp fast minim risk engin end product ful ll user desiderata execut prototyp earli valid requir softwar applic legaci softwar compon order provid user function function er singl state section framework softwar engin provid instrument separ model featur complet ma singl agent current version caselp assum agent standard architectur provid softwar engin environ develop agent softwar realiz ma perform caselp orthogon task organ speci es set task relat servic prototyp perform set agent prototyp describ distribut task servic agent knowledg organ concern knowledg agent manipul order accomplish task knowledg declar procedur declar knowledg concern agent state world oper procedur knowledg concern rule plan agent perform task assign interact organ concern agent interact perceiv act environ chapter illustr featur caselp describ architectur characterist agent adopt build prototyp focu tool caselp engin ma prototyp section describ prototyp method adopt caselp engin prototyp section present applic develop prototyp environ complet applic caselp manag freight train trac present chapter caselp architectur caselp system address aspect develop ma prototyp model philosophi environ softwar engin set languag notat describ ma prototyp level architectur con gurat ma prototyp domain depend procedur knowledg agent properli behav applic environ knowledg caselp face problem knowledg exploit ontolog mean describ prototyp applic domain featur caselp agent commun caselp softwar engin easili describ commun agent set tool high level commun softwar integr caselp softwar engin mechan access extern softwar modul adopt composit approach develop ma prototyp legaci system realiz softwar applic simul caselp prototyp nalli implement prolog version caselp rst adopt target languag implement emb graphic util interact execut trace prototyp adopt sicstu prolog implement languag util execut prototyp start di erent initi con gurat gather simul statist version execut ma perform central realiz prolog prototyp method caselp method fulli integr tool environ face develop aspect state method guid softwar engin develop ma inform descript nal implement caselp tool method detail section agent caselp descript caselp agent concern view agent softwar engin realiz prototyp softwar applic ma caselp agent interpret set servic kind agent kind agent identi es facilit manag interfac agent agent ma prototyp access function provid extern softwar system integr legaci softwar applic data built combin exist softwar modul integr legaci softwar realiz softwar product logic agent high level reason capabl autom activ compon prototyp implement function provid compon softwar engin agent technolog realiz prototyp ecient execut multipl queri user larg amount heterogen data store pool ful ll caselp interfac agent integr exist distribut prototyp caselp logic agent implement sophist cach polici optim global time system caselp interfac agent integr legaci softwar modul perform statist cach order logic agent decid free cach memori facilit agent suppli logic agent agent provid servic agent awar agent prototyp facilit servic manag agent creat delet agent applic servic human modifi structur ma prototyp execut agent architectur architectur refer intern architectur agent architectur speci es data structur form agent intern compon ow control de ne compon activ caselp support standard architectur proactiv agent architectur conform abstract present section caselp agent repres current imag agent set rule plan repres agent behaviour organ agent intern activ determin actual behaviour behaviour agent determin applic agent program agent state mean agent engin architectur caselp standard agent includ compon agent compon agent compon agent state current set agent simpli mailbox incom messag agent interpret extern softwar data written program languag provid heterogen function order integr extern softwar caselp adopt interpret approach softwar integr develop associ interpret interfac agent speci cation interpret depend extern compon integr behaviour interfac agent standard pattern interfac agent receiv messag request servic softwar modul agent interfac special interpret invok order translat messag content proper call modul extern modul return interpret translat result interfac agent return messag request agent servic servic de ne function agent requir accomplish set task servic typic depend domain applic prototyp servic export extern human user servic import ma provid extern softwar modul classi cation agent architectur present section dissert caselp prototyp tool section present tool caselp realiz ma prototyp section caselp prototyp method tool perform di erent step method ontolog ontolog content theori knowledg develop clarifi knowledg structur enhanc knowledg standard ontolog explicit organ knowledg unambigu descript characterist properti agent ontolog caselp express knowledg applic domain ma formal attribut function caselp agent natur model ontolog system base logic program identi es term set constant function predic set predic symbol appli knowledg base kb set de nite horn nalli constraint set constraint kb satisfi assum prototyp suitabl domain applic explicitli de ned agent describ characterist properti caselp chang applic applic reason agent ontolog explicitli prototyp method ontolog caselp present detail chapter dissert simpl architectur descript languag ma adopt caselp task describ prototyp architectur term agent provid requir commun link architectur descript languag introduc distribut softwar engin address engin softwar distribut execut provid tool method achiev goal research argu distribut applic construct con gurat interconnect compon softwar engin provid architectur descript languag express con gurat structur make refer servic er compon refer actual intern implement singl compon architectur descript languag agent templat inform interpret servic agent figur present schema de nition agent templat figur show grammar de ne syntax kind figur schema de nition agent templat describ main construct de ne templat agent ma construct architectur descript gener includ list templat templat de ned interpret extern applic interfac agent set servic provid servic servic agent belong templat provid agent ma requir servic servic agent belong templat request agent ma export servic repres interfac prototyp extern human user import servic repres interfac extern softwar modul integr prototyp de ne agent ma prototyp de ne list instanc agent templat realiz prototyp multipl instanc templat de ned de ne direct link instanc agent link connect servic provid agent servic requir agent commun structur agent set speci cation link type link link connect provid servic requir servic link connect provid servic requir servic kind logic interfac facilit manag architectur reactiv proactiv reactiv proactiv servic export import requir link link servic figur languag ma architectur descript link connect provid servic requir servic export import servic implicitli link extern user modul link de ned ma architectur descript term denot interpret agent templat includ agent formal attribut function caselp agent term denot servic includ set servic belong domain depend ontolog de ned applic kqml caselp agent commun messag pass agent commun languag adopt caselp limit subset kqml kqml agent commun languag commun languag protocol inform exchang independ content syntax domain ontolog joe figur kqml messag conceptu level identi ed kqml messag content layer concern actual content express languag commun layer encod set messag describ commun ident sender uniqu messag identi er messag layer core layer determin kind interact agent kind interact speci ed perform speech messag perform messag primit messag type perform express sender messag expect recipi receiv messag perform submit queri sender messag kind expect receiv formul repli queri syntax kqml messag base balanc parenthesi list rst element list perform element argument perform kqml messag shown figur sender messag agent call answer price ibm recipi messag agent call argument instanti identi receiv repli content messag written languag call ontolog receiv interpret queri identi ed token caselp adopt subset expand caselp agent commun languag restrict kqml adopt limit set kqml perform agent submit queri repli perform agent respond queri receiv perform agent inform agent agent ma domain messag explicit refer ontolog interpret messag content commun layer repli identi er content order agent explicitli manipul languag implement agent base logic syntax messag slightli di erent present messag term perform princip functor token argument content messag prolog term tool speci cation agent servic provid prototyp mean speci provid request servic establish link de ned ma architectur descript speci ed sequenc kqml messag messag speci ed content sender receiv perform includ caselp agent commun typic agent request servic repli reactiv provid request inform agent proactiv servic requir repli messag exchang rst type rst messag request provid repli messag provid request messag exchang type case messag provid request servic case start situat properli captur introduc concept provid notat express possibl start fm messag notat sc mean start messag handl receiv notat mean start messag handl receiv start receiv agent depend intern state model ma includ de nition place provis servic speci cation relationship notat agent program languag de ne initi state agent program program proactiv agent similar logic program languag caselp prototyp implement section add syntact sugar order provid prototyp develop languag program translat prototyp execut grammar de ne syntax present figur agent initi state set atom ground formula initi state express agent initi knowledg applic domain agent program set reactiv proactiv de ne procedur imagin case agent requir servic agent requir accessori servic agent order suppli servic request nil belief program program nil messag msg check condit nil msg perform condit true goal true goal goal goal goal check condit action assert retract figur languag agent state program speci cation knowledg program reactiv agent express mean rule rule messag msg check condit order execut sequenc atom action bodi reactiv rule trigger messag receiv condit sati ed agent state condit conjunct distinct condit rst constraint agent express logic condit set belief agent state satisfi auxiliari made set call auxiliari procedur call auxiliari condit sati ed auxiliari procedur de ned agent prolog procedur state auxiliari condit call invok goal goal atom formula conjunct disjunct atom formula atom action updat agent state send messag agent ma argument action assert state retract state belief ad remov agent state argument action send messag receiv agent proactiv agent behav rule rule form check condit order execut sequenc atom action condit condit sati ed agent state program reactiv agent reactiv rule program agent obtain mix proactiv reactiv rule code de ne program interfac agent rule activ agent access extern softwar agent link interpret rule form messag check send action form auxiliari predic interpret implement real interfac agent extern model interfac map messag content proper call extern collect map back answer agent prototyp speci ed languag tool execut prototyp implement order run simul agent implement initi program engin interfac code de ne agent interpret provid caselp environ initi implement languag version caselp adopt sicstu prolog order independ form typic featur logic program present logic languag implement agent includ prototyp target languag implement ma prototyp extend standard prolog primit safe state updat commun implement engin agent incorpor prototyp direct implement agent develop expert logic program predic agent updat state assert assert fact fact agent state implement safe predic fact remov state retract remov rst fact agent state uni es fact fact predic agent send messag send messag call agent agent receiv predic agent read messag sync block agent messag unifi messag enter receiv msg search agent messag unifi msg input messag msg output uni ed msg output uni es atom messag receiv fetch messag agent messag uni ed list messag implement caselp standard agent due speci cation easili translat form manipul engin outlin speci cation caselp agent implement discuss implement engin agent implement speci cation conform schema present figur state agent speci ed set ground initi state program reactiv condit action reactiv proactiv proactiv auxiliari predic figur schema implement speci cation fact fb repres agent belief straightforward map speci cation agent state atom ground formula form program agent de ned set correspond set reactiv rule messag messag check condit action map schema reactiv messag term denot trigger condit term denot conjunct condit agent state auxiliari nalli action denot sequenc atom action straightforward de ne map proactiv rule reactiv rule check condit action cycl receiv msg output messag select reactiv select proactiv figur engin agent map schema proactiv condit term denot conjunct condit agent state auxiliari action denot sequenc atom action set includ program correspond set auxiliari procedur verifi auxiliari condit mention interfac assum form implement agent interpret engin agent implement shown figur predic cycl de ne simpl engin agent architectur cycl proce messag receiv asynchron red reactiv rule select agent program set action return select proactiv rule set proactiv action return set action chosen execut sophist strategi rule select action choic account complet engin commun protocol implement synchron commun implement variant primit receiv execut tool agent implement piec compil target logic languag sicstu compil produc code readi simul caselp support softwar engin wai run simul rst caselp graphic tool user friendli gui load agent code start follow traceabl event simul run caselp visual version caselp run simul issu command caselp sicstu prolog caselp shell sicstu prolog user featur order test prototyp applic scenario execut prototyp base activ turn agent ma agent execut cycl implement engin behav rule de ned program agent nish execut schedul activ agent caselp schedul control global clock ma execut agent activ simul time time round start process continu number iter reach caselp schedul manag deliveri messag execut agent send schedul put messag order properli receiv messag activ caselp visual caselp visual softwar engin load agent start execut trace event place simul order execut system user initi messag constitut input simul correspond request servic export agent caselp visual window perform illustr figur user set durat simul cycl ma global granular visual simul period stop displai event occur visual visual ma figur caselp initi window event user interest kind event agent state messag messag recept develop code agent automat instrument instrument process probe ad agent order collect store subsequ displai event occur execut ma simul window load agent screen inform state exchang messag displai agent figur present snapshot ma execut execut view detail trace event illustr figur messag exchang state updat shown agent click detail shown figur visual modal provid caselp visual monitor behaviour order check behav correctli caselp shell run simul caselp prototyp develop caselp type command execut simul figur caselp visual execut command compil user translat agent written target logic languag sicstu command load compil agent le system command initi initi input messag agent command global min time set global simul paramet paramet iter repres number iter simul express term unit min time unit paramet le copi exchang messag paramet ag signal messag displai screen simul run command net max figur caselp trace execut user de pair interact failur rate minimum maximum latenc commun channel paramet min latenc max latenc minimum maximum valu delai commun channel express term paramet unit arriv time set caselp delai rang min latenc max latenc time post paramet net paramet de ned pair commun channel assum delai complet reliabl command start simul start execut respect paramet command statist collect statist simul nish statist output le simul number messag receiv interv sum weight total number exchang maximum averag number messag maximum averag weight standard deviat messag weight provid experi inform prove evalu occup commun fundament import applic commun bandwidth limit messag repres measur properti messag weight messag repres bandwidth occupi messag transmit figur caselp detail event caselp prototyp method caselp softwar engin develop method enabl realiz execut prototyp softwar applic societi interact agent caselp develop method base iter nement prototyp time prototyp global behaviour test valid anim interact costum phase fundament valid correct function prototyp outcom test version prototyp realiz possibl ned develop process converg custom desiderata prototyp method includ inform formal phase conjug rigor simplic aim develop agent prototyp method dimens agent develop task knowledg interact organ softwar prototyp realiz caselp develop method repres graphic figur method develop prototyp assum agent ma standard caselp architectur present step method distinguish inform descript prototyp servic analysi final problem ontolog analysi architectur descript specif initi state program descript implement simul figur caselp prototyp method separ phase method adopt caselp step form model phase prototyp step repres implement phase step repres execut phase step inform descript featur applic rst step caselp inform descript prototyp descript task organ knowledg organ function descript prototyp natur languag descript consist high level task prototyp perform task prede ned carri legaci softwar applic includ prototyp task provid ordin function legaci high level reason order perform critic optim descript prototyp base knowledg organ natur languag descript consist inform prototyp manipul order perform function prototyp built legaci softwar descript includ inform manipul note step explicitli introduc agent architectur detail prototyp remain abstract level commit choic implement concentr function inform aspect prototyp step servic analysi step strictli relat task organ task inform identi ed previou step formal set servic servic repres mean task perform task perform access set servic includ set partit subset rst set servic export prototyp extern user set imp servic import prototyp provid extern legaci softwar modul set int servic intern prototyp int set servic agent ma agent ma request step ontolog analysi step strictli relat knowledg organ concern formal de nition inform manipul prototyp inform descript obtain step prototyp develop decid domain ontolog domain ontolog complet independ prototyp case exist domain ontolog current applic ad hoc domain ontolog applic realiz involv set element identi es ontolog ontolog chosen erm relev object applic domain mean set term includ ontolog languag red relev properti object applic domain relationship suitabl mean set predic predic includ ontolog languag kb knowledg base domain ontolog built de ning logic properti relationship term ontolog predic constr constraint knowledg base de ned mean suitabl predic ontolog languag de ning domain step partial de ne domain depend part ontolog agent section structur knowledg agent relat applic domain oper ontolog agent includ predic domain de ne domain level servic term predic domain ad agent domain servic select step step prototyp architectur descript step develop de ne static structur ma model prototyp servic identi ed step guid de nition agent term intern characterist commun channel exist step consist agent templat requir applic agent templat kind architectur determin intern structur function option interpret access legaci softwar attach set servic int provid agent order perform set servic int request agent order perform option set servic export agent extern user prototyp option set servic imp imp import agent softwar modul extern prototyp select set instanc templat set interconnect instanc link appropri request provid servic set link pair form agent instanc servic provid request note denot link servic step speci cation step strictli relat interact organ concern de nition provid servic prototyp assum sequenc messag type intern extern intern occur agent instanc provid request intern servic extern place user agent agent prototyp extern softwar modul intern set link de ned step extern set servic export import agent instanc independ content messag rst decid content messag exchang link set messag content chosen ad term agent ontolog predic domain insert knowledg base agent predic domain ad knowledg base agent express messag content link agent ontolog lled messag content relat actual decid link set messag fm chosen messag perform chosen messag content chosen link agent ontolog sequenc element de ned commun de ned notat present section step initi state program descript step set initi state program agent prototyp initi state agent instanc set fact repres initi knowledg applic domain speci cation agent program base model de ned step conv pair agent messag conv de ne reactiv rule rr ms insert program rule rr ms trigger messag de ne proactiv rule pr ms insert program messag conv de ne reactiv rule rr insert program rule rr trigger messag de ne proactiv rule pr insert program reactiv rule rr agent set state auxiliari set action rule messag trigger csc set condit true includ send rst messag set includ send rst messag set action proactiv rule agent set state auxiliari set action rule set action includ send messag consid de ne rule agent de ne auxiliari predic agent interfac auxiliari predic de ne agent interpret step prototyp implement step de ne execut code agent speci ed previou step interfac extern softwar data de ned term interpret step prototyp test simul step perform caselp visual caselp shell prototyp possibl order valid behaviour client desiderata execut client develop inform event occur check prototyp behav expect desir featur error discov step impli choic made previou step nement applic initi requir applic caselp section outlin prototyp realiz caselp concern di erent applic domain realiz italian compani autom servic complet descript develop prototyp caselp present chapter concern manag freight train trac european railwai line applic realiz italian railwai plan good transport prototyp present model scenario transport good european citi optim scenario requir transport optim term deliveri time receiv request forward distributor present departur inform client deliveri set locat citi manag transport part european territori set heterogen oper track pair citi perform physic transport good behalf distributor caselp context realiz prototyp model concurr submiss request transport servic client prototyp pro monitor messag exchang entiti order gather inform di erent transport possibl reserv resourc perform vehicl monitor prototyp present model applic remot surveil control trac servic area italian applic emploi automat car detect read monitor gate scenario vehicl monitor involv larg number heterogen entiti entiti human insert monitor receiv alarm suspect physic camera commun virtual client applic server remot sensor control imag process plate con gurat distribut protect cabl satellit limit bandwidth due data alloc commun strategi model order optim system physic implement real wan model entiti behavior entir messag exchang system term deadlock absenc perform applic prototyp mean caselp prove ectiv achiev object prototyp improv applic speci properli dimens commun provid formal speci cation implement stage implement complet successfulli vehicl monitor apparatu instal section italian polic organ trac monitor chapter ontolog caselp chapter discuss approach ad explicit ontolog system base logic program approach ontolog content theori knowledg develop clarifi knowledg structur enhanc knowledg standard ontolog explicit organ knowledg unambigu descript characterist properti agent detail explicit ontolog caselp run domain sport result concept competitor includ domain relationship relat concept introduc agent level ontolog formal attribut function caselp includ architectur domain level agent level domain agent level ontolog exploit caselp perform semant check agent architectur check agent behaviour rule agent provid knowledg repositori exploit agent execut ontolog system ontolog content theori relationship speci domain knowledg ontolog part system speci es thing exist true ontolog analysi clari es structur knowledg ontolog relat domain form heart system knowledg domain vocabulari repres knowledg ontolog enabl knowledg captur conceptu structur domain suitabl knowledg languag languag share similar knowledg elimin replic process set agent ontolog descript concept relationship exist agent commun agent roughli ontolog vocabulari talk characterist domain oper ontolog set attribut relationship relat agent domain applic knowledg agent essenc knowledg organ explicit ontolog make organ ma clear ontolog design enabl knowledg share ontolog commit agreement agent vocabulari consist respect theori speci ed ontolog point view singl agent di erent sourc knowledg domain agent comput knowledg agent manipul inform relat applic domain domain knowledg incorpor domain ontolog proper structur domain depend knowledg pro share di erent agent build system oper similar point view point view structur relationship object agent characterist properti agent interact agent knowledg express agent describ featur depend domain system appli agent ontolog realiz ma oper di erent applic domain anticip section debat issu agent commun clear de nition agent system suitabl agent ontolog de nition set gener unambigu featur di erent class agent chapter model knowledg includ domain ontolog applic sport citi itali present agent level ontolog agent de ned caselp domain agent level ontolog join caselp analysi ma architectur descript singl agent behaviour agent exploit domain level ontolog comput knowledg repositori chapter structur section present ontolog de ned domain sport result section introduc ontolog de ned caselp agent section exampl ontolog caselp section brie discuss bene ts drawback work compar approach build ontolog domain ontolog sport result system lot potenti improv interact internet activ intellig agent lab melbourn inform nding agent activ involv appli agent prototyp inform nding task nding sport internet domain sport result interest highlight contrast uniform inform web start point ma prototyp capabl nding sport citi itali search analyz number sport inform inform agent extract sport result web prototyp behav score citi calcul heurist partial score calcul aggreg interact result finder agent collect result relat finder agent receiv partial score aggreg agent calcul nal score citi achiev maximum score return score model domain ontolog relev object applic domain competit citi incorpor domain ontolog de ned natur model ontolog system base logic program identi es term set constant function predic set predic symbol appli knowledg base kb set de nite horn nalli constraint set constraint kb satisfi run ontolog sport term union constant denot competit competit type function symbol sport predic competit competit competit part knowledg base ontolog sport present knowledg base fact sport sport set competit competit type competit class competit type distinguish competit organ seri match pair competitor competit result competitor competit class refer import competit import de import cycl world cup race part section knowledg base competit competit competit competit de competit competit argument predic competit competit argument competit type competit class competit competit competit particip de ne predic particip hold competitor competit seri part knowledg base particip competit predic competitor de ned competit competitor plai competit includ knowledg base ontolog citi ontolog consist citi competitor predic symbol hold term repres citi pair knowledg base citi ontolog express fact ontolog system union sport citi ontolog note particip assum set constraint union constraint belong sport ontolog citi ontolog constraint de ned constraint rst constraint state relationship plai hold competitor hold competitor citi constraint exploit check knowledg base consist ontolog updat ad ontolog caselp ontolog domain independ part state section caselp agent set servic agent level ontolog domain independ knowledg valu attribut de ning interpret depend domain applic prototyp construct depend sole fact agent caselp agent valu kind de ne type agent constrain attribut agent valu attribut assum attribut interpret de ned interfac agent interfac agent necessarili reactiv architectur de ne agent level simpli call agent term express kind agent predic term proper valu agent kind natur choic de ne constant manag predic agent knowledg base ontolog agent fact form agent agent agent agent express agent architectur term reactiv proactiv predic agent part knowledg base agent agent agent term refer standard caselp architectur term ontolog architectur caselp interfac agent interpret access extern legaci modul predic hold term repres interpret addit mention agent set basic servic servic provid implicitli caselp made explicit agent requir agent basic servic creation delet provis inform agent link servic provid agent servic requir search agent servic ontolog agent includ vocabulari identifi basic servic predic agent hold term repres basic servic provid part knowledg base predic agent agent agent agent section servic speci de ned agent servic requir kqml messag exchang pair agent term content kqml messag predic agent de ned agent ontolog predic identifi term messag content associ messag content servic advantag variabl logic program incomplet messag content answer return term express messag content relat servic agent type agent term content kqml messag agent agent bs kind variabl type instanti repli content knowledg base relat agent agent agent give servic messag content servic messag content messag commit manag agent receiv creat agent call characterist delet agent servic servic messag content request receiv facilit instanti variabl repli agent submit request kind agent provid set servic relationship relat servic kind agent ontolog servic state creation agent servic provid manag agent fact servic state servic servic er facilit agent predic architectur de ne relationship di erent kind agent intern architectur make interfac agent sophist architectur task interfac agent translat request agent ma queri submit extern modul link simpl reactiv architectur suit task logic agent built intern architectur task coordin control activ ma complex suitabl architectur chosen similar made facilit manag agent facilit reactiv respond question servic provid thought pure reactiv agent manag simpli react creation request perform initi agent act autonom creat agent intern state plan architectur exibl remark captur ontolog knowledg base fact architectur architectur architectur reactiv architectur architectur architectur architectur architectur reactiv ontolog domain depend part present domain independ part ontolog caselp agent agent level servic agent domain level servic relat applic domain ma de ne domain level servic messag content domain sport constraint ontolog introduc predic domain express term repres servic domain level predic domain servic repres agent level domain agent oper predic domain express term denot domain level messag predic domain associ domain level messag content domain level servic part ontolog knowledg base domain servic sport applic domain domain domain sport domain domain citi servic result provid result finder agent aggreg agent retriev result obtain competitor competit servic posit provid result finder agent aggreg agent retriev posit achiev competitor competit aggreg combin result calcul competitor score competit competitor score turn combin obtain citi score sport citi score sport transfer aggreg agent finder agent servic citi sport score servic citi citi score export finder agent provid inform extern user includ term messag content sport ontolog content messag result servic associ servic express domain domain messag content citi sport score servic associ servic express domain domain citi sport compon ontolog set constraint knowledg base relationship hold agent msg servic captur constraint agent relationship servic hold servic kind constraint servic similar constraint set state properti knowledg base satisfi domain level constraint domain domain domain state relationship domain hold domain messag content domain servic give idea ontolog de ned caselp exploit ontolog lp agent ontolog agent exploit perform semant check architectur descript caselp ma architectur descript agent class section detail caselp ma architectur descript order realiz ma class agent de ned class process deriv theori ad straightforward theori ad clausal architectur descript ma class de form agent agent agent architectur check semant consist theori prove agent kb ad agent kb knowledg base agent ontolog de ne class result finder kind assum de nition pass semant logic agent interpret de ne facilit agent proactiv servic link agent domain depend part ontolog agent check rule de ne program agent reactiv rule de ned agent relat servic provid agent event part rule result finder agent provid servic result messag content messag head rule messag content mention servic ontolog predic de ned domain ontolog exploit agent behaviour condit sati ed order proce comput aggreg agent predic plai particip sport ontolog retriev player sport competit player agent finder predic select player live citi discuss de ned set framework base logic program logic program undoubtedli make suitabl paradigm implement ontolog lp languag natur provid declar organ symbol knowledg lp incorpor infer reason capabl exploit deriv inform base ontolog verifi ontolog constraint sati ed caselp agent implement logic modul ontolog implement logic modul easili includ agent code ontolog caselp prototyp method model knowledg relat prototyp applic domain full integr caselp framework tool implement kind analysi outlin section studi semant check ma architectur descript execut de ned caselp prototyp method check program rule agent perform domain depend part agent ontolog check execut translat speci cation properli exploit agent level ontolog ontolog ect current definit caselp agent de nition extens chang futur includ agent featur ontolog properli updat approach de nition ontolog de nition ontolog agent start point model repres caselp agent de ne ontolog sport speci domain applic start scratch creat organ concept borrow gener ontolog research gener ontolog led sowa ontolog cover potenti gener ontolog applic domain problemat gener ontolog huge tree structur concept identifi suitabl applic oblig includ larg set concept interest agent domain ontolog separ driven necess facilit ontolog manag improv ontolog standard featur captur ontolog agent enhanc caselp agent ontolog agent start point de nition gener ontolog repres organ characterist broader class agent ma domain ontolog separ independ ma knowledg domain ontolog de ned regard manipul caselp enhanc standard agent domain level part agent ontolog includ term manipul domain level predic domain domain msg domain includ agent ontolog chapter languag speci cation agent architectur advoc project section initi idea design caselp creat environ accommod speci cation implement languag legaci ma prototyp built rang techniqu integr common framework base logic program exibl softwar engin suitabl languag model di erent aspect ma improv realiz applic realiz ma develop heterogen agent applic compon individu optim perform task languag easili model heterogen agent architectur gener caselp prototyp develop standard architectur prototyp develop incorpor architectur rst speci veri ed nalli implement chapter investig high level speci cation languag describ sophist agent architectur languag fulli integr caselp repres good candid caselp method speci cation special agent architectur develop method speci cation intern structur function develop ma special agent architectur requir realiz prototyp prototyp method architectur chosen agent templat step caselp method refer standard architectur de ned method speci veri implement agent architectur rst stage hhf intern structur function architectur speci cation de ne intern compon state program agent speci cation de ne architectur engin speci cation architectur formal veri ed valid anim speci cation rst translat hhf hhf logic execut veri cation valid architectur properti veri ed architectur speci cation translat order prototyp linear logic languag hhf linear logic languag hhf agent includ data rule model execut engin speci cation hhf directli interpret speci cation provid understand facilit nement speci cation point behav expect languag hhf properli agent architectur semant point linear logic natur model concurr agent brie present main featur hhf section present architectur speci cation hhf approach translat hhf speci cation logic languag caselp implement prototyp languag hhf execut speci cation languag model concurr resourc sensit base gener logic speci cation languag forum method experi depth caselp translat hhf investig depth section descript hhf logic combin featur logic program extens goal implic quanti notion formula resourc basi linear logic hhf collect atom linear disjunct correspond head goal bodi linear implic kind consum resourc order appli resolut step multiset atom formula state resolut step perform appli instanc program multiset consist atom obtain remov ad result multiset hhf instanti replac uni cation complex search rule logic rule connect occur exhaust appli order proce deriv correspond branch proof tree multiset repres current global describ set trigger point comput hhf applic extend type gm condit solv order trigger compon ad current state form goal simpli reduc condit current state test form goal reduc copi state consum verifi contextu condit quanti cation creat identi er local deriv tree subgoal constant succe context constant simpli remov current goal architectur speci cation hhf test hhf interpret test perform order verifi extent architectur prototyp correspond desir requir lead improv nement made design architectur logic languag hhf speci cation languag advantag evalu goal step step evolut system detail backtrack follow di erent evolut system depend order applic engin rule simul compon execut concurr verifi comput carri comput start con gurat lead nal state satisfi independ order execut architectur compon aim suce run desir comput goal negat desir properti nal check global goal fail hhf framework ma de ned model ma agent heterogen architectur speci cation implement bdi engin hhf architectur speci present speci cation engin bdi architectur speci cation base speci cation bdi architectur approach translat hhf rule code present hhf speci cation bdi architectur explain detail salient aspect bdi architectur hhf plan belief model ground fact form set belief maintain current state goal term form achiev goal commit agent sequenc execut make goal true queri goal impli test agent belief goal true intern repres term updat agent belief extern action send denot gener term plan basic consist sequenc action repres fact form trigger trigger link context condit true start bodi sequenc action mainten condit true plan sequenc action execut plan succe plan librari agent collect fact di erent failur action aim gener rollback safe state case plan failur obtain ort lp set exploit backtrack trigger event trigger event aim activ plan distinguish extern forc agent adopt intern agent add plan exist intent extern trigger link event denot acquisit remov denot acquisit goal intern denot call execut plan event term form trig assum form id und identi er plan instanc event event queue event queue bdi agent extern intern event repres term form event event event link extern trigger insert end event event link intern trigger insert top event top event polici prioriti event gener attempt achiev plan instanc plan instanc repres plan execut plan instanc creat insert intent stack trigger activ context sati plan instanc instanti copi origin inform plan activ suspend di erent share variabl uni cation inherit knowledg origin plan uniqu identi er plan instanc plan instanc form plan intent stack intent stack activ plan set suspend plan intern trigger gener plan instanc push intent stack plan call activ trigger extern trigger produc plan instanc store intent stack intent stack term form int plan instanc intern behaviour bdi agent mean hhf rule list sake explicitli give rule rule simul interact extern world idea start simul agent initi queue event initi intent stack percept rule build event inform produc percept devic environ sensor commun post agent event queue addit rule list program plan librari inform distinguish extern intern trigger form plan trigger plan trigger rule handl creation plan instanc intent type trigger extern trigger intent stack creat plan instanc push process formal int event condit ful lled uni ed fact test contextu condit copi current state sake breviti verifi speci ed identi er plan instanc creat quanti cation note modi cation event queue de ned consum current head creat copi similar formal trigger intern main di erenc intent top plan identi er rst event event consum verifi intent stack rewritten ad instanc plan trigger match trigger topmost event event queue plan execut plan execut event queue agent empti intent stack activ top plan instanc chosen rst action plan instanc execut mainten condit veri develop rule plan extern intern queri goal achiev goal report signi case extern action rule int int call activ agent output ector commun system send messag agent case intern action rule top compon plan assert belief ad event int event int top compon plan retract belief remov form consum plan compon achiev belief agent event int int previou rule current plan suspend event subgoal trigger refer current plan event int int plan compon queri goal belief queri succe rule similar rst achiev rule plan instanc top intent stack plan termin resum plan complet intern execut suspend plan rule captur execut event int int event int event int execut plan instanc pop intent lower plan instanc event int plan event int intent stack remov rule int mention speci cation directli execut logic program languag creat initi set event intent implement bdi architectur ning hhf speci cation concret aim realiz softwar product base establish actual ma prototyp oper concret applic domain present engin bdi architectur deriv directli de ned hhf speci cation engin bdi architectur map hhf speci cation bdi program requir great ort hhf data structur de ned direct map term belief intent event queue store agent plan includ agent program fact note hhf bdi assum gener form gm formula atom order translat guard introduc auxiliari predic de ned retract retract assert assert retract state assert state state updat predic section execut retract retract consum atom formula proof test guard condit current action assert assert add inform state appli transform hhf obtain set set partit group main activ perform bdi agent plan plan execut action execut implement bdi engin de ned predic cycl cycl de ning bdi engin cycl plan plan action sophist strategi execut activ addit inform account activ de ned belong activ plan trigger cs cs plan trigger group present complet code bdi engin give rule handl intern trigger extern action rule handl intern trigger belong de nition plan trigger rule extern plan trigger retract retract sa assert assert plan sa call substitut de nition goal creat identi er execut plan step involv extern action engin rule plan execut retract retract assert assert assert rule execut extern action action execut retract veri cation goal side ect perform send messag note special rule send messag extern action discuss logic base approach bdi agent architectur languag base linear extens classic logic languag prolog execut mechan goal direct base resolut uni cation usual logic program approach speci cation bdi architectur speci cation bdi architectur speci cation languag base set notion state space transform state linear logic natur candid speci cation system involv notion resourc main advantag hhf fact directli execut support speci cation di erent level abstract unlik extens greatli facilit formal speci cation bdi architectur present base tempor logic concurr support speci cation concurr distribut entiti belief plan repres mean formula tempor execut execut algorithm veri cation speci cation direct hhf concurr easili support broadcast simul activ mean featur softwar applic incorpor agent heterogen architectur order agent optim perform task exist speci cation languag agent commit make adopt dicult di erent agent rang reactiv involv exibl cope heterogen agent prove context present system simpl metalanguag intellig agent system di erent heterogen agent architectur cater languag introduc closer widespread exist speci cation implement languag logic languag consid rst step de ning languag make easier anim incorpor tradit speci cation languag caselp integr caselp studi base translat speci cation hhf argu ad enhanc exibl usabl section describ featur present exampl outlin oper delin speci cation map object orient languag java librari java architectur basi implement applic basic featur languag basic featur make suitabl agent architectur speci cation incorpor heterogen agent ma import characterist present agent model agent model support abstract exist architectur facilit develop architectur speci cation model adopt develop agent direct integr speci cation caselp hierarchi abstract level construct ma di erent level abstract support modular exibl system base concept abstract concret agent class agent instanc di erent abstract level design model heterogen agent servic architectur social abil abil agent interact surround environ consist abil perceiv event place environ perform action modifi environ explicit model environ primit agent modifi environ construct model exchang messag agent oper semant oper semant base concept con gurat de ning abstract interpret anim speci cation section expand concept outlin section outlin comput model agent describ hierarchi abstract level describ section demonstr main featur speci cation agent architectur ma made agent section outlin oper semant section discuss map java section compar approach agent model hierarch structur ma agent model assum present section model agent engin chapter bdi architectur run illustr potenti state bdi agent goal intent program bdi agent determin plan typic bdi engin perceiv identifi set plan manag perceiv event current select plan add select plan intent select intent execut instruct select drop success goal section dissert descript bdi agent architectur domain specif depend domain independ specif arch abstract concret concret arch arch agent class agent class instanc agent instanc agent figur abstract hierarchi step architectur agent compon engin oper content agent compon express architectur depend object languag engin interpret commit object languag speci cation languag heterogen ma ensur modular exibl de nition agent architectur provid modular introduc level abstract illustr fig abstract architectur abstract architectur de ne compon architectur basic structur engin provid guidelin realiz present necessarili give implement detail intuit abstract architectur de ne agent data structur engin organ agent intern detail exampl irrelev detail level data structur implement intent select bdi architectur concret architectur abstract architectur give rise concret architectur level data structur architectur compon chosen function agent concret architectur de ned start abstract architectur compon assign chosen languag engin implement agent class concret architectur build agent work di erent applic domain domain depend behaviour pattern ad de ning agent program class level class de ned instanti compon concret program agent agent instanc ma requir instanc agent class work concurr start di erent initi state captur hierarchi de ning agent instanc level start exist architectur compon state initi ma environ intern agent abil perceiv surround environ interact agent system environ model collect fact repres featur physic environ relev applic domain agent perceiv environ modifi interact agent robot perform action turn engin consequ action environ temperatur realist robot consequ directli modifi environ state inform emploi task evalu consequ primit agent updat environ commun agent interact agent mean data structur messag retriev primit commun syntax exampl primit instruct statement primit instruct manag inform architectur deliv receiv perceiv event gener event modifi perform action basic instruct variabl declar assign procedur call determinist choic loop concaten determinist choic concurr execut instruct oper agent intern compon put del stand express mode extract delet element compon mode depend compon type compon assum head tail valu instruct messag exchang block repres sender block recept execut agent program block agent send messag case execut continu messag retriev instruct percept gener event ma environ put remov insert delet event environ reserv execut percept oper perform agent system agent execut action primit ect primit send messag content agent evalu consequ perform environ modi es environ mean put remov primit abstract architectur de nition de ne abstract declar engin procedur engin architectur architectur plan de nition abstract bdi architectur depict figur keyword class mean plan compon instanti de nition agent data repres program agent keyword agent suggest belief goal compon intent compon inform repres agent state engin consist endless loop execut sequenc de ned procedur call global variabl declar includ engin bodi bodi procedur left partial speci ed abstract architectur implement detail de ned procedur complet de ning concret architectur left complet und ned perceiv de ned upgrad intent partial de depict figur bodi upgrad intent rst declar local variabl procedur empti select select put intent de ned abstract architectur level symbol procedur call mean argument pass refer abstract architectur compon class plan agent belief goal intent procedur definit engin procedur engin decl select trigger select true perceiv plan plan upgrad intent exec drop endwhil figur bdi abstract architectur concret architectur de nition de nition concret compon assign global variabl de nition partial speci ed procedur complet illustr di erent implement concret bdi bdi bdi obtain de ned abstract bdi architectur bdi implement bdi concret architectur depict figur concret architectur bdi plan compon type belief compon type goal compon type intent compon type queue extern event event gener environ messag agent system agent implement architectur behav reactiv social send receiv bdi plan belief goal compon intent compon stack perceiv event gener type reason assign bdi compon chosen demonstr languag exibl upgrad intent decl empti select select put intent skip figur partial de ned procedur environ architectur rise strongli reactiv agent abil receiv messag concret perceiv event collect global variabl event type queue bdi event perceiv environ mean procedur global variabl event updat insert perceiv event messag sender receiv parallel percept receiv messag put event queue bdi event place environ perceiv insert event queue de nition agent class instanc concret architectur de ma instanti class agent de ned agent creat concret architectur chosen primit init comp initi architectur compon agent program ma agent ac ac bdi concret ac bdi architectur architectur di erent domain depend plan start simul initi environ env primit init env init eth initi environ set event event event set messag msg individu agent instanc creat primit creat agent time agent instanc ma creat ma instanc ac ac instanc ac agent initi intern state set primit init comp architectur compon plan belief goal intent queue init global var procedur perceiv decl event belief event figur de nition concret architectur bdi oper semant oper semant tree repres transit tupl ma con gurat full account semant found outlin ma con gurat form env agt env eth repres state ma environ state ma repres state agent env agt repres state environ environ env set pair fact string repres relev fact ma environ string repres current observ fact eth set tripl string term sender instanti sender receiv instanti agent string model broadcast commun architectur compon plan belief goal intent stack init global var procedur perceiv decl event figur de nition concret architectur bdi messag deliv receiv recept agent agent state state agent pair env cmp inform architectur compon content execut environ agent engin env function env associ valu variabl local execut environ procedur identi er coher mean assign execut environ imper languag semant ma execut relat ma de ne transit ma con gurat action ect ma relat env agt de ned environ agent con gurat form env agt action directli modifi ma agt de ned agent con gurat set agent ma concept formal due presenc agent execut environ env ma environ env context clari es mean term ma class agent init comp comp elem init env event init eth creat agent init comp comp elem figur ma de nition schema env agt env agt env agt eth env env agt ma eth env agt agt eth env agt ma eth env agt obtain substitut agent execut give overview languag semant describ govern execut agent execut similar includ semant de nition put event remov event relat agt de ned env cmp env cmp eth env cmp agt env cmp eth function return instruct agent execut relat de ned agent con gurat depend agent perform instruct instruct de ne relat basic construct event percept exp env cmp env cmp env env relat exp evalu express current execut environ agent function env return domain function env env obtain env function associ ect percept instruct modifi agent state creat associ variabl argument perceiv perceiv fact messag deliveri exp exp env cmp env cmp eth ect send insert tripl messag recept exp env env eth env appli receiv eld messag agent string ect rec associ content receiv messag variabl argument rec remov read messag receiv eld set messag remov agent system read rule perform block recept di erenc semant block messag recept recept addit rule appli desir messag present case ect rec creat associ variabl argument rec string ect semant block recept und ned messag present forc agent block execut make receiv broadcast messag read messag messag remov recipi read action execut act exp act env cmp env cmp eth env act semant exec instruct send messag action perform achiev modifi oo implement speci cation speci cation languag develop agent implement program languag speci cation term hierarchi abstract make implement object orient languag appeal section present idea speci cation implement java outlin translat speci cation java program repres rst step real implement system guid map agent autonom execut thread execut observ natur lead implement agent concurr execut java thread abstract architectur describ architectur compon possibl provid implement entiti featur natur map abstract class java class made extend thread class method class left concret architectur aim complet inform provid abstract de ning method signatur assign type architectur compon entiti natur map java class extend java abstract architectur agent instanc program state compon lled proper inform entiti implement java object lead implement entiti basic type basic stack tupl assum exist java class implement type class inherit common java superclass call type abstract class bdi extend thread abstract type plan abstract void set plan type abstract type belief abstract void set belief type auxiliari abstract void percept public void plan implement method abstract void plan public void percept plan plan upgrad intent exec figur bdi abstract architectur java abstract architectur abstract architectur haa implement java abstract class java abstract extend class thread architectur compon implicitli declar mean method read write declar abstract procedur left und ned haa implement abstract method engin haa implement overrid method run thread figur sketch map java abstract bdi architectur depict section technic reason delai explicit declar compon implement concret architectur discuss subtl implement detail class extend bdi stack plan set belief set goal queue intent public void percept implement method public stack set set queue implement constructor figur bdi concret architectur java concret architectur concret architectur implement java concret class java concret extend implement haa compon declar explicitli type form support constructor object de ned stage architectur compon creation agent instanc figur de nition concret architectur outlin agent class class direct counterpart java implement java realiz de ning di erent java object program compon di erent class agent instanc belong agent class program compon refer de ned agent class assum build diagnost agent class robot agent class de ne proper plan depict figur simpl plan compon stack diagnost agent class plan diagnost agent stack robot agent class plan robot agent figur program bdi diagnost robot agent java diagnost agent diagnost agent class diagnost agent diagnost agent class robot agent robot agent class figur instanc bdi diagnost robot agent java de ne stage agent instanc agent instanc hai obtain agent class hac lling compon correspond agent state map java agent object program compon share agent instanc class state compon figur instanc diagnost agent instanc robot agent de ned comparison section compar approach heterogen agent architectur hindrik treur de giacomo al compar capabl architectur compli model agent present section term program fisher present speci cation agent concurr speci cation languag base tempor logic architectur model design incorpor design di erent kind perform group behaviour set tempor logic rule futur state agent comput obtain present state exampl present speci cation social behaviour composit primit type behaviour di erent kind layer architectur approach highli suitabl repres agent program tempor logic express repres agent action modular clear express di erent kind agent behaviour approach give explicit state engin agent speci cation agent engin agent state includ abstract agent architectur implicitli maintain interpret concurr execut concurr metatem speci cation interpret oper dimens satisfi futur state agent comput tempor rule agent behaviour implement control strategi organ activ type behaviour hindrik al follow di erent approach focu speci cation agent engin di erent object level languag agent program assum agent comput express program languag base concept goal rule de ne imper meta languag describ engin cycl includ rule goal execut present comparison rule applic goal execut phase argu glass box approach de ning agent engin make intern function engin visibl ma approach develop directli write program control agent intern activ approach hindrik develop agent engin natur limit agent state belief agent program rule agent architectur design term approach gener agent applic desir research composit ma applic handl complex develop method creat system structur desir speci cation base notion composit architectur made compon hierarch relat approach exibl support de nition di erent heterogen architectur architectur compon agent state agent program aim kind compon syntact semant point view ow inform compon speci cation commun link engin govern execut ow compon agent desir framework provid explicit support de ning agent architectur term program successfulli adopt develop librari heterogen architectur rang reactiv proactiv ectiv bdi congolog speci es agent behaviour base action agent execut languag adopt situat languag order repres dynam domain congolog includ facil priorit execut concurr interrupt execut condit deal extern action featur make adopt languag implement reactiv agent ascript mental attitud agent easili achiev adapt world model knowledg situat calculu commun capabl model framework congolog mean describ declar procedur knowledg agent capabl rang reactiv ration level engin program agent architectur architectur design suitabl compon agent program great varieti agent state high exibl architectur primit architectur design build engin argu approach solut softwar develop ma develop main characterist architectur expert burden implement detail architectur control give great deal freedom architectur obtain librari includ architectur data structur control ow ma develop architectur ts librari chapter caselp goal research work demonstr method tool incorpor caselp pro realiz prototyp softwar applic present chapter concern realiz prototyp support system european trac oper manag freight train movement centr yard project collabor inform system italian railwai comput scienc depart itali preliminari result project present base modul european project realiz set demonstr tool provid trac oper function manag schedul train tool decisionmak creation dispatch train left complet human oper emb function tool uniqu system emul ad knowledg realiz system compon process oper scenario oper railwai line bern la line interest identi ed european railwai north south europ chapter structur introduc problem freight train trac manag outlin project section describ oper scenario railwai line heavili ect freight train trac connect centr exchang good prototyp support section present version realiz focu model process section describ detail prototyp caselp nalli section goal achiev project freight train trac manag train trac dramat peopl good travel transport larger larger area true high densiti popul industri commerci centr mobil good peopl face railwai compani order provid travel satisfactori level servic provid railwai compani factor speed safeti comfort exibl good dispatch collect exibl main issu transport system consid case di erent organ truck involv set demand constraint fundament aim make train transport econom advantag parti involv european railwai compani make great ort improv massiv adopt comput technolog year work modern introduc level process relat train circul seat reserv custom support grow adopt technolog enabl process harmon european railwai compani harmon freight transport earlier stage urgent prioriti main issu organ ecient system freight transport system good mean railwai road european nal destin vice technolog obstacl europ demand schedul freight train schedul mean train dispatch demand railwai line schedul train run schedul number train run railwai line avail track line basi long term schedul train trac easier sucient exibl meet custom demand railwai compani competit respect form improv schedul process train order improv servic freight european railwai compani introduc concept de ned european railwai corridor freight train trac optim term speed cost automat support tool provid freight trac order make optim quickli avail kind tool dramat reduc time simplifi inher procedur human trac oper longer burden make full util moment theoret concept automat system support schedul maxim avail track optim trac ow project due complex automat tool organ good distribut base sophist technolog provid wide rang oper solut project contribut appli research system support make eld freight transport aim realiz prototyp support system european trac manag freight train trac activ involv alloc grant author dispatch manag circul train kei factor account make transport danger good manag yard railwai line choic intern oper scenario model prototyp includ process concern transport aim creat instrument integr function provid modul tool support oper order emb function tool uniqu system tool emul knowledg ad system compon process emul function provid call develop modul adopt approach realiz modul exchang inform coordin activ model base ma suit perfectli inher distribut natur applic domain great scalabl exibl realiz prototyp support perform highli dynam high inform incomplet uncertainti adopt ma technolog develop entiti perceiv environ react occur deal incomplet inform agent ma behaviour primarili independ agent modifi agent manag incom messag chang line agent code chang agent behaviour impact descript agent main featur ma provid interfac legaci integr advantag featur exist maintain descript system high realist level abstract background start point fund european commiss programm realiz modul modul capac tool implement procedur alloc railwai infrastructur path railwai compani procedur base eu direct rule transact railwai compani track provid framework algorithm develop algorithm determin schedul con ict respect strict input suppli schedul solut timet schedul con algorithm repres instrument adopt order solv schedul con ict section detail descript support modul environ railwai work di erent negoti valid nation intern organ physic meet modul support activ train schedul train basi tool includ modul train automat inform tool trac oper gather inform statu train case dispatch dynam schedul special delai train schedul tool control centr oper obtain statu inform train present run neighbour railwai network cross border enter centr nation network rail electron uni ed system tool guid schema structur messag exchang trac oper work di erent nation railwai compani dispatch electron set tool extend facil provid teleconferenc interact messag vide share trac oper cooper read possibl modifi train cargo arriv tool infrastructur link oper centr yard trac oc infrastructur facilit request reserv load dispatch con transport ithaca creat direct channel commun custom rail infrastructur manag centr oper basi mine data server tool extend tradit roll stock manag inform system open user friendli interfac tool trac oper inform heterogen set data sourc inform collect store roll stock server machin concern statu track station freight railwai line locat train transport danger good trac oper access roll stock client retriev inform genova la milano bern figur railwai line connect bern la plan control railwai trac oper con gure set alarm monitor optim alloc track freight railwai station oper dispatch schedul tool graphic displai support trac oper transport request delai train verifi alloc free tool oper neighbour countri schedul intern freight train cross nation network border station oper scenario oper scenario oper railwai line bern la line interest identi ed european railwai heavili util trac ow ow origin insid termin oper corridor termin yard la main port movement line con gurat structur line shown figur line run pair citi node swiss section italian section node correspond citi la hexagon squar repres intern end node dark grei node repres italian light grei node repres border station white node repres swiss station bern italian node form la connect xed number termin minor railwai line denot set termin connect node termin belong sk jt freight train insid termin sk enter main line node border freight train switzerland enter italian network scenario train direct la good transport load ship ow trac opposit direct la termin itali illustr support process model basi actual rule govern manag freight trac european corridor moment complianc rule depend sole human trac rule appli train train train schedul static timet creat base constraint pose current request accept variat accept load author italian freight trac regul requir termin obtain preliminari author load direct la base constraint pose foreseen situat yard la request la accept load author procedur requir train dispatch permit care manag destin optim ow termin dispatch author dispatch author grant depend current statu train circul dynam timet statu yard train stop journei da requir train access main railwai line train enter italian railwai network border station dispatch author accept gener made hour departur freight train author immedi run train trac oper oper intern abstract organ nation railwai compani de ne gener role trac oper denot actor involv manag freight train trac role special role termin oper termin oper interact custom collect request transport good termin work collect oper activ creation freight train depart termin train departur request author load good establish departur request author dispatch train transport oper transport oper organ requir personnel ii creat train requir resourc request sati ed trac oper locat termin trac trac oper milan train trac manag italian part line bern la monitor statu train trac line line station oper line station oper work italian node line train trac manag line section activ trac author overrid border station oper border station oper basic ordinari line station oper requir suppli inform run train statu yard switzerland railwai network product product work la decid grant load author avail track presenc danger good node la tabl list role discuss place involv role work place termin oper ij jt nt transport oper ij jt nt trac da line station oper da border station oper da product la tabl place trac oper tool tool group inform sourc tool provid trac oper inform statu train circul yard line trac oper make trac manag base inform inform sourc includ train mida commun facil tool provid trac oper infrastructur gener messag trac oper exchang inform tightli relat train circul commun facil includ vide facil tool speci calli design aid trac oper process load author intern dispatch author provid oper abil automat exchang relev inform facil includ tool design project tool human trac oper activ train plan design tool give human complet make function provid conform expect tool design activ suggest human oper make de slightli modifi function provid tool add capabl order facilit realiz evalu rst prototyp support simul tool algorithm integr real tool simul tool train tool retriev inform timet schedul train includ static timet current statu nation intern includ dynam timet tool inform trac oper action suggest valid human trac oper vide tool activ crucial establish video confer trac oper involv intern dispatch oper reach ithaca modul capabl process make train load author termin oper transport oper support process nt trac product support process la mida tool inform yard line bern la presenc danger good tool capabl dispatch author support line station border station trac make process tool detect solv static dynam con ict schedul train insert timet train dispatch line timet train schedul detect schedul con ict schedul includ arrang train schedul order solv con ict return arrang schedul output process describ process support human trac oper make refer request da process involv set activ perform di erent actor oper turn tabl show activ perform actor involv activ activ process actor train submiss nt request retriev human resourc retriev candid schedul st train modi cation candid schedul retriev timet train schedul con ict solv valid schedul noti cation involv load author submiss la request retriev destin yard statu mida la grant mida valid noti cation involv dispatch author submiss da request retriev line yard statu mida retriev dynam timet train schedul con ict solv valid schedul agreement video confer vide noti cation involv tabl activ process involv actor train figur depict interact actor process relat request train dynam timet roll stock termin oper oper transport traffic oper ithaca vide train mida static timet figur interact actor nt submiss nt request request train submit termin oper ithaca departur departur departur good good weight retriev human resourc ithaca receiv initi gather human engin resourc ithaca issu transport oper good good departur departur trac oper basi weight engin train trac oper check engin personnel train departur date time trac oper answer posit neg resourc retriev candid schedul st train schedul tabl train arriv departur time yard stop journei ithaca receiv posit answer transport activ interact train retriev candid schedul train static timet request ithaca departur departur departur time request train inform static timet program schedul train candid schedul chosen schedul ts submit request close candid schedul train departur departur candid departur schedul train modi cation candid schedul departur time candid schedul correspond request oper time shift candid departur make conform request time candid schedul coher modi ed retriev timet modi ed candid schedul activ order detect solv schedul con ict queri train queri train departur departur modi ed departur time queri process train di erent modi ed departur time hour ahead current time train queri static train queri dynam timet train return partial input modi ed candid schedul detect schedul con ict arrang modi ed candid schedul order elimin con ict schedul return valid schedul return schedul ithaca valid submit order evalu possibl modi ed system return accept noti cation involv schedul activ notifi involv trac oper messag trac oper train departur departur hour maximum estim time train reach la bern departur good good weight load author figur depict interact actor process relat request load author static timet dynam timet roll stock termin oper oper transport traffic oper ithaca vide train mida figur interact actor la submiss la request termin oper submit request load author ithaca request train departur arriv number amount danger good retriev destin yard statu ithaca activ mida retriev inform expect statu destin yard la arriv date roll stock modul roll stock modul occup index destin yard arriv danger good stock index destin yard arriv date occup index measur track destin yard receiv train danger good stock index measur amount danger good destin yard la grant mida maximum occup index destin maximum amount danger good inform receiv roll stock modul mida decid grant load author valid repli request la trac oper ithaca trac oper valid overrid noti cation involv load author activ notifi involv trac oper dispatch author figur depict interact actor process relat request dispatch author submiss da request request dispatch author submit termin oper border station oper request train train reach destin arriv exact time arriv static timet dynam timet roll stock oper transport traffic oper ithaca train mida termin oper border station oper vide figur interact actor da departur schedul amount danger good departur place termin border node schedul run train tabl arriv departur time yard train stop retriev line yard statu request interact mida mida collect roll stock modul inform statu danger good yard train stop mida maximum amount danger good yard yard arriv train maximum amount dispatch author train grant retriev dynam timet receiv posit answer train queri dynam return partial dynam timet base train departur time queri train departur departur date schedul con ict solv pass train schedul partial dynam timet receiv perform schedul con ict valid schedul termin oper border station oper valid schedul agreement video confer vide activ case border station oper valid dispatch schedul case border station insist departur train make agreement trac milan noti cation involv dispatch author activ notifi involv trac oper prototyp caselp section describ prototyp caselp method tool step inform descript featur applic function provid trac oper section support function provid emul modul section repres task perform give task organ prototyp descript railwai line section inform exchang actor process section knowledg organ prototyp export train load author dispatch author train noti cation load author noti cation dispatch author noti cation import imp ly sg human resourc avail train candid schedul retriev timet retriev dynam timet retriev destin yard statu line yard statu intern int cg human resourc avail schedul retriev candid schedul retriev timet retriev schedul con ict solv load author grant dispatch author partial grant dynam timet retriev video confer figur servic analysi step servic analysi base output step servic prototyp formal de ned figur show set servic identi ed prototyp prototyp export human user set servic servic correspond main system support servic dan export trac order notifi system set imp includ servic import provid human user extern softwar modul provid human transport termin oper refer avail resourc train counter train schedul servic import timet retriev candid schedul static dynam timet solv schedul con ict timet static process train dynam timet process dispatch author servic dy ly import roll stock provid inform statu destin yard grant load statu station railwai line grant dispatch intern servic int provid request insid prototyp straightforward process correspond servic activ process tabl step ontolog analysi descript relat knowledg organ step guid de nition domain ontolog problem domain ontolog includ topolog structur line figur show part domain ontolog relat topolog structur railwai line de ning domain step de ne domain depend part ontolog agent section ontolog agent includ predic domain de ne domain level servic term predic domain ad agent domain servic select step knowledg base intern servic servic export import human shown figur step prototyp architectur descript de ne static structur ma realiz prototyp figur show de nition agent templat agent commun structur de ned link servic natur choic de ne agent tool templat reactiv interfac agent templat access extern interpret provid templat requir subset servic de order properli perform task make process ma realiz instanc templat order execut prototyp de ne agent ontolog initi end border italian link knowledg initi end border italian italian link link ms link link gt link italian figur ontolog analysi act behalf human oper agent call ter op act behalf border trac oper requir provid servic link commun link figur depict link intern extern servic link speci cation involv agent step speci cation step strictli relat interact organ concern de nition provid servic prototyp messag content associ servic includ domain depend part agent ontolog figur show limit messag servic train predic domain msg hold messag content de ned predic domain hold pair form content messag chosen agreement structur inform exchang actor section domain domain domain domain domain domain domain domain load domain domain domain dispatch domain domain domain domain domain domain figur ontolog analysi figur messag content servic rst content ithaca train schedul messag content ithaca repli request variabl instanti ithaca schedul messag content ithaca schedul accept termin oper intern extern set link de ned step relat train shown figur extern relat servic export termin oper intern relat servic provid agent request agent ithaca extern involv relat servic import extern human transport oper intern start agent ithaca schedul train de sc sc start messag receiv ithaca start receiv rst messag possibl start depend resourc train step initi state program descript step set initi state program agent prototyp initi state agent instanc set repres initi ithaca train mida vide ithaca vide train mida figur prototyp architectur descript knowledg applic domain speci cation agent program base model de ned step figur show rule includ program agent ithaca ter op execut gure rst rule state agent ithaca receiv request schedul state auxiliari condit record request state submit request human resourc forward op rule state agent ithaca receiv ter op messag valid queri intern state retriev detail request train activ order notifi trac oper figur rst rule agent submit train schedul ithaca rule submit ithaca accept messag link figur prototyp architectur descript schedul rule ter op handl messag state resourc train step prototyp implement program agent de ned step translat interpret interfac extern softwar modul roll stock implement modul simul code agent train mida step prototyp simul step perform caselp visual line visual discoveri implement error miss rule agent program line visual provid trace behaviour prototyp valid expert italian railwai figur present execut trace trace record messag exchang agent simul process manag train gure show exchang messag note upper left agent ithaca schedul receiv posit answer op avail human resourc train figur present complet trace messag request load author domain gw domain gw domain domain domain domain domain gw domain gw domain domain figur ontolog analysi simul solut valid ter op noti ed op discuss point view main goal project verifi feasibl automat support system complex scenario railwai freight transport point view main goal project test caselp real trivial case obtain feedback improv implement realiz adopt simpli cation respect real achiev goal section outlin encourag result obtain result italian railwai quickli move wide area train control equip high manag con ict gener run train mainten safeti requir support system er global framework captur wide set process involv train dispatch model prioriti inher order train oper provid power support italian railwai natur interest demonstr feasibl di erent technolog model core railwai manag process messag ter op ithaca messag ithaca ter op repli messag ter op ithaca messag ithaca messag ithaca repli messag op messag op repli messag ithaca messag ithaca repli figur speci cation ma approach adopt suitabl formal process repres valid framework design support system train oper caselp demonstr power instrument rapid prototyp ma applic avail tool likelihood ma technolog adopt italian model system quickli extens simul ma approach methodolog due current lack formal method speci cation develop railwai system repres rigor approach applic design realiz produc posit term exact quick valid system speci earli test system featur perform mean simul ithaca check true true ithaca check true figur program descript agent ithaca result disi distinguish main result obtain project applic caselp realiz demonstr caselp pro applic prototyp simul transport shown caselp suit realiz prototyp entiti order achiev common goal massiv messag pass order exchang inform caselp method develop method includ caselp architectur design implement partial requir repli check ithaca ithaca repli check ithaca ithaca figur program descript agent ter op analysi develop complex applic highlight introduc method abstract model captur requir applic captur requir step method adopt formal phase requir analysi section prevent earli commit ma architectur term incorrect group function applic develop caselp tool good testb set tool notat caselp languag architectur descript demonstr tool set con gurat prototyp describ link agent servic cation perform natur caselp speci cation de ning agent program direct map messag program rule rule handl caselp visual prove debug agent code line visual prototyp execut discoveri error agent highlight introduc rule miss line visual present make process expert italian railwai line trace give overview process valid optim tool improv ad caselp translat fulli autom realiz compil requir great ort code common commun pattern provid order speed prototyp realiz caselp tool adequ model commun unsatisfactori model agent knowledg reason commun natur prototyp realiz caselp uenc increment design system adopt sophist knowledg reason techniqu caselp wider rang applic area figur trace nt process figur trace la process chapter futur develop dissert present caselp applic speci cation environ base logic prototyp environ build complex distribut softwar applic system basic idea design caselp creat environ accommod speci cation implement languag legaci ma prototyp built rang techniqu integr common framework base logic program chapter summar main result achiev give overview futur research direct caselp evolv achiev result research caselp undertaken main object mind rst goal show logic program facilit realiz environ formal develop prototyp goal demonstr environ ectiv rapid prototyp complex softwar applic rst goal current statu environ satisfactori caselp method softwar engin develop prototyp ma sequenc clear step caselp tool support develop perform step caselp method tool address orthogon issu fundament develop system task organ design function structur identifi basic servic prototyp group agent task organ languag speci es architectur prototyp term agent commun link knowledg organ concern declar procedur knowledg agent manipul order accomplish task declar knowledg de ned caselp mean design express knowledg applic domain ma formal attribut function caselp agent procedur knowledg concern rule plan agent order perform task assign languag design program behaviour agent term rule interact organ concern agent interact caselp address issu provid softwar engin sophist agent commun languag tool speci cation place agent design de ne protocol inform exchang caselp support test ma prototyp caselp visual graphic environ interact debug prototyp implement visual design stop execut ma point observ detail exchang messag agent state updat visual trace tool present interact agent caselp shell user set paramet simul durat failur rate commun channel collect statist simul execut goal caselp successfulli appli realiz prototyp applic outlin section fruit spa led realiz prototyp system simul postal devic perform mail sort prototyp applic built retriev medic inform distribut manag distribut transact constraint logic program techniqu combin dissert present detail joint project italian railwai depart prototyp good demonstr applic caselp complex applic futur work caselp ongo research project direct futur work outlin import distribut caselp agent build caselp prototyp logic distribut execut central simul research direct aim physic distribut agent simul uniqu central entiti intercept signi event occur distribut node order trace global execut simul provid inform agent run autonom asynchron di erent node prototyp gain ecienc similar distribut applic agent integr research issu involv extend set languag agent caselp aim prototyp develop write agent program directli agent architectur hhf integr prototyp agent written widespread commerci greatli problem legaci softwar agent written languag easili wrapper legaci softwar integr caselp speci cation languag languag notat provid caselp speci cation agent ma captur languag describ featur possibl develop speci cation languag system captur repres distribut agent integr legaci softwar languag descript simpl reactiv agent complex agent mental featur found semant languag order bridg gap theori practic agent eld possibl adopt exist speci cation languag descript ma extens analysi uml speci cation languag present work extend uml speci cation construct approach integr textual version extend uml caselp bibliographi van de user manual adali subrahmanian intellig cach hybrid knowledg base proc intern confer larg knowledg page io press mascardi approach vehicl monitor technic report disi di di sistemi logica linear master disi di italian bowen world wide web virtual formal zini logic program synerg combin applic semant logic program perspect zini system develop softwar engin proc intern workshop practic aspect declar languag number lectur note comput san januari dunin treur model system composit formal framework intern journal cooper inform special issu formal method cooper inform system subrahmanian heterogen multimedia reason ieee septemb brook intellig arti cial applic system trac transport iee proc softwar structur bdi agent function cluster jen intellig agent vi agent languag intern number lectur note arti cial juli benjamin ieee intellig schroeder save energi control mark base page world scienti jack intellig agent user guid agent orient softwar octob project european union program telemat applic transport contract tr speci cation system web jen part electr transport manag ieee ad agenti la di postal master disi di italian zini agent base prototyp freight train trac manag proc workshop satellit event septemb pl zini prototyp freight train trac manag system proc ieee intern confer intellig novemb ieee comput societi press zini combin logic agent rapid prototyp engin distribut applic proc intern confer softwar technolog engin septemb ieee comput societi press uml speci care ed caselp master disi di italian delzanno logic program linear logic phd di dipartimento di march technic report td delzanno martelli proof comput linear logic theoret comput scienc wooldridg formal speci cation dmar intellig agent iv agent languag intern number lectur note arti cial intellig weld scalabl agent world wide web proc intern confer autonom agent page marina del elliott autonom agent synthet charact ai page summer eriksson ulm toolkit john wilei fisher repres abstract agent architectur singh intellig agent agent languag intern number lectur note arti cial page juli franklin graesser taxonomi autonom agent intellig agent iii agent languag intern number lectur note arti cial august genesereth ketchpel softwar agent commun juli de levesqu concurr program languag base situat calculu arti cial girard linear logic theoret comput grand cli entertain softwar agent arti cial life autonom agent program system group sicstu prolog user manual swedish institut comput septemb de van der meyer control structur agent languag singh intellig agent agent languag intern number lectur note arti cial page juli survei methodolog singh intellig agent agent languag intern number lectur note arti cial juli georg rao architectur reason system control ieee wooldridg roadmap agent research develop autonom agent georg rao methodolog model techniqu system bdi agent van de veld agent break number lectur note arti cial page kowalski sadri logic program system annal mathemat arti cial kramer distribut softwar engin proc intern confer softwar page ieee comput societi press labrou finin kqml speci cation technic report tr comput scienc electr engin maryland baltimor peng agent commun current landscap ieee intellig page luca oasi air trac manag system proc paci rim intern confer ai lloyd foundat logic program inform agent extract sport result world wide web ndumu proc fourth intern confer exhibit practic applic intellig agent technolog april subrahmanian hybrid knowledg base ieee transact knowledg data octob mae agent reduc work inform overload commun juli marcu subrahmanian foundat multimedia system journal speci ca di sistemi master disi di italian zini flexibl languag heterogen agent page zini speci cation heterogen agent architectur castelfranchi intellig agent vii agent languag intern lectur note arti cial juli zini appli logic program speci cation complex applic mathemat model scienti zini complex applic speci cation environ base logic program proc post confer workshop logic program page juli zini softwar prototyp nwana proc intern confer exhibit practic applic intellig agent technolog page march zini speci cation simul system caselp proc septemb mascardi approach distribut distribut prototyp softwar phd thesi disi di itali mascardi constraint technolog distribut transact manag proc june icsc academ press finin evalu kqml agent commun languag intellig agent ii agent languag intern number lectur note arti cial august miller speci cation logic theoret comput fisher agent model metatem desir intellig agent iv agent languag intern number lectur note arti cial intellig control architectur autonom interact survei intellig agent number lectur note arti cial agent thing singh intellig agent agent languag intern number lectur note arti cial page juli editor softwar report confer sponsor nato scienc ndumu nwana research develop system iee proc softwar februari kitano robot world cup soccer game confer ai page fall de caselp tool di sistemi master disi di italian giorgini knowledg level softwar engin methodolog agent orient softwar technic report irst istituto di novemb di master disi di italian softwar engin approach european edit adapt rao georg model ration agent fike proc knowledg reason page san morgan kaufmann publish rao bdi agent speak logic comput languag van de veld agent break number lectur note arti cial page schroeder wagner vivid applic submit journal logic comput shoham program arti cial march conwai execut algorithm ecient pure declar logic program languag journal logic spivei notat practic hall sterl nding needl www haystack proc australian joint confer arti cial number lectur note arti cial anim speci cation prolog intern journal softwar engin knowledg sterl shapiro art prolog mit subrahmanian principl multimedia system morgan kaufman januari virtual marketplac electron commerc appli arti cial van kowalski semant predic logic program languag journal wang wang intellig agent nuclear industri ieee intellig agent telecommun agent foundat applic page wooldridg jen intellig theori practic knowledg engin yu model strateg relationship process reengin phd depart comput octob zini sterl design ontolog agent proc septemb
Agents/1159 1 softwar engin nichola jen michael wooldridg depart electron engin queen mari westfield colleg london london unit kingdom abstract techniqu repres excit mean design build complex softwar system potenti significantli improv current practic softwar engin extend rang applic feasibl tackl attempt cast agent system softwar engin paradigm paper seek rectifi omiss argu conceptu apparatu system build softwar solut complex system approach repres genuin advanc current state art engin complex system major issu adopt approach softwar engin highlight discuss introduct design build high qualiti softwar difficult claim develop project complex construct task undertaken human wide rang softwar engin paradigm procedur structur declar design applic framework success develop claim make engin process easier extend complex applic feasibl built evid support research continu strive effici power softwar engin solut demand applic requir paper argu design implement softwar collect autonom agent system repres point departur softwar engin debat constitut autonom agent constitut work seek abstract standpoint focu characterist consensu central hypothesi class problem adopt approach system develop afford softwar engin number advantag contemporari method note suggest system silver bullet evid suggest repres order magnitud improv softwar engin class approach significantli improv softwar develop process seek demonstr efficaci compel form analysi quantit show adopt techniqu standard set softwar develop process rang project data simpli establish method compel argument believ approach benefit engin complex softwar system argument evolv decad experi agent technolog construct realworld applic wide varieti industri commerci domain contribut paper twofold system tout technolog major impact futur gener softwar market year revolut systemat evalu case number deploi agent applic make paradigm effect major gap paper seek address compar work view system softwar engin shortcom rectifi recast essenti compon agent system tradit softwar engin examin impact softwar engin adopt approach remaind paper structur section make case approach softwar engin type complex present kei conceptu mechan explain mechan suit tackl complex present softwar develop section examin impact adopt approach softwar engin implement verif phase section deal pragmat softwar engin present common pitfal frequent develop section conclud identifi major open issu address techniqu reach softwar engin mainstream case approach softwar engin section essenti natur softwar system present notion softwar argument advanc techniqu suit develop complex softwar system natur complex softwar system softwar complex typic larg number part interact complex innat properti type task softwar role softwar engin provid structur techniqu make easier handl complex complex exhibit number import regular complex frequent form hierarchi system hierarchi natur relationship vari gener form identifi relationship frequent vari time choic compon system primit arbitrari defin aim object hierarch system evolv quickli compar size complex system evolv simpl system rapidli stabl intermedi distinguish interact interact frequent order magnitud predict rise view complex system treat independ interact interact predict design draw insight defin canon view complex system hierarch natur express compon connect interact compon express link variabl notion primit compon atom compon level expand entir subsequ level term subordin author relat system belong interpret broad system success set figur view canon complex system softwar engin number power tool order manag complex princip mechan includ basic techniqu tackl larg problem divid manag chunk dealt rel isol figur decomposit tackl complex limit instant portion problem consid process defin simplifi model system detail suppress techniqu work limit scope interest time attent salient aspect relev detail process identifi manag problem solv compon interact link figur abil enact relationship design tackl complex wai enabl number basic compon group treat unit analysi individu compon treat singl unit parent system provid mean describ relationship unit number compon work order provid function booch term final point hierarchi invari connot neutral term arrang correspond control correspond group fall compon frequent interact infrequ interact natur tool vari enorm softwar paradigm clear posit determin issu assess power argument advanc chosen deal issu softwar engin build system effect great deal ongo debat constitut approach consensu number research find agent encapsul comput system situat capabl autonom action environ order meet design object number point definit requir explan agent identifi problem solv entiti boundari situat receiv input relat state environ sensor act environ design fulfil specif object explicitli implicitli repres control intern state capabl exhibit flexibl problem solv reactiv respond time fashion occur environ order satisfi design proactiv opportunist adopt goal initi order satisfi design adopt view appar singl agent insuffici problem requir involv multipl repres natur multipl loci multipl compet interest agent interact achiev individu object manag depend ensu situat common environ interact rang simpl semant abil exchang tradit type interact abil request action rich social interact abil coordin negoti natur social point qualit differenti agent interact typic agent partial view environ overlap limit sphere influenc alter environ argu thing singl agent involv multipl agent occur softwar engin paradigm interact gener occur agent commun languag base speech act theori interact conduct knowledg level term goal method invoc function call oper pure syntact agent flexibl problem oper environ partial control interact handl similarli flexibl manner agent comput apparatu make natur scope interact initi respond interact necessarili foreseen design time agent act achiev object behalf individu compani agent interact typic underli context context defin natur relationship agent peer work boss involv seri relationship captur agent system explicit construct model relationship structur note relationship chang system oper social interact mean exist relationship evolv agent award relat creat number agent form team deliv servic individu tempor extent relationship vari long deliv servic perman bond cope varieti agent research expend protocol enabl group form mechan ensur group act coher develop structur macro behaviour collect draw point adopt approach softwar engin mean problem autonom compon object achiev kei abstract model defin interact explicit structur mechan describ manag complex chang web relationship exist agent case approach complex system agent techniqu suit develop softwar system argument show decomposit effect problem space complex system show kei abstract natur mean model complex system show philosophi identifi manag relationship deal depend interact exist complex system make case softwar engin final step argu techniqu repres genuin advanc current state art approach compar techniqu mainstream softwar engin involv comparison analysi design built interact object encapsul data procedur oper data built assembl compon structur decomposit environ figur canon view system relationship interact agent complex system consist number relat hierarch fashion work achiev function parent system constitu compon work deliv function basic model interact work view sphere influenc achiev object occur system natur compon term object compon thought achiev object import observ current softwar engin trend encapsul problem decomposit appli philosophi decomposit mean individu compon thread control compon encapsul inform problem solv abil meet object compon typic oper environ partial action perform pursuit object compon autonomi choic action order activ autonom compon fulfil individu collect interact complex system inher complex mean imposs priori potenti interact occur unpredict unpredict unpredict compon futil predict possibl realist endow compon abil make natur scope interact compon abil initi respond interact flexibl manner polici defer compon interact facilit engin complex system wai problem coupl compon significantli reduc deal flexibl declar compon specif design deal unanticip request gener request assist find difficulti interact enact agent commun coupl issu remov syntact level concern type error unexpect interact problem manag control relationship softwar compon task tradit function significantli reduc agent continu activ coordin requir handl interact order goal longer rigidli prescrib design time handl manner appar natur complex system term autonom compon object achiev decomposit make easier develop complex system view decomposit base intuit easier produc base acknowledg commun pg appropri abstract part design endeavour find model view problem multipl candid difficult task pick turn specif case design power abstract semant gap unit analysi intuit problem construct present solut paradigm problem consist interact relationship case view compon agent made interplai constitu compon natur view term social level find collect object collabor achiev higher level pg view accord knowledg level social level treatment interact afford approach agent system invari term achiev common resolv captur type interact occur complex system complex system involv chang web relationship compon requir collect compon treat singl conceptu unit view level abstract view match close abstract provid facil typic provid explicitli repres relationship interact protocol develop form group unwant structur model collect point relat repres team compon work achiev collect goal flexibl manag chang structur complex system involv varieti rang peer control ongo relationship import main reason number separ compon group treat singl conceptu entiti enabl link entiti influenc impact relationship structur system import provid explicit support flexibl manag relationship frequent abil dynam adapt prevail circumst essenti entiti agent system explicit structur flexibl mechan central agent paradigm coupl support comput enabl system exploit facet natur complex system notion primit compon vari observ entir view altern team collect agent view primit system eventu bottom structur provid varieti stabl intermedi essenti rapid develop complex system avail mean individu agent group develop rel isol ad system increment manner ensur smooth growth function agent versu object number similar orient view system develop import interact entiti number import differ object gener passiv messag aliv object encapsul state encapsul behaviour activ object invok publicli access method object method action perform object whilst approach suffic smaller applic cooper suit larg competit environ modu place invok behaviour client server matter insight polit scienc approach scale action executor matter action invoc process mutual definit intim detail action good reason behaviour invok current situat executor request point potenti damag consequ carri observ pertin softwar move realm control singl inher cooper group open environ system compet fail provid adequ set concept mechan model type system depict figur complex system find class modul provid essenti insuffici mean pg complex system requir richer problem solv abstract individu object repres fine granular behaviour method invoc primit mechan describ type interact place recognit led develop power abstract mechan design pattern applic framework whilst undoubtedli step fall short desiderata complex system develop focu gener system function mandat pattern interact rigid orient approach provid minim support structur collect relationship defin inherit class illustr figur complex system involv varieti relationship simpler technolog close relat system softwar number motiv arguabl singl import driver compon system long dream softwar industri softwar problem softwar develop everydai softwar develop project develop softwar compon scratch element typic softwar project successfulli implement time result research decad eager develop method permit build softwar compon electron engin build system integr circuit softwar compon java bean approach problem essenti compon model develop build combin softwar simplest exampl compon softwar user interfac design construct user interfac languag typic make rang implement interfac element compon element directli develop singl unit direct applic develop user interfac compon method manipul graphic develop environ compon descend inherit properti close relationship object agent hold true object compon agent share compon concept singl unit agent typic comput deploi compon order servic provid agent equip abil respond request inform servic provid compon autonom understand agent notion social behaviour compon softwar make argument favour propon program paradigm claim mechan implement techniqu undoubtedli true system comput program miss point softwar paradigm techniqu provid softwar concept extens paradigm softwar lifecycl understand techniqu repres approach engin complex turn detail softwar engin examin specif agent system discuss implement specif explor verifi implement system fact satisfi specif detail discuss issu specif problem agent system requir agent specif sort properti capabl view agent discuss predomin approach agent involv treat intent system understood attribut mental state intent number approach formal agent capabl repres aspect belief agent inform incomplet goal agent action agent perform effect ongo interact agent agent interact environ time call theori explain aspect agenc interact achiev map input output agent theori success approach agent theori tempor modal logic restrict prevent detail technic discuss extens logic framework theori intent model model primit belief goal attitud notion built intent addit belief goal kei technic problem face agent theorist develop formal model good account interrelationship attitud intern state compar attempt made real agent system attempt implement implement system correct respect specif issu move abstract specif concret comput system possibl achiev transform directli execut anim abstract translat compil specif concret comput form automat translat techniqu investig possibl turn directli execut agent specif system express logic languag obtain concret system φ treat execut interpret specif directli order gener behaviour interpret agent specif view kind construct proof show specif φ satisfi build model logic model specif languag comput model build view execut specif make discuss concurr metatem program languag agent program give tempor logic specif behaviour intend specif directli execut gener behaviour model tempor logic concurr metatem agent linear discret sequenc execut concurr metatem agent specif process construct sequenc state state sequenc view histori trace program tempor logic concurr metatem base comput actual execut algorithm note execut concurr metatem agent specif primarili model concurr metatem tempor logic base compar obviou intuit comput interpret agent specif languag gener bdi formal rao georgeff base complex logic base semant framework world technic detail involv main point world semant comput tation concurr metatem semant clear logic base semant number research attempt develop execut agent specif languag simplifi semant comput interpret essenti bdi simpl comput semant compil agent specif altern direct execut compil abstract transform concret comput model automat synthesi process main perceiv advantag compil direct execut effici direct execut agent concurr typic involv manipul symbol specif run time manipul gener correspond reason costli compil approach aim reduc abstract symbol specif simpler comput requir symbol work execut compil system symbol reason compil approach depend close relationship model modal logic typic label graph finit state machin pnueli reactiv system branch tempor logic specif similar techniqu develop concurr system skeleton tempor logic specif approach agent develop situat automata paradigm rosenschein kaelbl epistem logic logic knowledg percept compon intellig agent system techniqu base construct proof directli automata specif gener approach automat theoret limit number import respect agent specif languag reason carri system gener capabl capabl adapt direct execut agent specif framework tend concret comput make synthesi imposs verif develop concret show system correct respect origin specif process import introduc inform develop process divid approach verif system broad semant subsect approach evidenc system axiomat approach axiomat approach program verif enter mainstream comput work hoar late axiomat verif requir concret program systemat deriv logic theori repres behaviour program call program theori program theori express logic languag origin verif reduc proof show specif theorem logic consequ program theori develop program theori made feasibl axiomat program languag system implement hoar logic axiom statement type simpl languag program theori deriv program text systemat relev work mainstream comput scienc specif verif reactiv system tempor pioneer colleagu idea comput reactiv system infinit correspond model linear tempor logic tempor logic develop system axiomat program languag axiomat systemat deriv theori program program text specif program theori encod tempor verif proof problem tempor logic compar work carri system commun axiomat environ review approach axiomat approach verif system idea tempor belief logic axiomat properti program languag program theori repres properti system systemat deriv tempor belief logic reason tempor compon requir observ captur ongo behaviour system belief compon agent verifi symbol ai system agent symbol reason includ environ desir behaviour belief compon logic captur symbol present agent program languag axiomat tempor belief logic concurr metatem note approach reli oper agent suffici simpl properti axiomat logic work current metatem larg languag simpl close relat turn simpl logic semant complex axiomat straightforward captur semant concurr execut agent easi area ongo research comput scienc semant model check axiomat verif reduc proof problem axiomat approach verif inher limit difficulti proof problem proof hard classic addit tempor modal connect logic make problem harder effici approach verif sought success approach model check axiomat approach gener reli syntact model check approach base semant specif languag model check formula φ languag model determin φ valid φ model verif studi connect tempor logic techniqu reli close relationship model tempor logic machin φ specif π program claim implement φ determin π implement gener model correspond encod comput π determin specif formula φ valid program π satisfi specif φ case answer main advantag model check axiomat verif model check branch time tempor logic ctl polynomi proof problem modal logic complex rao georgeff present algorithm model check agent system give algorithm logic model bdi agent specif formula determin formula valid model techniqu close base model check algorithm normal modal logic show extra ctl branch time algorithm run polynomi time step model check process effici clear step bdi logic logic model agent deriv arbitrari program mainstream comput program implement deriv intent access relat give semant bdi compon logic note clear relationship bdi logic concret comput model implement clear model deriv pitfal develop highlight potenti benefit softwar section pinpoint inher drawback build softwar agent technolog set problem directli attribut characterist softwar approach robust reliabl agent system design found mean circumv problem solut tend case case gener solut long made fact agent situat problem act pursuit object maintain ongo interact environ make difficult design softwar capabl maintain balanc proactiv reactiv behaviour lean risk agent undertak irrelev task circumst lean mean agent fulfil object constantli respond strike balanc requir make mean unpredict object agent pursu circumst method achiev chosen object agent interact repres hitherto unseen level sophist inher unpredict gener case agent pattern effect interact uncertain agent object requir interact acquaint interact order realiz interact occur time interact predict advanc agent request interact recipi ultim respond request immedi honour modifi form social interchang natur simpl request versu outcom interact determin onset final sourc unpredict system design relat notion emerg behaviour long interact process act interact design interact result behaviour phenomena gener understood sole term behaviour individu compon emerg behaviour consequ interact compon sophist flexibl agent clear scope unexpect individu group behaviour specif technolog identifi number pitfal occur repeatedli agent develop project agent fail understand agent usefulli appli agent technolog subject attent comput scienc ai predict made long term potenti greatest current sourc perceiv failur agent develop initi simpli fact develop overestim potenti agent system agent technolog repres potenti import implement import understand limit agent ultim agent solut subject fundament limit convent softwar solut agent technolog solv problem dog ai incept agent system typic make ai techniqu applic ai technolog capabl limit state art field artifici intellig field suffer claim potenti expert system experi illustr technolog essenti agent technolog fall prei problem sober expect agent technolog provid extrem import religi agent agent wide rang solut applic convent softwar develop paradigm rel immatur agent technolog small number deploi agent clear advantag agent base solut approach contempl agent common problem technolog hype agent manag read optimist forecast potenti agent technolog part revenu manag agent project clear idea bui busi model agent understand agent enhanc exist enabl gener product build gener solut problem pitfal softwar project fall preval agent commun typic manifest testb supposedli enabl rang potenti type system requir design tackl singl problem custom built solut easier develop satisfi requir applic agent silver bullet holi grail softwar engin techniqu provid order magnitud improv softwar develop agent technolog newli essenti softwar matter time claim agent silver bullet danger naiv point good argument favour view agent technolog lead improv develop complex distribut softwar system argument larg practic forget develop softwar time develop agent system trivial essenti process trust techniqu assist develop produc agent softwar perform profil process encourag develop forget develop softwar result project basic softwar engin good practic forget develop softwar system long complex class comput system design implement system tend agent societi build vital ignor lesson learn concurr distribut system commun problem inher system adopt approach design exploit concurr obviou featur poor design amount concurr problem solv compar small extrem case singl thread control appropri solut question decid agent architectur agent architectur essenti design build agent attempt agent great imagin exist agent architectur meet requir design principl design agent architectur scratch recommend studi architectur literatur implement design agent ai build agent understand focu aspect applic result agent framework techniqu languag theorem reason mainten usabl success short term strategi build agent minimum ai techniqu agent learn system tendenc view agent perceiv conceptu pure adopt end agent includ agent addit subtract difficult naiv view agent extrem overhead manag agent commun rapidli outweigh benefit solut refer comput entiti agent agent design imagin separ agent approach creat system complet fail exploit power offer agent develop solut small number agent work solut tend fail standard softwar engin test requir softwar modul coher function result write program bundl function singl class result pretti spend time implement infrastructur greatest obstacl wider agent technolog softwar platform develop system platform provid basic infrastructur messag trace requir creat system system project portion resourc devot implement infrastructur scratch implement valuabl time spent ment librari softwar tool exchang messag network time librari tool frequent enthusiasm left work agent aspect system agent interact freeli dynam system chaotic find happen run system repeatedli system dynam complex manag effect common misconcept system requir real structur true agent system requir engin structur societi typic reduc accur model problem tackl hope highlight main pitfal await agent system develop note intent develop complex tradit softwar engin approach pitfal common solut pitfal common solut success develop elimin obviou sourc failur perceiv agent technolog softwar engin discuss detail characterist complex system appropri object agent repres natur abstract mechan complex system kei issu verif drawn parallel similar work mainstream comput scienc shown formal techniqu develop verifi agent system close relat develop reactiv system mainstream comput pitfal develop softwar engin agent system earli stage widespread accept concept agent impli agent futur softwar engin technolog softwar engin aspect import outstand issu softwar engin understand situat agent solut principl inform develop techniqu agent system attent form analysi design methodolog agent system attent refer austin thing clarendon oxford owen framework program tempor workshop refin distribut correct volum booch analysi design addison weslei brook addison weslei applic distribut comm acm chella cambridg press clark emerson synthesi synchron skeleton branch time tempor logic program volum cohen levesqu choic artifici dennett intent mit press vardi mit press fisher altern approach concurr theorem parallel process artifici intellig elsevi scienc fisher wooldridg formal specif verif multiag int journal cooper inform system johnson vlissid element reusabl addison weslei warner revolut halpern vardi check versu theorem ai mathemat theori honor john academ press hoar axiomat basi comput comm applic inform bi strateg report jen campo social level social iee proc softwar engin sycara wooldridg roadmap agent research int journal autonom agent system jen wooldridg applic springer verlag kinni georgeff design intellig agent iii volum manna pnueli verif reactiv meyer softwar prentic hall milner comm acm knowledg artifici intellig jen distribut artifici john wilei son parunak practic applic mit press pnueli develop reactiv inform process elsevi scienc publish pnueli synthesi reactiv acm sym principl program rao bdi agent speak logic comput van de veld agent break european workshop model autonom agent volum rao georgeff theori proc st int conf san ca rao georgeff approach verif situat reason proc int joint conf artifici franc rosenschein kaelbl synthesi digit machin provabl epistem proc conf theoret aspect reason morgan kaufmann rosenschein kaelbl situat view agr comput theori interact mit press russel norvig modern shoham artifici simon scienc mit press addison weslei weiss mit press wooldridg logic model comput phd depart uk wooldridg softwar iee proc softwar wooldridg jen theori knowledg engin review wooldridg jen int conf autonom mn
IR/1160 5 algorithm applic imag retriev ying qi thoma huang beckman institut illinoi il abstract proc ieee conf hilton head vision practic learn face label train data result poor gener imag label imag queri relev feedback hard automat weight imag featur select similar metric imag classif paper investig possibl includ unlabel data set make label data current research imag approach cast imag retriev transduct learn gener imag classifi defin set imag imag formul transduct problem probabilist estim paramet gener find linear transform relax assumpt probabilist structur data distribut select good featur automat experi show satisfactori perform imag retriev applic algorithm potenti applic introduct recent year wit rapid volum digit imag motiv research imag retriev earli research imag retriev search manual annot imag techniqu impract larg size imag subject mean imag avoid manual altern approach imag retriev imag index visual content research made extract imag featur evalu distanc metric search scheme cbir gap concept imag due rich content subject concept imag map highli nonlinear impract repres explicitli approach problem machin map learn set exampl imag retriev cast statist learn problem learn techniqu flexibl tractabl mean vision gener learn result depend train algorithm train data set train data set larg repres good gener obtain train data set small hard good gener classifi train data overfit occur good larg train data set easili obtain situat vision imag collect larg inform train data set trivial task data collect straightforward collect repres data due larg variat visual input manual label larg date set sampl label learn interest result theori support vector machin classif boundari relat support data set identif support vector motiv role vector easier collect unlabel data issu combin unlabel data learn begin receiv research recent research problem infanc assum parametr probabilist method base svm size unlabel data method formid comput resourc mathemat program method select kernel function heurist altern method fit problem em framework emploi parametr model applic text classif em systemat approach method larg depend priori knowledg probabilist structur data distribut paper imag retriev problem view transduct present probabilist approach emploi unlabel data problem formul task imag retriev find imag queri imag retriev system act classifi divid imag relev irrelev imag imag repres featur vector label imag space practic repres imag lower featur space raw imag space physic featur mathemat featur typic research made extract physic featur color textur edg structur combin featur imag rich repres physic featur altern mathemat perform dimens reduct mathemat princip compon analysi typic techniqu obtain mathemat featur determin princip compon face automat featur partli reason gap concept lowlevel imag featur imag repres set physic color featur color histogram color moment suitabl combin color textur featur perform approach set rule select featur impract construct rule imag class mathemat featur understand mean import featur learn approach account obtain rule implicitli dynam face learn approach label train sampl set small applic imag limit number label train sampl queri relev learn concept pure learn small train data set poor gener perform larg number unlabel imag learn unlabel data inform joint distribut featur probabilist structur data distribut paramet probabilist model estim learn imposs assign class label label data fact suggest label data label class unlabel data estim paramet gener model hybrid train data set consist label data set featur label size unlabel data set size set imag queri imag act label subset treat unlabel set imag retriev formul transduct gener map function learn label train data set specif unlabel data set make assumpt distribut assumpt queri imag drawn imag imag retriev classifi imag arg max number imag retriev care perform classifi imag unlabel data approach appli transduct learn label unlabel data treat miss valu assum hybrid data set drawn mixtur densiti distribut compon mixtur model repres sampl drawn hybrid data set make assumpt compon mixtur densiti correspond train data set union set label data set set unlabel set joint probabl densiti hybrid data set written equat hold assum sampl independ part equat unlabel data part label data paramet estim maxim posteriori probabl maxim log sum hard deal binari indic ic ij ij ij em algorithm estim probabl paramet iter hill climb altern calcul expect valu unlabel estim paramet em algorithm gener reach local maximum consist iter set set arg max denot estim iter size label set em basic perform label data identifi compon probabilist number compon mixtur em estim true paramet probabilist model perform bad prior knowledg data gaussian distribut assum repres class assumpt invalid partli reason unlabel data hurt classifi figur show simpl figur class data drawn gaussian distribut sampl label em assum gaussian class iter begin weak classifi learn label sampl weak classifi estim label unlabel sampl data emploi learn label unlabel sampl iter special em converg bayesian classifi guess probabilist structur em give good estim figur class data drawn gaussian model assum gaussian distribut em fail give good classifi algorithm em fail structur assumpt hold approach problem structur select comput resourc altern find map data cluster map data probabilist structur simplifi captur simpler gaussian mixtur multipl discrimin analysi multipl discrimin analysi natur gener fisher linear discrimin case multipl class mda advantag successfulli appli task face recognit basic idea mda find linear transform bayesian classifi em iter bayesian classif em iter figur repres unlabel sampl denot label sampl sampl label solid line bayesian dash line iter result em data drawn gaussian distribut em converg bayesian classifi class data drawn gaussian em assum gaussian compon mislabel em fail unlabel data map origin data space space ratio scatter scatter maxim space arg max random vector drawn class origin data space ith class probabl vector scatter matrix sw defin sw denot class scatter matrix defin grand defin detail found mda mean catch major class discount factor relat classif featur relev classif automat select combin linear map featur substanti physic mean advantag mda data cluster extent project make easier select structur gaussian mixtur model algorithm appar mda statist requir label sampl estim statist covari label data expect mda output good result combin mda em algorithm suppli mda label data combin paradigm basic idea identifi sampl unlabel data set enlarg label data set techniqu made enlarg label set begin weak classifi learn label set expect weak classifi unlabel sampl classif confid jk base probabilist label jk assign weak classifi jk jk heurist weight unlabel data choic mda perform weight data set data set linearli project space dimens unchang label paramet probabilist model estim maxim posteriori probabl probabilist label bayesian classifi algorithm iter algorithm termin method preset iter compar threshold paramet consecut descript algorithm algorithm label set unlabel set classifi paramet begin number compon iter weight return end note simplif probabilist structur mda compon data distribut mix find linear map imag retriev approach relev feedback imag relev irrelev exampl label human larg risk weight imag featur small label data similar imag vagu random subset unlabel data dem algorithm identifi imag label imag enlarg label data set good discrimin featur automat select enlarg train data set repres implicit concept applic imag retriev straightforward current transform class repres gaussian distribut covari priori probabl class iter boost initi weak classifi experi order give analysi compar manual label imag subset corel dataset class church mountain view tiger imag label class label unlabel data calcul classif error investig unlabel data feed algorithm number label unlabel sampl label imag obtain relev feedback unlabel error rate drop figur find bring accuraci combin unlabel data larg reduc classif error label data number unlabel data label data label data label data label data figur label unlabel data error rate ad unlabel data combin unlabel data larg reduc classif error test compar method weight featur relev feedback physic featur top similar imag obtain rank imag compar mahalanobi distanc mean queri imag method simpl probabilist method class assum gaussian model paramet estim feedback imag method basic em assum gaussian distribut class fourth algorithm probabilist label imag maxim posteriori arg max compar set physic featur mathemat featur physic featur color featur includ std skew hsv textur featur extract structur featur repres statist edg map mathemat featur extract number princip compon resolut imag reduc test method compar fulli classif error method calcul error train class method calcul error method queri imag belong sampl top belong error queri defin sampl total correctli error defin averag error obtain averag algorithm sp em tabl error rate comparison algorithm comparison base time relev feedback relev irrelev imag outperform method algorithm test larg corel imag wide rang categori resolut collect textur imag satisfactori result obtain gap concept visual featur cbir method imag approach formul transduct learn unlabel sampl combin label data train algorithm approach problem em framework assumpt probabilist structur em relax relev featur classif automat select experi show algorithm cbir algorithm easili expand retriev media type futur research direct approach explor case mda approach test size unlabel data set iter acknowledg work support part nation scienc foundat grant author anonym review comment refer support vector machin proc inform retriev larg distribut onlin commun dec classif scene analysi version transduct conf uncertainti artifici infer text classif support vector intl conf machin learn classif label unlabel document machin featur retriev imag ieee nov role unlabel data learn proc sixth intl colloquium cognit manipul imag intl journal comput content retriev imag featur integr spie storag retriev imag video current direct open journal visual commun imag power tool interact imag retriev ieee circuit system video vol ieee discrimin analysi imag ieee natur statist learn scheme visual featur base imag proc spie storag retriev imag video
ML/1161 6 learn detect salient object natur scene visual attent laurent koch california institut comput neural system program mail code ca abstract primat visual select attent rapidli select conspicu imag locat analyz detail select guid featur extract detect candid salient locat base local properti featur type orient difficulti inform modal combin singl control visual attent quantit compar featur combin strategi learn linear natur color imag introduct visual attent primat real conspicu target clutter visual environ reproduc target detect capabl artifici system import navig aid robot navig base studi human studi believ visual work support nation scienc foundat offic naval research special werner ritter provid traffic sign imag pietro perona comment discuss attent act akin neuron visual world enhanc restrict area attent progress cortic hierarchi highlevel pattern recognit locat spotlight control featur extract crude segment conspicu locat entir visual massiv parallel compet attent attent sequenti salient imag locat analyz detail koch visual attent seemingli perform break complex scene understand sequenc circumscrib pattern recognit problem volit compon attent form attent studi disregard compon studi model function account visual attent primat baluja model share similar gener architectur topograph detect local spatial discontinu orient attend locat attend locat inhibit featur map intens orient color linear filter differ normal featur combin maximum detector salienc map input imag weight coeffici binari target mask learn fig gener architectur visual attent system studi earli visual featur extract parallel entir visual scene featur extract achiev linear filter featur type color oper extract local spatial discontinu featur type featur map combin uniqu studi inform combin modal import color discontinu compar orient involv learn target region target combin maximum detector select salient locat salienc map shift attent locat subsequ suppress system focu salient locat flow achiev mechan akin biolog visual recept field recept field properti approxim filter gabor filter orient featur map visual modal combin uniqu map koch salienc map sequenti order focu attent central studi biolog artifici combin featur visual modal unrel dynam rang color uniqu salienc map model assum simpl summat featur linear combin weight quantit compar combin strategi natur color simpl summat scale fix dynam linear combin weight imag addit combin enhanc featur map isol peak suppress featur map uniform activ model detail model present briefli schemat fig import rememb type color orient extract separ combin uniqu activ control attent fusion inform difficulti combin featur map uniqu scalar salienc map repres priori compar dynam rang extract mechan larg number featur map combin color orient salient object strongli map risk mask salient object present larger number map simpl approach solv problem normal featur map dynam rang sum featur map salienc map priori weight featur refer strategi intens contrast color contrast orient contrast ms ms ms ms attend locat input imag salienc map fig oper model natur imag featur combin strategi exampl found learn learn introduc specif target detect featur map global multipli weight factor final input salienc map sum featur map featur map weight train base featur map insid manual outlin imag region desir target learn procedur weight featur map consist comput global maximum minimum map maximum insid manual outlin target maximum target updat weight addit learn rule independ map dynam determin learn speed posit weight learn procedur particip salienc map featur map show higher peak activ insid target map remain system weight converg comput initi salienc map attent scale fix rel weight featur map potenti diverg addit learn rule avoid constrain weight fix sum note local maxima activ imag averag activ area local activ import visual extend region small strong peak peak highli salient immedi averag activ extend region low amplif simpl normal consist global promot featur map small number strong peak activ man global suppress featur map elicit compar peak numer locat visual scene normal denot consist normal featur map dynam order elimin amplitud differ due dissimilar featur extract find global maximum averag local global multipli map local maxima activ consid compar map ignor homogen area compar maximum activ entir map averag activ spot measur activ locat averag differ activ locat stand strongli promot map differ map uniqu suppress normal replic biolog inhibit neighbor similar featur inhibit cannon normal oper close implement oper result discuss natur color imag evalu featur combin strategi consist imag red target demonstr simplest form featur map system specif encod main featur target explicitli detect system featur map consist imag vehicl emerg triangl target complic form special target uniqu imag conjunct red color ffi ffi ffi orient featur type repres system separ independ featur map consist imag acquir video camera mount passeng side vehicl driven german traffic sign traffic traffic sign target outlin binari target mask creat target consid detect focu attent intersect target imag disk radiu pixel complet coverag entir imag requir locat system perform random visit averag locat find small target imag imag split train set imag traffic test set imag learn train random pass set halv learn speed pass compar result obtain test imag set featur combin naiv model dedic normal featur weight set model dedic train dedic normal featur weight learn train set retain test set challeng target mediat detect version model imag version model immedi find target discard ensur perform result summar tabl tabl averag number detect standard red test set emerg triangl test set traffic sign test set imag naiv train red triangl traffic traffic sign found sign found naiv repres simplest solut problem combin featur map uniqu salienc perform simpl normal prove effici elimin featur map numer peak activ intens map imag larg variat illumin addit learn rule prove effici special gener model limit special obtain global weight featur learn enhanc map suppress poor gener expect learn larg varieti object type linear train emploi sum featur learn conjunct model train emerg triangl attend strong obliqu edg red color present red blob absenc obliqu orient extent human train number attend locat number target imag fig number attend locat standard find traffic sign real color normal featur compar optim perform detect learn conjunct featur remain controversi remark train model perform altern model studi traffic wide varieti shape color textur sign result entir traffic sign final present fig ideal traffic sign detector visit locat target fig perform system close dramat chanc perform good obtain train remark fact oper specif traffic sign oper provid reliabl detect salient imag repres approxim human salienc altern studi compar simpl strategi combin multipl featur map visual modal singl salienc map introduct simpl learn scheme prove effici detect specif broad special gener model remark good perform obtain normal replic biolog spatial competit salienc addit learn normal strategi provid perform improv model summat weight summat featur combin strategi refer baluja baluja da select attent visual monitor control robot robot autonom cannon mw cannon sc model inhibitori interact effect perceiv vision vol pp jp visual salienc monkei tk tg koch sp vlsi circuit visual neural inform process system mi pp koch koch select visual underli neural human koch model visual attent rapid scene ieee transact pattern analysi machin intellig gil mechan dynam static scene optic architectur attent ba ch anderson ch dc van neurobiolog model visual attent invari pattern recognit base dynam rout attent theori cognit jk sm davi visual attent select artifici jm search model visual bulletin
IR/1162 5 collabor filter person agent recommend ben joseph al jon john riedl abstract inform filter agent collabor filter attempt allevi inform overload identifi item user find worthwhil inform filter analysi item content develop person user interest profil collabor filter identif user similar tast opinion recommend item techniqu advantag limit suggest benefici combin paper show cf framework combin person agent opinion commun user produc recommend agent user produc show cf creat person combin set agent produc result individu agent combin mechan kei implic result user avoid select cf framework select introduct recommend system individu commun address challeng inform overload inform filter recommend syntact semant content item determin interest user collabor filter recommend opinion user predict item user commun domain movi content filter recommend base movi genr steven collabor copyright american associ artifici intellig reserv grouplen research project depart comput scienc engin minnesota mn complet unawar genr group peopl recommend suggest avoid examin collabor person inform filter mechan combin produc recommend system section review exist approach allevi inform includ varieti collabor present model approach effect combin section present design result conclud observ implic result inform problem approach journal web movi creat piec inform compet quickli overwhelm seek assist identifi entertain item expend scarc monei time human adapt inform tune notic chang unusu abil commun collabor address larg problem develop good abil make quick judg book articl titl movi todai find easier easier produc publish content internet make easier speak larg find filter skill inadequ challeng inform sought develop recommend system peopl quickli identifi content interest project draw work creat recommend system movi film fan system dislik movi recommend movi enjoi technolog commonli address inform overload challeng technolog primarili set task question inform retriev task involv fulfil interest queri find movi direct allen inform filter task involv classifi stream content find newli movi direct steven newli movi subtitl collabor filter answer item technolog role produc effect recommend system inform retriev system focu user express queri select item match topic interest fulfil inform index collect document full text document document abstract item ir system index ir system gener optim interest topic librari croft internet search engin popular ir internet movi extens support ir queri movi ir recommend system mechan user identifi specif movi express opinion narrow scope recommend user specif request recommend newer movi time movi genr comedi combin movi inform retriev techniqu valuabl actual recommend captur inform user prefer specif queri ir paper inform filter system requir profil user prefer simplest system requir user creat profil manual limit assist exampl system filter filter softwar sort categori base notif servic request notif book album favorit author artist advanc system build profil learn user prefer wide rang agent includ mae agent usenet filter lieberman letizia emploi learn techniqu recommend document base user prior action cohen ripper system classifi altern approach learn techniqu term frequenc inform filter techniqu central role recommend system techniqu build profil user prefer valuabl user encount content rate allen fan doesnt wait review decid allen person hate film quickli dismiss film techniqu import properti depend user user similar tast techniqu suffer includ requir sourc content provid serendipit agent discov allen drama appeal greatli allen fan collabor filter system build user opinion item find user opinion similar highli make predict user opinion item combin opinion individu sue jerri sue jerri hasnt system recommend titan jerri tapestri al earliest cf requir explicit user action retriev evalu automat cf system grouplen al al provid predict user effort system mae bellcor video recommend al wide sourc advic music movi number system begun observ system infer user prefer action requir user explicitli rate item al past wide rang web site begun cf recommend set domain includ groceri inform collabor filter techniqu import part recommend system kei advantag cf content item recommend map user item cf treat item user individu discov item interest simpli peopl easier provid good recommend attribut greatest interest user unknown hidden movi viewer actor genr movi make feel funni cf depend human rate drawback cf system work user evalu item recommend user time evalu refer sparsiti troubl user seek obscur movi rate advic movi chanc evalu hybrid recommend system system combin inform filter collabor filter techniqu effort overcom limit fab shoham maintain user profil interest web page inform filter collabor filter techniqu identifi profil similar tast recommend document user profil cohen train ripper machin learn system combin content data train data effort produc recommend research work collabor filter techniqu profil request predict director actor inform specif dual system profil cf system produc recommend earlier al show simpl consist rate assess qualiti spell usenet valuabl particip collabor filter commun show robot particip member collabor filter system user provid rate recommend made user cf framework notic low prefer correl individu agent make rate work extend concept kei wai intellig set includ learn agent person individu user appli work small includ cf serv singl human user evalu simultan multipl explor combin mechan altern cf demonstr cf framework integr agent combin agent human design systemat explor collabor inform combin techniqu creat effect person recommend system kei model shown figur pure collabor filter opinion commun member singl person machin learn syntact filter combin combin multipl agent commun member opinion design tier implement evalu find model filter compar implement user opinion collect user collect agent agent user combin multipl agent figur model recommend system model top user opinion model bottom agent model multipl agent left agent user receiv person recommend model implement primari opinion commun user provid recommend singl person agent person combin agent recommend singl person agent opinion commun user recommend person combin agent person combin agent commun opinion recommend agent user opinion context test anonym commun movi fan combin small size content disadvantag collabor filter inform common context collabor filter content inform filter content data set user rate experi drawn system million rate user fifti user select random set user movi rate set select random replac set term train set train person inform filter agent set term correl set combin final set rate serv test set test rate target user compar recommend produc system metric recommend system research measur qualiti recommend produc coverag metric evalu number item system provid recommend coverag function system produc fewer accur recommend inaccur inform filter system provid total report coverag part analysi standard cf system statist accuraci metric evalu accuraci filter system compar numer predict valu user rate item predict rate absolut error measur perform predict engin metric includ root squar error al correl rate predict al al al experi shown metric typic track close chosen report absolut commonli easiest interpret directli accuraci metric evalu effect predict engin user select item item set metric base observ major filter binari oper view item rate scale irrelev user view item rate higher common accuraci measur weight roc sensit rate frequenc system make recommend extrem wrong point commonli defin percentag recommend recommend point weight error metric give extra weight larg error occur user strong opinion item error count doubl user consid item favorit roc sensit signal process measur make power filter system area receiv oper characterist curv curv plot sensit specif test sensit refer probabl randomli select good item accept filter specif probabl randomli select bad item reject filter point roc curv repres support filter good filter user receiv good item accept bad receiv good bad random filter accept percentag good bad item roc sensit rang perfect random roc sensit support accuraci measur determin item user map good bad experi shown reflect user behavior found user movi rate elimin user statist compil experi evalu face multipl metric challeng consid import statist accuraci evalu recommend system provid incompar compar altern recommend altern domin improv metric differ statist assess absolut error test pair error differ report base level statist assess roc sensit experi assert smaller differ compon base model recommend user opinion individu combin combin agent user opinion describ varieti implement model overview construct implement effect implement report result section user opinion extens research perform problem gener recommend set user opinion nearestneighbor collabor filter gener accept effect mechan perform research collabor filter engin develop grouplen research project explor collabor filter algorithm control paramet trade accuraci set prefer maximum coverag data perform cf result set comput user load correl data set rate load test set rate request predict test set statist measur compar roc curv measur found compar area curv statist movi user control ignor user rate make predict user result predict user compar user rate produc error roc statist individu agent type creat studi set bot person bot creat profil user prefer gener predict techniqu modifi bucklei base content featur movi creat cast descript data found internet movi implement describ keyword produc person recommend keyword creat idf vector repres rel scarciti keyword movi set creat term frequenc vector movi indic keyword occur build user profil weight term produc score movi base user weight rank order movi divid recommend band idf vector creat formula idf log total number movi number movi keyword modifi tradit tfidf count keyword occur occur movi tf vector movi produc insert keyword build user profil requir balanc set user subtract rate transform scale movi train produc keyword prefer vector product transform movi tf idf vector normal keyword prefer vector length user keyword prefer vector user profil produc rate movi comput dot product user profil vector tf vector score rank broken rate level distribut match rate distribut top movi receiv rate rate bottom user separ user profil vector set tf idf vector user user creat induct logic program creat william cohen found ripper perform train set data limit genr identifi frequent keyword ripper work make binari user train ripper tune distinguish instanc train train set identifi keyword movi instanc classifi entir set movi sum number ripper instanc higher ad creat recommend ripper requir substanti experi paramet reli advic hirsh adjust default set neg test set attribut experi vari loss ratio found loss ration give result consist simpl bot rate movi movi match bot genr toi anim comedi receiv remain bot genr data obtain imdb creat user linear regress train bot train set rate treat depend variabl individu regress coeffici form equat gener predict movi genr identifi combin agent identifi strategi combin select agent averag agent regress creat person cf creat person combin found valuabl creat ad refer agent user select test bot correl data set select bot lowest mae rate gener bot test data set produc statist evalu agent averag averag combin produc arithmet agent regress linear regress produc combin user predict correl set agent independ variabl rate depend variabl result gener predict movi test set creat linear combin agent recommend cf combin cf engin creat cf combin agent load rate agent user rate correl set gener predict user test movi rate clear user paramet simpl cf case combin user agent user rate cf agent prove effect combin cf combin agent user method ident cf combin agent load rate user clear user result collabor filter singl agent collabor filter opinion commun provid result individu agent compar identifi individu agent evalu individu person tabl cast keyword domin agent highest accuraci low roc sensit combin bot method mae roc bot method mae roc cast comb cf user tabl individu bot cf user highest roc low accuraci accuraci compar result collabor filter user opinion collabor filter significantli accur meaningfulli higher roc sensit avoid make larg perform random peopl find good movi avoid bad accuraci reject collabor filter significantli accur combin compar roc sensit approach provid compar support averag accur accept slightli collabor filter user opinion mae differ statist good pragmat substitut collabor filter small commun collabor filter result provid coverag desir recommend made due lack rate reject accur altern exist compar accur valuabl altern exist problem reduc coverag agent combin agent yield result singl person agent test found singl accuraci combo support competit valu tabl compar valu obtain method combin agent agent collabor filter singl user manual select bot method mae roc agent regress agent regress agent avg agent avg bot bot method mae roc dg combo bot cf bot cf bt tabl individu bot combin bot collabor filter agent combin accuraci advantag combin similar roc valu mae roc advantag combo remain interest comparison conclud differ roc dramat accept observ depend collabor filter combin method close domin accuraci cf user combin agent clear reject tabl summar recogn collabor filter group user accur valuabl bot method mae roc cf tabl cf user combin bot agent user combin opinion commun user person agent user provid user result user agent found collabor filter singl user agent accuraci support method test tabl show statist improv accuraci result includ user collabor filter mix roc amount bot method mae roc cf bt accept find mix collabor filter solut user agent provid result discuss bot method mae roc cf bt bot method mae roc cf bt tabl cf user bot combin bot import result found combin agent cf combin agent user cf result suggest effect mechan produc recommend throw data cf engin sort inform user import invent simpli invent collect point experi test qualiti result recommend perform econom system current cf recommend engin effici handl rate item frequent advantag learn engin redesign accommod dynam rate habit examin cf engin design effici find cf outperform linear regress combin mechan agent linear regress provid optim linear cf mechan job avoid overfit data number column approach number row cf advantag function incomplet data suggest retain combin tool human agent rate item result wed sought explain overestim collabor filter small commun user expect built posit experi start cf system small group research friend success due part close ti movi similar tast real user result real explain futur work incorpor larger user set experi consist shown mae valu rang roc sensit valu commun thousand explicitli commun smaller homogen commun greater benefit collabor filter result achiev ripper impress extens close random distinguish good bad movi uncertain perform work understand behav train perform differ plan examin combin user agent recommend system interest develop combin commun larg number user agent question hope answer user benefit opinion train agent acknowledg fund research provid nation scienc foundat grant ii ii support provid net percept member grouplen research develop initi testb refer collabor recommend commun acm basu hirsh ww social inform recommend press bw inform filter inform side commun acm concept featur intellig email agent intern confer autonom empir analysi predict algorithm collabor filter fourteenth confer uncertainti artifici wi ww learn rule classifi aaai spring symposium machin learn inform aaai press ww fast effect rule induct twelfth intern confer machin lake press bm collabor filter weav inform tapestri commun acm recommend evalu choic virtual commun acm acm collabor filter usenet commun acm autonom interfac agent acm chi agent reduc work inform overload read year kauffman open architectur collabor filter netnew confer comput support collabor acm term weight approach automat text technic dept comput cornel univ filter agent improv predict qualiti grouplen research collabor filter system cscw acm social inform algorithm autom acm chi acm ja measur accuraci diagnost system scienc system share recommend commun acm
Agents/1163 1 nonverb plan de catherin pelachaud poggi bari rome rome depart informat depart comput depart linguist intellig interfac system scienc introduct design agent commun time speech express face engag interact commun act visual modal acoust multimod signal work commun act perform bodi hand gaze facial express import step defin commun act express sequenti verbal nonverb messag make autonom agent capabl commun express relev problem account agent plan combin synchron depend factor modal cognit product process signal describ gestur express express signal commun specif mean emot told facial express appropri signal social situat insult word easili constraint occur lead redund inform convei import bring verbal nonverb signal time multimod system system integr verbal nonverb signal deictic gaze commun facial express cassel stone design multimod manag role distribut behavior channel bodi system close context place paper describ enrich gener explain set rule ad review type gaze commun act final present variabl defin context modifi comput displai commun act gener order achiev develop gener architectur shown figur architectur inspir classic nlg system differ due content level independ resourc includ emot person factor plan start commun hierarch planner build pool plan oper constraint domain mental state sender result plan hierarchi goal subgoal repres primit commun act node tree bring inform commun role node plai rhetor relat attach rr relat depart focu media plan suitabl translat written text speech level plan oper trigger rule regul rule planner priorit enrich plan surfac realiz bodi instanti face charact written text figur system architectur commun goal domain kb context model referenti content present inform emot cognit express commun user miss nonverb commun act emot cognit inform pass nonverb commun previou work drawn semant typolog type inform principl convei commun focu gaze express type inform convei verbal behavior gestur facial shown gaze make refer concret abstract entiti present physic context mention deictic mention concret metaphor properti express emot perform inform express metacognit inform final rhetor relat focu rr subset inform convei talk gener text enrich type inform priorit associ verbal inform combin express instanc eyebrow gestur select express shown base displai task notion introduc modul plan enrich node inform type signal emploi stage combin synchron verbal commun priorit enrich origin appli set trigger regul rule set emploi fire base inform domain context emploi decid displai signal intens left part trigger rule domain context depend part establish kind signal convei trigger mechan built basi theori clore collin elliott gener structur type rule ag condit context signal repres type trigger signal feel deictic refer ag agent convei signal object signal node plan correspond commun goal focu trigger rule appli deal context express emot state depend influenc emot mention process govern account factor person social relationship contextu inform relev displai goal express emot social situat public model sender includ cognit capac understand capac share emot ii problem solv capac show sad give good iii experi felt similar practic resourc reason show love friend displai includ typic goal show sad selfish import ii typic emot show happi show afraid social relationship role power relationship show show angri ii social attitud aggress show angri child cut preciou suit make context determin displai displai fear show afraid person worri displai fear portion enrich plan figur enrich plan enrich plan end enrich plan input surfac realiz type select anim defin present figur show gener illustr result planner enrich plan transform annot structur present commun goal sender describ stai domain knowledg base distress describ stai sender inform stai long stai time rememb distress stai long order maintain independ distribut result enrich plan annot languag media instanti repres long period gaze type refer gaze semant topolog paper approach gener verbal nonverb behavior embodi agent gener context context gather inform situat model social relationship sender claim context build person individu agent robot repetit behavior refer mueller integr reactiv script behavior present agent intern confer autonom page yan embodi rea page ni stone anim gener facial gestur spoken inton multipl agent comput graphic annual confer page acm cassel stone live hand mouth psycholog theori speech gestur interact dialogu system fall symposium psycholog model commun collabor cook design issu situat charact workshop embodi octob de de dc evalu hypermedia gener european workshop natur languag de de dc gilli gener explan drug prescript artifici intellig ekman emot human face cambridg elliott affect process model emot multiag system phd northwestern institut learn technic report elliott variabl influenc intens simul affect state aaai technic report spring symposium reason mental formal theori page stanford march aaai bj grosz cl sidner structur comput poggi benoit septemb wc thompson rhetor structur theori text analysi technic report isi collin cognit structur emot cambridg poggi mind marker intern pragmat mexico juli poggi pelachaud facial perform system prevost sullivan embodi charact de rosi ey commun synthet agent special issu behavior plan charact avatar ai rickel wl johnson anim agent procedur train virtual motor control appli artifici
Agents/1164 1 approach simul soccer agent robocup competit hu depart comput essex colchest unit kingdom abstract meet time requir set robocup soccer server paper approach simul soccer agent robocup competit higher level agent work distinct act tradit singl thread thread break phase implement concurr detail parallel implement significantli improv agent perform implement result show approach outperform term scalabl approach effici system introduct creation robot robot world cup initi attempt foster ai intellig robot research provid standard problem wide rang technolog integr examin al field cover includ strategi realtim plan sensor strateg intellig robot machin learn natur robocup time soccer agent significantli import soccer server oper cycl execut action cycl provid visual sensori data addit auditori sensori data receiv complet random interv vital agent bound time action gener agent stai idl cycl enemi agent act gain advantag action gener server execut chosen result solut addit constraint unix system perform time resolut system system time output produc system respond stimuli environ fix time limit true robocup simul agent react interv achiev perform agent desir behaviour logic correct result agent requir logic time correct broad categori hard agent soft agent hard realtim time correct critic import sacrif gain time correct soft agent import critic failur meet deadlin result catastroph consequ distinct agent base event clock time classif import implement level agent respond extern stimuli detect condit gener reaction dynam agent oper accord clock time shown independ clock clock treat signal gener action action select base current state environ perceiv agent paper consid robot soccer agent focu improv perform soccer agent system larg topic detail descript system found rest design issu agent architectur discuss section section illustr implement present implement section show experi result compar approach section system design agent requir robot soccer simul applic client commun server udp datagram socket server execut request client updat environ regular time interv server broadcast visual inform client depend qualiti size field face direct field server send auditori inform client random time interv process sensori client respond send action request server set primit action avoid messag congest client send request cycl messag client perform action messag send server execut produc undesir result server updat state environ serial execut request result project window shown figur import mention udp socket limit receiv buffer messag arriv udp socket queu receiv buffer full case addit messag discard client fail retriev messag rate arriv danger receiv older inform newer data back queue client creat wrong current state lead undesir effect wrong action execut term applic context agent built agent receiv data server data figur robot soccer simul process produc action basic model agent loop figur data agent receiv data updat current state environ send action server agent effici condit receiv newest sensori data arriv socket quickli data queue enabl agent recent execut action send action request server request cycl agent send request server execut randomli miss cycl slow maximum time process minimum time send receiv data frequenc messag exchang time build agent satisfi condit challeng task descript model unix agent architectur briefli review model commun udp number wai handl input output socket unix block asynchron shake complet model briefli introduc detail descript found block mode default mode socket mean request data socket return data process put sleep data arriv error occur mode avoid put process sleep data immedi kernel return error process block data request stage multiplex mode achiev select poll system call method block call block actual system call select socket readabl function call copi data applic buffer mode enabl kernel notifi process signal descriptor readi read data socket process establish signal handler signal send action interv timer gener signal expir set timer handler send action server accuraci limit asynchron mode enabl kernel notifi process entir oper complet differ kernel process oper complet oper initi asynchron wide primarili support issu server agent act figur agent main loop agent architectur varieti model support model heavili depend structur agent section architectur build robocup agent present basic agent modul shown figur agent set current plai set predefin memori modul dash arrow agent server diagram repres commun link server send inform receiv agent modul agent send action back server modul solid arrow give depend relationship modul output produc modul directli depend input receiv modul rest modul agent affect modul descript modul sensor receiv visual auditori inform transmit server receiv data agent creat current state environ due limit field agent updat part environ cycl inform arriv inform pass memori hold probabilist environ behaviour import modul agent gener action current state environ state environ determin modul agent actuat agent gather inform modul action includ data agent posit role current posit ball current plai mode modul process inform determin action actuat send action server mention earlier server accept action actuat receiv action set send server plai mode hold updat current plai mode inform receiv modul current plai mode directli affect behaviour agent agent expect act differ free kick won team opposit won corner kick paramet hold inform set server agent paramet affect behaviour agent includ inform current role agent server paramet includ player size maximum speed memori soccer partial provid sensor goal ball object confid server actuat behaviour plai mode sensor paramet memori player pitch ball line flag goal agent memori figur block diagram soccer agent structur repres agent confid object current object confid multipli confid decai constant cycl object confid fall threshold object system implement section describ model approach robocup simul agent paper thread thread interfac standard thread implement portabl higher level design implement system thread api approach thread set properti suggest machin word program process creat process thought singl execut process addit properti address file descriptor data major implement robocup simul leagu cmunit essenti mean initi process gener execut file creat addit thread comput perform serial manner oper requir process put sleep block read data execut higher agent perform individu task receiv sensori inform server udp socket agent order produc desir action final action back server udp socket perform task singl thread agent serial process loop shown figur natur simul fact oper involv udp clear serial implement put limit agent capabl oper extrem slow agent receiv visual inform send action agent put sleep data miss number significantli agent perform multiplex wide singl thread implement multiplex multiplex capabl kernel notifi process condit readi input readi descriptor robocup agent check data readi send data server implement connect establish agent enter infinit loop call main loop select call server act figur model soccer agent determin data readi receiv data arriv agent store inform altern data readi agent send requir action server approach disadvantag firstli difficult accur time phase agent cycl agent estim time requir sensori perform produc action time correct set server oper execut time select wait multipl perform oper select return time agent enter sensori data send action server task task interrupt agent time correct select function requir system call receiv data initi select execut check data data exist socket agent call order receiv data figur present implement multiplex signal driven signal driven mode instruct kernel notifi agent gener signal descriptor implement signal driven signal gener data arriv server udp socket gener interv timer expir action signal driven handl signal time establish signal handler multipl signal signal handler execut point signal gener signal handler precaut avoid signal loss resolv problem mask addit signal enter signal handler handler finish great care mask signal signal handler datagram arriv udp signal gener time signal signal handler system observ signal forc agent read datagram remain queue gener problem architectur unabl number gener match datagram udp queue solut poll queue empti consum valuabl time perform comput implement signal driven figur call select check descriptor readi descriptor receiv data server descriptor send action server figur multiplex approach process multipl share address space perform oper independ affect architectur agent separ thread task model figur insid main task run concurr parallel multiprocessor delai oper thread wait data thread time send action relationship dash agent dedic maximum amount process power thread firstli model simpler separ execut thread input output thread block connect thread dedic receiv wast process time queri socket data block connect call put thread sleep data arriv socket put thread sleep affect execut thread proce normal data arriv thread execut call receiv datagram data approach datagram queue happen server transfer data faster thread imposs thread send action server interv dedic thread perform accuraci time limit resolut oper system clock function condit variabl implement thread current absolut time increment thread wait condit variabl return assum spuriou signal handler block receiv data server unblock signal handler block send action server unblock agent instal handler set interv timer start process kernel gener signal process execut signal handler event occur execut handler data arriv execut handler execut handler program return signal gener figur pseudo code signal driven server act figur model soccer agent thread signal condit return case thread send action server method highli accur time compar approach earlier enabl agent level time approach fail addit thread put sleep wait condit variabl return thread maximum amount resourc thirdli thread stai perman consum major resourc perform comput part thread current implement found schedul polici prioriti thread implement natur schedul addit separ thread implement requir program larg topic describ issu thread compet occur fall scope paper detail descript program found implement multithread approach shown figur altern approach base organ program languag found result analysi result compar model simpl experi carri pc intel pentium ii run redhat linux experi evalu time correct model logic correct base individu ai implement test requir agent connect server send turn command cycl addit agent requir receiv sensori inform simul real game situat sensori analysi function ident implement singl agent test field experi carri agent examin happen comput resourc result cycl test game illustr tabl tabl entri number cycl agent fail send action meet time requir ad agent similar effect extend process case system resourc deplet ad comput test scalabl implement term number oper cycl multiplex select cycl loss agent multiplex highli scalabl percentag agent hand signal driven perform significantli singl agent trial cycl loss approach scalabl loss agent cycl loss eleven agent result gener cycl loss trial prove superior approach term perform scalabl notic cycl loss multiplex signal driven approach agent agent agent tabl perform test thread implement effici hardwar parallel techniqu significantli import obtain perform highli complic system aerospac control system advanc industri discuss analysi compar approach easi point approach briefli present main advantag approach includ model effici exploit agent natur concurr comput perform wait slow oper complet agent advantag number oper game modular program model express relationship independ event agent design approach illustr program depend requir modul agent mix process intens process result resourc system note implement make agent benefit agent achiev perform environ approach highli scalabl current consecut action implement thread perform search separ thread execut simpl reactiv behaviour combin result agent significantli improv perform program limit multithread model complic singl thread care design requir track synchron protocol program invari avoid prioriti standard provid interfac object orient languag solut exist found shown paper behaviour agent found logic correct action time correct equal import factor applic time significantli affect result case qualiti result function logic correct output time satisfi time constraint implement suffic due low speed network limit serial natur architectur implement order overcom problem base agent perform start process thread main execut thread creat thread current server data thread put sleep data arriv thread wake receiv data wait thread put sleep pass action agent figur pseudo code approach comput concurr parallel avoid wait slow oper complet agent time correct limit resolut oper system result shown multithread model outperform term effici acknowledg comment system essex research promot fund refer burn system program program humboldt practic robot soccer world cup kitano pp hu parallel process architectur control intellig mobil intern journal robot autonom vol pp distribut control mobil intern journal intellig autom soft vol pp robot world cup initi intern confer autonom agent marina del acm robocup synthet agent intern joint confer artifici reinforc learn cooper simul proc octob realtim prentic soccer simul robocup special session agent program robocup pp juli wr unix network network socket stone veloso champion simul robot soccer world cup asada kitano springer pointer class member usenix pp parallel process aerospac control intern confer applic juli
IR/1165 5 softwar agent support evolut distribut workflow model ing wang norwegian scienc technolog norwai abstract paper outlin design softwar agent combin exist process centr environ deal evolut fragment workflow model process centr environ process fragment workflow model locat workspac geograph distribut process fragment chang independ local workspac consist problem softwar mobil offer awar servic solv conflict updat process fragment solut illustr scenario process centr softwar workflow model workflow model fragment introduct deal evolut workflow process trivial matter simpl solut problem workflow chang hard follow process chang process imposs model correct advanc process centr environ workflow tool workflow model distribut smaller part call process individu chang local user opportun local make workflow model closer real process freedom problem workflow model consist typic process order activ ad remov merg chang content realloc activ nguyen al present result studi process develop project norwegian bank softwar process late project deliveri bad resourc cost estim typic reason chang develop process custom postpon custom request unexpect postpon start forward adjust entir project custom delai custom delai deliv document schedul activ forthcom depend activ custom misunderstand custom misunderstand ignor import detail initi requir specif backward adjust rework complet activ custom custom issu requir due insight problem domain forward adjust introduc addit activ incorpor featur present work cooper support improv configur manag system deal consist problem chang document problem similar deal consist workflow complic matter workflow model defin peopl work peopl cooper workflow model affect peopl aspect relev document consist focu work maintain consist workflow process system transact support system describ long transact save intermedi softwar process access intermedi result violat correct criterion transact intermedi result manag consist unstabl work research area motiv overcom limit standard acid model requir transact model defin applic cooper author design manufactur softwar engin workflow busi advanc transact oper exchang workspac stead exchang data process centr environ project call cooper agent global inform space start main goal project distribut work support outcom implement process centr environ prototyp give process support cooper softwar engin process consist main workflow system support distribut mobil process workflow system model repeat workflow system offer workflow system workflow model distribut process fragment workspac benefit instanc workflow model distribut fragment possibl adapt workflow local condit workflow instanc defin locat local chang time abil move workflow instanc realloc deal except activ deleg work detail process model languag workflow system defin process set activ relationship xml syntax activ set identifi activ execut identifi activ execut activ activ written process distribut workspac activ definit specifi code part code part simpli simpl present start term process fragment group activ part process process fragment workspac list refer activ softwar agent support cooper process workflow system care repeat softwar agent support cooper dynam process softwar agent typic care activ negoti activ resourc coordin artifact workflow element mark support perceiv agent act buyer seller architectur consist main agent agent set achiev modest reactiv proactiv identifi main type work agent assist local product interact agent assist cooper work system agent give system support agent interact agent system work agent stationari workspac workspac temporari relev data suitabl format access tool tool share file store repositori check workspac agent meet place amp agent meet interact amp provid agent support effici interag commun type amp amp defin agent follow perceiv special amp inform sell bui servic repositori repositori persist storag data experi base specif type repositori architectur support commun memori detail descript architectur found glue server workflow glue server facilit mean workflow system system interact glue model defin relationship workflow element softwar agent glue server provid workflow activ trigger agent vice versa inform glue server found workspac ¢ workflow tool workflow model move agent agent move agent agent interact amp £ glue model agent move agent move agent move agent global repositori workspac ¢ workflow tool workflow model figur process centr environ figur show simplifi illustr compon interact figur run workflow tool local workflow model workflow tool local workflow model workspac relationship figur illustr wai softwar agent interact workspac agent interact directli user graphic user interfac configur interact agent user interact softwar agent directli interact softwar agent glue server workflow tool workflow tool activ agent activ workflow tool figur show agent access workspac access file repositori directli shown explicitli problem scenario current version restrict user evolv workflow model enact mean user principl chang definit workflow process workspac definit workflow model xml instanc workflow simpli chang workflow model workflow model consist process fragment updat distribut separ mean workflow model distribut workspac process process fragment chang local give freedom user workflow system adopt local process daili typic local adopt add order activ chang code activ activ close make estim local put restrict hard ensur consist workflow model instanc activ problem activ workspac link activ multipl instanc activ chang differ hard version correct manag project project project project project project project project project project figur hierarchi scenario rest section scenario identifi workflow access polici shown figur execut research simpl structur consist project manag project project project member project note shape creat make easier illustr scenario scenario manag project member project experi parallel mean manag distribut process ment project manag project project project happi workflow definit make version version project manag distribut version experi respect project member project member project happi process fragment creat version chaotic situat version copi process fragment result experi execut hard correct version activ project member depend activ project workspac corrupt workflow model scenario updat process fragment scenario section manag time process fragment updat workspac time project manag make process fragment instanc project make process manag give permit chang project process fragment chang workspac time scenario chaotic problem solv scenario process fragment experi chang execut project scenario updat relat process fragment project member project part experi mean process fragment project member execut project member activ depend project activ process fragment consist process fragment interrel workspac chang group process fragment project manag manag make typic depend process fragment preorder relationship activ problem occur project make process fragment project version process fragment version similar scenario access manag execut experi defin process fragment process fragment distribut project project manag execut process fragment workflow system project process fragment chang adopt distribut project workspac access process fragment time mean workspac read updat process fragment simultan cooper protocol ensur consist process put limit problem propag instanc process fragment scenario access project decid project member access section process fragment mean project member access process fragment simultan level project manag decid updat access section process fragment experi mean project project read access process fragment updat project decid project member process fragment section scenario illustr access polici group import restrict access polici workspac strict access polici parent workspac identifi level access polici strict access updat relat process fragment updat process fragment manag top decid access specif process rest problem work manner part chang access higher lower level awar agent deal workflow evolut scenario section identifi access polici support consist problem strict access polici address solv solv consist workspac manag care version process access restrict awar servic figur design workspac manag illustr workspac process fragment awar check awar check awar check ¤ workspac manag check repositori figur illustr workspac manag figur show workspac manag interact repositori workspac workflow templat model model workspac nest transact support workspac manag repositori process fragment move manag workspac manag awar support deal consist problem suggest softwar agent provid awar resolv model consist problem rest section describ support scenario section support workspac manag softwar agent support scenario scenario access restrict process fragment workspac read chang process fragment workspac manag support nest consist obtain solv consist problem level workspac hierarchi time workspac check process fragment workspac check fragment check conflict workspac workspac manag activ awar servic send negoti agent respect workspac negoti agent notifi user workspac access offer option solv actor updat process initi negoti access updat process fragment involv parti kind solut initi coordin user make visibl involv actor negoti agent solv situat support merg tool identifi conflict part defin process fragment mean workspac updat process fragment independ process fragment check back repositori workspac merg separ version fragment creat situat care made process fragment workspac situat dealt solut shown involv workspac give updat access process workspac made process fragment visibl vice versa support scenario scenario workspac chang specif process fragment time deal process fragment propag rest process fragment workspac check process fragment notifi workspac manag activ updat agent notifi involv workspac process fragment version process fragment polici recent version process user workspac forc updat process fragment updat agent choic updat ignor updat involv workspac process fragment updat mean process fragment propag similar project start updat user updat process fragment mean version process fragment consist problem forc updat recent version process fragment support solv problem om propag updat version process fragment workspac older version process fragment solut basic section process fragment updat ensur consist polici involv process fragment negoti agent decid updat cancel involv process fragment updat support person access read process fragment consist problem occur biggest problem approach process fragment total lock time user workspac check process fragment check workspac manag send notif agent notif agent give inform check process check notif agent trigger check long process fragment lock notif agent user access process fragment agent repres believ finish job support happen access polici central result scenario consist forc workspac strict access polici parent workspac level strict list section level workspac hierarchi decid strict access adher chang base democrat workspac manag alert chang access activ vote involv workspac chang strict access polici base result access polici chang democrat principl peopl forc chang access polici case chang involv parti notifi notif agent readi chang access polici ensur involv parti adopt access polici process fragment readi chang level workspac strict access affect workspac higher level negoti process initi agreement strict access polici democrat vote agent reach agreement strictli hierarch manag top make make chang access polici access polici affect workspac notifi notif wait peopl adapt polici peopl work updat process fragment strict manner implement awar agent identifi type agent provid awar support workflow consist agent negoti coordin updat notif vote agent agent commun agent meet place kqml commun defin perform unregist regist unregist perform regist amp offer java api program agent api method move agent amp commun clone agent graphic user interfac agent support java swing architectur offer graphic user interfac manag agent administr amp paper softwar agent provid awar support solv consist problem distribut workflow model identifi function agent provid program simpl prototyp fulli integr workspac manag approach extens test test base industri involv model implement awar agent futur research give detail experi softwar agent provid workflow model consist acknowledg give comment give advic paper refer support integr interact agent technic norwegian scienc technolog march technic dept comput inform scienc claud transact model support cooper softwar develop coordin european softwar engin page lnc ander aa dia ii distribut intellig agent system ii technic norwegian scienc technolog januari technic dept comput inform scienc ing total softwar process model evolut project cooper agent global inform space webpag juli ander aa dia distribut intellig agent system technic norwegian scienc technolog april technic dept comput inform rolf de wolfgang kla transact manag support cooper applic kluwer academ ing wang experi xml implement workflow tool annual iast intern confer softwar engin octob ing wang support mobil softwar process seventh european workshop softwar process februari ing liu integr workflow interact agent support cooper softwar engin submit softwar engin ing improv cooper support cm system volker proc sept page septemb ing architectur cooper softwar engin proc eleventh intern confer softwar engin knowledg engin page june
HCI/1166 4 support comput framework coach depart comput scienc british columbia main mall bc canada kurt vanlehn learn research develop center pittsburgh hara street present comput framework design improv learn exampl support process clarifi make complet oneself solut framework innov wai repres attempt provid comput support studi problem solv explicitli coach skill studi cognit scienc shown greatli improv learn framework includ solut main design interfac effect monitor support student model assess understand read effect elicit improv understand describ solut implement comput tutor coach tutor system physic present result formal studi evalu usabl effect system discuss explain obtain base analysi data collect studi introduct research intellig tutor system increasingli affect educ year remain confin research todai start move show effect learn influenc structur tradit exist target limit part learn process gener focu teach problem solv domain specif cognit skill goal research explor innov wai comput enhanc educ cover learn phase student acquir domain independ learn skill describ step comput framework design support learn exampl metacognit skill gener explan oneself clarifi work solut effect learn exampl import student heavili reli exampl learn skill al pirolli anderson dixon vanlehn benefit learn exampl strongli depend student studi studi cognit scienc show student spontan studi exampl learn pirolli effect explan provid trigger construct learn requir student bring bear activ elabor exist student initi address specif problem understand extern explan tailor individu studi show student spontan student start guid prompt result suggest greatli benefici integr support problem solv individu guidanc learn exampl provid comput tutor monitor student studi exampl elicit improv understand task appar entail addit challeng tradit user interfac student model provid adequ user interfac design previou studi consist read speak interfac monitor attent construct gener technolog natur languag process power reliabl readili usabl student model model student studi requir assess student understand learn perform assess reli action read larg ambigu direct correspond understand problem solv action problem provid adequ benefit fact spontan select gener target specif learn comput tutor decid benefici student spontan tutor elicit student natur reluct framework support se includ solut problem solut ground exist salient featur make effect learn result process iter design framework implement test tutor system physic support student studi problem solv make student part solut challeng figur show reflect structur exampl present physic textbook paper structur discuss relat describ cognit scienc find provid theoret justif design illustr architectur knowledg underli describ interfac monitor attent structur prompt scaffold give overview student base probabilist reason framework bayesian network illustr model elicit improv understand discuss result formal studi perform evalu usabl effect learn relat work figur sampl compon explan enhanc learn promin research topic commun work subject enabl comput tutor gener explan facilit learn research start investig comput tool support learn facilit exchang explan peer aim trigger learn bring student gener activ explan target instruct instruct learn collabor peer work present paper student gener learn explan peer stimul valid process support import learn peer main pedagog differ gener explan learner target specif problem understand concentr unclear learner worri phrase explan concentr explan content differ impli explain simpli contribut make learn stage improv gener learn abil tutor system reli exampl instruct mean system exampl support student solv specif learn phase prior complementari problem solv student access relev exampl solv lisp program problem provid explan relev problem solut expert solut troubleshoot student compar solut solut end problem solv task student build legal argument gener relev case reifi connect content case argument exampl instruct system encourag student view monitor student studi understand system gener elabor present exampl geometri tutor move step closer coach explicitli encourag student term geometri problem solv step build geometri proof main differ explan gener problem solv explan geometri tutor consist simpli select list geometri axiom student explain axiom tutor make student explain solut step account knowledg previou interact system evalu explan benefici student principl underli design increment support framework design provid increment support level prompt interfac design tutori level aim student capabl maintain construct natur learn activ argument give student initi enabl student question repair understand wai student learn situat student good skill repair understand teacher teacher gener problem argument call interfac leav initi student argument give initi coach studi show student varieti reason student good studi chi tend overestim understand exampl initi improv student unabl domain knowledg gener exampl complex student awar gener repair gap student spontan engag gener kind explan learn explan relat step solut goal underli solut plan gener learn highli transfer knowledg pirolli spontan tend gener level prompt scaffold design accommod vari capabl student provid student minimum suffici trigger construct effect focu correct framework includ capabl provid feedback correct issu feedback provid controversi experi statement inform present work solut classifi correct experi human tutor guid elicit addit clarif student incomplet give feedback correct chi problem solv lead research argu process correct elicit learn chi argu incorrect benefici creat flaw knowledg flaw contradict element trigger fix flaw gener learn argument appli student monitor understand student minor student seldom detect inconsist gener incorrect feedback correct protect student learn wrong knowledg incorrect simpli make student detect conflict sooner incorrect incomplet improv student gener correct extend benefit focu explan order provid feedback intern correct gener encod explan ultim instructor easili extend set exampl identifi literatur type automat comput rule base underli domain knowledg type justifi solut step term domain relat solut step goal abstract plan underli solut shown highli correl learn common instruct domain investig experi physiolog human label involv relat step target domain involv common knowledg base plai import role learn exampl chi support requir natur languag interfac complex domain student model explicitli guid base prevent student gener spontan principl design interfac tool support identifi kind understand interfac student gener natur languag input tool student gener natur construct form spontan identifi form highli expand refin precondit solut step explic infer addit consequ step design tool scaffold form tool student justifi solut step describ domain rule step term precondit verifi appli result rule applic gener descript term precondit consequ reflect domain system provid feedback correct base student model guid interfac scaffold tool meant encourag student spontan framework support provid stronger student recept interfac scaffold provid stronger scaffold make student interfac tool part strategi possibl work student end suggest redund neg influenc motiv trust reduc likelihood student follow suggest import gener tutori student perceiv relev learn student model design assess student spontan interfac order avoid burden student request gener assess gener interfac tool assess detect gap understand elicit fill student natur architectur author environ graphic author interfac physic plan rule statement problem solver descript model correct se interfac modul figur architectur long term student model assessor student model mention implement tutor system physic figur show architectur prior run time side figur author creat graphic descript code definit statement problem solver definit set physic plan rule repres domain knowledg automat gener model correct solut model depend network encod explan term intermedi goal fact solut deriv physic plan rule student interfac interact studi exampl gener interfac send explan match element model feedback explan correct incorrect interfac action assessor updat student model student model bayesian network integr inform model correct domain knowledg long term student assess understand refer student model make elicit student model correct model correct model core structur model encod knowledg provid feedback student model assess reflect understand guid tutori problem solver automat gener se model ad start rule code definit problem statement figur goal select bodi law problem goal find forc object select bodi object forc appli problem goal find forc set goal newton law solv problem goal law set goal select bodi appli law figur sampl rule knowledg base rule base cascad cognit model learn physic exampl rule develop collabor physic professor naval domain expert project rule repres qualit quantit physic knowledg suffici solv physic problem figur top sampl physic repres plan knowledg encod abstract plan step expert solv problem figur center bottom sampl plan problem solver produc hierarch depend network encod qualit result equat deriv physic abstract plan underli solut gener se problem solver start set fact describ initi goal statement identifi sought quantiti initi set fact problem solver begin appli rule knowledg gener fact find unknown quantiti comput sought quantiti segment se model shown figur relat figur problem solver start goal find forc figur appli rule figur form newton law find desir forc figur appli rule figur gener level goal plan appli newton law problem solv outcom partial order network goal intermedi result lead goal set equat suffici solv sought magnitud forc figur show section se model applic rule select bodi appli law rule identifi exist tension forc find forc exert solv bodi tension forc ra rule proposit rule applic ra ra ra bodi ra ra figur segment se model partial solut left element solut graphic correspond fact goal node se model node label prefix figur se model proposit node correspond element leav detail solut deriv shade proposit node figur correspond step explicitli express solut shown left figur link depend network encod proposit node deriv physic plan rule label prefix figur proposit node match precondit deriv proposit node rule proposit explicitli encod network node prefix figur deriv correspond explan coach solut step justifi term physic principl goal solut step accomplish plan underli solut depend network model correct evalu explan decid explan improv understand model similar natur domain model intellig tutor system support student problem solv model explicitli distinguish rule encod domain knowledg rule encod plan explicitli repres applic rule node depend network model suitabl repres monitor gener coach section interfac discuss increment support level scaffold level interfac section fourth level provid tutori illustr section attent monitor control level scaffold interfac provid mask mechan present part cover grei inform figur student move reveal text graphic read line textual part student refer back situat diagram free bodi diagram click left button figur show figur mask student move solut line click uncov free bodi diagram figur figur present mask interfac mask interfac track student long ad item mask interfac link proposit node se model link attach inform student attent directli compon se model inform paramet se coach assess student session map interfac item se model node item encod fact goal free bodi diagram object label uncov line figur map part call explan avoid elicit redund explan student mask interfac simpl obtain inform complex ey track devic afraid unusu present exampl read understand perform pilot evalu mask interfac earli stage system design verifi usabl mask evalu aim compar altern design part fade mask ten year colleg student studi mask interfac fade interfac altern interfac show avoid present bia student interfac studi student chose fade interfac mask student found interfac fairli student annoi fact part explicitli uncov student interfac studi exampl encourag focu singl item time addit track mask interfac level scaffold student strongli prefer interfac mask difficult adjust fade interfac student identifi part read content contrast monitor make imposs find set work situat continu probe attitud mask interfac success evalu confirm posit reaction interfac critic student concern line time read long algebra deriv fix modifi interfac student uncov line press control kei move line prompt level scaffold provid interfac specif prompt student piec idea worthi explan interfac append button label press button produc simpl prompt initi term domain principl choic correct abstract solut plan role choic solut plan figur prompt figur show prompt line solut figur prompt design elicit stimul effect approach counteract tendenc overestim lead student question target import possibl problemat knowledg initi action answer question prompt trigger stimul student gener type discuss unnatur extrem learn interfac tool gener level scaffold interfac consist tool provid construct control wai gener desir tool aim student unabl realiz student select choic prompt menu shown figur rule browser displai column window figur student select choic prompt plan browser displai figur subsect describ interact proce case rule browser rule browser figur physic organ tree structur similar window file click button reveal hide hierarchi familiar student find select rule justifi uncov item student press button bottom provid feedback select rule explain uncov unit inform system figur rule browser se model situat figur student activ rule browser solut line select correct rule select incorrect provid feedback retriev se model current proposit node uncov part shade proposit node figur find closest rule node ancestor proposit node node figur check correspond rule student select green rule browser select rule red cross figur provid addit feedback avoid interf consid kei factor make effect gener student elabor materi knowledg wrong rule student correct mistak hierarchi correct rule found organ rule browser crucial make search correct rule thought provok frustrat result student click exhaust entri current organ rule hierarchi result success evalu pilot reduc amount flounder observ version browser interest behavior surfac evalu student click rule randomli stuck find plausibl candid categori expand part hierarchi repeatedli chang arrang maxim chanc student immedi enter part hierarchi provid rule plausibl belong rule encod definit net belong categori student find categori describ forc figur feedback pilot evalu suggest import modif origin interfac possibl back rule browser tool origin pilot subject complain review solut order complet interfac tool current interfac tool student uncov part initi part explain turn remind student current focu rule templat figur rule templat rule browser list rule student rule explan explain student click button bottom rule browser dialog box partial definit rule blank student fill figur definit term precondit verifi rule appli consequ applic rule gener templat design reflect rule repres knowledg base discuss design aim scaffold form frequent spontan refin expand precondit action explic infer addit consequ action click blank templat bring menu filler templat figur complet student select feedback retriev definit rule knowledg base verifi correct match rule precondit consequ filler student chose figur templat interfac reflect content physic rule knowledg specif line ad set requir defin long solut involv knowledg encod rule rule pilot evalu fundament improv usabl templat discov student tend ignor templat filler correct choic list filler student seldom read item find plausibl filler earlier list pilot evalu show student choic access templat tend version system correct rule select student click button quit fill templat option student access templat rememb templat extens explain interfac begin evalu session simpl chang give templat choic rule select figur percentag student fill fact student close templat fill click cancel button bottom dialogu box figur plan browser goal select bodi appli law problem goal find forc object select bodi object forc appli goal find forc bodi bodi ti string string tension forc exert string figur verifi templat correct rule student select item prompt role choic solut plan figur interfac displai plan browser rule browser plan browser similar rule displai hierarch tree repres solut plan physic rule figur show plan browser displai plan appli law explain role uncov fact solut student navig goal hierarchi select close motiv fact press button give feedback provid retriev proposit node uncov line proposit node encod feedback algorithm work rule browser proposit node encod shade node figur feedback algorithm retriev goal node ancestor fact figur retriev rule node gener goal node figur rule repres plan verifi correct select templat plan simpli spell inform plan structur encod browser hierarchi goal appli law select subgoal describ properti bodi advic system figur select plan browser ra ra previou interfac level scaffold implicit design explicit level scaffold provid advic voluntari student free decid initi interfac limit provid feedback track progress includ time solut item chose interfac tool inform collect student assess part benefit student close gener tutori make student part briefli describ student model gener assess illustr tutori interact assess support detail inform structur function student model found student model model student studi involv great deal read action model access provid indirect evid student read learn handl uncertainti principl student model reli bayesian network framework probabilist reason student model bayesian network built automat student open figur summar process structur bayesian network deriv directli structur network paramet deriv probabl describ physic knowledg studi maintain long term student model probabl provid prior rule node paramet automat defin condit probabl network long term student model prior probabl rule studi style assessor initi updat model correct explan assessor probabl assess understand knowledg student interfac action low probabl se coach hint figur automat construct student model bayesian network student perform read initi bayesian network updat node condit probabl repres action influenc probabl student compon node repres read action directli influenc probabl student deriv se model node repres action perform interfac tool influenc probabl student physic plan rule time interact probabl bayesian network assess knowledg understand chang consequ action probabl node repres probabl student correctli deriv node probabl threshold target kei featur student model student interfac tool acknowledg student spend time view solut item student suffici knowledg model predict student item correctli student interfac tool make explan explicit accur burden student natur unnecessari possibl motiv system student close probabl rule node reach student interact system updat long term student model probabl affect subsequ studi problem solv interact student mention begin student studi voluntari student close student model line left learn item item pink color box pink grei figur grei attach item specif prompt rule rule plan depend student model predict miss item specif prompt place simpl button item uncov figur color box relat messag chang dynam student perform read action chang probabl node student model student close pink cover gener warn item student quit student figur elicit discuss challeng design tutori motiv student low pilot evalu fundament find effect modal coach origin version system point line requir indic chang color student close gener gener warn item student reject accept back studi indic specif hint student chose rule browser explain uncov line student back possibl explain line student addit suggest coach close design stimul spontan thought direct student line trigger explan line happen student natur explain time strictli individu hint rare initi addit interact coach quickli coach suggest find rule rule immedi close hint show suggest explan current line browser line student repeat cycl access piec student lost interest chose close coupl hint current base color student part interfac tool student feedback progress line color attach hint chang dynam student gener empir evalu iter improv system design pilot perform studi test usabl effect learn experi design studi conduct colleg student introductori physic class pittsburgh carnegi mellon counti commun colleg academi design student studi exampl complet student studi exampl mask interfac plan browser access rule browser receiv feedback coach evalu consist session paper pencil consist problem studi exampl law paper pencil problem ident fill questionnair design assess student impress system provid introductori physic evalu system adequ subject level domain knowledg student gener benefit exampl studi knowledg problem solv effect learn subject knowledg understand topic knowledg find exampl worthi attent coordin studi session accommod student term subject adequ knowledg make run subject class law class test topic order roughli equat time student control condit studi exampl student condit studi exampl statist differ averag time task group control group found correl time task score usabl record log file interact log data understand subject interfac tool plan browser react usag tool interfac comput data shown tabl percentag explan student initi explan gener tool exampl percentag initi explan gener correctli attempt averag number attempt student achiev correct attempt submiss incorrect max averag maximum number attempt achiev correct percentag initi abandon attempt averag number attempt abandon time averag amount time spent eventu abandon tabl statist se tool usag rule browser templat initi correct attempt correct max attempt abandon attempt abandon time abandon sec sec sec rule browser usag tabl averag student access rule browser initi rule browser explan complet rule browser explan successfulli select correct rule time found correct rule flounder requir averag attempt find correct select student rule select requir larg number attempt maximum attempt rule browser access student fail find correct rule requir averag attempt attempt result averag minut student spent fail rule browser minor fraction averag total time task data rule browser gener success stimul student initi easi situat rule browser distract student flounder substanti find correct find benefit addit form support student search rule browser suggest frequent questionnair major judg rule browser easi templat usag student access templat materi templat access mandatori correct select rule data indic effect templat stimul indic fact student complet present templat mandatori fill templat open student averag attempt fill templat averag maximum attempt student spent fill templat find correct answer data repeat effort improv templat usag pilot evalu term make easi provid tool encourag result back questionnair judg templat easi understand exampl plan browser usag student access plan browser explan student problem plan browser initi explan result select correct plan requir find step student spent averag plan browser access lead correct explan fact averag maximum attempt find plan browser produc flounder plan browser benefit analog suggest rule browser result plan browser easi student rule browser student wrote questionnair understand util outcom explan larg unfamiliar student plan browser design complement instruct initi student notion solut subject receiv instruct classroom short time instruct time make student understand concept import solut plan situat account lower usag tool elicit verifi student react explicit prompt rule plan browser read comput log data student prompt result summar tabl type tabl maximum number prompt gener exampl studi prompt system gener student model guid number prompt gener reli student prompt student number tabl show current design base dynam chang color line attach work origin design origin design student rare coupl current design student averag rule browser plan browser prompt prompt suggest read carefulli number show room student half suggest happen reason tabl statist rule browser prompt plan browser prompt read prompt student follow suggest spontan relat part student model assess spontan strongli depend estim initi physic knowledg time accur estim assign rule probabl student explain model ignor prompt redund explan reason student follow suggest overestim understand dismiss prompt justifi deal make suggest mandatori option work accur prior physic knowledg instanc result interest accur prior benefit student gener explan worth redund prompt student effect evalu effect compar student se condit learn comparison student control condit score condit held indic subject successfulli physic knowledg gain score measur differ score higher se differ gain score se control condit statist restrict analysi subgroup subject carnegi mellon commun colleg counti pittsburgh naval academi found condit cmu student perform significantli control condit pitt student control condit perform slightli student se condit common behaviour cmu school worst colleg rank confirm score characterist cmu common distinguish pitt student start semest week pitt student particip experi lectur law class test pitt student ahead schedul spent time law cmu student particip studi gener differ background knowledg subgroup affect student benefit test continu analysi compar subgroup consist cmu student subgroup includ pitt student tabl score sourc prob const subgroup condit student se condit gain score perform significantli student control condit student control condit perform slightli se condit differ statist verifi result due differ initi physic background ran depend subgroup condit main sat score covari tabl interact subgroup condit indic prior physic background knowledg account behavior subgroup verifi student subgroup system compar perform studi behavior condit figur se condit student perform differ statist control student perform significantli student matter fact perform student se condit result due se student tool extens effect student control student spontan student control se figur gain score student condit studi behavior subgroup se condit verifi student se condit tool student compar subgroup respect time task system usag statist previou subsect found statist differ averag number attempt give templat explan differ suggest student higher level motiv learn start learn law student perceiv studi topic consist find browser select templat fill recal task construct gener explan student activ reflect result action argu student motiv studi reason interfac learn se tool frequent easili student corrobor argument comput correl number rule student model reach high probabl correct se score correl low higher indic correct se action reflect knowledg accur student studi behavior subgroup control condit verifi student control condit spontan student student commun explan control version measur log file standard deviat multipl access line standard deviat time spent number access select plan browser control found margin correl score standard deviat line access tabl tabl analysi varianc case select sourc prob const correl control group hypothesi student control condit consist fact student start studi law earlier gain knowledg topic knowledg strong make student perform suffici enabl control subject gener effect minim scaffold provid mask interfac argu minim scaffold control student bring bear knowledg advanc learn spontan trigger mask interfac control student tendenc lower level motiv prevent student se condit learn effect tool summari result present suggest effect effect support studi rich scaffold provid complet improv perform earli learn stage student unfamiliar subject matter benefit structur domain knowledg gener effect motiv put substanti effort exploit student profici subject minim provid mask interfac control improv elabor scaffold requir student put effort studi lack motiv data confirm data gather context classroom easier control learn stage student system data provid valuabl insight issu prompt scaffold elicit studi shown simpl prompt elabor scaffold improv chi studi address explicit comparison kind high standard deviat student select review line gener studi paper provid specif result effect plan browser limit length studi session prevent insert item specif tap plan knowledg plan browser design improv student plan browser interfac tool understand function student wrote studi expect plan browser design stimul reason solut plan student basic understand topic subject receiv classroom instruct solut plan subject end ignor plan browser understand underli plan knowledg found correl control result percentag hint plan browser student correl initi indic plan browser fact improv evalu subject inform provid reliabl data issu futur work research present paper repres step explor innov wai comput enhanc educ learn exist support student problem solv teach domain specif skill comput framework support learn exampl coach gener learn skill gener explan justif oneself studi aim provid individu monitor guidanc proven benefici administ human tutor framework implement test tutor system student learn physic studi problem solv combin theoret foundat empir studi fundament develop effect instruct system true system focu learn process underli mechan unclear investig design ground cognit scienc find featur make effect design evolv care process iter design fundament element specif tool stimul scaffold assess probabilist student model elicit improv understand conclud discuss result formal studi test usabl effect system log data studi interfac easi interfac advic gener success stimul analysi data learn provid interest initi insight educ effect support result suggest structur scaffold benefici earli learn student profici subject simpler form prompt successfulli trigger studi confirm find perform classroom easier control student system studi contribut understand prompt scaffold effect elicit issu investig cognit scienc highli relev understand level sophist worth effort develop tutor system support framework underli gener support domain problem solv formal cognit model solut process medic gener cognit model domain labour labour intens calibr paramet probabilist student model flexibl adapt compon provid justifi result present provid initi indic learn stage plan seek evid compar version feedback understand benefit feedback learn compar version student evalu benefit target versu make student gener relev issu plan explor role mask interfac process discuss pilot subject report mask interfac bother studi exampl carefulli subject opinion provid formal evid mask interfac learn matter mask interfac learn student explor possibl monitor technolog increasingli accur plan perform studi understand type learner benefit interfac learner benefit addit scaffold provid mask dynam adapt interact mode learner type acknowledg member ander weinstein valuabl contribut design evalu system comment draft paper work support grant number offic naval cognit scienc refer teach argument model empir intellig learn environ paper present artifici intellig japan tutor foster learn understand paper present ai world confer artifici intellig le franc al cognit lesson learn journal learn paper present intern confer artifici intellig le franc train investig effect knowledg acquisit activ problemsolv cognit explan learn environ paper present intellig tutor system intern aid subgoal effect transfer journal educ dual process gener infer repair mental model advanc instruct psycholog al student studi exampl learn solv problem cognit al elicit improv understand cognit mit press comput framework support eighth world confer artifici intellig educ provid adapt support understand instruct materi paper present iui intern confer intellig user santa usa result evalu intellig comput tutor coach paper present intern confer intellig tutor canada studi physic differ studi process good poor solver cognit procedur gener hint bayesian network student nation confer artifici intellig tutor transfer technic compet wilson constructivist learn environ englewood educ technolog public al intellig tutor school big citi world confer artifici intellig educ aac gener instruct make tutor human journal artifici intellig gener instruct identifi exploit relev prior explan journal learn learn solv polynomi factor solv problem studi exampl problem intellig learn environ paper present ai world confer artifici intellig le franc probabilist reason intellig network plausibl infer san knowledg construct transfer intellig tutor role practic learn strategi transfer domain program cognit learn extend knowledg collabor problem solv attempt understand explan receiv intern journal artifici intellig understand basic wilei son learn studi individu differ cognit al learn effect variabl elicit contemporari educ adapt pittsburgh conceptu meta learn coach problem solv intern confer intellig tutor system model effect journal learn explan intellig tutor system paper present european confer research learn germani peer interact learn small group intern journal educ user model adapt navig support tutor system paper present user model autom tutor interact
Agents/1167 1 secur schedul meet thoma bart comput secur industri cryptographi dept electr engin katholiek universiteit leuven belgium gregori frank bart de decker dept comput scienc katholiek universiteit leuven belgium abstract peopl schedul agenda compar time suitabl particip peopl agenda privat paper present approach intend solv contradict protocol secur meet schedul protocol base secur distribut comput discuss secur properti complex protocol compar trust bandwidth requir shown implement protocol mobil agent mobil secur distribut meet schedul introduct negoti particip commun process inform agenda moment free attend meet due privat natur person reveal parti negoti result negoti particip particip ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process inform user agenda remain secret easi solut schedul meet broadcast schedul total neglect privaci particip agenda solut send schedul trust nding singl parti trust dicult practic exist meet schedul de ne access level view modifi agenda de ne user group access level assign comparison schedul user approach elimin manag access base user directli access agenda paper present secur solut goal particip negoti meet parti direct access parti reli parti nal inform agenda nal time meet fact meet schedul paper build work show tradeo made level negoti protocol speci implement approach paper organ section present negoti protocol section present altern approach base secur distribut comput approach analyz secur complex point view section discuss mobil agent secur meet present prototyp implement conclud sect negoti protocol data exist reduc problem decid meet schedul moment logic oper shown fig agenda repres bit string time slot bit indic negoti attend ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process size meet free free free free schedul granular tation meet figur agenda meet speci ed length start time ner granular longer negoti bit schedul model meet schedul start invit phase initi broadcast set negoti paramet meet negoti window time span attempt meet complet list broadcast repli indic accept declin negoti invit broadcast mislead set negoti encount phase call negoti time slot attempt schedul meet time slot negoti place protocol outlin meet successfulli schedul negoti move time slot independ arriv result time particip broadcast result check result coincid detect partial failur attack mislead subset negoti phase common result present user inform meet place common user con rm commit schedul time separ channel independ schedul process ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process schedul meet subsect refer agenda descript previou subsect compar negoti base compar protect form schedul schedul protect schedul perform broadcast protect form negoti process data fear form reveal binari xor oper schedul mask transform schedul perform bit preserv mask negoti retriev origin schedul broadcast data solut mask share negoti contribut build reveal negoti protocol step negoti negoti random xor schedul random mask partial mask share secret xor partial call global mask negoti partial mask global mask sole partial mask step schedul visit negoti time visit mask partial mask negoti origin schedul mask global negoti partial mask schedul rst mask owner partial mask remain secret visit negoti unabl identifi protect schedul repres perform xor origin protect schedul reveal global negoti retriev origin schedul trip schedul forward randomli negoti order make imposs trace schedul attach list negoti hasnt visit decrement order prevent multipl mask partial mask ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process note counter attempt trace schedul attack global view commun encrypt step protect schedul broadcast negoti independ time slot protect schedul impli origin schedul time slot provid clue negoti free busi time slot clue provid negoti schedul time slot negoti free mean negoti free meet schedul time slot busi gure busi free note schedul protocol form negoti authent link protocol messag origin depend meet desir form authent ad protocol figur show negoti protocol perform parti easi understand protocol schedul simul rout mask perform simultan negoti realiti process asynchron negoti idl rout random end negoti broadcast broadcast protect di erenc realiti bit process time attack meet schedul time slot protocol time slot process secur analysi protocol requir singl entiti trust complet protect privaci particip attack passiv activ adversari bad slot time slot user busi protect slot equal check origin schedul negoti avoid schedul meet slot schedul slot constitut user privaci call slot bad slot ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process step step step figur simul negoti entropi attack reason perform negoti slot time prevent attack negoti sequenc broadcast mask schedul parti recogn origin schedul test mask transform origin schedul protect form correct global mask recogn fact protect schedul bit string obtain entropi expect schedul negoti bit fresh partial mask bit stop meet schedul counter attack mask bit schedul bit maxim entropi number parti parti deduc schedul base schedul comparison protect form schedul ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process global mask straightforward origin schedul link protect form parti negoti global mask trace back schedul ve particip abil trace schedul rout number particip dummi negoti introduc arti cialli number allevi problem broadcast commun environ encrypt dummi messag make real schedul rogu negoti activ adversari attack protocol wai simpl denial servic attack mount negoti base fulli busi schedul declin invit protocol reli negoti consist partial protocol unpredict outcom negoti randomli partial mask negoti time slot negoti wait broadcast protect detect rst meet place case broadcast protect prevent meet schedul schedul time complex analyz complex schedul count messag negoti distribut environ expect send messag resourc consum mask comparison bit process bandwidth import rememb negoti protocol perform bit bit note negoti broadcast complex broadcast complex schedul start simpl broadcast invit negoti announc posit invit broadcast add complex bit visit negoti negoti bit number bit schedul round protocol end check phase negoti broadcast result fact ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process meet schedul note posit result meet broadcast result agent automat bit result neg schedul meet lc messag schedul window work granular hour particip amount particip messag secur distribut comput problem secur distribut comput problem secur distribut comput state publicli function di erent hold privat input parti comput leak inform privat input parti inform implicitli present function descript solut secur distribut comput function encod boolean secur distribut comput refer secur circuit evalu past fairli larg varieti solut trivial trust problem overview franklin recent perform gener secur distribut comput core problem perform comput hidden data secret share reveal data class techniqu comput encrypt data base homomorph probabilist encrypt encrypt techniqu probabilist encrypt di erent ciphertext encrypt kei work encrypt probabilist encrypt ciphertext encrypt encrypt ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process fairli simpl encrypt techniqu homomorph sati es equat form op op oper op op homomorph encrypt scheme oper perform encrypt suitabl secur circuit evalu franklin present protocol evalu boolean circuit data encrypt homomorph probabilist encrypt scheme order support number group orient encrypt encrypt scheme cooper particip decrypt group orient encrypt scheme franklin bit encrypt group particip ng mod mod prime mod zn public kei mod kn mod privat kei ith particip scheme addit properti comput joint encrypt xor jointli encrypt bit mod mod encrypt creat random ciphertext decrypt bit zn mod mod joint encrypt bit particip withdraw joint encrypt provid particip singl easi comput mod particip secret kei broadcast mod form public kei start actual particip broadcast joint encrypt input bit evalu simpli appli encrypt output found appli default encrypt mod encrypt scheme evalu troublesom encrypt input ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process bit comput joint encrypt proce particip random bit broadcast particip repeatedli appli calcul particip broadcast decrypt wit decrypt repeatedli appli fact prove particip comput joint encrypt chose receiv encrypt comput default encrypt valid substitut comput analog combin blind result broadcast particip combin form gate circuit particip joint encrypt output bit particip broadcast decrypt wit output bit reveal secur meet schedul show reduc problem schedul meet secret agenda seri logic oper secret bit time slot negoti secret input start meet isnt secur distribut comput protocol discuss handl binari implement oper log tree binari output bit circuit slot start time meet ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process secur analysi franklin show protocol provabl secur passiv adversari adversari follow rule learn inform commun encrypt composit modulu secur mean assumpt passiv complet privaci agenda fact time meet proof franklin give complic encrypt scheme mention altern secur encrypt scheme open problem protocol provabl secur activ adversari deviat malici particip ip output gate encrypt applic obviou attack dont give rise substanti inform leak protocol present van de provabl secur activ adversari cost higher bandwidth requir complex closer messag complex protocol public privat kei evalu mean initi invit messag wrap messag announc particip posit invit evalu singl gate consist rst broadcast messag doesnt commun gate level tree evalu evalu entir circuit dlog messag broadcast encrypt input bit circuit broadcast decrypt wit output bit messag slot evalu suitabl meet time total messag complex previou section amount messag particip messag particip ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process compar result protocol previou notic number messag size jn bit messag protocol larger messag protocol maximum messag length particip kb easili ts singl ip consid number transmit messag relev number bit strictli note account comput memori overhead protocol amount comput storag protocol higher protocol mobil agent shown mobil agent reduc commun overhead solut agenda schedul problem basic idea mobil bring agent particip closer mobil agent trust execut platform show trust requir strong classic trust parti solut meet schedul problem compar trust requir di erent simpl trust model particip trust execut site believ execut site correctli execut code execut site correctli expect handl data particip impli execut site maintain privaci data code expect particip trust denot shown fig figur notat trust compar bandwidth requir commun make simpl distinct high bandwidth requir execut discuss protocol low bandwidth suce transmit data agent code intermitt connect devic disconnect consid low bandwidth assum low bandwidth commun parti high bandwidth commun denot shown fig ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process figur notat high bandwidth connect base simpl model commun compar option implement secur meet schedul trust parti straightforward global trust parti particip send agenda comput meet time dissemin result particip data authent safe channel accomplish convent cryptograph techniqu clear approach low commun data particip receiv result comput particip trust case situat shown fig figur situat particip clear distrust particip easili singl trustworthi parti requir singl global trust execut site main disadvantag approach cryptograph secur meet schedul option cryptograph techniqu discuss previou make super trust requir particip trust execut site option clear previou section commun overhead high practic gener network environ high bandwidth ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process requir particip case situat summar shown fig figur situat particip mobil agent solut combin previou commun overhead remedi introduc execut site mobil agent particip send agent trust execut site agent copi agenda capabl run secur meet schedul protocol di erent particip send agent di erent site restrict site locat close high bandwidth commun amount long distanc commun particip send agent remot receiv result agent agent cryptograph involv high commun overhead agent execut site overhead protocol accept situat situat depict fig figur situat particip mobil agent ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process high bandwidth commun particip longer singl trust execut site current implement aglet prototyp implement secur meet schedul system protocol paper aglet sdk beta mobil agent system develop kit open sourc commun ibm sdk agent api write agent java exampl document prototyp implement line java code commun kqml queri manipul chosen kqml develop baltimor maryland enhanc secur capabl user schedul applic user agenda manag negoti perform distinct aglet negoti aglet user advantag mobil gather host carri negoti protocol local commun languag limit implement protocol commun reli transmit charact string agent implement agent platform program languag part provid platform paper shown exist techniqu secur meet schedul made level secur trust amount overhead protocol meet schedul ecient protocol requir trust parti protocol secur ecient mobil agent implement protocol improv avoid singl trust entiti ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process acknowledg work support part project concert research action fund research grant flemish institut promot industri scienti technolog research gregori neven frank postdoctor fellow refer van de comput ensur privaci parti input correct advanc lectur note comput lnc pp introduct secur lectur data lectur note comput lnc pp de van host mobil enabl secur distribut mobil agent telecommun lectur note comput lnc pp secur distribut phd comput scienc depart columbia franklin encrypt secur journal pp de meet schedul ifip commun multimedia danni mitsuru agent aglet tim jame agent secur architectur kqml agent commun ifip sec june trust inform decad challeng kluwer academ pp intern feder inform process
IR/1168 5 build effici effect metasearch engin meng clement yu liu depart comput scienc state ny depart eec illinoi il school comput telecommun inform system il abstract frequent user inform store multipl search engin inconveni ineffici ordinari user invok multipl search engin identifi document return result support unifi access multipl search metasearch engin construct metasearch engin receiv queri invok underli search engin retriev inform user metasearch engin benefit search tool search coverag web improv scalabl search survei techniqu tackl underli challeng build good metasearch engin main select problem identifi search engin return document queri document select problem determin document retriev identifi search engin result merg problem combin document return multipl search engin point problem research inform resourc distribut collect distribut inform retriev introduct web vast inform resourc recent year million peopl web regular basi number rapidli data web form text imag concentr search text data find desir data web time cost effect problem wide interest search engin creat web user find desir inform search engin text defin set document search search engin term phrase search engin interchang survei index document creat advanc term repres content word combin content index identifi document term quickli googl altavista popular search engin web type search engin exist search engin aim provid capabl search page web search engin mention previou paragraph search engin search focu document confin domain document organ specif subject area cora search engin comput scienc research paper medic world search search engin medic inform organ busi site instal search engin page ten thousand search engin run web amount data web huge believ februari million publicli index web page number billion high rate emploi singl search engin data web unrealist process power scale fast virtual unlimit amount data gather data web extrem difficult imposs program web search engin gather data automat slow local server increasingli unpopular site document index document access search engin live realiti larg number search engin cover portion web metasearch engin system unifi access multipl exist search engin metasearch engin maintain index document sophist metasearch engin maintain inform content underli search engin provid servic metasearch engin receiv user pass queri underli search collect reorgan result underli search engin simpl architectur metasearch engin depict figur architectur gener hierarchi level number local search engin larg global interfac search engin search engin search engin figur simpl metasearch architectur number reason develop metasearch engin discuss reason search coverag web recent studi coverag web individu major search engin steadili due fact web faster speed index capabl singl search engin combin coverag multipl search engin metasearch higher percentag web search solv scalabl search web mention approach emploi singl search engin entir web poor scalabl metasearch engin top search engin creat altern search entir problem emploi singl search engin disappear significantli allevi search engin small easi build hardwar softwar infrastructur search engin due small search engin easili index metasearch engin approach search entir web significantli scalabl central search engin approach facilit invoc multipl search engin inform user frequent store multipl search engin case user find newspap articl special event desir articl scatter number newspap user send queri newspap examin retriev articl identifi articl formid task user identifi site newspap user send queri accept queri user format queri correctli qualiti rank articl return retriev articl individu rank difficult read content determin articl larg number return articl user simpli overwhelm metasearch engin top local search engin user submit queri invok local search engin metasearch engin good metasearch engin rank document return search engin properli metasearch engin make user task easier improv retriev effect scenario user find document specif subject area search engin subject area search engin document index search engin addit document unrel subject area true user submit queri search user obtain result search engin search engin exist larg number unrel document search engin hinder retriev desir document text document collect group cluster document cluster relat document cluster evalu cluster relat queri identifi search carri cluster method shown improv retriev effect system document search engin natur cluster queri submit metasearch search restrict search engin relat retriev effect achiev metasearch engin search engin search engin cluster document improv retriev qualiti cluster good search engin construct maintain cluster consum resourc search engin articl object review main technic issu build good metasearch engin survei techniqu tackl issu point challeng research direct metasearch engin area rest articl organ section provid short overview basic concept inform retriev concept import discuss articl section outlin main softwar compon metasearch engin section discuss autonomi heterogen local search engin affect build good metasearch engin section survei report techniqu select problem determin search user section survei method document select problem determin document retriev select user section report techniqu result merg problem combin result return local singl rank section present challeng build good metasearch engin basic ir concept inform retriev deal techniqu find relev document queri collect document document typic preprocess repres form facilit effici accur retriev content document repres word word semant inform word call stop word document remain word content word repres document variat word map term word denot term achiev stem program stop word remov document logic repres vector term total number distinct term set document document collect document repres vector number indic import ith term repres content document entri vector term absent document term present weight assign term base factor term frequenc term document number time term occur document higher term frequenc term import term repres content document term frequenc weight term document monoton function term frequenc factor affect weight term document frequenc number document term higher document frequenc term import term differenti document term document weight term base document frequenc monoton call document frequenc weight weight term document product term frequenc weight document frequenc queri simpli question written text transform vector word elimin compar word queri stop list word queri map term term weight base term frequenc document frequenc inform term frequenc weight queri document frequenc weight queri document weight term document term frequenc weight weight term queri product term frequenc weight document frequenc weight document queri vector document vector close queri vector retriev similar function measur close vector simpl function dot product queri document dot product function weight sum term common vector dot product function favor long document chanc term common document queri higher longer document shorter document order document fair chanc cosin function util jqj jdj denot length queri vector document vector cosin function return term common queri queri document ident vector posit multipl constant common measur retriev effect recal queri submit set relev document respect queri document collect determin quantiti recal defin recal number retriev relev document number relev document number retriev relev document number retriev document evalu effect text retriev set test queri set relev document identifi advanc distinct recal obtain set valu averag note boolean queri support ir system concentr vector space queri type queri explicitli identifi studi real user queri submit excit search engin queri boolean queri set test averag curv obtain curv measur effect system ideal inform retriev system retriev relev document recal equal user incorrectli queri user concept relev vari time difficult captur retriev document implement emploi similar function approxim relev document respect queri relev inform due previou retriev result util system learn capabl improv retriev effect remain portion restrict similar function achiev high retriev situat user feedback inform incorpor web search engin web search engin essenti inform retriev system web page web page featur document tradit ir system featur explor search engin develop improv retriev effect search engin special featur web page highli tag document web page html format xml document wide tag convei rich inform term document term titl document special font provid hint term import indic content document tag inform number search engin googl altavista determin import term repres content page term occur titl header page consid import term occur main text term type special font bold face larg font import term special font studi higher weight assign term due locat special font tag yield higher retriev effect scheme advantag locat tag inform special featur web page extens link link page page conveni path web user navig page page care analysi reveal simpl link piec inform made improv retriev effect link good likelihood content page relat author page valu content page linkag inform comput global import web page base page point page import page relev page combin similar pagerank successfulli googl search engin improv retriev effect linkag inform comput author web page respect topic global import refer note queri consid topic ibm clever project develop search engin emploi techniqu comput web page author queri util linkag inform page link page set term anchor term link anchor term provid inform content page facilit navig human user anchor term provid relat term synonym term index page util valuabl search engin googl wwww suggest anchor term repres link page page web page link web page anchor term kei metasearch engin compon typic session metasearch user submit queri metasearch engin user friendli interfac metasearch engin send user queri number underli search engin call compon search engin compon search engin accept queri format user queri translat format local system retriev result local search engin metasearch engin merg result singl rank list present merg possibl top portion merg user result list document list document identifi url web page possibl short companion descript interchang import distinguish introduc concept potenti document definit similar function comput similar document queri similar document queri approxim relev document submit queri document potenti satisfi document desir final result posit integ similar queri highest similar document queri document similar queri exce threshold similar queri greater threshold metasearch engin compon search engin emploi similar function queri similar comput local similar function incompar overcom similar definit comput similar function defin metasearch engin global similar note condit definit mutual translat condit threshold condit determin number document similar exce threshold vice versa translat substanti statist inform text user specifi number document view system threshold determin document retriev displai desir number document user goal text retriev maxim retriev effect minim cost central retriev implement retriev potenti document retriev document metasearch engin implement carri level select potenti potenti search minim search useless select retriev potenti document minim retriev useless document refer softwar compon architectur metasearch engin illustr figur number edg sequenc action queri process discuss function softwar compon interact compon selector number compon search engin metasearch engin reason send user queri compon search engin number hundr send queri compon search engin longer reason strategi larg percentag local useless respect queri user interest match document queri desir document number larger larg number useless respect queri send queri search engin useless drawback dispatch queri useless wast resourc metasearch engin site transmit queri useless compon search engin metasearch engin transmit useless document search engin metasearch engin incur unnecessari network traffic queri evalu useless compon resourc local system search engin search engin user user interfac selector document selector queri dispatch result merger figur metasearch softwar compon architectur wast larg number document return useless effort metasearch engin identifi document import send user queri potenti problem identifi potenti search queri select problem softwar compon selector identifi potenti user queri good selector correctli identifi potenti minim wrongli identifi useless potenti techniqu select cover section document selector search engin select compon document selector determin document retriev search engin goal retriev potenti document search engin minim retriev useless document larg number useless document return search effort metasearch engin identifi potenti document factor affect select document retriev compon search engin number potenti document similar function compon system factor determin number document retriev compon search engin local similar threshold document local similar queri higher equal threshold retriev compon search engin method select document local search engin retriev section queri dispatch queri dispatch establish connect server select search engin pass queri http transfer connect data transfer queri receiv search engin requir http request method method post queri format specif queri box queri dispatch follow requir search engin correctli note gener queri search engin receiv metasearch engin origin queri translat queri search engin translat boolean queri heterogen inform sourc studi vector space queri translat retain term user queri rel weight queri term origin user queri adjust queri compon search engin adjust rel import queri term adjust accomplish repeat queri term number time number document retriev compon search engin desir user part user metasearch engin document retriev document selector decid document retriev compon search engin number part translat queri compon search engin result merger result select compon search engin return metasearch result merger combin result singl rank list top document list forward user interfac number document desir user good result merger rank return document descend order global similar user queri result merg techniqu discuss section variat architectur introduc local coordin compon system function coordin work result merger possibl local coordin facilit determin final document displai user discuss document selector determin document retriev compon system document retriev compon system potenti retriev document transmit result substanti transmiss cost incur interact local coordin result merger result fewer document transmit result merger desir coordin compon system site compon system reduc transmiss local coordin deploi site result merger remain concentr main document selector result merger queri translat compon queri dispatch discuss survei queri translat boolean queri discuss articl focu vector space queri discuss queri translat vector space queri provid place discuss softwar compon sourc difficulti review environ metasearch engin built analyz environ tremend difficulti build effect effici metasearch engin compon search engin particip metasearch engin built maintain independ search engin decid set document index provid search servic decid document index updat similar document user queri comput similar function complet search engin decid similar function commerci search engin regard similar function implement proprietari inform make gener public direct consequ autonomi compon search number heterogen exist identifi major heterogen uniqu metasearch engin environ heterogen common system os platform discuss impact heterogen autonomi compon search engin build effect effici metasearch engin heterogen heterogen identifi autonom compon search engin index search engin wai determin term repres document term document subset term index lyco emploi order save storag space scalabl search engin web anchor term web page index referenc web page search engin exampl index techniqu involv remov stopword perform stem stopword list stem algorithm search engin document term weight method exist determin weight term document method term frequenc weight product term frequenc weight document frequenc weight section variat scheme exist system distinguish occurr term font term occurr term titl web page consid import occurr term titl queri term weight vector space model text queri consid special document short document term multipl time queri queri term weight scheme util frequenc term queri differ comput weight term queri similar search engin emploi similar function measur similar user queri document popular similar function mention section similar document text search engin differ level level domain medic document legal document domain domain easili determin document multipl domain domain divid multipl subdomain level set document set document substanti disjoint medic search search engin medic inform web page australia unit kingdom document document modifi true world wide web environ web page modifi author web page search engin index web page notifi modif search engin robot detect modifi page due high cost enorm amount work attempt revisit page made period week depend document fetch index search engin base older version newer version document local search engin highli system index version document case web page uniqu identifi result search engin present retriev result descend order local score search engin provid similar return document northern altavista addit heterogen compon search heterogen metasearch engin local system metasearch engin global similar function comput global similar document global similar function similar function compon search engin impact show autonomi heterogen compon search engin metasearch engin compon search engin profound impact evalu global queri metasearch engin order estim selector inform content call characterist inform repres metasearch engin type repres search engin metasearch engin cooper search provid repres desir selector search engin follow start standard repres obtain inform provid search engin document frequenc averag document term weight queri term repres inform desir selector search engin follow repres extract past retriev experi savvysearch sampl document sampl inaccuraci major challeng develop good select algorithm identifi repres good repres permit fast accur estim good repres small size comparison size easi obtain maintain section select algorithm emploi repres challeng develop wai obtain desir repres mention number solut exist depend search engin standard cooper issu obtain desir repres discuss articl difficulti document select problem result merg problem li fact document global local similar queri due heterogen queri submit global document compon potenti depend global similar highli similar function term weight scheme global local similar global similar term weight scheme similar function local global similar local similar similar comput make inform document frequenc mean global highli rank document local highli rank document global top rank document rank ith local order retriev local system retriev document higher local similar retriev system gener incap retriev lower rank document retriev higher rank document rank higher local potenti base global similar main challeng document select develop method maxim retriev potenti document minim retriev useless document compon search engin main challeng result merg find wai estim global similar document document return compon search engin properli merg examin techniqu deal problem document select result merg select metasearch engin receiv queri invok selector select compon search engin send queri good select algorithm identifi potenti accur approach tackl select problem approach differ repres content measur respect queri techniqu emploi estim classifi approach categori qualit approach predict qualiti respect queri base rank formula qualiti measur rank score difficult understand approach rough repres word paragraph detail repres piec statist inform term quantit approach predict base measur easier understand measur qualit approach measur quantit approach reflect respect queri directli explicitli comparison qualit approach piec statist inform order enabl predict quantit approach approach make past retriev experi respect compon search engin predict search engin retriev experi obtain train queri select algorithm put real user queri select activ obtain experi save repres survei discuss select approach base classif qualit approach qualit emploi rough repres emploi detail repres rough repres approach rough repres kei word sentenc describ content capabl provid gener idea aliweb repres fix format repres content local site repres describ site file perl program languag document perl inform perl program languag includ local hypertext perl latest faq hypertext languag user queri match repres compon determin suitabl queri match field repres base user choic compon rank base close match queri user select compon search rank list compon time note aliweb full blown metasearch engin user select search time perform result merg similar descript content compon wai descript rank compon similar queri user select compon search desir document local search time search broker manual assign word subject categori keyword user queri consist subject part regular queri part queri receiv subject part queri identifi compon search engin cover subject regular queri part search document identifi search engin text descript content transform structur repres transform perform manual wordnet transform process disambigu topic word descript fact list world archiv transform structur countri fact word wordnet synset set synonym defin mean topic word synset consid synset mean match intend mean descript fact list omit user queri sentenc automat convert structur disambigu similar combin techniqu queri handl queri match repres local identifi potenti main appeal rough repres approach repres obtain easili requir storag space compon search engin highli special diversifi topic content easili approach work short descript repres suffici document interest miss potenti occur easili approach allevi approach involv user select process aliweb user make final select base preliminari select metasearch engin search user requir subject area queri user compon involv select process easili miss rough repres approach consid inadequ metasearch engin detail repres approach detail repres term document select approach detail repres detect exist individu potenti document number qualit approach detail repres approach store piec statist inform term detail repres describ approach approach wise index search central search engin metasearch engin number underli search engin distribut repres compon search engin consist document frequenc term compon number document repres distinct term quantiti document frequenc cardin addit term denot number document ith compon df ij document frequenc term ith user queri repres comput rank score compon search engin respect score measur rel respect score higher judg relev rank score comput cue valid queri term ith compon cv ij comput cv ij df ij df ij df kj total number compon metasearch engin cv ij measur percentag document ith term rel ith higher percentag document comparison cv ij larger varianc cv ij queri term compon cv comput cv ij averag cv ij compon cv measur skew distribut term compon term cv larger cv term distinguish compon term extrem percentag document term select cv term rank score compon respect queri comput cv df ij number term queri rank score sum document frequenc queri term weight queri term cv cv term reflect distinguish power rank score provid clue queri term concentr queri higher percentag document rank score high rank score comput respect highest score select search queri repres document distinct term addit entir approach easili scalabl comput simpl problem approach rank score difficult understand ordinari user rank score compon determin potenti document rank score rel score difficult determin real respect queri good rank good rank rel rank score differenti situat accuraci approach question approach distinguish document occurr term document occurr term cori net approach collect retriev infer network approach repres consist piec inform distinct term document frequenc frequenc number compon term note term multipl frequenc store metasearch engin save space cori queri document rank techniqu infer network inqueri document retriev system extend rank compon respect extens conceptu main idea visual repres document set repres super document explain repres conceptu consid super document distinct term term document repeat term time super document document frequenc term term frequenc term super document set super document compon metasearch engin form super document denot super document note frequenc term document frequenc term repres compon obtain term frequenc document frequenc term super document tf idf formula comput weight term super document repres super document vector weight similar function cosin function introduc comput similar super document respect queri similar rank compon approach emploi cori net infer network base probabilist approach cori rank score respect queri estim belief document belief essenti combin probabl document due queri term belief comput user queri term number metasearch engin df ij document frequenc jth term ith compon frequenc jth term belief document due jth queri term comput jd ij ij df ij df ij formula comput tf weight jth term super document formula comput idf weight jth term base super document constant dw function size dw number word averag number word valu constant determin empir perform experi actual test collect note jd essenti tf idf weight term super document term repres queri denot queri term weight belief document respect queri rank score respect estim jd cori repres slightli piec inform term document frequenc share frequenc cori net approach good scalabl inform repres compon obtain maintain easili advantag cori net approach method comput rank score document queri rank score repres super queri shown phrase inform collect store repres queri expand base techniqu call local context analysi cori net approach select accur ggloss approach ggloss glossari server system research prototyp compon repres set pair df document frequenc ith term sum weight ith term document compon threshold queri ggloss document similar queri higher threshold interest compon respect queri ggloss defin sum similar document compon queri higher threshold queri compon rank score estim method emploi base assumpt assumpt queri term document queri term document term term disjoint assumpt term set document term disjoint set document term discuss estim method compon queri weight term term arrang ascend order document df df df document frequenc term mean document df document similar df df df document similar df df defin integ satisfi df df estim df df df df disjoint disjoint document queri term df document term similar df document queri df estim local df df df df sensit similar threshold ggloss differenti moder similar document highli similar document cori net assumpt ggloss restrict estim inaccur shown estim formula base assumpt overestim estim formula base disjoint assumpt underestim estim formula tend form upper lower bound true method separ size repres ggloss size comput estim ggloss carri effici quantit approach main differ quantit approach qualit approach measur reflect respect queri specif term measur quantit approach number potenti document respect queri clear measur reflect queri measur quantit approach util selector behalf user perform select chicago newspap compani charg fee retriev archiv newspap articl fee charg access fee independ number retriev document compon system larg number similar document necessarili similar document prefer compon system similar document fee charg retriev compon system similar document prefer type charg polici incorpor selector metasearch engin number potenti document respect queri estim addit quantit quantit measur global similar similar document respect queri measur expect document lower similar queri measur rank optim retriev similar document section describ method estim number potenti document respect queri section section describ method estim global similar similar document respect queri measur rank estim number potenti document compon global similar queri document similar threshold number potenti document respect defin accur estim respect selector simpli select potenti document search queri base method estim global similar function dot product function wide cosin function special case dot product function term weight divid repres distinct term consist pair probabl term document simpli document frequenc term divid number document averag weight set document queri vector queri weight queri term gener wr gener function expand term obtain bc shown term independ weight term present document repres probabl document similar expect number document similar queri similar threshold largest integ satisfi estim solut restrict assumpt term independ assumpt uniform term weight assumpt weight term document term averag assumpt reduc accuraci estim address term independ assumpt util covari term term incorpor problem approach storag overhead repres compon larg larg number covari compon remedi covari absolut valu significantli greater incorpor depend term combin adjac term singl term similar recogn phrase method estim method deal uniform term weight assumpt method partit actual weight term set document term number disjoint subrang possibl length median weight subrang estim base assumpt weight distribut term normal standard deviat weight term ad weight fall subrang approxim median weight subrang weight queri term polynomi gener function replac wm wm il wm il ij probabl term occur document weight jth wm ij median weight jth number subrang gener function rest estim process ident earlier shown maximum normal weight term highest estim accuraci drastic improv method produc accur requir larg storag overhead comput complex expand gener function exponenti suitabl short queri estim similar similar document user metasearch engin find similar document queri compon dm definit defin optim order queri definit set optim rank order dm respect queri exist similar document similar document order optim similar document queri suffici examin suffici condit dm optim rank order dm respect queri dm global similar similar document queri optim rank respect queri selector select search challeng estim queri method util express scan express descend order expon approxim number document estim expect number document similar greater equal approxim drawback solut requir larg repres comput high complex effici method estim type repres global repres compon distinct term global document frequenc weight store repres local repres compon distinct term pair quantiti maximum normal weight averag normal weight term weight document normal weight jdj denot length maximum normal weight averag normal weight maximum averag normal weight document queri vector estim max intuit estim similar document maximum normal weight ith queri yield half express brace queri document averag normal yield half maximum similar document maximum normal weight queri term normal queri yield equal underli assumpt formula term queri independ depend term captur extent store statist phrase treat phrase term repres quantiti term global repres share comput linear complex approach approach predict queri base retriev experi past queri retriev experi obtain number wai train queri retriev knowledg compon respect train queri obtain advanc selector type approach call static learn approach retriev chang weak static learn adapt content queri pattern real user queri contrast train retriev knowledg accumul graduat updat continu type approach refer dynam learn approach problem dynam learn obtain suffici knowledg selector static learn dynam learn combin form approach initi knowledg obtain train queri knowledg updat continu base real user queri overcom weak learn approach introduc learn base select method approach relev document approach static learn approach set train queri util train queri submit compon return document relev document identifi vector reflect distribut relev document obtain store vector format posit integ indic document retriev order obtain relev document queri train queri compon document retriev order identifi relev distribut vector vector train queri selector readi select user queri user queri compar train queri similar train queri identifi perform report averag relev document distribut vector vector similar train queri obtain averag distribut vector select search document retriev select maxim recal point queri averag distribut vector obtain compon case relev document retriev maxim reduc retriev irrelev document retriev document retriev select select yield retriev document relev repres compon set distribut vector train queri main weak approach learn carri manual train queri difficult identifi train queri learn knowledg accur content compon chang savvysearch approach savvysearch metasearch engin emploi dynam learn approach savvysearch rank score compon search engin respect queri comput base past retriev experi term queri search weight vector wm maintain correspond ith term search engin weight queri term retriev document compon weight adjust retriev result document return search weight reduc number term queri return document user relev judgement weight larg posit respond term past larg neg respond poorli savvysearch track recent perform search engin term averag number document return recent averag time recent queri compon search engin threshold default penalti search engin comput averag time greater threshold default penalti maximum time timeout queri term rank score comput jw frequenc weight term number number posit weight term overhead store repres inform local search engin savvysearch moder piec inform weight term previou queri moder effort maintain inform weak savvysearch work queri term queri term time user feedback process emploi savvysearch rigor easili lead search engin user tendenc check document queri document mean term weight repres easili modifi consist mean weight weight term suffici reflect respond term approach metasearch engin emploi combin learn approach categori util learn process categori law set term categori reflect topic categori set train queri identifi reason categori dedic train queri learn compon respond queri categori categori compon train queri submit top retriev relev document identifi score reflect perform respect queri categori comput set ith rank document relev set document number relev document retriev document formula captur rank order relev document top retriev document score train queri categori averag averag confid factor respect categori end confid factor respect categori user queri receiv metasearch map categori queri map categori term belong set term categori rank base sum confid factor respect map categori sum confid factor respect call rank score largest rank score select search queri document retriev select search engin rank base product local similar document rank score document user top rank rank score rank score document rank higher reduc carri adjust confid factor map categori queri categori select confid factor rank score confid factor rank score adjust polici move higher rank queri process futur polici rank score top rank document read user combin static learn dynam overcom problem emploi static learn dynam learn shortcom static learn part select train queri identifi relev document carri manual higher rank document click document remain document adjust confid factor interest user situat learn strategi retriev document repeat queri emploi dynam learn method simplist user feedback inform user tendenc select highest rank document relev document allevi problem click document read amount time document select selector chosen compon task determin document retriev select naiv approach select compon search engin return document retriev search engin problem approach document retriev compon system unnecessarili approach lead higher commun cost requir effort result merger identifi match document naiv approach discuss section note compon search engin typic retriev document descend order local similar problem select document retriev compon translat determin number document retriev compon document retriev compon document largest local similar retriev determin local threshold compon document compon retriev local similar queri exce threshold problem tackl exist metasearch engin goal retriev potenti document compon minim retriev useless document classifi approach document select problem categori user metasearch engin global user determin document retriev compon weight number document retriev compon depend rank score compon rel rank score compon document retriev compon rank higher higher rank score approach determin number document retriev compon base past retriev experi compon idea potenti document respect queri retriev survei discuss approach categori user determin metacrawl savvysearch maximum number document return compon custom user number queri user select default number set metasearch engin approach reason number compon small user familiar user afford number document retriev compon number compon method problem user capabl select number compon user forc number appli number select compon number document respect queri method retriev useless document compon system hand retriev document compon system hand document retriev select number document retriev set slightli higher weight alloc compon rank rank score determin select algorithm rank inform rank score inform determin number document retriev compon system weight alloc approach attempt retriev document compon search engin rank higher larger rank rank score inform queri rank score compon number select compon queri document select compon desir number document retriev cori net rank inform total number document retriev compon document retriev ith rank compon cori chosen larger number desir document global user order reduc likelihood miss document special case weight alloc rank score compon estim number potenti document rank score compon number document retriev weight alloc flexibl approach base good intuit retriev document highli rank local approach learn document retriev compon queri past retriev experi similar queri approach section introduc relev document select method combin select determin document retriev queri averag distribut vector obtain document retriev made maxim relev desir method retriev top document top document qc perform document select base past retriev experi set train queri util train compon train queri group number cluster queri cluster number common document retriev queri larg centroid queri cluster comput averag vector queri cluster compon weight comput cluster base averag number relev document top retriev document perform report queri queri cluster weight cluster respond queri cluster user queri compon queri cluster centroid similar queri select weight select queri cluster determin number document retriev weight select queri cluster compon total number document desir number document retriev number compon method essenti weight alloc method weight queri learn weight select queri cluster user queri similar train approach produc good result approach weak prevent wide suitabl environ compon search engin frequent ad metasearch engin train conduct search engin ad easi determin train queri similar train queri potenti user queri train queri consum lot resourc time consum user identifi relev document wide varieti train queri retriev similar function compon metasearch document low local similar high global similar global local similar function scenario local global similar occur due statist inform function document frequenc term compon system system global document compon system return document high local global potenti document determin base global similar compon miss idea retriev ensur global potenti document retriev global local document similar match note approach earlier subsect belong retriev categori global similar medic legal desir retriev document similar queri retriev approach minim retriev useless document introduc techniqu retriev categori queri modif global queri modifi submit compon yield global similar return document techniqu call queri modif essenti queri translat method vector queri compon system trick return document descend global retriev global similar document trivial compon case local global similar function cosin function note similar function global document global local similar due local global document frequenc term wm weight vector document comput inform term queri term frequenc document frequenc inform idf inform term incorpor similar comput modifi queri process user queri weight term assum assign user comput term frequenc queri compon system receiv queri incorpor local idf weight queri term modifi queri evalu modifi local idf weight term compon system cosin function local similar comput jq jdj length global idf weight term cosin function global similar order trick compon system comput global similar procedur queri receiv metasearch modifi modifi queri compon evalu receiv modifi evalu comput global similar queri modif techniqu work combin local global similar function deal situat document local global similar approach requir knowledg similar function term weight formula compon system inform proprietari easili work discov inform base sampl queri report comput tightest local threshold queri metasearch engin set threshold global similar function document satisfi retriev document consid potenti problem determin proper threshold select compon potenti document exist retriev local similar function document note order potenti document retriev unwant document retriev challeng minim number document retriev potenti document retriev desir determin tightest local threshold shown similar comput relat ffl ffl constant satisfi ffl local threshold determin local threshold determin method tight techniqu find tightest local threshold popular similar function pair global similar threshold denot tightest local threshold compon determin find function minimum local similar function document subject fix vari document minim rang minimum desir ft set term queri differenti respect weight term document find step gener achiev method lagrang calculu minimum rang comput easili simpli illustr method document queri global similar function local similar function step find requir minim subject lagrang found function function global threshold tightest local threshold method provid tightest local threshold combin local global similar weak separ solut found pair similar function clear solut found requir local similar function result merg provid local system transpar global result return compon search engin combin singl result document merg result rank descend order global similar ideal merg hard achiev due heterogen compon system document return compon search engin rank base document local rank score similar compon search engin make local similar return document user search engin make googl altavista provid local similar northern light local similar return compon search made incompar due heterogen search engin local similar global similar document challeng merg document return search engin singl rank list reason manner absenc local similar presenc incompar similar naiv merg method exist simpli local start document search engin naiv method consid adequ discuss section complic problem document return multipl compon search engin question affect rank document exist result merg approach classifi type local similar type approach adjust local similar addit inform qualiti compon variat map local document rank similar global similar type approach attempt comput estim true global similar return document type easier implement merg rank inaccur merg base true global similar return document type rigor potenti achiev ideal merg typic inform local system type approach discuss subsect local similar adjust situat return document uniqu local similar attach search engin normal local similar rang search engin normal similar search engin local similar base common improv compar local similar assum local similar normal base common rang select perform qualiti estim repres score score adjust local similar idea give prefer document highli rank cori net adjust work rank score compon averag score search weight assign number compon search queri greater larg differ larger weight smaller larger differ smaller weight local similar document adjust similar comput result merger list return document descend adjust similar base weight clear document higher rank chanc rank higher merg result similar method rank score calcul discuss section adjust similar document product local similar rank score situat local similar return document compon search engin approach appli tackl merg problem assum document return multipl search return document uniqu local document rank inform directli perform merg local approach search order descend qualiti score obtain select step method base order local document rank order merg local document list document merg list top rank document highest rank document merg list top rank document highest rank top rank document search document merg list rank document highest rank process continu desir number document includ merg list weak solut differ score order inform random version method recal select determin document retriev compon queri maxim retriev desir number document retriev select compon local document list number select compon local document list select document merg roll dice simul dice face local list total number document select document list dice made probabl face dice roll face current top rank document list select highest rank document merg list select document remov reduc probabl updat retriev document rank base probabilist model convert local document rank similar method emploi rank score min lowest rank score min local rank document convert similar document function defin min number document desir search function properti document local system convert similar impli document local system consid equal potenti model distanc convert similar consecut rank document differ convert similar jth rank document distanc larger smaller rank score rank document higher rank rank document lower rank convert similar higher method select document higher score merg result document desir min base top rank document convert similar top rank document convert similar merg list document document document rank descend order convert similar merg list document return multipl search engin studi inform retriev shown document retriev independ rank similar function term weight document relev impli document rank higher merg list method combin local similar document multipl normal similar local similar document measur confid local search engin document potenti confid document potenti queri provid similar comput independ document normal similar local confid document significantli higher local similar combin similar place document merg list search engin emploi independ rank similar combin method document retriev multipl search engin adjust largest adjust similar determin rank document merg list independ rank algorithm search find similar function term weight formula compon system techniqu discov knowledg report global similar estim comput estim global similar return document method report document fetch document return search engin typic mean url document return addit inform short summari coupl return document typic return document fetch method download return document local server comput estim global similar metasearch engin case global similar function cosin function global document frequenc term metasearch engin local global document frequenc term comput approxim sum local document frequenc document term frequenc term document obtain statist comput global similar document global similar comput inquiru metasearch engin rank document return search engin base analyz content download document rank formula combin similar proxim match emploi document fetch base method combin document select result merg report similar document respect queri desir posit integ section introduc method rank descend similar similar document queri rank optim rank retriev similar document rank perform document select small posit integ start top rank search obtain actual global similar similar document requir download document min sim minimum similar retriev document actual global similar greater equal tent threshold min sim tightest local threshold determin document process stop top rank rank consid similar document retriev actual global similar document compar min sim minimum similar global threshold retriev document actual global similar greater equal threshold process repeat document retriev retriev document rank descend order actual global similar potenti problem approach search multipl time problem reliev extent retriev cach larger number document search method properti rank similar document retriev access unnecessari optim rank achiev similar document retriev download document analyz fly number document download larg document larg size number remedi download local system carri parallel document analyz displai user analysi user read initi result initi displai result correctli rank rank adjust document analyz download begin portion document analyz download base approach clear advantag download obsolet url identifi document dead url remov final result list analyz download document rank current content local similar comput base version document queri term download document highlight displai user discov knowledg discuss difficulti result merg document local similar incompar compon search engin document index differ similar comput method weight similar specif document index similar comput method compon search engin techniqu posit figur local similar adjust local similar compar deriv global similar local similar illustr discov compon search engin select answer user queri emploi method index local document comput local idf inform idf weight similar local search engin consid compar similar directli merg return document differ compon search engin remov stopword stopword list queri adjust gener compar local similar term queri stopword compon search engin stopword compon search engin order gener compar remov submit modifi queri matter origin modifi submit idf inform adjust local similar comput global similar directli overcom problem global idf local idf term case assum local similar function global similar function cosin function case queri consist singl term similar document compon comput jqj jdj tf weight term local idf weight local idf formula discov global document frequenc local similar adjust global similar multipli global idf weight case queri multipl term global similar case jqj jdj jqj jdj jqj comput metasearch engin formula comput order find find jdj find jdj term download document submit queri jt jdj local similar return jdj jt note express side formula comput metasearch engin local formula addit queri comput global similar document retriev challeng discuss previou progress made find effici accur solut problem process queri metasearch engin environ emerg outstand problem remain solv list worthi challeng area integr local system emploi index techniqu index techniqu local system impact compat local similar care observ reveal index techniqu fact affect estim accuraci softwar compon document select result studi carri investig impact pose overcom allevi impact previou studi larg local similar function local term weight scheme integr local system support type queri boolean queri versu vector space discuss articl base queri vector space model exist metasearch engin boolean queri ncstrl number work deal boolean queri metasearch engin report method rank document boolean queri boolean retriev system rank retriev vector space face problem integr local system support boolean queri vector space queri local system provid suffici design statist inform system inform proprietari suffici inform local estim local system respect queri made accur solut dilemma develop tool learn local system index term statist inform term similar function probe queri learn knowledg discov tool facilit addit compon search engin exist metasearch engin detect major upgrad exist compon system preliminari work area start report sampl techniqu discov term compon statist inform term report techniqu discov term weight assign compon search engin techniqu develop discov knowledg compon search engin accur effici extrem wai build metasearch engin interfac top autonom compon search engin cooper local system expect invit local system join metasearch engin develop metasearch engin set similar inform compon satisfi local system join metasearch engin possibl exist extrem mean practic type repres metasearch engin type repres estim compar larg untouch problem interest issu guidelin inform local system facilit construct metasearch engin search engin develop guidelin design upgrad search engin multipl level complianc complianc level level estim accuraci initi effort regard found index term weight techniqu develop search engin html document search engin wwww googl anchor term web page index web page hyperlink url anchor author web page add hyperlink web page includ anchor tag descript addit url descript potenti import retriev includ percept author content search engin comput weight term posit web page font type weight term page term titl page similar method emploi yahoo googl assign higher weight term larger bold font method rank web page base hyperlink structur interest problem incorpor techniqu entir retriev process repres metasearch engin built proxim term influenc relev document techniqu construct repres type inform util document select result merg studi section identifi major softwar compon build good metasearch engin issu discuss compon implicit assumpt articl compon except local coordin site metasearch engin valid altern exist selector global distribut local site repres local store local user queri dispatch local site site estim respect queri determin local search engin invok queri placement selector incur higher commun appeal advantag estim carri parallel repres store scalabl issu central select emploi compon document selector altern placement investig pro con placement softwar compon research issu investig urgent creat testb evalu techniqu document select result merg paper report techniqu includ hard draw gener result due limit document queri studi portion trec collect conduct experi inform relev document queri util trec collect limit number queri portion trec collect small queri tend longer averag typic queri encount internet environ document reflect structur extens hyperlink web document collect real internet queri collect small document relev inform ideal testb larg collect content larg collect queri length relev document queri identifi recent testb evalu metasearch techniqu ideal testb inform sourc web multimedia data imag video work metasearch deal text sourc text aspect multimedia sourc select techniqu develop media type select imag metasearch context investig data sourc book titl author suffici condit rank optim lack research provid metasearch capabl mix media multimedia sourc list challeng mean complet problem deeper understand issu metasearch number search engin digit librari world wide provid effici effect access text inform multipl sourc increasingli present overview exist metasearch techniqu overview concentr problem document select result merg wide varieti techniqu problem survei analyz discuss underli problem heterogen compon search engin due independ implement search lack inform implement proprietari survei investig singl solut main problem select document select problem result merg problem solut requir inform compon search engin detail underli similar term weight index suffici effici method find inform independ scenario good solut base knowledg local search engin appli solut import issu scalabl solut develop solut scale orthogon data access good solut scale thousand million document million access dai solut evalu condit acknowledg work support part nsf grate anonym review articl invalu suggest construct comment refer fox world wide web queri virginia baumgarten probabilist model distribut inform retriev acm sigir pp joachim machin learn architectur optim web search engin aaai workshop inform page anatomi hypertextu web search engin allan automat retriev local inform smart dk text retriev confer nist special public march pp croft search distribut collect infer network acm pp al mine web link structur ieee vol august pp semant knowledg find internet inform archiv acm sigir pp mind queri map heterogen inform sourc acm sigmod global integr visual ieee intern confer data cooper inadequaci probabl rank criterion retriev system output school librari inform studi uc thistlewait merg result isol search engin tenth australasian meng structur html document improv retriev usenix symposium internet technolog system pp experi select search engin metasearch acm juli pp du automat discoveri languag model text acm sigmod hard inqueri retriev system dexa dumai latent semant index pp gauch adapt agent inform gather distribut inform sourc aaai symposium intellig agent stanford march shaw combin multipl search pp selman wide area technic report technic report onlin acm april vile evalu select testb experi acm sigir pp al compar perform select algorithm acm sigir pp gomez intellig fusion distribut search engin journal comput pp effect gloss text discoveri problem acm paepck stanford internet acm pp gener gloss broker hierarchi gener gloss broker hierarchi technic comput scienc stanford report discuss estim defin paper disjoint scenario discuss merg rank heterogen internet sourc larg data base saracev real life inform studi user queri web acm sigir inform system corpor wide area inform server technic report machin april srivastava inform manifold aaai spring symposium inform gather distribut heterogen environ kirsch futur internet infoseek experi search internet acm sigir pp kleinberg authorit sourc hyperlink environ symposium discret koster index web comput network isdn pp rout retriev threshold experi davi architectur distribut document librari acm april lee gile search world wide web april pp lee gile neci meta search engin seventh intern world wide web lee gile access inform web juli pp lee combin multipl evid properti weight scheme acm sigir pp danzig boolean similar measur resourc discoveri ieee pp yu discoveri similar comput search engin acm intern confer inform knowledg manag novemb wu rish statist method estim text ieee transact knowledg data engin search broker usenix symposium internet technolog system pp connect web search facil data engin pp june mauldin design choic internet search servic ieee expert februari mcbryan tool train web www rish determin text search internet intern confer larg data york august pp rish estim search engin proc intern confer data engin march liu detect heterogen multipl text environ fourth ifci confer cooper inform system septemb miller lexic intern journal zobel inform retriev larg document collect network comput scienc technic refer librari terri winograd pagerank citat bring order web technic stanford pinkerton find peopl experi webcrawl intl conf world wide robertson probabl rank principl ir journal pp salton introduct modern inform retriev automat text retriev inform comput addison etzioni search comparison metacrawl intern world wide web decemb etzioni metacrawl architectur resourc aggreg web ieee gifford content rout system distribut inform server intern confer extend march bucklei mitra pivot document length normal acm sigir learn collect fusion strategi inform retriev intern confer machin taho juli pp croft evalu infer retriev model acm transact inform juli pp siemen experi merg collect fusion problem learn collect fusion strategi acm sigir pp tong multipl search engin merg acm intern confer digit juli interact brow rank inform system journal inform pp advanc calculu edit dover callan effect retriev distribut collect acm sigir pp croft queri local global document analysi acm sigir pp xu croft languag model distribut acm rish find similar document multipl text ieee confer advanc digit librari siu estim number desir record respect queri acm march meng principl queri process advanc applic morgan kaufmann san rish effici effect metasearch larg number text eighth acm intern confer inform knowledg manag kansa novemb lee rank algorithm locat resourc world wide ieee confer data pp lee server rank distribut text resourc system internet intern confer system advanc applic april pp
DB/1169 3 clp platform integr constraint abduct slim hen christiansen comput scienc munich germani depart comput denmark abstract integr constraint abduct import system enhanc queri process express knowledg straightforward subset languag chr origin intend write constraint solver appli clp languag subset strikingli simpl comput model execut technolog earlier confirm chr platform experi combin disjunct shown integr constraint abduct introduct constraint logic program establish extens logic program add higher express case effici queri evalu clp rise field constraint present suggest clp techniqu appli defin integr constraint ic control updat provid addit flexibl indirect definit predic mean abduct definit abduct rise kind hypothet queri logic consequ current state straightforward featur provid chr languag pronounc origin intend declar languag effici implement constraint chr extend chr languag disjunct bodi rule execut exist chr implement addit provid common result implement method develop effici execut clp program appli evalu deduct ic abduct approach interest case queri answer requir full versatil provid clp environ serv platform design advanc function improv system storag manag larg data quantiti previou paper chr demonstr platform combin evalu disjunct shown integr ic abduct paper organ section introduc subset chr declar oper semant section present translat logic program integr constraint chr program section show abduct framework formal chr conclud relat work summari proof includ reason space chr syntax semant subset chr present paper briefli full detail explicit guard omit negat includ languag simul mean abduct integr constraint atom defin usual disjoint sort predic sort predefin predic sort free predic predefin predic defin mean logic theori statement form cn cm subset variabl cm decid legitim form predefin predic mean constraint domain clp languag sort judgment shown abstract behavior ideal constraint solver free predic defin chr program set predefin predic includ usual mean syntact equal equat atom stand symbol equat pn stand pn chr program finit set rule basic kind simplif rule propag rule head conjunct atom bodi goal goal formula construct atom conjunct disjunct arbitrari denot empti conjunct empti disjunct queri goal predefin predic occur head rule simpl goal disjunct pre denot conjunct predefin atom simpl goal conjunct permut conjunct commut similarli disjunct declar semant chr order logic logic mean simplif rule logic logic mean propag rule refer variabl occur remain variabl rule logic mean chr program union logic mean rule oper semant chr transit system state goal consid disjunct subgoal subgoal fail pre unsatisfi state fail subgoal fail chr program transit relat defin kind deriv figur appli subscript left clear context deriv queri program sequenc state step appli fail subgoal propag appli constraint subgoal final state deriv fail success deriv step appli success subgoal notic split step ensur success subgoal simpl simplifi variant variabl rule variabl propag variant variabl rule variabl split deriv step chr simplifi atom mean replac formula rule fresh variant simplif rule made replac bodi equat provid predefin atom current subgoal satisfi propag transit atom add logic redund inform make rule activ notic simplif propag appli match instanc deriv step instanti prevent trivial formal comput rule properti variabl variabl unif match languag chr complet split transit appli state disjunct condit satisfi transit lead branch deriv subgoal made process separ disjunct process mean altern investig failur occur chr investig branch order respect declar implement backtrack produc copi part state process parallel interleav impli rule disjunct bodi syntact sugar mean combin rule disjunct mean occur subsequ rule mean commit transit chosen nondeterminist chr true evalu queri wrt program lead deriv true success final state simplif propag rule ad predefin constraint order achiev compact semant point unnecessari exampl assum equat subgoal elimin applic suitabl substitut leav fail subgoal chr program execut directli current implement chr prolog side backtrack produc success subgoal logic program integr constraint chr step show program written constraint logic languag predefin predic chr written chr program cp integr constraint ad cp distinguish predic defin defin finit set ground fact predic defin number cp simplif rule call definit rule form xn variabl occur origin rule predic defin set fact cp propag call close rule form xn xn xn cp propag rule call introduct rule list fact predic true fn integr constraint ad cp propag rule form arbitrari bodi evalu queri proce unfold definit rule predic lead state give set predic close rule prune set hypothesi set consist fact origin logic program accept notic close rule syntact special case integr constraint serv ensur fact ad integr constraint necessarili involv process queri case integr kind semant identifi failur consult actual extens close introduct shown introduct rule ensur success state reach integr constraint check chr program defin person predic parent sibl integr constraint state natur requir set fact satisfi predic predefin repres syntact definit rule introduct rule true close rule integr constraint queri unfold subgoal involv father mother fail surviv queri succe queri predic introduct rule introduc fact state integr constraint process queri true show integr constraint satisfi queri accept reject close rule queri fail queri brought failur check integr constraint correct properti transform posit horn program definit rule introduct rule cp coincid clark complet close rule logic redund declar semant preserv transform success subgoal copi part satisfi collect predefin atom correspond comput equat substitut variabl initi goal atom predefin serv constraint variabl satisfi integr initi goal fail deriv formul suitabl comput rule result deriv fail complet obviou program termin suitabl comput achiev termin analog tradit clp implement languag written complet result formul collect success subgoal infinit deriv formal defin predic indirectli mean integr constraint defin feasibl posit constraint logic program suffici illustr principl mean task extend program orphan predic intend mean hold person father mother definit requir valid instanc predic mean list orphan fact unaccept express ad rule program queri result final state conjunct fact program rule defin rang give rise instanti remov valu parent definit rewritten posit express reli procedur semant prolog approxim return section abduct chr abduct queri formul tradit queri membership current state typic impli state system answer describ wai goal achiev consequ addit state abduct defin process reason explan goal gener theori describ problem domain applic problem repres abduct theori abduct theori tripl set predic call defin partial ic set order close call integr constraint abduct explan solut ground goal set ground abduc formula ad program impli goal satisfi integr constraint ic initi goal solut set existenti quantifi abduc constraint variabl solut produc method describ ignor issu minim solut requir abduct diagnosi abduct posit program sort introduc section integr constraint formul chr rule abduc chosen predic abduct theori defin translat chr program similarli translat section differ close rule left abduc introduct rule includ initi fact abduc predic definit orphan predic consid special case translat orphan consid abduc predic small abduct framework program integr bird bird penguin penguin fli predic fli abduc abduct solut bird fli solut obtain chr program bird penguin penguin fli program evalu goal bird fli lead bird fli fli show framework avoid problem variabl exist abduct system continu predic father mother abduc translat abduct framework shown close rule father mother remov queri final state abduct explan abduct queri fail person close rule person reject hypothesi illustr final state includ variabl chang person remov close rule queri lead final state conjunct fact subgoal abduct explan sibl observ john common father mari individu person gender subgoal explain sibl altern mean mother fact queri lead final state success present approach abduct avoid problem variabl abduc exist abduct algorithm person unknown father unknown father male gender matter correct properti translat abduct framework chr program summar abduct framework written chr program initi goal success subgoal deriv abduc atom necessarili fact ground substitut satisfi ic success subgoal exist deriv abduct explan instanc complet obviou program situat similar discuss translat program chr notic implement chr abduct framework integr constraint suit implement explicit negat claim support negat framework techniqu predic abduc predic integr constraint relat work shown straightforward import aspect system mean chr program program constraint logic languag integr import describ queri evalu constraint written directli chr program execut current chr technolog abduct framework fit natur model implement handl correctli problem variabl abduc exist earlier approach show indirect predic mean integr constraint negat express straightforward wai show chr specif languag framework mechan gener import consequ result demonstr effici implement techniqu constraint logic underli chr environ applic varieti applic queri answer mechan approach guard provid chr procedur semant simpl comput model constraint store hold part includ fact suggest abduct integr constraint serv readi strike inconsist observ relat integr constraint constraint logic suggest shape increment evalu method strong similar work paper work kowalski al approach origin start point final result similar compar proof procedur involv rewrit complex formula optim method similar underli chr environ investig notic similar exampl semant queri optim chr extens disjunct logic program forward chain constraint requir constraint solver essenti pose tradit constraint logic program system backward chain turn implement chr evalu chr disjunct prolog chr rule compil prolog textual order exampl describ chr exampl execut onlin improv effici chr plan implement lower level modifi underli prolog abstract machin plan improv chr ad declar control rule author particip research support part dart project fund danish research danish research copenhagen refer constraint handl rule onlin oper semant confluenc constraint propag rule intern confer principl practic constraint lnc novemb schutz chr flexibl queri languag flexibl queri answer lnai christiansen autom reason metainterpret journal logic special issu constraint logic program christiansen integr constraint constraint logic program intern confer applic prolog page christiansen symbol constraint program journal appli artifici page special issu constraint handl rule decker extens sld abduct integr mainten view updat deduct proc page theori practic constraint handl special issu constraint logic program journal logic prolog constraint handl rule compil runtim system journal appli artifici page special issu constraint handl rule jaffar constraint logic survei journal logic kaka mancarella updat abduct proc intl conf larg page morgan kaka michael integr abduct constraint logic program leon intern confer logic page june mit press execut suspend logic program fundamenta gm editor constraint springer rajasekar foundat disjunct logic program mit pereira alfer found semant logic program explicit negat bernd european confer artifici page august john wilei son toni semant queri optim abduct constraint handl flexibl queri answer lnai
DB/1170 3 knowledg discoveri neil simon depart comput colchest uk www home abstract subject paper implement knowledg discoveri assess requir interfac tool system view architectur system discoveri introduc concept queri frontier exploratori strategi base optim current queri frontier individu knowledg discoveri algorithm approach advantag enhanc gener demonstr small set queri show tree induct algorithm rewritten function environ introduct relat current domin technolog organ collect larg amount data data support data mine gener data queri question knowledg discoveri algorithm integr relat describ architectur system implement essex address problem essenti client softwar optim queri transmiss knowledg discoveri algorithm implement give maximum scope optim provid servic extent independ algorithm tool implement exist includ work scalabl knowledg discoveri algorithm assum explor store local main memori common find client access effici algorithm report publish paper depend program techniqu port environ tree algorithm effici achiev manipul manipul pointer arrai record techniqu appli data store relat knowledg discoveri real world process algorithm inevit limit case investig method data access optim benefit share multipl algorithm concept abstract detail model visual tool assum exist exploratori process act sourc queri consum result set process gener set initi queri step repeat unpredict number request result option subset outstand queri schedul queri intuit client examin queri result produc multipl queri simultan advanc exploratori process open avenu branch task fill probabl bayesian result time set outstand call queri frontier approach optim knowledg discoveri essenti optim queri frontier combin individu queri larger simpl kind multipl queri optim exploit kind queri optim knowledg discoveri tool implement queri schedul paper describ implement requir assum princip aim run time distinct network requir system satisfi ensur work divid server client roughli work simultan obviou wast resourc server network share subject variabl load queri optim adjust dynam load server transfer process busi network fetch data server impli process relat work idea exploit optim access answer queri result larger relat materi select view view materi set queri optim problem select knowledg set queri gener emerg gener dynam cach speed process gener queri long histori gener idea cach queri result set index structur support queri match quickli determin queri answer cach kei concept queri queri includ queri answer appli unspecifi oper result set similar approach implement manag system top problem balanc work server client system interfac ai system includ subsystem cach result set reason implement queri summar relev background relat queri express sql typic queri process server philosophi simpl labour server server implement client implement user interfac point mean client power modern form sql queri tree object physic call iter individu iter implement tabl hash sort consolid iter object oop implement oper limit call open iter retriev row oper result termin oper time perform queri split open phase client fetch phase row transfer server machin work primit queri techniqu queri optim assum queri emit exploratori process restrict form assum set queri larger set queri oper queri mean pair queri uniqu queri includ denot properti extend finit set queri larger set refer set primit exploratori process current implement limit primit select count group primit order count group primit figur select version queri group queri basi wide rang knowledg discoveri task provid good opportun split process client count group order count group primit requir sort hash larg dataset disk temporari oper order primit continu data knowledg discoveri tool typic handl continu data discret step discret algorithm sort data strategi server filter sort oper calcul discret interv sort data stream network assum rest paper discret valu case select primit figur count group queri list column list column list data valu typic queri denot definit queri bi extens select queri straightforward select queri select attribut primit includ result deriv appli combin select aggreg call consolid olap literatur select select tabl tabl group group count group order order count group fig primit knowledg discoveri optim queri frontier optim queri frontier base idea queri joint queri plan pair execut queri execut server deriv consolid client pair compet physic queri plan easi gener case set execut queri deriv plan open phase shorter fetch compar singl open phase longer fetch obviou plan execut quickli cost specif client estim set queri plan dynam cost estim cost estim pair cost denot estim cost open phase fetch phase server queri function system react flexibl variabl load vari network bandwidth estim cost queri plan multipli pair factor reflect discrep predict actual perform execut queri plan start session factor set implement queri frontier queri frontier optim partit greedili dynam disjoint subset turn partit schedul subset frontier number estim advantag schedul queri schedul subqueri individu benefit calcul cost function exploratori process schedul queri process queri manag consid insert subset calcul effect frontier insert subset benefit improv improv insert subset benefit schedul server queri success queri open phase schedul start queri fetch aim ensur client server work continu figur illustr client idl server time open close fetch queri queri queri fig queri schedul strategi memori manag memori manag separ softwar manag main memori result set store persist cach disk dataset partit queri frontier creat fix root repres idea queri exploratori process answer queri cach data queri cach implement similarli server differ row stream disk server softwar architectur design queri optim implic structur knowledg discoveri tool interfac tool implement callback idea queri optim id attach number uniqu identifi applic result set pass handler id initi function initi model schedul schedul queri request result set control loop initi result set handler queri manag queri result set queri queri id cach fig skeleton architectur initi queri control transfer control repeatedli request result set queri repli result set handler handler pass queri control loop schedul control loop avoid request specif result give queri manag maximum latitud optim discuss queri frontier section illustr tree induct algorithm implement origin implement build tree strict complet tree implement remov constraint order node expand depend order result set left queri manag prune node begin node part tree built discret requir access calcul order evalu stop criterion calcul inform gain candid attribut node calcul error rate action requir queri detail calcul perform found quinlan book denot queri requir node denot queri calcul inform gain attribut node denot queri leaf node queri id identifi queri encod node option attribut number addit make notifi child node parent implement call handler node tree assign state node begin state proce state iter end state final process termin root node state final initi step creat singl node root state schedul initi queri action handler result set receiv node depend state puriti node stop criterion evalu criterion node state set parent node notifi incom result set queri inform gain attribut calcul store split set child node state schedul child node state set wait node remain state notifi messag receiv child node begin option consid replac node root largest cover child tree move state queri schedul leaf node node state set node receiv notifi messag largest child error estim depend node parent node state set final leaf incom result set calcul estim error rate node parent notifi node decrement count child node time notifi count reach error rate node notifi parent summari architectur gener optim exploratori base primit queri algebra structur process split client server overlap ensur client server work parallel problem vari load server network address dynam adjust cost function queri plan issu identifi outset address effici integr knowledg discoveri tool server acknowledg research paper support engin physic scienc research grant number refer process knowledg discoveri approach fayyad al advanc knowledg discoveri data aaai press mine larg parallel process kluwer academ publish queri evalu techniqu larg acm comput survei implement data cube effici proc acm sigmod confer cach scheme architectur vldb journal survei method scale induct learn algorithm proc intern confer knowledg discoveri data mine program machin learn morgan kaufman publish materi view data proc krdb greec architectur system bridg system proc conf data engin enhanc knowledg process environ proc intern confer inform knowledg manag
IR/1171 5 repositori web page jun raghavan hector andrea paepck comput scienc depart stanford ca abstract studi problem construct maintain larg share repositori web page discuss uniqu characterist identifi function modul focu storag manag illustr tradit techniqu storag index tailor meet requir web repositori evalu design present result prototyp repositori call develop stanford keyword storag manag introduct number import applic requir local access substanti portion web exampl includ tradit text search engin relat page servic search categor servic applic typic mine index local cach repositori web perform directli web slow googl search engin comput pagerank web page analyz web link structur repositori receiv web page compon mechan find modifi page web repositori offer applic access interfac effici access larg number web page studi design larg share repositori web page present architectur evalu implement describ prototyp repositori develop part project stanford prototyp collect million web page testb studi data mine techniqu earlier version prototyp backend storag system googl search engin prototyp intend offer parallel multipl storag support wider varieti applic prototyp implement featur compon present import function servic place web repositori store manag larg collect data case web page conceptu system store data file manag inform retriev system web repositori provid lot function system gener directori structur web repositori optim provid essenti provid scalabl effici web repositori tune target size growth web paramount repositori scale larg number object abil seamlessli distribut repositori cluster comput disk essenti interest network disk hold repositori network disk network interfac connect directli network network disk provid simpl construct larg data storag web repositori donat larg number network disk quantum system made explor strategi assembl larg web repositori provid access individu store web demand access larg collect index data mine repositori support stream instanc entir collect scan fed client analysi repositori support order page return high speed order data mine applic examin page modifi page larg web rapidli repositori handl high rate modif version web page space occupi version reclaim histori mean substanti space compact reorgan file data system repositori good strategi avoid excess conflict updat process applic access page file data object explicitli delet longer web page remov web repositori notifi repositori mechan detect obsolet page remov akin base refer count paper studi build web repositori meet requir repositori architectur support requir function high perform architectur amen network disk present altern distribut web page comput disk mechan stage page provid appli repositori wai crawler repositori includ batch increment updat studi strategi organ web page comput system space compact reorgan perform discuss select optim disk size present result simul comparison approach shed light design choic goal cover wide varieti space forc make restrict scope make assumpt oper crawler repositori altern interest simpli cover assum crawler increment visit entir web time run crawler visit page believ chang creat run crawler scale web grow repositori maintain tempor histori web latest version web page retain repositori repositori store standard html page media document type crawler index construct snapshot view content repositori index repres state repositori success crawler run updat end crawler run increment rest paper organ section present architectur descript compon section concentr fundament compon storag manag section present result experi conduct evalu option design storag section survei relat work conclud section architectur figur architectur figur depict architectur system term main function modul interact show main modul storag metadata index multicast queri engin connect modul repres exchang inform direct crawler modul retriev page web hand storag manag modul crawler period web retriev fresh copi page exist page crawl storag modul perform critic function includ assign page storag handl updat crawler fresh schedul servic type request page focu paper storag section provid overview compon metadata index modul extract metadata collect index page metadata metadata repres inform extract web creation set outgo url includ inform obtain analyz entir collect number incom link page citat comput includ metadata modul gener index metadata web page index includ tradit full text index metadata attribut index citat count quickli locat web page incom link metadata index store separ devic main web page order minim access conflict page retriev queri process prototyp implement simpl metadata attribut store index relat queri engin multicast modul provid access content store repositori role subsect access mode repositori support major access mode retriev random access access stream access random specif page retriev repositori url uniqu page request set page queri page retriev queri refer metadata textual content web page index modul maintain index word present titl web page index hypertext link point page index respond queri url page word stanford titl point queri engin figur handl access repositori stream stream access substanti page repositori retriev deliv form data stream direct request client applic access mode uniqu web repositori import applic deal larg set page search applic mention section requir access million page build index perform analysi stream interfac index modul retriev page repositori build index multicast modul figur handl extern request stream mode access multipl client make concurr stream request stream organ client share transmit page goal repositori make stream remot applic institut make unnecessari site crawl store web effici multicast stream singl repositori multipl applic hit web occas request copi page support stream request entir collect web arbitrari order suit repositori support restart stream give client abil resum stream requir state inform stream continu maintain store repositori page miss deliv multipl time stream request extend includ request subset page page arbitrari order plan introduc order applic request deliveri order page page investig strategi combin stream request granular order improv data share client page identifi web page fundament logic unit manag import mechan modul uniqu refer specif page page identifi construct comput signatur checksum cyclic redund url page url multipl text string repres web page give rise signatur avoid normal url string deriv canon comput page identifi signatur canon detail url string normal execut remov protocol prefix present remov port number specif present port number specif server lower case remov trail slash result text string hash signatur comput yield page identifi hash function impli probabl good hash function larg space hash make occurr bit identifi million page probabl repositori bit identifi billion page probabl discuss deriv gener formula estim storag manag section discuss design storag manag modul store web page local facil access updat store page storag manag store latest version page retriev crawler goal store latest version page issu requir consist page referenc index remov repositori version page retriev crawler version temporarili index modifi requir impact function updat scheme defer discuss issu section storag manag free page longer exist web crawler explicitli page remov web storag manag ensur copi page period tradit garbag collect algorithm reclaim space discard object longer referenc inher assumpt data object object identifi differ aim object delet remot locat web similarli delet local copi storag manag associ numer valu page repositori lifetim lifetim count lifetim repres time page remain repositori refresh replac page crawl lifetim count set lifetim version page receiv lifetim count reset lifetim lifetim count page regularli decrement reflect amount time repositori storag manag run background process construct list url page lifetim count reach forward list attempt visit url crawl cycl url list page receiv crawler updat cycl remov repositori crawler unabl verifi exist possibl network page lifetim count set small ensur includ list time note crawler paramet decid period individu page crawl list provid storag manag addit page crawler intend visit storag manag distribut collect storag equip abil connect commun network node network regular coordin storag manag emploi central node manag server server maintain tabl paramet describ current state storag node paramet total storag occupi free space node extent fragment storag devic current state node state includ store state clear updat oper number outstand request page retriev type stream base node manag server alloc storag node servic request stream access schedul control integr crawl page repositori remaind section discuss design issu storag distribut page storag node organ page storag devic maximum effici stream random access updat mechan integr crawl page system page distribut node polici distribut page multipl storag node uniform storag node treat page assign node system hash page identifi signatur url section decid alloc page storag node storag node rang identifi page identifi fall rang hash distribut polici requir global index locat node page identifi locat global index fact interpret portion high order page identifi denot number storag node page belong uniform distribut polici requir global index map page identifi node page fix relationship page identifi uniform distribut polici simplifi addit storag node system requir form uniform distribut polici robust failur failur crawler provid handl alloc incom page remain node incom page fall fail special recoveri measur call organ page disk storag node capabl effici support page random page access subsect describ wai organ data node support organ organ defer analysi pro con method section describ experi aid comparison organ organ treat disk collect hash bucket bucket small read written back disk bucket store page alloc node identifi fall bucket rang note rang rang page identifi alloc storag node hash distribut polici section assum organ fix hash scheme bucket overflow handl separ alloc overflow bucket bucket success rang identifi assum physic continu disk overflow bucket assum page store order identifi note portion space alloc hash bucket occupi page rest free space fundament random page random page access support addit local index map page identifi physic locat straightforward identifi bucket read conduct search locat requir page stream request subset page node order stream support effici sequenti read bucket disk order physic transmit page client effect stream rate fraction maximum disk transfer fraction determin amount util space bucket page perform organ oper depend order page receiv crawler send page pure random page addit requir read relev disk write flush modifi bucket back disk space unwant page reclaim part process page receiv order page effici method mean send order page transmit storag bucket read batch page written disk addit simpl incom store page main memori bucket read memori merg incom disk oper amort page organ page organ base principl file system page receiv node simpli append end make process effici storag node maintain object larg log occupi space disk includ page alloc disk singl continu chunk catalog entri page present log typic catalog entri includ identifi page question pointer physic locat page log size page statu page delet semant state clear updat strategi timestamp denot time page ad repositori random access page local index map page identifi locat maintain typic network pc disk size averag web page number page log small leav resid disk assum disk access requir retriev entri index page page append end log assum catalog necessarili continu date batch mode page addit extrem effici involv success write contigu portion disk requir modif catalog buffer memori period flush disk page addit rate improv amount main memori buffer modif log space eventu remov unwant page page addit index updat random requir disk read index block retriev physic posit retriev actual page page stream order organ effici stream page log read sequenti note assum page log time stream addit disk access examin catalog discard page statu flag set updat scheme assum updat proce cycl crawler collect set incorpor metadata index built cycl begin period end crawl complet index older version page referenc exist retain ensur ongo page retriev access stream mode disrupt classifi page repositori class version page current activ newer version exist repositori class unchang page page version exist crawl time index built time latest crawl execut class includ page version page older version exist class page page receiv crawler crawl cycl class page note word compar copi page repositori retriev crawler latest find content chang treat fresh crawl web defin version page crawler retriev page repositori page treat crawl page version eventu replac origin version class repositori updat process consist receiv class page crawler add repositori rebuild index class class page delet class page system accept random page access request entir updat oper exchang order execut step class page retain index rebuilt batch updat method section oper manner batch updat briefli describ increment updat scheme section addit option full copi altern copi updat discuss strategi batch updat scheme updat storag node system partit set updat node read node crawl class page store updat node class class page store read node activ index set refer class class page request page retriev involv read node updat node involv receiv store page retriev crawler figur illustr flow data crawler set node batch updat process step batch updat system multicast modul stop accept stream request crawler finish ad class page updat disk queri system wait ongo stream transfer complet page class page transfer updat node read class page remov read node detail oper depend page organ scheme page distribut polici discuss exampl page transfer end section system class page store updat node remov crawler restart start popul updat node page read node stream index modul enabl index reconstruct extern request stream access accept provid involv access index index read node start accept random request figur batch updat strategi exact mechan transfer page updat read node depend page organ distribut polici set node organ polici illustr scenario transfer scenario organ hash distribut polici set assum updat node read node crawler comput identifi page obtain page quarter identifi rang store updat node page quarter node crawl cycl updat node alloc identifi rang send page read disk updat disk partit page read disk read disk receiv page updat disk sequenc step transfer page read node updat node construct list list identifi class page destin node read node receiv list page updat node comput cj denot list identifi page store cj directli scan repres set class page read node catalog entri page locat statu flag modifi read node compact mode reclaim space creat delet class page updat node begin transmit stream class page read node stream page destin receiv read node page read build local index support random access scenario organ hash distribut polici set node organ optim transfer page read node class class page present hash delet class page occupi separ perform conjunct addit class page step updat node read hash bucket memori order physic locat disk result page read order identifi page retriev updat node determin read node page transmit page read node begin receiv sort stream page updat node read node read hash bucket memori order physic locat disk execut involv incom sort stream page read disk part merg page arriv stream identifi page retriev prefer discard correspond replac class page class result merg output written disk modifi hash bucket figur illustr merg sort execut figur addit page merg sort advantag batch updat attract characterist batch updat scheme lack conflict oper execut repositori singl storag node deal page addit page retriev concurr properti physic locat page read node chang updat compact potenti chang physic part greatli simplifi state inform requir support restart stream increment updat scheme increment updat work read updat node node equal support updat access simultan crawler place crawl page node system long conform page distribut polici request page access mode involv node present system extract metadata construct index undertaken independ page repositori increment updat scheme capabl provid continu servic unlik batch updat isol system updat addit page repositori continu process place conjunct stream random access scheme make provid recent crawl page client stream random access mode metadata index page continu servic perform perform suffer conflict multipl simultan read updat oper perform penalti emploi uniform distribut polici node manag server balanc load node manag server detect set node busi respond number stream ensur addit page crawler place node page addit request redirect lightli load node requir dynam maintain local case increment updat scheme emploi conjunct page organ hole creat remov class page reclaim compact effect alter physic locat store page make dynam maintain local index map page identifi current physic address batch updat scheme physic locat page read node unalt success updat restart stream increment updat conjunct page state inform requir support restart stream physic locat page preserv bucket overflow turn case execut compact increment simpl state inform system suffic section present detail consist stream storag manag ensur set page receiv client part stream repres consist snapshot content instant stream request receiv client set class class page present repositori instant stream request receiv client stream receiv client request includ page mechan provid consist stream depend updat method page organ techniqu storag manag defin lifetim stream time interv initi invoc complet stream request page stream activ deliv page client instant continu stream stream activ lifetim deliv page entir durat exist restart stream page deliveri arbitrarili resum client number time lifetim lifetim restart stream consist sequenc altern activ inact period end activ repositori client state inform client present back repositori enabl resumpt present techniqu support type consist make assumpt restrict stream lifetim storag manag retain class page repositori long index refer page refer interv complet time success index rebuild phase metadata updat interv assum lifetim stream includ singl metadata updat interv activ stream node stream effici page constitut stream access predominantli sequenti disk read oper place restrict node read case batch updat support activ stream time impli node support continu stream support multipl restart stream long activ period restart stream overlap consist stream batch updat system batch updat index rebuild place end metadata updat interv batch updat interv set class class page physic locat remain unchang lifetim stream continu stream gener read page sequenti read node restart requir state inform consist pair valu repres uniqu identifi read node page transmit client repres identifi page consist stream increment updat system increment updat consist stream complic kind event place lifetim stream class page ad node stream page physic locat page chang issu easi resolv class page easili identifi timestamp inform class page younger timestamp time current activ index page elimin stream mechan address issu depend page organ method organ physic locat page chang compact support consist log treat consist number contigu chunk chunk compact individu compact schedul place chunk stream condit ensur sequenti read log result consist continu stream support restart addit requir compact perform preserv order page chunk easi state inform requir stream resumpt page identifi page deliv client interrupt resum page identifi local index node locat current physic locat easi page physic locat stream point onward organ physic locat page chang wai locat page hash bucket chang insert delet involv bucket locat page chang hash bucket overflow bucket rearrang part extens hash issu easili resolv restrict stream bucket boundari movement page bucket affect consist bucket small small number expect restrict major problem address movement page bucket identifi page movement potenti affect consist stream case continu stream assum node handl continu stream associ stream pointer node page movement affect stream consist cross current locat stream pointer maintain page displac tabl track page movement row tabl physic direct movement page direct movement page move locat stream pointer locat past stream page displac multipl final locat page rel initi locat determin tabl entri page page retriev check entri page displac tabl tabl reveal move past stream skip delet entri tabl stream pointer reach return tabl random access retriev stream page movement entri reason store physic locat page scheme work continu node maintain page displac tabl singl stream pointer scheme handl restart stream node support multipl restart maintain multipl page displac tabl tabl mainten overhead affect abil system scale larg number stream experi page identifi locat direct movement forward backward backward forward conduct experi compar perform design choic present section describ select result experi discuss system paramet influenc configur term updat page distribut page organ storag manag setup prototyp includ implement storag manag updat batch updat page distribut polici updat read hash distribut page organ method set organ storag manag fed page increment crawler retriev page rate approxim storag manag run network disk convent pc experi report cluster pc connect mbp ethernet debug data collect easier pc addit implement client modul crawler emul client modul send request random stream mode access receiv page read node crawler emul retriev store web page earlier version repositori transmit updat node control rate emul actual crawler provid flexibl control crawl interact actual web site storag manag implement top standard linux file system order conform oper system limit maximum file organ approxim creat collect individu log approxim mb node compar page distribut node organ conduct extens simul experi simul hardwar paramet select match prototyp hardwar verifi simul result scenario prototyp implement hash page simul predict prototyp chosen strategi perform result section tabl report perform actual prototyp perform metric compar system configur express term number page addit rate maximum rate system receiv page add repositori random page access random page access refer retriev page repositori identifi page random page access rate maximum rate request servic system stream refer rate page system retriev transmit specif transmiss order note perform metric basi enabl present result independ number node actual system system inher parallel oper impli page addit rate system page access simpli multipli number updat node read assum network bottleneck increment updat scale perfectli linear conflict oper batch updat addit perform metric batch updat time time repositori isol provid page access servic present select result set result illustr optim process carri tune node handl web data set result includ comparison page organ method section comparison system configur set result measur perform implement prototyp hash bucket size paramet node storag organ disk block memori buffer tune tune target type data expect relat scientif data characterist illustr section choic hash bucket size system emploi hash distribut polici page organ node choic good hash bucket size balanc conflict larg bucket lead longer io small bucket lead poor space util poor stream perform similar tradeoff exist node consid due space limit figur optim bucket size figur tradeoff begin arbitrari total number hash bucket system choic revisit total rang identifi space page hash bucket rang size sampl page exist collect million web assign page bucket base valu page identifi result averag page bucket denot sum size page alloc bucket result assign plot figur repres frequenc distribut express fraction total number bucket curv scale factor determin number bucket total page size rang kb distribut figur yield scale area curv roughli number bucket total page size kb rang roughli figur includ plot averag bucket access time function hash bucket size bucket ms read bucket hardwar hash bucket distribut determin number bucket requir overflow chain size number bucket requir overflow chain size hash bucket size shade region figur repres number bucket requir overflow chain size determin averag number bucket read overflow requir randomli read chosen bucket size perform comput choic hash bucket size obtain plot figur plot multipli yield plot depict variat random page access time function hash bucket size optim point plot repres balanc long overflow chain case small bucket high read time read larg bucket page averag hash bucket size kb give averag random page access time process repeat valu total number hash bucket system start valu averag number page calcul averag random page access time optim hash bucket size result comput summar plot figur plot show variat optim bucket size plot show variat random page access rate reciproc random page access point page bucket correspond initi scenario page divid point optim bucket page plot figur show expect space util function bucket size curv determin actual page size sampl million page combin curv design aid averag number page bucket organ quantifi tradeoff space util access rate web repositori bucket space util stream perform random access suffer depend requir web point spectrum chosen stress import real data distribut web page start node tune web repositori compar system section present select result simul simplic network assum network capabl handl traffic perform sole determin disk characterist disk access pattern system configur oper organ organ million bucket size occup bucket stream rate random page access rate page addit rate arriv random page addit rate random order page addit rate arriv sort tabl compar page organ method compar organ section node tabl compar organ singl system node page tightli pack node stream page faster node node local index random read page higher rate node append page higher rate node memori mb improv add rate node perform log observ improv buffer singl disk sweep updat hash page receiv sort order merg techniqu section improv page addit perform organ order magnitud result tabl suggest batch updat node support larg throughput read node support high read traffic achiev good perform read node page transfer updat node arriv sort order updat node difficulti gener sort stream suggest hybrid node organ updat call disk number larg singl log pure organ individu log typic mb size larger typic hash bucket updat node support random page larg size problem hash log file rang hash valu store page assign node page identifi fall rang page receiv crawler buffer memori extent append log buffer impact pure organ number log smaller number hash multipl incom page map log page written log amort cost disk seek page page addit requir write actual page page addit requir read page bucket write bucket back disk experi organ mb log memori buffer size mb provid page addit rate order magnitud support organ page transfer updat node read log read order hash rang sort result sort stream compar configur compar system requir notat easili refer specif configur adopt denot system increment updat polici distribut page organ method organ page node denot system batch updat polici organ method updat polici organ method read node system configur prototyp discuss section repres tabl present sampl perform result system configur batch updat emploi hash distribut page organ updat node experi assum page read node replac newer version updat process call updat ratio configur differ organ method emploi updat node center column page addit rate support singl updat node multipli entri number updat node total rate crawler deliv page column total time perform batch updat read repres time repositori unavail client organ updat balanc page addit rate reason batch updat time note parallel batch updat updat time depend number node pure determin updat ratio system configur batch batch batch tabl sampl perform result configur experi system perform page addit rate updat node batch updat time sec sec sec tabl summar result experi conduct directli prototyp prototyp emploi organ set exhibit impress perform stream page addit note result tabl includ network number lower predict tabl stream rate measur client page addit rate emul crawler stream rate read node page addit rate updat node batch updat time updat ratio random page access rate read node tabl perform prototyp figur plot variat batch updat time updat ratio prototyp updat ratio refer fraction page read node replac newer version prototyp system batch updat process stage scenario section figur show stage contribut batch updat time figur curv includ sum contribut stage repres updat ratio catalog page identifi construct requir compact requir sec page transfer requir domin compact page transfer hold updat ratio figur show time page transfer remain independ updat ratio updat ratio requir number updat node accommod larger number page receiv crawler page transfer oper updat node execut independ achiev perfect parallel page transfer time constant exhibit mark updat ratio higher updat class page leav smaller amount data move read node compact simul figur batch updat time prototyp discuss result present tabl deriv simul experi simul typic simul event execut logic base model specif page organ method specif oper page addit simul design mimic disk access pattern execut disk measur time requir perform oper figur architectur simul figur show architectur simul block label disk space realiz set file unix file system access log hash bucket simul term access file file larg requir constitut entir disk space ensur directori inform pertain file cach oper system ensur directori lookup affect simul result disk access modul capabl execut elementari disk oper list tabl organ higher level oper page addit page stream express sequenc elementari oper tabl elementari oper elementari oper paramet seek seek distanc fix variabl read size data read write size data written elementari oper paramet determin time execut oper hardwar tabl list paramet elementari oper notic paramet seek oper wai paramet seek distanc iter involv seek seek distanc uniformli distribut averag equal paramet tabl specifi notat denot system paramet valu chosen system paramet experi disk size gb gb bucket size kb size block kb memori buffer size size log hash log mb averag size web page kb averag space util buffer size disk oper kb updat ratio tabl system paramet tabl describ high level oper map sequenc elementari oper construct emploi simplif effect overflow bucket perform disk access requir retriev catalog inform size catalog typic size assum buffer memori elimin disk access sequenc number elementari oper paramet seek hash bucket variabl read bucket tabl random read organ sequenc number elementari oper paramet seek entri variabl read entri seek web page variabl read web page tabl random read organ sequenc number elementari oper paramet read web page tabl stream organ sequenc number elementari oper paramet read hash bucket sequenc number tabl stream organ read hash bucket retriev page averag elementari oper paramet seek hash bucket variabl read bucket seek begin hash bucket fix write back bucket data bucket tabl page addit organ ad random order sequenc number elementari oper paramet seek hash bucket variabl read bucket seek begin hash bucket fix write back modifi bucket tabl page addit organ ad random memori buffer buffer page memori buffer elev algorithm schedul disk access averag number page buffer assum hash bucket page destin uniformli distribut disk averag seek distanc step sequenc number elementari oper paramet read bucket seek begin hash bucket fix write back modifi bucket tabl page addit organ ad sort order hash note write oper step disk head begin bucket seek oper step number page ad oper sequenc number elementari oper paramet seek end log write set page log tabl page addit hash log system ad random memori buffer determin number buffer page assign proce buffer size averag number page buffer log size number log node page ad log total size page written singl log sequenc number elementari oper paramet write web page tabl page addit organ result simul oper discuss sequenc tabl execut multipl time execut time minut time execut oper calcul number iter time result summar tabl tabl correspond oper tabl number oper organ perform random read random read stream stream page addit random page addit random buffer multipl page page addit sort page addit random buffer multipl page multipl page page addit tabl result simul tabl explain entri tabl deriv valu list tabl notat denot column row tabl tabl updat ratio set tabl set oper organ organ million bucket size occup bucket stream rate random page access rate page addit rate arriv random page addit rate random order page addit rate arriv sort tabl explan tabl system configur batch page addit rate updat node maximum batch updat time number page ad read node batch batch tabl explan tabl summari number bucket read node number bucket read node wide spectrum system configur web strength weak choic configur influenc environ function requir factor influenc choic crawl requir random page access requir stream node comput power storag import continu servic environ includ configur perform poorli page suitabl continu servic essenti batch updat base scheme present paper applic tabl present summari rel perform system configur symbol spectrum valu favor favor perform metric system configur stream random page access page addit updat time incr incr incr batch batch batch batch tabl rel perform system configur relat work natur infer web search engin access web repositori proprietari specif search applic attempt function featur web architectur function effici number servic web repositori part system architectur repositori construct smaller scale restrict system user explor world wide web web structur support document comparison track set web page differ engin graphic visual tool top aid aid version repositori retriev store page explicitli request user size repositori typic smaller size target call search facil exist repositori web page emphasi actual index facil construct mainten repositori internet archiv project aim build digit librari preserv inform focu project address issu relev archiv preserv target client popul consist inform futur research focu architect web repositori act current sourc web inform larg number exist applic paper architectur structur larg share repositori web page argu construct repositori call judici applic exist techniqu discuss design storag manag detail present qualit analysi evalu option stage design prototyp develop base architectur section work implement increment storag index queri engin network oper implement queri interfac implement java plan implement experi advanc system configur present section plan develop advanc stream discuss section provid client control stream plan enhanc maintain histori web page provid tempor inform refer alexa altavista sergei brin larri anatomi hypertextu web search proc intl www april junghoo cho hector increment crawler evolut submit intl www crespo hector archiv storag digit acm confer digit june fred dougli thoma track view proc usenix technic januari fred thoma queri navig web proc intl www googl internet steve lawrenc lee access inform vol juli lyco mike combin search proc usenix technic jan mendel rosenblum john design implement file proc acm symposium oper system page yahoo
HCI/1172 4 mia ubiquit web inform system gerd bernd christian wolff institut ur universit koblenz rheinau germani abstract paper overview ai method techniqu develop build ubiquit web inform system method area machin logic knowledg system discuss context prototyp inform system mia mia web inform system mobil equip pda cellular phone gp devic cellular wap phone captur main issu ubiquit locat anytim inform access pda technolog introduct biggest chaotic unstructur sourc inform make amount inform ubiquit comput daili life great challeng hardwar issu wireless ubiquit solv wearabl comput integr pda telecommun major problem intellig inform extract www overwhelm mobil user document found offer short piec inform interest good inform system present address nearbi restaur retriev onlin web match prefer cuisin condit hold awar user react directli user present inform found user inform extract onlin web requir special prepar web page page special tag addit limit special web provid singl class web potenti web inform sourc aspect summar term ubiquit inform user locat contact inform system inform addit detail successfulli retriev inform develop method artif intellig machin logic knowledg system paper give overview ai method techniqu build ubiquit web inform system prototyp test method system mobil inform agent main intent paper show implement ubiquit web inform system ai techniqu suitabl solv emerg problem mia system mia base inform system retriev short fact web relev current citi user locat mia support user mobil user equip gp mobil phone mobil user equip wap capabl mobil phone pda stationari user pc standard mobil version mia monitor posit mobil user autonom updat subject search occur user travel search interest stationari mobil version posit user manual specifi citi retriev inform section organ section describ briefli basic compon mia detail introduct ai method spider agent section conclud section mia session architectur mia system separ basic compon mobil server system spider agent local agent user agent matchmak mobil agent server init request agent commun figur system architectur mobil mobil comput user equip estim geograph posit commun wirelessli server locat internet mobil phone develop mobil agent mobil phone wap support system wai inform current posit read user add posit manual autom geograph posit gp gp work close work place lot build inconveni user interest system popul area bad percept gp signal eleg overcom problem mobil phone connect inform determin posit user mia prototyp work gp support manual posit inform geograph coordin deliv gp devic resolv local agent track user estim nearbi citi gatewai core multiag base retriev system http protocol commun wml plain text page mobil depend document type request client output xml dynam gener transform request document type client core inform system consist interact agent current prototyp work agent user agent model local agent spider agent web search find inform relev current geograph posit regard interest user distinguish type inform search web topic extract topic web page inform relat user interest current citi restaur extract inform topic descript descript topic extract present profil web site structur figur profil configur gener specif mia method defin user profil captur hierarch structur structur plai import role spider section model topic constrain keyword list set constraint oper constraint defin topic restaur extract chosen predefin set due inform extract capabl mia prototyp support oper address extract mia user person profil consist topic figur show profil titl trip consist topic topic assign extract address user chang profil inform retriev user agent propag current user profil agent ai method intellig web inform retriev section overview artifici intellig base techniqu spider agent classifi extract inform web spider step inform retriev process find web page inform special topic contrast exist search approach search relev web page onlin call approach index web document due estim word frequenc build index determin relev web document relat page approach interpret www direct graph web page node hyperlink vertic label url text assum keyword start page found relev web page due keyword start start page find path node vertic label url vertex label path keyword keyword occur vertic label basic idea improv search site inform restaur follow path label edg link occur path introduc paramet keyword defin context radiu keyword similar cut search path depart occurr keyword occur kn label follow path paramet kn call defin approach set entri point set keyword start return link iff exist cycl free path node vertic connect wm label wm label kn kn wm label find path modifi search strategi mention keyword distanc paramet cost function similar standard inform search algorithm path link decid link set link nearest goal chose link path minim keyword distanc spider agent search keyword link follow path occur time link agent prefer follow web page classif ad text classif compon improv effect effici system web page provid spider algorithm address filter irrelev web speed system significantli effici inform extract compon inform facilit task extract inform web page inform extract agent extract address web page varieti method method address inform posit page addit inform inform extract compon make method classifi high confid qualiti web inform extract agent method method fail web page inform extract agent method simpli abandon page artifici neural network text classif network architectur chosen fulli connect network input hidden output node map web page input node select input node web page input node output node repres classif page page train output node set output node set recognit document put class output node higher activ neural network train offlin page page authent web page gather spider algorithm network train error longer declin independ set page page train set classifi correctli excel classif result partli due distribut web web page gather spider agent address posit recognit rate word give web page chosen select word word web page train set inform word distinguish page page address machin learn inform extract extract inform web page understand involv semant text analyz find relev inform recogn underli syntact linguist motiv attempt semant syntact fail web document make special text format annot string document recogn extract relev inform syntax base approach automat learn extract procedur similar approach machin learn techniqu automat wrapper construct extract assum special text part delimit mark begin end relev inform extract kei idea learn algorithm set extract web address set address list collect surround text part compon address learn gener pattern anchor combin learn pattern addit constraint result learn wrapper intend inform extract task illustr gener idea learn wrapper user read web page list relat instanc relat inform found list shown web page user determin instanc list instanc posit set exampl learn task find definit relat address exampl list address instanc relat address mean learn extract procedur extract instanc remain instanc present page task automat program synthesi build wrapper specif gener techniqu base combin method adopt area induct logic program detail reader refer major problem confront context mia lack exampl classifi unknown web page determin learn previou standard set learn wrapper user teacher exampl mia interact intend overcom problem develop learn algorithm deriv exampl mean knowledg techniqu model structur knowledg address logic kr languag queri knowledg base deriv exampl input modifi learner learn wrapper unknown page call approach learn meta exampl automat construct address techniqu show result mia session demonstr gener behavior function mia small imagin plan bit unsur citi visit journei interest address restaur offer chine cultur institut cinema home mia interest standard web browser interfac web browser instal pda start select figur pda result mia applic store pda activ profil mobil devic contact mia server cellular phone internet connect transmit current geograph posit preselect time interv user interact initi profil server retriev posit matchmak request mobil user extend matchmak decid initi user agent spider agent fulfil request agent activ inform user agent track locat search interest search interest defin chang move locat report user commun local agent local agent resolv geograph coordin nearest citi user agent inform activ spider agent perceiv spider agent start web page topic interest current citi drive nice town decid stai time time mia found select mia applic click button result user agent queri inform found activ spider agent result agent constantli listen request immedi task answer incom request result found return directli user agent final mobil user pda logic program base agent technolog kei issu mia architectur logic program languag agent agent commun languag techniqu agent control queri agent flexibl dynam initi assign agent handl matchmak special agent job match inform search inform provid agent track agent user task extend matchmak concept check simpl subsumpt techniqu incom request split handl activ agent techniqu spider agent prevent system agent search topic mobil agent matchmak user agent spider agent logic programm lookup spider agent figur agent commun function agent logic program program describ search web knowledg acquir agent ad uniform knowledg interfac base interfac base vide common inform exchang level type agent agent necessarili rule agent program activ agent receiv request actual basic task interrupt incom queri process rule agent program fire common defin uniform predic describ state inform acquir agent trust special servic logic queri interest point agent add knowledg form rule agent logic catch idea teach knowledg behavior agent agent fix set commun rule similar kqml queri inform trigger rule agent logic programm inform agent execut commun rule result consult matchmak agent type activ user userid agent commun directli activ agent matchmak initi call agent send initi command initi agent major advantag interrupt logic program base agent possibl provid anytim inform access agent ist found wait complet task interrupt basic task queri interfac base retriev result found send back work essenti mobil inform provid user anytim fast inform user send inform retriev request mia system queri send matchmak user agent ua user incom request interpret proof ua proof queri appli rule result execut commun rule result matchmak activ agent type spider user small assum spider agent activ user search address restaur interfac base consist address found knowledg queri result comput final ua fulfil proof oblig send answer mobil agent futur work show detail major ai logic machin learn system combin build ubiquit inform system gener agent architectur base interrupt logic program techniqu implement anytim info access present section gave short introduct exist palm gp system cellular phone build mobil comput unit provid locat anytim inform access wireless commun point problem gp posit estim inconveni prototyp setup consist separ devic lead futur plan import point capabl mia retriev inform unmodifi web page limit special search web inform system access upto date onlin inform describ ubiquit system mia citi inform system stationari user pc home futur work extend pure keyword base web search algorithm deduct reason process deriv relat term keyword ontolog constraint keyword list combin deduct ontolog base enrich retriev process domain specif knowledg topic restaur deduct resolv queri restaur french italian offlin train web page classif train network creat adapt agent onlin feedback extract agent adapt network web result extract teach input pattern neural network start work eleg overcom problem relat gp base local cellular phone inform cell connect cell area serv fix basi station telephon work inform basi station phone connect geograph posit basi determin posit user fairli accur high resolut gp harm high resolut gp resolut price map significantli lower resolut gp acknowledg work present paper fund land ur land ur und project intellig web inform agent refer chapter formal method reason mit heterogen agent system mit califf relat learn techniqu natur languag inform extract phd texa august cover thoma element inform theori mayfield softwar chapter kqml agent commun languag mit freitag machin learn inform extract inform domain phd comput scienc carnegi mellon novemb thoma unifi approach html wrapper learn intern confer discoveri decemb japan knight multidisciplinari survei acm comput march kushmerick wrapper induct inform extract phd lloyd foundat logic program muggleton raedt induct logic theori method journal logic plotkin automat method induct infer phd goebel comput logic approach oxford rumelhart mcclelland parallel distribut explor microstructur volum foundat mit thoma base learn inform extract workshop machin learn inform juli nation american confer artif intellig thoma logic program intellig web search intellig inform special methodolog intellig inform system editor multiag system mit wiederhold mediat architectur futur inform system ieee page march
Agents/1173 1 autonom agent june agent behavior concurr task abstract softwar agent subject research interrel field emphasi defin techniqu requir build practic agent system agent research refer defin task defin intern process agent interact agent relat intern process introduct agent research refer task perform role multiag system defin essenc task definit task critic defin complet behavior multiag system task defin type intern process agent interact agent relat intern process research coordin intern agent combin research develop tool build practic agent system develop multiag system engin methodolog defin multiag system term agent class organ defin organ term agent commun basic phase analysi design includ captur appli refin role design transform analysi model construct implement multiag system creat agent construct assembl agent system design present concurr analysi phase defin intern process commun role complet definit concurr task found concurr task defin agent behavior set concurr task task specifi singl thread control defin behavior agent integr interact typic concurr task defin role decid action necessarili agent import distinct talk agent specif behavior ideal case agent incorpor concept plan plan determin develop concurr task determin plan plan implement describ individu plan concurr task graphic scott deloach depart electr comput engin air forc institut technolog air forc ohio finit state automaton shown figur task start null transit start state assum start execut startup agent continu agent termin end state reach task receiv event initi transit assum reactiv start receipt messag continu ag list ag wait figur inform sourc task activ insid state function carri agent task execut concurr carri highlevel coordin intern event intern event pass task transit state commun extern messag receiv send receiv send retriev messag compon assum exist commun task interact environ read percept perform oper affect environ interact typic captur activ execut task state includ reason agent pure reflex reason decid action concurr task state transit state transit similar finit automata state transit transit syntax shown trigger trigger event receiv agent concurr guard boolean transmiss repres send event concurr task messag agent special event messag send receiv send event send messag agent syntax transit denot transmiss condit messag agent perform defin messag content syntax receiv event shown receiv event valid trigger syntax rule send event state activ repres intern read percept perform action effector multipl activ includ singl state perform sequenc task remain state activ process complet transit state enabl task type state goal concurr task defin behavior ty intern reason process agent interact intern process extern agent base semant present previou categor task life span type task life persist transient persist task task null transit start state state event initi execut assum persist task start agent initi continu agent task termin transient task specif trigger transit start state transient task execut agent wait trigger receiv agent transient concurr execut task type task heterogen reactiv task idl state wait trigger event start transient task start execut event proactiv task idl state transient continu gener request agent task heterogen combin reactiv proactiv task heterogen task idl start idl state gener request agent task enter idl state base task categor agent behavior defin task proactiv reactiv proactiv agent agent proactiv heterogen task reactiv agent agent task reactiv relat work work concurr task model stem work origin harel statechart basi state diagram current object orient model languag statechart complex languag support condit event input output basic differ concurr task statechart abil defin event activ insid state concurr task concurr task similar graph agent coordin approach model behavior coordin multiag system petri bric formal petri net make parallel task agent train difficult understand concurr task central behavior model analysi phase multiag system engin methodolog analyz system set role system design lead natur definit agent coordin action solv system goal futur work mase concurr task includ automat transform behavior model concurr task concret eventu sourc code concurr task part analyz design number medium size multiag system rang inform distribut immun control system autonom air vehicl acknowledg air forc offic scientif research sponsor research view express articl author reflect offici polici posit unit state air depart govern refer develop multiag system agenttool seventh intern workshop agent languag juli agent behavior concurr defin behavior social agent technic air forc institut juli introduct distribut artifici intellig addison weslei model reactiv system approach york visual agent enhanc graph agent design analysi intern confer multiag page aaai overview multiag system engin methodolog intern workshop softwar engin limerick june
Agents/1174 1 distanc vector rout john armin depart comput scienc north texa texa usa abstract mobil agent varieti applic distanc vector rout applic bene approach shown network resourc overhead due larg number messag gener rout updat process messag wast contribut rout discoveri process number messag bound number agent system present solut describ agent migrat strategi improv perform rout discoveri random walk structur walk introduct process select commun path data import aspect commun network ect characterist network perform convent rout algorithm base shortest path rout distanc vector rout link state rout paper distanc vector rout asynchron complet distribut rout algorithm implement rip inform wide network easili con gure maintain shown larg number updat messag exchang adjac node network constitut resourc overhead overhead due fact messag ect rout discoveri process reduc resourc overhead algorithm deploi wide rang network requir simpl rout protocol due limit avail resourc motiv reduc resourc overhead recent develop ant rout implement paradigm distanc vector rout develop softwar intellig mobil softbot describ concept mobil comput mobil code john armin mobil agent paradigm attract attent eld comput scienc appeal mobil agent mobil agent roam internet search meet interact agent roam network remain bound machin agent increasingli wide varieti rang compar small system complex real time system agent paradigm er rich repertoir featur lend formul solut comput problem larg distribut infrastructur type knowledg paramet essenti make ration load balanc network rout typic exampl applic ecient rout packet larg commun constitu network node requir topolog inform gener rout map rout tabl section overview overview di erent agent movement strategi tool simul network environ present section section detail analysi experi result section summari paper scope futur work respect util agent distribut network agent distanc vector rout algorithm exchang metric repres distanc node destin distanc gener concept includ limit transmiss delai monetari cost resourc reserv send secur level reliabl measur implement inform exchang adjac node form trigger initi chang rout tabl neighbor node receiv updat inform neighbor node updat rout tabl adjac repres metric rout node node repres cost link node node node receiv neighbor comput integr rout tabl rout tabl propag chang turn perform algorithm updat rout tabl sequenc updat messag node entir network messag activ convent escal consum signi amount network number messag bound number constitu agent network lectur note comput scienc select current rout tabl select adjac node perform migrat fig agent behavior exchang metric process rout discoveri move node agent rout discoveri manifest movement agent carri rout inform node propag individu updat messag agent formal agent id migrat node node carri rout tabl migrat strategi move adjac node agent start arbitrari node migrat adjac node shown figur arriv node agent updat rout tabl base carri agent entri base perform frequent compar agent select migrat adjac node migrat strategi agent migrat strategi shown previou section agent migrat establish rout pair node network distribut ecienc term rout migrat strategi agent import agent migrat strategi sever affect perform demonstr fact node ring graph shown figur migrat migrat node agent select node pool node adjac random agent refrain direct strategi assum node bene consecut visit strategi avoid loop immedi adjac node introduc indirect loop agent forc loop step step converg figur deploi scheme network topolog unnecessari loop degrad perform migrat strategi john armin distanc tabl converg fig migrat strategi chosen sever side ect agent migrat formal rw strategi migrat node node function select di erent agent migrat strategi formul chang paper migrat random walk rw structur walk sw random walk rw agent migrat strategi random function select adjac node pool node immedi adjac random walk migrat strategi due simplic shown due probabilist random walk visit node edg nite network system converg structur walk movement strategi exhibit determinist behavior base congest topolog past visit structur walk sw function select node migrat sati es condit minim maxim criteria structur walk repres frequenc node visit agent ecienc structur walk depend calcul node describ di erent wai calcul base visit visit edg combin select criterion node number node refer structur walk node visit node agent increment visit count node time migrat agent node agent select adjac node adjac node agent select random scheme reli assumpt node fewer visit discov rout visit select criteria edg edg refer structur walk edg agent undirect edg connect node increment visit count xy time migrat node agent select adjac node connect edg minimum yz yi lectur note comput scienc adjac multipl resolv random structur walk node improv rout agent move node unvisit visit rout discoveri involv nding shortest path node import explor path make bene cial edg walk network combin mention method refer structur walk strategi slight modi cation structur walk edg agent node increment respect visit count time migrat node agent select adjac node sum visit count node visit count connect edg yz minimum formal express yz adjac structur walk aid multipl agent coordin action network structur walk experi conduct part analysi design describ simul environ present result experi experi focuss provid compar analysi simul result agent rudimentari intellig bring network state evid singl agent system bring network system advantag parallel improv pattern design smarter agent improv care agent migrat strategi perform analysi base connect state network node network discov node converg state network node optim path node messag ecienc proport messag updat rout tabl tool investig properti agent event driven simul graph gener construct simul base objectori paradigm includ method method singl agent john armin simul depict figur simul simul engin schedul dispatch event graph object suppli global view vertic edg vertex rout tabl method edg physic link vertic link cost agent singl agent method event edg agent wrapper object facilit commun respect object simul fig simul model network repres graph gener graph gener graph gener construct undirect graph node random seed input graph gener step process graph gener build random span tree jv edg shown figur line ensur graph connect add random edg fu make edg total featur control averag node detail featur graph gener scope paper experi experi made underli assumpt assum network edg node ad delet analysi cover perform network converg rout tabl result experi address link node failur scope paper discuss lectur note comput scienc fg randomli chosen vertex fvg fvg random random vertex fvg fvg vg vg vg random edg fig graph gener algorithm simul trigger updat time updat resourc overhead reduc perform agent popul assum static experi base type medium larg small network medium size network node larg network node densiti network de ned number link network number bidirect link jej closer graph link closer jv simul basi network network densiti simul type agent updat rout tabl lower cost destin updat bring rout tabl closer converg reduc compar concurr bound number constitu agent figur compar converg pattern di erent number agent initi converg explain fact broadcast messag neighbor mark migrat agent restrict parallel number agent network initi converg rate proport number agent observ agent slow initi intellig migrat strategi import aspect converg agent popul number agent dictat parallel larg number agent exhibit perform john armin sourc overhead size agent popul perform resourc overhead constitut tradeo carefulli balanc select agent popul characterist perform long converg tail tail due fact small number node network converg rout tabl ect cost deviat optim agent migrat node network converg size converg tail proport number agent network realist network total rout cost exhibit uctuat larger rout discoveri plai import role network perform respect fault toler crucial evalu rout algorithm respect speed rout node obtain figur depict progress identifi rout network rout discoveri process improv number agent exploit concurr mention paper aim reduc messag overhead incur larg number messag gener attribut highli concurr complet asynchron behavior number messag network bound number constitu agent figur compar messag ecienc approach proport ectiv messag signi cantli higher compar suitabl wireless low resourc avail reduc concurr reduc perform migrat strategi improv messag achiev superior perform agent number node shown figur agent migrat strategi side ect delai converg random walk structur appli di erent class applic shown scheme yield compar structur walk outperform random walk migrat respect rate rout discoveri figur structur walk network earli rout discoveri crucial random walk applic system requir simpl implement summari futur work paradigm distanc vector rout scheme intellig mobil agent principl carrier updat messag transmit router rout comput major disadvantag convent implement distanc vector rout algorithm resourc overhead gener unbound overhead due updat messag lectur note comput scienc time agent agent agent agent agent agent converg time agent agent agent agent agent agent rout discoveri time total messag messag total messag messag messag ecienc time random walk structur walk migrat strategi fig simul result node network size network messag replac popul agent overhead bound number agent limit number agent order control resourc concurr algorithm emploi restrict conduct number experi analyz perform distanc vector rout scheme agent migrat agent converg rout discoveri messag ecienc paper introduc concept structur walk agent util speci runtim inform migrat larg part network ecient provid demonstr signi canc migrat strategi rout tabl converg number carefulli design shown quantit improv rout discoveri john armin cost converg number agent constitu agent popul converg rate rout compar convent implement distanc vector rout quanti ed compar messag ecienc ongo research fault toler rout dynam tackl count niti exploit dynam agent popul issu discuss scope paper futur public refer rout rout commun page prentic di caro distribut stigmerget control commun technic report universit de public journal arti cial intellig research bertseka data englewood cli ross comput top approach featur rfc kramer cooper mobil agent map hungarian nation confer agent base kramer cooper mobil agent dynam network softwar agent futur commun isbn motwani raghavan random algorithm cambridg mechan rout cisco press datta random mobil agent base rout wireless network understand code ieee tran eng bradshaw softwar agent aaai menlo mit press wong approach simul larg commun network journal system softwar volum
AI/1175 2 sensor fault detect identif mobil robot georg bekei depart comput scienc institut robot intellig system southern california lo ca abstract multipl model adapt estim detect identifi sensor failur mobil robot estim kalman filter specif failur model filter bank filter nomin model filter residu postprocess produc probabilist interpret oper system output system time confid correct model addit featur standard assumpt measur common relax measur assum asynchron vari frequenc difficult case soft sensor failur handl successfulli system architectur present gener problem failur detect identif mobil robot algorithm demonstr pioneer robot case sensor failur introduct failur detect identif import problem develop robust mobil robot paper present applic techniqu call multipl model adapt estim case problem mobil robot appli techniqu independ sensor failur failur hard sensor assum stuck measur subsequ failur consid work support part caltech contract darpa contract contact author correspond paper fault failur synonym work soft sensor degrad qualiti complet useless recogn soft failur occur condit probabl comput hard case unsolv problem estim profil case failur note soft failur identifi sensor albeit confid kalman filter techniqu state paramet estim estim procedur sequenti measur data set prior knowledg state improv step prior state estim data subsequ state estim bank kalman filter pioneer parallel structur estim order estim sampl stochast process subsequ al bank kalman filter provid state estim equal number provid control oper regim aircraft estim reli set system equat linear oper point al techniqu adapt control control aircraft work al multipl model adapt estim techniqu reliabl detect identifi sensor actuat failur aircraft frequent assumpt literatur sensor measur constant frequenc experi report restrict lift sequenti process proof detail recent year kalman filter base local common practic robot literatur techniqu reli bank kalman filter natur appli fault figur pioneer detect identif mobil robot system import aspect method analyt redund form system model hardwar redund replic hardwar identifi kalman filter base framework measur dispar call measur sensor valu valu predict model filter residu filter updat estim excel indic failur demonstr fact sensor failur exampl earlier work appli mobil due network adapt virtual sensor maintain reliabl perform walk robot actuat comput author investig techniqu redund set control strategi previou work appli case mechan failur board mobil robot due al section robot model section gener fault toler architectur includ detail approach section result section conclud summari discuss ongo futur research robot model pioneer experi wheel robot shown figur front wheel actuat independ enabl differenti steer rear wheel passiv kinemat pioneer equat wheel pioneer posit encod gyro measur yaw rate robot vl vr figur robot kinemat oe vl tot vr vl radii left wheel yaw rate robot plane denot oe rotat speed left wheel denot linear speed left wheel denot vr kinemat quantiti shown figur basic idea approach work fault detect process residu signatur kalman filter fault identif filter respond match failur minim measur residu maxim experi report measur vector rotat speed left wheel yaw rate measur gyro estim measur vector denot actual measur sensor denot residu vector denot filter develop work kinemat equat measur shown equat fault toler architectur architectur depict pictori figur thrust current work fault detect identif modul bold part figur control modul part futur work stage approach detect fault result present threshold residu suffici detect fault identif requir residu failur detect modul failur modul bank kalman filter kf kf kf ij detect failur input command plant sensor control modul ij ij ij ij state estim desir state figur failur detect identif postprocess hypothesi condit probabl comput bank kalman filter shown figur label pair number number order pair filter set kinemat system equat filter filter experi report share robot kinemat entri unequ filter kinemat equat system gener applic method cover case failur chang kinemat equat robot filter produc residu ij nomin model result residu residu vector fed fd fi modul output fd modul signal notifi failur true fi modul activ fd modul stai activ failur detect case failur spontan disappear failur small portion scheme bank implement scheme kei insight bank estim fault depend select state estim minim residu estim assum sound knowledg system incorpor failur effect structur modul high qualiti estim control modul grace degrad system robust expect scheme addit knowledg expect failur capabl deal scenario scheme consid catastroph stage process shown figur label control stage deal modifi control structur robot continu function fault occur failur identif accomplish hypothesi test residu case residu nomin model fail form hypothesi system oper nomin hypothesi gyro measur yaw rate degrad profil chang hypothesi hard failur gyro model fault fourth hypothesi left wheel encod robot suffer hard failur model hard failur model paramet sensor matrix soft failur model paramet sensor covari matrix comput condit densiti function measur time failur occur measur histori rk rk vector paramet specif failur coeffici fi fi js dimens measur covari residu time shown achiev fast failur set fi successfulli test approach fi case sensor failur consid step determin condit probabl probabl denot probabl comput condit probabl fault occur measur vector sequenc iter formula note maximum artifici minimum minimum ensur failur hypothesi weak influenc subsequ futur condit probabl evalu quickli express updat condit probabl make assumpt measur case hypothesi left wheel encod suffer hard failur time instanc data encod updat condit probabl idea inform encod gyro measur posteriori probabl encod fail consid priori probabl term weight suitabl ensur time point worth mention due fi elimin priori probabl sum relax restrict interest rel valu absolut evid calcul posteriori probabl probabl hypothesi forc close rest probabl forc stai close due equat posteriori probabl sum valid case singl failur occur result experi report fault consid filter filter bank process data stream robot sensor transit nomin behavior faulti behavior figur show case failur top case soft gyro failur case gyro characterist assum degrad standard deviat factor time nomin condit probabl respond sharpli soft failur condit probabl rise sharpli soft failur occur level calcul middl figur show case hard gyro failur assum gyro stuck fix time nomin condit probabl respond degrad sharpli small interv time soft hard gyro failur respond posit expect system immedi decid failur due chang characterist due constant bia sampl larger time system calcul condit probabl appropri ultim hard gyro failur condit probabl satur expect soft gyro failur condit probabl decai back bottom figur show case hard encod failur left wheel robot encod left wheel stuck fix time nomin model condit probabl decai rapidli hard encod failur filter rise note case posit identif occur case system detect correctli identifi failur time note soft gyro failur assum specif noisi degrad gyro data standard deviat gyro measur practic priori exact profil degrad figur show case soft gyro failur degrad factor standard figur show system correctli detect identifi slower time preliminari evid system robust function soft failur regim futur work paper present multipl model adapt estim base techniqu sensor failur detect identif board mobil robot evid present show techniqu work failur implement measur sensor asynchron time nomin figur soft gyro failur accur slow frequenc soft gyro failur standard correctli identifi system onlin estim correct time failur identif preserv valid state estim updat confid level present treatment bia gyro measur treat hard failur futur plan incorpor exist model gyro drift system convert case soft failur case inform gyro discard present futur research aim understand soft failur mode extens sensor failur applic work part larger research effort seek detect identifi common failur mobil robot reconfigur system identif end futur work includ research actuat mechan failur diagnosi recoveri acknowledg author mohan mohan data collect author discuss refer stochast control aircraft multipl model adapt control part equilibrium flight ieee transact automat octob inerti navig system mobil robot ieee transact robot januari ferrel failur recognit fault toler autonom robot adapt failur detect dynam system model error aiaa journal control kalman approach linear filter predict problem asm journal basic optim adapt estim sampl stochast process ieee transact automat stochast estim volum academ perform enhanc multipl model adapt estim ieee transact aerospac electron octob multipl model adapt control failur confer page decemb identif varianc adapt kalman filter transact automat april failur detect vista multipl model adapt estim ieee transact aerospac electron octob rosenblatt robust approach autonom control journal appli bekei extend kalman filter frequent local infrequ global sensor data fusion spie intern symposium intellig system advanc octob bekei fault detect identif mobil robot estim proc ieee intern confer robot page advanc control volum chapter page academ dynam fault detect threshold robot manipul ieee intern confer robot page time nomin time nomin time nomin figur figur show trace nomin filter condit probabl start close case failur nomin probabl declin condit probabl rise figur top show case soft gyro middl figur show case hard gyro failur bottom figur show hard encod failur case
DB/1176 3 extract colloc text corpora lin depart comput scienc canada abstract colloc habitu word combin colloc knowledg essenti task natur languag process present method extract colloc text corpora comparison susann show high broad coverag achiev method describ applic automat extract colloc comput word similar introduct colloc habitu word fall colloc idiosyncrat unpredict syntact semant featur synonym modifi argu mean word determin larg extent colloc pattern colloc knowledg essenti natur languag process task basi lexic item gener restrict sentenc select tree forest return parser show perform statist parser improv lexic implicitli captur colloc relationship word word colloc featur automat discov similar noun noun colloc knowledg vital import languag acquisit due idiosyncrat word colloc account mistak made languag learner obviou import colloc manual compil dictionari present method extract colloc text corpora goal achiev broad coverag high colloc extract broad coverag requir pose challeng compar previou approach colloc colloc necessarili occur time moder larg corpu corpu wall street journal san jose mercuri phrase occur baggag occur order achiev colloc extract occur time corpu remaind review relat work describ extract step includ collect depend automat correct frequenc count extract filter tripl mutual inform result colloc compar susann corpu present applic extract colloc comput word similar relat work present method extract consecut word sequenc length colloc involv word separ class action emploi mutual inform extract pair word tend window overcom limit word extract pair word directli relat word narrow window directli doctor work hospit hospit tra doctor highest rank colloc avoid problem rel posit word account word narrow spread higher gener method extract colloc involv word concern extract semant relationship machin readabl dictionari problem assign weight extract semant relationship similar rank extract colloc fit exponenti observ estim joint probabl event extract colloc knowledg similar parser extract depend tripl text corpu depend tripl consist depend type modifi tripl extract sentenc brown identifi depend type explain tabl text corpu consist wall street journal san jose mercuri step reduc number error corpu sentenc word fed parser complet includ corpu million word text corpu hour pentium memori million word tree tabl depend type label relationship noun determin noun modifi noun nomin modifi verb noun object verb subject verb modifi automat correct parser mistak effort obtain global parser make poor local wrong part speech lexic ambigu word problem acut parser lexicon deriv lexic tend includ obscur word usag lexicon deriv syntact featur wordnet word verb noun wordnet sentenc noun parser verb noun noun modifi noun noun subject verb depend relationship chosen tree depend fit rest sentenc parser gener correct depend tripl incorrect make automat correct frequenc count set correct rule correct rule consist threshold pair depend type rel potenti exampl pair includ rel found corpu ratio frequenc count greater lower frequenc count ad higher frequenc count reset occurr relationship occurr relationship frequenc count frequenc count reduc exist pair word relat type relationship modif relationship type depend dispar frequenc smaller occurr occurr draft found pair word corpu type depend relationship correct rule modifi frequenc count tripl manual examin randomli select correct found correct correct weed coincid discuss mutual inform separ colloc depend tripl occur coincid depend tripl regard randomli select word randomli select depend type randomli select word mutual inform compar observ number number predict default model invari make independ assumpt mutual inform tripl defin log definit assum depend tripl event independ case part speech word tripl determin type depend relat rel noun determin make reason independ assum independ bayesian network repres independ assumpt independ assumpt made shown figur figur default probabilist model depend tripl mutual inform calcul log probabl formula estim frequenc depend tripl problem probabl observ rare event probabl unobserv rare event adjust frequenc count constant kw kw kw denot frequenc count corpu wild card sum word relat type denot total frequenc count depend tripl relat type rel tabl show top object rank mutual inform adjust kw tripl occur demot tabl top object adjust adjust hard tap water tap water tea hard tea decaf mix drink beer milk alcohol diet alcohol ic tea mutual inform evalu show term bank evalu coverag term extract program coverag difficult measur classic refer term havent term bank recent colloc score evalu indirectli tree select merit measur associ strength judg differ make recal parser output stage syntact tag assign extract word evalu lexicograph evalu type susann corpu tree text brown corpu american english text evenli distribut brown genr press bell scholarli adventur western fiction convert constitu tree susann corpu depend tree extract depend tripl belong occur categori recur tripl retriev extract colloc rel rel tripl rel classifi correct rel rel classifi rel incorrect parser classifi addit susann corpu tripl modifi extract colloc includ incorrect tripl object susann corpu tripl modifi extract colloc includ addit tripl np subject defin coverag percentag recur depend tripl susann corpu found extract term highest due human abil gener sentenc coverag tabl show result genr susann corpu row number distinct depend tripl occur susann corpu paper coverag genr higher tabl evalu susann corpu recur correct incorrect addit coverag word similar view colloc word particip featur word featur featur word featur includ extract colloc retriev featur word tabl show subset featur row correspond featur column mean word featur featur possess noun subject corpu featur possess noun modifi corpu tabl featur featur duti sanction log similar word comput featur similar measur adopt base similar object defin amount inform common object divid amount inform descript object denot set featur possess similar word defin amount inform set featur assum featur independ log probabl featur estim percentag word featur set word part speech distinct noun subject probabl probabl featur noun modifi amount inform featur larger amount inform intuit word modifi inform word subject column titl log tabl show amount inform featur featur tabl featur similar duti sanction similar word identifi program posit sanction oblig fee post job role tax penalti condit function assign power task deadlin train work standard restrict author commit award requir staff limit mission care titl capabl patrol fine faith seat levi violat load salari attitud bonu schedul instruct rank personnel worth presid word includ list word pair respect nearest neighbor similar word program found pair rnn noun occur time corpu tabl show rnn list rnn strikingli good question pair peculiar glanc detail examin reveal reason rank pair manual creat thesauru examin occurr san jose mercuri corpu found refer western futur work present method extract word colloc text corpu broad coverag parser advantag fact parser produc correct incorrect automat correct parser mistak realist probabilist model calcul mutual inform comparison susann corpu show high broad coverag achiev method present applic extract colloc comput word similar result show semant similar word captur syntact colloc pattern word colloc defin depend relationship word occur significantli frequent chanc extend work deal colloc adopt similar strategi deal tabl respect nearest neighbor rank respect nearest neighbor similar earn profit revenu sale acquisit merger attornei lawyer data inform amount number fear worri jacket shirt film movi import reaction tournament consequ implic dinner lunch biggest largest blaze fire western cloth comment elabor disadvantag drawback neglig emiss pollut marbl matern psychologist door window therapi stimulu procur zone audit silk comment oliv distanc length interrupt ocean sea fly watch spectrum poker camp ski lip mouth mount reduc tablet nation bone flesh start colloc extract colloc high frequenc treat extract extend set tripl involv algorithm colloc collect filter extend set tripl acknowledg author anonym review valuabl comment research partial support nserc research grant refer david carter train scale prefer function disambigu comput decemb needl haystack locat interest colloc express larg textual riao confer text imag march kenneth church patrick hank word associ mutual lexicographi comput march collin lexic model statist annual meet associ comput page juli ralph grishman john sterl gener automat gener select pattern page japan harri mathemat structur languag york marti hearst gregori grefenstett method refin lexic relat carl natur languag program number technic report aaai press donald noun classif structur page june leed lexic function languag learn east european lin syntact depend local context resolv word ambigu page juli georg miller lexic intern journal pearl probabilist reason intellig network plausibl infer morgan kaufmann san california stephen richardson determin similar infer relat lexic knowledg base phd citi york geoffrei english comput oxford press frank retriev colloc comput
IR/1177 5 version virtual special report serg depart artifici intellig cognit scienc de bp cedex franc abstract main issu web applic requir larg repositori creat adapt web applic repositori requir method facilit web applic creation manag ensur share exchang data virtual document deal issu interest adapt virtual document web applic provid read strategi reader applic author enabl document content organ consist wai read strategi content semant coher convei mean reader repres knowledg level gener web document ensur reader share adapt virtual document comput fly mean semant composit engin document structur instanc narr structur repres read strategi node content link run intellig search engin semant metadata reli semant web user model focu semant composit engin enabl comput fly web document project main goal assist journalist build adapt special report person reusabl central issu deliv adapt special report keyword semant composit semant virtual version introduct numer applic web todai size volum problem solv support digit inform virtual ebusi digit newspap current applic world wide larg distribut inform repositori convei larg amount knowledg internet user compani owner knowledg main issu web applic adapt web applic abil deal enhanc usabl deal larg repositori adapt web applic call adapt hypermedia system provid kind navig tool creat adapt web applic repositori requir method facilit web applic creation manag share exchang data notion flexibl hypermedia virtual document lead method facilit web applic design mainten virtual document document persist state exist instanc gener run virtual document grown interact individu web virtual document adapt hypermedia close relat view face coin share exchang requir search engin inform access present sever limit recal intellig search reli semant web initi semant overcom limit interest adapt virtual document web applic provid read strategi reader applic author enabl document content organ consist wai author read strategi content organ relat ensur focu organ call narr structur reader abil recogn unconsci structur scientif special report distinct narr structur narr structur implicit print digit skill repres knowledg level share gener web document dynam enhanc reader narr structur document structur declar descript web document web document comput fly mean semant composit engin document structur instanc narr structur repres read strategi node content substitut run intellig search semant user model author tool provid creat narr content associ metadata numer web site offer tool user person inform space present project aim suppli person web site sistemi project aim filter displai prefer characterist system select relev set interest probabl rule appli relev present singl full imag person filter process present select planet kind privat newspap reader writer group collect process send result interest reader tool order articl fill inform reader suppli advanc interfac search document annot academ queri interfac ontolog write queri system annot queri user find relev person consist filter process base user queri ontolog annot person base filter process prefer select relev project aim deliv adapt special report reader consist set select author semant structur organ semant structur provid read strategi reader read strategi collect semant coher convei mean reader mean view viewpoint collect read strategi creat author system read strategi content adapt version reusabl main issu virtual document focu semant composit engin enabl comput fly special report project main goal assist journalist build adapt special report person reusabl central issu deliv special report present context journal report web project give summari architectur semant composit engin present manag revisit version dynam document context composit engin adapt polici present direct futur project acronym integr cooper comput assist report system join project sme call region daili newspap call le fund region council prototyp comput assist report system main goal assist journalist creat adapt special report document includ audio video longer limit size due internet numer web site offer suffici filter deliveri servic provid servic inform special report repres task special report offer synthesi develop view organ collect articl offer viewpoint event matter journalist creat type document digit special report special report synthesi made journalist instanc race special report collect articl narr structur paper singl organ sequenc page page layout digit special report natur offer narr structur featur digit special report provid servic reader present read strategi singl special reusabl adapt import notic print journalist set articl belong special report digit special report find articl journalist provid reader notion read strategi special set articl read author viewpoint call sequenc articl read strategi distinguish kind read author narr structur design writer present angl set articl main role journalist event report consist synthet narr structur node semant relationship node span text relationship belong analyz rhetor structur theori rst defin relat span span role insid relat relat defin constraint combin nucleu effect reader find interpret reader document structur comput goal base histori topic criteria domain model organ access articl structur deliv comput fly control comput gener structur journalist awar structur associ metadata articl special report servic special report view digit view logic view specif structur semant structur document convei organ mean content document view fit semant level semant web architectur repres ontolog ontolog model type fragment relationship fragment interview volit fragment underli relationship repres syntact structur interview analysi type fragment interview satellit analysi nucleu rhetor relat relat orient encod read guid fragment understood fragment read interest show type relat reader explan logic structur reflect syntact organ document document book broken compon broken compon figur turn document view logic view fit syntact level semant web architectur logic structur encod xml view describ document devic physic structur describ size colour view process xslt processor transform xml document html document view web browser process java engin comput xml document present web browser print view intertwin separ straightforward map semant logic paragraph correspond mean logic physic structur close relat physic structur encod logic structur section element present semant structur implicit analyz recogn reader kei issu reader digit view repres manag reusabl import journalist articl part special report special report report articl part special report gener concern topic watter semant web commun argu reusabl fragment special report part lead associ metadata fragment narr structur special report enrich special report updat journalist add articl base modifi organ order insert articl journalist organ subset articl order develop viewpoint enrich import possibl digit order disturb system rebuild special version report enrich lead manag version special report digit special report type web site good candid adapt digit document manag syntact adapt place level content document structur adapt reader knowledg goal syntact logic structur chosen fit user layout present adapt current devic user stereotyp deal version due enrich person involv annot document ad visit virtual document special report journalist organ set articl read prepar special report relev reader specif devic give definit virtual document virtual document consist set inform ontolog semant composit engin select relev inform assembl organ strategi user goal adapt visibl aspect document deliv user fragment atom abstract inform unit atom abstract inform unit fragment articl atom special report abstract special report read strategi model figur order facilit prefix element special report model set articl select author explicitli order defin relev inform space narr structur read strategi element journalist consid relev special creat user access document readi deliv reader organ read strategi collect root abstract exist insid link semant relat belong rst relationship organ structur sourc nucleu rst destin satellit rst basi build narr structur node categori fragment rst journalist relat futur set relationship narr structur special report kind inform retriev servic descript author order send queri intellig inform broker user model filter small set answer deliv relev articl graph node vertic relat compon special report gener provid special report templat reusabl concern templat instanc special report model case structur super oil begin includ semant structur rn rhetor relat begin fig model special report includ semant structur special report model input semant composit engin comput special report reader semant composit engin architectur semant composit engin reli ontobrok ontolog manag intellig search engin ontobrok knowledg manag engin filter inform retriev larg amount data model specif ontolog ontobrok ontolog fact close relat ontolog domain ontolog repres metadata ontolog inform level describ index structur user ontolog defin stereotyp individu featur special report ontolog repres compet creat special report domain ontolog defin share vocabulari metadata schema content descript data semant composit engin document user inform retriev tool user difficulti defin easier recogn requir inform domain model view semant composit engin architectur fig special report model semant structur logic structur physic structur semant composit adapt special report xml page templat logic composit special report ontolog user ontolog domain ontolog metadata ontolog ontobrok xml web page layout page templat physic composit data base meta data fig semant composit engin architectur user behaviour main idea notion semant composit engin declar task interact semant composit engin semant composit manag semant structur special report model defin user adapt special report select logic composit comput xml web page user adapt special report physic composit comput current web page layout xml structur architectur base project project network distribut learn european project semant read main role semant composit defin special report content adapt chosen structur user specif content fragment select relev set articl consid special report subset metadata entri content specif author tool defin variant fragment adapt polici special report structur hidden activ level articl dedic specif activ level knowledg semant composit produc user adapt special report user document content specif user model logic logic composit aim comput xml page content navig tool access fragment special mean templat web repres xml structur gener templat templat describ logic structur web page content navig tool queri comput navig tool load content ontobrok content current node narr structur access logic composit engin narr structur logic composit associ properti hyperlink xlink manag sort direct guidanc interact user web page repres templat order respond request provid templat index type level templat type content mean adapt place stage physic physic composit map present rule web page final process architectur concern design web page special report final layout page tailor user print standard style sme institut style sheet physic composit manag adapt navig author specif user stereotyp user type hyperlink web page style sheet templat map present web page java process appli logic structur web page entir document relev framework xml structur provid web page descript present semant composit engin architectur process deliv special report user present manag revisit version virtual special report revisit version comput document fly interest cheaper produc singl virtual document sourc numer real document request prepar document advanc real document reader expect document found subsequ search expect retriev document state system inform recreat document call revisit lead bookmark url store dynam gener recreat document displai enrich capabl virtual special manag version version control central issu special report reader retriev version read awar life cycl report forward backward time order develop analysi situat revisit version close issu intertwin main differ concern provid revisit featur requir storag user model data enabl semant composit engin comput real special report version process relat metadata schema special report work directli structur version revisit requir user model version number visit special report version manag version manag relat enrich featur metadata schema author add remov element special report model relationship compon latest version element user version metadata schema metadata inform fragment semant composit engin schema inform retriev match content specif metadata current version metadata schema consist gener gener inform resourc uniqu instanc identifi uniqu identifi singl titl titl author singl author author resourc unsort list descript short descript resourc singl languag languag resourc singl life cycl entri version uniqu instanc version version number resourc singl statu statu resourc final singl author author version unsort list date date version singl meta metadata inform metadata uniqu instanc creator author metadata singl valid review metadata singl languag languag metadata singl date date metadata singl technic technic inform resourc uniqu instanc locat resourc singl format format resourc singl instanc type type resourc singl size size resourc kbyte singl requir requir read singl instanc softwar softwar version unsort list hardwar hardwar descript unsort list classif data content report featur uniqu instanc domain descript relat domain unsort list concept concept singl level level knowledg requir singl report report classif singl instanc resourc type type resourc report singl edit edit concern singl citi citi concern singl condit resourc uniqu instanc copyright copyright singl access access restrict singl cost cost singl publish publish ident singl remark usag remark singl tabl metadata schema special report model metadata manag version featur version author main creat exist insid work small inform retriev servic version kind intern inform retriev featur updat creat relationship add valid period fig relat properti correspond list version relat valid set link root appli root set updat ad relev present previou version set compon give valid period root fig set data collect list articl select version set updat version store set pe ep ort structur rn rhetor relat ponent fig version applic instanc special report model instanti element special report model associ metadata inform relat enabl inform retriev method find relev version manag version number version manag version date press daili local edit print dai geograph area relev reader special report version special report version retriev correct version fact filter process histori revisit metadata schema version user model histori revisit issu current version user model individu model deal individu unlik stereotyp model user class featur user model consist histori session person data person data user uniqu instanc ident ident singl instanc singl singl ag ag singl login uniqu identifi data singl instanc login login singl password password singl classif classif data singl instanc locat singl kind singl activ role role applic reader singl prefer data data prefer user uniqu instanc interest topic interest singl instanc topic list topic unsort list adapt adapt prefer unsort list element element adapt singl rule method adapt singl knowledg data knowledg user uniqu instanc domain knowledg domain unsort list element domain concept singl level level knowledg singl histori data data access special report uniqu instanc access access log unsort list report id special report access singl structur id structur singl compon id compon read singl date date access singl bookmark bookmark data unsort list report id identifi special report singl structur id identifi structur special report singl compon id identifi compon structur singl date date retriev relev version singl session data data current session uniqu instanc choic store choic user singl instanc special report id special report chosen singl structur id structur chosen singl current store current data read path singl instanc special report id current special report singl structur id current structur singl fragment id current fragment singl devic descript current devic singl instanc softwar softwar version unsort list hardwar hardwar descript unsort list tabl user model geograph area relev local daili activ provid stereotyp estim level knowledg domain concept store featur requir retriev special semant composit engin deal revisit version plan add entri behavior background store data recreat web page special report data compon id date retriev relev version id obtain date id version id date chosen user suffici recreat special report store bookmark section individu model histori reason system navig guid reader show path cover reader interest element visit element newli ad version store path order list element found time list element date visit date order document configur user left user histori current session adapt semant composit architectur engin offer type adapt reader semant engin adapt special report structur content user mean author author select content author tool metadata entri classif section concept resourc implicitli ensur consist special report articl refer content variant due knowledg technic requir version articl includ special author tool check specif match articl metadata entri ad specif learn relev implicit metadata entri order author composit engin match user model topic interest knowledg classif entri metadata compat delet result structur content user adapt special report logic logic engin select relev templat resourc user task instanc read comput xml web page templat metadata entri select relev index type level composit engin determin xml page content navig tool hyperlink annot defin level mean properti hyperlink xlink physic layout engin select style templat style sheet manag adapt navig prefer direct perspect present framework consist deliv adapt special report author orient viewpoint author enabl document content organ consist wai mean narr structur author share narr structur knowledg elicit method formal knowledg unabl explicit knowledg method reli theori method stem cognit psycholog psycholinguist reusabl knowledg lead knowledg manag aim exploit organ intellectu asset greater competit semant composit engin deliv user adapt special report mean user model metadata composit engin studi european project call concern distanc learn consid manag revisit version persist state virtual document system ensur dynam document recreat time state reader plan offer kind free mode narr structur guid intellig search engin limit inform space dedic special report content specif appli entir reader access articl fit content specif articl close relat current strategi manag ad metadata comput structur fly goal cluster process appli geograph criteria present metadata domain ontolog local issu organ edit reader criteria inform retriev websit refer method techniqu adapt hypermedia user model adapt shepherd research issu virtual document workshop virtual hypertext function web toronto weav web san harper knowledg web knowledg al ontolog base access distribut inform confer semant kluwer academ publish torr exploit user model person present workshop adapt system user model comput scienc report motta server support stori enrich knowledg retriev european workshop knowledg manag wc sa rhetor structur function theori text organ electron document manag system semant web respect role xml rdf extens markup languag extens stylesheet languag version al nutshel world wide web confer toronto al access inform sourc www world confer www webnet usa version hypermedia acm comput survei
DB/1178 3 paper id estim frequenc chang junghoo cho hector stanford research paper contact junghoo cho po box ca usa estim frequenc chang junghoo hector stanford abstract onlin data sourc updat autonom independ make case estim chang frequenc improv web web cach data mine identifi applic requir accuraci estim frequenc develop identifi scenario develop analyt show estim show estim improv significantli introduct growth data sourc onlin data sourc autonom updat independ client access sourc popular web cnn ny updat content develop onlin store updat depend inventori market condit sourc updat client sourc chang client significantli benefit estim chang frequenc sourc applic estim chang frequenc improv effect improv web web crawler program automat visit web page build local snapshot index web page order maintain crawler period revisit page updat page fresh imag typic crawler revisit entir set page period updat crawler estim individu page revisit page chang high improv local snapshot consum bandwidth crawler improv order magnitud adjust base chang frequenc improv updat polici data data maintain local call materi underli data autonom materi view updat minim impact underli sourc data size data difficult updat view limit estim individu data item row select updat item incorpor amount time improv web web cach save recent access web access page serv local cach page reduc number remot access minim access delai network bandwidth web cach lru recent page replac improv cach hit ratio estim page page cach dai ago page hour system safe discard cach page obsolet data frequenc chang inform person suddenli access bank account signal bank action studi effect estim data item assum access element repeatedli normal period crawl web page user repeat access web page repeat detect estim chang frequenc motiv frequenc accomplish task exist import challeng estim frequenc includ incomplet chang complet inform element chang web crawler page chang time page chang web crawler access page daili basi detect crawler naiv conclud chang frequenc time dai estim smaller actual chang page chang access fair estim chang crawler account miss previou work estim chang frequenc complet chang histori work estim frequenc base incomplet inform irregular access web control data item access access decid user request access interv arbitrari limit chang histori access pattern difficult estim chang frequenc web user access web page dai dai dai dai system detect dai dai system conclud chang page chang dai differ depend level inform data item web site page major web site provid inform depend chang fulli exploit inform studi estim frequenc chang incomplet chang histori data item identifi issu place taxonomi branch show analyt good estim paper make identifi problem estim frequenc chang present formal framework studi problem estim measur frequenc chang effect exist scenario estim predict page time dai guess reduc averag present analyt result show estim relat work problem estim chang frequenc long studi statist commun previou work assum complet chang histori true practic scenario studi estim chang frequenc base incomplet chang histori refer studi crawler refresh local copi remot web page improv local copi assum crawler web page refer show crawler improv fresh significantli show crawler estim chang frequenc implement refresh polici refer companion paper vldb experi explain web crawler techniqu develop paper compar crawler design choic base statist collect half million web architectur emploi estim techniqu develop paper research studi build scalabl effect web cach minim access server load bandwidth usag work touch consist issu cach focu develop protocol reduc inconsist work mechan improv page replac polici exist architectur data wareh lot work effici maintain materi view work minim size view reduc queri time taxonomi issu start discuss estim chang frequenc clarifi make discuss assum element web page chang modif page note techniqu develop independ assumpt element defin websit singl row chang defin modif updat column row appli long clear notion element mechan detect element definit element assum repeatedli access element estim element access perform regular interv random interv acquir level inform access base access element inform develop taxonomi trace histori assum repeatedli access activ passiv passiv control access element web web page access user access page challeng analyz chang histori estim chang frequenc activ activ monitor element control access element crawler decid visit page control import question access element estim chang frequenc element unnecessari access element insuffici access month addit access applic access interv regular activ access element regular interv estim frequenc chang easier access interv regular detect give good estim chang frequenc random passiv access interv irregular frequenc estim inform depend level inform element complet histori time element chang estim chang frequenc estim frequenc chang studi case date element complet chang histori monitor bank account record transact date current account modifi transact date exist element monitor provid histori inform give current statu comput element access compar signatur access compar element chang note time element chang method section studi estim frequenc element chang section studi exploit estim frequenc chang estim applic frequenc chang estim data studi correl person credit card default import estim frequenc accur categor classifi element frequenc categori web crawler perform crawl crawl page updat crawler perform crawl month complet refresh page crawler interest page classifi page page visit week page visit month section studi problem estim frequenc section studi problem categor frequenc chang preliminari review basic concept estim reader understand discuss summar data show web page follow poisson process reader familiar poisson process estim theori skip section section explain model element model chang essenti compar section explain concept estim estim give valu chang frequenc metric measur effect estim poisson model element assum element poisson process poisson process model sequenc random event happen independ fix rate time occurr fatal auto arriv custom servic model poisson process web page follow poisson process companion paper trace chang histori web page collect site month compar result poisson process model predict base show poisson process describ web page figur graph compar actual chang interv page predict poisson process model graph base page chang dai averag plot similar chang interv fraction figur actual chang interv page predict poisson process model figur distribut estim graph page chang averag chang interv similar horizont axi repres chang interv vertic axi repres fraction chang interv straight line predict poisson process dot observ experi data cluster predict line studi show web page follow poisson limit experi conduct limit time window web page access daili basi studi verifi poisson process model page chang page chang slowli page low interest practic applic crawler rare access page crawler care page dai dai exist set page chang regular necessarili follow poisson process page easi identifi crawler manag hundr million web page reason safe assum entir set page chang random process averag return descript poisson refer number occurr chang interv poisson process rate frequenc random variabl poisson probabl distribut paramet poisson process averag frequenc rate chang occur verifi fact calcul event expect occur unit qualiti estim goal paper estim frequenc chang repeat access element estim summar observ chang singl number crawler web site crawler access web site site block access complet correspond frequenc chang summar ten visit chang frequenc call summar procedur estim chang frequenc exist multipl wai summar observ lead chang frequenc studi compar effect estim estim express function observ variabl number detect total access period estim chang frequenc notat show measur paramet underneath note random measur sampl repeat estim random variabl probabl distribut figur show distribut distribut determin effect estim assum element averag frequenc shown bottom center figur intuit distribut center expect equal figur clear estim real due statist variat variat small estim effici estim distribut smaller varianc figur estim distribut effici estim expect approach sampl size converg express estim sampl size consist estim lim posit estim exist chang estim element element chang number detect monitor estim frequenc section studi effect naiv estim analyz consist effici section intuit effect intuit frequenc defin notat assum access element regular interv access element time chang frequenc irregular access difficult defer discuss section element chang ith access element chang ith defin sum repres total number detect refer total time access access element time ni frequenc access element assum element follow poisson process rate defin frequenc ratio ratio chang frequenc access frequenc larg element access small access element note goal estim estim frequenc ratio estim indirectli multipli rest assum estim frequenc ratio note measur experi number estim estim argu estim smaller actual detect number smaller actual number bia grow larger element access grow miss element verifi intuit comput expect compar actual comput comput probabl element chang access lemma probabl element chang time interv equal element chang ith access chang element poisson access independ probabl probabl independ definit equal equal pr figur bia intuit estim figur statist variat note equal estim figur visual bia plot horizont axi logarithm show valu small larg rest logarithm graph equal dot estim smaller actual clear small element access significantli smaller larg miss access element bia smaller frequenc ratio smaller access element time frequent order bia estim estim bia sampl size differ remain independ size result coincid miss access element longer miss fraction access element frequenc effici evalu effici comput varianc standard deviat rememb standard deviat cluster distribut estim sampl process access inher induc statist variat basic statist interv assum normal distribut minim confid interv length proport rel actual frequenc ratio reduc ratio confid interv frequenc figur show ratio sampl size plot graph statist variat bia sampl minim statist variat confid sampl note larger sampl size variat explain impli crawler estim chang frequenc web page visit page decid access frequenc crawler visit page crawler miss estim chang frequenc crawler visit page statist variat larg estim chang frequenc inaccur assum actual chang frequenc page week crawler access page week bia estim chang frequenc crawler revisit page dai statist variat confid interv identifi revisit frequenc base improv estim improv estim effect complet chang histori element analysi show desir incomplet chang histori estim reduc bia sampl size estim desir properti deriv estim lemma comput probabl element chang rearrang log note measur probabl equat access element element chang infer probabl estim frequenc ratio note estim frequenc ratio slightli larger previou estim estim account miss access note estim accur sampl size estim bia sampl verifi claim properti implic practic estim reduc bia adjust access frequenc adjust applic estim log reduc bia desir simpli number access element estim wider rang applic defin estim number access element chang estim deriv estim slightli section show estim rearrang intuit suspect correct notic estim bia correct estim intuit estim mathemat singular element access estim produc singular make estim technic expect infin due singular avoid singular ad small log modifi estim singular rest studi properti modifi estim estim estim comput expect definit log log obtain express case studi properti numer evalu express plot result figur show graph valu show graph previou estim figur estim heavili heavili appendix show add avoid singular figur bia estim bia bia figur region estim estim sampl size show bia heavili estim sampl size larg sampl size order result sampl size formul find region satisfi formula eq numer comput region condit show result figur grei area bia estim note region grow larger sampl size illustr graph select revisit frequenc discuss effici estim effici discuss section larg statist variat plot graph comput varianc log log numer comput valu show result figur statist variat smaller sampl size figur graph estim figur graph note statist variat minimum region estim practic bia minimum valu similarli minimum result decid revisit frequenc element crawler estim chang frequenc web page visit time crawler page page domain chang roughli week base crawler decid access page statist variat confid smallest current guess chang frequenc optim revisit frequenc page dai dai estim chang frequenc estim frequenc actual frequenc probabl confid interv adequ crawl cach applic crawler learn initi guess chang frequenc actual chang crawler adjust access frequenc subsequ visit briefli discuss adapt polici estim prove estim show lim lim easi formal estim consist figur close figur approach empir show graph figur approach approach element access element figur expect time previou chang element access element figur problem estim base modifi date estim date chang estim estim chang frequenc date show obtain final estim step present estim final form studi qualiti start simpl basi estim gradual modifi estim fix estim construct estim date estim chang poisson expect time previou event expect time equal defin time previou chang ith time access ith access equal access element sum suspect estim note equat number measur repeat access intuit estim problem problem element chang access figur element access time chang appli estim naiv naiv estim practic consid element chang time modifi date estim match actual lead bia result divid actual number sum final date base modifi naiv estim shown figur estim consist maintain global variabl repres number access repres number detect repres sum time previou chang verifi bia comput show paper number access number detect sum modifi date element return figur improv estim base modifi date figur bia estim figur figur bia estim estim function access variabl current version function call set variabl element function updat valu base detect argument ti time previou chang ith access argument ii interv access element chang access ith ti smaller access interv ii note function element chang ti note function element chang updat algorithm implement estim intend studi bia show graph figur comput graph analyt verifi result simul comput assum access element regular interv estim frequenc ratio ratio chang frequenc access rememb estim shown dot line solid line show actual graph estim return figur function reduc bia estim bia bia small larg access graph estim fairli close estim frequenc ratio big actual ratio prove close converg converg log approach correct final modifi function shown figur place variabl comput monoton function function return similar result previou larg show bia estim function figur ax graph figur note estim practic close bia show graph graph valu essenti overlap result win estim section illustr implic result crawler estim chang frequenc page visit time crawler access page site administr frequent crawl site modifi date crawler access page show assum page week crawl page month modifi bia averag practic elimin bia modifi date bia assum access element regular interv obtain graph figur note estim figur assum access element regular interv verifi simul bia neglig irregular access case final figur show statist variat horizont axi graph frequenc ratio vertic axi statist variat variat standard smaller estim formal prove function defin assum monoton real monoton integ valu rememb integ valu figur statist variat estim categor bayesian infer studi estim chang frequenc chang histori categor element class base chang frequenc crawler complet web month partial updat small subset page week crawler care element week interest crawl page week month classifi page categori base chang histori estim previou section classifi page threshold frequenc classifi page month categori estim frequenc lower categor page week categori studi altern base bayesian theori machineri section long statist appli incomplet chang histori case descript studi effect method implic chang histori incomplet assum categor web page page chang week page chang month trace categori belong maintain probabl cw probabl belong cw probabl belong cm access detect updat probabl base detect point belong cw belong cm categori simplifi techniqu gener initi inform start fair valu cw assum access dai learn chang updat chang week bayesian theorem answer question reevalu event repres chang month week week month week figur accuraci bayesian estim month week week month week figur accuraci bayesian estim access frequenc comput bayesian comput cw probabl chang frequenc cm probabl chang frequenc base poisson process assumpt assum belong cw probabl belong cm probabl note coincid intuit repeat process detect chang updat cw cm eq cw contrari estim section note estim requir access page regular interv access element irregular interv element chang categor page note set arbitrari threshold categor element appli previou set threshold classifi arbitrari bayesian avoid set arbitrari estim natur classifi page figur show accur bayesian estim show probabl page classifi cm chang frequenc horizont valu obtain graph analyt assum access page dai graph estim classifi page accur month estim place page cm probabl week place page cw probabl estim categor page accur sampl size estim categor page correctli probabl bayesian estim accur handl irregular access accur result carefulli decid access page illustr show figur accuraci graph access frequenc estim accur access frequenc li month week li rang estim place page cm high probabl week explain phenomenon access page detect page access detect tend place page cm small bia disappear access page time avoid bia place select revisit frequenc futur work studi problem estim chang frequenc complet chang histori estim comput chang frequenc incomplet chang histori analyt show effect estim discuss practic implic choic estim effect exist extend current work irregular estim section handl irregular access estim section requir regular access element develop estim chang frequenc date access irregular adapt initi decid access adjust estim chang frequenc initi guess adjust access guess page week start visit page dai detect signal page chang frequent initi guess access frequenc immedi wait bit longer collect access page larg sampl size good adjust access frequenc immedi page week chang access pure luck adjust chang frequenc optim problem import question page chang big issu modifi date section show bia practic neglig independ access frequenc statist variat smaller access page frequent good access page slowli constraint earli estim chang frequenc chang assum chang frequenc element static assumpt valid test detect chang estim web crawl estim dai month estim rest month compar comput month difficult impract estim estim improv crawl cach refer michael georg sturm world wide web view internet ieee commun page june gc bayesian approach paramet reliabl estim poisson distribut ieee transact junghoo cho hector evolut web implic increment crawler submit vldb junghoo cho hector synchron improv fresh acm jame seltzer web cach consist usenix annual technic joachim hector jennif zhuge stanford data wareh project ieee data engin june anand jefferi ullman implement data cube effici acm leonard queue vol john pn misra hw paramet estim poisson process ieee transact inform howard taylor samuel karlin introduct stochast model academ georg jr calculu analyt geometri denni william richard mathemat statist applic pw robert winkler introduct bayesian infer lee scott shenker scalabl web cach consist architectur acm hector joachim jennif widom view mainten wareh environ acm figur valu satisfi equat avoid singular estim estim singular studi avoid singular note singular pass number paramet logarithm function avoid singular slightli logarithm function avoid singular add small number numer denomin estim note answer fact expect close show section expect log log approxim log log taylor note make equat set constant term factor equat graph figur horizont axi show vertic axi show satisfi equat converg close small conclud minim bia set comput bia estim figur comput bia estim deriv pdf densiti comput expect base densiti function deriv pdf long briefli sketch obtain assum access element time regular interv access straightforward comput probabl variabl equal element chang access element chang access probabl frequenc comput probabl repres time ad ith express element chang access ad time ith access element chang lose assum element chang access chang probabl element poisson process eq comput pdf standard statist techniqu denot pdf expect comput formula ni dt ni dt comput straightforward equat deriv ft ni dt correct bia figur studi mathemat properti eq remov bia complet analyt form eq complex hard interpret studi limit valu eq extend result gener case eq sum term correspond case detect access element chang domin term equat largest element chang domin term smallest confirm intuit comput limit factor eq lim lim comput limit eq lim lim ni dt lim ni dt lim lim ni dt lim ni dt log interpret result larg access element frequent detect access estim practic limit bia note estim frequenc ratio slightli larger actual frequenc ratio versu remov bia obviou solut estim bia estim lim lim ni dt estim frequenc ratio actual frequenc detect chang chang import term estim practic bia elimin lim lim ni dt elimin bia
ML/1179 6 proc int conf robot comput applic machin learn robot analysi jurgen institut comput control system robot prof prof faculti informat karlsruh karlsruh germani abstract robot challeng applic machin learn techniqu direct interact real sensori feedback enorm complex control system recent year approach appli ml specif robot task publish complet autonom robot control system learn compon paper aim point problem applic integr learn capabl robot control system describ integr system architectur show set compon autonom system learn facil introduct recent year interest appli machin learn techniqu robot applic manipul mobil system task learn techniqu rang rote learn induct learn algorithm analog reason explan base learn case base learn symbol approach cognit aspect robot control system main topic numer work neural reinforc learn genet algorithm robot area neuro system cite deal specif robot problem simplif make step simul real environ difficult due fact moment robot problem match idea machin learn appli easi world public find applic point ml robot gener learn system architectur develop aspect robot control system account short analysi ml engin autom present paper give solut appli ml aim point problem applic integr learn capabl robot control system present system develop result analysi work applic order verifi system architectur task learn grasp easi manipul priori unknown object automat perform experi system strategi extract user exampl trace user solv similar task appli ml robot contrast typic industri autonom robot react uncertain unknown event paramet adapt addit plan activ autonom system act environ perfectli model priori model applic nowadai telerobot system add definit robot abil learn experi human guidanc import reason limit todai robot li enorm program effort simpl task techniqu inflex program aspect autonom system investig robot accomplish princip ffl ml program tool robot applic program ffl ml tool develop refin knowledg base autonom robot experi ffl ml transfer telerobot system autonom behavior aspect task learn lead faster problem faster reliabl solut execut abil solv problem robot solv analysi todai robot control system typic robot problem side studi side show larg gap research area tabl overview import differ applic ml robot order bridg gap work applic ml robot section base analysi search wai solv task framework common system architectur world model elementari action ffl learn object properti mass stabl ffl explor current world find prototyp repres determin ffl learn elementari action world effect ffl learn elementari action object reactiv execut join manipul ffl optim refin action ffl learn state intern world model sensor ffl learn classifi object base imag data ffl learn sensor monitor action ensur correct execut determin state real world error analysi ffl learn error error diagnosi error repair rule plan ffl improv plan modul plan control ffl learn domain knowledg gener plan order account assembl ffl learn action rule solv principl ffl learn coupl typic task class relat action plan gener action plan set ffl learn task level geometr plan satisfi function learn goal tackl singl mix approach learn user act teacher type telerobot solv problem system plan experi execut formul user system make implicit knowledg explicit plan experi critic lot result publish ml commun learn plan compon control learn classifi learn reactiv contrari learn action learn learn failur learn observ explain human exampl experi begin system architectur order build robot system learn facil develop robot system architectur learn integr part knowledg acquisit refin system aim environ task perform high flexibl due rapid task hand partial autonom behavior robot hand user possibl program system comfort recycl system base main typic robot knowledg predic frame symbol plan bit vector dynam frame contin numer explicit program simpl skelet plan assembl control knowledg code procedur repres explicitli data sourc human user sensor human user teacher data reliabl data regard reliabl tradit induct algorithm learn techniqu topic real applic data plan execut view plan unexpect event world advanc applic overlap execut monitor determin action action view action world action due fact effect model time time constraint compon real time requir tabl comparison typic robot priori model object gener descript qualit featur acquir separ plan execut phase result skelet plan set intermedi goal execut increment plan system react inform world state unexpect event focu plan chang import goal extern event user act teacher learn robot system type input telerobot cognit part system base symbol learn commun knowledg explain knowledg miss develop main modul acquir object action knowledg visual tactil facil ffl learn gener object descript ffl learn static dynam object properti ffl learn action rule manipul object compon work action rule acquir gener learn analyz user action plan execut part develop distribut system architectur consist set agent commun adequ board structur figur overview architectur system consist ffl set knowledg consist set board store fact belong semant unit knowledg board fact plan agent interpret fact instanti board adequ learn strategi ffl set channel pass inform board interest board knowledg unit receiv possibl interest case request fact agent channel rout request knowledg unit give answer context consist set activ board interconnect solut task board channel dynam creat relat agent interpret task plan relat agent detect realiz relat demonstr board user board board relat board object board plan board sensor board actuat board user demo trace object agent classif format gener object sensor agent preprocess extract primit experi agent exploratori exp action exp actuat agent interpret motion primit motion control demo agent segment match demonstr plan agent skelet reactiv planner user agent input task system request teacher advic hand camera sensor context manag figur system architectur task object consid descript main idea modul learn gener object descript assum object model modul build gener descript geometr inform structur consist set object set edg extract real time vision hardwar edg inform determin face vertic imag element set properti attribut relationship element visual descript enhanc result center face descript view type object combin gener descript algorithm base idea conceptu cluster algorithm extend algorithm handl relat attribut match step algorithm insert root concept tree perform increment hill climb search tree restructur result gener object descript hierarchi object classifi restructur insert object node learn object properti experi learn modul consist acquisit object knowledg activ experi system goal system classif object determin action solv task evalu base sensor valu visual inform acquir type object relat ffl static object properti exploratori explor object visual interpret lead final classif specif inform deriv visual set undirect experi direct experi order check object ffl dynam object properti action determin reaction object specif action grasp push point exploratori experi determin object featur base directli featur extract visual system perform ffl part action properti mass determin action experi analysi object featur visual featur classifi properti lead specif action result ffl plan determin discrimin properti select adequ action action experi perform determin knowledg connect object properti action statist comput object probabl reaction class result type experi combin rule creat rule label reliabl sensit analysi perform slightli vari paramet fix result experi store list ffl object specif paramet grasp ffl action specif paramet ffl static object featur ffl dynam object featur reaction experi baselin gener gener rule induct applic object result actual solut task request specif paramet specif reaction object result set initi experi perform control global experi control initi number amount primari reaction sensit frequenc valid learn combin learn action rule wai action plan knowledg futur task transform result plan task build set action rule determin action respect current context guid plan phase lead skelet approach base method due higher flexibl reusabl knowledg fact reactiv behavior system due unexpect event reach easili plan rule determin action context task learn rule similar learn classifi action rule extract exampl user main problem find focu attent order extract object relat robot grasp sensor measur reaction user defin notion context begin section distinguish point learn action rule ffl context situat rule applic rule gener shannon inform measur rank rule form direct interact teacher demonstr agent user demonstr solut task demonstr agent match intermedi goal object object featur extract user demo built automat system ffl match user demonstr system inconsist rule activ chain examin reliabl rule special order applic situat time acquir object action knowledg solut specif task object plan agent classifi sensor data determin adequ reaction system context relat work overview work relat applic ml robot introduct gener ml system architectur prodigi theo soar prodigi system lot learn strategi investig applic robot system publish theo appli mobil robot collect garbag theo learn method build rule execut faster origin plan knowledg soar appli robot manipul chunk correct extend domain theori human user approach specif intellig agent problem present system algorithm appli acquisit plain object plan knowledg motor program implement futur work paper point problem ml techniqu robot state set applic learn successfulli integr robot control system part paper briefli main compon system architectur develop result analysi work moment work implement concept testb consist hand univ vision hardwar sun workstat common lisp cognit control system earli experi develop standard induct learn algorithm result comparison algorithm common problem set publish appli concept acquisit object knowledg grasp manipul object experi user guidanc task form basi applic recycl unknown object tackl phase project futur work devot integr reactiv subsymbol skill element base connectionist approach extens acknowledg discuss topic work support sfb intelligenz project german research foundat perform institut comput control system prof prof faculti karlsruh germani refer asada automat program gener teach data hybrid control robot ieee transact robot april inou robot program proc robot research int bennett dejong compar stochast plan acquisit increasingli permiss plan uncertain domain proc int workshop pp sw bennett reduc failur approxim rule proc int conf pp jg carbonel learn formul gener plan past experi rs michalski machin artifici intellig approach vol pp tioga publish chen smooth path track symbol comput report dept univ illinoi chien machin learn engin autom proc int workshop pp ad christiansen learn reliabl manipul strategi initi physic model proc ieee robot pp latomb approach automat robot program base induct learn bradi proc robot int pp mit nv lh analog reason intellig robot wong machin intellig knowledg engin robot vol nato pp jh fisher model increment concept format artifici demonstr focuss attent robot task acquisit technic report dept comput univ cm kadi continu conceptu set learn robot oper exampl proc int workshop pp comparison induct learn program sb thrun monk problem perform comparison learn algorithm technic report carnegi mellon je laird correct extend domain knowledg guidanc proc int conf pp je laird architectur gener intellig artifici langlei integr cognit architectur autonom agent technic report univ dept inform comput minton learn effect search control approach tr carnegi mellon tm mitchel framework system architectur intellig tm mitchel increasingli reactiv proc pp observ simul robot world proc int workshop pp sato model enhanc intellig skill robot system proc robot research fourth int pp schmidt integr autonom subsystem assembl mobil flexibl manufactur inform process autonom mobil proc int pp machin learn robot assembl plan kluwer academ selfridg teach robot proc int symposium industri robot robot pp tan learn system grasp object proc ieee robot pp wp machin learn algorithm autom assembl proc ieee robot pp zheng lk learn strategi telerobot system proc ieee robot pp
DB/1180 3 effici support web server aron peter druschel willi depart comput scienc rice abstract paper studi mechan polici support persist connect web server emploi request distribut present mechan distribut request node cluster server simul show combin extens request distribut effect yield scalabl perform request implement simpler forward measur mechan connect extend prototyp driven trace actual web confirm simul result throughput prototyp time achiev convent weight request distribut throughput persist connect introduct cluster commod workstat increasingli popular hardwar platform high perform network server achiev scalabl server perform platform critic deliv high perform user manner web server emploi node distribut incom request node manner transpar client distribut request load node balanc request account content type servic request decid node client request assign request distribut integr server node special proc annual usenix technic june tain type content servic permit partit server enabl clever request distribut polici improv perform previou request distribut polici achiev good cach hit rate addit load balanc dynam partit server work set node investig mechan polici request distribut presenc persist client connect persist connect http client submit multipl request server singl tcp reduc client latenc server overhead persist connect pose problem cluster request request singl connect assign node satisfi distribut polici paper describ effici mechan request distribut extens polici presenc connect present simul studi report result prototyp cluster implement result show persist connect support effici web server request distribut demonstr extend polici achiev perform persist connect rest paper organ section background inform state problem pose cluster request distribut section consid mechan achiev request distribut presenc persist connect extend polici present section section present perform analysi request distribut mechan simul studi mechan tend polici section section discuss prototyp section report measur result obtain prototyp discuss relat work section conclud section background section background inform persist connect request strategi state problem persist connect pose request distribut persist connect obtain html document typic involv http request web fetch browser send request separ tcp connect latenc perceiv number network resourc requir server enabl browser send http request server singl tcp connect anticip receiv server connect open configur interv receiv request method amort overhead establish tcp connect network multipl http pipelin request send multipl server singl tcp connect short success avoid multipl tcp network util effect bandwidth perceiv client rfc specifi backward client server persist connect explicit http header rest connect assum support persist paper featur support persist connect request pipelin request distribut request distribut techniqu emploi network account servic request decid backend node serv request pure scheme weight commerci high perform cluster server distribut incom request weight measur load node potenti advantag request distribut perform due improv hit rate main memori secondari storag scalabl due abil partit server abil emploi node special type request audio request establish tcp connect client prior assign connect backend natur target client request influenc assign mechan requir chosen backend node serv request tcp connect establish reason desir mechan transpar client discuss mechan section request distribut request distribut specif strategi request distribut advantag cite improv cach hit rate backend strive improv cluster perform simultan achiev load balanc high cach hit rate figur illustr principl cluster work set target incom request stream direct request request likelihood request find request target cach distribut incom request target arriv likelihood cach sum size size work set exce size main memori cach individu node cluster scale larger work node main memori cach fit entir work set effect cach size approach sum individu node cach size ad node cluster accommod traffic term target refer web url applic argument http command node node figur request distribut addit cpu larger work set effect cach problem persist connect pose problem cluster emploi request includ problem scalabl mechan distribut oper granular tcp connect multipl http request arriv singl tcp connect mechan distribut load granular tcp connect constrain feasibl distribut request arriv connect serv singl backend node constraint cluster request serv subset node problem node receiv request serv cluster node capabl serv valid polici partit work perform loss result node receiv request current share work set show section perform loss offset perform advantag persist connect cluster server mechan request distribut perform request distribut establish client http connect decid node serv request mechan chosen node serv establish client connect discuss mechan simplest mechan work client browser chosen send http redirect return java applet contact execut browser mechan work persist drawback redirect introduc addit address individu node secur simpl outdat browser support redirect mechan remaind paper relai simpl mechan relai figur depict mechan mechan discuss rest section maintain persist connect node request arriv client assign forward client http request messag connect arriv forward data client buffer data princip advantag approach transpar client backend fact distribut granular individu presenc persist connect fact data forward frontend render substanti power hardwar conceiv small cluster built special layer switch abil relai transport connect awar actual implement approach result present section relai offer client request relai multipl handoff forward figur mechan request distribut manc advantag scalabl mechan multipl tcp connect handoff complex mechan involv tcp handoff protocol node handoff protocol transfer end establish client connect node state transmit data directli bypass data client tcp ack forward node effici manner previou evalu handoff protocol singl handoff protocol support persist request serv node connect origin hand design handoff protocol extend support frontend migrat connect node advantag multipl handoff protocol request distribut granular individu request presenc persist connect unlik frontend handoff approach effici scalabl network traffic bypass handoff approach requir oper system node custom loadabl kernel modul design modul multipl handoff support preserv advantag persist connect reduc server overhead reduc client latenc overhead migrat connect node tcp pipelin drain migrat request forward request combin tcp singl handoff protocol forward request node hand client connect node tcp singl handoff protocol request arriv persist connect serv node handl connect hand node inform connect handl node node serv offend request backend node request content servic question directli node forward client client connect depend request forward persist http connect network file system advantag request forward lie fact complex overhead multipl tcp handoff avoid disadvantag overhead forward connect handl node observ suggest request forward mechan request result small amount data result present section show due small averag content size todai web traffic request forward approach max accept delai differ overload delai throughput idl load load figur server throughput delai competit polici section present extens polici work effici presenc persist request forward mechan present previou section relai mechan tcp multipl handoff mechan request distribut granular individu request place restrict request distribut polici polici combin mechan loss local forward place restrict distribut mandat connect hand node request arriv persist connect serv polici instruct node forward request node develop extens polici effici distribut request cluster forward mechan subsect briefli present standard strategi proce present extens strategi strategi yield scalabl perform achiev load balanc cach local server achiev cach maintain map target target consid cach node achiev balanc load distribut cost cost cost local cost replac intuit definit metric explain figur show throughput delai characterist typic server function load number activ load point idl defin node potenti underutil overload defin differ delai node oper compar node oper point idl unaccept metric cost balanc captur delai servic request queu request cost reflect delai due presenc absenc target cach cost replac cost reflect potenti futur overhead replac target cach cost metric defin shown figur unit cost defin delai experienc request cach target unload server aggreg cost send request server defin sum valu return cost metric request arriv polici assign request node yield minimum aggreg cost updat map reflect request target cach node result apach webserv run set overload idl miss cost set simul prototyp result paper extend strategi basic strategi base choic node serv request present differ pai al proven strategi idl low miss cost high low cost idl infin overload idl cost ae target map server miss cost cost idl target map server miss cost figur cost metric current load current assign content node current partit work extend polici work connect forward mechan addit choic node serv request arriv persist connect constrain choic node connect hand polici make choic node handl persist connect depend request expect connect assign request node connect handl node addit forward overhead overhead weigh cost read request content connect handl node local disk request content fetch local disk request content cach connect handl cach content reduc cost futur request content node handl potenti replic content multipl reduc aggreg size server cach intuit extend polici due structur typic web addit request persist connect arriv request deliv client base choic node handl connect knowledg request respect extend polici add addit node handl request arriv hand persist connect long util connect handl node local disk content read avoid forward overhead forward request polici consid node candid cach request target extend polici simpl heurist decid content cach connect handl node disk util connect handl node assum node main memori cach thrash request content cach local disk util request content ad node cach present extend polici request arriv persist connect handl node chosen basic polici section subsequ request persist ffl target cach connect handl node disk util connect handl node low queu disk request assign ffl cost metric present section comput connect handl node node target cach request assign node yield minimum aggreg cost comput cost singl load unit assign averag file size figur apach averag file size figur flash tion handl node activ connect handl forward mechan fetch document node assign load number outstand request batch pipelin durat request handl request assign load remot node servic time request determin request estim servic time batch pipelin request assign load remot node entir batch servic time estim number request batch close space request arriv connect estim batch servic time time batch arriv connect idl assum previou request finish batch request arriv connect map target node updat time target fetch node note extend polici request perform analysi distribut mechan section present simpl analysi fundament perform tradeoff multipl handoff mechan versu idl connect detect absenc ack client ward mechan request distribut presenc persist connect compar multipl handoff forward mechan trade forward cost handoff overhead suggest request forward request result small amount multipl handoff approach win case larg assum factor affect perform equal figur show result simpl analysi confirm quantifi intuit analysi predict server function averag obtain cluster multipl handoff forward mechan analysi base valu handoff forward overhead report apach flash web full impact assumpt made respect request distribut polici assum request arriv persist connect serv node connect handl node practic polici result upper bound impact choic request distribut mechan actual cluster perform result confirm small forward mechan yield higher multipl handoff mechan superior larg crossov point depend rel cost handoff versu data li kb apach kb flash result independ averag number request receiv persist connect averag size todai web traffic kb result forward mechan competit tcp multipl handoff mechan web workload simul studi request distribut polici rang cluster size request distribut mechan extend configur web server cluster simul pai al deal request section overview simul detail descript simul found pai al cost basic request process step simul deriv perform measur mhz pentium ii machin run wide apach web aggress optim research web server call flash connect establish cost set cpu time overhead transmit process incur byte simul kbyte document serv main memori cach rate approxim connect rate higher connect depend averag number request connect machin prototyp implement main memori size mb main memori share os server applic file cach account set backend cach size simul mb simul model tcp behavior data transmiss data transmiss assum continu limit tcp affect throughput result network assum infinit fast throughput limit disk cpu overhead workload simul deriv log actual web server log size request target client host timestamp access web server record request arriv connect construct simul work heurist set request client period default time web server close idl success request consid arriv singl connect model http request connect consid batch pipelin request client pipelin request batch wait data server request batch synthet workload gener surg gener workload repres connect workload gener combin log multipl web server rice trace span period log gener workload pai al data set trace consist target cover gb space result show trace mb memori cover simul calcul cach hit averag cpu disk idl time statist throughput number request trace serv entir calcul number request trace divid simul time finish serv request trace request arriv rate match aggreg throughput server simul result section present simul result compar combin tcp singl handoff workload tcp singl handoff workload tcp multipl handoff extend workload forward extend workload ideal handoff extend workload node cluster figur apach throughput node cluster figur flash throughput mechan section ideal mechan incur overhead reassign persist connect node perform result mechan provid ceil result obtain practic request distribut mechan figur show throughput result apach flash web run node result wide weight polici workload drive simpl workload result show throughput suffer apach small medium cluster size loss local offset reduc server overhead persist connect kei extend polici multipl handoff mechan forward mechan ideal mechan afford throughput gain compar throughput achiev mechan confirm mechan competit todai web workload perform catch extend scheme larger cluster reason suffici number aggreg cach size cluster larger work cach target assign addit target request connect target cach backend node yield high cach hit rate request subsequ request perform approach extend strategi larg cluster size obtain throughput advantag persist connect remain disk bound cluster size unabl capit reduc cpu overhead persist connect report outperform larg margin cluster size aggreg node cach server perform ident server disk bound polici result obtain flash web predict futur trend web server softwar differ perform loss apach underscor import effici mechan handl persist connect cluster server request distribut throughput gain afford hypothet ideal handoff mechan achiev power relai section long bottleneck shown figur achiev throughput forward mechan extend polici prototyp cluster design section describ design prototyp cluster complex tcp handoff dispatch server handoff forward conn req client conn req ack handoff req ack repli client host user level kernel figur tcp connect handoff handoff fact simul result substanti perform advantag multipl handoff request decid implement forward mechan prototyp section overview compon cluster section describ tcp singl handoff protocol section describ techniqu instruct connect handl node forward request node section describ node fetch request remot node manner server applic unchang overview cluster consist node connect node lan http client awar exist cluster effect singl web server machin client figur show process protocol stack backend client applic web unchang run unmodifi standard oper system server process machin web server applic apach zeu protocol emploi addit ad loadabl kernel modul node tcp singl handoff run standard provid control session machin extend polici implement dispatch modul forward section node startup process shown figur initi dispatch setup control session handoff protocol initi process remain kernel resid provid process context dispatch handoff protocol disk queue length node convei control session mention tcp connect handoff figur illustr typic client process protocol connect dispatch modul accept hand tcp handoff connect handoff server accept creat server send repli directli client handoff remain transpar client packet connect handl node tcp packet client forward frontend forward modul connect handl copi packet request client dispatch enabl assign request backend node request pipelin fulli support handoff client send multipl request wait previou request tcp multipl handoff mechan discuss section implement extend design manner server node requisit data handoff protocol connect hand connect hand directli inform forward futur packet client appropri main challeng design prevent tcp pipelin drain process handoff tag request mention previou forward modul send copi request packet dispatch connect hand assign subsequ request connect node connect handl node accomplish tag req kernel drop socket dispatch req handoff tag req tag req handoff tag req server req forward process tcp req buffer figur tag request request content dispatch send request reliabl connect handl control session handoff protocol modul handoff protocol backend receiv place directli web server socket buffer tag enabl web server fetch target forward section unawar presenc handoff protocol packet client forward modul connect handl node undergo tcp process data packet client acknowledg connect handl node content request discard connect handl node figur tag request receiv control connect deliv server process fetch remot request foo dispatch foo webserv nf mount webserv figur transpar remot request fetch web server applic typic serv document directori refer document root implement remot fetch transpar web server node nf mount document root node document root directori tag accomplish dispatch chang url client request prepend directori remot node figur depict situat dispatch tag http request prepend url order make fetch file foo nf issu fetch remot file nf client result cach target multipl node abil control cach replic avoid made small modif disabl client side cach nf file prototyp cluster perform present perform result obtain prototyp cluster environ client backend server cluster server front end switch figur testb testb consist number client machin connect cluster server configur shown figur traffic client flow forward data packet transmit client bypass server cluster intel pentium ii base pc memori cluster consist pc type configur machin run loadabl kernel modul ad os backend node implement tcp singl handoff case forward modul client intel pentium pro memori client node cluster connect switch fast ethernet node equip network commun intern commun connect singl switch network interfac intel run mode server backend node client softwar program simul multipl http client simul http client make http request fast server cluster handl cluster perform result node cluster figur http throughput segment rice trace allud section drive prototyp cluster singl node run apach deliv trace apach web server reli file cach servic underli oper system unifi buffer cach file compet user process physic memori page page replac control implement variant clock algorithm cach size depend main memori pressur user applic memori demand kernel apach server process leav free memori observ file cach size mb mechan polici similar simpl tcp handoff data server directli client assign connect node pure observ made result present figur measur larg confirm simul result present section contrari simul realiz modest perform improv workload reduc memori demand apach server leav room file system hit rate effect model simul extend polici forward mechan afford time throughput persist connect throughput persist connect mechan distribut request polici perform presenc persist connect run extend forward mechan node result cpu util frontend support equal cpu speed scalabl larger cluster size achiev emploi smp base machin relat work padmanabhan mogul shown connect server resourc number network packet effect latenc perceiv client persist connect pipelin http adopt standard work show techniqu dramat improv ineffici work effici support cluster base web server request distribut heidemann describ perform problem interact tcp situat work fix improv perform solut complimentari work appli cluster environ fix incorpor apach current research address scalabl problem pose web work includ cooper cach proxi insid document innov techniqu address complementari issu provid support scalabl network server network server base cluster workstat start wide product announc node cluster server request distribut strategi cluster variat weight account request target content except dispatch product support request distribut product dynam distribut polici base content attempt made achiev cach aggreg request distribut hunt al tcp option design enabl load distribut cluster server design roughli compar function tcp singl handoff implement fox al report cluster server technolog inktomi search engin work reliabl scalabl aspect system complementari work request distribut polici system base weight distribut server wide deploi internet server techniqu load balanc includ dn http client smart client forward hardwar translat network address scheme problem relat qualiti load balanc achiev request latenc detail discuss issu made work goldszmidt hunt al scheme support request distribut persist connect pose problem cluster base web server request request singl connect serv backend node describ effici mechan distribut request arriv persist tcp multipl handoff request forward simul studi show mechan effici handl web workload persist connect extend local awar request distribut strategi work request forward show yield perform result obtain simul ideal mechan polici mechan fulli transpar http client implement extend polici request forward mechan prototyp cluster perform result extend strategi afford improv throughput persist connect result singl cpu support node equal speed studi http server serv static content research support request distribut mechan polici dynam content acknowledg anonym review valuabl comment suggest work support part nsf grant texa grant ibm partnership award refer al scalabl www server intern parallel process apr apach williamson web server workload search invari acm sigmetr apr crovella gener repres web workload network server perform evalu acm sigmetr juli rfc hypertext transfer protocol dn support load balanc rfc apr hierarch internet object cach usenix technic jan cisco system wang techniqu host servic cluster machin comput network isdn schwartz case cach file object insid internetwork acm sigcomm sept rfc hypertext transfer protocol jan gauthier scalabl network servic sixteenth acm symposium oper system san oct heidemann perform interact tcp implement acm comput commun april enabl load distribut scalabl servic technic ibm tj watson research ibm corpor ibm interact network dispatch mogul explor bound web latenc reduct cach prefetch usenix symposium internet technolog system dec subramanian distribut substrat internet applic usenix symposium internet technolog system dec design implement oper system addisonweslei publish mogul case http acm sigcomm krishnamurthi potenti benefit delta encod data compress http acm sigcomm sept network perform effect png acm sigcomm sept padmanabhan mogul improv http latenc intern www oct request distribut network server acm confer architectur support program languag oper san oct effici portabl web server usenix technic june unifi buffer cach system symposium oper system design feb reson reson dispatch seltzer case geograph workshop hot oper steven illustr volum protocol yoshikawa al smart client build scalabl servic usenix technic jan zeu
ML/1181 6 accept fourth intern confer knowledg discoveri data august human perform cluster web preliminari studi brian haym hirsh depart comput scienc state jersei nj usa abstract inform world wide web difficult quickli find desir inform multipl queri search engin search group html page relat order understand perform initi studi human cluster web hope provid insight difficulti autom task result show subject cluster subject similar cluster found subject gener creat small access url creat fewer cluster access full text web page gener overlap document cluster subject full percentag document cluster analyz individu found behavior term size number cluster result provid sober note quest singl correct cluster method web page introduct web page enorm number data sourc wide rang authorship page gener rate individu organ capabl track organ present adequ tool access inform time search engin link web page page suggest link find link unrel topic wide rang approach peopl access manipul collect document convent document retriev system return list rank document base measur document similar origin queri work gener queri gener copyright american associ artifici intellig reserv page tailor task etzioni class tool provid graphic mean access data similar thompson croft wilson relationship fix attribut korfhag queri term distribut pattern approach cluster collect document hierarch agglom cluster find cluster centroid cluster base similar centroid recent cluster al cluster base phrase overlap cluster interact al pederson user navig retriev result dynam cluster base navig method punch cluster document find import word cluster autom method cluster relat web page simplifi access inform restrict page concentr effort web page return queri search engin result meaningfulli effect cluster web central cluster method set coher group document exist wai cluster document set coher group assumpt investig paper end group subject document return result queri web search engin paper detail present analysi initi issu mean cluster gener data experi studi human cluster collect web page return web search engin ten subject particip studi detail result al ber rutger machin learn research group graduat student author faculti member fourth author search engin rutger webwatch web search facil index page rutger reachabl link main rutger web page search engin chosen inher focu inform belief draw narrow sourc greater likelihood form coher exploit background knowledg subject rutger brought bear cluster task subject result queri cluster repres frequent queri involv disjoint set term user search engin januari queri campu return web determin import actual text document queri subject complet text url titl web link subject url titl subject assign queri randomli sole restrict subject access full text document queri queri access url titl return web link subject told cluster document abil report queri cluster form provid form space report cluster addit cluster accept overlap cluster accept requir time limit set long subject spend cluster document subject spent approxim minut complet entir task initi analysi data interview found subject singleton cluster document believ fit subject simpli disregard document subject creat singleton cluster creat document address issu delet singleton cluster subject result result base result attempt determin agreement subject extent presenc entir text affect cluster size number overlap cluster disjoint complex scheme overlap cluster question consid big gener correl size cluster total number discern pattern individu similar gener pattern amount agreement bigger overlap subject cluster gener pattern amount overlap queri cluster depend number document paid attent result chang subject access full document cluster size issu studi size cluster subject tend form bigger cluster prefer smaller vice access complet text affect prefer prefer subject address question compar size cluster full set queri subject access text size subject found differ comput mean found group subject access text averag cluster size number document cluster size absolut found averag number document queri final interest observ subject prefer averag size largest cluster close size entir document set individu subject found rang size vari greatli queri tabl depict absolut proport respect number rang valu subject conclud strong indic user necessarili prefer specif cluster cluster size subject min max median tabl absolut proport rang subject number document document queri document averag proport averag proport account career servic employ librari campu tabl averag number cluster queri subject num cluster tabl averag number standard deviat cluster subject gener cantli affect access full document text figur show graph probabl subject gener cluster size graph illustr probabl bigger cluster gener show gener subject prefer smaller cluster number cluster issu studi cluster typic form individu basi interest question result chang significantli subject access full text tabl report averag number cluster gener queri valu report access full text document form cluster great varianc consist number cluster gener tabl show averag number cluster subject standard deviat subject similar cluster subject subject creat number size similar cluster cluster size url titl full text figur averag frequenc occurr cluster size gaug similar subject cluster behavior measur agreement subject respect place document cluster subset document group cluster count proport subject place subset document cluster document process place document group larger chanc set document subject found agreement found small subset document figur subset averag proport peopl subject subset document cluster agreement fell bigger subset amount correl lower subject access full text titl url similar subject dimens examin calcul similar comput number pair document subject divid total number pair found subject document averag queri similar document averag similar averag amount similar vari cluster size subject document subject document figur proport subject cluster subset document subject min max subject min max tabl averag number cluster document subject subject min max subject min max tabl proport cluster disjoint rest greatli noteworthi variat document account mention subject full cluster creat averag size cluster stai potenti pair make similar subject higher similar drop varianc similar subject amount cluster overlap studi amount overlap cluster subject quantifi measur comput averag number cluster document belong number cluster document occur queri averag number cluster subject document subject document individu subject amount overlap subject extrem vari rang ten subject shown tabl measur overlap averag cluster document tabl show minimum maximum proport cluster disjoint rest number interest show subject dissimilar overlap except gener variat subject ten peopl chose cluster disjoint high high proport subject high level indic cluster method overlap overlap document cluster studi data observ subject place document cluster recal treat document singleton cluster document cluster ing found averag document cluster tabl show absolut rang split url titl work tabl show proport valu rang data present previou find averag subject full text futur work work began observ difficult build system cluster web page subject human attempt correct cluster hand goal work give object data support pessimist assess find task opportun cluster narrow rang web page subject familiar domain document obviou step elabor experi involv larger number peopl document ideal experi explor queri wider rang number result occur case queri return larg set small number result unreason gener result relat cluster size number cluster subject queri hope clarifi issu issu isol experi fact subject cluster impli effect cluster document subject cluster perfectli accept provid equal suitabl wai structur result queri plan subsequ work disjoint subject group evalu merit test extent accept neg result followup studi complement result uniqu cluster document altern wai judg subject judgment led perform studi make true final piec inform find subject cluster plan make subject interview subsequ work summari ten peopl set fairli search domain data analyz find gener ten subject cluster result subject tend cluster queri similar found subject found subject creat small averag subject tend creat fewer cluster overlap full text url titl find suggest absolut number document document document min max median min max median account career servic employ librari campu tabl absolut number document cluster subject proport document document min max median min max median account career servic employ librari campu tabl proport number document cluster subject accept peopl tend context specif gener characterist question effect cluster behavior achiev knowledg cluster method acknowledg member rutger machin learn research group particip cluster queri comment analysi gari weiss daniel comment earlier draft paper work support part nsf grant grant refer explor inform visual annual intern confer research develop inform approach larg document collect annual intern confer research develop inform constant larg document collect annual intern confer research develop inform integr document common visual annual intern confer research develop inform visual term distribut inform full text inform access confer human factor comput system annual intern confer research develop inform human perform cluster web page technic report depart comput rutger measur web lyco intern world wide web confer automat text retriev inform comput dynam refer case studi homepag domain intern world wide web confer visual tool inform retriev manag intern confer inform knowledg manag support intellig text retriev system intern journal studi recent trend hierarch document critic review inform process manag find salient featur person web page categori intern world wide web confer fast intuit cluster web document intern confer knowledg discoveri data
DB/1182 3 integr workflow manag system exist busi environ peter michael gerhard weikum saarland abstract workflow manag system support larg execut busi process workflow manag system typic requir implement applic control flow workflow manag system approach power control flow implement sever drawback workflow manag system integr environ exist solut implement control flow exist solut complex substitut workflow manag system workflow manag system support increment exist implement control flow substitut extend workflow manag system function cord futur applic worklist histori begin increment integr limit amount workflow manag system function exploit workflow applic integr advanc requir demand custom workflow manag system evolv applic present architectur implement workflow manag coin aim overcom mention shortcom workflow manag system support easi integr workflow function exist tailor specif workflow applic introduct workflow manag system implement comput support busi process workflow manag system fulli exploit control flow complet workflow manag system specif invoc workflow activ control flow complet control workflow engin time extern applic call activ workflow integr mean simpl invoc interfac corba virtual workflow manag system provid workflow manag coalit architectur line problem statement rare case opportun iz busi process scratch comput support busi process implement workflow work perform research project administr larg workflow manag system fund german scienc foundat manag system introduc true applic program implement activ control flow exampl shell script invok applic program outcom invoc store procedur combin trigger program program languag access invok applic refer ist control flow implement script exist ness environ typic mix script quickli complex maintain adapt applic workflow manag system provid ing typic requir control flow reimplement cost reimplement prohibit initi problem implement occur entir applic environ unavail long time smooth transit workflow workflow manag system support implement workflow manag system gain accept usag exist ness environ smooth transit requir increment substitut script facil workflow manag system increment step perform part busi process modifi extend technic point requir mean incorpor script specif languag workflow manag requir interfac workflow manag system script requir featur specif languag requir interfac usag workflow manag system prohibit huge system footprint import small part function exploit current workflow manag system creat overhead simpli perform make thing workflow manag system suffer limit extens system design support kind workflow option administr facil worklist manag histori manag power suffici tailor applic lem requir pose compon ent workflow applic workflow tion complex strategi assign work item load balanc tor principl dual predict advanc administr facil small workflow requir support compon workflow manag system observ properli architectur workflow manag system administr facil consid integr part workflow manag system contribut paper base review rent architectur workflow manag system obviou architectur support increment integr workflow manag system exist tailor administr facil integr aim minim system footprint advoc system architectur base workflow manag adapt full spectrum applic extens argu protocol integr script option workflow administr function implement workflow techniqu distinguish approach earlier adapt architectur tradeoff simpl kernel architectur limit function fit share function rich kernel challeng ly identifi requir kernel function interfac relat work problem design interfac exist applic challeng system design long research workflow manag began area call mediat develop aim mediat make data store data data homogen manner data sourc prepar integr surround wrapper approach involv basic interfac mean implement translat data repositori maintain meta data describ data sourc notabl project area ibm garlic project disco project tsimmi project contrast workflow manag project focu connect data connect applic program gener applic todai common web standard html solv problem approach adopt workflow manag system global web page java applet front end interfac client applic remot system sole base exchang html form approach address client issu connect exist script applic invoc extern distribut program environ corba dcom make distribut transpar provid basic tion servic corba workflow enact servic part meteor project altern enact sole base web technolog develop lotu note capabl integr applic program lotu note interfac languag macro expand function work close relat approach mobil project exist applic program integr mobil workflow manag system mean specif wrap mechan applic program emphasi reliabl recoveri aspect author distinguish transact applic program similar approach pursu meteor task type work consid integr exist make build block workflow applic approach increment integr exist script term basic face term workflow specif languag idea consid addit interfac tailor workflow system specif workflow applic import issu workflow manag product research monolith aim provid full fledg support widest sibl applic spectrum idea extens adapt system architectur extens system investig research develop mix success wide agreement architectur paradigm similar paradigm pursu construct highli distribut middlewar area workflow extens adapt architectur receiv attent notabl except mobil meteor project specif approach view major extens compon workflow idea outlin paper base reason al made workflow manag discuss import implement aspect show feasibl approach paper organ section give detail discuss architectur requir base scenario section present basic architectur section discuss integr exist environ section conclud paper architectur requir architectur requir driven design workflow manag system easi integr exist busi process develop extens facil worklist manag histori manag harder design workflow order discuss present simpl workflow scenario electron commerc environ sider larg mail order busi sell electron devic comput telecommun equip focu main busi regist incom order deliv order discuss scenario assum mail order busi part busi process incom order mail phone regist electron devic custom check order process automat consult respond onlin encrypt check inventori check order item stock check invoic print order item deliv custom invoic control flow busi process ment simpl script applic bed sql implement found todai workflow manag system integr control flow script assum mail order busi exploit internet present product custom place order web invoic payment credit card extens main busi process requir addit activ integr busi regist order substitut exist check custom credit card modif current control flow script requir corpor activ order implement busi mail order busi modifi exist adventur reimplement busi process workflow manag system mail der busi face problem futur extens invest current control flow lost depend busi process busi process reimplement includ exist applic program perform activ busi process initi problem implement occur high risk busi dai week transit problem solv show workflow manag system support smooth transit ment control flow control flow handl workflow system import workflow ment system integr exist implement handl control flow script increment workflow manag system workflow manag system todai face start exist applic set input paramet catch complet notif output gener applic integr script requir addit observ part busi process script workflow specif guag power model execut script reflect execut state observ lead architectur integr workflow manag function exist environ support requir integr substitut exist control flow implement case mail order busi mean workflow manag system coexist script check check inventori final initi deliveri order item custom workflow manag system extens regist order made web handl payment credit card seamless integr system extens compon workflow manag system highli workflow applic depend requir function includ worklist workflow histori interfac workflow manag system worklist manag major task worklist manag sign work item actor base specif assign depend workflow assign strategi complex principl dual load monitor workflow administr inform rent state workflow kind level detail format strongli depend workflow applic hold histori consid aggreg monitor inform workflow system involv execut face system requir involv system support standard common interfac provid applic interfac perform applic specif interfac easi gener compon facil complex design footprint workflow manag system major case subset function exploit workflow manag system provid mean implement system extens seamlessli integr system lead workflow manag system facilit implement seamless integr system extens plicat suffer runtim overhead larg tem footprint system extens function exploit show requir convent requir workflow manag system reflect architectur architectur section present approach tailor workflow manag system base mentor workflow manag system aim simpler architectur main goal provid kernel function insid workflow system compon histori manag worklist manag extens top kernel kei point retain natur extens implement workflow invoc interfac applic program interfac integr script provid coin approach present compon architectur introduct workflow specif state activ chart compon architectur shown figur basic build block interpret workflow specif base state chart addit commun manag log manag close integr workflow interpret compon form workflow case ident workflow kernel support protocol distribut execut workflow commun manag ble send receiv synchron messag engin messag inform local updat state chart variabl state inform local engin synchron messag updat receiv site perform order consist global state enc site network deliv synchron messag queu transact plan substitut facil corba object transact servic log manag log facil recoveri separ workflow log site workflow engin run workflow repositori repositori workflow worklist share workflow engin site applic program script connect workflow engin specif wrapper detail interfac present section workflow specif term state activ specif languag mentor interpret perform execut workflow tion formal semant activ perform step determin start contrast initi includ interpret runtim dynam modifi applic depend facil worklist histori manag monitor implement top state activ chart interpret workflow interpret workflow specif detail implement worklist manag histori manag workflow engin workflow interpret worklist mgmt workflow repositori worklist monitor histori mgmt workflow spec figur architectur invoc workflow log workflow engin workflow engin wrapper script applic program wrapper state activ chart section briefli describ formal state chart specif formal adopt behavior dimens uml industri standard state activ chart dual view specif activ reflect function decomposit system denot compon correspond directli activ workflow activ chart specifi data flow form direct graph data item arc annot state chart captur behavior system control flow activ state chart essenti finit state machin distinguish initi state transit en rule transit state state annot eca rule form fire event occur condit hold effect state state action execut condit action express term data flow activ chart action explicitli start express gener event set condit set condit compon tripl empti state chang state chart execut view singl state induc discret time dimens import addit featur state chart nest state orthogon compon nest state mean state entir state chart semant enter initi state state chart automat leav state state left capabl nest state refin specif design process insert fine macro orthogon compon denot parallel execut state chart state entir state chart view singl compon enter initi state transit compon proce ject precondit transit fire integr applic section discuss approach integr plicat program distinguish plicat program invok coordin plicat script implement exist control flow call applic program interfac applic program workflow manag interfac plicat program complet implement insid applic wrapper basic commun implement distribut comput environ corba top protocol complex interact applic program term state activ chart design specif languag reactiv state activ chart suit serv languag workflow interfac protocol interfac protocol workflow design program implement interfac protocol activ defin activ chart tag invoc remot procedur call oper system corba call interpret workflow activ tion implement invoc activ call show corba interfac control applic program realiz corba applic proxi object fy wrapper creat function statement creat proxi object wrapper applic workflow engin address space return handl object applic wrapper enabl workflow engin start stop applic program exchang inform applic applic program event set state chart variabl figur implement applic specif wrapper figur gener interfac definit applic wrapper idl applic program receiv updat state chart variabl gener interfac applic wrapper shown figur function constitut function invok applic figur applic start issu oper system call function termin applic function transfer inform wf engin applic function transfer inform applic wf engin wf engin access function wrapper implement handl return call wf engin wrapper start applic app call interfac definit implement implement class wrapper interfac applic requir applic program offer desir function applic program face mention set function build block implement complex invoc interact col kernel applic program term state activ chart gener state ling actor suspend resum form librari invoc protocol workflow specif interfac script approach provid simpl wrapper ing complex interfac protocol term state activ chart integr exist script librari state activ chart templat model gener step integr exist templat model intercept applic call issu script transfer invok applic enabl extens exist control flow reimplement scratch mail order busi scenario serv illustr step integr defin state activ chart script activ chart consist singl activ repres state chart consist state initi transit start activ order link activ simpl wrapper provid invoc interfac requir state activ chart workflow consist exist script simpl form option workflow specif extend insert activ control flow script call part extend workflow atom activ remain unchang call applic program issu script rerout workflow manag system kernel intercept applic invoc script decoupl activ invok activ substitut complet activ invok place origin activ dummi activ implement null action make part script ineffect option increment substitut script state activ chart script substitut state activ complet rewritten scratch approach discuss option tend exist control flow implement mail order busi scenario option head disregard paper section mail order busi internet custom place order payment credit card extens requir addit activ exist activ substitut workflow term state activ make exist script regist ing order check check inventori order item print invoic figur show activ script repres activ script tional activ extend origin workflow option insert order script perform payment credit card activ explain substitut origin check er integr requir origin call check script intercept rect credit card check handl credit card check control extend workflow option figur state chart shown suffix state identifi web order arriv order base activ start initi transit state exist activ script start activ tion evalu true nest state enter nest state conceptu split script figur activ chart web order busi extens script part repres state correspond exist control flow issu check state enter check call origin check activ invok transit state fire script condit activ start note repres activ fi code script remain unchang call applic redirect workflow engin show detail invoc wrapper commun workflow engin execut part state chart correspond nest state figur show action perform workflow script substitut program activ left hand substat state transit shown hand invoc wrapper stub commun wrapper stub workflow engin shown enter state initi transit substat activ script start activ repres applic program invok start activ script result execut wrapper script wrapper start script proce call check applic origin behavior issu call wait complet call intercept stub check set condit true pass call inform check workflow engin substitut check credit card workflow engin invok wrapper applic program check credit card start activ applic program successfulli wrapper set condit true pass dition variabl return paramet credit card check workflow engin workflow engin receiv dition transit state state activ start activ relai return valu workflow engin turn relai script script notic differ execut check check credit card proce rest code script finish wrapper set condit true shown integr script workflow perform note workflow engin wrapper applic program defin section suffici implement integr simpl stub implement redirect call exist applic program requir stub gener redirect call protocol stub term state activ show feasibl state ty chart integr exist control flow implement investig major obstacl grate current workflow manag system environ exist busi current workflow manag system suit control flow scratch provid limit mean interact exist ness process compon worklist manag histori manag tailor specif applic scenario overhead lack function problem area orthogon issu extens workflow ment system crucial architectur asset direct argu system kernel provid basic execut figur state chart web order busi extens figur protocol workflow engin script wf engin stub check script applic program set true worth set true set set true execut exist control flow execut exist control flow execut exist control flow execut cc check commun solut lem implement workflow specif workflow shown state activ method choic suit implement specif protocol integr exist control flow increment manner option administr facil top kernel workflow function implement distribut reliabl fault toler encrypt automat extens decentr execut role resolut gi work item decentr histori manag addit implement effort plan extend prototyp implement proof concept investig area applic program interfac distribut ing environ corba dcom enabl workflow specif applic simpl invoc facil requir extend wrap function top distribut comput environ implement extend wrapper program languag state activ chart basic lite kernel interfac distribut program environ implement implement librari option administr facil worklist histori manag plan investig feasibl approach demand system compon alert mechan base time constraint interfac workflow manag system investig impact architectur system perform aim defin simpl realist benchmark appli compar workflow manag system present refer el iti limit current workflow manag ieee vol workflow concept spatial advanc lectur note comput vol form distribut applic develop manag dynam workflow distribut journal special issu vol object decad proc intl conf larg data base workflow ment system web transport technic report dartmouth workflow process autom concept kluwer academ corba servic sheth workflow manag system nato advanc studi workflow manag system overview workflow process model workflow distribut parallel vol applic workflow manag proc intl conf expert system applic dcom state visual formal complex scienc comput vol pp harel work environ develop complex reactiv ieee transact softwar vol wrapper tsimmi proc acm sigmod conf semant state technic octob manual technolog modular workflow model proc intl work conf dynam model inform workflow model intern son comput deal discrep wrapper de base de capabl base mediat proc acm sigmod conf meteor workflow manag journal intellig inform vol kotz workflow manag base state activ kotz central workflow specif distribut workflow journal intellig inform special issu workflow vol leverag mediat cost model heterogen data proc intl conf data engin common object request architectur rev technic object manag open approach oltp tice structur workflow manag lotu proc ieee comput societi intl santa dont scrap wrap wrapper architectur legaci data proc intl conf larg data base sheth nsf workshop workflow process autom inform gener framework execut heterogen program flow manag proc intl conf cooper format system workflow applic research scalabl dynam work coordin tion global white system system unifi model languag version becker busi process model workflow al thomson publish approach workflow manag scientif workflow manag mediat architectur futur mation ieee comput march flexibl worklist workflow manag proc edbt workshop workflow manag kotz mentor architectur workflow manag kotz mentor step workflow proc intl conf data engin benchmark workflow manag system proc technik und workflow histori manag virtual workflow manag proc intl workshop research issu data engin
DB/1183 3 effici extens algorithm multi queri optim roi iit bombai seshadri bell lab sudarshan iit bombai abstract complex queri grow support system complex queri lot common singl multipl queri run batch optim aim exploit common subexpress reduc evalu cost optim view earlier algorithm explor doubli exponenti search space paper demonstr optim heurist benefit heurist base simpl modif volcano search greedi heurist greedi heurist incorpor optim improv effici greatli algorithm design easili ad exist optim present perform studi compar workload consist queri benchmark studi show algorithm provid benefit tradit accept overhead optim time introduct complex queri due advent automat tool analyz inform larg data complex queri lot common subexpress make extens view refer multipl time queri correl nest queri part subqueri depend outer queri form common repeat invoc queri scope find common greatli set queri execut batch store procedur invok execut batch data requir batch queri execut work relat store xml found queri xml written languag translat sequenc relat queri task updat set relat materi view gener relat queri common benefit optim materi view increasingli support commerci speed queri process data store larg volum depend materi aggreg view effici queri materi view express increment updat tend amount common subexpress share common subexpress import express access remot address problem optim queri common tradit queri optim optim queri common make local optim miss global optim plan demonstr queri local optim plan individu plan common subexpress altern plan local clear common comput queri altern share global optim choic blindli common lead global optim strategi case cost join express larg compar cost plan case make illustr job ordinari queri recogn possibl share modifi optim search strategi explicitli account share comput find global optim plan work optim past prior work concentr primarili exhaust algorithm work concentr find common subexpress queri optim limit scope cost improv discuss relat work detail section search space optim doubli exponenti size exhaust strategi optim hitherto consid paper show make optim develop heurist present perform studi demonstr practic benefit algorithm base dag compactli repres altern queri plan dag ensur easili handl oper transform rule dag construct extens ensur common detect unifi dag construct account share comput base exampl share includ comput result task heurist optim algorithm decid subexpress materi share heurist lightweight modif volcano optim algorithm heurist greedi strategi iter pick subexpress maximum benefit materi import contribut li optim greedi algorithm make effici present increment algorithm comput benefit materi subexpress benefit share subexpress subexpress chosen recomput present monoton base heurist greatli reduc number benefit recomput requir present algorithm comput sharabl greedi algorithm appli sharabl node addit intermedi express result materi optim framework physic sort materi result algorithm handl choic indic creat materi relat algorithm easili extend perform optim nest queri multipl invoc queri paramet note algorithm made work system style optim main contribut show engin system smoothli integr work seamlessli implement queri optim base volcano optim modifi implement optim addit effort line code conduct perform studi optim queri benchmark queri base schema studi demonstr save base estim improv actual run time commerci perform result show optim algorithm give benefit singl queri accept extra optim time cost extra optim time execut time save heurist beat basic volcano gener greedi produc rest paper structur describ set search space optim section heurist section greedi algorithm section extens creat index intermedi relat nest queri discuss section describ result perform studi section section discuss relat work present direct futur research section set search space optim mention section job optim recogn possibl share comput essenti set search space identifi common modifi optim search strategi explicitli account share comput find global optim plan task import crucial optim orthogon detail search strategi depend aggress identifi common subexpress efficaci strategi explor task search strategi compon work lack space outlin high level idea intuit algorithm identifi common section refer full version paper detail locat section describ algorithm identifi describ dag queri dag direct acycl graph node divid children children dag correspond algebra join oper select oper repres express defin oper input refer oper node repres set logic express gener result set express defin children node input refer node henceforth queri tree initi repres directli dag formul queri tree figur initi repres dag shown figur node shown oper node shown circl initi dag expand appli transform node initi queri dag repres set queri transform join associ commut plan plan modulo commut obtain transform initi figur repres dag shown figur refer dag transform appli expand dag note expand dag node subset node repres wai comput join relat subset shown join node join node input expand dag transform initi queri dag queri figur initi queri dag techniqu effici gener dag repres queri optim avoid duplic deriv due join associ shown time complex dag gener case join system style optim lack space omit detail dag detail found extens dag gener optim appli optim batch queri repres singl share subexpress make dag pseudo oper node root node queri input outlin extens dag gener algorithm aid optim extens deal identif common subexpress queri subexpress logic syntact initi queri dag node repres subexpress modifi volcano dag gener algorithm find node appli join unifi replac singl node volcano algorithm hash scheme detect repeat avoid creat duplic node due cyclic deriv express transform transform back modif hash scheme detect unifi duplic node creat transform express detail unif found extens detect handl subsumpt subexpress queri result obtain result addit repres possibl add extra oper node introduc node add deriv node repres share access select number select express creat singl node repres disjunct select condit similar deriv aggreg ag introduc node add deriv node groupbi ag idea appli oper subexpress gener earlier integr option separ space altern plan optim algorithm simplifi optim avoid deal explicitli deriv physic dag properti result sort form part logic data model call physic properti physic properti intermedi result intermedi result sort join join cost potenti reduc merg join hold true intermedi result materi share straightforward refin dag repres physic properti obtain physic dag search algorithm easili understood physic work physic dag explicitli physic properti detail implement handl physic properti base optim algorithm section studi class optim algorithm base result comput part queri present extens volcano optim algorithm describ section briefli outlin basic volcano optim extend find plan node dag materi section present heurist volcano optim algorithm materi view volcano optim algorithm oper expand dag gener earlier find plan node perform depth dag start node cost defin oper node cost oper node defin cost execut children node cost node node children repres volcano cach plan find case node depth search dag branch bound prune perform carri cost limit relev discuss algorithm benefit equal prune lack space omit refer reader extend volcano find node dag materi denot cost materi result denot set materi node find cost node set node simpli volcano cost formula chang comput cost oper node input node materi minimum comput express cost execut node refin multipl physic requir physic physic dag cost execut oper account cost read pipelin algorithm call expand dag optim basic volcano optim algorithm plan comput virtual root combin volcano plan individu queri plan produc volcano optim algorithm common subexpress consolid plan root dag node plan algorithm work consolid decid cost base manner node materi share materi node involv store result assum pipelin execut recomput node cheaper cost materi node experi section occas cheaper recomput express naiv solut node denot comput cost node denot number time node execut plan denot cost materi node denot cost materi result decid materi left hand side inequ cost materi result materi result hand side cost altern result materi recomput test simplifi problem solut depend node node comput node node comput node node time comput comput comput materi reduc depend ancestor volcano plan depend descend materi comput base number parent materi comput set node materi naiv exhaust strategi decid node volcano plan materi subset node comput cost plan node subset materi subset give minimum cost select actual materi strategi exponenti number node volcano requir cheaper heurist pseudocod algorithm shown figur make materi cost comput node consid number underestim number make comput underestim number simpli comput number ancestor volcano plan procedur consolid volcano plan virtual root dag set node materi plan global set node chosen materi perform introduc subsumpt deriv root set root root undo subsumpt deriv subsumpt node chosen materi return procedur return oper child input node return comput cost comput cost oper introduc subsumpt deriv add decid materi save parent due introduc materi add decid materi memoiz return figur algorithm plan bottom node decid materi plan bottom decid descend plan materi set descend comput node section base make materi node materi note place dont exact number lower bound lower bound decid materi materi result cost save final step factor cost comput materi node chosen materi cost comput add set node chosen materi return step note basic volcano optim algorithm exploit subsumpt deriv cost local optim perform check subsumpt node plan produc basic volcano optim algorithm subsumpt deriv replac origin deriv subsumpt deriv end share subexpress chosen replac deriv origin express replac replac procedur expand dag queri subsumpt set node materi plan set potenti materi node node set comput plan assum node materi node set worth materi add set combin singl plan make final materi figur algorithm effect algorithm depend tightli bound improv algorithm obtain tighter lower bound kei observ note materi addit node plan number node plan comput superset set node chosen number node assum node materi show comput cost number cost node node plan materi cost potenti materi node plan satisfi remain node satisfi inequ set node plan satisfi inequ superset set node comput number node tighter underestim implement base improv perform studi found perform overhead due addit step requir improv algorithm neglig fraction optim cost basic idea similar unlik calcul cost comput base earlier materi choic algorithm intuit plan shown share optim realiz plan choic plan found intuit algorithm batch optim track plan chosen earlier possibl part plan pseudocod algorithm shown figur queri optim algorithm optim sequenc optim note node dag part plan candid potenti maintain count number node check node worth time add node optim assum materi earlier find plan check worth materi add assum materi optim queri optim individu phase execut plan found detect exploit common subexpress step essenti earlier phase possibl share common subexpress singl queri node ad optim entir queri ad node algorithm impli materi make final node materi differ directli appli result volcano optim plan chosen share part earlier queri unlik volcano plan relat implement issu cach plan dag optim cach plan node dag optim queri find node recomput plan set node lead plan note cach plan queri optim plan recomput plan requir note result depend order queri consid simpl queri forward order find minimum cost plan note dag construct extra cost order small order optim time greedi algorithm present greedi altern approach algorithm previou section major contribut li effici implement greedi concentr aspect present algorithm optim philosophi algorithm pick set node materi find optim plan node materi repeat set node find set node materi greedi present exhaust algorithm assum virtual root node node input logic oper input queri denot virtual root node set node denot cost optim plan node materi cost includ cost comput materi node basic volcano optim algorithm definit cost node find motiv greedi describ simpl exhaust algorithm exhaust iter subset set node subset opt minimum opt cost global optim plan easi exhaust algorithm doubli exponenti size initi queri dag impract figur outlin greedi heurist attempt approxim opt construct node procedur greedi expand dag consolid input queri set node materi plan set node dag pick node smallest fxg fxg fxg return figur greedi algorithm time algorithm iter pick node materi node maximum reduct cost materi chosen ad greedi algorithm due larg number node set larg number time function call present import optim greedi algorithm make effici practic optim base observ node materi global optim plan subset share plan queri suffici initi figur node share plan queri call node sharabl node expand dag sharabl present effici algorithm find sharabl node section optim base observ call line figur paramet simpl option process call independ call observ symmetr differ paramet success call small call paramet form fxg vari make call leverag work previou call describ increment cost updat section maintain state optim call increment comput state state call monoton avoid invok fxg line figur describ optim detail section sharabl outlin detect node share plan plan tree plan tree obtain dag structur replic share node complet elimin share share logic node evalu plan number time occur plan tree share logic node expand dag maximum share node evalu plan repres dag logic node sharabl share expand dag greater present simpl algorithm comput share node detect node share node consist node edg function node minimum topolog sort number remov min oper node parent oper node cost execut oper add ps parent node present figur increment cost updat node origin dag node node root repres share root node node valu comput valu children oper node share node dag root dag space minim comput discard end comput reason implement algorithm time complex proport number entri worst case proport squar number node dag fairli dag typic number queri height dag wider sharabl comput algorithm fairli effici practic queri consid perform studi comput ten millisecond increment cost updat set call success line figur close differ small line find node maximum implement call fxg valu paramet drop node ad present increment cost updat algorithm exploit result earlier cost comput increment comput plan figur outlin increment cost updat algorithm set node share point previou call paramet increment cost updat algorithm maintain cost comput node share set node call paramet increment cost updat algorithm start node propag chang cost node upward turn propag cost parent cost chang cost total cost add cost comput materi node perform propag arbitrari order worst case propag chang cost node multipl time node ancestor node simpl mechan avoid repeat propag topolog number node dag dag gener dag sort topolog descend ancestor sort node number order cost propag perform topolog number order heap built topolog number heap effici find node minimum topolog sort number step care physic properti subsumpt detail perform increment cost updat physic dag physic properti subsumpt monoton heurist figur function call node normal circumst outlin determin node smallest monoton heurist defin fxg notic minim line correspond maxim benefit defin benefit monoton benefit node monoton node formal monoton associ upper bound benefit node maintain heap node order upper bound initi upper bound benefit node notion maximum share node initi upper bound cost evalu node time maximum share heap effici find node maximum node top current benefit heap reorder remain delet heap chosen materi ad assum monoton properti valu heap upper node ad node maximum real benefit monoton properti node maximum current benefit top heap procedur heurist find node greatest benefit experi section demonstr procedur greatli speed greedi algorithm queri experi result monoton heurist extens briefli outlin extens incorpor creation temporari optim nest queri exploit common optim multipl invoc queri cost substanti reduc creat indic relat materi intermedi result incorpor index model presenc index physic similar sort order algorithm execut physic result materi physic properti index select fall simpli special case physic absolut algorithm nest queri approach handl nest queri decorrel techniqu decorrel techniqu result queri transform cost heap heap topolog number earlier set temporari relat creat queri gener decorrel subexpress excel candid optim queri perform evalu bring point correl evalu effici effici decorrel queri standard relat oper correl nest queri repeatedli invok valu correl variabl queri select ax bx cy option optim correl evalu queri materi share outer level queri nest queri invoc index attribut requir effici access nest select correl variabl plan outer level queri join order materi share provid plan part nest queri depend correl variabl potenti share invoc extend algorithm multipl invoc nest queri kei intuit nest queri invok benefit due materi multipli number time result depend correl consid materi nest queri invari optim techniqu fall special case algorithm extend optim multipl invoc queri queri queri paramet select store procedur common part queri nest exploit optim extens implement detail found perform studi algorithm implement extend modifi queri optim develop earlier code basic optim approx common code line greedi line optim rule set consist select push join commut associ gener bushi join select aggreg subsumpt implement incorpor optim join prevent repeat deriv express implement algorithm includ merg nest loop index index select relat scan implement incorpor techniqu discuss includ handl physic properti order presenc base intermedi unif subsumpt dag sharabl algorithm greedi heurist block size cost function assum oper execut conduct experi larger memori size similar standard techniqu estim statist relat cost estim compon cpu seek time transfer time read cpu cost data process assum volcano greedi optim time volcano greedi figur optim tpcd queri intermedi result pipelin iter model save disk result materi share materi cost cost write result sequenti test perform singl processor mhz machin mb run linux optim time measur cpu time basic experi goal basic experi quantifi benefit cost heurist plain optim base case version consid forward order queri find share minimum cost plan experi workload experi consist queri base tpcd benchmark tpcd scale gb total cluster index primari kei base relat result discuss plot figur tpcd queri larg nest repeat invoc nest queri correl evalu benefit intermedi result lead improv plan estim cost sec return greedi result plan significantli reduc cost estim sec decorrel altern correl decorrel version batch optim substanti gain decorrel queri result plan estim cost decorrel result common subexpress plan optim coupl decorrel observ cost greedi cost plain volcano result optim queri decorrel test ran optim variant chang prevent decorrel introduc introduc intern oper replac correl predic ps ps modifi volcano gave plan estim cost greedi arriv plan estim cost improv factor consid tpcd queri common total execut time figur execut tpcd queri ms sql server make case algorithm lead plan approxim half cost return volcano greedi arriv similar improv lead appreci benefit queri time space volcano greedi time queri term rel time greedi maximum time time maximum small compar benefit total space requir greedi rang time absolut valu small result microsoft studi benefit optim real test effect queri mention execut microsoft sql server run window mhz machin memori tpcd scale test encod plan gener greedi sql model share creat temporari delet creat index temporari relat encod exact evalu plan sql optim measur total time execut step result shown figur queri time reduc sec sec perform decorrel origin result optim number match cost optim reduct decorrel version sec plan optim greedi decorrel queri queri speed sec sec sec sec plan share gener greedi result optim time improv real system import note measur benefit underestim potenti reason due encod share temporari relat store share incorpor evalu reduc cost oper set support queri optim time worthwhil materi relat sort order cheapli aggreg encod optim properli integr benefit significantli consist benefit cost estim volcano greedi optim time volcano greedi figur optim batch tpcd queri experi tpcd workload model system tpcd queri execut batch workload consist subsequ queri queri common subexpress queri repeat select constant composit queri consist composit queri experi experi tpcd scale assum cluster indic primari kei relat note queri repeat valu select found select oper gener land bottom volcano plan plan tree common subexpress result workload shown figur achiev improv volcano respect cost return incur neglig overhead differ impli choic plan earlier queri chang local plan queri greedi perform achiev improv uniformli algorithm essenti execut time space requir volcano greedi largest queri volcano slightli estim cost save extra optim time cost sec extra time spent greedi spent space requir greedi factor absolut differ benefit outweigh cost analysi algorithm scale number defin set relat ident schema sp denot part subpart id number defin sequenc compon queri sq sq compon queri sq pair chain queri consecut relat join condit queri pair sq select select arbitrari valu measur composit queri cq cq cq consist queri sq volcano greedi optim time volcano greedi figur optim queri number cost propag greedi number cost recomput greedi figur complex greedi heurist sq cq relat join predic select predic queri relat join predic select predic size base relat vari tupl tupl block index assum base relat cost plan optim time workload shown figur rel benefit algorithm remain similar earlier plan greedi continu optim time linearli optim time greedi practic small compon largest join predic select time size dag linearli sequenc queri conclud greedi scalabl larg queri batch size understand complex greedi heurist addit optim time measur total number time cost propag occur total number time cost recomput initi result plot figur note addit size number sharabl node linearli queri greedi consid worst case number node dag number edg dag dag wide tall add dag height height defin individu queri result show number time cost propag occur number time cost recomput initi linearli number queri observ complex worst case complex number time cost propag node constant cost recomput number node dag affect singl materi vari number exploit increment cost recomput height dag remain constant number relat queri reason effect optim seri focu effect individu optim optim queri effect monoton heurist addit greedi monoton node materi benefit recomput sharabl node materi monoton heurist found averag benefit recomput rang monoton benefit recomput lead optim time monoton monoton plan produc monoton heurist assumpt virtual cost queri ran monoton heurist larg time affect qualiti plan gener find benefit sharabl measur cost greedi sharabl comput turn node assum potenti sharabl rang found optim time significantli optim time sec sec sharabl comput optim optim implement greedi heurist result order magnitud improv critic practic discuss check effect memori size ran experi memori oper found cost estim plan rel gain essenti remain heurist cost optim depend execut cost benefit due depend size underli data benefit cost ratio algorithm markedli size data illustr ran batch tpcd queri experi tpcd scale size volcano return plan estim cost sec greedi obtain plan cost estim improv sec extra time spent optim neglig rel gain benefit show queri workload common relev issu perform workload rare nonexist overlap apriori workload benefit set flag optim bypass relat algorithm reduc plain volcano studi overhead algorithm case tpcd queri renam relat remov overlap creat batch consist queri relat renam overhead discuss earlier basic volcano optim greedi algorithm msec overhead note absolut number small sharabl detect algorithm find node greedi algorithm termin immedi plan overhead greedi due entir execut sharabl detect algorithm sharabl comput cheap queri share run time prefer exist case find plan good greedi time experi case addit invest time space greedi pai substanti improv plan low cost queri syntact complex queri optim rare execut frequent larg make greedi relat work optim problem address work describ exhaust abstract queri set altern plan set task task share plan queri exploit hierarch natur queri optim task subtask solut integr optim work consid share plan queri similar yield share problem materi select relat optim problem issu materi view select special case consid implement vista view select problem view find set workload consist queri updat optim problem differ assum absenc mind cost comput share view select problem concentr cost share express interest note optim find propag updat base relat materi view algorithm present view select problem similar spirit greedi effici implement greedi heurist major contribut li make greedi heurist practic optim implement show integr heurist increment recomput consid earlier sharabl monoton optim result great save lack effici implement reason author claim greedi algorithm ineffici select view materi cube queri reason optim normal sql queri base dag dag complic cube queri tend perform studi greedi heurist optim relat area cach queri result optim optim batch queri cach sequenc queri decid materi cach queri process relat work cach includ work consid queri express singl express work address issu manag cach previou result consid queri gener class queri optim algorithm implement queri optim presenc materi subroutin virtu work gener dag techniqu unlik solut problem detect express comput studi address problem problem find queri plan fashion consid problem detect invari part nest teach optim plan invari part larg perform optim nest queri automat solv problem address algorithm context commerci microsoft volcano base optim algorithm modifi ad top exist style main chang dag repres construct futur work heurist search optim present number techniqu greatli speed greedi algorithm algorithm base dag easili extend handl oper algorithm handl index select nest natur manner develop extens dag gener algorithm detect common express includ subsumpt deriv implement demonstr algorithm ad exist optim small amount effort perform queri base demonstr optim practic benefit reason cost benefit optim demonstr real system greedi strategi uniformli gave queri laid groundwork practic optim form critic part queri optim futur futur work includ extens idea algorithm extend deal space constraint materi result greedi algorithm select node order space exhaust import area futur work li deal larg set queri size workload reduc abstract instanc replac queri differ select constant invok multipl time schedul multipl pipelin parallel remov cost materi share relat scan implement data extend optim includ issu partit memori area work plan extend work perform materi view select index updat cost plan exploit greedi algorithm optim work support part grant engag system part work roi support ibm fellowship build basic dan motiv work paul larson sridhar ramaswami provid feedback earlier draft paper refer richard edward william lee david aggreg comput manag intl conf data surajit ravi shim optim queri materi view intl conf data srivastava multipl queri optim dynam queri order intl conf inform knowledg manag surajit chaudhuri effici index select tool microsoft sql server intl conf larg chen implement perform evalu adm queri integr queri result cach match extend technolog march finkelstein common express analysi applic sigmod intl conf manag page daniela alon ioana dan suciu queri optim presenc limit access pattern sigmod intl conf manag graef william mckenna extens search effici volcano optim gener technic report colorado decemb gupta select view materi data intl conf ullman implement data cube effici sigmod intl conf manag june yanni kotidi nick roussopoulo dynam view manag system data sigmod intl conf manag wl physic design data intl conf data larson yang comput queri deriv relat intl conf larg page cesar martin kersten complex join intl conf larg page park ari segev common optim multipl queri cs data engin lo februari view index relat acm tran rosenth architectur queri optim sigmod intl conf manag jun rao ken ross strategi correl queri sigmod intl conf manag kenneth divesh sudarshan materi view mainten integr constraint trade space time sigmod intl conf manag practic algorithm multi queri optim technic indian institut octob griffith price access path select relat manag system acm sigmod intern symposium manag page amit prasad jeffrei naughton materi view select dataset intl conf larg york selli intellig cach index techniqu relat system inform page timo selli multipl queri optim acm transact march selli ghosh multi queri optim problem ieee transact knowledg data page june naughton relat queri xml limit opportun intl conf larg praveen cliff leung complex queri decorrel intl conf data timo dana nau improv heurist algorithm optim data knowledg subramanian shivakumar cost base optim support queri transient view sigmod intl conf manag queri languag submiss world wide web consortium review comment jian li algorithm materi view design data wareh environ intl conf larg yang larson queri transform queri intl conf larg page august prasad amit shukla simultan optim evalu multipl queri sigmod intl conf manag
DB/1184 3 queri optim depart comput scienc colleg park joel saltz depart comput scienc colleg park john hopkin hospit depart patholog abstract paper present approach implement queri optim techniqu knowledg enhanc sql knowledg manag system semant data model classifi queri optim techniqu data access path relat techniqu compil simplifi queri predic cach optim memori hierarchi perform evalu predic work present result implement optim form perform analysi introduct paper present approach implement queri optim techniqu knowledg enhanc sql main compar convent sql capabl store knowledg knowledg manner analog approach deduct implement deduct capabl accomplish queri predic requir order verifi complianc tupl edg denot relationship verifi vertic match predic import deduct transform queri predic compil time smaller cheaper point work fundament share basic similar data model approach semant knowledg integr transform queri execut effici approach make compil optim techniqu memori hierarchi optim data access improv queri execut engin perform corrobor present quantit analysi improv techniqu work partial support sql extend semant data model execut limit infer target applic requir util ontolog gener semant network answer queri requir util extra knowledg object data exploratori task conceiv environ integr function algorithm standalon applic framework effici manipul knowledg form ontolog semant environ data oper work data featur leverag decad effort make system concurr present applic make clear classifi data exploratori task medic research domain typic medic attribut enorm space addit attribut semant depend interpret attribut instanc depend answer queri find patient cultur grow gram neg rod present queri power approach consist fact queri answer subsystem retriev patient organ biolog hierarchi main advantag approach case medic express complex queri burden expert underli data model borgida point approach similar user fulli familiar interest data exploratori task data mine data mine approach gener rule base sole content util background knowledg supplement discoveri process gener rule semant aggreg ontolog classic supermarket basket scenario gener rule le custom bui bui custom bui bui gener semant complex soda fact organ ontolog food item current architectur extens convent sql server built ground capabl standard sql server present integr eventu incorpor system current implement line code data model extens approach push convent dbm term capabl import summar concept manag system system support effici transact function dbmss declar languag serv role plai data definit languag queri languag dbm alcohol soda diet decaf classic sweet string wine figur excerpt food item ontolog weight edg repres object origin root categori formal describ capabl present author tackl gener problem repres knowledg data model datalog kei formal concept form tupl store concept basic predic emb kind knowledg world ontolog describ figur relationship queri issu applic select retriev tupl satisfi predic tupl alcohol product mean doesnt matter product categori figur predic evalu queri variabl instanti depend content edb approach defin formal hold domain factual knowledg describ defin oper domain knowledg ultim give dbm power raw data store tabl regard idb edb provid form relat tabl subsect formal support queri turn resembl formal specif ontolog defin abstract data type data data model mathemat formal notat describ data set oper manipul data ontolog ontolog figur object ontolog object ontolog arc show intra relationship object set object figur depict ontolog exampl object pertain ontolog set relationship label map object object basic form function defin relationship relationship function ariti figur relationship connect object call relationship relationship relationship connect object ontolog relationship connect object ontolog ontolog sophist kind relationship henceforth call complex relationship object connect object connect mean descend connect relationship relationship specifi word defin object descend relationship repres relationship happen object connect time relationship defin relationship kind relationship figur object connect object descend respect relationship mean complex relationship hold pair set ontolog graph vertic object vertic edg relationship connect vertic ontolog capit letter object capit ital letter descend respect relationship figur descend maryland relationship host relationship figur show subgraph ontolog ontolog ontolog abstract data type form categori relationship evalu relationship basic find edg instanc relationship relationship predic defin order return true figur show gener exampl relationship relationship complex relationship complex relationship figur depict relationship host interconnect object categori long distanc connect object categori telecom local connect pair categori telecom evalu relationship complex relationship infer evalu complex describ path concaten relationship found graph defin path descript found graph algorithm infer path regard evalu result true figur show infer path knowledg base depict figur long distanc defin path length connect object telecom provid locat order satisfi infer pattern telecom provid object connect telecom provid object relationship long connect object locat relationship local relationship complex relationship note order make notat object letter capit relationship lower case letter approach share common concept semant network develop context artifici intellig formal constraint graph structur explor perform reason db administr defin infer path make restrict sql extens point zaniolo support data exploratori support applic put extens convent sql command implement support semant data model section extens consist basic primit creat member relationship connect infer path syntax command implement featur semant network graph structur encod taxonom knowledg object properti node taxonom object constant arc subset arc isa set membership arc provid local provid locat figur long telecom infer path evalu search path connect instanc object locat instanc object telecom find intermedi relationship long distanc local local complex relationship host maryland salisburi colleg park host host host california lo angel san francisco san diego host host arizona florida usa host host host host bell atlant jone comm pacif bell figur sampl ontolog form class locat telecom provid dot arrow mean descend node hold relationship local host relationship defin relationship case ffl creat ontolog identifi user alloc space data structur store object relationship object creat ontolog ffl insert object valu ontolog creat command creat ontolog object pertain ontolog insert object valu ffl insert valu ontolog creat command creat ontolog relationship connect object ontolog insert valu ffl insert valu ontolog creat command creat ontolog relationship connect option relationship connect descend share relationship detail section insert valu command mean bell atlant local access object maryland descend maryland hierarchi defin host relationship ffl insert valu ontolog creat command creat ontolog infer path connect object ontolog ontolog insert valu ffl insert valu infer path creat command insert relationship part infer path detail section specifi relationship carri infer order defin infer path depth command call relationship part infer path insert long distanc valu long insert long distanc valu defin infer path depict figur ffl select command select standard tupl shown relationship found connect object select obj queri datalog queri local complex relationship ffl select command select standard tupl shown relationship found connect object object parent respect connect relationship object state compli select obj queri datalog sampl queri ffl select command select standard tupl shown infer path found connect object select obj long queri datalog sampl queri long ffl command delet infer path infer path basic relationship evalu return true project commonli part condit select join ontolog standard sql public attribut ontolog standard sql obj obj type object relationship object member object perfectli legal issu queri select obj assum ontolog telecom provid relationship establish compani local servic specif state queri optim introduct relat data model long translat queri procedur effici execut physic data object point translat phase involv correct translat higher level construct lower level includ select pool sequenc oper lead effici execut queri execut procedur step collect queri optim research literatur establish queri evalu compon sql queri optim queri execut engin queri optim gener input execut engin work sql queri perform express simplif gener bundl execut plan set optim work level queri execut engin implement physic oper oper data stream gener data stream output convent exampl kind oper sequenti scan index join oper regard build block make execut sql queri context build relationship infer path detail section oper basic evalu predic ariti base inform store set optim work goal make oper faster definit queri optim encompass kei aspect discuss context work semant data access path aspect deal situat semant knowledg lower cost predic evalu knowledg physic data access path deriv data order answer queri strain optim studi semant aspect context object instanc data access path aspect explor chaudhuri overview queri optim relat system distinguish characterist make optim categori order provid faster queri answer environ present problem context queri optim due peculiar identifi techniqu area semant area data access path relat optim semant optim special power algorithm evalu simplifi queri predic lead cheaper execut remov redund express data access path relat optim save gener engin execut demand algorithm join data situat semant optim encount techniqu henceforth provid quantit gain present section select join optim techniqu extens convent compil gener code evalu boolean call evalu definit evalu set subexpress object found descend object respect relationship relationship relationship connect subexpress reduc easi prove satisfi satisfi descend subsum result evalu definit understood ontolog locat depict lower box figur evalu md object descend subexpress md encompass tupl satisfi cheaper evalu techniqu arena program languag optim call constant fold assum compil detect data flow variabl constant variabl replac constant remark techniqu potenti gener save dbm save disk buffer manag layer access definit constant subexpress queri execut engin determin evalu true queri execut procedur termin gener tupl subexpress elimin queri express constant fold queri optim find subexpress maryland usa subexpress reduc maryland usa usa predic evalu remov queri express techniqu approach problem common extens postgr deal problem evalu potenti complex predic written handl larg amount data geograph predic requir ontolog data structur definit express subexpress ontolog predic slower comput compar simpler condit compar scalar attribut scalar valu queri predic relationship infer push end express unnecessari comput queri condit queri rewritten tupl satisfi comput data access path relat optim optim queri execut plan extra data optim usag memori hierarchi point queri optim auxiliari data structur order effici retriev set tupl relat florescu refer due uniqu attribut extend idea bit optim knowledg ontolog graph store optim memori hierarchi cach deem memori hierarchi buffer predic evalu cach carefulli store inform predic evalu engin high speedup achiev definit state kind optim implement addit standard predic evalu sql server implement set primit requir capabl data case ontolog main physic relationship infer path evalu implement oper physic oper scan case assum oper scan index indic evalu relationship simpli requir evalu operand object possibl link relationship complex relationship object descend object hold relationship invok infer path evalu complex section intermedi relationship evalu fix argument instanti satisfi oper oper act relationship evalu relationship evalu relationship instanc satisfi necessarili argument argument obtain deriv instanc relationship adjust presenc relationship requir relationship evalu definit defin formal optim definit predic attribut low evalu constant attribut low cach benefit strategi issu disk access evalu quickli retriev cach techniqu effect cardin make cach hit similar approach call function cach suggest context extens approach system evalu usa valu constrain state provinc benefit cach result host clear implement optim queue lru recent replac polici predic queue search result return eventu presenc updat queue entri check definit knowledg ontolog tend static data structur updat frequent data repres graph shown section store graph special infer multipl scan ontolog data part graph comput infer path infer path datalog order satisfi find make subexpress true graph multipl time relationship definit cach ontolog relationship effect comput infer path implement carefulli check relationship evalu predic relationship infer instanc predic retriev store cach process call bootstrap oper rewritten valu cach perform analysi perform measur develop version tweak turn optim context paper experi show improv small ontolog small sun sparcstat lx result summar tabl gener time benchmark queri version version specif optim turn indic optim predic cach knowledg cach system find cold cach fill start cost remark real life find cold measur worst case scenario gener environ time measur depict figur ontolog locat ontolog telecom provid tabl custom entri number relationship object ontolog queri time number page read buffer manag layer measur time result averag benchmark queri queri select custom queri return custom custom live maryland queri select custom park queri return custom custom live specif citi call colleg park queri select custom queri return custom custom live averag phone bill greater queri select queri join return pair custom compani state compani provid long distanc phone servic specif custom queri assembl appli optim techniqu benefici fact queri typic domain target investig confirm aspect point potenti typic queri automat gener gui complement ontolog potenti subexpress displai kind redund made explicit queri test set highli probabl time queri improv evalu predic cach knowledg cach queri simplifi select custom fname custom version queri queri queri queri na na na cf na na na er na na na pc kc optim tabl time benchmark queri pc kc predic evalu evalu tupl custom queri constant fold pc kc give improv time answer er special import queri simplifi select custom fname custom custom park queri improv obtain express reorder pc kc er queri rewritten select custom fname custom custom avg queri predic cheaper predic comput queri kc optim join comput requir predic comput time tabl give quantit measur improv obtain improv rang time faster queri answer time argu improv scalabl function number tupl evalu fact faster time obtain piec memori memori hierarchi system buffer manag predic knowledg amount extra memori consum replac polici cach applic administr tweak engin achiev desir perform resourc specif tabl activ buffer manag layer dramat reason graph algorithm data gather previou page replac activ layer greatli reduc futur improv analysi section show implement queri optim provid great deal improv system term faster queri answer procedur implement make smarter usag data access evalu queri predic knowledg ontolog optim comput complex memori usag faster queri answer engin improv environ tabl ontolog larg support integr implement algorithm version queri queri queri queri na na na cf na na na er na na na pc kc optim tabl buffer manag activ number page read queri queri optim complementari techniqu plan incorpor system add capabl handl integr constraint work part bigger effort build environ data exploratori task carri process ad high level oper includ data tree cluster addit standard sql oper intend investig impact optim deriv opportun fact integr oper potenti improv se evid gather context research conduct data oper standalon tool aspect explor work impact optim techniqu process knowledg gather evalu queri discard end answer procedur approach avoid patch cach presenc review conjectur updat simpl handl highli cach techniqu improv execut time group queri refer swami mine associ rule set item larg acm sigmod confer manag page saltz knowledg base manag system manag system brazilian symposium borgida relationship descript logic predic logic queri intern confer inform knowledg page minker approach semant queri optim transact chaudhuri overview queri optim relat system acm symposium principl page chen dunham common subexpress process process ieee transact knowledg data manolescu queri optim presenc limit access pattern acm sigmod intern confer manag page hellerstein stonebrak predic optim queri predic acm sigmod confer manag page hendler technolog system ieee intellig page lakshmanan structur queri optim uniform framework semant queri optim deduct acm principl page lakshmanan semant queri optim deduct intern confer data engin levi sagiv semant queri optim datalog program acm principl page advanc compil design implement morgan agraw integr associ rule mine relat altern implic acm sigmod intern confer manag page miller graphic tool ad hoc queri gener american medic informat ullman system comput scienc ullman approach knowledg nation confer aaai american associ artifici zaniolo wang aggreg gener system springer verlag edit apt marek truszczynski
DB/1185 3 order queri plan data integr abstract goal data integr system provid uniform interfac multitud data sourc user queri formul system translat set queri plan plan queri formul data specifi access sourc combin data answer user queri number sourc system gener execut queri plan significantli vari util crucial system find plan effici execut accept time qualiti answer describ effici solut problem formal defin problem order queri plan identifi interest structur properti problem describ order algorithm exploit properti describ result suggest guidanc algorithm perform condit introduct goal data integr system provid uniform interfac multitud data free user labori manual interact individu sourc system interfac user pose queri mediat virtual schema captur salient aspect applic domain data integr system typic consist main queri execut engin user queri formul mediat queri reformul translat set queri plan plan queri formul data specifi access sourc combin data answer user queri data integr system answer queri relat movi system access sourc î tupl sourc tupl queri review movi star harrison reformul gener queri access sourc î î titl movi star feed titl sourc obtain review doan alon depart comput scienc engin queri plan queri produc physic queri execut plan physic plan specifi queri plan includ order oper specif algorithm oper algorithm queri execut plan evalu queri execut engin import note sourc singl queri plan produc answer answer user queri union output queri plan research effort data integr concentr reformul optim issu algorithm reformul user queri optim recogn crucial build practic data integr led work level queri reformul optim execut reformul optim approach minim cost obtain answer sourc data integr time qualiti answer import applic larg number typic number queri plan larg plan evalu execut queri plan queri plan tend vari significantli util execut monetari depend sourc access import optim problem level find queri plan order data integr system focu execut plan queri execut abort user found satisfactori allot resourc limit reach plan defin number tupl return plan return plan execut sourc equal access execut queri plan order coverag return answer maxim likelihood obtain satisfactori answer earli sourc differ access enc coverag cost model util measur ù ô £ ô £ ô constant tradeoff execut plan order util balanc desir obtain answer pai cost recent work address problem dealt restrict data integr set consid specif class util measur paper address gener problem plan order seek modifi algorithm output queri plan order broad varieti util function time execut plan higher time find focu find plan rest plan found execut begun contribut formal defin problem unlik exist definit assum specif util class identifi interest structur properti problem provid insight effect describ algorithm exploit properti describ greedi algorithm applic time linear wrt number sourc find algorithm abstract idea ai plan describ result show problem class algorithm find plan fast result suggest guidanc algorithm perform condit background problem definit introduc prototyp data integr architectur discuss gener set queri plan user queri defin problem order queri plan sourc model data integr domain set relat schema relat movi domain introduct model schema relat figur model content data sourc sourc relat adopt approach describ sourc relat term conjunct schema relat mean sourc descript tupl found sourc satisfi conjunct sourc descript î å å figur sourc store relat î tupl actor plai american movi å note î necessarili tupl figur list descript movi data sourc schema sourc sampl bucket bucket figur data integr domain movi user queri conjunct queri user queri express conjunct queri é ê schema denot tupl variabl ñ refer subgoal queri queri tupl ê review movi å star harrison ford formul queri é shown figur conjunct queri plan ô plan ô form ô î í íò sourc relat data denot tupl variabl constant mean plan ô access combin data sourc î produc tupl queri é ô î plan answer queri é figur plan sound answer produc answer user queri union output tupl sound plan answer queri gener queri bucket algorithm reformul user queri set sound queri plan show section algorithm adapt work algorithm bucket algorithm creat schema relat ê queri set sourc return tupl satisfi ê queri é figur creat bucket shown figur algorithm combin form plan combin sourc bucket form î algorithm test plan output sound modifi bucket algorithm output sound plan order util notic number sourc queri plan cartesian product bucket bucket algorithm test plan sound order plan sound queri plan find plan significantli delai address problem creat bucket order plan cartesian product bucket plan order algorithm found optim thrown plan request order algorithm strategi execut sound sound order util sound plan distribut uniformli plan high probabl find sound plan plan output order algorithm plan sound unusu find sound plan plan probabl find plan examin plan cartesian high probabl quickli find sound plan paper adopt strategi queri assum bucket concern order plan creat cartesian product bucket focu find plan order gener plan cartesian product util util plan commonli defin number rel plan exist work assum util plan comput sole properti plan data integr util depend plan plan execut user queri exampl adopt gener notion defin util plan ô respect set plan queri é number indic rel plan ô execut denot util ù total process cost plan execut time monetari cost plan independ plan cach cost plan util plan execut cach result oper plan plan coverag measur number tupl return plan coverag plan vari depend plan execut access sourc overlap sourc access plan defin coverag plan ô respect set plan queri é probabl tupl chosen randomli tupl satisfi é return plan ô plan defin problem set queri plan answer user find plan ô highest plan ô assum ô plan ô assum ô ô plan definit queri util measur number ë set queri plan gener é find plan highest util ë order util find order ù ô ù section review variat address relat work problem challeng reason util plan depend plan order case simpli comput plan util sort plan presenc larg number set plan typic make method trivial applic import find kei problem properti enabl design effici solut section discuss problem properti problem properti util discuss util hold order plan local comparison sourc order plan cartesian product bucket order cost cost plan access sourc incur constant cost immedi obviou replac sourc plan sourc lower cost yield plan effect greedi strategi find find sourc cost return plan form found sourc motiv notion util monoton util function ù monoton wrt subgoal ø queri é iff bucket ø find total order sourc replac plan yield plan higher properti hold set plan execut ù monoton wrt subgoal é fulli monoton wrt é cost measur fulli monoton cost measur £ £ appli retriev movi star ford tupl join system site overhead cost access cost transmit movi item system number item output analog item cost measur fulli monoton term £ independ term £ vice versa cost measur linear combin independ term repres cost constitu fulli monoton cost measur £ £ £ appli retriev movi star ford perform join tupl paramet defin æ total number movi sourc term ò £ estim number item output cost measur monoton wrt subgoal transmiss cost monoton wrt fulli monoton exampl show practic util measur fulli monoton util appli algorithm greedi section effici order plan util measur fulli plan coverag util measur section effici order plan util exploit problem describ sourc sourc similar replac sourc plan util plan larg data integr domain tend similar sourc domain digit camera hundr onlin sourc sell digit camera natur divid group small offer camera steep discount poor custom servic special store deal charg higher excel custom servic end larg nation chain sell electron bui circuit citi carri extens offer reason custom servic averag high price store provid reason custom offer camera site review digit camera site natur divid free site site charg fee presenc similar sourc make larg data integr domain suit abstract techniqu base sourc similar similar sourc group reason singl sourc user bui camera greatli valu good custom servic examin characterist data integr system larg nation electron special store exclud group examin individu obtain substanti comput save section introduc algorithm exploit techniqu order plan plan independ addit properti prove plan independ return algorithm exploit properti conjunct abstract effici order plan plan independ iff util plan depend execut exist effici sound procedur infer independ plan pair simpli inspect constitu sourc import algorithm introduc reli procedur obtain plan independ inform effici case plan show plan independ constitu sourc overlap contribut attribut valu output tupl plan return refer properti util plan plan order properti hold plan coverag number tupl return plan execut plan greedi algorithm algorithm appli util measur fulli monoton explain work simpl term plan space refer set plan form cartesian product set bucket figur bucket form plan space ë appli greedi ë full monoton greedi find plan simpl find sourc return plan form found sourc plan î greedi proce find plan remov plan î plan space ë show remov split ë set plan figur remov plan î plan space ë result plan space ë space plan ë plan î greedi find plan ë plan greedi strategi compar plan return highest util plan proce similar manner find subsequ plan explain greedi remov plan î plan space ë basic idea split start bucket greedi split bucket split ë smaller plan space ë ë ë ë plan î greedi split bucket ë split ë plan space remov î end result remov î ë plan space ë formal describ greedi prove fulli monoton util greedi return correct order prespecifi threshold prove greedi run ç ñ largest bucket size ò queri length algorithm case util monoton hold larg data integr domain tend similar argu section abstract introduc plan algorithm abstract find plan set plan describ algorithm develop extend order plan planner basic idea group abstract sourc creat abstract plan plan process abstract plan repres set concret util interv util concret plan set plan ô domin plan õ concret plan ô ô util util concret plan õ plan find plan pair õ respect util interv elimin concret plan repres notic elimin õ place explicitli comput util concret plan comput save explain util plan coverag set plan cartesian product consist sourc shown figur sourc repres overlap overlap actual sourc proce stage iter group abstract sourc bucket bucket figur abstract sourc î î abstract sourc î abstract î yield final abstract sourc î shown figur similar abstract process shown figur bucket abstract plan î repres concret plan iter elimin abstract plan find plan start refin top abstract plan î set abstract plan replac abstract sourc plan compon sourc pick î refin compon sourc î î yield plan î î assum comput coverag plan interv elimin plan pick î refin î î assum coverag plan elimin î plan domin î plan î î pick î refin î î assum coverag plan î domin î î turn domin î elimin domin plan plan î left concret return î plan highest plan order note total comput coverag plan find plan repres save approach term number plan evalu plan evalu includ abstract evalu abstract plan slightli evalu concret carri interv point figur concret abstract sourc bucket queri movi domain appendix detail sourc abstract effici varieti heurist plan order suit data integr find plan order develop algorithm extend find subsequ plan algorithm straightforward extens begin appli find remov plan origin plan space remov result set plan space plan origin plan plan sourc plan appli find compar plan implicitli establish domin relat form ô plan discard end iter iter complet rebuild abstract plan space reestablish domin relat find duplic lot work previou iter observ led develop sophist extens algorithm applic return hold abstract sourc begin exploit plan independ properti track domin relat abstract relat search plan algorithm shown figur explain work section find plan creat domin abstract proce start top plan î refin plan î î step figur refin î î î point unlik elimin î domin î elimin simpli creat domin link î î step figur denot î î associ figur stage domin graph creat figur set link shown link link ô õ set denot õ link initi set plan empti shown figur describ shortli set maintain serv maintain domin graph node plan edg domin link domin relationship pick î refin î î step figur recal previou section î domin î turn domin î elimin domin plan creat domin link point domin plan domin nondomin î concret return plan step remov î continu find subsequ plan remov î domin remov link origin plan line step figur remov plan chang util remain render domin link invalid remov î coverag î chang plan overlap î overlap figur initi î domin plan õ link î remov î î longer domin õ link invalid find plan recycl domin remov î valid remain link inform plan independ check valid link ô õ ad î set õ check concret plan ô independ concret plan õ find plan conclud link ô õ valid true time link ô õ domin time plan queri util measur set bucket threshold plan ¢ order util foreach bucket creat top abstract sourc put top plan è ì domin graph set ù è loop plan foreach nondomin plan ù recomput ù foreach pair nondomin plan ù ù creat link set exist nondomin plan pick refin ô ô set ù add foreach plan ô st ô ô plan ô creat ô set ô remov plan ô back step abstract nondomin plan pick nondomin plan output plan remov foreach link õ õ õ add õ remov õ õ foreach plan independ set ù algorithm set concret plan return iff exist concret plan ö ö ö independ concret plan õ independ util util plan õ util model diminish return easili check remov î link shown figur valid link î î valid plan î î independ plan î î overlap check valid link step figur pick nondomin î figur refin î î assum comput coverag plan find î domin î creat link î î notic set link empti link creat nondomin plan graph concret plan î return plan remov domin graph check remov invalid link case remov î domin graph remov invalid link shown figur link î î valid plan î independ plan set link link invalid remov graph continu find author show return plan result prove return return correct order empir evalu perform experi evalu greedi outperform algorithm applic return correct plan evalu respect run time goal examin algorithm remov plan coverag plan ø remain unchang ø independ figur descript show practic util measur fulli quickli find plan relat algorithm literatur directli compar algorithm section compar algorithm comput exact plan order pi serv refer point experi pi plan independ inform decid util plan chang recomput experi util measur full monoton hold plan mention section detail appendix cost measur section transmiss cost vari sourc access sourc fail probabl fourth averag monetari cost output ù ô ô ô ô comput ô comput experi synthet data simpl abstract heurist group sourc base similar wrt number expect output tupl detail descript util abstract heurist found graph figur plot time queri issu plan bucket util measur count time gener step effici time algorithm experi run pentium iii dell dimens mb ram linux red hat discuss result util measur turn plan figur show follow perform compar pi find plan abstract heurist effect find run number plan evalu iter number plan evalu pi pi pi pi pi pi pi pi pi pi pi pi plan plan plan cach cach cach pi cach cach cach cach cach cach figur result queri length util plan cost sourc averag monetari cost abstract heurist size domin graph slowli output plan overhead maintain domin abstract refin elimin slowli achiev good perform find good recycl domin relat iter reevalu fewer plan perform pi find plan number output plan abstract heurist group sourc similar amount output tupl gradual lose sourc roughli amount output tupl longer contribut roughli equal number tupl answer abstract heurist prune fewer abstract plan end evalu plan pi result figur obtain overlap rate sourc bucket overlap sourc bucket experi overlap rate observ trend report observ rel perform compar pi find subsequ plan plan independ overlap rate overlap rate invalid domin recycl fewer fewer domin relat runtim runtim lower rate cost measur cost probabl sourc result cost measur report result cost probabl sourc failur ran experi cach option evalu algorithm plan independ figur show result case full plan independ return hold addit applic result show perform substanti find plan fast case plan abstract heurist effect find recycl domin relat subsequ iter figur show result cach result sourc oper cost subsequ sourc oper set result cach plan depend plan independ plan share sourc oper return applic result show perform compar pi find plan fast abstract heurist remain fairli effect substanti number plan evalu plan iter compar pi averag monetari cost figur show result cach case graph show perform pi find plan abstract heurist effect previou util evalu fewer plan fewer comput gain plan evalu small overhead roughli proport number plan number plan evalu overhead offset gain experi domain sourc abstract observ trend discuss experi vari queri length observ perform gap queri length draw problem class substanti outperform pi found plan gener complet set sound plan perform depend tradeoff number plan evalu overhead maintain domin graph refin elimin plan domain amen abstract effect abstract heurist evalu plan incur overhead perform find effici abstract find subsequ plan perform difficult find effici heurist case plan plan depend recycl domin relat discuss relat work address limit approach discuss relat work paper bucket algorithm gener show algorithm adapt handl method algorithm algorithm creat schema relat wai obtain tupl sourc algorithm form datalog plan ad rule origin queri execut datalog program produc answer queri user queri conjunct case consid rule cover schema relat natur form bucket appli algorithm appli conjunct bucket algorithm case datalog plan handl current due lack treatment plan note extend successfulli handl plan work serv good start point futur research extend case recent algorithm algorithm creat effect refer sourc cover set queri subgoal combin form set cover subgoal form sound plan easili modifi algorithm work order algorithm chang produc gener bucket cover set subgoal singl subgoal bucket creat plan set bucket cover subgoal appli algorithm plan space modifi order algorithm handl set plan space trivial import note plan space sound plan test plan output order algorithm case bucket algorithm queri research queri optim data integr fall group work work translat user queri queri local complet assert remov redund part queri plan queri plan work correspond union queri plan optim cost answer sourc order queri plan focu optim cost answer order queri plan subsequ investig author restrict data integr set queri plan access singl sourc algorithm design work specif sourc coverag algorithm output approxim plan output exact order author address problem develop algorithm significantli speed plan order algorithm differ import aspect deal case util plan depend plan execut assum full plan design return plan clear algorithm modifi output plan increment work directli compar author address relat problem seek find parallel queri access multipl sourc queri subgoal util measur linear combin execut time log plan coverag natur util measur design effici style algorithm find parallel plan author seek find parallel plan maxim plan cost limit interest twist work case intermitt sourc unavail work author present method order access sourc reduc execut cost garlic system find queri execut plan cost optim tradit author discuss gener effici execut queri plan fusion subclass data integr problem author gener initi solut iter rewrit current solut order improv work focu minim cost cost answer work execut plan turn ineffici due unexpect network delai inaccur sourc statist address work techniqu adapt queri execut plan interleav plan execut work similar aim minim time answer perform optim work level data integr system plai import role user obtain inform effici multitud data sourc presenc larg number data integr system process huge number queri plan queri plan costli vari significantli util crucial system gener plan quickli execut order accept time qualiti answer paper made contribut solv problem provid formal definit problem order queri plan order util unlik exist problem definit assum util class assum complet plan independ identifi interest problem properti develop algorithm exploit properti theoret result show varieti problem algorithm find queri plan quickli result suggest guidanc algorithm perform condit adam steve rachel anonym review valuabl discuss comment earlier draft paper work support part lab grant nsf grant nsf grant refer ambit knoblock flexibl scalabl queri plan distribut heterogen environ proc int conf ai plan system hellerstein continu queri optim sigmod doan effici order queri plan technic depart comput scienc duschka queri optim local complet proc nat conf duschka genesereth answer queri view proc pod levi probabilist inform data integr proc vldb friedman weld effici execut plan proc int joint conf ai goodwin loop refin planner proc int conf ai plan system aaai yang optim queri data sourc proc vldb goodwin effici theoret techniqu empir analysi proc nat conf uncertainti ai weld adapt queri execut system data integr proc optim inform gather plan proc int joint conf ai naumann queri plan inform qualiti bound proc int conf flexibl queri answer system levi combin artifici intellig data integr special issu artifici intellig recent trend develop ordil algorithm inform agent nation confer artifici intellig ordil queri heterogen inform sourc sourc descript proc freytag integr heterogen inform system proc vldb kambhampati joint optim cost coverag inform gather plan technic dept arizona state levi scalabl algorithm answer queri view proc vldb cost base queri scrambl initi delai proc sigmod vassalo papakonstantin knowledg redund queri optim mediat aaai workshop ai inform maxim coverag mediat web queri technic report stanford fusion queri internet proc int conf extend technolog
DB/1186 3 annal mathemat artif comput extend abduct transact program katsumi inou sakama depart electr electron engin kobe kobe japan depart comput commun scienc japan explain observ nonmonoton background remov addit observ explain order formal extend abduct introduc inou sakama gener tradit abduct comput neg explan remov unexplain neg observ comput mechan extend abduct background theori written normal logic introduc transact program comput extend abduct transact program set product rule declar addit delet abduct abduct explan comput fixpoint transact program model gener procedur correct procedur shown class acycl cover abduct logic program context deduct transact program declar specif updat nonmonoton updat introduct motiv background abduct infer recent recogn import form reason ai logic program tradit formal abduct defin explan observ set background logic entail observ background knowledg base observ tradit framework abduct comput inou sakama comput extend abduct set satisfi consist background theori theori monoton framework abduct background knowledg base nonmonoton knowledg base written nonmonoton logic observ tweeti good reason assum remov fact knowledg base explain observ tradit abduct situat abduct introduc knowledg hypothesi remov knowledg base cope inou sakama introduc notion explan background knowledg base observ set call neg explan consist explan satisfi call posit explan notic fly entail knowledg base block deriv situat notion unexplain observ background knowledg base observ set call set call neg extens tradit abduct call extend abduct paper extend abduct nonmonoton theori background knowledg base justifi inou sakama comput extend abduct reason introduct neg explan natur nonmonoton theori addit formula axiom delet previou theorem nonmonoton delet ad formula delet theorem case delet formula introduc formula nonmonoton reason posit neg explan plai complementari role account observ nonmonoton theori introduct account neg observ monoton theori tradit abduct concern explain posit observ neg observ perceiv situat induct system posit neg exampl construct hypothet theori notion plai dual role explan extend abduct enhanc reason abil tradit essenti theori nonmonoton theori chang abduct theori applic extend abduct includ view updat deduct contradict remov diagnosi repair diagnosi construct diagnost hypothesi identifi minim set fault compon set system compon comp comp consist system descript repres compon faulti repair compon observ diagnosi posit neg explan time al appli extend abduct formal system repair problem context model success techniqu verif concurr program protocol extend abduct extens tradit abduct recogn proof procedur extend abduct anticip comput method extend previou procedur tradit abduct natur outlin studi comput aspect extend abduct knowledg base written normal logic program introduc program transform produc transact program inou sakama comput extend abduct logic program complet program transact program kind disjunct logic declar specifi relationship liter express request addit delet abduct abduct infer comput trace rule program direct complet observ abduct comput clark complet tradit abduct transact program natur extens previou comput posit explan neg explan show procedur comput abduct explan transact program abduct explan observ program comput fixpoint transact program model gener procedur procedur consid extens abduct procedur inou sakama posit observ explain ad transform abduct logic program disjunct program paper notion mark liter introduc paper make liter rewritten procedur correct procedur shown class acycl program ground case class cover acycl program case special correct program present applic transact program updat context deduct transact program declar specif updat special transact program program marek truszczynski extend version rest paper organ section outlin extend abduct framework section introduc transform abduct logic program transact present fixpoint comput extend abduct section address comparison relat section conclud paper abduct framework abduct framework consid paper defin normal logic program finit set rule atom denot negat failur side rule side bodi rule empti call integr constraint inou sakama comput extend abduct empti head integr constraint repres special atom rule empti bodi call fact fact identifi atom program ground variabl nlp acycl level map ground atom natur ground rule level higher level horn rule negat hold rule form definit horn program integr constraint stabl model semant nlp nlp set ground ground horn nlp defin rule ground rule form note possibl infinit set ground rule uniqu minim model model ident call stabl model stabl model consist satisfi integr constraint nlp consist consist stabl model consist nlp atom entail includ stabl model note acycl program uniqu stabl model coincid model abduct logic program defin pair nlp set atom call abduc instanc element call abduc written loss assum rule abduc head fact alp acycl acycl definit ground atom pair call explan posit observ wrt set ground instanc rule abduc bodi made introduc rule abduc translat abduc similar transform appli fact emploi fact abduc inou sakama comput extend abduct posit neg observ simpli call observ call posit call neg call mix minim impli definit restrict version gener framework extend abduct autoepistem theori nlp alp definit result paper directli applic abduct logic program classic negat section number explan observ explan select minim criterion syntact form occam minim explan interest nonmonoton theori chang consid minim minim reduct background theori minim augment newli ad minim accomplish minim chang theori minim paper note hold minim introductori program section alp minim explan minim comput extend abduct provid method comput extend abduct section introduc notion transact declar chang observ hold section describ procedur comput extend abduct rewrit mark liter rule transact program section program assum result extend program section transact program introduc notion transact obtain transform abduct logic program transform motiv inou sakama comput extend abduct rule knowledg base observ hold atom formula call liter transact program consist product liter sequenc liter vertic line read mean sequenc mean conjunct liter product form side call side call consequ product note conjunct product form product written multipl product disjunct liter consequ common product form stand product set product disjunct logic program negat proposit atom definit ground alp transact program defin atom rule rule transform transact product equal inequ consequ definit inou sakama comput extend abduct defin includ case rule head bodi assumpt transform defin empti atom head rule atom introduc product gener step specifi abduct specif explain explain unexplain unexplain mean introduct remov correspond introduc empti string logic true ident set mean remov empti bodi imposs note integr remov mean satisfact constraint abduc requir add transact request remov addit product form mean remov impli requir rule product form mean addit imposs inou sakama comput extend abduct fixpoint comput comput extend fixpoint comput transact program fixpoint oper defin similar inou sakama disjunct logic program oper li notion mark view product rewrit rule liter rewritten mark recogn requir translat request atom formula call liter symbol call mark liter unmark transact program set ground languag herbrand base transact subset herbrand interpret transact specifi atom ad delet transact inou sakama comput extend abduct coher atom includ pair transact satisfi hold conjunct write transact satisfi product impli defin map set transact mark filter introduc transact denot liter mark mean liter remov includ mark unmark form conjunct liter lm denot set conjunct lm definit ground transact set transact map defin coher map defin product set product intuit read definit transact satisfi product reject product satisfi satisfi satisfi consequ expand ad singl disjunct consequ satisfi inou sakama comput extend abduct disjunct expand liter filter ad case simpli mark ad product ordin power defin successor ordin limit ordin definit mean limit ordin closur retain transact persist comput transact ordin smaller includ closur definit comput minim model disjunct logic program result fixpoint transact program fixpoint closur note fixpoint comput construct minim model manner product view disjunct model gener procedur similar comput mechan perform expand herbrand interpret program closur comput procedur stop finit step ground transact condit satisfi readi comput extend abduct fixpoint transact program call abduc liter program rule variabl head occurr posit atom bodi inou sakama comput extend abduct transact set unmark abduc liter denot set transact min denot transact program observ mean integr constraint satisfi integr constraint ad write definit acycl alp ground observ abduct step induct defin explain explain unexplain ground rule head unexplain explain ground explain unexplain unexplain ground rule atom unexplain explain max note definit provabl inou sakama comput extend abduct posit semant acycl nlp model model stabl model coincid acycl nlp hold acycl nlp stabl model provabl lemma acycl ground set ground instanc consist wrt minim wrt proof proof obviou induct abduct step minim explan wrt discuss provabl explain explain minim explan satisfi explain explain minim explan satisfi explain proof minim shown similar theorem ground acycl ground observ minim explan wrt transact min minim wrt transact min proof prove transact min min prove induct abduct step result follow lemma explain min min inou sakama comput extend abduct unexplain rule head min hold min result hold step explain minim explan ground rule explain unexplain induct minim explan min minim min product equal impli coher minim impli minim min unexplain minim ground rule form atom unexplain explain induct minim min minim explan min product inou sakama comput extend abduct disjunct liter product rewritten product conjunct liter form collect disjunct disjunct min min impli coher fixpoint minim impli minim min show put min min show explain proof backward corollari ground observ explan ground acycl alp figur comput explan inou sakama comput extend abduct min figur minim explan program theorem hold gener program explan min impli absenc explan acycl condit theorem program explan includ min correspond explan section show correct procedur comput neg assur class horn program theorem program alp result section directli appli abduct logic program classic negat extend logic program neg liter posit liter rule form answer set semant emploi semant program definit unchang addit requir inou sakama comput extend abduct definit coher transact coher transact includ complimentari pair liter case extend result previou subsect program alp cover nlp observ ground call cover alp rule variabl bodi head note integr constraint cover program ground transact comput ground assum predic atom abduc call predic abduc predic case gener case theori predic complet logic extens technic scope paper presenc variabl clark complet produc transact program recal clark complet defin rule written form variabl variabl origin rule note cover consid rule predic written form equal origin bodi definit alp transact program defin definit base clark complet cover program call constrain program inou sakama comput extend abduct definit cover alp transact program defin predic rule rule transform defin definit includ abduc predic rule rule form assumpt rule transform predic definit rule predic introduc essenti ground case transact program equal inequ cover program ground regard equal inequ liter evalu comparison true term instanti liter ident product evalu check recal rule abduc head fact section inou sakama comput extend abduct instanti unifi equal product occurr consequ product substitut term instanti unifi consequ occurr disjunct consequ substitut term instanti note nlp definit reduc definit map definit slightli extend variabl product instanti substitut transact mark perform instanti liter product obtain substitut match full unif nlp cover observ ground start ground observ fixpoint oper repeatedli appli long transact chang transact construct fixpoint comput ground liter model gener procedur introduc section case constrain fixpoint closur defin manner reach fixpoint result theorem directli extend comput acycl program theorem cover acycl ground observ minim explan wrt transact min minim wrt transact min proof proof theorem lift case includ inou sakama comput extend abduct posit observ min minim explan neg observ includ min minim alp section posit observ min minim explan neg observ min correspond minim discuss abduct procedur idea comput abduct transact program close comput abduct clark complet inou sakama comput extend abduct essenti previou work point procedur intend comput neg mix extend design comput posit explan product newli introduc transform clark complet procedur enabl comput neg observ treat atom complet formula gener transact program declar specifi abduct program gener work procedur call abduc abstract form naiv implement result procedur predic rewritten redund rewrit predic maxim avoid comput mark sound complet hierarch nlp acycl nlp strictli includ hierarch nlp classic proposit theori consid case fulli consid form definit rewrit rule equal fixpoint semant abduct logic program introduc comput tradit abduct comput extend transform alp disjunct logic program paper shown paper similar fixpoint oper comput extend abduct transact program kind disjunct program fixpoint comput realiz model gener procedur provid function rewrit mark realiz procedur abduct procedur abduct nlp abduct procedur develop comput posit explan comput posit comput rule introduc atom obtain credul explan neg mix directli comput abduct procedur damasio pereira abduct framework semant abduct perform system remov contradict program chang abduc liter chang true correspond remov abduc neg explan credul includ stabl model definit explan consid paper skeptic acycl program stabl credul skeptic explan coincid acycl alp inou sakama comput extend abduct mix unknown abduc due roughli correspond situat true assign abduc stabl model assign stabl model abduct framework comput procedur produc transact program procedur comput explan minim abduct explan gener fixpoint oper definit involv comput explan minim expand transact parallel model gener procedur design necessarili solut time expand transact definit breadthfirst manner transact program simul queri process acycl nlp queri posit observ fixpoint comput correspond queri process queri succe refut fixpoint empti set updat abduct updat deduct updat request fact translat updat fact updat call view updat view updat problem present deduct defin consist nlp set ground fact languag call fact insert ground fact delet accomplish updat satisfi satisfi condit condit updat accomplish insert condit present updat minim fact store relat updat request correspond posit neg observ fact correspond abduc view updat extend abduct inou sakama comput extend abduct lemma ground atom updat accomplish minim result obtain theorem theorem cover acycl ground atom insert achiev updat transact min delet achiev updat transact min comput updat fixpoint comput transact program kaka mancarella updat abduct procedur comput view updat procedur explicitli exist fact reason rule fact provid inform simplifi transact remov condit satisfi transact inform edb repres product fact kaka mancarella approach defin presenc integr make consist check candid solut candid inconsist integr constraint prune solv resolut decker satisfi updat request maintain integr integr constraint transact program integr treat uniform manner comput transact program abduct translat disjunct program updat realiz comput updat procedur procedur base tradit abduct produc transact program rossi naqvi clark complet comput updat horn updat transform formula obtain part result formula repres updat origin formula comput procedur lloyd provid procedur perform updat nlp comput updat procedur correct program requir check updat drawn perform updat request procedur produc transact inou sakama comput extend abduct concern satisfi updat gener topic find explan observ consol al discuss similar view updat appli abduc procedur view updat produc transact program inform edb incorpor comput view argu incorpor illustr abduct view updat extend abduct regard remov abduc part abduct grant al translat view updat set disjunct fact base updat achiev disjunct fact fernandez al realiz updat construct minim model satisfi updat request treat ground program possibl disjunct transact program produc transact program specifi updat disjunct introduc disjunct transact program view updat languag declar specifi dynam program transform automat gener updat specif origin program gener transact program kind disjunct updat natur express disjunct product transact program provid applic disjunct logic program note updat languag exist disjunct languag view delet definit aravindan baumgartn transform ground definit program disjunct program comput view delet definit transact program similar realiz view delet comput correct fixpoint comput horn program theorem ground horn ground neg observ minim neg wrt transact min proof lemma delet accomplish minim wrt negat failur neg definit consist product inou sakama comput extend abduct updat request delet concern transact program transact unmark liter case abduc remov abduc definit includ fixpoint product ls remov accomplish delet ls remov translat request delet liter case case abduc case ls remov successfulli accomplish analyz case chain eventu termin abduc ident number rule finit util definit abduct step definit unexplain theorem appli program acycl entail unexplain remov neg minim oper min fixpoint proof direct shown base similar argument alp inou sakama comput extend abduct figur comput explan shown delet illustr figur minim minim neg point gener contract algorithm includ view delet definit program requir comput minim posit explan sentenc contract wrt background knowledg abduc hit set correspond neg method directli comput hit set comput posit explan explicitli contrast transact program appli program negat comput posit extend abduct program marek truszczynski defin languag knowledg base mean program similar stabl model semant logic program defin knowledg base set proposit atom program consist rule inou sakama comput extend abduct proposit atom rule intuit mean constraint belong belong belong belong rule regard proposit logic minim model pair call chang initi dr kb program obtain delet rule form dr dr delet bodi remain rule chang dr call dr shown perform minim chang justifi rule direct arrow rule product similar syntax proposit transact program disjunct program rule liter bodi framework kb rule notion abduc chang repres chang atom includ atom languag insert delet notion mark repres liter transact translat atom inform comput program program atom subject chang view updat consid util transact program program section typic applic program updat recal nlp divid part rule bodi part fact initi kb set stabl model includ fact edb program construct updat request transform transact program kb dr comput transact program notic dr satisfi idb minim edb inou sakama comput extend abduct rule transform set initi kb stabl model insert put view dr obtain chang dr dr view transact includ ignor mark obtain coincid dr case note ignor smaller explan framework treat fact extend program view transform method gener program origin program deduct program construct idb applic program background knowledg base includ causal inou sakama comput extend abduct gener law author method gener program discuss decid rule obtain paper present method comput extend abduct abduct logic program transform transact program declar specifi abduct abduct explan comput fixpoint transact sound complet acycl cover alp context transact program declar specif enabl comput view updat construct manner transact program kind disjunct program fixpoint comput realiz model gener procedur paper assum acycl cover nlp program variabl futur work includ relax condit exploit applic extend abduct refer intern confer lectur note comput pp damasio logic program system nonmonoton autom apt acycl gener aravindan ration algorithm view delet intern symposium logic mit pp abduct intern confer logic mit pp gottlob enhanc symbol model check ai research report institut fur universitat negat gallair minker logic data plenum pp relationship abduct journal logic role abduct view journal intellig inform damasio abduct extend logic nerod truszczynski intern confer logic program nonmonoton lectur note artifici pp inou sakama comput extend abduct extens sld abduct integr mainten view updat deduct joint intern confer symposium logic mit pp deneck de abduct procedur abduct logic journal logic grant model theoret approach view updat deduct journal autom fung procedur abduct logic journal logic gelfond stabl model semant logic intern confer symposium logic mit pp gelfond classic negat logic program disjunct gener lobo view updat stratifi disjunct journal autom updat knowledg base gener inou abduct framework nonmonoton theori intern joint confer artifici morgan pp inou fixpoint abduct logic journal logic inou transact extend intern confer principl knowledg morgan pp kowalski abduct logic journal logic kaka updat intern confer larg morgan pp abduct versu closur causal artifici abduct theori artifici brewka principl knowledg csli public pp lavrac induct logic techniqu elli marek specif mean european confer logic lectur note artifici pp logic framework default artifici theori diagnosi artifici rossi contribut view updat intern confer logic mit pp semant quantit logic ieee symposium logic ieee comput societi pp van ross semant gener logic journal
HCI/1187 4 realtim person posit system wearabl comput aoki bernt schiel alex pentland mit media laboratori toshiba corpor japan abstract context awar import function wearabl comput comput person environ paper imag sequenc match techniqu recognit locat visit place singl word recognit speech dynam program algorithm calcul similar locat system run stand wearabl comput pc train sequenc dictionari locat creat automat locat recogn system realtim camera introduct obtain user locat import function wearabl comput applic automat contextawar user interfac user wear small camera small captur record event daili life comput summar record data eventu produc left home happen meet bob street arriv comput navig unknown place import remind shown worn displai user supermarket thad starner al discuss user supervisor import meet interrupt phone call realiz comput user locat global posit system track movement activ tag role stick transmitt door difficult gp insid build approach recogn locat camera barcod stuck comput find place easili read code object recognit text recognit comput detect place comput vision approach analyz pictur accur segment object charact starner al show place detect method introduc hmm transit room clarkson al show method segment label sequenc worn camera microphon realtim person posit system small wearabl camera shown figur standalon pc previou work demonstr dynam program algorithm recogn user locat approach trajectori test accuraci system video sequenc manual chosen segment imag handl line sgi workstat practic ad previou work run wearabl comput system run frame standalon pc toshiba wireless commun remot overcom delai refer limit bandwidth segment video sequenc introduc method suitabl trajectori automat recognit user doesnt system dictionari larger set train test data evalu dictionari extract real video sequenc minut test independ video sequenc random walk minut introduc accuraci scale similar figur small wearabl camera overview system section histogram calcul frame similar measur video segment explain section method automat select locat locat dictionari discuss result shown section system overview system consist notebook video captur card wearabl camera figur wearabl complet run realtim standalon pc access remot server user oper system train phase recognit phase locat dictionari calcul offlin train user walk chromat histogram calcul record frame program suitabl segment trajectori dictionari histogram sequenc top trajectori segment store dictionari process discuss section screen histogram file trajectori trajectori trajectori camera histogram dictionari pc frame figur data flow record mode screen camera histogram buffer dictionari result pc frame figur data flow analysi mode user walk recognit phase chromat histogram calcul match trajectori dictionari trajectori similar recent system user walk show imag detect locat ordinari notebook pc intel pentium mhz processor support instruct train test video sequenc record analysi evalu system layout compat substitut small comput toshiba camera shown figur processor speed notebook pc program written partial assembl languag provid faster access instruct support calcul histogram calcul fast hz realtim view nearest place id recognit figur screen shot person posit system histogram similar order implement vision system wearabl mind system robust bright calcul frame fast order enabl high rate sampl frame compact frame affect bright light time dai indoor point concern speed calcul heavi system handl frame imag sequenc user pass path train phase test phase figur dictionari trajectori locat made frame test sequenc sampl sampl frequenc high expect similar system succe match sequenc gap system fail frame featur store locat dictionari due limit space smaller size featur locat store larger size slower perform system figur sampl bad perform hue histogram calcul hue histogram frame featur pixel valu repres hue satur bright rgb unit convert linearli translat rgb unit calcul hue histogram frame featur calcul result featur vector frame figur chromat histogram figur show chromat histogram figur chromat histogram robust angl camera time dai sequenc repres sequenti incom video frame denot sequenc se chromat histogram frame frame histogram element repres byte occupi byte memori system tabl tangent calcul histogram bin pixel belong part system implement float point calcul calcul run pc video segment similar se similar segment calcul distanc matrix segment segment introduc ij segment diagon element ij user pass locat speed segment diagon element ij expect small user pass locat segment user slower ij form figur similar segment calcul necessarili diagon search path element element ij proce chosen sum element minimum segment segment figur differ speed path chosen call minim sum element minim path denot ij ij ij minim path ij chosen greater path sum element greater dynam program frequent speech recognit find minim path dynam program find correspond frame segment speed stabl system frame trajectori video segment locat dictionari dictionari hold histogram sequenc histogram locat denot sequenc histogram recent frame time denot note increment test test dict kl test dict calcul system receiv frame cost frame histogram similar search minim path trajectori dictionari locat suitabl trajectori dictionari video segment record user walk feet monoton segment record feet imposs differenti sequenc discrimin segment suitabl chosen trajectori dictionari measur distinct introduc calcul ij combin segment test data segment partial overlap distinct measur segment introduc ij segment train locat visit segment locat elimin calcul number segment elimin small respect segment difficult elimin priori associ locat train video sequenc system show distinct locat order list segment close segment frame top segment list elimin overlap segment system creat trajectori dictionari distinct locat environ experi train video sequenc test sequenc mit media lab build train sequenc minut test sequenc minut sequenc walk floor user walk floor sequenc dai train sequenc night test sequenc dai trajectori dictionari chosen floor figur show approxim topolog map floor trajectori chosen dictionari trajectori chosen top list section order trajectori visit train sequenc dictionari made pick trajectori top list figur floor plan chosen trajectori figur show path test walk solid line part test walk broken line part minut user ground level walk ground lower level stair back floor part consecut figur show detect result system number normal letter correct detect letter substitut error blank black box delet error number box insert error blank area gap trajectori dictionari trajectori column correctli detect anytim trajectori column correctli detect dictionari trajectori dictionari system fail detect dictionari doesnt trajectori fewer failur detect trajectori consid error part test walk detect expect ground level lower level figur test walk tabl show numer evalu system similar evalu starner al total number trajectori gap test sequenc includ gap trajectori part test number trajectori number trajectori count detect detect accuraci acc acc acc acc tabl system perform number trajectori number trajectori dictionari time trajectori dictionari substitut insert delet figur result acc neg insert detect relat paramet set minim tabl show system perform trajectori chosen dictionari figur locat detect door open train data close test system user pass point color imag stabl path similar reason salient object hallwai mismatch salient segment hold result locat recognit system run wearabl comput recognit realtim standalon system doesnt requir wireless commun experi show system recogn locat good accuraci previou work addit introduct topolog grammar solv problem insert work mean automat locat dictionari discrimin frame chang ad frame featur multipl subregion frame refer lam flynn intim comput support human memori intern symposium gener human interfac pp rhode starner remembr continu run autom inform retriev system intern confer practic applic intellig agent multi agent technolog weiser comput centuri scientif bisson virtual document environ intern symposium wearabl comput rekimoto nagao world comput augment interact real world environ acm rekimoto nagao agent augment softwar agent meet world intern confer multiag system pentland visual contextu awar wearabl comput intern symposium wearabl comput hopper activ badg person interact comput object ieee tran feb bit user cheap user model ibm system rw pentland augment realiti wearabl comput presenc schiel crowlei probabilist object recognit recept field histogram intern confer pattern recognit clarkson pentland cluster audio video intern confer speech signal process pentland recogn person locat video perceptu user interfac workshop dynam program algorithm connect word recognit read speech shot classif method select effect keyfram video acm multimedia dynam program algorithm spoken word recognit read speech
DB/1188 3 effici signatur system depart comput inform scienc norwegian scienc technolog norwai abstract signatur bit gener appli hash function attribut object signatur object store separ object filter candid object perfect match queri system logic object identifi index map logic oid physic locat object report show signatur store reduc averag object access cost system extend approach transact time tempor oodb approach maintain signatur virtual free develop cost model analyz perform analysi show substanti gain achiev tempor system introduct signatur bit gener appli hash function attribut object search object match decid signatur object object match size signatur gener smaller size object store separ object signatur file check signatur perfect match number object retriev reduc signatur file shown altern context text retriev signatur file gener queri immatur research area main drawback signatur signatur file mainten time content object signatur file updat high read write ratio high select queri time make benefici read signatur addit object show signatur incorpor tradit show tempor margin mainten cost object oodb uniqu identifi object identifi map logic oid physic oid index entri call object descriptor physic address object oid access low od leaf node access time mean lookup time object access explain lookup cost reduc note signatur function signatur implement signatur oodb avoid physic oid oid physic disk page directli potenti higher make task reclust schema manag difficult emploi od updat object updat object map inform valid object od updat approach reduc averag access cost includ signatur object mean od includ addit map inform base search case avoid retriev object check signatur od exclud object perfect match search od retriev find physic locat addit cost retriev compar signatur store signatur size size make updat time object show spite extra case benefici context store signatur transact time oodb object updat make previou version previou version object access system maintain timestamp object version timestamp commit time transact creat version object updat maintain signatur updat time object add timestamp physic address version insert index import observ introduc signatur margin updat low local disk seek time size od import mean maintain signatur low potenti bottleneck frequent costli turn organ rest report sect give overview relat work sect give introduct signatur sect describ index object manag sect describ signatur integr oid index sect develop cost sect studi perform signatur store paramet access pattern sect describ advantag signatur queri sect conclud report outlin issu research relat work studi signatur text access signatur ordinari queri signatur queri object studi comparison signatur file organ found perform evalu dynam signatur file method previou paper develop cost model oid index lookup cost studi memori util buffer page index entri studi extend tempor oodb oodb signatur plan integr approach report parallel signatur section describ improv queri signatur storag altern signatur bit gener appli hash function attribut object appli hash signatur bit set denot attribut object signatur object hash gener attribut object size signatur smaller object signatur typic signatur queri find object set attribut match number calcul queri signatur queri signatur compar signatur signatur file find match object match object satisfi condit bit posit set queri set object signatur drop form set candid object object match signatur match valu search candid object retriev match set search candid object match call drop signatur gener method gener signatur depend intend signatur discuss relev method object signatur gener hash object perfect match search includ attribut object attribut signatur object limit set queri method creat hash attribut perfect match search specif attribut search perfect match subset attribut search expect gener signatur subset attribut sequenc bit method filter techniqu complex result filter appli rest queri predic code method previou method queri set attribut gener signatur support queri perfect match set techniqu call code separ attribut signatur signatur creat object signatur creat perform attribut object attribut signatur result signatur flexibl support type attribut code object signatur creat member set signatur creat attribut signatur queri type answer case cost altern nest index variant leaf node entri kei oid object kei index nest signatur fast text access fast text access main applic signatur signatur avoid full text scan search word occur document case signatur document document divid logic piec text constant number distinct word word signatur creat word block signatur creat word signatur search document block signatur compar queri signatur signatur gener queri result set document block match queri signatur block fix number signatur document depend size number distinct word document signatur storag signatur store separ index object object relev set size file gener smaller size object signatur gener scan signatur costli scan object storag structur signatur sequenti signatur file signatur file dynam signatur file method simplest signatur file signatur store sequenti file separ pointer file provid map signatur object file typic file signatur search perfect signatur file read updat updat entri file approach bit signatur store separ signatur size signatur distribut stead file approach larg signatur search file bit field queri signatur reduc search time updat impli updat retriev cost shown smaller updat cost time higher uncommon base approach static data improv impli vertic horizont variant signatur compress multi level signatur exist support dynam signatur file method multiwai tree variant hash file variant drop probabl report show benefit signatur restrict analysi attribut techniqu drop probabl signatur gener attribut ln case text number distinct word block object index manag start descript oid index version manag outlin base exist design close make integr current oodb basi oid index tempor oid index tradit realiz hash file od oid kei version access current version effici approach index index current previou version effici access method suitabl search rang oid search perfect assum current version flexibl combin kei rang time rang impli extra high lookup cost current version search note ineffici typic tempor queri addit secondari index good candid support navig main featur oodb compar relat system assum od object store includ commit time time concaten oid index kei od oid cluster leaf sort commit time search current version oid retriev time interv oid effici object oid od append index tree case monoton oper effici object od version insert tree tempor object manag space alloc object updat object impli object previou version object physic locat version previou updat object creat delet assum access current version object access effici benefit object cluster current object previou version histor object updat previou version move histor version store current assum cluster maintain histor object move replac current written reduc updat cost updat time object updat data interest current version improv system made awar data defin version object updat costli updat object modifi import oodb effici support tempor data reduc perform applic util featur store signatur signatur store map inform timestamp case od perfect match queri signatur reduc number object candid match retriev optim signatur size depend data queri type manag small case text larg signatur size desir signatur size kind provid signatur size mainten object signatur impli comput requir desir maintain signatur decid class basi analyt model due space present overview cost model detail refer cost model focu disk access cost factor disk distinguish random sequenti access random time read write page denot tp sequenti time read write page ts calcul base page size kb system model page server tempor oper previou chapter reduc disk recent index object page page buffer size page gener low probabl find od map oid physic recent od separ od cach size od oodb total byte buffer talk memori size part main memori main memori program oper main memori size sum size page buffer od cach amount main memori buffer characterist reflect cost model includ buffer perform calcul hit rate od cach page buffer buffer model extens dan dia lru buffer model import featur bdd make power access distribut deriv bdd model includ equat calcul number distinct object total access access distribut denot equat distinct denot buffer hit probabl object page buf note index object page share page buffer hit probabl index object page access pattern affect storag retriev cost directli buffer hit probabl access pattern paramet model independ refer object logic partit number size access probabl partit denot partit cost log log separ cost independ cost analyz signatur cost model updat lookup cost object storag retriev lookup updat cost calcul publish cost model modif cost model signatur store object descriptor od size vari signatur size signatur od store number signatur size multipl averag lookup averag time retriev od denot lookup averag time updat updat object denot fraction oper tempor object tempor signatur updat object creat object storag retriev cost model object store disk page reduc object retriev object disk page make object page futur call cluster defin cluster factor fraction object page page object page page averag object size larger disk defin read object model read access ordinari object assum benefit perfect match benefit signatur assum perfect match queri fraction qm read pa fraction queri object actual drop assum cluster factor averag object retriev exclud cn page averag cost read page buf read object page signatur base assum benefit retriev small amount total number object page read object averag object retriev emploi lookup qm qm pa mean qm queri perfect read object page case actual drop updat object updat log transact commit log record written disk modifi page written back lazili background part buffer replac checkpoint page modifi time written back updat cost depend checkpoint interv checkpoint interv defin number object written checkpoint number written includ creat updat object ncr written object creation ncr written object updat exist object number distinct updat object checkpoint period distinct ncr obj averag number time object updat nu ncr checkpoint number page current partit affect np page mean checkpoint version insert np page cn page object page updat averag nu time write tempor page object histor partit includ object page object instal page instal current version write back reduc disk arm set fi fi fi ff ff ff tabl partit size partit access probabl partit set studi benefit sequenti write histor object object updat case write previou version histor updat signatur maintain object index updat creat page alloc page object creation page instal read averag object updat exclud updat obj updat np ts tempor page tp ncr page tp note object larger disk page index separ larg object tree advantag version modifi part written exodu larg object perform deriv cost function calcul averag object storag retriev system paramet access signatur section studi valu paramet affect access cost optim paramet valu depend mix updat studi denot probabl oper write averag access cost averag cost object read write access write lookup write updat goal studi minim access measur gain optim gain access opt access opt access access cost opt access cost signatur access model assum access object system skew object access partit set logic partit explain partit size access probabl difficult kind access pattern experienc predict base current access support tempor featur applic develop util wai access pattern report necessarili repres studi gain signatur access pattern access pattern partit size access probabl summar tabl partit extens hot spot paramet paramet mb obj mill kb tr ms sp kb write tp tr tr tempor ts tr od pa tabl default paramet cost signatur size signatur size fig cost versu signatur size access pattern oodb tempor oodb partit hot spot hot cold area partit set resembl access pattern close expect futur larg cold consist version set analysi hot spot area paramet stabl total object version od note section perform depend number exist version total number version result number section base calcul default summar tabl access pattern partit set default studi size gb size gb case gb case tempor oodb count extra storag store note size smaller insert index good space util insert case tempor space util optim signatur size signatur size tradeoff larger signatur reduc read size access cost figur illustr access pattern cost signatur size signatur size fig cost versu signatur size valu oodb tempor oodb gain memori size memori size fig gain signatur versu memori access pattern oodb tempor oodb optim higher drop probabl accept text retriev applic reason small signatur optim size object small make object retriev match costli document retriev subsequ search match case text retriev applic signatur size depend illustr fig optim signatur size larger mean attribut contribut queri attribut perform rest default gain signatur figur show gain access pattern signatur benefici access limit amount memori figur show gain valu gain effect averag object size chosen default averag object size object larg figur show smaller object signatur benefici figur show gain object size gain memori size memori size fig gain versu memori valu oodb tempor oodb gain memori size memori size fig gain versu memori averag object size oodb tempor oodb effect pa qm qm fraction read queri benefit signatur figur illustr gain valu qm small qm result neg gain case store maintain signatur reduc averag perform pa fraction queri object actual select queri pa suffici benefit signatur figur show signatur benefici larg gener queri process analyz report simpl queri perfect match low limit room improv real benefit queri signatur reduc amount data process subsequ stage result larger amount data process main memori speed queri process order magnitud context perform case set valu object set valu signatur set store queri set extens work separ signatur file store signatur gain memori size memori size fig gain versu memori valu oodb tempor oodb gain memori size memori size fig gain versu memori valu pa oodb tempor oodb report signatur store od access object access extra signatur retriev cost maintain signatur mean updat time object analysi case pai object retriev store signatur attract updat object updat extra cost signatur mainten low show substanti gain achiev store signatur analysi system access queri store object signatur benefici typic gain interest note optim signatur size small acknowledg author prof introduc signatur refer bertino evalu text access method annual hawaii intern confer system softwar dia simpl analysi lru buffer polici relationship buffer transient ninth intern confer data shekita object file manag exodu extens system vldb august kossmann perform evalu oid map techniqu vldb time index monoton tempor design implement publish faloutso access method text acm comput faloutso chan fast text access method optic larg magnet design perform comparison vldb ishikawa design evalu signatur file organ incorpor vertic horizont decomposit scheme intern confer expert system evalu signatur file set access facil oodb acm sigmod intern confer manag composit signatur effici access method object retriev intern symposium cooper system advanc applic estim drop object retriev signatur file intern confer foundat data organ patel effici signatur file method text retriev ieee transact knowledg data lomet salzberg access method data acm weikum perform histori data access method vldb tempor object storag intern workshop expert system analyt studi object identifi index intern confer expert system optim oid index cost tempor system intern confer foundat data faloutso signatur file larg parallel machin architectur intern confer extend zezula select signatur file specif applic annual european comput confer advanc comput reliabl system im perform evalu dynam signatur file method comput softwar applic
DB/1189 3 proxi cach web site abstract explor framework exploit queri semant html form identifi common class studi repres cach scheme tradit passiv queri activ queri proxi cach servic request evalu queri content cach result implement show proxi gener flexibl approach effici enabl activ cach scheme web site handl queri proxi yield perform advantag passiv queri extend power activ cach full semant cach gener effect introduct web site manag amount data system storag user access web click url html page view applic web site gener queri dbm execut applic web site result emb html return page user figur illustr configur heavi system bottleneck process goal paper permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb luo jeffrei naughton comput scienc depart west dayton street wi usa explor techniqu allevi bottleneck proxi cach se lic ta se figur web site improv perform share server workload kind proxi tradit proxi serv content internet group user web site proxi exist proxi campu proxi speed internet access local user proxi proxi serv set server gener internet user case web site proxi collabor web site set proxi contract content deliveri network servic function proxi simpl proxi url cach page return cach page access web site page extend proxi cach handl access relationship form html queri gener system web site click url gener queri request gener click url emb inform proxi work url refer static page store web server call scheme passiv cach page return hit extra process page gener thing click user fill form user input form incorpor queri eventu execut system common book sell web user keyword search book titl gener sql queri predic keyword provid user passiv cach scenario proxi cach associ cach page user url mean proxi cach servic request cach previou request form exact user input goal extend proxi cach servic request match previou servic request answer process result previou request term kind cach activ proxi activ function limit queri process role cach context pose number challeng found cach challeng high independ system proxi cach term close web site collabor proxi cach show web site give inform passiv cach web site text queri applic gener activ cach web site facil proxi submit modifi queri proxi semant activ exploit queri overlap activ proxi scheme wide requir custom modif exist proxi requir program effort behalf individu web site serv proxi cach modul java servlet unmodifi apach servlet engin program requir repres web site addit defin implement perform experi implement benchmark modif benchmark experi show queri activ cach gener substanti improv pure passiv extend full semant cach effect special craft workload valid synthet workload result experi proxi real onlin user trace proxi cach framework goal framework effici facilit activ cach mechan web site gener larg volum user queri web site queri arbitrari submit simpl html form kei observ queri enabl varieti activ cach scheme impract arbitrari sql queri inspir built framework base queri queri definit instanti paramet valu user request run time form queri templat search request page search figur html form start run figur html form shown simplifi search request page onlin bookstor benchmark user type text box click http request user input server side matter applic program implement server side cgi java activ server http request result sql queri backend dbm execut sql queri form figur notic user input string predic sql queri form figur abstract queri templat shown figur select top author order figur queri sql select top author order figur queri templat sql templat queri execut proxi analysi exploit semant queri sophist cach scheme passiv cach implement implement java servlet top apach servlet engin serv cach proxi cach servlet run process space pool multipl thread servlet engin handl simultan request chose servlet engin approach appli apach web applic server proxi cach store result queri answer subsequ queri question address queri result repres cach xml emerg data transfer format chose cach queri result xml format free data issu cach web site format translat long provid queri result xml requir storag scheme proxi cach work long translat form result format cach cach format browser format queri templat text file queri figur queri queri templat inform file specifi correspond form paramet queri templat paramet figur show queri templat inform file form figur inform file specifi queri templat form queri uri paramet request specifi paramet http request form correspond paramet queri templat queri templat map inform form declar separ proxi cach function implement data issu web site figur queri templat info file passiv queri proxi map incom http request file paramet descript queri templat check file cach disk file proxi forward request cach result file result back return result user proxi read cach file return content user activ proxi similar process check cach queri proxi process server interact complex discuss activ cach detail section issu differ deploi regular proxi deploi proxi activ cach proxi queri semant form applic web server perform arbitrari comput base user input enabl activ requir web site provid text sql queri form queri templat queri templat provid configur step configur step regular proxi administr specifi url proxi cach ad configur file configur administr specifi form proxi cach ad queri templat file inform file directori proxi consist issu cach regard consist interest area futur work larg orthogon paper web work surprisingli relax attitud consist applic serv simpli provid facil web site invalid data templat store proxi recent research web cach commun ad applic logic proxi remot site proxi run activ cach protocol small softwar modul ship web server proxi cach dynam content cach protocol support header cach polici cach modul ship activ cach protocol queri templat inform framework easili ship web site protocol support proxi dynam implement activ cach scheme manual class queri handl cach queri web site applic framework appli form arbitrari effici cach techniqu relat characterist queri step appli concentr simpl common class web call conjunct keyword queri class web queri express syntax characterist queri select top order figur class queri search predic order oper field select list simpl class queri repres larg number form includ catalog search form bibliographi search form keyword connect user web seldom examin entri excit search engin log found entri entri report entri altavista search engin log show queri oper focu conjunct keyword predic queri execut cach proxi handl queri templat figur proxi execut join treat queri form simpl select queri singl tabl view keyword predic queri differ queri search string search predic strength approach cach tupl gener complex process avoid complex process proxi remaind section discuss queri form omit field select target relat search field search predic field terminolog relat xml interchang field correspond tupl correspond set element includ list semant set semant definit fact repeat make paper definit list order set list list element order ignor absent element defin list set order correspondingli symbol denot oper set list extend standard definit queri list queri queri denot result subset order queri disjoint overlap disjoint explor conjunct keyword queri definit keyword conjunct keyword predic form field set distinct word predic true keyword necessarili field relat conjunct keyword predic simul string predic keyword predic correspond boolean queri inform retriev document definit sort oper form list set tupl field superset field oper return list tupl order definit oper form natur list tupl oper return list tupl definit conjunct keyword queri form qe queri keyword predic queri return set tupl definit conjunct keyword queri denot defin queri return list tupl definit conjunct keyword queri denot defin queri return list tupl properti queri definit section simpl fact properti queri cach fact σ ¢ fact £ ¢ fact answer restrict conjunct keyword queri restrict select intersect similar fact hold set semant replac list semant fact hold fact σ ¢ fact £ ¢ show similar properti proposit superset hold ¢ proposit impli superset vice versa ¢ stronger proposit hold proposit ¢ queri similar result hold famili conjunct keyword queri proposit hold ¢ result union union similar result hold proposit union ¢ disjoint find answer satisfi proposit disjoint hold ¢ activ cach design paper activ proxi cach cach execut conjunct keyword queri class queri queri obviou conjunct keyword queri class gener illustr strength limit approach properti studi previou limit result size impli queri prohibit passiv queri cach cach conjunct queri proxi cach conjunct keyword queri immedi form cach issu web site proxi facil proxi oper case cach conjunct queri appli predic proxi return result user cach union result conjunct keyword queri result queri intersect disjoint cach proposit union combin cach relationship queri individu cach queri determin queri examin keyword queri compar keyword queri cach queri examin content cach situat queri overlap queri cach proposit overlap cach queri overlap cach queri content cach examin content cach find queri issu queri web server form answer cach terminolog semant cach queri evalu cach probe differ queri dbm remaind queri remaind queri easi queri keyword km queri ci conjunct keyword queri qi remaind queri qr refer ci remaind predic larg cach qr sever problem dbm web site pick remaind predic reduc remaind result size effect minimum number remaind predic cach queri cover cach tupl hard problem shown reduct vertex cover simpl heurist pick fix number predic cover larg portion cach redund overlap queri result cach chose elimin duplic merg result queri cach choic comput overhead avoid fill cach duplic implement queri present cach previou simpli execut conjunct keyword queri content cach queri previou thing complex probe step select queri current search predic cach queri result full semant send remaind predic server web server respond result remaind cach merg result result probe send combin result user cach merg result remaind queri exist cach add origin queri list cach queri import special case occur decid handl relationship ignor queri overlap send remaind pass origin queri web merg result queri current cach content case import requir special collabor proxi cach web server queri web request absenc proxi oper class cach requir closer collabor web handl queri oper send queri web server support class queri oper proxi appli full result pass user figur cach consist row cach queri queri set cach result lexicon word search field cach result tupl queri match cach queri ad order number cach queri small cach tupl union result tupl cach queri lru cach replac list cach queri answer queri exact match cach cach queri exact match queri answer complet proxi queri exact match cach tupl examin lexicon index pick satisfi tupl overlap queri queri unix experi framework book titl search queri trace modifi workload investig properti activ cach reveal simpl trace setup program figur cach organ comput involv experi machin pentium iii cpu memori machin server disk machin disk machin ethernet machin redhat linux oper system program browser proxi servlet servlet engin apach servlet engin version support java servlet api server experi oracl edit text index server oracl servlet version server side process queri gener queri result xml tabl summar configur comput proxi server softwar servlet queri trace advanc java program unix network tabl softwar experi measur effect proxi cach set term cardin item oracl cardin author tabl item tabl ascii data file tabl total size default buffer pool size oracl workload figur queri figur field item tabl gener util dataset titl signatur word insert averag titl search string queri signatur word queri return averag queri trace ident search disjoint result worst case activ cach queri overlap ran ten thousand queri trace scale queri trace thousand distinct cach reach hit ratio end cach item cach replac trigger compar time directli server proxi cach proxi passiv queri cach proxi activ queri cach send remaind predic time measur time proxi case ident miss pq show case tabl scale direct hit pq miss hit miss tabl averag time tabl web server process time domin pq cach miss scale passiv queri cach achiev averag time case passiv queri cach add millisecond overhead compar case activ cach add millisecond overhead miss sophist queri cach manag scale overhead domin server time ad overlap queri queri trace gener queri disjoint small gener set term vocabulari trace explor activ cach perform queri cach queri intersect data cach trace dummi tabl composit trace trace experi trace thousand queri dummi word search string percentag trace shown tabl noun chosen independ distribut popular noun vocabulari dummi word trace distinct return answer percentag noun queri trace design yield similar exact match ratio ratio trace exact match ratio trace ratio queri time millisecond averag time direct pq figur averag time figur show averag time trace run directli server passiv queri cach proxi activ cach proxi remaind predic recal case requir close collabor web server proxi cach number noun queri fix vocabulari ratio exact match chang passiv queri cach limit perform number noun queri fix vocabulari ratio queri benefit activ cach larger extent examin detail time spent individu queri proxi compar case activ exact match overlap miss passiv queri simpli miss hit time queri depend current content result web server ran trace chose repres queri show time averag run tabl cach similar time exact match queri queri similar time exact match activ miss passiv queri cach queri dummi queri return activ cach miss passiv cach miss queri queri return tupl activ cach intersect time slower passiv cach miss passiv queri cach top tupl obtain return save cach activ cach case activ cach result tupl result tupl answer merg part answer elimin return top cach answer queri id statu inter cont miss match time pq statu miss miss miss hit time tabl number remaind tupl queri conduct experi trace found number remaind predic limit effect reduc number remaind tupl show queri tabl overlap titl predic tupl tabl time case ad overlap dataset dataset gener dataset item schema vocabulari titl field data set benefit remaind process titl field distinct combin id field uniqu titl uniqu gener tupl combin titl append tupl ran ten queri compar perform queri vari number remaind predic note select heurist remaind predic scenario remaind predic tabl show number remaind tupl queri figur show time averag run predic tupl tabl number remaind tupl queri time millisecond figur time breakdown queri legend left figur correspond portion bottom bar time spent probe cach send remaind queri server small time wait server merg probe result remaind result compar server time proxi time number remaind predic experi dataset magnitud larger special tupl insert observ pattern experi omit time breakdown due space paper omit experi investig effect cach scheme elimin duplic omit experi test cach onlin book sell web site interest reader find detail relat work paper explor activ framework web site explicitli base queri templat cach materi web receiv lot attent recent studi passiv cach html xml page gener data main focu activ cach research web cach close relat includ studi queri previou work custom proxi cach protocol distribut cach code queri proxi fly studi main issu focu includ form definit cach scheme perform queri web larg bodi work data queri answer queri view dealt relat queri cach heterogen sourc work build semant cach present close relat algorithm match queri context semant cach rang queri studi semant cach keyword queri search focu queri templat enabl activ cach web site present perform studi commerci interest cach web server oracl applic server includ oracl cach oracl web cach oracl web cach passiv cach oracl cach cach full cach select row cach queri result futur proxi cach tabl level cach approach requir dbm data replic proxi sql queri processor cach shift entir queri comput dbm proxi cach queri avoid requir simpler comput cach unlik full tabl cach advantag cach result space unlik full tabl cach sql processor answer arbitrari queri tabl detail comparison approach interest area futur work futur work framework web server studi repres cach scheme web queri full system implement evalu show passiv queri cach suffici activ cach gener trace real workload answer queri result perform answer queri worthwhil conjunct keyword queri cach scheme reli collabor server passiv queri cach queri semant inform handl queri facil full answer full semant cach server handl remaind queri acknowledg group valuabl guo data gener fund work provid nsf itr darpa contract refer yanni subrahmanian queri cach optim distribut mediat system sigmod confer apach servlet engin agraw enabl dynam content cach driven web site sigmod confer pei jin kevin beach activ cach dynam content web middlewar jim paul scalabl system consist cach dynam web data ieee infocom bori claudia schneider cach mechan heterogen web queri proc world wide web confer shaul michael divesh michael tan semant data cach replac vldb arthur juli basu cach scheme architectur vldb journal nick roussopoulo materi sigmod confer larson yang comput queri deriv relat lee weslei chu cach queri match web sourc alon alberto divesh srivastava answer queri view luo jeffrei naughton proxi cach web site jeffrei rajasekar pei li activ queri cach web server webdb cach search engin queri result intern web cach content deliveri oracl corpor oracl internet applic server document librari timo selli intellig cach index techniqu relat system inform system craig monika michael analysi larg altavista queri log src technic note octob ben tao zhu cach partial result dynam web content proc usenix symp internet technolog system transact process perform council tpc specif version june
IR/1190 5 evalu recommend algorithm georg karypi depart comput scienc armi research center mn technic report updat septemb abstract growth emerg led develop recommend person inform filter technolog identifi set item interest user collabor filter success technolog build recommend system extens commerci recommend system comput complex method grow linearli number custom typic commerci applic grow million address scalabl concern recommend techniqu develop analyz matrix identifi relat relat comput list recommend paper present class recommend algorithm determin similar item identifi set item recommend kei step class algorithm method comput similar method combin similar order comput similar basket item candid recommend item evalu dataset show algorithm time faster tradit base recommend system provid recommend qualiti introduct growth emerg led develop recommend system recommend system person inform filter predict work support nsf armi research offic contract doe armi high perform comput research center contract number user item identifi set item interest user recommend recent recommend system number applic recommend product custom bui tv music user find identifi suggest altern wai search inform approach recommend system develop util histor inform collabor filter success wide techniqu build recommend system recommend system histor inform identifi neighborhood peopl past exhibit similar behavior access type similar set similar set analyz neighborhood identifi piec inform user refer class approach recommend algorithm recommend system major limit relat sparsiti relat scalabl recommend amount histor inform user item limit recommend system accur comput neighborhood identifi item poor recommend address varieti techniqu reduct softwar agent automat gener rate develop densiti dataset nearest neighbor algorithm requir comput grow linearli number user item million user exist recommend system suffer scalabl problem reduc complex comput cluster user limit search user belong nearest cluster cluster centroid deriv recommend significantli speed recommend tend qualiti recommend altern approach build recommend model base item histor inform analyz identifi relat item item set lead item set quickli recommend set shown produc recommend result case compar cf recommend system refer class approach recommend algorithm paper present class recommend algorithm algorithm determin similar item identifi set item recommend kei step class algorithm method comput similar method combin similar order comput similar basket item candid recommend item present method comput similar method model item vector user cosin measur measur similar method comput similar techniqu inspir condit probabl extend differenti user vari amount histor inform differenti frequent infrequ item present method combin similar account incorrectli bia recommend evalu algorithm dataset applic experi show base algorithm time faster tradit base recommend system algorithm achiev substanti higher qualiti base algorithm averag recommend rest paper organ section present overview tradit recommend algorithm section describ phase algorithm recommend system section evalu paramet algorithm compar algorithm section conclud remark outlin futur research overview recommend algorithm collabor filter success technolog build recommend system extens commerci recommend system scheme reli fact person belong larger group individu item frequent member group form basi recommend item matrix histor inform custom item custom set item custom comput recommend refer custom activ custom order simplifi present assum activ custom belong custom store matrix cf recommend system comput recommend item custom identifi similar custom model custom item vector space wide inform retriev model custom activ custom treat vector item similar activ exist custom measur comput cosin vector set similar custom row aggreg identifi set item group frequenc cf techniqu recommend frequent item activ user note frequenc item set comput count actual occurr frequenc normal row length normal emphasi item custom frequent buyer lead result popular cf recommend system number limit relat scalabl comput complex method grow linearli number custom typic commerci applic grow million matrix similar matrix frequent item lead similar recommend base current basket util advantag similar throughput recommend engin number server run recommend latenc recommend critic perform recommend algorithm address scalabl concern recommend recommend techniqu develop approach analyz matrix identifi relat relat comput list recommend kei motiv scheme custom item similar relat item scheme identifi neighborhood similar custom recommend lead faster recommend engin number scheme comput relat item base probabilist approach tradit correl paper studi class recommend algorithm similar comput relat item model build item similar item similar record custom set inform comput recommend item identifi set candid recommend item union similar item item remov union item item comput similar set sum similar item similar item item sort order respect item select recommend set item similar critic step recommend algorithm method determin similar item rest section describ class similar deriv model probabilist method similar comput similar item treat item vector space custom cosin measur vector measur similar similar item defin cosin vector column matrix cosin vector si denot vector oper equat similar item high custom item item import featur similar account frequenc item denomin equat frequent item tend similar frequent item infrequ vice versa import elimin obviou recommend frequent item tend recommend frequent item current basket item case recommend row correspond origin binari scale row unit length differenti custom bui small larg number item depend item similar pair custom treat import custom fewer item motiv scheme inform custom bought item reliabl inform custom bui group repres consum product area condit similar altern comput similar pair item measur base condit probabl item item condit probabl number custom item divid total number custom number custom item set note gener measur similar lead asymmetr relat limit condit probabl measur item tend high condit probabl item frequent result fact occur frequent tend occur problem recogn earlier research inform retriev recommend system correct problem divid quantiti depend occurr frequenc item method achiev inspir frequenc scale perform inform retriev multipli divid experi shown scale greatli affect perform recommend optim scale problem depend formula comput similar si paramet note equat ident similar scale formul divid limit equat mechan discrimin custom item custom item discuss section custom bui fewer item reliabl indic determin similar item reason extend similar measur equat normal row matrix unit length defin similar item si differ equat equat frequenc sum entri column matrix row normal unit custom item tend contribut give emphasi custom bought fewer item similar normal recal section basket item recommend algorithm determin item recommend comput similar item item select similar item recommend set similar set item determin ad similar item similar item potenti drawback approach raw similar item similar item significantli item neighborhood densiti true item moder overlap infrequ item lead high similar valu item potenti strong influenc select lead wrong recommend actual similar comput method section item normal similar experi present section lead dramat improv recommend qualiti comput complex comput complex recommend algorithm depend amount time requir build model item identifi similar amount requir comput recommend model model build phase requir comput similar item item select similar item upper bound complex step comput potenti requir oper actual complex significantli result similar matrix extrem similar matrix gener reason sparsiti level custom small number item tend cluster data structur store comput similar pair item custom substanti reduc comput complex amount requir comput recommend basket access similar item item identifi similar item result section evalu perform recommend algorithm compar perform recommend algorithm experi perform pentium ii base workstat run oper system data set evalu perform recommend algorithm dataset characterist shown tabl matrix column label show number number total number row column ecommerc catalog skill tabl characterist dataset evalu recommend algorithm ecommerc dataset correspond transact site catalog dataset correspond catalog transact major catalog retail dataset correspond credit card transact major depart store skill dataset correspond skill present resum individu obtain major onlin job portal dataset correspond movi rate obtain research project note actual rate dataset design metric goal experi evalu qualiti perform recommend provid recommend algorithm order evalu qualiti recommend split dataset train test randomli select entri row part test remain entri train obtain recommend item present train set basket case recommend comput train set build item similar model case nearest neighbor recommend comput train set qualiti measur number number item test set present recommend item return total number comput recal recommend system recal number hit recal recommend algorithm recommend hidden recal recommend algorithm recommend hidden item order ensur result statist experi perform ten dataset row entri time random split train test result report rest section averag ten trial experi number item top recommend recommend algorithm effect similar normal experi design evalu effect similar normal discuss section figur show recommend accuraci achiev recommend algorithm cosin similar function condit probabl differ pair algorithm normal similar label normal label algorithm row matrix normal unit set ecommerc catalog skill recal figur effect similar normal recommend qualiti achiev recommend algorithm result figur algorithm similar normal achiev high recommend accuraci compar counterpart actual improv dataset algorithm depend rel improv tend higher condit probabl base scheme scheme perform scheme improv averag improv perform condit scheme improv averag improv due clear perform rest experi similar normal effect row normal experi design evalu effect custom item weight item similar calcul figur show recal achiev recommend algorithm cosin similar function condit probabl differ pair algorithm normal row label normal label experi set condit ecommerc catalog skill recal figur effect row normal recommend qualiti achiev recommend algorithm result figur version dataset condit algorithm averag improv dataset cosin condit similar version algorithm consist improv achiev major rest experi row normal model size sensit recal section recommend comput model util similar item item evalu sensit algorithm perform experi valu recommend accuraci experi shown figur condit algorithm condit experi perform recommend accuraci algorithm tend improv except dataset recommend accuraci slightli ignor averag recommend accuraci algorithm increment improv vari case condit algorithm averag increment improv result small valu recommend algorithm provid accur lead improv import small valu lead fast recommend rate low comput materi affect qualiti recommend note diminish increment improv achiev direct consequ fact recommend item suffici ensur condit similar similar ecommerc catalog skill ecommerc catalog skill recal figur recal function number similar item comput recommend recommend algorithm list suffici common chang order item item frequenc scale sensit paramet condit recommend algorithm control extend similar frequent item studi sensit recommend algorithm paramet perform sequenc experi vari increment figur show recal achiev dataset valu rel recal achiev algorithm greater condit scheme outperform perform note result obtain valu rel recal ecommerc catalog skill figur recommend qualiti function scale achiev paramet recommend algorithm rel achiev algorithm number interest observ made result shown figur impact recommend valu lead substanti recal recommend accuraci fairli smooth lead highest recal depend dataset highest perform obtain valu dataset exist set valu lead higher qualiti recommend comput algorithm condit scheme achiev consist good perform result suggest optim estim dataset hide portion train set estim lead highest recommend accuraci result figur show condit scheme compar result dataset wide rang valu condit algorithm lead higher recal scheme condit scheme equal compar result obtain optim valu condit algorithm scheme improv direct result higher tunabl provid paramet comparison recommend algorithm compar perform recommend algorithm achiev algorithm perform experi comput recommend recommend algorithm result shown figur recommend obtain algorithm section size unit length normal row approach determin frequenc includ neighbor ident set item activ item neighbor contribut figur includ set result obtain result label correspond result result label correspond condit algorithm set result label correspond condit algorithm dataset achiev highest perform experi discuss section figur includ recommend qualiti achiev naiv label recommend frequent present activ user set item result figur algorithm outperform algorithm outperform scheme dataset interest note algorithm perform substanti dataset margin remain averag improv achiev dataset algorithm optim valu perform achiev averag improv note algorithm produc recommend qualiti substanti recommend produc naiv algorithm advantag algorithm smaller comput ecommerc catalog skill recal frequent user cosin figur qualiti recommend obtain recommend algorithm ment recommend algorithm tabl show amount time requir algorithm comput recommend dataset column label show amount time requir build recommend model comput similar column label show amount time requir comput recommend column label show rate recommend comput term note implement recommend algorithm advantag matrix order identifi nearest user quickli time tabl ecommerc catalog skill tabl comput requir comput recommend algorithm number interest observ made tabl recommend rate achiev algorithm time higher achiev algorithm add data set recommend rate algorithm compar achiev algorithm translat recommend versu algorithm discuss section amount time requir build model algorithm small account model build algorithm time faster algorithm recommend algorithm improv recommend produc algorithm term recommend time faster direct futur research paper present evalu recommend algorithm similar comput recommend result show condit item similar scheme lead recommend averag provid accur recommend provid tradit cf techniqu algorithm substanti recommend independ size matrix recommend algorithm present paper improv combin element approach approach dynam comput neighborhood similar user suit provid person inform approach directli comput similar item comput accur recommend potenti limit approach larg user global comput similar provid suffici person combin context approach identifi larg neighborhood similar user subset deriv recommend model combin world perform recommend refer marko balabanov yoav shoham collabor recommend commun march haym william cohen recommend social inform recommend workshop recommend page aaai doug adam berger agglom cluster search engin queri log acm sigkdd intern page billsu pazzani learn collabor inform filter page chan learn approach build web user profil acm sigkdd intern riedl combin collabor filter person agent recommend page aaai furna recommend evalu choic virtual commun david martin fast recommend method base condit independ probabl acm sigkdd intern page riedl appli collabor filter usenet commun tao jim discoveri aggreg usag profil web person resnick varian recommend system commun riedl open architectur collabor filter netnew john david carl kadi empir analysi predict algorithm collabor filter confer artifici page salton automat text retriev inform comput riedl analysi recommend algorithm acm riedl applic reduct recommend case studi acm riedl recommend system acm shardanand patti mae social inform algorithm autom acm confer human factor comput page loren brian david josh system share recommend commun ungar dean foster cluster method collabor filter workshop recommend system nation confer artifici yu approach collabor filter acm sigkdd intern confer knowledg discoveri data
AI/1191 2 experi hybrid model learn sequenti make ron sun todd peterson depart comput scienc alabama al februari abstract deal sequenti present learn model hybrid connectionist model consist distribut base approach sun model learn util procedur declar tap synergi type process unifi symbol method perform learn experi situat report shed light work model introduct paper present hybrid model unifi reinforc learn integr architectur address deal concurr situat agent learn continu experi data set concept model learn procedur skill declar knowledg tradit reinforc learn algorithm discuss learn highlevel knowledg acquir agent experi interact world mediat skill differ learn knowledg acquir extern highlevel knowledg essenti motiv model cognit model sun paper focu comput experi sequenti task involv select perform sequenc action accomplish object basi perceptu inform involv learn navig mine figur abstract obstacl agent target figur navig specif sequenti task agent set finit set action perform time step select base current state world world present sensori state vector sequenc state vector point agent receiv payoff reinforc action perform prior current state agent perform credit assign attribut action point time tempor credit assign accord aspect state structur credit assign gener teacher input agent start priori knowledg kind agent time make learn fraction fall allen newel cognit process minut rosenbloom al agent sever limit memor analyz previou episod detail form episod memori exist perceptu abil agent limit human local inform perceiv learn task process agent develop rule tent wait end episod make start learn point al human learn concurr true type task goal explicit priori agent impli receiv pursu agent maxim payoff characterist world stationari viewpoint learn agent world nonstationari world chang knowledg learn agent world se evolv agent learn cope region world exhibit characterist requir concept time kubat preselect set posit neg instanc close world provid fix view world knowledg structur agent view experienc wai knowledg agent experi world nonstationari learn base lack clear steadi criterion learn payoff receiv agent decid make agent assign basi constantli chang learn criterion move learn process nonstationari acquir skill exist method chief tempor differ method type reinforc learn learn exploit differ evalu tion success step handl sequenc increment manner approach appli learn navig robot control lin mahadevan connel learn declar knowledg approach extend dynam program partial observ markov process model requir domain model begin term learn declar knowledg rule characterist task render exist rule learn algorithm requir exemplar set learn michalski quinlan increment consist instanc fisher utgoff complex manipul learn structur inconsist discov typic complex limit time reactiv agent hirsh analyz inconsist consid learn algorithm involv time lead radic learn knowledg requir extra dedic mechan kubat rule learn algorithm handl learn sequenc necessarili involv tempor credit assign hybrid model agent develop set skill gear situat highli effici acquir suffici gener declar knowledg readili appli varieti situat commun human possess abil achiev balanc exist system fall short miss dualiti coexist procedur declar knowledg great deal work demonstr differ procedur knowledg declar anderson keil damasio al sun believ balanc essenti develop complex cognit agent base line argument ampl psycholog data support distinct procedur declar knowledg anderson initi distinct base human data problem fitt posner keil sun subsequ made similar point base psycholog data philosoph argument make distinct achiev balanc distinct analyt intuit smolenski distinct conceptu distinct consciou jame schneider aim captur dichotomi denot dichotomi serv justif main declar knowledg procedur distinguish differ access knowledg easili access linguist procedur skill anderson sun declar knowledg advantag make learn agent fact procedur skill effici easier learn advantag ffl guid explor reduc time develop skill situat transfer learn skill shown psycholog al ffl declar knowledg speed learn properli gener knowledg extract skill learn facilit learn process al ffl declar knowledg commun learn knowledg skill agent hybrid model framework repres type knowledg similar model sun specif design sequenti make consist bottom level procedur knowledg top level declar knowledg form proposit rule algorithm describ oper observ current state comput bottom level action find action top base input rule place compar valu action perform action observ state reinforc updat bottom level accord updat top level back step bottom level reinforc learn evalu action desir action state consist sensori acquir algorithm tempor differ reinforc learn estim maximum discount cumul reinforc agent receiv current state updat base minim fl discount max state result action updat base tempor differ evalu current state action chosen success updat agent learn account futur step longer longer sequenc notabl explicit plan implement implement chose layer form backpropag network comput fourth layer perform stochast make output layer output layer backpropag action individu node fourth layer determin probabilist action perform base boltzmann distribut ff control random process lookup tabl implement question continu input space result huge state space navig task kind function approxim lin mahadevan connel tesauro result converg learn top level rule encod declar knowledg captur simpl proposit rule form directli symbol rule facilit correspond bottom level encourag uniform chose connectionist model connect node repres condit rule node repres towel shavlik directli translat structur rule set network complex rule form includ predic rule variabl sun rule learn rule learn algorithm differ characterist concurr lack teacher input priori requisit basic idea perform rule learn subsequ state action state enter action reinforc receiv action action decid bottom level success measur present agent extract rule correspond add rule rule network subsequ interact agent verifi extract rule outcom appli outcom success measur rule made specif current outcom agent gener rule make rule condit lefthand side conjunct individu condit refer rang dimens input state righthand side action recommend refin version algorithm flesh rule learn detail step observ current state calcul action current find set rule match current state match rule maximum specif combin outcom previou base valu action select action perform percentag combin stochast combin perform action enter state result action possibl receiv reinforc calcul check current criterion rule extract updat statist rule input state space respect action result success current criterion defin rule match state perform extract state action add extract rule rule network result unsuccess current criterion defin match rule shrink delet remov match rule rule network add version rule rule network result success current gener match rule creat rule add expand rule rule network replac origin rule perform merg combin exist rule version rule learn determinist version statist version criteria measur step success rule discuss version criteria version detail relev oper determinist oper base outcom current irrespect rule shrink promptli statist oper base cumul statist inform outcom prior rule learn slower reliabl determinist rule learn determinist version oper algorithm ffl step criterion base inform current step max check rule wire rule network ffl rule successfulli appli max rang dimens condit expand rule cover expand rule remov children list expand rule ffl rule lead unsuccess result max reduc rang dimens condit remov select randomli match input restor rule children list cover shrunk rule subject ffl remov rule rule network counter origin set rule extract encount max rule origin restor rule children list subject ffl condit rule close rule rule cover complet put children list children list rule current rule specif cover rule special case rule cover produc rule cover statist rule learn rule learn base statist collect criterion shrink base statist test statist calcul step updat set statist match rule primit rang state regard action pm nm pn nn determin max statist updat stat stat stat stand statist end discount stat stat result nonstationari base construct measur rule suffici measur laplac statist test match rule chang ratio minor rewrit pm nm rule improv ratio rule gener consid good rule descript statist rule learn oper base ffl determinist version ffl find rule highest respect action rule add condit rule reset rule statist rule cover expand rule children list ffl find input condit rule lowest respect action remov reset rule statist restor rule children list cover shrunk rule subject shrink condit make imposs rule delet rule ffl shrink ffl determinist version accumul statist acquisit rule model combin outcom level step make final action incorpor outcom level method combin outcom level percentag percent rule indic proper action current outcom rule outcom bottom level outcom top randomli select action suggest match rule outcom bottom stochast process select action stochast combin valu action level weight top level action activ rule bottom level activ final outcom stochast make boltzmann distribut base weight sum perform select action action rel weight percentag level automat set base rel perform level contrast characterist level top level rigor verifi random learn fashion bottom level rigor random learn gradual cumul fashion complement note gener rule complement gener bottom bottom level gener rule gener top level term captur kind regular possess level learn combin stochast result improv perform averag breiman tempor differ determin rule learn encourag explor step worth lead improv state higher larg tempor differ lead learn explor action action larg tempor agent ignor action proven effect larg achiev combin outcom rule network high bottom level encourag agent action rule gener process encourag explor step similar wai step learn action lead larg tempor differ tend action larg tempor differ mean state averag compar state averag outcom action neighbor due network rule learn part model learn perform tempor credit assign order perform tempor credit mechan compar power rule learn base bottom turn rule extract bottom level improv perform discuss parsimoni synergi experi navig test simul navig task shown figur agent navig underwat vessel reach target locat agent receiv inform number instrument shown figur sonar gaug show close mine equal area rang left agent fuel gaug show time left fuel run bear gaug show direct target present direct agent rang gaug show target current locat base agent decid turn fast move allot time reach target hit mine run fuel failur random mine layout gener episod time allot agent episod step figur navig input displai upper left corner fuel vertic upper corner rang round middl bear sonar gaug bottom input state intern paramet set optim hidden unit backpropag momentum paramet network weight randomli initi discount rate random paramet stochast make set threshold rule extract set rel weight rel percentag level determin base success rate made top level success rate bottom level weight percentag combin method top level bottom level learn speed discuss refer determinist version column figur show differ bottom level pure term learn measur number success episod total episod train stoc refer version stochast combin refer version percentag combin refer bottom level episod mine mine mine mine mine mine figur learn curv learn sole learn method higher mine densiti difficult compar bottom level perform case case superior bottom level statist figur show learn curv data point percentag success episod block transfer block figur show transfer transfer measur percentag success episod set train model train model appli number total data averag data gener pattern higher mine densiti lower success rate matter train set mine transfer perform model train mine densiti compar test model train perform indistinguish outperform bottom level higher mine pronounc differ differ statist case compar transfer perform top bottom notic system perform bottom significantli model train case synergi level system perform rule improv transfer perform case perform top answer compar transfer perform bottom level train transfer perform bottom level train top level learn perform gener train perform block figur train perform block figur show train perform train block figur show train perform train block figur show train perform train train perform defin percentag success episod set train train model train model appli total data averag compar train perform top bottom notic system perform bottom level top level suggest synergi case bottom level mine densiti model train bottom top bottom top bottom top stoc sd sd sd figur learn transfer stoc refer version stochast combin refer version percentag combin refer bottom level sole learn method train total number success episod train block perform data mine densiti train model top bottom mine densiti model train bottom top bottom top bottom top stoc sd sd sd figur learn transfer stoc refer version stochast combin refer version percentag combin refer bottom level sole learn method train total number success episod train block perform data mine densiti train model top bottom mine densiti model train bottom top bottom top bottom top stoc sd sd sd figur learn transfer stoc refer version stochast combin refer version percentag combin refer bottom level sole learn method train total number success episod train block perform data mine densiti train model top bottom train part gener perform bottom level train suggest advantag statist differ perform version individu paramet slightli differ differ favor version paramet set differ show rule learn term term result maze extens experi maze domain peterson basic hold agent sensori input front indic figur initi maze start posit mark agent face upward upper wall goal mark goal maze locat marker agent knowledg locat inform goal locat agent move turn turn episod start agent fix start locat end agent reach goal time reward agent reach goal punish hit wall small state space lookup tabl implement specif design maze run sequenti task gener involv huge state space navig note task simpl exist algorithm successfulli appli point show handl varieti task rang complex simpl complex easili handl exist algorithm learn speed small maze shown figur primari set compar bottom level differ learn speed shown figur fix ratio combin outcom level refer version percentag combin rule move rule figur comparison learn speed move total number move train rule averag number rule end train appli time refer version stochast combin rule weight refer bottom level sole learn method symbol gen oper shrink omit clear figur rule frequent learn faster bottom level larg margin figur show comparison learn curv version bottom level tabl number rule learn end episod stabl small standard train perform averag number step reach target episod episod train shown test show differ confid episod figur comparison learn curv figur move column outperform bottom level larg margin report averag number step episod top level bottom level train part synergi top level bottom compar valu horizont model perform top level bottom level case shown compar version bottom level examin column rule learn improv perform improv bottom level se includ part rule learn bottom turn improv test show confid move figur train perform move denot averag number step episod model denot number bottom level denot number top level transfer appli train model train larger maze shown figur assess transfer concern compar transfer bottom level figur move transfer bottom level term averag number step reach goal episod compar line learn rule perform transfer bottom level part model superior comparison demonstr rule learn facilit transfer complic environ transfer perform suboptim due problem partial observ problem discuss sun al transfer occur similar maze preval left al number figur differ figur maze move figur transfer maze move denot averag number step episod model denot number level denot number rule level figur maze appli train model larger maze figur point made top level transfer bottom level part model outperform bottom level analysi object appar advantag model improv exhibit experi pure due high random network bottom level counter temperatur set result speed bottom level vari ff invari outperform bottom level high mine densiti possibl action top supposedli bottom sourc power true reduc action action maximum activ valu sourc power model attribut absenc hidden unit top level test remov hidden unit bottom level improv perform result hidden unit remov bottom model bottom level great difficulti learn task tesauro simpli remov hidden unit bottom level answer relat test make activ function node bottom level discret steep sigmoid function ad threshold term top improv perform result ad hidden unit top level made node discret turn top level backpropag perform model import discret top level result complementari level test rule learn sourc power compar frequenc rule learn readi paramet readi determin time rule criterion list satisfi rule learn vari readi extract result perform differ extend readi higher perform model deterior significantli rule learn partial explan model advantag note rule learn independ bottom level criteria rule learn base tempor credit assign proper discret rule approxim guid action gener backpropag huge state space test rule learn criterion sourc power amount direct reward receiv agent step maximum state max criterion indic action state directli fail account sequenc action criterion concern action close maximum indic optim action result show adopt criteria lead significantli perform power model attribut complementari discret complementari learn rule learn gradual proper rule learn criteria relat work hybrid model reactiv rule popular model includ hendler gelfand al miikkulainen dyer sun sun overview object approach research frustrat lack consist conceptu framework hybrid consist principl cognit architectur base theori dichotomi conceptu experi report perform advantag combin declar learn procedur learn adopt multipl learn method hybrid model dub sink insist present model mere unifi learn method integr synergi explor view extens rule learn distinct exist algorithm design hybrid connectionist model implement type knowledg kind connectionist network barnden sun implement knowledg miikkulainen dyer hinton touretzki implement knowledg distribut network sun gelfand al attempt develop principl dichotomi conceptu architectur model incorpor tend simpli side dichotomi attempt explor synergi exist hybrid model perform sun barnden sophist perform learn batch miikkulainen dyer learn task schema difficult perform learn al cognit plausibl ecolog realist regard al capabl integr learn develop connectionist symbol side unlik exist model exist learn model explor learn advic extern declar knowledg turn procedur knowledg gelfand al maclin shavlik anderson explor demonstr knowledg emerg interact world mediat procedur knowledg compar connectionist rule extract algorithm fu algorithm extract conjunct rule perceptron network find learner search combin posit condit lead found combin posit learner search neg condit ad case learner extract separ set integr substitut towel shavlik rule altern true believ rule express close resembl comput connectionist order avoid combinatori discern structur procedur extract group similarli weight link elimin form rule remain group rule extract algorithm meant appli end train network rule modif rule train network agent extract modifi rule connectionist reinforc learn rule learn work util synergi algorithm improv learn speed dynam extract modifi rule agent adapt chang environ addit remov rule time differ examin detail neural network rule extract focu behavior neural network acquir rule basi conclud remark work tackl learn sequenti task integr architectur hybrid model develop procedur declar knowledg autonom explor direct learn perform transfer effect model neglect dichotomi experi maze task navig demonstr aspect potenti advantag suggest combin type knowledg yield synergist result work support part offic naval research grant susan helen support simul navig task provid nrl diana jim alan anonym review suggest refer architectur harvard ma rule mind lawrenc erlbaum associ nj free encod connectionist data confer cognit scienc lawrenc erlbaum nj bag predictor machin damasio neural region knowledg access cold spring harbor symp quantit press mind free ny knowledg acquisit increment conceptu cluster machin learn fitt human perform ca lm rule learn search adapt integr plan react heterogen architectur morgan san ca integr system neural network robot skill morgan san ca marker pass morgan san ca gener version space machin principl psycholog york cognit develop mit press ma reactiv agent base reinforc teach machin learn maclin incorpor advic agent learn reinforc morgan san ca mae learn coordin nation confer artifici intellig morgan san ca mahadevan connel automat program robot reinforc learn theori methodolog induct learn artifici intellig miikkulainen natur languag process modular pdp network distribut lexicon cognit scienc gener search artifici model classif learn psycholog review induct learn tree machin learn preliminari analysi soar architectur basi gener intellig artifici intellig simpl associ systemat tech report pa proper treatment behavior brain variabl bind connectionist connect integr rule robust reason john wilei ny robust integr reason artifici intellig hybrid approach model neural special issu press sun hybrid agent architectur reactiv sequenti make sun integr lawrenc erlbaum associ nj sun hybrid model learn sequenti navig proc ieee intern symposium comput intellig robot autom ca ieee press skill learn reactiv sequenti task cognit scienc societi lawrenc erlbaum nj skill learn hybrid model proc intern confer cognit korea august sun comput architectur integr neural symbol process kluwer academ publish ma integr architectur react base approxim dynam program seventh intern confer machin learn morgan kaufmann san ca practic issu tempor differ learn machin learn touretzki symbol morgan kaufman towel extract refin rule neural machin learn utgoff increment induct tree machin learn learn delai reward phd cambridg uk widmer learn presenc concept drift hidden context machin learn develop procedur knowledg journal cognit
ML/1192 6 genet evolutionari algorithm real world david goldberg depart gener engin illig report march depart gener engin illinoi transport build south mathew avenu il genet evolutionari algorithm real world david goldberg depart gener engin illinoi il introduct made regular trip japan give talk genet algorithm procedur base mechan natur select genet back genet evolutionari algorithm restrict small devot specialist research advanc state art applic broad front tradit optim engin oper research area drug data composit grab attent solv problem broad spectrum human endeavor scienc technolog fashion japan method perman part toolkit fade comput du import pose tough question present futur state genet evolutionari comput short essai answer popular futur hold techniqu argu current popular genet form genet evolutionari comput stai plai increasingli import role peopl innov walk life strong posit neg experi genet research suggest techniqu widespread tip gener lab relief problem scale user suffer toi problem problem issu arena primari determin offer portion essai excerpt goldberg start offer introduct genet evolutionari comput argu reason find appeal connect directli human innov distinguish mode reason find methodolog appeal continu answer question appeal user motiv real user real problem genet evolutionari close examin understand peopl continu indefinit futur minut written length section quickli review fundament mechan discuss ga process process seek find solut problem appli genet algorithm thing encod problem artifici chromosom chromosom artifici chromosom string paramet complex comput kei thing mind genet machineri manipul finit solut thing solv problem mean procedur discrimin good solut bad solut simpl human intuit solut elabor comput simul model determin good idea determin solut rel fit genet algorithm guid evolut futur gener encod problem chromosom manner mean discrimin good solut bad prepar evolv solut problem creat initi popul encod solut popul creat randomli prior knowledg possibl good kei idea ga search singl point popul select genet oper process popul iter creat sequenc popul good solut problem time varieti type oper mutat simpli select alloc greater surviv mechan solut accomplish varieti wai weight wheel local tournament rank scheme main idea prefer solut solut repeatedli origin initi expect fill popul gener simpli select mean creat possibl individu genet mechan recombin mutat plai recombin genet oper combin bit piec parent solut possibl offspr wai accomplish achiev compet perform depend recombin mechan design primari idea mind offspr recombin ident parent combin parent trait manner recombin interest popul individu process repeat recombin undergo amount random shuffl extant trait recombin creat individu recombin trait mutat act simpli modifi singl individu variat main idea offspr ident parent individu made individu trait trait oper mutat repres neighborhood solut repeatedli popul expect result popul indistinguish creat random fundament intuit previou section mechan idea oper promot search individu oper act intellectu mysteri explain individu uninterest mechan act concert start develop call fundament intuit genet algorithm innov intuit explain appar mysteri process select mutat select recombin facet human call improv type innov start combin select mutat continu pair select mutat continu improv select mutat form hillclimb mutat creat variant neighborhood current solut select accept high climb solut human literatur total qualiti manag sort thing call continu improv call introduc innov larg base similar british author politician invent fine deviat enlarg fine model nobl insur hope origin qualit descript piec algorithm hear echo mutat select word continu experi local neighborhood power mean tendenc fairli local mean found intellig jump local optim solut found select recombin innov promot kind intellig jump combin effect select start understand effect process human innov peopl innov grasp set good solut notion context specul combin notion individu thought subject introspect written similar french mathematician possibl imput discoveri pure chanc obviou invent mathemat place combin idea french similar invent make recogn import mass thing impart verbal descript modern comput innov intuit articul basic understand mechan genet algorithm intuit understand examin motiv real world motiv previou suggest appeal strong motiv adopt practic motiv user genet evolutionari answer question gener made identifi motiv motiv motiv natur motiv artifici system motiv compet motiv econom remaind detail motiv thing attract user call genet evolutionari comput gener receiv media print account discoveri invent popular artifici life complex system account attract user man solv problem buzzword problem method result motiv attract retain motiv natur excit draw ou factor hold scientif reason endeavor grant life planet adapt form creat natur select natur genet understand natur algorithm appli solut problem thought make work import act exist proof track havent engin ultim genet algorithm peopl human flight observ year attempt doom failur knowledg fly plai dual role provid specif inspir design detail airplan sustain inquiri continu failur mount research inspir natur continu effort dont turn motiv artifici system natur sourc idea exist proof inspir larg design motiv root limit tradit optim oper research method larg number method linear problem linear grab linear program problem grab dynam program nonlinear problem nonlinear grab nonlinear fact list accept method problem class part problem tradit method tune problem problem violat assumpt solut result disappoint wouldnt nice artifici search optim procedur work broader class artifici genet evolutionari method potenti answer evolut natur system place mechan wai invari natur similar search procedur environ user turn breadth solut qualiti reason effici motiv compet qualiti attract funni thing happen applic work small toi problem applic work turn larger harder problem instanc find solut time solut qualiti user problem scale oper work abandon genet evolutionari comput frustrat affair simpli remain question robust algorithm exhibit poor behavior year difficulti swept simpl genet evolutionari algorithm fix crossov mutat oper fairli limit mathemat perform support assert fairli deal breaker companion result show adapt oper overcom difficulti effect pioneer develop compet genet solv hard accur develop messi ga led compet fast messi ga spawn famili includ gene express messi ga linkag learn ga linkag detect ga nonlinear detect bayesian optim algorithm boa implement integr practic awar frustrat problem scale oper place everydai user find hard problem solv reliabl accur time grow quickli quadrat function number variabl motiv econom forego discuss number fairli sophist reason user motiv genet bottom line bottom line interest receiv econom benefit perform genet optim econom prime mover fairli direct genet evolutionari algorithm enabl optim improv system amen algorithm result direct econom benefit econom benefit critic choic nonetheless examin circumst econom invest method econom model invest econom speedup econom reason user turn invest optim method limit resourc concern comput improv solut problem broadli compet method dispar techniqu tradit invest learn singl broad method lower collect techniqu case collect method user learn techniqu cost add thing user prefer trade perfectli tune solver adequ job addit invest knowledg method method invest cost user lion share invest ti model simul complex optim involv fairli sophist object function reli approxim solut nonlinear prior model optim user expend time effort input run test tune model real model analysi larg invest user told order perform model form prefer optim optim method requir kind model transform genet function evalu respect invest user analysi code substanti modif transform fair attitud function evalu make assumpt solut interfac involv pass function evalu valu deriv higher order solut requir hundr thousand function evalu suggest number reduc compet time good larg fairli larg number function evalu concern wai wai speed effici includ space util time evalu hybrid advanc begin made rapidli front goldberg miller expect practic mean speed solut dai dai golden era comput innov creativ compet effici li hint exist effort repres form comput compet hard problem solv accur simpl matter embark human intellect regularli augment innov comput kind excit ramif era comput innov creativ predict compet ordinari part corpor problem solv creativ algorithm develop extens methodolog design compet winner loser busi determin partial rapid techniqu comput innov creativ scientif import util problem solver point detail increasingli clear join everydai busi tool travel peopl analog finit element method describ import permit regular everydai solut field problem fluid mechan solid mechan combin thereof start similarli regular kind comput tool design innov trend continu made implement begin techniqu command mere shadow kind thing month year prove demonstr difficult languag discov correct talk exist form comput innov discuss wrong talk exist creativ human human reserv word categori suggest word reserv peopl thing transfer knowledg domain creativ book piec art allud bring thought notion domain creativ scientif discoveri creat transfer seemingli unrel idea similar shortli creativ algorithm transfer idea domain idea build method import integr soft comput give system power imagin suggest clear increasingli import embrac method quickli enthusiast compani worker reward competit advantag dont specialist corpor comput innov creativ tool function distribut point applic present compani examin embrac encourag spread educ critic earli concept wide taught undergradu experi extens import scientif impact util solv problem genet evolutionari comput innov possibl creativ area scientif research benefit algorithm model human innov creativ social attempt model peopl matter social mental life present studi proce explicit model human innov model fill import gap artifici agent polit start show trend util model scientif endeavor understand understand innov creativ process fundament alter social scienc relat disciplin biologist understand illumin critic biolog process properli understood direct scientif inquiri start essai understand pass perman part toolkit continu review basic tie process kind comput innov examin facet dimens user includ motiv artifici econom real user motiv combin factor initi user drawn combin stai reason suggest evolutionari genet algorithm incap solv hard dont scale bad research illinoi show design overcom difficulti design compet genet user stai varieti good econom reason directli impact econom design give design output optim process direct user stai reduc invest cost method fulli util exist invest model extend provid qualiti solut effici time relax function hybrid factor suggest perman part design tool kit suggest method golden era comput innov creativ commonplac newer techniqu suggest invent deliv knowledg social biolog scienc possibl era risk fail master technolog find disadvantag wise action enlighten compani knowledg worker japan globe excit technolog acknowledg research sponsor air forc offic scientif air forc materiel grant research fund work provid grant armi research laboratori feder laboratori cooper agreement govern author reproduc distribut reprint govern notwithstand copyright notat thereon view interpret necessarili repres offici polici express air forc offic scientif armi research govern refer isaac book scienc natur quotat model ideal bound case parallel genet algorithm genet program annual pipelin oper genet algorithm rule learn doctor ann arbor genet algorithm machin learn applic genet algorithm electromagnet system design evolutionari genet algorithm wilei sweet spot bentlei evolutionari design comput academ press time algorithm continu problem genet evolutionari comput confer publish illig report accur optim difficult problem fast messi genet algorithm intern confer genet publish illig report messi genet result complex publish report optim search hybrid genet evolutionari comput confer publish illig report psycholog invent mathemat field princeton nj learn gene linkag effici solv problem bound difficulti genet algorithm doctor ann arbor publish illig report gene express messi genet algorithm report lo lo alamo nation laboratori optim sampl genet algorithm artifici neural network engin identifi linkag group detect genet evolutionari comput confer bayesian optim algorithm genet evolutionari comput confer mix genet algorithm intern confer genet
Agents/1193 1 comput logic roadmap toni depart imperi colleg queen london uk decemb abstract comput emerg comput paradigm prove extrem success deal number problem technolog develop applic paper report role comput logic model intellig exist agent program languag identifi challeng direct futur research introduct past ten year eld comput emerg greatli due technolog develop faster cheaper fast reliabl interconnect emerg world wide web develop time open applic electron pose integr great quantiti inform build complex legaci code establish eld comput con rmed emerg number regular confer accompani creation european network excel intern set standard eld foundat intellig physic agent accept de nition facilit discuss agreement agent comput hardwar exhibit agent abil act direct includ human agent situat environ perceiv sensor act reaction stimuli agent belief reaction input agent capabl exhibit intellig problemsolv plan activ order achiev short long term goal system collect addit exhibit social agent awar interact modifi behaviour order facilit social agent set high construct mean address direct commun agent joint individu goal abil negoti agent facilit achiev goal construct joint plan achiev joint goal belief context addit sourc inform provid agent area comput orthogon number tradit comput softwar distribut humancomput telecommun arti cial intellig arti cial number approach repres agent notabl bdi approach bdi approach agent agent interact environ agent object aim plan commit desir intent repres modal oper world semant agent belief commit commit product rule refer state agent oper bdi approach logic simpli tool repres reli execut model wide gap theori practic approach recent number logic agent put form comput logic knowledg comput tool necessarili implement past present develop comput logic relev crucial model understand agent agent reason bring desir perform enhanc abil learn function environ complet number altern action modifi belief dynam perform integr check agent perform con possibl argu develop comput logic make contribut includ develop tempor abduct induct reason action reason prioriti belief argument survei agent technolog applic found paper complement report approach model singl agent system comput theoret applic perspect report rst attempt provid survei comput agent system discuss potenti challeng rapidli emerg eld report section survei exist comput agent system section describ research section outlin futur opportun section conclud state art section survei exist agent system base comput logic techniqu section refer formal give full extend logic program abduct logic program integr constraint formal reason action event calculu languag situat calculu golog event calculu logic program formal origin situat calculu understood comput logic number logic program publish golog logic implement prolog remaind section subsect number di erent approach viewpoint knowledg agent reli architectur emploi govern behaviour agent featur exhibit support system subsect describ main featur exist languag program agent system subsect report applic implement exist tool theori knowledg number exist approach view point intent borrow ontolog desir intent bdi borrow speci languag semant underli comput mechan adopt approach obtain reactiv perform plan plan amount proactiv behaviour plan set order action plan delib process gener set action achiev goal paper refer similar logic account plan kowalski sadri emploi integr constraint observ repres belief agent nition extens usual clark complet logic program negat failur integr constraint implic observ conjunct liter integr constraint condit action commit deontic oblig goal goal properti hold futur nition repres belief agent agent bui steal integr constraint repres prohibit agent bui oblig time agent bui tv licenc rule agent steal object hear polic agent run goal plan achiev goal bui tv licenc note inform descript simpli cation omit time knowledg nition integr constraint sucient gener incorpor di erent tempor reason event extens incorpor spirit situat calculu plan librari reason engin underli agent combin backward reason unfold goal forward reason integr constraint manner base abduct proof procedur plan reactiv achiev reason backward observ explain abduct explan conjunct belief kowalski sadri agent reactiv replan light dynam gener goal activ integr constraint norm behaviour agent dynam gener goal initi goal remaind section refer reactiv replan dynam agent observ monei receiv bank earlier plan tv bui agent replan reactiv rst remain plan steal tv agent execut plan observ presenc polic rule gener goal run illustr reactiv repres belief agent formul event calculu semant circumscript formul event calculu includ compound primit action domain room connect door connect repres set ground fact form door connect room primit action door compound action de ned term primit compound action room de ned term primit connect room adjac formul event calculu hierarch facilit plan progress order hierarch complet plan action plan fulli term primit action progress planner gener earlier action plan rst advantag progress planner compar regress planner rst interrupt rst action gener partial construct execut immedi case regress planner similarli agent augment belief mean observ explain agent reactiv rst baral gelfond extend logic program implement cation languag belief agent express theori languag histori past observ agent goal properti hold futur logic program proactiv reduc goal plan agent reactiv rst observ environ directli ad knowledg base explan trigger gener action languag basi mobil robot baral al addit background theori precondit baral al collect product call control ect reactiv agent pereira repres belief mental state model extend logic program structur compon extend logic program formul event explicit reason time set logic program rule integr give relationship agent attitud form goal int agent desir set logic program rule describ transfer belief intent agent assimil inform naiv agent accept inform agent believ sincer cautiou agent accept inform agent believ provid inform contradict belief integr constraint enforc properti explicit negat hold agent properti negat agent contradictori goal observ past event agent reactiv belief observ vivid agent extend logic program reaction rule activ action similar reaction rule lack trigger event vivid agent goal reaction rule encod reactiv commun behaviour action rule encod proactiv gener plan achiev goal telecommun vivid agent hold belief base transceiv station send live signal base case live signal autom load dock agent load unload agent reaction rule agent receiv messag agent agent hold box agent send messag back acknowledg receipt messag note reaction rule avoid overlap agent agent hold action rule posit head north make step nding di erent closer object impact system develop defenc advanc research project consortium collabor includ di technisch wien armi research laboratori agent belief repres agent style logic integr constraint action describ action individu agent perform rule agent program rule includ deontic modal action oblig agent program tank oblig attack tank tank oblig proce rout block tank belong enemi integr situat action perform speed tank exce maximum speed di erent plane rout concurr altern set action gener reaction messag agent program di erent criteria altern set action comput complex examin extens approach incorpor tempor probabilist agent reason chapter chapter interrap version event calculu reason time incorpor hierarch structur belief world histori agent mental event calculu social provid belief agent interact reason engin base abduct proof similar interleav plan execut partial construct plan combin imper logic program agent entiti goal plan rule belief form sentenc logic languag full logic logic goal program built primit sequenc similar golog plan rule logic composit bodi agent architectur common featur exist agent architectur presenc abstract term kowalski sadri adopt cycl resourc limit paramet determin term infer step absolut time compon consist explain gener action reaction plan achiev goal agent architectur independ plan algorithm underli tempor action theori implement hierarch progress planner base event calculu adopt event formul inspir agent reason interrupt accept input gener output output action gener input receiv iter action gener reactiv proactiv earlier iter adopt cycl plan phase iter cycl term resolut step baral gelfond adopt explicit agent cycl form rst action cycl step cycl complet plan gener select goal iter cycl observ invalid precondit action case replan impact system adopt similar cycl receiv action select action record result cycl reason place complet singl iter agent cycl agent explicit goal plan convent step cycl action execut reason agent program integr constraint approach length agent built top arbitrari softwar legaci special mechan bridg actual data structur softwar logic atom framework impact theoret foundat work build heterogen techniqu vivid agent run cycl plan activ concurr cycl receiv incom messag repres percept commun gener reaction dictat set reaction rule reaction depend agent belief updat plan compon consist planner action compon plan execut planner copi updat belief remain implicit explicit cycl interrap layer architectur consist lowest deal agent middl local plan deal top social plan deal interact layer knowledg earlier layer involv plan schedul process ow control behaviour agent emerg interact individu layer model basic protocol ow upward activ layer compet deal send request layer result process layer report back origin layer downward commit plan schedul process di erent layer coordin activ commun commit local plan layer account partial plan social plan layer negoti joint plan pereira approach cycl implicit agent explicit goal plan event theori action time agent mental state updat observ approach plan concept intent bdi choic plan altern implicit explicit system section featur approach speci calli system applic featur includ commun languag protocol capabl repres reason agent belief sadri toni extend languag commun action addit abduc predic belief model asynchron commun illustr extend languag updat agent belief commun agent author show integr constraint languag model commun kind fipa exampl agent question friendli agent agent answer agent agent question neutral agent agent answer ten unit answer answer ten unit repli apolog pereira combin agent kowalski sadri dynam logic program result framework agent plan react chang knowledg base goal attempt chang knowledg base goal dynam logic program declar procedur semant evolut knowledg base state state impact approach approach pereira agent hold belief agent impact agent exchang messag agent extend logic program exchang belief explicitli commun impact ad secur updat social plan layer interrap involv commun reason agent belief hindrik al extend singl agent languag commun primit repres system primit partit consist consist req er semant set primit base deduct deduct deriv inform receiv abduct obtain repli request commun primit sender receiv particip time unlik speech act semant hindrik al concern mental state speaker agent necessarili receiv agent deal messag speci ed semant prototyp develop year project includ consortium collabor industri york north prototyp emerg experi develop industri identi es applic electron commerc collabor identi ed logic core declar knowledg major advantag compar approach compar program commun logic program multipl challeng translat heterogen rule system involv syntact deep declar semant facil con ict handl merg updat rule agent rule agent multipl expert maintain rule set incorpor con ict handl commun complement varieti exist rule execut engin adopt handl con base logic program form logic program tractabl compil ordinari logic program agent commun includ translat common interlingua xml call busi rule markup languag robertson develop method negoti contract repres logic program chang dynam result agreement parti involv reach logic program gener mean argument adapt develop pool di complementari approach multiag system belief goal individu agent agent set set action system consist nite set singl agent special model environ set altern set action altern probabl distribut action altern probabl distribut give measur action chosen environ logic program negat failur abduc atom action agent logic program relationship action state result agent perform assign util state state correspond canon model logic program extend set select action pool adopt convent techniqu infer strategi choic action individu agent strategi agent util individu agent comput mean techniqu system consist environ footbal kick ball left jump left order stop ball time footbal front footbal decid direct kick decid direct jump logic program agent action lead world goal util world footbal probabl action environ express chanc goal score high jump direct footbal kick direct bozzano al provid logic framework develop agent equip set fact de ning state set rule behaviour agent implement enrich primit updat commun logic program languag section illustr logic languag applic languag extend prolog exhibit thread thought multipl thread share execut code mobil comput network logic program extens primarili intend implement interact theorem prover suitabl develop distribut arti cial intellig interact agent featur expect standard data base manipul predic latest version er commun facil process abil launch thread provid concurr execut agent belief dynam access updat agent thread dynam blackboard mechan commun agent facil perform belief incorpor compon constantli monitor updat ad agent belief background compon deriv assert interest consequ updat facil concurr execut queri agent thread explicitli commun send prolog term messag recipi receiv inform messag origin repli thread equip set reaction rule thread react messag receiv thread execut reaction rule repeatedli reaction rule messag messag pattern conjunct messag pattern conjunct messag pattern conjunct commun place thread execut process machin commun exploit power comput network infer engin network commerci logic program languag integr knowledg process compon java object distribut network applic applet internet coordin thread achiev local term uni cation thread comput perform mobil equip commun primit aim conveni develop platform distribut arti cial intellig applic build intellig autonom agent applic develop stock market user programm intellig agent connect simul real world stock trade servic develop futur applic envisag assist custom mobil cell car comput network model recent port prolog prolog public domain constraint logic program system subsum number featur implement softwar prolog support share atom remot commun interfac local remot www system make add syntact semant extens structur tradit prolog ect part languag includ larg set librari prolog gener execut base compil bytecod movement code dynam platform prolog goal mean separ thread thread commun prolog share thread thread access share fact wait fail exist concurr launch concurr thread predic read wait concurr predic current read access sourc temperatur measur assert concurr fact state read temperatur primit extens conjunct gener handl concurr goal execut remot machin basic primit build block model varieti knowledg paradigm architectur model rule implement languag extens capabl languag syntax packag reaction program updat prolog support object state repres set privat fact access object object fulli integr object execut thread distribut fashion object share code object share set intern fact model privat state fact concurr atom updat access prolog special kind call view server method activ object launch answer request receiv activ object implement distribut knowledg base updat global fact automat remot agent event base approach process base limit model commun synchron point point commun concept send receiv reli messag uni cation method exchang inform concurr process syntax similar share prolog oper semant special reserv predic deal commun program languag extend prolog mean modul inherit thread commun share memori cell partial speci ed determin structur modul equip interfac network interfac environ thread execut logic program set modul modul fragment logic program inherit overrid modul appli give dynam version brook subsumpt architectur symbol manipul permit commun dynam recon gurat achiev dynam subsumpt architectur implement footbal plai agent environ implement applic section brie describ implement architectur system survei earlier describ applic kowalski sadri architectur implement prolog test number applic applic distribut inform integr agent equip knowledg act mediat integr inform sourc answer user queri handl heterogen di erent sourc facilit resolut con ict collect manag inform network agent emploi check enforc structur properti network dangl properti content node network learn agent learn precondit action approach implement prolog test navig problem khepera robot robot sensor move environ environ architectur robot plan move execut move replan presenc newli observ obstruct architectur baral gelfond implement prolog envisag applic shuttl control support architectur mobil robot compet aaai robot competit rst robot robot requir navig round topolog map hit obstacl nal vacuum clean robot requir navig corridor room order clean room robot work forbidden enter room human clean corridor presenc human won rst place contest system pereira implement system test exampl vivid agent implement test distribut diagnosi distribut diagnosi comput network diagnosi commun protocol techniqu costli larg commun overhead vivid agent approach system set agent detail knowledg subsystem abstract knowledg neighbour system core impact implement java system built collect heterogen test number nontrivi armi war reserv plan agenc integr armi logist involv massiv amount data distribut distribut simul rout plan free terrain applic involv track enemi vehicl battl eld attempt predict enemi agent base meta knowledg system intend train simul battl eld interrap implement prolog oz test number softwar hardwar robot control autom load simpl agent load track coordin avoid con ict transport task schedul network comput integr manufactur prototyp implement java appli integr manufactur suppli chain electron commerc appli negoti includ contractu agreement describ bid good bid contractu agreement speci es price product attribut complex term condit deal secur polici includ deleg multipl agent certi applic make featur agent commun handl con ict pool approach implement prolog test robot exampl framework bozzano al appli train collabor italian railwai plan good collabor intern compani servic retriev medic inform medic research challeng survei section illustr issu address comput agent technolog remain research develop challeng roughli divid singl agent implement applic develop singl agent architectur function singl agent architectur enhanc signi cantli research number area includ sophist ecient planner tradit arti cial intellig planner plan goal complet plan form sequenc action found agent act time fashion dynam environ incomplet inform handicap act form complet plan sophist plan techniqu construct plan hierarch deal ecient environ requir replan develop plan librari plan repair techniqu avoid recomput plan similar goal integr proactiv reactiv integr research sophist techniqu select goal action ensur time exist techniqu comput util action develop schedul interleav execut plan reaction environ belief agent belief goal light inform observ receiv commun agent great deal research belief knowledg base techniqu test possibl develop adapt agent system percept applic agent perceiv aspect environ import function select percept avoid overwhelm stimuli function delai percept environ issu hardwar softwar agent learn agent function complex evolv capac learn improv perform learn plan precondit pro le commun protocol comput logic made signi contribut learn induct logic program incorpor learn tool exist agent architectur worthi challeng system work number includ cooper joint plan agent joint individu goal cooper behaviour crucial achiev joint goal achiev individu goal formal reason techniqu negoti negoti plai import part agent joint construct joint con ict individu resolv con ict negoti argument negoti comput logic set develop languag tool repres reason agent goal intent cooper agent set advantag belief agent goal intent perform commun agent greatli agent avoid action plan unaccept preempt agent agent behav ectiv inform intent agent chanc success action develop commun protocol semant languag negoti ectiv dissemin inform agent system attempt incorpor commun develop applic approach earlier report reach sucient matur test realist applic number industri impact industri commerci concern identi ed bene ts agent discuss detail section futur opportun industri commerc rapidli begin potenti agent technolog number applic sycara wooldridg identifi kei process transport inform electron busi process interact theatr patient health care number compani establish agent technolog direct collabor academia develop exploit fast emerg agent technolog emerg consensu research develop endeavour recognit complex handl rich sourc inform complex adjust increasingli sophist user demand lead import incorpor intellig system major aspect comput agent plai signi role survei system earlier section system design deal rich knowledg incorpor proactiv reactiv behaviour dynam environ pose excit opportun signi challeng research commun make industri awar research develop demonstr techniqu deal emerg problem project start made progress noteworthi system primarili fund develop fact comput logic origin enjoi earlier develop great deal research comput agent carri european academ establish addit opportun immedi open eld industri commerci great deal scope research develop comput logic argument reason reach sucient matur agent architectur signi cantli enhanc function architectur pave number excit applic electron commerc agent work dynam environ adjust increasingli sophist user demand incorpor learn facil agent system enhanc function symbol manipul data combin reactiv proactiv base agent show inform integr dynam domain www incorpor user pro ling techniqu agent architectur provid access heterogen inform sourc agent function program languag develop opportun faster easier applic develop survei current work area comput work includ speci cation agent comput implement realist applic uni ed lling gap theori practic work agent argu comput develop distribut arti cial show great enrich research agent emerg consensu research ment endeavour recognit complex handl rich sourc inform complex adjust increasingli sophist user lead import incorpor intellig system signi aspect comput agent contribut develop agent comput logic techniqu young fast grow area research commun enthusiast interest industri unit state workshop expect number enthusiasm particip acknowledg author manuel lui moniz pereira comment contribut jim ab mamdani jeremi pitt discuss refer jj ja lm dynam logic program schubert proc intern confer principl knowledg page morgan reason agent dynam domain minker workshop arti cial washington june tc theori robot robot contest proc intern confer autonom pm ra framework default reason arti cial intellig multiag system develop softwar engin proc intern workshop practic aspect declar languag gupta springer lnc page intellig arti cial intellig hermenegildo implement distribut concurr constraint execut system proc joint confer declar page hermenegildo www program comput logic system proc workshop logic program conjunct san april hermenegildo modul system prolog proc workshop parallel implement system conjunct mexico state decemb negoti argument proc workshop multi agent system logic program conjunct mexico state decemb distribut commun agent meng depart imperi colleg technolog hermenegildo concurr prolog thread share proc intern confer logic mit ds tabl evalu delai gener logic program jacm kl negat failur minker logic data page kl messag commun proc australian workshop distribut arti cial kl program internet distribut dai applic proc australian workshop distribut arti cial clip group system refer manual system document de august jm hermenegildo persist interfac technic report decemb jc distribut algorithm develop proc euromicro workshop parallel distribut ieee comput societi ts program languag intern concurr logic agent proc workshop multi agent system logic program conjunct mexico state decemb lm extend logic program system knowledg base intern confer knowledg morgan agent logic program phd imperi colleg technolog updat agent proc workshop multi agent system logic program conjunct mexico state decemb combin introspect commun ration reactiv agent del proc european workshop logic arti cial page lnai springer commun agent proc workshop multi agent system logic program conjunct mexico state decemb tempor agent reason technic depart comput septemb probabilist agent reason technic depart comput septemb meta agent program journal logic pm accept argument fundament role reason logic program game arti cial intellig heterogen activ semant arti cial intellig heterogen activ algorithm complex arti cial intellig tj heterogen activ polynomi implement agent technic institut technisch design holon manufactur system journal robot autonom elsevi scienc ra proof procedur abduct logic program journal logic program logic program classic negat proc intern confer logic page mit repres action chang logic program journal logic program bn con ict handl logic program proc intern logic program page mit bn chan declar approach busi rule logic program xml mp wellman proc acm confer electron acm attribut variabl implement concurr parallel logic program system proc intern confer logic page mit de la compil workbench futur system parallel implement logic constraint logic page nova kv fs de van der hoek control structur agent languag proc intern workshop agent lnai springer de van der ch semant commun agent base deduct abduct proc workshop agent commun languag conjunct page nr roadmap agent research develop autonom agent system kluwer academ cg situat abstract plan abduct tempor reason prade proc european confer arti cial page cg layer agent calculu continu process wooldridg intellig agent lnai springer ac ra role abduct logic program dm cj hogger ja robinson handbook logic arti cial intellig logic program oxford kowalski logic program integr constraint proc european workshop logic arti cial page sadri logic program system annal mathemat arti cial ra mj calculu event gener comput ra execut suspend logic program fundamenta informatica comput logic machin roadmap induct logic program technic stefan ja lm iter logic program updat ja proc joint intern confer symposium logic page mit press hj rb logic program languag dynam domain journal logic special issu reason action circumscript form reason arti cial intellig pj philosoph problem standpoint arti cial intellig michi machin intellig edinburgh jp design intellig layer approach lnai springer jp pragmat bdi architectur mn singh read page morgan dynam subsumpt architectur program intellig agent proc intern confer multiag page aaai program languag applic system proc workshop multi agent system logic program conjunct mexico state decemb model agent interact logic program fukuda proc intern confer applic hermenegildo object orient program model prolog technic report clip de juli independ choic logic model multipl agent uncertainti arti cial intellig rao mp georg model ration agent proc intern confer knowledg page morgan abduct negat failur activ agent proc congress italian associ arti cial page ecient argument framework negoti autonom agent proc workshop model autonom agent springer vivid applic technic depart comput citi mp reinvent work note aaai fall symposium cognit page mp abduct event calculu planner journal logic program arti cial intellig oz program model comput scienc lnc springer heterogen agent system mit logic program tool advanc internet program proc intern symposium logic page mit implement continu pass prolog engin corp technic intellig mobil agent program intersect java prolog proc fourth intern confer practic applic intellig agent page autom reason collect inform manag proc intern workshop interact conjunct annual confer ec octob itali van ka js unfound set semant gener logic program proc acm symposium principl concept learn system msc depart imperi colleg technolog base system semant integr inform msc depart imperi colleg technolog advanc system morgan
IR/1194 5 intern confer inform system juli vol decor toolbox organiz memori access andrea german research center artifici intellig po box germani gregori inform manag nation technic greec rudi christian stephan müller dr consult germani maria legal planet ernst greec kei organiz workflow shortli motiv idea orient knowledg manag sketch basic approach achiev goal describ decor project consolid method tool decor build framework al abeck al organiz memori overcom limit approach decor environ serv valid iter improv innov approach knowledg archiv formal busi process facilit navig activ inform deliveri servic collabor workflow tool support work offer user manner inform knowledg method analysi knowledg requir support method design introduc system present basic modul decor toolkit elabor current statu develop paper describ project decor grant decor consortium consist german research center artifici intellig planet ernst young group dr consult social secur nation technic greec manag knowledg busi process busi process manag busi process reengin malhotra predomin busi trend mid eighti evolv hype decad mid nineti trend knowledg manag al davenport discuss import obviou aim similar econom qualiti effici requir clear strateg plan integr suit technolog technolog support approach build model busi inform system approach difficult riski make combin order exploit synergi reason term make easier enter organ km fact consult familiar tool make easier start km initi solid ground total scratch question process orient knowledg concret integr possibl exist system km initi start elabor analysi plan phase share km project methodolog rough framework sequenc km specif work system mean run workflow tool workflow engin km infrastructur lead higher system servic item show increasingli closer realiz increasingli inform support user solv intens problem context workflow idea foster fill knowledg archiv evolv content knowledg busi process model organ knowledg repres view compani commun knowledg manual easi coupl inform system actual workflow enact busi process activ respect set inform activ archiv access easili tool market realiz idea herrmann al activ inform workflow engin enact busi process attach inform specif workflow start specif automat pose queri knowledg archiv attach inform proactiv offer result inform support user dynam process approach extend predefin inform attach busi inform variabl fill run workflow inform retriev account inform idea recent investig research project al staab schnurr basi decor approach contextu inform concret workflow context document creat km system storag creation context term detail actual busi process archiv document inform retriev similar busi assess qualiti knowledg creat project import background inform relat process aspect coupl workflow km system inform deliveri servic activ background inform run busi process stimul discuss content qualiti inform object retriev paradigm al user easi possibl make attach send author knowledg run activ rise critiqu inform object system spirit continu process continu feed back experi chang request insight requir chang environ factor process design unit steadili formal process model practic enact continu improv process km process integr level discuss suffici fix busi process model deeper analysi knowledg work shum show process tend dynam inform highli individu commun collabor make difficult plan detail work task advanc easi deal observ preserv benefit achiev integr section model relat busi process roughli emb subtask black box detail descript order achiev usual workflow benefit process autom document plan shown al level granular fix case specif workflow archiv skeleton process enact adapt workflow evolv skeleton repositori discuss pro con fragment decor concentr item list system archiv activ knowledg dynam process context order systemat build solut busi requir investig system design phase overview decor start point observ compani knowledg base explicitli document knowledg spread sourc media figur scenario activ knowledg deliveri link relationship document repres inform system al oleari acquir commun system user commonli domain structur logic domain area work formal gener accept domain knowledg basi content descript knowledg sourc knowledg portal support manual inform retriev algorithm evalu queri archiv system decor emploi formal model busi process ontolog potenti usag knowledg item lead idea structur meta inform system provid conceptu structur access underli legaci system user engag daili work dont spend time search inform store knowledg deliveri servic user inform autonom inform manag servic desktop achiev decor emploi workflow manag system host system awar specif task perform user point time workflow model repres work routin strict predetermin administr workflow enrich workflow model describ inform flow inform specif task inform assist observ run workflow interpret model inform offer activ support structur maintain notion inform retriev context model inform flow variabl queri archiv task context inform storag describ creation context knowledg item exist knowledg sourc extend effici consist compani figur illustr system part plai system usag time scenario base number analysi model step busi process map domain ontolog content workflow busi inform flow inform workflow acquir maintain time approach introduc compani larger context knowledg manag busi process manag initi requir step carri reason cost predict result structur approach run orient km project support project step methodolog guidanc model tool decor toolbox figur show modul cor toolbox support design implement system previou section discuss complement modul figur decor modul system build decor busi knowledg method decor busi knowledg method methodolog approach run project main element identif process process analysi domain ontolog construct analysi knowledg deal weak workflow structur current draft process analysi domain ontolog construct amalgam element commonkad al schreiber al figur sketch relationship analysi step draft method test case studi subject improv busi knowledg model tool decor model tool support integr manner model activ relat method inform domain knowledg process specif context variabl contrast exist ontolog model primarili address user specif ai background orient exist tool build busi busi process analysi task role peopl ontolog creation figur busi knowledg process analysi ontolog design widespread ontolog model formal topic map graphic model decor model tool develop realiz set relat model method commerci microsoft visual tool ensur wide usabl softwar basi good familiar user interfac action coupl dynam link decor basic archiv system model activ user interfac directli lead respect effect configur underli knowledg concept link insert busi process model index concept ad document model dynam link basic archiv system equip graphic model interfac semant reason link link respect restrict repres relationship directli reject demonstr dynam link tool softwar basi decor basic archiv implement possibl directli store model result ascii base interfac inform exchang tool provid base upcom ontolog approach oil basic archiv system basic archiv system store knowledg item link document tacit metadata link knowledg item metadata repres term underli ontolog design decor modul busi process model structur criteria manual navig hierarch indic extract index ontolog queri archiv xml retriev messag combin retriev constraint formul link metadata softwar basi decor basic archiv system product offer gmbh repres arbitrari knowledg network built attribut object attribut link inform object structur element inform object encapsul logic content set document relat metadata power mechan express arbitrari index ontolog relat document model link origin document annot interfac order fill archiv softwar easili attach semant categori term model knowledg term link inform object structur element document fed structur archiv requir link establish decor modul design index bottleneck km system document manag build gener interfac annot tool automat text classif softwar test classif learn text classif workbench develop dfki api provid insid inform manag gmbh extens tool emploi number algorithm decor modul requir design instal structur archiv fill annot knowledg item return section discuss system behaviour runtim deal oper busi figur add decor solut workflow tool decor workflow support model support enact machineri flexibl adapt workflow al analyz requir workflow support characterist knowledg intens work figur cp al prototyp process archiv process templat convert process model task specif process logic defin separ uniqu low volum variabl perform individu time strong sequenti order frequent except uncertainti input output unstructur work rule routin involv person judgement experi figur work task specif hierarch black box defin runtim ms integr basi process model exist prototyp implement specif decor support design phase import featur interfac retriev agent structur archiv feasibl basic idea shown project al abeck al strong requir decor case studi convent workflow approach proper subset comfort system interfac usabl end knowledg agent decor knowledg agent workflow engin model inform proactiv offer inform structur archiv user charg task feasibl princip idea shown implement detail decor implement base fipa compliant softwar agent platform jade relat work project statu main distinct featur decor project idea total solut inform retriev task main advantag research prototyp work aifb schnurr concentr intellig techniqu centr inform document context complet scenario analysi model introduct mainten advic descript system design toolkit element main concern paper project focu technolog consolid research idea standard topic commerci softwar widespread tool scenario individu element statement statu work design differ discuss respect part relat work modul idea organ analysi fundament method deepli ground exist work exist approach herrmann al lead technic innov project idea main topic eu project promot similar analysi goal reli convent workflow paradigm idea inform retriev interpret highli process formal model complex attent person inform agent son hammond detect task user knowledg retriev inform contrast local work context obtain applic user relev knowledg task inform combin interpret work context eu project ma al close scenario point focu matter individu user profil abeck show context model unifi view approach requir workflow system support seldom discuss literatur similar result cor recent identifi similar characterist typic busi process area basic archiv tool power technolog similar competitor integr model tool automat classif facil uniqu method softwar modul develop decor work develop pilot system medic social secur pilot instal greek social secur institut system support process grant full ag insur peopl part normal administr workflow knowledg document intens step find step legal influenc legal central correct result process decor pilot improv high qualiti servic step pilot interfac import brussel hospit bodi citi deal peopl troubl workflow accomplish patient file send administr account data delai wrong made due miss knowledg experi step lead heavi loss pilot built subsidiari german red deal process blood blood highli sensit applic softwar system compani sap instal valid nation intern law regul process make sap system valid statu document support pilot system decor project develop continu test pilot total solut orient knowledg manag goal extend scenario concern storag evolut process knowledg knowledg manag process intertwin workflow execut refer technolog organiz ieee intellig proactiv deliveri int journal inform system suppli busi process coupl workflow document analysi inform base issu cool solut knowledg industri case canada manag switzerland buckingham construct um inform technolog knowledg manag pp interact everydai applic context inform proc intellig user interfac acm knowledg work sloan manag reprint summer work harvard busi school press integr user profil inform deliveri organiz memori draft evalu und da semant al german und de workflow memori inform system von mit band verlag german reengin manifesto busi lernen von für die fachbereich informatik universität kaiserslautern german approach knowledg int conf practic aspect knowledg manag framework open approach enhanc memori system context model int conf practic aspect knowledg manag electron ifip wg confer electron adapt workflow support knowledg intens work artifici intellig applic institut scotland process ieee engin manag st mit al german knowledg practic verlag ai knowledg knowledg base ieee intellig page memori manag ebusi madrid knowledg engin commonkad mit press die für al german task support proactiv access organiz pp train banff knowledg acquisit workshop base approach evolutionari workflow manag system concept vol pp
IR/1195 5 keyword introduct reinforc learn agent person inform filter relev feedback α β α β α β β learn user prefer analyz user γ learn user behavior person inform filter α β α result averag explicit relev feedback averag implicit relev feedback number filter html document rocchio id number filter html document implicit feedback vp conclud remark acknowledg refer
DB/1196 3 empir evalu adapt spoken dialogu system dian litman pan lab florham usa comput scienc columbia usa abstract recent technolog advanc made build interact spoken dialogu system wide varieti applic user respect limit perform typic degrad user differ respect knowledg system dialogu strategi make system limit appar current system improv perform adapt dialogu behavior individu user paper present empir evalu adapt spoken dialogu system retriev train schedul web conduct experi user carri task adapt version result corpu dialogu valu wide rang evalu measur extract corpu result show adapt gener outperform util adapt depend initi dialogu strategi introduct recent technolog advanc made build interact spoken dialogu system wide varieti applic due limit area applic deploi system accept small set natur languag input user user respect limit spoken dialogu system perform typic degrad user utter reject dialogu length typic user achiev task goal individu user differ respect knowledg system limit dialogu strategi make system limit appar user current spoken dialogu system typic adapt dialogu strategi individu user major obstacl spoken dialogu system perform adapt dynam understand type properti repres user model automat acquir dialogu user intuit interact spoken dialogu system order improv system perform observ led explor util adapt spoken dialogu user system control adapt system dialogu strategi user effect adapt system system dialogu strategi match user point perform system improv whittak comment figur show dialogu adapt spoken dialogu system call initi set dialogu strategi found id chicago baltimor saturdai leav morn uh morn understand repeat answer morn find train baltimor chicago saturdai morn baltimor chicago saturdai find train baltimor dc tuesdai chang strategi user initi initi chang system system initi confirm strategi confirm strategi chang implicit explicit implicit heard dc tuesdai find train baltimor dc tuesdai citi chicago heard chicago citi leav baltimor heard leav baltimor dai week saturdai heard leav saturdai time morn understand repeat answer morn heard leav morn find train baltimor chicago saturdai morn figur dialogu adapt spoken dialogu system interact strategi work user utter understood recogn user strategi open end prompt earlier dialogu replac seri specif question highlight potenti excerpt corpu nition prefac utter heard earlier utter user awar result dialogu proce smoothli adapt rate correct queri gener present evalu adapt conduct experi novic user carri task version result corpu dialogu valu rang evalu measur extract corpu hypothesi test show varieti differ depend user abil adapt system assess contribut evalu measur perform show phenomena influenc adapt major phenomena significantli influenc perform result show adapt gener outperform util adapt depend initi configur dialogu strategi dialogu system access train schedul web telephon implement spoken dialogu system platform combin automat speech recognit phone modul dialogu manag applic function asr platform support user interrupt utter figur dialogu manag finit state machin control base current system state asr result applic function access train schedul set function return tabl list match train tempor hour tabl convert natur languag realiz tt templat depend user dialogu strategi manag initi strategi manag confirm initi strategi specifi control confirm strategi specifi user understood figur initi user initi system initi implicit confirm fragment provid addit illustr dialogu vari system explicit confirm user confirm citi chicago chicago baltimor dai week train current version liter strategi return tabl list tabl greater list train tabl report train satisfi constraint user continu find set train system initi explicit confirm cumbersom improv aspect perform user good understand system limit system initi reduc asr reject user utter system vocabulari grammar explicit confirm user task success make user awar asr make easier user correct occur system initi explicit confirm typic total dialogu length user utter gener strategi effect user initi approach user initi user specif question user initi user ignor question user utter user multipl attribut singl inform user potenti approach lead short dialogu asr perform problem earlier implement spoken dialogu system studi set initi dialogu strategi assign system default chang inappropri discuss improv perform dynam adapt choic dialogu base circumst hand goal automat control adapt requir solv open research topic real dialogu situat suggest system adapt initi research give user abil dynam adapt dialogu behavior user utter user reduc number asr reject chang strategi initi user utter correctli user dialogu length perform confirm test adapt system creat version adapt user dialogu user initi confirm utter figur default dialogu strategi chang design experi design test adapt perform differ depend initi dialogu strategi user task design consist initi dialogu task scenario subject technic summer involv design implement novic user spoken dialogu system previou version system initi implicit confirm gener user randomli assign adapt user randomli assign version initi dialogu strategi set system initi explicit confirm remain user assign version initi dialogu strategi set user initi confirm user perform task sequenc experi yield corpu dialogu hour user web read set instruct call phone instruct consist descript hint talk link task scenario task scenario find train chicago baltimor saturdai find exact find closest departur time write exact departur time train found total travel instruct adapt tutori explain guidelin dont system collect type data comput number measur relev spoken dialogu evalu dialogu record record calcul total time dialogu evalu measur count time dialogu user interrupt dialogu manag behavior enter exit state finit state machin log log calcul total number system turn user timeout user doesnt time suggest user cancel user undo previou asr reject confid level asr user repeat listen record compar log asr calcul concept accuraci semant interpret utter combin asr comput recognit score dialogu user fill web survei dialogu user departur travel time obtain dialogu singl correct train retriev task determin user successfulli achiev task goal user respond system easi system understand easi find schedul pace interact system point system slow repli system work expect current experi regularli access train schedul question measur usabl tt perform rang valu map integ repres optim user satisfact comput sum question rang result analysi varianc determin adapt produc differ evalu measur experi evalu framework understand evalu measur predict perform organ evalu measur perform task task success dialogu asr cancel dialogu system user time system user satisfact tt asr task interact user system expect futur adapt effect recal mix design consist initi dialogu task scenario evalu measur analyz anova factor anova demonstr main effect adapt task success system usabl dimens perform main adapt effect independ initi dialogu strategi task scenario execut user anova demonstr interact effect adapt initi dialogu strategi dialogu qualiti system usabl perform dimens contrast main adapt effect independ initi dialogu strategi effect adapt initi strategi tabl summar mean evalu measur show main effect explain interact effect row tabl task success significantli higher adapt user successfulli achiev goal task scenario dialogu adapt dialogu probabl differ statist standard upper bound call result statist row respect user user rate adapt highli recal user satisfact factor usabl questionnair account discuss correl system perform measur anova make adapt user rate task success user percept system usabl tabl summar mean evalu measur show interact effect adapt initi dialogu strategi similar pattern interact emerg task scenario initi dialogu strategi adapt effect initi dialogu strategi task scenario scope paper tabl main effect adapt measur adapt task success user satisfact tabl interact effect adapt initi dialogu strategi adapt measur recognit user futur row tabl user capabl adapt recognit versu versu percept user adapt versu adapt versu futur higher adapt initi strategi user adapt user regular basi futur smaller tabl differ reflect dialogu qualiti system usabl effect interact adapt initi dialogu strategi version make adapt mean measur shown tabl version recognit user result tabl user adapt system explicit futur specul user toler minor level type perform degrad order obtain control provid adapt specul util adapt expert user conjunct tabl result novic user suggest adapt extrem capabl add capabl worth ad interest examin adapt perform initi dialogu strategi dialogu adapt dialogu adapt dialogu adapt user adapt confirm chang time initi dialogu adapt dialogu adapt dialogu adapt user adapt dialogu user chang initi chang chang initi drastic conjunct anova observ lead specul adapt poorli perform system feasibl import novic user adapt perform system contributor perform quantifi rel import multipl evalu measur evalu framework deriv perform function data model posit perform correl extern criterion usabl user satisfact multipl linear regress model user satisfact measur repres perform dimens task dialogu dialogu user satisfact linear regress produc coeffici weight describ rel contribut predictor factor account varianc predict factor task success dialogu cost measur user satisfact predict normal function coeffici directli rel contribut applic data show contributor user satisfact task show perform function fit account varianc user user satisfact perform function demonstr perform subject usabl predict weight combin object measur dialogu task dialogu effici accur speech success achiev task shorter dialogu contribut perceiv perform perform equat explain main effect adapt user satisfact shown tabl recal anova recognit task success show adapt effect analysi show measur import measur explain varianc user satisfact user satisfact show effect user rate perform adapt highli result appar analysi varianc time perform predictor weight measur perform function suggest recognit task success import measur perform time find consist previou measur task success dialogu qualiti import perform predictor walker find draw question frequent made assumpt field central effici recent demonstr import tradeoff effici perform dimens walker linear regress assum predictor highli correl correl affect delet redund predictor posit correl predictor recognit task relat work area spoken van method adapt initi dialogu system reject user system user system yield initi method potenti method fulli implement empir evalu smith evalu strategi dynam decid confirm user utter dialogu simul result suggest adapt strategi improv system greater initi walker al levin reinforc learn adapt dialogu behavior time system perform improv optim perform singl dialogu empir evalu adapt interfac commerci softwar system similar work analysi varianc demonstr adapt interfac base minim user model improv subject user satisfact rate present empir evalu adapt spoken dialogu system retriev train schedul web result suggest adapt gener outperform novic util adapt greater analysi varianc examin set evalu measur differ function elabor condit adapt lead greater perform user interact adapt user satisfact task success significantli higher result independ initi dialogu strategi task scenario user futur illustr interact initi dialogu strategi adapt adapt version outperform outperform version strongli adapt version outperform version measur deriv perform function show task time predict user satisfact result explain adapt lead greater make predict futur perform predict strategi outperform expect recognit task success remain constant time extend result dimens made step autom adapt process machin learn develop classifi detect dialogu poor speech recognit evalu suggest recognit accuraci perform hope classifi determin featur repres user user model adapt guid empir develop initi adapt algorithm dialogu strategi account base adapt fairli aggress recogn user problem experi report consid extrem initi dialogu strategi configur gener experi dialogu strategi date collect dialogu mix implicit confirm version initi result user satisfact continu exhibit main effect adapt corpu augment dialogu refer empir method artifici intellig mit boston metric evalu dialogu strategi spoken languag system proc aaai spring symposium empir method interpret evalu spoken dialog system telecommun servic proc european conf speech commun technolog novic effect tutori user spoken dialogu system proc intern conf spoken languag stochast model interact learn dialogu strategi proc european conf speech commun technolog evalu strategi spoken dialogu agent proc annual meet associ comput linguist intern conf comput automat detect poor speech recognit dialogu level manuscript submit public ed multivari techniqu human commun research academ york evalu strategi select verifi utter mean spoken natur languag dialog intern journal studi pragmat user model commerci softwar system proc intern conf user van adapt dialogu manag technic report center research interact evalu compet agent strategi voic email agent proc european conf speech commun technolog gener framework evalu spoken dialogu agent proc annual meet associ comput linguist conf european chapter associ comput learn optim dialogu case studi spoken dialogu agent email proc annual meet associ comput linguist intern conf comput
DB/1197 3 qo manag data servic son kang depart comput scienc virginia januari abstract demand data servic recent applic inform servic sophist data span spectrum low level statu typic acquir high level aggreg data core compon inform servic main servic bottleneck current poor support tempor consist data access perform applic research data servic academia commerci product begin emerg area address qo manag scheme data servic transact data consid fundament perform metric data servic admit user transact process time manner data fresh presenc unpredict workload data access pattern present framework realtim data servic unpredict architectur differenti servic base feedback control qo adapt discuss extend approach distribut environ introduct demand inform servic recent applic inform servic sophist data span spectrum low level physic typic acquir high level aggreg data exampl includ data smart space core compon inform servic main servic bottleneck current poor support tempor consist data access perform applic found commerci system militari applic implement realtim system call polyhedra nec norwai compani implement applic similar reason data servic clear system initi attempt solv problem main difficulti meet perform requir current data servic li resourc requir predict priori major issu highli uncertain hard estim user request resourc support part nsf grant inform servic peopl walk smart space applic requir realtim data servic complex interact distribut site add set issu develop data servic involv techniqu manag unpredict handl incomplet react overload unexpect failur express failur achiev perform requir tempor behavior accomplish task present qo manag scheme data servic meet requir transact data consid fundament perform metric applic ultim vision work provid admit transact process time manner requir data fresh satisfi presenc unpredict workload data access pattern data fresh requir conflict deadlin miss ratio user transact give higher prioriti user request fresh achiev favor sensor updat effect balanc user transact sensor updat workload kei provid satisfactori meet deadlin miss ratio data fresh constraint dynam balanc scheme balanc user transact sensor updat workload model sensor updat deriv adapt updat polici model issu perform control presenc incomplet load disturb address automat control appli feedback control theori provid robust unpredict workload feedback control target perform achiev dynam adjust system behavior base error measur feedback loop preliminari perform studi approach achiev perform term transact data compar baselin ad hoc approach rest paper organ section semant data servic perform metric provid section discuss scientif methodolog model data servic unpredict environ section present qo manag scheme deriv section present architectur differenti servic base feedback control qo adapt techniqu section present idea manag tradeoff replic data object distribut environ relat work present section section conclud paper qo metric workload data access pattern support system user read vari set data perform oper base current situat assum deadlin miss fresh violat inevit due unpredict workload data access pattern assum deadlin miss fresh violat incur catastroph result deadlin miss fresh violat consid toler long exce threshold miss ratio data fresh kei metric qo section give overview data discuss perform metric data transact target applic firm data tardi transact transact miss deadlin add abort main memori model main memori increasingli appli data manag onlin network main memori cpu system resourc main data classifi tempor data object outdat due passag pin number tempor data object chang continu reflect real world current temperatur stock price tempor data object timestamp indic latest observ state tempor consist defin valid interv address consist issu real world state reflect tempor data object consid tempor inconsist stale time absolut valid interv absolut valid interv length time tempor data object remain fresh tempor consist tempor data classifi base data deriv data base data object import view environ deriv data object deriv possibl multipl data composit index deriv stock price base data item directli absolut valid interv deriv data object absolut rel valid interv tempor data updat period period updat occur fix aperiod updat predict occur data chang period updat consid period updat common applic model includ type ffl sensor base data object updat period reflect current statu sensor data updat sensor transact transact special design ffl user user transact arriv aperiod user transact write tempor data data user transact perform oper base set data user transact execut time data access pattern support system transact read set data perform oper situat assum user transact deadlin deadlin sensor transact set updat period tardi transact abort schedul appli earliest deadlin algorithm combin adapt updat schedul polici admiss control appli user transact newli arriv user transact admit system request cpu util current util examin aggreg util estim admit transact qo perform metric discuss qo manag perform metric data import note aim provid hard focu infrequ deadlin miss tempor consist violat exce specif limit qo requir type requir typic complex applic inform servic sensor network smart space major perform metric consid qo ffl user transact deadlin miss qo administr target deadlin miss ratio toler specif applic ffl data categor data fresh fresh perceiv fresh fresh ratio fresh data entir tempor data perceiv fresh ratio fresh data access total data access time transact measur current perceiv time transact tardi miss add system note perceiv fresh qo requir approach perceiv fresh manag fresh intern addit perform ffl differenti qo rel time servic class rel time premium basic class enforc explicit distanc servic level class perform differenti proport import servic class interest find rel servic differenti satisfi data fresh transact unpredict workload ffl fresh deriv maintain deriv data object recomput relat base data recomput deriv data compar base data updat includ arithmet logic comput multipl base updat frequent deriv data object recomput base data chang discuss metric section qo adapt techniqu deriv data architectur differenti servic perform metric list suffici perform specif dynam system perform wide transient perform metric overshoot settl adopt control perform metric data servic miss ratio threshold miss ratio time figur definit overshoot settl time data servic ffl overshoot system perform transient system state consid highest miss ratio miss ratio threshold transient state shown figur overshoot import metric high transient miss ratio implic applic robot ffl settl time time transient overshoot decai reach steadi state shown figur settl time repres fast system recov overload metric call reaction time recoveri time similar transient perform metric captur adapt resourc alloc system transient perform metric provid understand highli dynam system averag case metric feedback control qo manag present feedback control approach qo manag data introduc model quantifi util updat specif tempor data object qo adapt techniqu manag data fresh updat polici dynam chang qo adapt techniqu dynam adjust updat polici base current workload system behavior feedback control challeng research problem provid transact data aperiod arriv transact unpredict workload develop methodolog feedback control schedul adapt system advantag feedback control schedul feedback control ad hoc scientif underpin control theori base design methodolog satisfi steadi state transient perform specif work develop framework qo manag data base feedback control theori design systemat design adapt qo manag satisfi perform specif establish analyt method approach contrast exist ad hoc method depend iter outlin framework similar process control engin design control feedback control system achiev desir dynam ffl design specifi desir behavior steadi state transient state perform metric step map exist metric data servic dynam control system ffl design establish dynam model data servic perform control model describ relationship control input perform system differenti equat model import basi analyt design qo control establish dynam system identif method estim system behavior profil experi earlier work system identif web server profil show approach work softwar system ffl base system model perform specif previou design appli exist mathemat techniqu root locu frequenc feedback control theori design feedback control analyt desir transient steadi state behavior data appli feedback control schedul call manag miss ratio cpu presenc unpredict workload shown figur emploi control miss ratio cpu util manag achiev stabil integr control loop intuit combin li fact satur condit control loop mutual util control satur miss ratio control satur system underutil miss ratio control loop gener control signal achiev target util miss ratio base current perform differ target miss ratio measur miss ratio control comput control call request cpu util adjust du achiev target miss ratio target transact util control loop target miss ratio miss ratio control loop measur miss ratio miss ratio control error du util control target util error du measur transact figur miss control select manag qo data meet basic requir miss ratio cpu mix period aperiod workload advantag work workload model procedur adapt tune feedback control outlin appendix detail control model control refer data fresh manag actuat qo design separ feedback control fresh manag fresh pose conflict lead potenti unstabl feedback control system interact qo manag scheme figur du neg violat miss qo term data fresh degrad improv miss ratio current perceiv fresh target degrad bound reach discuss perceiv fresh qo upgrad long du upgrad bound qo stop condit satisfi qo degrad affect fresh sampl lead oscil deadlin miss data fresh violat extrem miss fresh constraint violat incom transact reject fraction run transact termin du posit result chanc extrem case reduc enforc qo adapt condit feedback control schedul admiss control prevent sever overload collect access statist sampl period monitor deadlin miss cpu perceiv fresh sampl comput miss ratio util control signal base current miss ratio util util adjust du ratio control util control smooth transit system state base du current system perform altern action measur miss ratio target du perceiv fresh requir qo adapt requir inform admiss control du admit transact prevent potenti measur miss ratio target miss ratio du current perceiv fresh degrad qo du util save qo degrad repeat du degrad bound reach inform admiss control du current perceiv fresh target du qo upgrad subtract requir util upgrad du repeat du upgrad bound reach inform admiss control du miss ratio violat du perceiv fresh admit incom transact fraction run transact commit abort deadlin du posit result figur qo manag scheme model updat tempor data updat workload high nyse trace updat stream reach updat receiv higher time left finish transact time transact schedul prefer read stale data balanc updat transact workload estim updat util captur relat tempor data updat cost defin updat frequenc tempor data object access frequenc measur data object data object access popular stock updat object produc high benefit quantifi defin updat call access updat ratio data object access updat notion interest featur guidelin decid proper updat polici data object pictori descript figur snapshot tempor data object order data reduc overhead granular data unit measur block data common updat period sort avoid classifi data hot cold randomli select data object class adapt updat polici consid qo manag overhead accuraci qo adapt object horizont line benefit data updat worth access frequent updat call data data horizont line hot data max cold data min figur snapshot sort access updat ratio reason updat hot data aggress manner hot data object potenti multitud transact miss deadlin wait updat updat cold data aggress overload transact miss deadlin wait updat cold cpu util reduc appli lazi updat polici overload cold data updat lazi updat polici current system load approach time access transact polici provid aggress lazi updat polici aggress lazi updat studi perform implic updat receiv higher prioriti user transact updat separ schedul queue updat user updat high prioriti queue schedul user transact updat low prioriti queue transact schedul schedul algorithm fresh cold data low compar hot lazi updat polici appli cold data note notion depend specif access pattern popular model deriv simpli updat frequenc monitor access frequenc greatli simplifi qo model make model robust potenti unpredict data access pattern dynam adapt updat figur pictori approach dynam updat adapt base model figur repres set tempor base data imm set data updat od stand set data updat demand data object updat immedi imm od imm od data updat immedi load larger fraction cold data object updat demand call potenti degrad data fresh updat polici degrad stop reach degrad issu address approach access statist collect comput tempor data object access access counter increment imm imm od imm od initi state moder load state overload state figur updat polici adapt access frequenc larg deviat sampl period smooth potenti larg move averag sampl access closer recent access frequenc consid comput move averag wider horizon consid comput move averag closer updat frequenc sampl period period updat comput access updat ratio handl aperiod updat frequenc monitor smooth similar access frequenc aperiod updat definit data fresh explicit notion valid interv relat aperiod updat tempor data object consid stale arriv appli import question estim cpu util save degrad find differ requir cpu util pure updat adapt updat number save updat due degrad averag cpu util singl updat su save cpu util updat polici degrad du su averag updat su servic measur run time approach introduc updat transact priori fix model updat polici degrad singl data cpu util adjust du du degrad continu data object imm du degrad bound reach horizont line figur updat polici degrad limit degrad rang degrad past degrad bound meaningless number updat reduc hot data object updat access transact suffer unnecessari delai updat updat polici degrad shown figur updat perform immedi updat polici gradual degrad load degrad stop adapt violat perceiv fresh reach degrad bound qo updat polici switch back polici data object ensur time transact access fresh data import issu qo upgrad avoid potenti miss ratio overshoot sampl improv perceiv fresh target perceiv fresh target current perceiv fresh current measur sampl period current target data updat immedi sampl period fresh improv approxim proport number data move od imm kei question estim number data updat immedi detail qo discuss due unpredict workload access qo adapt target perform achiev continu adjust qo level base perform error measur feedback loop balanc updat transact workload target deadlin miss ratio perceiv fresh achiev time interest investig accuraci approxim cpu util perceiv impact feedback control provid quantit measur effect qo manag approach term requir data fresh qo manag approach approach dynam updat period cold data suspect approach incur high updat period tempor valid interv dynam manag data object chang updat period applic inform servic smart control data gener rate sensor effect control volum data network futur work includ detail approach compar perform qo manag scheme deriv data manag manag deriv deriv multipl sensor data possibl chang high import problem base data deriv data treat wai respect fresh mainten cost deriv data recomput includ complex logic arithmet recomput occur frequent accept recomput deriv data base data chang system underutil reduc recomput workload qo manag techniqu adapt workload qo adapt data appli notion forc delai batch deriv data recomput overload reduc number recomput recomput composit index delai period time relat stock price chang multipl time simul studi show perform improv appli forc delai show determin length delai reduc comput deriv data recomput demand disadvantag approach access transact toler long time due demand recomput qo manag scheme extend fresh deriv data gradual degrad forc delai provid altern deriv data fresh qo adapt differenti servic forc delai gradual system overload qo degrad forc delai averag time shorter delai forc delai specif deriv data object longer averag time consecut access sampl period deriv deriv measur smooth access frequenc deriv data object similar defin base data item delai recomput polici demand cold data object data object forc delai simpli hot data object recomput demand similar reason discuss previou section limit forc delai averag soft provid perceiv fresh deriv data high cost deriv data perform improv differenti servic fresh aircraft posit data differenti vicin onlin stock trade server differenti fresh composit index class popular captur popular recomput frequenc deriv data model earlier extend extens straightforward gener model length forc delai deriv data class differenti improv fresh differenti cost deriv data recomput note control model support differenti servic term deriv data fresh achiev extend qo manag model differenti transact class requir transact class treat differ deadlin transact highest class satisfi system overload servic differenti improv system perform effect util system resourc overload differenti servic provid term deadlin miss ratio data fresh constraint transact class import servic differenti demand data servic architectur differenti servic data servic number differenti servic model recent consid transact data servic investig control model control design altern transact differenti servic differenti servic architectur shown figur consist transact feedback control qo updat admiss control transact handler infrastructur consist concurr control fresh manag basic schedul concurr phase lock high prioriti low prioriti transact abort restart conflict select free prioriti qo manag updat schedul adapt updat polici admiss control readi queue updat stream user transact handler cc fm sch block queue monitor termin miss ratio block preempt fresh dispatch mr control mr control util control miss ratio util util threshold manag figur architectur differenti servic fm check fresh access data item absolut valid interv block user transact access data item stale block transfer block queue readi queue updat commit basic user transact schedul queue shown figur servic class fix prioriti appli multilevel readi queue transact low prioriti queue schedul readi transact higher prioriti low prioriti transact preempt arriv high prioriti transact transact schedul manner provid data fresh updat schedul appli fix prioriti servic provid basic support servic differenti applic insuffici provid miss ratio perceiv fresh presenc unpredict pattern feedback control schedul extend differenti miss ratio manner potenti unpredict workload qo manag enforc control signal comput feedback control loop adjust cpu util base current system behavior observ monitor dynam adjust updat workload current miss ratio perceiv fresh adapt updat polici data updat demand updat immedi util threshold dynam adjust current system behavior cpu util avoid miss ratio overshoot qo manag dynam adapt updat polici enforc cpu util adjust updat schedul decid schedul drop incom updat base current updat polici admiss incom transact control avoid potenti overload underutil kei issu provid class servic web type perform multipl class transact multipl perform metric requir ad hoc approach call effort provid provid servic gener high class client provid extent differ class type perform stronger effort hybrid absolut set perform provid class workload arbitrarili high data meet absolut class sever overload rel fix ratio perform class enforc system support desir perform level class model differ flexibl absolut requir achiev absolut perform level class depend semant applic natur overload model perform desir rel model sever overload high class transact unaccept perform requir differenti class normal oper rel model hybrid model desir switch absolut rel depend requir differenti system workload hybrid support rel differenti class perform class accept rang perform high class absolut model enforc requir perform possibl cost sacrif perform low class plan implement model differenti servic architectur interest issu remain address differenti servic ffl complex profil system feedback control transact schedul servic ffl control interact multipl control loop introduc unexpect behavior surg overshoot longer settl time transient ffl effect differenti servic architectur compar altern architectur replic data distribut environ number problem address central environ manag distribut system issu critic improv perform data servic issu distribut environ focu data replic data replic improv perform avail distribut applic perform term transact improv replic copi site frequent access avail improv site store independ failur mode benefit cost overhead updat transact commit site replic copi commit enforc mutual consist call synchron perform problem practic commerci distribut system oracl support synchron replic lazi updat replic data object defer lazi transact commit wait replic copi relax mutual consist properti lazi data fresh kei concern inform replic proxi web cach popular web cach proxi address scalabl problem provid desir perform static introduc problem data fresh dynam content number web page dynam content continu chang provid fresh data import problem maintain accept fresh lazi replic extend qo manag scheme replic tempor data primari copi capit updat sensor transact call site primari copi data object master node data copi call secondari copi site secondari copi call slave node set replic consist primari copi secondari copi refer replic data applic start run site tempor data object secondari copi creat initi current primari copi secondari copi updat push pull pull model reduc overhead master node flexibl slave node chang access pattern slave node inform master node make chang slave node pull primari copi master node local workload data access statist period pull dynam adapt qo manag node current statu inform util cold data pull demand discuss previou section assum initi secondari copi updat rate primari copi slave node track access pattern secondari copi access updat ratio discuss section slave node comput candid secondari copi delai updat overload occur adjust cpu util wai switch updat polici updat updat primari copi delai updat secondari copi possibl primari copi secondari copi give prioriti whichev copi bring higher access demand access high fresh updat immedi pull primari copi initi rate provid qo replic data distribut issu deal updat schedul problem secondari copi refresh separ updat schedul schedul portion cpu util alloc refresh secondari copi node primari object updat schedul satisfi qo achiev maximum perceiv fresh replic data cost refresh secondari copi gener replic updat schedul frequenc access cost determin order avoid unnecessari refresh wast cpu util benefit applic simpl method master node send special repli slave node pull current slave node receiv discard cpu util wast idea extend introduc notion comput replic toler level chang slave node receiv proper depend semant data applic access custom depend copi applic slave node applic applic slave node maintain creat depend applic data servic alert rule includ except handl master node replic data push data system reli pull model situat smart temperatur room pull frequent system transient overload alert trigger master node temperatur exce threshold possibl master node push slave node secondari copi relat work previou research work shown approach improv system perform manner abund qo work scarc system prioriti adapt queri resourc schedul provid differenti queri process environ observ perform queri vari significantli depend queri time differenti memori manag schedul queri read operand relat produc result immedi memori temporari file save intermedi queri process slow queri deadlin miss ratio differenti class perform easili fluctuat workload data fresh issu consid updat schedul polici context web server perform web server improv cach dynam gener data web server continu updat view updat schedul polici significantli improv data fresh compar fifo schedul discuss complementari problem view select problem materi issu time data fresh consid work provid miss ratio data fresh stanford inform processor address problem balanc fresh transact data maintain fresh correctli reflect statu transact process time manner studi fresh schedul algorithm introduc schedul updat perform compar similar problem studi deriv data ahm al approach maintain tempor consist deriv data updat deriv data object explicitli time trigger system time constraint met simul rel perform improv shown compar forc delai scheme strip approach consid dynam adapt updat polici perform provid correct answer queri trade enhanc queri call approxim provid approxim answer depend avail data time comput techniqu approach appli approxim mileston accuraci intermedi result monoton comput progress correct answer queri monoton queri process progress relat system call produc approxim answer queri deadlin approxim answer provid process segment correct answer improv data process begin data determin segment process finish time replic consist trade shorter time epsilon serializ queri process concurr updat deviat answer queri similar approach call quasi serializ adapt secur manag secur level temporarili degrad enhanc perform scheme lack systemat qo manag architectur provid miss ratio data fresh algorithm updat schedul recent goal achiev maximum weight sum fresh probabl view demonstr import updat schedul problem server log trace trade quot york stock exchang defin rank function view ratio frequenc access view cost requir refresh view updat schedul algorithm consid popular weight depend graph view relat determin updat biggest impact schedul approach work metric feedback control base qo manag open loop approach feedback control wide appli qo manag schedul knowledg consid qo manag issu data fresh constraint demand inform servic rise applic core compon inform servic bottleneck upcom inform era due low predict present approach qo manag meet fundament requir data deadlin miss ratio data fresh presenc unpredict workload data access pattern adopt qo manag approach data sensor transact user servic request dynam balanc potenti conflict miss ratio fresh requir time model deriv measur updat util qo manag scheme develop base model combin feedback control schedul admiss qo manag approach provid miss ratio perceiv fresh approach fail preliminari perform studi approach achiev perform compar ad hoc approach discuss issu appli method deriv differenti replic data distribut environ refer abbott schedul perform evalu acm transact shin adapt content deliveri web server qo workshop qualiti june shin qo provis web multimedia servic system decemb kao appli updat stream soft system acm support effici maintain deriv data ahm trigger updat tempor consist system wei storag main memori perform critic applic acm sigmod industri storag integr qualiti web server design intern world wide web friedrich web server support tire servic ieee septemb quantit assur forward servic technic report comput scienc depart proport differenti delai differenti packet schedul aug du elmagarmid quasi correct criterion global concurr control intern conf larg data heidemann differenti servic web servic world wide web march feedback control dynam system son task schedul overload manag intern confer comput system decemb liu qo model manag architectur ieee workshop middlewar distribut system decemb middlewar qo resourc manag ieee workshop distribut system decemb le provid low delai servic effort ieee estrin direct scalabl robust commun paradigm sensor network int confer mobil comput network august approach fresh technic report comput scienc depart oct roussopoulo adapt materi fourth intern workshop web held conjunct acm roussopoulo updat propag strategi improv qualiti data web intern confer larg data base septemb liu util partial comput system system decemb liu schedul algorithm multiprogram hard environ journal zhao algorithm schedul comput ieee son feedback control approach rel delai web server ieee technolog applic son feedback control design methodolog servic delai web server technic report comput scienc depart perform specif metric adapt system system novemb son feedback control model algorithm journal special issu approach differenti cach approach intern confer distribut comput april ozsoyoglu hou research queri process workshop oper system simon updat propag strategi improv fresh lazi master replic vldb livni multiclass queri schedul system ieee transact knowledg data august phillip nagl digit control system analysi design prentic pu replica control distribut asynchron approach acm sigmod intern confer manag ramamritham intern journal distribut parallel jha adapt resourc alloc complex applic ieee system dec softwar white paper world wide hansson adapt secur manag transact euromicro confer page june son feedback control schedul distribut system system decemb tao case feedback control schedul euromicro confer june proport alloc schedul symposium oper system design queri processor produc monoton improv approxim answer phd illinoi appendix feedback control tune tune control perform control system profil worst case highest miss ratio worst case consid provid miss ratio profil worst case turn admiss control qo manag updat appli immedi prefer manner user transact user transact deadlin miss ratio sharpli load averag deadlin miss ratio util measur load execut time estim error set averag actual execut time time averag estim execut time updat workload design total cpu util load uniform access pattern assum data access simul run perform confid interv deriv bar figur load miss util averag miss ratio util averag wast util figur system profil result miss ratio gm maxf miss ratio unit load deriv tune control profil result shown figur miss ratio gain approxim load set sampl period feedback control sampl period miss ratio gain gm root locu method matlab tune control support steadi state error close loop pole feedback control system close loop pole insid unit circl tune feedback control system provid transient ffl theoret overshoot worst case highest deadlin miss unit step input target deadlin miss ratio theoret miss ratio overshoot ffl root locu theoret settl time time system transient sampl previou miss ratio overshoot decai unit step input care reader notic measur averag util higher load appli system satur conflict updat user transact load transact access tempor data updat updat transact potenti figur observ wast util system satur system tardi transact abort access tempor wast util affect total util miss ratio observ motiv necess dynam balanc updat user transact current system statu
ML/1198 6 simul evolut pattern recognit evolv hardwar tool build million neuron artifici brain hugo de gari michael donald coolei st michel europ tel fax suit boulder usa comput scienc utah state usa tel fax abstract paper present simul result evolut visual pattern recogn implement shortli real fpga base piec evolv hardwar implement genet algorithm evolv cellular automata base neural network circuit approxim complet run circuit growth perform evalu evolv download larg ram interconnect artifici brain architectur artifici brain million updat cbm rate billion ca cell speed enabl real time control robot birth research field call artifici built starlab control behavior life size robot call robot pattern recogn visual section artifici brain paper present simul result evolv gener properti recogn introduct paper present simul result evolut visual pattern recogn implement shortli real fpga base piec hardwar evolv cellular automata base neural network circuit modul electron modul modul assembl larg ram space artifici brain architectur ram updat cbm fast billion ca cell real time control robot cbm built deliv author previou lab novemb present lab april cbm essenti tool brain time write run year author web site journal articl confer paper project download basic aim project state build artifici brain billion artifici neuron year actual figur maximum million billion figur wait construct gener machin readi year cbm make practic creation artifici defin assemblag ten thousand higher evolv neural net modul defin artifici brain architectur artifici brain consist larg ram memori individu ca modul download interconnect architectur human ba ca cell ram updat cbm fast real time control robot neural net model fit evolv electron signal state neural net chosen bit binari label model collect bit neural signal present paper implement cbm paper report simul result evolv generaliz visual pattern detector modul base codi model ii input pattern recognit modul section describ evolut modul recogn static analog input pattern approach equal valid dynam pattern detect topic futur earlier paper convert back real time depend format codi modul cube cellular automata cell neural net grow evolv electron implement machin maximum input point maximum output output point evolv modul modul evolv input output point distribut evenli face cube ca due signal opposit connect input face problem confront map greyscal imag pixel input face cube map fairli straightforward shown tabl symbol form xi repres block pixel rectangl map face cube tabl map imag input face codi cube bought plastic plane digit photo side angl total photo imag input evolut train aim evolv modul give high output singl low valu plane imag imag test evolv modul capabl give high output signal low output signal imag train set digit imag transfer comput master convert grei scale pixel imag process softwar pixel grei scale imag initi convert analog input valu rang black pixel white pixel input pixel convert bit stream analog algorithm socal output spike train convert back time vari analog signal analog algorithm socal convolut target output tank set plane car fit function sum absolut differ target actual output analog clock tick tick fig show origin imag car photo angl pixel greyscal imag input evolv modul shown fig plane tank imag shown reason space paper fig origin test orient fig pixel test orient remain figur show elit modul evolv train set gener test set fig show output face imag train set fig show output test input imag angl star line line solid line car happi evolv result feel fig show achiev fig evolv output face fig gener output refer hugo de felix michael atr billion neuron artifici brain project year progress report artifici life robot hugo de michael felix michael hough build artifici brain fpga base machin appli mathemat comput special issu artifici life artifici brain comput felix hugo de michael simplifi cellular automata base neuron model artifici evolut octob michael hugo de felix hitoshi cbm hardwar tool evolv neural net modul fraction run million neuron artifici brain real time john marco david max hitoshi rick genet program annual juli hugo de michael
AI/1199 2 research tool hardwar evolut paul centr comput neurosci school cognit comput brighton uk abstract studi hardwar evolut reli heavili commerci fpga devic configur real time produc physic electron circuit devic present drawback research desir studi fundament principl underli hardwar control architectur type basic configur element analysi evolv circuit difficult extern pin fpga access test equip discuss current issu hardwar paper present test platform design specif tackl result exemplifi result includ circuit evolv transistor level introduct recent evolutionari algorithm appli design electron circuitri result attain comput simul physic hardwar possibl larg due advent field programm gate arrai chip consist small circuit element configur instantan produc huge varieti circuit configur fpga circuit evolv basic ea genet algorithm tempt fpga ideal medium research hardwar evolut reason case choic present type basic configur element emploi commerci vast major digit configur logic block restrict analogu function requir evolut capabl produc analogu behaviour digit circuit suffer number undesir characterist depend temperatur lack portabl analogu fpga oper amplifi basic element term fit evalu perform physic simul start basic element ih depend task extrem higher level combin compon includ passiv resistor capacitor interconnect highwai circuit element fpga design modular circuit design methodolog mind evolut exploit system interconnect architectur arbitrari stage system final circuit evolv fpga produc desir behaviour extrem difficult access individu circuit element test comput simul practic reproduc physic properti silicon exploit paper present configur testb user investig ih type basic varieti interconnect architectur element access test equip compon facilit analysi evolv circuit motiv research improv evolutionari electron engin provid tool aid explor fundament principl underli ih briefli explor fundament benefit field difficulti current approach examin testb oper place hardwar evolut result show emploi aid research princip difficulti hardwar design evolutionari techniqu ih design typic comput run fpga configur devic individu genotyp instanti physic electron circuit fit evalu measur evolv circuit behav real time law semiconductor physic stage process concern topolog detail circuit behaviour mean evolut free explor configur behaviour repertoir fpga constrain evolut work small subset circuit simul human design exploit richer dynam behaviour complex aspect semiconductor evolut produc circuit scope convent design methodolog offer benefit electron engin evolv circuit small corner discrimin squar wave input thompson show evolut capabl produc function absenc compon deem convent design circuit access rc network task implic vlsi compon resistor difficult implement small size robot control evolv move centr arena robot equip ultrason transduc propel wheel power dc hardwar facil timer deni latch evolut part result circuit mixtur control achiev requir behaviour ram complex behaviour achiev smaller compon count expect convent approach rel insensit type ea mutat exploit produc system inher robust type fault area space manufactur devic recent year altern method radiat toler sought research potenti benefit circuit produc evolut reveal electron properti exploit convent design analysi circuit lead properti creat innov design convent manner human requir evolutionari approach produc behaviour achiev knowledg open field hardwar design detail discuss target domain current research reader refer difficulti issu evolutionari approach benefit unconstrain ih number difficulti uncertain issu resolut import factor progress engin tool principl issu analysi design fpga digit function global clock factor unequ gate propag time affect oper clock digit element treat analogu devic paramet consid uniform exploit analogu aspect digit devic scope behaviour attain affect portabl circuit circuit evolv fpga fail work instanti batch analogu paramet temperatur chip circuit oper temperatur rang small compar expect commerci devic effect observ evolv number exist tackl commonli level critic evolutionari research success achiev small genotyp case hardwar small circuit larg genotyp correspond larg search perceiv search space comput time requir evolv behaviour case genotyp length effect shorten adjust basic element chang map adjust physic architectur interconnect basic element case goal arriv search space rich note smaller search space lead comput recent research neutral network pathwai search space popul travel singl chang fit suggest good solut found faster larg search space highli percol neutral network smaller research area appli ih carri testb subject futur public scalabl issu depend genotyp defin evalu procedur fit function fortun aspect appli ea field good deal research carri evolv circuit numer feedback path make analysi difficult viewpoint analysi confin circuit extern whilst acknowledg intern circuit box determin tone discrimin work due difficulti measur inabl current softwar model simul time spent analysi circuit time wast result specul gain electron engin properti exploit scale evolv fpga circuit capabl exploit medium molecular level found biolog result depend question import establish fundament differ silicon organ materi evolutionari media evolv testb ih evolv conceiv address issu present previou build framework fpga ideal suit ih fig simplifi essenti diagon matrix analogu connect desir basic element evolut diagram show transistor oper compon type capacitor logic function exploit line switch connect power line requir compon matrix design provid minimum number switch combin interconnect basic element configur total approxim give search space circuit circuit configur combin result wire effect connect wire softwar interfac switch arrang interconnect architectur local global bu system commonli investig board subdivid matric map individu set compon impact manufactur toler assess incorpor addit connector program achiev interfac card plug host pc isa bu switch configur direct write pc intern mean genotyp instanti hardwar short time addit power signal line programm switch arrai basic circuit element fig simplifi evolv import function point circuit access measur evolut exploit compon unexpect simpler deduc properti case fpga note analogu switch semiconductor integr circuit switch behav properti exploit make analysi difficult circumst circuit configur switch determin subtl properti switch exploit circuit configur lead power line short switch handl small current current switch prevent power line rout maximum switch current long power suppli exce volt problem end devic basic element destroi smaller current incorpor addit resistor result illustr capabl highlight potenti tool investig import issu current experi involv evolut gate present bipolar transistor evolutionari build block whilst fairli trivial gate difficult test digit evolut easili tend local optimum achiev requir behaviour experi circuit evolv transistor level gener ga elit evalu seri test input high appli sequenti random order test output voltag measur time random delai sum fit score equat signifi test input sh set low high test input sum output voltag circuit test number power suppli set rang fit expect result shown typic obtain run gate experi involv seed initi popul circuit determin evolut improv exist prototyp initi popul individu creat randomli genotyp mutat rate averag mutat bit genotyp bit repres singl switch singl individu initi random popul replac gate circuit shown fig circuit conform function output input slightli higher voltag differ small practic electron swing great cross digit logic threshold experi carri small portion transistor gener elit fit score fig show individu essenc circuit seed evolut accomplish perform exploit resist programm effect resist power emitt ground achiev evolut exploit fundament law resistor seri combin place parallel refer fig portion experi path extern connect transistor evolv circuit connect output dedic remain path connect achiev parallel resist import implic interconnect architectur evolut make good parallel resist restrict interconnect system input output input output fig circuit instanti evolv black dot repres close switch origin hand seed fittest individu gener input output input output input output fig circuit diagram prototyp gate box repres switch fittest individu gener circuit replac switch resistor evolv gate scratch experi mutat rate portion start random evolut continu gener eventu gener circuit fit consist greater gener requir produc fit score significantli achiev experi fig show circuit behaviour observ clear glanc evolut chosen make impli circuit work fact path achiev input oper small compar evid evolut exploit manner scope circuit work experi successfulli run monitor case eventu fit higher achiev design local optimum constrain evolut explor limit region search space input output ro input output fig gate evolv scratch small portion full altern connect architectur altern interconnect architectur gener excess stabl prototyp solut small portion search space larg circuit vast major circuit give constant output short pin activ compon final experi investig altern architectur intend prevent limit number switch row set experi complement ten transistor wire matrix explor experi give indic evolut exploit resourc open ten transistor consid excess amount gate fig show fittest evolv circuit prototyp gate evolv gener mutat rate mutat bit circuit ten result circuit failur aspect evolv circuit run counter necess transistor circuit perform previou exhibit appar toler mutat fault expect circuit transistor mutat fewer effect circuit evolv topolog relat phenomenon suggest experi perform popul individu gener produc circuit experi consist remov transistor individu matter transistor individu popul score higher maximum fit popul toler elit individu circuit circuit activ role individu popul research effect result report futur fault toler true evolv circuit due encod search space characterist implic portabl evolv circuit made portabl manufactur process implement singl individu experi section show evolv investig import issu current ih includ genotyp basic evolv topolog map section due arrai switch combin pin connect map analog architectur configur analysi map lead pictur sort architectur fpga ideal suit evolut section includ suggest account phenomena observ note intend experi present primarili illustr capabl evolv research tool research continu reveal posit neg characterist share gener class evolv circuit benefit princip characterist difficult due wai compon exploit numer feedback loop whilst analysi larg complex evolv circuit attempt conveni method method approach field progress credibl engin tool research albeit circuit continu plai major role develop ih analysi circuit contribut understand properti evolut research fund british telecommun phil thompson comment numer draft paper refer web evolutionari dynam fit landscap neutral msc sussex synthesi evolutionari algorithm comput engin commun network lab swiss feder institut technolog nr design implement field programm analogu arrai technic acm reconfigur fault school sussex de grow artifici brain million neural net modul insid cell cellular automaton machin proc intern symposium micro machin comput scienc artifici real al anim animat proc int confer simul adapt mit press test platform research hardwar evolut technic report sussex field programm gate arrai circuit lectur note comput evolv vol evolv physic intern confer evolv system vol springer lnc evolv electron robot control exploit hardwar resourc al advanc artifici proc eur conf artifici life lnai evolv fault toler system proc st int conf genet algorithm engin innov applic iee conf public temperatur natur artifici system fourth european confer artifici mit press speed limit evolut theoret biologi evolv system hardwar survei intern confer evolv biologi hardwar japan
ML/1200 6 intern confer engin design ic august genet algorithm base system conceptu engin design ian conceptu genet scenario introduct paper integr method prefer scenario genet algorithm perform goal make system work design conceptu design interact design knowledg import accuraci modul constraint handl modul fuzzi rule handl modul design figur schema preliminari design system core comput human system present figur consist genet algorithm base modul dynam constraint handl modul fuzzi prefer handl modul object import design part fourth appli british aerospac conceptu design problem moment variabl output repres small part bae problem fuzzi natur initi design effici explor variant design assess interest evolutionari comput support design explor whilst suggest direct interact design import goal assist design preliminari phase design process criteria criteria design bae techniqu gener easili integr conceptu design problem genet algorithm modul genet algorithm base genet algorithm genet oper suitabl real valu arithmet exponenti mutat genet algorithm gener scalar function adapt techniqu techniqu includ weight sum base method lexicograph sort base method pareto front base method distribut vega base method refin result conflict tabl result averag run averag standard deviat present result discuss tabl result method method par lex wei vega bear mind preliminari design phase accuraci result digit decim import capabl search region simultan prefer fuzzi rule address problem qualit versu quantit rel import object framework easier design give qualit mark object import object set weight object method fuzzi prefer induc prefer order transform introduc predic relat intend mean relat intend mean equal import import import dont dont care import import complementari relat build relationship matrix transform transform concept induc order relat fr fr figur influenc prefer set bae function integr prefer genet algorithm weight sum base modifi pareto front method comput object weight detail figur show result obtain bae function prefer dynam constraint scenario modul system figur handl dynam constraint scenario scenario set addit constraint object design add delet interact scenario repres conjunct relat fairli rich mathemat languag concept prolog resolut base autom theorem prove scenario function object addit paramet return percentag relat satisfi valu input concept scenario design condit part mathemat model design system concentr region design space addit advantag scenario dynam interpret recompil system chang program mathemat model modifi delet integr scenario design system assign level import scenario calcul set scenario weight prefer scenario import calcul distribut island base ga island consid scenario approach enabl emploi softwar agent monitor level fulfil scenario signal back possibl imposs satisfi scenario case dont worri meet potenti contradictori scenario dont problem import order scenario paper present comput base system preliminari engin design discuss main part part genet algorithm base fuzzi prefer part translat design linguist statement number deal import object constraint handl modul handl dynam addit constraint design modifi delet interact refin model direct search region appli method bae result present futur work system includ stronger interact commun design refin prefer model refer support european congress intellig techniqu soft comput septemb pp design european congress intellig techniqu soft comput septemb pp prefer banzhaf genet evolutionari comput morgan preliminari adapt comput design integr evolutionari adapt comput technolog product design april pp prefer model support kluwer academ theorem logic model genet algorithm continu paramet evolutionari pp object optim vector evalu genet algorithm intern confer genet erlbaum pp phone fax email
DB/1201 3 tempo tempor model seamlessli extend odmg tempo pour base de compat odmg scholl grenobl bp st martin abstract paper present set model languag intend seamlessli extend odmg object standard tempor function model exploit technolog meet neglect design relat legaci code migrat independ tempo fulli formal syntact semant level implement top dbm suitabl regard applic requir valid concret case studi context tempor tempor data tempor queri time upward odmg resum ce document present tempo ensembl de de langag pour le standard pour base de objet par de le exploit le de la objet pour nombr de li la migrat de la tempo formali au au du objet de son adequ par rapport aux de applic sur de de ca tire de diver context base de de langag de du base de odmg introduct modern dbm provid elementari tempor datatyp timestamp entiti associ state repres snapshot model world defin updat observ data evolut histori manag applic data program complex tempor system aim overcom defici past research tempor prolif tempor extens data model queri languag relat framework work led consensu tempor queri languag iso ansi standard result significantli lack framework earli attempt defin tempor extens data model fail wide essenti due absenc standard underli data model odmg start adopt major object dbm idea tempor extend extens report argu lack import ffl migrat ensur seamless transit applic run top system tempor extens featur consid fundament design ffl separ abstract view concept construct model languag design exist tempor data model adopt encod tempor relat attribut histori base interv defin oper basi lead undesir tension queri express intend semant idea defin oper independ ffl formal semant point tempor oo data model queri languag formal introduc formal specif object model level address issu relat queri languag argu formal model languag avoid ambigu gener rich complex tempor terminolog serv basi effici implement ffl enabl research experi tempor dbm implement concern relat framework major goal work tempo extens model persist object defin tempor framework integr featur submit tempor commun contribut consensu tempor extens odmg object model languag object tempo tempor data model schema definit queri languag main concept studi relat work formal function framework integr featur seamlessli extens model set updat oper tempor object languag describ pattern histori paper structur section defin requir relat applic migrat show exist tempor extens odmg fail fulfil section describ tempo data schema definit queri languag section present prototyp develop valid feasibl applic model implement tempo section end overview discuss futur research direct model requir relat work present major requir guid design tempo requir divid deal migrat data applic program tempor deal abstract model queri histori migrat requir fact tempor data model languag extens common design choic result model integr exist applic built top system rapidli benefit ad technolog smooth migrat exist data applic program tempor system achiev fulfil elementari compat requir neglect tempor recent notion seamless integr time upward compat consid interest migrat requir pair data model defin definit data model set instanc set legal queri statement set legal updat statement evalu function updat statement queri statement instanc db yield yield instanc data structur instanc abstract appli updat evalu map instanc queri evalu yield instanc data equal defin instanc data structur success introduc level migrat upward compat tempor transit support definit provid adapt notion upward compat tempor upward compat introduc definit data model upward compat data model upward compat db instant dn dn notic updat instant issu tempor data oper depend instant issu discuss definit appli data model extens set set queri includ submit oql access class extent object properti applic program updat oper includ object creation updat object properti illustr upward odmg compliant dbm manag document user librari store inform document loan upward compat state odmg dbm replac tempor extens tempor cartridg data applic program access data left intact impli set instanc recogn extens recogn origin access updat statement ident semant origin dbm tempor extens notic notion tempor support consid legaci applic run tempor administr decid histori loan legaci applic program continu oper worst perceiv properti fulfil requir offer view applic lead notion data model definit data data model data model data model snapshot data model tempor data upward compat migrat requir introduc answer problem scenario aim ensur continu legaci code migrat snapshot tempor schema definit transit function partial total transform snapshot instanc tempor attach tempor support attribut relationship tempor data model mt offer tempor transit db instant dn dn upward compat achiev simpli ad concept construct model modifi exist tempor transit support difficult achiev show exist tempor extens includ satisfi requir tempor upward compat shown remark hold exist tempor tau tempor object model document class properti loan defin context tempor support attach subsequ access retriev current document loan properti snapshot version histori exhibit problem achiev tempor transit introduc burden tempor applic refer tempor properti queri prefix keyword transact bitempor lead cumbersom queri express similar remark appli bind approach duplic symbol access data ad tempor tempor enhanc properti properti repres tempor librari mean ad tempor support properti loan tempor properti modifi tempor properti ad tempor loan advoc tempor support ad compon schema yield schema applic program divid view data schema view schema problem tempor transit support case schema techniqu develop context appli reason adopt approach state properti modifi add tempor tempor applic perceiv properti tempor independ requir tempor associ tempor associ piec data locat fact tempor associ classifi depend associ fact instant interv associ state fact true stock price entail fact true instant statement stock year associ state fact true point observ salari januari tempor data model classifi depend manag interv tempor associ instanc state tupl belong tempor relat interv mean tupl belong relat instant enhanc adt model interv consid semant tupl timestamp interv tupl belong relat instant data model hybrid provid function transform associ distinguish associ worth note tempor data model pure associ preval tempor applic tempo design data expect extend deal associ associ tempor data relat tempor associ group tempor relat relat object attribut histori tempor relat histori repres wai associ instant timestamp tupl tempor relat logic level altern group tupl singl timestamp tempor element interv common approach exist data model oper tempor data defin render formal addit defin result oper semant describ result encod remark appli queri lead undesir tension queri express intend semant illustr queri retriev depart ed move account express select distinct valid valid clear differ level abstract queri express natur languag natur languag refer maxim interv ed account formul typic exampl refer notion express mismatch reflect lack declar oper histori reason success time provid tempor queri reli oper express kind tempor queri advoc reli fix tempor data defin semant tempor queri undesir featur tempor data violat basic principl encapsul specif independ oper histori cover fundament tempor reason granular approach adopt work similar adopt set histori queri express queri natur involv constant salari interv year tempor queri languag provid oper set histori base interv set instant appli model tempor valu tempor data collect instant model set disjoint term tempor adequ logic level introduc gap model concept data model construct summar state requir data model tempor data model independ defin oper tempor valu associ independ oper account kind tempor reli tempor data queri express tempor datatyp section introduc basic concept model tempor valu associ concept structur hierarchi abstract datatyp formal tional framework claim datatyp gener integr exist data odmg type hierarchi time model time unit adopt linear bound time model time structur mean time unit time unit partit time line set convex element partit atom granul point approxim granul time unit defin time observ granul time unit number natur order integ defin notion success time distanc defin notion durat map establish granul time unit set consecut granul unit finer oe coarser time unit month finer unit year coarser unit year integ amount month month integ amount dai finer relat partial order pair unit compar unit month week assum uniqu finest unit usual call chronon pair time unit oe function expand granul coarser unit interv granul finer ffl approxim granul granul ff shown figur unit oe regular interv granul gener ffl cardin approxim figur unit approxim unit system sequenc compar unit order finer detail unit system express tempor valu finest unit unit system defin tempor valu express system basic tempor type durat number granul time unit measur amount time defin unit valu type durat pair made integ time unit durat sign differenti forward backward motion time instant rel durat rel durat express unit system month qualifi rel point fact finest unit unit system depend instant durat unit mutual regular year case map absolut durat instant approxim connect region time line granul call observ unit instant point respect observ unit interv respect finer instant view pair integ unlik semant defin respect origin time line oper defin instant predic relat chronolog addit subtract distanc function addit instant unit analyz case oper deal argument input output instant durat manag extens set format format defin map regular languag set word recogn regular set tempor valu granular concret format regular express describ syntax recogn unit system determin interpret numer valu granul refer permut put granul refer canon order order granul refer european date format american mean europ detail descript notion reader refer tempor sequenc abstract tempor sequenc defin chronolog order sequenc instant observ granular instant sequenc canon notion model set instant tion tempor distinguish sequenc instant fact tempor coalesc sequenc interv distinguish kind tempor characterist defin specif oper period sequenc instant interv fact case interv period sequenc instant period detail descript type oper found oper mention set oper type constructor instant set period oper cast comparison oper interv defin basi allen interv relat oper defin independ fulfil independ requir state section figur present uml class diagram model type relationship durat durat instant durat unit instant instant instant absolut absolut durat interv boolean boolean interv figur tempor type histor model abstract histori defin function finit set instant set valu type domain rang histori call tempor structur domain formal describ type oper relat histori descript function oper histori higherord oper function paramet simpl descript accur notat stand type function domain codomain ftg denot type set sequenc design type tupl compon type ti tupl compon label notat ln denot instanti type type denot type histori structur valu type denot tupl compon vi ni instant tempor denot observ unit specif introduc histori adt elementari selector type instant tempor domain unit instant structur instant structur domain histori repres mean collect timestamp term chronicl queri specif oper defin histori adt repres histori form histori repres kind chronolog order sequenc sequenc term chronolog coalesc sequenc kind sequenc call tempor set distinct valu timestamp disjoint tempor hf term oper provid switch histori paramet call oper paramet call oper xs xs meet xs xs xs ti sd paramet call ds sd ds algebra oper histori algebra oper histori classifi oper structur result histori instant depend structur argument histori figur notic classif close composit oper yield oper true oper instant depend arbitrari subset argument structur result instant instant depend structur structur result oper histori select join group success time aggreg extern sum avg intern map figur taxonomi algebra oper histori semant oper formal mean express defin graph result histori set pair term oper intra point oper restrict tempor domain histori instant condit true sg oper map appli function structur histori tempor join combin histori histori tempor distinguish tempor join outer depend result histori tempor domain intersect union tempor domain argument tempor join histori histori structur valu pair obtain combin valu valu attach outer tempor join similar tempor attach structur valu form instant argument histori defin nil denot neutral element structur domain type nil algebra oper intersect differ straightforwardli extend histori appli result set describ graph histori oper defin thereof process applic union oper histori valu context yield asymmetr union oper defin vi vi vi oper oper histori includ oper deal success time cumul aggreg oper histori instant tempor domain aggreg structur valu attach instant cumul sum appli histori denot daili product product month dai total amount item product produc begin month dai aggreg oper min durat straightforwardli express cumul aggreg oper group oper group group tempor group oper granular oe divid group unit result histori granular histori granular instant tempor restrict interv figur formal unit oe group yield convex durat result histori associ instant restrict interv provid interv complet includ tempor domain terminolog durat work lead work trail oper map instant observ unit interv finer unit correspond function ffl defin granul section durat posit neg regular oper express move window averag sale period histori daili sale figur tempor group reason success valu histori tempo fact algebra version oper tempor logic yield start instant satisfi predic empti histori instant exist restrict instant instant satisfi instant exist histori predic equal union similar remark appli vi vi vi vi vi vi vi vi vi vi vi vi queri success time intens deal sequenc structur histori tempo offer languag account provid power tool express kind queri similar languag main origin pattern descript languag provid tempo respect li regular express repetit time disjunct regular express oper defin declar semant languag framework effici implement tempor extens odmg object model extend basic abstract odmg object model properti integr tempor track evolut show extens fulfil requir formul section tempor support properti level odmg properti defin attribut path relat attach class properti class includ salari depart instanc properti attach properti instanc object properti class paragraph success tempor support attach effect attach support valu properti tempor properti properti case success valu recent properti granular evolut observ determin specif characterist observ unit type attach properti case fleet type defin domain valu instanc properti tempor model structur valu instanc properti instant matter odmg term properti instanc replac object properti term highlight fact properti instanc state tempor dimens tempor properti determin semant tempor associ model depend fact timestamp respect model realiti respect evolut properti refer properti merg concept oper defin model bitempor properti tabl characterist tempor properti notion semant assumpt pad referenc explain paragraph characterist valu observ unit minut dai month structur type real instant person tempor dimens valid time transact time semant assumpt discret linear pad nil tabl characterist tempor properti instanc tempor properti tempor domain tempor properti instanc model set instant properti observ object tempor domain evolv dynam system clock tempor domain properti instanc arbitrari tempor sequenc histori tempor properti instanc histori reflect valu properti instanc instant observ tempor domain histori equal tempor domain properti instanc structur defin deriv input valu semant assumpt tempor properti instanc effect input timestamp valu attach effect histori necessarili equal properti instanc differ call potenti histori part histori calcul semant instanc regular properti empti potenti histori deposit bank account semant assumpt refer tempor domain properti instanc effect histori effect tempor effect domain short case tempor distinguish semant assumpt depend intend calcul mode potenti histori figur structur potenti histori equal neutral structur type nil case product product period time product defin tempor advanc dai input due effect histori defin dai pad attach discret overrid neutral element structur type structur potenti histori facil similar attach valu properti odmg odl structur valu instant effect tempor domain properti instanc model discret pad attach properti set structur instanc instant semant assumpt provid smallest instant effect domain equal smallest instant tempor linearli interpol kind interpol appli properti instant effect structur vari linearli pad attach kind properti properti instanc histori tempor dimens observ unit valid time tempor properti characterist structur type real properti instanc characterist discret linearli interpol semant assumpt tempor domain effect pad year figur effect histori semant assumpt assumpt defin depend applic characterist structur type manag properti left applic program function defin tempo context appli inherit mechan histor class defin section tempor binari relationship odmg data relationship defin implicitli declar pair properti attach particip relationship tempo extend notion properti model tempor relationship attach class properti defin tempor constraint list hold notat set instanc class op histori properti instanc attach object case symmetr tempor support class level class fleet tempor declar class tempor track period time object class respect valid transact time instanc tempor class call tempor object accord extent class fleet defin set instanc class creat delet due semant inform object class delet extent addit notion notion introduc appli tempor observ tempor domain observ extent definit tempor observ tempor domain attach arbitrari set instant definit tempor observ extent class instant subset extent consist object observ domain observ tempor domain observ domain set instant inform convei object observ notion defin respect inform convei object observ inform entiti model object class product model product type produc sold compani class declar tempor respect observ domain model time product time sold observ domain model time bottl produc class observ domain object class captur time product class model time product produc realiti tempor support properti class extent fleet class class class fleet properti basic constraint relat observ domain object tempor domain properti tempor domain properti instanc observ domain object attach constraint captur fact properti instanc remark appli object particip relationship referenc attribut object observ object observ updat access tempor properti instanc oper properti retriev properti set assign paramet context tempor properti set updat access oper due varieti tempor characterist attach achiev section oper classifi depend intend modifi tempor domain effect depend time dimens appli evolut tempor domain properti instanc intend model evolut tempor domain properti instanc evolv automat respect time system current instant ad tempor domain properti instanc system clock tick automat evolut tempor domain overridden model fact properti instanc observ period time achiev notion growth growth statu properti instanc tempor domain evolv system clock evolv oper turn turn properti switch state evolut tempor domain properti instanc updat tempor distinct made regular properti effect histori determin tempor tempor domain effect histori independ valu relat constraint effect tempor domain includ tempor unlik tempor domain properti instanc evolv automat system clock updat oper set tempor domain destruct replac tempor domain properti instanc set instant paramet tempor domain effect oper forc modif effect constraint violat updat tempor effect histori restrict fit insid tempor domain evolut effect histori properti instanc case effect histori tempor properti instanc modifi overload version odmg set oper set appli properti instanc replac effect histori ident map current instant growth statu properti instanc turn evolut effect histori properti instanc primit oper updat effect histori tempor properti instanc set effect histori destruct replac effect histori tempor properti paramet order achiev tempor transit standard set oper semant properti effect effect snapshot current effect histori access oper retriev effect histori properti current instant function yield instant system clock enforc constraint relat effect domain tempor properti instanc tempor set effect histori instant tempor domain properti instanc appli access tempor properti instanc primit access oper properti instanc effect histori histori simpli retriev effect histori properti build histori tempor domain effect histori semant assumpt case regular properti effect histori depict figur histori synonym achiev tempor transit odmg access oper support tempor properti instanc semant context defin tempor properti case semant assumpt current odl statement tabl summar discuss interfac void set interfac interfac void set effect interfac interfac void set tempor interfac void turn void turn enum tabl interfac properti instanc tempor object observ domain evolut evolut observ domain observ domain object evolv automat system clock similar tempor domain properti instanc object growth object current instant ad observ domain system clock tick oper turn turn modifi growth statu object object growth statu turn evolut observ domain uniqu oper updat lifespan set destruct set lifespan tempor sequenc paramet tabl summar discuss present tempor extens odmg predefin object interfac delet oper object fleet check object delet particip relationship delet ensur referenti integr object particip fleet interfac object void interfac object interfac object void set interfac interfac object enum void turn void turn interfac tabl interfac tempor object relat factori delet relationship modifi object delet due semant exampl simplifi applic deal observ student school model data mean class student properti structur type class observ domain object class student tempor domain instanc properti observ granular dai tabl describ updat scenario occur context applic handl oper date scenario oper result student regist school student student enrol math chemistri set student quit student enrol logic set simpl applic manag inform product produc sold compani model class product attribut price introduc properti observ granular structur type evolv observ object class product model time product produc granular tempor domain instanc properti price model time price defin tabl illustr updat scenario notat design interv instant granular greater equal scenario oper result product introduc price product set set effect product price start set effect effect product longer observ start set tempor product introduc start price observ set vt unchang price product observ start set tempor tempor set effect effect histori unchang tempor achiev tempor transit support schema modifi add tempor support class applic continu access tempor compon account schema modif paragraph describ object adapt kind schema modif schema chang reflect tempor access applic instanc adapt instanc adapt schema modif add tempor support schema object oper defin oper appli exist object instanc schema modifi algorithm describ object function algorithm retriev metadata modifi schema algorithm object oper modifi class set class tempor support ad modifi properti set properti tempor support ad object convert begin modifi class turn set modifi turn begin set tempor set effect current denot op end end shown tempor migrat support ensur time properti idea tempor migrat support tempor properti current assign remain constant characterist proper properti access mode program queri languag gener provid construct access properti updat access attribut updat perform construct form op updat access primit type tempor properti instanc notion access mode introduc establish updat access oper tempor properti depend applic context access mode upward compat tempor properti instanc defin structur histori current instant refer extent tempor class retriev observ extent current instant tempor tempor properti instanc filter perform access tempor class extent object extent upward compat tempor properti access program properti retriev oper updat mode handl set oper tempor histori set effect histori access mode attach applic access access mode implement system paramet applic session mode default tempo design choic crucial ensur tempor migrat support schema definit queri languag section introduc schema definit queri languag built top tempo model semant languag term concept oper introduc previou section minor extens odmg odl add construct tempor tempor properti class briefli present specif construct concret exampl complet syntact specif appendix tempor unit format unit defin give set unit immedi graph finer relat set defin unit includ dai defin tempor unit dai sole unit immedi year sole unit immedi unit immedi unit function expand granul granul perform opposit oper factor provid unit month year factor dai function dai month month system ensur implement referenc function provid applic compil state section format defin give unit regular express permut regular express essenti string tag form granul unit referenc granul referenc alia defin unit format unit statement defin altern format express instant unit instant format instant format unit unit permut permut alia month major advantag defin granul format enabl support express tempor format coexist instant format instant format unit unit permut permut alia month state section format domain overlap regular express recogn common group format system format system instant format system american notic format coexist format domain overlap format system dbm provid format format system detail handl format format system reader refer tempor class properti class specif tempor dimens granular instanc lifespan prefix specif tempor class tempor specif includ tempor semant assumpt granular tempor characterist declar prefix definit properti consid fleet design choic ensur upward compat work applic handl inform factori roughli applic track evolut data product custom compani product bottl trademark histori daili product price client fact manag evolut attribut relev applic instant observ granular client put order product valid granular dai class attribut string fleet attribut valid discret granular dai attribut long valid granular dai attribut float valid regular granular minut relationship order valid granular minut class attribut short fleet attribut valid regular granular minut relationship product valid regular granular minut relationship client client valid granular dai class attribut string fleet attribut valid granular dai string valid regular granular minut relationship order notic class client lifespan instanc observ granular dai add type oql time histori oper modul tempo integr notion access mode section queri tempor valu tempor type defin time model primit languag format instant durat format system defin syntact structur interpret tempor liter queri instant liter durat repres string liter tag word repres string recogn instant format system durat format languag instant format system denot instant liter durat format system format regular express durat liter languag includ predefin function tempor unit argument return instant granular defin begin return smallest instant yield instant system clock forev return largest instant definit tradit arithmet comparison oper numer valu extend deal instant durat queri type instant queri type queri type queri type durat queri type instant oper instant granular approxim oper cast instant granular instant granular oe cast instant granular interv granular oe oper deriv present introduc construct express tempor sequenc liter queri type type type bi type bag instant bx bag interv interv constructor denot interv instant greater equal equal repres empti interv observ unit observ unit period tempor sequenc constructor denot period sequenc instant form equal empti sequenc tempor sequenc constructor tempor sequenc instant bi instant ly interv bx notic result automat coalesc overlap contigu interv bx ensur oper tempor sequenc defin time model counterpart oql construct collect overload deal tempor sequenc construct max min access smallest largest instant tempor flatten transform collect tempor sequenc singl complet list oper tempor valu reader refer access mode indic illustr notion access mode impact queri select tempor queri type retriev bottl histori price upward compat mode queri type retriev trademark sold price construct provid set access mode queri snapshot correspond upward compat tempor mode syntax defin snapshot tempor prioriti construct smaller construct mechan determin access mode scope oper discuss section queri histori describ construct handl histori give type syntax notat similar complet formal oql queri formal construct made describ subtyp constraint type type constraint variabl free type precondit make refer subtyp histori subtyp subtyp defin model achiev construct applic subtyp histori instant notat termin symbol typeset boldfac type rule construct notat implic notat mean queri type mean queri type assum variabl type term express involv oper tempo histor model semant queri parametr valuat function determin valu free symbol queri notat denot valuat equal assign symbol precondit appli oper defin semant construct relat observ unit argument appli construct oper illustr queri applic present assum access mode tempor selector function appli queri type subtyp unit exist correspond empti test histori construct function syntax semant straightforwardli defin term selector histori structur domain extract client give person manag queri select oql list accessor construct overload deal histori semant defin term selector histori subtyp fl subtyp instant fl structur instant retriev trademark product januari queri select struct introduc instant european format date histori restrict applic function construct restrict histori instant ly tempor defin oper histori subtyp subtyp subtyp instant subtyp subtyp instant oe restrict tempor valu bottl give trademark histori product queri type select struct instant automat expand interv granular dai construct oper subtyp variabl free boolean ffl construct case subtyp variabl free map boolean map map ffl ffl map map construct introduc macro map map true similar construct plain oql select fundament differ semant syntact level semant import note result construct collect oql select syntact notion project attribut project shortcut histori relat construct merg join construct present oper merg histori construct join correspond outer tempor join histori syntax similar struct construct plain label compon result histori subtyp valid label structur type notic semant rule account label attach structur valu result histori tempo data model formal function exist tupl type label type constructor exist odmg object model queri illustr tempor join restrict structur valu tempor join bottl trademark produc larger quantiti bottl trademark queri observ unit construct defin similarli account semant outer structur valu result histori refer null valu structur valu argument histori liter type integ structur valu result type detail type account product consid greater queri oj nil nil intersect differ construct defin collect type oql extend histor type aggreg group oql aggreg function collect extend deal subtyp histori except count renam durat appli yield durat tempor domain histori semant construct obviou definit oper histori omit map construct defin histori extend group account group group criteria tempor unit durat similar remark formul map construct option subtyp variabl free variabl partit free ae subtyp ffi subtyp map group boolean ae boolean map group map group ffl ffl ffl ae ffl ffl ffl ffi aggreg group bottl month bottl dai product greater queri product select map durat partit histori granular dai group aggreg group bottl period total product bottl type greater retriev averag product period queri select result histori granular averag product period start dai provid total product period greater map group oper set addit provid oper manag histori independ set histori iter result express tempor queri explicitli referenc timestamp properti valu construct cast histori chronicl return order list order list set tempor valu describ semant construct subtyp notic join semant rule account tupl label attach result set manag store uninterrupt period longer longest uninterrupt period ed manag queri select distinct obtain histori bag timestamp histori construct provid queri type queri type semant oper defin section construct histori appli bag tempor valu oper reason success time construct straightforward adapt oper histori syntax similar construct subtyp variabl free boolean ffl reason time retriev instant histori reason term sequenc consecut pair element chronicl pair construct conjunct oper set valid label structur type success time price bottl trademark give date price durat queri durat select struct yield smallest instant tempor sequenc implement applic tempo implement top dbm implement consist librari class adt hierarchi defin time histor preprocessor implement tempor metadata manag account commun schema definit queri languag preprocessor ongo effort aim design implement api modul compat interfac defin odmg librari tempor class implement proprietari program languag preprocessor metadata manag primarili implement code gener tool lex yacc figur illustr prototyp architectur visual modul referenc architectur part ongo work appli visual paradigm interact analysi data result tempor queri modul metadata relat tempor characterist class properti modul referenc architectur concern retriev pattern histori modul implement set oper select tempor object base tempor metadata manag pattern match histori tempor type time unit format administr end user tempor librari visual program extern figur prototyp architectur complex criteria deal sequenc structur histori definit oper reli languag construct base regular express time constraint implement oper exploit techniqu current interact access mode queri scope access mode indic section determin global variabl interact set user current work architectur implement issu aim integr notion relat tempor transit support bind level idea design implement concept tempor tempor properti access mode program languag bind defin odmg java tempo prototyp implement applic context work applic deal manag annot time seri econom analysi applic analysi resourc space util ski resort locat french alp tempo prototyp demonstr confer meet eventu public domain futur work main contribut paper tempor framework unifi requir function recogn tempor extend exist dbm framework time histori extens odmg object schema definit languag queri languag time model defin simpl complex tempor type respect extens set time unit time valu manipul rich collect function organ adt hierarchi adt straightforwardli integr odmg predefin type hierarchi histori model adt dedic notion histori wide varieti independ oper defin type time form basi extens odmg oql tempor extend object model fulfil import requir relat legaci code upward compat tempor transit support state transpar migrat odmg system tempor extens legaci code remain usabl schema modifi add tempor support compon tempor transit support ensur separ tempor properti histori tempor properti histor context tempor applic context updat oper tempor properti defin updat applic compat perform tempor model languag formal syntact semant prototyp top dbm develop basi formal prototyp develop applic context time plan extend work user develop appli visual paradigm tool interact analysi manipul data result tempor queri studi design implement issu relat manag interpol histori spatial object point region insight approach model queri move object sequenc unifi concept construct develop context tempo tempor data provid gener framework manag kind sequenc effort direct report particip initi design implement tempo refer jf allen maintain knowledg tempor interv commun novemb cs jensen versu tempor data model proc int confer data page cs rt snodgrass notion upward compat tempor queri languag technic report time extend odmg object model time european confer program juli bohlen tempor system implement sigmod decemb pour de universit joseph grenobl cattel editor object odmg morgan duma manipul de dan objet act du xv english version url snodgrass semant acm transact june cheng gadia pattern match languag proc intern confer inform knowledg manag md novemb chomicki tempor queri survei proc intern confer tempor clifford rao simpl gener structur tempor domain confer tempor aspect inform scholl manag time histori top oo dbm proc demo valencia march scholl handl tempor group queri tempor object model proc cikm intern md novemb segev extend updat function tempor etzion al sm editor tempor research practic springer lnc ea emerson tempor modal logic van handbook theoret comput volum elsevi scienc de applic de base de de novemb scholl model histori object dbm proc intern confer expert system applic septemb springer verlag lnc fowler scott uml appli standard object model languag addison lorentzo foundat repres queri move object technic report da hagen gadia tempor parametr data tansel al ozsu tempor extens uniform behavior object model proc intern confer approach lnc springer tau tempor object model technic report manchest lorentzo relat model applic tansel al editor rose segev tempor queri languag springer proc intern confer entityrelationship approach lnc riedel mh scholl formal odmg queri proc int confer data semant octob chapman hall snodgrass ahn taxonomi time proc acm rt steiner transit tempor support etzion al pour mar de ramakrishnan design implement sequenc system proc int confer larg page snodgrass tempor critic comparison modern system object chapter addison editor tempor queri languag kluwer academ segev shoshani tempor data model base time sequenc tansel al editor tempor publish toman tempor extens sql effici implement etzion al esprit project specif design cap system decemb esprit project specif nation technic decemb dayal uniform model tempor version objectori tansel al subrahmanian tempor modul approach feder tempor inform syntax section detail descript syntax notat termin boldfac correspond reserv symbol bnf notat case surround quot dot denot part rule reader refer detail unit factor function format instant durat unit permut alia format system interv class relationship valid transact regular discret granular
IR/1202 5 find relat page world wide web jeffrei dean monika compaq system research center lytton av santa ca palo ca abstract tradit search user formul queri describ inform paper discuss approach web search input search process set queri url output set relat web page relat web page address topic origin page page relat onlin newspap describ algorithm identifi relat web page algorithm connect inform web link content page usag inform implement algorithm measur runtim perform evalu effect perform user studi compar algorithm netscap servic studi show algorithm fact netscap content usag pattern inform addit connect inform search relat search paradigm introduct tradit web search engin queri input produc set relev page match queri term search engin disadvantag user formul queri inform prone error paper discuss find relat web approach web search approach input search process set queri url output set relat web page relat web page address topic origin necessarili semant ident tool find newspap organ web contrast search approach requir user found page interest recent work inform retriev web recogn hyperlink structur valuabl locat inform assum link page author recommend page link connect relat page describ companion cocit algorithm hyperlink structur web identifi relat web page tabl show output companion algorithm work author compaq western research laboratori usa todai newspap washington post newspap cabl network lo angel time newspap wall street journal newspap cabl station san jose mercuri newspap chicago newspap time servic time newspap tabl result produc companion algorithm companion netscap tabl comparison result companion netscap algorithm mean page mean page mean page access input result cocit algorithm ident result netscap goal design algorithm high fast requir larg number kind input data tool access hyperlink structur web connect server algorithm connect inform identifi relat page algorithm inform link page order link examin content examin pattern user tend navig page companion algorithm deriv hit algorithm kleinberg rank search engin queri kleinberg suggest hit algorithm find relat page provid anecdot evid work extend algorithm exploit link order page section present result show result algorithm work cocit algorithm find page frequent cocit input url find page point page point netscap commun version introduc relat page servic built browser section detail browser present menu relat web page case algorithm netscap base technolog develop comput answer base connect content usag inform compar perform algorithm netscap perform user studi url chosen volunt studi result show comput url algorithm netscap algorithm gave answer url studi restrict comparison url algorithm return algorithm netscap algorithm algorithm base connect inform netscap algorithm answer million url algorithm give answer larger set url connect inform million import mean give relat url inform url algorithm averag msec comput input url shown tabl url high level connect inlink connect algorithm gener perform url algorithm work shown tabl tabl show answer companion netscap algorithm input url chosen user part user studi alongsid answer user rate mean user consid page mean user consid page mean user unabl access page origin page corba implement page point page connect server ten answer companion algorithm deem relat page netscap set answer deem relat netscap answer broader topic specif corba implement linux section present algorithm detail describ netscap section discuss implement algorithm section describ user studi perform present perform evalu algorithm section present relat page algorithm section describ algorithm companion algorithm cocit netscap algorithm unlik netscap algorithm exploit graph web examin inform content usag page netscap algorithm kind inform arriv result section term parent child hyperlink page page parent child companion algorithm companion algorithm input start url consist build vicin graph contract duplic graph comput edg weight base host host connect comput hub score author score node graph return top rank author node implement return top phase algorithm modifi version hit algorithm origin kleinberg step detail subsect step exploit order link page step build vicin graph queri url build direct graph node nearbi web graph graph node correspond web page graph edg correspond hyperlink graph consist node edg parent parent bf children children child fb parent node stoplist stop url unrel queri high stoplist develop url exampl node stoplist start url node ignor url stoplist form vicin graph disabl stoplist set stop empti freeli includ node vicin graph disabl stoplist input url stoplist node stoplist popular search engin permit node consid input url popular site back add random parent stop add parent parent bf add children point link immedi link children point link immedi link duplic page fewer bf add children graph note exploit order link page forward add children point link add children child bf add bf parent stop highest add child parent hyperlink page repres node graph page repres node belong direct edg graph omit edg node found larg small bf work practic moder valu observ link page similar topic tend cluster link farther page topic group observ research larger mean likelihood comput domin singl parent page reduc step duplic elimin build graph combin node link link common combin replac node node link union link duplic elimin phase import page duplic host mirror observ remain separ greatli distort result step assign edg weight assign weight edg weight scheme bharat repeat complet edg node host weight edg document host singl document host give edg author weight weight comput author score document host edg singl document host set document give edg hub weight perform scale prevent singl host influenc comput call result weight graph vicin graph step comput hub author score run imp algorithm graph comput hub author score imp algorithm straightforward extens hit algorithm edg weight intuit hit algorithm document point good document document point good author document point good author similarli document point good hub author hit comput repeatedli updat hub author score document high author score expect relev document high hub score expect link relev content comput hub author score initi element hub vector initi element author vector vector node vicin graph author hub normal vector note algorithm claim find relev good content link author companion algorithm return node ten highest author score page relat start page assum paper host determin cocit algorithm altern approach find relat page examin sibl start node web graph node common parent number common parent node altern companion develop simpl algorithm determin relat page sibl node highest cocit algorithm arbitrari parent parent add set bf children surround link element sibl node determin cocit algorithm return frequent cocit node relat page case insuffici level cocit provid result node cocit restart algorithm node url path element remov url insuffici number cocit node exist restart algorithm url result url continu chop element left host find valid chose bf paramet valu implement companion cocit algorithm find bipartit subgraph vicin graph netscap approach netscap introduc featur version netscap commun browser detail approach identifi relat page algorithm sketchi relat faq page algorithm connect usag content analysi page determin relationship quot faq relat data creat alexa internet alexa categor data mine techniqu build relat site list million web url alexa link crawl page find relat site relat build refin data servic request url log netscap alexa deduc relationship web site thousand user directli site site site relat alexa check url make live link process remov link return page dont exist link server arent gener internet server longer activ relationship establish link top ten relat site url chosen strength relationship site alexa web rebuild data pull site refin relationship exist site site strong relationship site automat relat list site displac site weaker relationship note relationship site base relat list necessarili balanc site list site site list site number site strong relationship greater site similar content implement experi fortun access compaq connect server connect server high speed access graph structur million url link connect entir graph structur memori compaq gb main memori dual mhz alpha processor random access pattern algorithm paper import graph fit main memori prevent high level page activ implement server accept url cocit algorithm companion algorithm find page relat url server implement consist approxim line comment approxim line implement companion line implement cocit remaind share code perform task http queri print log statu messag link server code directli connect server access connect inform graph inform address space server implement companion algorithm subject moder amount perform design neighborhood graph data structur improv perform implement cocit algorithm tune share fair amount code companion share code tune evalu section describ evalu perform algorithm section describ user section discuss result studi section evalu run time perform algorithm setup compar perform user studi volunt suppli url find relat page volunt includ comput scienc colleagu compaq research peopl career receiv url algorithm determin top answer url put answer random order return volunt rate volunt instruct measur algorithm perform measur perform percentag valuabl url return algorithm valuabl url relev topic interest high qualiti page url back newsgroup post talk page high qualiti decid answer topic url algorithm answer answer dead link companion cocit netscap tabl summari answer algorithm page page page access server ignor order page return page similar content earlier page rate page earlier page impli measur set answer return algorithm measur valuabl answer algorithm user studi result receiv rate answer url input url input url form basi studi tabl show queri algorithm answer answer url return algorithm return link user rate inaccess column label dead link show number inaccess page answer algorithm treat inaccess link score inaccess page cocit algorithm return result url reason return result input url insuffici connect found surround input url cocit algorithm chop url input includ chop featur implement companion directli applic enabl companion algorithm return answer url empir observ netscap algorithm appli similar chop heurist case tabl list url studi column label show url netscap algorithm return tabl show number hyperlink point url connect server companion show number node edg vicin wall clock time millisecond comput set relat page surround comput system cocit show number sibl number sibl cocit wall clock time comput answer algorithm return answer subset url compar subdivid url group intersect group consist url algorithm return answer url group group consist url netscap approach return answer consist url quantifi perform defin metric algorithm total number answer receiv score divid time number url notic algorithm give answer gave answer url companion algorithm cocit algorithm time time url cp ct link node edg sibl cocit tabl url evalu intersect avg avg avg algorithm companion cocit netscap tabl metric algorithm group url intersect rank rank rank algorithm sign sum sign sum sign sum companion netscap cocit netscap companion cocit tabl sign test wilcoxon sum rank test algorithm pair url averag algorithm sum rank answer algorithm receiv score divid total number answer algorithm receiv score algorithm return answer averag averag algorithm sum averag url divid total number url group url tabl show averag algorithm figur show group url graph figur illustr companion cocit algorithm substanti outperform netscap algorithm companion algorithm outperform cocit algorithm intersect group interest avoid penal algorithm return answer intersect netscap algorithm achiev companion algorithm achiev cocit algorithm achiev averag intersect group penal algorithm return fewer answer companion algorithm netscap cocit algorithm netscap algorithm group includ algorithm drop valu reason algorithm companion cocit netscap intersect figur group url algorithm companion cocit netscap companion cocit netscap tabl overlap answer return algorithm graph edg companion time sibl cocit time figur graph size run time companion cocit alg url return answer affect netscap companion algorithm reason url companion cocit algorithm perform url intersect set drop absolut averag averag companion algorithm averag cocit algorithm netscap similar result hold examin averag evalu statist comput sign test sum rank test pair algorithm result shown tabl show differ companion netscap algorithm cocit netscap algorithm statist evalu algorithm gener return result url return larg disjoint set url tabl show amount overlap answer return pair algorithm percentag overlap divid total number answer return algorithm row tabl larg overlap answer return companion cocit algorithm algorithm base connect inform surround input url similar paramet surround node overlap answer return netscap algorithm perform present data perform companion cocit algorithm direct access netscap algorithm access public web unabl present perform inform netscap algorithm measur perform compaq gb main memori dual mhz alpha processor measur run time wall clock time time input url server time answer return time includ time format result html server process run machin time averag run time companion algorithm url return answer averag run time cocit algorithm url provid answer msec perform algorithm suffici fast handl larg amount traffic request dai companion averag perform improv cach answer frequent request url explicitli includ factor user inform observ subject qualiti answer return companion cocit algorithm paramet number inlink build vicin graph import servic mean graph size reduc time high reduc amount time servic request condit low graph size companion algorithm gener converg answer iter number iter graph size iter time linear number edg vicin graph plot run time number graph edg figur run time cocit algorithm log number sibl examin sort sibl cocit effect illustr figur run time cocit companion algorithm gener url larg number sibl cocit algorithm gener produc larg neighborhood graph process companion algorithm relat work research scheme hyperlink structur web work discuss find relat except discuss previou work order chakrabarti al link order categor web page show link link page order frequent point page topic previou author suggest cocit form connect identifi relat web page spertu observ cocit page relat page point page relat research field bibliometr observ observ form basi cocit algorithm notion collabor base user recommend reli observ pitkow pirolli cluster web page base analysi terveen hill connect structur web find group relat web site companion algorithm descend hit algorithm develop kleinberg hit algorithm origin kleinberg connect structur identifi authorit sourc inform topic defin combin link structur larg number start node topic kleinberg hit algorithm find relat page topic defin singl node companion algorithm hit algorithm start point extend modifi main kleinberg suggest graph find relat fix number parent url call set consist url parent start set build graph consist node point node start set point node start set mean includ node share child includ graph node relat node vicin graph structur exclud grandpar node includ node share child exploit order link page determin includ ad algorithm improv notic origin hit algorithm edg weight edg weight reduc influenc page resid bharat shown edg weight improv merg node vicin graph larg number duplic link duplic node problem hit imp algorithm rank queri start set consist larg number url form vicin graph start singl influenc duplic node duplic node larg number link quickli domin hub author comput kleinberg show hit comput princip eigenvector matrix aa adjac matrix suggest eigenvector find relat page gave anecdot evid hit work sequenc paper present improv hit popul hierarchi categori improv directli relev task find relat page present algorithm find relat page www significantli outperform netscap algorithm find relat page algorithm implement effici suitabl larg scale web servic provid relat page featur algorithm extend handl input url algorithm comput page relat input url explor extens acknowledg work benefit greatli discuss krishna andrei marai indebt work connect server earliest user answer question implement improv server suggest grate marai develop web script languag quickli develop prototyp user interfac relat page server krishna allan marai provid feedback earlier draft paper particip user studi refer sixth intern world wide web santa april seventh intern world wide web april mihaila applic web queri languag sixth intern world wide web confer page connect fast access linkag inform web seventh intern world wide web confer page bharat improv algorithm topic distil hyperlink environ intern acm sigir confer research develop inform retriev page sergei brin lawrenc page anatomi hypertextu web search engin seventh intern world wide web confer page carrier kazman search visual web connect sixth intern world wide web confer page sr tomkin experi topic distil workshop hypertext inform retriev indyk enhanc hypertext categor hyperlink acm sigmod intern confer manag page raghavan kleinberg automat resourc compil analyz hyperlink structur text seventh intern world wide web confer page netscap commun corpor relat faq web page netscap commun corpor relat web page garfield citat analysi tool journal evalu garfield citat index isi kessler bibliograph coupl scientif paper american marai program languag web seventh intern world wide web confer page kleinberg authorit sourc hyperlink environ annual symposium discret page januari rao silk sow extract usabl structur web confer human factor comput system page april pitkow pirolli law electron frontier confer human factor comput system page march sheldon ross introductori statist mcgraw shardanand mae social inform algorithm autom confer human factor comput system small scientif measur relationship document amer soc info ellen spertu mine structur inform web sixth intern world wide web confer page loren terveen hill evalu emerg collabor web acm confer cooper social social page loren terveen hill find visual graph confer human factor comput system make imposs page acm press vita monika receiv phd princeton robert tarjan assist professor comput scienc cornel join digit system research center compaq comput corpor system research current research interest inform retriev world wide web algorithm problem context jeffrei dean receiv phd washington work effici implement techniqu languag professor craig chamber join compaq western research laboratori work profil perform monitor compil inform retriev join work scalabl comparison shop system world wide web current research interest includ inform retriev develop scalabl system world wide web contin shy goal plai contin
IR/1203 5 search engin model thoma patrick michael joyc alex david princeton david jacob nec research institut number model web search engin peopl find tradit search techniqu effect data investig search method kei challeng develop queri method simpl novic user match algorithm robust work arbitrari polygon model present search engin system support queri base text keyword develop match algorithm spheric harmon comput discrimin similar measur requir repair model degeneraci align orient perform relat shape match method fast return queri result repositori model net result grow interact index model web googl categori subject inform storag analysi index method gener human factor addit kei word search shape shape shape introduct comput scienc made progress retriev analysi multimedia data obtain imag powerpoint present decad draw librari copi farm photograph simpli pick suitabl imag million web web search commonplac inform revolut data infanc recent trend combin lead time futur model ubiquit multimedia data scanner interact tool make construct detail permiss make copi part materi fee person classroom provid copi made distribut profit commerci acm titl date notic copi permiss copi post redistribut list requir prior specif permiss fee acm acm transact vol page thoma al model practic cost graphic hardwar faster demand model wide rang web facilit distribut model develop chang data primari challeng comput graphic construct interest model kei question shift construct find person build virtual world repres citi scene model street stop bui model tool build acquir larg repositori model research classif model follow trend observ media import question peopl search model simplest approach search keyword context approach object annot object annot deriv keyword relat keyword common queri result flood irrelev match search human relev keyword unknown user object misspel foreign keyword interest time object annot case queri find object shape combin function defin class object round shape discrimin similar object desk chair versu instanc class defin shape thing pictur worth thousand work investig method automat retriev model challeng develop comput shape indic built similar queri answer effici describ method search orient invari spheric harmon descriptor find user interfac untrain user queri investig combin interact refin base shape similar integr method search engin publicli index model web paper organ section review relat work section overview discuss main research issu section implement detail provid section section present result studi aim evalu queri match method summari section discuss topic futur work section acm transact vol search engin model fig screenshot search engin model user queri combin keyword sketch return rank set thumbnail imag repres match model user retriev model click refin search edit origin input click similar link thumbnail relat work data retriev analysi recent activ area research al lesk obviou exampl text search engin googl page part daili live retriev classif system develop multimedia data includ audio imag bergman video al retriev data base shape studi includ comput comput mechan molecular biologi guiba aggarw jain pope survei recent prior work data al jacob al stonebrak imag retriev system user sketch detail pictur retriev similar imag base shape similar al extend system work surfac model requir find good user interfac queri effect algorithm index shape problem index surfac boundari boundari contour shape natur arc length surfac arbitrari common shape descriptor contour al arkin al kashyap chellappa lin al ura verri young al extend effici match algorithm base dynam program tsai yu appli object problem higher make find featur fit model paramet acm transact vol thoma al method match shape geometr hash wolfson deform al jain al pentland sclaroff sclaroff pentland terzopoulo metaxa difficult recognit object core problem comput vision imag rang scan object obtain specif scene clutter rang imag requir partial surfac match mckai chen turk imag complic perspect distort light variat problem address method search local correspond featur johnson hebert al low readili lead index focu model isol object model file intend comput graphic visual virtual world model free sensor unorgan set polygon possibl overlap polygon lack consist solid surfac model make difficult shape analysi fix model difficult open problem kumar al object shape analysi work match surfac mesh regist match surfac includ extend gaussian imag spheric attribut imag al harmon shape imag hebert shape context al mori al spin imag hebert previou method requir priori registr coordin system search find correspond match volumetr dissimilar measur base wavelet scott earth distanc al assum topolog valid surfac mesh object approach base compar gener cylind bajcsi levin shock graph al medial ax al skeleton lim blum al al method comput timeconsum sensit small featur readili lead mean index larg al shape index base statist properti simplest approach repres object featur vector al space ax encod global geometr algebra moment reev cooper method consid histogram geometr statist al al evan al al al al shape histogram shell sector centroid histogram angl edg triangular mesh al al repres shape probabl distribut geometr properti comput point randomli sampl surfac statist method discrimin make acm transact vol search engin model subtl distinct class shape live room chair versu dine room project investig search engin concurr suzuki specif data mechan cad part kriegel flynn protein molecul al al cultur artifact al al support queri base text file attribut previou system index larg repositori comput graphic model collect support sketch interfac studi interact text shape search data topic investig paper system overview organ system shown figur execut proce match step perform user queri text overview step highlight main build model crawl web data repres small percentag high qualiti model repres equal small percentag data develop crawler incorpor measur model page rank download vrml model web augment commerci model provid vendor viewpoint comput indic retriev model effici base text shape queri develop shape descriptor base spheric harmon effici robust model invari rotat user search interact model system support queri method base text model iter refin find method base text shape combin produc result user web server index return sixteen model match queri method answer shape queri quarter scale number index model main research issu heart system provid queri interfac match method enabl easi effici retriev model larg repositori discuss issu detail queri interfac shape queri queri interfac provid search engin exist model retriev similar search engin support acm transact vol thoma al world wide web user crawler repositori crawler model queri interfac queri match text index text matcher fig system organ index index matcher index matcher strategi wai user type file upload comput system search model similar shape method find object type find find instanc specif object check illeg copi proprietari user search model shape return previou search click similar link imag result page text figur method iter refin search home specif class object main challeng support similar queri find comput shape shape index built geometr match perform effici gener properti desir shape descriptor quick easi invari similar insensit small extra independ object robust arbitrari topolog discrimin shape differ scale exist shape descriptor properti shape gener cylind bajcsi levin shock graph al medial ax al skeleton lim al al requir consist model boundari difficult reconstruct highli comput graphic model kumar al shape extend gaussian imag spheric attribut imag al moment reev cooper wavelet scott requir priori registr canon coordin difficult achiev robustli statist shape featur vector al shape distribut al discrimin distinguish similar class object base spheric harmon main idea acm transact vol search engin model model collect function defin concentr sphere spheric harmon discard orient inform yield shape descriptor orient invari descript origin shape reconstruct comparison descriptor provabl lower bound distanc advantag approach index registr model canon coordin system spheric harmon obtain multiresolut shape al requir priori registr princip ax find princip ax good align orient model class figur demonstr problem collect mug fact mug similar deriv princip ax main reason contribut moment rotat align scale quadrat distanc center small differ handl mug affect princip ax significantli net result poor align poor match score algorithm reli method advantag phase elimin avoid problem fig collect mug drawn princip ax similar princip ax orient model wai acm transact vol thoma al compar rotat invari shape expect spheric harmon descriptor discrimin similar shape uniqu rotat independ frequenc compon concentr sphere shape resolut invari descriptor discard significantli inform al histogram distanc surfac point center mass descriptor amount order spheric harmon concentr shell method encod higher frequenc inform discrimin power main step comput spheric harmon shape descriptor set polygon shown figur raster polygon surfac voxel assign voxel voxel width polygon assign adequ granular discrimin shape filter origin data normal translat move model center mass li point scale averag distanc voxel center mass approach simpler base center radiu bound sphere sensit outlier treat voxel grid function defin set point length equal express function spheric θ φ restrict radii obtain collect spheric function spheric express function fr sum function project function fr irreduc rotat group act space spheric attempt reconstruct fill volumetr interior object work arbitrari gener commonli found class comput graphic model fix model form consist solid interior manifold surfac difficult open problem kumar al acm transact vol search engin model note irreduc fix note rotat chang norm observ chang rotat function fr defin rotat invari signatur fr collect scalar combin signatur obtain rotat invari spheric harmon descriptor index length frequenc restrict sphere radiu fig comput spheric harmon shape descriptor compar spheric harmon simpli comput euclidean distanc retriev match queri model solv problem space problem hard worst build search algorithm work effici practic search multipl space motwani implement work pass quickli comput lower bound distanc queri model model find neighbor project space coordin ax pass comput true distanc sort lower bound distanc stop distanc current nearest model smaller smallest lower bound remain model comput true distanc spheric harmon stop distanc model current threshold full comparison requir small subset result present section sketch queri shape similar queri user repres model find text search creat scratch seed interest open question type model tool creat shape retriev question tradit geometr model research provid tool train user creat model detail smooth goal novic user shape quickli interfac easi learn time visitor websit requir rule model tool todai practic acm transact vol thoma al requir search engin week train learn complic menu structur commerci cad tool investig altern approach shape queri simpl sketch al sketch al investig develop queri interfac user creat simpl model al system retriev similar model match algorithm previou section figur earli experi suggest simpl gestur interfac hard novic casual user learn quickli inform observ peopl readili understand difficult time rotat model proper viewpoint model oper type shape creat object topolog make tool simpler requir constraint type shape produc motiv altern sketch paradigm fig sketch queri interfac approach draw shape pixel paint program system match result project object main advantag approach interfac easi learn novic comput user paint program complic view manipul command main disadvantag imag gener shape inform model factor user draw multipl project object order defin shape main challeng implement approach develop algorithm match sketch object problem significantli classic comput vision input photograph interfac interact peopl draw viewpoint interfac guid constrain algorithm robust recogn acm transact vol fig sketch queri interfac search engin model big implic scope paper vast literatur train artist draw peopl characterist view al comput recogn photograph imag directli applic case interest untrain artist make quick sketch comput match object investig ran pilot studi student introductori comput scienc class instruct shape object student told draw object found peopl tend sketch object fragment boundari contour geometr remark consist set view direct figur frequent chosen view characterist view al simpler draw top result give clue match sketch object system set sketch enter match project imag model render viewpoint return match nayar preprocess render thumbnail imag boundari contour object orthograph view direct shown figur viewpoint center top middl edg cube queri comput match score object minim sum subject constraint thumbnail match sketch sampl ensur sketch view sampl view advantag fact model align cartesian case sampl view perfectli match view prefer user enhanc effect label match method invari rotat view rotat view direct opposit side object acm transact vol thoma al fig sketch peopl simpli shape human arm sketch window system side view corner view tilt view fig boundari contour render view object match hand drawn sketch project silhouett model pose problem prompt user sketch clean boundari user input made fragment sketch mark effici contour match algorithm al arkin al ura verri compar sketch render view imag match method handl deform geometr appli distanc transform sketch render imag make method robust small variat posit match al hausdorff match al index distanc measur case model arbitrarili imag match method robust reflect rotat imag plane address analog spheric harmon method previou section figur acm transact vol search engin model demonstr detail comput distanc transform boundari contour obtain collect circular function restrict radii expand circular function sum function fact rotat chang amplitud defin signatur circular function list amplitud constitu combin signatur obtain signatur boundari contour index descriptor nearest neighbor search method section method inspir work fourier descriptor rotat invari signatur boundari obtain comput fourier seri store amplitud frequenc compon fig comput shape descriptor boundari contour text queri system support search model match keyword textual descript support construct repres document model text document includ model anchor nearbi text refer web ascii label insid model file includ part node textur file inform field node document preprocess remov common word carri discrimin smart stop list common word word specif domain text stem remov inflect porter stemmer synonym filenam ad wordnet order match document keyword method popular weight classif scheme text document method assign similar score base frequenc document frequenc document bow toolkit implement found includ comment model flood document keyword acm transact vol thoma al multimod queri text shape queri provid orthogon notion similar function search engin combin support featur wai text keyword sketch enter singl multimod queri text shape inform enter success queri combin user refin search term adapt user enter text keyword click similar text shape combin form queri type multimod queri focu search specif subclass object queri keyword retriev class object hard home specif subclass text round tabl singl queri sketch retriev object includ object function tabl multimod input combin wai describ object form specif queri text queri sketch queri multimod queri fig multimod queri effect find specif type object order find top match multimod find match score mode separ varianc avoid queri return model highest averag normal score method strike balanc return intersect match result return mode find specif return union find object plan user control search term combin implement implement search engin perl main compon shown figur compon run red hat linux web server model section describ flow data system implement detail crawler written run mhz pentium iii gb memori crawler process multithread download file simultan connect search possibl compress archiv initi seed url return googl search engin acm transact vol web user crawler model relev text search engin model convert vrml vrml file file thumbnail extract text convert creat imag imag repositori text index index index cach result text matcher matcher matcher web server index text comput shape descriptor index match server creat thumbnail comput shape descriptor index fig flow data search engin data shown blue text store repositori queri page retriev score score estim logarithm triangl html score count keyword titl bodi text suggest relationship model file unvisit url assign prioriti weight sum averag score document link averag model score model nearbi link site score reflect proport document retriev site model maintain hash tabl visit url avoid visit page download model preprocess step convert vrml format format order simplifi step extract creat thumbnail contour comput shape signatur recent download model ad repositori indic updat comput shape descriptor raster polygon surfac voxel concentr sphere comput amplitud harmon sphere net result shape descriptor shape analysi process model polygon averag domin time raster polygon voxel comput shape descriptor thumbnail downsampl pixel appli procedur comput imag web server commun tcp match server dell pc pentium iii processor gb perl job control script fork separ process incom queri text acm transact vol thoma al queri stem pass directli bow toolkit sketch upload model file shape signatur comput compar index separ shape match process match result return web construct web page result return user match result cach enabl fast multipl result page result report data collect seri experi search engin goal experi evalu shape match method test shape combin text provid effect search experi peopl web site shape match result aim test spheric harmon match algorithm find similar object order investig question control independ user ran seri experi match model analyz comput rank correl classif model experi evalu match result indic search engin work user model system find similar user click similar link imag object return previou queri test model object provid viewpoint model median triangl object standard deviat model annot descript keyword object cluster class base function larg group provid viewpoint exampl ten repres class shown figur smallest class largest model fit class chair chair chest bed dine tabl end tabl bottl fig sampl ten repres class viewpoint courtesi acm transact vol search engin model chose viewpoint repres repositori model uniform qualiti difficult classif distinct class object similar shape separ class chair dine room desk live room object span wide varieti shape plate stress discrimin power shape match algorithm test varieti condit comparison relat implement compet shape match method rank model random order baselin evalu method method moment inertia point surfac object xp dx dy moment mass princip regist model common coordin moment sixth order compar differ sixth order moment chosen produc result test implement descript al gaussian imag method model term distribut surfac normal vector align model base princip compar align comput differ method area intersect collect concentr sphere distribut area normal volum distribut compar comput differ al shape distribut method repres shape model distribut euclidean distanc pair point surfac distribut model normal scale divid distribut compar comput differ al figur show retriev result obtain spheric harmon shape match algorithm compar method curv plot versu recal averag classifi model plot ax interpret target model class number top repres ratio model class return top ratio top match member class perfect retriev result produc horizont line top indic model target class return top hit plot shift gener superior retriev result note recal spheric harmon compet method valu higher higher shape higher higher moment reason match base moment reli princip compon align model canon coordin acm transact vol thoma al harmon shape histogram moment random recal class harmon shape histogram moment random recal live room chair fig plot versu recal spheric harmon descriptor versu shape match method method tend poorli class object princip ax consist spheric harmon descriptor sensit deviat class shape descriptor blend shape inform part troubl discrimin fine detail object view shape histogram implement spheric harmon method order frequenc method describ object rotat multipl independ frequenc achiev nice combin rotat invari discrimin power figur show retriev result averag queri live room chair hundr type chair dine room method larg discrimin type achiev high difficult case spheric harmon method index effect figur show averag time requir find closest match size note search time grow total search time model sketch interfac result investig system produc match queri enter human hypothesi shape conjunct text find specif object test ran experi compar input descript power text sketch provid untrain user subject experi student introductori comput scienc class comput scienc subject pen sheet paper told task write text draw sketch search acm transact vol search time index index search engin model size fig search time spheric harmon index engin retriev household object process demonstr subject perform test target object viewpoint previou target object shown rotat project screen front classroom fifteen subject write text keyword draw sketch top view distinguish household object minut target feedback object experi student rate text sketch queri base construct target object queri interfac easi discrimin text keyword sketch tabl averag student rate text sketch queri interfac scale scan sketch log keyword enter input search engin sketch chair elf shown figur tabl ii list result achiev queri text text keyword sketch combin multimod queri queri tabl list median rank target object percentag queri target object top match statist reflect target page search engin result tabl ii suggest text shape complementari inform provid search engin text keyword discrimin differenti hundr chair relat furnitur simpl sketch describ fairli simpl text keyword pick cannon bunk acm transact vol thoma al front view side view top view front view side view top view fig sketch drawn student retriev specif chair elf experi target median rank object text sketch combin text sketch combin chair elf tabl cannon tabl ii comparison retriev result queri combin sketch discrimin gener text effect identifi class sketch select match class net result combin sketch text produc match interact search result investig shape combin text interact search result previou section suggest shape singl question user iter studi creat visual ident test version web box type text button view previou page match button label similar thumbnail return previou queri differ web site search iter refin web click similar button retriev model similar shape section retriev model similar text document section sketch interfac disabl experi order isol effect shape similar singl queri modal acm transact vol search engin model conduct experi student introductori comput scienc class student visit redirect test web site random led short tutori search engin present task find fifteen target object list previou section ten select target object shown rotat web page fifteen disappear student enter text keyword initi iter page find similar object target object visibl match result page statist log session tabl iii column list averag time number iter requir student find target object column percentag student found target initi queri column percentag found tenth time instruct give similar search number found found measur time iter queri iter text shape tabl iii result studi iter method result suggest refin search base shape similar conjunct text find specif object web site equip text student find target object ten iter time student iter find similar found target object versu fewer iter versu time sec versu conjectur student iter learn find object quickli enter descript keyword initi queri account object found experi control studi student perform test internet comput result consist expect shape discrimin specif object effect text search engin result search engin publicli web earli index model report experi peopl site tabl iv list statist gather recent week usag site process queri enter uniqu host count local serv model end user row show number queri type search result user request inform download refer download actual model remain row tabl iv show percentag search event happen acm transact vol thoma al text sketch text similar upload sketch shape model queri info visit ref page download model tabl iv statist gather usag search engin difficult make observ peopl make queri interest usag pattern chang site grow paper investig issu build search engin model main research contribut queri interfac integr shape descriptor base spheric harmon discrimin result experi suggest shape conjunct text search model provid larg repositori model find interest futur work paper scratch surfac research retriev analysi comput graphic topic deserv imag match sketch interfac effect imag match algorithm user creat queri sketch interior textur detail ey mouth human search engin match project imag boundari outlin outlin match interior detail sketch boundari hole project unexpect result return user problem rectifi provid user instruct exampl draw sketch determin present instruct provid imag match method minim user guidanc topic futur studi queri interest method queri descript retriev model object consist seat equal length cylindr leg attach bottom side corner back seat width match approach captur class object compact descript al witkin al match index work type shape match problem compar interest match partial object find car citi scene find hood acm transact vol search engin model match algorithm attribut includ anim model futur model system integr match retriev method interact sketch tool model synthesi paradigm user draw rough sketch desir model system suggest match detail part retriev larg user retain creativ control model system perform tediou task requir provid model detail interest queri index method paper mechan molecular biologi expect retriev analysi model import research area comput graphic paper make small step direct acknowledg bernard adam provid comment insight write paper cooper brian kernighan student search engin viewpoint jose maria de donat commerci polygon model experi nation scienc foundat provid partial fund project grant armi research organ provid partial fund grant thoma partial support alfr sloan fellowship refer optim geometr histogram proc hand discret geometr survei tech rep institut comput universität berlin structur imag restor deform templat statist shape histogram similar search classif spatial proc ssd nearest neighbor classif protein proc robust recognit scale shape geometr histogram proc applic fourier descriptor recognit object ieee transact pattern analysi machin intellig effici comput metric compar polygon shape ieee transact pattern analysi machin intellig object recognit imag review acm comput survei acm transact vol thoma al de la structur object match tech rep dept comput scienc spain februari repair cad model ieee visual parametr correspond techniqu imag match intern joint confer artifici intellig match shape iccv sand similar search cad system proc ed triangl primari object recognit comput vision lnc method registr shape ieee transact pattern analysi machin intellig object recognit comput survei robot vision comput vol visual percept comput ieee confer system scienc cybernet skelet method shape manipul proc shape model applic transform extract descriptor shape proc model percept speech visual ed mit anatomi hypertextu web search engin comput network isdn system imag search retriev digit imageri john wilei son object model registr multipl rang imag imag vision comput band volumetr method build complex model rang imag siggraph comput graphic annual confer seri de de model collect model render architectur hybrid approach siggraph comput graphic annual confer seri shape imag segment deform surfac imag vision comput spheric recognit curv object proc iccv pattern edit john wilei york content base retriev vrml object iter interact approach multimedia shape proc icpr vol queri imag video qbic system ieee comput overview audio inform retriev acm multimedia system fast polygon mesh queri siggraph technic object recognit role geometr constraint mit ma convert set polygon manifold surfac cut ieee visual acm transact vol search engin model topolog match fulli automat similar estim shape siggraph comput graphic annual confer seri extend gaussian imag proc ieee compar imag hausdorff distanc ieee transact pattern analysi machin intellig sketch interfac freeform design siggraph comput graphic annual confer seri lo recent progress vision comput vi imag understand approxim nearest remov proc stoc fast multiresolut imag queri siggraph object match deform templat ieee tran pattern analysi machin intellig effici multipl model recognit clutter scene ieee pami rand stochast model close boundari reconstruct ieee transact inform theori similar search protein proc geometr gener effici recognit scheme proc iccv affin invari object recognit ieee tran robot autom practic digit librari morgan kaufmann san ca contour shape descript base arch height function pattern recognit survei shape analysi techniqu pattern recognit perceptu organ visual recognit kluwer academ publish toolkit statist languag text classif cluster lexic english commun acm shape context enabl effici retriev similar shape proc cvpr tand consist solid boundari arbitrari polygon data siggraph symposium interact graphic hand visual learn recognit object retriev relat imag ieee comput match model shape distribut shape model canon perspect percept object attent perform tool shape manag sae journal aerospac solut physic base shape model recognit ieee tran pattern analysi machin intellig acm transact vol thoma al object survei recent research tech rep british columbia januari algorithm suffix strip program survei techniqu object recognit graphic model imag nation design repositori geometr intellig comput draw smart retriev experi automat document process chapter relev feedback inform digit librari displai intern confer digit librari metric distribut applic imag proc iccv smart retriev system englewood nj model retriev spheric harmon moment advanc geometr model featur extract rock bone queri internet comput applic archaeolog modal match correspond recognit ieee pami index spectral encod topolog structur proc comput vision pattern recognit vol shock graph shape match comput shock graph shape match int journal comput vision recoveri parametr model rang case global deform ieee transact pattern analysi machin intellig fast spheric model oper solid proc solid model retriev system polygon model joint world congress intern confer cursiv script recognit elast match ibm journal develop geometr invari comput vision mit chapter object recognit base moment invari dynam model local global deform ieee tran pattern analysi machin intellig wand attribut string match merg shape recognit ieee tran pattern analysi machin intellig polygon mesh rang imag siggraph comput graphic annual confer seri recognit alphabet sign languag size function proc iapr shape similar measur algorithm shape model intern imag video retriev kluwer academ publish acm transact vol search engin model viewpoint viewpoint corpor tool transform spheric harmon ieee workshop multimedia signal energi constraint model siggraph comput graphic annual confer seri recov parametr multiview rang data proc cvpr analysi techniqu biolog shape comput graphic imag process fourier descriptor plane close curv ieee tran comput interfac sketch scene siggraph comput graphic annual confer seri harmon map applic surfac match ieee confer comput vision pattern recognit acm transact vol thoma al acm transact vol
ML/1204 6 redund inconsist detect larg case base contact dr qiang yang qiang associ professor school comput scienc simon fraser bc canada msc concord pl suit ontario canada redund inconsist detect larg case base concord pl suit ontario canada qiang yang school comput scienc simon fraser bc canada august abstract dramat case base reason system commerci case base legaci system repres portion organ larg difficult maintain contribut factor case base larg unstructur repres natur languag text ad complex fact case base author updat peopl varieti knowledg make highli case base redund inconsist knowledg present method system maintain larg case base focu difficult problem redund inconsist detect problem deal case base discuss algorithm system solv problem abil knowledg acquisit problem paramount method express relev domain detect inconsist natur empir evalu system demonstr effect method larg domain case base reason case base manag knowledg base knowledg expert system contact author introduct case base reason problem solv knowledg techniqu gain rapid industri accept increasingli commerci industri applic solv case base reason recal previou situat similar current adapt solv current problem exist problem descript suggest mean solv warn user failur observ interpret current situat practic applic techniqu effect solv problem rule base expert system store entir case domain expert encod knowledg form languag exampl success case base reason desk applic domain compaq appli cbr system infer corpor system suggest repair printer exampl found cbr literatur problem inher reason mainten case base construct long period case solv approxim rang problem case author time case base result union smaller case result raw materi larg quantiti literatur compani case base chang time case fix type printer organ outdat compani acquir fleet printer replac case base error case base increasingli difficult detect result contradict inconsist case base problem potenti harm accuraci speed case base reason system reason contribut updat reorgan case base lifetim case base maintain task time case redund simpli power case case base identifi case decid elimin import case base maintain identifi suggest solut inconsist case case consist descript target problem solut case descript solut lead contradict solut case problem render case solut usabl user mainten system abil identifi inconsist case ad problem redund inconsist fact legaci case base consist textual data effici maintain updat case base remain open issu problem mainten akin softwar mainten softwar system major portion organ resourc devot entir life estim put effort percent total cost develop softwar life cycl conjectur amount effort experienc organ exploit case base reason system research attempt address aspect case base mainten problem aha present case base learn algorithm toler irrelev featur algorithm classifi attribut case case base concept descript train case predict attribut valu futur detect anomali fill miss inform work case base learn includ algorithm focu learn organ featur level provid mainten support case smyth kean suggest compet preserv delet approach classif made kei coverag reachabl heurist order provid delet case classif preserv compet case base expert system research develop framework detect anomali redund case base learn research assum knowledg base structur relat rule base format contrast previou focu case base case case base natur languag separ field case tackl problem case base mainten larg size maintain assum function life cycl case base organ main contribut consist link aspect case base mainten present method normal unstructur case base inform retriev techniqu explor redund inconsist detect algorithm oper larg case base algorithm case base stai compact improv effici effect reason valid power theori prototyp system show algorithm scale larg case base point limit suggest futur extens case base maintain design approach solv mainten problem larg legaci case base integr mainten system case base reason system system autom time consum task case base mainten discuss section block diagram system design case author shown figur current domin metaphor case base reason term manag direct manipul user requir event initi task suggest system design implement complementari style call indirect manag call mainten system agent indirect manag approach mimic interact indirect manag reason type manag appli case base reason system due natur domain case base reason lack domain model case base fulli autom manag system formal action perform compet case base reason indirect manag user ultim control autom time consum difficult section task redund test test inconsist add case ir case figur block diagram agent architectur case author order minim knowledg acquisit agent unstructur case process solut inform retriev base algorithm case mine kei word import kei word phrase unstructur text kei word phrase offer basi subsequ modul oper redund detect modul incom case inform retriev modul determin redund case exist case base redund detect algorithm reli success complet inform retriev modul order correctli identifi kei word phrase incom case detect redund case present user system suggest explain redund identifi user ignor warn delet case inconsist detect modul inform inconsist trigger case determin consist problem case suffici evid inconsist alert gener user action alert identifi case inconsist trigger involv inconsist occur case explain design main modul inform retriev modul inform retriev techniqu normal case appli preprocess modul transform unstructur case structur perform subsequ algorithm redund inconsist detect inform retriev techniqu successfulli appli case base legal domain larg architectur inform retriev system simpl inform retriev system consist set set queri similar mechan determin document satisfi queri typic difficult directli compar free form text similar mechan convert queri set inform item standard format case black tune local channel case problem problem tv cabl system case check electr tune tv set channel disconnect cabl problem tv set tabl case cabl domain case cabl black screen tune local channel case problem problem tv cabl system case check electr connect tv set channel disconnect cabl recept problem tv set tabl remov stop word illustr design work realist equip troubleshoot case roger vancouv call center appendix show exampl case domain shown tabl gener algorithm describ algorithm step step remov stop word step inform retriev algorithm remov stop word stop word word proven poor word add mean case stop word typic word document applic gener list stop word gener english languag smart system design salton list stop word edit user order special domain case base reason design printer user remov word kei word extract phrase stop word case tabl inform shown tabl step domain thesauru function word domain thesauru thesauru standard term case base reason design cabl failur reduc order facilit string match thesauru edit iter user familiar domain specif languag user thesauru step stem algorithm stem algorithm remov suffix prefix word case base stem reduc number distinct term improv retriev number stem algorithm vari remov prefix remov suffix plural word reduc stemmer typic case base case written present reduc amount type requir case author case base develop exist data full stem algorithm requir advantag stem algorithm reduc number distinct word stem algorithm reduc word word number kei word phrase identifi algorithm step invert index preprocess step applic gener invert index entir case base index simpli list term remain set weight document document number weight term document simpli measur frequenc term case measur inform statist import term invert indic inform reflect posit term case due fact applic develop handl larg case inform retain invert index larg step kei word index invert index step algorithm build kei word index invert function identifi term statist measur kei word word frequent small set case infrequ case applic document frequenc measur identifi kei word kei weight kei word document number kei word retain kei word index applic retain document number order facilit redund detect stage kei word file edit user creation user add delet kei word user add kei system identifi case word updat kei word file run user number kei word identifi minimum number document user provid number word number case document facilit threshold step kei phrase index applic identifi kei phrase invert index phrase group word high inter case word word high probabl phrase weight retain identifi phrase user threshold phrase power kei word add context statist approach inform retriev reduc number phrase identifi algorithm rel addit constraint word phrase kei word redund detect modul standard descript profil gener redund subsumpt partial identifi redund detect modul receiv case inform retriev modul case stop word term thesauru appli indic built approxim obviou instanc redund occur case ident string inform retriev techniqu remov stop stem reduc synonym assist similar case case interest situat occur case share similar case fuzzi string match algorithm match emphasi kei word case share identifi present user analysi appli trigram match algorithm identifi kei word string close trigram match pattern match algorithm queri retriev tm problem resolut advantag algorithm fuzzi match algorithm anomali word order partial algorithm algorithm divid string compar trigram length trigram found hit record result percentag trigram exist string total number trigram longer string algorithm toler spell error word order trigram match cabl comparison result match drawback trigram match case morpholog relat return high score semant part problem solv applic thesauru inform retriev modul subsumpt rule case redund subsum case subsum case remov case base affect compet case base reason system adopt uniform notat repres case case case repres set normal kei word kei phrase denot problem descript case element repres distinct problem keyword kei phrase troubleshoot case solut soni solut case sequenc step complet execut problem solv state rule inform case case case case subsum case case solv problem case superset solut case requir fewer step case situat subset case subsum case case redund subsumpt rule suggest redund algorithm algorithm design determin incom case redund case case base algorithm entir case base input determin redund exist case base appli nearest neighbor algorithm find case test candid set case redund case found nativ algorithm case base reason system larg case initi preprocess reduc set case worst case occur singl case exist case base involv redund relationship incom case number kei word index check number redund detect complex algorithm determin redund exist case ad layer complex worst case exist singl case involv redund relationship case call subroutin complex algorithm provid user explan case identifi redund user domain knowledg isol depend case origin case present user kei word exist highlight similar case consid candid notic user includ applic suggest algorithm reli threshold determin keyword extract case approxim ident threshold origin set applic default chang user domain redund remov decid delet subsum system user view case highlight unnecessari condit case incorrect outdat fact subsum case case delet case base simpli delet case identifi applic present case user assum solut length measur solut qualiti section domain measur solut qualiti cost solut case solut longer explanatori data extens subsumpt rule area focu solut length simplic case problem envelop jam laser printer due glue case normal envelop laser printer problem includ poor glue heat toler keyword envelop jam laser glue heat toler case problem paper continu jam printer due sticki intern case envelop work laser printer high heat melt glue keyword jam sticki envelop laser heat glue tabl detect redund printer repair domain reason believ subsum typic user applic familiar domain delet case offer inform extra offer valuabl inform novic user case subsum merg case redund identif modul detect case candid merg case offer solut slightli problem case note differ problem descript field consid system suggest state case essenti user case relax redund detect rule implement make practic comput relax relax aim cater fact case defin formal margin approxim left detect redund tabl illustr inform detect domain kei word extract step determin extent kei word match case case share threshold kei case consid redund tabl case case share kei word case kei word case share kei word applic initi set redund threshold threshold modifi applic signal redund case comparison kei word facilit kei word index develop inform retriev modul inform extract case order make process quicker case kei word check redund rule perform entir case content descript fuzzi string match case identifi possibl case entireti present user determin fact redund case remov case base user offer option edit case make distinct appar relat work relat work smyth kean method manag case subsumpt rule defin provid oper advantag smyth kean work definit span support case defin term problem coverag reachabl definit problem comput comput coverag reachabl case term incom problem queri subsumpt approach find redund comput coverag reachabl case user compar content case directli direct comparison enabl deduc case make case redund inconsist detect modul inconsist case base occur due conflict case content implicit background knowledg make background knowledg explicit step solv inconsist detect problem import issu repres consist knowledg knowledg acquisit problem case base reason system aim address place present discuss deploi solut detect inconsist case address knowledg acquisit problem identifi wai code knowledg domain method compil rule case base engin program languag function program languag code rule method effici rule difficult updat requir recompil time chang disadvantag case base reason rel power case base increment updat user requir collat inform domain prior develop system case base reason system flexibl updat recompil user system input rule option logic manner expert system advantag method rule recompil updat rule base expert difficult obtain maintain user system experi logic difficulti rule author inexperienc user typic find formul boolean rule index languag establish inform retriev decid string base rule repres inconsist trigger rule structur case index languag appli rule case base easier comparison rule close natur languag match underli case base string base fuzzi match algorithm method offer medium string base rule easi user understand easi expert suppli addit advantag string base rule easili modifi user case spell irrelev inform difficult word rule warn user inconsist occur call rule inconsist trigger inconsist trigger simpli contradictori combin kei word phrase conjunct word rule alert issu user inconsist trigger express conjunct set kei word phrase fk kei word case base inconsist trigger domain inconsist trigger trigger explain line printer combin word case rang inconsist defin rule refer adjac constraint inconsist trigger channel string base inconsist detect examin invert index incom match kei word trigger word inconsist trigger detect case flag possibl trigger inconsist case examin determin adjac word inconsist trigger word locat word directli test determin number greater chanc contradict report user word inconsist trigger case case descript remain case inconsist trigger turn case word inconsist trigger threshold number inconsist trigger set alarm case inconsist trigger present user inconsist strategi detect inconsist similar detect inconsist inconsist occur case merg contradict due composit inconsist identifi ffl repres case base fc jc jcj ng ffl repres set inconsist trigger fr jr jrj ng ffl repres set kei word ffl identifi inconsist inconsist inconsist trigger union kei word case superset kei word inconsist trigger simpli case union kei word superset inconsist trigger combin word inconsist trigger found union inconsist trigger set case composit occur field problem descript solut word descript field case word inconsist trigger solut field inconsist trigger satisfi case combin inconsist detect algorithm detect inconsist requir background knowledg form inconsist trigger inconsist trigger consist imposs anomali rare occur case base reason gener appli poorli structur understood domain inconsist trigger enter time user person familiar system receiv feedback user ad inconsist trigger easier soft hard model inconsist trigger provid line printer hard constraint line printer cartridg combin word exist adjac warn issu trigger set organ index similar kei word index term trigger set inconsist trigger term note inconsist trigger list term document inconsist trigger index store hash tabl delet retriev term effici inconsist detect algorithm step send incom case inform retriev modul step match kei word incom case inconsist trigger trigger set inconsist trigger index case problem laser printer print page black case laser printer print page reprint turn laser printer press button printer requir remov paper trai inconsist laser printer tabl normal case inconsist trigger satisfi kei word match inconsist trigger exce continu step word inconsist trigger adjac case signal inconsist case field attribut partit case content exampl case field problem step extra condit kei word adjac enforc heurist kei word close chanc true inconsist larg kei word chanc inconsist small analyz complex defin trigger trigger kei word case compar trigger worst case turn trigger complex algorithm simpli size trigger set size case larg case base complex inconsist detect algorithm smaller complex redund detect modul illustr applic algorithm inconsist trigger detect inconsist incom case inconsist trigger turn illustr tabl step incom case case illustr tabl kei word repres page paper laser retriev kei word index inconsist trigger kei word exit kei word phrase inconsist trigger algorithm proce possibl inconsist word inconsist trigger proce inconsist trigger turn end algorithm step term field unrel step determin term close term determin posit occurr laser printer posit problem descript case solut field word seventh posit case solut field user adjac posit repres field term user adjac posit repres field posit term field term trigger case case deem inconsist case maintain word field adjac threshold finish step word threshold alert user inconsist displai user analysi inconsist detect modul design similar redund detect modul algorithm ident inconsist detect modul reli inconsist trigger index threshold equal redund detect modul reli kei word index threshold initi set inconsist trigger index repres hash tabl facilit delet retriev term index assum inconsist trigger overlap case turn larg number inconsist trigger worst case scenario algorithm incom case turn inconsist trigger trigger set scenario case turn inconsist trigger algorithm run linear time respect number inconsist trigger empir test implement mainten system framework tm system develop case base reason group simon fraser tm case base reason system implement simon fraser test aim establish valid approach case base mainten hope confirm experi inform retriev approach process unstructur case feasibl larg case base evid support base comparison cpu time case base size conduct demonstr accuraci kei word phrase extract algorithm redund detect modul capabl detect redund case case deriv sourc shown control experi redund case introduc result case discov agent justifi claim inconsist detect modul capabl detect inconsist string base inconsist trigger control introduct inconsist case gener test system test report conduct sun sparc workstat test inform retriev modul time number case size sheffield lisa collect censu data figur cpu time appli inform retriev techniqu test complet larg test file illustr inform retriev modul scale figur demonstr time cost normal case base time displai cpu time requir remov stop word stem appli user defin extract kei word phrase case build invert file structur inform retriev modul appli number case base type data case averag kilobyt size sheffield lisa collect abstract titl extract librari inform scienc abstract sheffield empir test prove inform retriev modul handl case size reason amount time test effici inform retriev test efficaci kei word phrase extract text file reason amount test accuraci kei word phrase extract applic challeng human inform text kei word phrase subject extract compar extract applic test import word queri case base develop case base reason group simon fraser roger vancouv canada appli actual case base design troubleshoot cabl tv inform retriev modul complet process ten subject involv experi text file provid roger cabl case subject requir approxim twenti minut extract kei word text file subject knowledg cabl consid expert rang familiar list provid subject show great overlap figur illustr similar kei word gener subject kei word gener case maintain similar measur exact match substr match case maintain perform term term repres subject includ word mark match final list kei word extract case base develop roger cabl automat gener kei word success domain kei word gener case maintain match kei word gener familiar domain list case maintain match term word provid subject limit domain comput experi roger subject domain figur percentag kei word match found case maintain test redund detect modul redund modul test incom case redund recal case normal ir modul case simpli ad exist case base case present user case conflict user determin case delet case base figur demonstr algorithm detect redund effici appli case author modul time tm system output flat file abil output cabl domain sheffield lisa domain sheffield lisa domain time magazin adult censu data vari case size constant case size time number case case figur cpu time detect redund odbc data base recent ad system test requir determin process time sql queri interfac add averag size case includ figur illustr rel perform redund modul depend number case typic case size case base largest number approxim check redund due small size case result present show redund modul scale larg case base effici case base kilobyt case longest period time test redund system perform redund test experi involv subject type case cabl domain subject requir input case submit ad case base approxim requir case enter redund subject inform case enter system tabl present result experi tabl demonstr efficaci redund modul redund case correctli identifi applic encourag statist case identifi redund fact redund case correctli identifi identifi identifi redund remain case correctli classifi redund mean case correctli classifi fuzzi string match determin redund posit threshold identifi redund modifi modif made number redund case identifi modul addit area improv case involv experi deriv sourc part futur interest result gener case author case author redund redund identifi identifi tabl qualiti redund modul time test inconsist detect modul perform inconsist detect modul depend trigger set efficaci modul depend qualiti trigger trigger set effici depend number trigger trigger set efficaci difficult measur real effici modul illustr easili test appli incom case case base entireti test inconsist detect modul number trigger time process trigger turn process stop case trigger present user user make requir process continu test case base inconsist trigger trigger render case inconsist gener trigger inconsist trigger long largest field case inconsist trigger automat deriv incom case substr case remov string append inconsist trigger substr consist string match order term random collect term case string illustr trivial gener inconsist case gener inconsist trigger includ string inconsist trigger violat gener inconsist trigger share term case applic process actual sampl case system gener inconsist trigger present tabl demonstr figur inconsist modul complet process kilobyt case forti inconsist trigger number figur reflect averag cpu time complet inconsist detect process trial complet variat trigger set sampl case case cabl screen black case problem screen sound channel snow pictur problem tv cabl system case check electr tune tv set channel disconnect cabl cabl problem tv set gener inconsist trigger inconsist cabl black screen electr connect tune tv set channel cabl recept problem tv set inconsist black cabl screen connect electr tune tv set snow pictur problem tv cabl system satisfi inconsist check electr connect tune tv set channel disconnect cabl cabl recept problem tv set tabl sampl case automat gener inconsist trigger size case ad remain constant trigger vari content trigger length trigger number kei word trigger share test case maintain time trial return similar result time number rule number rule small case kb larg case kb figur cpu time detect inconsist futur work manag research case base reason area high import issu knowledg acquisit cost maintain case base answer question case base mainten agent structur retriev import inform case base inform detect redund inconsist case experi strongli approach address practic problem larg size area futur work explor method dynam reorgan case base plan design organ agent futur agent dynam organ reorgan case base hierarch manner maxim usabl case requir frequent basi quickli access case base reason organ life time case base case infrequ rank case base declin acknowledg david edward kim philip wl valuabl comment author support grant natur scienc engin research council canada nserc industri chair bc advanc system institut canadian cabl lab fund refer aha learn algorithm darpa reason william frake inform data structur algorithm north jc smith combin autom text retriev expert legal advic law technolog verif valid semiform aaai workshop verif valid page janet kolodn reason morgan kaufmann san janet kolodn reason morgan kaufmann san david leak reason lesson futur direct aaai mit swanson problem applic softwar mainten commun characterist applic softwar mainten commun june mae agent reduc work inform overload commun martin osborn guidanc softwar mainten nation bureau standard special public washington mari dan lee compaq consum power ai ai ad preec methodolog evalu expert system expert salton mj mcgill introduct modern inform retriev comput scienc seri mcgraw hill publish shavlik find gene reason presenc noisi case boundari darpa workshop shimazu detect discontinu thirteenth nation confer retriev custom technic support ieee smyth kean rememb forget case delet polici reason system intern joint confer artifici watson case base reason overview uk workshop case base ian watson appli techniqu system morgan kaufmann publish qiang edward support interact problem solv case base mainten desk applic ijcai workshop practic applic august intern joint confer artifici ijcai
HCI/1205 4 decemb src research report verifi sequenti consist multiprocessor model check system research center lytton avenu palo california compaq system research center src charter advanc state art comput system basic appli research support compani busi object interest project span scalabl system distribut internet inform interact mobil src establish digit equip corpor test idea build hardwar softwar prototyp assess util realist set interest system complex evalu sole practic enabl investig properti depth experi short term refin design invalu long term advanc knowledg major advanc inform system includ person distribut internet perform complementari work mathemat charact li establish field theoret comput analysi geometr secur formal specif verif work explor ground motiv problem system research strongli commit commun test idea research develop commun lead improv understand research report seri supplement public journal technic note seri time dissemin recent research find seek user prototyp system common encourag collabor research verifi sequenti consist multiprocessor model check decemb comput corpor work copi reproduc part commerci permiss copi part payment fee grant educ research provid partial copi includ notic copi permiss system research center compaq comput corpor palo acknowledg author individu contributor applic portion copyright notic republish requir payment fee system research center reserv abstract memori model multiprocessor contract design programm multiprocessor sequenti consist memori model specifi total order memori event perform processor trace memori system satisfi sequenti consist exist total order memori event trace consist total order processor properti read event locat return write locat descript system typic number number memori number data valu shown finit paramet verifi sequenti consist gener system undecid observ system satisfi properti causal data independ causal properti valu read event flow valu write event data independ properti trace gener renam data valu trace written valu distinct causal data independ system properti logic order write event locat ident tempor sequenti consist verifi algorithm present model check algorithm verifi sequenti consist system finit number processor memori locat arbitrari number data valu introduct multiprocessor complex comput system multithread program run multiprocessor abstract view share memori memori model exampl memori model multiprocessor includ sequenti consist partial store order alpha memori model implement memori achiev protocol run hardwar complex aspect multiprocessor design protocol commonli refer protocol parallel program run system reli memori model import implement protocol correctli import commerci viabil protocol heavili make prone design error formal verif protocol detect error descript protocol typic number number memori number data valu verifi system arbitrari valu paramet undecid nontrivi system interact theorem prove approach verif approach autom typic term requir human approach model check system small valu paramet good debug techniqu find number error prior verif arbitrari paramet valu present automat method base model check verifi protocol fix paramet valu correct respect sequenti consist memori model sequenti consist memori model specifi total order memori event perform local processor total order processor order memori event occur processor trace memori system satisfi sequenti consist exist total order memori event consist local total order properti read locat return latest total written locat verifi sequenti fix paramet undecid wit total order global tempor order event system event logic order event occur run algorithm track potenti unbound histori run problem verifi system locat data valu sequenti consist present method check sequenti consist fix arbitrari correct method depend assumpt data independ properti causal observ protocol data data inject system initi valu store memori write perform processor read oper locat initi write oper wrote read properti data independ observ protocol examin data forward data compon system protocol behavior data restrict loss unambigu run written data valu locat distinct initi observ assumpt true system occur practic causal unambigu deduc associ read write data valu lead vast simplif task wit total order sequenti consist total order write locat virtu associ write event read total order write event extend partial order memori event read locat read event read written write event partial order put write event write event sequenti consist specifi total order memori event processor total partial graph memori event run condit run sequenti consist graph acycl show exist cycl graph impli exist nice cycl processor edg memori processor locat edg write locat impli nice cycl call nice cycl edg cycl memori system symmetr respect processor locat processor locat edg occur canon order nice cycl observ drastic reduc number cycl search final argu number causal data independ system occur practic properti wit write order locat simpli tempor order write event write event order occur call simpl write fact correct wit number system intuit explan time cach write privileg locat write privileg move cach time logic timestamp write locat order global tempor order show proof simpl write order correct wit memori system perform model check proof memori system fix arbitrari broken model check lemma check exist canon cycl rest paper organ section formal system assumpt causal data independ section defin sequenti consist memori model section defin notion wit constraint graph unambigu causal run section show search canon nice cycl constraint graph section show model check detect canon nice cycl constraint graph run memori system discuss relat work section conclud section system denot set posit integ nn denot set posit integ memori system number number memori number data valu memori system memori data read write event denot occur processor nn locat nm data defin set event number processor number locat number data valu nn nm set read event nn nm set write event set memori event set event set intern event memori event defin set finit sequenc event denot memori system regular subset sequenc run denot length element set indic memori event denot subsequ obtain project denot sequenc trace trace trace defin subset set memori event processor denot msg nm nm cach arrai nn arrai nm arrai nn owner arrai nm nn initi predic nn nm event cach inv cach cach exc cach cach exc owner cach inv owner nn append cach owner cach inv append cach inv owner cach cach msg head cach inv cach owner cach owner tail figur memori system set memori event locat denot set write event locat denot set read event locat denot memori system figur highli simplifi model protocol maintain cach coher singl node chip multiprocessor system system variabl owner event memori event intern event ack variabl owner explan processor input queue incom messag put type queue oper isempti head tail defin oper append defin queue msg obviou mean definit omit figur memori locat owner owner index processor event guard command memori event paramet locat data intern event ack paramet locat intern event processor state valuat variabl initi state state satisfi initi predic event enabl state guard guard command true state variabl initi initi state updat nondeterminist enabl event execut guard command run system finit sequenc event execut start initi state processor perform read locat cach request owner share access locat processor owner receiv share access locat request abstract owner model action ack send ack messag data locat temporarili set owner processor perform write locat cach exc request owner access locat processor owner respond send messag messag processor valid copi locat set processor read ack messag event note request block owner processor receiv messag locat set cach inv causal data independ formal assumpt memori system assumpt motiv observ memori system occur practic memori system data move data valu introduc initi valu write event memori system figur write event introduc fresh data system updat intern event ack move data read event read data present cach data read oper initi introduc write event formal state assumpt assumpt function init map trace function trace locat function satisfi assumpt call initi function memori system initi function model initi valu locat memori system remaind fix initi function init memori system properti control oblivi data valu cach line carri actual program data state bit record invalid mode action depend data cach line memori system shown figur predic involv data field cach line messag intern event system renam data valu run result run system run obtain data renam run initi valu write event locat distinct unambigu trace write event locat distinct initi write read event pair sourc write event compar data valu trace unambigu run unambigu trace unambigu function nm call renam function function memori locat data renam data function function extend sequenc natur state formal state assumpt assumpt trace unambigu trace renam function nm assumpt motiv handl data typic protocol assumpt syntact enforc protocol descript restrict oper variabl data valu restrict data variabl guard express intern event control express condit sequenti consist memori system sequenti consist memori model correct requir trace defin sequenti consist formal defin simpler notion trace serial maximum element set set nonempti lw latest write event locat occur write event write event lw trace serial locat sequenc serial read locat return latest write exist read locat write return initi sequenti consist memori model function map sequenc memori event processor total order defin sequenc sequenti consist permut condit satisfi sequenc serial sequenc permut sequenc event index move index permut respect total order permut sequenc serial run sequenti consist satisfi memori system sequenti consist run sequenti consist memori system figur sequenti consist sequenti consist run memori trace sequenc obtain permut sequenti consist order event event processor permut defin sequenc permut easi check condit mention satisfi order prove run memori system sequenti provid reorder memori event run reorder serial respect total order sequenti consist processor memori system paper data show sequenti consist unambigu run memori system reduct state formal theorem theorem statement trace sequenti consist unambigu trace sequenti consist case trivial trace assumpt unambigu trace renam function nm sequenti condit satisfi condit satisfi sequenti consist wit theorem state order prove sequenti consist run memori system processor locat number data prove sequenti consist unambigu run system reduc problem check sequenti consist unambigu run problem detect cycl constraint graph memori system fix wit map trace locat total set write locat total write event locat extend partial memori event read locat read event read written write event partial order put write event write event locat condit hold show partial order lemma lemma unambigu trace locat unambigu case immedi case definit total order total order transit lemma unambigu trace locat partial order show easi proof contradict assum perform case analysi result condit show proof contradict reason proof lemma obtain perform case analysi case case case unambigu total case symmetr case show transit lemma constraint graph unambigu trace total order definit sequenti consist partial order lemma union total order partial graph acycl condit trace satisfi sequenti consist defin function wit return function function map unambigu trace graph work gibbon defin constraint graph memori event run similar theorem unambigu trace sequenti consist graph acycl unambigu trace unambigu trace satisfi sequenti consist permut condit satisfi total order show permut linear vertic preserv edg show unambigu unambigu show case case impli case show impli show contradict trace unambigu contradict show contradict definit unambigu contradict acycl unambigu trace linear vertic respect edg satisfi denot show serial show case lw contradict prove contradict mean impli contradict lw show lw mean lw mean contradict lw simpl wit theorem suggest memori system prove sequenti consist produc show unambigu trace graph acycl construct wit left user argu simpl order write event locat order number memori system occur practic simpl trace locat memori system figur argu inform simpl wit good wit memori system permiss perform write flow cach mean messag note locat variabl owner set id messag gener messag receiv destin destin move exc state set owner destin id messag gener owner memori system properti memori locat held exc state cach write locat happen cach locat exc state cach perform write memori locat logic order write event tempor order simpl wit correct wit demonstr run sequenti consist memori system time processor perform write event simpl wit correct wit memori system occur practic properti section describ model check algorithm verifi correct memori system respect simpl wit simpl wit desir wit memori system design algorithm verifi correct produc error trace suggest user error memori system simpl wit correct wit method check sequenti consist sound argu complet system occur practic nice cycl reduct memori system wit unambigu trace begin quest method detect cycl show detect special class cycl call nice cycl section reduc search cycl class canon nice cycl section show detect canon nice cycl perform model check fix symbol denot addit addit group element ident element cycl sequenc distinct vertic condit true edg belong relat processor edg belong locat definit impli cycl theorem graph cycl cycl cycl shortest cycl denot addit addit group element ident element cycl case definit contradict cycl made shorter case lemma contradict cycl made shorter symmetri reduct memori system symmetri argument reduc class cycl detect constraint graph cycl edg edg processor locat edg potenti occur order yield set isomorph cycl memori system symmetr respect processor memori locat presenc isomorph nice cycl impli exist nice cycl edg arrang canon order search cycl edg canon order discuss processor symmetri section locat symmetri section combin processor locat symmetri demonstr reduct nice cycl canon nice cycl section processor symmetri permut nn function permut processor id event defin function extend sequenc natur assumpt permut nn trace memori system trace argu inform memori system figur satisfi assumpt oper perform action state variabl store processor id symmetr state system denot state obtain permut valu variabl store processor id action state yield state action state yield state run construct run system symmetr model variabl processor properti processor symmetri construct lemma state sequenti consist memori model symmetr respect processor id state event trace order sequenti consist remain order permut processor id lemma permut nn trace lemma state partial obtain simpl symmetr respect processor id state event locat order trace remain order permut processor id lemma simpl wit memori system permut nn unambigu trace definit case locat symmetri permut nm function permut locat id event defin function extend sequenc natur assumpt permut nm trace memori system trace argu inform memori system figur satisfi assumpt oper perform action state variabl store locat id symmetr state system denot state obtain permut valu variabl store locat id action state yield state action state yield state model variabl locat system properti locat symmetri construct lemma state sequenti consist memori model symmetr respect locat id state event trace order sequenti consist remain order permut locat id lemma permut nm trace lemma state partial obtain simpl symmetr respect locat id state event locat order trace remain order permut locat id lemma simpl wit memori system permut nm unambigu trace definit case combin processor locat symmetri fix symbol denot addit addit group element ident element cycl canon processor edg canon nice cycl arrang order processor id locat edg arrang order locat id theorem claim constraint graph run nice cycl run canon nice cycl theorem simpl wit memori system unambigu trace graph unambigu trace canon cycl cycl permut nn map assumpt trace permut nm map assumpt trace lemma lemma lemma lemma canon cycl theorem easili combin yield theorem corollari unambigu trace graph simpl canon cycl trace sequenti consist model check memori system present model check algorithm determin trace automaton constrain state initi state accept state alphabet transit automaton constrain state initi state accept state alphabet transit automaton check state initi state accept state alphabet transit err figur automata detect canon cycl graph simpl canon cycl corollari verifi sequenti consist memori system model check lemma fix symbol denot addit addit group element ident element model check algorithm make automata constrain automata check automata shown figur automaton refer variabl repres state automaton model check perform system obtain automata memori system defin regular languag accept automata formal order tupl set denot set obtain compon set denot set set denot read event write event processor locat data simplifi notat denot set memori locat automaton constrain constrain write event locat constrain accept sequenc write event locat data write event locat data write event locat data automaton constrain accept sequenc project alphabet nn satisfi regular express nn nn nn constrain accept sequenc write locat data automaton constrain accept sequenc project alphabet nn satisfi regular express nn automaton check automaton check accept trace event processor occur event locat data event locat data event requir write event data check order check canon memori system constrain check model checker determin result system trace initi memori locat figur canon cycl accept run system event arrang shown figur yield canon cycl processor locat suppli event event mark denot valu event edg label due total order sequenti consist event processor edg label due partial order simpl wit event locat edg sourc event label sink event label run write event locat occur write event occur write event simpl partial order event label event label event denot order event denot uniqu write event locat data order event event order event denot intuit argument canon cycl construct run system theorem prove check system run theorem canon cycl simpl unambigu trace trace constrain check canon cycl graph definit uniqu write event set data valu written write event locat function index uniqu write event locat data defin renam function nm split definit case assumpt trace locat write event initi data write event data write event data locat write event data constrain show check show condit hold definit simpl wit case check trace constrain check automaton check enter state time observ enter state err time observ assumpt unambigu trace renam function nm show canon cycl show properti constrain case definit constrain event constrain accept trace singl write event label definit constrain canon cycl give illustr method section memori system figur sequenti earlier version error assign owner miss guard command action model system model check system configur processor locat model checker error manifest check exist canon cycl initi predic strengthen conjoin nn nm strengthen ensur trace examin initi locat automata constrain constrain check check figur system analyz model checker erron behavior system start initi state cach line state owner owner execut sequenc event owner inv exc processor share ack messag locat note erron previou version event set owner owner event ack processor locat happen event share ack messag processor event sit inv event gener messag processor locat event processor ack messag locat event insert messag locat messag locat event processor event exc processor write locat read locat send automaton check state err processor process messag locat event note processor process messag locat sit exc processor write locat read locat send automaton check state err write event data run accept constrain constrain note check canon cycl constrain state state check state constrain check memori system state system factor locat restrict write event data practic reduc set reachabl state relat work descript system number number memori number data valu specif system invari model specif verifi fix valu paramet arbitrari valu paramet contribut paper provid complet automat method base model check verifi sequenti consist memori model fix paramet valu describ relat work verif system ax mention number paper invari verif model check fix paramet valu mechan theorem prove arbitrari paramet valu method combin automat abstract model check verifi protocol arbitrari paramet valu mcmillan combin theorem prove model check verifi flash protocol arbitrari paramet valu limit approach explic formal connect verifi invari model protocol paper verif model systemat manual proof method theorem prove verifi sequenti consist arbitrari paramet valu approach requir amount part user method complet automat good debug techniqu appli method approach al hu requir manual construct finit state machin call serial serial gener wit total order run protocol model check system protocol easili check wit total order run trace serial memori idea instanc gener approach katz manual construct serial tediou case unbound storag requir work improv wit total order deduc automat simpl write order amount state add protocol order perform model check significantli ad serial approach model approach al check varieti memori model automat test sound incomplet sequenti consist method sound complet verif larg class protocol recent katz shown interpret sequenti consist finit trace interpret infinit trace condit system work orthogon combin verif sequenti consist infinit trace finit paramet valu put result paper perspect assumpt causal assumpt data independ critic result reduc problem verifi sequenti consist model check assumpt processor symmetri assumpt locat symmetri reduc number model check lemma exponenti read write event model atom event real read write event broken separ event request processor cach processor memori model includ sequenti consist natur specifi partial order request memori system servic processor request order order request order method paper identifi atom read write event case memori system servic request order handl paper model check algorithm paper sound complet respect simpl wit memori system lazi cach protocol correct wit simpl basic method paper data valu write constrain automata order write made written valu read lazi cach protocol properti extend method paper handl part futur work extend work handl memori model acknowledg point error earlier version protocol figur provid nice illustr method present report yuan yu model check protocol yuan yu provid extens comment earlier version report refer lazi cach acm transact program languag kl correct condit concurr object annual ieee symposium logic comput page aron timestamp histori variabl verifi sequenti consist lectur note comput scienc page wood multicast coher method multicast address network annual intern symposium comput architectur la scalabl architectur base annual intern symposium comput page ieee comput societi em clark ea emerson design synthesi synchron skeleton tempor logic workshop logic lectur note comput scienc page em de kl la ness verif cach coher protocol ifip intern confer comput hardwar descript languag page ae aj hu automat verif sequenti consist acm symposium parallel algorithm page alpha architectur alpha architectur refer manual digit delzanno automat verif cach coher protocol ea emerson ap comput aid lectur note comput scienc page eriksson kl mcmillan formal verif method critic path system case studi comput aid lectur note comput scienc page pb gibbon test share memori siam journal katz extend memori consist finit prefix infinit comput kg larsen concur theori lectur note comput scienc page ta sk verifi sequenti consist multiprocessor system comput aid lectur note comput scienc page cn ip dl dill verif symmetri formal method system hennessi stanford flash multiprocessor annual intern symposium comput page ieee comput societi katz verif distribut program repres interleav sequenc distribut lamport order event distribut program commun lamport make multiprocessor comput correctli execut program ieee transact lamport tempor logic action acm transact program languag dl dill verif multiprocessor cach protocol simul relat logic formal method system hennessi cach coher protocol dash multiprocessor annual intern symposium comput page lazi cach distribut kl mcmillan verif flash cach coher protocol composit model check charm ifip work confer correct hardwar design verif lectur note comput scienc kl mcmillan formal verif cach consist protocol intern symposium share memori page rp formal design verif method share memori system phd rp approach verif formal memori model multiprocessor aj hu comput aid lectur note comput scienc page duboi approach verif cach coher protocol ieee transact parallel distribut park dl dill protocol verif aggreg distribut transact ta comput aid lectur note comput scienc page dj ae md hill lamport verifi directori protocol annual acm symposium parallel algorithm page specif verif concurr system cesar intern symposium lectur note comput scienc page dl weaver editor sparc architectur manual prentic hall lamport model check specif charm ifip work confer correct hardwar design verif lectur note comput scienc page
Agents/1206 1 secur commun secur electron commerc applic bart kuleuven belgium abstract electron commerc normal aspect daili life softwar agent technolog area electron softwar agent search lowest price bui good behalf applic involv number secur commun system applic solv paper describ commun secur ad lightweight agent framework secur electron commerc applic requir commun secur servic ad servic rst basi import enabl framework order secur electron commerc applic introduct monei import aspect modern societi confront kind monei daili life ordinari electron payment system nowadai commonli commerc electron peopl bui compact ight book music bought directli download digit electron transact execut web select enter credit card number payment mechan order pai concept softwar agent electron commerc autom task softwar agent peopl lowest price servic pai user applic involv electron sensit oper con inform number secur issu solv rst contribut paper area summar lightweight agent framework make suitabl secur electron commerc applic secur aspect respect electron commerc applic brie liu ye marketplac secur suppli lnai pp discuss background inform protocol provid commun secur impact java system secur aspect explain sect lightweight agent framework di erent approach provid commun secur comment achiev discuss sect relat work altern approach provid secur commun sect secur electron commerc applic give formal de softwar agent gener term piec softwar oper facilit task softwar agent learn travel comput comput call mobil agent agent electron number secur aspect aspect commun system applic secur commun secur rst import secur aspect commun secur messag exchang softwar agent softwar agent con sensit inform softwar agent owner detect messag tamper verifi commun messag receiv origin entiti commun infrastructur agent framework provid data con entiti data authent data origin authent data system secur mobil system secur import secur aspect agent travel host host protect malici agent agent consum host steal inform store host agent inform carri protect malici host possibl malici agent mobil agent complet trust advanc environ travel applic secur context commun secur aspect involv basic secur servic servic sucient electron commerc applic electron secur servic access control requir origin receipt ensur agent deni electron access control appli inform liu ye marketplac secur suppli lnai pp note di erent secur aspect independ commun applic secur commun parti cryptograph kei mobil agent carri kei commun applic secur servic complet depend level system secur provid secur commun secur socket layer secur entiti data data con level initi netscap commun version ssl number secur aw solv ssl ssl protocol adopt ietf transport layer secur work standard tl protocol minor modi cation ssl ssl ssl tl provid secur servic conceptu refer protocol tl protocol prefer ssl ssl discourag situat underneath applic layer secur commun applic commonli protocol secur commun web browser web server handshak protocol record layer protocol import part protocol record layer protocol commun secur servic symmetr kei cryptographi data con encrypt data authent ad mac authent foreseen record layer data compress compress algorithm de ned begin commun handshak protocol perform public kei cryptographi authent particip exchang cryptograph session kei encrypt calcul mac cryptograph algorithm negoti depend public kei infrastructur particip entiti kei pair certi cate addit import aspect trust issu particip entiti decid certi cate trust trust root certi cate certi cation author certi cate verifi certi cate secur distribut advanc world wide root certi cate ship liu ye marketplac secur suppli lnai pp java system secur java program languag develop sun java code run virtual machin virtual machin implement directli provid hardwar java card java easi learn work reason fact lightweight agent framework easi learn import aspect languag java secur sandbox model applet java code run browser run insid limit privileg le local hard open network connect machin origin download java piec code run border sandbox secur restrict piec code de ned di erent base digit sign code imposs java applic read content memori locat reserv applic java secur model partial solut system secur aspect softwar agent framework import aspect java program environ provis cryptograph function java cryptographi extens cryptograph servic import respect commun secur issu softwar agent framework secur lightweight agent framework focu paper secur commun secur lightweight softwar agent framework lightweight agent framework rst commun secur ad java librari discuss lightweight agent framework agent framework design implement sweden minimalist approach design goal small simpl framework easi learn time gener extens agent framework agent commun agent autonomi facil develop agent applic di erent kind agent framework agent send receiv act autonom system agent manag system agent track agent handl support agent autonomi applic basic includ show framework part import liu ye marketplac secur suppli lnai pp agent code extend section show secur ad ect agent applic system agent agent server socket socket system agent send receiv messag speci port case actual agent applic regist system agent send back messag receiv class handl commun agent di erent implement class implement perform commun standard tcp socket java librari commun agent agent framework socket base er servic secur framework implement java librari java implement ssl version tl version protocol oper top implement java cryptographi extens secur applic modi cation exist java replac occurr addit code ad set secur paramet socket secur commun secur ad di erent shown paragraph transpar secur rst secur ad complet transpar manner actual agent applic implement replac implement secur establish paramet store liu ye marketplac secur suppli lnai pp context class erent class server client pass open secur socket system agent agent server socket secur complet transpar agent applic note agent applic chang ideal situat agent applic setup secur er system secur interfac applic agent agent applic provid basic interfac setup secur paramet paramet setup method java store server client context context pass set system commun server context client context pass construct system depend agent server client context variabl remain system agent agent server liu ye marketplac secur suppli lnai pp socket secur paramet select cryptograph algorithm server certi server rsa public digit sign trust parti cation rsa privat kei belong rsa public kei certi inform decid trust note previou agent depend system secur paramet origin socket connect system share agent depend system agent comment achiev comment made respect approach present previou section secur commun secur address electron commerc applic secur system secur desir plai import role commun applic secur system secur server client system agent access privat kei kei exchang entiti typic kei store local encrypt symmetr kei deriv pass phrase advanc smart card agent manual start user type pass phrase unlock kei agent automat start kei store pass phrase hard code agent softwar clear link commun secur system secur agent dicult complet transpar set kei host part infrastructur mobil agent kei establish secur connect back origin host mobil agent host mutual trust agent malici host tamper host liu ye marketplac secur suppli lnai pp malici agent steal privat host kei mobil agent carri cryptograph kei host import problem agent protect kei malici host attack network discuss solut fall scope applic secur enabl softwar agent framework commun secur servic serv rst secur electron commerc secur involv cryptograph link system secur issu perform establish server client secur context requir lot time secur connect handshak overhead commun cryptograph secur perform compar origin framework give detail ection made normal workstat person encrypt protect authent messag notic perform connect system agent remain open period perform occur begin smaller commun frequenc high messag size larg small mobil due public kei cryptographi handshak primari goal framework import check primari goal framework small code maintain secur framework secur framework simpl easi learn code size small account complet cryptographi librari current code size exclud unnecessari algorithm util librari consid situat transport layer enabl clear browser web server implement part applic secur real applic situat top agent awar set secur omit complet transpar note complet applic decid trust liu ye marketplac secur suppli lnai pp achiev work paper commun secur aspect ad lightweight agent framework commun secur agent data data con sect import secur aspect respect electron commerc applic system secur applic secur mobil agent lightweight framework system secur aspect import note framework extend mobil java implement rst level system secur explain sect mobil system secur plai import role commun secur aspect agent cryptograph kei commun secur kei protect agent travel agent work agent cope applic secur time left develop agent applic note case mobil system secur import applic reason import commun secur relat work altern approach secur agent framework number altern agent framework aglet jatlit framework softwar agent speci featur origin lightweight agent commun secur import issu framework system secur host protect thought case mobil agent code digit sign order identifi access restrict assign agent base owner code execut secur execut environ mobil agent secur substanti amount work area mobil agent secur respect system interest solut present past protect host possibl malici mobil secur execut environ java lee altern approach host determin program code provid host safe instal execut dicult task protect mobil agent possibl malici host obviou solut requir agent critic run trust neutral server advanc techniqu agent run host liu ye marketplac secur suppli lnai pp schneier construct kei materi class data agent receiv encrypt decrypt condit true hohl creat black box origin agent black box perform work origin code minimum amount time requir attack gure agent vigna mechan agent cryptograph check agent correctli execut implement java librari java secur socket extens sun packag support due export download version encrypt canada export regul secur layer articl protocol chosen provid commun secur servic servic provid transport layer altern secur protocol framework provid case applic servic commun secur network layer particip host trust agent reli complet transpar commun secur servic provid infrastructur secur commun channel establish system messag exchang secur sycara approach de ning secur extens knowledg queri manipul languag languag framework construct agent messag standard secur integr commun secur ad applic agent subscrib system work di erent secur paramet cryptograph exist lightweight softwar agent framework enabl secur electron commerc applic framework provid agent commun agent autonomi facil develop agent applic java implement protocol secur commun facil commun secur import aspect softwar agent secur gener import aspect system secur applic secur system secur import mobil agent involv relev commun secur java system level protect liu ye marketplac secur suppli lnai pp host malici agent research area protect agent malici host work paper framework applic secur built develop secur electron commerc applic acknowledg work short research visit laboratori intellig inform system sweden rst author prof invit research group articl version paper publish workshop agent electron commerc workshop organ part confer intellig agent technolog hong decemb author valuabl construct comment refer dartmouth colleg dagent tl protocol version rfc secur standard virtual privat network kqml agent commun languag softwar agent secur agent societi acm workshop fraud trust agent societi time limit blackbox protect mobil agent malici host mobil agent secur lnc springerverlag java softwar ibm aglet lightweight agent framework interact applic fourth intern confer practic applic intellig agent network authent servic rfc stanford jatlit sun microsystem java sun java cryptographi extens sun java secur socket extens untrust agent code mobil agent secur lnc kei gener agent mobil agent secur lnc cryptograph trace mobil agent mobil agent secur lnc liu ye marketplac secur suppli lnai pp
ML/1207 6 evolv trade system christian laura robin depart comput uk advanc robot system superior itali depart automat control system uk abstract market trade genet program simpl relationship technic gener signal sell remain inact methodolog appli predict standard poor composit index potenti market system simpl system rule complex system result compar benchmark strategi trade system found capabl consist outperform benchmark complic addit difficult suscept overfit simpler robust chang market advantag opportun rich varieti train anticip subsequ system surpass benchmark strategi introduct paper present studi market trade system develop evolutionari algorithm explicit aim research develop simpl easi whilst outperform benchmark strategi result methodolog appli rule gener standard poor composit index background stock market predict present section motiv applic ea sever difficult problem section techniqu outlin select technic indic function discuss section describ gp technic implement attent paid choic fit function section assess effect methodolog applic past decad close price standard poor share index profit identifi valid test data set subject scrutini region index high low perform section initi futur develop background predict stock predict stock market behaviour difficult task market highli volatil process larg resembl random walk publish investig larg fail produc excess return simpl strategi controversi invest theori effici market hypothesi exist state imposs beat market stock market predict gener classifi fundament technic approach consid market whilst studi effect technic analysi base quantifi market whilst fundament analysi includ data relat market time compani prospect technic analysi attract larg trade past recent studi literatur support technic approach techniqu develop paper sole technic analysi easili extend cater fundament data type technic stock analysi base basic principl market action discount price move histori repeat tenet assum develop rule predict market behaviour technic analysi involv technic indic form combin current past price data popular indic includ move oscil variat indic develop attempt made predict rang tradit time seri approach artifici intellig fuzzi system artifici neural network methodolog main drawback larg tremend difficulti interpret result provid insight natur interact technic indic stock market fluctuat develop methodolog facilit understand market addit provid tempor accur predict potenti evolutionari comput ea recent potenti search engin trade system allen genet algorithm deriv trade rule standard poor composit whilst appli gp approach recent work oneil al adopt techniqu current work infanc note candid solut studi singl rule studi requir order reap full benefit evolutionari comput framework background studi technic stock analysi singl develop gp produc bui sell signal end dai trade invest close fix period approach outlin differ gp scheme trade rule identifi region market kei aspect work system design easili understand advantag rule period tune relev presenc chang market dynam trade system gp search engin minimalist approach choic gp function set termin set central aim work obtain rule readili understand logic structur number rule candid solut heavili oper function set rang indic termin set note search space configur express trade rule candid solut oper output indic raw index data evolutionari process indic combin form set candid trade system consist rule evolv select technic indic paper popular move averag ma technic indic averag segment data segment defin respect current dai oper act move window time seri common approach arithmet ten dai close price variat exist ma smooth devic identifi trend data note ma trend identifi begun ma work trend period market sidewai move ma shown perform poorli deploi condit type oscil construct ma build block length move averag crucial affect perform indic shorter averag identifi trend faster carri greater risk provid signal exist sensit trend insensit trader combin ma deriv trade signal work present gp length averag maximum limit combin interpret multipl ma addit select length gp free select region averag predefin window past data ma anchor current close price addit flexibl standard anchor approach repres subset total search space candid trade system consist multipl scope gp identifi support good combin ma market condit singl system system singl rule rule complic simultan support substanti market condit ma exist reli arithmet method averag linearli weight exponenti smooth ma investig literatur variat scope current pilot studi function candid system number rule strategi rule form consequ form tree function set defin pure logic oper termin set librari ma defin restrict region past data termin ma simpl move defin previou section paramet repres indic past data note return stock dai past termin set consequ trade signal mean bui sell remain market appli period past produc consequ candid candid ident chosen system state methodolog problem domain studi consid time seri close price standard poor share index period figur data undertaken data split distinct train test approach adopt fig standard poor index period popul trade system infer train set candid model result process valid data set check overfit data raw data input return trade signal constant period dai bui sell strategi adopt work size invest bui sell signal assum arbitrari profit made transact adjust account trade cost slippag trade cost defin whilst slippag set note trade cost individu specul higher assum slippag factor effect profit made transact execut trade subject delai begin transact previou dai close price total profit system sum adjust transact risk free rate return gener uncommit fund time signal profit fit candid solut discuss fit function gp search engin requir knowledg perform candid solut current popul order perform direct stochast search fit function area research tend profit made risk whilst larg depend psycholog investor omit studi perform assess pure profit prefer investor genet program techniqu gener pareto optim trade system fit function studi simpli summat adjust transact profit note receiv profit risk free rate order promot evolut activ system solut correspond neg approach attenu posit effect signal whilst approach regard result high risk high reward system dual test set implement detail number rule built candid solut initi popul tree restrict maximum number node repetit termin prevent tree built manner ramp strategi consequ gener rotat termin set select tournament tournament size work select individu subject genet oper order gener candid solut genet oper oper act tree binari crossov implement pair check made ensur result crossov valid mutat oper branch tree implement solut result initi perform trade system develop methodolog compar benchmark strategi trade label complex consist rule node present due size restrict complic trade simpl number node limit analysi system tractabl invest transact close fix period dai maximum invest time interest earn risk free rate averag dai rate deriv feder fund histor full invest made begin period close end period result result present tabl total profit produc strategi perform test data segment graphic depict perform system vari total trade period complex system simpl system bui hold train valid test total tabl profit made strategi time shown complex system figur simpl system figur evid evolv trade system capabl consist outperform benchmark strategi complic make substanti profit train data return poor perform valid test data set indic overfit complex system shown repres solut train valid data set simpl system unabl match complex system train data significantli robust chang market condit simpl system beat strategi test set trade system capabl major period valid set strategi mix perform trade system data set arisen fig perform dynam complex activ inact profit action fig perform dynam simpl system insuffici market featur train data period valid data major region test data visibl train data process requir varieti train materi warrant investig order perform complet assess market risk profil trade strategi account strategi make fix invest invest maximum invest lost averag daili invest calcul trade system develop assum sell short lead loss greater stake order provid measur risk system result shown tabl averag daili invest data set complex system simpl system train valid test tabl averag daili invest trade system system excess risk benchmark strategi futur work trade system present paper aim work develop effect system outperform benchmark high simplic transpar initi result import complex issu complex requir order gener excess whilst complex lead overfit balanc embrac requir transpar studi consid singl technic ma state indic strength weak predict capabl simplest form ma consid futur extens seek make technic indic complementari indic deem desir librari indic complex remain long combin indic remain tractabl choic indic prevent structur studi restrict extens develop provid extra flexibl whilst maintain tractabl fuzzif step replac crisp equal relat ma termin fuzzi counterpart applic methodolog market sourc form interest step deriv standard poor share index methodolog remain valid sector multipl market sourc predict singl index prove reward system yield highli limit technic indic hope simpl enhanc produc system capabl consist success benchmark strategi acknowledg paper product intern collabor initi summer school held greec author express involv summer special ryan set origin problem work evolv opportun attend author dept comput scienc liverpool dr paton superior anna prof prof prof fleme refer technic analysi edit chicago genet algorithm find technic trade rule journal econom simpl technic trade rule stochast properti stock return journal financ genet automat evolut comput program applic morgan kaufman publish optim evolutionari algorithm john wilei son chichest effici capit review theori empir work journal financ methodolog stock market analysi util rough set theori confer comput intellig engin predict stock market technic report seri sweden stock market forecast support system base fuzzi logic annual hawaii intern confer system scienc genet program mit press technic analysi guid trade method applic york institut financ technic trade rule european monetari system journal intern monei financ develop market time system grammat evolut gecco multiobject genet program nonlinear system identif applic late break paper genet program confer stock market predict neural network classif architectur confer intellig engin
HCI/1208 4 network file system roam user posit paper mobil comput david domain de bp le chesnai franc comput aim offer access user transpar manner realiz vision necessit improv server user termin interact client termin tightli reli inform server temporarili unavail mobil situat exploit inform server context coupl central server group manner posit present design network file system implement transpar adapt file access user specif situat devic network introduct vision comput todai challeng topic inform technolog realiz vision mean consum provid access inform wai effect exploit base network hardwar infrastructur enabl vision long full realiz open issu includ user interfac base speech vision make usag comput resourc closer natur human softwar environ applic deploi comput space work effect independ consum profil network protocol improv connect hardwar enhanc autonomi devic wearabl comput paper concentr issu enabl user access data provis network file system roam user system implement adapt file access user specif situat devic network surround user section present background work section discuss design network file system roam user section conclud stress kei requir system background offer network file system access file locat mobil concern studi usag laptop commonplac relev result includ work mobil file access access servic data wide area concentr inform access mobil client inform possibl intermedi proprietari proxi coupl client inform server comput space inform access inform share group mobil user locat commun rang wireless lan inform gather mobil devic user discov inform sourc travel benefit li improv perform standpoint time data transmiss rate wireless lan compar global wireless commun network inform access introduc xf fix lan give rise number effort wide area emerg system inform access context mobil comput secur issu wide accept depend user trust system result cryptograph domain offer number protocol trust network inform access usag mobil area carefulli examin comput commun afford devic preliminari design discuss investig trust data storag untrust server commun rang mobil devic issu set trust dynam group investig implement trust inform exchang devic capac remain open issu discuss exist number provid sound base ground offer network file system roam user compar exist solut differ design system system user seamless access devic account devic content local file system access trust mobil devic remot server core function system file access resolv trust file locat optim time resourc discoveri transpar adapt devic function accord local resourc cach optim memori energi consumpt rel mobil devic preserv integr privaci user data data consist minim resourc consumpt user eventu access fresh inform devic complementari account actual data manipul devic adapt size includ ensur softwar devic data format compat devic specif issu consid remaind assum inform deliv user manipul detail interest reader refer design grow interest refer ambient number scenario show expect benefit peopl term make life easier goal build network file system roam user enabl scenario motiv commonplac person travel number person comput devic mobil digit devic independ transfer data devic requir user demand user access person data retriev phone consult select devic common travel find comput resourc surround environ comput conveni situat compar travel person devic avail wireless network make transfer data devic achiev make comput resourc easier peopl enabl seamless access devic conveni situat attend meet car rout comput home itinerari comput give indic albert laptop access document relev meet edit document share meet eventu access user interest meet particip diari address book updat futur plan address phone number drive albert decid visit phone number dial comput car albert pass group mobil user inform server local storag local storag local storag pda transmiss encrypt pda locat servic local commun rang file file secur domain home server data access figur system overview seamless access kei function realiz scenario offer seamless access user person data data request user made access mobil devic possibl lead set interact comput resourc access local commun rang remot server solut concern li scheme combin resourc discoveri scheme resolv file locat file retriev protocol file locat includ address file home server extend local address file cach devic devic local commun rang identifi locat servic locat servic serv identifi comput resourc access mobil devic inform safe share identif reli tradit servic discoveri protocol combin servic identif secur domain secur domain uniqu identifi address home server store file system domain secur domain web server host inform relat project member share data seamless access realiz make address user file system store home server access secur domain mobil compon resolv file devic specif cach servic discov local commun file request notic context data dissemin updat locat user crucial user consist data version access version subsequ modifi author dealt data consist protocol lazili propag updat perform realiz seamless access user experi time differ greatli depend devic situat user request file retriev remot locat solut concern li exploit techniqu proven success enhanc time distribut file system prefetch locat servic servic enabl access share data local comput resourc benefit bandwidth potenti interest relat local resourc local memori possibl small mobil devic memori space balanc result energi consumpt due remot undertaken systemat depend depend kei requir enabl seamless access user data user reli facil confidenti integr data mandatori integr adequ cryptograph techniqu system user data access author user techniqu access transfer data local wide area issu minim resourc consumpt comput cost cryptographi potenti limit autonomi mobil devic examin solut base privat resourc consum public kei requir depend ensur user data spite includ temporari disconnect possibl initi mobil devic sake energi save network file system roam user enabl seamlessli access data trust share inform trust comput resourc user commun rang offer time vari consist view data design implement prototyp system aim fulfil refer wang network file system fifteenth acm comparison servic discoveri protocol implement servic locat protocol sixth open european summer innov internet futur comput scientif page chawath adapt network client variat activ lesson perspect special issu ieee person commun von zhao architectur robust system servic special issu comput network system direct comput eighth workshop hot topic oper system jensen secur sharabl file cach roam user ninth acm sigop european workshop challeng oper de kaashoek toolkit mobil inform access fifteenth acm symposium oper system simpl kei agreement dynam collabor group acm page zhao architectur persist storag page autom mobil comput sixteenth acm symposium oper system page satyanarayanan exploit weak connect mobil file access fifteenth acm symposium oper system page napster demer flexibl updat propag weakli consist replic sixteenth acm symposium oper system page satyanarayanan cach trust content ninth acm sigop european workshop challeng oper
AI/1209 2 probabilist framework reason simon kasif steven salzberg david waltz john david aha abstract probabilist framework reason framework clarifi technic merit limit recent publish mbr method design variant comput framework consist specif languag defin adapt notion relev context mechan retriev local learn procedur induc desir action context primarili focu action form classif base framework deriv analyt empir result shed light mbr algorithm introduc notion mbr discuss util learn algorithm provid perspect reason point view introduct reason broadli defin task decid action perform state queri action rang admit patient move posit catch prefetch page comput perform transact domain finit number state reason solv simpli retriev tabl state action domain feasibl reason form common approach reason data induc model data knowledg set rule probabl perform reason deduct probabilist infer approach set store experi basi answer queri newli encount state direct reason store memori reli retriev relev context encount event action perform interpol extrapol set similar instanc context substanti growth recent year scientif commerci potenti form reason rapidli expand paradigm perform infer data broadli refer reason reason successfulli number domain classif articl censu data softwar agent comput biologi robot diagnosi comput vision pattern recognit machin learn applic broad overview recent trend area refer section import defin unifi framework work standard compon mbr depart electr engin comput il depart comput john hopkin md nec research nj ibm tj watson research yorktown navi center appli research naval research washington dc unifi program provid basi theoret studi paper make small step direct paper outlin probabilist framework class mbr method emphasi point direct gener work gener reason task formal motiv method origin stanfil waltz framework clarifi technic merit limit origin approach paper larg number public form import shed light paradigm mbr framework gener definit probabilist mbr framework compon store exampl implicit base reason collect data point point binari vector symbol attribut discuss inform refer point instanc exampl user specifi probabilist model fit data specif includ set random variabl featur data user specifi set probabilist assumpt prior independ assumpt knowledg express network pearl provid graphic support complex probabl distribut difficulti step relat complex model user data librari model domain knowledg mbr system gener complet probabilist model fit model consist properti probabilist network induc model hidden variabl probabilist model defin adapt notion relev base data desir task achiev adapt distanc metric domain induc distanc adapt learn data modifi data item ad case system induc explicit transform data call mbr data instanc transform instanc includ attribut hidden data structur support effici retriev relev instanc mechan deriv transform space queri mbr system retriev relev context instanc similar local model construct set relev instanc relev implicitli defin learn distanc turn induc probabilist model mbr perform local learn small set relev produc local model answer specif queri local model perform local neural network learn method compon common mbr system familiar step graphic probabilist model defin relev context answer uniqu framework gener origin framework introduc aim goal develop set autom procedur standard compon build flexibl mbr system varieti exist softwar system probabilist graphic model packag provid effect procedur learn paramet model system code transform space induc model case transform straightforward gener formal autom transform model retriev relev open research question queri system local learn procedur local tree predict action relev context compon easili autom mbr paradigm gener probabilist framework overview broad captur extend exist algorithm framework clarifi analyz advantag similar function origin suggest variant exist literatur differ metric motiv defin give adapt distanc function begin tradit classif problem assum exampl point space dimens correspond natur featur point class label standard classif problem predict class unseen point perform classif standard method method adapt distanc instanc call modifi differ metric recal standard approach step produc class unseen instanc queri algorithm retriev set nearest neighbor adapt distanc function defin neighbor obtain class label set class label obtain previou step vote obtain final predict class label system reli weight vote obtain final analysi experi nearest simpl major vote defin differ valu featur fi fi fi fi fi fi fi fi ja ja figur mbr transform binari classif number number time occur instanc class number time occur class ratio empir observ probabl class featur jv defin distanc exampl sum differ featur suggest distanc exampl relat effect featur action case metric introduc stanfil waltz modifi variant introduc cost salzberg incorpor mbr system pebl vdm oper exampl discret attribut discret entri set discret valu inform class label cost salzberg demonstr pebl perform rel learn algorithm number practic problem relat mbr transform section present probabilist framework mbr show case studi definit distanc metric natur simpl probabilist model start simpl binari classif problem instanc classifi member class comput restat perform simpl transform space attribut transform convert instanc instanc jx jx store instanc instanc convert jy jy simpli seek nearest neighbor transform space reader easili verifi transform faithfulli model origin comput observ distanc instanc jp jx jy jp jx jy jx jy tupl fx tupl random variabl correspond input correspond class label transform impli techniqu transform event discret probabl distribut jx jx illustr figur transform transform jx jx similar express figur class variabl root causal network depend variabl repres leaf node leaf node class independ variabl class edg tree matrix condit probabl variabl class transform input space space number class dimens suffici transform valu probabl distribut refer probabilist mbr transform mbr transform probabilist framework mbr transform transform induc simpl probabilist model assum independ attribut user flexibl facil transform mbr transform induc simpl probabilist model graphic causal tree transform model assum independ joint probabl distribut variabl deriv transform section mbr model basi transform model illustr figur variabl figur defin domain augment automat construct featur combin featur valu correspond probabilist network comput directli network mention paper address automat deriv transform model primarili motiv practic probabilist mbr analyz perform suggest possibl autom transform mbr transform desir theoret discuss section gener probabilist mbr approach outlin gener complex graphic probabilist model includ hidden variabl paper topic probabilist mbr analysi vdm approach probabilist dont provid detail analysi gener probabilist discuss paper probabilist graphic model provid support ffl framework probabilist depend captur data typic code structur probabilist network structur paramet learn data structur includ hidden variabl number approach learn structur data ffl comput framework combin condit probabl algorithm advantag graphic properti model simplifi comput problem encount practic learn task ffl structur prespecifi model incorrect problemat aspect ffl comput requir fuse probabl answer queri complex model approach advoc probabilist model record probabilist depend variabl model perform predict inform comput network set construct featur learn method case probabilist inform record network case simplifi model data facilit effici infer probabilist mbr procedur simplifi assumpt made import observ match queri instanc place space probabl distribut illustr intuit gener framework model form causal tree defin binari random variabl figur probabilist model impli joint probabl distribut variabl simpl form factor jx jx jx jx jx jx reader refer detail inform comput statist advantag factor assum larg tupl form tupl defin attribut biolog cell binari random variabl correspond medic classif figur tree model assum joint probabl data tree shown figur refer model assum joint probabl data share structur necessarili condit probabl edg tree assum queri form partial tupl store predict distribut binari class variabl standard classif task framework probabilist network problem handl directli assum tupl evid probabilist network infer algorithm predict probabl distribut variabl infer algorithm gener network outlin algorithm perform optim model correct practic model correct model provid adequ perform predict task infinit amount data statist lack consist converg optim perform amount data probabilist mbr transform transform queri shown jx jx jx jx jx jx vector condit probabl class dimens result transform tupl space perform transform tupl match transform queri transform intuit similar motiv store depend attribut class store depend parent tree probabilist network terminolog assum parent class variabl variabl record depend suffici mention model correct benefit mbr transform time transform carefulli maintain abil learn correct classif imposs correct structur probabilist model complex domain framework suggest methodolog incorpor provid reason model domain expert initi structur probabilist model form set rule rule conjunct binari event impli binari event rule valid practic probabilist framework creat network binari random variabl hope record actual probabilist depend process prohibit condit probabl tabl exponenti number entri solut probabilist network primarili suggest methodolog approach assum causal network structur figur invalid independ assumpt made mbr show subsequ section mbr approach expand express learn capac model learn perform accur gener class problem origin probabilist model report analyt comparison mbr system call pebl probabilist method naiv bayesian simpl probabilist network figur refer naiv classifi nb paper advoc specif learn metric induc mbr transform consid transform illustr advantag techniqu easili tool mutual inform logarithm probabl case metric theoret properti case approach determin empir set point discret space form distinct cluster natur transform convert instanc compon vector cluster distanc standard deviat model implicit transform probabilist model set point distribut small number easili network framework captur natur distribut statist mixtur probabilist hierarchi complex probabilist model model includ hidden variabl model vari depend goal model produc mbr system solv problem case model induc transform adapt notion relev featur relev context action irrelev approach make defin dynam mbr transform static previou paper mbr transform typic implicit model induc subsequ retriev relev instanc retriev linear sequenti search parallel implement search mbr transform static fix classif problem fix make appli transform instanc store transform space origin explicit applic mbr transform lead substanti improv comput effici mbr retriev relev instanc advantag perform transform store transform instanc origin comput geometri techniqu perform fast approxim retriev nearest neighbor time logarithm number instanc numer data structur develop search instanc effici queri base tree framework techniqu find relev instanc logarithm expect time size transform note difficult defin effici data structur origin space attribut symbol transform highli sensit case highli dynam increment procedur maintain accur partit region algorithm case dynam make data origin form effici linear time distanc comput decid relev context theoret motiv mbr transform section make simpl technic observ motiv mbr transform context famili metric defin assum classif problem exampl label class featur class independ analysi trivial extend vector instanc discrimin function boundari defin log log log log discrimin function linear log probabl point linear discrimin class fact pattern interest implic mbr transform mbr learn simpl linear classifi standard neighbor algorithm achiev rapid converg rate linearli separ concept class analysi gener complex probabilist make strong independ assumpt intuit probabl distribut express network express product term involv condit probabl discrimin function linear function log make easi learn nearest neighbor method addit motiv provid analysi instanc binari vector observ mbr transform desir instanc close tend classifi similarli assum uniform distribut independ log log log log log log final log log log log log side equat side side correspond distanc instanc mbr transform distanc probabl class point similar transform log behav exampl tend classifi naiv classifi note network correspond simpl bayesian classifi studi machin learn literatur class featur estim jc train data point classifi jc maxim classifi evalu machin learn paper variat bayesian approach consid wide rang domain classic work bayesian classifi back year recent result naiv classifi machin learn commun found import note pebl comput statist naiv classifi train run time method summar statist simpl pebl part mbr classifi section show mbr conjunct probabilist model naiv classifi model expand capabl system accuraci empir studi empir studi benchmark describ number experi design understand rel perform characterist naiv classifi causal net pebl model pebl outperform simpl classif pebl inaccur transform section task incorrectli model mbr method provid comparison overlap metric count number featur mismatch initi rel select dataset california irvin repositori machin learn experi method treat featur valu valu number featur valu treat continu featur discret divid ten equal interv solv type problem analog predict behavior electron circuit base color resistor physic size system learn symbol valu correspond phenomena case letter recognit mushroom train algorithm test remain process repeat ten randomli chosen train set valu tabl repres averag ten trial test conduct strategi instanc test train instanc note iri convert data symbol attribut mbr transform tradit obtain compar accuraci tabl result uci highest accuraci boldfac nb pebl nn letter soybean iri promot mushroom perform pebl benchmark natur concept class perfectli understood data set dataset easi classifi make strong result primarili demonstr famili algorithm effect discret version standard benchmark deliv high accuraci protein secondari structur predict match exce accuraci carefulli tune neural network train turn artifici data gaug specif condit method outperform test artifici data section describ test compar perform nn appli artifici dataset section illumin clear strength weak simpl mbr method artifici concept class reason incorrect recov perform distribut distribut figur class distribut exampl uniformli distribut lattic correct classif instanc domain artifici defin dataset interest control natur distribut amen formal analysi section number basic function distribut data finit grid show rel learn curv pebl nb experi addit artifici data markov al report artifici gener data higher space set test consid point evenli space grid unit squar exampl class class distribut examin shown figur note classif method treat grid coordin arbitrari symbol featur knowledg underli euclidean space train algorithm fix percentag test grid point test measur gener perform entir popul train point randomli select uniform distribut figur show rel perform nn class distribut pebl nb interest note case class separ function nb converg accuraci train exampl section detail explan pebl nb show unusu behavior appli distribut nb accuraci remain train set pebl begin eventu drop instanc perform return level occur specif number point class class valu consid independ provid hint rel probabl class nb guess correct class pebl advantag fact assign distanc sampl size point assign distanc due imperfect sampl train set size begin pebl accuraci pebl nn pebl nn point train pebl nn point train pebl nn figur compar accuraci pebl nn similar function emploi pebl eventu assign distanc point point class distribut includ train set pebl guess correct classif explain pebl accuraci begin degrad train set size point figur show nn overlap metric produc poor accuraci proport train set linearli naiv classifi linearli separ concept section present theoret perform nb pebl result appli learn algorithm focu result provid substanti intuit rel strength weak pebl comput similar versu naiv comparison interest emploi independ assumpt naiv comput requir learn ident section note converg accuraci classifi train entir space exampl make independ assumpt reason pebl obtain make assumpt analyz abil nb learn concept class discrimin function form ax easi show separ form rectangl separ diagon origin point nb converg featur depend prove discrimin function unit squar ax nb converg accuraci illustr linearli separ concept class discrimin function ax show nb converg accuraci assum point unit squar ax class point class loss assum note point classifi nb class condit make common independ rule rewrit equat perform calcul appli equat yield express naiv classifi point wrongli classifi wrongli classifi true class boundari classif boundari figur failur naiv separ class separ ax rang substitut equat classifi bayesian classifi converg accuraci consist result section condit classifi function plot figur origin function show bayesian classifi make mistak integr differ function function predict converg nb limit exampl lattic verifi similar analysi function predict error rate observ earlier section theoret analysi section provid analyt analysi power obtain mbr transform section show mbr transform obtain learn larger famili function learnabl naiv mbr irrelev noisi attribut address learnabl provid observ util mbr context irrelev noisi attribut reader observ discuss previou section mbr perform process similar attribut symbol attribut cope irrelev attribut instanc case class grid defin point separ plane case attribut irrelev exampl sampl uniform kn exampl small constant coordin grid observ approxim time high clear converg rapidli exampl line point class mbr transform map converg function convert instanc line instanc line stronger result deriv show good small number exampl probabl error classifi difficult show exampl ffi argument trivial hold case relev attribut irrelev attribut grid number exampl achiev case ln constant depend linearli standard nn algorithm requir exampl converg rate nearest neighbor vote procedur similar argument made attribut includ uniformli distribut gaussian inform discuss suggest mbr transform cope irrelev noisi attribut symbol discret space worst case converg procedur includ mbr dimens exponenti slow point domain model accur learn rate improv dramat learn function section concept class naiv classifi pebl difficulti learn poor perform naiv classifi pebl similar difficulti learn famili concept class question statist limit finit case system produc correct classif obviou classifi achiev classif accuraci exampl fact show pebl learn concept provid class separ function recal algorithm treat input arbitrari symbol featur knowledg underli euclidean space standard nn converg proof immedi applic case theorem address issu condit consist limit finit note theorem learnabl address issu make standard smooth assumpt discrimin extend consist result prove learnabl type analysi scope paper theorem finit grid concept subset assum separ function function region function iff iff classifi achiev accuraci limit proof contradict assum point pebl classifi incorrectli distanc impli point distanc definit mean jp jp set set subset size size size set size set equal member member consist theorem basic show algorithm learn concept separ function gener theorem easili concept class grid multipl dimens difficult deriv equal gener condit achiev consist technic detail complex boundari function dimens necessarili attain accuraci extend discuss easi learn linearli separ concept multipl dimens goal establish condit classifi achiev learn accur gener famili classif task origin model induc transform classifi rare observ view limit naiv classifi learn linearli separ concept exampl natur question converg rate limit class point speed finit sampl converg rate irrelev attribut show worst case behavior similar standard exponenti slow exampl sampl uniform distribut naiv learn impli learn decid investig concept bayesian classifi obtain accuraci pebl simplifi situat exampl concept show finit pebl achiev accuraci naiv achiev accuraci proof straightforward theorem finit domain bayesian classif rule achiev accuraci pebl program achiev accuraci limit classifi domain nb classifi point point class true order nb classifi point correctli pebl classifi point point find point nearest distanc point classifi correctli point label distanc explain distanc comput jp jp jp jp assum point distanc term class bayesian classifi classifi correctli substitut contradict point class distanc point class summari relat research issu address paper probabilist model relev broad address inform pattern comput vision natur languag process induc distanc metric judg relev complex probabilist model data basic research topic reader refer broad overview relat research topic imposs refer potenti relev paper mention work relev comput framework translat similar data instanc closer train set consist protein face similar problem determin function similar base sequenc protein structur chang replac amino acid amino acid biologist produc mutat matric captur notion kei technic question learn distanc metric data option partial model provid domain issu larg number question address statist research relev result method singular princip compon factor analysi vector quantiz notion relev similar specif task substanti literatur axiomat definit relev similar reason root work date back begin comput method recent earliest algorithm properli class mbr method date back work applic local regress set nearest techniqu kernel regress good histor collect algorithm dasarathi refer back local model function estim smooth mbr framework atkeson al includ review literatur varieti result learn algorithm kernel densiti estim window broadli defin area statist reli memori perform learn estim probabl distribut techniqu wide statist pattern recognit term reason broad context introduc stanfil waltz introduc differ metric defin similar featur vdm adapt distanc metric adjust retriev section method partit data region tree tree defin relev local neighborhood view tree classif devic mbr tree defin static partit space region distanc data instanc group region leaf defin queri retriev point relev region tree point distanc queri point perform local learn region prune tree necessarili label class label tree view compact express probabl method consid variant probabilist mbr framework natur languag process find similar notion defin verb probabl distribut set noun follow verb map point space similar verb comput comput distanc probabl distribut rich theori studi refer inform geometri comput form reason popular theme applic charact recognit face recognit notion prototyp object defin vector distanc object object map probabl distribut distanc object determin comput standard distanc space probabl distribut relat notion idea radial basi function defin cluster instanc work reason perform complex visual task object recognit clutter environ navig inform find recent network notion relev document topic queri notion retriev relev context document relat work recent paper econom introduc notion util action state comput kernel densiti estim techniqu set store memori recent work statist gener tradit nearest neighbor learn adapt neighborhood techniqu issu find correct neighborhood queri classif task collect vapnik group introduc theoret notion local learn correspond learn local function point queri framework reason framework advoc synthesi reason algorithm base probabilist model model domain model induc notion relev domain paper classif queri desir action retriev relev neighborhood induc perform action local learn set instanc neighborhood definit relev neighborhood adapt chang vari depend desir action analysi consid popular class mbr procedur induc simpl network naiv show mbr greater capac probabilist model induc transform gener task comput similar mbr bayesian classifi displai strike differ classif accuraci appli symbol domain demonstr naiv model induc mbr outperform naiv wide rang includ case instanc respect featur simpl domain previou work demonstr effect class mbr procedur complex scientif domain instanc complet fill show naiv learn distribut system pebl learn perfectli naiv perform perfectli simpl class pebl achiev perfect accuraci wider rang class establish advantag classifi symbol discret attribut show cope irrelev noisi attribut converg rate accuraci standard nearest neighbor number irrelev attribut larg import converg rate depend number relev attribut introduc notion explicit mbr transform data transform induc probabilist model form probabilist network explicit data spatial data structur facilit effici retriev left process build gener system base framework system provid program notat gener probabilist probabilist model automat mbr transform base probabilist retriev relev final predict local learn framework open door number variant mbr explor literatur elabor approach suggest gener incorpor reason procedur advic case correspond set rule induc structur probabilist network learn procedur estim condit probabl learn data learn network induc mbr transform map data probabl distribut space probabilist network comput set probabilist includ subsequ mbr infer perspect suggest interest possibl suggest possibl provid approxim abil comput probabilist featur reli mbr infer simplifi independ assumpt made model framework suggest interest cognit explor reason desir properti plausibl form cognit activ paper practic aspect advantag probabilist model build suggest method improv capabl accuraci acknowledg part develop mbr framework author visit nec research institut princeton preliminari experi pebl conduct john john hopkin support part nation scienc foundat grant refer aha special issu lazi edit collect artifici intellig albert learn algorithm machin schaal local weight learn artifici intellig schaal learn control artifici intellig aoki converg question bayesian optim problem ieee tran automat albrecht werner error analysi statist method ieee transact inform bentlei binari search tree associ search commun heckerman reason ieee transact man cybernet bottou vapnik local learn algorithm neural comment accuraci statist pattern recogn ieee transact inform independ measur recognit accuraci ieee transact inform waltz trade mip memori knowledg engin commun clark niblett induct algorithm machin cost salzberg weight nearest neighbor algorithm learn symbol featur machin editor nearest neighbor nn pattern classif techniqu ieee comput societi lo duda hart pattern classif scene analysi edelman similar prototyp mind friedman flexibl metric nearest neighbor classif technic stanford statist novemb theori technic northwestern holt simpl classif rule perform commonli dataset machin hasti tibshirani discrimin adapt nearest neighbor classif technic stanford statist decemb hugh accuraci statist pattern recogn ieee transact inform rapid gener mutat data matric protein sequenc kruskal scale sage lauritzen em algorithm graphic associ model miss data comput statist data page langlei iba analysi bayesian classifi proc tenth conf artifici page menlo aaai press mae learn interfac agent proc eleventh nation conf artifici page mit press waltz classifi stori memori base reason page pm murphi uci repositori machin learn data repositori maintain depart inform comput irvin anonym ftp directori ea estim regress theori probabl omohundro effici algorithm neural network behavior complex page omohundro construct algorithm technic report intern comput scienc pearl probabilist reason intellig system morgan pazzani averag case analysi conjunct learn algorithm proc workshop machin page lee distribut cluster english word proc meet assoc comput page quinlan program machin learn morgan kaufmann san aha understand bayesian classifi proc eleventh conf machin page juli rm royal class nonparametr estim smooth regress function phd depart stanford salzberg cost predict protein secondari structur algorithm journal molecular dj ap sl rg bayesian analysi expert system statist tree fit cluster page stanfil waltz reason commun turtl bruce croft evalu infer retriev model acm transact inform statist analysi finit mixtur distribut tverski featur similar psycholog valiant theori learnabl commun vapnik bottou local learn algorithm pattern recognit depend estim neural waltz hybrid system protein secondari structur predict journal molecular yi lander protein secondari structur predict method journal molecular
Agents/1210 1 team descript simul team page team chee peter justin system depart busi abstract articl present approach robocup simul leagu challeng introduct robocup simul leagu uniqu domain experi research interest complex task complet commun interest articl present approach robocup simul challeng section introduc agent architectur section present approach attempt solv problem task complex restrict commun section describ machin learn approach section conclud agent architectur agent architectur variant bdi architectur bdi agent base core data belief desir intent plan pl agent denot definit belief state agent consist descript agent environ set denot agent plai domain theori denot agent belief state environ denot collect sensori paramet includ posit move stationari object time inform accuraci skill set denot repertoir action agent skill incorpor atom action kick turn complex skill make skill set action execut plan execut domain theori describ action affect state environ casual rule determin effect action state environ specif action map state environ definit set desir agent consist categori desir desir exist instanc select desir deriv compon agent definit intent repres set intent result singl desir agent decid pursu intent tactic reactiv agent intent ta intent share common trait impact game limit relev base trigger deriv directli occur intent expect impact game tend impact game longer period base partial trigger trigger influenc ta intent deriv compon agent mention desir trigger plan plan librari pl definit plan librari pl collect plan plan denot pr po describ postcondit execut plan action form plan bodi compil set frequenc success plan learn implement plan librari element assum multipl plan match gener select plan base success match precondit success plan librari split prioriti level level assist plan interrupt recoveri plan higher prioriti interrupt plan lower prioriti plan select expir time assign plan plan agent hold current plan execut higher priorit plan complet agent recov previou plan complet expir time time plan discard team coordin commun approach team coordin implement agent team adopt concept mutual joint goal joint intent dynam role assign team plan definit team repres set finit individu agent definit social structur repres agent belief belong social structur defin tidhar denot pair command control team denot st denot command team ta denot control team distinct command control team agent perform st ta function function agent leader leader agent charg agent behavior major st compon author leader team goal central leader ta compon distribut equal agent unlik st commun ta concern individu agent contribut team goal ta account team goal ta consid compon agent handl team intent ta commun turn commun team synchron movement player st hold concept social structur agent command command ta adopt role coordin approach dynam assign denot task group theori multipl encapsul limit number agent involv limit level individu task group receiv task agent initi captain initi captain assign task task group transfer task group captain goali permit result adopt desir simultan adopt social structur coach top captain goali agent structur coach varianc bdi agent start coach plai import role make type strategi deploi composit initi team plan librari similar room agreement due time limit number team plan team team plan similar make agent plan team plan librari select base success frequenc coach analyz determin plan fail make modif extrem case gener team plan plan upload player initi start agent team leader captain team leader goali game captain goali assign agent task group leader agent request join task group task group consist member task group leader remain member captain goali leader team exist leader exist instanc agent assign perform function similar command team control team mention agent start intent encompass task group coordin member task group individu agent reject request join task group current task group high prioriti member join task leader inform member task group synchron element expir time reliabl element retain task group member retain leav task group agent leav task group leader team inform task task group task assign group task consist team plan defend part field expir time complet task task leader request time task deem failur task group member return captain team goali team approach reli heavili agent adopt concept ad hoc network overcom limit broadcast low bandwidth commun channel larg part behavior effect commun order leader coordin agent messag pass rang soccer field agent insid broadcast radiu uniqu domain appli current research area network network wireless network consist multipl mobil host form dynam temporari mobil network situat sourc host send packet destin broadcast packet host broadcast rang host forward packet reach destin learn approach learn layer approach learn agent plan librari compon team plan level coach mention robocup environ interest rang challeng domain approach develop bdi team util network assist implement program approach refer db ad hoc network mobil ieee workshop mobil comput system decemb preliminari tech rep australian artifici intellig april mp theori intern confer system san decomposit dynam role assign strateg cf cf bdi effect approach intellig search world wide aaai spring symposium intellig stanford march
Agents/1211 1 gener context agent control thoma wagner victor lesser comput scienc depart massachusett umass comput scienc technic report april abstract gener approach agent control enabl control compon wide varieti applic abstract domain context impli contextu behavior requir violat object discuss context gener framework current focu addit organiz context agent control introduct vantag point long histori research agent agent control compon build distribut ai recent effort approach agent control gener domainindepend perspect implement object develop set agent control compon bundl domain problem solver legaci applic creat agent meet deadlin coordin activ agent paper describ gener approach agent control lend situat specif condit contextu problem describ recent work ad organiz knowledg context agent knowledg base reason process gener domain independ odd contextu depend problem fact gener achiev contextu agent control behavior idea construct gener control problem solver target problem solv behavior class solut class solut contextu depend control problem solver condit view current context typic domain problem solver possibl contextu evalu reason larger context problem solv abstract filter translat gener set input paramet control compon term type approach context expert associ condit control paramet set intellectu question unresolv approach afford level contextu control applic current focu contextu inform make control gener fashion remain order agent technolog open applic electron commerc agent model organiz relationship agent reason util interact coordin agent version paper aaai workshop reason context ai system materi base work support nation scienc foundat grant nation scienc foundat grant depart navi offic chief naval grant content inform necessarili reflect posit polici govern nation scienc foundat offici infer graduat coupl includ situat specif select agent coordin mechan contextu precondit view agent activ paper paint brush differenti import foundat twofold order appli coordin technolog larg control combinatori possibl recal assumpt system global view activ central agent select schedul coordin distribut search process control larg organiz structur agent goal agent coordin motiv factor current work social situat agent resid necessarili complex agent belong multipl organ power interact agent repres organiz model relationship give agent inform reason rel import candid task action object add contextu knowledg agent decid task import task prefer facet determin util agent task request util local problem solv balanc facet relat interest interact parti work consid altruist reason issu action select sequenc complex muddi interact effect candid action preclud independ evalu agent situat open environ fact web influenc consid make figur show organ network interact inform agent warren style main agent type manag agent expert data mainten organ agent maintain repositori inform act interfac repositori digit librari rest network repositori simpl collect entail manag agent primari manag interact inform gather specialist agent expert domain specialist expert automobil expert softwar product weather predict expert pertain area locat task gather assimil produc possibl accompani recommend client action base gather inform agent receiv high level queri request inform plan site handl assimil gather data person agent pa agent interfac directli human model client agent decid inform specialist interact solv client inform agent network interact reflect relationship exampl interact agent compani perform servic agent belong alli compani coordin fulli cost profit agent highli competit compani cooper relationship denot edg agent relationship type express relationship specifi note intuit illustr notion quantifi organiz relationship relationship influenc corpor manag agent compani mutual cooper extend slightli lesser cooper behavior agent belong compani subsidiari manag compani servic request microsoft inform gather specialist type relationship ig specialist compani ig specialist compani good relationship task long task larg occur frequent relationship translat difficult issu control evalu problem solv option issu motiv organiz model context local agent process figur ig specialist compani decid complet request made compani person inform servic request compani microsoft queri arriv ig specialist partial microsoft pai amount servic compar reward servic request compani agent obtain process object repres situat address control issu contextu inform person info agent compani person info agent compani low prioriti user person info agent compani high prioriti user ig specialist compani ig specialist compani ig specialist microsoft db manag compani db manag compani db manag compani db manag compani view ms ms view treat cooper fee charg fee parti price work dont care direct interact denot relationship pair standard parti relationship standard relationship annot relationship figur organ network interact agent emphasi ad organiz context agent control relat recent research social commit oblig agent differ quantif agent action reason action dynam context remaind briefli discuss gener approach agent control compon adapt modul problem solv context describ agent control compon typic agent return issu integr organiz context agent control process due obviou space limit discuss limit interest reader consult group web page inform technolog gener agent control approach agent control problem domain independ perspect domain problem process program sophist problem coupl domain independ task model modul agent coordin agent schedul possibl compon learn diagnosi problem solver translat intern possibl level structur pass control compon full prototyp agent architectur shown paper concentr local agent coordin task descript languag task model environ domain independ task model framework describ reason complex problem solv process model coordin research research includ inform gather intellig environ model hierarch abstract problem solv process describ altern wai accomplish desir repres major task major interact resourc constraint describ intim detail primit action primit action servic request perform activ attend train session read trade journal perform function attend weekli meet ig specialist job complet job servic servic request gather dbm assimil result complet queri pa servic queri low prioriti user compani servic queri high prioriti user compani gather dbm gather dbm assimil result gather dbm gather dbm assimil result facilit facilit figur relat context action select statist discret probabl distribut cost durat uncertainti dimens implicit perform agent reason certainti action durat uncertainti appli task interact facilit hinder effect figur show simplifi task structur emit big inform gather describ portion inform gather process task construct product model retail pc system space preclud detail task structur repres total wai achiev top level statist characterist repres notabl featur task structur enabl arc gather arc repres task model fact review gather method product order gather review task interact model facilit hinder interest coordin identifi interdepend form joint goal agent schedul coordin agent multipl control problem solver bundl domain expert primari agent control compon agent schedul gpgp coordin modul schedul agent local expert make control schedul role domain action domain problem solver action local agent criteria prefer type local agent resourc constraint express gpgp coordin modul note model altern wai perform task schedul problem entail task perform perform gener idea evalu context agent oper custom tailor schedul agent meet context agent time critic ampl schedul produc costli solut bui intermedi result onlin requir time execut solut gpgp partial global agent tool interact agent coordin joint activ gpgp domain approach coordin gpgp coordin modul commun agent make break task relat commit monei resourc build pc product object basic product inform gather review search process zdnet review queri process consum report consum limit multipli multipli multipli enabl extract pc mall queri extract vendor queri extract pc connect queri extract maker search process pc world kei task method resourc task subtask relat figur simplifi inform gather task structur agent gpgp modul local control place local schedul commit repres deal gpgp made perform method time deal gpgp make agent commit fall earliest start dont gpgp consist coordin subset appli coordin depend coordin desir class interact select coordin gpgp design facilit contextu control problem solv form analyz solut path select solut path current situat form coordin techniqu modular parametr agent coordin select select class inform exchang polici common denomin control problem solver design target desir solut class solut exhibit allot comput resourc bound system reduc search space satisf approxim gpgp control expert adept reason task structur remov intim detail agent problem solv activ true gener agent control compon abstract activ model design compon wide varieti domain state inform detail view problem solv requir order properli evalu context agent situat typic domain form context manag expert associ condit action set control paramet gener compon action goal design criteria contextu situat specif control modul intuit control set situat experi support concept context expert interact gener compon condit view gpgp agent problem solv action extern expert interact import coordin context task critic context organiz knowledg discuss section integr gener agent control framework organiz context expert condit interfac interfac extern context expert gener control compon context expert analyz situat priori determin class solut schedul coordin context expert prefer highlight interact implement case context expert chang condit model compon gener agent control compon provid detail contextu model expert implement solut gener agent control compon target control behavior relat custom agent problem solv context context track monitor domain depend compon abstract control paramet gener control compon view problem solv context control paramet discuss current work ad organiz organiz agent control process current futur incorpor organiz context discuss model organiz social context agent oper critic oper open environ extens includ model organiz knowledg organiz enhanc quantifi notion commit joint goal space preclud full descript structur structur partial ffl organ agent belong ffl organiz role agent perform organiz role descript class task duti agent carri note agent multipl role singl organ ffl agent belong organ ffl organiz role abstract organ ffl relationship agent organ member agent member intern organ extern ffl rel import task carri address organ object util function organ agent evalu import task organ ffl import role agent task import agent margin commit rel import task ffl coordin protocol circumst ffl interact style member rang behavior ffl priori joint goal item static typic organ agent gener perform activ agent organ role discov anew time agent contextu inform organiz center joint goal impact agent control equat primari quantit make action select sequenc problem central aspect agent control coordin typic handl work schedul center knowledg structur expand context agent select sequenc action uncertainti agent evalu larger context determin contextu depend activ action simpli inher contextu knowledg influenc characterist action regard evalu inform expand context util primit action determin distribut comput structur knowledg specifi attribut structur agent interact type structur element organiz knowledg agent coordin protocol task agent group relat agent structur agent coordin inform class incorpor agent coordin protocol reduc amount commun coordin agent bia agent behavior enabl ma builder construct intric network agent face combinatori coordin problem make distinct inform pertain aspect agent control system inform influenc contextu candid action coordin commun pertain local agent process chang affect coordin ultim determin task action agent perform class inform directli relev contextu evalu contribut inher characterist coordin action involv agent time consum involv agent wai inform leverag integr local agent process collect coordin protocol form integr type contextu knowledg gener agent control compon complic issu due complex schedul coordin attempt complic model process view tool feasibl expert coupl compon manag domain view view task agent pursu tool coupl problem solver view world process expert translat portion domain inform schedul coordin feedback tool determin chang object requir tool provid detail analysi feasibl reason process control manag detail domain view determin system object center inform incorpor local agent control agent compon interfac domain process akin organ context domain expert manag domain view transfer part knowledg process abstract translat part organiz context design path process view domain action control action abstract reason action absenc detail constraint evalu higher level process reli perform detail analysi action possibl translat portion unifi abstract view action detail analysi schedul approach make compon oper level interfac mechan easi schedul discov schedul detail inform candid possibl candid action select abstract view schedul due constraint interact dealt abstract process easili benefit abstract process queri schedul time time detail analysi determin action akin simon notion organiz structur influenc object util function process develop organiz structur accompani reason process refer barbuceanu agent work harmoni fulfil oblig fifteenth nation confer artifici page brett victor lesser evolv organiz design system umass depart comput scienc technic report march castelfranchi individu intent group organ intern confer system page williamson design behavior inform agent intl conf autonom page marina del februari keith decker environ center analysi design coordin mechan phd le gasser social concept knowledg action artifici bryan horl victor lesser diagnosi learn contextu coordin rule bryan victor regi ana ping xuan diagnosi integr part multiag adapt comput scienc technic report massachusett januari system laboratori massachusett amherst victor michael bryan brett anita regi thoma ping xq zhang system intellig environ control intern confer autonom agent victor keith norman alan daniel nagendra thoma wagner evolut gpgp coordin framework comput scienc technic report massachusett januari victor bryan frank anita thoma xq zhang inform gather agent fifteenth nation confer artifici intellig juli umass cs technic report victor lesser reflect natur coordin implic agent architectur autonom agent mv nagendra prasad vr lesser learn coordin gener partial global plan aaai spring symposium learn multiag march herbert simon organiz object function person sugawara victor lesser learn improv coordin action cooper distribut problemsolv environ machin roi turner behavior intellig agent intern journal march thoma alan victor lesser heurist task schedul intern journal approxim special issu version umass cs
IR/1212 5 chang web lui frank richard center studi digit librari depart comput scienc texa colleg tx usa abstract digit librari defin collect pointer web base resourc hold resourc maintain collect challeng due distribut document ownership high typic maintain assess relev system aid describ path path assist maintain discov relev occur link resourc approach system design inform studi human perceiv web page studi structur kei determin chang present consid irrelev categori subject descriptor user gener term human verif keyword path mainten introduct work build librari collect organ mainten book tradit librari activ acquir index catalogu consid remov librarian great length order collect date edit replac version move archiv section discard permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee june usa copyright acm digit librari present electron counterpart tradit librari digit librarian perform similar function order maintain collect electron document electron pointer document rare hear peopl refer web kind librari electron collect manag electron collect vari characterist web challeng maintain collect web extrem locat document ownership distribut web librari huge million document link document mega shelf subject activ armi peopl act wai copi document activ tend occur worsen situat social manag collect allevi situat owner collect document coordin activ emerg digit topic home maintain web present organ structur order support patron automat mechan order manag document index catalogu easier perform dai human effort requir monitor document collect addit digit librari provid document acm digit grow number special librari distribut ownership case librarian limit work pointer link document digit document typic common occurr detect easili assess relev typic nation scienc human face task relev assess highli subject concept individu relev judgment chang difficult assess relev chang paper present approach aid human manag fluid collect web page author parti approach automat assess relev web page method explor path system design infer relev web page commun inform maintain paper divid section section present background work motiv section describ approach implement prototyp system section overview studi understand human perceiv conduct understand refin path manag section conclud paper motiv web reader access rich vast collect inform resourc author publish multitud sourc collect find inform virtual vari aspect point contextu situat order exploit system develop goal aid reader provid interpret contextu web page path applic teacher construct trail path web page author path repres higher order organ add contextu inform page author adapt compon path address issu unpredict chang fundament build block import high web page author prone chang page maintain feel earli path project issu relat web page rapidli observ common occurr path includ web page chang longer result collect path constantli updat date implement number approach reduc effect simpl approach cach page approach address issu expedit deliveri school slow internet connect evid singl cach approach solv web page undesir path includ page natur current weather newspap web implement path author author cach strategi individu page issu version intellectu properti cach web page creat parti approach path show page move chang path implement mechan path path path exist short period time result comput effect techniqu limit path author design path rhetor coher base linear path mechan page path remov rhetor structur render path ineffect cach path provid mechan implement wai react chang human determin chang occur make determin requir natur chang consid context goal relev page chang remain conceptu chang order avoid import defin peopl compon involv problem issu address present work relat interest origin research conduct path project defin construct block refer group involv peopl origin creat publish web page identifi group peopl creat path group denot document group peopl access design final group peopl manag collect path refer import person act multipl role time assess chang relev pursu approach assist path author administr manag continu occur select collect web page emphasi approach equal applic domain assess relev web page author parti simpl modif path manag enabl mainten person bookmark list collect resourc link simpli detect page easi simplest implement track date return http server accur mechan retain cach copi web page easi compar document cach version determin chang similar check specif section document case return boolean indic chang mention difficulti attempt determin relev obviou approach assess magnitud amount chang easili comput metric direct correl syntact semant web page clear relationship number byte chang relev chang reader larg number byte chang result page creator restructur space sourc encod maintain content semant rhetor point view similarli small number byte chang result insert negat text complet mean situat larg number byte correspond creation complet situat byte chang page creator simpli correct minor spell grammat error goal effici obtain measur semant distanc version document moment attempt infer semant distanc base syntact characterist document order accomplish heurist action reason document partit base heurist paragraph tend encapsul concept paragraph tend encapsul concept partit document analyz document encod markup languag sgml xml structur present web page encod analyz easili autom task html inform structur commonli present structur ad page creator html extrem wai head tag conceptu constitut paragraph page creator constitut page html tag useless analyz chang html tag featur keyword order infer relev relat work measur magnitud relev autom fashion easi task research encount problem varieti context approach inform work doctor dissert david johnson creat system author deliv tutori web johnson design approach face issu web page approach comput version document emploi weight valu addit delet head keyword base johnson creat mechan notifi reader block web page show distanc version reach predetermin trigger level test satisfactori collect web page coupl issu hinder export approach world wide web issu depend distanc measur arbitrari determin weight assign addit delet weight work collect web page issu asymmetr natur distanc measur lack normal distanc document document distanc document document addit normal valu distanc distanc document number make set trigger level arbitrari matter approach monitor featur web page level find system provid monitor system monitor imag keyword web page typic critiqu report relev substant content path manag evalu relev chang regard page goal path manag refer identifi relev web page design inform research work deal identifi web page research page relev point featur page monitor attent research california irvin investig issu identifi interest deal chang web page develop system syskil webert syskil webert agent design discov interest page web approach system aid reader inform seek goal agent design monitor web page notifi reader import page system reli user profil intend model interest interact agent learn interest path design specif educ environ case path artifact provid guidanc direct reader web page maintain consist regard semant rhetor composit path system slightli tangenti present influenc design path manag system webwatch letizia webwatch notifi user page chang webwatch attempt evalu web page reader navig suggest real annot ad link page approach explor knowledg link text link order infer relev johnson reject link page distanc argument forward webwatch prompt metric path manag letizia autonom interfac agent aid reader web letizia approach respond person interest attempt evalu interest web page reader reader read web page letizia link retriev page analyz rank link base interest destin web page reader infer place client webwatch process conduct server approach determin relev document context document knowledg system support relev goal provid varieti inform interfac varieti document signatur recogn type chang kind chang order infer chang import classifi natur chang categori chang distinguish content behavior content refer modif page content point view page creat soccer tournament continu updat tournament progress tournament page chang present tournament result sport injuri present relat document reflect topic present document html tag modifi web page remain structur refer underli connect document document link destin hot web page page conceptu fact destin link chang text link structur import visual percept behavior refer modif activ compon document web page includ applet consequ harder page hide script code file document signatur repres characterist set document signatur infer comput similar web page context term al gener refer string bit creat hash term document present signatur approach reli identifi page featur characterist identifi web quantifi chang magnitud base comparison comput signatur approach consid web page paragraph checksum metric determin content record checksum approach finer granular page checksum provid idea chang page provid idea piec text chang head metric determin content present head typic highlight import text titl head focu perspect page reflect document divid inform group present reader provid clue present link metric determin structur web page hypertext document depend navig provid import analyz connect compon link hand document access link hand visual text imag link anchor inform content destin page page visual link chang point place render page inappropri keyword keyword order determin content web page current keyword presenc featur identifi futur version effect complex techniqu tfidf frequenc document explor determin chang evalu algorithm automat keyword gener keyword provid user good distinguish relev page page question remain user provid approach record global checksum page order diminish possibl neg web page affect previou metric chang imag sourc reflect current metric part link keyword document case global checksum resort point combin result document signatur singl metric chang difficult web page easili perceiv alter visual page maintain structur content chang link maintain relev chang situat depend singl metric match situat return algorithm explor comput notion chang descript system interfac develop system path path manag system implement java capabl check list web page relev path file input check page path html file locat local bookmark remot path manag interpret link html file list url check order detect assess system retriev page content creat signatur page page signatur obtain compar comput signatur base comparison system present user assess relev chang web page user review page individu relev user valid current state page order comput magnitud distanc comparison made signatur current version store path manag record version latest time path check origin signatur signatur obtain give total amount chang page select valid signatur correspond time user review valid page time pass user updat valid signatur page chang signatur repres function state page latest signatur correspond time path manag retriev analyz user valid state signatur path manag amount recent chang page scenario figur show initi state interfac select path check path extract page path file present user page identifi titl page titl url color repres magnitud chang case page shown mean current state page unknown check flag left chang occur point flag shown hang point user algorithm signatur order check page list algorithm algorithm proport algorithm path manag maintain origin valid latest signatur figur show path manag relev assess page proport algorithm compar signatur valid signatur page red flag shown global checksum chang global checksum figur initi state interfac blue hang flag shown page titl flag work boolean detect relev chang encod color page titl url black mean relev chang base algorithm chosen red text high consid relev algorithm color scheme base trigger turn show path page chang medium level point user valid state page click red button altern user kind prompt system assess relev order support inquisit path manag displai amount chang document signatur relev assess figur show view metric relev assess specif chang metric present page identif user inform web page select page identif figur show detail view chang metric page case bottom page figur chosen view assess chang page bottom inform page user assess relev content page context top detail view page present properti page cach annot visibl page figur chang relev assess figur view chang metric system displai page web browser request point person author judg page inappropri hide page viewer action prevent materi shown reader delet page leav path author case connect retriev manag prompt system check page figur detail view page metric addit user metadata path select inform locat path file main interfac figur show path metadata present user figur path inform user path manag contact path author order inform perform coordin correct measur order reestablish desir function path web page retriev connect issu path manag connect requir retriev set web page connect time depend variabl system control page return longer return vari connect time mean web page long cancel retriev immedi restart process result web page load faster web page path check retriev problem singl page block retriev consequ page path manag architectur design process order avoid block expedit retriev page retriev analyz independ thread user control maximum number simultan thread independ problem retriev page web slow long page order deal situat system recogn state individu retriev connect system attempt contact web server host web page retriev state web page locat content download analysi content retriev system analyz content figur select timeout user set timeout connect retriev thread finish expir path check process interrupt gener timeout user click stop button figur show select timeout thread evalu page time successfulli evalu chang thread pick set check page successfulli check gener timeout occur case path manag assess relev page titl shown blue shade blue denot reason relev assess page connect attempt network typic timeout connect retriev state gener timeout expir analysi complet problem identifi long path encount temporari connect problem resolv user path manag check page assess chang success algorithm investig algorithm categor combin found document base work call proport algorithm algorithm implement variat algorithm comput distanc document johnson head keyword order account structur implement includ link addit metric delet modif identifi distanc metric comput pd hd ld kd distanc pd paragraph distanc hd head distanc ld link distanc kd keyword distanc turn number paragraph number paragraph modif number paragraph addit number paragraph delet pw paragraph weight paragraph modif weight paragraph addit weight paragraph delet weight keyword comput slightli simpler import detect keyword miss kd kw johnson develop algorithm support tutori result algorithm system decid page displai continu resembl page select author algorithm includ abil weight delet independ support comput system human provid normal make result difficult user interpret make select cutoff valu visual chang unintuit proport algorithm approach simpler comput distanc chang individu signatur comput pd hd ld kd page distanc proport number keyword maximum signatur compar page paragraph paragraph proport algorithm normal symmetr distanc easier set web page normal symmetr properti distanc measur facilit provid user visual list user effect evalu page review page path percept chang order inform evalu approach design system aid automat assess chang conduct studi observ human perceiv web page give overview studi detail consult companion paper studi cover kind structur present content includ modif text structur refer modif url anchor text present includ modif spatial posit combin web page select path creat teacher person bookmark page modifi reflect singl type classifi magnitud type chang methodolog experi consist present particip version web origin version possibl modifi version unmodifi copi person evalu magnitud chang goal studi address peopl view amount time analyz kind easili kind user evalu familiar particip test softwar kind chang provid context evalu web page provid scenario particip act role inform facilit school high teacher chosen page web teach class check task studi fill questionnair collect demograph data particip comput literaci studi divid phase person view pair web page phase system present particip includ exampl kind chang system identifi particip object phase provid answer question address question phase person view page pair evalu pair phase phase address question phase person view web page page address question person view web page present content chang structur chang present chang page bookmark notifi occur question answer scale rang question answer scale rang strongli strongli final task studi fill questionnair gather gener comment easi assess magnitud web evalu softwar phase test softwar control present web page directli time requir record particip answer control total time studi vari hour depend time particip fill decid rest phase target popul order conduct recruit specif student texa subject divid group page phase ii group page phase iii group compar result page observ studi result result phase subject provid textual descript give indic peopl chang notifi content percent paragraph percept chang desir notifi chang structur percept chang desir notifi chang similar percentag content structur subject rate content higher chang lower desir notifi phase ii time alter percept content chang plai larg role identif structur chang due visibl content structur comment exit survei difficult timeconsum detect structur chang result phase subject desir notifi perceiv structur higher desir notifi similarli perceiv content phase ii subject rate low medium content rate page drastic chang bit higher question structur similar extrem jump rate link chang present consid amount chang type subject notic background color navig imag notic rate low contribut chang desir notifi arrang materi page notic subject interpret differ depend amount time page rearrang consid content chang larg desir notifi subject recogn materi move lower desir notifi present featur chang subject rate chang high metric notifi implic path manag result studi includ link metric chang match evalu chang desir notifi result show present view larg unrel function extrem case detail analysi result provid weight combin result signatur view chang challeng limit issu document signatur base html tag page creator web page author tool html tag consist case page creator modifi visual text tag font resort imag requir implement smarter parser attempt address augment system infer conceptu head paragraph begin identifi type link limit current path manag indirect support face web page path manag check page frame true tag imag link retriev page src href field includ explicitli path limit path manag monitor javascript page behavior part due complex requir parser fact remain move specif support vari constantli time browser type path manag dynam gener page return recogn dynam variabl natur augment system recogn enabl separ treatment page mainten distribut collect document remain challeng task peopl monitor document chang interpret document context goal path path manag support mainten collect web page inform user evalu chang base document signatur keyword path manag track collect signatur user determin longterm chang depend concern path manag design work distribut environ connect document unpredict architectur instanti provid user control system resourc consum system feedback document successfulli evalu path manag access inform document path metadata path import determin relev user mark page remain path path server displai reader path studi percept web page desir structur includ determin chang studi show present larg consid irrelev current work path manag aim overcom difficulti inconsist indirect found web document acknowledg materi base work support nation scienc foundat grant number refer mitchel learn world wide work note aaai spring symposium inform gather heterogen distribut environ march aaai atlant dynam proc intern world wide web internet differ track view world wide web percept evalu proc hypertext august path path lightweight path mechan webnet hypertext path experi proc april acm automat citat index proc june acm machin learn lernen august db enabl world wide web document tutori phd dept comput scienc engin wa sl web document tutori automat valid proc june evolut path author webnet confer www internet octob novemb dm fix document stabil proc european confer hypertext technolog septemb acm agent assist web intern joint confer artifici intellig august morgan autonom interfac proc march acm learn reader identif interest web site machin learn kluwer academ syskil identifi interest web proc august american associ artifici path experi proc june acm creat educ guid path proc june collabor web proc april acm chang proc aaai spring symposium machin learn inform access march manag compress index document morgan san
Agents/1213 1 knowledg base support design synthesi system thesi marc usaf depart air forc air air forc institut technolog air forc ohio approv public distribut unlimit knowledg base support design synthesi agent system thesi present faculti graduat school engin manag air forc institut technolog air air educ train command partial fulfil requir master scienc comput engin marc usaf march approv public distribut unlimit view express thesi author reflect offici polici posit depart govern ii acknowledg road brought furthest thirst credit god opportun credit countri give back small return pull credit support rachel laugh sarah accept technic excel show achiev credit major deloach ii marc raphael tabl content acknowledg ii tabl content iii list figur vi list tabl viii introduct background agenttool problem requir assumpt overview ii background knowledg base scheme logic rule semant associ object hybrid knowledg base implement structur knowledg base content franklin graesser michigan mcgill iii cincinnati elizabeth summari iii methodolog determin organ kb content prepar domain domain analysi implement structur gener domain languag select scheme map construct domain implement knowledg base summari iv knowledg support design prepar domain knowledg domain analysi agent entiti analysi system analysi knowledg base design find candid scheme markup languag implement summari demonstr understand agenttool interfac store knowledg iv locat retriev knowledg summari vi result strength applic futur work appendix domain analysi requir document appendix visual summari effort appendix kei dtd bibliographi vita list figur figur agent applic domain figur associ net agent applic domain figur frame agent applic domain figur upper level agent figur agent framework figur relationship role model object model figur knowledg base develop methodolog figur domain engin process figur figur stage implement scheme figur stage implement kb figur gener view agent domain figur uml model agent domain figur agent entiti figur properti abstract hierarchi figur architectur abstract hierarchi figur compon abstract hierarchi figur system figur agent system framework hierarchi figur role model taxonomi figur relationship product effort figur java object model agenttool figur util scheme vi figur design object implement figur associ figur format record file figur interfac figur agenttool gui figur design window figur figur knowledg figur displai list select object figur show agent system repres vii list tabl tabl agent properti tabl subcategori kei agent properti tabl agent architectur tabl agent relationship tabl system associ viii abstract agenttool system develop tool intend product mass meet militari requir research enabl ma design synthesi tool agenttool filter reliabl agent domain knowledg vital tool expect produc verifi agent applic short timet enabl model agent knowledg design emploi persist knowledg bridg domain model knowledg base extens domain interchang grammar achiev interchang call markup languag present shown capabl repres ma design knowledg easili form readili store retriev knowledg base select knowledg call agent structur shown support oper distribut environ permit share agent develop knowledg tool tool instanc test agenttool relat futur work suggest ix knowledg base support design synthesi system introduct todai world interconnect medium connect inform technolog inform class creat made pace type inform interconnect extend militari infrastructur militari forc unabl grow technolog creativ appli reduc inform process workload manag level potenti vital knowledg simpli lost made time coher fashion intellig agent provid solut problem agent work inform domain resid hardwar complex grow faster tradit forc natur choic maintain militari superior limit factor choic intellig agent interact human order handl task commiss secur integr ground level concern transfer shortag technic specialti personnel softwar programm softwar develop aid allevi burden level background scienc artifici intellig greatli expand advent intellig softwar agent direct popul intellig agent find aspect societi air joint vision air forc point movement distribut applic secur applic agent lend natur element complex evolv natur distribut softwar multipl interact requir provid tradit human resourc flexibl softwar design tool recent research program air forc institut technolog develop tool rapid design agent agent system tool call agenttool agenttool hand commerci toolkit recent design agent agent system ibm ndumu tool gear econom applic electron commerc inventori manag suit breadth militari secur concern verif reliabl tradit softwar autom debug formal specif candid fill nich effort creat tool rapid develop system agenttool system gener java oper distribut environ agenttool consid secur critic factor front agent incorpor extens system produc agenttool limit simpl gather commerc applic applic intellig control unman aerial vehicl acquisit system model design formal verif agent system specif initi research area vital agenttool oper address develop system design methodolog specif agent architectur descript languag creation structur mechan knowledg base manipul reusabl agent domain knowledg formal verif agent system effort area problem agenttool system develop secur system rapidli reliabl reliabl design kei facilit persist agent system system compon store memori element requir persist includ hardwar applic commun coordin secur agent data system framework abstract concept agent intent store reusabl refer make persist element vari level abstract agent role templat assign class agent commun protocol specif singl commun framework role reusabl extent structur store maintain wide scope knowledg agenttool readili agent construct util instrument meet reliabl agenttool incap meet design goal statement summar aim effort regard agenttool requir goal develop determin knowledg base content system develop environ test techniqu produc prototyp agent knowledg base evalu requir assumpt goal statement captur gener partit expand reflect specif requir requir effort gaug progress kei requir research model agent develop knowledg domain develop process structur knowledg base domain knowledg model produc prototyp test agenttool assumpt appli requir agent domain model wide rang knowledg subset implement test fulli prototyp time allot complet effort relat assumpt prototyp knowledg base critiqu persist reusabl reliabl section note agenttool start design java java suffici true achiev requir set standard interfac compon packag compon requir compon java interfac establish afit agent research group overview remaind effort chapter chapter review research effort gener knowledg pertain knowledg knowledg base agent agent system design chapter outlin methodolog obtain goal state section chapter present design relat detail implement knowledg base prototyp support agenttool agent util chapter demonstr behavior prototyp agenttool chapter analyz end result suggest futur work ii background crux effort involv develop knowledg support system agenttool system develop environ knowledg base captur knowledg develop agent system design knowledg base provid knowledg format implement structur knowledg base chapter research accomplish area review research defin term knowledg base multipl definit knowledg base simpli defin composit content composit knowledg base collect heurist captur knowledg specif domain term definit reappear provid addit definit fact rule specif gener heurist class rule relationship specif order magnitud complex rule rule heurist infer reason infer refer pass proposit consid true truth believ follow reason refer creation infer fact bring coher logic thought definit knowledg base notion knowledg base fit rest comput scienc resolv expand definit knowledg base product knowledg disciplin scienc artifici intellig artifici branch comput scienc comput form cognit scienc cognit scienc studi mind understand comput scienc stand group involv mimick mind process comput program simpli analyz tradit comput scienc effect mechan imit import human characterist artifici intellig creat ai program chang knowledg base algorithm simul human behavior expand definit place idea knowledg context softwar imit human make virtual person mean manag appli knowledg knowledg base intend softwar integr part system expert system ai manag system util sort reason engin knowledg order function william remaind chapter overview past current effort knowledg base design agent domain research section review knowledg scheme section introduc option knowledg base structur section work defin popul agent domain space section summar previou section transit chapter knowledg base scheme discuss knowledg base knowledg heurist gener perspect exist explain wai heurist specif repres knowledg base section comparison perspect scheme gonzalez categor knowledg scheme semant object nixon add sixth categori author gener facet broader categori visual procedur paradigm pedersen white stanc knowledg repres declar procedur pedersen perspect depend level abstract requir gonzalez provid greatest depth breadth classif detail refer gener made logic formal predic logic core artifici intellig infanc rigor mathemat base boolean base comput natur knowledg engin hold predic logic prefer languag knowledg base construct repres knowledg reason knowledg knowledg base consid theori obtain vari set store fact fact base fix set logic infer mechan reason place appli infer mechan deduct gener fact fact deriv logic infer construct number limit logic realm defin limit lack mechan remov axiom fact invalid due chang knowledg base specif instanc gener problem lack organ principl absenc infer procedur control logic inflex due implicitli declar flexibl applic reason method altern pure logic knowledg base rule popul knowledg base rule paradigm classic approach expert system medic diagnosi expert maintain set rule relat symptom diagnosi infer engin attempt symptom side rule rule set match return hand side diagnosi match side rule multipl rule diagnosi inferenc found distinct make rule flexibl logic forward chain shown explain figur system backward call reason architectur support reason infer pattern match consid knowledg base graph rule repres edg node repres fact match fact pattern rh lh depend forward backward chain great deal written addit featur architectur compar offer greater popul knowledg escap restrict strictli boolean result rule approach infinit contradictori behavior opac infinit chain occur set infer loop back rule repeatedli check termin problem exist contradictori knowledg addit rule undesir side effect invalid correct infer path natur make behavior mean determin rule fire easi problem debug maintain larg knowledg base rule form sequenc execut lead error pedersen side side rule program mobil program agent rule agent goal agent program mobil goal system program agent figur agent applic domain partial solut rule logic limit involv appli structur knowledg base gener structur knowledg strict logic point structur approach involv organ fact base kei abstract relat group fact axiomat approach find fact rule logic set rule appli semant abstract call semant gener fact semant net frame structur semant associ net associ net enrich version direct graph infer network architectur rule base arriv node graph repres concept object edg defin relat associ object rule unrel fact explicitli implicitli interrel concept associ knowledg base util associ agent domain queri planner part answer figur fairli demonstr power ad semant structur knowledg base simpl queri exemplifi pose imagin ad relat combin multipl concept make associ network power simpl logic associ network drawback drawback approach involv combinatori greater detail object relat relat understood examin shade part figur knowledg base queri alpha part workgroup true agent part workgroup fine alpha ma associ net miss similar case constraint associ exist instanc alpha mobil agent planner agent agent system figur associ net agent applic domain work group drawback associ combinatori occur ambigu relationship determin agent part receiv system fire rule problem larg knowledg base greater number relat examin frame minski tackl associ problem frame scheme entiti classifi term set pair popul slot frame valu facet constraint oper attribut pair agent frame shown figur slot fill attribut rang rang constrain level refer procedur execut refer demon demon uniqu repres procedur knowledg declar power frame li demon frame inherit frame inherit captur field frame figur agent special frame shown slot programm languag agent special inherit slot field implicitli extend inherit program slot slot special agent gener agent frame program permiss chang figur frame agent applic domain frame significantli primari fault frame repres heurist knowledg easili rule frame limit inabl accommod situat object structur knowledg approach semant net frame suffer infer engin depend domain semant opposit problem rule infer process encapsul inaccess infer engin close semant bind merg logic structur order maintain gener infer engin flexibl scheme scheme approach hybrid discuss section object object procedur frame demon step referenc independ maintain procedur object encapsul procedur data oper approach knowledg offer benefit inherit program gener exclud benefit uniqu object approach make effici frame gonzalez point knowledg shortcom common accommod situat form common common object approach hybrid scheme associ object knowledg depend applic scheme pure circumst hybrid scheme hybrid simpl merger pure scheme complex simpli classifi simpl merger exampl categori hybrid present hybrid implement rule paradigm frame hybrid scheme infer net develop fox hybrid perform function system structur advantag problem approach allevi rule fire control frame demon accomplish infer engin hybrid give frame capabl suggest frame found situat appli extend institut hybrid publish framework support procedur paradigm extend institut framework center knowledg base theori individu scheme theori call theori map theori map semant primit map theori advantag bring theori made logic appli exist theori theori map restrict semant construct scheme framework introduc scheme flexibl content repres lengthi creat theori map relationship approach extend institut extens lack valid vital theori xml conceptu knowledg markup languag extens xml markup data format standard structur document interchang web cousin languag extend xml broader access document relat util knowledg entiti knowledg base power aspect text knowledg access multipl facet concept facet roughli identifi frame refer object text base grammat construct enabl access knowledg form class hierarchi call categori knowledg content form object instanc ontolog categori categori access facet major literatur relat languag fall short detail extens knowledg base applic abstract syntax tree xml foundat repres formal consist syntax develop applic repres knowledg idea formal grammar merit applic knowledg scheme abstract syntax tree complementari definit data structur repres program compil intern program optim code gener perform rang structur abstract syntax tree typic mirror abstract syntax sourc languag leaf tree correspond termin sort languag constant node correspond oper type structur typic result type check input stage compil process power ast abstract natur singl ast multipl wai redefin interpret ast creat special defin program written formal grammar tree node algorithm domain ast guid specif specif program domain succinctli specif knowledg ast translat special program perform function appli algorithm program code order optim compil code visitor provid import ast declar repres knowledg visitor provid mechan interpret ast appli knowledg physic mechan maintain oper repres knowledg requir scheme section discuss inform relev design mechan knowledg base implement structur begin chapter definit knowledg base number includ add simpl knowledg base fundament knowledg understand kei structur logic option knowledg base implement class understand requir understand fundament differ remaind section describ common data base strength weak kei element system system collect packag basic storag access control mechan structur modern level architectur closest physic call intern level extern interfac user applic exist level level present view establish call schema schema type defin intern descript specif storag structur access method store data secondari memori conceptu collect descript store data written extern schema written term conceptu schema extern descript part program user view model natur extern schema prevent user modifi content specif permit data secur schema written data descript data manipul languag system architectur call conceptu data model design tradit hierarch network system fit architectur permit conceptu schema relat data conceptu schema advantag commun share storag structur feasibl formal data relationship view permit data domain enrich enrich form set world entiti correspond store data set relationship set attribut belong entiti specif properti cardin relationship particip class system introduc network hierarch system simplest lack addit schema relat oo system relationship attribut easili captur relationship readili model special data record ad extent network slow data access speed ad complex predic logic data descript languag network hierarch data model primari differ network hierarch data model organ data direct graph net model tree structur strict tree data element hierarch model parent element lead data redund complex relat model case complex relat hierarch network system model provid fastest effici db model solut conceptu schema permit model option relat oo model model relat model captur entiti relationship data object basic model pointer tabl permit mathemat oper system relat algebra relat formal mathemat underpin kei strength relat permit activ direct captur design tabl content relat tabl gener set order atom tupl limit data redund present hierarch model relat system defin relationship call task weak slower model system difficulti support repres data includ repres behavior inform accompani data type orient system overcom weak store complex form atom tupl save complex structur save time avoid relat step complex entiti storag atom tupl behavior inform store encapsul form data appli thing oo model handl model variat inherit relationship kei ingredi present relat model carri oo model inher mathemat basi extend relat model includ data type behavior knowledg made oo implement virtual public privat implement follow model provid partial tool exist facilit direct oracl instanc gener relat ddl dml make effect relat algebra calculu opposit end spectrum languag gener vendor underli structur ddl dml agent domain specif tool storag bit pixel tradit approach store agent term specif state tabl inform simpl approach limit domain agent creat step javascript script approach greatli simplifi knowledg base creation cost flexibl intric model knowledg base content applic oper special knowledg domain understood scheme pure hybrid section explor agent system composit order lai foundat select knowledg scheme accomplish varieti effort aim analyz agent domain review franklin graesser import definit agent order scope extent investig franklin graesser provid comparison agent definit conclud comparison autonom agent system situat part environ environ act pursuit agenda effect futur definit broad includ agent specif distinguish agent program definit appar agent properti compon properti includ driven compon includ applic program interfac state machin environ time addit properti classifi categori agent collect agent properti collect franklin graesser tabl autonom agent properti list tabl singl agent remain properti tabl agent properti properti mean reactiv act respond time fashion environ autonom control action simpli act environ tempor continu persist continu run process commun social commun includ peopl requir learn adapt behavior base previou experi mobil transport machin flexibl action script charact believ emot state franklin graesser discuss classifi agent taxonom structur figur show highest level franklin agent taxonomi subclass cover softwar agent classifi control program classif control mechan produc subclass adapt mechan binari classif taxonom classif option properti list earlier basi classif agent categor mobil learn quickli gener larg binari tree pool featur properti discuss franklin graesser discuss classif method adopt scienc mathemat psycholog matrix consid dimens matrix give matrix cell uniqu categori classif remov absolut identif mobil mobil commun mobil commun learn kei assumpt scheme properti defin autonom agent biolog agent robot agent comput agent softwar agent artifici life agent agent entertain agent michigan figur upper level agent work independ parallel franklin michigan effort produc properti list agent um encompass significantli detail ad properti descript limit properti hierarchi tabl confirm franklin um effort substant support indirectli mention idea agent compon composit properti note implement form architectur compon um studi produc inform tabl analysi specif agent system notic system properti common support implement differ account system collect agent compon form agent architectur tabl list architectur categor properti tabl subcategori kei agent properti properti mean reactiv predict determin world occur result describ agent explain arriv languag percept send receiv word commun plan base establish set action achiev goal modifi rebuild plan simultan work goal support reflect examin behavior activ appli intern mechan relat skill learn deploi implicitli mechan domainindepend explicitli declar agent interpret manipul deduct reason form basi learn semant inform induct reason develop semant knowledg expert system agent learn singl method agent learn method instruct agent domain knowledg teacher discoveri appli percept domain knowledg refin analog reason analog gener involv abstract detail set problem resolv structur similar distinct problem analog reason refer process recognit appli solut problem problem techniqu identifi reason transfer learn learn pass agent induct learn concept acquisit concept acquisit refer abil agent identifi discrimin properti object gener label object label condit list associ oper concept abstract contrast concept abstract abil detect relev critic inform action problem abstract plan problem solv order form condit list oper lead complex state base critic precondit mcgill tabl agent architectur architectur featur subsumpt architectur plan theo learn concept languag homer plan languag languag prodigi learn soar learn concept transfer plan languag plan entropi reduct engin learn concept architectur learn plan adapt intellig system plan languag reason process global coordin multipl reason learn experi learn concept plan contrast um identifi properti architectur exist agent group sought develop applic architectur unifi agent architectur project mcgill gener intend creat contrast um categor exist work requir agent domain analysi order extract common agent mechan captur gener agent class result analysi produc agent execut facil finit state machin model world agent oper commun facil hold standard protocol set inform exchang transport process set agent chang local packag mobil persist facil compon architectur author realiz broad agent framework agent construct varieti platform corba chosen framework cincinnati stanford michigan sought categor exist agent mcgill attempt abstract common featur scope analysi activ promin work area accomplish cincinnati stanford guha involv analyz commun agent creat gener framework meet jatlit jafma framework model commun appli substructur jafma base java rmi elizabeth kendal work parallel group mcgill abstract common architectur agent analyz multipl exist agent agent system result royal melbourn institut technolog agent significantli rmit agent domain analysi directli captur architectur compon architectur base set interact layer object layer model behavior domain agent structur characterist captur compon kei layer accompani figur layer model interact immedi adjac layer design pattern exist function structur layer design pattern abstract relat compon mention section sensor abstract part design pattern rmit sensori layer map compon object compon object rmit gener captur static configur independ object cio realiz structur provid agent model behavior rmit framework kendal detail cio intern top layer bring messag distant agent societi layer translat incom layer determin incom messag process layer pend action layer reason select action layer updat belief reason layer gather regular sensor updat mobil translat collabor action reason belief sensori layer transport agent distant societi layer translat messag semant layer verifi direct outgo messag distant local agent layer store carri intent undertaken agent layer process belief determin store reason plan layer store updat belief sensor input layer messag updat bottom figur agent framework idea separ agent behavior agent structur uniqu design pattern agent role role model captur agent behavior independ agent structur role collabor entiti structur independ captur agent model object object primarili captur capabl differ object role object instanti class role element subsystem instanti role model figur show relat set agent object agent role model role model agent import element agent system captur research effort captur role role model role model client mediat colleagu object model agent fipa figur relationship role model object model addit research classifi agent role work progress defin aspect agent space foundat intellig physic agent fipa form work start standard agent agent agent commun draft specif similar iso standard product work fipa expand focu includ issu began formal construct system softwar engin principl draft draft standard agent attribut architectur overview fipa abstract architectur discuss fipa point paper resolv agent domain altern mechan function enabl multipl transport mechan messag altern encod content languag map integr specif exist emerg technolog includ technolog activ directori web messag transport defin conform model conform test enabl interest parti verifi conform fipa specif defin describ level issu includ relationship relationship agent relationship implement agent version issu issu adequ address agent develop commun effort area produc preliminari result accomplish specif dimens agent relat list fipa agent domain attribut abstract agent servic address ontolog content languag express question remain servic captur inform addit defin agent content effort result classif agent relationship relat predominantli exist agent abstract introduc tabl reflect relationship associ agent attribut abstract tabl agent relationship architectur abstract concept relat agent agent agent address agent send agent send agent agent provid servic host agent fipa map agent servic map address support content agent receiv agent content express content refer ontolog content proposit object descript capabl express proposit object servic provid agent servic servic declar declar action servic regist relationship tabl pertain agent system level pure intern scope knowledg defin relat term servic group agent concret exampl fipa http type kqml kif encod xml servic soar agent provid soar fipa document mention section build inform document reli heavili analysi exist system mechan creat power design abstract result fipa architectur intend separ behavior mechan fipa accomplish similar dr approach agent polici produc abstract specif captur agent element agent interact element agent system formal defin constraint express captur interact polici agent requir messag agent exchang agent encrypt polici independ agent mechan polici chang dynam elicit agent domain characterist relat satisfactori wooldridg jen point languag exist agent build author claim agent theori guid languag theoret principl refer set theori begin intent system theori languag theori select area classifi agent domain conclud review kei agent domain research aspect dimens agent domain introduc dimens classifi partit breadth provid exist nwana move agent classif properti architectur suggest classif role goal summari knowledg base system abstract system intend class knowledg approach knowledg base system knowledg base knowledg base system manag virtual domain structur high behavior knowledg complex relationship oo possibl relat knowledg base system knowledg effect model direct graph tree network hierarch knowledg base system effici option exist structur wide select domain knowledg knowledg base system rule excel domain type inform medic diagnosi work neatli structur knowledg repres part automobil interrel structur declar knowledg choic flexibl oper knowledg part infer procedur oper includ procedur content knowledg frame object provid case exist hybrid pure approach import knowledg base determin knowledg base content research agent domain extract knowledg applic research review chapter chapter present methodolog correl build knowledg incorpor structur knowledg base iii methodolog chapter explain knowledg base term structur system access content chapter outlin methodolog establish item knowledg base system start point methodolog understand knowledg store knowledg captur organ storag select knowledg base primari step summar knowledg base develop methodolog detail step subsect assumpt initi requir section knowledg engin determin organ kb content domain knowledg implement scheme section domain model refin iter figur knowledg base develop methodolog implement kb structur section structur knowledg entiti languag determin organ kb content step gener methodolog determin knowledg organ comput scientist knowledg engin knowledg engin requir expert domain provid domain analyst effect organ domain knowledg expert figur captur kei stage knowledg prepar domain inform analyz domain captur essenti prepar analyz base creat organ knowledg structur reflect figur result knowledg structur map select store structur knowledg base system knowledg engin step explain assumpt initi requir prepar domain info requir analyz domain domain model languag determin organ kb content domain knowledg section section implement scheme domain model refin iter figur domain engin process implement kb structur structur knowledg entiti languag prepar domain prepar domain analysi systemat research summar research domain analysi requir document step involv extract domain expert view essenc knowledg area bound set requir mathemat knowledg engin task involv question mathematician involv queri involv gather calculu knowledg requir knowledg obtain seri question answer session review literatur domain system develop case exist system analyz extract domain knowledg interest stage collect prior domain analysi effort gear creat exist system complementari note base support code gener compon base softwar engin system provid librari reusabl softwar specif code gener goal specif implement level agent knowledg collect prepar domain inform organ reusabl form domain analyst requir specif implement analysi lead suggest addit knowledg focu knowledg engin relationship knowledg element implement specif form collect gener addit provid collect referenc exist inform warner list specif item effect domain analysi definit determin problem domain perman domain analysi result focu analysi approach primari product domain develop relat softwar develop process natur domain model item clear knowledg clarifi justifi whichev select benefit requir minimum definit domain analyz agent descript relationship domain model parent softwar develop tool potenti analysi recommend exemplifi accomplish domain knowledg engin task develop system handl packag ship requir bound domain cover ground air ship addit guidelin scope type ship activ captur consult inventori custom servic personnel examin coupl program handl ship busi fortun discov ad domain analysi develop program specif knowledg knowledg engin produc domain analyst document suggest breakdown ship domain activ refer exist provid relev ship knowledg includ definit ship domain descript model futur applic prior domain analysi result knowledg engin locat document final domain analysi extens includ guid success domain analysi effort domain analysi core task domain analyst filter organ domain knowledg domain analysi approach list warner combin strength approach contemporari principl combin domain analysi methodolog call basic step import underli principl principl unifi model languag visual domain model taxonomi step identifi abstract step involv collect knowledg exist system determin object common requir decomposit collect knowledg level common found individu attribut method examin identifi abstract associ previou common entiti collect entiti associ object oper common activ perform object identifi abstract relationship differ associ captur structur behavior step specif common relationship extract collect knowledg relationship abstract case individu relationship identifi abstract perform final step inform organ domain model hierarchi captur inherit compon step figur assumpt initi requir prepar domain info requir analyz domain domain model languag determin organ kb content domain knowledg domain model implement scheme figur refin iter identifi abstract object identifi abstract associ oper identifi abstract relationship classifi implement kb structur structur knowledg entiti languag prepar domain knowledg end product da requir document domain analyst brought step domain analyst document guid list occur step analyst identifi abstract analyst review prior da effort object found common compar result exist system gener final list common object list includ vehicl identifi abstract associ analyst identifi associ send packag packag vehicl custom packag identifi abstract relationship specif individu system packag state packag analyst specif relationship abstract packag object abstract packag packag shipment shipment perform analyst creat taxonomi object pertin knowledg transport object maintain vehicl top level subclass domain model gener captur aspect taxonomi section examin domain model produc implement structur gener domain languag knowledg collect organ domain analysi portion knowledg engin result product model domain usabl thing occur select scheme repres model knowledg map domain model entiti structur gener languag common applic system domain model discuss select scheme set implement domain object primari product stage implement vehicl scheme scheme semant hybrid ast event domain model complex singl scheme ideal multipl scheme requir advantag disadvantag scheme present provid criteria select assumpt initi requir prepar domain info requir analyz domain domain model languag determin organ kb content domain knowledg domain model implement scheme refin iter select map scheme construct languag implement kb structur structur knowledg entiti languag figur stage implement scheme map scheme depend organ consist domain model map domain content uniqu structur simpl complex domain entiti lend standard modular implement structur simpli rewritten form structur compel domain analyst refer move infrastructur specif infrastructur classifi type oper care ensur taxonom inform abstract domain entiti relat repres construct domain languag product stage domain languag primari intent domain languag provid textual syntax possibl captur oper involv domain entiti grammat context applic user understand interact domain model straightforward creat domain languag give uniqu activ abstract domain model partial domain earlier word result languag grammar applic environ issu handl knowledg base discuss implement knowledg base element knowledg structur achiev domain languag knowledg base select implement result complet knowledg base system kb structur strongli depend scheme chosen domain knowledg entiti domain languag select structur reason access method individu domain entiti direct absorb domain grammar design order correctli perform access function domain languag data descript import oper section correctli suggest select kb provid minimum access method set includ ad knowledg activ remov retriev modif oper permit specif instanc abstract figur captur step refin step place result knowledg base system posit exist system start cycl assumpt initi requir prepar domain info requir analyz domain domain model languag determin organ kb content implement scheme domain knowledg domain model figur stage implement kb refin iter implement kb structur structur knowledg entiti summari chapter present knowledg base develop methodolog methodolog design knowledg base scope domain reusabl knowledg scope effort achiev knowledg engin agent domain result step form domain analysi requir document pertin inform guid domain analysi domain analyst produc domain model taxonomi reusabl knowledg map model taxonomi languag structur product combin implement knowledg base system access knowledg object enabl incorpor domain languag form method retriev knowledg chapter detail design made appli agent domain iv knowledg support design knowledg base develop methodolog discuss previou chapter domain analysi requir document model agent system design select knowledg scheme content domain languag knowledg base implement domain integr domain support scheme chapter present implement product result applic section briefli discuss initi prepar stage domain introduc section address made domain analysi present domain model section cover relat map knowledg element domain model select scheme incorpor scheme knowledg base section conclud chapter design made kei highlight due impact prepar domain knowledg section process prepar domain knowledg summar systemat collect summar domain knowledg domain analysi requir document effort definit domain agent domain explan agent domain place softwar engin process gener analysi requir assumpt list exist system analysi potenti problem area recommend domain definit requir reproduc add clariti transit stage domain analysi agent domain collect knowledg multipl agent implement agent agent compon complet captur agent inform level stage develop domain analysi support system engin develop captur knowledg entiti approach domain analysi effort attempt organ agent domain effort narrowli scope portion domain effort includ section franklin classif agent properti compon delin agent architectur distinguish properti compon mcgill attempt creat abstract agent architectur usabl compon implement framework cincinnati jafma jatlit commun framework commun specif elizabeth analysi specif role behavior model rmit agent architectur specif standard defin agent constitut except examin agent domain macroscop effort agent domain research approach standard draft build strength fipa research effort examin agent domain space broadli extens peer consensu final result domain analysi domain model relat collect taxonomi figur gener domain model overlap agent entiti system knowledg implement level arrow figur repres relationship exist knowledg level larger arrow repres relationship element knowledg level specif map associ discuss chapter descript knowledg level facet provid note identifi facet knowledg level correspond singl class abstract knowledg object conceptu knowledg concept gener idea agent concept facet includ goal agent system properti behavior agent agent system agent develop start gener conceptu knowledg design knowledg design gener pattern method agent design organ add mean agent concept design knowledg facet intend pattern collabor agent class structur system role gener task set resourc simpl model interact role role collect role pattern commun role method constrain defin goal achiev role access aid support role overlap agent knowledg element exist link specif knowledg specif detail exact descript agent agent system agent agent system specif facet kei function entiti agent domain fundament function modul agent abstract set compon agent compon architectur organ commun set mechan permit relai data knowledg java remot method invoc socket common commun framework framework specif close ti framework implement data analog resourc agent data construct necessarili part agent access compon agent util access order function basic tabl defin interact agent implement knowledg implement complet specif compil runnabl form concept design specif implement system domain subdomain overlap agent domain concept design specif implement agent entiti domain figur gener view agent domain insert knowledg facet gener domain appli principl uml model model shown figur produc shade object differenti facet knowledg level implement facet darker conceptu commun involv role model role resourc defin task data con system implement languag summar specifi achiev access interfac system goal method architectur compon properti messag implement compon comm protocol agent attribut method util comp implement implement properti figur uml model agent domain method properti strictli reduc visual clutter system domain agent entiti inform knowledg element taxonomi element associ subsect section discuss knowledg agent entiti section cover system domain knowledg agent entiti analysi portion agent domain depict figur agent method data construct properti agent compon implement present origin relationship knowledg element focu section uml kei aggreg associ access interfac agent architectur compon attribut method data construct comp implement implement properti util figur agent entiti analysi fundament entiti agent incomplet pose question definit definit agent answer queri found analysi myriad circul definit answer defin agent provid definit consid context definit intend defin specif class describ class agent gener definit agent introduc chapter defin autonom agent class autonom agent system situat part environ environ act pursuit agenda effect futur definit refer class agent properti view properti provid mean conceptu defin agent class system present definit effort present properti definit properti taxonomi section agent organ identifi knowledg exist provid foundat implement properti analysi research summar chapter agent architectur compon implement properti behalf agent compon agent empti architectur compon realiz properti class agent agent architectur encapsul element fall specif knowledg data construct data construct repres resourc compon data construct compon secur requir function properti form core agent conceptu data construct form core agent specif knowledg taxonomi data introduc section abstract data compon object identifi attribut descript data construct attribut includ set data field detail intern construct data field consist principl uml attribut reusabl repres uml attribut reusabl knowledg element attribut method object part compon attach uml aggreg appar uml model chapter kei design aggreg lower level object potenti mean compon found aggreg attribut architectur mean descript attribut object defin system analysi stage follow guid implement aggreg object store separ part aggreg associ knowledg specif instanc conceptu specif knowledg associ knowledg present figur associ knowledg form set arrow map knowledg level neighbor arrow map agent map arrow serv transfer knowledg lower level higher level concept design specif figur show map link compon actual softwar code implement compon map discuss section arrow shown figur repres larg set includ implement interfac associ exist compon architectur coordin behavior form associ captur fact checker compon address compon order store differ util reflect compon requir interfac data construct directli access relat util specifi agent access data construct agent access compon util defin final captur relat properti compon realiz properti kei design kei design properti implement individu compon set architectur simplifi domain architectur implement properti assign compon compon implement properti behalf architectur detail behavior shown associ captur individu compon method method arrai find smallest number agent entiti knowledg taxonomi kei aspect domain reflect domain model depth domain space knowledg facet origin knowledg level facet break taxonomi taxonomi static partit numer instanc subclass organ taxonom classif import domain model implement knowledg base easier organ reusabl storag retriev due time small subset exist tabl provid inform system classifi taxonomi present effort taxonomi present properti classif taxonomi classifi properti challeng properti properti tightli relat capabl capabl mention assum michigan studi discuss section differ pure properti capabl identifi agent properti identifi agent promot semant iter properti capabl singl hierarchi figur show kei hierarch form definit properti figur present tabl chapter descript kei properti conveni transport hardwar unit network commun agent user respond time fashion environ behavior dynam base acquir knowledg experi instruct sequenc action reach desir goal multipl type requir facil altern make weight architectur classif taxonomi prior agent architectur classif attempt influenc design domain includ properti taxonomi discuss robinson michigan studi classifi architectur platform research team produc lengthi robinson list architectur approach effort identifi small set architectur style classifi architectur instanc abstract format domain taxonomi suggest section kei design mobil reactiv learn learn transfer analog instruct properti abstract optim cooper plan replan opportunist reason exec monitor hierarch pop commun altruist figur properti abstract hierarchi deduct ve secur kei object subclass kei design agent architectur partit level abstract highest set abstract architectur style style architectur conform constraint style level exist specif architectur instanc event platform architectur map fundament composit style ad hierarchi domain taxonomi follow similar format figur present set architectur style similar noteworthi differ plan style captur architectur style complex delib system base reason model captur pragmat architectur style style replac gener composit identifi architectur mix aspect categori reactiv directli support implement reactiv agent properti classic architectur inferenc style found classic expert system theo ot architectur abstract delib reactiv homer prodigi pragmat bdi jess classic composit clip figur architectur abstract hierarchi compon classif taxonomi subsumpt kei object subclass figur depict kei categori agent compon specif subclass select area logic function partit behavior compon exist agent system planner compon constitut directli support plan knowledg compon permit retriev data execut servic compon captur gener control execut structur specif oper includ interfac compon commun data environ gener model compon model environ agent work agent maintain local world compon captur area fall classif hand definit compon type planner plan goal plan engin kei object subclass model compon abstract execut servic state tabl state engin stateless engin api effector knowledg comm engin figur compon abstract hierarchi fact rule infer engin commun kei servic compon directli support framework section applic program interfac model agent access interact resourc common resourc peopl infer compon maintain access knowledg storag structur perform inferenc function knowledg chain rule compon agent kei implement reactiv autonom agent plan agent assembl plan dynam reason state compon agent govern execut agent obviou compon taxonomi taxonomi ident composit compon specif compon implement implement referenc end product deploi agent system specif compon implement pair link map discuss earlier conclud analysi agent entiti agent domain space entiti point entiti consid system level section system analysi section analysi system deal agent agent system defin softwar program design agent main program inherit advantag disadvantag narrow construct figur overview associ knowledg shown discuss system model conceptu properti system agent gener achiev goal unlik agent properti system directli implement compon architectur system properti emerg agent interact design level interact ti specif implement facet interact captur role commun system commun framework architectur implement properti permit commun occur commun involv role model task system implement languag achiev system goal properti messag implement compon comm method summar role agent resourc specifi figur system protocol uml kei object aggreg associ commun framework requir exist specif protocol present system framework order effect agent messag object pass relai inform refin descript interact govern messag send activ mase agenttool develop design requir domain model kei design mase model domain model minim capabl captur broadcast chang domain model fourth specif entiti relat specifi constraint basic commun framework framework requir compon exist agent system agent interact commun section compon taxonomi uniqu framework uniqu commun engin java rmi framework rmi commun engin follow rmi occur agent framework basic complet guard noteworthi knowledg element system implement task simpl design structur encapsul resourc achiev possibl applic constraint task collect role entiti match task function resourc repres aid support role achiev task task requir multipl cooper role relat task assign singl role group role role model role interact knowledg applic role final knowledg system implement code system compon implement code compon specif system associ knowledg system knowledg element map relationship relationship map exist system specif implement realiz map relat assign role design agent specif agent plai summar map task specif compon method defin map link design resourc data construct specif resourc map figur associ exist system associ identifi tabl tabl system associ associ associ descript templat framework protocol implement framework implement properti achiev task achiev goal role resourc involv commun involv role agent system knowledg taxonomi agent entiti system domain model show full depth domain space taxonomi fill make unwieldi produc hierarchi time situat data framework role model taxonomi present figur short descript specif framework role model list comm framework jatlit jafma figur agent system framework hierarchi kei subclass associ framework commun link program run end call socket socket connect tcp broadcast socket expand group program share singl socket network connect underli protocol system similar protocol jatlit incarn framework middlewar agent standard set messag exchang knowledg base effort commun agenttool framework common storag resourc main messag exchang agent gener leav messag recipi tag share unpredict futur time attend recipi check memori recov messag similar blackboard architectur remot method invoc remot procedur call languag rmi slightli power rmi distribut object call method explicit declar socket user framework corba standard slightli flexibl rpc handl object method remot extend suppli chain role model fipa server broker contract net english auction dutch auction adapt control ed ty directori servic role kao interfac gener volunt matchmak librarian singl function zeu assembl agent societi assist diagnosi consult predict design suppli chain contract net electron marketplac monitor figur role model taxonomi mail servic basic suppli chain negoti time contract net base contract net protocol task alloc paradigm alloc realiz negoti process agent role manag task contact contractor execut task dutch english close relat role model bidder role seller role dutch seller request bit ideal price time unit gradual lower price bid met english auction seller request bid select highest winner role model server role client role client regist server capabl server respond queri client client abil summari conclud domain analysi portion section agent entiti domain analysi discuss provid foundat success system domain analysi section combin collect knowledg organ design made domain model shown figur stage knowledg base develop transform domain model useabl knowledg base implement knowledg base design section scheme present incorpor structur manag repres domain knowledg subsect consid scheme argument select hybrid select hybrid consist object model agenttool execut environ extens markup languag model storag transfer call markup languag text model doubl scheme domain subsect storag call agent section figur illustr domain object model model interact find candid scheme select scheme domain arbitrari domain entiti lend behavior relat content affect entiti semant net scheme introduc section captur fail disallow unnecessari associ begin bia scheme ideal approach semant common hybrid compet equal ground examin domain model quickli rule logic scheme inabl encapsul structur knowledg semant net fail adequ captur relationship associ logic rule figur leav hybrid true candid domain model agenttool object model xml model bridg object model librari model model figur relationship product effort knowledg librari prior assumpt select knowledg scheme start bia thrown due java requir chapter bia scheme promot select effect scheme hamper java permit support object frame fundament object procedur frame model java choic remain object hybrid scheme ast agent model java object figur show object model agenttool agent system design space novemb structur show gener object domain object instanti object instanc object instanti string action string version integ descript string guard type string string string string action string string respond initi string string string pre string post string param string string type string structur boolean string parent string boolean boolean basic boolean string compon vector figur java object model agenttool object origin provid flexibl effect scheme domain chang test knowledg base store agenttool object instanc map newer version parent object type problem analog lock car older version kei useless complex java code provid partial eleg flexibl approach chosen approach captur design kei design agenttool scheme object scheme model agent domain object dynam environ agenttool markup languag persist storag agent domain knowledg markup languag extens markup languag flexibl power solut secondari scheme xml elimin reduc size repres object order magnitud markup languag applic xml effort offer advantag altern form captur domain grammar repres design object compact persist primarili aim languag mean agenttool interact entir virtual suit java agent design tool consist set link document type declar encapsul product method text process appli section introduc item integr agenttool domain model section relat element appli process retriev reusabl knowledg facet section finish section discuss scheme extend design object implement level integr object model agenttool chang constantli improv made captur agent design part model fairli static singl static compon model abstract parent fact influenc kei design kei design correspond maintain captur captur object method paramet includ abstract addit concret extens applic method made subclass implement led addit string hold object string hold header inform inform discuss method defin subclass translat object content store constructor receiv string input method string arrai element charact delimit arrai return call subclass constructor return paramet return paramet prepend make document readabl tool receiv arrai string element arrai index return substr append arrai element index receiv arrai index integ search string start return index match receiv arrai arrai index search search string return index receiv arrai start index arrai search correct match string return arrai index match correct match end tag method compon architectur multipl layer method paramet exist sole encapsul function lowest level object model kei eleven item hold string complet parent object instanc effici store transmit domain effici price price translat set rigor formal collect dtd direct valid string appendix dtd primari entiti agent domain model dtd creat method constructor serv method map object map back applic process dtd import formal encapsul product construct method perform work map java design object persist entiti figur show process creat entiti java object origin domain object entiti step process defin partial java domain object select specif instanc step method select object call method object attribut build structur text string progress aggreg object method call method call retriev gener text aggreg object text string aggreg object append parent text string system call select object redirect retriev string persist storag java domain object method entiti java domain object method method figur util scheme store entiti string retriev persist storag instanc java object class creat string object paramet constructor method constructor determin version grammar examin field start string method popul object current grammar version chosen version string parent object model method build current object version older version call grammar encount aggreg version method creat empti object aggreg type repeat step entir origin object structur recreat implement level knowledg scheme domain model introduc domain design element framework captur object inher prevent creation model scheme implement object map specif agenttool address implement level knowledg unlimit flexibl develop storag solut form implement object compat gener approach design design made assur compat kei design implement languag detail map specif implement object captur access reusabl sourc code object altern form mean wrapper sourc code object object repres gener form design string wrap start tag html emb sourc code object wrap provid anchor code insert paramet agent specif captur knowledg base compon rule figur show partial compon object sourc code specif rule form java object notabl tag code identifi distinct object static field anchor remov replac actual rule string captur specif support mechan implement string oper small variat suffic compon string rule string sourc code class rule string string string public class extend string rule figur design object implement map specif object implement object captur map object creat implement store conform subset grammar applic grammar shown figur associ defin similar figur associ associ captur flexibl provid captur map associ agent domain inform quickli locat object meet desir constraint user planner compon support cooper time consum load planner respect implement specif desir properti logic approach includ associ relationship compon implement properti independ repres knowledg entiti refer entiti complet discuss knowledg scheme knowledg gather domain analysi associ implement associ figur associ implement final stage requir select design knowledg captur chosen static scheme effect simpli repres provid organ access higher level address knowledg scheme section argu system answer class suggest low overhead extens made effort model strictli hierarch elimin cost commerci model tailor solut support file access method make design structur choic addit provid implicit compat design java construct provid design collect structur gave abil intern schema level map abil bring knowledg level conceptu extern schema level intern schema essenti file structur conceptu extern schema form agenttool object constraint met develop knowledg base system common interfac pass knowledg element provid system requir number record creation time knowledg base manual popul time mechan dynam size knowledg structur storag store knowledg element uniqu identifi system provid mean retriev uniqu element group element number store element grow access method function independ content cardin desir exist structur modifi order extend abil modifi implement call agent level borrow heavili work deal primarili gener file access file type chosen java persist storag data structur capabl size support interfac interfac discuss briefli detail gener implement structur present section section captur modif basic construct make oper organ scheme object foundat set record file act librari knowledg class figur illustr gener intern composit file adher content region illustr figur schema file header piec inform short section file variabl count number store element file data start pointer start record data region provid measur length index region index section record frame scheme attribut uniqu kei accompani singl record header record record data region header pointer record number measur space allot number indic space index pair dynam remov ad record remov ad record data constitut entir space file end index region raw element store element dynam remov ad file header region index region record data region record data start ptr data figur format record file oper support basic architectur includ ensur capac oper perform function index region expand record data region record move function mention function inform written record structur concern hardwar platform distribut heterogen environ oper stream incom data arrai store quickli stream data directli file prevent read occur wast valuabl execut time addit tailor function integr order provid special access agenttool section discuss function aspect knowledg base interfac agenttool extens previou section underli file structur present creat knowledg base agent instanc file structur design kei design agent domain knowledg fall natur class knowledg base structur partit file structur distinct portion agent domain repres librari data compon compon obviou earli knowledg base produc uniqu agenttool compon share instanc agenttool interfac extract add knowledg knowledg base simultan independ knowledg base instanc quickli lead loss coher platform knowledg prevent reason solut knowledg base system singl persist applic distribut environ solut describ agent kei design prototyp knowledg base effort user current resid distribut environ commun agenttool commun principl led develop administr agent access knowledg connect agent agenttool contact coordin administr set constrain commun compon agent type reach gui connect agent user guid access process figur expand figur detail schemat element interact java collect mention previou section effect level collect fill data structur storag access level data structur manipul level benefit inform store data structur move transpar origin data structur code replac effect code system scenario data structur highli effect small amount content intern schema slow content grow order magnitud content map conceptu extern schema object collect permit schema evolut final kei design kei design meet extens flexibl requir java collect access pass data structur content complet review select design knowledg base structur conclud discuss implement agent connect agent librari list agent connect librari grai box interfac librari local network node comm framework remot summari figur interfac open chapter central goal implement knowledg base develop methodolog present object methodolog outlin complet domain knowledg engin creation model agent system design domain select knowledg scheme content model specif domain languag grammar design develop knowledg base domain integr domain support scheme product gener point section laid foundat proce collect agent domain knowledg summar result domain analysi requir document complet domain model relationship librari produc section taxonomi specif popul repres object abstract introduc section section result defin dynam static scheme collect organ knowledg dynam scheme agenttool object model static scheme call doubl domain languag section call agent access introduc structur satisfi final requir captur persist storag domain knowledg provid access knowledg interfac agenttool demonstr chapter present design knowledg base produc appli chapter present result test perform store agent knowledg locat agent knowledg retriev store knowledg administr agent support delet modif agenttool support section introduc kei featur agenttool background understand section summar test result understand agenttool interfac companion effort entail interfac tailor support specif agent system develop methodolog extens interfac made support function figur show agenttool gui user develop agent system note menu support visibl corner gui center gui predomin occupi default design connect box repres agent class figur agenttool gui store knowledg agent system user store entir system part agenttool menu option support store store store save file oper ident handl storag element separ gener step shown figur shown figur expand figur store user select regist click pointer user select store object menu option agenttool launch pass handl select object immedi establish socket connect administr agent launch illustr figur user enter type field enter detail descript pane user click store button call set select descript field user type call call start cascad process section effect translat object model store insid object creat consist type string classnam select object side start pass build messag administr start half method call identifi intend repli back initi displai messag kei step store method call method extract string receiv kei user notifi prompt kei string accompani kei store acknowledg notifi user store oper success figur design window basic process store agent system system store save file menu option method current agent system call user prompt type file result string file store local parent instanc agenttool figur locat retriev knowledg restor restor load file menu option handl locat retriev store knowledg previou object store process locat retriev figur step captur process gener current version agenttool user creat gener select select restor object creat exist activ user select knowledg type intend case initi side administr agent pass select figur knowledg side send list request messag administr initi half call parent list method extract collect chapter kei select knowledg type list produc kei collect return displai user select candid list click button start side pass store administr launch side call kei check match parent load method retriev string kei code return connect descript field displai object user click replac object select agenttool load object pass string method method simpli reconstruct object code figur displai list select object cover restor function agenttool interfac knowledg persist summari load store test similar perform agenttool distribut environ test success fast instanc delet updat function test due time constraint consid futur work addit area futur work suggest chapter vi result chapter knowledg base develop methodolog result knowledg base strength weak aspect effort present section suggest applic futur work suggest section section strength weak chapter summar goal effort develop methodolog design agent knowledg base support agent produc prototyp knowledg base test prototyp test requir evalu area persist reusabl reliabl methodolog prototyp critiqu effort requir develop methodolog produc workabl knowledg base accomplish logic clear goal kei product trace initi requir part kei straightforward complet success establish formal develop knowledg base prototyp obviou limit extens domain research produc rigor domain model domain model product suffici baselin permit evolv iter applic final product prototyp knowledg base smoothli agenttool due object function agenttool knowledg model java object store retriev knowledg secondari persist manag thread termin restart proven intent termin ran reliabl extend period time unlik extens easili proven succe provid flexibl captur agenttool domain identifi version tag flexibl requir programm updat method section mean remov overhead achiev accomplish short implicitli discuss strength weak issu weak strength flexibl appli domain address section applic futur work activ rang formal domain power extens middl agenttool abil prototyp filter knowledg formal domain model organ permit autom ad domain knowledg agenttool softwar engin design process inform ad formal tradit domain dimens target current version agenttool model strictli dialogu parti occur multicast broadcast multipl parti design agent system advantag full rang commun dimens agent domain rework incur grammar dtd cognit domain properti capabl agent compon discuss develop agent meet specif function identifi agent cognit featur agent suit specif environ type user agent handl event captur cognit featur agent domain model enrich properti dimens indirectli util relationship entiti function provid user option base requir agent process ad broad class knowledg agent theori due wooldridg work agent theori examin chapter effort provid ideal start point introduc agent theori collect logic specif agent product domain knowledg directli support specif agent multipl formal product support specif theori encompass multipl theori possibl xml ti make target futur work extens style languag appli applic form provid script autom translat version reader recal kei featur abil captur version agenttool object map current version involv programm xsl autom process formal map set dtd style languag altern xsl produc similar result document object model dom standard structur xml document case direct map xml variant html view facilit aid dom assist direct creation xml document grow tree structur ad tag flat text file preliminari work dom accomplish effort form util view repres knowledg entiti object tree figur show output util agent system captur technolog forthcom schemat data type extens extens xml metadata interchang standard complet meta structur format xml document exchang xml dtd proprietari tool version tool regard sourc advantag agenttool agent agent util tool product agenttool implicit synergi dispar research effort result figur show agent system repres chapter motiv forc effort introduc militari technolog concert strain oper interfac technolog agent act sourc virtual assist militari agent requir mainten circumv applic tool agenttool speed tailor develop agent forc develop knowledg base agenttool directli support goal maintain agent develop persist storag demand implement popul consist central control close applic area knowledg persist requir provid templat creation tool serv air forc centuri applic virtual suit agent develop test tool brought share model appendix domain analysi requir document domain analysi requir document jan definit bound sphere function target agent definit target collect knowledg multipl implement agent agent constitu compon complet captur agent inform level stage develop relat sw engin domain model agenttool applic form extens knowledg base system reusabl persist agent domain knowledg agenttool mase methodolog appli knowledg mase stage knowledg element captur goal goal hierarchi transform role appli case task case role creat agent sequenc diagram creat assembl agent system implement architectur domain model product support mase knowledg product implement java order interfac agenttool domain analysi extend mase area permit oper altern develop methodolog futur domain model capabl evolv byproduct futur domain analysi iter agent theori languag captur analysi iter implement level possibl conceptu level agent creation element mase tabl reflect object design level evolv domain model version incompat resolv perform domain analysi captur map knowledg knowledg collect short index research summar section exist franklin classif agent properti compon delin agent architectur distinguish properti compon mcgill attempt creat abstract agent architectur usabl compon implement framework cincinnati jafma jatlit commun framework commun specif elizabeth analysi specif role behavior model rmit agent architectur specif standard defin agent constitut zeu agent toolkit ibm aglet bond knowledg marc raphael appendix visual summari effort input section section section section prepar domain info determin organ kb content domain model taxonomi section section identifi abstract object identifi abstract associ oper identifi abstract relationship classifi implement scheme refin iter section implement kb structur dtd repres knowledg element accur appendix kei dtd system dtd document type definit system system ma ma version cdata cdata descript framework framework cdata agent dtd document type definit system agent agent version cdata cdata descript view view cdata cdata cdata cdata properti architectur dtd document type definit system architectur architectur cdata descript role dtd document type definit role role cdata dtd document type definit cdata version cdata particip descript state state cdata action cdata view view cdata cdata cdata cdata transit transit cdata cdata guard cdata cdata cdata action cdata compon dtd document type definit system compon compon cdata view view cdata cdata cdata cdata descript state state cdata action cdata view view cdata cdata cdata cdata transit transit cdata cdata guard cdata cdata cdata action cdata method method cdata cdata guard cdata cdata cdata action cdata attribut attribut cdata type cdata cdata userdefin cdata bibliographi autom technolog white analysi concept research domain analysi softwar system ieee comput societi lo ca survei cognit agent eec cognit michigan unifi agent white mcgill canada gordon ma relat data gordon ma purdu foundat knowledg base brighton resourc kit unit kingdom fipa principl fipa spec foundat intellig physic agent fipa architectur fipa taxonomi autonom intern workshop agent theori manufactur agent asm comput engin confer relat knowledg ma deduct foundat knowledg base engin prentic englewood nj agent work commun acm volum build ibm softwar develop ibm model agent system royal melbourn institut australia java applic framework agent base acm comput survei symposium applic framework formal methodolog techniqu verifi close air forc institut dayton canada xml build upper saddl river framework repres psycholog comput ny british unit kingdom compil semant data foundat knowledg base knowledg engin knowledg markup xml xml develop canada metadata interchang octob knowledg base part valid verifi ieee comput press lo knowledg base part valid verifi ieee comput press lo san diego compon base approach agent air forc institut dayton foundat knowledg base infer mechan knowledg foundat knowledg base thoma agent bit pixel intermedi object model level mit method popul knowledg base afit applic composit dayton webster ma knowledg ai tool expert softwar methodolog modern ieee comput press lo ca system methodolog analysi design multiag air forc institut theori knowledg engin vita marc joseph raphael born small town york citi graduat high school year won air forc scholarship young interrupt secondari educ order serv chile volunt return studi marc complet electr comput engin decemb commiss air forc left tour patterson ohio earn servic support multipl vital program tour raphael enter afit complet comput engin complet march captain raphael assign serv space missil system center la ca report document page form approv public report burden collect inform estim averag hour includ time review search exist data gather maintain data complet review collect inform send comment burden estim aspect collect includ suggest reduc burden washington headquart director inform oper jefferson davi suit va offic manag reduct project dc agenc titl subtitl report date march knowledg base support design synthesi system marc usaf perform organ air forc institut technolog graduat school engin manag build sponsor monitor agenc captain freeman alex north randolph street va supplementari note scott ext distribut avail statement approv public distribut unlimit abstract report type date cover thesi fund number perform organ report number sponsor monitor agenc report number distribut code agenttool system develop tool intend product mass meet militari requir research enabl ma design synthesi tool agenttool filter reliabl agent domain knowledg vital tool expect produc verifi agent applic short timet enabl model agent knowledg design emploi persist knowledg bridg domain model knowledg base extens domain interchang grammar achiev interchang call markup languag present shown capabl repres ma design knowledg easili form readili store retriev knowledg base select knowledg call agent shown support oper distribut environ permit share agent develop knowledg tool tool instanc test agenttool relat futur work suggest subject term domain knowledg data retriev secur classif report unclassifi secur classif page unclassifi secur classif abstract unclassifi number page price code limit abstract sn standard form prescrib ansi std ul student faculti advisor thesi design keyword keyword mj sa agent knowledg sponsor agent phone program fund fa secur agent knowledg base support design synthesi system knowledg base support agent develop tool air forc program air forc quickli move distribut applic delin document joint vision world air forc studi inform superior kei factor success st centuri grid defin inform includ inform servic provid user abil find obtain process exchang trust ensur system inform sourc secur sponsor research intellig softwar agent provid capabl deliv capabl user distribut agent manag summar provid intellig user plan potenti applic size complex worldwid necessit formal rigor approach ensur entir system secur impact knowledg base support agent system develop absolut critic mean store develop system system time develop extens system applic deadlin knowledg base support rapid develop captur develop knowledg persist reusabl form technic agenttool system develop tool intend product system meet militari requir research enabl ma design synthesi tool agenttool filter reliabl agent domain knowledg vital tool expect produc verifi agent applic short timet enabl model agent knowledg design emploi persist knowledg bridg domain model knowledg base extens domain interchang grammar interchang grammar develop markup languag capabl repres ma design knowledg easili form readili store retriev knowledg base select knowledg call agent support oper distribut environ permit share agent develop knowledg tool tool instanc test agenttool relat futur work suggest subject knowledg domain java
AI/1214 2 intern confer network expert system medicin june milo greec tumor detect imag hybrid method neural network train vp gd mn depart greec centr health informat depart inform system uk patra artifici intellig research center paper effect hybrid evolutionari algorithm neural network train tumor detect investig combin evolutionari algorithm stochast gradient descent evolutionari algorithm work termin point stochast gradient descent method consist stochast gradient train stage evolutionari retrain stage train consid suitabl larg train set escap local minima natur approach learn nonstationari task notion retrain aid hybrid method exhibit reliabl stabl gener capabl train neural network result suggest hybrid strategi capabl train effici effect artifici neural network architectur successfulli detect abnorm video imag introduct artifici neural network provid comput altern algorithm biolog comput massiv distribut learn replac priori program ann develop function base train data ann approach medic inform process train exampl rule learn experi gener test data reduct number significantli number neg autom learn process elimin issu human fatigu habitu rapid identif problemat case analysi condit diagnosi real time medic ann learn data set encount set incomplet paramet incorrect random record inexact select paramet ann handl data set pattern match capabl characterist robust order assist medic acknowledg ann contribut improv imag inform develop spread intellig system medic imag intellig system strongli depend exist technolog comput high comput perform process larg amount inform reason time hybrid evolutionari algorithm combin ann train investig method tumor detect video imag stage recent learn algorithm emploi train ann ea retrain network usag ea base fact stage produc popul potenti solut ea sensit nonstationari task rest paper organ batch ann train discuss section short introduct ea section section describ special task interpret section present detail applic hybrid method train ann interpret imag outlin implement result section short discuss futur work present batch neural network train learn ann achiev minim network measur perform defin differ actual output vector network desir approach popular train artifici neural network includ train algorithm divid call call batch train ann consid classic machin learn set exampl learn good approxim train network applic batch train consist theori unconstrain inform train set aim find minim batch error measur layer nl neuron squar differ actual output output layer neuron pattern target output index pair rapid comput minim difficult task dimens paramet space high error function gener complic surfac possess multitud local minima broad flat region adjoin narrow steep search locat weight set ann paramet updat present train sampl repetit train choic learn task larg train slowli natur task batch train faster train set train effici larg train set ann escap local minima natur approach learn task method robust batch method omiss redund data train set correct train phase train data gener easili great quantiti system scarc preciou train order learn track time vari function continu adapt chang environ sutton point learn essenti obtain learn system learn inher effici stochast gradient scheme recent scheme suffer drawback sensit learn paramet note framework advanc optim conjug variabl simul anneal method reli fix error surfac abund method learn effect learn classic batch train algorithm straightforwardli handl nonstationari data train exist problem train exampl excess learn exampl lead satur slow converg method suit learn handl nonstationari requir addit memori comput order process addit evolutionari algorithm stage hybrid evolutionari algorithm emploi termin point train method evolutionari algorithm stochast search method mimic metaphor natur biolog evolut ea oper popul potenti solut appli principl surviv fittest produc approxim solut set approxim creat process select individu level fit problem domain breed oper borrow natur genet demonstr effici differenti evolut strategi train ann de strategi handl nonlinear multimod object function requir easili chosen control paramet result shown de strategi good converg properti outperform evolutionari algorithm appli de strategi ann train start specif number weight initi weight evolv np fix train process weight popul initi randomli uniform probabl distribut call weight vector gener combin weight vector randomli chosen popul oper call mutat outcom weight vector mix predetermin weight vector target vector oper call crossov oper yield socal trial vector trial vector accept gener reduc error function oper call select briefli review basic de oper de oper mutat oper weight vector call mutant vector gener wi ξ wi ξ wr member previou ξ real paramet call mutat constant control amplif differ weight randomli chosen weight mutant weight crossov oper appli compon mutant weight randomli real number interv compar number ρ ρ compon trial compon mutant vector pick compon target vector oper introduc popul algorithm escap local minima weight space combin action mutat crossov effect act effici search weight space interpret imag neural network increasingli medicin develop neural expert system intellig medic imag interpret develop system consid attempt emul identif malign region minim imag procedur comput comput magnet reson object abil identifi cancer region maintain abil accur diagnosi examin larger studi live tissu possibl distanc minim shortcom limit number tissu delai discomfort patient effect method earli detect comput assist medic diagnosi system aim provid obviou technic problem automat imag interpret associ set pixel imag unknown object present scene imag drawn difficulti object relat set present observ scene medic approach minim techniqu comput tomographi magnet reson permit visual inaccess region bodi diagnost medic base distribut percept local interpret physic surfac properti tissu rough shape detect abnorm adjac surfac show surfac properti distinguish basi textur differ import vast difficulti physic attribut organ colon alik section characterist fact introduc sever limit interpret imag medic featur physic surfac properti tissu system develop model provid valu paramet find infer correct interpret task interpret basi local properti tissu perform human percept consid outstand medic expert abil add remov compon imag give mean medic expert adapt extent distort imag recogn neural network methodolog present learn handl uncertainti ambigu distort noisi imag method provid human expert assist medic diagnosi implement result interpret diagnost medic imag sophist involv multipl level process provid common platform studi problem model emploi shown figur featur lower level process featur segment imag format imag diagnost higher level process outcom predict figur model diagnost system medic imag figur frame video sequenc illustr tumor colon stage stage hybrid train algorithm step initi weight η step repeat input pattern step calcul step updat step calcul stepsiz pattern η η step termin condit met step return final weight stage step initi de neighborhood step repeat input pattern step np step step step accept gener step endfor step termin condit met algorithm imag process separ process process process imag pixel input perform task imag featur extract imag segment process output process input gener output relat medic diagnost task accomplish process includ classif detect specif lesion diagnosi abnorm applic focu interpret imag minim techniqu product medic imag narrow pipe pass bodi video small camera pass camera observ displai monitor figur sampl frame video physician control direct wheel button import stage implement featur extract process experi techniqu matric gener illustr figur imag separ window size pixel pixel matric algorithm gather inform pixel imag window cooccurr matric repres spatial distribut depend grai level local area base set statist measur comput angl angl predefin distanc pixel statist provid high discrimin accuraci angular differ entropi extract featur vector element featur vector data present ann order train full explan origin imag featur vector window extract origin imag featur cooccurr figur featur extract process featur vector sixteen element layer ann consist sixteen neuron descript algorithm stochast gradient descent outlin stage algorithm η stand usual product ℜ calcul step comput piec inform adapt stepsiz pattern present provid kind stabil calcul valu stochast gradient descent exhibit fast converg high success rate note classif error upper limit error function evalu termin condit step kei featur method low storag requir comput order calcul stepsiz algorithm inform previou iter stage algorithm de retrain outlin oper tune mutat crossov constant carri fix valu ξ ρ stage ann hidden output node initi train discrimin normal imag region randomli select pattern frame method stochast train method introduc train procedur stop ann exhibit misclassif train set gener capabl ann frame note stage extrem approxim train epoch ann architectur retrain de algorithm de popul initi weight vector neighborhood weight vector found stage complet train set consist pattern select pattern randomli select video frame sequenc de algorithm perform iter pattern prevent pattern train set test perform train ann approxim pattern creat frame test set constitut imag region frame normal abnorm sampl retrain easi visual pinpoint actual locat tumor gener result exhibit tabl shown tabl train ann backpropag data extract form frame test frame recognit success achiev hybrid method appli retrain percentag retrain retrain frame frame frame frame tabl gener result discuss research interpret imag centr technolog issu applic driven hybrid method neural network train test appli tumor detect video imag simul result suggest method exhibit fast stabl good gener great possibl good perform algorithm train larg network suit task redund slowli train medic imag result obtain hybrid algorithm capabl detect successfulli tumor singl sequenc frame accept recognit success rate work optim hybrid algorithm test bigger train set video imag ultim aim incorpor learn mechan prototyp intellig system imag point mention previou research experi suggest success implement system support system area healthcar reli success integr technolog social context appli success implement intellig medic imag interpret system reli technic feasibl effect social aspect rise clinic inform exchang issu critic healthcar applic ultim reflect qualiti care provid acknowledg author acknowledg contribut dr dr mr imag process lab depart informat acquisit extract medic data refer paramet adapt stochast onlin learn neural cambridg gd fibr optic imag method investig vr watson rr greenwich medic dj neural network interpret magnet reson imag healthcar comput haralick statist structur approach textur ieee ec intern confer neural network expert system medicin applic fuzzi neural network model imag artifici intellig probabilist reason correl object phd imperi gd imag recognit neuron intellig system improv imag minim therapi alli imag process pattern neural network system techniqu applic academ pattern recognit neural oxford adapt stepsiz algorithm train neural journal nonlinear analysi theori solv modern autom part ieee engin medicin vp train neural network threshold activ function constrain integ proc ieee int joint conf neural network neural expert system medic imag ethic journal intellig inform technolog collabor advantag health care inform manag van afraid attitud diagnost intern journal medic informat learn neural cambridg onlin local gain adapt technic local gain adapt stochast gradient technic differenti evolut simpl effici heurist global optim continu journal global adapt bia gradient increment version proc tenth nation confer artifici mit rs onlin learn random proc tenth intern confer machin morgan tumor boundari detect neural ieee transact medic
DB/1215 3 dimac seri discret mathemat theoret comput scienc extern memori algorithm data structur jeffrei scott vitter abstract data set larg applic massiv fit complet insid comput intern memori result commun fast intern memori slower extern memori major perform bottleneck survei state art design analysi extern memori algorithm data structur refer algorithm data em algorithm data structur design analyz parallel disk model measur perform number cpu amount disk space multipl disk disk parallel gener handl tertiari storag hierarch memori discuss import paradigm solv batch onlin problem effici extern memori program tool environ simplifi program task system parallel program easi effici term execut speed report experi domain spatial newli develop em algorithm data structur incorpor paradigm discuss significantli faster method practic introduct background reason comput system hierarchi memori level cost perform characterist smallest cpu regist cach built fastest memori intern main dynam random access memori typic larger mathemat subject classif kei word phrase extern secondari hierarch multilevel extern sort support part armi research offic muri grant nation scienc foundat research grant part work denmark sophia franc earlier version entitl memori invit tutori annual acm symposium principl june invit paper annual european symposium august updat version paper electron author web page jeffrei scott vitter jeffrei scott vitter disk disk cach roc ic dc cpu memori kb ms ns mb kb mb figur memori hierarchi typic includ instruct data level intern disk size memori level paramet denot block transfer size adjac level hierarchi size unit byte kilobyt megabyt kb block transfer size intern memori disk model section measur unit item unit byte batch applic larger shown slower magnet disk extern mass slower devic tape optic disk archiv storag figur depict typic memori hierarchi characterist modern program languag base program model memori consist uniform address space notion virtual memori address space larger fit intern memori comput natur tendenc programm assum memori refer requir access time assumpt reason doesnt data set larg util eleg program model larg extent contribut product softwar industri memori refer creat equal larg address space span multipl level memori access data lowest level memori order magnitud faster access data higher level load regist order latenc access data disk millisecond rel differ access time commun simpli level memori bottleneck applic process massiv amount data comput program exhibit local pattern memori data referenc repeatedli program shift attent set data modern oper system advantag access pattern track program vagu notion roughli correspond recent referenc extern memori algorithm data structur data item work set cach memori access fast cach prefetch heurist develop reduc number occurr referenc data item cach retriev higher level memori page retriev disk page disk bring intern memori cach prefetch method expect case full advantag local present comput comput inher omnisci cach manag doom perform larg amount suffer poor perform substanti gain perform incorpor local directli algorithm design explicit manag content level memori bypass virtual memori system refer algorithm data structur explicitli manag data placement movement extern memori em algorithm data structur author term algorithm algorithm concentr paper commun random access intern memori magnet disk extern rel differ access speed appar term design commun intern memori disk overview paper paper survei paradigm solv problem effici extern memori problem fall gener batch preprocess entir file data item stream mode pass data onlin comput continu seri queri oper common techniqu onlin problem organ data item hierarch small portion data examin queri data queri preprocess effici queri queri intermix updat insert delet base approach parallel disk model section eleg accur model analyz rel perform em algorithm data structur main perform measur number disk space cpu time reason focu measur algorithm discuss effici term cpu time section canon batch em problem extern sort relat problem permut fast fourier transform import paradigm distribut merg account extern sort algorithm provid fundament lower bound number perform sort batch problem extern memori briefli discuss grid linear algebra batch comput section section mention effect paradigm batch em problem comput geometri paradigm includ distribut sweep spatial join jeffrei scott vitter find nearest persist point locat graph batch filter convex hull batch point extern fraction cascad line segment onlin filter cooper search fraction cascad data extern convex random increment construct line segment intersect geometr section em algorithm combinatori problem graph algorithm obtain sort simul parallel algorithm section spatial data structur onlin set section begin discuss import dynam onlin em data structur method choic dictionari oper rang queri provid uniform mechan dynam rebuild permit mainten parent pointer build interv tree dynam point locat extern memori buffer tree version effici implement search tree prioriti queue em sweep line extens variant work practic spatial applic rang search spatial join section discuss special spatial structur onlin rang yield optim bound case rang search nonlinear disk space requir order achiev optim queri perform gener rang search linear bad perform data structur find match string focu section section discuss program environ tool facilit develop effici em algorithm section demonstr problem spatial speedup obtain practic effici em techniqu system parallel program cover section implement section discuss em algorithm adapt optim dynam chang memori alloc conclud final remark observ section parallel disk model extern memori algorithm explicitli control data placement import algorithm design simpl accur model memori system characterist magnet disk consist rotat head surfac data store concentr circl call shown figur read write data item address head mechan seek correct track wait desir address pass seek time move random track order averag rotat time half order magnitud order amort pai transfer larg collect contigu data call block similar extern memori algorithm data structur figur magnet disk drive appli level memori hierarchi typic block size shown figur applic structur pattern memori access exploit local full advantag disk block substanti access gap intern memori perform extern memori perform fact access gap speed memori chip quickli disk bandwidth parallel processor widen gap storag system raid develop deploi multipl disk addit bandwidth describ parallel disk model paper design analysi algorithm data structur section list fundament bound pertain problem consid paper practic altern memori model discuss section problem paramet captur main properti magnet disk multipl disk system commonli parallel disk model introduc vitter problem size unit data intern memori size unit data block transfer size unit data independ disk db singl disk simultan transfer block contigu data item processor drive disk share processor intern memori size processor connect interconnect network desir properti network capabl sort data item collect main memori processor parallel optim log time special case pictur figur notat log denot binari logarithm log base base explicitli jeffrei scott vitter memori intern memori intern memori cpu cpu cpu intern intern memori cpu interconnect network figur parallel disk queri natur onlin batch mode batch orthogon rang search problem discuss section set point plane set queri form problem report point ly queri rectangl batch onlin number item report queri vari defin perform queri batch queri output size unit data conveni refer paramet unit disk block unit data item defin notat problem input intern memori queri specif queri output unit disk block assum input data initi unit illustr figur requir output data similarli stripe stripe format file data item read written optim stripe stripe stripe stripe figur initi data layout disk block size input data item initi stripe disk data item store block stripe disk extern memori algorithm data structur fundament bound object primari measur perform number oper amount disk space intern comput time reason breviti focu paper measur algorithm mention run optim cpu case ideal algorithm data structur linear mean disk block storag perform algorithm data structur express term bound fundament scan stream file data sort log log onlin search db report answer queri block fashion extern batch problem mention batch problem involv case bound queri report relev onlin search queri onlin problem typic assum onlin problem bound onlin search queri report simpli discuss bound pure theoret complet batch problem comput convex algorithm solv intern memori version problem log cpu time deploi algorithm naiv extern memori set virtual memori handl page requir log excess onlin problem solv queri time fit intern data structur extern memori set requir queri achiev bound log batch db onlin case risk goal em algorithm design syntact deriv effici algorithm term bound naiv algorithm replac base logarithm term case batch db case onlin rel speedup perform theoret practic restrict onlin problem justifi theoret point view automat optim bound mean disk stripe techniqu appli data explain section conceptu disk block enlarg size stripe normal block disk practic point improv onlin search time multipl disk search requir simultan access delai access conflict process jeffrei scott vitter batch perform improv factor log log db log onlin perform improv factor db log db log db larg bound trivial batch problem scan consid linear number model interest featur model nontrivi batch problem requir nonlinear number solv easili linear cpu time ram model exampl discuss includ combinatori graph problem sort complex problem nonlinear log term sort bound log db term search bound small constant unit case log memori share log term larger onlin smaller explain log db make identifi term log log db hide term make differ practic equal import constant hidden nonlinear bound log multipl extra pass data requir massiv data resid tertiari storag mention briefli section algorithm gener framework handl multipl level memori multilevel algorithm develop algorithm run order magnitud faster hierarch memori multilevel algorithm gener algorithm log practic model track size paramet disk hardwar disk rang kb batch block transfer size chosen fraction track size small multipl track amort seek time onlin smaller figur actual track size disk vari radiu track set adjac track format track typic small number track size disk minimum block transfer size hardwar oper system gener larger block figur larger block size reduc rel seek rotat wall clock time set time larger track time correspond revolut disk seek time disk smart rotat latenc block span entir block transfer size larger track wall clock time grow linearli block size result batch block transfer size consid fix hardwar paramet larger track size order kb time adjust block size optim perform actual implement vari applic applic extern memori algorithm data structur good gener program model facilit eleg design conjunct program tool discuss section complex disk model wilk al al al distinguish sequenti read random read effect throughput featur disk buffer cach share reduc time elimin hide seek time effect complex model realiz approxim choic paramet bottom line program perform term gener perform implement real system memori model studi problem complex algorithm analysi extern memori devic began year ago phd thesi sort earli knuth extens studi sort magnet tape lesser magnet disk floyd consid disk model akin constant develop optim upper lower bound sort matrix transposit hong kung develop pebbl model savag vitter extend model deal block transfer aggarw vitter gener floyd model simultan block model unrealist simultan transfer place singl disk develop match upper lower bound paramet valu host problem model thought restrict version aggarw vitter lower bound appli modifi version integr aspect parallel comput develop survei model algorithm type bottleneck occur intern memori extern disk storag occur level memori regist data data cach level level cach disk storag tertiari devic model gener model hierarchi memori rang regist small end tertiari storag larg end optim algorithm gener fashion yield optim algorithm hierarch memori model match theori practic harder establish hierarch simpler model practic model cumbersom reason breviti hierarch model paper refer reader aggarw al defin eleg hierarch memori aggarw al augment block transfer capabl al model level memori memori block bandwidth grow uniform rate vitter vitter nodin discuss parallel version variant hierarch model parallel model li al appli hierarch memori savag hierarch pebbl version carter defin pebbl model cach jeffrei scott vitter extern sort relat problem problem extern sort sort extern central problem field em partli sort oper account percentag comput sort import paradigm design effici em algorithm technic problem solv easili linear time intern list express tree find connect compon requir number sort theorem number requir sort data item disk log log log conceptu simpler program case case disk stripe paradigm program task multipl disk permit entir time data layout figur data item access singl step block group stripe net effect stripe disk behav singl logic larger logic block size db techniqu disk stripe conjunct optim sort algorithm disk optim number disk log log effect disk stripe disk replac db yield bound db stripe bound larger optim bound multipl factor order term denomin small order attain optim sort bound control disk disk access stripe step sort disk stripe effici practic complic techniqu util independ factor dwarf addit overhead disk independ section recent develop extern sort algorithm base distribut merg paradigm srm random merg outperform disk stripe practic reason valu section section relat problem permut fast fourier transform method except sort section access disk independ parallel read parallel write stripe facilit write pariti error correct inform extern memori algorithm data structur refer reader discuss error correct section discuss fundament lower bound number perform sort batch problem extern memori sort simultan onlin load balanc distribut sort process data item sort partit set partit element bucket item bucket item bucket individu bucket sort concaten form singl total sort list partit element chosen bucket roughli equal size bucket size factor level level level data stream intern bucket written disk onlin manner stream proce doubl buffer size alloc bucket half doubl buffer block written disk half store incom item maximum number bucket partit result number level difficult find partit element bucket size constant factor effici determinist method exist partit element effect doubl number level probabilist method base random sampl found order meet sort bound format bucket level easi case gener read step write step bucket format involv averag block file item partit bucket form previou level order read file block spread uniformli disk bottleneck challeng distribut sort write block bucket disk onlin manner achiev global load balanc end bucket read effici level partial stripe effect techniqu reduc amount inform store intern memori order manag disk disk group cluster size data written size cluster wont chang optim sort time constant point full stripe vitter random onlin techniqu partit high probabl bucket balanc disk stripe pointer track layout bucket disk fit intern techniqu size file partit suffici larg number block bucket log parallel write oper write block random order disk order equal end high probabl block jeffrei scott vitter evenli distribut disk situat analog hash scenario number insert item larger logarithm factor number bin hash item spread fairli expect maximum bin size constant factor expect bin size number block bucket log techniqu break distribut bucket disk uneven smaller valu vitter file time randomli permut written back disk order file access time manner show high probabl individu contribut number item block bucket assign disk balanc round robin manner optim number distribut determinist method develop nodin vitter partit algorithm track evenli bucket distribut disk num total number item bucket process partit num number item written disk num num algorithm write half disk maintain invari bucket largest valu num num num differ num ideal num altern sort higher buffer tree data structur section develop batch dynam applic dewitt al present random distribut sort algorithm similar model handl case sort pass sampl techniqu find partit element rout item bucket processor bucket sort individu pass al develop optim distribut sort algorithm disk function number distinct kei valu bound log ng techniqu extend bound merg sort distribut sort algorithm advantag merg approach present section typic make lower level cach memori hierarchi real system intuit analysi distribut sort merg sort algorithm model hierarch model vitter nodin sort merg merg paradigm orthogon distribut paradigm discuss section typic merg sort algorithm work block data stream sort singl output stripe disk end run format stripe disk extern memori algorithm data structur actual techniqu run data ae initi run merg phase begin pass merg group run merg block run resid intern memori data item block block run input doubl buffer disk busi run merg result number pass achiev optim sort bound merg pass easi case gener parallel read oper merg averag bring block merg challeng ensur block resid disk read singl small constant number difficulti li fact run merg form previou merg pass block written disk previou pass knowledg interact run merg perfect block merg distinct binari merg case base principl run stripe ascend order disk run stripe descend order item run interleav case block output access singl amount intern memori buffer space binari merg minimum analog principl larg order optim sort algorithm sort method nodin vitter optim determinist em algorithm sort multipl disk handl case relax condit merg process block disk brought intern block smallest data item block largest item smallest block read ad output stripe block merg smaller item written output remain item written back disk result run produc merg save grace invert item final applic conjunct partial stripe suffic restor total order optim determinist merg higher constant factor distribut sort develop aggarw base hypercub sort algorithm distribut emploi merg scheme schedul oblivi practic method sort simpl random merg sort algorithm al knuth run stripe random start point place algorithm random merg block disk read jeffrei scott vitter tabl ratio number simpl random merg sort number merg sort disk merg kd run figur obtain back analyt upper bound block free space expect perform srm optim paramet significantli outperform disk stripe reason valu shown tabl al deriv upper bound analysi interest open problem work begin appli srm buffer manag techniqu distribut sort hope sort perform mean improv cach base intuit mention end previou section permut transposit permut special case sort kei valu data item form permut ng theorem number requir permut data item disk min ae log oe bound permut realiz sort algorithm section extrem case log case faster move data item method trivial multipl disk bottleneck individu solut permut appli random balanc strategi matrix transposit special case permut permut repres transposit matrix order order theorem number requir disk matrix order order log ng pq larg compar matrix transposit hard gener smaller special structur transposit permut make transposit easier matrix broken squar element block matrix order block matrix extern memori algorithm data structur order transposit simpl oper intern memori matrix transposit special case gener class permut call turn subset class permut permut defin log log matrix vector item binari address map permut binari address ax permut special case permut permut row column singl permut includ matrix permut hypercub matrix cormen al optim number perform permut sole function matrix give optim algorithm implement theorem number requir disk perform permut defin matrix vector log fl log log interest theoret question simpl function cost gener permut fast fourier transform comput fast fourier transform extern memori consist seri permit comput impli fft direct graph argument intern memori permut network comput consist fix pattern permut data item reorder intern memori permut network realiz seri fft theorem number requir comput fft permut network bound sort cormen nicol give practic implement fft base optim algorithm algorithm fft faster simpler sort comput commun pattern oblivi lower bound section prove lower bound theorem mention relat lower bound batch problem comput geometri graph trivial batch problem scan stream file data linear number permut simpl problem linear cpu time ram requir nonlinear number local constraint block paramet jeffrei scott vitter proof permut lower bound theorem due aggarw vitter idea proof number distinct order realiz sequenc number distinct order exce lower bound averag number number permut assum moment number realiz order chang read disk block intern memori data item item intern memori number realiz order factor block resid intern number realiz order extra item block permut extra contribut happen origin effect write disk block read log wai disk block involv algorithm arbitrari amount disk number distinct order realiz sequenc set express simplifi log log log log lower bound case solv gener lower bound divid permut special case permut lower bound appli sort case log permut bound resort comparison model full lower bound theorem arg al show comparison model problem log lower bound ram model log typic case log comparison model prove sort lower difficulti sort case determin order data permut data proof permut work permut commun pattern oblivi choic disk block fix log term correspondingli addit log term express solv lower bound lower bound directli count unlik sort requir comparison model case log lower bound appli directli permut network form fft sequenc transposit lower bound involv potenti argument base relat relat argument demonstr optim algorithm sort item distinct kei valu extern memori algorithm data structur chiang al arg arg give model lower bound reduct comput geometri graph problem problem list rank express tree evalu nonlinear lower bound permut problem connect minimum span tree graph edg vertic requir instanc sort item situat contrast ram problem linear cpu time ram algorithm minimum span tree gap upper lower discuss section geometri problem discuss section sort intern memori model lower bound mention assum data item split magic desir output conjectur sort lower bound remain valid assumpt lift artifici problem relat adler show remov assumpt lead faster algorithm similar result shown arg problem determin data item valu distinct conjectur true challeng theoret problem matrix grid comput matric gener repres memori order matrix special case sort involv matrix discuss section oper matrix work standard matrix multipl lu block matrix squar upper bound theorem number requir standard matrix multipl matric comput lu factor matrix hong kung nodin al give optim em algorithm iter grid leiserson al reduc number naiv implement factor gupta al show deriv effici em algorithm automat comput express tensor form matrix number nonzero element smaller effici store nonzero element nonzero element repres tripl unlik transposit easier sort theorem transposit matric hard theorem matrix store format nonzero number requir convert matrix order log jeffrei scott vitter lower bound reduct sort ith item input sort instanc kei nonzero element matrix posit defer discuss numer em algorithm refer reader survei volum issu program environ discuss section batch problem comput geometri problem involv massiv amount geometr data ubiquit spatial geograph inform system constraint logic program virtual realiti comput graphic nasa earth observ system core part earth scienc mission planet produc petabyt raster data year microsoft onlin satellit imag terabyt size major challeng develop mechan process useless system size fast em algorithm data structur basic problem comput geometri problem geometr object reduc small core comput convex nearest neighbor paradigm develop solv problem extern memori theorem batch problem relat problem involv input output item solv log set relev comput intersect orthogon segment answer orthogon rang queri point plane find point queri comput intersect segment find intersect red line segment blue line segment plane construct convex hull voronoi diagram triangul point perform point locat queri planar size find nearest neighbor set point find intersect orthogon rectangl comput measur union orthogon rectangl comput visibl segment plane perform queri construct solid geometri model size remaind paper deal case bound batch problem cut factor case load balanc techniqu section disk stripe suffici onlin disk stripe convert optim bound case optim bound extern memori algorithm data structur al zhu arg al arg al al develop em algorithm problem em paradigm batch distribut gener distribut paradigm section extern plane sweep persist offlin method construct persist version data structur section yield factor improv gener persist techniqu al batch gener method perform simultan extern memori search data structur model planar layer direct acycl graph extern fraction cascad data convex hull batch point locat extern fraction em analog fraction cascad segment tree onlin techniqu base work vitter onlin queri data structur fraction cascad extern em analog techniqu kirkpatrick perform convex hull construct random increment construct local version increment construct paradigm clarkson distribut sweep paradigm fundament sweep line process comput intersect orthogon segment plane distribut level plane partit vertic segment endpoint sweep horizont line top bottom process segment vertic segment encount sweep segment insert strip horizont segment encount sweep report hs intersect vertic segment strip span complet vertic segment intersect current sweep vertic segment found longer activ delet remain end portion partial span pass vertic segment initi sort level requir yield desir bound arg al develop unifi approach distribut sweep higher dimens central oper spatial spatial join common preprocess step find intersect bound box object involv spatial join problem intersect orthogon rectangl solv combin previou algorithm orthogon segment rang search unifi extend higher arg al distribut sweep object store data structur case vertic segment branch factor chosen rectangl largest contigu rang vertic strip span contigu rang call branch factor jeffrei scott vitter chosen accommod buffer intern memori height tree remain result algorithm outperform empir time section arg al give algorithm find intersect line output compon bound slightli log al increment random construct attain optim bound line segment intersect problem show comput trapezoid decomposit intersect segment batch problem graph work em graph algorithm ullman yannakaki problem transit closur chiang al varieti graph upper lower bound relat permut kei idea chiang al exploit effici em algorithm develop sequenti simul parallel algorithm problem sort period data list subroutin solut graph number work processor parallel algorithm geometr number entir simul proport number sort bound log al kaufmann show effici bound exploit parallel assumpt paramet model assum log total disk space usag period sort linear number list optim em algorithm assum log true assumpt remov buffer tree data structur section random implement list rank recent work em graph algorithm problem store graph disk effici discuss em problem data mine analyt process includ construct classif tree comput wavelet decomposit histogram complex basic graph problem consid remain includ connect topolog shortest search graph vb vertic eb em algorithm transit closur requir log connect compon determin log determinist log probabilist order parallel simul techniqu yield effici em parallel algorithm prefer algorithm problem search shortest path polynomi number processor interest connect extern memori algorithm data structur parallel domain em domain suggest relationship comput complex class relat parallel comput relat effici spatial data structur turn attent onlin spatial data structur massiv data applic dictionari lookup orthogon rang search canon queri oper data structur support orthogon rang queri lookup oper return structur kei rang return point interior rectangl spatial data structur tend quad tree grid file base partit method organ partit data item discuss primarili type variant data structur natur dynam onlin data updat queri process immedi binari tree host applic ram model order exploit block tree extern memori gener block store pointer data valu tree leaf node log ne level due bayer mccreight balanc multiwai tree height roughli log node root node smaller support dynam dictionari oper rang search optim linear insert delet node overflow split split parent node parent node split propag root delet handl symmetr merg node pictur figur item store leav link symmetr order facilit rang queri sequenti access intern node store kei valu pointer higher branch factor popular variant call split postpon node node data adjac sibl node split sibl node split data full sibl evenli make node full local optim reduc node rel storag util share yao show node roughli ln full assum random insert share averag storag util storag util share insert delet complic persist version develop becker al verma lomet salzberg explor mechan add concurr recoveri jeffrei scott vitter level level leav figur multiwai search tree intern leaf node correspond disk block item store leav intern node store kei valu node leaf block link sequenti arg vitter give variant call btree properti number data item height fix paramet order size level regular differ multipl factor exponenti node level time featur support applic cost node amort origin conceiv part optim dynam data structur queri segment tree extern discuss section applic intern memori ram model set implement interv tree intern memori serv simpler altern data structur augment data structur rang restrict capabl agarw al develop interest variant call maintain parent pointer straightforward modif convent requir log split maintain parent parent support split oper log bound agarw al data structur point locat monoton support queri updat dynam maintain planar log reachabl queri answer open result improv question deal question implement updat improv immedi give optim dynam structur reachabl queri planar buffer tree batch problem comput geometri solv plane sweep techniqu section show comput orthogon segment intersect track vertic segment hit horizont sweep line store hit vertic extern memori algorithm data structur insert queri result huge bound log time larger desir bound log solut suggest binari tree item push lazili tree block item time binari natur tree result data structur height log yield total bound log log factor arg develop eleg buffer tree data structur support batch dynam oper sweep line queri answer order buffer tree balanc multiwai possibl root kei distinguish featur node buffer store item block item node push children buffer fill empti buffer requir amort cost distribut item children item incur amort cost level queri updat log amort buffer tree subroutin standard sweep line algorithm order optim em algorithm orthogon segment intersect arg show extend buffer tree implement segment tree extern memori batch dynam set reduc node introduc node buffer tree list applic natur amort implement prioriti queue applic discret event list rank provid optim prioriti sequenc insert delet min oper requir spatial structur construct version call cross combin partit upper level tree partit method quad tree lower level tree orthogon rang queri insert delet data structur linear space support dynam oper split concaten em data structur augment intern memori quad tree block access capabl exampl includ grid file tree techniqu space total order total order organ point method paragraph linear work rang queri perform cross grid queri requir point satisfi queri refer reader broad survei method curv connect describ section guttman variant eleg gener store varieti geometr polyhedra intern node jeffrei scott vitter possibl leav store item node tree bound box bound element big differ bound box sibl node overlap point point lie bound box children current node search search proce children heurist insert item survei method perform practic low poor bound interest open problem nontrivi bound proven behavior problem rang search point locat similar question appli method discuss previou section variant beckmann al give queri perform precomput repeat extrem slow faster altern hilbert kamel faloutso item label posit center hilbert built manner total order label bulk load hilbert easi center point qualiti hilbert term queri perform good data arg al van den al independ fast bulk load method base buffer tree method effici support dynam batch updat queri experi techniqu discuss section onlin rang search rang search fundament primit onlin geometr index support constraint data model data model discuss rang search batch set section section concentr import onlin case type rang search difficult develop theoret optim algorithm onlin data structur section queri perform optim open problem remain primari theoret challeng combin search output cost queri linear amount disk storag support dynam updat develop optim data structur combin cost search compon cost report criterion search cost separ output cost larger queri algorithm extra freedom follow filter paradigm search compon output report larger number subramanian ramaswami prove lower bound em data structur rang search achiev criterion disk relax extern memori algorithm data structur figur type rang diagon corner gener queri constant result hold em version pointer machin base approach chazel intern memori model hellerstein al gener lower bound argument kanellaki al studi tradeoff disk space usag queri perform data structur expect output point queri compactli block shortcom model consid data layout ignor search compon rule filter approach reason queri algorithm perform log output size algorithm satisfi criterion output block block fix output size larger problem find relev block model eleg insight complex block data extern memori result model data structur restrict singl copi singh show restrict class tree rang queri worst case provid data structur match bound approach achiev bound cross tree data structur mention section addit support oper split concaten lower bound mention rang search appli gener rectangular queri natur question data structur meet criteria interest special case orthogon rang search answer defin rang queri orthogon rang queri finit limit dimens rang queri rang finit limit dimens finit limit dimens gener rang queri queri figur case studi author term rang queri call arg vitter design em interv tree data structur base meet criteria linear disk space jeffrei scott vitter queri updat solv problem queri dynam interv earlier work kanellaki al queri rang queri corner point diagon applic graphic gi chiang silva appli em interv tree structur extract queri time boundari compon surfac data structur relat addit optim output interv tree approach yield dynam em segment tree optim queri updat bound log block space usag rang ramaswami subramanian introduc notion path cach develop em data structur meet criterion higher storag overhead amort updat bound subramanian ramaswami present tree data structur optim linear disk space optim queri amort updat bound static data structur gener rang search queri bound appli filter techniqu chazel outer level structur search side queri reduc log list disk space usag requir pointer machin lower bound structur modifi perform applic dynam techniqu result updat time amort consequ data structur arg al appli notion persist simpl optim static data structur rang support queri linear disk space fulli dynam data structur queri optim queri space bound optim updat bound combin static structur extern prioriti search tree base structur gener techniqu handl queri optim queri bound optim disk space usag amort updat bound intuit disk space effici answer queri queri bound aspect ratio ratio longest side length shortest side length queri rectangl interest question structur section shown perform provabl queri type rang higher dimens filter techniqu work vitter develop theoret em data structur static orthogon rang search creat hierarch partit item domin queri point set block recent modif queri space usag ffi disk block support rang queri dimens finit rang extern memori algorithm data structur space bound optim queri side queri result optim queri perform ram model linear space answer side improv result agarw al give optim bound static rang search dimens variant higher dimens number build data structur larg order structur shed light complex rang search open problem design effici construct updat algorithm improv constant factor type rang simplex rang investig extern memori set al develop dynam em data structur onlin problem find approxim nearest neighbor maintain closest pair vertic numer data structur develop rang queri relat problem spatial data refer broad survei string process digit branch node made base valu bit effect string process intern memori em multiwai digit structur string space store complet pointer string store number node access larg develop eleg gener store call string simpli differ convent branch node repres convent kei store intern node guid entir node fit block string arbitrarili space store string node pointer string store access string search requir constant number node solut repres node base variant patricia trie data structur line al patricia trie achiev branch total storag charact intern node store index number label outgo edg figur child root index charact mean node left consist string charact consist string charact charact string node ident find branch search binari search patricia binari branch base charact index node search string binari search trie figur path patricia examin charact posit jeffrei scott vitter figur patricia trie singl node branch factor string partit pictur actual data pointer string store leav pointer children node store leav leaf node eventu reach leaf gener correct branch charact posit string examin search kei idea fix situat sequenti compar search string string index differ found search string differ fourth charact search string lexicograph smaller entir root fit leav search patricia trie requir load addit sequenti scan string leaf patricia trie reach block search string examin sequenti scan read lower level sequenti scan charg block search string result queri time search string charact optim appli string prefix substr search al show construct suffix suffix arrai string length log optim clark munro give altern approach suffix tree arg al model problem sort string total length extern memori develop effici sort algorithm make buffer tree simplifi version merg call lazi trie ram problem solv log time analog problem sort natur expect complex log arg al show counterintuit sort short string string length complex depend total number long string complex depend total number string extern memori algorithm data structur theorem sort string total length total length short string number long number log log lower bound model string manipul gap case upper lower bound extern memori program environ basic approach support develop call system accessori system unix file system refer reader refer background section describ parallel program implement platform experi section softwar packag programm develop effici implement em algorithm approach batch view code read oper write view comput continu process program fed stream data sourc leav trail result programm worri make explicit call function detail desir automat choreograph sequenc data movement comput fed written set templat class function consist main block transfer engin memori manag access method interfac move block data disk schedul asynchron comput overlap mm manag main memori coordin ami ami uniform interfac applic program ami compon programm interact directli applic ami portabl hardwar deal underli detail perform machin previou section batch problem spatial scientif string process solv optim small number basic paradigm multiwai support access mechan support oper tree onlin problem softwar distribut charg world wide web jeffrei scott vitter empir comparison section examin empir perform algorithm problem spatial system previou section common implement platform recent experi involv paradigm discuss paper rectangl intersect spatial join algorithm implement problem rectangl typic step spatial join comput call scalabl spatial join robust algorithm base distribut sweep paradigm section method modif call improv dynam data structur interv algorithm test data set time result data set figur figur data set worst case sweep line larg fraction line segment file activ intersect current sweep data set case sweep line algorithm algorithm disadvantag make extra copi show improv method typic road data set experi run faster batch oper method build evalu term bulk load time result queri perform method test newli develop buffer method naiv sequenti method construct updat algorithm hilbert data road data set state experi involv build road data state buffer size buffer size capabl store queri perform result measur pose rectangl intersect rectangl tiger data depict figur show buffer small achiev tremend speedup construct time worsen queri compar naiv method correspond buffer size singl built road data object state remain object insert construct time measur queri perform test result tabl show buffer faster construct time hilbert previou method construct similar queri perform repeat insert previou method queri extern memori algorithm data structur time number rectangl number rectangl figur comparison scalabl spatial join origin variant data set consist tall rectangl data set consist short wide rectangl run time data set run time data set jeffrei scott vitter buffer buffer buffer ri ct nj ny ri ct nj ny figur cost process unit naiv repeat insert method buffer buffer cost queri cost data updat updat data set method build queri pack ri naiv hilbert buffer ct naiv hilbert buffer nj naiv hilbert buffer ny naiv hilbert buffer tabl summari cost number updat queri pack refer percentag storag util extern memori algorithm data structur dynam memori alloc amount memori alloc program fluctuat execut demand system user process em algorithm adapt dynam resourc preserv good perform algorithm previou section assum fix memori resort virtual memori memori alloc sever perform hit vitter discuss design analysi em algorithm adapt gracefulli chang memori alloc loss program alloc memori ith alloc block intern memori remain alloc complet point phase begin process continu finish execut model make reason assumpt durat memori alloc phase long memori phase program lower bound approach impli log log dynam optim sort log log sequenc memori alloc dynam program perform constant number sort sequenc memori alloc vitter defin model gener give dynam optim strategi matrix buffer tree oper work repres theoret model dynam alloc em algorithm pang al zhang larson give merg sort algorithm handl special case made perform poorli pattern memori alloc paper paradigm design implement effici extern memori algorithm data structur problem domain consid includ scientif comput geograph inform text string process interest challeng remain virtual problem domain difficult problem prove lower bound permut sort assumpt area design analysi algorithm effici multipl disk optim bound determin basic graph problem topolog shortest connect compon intrigu connect problem good speedup problem fast parallel algorithm continu goal develop optim em algorithm translat theoret gain observ improv practic problem jeffrei scott vitter solv optim constant constant overhead larg algorithm practic simpler approach network workstat hierarch storag present interest challeng opportun work extens domain appli buffer manag techniqu srm method section distribut sort algorithm abil adapt reason chang memori alloc import em algorithm practic acknowledg author member center geometr comput duke anonym comment suggest refer function approach extern memori graph algorithm annual european symposium volum lectur note comput august adler code techniqu improv bandwidth util ieee symposium foundat comput octob vitter dynam point locat monoton planar symposium discret vitter effici search linear constraint proc acm symposium principl vitter algorithm contour line extract planar graph block symposium discret agarw erickson geometr rang search rel advanc discret comput volum contemporari american mathemat societi model hierarch memori acm symposium theori hierarch memori block transfer annual ieee symposium foundat comput aggarw optim parallel sort storag annual symposium discret aggarw vitter complex sort relat problem commun hash function prioriti queue inform selker uniform memori hierarchi model comput arg buffer techniqu optim workshop algorithm data volum lectur note comput complet version bric technic report aarhu arg order diagram manipul intern symposium algorithm volum lectur note comput arg algorithm applic geograph inform system van algorithm foundat volum lectur note comput scienc extern memori algorithm data structur vitter sort string extern memori acm symposium theori vitter effici bulk oper dynam workshop algorithm engin januari larsen gener lower bound algorithm workshop algorithm data volum lectur note comput arg show lower bound comput geometri problem extern memori algorithm visual american mathemat societi volum vitter scalabl spatial join intern confer larg august vitter theori practic algorithm batch search problem symposium discret vitter index optim rang search index acm symposium principl vitter algorithm process line segment geograph inform system special issu geograph inform system earlier version european symposium volum lectur note comput septemb arg vitter optim dynam interv manag extern memori ieee symposium foundat comput octob expect behaviour random insert acta vitter simpl random parallel disk parallel vitter model optim throughput multipl disk bu joint intern confer measur model comput vitter extern memori algorithm dynam chang memori long version technic report duke bayer mccreight organ larg order index acta asymptot optim vldb decemb seeger effici robust access method point rectangl sigmod intern confer manag bentlei divid conquer commun kriegel improv queri perform index structur bulk load oper intern confer extend effici prioriti queue scandinavian workshop algorithm volum lectur note comput juli topolog applic workshop algorithm data volum lectur note comput carter optim permut program ieee symposium foundat comp palo novemb jeffrei scott vitter chazel filter approach siam journal chazel lower bound orthogon rang report case journal april chazel linear space data structur type rang search discret comput patterson reliabl secondari storag acm comput june chiang experi practic effici geometr distribut sweep plane sweep comput theori vitter graph algorithm symposium discret januari chiang silva extern memori techniqu extract scientif visual extern memori algorithm volum american mathemat societi press clark munro effici suffix tree secondari storag symposium discret june clarkson applic random sampl comput ii discret comput ubiquit comput wong overview parallel interfac parallel distribut comput volum kluwer intern seri engin comput chapter kluwer academ cormen nicol perform fft parallel disk system parallel januari asymptot tight bound perform permut parallel disk system siam journal random algorithm geometr problem acm symposium comput june comput segment intersect extern memori algorithm visual american mathemat societi volum cypher determinist sort logarithm time hypercub relat comput journal comput system reduc complex simul grain parallel algorithm intern parallel process april electron data sort stanford shorten version ieee transact april special issu editor den work set past present ieee transact softwar schneider parallel sort architectur probabilist split intern confer parallel distribut inform decemb tarjan make data structur persist journal comput system nasa earth observ system web nasa goddard space flight salzberg hb index support recoveri node consolid vldb extern memori algorithm data structur overcom memori bottleneck suffix tree construct ieee symposium foundat comp palo novemb introduct probabl theori volum john wilei fast string search secondari theoret develop result symposium discret june string data structur string search extern memori applic journal earlier version annual acm symposium theori la floyd permut inform ideal storag miller complex comput teller manag larg amount data interact build walkthrough acm siggraph symposium interact march gunther access method comput june gardner magic chapter wilk report work group storag issu comput acm comput decemb vitter comput geometri ieee foundat comput palo novemb green implement perform analysi spatial data access method ieee intern confer data effici split merg algorithm order problem inform press earlier version intern colloquium languag volum lectur note comput springer effici extern memori extern memori algorithm visual american mathemat societi volum reif gener effici program memori seventh intern confer parallel distribut comput octob guttman dynam index structur spatial search acm sigmod confer manag papadimitri analysi index scheme acm symposium principl patterson code techniqu handl failur larg disk arrai hinrich grid file implement case studi applic phd dept inform hong kung pebbl game annual acm symposium theori earli experi implement buffer tree workshop algorithm kamel faloutso pack intern confer inform knowledg kamel faloutso hilbert improv fractal intern confer larg bulk insert dynam intern symposium spatial data jeffrei scott vitter graph algorithm symposium discret januari revesz constraint queri languag acm confer principl vitter index data model constraint class journal comput system singh optim dynam rang search index structur intern confer januari kirkpatrick ultim planar convex hull siam journal knuth sort volum art comput program read taylor tight bound index scheme acm symposium principl june krishnamurthi wang multilevel grid file tech ibm watson yorktown novemb kumar improv algorithm data structur solv graph problem extern memori ieee symposium parallel distribut octob storag util gener overflow techniqu acta thompson fundament spatial inform system academ leighton tight bound complex parallel sort ieee transact april special issu wong editor effici algorithm linear relax block cover ieee symposium foundat comp reif model resourc metric parallel distribut comput parallel algorithm lomet salzberg multiattribut index method good perform acm transact lomet salzberg concurr recoveri index tree vldb vitter effici bundl manuscript morrison practic algorithm retriev inform code journal grid symmetr file structur acm tran nievergelt spatial data concept design choic van algorithm foundat volum lectur note comput scienc vitter block extern graph search august vitter overhead parallel vlsi architectur lattic comput ieee transact juli nodin vitter determinist distribut sort share distribut memori multiprocessor annual acm symposium parallel algorithm nodin vitter optim sort algorithm multipl disk journal juli livni extern sort confer larg data extern memori algorithm data structur patel dewitt partit base join acm sigmod intern confer manag june ramaswami subramanian path techniqu optim extern search acm confer principl robinson search structur larg dynam index proc acm confer principl wilk introduct disk drive model ieee march samet applic spatial data comput imag gi samet design analysi spatial data structur mirank lower bound theorem index scheme applic rang queri proc acm conf princ june savag extend model memori hierarchi annual intern confer comput volum lectur note comput august savag vitter parallel tradeoff advanc comput volum jai seeger kriegel effici robust access method spatial data base system proc vldb wilk analyt behavior model disk drive cach request reorder joint intern confer measur model comput june nodin introduct parallel model algorithm parallel distribut comput chapter kluwer academ parallel extern list rank technic report septemb kaufmann comput italian confer algorithm subramanian ramaswami data structur rang search secondari memori symposium discret vitter optim cooper search fraction cascad data structur februari microsoft onlin satellit web technic document technic bureau survei algorithm numer linear algebra extern memori algorithm visual american mathemat societi volum ullman yannakaki complex transit closur annal mathemat artifici van den gener approach bulk load index structur vldb van algorithm foundat volum lectur note comput scienc verma effici access structur ieee transact knowledg data user manual refer duke manual softwar distribut web vitter effici rang search extern memori acm symposium theori jeffrei scott vitter vitter scientif comput nasa goddard confer mass storag septemb vitter effici memori access comput symposium theoret aspect comput lectur note comput scienc invit paper vitter analysi algorithm data structur van handbook theoret comput volum algorithm chapter vitter nodin sort uniform memori hierarchi journal parallel distribut vitter algorithm parallel memori memori vitter algorithm parallel memori hierarch multilevel memori vitter wang approxim comput aggreg data wavelet acm sigmod intern confer manag june iyer data cube approxim histogram wavelet seventh intern confer inform knowledg novemb iyer scalabl mine classif rule relat intern engin applic juli ad rang restrict capabl dynam data structur journal make parallel comput practic june dartmouth institut advanc graduat studi wu feng network ieee transact yao random tree acta zdonik editor read system morgan zhang larson dynam memori adjust extern intern confer larg data zhu comput geometri secondari memori intern symposium algorithm center geometr depart comput duke nc usa
IR/1216 5 seventeenth intern joint confer artifici intellig text classifi numer classif haym depart comput scienc rutger nj abstract learn problem exampl featur tradit learn treat presenc absenc word boolean featur featur numer featur system bit problemat approach number consid distinct token treat word paper present altern approach text classif method learn problem featur numer featur convert make directli usabl text classif method show pure data result deriv outperform naiv competit matur numer classif method ripper introduct machin learn commun spent year develop robust ripper popular exampl method year focu numer classif decad attent problem typic method appli treat presenc absenc word separ boolean featur commonli perform gener larg number featur field exampl view singl featur set word present field inform retriev commun similarli spent year develop robust retriev method applic retriev task method exampl techniqu area year focu primarili retriev decad interest method task common techniqu retriev engin basi distanc metric direct method base close relat rocchio relev feedback creat summari class retriev nearest experi place problem realm attent brought question problem effect brought realm method method base decad effect potenti broaden base method numer classif importantli fact problem involv combin featur question confront problem email explor consid text length messag time dai receiv method appli pure problem directli appli applic classif method problemat approach treat number featur distinct proce method combin true word word problem make number dissimilar number valu unrel token classif method approach appli method problem featur distanc numer valu discern classif method paper present convert numer featur featur method appli approach presum method treat piec text repres text object unord set token present text commonli token complex core approach convert number bag token number close token common respect bag number farther idea creat set landmark valu numer assign token landmark featur compar landmark featur exampl equal landmark token exampl landmark token bag result featur convert bag bag number differ reflect side landmark li kei question pick landmark valu experi show fairli naiv approach select landmark perform appeal bodi work featur discret machin learn fayyad dougherti kohavi frank learn method larg number test numer worst case consecut pair valu featur discret method varieti heurist mean identifi modest tractabl subset test learn process approach appli method identifi set landmark valu numer featur creat token landmark assign landmark result method remaind paper describ approach convert numer featur featur includ method describ evalu learn evalu method result show method perform competit method ripper appli origin numer data conclud paper analysi result final remark convert number bag token approach paper convert number set token valu set valu set similar featur find set featur rang legitim valu analyz valu featur observ train exampl numer featur compar featur gener comparison token repres equal greater result token ad classif task includ numer featur repres stori length artifici invent set demonstr defin side lie length result token explain fewer valu case miss valu figur featur rang construct bin dot repres valu rectangl repres bin messag length length featur convert set token ad word bag creat numer result featur hypothet numer featur plot number line figur train obtain featur fall set creat note long fall consecut kei select method main result call mdl exist method discret find good method similar train restrict ignor singl featur harvest point found intern node tree call densiti select yield bin number valu fall consecut stai roughli constant number bin select error rate set rest section describ method conclud discuss handl exampl miss valu featur mdl method mdl method kohavi make techniqu valu numer featur creat high inform gain find set find creat stop criteria base minimum descript length met numer featur treat yield set featur due space limit refer reader citat detail popular discret algorithm densiti method densiti method algorithm form figur begin obtain sort valu observ data featur yield order list result featur desir number split densiti method split featur set set equal size round effect requir point token numer equal numer greater set valu numer featur assum error run argmax featur numer featur creat featur element run end divid data train test run learner train current evalu test end end figur densiti algorithm find final number found global search number grow geometr factor observ error rate set observ reach final detail densiti method algorithm figur run time base densiti duplic valu includ analysi algorithm run time duplic valu yield set split point equal number distinct valu featur run list whichev method yield lower error rate final set split point whichev fewer select miss valu common occurr learn problem exampl miss valu featur complic factor learn assess import featur form learn make valu attribut unavail common approach rang simpli delet data featur remov imput featur learn simpl mode train complex method learn algorithm approach creat featur numer featur contribut interest handl miss valu idea add token featur featur miss commit token featur ad contribut detract classif reli remain featur assign label learn algorithm section briefli describ learn algorithm experi recal goal demonstr method perform credibl numer classif problem tradit method explicitli craft problem show sampl approach text classif base method text retriev mention label tfidf schapir probabilist classif method popular text naiv maximum entropi ripper rule learn system capabl handl featur handl text classif problem fairli direct fashion method implement part rainbow system baselin compar method popular learn ripper note ripper mention method transform featur encod ripper origin numer featur fashion ripper uniqu posit method numer classif method miss valu handl method discuss simpli gener token featur ripper numer techniqu handl miss valu tfidf classifi base relev feedback algorithm rocchio vector space retriev model algorithm repres document vector document similar content similar vector compon vector correspond term typic word weight compon comput tfidf weight reward word occur time document learn prototyp vector form class posit neg exampl class classifi document cosin prototyp vector document vector calcul class assign class document vector highest cosin naiv probabilist approach induct learn estim posteriori probabl belong class observ featur valu assum independ featur class maximum posteriori probabl assign naiv classifi specif design text classif problem maximum entropi classifi estim condit distribut class label set featur idea techniqu uniform tribut prefer absenc extern knowledg set constraint model deriv label train expect valu featur constraint expect model distribut lead minim distribut solut maximum entropi formul found improv iter scale algorithm ripper learn method form set rule test conjunct condit featur valu rule return order success rule predict class label ripper attribut set addit numer nomin condit test item part attribut design make ripper conveni text list word separ singl featur instanc word rule form greedi rule built ad condit metric reward test rule exclud addit neg data cover posit exampl rule form suffici amount data cover final prune stage adjust rule set light result perform full set rule data wide tree learn algorithm fix set creat tree classifi instanc fix set remain instanc predict attribut highest inform gain creat base attribut split train set subset discret subset base continu featur node threshold met tree prune tree avoid base set evalu methodolog compar encod system ripper origin numer featur data set uci repositori tabl show characterist dataset repres problem featur numer final repres problem design number featur numer rest discret accuraci learner stratifi dataset repres wai origin featur encod number ripper encod gener densiti encod gener mdl encod gener accomplish convert number english word repres machin learn method design numer classif base dataset instanc featur numer class accuraci featur diabet glass hungarian iri liver segment sonar vehicl wine auto cleveland mdl approach unabl find omit comparison mdl method tabl properti dataset approach present paper final simpli treat number distinct regard result question kei extent approach yield competit learn method numer classif figur show result compar method featur numer classif method point repres singl data accuraci ripper accuraci text method point line repres case method inferior point line case numer method superior qualit flavor graph featur method perform credibl numer method perform successfulli case plot figur similar graph compar text method featur numer method case bottom graph data exampl featur graph comparison text method versu numer tfidf nb ripper tabl compar number featur densiti coupl method label versu numer method averag accuraci numer averag accuraci compar mdl numer method figur compar learn featur numer learn pictur tabl show data set text method beat numer method entri tabl number featur method text method compar numer classif method column label text method row result mdl method densiti case comparison numer classif ripper result show number case approach convert numer featur data beat popular learn improv accuraci rang high result show approach superior numer show approach merit numer classif method question featur method domin figur show result point repres singl data set text learn repres result mdl method learn repres result densiti method learn algorithm result show method bit perform gener mdl case densiti method addit analysi began paper state obviou approach convert number featur convert number uniqu ad set word averag accuraci numer averag accuraci compar densiti numer method figur compar learn featur numer learn densiti averag accuraci mdl averag accuraci compar mdl densiti approach ripper tfidf figur compar learn featur featur addit question complex method simpl token approach perform effect figur show analysi question point data repres accuraci token approach repres accuraci featur method learn method evid token approach effect gener sophist approach conclud section note kohavi sahami discuss discret method similar mdl method method simpli run ignor featur creat kohavi sahami show method slightli inferior mdl approach inferior discret learn impli case test compar text classif method mdl method method figur show result experi point repres data set learn method repres accuraci repres accuraci mdl approach differ perform similar behavior final remark paper approach convert numer featur enabl applic method problem solv sole bag token averag accuraci token averag accuraci compar token bag token figur compar approach naiv token approach mdl averag accuraci averag accuraci compar mdl approach ripper tfidf figur compar mdl approach od addit open problem involv data featur yield approach method experi show number case result method outperform highli optim method experi show approach yield vast improv naiv method convert numer textual token direct work origin motiv perform work broaden class learn method appli data return work motiv perform addit evalu work data requir set present exist process creat data set perform evalu process note approach yield intrigu deal data miss understand benefit compar approach remain question hope explor case compar learn method success compet difficult make definit statement success conjectur includ differ amount miss valu data number numer versu data set unabl discern pattern result remain import question plan studi acknowledg foster member rutger machin learn research group comment discuss refer blake merz uci repositori machin learn catlett chang continu attribut order discret attribut european work session page cohen fast effect rule induct twelfth intern confer machin lake cohen learn tree rule valu featur domingo pazzani condit optim simpl bayesian classifi intern confer machin page sahami discret continu featur intern confer machin page morgan fayyad irani discret attribut classif learn intern joint confer page morgan frank witten make global discret intern confer machin joachim probabilist analysi rocchio algorithm tfidf text categor fourteenth intern confer machin discret numer attribut nation confer artifici page menlo aaai press kohavi sahami discret continu featur intern confer knowledg discoveri data page menlo aaai press kohavi studi bootstrap accuraci estim model select intern joint confer artifici page san morgan kaufmann hirsh learn user prefer wireless email learn user ijcai mccallum toolkit statist languag text classif cluster mitchel machin learn mcgraw mccallum maximum entropi text classif machin learn inform filter quinlan program machin learn morgan san rissanen minimum descript length principl encyclopedia statist rocchio relev feedback inform retriev smart retriev experi automat document chapter page salton develop automat text retriev boost rocchio appli text filter acm page sebastiani machin learn autom text survei technic report istituto di yang chute map method text classif retriev acm transact inform yang evalu statist approach text categor inform
Agents/1217 1 hierarch agent interfac anim armin sidnei fel mase atr media integr commun kyoto japan abstract hierarch agent provid vertic structur multilevel abstract hierarchi argu multilevel hierarchi conveni creat interfac multipl level abstract agent layer specif visual facilit user problem interfac parallel hierarch iter natur human creativ thought process aha interfac present intim interfac support interact scale direct manipul depend user choic featur interfac mode direct devic interact command line script mode agent perform activ click program script fly present exampl aha interfac domain anim humanlik agent virtual world intellig creativ motion control introduct refer autonom comput program perform task task behalf commun asynchron entiti world respond asynchron event world entiti tradit program object world agent structur hierarch respond asynchron event call hierarch agent term comput impli program run machin person natur agent impli respond event occur requir global synchron signal synchron behaviour implement asynchron synchron made explicit term mean intern structur knowledg agent organ conceptu layer layer correspond level interact user commun agent aha vertic layer approach muller main focu paper discuss hierarchi respect level mode interact combin multipl provid access activ agent direct manipul complet script interact mode result flexibl interfac repres conveni approach interact virtual charact virtual world relat work section explain asynchron agent hierarchi introduc mode interact hierarchi exampl anim virtual world section section outlin futur work relat work work hierarch agent continu tradit layer comput bonasso combin layer approach intent architectur found interrap system muller close resembl approach fischer pragmat approach problem design agent theori knowledg knowledg base structur hierarch knowledg abstract agent control layer function layer local plan layer cooper plan layer access control layer knowledg base maintain hierarchi abstract interrap world interfac unit inform flow world structur call knowledg monitor knowledg base structur control layer access inform provid access knowledg appli level control abstract hierarch decomposit knowledg similar spirit blumberg system control behaviour virtual dog motiv design control agent level abstract philosophi relat norman step human action step gener divid action evalu divid agent action layer section consist agent act world evalu world result aha system block diagram asynchron hierarch agent shown figur fundament aspect system hierarch agent knowledg user interact remaind section describ part detail agent world user agent knowledg monitor activ manag knowledg base resourc manag knowledg monitor activ manag knowledg base resourc manag percept motiv polici behaviour action action unit freedom figur aha structur hierarch agent structur hierarch structur system motiv polici behaviour action sequenc atom action action unit freedom sensor interact layer correspond separ level function conceptu activ insid agent commun knowledg neighbour respond event occur inform flow top hierarchi eventu reach bottom layer act world directli agent understand perceiv inform flow bottom hierarchi top dot connect logic real data flow occur knowledg monitor knowledg monitor compon call knowledg monitor made knowledg base global variabl knowledg share resourc manag administ coordin activ manag activ manag implement model server track main type inform client activ list activ concurr event occur start stop list perceptu filter watch event activ occur filter client start activ stop activ express activ execut condit filter true filter trigger command figur knowledg monitor structur creat knowledg monitor world knowledg monitor maintain world state track event occur real environ virtual environ user agent comput agent virtual actor world avatar knowledg monitor activ manag knowledg base resourc manag percept motiv polici behaviour action action unit freedom knowledg monitor activ manag knowledg base resourc manag percept motiv polici behaviour action action unit freedom knowledg monitor activ manag knowledg base resourc manag percept motiv polici behaviour action action unit freedom knowledg monitor activ manag knowledg base resourc manag agent user super user virtual user user agent figur interact user virtual environ user interact interact agent virtual charact figur layer abstract provid conveni decomposit relat abstract import concept design agent interact conveni creation modif agent level abstract enabl view examin distract detail control virtual charact complex synthesi task similar composit music piec design product creativ process inher make altern view problem find solut note act discoveri creation occur distinct recogn depict entiti level knowledg level interact repres hierarch user level detail visual depend current state mind complet illustr interact agent virtual environ shown figur type user agent repres virtual world user hierarch agent discuss autonom carri task control multipl layer complex comput program complex environ super access virtual initi user virtual agent agent user virtual agent repres avatar action complet control virtual user time work implement system base aha architectur exampl section exampl figur show agent user interact user agent interfac agent chosen agent user decid make time interact set behaviour agent user direct manipul control bend knee agent bit aha hierarch project develop gener system control agent illustr figur implement basic aha test simplifi scenario board call game figur show snapshot game progress player piec implement asynchron hierarch agent player rule game act autonom respect agent user interact layer player motiv trigger polici turn activ behaviour player proper die dof action unit action polici motiv walk store love show affect love hate angri close kick kick run left leg swing rotat behavior activ manag script bend knee agent user figur interact script direct manipul result action player home player posit player user agent decid kick advanc overwrit polici virtual user particip user agent support move piec set proper move command figur snapshot aha game current research effort gener aha system control agent virtual environ implement believ elementari motion tool custom blend overlap elementari motion figur show interact human locomot system agent user interact paramet step amount arm torso tilt walk run agent reflect direct manipul drag slider affect motion walk run algorithm aha movement call script person style motion set motiv polici layer futur work introduc framework hierarch agent discuss relev perspect interfac interfac support multipl level abstract facilit interact agent virtual user level involv time suit success demonstr basic principl aha architectur provid complex anim crowd creat person inform navig agent visitor project incorpor learn mechan agent improv adapt action time base user input action agent defin basic locomot custom veloc step length step frequenc shoulder rotat arm swing arm elbow minimum elbow maximum tilt displac rotat list hip flexion knee bend knee bend bend foot angl width toe heel strike empir knowledg physic knowledg knowledg joint angl phase constraint state constraint paramet locomot step attribut user figur direct manipul paramet human locomot refer blumberg blumberg direct autonom creatur virtual environ siggraph page august bonasso slack experi architectur reactiv agent intellig agent page brook robust layer control system mobil robot ieee journal robot april armin tom interact anim human run graphic interfac page mase open inventor submit public ferguson architectur mobil agent phd fischer pischel pragmat bdi architectur jp intellig agent page act creation muller thiel model reactiv behaviour vertic layer agent architectur woolridg intellig page norman psycholog everydai thing basic book ha simon scienc artifici mit
DB/1218 3 answer queri view arithmet comparison paper afrati nation technic athen greec chen li inform comput scienc ca mitra depart comput scienc stanford ca abstract problem answer queri queri view conjunct queri arithmet comparison order previou work consid limit variant give complet solut develop ecient algorithm obtain rewrit queri left predic queri show datalog identifi case datalog sucient show obtain rewrit decid introduct inform integr data wareh design queri optim problem answer queri view special signi canc problem state queri schema set view answer queri answer recent work address problem queri view conjunct good survei commerci user requir exibl pose queri conjunct queri arithmet comparison variabl constant domain real view conjunct queri arithmet comparison prior research address issu conjunct queri inequ result problem answer queri inequ predic view answer queri rewrit queri rewrit queri view queri rewrit queri expand queri replac view subgoal de nition equat notic presenc comparison predic ect exist rewrit di er answer variabl export constraint enforc rewrit queri view show power datalog rewrit show posit integ datalog program paper studi problem nding rewrit queri view queri view conjunct comparison call queri queri rewrit rst review preliminari result literatur problem give result exist singl map stronger section studi decid problem rst prove decid er case extend result nite union queri repres er address problem nding prove view variabl problem nite union express repres section problem gener queri view gener comparison present algorithm gener ecient show subtleti nding presenc make algorithm algorithm literatur section studi problem nding view variabl rst prove datalog present datalog predic sucient express show queri case reduc cq datalog queri base develop algorithm nding special obtain result independ problem np rest assumpt view export tupl world satisfi de nition view export subset tupl due space provid proof lemma theorem result explain complet version paper relat work problem close relat test queri problem cq shown shown cq inequ comparison predic left comparison problem np cq inequ comparison predic proven search class cq inequ comparison predic np state open problem studi comput complex queri problem queri cq datalog queri shown datalog queri studi problem answer queri view studi paper tabl summar result present result literatur deal problem answer cq descript logic view express descript logic descript logic express result datalog rewrit queri view variabl context descript logic unari binari put restrict result rewrit queri view express descript logic view variabl distinguish impli result preliminari section notat paper conjunct queri arithmet focu conjunct queri view arithmet comparison cm head repres result queri bodi ordinari subgoal variabl call distinguish variabl arithmet comparison form variabl constant ordinari subgoal oper sake repres conjunct arithmet conjunct queri arithmet comparison written mean ac queri obtain delet ac queri queri queri denot set answer subset answer queri denot chandra merlin show cq map gave theorem theorem ac impli restrict map logic impli union imag map assum variabl ordinari constant ordinari subgoal theorem variat result queri view refer cq cq union cq datalog cq datalog cq cq union cq cq comparison cq comparison union cq section variabl distinguish comparison cq cq comparison union cq section cq cq si section cq tabl result notic oper implic singl map answer queri problem queri view queri schema view answer queri answer notat de ne problem formal de nition queri set view denot exp obtain replac view base relat variabl view replac fresh variabl exp de nition queri view set queri rewrit queri view exp comput partial answer queri call rewrit exp rewrit cr cr exp properli exp rest algorithm develop answer queri bucket algorithm algorithm algorithm studi complex answer queri view shown problem nding rewrit queri view queri view conjunct paper studi construct er view notic cr languag di erent queri view shown section datalog repres exist singl theorem fundament result solv problem union oper logic implic make problem harder case queri view pure cq show clear construct ac ac di erent queri view shown figur queri ordinari subgoal di erent ac view figur er notic ac rewrit di erent ac problem easier solv case singl map prove case ac left call left ac form constant de ned similarli theorem theorem lsi queri singl map rst contribut paper theorem gener ac theorem theorem true gener ac result lsi queri paper true queri focu lsi queri sake simplic theorem corollari lemma lemma conjunct lsi conjunct gener ac er section studi decid nding rewrit rewrit queri view give decid proof case view variabl present decid result decid result theorem decid er view corollari decid er view studi decid nding assum view variabl distinguish theorem decid queri view variabl distinguish sketch cr construct set cr union singl map prove queri feasibl view variabl ac enforc consequ singl map number ordinari subgoal cr bound number ordinari subgoal queri rest paper investig case nding view variabl ecient algorithm nding lsi queri present algorithm gener queri view comparison algorithm base theorem proce nding map queri subgoal view algorithm literatur algorithm design case queri view cq restrict attent section point subtleti algorithm presenc arithmet comparison algorithm work step step creat bucket queri add map bucket step combin map add comparison produc rewrit construct bucket step queri subgoal construct bucket includ view rewrit answer view construct partial map view subgoal map queri argument view argument view put bucket map rewrit proce technic de nition modul illustr exampl export view variabl view queri subgoal comparison predic map view put restrict candid rewrit map section show view variabl export due comparison predic view de nition view variabl view export head homomorph inequ impli equal distinguish variabl discuss view variabl head homomorph view head variabl head homomorph head variabl view partit variabl partit equat rst section head homomorph head variabl due comparison predic head homomorph sound valid head homomorph equat comparison predic view entail de nition head head homomorph valid equat variabl consist comparison predic view find export variabl export variabl view comparison predic construct inequ graph denot comparison predic introduc node label edg label path node de nition variabl view denot includ distinguish variabl satisfi condit exist path inequ graph edg path label path distinguish variabl de ne variabl denot view variabl export lemma variabl view export nonempti export variabl view equat pair variabl export equal variabl path equat variabl variabl construct partial map queri subgoal subgoal view queri variabl map di erent view variabl queri view figur show graph order construct map queri subgoal view subgoal equat imag sati ed path graph path inequ equat variabl variabl similar argument hold inequ exist satisfi equat distinguish variabl figur graph fx fx fx fx note path relax wai equat variabl impli construct set pair view variabl algorithm construct valid partial map note head valid equat variabl equat variabl gener head homomorph head homomorph make comparison predic view sati view remov bucket queri view construct map map map queri comparison predic sati view cover queri subgoal satisfi arithmet comparison queri step combin view bucket answer queri subgoal combin repres candid add comparison predic satisfi comparison predic queri queri arithmet comparison map view variabl partial rewrit impli imag add rewrit add arithmet comparison rewrit case satisfi restrict case arithmet comparison view impli case path distinguish variabl add arithmet comparison rewrit satisfi queri view map queri subgoal view subgoal view partial map map variabl rewrit entail comparison predic belong case comparison predic satisfi inequ comparison predic belong case ii comparison predic add satisfi inequ comparison predic belong cover queri subgoal lack describ algorithm prove correct full version section show view variabl nite union express studi problem nding case view variabl distinguish section prove datalog repres section datalog predic sucient express show queri case reduc cq datalog queri base result develop algorithm nding case restrict attent section boolean queri datalog rst prove case view variabl view de nition nite union sucient express power datalog comparison predic proposit queri section nite union show datalog repres simplic similar exampl cover cwa case view comparison predic rest datalog sucient express queri singl inequ singl inequ inequ kind queri call queri assum view call view show queri queri reduc cq datalog queri base develop algorithm nding case rst present preliminari result rest section lemma singl si gener inequ singl si true lemma assum presenc si comparison predic lemma map map minim satisfi entail drop map make entail inequ inequ true singl inequ entail inequ reduc datalog program subsect part rst give procedur input queri output cq arithmet denot cq give procedur input queri output datalog program datalog prove cq datalog lemma critic subsect describ construct assum strict inequ si extend easili case si describ construct datalog cq show rst construct cq introduc unari edb predic constant introduc idb predic similarli ac form refer introduc rule cq copi regular subgoal ac add unari predic subgoal add set initi pair note cq cq cq run cq construct datalog program datalog datalog map rule map rule coupl rule coupl rule link rule link rule initi link rule initi link rule discuss detail construct datalog rst construct singl queri rule rst construct kind map coupl link rule introduc unari idb pair constant idb predic cq link rule pair inequ idb predic atom refer ac queri rule copi bodi subgoal replac ac map rule singl inequ bodi copi bodi queri delet head pair constant construct coupl rule rule construct link pair constant entail construct initi rule cq unari edb predic run show cq datalog unfold rule datalog transform program queri datalog cq map cq show theorem queri queri cq datalog result consequ reduct theorem complex check queri queri np algorithm algorithm comput datalog program cq transform straightforward datalog datalog queri futur decid nding queri comparison predic view comparison view variabl investig design ecient algorithm obtain er queri view solut scale refer abiteboul duschka complex answer queri materi view page mitra ullman gener ecient plan view page bayardo jr al semant integr inform open dynam environ page rousset rewrit queri view descript logic page acm lenzerini answer queri view descript logic knowledg base page juli august implic depend infer problem page chandra merlin optim implement conjunct queri relat data base page shim optim queri materi view page chaudhuri vardi datalog program page chawath al tsimmi integr heterogen inform sourc page kanellaki parallel evalu queri page duschka queri plan optim inform integr phd comput scienc stanford duschka genesereth answer queri view page optim manag data intens proc page grahn mendelzon tableau techniqu queri inform sourc global schema page widom constraint check partial inform page yang optim queri data sourc proc page weld adapt queri execut engin data integr page klug conjunct queri inequ journal januari complex problem conjunct queri predic page levi answer queri survei technic comput scienc washington srivastava answer queri view page ordil queri heterogen inform sourc sourc descript proc page mitra algorithm answer queri cientli view australasian levi scalabl algorithm answer queri view proc qian queri fold page ullman answer queri templat bind pattern page selli data con gurat proc ullman person commun ullman principl volum technolog comput scienc ullman inform integr logic view page van der meyden complex queri ind nite data linearli order domain
HCI/1219 4 august src research report partial replic softwar repositori timothi mann system research center lytton avenu palo california compaq system research center src charter advanc state art comput system basic appli research support compani busi object interest project span scalabl system distribut internet inform interact mobil src establish digit equip corpor test idea build hardwar softwar prototyp assess util realist set interest system complex evalu sole practic enabl investig properti depth experi short term refin design invalu long term advanc knowledg major advanc inform system includ person distribut internet perform complementari work mathemat charact li establish field theoret comput analysi geometr secur formal specif verif work explor ground motiv problem system research strongli commit commun test idea research develop commun lead improv understand research report seri supplement public journal technic note seri time dissemin recent research find seek user prototyp system common encourag collabor research partial replic softwar repositori timothi mann august timothi mann longer compaq reach electron mail address project web site compaq comput corpor work copi reproduc part commerci permiss copi part payment fee grant educ research provid partial copi includ notic copi permiss system research center compaq comput corpor palo acknowledg author individu contributor applic portion copyright notic republish requir payment fee system research center reserv abstract repositori replic file develop part softwar configur manag system major goal make softwar build reproduc repositori mean chang file design directori remain directori defin exist redefin data store repositori support distribut softwar develop natur repositori greatli simplifi problem maintain consist replica file directori store repositori global space repositori store complet space replic present store repositori data occur call concept partial repositori replic data store repositori paper outlin main featur give definit consist partial describ replic tool maintain briefli relat experi system distribut softwar develop group opposit coast unit state introduct repositori replic file develop part softwar configur manag system major goal develop make softwar build support flexibl form distribut softwar make system understand overview full system paper execut model languag increment builder report prepar make repositori understand conveni design extend file system version sourc code store repositori visibl file system user compar familiar tool provid mechan view make mean chang depend version exist repositori plug file system space act nf server export separ remot procedur call access oper map natur standard file system interfac repositori run ordinari user oper system kernel implement directori data structur stabl simpl log checkpoint techniqu implement file store content hidden nativ file system host machin support reproduc extend file system abstract file design mutabl directori design immut append exist delet mean chang children append directori append children immut directori immut builder read sourc code build instruct directori tree consist append immut mean chang build version built repositori set replac repositori tool handl version defin convent immut file directori version sourc file sourc tree discuss redesign system develop earli repositori recogniz kei idea present paper model languag design success build depend nonexist append ad append directori chang result make build fail succe append directori directori children immut object version higher level form hierarch space version softwar packag approach contrast softwar repositori version map straightforwardli space append repositori tree mutabl file repositori creat initi mutabl directori content immut creat immut directori snapshot mutabl directori oper implement file delta encod success version make fast avoid wast space repositori tool oper implement style sourc control repositori support builder provid mean dynam construct arbitrari space build tool compil call volatil directori volatil directori enabl builder run build tool encapsul desir version sourc deriv file give power direct control volatil directori builder detect depend result build tool repositori builder file directori build tool access file directori creat discuss volatil directori mechan deriv file manag paper support distribut softwar sourc store repositori append tree replic concept replic encompass sourc distribut issu cooper develop sourc pool geograph separ site file directori store repositori global space repositori store complet space replic present store repositori data occur call concept partial repositori replic data store repositori site run repositori replic sourc built store disk sourc code type human rapidli fall price disk delta encod compress file benefit store memori builder work repositori time sourc site replic sourc natur repositori greatli simplifi problem defin maintain consist replica roughli repositori case mean repositori make definit section ad append directori risk disagr requir multipl repositori adopt simpl design repositori master directori master complet list defin directori freeli add replica incomplet list add copi replica necessarili newli creat object initi master parent object transfer repositori free directori master storag burden complet copi object provid stub placehold exist content store local stub children append directori concept algorithm updat replica written simpl replic tool updat destin repositori sourc repositori tool walk sourc find match set pattern provid copi addit support repositori repositori mutabl attribut file directori store object attribut map arbitrari charact string set charact string valu tool attribut track relationship version record comment repositori attribut hold access control list attribut visibl mutabl build reproduc attribut arbitrarili replic handl differ file directori replic scheme inspir defin current attribut histori list timestamp updat tupl tupl valid past delet valid object attribut replica updat replica copi tupl exist merg list timestamp order ti broken sort field notion immut master append append master stub stub text thread cach tabl text cach thread gui figur repositori agreement histori merg produc result form replic looser agreement condit file adequ remaind paper discuss issu detail section full definit agreement replica show replica creat chang decentr fashion risk introduc disagr section describ replica updat section describ standard repositori tool oper multipl repositori access control secur difficult problem system cross administr section explain address issu design compar repositori relat work section section summar experi system replica agreement figur show repositori partial replic agreement figur illustr common pattern occur real pathnam shorten slightli reduc clutter left west coast repositori imaginari system east coast repositori note root directori master directli internet domain order avoid busi run global registri treat directori special individu organ creat internet domain western repositori creat hold master eastern repositori partial replic occur level tree part west replic eastern repositori western copi complet list eastern copi lack tabl western copi content cach stub creat cach directori clash copi eastern repositori level thread western copi master version eastern copi version text packag illustr point directori master master eastern repositori creat master western repositori move eastern version present west east eastern copi complet list stub version insert time receiv eastern copi master stub version master stub placehold object content master repositori free replac type chang back master stub repositori tool master stub implement lock style section definit readi give definit agreement sourc object defin condit hold repositori replica root directori denot master flag denot repositori denot list bound file ident content immut directori rule perfectli system check user domain good practic histor current repositori implement essenti variant type discuss paper append directori master stub stub condit effect sourc master repositori state condit agreement reflex condit requir replica immut object ident condit make partial replic append directori subset complet set defin directori master replica complet list master coordin creation assur bound replica sourc append directori stub object notic agreement relat transit agreement suffici agreement unavoid properti partial replic replica consid overlap portion overlap clash portion overlap immut directori repositori absent repositori immut file repositori master directori clash file preserv easi establish initi agreement repositori empti copi root directori repositori make repositori safe break agreement repositori oper import oper perform consult rest requir consult definit agreement design make fairli easi oper repositori server primit atom primit creat master append directori local internet domain creat child object immut append type master append directori replac master stub immut object replac child append directori stub copi child append directori possibl replac exist stub origin append copi empti append children copi applic primit origin copi includ descend creat stub append repositori defin transfer object repositori time ad stub master miss children master repositori build complex primit top set simpler primit ad replac singl featur short atom transact singl repositori primit run singl repositori primit requir consult atom transact suffici read data sourc atom insert copi destin lock sourc repositori read replac stub read simpli primit return error chang destin destin repositori optim copi process avoid make redund copi object multipl object content tabl local store immut file immut directori tree fingerprint object repositori fingerprint tabl find copi repositori link exist copi space make directori copi sourc destin repositori copi directori delta rel destin copi primit complex goal implement agreement avoid block repositori transfer minim likelihood failur result repositori hint object master repositori locat implement consist separ atom oper repositori object make complet list children turn master replic size nearbi distant nearbi distant empti repositori mb present kb empti repositori mb present kb tabl replic perform repositori acquir insert miss children copi stub turn master flag meet full implement care updat master locat stabl record transfer persist retri complet agreement object left master repositori crash perman network link perman sever transfer progress replic primit list previou section give safe copi data transfer section briefli describ replic standalon tool invok command line librari call tool section replic input set pathnam pattern network address sourc destin replic walk directori tree sourc find match pattern copi present destin updat mutabl attribut match merg updat tupl sourc destin trivial command replic version repositori sourc code local repositori repositori full pattern languag similar unix shell pattern extens prefix pattern add object match set prefix remov replic featur replic build command replic rebuild version repositori repositori local includ entir program environ build featur work build descript model languag walk import emit pattern packag pass pattern basic replic algorithm turn give idea replic tabl simpl measur repositori run mhz alpha processor time averag trial round figur nearbi repositori host machin directli connect ethernet distant machin opposit connect hop corpor intranet rough point column give time copi file directli nativ file system repositori built top site run separ repositori close user site check packag master copi site repositori section outlin tool support briefli describ explain extens case immut master append append master stub stub mutabl copi creat creat copi thread thread jone figur illustr figur make copi latest version softwar packag mutabl work directori user edit mention make copi mutabl directori store repositori implement delta file store tool make append directori call session directori user store privat version packag creat develop readi check session directori initi version ident initi content work directori version number packag reserv creat master stub number tool advanc privat version immut snapshot work directori insert session directori figur repeatedli edit file invok creat privat version tool support privat version conveni offer develop abil back recent work undo order build develop privat test builder oper immut sourc immut version creat time builder run modifi sourc gener run builder short shell script automat invok start tool make public version replac master reserv stub creat copi newest privat version session directori delet work directori end session session directori automat tool chang shown figur sourc packag check destin user work notic action destin repositori similar case figur step examin master replica sourc repositori find highest version number version exist call replic copi creat reserv stub empti session directori sourc repositori call replic copi destin repositori transfer sourc destin insert version session creat work directori destin immut master append append master stub stub mutabl give replica thread copi accept accept copi replica thread thread jone figur work session directori destin repositori strictli chang move reserv stub destin repositori sourc repositori copi version modifi call replic copi version check local tool creat branch version find latest find packag check tool requir minor modif similar simpler problem remain tool tool repositori short atom transact support make complet action atom support work multipl tool case step individu failur left incomplet state autom recoveri hard recov manual tabl show result perform benchmark tool step list run time separ packag tabl averag time round figur local column singl repositori nearbi case local remot repositori connect singl hop step descript local nearbi distant creat empti packag ms ms ms check packag ms ms ms copi kb sourc code ms ms ms advanc packag ms ms ms advanc ms ms ms touch kb file ms ms ms advanc packag ms ms ms touch file packag ms ms ms advanc packag ms ms ms check packag ms ms ms check packag ms ms ms touch kb file ms ms ms advanc packag ms ms ms check packag ms ms ms tabl repositori tool perform distant case repositori opposit coast connect ten hop corpor intranet note advanc local oper tool run client workstat connect local server mb ethernet tabl tool fast local nearbi fast usabl distant case access control access control replic repositori present challeng expect replic repositori repositori separ space user trust practic authent access check request repositori cooper replic access control repositori separ administ section outlin address issu access control list access check repositori term global princip syntax realm arbitrari chosen system typic internet domain make realm user valid email address repositori access control list close unix style manifest fairli accur nf interfac object owner acl group set flag grant directori search access unlik unix owner group set global provid featur object owner realm desir owner group manifest nf repositori search local realm repositori map global princip numer id nf interfac examin local oper system user group registri build translat tabl object special acl refer repositori list repositori object list repositori accept list repositori replica special acl control give read access request user suffici access control list flag store mutabl attribut replic desir save form object access control inherit parent directori access control attribut begin identifi charact replic instruct copi ordinari attribut copi incom request repositori authent user authent method support repositori administr fill tabl style nf export specifi user authent grant normal access implement insecur authent nf auth unix user numer unix user id believ trust host support current nf similar style user suppli global princip believ host trust realm design sketch ad authent hope implement futur gener model group access user authent user repositori determin group model work repositori local oper system facil determin group membership local user user access remot default recogn member group realm address repositori administr augment group membership tabl addit bit futur addit group membership tabl replic addit user group design alia person login realm cooper realm group work project relat work term repositori common softwar configur manag simpl collect version sourc file relat detail inform support softwar develop process van der hoek overview system repositori li store sourc file mutabl attribut hierarch provid unstructur storag deriv file manag builder cach replic mutabl data complex algorithm system strict consist impli low suitabl read write atom oper replica requir write intersect read write forc write perform atom transact loosen consist requir open box algorithm propag updat reconcil inconsist made replica difficult give definit make sort consist provid cut knot complex restrict mutabl data give definit consist partial replica preserv consist simpl algorithm approach replic differ sharpli close relat softwar configur manag system choic replic made coarser grain entir version object typic site replica exhibit eventu updat algorithm eventu make replica ident stop chang suffici clear differ exist replica made recent updat algorithm requir knowledg full set replica histori recent oper chang track propag replica algorithm work set replica unknown replic tool simpli compar state copi data miss desir approach approach scale replica share great deal data chang approach defin level support usag pattern replica perform adequ experi repositori implement nf server approach plug file system space includ intercept system call replac share librari connect kernel file system switch chose nf server approach compat static link applic approach measur system repositori slower kernel resid file system comparison repositori show write data rate standard nf read data rate compar perform oper build roughli fast faster build make convent file ow effici builder step typic build experi past daili group develop work larg microprocessor design chip design group custom design softwar store repositori process current code size line initi repositori product belong chip design develop ran replic distribut updat copi sourc code west reproduc build problem debug copi part chip design east west recent replic featur member england group began work mainten group develop california join chip design team repositori group made extens access control found experi highli valuabl valid shake bug featur initi anticip chip design team turn state strong support parallel sourc develop reproduc build save time month architectur design phase featur provid answer extrem difficult problem softwar design manag ongo work includ port implement make publicli open sourc complet report entir system acknowledg project extend contributor feedback repositori design special due roi allan yuan butler neil matt ken indebt chiu work repositori refer larri gari kenneth david john posner support softwar develop softwar configur workshop select page volum lectur note comput prime park ma concept dave david herman rao infrastructur softwar develop intern workshop softwar configur page volum lectur note comput schroeder distribut comput commun april andrew michael edward simpl effici implement small acm symposium oper system page associ comput novemb andrei broder applic rabin fingerprint method de sequenc method comput page mark brown john elli tool extend configur manag system src research report digit equip system research june chiu roi levin file system extens softwar develop src research report digit equip system research june susan hector dale consist partit network acm comput septemb david herman rao multipl file system walter configur volum trend page john wilei son david gifford weight vote replic data symposium oper system page acm decemb christin hanna roi levin languag configur manag src research report digit equip system research june allan jim roi timothi yuan yu softwar descript languag src technic note digit equip system research june allan roi timothi yuan yu system softwar configur manag src research compaq comput system research center allan roi timothi yuan yu approach softwar configur manag src research report compaq comput system research march allan roi yuan yu cach function call depend acm sigplan confer program languag design june roi levin paul approach configur larg softwar system src research report digit equip system research june bori fine grain version control configur intern workshop softwar configur page volum lectur note comput russel david steve dan bob lyon design implement sun network filesystem summer usenix page june andr van der antonio denni alexand wolf testb configur manag polici program ieee transact softwar engin
DB/1220 3 specif distribut pm visual specif queri find pattern data harri depart comput scienc interact lab abstract maryland colleg md ben shneiderman depart comput interact advanc comput institut system research maryland colleg md widespread interest discov featur trend seri gener tool support interact paper introduc power manipul metaphor specif queri dataset implement support interact formul modif speed process explor data set guid data mine includ window individu featur includ support graphic envelop displai extent entir data set result set queri extens involv express power gener tempor data set discuss categori subject descriptor interfac user user interact style applic data mine gener term human design keyword visual specif inform data graphic user interfac introduct interest data prompt substanti bodi work develop strategi store index tempor data algorithm statist method identifi pattern provid substanti function wide varieti situat algorithm research address aspect data mine problem question queri formul question worth left unansw problem involv identif seri similar seri involv specif queri paramet addit input user provid paramet defin rang similar identifi paramet process challeng central problem user effect small paramet similar toler hard gaug run multipl trial user tool support interact explor content data set provid analyst power quickli construct modifi examin result tool encourag develop understand data set understand guid construct speed process knowledg discoveri dynam queri relat inform visual techniqu proven support user interest understand abstract dataset combin graphic displai easili manipul widget queri formul user explor data set search item interest work date interact system queri lesson inform visual research guid develop system explor data set visual specif exist familiar graphic displai present obviou start point applic inform visual techniqu graph time continu variabl stock weather physiolog data exampl domain stock price familiar pattern identifi shorthand approach identifi trend interest paper introduc interact mechan queri tempor data set rectangular region directli manipul boundari region provid relev queri paramet introduc relat provid overview discuss data explor system base queri model function respect prior work time seri data discuss plan extens expand express power queri relat work data mine figur pattern interest stock trend analysi data mine commun develop wide varieti innov techniqu algorithm extract interest pattern time seri approach includ dynam time warp discret fourier transform combin spatial queri focu visual specif data mine work develop search attent queri specif interact system except agraw shape definit specifi queri term natur languag descript profil user interfac interact system support creation queri combin shape definit languag primit support progress refin queri address keogh suggest relev feedback result queri time seri data work aim develop tool address issu user interact data mine tool handl queri interest data mine offer model express complex queri support interact queri specif queri involv approxim match time warp translat outlier detect inform visual tradit graph familiar data displai visual data attempt improv util common techniqu data densiti displai serial period natur data set distort time axi realiz denser inform displai recent survei linear tempor visual found tool focu visual emphasi queri data set tool develop queri data provid earli search tempor pattern stock market text entri tradit widget tempor constraint innov tool sketch profil retriev similar similar defin euclidean distanc simplic sketch interfac euclidean distanc metric result result arrai explor support graphic edit queri tempor result set gener complex metric space approach produc user constrain result set retriev stock trade narrow rang month rise month visual specif interact tempor queri rectangular queri region drawn directli displai tempor data extent time axi specifi time period extent axi specifi constraint rang valu interest time period assum tempor data divid discret time point granular determin data set min min max max time rang dynam variabl rang min max creation user simpli click desir start point time box drag pointer desir locat opposit corner ident mechan creat rectangl draw oper familiar user drag locat resiz resiz handl corner similarli familiar interact queri process occur user current posit queri result set displai constrain occupi integr number time enforc discret natur data multipl combin conjunct queri data set match constraint impli activ order includ result set combin familiar idiom creation modif time box automat queri process interact environ suitabl data explor queri construct evalu quickli user constrain adequ complet describ queri advanc easili quickli wide rang modifi queri quickli effect queri paramet abil easili explor data identifi specif pattern gain understand data set queri involv monthli stock price month shown figur left restrict queri stock low price septemb restrict result stock high price decemb januari element form queri stock start low price rang move higher price rang addit ad search complex figur queri panic pattern similar figur addit visual specif succinct easi version queri visual pictur pattern appar notat queri figur easili interpret mathemat express cognit difficult user comprehend figur conjunct resiz handl shown sep nov dec feb mar apr jul aug sep tabl panic queri constraint develop motiv interest queri time seri data gener ordin dimens provid opportun queri sequenti data dna gener function enhanc includ interpret axi describ discret categori modif support search categor data set found medic record overview softwar pose queri set entiti vari attribut entiti static number time point definit point entiti data set multipl select menu specifi dynam attribut queri activ queri refer attribut initi data set involv monthli low high price set figur queri panic pattern visual specif month data set track month daili price year weekli price stock data set entiti data set displai window upper corner applic entiti label valu activ dynam attribut plot line graph complet detail entiti retriev simpli click graph desir relev inform displai upper window queri creation corner window queri input space space initi empti grid user simpli draw desir locat queri process begin user signifi complet box user press button explicitli start search queri process displai top half applic window updat show entiti match queri constraint time point correspond queri order simplifi interpret displai queri modif initi queri move resiz hand box icon lower toolbar switch creat case initi queri process begin immedi complet visual specif multipl modifi individu simultan group function search complex pattern user select standard simultan appli translat scale ax select search instanc pattern vari slightli scale modifi queri base item lower corner window detail describ individu user click detail extent displai window similar detail tool displai dwell queri guidelin creat modifi provid queri addit guid line extend corner back figur displai queri shown figur record result set visual specif indic extent box ax line leftmost corner extend bottom corner line move box creat user feedback queri extent drag drop user interest identifi entiti profil similar templat data set simpl mechan user simpli click entri data displai drag queri instanti queri queri result drag drop separ time point data set width queri valu center actual attribut entiti time point height set total rang attribut rang total rang attribut queri attribut time point envelop overview figur inform visual environ gener provid overview displai user make larg data set displai show entir data set user understand global trend visual specif identifi plan queri strategi altern present simplifi relev summari inform limit overview displai upper displai entiti data set linear list displai show small number item effect overview overview displai entiti thumbnail graph thumbnail displai linear arrang shown figur approach suffer shortcom data set dozen limit screen space restrict thumbnail tini area render virtual unread displai entiti separ graph user identifi global extrem valu attribut point time data envelop altern overview overcom difficulti option shown background queri data envelop contour extrem valu queri attribut point displai rang valu queri user execut data envelop extend queri envelop overlai outlin extrem valu entiti result set displai user graphic summari relationship result set data set data queri envelop provid user feedback strategi extend queri start data envelop highlight area fruit queri leav empti area unmark data envelop figur extend upper queri region return result updat queri envelop show differ current result set data set clarifi rang valu exclud queri envelop guid creation addit queri envelop match record figur queri window dat envelop figur queri displai data queri envelop visual specif addit overview inform statu line queri area displai text label indic number record match current result percentag bar indic portion data set includ text label indic treatment data softwar implement java swing toolkit widget flexibl perform concern definit widget interact style queri draw control data queri function move rescal provid jazz zoom toolkit written java develop interact laboratori maryland graph queri data envelop implement jazz widget widget implement java easili extend special addit support basic creation jazz support zoom view item scale futur version function provid facil zoom view portion graph detail longer zoom provid view provid detail context differ scale simpl approach data storag queri tempor data store flat file read ram queri process simpli iter optim queri case ad queri input natur conjunct shortcut check entiti satisfi constraint exist queri element significantli speed queri similar optim queri element delet render interleav queri item render wait queri process complet combin storag linear queri process work small data larger data set requir improv strategi storag requir linearli number item dataset number time queri process time current model linear size dataset complex queri string search algorithm suggest immedi speedup sublinear time plan extens queri facil requir altern data structur algorithm support queri pattern happen point visual specif fix time point implement effici algorithm deriv approach move complex queri larger data altern data structur spatial plan specif choic made area determin problem domain hope address discuss task involv retriev inform larg data queri formul crucial step process insuffici queri lead empti result set larg result set potenti irrelev result problem troublesom data mine applic queri execut strategi queri effect reduc overhead streamlin knowledg discoveri process research inform visual led develop strategi start view describ data set user manipul interfac control constraint item reduc size activ data set interact queri process displai updat provid user item filter remov displai filter control easili manipul encourag examin altern action process provid continu user data interest displai item addit filter ad reduc result set manag size implement model data data queri linear list graph provid overview envelop user bother place filter restrict data set result queri form queri process model familiar user modern treat complet user input extend model support realist data mine problem involv challeng queri express queri process queri express interest exact time occurr event interest import relationship time mere occurr visual specif support queri involv point time attribut valu user interest event fix durat occur point time event arbitrari event separ arbitrari time gap interest similar queri valu attribut desir model easili extend tempor data found video applic medic data data applic event arbitrari occur simultan user formul queri follow time relationship similar allen extens model involv addit mechan specif queri present result addit widget express rang time attribut valu visual relationship queri result data set static attribut dynam queri widget filter data set base item desir valu attribut queri process mention data storag model search algorithm made effici scalabl possibl involv queri index sequenc data al describ emb sequenc space base coeffici discret fourier transform sequenc build similarli convert frequenc domain search sequenti index approach requir address detail transform convert paramet input search algorithm integr visual queri specif tool base gener data mine process present addit challeng data set algorithm work interact system provid rapid updat search result displai interact queri system simpli compon process combin visual explor oper visual specif similar concern retriev data larg led develop queri preview develop address difficulti retriev inform network data store larg queri directli queri preview system summari count number record attribut smaller summari access browser restrict record filter mechan similar result set restrict manag small user invok oper request data variant approach prove interact queri conjunct data mine oper subset larger data set chosen form statist interact tool similar user work tool identifi pattern build preliminari understand data develop queri run data set queri execut data set data mine algorithm research mine data led develop wide varieti algorithm approach identifi pattern extract inform incorpor algorithm system support explor interact knowledg discoveri step make approach access wider rang user problem domain user popul stimul user gener question problem involv algorithm challeng support queri specif direct queri creat simpli draw box portion graph correspond rang valu interest demonstr oper model small data support data queri envelop displai overview inform plan includ extens model support queri express extens includ support queri aim find event arbitrari time attribut support queri similar interest data mine interfac data mine applic util encourag improv algorithm system design integr interact search facil process data mine applic visual specif util function usabl comparison altern approach empir studi clarifi benefit drawback suggest addit interfac improv interest extend work data set applic domain possibl includ gener class categor data medic histori genet express data experi acknowledg martin provid stock price kang valuabl feedback author support fellowship america onlin refer queri shape histori st vldb confer septemb agraw srikant mine sequenti pattern confer data engin march ieee comput societi fast similar search presenc translat st vldb confer septemb visual inform tight coupl dynam queri filter displai chi april acm jf maintain knowledg tempor interv commun extens zoomabl user interfac graphic toolkit java uist diego novemb acm dj find pattern time dynam program approach advanc discoveri data menlo aaai visual specif ja interact visual serial period data uist francisco novemb acm read inform vision san fast subsequ match sigmod acm gener chi april acm system analyz time seri data stock market domain dept comput end hit queri preview nasa global chang master directori intern journal digit librari ea compar timelin tempor trend analysi video data advanc visual interfac acm press el genom analysi gene express scienc octob mine time seri vldb confer relev feedback retriev time seri data sigir august acm understand wall street life person histori chi april acm seth er graphic summari patient statu august queri time seri data base similar ieee transact knowledg data design user interfac visual specif visual linear survei proc intern confer web inform system engin june ieee comput societi larg onlin data queri preview symposium paradigm inform visual manipul novemb acm press sketch graph queri time seri chi april acm press effici retriev similar time sequenc time warp intern confer data engin ieee comput societi
HCI/1221 4 person reflect develop instrument danc shoe music applic joseph mit media laboratori st ma usa abstract paper describ experi design develop extrem multimod sensor interfac built pair shoe discuss system trace motiv describ applic interact music danc summar lesson learn futur possibl inspir idea instrument shoe interact music perform cross mind moment decid pursu project trace demonstr attend media lab colleagu tod novemb visit research sponsor colleagu develop laboratori section show latest version music control electron bend sensor joint monitor dynam articul pair handheld control sport finger video clip longer modifi system shortli visit includ electron trigger toe heel fire sound enabl electron tap perform cord extend heel ran collect data entir ensembl transmit wirelessli nearbi receiv mapper figur show photo tod staff demonstr system dai difficult instrument master movement design choreograph plai note intend plai interfac continu multimod perform impress sensor properli adjust calibr id built kind electron music control time tokyo run brain opera id design sensor interfac system step area recent decid sponsor ieee confer wearabl comput media laboratori host concurr wearabl comput fashion show fall media lab piec technolog present confer worn exhibit show line shoe perform inspir fresh electron tap idea express foot train dancer limit interfac miss sensor famili type pressur sensor medic inerti sensor sport concept measur foot kind sensor unusu interfac interact virtual realiti gener throw lot technolog ignor feet sound produc foot contact floor extrem pair shoe respond free gestur air retain control contact floor shoe tether cabl wireless commun directli shoe remot music system conveni robust hardwar develop experi return media wrote design studi system includ type sensor imagin integr appropri shoe engin knew lot sensor essenti danc work collect instrument measur movement thought readili detect electron mount shoe fig show concept detail involv famili sensor measur pressur point bend tilt foot angl foot electron compass posit shoe sonar laser tracker notifi paper accept upcom ieee wearabl commit realiz recruit ms student build hardwar complet pair shoe time wearabl event octob actual shoe made shown fig postpon idea distribut sensor electron shoe buri suggest fig simplifi put system electron card time implement essenti sensor ref ad advic mit danc student select offer ampl room mount electron card outer interf minim dancer photo circuit card initi prototyp coupl repeat repair modif introduc fragil figur show block diagram sensor devic foil strip measur dynam pressur point front shoe ball point rear resist bend sensor measur bend sole direct nice flexibl copper strip bottom function electr field pickup place flat electr metal screen plate atop stage locat detect dancer stand measur height shoe capacit coupl elev electron card shoe includ acceleromet foot tilt rate gyro measur twist compass measur foot angl earth magnet acceleromet jump foot small sonar pickup card fig ping locat stage locat shoe triangul small microcomput collect data sensor produc serial data stream paramet time shoe small rf transmitt pc system gener midi command drive music fit camera batteri card power shoe system adequ hour time detail system publish shoe fulli function perform wearabl fashion show student chen softwar dealt shoe sonar wasnt fulli implement onboard pic code due complex interrupt protocol synchron shock acceleromet jump kick fast reliabl detect hz sampl piec foil circuit card flop dancer move produc easili discern signal shoe work dai demonstr perform octob rapidli deterior piec fall break circuitri eventu imposs repair adequ dancer foot hostil environ sensit weve remind repeatedli attach latch move break coupl design seri electron account lesson learn prototyp analog stretch techniqu shock enabl reliabl detect jump kick hz sampl elimin troublesom piec foil replac simpl slow extrem gimbal start stick dancer pound feet magnetomet made pressur sensor front shoe respond continu pressur dancer smoothli press sensor heel dynam pressur suggest collabor cornel danc ad pressur sensor tip dancer press toe floor foot point vertic clean trigger event move batteri circuit free room electron larger provid stabl perform life fairli simpl modif power condit circuitri improv factor dai life adequ danc practic perform modif onboard pic code base station enabl sonar work shoe feet algorithm run base station pc enabl clean recept sensor data shoe detail pictur current model shown fig card fig byron select costum collabor american danc festiv move air shoe suggest electron mount metal cover protect robust hold extrem notabl dress piec wearabl comput fashion show tokyo end work perform leap wear shoe gener launch arrai sound music event land hard high note larg piec hardwar hit guest audienc stop data flow process reliev find guest fine batteri circuitri carri thereon distrust batteri batteri perform event perform american danc festiv summer start piec note shoe respond stop show inspect dancer discov pic microcomput chip complet fallen socket end previou piec lost fallen student heard hit quickli recov occupi minut comb stage miss audienc found finish perform incid show piec tape pic press firmli socket pic time unabl socket easi remov piec system reliabl problem moment sensor made standard sensor cut held place tape standard shoe atop sensor provid protect sensor standard exit hole rear shoe connect sensor board dancer shoe find occur place wire due wire repeatedli bind pull sole bend back perform techniqu glu wire place point join sensor provid ampl abandon wire move sensor directli plate common approach sensor shown fig result collabor nation microelectron research center ireland electron occupi area outer side dont add larg amount weight materi introduc constrain motion dancer motion roll foot outward impact stub antenna dancer rotat bend foot stub data recept significantli shadow onboard transmitt suffici power replac loop antenna integr shoe bit stub work fine perform system futur edit smaller antenna higher transmit loop applic danc perform moment began make oper weve push system demonstr perform dancer explor util domain hz state devic slow work fast danc tap irish step danc lend modern danc style base free gestur time softwar ran demonstr written midi librari develop brain opera student hsiao main player wrote pc softwar implement deserv special mention philosophi music map fairli simpl pattern recognit routin run sensor data fire modifi sound accord determinist set rule learn dancer stand contrast interact danc project complex algorithm written extract gestur sensor data techniqu put control hand arm palett basic rule piec give perform comput abstract relationship observ action sonic begin potenti break audienc perform philosophi give dancer access suffici larg select simpl map enabl assembl deliv engag abstract deepli sophist level gestur determin put control dancer introduc larg asymmetri balanc bodili express system track upper bodi motion action direct feet produc sonic except electron tap shoe design scope opposit true interact video track respond motion basic limb deliv inform happen feet system gener requir adapt learn augment gestur foot activ produc sound figur show montag photo danc project photo video clip show excerpt perform project websit smaller video clip download touch music map detail provid ref music map construct wearabl ran atop continu run music sequenc shoe activ ad simpl effect atop rhythmic grid rule set extrem liter pressur sensor plai bend jump make crash produc wind tilt sequenc easi master project set fairli intuit continu plai note pressur sensor note bass bend bend shock sensor trigger larg sonic transient pressur sensor produc domin sound dancer move plai foot rock subtl motion respond dancer walk finish fulli function pair began work kind perform tokyo wearabl fashion show mention earlier tokyo toi fair design simpl explicit recognit system detect launch drum roll end larg orchestr hit land began work textur sound introduc shoe tilt plai rush note veloc depend tilt angl provid engag shoe move feet add emphasi sonic augment juggl action clear slave lower bodi upper bodi perform project weve point fascin direct futur broadcast compact sensor cluster system fix player enabl kind map content gener directli data point action extract interpret abstract video sequenc system work suffici engag choreograph began work byron cornel byron introduc colleagu david start creat effect danc demonstr spend dai adjust tweak sound bring aesthet accord movement gener began segment space discret stand electr field transmitt dancer plai adjust foot move rotat stop dancer full access note sound trigger sensor background pedestrian dancer stop sound stop evolv silenc restor greater perform maintain audienc percept dancer control work byron complic demonstr juli american danc festiv work pair dancer wear activ sonar track zone dancer stage produc effect trigger dancer stai posit long loop background sampl music select plai depend locat sampl dancer pull tilt activ progress introduc pitch reson depend foot move axi map design piec byron choreograph grid center electr field transmitt silenc sound produc dancer top byron student learn piec danc plan system respond except sonar failur serial port host pc lack impact guest choreograph shoe spend minut dynam interact gener sound design shoe system contribut mark easili engag mark displai except affin accomplish musician home world shoe address invit mark mit auditorium year give perform larg event media lab host made simpl modif adf map repair defin load sound toggl visit central electr field ad effect give dry sound close center stage progress sound trigger loop sampl music front pressur sensor push spent hour work mark refin tweak paramet live audienc result interest work weve clip entir perform post futur direct design system studi wrote suspect sensor incorpor sensor system proven total wrong turn sensor overlap respond differ dancer exploit freedom effect extra sensor measur enorm resolv ambigu sonar dancer jump land sonar result circuit card vibrat metal jump shock acceleromet provid effect spuriou sonar signal paramet stream manual construct map sensor signal level involv complex idea assumpt part trial practic dancer avoid gestur offer solut acut add sensor perform system work level gestur paramet relev danc music estim affect emot logic step instrument entir danc develop compact hardwar packag worn relev area bodi requir connect central convent interact danc todai address explor miniatur power manag scheme reduc batteri size mechan rapid configur individu electron perman mate size current system implement wireless telemetri basic transmit frequenc shoe develop scheme stage perform relai data directli lightweight sensor node depict figur mention challeng exist area data sensor featur music map express system iv paper intersect genr tactil music control span boundari music perform danc intersect interact danc system approach year perform space tend comfort side addit compet dancer capabl musician acknowledg peopl contribut success system id student environ group media lab work ari eric ari adler input artist collabor mia byron mark mark collabor nation microelectron research center ireland provid refer music ieee spectrum decemb pp brain opera instrument gestur sensor music interact journal music vol pp danc proc intern symposium wearabl ieee comput societi oct pp express ms mit depart electr engin comput scienc mit media cambridg applic electr field comput music pp ky hsiao interact proc xii colloquium music septemb pp wireless multisensor interfac dancer proc intern danc technolog temp feb pp music instrument danc proc intern comput music octob pp implement express ibm system volum octob pp manipul versu path softwar jm mit pp artist technic challeng work intern comput music confer model motor control comput motor elsevi scienc pp figur figur tod interfac expert coach tokyo lab figur initi conceptu diagram origin shoe system studi figur origin prototyp demonstr wearabl event held mit figur work prototyp shoe electron card figur block diagram final shoe sensor electron figur mit student dancer chen demonstr prototyp shoe wearabl comput fashion show figur recent pair instrument shoe figur recent electron card figur sensor base flexibl print built ireland figur shoe wearabl fashion show american danc festiv tokyo toi fair discov award lightweight network artist perform sensor system sensor system sensor system sensor arrai equip entir ensembl lower move transmitt simpler bluetooth protocol collabor base station figur wirelessli network interact danc ensembl
Agents/1222 1 hierarch optim process wang sridhar mahadevan depart comput scienc engin michigan state east mi usa abstract gener strategi approxim solv larg markov process origin problem interact solv independ account natur interact paper focu class process nonstationari manufactur robot natur interact subtl studi compon state transit probabl depend polici solv interact subproblem approach solv parallel fail present approach variant explicitli account mode dynam merg algorithm combin base level polici present detail result transfer larg manufactur task show hierarch approach faster outperform heurist run transfer line factori introduct aspect autonom includ act studi framework markov process unlik classic method solv reinforc learn framework solv mdp prior knowledg underli state dynam reward rl agent learn polici act dynam uncertain environ process rl larg number success recent fundament problem current techniqu dont scale larger problem categor approach scale rl gener class approach construct simpler mdp defin tempor abstract polici primit action abstract approach address scale issu model call hierarch machin model call method gener strategi scale rl origin intract larg mdp exampl research decomposit approach dean lin al parr singh approach mdp decomposit reli specif characterist problem origin problem divid origin mdp state complet partial decoupl navig problem subprocess directli affect action set coupl smaller mdp previou studi typic approach success paper gener approach class process domain work manufactur practic import exampl found domain robot plai elev serv half floor natur interact subtl problem compon transit probabl depend polici solv interact defeat approach solv parallel analyz charact present hierarch approach approxim solv explicitli account natur interact approach base averag reward algorithm call smart solv variant constitu level approach combin base polici final polici solv problem section introduc framework section provid inform wai includ previou work decomposit studi section describ transfer line problem manufactur show characterist problem make suitabl method section present hierarch algorithm section present detail result hierarch method appli larg transfer line compar reinforc learn algorithm section summar paper process introduc framework process sketch reinforc learn algorithm solv assum underli knowledg transit probabl reward process defin tupl set set set state action depend transit reward function give probabl transit time pair gener mdp princip action histori depend model transit time distribut action xy denot probabl action system transit state transit probabl function describ transit epoch natur process describ state trajectori time function probabl epoch occur time action execut state comput denot probabl system state time unit action state epoch calcul expect transit time epoch reward function consist fix reward result action state addit reward accumul rate time natur process remain state epoch note natur process chang state time rate reward accumul epoch vari expect reward system state action chosen express oe transit time denot state natur process demonstr algorithm find polici algorithm estim action function sum reward receiv polici action subsequ stationari polici defin xy max tempor differ current state actual state updat action valu expect transit time replac actual transit expect reward replac actual reward action valu updat ff imm max imm actual cumul reward earn epoch due action state ae averag ff learn rate paramet note ae reward estim ratio total reward total simul time taxonomi method provid inform wai includ studi past relat problem class studi paper mention prior method mdp focu specif class mdp problem state space origin problem divid subset creat smaller subproblem paper broaden concept state space compon action set higher polici origin problem introduc concept term problem satisfi process divid pm notat ff abbrevi stochast approxim updat rule process subproblem action chosen fix polici note notion abstractli affect doesnt origin problem set subproblem util solut subproblem solut problem matter origin problem redefin state action transit probabl reward function subproblem tabl give exampl classifi natur interact navig tabl typic class problem suitabl state decomposit origin state space simpli divid result smaller subproblem coupl interfac mark tabl expect state optim polici origin problem solv respect polici construct hierarch polici case state intern compon action set state transit inherit valu origin remain problem solv process problem approach action coupl action air campaign plan problem mdp studi singh problem appli resourc task action influenc avail resourc task transit probabl action affect polici solv kind state action set constitu affect problem solvabl polici remain part view mdp special case state decomposit room room room room navig problem state part reward function room redefin reward compon remain unchang action decomposit task task action set task mt air campaign plan problem coupl set action composit mdp studi action set composit mdp proper subset cross product compon action space polici decomposit polici fix polici fix polici fix transfer line influenc transit probabl problem discuss detail section tabl wai base interact transit probabl reward chang chang polici make complic coupl requir approach examin coupl gener origin problem coupl case occur intern compon action set transit inherit valu origin coupl stronger compon subject chang due polici decomposit problem possibl constitut coupl section introduc real world instanc polici transfer line problem section discuss approach solv problem stochast model transfer line manufactur problem studi system consist serial combin distinct goal satisfi target demand minim inventori machin ag subject breakdown repair period mainten avoid unnecessari costli repair transfer line model factori assembl product buffer machin reduc effect breakdown machin product process intract analyt comput optim control polici transfer line machin heurist control method constant kei disadvantag heurist address problem minim inventori cost includ cost product repair prevent mainten cost factor wed optim solv process model analyz transfer line simplest singl machin fix complic case multipl machin singl machin transfer line introduc transfer briefli examin model singl machin figur singl machin action space set machin suppli materi upstream buffer work send downstream buffer raw materi suppli suppli finish product buffer remov demand rate action produc increment machin run accumul lead high failur machin repair repair mainten time stochast variabl model distribut suppli rate demand rate figur singl machin inventori model time action process suppli demand rate state space sm singl machin transfer line vector denot run time machin mainten denot inventori size machin time continu simplic paper discret interv turn state space finit reward function rm machin previou fix reward type action posit reward neg cost continu item store buffer failur repair result fix cost includ function equat fix demand rate suppli machin transit xy state action singl machin model kind suppli rate machin demand includ paramet configur machin failur repair produc buffer unit product repair failur final unit cost inventori buffer configur paramet constant singl multipl machin transfer line transfer line multipl machin transfer line model assembl line oper sequenc machin make finish part figur suppli rate demand rate product rate figur transfer line multipl machin view larg suppli demand rate input output action space union expand individu machin action mn mi label action machin machin natur machin state space transfer line bigger cross product individu machin state space entir transfer line state space larger cross product individu machin state complet intract process transfer line upstream machin product rate downstream machin suppli downstream machin product rate upstream machin demand rate transfer line figur machin factor machin upstream influenc machin product rate machin machin line transfer machin demand rate demand rate transfer line process smaller process sequenti coupl machin product rate demand rate suppli rate figur model transfer line set significantli smaller singl machin product rate machin machin machin oper fix make machin model suppli rate demand rate demand rate transfer line machin product rate directli affect neighbor machin intern dynam charact make strongli coupl studi characterist requir solv problem hierarch faster approach optim hierarch optim algorithm describ hierarch optim combin offlin reinforc learn algorithm solv variant constitu onlin merg algorithm dynam recombin learn polici origin problem coupl wai approxim solv problem individu simultan learn polici machin independ run copi reinforc learn algorithm refer algorithm individu machin index transfer process depend machin suppli rate demand depend product rate machin machin product rate machin upstream downstream process machin vari make learn individu machin polici transfer line extrem difficult slow process transfer line smart algorithm modifi method section vide sequenc process coupl actual product rate train machin part transfer train machin isol smart varieti boundari suppli rate part target demand rate part consum machin line machin train optim transfer line select action oper dynam polici algorithm summar figur algorithm bear similar previou work parr creat subtask combin make optim optim polici problem dean lin work polici comput base estim valu system assum problem divid simpli state imposs transfer line problem ffl reinforc learn dmax dmax run smart algorithm singl machin transfer line rate store obtain polici figur ffl dynam merg machin time interv observ product rate machin observ product rate machin set run polici time figur hierarch algorithm optim transfer line note level lower reinforc learn level learn control individu machin action higher level abstract dynam polici merg step base observ suppli demand rate machin upstream downstream refer techniqu result section present detail result hierarch smart algorithm optim transfer line compar perform algorithm standard industri compar benefit hierarch decomposit optim algorithm result paramet unit cost singl product inventori cost failur mainten cost reward receiv machin failur time model normal distribut standard deviat repair exponenti distribut time mainten exponenti distribut time produc product distribut approach depend distribut cost conduct experi cost distribut model optim line begin compar smart machin transfer line problem heurist method note machin train part transfer line figur compar averag reward averag inventori size polici learn smart produc heurist graph show result time unit inventori buffer size machin total inventori rate result averag separ run averag reward polici learn smart significantli achiev improv partli due fact heurist incorpor mainten polici smart number time unit averag reward smart number time unit avg inventori figur compar averag reward inventori size learn smart transfer line produc heurist minim repair cost polici learn smart achiev reduct inventori size hierarch optim larg line turn hierarch divid optim process offlin train phase onlin merg phase offlin train machin train isol rate suppli rate ran smart time unit result shown figur note perform support rate higher demand fill inventori space smart job balanc product rate suppli demand rate higher averag reward support rate singl avg reward demand rate support rate singl avg reward smart demand rate figur averag reward smart variant creat vari suppli rate polici onlin merg reinsert machin dynam merg algorithm figur comput polici transfer line machin oper select learn observ rate set machin track suppli demand rate event closest polici big transfer line figur compar averag reward polici learn algorithm versu averag run approach figur result singl run flat hierarch smart suppli rate experi show larger scale optim hierarch smart method result dramat improv approach support rate demand rate machin flat hierarch smart number time unit machin averag reward flat hierarch smart figur comparison averag reward versu machin transfer line solid dot mean outperform approach averag reward plot machin transfer line transfer line machin explor question happen transfer line machin break frequent machin treat algorithm present previou train bottleneck machin machin merg polici machin middl transfer failur time time unit figur plot averag run approach result train machin separ polici merg step appli consequ approach uniform polici special polici number time unit machin tl figur machin transfer line machin index ignor bottleneck machin result shown pictur train add time onlin merg phase vari tempor interv polici merg show vari time interv control polici merg step affect perform figur show averag reward polici learn transfer line valu figur show averag run time rang frequent observ rate estim configur machin perform number time unit averag reward time interv figur valu machin transfer line futur work paper algorithm solv larg origin simpler strongli interact compon transit depend polici solv gener algorithm optim instanc transfer line algorithm method solv variant individu account mode interact dynam polici merg strategi abstract level comput polici entir transfer line result show approach superior heurist oper transfer approach learn control machin parallel issu remain unexplor research exampl possibl challeng transfer line task agent learn environ plai soccer view agent agent train reliabl plai agent fix polici recent work emploi train session stone issu remain investig deeper abstract maxq taxonomi decomposit method intuit formal gener algorithm solv arbitrari form special step forward acknowledg research support part nsf career award grant michigan state grant refer review product control research product oper manag comparison control mechan accept intern journal product research elev perform reinforc neural inform process system sh techniqu plan stochast maxq method hierarch reinforc intern confer machin learn experi hierarch schedul polici simpl manufactur system ieee confer texa hierarch framework manufactur system ieee confer lo ca manufactur system engin prentic hall reinforc preliminari tenth intern confer machin simul model analysi reward reinforc empir machin factori simul averag reward reinforc fourteenth intern machin learn confer fisher morgan kaufmann larg weakli coupl markov confer uncertainti decomposit algorithm weakli coupl markov problem confer uncertainti learn hierarchi advanc neural inform process system model tempor abstract advanc neural inform process system colorado mit press markov discret stochast dynam program wilei seri probabl mathemat statist john wilei hierarch make stochast manufactur system bertseka learn dynam channel alloc cellular telephon neural inform process system singh cohn dynam merg markov nip pull altern intern journal product research learn system phd carnegi mellon decemb reinforc mit ma bradford book learn tempor abstract intern confer machin learn pp
DB/1223 3 contact enrico dept comput univ manchest oxford manchest uk refer topic core data technolog research reason conceptu schema queri tempor alessandro dept uk enrico dept comput univ uk univ yu frank inst fur univ michael dept comput king uk special technolog tempor logic reason conceptu schema queri tempor alessandro artal dept comput uk enrico franconi dept comput scienc univ uk univ yu frank wolter inst fur informatik univ michael zakharyaschev dept comput scienc king uk abstract paper introduc logic intend tempor conceptu natur combin wellknown descript logic dlr linear tempor logic express power result logic illustr provid systemat import tempor data model literatur defin queri languag queri datalog program atom complex investig problem check queri constraint defin conceptu problem schema satisfi logic implic shown reason full identifi decid fragment dlr applic tempor oper formula entiti relat obtain hierarchi complex reason dlr atom formula satisfi logic implic arbitrari permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb dlr formula problem check queri datalog queri dlr constraint decid introduct tempor store histor potenti futur data tempor base tempor logic semant problem tempor conceptu model perform deduct task logic implic tempor logic flow time obviou solut problem fragment tempor logic refer success idea deviat paradigm start friendli languag descript logic area uniform framework conceptu model queri tempor descript logic design paper base express decid descript logic dlr logic reconstruct extens tool data model class diagram uml semant data approach recent paper extend ontolog languag semant network interest featur dlr abil complet defin entiti relat dlr view entiti relat conceptu schema dlr formula express larg class integr constraint typic exist type depend project unari full kei depend logic implic dlr practic correct complet algorithm exist implement system real applic dlr power languag conceptu data model problem queri process dlr constraint studi queri process turn inform data queri incomplet inform manag queri answer requir answer queri virtual dlr theori plai role conceptu schema integr inform set view queri answer datalog queri view refer predic defin dlr theori problem data close world assumpt check queri datalog queri decid nice featur natur extend tempor understand express power result hybrid respect tempor conceptu model view base queri investig comput properti paper report result attempt construct organ combin dlr proposit linear tempor logic serv tempor compon applic tempor oper syntact term schema previou approach tempor descript logic consid weaker languag tradit descript logic binari relat alc fragment tableau base algorithm studi survei approach tempor descript logic illustr express power provid formal semant mean import tempor conceptu model construct valid time literatur entityrelationship data model systemat construct present major tempor conceptu model system outcom eleg correspond tempor construct set formula tempor integr constraint captur addit formula investig comput properti reason relat logic queri datalog queri constraint conceptu schema full turn undecid main reason possibl postul binari relat vari small fragment dlr basic descript logic encod undecid tile problem fragment dlr depriv abil talk tempor persist illustr exampl comput behaviour obtain hierarchi complex reason dlr atom formula satisfi logic implic arbitrari dlr formula problem check queri datalog queri dlr constraint decid paper section introduc syntax semant work section discuss express tempor conceptu model section decid complex result prove satisfi logic implic dlr queri problem tempor conceptu data model adopt snapshot abstract tempor tempor conceptu flow time set time point binari relat assum isomorph regard map time point standard relat domain attribut interpret constant tempor conceptu schema languag tempor conceptu schema natur combin proposit linear tempor logic descript logic dlr snapshot model correspond timestamp bitempor conceptu data model rn en rn dn dn dn dn dn dn dn dn dn en figur syntax semant result tempor descript logic denot basic syntact type entiti unari ari relat ariti start set en atom entiti set rn atom relat defin induct entiti relat express shown upper part fig binari construct appli relat natur exce ariti tempor conceptu schema knowledg finit set atom formula formula form relat ariti abbrevi entiti relat tempor conceptu schema serv constraint tempor languag interpret tempor model tripl form set object domain interpret function entiti relat semant entiti relat express defin lower part fig oper dual time time entiti relat tempor oper past counterpart defin relat ariti top ari interpret subset cross product time point oper dual defin entiti relat remark fragment coincid dlr entiti relat express boolean construct select express denot relat ith argument type clear omit write project express cardin project oper ith argument relat coincid attribut version model replac argument posit number role formula interpret time point hold moment defin induct iff iff iff iff iff iff formula call satisfi tempor model time point conceptu schema satisfi conjunct formula satisfi write case call model global satisfi entiti relat satisfi time point impli write note entiti satisfi iff satisfi relat satisfi iff satisfi conceptu schema global satisfi iff satisfi iff satisfi reason task connect notion introduc reduc satisfi formula logic regard express fragment tempor logic cf section express capabl tempor conceptu model illustr section tempor queri import reason task problem queri survei discuss tempor datalog queri disjunct conjunct queri schema express form conjunct atom entiti relat sequenc distinguish existenti number agreement ariti variabl head union distinguish variabl existenti variabl make constant fix valu ariti number variabl note entiti relat queri occur conceptu schema approach similar atom queri constrain mean schema formula semant queri defin tempor model time point satisfi snapshot interpret regard usual structur snapshot time conform conceptu tempor model constant domain valu queri constant evalu queri ariti constraint model moment set queri constraint write tempor model time note queri satisfi queri schema determin reduc queri satisfi iff ariti conceptu schema introduc shortcut global atom formula entiti project manag project manag manag project manag project manag depart manag figur eer diagram theori introduc binari relat manag binari relat manag project pai slip number salari repres binari relat integ pai slip number uniqu identifi act state manag partit area manag top manag top manag particip relat top manag manag project project particip relat relat manag work project manag pass period mean conceptu schema except illustr left part diagram fig conceptu schema global logic impli top manag work project manag emp act note add formula work entiti relat mention conceptu schema interpret empti set model satisfi rel problem queri constraint express exemplifi schema queri hard queri constraint conceptu model dlr section show tempor descript logic provid formal semant import tempor conceptu model construct valid time literatur defin support form reason tempor conceptu model tempor queri reason servic implicit model extend model view eer model assign construct tempor interpret explicit tempor construct gregersen jensen call approach tempor dimens hidden interpret structur entiti relationship fragment captur eer model implicit time eer introduc establish correspond legal state eer diagram model deriv dlr theori encod correct eer model implicit eer standard data enrich isa disjoint cover full cardin constraint time shown dlr interpret tempor semant encod entiti relationship symbol eer diagram map dlr entiti relat domain symbol map addit entiti disjoint attribut entiti map binari relat number restrict state attribut relationship map mean addit argument relat isa link entiti relationship map atom disjoint cover constraint captur boolean connect cardin constraint map number restrict quantifi dlr singl attribut kei map number restrict knowledg base section show exact encod part tempor implicit eer diagram explicit tempor construct implicit approach appeal tempor conceptu explicit tempor constraint express abil add tempor construct top tempor implicit model advantag preserv semant convent eer schema tempor eer properti call upward compat possibl captur mean legaci tempor eer diagram crucial model data feder sourc collect tempor legaci agreement desir orthogon principl tempor construct separ independ relationship attribut depend applic tempor support decid design encod explicit tempor construct tempor entiti relat entiti relat instanc tempor set exist time function lifespan map pair object entiti express object relat associ lifespan entiti relat instanc dn dn express timestamp enforc entiti call temporari entiti extens call snapshot entiti temporari entiti relat captur past futur time point entiti hold instanc temporari entiti limit lifetim snapshot entiti relat captur entiti true necessarili true past futur time chang time snapshot entiti relat captur semant legaci diagram includ tempor enforc upward compat entiti relat constrain snapshot temporari constraint tempor indetermin call weak temporari worth note integr constraint involv futur time check integr tempor store fact valid time greater current consist check draw logic impli fact conceptu model reason capabl support design discov relev schema properti eer diagram fig manag desir featur tempor conceptu model trivial consequ temporari entiti temporari manag temporari constrain snapshot entiti lead contradict snapshot entiti temporari weak temporari entiti consist manag snapshot entiti snapshot fact necessarili snapshot valid logic implic temporari entiti temporari weak temporari entiti schema inconsist set snapshot partit temporari fact snapshot entiti logic theori particip snapshot relat snapshot entiti project snapshot entiti particip temporari relat temporari weak temporari entiti consist snapshot entiti project particip weak temporari relat manag tempor attribut point entiti valu associ attribut valid time ra attribut forc remain unchang ra note ra empti coincid interact tempor behaviour attribut owner consist snapshot attribut temporari entiti temporari attribut snapshot entiti semant lifespan entiti snapshot attribut mean instanc belong snapshot temporari attribut chang exist run snapshot salari model temporari model snapshot attribut tempor cardin cardin constraint limit particip entiti relationship tempor distinguish snapshot particip constraint point lifespan particip constraint entir exist standard cardin construct captur snapshot particip lifespan particip constraint defin instanc entiti particip ith argument tupl relat state manag manag project entir exist constrain manag project time enforc form lifespan cardin constraint respect past futur lifespan lifespan snapshot relat set instanc chang differ snapshot lifespan particip constraint respect snapshot relat dynam entiti model instanc class chang call object migrat sourc target entiti tempor conceptu model notion object migrat consid object instanc sourc object continu belong sourc sourc entiti target case dynam extens captur instanc target entiti instanc sourc moment past enforc dynam evolut dynam extens formula disjoint formula interest consequ dynam evolut target necessarili temporari sourc temporari weak temporari enforc evolut ad dynam evolut formula constrain past target object involv time sourc dynam extens dynam evolut student evolut aliv dead enforc absenc evolut typic incompat entiti male femal global consist restrict dynam behaviour entiti popul instanc moment moment true entiti empti requir moment time compani schema evolut problem schema evolut context store data consid worth surviv schema wide accept terminolog support schema evolut permit modif schema loss extant data simplifi case conceptu schema call monoton approach result conceptu schema compat previou global constraint complex combin express condit monoton atom possibl boolean combin atom schema portion condit check formula state properti true conceptu schema includ addit constraint simpl mean includ interest group salari top manag class case schema evolut express formula show variant tempor exist condit entiti start moment necessarili empti annual budget compani necessarili empti entiti singl project budget accept decid complex section comput behaviour fragment flow time restrict atom turn undecid theorem global satisfi problem conceptu schema atom formula undecid proof proof reduct undecid tile problem finit set squar tile fix orient colour decid tile grid set tile colour schema concept binari readili check global satisfi iff tile remark gener problem formula satisfi gener problem global logic implic involv atom undecid main reason simul grid possibl binari relat formula proof small fragment alc global role ground conjectur basic tempor eer model snapshot relat undecid fragment dlr tempor oper appli entiti exhibit comput behaviour case theorem flow time problem logic implic dlr involv atom formula formula satisfi problem problem logic dlr problem datalog queri dlr decid remark languag captur model construct discuss section case logic implic atom differ except global entiti schema evolut snapshot relat tempor cardin full dlr express requir relat theorem lead undecid remaind section sketch proof theorem make confin fragment dlr dlr stand main technic tool proof method develop idea notion repres state domain tempor model moment time finit domain object moment finit set evolut type time special function call run consist finit set dlr finit set close close concept occur belong concept type subset iff iff formula type subset iff iff pair set concept type formula type call candid candid satisfi denot conjunct concept concept form regard atom concept formula form regard atom formula sequenc run sequenc tn iff call condit tn run iff dlr denot closur negat set subformula subconcept theorem dlr satisfi iff proof satisfi model domain defin tn hard sequenc run show requir lemma lemma cardin formula satisfi domain proof dlr fragment countabl satisfi defin disjoint union copi xn xn hard requir cardin cardin run note tn lemma domain satisfi hard tempor defin satisfi moment satisfi problem dlr formula reduc check dlr queri ij ij denot closur negat set formula concept occur formula concept denot result replac subformula form dlr formula theorem rel iff rel proof loss gener assum model construct proof theorem show rel extend model atom form accord behaviour time point uc prove similarli theorem differ select problem dlr reduc satisfi problem dlr problem shown decid time check satisfi procedur decid candid set formula concept proposit prove reduct proposit dlr decid nexptim candid dlr queri decid rel candid set defin distinct problem properli arrang form past tempor flow time form sequenc sequenc element step formula step pair concept type suitabl iff finit sequenc length check condit pair concept form step sequenc pair adjac element iff formula form step extract satisfi distinct observ proposit construct expspac check algorithm check algorithm proof problem weaker found problem open exist expspac algorithm decid problem show logic implic atom formula dlr mean polynomi reduct dlr logic dlr reg dlr reg form transit closur binari relat satisfi problem dlr reg exptim simplifi reduc fragment dlr dlr tempor oper reader problem extend reduct languag fix binari relat defin translat dlr dlr reg atom commut remain lemma set atom dlr occur iff logic consequ set dlr reg proof model defin iff xn iff readili check model pair defin map easi theorem model work introduc tempor descript logic illustr express power provid time systemat tempor conceptu data model literatur tempor queri languag defin problem queri constraint defin conceptu schema investig tight complex result prove reason full logic shown decid obtain express dlr shown hierarchi complex reason dlr atom formula satisfi logic implic arbitrari dlr formula problem check queri datalog queri constraint arbitrari dlr formula decid expspac lower bound result decid result awar tempor conjunct queri express constraint refer van den bussch tempor versu logic queri tempor proc acm sigact sigmod sigart sym principl system page artal franconi reason enhanc tempor model proc intern workshop data model languag ieee comput societi august proc intern workshop knowledg meet proc intern workshop descript logic artal franconi tempor er model descript logic proc intern confer conceptu model novemb artal franconi survei tempor extens descript logic annal mathemat artifici de lenzerini decid queri constraint proc acm sigact sigmod sigart sym principl system page de lenzerini kei free descript logic proc intern workshop descript logic de rosati inform conceptu model reason support proc int conf cooper inform system page nardi descript logic conceptu data model chomicki saak nardi unifi formal artifici intellig chomicki tempor queri survei proc intern confer tempor logic page chomicki editor logic inform system chomicki toman tempor logic inform system chomicki saak chapter elmasri navath fundament system mandreoli semant approach schema evolut version proc intern conf comput logic dood stream juli franconi ng tool intellig conceptu model proc intern workshop knowledg meet reynold tempor mathemat foundat comput aspect oxford gregersen jensen tempor entityrelationship model survei ieee transact knowledg data gregersen js jensen conceptu model inform technic report aalborg gupta hall model transit proc page gupta hall abstract mechan model gener proc page zakharyaschev decid fragment tempor logic annal pure appli horrock fact intern workshop descript logic page tobi decid queri constraint descript logic intern confer logic program autom reason tobi practic reason express descript logic intern confer logic program autom reason page vassili concept base design data dwq demonstr acm sigmod intl confer manag jajodia al consensu glossari tempor concept tempor research page jensen snodgrass tempor data manag ieee transact knowledg data snodgrass unifi tempor data model conceptu model inform levi rousset combin horn rule descript logic artifici peter ozsu axiomat model dynam schema evolut system acm transact robinson undecid tile plan invent roddick survei schema version issu system inform softwar schild combin terminolog logic logic confer artifici octob sistla clark complex proposit linear tempor logic assoc comput model time conceptu perspect int conf inform knowledg manag sturm wolter tableau calculu tempor descript expand domain case journal logic wolter zakharyaschev satisfi problem descript logic modal oper proc intern confer principl knowledg reason page june wolter zakharyaschev modal descript modal role fundamenta wolter zakharyaschev descript logic proc page wolter zakharyaschev tempor descript logic gabbai de frontier combin system studi
Agents/1224 1 autom servic agent franc mt je wijngaard intellig interact distribut system faculti vrije universiteit de boelelaan hv netherland abstract agent adapt environ achiev servic agent separ servic capabl automat modifi agent paper discuss feasibl autom servic introduct agent typic oper dynam environ agent object cultur convent chang environ agent extent agent unabl cope agent adapt social environ requir modif exist agent agent commun protocol exampl agent detect gap fill gap learn mechan servic detect agent agent irrelev concept extern assist perform modif paper discuss feasibl servic autom section adapt discuss autom servic section adapt base exist prototyp autom servic provid section feasibl servic autom discuss section factori compar relat approach result present paper discuss section adapt agent static mobil agent encount adapt section illustr situat extern adapt feasibl focu inform gather agent inform gather agent assum mobil task find inform research travel arrang attend confer agent commun agent person assist travel bank interact web person assist agent inform inform gather agent prefer respect travel research travel prefer person assist acquir inform directli acquir time research experi inform gather agent maintain profil person assist adapt profil basi interact person assist agent encount negoti set note aim agent human user profil person assist inform gather agent consult find date locat confer confer page annot ontolog unfamiliar agent ontolog express xml ontolog express oil van approach problem inform gather agent acquir understand ontolog option intermediari agent find agent capabl translat simpl object access protocol case agent collabor assist interact confer site inform gather agent discuss travel arrang travel agent travel agent specif languag protocol discuss travel arrang inform gather agent acquir agent languag protocol compar acquisit ontolog sketch discuss inform gather agent travel issu credit rate inform gather agent prove travel agent trustworthi accept credit rate addit secur clearanc inform gather agent addit inform person assist agent inform gather agent permiss bank inform address specif bank agent bank requir certif inform gather agent specif secur measur provid inform inform gather agent function add function agent note ad function measur situat sketch agent adapt autom servic process type adapt involv agent provid profil specif current partner domain agent adapt includ knowledg specif domain understand specif agent commun languag protocol function characterist ad delet agent factori autom agent servic section descript agent previou research jonker treur focuss autom redesign system detail level autom servic servic paper extens work aspect distinct previou work factori present paper primarili focuss agent basi principl conceptu treur multiag factori build block agent specif templat templat skeleton describ architectur part agent compon build block templat compon combin rule distinct previou work broaden scope process factori modifi conceptu descript oper code necessit knowledg relationship conceptu descript oper descript templat compon basi autom servic process templat compon level instanc agent place conceptu templat compon remov ad satisfactori conceptu agent descript acquir basi configur templat compon conceptu descript agent oper descript agent gener facilit autom number assumpt made descript agent factori librari agent build templat compon configur task factori base knowledg characterist properti avail templat compon assumpt design agent feasibl autom servic agent depend larg assumpt design agent import underli assumpt agent adapt servic paper assumpt agent composit structur composit structur greatli facilit possibl remov chang part agent principl softwar rang describ process program booch program assumpt part agent templat compon build factori build agent correctli configur templat compon assumpt relat design pattern johnson librari softwar specif function problemsolv model de van de gener task model assumpt templat compon descript level conceptu descript oper descript assumpt circumv problem difficult determin conceptu descript basi oper descript system difficult determin oper descript system basi conceptu descript fourth assumpt properti knowledg properti describ templat compon templat compon facilit retriev work describ class diagnost method benjamin assumpt commit made specif languag ontolog languag descript templat compon level abstract left properti knowledg properti describ templat compon factori explicitli develop templat compon templat compon build block agent construct templat skeleton describ architectur part agent templat combin number templat compon compon build block conceptu number oper descript oper descript differ oper languag effici oper code templat compon combin conceptu descript oper descript templat compon configur templat compon combin open slot concept regul wai templat compon combin open slot templat compon properti level abstract prescrib properti entiti insert inform gather agent aim wim cm mai ast xml html agent templat xml html compon figur graphic templat compon slot depict figur templat compon slot specif agent detail section templat compon insert open slot compon compon insert open slot compon open slot counterpart conceptu descript oper descript templat architectur agent figur inform gather agent shown consist process explain section process fill combin templat compon open slot world interact manag process shown fill provid specif function interact web page annot html xml exist open slot impli relationship conceptu oper descript respect slot relationship open slot conceptu descript oper descript oper descript fulfil function behaviour properti state conceptu properti preserv relationship conceptu oper descript impli templat compon combin configur level abstract process facilit gener oper basi configur templat compon conceptu oper code gener straightforward explain section detail templat compon build block templat depict figur structur make commit specif conceptu oper descript includ type inform includ structur design describ design pattern characterist conceptu oper conceptu level properti templat compon properti open slot properti oper level properti templat compon properti open slot properti conceptu level descript oper level descript figur structur templat compon factori characterist build block describ creation version inform inform relat conceptu oper descript insid build block assumpt requir satisfi environ open slot templat open build block build block specif sort requir input unord list element consist unknown part explicit kei describ languag conceptu level oper level descript properti templat compon conceptu level divid properti templat properti open slot exampl conceptu level properti skeleton agent capabl commun capabl interact capabl retain inform agent world conceptu level properti open slot specif open slot agent commun languag syntax express xml templat properti oper level includ properti agent size specif class properti open slot argument specif open slot specif ment pointer data structur specif class result conceptu level descript oper descript build block commit languag made open slot descript retriev build block factori retriev templat compon basi adapt redesign process insid factori adapt transform requir agent construct agent design configur templat compon satisfi requir match requir behaviour agent properti templat compon trivial requir vagu solv match process understand properti involv properti relat properti network gener properti refin number set refin properti assumpt gener properti agent set refin properti hold refin properti set gener properti hold number refin exist specif includ refin tree refin tree combin properti network explor altern refin properti properti specif algorithm sort algorithm refin specif properti sort algorithm linear properti refin specif properti number kei primari kei altern properti refin properti properti algorithm classif algorithm match process variabl form interpret form interpret requir properti explicitli present build block altern properti high level properti algorithm order list build block refin specif properti algorithm order arrai element build block found build block exist specif fulfil desir properti elabor mean queri interpret semant properti network return good necessarili optim answer build block similar properti return notion similar tune distanc travel properti process adapt factori adapt exist agent basi adapt factori agent factori obtain initi set requir properti descript agent adapt initi set requir properti manipul conflict form set refin requir properti relat initi specif involv check librari templat compon presenc templat compon specif properti make sort algorithm time build block basi specif set requir conceptu descript agent adapt build block requir properti satisfi addit adapt set requir properti requir prove set requir properti base previou set requir properti evalu success failur construct satisfactori conceptu descript point decid satisfactori conceptu descript agent satisfi specif set requir properti initi set requir point factori adapt oper descript agent oper descript agent base configur templat compon conceptu descript agent problem occur combin oper descript templat templat compon conceptu descript oper descript conceptu descript agent process repeat addit requir autom servic inform gather agent paper agent requir servic adapt inform gather agent base exist prototyp autom servic servic conceptu descript templat compon desir model languag oper descript java inform gather agent process control agent interact manag world interact manag cooper manag agent specif task mainten agent inform mainten world inform figur process insid inform gather agent includ agent interfac inform transfer defin inform gather agent base templat gener agent model figur illustr process distinguish gener model architectur model agent reason process process commun agent agent interact maintain inform agent mainten agent interact extern world world interact maintain inform extern world mainten world particip project cooper agent specif task agent specif model agent includ compon manag interact agent includ interact extern agent specif task agent receiv messag observ extern world send messag agent direct observ action extern world section exampl adapt inform gather agent inform gather agent adapt includ function understand languag inform gather agent adapt includ function secur commun shallow adapt figur depict inform gather agent show agent interact manag process manag process open slot open slot agent interact manag process fill compon provid function understand commun languag person assist inform provid access open slot manag process fill compon provid function understand person assist inform provid inform gather agent aim wim cm mai ast figur partial descript inform gather agent open slot agent interact manag manag process fill compon agent commun languag protocol adapt identifi section inform gather agent interact travel agent travel agent specif languag protocol emploi inform gather agent approach problem factori understand languag protocol interact travel agent factori search librari templat compon find compon support function requir compon descript level descript link descript inform gather agent result descript inform gather depict figur inform gather agent aim wim cm mai ast person assist comm figur inform gather agent adapt includ function languag protocol interact travel agent compon insert conceptu descript agent achiev oper part compon insert oper descript agent deep adapt section adapt commun bank agent agent requir inform gather agent specif secur function inform gather agent factori adapt factori goal adapt inform gather agent specif secur function function understand languag protocol share bank agent case previou subsect adapt inform gather agent includ specif secur function translat factori adapt agent includ function secur commun secur process awar templat retriev librari templat secur commun templat secur templat deriv form templat current configur templat compon inform gather agent aim wim cm mai ast secur comm secur coop person assist comm person assist prot figur inform gather agent adapt includ function secur commun function understand languag protocol interact bank agent shown figur inform gather agent modifi templat insert open slot topmost origin fill open slot insert open slot templat feasibl feasibl factori hing number aspect aspect briefli section comparison factori approach construct agent section crucial aspect number aspect crucial feasibl factori aspect concern templat compon insert templat compon open slot templat compon involv understand properti open prescrib properti entiti properti relat conceptu descript templat compon connect open slot involv map conceptu descript oper descript templat compon connect open slot involv map oper descript multipl compon insert open slot stack descript languag emploi experi current prototyp confid feasibl research comparison approach factori compar agent construct softwar configur design factori approach combin templat compon similar approach develop softwar distinct approach approach includ annot templat compon level abstract interfac compon independ oper correl open slot templat compon perspect mean describ oper descript build block factori larg number tool framework exist creation agent autom exampl includ zeu approach commit specif oper descript commit specif conceptu descript agent factori make make factori gener common advantag factori aim pragmat circumv number issu relat softwar reusabl major problem annot reusabl piec softwar retriev time minim number factori endeavour solv pragmat templat compon map provid annot scalabl current foci research import factori aim adher specif number standard reason approach watson librari case consult find case match retriev case adapt approach differ factori case modifi combin case techniqu retriev case case librari relev retriev templat compon librari approach commonkad de van de elev configur focu construct satisfactori configur element basi set requir approach explicit manipul requir descript element account model theori design relev multiag process involv combin conceptu oper descript discuss autom servic process agent adapt paper servic process factori agent construct templat compon adapt agent entail adapt configur templat compon assumpt underli approach agent composit part agent level descript conceptu properti knowledg properti commit made specif languag ontolog main advantag factori autom servic process agent easili obtain oblig agent adapt mechan lifetim agent acquir skill knowledg factori current research build librari templat design descript languag properti knowledg templat learn experi conceptu oper descript design implement extens prototyp investig secur trust factori acknowledg author graduat student david explor work applic factori inform retriev agent refer booch object orient design applic redwood benjamin publish compani simpl object access protocol benjamin method diagnosi role knowledg acquisit intern journal expert research perli softwar reusabl volum concept model acm maler extens markup languag technic report treur model project coordin framework proc workshop enabl infrastructur collabor wet lo ieee comput societi pp treur principl composit system develop ifip world comput confer inform technolog knowledg pp treur composit design gener agent model appli artifici intellig wijngaard evolut system gero sixth intern confer ai kluwer academ publish pp venkatesh learn agent prefer multiag negoti nation confer artifici intellig pp van klein oil nutshel european workshop knowledg manag lectur note artifici ge ru agent tcl zyda mobil explan man vlissid design element reusabl softwar addison weslei hopkin compon primer commun jackson principl program academ press ma jackson softwar requir specif kolodn reason san morgan colli approach build distribut system intern confer autonom agent pp design design pattern reusabl softwar design artifici intellig design kluwer academ pp softwar approach fourth seri comput compani system integr toolkit construct intellig softwar agent white februari design heurist read addison weslei publish booch unifi model languag refer manual addison de van de wielinga knowledg engin commonkad methodolog mit birmingham special issu intern journal humancomput studi practic issu agent technolog intern confer practic applic intellig agent technolog lesson learn year compon develop commun stefik introduct knowledg system san morgan kaufmann publish review knowledg engin financ person touch commun special issu requir framework understand wilei sycara taxonomi internet fourth intern confer system
DB/1225 3 signatur cach object system ag depart comput inform scienc norwegian scienc norwai abstract present approach contrast tradit signatur file signatur store separ signatur approach store object frequent access signatur store main memori signatur cach signatur store filter perfect match number object retriev perfect match queri reduc updat cost signatur smaller object kei object signatur buffer queri process introduct emerg applic area data view collect object access pattern navig typic applic area storag xml data prefer store object system store relat system system typic characterist applic larg fraction access perfect match access word text string signatur file reduc queri cost signatur bit gener appli hash function attribut object note signatur function signatur implement signatur preprint submit data knowledg engin septemb main drawback tradit signatur file signatur file mainten costli attribut contribut signatur object signatur file updat high read write ratio case dynam signatur file high select queri time make benefici read signatur file addit object present approach store signatur separ signatur signatur store frequent access signatur addit store signatur cach signatur gener smaller number signatur higher number object store main memori buffer object updat signatur store extra insert cost margin signatur reduc cpu cost object memori describ detail mainten analyz perform cost function access gain depend access pattern show gain approach access pattern discuss context approach applic relat system system experienc navig access pattern assum tradit note approach prove context mobil reduct amount data transfer client server impact perform tradit system organ rest paper section give overview relat work section give applic signatur emploi improv perform section give introduct signatur section describ approach section develop cost section studi perform section conclud paper outlin issu research relat work studi signatur text access signatur ordinari queri signatur file techniqu shown benefici queri object la bd du franc ff good food monei famou place writer de fig element restaur guid previou paper signatur odb logic oid odb logic oid index map logic oid physic locat signatur store map inform index problem oid index updat object make suitabl static tempor odb oid index updat object updat relat work paper xml extens commerci system oracl ibm system text index text speed queri system store xml data xylem benefit techniqu paper motiv section describ applic typic queri techniqu present paper emploi improv perform inspir restaur guid big good restaur reserv order tabl foreign tourist plan trip nice central book servic select restaur book reserv citi countri languag problem make job select fig queri restaur guid assum function support string class return true actual word includ string assum compani provid servic compani provid restaur guid xml document citi xml document consist restaur includ address price review possibl inform restaur element shown fig post xml document store collect object xml document gener data guid implement collect restaur object restaur object includ text attribut addit provid list system provid possibl user queri order guid select restaur translat queri intern queri languag queri restaur pari famou good queri languag formul shown fig point note access queri perfect match access test string match singl word signatur section describ gener signatur reduc cost perfect match signatur storag altern signatur gener signatur gener appli hash function attribut object appli hash signatur bit denot attribut object signatur object hash gener attribut object necessarili includ gener signatur hash concaten attribut signatur queri set attribut gener signatur index case lower cost order support queri perfect match set techniqu call code separ attribut signatur gener attribut object signatur gener perform attribut signatur object attribut signatur result signatur flexibl support type attribut attribut creat signatur attribut frequent gener signatur attribut case string xml gener separ signatur distinct word string word signatur case number distinct word object signatur typic queri find object collect object attribut match number queri predic calcul queri signatur code queri signatur compar signatur signatur file find match object match object satisfi condit bit posit set queri set object signatur drop form set candid object object match signatur match valu search candid object retriev match set search candid object match call drop signatur file signatur store signatur separ file object relev set size file gener smaller size object signatur gener scan signatur file signatur signatur object object signatur signatur signatur disk page object object object signatur signatur object object signatur signatur signatur disk page object object object signatur signatur object object signatur signatur signatur disk page object object object page buffer signatur signatur object object signatur signatur signatur disk page object object object signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur signatur cach main memori fig storag object page signatur main memori page buffer signatur cach cheaper scan object storag structur signatur sequenti signatur file signatur file simplest signatur file signatur store sequenti file separ pointer file provid map signatur object pointer file typic file signatur search perfect signatur file read updat updat entri file bit signatur store separ file signatur size signatur distribut file approach larg signatur search file bit field queri signatur reduc search time updat impli updat retriev cost shown smaller updat cost time higher uncommon base approach static data support dynam signatur file method multiwai tree variant hash file variant approach altern store signatur separ signatur file store object object addit store frequent access signatur signatur cach illustr fig lookup tabl replac signatur lru polici paper assum clock algorithm access bit signatur signatur store page object impli object resid main memori page object resid resid page signatur store page opposit signatur resid object resid buffer page discard page signatur object page resid perfect match access signatur reduc number object retriev disk candid match retriev order identifi signatur signatur uniqu identifi odb system physic tupl identifi concaten relat kei signatur gener smaller number signatur higher number object store main memori buffer fact effect space util object page buffer low bad cluster object page amount relev signatur rel relev object optim size depend access pattern total buffer size rel total size order total buffer size give stabl perform discuss detail wide rang workload paramet signatur maintain object benefici decid granular object class object call signatur queri consid benefici respect queri cost similar tradit secondari index creat maintain consid benefici decid index queri consid benefici decid queri note store signatur object reduc space object reduct optim size signatur approach small order advantag approach approach advantag import signatur benefici static data low updat text document dynam signatur file updat rate low signatur improv perform dynam signatur file higher space requir search cost compar contrast separ signatur approach case high updat rate signatur gener smaller object creat object updat signatur store extra insert cost margin moder amount main memori page buffer hit rate margin reduc read access relat system frequent set access benefit tradit signatur file read access odb navig case collect navig result unlik relat system queri set relat collect collect refer object object object belong navig make averag signatur retriev cost high signatur store separ file frequent access signatur store cost significantli reduc signatur reduc signatur reduc cpu cost object resid main signatur comparison match attribut case larg reduc cpu cost queri process attribut algorithm determin object time maintain content lookup object signatur access bit signatur set lookup signatur retriev page object store page resid page page retriev disk page signatur store insert access bit signatur set signatur insert signatur compar queri signatur bit posit set set object match queri predic bit posit set set object retriev object order compar attribut queri predic page object store page buffer access brought buffer order retriev signatur object page retriev disk queri collect object object note emploi signatur outlin algorithm cpu cost signatur compar object compar search predic scan oper singl scan oper make signatur store replac desir reason signatur retriev scan oper gener chanc collect scan repres hot set number signatur retriev scan larger number signatur fit shortli scan hit probabl similar gener buffer manag case scan oper strategi order avoid problem scan oper involv larg number object strategi insert signatur retriev scan oper signatur store strategi avoid time opportun benefit scan oper involv small number object variant strategi insert signatur scan oper involv small moder number insert signatur scan involv larg number object difficult number object involv scan safe simpli limit number signatur object class store slot occupi class achiev maintain number signatur object object class page server object class server limit number object identifi encod oid object updat mainten time object signatur modifi signatur store respect concurr log signatur treat part object signatur object resid signatur updat impli lookup object updat compar number cpu instruct provid persist storag lookup cost margin signatur contribut read queri benefici signatur updat access bit set read access make signatur stai redund signatur main memori signatur store page object signatur resid main signatur store place order optim memori store signatur object resid main memori remov signatur object page object page retriev page buffer good remov reinsert signatur page significantli cpu cost page discard page difficult signatur reinsert difficult maintain lru easi solut insert signatur object page gener signatur page spot pollut result reduct hit effect kill benefit memori problem strategi signatur object necessarili collect simpl attribut tupl relat system object method consid refer object queri collect object due concept inherit describ issu handl respect signatur complex object path express object signatur attribut simpli treat bit string attribut oid refer oid simpli hash attribut consid path express signatur gener similar path express index defin simpli hash refer attribut hash significantli cost complex signatur time attrib signatur base attrib updat queri path express approach benefici inherit signatur object object class attribut creat signatur object class subset attribut creat signatur object signatur size hash function case signatur superclass subclass larger signatur size subclass number attribut higher queri collect object superclass separ queri signatur gener subclass note signatur object gener compar signatur object queri queri signatur base class object belong assum class class inherit class signatur size class queri collect collect object object queri queri signatur queri signatur object class queri signatur object class signatur recalcul strictli store signatur object disk signatur recalcul object retriev save disk space page buffer hit rate total number object page cpu cost cpu speed higher rate disk signatur recalcul signatur storag benefici altern attract futur main part analyt studi paper assum signatur store studi cost reduc recalcul page dual buffer altern fine granular buffer combin page buffer fine granular buffer object call dual buffer dual buffer cluster page page object cluster page object buffer studi client side dual buffer kemper kossmann show dual buffer give substanti higher buffer perform page buffer dual buffer introduc option make tune copi object page buffer object copi dirti object object buffer back home page make clear dual buffer perform system complex workload studi show dual buffer benefici workload read queri updat queri gain neg page buffer paper note workload dual buffer perform improv addit fine granular buffer signatur analyt model order studi gain develop cost model model object access cost cost model disk access cost factor addit updat cost oid oid oid oid oid fig partit data area partit fraction data access partit store size signatur compar object small studi paper analyz effect signatur focu navig access restrict analysi signatur gener code techniqu system model paper page server odb odb total byte buffer talk memori size part main memori buffer recent object page page buffer size recent signatur size main memori size sum size page buffer buffer hit rate import accur buffer hit model dan dia lru buffer model import featur bdd make power access distribut bdd model size data granul partit partit illustr fig partit fraction data access partit distribut partit assum access assum independ denot access pattern studi perform access set bdd buffer model briefli explain main equat bdd deriv detail equat found access number distinct data granul index partit access distinct total number distinct data granul access distinct distinct number access number distinct data granul access buffer size number data granul fit buffer hit probabl partit buffer hit probabl steadi state averag buffer hit probabl approxim buffer hit ratio buffer chosen largest distinct denot averag buffer hit probabl buf chosen page buffer hit rate number disk page store obj assum page size averag object size obj obj obj store bit signatur object object page number disk page obj obj page buffer size byte overhead item buffer sp page main memori buffer hit rate case buf page buf hit rate signatur store object identifi inform order object belong store oid variant prefix compress multi level access tabl emploi assum id byte averag object signatur belong number signatur fit id hit rate buf obj object access cost object store disk page denot time read write page averag cost read page buf page order reduc object access object disk page make object page futur call cluster defin cluster factor fraction object page page obj object object page page discard page page averag object size larger disk defin averag object access cost cn page model read access ordinari object perfect match benefit signatur assum perfect match access fraction read pa fraction match object actual drop drop probabl signatur bit gener denot ln averag object access cost emploi signatur sig cost access access signatur access signatur pa mean access perfect read object page case actual drop perform deriv cost function calcul averag object access system paramet access signatur section studi valu paramet affect access cost paramet kb ms byte id byte tabl default system model paramet paramet case case ii obj byte byte obj mill mill attribut attribut pa bit bit tabl default workload paramet workload model stabl total obj object system model paramet summar tabl main case workload tradit applic object size signatur gener small number attribut mix access benefit signatur case workload emerg applic xml storag dewitt al space overhead high xml element store separ object object store xml xml element store insid storag object result larger object case object higher number attribut attribut frequent text larg fraction queri system perfect match memori size db cost memori size db fig cost signatur size case case ii word order signatur object signatur gener individu text word signatur larg default paramet valu case tabl note default total size studi size gb case ii larg interest point perform versu rel memori size size rel result scale larger memori size fraction total gain signatur independ size memori size memori size rel obj obj signatur memori page memori note object access cost depend cluster factor gain signatur independ gain valu optim signatur size studi perform gain determin signatur size signatur size tradeoff larg signatur reduc drop larg signatur reduc number signatur larg signatur break assumpt signatur smaller signatur mainten cost fig illustr access cost signatur size note order interest area cost scale logarithm cut case suitabl signatur size system smallest reason signatur cpu word size bit signatur size depend heavili number attribut memori size db cost memori size db fig cost amount memori reserv signatur cach case case ii contribut signatur optim signatur size evid case suitabl signatur size decid signatur size import mind signatur size easili chang small reorgan reserv space larger signatur object page optim size fraction memori cach signatur depend total memori workload size static adapt cost function determin difficult exact access pattern order evalu signatur size studi perform affect size illustr fig show averag object access cost size case optim fraction memori cach signatur depend total memori size larger size perform accept differ cost case larg note signatur case requir larger size import frequent access signatur larg size impact perform memori size db gain memori size db fig gain signatur access pattern case case ii case optim fraction memori cach signatur order larger case reason larger signatur size case ii actual number signatur fit smaller bee perform accept fix size size good perform achiev size constant good perform wide rang memori size access pattern gain signatur fig show gain access pattern gain signatur calcul gain sig sig case signatur benefici access pattern narrow hot spot area case signatur memori size larg hot spot object page benefici memori page hot spot object main memori note memori size page fit page signatur benefici number object page store larger signatur store main memori larg object page main memori valu signatur memori size db gain memori size db fig gain signatur valu case case ii memori size db gain memori size db fig gain signatur valu pa case case ii signatur result neg gain lower page buffer hit rate case signatur benefici access object page fit main explain gain narrow hot spot area medium amount memori effect pa fraction read access benefit signatur fig illustr gain valu small result small neg gain gain larg valu assum case achiev high gain interest note gain case case ii pa fraction perfect match access actual drop signatur reduc number object memori size db store signatur gain memori size db store signatur fig gain signatur recalcul signatur store signatur case case ii benefit signatur number suffici low fig illustr gain valu pa interest note signatur benefici larg pa effect recalcul analysi assum signatur store disk section recalcul signatur object page retriev current interest futur fig illustr differ gain recalcul signatur store signatur differ larg make recalcul strategi futur cpu cost rel cost smaller todai object signatur cach main memori signatur signatur reduc averag object access cost system develop cost model analyz perform analysi show substanti gain achiev analyz paper simpl perfect match access low limit room improv real benefit queri signatur reduc amount data process subsequ stage result larger amount data process main memori speed queri process order magnitud work includ studi inform recent signatur object collect emploi part queri plan recent signatur impli higher hit rate knowledg enhanc cost model queri plan work includ studi cach signatur join involv perfect match access join frequent costli gain signatur signatur cach perform refer queri xml document xylem technic report bertino evalu text access method annual hawaii intern confer system softwar dia simpl analysi lru buffer polici relationship buffer transient ninth intern confer data widom manag histor semistructur data faloutso access method text acm comput faloutso chan fast text access method optic larg magnet design perform comparison vldb evalu signatur file set access facil oodb acm sigmod intern confer manag kemper kossmann strategi object base vldb patel effici signatur file method text retriev ieee transact knowledg data effici signatur system advanc inform internet system zhang design perform evalu altern xml storag strategi
Agents/1226 1 dataspac mobil agent coordin giacomo letizia franco zambonelli dipartimento di scienz università di modena reggio emilia modena itali abstract paper present programm coordin architectur internet applic base mobil agent agent coordin current execut environ programm xml access agent fashion suit characterist internet offer advantag xml term standard enforc open uncoupl requir dynam environ mobil applic compon coordin made flexibl secur capabl program behaviour coordin media reaction agent access applic relat manag academ show suitabl effect architectur internet mobil tupl introduct growth internet infrastructur www technolog chang internet conceiv exploit internet raw commun media global inform current challeng exploit internet global distribut comput kind comput distribut data coordin distribut entiti perform deploi distribut applic internet due characterist internet manag open make internet popul multitud heterogen entiti inform applic compon problem dynam scenario internet connect requir suitabl program paradigm coordin facilit design execut internet applic regard success html recent led www consortium develop xml languag data standard due advantag provid context xml repres data familiar tag textual explicitli separ treatment data unlik html express document process xml document specifi data structur leav process applic level browser instruct xml document xsl style sheet achiev requir internet appreci featur xml freeli xml made capabl repres kind data entiti find complex document servic interfac object commun protocol agent characterist internet base base corba commun corba fall short complex data document involv regard program paradigm coordin technolog internet suitabl solut repres mobil agent tupl program paradigm base mobil activ autonom softwar entiti dynam plan execut includ capabl transfer execut execut environ internet suit internet applic mobil agent applic design deal uncertainti target dynam internet site connect mobil dynam coordin model forc strict coupl interact entiti forc odd design choic applic lead ineffici execut argu fulli uncoupl coordin model base tupl space concept adopt coordin make agent interact current execut suit internet applic base mobil agent lead simpler applic design put design implement coordin architectur mobil exploit advantag xml languag coordin context gener internet architectur base xml deriv mar coordin architectur agent coordin current execut environ programm xml dataspac execut environ access agent tupl space provid advantag mobil agent applic exploit xml base languag data multitud heterogen inform sourc agent interact exploit enabl uncoupl interact suit open dynam internet scenario behaviour xml dataspac access made agent fulli program enabl coordin law provid secur flexibl coordin activ applic area manag academ assum case studi show effect approach paper section discuss architectur issu adopt xml base gener internet architectur base xml section present architectur section present applic section discuss relat work section conclud paper outlin futur research work xml architectur xml technolog achiev internet world architectur conceiv heterogen compon xml dataspac start simpl intuit sampl sketch gener base accommod kind internet servic kind applic level includ mobil agent xml web natur intuit exploit xml web data format flexibl power html data record format read manipul kind applic tag explicitli commit applic specif specif inform applic level decid elabor inform context web xml enabl modular approach server design lowest server administr store inform adopt natur format disregard issu relat data higher inform translat html page standard html basi specif inform xsl softwar layer translat data xml xsl provid browser normal interfac http server inform level store xml inform relat server read interpret server defin channel definit format exploit microsoft activ channel xml inform server origin inform sourc made xml format xml server consid http server capabl translat xml html basi dbm store inform proprietari effici make inform web provid softwar layer dynam queri produc result web access format web cgi applic provid access dbm translat result html modular approach translat inform produc xml translat xml server retriev browser applic level interfac level middlewar level inform level html browser xml server server xml inform legaci figur xml architectur web gener xml architectur previou show exploit xml web natur lead architectur figur applic browser elabor inform html format browser xml server http server capabl transform xml document html xsl provid interfac level interfac browser xml dataspac xml dataspac act middlewar level data store dbm lowest inform level inform site store xml format case middlewar inform level singl data translat inform level middlewar level applic level interfac level middlewar level inform level xml browser xml interfac xml inform mobil agent interfac tupl space distribut object corba interfac web server xml html browser xml server file figur gener architectur base xml gener interfac gener inform identifi architectur consid gener architectur internet applic figur inform account presenc kind data store kind bare tupl tupl servic interfac provid data repres middlewar level furnish tool transform data xml format store dynam xml dataspac expect emerg xml standard make kind tool wide interfac level charg publish inform format request applic compon specif model compon present depend varieti applic compon access xml dataspac applic level compon includ xml corba interfac enabl distribut object applic interact xml interfac enabl mobil agent coordin expect xml capabl applic compon directli read elabor xml make unnecessari translat data xml specif applic level format interfac level maintain role implement specif polici access data implement polici preserv consist xml simpl polici complex interfac level implement access control polici protect data malici access architectur gener present advantag grant high applic access inform interact model permit access xml format kind translat inform give possibl maintain origin format architectur exhibit high kind inform format interfac ad design xml translat restrict focu mobil agent provis interfac mobil agent applic level interfac level middlewar level inform level xml inform tupl space node local domain node local execut agent interfac reaction tupl web server file figur architectur coordin architectur xml dataspac gener inform mobil agent adopt coordin model suitabl solut environ coordin context gener xml architectur previou accommod coordin style mobil agent amount integr specif architectur solut tune mobil agent provid interfac enabl agent access xml enabl associ specif comput activ access perform defin programm tupl space model describ coordin architectur mobil agent figur show issu found architectur enforc local implement standard javaspac interfac simpl effect programm tupl space model base tupl space gener implement java agent system design complement function agent bound specif mobil agent system slight extens feel difficult adapt current implement order addit mobil exploit coordin activ architectur mobil agent travel network effort enforc local access architectur facilit agent effort coordin architectur mobil agent base xml dataspac provid multipl independ tupl access agent local mean xml dataspac consid local resourc local domain node enforc concept local internet node defin xml dataspac interfac agent arriv automat provid refer local tupl space interfac node refer access xml dataspac insert fragment xml data tupl local domain node local feder implement singl xml dataspac agent execut node domain automat provid interfac access xml dataspac transpar domain interfac adopt javaspac compliant interfac figur tupl space assum form java object make oper access tupl retriev tupl match extract match tupl tupl put tupl tupl space addit present javaspac ad interfac avoid agent forc perform retriev risk retriev tupl time wellknown problem tupl space due select tupl multipl match public interfac extend javaspac interfac method inherit javaspac transact long put tupl space entri transact long read match tupl space entri transact long extract match tupl space method ad mar present javaspac interfac vector transact long read match tupl vector transact long extract match tupl figur interfac paramet transact oper belong timeout paramet specifi time wait oper return null match tupl mean return mean wait indefinit paramet write oper set lifetim written tupl choic implement javaspac interfac defin driven fact javaspac technolog great impact context distribut java applic javaspac choic suit java make manag object tupl xml fragment point tupl java object instanc variabl repres tupl field interfac oper charg translat object tupl xml viceversa handl tupl document xml dataspac tupl manag requir tupl class implement entri interfac easiest deriv tupl class class defin basic tupl properti implement entri instanc specif tupl field field tupl refer object repres primit data type object java tupl class static privat field specifi dtd describ structur xml document instanc class dtd correspond tupl xml document correspond tupl object tupl class shown figur figur show agent class access xml dataspac class extend gener tupl field static privat final url tupl field public integ public string public string public integ figur tupl class result figur fragment code agent tupl correspond element xml document begin underscor charact delet initi tag defin xml instanc variabl tag valu instanc variabl data tag class instanc variabl dynam acquir java reflect tupl class defin figur correspond element xml document figur translat tupl xml element automat perform invoc interfac oper includ translat textual form integ float pattern match implement textual comparison xml element templat tupl input oper formal valu match xml actual valu case string partial defin valu express exploit wild card current input oper invok perform search xml find element xml document dtd document static privat field templat tupl translat xml format correspond element document valu defin partial field tupl correspond valu tag element figur show grai fragment xml document form read oper request figur agent field maintain formal match occur valu field templat tupl field match regular express field tupl xml fragment extract document agent perform oper templat tupl system figur tupl xml element current implement suffer address time write interfac lack capac manag compon structur found xml document current implement consid attribut tag addit lack perfect correspond xml element entri implement handl xml avoid conflict tag correctli implement mechan concurr access base polici appli level singl xml document choic promot simplic entiti access xml dataspac concurr mobil provid conform polici polici level singl document choic multipl agent perform complex transact multipl agent perform concurr oper part xml document evalu polici conceiv coexist dataspac direct improv relat secur control mechan control access xml dataspac base access control list xml agent extract element document kind access control granular mobil agent work level singl tupl reactiv model behaviour administr mobil instal reaction specif access trigger event occur reaction modifi result oper manipul content xml access kind extern entiti access introduct programm tupl space model base xml dataspac greater flexibl control interact raw linda model site administr program reaction monitor access event local resourc issu specif action preserv resourc malici access reaction implement dynam dataspac data static store dataspac dynam produc possibl origin sourc context xml refer gener xml architectur sketch section reaction act bridg inform level xml middlewar level figur dynam product tupl enabl simpl access servic attempt read specif tupl agent trigger execut local charg produc requir tupl result reaction establish control commun agent context xml access entiti mobil possibl exploit reaction control interact entiti heterogen term support coordin model advantag provid give applic agent capabl defin coordin agent carri code reaction implement coordin instal tupl space site visit achiev sharp separ concern algorithm coordin issu agent charg embodi algorithm solv reaction repres coordin rule reduc agent complex simplifi global applic shown implement programm tupl space exploit implement mar reactiv model reaction state object method code repres core specif access event basi compon access tupl item oper type agent ident associ reaction access event repres reaction method object reaction execut agent ident invok oper tupl match associ reaction tupl consid dealt tupl tupl follow associ mechan similar tupl space put extract tupl tupl space provid instal reaction associ reaction access match match trigger reaction associ reaction read disregard peculiar tupl content agent ident associ reaction specif tupl class mechan tupl space activ access tupl space check presenc reaction execut reaction method defin public entri entri oper ident paramet refer local refer tupl result match mechan issu oper ident invok agent code reaction access tupl space perform kind oper space access oper perform code reaction issu avoid endless behaviour reaction depend actual content tupl space past access event avail result match mechan reaction influenc semant oper return specif invok agent tupl result stateless match mechan current secur mechan defin tupl space base access control agent instal kind reaction xml dataspac manag agent instal kind gener applic agent instal reaction trigger agent applic feel secur model satisfi administr applic refin work direct current implement reactiv fulli mar implement tupl space xml dataspac store tupl object form requir mechan occur applic level tupl object intent upgrad implement tupl space make xml dataspac turn applic appli context manag introduc simpl exampl relat inform retriev goal clarifi present concept show sampl xml document java code sketch complex relat coordin illustr power programm coordin model inform retriev manag academ depart feder make materi student easili retriev materi interest teacher easili upgrad adopt xml standard data format adopt dtd xml document figur show sampl xml document inform relat includ gener inform specif inform lesson abstract suggest read refer gener architectur section xml materi defin xml dataspac deriv translat materi store inform level written scratch xml materi materi made applic client adopt interfac relat inform student acquir inform relat specif lesson academ feder make xml server simpli adopt browser navig trough xml dataspac feder content search activ time bore feder larg materi detail site feder host mobil agent make interfac student decid deleg search activ mobil agent agent defin avail tupl class repres xml element interest figur report definit tupl class repres xml element agent exploit oper interfac retriev inform simpl effect figur report simpl code fragment agent travel site feder retriev inform lesson keyword abstract system figur xml document describ class extend static privat url public string public integ year public integ semest public string teacher public lesson class extend static privat url public string lesson public integ number lesson public string abstract lesson public suggest read class extend static privat url public string author read public string titl read public string public integ volum public integ number figur tupl read element partial defin field site feder current site list lesson abstract found back home figur code fragment agent search specif lesson defin field site feder current site list back home figur code fragment agent charg updat semest inform simpl relat inform manag professor jane smith updat inform teacher exchang semest held deploi agent travel site feder site store inform extract inform write updat semest indic figur show simpl code fragment agent perform task perform agent launch jane smith extract write tupl xml document inform extract modifi inform held teacher access control list appli level singl secur reason requir store xml forc site adopt specif file xml dataspac clarifi current access control list approach inadequ programm provid advantag regard site decid associ reaction read oper perform goal monitor activ dataspac maintain log file code simpl reaction shown figur read event write tupl metalevel tupl space instanc monitor reaction class monitor implement reactiv public entri entri oper ident log access return fe return match tupl invok agent figur monitor reaction class regard reaction write oper order preserv consist inform inform delet dataspac updat inform insert reaction oper return tupl delet record attempt updat record tupl store space reaction write tupl check record tupl delet version dataspac figur show code class implement instal write tupl tupl space agent ident fourth field discrimin class agent trigger reaction specif perform oper tupl insert updat tupl collect behaviour reaction easili implement make transact mechan transact requir identif problem agent disregard consist xml dataspac ensur proper program behaviour class implement reactiv public entri entri oper ident ut creat updat record inform delet tupl store updat record return return match tupl invok agent delet class implement reactiv public entri entri oper ident ut updat record delet tupl return figur reaction class coordin complex xml simpl repositori gener workplac manag activ specif xml dataspac exploit professor jane smith manag period assign student publish text assign student exploit dataspac retriev assign make evalu student access dataspac browser select assign post complet assign dataspac exploit browser access read evalu complet assign student provid person user charg access retriev assign store complet assign dataspac teacher associ agent charg notifi presenc complet assign possibl capabl preliminari control correct complet assign control includ check part assign complet verifi assign develop student teacher agent verifi assign complet due deadlin case warn student teacher delai agent control assign submit correct sequenc assign submit agent send warn messag student notifi teacher incorrect submiss sketch basic interact student agent teacher occur linda coordin model insert xml repres assign insert complet assign perform student agent write trigger teacher wait block read kind insert event scenario requir basic interact obei rule workflow rule relat order assign control charg teacher agent professor jane smith decid chang rule relat student perform assign start publish specif assign deadlin complet open possibl student complet assign sequenc requir teacher modifi code agent workflow assign submit teacher agent longer check previou assign submit fact agent code modifi deriv inappropri design system make teacher agent charg control correct submiss correct submiss relat histori submiss agent charg handl interact event relat insert verifi interact obei specif coordin law presenc programm dataspac clean solut sketch teacher agent charg control correct assign content worri student submit assign sequenc identifi coordin charg interact media dataspac xml dataspac program order react insert check interact event respect coordin law achiev clear separ concern simplifi agent design develop relat work mobil agent system focu definit coordin model adopt xml languag agent interact coordin architectur interact web applic exploit coordin multitud tupl space execut environ agent coordin agent creat privat tupl space interact privat affect execut environ unlik defin programm coordin model specif problem data regard foreign entiti enabl applic associ agent lime coordin model address unifi model logic physic mobil mobil entiti agent physic devic interfac tupl space person tupl space store retriev tupl mobil entiti meet physic automat coordin mobil entiti temporarili share tupl space lime programm tupl form limit mobil entiti program behaviour order provid control access final abstract model concret lime neglect data tucson model develop context affili research defin programm coordin model base logic tupl space execut environ coordin mobil agent logic tupl space defin reaction program logic tupl exploit logic program reaction complement reaction model make tucson suit distribut manag larg inform system untyp data logic model facilit facilit translat logic tupl xml problem solv tucson explicitli program reaction space project ibm defin interact space inform repositori network mobil applic space aim provid power standard interfac access larg amount inform space limit basic linda model integr peculiar form enabl behaviour ad tupl term admiss oper tupl space make space usabl open internet requir applic agent awar oper tupl space dynam acquir knowledg regard project relat space report effort knowledg integr xml linda technolog goal project enabl space accept xml document store tupl tupl space incom xml document process produc dom tree node store space tupl repres fragment xml file extract reconstruct origin xml document approach dual javaspac tupl translat store fragment xml file fragment xml file extract translat javaspac tupl approach prefer preserv effici store xml file origin format requir entiti produc tupl applic agent emerg import xml context agent applic stress presenc strictli relat tupl space coordin technolog xml repres agent interact exchang xml messag specif commun session agent easili establish order exchang messag easili control xml framework framework extens librari gener xml document facilit exchang inform electron build open flexibl system approach exploit xml program languag agent data statu agent repres xml code written script languag specif xml tag agent code written express control instruct term xml tag futur work present exploit power flexibl programm coordin model context xml provid advantag internet applic base mobil agent programm coordin suit mobil applic compon open internet emerg xml standard internet data heterogen compon updat portion current implement discuss section issu solv make architectur practic usabl issu relat lack xml specif effect manag xml document xml schema specif permit data type xml document current integr xml namespac current great translat xml field java object improv effect pattern match mechan xml fragment specif defin fragment xml document extract insert harmless preserv valid xml document meet handl singl element insid possibl long document context enabl system tupl repres fragment larg document consist strictli xlink xpointer rule connect xml possibl lead richer complex tupl type refer repositori space event notif ieee vol pp august tupl space mobil agent intern workshop mobil pp sept model internet applic base mobil ieee comput channel definit applic refer ieee transact softwar vol pp complex document case studi ieee transact knowledg data vol express power languag programm coordin acm symposium appli atlanta feb code ieee transact softwar vol pp languag commun vol pp februari commun march space home sun javaspac issu program ieee vol pp state distribut system world wide web fall internet agent script languag workshop ai electron juli framework repres agent interact protocol base ibm tokyo research septemb corba internet applic journal autonom agent vol pp sept papadopoulo model advanc vol pp academ aug ami linda meet intern confer softwar lo angel ieee internet vol pp world wide web extens markup languag world wide web extens stylesheet languag mobil commun march xml agent
DB/1227 3 knowledg manag ontolog richard benjamin amsterdam netherland dieter fensel aifb karlsruh germani gomez perez dia technic madrid spain abstract knowledg essenti asset success surviv increasingli competit global market awar main reason exponenti growth knowledg manag past decad approach knowledg manag base make knowledg asset intellig access peopl organ knowledg resid head success knowledg manag technic social describ approach intellig knowledg manag explicitli account social issu involv proof concept initi involv knowledg manag virtual organ introduct inform week busi problem knowledg manag design solv knowledg acquir experi doesnt isnt share formal kind knowledg term knowledg manag refer thing copyright paper belong paper author permiss copi fee part materi grant provid copi made distribut direct commerci advantag proc int conf practic aspect knowledg manag oct corpor memori expert document manag learn organ knowledg manag product solut organ bui assembl compon process implement period human relationship busi practic inform technolog process manag knowledg involv ffl knowledg acquisit collect knowledg manag ffl knowledg organ structur knowledg acquir order manag effect ffl knowledg delet maintain knowledg ffl knowledg bring knowledg distinguish type knowledg manag vertic horizont system vertic system develop kind busi situat system highli effect proven vertic system develop insid compani highli situat specif system busi situat horizont knowledg manag system gener system appli varieti busi situat framework instanti situat discuss present horizont approach knowledg manag ground research knowledg engin knowledg engin field past year concern gomez perez manipul maintain knowledg order obtain intellig solut hard problem knowledg engin methodolog techniqu high knowledg concern issu mention busi environ order approach work assum intranet access internet member organ browser approach requir knowledg interest html page net compani easi infrastructur compani access larg varieti internet techniqu user familiar approach short learn curv paper organ section outlin technolog underli approach section present applic approach virtual knowledg acquisit research commun case studi relat busi context section identifi number danger success implement knowledg manag system section conclud paper put context relat knowledg manag approach knowledg manag approach main ontolog engin build ontolog subject knowledg term provid intellig access knowledg reminisc relat ontolog correspond data correspond instanc access place sql approach significantli central respect distribut intellig approach captur central knowledg knowledg directli access origin locat html separ input approach knowledg explicitli deduc base gener knowledg context human resourc compani senior manag lead mr paton project deduc mr paton intellig webcrawl annot web page queri answer joint effort distribut central support ontolog build annot web page ontolog subject matter expert user iter user figur approach senior state explicitli figur gener overview approach ontolog subject matter subject matter fill ontolog intellig web crawler receiv queri term consult subject matter interpret ontolog gener answer instanc actual knowledg distribut html page intranet ontolog engin ontolog share common understand domain commun peopl comput ontolog share applic main reason ontolog popular nowadai ontolog defin explicit specif share conceptu refer abstract model phenomenon world identifi relev concept phenomenon mean type concept constraint explicitli defin refer fact ontolog machin readabl reflect notion ontolog captur consensu privat accept group ontolog describ subject matter notion axiom concept ontolog organ taxonomi inherit mechan appli order consensu ontolog import peopl ontolog posit attitud dictat ontolog peopl succe ontolog construct vr gomez perez compon number type argument compon type argument compon figur part physic devic ontolog collabor effort domain repres end user specialist joint effort requir methodolog guid ontolog develop process tool inspect modifi ontolog exampl methodolog includ uschold methodolog fox tool ontolog server interact environ maintain browser ontolog ontolingua ontolog translat includ corba idl loom ontolog built ontolingua frame ontolog written kif interchang frame ontolog languag includ primit relat axiom relat ontolog connect context automobil industri ontolog term relat mechan devic mechan devic exampl class binari relat cylind engin devic ontolog includ class ternari relat express mechan devic connect kind pipe note term part ontolog domain concept relat belong applic kind physic devic figur figur illustr part physic devic ontolog part mechan devic ontolog human resourc manag class appli concret ontolog fulfil role knowledg cylind compon engin compon engin engin compon figur part mechan devic ontolog mr paton figur simpl extens html attribut express ontolog inform html page knowledg mention knowledg manag distribut organ html page compani intranet relev knowledg maintain distribut person person respect html subject matter knowledg html page annot ontolog scheme express human resourc manag homepag mr paton state project leader add make explicit approach extend html attribut attribut figur simpl illustr html code figur state url page inform repres term defin page ha refer url web page bodi refer scope close attribut affect visual html document standard web browser netscap explor thing make visibl subject matter knowledg intellig web crawler vr gomez perez small extens html chosen annot simpl enabl direct usag textual knowledg bodi anchor prevent knowledg repres piec inform text paton text visual simpl solut suffic approach html page factual knowledg intellig knowledg retriev discuss ontolog annot html turn knowledg intellig retriev broker servic ontobrok consist main web crawler infer engin queri interfac search annot page collect annot knowledg fragment translat annot knowledg fragment fact formul languag ontobrok infer engin queri user awar syntact fact repres internet annot languag infer engin receiv queri user exploit inform sourc deriv ontolog subject matter fact found basic infer mechan infer engin deriv minim model set horn resembl intellig reason differ instanc knowledg base distribut html page queri interfac ontobrok consist hyperbol visual ontolog tabl format user easili queri figur prevent user class attribut ontolog proof order investig feasibl perform initi subject matter scientif knowledg acquisit knowledg annot initi knowledg acquisit commun url ontobrok homepag describ virtual organ consist inform resid worldwid web homepag ka research publish inform research concret knowledg manag point initi academ toi imagin larg thousand world wide larg effect human resourc manag vital import find larg organ process knowledg manag system find adequ peopl base experi area high larg compani approach real possibl enhanc task improv recal present result search intranet www fact natur relat impli limit knowledg manag task subject matter approach concern kind knowledg manag effect ontolog engin build ontolog ka commun knowledg ontolog captur consensu research cooper locat construct ontolog ensur ontolog accept major ka research current ontolog ka commun consist relat organ project person public event ontolog current version ontolog view european mirror site madrid ontolog server stanford login password load ka commun illustr includ exampl ka person ontolog public ontolog defin type person work academ characterist ontolog defin class relat overview show class relat connect url vr gomez perez ogi indent denot relat class hierarchi class person lectur research secretari student relat defin class relat usual bibliograph entiti attribut class hierarchi class public articl book journal relat annot page annot html page mean particip research ka commun annot relev knowledg homepag environ figur illustr fragment annot homepag research attribut page ha refer url web page bodi refer scope close address class ka ontolog figur illustr annot public annot process tediou task experi roughli hour annot page ontobrok annot checker person support spite amount work import factor make peopl annot annot research make visibl enhanc likelihood refer academ world good thing section back issu queri ka commun order collect knowledg html research regist page url visit intellig knowledg retriev user freed specif queri languag user interfac hyperbol visual ontolog link tabl interfac figur figur hyperbol ontolog move effect concept drag center enlarg concept reduc size user click pass tabl figur specif attribut select concept chosen user queri minimum amount type tabl construct composit queri conjunct instanc research ka commun answer includ research homepag addit research cooper research ontolog defin cooper enabl cooper research ontobrok type consist check good idea open web abduct deriv fact illustr access knowledg explicitli import advantag approach compar vr gomez perez richard benjamin artifici intellig research institut spain dept social scienc informat netherland artifici intellig research institut spanish scientif research spain figur web page annot attribut page ha refer url page bodi refer scope close address class ka ontolog vr gomez perez benjamin kb develop reusabl diagnosi intern journal vol page figur annot public valu attribut belong ontolog knowledg acquisit commun actual knowledg repres public part annot code search research work abstract paper topic exampl queri knowledg acquisit commun obtain ontobrok homepag fact current version ontolog axiom annot fact research feasibl knowledg manag system order feasibl horizont knowledg manag system risk involv risk discuss technolog social organiz risk technolog risk technolog point factor endang success knowledg manag approach ffl initi fail dedic tool support task involv tool construct maintain annot inform sourc queri figur od design ontolog conceptu level complet implement level od gener ontolingua code ontolog complement support enabl collabor construct ontolog www annot tool visual ontolog html page annot select fragment html page click term ontolog effect includ html page ffl tool updat instanc research annot person ontolog level ontolog dramat consequ updat annot html page annot ontolog term obsolet crystal answer problem form risk consid possibl socal xml includ document xml page url xml vr gomez perez figur hyperbol queri interfac click node make class tabl interfac figur figur tabl queri interfac vr gomez perez tool maintain ontolog annot wrapper gener tool tool retriev inform answer queri ontolog html page manipul enrich figur tool support knowledg manag definit term ffl knowledg spread ten thousand html updat problem intellig reason part problem familiar problem kb algorithm develop test toi domain real world applic ffl simpl extens html relat technolog make html intern web consortium develop promot standard web introduc extens markup languag standard express structur web resourc descript framework describ semant web document final version rdf recommend implement wrapper automat gener rdf definit annot social organiz risk ffl particip initi fail natur initi particip reward activ research particip research easili find work url rdf ffl mental competit collabor colleagu make knowledg profit risk outperform mental real threat success knowledg manag initi increasingli compani awar collabor mental lead result competit organ stimul collabor chang incent system make reward share ffl high workload todai easili felt contribut knowledg manag effort wast prioriti kill knowledg manag initi organ reward knowledg manag contribut equal result lead direct profit effort made exist document knowledg worker impress duplic knowledg exist tool gener html page varieti format discuss summari present knowledg engin approach knowledg base year experi deal knowledg relat work knowledg manag action mention ffl knowledg gather perform exist html page ffl knowledg organ structur ontolog ffl knowledg refin perform distribut worker ffl knowledg distribut web crawler intellig access knowledg pull approach user initi knowledg work present push approach social effort note knowledg manag essenti involv knowledg manag effort doom fail human factor knowledg manag work vr gomez perez peopl cooper share knowledg stimul share knowledg chang incent system knowledg chain import framework knowledg manag refer adapt organ chang market knowledg chain consist stage walk circular ffl intern awar refer organ abil understand term skill compet term product ffl intern concern translat intern awar team skill tool bring product market ffl extern make differ organ success failur organ abil quick adequ base corpor long process act ffl extern awar repres organ abil understand market perceiv product servic chang direct requir market coupl intern extern awar lead market approach contribut directli intern awar ontolog engin part result knowledg map organ contribut intern awar organ annot process instanc knowledg map organ intern annot homepag compet area easi find quickli accur person form adequ team versu retriev argu knowledg html ontolog annot inform annot effort gener search engin search html search easili lead overwhelm amount answer web inform overload make hard find rid respect search engin increasingli expect limit inform retriev current search approach present inform collect distribut locat coher knowledg retriev inform relat retriev ontolog approach access implicit capac approach reduc annot machin learn techniqu exploit ontolog automat classifi textual inform wrapper built extract semant web document base regular format content machin learn techniqu build wrapper import research line embark relat work huge research effort metadata web document dublin project ontolog improv inform retriev ontolog markup conceptu knowledg markup project relat approach mention resourc descript framework provid altern syntax write ontolog annot web document defin rdf provid extra page insid web page element web page text fragment link directli annot repeat order enrich metainform design problem maintain web document due redund inform overview relat project link homepag acknowledg stefan decker technic contribut ontobrok richard benjamin support netherland comput scienc research gomez perez tion support netherland organ scientif research refer ashish knoblock semiautomat wrapper gener internet inform sourc ifci confer cooper inform system south knowledg great concept inform benjamin fensel ontolog engin initi formal ontolog inform page io garc build ontolog knowledg level ontolog design environ eleventh workshop knowledg model construct engin ontolog phd slatteri learn extract symbol knowledg world wide web nation confer ai habit highli effect peopl simon domingu edit ontolog web eleventh workshop knowledg model studer high idea intern flair confer rice ontolingua tool collabor ontolog construct intern journal gomez ontolog art ontolog engin spring symposium seri ontolog aaai press editor manual palo genesereth fike knowledg interchang version refer manual technic comput scienc stanford fox methodolog design evalu ontolog workshop basic ontolog issu knowledg share held conjunct knowledg share handbook appli expert system gruber translat approach portabl ontolog specif knowledg guarino formal conceptu analysi knowledg intern journal special issu role formal ontolog inform technolog thoma hook knowledg chain white paper doorenbo wrapper induct inform extract intern joint confer ai page macgregor insid loom classifi sigart june editor essenti distribut object surviv guid john wilei oleari ai renaiss ieee oleari knowledg tame inform ieee intellig special issu contribut de van de wielinga engin manag commonkad methodolog vr gomez perez fensel knowledg principl method data knowledg uschold applic knowledg engin van van de organ memori gain banff knowledg acquisit system page calgari van wielinga explicit ontolog kb develop intern journal knowledg central manag focu organ schema press vr gomez perez
HCI/1228 4 adapt context kohonen adapt sensor data fusion abstract mobil devic smaller interfac user base regular desktop comput impli interact interrupt user desir ubiquit comput ad arrai hardwar sensor system machin learn make devic awar context goal make learn user minim maxim reliabl introduct sensor context applic enhanc user interfac ad sensor simpl rule typic connect light sensor devic adjust contrast bright screen light sensor applic chang behavior user explicitli profil describ behavior profil mobil set make phone ring loud vibrat meet approach lead lot user program profil set context combin approach mention earlier lead autom profil context teach context applic kristof van starlab research brussel recognit base simpl sensor set behavior devic context lead improv applic enhanc interact user approach equip recogn context notion context broad incorpor lot current current state person describ multipl peopl describ context locat thing familiar build room visitor describ applic defin descript context applic requir context give inform user context depend heavili user context awar adapt make devic usabl user give minim feedback learn modul context descript sensor experi cheap hardwar board includ light temperatur acceleromet sensor simplest method give context descript sum valu sensor format instanc architectur final version paper found person situat interact awar dei enhanc descript slowli architectur work opposit system merg output sensor map descript user descript figur sensor board onlin adapt context awar raw sensor valu input small routin enhanc futur cluster bright result easier distinguish type artifici light standard deviat acceleromet valu give qualit inform sensor microphon infrar sensor similar raw sensor data call cue featur advantag cue frequent layer light read hundr time cue sensor level cue accur context recognit system cue result larg input make slow learn difficulti irrelev input present refer rat learn locat cortex respond locat selforgan neuron function exist abstract level geograph brain kohonen map similar neuron activ topolog task depend sensori input som handl noisi data make choic cluster input monitor activ neuron plot result matrix hill ideal repres context provid user insight learn capabl system figur figur som tradit algorithm start highli adapt larg learn rate huge neighborhood gradual fix capabl learn pose obstacl system remain adapt problem dilemma add mechan control flexibl som user interact label cluster produc som mean cluster situat cluster classif label distanc weight neighbor algorithm search closest label map topolog preserv properti som make probabl nearest label context user behavior layer primarili intend transit context probabilist finit state machin architectur context repres transit repres edg state model probabl measur time transit model check transit state enter buffer mechan initi row transit state depend previou make model firstord markov model state track time spend control flexibl newer flexibl adapt map board movement light sound misc ir som stand talk frequenc walk activ run tea sensor board sit volum nn lab kitchen user interact locat stair lab figur architectur user interact cluster result time model gener graph depict behavior user relat context visit user reflect connect strength figur depict typic layout final architectur result futur work context awar effect system feedback user user give constraint hard challeng point view combin neural network context model creat bulki overhead interact simpl activ walk run recogn ten acceleromet leg hip light sensor proven cue mean recognit deterior light condit chang combin light gp beacon interest regard boost perform improv sensor cue qualiti quantiti experi expect number significantli import issu research placement sensor devic group sensor redund sensor make system robust kohonen map offer intuit user context store obviou machin neural network acknowledg framework paper tea project sponsor european commiss peopl starlab research nokia mobil phone teco omega gener refer architectur fusion mobil intern confer inform usa esprit project technolog enabl awar springer machin hill van van de advanc interact gellersen handheld ubiquit lectur note comput scienc
DB/1229 3 path constraint semistructur structur data peter buneman pennsylvania fan pennsylvania scott weinstein pennsylvania abstract present class path constraint interest connect structur semistructur investig implic problem path constraint capabl express natur integr constraint fundament part semant import queri optim show semistructur simpl syntax implic problem complet finit implic problem complet establish decid implic problem fragment path constraint demonstr fragment suffic express import semant inform relationship local constraint commonli found show presenc analysi path constraint implic delic demonstr simpl decid result practic data model introduct path constraint studi context semistructur data class class assum declar student defin entri point declar provid full inform intend structur work partli support armi research offic nsf grant support irc graduat fellowship support nsf grant student student enrol enrol enrol figur school expect inform state constraint student ak student occur extent student enrol student similarli occur call constraint extent constraint note natur analog extent constraint depend develop relat expect relationship hold enrol differ wai enabl state enforc extent constraint relationship objectstor presenc constraint import queri optim develop formal notat describ constraint borrow idea exploit semistructur data model semistructur data graph consist express root node edg eman label student connect node repres student edg eman describ structur student student singl edg connect string multipl edg connect node figur graph data examin kind constraint extent constraint edg label binari constraint form state constraint exampl studi implic problem word constraint shown decid semistructur constraint common objectori respect student enrol express constraint express word constraint gener path constraint local constraint integr desir make compon build bring number write class defin defin constraint hold compon hold member school set refer compon member set school local constraint local constraint extend graph ad school edg root node root local local extent constraint state word constraint give rise question natur gener constraint captur slightli complic form class path constraint form form repres path node node class path constraint express constraint encount path constraint optim describ context structur data semistructur data implic problem mild gener word constraint undecid semistructur restrict case case suffici express constraint issu interact constraint type system type system schema definit view constraint data gener longer expect result develop semistructur data hold type data proof decid word constraint implic break presenc type constraint restrict type system decid result word constraint implic rest paper organ section formal present path constraint establish undecid implic problem context semistructur section identifi fragment show implic finit implic problem fragment decid semistructur section studi interact type constraint path establish simpl decid result specif type type system type system base manag system popular biologist section summar result identifi direct work path constraint untyp data investig path constraint languag implic problem context semistructur data structur constrain schema present abstract semistructur defin path constraint term logic show simpl syntax languag implic problem complet finit implic problem complet assum standard notat logic path constraint languag semistructur data repres direct unql oem survei semistructur data model abstract semistructur logic structur signatur oe constant denot root finit set binari relat denot edg label sequenc repres logic formula free variabl path formula ffl denot call empti ffl ffl path free variabl denot tail head node write ff paramet clear context path constraint languag formal definit path constraint express forward form backward form fl path path ff call prefix path fi fl denot set path constraint denot path constraint present section constraint set identifi special subclass call path constraint simpl path constraint ffl form form set simpl path constraint denot proper subclass simpl path call word constraint denot pw introduc investig word constraint repres fi fl path figur structur distinguish observ word constraint simpl path express sentenc logic fragment logic consist relat sentenc distinct variabl shown satisfi problem fo establish satisfi fo sentenc model size exponenti length sentenc decid implic finit implic problem word constraint immedi directli establish refer fo implic problem word constraint ptime contrast word path constraint express fo structur figur easi style game fo distinguish path constraint show express fo implic problem implic problem problem finit set sentenc satisfi model theorem implic problem finit implic problem complet result hold proper subclass set constraint forward form set theorem immedi theorem implic problem finit implic problem complet theorem implic problem finit implic problem complet proof theorem prove reduct halt problem machin idea proof show set ae conserv reduct class show function set ffl iff ffl finit finit iff finit satisfi show conserv reduct prove exist reduct fo function fo ffl ffl finit finit satisfi establish reduct fo subclass subclass conserv reduct class establish exist reduct fo encod machin sentenc machin halt state sentenc halt state halt state finit satisfi exist machin establish detail proof theorem proof theorem similar found restrict path constraint implic untyp data undecid result section suggest search fragment implic problem retain suffici express power full languag identifi fragment share properti properli set word constraint includ logic formul semant relat interest point view extent relationship local constraint possess decid implic problem context semistructur present defin basic notat concaten path denot simpli ff path ffl ff ffl ff ffl form ff ff path length path defin ff ffl ff ff fi introduc fragment demonstr express establish decid implic problem present mild gener show decid result fragment investig section hold analog fragment prefix restrict implic implic problem simpl path view restrict form implic problem implic problem implic problem finit subset implic prefix constraint subset empti path replac prefix restrict weaker defin prefix restrict implic problem definit prefix restrict subset finit subset prefix constraint length prefix restrict implic problem problem prefix restrict subset fg model model implic problem word constraint special case prefix restrict implic problem contrast word constraint prefix restrict implic state logic conveni argument constraint prefix restrict subset case integr constraint implic commonli found exampl prefix restrict implic problem implic constraint local constraint set consist local constraint section constraint set prefix restrict subset prefix restrict implic implic constraint theorem prefix restrict implic finit implic problem decid semistructur proof idea proof establish small model properti satisfi prefix restrict implic prefix restrict subset show function model size stand length establish small model properti path label criterion structur satisfi sentenc model satisfi sentenc label node path path label collect label node path label ffl structur iff ffl structur size establish exist model restrict prefix definit detail proof fi case path constraint implic exampl prefix restrict implic set consist extent constraint constraint section prefix restrict subset constraint fi defin definit path constraint constraint set simpl path constraint restrict path constraint denot fi note class word constraint proper subset fi constraint fi express logic constraint fi fo theorem implic finit implic problem fi decid semistructur proof proof theorem establish small model properti satisfi set fi fi ae fi path label mechan similar emploi proof theorem model satisfi sentenc fi appli mechan label node path obtain label respect show model node uniqu path label size bound cardin label respect small model properti establish detail proof found decid implic finit implic problem fi queri optim illustr section semistructur absenc schema find enrol student syntax lorel languag queri semistructur queri express select extent constraint constraint section shown express select show constraint thing note constraint languag fi impli extent constraint section mention fi decid implic problem fi form basi determin implic note case effici compli familiar optim principl origin relat perform select earli extend implic fi set consist local extent constraint local constraint set prefix restrict subset subset fi constraint set share constraint student augment common prefix school repres global path constraint local augment common prefix motiv extens fi definit ff path constraint fi extens prefix denot constraint defin forward backward path concaten pf lt rt defin definit ff path finit subset fi extens prefix ff subset defin set call prefix extend subset fi extend implic problem fi problem prefix extend subset fg fi model model set prefix extend subset fi note implic problem fi special case extend implic problem fi implic word constraint special case extend implic fi extend implic fi state logic theorem extend implic finit implic problem fi decid semistructur proof prove theorem reduct implic problem fi decid establish theorem path denot set fi set prefix extend subset fi recal set fi defin proof theorem defin surject map fi path fi iff fg extens prefix ff show fi path ffl satisfi iff ffl finit satisfi iff finit satisfi finit model size model size proof theorem argument satisfi fi small model properti oe fi oe model size detail proof conjunct path constraint show decid result hold extens path constraint extens defin definit conjunct path constraint oe express forward form backward form finit set denot path fl denot set conjunct path constraint denot conjunct path constraint describ structur semistructur data illustr conjunct path context structur constraint constraint ffl ta depart student ffl ta intersect student defin fragment analog fragment discuss definit finit subset call prefix restrict subset iff path length prefix restrict implic problem problem finit prefix restrict subset model model oe definit simpl conjunct path constraint oe constraint conjunct path constraint oe constraint fi set simpl conjunct path constraint conjunct path constraint denot fi definit ae path oe constraint fi extens oe prefix denot constraint defin ff ae fi oe forward ff ae fi oe backward form ae path finit subset fi extens prefix ae subset defin oe set call prefix extend subset fi extend implic problem fi problem prefix extend subset fi model model oe decid result verifi analog theorem theorem prefix restrict implic finit implic problem decid semistructur theorem implic finit implic problem fi decid semistructur theorem extend implic finit implic problem fi decid semistructur path constraint type data investig path constraint structur data constrain schema show interact path constraint type constraint result path constraint implic context semistructur longer hold type context investig class word constraint model model strictli type data model model base consid semistructur model fact separ type system flexibl type present abstract model term establish decid word constraint implic model impact type constraint structur path constraint implic restrict schema implic problem path constraint schema problem finit set path instanc satisfi model instanc schema structur instanc satisfi type constraint semistructur free type constraint address question interact type constraint path constraint show result path constraint implic semistructur longer hold presenc type implic problem path constraint languag context semistructur establish theorem implic problem undecid type implic problem schema decid long schema data structur instanc finit navig path languag schema finit sentenc implic problem decid illustr impact type word constraint implic proof decid word constraint implic semistructur present show proof break data model interact type constraint path investig path constraint implic type context focu class word properli fragment path constraint languag studi section model investig word constraint implic data model data model present data model assum fix countabl set fix finit set base finit set class set type type defin ftg notat ftg repres set type record reserv rang type schema tripl finit set type type schema consist singl class map erson record type fp instanc schema tripl oid assign map finit set map oid fv vn denot domain base type repres entri point denot set instanc schema abstract present abstract model structur data view semistructur data constrain line abstract semistructur section repres structur logic structur satisfi type constraint determin schema structur depict root direct structur properti determin schema defin signatur determin schema compon signatur schema defin set binari relat set type determin denot smallest set ffl ffl ftg ffl note present type constraint distinguish binari relat denot set membership relat differ slightli present section signatur determin schema tripl constant finit set binari relat defin finit set unari relat defin fr signatur determin schema ffl instanc schema intend ffl ffl string type constraint determin schema formul sentenc logic count extens fo count quantifi count quantifi semant structur satisfi exist uniqu element present type constraint constraint sentenc oe defin oe ftg oe oe ng type constraint schema sentenc oe present abstract model justif paper abstract schema finit structur signatur denot set abstract schema denot set structur signatur satisfi set type finit denot unari relat word constraint present word constraint presenc type defin path type path schema schema set path type path ff defin induct empti path ffl ff ffl ftg ff path ffl ff untyp path repres formula free variabl denot tail head node word constraint schema express form ff fi denot set word constraint schema pw simpli pw understood sentenc oe word constraint schema instanc oe interpret stand project record attribut subset constraint oe person set person person illustr word constraint schema natur interpret instanc notion defin instanc constraint pw agreement abstract respect word constraint reveal lemma justifi abstract defin proof lemma straightforward found lemma schema pw iff hold word constraint implic implic problem pw schema problem finit subset pw satisfi model decid word constraint implic context semistructur establish show set infer rule sound complet implic set consist transit congruenc set rule longer complet word constraint implic objectori proof longer hold type context constraint oe hard set infer rule provabl oe shown provabl oe set length strictli length type constraint schema hold instanc schema satisfi jsj denot cardin type constraint record jsj jdj show word constraint implic decid proposit arbitrari schema objectori implic finit implic problem word constraint decid proof decid finit implic decid finit satisfi problem logic count type constraint express logic count word constraint fo decid implic suffic show implic finit implic coincid arbitrari schema finit subset pw model model detail proof special word constraint implic decid ptime word constraint implic record schema set type refer implic constraint fg form fi path concaten oper defin section proof proposit follow close argument ptime decid word constraint implic semistructur found proposit arbitrari record schema implic finit implic problem word constraint decid ptime size implic size schema proof set infer rule consist congruenc commut sound complet finit implic record schema proposit arbitrari schema objectori implic finit implic problem word constraint decid ptime size implic size schema model word constraint implic model base model explicit set interpret record type function attribut domain record type finit subset denot domain base model defin model defin differ abstract word constraint model defin constraint record type defin ng proposit arbitrari schema implic finit implic problem word constraint decid ptime size implic size schema present class path investig implic problem constraint import structur semistructur data natur integr constraint fundament part semant import queri optim familiar constraint occur state path constraint context semistructur shown simpl syntax languag implic problem complet finit implic problem complet light undecid identifi fragment suffic express interest semant relat local constraint establish decid implic finit implic problem fragment context structur shown type constraint interact path constraint investig word constraint implic context practic model present abstract model term establish decid word constraint implic model work remain path constraint implic gener type system path constraint implic presenc type rich sourc question set data model constraint languag great number implic problem investig word constraint implic context practic restrict objectori type system question left open includ implic problem fragment identifi section context gener data model complex reason path constraint complex path constraint implic improv investig methodolog autom tool reason path constraint satisfactori perform practic increment path constraint satisfact satisfact check essenti issu connect path constraint equal import increment path constraint satisfact dynam subject updat small updat larg small outcom challeng check path constraint satisfact increment examin part affect entir scratch increment satisfact offer approach maintain path constraint requir research methodolog constraint optim path constraint queri optim briefli address paper studi quest queri optim base path constraint algebra rewrit rule acknowledg author victor val tannen susan davidson discuss refer abiteboul semistructur proc icdt lorel queri languag semistructur journal digit librari abiteboul vianu path queri proc acm symp principl system editor build stori morgan san closur journal symbol gurevich classic problem suciu queri languag optim techniqu unstructur proc acm sigmod intern conf manag pp weinstein undecid implic problem path constraint technic report depart comput inform weinstein decid restrict implic problem path technic report depart comput inform weinstein constraint presenc technic report depart comput inform cattel morgan san vardi problem bulletin symbol objectstor comm acm octob durbin definit data base technic report mrc laboratori molecular wang proc symp mathemat theori polytechn pp
DB/1230 3 discov structur associ semistructur data ke wang school comput scienc nation singapor singapor liu bioinformat centr nation singapor singapor april abstract semistructur object structur studi problem discov substructur collect semistructur object discov structur serv gain gener inform road map queri inform basi cluster partial schema provid standard access interest pattern discoveri task impact structur featur semistructur data tradit data mine framework defin discoveri problem solut introduct motiv sgml file found digit semistructur semistructur data sourc rigid structur data combin heterogen sourc data unlik unstructur raw data imag semistructur data structur figur show segment semistructur movi object maintain imdb circl text insid repres subobject html identifi link identifi special tag repres subobject refer role term structur refer hierarchi refer role structur object sort question answer intens examin object movi movi movi titl titl titl director director director nation nation nation writer award award birthdai figur segment movi object inform repres recent review reveal refer import object label form text unlik structur data relat semistructur data absolut schema class fix object movi actor field miss actor birthdai record structur object irregular queri structur import queri data structur impli structur similar semistructur object common semistructur object describ type inform similar structur movi object itl director actor object actor object nation exampl semistructur object similar structur censu branch inform topic paper discov structur similar collect semistructur object defin problem discuss applic main result discoveri collect semistructur find occur minimum number object user formal defin problem section worth mention refer user structur user find frequent keyword text document structur usual keyword case typic structur set keyword minimum number text document framework gener classic associ rule problem motiv supermarket environ core problem find typic subset item minimum number transact gener li gener flat interest featur cyclic point work differ extract structur singl individu object collect graph repres semistructur discov substructur minimum number graph structur deal requir minimum number occurr substructur prior discoveri structur object extract remov unstructur data imag video contribut structur sourc transform conceptu model higher level abstract hide detail interest user includ link layer interest user sourc provid write parser assum extract issu concern discoveri perform depend applic discoveri perform discov structur save futur discoveri specif request discov structur identifi object structur relev object retriev examin analysi applic list tast applic discov typic structur semistructur object ffl road map inform sourc limit queri semistructur data result due lack extern schema formul websql web match sourc discov inform repres sourc subtask formul discov typic structur object web queri languag specif label queri match label discov typic structur formul queri ffl gener inform content user specif discov gener inform content sourc hard formul queri pain document search mode examin structur examin reader gain gist book request displai structur document displai typic structur document request typic structur discov store queri demand base structur user time switch search formul queri document ffl guidelin build index view speed inform desir construct index view frequent typic occur structur discov typic structur task quot motiv gener data mine tool extract structur inform inform extract file build structur layer layer data structur layer refer lower data layer yield flexibl effici access inform lower layer provid benefit standard access phone label typic person object retriev person build index phone hash invert speed retriev ffl document cluster structur refer document tradit cluster method semistructur refer label document repres structur role root document topic rel nation birthdai person birthdai consid topic document cluster base topic search nation birthdai inform return person birthdai inform ffl discov pattern detect user interest pattern web organ web page attract busi model discov typic structur collect semistructur object semistructur object consist hyperlink web page access singl session label page topic site typic structur captur user interest access pattern paper organ section defin problem discov typic structur section present algorithm section evalu effici algorithm section present case studi real dataset section review relat work section conclud paper problem defin semistructur data defin discoveri problem object exchang model adopt object exchang model repres semistructur data detail account interest reader refer object consist denot denot identifi uniqu identifi object integ list bag fl identifi subobject label describ role subobject requir subobject uniformli list bag order bag list repeat subobject label bag list origin oem consid bag semant extend list semant deal order subobject refer actor subobject movi object list order actor subroutin call procedur list order call oem conveni repres label node repres object identifi edg label repres refer outgo edg node depend list bag circl node repres identifi bag squar node repres identifi list oem cyclic graph cyclic oem graph web document cyclic link cyclic discoveri task user collect object oem graph typic structur discov object call transact object user interest typic structur collect movi node repres movi object transact user interest typic structur actor node repres actor object transact object transact object necessarili root node oem transact object analog transact context mine associ rule user includ data shoe toi food discoveri task transact object similar type inform make discov common structur actor object countri object autom specif transact quantifi sequenc lead label transact object oem graph sequenc label movi director award specifi award object director transact object collect transact object return queri semistructur data case find common structur movi case find common structur movi gener object kei concept discoveri problem gener structur object partial expand subobject object subobject refer partial structur consist refer option partial structur partial ignor refer stop level partial structur li object share partial structur share full structur rest symbol denot label match symbol denot nil structur label partial structur repres tree call nation nation titl titl titl director director director award nation figur movi object acycl oem graph label denot label nil structur te object fl fi subset fl te te object te object subsequ te te object addit requir label label path intend label ignor upper part object structur order discov common lower part requir phrase te fl te te te te natur tree consist te label figur appli construct te fname itl te replac director te result replac itl te result label te fname itl te fname award itl te fname nation figur show tree te te te te mention choic label label match label set label label framework easili modifi discov fix set complex discoveri actor wife favorit actor wife favorit figur extend repres cycl problem drastic defin superset label gener problem cyclic oem defin infinit larg address leaf node special symbol leaf node alia ancestor node leaf node ancestor call ith ancestor figur show cycl repres alia ancestor treat node leaf deal cyclic refer left figur tree figur lose inform cyclic treat tree interest partial structur figur te inform te inform te relationship compar inform weaker nil structur weaker weaker ffl fl te te weaker fl te te te weaker te fj subset ffl te te weaker te te te weaker te subsequ ffl te weaker identifi te weaker te weaker te structur inform te found te start root te discoveri problem definit collect transact object oem graph minimum support support te percentag transact object te weaker te frequent support te te maxim frequent te frequent weaker frequent discoveri problem find frequent tree express maxim discoveri problem find maxim frequent figur transact written bold face refer figur te te te te support te te support te te te te te weaker te te te te te te maxim frequent te te maxim frequent discov frequent deriv associ rule substructur object associ rule form ff ff fi frequent ff weaker fi assum support ff fi ff fi transact object ff fi confid support interest associ rule ff fi satisfi minimum confid minimum support user construct associ rule frequent rest focu discoveri problem maxim discoveri problem end explain choic tree substructur versu graph chang role oem graph equal repres tree replic share subobject goal discov role subobject affect tree substructur inform loss share subobject graph longer refer refer share subobject obtain ident node involv addit drastic number blow search space choic tree substructur complet inform effici implement algorithm present algorithm discoveri problem definit problem find frequent subset collect supermarket basket relat problem directli applic object form label hierarch subobject refer flat repres partial order refer search space includ substructur label match label requir justifi present mine algorithm assum oem graph fit memori node graph access disk memori avoid repeatedli due multipl edg node assum edg node set label edg denot set label edg defin set label intend time path path consid cross product inform store node includ address posit label fl fl fl node inform address label posit label posit import properti algorithm simpl path order path simpl node node store order refer node adjac order necessarili disk page reduc disk frequent referenc larg lower store memori infrequ referenc node store disk implement pin page frequent referenc node memori exact implement disk transpar present algorithm repres set defin search space discoveri problem present search conveni leaf node node leaf node correspond label path form symbol repres gener transact object label simpl path start transact object discuss section replac node path repeat ith ancestor construct sequenc path prefix call order string preserv construct node path form root node path share label branch label provid ith path left final tree illustr construct transact object defin cast factor invit actor actor forg nation te actor forg nation actor te forg nation actor te actor forg actor invit actor cast actor org nation cast actor org nation cast actor nation org figur construct shown figur te construct te te invit invit note order repres fact valu bag repres children bag node order suffer problem problem children repeat label construct factor actor movi construct path construct actor label path actor solv problem superscript repeat actor label gener path gener path actor actor repres actor label repres ith occurr maxim superscript respect denot number occurr problem label consid solv add edg defin number refer object construct form jn jn satisfi cross product simpl path start transact object superscript rang largest node condit prefix superscript label branch node distinct path form call rest concaten denot construct overview core algorithm comput frequent set denot note construct depend superscript label shown figur redund concern deal problem section prune search space gener frequent section focu find search entir space prohibit examin infrequ observ form foundat state theorem downward closur denot express frequent weaker weaker relationship transit theorem comput order phase phase make pass transact object find repres frequent phase kth pass transact object gener candid frequent find comput support candid scan transact object phase ii termin empti search space prune ignor order children bag node discuss prune section maxim discoveri addit phase remov frequent frequent remov immedi gener maxim frequent identifi special case frequent remov end phase ii comput similar apriori base subset properti itemset fi frequent fi fi frequent reader simpli map itemset fp appli apriori solv problem hand work reason comput foreach transact object foreach simpl path foreach label sequenc case case return frequent foreach output jn jn figur comput weaker impli fp subset fp itemset fp figur weaker fp fp show work map sequenc item replac weaker relationship subsequ decid gener repres weaker relationship phase comput phase find repres frequent form jn jn construct discuss section question comput support import note differ superscript label repres support jn jn sequenc denot support defin number transact object simpl path label figur comput largest simpl path label transact object omit comput clariti rest oem graph figur illustr discoveri algorithm recal circl node denot bag squar node denot list transact inform electron shop transact consist subtransact item cash consist credit card cash cash cash credit cash credit cash figur repres cash cash credit cash cash credit cash cash tabl cash definit cash cash cash cash cash cash occur object shown tabl transact object simpl path label cash gener path form largest largest frequent similarli gener includ final prune strategi discuss section phase comput search space theorem storag structur facilit effici retriev pair dynam grow reorgan denot meet requir trie maxim depth trie tree node node repres level level level figur foreach transact object foreach weaker support foreach support delet leaf node figur comput support path repres omit root node refer path node repres node end node freeli speak term frequent support weaker obviou understand refer repres corollari search space corollari pair theorem repres end sibl leaf node gener candid corollari gener pair end sibl leaf node creat child repres extend extend extens figur show gener prune address prune search space shortli count support figur show conceptu comput support sequenc transact object read hierarchi examin support weaker prune scan current weaker descend tree prune figur construct natur implement elabor prune search space phase ii face problem affect effici scalabl algorithm search space grow illustr figur repres frequent gener figur repres fl fl address issu prune search space recal construct form jn jn superscript serv creat repeat label child node superscript anymor construct ignor superscript suffic systemat method refer consid idea condit superscript label construct motiv definit construct list node monoton outgo label strictli order left bag node monoton outgo label strictli order lexicograph order left list node order repeat occurr bag node order label repeat occurr node natur monoton outgo label ith occurr left natur node natur figur monoton observ subsequ discuss observ natur repres search complet frequent natur sequenc gener observ ii prefix natur natur observ iii permut natur natur impli natur prune search space substanti reduc simpli prune work theorem gener candid sequenc gener order gener natur figur gener natur gener natur observ extend gener similar result extens gener natur prune extend strategi kth natur extend extens kth prune lot natur strategi prune extens level gener natur gener complet search gener extend natur prefix natur share natur gener gener natur extens observ monoton case summar notion monoton natur natur vice versa figur permut sequenc prune gener strategi ii gener observ iii impli strategi ii prune extens level nonmonoton strategi ii impli type extens extend natur sequenc sequenc prune strategi appli maxim discoveri problem idea prune frequent candid extens frequent gener extend weaker frequent extens kth pass prune strategi strategi iii maxim discoveri gener frequent prune strategi prune end node node gener child node prune leaf node gener foreach natur strategi foreach prefix strategi ii extend delet leaf node repres strategi comput support foreach transact object foreach weaker support foreach support delet leaf node repres mark strategi iii figur gener extend sibl node section verifi effect strategi iii figur summar gener theorem discuss theorem assum end phase ii ffl set prune strategi ii iii discoveri problem ffl set prune strategi iii maxim discoveri problem show comput theorem repres uniqu impli gener theorem distinct comput theorem distinct observ natur prune strategi repres ignor superscript node jn left outgo label outgo label superscript impli ident contradict assumpt distinct root sequenc cash cash credit cash cash credit credit cash credit cash cash cash cash credit credit cash cash credit cash cash credit cash cash credit cash cash credit cash tree figur continu figur show portion level refer tabl frequent gener ffl extens extend extens frequent cash left side label ffl extens gener gener frequent ffl extens gener frequent ffl extens extend ffl extens gener ffl extens gener frequent ffl extens extend prune strategi gener ffl extens frequent ffl extens gener ffl extens frequent ffl gener figur show repres figur show tree return discoveri problem maxim discoveri empti prune strategi mark mark phase maxim phase maxim discoveri remov remain frequent sequenc observ weaker suggest prune find maxim frequent respect result add final result weaker sequenc final result figur show comput foreach foreach sequenc weaker sequenc remov foreach foreach sequenc weaker sequenc output output figur maxim phase continu remov frequent sequenc weaker credit cash repres answer maxim discoveri problem test remain test te weaker te defin section search tree te insid tree te root te match root te match found node te match found label addit requir node match node type list bag node te complet bipartit match te list node te sublist match te requir algorithm find match omit detail assum te node te node time complex test te weaker te depend good algorithm complet bipartit match affect cost test im memori effici studi effici algorithm effici depend factor minimum support prune strategi difficult deriv tight bound comput cost analysi assum frequent typic practic approach analyz scan studi factor cost data characterist factor includ size search space execut effect prune scalabl larg notat mean number label number identifi averag size identifi averag size potenti larg set number potenti larg set maxim nest level tabl paramet scan analyz assum oem graph store disk store memori choic store memori base reason minimum support defin substructur user highli effect restrict search space case minimum substructur frequent case user question larg amount substructur view substructur fit modern comput memori human user user rise minimum support reduc number typic substructur phase hierarchi transact object read pass phase hierarchi transact object read comput support candid phase iii read transact object assum number pass phase scan hierarchi transact object experi show typic algorithm linear cost reduc number page store frequent access call memori leav infrequ access node disk implement pin memori select page replac buffer manag larg buri lower level graph heurist store node order order node ensur page access bring node subsequ studi feel real perform conduct experi data characterist minimum support focu indic size search effect prune execut scalabl larg data characterist similar number number depth size dataset dataset gener acycl dataset simpl path cyclic oem graph model similar borrow concept potenti larg set potenti larg set itemset common item random case properti attain item potenti larg set control manner refer deal bag list type impact data mine problem idea treat subobject refer supermarket item construct object higher level bag list item atom object level object level maxim level subobject maxim level object transact object level document gener level level level treat subobject refer level item construct object bag list pick potenti larg set pool set potenti larg set level refer tabl notat paramet overlap object control paramet object construct assign identifi subobject refer level creat assign label number identifi determin poisson distribut construct set potenti larg set level process repeat transact object level construct convent repres nm tm pm group paramet label atom object group paramet transact object transact object label paramet level restrict dataset set default valu maxim nest level number transact object denot repetit tabl ffl denot default set ffl denot default set dataset tabl refer dataset explain choic default valu averag number subobject refer default basi web page small number link top level categori order share number object smaller number transact object applic transact object object research paper transact activ research topic movi activ type student larger larger experi show reduc search expect object lower level mean share share substructur number probabl student reduc number student experi environ sun workstat cpu rate mhz memori size mb oem graph store unix file node store order node visit algorithm node refer node made store copi node node frequent lower memori read time hash tabl map locat file locat memori pin node rest examin factor effici size search space group studi search space affect data characterist minimum support number leaf node estim size search space effect share subobject larger lead share subobject dataset iii tabl set tabl show number leaf node dataset ii leaf node level maxim frequent pattern column entri interpret similarli comparison dataset iii show search space grow subobject share similar effect observ lower level effect number label tabl set number label dataset paramet unchang tabl show number leaf node smaller impli larger search due share label effect number object tabl set number object identifi dataset iii tabl show number object identifi effect similar number label smaller impli larger search space trend show simpli label object share search space reason experi larger effect number level tabl set maxim level dataset fix paramet tabl show size search space prune strategi tabl compar number leaf node gener prune strategi iii shown result default dataset dataset similar trend comparison show prune strategi lead quick drop size search space confirm expect effect prune strategi execut time figur figur show execut time experi tabl gener trend minimum support execut time maximum case execut time consist size search space tabl scale experi left side figur scale number transact object paramet unchang side figur show rel time respect time experi left side time averag minimum support case show clear linear growth number transact object summar experi ffl search space subobject share minimum support reduc simpli number object label intensifi share subobject label ffl clear indic prune strategi iii effect experi show quick drop number leaf node small search space justifi choic store memori note small minimum rang gener requir larger search space larg minimum support ffl transact object test data characterist experi show algorithm scale linearli larger dataset ffl number frequent small minimum support number maxim frequent case studi unlik frequent reduc minimum support add maxim frequent make previou maxim frequent longer maxim frequent explain number maxim frequent minimum support reduc pattern pattern pattern pattern pattern pattern pattern pattern pattern pattern pattern prune prune pattern pattern tabl size minimum support dataset dataset ii dataset iii number transact dataset dataset ii dataset iii minimum support dataset dataset ii dataset iii number transact dataset dataset ii dataset iii minimum support dataset dataset ii dataset iii number transact dataset dataset ii dataset iii minimum support dataset dataset ii dataset iii number transact dataset dataset ii dataset iii minimum support prune prune number transact prune prune figur left execut time scale movi titl countri distributor director place categori occup cast centuri fox film place place actor award award award genr figur segment movi document movi dataset appli algorithm internet movi discov typic structur movi document june imdb cover peopl inform organ html document figur show segment movi document reader quick tour sourc randomli inspect movi found movi inform speak countri movi titl suffici ran queri condit ear movi titl extract import field movi document build oem graph requir larg number autom request remot site select return movi titl experi wrote profil extract program extract context label context level itl movi level actor interest movi actor ignor itl label actor object movi restrict defin top actor movi actor list order credit link costum sound languag link imag top part figur show full structur movi document perspect experi set find maxim frequent figur omit pattern individu support substructur bio born pattern label match substructur found frequent higher support movi document label ft support discov store retriev queri interfac retriev inform gain gener inform content movi discov vocabulari structur find statist miss inform born ear bore track identifi movi document support typic url address case easili incorpor algorithm count support candid relat work work relat mine associ rule collect basket item associ rule custom bui bui beer core associ rule problem find itemset number basket larger candid itemset construct join smaller frequent itemset support comput test candid basket work import differ unlik flat subobject refer object unlik construct count support requir join flat set test set rich data framework requir prune strategi label make problem associ rule problem work discov structur inform semistructur data discov type object set base rel import label larger set construct type hierarchi type hierarchi lattic organ discov type order standard set gener subobject relationship origin data extract schema singl graph structur consid repeat number graph structur deal substructur confid support deriv uniform schema multipl object find hierarchi object merg global schema construct global schema discov substructur object inform extract system treat object collect keyword treat object structur found web preliminari version work report shown gener includ full version result full pattern pattern figur full structur maxim frequent amount data grow refer import field label hierarch order label refer role field hierarchi refer inform structur sourc tradit data mine method treat object set list item explor intern structur object treatment structur base observ object type inform similarli ident structur typic share larg number object reveal gener inform content discov structur import end user sourc builder defin discoveri problem solut base search space effici effect evalu synthet dataset real dataset tradit inform access narrowli queri larg approach approach mine typic structur object altern inform access acknowledg author anonym provid comment refer icd associ rule set item larg sigmod agraw algorithm mine associ vldb queri languag optim techniqu unstructur sigmod queri system vldb sb structur retriev inform ijcai ao ga world wide pdi structur semistructur workshop manag semistructur hierarch icd exchang heterogen inform icd sw analysi good algorithm siam vol decemb dy dh km jy schema inform forest select label order workshop manag semistructur hq discoveri semistructur intern confer knowledg discoveri data newport hq typic structur road map approach acm sigir confer research develop inform workshop manag semistructur data arizona
DB/1231 3 index techniqu continu evolv phenomena salteni depart comput aalborg denmark abstract manag spatiotempor data increasingli import wide rang applic ongo phd project applic spatial tempor aspect object continu chang index techniqu chang explicit updat spatiotempor record effici queri current predict futur behavior continu move mobil peopl tempor applic spatiotempor applic discret time interv natur relat current continu progress paper outlin research agenda phd project describ briefli access method develop project introduct recent year shown amount data store data applic emploi manag system technolog spatiotempor data promin exampl kind data modern dbmss contend emerg support kind necessit effici oper queri data perform issu index ongo project address index spatiotempor data project applic data continu evolv convent data assum constant explicitli applic support continu evolv continu function explicitli updat support data standard techniqu amount perform frequent updat record inaccur attract altern index continu movement spatial object index continu evolv tempor spatiotempor data investig project exampl continu evolv spatial object includ air mobil commun militari exampl applic area data common includ vehicl mobil data manag industri leader mobil phone market expect continu advanc telecommun posit technolog result hundr million locat mobil internet termin captur continu chang posit move store simpl function time express object posit store updat paramet function chang linear function paramet posit veloc vector object time function report index problem address order support continu move spatial object problem concern index histori continu evolut spatial support interpol explicit posit updat problem index current state continu evolv spatial abil extrapol posit futur comput time function describ movement object spatiotempor spatial extent object chang discret step tempor continu evolv data occur natur support time interv relat continu progress current time rel record inform start date stop record work section briefli outlin relev research section address index continu move object relat work larg bodi research exist spatial index robust spatial indic organ spatial object bound group minimum bound rectangl organ mbr tree structur area spatiotempor index matur research spatiotempor index assum discret movement spatial object index histori continu move point address pfoser al histori movement point repres polylin spatial dimens time dimens line segment polylin index adapt rtree approach index current predict futur posit move object approach al continu move point index line space segment line span index approach suffer substanti space overhead high updat cost period reload index limit kollio al investig index current predict futur posit move point idea socal dualiti map linear trajectori move point ref ref static ref queri transform author briefli discuss extens method dimens extens impli repres movement point static point agarw al report theoret result index current predict posit move point author techniqu dualiti kinet data structur partial persist address problem index continu move point mention section type data investig project tempor spatiotempor data literatur tempor distinguish tempor aspect valid time transact time valid time fact time fact true model transact time fact time fact current bitempor transact time valid time record interv natur tempor indic transact time substanti number indic support bitempor data recent research studi data indic support data assign data fix time interv versu interv separ tree index posit continu move object problem address phd project index posit continu move object dimens contrast approach present section explor index continu move point idea time data point bound rectangl inform futur behavior data point veloc edg br speed veloc vector perpendicular speed edg br chosen br valid futur time point time point time br move view tree time futur approach deriv idea index bitempor data figur top left diagram show posit veloc vector point object time figur move point result br top diagram show assign point br assum maximum object node previou work shown attempt minim quantiti dead perimet br lead index good queri perform chosen assign chosen br grow stai valid time bottom left diagram show point br time unit note rectangl affect queri perform object belong br object origin direct movement posit diverg rapidli rectangl grow perspect queri time assign object br illustr bottom diagram note time assign yield queri perform origin assign assign object br queri arriv illustr issu address develop insert bulk load algorithm algorithm optim queri perform tree period reach time unit futur tune index updat queri window express queri reach shown addit simpl natur address close relat approach base dualiti transform unlik easili extend spatial object extent move chang shape develop time issu research bound rectangl degrad time pass tighten updat improv queri time slightli cost updat tradeoff impact queri perform frequent tighten requir explor time group point node obsolet counter polici period full partial index reload consid approach index histori continu movement usag gener techniqu render data structur partial persist partial persist access previou valu move object paramet ref index data combin valid transact time fact treat region space transact time valid time transact time region grow continu time pass index tempor data relat index continu evolv spatial data idea project conduct research parallel index kind problem benefit solut develop start point project idea index capabl index grow bitempor region due semant bitempor region grow restrict manner accommod introduc similarli grow minimum bound region intern node tree illustr figur futur tt vt current time figur bitempor data region minimum bound region build idea st index discret chang spatial aspect object support time interv spatial dimens transact valid time incorpor st due semant tempor spatial depend applic queri restrict tempor spatial dimens time point tempor natur semant import tree adapt spatial restrict queri tempor restrict queri investig support queri profil identifi case maintain spatial index tempor index st pai term queri perform summari continu evolv data occur natur wide rang index data research lightli intent phd project perform research gener set techniqu index continu evolv phenomena phd project index class posit continu move spatial object data time interv index current futur posit continu move point st index tempor data spatiotempor theoret studi extens perform experi carri realist set desir order evalu approach compar altern refer erickson index move point proc acm sigmod data structur mobil data proc symposium discret pp becker al asymptot optim vldb beckmann al effici robust access method point rectangl proc acm sigmod pp slivinska base index bitempor data proc vldb pp slivinska index gener bitempor data tech report clifford al semant gunther access method comput survei gute al foundat repres queri move object hagen guttman dynam index structur spatial search proc acm sigmod pp jensen al consensu glossari tempor version tempor research lnc pp tsotra index mobil object proc pod pp faloutso design access method bitempor theodoridi access structur move point tech report analysi rang queri perform spatial data structur proc pod pp jensen index trajectori move point object chorochrono tech report salteni jensen base index gener data tech report lopez index posit continu move object proc acm sigmod salzberg tsotra comparison access method data acm comput samet relat hierarch data structur acm comput survei wolfson base dynam attribut index method comput journal manolopoulo specif effici index spatiotempor proc pp jiang move object issu solut proc pp
Agents/1232 1 technolog commun overview alex john intellig system applic group depart electron engin queen mari westfield colleg london email abstract telecommun infrastructur natur applic domain distribut softwar agent paradigm author clarifi potenti applic softwar agent technolog legaci futur commun provid overview publicli research softwar agent network manag author focu call intellig type softwar paper review reason mobil agent made impact domain object describ intricaci softwar agent approach manag commun system paper main section section introduct softwar agent technolog section consid gener problem network manag reason softwar agent provid suitabl solut section review select research agent telecommun manag framework final section conclud paper discuss problem encount futur direct research introduct emploi softwar agent network user interfac begun make impact commun industri end manag unit cope larg amount control inform gener everydai oper network system telecommun manag control centr emploi sophist softwar aid make network system configur oper revolut multipl softwar entiti inhabit physic commun network autom control action network reli human accept telecommun industri describ reason adopt softwar agent technolog benefit network servic provid end commun system effici benefit busi provid improv ad servic delv latest develop softwar agent import provid introduct problem telecommun domain face section describ architectur model deploi network manag area dissemin comput internet lead ubiquit inform telecommun transit stage telecommun comput industri merg main work similar fulli commun system autom everydai task evid trend combin advantag tradit connect orient telephoni internet base effort commun factor deal huge amount traffic futur network develop larg data orient applic video demand method deal huge traffic demand congest network adopt model dedic provis qualiti servic term qo wide subject measur commun channel stronger mean technolog asynchron transfer mode qo atm refer specif metric loss minimum bandwidth origin submit septemb januari network provid connect accept network abil provid depend dynam network intim relat type traffic end user gener part commun dialogu gener requir implement sophist control signal techniqu depend qo provis complex signal techniqu present major obstacl network integr network oper owner underli network servic provid author applic servic network common signal system control conflict interest sheer complex exist heterogen system meant comput arena chose basi internet internet model base concept network hardwar view transmiss platform function li softwar function resid host server includ model eventu prevail enabl commun platform futur section describ manag solut telecommun coupl concept internet softwar agent technolog provid easier autom flexibl servic enabl commun system import factor achiev transmiss network maintain distribut network manag network manag concentr physic level specif class perform secur refer advent technolog atm ip atm mobil ip intellig network qo base technolog activ network mobil commun advanc underli digit infrastructur network manag focu logic level flexibl improv integr factor push commun industri forward competit number servic move applic level comput advanc switch softwar hardwar provid provid overview commun comput base converg review underli corba descript corba telecommun activ attent logic level aid push provid mechan system autom kei contributor achiev competit market advantag paper main part discuss notion constitut softwar agent system pai attent softwar engin concept describ mobil agent commun import implement aspect centr comput agent earli stage develop section discuss main factor problem found telecommun domain describ research address issu section devot survei select interest research conform definit softwar agent telecommun final section summari issu highlight conclud paper softwar agent relat definit wide commun infrastructur futur fertil ground softwar agent gener ai techniqu illustr state servic network futur popul softwar agent capabl assist end user grow inform access intend provid review agent technolog scope paper refer interest reader aspect intellig agent languag detail discuss background applic domain softwar agent latest review agent architectur similarli provid detail ai dai artifici techniqu section interpret descript provid refer context paper term adopt gener phrase describ concept softwar entiti autom task regard mundan labori human agent term softwar agent incorpor commonli softwar compon research tackl complex decomposit mobil agent intellig refer intellig agent recent distinct line drawn paradigm research domain focuss agent technolog commun overview problem research area reli similar autonom softwar process implement procedur thread behav conceptu autonom deal autom control task evid specif attribut merg unifi paper discuss intellig mobil agent futur telecommun system foundat intellig physic agent address integr mobil abil origin definit agent intellig messag pass commerci mobil agent includ provis agent commun languag provid distinct type softwar agent paper focu softwar agent enabl autom manag control telecommun provid interfac internet search type agent paper discuss reason distribut softwar agent provid underpin softwar technolog current legaci system futur telecommun system reader interest wide varieti applic agent technolog commun refer book entitl agent futur commun softwar agent independ execut program handl autonom direct input run time select action expect limit unexpect event occur softwar agent differ typic possess deal world environ applic term agent year field distribut comput refer specif entiti solv specif task distribut comput paper concentr kind abil softwar agent wooldridg jen classifi possess social adapt wooldridg jen provid review intellig softwar agent research provid broad taxonomi agent telecommun domain identifi local network dai base agent mobil agent classif appli vast arrai work commonli group head research paper fact difficult extract interpret term telecommun research strictli relat agent definit encount dai work compli definit multipl softwar agent high level system approach intuit simpl develop draw experi solv problem real world softwar agent develop advantag construct base relianc natur methodolog isol interact modul make complet problem solv agent system distribut softwar agent idea power softwar develop gain solid problem solv requir control agent approach analog decomposit problem concurr task deleg support abstract complex gradual emerg telecommun domain benefit cite literatur ma approach address problem larg singl resourc limit robust concern abil recov fault condit unexpect interconnect multipl exist legaci expert support legaci network improv scalabl structur agent dynam chang reflect dynam environ network grow size agent agent alter belief action perform provid solut inher distribut telecommun air traffic control workflow manag provid solut draw distribut inform provid solut system advantag central control system achiev multipl goal manag multipl sensori input network manag control architectur exploit agent technolog perceiv import step forward agent architectur section discuss level architectur import make comparison distinct part paper level architectur granular defin relationship compon constitut intern composit call intern architectur defin relationship interact individu agent wooldridg jen classifi agent type agent intern architectur agent design adopt main architectur type delib hybrid wooldridg paper detail review research adopt architectur approach müller discuss type agent intern architectur appli contrast situat applic russel norvig describ differ classif agent intern architectur provid excel cover ai techniqu integr part agent technolog figur show common output action perform softwar agent figur adapt figur agent interact extern environ extern factor incom messag agent agent infer engin intern world state outgo messag agent action environ choic adopt specif agent intern architectur architectur useless multiag system level architectur defin multiag system level architectur high level framework agent oper constitut mechan total agent system conform section describ system level import amount collabor occur agent classif softwar agent classifi agenc possess agenc softwar agent conform reason base mentalist notion desir intent typic strong agenc gener mobil concern aspect asynchron task mechan hardwar independ abil distribut intellig section describ mobil agent telecommun system open system heterogen multi agent system mention central ma concept societi agent share inform problem solv ma achiev determin amount collabor individu agent activ particip extent inform share collabor agenc gener govern adopt agent interact strategi main interact strategi discuss agent hostil agent behaviour agent develop compet parti oper open environ essenti critic system control equilibrium oper state system explicitli network fault nuclear power station relev kind agent network manag illustr agent work intent solv joint problem model network manag view perspect singl network provid agent prepar suffer loss individu util long exchang common good introduct independ servic provid mean autom negoti system agent good concern global perform servic agent term monei import network manag increasingli integr commun infrastructur part make interact arguabl agent technolog commun overview interact subject analysi game recent work investig practic case comput resourc bound solut qualiti trade comput cost work area electron commerc investig exchang good context network manag agent method incorpor exchang ensur supplier futur gain carri exchang larger gain defect import comput agent manag exchang cross nation law applic law difficult enforc hostil notion hostil model agent util gain loss import class agent network manag area clear author awar work relat network manag exploit hostil agent amount work distribut resourc alloc control problem agent principl reason distribut reduc commun cost central problem gain speed comput resourc gain reactiv consult central gain robust lack depend singl comput node understood case distribut problem solv agent case argument favour distribut cooper schedul system argument examin context network manag problem distribut effect simplifi form call admiss control network servic provid admiss polici problem formul defin network negat sum link residu network subject constraint residu easi show polici alloc path smallest hop appli gradient base iter approach converg true measur provid simpl distribut alloc polici reactiv agent site entri point network connect request simpli alloc path smallest hop count adequ bandwidth distribut agent act autonom manner interact provid reactiv control converg optim global optim solut fact local optimum found reactiv level control admiss network strong argument distribut fact obtain advantag cite problem establish adequ bandwidth make problem principl strateg level control plan requir coordin plan schedul complex combinatori natur problem distribut argu abstract detail local inform pass distribut detail raw sensor data achiev coordin bandwidth commun counter argument abstract introduc make search effici separ commun distribut agent exce requir inform pass central problem solv agent larg amount commun solut kind messag time distribut agent state inform robust argument support handl replic distribut illustr problem network manag plane distribut agent effect plan network flow project demand pattern entri node criterion manag plane tactic defin resourc alloc problem formul term singl central problem solv agent formul program problem distribut comput desir improv network surviv autonom agent situat node network deriv behaviour agent converg global optim plan alloc lead robust solut node process continu effect distribut comput agent sourc destin residu capac network relev sourc destin pair lot inter agent commun requir agent updat plan altern replic calcul node extrem node attract robust simpl vote mechan base surviv metric make solut local maximum system problem solv perform agent ma form distribut problem solv involv negoti commun order ma solv common problem agent share inform explicit commun activ pursuit schedul action interact conflict negoti conflict result simpl limit resourc content complex issu agent discrep domain requir determin structur group agent number mechan enabl includ structur agent system hierarchi author limit flexibl action high level finit state commun model check consist larg collect paper devot social interact agent refer reader jen discuss refer section discuss mechan wide implement telecommun problem influenti techniqu task resourc alloc societi agent protocol gener natur robust acknowledg adopt fipa intellig physic specif high level coordin mechan alloc task resourc agenc insert descript mechan paper review part main construct market structur assum agent manag contractor basic form agent solv assign problem local problem find agent resourc solv assign solv contract mechan consist manag creat contract announc agent system contract contract agent submit bid contract offer bid evalu contract award contractor bid bid accept contract agent revok servic level network control advantag includ abil alloc task dynam agent introduc remov limit involv fact detect resolv conflict broadcast messag possibl outweigh network manag environ section specif refer applic network manag provis suggest negoti protocol telecommun servic provis environ negoti protocol build aspect incorpor approach number servic combin manag interestingli avoid user familiar complex natur interact featur softwar agent commun agent pass messag inform environ inform chang gener occur higher level abstract tradit remot method call agent commun involv pass inform knowledg level natur languag syntax high level commun occur dynam mechan share ipc facil static mechan file system lock main categori agent base commun proprietari agent commun languag acl specif agent commun plan pass stigmergi commun enabl agent environ exchang inform agent inform agent current amount resourc addit inform basi origin action sequenc softwar agent gener commun agent order work flexibl agent technolog commun overview acl deriv inspir speech act theori develop linguist attempt understand human languag dai achiev everydai solut commun problem rang involv direct commun bt mobil agent involv ad hoc acl involv standard acl proprietari acl chosen commun mechan due applic requir specif due lack acl demonstr import care choic agent commun protocol demonstr provid situat complex messag pass protocol sever impact effici bandwidth physic commun system acl essenti agent base network manag system achiev integr legaci system futur demand regular network system upgrad fipa intellig physic attempt defin standard fipa acl base kqml queri manipul kqml languag view consist layer messag commun layer content layer specifi actual proposit messag level kqml set perform constitut messag layer layer enabl agent share intent commun layer defin protocol deliv messag encapsul content simpl construct kqml messag mbit inform kqml specif found kqml defin specif set perform agent support kqml kqml defin format messag content messag real world mean agent recipi common requir agent engag commun dialogu common term real world call ontolog ontolog mean symbol express domain languag ontolog map syntact content simpl construct mean commun agent agent ontolog achiev kqml number import lack semant cohen levesqu real agent design interpret give perform fact design intend problem identifi fipa fipa develop acl reduc number support perform respect defin semant kqml fipa acl lack ground semant commun level lead includ difficult task abil verifi semant import develop larg control system base acl commun import point fipa acl address agent send request agent interpret messag content fipa specifi perform prevent deadlock situat agent wait agent agent respond fact fipa compliant implement perform mandatori situat agent die whilst lead difficult resolut agent agent send messag time inform exchang great import address design implement commun societi messag delai sugawara studi problem agent messag propag delai propag delai wide address telecommun domain implic exacerb consid agent context propag delai network control delai agent system difficult design implement uncertainti messag delai incorpor discuss includ discuss method clock interact load control context mobil softwar agent focuss intellig agent paradigm telecommun arena place pertin control logic addit function commun network extrem import potenti outdat system updat effici manner adopt concept provid network oper mechan dynam updat switch control logic perform updat system level function method achiev dynam updat process activ network technolog section method conceptu extend abil deploi mobil code adopt mobil agent technolog mobil agent technolog subject attent year due technolog platform java rmi corba middlewar avail power process hardwar mobil agent technolog origin concern abil move execut code comput main benefit adopt approach comput resourc comput resourc origin comput scarc principl intuit actual implement led unforeseen problem maintain locat softwar code network enforc integr complex ensur secur convert execut code gener platform independ format point consid earli evolut mobil agent histori interest capabl research interest deal idea move call place execut impact ma technolog commerci world convei nwana mention percept agent technolog synonym mobil public overview paper develop mobil agent world belief telescript mobil agent framework develop gener nwana cite lead mobil agent oper longer support usabl system call odyssei gener magic mobil agent toolkit framework implement java languag concept mobil agent blur distinct client server type remain case pass messag effici move agent node node care analysi benefit approach provid applic domain mobil agent provid suitabl mechan dynam place control softwar telecommun adopt impact actual network architectur relat signal protocol telecommun system metaphor encapsul program framework comput network modular mobil agent approach encourag design flexibl adapt network architectur ma present interest abil coupl problem continu connect network resourc situat pertin user mobil laptop comput discuss requir mobil user section advantag ma provid situat ma creat upload network wireless commun dispatch execut network comput carri task mobil user reconnect network inform manag obtain provid detail descript kind scenario describ magenta framework overcom encount problem figur show agent creat person digit assist fix network temporari commun wireless link mobil agent achiev advantag messag pass agent approach interact node node geograph assum node manag node updat control logic situat node send messag node achiev similarli control logic download node assum node accept logic effici mechan type situat case node requir addit data piec oper system softwar includ logic updat situat benefici agent move actual node carri task upgrad carri task agent deal occur approach benefici term reduc bandwidth consumpt node node rapid send messag back node incur propag delai encapsul mobil agent knowledg deal complet task advantag obtain expert mobil agent activ process node cpu resourc reserv bandwidth commun channel gener reduc network resourc aglet technolog interest mobil agent technolog agent technolog commun overview java implement autonom mobil softwar agent technolog aglet extend model code class file maintain state migrat node node aglet reli presenc java virtual machin execut state secur limit major concern ma technolog lack secur agent side relationship case agent requir specif piec softwar order gain access resourc host comput ibm aglet framework softwar call secur mechan prevent server violat execut agent concern user deleg confidenti inform credit card ma open network system proper secur server comput gain access confidenti inform agent violat mobil agent person digit assist end user system figur mobil agent fix network mobil agent overview paper chess provid interest applic mobil agent similarli section mobil agent technolog describ mobil agent platform mix intellig mobil agent perspect agent commun system refer reader widespread accept java languag abil provid platform independ mobil agent technolog clever innov ma research servic provid adopt concept kind network internet domain part commun system discuss benefit high level concept softwar agent approach construct turn attent specif problem occur commun domain describ background problem encount domain solut softwar agent paradigm provid begin section gener descript issu complex involv network manag control gener network complex temporari network link commun channel ad servic mobil agent fix network network servic network rang size complex small local area network million node make internet larger heterogen network complex tradit network manag approach unabl cope scale world wide commun network tackl problem intern standard develop open system interconnect base idea approach adopt manag complex network system principl idea approach adopt interfac reduc network heterogen network manag gener network monitor control network manag system perform thing task network proper secur collect archiv data fault manag introduct network manag extend concept osi network network manag system encompass idea task deleg manag task assign specif distribut process reduct bottleneck traffic exist network manag architectur base outdat concept due cost track latest develop enabl thing full conflict resolut advanc softwar develop oo design agent technolog made progress support modular flexibl respect replac osi base commun implement ubiquit distribut process environ wai conform internet type model architectur servic provid object interact occur interfac complex transpar obtain underli network platform typic transpar distribut replic suggest tina act similar corba corba architectur fulli exhibit requir type environ lack characterist avail object stream interfac tina implement techniqu creat standard applic program interfac concern hardwar idea similar run java virtual machin softwar comput oper demonstr paradigm domain converg framework user mobil user habit begin impact telecommun network manag control end user move commun devic chang place inform point bank mean equip requir access servic adapt list defin concept begin user mobil factor influenc place telecommun infrastructur termin mobil termin equip identifi uniqu termin identifi equip uniqu identif independ locat idea termin equip identifi person mobil independ network point attach specif user equip user uniqu identif enabl user devic common pool resourc inform session mobil end user continu involv servic session independ equip abil move activ spreadsheet session unix window environ transpar session termin user person work work profil place factor impact exist telecommun paradigm chang telephon number identifi telephoni equip flexibl telecommun network oper provid person identif mechan user world wide web search person interest hobbi contact hyperlink type mechan concept person telecommun recent gain popular mobil user reach person contact number call made person number rout person current locat sophist locat mechan badg activ commun equip vicin mobil user session mobil concept prove essenti chang envisag abil read email work comput unix continu session return home pc problem scenario agent approach essenc abil agent collat user type comput equip negoti agent capabl convert session format requir format give user transpar transit session research preliminari requir sort scenario mobil ip principl mobil ip agent locat kei node individu node roam internet space agent reconfigur ip address rout node forward inform locat distribut manag basic high level architectur control complex distribut local control hybrid architectur agent technolog commun overview architectur advantag architectur applic sector telecommun telecommun domain distribut hybrid network manag architectur factor distribut agent effect rapid growth complex network system debat paradigm scaleabl poll monitor control inform switch manag station larg overhead physic layer commun mechan reli approach mean system vulner system failur control polici action control action occur central manag system manag effect mechan instanc small redund number entiti requir control activ approach benefit term provid global network state reduc probabl inconsist conflict benefit weigh provid scalabl obviou disadvantag approach control data process order enabl applic network servic point address global inform dissemin local control provid common manag reduc geograph spatial comput power control telecommun network inher manag system requir abil deal except robust circumst servic complex greater amount inform process partial system failur requir rapid network manag increasingli difficult handl global mechan state distribut expert problem solver autom manag process reduc commun overhead manag system control activ point reduct continu system state poll higher level commun languag distribut task comput resourc improv term fault recoveri vulner global system isol failur deal uncertain inform improv time control achiev rapid local except ai techniqu deal situat lack knowledg develop optim algorithm defin procedur algorithm deal improv flexibl encompass extens provid introduct complex servic clark describ system agent commun activ central achiev approach servic post forward relev parti bidder respond directli sender messag select offer coupl central centr fulli distribut control robust depend function softwar agent base network manag network manag refer mechan act global manner entiti move system configur realloc system equilibrium state manag oper act longer time scale control provid action maintain system stabl condit distinct blur advent mobil control entiti agent enabl adapt node control logic distribut fine grain alter node function invok geograph distant locat servic manag resourc provis heterogen environ mission critic carrier competit open market network servic agent research integr control manag appli game theoret concept resourc alloc econom system constitut class mechan alloc resourc distribut maker elabor econom framework resourc alloc section resourc alloc difficult problem address network primarili network oper state dynam broadband technolog research work conduct optim strategi connect admiss control rout optim capac literatur problem success topolog reconfigur requir aspect network function conduct extens research atm perform manag agent orient approach falt chosen reli hierarch decomposit agent system framework layer approach chosen agent approach deal congest control atm network agent locat switch buffer provid feedback inform sourc node agent connect ad network add congest obtain region network alloc resourc major factor appli agent telecommun commun agent agent commun action resolut reach rapidli locat agent locat agent physic repres connect agent stationari view network agent agent control benefici agent awar indirectli relat event occur agent local depend agent agent system agent research consid part describ work greater focu relationship factor book text devot explicitli factor mention describ approach implement agent commun describ aspect agent telecommun applic softwar engin perspect fipa defin inform specif document address issu agent technolog network manag network provis fipa defin scenario import combin servic element network provid order obtain singl servic user fipa state agent technolog facilit automat negoti deal configur servic document scenario specif negoti agent gener dynam virtual privat network level agent granular agent human person commun agent type servic provid agent repres interest goal servic provid network provid agent process set servic initi set user defin constraint qualiti servic maximum amount user pai servic durat servic requir pca negoti spa determin deal term qo cost negoti implement agent pass fipa acl messag specif ontolog map agent acl messag control paramet fipa doc inform syntax semant negoti mechan continu spa deal suitabl configur obtain spa map negoti contract network specif configur set depend commun infrastructur frame establish importantli attent paid secur prevent competit discov high level polici except instanc polici contract physic network failur specif concern servic manag telecommun user provid servic varieti termin connect network choic servic individu network competit servic deliveri platform forc interconnect distribut softwar agent agent technolog commun overview technolog candid solut requir intellig servic manag integr techniqu achiev agent technolog appli telecommun domain servic suppli individu servic provid coupl give user combin servic requir individu servic video transmiss hotel book combin gener servic refer ad servic ad servic user video combin data connect connect inform hotel accommod paper describ agent protocol make individu servic custom send servic request individu custom agent attempt configur ad servic send request number relev servic agent sa negoti servic supplier agent sa select highest bid provid servic content satisfi ca origin request fuller descript section ut multipl servic integr achiev softwar agent defin user agent gather prefer type servic time dai long requir user agent negoti servic provid seek mutual accept agreement user agent gain author provid requir servic cheapest price current telecommun manag platform constrain discuss agent interact emploi commun protocol dissemin inform knowledg support infrastructur agent oper figur show creation agent environ gener execut java virtual machin node hardwar system messag pass agent depict relationship underli commun system shown creation physic commun transpar java rmi corba figur oper environ relat underli commun infrastructur agent messag pass agent network node run java virtual machin agent corba tina distribut process environ actual messag pass physic network agent agent import choic agent environ difficult make mean differ obtain gain adopt agent approach chosen platform integr agent support environ current telecommun term system level architectur interfac current telecommun manag environ base intern intellig network telecommun manag network infrastructur step stone tradit hardwir manag implement depend servic flexibl restrict framework manag control transpar environ advantag fundament conceiv control approach reli basic form paradigm acknowledg manag control aspect commun logic distinguish led commonli network manag architectur telecommun manag network standard describ standard compon manag network base note larg part function resid manag node node arrang hierarch avoid bottleneck situat main point hierarch function essenc consist function layer busi servic manag network manag platform common infrastructur enabl manag commun facilit develop common build block gener facil del identifi potenti impact mobil agent concept induc evolut concept flexibl servic choic run time similarli al chosen intellig agent approach enhanc flexibl servic end subscrib obtain rizzo al defin level agent user agent concern negoti servic request subscrib log prefer polici call agent model encompass abil support mobil user user coupl specif end user defin layer agent repres equip telephon subscrib obtain capabl equip support receiv video messag normal telephon advent telecommun architectur approach commun industri object orient viewpoint possibl agent orient futur potenti parti develop advanc commun servic inform network architectur collabor project defin telecommun architectur base object orient common interfac distribut process environ gener underli heterogen network element common interfac parti develop adher object tina provid architectur base distribut comput technolog enabl telecommun network support rapid flexibl introduct servic abil manag servic network infrastructur integr tina refer tina servic construct softwar compon develop applic provid distribut process possibl base emerg omg corba technolog enhanc al mobil softwar agent part concept agent oper intellig middlewar level pertin candid extend paradigm mobil agent intellig agent standard emerg project servic provid abil creat servic interfac common distribut process environ activ network paradigm build modern network architectur base capabl centr router switch insid node abil appli process packet flow idea activ network compar mobil agent packet flow network view small program execut router comput distinct note classif mobil agent read paper classifi mobil code mobil small packet execut abil mobil agent retain persist state execut point agent econom theori telecommun manag mullen wellman price system constitut class mechan alloc resourc distribut exploit econom abil produc alloc minim wide research concept applic agent base control telecommun due fact base larg econom literatur theori applic real world idea fulli exploit telecommun network inher distribut lend econom model individu agent awar local state inform awar fit applic domain negoti present telecom network manag interest agent work achiev goal explicitli goal system mean owner agent market inform confidenti author system agent approach alloc servic environ negoti techniqu econom theori gener involv simpl bid mechan base extens contract net protocol section fipa specif defin interact protocol base principl market oper mechan doubl auction main problem encount adopt auction mechan virtual institut program incorpor fair bid import inform secur isol compet agent agent compet servic problem decid bundl commod strategi produc consum agent agent technolog commun overview problem encount gener econom util theori paper descript underli econom theori agent context descript system call approach discuss briefli paper market orient approach manag network kuwabara defin case studi measur effect commun delai dissemin price inform seller buyer mechan reduc oscil effect agent commun delai kuwabara work discuss fulli part mechan analog simpl bid mechan achiev load balanc traffic virtual rout network resourc alloc research metric base sole variabl cost resourc cost bandwidth network high method gener map directli relat traffic throughput chosen qo provis surviv object function guid resourc alloc strateg level demazeau point import surviv system state function make extern observ attribut function altern point view function meaningless concept system interpret promot concept unlik approach kuwabara defin price function price bandwidth assum global price compact good commun requir low illustr approach simplifi network flow problem determin cell meet demand requir sourc node destin node capac constraint link imagin bui agent dedic bui bandwidth pair link agent sell bandwidth link agent bid bandwidth link network bid bandwidth link user price function price bandwidth link demand curv agent bid resourc estim current flow network set price link link sourc destin cheapest link interest bid link set price link link sourc destin cheapest link interest set price link infin link sourc destin cheapest find cheapest altern upper bound price paid bandwidth link link sourc cheapest link bui resourc quantiti bid depend sourc destin demand link capac constraint ideal sourc destin pair meet entir demand link link cheapest path link receiv suppli demand curv interest sourc destin pair link link find clear price demand link balanc set price clear price system binari search point demand suppli sourc destin pair agent demand alloc clear price demand agent price link sourc destin cheapest path price clear adjust depend excess demand suppli excess demand approach price converg price competit equilibrium wellman argu whilst approach exist algorithm distribut market framework offer approach extens strict scope worthwhil repeat observ current statu market orient methodolog advantag framework specul rel flexibl applic program paradigm ultim demonstr part softwar agent commun system section review work carri research current project softwar agent approach commun manag author place research categori base type agent categori includ ma mobil ant base framework econom approach author conclud summari point futur direct compel domain note meant complet survei system approach cooper problem solv network manag describ idea coupl distribut expert system provid tightli coupl distribut custom control system reprint paper found book edit paper author metaphor expert system perceiv creation suitabl kitchen perspect idea cook architect gener suitabl plan individu requir converg kitchen design meet requir paper continu scenario network traffic control dynam reconfigur expert system agent state requir real world telecommun network manag model close coupl dissimilar agent earlier work domain level heterogen agent action due agent situat domain earlier work conclud case agent lead disadvantag domain telecommun lead complex commun reason agent limit complex suggest agent possess sort common knowledg level action effect goal intent knowledg hybrid hybrid consist layer agent system architectur hybrid architectur adopt hierarchi autonom control conduct network control base local make capabl hybrid adopt main control hierarchi autonom manag aim provid scalabl network manag system hierarchi layer defin basi static defin region part network mean agent architectur hierarchi layer local region nation geograph area layer region network layer oper number term author conduct normal oper manag model perform secur function figur adapt global region local author network resourc somer describ act intellig agent speak kqml author manag set resourc root author hierarchi ultim owner deleg direct manag resourc lower level process definit hybrid author made multipl agent dedic task network manag system author run top atm configur manag function set connect abil gener fault alarm author singl agent control conduct task rout messag author negoti virtu iter messag interact place commun negoti process hybrid negoti resolv problem occur system hybrid author negoti resourc avail author network potenti larg number author implement negoti agent technolog commun overview resourc reduc probabl author proxi agent updat inform negoti occur singl author techniqu lead redund control conduct base date inform somer descript intern architectur agent base agent inherit basic agent support slightli modifi set kqml perform agent inherit class oo capabl depend oper world environ intend function function rang simpl script provid reactiv rule agent reason agent author hybrid built number agent adopt layer agent main differ agent control dynam persist logic group conduct action static region network agent control logic entiti logic entiti agent repres termin agent manag system possibl complex complex relat logic configur network static physic configur manag deleg manag deleg establish distribut concept technolog incorpor idea intellig agent goldszmidt paper describ featur emphasi relationship intellig agent paradigm network manag architectur consist incorpor agent dai network node network suffici comput power fact todai node network power comput system run distribut script process enabl network manag system consist oper individu node receiv task term deleg meyer al state highest level paradigm snmp paradigm network manag system commun agent definit shift concern deleg high level goal obtain snmp approach deleg script simpl manag messag effici term bandwidth idea distinguish network manag paradigm abil support full distribut control node agent node run program elast process elast agent control function absorb form script newli absorb script function invok process requir function servic gener make invoc similar concept mobil note main idea dynam download script mobil code state servic manag earliest research focu attent appli agent technolog telecommun problem paper consid link bandwidth alloc dynam rout pai attent requir end user specif defin task network manag agent carri defin realist scenario futur type mix fix mobil network describ requir provis intellig servic manag system seek bridg gap main servic deliveri platform inevit futur taxonomi type agent requir fulfil futur servic manag system classif includ main learn negoti agent negoti agent type main concern paper negoti agent defin break tradit softwar model command base control natur metaphor make control manag process agent perform cost negoti agent bui sell resourc agent commun servic network problem domain servic custom domain specif task perform similar techniqu assign role individu player paper paper develop agent network architectur consist singl flat layer flat term hierarchi control agent interest scenario agent architectur appli mix fix broadband mobil type network custom agent point call request servic network ca attempt configur servic servic agent similar process propag role specif agent subsum trade begin contract net section exchang intern servic agent state work requir mechan agent make intellig inform provid negoti strategi requir investig conflict resolut enabl agent flexibl behaviour final point mention paid attent mechan grace degrad case agent failur describ bid mechan agent failur condit mechan achiev system cost reduc perform appli control approach manag atm network system level manag architectur architectur atm refer model develop agent control architectur implement java main contribut address integr distribut reactiv control agent plan higher level compet factor dynam bandwidth alloc research chosen applic subsum proprietari control system proprietari control system function intend fashion build system provid intellig control part gather inform oper network node inform process give global view network manag system improv probabl deal unexpect event figur depict interact occur heterogen agent control avoid network congest maintain surviv network infrastructur discuss import surviv process physic dimens commun network basi arrow figur show relationship system level inspir subsumpt architectur layer agent cooper basi inform network state isol welldefin layer reduc messag pass overhead broadcast messag situat network failur state stress sustain robust detail oper conduct agent found similarli made case subsumpt architectur concept telecommun manag context charg agent upc resourc agent connect admiss resourc agent facil agent tactic surviv tactic surviv agent agent agent figur architectur strateg layer connect qo agent plan layer flow control agent reactiv control layer proprietari control system plan algorithm balanc flow rout topolog develop base surviv network import surviv plan level ensur network time react unexpect event reactiv agent constrain surviv guid normal oper concern agent technolog commun overview manag guid flow surviv function experi minimum residu capac rout consist multipl layer layer defin conduct control network infrastructur level compet adopt logic layer multiag control system fit requir broadband network inher intellig move intellig switch robust immun project immun manag multimedia project focuss integr vertic concept long term aspect network manag project firstli problem section base plan resourc alloc lower layer implement control polici describ work conduct algorithm simplifi network manag hierarch rout strategi island describ agent suitabl share inform resourc scenario import differ immun hybrid higher level agent arbitr unresolv disput peer hybrid agent static region network block island approach abstract summari resourc avail region network base sole oper state network amount residu capac link abstract highli dynam chang instant falt mention abstract techniqu allevi agent enter agent relev import inform make note gener continu updat logic state network lead larg amount control messag flow network mechan implement matter problem agent commun negoti occur dedic commun media fact marin act commun technolog set project agent base call climat climat consist defin connect inform project project focuss applic ma technolog telecommun control impact european fund project implement softwar agent technolog expert atm long term object project demonstr agent base control act constraint tradit connect admiss procedur show agent technolog provid holist flexibl control method research address problem commun knowledg resourc network connect admiss longer sole make base wider pictur impact concept architectur extend scenario incorpor environ perform impact system evalu realist base provid scenario final stage project fulli distribut demonstr object develop ma inform brokerag commit exist java base agent platform inform project found fact agent commun technolog project interact differ implement agent technolog structur applic servic resourc reserv electron commerc goal valid work fipa standard construct demonstr system marin focuss intellig agent load balanc control overload protect agent base fipa standard examin perform gener issu fipa messag constrain environ pitt consid implement issu encount build fulli distribut control method distribut clock conflict resolut marin consid issu surround market base control strategi section discuss market base control support develop provis public telecommun network servic scienc research field inform commun technolog gener framework consist group project main area strateg telecommun servic network enabl technolog number interest project interest telecommun integr futur mobil agent applic servic network interest agent telecommun commun project pai attent problem highli multimedia mobil servic concept effect network servic manag omg tina architectur provid start point interest platform support project modular approach control manag main object project assess matur implic mobil applic servic network manag inform found mobil agent approach mobil agent rout select describ applic mobil agent congest control circuit switch environ fund british telecom lab demonstr feasibl practic agent autonom manag network argu distribut network fix messag pass control entiti lead complex strategi view singl system make case adopt mobil agent state lead robust program intuit write final softwar requir direct process work appli larg number homogen agent control rout problem simul uk node synchron digit hierarchi network fact type agent level control reason approach benefit term control robust type agent mobil agent mobil kind control author requir robust control present larg number agent control network dynam popul number alter dynam network state kind agent describ load agent provid lowest level control parent agent load agent distribut commun traffic evenli circuit parent task manag popul dynam load agent parent agent possess abil mobil load agent detect node high state mobil load agent measur amount traffic throughput singl network idea load agent sourc node move network make measur load agent oper backward node seek manner destin node sourc gener knowledg network node state behaviour achiev distribut implement shortest path algorithm load agent gener rout rout lowest total node mobil load agent obtain network object research disadvantag involv method node search cyclic rout gener schoonderwoerd cooper mobil agent map network kramer mae kramer mae mobil agent discov inform network connect agent build map link node configur dynam rout made scenario node transceiv distribut space typic type scenario rout problem solv collect data network connect store argu case tradit solut difficult network effici fulli distribut mobil agent control approach agent technolog commun overview agent step control consist learn edg execut learn node inform agent oper learn choic node main object research test strategi strategi control mechan agent adjac node time event strategi sophist strategi adjac node visit visit recent agent mechan base choic inform learn agent final base choic node visit inform learn peer agent system experi conduct network run agent obtain complet inform node network time reach state perform measur mobil agent movement strategi experi vari number agent result obtain experi show agent pass network topolog inform map network configur time limit interest result number agent system lead improv topolog map intuit perform low popul size experi show higher popul size agent agent perform agent reason behaviour chang agent tend cluster node share longer amount time reach state agent share similar path set similar path evenli network java base applet nelson web site applet log data actual experi conduct applet show movement mobil agent network topolog link inform dynam agent carri cooper agent system magenta magenta agent environ distribut framework describ environ execut mobil agent consist static program capabl receiv save agent ibm lieu uniqu identifi agent hop lieu lieu interact system agent execut lieu agent carri permit agent carri system resourc permit check verifi magenta incorpor fault toler mechan mechan support mobil comput author describ agent base network manag term network manag system mobil agent technolog implement network manag function author compar mobil agent technolog quantit context comparison term time bandwidth usag stand mobil agent architectur project develop mobil agent approach enhanc extend develop made environ object project develop gener architectur aid futur commun system benefit mobil agent technolog inject telecommun respect servic scalabl problem inher intellig network intellig mobil agent provis telecommun servic question applic domain tradit rpc mechan adequ develop mobil agent architectur consid remot program remot procedur call potenti complementari mutual technolog belief technolog enabl telecommun servic provid instantli directli locat intellig enabl miami act miami intellig agent manag inform creation uniform mobil intellig agent framework object augment result select act project integr mobil intellig agent base solut miami primarili omg masif subset fipa acl valid result consid ant base approach ant base telecommun control introduct mobil agent technolog provid section paper slightli inspir mobil agent conduct hewlett packard centr abil move softwar code node adopt ant base multipl simpl homogen softwar code randomli roam physic network configur behaviour ant coloni complex activ forag nest build fascin research anim behaviour model explain capabl algorithm inspir behaviour real ant coloni appli solv type problem approach distribut coloni ant coloni appli successfulli larg number combinatori travel salesman rout telecommun cluster sort problem classif ant simpl mobil agent system justifi hp work directli involv carri control presenc indirectli influenc control network rout strategi schoonderwoerd al ant analog control rout path find network stigmergi idea agent oper environ memori store type rout consid work rout rout node rout inform nearest neighbour node rout tabl basic form consist tabl node identifi prioriti rout inform sourc check node consist design destin node node destin inform pass chosen node process continu destin node reach research consid simul ant randomli roam network lai trail node amount pheromon deposit depend amount time ant delai node directli depend node total capac occupi exist ant amount pheromon deposit amount pheromon prioriti rout ant follow rout higher level pheromon path path high level pheromon congest congest node delai ant prevent ant deposit greater amount pheromon schoonderwoerd al extend work pai attent elimin unnecessarili long rout prevent cyclic rout problem overcom sum squar node actual node back sourc node problem overcom make ant updat rout direct sourc node limit number ant updat node rout elimin inconsist econom approach autom auction atm bandwidth al miller al system alloc bandwidth qualiti alloc video conferenc situat system comput base softwar system encapsul market base mechan econom theori basic system auction run video server server alloc bandwidth resourc base bid price auction receiv client end system run softwar end user interact user input requir video qo paramet price pai level servic bid receiv auction resourc alloc bandwidth auction bandwidth segreg ensur fair prevent auction direct access alloc resourc agent technolog commun overview distribut resourc alloc al case studi demonstr appli market base model distribut resourc alloc commun network control kuwabara describ approach market base system approach agent make util market base analog classifi agent superfici discuss descript work case studi investig determin made resourc request price case studi investig effect commun delai dissemin price inform seller agent bui agent case studi formul bandwidth manag problem resourc alloc problem defin metric bandwidth global object function measur variabl resourc object function spread resourc network solut problem ignor capac fact object function spread load resourc rout applic cite paper interpret wai depend path sourc destin link node approach consid paper rang make small increment flow path make maximum increment simul larger step rate oscil solut variabl agent price function chosen kuwabara intuit reason converg global optim resourc alloc simul market price function reflect notion common price gener question price function chosen applic distribut resourc alloc problem formul modif convent approach deriv global comput direct steepest price function correspond gradient function object function select kuwabara deriv global criterion monoton function price function true price function chosen similar kind formul jen agent kuwabara al jen arguabl agent issu distribut approach appli deal servic determin bandwidth price exchang servic durat servic contract network relationship network model applic market base manag telecommun network jen jen adopt market base control approach alloc connect network intellig agent alloc resourc broadband environ highlight main benefit gener ma bring distribut dynam domain state atm network high speed natur case manag data date extrem rapidli overcom fundament problem encount high speed network suggest econom theori coupl network dynam control activ develop idea provid detail descript market base control lead high network market base strategi achiev perform experi basic fix rout method extens jen work incorpor provid scenario paper provid introduct research literatur softwar agent telecommun system briefli differ classif softwar includ mobil agent stationari intellig agent part paper percept agent technolog benefit approach exist technolog section consid problem found commun industri import point note research literatur address issu agent granular intim relationship chosen ma intern agent architectur insight depend evid agent intern architectur pai attent suit make local control intern architectur support requir gener control action time interv similarli adopt delib intern agent architectur logic slow time scale plan import requir reactiv element behaviour plan behaviour adopt ma type agent author approach balanc plan messag propag delai reaction polici gener plan compon section mean unexpect occurr handl local inform strateg level ass situat note reactiv behaviour fix made adapt previou event reactiv model build case base constraint neural network learn input trigger literatur disagr mobil agent work intellig agent approach difficult mobil agent clear applic domain achiev concept detail exampl telecommun control mobil agent advantag messag pass applic mobil agent mobil user disconnect problem situat propag delai factor messag pass network node requir excess interact geograph debat trade amount physic commun overhead differ approach gener scenario messag gener stationari agent frequent pass messag updat knowledg network stress oper creat traffic congest move singl softwar process control point begin control execut conclud adopt approach telecommun manag control larg depend abil design develop flexibl meet futur network requir care requir manag agent research necessarili address date stage agent technolog telecommun system requir research depend enabl technolog ai importantli guidelin suitabl toolkit construct agent base system point highlight paper major secur issu involv place agent commun respect mobil agent paradigm fear surround introduct agent technolog telecommun system amelior field progress act agent concept gain accept acknowledg author bt lab epsrc partli fund work author peopl provid comment earli version includ shaw nick michael wooldridg simon parson mari network manag research group bt lab michael cox rob encourag write paper nelson minar comment mobil agent section specif ndumu provid addit inform interest research refer author anonym review provid comment origin version paper refer transfer mode bt technolog journal vol pp agent telecommun lectur note artifici intellig intern juli publish isbn agent technolog commun overview intellig agent telecommun applic frontier artifici intellig applic io press mobil phone network model solut ieee commun vol softwar agent control telecommun bt technolog april chapter softwar agent futur commun system isbn qo base rout fourth commun network juli languag describ intern confer system san june pp surviv bid intern confer system juli publish ieee isbn commun prentic hall seri isbn distribut artifici morgan kaufman mit isbn robust layer control system mobil ieee journal robot autom march vol intellig agent servic manag commun uk intellig agent servic manag commun network iee uk intellig agent solut manag complex august held ecai hungari distribut artifici intellig artifici intellig vol multimedia network journal network system vol paradigm distribut resourc world action artifici mit press isbn chapter pp applic intellig mobil agent manag softwar problem intellig agent telecommun applic lnai isbn publish springer verlag pp broadband telecommun iee telecommun seri isbn davison manag public atm network scaleabl flexibl intern symposium integr network manag agent paradigm network bt technolog vol telecommun comput network model integr servic ieee vol decemb note problem connect graph numer mathemat pp system architectur scalabl manag high perform appli arm length autonomi chapter softwar agent futur commun system isbn agent network ai network manag system iee digest frei falt dynam hierarchi intellig agent network juli publish springer verlag code ieee transact softwar engin vol congest control scheme atm ieee commun vol integr intellig manag intellig network conceptu comput network isdn jen base system atm network proc commun network uk resourc alloc rout telecommun intellig agent telecommun applic lnai lnai edit isbn publish springer verlag pp heterogen ieee commun vol manag intern confer distribut comput system ieee comput june agent network ieee commun vol technic report triniti dublin intellig mobil emerg technolog gener telecommun fifteenth uk symposium perform engin inform march van uk negoti protocol telecommun servic provis base negoti agent approach featur interact interact telecommun io comput network open isbn agent atm perform mobil good atm resourc autom distribut agent proc iee fourth network commun juli rout manag atm network distribut softwar agent fifteenth uk symposium perform engin inform march van uk architectur atm virtual path network resourc intellig agent telecommun applic lnai edit isbn publish springer verlag pp control system ecai august uk agent futur commun publish springer verlag isbn control scheme commun delai unix nt pp morgan kaufman isbn agent telecommun workshop hungari architectur techniqu distribut artifici distribut artifici wilei applic isbn agent technolog commun overview target mobil ieee internet juli approach distribut resourc alloc applic commun network base paradigm distribut resourc world chapter semant agent commun read morgan pp intellig network st chapter intellig ai approach telecommun io intellig ai approach telecommun network io framework distribut system journal network system vol pp emerg technolog gener infocom march san usa servic provis intellig hungari control intellig network integr network manag chapman ed sethi al pp isbn autom auction atm network paradigm distribut resourc world chapter mobil agent map proc hungarian nation confer agent base ieee spectrum vol april simpl comput market network inform proc intern confer system san june design intellig layer note ai volum isbn applic intellig knowledg engin pp cambridg press knowledg engin review softwar agent bt technolog journal volum number octob softwar chang futur commun seminar seri chapter softwar agent futur commun system isbn agent soft enhanc machin isbn experi omega ieee journal select area septemb distribut artifici wilei network servic manag tina ieee commun vol middlewar telecommun network servic ai network manag system iee digest initi specif system load control overload protect strategi marin atm design john wilei son isbn adapt choic messag protocol multi agent foundat system uk decemb signal system open telecommun paam central uk st april theori intern confer system san pp model provis advanc telecommun telecommun inform network architectur februari pp electron auction paam central uk st april modern prentic isbn agent enabl mobil user awar intern confer autonom agent agent mn autom contract manufactur perform distribut advanc system pp juli autom negoti electron extend contract net intern confer system san pp level commit contract thirteenth nation confer artifici intellig pp ip atm posit expert wp agent load balanc telecommun intern confer autonom agent act essai philosophi cambridg uk isdn happen spell ieee spectrum januari rout base activ pattern basi integr distribut inform agent paam central uk contract net commun control distribut problem read distribut artifici intellig morgan kaufman cooper distribut problem ieee transact system man vol pp distribut artifici morgan kaufman intellig agent distribut atm network workshop infrastructur network ieee commun vol march white paper sun comput white paper obtain survei activ network ieee commun januari architectur april real problem type mobil rout support multimedia ieee journal select area septemb distribut problem solv commun network comput novemb agent technolog commun overview ai system intellig ai approach telecommun network io chapter pp program environ applic distribut flow journal artifici intellig research mit isbn chapter theori knowledg engin review vol intern confer autonom agent agent mn semant agent commun intern confer system juli publish ieee isbn approach alloc qo multimedia intern confer system issu qo intern confer system juli pp publish ieee isbn resourc locat network mobil fipa kqml act impact ibm aglet nelson minar web web omg agent applic servic network manag project gener magic corp program mobil agent java java aglet api danni lang mitsuru ibm research climat act cluster network system marin project
Agents/1233 1 intern workshop softwar engin determin softwar engin paradigm scott scott deloach depart electr comput air forc institut technolog air forc ohio depart comput inform kansa state nichol ks abstract emerg softwar engin softwar engin conceptu complex distribut softwar requir determin softwar engin set defin criteria requir describ approach determin techniqu assist softwar engin select softwar engin methodolog base criteria introduct softwar engin number option develop solut distribut softwar requir emerg techniqu develop multiag system number reason softwar develop multiag system multiag system provid benefit process reduc commun reliabl academ determin problem call multiag approach design made multiag number methodolog exist build multiag system methodolog rang extens exist methodolog offer perspect develop multiag system level abstract develop analyz design system softwar engin techniqu softwar engin select approach suit problem solv research air forc institut technolog provid softwar engin manag framework determin methodolog face set viabl softwar engin methodolog altern paper method appli develop framework primari challeng develop framework select valid set criteria base remaind section address approach determin approach techniqu classifi softwar engin methodolog section describ process defin criteria framework section describ survei conduct novemb decemb valid criteria section discuss result survei section context appli criteria framework section present relat techniqu strategi jen wooldridg provid valid techniqu qualit analysi techniqu address principl softwar engin techniqu deal complex problem hierarchi leav situat agent solut outstand issu european institut research strateg studi telecommun strategi began project explor agent technolog european telecommun industri object guidanc identif applic area approach suit consortium produc guidelin develop decid approach approach benefici situat type commun requir approach benefici system perform situat behavior basi approach benefici situat involv cooper competit entiti approach benefici system act autonom approach benefici anticip system modifi system expect chang guidelin good begin determin agentori approach suit problem base guidelin clear answer softwar engin methodolog classif softwar engin institut present set guidelin assess softwar develop method system guidelin defin process evalu methodolog step analysi determin import characterist system develop individu method develop deal characterist constraint identif identifi constraint permit solut determin individu method develop deal constraint user requir determin gener usag characterist individu method manag issu determin support provid method manag develop process cost benefit adopt method introduct plan develop understand issu method address plan augment method area defici base consortium develop question analyz prospect methodolog question meant requir knowledg methodolog question make assessor form opinion process problem select methodolog question provid framework present systemat evalu process base assess process exist work classifi softwar includ major area sei process involv determin method method issu method address area technic characterist manag characterist usag characterist technic characterist classifi technic characterist softwar develop stage develop characterist softwar problem dealt relat behavior function view problem view carri stage system develop design behavior function view map behavior function characterist function effect method smooth transit stage abil trace function behavior characterist stage develop set import support method manag evalu method method deal typic manag project issu plan review method relat process exist organ manag practic difficult thing chang identifi potenti import factor adopt methodolog usag captur describ characterist methodolog affect organ characterist includ basi avail avail tool support import understand magnitud chang involv select methodolog defin criteria challeng select methodolog softwar develop project understand differ methodolog abil classifi methodolog crucial understand characterist develop set criteria develop framework defin combin manag usag characterist call manag issu technic characterist methodolog captur program requir categori categori discuss detail manag issu categori close relat manag usag characterist defin issu address pertain categori manag usag issu select softwar develop method realtim system practic type system initi set issu select categori cost acquir methodolog cost acquir support tool avail reusabl compon effect organiz busi practic complianc standard traceabl issu deal cost involv select methodolog cost acquir methodolog involv cost adopt methodolog factor influenc issu includ cost incur send personnel refer cost acquir support tool deal cost incur tool support methodolog tool includ case tool program develop tool cost factor addit oper mainten cost includ issu indirectli deal cost avail reusabl compon incorpor develop softwar system reduc test phase softwar develop categori measur abil incorpor predefin compon system final issu reflect usag issu effect organiz busi practic measur impact adopt methodolog exist busi practic organ busi practic includ idea track develop progress custom interact complianc standard determin altern meet local organ organ nation intern issu traceabl measur support trace develop lifecycl project requir categori project relat technic characterist criteria system directli relev order deriv set turn current research identifi number technic issu relat complex softwar system issu select legaci system integr distribut environ dynam system structur interact scalabl agil robust issu categori relat constraint problem legaci system integr measur abil support incorpor develop commonli call legaci project requir distribut abil support model distribut aspect problem distribut occur form inform environ measur support develop softwar system environ heterogen hardwar softwar issu categori dynam system agil robust dynam system structur repres abil develop softwar capabl handl introduct remov system compon manner detriment user system consid categori similar dynam system measur abil develop softwar capabl handl introduct remov resourc minim impact user agil robust abil creat flexibl softwar system resili dynam environ final issu project requir categori interact categori determin abil handl interact compon entiti system human user system survei select criteria base number literatur sourc compil list present softwar engin govern survei questionnair internet valid survei collect opinion softwar engin regard import evalu order survei announc distribut softwar engin electron mail list maintain object manag group maryland agent softwar engin research network calgari addit broadcast announc request particip moder request directli number respect industri leader survei analysi period collect set week valid collect survei began basic demograph question order develop profil respond peopl academ respond govern sector year experi field respond categor year respond year experi survei collect opinion respond import evalu thought suggest rel weight manag technic addit factor criteria respond rate scale respond leav set score factor receiv respond believ technic issu import manag issu fig show averag score receiv respond felt emphasi technic issu versu manag issu rate averag rate manag issu technic issu meth tool org stan chan leg di env str int sca evalu fig averag rate evalu survei base weight evalu rel categori determin weight rel major determin weight rel respond provid opinion total weight major issu trend fig fourteen respond felt technic issu influenc manag issu respond felt manag issu weigh respond set issu equal weight remain respond partit tabl show data gather question survei pose import factor altern suggest cost categori respond factor problem cost product benefit great mitig impact initi cost manag factor suggest tool experi evalu matur methodolog area includ avail tool experi base methodolog suggest technic issu submit base research survei made list evalu similar dynam system structur combin form singl organiz busi complianc traceabl cost acquir methodolog cost acquir support tool methodolog matur ad list order captur aspect final list issu manag issu cost acquir methodolog tool organiz busi practic avail reusabl compon methodolog matur project requir legaci system integr distribut environ dynam structur scalabl agil robust interact tabl partit weight manag technic issu number issu partit applic criteria research includ develop process built analysi framework section describ criteria incorpor select strateg techniqu strateg techniqu select problem methodolog select multiobject analysi multiobject analysi select underli framework abil handl multipl base mathemat flexibl matur techniqu analysi tool step base multiobject analysi develop hierarchi hierarchi structur captur evalu evalu measur relev evalu criteria account evalu altern object prefer movement respect evalu evalu measur scale measur attain object methodolog select section map directli evalu hierarchi shown fig object evalu except cost acquir methodolog maxim rate abil repres issu cost acquir methodolog object minim real dollar cost involv acquir methodolog support tool order measur evalu set question develop question develop select methodolog develop question design measur abil repres relev issu unlik system question rate question scale order captur seri creat collect provid guidelin rate question guidelin provid standard evalu set subject question multiobject analysi techniqu normal score repres fit altern regard problem call multiobject fit addit combin product rate evalu equat multiobject fit function analysi tool int weight captur level import place evalu weight make techniqu flexibl weight evalu import set effect evalu applic analysi tool process make captur analysi tool tool encapsul data gather step algebra calcul defin good softwar engin method organ reduc develop cost produc qualiti manag issu project requir cost acquir methodolog tool support compon methodolog matur organiz busi practic integr distribut environ dynam structur scalabl interact agil robust fig methodolog select hierarchi weight evalu rate relev evalu calcul multiobject fit determin altern weight evalu involv determin evalu import softwar requir problem select methodolog determin relev determin raw weight base rel import regard import evalu raw weight normal analysi case studi evalu base system requir content search system content search system distribut softwar applic user system search data file network kei word phrase base evalu fig categori analysi made relev shown cost acquir methodolog support tool relev approach problem softwar engin part organ adopt methodolog support tool organiz busi practic relev softwar engin engin provid project updat interest parti depart methodolog matur relev chang methodolog requir evid produc qualiti softwar integr reusabl compon irrelev librari reusabl compon softwar engin legaci system integr irrelev system requir incorpor exist softwar system distribut relev user system requir access node network data user requir store hard drive network environ relev environ network mixtur sun workstat run solari os person comput run window nt agil robust relev user system expect predict reliabl dynam structur scalabl relev organ grow hardwar system link softwar system access data storag interact relev system provid interfac user submit request determin relev evalu decisionmak specifi weight raw weight base level import evalu rel import weight normal weight calcul case result rel weight normal shown tabl detail calcul found rate relev evalu methodolog consid evalu consid relev step rate answer respect set question develop research respect altern tabl content search weight summari rank evalu rel weight normal weight cost di env int ar dss mat org research evalu softwar engin methodolog develop booch softwar engin call multiag system engin develop air forc institut technolog altern develop solut content search problem document rate found relev evalu function rate base input user tabl summar rate evalu respect methodolog evalu tabl content search rate summari fit mase fit booch cost di env int ar dss mat org rate set inform calcul multiobject fit valu equat weight rate combin form singl fit altern case evalu determin term drop enter calcul shown mase altern summari multiobject fit valu shown tabl tabl content search summari case studi mase booch content search system multiobject fit valu quantifi base analysi tool recommend mase booch case result number techniqu evalu sensit base weight assign step sensit analysi factor determin multiobject weight assign evalu score altern receiv evalu rate focu point rate base experi assum accur weight defin strictli perceiv import evalu accuraci subject sensit analysi give assessor feel definit perform sensit weight evalu focu analysi area slight chang evalu weight significantli chang fit score data analyz tool develop work output analysi full sensit analysi perform weight evalu analysi sensit regard origin normal weight evalu fit methodolog rang weight methodolog case calcul entir rang ensur total normal weight remain adjust proport total weight minu weight analyz final sensit small chang weight chang produc chang final recommend definit percentag sensit detect sensit reli identif critic point critic point weight analysi prefer sensit analysi chart methodolog matur case studi shown fig analysi chart annot highlight critic point figur critic point weight methodolog matur weight rang mase methodolog highest multiobject fit critic weight methodolog rate begin rate higher booch methodolog critic booch methodolog intersect set weight methodolog matur factor account fig methodolog matur sensit analysi chart mase booch critic point origin weight case studi shown tabl critic enter critic point amount chang weight alter final note equal highlight bold font evalu tabl case studi weight critic point summari mase booch critic point mase critic point booch critic point origin weight chang cost org di env ar dss int mat case studi sensit criteria make answer produc analysi recommend sensit analysi weight prefer slightli booch methodolog easili win methodolog satisfi valid analysi tool demonstr number softwar requir challeng valid tool return made base subject criteria softwar requir content search develop rate booch develop set metric collect metric collect product develop includ labor hour spent develop analysi design model size program measur line code number complex develop code time spent analyz design system time spent implement size code roughli larg code data collect shown tabl tabl content search develop metric metric mase approach booch approach model effort analysi labor hour labor hour model effort design labor hour labor hour model effort implement labor hour labor hour size size class complex ratio hour hour addit collect questionnair distribut class softwar engin graduat student questionnair determin detail requir identifi analysi design model respect methodolog student review analysi design model score higher review correspond analysi determin methodolog requir set question respond answer familiar methodolog evalu student review booch model familiar develop system methodolog past ten student familiar mase student methodolog system develop result expect mase recent defin agentori methodolog booch methodolog matur identifi methodolog student function decomposit ad hoc method develop softwar question gener question confid understood model rate confid scale indic greatest confid understand system understand rate student evalu mase methodolog rate student evalu booch methodolog student review booch methodolog identifi correct statement descript system ten student review mase methodolog select correct student select correct answer set question number detail includ identif legaci reusabl network interfac issu student review booch methodolog divid equal regard identifi legaci system legaci system incorpor system legaci system possibl convent reason student legaci system set mase model determin network environ intent question identifi configur network system design import inform commun develop question measur abil discov environ inform group evalu mase complet identifi hardwar softwar system compon model regard user group identifi input output system option base score includ question questionnair averag score mase group booch group result student familiar experienc respect averag score mase group booch group student point posit neg approach result experi consist result produc analysi tool reason softwar engin methodolog develop high qualiti softwar product cost face challeng creat high cost methodolog fit problem challeng decid method challeng greater methodolog develop specif address develop multiag system softwar engin problem level abstract solut classifi softwar engin methodolog quantit base softwar requir hand challeng develop set criteria repres problem space gener problem develop set criteria current softwar engin literatur ensur invit member softwar engin commun particip survei base result adjust criteria includ addit factor miss remov criteria commun find import method user abil determin methodolog problem outstand question multiag system challeng exist larg bodi evid support multiag system superior tradit system research develop multiag system inevit creat larger bodi data compar tradit system acknowledg work perform author air forc institut technolog support air forc offic scientif research view express articl author reflect offici polici posit unit state air depart govern refer analysi design applic publish redwood ca analysi design volum model earli requir transform base approach volum agent orient analysi volum multiag system engin intl softwar engin knowledg engin classif scheme softwar develop method softwar engin institut technic report softwar engin pa survei methodolog intellig agent intern workshop agent languag lectur note artifici vol berlin heidelberg york softwar engin handbook agent technolog press strateg multiobject analysi spreadsheet wadsworth california cooper multiag person view state art ieee tran knowledg data engin methodolog engin system softwar agent initi methodolog particip project select softwar engin methodolog multiobject school engin air forc institut technolog afb compar perform static versu mobil multiag system nation aerospac electron confer ieee societi infrastructur analysi design base system softwar intern lectur note artifici vol berlin heidelberg model approach agent base system design softwar intern lectur note artifici vol berlin heidelberg system intellig survei intl knowledg inform system guid assess softwar develop method softwar engin institut technic report softwar engin pa intellig agent gerhard weiss multiag modern approach distribut artifici intellig mit massachusett formal specif languag ma engin volum
AI/1234 2 identifi distinct subsequ multivari time seri cluster tim oat comput scienc box ma abstract time seri comparison algorithm attempt discov member set time seri common investig determin distinguish time seri set time seri obtain sourc case goal identifi share case pattern distinct effici algorithm identifi distinct subsequ time seri evalu data sensor mobil robot set filter human speech experi demonstr util approach problem languag acquisit empir result show learn denot word identifi word unit raw waveform continu speech view discov distinct subsequ refer time common mobil languag acquisit electron postscript introduct sequenc discret dynam program algorithm exist find longest common subsequ share rivest basic algorithm adapt wai find pattern share time seri time space complex algorithm exponenti number sequenc paper demonstr answer slightli question sequenc obtain time space approxim linear total length sequenc discuss time approach gener trivial categor sequenc determin make set sequenc interest determin make sequenc obtain sourc make distinct clear set time valu record black box airplan crash longest common subsequ algorithm find larg portion sequenc strikingli includ ascent amount time spent fly altitud pattern share time seri occur success flight pattern support diagnost predict troubl match data obtain analysi determin probabl failur call process find distinct subsequ pattern identifi manner serv distinguish time seri time seri gener sourc data sourc produc vector real number time step number sensor mobil number stock close price record creat time seri specif valu produc expect chang interv time interest distinct common time seri remaind paper term seri time seri interchang term mean multivari time seri data except convent identifi gather analysi seri obtain individu occurr event plane crash probabl pattern occur sequenc obtain sourc pattern distinct significantli occur number time seri gather goal identifi detail requir pattern repres mean pattern occur provid subsequ section work distinct subsequ motiv larger project aim robot acquir natur languag manner interact physic environ includ compet user languag debat syntax learn innat continu aspect languag acquisit involv learn problem face mobil robot attempt learn denot word robot engag interact hear utter record valu gener sensor task identifi pattern robot sensor correspond refer individu word time word robot record valu sensor window center occurr word refer word time word rel time chang utter notat develop sensori apparatu occurr pattern robot sensor correspond refer word total lack knowledg locat natur individu time seri reason assumpt word utter frequent refer present case significantli learn denot word cast term find subsequ robot sensor data method find distinct detail section step process set repres prototyp pattern sourc obtain randomli sampl subsequ length call subsequ sequenc cluster distanc metric cluster prototyp extract probabl occurr prototyp estim sampl addit event interest occur doesnt probabl significantli prototyp distinct distinct identifi distinct subsequ time seri event trigger collect time seri provid extern method complet approach part architectur learn modest time space increment children rememb repeatedli process larg corpora utter impract requir mobil robot method outlin ideal requir time space approxim linear total length sequenc present base batch implement trivial construct increment implement remaind paper organ section describ stage approach outlin section describ experi involv discoveri distinct subsequ data sensor mobil robot set filter human speech section conclud point futur work find prototyp step discoveri distinct subsequ identif set subsequ captur pattern occur data gener accomplish randomli sampl sequenc length call sourc measur similar time construct similar matrix matrix cluster select prototyp cluster find sequenc minim averag distanc sequenc cluster reason appar cluster algorithm essenti high level approach outlin al explor measur similar multivari time cluster put cluster prototyp effect partit space region space assign prototyp similar prototyp charact partit highli depend number partit fine captur subtl differ larg cluster captur meaningless differ due opposit situat prototyp stand larg class potenti qualiti cluster depend larg sampl ensur cluster fit structur data determin tempor extent prototyp qualit pattern emerg time time scale highli domain depend find measur similar time seri suitabl cluster easi time seri qualit quantit wai length case make difficult imposs emb time seri metric space euclidean distanc determin similar singl time rate progress made vari pattern evolv slowli speed begin quickli slow differ rate make similar measur measur similar dynam time warp kruskal gener classic algorithm compar discret sequenc minimum string edit distanc rivest sequenc continu valu extens speech domain time seri notori complex advent hidden markov offer unifi probabilist framework entir recognit process time find warp time dimens minim differ univari time seri shown column figur imagin time axi elast string grab string point time record time seri warp time dimens consist grab point move locat point elast string time compress direct motion expand direct middl column figur move point time step origin locat seventh time step point compress remain point left fill newli creat space complic warp time dimens column figur point move figur time leftmost warp middl rightmost warp time dimens yield time seri denot compar similar determin area curv area shown grai bottom row figur note warp singl point move result poor larg area curv fit complex warp good return optim warp minim area area warp area measur similar time seri area area symmetr version essenti comput averag area base singl warp liberman stage step process requir space store similar matrix time fill matrix construct cluster exponenti wai warp time dimens dynam program find optim warp time low order polynomi length jj case time straightforward implement comput euclidean distanc numer speedup improv properti distanc metric greatli reduc constant factor hidden insid notat identifi distinct previou section prototyp obtain sampl regard event occur distinct occur frequent presenc sampl manner ensur cluster access full rang pattern occur window width prototyp determin distinct identifi prototyp significantli estim requir set sequenc obtain set sequenc window width pass determin prototyp similar result obtain manner drawn larger sequenc similar prototyp case counter increment case hold counter increment simpl matter estim probabl determin probabl significantli random variabl depend match match prototyp random variabl oe varianc random variabl analog straightforward appli standard determin probabl make error reject null hypothesi prototyp distinct probabl distinct technic definit distinct prototyp simpli mean occurr event pattern fix length occur time seri independ depend result causal frequent cite condit causal applic languag discov depend vital import depend word context case space requir stage process modest prototyp counter retain perman process sequenc obtain sourc construct time vector produc determin counter updat time determin prototyp similar number process linear total length larger sequenc obtain sourc assum total greater number sampl creat stage requir comput linear size input variabl length distinct subsequ previou section obtain prototyp determin prototyp distinct section explain prototyp identifi distinct subsequ span time step note prototyp distinct reason ae condit hold similar prototyp frequent occur frequent presenc absenc condit hold similar prototyp infrequ match prototyp distinct neutral subsequ length greater frequent frequent neutral subsequ infrequ infrequ neutral subsequ distinct locat frequent infrequ subsequ larger time seri time linear length time seri amend definit wai frequent subsequ start end frequent infrequ consecut neutral ensur occurr frequent subsequ tempor proxim subsequ start end frequent million interven neutral deem frequent subsequ empir result section present result appli method discov distinct subsequ sourc sensor mobil robot set filter human speech goal experi learn pattern robot sensor correspond refer word goal identifi pattern raw waveform continu denot salient featur environ learn refer word applic method identifi distinct subsequ involv learn refer word embodi agent agent mobil robot pioneer pair drive wheel translat rotat gripper pick small object sensor includ arrai bumper end gripper gripper touch infrar break beam gripper object insid gripper valu varieti sensor record ten time note children learn refer word hear utter relev current physic context child plai case utter direct child make mention ball notic word frequent child learn refer word simul made videotap scene pioneer engag simpl activ lab environ includ trash toi larg box mat color floor scene robot pick cup sit blue mat carri red mat video shown human subject instruct gener sentenc scene robot restrict vocabulari grammar subject languag talk child time seri creat record valu break gripper bumper state gripper gripper move posit break beam object bumper touch prototyp pattern time seri obtain cluster sampl cover real time result prototyp shown tabl cover varieti physic realiz situat correspond situat gripper touch gripper occur robot run larg obstacl wall trash gripper break gripper prototyp state beam bumper move tabl prototyp obtain gripper time seri relat state gripper word human subject describ robot chosen relev gripper robot pick red word divid time seri set base word scene time seri subject involv push time seri involv push set distinct prototyp word identifi draw addit set ff word push pick tabl frequent infrequ prototyp word describ scene video empti cell tabl prototyp distinct word tabl show combin word prototyp prototyp frequent infrequ neutral word frequent distinct prototyp word captur aspect wai robot push small object gripper move put gripper larg object wont fit move push object size gripper close visual inspect subsequ identifi inform tabl qualit type subsequ kind push method successfulli locat portion time seri involv pick object gripper empti discov word continu speech aspect languag acquisit involv learn identif word unit raw waveform continu speech method children learn segment utter hear subsequ individu word remain great mysteri comput approach relat time seri problem learn identifi word boundari written text languag lack word pure syntact witten pont croft assum data segment sourc input manipul absenc notion mean segment discov ignor rich potenti sourc inform embodi languag learner context utter gener inform context utter learn segment speech stream word unit view identifi distinct subsequ presenc specif featur salient object serv trigger collect time seri sourc time mechan agent obtain auditori data pattern subsequ correspond word denot assumpt word utter frequent presenc refer case distinct subsequ simpl scenario agent watch static scene object shape color stand spatial scene accompani descript agent featur scene partit utter hear utter featur utter time blue object accompani utter utter place set agent appli procedur outlin section identifi occurr speech waveform word denot blue experi previou subsect assum agent identifi occurr individu word speech agent inform drive search pattern sensor experi section assum agent identifi presenc stimuli environ agent stimuli drive search pattern speech stream scenario simul randomli gener sentenc grammar shown figur sentenc read aloud digit sampl rate result signal pass bank digit filter cover frequenc averag filter record preprocess standard practic speech recognit convert digit sentenc multivari time seri compon seri object relationship object object size color shape size tini small medium larg color red purpl green blue shape circl squar triangl rectangl relationship touch figur grammar gener sentenc word identif experi fifteen prototyp obtain cluster sampl drawn time sampl span occur assum featur scene simul depend word occurr scene termin grammar divid sentenc set base termin occur distinct prototyp termin identifi addit sampl drawn set ff word tini small medium larg red purpl green blue circl squar triangl rectangl touch tabl frequent infrequ prototyp word figur mark empti cell tabl prototyp distinct word tabl show combin termin prototyp prototyp frequent infrequ neutral termin interest thing tabl prototyp distinct indic number cluster larg word share pattern distinct pattern suggest number cluster larg captur differ pattern distinguish occurr word speech stream larg differ cluster good job find cluster correspond significantli pattern speech stream test util inform present tabl scene featur select sentenc involv featur gener total maxim length frequent subsequ time seri locat time seri respect utter word denot featur hit word exact miss touch medium triangl red tabl result appli distinct prototyp tabl identifi occurr specif word speech stream determin result summar tabl maxim length frequent subsequ span utter record exact hit addit cover adjac word result hit hit occur utter cover utter result miss result touch medium good virtual hit triangl reason triangl rectangl share suffix sentenc word tri determin distinct occurr red hit exact suffici construct model hidden markov waveform word discuss futur work interest time seri problem scientif includ machin learn knowledg discoveri work direct identifi distinct subsequ time recent result address part problem al pazzani describ method measur similar continu time seri cluster identifi common subsequ approach limit univari time seri applic problem section time seri insuffici make discrimin primari goal futur work implement method identifi featur environ drive identif word speech notion distinct complet manner refer fast similar search presenc scale translat time seri intern confer larg introduct algorithm mit press rule discoveri time seri fourth intern confer knowledg discoveri data de languag acquisit phd mit statist method speech recognit mit press enhanc time seri fast accur cluster relev feedback work note workshop predict ai approach symmetr time warp continu discret time string edit theori practic sequenc comparison algorithm concept sequenc comparison time string edit theori practic sequenc comparison mathemat classif cluster kluwer academ publish identifi hierarch structur linear time algorithm journal artifici intellig research signal model techniqu speech recognit ieee languag instinct harper retarget word segment procedur inform retriev symposium document analysi inform retriev time string edit theori practic sequenc comparison probabilist theori causal north holland
IR/1235 5 document categor queri gener world wide web webac daniel maria robert kyle georg jerom moor depart comput scienc minnesota abstract present agent explor categor document world wide web base user profil heart agent categor set combin process gener queri search relat document filter result document extract close relat start set document categori priori present architectur describ algorithm provid improv tradit cluster algorithm form basi queri gener search compon agent report result experi compar algorithm tradit cluster algorithm show algorithm fast scalabl author list alphabet introduct world wide web vast resourc inform servic continu grow rapidli power search engin develop aid locat unfamiliar document subject reli larg index document locat search engin determin url document satisfi user queri queri return inconsist search document referr meet search criteria interest user feasibl extract full mean html intellig softwar agent develop extract semant featur word structur html document extract featur emploi classifi categor document cluster offer advantag priori knowledg categori categor process result cluster automat formul queri search similar document organ bookmark construct user profil present agent document categor explor oper web document part paper descript cluster algorithm base graph provid improv perform tradit cluster algorithm inform retriev tradit algorithm break size document featur high characterist type inform retriev applic filter categor hypertext document world wide web algorithm reli specif choic distanc function scale effect high space algorithm form basi queri gener engin webac gener webac search similar document web retriev document filter classifi exist cluster structur discov cluster phase short descript architectur webac section describ cluster algorithm section section report result obtain number experi method select set featur show cluster method perform tradit distanc base cluster analyz complex cluster algorithm show scalabl section show word obtain cluster document gener queri relat document web relat work heterogen lack structur inform sourc world wide web make autom manag inform difficult tradit search index tool internet world wide web alta provid comfort gener provid structur inform interpret document recent studi statist compar evalu popular search tool recent year factor prompt research develop intellig tool inform intellig web agent approach web mine involv develop sophist ai system act autonom behalf discov organ inform web mine system intellig search agent intellig web agent develop search relev inform characterist domain possibl user organ interpret discov inform agent inform manifold occam reli domain specif inform type hard code model inform sourc retriev interpret document shopbot ila attempt interact learn structur unfamiliar inform sourc shopbot retriev product inform varieti vendor site gener inform product domain learn model inform sourc translat intern concept hierarchi inform number web agent inform retriev techniqu characterist open hypertext web document automat categor semant inform link structur document content creat cluster hierarchi hypertext structur inform space bo combin hierarch cluster techniqu user interact organ collect web document base conceptu inform pattern recognit method word cluster hartigan partit cluster algorithm discov salient html document featur find similar html document web person web agent categori web agent includ obtain learn user prefer discov web inform sourc correspond possibl individu similar interest collabor recent exampl agent includ webwatch syskil syskil webert util user profil learn rate web page interest bayesian classifi balabanov singl profil find similar web document candid web page locat search system larg dictionari limit singl user webac architectur webac architectur shown figur user profil creation modul build custom profil record document interest user user option cluster modul queri gener search mechan document vector document vector cluster queri profil creation modul cluster updat filter figur webac architectur number time user visit document total amount time user spend view document method determin user interest webac record suffici number interest document reduc document vector document vector pass cluster modul webac algorithm cluster provid improv perform cluster qualiti tradit algorithm section webac found document cluster gener queri search similar document webac submit queri search mechan gather document return turn reduc document vector document varieti wai option webac cluster filter relev updat exist cluster webac insert document cluster complet document user decid add document profil queri gener method algorithm increment updat exist cluster discuss section webac implement browser independ java applic monitor user behavior accomplish proxi server proxi server webac inspect browser http request result webac spawn browser start thread listen http request browser browser make webac creat request thread handl browser capabl multipl request pend time lifespan request thread durat http browser listen thread persist durat applic cluster method exist approach document cluster gener base probabilist distanc similar measur method mean hierarch cluster cluster select set word document dimens featur repres view point space number problem cluster space tradit method trivial defin distanc measur space word frequent document word simpl frequenc occurr word document larger word occur frequent document techniqu tfidf deal problem number word document larg scheme gener requir calcul document cluster calcul valu differ significantli cluster cluster base valu produc good cluster probabilist method bayesian classif autoclass perform size featur space larger size sampl set type data distribut characterist document categor applic categor bookmark file underli probabl model assum independ attribut assumpt restrict reduc select frequent word method extract salient featur document number featur collect method due loss relev qualiti cluster good gener reduct attempt transform data space smaller space relationship data item preserv tradit cluster algorithm appli transform data space princip compon analysi scale kohonen featur map commonli techniqu reduct latent semant index method frequent inform retriev domain emploi reduct techniqu similar pca inher problem reduct presenc result degrad cluster result partli due fact project smaller number data closer clean data lower space practic remov preprocess step perform reduct prior cluster add prohibit step cluster algorithm section design effici handl high reduct requir definit ad hoc distanc similar metric contrast tradit cluster method linearli advantag make method suitabl web retriev categor agent compar algorithm bayesian classif autoclass hierarch cluster base distanc function autoclass base probabilist mixtur model data set find maximum paramet valu specif probabl distribut function cluster cluster result provid full descript cluster term probabl distribut attribut hac method start trivial document iter combin smaller cluster suffici base distanc metric featur document vector weight tfidf scale function featur text frequenc document frequenc document space associ rule hypergraph partit algorithm method cluster relat item supermarket bar code associ rule hypergraph partit method find set item occur frequent transact associ rule discoveri method frequent item set group item hypergraph hypergraph partit algorithm find item cluster similar item captur implicitli frequent item set document document correspond item featur correspond transact frequent item set found associ rule discoveri algorithm correspond set document suffici larg number featur common frequent item set map hyperedg hypergraph hypergraph consist set vertic set hyperedg hypergraph extens graph hyperedg connect vertic set vertic correspond set document hyperedg correspond set relat document kei problem model data item hypergraph determin relat item group hyperedg determin weight hyperedg hyperedg repres frequent item set found associ rule discoveri algorithm associ rule captur relationship item present transact set transact transact subset subset defin support count respect number transact associ rule express form support rule defin confid ff defin task discov associ rule find rule greater minimum support threshold ff greater minimum confid threshold associ rule discoveri step step discov frequent set support greater minimum support threshold step gener associ rule frequent frequent item set comput associ rule algorithm apriori excel candid find relat item note algorithm find frequent item set support greater threshold threshold determin domain specif manner frequent item set captur relationship item size greater equal note distanc base relationship captur relationship pair data point frequent item set captur relationship larger set data point ad model power nice captur hypergraph model hypergraph cluster larg group relat item partit highli connect partit achiev hypergraph partit algorithm partit hypergraph part weight hyperedg cut partit minim note minim essenti minim relat violat split item group part bisect partit highli connect task hypergraph partit algorithm partit larg hypergraph size minut person comput hypergraph partit elimin bad cluster cluster fit criterion set vertic repres hyperedg set vertic repres partit fit function measur good partit defin fit function measur ratio weight edg partit weight edg involv vertex partit good partit examin filter vertic highli connect rest vertic partit connect function vertex defin connect measur percentag edg vertex high connect suggest vertex edg connect good proport vertic partit vertic connect measur greater give threshold consid belong remain vertic drop partit filter document achiev support criteria associ rule discoveri compon algorithm depend support threshold document meet support document share larg subset word prune featur cluster larg document set return standard search engin keyword queri princip direct partit method princip direct partit base comput lead princip direct princip collect document cut collect document hyperplan result separ cluster algorithm repeat separ cluster result binari tree cluster defin princip direct hyperplan method comput root child hyperplan cluster form root algorithm proce split leaf node children node leaf hyperplan leaf split stage select base varieti strategi simplest approach split cluster level binari tree cluster level result imbal size includ cluster document option measur simplic experi shown paper conduct modifi scatter defin document repres column word count column collect term frequenc matrix manner similar latent semant index ij number occurr word document make result independ document column scale unit length usual euclidean ij ij ij ij altern scale tfidf scale scale fill entri entri algorithm depend sparsiti perform tfidf scale substanti cost algorithm yield improv cluster qualiti stage algorithm cluster split centroid vector cluster vector compon ij sum document cluster number document cluster princip direct individu cluster direct maximum defin eigenvector largest eigenvalu sampl covari matrix row vector denot matrix obtain comput lead left singular vector result vector princip document project vector document posit project alloc child remain document alloc left child cluster give definit scatter ij ij sum document cluster word compon cluster centroid vector scatter sum squar distanc document cluster cluster process differ scale column unit length make result independ document translat collect document column lie comput singl lead singular left singular repeat process cluster algorithm lsi svd appli origin matrix word singular valu vector choic remov present yield document reduc reduc cost user queri matrix produc lsi comput preprocess step gener lack sparsiti evalu compar evalu cluster algorithm compar cluster method tradit select web page broad busi capit intellectu properti electron commerc inform system affirm action personnel manag industri partnership manufactur system integr materi process page categori obtain keyword search standard search engin page archiv label facilit entropi calcul subsequ refer page direct archiv ensur stabl data sampl page fairli dynam content word list document filter word select dataset set criteria size comment word select word word text frequenc prune word select exclud occur top word select frequent occur word includ word partit contribut word top text frequenc prune word select exclud occur top text frequenc top text frequenc top text frequenc top word select top word augment word html word tag quantil filter quantil filter select frequent occur word accumul frequenc exce threshold includ word partit contribut word exce threshold frequent item set select word document word list word cluster object measur identifi import group word tabl setup experi porter algorithm implement deriv experi method featur cluster document algorithm earlier object featur select reduc cluster problem retain import featur document tabl show featur select method experi valid cluster algorithm compar perform algorithm complex difficult find object measur qualiti cluster decid entropi measur good cluster caveat entropi obtain cluster cluster figur class distribut autoclass cluster class distribut document calcul class entropi cluster calcul cluster document class entropi cluster cluster document entropi cluster higher total entropi calcul weight sum entropi cluster compar result experi compar entropi algorithm featur select method figur show class distribut document cluster autoclass result entropi compar result result entropi figur result entropi figur big differ qualiti cluster obtain experi experi suggest cluster method base partit work type inform retriev depend choic distanc requir calcul issu cluster mean close space sensit data linearli scalabl wrt figur class distribut cluster figur class distribut cluster cardin document featur space contrast hac autoclass hypergraph partit method princip compon method perform tradit method featur select criteria dramat differ run time method featur select criteria size hac hour minut autoclass minut figur entropi algorithm note lower entropi cluster perform qualiti experi point notabl gener cluster algorithm yield qualiti cluster full set featur discuss larg dataset comput cost case hac autoclass method import select smaller set repres featur improv perform cluster algorithm lose qualiti experi featur select method repres show restrict featur set frequent item set part associ rule identifi small set featur relev cluster task case autoclass experi produc result obtain full set note drawn discuss confirm experi total independ set document scalabl cluster algorithm scalabl cluster method essenti practic larg number document section give evid method scalabl appli cluster method larg data set denot consist document dictionari word construct data set label reduc dictionari criteria tabl scalabl figur illustr perform algorithm dataset fig show entropi lower number cluster consist result shown fig algorithm base effici method comput princip direct method comput princip direct base lanczo method major cost product involv term frequenc matrix total cost cost product time total number product number product experi term frequenc matrix data set entri nonzero cost product involv matrix depend dimens number nonzero entri total cost algorithm govern cluster cluster cluster cluster entropi algorithm experi figur entropi algorithm number cluster number nonzero entri term frequenc matrix illustr fig notic data set fewer word data cost term frequenc matrix time entri nonzero scalabl problem find associ rule meet minimum support criterion shown linearli scalabl respect number transact shown associ rule algorithm scalabl respect number item assum averag size transact fix highli effici algorithm apriori quickli find associ rule larg provid support high complex partit log number vertic number edg number vertic hypergraph number document cluster number hyperedg number frequent support greater seri time obtain cluster algorithm number nonzero entri term frequenc matrix figur time algorithm sgi versu number nonzero term frequenc seri cluster minimum support note number frequent item set number word cluster method linearli scalabl respect number word document figur show entropi algorithm result consist figur entropi lower data set produc size hypergraph tabl show size hypergraph experi seri figur show cpu time partit hypergraph run time partit hypergraph support complex analysi run time proport size hypergraph search categor similar document main task agent search web document relat cluster document kei question find repres set word web search singl word document experi cluster cluster figur entropi algorithm number cluster experi number edg number vertic tabl size hypergraph experi seri size hypergraph figur hypergraph partit time seri number partit repres set set word directli search excess restrict set document search logic choic relax search criteria select word frequent document characterist word cluster document high document frequenc high averag text frequenc document frequenc word refer frequenc word document text frequenc word refer word frequenc document defin tf word list list word highest averag text frequenc df word list list word highest document frequenc word list tf df construct tf df repres characterist set word word frequent document high averag frequenc queri form tf df tf df form queri busi capit cluster discuss section found characterist word cluster df issu queri yahoo web search search return busi relat document ad frequent word previou list df form altavista search queri return busi relat document highli relat exist document cluster page return queri shown figur document return result queri handl wai shown figur filter document set document return queri discuss section filter set higher support criteria associ rule discoveri tighter connect constraint partit result document increment ad exist cluster depend method cluster exist hyperedg extend includ document weight calcul connect document cluster measur ad weight extend hyperedg cluster document cluster highest connect connect ratio chosen cluster remain cluster document strongli belong chosen cluster connect document threshold document consid belong cluster binari tree filter incom document place document side root place side percol tree reach leaf node identifi cluster origin tree close relat locat categori site alta vista web page net event headlin relat book alta vista web page loan direct loan direct restrict condit commerci lend environ show sign obtain small busi act pl approv compil includ pl approv small busi invest act law sec short titl haven commun summari ec summari contact ec summari map strateg plan summari introduct haven commun strateg plan marshal commun softwar busi ventur financ invest info busi financ resourc site softwar creation comput dictionari set capit inform financ execut gener web resourc introduct www execut articl fortun discuss fairfax counti busi servic resourc busi servic resourc art associ career educ child care chamber commerc busi canadian system transit commentari regul march canadian system transit abstract plan fb busi page summer busi summer american solut retir busi set plan tv futur fund busi plan tv futur fund busi plan outlin updat figur search result yahoo incom document combin scatter cluster document document relat split paper agent explor categor result automat gener categori explor web present sampl perform result categor exampl show categori return web explor categor experi shown algorithm algorithm capabl extract higher qualiti cluster oper faster compar classic algorithm hac autoclass consist previou result algorithm capabl filter document set support threshold experi show algorithm fast scale number word document search similar document keyword queri form extend characterist word set cluster experi show method capabl produc small set relev document standard search engin explor perform entir agent integr fulli autom compar rel merit algorithm queri document kei compon agent conduct evalu queri gener mechan classif document exist cluster area futur work involv develop method evalu qualiti cluster base priori class label refer ackerman al learn probabilist user profil ai mitchel learn world wide web proc aaai spring symposium inform gather distribut environ aaai ai verkamo fast discoveri associ rule um advanc knowledg discoveri data page ai verkamo fast discoveri associ rule um advanc knowledg discoveri data page obrien linear algebra intellig inform retriev siam mw st gw obrien linear algebra intellig inform retriev siam berg graph hypergraph american dl bolei princip direct partit technic report depart comput marko yoav yun adapt agent autom web journal visual commun imag cheeseman stutz classif theori result um advanc knowledg discoveri data page weld scalabl comparison shop agent world wide web technic report dept comput scienc richard duda peter hart pattern classif scene analysi john wilei frake inform retriev data structur algorithm prentic englewood frake stem algorithm frake inform retriev data structur page prentic golub van loan matrix comput john hopkin univ approach knowledg navig work note aaai spring inform gather distribut environ aaai eh mobash cluster base associ rule hypergraph workshop research issu data mine knowledg page eh mobash cluster space hypergraph model technic report depart comput jackson user guid princip compon john wilei ak jain dube algorithm cluster data prentic shekhar multilevel hypergraph applic vlsi domain design autom srivastava inform manifold work note aaai spring inform gather distribut environ aaai kohonen memori kwok weld plan gather inform proc nation confer sy lu ks fu cluster procedur pattern analysi ieee transact man leighton srivastava www search servic alta lyco mobash web page categor featur select associ rule princip compon cluster workshop inform technolog dec maarek iz ben shaul automat organ bookmark content proc intern world wide web perkowitz etzioni categori learn understand inform internet proc intern joint confer page porter algorithm suffix strip gerard salton michael mcgill introduct modern inform retriev dm ue statist analysi finit mixtur distribut john wilei marilyn william punch find salient featur person web page categori proc intern world wide web april ron mark peter david gifford hierarch network search engin exploit hypertext cluster seventh acm confer march
IR/1236 5 contextu inform space feder digit librari rapid growth volum terminolog variat render feder digit librari di cult manag suitabl abstract mechan requir construct scalabl document form librari inform space semant search paper address pose distribut semant framework achiev logic partit inform space topic facil contextu landscap document set categori introduct import problem speci digit librari spatial distribut feder make distribut collect heterogen document singl integr collect feder digit librari address narrow speci domain comput econom access world wide web basi special search engin browser face major technic challeng document handl hard larg number document di er structur terminolog due larg number varieti document classi cation scheme emploi document sourc index di erent wai di erent level detail distribut search feasibl typic search question pose digit librari speci search match document entir queri econom document reduct state de cit tax recent approach world wide web queri concentr keyword queri semant content naiv assum mp tilburg po box le tilburg netherland user search explicitli awar semant vocabulari di erenc web data queri due terminolog uctuat data user explicitli awar structur semant natur data queri success practic studi shown critic mismatch user web vocabulari pick term depend intim searcher vocabulari document retriev user interact mean mechan special search user seek understand inform di erent term user found potenti term decid learn semant context term user sati ed locat term seek retriev document match term interest type queri subject gatewai facil easier access inform resourc de ned subject area subject gatewai er system consist index search interfac entri inform web web site document typic exampl subject gatewai social scienc inform gatewai incorpor thesauru social scienc organ medic network inform user access medic inform kei di erenc subject gatewai popular web search alta li perform index alta vista index individu page resourc larg document consist web page tabl content index random fashion contrast subject index resourc describ resourc web page coher fashion research method interact provid user conceptu partit inform space subject area di erent kind term suggest enhanc retriev ectiv refer logic organ document architectur structur resembl massiv semant network semant link creat document resourc topic relat line spirit subject gatewai index document relat document collect index search rout topic topic document current practic web document found user avoid search term suggest close term distinct mean number relat collect document user fulli articul term queri inform space queri structur document data subsequ accomplish queri languag web style research activ uenc idea work project work bayesian infer logic contextu classi cation relat work describ similar di erenc inform retriev techniqu uenc work import distinct document space form index space term index space descriptor media item document text ir system base statist analysi term automat extract free text system index space automat creat vector space similar coe cient measur match queri media suppli media item altern scheme tradit ir approach base manual creat index space semant relationship index term exist combin ir approach thesauru expand queri term approach partli base approach expand categor semant partit inform provid navig queri capabl idea base tradit ir cluster techniqu cluster ir techniqu strategi build static cluster entir collect document match queri cluster centroid hierarch cluster incom queri compar cluster bottom manner variat scheme suggest document high similar score respect queri rst retriev comparison cluster centroid queri match ned categori fail match exist cluster strongli remedi problem encount queri group similar incom queri similar cluster centroid similar queri turn similar cluster centroid cluster emploi tradit ir cluster di erent approach document sort ti centroid gener concept interact tool provid user expand narrow context disambigu term navig lexic centroid term determin queri issu underli document sourc result semant disambigu queri avoid problem tradit ir techniqu logic organ document feder digit librari add document index import document term cient retriev document standard practic librari surrog document digit librari call document index record creat catalog index concept typic refer inform individu inform object dl princip aid searcher access document materi interest gener idea group aggreg document index record respect present textual mari common structur vocabulari topic term searcher interact tool searcher select access individu document aggreg ignor goal provid tool organ document categori broad topic user negoti structur semant inform item explicit implicit extract vast document space inform analysi tool develop combin lexic analysi navig techniqu categor user interfac visual displai subject organ inform sourc user mean identifi topic interest terminolog base context user map keyword order retriev document semant relat term exemplifi environ educ train connect educ train servic public govern agenc document server base shown figur posit provid conceptu holist view inform multipl document server describ process broad phase emploi dir schema describ structur dir distinct set term logic aggreg describ subtop aggreg schema abstract document inform repres subtop term repres object individu schema turn attribut attribut object part subtop process correspond step figur semant relat subtop connect higherlevel call gener concept educ gc repres semant relat dir cluster respect metadata form group unfold descript textual summari extend vocabulari term underli document gc form logic object kind abstract view content larg calli relat document summar descript semant relat data resolv terminolog mismatch semant drift dispar index topic knowledg standard vocabulari term suggest support gc gc materi class hierarchi depict term topic sampl educ context term hierarchi term speci topic term gc shown distinct mean context concept space consist abstract descript term term relationship composit terminolog contextu usag list domain speci appli entir collect member gc includ detail geograph locat access author usag explan corpor term usag de domain charg gc structur akin associ thesauru onlin lexicon automat topic explan creat abstract inform serv mean disambigu term address terminolog semant problem gc assist user speci term user request li conceptu space user pick term descript semant relat request term gc partial gener lexicograph framework wordnet underli semant disambigu user provid set document select term structur support semant reconcili autonom interconnect document sourc user understand inform categor con gure inform demand basi inform assist semant disambigu speci ed term provid set document feder digit librari educ train set gc literatur origin dir schema document index record schema cluster relat schema anchor common structur vocabulari topic term semant term form gener concept space term term topic context schema relat document aggreg instal repositori term term topic context semant link relat gc underli document term term topic context figur connect schema form gener concept space interconnect weight link make search direct deal speci subtop dir sourc inform remot topic provid match inform enrol train research activ public data network digit librari system narrow view term logic layer bottom layer correspond document collect figur middl layer repres schema document top layer correspond concept space layer architectur kei ingredi inform elicit feder dl gener semant hierarchi document term layer semant detail term document structur descript nalli concept space layer entir semant context pattern usag term search target semant gc percol schema layer order provid access content human index assign schema underli human index decid schema gc schema belong belong gc link strongli strongli link weight schema associ organ achiev implicitli schema link strongli gc cluster dir document result gc structur form massiv dynam resembl associ network variant semant network numer weight similar entir set relationship document collect special train organ lexic network vocabulari item repres node semant relationship repres link lexic network point relat train link depend figur interact gc gui term includ educ gc figur assum user search entri educ gc interest term gain insight semant context order formul queri stage rst step enter term list gc lexicograph substrat form menu shown gure due reason number return term term domain limit studi occur figur illustr speci term chosen gure show gc inform contextu speci term factor context usag shown due space combin contextu restrict search space user complet pictur semant context term figur free pick desir eventu lead candid document underli gc metadata schema term entri gui map mean map servic relev schema term found document schema process involv ir cluster analysi techniqu identifi probabl repres similar combin term similar link similar techniqu detail provid ontolog context semant term lexicograph tool wordnet schema term navig queri inform elicit span spectrum activ rang search speci document possibl desir understand inform document natur inform navig techniqu basic mode search system organ search mode depend natur inform user attempt inform relat user oper case user interest nding topic speci inform item call form explor user seek data close relat alli search organ weight content link gc network refer form explor navig searcher deal control amount materi provid detail user close relat dynam index scheme increment discoveri inform order index user decid term request inform term select term shown menu figur locat gener speci ed figur return user veri cation process continu speci term request term locat queri graph structur gener basi term extract user menu entri compar context graph gener basi index structur gc queri graph structur context graph structur gc gener basi term extract wordnet entri serv common ontolog comparison comparison start top index gradual percol requir level speci citi term level step altern user match user queri graph closest context graph obtain number dir close search request search user embark explor search interest data close relat local document gc gc connect shown figur illustr form search search base weight speci document link gc system document base weight educ gc link literatur public gc weight educ gc closer proxim toth employ public gc user chose explor dir educ gc rst explor figur contextu inform term govern educ depart gc public gc weakli link inform gener ambigu mode navig explor gc user embark navig gain insight concept found queri domain user explor search queri return term select schema term pose restrict inform space clarifi mean inform item explor queri assist user unfamiliar vocabulari term connect distribut search sampl queri relat gc previou section includ give topic similar educ govern give term speci part educ give document deal educ learn tra move passeng give document similar author titl applic object note return document belong intersect seemingli unrel gc tra match book pattern document summari paper fundament aspect semant scalabl con gurabl inform infrastructur support subject domain feder digit librari logic architectur extract semant document creat dynam cluster document center common topic interest gener search guid combin structur semant aspect document index record order reveal mean content request inform index gener human human educ activ pointer schema graph schema document cluster educ gc gc item placement document context terminolog problem enhanc document altern search term term suggest user architectur enabl user gather rearrang inform multipl digit librari intuit easili understand manner initi prototyp wordnet lexicograph substrat implement sun sparcstat solari gnu cgi script part system reimplement context ii esprit project aim build european digit librari econom main aim project unifi exist librari system geograph distribut includ heterogen singl user interfac refer crestani author construct hypermedia inform merialdo weav proc vldb sept van rijsbergen free text inform process everitt educ book great doc base educ train ment document cluster gc document cluster gc figur navig mode document cluster gc document cluster gc jone al thesauru intellig journal american societi inform subject lib januari jj ordil heterogen inform sourc sourc proc vldb sept miller lexic commun nov papazogl tool base inform elicit larg heterogen natur languag june organ medic network framework scalabl agent architectur cooper knowledg intellig inform klusch springer feb papazogl semant conceptu commun sept parunak link set base hypermedia taxonom proc acm confer san schatz al term suggest user digit acm intern conf digit bethesda march social scienc inform smith inform environ digit digit librari willett trend hierarch document critic inform process
DB/1237 3 hyper knowledg reform effici hypothet reason helmut mitsuru yamamoto depart inform commun engin school tokyo tokyo japan abstract present hyper system implement approach knowledg acycl horn theori transform proposit logic compil method integr techniqu deduct theori transform obtain compact proposit transform theori compact ground version origin theori term significantli shorter form call knowledg import effici reason method defin proposit knowledg natur express languag show knowledg reform polynomi time infer find solut hypothet reason problem present result confirm effect compil method introduct motiv knowledg reform deriv fact declar knowledg design varieti inform relev answer queri queri type al literatur semant queri optim interest problem artifici intellig requir power reason theori progress made develop effici mechan proposit reason effici procedur solv proposit satisfi problem kautz sl method fast mechan solv proposit hypothet reason problem recal hypothet reason basic form proposit problem gottlob aim knowledg reform preserv gener compact repres knowledg horn time process highli effici proposit knowledg base knowledg reform extend exist work knowledg compil donini case compil method preprocess proposit kb result speed queri answer start kb gener proposit kb manag size idea knowledg reform implement transform instanti variabl theori constant function symbol finit set essenti proposit obtain approach impract huge number proposit produc suggest appli theori transform sato instanti theori principl applic transform step elimin variabl occur bodi head instanti exponenti number variabl occur result transform significantli ground instanti origin yield instanti transform replac result instanti variabl reform procedur combin effici hypothet reason method main contribut knowledg reform kr commun twofold proposit theori deriv automat pendant research interest proposit algorithm approach problem formul firstord horn logic extra effort result proposit theori attract comput properti term small size shorter process effici transform procedur serv similar function knowledg object decomposit decomposit kb mainten reform procedur translat proposit plan problem librari paper organ section describ configur hyper system section show techniqu relev reason rule part kb relat set queri section introduc transform procedur section phase hypothet reason problem relev reason isol part kb relev queri type theori transform appli transform step instanti gener ground theori construct phase proposit hypothet reason problem relev reason isol part kb relev queri hypothet reason appli sl method gener solut hypothet reason problem fig configur hyper system describ construct queri type section report result section briefli discuss summar paper system configur comput effort hyper system divid illustr fig hyper acronym reason emploi phase isol portion kb relev answer queri type queri type ground queri constant replac variabl kb transform transform step transform theori instanti construct output phase ground knowledg base kb relev instanti queri type solut respect hypothet reason problem phase assum ground queri comput proposit relev ground queri sl method appli gener solut hypothet reason problem relev reason section introduc procedur partit horn theori remov contribut solut call strongli irrelev al horn theori set form xn pn xn atom denot sequenc variabl atom call head denot conjunct pn xn call bodi denot variabl occur implicitli quantifi variabl call ground simpli call function symbol constant denot set variabl occur head set variabl occur bodi consid restrict theori direct graph cycl observ definit theori call direct graph consist tn top node exist path node top node phase reform theori factor partit independ gener queri type theori split disjoint tn resolv mean search space atom queri type restrict singl gener case acycl factor perform mean algorithm comput queri type reachabl queri type exist path head observ theori factor polynomi time conclud reform phase import note acycl factor queri type independ queri type procedur introduc significantli reduc number consid answer ground queri claim support refer interest reader result theori transform variabl elimin motiv appli transform reduc complex theori measur number ground instanti exponenti number variabl occur minim theori transform form transform theori transform proce success appli unfold fold theori applic transform rule elimin unnecessari variabl occur bodi head algorithm elimin unnecessari algorithm halt suggest termin procedur elimin suffici number unnecessari variabl introduc set procedur automat definit rule broad class bodi lot technic detail involv describ procedur show result perform definit fold step definit definit fold tamaki sato start terminolog distinguish kind bodi distinct intend cover broad rang bodi central notion block bodi block set atom defin binari relat atom denot reflex transit closur denot partit bodi block wrt note variabl occur block bodi form singl block gener definit rule fresh predic fold fold obtain transform theori consist significantli instanti theori block varieti syntact form chain chain introductori section revisit chain section experi isol variabl call isol definit rule isol gener fold produc theori transform procedur transform procedur perform cycl procedur applic procedur significantli extend algorithm special instanc bodi isol algorithm elimin unnecessari variabl observ appli theori obtain slightli yield significantli fewer instanti theori instanti phase reform theori instanti emploi method al obtain set ground relev queri type compact search tree horn theori form tree construct qt simpler origin leav uninstanti typic assum order prove queri algorithm consist success phase bottomup instanti base atom fact propag upward queri type instanti conceiv constraint argument predic constraint gener queri type branch qt constraint node qt possibl lead prune part tree construct obtain set ground relev queri type instanti queri type solut respect theori consist assum complex build qt linear number rule possibl exponenti ariti predic empir evalu impact save gain knowledg reform test mean mechan effici proposit hypothet reason method comput solut sl method linear program techniqu simplex determin initi search nonlinear program techniqu find solut infer speed sl method approxim number proposit variabl problem formul sl method run sgi workstat mhz cpu mb theori variabl instanti procedur implement run machin hypothet reason knowledg base queri problem formul inconsist constraint ae form hn sequenc constant symbol denot imposs state hypothet reason task consist find minim set hn sl method gener natur solut optim solut theori includ inconsist shown solut solut solut cost experi intend show speedup effect due knowledg reform factor shown involv simpl theori interest make easi comparison vari relev number unnecessari number constant problem formul expect effici gain unnecessari variabl elimin theori consist set element vari number constant obtain theori size theori greater number link definit vari number assum call instanc assum default cost element essenti solut hypothet reason problem appli reform replac inconsist constraint remain unchang impact knowledg base reform problem size process time summar fig const const rule atom ref ref ref ref fig result number constant occur problem formul rule refer number instanti rule reform number includ number instanti inconsist constraint reform theori atom number atom problem formul atom atom occur column show cpu time instanti origin reform column give cpu time find solut instanti goal origin reform cpu time reform theori variabl elimin procedur relev reason part phase integr sl method instanti origin theori effect mean creat lookup tabl number constant problem number variabl ten obtain proposit definit path variabl effect knowledg reform expon origin transform variabl proposit properti reform part output theori transform direct effect number atom problem formul total number atom respect theori fig interest instanti reform theori mimic behavior reason method assum path run reason goal assum inconsist contraint problem constant fig block constant fig isol formul solv bound bound solut solv valu ground theori effect produc instanti requir reform ground find solut solut variabl inconsist instanti solut set difficult compar radic approach integ linear program orient reason method time instanti theori note method produc ground theori instanti queri type solut ground queri actual time queri instanti number constant problem ariti queri predic case ten actual cost reform theori individu queri ground queri unrealist assum queri expect compil theori suffici larg number time amort cost instanti theori column fig summar effici gain result knowledg reform cpu total speedup factor constant total speedup consid instanti time time find theori requir reform theori support hypothesi perform crucial depend unnecessari variabl perform experi analog bodi atom definit variabl measur speedup factor twelv figur summar speedup effect transform procedur block isol exampl section infer time refer total time solv reason specif goal speedup effect neglig realist expect reform procedur appli significantli larg portion transform procedur vari extent address problem formul acycl horn logic function arriv compact proposit present hyper effect method hypothet reason kb languag horn logic compil proposit kb effici proposit method appli comput solut shown offlin knowledg reform rule effect reduc number length gener proposit rule total infer time solv hypothet reason problem significantli reduc idea preprocess part input improv effici emploi nayak donini compil method restrict proposit origin kb express proposit logic introduc effect produc compact proposit theori theori approach share intuit plan satisfi framework kautz selman appli presenc constant make translat problem point levesqu imagin knowledg base constant focu present paper subset compil techniqu shown practic diagnost task hyper system free softwar acknowledg anonym detail comment special colleagu provid hypothet reason engin experi insight comment author support grant japan societi promot scienc refer marco francesco donini survei knowledg compil ai john jack minker foundat semant queri optim deduct jack foundat deduct logic page morgan kaufmann john knowledg object decomposit intern flair confer page thoma eiter georg gottlob complex abduct journal mitsuru sl method comput solut linear program hypothet reason pacif rim confer artifici intellig page henri kautz bart selman push proposit stochast search nation confer artifici intellig hector levesqu complet result reason incomplet firstord knowledg base confer principl knowledg reason page alon richard sagiv speed infer relev formal algorithm artifici mitsuru network bubbl polynomialtim hypothet reason method comput solut artifici helmut mitsuru prepar knowledg base fast infer intern flair confer page helmut mitsuru qualifi diagnosi nation confer artifici intellig page maurizio alberto avoid unnecessari variabl logic program theoret comput gerhard relev deduct critic overview classic logic academia st bart selman henri kautz extens solv larg structur satisfi problem intern confer artifici intellig page sutcliff problem cnf journal autom tamaki sato transform logic program intern logic program page brian william nayak approach reactiv system nation confer artifici intellig page
DB/1238 3 practic lineag trace data cui jennif widom comput scienc stanford abstract view data lineag problem wareh data item materi identifi set sourc data item produc view item formal problem present lineag trace algorithm relat view aggreg base trace number scheme store auxiliari view enabl consist effici lineag trace data report perform studi identifi scheme perform set base implement lineag trace packag data wareh system prototyp stanford user select view tupl effici examin sourc data produc introduct data wareh system collect data multipl distribut integr inform materi view local view content sourc chang user perform data analysi mine base view view content provid suffici inform analysi interest view data origin sourc data deriv view data view data identifi exact set base data item produc view data item term view data lineag problem primari motiv support view data lineag enabl analysi interest potenti erron view function clear benefit olap data mine environ applic domain scientif network monitor system algorithm result lineag trace appli problem view updat materi view schema evolut data discuss applic comput lineag view data view definit origin sourc possibl auxiliari inform repres intermedi result view definit distribut data wareh queri sourc lineag inform difficult sourc transfer data inconsist view store addit auxiliari inform reduc avoid sourc access lineag trace numer option auxiliari inform perform tradeoff store copi sourc data improv lineag trace avoid remot sourc queri significantli storag cost introduc extra mainten cost work support darpa air forc rome laboratori contract lineag trace plai import role data analysi futur problem enabl perform trace process consist effici manner wareh environ studi knowledg provid initi practic solut trace lineag tupl view relat data contribut paper includ formul view data lineag problem develop lineag trace algorithm relat view trace procedur gener automat view queri procedur optim easili standard dbm discuss optim trace procedur scenario restrict case spj introduc famili scheme store auxiliari view provid consist effici lineag trace distribut wareh environ scheme offer advantag scheme suitabl set present perform studi auxiliari view scheme cost model incorpor lineag trace cost view mainten storag cost identifi scheme present perform set base implement view tupl lineag trace packag part data wareh prototyp stanford relat work problem trace view data lineag relat work area view updat deduct scientif problem address roughli includ retriev lineag inform specif type view paper develop complet lineag trace solut gener relat view aggreg distribut wareh environ perform issu investig depth lineag view storag cost note initi work lineag trace wareh environ form basi present paper framework comput verifi approxim lineag view base view weak paper provid mechan gener weak view definit statist approach reconstruct base data summari data knowledg constraint approach estim lineag ensur accuraci present framework explicitli store lineag call data item queri result base mediat architectur lineag inform store queri identifi sourc data item deriv addit inform timestamp sourc qualiti contrast present procedur comput lineag tupl relat view limit amount auxiliari procedur gener automat view definit approach gener includ relat oper union duplic omit extens due space limit sourc user earn daili figur simpl wareh scenario recent work dealt data design relat storag auxiliari view improv perform problem select auxiliari view index store order minim total view mainten cost theoret solut find design minim queri cost constraint mainten cost paper develop heurist search algorithm larg solut space problem store auxiliari view primarili enabl optim lineag trace process lineag trace queri special small solut space conduct perform studi scheme scenario lineag view storag cost motiv provid simpl illustr lineag trace problem introduc terminolog paper figur show simplifi diagram data wareh solid arrow repres data flow dash arrow repres queri sourc base inform sourc daili tabl sourc stock market latest stock price includ close price stock ticker recent work dai earn tabl sourc analysi firm list latest earn share industri stock belong tabl sourc record stock includ transact date number share transact sampl tabl content figur materi view user monitor list industri regard stock industri gain monei latest close price higher averag share stock ratio defin materi view view definit express sql relat algebra daili ticker high low close aaa bbb ccc fff earn ticker industri earn aaa automobil bbb comput ccc comput medicin retail fff automobil ticker date price share aaa bbb ccc bbb ccc figur sampl data tree figur ff oper repres aggreg sampl data view data lineag user learn industri list view select view tupl trace lineag sourc tupl produc view tupl lineag result tupl sourc produc view figur section formal definit view data lineag procedur identifi lineag tupl view auxiliari view store addit inform enabl lineag trace intermedi result node ff algebra definit trace lineag tupl recomput relev portion aggreg trace tupl defin auxiliari materi view node specif lineag trace mention store auxiliari view order perform lineag trace queri sourc section describ number scheme auxiliari inform section analyz rel perform view mainten user view trace auxiliari view support lineag trace sourc chang assum standard increment view mainten approach sourc tabl record delta tabl view view comput predefin queri call mainten express tupl insert insert record delta tabl insert view comput queri figur daili replac delet view comput similarli refresh view tabl appli view comput mainten queri sourc problemat discuss earlier prior work address problem ad auxiliari view ensur set view maintain sourc view queri sourc introduc auxiliari view support lineag mainten cost view maintain auxiliari view lineag trace maintain user make entir set view creat view select daili earn group share industri close earn cost share daili earn figur view definit daili ticker high low close bbb ticker date price share bbb bbb earn ticker industri earn bbb comput figur lineag trace view data lineag view data item exact set base data produc call lineag section provid formal definit data lineag problem relat view present lineag trace algorithm motiv problem detail trace solut found view data lineag defin concept view data assum logic view content comput evalu algebra view definit queri tree oper tree gener result base result children pass result upward conveni view refer relat relat instanc separ relat approach view definit express algebra tree limit view focu individu defin lineag tupl oper result base input definit lineag op relat oper tm tabl result appli op tabl tm tupl defin ts lineag tm op op ht mi ht maxim subset tm ftg ft op ts lineag tupl contribut op extend lineag set op ht mi ht repres union tabl hr rm hs sm sm definit requir lineag tupl set deriv relat result tupl exist tupl set requir tupl lineag fact contribut requir op oe base tupl satisfi select condit make contribut view tupl view tupl lineag defin maxim subset satisfi requir make lineag tupl contribut lineag fulli explain tupl exist view motiv discuss definit defin tupl lineag individu proce defin tupl lineag arbitrari view mention view definit express queri tree evalu base tupl contribut tupl tabl intermedi node view definit contribut view tupl contribut definit lineag base tabl rm view tupl tupl contribut view defin contribut oper op definit contribut view definit contribut ts lineag hr subset rm iff contribut ts lineag denot lineag view tupl set base tupl contribut view tupl set lineag tabl figur view ff figur interest lineag tupl easi tupl bi tupl contribut contribut tupl oe contribut shown figur lineag trace procedur view transform form oper sequenc commut combin oper view definit tree call result form canon call sequenc segment canon segment outermost includ aggreg oper merg adjac detail view canon form sum figur tupl lineag view lineag tupl proof trace lineag transform view definit canon trace view lineag base canon form uniform canon form make easier gener view lineag trace procedur make trace process effici remaind assum view trace canon form note view figur canon form ff industri view defin segment call spj view special case view lineag tupl view comput singl relat call lineag trace queri definit trace view tupl tq lineag trace queri iff tq ts lineag tq independ instanc similarli defin trace queri view tupl set denot tq theorem trace queri view tm ff tm tupl ts lineag tm comput tq split tm split oper break tabl multipl split tupl set lineag trace queri tq split tm trace lineag view defin multipl level logic defin intermedi view trace hierarchi intermedi view trace queri view comput lineag current trace tupl respect view base tabl level discuss materi maintain intermedi view procedur begin return intermedi view base hv fv concaten lineag result ffi return end figur algorithm view tupl lineag trace lineag recomput relev intermedi result trace time effici increment mainten aggreg user view gener requir materi intermedi view lineag trace assum intermedi view materi figur present trace procedur view canon form tupl procedur comput lineag discuss assum base tabl intermedi procedur comput lineag hv hv view trace queri hv vm theorem comput lineag tupl set concaten result form lineag entir list view tupl set lineag view section recal illustr figur defin materi intermedi view stock segment shown figur view tupl comput ts lineag tabl earn lineag trace split stock select condit close industri result trace queri stock earn shown figur stock intermedi trace lineag stock sourc tabl obtain figur concaten daili earn obtain final lineag result shown figur optim obviou improv make basic algorithm select condit semijoin trace queri push join significantli reduc trace cost case user view kei base kei trace view tupl fetch lineag directli base tabl perform join content intermedi ff result gener trace lineag case user view daili stock segment close earn industri segment cost share share earn figur trace split split figur trace queri attribut intermedi ff trace view lineag node maintain recomput intermedi result auxiliari view lineag trace recal distribut wareh queri sourc lineag inform difficult sourc transfer data inconsist view store auxiliari view reduc avoid sourc queri lineag trace section auxiliari view intermedi segment view definit effici lineag trace wide varieti auxiliari view perform tradeoff set remaind paper auxiliari view scheme rel perform restrict case spj view futur work extend result expect full gener view spj view tm tupl set figur show gener form trace queri theorem assum local select condit involv singl base push oe join condit size push semijoin rewrit trace queri figur auxiliari view base form queri tree trace tupl set trace defin maintain auxiliari view subqueri involv trace tupl set singl tupl set stage gener result practic expect trace packag permit multipl tupl trace conveni effici price close share daili figur view definit ticker share aaa ccc figur content view scheme store auxiliari view support trace lineag scheme lineag trace mainten procedur auxiliari view origin factor perform mainten ffi denot delta tabl discuss section insert delet denot applic delta tabl refer origin view user view distinguish auxiliari view run simpl spj view defin figur daili sourc tabl introduc section price higher current close includ stock ticker number share figur show view content sampl sourc data store extrem case store auxiliari view lineag trace auxiliari lineag tq split mainten auxiliari mainten ffi ffi tm ffi ffi ffi tm scheme retriev inform sourc tabl time user pose lineag trace queri incur extra storag mainten lead poor trace perform scheme includ primarili baselin compar scheme store base tabl trace lineag tupl view queri view view trace correctli sourc tabl inaccess inconsist view easi make view store copi sourc tabl view defin local issu trace queri local copi sourc tabl lineag trace refer sourc copi base tabl auxiliari bt lineag tq split mainten auxiliari ffi bt mainten scheme replac bt ticker high low close date price share aaa ccc figur lineag view store base tabl improv user view mainten lineag maintain base tabl fairli easi base tabl appli local sourc data irrelev view tupl lineag join select base tabl view simpli copi tabl daili store lineag view altern improv trace queri perform store auxiliari view base left figur call lineag view lineag inform tupl user view auxiliari lv oe tm lineag tq split mainten auxiliari ffi lv oe ffi ffi tm ffi ffi ffi tm mainten lv scheme significantli simplifi trace queri reduc trace queri cost lineag view larg maintain base lineag view maintain user view figur show content lineag view store split lineag tabl view join lineag view defin section effici perform semijoin lineag trace solut split lineag view store set tabl call split lineag tabl note lineag view lv defin section definit auxiliari lineag tq split mainten auxiliari ffi mainten split lineag tabl irrelev sourc tupl contribut view tupl size split lineag tabl smaller lineag view mainten cost similar lineag view note materi lineag view lv comput order maintain user view auxiliari view disadvantag lineag trace queri figur show content split lineag tabl join advantag scheme lv case ticker high low close aaa ticker date price share aaa ccc figur split lineag tabl ticker high low close aaa ccc ticker date price share aaa ccc ccc figur partial base tabl store partial base tabl reconsid bt scheme reduc size base tabl store semijoin sourc tabl user view call semijoin result partial base tabl auxiliari lineag tq split mainten auxiliari ffi ffi ffi mainten scheme view select join scheme replic sourc data bt reduc storag cost refresh auxiliari view reduc trace trace queri oper smaller tabl partial base tabl mainten user view user view maintain partial base tabl cheap maintain base user view content figur show content partial base tabl store base tabl project sourc tabl store auxiliari view kei attribut sourc tabl call base tabl project scheme improv trace queri perform store reduc view mainten storag cost store full sourc auxiliari bp includ kei attribut attribut project attribut involv join condit lineag oe ht tm mainten auxiliari ffi bp mainten scheme replac bp note semijoin trace procedur scheme sourc tabl wide tupl view project small fraction lineag store inform identifi kei sourc tupl contribut view detail sourc inform fetch sourc kei ticker close aaa bbb ccc fff ticker price share aaa bbb ccc bbb ccc figur base tabl project ticker share aaa ccc figur lineag view project inform mainten user view easi bp scheme queri drawback discuss earlier figur show content base tabl project store lineag view project assum base tabl store project lineag view includ base tabl kei user view attribut call view lineag view project note lineag view lv defin section definit auxiliari set attribut set kei attribut tabl lineag ht tm mainten auxiliari ffi mainten compar bp lp scheme simplifi trace queri improv trace perform mainten cost lineag view project higher base tabl project lp requir sourc queri step trace disadvantag discuss figur show content lineag view project mention section view trace correctli sourc inaccess inconsist view view introduc section ensur view maintain queri sourc case sourc ensur user view auxiliari view tabl summar properti respect scheme introduc extens call extens scheme bt lv bp lp tabl scheme paramet descript base variat rang workload queri ratio trace queri total oper queri size tupl trace queri view paramet rel num tabl view join ratio join tupl tupl select ratio select tupl tupl select proj ratio byte project view tupl size byte sourc paramet tupl num tupl sourc tabl tupl size tupl size sourc tabl updat size chang tupl sourc tabl updat tran cost network transmiss cost msg cost network setup cost configur block size byte block sourc disk cost cost disk block tabl system model paramet perform studi section present perform evalu auxiliari view scheme lineag trace address trace mainten cost distribut impact paramet sourc tabl number sourc view scheme perform term trace time mainten system model tabl summar configur paramet simpl wareh system architectur figur studi spj view type oper lineag trace queri view mainten entri tabl assum local select condit push sourc tabl incorpor sourc tabl size assum sourc tabl view statist assum sourc data block size disk access cost assum sourc perform simpl spj join oper index join tabl scan index lookup base valu tabl baselin set vari relev paramet time cost model perform analysi perform metric lineag trace queri averag tupl lineag trace time metric metric measur view mainten includ total time spent maintain auxiliari view user view total view mainten cost discuss bt lv bp lp total resourc time total resourc time total resourc time total resourc time total resourc time total resourc time mainten cost trace queri cost read refresh network figur cost distribut base set bt lv bp lp figur storag cost auxiliari view scheme lineag trace improv perform user view mainten lineag queri perform view mainten access network cost lineag trace view time disk cost disk lineag trace view chang comput tran cost byte transmit lineag trace view msg cost network messag lineag trace view total trace queri view mainten time base ratio size user view auxiliari compar scheme storag requir experi result present sampl experi address question begin section experi simul total oper oper lineag trace queri set view view comput appli user view auxiliari view base set sourc perform scheme base set tabl investig cost distribut relev cost compon studi impact scheme sourc tabl number sourc view ratio measur ten scheme graph admittedli difficult highlight import aspect result text cost distribut experi compar perform ten scheme base set figur show cost distribut divid trace queri cost bt lv bp lp sourc tabl size averag trace time tupl bt lv bp lp sourc tabl size averag mainten time tupl bt lv bp lp sourc tabl size total time bt lv bp lp sourc tabl size storag figur impact sourc tabl size view mainten cost left figur show storag requir includ user auxiliari view user view fairli select base result high varianc storag figur base achiev low lineag trace cost fairli low total cost highest trace cost low mainten cost lv low trace cost high mainten cost bt reason extrem extens significantli reduc network cost higher refresh cost higher storag requir scheme achiev low trace mainten requir queri sourc network cost remain high impact sourc tabl size scheme affect sourc tabl size vari size sourc tabl studi impact trace queri mainten cost storag requir figur show result repres number tupl sourc tabl repres relev cost result sourc tabl size provid lowest trace cost cost ident bp incur lowest mainten total time cost bp low storag requir bt lv bp lp averag trace time tupl number sourc tabl bt lv bp lp averag mainten time tupl number sourc tabl bt lv bp lp total time number sourc tabl bt lv bp lp storag number sourc tabl figur impact number sourc tabl impact sourc tabl number number sourc tabl result figur observ perform poorli lineag trace scale sourc tabl present trace perform sourc number bp incur lowest total cost number sourc tabl lowest storag requir impact view join select experi studi join select user view affect scheme figur show result repres view join vari trace perform lp degrad substanti view join ratio scheme sensit incur significantli lower total cost scheme experi impact workload pattern final experi studi impact workload ratio trace queri view mainten figur vari ratio extrem queri ratio trace extrem queri ratio view total prefer high queri bt prefer medium queri bp prefer low queri ratio bt lv bp lp averag trace time tupl join ratio bt lv bp lp averag mainten time tupl join ratio bt lv bp lp total time join ratio bt lv bp lp storag join ratio figur impact view join select bt lv bp lp total trace time queri ratio bt lv bp lp total mainten time queri ratio bt lv bp lp total time queri ratio figur impact workload pattern futur work defin view data lineag problem present lineag trace algorithm relat view trace lineag transform view definit canon gener trace procedur simpl procedur trace queri complex algorithm appli trace queri view definit tree trace queri optim techniqu push optim trace procedur type view motiv detail trace definit algorithm found extend result set duplic restrict case spj design scheme store auxiliari view enabl improv perform lineag trace view mainten wareh environ compar scheme identifi scheme perform set result basi effici data analysi debug analyst underli sourc data produc view data item interest implement tool base lineag trace algorithm prototyp data wareh system stanford futur work includ extend auxiliari view scheme perform studi cover arbitrari view extend techniqu relat enabl lineag trace complex view transform lineag trace compel lineag view tupl involv current sourc histor sourc sourc data previou version plan explor extens work problem lineag trace version histori view data lineag defin paper explain base relat tupl view tupl exist erron view tupl exist erron base tupl base tupl provid support identifi case acknowledg grate sudarshan jeff janet group colleagu enlighten discuss refer chaudhuri dayal overview data wareh olap technolog sigmod march jl wiener trace lineag view data wareh environ technic stanford novemb dayal pa bernstein updat relat view proc fourth intern confer larg data page septemb hv recov inform summari data proc intern confer larg data page august pirahesh data relat aggreg oper gener proc twelfth intern confer data page februari ka ross adapt materi view redefinit proc acm sigmod intern confer manag page san subrahmanian maintain view increment proc acm sigmod intern confer manag page gupta select view materi data proc sixth intern confer page januari zhuge stanford data wareh project ieee data engin special issu materi view data june ward manag deriv data scientif dbm proc intern confer larg data page august wh inmon kellei develop data qed publish keller view updat translat dialog view definit time proc twelfth intern confer larg data page august sourc queri document workshop web inform data page novemb wj physic design data wareh proc thirteenth intern confer data page april lomet editor special issu materi view data ieee data engin bulletin june widom make view data wareh proc fourth intern confer parallel distribut inform page miami decemb quass mainten express view aggreg proc workshop materi techniqu page june ka sudarshan materi view mainten integr constraint trade space time proc acm sigmod intern confer manag page june stonebrak implement integr constraint view queri modif proc acm sigmod intern confer manag page san ullman system comput scienc widom research problem data wareh proc fourth intern confer inform knowledg page novemb stonebrak support data lineag visual environ proc thirteenth intern confer data page april widom view mainten wareh environ proc acm sigmod intern confer manag page san
DB/1239 3 technolog holger thoma abstract present minim numer problem exist order fulli gi discuss exist heterogen problem fact solv achiev problem address structur semant level identifi approach perform semant translat introduc uniform descript context discuss conceptu architectur semant translat enhanc provid intellig inform integr base inform entiti context demonstr theori sketch real life scenario introduct year work conduct research topic fulli gi overview problem data integr geograph inform system intern confer geograph inform system consist numer contribut research topic recent studi area data wareh inform integr address problem share store process larg amount geograph distribut specif data model make data system requir data transfer specif data format process time consum tediou data automat make invest technic infrastructur inevit obstacl motiv concept center comput technolog bremen germani format integr solut inform integr appli exist inform access remot system order supplement data basi advantag success inform integr obviou qualiti improv data due avail larg complet data improv exist analysi applic analysi cost reduct result multipl exist inform sourc avoid redund data conflict redund establish effici inform difficulti compet question technic problem solv suitabl inform sourc locat data task inform sourc access data provid access provid technic inform level inform integr provid full access requir access data interpret remot system problem provid access inform larg solv invent comput problem process interpret retriev inform remain import research topic paper address problem mention find suitabl inform enabl remot system process access solut remot system interpret access data intend sourc address question explor technolog enabl system bear mind special gi level integr modern inform societi requir complet access inform open inform system integr encourag order satisfi creat challeng area comput scienc distinguish integr solv order achiev complet integr access syntact standard evolv integr inform sourc classic interfac standard html xml gain import structur problem pass pure syntact level integr heterogen structur problem solv mediat system defin map rule inform structur semant term semant integr semant denot resolut semant make map concept term imposs approach solut problem inform account level integr combin includ standard markup mediat classifi enabl technolog order overcom obstacl mention suffici solv heterogen problem separ import note problem solv system level integr account subsect give short introduct problem structur semant integr syntact integr typic task syntact data integr inform sourc syntact level data type problem solv short int int data abstract inform sourc standard technolog overcom problem level wrapper wrapper hide intern data structur model sourc transform content uniform data structur model structur integr task structur data integr data structur homogen data structur formal construct specif inform sourc numer inform sourc classic task middlewar corba low level mediat higher level mediat provid flexibl integr inform system manag world wide web mediat abstract inform provid sourc sourc encapsul wrapper year numer mediat develop popular tsimmi mediat rule mediat describ inform sourc map integr view simpl rule mediat convert inform sourc inform integr view mediat rule split formul respect integr sourc combin result queri plan mediat solv problem discuss feder research structur heterogen semant heterogen structur heterogen mean inform system store data structur semant heterogen consid content semant inform item rule design order reconcil structur heterogen discov semant heterogen problem reconcili plai subordin role reconcili semant heterogen semant level consid context possibl describ semant level context data relat properti consid context transform context context semant integr semant integr process complic process present real challeng semant heterogen main problem solv spatial data integr author gi commun call problem inconsist worboi identifi type semant heterogen distribut geograph gener semant heterogen result contextu semant heterogen base mean concept scheme gener semant heterogen base concept space data model focu contextu semant heterogen base semant local schemata order discov semant formal www standard markup languag xml rdf develop commun describ languag semant descript concept argu sophist approach overcom semant heterogen problem ontolog identifi process advantag disadvantag technolog discuss separ subsect ontolog describ inform sourc actual integr process briefli discuss subsect call process semant map semant model xml rdf develop semant descript inform sourc xml exchang order overcom pure annot provid xml extens languag user defin tag order type content main benefit xml li opportun exchang data structur idea introduc xml schemata definit languag data structur paragraph sketch idea xml describ xml schema definit potenti data exchang gener data object xml document guidelin xml document provid commun specif provid formal grammar document addit gener user grammat constraint structur document document type definit xml document valid type definit compli grammat constraint definit dtd specifi element xml document element delimit start end tag type set attribut specif consist addit constraint dtd refer logic structur includ nest tag insid inform bodi requir restrict express dtd concern type attribut default valu attribut provid schema definit xml schema xml document defin valid structur xml document spirit dtd element schema definit type attribut defin restrict mention inform element list element definit nest insid defin element xml schema addit featur defin data structur support basic data type constraint attribut occurr constraint sophist structur type definit deriv extend restrict type mechan combin schemata discuss featur length mention addit featur make encod complex data structur enabl map applic inform share xml schema encod inform term xml document make xml internet procedur big potenti actual exchang data user commit order make inform point xml schema defin structur data provid inform content potenti lack import advantag argu xml design provid interchang format weakli structur data defin underli schema order clarifi role singl statement thing import claim inform share xml pure natur xml describ data object level find approach describ inform meta level defin mean order fill rdf standard data model repres web page content xml syntax rdf standard basic model underli rdf kind inform resourc web page xml element express term tripl properti relat connect resourc properti simpl resourc replac variabl repres resourc nest tripl make assert properti resourc repres variabl rdf multipl valu singl properti model data type call unord list order list set altern provid kind aggreg mechan requir natur web avoid occur refer annot rdf defin defin refer url connect sourc id annot rdf specif defin origin sourc standard syntax develop express make identifi statement provid low level languag express intend mean inform machin process basic simpl model underli ordinari leav lot freedom describ arbitrari wai peopl share agreement standard core vocabulari term model primit describ rdf scheme attempt provid standard vocabulari closer model reveal borrow frame system area knowledg notion concept slot inherit rang restrict semant exist model primit current state part mechan defin inform level reason support properti inherit semant introduc standard inform exchang annot investig inform integr refer layer integr section discov xml concern issu syntact integr xml defin structur sophist mechan map structur rdf design provid inform semant enabl includ descript section rdf current state fail provid semant descript common syntax basic vocabulari describ design rdf awar strong addit defin clear semant basi integr mechan current web standard xml xml schemata suitabl exchang data defin syntax structur simpl rdf uniform syntax exchang format current state xml rdf suffici support integr heterogen structur mean term semant model reason structur mean candid semant model approach found area knowledg distribut commun discuss approach section ontolog formal ontolog support inform system discuss term wai commun motiv ontolog inform integr defin refer ontolog introduc ontolog explic share vocabulari conceptu specif subject matter describ ontolog explic concept properti final argu benefit explic typic applic scenario share vocabulari person individu view world thing deal dai common basi understand term languag commun term natur languag assum share vocabulari reli common understand concept varieti common understand reli specif idea world organ call idea conceptu world conceptu provid terminolog commun peopl natur languag conceptu limit number person commit conceptu fact reflect exist languag differ terminolog develop special scientif econom area find situat term refer phenomena term philosophi comput scienc serv consequ separ share terminolog conceptu group call inform commun main problem share terminolog specif conceptu world inform remain implicit mathematician talk binomi normal refer wider scope formula interpret number subset potenti estim chanc win ontolog set overcom problem implicit hidden knowledg make conceptu domain explicit correspond definit term ontolog popular comput scienc ontolog explicit specif conceptu ontolog make assumpt mean term view context lenat describ context term twelv independ dimens order understand piec knowledg complet demonstr dimens ontolog specif context wai ontolog explic conceptu context knowledg possibl rang pure inform natur languag descript term glossari strictli formal express power full order predic logic ontolingua uschold distinguish wai mechan specif context knowledg ontolog level specif conceptu implicit context level formal mention glossari term pure inform charact step gain describ structur descript good approach standard web annot languag xml section dtd ontolog describ terminolog web page low level formal inform charact xml encourag hierarchi xml specif origin design describ exploit repres harmelen lead problem solv assign formal semant structur descript ontolog conceptu model languag offer primit describ domain formal semant term order logic formal structur part specif assert term descript dynam knowledg formal offer total freedom descript specif languag complet formal promin knowledg interchang format design enabl system exchang knowledg kif basi ontolingua languag suppli formal semant languag extend comparison criterion extend explic reach ontolog criterion strongli connect express power specif languag mention simpl hierarchi term gener express specif ontolog consist organ term network relat idea back semant network seventi extens basic idea examin influenti role fill entiti show type kind restrict found recent approach rdf schema descript standard semant descript rdf schema class definit properti restrict socal default valu rang descript express cover conceptu express power provid class logic formula formula restrict decid subset order logic approach descript logic approach express descript ontolingua class defin arbitrari express full predic special languag extend express cover specif applic area exampl specif languag system includ variant dynam logic describ system dynam ontolog classifi area requir level formal extend explic provid ontolog review briefli common applic support commun specif system inform entiti comput system inform commun commun cooper member share terminolog defin mean formal inform commun make commun member inform commun difficult common conceptu share vocabulari natur vocabulari inform commun highli special share commun situat demand explic explan terminolog inform ontolog larg extend explic good choic overcom problem definit plai import role scientif conceptu model domain nowadai system analysi relat field softwar reli conceptu model commun structur detail problem domain solut domain expert engin promin exampl ontolog commun diagram model languag uml uml serv build plan data system guid process build system ontolog descript inform system benefit ontolog identifi requir inconsist chosen design acquir search inform system compon specif mainten sion challeng applic specif exist softwar ontolog serv basi decid exist compon match requir task depend ontolog formal strength express util process commun design acquisit addit inform benefit inform express ontolog direct search inform strict specif limit vocabulari limit comput effort support semiautomat softwar challeng applic requir express ontolog high level formal strength discuss provok impress benefit ontolog limit system analysi design import applic area ontolog integr exist system abil exchang inform run valid import topic attempt provid suffer problem similar commun inform commun import differ actor peopl perform abstract common reason mean machin order enabl machin understand explic context system higher level formal ontolog order provid serv common format data interchang system system transfer data inform common framework achiev explicitli contextu knowledg translat process semant mapper support integr heterogen inform sourc explicit descript semant sourc requir wai ontolog central sourc relat common domain decentr sourc relat hybrid sourc relat ontolog vocabulari ontolog stem common domain ontolog common domain ontolog describ semant domain sim mediat global domain model approach term domain arrang complex structur inform sourc relat term global ontolog articul axiom scalabl fix static common domain model low kind inform sourc integr futur limit observ predefin ontolog inform sourc exist inform sourc easili ad remov comparison heterogen ontolog lead ontolog vocabulari ontolog sourc graph graph transform rule transport inform ontolog ontolog rule solv schemat heterogen ontolog hybrid approach sourc relat sourc ontolog order make sourc ontolog common global vocabulari organ common domain ontolog hybrid approach biggest flexibl sourc easili integr contrast decentr sourc ontolog remain compar section describ ontolog solv heterogen problem approach chapter method achiev semant approach semant translat enhanc solut reconcil heterogen problem acquisit phase desir inform provid network integr inform sourc acquir includ acquisit sourc descript sourc integr knowledg describ inform transform sourc queri user applic formul queri integr view sourc special compon queri phase acquir select desir data inform sourc transform structur context queri softwar compon phase structur semant level compon level deal heterogen problem compon queri phase solv heterogen problem compon acquisit phase sourc provid specif knowledg compon queri phase mediat structur reconcili structur heterogen problem mediat configur set rule describ structur transform data sourc rule acquir acquisit phase rule gener import characterist architectur semant type tool exist solv semant heterogen problem demonstr focu provid solut type problem type tool reconcili semant problem difficult support hybrid architectur compon combin section describ phase compon detail queri phase queri phase user submit queri request data sourc network integr data sourc queri phase compon level interact fig syntact wrapper establish commun channel data independ specif file format system implement gener wrapper cover specif gener wrapper exist odbc data xml data specif gi format gener wrapper configur specif requir data sourc mediat structur level inform obtain wrapper integr gener mediat configur transform rule definit rule rule describ declar data sourc integr transform data structur origin sourc semant tool special solv semant heterogen problem tool context transform data wai context transform appli function context transform context transform function context data applic predefin function function declar repres context transform rule describ transform applic function context transform rule invok engin function context transform figur queri phase architectur transform area measur area measur transform coordin system context transform rule mathemat function function context classif data context util automat map concept data sourc concept data sourc context descript ontolog descript data obtain complet data inform relat descript context data simpli replac data annot relat context data replac transform catalog exchang term sourc catalog term goal catalog queri demonstr queri phase interact compon real world scenario present typic engin public involv kind urban plan process basi work set digit map gi manipul map engin set map environ stand offici german inform system relat map topograph inform data sourc offer detail inform respect type urban rural area germani data set gener maintain work group public agenc feder state level complex task data set underli administr delai product deliveri updat map engin applic work map show discrep respect featur observ realiti engin tool compar potenti inconsist recent order defin potenti problem area land cover data base provid satellit imag european commiss carri programm inform result essenti correspond aim inform system state environ european commun creat seri data base describ environ european data base background inform nomenclatur methodolog develop carri refer area concern commun level systemat effort made concert activ bodi involv product inform intern level result group intern scientist work target share pool theme inform technolog semant integr section appli facilit task typic user interact system queri phase user start queri nativ gi tool map defin paramet properti format origin area interest coordin system inform request attribut data submit queri network integr data sourc queri match central network made particip data sourc cover area interest hold inform attribut list compat data sourc creat send back user user select data sourc queri system engin select set satellit imag system consult central retriev basic inform access select data includ inform structur detail rule access exchang data sourc inform select configur suitabl wrapper repositori gener wrapper wrapper properli suitabl mediat select repositori gener mediat describ field hold request inform field hold wrapper direct connect select data individu instanc data access context transform sourc context queri context mediat queri transform area measur area measur transform queri context map attribut polygon select area interest make consist classif scheme context transform perform mediat reject data result process map select area show data framework engin overlai origin set map map appli regular gi tool make area map inconsist satellit imag updat data acquisit phase queri fact sourc descript integr knowledg acquir step data acquisit phase consist gather inform data sourc integr inform store data sourc descriptor csd creat data sourc particip network integr data sourc figur data acquisit phase architectur sourc descript csd consist meta data describ technic administr detail data sourc structur syntact schema annot csd sourc detail descript concept store data sourc csd attach respect data sourc highli interchang format easi data exchang comput network set csd task domain specialist creation mainten specif data sourc special tool repositori gener ontolog tediou task set csd support tool examin exist similar sourc gener similar part domain specialist verifi eventu modifi add csd sourc acquisit tool creation simplifi integr knowledg step data acquisit data sourc ad network integr data sourc order data sourc exchang data data sourc integr knowledg acquir ik store central part network integr data sourc ik consist separ part specif knowledg compon queri phase rule gener creat rule mediat wrapper configur inform sourc order adapt gener wrapper heterogen sourc creat ik task person oper maintain network integr data sourc due complex ik integr multipl heterogen data sourc unavoid semant accomplish task automat acquisit ik support tool acquisit tool inform store csd part ik human oper make final reject summari order make gi problem solv argu problem divid level semant level opinion crucial note problem gi solv solut level integr work solv heterogen problem separ approach compon task level concept solut problem compon exist system wrapper syntact mediat structur context transform rule engin classifi semant level corba low level middlewar commun compon wrapper wrapper shape file develop mediat fact classif reason prototyp system attempt solv heterogen problem mention lot work area refer formal reusabl knowledg model compon knowledg acquisit adv informationssystem bonn queri process sim inform mediat advanc plan usa aaai press beneventano intellig techniqu extract integr heterogen inform workshop intellig inform ijcai sweden role ontolog model geospati volum print institut für universität semant complet algorithm subsumpt classic descript logic structur foundat semant net intern journal resourc descript framework schema specif technic report tsimmi integr heterogen inform sourc ipsj page resourc integr larg knowledg base carnot ieee land cover technic european european topic centr land cover introduc system research institut usa framework classifi metadata workshop ai inform wi knowledg interchang format version refer manual report knowledg system laboratori ksl stanford support portabl ontolog ksl report stanford translat approach portabl ontolog specif knowledg formal ontolog inform system foi itali io press ontolog knowledg terminolog clarif larg knowledg knowledg build knowledg page amsterdam fact page framework understand classifi applic banff knowledg acquisit system workshop cooper inform current trend chapter semant heterogen global inform role context ontolog academ press modern object chapter resolv schemat heterogen page acm press weslei publish compani classifi schemat data system ieee editor intern workshop descript logic evolut integr applic infrastructur volum lectur note comput switzerland springer dimens context space corpor editor geograph inform principl applic uk manag multipl inform sourc relationship vocabulari heterogen loss inform workshop knowledg meet integr knowledg sourc fusion ca model ontolog interdepend proc extend edbt volum lectur note comput germani springer verlag classif semant conflict heterogen system journal organiz page omg common object request architectur specif omg document object manag group mediat system base declar specif intern confer data page orlean commonkad conceptu model languag futur knowledg proc european knowledg acquisit workshop number lectur note artifici intellig springer inform integr gi geograph inform principl applic uk context model transform semant knowledg meet harmelen van practic knowledg web workshop intellig inform integr distribut process gi taylor london editor intern confer geograph inform volum lectur note comput springer ontolog geograph inform process comput submit extens markup languag recommend resourc framework schema specif recommend integr method specif mediat intern symposium applic environ page japan mediat architectur futur inform system ieee standard refer mediat mediat deal heterogen data sourc volum lectur note comput switzerland springer system prototyp view mainten workshop materi page canada semant heterogen distribut geograph sigmoid
HCI/1240 4 ieee intern confer man pp octob adapt hidden markov model asl recognit comput vision method christian vogler dimitri metaxa depart comput inform scienc pennsylvania pa abstract present approach continu american sign languag input data arm motion comput vision method object shape motion paramet extract technolog flock bird interchang obtain accur movement paramet asl select vocabulari wide vari sentenc structur paramet featur hidden markov model address effect improv recognit experi approach consist train hmm inspir speech recognit system consist model transient movement sign inspir characterist asl phonolog experi verifi approach yield recognit result introduct sign languag gestur recognit import applic virtual gestur provid natur effici interact unlik gener sign languag highli make recognit problem structur form constraint exploit context sign languag recognit good start point research gener gestur recognit problem conceiv user learn subset sign languag interact comput function sign languag recognit system facilit tediou process transcrib sign languag research facilit interact deaf hear peopl paper present approach continu american sign languag recognit comput vision method object shape motion paramet extract technolog flock bird interchang obtain accur movement paramet asl sentenc vocabulari wide vari sentenc structur paramet featur hidden markov model successfulli speech recognit obtain accur form step good recognit perform continu major problem pronunci sign influenc sign discuss approach solv problem provid result consist train contextdepend hmm inspir speech recognit system consist model transient movement sign inspir characterist asl phonolog approach perform asl primari mode commun deaf peopl unit state linguist properti sign languag larg user base earli pioneer make asl appeal choic research automat sign languag recognit arm hand movement form versatil time easiest captur aspect approach concentr sign asl make extens make method essenti accur paramet estim space import grammat notabl establish subject object ignor present problem domain manag address independ signer abil recogn continu introduct artifici profound influenc natur interfac recognit isol sign interest gestur sign languag interfac stand higher chanc accept requir user introduc unnatur follow establish terminolog spoken languag linguist applic interact continu recognit system stand chanc aid transcript sign languag paper discuss relat briefli describ data collect process flock bird comput vision method give overview hmm address problem altern result back discuss relat work previou work sign languag recognit primarili recognit isol sign recognit work neural network work appli continu asl problem explicit tempor segment solv approach care problem implicitli moham wale power glove recogn set isol sign emphasi method previou work continu asl recognit thad starner alex pentland approach extract featur input hmm vocabulari strongli constrain sentenc structur consist pronoun sequenc ann describ architectur recognit base linguist principl hmm limit result nam data input hmm continu recognit small set gestur data collect collect data dialect tabl total number sentenc collect total sign sentenc sign length collect paramet sentenc comput vision technolog flock magnet sensor system outlin method briefli subsect data collect comput vision comput vision approach consist part part consist integr approach identifi part move articul object estim shape motion set control experi approach estim shape set experi human dimens categori sign noun teacher pronoun verb win adject sad tabl complet sign vocabulari part inform orthogon posit camera algorithm deform model fit imag data activ view part consist track identifi part estim reliabl posit orient paramet orthogon posit camera allevi problem view occur unconstrain movement algorithm theorem project geometri establish correspond occlud contour point deform model model approach transform correspond gener forc appli estim rotat translat paramet figur demonstr result applic comput vision method figur fit model sign comput vision method wrist posit coordin orient featur paramet deriv posit data collect flock bird comput vision approach accur estim requir attach equip signer put burden comput resourc faster prototyp quick flock bird collect train test data flock bird consist magnet sensor capabl detect posit orient rel magnet yield accur wrist posit thing correspond coordin establish comput vision approach flock made explicit simpl align coordin system verifi interchang method run test exampl obtain vision method hmm train flock bird data hmm overview hidden markov model type statist model hmm consist state transit probabl ij transit state state discret time interv vector probabl denot probabl hmm initi state state assign output probabl distribut function probabl gener observ condit system discret continu densiti basic problem hmm problem consist estim probabl hmm gener observ sequenc algorithm solv problem time problem find word unknown data assumpt word assign individu hmm problem consist find state sequenc observ sequenc viterbi algorithm dynam program algorithm find probabl time recov state sequenc time make algorithm continu word recoveri state sequenc impli automat recoveri word boundari recognit network consist concaten word explicit segment data individu word problem consist adjust paramet hmm observ sequenc maxim algorithm estim paramet local maximum polynomi time problem correspond train hmm set label data enabl recogn futur unknown test data algorithm local perform hmm depend critic initi paramet estim algorithm appli adapt hmm asl recognit previou section data collect process gave overview theori hmm section describ hmm adapt asl recognit tempt research speech recognit make result asl recognit process aim recogn languag convei medium auditori case speech visual case asl show statist make hmm plausibl choic model wai cope context effect import differ speech signal analysi frequenc asl due spatial show suitabl unclear result research speech recognit preprocess featur vector appli asl recognit possibl natur effect asl spoken languag sequenc sign lexic sign perform repeatedli tap forehead sign perform neutral space front chest consequ insert extra movement perform lexic entri phonolog model refer phenomenon movement presenc movement greatli complic introduc great varieti movement present sign lexic form phonolog point insert extra affect pronunci adjac phonem implicitli delet delet final hold sign occur sequenc describ attempt overcom problem asl recognit model hmm attempt overcom problem consist train hmm inspir speech frequent hmm analog asl train context depend hmm train context depend model requir prohibit number small vocabulari limit train context depend account sign immedi train hmm kind model requir model cover context possibl ty left uniqu hmm train method ti transit matric output state hmm sign end similar locat determin similar locat hand lexic form determin effect ty experi show ty transit matric critic recognit accuraci entir train session scheme assign global mean varianc uniformli state reason notori difficult label boundari sign hand perform round gain reliabl initi estim ty paramet ty round hmm paramet converg movement introduc larg varieti movement hmm topolog flexibl accommod varianc length sign led gener topolog depict figur gaussian densiti diagon covari matric output probabl topolog experi figur topolog model arc skip state model variabl durat sign kind model asl inher problem linguist fail model movement properli sign basic phonet number state hmm recognit network grow roughli order number analog sign smallest unit asl topic scope paper sign number context grow order map asl vocabulari consist approxim sign clear applic problem collect suffici train data model movement problem model outlin previou limit improv led adopt radic approach tackl problem approach model movement hmm model care implicitli idea explicit model movement introduc belong limit class movement larg determin start end locat lexic form sign except hold delet order obtain class phonem model movement perform cluster distanc criterion start endpoint sign lexic form optim criterion translat directli optim distanc gaussian densiti hmm output probabl concern algorithm yield distinct phonem occur entir sentenc remain phonem train exampl merg phonem fewer train exampl close relat phonem bootstrap train procedur approach similar procedur perform paramet ty introduc hmm train run recognit network specif constrain transit path correct transit phonem topolog recognit network depict schemat figur kind model necessit hmm topolog elimin context hmm repres differ length greatli anymor chang requir remov arc skip state transient movement sign show varieti length brother friend tran tran tran figur model recognit network number state correspond cluster number requir topolog distinct sign topolog depict figur figur topolog model top model bottom model transient movement advantag movement model model close relat actual phonolog process asl step incorpor insight asl phonolog asl recognit research advantag reduc complex recognit network requir number sign lexicon number cluster found number stai small limit number save substanti bigram languag model previou subsect approach cope problem method statist languag model model probabl sign improv recognit accuraci bigram inspir speech recognit shown effect recognit accuraci kind model import task domain constrain task grammar due larg number express case sentenc structur experi bigram probabl requir larg corpu label data effect problem asl present corpu exist collect corpu import task futur research test feasibl bigram model asl comput bigram probabl restrict data set recognit network result section experi previou section approach hmm model asl recognit discuss problem perform experi measur rel merit approach experi consist run contextdepend model bigram run model bigram run model bigram model entrop hidden markov model toolkit version experi split set sentenc randomli train set sentenc test set exampl special care ensur sign vocabulari occur test set train test set experi make result compar experi combin wrist posit coordin turn polar coordin wrist rotat veloc wrist featur coordin system rel signer face face face forward tabl outcom experi word accuraci evalu criterion comput subtract number insert error number correctli recogn sign result show ignor problem fare tackl method remark result model perform slightli model bigram probabl bigram model yield bigger improv model model bigram probabl half substitut error consist hand configur paramet distinguish sign type word experi accuraci detail context independ context depend context depend model thesi model tabl result experi denot number correct number delet number substitut number insert total number sign test set group constitut larg group error noun end marker similar verb hand configur expect ad hand configur paramet improv accuraci significantli result provid evid model movement futur research expand incorpor phonolog featur make hand configur model space followup research necessit research data featur vector invari respect locat orient current lack invari complic model space acknowledg work support part nsf career award onr young investig nsf ioanni obtain comput vision sampl refer architectur sign languag recognit interpret progress gestur interact gestur workshop pp york approach gestur recognit workshop integr gestur languag pp bajcsi activ shape motion estim articul approach ieee comput societi confer comput vision pattern pp metaxa human bodi model acquisit multipl view ieee intern confer comput pp metaxa model base estim human motion base activ select ieee comput societi confer comput vision pattern pp san editor automat speech speaker advanc topic kluwer academ johnson american sign phonolog base sign languag metaxa deform applic comput graphic medic imag kluwer academ novemb nam recognit hidden markov model acm symposium virtual realiti softwar pp hong rabin tutori hidden markov model select applic speech recognit februari starner pentland american sign languag recognit video hidden markov model technic report mit media luca linguist american sign introduct washington kim isol asl sign recognit system deaf person ieee transact septemb machin recognit sign recognit sign languag workshop integr gestur languag pp woodland htk book htk cambridg
AI/1241 2 experi emerald date peter neumann phillip porra comput scienc laboratori sri menlo park ca usenix workshop detect network monitor santa april abstract summar emerald architectur evolutionari process emerald paper experi date appli emerald type anomali discuss address fundament import good softwar engin practic import system architectur attain gener futur evolv consid import correl distribut hierarch instanc addit detect analysi compon introduct emerald monitor enabl live environ anomali detect subsequ analysi behavior system network emerald develop contract number appli contract number emerald goal broad rang threat secur anomali detect involv recognit deviat expect normal detect involv detect type term encompass suggest detect broader scope emerald emerald emerald target extern intern threat agent attempt system network resourc advanc highli environ combin statist analysi compon resolv interpret analysi iter hierarch modul design independ dynam easili broadli design scale larg object includ achiev innov analyt rapid integr current network greater flexibl surveil network configur chang emerald emploi architectur strategi independ tunabl distribut surveil monitor detect respond malici activ local form analysi hierarchi basic architectur structur shown figur figur show main type exist analysi unit signatur surround resourc object show integr includ input deriv output analysi platform administr emerg center architectur explain text kei aspect approach introduct emerald monitor emerald monitor dynam deploi administr domain provid local analysi infrastructur router secur modul configur resourc object resolv secur modul extern secur modul profil signatur infer monitor api monitor api monitor boundari engin engin monitor api event stream monitor api monitor api monitor api api monitor figur gener emerald monitor architectur vice subsystem network emerald monitor interact environ passiv activ log network activ probe supplement normal event monitor produc analyt dissemin result asynchron client monitor client monitor oper domain correl result correl result produc domain emerald layer analysi hierarchi form support recognit global threat includ coordin attempt destroi connect equal emerald requir adopt analysi hierarchi monitor stand analysi interfac share receiv event data analyt result secur servic emerald monitor capabl perform signatur analysi statist anomali detect target event stream monitor includ instanc emerald countermeasur engin capabl fuse alert analysi engin invok handler counter malici activ statist subsystem track subject activ type statist variabl call categor discret continu numer traffic intens volum event distribut emerald signatur analysi subsystem emploi variant expert system expert system administr instanti rule set custom detect occur analysi target result statist signatur engin forward monitor resolv act coordin monitor extern report system implementor monitor polici fundament emerald design abstract analysi semant monitor code base emerald monitor inform resourc item pluggabl configur librari resourc ject encapsul analysi semant instanti singl servic distribut observ point network element custom monitor analysi data event collect analyt modul valid subscript list extern modul monitor exchang alarm inform enabl spectrum configur lightweight distribut monitor central analysi platform servic monitor independ distribut analyz activ multipl network servic network element resourc object develop analysi target emerald monitor deploi instanti resourc object ftp resourc object ftp resourc object solari kernel monitor code base analysi emerald monitor target thing modifi content resourc object paper porra discuss analysi ftp exist paper specif exampl rule fail buffer syn flood attack resourc object lend kei project object reusabl fast integr environ project develop librari popul resourc object built analyz servic network element instal emerald monitor code touch download resourc object analysi modifi instanti monitor download resourc object project work techniqu alarm correl manag analyt servic concept surveil emerald aggreg independ monitor effort isol common trend alarm sequenc global threat aggreg classifi gener common alarm sequenti trend common detect involv search common alarm indic produc independ event result monitor occur threshold warrant individu combin result monitor warrant global approach address distribut attack cooper widespread contamin effect analysi refer effort independ analyz target multipl perspect analysi web server audit log conjunct web network alarm refer emerald abil monitor model interrelationship occurr alarm independ analysi target alarm activ observ host domain give rise warn indic threat host domain sequenti trend alarm seek detect pattern alarm domain pattern aggress activ warrant global counteract achiev local servic monitor emerald project repres effort combin research distribut event correl decad research engin experi repres attempt develop architectur inherit analyt techniqu detect cast framework highli scalabl larg network infrastructur inher gener flexibl term monitor analyt tool custom task suggest emerald readili extend monitor form malici varieti close network environ experi gain section summar experi emerald develop earlier experi emerald drawn earlier experi develop id detect expert system successor id peopl awar earlier summar ffl attain flexibl runtim effici adapt emerald pluggabl framework compon approach prove rule easi write adapt alan previou incarn mida id gave gener statist begun earlier project ffl develop observ influenc emerald effort audit data unix natur suit analyt sourc data desir greater abstract experi higherlevel audit data manag system close attempt detect fruit secur polici dbmss gener permit closer accept behavior recogn statist detect system configur scale distribut network reason measur treat subset desir lightweight instanc result form instanc recogn import administr observ complex unavoid flexibl detect requir initi spent effort develop gui decid reli newli develop gener tool progress faster emphasi softwar engin applic ffl safeguard effort observ profil function prove effect profil individu user approach result fewer tend stabl result rate reduc conclud statist effect deal system subsystem server router emerald subsequ broaden statist algorithm improv handl network master profil client usag singl servic compar anonym ftp session simultan profil master profil anonym observ impact emerald architectur move distribut network target environ emerald experi underli gener infrastructur uniformli wrap signatur statist futur engin integr infrastructur common emerald secondari storag manag statist intern configur control statist compon integr librari infrastructur assembl emerald statist compon prove gener attempt integr emerald expert system integr infer engin requir linkag code bind underli emerald automat gener part compil process year develop experi summar ffl gener approach attempt solv difficult problem typic avoid optim approach assumpt decoupl gener concept simplifi reusabl compon enhanc integr data analysi capabl hierarch iter natur permit broader scope network distribut system advantag approach evid emerald wide extend applic firmli instruct perspect research develop potenti major longterm advantag optim deem ffl softwar engin strong emphasi good softwar engin practic emerald substanti enabl rapidli incorpor analyt engin gener framework modular integr expert system compon discuss emphasi improv gener evolv benefit respect independ develop analysi analysi data arbitrari term distribut analysi result emphasi facilit iter emerald analyt engin make layer instanc system symmetr benefit remain demonstr explicitli extens expect high fuller justif extent softwar engin approach pai requir detail descript scope workshop descript high prioriti list futur ffl scope applic attent softwar engin simplifi broaden emerald domain applic respond potenti threat fault network manag stabil emerald architectur implement limit applic applic requir secur basic matter write modifi relev resourc object configur system expect requir major exist analysi infrastructur ffl rel merit paradigm commun analysi good detect identifi welldefin limit detect hitherto unknown attack happen trigger exist rule statist analysi effect detect unknown attack provid earli warn strang statist approach natur contribut autom identif diagnosi natur attack type deviat identifi infer drawn natur base statist measur reason typic identifi natur anomali attack threat system surviv aim detect potenti unforeseen threat specif scenario easili detect statist compon expect turn posit emerald necessarili problem effect resolv discard statist anomali deem reduc posit statist compon requir greater knowledg potenti threat attack threat desir add rule rule base type analysi expert statist addit analysi area greatest paradigm cover type threat approach infer reason bayesian paradigm applic resolut natur anomali attack ffl distribut correl observ relat import correl local result target platform layer correl result relat aspect system behavior inher layer iter natur emerald architectur analyt compon layer abstract begin conduct experi demonstr power approach extend exist emerald resolv interpret result analyt engin recommend specif layer abstract analyt engin requir layer reason tool ffl import prototyp emerald continu explor advanc id analysi infrastructur advanc requir emerald relat infer enhanc correl analysi coordin attack interdepend anomali distribut gener applic secur ongo effort ffl common detect format ongo ietf standard effort import expect analysi system emerald line compat expect problem interfac definit base architectur decomposit align close emerald monitor design emerald compon function emerald statist signatur analysi engin function emerald resolv function hierarch emerald servic layer monitor capabl pass alert domain monitor servic layer monitor oper domain monitor oper work document onlin emerald expert system respect specif integr emerald experi strongli reinforc conceptu framework ffl softwar engin qualiti emerald monitor architectur put test summer visitor unfamiliar system join integr signatur analysi engin gener monitor framework statist anomali detect engin develop concert emerald signatur engin addit compon api integr procedur rapidli minor problem discov solv due constraint tool emerald api support claim emerald api suit integr kind modul monitor architectur excit import develop effort ffl natur emerald monitor make central function api programm provid set abstract data includ set method handl messag field messag power featur emerald messag format possibl defin messag field arrai messag field programm effect encapsul emerald messag insid capabl includ origin event alert messag addit inform provid trigger rule hierarchi analysi unit pass inform produc earlier ffl gener api respect abstract data type reflect write util interfac code connect expert system monitor util redirect engin complet event inform resourc object fit engin analysi target util reliev creator resourc object work monitor api design made easi isol code progress date develop emerald effort demonstr effect softwar engin approach power analyt capabl ffl softwar engin practic emerald modular design attent devot interfac inform hide david proven valuabl emerald develop valuabl abil compon develop subsequ gener emerald secur applic address human critic attribut ffl hierarch distribut correl analyz highli distribut inabl recogn global pattern isol local event addit analysi techniqu requir ffl iter natur emerald instanti enabl lightweight detect compon special area event space layer abstract gener note attempt put emerald experi perspect ffl commerci system concentr string match form signatur identif detect class attack primarili easi part problem address commerci commun ffl research advanc commun larg emphasi detect type attack respond hitherto unknown attack anomali remain challeng includ highli coordin subtl form network behavior result malfunct provid global local analysi import research area gener secur attack challeng inform background onlin version paper report web page porra neumann acknowledg indebt martin keith al contribut significantli emerald develop grate peopl work develop id influenc includ notabl lunt charl antonelli made suggest serv offici workshop shepherd refer vald expert system technic comput scienc sri menlo vald safeguard final detect unusu program behavior statist compon technic comput scienc sri menlo decemb tf hs pg vald system design expert system technic comput scienc sri menlo march hs vald statist compon descript justif technic comput scienc sri menlo march hs de pg neumann analyt techniqu develop statist system base account record technic sri menlo juli pa porra detect comput network expert system toolset symposium secur ieee comput societi tf pg hs vald expert system technic comput scienc sri menlo februari pa porra pg neumann event monitor enabl live disturb nineteenth nation comput secur page octob pa porra vald live traffic analysi gatewai symposium network distribut system secur internet march mm ra expert system case studi eleventh nation comput secur octob
IR/1242 5 select text span document heurist metric mittal mark jade goldstein jaim carbonel research languag technolog institut henri street carnegi mellon pa pa usa usa abstract text summar system difficult difficult part document differ write style lexic usag cue suggest select sentenc summari paper present analysi summari gener sentenc extract sentenc rank potenti summari weight combin linguist featur deriv analysi summari paper evalu rel effect featur order discuss construct larg corpu underli difficulti summar compress level articl corpu result featur set present normal difficulti introduct summar difficult task comput requir natur languag abstract gener effect effect easi skill develop instruct practic write summari requir summar order aggreg item inform relev subject previou work summar delet delet refer extract system attempt delet span text origin text remain deem summari origin document previou work summar base statist techniqu frequenc varianc analysi appli linguist unit anaphor inform morton kennedi aon al carbonel goldstein hovi lin bucklei involv approach attempt copyright american associ artifici intellig reserv structur combin inform extract languag gener shaw machin learn find pattern text elhadad wise difficult compar rel merit approach evalu report conduct vari size vari level inform subject paper discuss summar sentenc extract make base corpu approxim identifi syntact linguist featur rank evalu featur test set analysi level discuss difficulti inher corpu task evalu effort normal score obtain corpora rank text span select select paradigm transform problem gener case requir abil abstract gener rank sentenc origin document salienc likelihood part kind summar close relat gener problem inform document document set sentenc order retriev relev document rank import requir defin granular metric rank span salienc advantag paragraph minim unit span conform vast major previou work sentenc level choic document summar analyz vari level sentenc rank region document level summar text genr articl equal import multipl occur scientif book sentenc assign initi score base score depend properti independ content length lexic syntact relat hold sentenc individu sentenc rank featur independ actual length content specif featur base number anaphor function phrase word rank featur focu part speech featur comput analyz rel util user make inform ratio combin context build system experi section list featur evalu discuss result detail data properti featur corpu document summari level compress requir experi summar method summar perform vari significantli compress level algorithm summar perform level compress suggest experi evalu summar conduct varieti compress report manner similar score inform retriev mcgill conduct collect corpora data model creat data set suppli part tipster train set question answer task data set formal evalu data set consist document summari summari sentenc extract document answer question document concern small size data set uniform summari compress acquir larger data set consist summari reuter lo angel time analysi cover approxim summari period varieti topic health entertain statist averag length stori summari randomli chosen subset shown tabl summari dataset directli gener sentenc extract convert summari extract summari conduct analysi syntact lexic properti handwritten extract match sentenc summari smallest subset sentenc stori kei concept mention sentenc autom match process defin threshold minimum number concept noun requir match detail inspect set sentenc transform highli document genr articl approach simplifi version text align problem align languag success techniqu depend consist vocabulari usag articl fortun true articl applic techniqu document genr depend lexic distribut pattern summari requir knowledg synonym provid wordnet detail work found al transform result summari length summari emploi complex syntact sententi pattern multipl stori sentenc cover singl evalu metric recent attempt defin evalu criteria extens organ tipster program tipster motiv partli difficulti evalu rel merit summar system perform measur summari gener ident document ident charact compress level evalu recogn fact corpora yield result inher properti document type document structur main topic extract sentenc form reason random extract sentenc document long compar perform heurist algorithm summar essenti understand underli difficulti corpu perform random sentenc select randomli select subset approxim articl lo angel time christian scienc compress summar score report model reuter lo angel time properti summari summari summari task gener summari gener summari sourc tipster human extract human extract number doc averag doc median sentenc doc maximum sentenc doc minimum sentenc doc summari doc length summari includ sentenc averag summari size median summari size typic summari length tabl characterist data set summar experi ferent wrongli infer algorithm vari wide perform test evalu document import state baselin perform expect corpu directli relat previou desir compress level gener summari compress level easier gener summari compress level current method evalu summar measur summari properti absolut mcgill measur compar summar perform common improv summar solut problem deriv rel measur summar qualiti compar absolut perform measur theoret baselin summar perform adjust perform valu obtain normal chang perform rel baselin improv rel baselin baselin perform adjust perform calcul baselin defin summari absolut perform summar algorithm randomli select sentenc summari measur expect amount overlap summari total number sentenc number sentenc target number sentenc select denot probabl select sentenc set relev sentenc product number wai select sentenc relev multipli number wai select remain sentenc divid number wai select sentenc sentenc document dr sr dr dr sr sr expect number relev sentenc dr sr dr dr sr dr sr deriv dr sr sr formula relat fourth easili calcul baselin calcul averag corpu statist averag document summari number relev sentenc reuter articl valu relev paramet yield baselin score approxim compress level similar comput baselin score desir compress level vice experi summari length corpu independ document narrowli distribut approxim sentenc compress ratio document length elabor nucleu satellit elabor nucleu satellit elabor nucleu satellit elabor nucleu satellit britain queen elizabeth fridai death diana make difficult speech address nation damag famili mood sad diana address queen repair appar failur adjust public death sundai car crash pari word statement clue state famili diana view death head figur structur stereotyp stori suggest common practic fix compress ratio evalu constant summari length natur experi evalu featur conduct identifi pair level compress rang dataset summari upto length origin larg summari begin approach origin restrict comparison summari half length origin articl compress randomli select pair pair split train articl analysi held test summar invok articl paramet length summari gener length origin summari articl overlap gener summari origin summari measur wellknown measur inform retriev enabl measur summar perform level compress reduc valu number report comput averag score interv tabl end section point score rest section discuss featur start largest granular level document move smallest document level featur summar argu structur sourc inform summar argument base theori span text document thompson problem summar document address select averag score compress ratio topic boundari detect summar long document random sentenc select summar boundari detect summar boundari detect summar boundari detect summar boundari detect figur effect topic detect abstract span desir summari length reach util approach effect illustr document select sentenc stori result summari stori written structur stereotyp structur partli due fact page column layout newspap time articl articl chop show select sentenc newswir stori approxim select top span text approach perfect stori emploi perfectli find underli structur difficult gener good summari consid simpler version find underli segment text topic boundari system experi segment system result approxim segment repres approxim top level minu knowledg relat repres note segment carri yield approxim boundari hierarch approxim structur inform posit length rel augment inform finer level detail segment increasingli import document grow length complex averag confer paper word time longer averag articl reuter corpu make inform level yield advantag evalu tradeoff document find topic creat synthet experi exist corpu longer document standard test creat composit document concaten articl length number larger document distribut summari composit document assum collect sentenc summari individu experi found preprocess topic boundari significantli improv qualiti summar factor factor base averag score averag compress level normal baselin actual improv depend length complex origin document summar algorithm approach maximum util base approach select approach analog relat work summar aim reduc redund goldstein approach attempt select summari sentenc topic area explicit topic segment step figur show effect identifi topic boundari summar algorithm base approach rank base combin syntact complex relationship sentenc posit inform sentenc level pattern summari sentenc heurist select summar sentenc level includ featur length presenc themat essenti understand rel advantag featur specif featur vari wide comput cost subsum sentenc level characterist cue summari syntact analysi summari sentenc found sentenc includ summari differ sentenc characterist relat complex np found averag length complex noun phrase summari sentenc research report experi confer paper problem abstract scientif paper gener scientif paper abstract written technic peopl necessarili skill conduct experi suffici larg number document compress level report averag score compress ratio featur effect sentenc select summari random sentenc select sentenc paragraph sentenc syntact complex neg inform connect np word figur featur effect reuter dataset long sentenc coordin neg dataset possess higher densiti coordin conjunct stori sentenc summari sentenc densiti entiti repres word compar word summari greater densiti sentenc sentenc averag number proper noun sentenc summari sentenc document averag densiti proper noun number proper noun divid number word summari compar document summari sentenc averag compar word document sentenc summari sentenc greater proport proper noun document sentenc punctuat symbol count tend frequent stori sentenc compar summari sentenc simplifi analysi inform presenc definit indefinit found summari includ inform frequent sentenc summari sentenc tend start articl frequent sentenc tabl show token frequent summari anaphor refer sentenc good sourc neg possibl sentenc introduc topic person pronoun good sourc tabl comparison word occurr summari sentenc sentenc calcul ratio subtract repres percent articl reuter la time tabl effect sentenc level heurist raw score normal score reuter la time featur set raw raw complex densiti synonym densiti fn syntax fn fn fn sd neg evid summari frequent occur quot statement densiti relat word multipl relat term document hypernym summari figur illustr effect featur compress level reuter dataset note featur import averag scheme occur small percentag sentenc summari individu effect summari tabl show averag perform featur summar select sentenc shown effect tabl perform summar featur combin heurist tabl raw normal score raw score dataset vari wide normal score closer reflect note includ punctuat inform inform featur diminish likelihood summari featur combin posit featur tabl featur left ness featur level pattern summari sentenc addit featur document sentenc characterist level rank sentenc word reuter summari lo angel time summari greater averag word length averag word length articl sentenc commun word phrase common direct indirect quotat suggest sentenc exampl word occur frequent sentenc includ verb relat commun themat phrase occur frequent summari sentenc found total term occur frequent summari sentenc sentenc inform term significantli frequent sentenc sourc neg lexic found neg due fact articl introduc peopl subsequ refer formal written digit word evalu qualifi analysi found cue select summari sentenc figur show effect featur relationship random baselin small summari featur baselin summari effect individu featur start fall featur anaphor refer dangl connect occur small percentag sentenc outstand line case posit discuss implicitli advantag underli structur stori discuss essenti understand rel cost benefit featur import understand rel effect combin featur result base combin tabl effect word level heurist reuter la time featur set raw raw phrase complex themat phrase misc featur infer orthogon interdepend featur space techniqu search weight linear combin featur experi understand approach futur work text summar system difficult difficult result report research project difficult compar report result discuss characterist corpora experi conduct characterist effect evalu measur argu specif sentenc result varieti compress result research paper present discuss sentenc select heurist granular level conduct experi evalu effect heurist largest corpu summari report experi segment complex document paper show advantag fine grain lexic featur rank sentenc result work report metric combin score compress level account corpu difficulti task futur plan document attempt achiev understand phenomena plai role sentenc select genr phenomena role distinct refer scalabl summar system robust nlp mani mayburi dynam summar confer gener summari text align submit pac rim conf comp linguist lexic chain text summar mani mayburi salienc base content text document mani mayburi automat electron public sentenc select info proc manag rerank reorder document produc summari segment expositori text annual meet acl autom text summar mani mayburi lexic semant summar annual workshop ifip work group nlp kr ed workshop intellig scalabl text summar rhetor structur function theori text organ text structur text summari mani mayburi design evalu model summari gener info proc manag automat text summar paragraph extract mani mayburi introduct modern inform retriev comput scienc seri model automat technic cambridg england robust practic text summar system aaai intel text summar sentenc extract classif task mani mayburi tipster tipster text phase iii workshop note va coher emphasi helm
IR/1243 5 method inform qualiti criteria felix naumann claudia zu berlin forschungszentrum informatik den linden berlin karlsruh germani germani abstract inform qualiti import aspect inform integr internet project realiz address fact gather classifi iq criteria project address difficulti assess score criteria task usag criteria qualifi integr inform review previou attempt classifi iq paper classifi identifi sourc iq score iq criterion gener assess possibl criterion give detail assess method confid measur method confid express credibl individu assess method introduct low inform qualiti press problem consum inform distribut autonom sourc true entir rang casual user www inform servic maker intranet obtain data depart measur low qualiti clear project method enhanc inform qualiti data qualiti approach lack method suggest assess qualiti score place iq assess consid difficult iq criteria subject natur assess independ user inform sourc autonom publish possibl qualiti metadata sourc measur hinder iq assess research support german research graduat school distribut inform system grant enorm amount data assess assess entir inform set sampl techniqu assess score inform autonom sourc subject content qualiti reliabl sourc iq score inform sourc iq metadata made sourc competit sourc method independ assess iq metadata effici assess autom main contribut paper identif sourc iq queri process metadata sourc correspond class assess method class discuss gener iq assess give special exampl set iq examin issu confid assess iq score relat work research project tackl problem assess score inform qualiti criteria wang al present inform qualiti assess methodolog call design organ assess statu organiz inform qualiti monitor iq improv time consist compon compon model divid fix set iq criteria class model assess demograph space comment develop questionnair organ answer respond organ respond focu answer specif set inform import organ compon consist analysi compar questionnair result stakehold inform manufactur compar questionnair result organ practic organ techniqu execut iq criterion class separ al present methodolog measur data qualiti organ list iq criteria set iq criteria divid directli indirectli assess criteria score indirectli assess iq criteria comput directli assess iq criteria order assess direct criteria tradit softwar metric techniqu appli techniqu measur data qualiti directli assess question set criterion metric deriv answer give evalu qualiti metric user questionnair set base sampl approach al reli questionnair find iq score assess method inevit mean choic criteria autom method assess averag time sourc price inform determin autom techniqu assess data accuraci paper criteria assess automat criteria determin hand questionnair motro address specif complet inform sourc author autom assess method base sampl sourc present reli human input verifi inform correct al address detail time author suggest predict tool learn time www inform sourc dimens time dai quantiti data structur paper section present exist classif iq criteria describ philosophi present classif classifi set classif section assess method assess class examin detail section analyz assess class respect gener valid paper conclud section includ definit list iq criteria appendix classif attempt made compil classifi inform qualiti criteria section review attempt identifi type give hint assess method criteria review present classif divid criteria sourc criteria score exist classif compil list inform qualiti criteria project analyz inform qualiti discuss project pai special attent classif attempt identifi kind classif call classif sole base mean criteria classif intuit criteria examin gener separ inform framework classif partit iq criteria phase inform process classif match goal reach qualiti reason review classif iq project summar tabl total data qualiti manag project aim provid empir foundat data qualiti wang strong empir identifi fifteen iq criteria regard data consum import author classifi criteria class classif base semant criteria describ criteria assess classif criteria inform system base criterion set criteria adapt queri plan process step phase criteria emploi plan phase view criteria emploi present attribut specif criteria call classif author develop classif distinguish criteria author classif call classif class directli map queri process step mention previou item data qualiti project base criteria author defin oper qualiti goal data classifi criteria goal describ valid call classif framework judg qualiti reliabl term access author give list qualiti criteria special classif criteria point view exact descript assess chen author give list qualiti criteria special classif paper heavili criteria time network delai approach requir survei compil iq criteria mention project find classif class project classif weikum dwq chen al requir survei set classif mention classif undertaken goal mind argu project avoid difficult issu qualiti assess touch briefli goal paper find classif gener classif discuss assess issu order guid creator assess method establish method possibl criteria low section identifi class partit iq criteria possibl assess score iq class qualiti inform influenc main percept inform process access inform factor predic queri factor sourc iq iq criteria score user import sourc iq metadata user decid inform qualit good user provid valuabl extrem subject criteria understand exist assess method sole reli user provid iq score obtain user input time consum time argu user input criteria criteria inform sourc origin iq score sourc suppli criterion voluntarili price complet sourc automat metadata iq score queri process access inform sourc iq score criteria time automat assess input user inform sourc sourc metadata correspond iq criteria class shown figur distinguish class give figur sourc iq criterion score inform qualiti criteria score determin individu user base person background sourc score individu user global accept score repres understand score object inform qualiti criteria determin care analysi inform sourc score inform repres complet score determin process queri sourc score actual queri process score fix vari queri queri score object temporari repres time tabl list set iq criteria class iq criteria unifi iq criteria iq criteria list definit iq criteria appendix tabl classifi iq criteria assess class special assess method criterion explain method detail section assess class iq criterion assess method believ user experi user sampl interpret user sampl subject criteria relev continu user assess reput user experi object criteria process criteria understand user sampl continu user assess complet sampl custom support contract document object expert input price contract reliabl continu assess secur verifi expert input accuraci techniqu amount data continu assess avail continu assess consist latenc continu assess time continu assess tabl classif iq metadata criteria assess method section discuss difficulti assess score inform qualiti criteria describ gener assess method tabl practic assess iq criteria difficult task assess practic conflict goal difficult achiev assess result retriev low qualiti inform lead avoid high qualiti inform impract assess result assess lead undu assess time cost iq score reflect realiti problem definit criterion defin criterion assess problem distinct criterion score individu entir group obstacl amount time user iq assess time user spend assess score object vulner layout format inform sourc due size sampl techniqu strongli depend sampl size sampl techniqu score prone typic declin time determin assess method practic algorithm trust user easi maintain assess method understood user easi adapt sourc requir note user spend time sourc qualiti assess simpl questionnair possibl default score user chang mind assess updat score practic assess costli time method appli regular basi score argument appli queri process entir queri process delai user satisfi score unit rang correctli usefulli assess iq system design user unit measur criterion rang score lie difficult identifi unit understand obviou grade great care assign defin typic user assess unit criteria user assign proper score rang criterion score clear user typic rang percentag score criteria expert input appli criteria price unit rang clear unit rang process criteria deriv criterion criteria time latenc measur avail unit rang deriv manner rang percentag assess defin section assess individu user specif inform system individu iq score profil user subject criteria assess import suppli user exact definit criterion assess definit definit made defin understand graphic layout mention guid user definit user give assess wrong aspect sourc give rang score section discuss problem commun rang provid exampl typic good bad case guid user qualiti exampl visibl criterion assess system support assess provid default valu guidelin user user provid individu default score default score guidelin user system administr default averag score user tabl mention method assess user sampl continu user assess method support design questionnair user user experi user appli experi knowledg sourc includ experi sourc method unnecessari sourc sampl inform user appli method user sampl result inform sourc simpli result user find iq score criterion assess sampl perform regular basi sourc undergo relev system support process suggest assess continu user user user sampl inform read inform continu assess analyz inform receiv sampl method time consum reward appli criteria score inform predict futur score extrem difficult imposs find repres sampl inform assess score assess user expert input www inform sourc score obtain main page sourc score subject chang score assess term contract sourc inform consum price support determin agreement term valu expert assign score criteria sourc valuabl tool assess criteria distinguish structur content structur discuss section content consid actual inform content inform inform sourc aspect presenc document custom support gain search inform link aspect secur inform assess analyz protocol inform deliv concern entir content inform sourc assess entir content consid avoid possibl costli sampl techniqu appli sampl techniqu repres subset inform qualiti assess expert human expert assess criteria expert follow guidelin compar score expert input method assess fact expert human prone assess score subject due sourc object explain section criteria find repres sampl problem cover paper assess expert input assess human expert find score continu criteria assess continu check inform sourc criterion true reliabl process criteria discuss section assess score measur statist deriv previou data sourc knowledg technic equip softwar data sourc determin criterion score accuraci data qualiti subject research project impact data error data mine method data rise data method method identifi elimin varieti data error identif techniqu count error assess data qualiti continu criteria underli frequent depend aspect latenc heavili depend net load time dai criteria avail depend hardwar softwar aspect inform sourc continu assess measur qualiti score regular interv score ad histori statist method provid time qualiti score simpl statist measur averag score entir histori sophist method ag qualiti score add weight recent assess score explain previou distinguish structur structur appli consid structur inform posit presenc graphic confid iq assess method score iq confid score due score determin import notic awar independ score comparison inform sourc inform goal select inform find improv determin aggreg qualiti basic confid order gain amount confid score detail descript assess method actual assess implement true independ assess method full inform assess assess inform sourc tend chang data gather iq score ag older confid user kind method assess essenti confid score basi assum full confid valu gain class assess method uncertainti discuss class assess sourc low remedi confid sourc low confid score person assess qualiti score subject criteria strongli depend kind uncertainti result score repres realiti person assess qualiti good bad due absenc knowledg experi manag work inform sourc inadvert assess understand inform sourc low person assess qualiti good bad due person institut aim depart head assess understand inform sourc high show top manag good qualiti depart work person enter score subject criterion homogen heterogen group case assessor assessor part assess knowledg homogen inhomogen group influenc confid subject valu person determin score iq low confid score group assessor higher confid assum score assessor assessor averag low confid score user inform consum influenc score spend time assess confid confid high due simpl verifi detriment infrequ updat score discuss confid object criteria depend assess method iq score determin contract gain high confid parti respect case content high confid presenc facil onlin evalu content sourc low confid exist techniqu vulner inform make frequent assess import low confid score determin sampl exist part entir document sourc comput proport small sampl long ago inform sourc chang proport high confid score expert determin score iq similar sourc low confid exist assum expert assess score object manner expert assess verifi simpli verifi sampl inform object manner case continu low confid score point time assess repres assess interv larg confid confid consid depend assess method sourc low confid techniqu adjust techniqu find error techniqu sensit detect error exist techniqu sensit find exist error techniqu requir user sourc diminish confid research project examin techniqu kind success measur sophist techniqu find confid accuraci score high continu assess confid issu discuss section low confid score repeat queri process score assess queri confid queri issu present classif classif base exact method assess sourc assess score identifi assess respect user inform assess respect inform sourc assess respect queri process examin class viewpoint person set assess viewpoint person score goal realist turn assess class problem uncertainti independ assess class specif iq criteria imposs total realist true iq score import detail descript assess assessor user repeat assess regularli desir futur standard describ assess place assess evalu order ensur rule standard fulfil certifi assess similar iso worldwid unifi qualiti manag product servic applic simplifi set assess confid compar iq score refer measur qualiti report fourth annual octob monica daniel homogen framework measur data qualiti intern confer inform qualiti page ying qiang wang queri process qualiti control world wide web world wide daniela denni eric simon extens framework data clean intern confer data engin san vladimir tao learn time queri feedback applic queri optim vldb mauricio hernandez stolfo data data problem data mine knowledg jark vassili data qualiti review dwq project intern confer inform qualiti motro estim qualiti intern confer flexibl queri answer system springer verlag steve mari jane charl schroeder data data framework intern confer inform qualiti felix johann christoph freytag integr heterogen inform system intern confer larg felix naumann claudia metadata model meet iq intern confer inform qualiti page thoma data qualiti inform ag artech gerhard weikum qualiti depend inform system confer technik und richard wang dian strong data qualiti mean data manag inform richard dian yang lee inform qualiti assess methodolog intern confer inform qualiti page iq criteria appendix defin inform qualiti criteria tabl understand definit satisfi situat applic view gener avoid misunderstand notic criteria similar typic criteria time applic specif select criteria identifi qualit good inform simultan reduc assess cost descript criterion give short list synonym author express criterion synonym compil avail percentag time inform sourc perform accuraci quotient number correct valu sourc number valu sourc data qualiti inform error amount data size result essenti believ inform accept correct error trustworthi complet quotient number item number real world item extent structur inform match inform attribut occurr structur format consist structur inform conform sourc semant compat custom support amount onlin support phone document amount document meta inform traceabl interpret inform conform technic abil consum clariti simplic latenc amount time inform reach user time object inform price monetari charg queri queri relev inform satisfi user domain minimum reliabl user trust inform technic reliabl synonym avail reput inform sourc high stand credibl time amount time complet reach user time secur inform pass privat user inform sourc back access secur ag inform current understand inform comprehend user understand amount benefit inform verifi inform check correct provabl
ML/1244 6 neural network speech process mike schuster atr interpret telecommun research laboratori kyoto japan june overview paper encyclopedia electr electron john wilei neural network histor speech process applic speech speaker languag speech code speech synthesi case nn gener model learn task repres abstract learn map data structur space blind sourc separ techniqu nn commonli speech techniqu nn attent speech discuss extent articl success nn speech process limit speech recognit machin problem automat transcrib spoken word sentenc input microphon similar input devic speech recognit broad topic includ applic isol word recognit understand simpl control command continu speech recognit dictat machin write letter type spontan speech recognit part fulli automat translat system regular telephon peopl speak languag task approach practic implement base theori treat categori problem call statist pattern recognit includ speaker languag recognit problem occur speech imag time seri charact recognit categori problem solv statist approach principl learn successfulli speech recognit problem engin interest finit amount exampl train data speech recognit number record waveform reduc featur vector sequenc length frame correct train model transcrib unseen data model correspond structur number paramet combin vector estim train maxim predefin optim speech ideal percentag correct word neural network gener tool black box solv statist pattern recognit problem learn exampl sole part kind applic speech recognit arbitrari task complex process expect solv sole neural network success limit specif estim probabl jx phonem time point waveform preprocess form base local phonem probabl estim step search output word sentenc system refer hybrid nn combin techniqu hidden markov model neural network approach discuss speech recognit compet uncondit mixtur densiti estim gaussian kernel current speech recognit system dont neural system base nn number similar recognit nn system faster system tradit factor similar recognit nn system implicit paramet paramet factor lead turn system lower memori nn gener regular believ build easier hardwar model type notabl disadvantag nn base system compar tradit counterpart nn base system slightli word recognit train nn base system larg amount data complic time slower base system effort research result substanti improv list disadvantag speech recognit theori speech recognit standard statist method document book neural network speech recognit explain introduc notat context neural speech recognit problem written arg max fx input vector featur sequenc calcul observ practic system input fc valid symbol sequenc recogn symbol sequenc highest probabl sequenc valid symbol class case word recognit word list pronunci dictionari word recogn phonem case phonem recognit depend languag fifti principl usag neural network word phonem discuss limit order simplifi notat train speech recognit system principl correspond estim probabl distribut includ defin model estim paramet maxim predefin optim criterion practic model consist modul part usag train system recognit input sequenc correspond princip evalu symbol sequenc find procedur call search effici algorithm import notic symbol sequenc highest correspond symbol sequenc highest word phonem recognit defin number symbol correct number insert recogn number number found dynam program procedur mismatch accept fact doesnt problem practic system rule product rule probabl condit sequenc probabl simpl broken term arg max jx arg max jc arg max nh jx jc io arg max nh jc jc io arg max jx jc make simplifi approxim output state class depend previou state previou state make order markov jc jc featur frame assum statist independ jx jc likelihood featur vector complet symbol sequenc assum depend symbol found make model state jc jc remain probabl express jx posterior probabl phonem input vector observ estim neural prior probabl phonem frame approxim rel frequenc observ phonem frame train jc transit probabl estim count train data express jx refer scale proport real likelihood jc structur neural network estim jx train substanti part nn speech basic neural import train nn base speech recognit review neural network artifici neural network excel learn task train data data vector pair fx map input target dimens aim learn process learn predict output data input written function depend current input vector nn paramet vector weight weight combin type discuss detail input target continu categor defin categori learn problem target problem regress categor problem classif problem term predict gener term includ regress classif unimod regress unimod regress function compon output vector continu variabl nn paramet estim minim predefin error maxim likelihood output data jx distribut error desir target estim output vector assum singl gaussian fix global likelihood criterion reduc conveni euclidean distanc measur desir estim output vector minim train shown neural network estim condit averag desir target vector network expect oper paramet vector minimum error function classif case classif seek probabl class pool class input vector make kind problem suitabl solv categor target variabl code vector desir class label input vector construct target vector kth compon compon compon interpret probabl belong class target vector construct manner input vector train nn optim result maximum likelihood estim assum multinomi output distribut shown kth network output interpret estim condit posterior probabl class membership qualiti estim depend size train data complex network neural network train train neural network adjust weight iter error function case speech recognit estim jx error function function minim problem occur disciplin scienc standard procedur document usual approach neural network order deriv error function minim gradient gradient descent order deriv approxim conjug deriv error function neural network calcul effici procedur call requir forward pass backward pass network train vector pair train procedur batch weight updat train sampl calcul part train sampl estim deriv updat weight neural network speech recognit ad practic problem number paramet rang averag higher disciplin number train data vector rang million higher averag nn applic problem rule theoret superior sophist order train algorithm insuffici memori resourc complic implement algorithm practic larg scale problem order onlin gradient descent onlin procedur gradient descent train gradient descent train refer adjust weight vector iter small vector proport neg gradient procedur refin make weight chang linearli depend previou chang ae lead good valu ae depend heavili nn train data initi random small found experi onlin procedur estim gradient updat depend small part train lead larg fluctuat gradient slower train case local gradient estim smooth improv ff ff control amount smooth addit improv ff made variabl slowli train train heurist order variat research work larg scale problem idea stepsiz ffi weight individu make updat depend sign compon gradient ffi ffi stepsiz updat depend gradient compon chang ffi ffi ffi ffi good valu problem limit ffi exce critic set ffi good initi start ffi ffi number input weight neuron speech recognit problem appli onlin gradient smooth shown neural network architectur speech recognit neural network architectur recurr neural network hierarch mixtur expert briefli discuss problem common architectur radial basi function time delai neural network interest properti rare speech recognit applic type neural network discuss element neuron connect direct connect weight repres scalar paramet combin structur provid map neuron output input connect output neuron input vector output neuron function activ act activ calcul sum input neuron multipli bia weight act addit input constantli set gener treat input neuron organ layer group consecut layer fulli mean neuron layer connect neuron layer neuron output time neural network belong output belong hidden layer activ function hidden layer neuron commonli sigmoid function act act lead slightli faster converg commonli train procedur choic sigmoid activ function motiv distinct properti discrimin function classif problem make output posterior probabl class input distribut gaussian equal covari matric choic activ function output layer depend problem solv regress linear activ function act classif problem softmax function act interpret gener sigmoid classif problem common type practic applic layer hidden output layer layer proof map approxim arbitrari accuraci layer refer layer effici realiz map layer rare expect perform gain practic problem train speech common current input vector inform neighbor vector window input mlp relax independ assumpt common valu system size hidden layer gener depend amount train result million weight structur regular reduc number total weight proven improv regular mlp amount train data low compar number paramet estim achiev mean forc paramet valu paramet tie depend heavili data found experi recurr neural network applic data collect vector pair arbitrari data sequenc vector order arbitrari speech recognit typic case preprocess waveform arrai vector map arrai target class form vector type recurr neural network provid eleg deal kind problem show basic rnn architectur delai line unfold time time step input vector fed time rnn fix number input vector window mlp architectur make input inform current time frame fx predict futur input inform predict partial achiev delai output number time frame includ futur inform predict theoret made larg captur futur practic found predict result drop larg speech recognit commonli set frame delai ms possibl delai bidirect recurr neural network train rnn recurr connect slightli complic neural network mlp train procedur time rnn structur unfold length train sequenc shown time step transform rnn larg neural network regular begin end train data sequenc special treatment state input practic set local state deriv set assum input inform point import current boundari case rnn speech recognit gener paramet mlp counterpart obtain perform common hidden lead million weight hierarch mixtur expert hierarch mixtur expert provid eleg divid larg problem smaller appli successfulli speech recognit problem extens introduct scope short discuss respect speech recognit consist number expert gate combin tree structur expert network leaf gate network node output root node weight averag expert network weight factor determin gate network directli connect input structur call hierarch layer gate network gate network softmax output output interpret posterior probabl condit input vector output activ function expert network depend type problem solv case regress case network softmax output function gate expert network structur introduc simpl network part train algorithm consist correspond case calcul intermedi target vector individu gate expert complet train data set correspond solv number individu gate expert target subproblem regress classif problem regular structur mlp solv procedur variat gradient weight updat intermedi target calcul larg speech recognit record train data correspond approxim million train procedur onlin version updat vector practic experi larg report model assumpt made model valid simpl task introduc basic concept speech recognit system make sever assumpt introduc model context class hmm state model denot determin optim set context class number state model task current research issu scope articl detail procedur found refer scale likelihood time drop notat neural network base number output class combin context class state gener larg lead nn huge output layer couldnt train practic scale likelihood result term estim independ term regular scale likelihood denomin middl term term estim rel frequenc event train data numer repres classif problem condit continu input depend discret input treat addit input vector compon set depend discret input state estim term nn discret input part enlarg input vector paramet share contextdepend smaller nn discret possibl occur hand side network estim class greater control encapsul model faster execut common approach discuss system train discuss assum train data mean input vector target class case transcript includ word boundari phonem boundari complet state built increment step train acoust paramet complet system transit probabl prior involv number iter summar assign target class frame train align word transcript waveform acoust model previou iter begin acoust model initi state align hand exist speech sentenc bootstrap system calcul state prior transit probabl jc denot occur frame frame train data train nn assign target class goto chang align anymor gener found iter suffici procedur call viterbi distinct target class assign frame perform gener memori consum frame assign target class probabl acoust adapt acoust adapt refer improv acoust model data train adapt correct exact align data adapt unknown adapt dictat origin train adapt specif speaker system read text dictat system automat align text read adapt improv model base acoust evid reli recogn align complet includ error assign confid score frame recogn align express belief correct confid score improv adapt procedur nn base speech recognit system common framework adapt transform featur vector shown adapt paramet origin model paramet network chang paramet network chang simpl linear network linear transform princip nn structur adapt utter initi produc ident map run calcul output probabl jx calcul scale likelihood local scale likelihood search phonem word sequenc align complet distinct target class backpropag error target output updat weight gradient descent weight error frame confid score assign goto step align doesnt chang anymor adapt step chang align phonem word sequenc neural network gener tool solv statist pattern recognit problem base firm mathemat successfulli speech process speech recognit replac calcul observ likelihood gaussian mixtur model lead compact system paramet complex tradit counterpart improv major drawback nn larg task weight million train vector complic train procedur train dai doesnt extens experi make progress field neural network disciplin speech process benefit research complet area current issu neural network research includ combin knowledg repres data set exampl prior knowledg problem bayesian method model underli gener data accur maximum likelihood method refer adapt model paramet onlin base train data provid framework measur compar complex complet method filter organ data base statist properti data research enlarg usag neural network speech process applic refer cm neural network pattern clarendon cm gener topograph neural vol pp aj tj approach blind separ blind neural vol pp connectionist speech recognit hybrid kluwer academ ro duda pe pattern classif scene john connectionist probabl estim hybrid hidden markov model speech comput speech vol pp hybrid speech recognit cluster proc ieee int conf signal vol pp cluster hierarchi neural connectionist acoust proc ieee int conf signal vol pp xd ma hidden markov model speech edinburgh mi ra mixtur expert em algorithm neural vol pp dj mm aj class hybrid recurr speech recognit tech rep cambridg engin england springer ch fk kk automat speech advanc topic ed kluwer academ hybrid continu speech recognit proc european confer speech commun wh sa wt bp numer recip cambridg bh fundament speech technolog connectionist larg vocabulari speech tech rep cambridg engin direct adapt method faster backpropag proc ieee int conf neural pp aj applic recurr neural net phone probabl ieee transact neural vol pp kk recurr neural ieee transact signal vol pp kj recognit neural ieee tran signal vol pp figur gener structur recurr neural network shown delai unfold time time speech recognit applic figur setup acoust adapt neural network base speech recognit system input group weight inform flow output neuron group hidden neuron group delai line fix adapt nn nn
AI/1245 2 cluster optim extend compact genet algorithm sastri illig report illinoi genet algorithm laboratori depart gener engin illinoi transport build mathew il cluster optim extend compact genet algorithm sastri depart gener engin depart materi scienc engin illinoi il abstract paper present ecient cluster optim algorithm algorithm extend compact genet algorithm compet genet algorithm coupl simplex local search lowest energi structur silicon cluster atom successfulli predict minimum popul size total number function energi evalu requir converg global optimum reliabl empir determin result obtain algorithm highli reliabl predict global optim structur ecienc techniqu emploi predict structur larger cluster reduc high comput cost due function evalu introduct challeng problem comput chemistri determin lowest energi structur atom molecular cluster attribut presenc larg number minima cluster possess cluster atom local minima studi estim number local minima rapidli exp number atom cluster prove determin lowest energi interact central problem exhaust search structur necessit usag global optim techniqu global optim techniqu genet algorithm ga search method inspir natur base darwin principl surviv ga emploi popul candid solut util genet oper mutat creat candid higher tness recent class ga call compet ga superior convent ga compet ga de ned ga solv hard problem reliabl accur compet ga problem intract earlier ga render tractabl object current studi emploi extend compact genet algorithm compet ga task cluster optim evalu ectiv predict global optim structur silicon cluster test case successfulli predict optim structur small cluster ort predict structur bigger cluster paper structur present literatur review note atom potenti present studi section describ paramet encod procedur descript present section cluster optim algorithm section result obtain discuss section literatur review recent interest emploi ga solv cluster optim problem shown ga outperform tradit mont carlo base simul anneal method report ga superior simul anneal predict geometri ar ga success predict optim structur atom simul anneal fail case studi author geometr crossov creat individu simpl ga predict structur si si potenti al hybrid combin binari code ga conjug gradient local search report signi improv perform compar ga local search method modi ed hybrid ga encod real valu binari simplex conjug gradient techniqu predict cluster structur si studi cluster optim research oper singl point select scale problem foremost singl point crossov disrupt good build block converg time popul size requir shown recent work ensur ectiv build block mix integr part ecient ga design studi show achiev tight linkag set allel belong bb base concept compet ga design broadli classi ed perturb techniqu fast messi ga gene express messi ga linkag identi cation nonlinear identi cation detect ga linkag adapt techniqu linkag learn ga probabilist model base techniqu extend compact ga bayesian optim algorithm sastri goldberg successfulli appli optim binari uid power cycl formul nonlinear constrain problem report relat converg time popul size requir silicon potenti research empir potenti weber potenti calcul potenti energi silicon cluster potenti bodi potenti sw potenti bodi potenti potenti satisfactorili predict bulk phase accur predict structur properti term sw potenti perfect angl ab molecular dynam calcul larg peak smaller peak gong base sw correct term incorpor angl prefer angl gong potenti form tot br ij ij exp ij jr ij ji ki kj ij ik jk ji ki exp ij ki jr ij jr ki tot potenti energi figur angular part term sw gong potenti reproduc phy ij angl ji ki vertex empir paramet determin tting data ab calcul angular part gong potenti term incorpor prefer bond angl comparison term sw potenti di erent angl shown gong report structur properti predict potenti close obtain ab studi signi improv potenti compar optim structur predict sw potenti gong potenti si cluster current studi gong potenti term calcul total potenti energi cluster paramet encod ga encod variabl binari string recent research emploi real valu binari encod solv cluster optim problem report signi improv binari code ga binari code compet ga binari code ga linkag learn ga preliminari stage choic made cluster earlier studi emploi intern coordin recent studi emploi xed cartesian coordin xed coordin requir variabl xed coordin bit posit gener figur bb identi cation si case color box refer gene belong bb spot gene independ compact cluster atom nite optim structur xed coordin studi shown xed term algorithm ecienc present studi atom repres cartesian coordin coordin repres bit binari string atom cluster fulli repres bit string length state xed coordin contradictori spirit goldberg coordin stand observ bb physic allel set allel lower signi ect tness individu form bb happen popul gene highli correl form bb claim illustr bb identi ed case atom si cluster gure initi gener higher order bit coordin form bb gener lower order bit form bb domino converg ect show crossov oper respect bb result poor perform case singl point crossov extend compact genet algorithm harik base kei idea choic good probabl distribut linkag learn measur good distribut quanti ed base minimum descript model kei concept mdl model thing simpler distribut complex mdl restrict penal inaccur complex lead optim probabl distribut mdl restrict reformul problem nding good distribut optim problem minim probabl model popul probabl distribut class probabl model margin product model form product margin distribut partit gene similar cga unlik model cga repres probabl distribut gene time facilit direct linkag map partit separ tightli link gene current studi gene partit refer bb concept illustr bit problem chose partit partit impli bit jointli distribut st bit independ distribut probabl distribut partit simpli frequenc individu bit valu similarli proport individu st similarli probabl distribut partit procedur thing cluster converg initi cluster randomli perform simplex search evalu potenti energi cluster end perform tournament select build mdl creat cluster replac cluster figur procedur identi cation mdl creation popul base identi cation gener formul constrain optim minim cm subject bb cm model complex repres cost complex model cm log bb compress popul complex repres cost simpl model complex evalu bb ij log ij bb equat repres number length bb bb ij number chromosom current popul possess bb constraint due nite popul size note bb length sequenc rst sequenc denot sequenc popul gener base optim popul size crossov lled individu current popul di er origin procedur individu individu current gener irrespect tness rest individu gener randomli subset current individu subset gene group identi ed current procedur di erent origin procedur subset chosen probabilist poll origin procedur lead stochast method current studi determinist method frequenc bit sequenc subset remain constant observ outcom method similar fact determinist method faster algorithm descript object cluster optim problem minim total potenti energi determin lowest energi structur state encod posit atom cartesian coordin bit binari string coordin initi popul gener coordin sampl uniformli structur relax local search case simplex method simplex requir initi point variabl problem initi point individu popul gener ad uniform random variabl solv atom variabl initi cluster simplex method individu account initi rest gener ad uniform random variabl individu unlik ran simplex algorithm till toler run till toler reach wai incorpor solut obtain local assign tness local search individu chang structur assign tness structur individu rule thumb state approach appli time rest present case preliminari studi fulli approach superior approach remaind studi approach relax structur subject tournament select replac number individu select current gener individu minimum potenti energi transfer procedur repeat till mate pool individu present studi tournament size result report present averag independ run simplex algorithm adopt converg criteria varianc tness popul varianc bit valu popul whichev occur rst minimum popul converg time number function evalu evalu fail run reliabl algorithm set criteria stringent exist literatur requir run reach global minima result discuss distort compress figur optim structur total potenti energi unit predict di erent cluster size optim structur obtain di erent cluster size potenti energi unit shown structur predict literatur indic success reach global optimum ectiv illustr singl ga run case atom cluster gs case initi gener structur quickli converg structur close optim structur slightli modi es reach global structur energi variat decim place stage minimum popul size requir di erent cluster size shown minimum popul size scale size cluster number gener di erent cluster size shown result show converg faster exist reliabl converg criteria stringent ectiv good oper preserv good bb final number function evalu di erent size cluster shown number function evalu scale size cluster note high reliabl constraint reason algorithm scale badli reliabl constraint reduc minimum popul size scale number function evalu scale reliabl restrict exist cluster optim algorithm low gen gen gen gen gen gen gen gen figur singl ga run atom cluster gen gen gen gen gen gen figur singl ga run atom cluster develop hybrid compet genet algorithm util simplex algorithm optim small silicon cluster successfulli predict optim structur cluster size result literatur empir evid number function evalu popul size number atom cluster result ecient algorithm design retain high reliabl techniqu behavior acknowledg rst author sponsor air forc oc scienti air forc materiel grant research fund work provid string minimum popul linear fit figur minimum popul size requir reach global optima di erent cluster size figur converg time reach global optima di erent cluster size total function evalu string linear figur number function evalu requir reach global optima di erent cluster size nation scienc foundat grant support provid grant armi research laboratori feder laboratori cooper agreement govern author reproduc distribut reprint govern notwithstand copyright notat thereon view author interpret necessarili repres polici express air forc oc scienti nation scienc govern prof suggest comment due prof goldberg refer increment method integr genet search base function optim competit learn report carnegi mellon molecular geometri optim genet algorithm phy rev genet algorithm search optim machin learn accur optim dicult problem fast messi genet algorithm intern confer genet algorithm san morgan kaufmann understand mix genet algorithm soc instrument control evolutionari design comput sweet lesson genet algorithm autom design innov pp san morgan kaufmann studi structur properti small silicon cluster phy rev global geometri optim cluster modi ed genet algorithm linkag learn probabilist model report illinoi learn linkag foundat genet volum san morgan kaufmann compact genet algorithm ieee confer evolutionari comput ieee servic center global geometri optim cluster genet algorithm phy global geometri cluster growth strategi optim genet algorithm phy structur dynam simpl adv global geometri optim silicon cluster genet algorithm genet algorithm chemistri rev comput gene express messi genet algorithm intern confer evolutionari comput ieee servic center extend compact genet algorithm report illinoi linkag identi cation detect overlap function evolutionari global geometri optim atom cluster modi ed genet algorithm coordin structur bind bayesian optim popul size time converg report illinoi numer recip cambridg press extend compact genet algorithm report illinoi comput simul local order phase silicon phy rev empir approach structur energi system phy rev analysi design genet algorithm doctor katholiek universiteit belgium mix genet algorithm intern confer genet algorithm san morgan kaufmann domino structur problem ieee intern confer evolutionari comput ieee servic center progress cation real code ga simplex crossov report illinoi comput complex determin atom cluster phy studi lowest energi structur atom cluster genet algorithm comput phy applic genet algorithm calcul bound state local densiti approxim
ML/1246 6 treat constraint object evolutionari optim carlo de informatica mexico paper present approach handl constraint evolutionari algorithm techniqu treat constraint multiobject optim approach solv optim problem approach compar numer evolutionari optim techniqu engin optim problem kind constraint result obtain show approach consist outperform techniqu small term perform genet constraint multiobject evolutionari numer optim introduct genet algorithm success wide rang applic constrain optim problem issu amount research devot year import incorpor constraint sort equal fit function guid search properli due natur problem ga difficult shape search easi produc special oper explor sever constraint rang applic approach penalti function incorpor constraint inequ fit lot success applic approach engin field penalti function limit remark difficulti defin good penalti factor penalti factor gener trial definit sever affect result produc ga approach requir penalti function handl equal inequ constraint techniqu base multiobject optim suitabl parallel work perform author affili engin design centr unit kingdom remaind paper organ review import techniqu develop context numer engin optim problem solv approach result produc mathemat techniqu compar obtain final discuss result obtain expect path futur research previou work approach develop handl constraint evolutionari algorithm numer approach classifi ffl reject individu ffl maintain feasibl popul special genet oper ffl separ object constraint ffl penal individu reject individu call easiest effici handl solut violat assign fit calcul estim solut approach popular evolut strategi commun limit problem feasibl search space convex constitut larg portion search space situat initi popul singl feasibl approach progress evolut process individu fit davi present special develop optim problem parametr design robot trajectori schedul neural network preserv feasibl individu time approach algorithm numer optim constrain develop michalewicz handl linear constraint elimin equal design special genet oper chromosom constrain solut space assum feasibl start point feasibl initi assum exist linear inher restrict convex search space approach handl constraint object separ report base model constraint satisfi solut problem analog fit member popul depend fit member popul individu high fit popul repres solut satisfi lot constraint individu high fit popul repres constraint violat lot solut schoenauer techniqu call behaviour memori constraint handl order algorithm ffl start random popul individu ffl set constraint ffl evolv popul minim violat percentag popul call flip threshold feasibl constraint case ffl ffl current popul start point phase minim violat point satisfi constraint elimin popul halt criterion satisfact constraint flip threshold percentag oe popul ffl repeat optim object function reject individu idea techniqu satisfi sequenti constraint problem percentag popul flip satisfi attempt satisfi constraint satisfi made notic step schoenauer death individu complet elimin popul method requir linear order order constraint process influenc result provid algorithm term total run time schoenauer recommend share scheme add flip threshold oe order constraint extra paramet requir algorithm approach emul immun system handl constraint lee idea techniqu separ feasibl individu popul simpl match function comput similar assum binari approach popul suffici similar maxim match popul mix evolv standard genet penalti individu feasibl popul elimin individu gener genet oper approach interest biolog issu remain solv clear effect term mix proport popul proce feasibl solut initi popul common approach ga commun handl constraint inequ penalti basic approach defin fit individu extend domain object function fit repres penalti individu cost repair individu cost make assum feasibl penalti low limit solut optim minimum penalti rule practic difficult implement exact locat boundari feasibl region unknown problem relationship individu feasibl part search space plai role penal individu complet clear exploit relationship guid search desir direct main choic defin relationship individu feasibl region search space individu penal inform close feasibl measur determin effort individu cost make account research studi heurist design penalti function studi conduct richardson al guidelin penalti function distanc feasibl perform function number violat constraint problem full penalti sole function number violat constraint find solut good penalti function construct maximum complet cost expect complet cost complet cost cost make feasibl solut penalti close expect complet frequent fall accur solut found penalti underestim complet search find solut base research attempt deriv good techniqu build penalti function lai qi approach user defin level penalti coeffici chosen penalti coeffici reach higher level violat main drawback techniqu high number paramet requir approach requir paramet number level defin constraint high number small size problem join techniqu dynam penalti penalti chang individu evalu gener fit ff fi ff fi constant defin user number constraint dynam function penalti progress gener research argu dynam penalti work static penalti difficult deriv good dynam penalti function practic produc good penalti factor static function approach qualiti solut found sensit valu paramet set valu paramet ff fi found author method reason michalewicz report valu produc prematur converg time found techniqu converg solut feasibl global optimum powel skolnick incorpor heurist rule richardson al process evalu feasibl solut map interv solut interv rank tournament select procedur evalu fit fit ae fit feasibl fit kei concept approach assumpt superior feasibl solut long assumpt techniqu expect behav case ratio feasibl region search space techniqu fail feasibl point introduc initi popul michalewicz consid method base idea simul anneal penalti coeffici chang gener converg algorithm local iter algorithm consid activ constraint pressur solut due valu temperatur system method michalewicz requir constraint divid linear linear nonlinear equal nonlinear inequ set activ constraint nonlinear equal violat nonlinear inequ includ popul evolv interest aspect approach initi popul consist multipl copi singl individu satisfi linear constraint temperatur popul creat solut found previou iter process stop final temperatur reach main drawback approach extrem sensit valu difficult cool scheme solv problem simul anneal approach handl linear constraint separ requir user initi feasibl point algorithm bean develop method adapt penalti penalti function feedback search process individu evalu updat gener fi case denot situat individu gener fi fi fi fi avoid penalti compon gener individu gener feasibl feasibl individu ti penalti chang obviou drawback dynam penalti approach gener gap reason inform guid defin valu fi fi fairli solut le rich al design genet algorithm penalti paramet valu aim achiev balanc heavi moder penalti maintain subpopul individu popul split cooper individu group evalu penalti paramet idea combin singl mix individu feasibl linear rank select pressur prematur converg problem approach penalti guidelin provid author method defin admit difficult produc gener valu problem previou inform approach fit previou categori defin method kim husband techniqu theoret approach map transform feasibl region shape facilit search ga problem approach problem low object function explicit clear extend techniqu handl difficult problem multiobject optim techniqu object constraint handl separ main idea redefin optim multiobject optim problem number constraint appli multiobject optim techniqu vector fm fm origin constraint problem ideal solut feasibl genet oper appli figur graphic approach introduc paper al pareto rank vega handl constraint techniqu call popul rank base constraint violat number individu domin portion popul select base constraint rest base real cost individu approach compar fairli approach result ga sensit result achiev found penalti function ad requir extra cost import paramet regul proport feasibl individu exist popul implement version vega handl constraint ga turbin problem object ga locat feasibl region highli constrain search space applic vega explor feasibl opt special oper creat hypercub feasibl point ga remain feasibl region time descript approach main idea approach paper multiobject optim techniqu vega handl constraint object techniqu illustr figur popul split refer number constraint problem add object size subpopul decid alloc size experi report size remain open issu requir research fraction popul select object function fraction constraint fit complet obviou guid search guid object evalu object function vector directli fit function multipli minim penalti sort algorithm fit fit fit refer constraint assum assign object function refer number constraint violat interest thing observ procedur subpopul constraint reduc amount constraint violat solut evalu violat constraint minim total number join effort drive ga feasibl region aim combin distanc feasibl inform number violat heurist penalti function defin advanc static penalti dynam penalti function estim distanc current approach distanc estim automat algorithm constraint violat inform deriv ga run solut encod individu evalu fit function object import clarifi current approach domin order constraint base violat case process term cpu requir addit paramet current approach rank fit function alloc number depend number depend feasibl individu easier requir special oper preserv feasibl case approach make unnecessari share function preserv tradit multiobject optim requir extra paramet control mixtur feasibl individu case interest notic unconstrain object function subpopul assign good fit valu individu number constraint greater drive ga feasibl region evalu object function make unnecessari share techniqu behavior expect scheme feasibl individu gradual produc solut feasibl respect constraint respect build block combin produc individu necessarili optimum point direct object function ga approach solut present individu requir avoid stagnat vega difficulti multiobject optim problem due fact find individu excel dimens thrust load figur thrust bear problem drawback turn advantag find solut complet good satisfi constraint approach test function deal properli inequ equal section exampl exampl optim literatur show approach work exampl linear nonlinear solv varieti techniqu tradit mathemat program determin qualiti solut produc approach mention initi goal work reproduc qualiti result found simpl genet algorithm penalti solv specif problem empir approach simpl trial tradit numer optim techniqu techniqu paper match previou fact improv fairli small experi report mention rang shown design variabl report origin refer problem obtain design thrust bear problem minim power loss oper thrust bear figur withstand load provid axial support design variabl step optim problem state minim qp subject max fl gp inlet pressur defin ln power loss due friction fl weight densiti oil ffi ffi specif heat oil temperatur rise calcul log log constant defin tabl sae grade calcul calcul film thick paramet requir lb psi max ffi ffi oil sae sae sae sae sae sae tabl valu grade oil figur spring design spring object design spring minimum weight satisfi constraint figur design diamet diamet problem state subject ffi max ffi max ffi ffi max ffi max ffi ffi max dmax tabl valu paramet defin maximum load lb maximum deflect ffi max strength modulu elast psi poisson ratio materi maximum limit height diamet spring dmax assum ff ln fi ln fl ln limit deflect ffi defin valu tabl consist design combin circuit repres function input output shown tabl solv matrix circuit encod chromosom string shown figur element gate type xor receiv input gate previou column circuit repres arrai gate level gate closer input lower valu valu increment left figur fix index vari respect gate necessarili connect interest notic encod problem disrupt make tabl truth tabl circuit input output figur gate input gate previou column input input gate type figur encod matrix element repres circuit hard ga reason circuit design close space make difficult preserv highli fit schema ga problem decept chromosom string encod matrix shown figur triplet element refer input gate shown figur gate goal produc fulli function design produc expect output combin input truth tabl maxim number wire equal desir output truth tabl shown tabl nonlinear optim problem problem origin chosen approach benchmark techniqu penalti design variabl nonlinear inequ constraint boundari condit problem state minim subject figur plane design plane plane shown figur problem find area member minim subject stress displac constraint weight ae candid area jth length jth ae weight densiti materi assum data modulu ksi ae load neg appli node maximum stress member call oe assum ksi maximum displac node repres assum inch stress displac constraint assum displac constraint node consid addit constraint element problem design variabl comparison result genet algorithm experi present paper chromosom string form hd dm dm digit exampl shown figur repres binari fix point encod wire basic null absenc regular ga string fix point encod number binari encod number figur repres number binari fix point encod fix point faster easier higher binari larg binari string prohibit long advantag fix point properti point close space close problem vice versa gener true binari distanc defin number bit posit decid uniform crossov gener tradit crossov oper gene string offspr decid probabl parent contribut posit offspr receiv gene parent crossov figur tradit uniform mutat decid mutat illustr assum gener string hs randomli select posit gener chromosom mutat hs ae function return randomli equal probabl function return rang probabl close express author function origin suggest michalewicz randomli gener real number rang maximum number system paramet determin depend current figur crossov chromosom notic half gene parent children bit copi parent select randomli probabl child valu gener invert sourc gene design solut found variabl paper tabl comparison result thrust gener number adopt current implement suggest michalewicz binari tournament select exampl present problem solv deb adapt tradit genet algorithm approach penalti adapt random search penalti result compar produc approach shown tabl notic solut report violat solut shown techniqu produc run crossov mutat rate iter increment nest loop mutat rate iter crossov rate remain fix initi crossov rate valu mutat run ga pair paramet mutat loop mutat rate crossov rate increment loop mutat rate run process repeat crossov rate reach rang design valu variabl consid valu consid multipl total popul size individu maximum number gener problem solv deb version treat variabl treat variabl tradit genet algorithm approach penalti approx stewart success linear result compar produc approach shown tabl notic design solut found variabl paper ii tabl comparison result genet algorithm human design xy xy xy gate gate gate xor xor tabl comparison result human design approach paper solut report deb violat solut report violat constraint result vari depend emploi result shown tabl comput solut shown techniqu produc run crossov mutat rate iter nest rang design valu variabl consid total popul size individu maximum number gener solv hand map experienc design solut requir shown tabl comput program call compar result produc approach paper mention produc circuit number input gate receiv difficult compar result found current constraint oper xor gate express present tabl gate split gate make fair comparison fact handl directli type gate make result complex produc ga design solut found variabl paper gen tabl comparison result fourth fit function problem work stage begin valid circuit output ga basic explor search space function solut fit function modifi valid design produc reward wire gate ga find circuit maximum number gate perform function requir stage ga exploit search optim solut found term number output desir treat equal constraint ga popul chromosom individu maximum number gener size matrix problem origin solv gener reduc gradient method gen cheng solv problem genet algorithm base local global refer result shown tabl report gen cheng lai solv problem genet algorithm popul size result report literatur problem tabl solut shown techniqu produc run crossov mutat rate iter nest rang design valu variabl consid total popul size individu maximum number gener problem evalu numer optim feasibl direct quadrat program gradient project exterior penalti function multipli method result report compar current approach tabl design solut found variabl paper tabl comparison result plane part design solut found variabl tabl comparison result plane part ii solut present solv add modul analysi plane modul matrix factor method includ weaver stiff method analyz return valu stress displac total weight structur solut shown techniqu produc run crossov mutat rate iter nest rang design variabl valu variabl consid total popul size individu maximum number gener discuss exampl present approach found solut report literatur small size select size remain issu ga singl popul determin maximum number gener present similar case monitor popul ga stop anymor fit individu close fit problem select illustr techniqu kind constraint algorithm test condit exampl engin design constraint algebra form numer optim problem time test constraint handl approach equal constraint algebra deriv modul simul circuit produc input combin constraint defin algebra form deriv modul perform analysi structur main drawback techniqu number larger linearli number constraint deal problem constraint mean constraint assign significantli reduc number highli constrain problem parallel case high number process concurr current algorithm modif decid sort interact master process optim slave constraint fact area research pursu author paper introduc approach multiobject optim techniqu handl tradit penalti approach approach work test problem solv mathemat program produc case result report literatur techniqu achiev good result small extra paramet issu select size maximum number remain open case simpl ga futur work extens work develop parallel implement singl popul split number singl constraint set constraint interest issu parallel version algorithm migrat polici requir exchang consequ restrict effect topolog parallel architectur perform evolut small constraint concurr evolut main popul mix feasibl solut introduct parallel version current algorithm improv requir detail analysi paramet ga architectur implement evalu robust approach refer genet algorithm optim machin learn publish massachusett editor seventh intern confer genet algorithm morgan kaufmann san california editor integr evolutionari adapt comput technolog design unit kingdom guidelin genet algorithm penalti function intern confer genet algorithm page morgan kaufmann georg mason editor evolutionari algorithm engin applic berlin numer optim comput model john wilei great britain editor handbook genet algorithm van nostrand york genet algorithm data structur evolut program edit constraint satisfact confer parallel problem solv page springer york constrain ga optim intern confer genet algorithm page morgan kauffman san california evolutionari algorithm constrain engin problem comput industri engin journal constrain genet search schema adapt immun network solut world congress multidisciplinari page germani segreg genet algorithm constrain structur optim sixth intern confer genet algorithm page morgan kaufmann san california constrain optim genet algorithm genet numer constraint sixth intern confer genet algorithm page morgan kaufmann san california penalti function solv nonlinear constrain optim problem ga ieee confer evolutionari page ieee florida constrain genet optim dynam balanc pattern recognit intern confer genet algorithm page georg mason morgan kaufmann san california genet algorithm engin design optim constraint intern confer genet algorithm page illinoi morgan kaufmann san california introduct genet algorithm mit massachusett evolutionari optim constrain problem annual confer evolutionari program page world scientif optim simul anneal dual genet algorithm bound integ program technic report tr depart industri oper michigan map base constraint handl evolutionari circl pack grid gener integr evolutionari adapt comput technolog design page unit kingdom overview evolutionari algorithm multiobject optim evolutionari approach constrain ga suppli network method evolutionari comput aisb workshop select paper lectur note comput page uk genet algorithm multiobject discuss gener intern confer genet algorithm page illinoi morgan kauffman san california multipl object optim vector evalu genet algorithm genet algorithm intern confer genet algorithm page lawrenc erlbaum develop direct genet search techniqu heavili constrain design space adapt comput engin design page uk autom design combin logic circuit genet algorithm intern confer artifici neural net genet algorithm page east england genet algorithm design structur technic report comput scienc indiana indiana decept consid harm foundat genet algorithm page morgan san california appli nonlinear program york studi mathemat program method structur optim dept civil iowa optim design reinforc concret beam genet algorithm expert system applic intern journal simpl genet algorithm design reinforc concret beam engin comput uniform crossov genet algorithm intern confer genet algorithm page georg mason morgan kaufmann san california optim engin design combin genet search sixth intern confer genet algorithm page morgan kauffman san california optim engin design principl applic marcel york analyt engin design map method synthesi combin logic circuit transact commun electron logic minim algorithm vlsi synthesi kluwer academ publish genet algorithm engin design john wilei york analysi frame structur van nostrand
Agents/1247 1 system develop robocup agent educ fredrik march abstract report describ system develop robocup agent design educ design easi encourag simplifi extens share robocup part assum requir time act incomplet inform act manipul object found soccer environ consist librari basic object util rest basic system handl interact soccer server time framework world model support framework defin predic skill view special inform process unit specif part world model ball control event gener basic system predic maker skill test state world skill planner gener plan action agent order reach desir goal state implement solari unix work content introduct problem solut structur report background soccer server server paramet simul sensor input command command cycl educ aspect relat work agent architectur robocup librari overview librari data type util geometr object game object command object basic system server interfac control sensor sensor interfac actuat actuat interfac iii maker framework view manag view predic skill educ summari futur work user manual introduct overview softwar packag gener part librari compil direct data type basic system creat basic system control sensor sensor interfac actuat actuat interfac maker sensor send command framework creat agent view predic creat predic extend exist predic skill creat skill extend exist skill bibliographi iv chapter introduct chapter short descript problem creat system develop robocup outlin chapter motiv defin condit state assumpt make order solv section chapter describ structur report short introduct robocup familiar robocup attempt foster artifici intellig intellig robot research provid standard wide rang technolog integr examin reason soccer plai highli dynam teammat independ agent collabor order beat team time easi understand problem peopl soccer plai team success properti make robocup excel environ student creat test easi motiv provid competit test team robocup divid real robot leagu simul softwar agent leagu report team simul softwar agent simul special server call soccer section download softwar start develop soccer agent descript team particip robocup world cup competit held found download test inform robocup found robocup organ problem major problem construct robocup agent simul leagu implement basic function agent gener problem develop wooldridg jen write greatest obstacl wider agent technolog softwar platform develop due number instanc interact soccer develop basic skill soccer player find move ball kick desir direct develop robocup team scratch student robocup implement test ai algorithm make student start higher level spend time implement ai part skip tediou program creat function robocup team platform creat team platform creat team educ aspect put higher demand clean design sharabl team improv year year student approach platform care basic task robocup agent receiv data interpret sensor data send command back server platform defin work cycl time import event asynchron data structur store result interpret sensor data final basic action skill agent perform team theori model platform work kind agent architectur cope user defin design issu platform encourag promot share part skill inform process algorithm solut open problem make assumpt assumpt made user agent complet consist order time act incomplet inform act soccer object agent ball player make assumpt make unnecessari estim wai estim document easi chang user find solut problem system call includ librari util basic system care time interact framework inform process support basic system defin work cycl agent act care commun soccer server basic inform messag soccer server feed back actuat inform process framework consist collect special unit process raw data obtain basic system inform process unit inform unit special player system special unit make easi agent unit modifi suit defin skill defin predic make complet user guid event gener basic system framework simplifi modif share unit fact system design gener open encourag simplifi extens share robocup agent creat structur report report organ chapter background materi report section soccer server section educ final section relat work chapter detail start overview section design discuss librari section basic system section framework section chapter conclud section describ educ chapter chapter conclud remark summari section discuss futur work section appendix limit user manual chapter background soccer server soccer server softwar develop robocup itsuki noda soccer simul distribut simul server player coach team connect player goal keeper goal keeper player catch ball simul enforc rule game mechan simul section commun server client internet protocol agent separ program direct commun agent commun soccer server agent connect server receiv sensor data continu visual data approxim physic data roughli millisecond aural data directli player coach sensor data complet perfect sensor discuss detail section server accept command agent describ action perform command properti discuss section protocol data server lost network noisi sensor fact player act time make simul highli dynam uncertain make task develop robocup agent interest simul server visual tool call soccer monitor watch game plai figur player bigger circl figur soccer monitor small dark player middl ball player face direct light half circl black bar left side field goal text shade area top screen team plai left side current plai mode current team plai side score plai left side score current plai mode current time team side cmunit score goal rest section describ import part simul detail materi soccer server manual inform obtain server paramet soccer server paramet control simul work chang edit configur tabl soccer server paramet report default valu tabl adapt paramet tabl soccer server manual paramet default descript simul step length simul cycl millisecond bodi step length bodi inform send step length send visual inform player standard view mode step length interv server poll socket client visibl angl angl view cone player standard view mode visibl distanc maximum distanc object view cone player audio cut dist maximum distanc spoken messag heard ball size radiu ball meter ball decai decai rate speed ball ball rand amount ad movement ball ball speed max maximum speed ball simul cycl player size radiu player player decai decai rate speed player player rand amount ad player movement turn player speed max maximum speed player simul cycl min minimum player max maximum player max maximum amount player gain simul cycl recov dec decrement threshold player recoveri recov dec decrement step player recoveri recov min minimum recoveri player effort dec decrement threshold player effort capac effort dec decrement step player effort capac effort increment threshold player effort capac effort increment step player effort capac effort min minimum player effort capac effort max maximum player effort capac margin maximum distanc ball player kick power rate rate power argument kick command multipli dash power rate rate power argument dash command multipli inertia moment inertia moment affect movement maximum power dash kick command minimum power dash kick command maximum moment turn direct kick command minimum moment turn direct kick command maximum moment turn neck command minimum moment turn neck command maximum moment turn neck command minimum moment turn neck command msg size maximum length messag player physic boundari figur marker line simul file load server paramet mention report tabl complet list soccer server manual simul simul discret move time step occur simultan end step length step set simul step paramet end server action command receiv appli object current posit veloc inform calcul posit veloc object soccer field soccer field object notion height object field meter long meter wide goal meter size normal soccer goal difficult score field marker line agent navig shown figur player bound outer flag meter plai field marker field absolut posit independ side team plai left team team figur coordin system team coordin form sign shown sign left team sign team diagram top show sign coordin team bottom show direct team coordin system direct hand depend side team plai figur center neg found team side field posit opposit neg found team left part field posit stand face oppon goal direct base side team straight ahead oppon goal posit angl agent face oppon neg angl left movabl object player treat circl distanc angl center circl simul control plai mode game decid team score ball bound call rule simul enforc concern player rule surround put ball ing movement player human possibl call movement object end time step server updat current state object world quot soccer server manual movement object calcul manner move decai decai speed reset posit veloc object timestep decai decai paramet ball decai player decai depend object updat deriv power paramet dash case object kick case object command power power rate power rate dash power rate calcul kick power rate section direct object timestep case player direct player face case ball direct ball direct ball direct ball kick player time direct paramet kick command end simul cycl object overlap occur object move back overlap veloc multipli note ball player long ball player overlap end cycl model simul endur player player limit amount player dash regain cycl maximum power player dash amount regain cycl depend variabl recoveri total amount energi agent effort determin effect agent dash recoveri control regain cycl soccer server manual model work client dash updat power effort power effort power dash execut cycl client dash variabl updat ffl slightli cycl recoveri recov recoveri ffl basic idea effort minimum effort high effort maximum effort max effort effort effort effort dec max effort effort effort int max effort ffl similar effort recoveri recoveri ae recoveri recov recov dec max recoveri order variabl chang import recoveri effort recov figur visual threshold model figur threshold model tabl data visual sensor data descript object data describ distanc distanc object direct direct object chang distanc object chang direct object bodi direct rel face direct object player head direct rel face direct object player team object player uniform number object player sensor input mention type sensor input provid aural physic sensor data sensor type data send agent discuss section visual sensor send step agent receiv visual sensor data tabl data visual sensor data agent close qualiti data depend distanc object detail descript exact detail soccer server manual aural sensor agent receiv data aural sensor data coach tabl data physic sensor data descript current set agent affect amount qualiti visual data agent current set agent affect amount qualiti visual data agent current agent effort current effort agent amount agent current speed vector rel direct agent head number dash made agent number kick made agent number made agent number turn made agent number turn neck made agent distanc speaker audio cut dist agent hear messag messag teammat cycl messag cycl arriv heard physic sensor bodi step agent receiv physic sensor data tabl data physic sensor command section discuss basic action agent server perform tabl short descript syntax rang paramet action detail descript effect action soccer server ffl turn moment concept inertia make difficult turn agent move actual angl player turn calcul inertia moment player player speed amount player veloc inertia moment paramet default default player max speed maximum effect turn agent dash turn fastest player execut turn player speed max player mean effect turn default ffl turn client neck turn independ bodi angl player head view angl player turn command angl player bodi turn neck angl player head rel bodi maximum rel angl player neck side rememb neck angl rel player bodi client issu turn view angl turn neck command issu turn neck command execut cycl kick command turn neck affect momentum turn argument turn neck command rang result neck angl ffl dash essenti small push direct player bodi face sustain run order sustain multipl dash command power pass dash command multipli dash power rate effort section appli direct player bodi face neg agent dash consum section ffl kick similar dash ball player player kick ball area equal player size size effect import differ dash kick kick power rate figur dir diff absolut angl ball rel direct player bodi face ball directli dist ball distanc center player center ball kick power rate figur kick power rate dir diff ball player size ball margin mean power kick ball directli front player close drop distanc angl tabl syntax basic action agent perform syntax direct view width width narrow normal wide qualiti high low power power power direct move work kick mode goal score messag string msg size charact moment neck moment turn neck rel direct bodi result angl invok cycl catch kick command cycl command cycl agent decid action send run parallel cycl ffl simul cycl control time simul length determin paramet simul default millisecond ffl send physic sensor data cycl control send current physic sensor data agent length determin bodi default millisecond ffl send visual sensor data cycl control send current visual sensor data agent length determin send default millisecond ffl receiv command client cycl control server receiv command client length determin default valu millisecond cycl control intern clock insid server due implement server updat accur asynchron shown figur action execut visual sensor data physic sensor data agent timelin server timelin figur data agent receiv command agent execut figur show data agent receiv data arriv earlier expect action receiv server end simul cycl updat state simul show agent send command back due delai network fact server time read messag receiv step execut simul step agent agent receiv sensor input current simul cycl end make wait inform act current inform affect agent act inform decid action balanc central robocup agent great impact perform agent educ aspect depart comput scienc linkop give problem develop robocup team paper describ written coradeschi found challeng interest task incent tournament made term enthusiasm student knowledg acquir similar drawn russel norvig introduc world introductori ai major problem student point creat robocup agent requir larg amount knowledg relat process larg effort overcom initi commun server calcul posit player send simpl command back server request improv practic problem develop robocup agent fact librari develop student creat robocup team motiv inspir master thesi educ aspect problem induc import demand ffl simpl easi ffl order approach implement ffl replac extend part librari difficulti order educ point view care basic problem robocup agent handl essenti problem address librari basic server practic problem build robocup agent basic commun server agent receiv data server data decid action final send correct back server section cycl server lot thing mind handl time make problem track current simul step send command time execut current time inform make hard major sourc encount import student worri problem world problem track state simul base sensori data receiv server soccer environ hard main problem noisi incomplet sensor data draw correct object world problem make predict futur state import model current world consist updat support fourth problem base current world decid action job agent design librari design assist agent programm good support make notif inform arriv server cycl start maker robocup sort rule practic predefin ball plai left side field trigger rule make gener mean concept robocup point select action base current world model conveni higher level abstract action intermedi skill base basic action agent turn absolut direct kick ball posit relat work section describ relat work report section discuss concept agent section defin agent architectur kind architectur exist section describ robocup librari todai answer agent research definit work definit russel defin agent view perceiv environ sensor act environ effector simpl definit compar definit collect agent gener cover agent robocup agent decid sensor inform soccer server effector send command back server agent architectur definit agent definit agent architectur patti mae defin agent architectur methodolog build specifi agent construct set compon modul modul made interact total set modul interact provid answer question sensor data current intern state agent determin action futur intern state agent architectur encompass techniqu algorithm support past decad number approach problem find good function decomposit agent lead major type agent hybrid interact architectur reactiv architectur architectur strongli influenc psycholog goal achiev robust behavior correct optim behavior simpl action rule base current situat explicit inform architectur robocup domain architectur chicken delib architectur agent base simon newel physic symbol system hypothesi assumpt agent maintain intern explicit mental state modifi form symbol reason call delib agent delib architectur intent architectur develop bratman al bdi robocup domain humboldt hybrid architectur agent reactiv process emerg combin reactiv delib layer creat hybrid agent architectur major problem combin layer singl unit wooldridg jen argu hybrid architectur clear reason underli theori hybrid architectur robocup architectur interact architectur architectur deal coordin cooper distribut intellig agent call interact architectur interact architectur found robocup domain robocup librari previou attempt build robocup librari team part code problem document code tightli connect structur team structur gener librari peopl structur librari encourag develop share code benefit team start scratch build previou team experi rest section describ exist team cmunit great sourc idea inspir librari routin basic robocup client function develop itsuki noda extend gal member isi team southern scienc usa librari interfac algorithm calcul posit agent basic algorithm calcul absolut posit object calcul turn dash agent make order move posit librari suitabl educ basic handl problem server basic network servic care send receiv messag request agent address problem synchron server make agent send command cycl base import task librari educ scientist interfac commun server problem longer date current server librari built top librari develop oliv librari develop make server function access prolog build data soccer server interfac awkward eleg data store larg structur problem world model infer object made sensor data simpli store client programm infer world model advanc librari nice featur algorithm comput posit geometr calcul support develop advanc skill abstract basic server turn absolut direct kick ball point care task send receiv data server time simpl manner make agent send move turn give agent hint send command late send command current cycl point fact hard replac part code chang part design world model complex librari due lack clear gener architectur make hard understand exchang part code approach cumbersom final threshold product low educ set benefit librari possibl program agent larg amount featur initi obstacl overcom inform found web site cmunit cmunit success team histori robocup won pari stockholm develop peter manuela veloso patrick rilei carnegi mellon usa team develop seri peter stone rest robocup commun part team code basic server world model basic action skill implement advanc accur world model main problem tight connect imposs replac part code hard grasp document good easi pictur team major algorithm work code student perspect import sourc inspir idea part code find chapter chapter describ system develop robocup agent discuss system design reason design manual limit user guid found appendix assum reader basic knowledg refer class method talk part featur chapter implement comput inform scienc depart linkop fall implement unix platform overview design goal creat system develop robocup agent student easi encourag simplifi extens share robocup part state introduct open problem assumpt user system made assum user complet consist order time act incomplet inform act soccer object agent ball player skill predic view manag view server interfac soccer server control collect object program object actuat interfac sensor actuat maker basic system framework user sensor interfac basic system user figur architectur design goal assumpt essenti problem discuss section lead system consist major ffl librari util geometr game basic build block ffl basic system time interact ffl framework inform skill predic system architectur shown figur includ basic system framework figur consist kind box repres kind unit rectangular box repres object hexagon box collect object base box round edg separ independ program arrow show data inform flow subpart arrow implic depend unit librari depend part basic system depend framework depend basic system librari mean user basic system librari system creat team implement framework maker support framework basic system chang section chapter describ function design major part librari librari foundat rest system class util part system class repres geometr class repres object found soccer environ class command soccer server data type make system machin independ set basic type repres integ float point number type repres number bit store type defin repres simpl object robocup command marker modifi valu robocup agent handl base uncertain estim repres confid correct agent awar state object veloc repres unknown valu support reason observ uncertainti unknown valu implement system modifi basic type modifi handl featur util librari basic mathemat util calcul absolut convert radian class repres commun socket class repres timer figur object hierarchi game object librari geometr object geometr object includ librari class repres line rectangl reason type angl user make unclear unit angl modifi argument uncertainti unknown valu valid geometr object modifi modifi work basic type integ exist special modifi geometr object game object game object repres object introduc soccer environ includ ball player object agent object object hierarchi shown figur hierarchi object hierarchi cmunit fact similar object refer current world model cmunit object main reason librari depend world model specif agent design game object repres object moment connect rest world predict system creat version object object cmunit user extend basic game object connect world model agent benefit make state object valid world model check speed limit make world simul updat method directli game object templat repres collect game object call view repres histori object instanti class deriv class command object command object design repres command soccer server version command object includ librari simpl complet separ world model reason game object impli check made valid command server object extend support advanc function make argument legal simul assist updat world model command argument shown tabl section basic system basic system care basic server commun time section accomplish task receiv messag server arriv send sensor messag store raw data concurr control track current game time time send command back server time control command queu command send server execut type data flow basic system shown figur basic inform process skill framework top differ user simpler version sensor actuat function basic system user control sensor actuat actuat interfac sensor interfac process control data raw sensor raw sensor data server interfac messag server command data command result soccer server sensor data command object figur data flow basic system basic system consist server sensor actuat interfac maker rest section devot describ subpart detail server interfac server interfac care lowest level commun server provid interfac socket implement actual server commun control interfac connect server agent receiv server messag arriv send command back server control import unit control time agent synchron server task track current game receiv messag arriv control act dispatch messag server sensor guid maker gener event complet task control intern io handler control algorithm intern clock gener interrupt step millisecond io handler interrupt data arriv socket connect agent soccer server algorithm updat agent tick intern algorithm updat agent sensor data receiv algorithm updat current time agent base server time algorithm defin work cycl agent gener event guid maker assumpt server algorithm make agent receiv physic sensor data bodi messag cycl begin cycl end cycl assumpt make assum cycl start agent receiv bodi messag assum millisecond command cycl server discuss algorithm detail concept time defin time time concept base cmunit concept time repres time tupl server time number cycl clock stop clock stop reason concept agent reason time game clock stop time report server chang make intern work cycl game game clock stop depend state game state game chang call start stop clock sensor interfac sensor receiv messag algorithm updat agent tick intern clock intern clock time act agent predict agent miss messag server algorithm check cycl begun case updat state agent control assum cycl begun gener event maker react situat maker assum cycl begun assum cycl begun algorithm check period command wait check time send period command cycl gener event maker handl reason assumpt user algorithm check command wait algorithm updat agent tick intern clock begin gener event updat counter tick tick cycl begin assum cycl updat current time end assum cycl begin gener event maker forc cycl gener event end period action wait current time action time send period action begin tick tick command warn gener event action wait send action end gener event end algorithm updat agent receiv sensor data sensor data receiv suitabl event gener base type sensor messag algorithm updat agent receiv sensor data begin gener event sensor data wait receiv begin receiv sensor data sensor analyz sensor data receiv switch sensor type begin case physic gener event case visual gener event case aural gener event case init gener init event case sensor gener event end end gener event end algorithm updat current time receiv current server time assumpt made current time ffl clock stop time receiv sensor data assum correct ffl agent clock stop time receiv sensor data current time assum agent wrong clock start ffl clock stop agent assum cycl start bodi updat time ffl cycl start current time greater time cycl base assumpt algorithm addit number tick intern clock count visual physic sensor event predict time remain visual sensor data time agent left cycl algorithm updat current time base current server time begin clock stop reset estim time server equal server time assum clock run updat server time server time updat current time server time switch sensor type begin case physic clock stop time equal current server time updat estim time clock stop reset tick physic sensor data case visual reset tick visual sensor data end end sensor sensor messag server store intermedi result process userdefin unit framework view parser adapt version parser sensor interfac hide implement sensor sensor interfac sensor call basic sensor basic system call sensor inform process framework basic sensor interfac method access raw data produc sensor inform process framework sensor interfac view data sensor section actuat actuat design provid interfac agent server act special command class type command input convert execut server actuat call control time send command command tabl basic type execut immedi execut cycl actuat maintain separ type command actuat interfac hide implement actuat interfac agent send command actuat maker maker unit implement make process agent unit agent design extend program behavior agent assumpt user time main loop agent insid maker control gener event import thing sensor data arriv urgent decid command cycl assumpt late maker limit possibl give feedback control chang paramet late cycl maker command warn event event maker handl tabl event gener critic section control signal handler maker time event interrupt critic section lead problem synchron server estim current time tabl actuat command agent command descript period disconnect agent direct catch ball direct direct view view width view qualiti chang current view width view qualiti agent power agent base power team string version string goali true connect initi agent power direct kick ball direct power move agent absolut posit move messag string max msg size charact player messag loud clear moment turn agent moment moment turn neck agent moment tabl event maker event gener tick intern clock tick intern clock receiv sensor data receiv sensor data receiv actuat feedback receiv aural sensor data receiv physic sensor data receiv visual sensor data init receiv init data sensor error cycl start control estim cycl start time send command late bodi action perform previou cycl bodi action perform previou cycl type agent architectur delib hybrid architectur agent main loop guid behavior reactiv agent event final hybrid agent event main loop control behavior agent framework top basic system framework design support modular world model support make discuss section provid build block exist block extend function creat complet block kind build skill predic encapsul import concept inform process make view extract special properti collect data depend current time histori agent skill complex combin primit agent goal state predic work predic defin logic answer question state world condit rule maker skill section discuss concret unit view build captur section describ instanc predefin build block detail suppli agent basic world model view manag view manag store track view system make updat inform arriv view manag creation view unit idea idea hundr view system resourc compil time idea actual view system framework basic user view support idea view manag refer counter view store view request pointer view view manag view pointer return refer count view store return user creat view send view manag store set refer counter view longer view messag view refer counter refer counter reach view remov persist flag set persist flag prevent view remov system time refer counter reach reason featur view continu track histor data continu view lot resourc start resourc run view manag request updat view sensor data receiv current list view storag send updat messag view possibl request view updat counter prevent view updat inform view detect circular handl current design view view basic compon inform process inform process transform data sensor inform view detail special inform store inform build agent world model view special model skill subject skill part agent import issu minim redund inform make view link view process store inform solv problem depend updat uniqu number view updat make discov circular view control event sensor interfac gener event sensor data occur view cycl start event tabl tabl event view handl event gener cycl start agent initi visual sensor data receiv aural sensor data receiv physic sensor data receiv feedback actuat receiv inform process provid basic inform process robocup set view build world model consist model model model player model marker soccer field model put view paramet view track server paramet option client command view calcul total effect action execut game view track current game view mention section figur depend view shown overcom problem circular view previou cycl data current data view histor data cycl case found calcul trajectori object base previou observ paramet view paramet view track soccer server section user paramet team agent goali user defin paramet paramet extend version paramet care valu paramet suppli text file command line paramet suppli default user chang paramet paramet view paramet independ rest agent event handler game view sensor interfac player view marker view agent view ball view command view paramet view depend current cycl inform depend previou cycl inform figur graph show depend view command view command view calcul effect command execut current cycl give total movement vector agent ball current cycl give total turn angl agent neck method tabl game view game view store inform statu plai score current time complet set method shown tabl tabl function provid command view return type descript vector previou cycl total agent movement vector vector previou cycl total ball movement vector angl previou cycl total agent turn bodi angl angl previou cycl total agent turn neck angl vector previou cycl total agent vector vector previou cycl total ball vector number dash power previou cycl tabl function provid game view return type descript time object current time agent plai mode plai mode hist cycl ago side side field agent plai side side field agent plai number score agent team number score team string agent team string team tabl function provid marker view return type descript number number line messag line object closest line line object line line hist cycl ago line object line object hist cycl ago marker object closest marker messag marker object marker marker hist cycl ago marker object closest marker point hist cycl ago marker object closest goal point hist cycl ago marker object oppon goal hist cycl ago marker object agent team goal hist cycl ago marker object goal object hist cycl ago marker object marker object hist cycl ago marker view marker view store inform marker field give absolut rel distanc direct marker tabl method agent view agent view track agent absolut absolut face bodi neck direct tabl method tabl function provid agent view return type descript agent object object repres agent hist cycl ago point estim posit agent hist cycl ago angl estim face direct agent hist cycl ago angl estim bodi direct agent hist cycl ago angl estim neck direct agent hist cycl ago number estim effort agent hist cycl ago number estim recov agent hist cycl ago number estim agent hist cycl ago boolean return true agent goali number uniform number agent number estim speed agent hist cycl ago view width view width agent hist cycl ago view qualiti view qualiti agent hist cycl ago angl width view cone agent hist cycl ago number number dash agent made hist cycl ago number number kick agent made hist cycl ago number number agent made hist cycl ago number number turn agent made hist cycl ago number number turn neck agent made hist cycl ago tabl function provid ball view return type descript ball object object repres ball hist cycl ago float distanc ball hist cycl ago vector rel vector ball hist cycl ago angl rel direct ball hist cycl ago vector absolut vector ball hist cycl ago angl absolut direct ball hist cycl ago point absolut posit ball hist cycl ago float distanc chang ball hist cycl ago angl direct chang ball hist cycl ago vector absolut speed vector ball hist cycl ago vector rel speed vector ball hist cycl ago float speed ball hist cycl ago angl absolut direct speed ball hist cycl ago angl rel direct speed ball hist cycl ago ball view ball view track absolut rel distanc direct rough estim speed tabl method rel angl rel face direct agent view player view player view track player give access oppon unknown player give inform absolut rel distanc bodi face direct uniform number unknown tabl method rel angl rel face direct agent view tabl function provid player view return type descript pointer player object closest player hist cycl ago pointer player object closest oppon hist cycl ago pointer player object closest teammat hist cycl ago vector player object oppon hist cycl ago vector player object teammat hist cycl ago vector player object unknown player hist cycl ago tabl predic predic predic encapsul concept logic definit concept word static featur predic ball half unknown kleen shown tabl predic automat updat inform inform store view access histor data skill skill encapsul concept short term special current world model provid view predic deriv sequenc primit action make agent perform task intend goal state skill determin applic moment goal state reach precondit fulfil gener sequenc primit consist primit action primit action action server section support maker skill possibl set persist maker call skill sequenc action return primit action time call case basic skill provid reason effici fact world highli dynam significantli cycl cycl skill implement intend real act exampl skill catch ball ball agent goali catch direct ball movement ball agent account find ball direct ball turn ball turn time visual sensor data previou knowledg ball intercept ball distanc direct ball direct ball greater turn ball dash maximum power obstacl movement ball account move absolut posit posit agent move command direct greater turn point dash maximum power obstacl account score kick ball oppon goal ball kick ball hard center oppon goal obstacl agent bodi account kick trackbal follow motion ball direct ball turn ball motion ball account educ state chapter system ai program depart comput inform scienc linkop inform web page main goal student creat robocup team compet end previou year server paramet adjust remov problem time agent make easier make good team benefit system student standard paramet care time agent benefit student focu problem develop skill make agent implement server commun process store inform server student felt easi start easi implement idea major problem report implement user friendli moment problem handl type type chapter summari report discuss system develop robocup agent suitabl educ design easi encourag simplifi extens share robocup part assum requir time act incomplet inform act manipul object found soccer environ order system student point view state essenti problem system solv support care basic interact soccer support world support make result system consist basic system framework librari consist basic object util rest depend part system basic system care interact send receiv data time make support gener event thing happen basic system depend librari framework framework defin world model predic skill view special inform process unit specif part world model ball agent control event gener basic system predic maker skill test state world work predic unknown skill planner gener plan action agent order reach desir goal state framework depend librari basic system jorg muller argu agent basic capabl cope difficult task agent ffl react time appropri unforeseen ffl perform task manner ffl solv task effici procedur routin situat ffl interact agent ffl adapt chang environ cope unforeseen event comput resourc agent limit central task control architectur design system integr requir mention defin adequ applic domain control architectur gener event environ agent opportun interrupt current delib process react event time implement effici skill framework defin procedur type reactiv rap incorpor user troubl limit support adapt consist histori world cycl provid inform process framework machin learn adapt mechan thing explicitli support interact time major obstacl user add commun capabl agent contribut work architectur infrastructur make easier develop robocup agent implement work care detail user focu interest agent user possibl share part provid framework common concept robocup educ institut start robocup part curriculum system plai import role promot make access futur work vast number thing improv paragraph discuss area improv improv exist basic system improv basic system make distribut applic unit run separ thread benefit perform comput model time make machin depend make easier transfer platform run unix flavor minor oper system support socket type signal run modif improv exist framework obviou improv improv predic includ made deliv accur inform made advanc geometr calcul skill predic hope user contribut advanc state art robocup team move robocup hack stage stage team level basic function individu player scientif method import team model oppon team tactic plai win todai win game good individu player interest experi connect exist special softwar care task plan predict framework framework exist todai creat function robocup agent ad framework role commun coach machin learn framework role framework team sort role divid task agent todai interest wait develop robocup concept gener interest creat complet separ current support genet program develop tool debug direct develop fruit add framework provid set develop tool develop creation agent tool interest layer disclosur tool provid cmunit tool graphic show agent believ debug type debug type retrospect analysi store data game watch game inspect action agent type interact analysi pro activ analysi interact analysi current state agent inspect step execut agent game major problem interact analysi support step featur current soccer server area develop support debug system interest realist debug featur chicken linkop server connect agent data agent visual current state inspect debug hope continu work add improv discuss event creat team compet swedish european appendix user manual introduct preliminari version user refer manual system develop robocup agent consist section section short introduct softwar section modul make complet system latest inform current readm file includ latest inform instal softwar instal file includ download latest version includ latest version inform develop problem current unix socket manag standard templat librari compil support cc overview softwar packag system consist basic system framework librari basic system softwar packag basic framework packag file softwar packag detail section gener part file includ compil direct type packag compil direct flag set control compil packag type type packag extra set compil direct type librari packag machin depend compil direct type direct type includ packag section describ packag librari section describ function librari modul system librari singl unit collect class librari includ header file class includ file class extens definit class file includ extens cc compil direct direct defin librari compil trig deg function return angl trig rad function return angl radian except except debug debug featur direct compil fail data type data type encapsul machin depend implement depend data type machin depend data type shown tabl defin machin depend definit chang match size data type local system basic number type unspecifi maximum minimum size type affect rang valu type shown tabl tabl machin data type type sign size descript integ integ integ sign integ sign integ sign integ sign float sign float tabl data type type sign min size descript integ bit int sign integ bit float sign float bit robocup type robocup specif type shown tabl defin librari templat templat repres radian vector point type templat repres basic angl coordin templat repres collect object call type object collect type specif type shown tabl defin librari instanti templat defin librari shown tabl modifi type modifi featur modifi confid observ time tabl data type robocup concept type valu descript view width vw vw vw vw unknown type repres concept view width view qualiti vq vq vq unknown type repres concept view qualiti cmd type cmd cmd cmd cmd cmd cmd cmd cmd cmd cmd cmd cmd type repres server command side line sl sl sl sl sl unknown type repres side line marker goal goal flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag flag unknown unknown unknown flag type repres marker tabl data type concept type valu descript side type repres side field team team type repres team plai mode pm pm kick pm time pm plai pm drop pm pm pm pm half pm time pm extend pm kick pm kick pm kick pm kick pm kick pm kick pm free pm free pm free pm corner pm corner pm corner pm goal pm goal pm goal pm pm pm pm goali pm goali pm goali ball type repres game mode tabl templat type int unknown unknown float unknown float add featur unknown confid factor observ time implement templat test basic type modifi instanti basic type basic idea creat class attribut store type templat extra attribut featur class implement basic arithmet oper special oper modifi method call return modif discard inform store variabl case unknown variabl throw special oper unknown modifi make unknown special method make variabl unknown return refer return true unknown confid modifi make add confid factor special method return current confid set current confid compil direct call pessimist observ control confid valu updat arithmet modifi valu set lowest confid highest observ time observ modifi make add timestamp special method return observ set current observ return number cycl observ time time compil direct call pessimist observ control observ time updat arithmet modifi valu set earliest observ time latest standard modifi work templat angl coordin special version modifi call unknown confid observ time similar basic system section describ basic system creat creat agent basic creat main function start part code basic agent function rs debug compil direct debug defin librari compil constructor unit section initi agent base class send init messag server write class section basic system differ class start sensor interfac start view manag discuss section control constructor const cycl const const const visual pointer current server actuat object cycl length length cycl step interv server poll step interv bodi visual step interv messag visual step found sensor constructor pointer sensor interfac object sensor interfac constructor team team team string infer team player belong actuat constructor pointer actuat interfac object actuat interfac constructor maker constructor const actuat const sensor pointer actuat interfac object pointer sensor interfac object tabl event maker event gener tick intern clock tick intern clock start receiv sensor data receiv sensor data receiv actuat feedback receiv aural sensor data receiv physic sensor data receiv visual sensor data init receiv init data sensor error cycl start control estim cycl start time send command late bodi action perform previou cycl bodi action perform previou cycl add make creat class inherit class start main loop implement event handler control call event handler tabl implement basic agent basic class sensor sensor inform call method tabl valu basic sensor interfac reset begin data current cycl send command send command server creat pointer command object creat command send server method actuat interfac tabl tabl public method class descript call control cycl start call control cycl forc start user current time marker appli function fn marker number marker messag line appli function fn line number line messag player appli function fn player number player messag bool return true ball messag float unknown return distanc ball return direct ball float unknown return distanc chang ball float unknown return direct chang ball view qualiti return view qualiti view width return view width float return float return effort float return speed return direct head return number kick made return number dash made return number turn made return number made return number turn neck made return team return team side side team side side team uniform number plai mode plai mode score score team string messag coach string messag player command server tabl public method class descript interfac actuat call actuat bool add command send queue framework creat agent creat agent framework creat main function start part code basic function rs debug compil direct debug defin librari compil constructor unit section initi agent base class send init messag server write class section view view basic compon inform process inform process transform data sensor inform view detail special inform store view special skill subject process part import issu minim redund inform make view link view process store inform solv problem depend updat uniqu number view updat make discov circular depend view process store inform make inform arriv access raw data server inform store view data sensor interfac class variabl make work assign address sensor interfac object view reachabl view manag store view order inform view method type updat system call view manag server cycl begin call method sensor interfac call chanc data store sensor reset call init arriv server call inform arriv server call audio inform arriv server call bodi arriv server call command server kind data sensor interfac previou section view inform arriv sensor interfac view manag time updat xxx type view manag gener uniqu updat number iter store view call method updat number argument method check view updat updat call method view updat view detect circular depend abort program view updat inform view call updat number store view updat cycl method view call sensor interfac updat updat method call sensor interfac updat sensor interfac updat data store chanc view data store sensor interfac current server cycl time view make readi cycl view pointer call public method access public attribut pointer view object view manag view store call argument view symbol constant found view return view doesnt exist pointer object exist problem pointer type correct static cast templat convert pointer type convert ptr ptr static cast iew creat view creat instanc view store view view manag call view manag address view persist flag persist flag set view destroi destroi view pointer view activ system activ pointer view view manag view deactiv call reason store view view manag make rest system extend basic rule creat view inform view extend chang code exist view extend exist inherit view extend add thing miss redefin method write add function inform process creat view creat view inherit view start write updat method defin view inform arriv cycl begin store data creat data structur initi destroi suppli method extract inform store access store pointer view object initi constructor view access exampl code view includ view includ view suppli version hope add view user view work send view store paramet make agent independ actual server configur method command line option read config true start player set team agent store inform statu game score current calcul effect command execut current cycl give total movement vector agent ball current cycl total turn angl agent neck store inform marker field give absolut rel distanc direct marker track agent statu absolut face bodi neck track ball rel distanc direct rough estim item track player access oppon unknown player give inform absolut rel distanc face direct uniform number game view sensor interfac player view marker view agent view ball view command view paramet view depend current cycl inform depend previou cycl inform figur depend view view depend figur detail descript view section predic creat instanc predic call return true creat predic creat class inherit class implement bool method extend exist predic creat class inherit predic extend call method function rewrit scratch skill creat instanc skill check skill applic call method return true applic command gener skill call method skill call cycl set persist flag skill flag check method creat skill creat class inherit class implement bool bool method extend exist skill creat class inherit skill extend persist method creat skill inherit skill creat local instanc skill extend call persist method implement class basic agent basic system extern void str int actuat sensor server return return main loop void wrong basic maker return void counter counter counter void const const cmd cmd null void void basic agent framework int return bibliographi march minoru asada hiroaki editor robot soccer world cup ii springer bratman practic reason harvard marku jan wendler humboldt practic theori hiroaki robot soccer world cup page springer jan pascal kai ralf humboldt minoru asada hiroaki robot soccer world cup ii springer coradeschi make challeng ai robocup soccer simul system coradeschi paul user orient system develop behavior base agent minoru asada hiroaki robot soccer world cup ii springer klau fredrik johan helmut itsuki patrick peter manual ver patrick doherti integr softwar system architectur linkop electron articl comput inform vol decemb jame firbi build symbol primit continu control routin intern confer artifici intellig plan system morgan kaufmann san stanlei franklin arthur graesser intellig agent page fredrik short descript robocup team simul leagu linkop electron hiroaki editor robot soccer world cup springer hiroaki milind peter manuela hitoshi itsuki minoru asada robocup synthet agent challeng fifteenth intern joint confer artifici page san morgan kaufmann kleen introduct princeton patti mae agent network architectur sigart jorg muller design autonom agent layer approach jorg muller agent thing jorg munindar anand intellig agent intern workshop agent languag newel simon comput scienc empir symbol search commun itsuki hitoshi ian frank soccer tool research multiag system appli artifici robot world cup initi march robocup simul team repositori march soccer agent librari march web site march stuart russel peter norvig approach introductori artifici intellig stuart russel peter norvig artifici modern approach prentic hall paul johan tobia nilsson chicken iii manuela enrico hiroaki robot soccer world cup iii springer soccer server march richard steven unix network program vol upper saddl peter stone layer learn system phd carnegi mellon peter patrick manuela veloso champion simul team manuela enrico hiroaki robot soccer world cup iii springer peter patrick manuela veloso layer agent fourth intern confer autonom peter stone manuela veloso simul team hiroaki robot soccer world cup springer peter manuela patrick rilei champion simul team minoru asada hiroaki robot soccer world cup ii springer manuela enrico hiroaki editor robot soccer world cup iii springer michael wooldridg nichola jen intellig theori practic knowledg engin michael wooldridg nichola jen pitfal agentori develop
IR/1248 5 automat text detect track digit video david doermann abstract text scene graphic ad video provid import supplement sourc index inform clue decod video structur classif paper present algorithm detect track text digit video system implement featur extractor feed artifici neural processor detect text block text track scheme consist ssd squar modul find initi posit modul refin posit experi conduct varieti video sourc show scheme detect track text robustli keyword text text video digit neural network introduct continu larg amount digit video demand true content base index retriev system content index primarili manual annot close caption transcrib audio work content analysi video area progress made detect recognit text text scene graphic ad video import supplement sourc index inform sport product scene speaker movi program introduct special announc imag text supplement li ds doermann languag media process center autom colleg park nation institut standard technolog md summar visual present transcript search easili refin access textual content high text digit video divid scene text graphic text scene text scene captur camera exampl scene text includ street text truck write shirt graphic text mechan ad video frame supplement visual audio content ad structur close relat subject scene text domain scene text uniqu identifi object relat previou work extract graphic text scene text difficult detect extract due virtual unlimit rang shape import applic video analysi sport event text span ten hundr frame digit video exploit tempor coher text track reduc process time appli step enhanc maintain integr detect inform mean enhanc literatur shim make multipl frame inform reduc incorrectli identifi text address problem track text video text frame extract save result duplic text string goal detect graphic scene text track robustli simplist solut perform text detect frame frame match text block consecut frame video digit frame text detect frame absenc context prohibit make fact text remain scene consecut frame reduc complex perform text detect process period track process hybrid network segment detect text region modul track detect text text contour inform refin track result ii text detect video frame literatur text detect method typic connect compon base textur base cc base method extract text difficulti text touch graphic happen digit video text complex background jain present text extract system treat text distinct textur cluster classifi pixel text video frame natur scene leav tree grass field textur similar featur text overlap methodolog small window scan imag classifi window text neural network feel learn classifi text effect cluster techniqu artifici neural network natur choic classifi abil learn neural network approxim nonlinear function train success neural network relat problem motiv reli neural network classifi identifi text region facilit detect text pyramid imag gener origin imag halv resolut level extract text region level extrapol origin scale diagram text detect scheme shown figur featur extract select analysi scale space method identifi spatial frequenc content local region imag wavelet imag provid success approxim imag downsampl abil detect edg filter filter creat success approxim imag detail signal textual content easili imag decomposit shown figur origin imag wavelet decomposit note text region show high activ result local wavelet locat edg yield larg wavelet make text region detect high frequenc featur comput imag central moment featur subblock calcul central moment featur calcul subblock level pixel left fourth level featur window conduct featur salienc analysi reduc featur set larger featur set requir train sampl time text block collect split train test set featur train train set appli classifi test data error rate analyz salienc featur determin featur yield adequ separ class practic error rate estim finit set label sampl class featur lowest error rate select origin featur fed neural network detail found artifici neural network classifi select train neural network neural network consist hidden output node easi repres sampl difficult repres sampl span vast space handl problem bootstrap method recommend sung poggio train neural network idea train sampl collect part train train process creat initi set train sampl includ complet set text sampl partial set sampl train network sampl run system video frame text add imag block network incorrectli classifi text sampl set repeat step process converg text detect train neural window scan video frame classifi window text view output neural network map function map featur set real threshold window text larger window smaller number window process refin result shift window pixel step singl window classifi pixel window label text pixel cover text window label result classif label map origin imag figur video frame figur label map figur show extract text region text label small isol area incorrectli label text size constraint block filter small isol area bound box text area gener connect compon analysi text window depict figur pyramid approach detect text wide rang font size detect step appli bound box map back origin input imag bound box level overlap box simpli merg origin imag text string part text string multipl level box detect level overlap case merg form bound box iii text track text track process start text motion digit video simpl linear motion scroll movi complex nonlinear motion zoom free movement scene simpl imag match techniqu track text robust techniqu requir goal design scheme effici track text simpl complex motion arbitrari motion encompass wide rang motion transform reliabl visual track object complex environ requir integr visual criterion emploi assumpt modul select complement treat text line close set bound box text line correspond boundari boundari interior provid complementari determin shape determin content integr track modul base imag content shape make track process power stabl gener ssd modul measur similar imag content interior make inform text contour refin posit text block boundari rest section give detail implement ssd base modul text track camera text pattern imag intens complex wai text block current frame obtain move point text block refer frame amount ffi repres affin ffi deform matrix displac vector minim ssd match basic track algorithm refer text block search region imag determin paramet deform matrix displac vector minim ffl solut equat complex qualiti estim depend factor textur imag amount camera motion frame assumpt small simplifi equat set deform matrix ident matrix equat simplifi ffl model equat pure translat model model translat paramet determin search space rang predict locat simpl predict techniqu locat accur text posit current previou frame text posit frame express pure translat model track case simpl motion static text figur show track movi credit text line track move clean background complex background middl text line correctli track figur show graph ssd pure translat model adequ handl rotat perspect distort long sequenc error accumul point tracker lose target figur show track result track text line confer video sequenc ssd small consecut frame tracker gradual lose target frame text stabil text undergo complex pure translat model track text contour stabil track process stabil process implement effici match text posit gener slightli larger text block assum real text posit includ gener edg map calcul canni edg edg map threshold imag avoid difficulti identifi normal text text appli horizont process edg map group form text block extract connect compon posit repres refin text posit figur show initi match posit figur show refin posit scheme work text move clean background text move complex touch graphic object contour extract process oper slightli enlarg box leav extra space contour text contour larger actual size order deal check ssd consecut frame text move complex ssd consecut frame larger ssd clean background pixel valu background chang case stop stabil process depend pure translat model track text text move complex background smaller stabil process start match reduc complex modul comput cost track larg text line reduc process perform match fine hierarch fashion gaussian imag pyramid frame size gaussian pyramid form combin gaussian imag frame frame number ng repres level pyramid match conduct start resolut level contribut determin posit match level figur illustr process search minimum ssd start level window size match point found level search minimum ssd conduct pixel window size process continu finest resolut reach maximum displac support search smaller requir displac doubl level total displac reach finest level level pyramid depend size text block text line small pyramid form match conduct directli origin imag scale motion statu analysi goal system track text gener understand text motion facilit track process text line scroll deduc text line bottom video frame restrict costli text detect process small region text cross frame analysi motion statu track text correctli newscast announc cross bottom tv screen track text line case virtual text line bigger frame separ text line word track word find word text line move horizont direct word continu deduc text cross monitor area text word iv implement experi implement tool base method text detect tool text track tool text detect track tool program written run sun workstat solari evalu perform tool experi text detect collect set data experi set data consist kei frame select automat collect mpeg video clip transit kei frame detect select algorithm data set includ frame text select cabl tv captur video digit board sampl includ scene graphic text multipl font size style detect procedur requir sun ultra workstat process frame unoptim code classif featur postprocess imag input output evalu text frame detect text frame detect check video frame text video applic output frame text frame text video text remain frame text matrix text frame detect shown tabl metric commonli inform retriev summer text frame detect correctli detect text frame detect text frame recal correctli detect text frame text frame recal low part number frame text frame dataset evalu text block detect data set evalu detect text block text block text line close total text block frame correctli detect algorithm miss block misclassifi text block text block detect recal error occur primarili low resolut small text block size attempt ocr overcom problem text track collect ten video sequenc experi text track wide varieti video includ movi tv footbal game confer video descript video sequenc motion tabl ii conduct experi step studi perform text track manual initi posit text filter effect text detect quantit evalu track accuraci easi lack ground truth data output track result form mpeg video view websit track result shown figur experi show tracker work text simpl motion motion complex background clean text move arbitrarili complex tracker frame adjust posit text move clean background figur initi posit touch object edg text size track posit deviat frame adjust text grow larg separ map track number athlet jersei footbal game task complic athlet camera block level evalu conduct data set ground truth block level data set motion tracker lose part target frame adjust correct posit averag track time text block frame text line larg match reduc time track text text block tempor correspond block perform detect frame extra time requir find correspond block consecut frame part experi combin text detect track modul shown figur text detect process perform frame detect text line enter frame text track process appli find tempor correspond consecut frame figur show track result movi star war frame includ scroll text figur show track result text line detect horizont scroll analyz motion statu divid line word track process time number text line frame track movi credit time video type text line frame movi credit movi star track frame averag number text line frame track text footbal game text line move detect text tempor correspond text block limit system text track start text detect text detect modul system miss text tracker imag match approxim posit text contour refin posit system track text speed predict predict posit text limit tracker difficulti text move move complex background sport video track athlet text occlud quickli athlet jump rotat present system detect track text digit video automat hybrid network base method detect text region track modul imag match find initi stabil refin match posit system detect graphic text scene text font size track text undergo complex motion focu make detect track text build video index retriev system refer repres video retriev proc acm multimedia pp digit video acm intern confer digit multimedia digit pp signal process techniqu speech recognit noisi signal vol pp ak jain text locat imag video pp automat text locat method index structur video journal visual commun imag vol pp text recognit digit acm pp text extract video annot pp zhou text www pp em text acm intern confer digit imag pp ak jain segment gabor filter automat document machin vision vol pp document page segment soft ieee tran vol pp bs segment neural neural network signal pp prentic sk jm ce jc network automat target neural vol pp ds text extract track digit tech colleg sung learn human face tech ai memo paper gd hager pn region track parametr model geometri ieee tran vol pp shi featur pp ds ki retriev video compress proc spie confer multimedia storag archiv vol pp list tabl matrix text frame detect ii video sourc experi list figur scheme text detect track digit video architectur detect text video frame wavelet decomposit video origin level imag origin classifi label segment text segment text area postprocess bound box gener model track movi credit initi posit manual track graph ssd consecut frame ssd higher frame text line move complex background exampl confer video scale chang rotat text posit refin base contour stabil initi match text slightli enlarg text edg refin posit detect result text larg font text font style normal text text font text font style multipl resolut base imag match text block pyramid frame imag pyramid form frame match process conduct imag scale demonstr perform video sourc initi posit text block manual zoom scene text track text footbal athlet jersei track text confer room scene text detect track movi star war static text zoom text scroll zoom languag media process frame frame frame frame text text tabl matrix text frame detect track process detect process fig scheme text detect track digit video video video frame text motion id type number line descript movi credit complex movi credit scroll static sport complex sport complex confer complex confer complex scene cross tv program zoom commerci cross tabl ii video sourc experi pyramid input imag classifi pyramid output imag neural network wavelet decomposit featur extract normal integr scale fig architectur detect text video frame fig wavelet decomposit video origin level imag fig origin classifi label segment text segment text area postprocess bound box gener frame number frame frame frame frame number ssd fig model track movi credit initi posit manual track graph ssd consecut frame ssd higher frame text line move complex background frame number frame frame frame ssd frame number fig exampl confer video scale chang rotat fig text posit refin base contour stabil initi match text slightli enlarg text edg refin posit fig detect result text larg font text font style normal text text font text font style fig multipl resolut base imag match text block pyramid frame imag pyramid form frame match process conduct imag scale fig demonstr perform video sourc initi posit text block manual zoom scene text track text footbal athlet jersei track text confer room scene fig text detect track movi star war static text zoom text scroll zoom fig languag media process frame frame frame frame
HCI/1249 4 adapt displai person object audienc graphic design art histori kansa submit program media art school architectur partial fulfil requir master scienc media art scienc massachusett institut technolog februari massachusett institut reserv author program media art scienc januari certifi judith assist professor media art scienc thesi supervisor accept stephen graduat studi program media art scienc collect adapt displai person object audienc graphic design art histori kansa submit program media art school architectur partial fulfil requir master scienc media art scienc februari thesi judith assist professor media art scienc abstract current network system onlin applic provid opportun displai share person account underli social context frame interact exist categor manag mechan digit content design focu data handl regard social circumst content share share larg collect person inform mediat tool account social scenario surround interact thesi present applic manag digit pictur intend audienc goal creat graphic interfac support creation fairli complex privaci displai digit photograph simpl graphic enabl collector creat wide rang audienc arrang digit photograph system user express prefer share person pictur disembodi environ web system introduc origin approach present interfac photograph collect view applic account view histori photograph integr text comment imag collect adapt displai person object audienc peopl serv reader reader brian smith assist professor media art scienc mit media art scienc reader rachel cinema interv research corpor acknowledg accomplish media lab outcom emot support found uniqu environ research develop vacuum true thesi sincer grate support receiv judith judith great deal freedom explor idea excit topic set explor sensit sion import interfac design inspir light work lab reader thesi insight encourag brian smith learn research learn good humor compat research rachel shown work subtleti involv act collect object integr technolog work collect team effort deepli indebt great programm turn collect brian bower matt lee find stick collect toolkit matter amaz interfac collect colleagu sociabl media group discuss project highli insight david roi rebecca dana learn great deal special endur persist technic question great offic mate friend made media lab believ accept master program media lab ron believ appli media lab celebr mileston guidanc academ process tough linda peterson dai media enorm faith david nguyen love sister sister love parent uncondit support believ set mind dedic thesi um dia ter de tem todo tabl content introduct collect work overview system categor toolkit collect audienc kei categor experi view applic montag view experi theoret framework disembodi dissoci audienc boundari social situat privaci social concept collect system interact construct mean futur work collect system todai futur scenario home infrastructur architectur layout tempor layout sensori layout bibliographi introduct domest environ primari space peopl store displai thing import object highli invest sentiment big part defin space home numer collect thing peopl chosen insid wall collect object defin individu function express construct surround music collect world object surround increasingli rethink concept articl import part interact digit world fast approach futur book photo music listen home crucial find wai relat interact comput object advent internet world wide web made ple share comput object displai fit network comput past year wit power public displai mode vari sphere group chat interact experi network world limit essenti social cue presenc activ unresolv establish manag ident disembodi inform eral easili problemat administr privaci challeng task digit environ creat network structur internet network peopl commun wai digit world inher transform intens social environ connect connect peopl stand digit world cold lack social cue subtleti present physic world limit point thesi approach technolog object social viewpoint project bring notion collect digit object entiti extend technic essenc inhabit social world import part social process regard collect part commun transact carri social unlik current inform ment deal digit collect pure technic perspect search system collect address wai collect appropri share displai social context system present support owner digit articul audienc set digit object collect compar collect physic digit collect flexibl potenti dynam digit collect tional object track interact open possibl multipl categor dimens object classifi group qualiti util manag tool enhanc social articul collect data attent paid social util meta data usag tori categor start surround incarn object inhabit digit address social qualiti object explicitli digit object peopl transact thesi concentr person tion digit photographi reason focu li fact photograph highli social peopl pictur moment event util imag reminisc share stori memori share act occur specif social share situat depend pictur share articul vari social context consequ displai photograph collect concern thesi goal system empow peopl displai creat sion ident exhibit comput collect kei function displai social commun person attent paid level public privat displai level integr digit world collect work chapter describ collect system present overview motiv build system proce explain user interfac conceptu made process develop project briefli tion theoret framework involv design project give extens account task chapter expand theori guid construct system overview colleg student late spent summer vacat europ wide rang excit return home began share peopl knew give spoke account trip heard safe clean hotel stai trip made friend heard account fill romanc professor heard aspect visit histor observ differ behavior heard stori stori trip vari style vari number grammat pronunci pace bodi facial hand gestur situat descript uniqu mixtur heard speech fill told truth everydai highlight aspect person experi conceal joshua joshua account trip europ nice illustr notion audienc choic matter social interact interact son exact good unconsci chang situat situat part make highli adapt social flexibl adapt present environ world wide web peopl dynam adapt interact audienc virtual scenario web site peopl share lot person tion qualiti interact cry social tailor real world collect system address adapt present digit content view potenti audienc similarli present version trip collect system user articul graph person collect shown audienc peopl share larg collect pictur web person home page site determin appropri section collect audienc obviou system duce innov graphic interfac support articul vari audienc arrang view digit photograph collect explor origin approach present interfac graphic collect web stai metaphor cal collect view applic investig displai capabl made comput natur digit applic integr text ment imag emploi histori creat evolv digit album system index manag data regard social situat categor tool digit object analysi content photograph analyz collect color pixel form area color describ bodi dog analysi index annot subject matter ing account fact pictur highli famili photo friend applic account fact make lot share imag friend make pictur current categor mechan account social scenario inhabit digit object social environ creat peopl interact peopl share inform mediat environ manag tool address social context share act place thesi set explor approach impart social collect share pictur web term manag person photograph perspect audienc access amount work devot organ retriev major annot system develop specif automat analysi photograph content search task busi applic system incorpor sort index mechan relev social social aspect digit collect explor main approach index digit content search autom search technolog spawn highli ful applic manag interact digit materi term imag index occur extract featur structur textur applic qbic system user perform queri return imag visual similar sampl imag provid system great advantag system level autom featur annot system annot system develop busi applic work situat user deal extrem larg typic task queri item satisfi requir stock photographi client knowledg content collect index system creat automat end user lot time main activ perform situat search specif photograph set photograph fit specif theme concept approach relat content potenti audienc collect base fact reason creat person tion photograph found industri ple build photograph collect celebr ident share pictur al note note experi focu group specif data peopl find lot collect photograph specif goal mind mark contrast busi world experi show ti serendipit discoveri deem import user exampl goal contrast commerci domain individu user deal media annot tool gear person data compil address specif characterist collect system collector categor photograph term intend impart digit photograph social aspect lack current categor system user benefit fact inform media object express term term attribut content semant layer build block annot system design clear flexibl autom system flexibl contextu system price autom social continu adapt social perform context constantli make fairli complex share peopl time share person pictur present natur extens kind social adapt perform social situat reifi set audienc fairli tangibl particip exchang pictur ti peopl present pen meet colleagu work social situat creat behavior occur set pictur share rel pictur share pictur meant friend share famili work collect devot creation system permit encourag construct multipl photograph album intend individu viewer group audienc main research question make categori audienc inhabit social life explicit task peopl articul ri lakoff point categor automat awar problemat challeng support inform util interfac stai oner process current privaci program inform privaci mechan user interfac gram receiv attent collect util graphic interfac unlik easier flexibl wai appli review privaci polici relat potenti set audienc photograph collect system categor imag annot system research effort guid consum industri audienc make autom capabl account differ scale fact user familiar entir collect pictur system assum peopl classifi photograph narr base annot process sole content imag aim establish social annot digit collect content collect photograph set digit object book fit social context tent intend audienc collector group pictur matic person level categor process address theme make collector term group pictur understood social level categor relat set graph potenti viewer person level articul wai collector perceiv pictur term subject social level refer categor photograph relat intend audienc major task collect system ascertain viewer member specif audienc creat collector viewer audienc part system defin membership action viewer share person pictur highli social determin membership equal social activ make encrypt kei common practic privaci applic collect pose altern determin audienc creation set kei goal creat social authent membership collect distinct categor toolkit view applic categor toolkit deal issu content photograph collect relationship view applic handl present form photograph collect viewer main topic address categor portion collect system defin audienc photograph categor content photograph recogn audienc membership research agenda view applic explor present possibl album digit photograph integr text comment present collect categor toolkit categor toolkit applic intend owner photograph refer collector associ specif set pictur specif audienc place access structur creat categor program made explicit viewer result ensu tion structur main concern portion project make interfac fairli lightweight text entri form minimum flexibl collect fairli specif action coexist interfac challeng graphic convei relationship ou gener encompass mutual audienc categor applic collect review mode intend entri point collector frequent perform task mode interconnect collect joann mother joann research comput laboratori runner rest daughter joann engag movi critiqu daili activ carri social role engag dai make interest explicit shape identifi hard imagin organ person joann term fairli straightforward categori reflect interest role social categori cinema joann specif group pictur audienc structur creat categor toolkit regard privat desir viewer audienc circl part audienc circl exclud visitor site inform part part social awkward inform abil categor pictur content base fact peopl pictur fairli reflect interest group person ture categori correspond person interest intuit fast organ imag vastli vari detail tor joann creat gener set collect fairli specif categori pictur collect system imag part multipl collect pictur show joann push simultan classifi famili flexibl collect digit pictur provid term ment obviou benefit physic photograph collect abil overlap categori map perceiv social find situat clear cut term social term interest social situat highli fluid span multipl categori daili activ shape ident make area interest dent object surround physic digit relat area interest collect system area start point categor digit pictur classifi activ relat pictur area interest procedur collector carri collector organ pictur term subject matter categor dimens cern audienc set pictur audienc joann sit live room pictur develop pictur decid put famili visitor work dai share colleagu ture blur bit grandpar love pictur front piec dai card friend famili joann deal digit pictur determin easili flexibl pictur daughter process simpl essenti natur person decid photo share support tool deal digit pictur web classifi pictur term intend audienc big part activ collect system heart social interact model audienc mode collector structur set enc pictur reflect social interact access el deem regard collect digit imag interact peopl affect percept level social relationship main factor drive kind interact happen peopl adapt social time depend interact collect system interact variabl account audienc displai inform depend displai categor pictur set audienc level defin collector reason ensur categori person relev user audienc rang peopl intim collector access digit content group peopl close collector access public part photograph collect notion design graphic audienc structur built owner collect trivial social good adapt social manc audienc hand part routin skill grant social everydai automat explicitli express relat fairli complic task explor audienc interfac clear model limit deal notion privaci relationship obviou system support varieti action ing structur audienc arrang make overrid pattern audienc combin collector express relat person photograph potenti viewer brought main relationship cover task encompass discret audienc explain relationship support user interfac collect encompass audienc basic support system call pass idea audienc encompass relationship privaci gradient figur ship make explicit notion interact peopl run privaci axi decid reveal point privaci axi regard audienc circl imagin collector creat audienc call ce friend encompass relationship friend audienc encompass acquaint audienc access acquaint access addit access thing access privileg figur encompass relationship made explicit user interfac placement audienc circl insid interfac solut show encompass audienc work manner contour line topographi ferenc show level access point elev slope mountain repres consecut tour line higher audienc repres circl previou access level darker color lower access level lighter color higher access level figur encompass audienc circl access level encompass audienc encompass notion effect relationship map privaci continuum limit model account kind audienc audienc share part content access matter discret audienc discret relationship support collect address scenario multipl audienc share portion content exist distinct audienc access level kind interact mechan common real world time give peopl account event depend talk highlight suppress part stori sake appropri discret audienc circl encompass circl illustr turn back previou collector audienc structur encompass circl acquaint friend imagin collector decid creat audienc circl call famili decid famili greater access acquaint level encompass realiz famili audienc access set photograph friend audienc access creat situat enc requir encompass relationship access audienc addit access distinct part collect call discret audienc audienc discret audienc repres graphic interfac multipl circl inhabit access level encompass audienc figur visual understand contour discret audienc share access level repres color unlik encompass reflect simpl vari discret audienc deal vari content discret audienc exist framework encompass collect system advantag associ make task assign content audienc labori collector previou relat photograph acquaint level audienc friend famili privileg audienc automat access pictur advantag toggl mechan collect audienc arrang featur collector make fairli straightforward group audienc limit abil fine tune audienc arrang crucial aspect social situat manag lack call audienc audienc social situat defin insid collect system support manual audienc fairli treatment audienc arrang collector associ pictur enc audienc automat pictur mode audienc implicit automat imagin collector creat audienc call audienc encompass figur decid pictur acquaint level mean friend famili access pictur automat implicit form audienc figur control audienc ment collect toggl mechan collector exclud portion audienc arrang fit collector decid pictur relat acquaint friend toggl famili circl associ pictur figur complex audienc collector find util toggl mechan fairli includ dispar part audienc ment combin mechan encompass discret audienc audienc collect system creat highli flexibl tem arrang set audienc fairli simpl ical interfac interest interfac question progress project relat discret audienc share content content access audienc encompass solut repres scenario overlap discret audienc map overlap content overlap circl screen problem scale situat discret audienc circl content common circl locat distinct audienc imposs repres share content overlap circl dispar tion circl involv solut limit found toggl mechan overlap collector pick whichev combin audienc circl make independ locat circl figur straightforward screen highlight area toggl collector focu attent circl independ characterist simpler organ visual audienc arrang complex audienc arrang made collect system audienc encompass relationship audienc circl kei collect design support interact mediat environ owner pictur present direct contact creat proxi make ascertain visit site content shown point creation kei collect function link made collector categor toolkit view applic kei viewer gain access content assign photograph collect creation access follow social natur tent applic person photograph photograph collect highli owner abil construct express ident memori peopl share person pictur kind audienc audienc interpret view applic negoti visitor relationship owner site audienc set belong regular solut data secur guard set encrypt kei answer applic collect mechan overli heavi hand privaci task transpar social mean carri negoti visitor content access flexibl consequ breadth privaci scenario made audienc arrang access solut tem differenti gener set audienc specif enc distinct translat kind combin combin collector gener kei audienc audienc circl framework fairli gener member decid question kind inform friend interact model case viewer gener question answer question option view pictur access level ing question higher access level case viewer fail answer question access level fail answer question access total public imag site open screen categor applic audienc mode screen question kei meant gener list creat password inform good applic notion social interact function kind mutual closur share content highli natur privaci support collect system social inform acknowledg exist fuzzi boundari regard audienc set kind audienc kei combin work specif audienc singl person fact collector creat audienc categori singl person good indic special statu mean collector fairli specif photograph mind share individu person ing back view pictur regular basi fine granular audienc demand kind kei approach problem question kei case audienc collector harder pin question person answer support tradit kind access issu creat authent mechan social person natur current import topic design privaci applic creat social richer digit environ collect altern standard access kei type kei social applic deal lic content inform person peopl share kind audienc solut advantag current approach support fuzzi boundari flexibl authent mechan lot field li scope thesi collect creation delet collect set categor experi step categor process illustr collect interact model introduc element categor user interfac open screen present collector review main action mode categor tion figur audienc mode collect relat collect audienc audienc collector defin set audienc associ pictur figur select action item locat placement audienc structur collector build audienc structur encompass relationship discret enc circl creat result circl arrang portion refer mode categor toolkit audienc mode collector creat kei audienc framework collector kind kei attach audienc kei collect mode pictur relat pictur collect collect mode collector defin set photo content imag figur similarli audienc tor select action item left creat collect structur collect function time creation fill ture collector photo tion upload pictur system mode associ collect photograph audienc arrang figur intersect collect enc gener actual collect system defin content access viewer pictur mode pictur relat pictur audienc pictur collector upload imag collect system upload collect attach audienc arrang collector associ entir collect specif pictur audienc arrang associ specif pictur collect system thumbnail left screen set collect screen figur associ occur collector select thumbnail set thumbnail drag select collect review collector select specif audienc arrang lower thumbnail relat select graphic audienc arrang top left portion associ pictur audienc rang work thumbnail left screen audienc circl figur collector select desir thumbnail drag select audienc circl affect audienc circl automat highlight give feedback perform action interact possibl collector select audienc prior associ thumbnail audienc arrang fit pictur select thumbnail drag select audienc arrang review mode review mode collector evalu made associ pictur set audienc collect final creat categor activ figur list audienc arrang displai portion screen collector highlight entri list audienc circl highlight pictur enc arrang displai half screen interfac quick easi monitor result categor made system view applic view applic part collect independ applic categor toolkit unlik categor design specif collector idea interact applic view pictur result made categor toolkit displai viewer part collect project interfac navig possibl displai digit pictur research interest li aesthet express qualiti view experi current applic displai digit photo format interact model physic photograph album applic simul bind aspect regular album figur interfac reli familiar photo fail explor possibl digit medium inhabit turn digit import view applic start investig express displai digit photographi ing characterist continu emul attribut regular photograph album lot gain delv deeper rich medium inhabit digit term investig tion form engag creat wai displai photograph provid peopl tive wai displai photograph collect view applic collect attempt explor present option made digit world applic advantag digit medium creat live present photograph exampl current displai interfac digit pictur world wide web top left album present strive flow text overview graphic collect unifi element continuum expand element ensembl item interact model aim enhanc understand engag photograph collect narr stori part peopl share person pictur view applic digit pictur address integr commentari imag verbal commentari form possibl open rang option term interfac verbal comment assum form comment essenti part interact experi enhanc content aesthet aspect photograph album montag origin concept montag mean inher film object creat defin exist shot object tion sequenc mean view applic imag shown cluster time topic topic collect creat categor toolkit kind displai borrow mean concept montag spatial organ pictur base dimens viewer greater ensembl creat photograph specif pictur comment attach gain cluster unlik physic standard organ pictur necessarili express sort associ comput aspect digit photograph explor visual iti present term time stamp pictur impart mean proxim pictur photograph collect complex arrang moment celebr ident import holist view entir view specif instanc detail collect montag entiti true natur time sequenc open album viewer drag initi squar diagon pictur displai screen pictur arrang time diagram navig section interfac view applic cursor center section scroll occur underneath vari scroll speed shown grasp ensembl view pictur flow collect mean pictur greater scheme collect structur photograph collect readili lend concept montag present displai view experi visitor access view group album album subgroup actual set collect collector categor toolkit subgroup repres portion photograph collect visitor access owner photograph collect set set present visitor acquaint collector access enter view applic visitor access pictur possibl collector tag pictur rel pictur pictur comment attach displai yellow border imag drag diagon comment read pictur view full size view applic access viewer set pictur visitor access collect subgroup pictur collect mention thing true set album visitor subgroup entir group album categor toolkit mechan result privaci made categor toolkit open viewer click squar repres album drag diagon action thumbnail pictur insid album gradual displai screen viewer drag album thumbnail figur visitor cluster spatial organ leftmost cluster oldest set pictur album view screen horizont divid navig section section visual evid viewer clear tion photograph viewer move cursor cluster thumbnail screen view pictur album figur side screen scroll action happen place cursor left side screen album back place cursor side screen opposit effect viewer control speed desir place cursor closer left edg screen scroll speed leav cursor center part screen scroll photograph cluster view detail viewer pictur origin size doubl click pictur displai screen back thumbnail viewer access comment attach click pictur diagon drag find comment gradual plai screen displai comment order attach recent comment shown figur action comment attach pictur close interact model open album pictur comment attach displai yellow border signal special statu diagon drag pictur border navig model view applic button mal graphic aim convei continu accord flow moment memori photograph tion concept scroll comment locat page view pictur actual size displai interact model design specif maintain flow view interfac structur imag part continuum individu element viewer open album comment attach pictur function exploratori mean interact photograph collect viewer option ad comment pictur person contribut discuss pictur viewer click pictur dialog box pop dialog box type comment automat add comment select pictur view applic collect track interact histori ture displai track viewer interact pictur usag collect reflect back viewer time open photograph album record interact histori time viewer stop scroll view applic record time thumbnail stai displai screen viewer open comment relat action record applic track time viewer doubl click thumbnail order pictur actual size action specif thumbnail displai slightli ger time album creat montag thumbnail vari size physic dimens popular show popular photo larger view applic plai concept emphasi creat visual dynam present photograph succe creat evolv reflect made owner collect constantli chang usag viewer theoret framework chapter outlin field studi relat theori guid work collect influenc project rang gener specif practic aspect collect studi ri outlin section greater lesser concept cation inform flow briefli discuss relev theori approach social interact commun act proce explain approach relat work collect notion share inform mediat environ web core collect project provid excel inform content remark social natur share digit pictur popular home page email dwell power photograph bring peopl touch love provid mean updat friend latest event photographi satisfi obviou individu social point photograph prime vehicl preserv memori close relat studi carri physic found object immedi furnitur visual art act share person pictur popular invent phy photographi intim bound domest privat incept bond evid famili photograph portrait imag famili passag wed seemingli existenti relat photograph memori fold individu collect famili narr time evolv connect technolog innov photographi home progress fairli wai era invent stereoscop visit card time advent ital photographi popular technolog innov term question social chang meant wai pictur perceiv wai share pictur stand latest set technolog innov affect world domest photographi advent digit graph realiti internet issu social social adapt wai improv technolog base social import current develop domest photographi digit photograph cess potenti flow converg imag consequ social mean structur innov commun media inhabit primari characterist domest imageri select audienc home home videotap person ful limit group peopl gener peopl context imag interpret exist audienc peopl great pleasur share person pictur audienc select core collect project share person photo social charg great provid peopl tool express prefer displai digit photograph collect audienc arrang main dimens photograph categor collect system domest photographi technic excel subject matter pictur wilson point alic face half lost alic trick imagin real alic believ alli subject matter compil person illustr repres dimens photograph categor collect rememb cluster pictur collect easier task arrang group imag histor photograph imag met social context close relationship spoken word oral cultur link person pictur verbal channel commun major element interact model trigger person pictur exhibit peopl show pictur part deliv ongo commentari stori pictur storytel relat comment stimul addit ture search photograph rich interact present mediat environ web activ share pictur contriv current tool lack abil provid user flexibl wai manag share photograph collect limit result conspicu social situat photo view social rich share person photograph sustain physic world case photograph content post text comment gain import spoken commentari accompani pictur ing physic world view applic collect weav textual displai pictur high regard present imag text creat necess complement pictur accompani commentari abil displai combin manner research goal collect system domest digit photographi view cultur technic crucial understand power commun element social context question digit photograph manag view question social commun applic deal digit photograph support kind social interact inher act share photograph space establish mean domest photograph imag imag technolog digit negoti attent explor peopl medium digit photographi messag audienc member kei research motiv spring provid peopl richer social environ share tion person pictur end categor system peopl manag photograph collect detail regard content plai audienc view peopl engag verbal interact photograph present lore person previou chapter start extens quot joshua rate tailor account summer trip audienc passag nice highlight import adapt vari enc social situat refer adapt behavior social role drama engag social import note activ refer except case peopl touch real pretend speak kind function crucial interact mechan found societi gener pictur peopl activ involv drama allud fact peopl chang learn adher complex system convent scenario fairli dynam pictur present social interact rethink approach understand import audienc present audienc social perform actor begin chapter beg question happen account european vacat parent decid throw parti invit neighbor happen descript trip separ happen put spot give talk trip peopl possibl begun descript parent risk bore friend end report danger parent neighbor felt account design specif enc bore offend part combin audienc clear possibl account bit segment audienc offend present matter situat interact isol audienc kei word time adapt big audienc form peopl distinct stick social offend part audienc combin persona gener role reflect current state affair quickli realiz isol audienc post home page idea audienc control present appropri specif viewer group viewer result limit social interact disembodi dissoci sit rel dinner start share pictur vacat person room tailor stori audienc front deepli engag experi abil decid share pictur decid reveal omit control present abil effect adapt perform social context import skill social technolog mediat conspicu limit provid wai peopl monitor control present inabl phenomena author disembodi dissoci phenomena directli control inform crucial technolog system control crucial order engag peopl activ agent social tion disembodi occur loss control occur mediat environ peopl repres effect flexibl tion result lack crucial social cue reli set abil tailor essenti part negoti imag project world abil primit stage digit world categor capabl collect directli affect level control present viewer side effect disembodi result mediat interact audienc boundari social situat argu person ident static collect attribut relat process peopl construct negoti boundari parti reveal person inform select tacit moral code call duti partial man develop theori set public particip face obviou implic tion extent technolog shape individu abil negoti theori implic technolog design situat situat boundari defin term physic environ locat gener definit hold electron media gener interact media mediat scenario place real inform access definit base implicit issu understand type behavior peopl scrutini term refer specif mean social peopl capabl behavior action term refer amalgam thing learn act commun put inform concern deal social behavior access perform social perform term interact role sever limit concern control content home page content post home page remain matter limit render content home page factual social post thing home thing act factual learn social interact se base mutual argu home page provid sort social interact exist view view act commun occur true act make viewer gain person sort social experi experi rich social interact mediat develop tool social drama enact situat boundari highli variabl static aspect individu potenti infinit pattern situat overlap situat term includ situat defin exclud import aspect design collect categor abil manual exclud peopl specif audienc capabl make interfac lot flexibl term tweak audienc natur situat audienc combin gate audienc result situat present creation situat turn hypothet account european tion set isol audienc quickli realiz result social situat plai behav son plai young man adapt merg audienc plai role note perman deepli affect result qualiti interact big differ effect merger audienc combin audienc rare occurr occur peopl expect resumpt isol action true virtual world combin audienc cyberspac greater effect social behavior limit web radic limit set social situat encount electron media affect primarili content media chang social life true audienc pose virtual privaci capabl explicitli implicitli negoti boundari condit social relat privaci situat person voluntarili yield highli person inform privaci mundan inform guard great care categor applic collect system touch critic issu privaci internet person photograph kind object highli invest person mean constitut import content owner privaci solut multipl set encrypt kei thought answer problem crucial design altern solut kind social content exist broader understand privaci depend context commonli held legal philosoph view privaci focu restrict access area life notion privaci inevit altern interpret late aspect norm definit concept person privaci inher link control aspect life view cialli appeal inform system part social context explain peopl control person inform level view synonym natur privaci defin varieti freedom freedom function grant individu control public privat respect aspect life notion digit persona roger clark view digit inform part individu social ident world control person inform control aspect project world expand scenario mediat realiti control inform exposur crucial ment defin entir ident root inform made peopl current control mechan basic inform access binari layer commun web site case point fairli popular site host web portal figur group peopl share contribut messag share calendar post updat note chat live social multipl peopl share form digit prevail mode inform access base person membership group site access model creat binari person access site access result social scenario sever limit kind interact peopl feel comfort perform social interact commun site constrain perman merg isol enc inabl particip negoti interact boundari interact group peopl highli dynam current commun site offer proper support flow natur exchang differenti social situat commun step direct creat tool support person disclosur tion abil negoti audienc boundari creat interact collect attempt creat condit individu exert control receiv feedback person inform main goal system provid control inform involv negoti audienc boundari unlik typic access privaci rule binari natur person boundari negoti mean myriad evolv choic base reciproc parti involv categor portion collect strive give collector flexibl express interact prefer regard digit content enjoi share point author major shortcom applic li inabl support mean modifi monitor polici lot time difficult user inform exampl commun site world wide web top left altavista yahoo softwar track polici inform access system fail give adequ feedback person content broadcast shown limit deepli affect user crucial element manag person inform privaci applic collect system base shortcom address creation user interfac lot express user intent program text collect heavili reli graphic visual polici result outcom regard content review mode categor tion collect design fulli address monitor polici result modifi mistak made categor activ creat graphic interfac support creation fairli complex privaci abstract face found applic social concept collect system categor matter lightli basic categor speech abil function physic world social intellectu live understand categor central understand central stand make human georg lakoff collector build audienc collect system encourag user articul categori social relationship part audienc circl make social bond explicit articul relationship easi task categor process automat unconsci collect interfac design facilit categor activ involv relat set pictur potenti viewer present collect graphic interfac interact model base concept field social relat notion categor kei idea design structur system user membership prototyp exemplar view categori classic view concept ber categori equal repres membership categori matter binari simpl fact ple appl repres fruit concept oliv member categori fruit notion work deal social categori flexibl structur categor focu boundari toler ill defin qualiti social interact collect membership translat abil user defin lap categori object thing fit singl span classif social psychologist natur featur defin categori consensu model combin prototyp exemplar view briefli prototyp view hold peopl poss summari term prototyp exemplar view hold carri abstract model categori defin categori base set base specif instanc classif collect system deal level abstract natur prototyp illustr qualiti instanc exemplar categor interfac encompass visual hierarch structur classif actual set member specif categori approach user organ collect whichev model intuit depend task hand conceptu bear social cognit research inform design collect deal organ set concept organ organ hierarchi realiz level bring mind attribut bring mind bring mind final bring mind sweet refresh level import level abstract turn level special statu call basic level level intuit object note peopl level abstract basic level distinct goal level familiar subject hand case social level basic flexibl vari context depend goal case social concept flexibl natur social design collect adapt order properli reflect model build assign categori collect user base collector level social overlap specif gener order repres multipl wai displai digit collect interact construct mean mean possess realiz transact person transact activ sign simpli physic behavior involv physic behavior import object interact influenc interpret qualiti nth listen favorit piec ing sunset activ involv element make experi uniqu complet point act interact object construct mean object deal pure ital graphic interfac portal transact repositori extract mean crucial attent paid qualiti interfac situat case collect digit challeng address individu object collect action occur case span collect individu consid element continuum mean construct emerg transact object import featur function world digit enthusiasm autom lead great part comput applic transact peopl digit object activ scenario interact parti minimum lot autom view comput industri desir characterist comput technic social cognit desir contrari comput tool involv manag photograph lead human process categor collect graph main wai peopl interact enjoi photograph memori moment collect system belief desir turn process fulli autom mechan creat categor process support construct interact collect system address manag highli person sion peopl make share person photograph graphic interfac highli user lightweight mean express complex interfac collect photograph articul complex social scenario collector set audienc make match pictur audienc unlik privaci element involv creation share polici repres ing process set act match pictur audienc collector constru mean audienc structur categor process function person view process collector pictur engag process process made tangibl graphic face cognit awkward task express audienc text form futur work chapter situat work collect encompass research agenda chapter divid section collect system todai section futur scenario section outlin addit improv system stand todai briefli explain vision explor displai person digit object inspir collect system outlin futur direct project scope current project collect system todai categor toolkit place collector manag creation audienc format privaci interfac fairli clear legibl relationship access kei displai relationship crucial user point affect tent share work interfac creation access kei categor toolkit collect import improv interfac collector visual real time kei affect set audienc concept gener secur privileg negoti approach identifi authent pursu work thesi attempt creat situat digit world rich social cue categor toolkit extend privaci base audienc set count extra time social interact peopl interact learn relationship evolv element evolv account collect system view applic track content shown peopl ing order photograph applic gram shown addit content import improv categor toolkit give collector abil plai access level control access level text comment attach specif pictur system comment tailor pictur tailor ferent audienc situat imag group friend bar caption parent access imag imag access close caption read night yard beer walk back hotel room situat bound happen member fairli specif enc access highli privat content comment public ture relat privat photo comment view member gener audienc happen pictur question gener comment make top possibl inform pertin privat enc pictur privaci level ment attach address system audienc structur creat collector text comment tion term potenti viewer view crucial viewer attach text comment group pictur limit comment individu photograph montag draw express strength relationship surfac arrang asset expand ment stori attach pictur featur interest possibl pictur arrang audienc pictur arrang audienc abil attach comment group pictur inher touch issu extend audienc access graph text comment discuss previou brian smith provid presenc visitor photograph album kind inform high interest collector view applic instant messag mechan visitor commun presenc owner site abil commun real time readili lead peopl album gener spontan discuss photograph content asynchron post comment case present collect futur scenario home peopl physic space home storag import displai area thing import object home highli invest sentiment big part defin space home numer collect thing peopl chosen insid wall peopl surround music collect object longer physic surround interact digit object realiti life todai move deeper realm digit lot object physic environ start disappear digit void lose physic object lose function object attent paid render individu digit object attent paid displai collect digit object displai tion import part defin surround present er displai digit collect potenti express adapt displai physic item peopl rearrang book pictur anticip guest contextu digit domain current version collect system deal manag displai photograph inform world wide web design function home page web site displai digit object limit web environ crucial explor wai bring presenc digit object physic world inhabit main futur research direct collect project appli lot current function creation system deal displai digit object scope digit photograph physic environ system collect comput object comput box place world vision assum domest scenario plai myriad ubiquit devic space multipl displai awar time presenc peopl object tightli grate express medium physic symbol set home system work seamlessli goal system empow peopl displai creat sion ident exhibit comput collect kei function displai social commun person attent paid level public privat displai level integr home set infrastructur idea make collect digit object domest ment kind research project main interact situat digit collect interact situat function trigger mechan arrang displai digit object underli structur aspect common digit collect architectur tempor sensori layout architectur layout describ physic room start displai fact physic construct familiar inhabit import aspect interact scenario structur enc wall ceil bedroom live cognit differ attach physic construct crucial digit collect displai home relat structur cognit distinct kind connect enrich prospect interact experi relat physic context network system multipl displai unit approach answer question physic descript space sociabl media project call understand physic space displai unit possibl neighbor left unit absolut locat coordin room simpl effect integr network displai constraint physic locat displai pass piec work code element view displai possibl displai part collect multipl displai assemblag object displai form entir tent tempor layout describ term main element defin home environ rhythm thing happen insid domest tempo repeat digit tion flow awar tempor dimens environ server portion system track simpl calendar calendar kind tempor time time inform specif import calendar time time inform track time dai night week dai versu weekend holidai observ famili peopl wake back sensori layout understand room term sensori intent creat interact experi user input pen sole direct data entri comput futur tion system resort technolog scenario total control physic environ system trace physiolog problem highli home environ system approach make home sensori ment emploi sensor track proxim feel relev kind data project present system design manag collect digit graph term intend audienc project introduc graphic interfac address creation fairli complex privaci relat photograph potenti viewer collect address creat tool support person disclosur inform abil negoti audienc boundari creat relev social tion system present innov approach displai digit pictur advantag comput inform digit ture displai interact dynam cluster pictur screen discuss notion share person content mediat environ exchang pure send receiv engag social process exchang order interact social relev design tool categor pure content account social context interact place place larg futur success mediat interact depend tool social situat frame discuss social situat import audienc share onlin photograph collect core topic address tion system major part effort categor toolkit devot op sound interfac support scenario audienc arrang collector express categor pictur privaci central part thesi import abil control discuss theoret framework project appli design system creat wai authent ident term applic crucial system altern kei access part digit creation kei mechan flexibl negoti ident visitor site portion project work lot term give collector understand answer structur affect potenti viewer site system present featur separ applic explor displai collect photograph web view applic tion attempt creat altern displai navig larg tion digit pictur view album wai album record provid viewer evolv view collect popular pictur displai bigger time viewer back album text comment discuss part displai tightli integr pictur relat bibliographi marc technolog landscap mit altavista victoria privaci multimedia comput commun technolog landscap mit pierr social critiqu judgement tast harvard richard snapshot version life bowl green state popular ronald framework annual review inform scienc technolog vol andrea light id magazin eugen mean domest symbol cambridg mark media icon visual languag video ieee symposium visual stan futur perfect judith inhabit virtual design social environ electron commun doctor dissert institut victoria awar coordin share work space acm confer cooper novemb keith polici role collabor applic acm confer cooper novemb select theori montag vol ii al queri imag video qbic system vol septemb photographi societi david place photograph imag digit cultur richard aesthet film comment vol number anthoni consequ modern stanford anthoni modern stanford behavior public note social organ gather free present everydai life anchor relat public basic andrew danc distract music popular cultur minnesota ed optimist princeton architectur david photographi jonathan ann alter appropri photograph juli isol oxford david domest grammar motiv journal american cultur vol number ann rock music consum cultur al consum multimedia organ retriev system social make peopl mit georg danger categori reveal mind chicago al privaci interfac inform manag commun acm vol number octob paul soft natur histori futur inform revolut michael time mean famili pictur ed introduct photograph imag digit cultur memori ident matthew lee marshal understand extens man book joshua impact electron media social behavior oxford tool manipul imag intl journal comput vol henri book bookshelf joseph mass frontier busi competit harvard busi school christin invent collag yale elizabeth commun commun internet relai chat dept rocket peopl organ bc annual colloquium inform retriev april arnold ed human behavior social process houghton barbara ed cognit categor lawrenc erlbaum privaci technolog landscap mit dan player offer onlin commun report don photographi digit photograph imag digit cultur ed martin categor dn ed invit cognit scienc mit model social judgement psycholog john fulli autom imag queri system acm intl multimedia multimedia nov imag video search catalog tool web ieee susan photographi soni jo put person photograph mari ann power histori exhibit instal museum modern art mit eugen al field experi compar attitud type organ journal appli psycholog vol number gregori human behavior social approach houghton collag harri photograph public apertur sol studi visual commun pennsylvania yahoo club
ML/1250 6 optim aggreg algorithm middlewar ronald fagin naor assum object attribut object color red shape round sort list object grade sort grade grade monoton aggreg combin min combin individu grade obtain grade determin top object naiv algorithm access object find grade attribut fagin algorithm effici monoton aggreg fa optim high probabl worst case analyz eleg remark simpl algorithm threshold optim stronger fa show ta essenti monoton aggreg unlik requir larg buffer size grow size ta requir buffer ta earli approxim version top answer distinguish type sort access middlewar system obtain grade object sort list list sequenti random access middlewar system request grade object obtain scenario random access rel sort provid algorithm essenti optim case extend abstract proc twentieth acm symposium principl pp ibm almaden research harri san california dept comput colleg maryland dept comput scienc appli weizmann institut israel work author perform visit scientist ibm almaden research center introduct earli system requir store small charact entri tupl tradit relat data homogen system deal charact string small heterogen varieti multimedia data data access combin resid varieti data system serv middlewar access data fundament differ small charact string multimedia data multimedia data attribut inher fuzzi imag simpli rang approach deal fuzzi data make aggreg function xm interv grade object xm grade object aggreg function context larg literatur choic aggreg function zimmermann textbook discuss popular choic aggreg function min standard rule fuzzi logic object grade attribut attribut grade fuzzi conjunct popular aggreg function averag context care result grade longer li interv aggreg function monoton xm monoton reason properti demand aggreg grade object high object expect grade high notion queri multimedia system tradit system queri tradit system relat unord set answer multimedia answer queri thought sort answer sort grade identifi queri choic aggreg function user typic interest find top paramet mean obtain object refer highest grade grade broken paper constant algorithm obtain top answer object applic multimedia make aggreg function combin find top answer import inform retriev object interest attribut search term grade measur relev document notat write grade relat result queri sort conveni sort depart member logic result simpli collect member search term common aggreg function sum total relev score document queri consist search term xm xm applic paper franklin schedul data broadcast case object field field repres amount time wait earliest user request field repres number user request page make product function broadcast page top score assum consist finit set object typic repres number object object field xm refer ith field thought consist sort list lm length entri list refer list entri form ith field list sort descend order simpl view view algorithm concern complet ignor comput issu practic comput field ignor issu field valu mode access data mode access sort access middlewar system obtain grade object sort list list sequenti top object highest grade ith sort access ith list requir grade sort access mode access random access middlewar system request grade object ith obtain random access sort access random sort access cost sc random access cost rc middlewar cost sc rc sum sort access cost random access obviou naiv algorithm obtain top answer entri sort comput grade return top answer naiv algorithm linear middlewar cost effici larg fagin introduc algorithm naiv algorithm case order sort list probabilist fa find top middlewar cost arbitrarili high probabl fagin prove independ assumpt aggreg correct algorithm high incur similar middlewar cost worst case present ta algorithm discov independ includ inform section relat work discuss probabl model includ notion track author defin extens simul compar project taught michael franklin fall show ta optim stronger fa defin notion interest instanc class class legal input algorithm assum nonneg perform cost measur repres amount resourc consum run algorithm input cost run time algorithm input middlewar cost incur run algorithm algorithm instanc optim equat mean constant choic refer optim ratio similar competit ratio competit analysi discuss competit analysi word reflect fact essenti algorithm instanc optim correspond optim worst case averag case algorithm optim instanc optim binari worst binari search requir log data item posit answer obtain neg answer probe nondeterminist algorithm correct branch make mistak middlewar cost nondeterminist algorithm minim cost branch halt top answer middlewar cost probabilist algorithm expect cost probabilist choic determinist algorithm instanc optim compar nondeterminist determinist algorithm determinist algorithm make choic nondeterminist algorithm view cost nondeterminist algorithm produc top answer cost shortest proof top answer instanc optim cost instanc optim algorithm essenti cost shortest proof view probabilist algorithm make mistak proof assum determinist result carri automat nondeterminist algorithm probabilist algorithm make mistak fa optim assumpt ta optim stronger instanc natur choic instanc optim hold class algorithm implement practic algorithm exclud make lucki class instanc optim ta hold case monoton aggreg function optim fa hold assumpt defin strict mean aggreg function repres notion definit instanc optim formal definit competit analysi competit assum typic repres perform cost competit typic class instanc class offlin algorithm give solut instanc number repres good solut bigger number correspond onlin algorithm onlin algorithm competit intuit competit onlin algorithm perform poorli instanc offlin algorithm perform poorli framework instanc optim assumpt repres perform context approxim algorithm class instanc class algorithm solv instanc case algorithm result answer algorithm appli input algorithm al give interest call instanc optim algorithm problem determin unknown random variabl mont carlo estim class random variabl distribut interv class algorithm repeatedli independ evalu random variabl averag obtain estim random variabl expect number independ evalu random variabl algorithm call aa main result aa instanc optim al give algorithm close instanc optim problem find collect sort set class instanc collect sort class algorithm comparison run time run algorithm instanc algorithm algorithm close call instanc optim explain detail approxim earli time user satisfi approxim top list assum defin top answer aggreg function collect object object note definit top answer show modifi ta give prove instanc optim modifi algorithm easili modifi ta interact process time system show user current view top list approxim correct answer user decid stop process point restrict random discuss section system random access imposs deal show section modifi ta obtain algorithm random random access prove instanc optim algorithm make random access situat random access simpli wimmer al yannakaki point case onlin versu offlin circumv issu simpli class onlin algorithm discuss number system issu random access ta instanc optim ratio depend ratio cost singl random access cost singl sort access defin algorithm combin ta call ca definit algorithm depend motiv obtain algorithm instanc optim ratio independ origin hope ca instanc optim optim ratio independ scenario ta instanc optim hope interestingli prove exist determinist probabilist algorithm make optim ratio independ find natur scenario ca instanc optim ratio independ outlin section discuss mode access data section present fa properti section present ta threshold section show ta instanc optim natur scenario import give theorem optim ratio ta section discuss depend optim ratio paramet section show turn ta approxim prove instanc optim approxim algorithm show user prematur halt ta treat current view top answer approxim answer section focu situat random access imposs section present random access show instanc optim algorithm make random access give theorem optim ratio section present ca result combin ta order obtain algorithm minim random access section show instanc optim optim ratio independ natur scenario section show care choic made ca random access make instanc optim ratio independ compar contrast ca versu ta section prove lower bound optim determinist algorithm probabilist algorithm make mistak summar upper lower bound section section discuss relat work section give state open problem mode access data issu effici queri evalu middlewar system tradit system middlewar system receiv answer queri access limit wai assum interfac middlewar system qbic imag subsystem qbic search imag visual characterist color textur version search subsystem output grade set consist grade sort order base middlewar system subsystem halt middlewar system subsystem resum output qbic trademark ibm corpor grade set left middlewar system subsystem top object sort request correspond refer expect middlewar system interact subsystem middlewar system subsystem grade respect object correspond refer qbic sort random access situat middlewar system random access subsystem occur middlewar system text retriev subsystem search engin major search engin web intern score document choic queri measur cost correspond intuit cost incur middlewar system process inform pass subsystem qbic sort access random middlewar cost sc rc posit constant fact reflect fact cost middlewar system sort access random access fagin algorithm discuss fa algorithm implement garlic ibm middlewar interest detail implement perform practic chaudhuri gravano wai simul fa color score fa work sort access parallel sort list access top member list sort access member wait wait set object object list object random access list find ith field comput grade xm object set object highest grade broken output grade set fairli easi show algorithm correct monoton aggreg function algorithm successfulli find top object import list access conveni sort list access algorithm paper access remain correct sort access instanc optim result continu hold sort access long rate sort access list constant multipl grade set present sort sort grade order sort list probabilist middlewar cost fa arbitrarili high probabl aggreg function strict xm hold aggreg function strict maxim argument maxim expect aggreg function repres conjunct strict reason strict kei featur conjunct fagin show algorithm optim high probabl worst case aggreg function strict deal notion order sort list probabilist independ access pattern fa oblivi choic aggreg fix middlewar cost fa matter aggreg function true constant aggreg trivial algorithm top answer object middlewar cost fa optim monoton aggreg function interest aggreg function max shown simpl algorithm make mk sort access random access find top answer algorithm ta instanc optim monoton aggreg weak assumpt case fa optim hold worst high probabl leav open possibl algorithm middlewar cost fa algorithm algorithm threshold algorithm present threshold algorithm sort access parallel sort list object sort access random access list find grade object list comput grade xm object grade highest rememb object grade broken object grade rememb list grade object sort access defin threshold object grade equal halt set object highest grade output grade set show ta correct monoton aggreg function footnot note algorithm paper access remain correct sort access extrem ta remain correct sort list access sort remain sort list access random access sort list sort marian exploit observ scenario access list sort access theorem aggreg function ta correctli find top answer part ta show member high grade object definit case object run ta assum assum field xm xm inequ monoton definit desir show stop rule ta occur earli stop rule fa sort access object sort access grade equal threshold sort access list stop rule object grade equal threshold stop rule impli sort access cost ta fa impli middlewar cost ta ta random access fa middlewar cost ta sort access cost time constant follow middlewar cost ta constant time fa show ta instanc natur assumpt intuit ta discuss case user determin top answer assum stage algorithm object grade big threshold intuit top object sort access grade bigger grade object object grade safe proof theorem stop rule ta top gener stop rule ta top view ta sort access random top answer view ta gather inform top halt view ta view term program give scenario random access make implement scenario random access rel sort addit design principl decid gather order design optim algorithm simpl theorem properti distinguish ta fa theorem ta requir bound size independ size bit ta rememb current top object object sort order list fa requir buffer grow arbitrarili larg fa rememb object sort order order check match object list price pai bound buffer time object found sort ta random access number find grade object list spite fact object sort random access list instanc optim threshold algorithm investig instanc optim ta begin intuit argument ta instanc optim algorithm stop sooner ta find object grade equal threshold make mistak object list grade list grade higher grade object top list output er stop convert intuit argument proof monoton aggreg ta instanc optim algorithm correctli find top class situat delic make distinct algorithm wild perform random access object encount sort fa ta make wild theorem monoton aggreg ta instanc optim algorithm correctli find top answer make wild class show distinct guess wild algorithm make wild guess class algorithm instanc optim algorithm compet algorithm instanc optim theorem heart fact multipl object grade list restrict attent object make natur addit restrict aggreg function ta instanc optim algorithm correctli find top answer section instanc optim situat relax problem find top object find approxim top give posit result instanc optim ta algorithm make wild guess random access find grade object list algorithm sort access algorithm make wild guess grade obtain object random access implement algorithm make wild guess context make wild guess context algorithm object make lucki wild guess show show instanc optim ta algorithm make wild guess class class involv sort list argument aggreg function find top aggreg function fix number argument number sort fix section discuss assumpt constant theorem assum aggreg function monoton class class algorithm correctli find top answer make wild guess ta instanc optim assum algorithm run assum algorithm halt depth number object sort access list max assum distinct object possibl multipl make wild distinct make sort middlewar cost ac show ta halt depth middlewar cost ta addit constant optim ratio ta ac show aggreg function optim ratio note choic algorithm ta object depth depth made md sort object access time sort output set top object ta halt depth assum object size object threshold algorithm halt mean grade object sort access list algorithm assum algorithm make sort access introduc sort call object big call object small show member big defin object grade ith put list object grade list algorithm perform algorithm output grade correct desir depend algorithm member output set case algorithm member depth ta member member ta halt depth desir sake possibl algorithm output object discuss issu section case algorithm member show object big defin object grade list put list object grade list grade distinguish output inform distinguish give output make mistak output correct big desir ta object depth depth ta object shown object big depth ta big object ta halt depth desir proof theorem show assumpt theorem wild optim ratio ta show aggreg function optim ratio recal aggreg function strict xm hold strict mean aggreg function repres notion conjunct corollari arbitrari strict aggreg function argument class class algorithm correctli find top answer make wild guess ta instanc optim optim ratio determinist algorithm lower optim ratio proof theorem shown ta optim ratio arbitrari monoton aggreg lower bound theorem drop assumpt strict corollari aggreg function max easi ta halt round sort optim ratio sort access correspond corollari optim ratio ta easili proof theorem aggreg function determinist algorithm lower optim ratio random access correspond ta instanc optim naiv sort access object random sort access cost show make lucki wild guess note instanc optim theorem hold aggreg function strict instanc optim ta theorem hold aggreg function max contrast situat optim fail aggreg function max corollari make assumpt strict order show optim ratio ta assum paper cr cs strictli posit corollari proof theorem hold cr assum call simpli list assum list object order top object grade remain object grade assum list object order bottom object grade remain object grade assum aggreg function interest find top answer clear top answer object grade object object grade algorithm make wild guess grade object list determin correct answer halt safe random access sort access algorithm make wild guess win object middl sort sort access requir algorithm win object show ta instanc optim class algorithm find top answer min class theorem ta instanc algorithm theorem class class algorithm correctli find top answer min determinist algorithm probabilist algorithm make instanc optim modifi obtain famili sort list list object top object grade remain object grade list object top object grade remain object grade uniqu object grade object middl remain object grade arbitrari determinist algorithm distribut member order list chosen uniformli random order list order easi expect number access random algorithm distribut order win object number access equal expect number number access algorithm make random access sort access optim ratio arbitrarili larg theorem determinist probabilist algorithm make appeal yao minimax principl section lemma simpl expect cost optim determinist algorithm arbitrari input distribut lower bound expect cost optim probabilist algorithm make mistak algorithm halt found object maxim grade grade assum grade lie assum grade lie addit sort access provid inform grade note algorithm make wild guess implement interest interpret instanc optim algorithm cost essenti cost shortest proof top answer algorithm wild larger class proof fact object grade proof top answer aggreg function strictli monoton xm averag min strictli aggreg function suggest literatur repres conjunct disjunct monoton strictli monoton satisfi uniqu properti object grade list grade list distinct show condit optim ta algorithm make wild guess theorem assum aggreg function strictli monoton class satisfi uniqu properti class algorithm correctli find top answer ta instanc optim assum algorithm run assum distinct object possibl multipl show ta halt depth ta make addit constant easili optim ratio ta cm max fc object ta halt depth assum object size object show ta halt depth threshold ta depth grade highest object list call object big call object small definit proof theorem show member big grade top grade list grade list object grade list object object object grade ith list grade assign grade list level reach sort algorithm perform algorithm output correct desir claim member top member list ta depth assum contradict top member list assumpt aggreg function strictli monoton satisfi uniqu easili small show aggreg function strict monoton apolog clash exist histor reason member big contradict prove claim ta halt depth desir proof theorem show assumpt theorem monoton uniqu optim ratio ta cm max fc theorem give aggreg function strictli monoton determinist algorithm optim ratio case greatest gap factor upper lower bound proof theorem nice ffl proof scenario random access object list learn grade list rel rank ta instanc optim includ algorithm learn make rel rank inform ffl proof restrict class list fix domain ffl prove instanc optim approxim algorithm approxim version assumpt theorem small chang proof theorem hold assumpt theorem treat constant theorem instanc optim treat find top number sort constant discuss assumpt begin assumpt constant proof theorem number access algorithm treat constant restrict class algorithm algorithm make access find top assum constant algorithm find top answer make access happen object object grade constant function reason context algorithm output object member top object algorithm similar issu earlier wild guess assumpt note reason number argument aggreg fix case assumpt theorem wild corollari strict aggreg depend inevit case assumpt theorem monoton uniqu theorem aggreg depend inevit turn ta approxim earli stop ta easili modifi approxim algorithm situat care approxim top answer defin top answer collect object object modifi ta find top answer modifi stop rule part object grade equal call approxim algorithm ta theorem assum aggreg function monoton ta correctli find top answer straightforward modif proof theorem theorem wild guess ta instanc optim theorem assum aggreg function monoton class class algorithm find top answer make wild guess ta instanc optim proof theorem carri verbatim provid modifi definit object theorem show analog theorem hold ta modif show analog theorem hold ta interpret result theorem suffici robust surviv perturb theorem assum call simpli list assum list grade assign grade order object grade object grade object grade assum list grade assign grade order object grade order object grade object grade assum aggreg function interest find top grade object object ff grade object uniqu object return algorithm ta correctli find top answer object algorithm make wild guess grade object list determin correct answer halt safe random access sort access algorithm halt found object big grade sort access list ta object order sort access list ta object order win object middl sort sort access requir ta win object convert theorem convert theorem theorem assum class satisfi uniqu properti class algorithm find top answer min determinist algorithm probabilist algorithm make instanc optim earli stop straightforward modifi ta interact process time system show user current top list approxim correct answer user decid stop process point fi grade kth object current top current threshold algorithm stop easi similarli situat theorem current top list top answer user current top list number told top answer minim random access concern number random access algorithm discuss fa sort random access place recal number sort number random middlewar cost sc rc posit constant notion optim ignor constant factor simpli multipl factor optim motiv concern number random access scenario pai attent number random access scenario random access imposs correspond discuss section scenario middlewar system text retriev sort list correspond result search engin scenario random access simpli rel sort access scenario cost correspond disk access versu optim ratio independ treat optim ratio bound section describ algorithm random access give algorithm random access call random algorithm account cost random access combin call ca algorithm access inform natur spirit program section halt improv place point execut algorithm number sort random access object subset fi mg field algorithm determin valu field defin function inform lower upper bound obtain algorithm proce candid current upper bound current kth largest lower bound lower object subset fi mg field valu defin subset minimum aggreg function attain object minimum obtain substitut miss field appli result properti proposit set field object repres lower bound addit list algorithm progress learn field object larger aggreg function yield knowledg includ instanc valu discov function median smaller upper object attain depend inform bottom valu defin obtain sort access list object subset fi mg field valu defin subset maximum aggreg function attain object maximum obtain substitut miss field appli result properti proposit set field object repres upper bound inform upper list equal valu gener assum inform uniqu properti hold continu aggreg function case upper bound algorithm progress learn field object bottom valu remain import special case object encount case note threshold ta random access situat random access forbidden algorithm make random access random access section chang criterion desir output earlier demand output consist top grade make weaker requir output consist top grade reason random access cheaper requir fewer find top answer grade show obtain partial inform grade object top object exact grade aggreg function interest top sort list grade object object grade grade sort access sort access inform object top object averag grade object averag grade find grade object sort access note requir output consist top inform sort order sort easili determin find top top cost find top object interest note relationship modifi object grade grade grade remain grade object list cost find top object sort order max treat easili convert instanc optim algorithm give find top object instanc optim algorithm find top object sort order good top object sort grade major search engin web longer give grade prevent algorithm sort access parallel sort list depth object access sort access ffl maintain bottom valu encount list ffl object discov field comput valu object valu virtual comput threshold ffl current top object largest valu object ti broken object highest win arbitrarili object tie highest kth largest call object viabl halt distinct object viabl object left return object show correct monoton aggreg function theorem aggreg function correctli find top object assum halt sort access fr object output object show algorithm halt depth depth object proposit definit combin inequ desir note mechan correct claim instanc optim algorithm random theorem assum aggreg function monoton class class algorithm correctli find top object make random access instanc optim assum algorithm halt depth distinct object level claim depth list optim ratio theorem claim fact algorithm halt depth object mechan necessarili depend algorithm output top object construct err case algorithm output top object construct err ident depth top object grade list miss field assign object assign miss field show top algorithm er desir assum show separ inequ mechan inequ desir case algorithm output top object construct err ident depth level miss field remain miss includ miss field assign object algorithm er output top object note issu relev restrict attent algorithm make random access wild proof theorem show optim ratio show aggreg function optim ratio corollari arbitrari strict aggreg function argument class class algorithm correctli find top object make random access instanc optim optim ratio determinist algorithm lower optim ratio proof theorem shown optim ratio arbitrari monoton aggreg lower bound theorem remark execut requir lot bookkeep sort access depth updat object dm updat depth yield total updat depth unlik longer suffic bound buffer specif function min data structur comput greatli simplifi issu investig account random access cost present combin algorithm ca random cost sort account cost sort access cost random access middlewar cost algorithm make sort access random sc rc ta instanc optim ratio function rel cost random access sort goal section find algorithm instanc optim optim ratio independ view ca merg ta bc assum section idea ca run step run random access phase updat inform upper lower bound section section requir output consist top grade obtain requir constant number addit random effect instanc optim algorithm ca sort access parallel sort list depth object access sort access ffl maintain bottom valu encount list ffl object discov field comput valu object valu virtual comput threshold ffl current top object largest valu object ti broken object highest win arbitrarili object tie highest kth largest call object viabl step time depth sort access pick viabl object field big broken perform random access miss field random access step halt distinct object viabl object left return object note larg larger number object algorithm ca random access perform algorithm ca similar intrigu wai step sort access ca perform random access miss field object perform random access miss field ta perform random access miss field object sort access discuss ca versu ta moder valu case ca intermitt algorithm execut step step ta show intermitt algorithm reason escap ca make wild guess give escap invok assum cr cs assum round sort access object list opportun random escap field object proof theorem show escap invok depth round sort access ca halt immedi perform ca differ algorithm ca pick object perform random valu program section design instanc optim algorithm principl object perform random access issu design random access cost constant multipl correct ca essenti upper lower bound theorem aggreg function ca correctli find top object scenario ca instanc optim ratio independ instanc optim ca section gave scenario ta instanc optim scenario theorem aggreg function class class algorithm correctli find top object make wild guess scenario theorem aggreg function strictli class satisfi uniqu class algorithm correctli find top object hope ca instanc optim ratio independ hope scenario theorem ca fail fulfil algorithm scenario exist algorithm optim ratio independ case obtain neg result theorem case obtain neg result theorem show slightli strengthen assumpt ca instanc optim ratio independ aggreg function strictli monoton argument argument strictli remain argument held aggreg function strictli strictli monoton argument impli xm xm averag strictli monoton min show scenario replac aggreg function strictli aggreg function strictli monoton ca instanc optim ratio independ show result hold simpli min strictli monoton argument theorem assum aggreg function strictli monoton argument class satisfi uniqu properti class algorithm correctli find top object ca instanc optim optim ratio independ assum assum ca run halt sort access depth ca make md sort access random note ca compon rc cost rc roughli sum assum make sort access random access cost incur algorithm announc object top claim top object list object output list access sort random access ident locat access object fr valu resid uniqu field strictli larger strict monoton make mandatori member output strict monoton stronger properti strictli monoton contradict top object list defin set object output step ca parallel sort fr fr claim object algorithm random access determin rs show algorithm perform output field access assign highest top locat access locat exist object field access top valu assumpt access sort access remain field top valu field top valu field high monoton stronger fact strictli monoton contradict shown object algorithm random access jcj set show ca halt depth depend escap part ca random access invok depth case escap ca invok depth depend paragraph proof theorem algorithm ca object depth depth made sort object access time sort ca strictli object depth escap invok escap ca object depth depth algorithm ca made dm sort access ca object depth object access time sort object ca sort access list depth object sort access list situat sound stop rule object uncertainti grade object top list viabl object equal threshold depth member top list grade equal threshold object viabl viabl object top ca halt depth desir algorithm object halt object algorithm algorithm output part top algorithm inform distinguish make mistak obtain role object assum paper number object object depth algorithm object sort access list similarli proof ca halt depth ca halt depth desir case escap ca invok depth recal ca perform random access viabl object base valu receiv random access step member highest valu step reach depth step member randomli access argu object access ca output randomli access appeal strict monoton argument aggreg function function strictli monoton step ca satisfi uniqu properti object miss step determin object larger hk step fr miss field randomli access ca claim step ca viabl object fr access valu equal valu object viabl object ca halt shown algorithm ca halt depth recal ca depth incur cost show ca halt depth cost ca incur addit constant kc kc assumpt kr middlewar cost optim ratio ca show assum assum make random access theorem instanc optim compar algorithm make random optim ratio independ cost ca ca instanc optim compar algorithm make random optim ratio independ proof theorem show assumpt theorem monoton argument uniqu optim ratio ca theorem give lower bound linear aggreg function strictli monoton argument theorem function min strictli monoton algorithm ca instanc optim theorem class satisfi uniqu properti class algorithm correctli find top object min ca instanc optim optim ratio independ proof proof similar proof theorem kei point function min step ca rs equal field uniqu properti assur field list replac strict monoton step object equal object fr exce member fr hm step fr randomli viabl object left ca halt rest analysi similar proof theorem hk replac hm net result optim ratio proof theorem show assumpt theorem uniqu properti min aggreg optim ratio ca theorem give lower bound linear ca versu algorithm compar ca algorithm algorithm compar call run delai ta step intermitt algorithm random access time order ta simpli delai random access bc step algorithm compar ca ta ca versu intermitt choic made ca random access find field viabl object maximum compar perform intermitt show intermitt algorithm ca aggreg function larg integ top locat grade form match locat list belong object grade locat list grade top locat grade form locat object grade note maximum grade occur object object top locat list grade object top locat grade grade grade step ca object ca perform sort access parallel singl random access halt middlewar cost hc intermitt give prioriti check random access object top list object random middlewar cost ratio middlewar cost intermitt algorithm middlewar cost ca arbitrarili larg theorem replac ca intermitt show optim ratio intermitt algorithm arbitrarili larg arbitrarili larg ca versu intrigu differ ca larg ta beat ca term sort ca beat ta term random access ta make sort access ta gather inform object encount sort access focu random ta random access field object sort access ca select random access object sort random access object collect potenti advantag ca ta present compar ca intermitt random access cost ta intermitt algorithm ratio middlewar cost ta middlewar cost ca manifest depend optim ratio ta independ optim ratio ca fact ta optim ratio quadrat ca optim ratio linear indic superior ca ta circumst requir investig interest compar ca aggreg function class satisfi uniqu class algorithm correctli find top object min ta ca instanc optim scenario optim ratio ca independ optim ratio ta ca optim ratio ta import advantag ca ta requir face ca requir great deal bookkeep sort access updat upper bound object field discuss remark interest develop data structur ca lead reason amount bookkeep compar ca versu ta realist scenario analysi lower bound optim ratio prove lower bound optim determinist algorithm probabilist algorithm make mistak lower bound correspond theorem earlier paper theorem match lower bound upper bound optim ratio ta proof theorem provid aggreg function strict theorem arbitrari strict aggreg function argument class class algorithm correctli find top answer make wild guess determinist algorithm instanc optim optim ratio assum remov assumpt restrict attent make posit paramet integ famili form top grade remain grade object top list object grade top list object top list grade grade remain list easi pick big satisfi suffici larg number object arbitrari determinist algorithm adversari adversari forc middlewar cost idea adversari dynam adjust queri evad determin top element late object high list top list high high list object high dm high object assum dm high high object adversari forc answer receiv consist top object inform halt ident top object dm high object make wild sort access cost case case algorithm high object sort access list high posit list object top posit sort access cost desir case high object sort access list high high object fulli randomli access random access list high random access high object list adversari assur random access grade final random access grade adversari continu random access high assum high object fulli randomli access adversari forc answer receiv consist top object inform halt safe high object fulli randomli access dm high make random random access cost middlewar cost desir middlewar cost algorithm result algorithm make sort access random middlewar cost dc suffici ratio dc made close desir theorem case describ modifi proof case idea make top object easi find modifi proof creat grade put top list simpl detail left reader proof theorem assum strict monoton uniqu show optim ratio ta cm max fc give aggreg function strictli monoton determinist algorithm optim ratio case greatest gap factor upper lower bound aggreg function result function xm xm reason made unusu aggreg function case min aggreg function averag strictli monoton algorithm ca section optim ratio independ restrict attent satisfi uniqu properti neg result theorem hold min averag theorem aggreg function class satisfi uniqu properti class algorithm correctli find top object determinist algorithm instanc optim optim ratio proof theorem assum loss gener restrict attent make posit paramet integ multipl famili form object top grade list form object grade list grade list object grade list form top object list grade interv list rest top object list grade interv grade open interv remain list top call uniqu object grade grade list occur object list simpli base grade top object list clear top object grade arbitrari determinist algorithm adversari adversari forc middlewar cost idea adversari dynam adjust queri evad determin top element late case case sort access sort access cost desir case sort access call top object list candid candid sort access list call grade grade low candid fulli randomli access random access list random access candid list long adversari assur random access high final random access low grade adversari continu candid fulli randomli assum candid fulli randomli access adversari forc answer receiv consist top object inform halt safe candid fulli randomli access candid fulli randomli random random access cost middlewar cost desir middlewar cost algorithm result algorithm access top object list make random access object list middlewar cost suffici ratio made close desir theorem theorem redund fact deal probabilist theorem give proof gener proof theorem theorem arbitrari strict aggreg function argument class class algorithm correctli find top answer make wild guess determinist algorithm probabilist algorithm make instanc optim optim ratio proof theorem assum loss gener defin famili sort list paramet top dm valu list remain valu object object list grade object grade posit posit dm list arbitrari determinist algorithm distribut member list posit chosen uniformli random easi expect number sort access distribut algorithm number sort access equal expect number sort number sort access middlewar cost result algorithm make sort access random middlewar cost dc suffici ratio dc made close desir theorem determinist case probabilist algorithm make conclud proof theorem proof theorem show assumpt theorem uniqu properti min aggreg optim ratio ca theorem lower bound linear theorem class satisfi uniqu properti class algorithm correctli find top answer min determinist algorithm probabilist algorithm make instanc optim optim ratio proof obtain proof theorem modifi construct slightli satisfi uniqu properti simpl detail left reader theorem match lower bound upper bound optim ratio proof theorem provid aggreg function strict theorem arbitrari strict aggreg function argument class class algorithm correctli find top object make random access determinist algorithm instanc optim optim ratio proof theorem assum loss gener restrict attent make posit integ paramet famili form special object tm object grade special object top object special object refer list challeng list special object top object list special object special object top challeng special object top object list grade remain object list grade posit list uniqu top object posit list note special object posit challeng special object top posit challeng list arbitrari determinist algorithm adversari adversari forc sort access cost dm idea adversari dynam adjust queri evad determin top element late time algorithm reach posit adversari forc encount object special posit time adversari algorithm encount special object posit posit list access depth time adversari algorithm discov top object clear sort access cost result dm algorithm make sort access list sort access remain total sort access middlewar cost suffici ratio made close desir theorem summari upper lower bound tabl summar upper lower bound row correspond restrict set column restrict set aggreg function note sm mean mean monoton note max combin provid upper lower theorem bound proven upper bound state explicitli proof referenc lower bound determinist probabilist ref sm ref ref min cm correct instanc min optim algorithm guess wild guess random access tabl upper lower bound relat work defin algorithm ta notion optim weaker make assumpt essenti aggreg function min defin algorithm ta call algorithm distinguish algorithm call differ algorithm heurist rule determin sort list sort access intuit idea speed ta advantag skew distribut grade make claim optim extens simul compar fa compar feel interest problem find good heurist list access sort access heurist potenti lead speedup ta number sort access factor number problem heurist problem involv assumpt make aggreg function satisfi lower bound properti properti xm hard aggreg function satisfi lower bound note natur assumpt min make claim optim result proven fa hold skew distribut uniform distribut claim probabilist assumpt order sort list probabilist independ partial defin aggreg function easi find famili exampl show result instanc optim note heurist modifi ta decid list access sort access forc instanc optim simpli insur list access sort access constant situat random access imposs defin basic call modifi algorithm incorpor heurist rule sort list sort access version instanc optim reason basic version instanc optim consid upper bound grade unlik algorithm consid upper lower bound requir top object grade requir grade case random access algorithm object top object sort list note monoton aggreg function determin grade object grade sort list open problem studi eleg remark simpl algorithm algorithm scenario random access forbidden rel sort access studi introduc instanc optim framework context aggreg provid posit neg result framework analyz compar perform strong notion optim consid approxim provid posit neg result instanc optim open algorithm tightli instanc optim instanc optim optim ratio corollari tightli instanc corollari case wild guess strict aggreg ta tightli instanc optim case wild aggreg function ta tightli instanc optim case show instanc optim algorithm shown tabl algorithm question fact tightli instanc case algorithm turn tightli instanc algorithm tightli instanc interest line investig find scenario instanc optim yield result find applic inform retriev mention section issu find effici data structur ca case compar ca versu ta note aggreg function ta tightli instanc optim ratio ta tightli instanc optim ratio aggreg function ta tightli instanc optim defin hard ta tightli instanc optim choic acknowledg grate michael franklin discuss led erik david andrew tomkin yannakaki larri comment improv readabl refer franklin schedul approach data broadcast transact decemb onlin comput competit analysi cambridg marian evalu queri chaudhuri gravano optim queri multimedia repositori proc acm sigmod page wimmer heterogen multimedia inform garlic approach intl workshop research issu data distribut object page ross optim algorithm mont carlo estim siam munro adapt set differ proc symposium discret algorithm page san fagin combin fuzzi inform multipl system comput system vardi program distribut meyer auf der lower bound parallel comput proc acm symposium theori comput page optim queri imag proc larg page effici queri heterogen environ proc ieee intern confer inform code comput la april editor approxim algorithm problem pw publish motwani raghavan random algorithm cambridg qbic queri imag content textur shape spie confer storag retriev imag video volum page qbic web server queri process issu imag proc intern confer data engin page march salton automat text analysi retriev inform comput tarjan amort effici list updat page rule comm fagin algorithm merg rank result multimedia middlewar fourth ifci intern confer cooper inform page ieee comput societi septemb yao probabilist unifi measur complex proc ieee symp foundat comput zadeh fuzzi set inform zimmermann fuzzi set theori kluwer academ
DB/1251 3 activ program algorithm evalu acharya joel saltz dept comput scienc dept comput scienc dept comput scienc california maryland maryland santa barbara colleg park colleg park abstract applic technolog trend profit feasibl move comput closer data process evalu activ disk architectur integr process power memori disk drive code download execut data read disk kei idea offload bulk process processor host processor primarili schedul combin result individu disk program activ program model execut effici safe simul result suit algorithm applic domain data imag process satellit data activ disk outperform architectur introduct applic technolog trend profit feasibl move comput closer data process applic rate data onlin growth disk capac improv perform commod processor chang user expect larg dataset primarili archiv storag frequent entireti patterson al quot observ greg processor doubl perform custom doubl data storag month data shape busi practic jim grai argu satellit data repositori grow petabyt size year requir varieti process rang entir dataset advantag algorithm composit suit displai requir trend larg data larg number disk architectur scale process power dataset grow process requir technolog disk transfer rate rapidli drive seagat capabl deliv faster drive horizon power cheap processor size cheap memori rapidli mhz processor mb current trend end bui mhz processor mb memori price disk drive data rang trend implic improv data transfer processor small number drive busi drop price power processor larg memori econom feasibl place substanti comput capabl individu disk import note disk drive processor servo memori disk current trend compon scale disk cach mb evalu activ disk architectur integr process power memori disk drive code download execut data read disk util activ applic partit compon compon kei idea offload bulk process processor host processor primarili schedul combin result individu disk activ disk present architectur direct reason number processor scale number architectur equip process requir rapidli grow dataset process compon integr process capac evolv disk drive evolv similar evolut disk cach drive disk cach larger introduct activ disk question code commun protect malici feasibl util activ disk class dataset expect grow rapidli commerci data imag satellit data repositori advantag process power scale dataset partit algorithm process dataset process offload processor benefit expect current technolog address question wai program model interact peer stream input gener stream output file rang repres stream stream access standard interfac deliv data buffer size apriori written languag requir adher guidelin alloc memori sandbox buffer input alloc freed oper scratch space alloc behalf initi initi oper skip part input stream restrict limit amount damag simplifi oper system support requir present partit version suit algorithm process dataset interest present sql extern datacub oper support imag convolut gener earth imag raw satellit algorithm relat remain imag satellit data repositori start algorithm literatur modif minimum compar perform partit algorithm run activ disk perform origin algorithm run convent disk comparison current technolog econom end decad evalu sensit result larg variat interconnect bandwidth host processor speed experi identifi bottleneck understand impact unbalanc upgrad long life larg dataset cost replac larg number part system upgrad frequent disk result encourag algorithm architectur outperform architectur result architectur scale number disk architectur achiev small improv larger disk farm algorithm redistribut input rout data host bottleneck larg configur shown architectur retain advantag host processor upgrad frequent disk program model program model interact peer stream input gener stream output stream type stream file rang stream code interact pipe stream pipe result stream access standard interfac deliv data buffer size priori input stream output stream initi function run instal process function run data scratch space alloc behalf instal automat reclaim set paramet custom final function run termin consum data input stream call initi oper oper initi program check valid advantag corrupt layer disk provid function initi skip subrang input stream notifi layer disk skip subrang deliv safe implement algorithm futur depend data previou algorithm index decid chunk data read implement input stream index file data file data deliv index stream decid part data stream read skip alloc free memori memori manag layer disk memori access sandbox defin buffer input scratch space binari analyz softwar violat reject program model simplifi analysi defin natur sandbox commun environ restrict input output stream sourc sink stream program part instal determin input stream output stream advantag handl buffer schedul layer reduc complex heterogen environ activ disk convent process data convent disk transpar execut host figur present perform imag convolut code note instal invoc separ oper base expect repeatedli written languag requir adher safeti constraint constraint enforc combin analysi restrict runtim environ support activ disk requir oper system support host disk design os layer disk conflict requir thin make full limit resourc move common function small easi analyz design advantag program model provid function footprint small servic memori stream commun schedul model simplifi memori manag memori alloc contigu block size priori lifetim block model simplifi commun support requir stream buffer alloc manag depend amount memori alloc multipl buffer overlap data movement comput desir partit result long request figur prefetch make effici limit memori model simplifi schedul readi run data input stream assum schedul disciplin program download dont expect assumpt problem applic extrem larg run dedic machin problem larg instal run multipl concurr multipl queri investig wai relax restrict os limit os function support instal manag stream instal requir analysi code ensur memori safeti link environ download code disk creation manag stream simpl notion stream current primari differ semant stream semant activ disk stream deliv data quantiz manner sequenc buffer size priori buffer alloc freed implicitli buffer read stream alloc freed call close program exit buffer write stream similar semant algorithm describ version algorithm suit present algorithm applic domain relat imag process satellit data process algorithm optim perform algorithm extern sort stripe data disk kb chunk disk stripe extern data stripe half disk read half write algorithm aggress prefetch issu asynchron request sort phase request complet stripe disk disk combin larg request deep algorithm full advantag aggress subsystem sql select filter tupl relat base predic administr build indic attribut speed select fairli frequent requir scan entir relat focu oper select appli filter predic independ tupl amen parallel algorithm appli select predic disk forward success tupl host input stream download consist entir file disk figur consist larg buffer collect tupl host appli predic tupl input buffer copi outbound buffer satisfi predic outbound buffer ship host data disk concaten prepar transfer request client sql oper user comput vector aggreg index list attribut partit relat disjoint set tupl base index comput aggreg set tupl sql standard aggreg min avg count aggreg function small amount intermedi storag graef show techniqu techniqu implement algorithm algorithm algorithm perform step download code perform local long number aggreg comput fit integ integ buffer function integ function read buffer buffer perform convolut gg end integ open imag file disk creat stream disk output buffer instal instal invok file input input stream spec offset buffer run stream termin return stream data buf code code figur partit version convolut filter filter detect horizont line imag run ship partial result host reiniti host accumul partial result forward extern start point version extern sort base long histori extern sort research commun hold record fastest extern sort indi record pipelin version sort version phase read data move tupl pointer bucket sort bucket sort write bucket phase thread merg sort partit creat phase reader read block sort partit set merg merger select kei current block partit copi write writer write buffer disk make pass kei size cleanup buffer origin algorithm algorithm form bucket number disk examin record append bucket destin disk buffer forward host host maintain global buffer disk copi forward record buffer global buffer disk host send disk global buffer progress sort buffer partial sort write disk send output stream sort partit creat phase map stream attach merger input merger select lowest kei input stream copi output stream map output note data host merg local activ disk datacub gener form aggreg relat comput aggreg index valu multipl raw data abc ab abc ab bc ac bc ac ab bc figur search lattic pipelin algorithm bold line search lattic minimum span tree comput algorithm estim size individu hand side show pipelin data box bottom read disk gate datacub comput combin list attribut effici method comput datacub present call algorithm repres datacub lattic relat direct edg connect gener attribut edg weight reflect estim size determin set perform comput minimum span tree lattic figur schedul sequenc pipelin comput part singl scan data final result pipelin store back disk input pipelin figur exampl individu techniqu algorithm implement algorithm larg request aggress prefetch algorithm separ pipelin creat compon alloc memori proport estim size perform local long number aggreg comput fit run ship partial result host reiniti host accumul partial result forward store final result pipelin imag convolut wide enhanc spatial featur imag applic includ edg gradient smooth imag sharpen implement oper comput pixel linear combin valu neighbor pixel coeffici linear combin matrix convolut perform slide kernel imag start top left corner pixel comput sum product kernel valu valu pixel cover algorithm concaten imag singl file stripe file disk stripe integr number imag algorithm store sequenc imag buffer input stream size fit imag download convolut kernel argument perform convolut oper entir imag forward process imag host note convolut proport size kernel valu gener composit satellit earth scientist gener earth imag composit data acquir multipl dai sensor gener composit imag requir project sensor valu grid composit valu map singl grid point gener pixel sensor valu preprocess correct effect distort algorithm base techniqu program nasa process sensor valu larg map output grid perform composit oper accumul output pixel algorithm perform map disk advantag fact composit complex perform composit local size output larg expect fit imag mb deal download alloc space contigu section output grid fit long sensor valu read map composit oper perform local encount sensor map ship entir host shift sensor map center host maintain accumul entir imag receiv final imag partit algorithm composit oper mention figur illustr figur shift valu map origin origin host shift shown evalu evalu util activ compar perform version algorithm suit varieti configur dataset core set configur system todai system end decad tabl describ configur explor scalabl vari number disk configur evalu sensit result larg variat interconnect bandwidth host processor speed experi identifi bottleneck understand impact unbalanc upgrad long life larg dataset cost replac larg number part system upgrad frequent disk paramet todai futur host cpu mhz mhz host memori gb gb interconnect disk cpu mhz mhz disk memori mb mb media rate rpm max seek time ms ms tabl configur core set experi host processor todai configur pentium ii fastest intel processor disk processor configur select cost constraint interconnect assum dual loop loop todai loop futur simul conduct develop simul simul architectur detail disk preliminari implement model processor interconnect disk model base disk model implement david kotz initi disk model includ fix cost control seek model model short seek long seek rotat model model includ multipl inlin track skew cylind skew processor model task time execut run uninterrupt task interrupt addit execut time task fed trace model includ time execut latenc initi move domin short seek time move head domin long seek null system time queue request time servic interrupt model interconnect latenc initi capac interconnect transfer speed determin time implement ran dec alpha workstat mb scale execut time processor configur dataset buffer size assum simul separ run obtain execut time version datacub algorithm amount memori alloc depend data structur algorithm run gener activ trace scan base fill hash execut save result activ trace replai simul simul includ preliminari implement support schedul manag stream commun written interact api initi oper behalf disk block map input stream automat read deliv buffer output stream automat written disk buffer read oper automat alloc stream buffer size buffer complet write oper reclaim current implement overlap comput buffer stream support skip oper select receiv data stream plan add version simul dataset dataset algorithm smaller dataset gb million larger dataset gb million dataset smaller dataset million distinct valu larger dataset million distinct valu assum select dataset tupl uniformli distribut kei creat dataset base descript smaller dataset gb million larger dataset gb million dataset tupl smaller dataset gb million larger dataset gb million tupl attribut attribut groupbi attribut remain aggreg attribut sum aggreg function number distinct valu attribut smaller dataset larger dataset imag singl dataset consist imag byte pixel convolut kernel earth dataset correspond composit imag satellit size smaller dataset gb size larger dataset gb output imag smaller dataset mb output imag larger dataset mb util activ disk figur compar perform algorithm architectur configur note algorithm activ disk outperform convent disk result activ disk achiev perform improv time time configur todai compon time time futur compon activ disk outperform convent disk time time todai time time futur compon core select perform comput byte achiev small benefit expect todai futur configur interconnect algorithm full advantag determin impact variat interconnect repeat experi todai configur replac loop hypothet interconnect figur present result configur show presenc architectur outperform architectur factor configur factor configur figur show algorithm architectur interconnect outperform architectur faster algorithm comput byte transfer conv architectur advantag interconnect rang figur larg show impact variat interconnect bandwidth perform architectur disk figur present inform greater detail show perform interconnect bandwidth import algorithm perform comput byte interconnect bandwidth import algorithm redistribut dataset execut time algorithm suit linearli dataset size expect linear contribut log factor small size dataset size differ factor scalabl explor scalabl compar perform algorithm vari number disk todai configur figur present result note number disk select architectur advantag applic optim perform aggress small number fast disk processor busi algorithm suit research reach similar architectur scale perfectli disk algorithm scale disk impact upgrad host processor long life larg dataset cost replac larg number host system upgrad frequent disk order explor impact frequent upgrad host repeat experi todai configur replac host processor processor processor note disk processor architectur todai configur assum mhz experi determin host processor bottleneck architectur figur present result show larg architectur outperform architectur relationship host processor disk processor host processor time faster mhz disk note faster host processor sort improv perform configur larg host processor bottleneck algorithm sort redistribut dataset discuss relat work fact easili convert algorithm program model volum data process cost fetch data optim algorithm matter set effici pipelin stage perform process data read disk pass stage sql standard support simpler version model paper cursor interfac interfac client applic ship queri server receiv result queri tupl model greater function sql cursor download code restrict relat multipl download act concert buffer size adjust meet applic activ disk architectur paper assum disk commun host commun disk host larg lead host bottleneck algorithm redistribut dataset sort show effect select groupbi cube sort conv earth select groupbi cube sort conv earth normal execut time figur comparison activ disk convent disk legend architectur type configur result smaller dataset select groupbi cube sort conv earth normal execut time select groupbi cube sort conv earth normal execut time figur impact variat interconnect bandwidth result todai configur smaller dataset configur redistribut entir sort algorithm reassur algorithm deriv perform benefit activ disk sort activ disk time faster disk time faster algorithm redistribut data materi redistribut part dataset select kind join plan evalu perform algorithm idea programm processor disk processor ibm user download channel program make request behalf host program implement ibm channel program link list todai power processor amount memori econom integr disk drive part storag devic research explor processor integr disk drive al investig implement data retriev gibson al investig perform filesystem process disk paper present independ architectur goal scale process power dataset size programm processor disk unit riedel al model similar evalu perform algorithm show algorithm achiev gain activ disk al architectur chip integr disk unit disk unit connect compar architectur convent select groupbi cube sort conv earth select groupbi cube sort conv earth normal execut time convent disk activ disk figur impact variat interconnect bandwidth disk result todai configur smaller dataset graph detail version figur note graph separ normal show impact interconnect bandwidth graph normal respect architectur interconnect graph normal respect architectur interconnect select groupbi cube sort conv earth disk disk disk disk select groupbi cube sort conv earth normal execut time disk disk disk disk convent disk activ disk figur scalabl convent disk activ disk result todai configur smaller dataset select groupbi cube sort conv earth select groupbi cube sort conv earth normal execut time figur impact variat central processor result todai configur smaller dataset smp analyt techniqu result suggest set architectur significantli faster server jim grai architectur host integr larg memori network interfac disk unit plan evalu architectur altern compar perform futur grow gap lead integr process logic dram chong al program partit data manipul compon offload logic memori system assum tradit organ processor dram integr disk drive fastest achiev integr short long integr chip suitabl process power disk drive futur work evalu activ disk architectur integr process power memori disk drive code download execut data read disk util activ applic partit compon compon kei idea offload bulk process processor host processor primarili schedul combin result individu disk program activ program model stream input gener stream output written languag requir adher guidelin alloc memori sandbox buffer input alloc freed oper scratch space alloc behalf initi initi oper skip part input stream restrict limit amount damag simplifi support requir disk demonstr activ disk suitabl rapidli grow dataset present partit version algorithm process dataset compar perform partit algorithm run activ disk perform origin algorithm run convent disk result encourag algorithm architectur outperform architectur perform advantag contribut parallel avoid interconnect algorithm perform larg amount comput byte deliv data host imag datacub satellit data deriv advantag primarili parallel true algorithm achiev imag satellit data algorithm perform comput byte achiev reduct data deliv host select deriv advantag primarili avoid interconnect algorithm redistribut dataset deriv advantag combin factor algorithm materi local comput data individu disk avoid interconnect complet result architectur scale number disk architectur achiev small improv larger disk farm algorithm redistribut input rout data host bottleneck larg configur shown architectur retain advantag host processor upgrad frequent disk processor plan extend work wai plan investig algorithm data materi view transcod imag plan extend suit includ algorithm index join nearestneighbor plan evalu altern architectur includ network cheap architectur jim grai plan investig wai concurr execut multipl acknowledg jim grai processor infinit fast storag detail comment previou version paper push futur zhu graph gui anonym comment version paper refer sussman tune perform parallel applic fourth acm workshop parallel distribut agarw super scalar sort algorithm risc processor acm sigmod intern confer manag page sarawagi comput aggreg intern confer larg page ac rh de jm da patterson highperform sort network workstat acm sigmod intern confer manag wilk storag achiev qo intern workshop qualiti specif feb custom network technolog product catalog feb link jeff jim sourc code data fall gibson al file server scale secur disk acm intern confer measur model comput system gene feldman sourc code ocean data process group graef queri evalu techniqu larg acm comput jun grai challeng build petabyt data store distinguish santa oct grai processor infinit fast storag keynot speech workshop parallel distribut nov pirahesh data relat aggreg oper gener intern confer data page februari jim grai put storag devic talk workshop storag comput june jim grai sort benchmark home page hypermedia commun marin island san mateo ca media hyper award march hellerstein intellig disk revolutionari approach comput unpublish white paper feb detail simul model disk drive technic report dartmouth melton simon understand complet guid morgan onlin fix drive catalog feb lomet risc machin sort acm sigmod intern confer manag activ comput model intellig memori intern symposium comput futur comput unpublish talk juli patterson al intellig ram industri architectur intern confer comput patterson comput quantit approach morgan inform prefetch cach acm symposium oper system page pc progress memori gener link faloutso activ storag larg scale data mine multimedia applic confer larg wilk introduct disk drive model ieee march peter smith ding sourc code pathfind main program land pathfind effort graham effici fault isol acm symposium oper system page hit memori implic obviou comput architectur
HCI/1252 4 establish design principl phd research morten eth zurich graspabl establish design principl phd research morten dept eth zurich research morten examin prof dr dr helmut krueger eth prof dr matthia rauterberg tu depart industri manag manufactur engin institut institut appli physiolog group interact date octob version tabl content work titl introduct theoret framework outlin principl design implement framework research topic interact research topic interact research topic navig object manipul time schedul refer version graspabl establish design principl phd research morten dept eth zurich work titl graspabl establish design principl introduct interact machin part everydai life winograd flore abstract basi everydai theoret part deal observ task solv behaviour focu support campbel learn process includ task relat greater retent greater transfer ti action order earli stage learn defin design principl support direct natur task solv behaviour principl design interact tool call base tangibl brick interact system enabl user interact complex data direct explor wai design implement natur interact studi interact handler support effici task solv behaviour aim work evalu design principl direct natur interact theoret framework outlin principl point concept bring cognit motor activ base task action regul theori concept action regul theori psycholog basi work great import attach concept complet task complet activ cycl start goal set part characterist complet task distinct step prioriti goal set action consequ goal task descript control feedback goal set action plan figur complet activ cycl context action regul theori independ set task independ action prepar plan function select tool includ action goal attain physic perform function feedback perform pertain correct action control feedback result possibl check result action set individu pursu goal clear action classifi kirsh maglio consid motor activ epistem pragmat pragmat action primari function bring user physic closer goal epistem action chosen hidden inform gain insight requir mental comput physic action facilit mental make faster reliabl cognit complex reduc epistem action memori involv mental comput reduc number mental step requir solv problem made fewer probabl error due mental slip reduc epistem pragmat action gener present behaviour appli level independ level pragmat epistem action version graspabl establish design principl phd research morten dept eth zurich success task solv perform encourag design interact tool pragmat action close action goal deriv directli task part solv task epistem success goal set requir action concept complet activ cycl figur prioriti goal set exploratori feedback plan action goal set control feedback task descript figur complet activ cycl case epistem action rest make abstract pragmat epistem subsum figur mean downsid cycl figur longer liter figur meant transport idea complet pragmat idea complet epistem action design principl graspabl interfac assur mistak impli low risk epistem behaviour stimul user epistem pragmat action support complet regul pragmat epistem behaviour manipul object real action space percept space posit object real coincid time space hacker prove offer inform space action lead perform goal set percept action task descript control feedback goal set action plan figur classic user percept action space separ classic user separ space due separ output devic altern suggest rauterberg design user interfac percept action space coincid goal set percept action task descript control feedback goal set action version plan figur user interfac percept action space coincid graspabl establish design principl phd research morten dept eth zurich improv feedback interfac feasibl offer tactil feedback show tactil feedback impli higher task solv perform merg concept interfac design interfac offer coincid percept action tactil subsum augment realiti ar base real augment intellig characterist ar distinguish virtual realiti vr offer forc feedback ar peopl real authent reproduc comput ar digit suggest newman wellner similar idea ar technolog basi work gener design strategi natur user interfac import real virtual object invit kind interact meant support principl subsum concept suggest gibson appli design norman appli mean real interact handler project object design inform function structur repres result produc design principl graspabl interfac support user plan function direct intuit object tool task solv accomplish result user action chapter defin interact tool base principl section chapter suggest framework base usabl test base chapter suggest practic evalu outlin design principl design implement guid outlin design instanti mean graspabl brick interact handler user virtual object task chose plan activ plant design prototyp call applic support engin design assembl line build plant figur support task solv activ system enabl group interact space virtual real world object vertic work area background side view plant horizont work area view object select manipul select fix translat rotat figur basic step user manipul version graspabl establish design principl phd research morten dept eth zurich work principl shown figur user select object put brick object posit object rotat fix simpl brick manipul materi everydai motor pattern rotat cover activ system dynam support user natur behaviour control feedback support plan goal set phase complet regul work cycl assur cost make mistak system enhanc epistem pragmat action figur interact hand system support interact effect user part simultan design process set guidelin formul section met graphic displai base class librari system read render arbitrari virtual object figur object comput aid design system virtual realiti model languag framework research question arisen develop work system question pursu system reason make experi influenc system result experi gener interest hci research experi divid real experi appli research question clarifi system experi base simpl interact task aim clarifi simpl mechan user behaviour real experi appli research question requir full version system quantifi task solv task time separ task defin research topic task task accomplish interact task accomplish interact task call navig scroll task call object manipul research topic interact brick orient orient orient lock reflect surfac brick squar reflect surfac brick lock mechan real virtual object implement principl virtual object align virtual object version graspabl establish design principl phd research morten dept eth zurich stick principl posit orient object object brick brick object object brick figur lock mechan real brick virtual object brick object find depend handl user part environ part user measur time brick stai plan view assum brick handl stai longer time plan view brick handl tool independ orient brick shape orient lock lock mechan posit lock mechan orient depend task solv perform task time brick tool brick object remain shorter longer time plan subject data satisfact task hypothesi perform depend brick orient hypothesi perform depend orient lock hypothesi perform depend lock mechan virtual object brick hypothesi depend brick handl object tool research topic interact independ brick shape orient lock brick orient lock mechan orient brick orient lock mechan posit depend task solv perform task time subject data satisfact task hypothesi perform depend brick orient lock research topic navig object manipul aim explor virtual virtual camera handl plan view current determin characterist side view design relev question camera determin side aim develop altern scroll plan scale object zoom plan side view version graspabl establish design principl phd research morten dept eth zurich independ activ mechan number camera plan view scroll mechan scale mechan zoom mechan depend task solv perform task time subject data satisfact task hypothesi perform depend activ mechan number camera hypothesi perform depend scroll mechan plan view hypothesi perform depend scale mechan plan view hypothesi perform depend zoom mechan plan view time schedul time period aim definit framework research topic interact research topic interact research topic navig object manipul public result intern hci ergonom journal write phd thesi refer develop multimedia softwar base applic verlag für train design perform improv campbel campbel product san intuit design tool base direct object manipul gestur sign languag interact lectur note artifici volum pp intuit simul tool layout process der pp ecolog approach visual percept london model und bei einer regul von verlag der action regul theori occup psycholog review german empir research german journal psycholog pp distinguish epistem pragmat cognit desk support interact paper document proc pp psycholog everydai thing pp die phd zurich tog softwar design read ma understand comput foundat design ablex publish version graspabl establish design principl phd research morten dept eth zurich tabl hypothesi hypothesi perform depend brick orient hypothesi perform depend orient lock hypothesi perform depend lock mechan virtual object brick hypothesi depend brick handl object tool hypothesi perform depend brick orient lock hypothesi perform depend activ mechan number camera hypothesi perform depend scroll mechan plan hypothesi perform depend scale mechan plan view hypothesi perform depend zoom mechan plan view tabl figur figur complet activ cycl context action regul theori figur complet activ cycl case epistem action figur classic user percept action space separ figur user interfac percept action space coincid figur support task solv activ figur basic step user manipul figur interact figur lock mechan real brick virtual object version
DB/1253 3 extens framework data clean galharda inria franc daniela florescu inria franc denni shasha york inria eric simon inria franc abstract data integr solut deal larg amount data strongli requir year tradit data integr problem schema local global schema addit data problem dealt absenc kei di erent object ident exist keyboard error presenc inconsist data multipl sourc deal problem global call data clean process framework er fundament servic requir data duplic elimin match servic implement set design sql extens import featur framework abil explicitli includ human interact process main novelti work framework permit perform optim tailor data clean mix neighborhood hash comput measur bene ts introduct big demand data integr solut deal larg amount data problem address schema local global schema map queri data integr applic cope addit data di erent origin creat di erent di erent peopl di erent convent question decid data refer real object crucial compani inform client store client bui di erent servic manag distinct depart decid build uni ed repositori compani custom refer di erent tabl slightli di erent correct kind mismatch call object ident problem error data due error result object ident problem data object refer data record erron algorithm detect eld data entri error refer object recogn eld written di erent format correct altern problem call instanc identi cation duplic elimin record linkag problem case singl sourc inconsist di erent record recogn store inform object eld carri contradictori inform di erent birth date person interest case content multipl autonom data sourc combin build error uni ed view data terminolog call data clean process elimin problem construct materi view statement data clean problem illustr major step data clean concret case illustr gure gather materi inform client ed user cellular phone line internet connect home inform priori dissemin sourc requir data clean process common client kei sourc tabl data entri error introduc lling eld tabl rst step determin client record di erent sourc correspond client real life ident record call match record express record match record address valu valu high similar notion similar complex criteria record match record valu similar record tabl tabl compar individu tabl eld data format vari normal format match record import step inspect match record determin valid singl priori match record due approxim perform match criteria possibl user inspect match possibl entail examin huge number record possibl match record highest similar wrt provid match record phase integr remain match record gener tupl materi view rule integr client record match record address match record job client record obtain concaten job valu match record choic speci ed advanc interact perform user clean process gener clean process assur good qualiti data gener materi natur client record correspond found match integr match record satisfi qualiti clean process major featur iter interact rst match record found base initi match criteria inspect error found match record match criteria de ned match phase start integr phase iter ne integr criteria manual control rst gener result involv human di erent stage clean process error inconsist resolv automat clean process express extens express rich varieti criteria match elimin erron integr remain match record easi incorpor domain speci data integr algorithm user client data clean integr home phone internet gsm figur integr view telecom custom clean process algorithm practic compar person address extens invok clean process implement clean process good qualiti result main diculti volum data involv clean process make match phase optim techniqu cost phase iter time avoid miss pertin match record human import autom work user clean give user maxim amount inform found elimin erron match minim amount data inspect manual due iter natur clean essenti easili modifi speci cation implement clean process note rst point ect tradeo exist qualiti ecienc exist solut data clean rst obviou solut write dedic applic program implement data clean process extract sourc data store le program call extern procedur compar record eld match phase solut reason solut exibl support iter process data clean explain earlier modifi part process rewrit larg amount code solut advantag data process capabl er current system implement costli data intens oper match phase optim left programm code system automat gener integr mediat declar speci cation languag call isl rich varieti match criteria produc match record input tabl semant enforc system limit record tabl match record tabl record match con ict user call resolv suitabl perform reason user local global view con ict relat work formal base annot datalog interschema correspond match relat tabl integr correspond speci ed set condit applic program implement correspond unlik tupl tabl match record tabl mean provid support analysi match record step gener materi view sacri ce qualiti clean process user inspect match shortcut match record error introduc view whirl power gener approxim match record sql queri enhanc special join oper similar comparison function base model commonli adopt statist inform retriev match record sort similar target integr data di erent web whirl provid mean support subsequ phase requir data clean step solut work duplic exist sourc tabl process natur interact left metric call neighborhood detect maximum number exact approxim duplic record error lack eld smallest amount time method consist repeat step concaten record clean singl kei substr record sort record compar record close size window criteria compar record order duplic de ned set match rule encod proprietari program languag execut previou step time di erent produc set pair match record nal transit closur appli pair yield union pair gener independ pair infer transit equal main drawback method knowledg time intens task impli pass nding suitabl kei put similar record imposs eld valu compar match criteria client european written slightli di erent similar wai distinct record put close sort kei extrem record eventu neighbor pass execut di erent happen reason period time support clean rule er commerci data clean match rule appli pair neighbor record le distinct sourc record concaten singl le schema individu sourc tupl relev relat work system commerci tool oracl util solut data prototyp standard aim solv object ident problem speci domain system er set reusabl extens primit deal schema evolut transform data mention data problem work data fusion descript commerci tool data clean found solut paper data clean applic model direct acycl ow transform appli sourc data framework consist free open system platform er main servic data transform servic er perform data schema standard attribut valu match call approxim enabl produc singl uni ed tabl set input tabl solv object ident problem servic consist sequenc match merg phase duplic elimin servic enabl remov exact approxim duplic singl data sourc sequenc merg phase notabl featur framework user explicitli involv match elimin error inconsist match merg match record informix data blade featur extens crucial requir framework cover data clean applic servic support share behavior servic applic duplic framework custom clean applic invok extern domain speci function normal ad ned librari oper combin sql statement order obtain complex data clean set algorithm oper cluster extend addit proposit open extens paper make technic command languag express express exibl languag express whirl languag duplic richer similar function oper support merg match record semant match express window approach match record compar record cartesian algorithm set match record produc window approach comput oper true exibl languag achiev declar inherit avor languag case special oper er commerci tool integr properti easi mainten data clean program provid techniqu make execut ecient execut oper partial support regular sql queri engin extern execut engin dual architectur enabl exploit comput capabl er relat optim techniqu tailor speci citi support similar function present optim techniqu render cartesian semant match larg amount data paper address issu involv data clean provid mechan user discov integr clean criteria applic reli knowledg experi accumul expert work applic deal daili anomali data cover algorithm increment mainten materi view data sourc updat paper organ section present gener framework describ section describ optim techniqu motiv design mean exampl result demonstr approach present fourth section section conclud framework section rst give overview data clean process enabl framework function decomposit servic describ semant syntax support servic implement physic oper physic oper map support map describ metadata requir document data clean integr process back trace overview framework servic data clean process accept input set possibl erron inconsist base tabl return consist set tabl integr view basic assumpt work tupl singl tabl uniqu identi ed kei attribut integr view join tabl tabl model result tupl match tupl tupl match tupl complet transform input data output view sequenc correspond servic provid framework describ detail cover frequent requir data clean integr applic encompass larg famili applic due extens success describ servic provid framework data transform servic appli extern function transform valu simpli cation convert data schema comparison servic support map tabl input produc tabl output match approxim join servic perform di erent task set input tabl rst task produc set match record task support match perform gener join oper input tabl case associ similar pair tupl cartesian product tabl task analyz match record valid match task support task gener tabl uniqu record support map data transform servic servic perform distinct task input tabl rst support match appli input tabl aim nding exact approxim duplic record task group match record cluster potenti similar object task support cluster input tabl produc output set cluster task perform oper di erent algorithm analyz cluster uniqu record nalli map oper appli order construct integr clean tupl figur show servic support left side side gure depict success phase partial clean process telecom highlight phase note note note mean user interact involv oper map stand construct map correspond instanti map oper construct integr tupl sourc tabl relat format eld appropri normal transform process step appli approxim duplic record nalli match step appli result step section present syntax semant provid framework oper correspond command make present present task constitut servic introduc show support treat relationship requir extens algorithm present concentr attent import case futur work map map map map map map match mm match cluster duplic transform elimin de match mm servic client match cluster match cluster de de figur framework data clean process telecom data map command request data transform creat map select return return string keyword creat map output tabl convent extend client tabl convert lower address eld eld post oc box null valu job eld replac string speci cation data transform appli tupl tabl consist sequenc variabl declar variabl declar de ne comput evalu element cartesian product tabl express includ call extern user prede ned system platform construct enabl express complex express shown express refer variabl de ned attribut input tabl select project attribut relat variabl speci ed map oper creat multipl tabl set operand tabl multipl select speci explicitli state output addit speci cation imagin produc tabl output previou normal gsm client call job store correspond exist job client identi er tabl creat repres anymor output output explicitli speci ed repres creat map select select job return return data match match oper speci ed mean speci match creat match similar return return return return threshold similar set input relat speci ed match command produc result relat schema includ kei attribut input extra attribut similar domain real number project kei automat import point note match oper comput similar variabl mandatori similar calcul complex base variabl store similar client variabl store similar function extern function comput close class function commonli compar string edit distanc function comput return distanc string relationship similar edit distanc similar arbitrari constant de ned conveni simpl ham distanc function align input string return number charact di erent complex edit distanc function algorithm algorithm function written program includ framework ned librari ad user threshold speci es option accept match similar threshold presenc tupl cartesian product similar threshold discard result semant threshold similar sql condit intern variabl input tabl attribut simpl match oper nding duplic tabl creat match similar threshold similar stand similar function gener avoid match record semant match oper cartesian product extern function call tabl involv cartesian product speci ed extern function call data cluster duplic elimin cluster phase remov duplic case approxim valid match inform perform directli result match phase order perform duplic tupl consid similar match phase group repres uniqu object real world cluster command enabl call cluster transit closur provid framework function librari suppli user transit similar threshold speci ed match oper induc symmetr relationship tupl input tabl transit closur relationship fragment tabl content disjoint partit partit give birth cluster produc manner treat human cluster diamet return set tupl satisfi pair tupl similar threshold speci ed match oper maxim set properti immedi cluster diamet fragment set tupl disjoint partit produc potenti overlap set tupl high connect kind cluster target human consumpt construct cluster uniqu kei gener result oper binari tabl associ tupl input tabl cluster command cluster diamet creat cluster diamet function implement cluster algorithm invok speci ed cluster transit closur keyword global cluster similar identi ed keyword construct repres global similar cluster comput similar member aggreg function combin aggreg function introduc cluster similar modifi creat cluster diamet threshold speci es cluster similar minimum similar member cluster return tupl addit eld cluster similar case presenc threshold addit ltere cluster global similar includ result semant threshold analog sql data data judg correct match inform produc match phase algorithm oper vari type applic duplic elimin approxim written user chosen provid framework librari function duplic elimin approxim manual duplic elimin automat duplic tupl cluster phase transit cluster diamet induc disjoint partit set tupl relat framework librari cluster declar match tupl belong cluster duplic duplic tupl perform previou addit threshold limit distinguish cluster automat detect set duplic cluster cluster global similar threshold analyz manual appropri previou cluster method appli transit closur order appli threshold global similar cluster de ned mode express languag creat threshold manual duplic tupl appli cluster phase transit diamet human inspect cluster extract believ uniqu tupl cluster phase order minim user base maxim knowledg potenti duplic match automat nal pair match tupl result match comput set potenti match automat phase match pair match pair form call pair match semant implement match rst algorithm provid default list match pair sort descend order similar iter list current pair declar automat tupl join remov rest list pair refer declar refer step algorithm purg except situat algorithm user call rst pair match record equal similar call ti case highlight sim sim sim sim sim sim purg perform tupl shown user purg execut match rst algorithm syntax oper creat recal global similar valu option cluster remark algorithm valid assum match extens present section stand function implement algorithm user provid automat replac function invok similar main di erenc automat similar consid pair match tupl speci ed threshold similar fall pair match tupl wait manual valid translat simpl modi cation step match rst automat replac request user valid similar inferior threshold pair match tupl declar purg perform mode express languag creat threshold similar manual simpl version potenti match tupl valid human interact purg posit previou oper transform creat notic threshold refer slightli di erent notion depend talk duplic elimin approxim join rst threshold refer global similar cluster distinguish cluster treat automat cluster analyz case refer simpl similar distinguish pair match tupl probabl treat automat pair analyz user previou talk approxim join tabl result phase tupl decid match data integr case data interest interest integr view pair tupl tupl match tupl relat semant easili obtain appli project di erenc real match express nativ ignor process remark data cluster fundament brick framework introduc notion human interact decid tupl automat chosen summar wai combin oper algorithm point case duplic automat cluster cluster oper transit closur cluster diamet perform displai manual underli intend user decid match rst appli approxim join perform directli match result construct map approxim join construct oper speci ed order automat build tupl materi tabl constitut target integr view assur map oper construct automat client tupl match tupl obtain result creat map select job client kei similar return street return number pob citi address concat job threshold similar attribut access implicit scan base tabl kei express repres access attribut tabl correl attribut origin relat obtain metadata inform store entir process data transform kei attribut gener uniqu identi er gener eld obtain address concaten partial inform pob job obtain concaten base eld function concaten address compon deal null argument number extern rst function return rst argument note construct oper meant appli approxim join oper duplic remov construct result case manual current statu framework unreason automat valu attribut tupl meant repres entir cluster duplic result view distinguish tupl construct random procedur make make absolut construct automat tupl integr view approxim join di erenc tupl di erent di erent level merg order produc uniqu result tupl case approxim join request human interact extrem case level inconsist eld high previou consist tupl merg calcul user interact request level threshold construct oper speci es similar address client user call good address valu metadata requir import requir data clean applic possibl explain data transform process work publish show fundament role plai metadata describ multipl integr ort metadata describ attribut undergo integr refer explain metadata appli relat model form attach relat store metadata repositori call dictionari big advantag addit inform increment support integr possibl inform exploit common possibl trace integr process data transform attribut enhanc describ mean unit speci data metadata inform phase clean integr process sourc target schema descript librari transform function appli normal function map oper similar function support traceabl store metadata includ date inform person produc attribut document identi cation oper produc standard pair produc clean integr store refer metadata optim techniqu data qualiti framework cartesian match oper involv comparison tupl sourc tabl potenti error match captur perform penalti incur cartesian semant enhanc extern function call evalu dbm engin nest loop join algorithm extern function call match oper amount data involv account iter behavior requir data clean process optim match oper main focu techniqu shortli present detail mix part match oper execut insid rdbm part execut rdbm cartesian product call extern function execut complet function manipul data current relat perform oper slowli impli dump oper creat le tupl load creat tabl le oper earli evalu select oper reduc tupl cardin earli select reduc number tupl handl match lower cost underli nest loop join extern function call neighborhood hash nest loop evalu convert ecient hash base algorithm case addit knowledg semant similar provid metadata attach function signatur edit distanc string string di er length maximum accept distanc mean hash overlap distanc length compar length group similar threshold speci ed phase move order speed match oper elimin comput algorithm edit distanc return distanc niti di erenc length input string larger paramet algorithm correspond maximum accept distanc cost algorithm proport kn length string inform reduc reduc cost edit oper elimin extern function call altogeth notic result comput goal comput determin tripl similar threshold tripl reject reach threshold elimin compar work levi mumick present framework reason aggreg infer predic push aggreg assumpt correct match construct criteria dbm dbm dbm dbm similar figur mix partial evalu similar function cach avoid unnecessari call extern extern function call function argument yield result cach argument result extern function call prepar call rst check comput answer parallel parallel techniqu hash join parallel execut match neighborhood hash join execut optim appli edit function permit hash parallel obviou techniqu partit sourc tabl replic tabl site result obtain merg produc nal match result describ optim uniqu problem partli remark optim neighborhood hash join exploit characterist similar function mix evalu optim approach advantag optim support underli sql execut engin dbmss perform badli presenc nest loop join extern function call execut entir match oper insid dbm prohibit cost call extern function sql statement perform cartesian product high oracl call extern function impli call function call function part execut insid dbm nest loop join extern function call complet execut dbm program handl data le left side gure repres queri execut plan implement match oper tabl neighborhood hash join distanc metric measur similar lower greater similar uninterest string distanc greater threshold case addit knowledg distanc metric nest loop evalu replac special form approxim hash join call neighborhood hash join illustr magnitud time obtain version execut simpl extern function compar string test sun ultrasparc physic virtual memori run suno dbmss overhead call extern function remain bottleneck maximum accept smaller set string number larger set fit memori partit set length string compar element element partit length partit length string partit length string smallest length largest length read partit string length memori compar element length element partit figur gener neighborhood hash join algorithm distanc function obei exist function pair inequ length input set string hash result applic function bucket consist string neighborhood string bucket compar bucket length edit neighborhood hash entail bucket input string length applic interest edit distanc threshold string length potenti match string length string length potenti match string length function properti hold edit distanc function return number occurr charact string neighborhood hash join algorithm present gure big input le string partit compar load memori note loop econom partit partit note standard hash join tabl tabl replac nest loop evalu classic explicitli includ predic form claim data clean kind predic correspond intuit heurist compar string lter predic compar rst letter string frequent justi ed fact data entri error rst letter uncommon match match threshold push match optim match rst algorithm place account relationship similar distanc section tabl sourc tupl tupl tupl function compar tupl return edit distanc string eld tupl tupl assum time comput monoton algorithm maximum distanc accept match match similar maximum distanc similar assum algorithm gure describ evalu phase concurr match total time phase minim explain requir de correspond match tupl tupl compon identi ed correspond eld str jth compon tupl match tupl de ne edg pair match tupl stand identi er jth tupl compon match tupl match neighbor match tupl ti edg distanc ti match tupl ti pair call tie class ti transit closur ti formal repres decid match tupl repres valid tupl compon match tupl marri marriag group marriag begin marriag input duplic algorithm step rst step calcul set intuit mean set good match tupl distanc lead set consist match tupl neighbor element good set accept match tupl analyz user distanc match threshold neighbor good set chang execut step task constitut step ti good tupl shown user good tupl marri automat marriag match tupl tupl remov ft remov ft user option shown result delet oper valid tupl move good occur good neighbor higher score delet neighbor marri notic nding neighbor ecient hash index good similarli compon tupl match tupl id good data structur enabl discov neighbor expect constant time sake distanc compon tupl base comparison singl eld str gener involv comparison eld marriag step find occurr good st edg ft good calcul distanc constraint satisfi add good add add good add accept step sort good accept distanc cluster tupl belong class iter good list current match record good declar marri option show user purg accept tupl st purg tupl good iter accept list current match record user user marri remov accept match record st good add good add accept good accept distanc figur optim match rst algorithm push threshold algorithm extend user call analyz set match tupl edg similar fall neighborhood interv ti extend tupl test line algorithm replac neighborhood add good base tabl match oper involv comparison tabl accept distanc distanc assum input match phase constitut tupl mention kei execut step algorithm result pair empti evalu accept distanc return actual distanc dont pair discard pair empti equal distanc tupl insert good pair tupl belong empti equal edit distanc maximum distanc return distanc equal equal tupl insert good pair tupl belong check edit distanc distanc return real dont calcul equal tupl put pair tupl tupl belong good comput distanc function distanc return greater distanc equal accept distanc tupl insert accept tabl pair tupl belong good tabl comput distanc function distanc return equal tupl insert tabl good pair tupl belong good tabl equal comput distanc function return superior ad pair tupl belong good comput distanc function initi distanc return superior tupl put tabl summar distanc obtain tabl accept belong step distanc tabl good good accept good step tabl good order match record marri record purg tabl good tabl check tupl brought back exist edg marri tupl good declar match record purg tabl accept tupl shown user main bene optim distanc threshold distanc calcul edit distanc function case approxim analysi present studi comput time involv optim approxim analysi optim addit size string eld make pessimist assumpt number tupl put step comput save rst step optim end save save time tupl put good neighbor invok edit distanc function maximum distanc step worst match tupl brought back distanc extra time consum overhead compar point bad scenario optim work good match tupl marri good tabl match tupl valu valu neighbor purg marri match tupl valu brought back edit distanc function happen realist situat expect good match neighbor purg ect larg number good tupl tupl seldom brought back group marriag match tupl algorithm appli tupl rst tabl marri tupl tabl modi cation introduc semant match rst mean tupl tabl match tupl happen reconsid telecom match semant correspond situat cellular phone cellular phone number correspond singl home phone number edg tupl restrict call edg formal de nition pe identi es tabl tupl marri compon tupl women men de nition remain refer edg replac edg marriag step find occurr good st edg ft good pe calcul distanc constraint satisfi add good add good add accept step sort good accept distanc cluster tupl belong class iter good list current match record good declar marri option show user purg good accept tupl st pe iter accept list current match record user user marri remov accept match record st pe figur optim match rst algorithm push threshold marriag set accept tabl purg phase step modi ed algorithm optim shown gure note ti class ti de ned edg group marriag tupl tabl marri multipl tupl tabl internet client marri cellular phone record algorithm case account exist ti equal strong marriag accept advantag threshold comput edit distanc function optim algorithm work repres gure comput compil stop evalu boolean express outcom boolean consist conjunct conjunct discov evalu halt optim close relat group marriag step add good add accept step sort good accept distanc iter good current match record good declar marri iter accept list current match record user figur match rst algorithm push threshold group marriag base similar match match similar threshold similar similar threshold consid comput variabl assign smaller elimin tupl tupl belong match return satisfi condit minimum similar execut plan repres gure pair tupl satisfi condit give rise match optim base fact bypass partial similar function call assign return total similar match obtain appli comput product partial threshold push comput partial similar avoid base cluster threshold similar observ work cluster assum match cluster diamet match similar threshold similar cluster diamet threshold cluster option diamet cluster threshold similar requir match tupl result similar greater order cluster assum similar function appli tupl base edit triangl inequ match tupl distanc relationship similar distanc de ned perform inequ veri sim sim appli result sequenc oper match tupl return similar similar similar similar superior similar tupl superior tupl identi ed compar put cluster result section present result set experi goal evalu optim techniqu section experi creat valid whirl system consist tabl inform exist compani oper optim approxim join oper match rst similar tupl comput edit distanc implement algorithm order obtain larg volum data replic origin number time random error introduc handl eld order avoid exact duplic test evalu strategi scale tupl tabl size result le overhead call extern function oracl extrem evalu match oper dbm interest altern dbm experi manipul le program experi measur execut time program account time dump oracl le load data le read data time write result le experi intel pentium ii run linux redhat oracl version optim target evalu match tabl speci ed languag sequenc match similar threshold similar threshold similar time dump tupl oracl le min time spent load le back oracl min nb tupl tabl nest loop neighborhood hash join nb tupl sourc tabl execut time nest loop neighborhood hash join figur nest loop neighborhood hash join naiv evalu sequenc perform nest tupl cartesian product similar execut phase iter result match decid correct match list optim appli order improv perform naiv evalu observ dimens execut method match execut match phase separ merg rst choic nest loop evalu neighborhood hash explain section choic execut entir match phase nish match de ned merg phase match phase section vari possibl dimens obtain evalu nest loop nest loop push neighborhood hash join neighborhood hash join push execut time strategi present gure logarithm scale compani hash length neighborhood hash join algorithm match perform improv hash join appli note gain match threshold greater gain match threshold averag due fact number partit compar smaller figur show result obtain strategi consid measur execut time step optim marriag semant previou gain obtain hash appli signi improv achiev applic optim signi match threshold threshold reason optim advantag good tabl descript algorithm lled earli process impli distanc pair string evalu edit distanc function number tupl larg situat tupl gain obtain remark gain obtain optim depend larg data threshold valu figur show dimens match threshold threshold number tupl gain obtain optim case expect threshold permit execut algorithm advantag nb tupl tabl execut time nl nl nb tupl tabl execut time nl nl figur naiv match versu tupl nb tupl tabl nl nl figur naiv match versu call edit distanc function remark addit improv optim obtain neighborhood hash join achiev compar partit speci order bucket correspond string equal length di erenc length equal probabl nding rst match similar higher net result good tabl lled earli match distanc found equal di erenc length current continu compar bucket di erenc length greater gain obtain compar neighborhood hash join optim match threshold threshold set experi real data inria supplier tabl supplier organ approxim exact duplic total number tupl goal appli match oper tabl order pair duplic measur execut time qualiti result obtain evalu match hash rst letter organ nest loop algorithm match oper predic rst letter lter match organ organ similar threshold similar organ hash rst letter partit correspond rst letter compar edit distanc function time execut obtain sec case naiv nest loop evalu time longer percentag match lost rst letter lter evalu success applic kind lter depend domain applic match found naiv approach lost lter match correspond object work address problem data entail major object ident data entri data inconsist overlap autonom framework consist open extens system data clean applic speci ed direct acycl graph data transform phase phase speci ed mean data clean servic er system data match servic support share kernel consist command system platform open de ned ad servic ad base set languag featur express languag cartesian semant match contribut signi cantli express potenti error correct match captur enabl step requir data clean process manner telecom code line code languag present experienc fact larger remov duplic list inria remov duplic biolog bibliographi refer consolid bibtex le dblp languag extens extern function code convent program languag extens sql exist languag feder system compact speci cation clean process syntax main function construct express tree threshold condit valu intern variabl obtain uniform speci cation oper introduc cluster languag primit permit applic optim techniqu push threshold optim techniqu ecient execut match oper rst techniqu execut relat system speci calli tailor execut engin techniqu exploit semant knowledg similar combin hash join algorithm dramat reduc number record compar approxim join oper match oper avoid unnecessari access match record experi conduct test vari size show optim techniqu bring substanti perform improv larg work progress studi classic edit distanc function order properti optim research signatur function algorithm detail studi metadata store process clean account notion propag rule approach intens experi real data clean refer bernstein support data transform microsoft repositori ieee data engin march roger languag describ signatur simon fundament data chapter data refresh de rosati principl approach data integr reconcili data wareh submit claypool rundenstein flexibl approach ieee data engin march mediat data proc acm sigmod conf data cohen integr heterogen common domain queri base textual similar proc acm sigmod conf data cohen practic observ integr web inform workshop conj acm dayal process queri gener hierarchi system proc int conf larg home page data tool hellerstein optim techniqu queri method acm tran open data integr ieee data engin march hernandez stolfo problem larg proc acm sigmod conf data hernandez stolfo data data problem journal data mine knowledg keim tutori cluster discoveri method larg base proc acm sigmod conf data identifi merg relat bibliograph record master massachusett institut june intern home page data iso languag sql part persist store modul kellei gener topolog van nostrand techniqu automat correct word text acm comput levi mumick reason aggreg constraint proc int conf ext milo schema match simplifi heterogen data translat proc int conf larg mong elkan ecient algorithm detect approxim duplic record workshop research issu data mine knowledg discoveri conj acm oracl server util ullman mediat system base declar speci cation qualit market softwar home page tool rosenth scior metadata propag system submit rosenth data integr challeng proc int conf larg swift data standard data base int conf practic applic rosenth semant valu facilit heterogen inform system acm tran rosenth metadata resourc promot data integr proc ieee metadata silver shasha wang techniqu retriev acm transact inform volum apr smith waterman identi cation common molecular subsequ journal molecular find approxim pattern string home page integr tool home page tool king gener data integr mediat materi journal intellig inform clean integr program telecom motiv section set tupl de voluceau bp rue da de voluceau bp rue voluceau bp de de voluceau bp de de bp de mar rst step clean integr tabl data schema map oper repres creat map select job transform tupl de da de bp da la de analog data schema oper creat map select job creat map select usernam step consist remov duplic tabl express sequenc oper construct creat match similar threshold similar output cluster transit closur nding duplic speci ed creat cluster threshold return set tupl schema appli partit oper repres creat threshold decid automat duplic cluster similar superior cluster analyz hand similar threshold user valid valid cluster duplic manual construct oper speci es user call build tupl creat map select job set tupl decid user free duplic gener automat kei base tabl de da sql view de ned gather tupl tupl de ned creat view select union select result tupl de da de undergo process duplic elimin match oper result normal creat match similar return return return return threshold similar result tabl schema kei result match tupl duplic elimin process appli appli transform tupl tupl de voluceau bp rocquencourt result call transform view similar initi tupl match oper speci ed creat match similar return return return return threshold similar return result gather sql view execut join result tabl output tripl semant repres approxim join tabl creat view select similar result tupl execut view repres creat threshold similar tupl decid automat match tupl decid user similar threshold construct map oper appli intend build tupl integr view tabl client tupl construct similar threshold manual construct automat construct construct threshold state street sucient similar user call construct hand client tupl creat map select job client return street return number pob citi address concat usernam job similar threshold similar result client tupl de voluceau bp rue da bp han de mar
AI/1254 2 circumv dynam evalu kalman filter appli mobil robot local georg bekei depart electr engin depart comput scienc institut robot intellig system southern california lo ca abstract mobil robot local problem treat iter estim process attitud estim posit estim indirect form kalman filter develop attitud estim appli gyro model main benefit choic complex dynam model mobil robot interact environ avoid filter optim combin attitud rate inform gyro absolut orient measur implement independ structur vehicl morpholog ground method easili transfer mobil platform provid carri set sensor case studi detail result extend approach case present case result demonstr efficaci method introduct juli mar pathfind mission deploi autonom surfac mar due challeng round trip commun delai robot equip perform high autonom goal seek hazard avoid behavior futur mission mar involv longer rover site scientif interest order autonom rover exact posit work support part caltech contract darpa contract local local kei problem autonom mobil robot techniqu develop tackl sort main rel local consist evalu posit orient integr inform provid encod inerti sensor knowledg initi condit absolut local techniqu permit vehicl determin posit directli navig activ passiv map match global posit system rel local set sensor inerti navig system mobil odometri implement mean optic encod monitor wheel revolut steer angl wheel simpl geometri kinemat model encod data comput posit vehicl rel start posit wide aviat outdoor robot consist gyroscop acceleromet provid angular rate veloc rate inform integr posit orient vehicl calcul wide simplic unsuit long distanc due error slip model inaccuraci error calcul vehicl posit orient gener grow unbound time substanti improv provid appli kalman filter techniqu successfulli posit estim problem decad step limit error growth reli absolut local techniqu global sensor measur drastic accuraci estim uncertainti bound kei contribut paper ffl list drawback relat appli dynam model attitud estim case outdoor mobil robot cumbersom model specif vehicl interact dynam environ avoid select gyro model gyro signal system equat formul problem requir indirect kalman filter approach ffl equat linear estim case deriv detail result indirect kalman filter studi signal process unit suppress effect bia optim combin gyro signal signal absolut orient sensor result estim shown section discuss relat previou section discuss dynam model discuss form kalman filter conclud favor indirect section discuss case planar motion singl bia gyro extens case conclud paper summari discuss futur work previou work order deal systemat error indoor calibr techniqu call test author discuss techniqu call odometri data substitut gyro data instanc vehicl gyro odometri data differ drastic system larg free drift gyroscop complementari kalman filter estim robot attitud acceleromet signal low frequenc motion gyro signal measur magnet compass sun sensor assum sensor measur absolut orient vehicl high frequenc motion attitud inform calcul posit increment author low cost system tilt sensor approach incorpor system priori inform error characterist inerti sensor directli extend kalman filter estim posit exampl absolut local includ basic local algorithm formal emploi ekf match beacon observ map order maintain estim posit mobil author ekf fuse odometri angular measur landmark bayesian approach learn landmark local approach limit case planar motion accuraci depend heavili presenc form absolut posit system estim algorithm capabl incorpor absolut posit measur provid reliabl estim absenc extern provid posit inform focu method attitud estim indirect kalman filter oper error state dynam model replac approach avoid dynam model reason ffl elementari reason time modif made robot mass part dimens dynam model redon produc estim tailor specif structur slightli vehicl requir estim ffl practic reason dynam model requir larg number state mar rover steer estim practic comput concern size estim state larg comput demand gain ffl dynam model ad complex produc expect result updat posit base updat attitud straightforward consid ampl attempt model attitud dynam dynam model elabor torqu model give accept attitud determin accuraci reason attitud estim applic aerospac domain gyro dynam model replac mode ffl model mobil robot move rough terrain complic model spacecraft essenti interact vehicl ground extern forc spacecraft travel ballist trajectori law gravit forc interact rover ground depend paramet requir assumpt made point contact assumpt frequent model dynam effect wheel wheel wheel requir prior knowledg ground paramet friction coeffici function wheel slippag soil shear elast modulu slippag observ account dynam model model motor requir obtain real valu torqu act wheel ffl problem vehicl system decoupl vehicl motion terrain morpholog system support motion vehicl imit motion robot move smooth fashion motion prone effect estim method reli inerti navig system dynam model independ terrain form kalman filter mention kalman filter wide local kind mobil robot applic linear kalman filter extend kalman filter form full state kalman filter work form linear kalman filter ekf section deriv equat formul section examin reason select form commonli found robot literatur indirect direct kalman filter import aspect implement kalman filter conjunct inerti navig system indirect direct refer error state total state formul total state total state orient variabl measur extern sourc signal error state error orient estim measur present filter differ extern sourc data drawback direct filter implement loop total state filter maintain accur awar vehicl angular motion incorpor dynam attempt suppress noisi erron data high frequenc dynam involv total state descript filter includ high frequenc compon model develop kalman filter predic adequ linear system total state model exist disadvantag direct filter design filter fail temporari comput entir navig algorithm fail useless filter reliabl point view desir provid emerg degrad perform mode case failur indirect filter case failur continu provid estim act integr data direct filter ideal fault detect identif indirect kalman filter estim error navig attitud inform differ extern sourc data follow high frequenc motion vehicl model dynam explicitli filter dynam indirect filter base set inerti system error propag equat low frequenc adequ repres linear filter loop base low frequenc sampl rate lower direct filter effect indirect filter develop sampl period extern order minut error state formul essenti terrestri aid inerti navig system feedforward feedback indirect kalman filter basic differ feedforward feedback indirect kalman filter handl updat error estim case updat error estim fed forward correct current orient estim updat feedback formul correct fed back correct start state integr time step start differ feedforward feedback form differ linear kalman filter extend kalman filter state propag start correct state measur linear filter propag continu state propag reach measur ignor correct comput linear kalman filter feedforward indirect kalman filter free drift unbound error planar motion singl bia gyro greatest difficulti attitud estim approach low frequenc refer bia drift violat white assumpt requir standard kalman filter problem attract interest research earli dai space program gyro model kalman filter suitabl augment state vector potenti provid estim sensor bia observ requir satisfi earli implement gyro model kalman filter found estim vehicl yaw planar impli deriv equat vehicl ground actuat angular translat veloc ff linear vehicl vehicl paramet vector ground ground soil friction order avoid develop equat reason mention section develop replac equat replac relat gyro output signal bia angular veloc vehicl approach simpl realist model due model angular veloc relat gyro output bia assum gaussian process covari bia static quantiti driven gaussian gyro ramp nw nw covari nw process assum uncorrel studi simpl case attitud estim vehicl move plane assum gyro absolut orient inform provid directli sensor frequent interv feedback indirect kalman filter formul equat true angular veloc true true true nw rearrang matrix form dt true true true true nw absolut orient measur true true sensor measur absolut orient assumpt gaussian process covari term drive input system shown equat elimin wai add state estim impli develop express equat option formul estim algorithm indirect kalman filter orient estim obtain integr gyro signal constant rate estim bia state equat integr dt subtract equat error orient written omit error orient bia error subtract equat true bia error written nw error propag equat indirect kalman filter rearrang dt nw compact form dt assum measur provid indirect kalman filter true gyro signal integr absolut orient measur equat matrix form compact continu kalman filter equat covari fp pf ph hp covari system measur system covari matrix measur covari matrix equat steadi state case lim nr nw solv element matrix nw steadi state kalman gain ph nw indirect kalman filter estim error state estim propag equat ad correct dt substitut error state estim estim propag equat dt separ estim integr quantiti order feedback formul dt dt notic equat log frequenc log frequenc log frequenc figur plot power spectral densiti gyro displai integr plot power spectral densiti integr gyro absolut orient sensor shown plot displai power spectral densiti filter integr gyro filter absolut orient sensor substitut dt laplac transform solv rewritten reveal indirect kalman filter weigh sourc inform integr gyro signal absolut orient complementari fashion characterist acquir intuit indirect kalman filter deal examin case sensor input sensor signal inform figur plot effect integr process gyro strong compon lower frequenc amplifi integr process low frequenc inform contamin obviou reli gyroscop integr estim low frequenc motion higher frequenc effect integr suppress gyro gyro reliabl high frequenc motion ideal situat fuse integr gyro inform absolut orient sensor sun sensor complementari profil small low frequenc larg high fail constant profil improv estim case assum profil integr gyro absolut orient sensor depict plot figur point clarifi indirect kalman filter optim combin inform sourc examin signal process entiti explan plot figur function filter integr gyro signal work high pass filter suppress low frequenc content higher frequenc pass function filter absolut orient sensor act low pass filter critic low frequenc inform absolut orient sensor pass reduc higher frequenc content time time time true estim figur plot orient covari displai plot bia covari shown covari reach low steadi state expect system solid line repres true gyro bia dot line estim bia indirect kalman filter estim true obviou lag absolut orient sensor measur bia directli measur effect orient error result shown accuraci absolut orient sensor time real estim figur track estim perform reli gyro high frequenc rang case error state equat case dt quaternion notat quaternion error true attitud true estim attitud ffi error quaternion composit true ffi bia error defin differ true estim bia true step similar indirect kalman filter case develop due space deriv formul reader refer extens motion show benefit case track quaternion compon shown figur paper local problem attitud estim posit estim focu obtain good attitud estim build model vehicl dynam dynam model replac gyro model indirect kalman filter optim incorpor inerti navig absolut measur develop linear form system measur equat planar case deriv examin role kalman filter signal process unit extens formul case show benefit track case shown paper acknowledg author dr illumin discuss dr dr rodriguez technic discuss refer inerti navig system mobil robot ieee transact robot june ph garcia multisensor local algorithm mobil robot valid ieee intern confer robot page borenstein feng correct systemat odometri error mobil robot ieee intern confer robot page borenstein feng method combin data gyro odometri mobil robot ieee intern confer robot page cooper frequenc method navig system ieee confer multisensor fusion integr gyro drift model evalu ir transact aerospac navig dec rl analyt accuraci solut common spacecraft estim journal guidanc dead reckon rover uneven terrain ieee intern confer robot page andrew kalman theori practic prentic rl applic random process theori gyro drift analysi ir transact aeronaut navig dec welch research explor mar aiaa forum advanc develop space august ej fl dynam model attitud determin aiaa paper aug ej fl md kalman filter spacecraft attitud estim journal leonard mobil robot local track geometr beacon ieee transact robot june stochast estim volum mathemat scienc chapter academ stochast estim volum mathemat scienc engin academ gc newton inerti guidanc limit fluctuat phenomena gyroscop volum page april dc db cd brown spar algorithm simul result symposium spacecraft attitud aerospac corp volum page je potter vander veld optimum mix gyroscop star tracker data journal spacecraft bekei attitud estim mobil robot local technic report bekei attitud estim mobil robot local ieee intern confer robot submit si gs ga bekei fault detect identif mobil robot estim ieee intern confer robot si gs ga bekei sensor fault detect identif mobil robot intern confer intellig robot gm aerospac avion chapter academ thrun bayesian landmark learn mobil robot local machin nf jl fh test result symposium spacecraft attitud aerospac corp volum page jr editor spacecraft attitud determin volum space scienc librari reidel publish
DB/1255 3 queri optim evalu tempor middlewar christian richard snodgrass technic report enter adapt queri optim evalu tempor middlewar copyright christian richard snodgrass reserv christian richard snodgrass march technic report aalborg denmark christian jensen michael dieter kristian usa richard snodgrass moon individu particip curti bond australia fabio itali nick usa gerhard switzerland thoma switzerland nation korea mario canada john south australia nation korea michael usa andrea switzerland vassili usa jef belgium carlo lo usa addit softwar made provid express impli impli warranti merchant fit icon cover combin letter rune alphabet millennium ago successor rune alphabet angular shape lack horizont line primari storag medium wood rune found weapon perceiv hidden power rune arrow icon denot abstract data recent advanc tempor queri languag show applic benefit substanti tempor support dbm achiev tempor queri optim evalu mechan dbm proper sourc level translat tempor queri convent sql paper middlewar compon top convent dbm compon accept tempor sql statement produc queri plan consist algebra regular sql part algebra part process sql part process dbm middlewar perform feedback dbm adapt partit subsequ queri middlewar dbm part paper describ architectur implement tempor middlewar term base volcano extens queri optim queri process librari experi system demonstr util intern process capabl mechan process middlewar underli dbm index tempor queri process middlewar introduct paper tempor evalu tempor queri enabl perform benefit applic reli data data travel applic defin properti data recent advanc tempor queri languag show applic benefit substanti run dbm tempor support potenti benefit applic code simplifi easili programm product data process move applic potenti lead perform tempor support offer current product limit predefin data informix datablad extens facil enabl user defin data type tempor support data type tempor support encapsul tempor oper queri optim extend queri languag develop dbm tempor support scratch daunt task feasibl dbm vendor code base modifi larg resourc led approach layer implement tempor support user applic convent dbm stratum map tempor sql statement regular sql statement pass remain unalt stratum approach present difficulti tempor queri express convent sql support underli constrain tempor construct support problemat tempor tempor ineffici evalu evalu effici applic code cursor access underli data paper gener stratum move queri evalu stratum term approach previou approach consist effect smart macro work flexibl sql gener middlewar addit map tempor sql convent perform queri optim process move queri process middlewar improv queri perform complex oper tempor aggreg tempor duplic elimin effici algorithm difficult process effici convent dbmss queri process occur middlewar issu decid queri execut underli execut middlewar transfer move relat dbm middlewar vice versa queri plan consist evalu middlewar sql code queri process dbm flexibl divid process middlewar middlewar includ queri optim heurist reduc search heurist optim evalu middlewar oper process effici cost determin process obviou process tempor join middlewar dbm depend statist argument fed cost formula paper make contribut valid tempor middlewar architectur implement extend volcano queri optim queri process system middlewar queri optim process mechan explicitli address duplic order consist manner provid cost select estim method tempor oper dbm divid process middlewar transfer oper perform experi system demonstr ad queri process capabl middlewar significantli improv queri perform show optim effect divid process middlewar dbm middlewar system captur function stratum approach flexibl present tempor cost transform techniqu implement tempor dbm make present implement applic integr layer architectur tempor turn make relev dbm vendor plan incorpor tempor featur develop implement tempor support section present architectur tempor show queri flow system section present tempor implement middlewar cost formula tempor method estim select standard statist base relat attribut standard select estim work tempor show section explain transform rule heurist middlewar optim perform experi demonstr util share queri optim tempor middlewar present architectur tempor term adapt queri optim queri process system architectur figur show architectur parser translat queri algebra initi queri pass optim plan assign process dbm specifi result transfer place oper end optim occur phase set candid algebra queri plan produc mean transform rule heurist optim consid detail plan algebra oper assum algorithm comput oper estim consequ cost comput queri physic queri execut oper found origin candid plan enabl statist collector compon obtain statist base relat attribut dbm catalog optim cost estim compon determin cost factor cost formula optim plan estim perform chosen execut compon translat part chosen plan occur dbm sql part reach leaf level pass plan execut execut plan oper result sql select statement sql statist collector parser statist statist user applic tempor queri cost factor initi queri plan optim cost estim dbm queri plan translat sql data loader result queri plan execut engin load instruct sql run time data sql result figur middlewar architectur oper result sql creat tabl statement invoc data loader optim lighter weight dbm optim inform middlewar treat underli dbm full file middlewar accur estim time dbm deliv block tupl involv sql statement cursor contrast estim time read block disk accur job middlewar optim varieti queri plan portion queri evalu dbm determin process part queri resid appropri insert transfer oper queri plan optim compon extend version mckenna volcano optim implement optim enhanc systemat captur duplic support kind relat express relat multiset execut engin modul implement librari queri process algorithm develop van den al access dbm jdbc interfac figur describ main function execut receiv plan consist sequenc algorithm paramet argument algorithm implement tempor aggreg group attribut aggreg function relat algorithm implement sql queri paramet plan output figur execut engin function creat result set algorithm queri plan result set implement iter interfac enabl pipelin queri execut result method invok method initi structur case case algorithm implement fetch tupl argument £ result set copi dbm method result set algorithm order collect invok result set algorithm queri process illustr queri process relat figur store inform posit assum time period time valu denot dai tom occupi posit dai dai time attribut comput relat posit number assign posit sort posit relat figur tom occupi posit time posit count time jane posit count queri result aggreg result tom tom jane tom tom jane jane tom figur relat queri result aggreg result figur depict initi queri plan optim receiv input plan consist sole algebra oper assign process oper perform deliv result tupl deliv client obtain desir tempor aggreg perform count number posit time result figur result tempor join relat join requir time period oper ensur desir sort algebra oper initi plan includ regular tempor tempor oper algorithm middlewar translat regular sql evalu dbm figur show queri plan produc optim oper replac actual algorithm optim cost formula superscript algorithm evalu dbm middlewar plan state relat relev attribut select tempor aggreg perform middlewar tempor aggreg algorithm requir sort argument section algorithm perform transfer argument middlewar result tempor aggreg transfer back perform tempor join join select middlewar join algorithm ¤ join figur initi queri plan select queri plan dbm middlewar optim cost formula dbm join algorithm section queri plan pass execut engin figur consist algorithm issu select statement dbm order obtain argument tempor aggreg perform tempor result load dbm issu select statement dbm obtain result solid line repres algorithm dash line repres algorithm sequenc top statist cost formula avail statist base relat abil deriv statist intermedi relat import queri optim middlewar separ compon collect statist queri base relat queri statist relat exist format dbmss middlewar standard block number averag tupl size minimum maximum number distinct index avail cluster index statist notat tabl shortli describ algebra oper implement figur queri plan discuss deriv cardin statist statist straightforward main focu provid reason estim tempor offer challeng standard select estim estim result cardin select tempor predic section describ obtain accur select estim cost formula notat descript number block occupi relat number tupl relat averag length tupl relat minimum attribut relat maximum attribut relat number distinct valu attribut relat true histogram relat true index relat true cluster index attribut select condit relat tabl statist notat figur cost formula algorithm implement oper support dbm addit algorithm ad includ duplic coalesc cost formula incorpor cpu unit measur return valu microsecond formula explain oper discuss simplifi cost formula comparison gener algorithm dbm queri dbm implement tempor execut cost algorithm consist initi cost process argument cost form output tupl initi cost algorithm set cost form output project assum cost select project dbm formula number cost factor weigh determin cost factor discuss detail section select cost formula includ function return coeffici repres select condit turn specif oper cost formula relat statist suffici space discuss oper focu interest discuss cardin result minimum maximum number distinct histogram attribut remain statist straightforward maintain omit deriv tupl number index avail tupl size result easi comput tupl argument number block relev base relat algorithm deriv result relat index avail deriv attribut base relat index ¤ ¤ transfer oper ¢ ¤ ¢ figur cost formula oper transfer relat dbm middlewar send sql queri dbm jdbc interfac fetch result tupl perform oper depend number size tupl transfer experi oracl show perform affect specifi number tupl fetch time jdbc buffer includ set cost formula £ oper transfer data middlewar dbm creat tabl dbm load data data load specif dbm program sql loader oracl program data file actual tupl control file £ structur data file altern implement oper sequenc insert solut ineffici larg amount data number optim techniqu speed load time sql loader minim size result tabl load load data directli load insert size data load initi memori extent alloc tabl equal avoid cost multipl memori alloc block tabl free space tabl updat cost depend number size tupl transfer tabl creat tabl drop end queri select dbmss effici select implement select algorithm select tempor algorithm perform ineffici transfer intermedi result dbm sole select cost depend relat size select predic minimum maximum valu attribut argument attribut involv select predic predic forc minimum maximum predic lead maximum minimum maximum number distinct valu result attribut equal number equal condit attribut minu number condit attribut equal multipli select select predic predic number distinct valu result select predic cardin result relat estim standard current assum uniform distribut minimum maximum valu histogram assum uniform distribut histogram bucket histogram divid attribut valu bucket assign rang attribut valu store attribut valu fall standard estim techniqu directli suitabl tempor predic current dbmss treat time attribut store statist straightforward statist lead inaccur estim select tempor predic statist dbm suffici adequ estim select queri elabor point tempor relat durat time period dai time period uniformli distribut period januari januari time period start valu januari decemb time period end valu januari januari distinct valu number dai minimum maximum dai tupl intersect time period queri retriev tupl overlap period start februari end februari predic sql condit written distribut time period histogram number tupl result origin relat estim select predic analyz turn predic result origin appli result result tupl origin relat factor altern straightforward simpli account end time period start simpl applic semant queri optim result cardin queri estim subtract number tupl end ¤ februari number tupl start februari function relat defin definit depend histogram histogram function return start end valu bucket function return number attribut valu function return number bucket attribut belong comput function find bucket attribut sum number valu bucket add fraction number valu bucket assum uniform distribut valu bucket formula valid histogram bucket number histogram bucket function return valu type origin origin lead estim size result origin close actual result return tupl time period time point result cardin estim techniqu resembl previou tempor start point time time period time period activ histogram bucket time period start overlap histogram current dbmss statist maintain current dbmss formula histogram estim techniqu tempor join tempor join join tupl equal join attribut overlap time period time attribut intersect period result dbmss effici join case tempor join perform effici middlewar straightforward tempor join relat sort join attribut merg compar valu effici algorithm current algorithm suffici illustr function cost formula algorithm figur tempor join implement regular project section estim select tempor lifespan relat join valu join attribut uniformli time period valu uniformli distribut entir referenti integr constraint valu referenc referenc deriv cardin deriv minimum maximum ¢ ¤ number overlap period pair equal valu data occur chose minimum bound differ maximum minimum bound select estim techniqu correspond present tempor aggreg tempor aggreg ¤ oper benefit run middlewar versu dbm implement middlewar dbm sql queri figur tempor aggreg sql queri comput aggreg relat write queri compact provid code yield discuss result cardin deriv requir argument sort group attribut valu tupl group scatter aggreg comput requir scan relat group argument order group part argument relat time sort enabl read tupl copi argument sort group attribut sort perform extern algorithm sort perform intern algorithm algorithm copi argument similarli join comput aggreg valu group group figur outlin comput code modifi slightli comput aggreg algorithm tempor aggreg algorithm present aggreg tree memori maintain list constant period run aggreg valu cost tempor aggreg middlewar depend size argument result figur complex actual aggreg function experi show function chang cost significantli cost intern sort account upper bound cardin ¤ number distinct valu group time attribut tighten rang minimum maximum minimum cardin lower bound group maximum cardin fraction repres averag number tupl group attribut distinct factor repres maximum number result time period multipli maximum number distinct valu group attribut maximum cardin result bigger minimum minimum sql queri formul exist tempor sql relat true true true true true true figur tempor aggreg comput sql code algorithm oper middlewar optim effect assum join algorithm dbm join strategi emploi queri implement join algorithm middlewar dbm algorithm middlewar algorithm project cartesian product perform dbm middlewar nativ sort modifi merg sort offer perform cost formula sort algorithm middlewar dbm figur relat assum scan select index attribut cost depend index cluster cost formula figur estim comput cost bigger cost dbm index note algorithm translat sql usag algorithm estim total cost queri queri optim heurist initi queri plan singl oper assign process dbm optim appli transform rule gener candid queri plan outlin transform rule drive process transform rule deriv express relat result algebra express equal kind list multiset express list evalu relat equal multiset evalu relat equal multiset notion equal account order list impli multiset transform rule explicitli give strongest type hold denot transform rule term bidirect transform rule type essenti middlewar architectur locat oper process affect type middlewar algorithm design order hold dbm algorithm appli rule mean relat produc side order locat middlewar top oper side relat produc side order relat produc side condit multiset assum heurist divid heurist base intend discuss turn heurist group move middlewar oper process effici oper move middlewar introduc oper £ oper experi dbmss show oper benefit process algorithm middlewar tempor tempor join transform rule accomplish move note rule introduc sort oper algorithm implement oper middlewar requir sort argument join join implement rule enabl move sort middlewar introduc extra oper rule oper reason partit process rule type oper preserv order ¤ ¤ ¤ ¤ ¢ rule appli top oper side assign process dbm subsequ base relat oper tree heurist group elimin redund oper £ group includ rule remov sequenc oper multipl applic rule unnecessari project sort oper sort oper remov argument order multiset requir relat sort end result heurist ¢ ¤ ¤ ¤ ¢ ¢ rule appli project attribut argument relat denot attribut domain schema relat predic list argument return true prefix heurist group combin oper main exampl group includ combin cartesian product select join tempor join select project combin ¤ ¤ ¢ ¢ argument cartesian product attribut prefix result function appli attribut result binari return heurist group reduc size argument oper group includ rule reduc size argument includ tempor tempor join project time attribut appli argument tempor aggreg ¢ ¤ ¤ ¢ ¢ ¢ ¢ ¢ rule rule appli select condit includ attribut project top project note rule trigger applic rule group appli prevent infinit addit oper addit heurist number includ move select project oper tree switch order cartesian product mark appli transform ¢ ¤ ¢ ¢ ¢ function return set attribut present project function select predic side oper process middlewar queri part assign process dbm subsequ translat sql appli transform rule dbm part middlewar optim accur estim cost applic rule introduct extra project select push sort optim perform studi valid conduct seri perform experi object experi data section section briefli discuss cost factor section describ detail optim process queri section summar perform studi find object context set number object perform experi determin worth process fragment queri oper evalu evalu robust middlewar return plan fall plan attempt valid advantag includ select estim techniqu tempor select sought determin overhead perform sequenc queri aim answer number question queri run realist dataset inform system relat maintain inform part section inform job assign relat tupl attribut megabyt relat tupl attribut megabyt variant tupl origin relat queri optim optim run execut engin run time graph queri plan involv middlewar middlewar optim time includ enabl optim collect statist relat statist collector calibr cost factor cost formula cost estim procedur determin cost factor ran set test queri measur determin cost factor cost formula calibr mechan similar du al differ appli test queri synthet construct make queri plan test queri avoid distort effect storag implement factor opt real middlewar optim work set enabl physic characterist data specif plan chosen dbm limit inform cost factor formula assum singl dbm algorithm join show perform simplifi approach effect successfulli divid queri process middlewar underli dbm middlewar cost estim separ modul determin cost factor dbm algorithm versu middlewar algorithm simplest queri relat index scan transfer result dbm server emploi determin cost factor result transfer relat scan queri involv relat result transfer assum cost select project cost factor middlewar algorithm gener easier deduc measur directli run time routin cost factor determin involv process dbm queri paramet transfer result middlewar measur time queri run sole dbm subtract total cost obtain actual transfer cost queri examin close plan number queri ensur optim identifi portion queri execut dbm middlewar queri detail show plan measur evalu time select plan rang data optim select plan elabor volcano optim base specif notion class class repres subexpress store list element oper pointer argument number class element queri directli correspond complex give measur queri queri posit number occupi posit point time sort result posit tempor aggreg queri subqueri queri section figur show queri evalu plan queri sort base relat dbm group attribut start perform tempor aggreg middlewar preserv order group addit sort end plan perform sort middlewar perform dbm due space omit complet sql queri aggreg plan plan plan sec figur plan queri tabl row plan plan plan figur result queri compar plan vari size argument relat optim select plan optim gener class class element run time plan shown figur significantli outperform tempor aggreg dbm slow report experi similar group relat size show similar result experi show process middlewar ten time queri involv tempor aggreg tempor aggreg dbm compet tempor aggreg middlewar small number record aggreg queri queri relat tupl pai rate greater count assign posit time period januari januari sort result posit queri correspond queri present section introduc time period pai rate condit plan figur plan perform tempor aggreg middlewar rest dbm plan assign tempor join middlewar tempor join sort middlewar tempor select middlewar plan select perform argument tempor aggreg select reduc argument sixth plan perform dbm join plan plan join plan figur plan queri plan join sec select end plan plan plan plan plan plan sec select end figur result queri select end smaller bigger ran plan number time end time time period queri relax predic data concentr run time similar queri time period end figur rapidli time figur figur observ plan perform high cost base relat argument appli select plan perform tempor aggreg competit select predic select larger time period perform plan vari plan slow due plan deterior rapidli argument tempor aggreg plan deterior faster plan includ significantli slower size select time optim queri run middlewar optim histogram time attribut optim return plan queri end vari januari januari plan queri optim return plan clear figur accur estim result size tempor select optim gener class element total queri show tempor join time faster middlewar argument resid result tempor queri show hold regular join experi confirm select estim middlewar optim return plan queri posit start januari show pair occupi posit time sort result posit queri tempor test perform perform tempor join middlewar figur show perform perform tempor join middlewar vari condit constrain start run time shown figur maximum time start plan perform plan result bigger lead high cost sort dbm transfer result plan differ perform obviou maximum start reach year tupl start plan plan plan plan plan plan join plan plan figur plan queri middlewar optim return plan queri plan error middl plan plan select estim join tempor join assum uniform distribut valu case data optim gener class element sec plan plan select start maximum figur result queri queri illustr alloc process tempor middlewar advantag result size bigger argument size demonstr optim lead select plan queri queri comput number posit occupi time januari januari sort result queri involv tempor aggreg regular join figur show plan plan easili understood term plan perform tempor aggreg middlewar rest dbm perform tempor aggreg join plan perform tempor select middlewar fourth plan similar perform initi select tempor plan perform dbm ran vari size relat plan plan figur plan queri join result figur show plan outperform join faster dbm requir sort argument algorithm cardin argument small due tempor extra plan retriev tupl dbm reject algorithm middlewar optim return plan gener class element ran plan vari result shown figur perform plan perform plan middlewar optim return plan queri queri follow uniform assum join select deriv formula experi show middlewar process regular dbm oper queri list queri regular join relat test plan perform sort join plan perform join plan perform join dbm dbm join method set explicitli oracl execut plan vari size relat result figur show plan yield perform plan competit middlewar optim suggest perform join dbm optim dbm join plan consid gener class element total experi show dbm faster perform queri involv regular oper fact similar algorithm competit dbm middlewar plan includ overhead introduc sec tabl row plan plan plan plan plan sec figur result queri summari perform studi find time period start perform experi demonstr middlewar effect process queri involv tempor aggreg tempor join faster middlewar argument resid result size bigger argument size experi report show case tempor join effici dbm show optim simplifi cost formula effect divid process middlewar dbm select estim techniqu tempor select shown accur estim size intermedi gener result plan select plan alloc evalu dbm tempor perform highli select deterior rapidli select predic relax test middlewar optim overhead small implement parser middlewar expect significantli slow process standard languag technolog independ size test queri involv heurist introduc join relat work gener notion softwar extern dbm particip queri process classic work heterogen call feder data resid necessarili consist combin present user approach share notion tempor underli data model queri languag user differ support underli export schema local queri process occur underli dbm differ heterogen definit involv underli tempor middlewar connect underli heterogen data conceptu prime tempor middlewar great deal work relat area mediat integr architectur mediat offer consist data model access mechan dispar data tradit focu plan plan plan plan plan sec tabl row plan plan plan figur result queri resolv schema data data effici queri evalu complex environ differ mediat tempor address issu data fusion schemat access data share emphasi layer term wrapper data model queri facil access data share emphasi domain special architectur tempor middlewar similar abstract level transform cost intern queri evalu algorithm specif relat work util integr architectur garlic system offer access varieti data queri capabl mediat emploi sophist base starburst optim optim attempt push join data sourc assum fix schema data sourc sourc wrapper requir care calibr close coupl sourc approach assum singl data sourc support full featur includ schema definit statement assum oper data permit queri evalu tempor middlewar effici queri rewrit assum data sourc vari wide queri capabl attent captur capabl inform queri rewrit unlik schema independ gravano al offer toolkit wrapper automat gener descript approach assum specif fix queri languag approach fix schema concern wrapper implement data fix focu relat join approach assum underli capabl process data sourc evalu entir tempor mediat ol db disco similar data integr access weak data sourc power queri view mediat approach complementari tempor middlewar approach introduc integr data mediat approach tempor middlewar user wrapper underli queri process made optim discuss section convent optim make paper discuss layer architectur tempor prototyp tempor dbmss work base pure translat tempor queri languag statement sql provid systemat solut divid process tempor queri languag statement stratum underli dbm al discuss techniqu ad transact concurr control support layer tempor tempor layer send regular oper dbm process evalu tempor oper end optim process framework flexibl extend previou foundat tempor queri optim includ tempor algebra captur duplic defin tempor offer set transform rule foundat cover optim implement tempor cost foci present paper work tempor queri optim primarili consid process join semijoin segev defin kind tempor join discuss optim delv gener queri optim consid present optim scheme sequenc coalesc tempor introduc coalesc scheme adopt form transform rule relat work select estim tempor oper includ techniqu estim select tempor predic histogram show select estim sole statist convent dbmss paper consid cost estim heterogen system du al cost model cost formula select join method cost factor formula deduc calibr number sampl queri run dbm similar approach section assum specif algorithm dbm adali al argu predetermin cost model unavail statist easili access suggest estim cost execut queri cach statist past queri statist easili exploit type techniqu implement volcano extens queri optim librari queri process algorithm volcano significantli extend includ transform type algorithm regular algorithm tempor execut engin paper offer tempor middlewar approach build tempor queri languag support top convent dbmss unlik previou middlewar perform queri divid queri process coordin part queri evalu perform experi show perform queri process middlewar case improv queri perform order magnitud perform dbm complex tempor dbmss difficulti process effici implement middlewar contribut architectur tempor middlewar queri optim process capabl middlewar queri optim process explicitli consist address duplic order cost select estim techniqu tempor oper dbm provid tempor middlewar architectur valid implement extend volcano optim queri process system perform experi valid util share process optim result captur function tempor stratum flexibl transform rule select estim techniqu integr ad tempor function dbmss function function manipul relat cost function transform rule relev optim direct futur work exist current middlewar algorithm enhanc support larg relat oper ad add relev transform formula deriv implement oper oper implement algorithm ad execut engin dbm queri process run time queri updat cost factor cost formula interest challeng divid run time algorithm dbm algorithm number refin queri access dbm relat project attribut benefici issu oper acknowledg research support part danish technic research council grant nation scienc foundat grant grant corpor refer subrahmanian queri cach optim distribut mediat system acm pp van der seeger prototyp librari queri process algorithm acm blakelei data access mass ol db acm pp tempor system implement acm sigmod data access ibm famili data engin shan queri optim heterogen dbm pp sripada tempor research practic lnc elmasri navath fundament system edit sheth heterogen distribut morgan kaufmann graef mckenna volcano optim extens effici search ieee pp gravano papakonstantin mediat metasearch internet data engin bulletin segev framework queri optim tempor pp yang optim queri data sourc pp hsiao kamel heterogen solut ieee inmon build data edit john wilei son ioannidi queri optim acm comput jark koch queri optim system acm comput jensen snodgrass tempor data manag ieee transact knowledg data kline snodgrass comput tempor aggreg ieee pp capabl base mediat tsimmi acm pp leung muntz stream tempor queri process optim tempor tansel al pp ozsu valduriez principl distribut system edit prentic hall ullman queri translat scheme rapid implement wrapper pp elmagarmid object orient system acm comput haa queri rewrit mediat system distribut parallel de heterogen problem middlewar experi perform gatewai pp roth schwarz scrap wrap wrapper architectur legaci data sourc pp select estim tempor data manipul inform snodgrass queri plan convent tempor queri involv duplic order ieee san pp sheth larson feder system manag autonom acm comput snodgrass develop applic sql morgan kaufmann stuckei improv tempor join histogram pp jensen effici evalu natur join ieee pp tiger tempor system februari snodgrass stratum approach tempor dbm implement pp snodgrass effect timestamp vldb raschid distribut inform search compon world wide web pp yang inform system dataset scheme time select oper sequenc mod implement transact concurr control support tempor dbm inform wiederhold mediat architectur futur inform system ieee wiederhold mediat inform system acm comput ullman comput capabl mediat acm pp yu meng principl queri process advanc applic morgan kaufmann widom tempor extens informix acm
DB/1256 3 tempor extens odmg object queri languag duma scholl universit joseph grenobl bp st martin abstract tempo set model provid framework extend system tempor function base extens odmg object standard defin extens includ hierarchi abstract datatyp manag tempor valu tempor extens odmg object schema definit languag queri languag paper respect relat main origin manipul histori composit function construct abstract principl function natur oql enforc preserv oql gener standard oql construct deal histori fulli formal syntact semant level implement preprocessor tempor tempor data tempor queri time oql introduct tempor aim integr time primit concept dbm past research area prolif tempor extens data model queri languag relat framework work led consensu tempor queri languag iso standard result miss framework earli attempt defin tempor extens data model fail wide essenti base standard underli data model odmg start adopt major object dbm idea tempor extend extens report argu neglect import aspect independ separ abstract view tempor concept formal semant avoid ambigu gener rich complex tempor concept serv basi effici tempor migrat support ensur seamless transit applic run top system tempor extens tempo extens model persist object gener framework design dbm tempor extens integr featur includ set abstract datatyp handl tempor valu gener model integr tempor support class extent properti level base extens odmg object standard design paper queri defin part work paper organ section defin notion independ discuss relat work issu order make paper review section basic concept tempo present section introduc includ queri illustr conclud section describ section prototyp develop valid feasibl motiv relat work tempor data model tempor associ piec data locat fact tempor associ classifi depend associ fact instant interv associ state fact hold stock price entail fact hold instant interv associ state fact hold instant observ salari januari tempor data model classifi depend kind tempor associ manag instanc state tupl belong tempor relat interv mean tupl belong relat instant enhanc adt model consid semant tupl timestamp interv belong relat instant data model hybrid provid function transform associ distinguish remark appli tempor object model base associ worth note tempor data model pure vast major tempor applic deal associ base tempo design data expect extend deal associ independ data model tempor data relat tempor associ group tempor relat object attribut histori tempor relat histori repres wai attach instant timestamp tupl tempor relat logic level altern group tupl singl timestamp set instant call tempor interv common approach exist data model oper tempor data defin render formal addit defin result oper semant describ result encod remark appli queri lead undesir tension queri express intend semant illustr queri retriev depart ed move account express select distinct valid valid valid valid show clear differ level abstract queri express natur languag refer maxim interv ed account valid valid formul exampl refer inform semant provid notion explicitli express term formul mismatch reflect lack oper histori reason success time provid tempor queri reli oper express kind tempor queri advoc reli fix tempor data defin tempor queri undesir featur tempor data encapsul specif independ oper cover fundament tempor reason granular approach adopt similar set histori queri express queri natur involv constant salari interv year tempor queri languag provid facil reason histori appli model tempor valu tempor data set instant model set disjoint term tempor element adequ logic level introduc gap model concept data model construct summar state tempor data model independ defin oper tempor valu associ independ oper account kind tempor reli tempor data queri tempo data model tempo data model includ time defin hierarchi simpl complex datatyp model tempor histor independ algebra oper histori overview time model tempo base linear bound time model time line structur mean time unit time unit partit time line convex element partit atom granul point time line approxim granul map establish granul time unit set consecut granul unit finer oe coarser time unit month finer year coarser dai finer relat manag tempor valu granular base tempor tempo model defin wide varieti tempor datatyp defin set express time unit set oper defin type independ involv unit fulfil requir state tempor sequenc abstractli defin chronolog order sequenc instant observ assumpt interv case tempor characterist defin specif oper detail descript tempor adt reader refer histori abstract histori defin function finit set instant observ fix set valu type domain rang histori call tempor structur domain formal describ type oper relat histori notat stand type function domain codomain ftg denot type set sequenc design type tupl compon type ti tupl compon label notat denot instanti type type denot tupl compon vi tempor unit denot observ unit function specif introduc histori adt elementari selector type instant tempor domain unit unit unit instant structur instant structur domain addit selector defin aggreg oper retriev cardin histori express durat histori repres mean collect timestamp term chronicl histori repres kind ffl chronolog order sequenc ffl chronolog coalesc sequenc ffl set distinct valu timestamp disjoint tempor hf queri specif oper defin cast histori describ oper cast histori meet algebra oper histori algebra oper histori classifi oper structur result histori instant depend structur argument histori classif close composit oper restrict tempor domain histori instant condit true sg map appli function structur histori map tempor join combin histori histori tempor distinguish tempor join outer depend result histori tempor domain intersect union tempor domain histori structur valu pair obtain combin valu valu attach attach structur valu form instant argument histori defin unit unit unit unit includ oper deal success time group oper granular oe divid histori group unit result histori granular histori granular valu instant tempor restrict interv expand illustr figur yield durat result histori associ instant restrict interv provid interv includ tempor domain oper expand map instant observ unit interv finer unit unit unit oe approx expand unit durat unit unit unit posit neg express move window averag sale period histori daili sale figur tempor group reason success valu histori tempo algebra yield start instant satisfi predic empti histori instant exist restrict instant instant satisfi instant exist histori predic similar remark appli give specif defin similarli vi vi vi vi boolean queri success time intens deal sequenc structur histori tempo offer languag describ histori base sequenc structur similar languag main origin tempo respect li regular express oper tempo pattern definit languag integr classic logic time regular express build atom formula combin complex boolean condit express properti structur histori reason success time languag express ffl sequenc pattern product factori item product immedi greater ffl repetit reason repetit pattern product product retriev factori item product subsequ ffl durat constrain pattern item product null dai syntax pattern match languag integ rule rel prioriti pattern durat equal semant formal introduc boolean oper check histori occurr pattern basic add type oql time construct construct counterpart oper defin time histor model notic term construct design oper queri distinguish abstract oper histori introduc defin independ oql work illustr class product properti trademark type string properti price product valu histori observ granular structur valu type real integ extent class product rest give formal main construct illustr express power set queri exampl organ put forward tempor reason paradigm address construct granular durat success continu chang classif queri special identifi oper involv context formal tempor construct describ construct handl histori give figur type syntax notat similar complet formal oql queri formal construct made describ subtyp constraint type type constraint variabl free type precondit make refer subtyp histori subtyp defin model achiev construct applic subtyp histori instant notat termin symbol typeset boldfac type rule construct notat implic notat mean queri type mean queri type assum variabl type term express involv oper tempo histor model semant queri valuat function determin valu free symbol queri denot valuat equal assign symbol precondit appli oper defin semant construct relat observ unit argument appli construct restrict relat elementari oper histori extract portion base condit express construct figur illustr restrict tempor domain retriev trademark histori product queri select struct symbol introduc instant notic instant granular year automat expand interv subtyp subtyp subtyp instant subtyp subtyp instant expand unit unit oe unit histori restrict tempor valu subtyp variabl free boolean ffl histori restrict structur subtyp valid label structur type join join join merg histori subtyp mod map ffl gener arithmet oper integ histor argument subtyp mod integ map ffl gener arithmet oper histor integ argument figur semant construct restrict structur domain retriev trademark histori price greater queri select struct restrict oper express tempor reason paradigm oper shown paragraph reason tempor join construct join correspond outer tempor join histori syntax similar struct construct plain oql figur formal definit join construct construct defin similar recal structur valu histori result outer join refer null valu structur valu argument histori liter type integ structur valu result type detail type construct build pair synchron valu express join construct express product product greater product tempor join product trademark produc larger quantiti product trademark queri element select join retriev tempor domain histori account product consid greater element oj nil nil reason gener oql construct oql counterpart construct histori seamlessli gener semant oper defin eral principl oper oper defin queri retriev histori arithmet oper queri retriev histori obtain appli oper synchron valu figur hold comparison boolean oper gener express queri element select case binari gener principl appli argument histori figur illustr queri gener oql construct retriev price histori assum price price attribut includ queri select struct oql oper structur type extend deal histori queri yield histori structur valu object attribut queri ha yield histori tempor domain obtain project structur attribut gener principl appli collect type oql collect express gener appli histori collect queri retriev histori express sum instant tempor domain amount student time ongo effort aim appli gener principl select construct collect granular chang constant durat constraint tempor group process divid content histori base criteria section tempo elementari kind tempor oper singl construct figur notic choic oper semant depend type queri group notic principl dataflow program languag tempor relat queri languag keyword partit map refer gener group group involv transform histori granular coarser queri oper transform histori granular histori granular month aggreg group month product retriev number dai product greater month queri select struct map partit histori granular dai retriev cardin histori express durat prod prod group partit classic involv calcul queri express condit hold fix durat bottl constant price period month aggreg group period total product product greater retriev averag product period queri select struct retriev histori granular averag product period start dai provid total product period map prod group reason success time construct straightforward adapt oper histori syntax similar construct construct reason success time histori product restrict instant instant condit hold subtyp variabl free variabl partit free subtyp unit durat map group boolean boolean map group map group map ffl ffl ffl subtyp unit map ffl ffl ffl subtyp durat figur semant success split histori retriev trademark product histori time product smaller queri select struct prod prod construct construct express queri involv complex sequenc event complex queri express rapidli complex involv sequenc express durat constraint involv construct construct discuss lead complic queri express approach tackl complex emb languag section match boolean oper queri involv select histori base sequenc event relat durat express eleg effici evalu discuss success client order dai order order variabl referenc select ord match ord ord ord reason continu chang histori split oper suitabl express express continu chang express queri time price longest interv time price remain point manipul histori collect valu cast histori collect valu discuss section reason give trademark longest time interv product greater queri select struct prod prod max prod prod implement architectur tempo implement top dbm implement consist librari class adt hierarchi defin time histor preprocessor implement tempor metadata manag account commun preprocessor ongo effort aim design implement api modul compat interfac defin odmg figur illustr prototyp architectur tempor metadata manag pattern match histori tempor type time unit format administr tempor librari visual end user extern program figur prototyp architectur librari tempor class implement proprietari program languag preprocessor metadata manag primarili implement code gener tool lex yacc visual modul referenc architectur part appli visual paradigm interact analysi data result tempor queri modul metadata relat tempor class properti modul referenc architectur implement oper section discuss implement modul section tempo prototyp implement concret applic implement applic deal manag annot time seri econom applic analysi behavior peopl time ski resort implement issu relat lack parametr class odmg major problem face design implement tempo relat lack parametr class model true odmg object model histori datatyp natur map parametr class solut gener class kind histori involv applic histori histori realist rapidli lead high class tempor satisfactorili implement structur type result histori depend argument histori section decid partial simul parametr class exploit preprocessor includ architectur singl class histori structur valu type object top odmg class implement schema attribut declar type histori exact type specif store tempor metadata manag metadata manag access exact type histori involv queri preprocessor add explicit translat queri structur histori involv user manipul histori parametr type solut drawback ad explicit translat queri introduc burden queri oql interpret perform dynam type check object solut account object histori tempor access queri program languag bind current tempo type histori code applic program explicit dynam type illustr necess extend current odmg object model parametr discuss evalu oper describ algorithm implement evalu boolean oper match section algorithm proce step involv pattern map regular express boolean variabl correspond tabl boolean variabl atom formula pattern built result regular express translat automaton input boolean stream perform chose techniqu develop materi tool call techniqu chosen classic techniqu main ffl techniqu assum alphabet regular express boolean variabl input gener automata vector boolean stream match classic techniqu assum alphabet regular express set input gener automaton singl stream token ffl size gener automaton linear size involv regular express time complex gener algorithm linear exponenti space time complex classic determinist automata gener avoid ffl techniqu extend effici deal exponenti oper featur fundament implement repetit oper languag section automata built execut success provid boolean valu instant involv atom formula pattern evalu atom structur valu histori access process termin automaton output histori complet scan notic evalu atom formula success histori remark lead straightforward import special involv histori vari price account evalu step algorithm tempor pattern distinct atom structur involv atom formula evalu complex step linear size complex algorithm true negat conjunct involv pattern futur work present queri languag tempo tempor model model unifi concept facil recogn tempor extend exist integr tempor extens odmg standard queri extens odmg object queri languag offer facil unifi classic tempor queri join oper reason success time respect relat main origin ffl histori primarili manipul construct semant tight queri histori express appli iter collect valu repres ffl integr featur boolean algebra histori group oper oper present exist tempor queri languag defin algebra context algebra natur oper easili oper algebra ffl appli gener principl design dataflow program languag extend semant standard oql construct deal histori fulli formal syntact semant level implement preprocessor implement test suitabl extens regard concret applic requir plan extend work ffl queri studi integr tempor evalu special tempor access method tempo architectur ffl user develop appli visual paradigm tool interact analysi manipul data result tempor queri ffl express famili queri express particip initi design implement tempo refer odmg make proc int confer program langag applic ga octob cs jensen versu tempor data model proc int confer data page extend odmg object model time european confer program juli editor object odmg morgan cheng gadia pattern match languag proc intern confer inform knowledg manag md novemb chomicki tempor queri survei proc intern confer tempor declar languag program synchron system proc acm symposium principl program scholl handl tempor group queri tempor object model proc cikm intern md novemb scholl tempor model seamlessli extend odmg research report grenobl march page sm editor tempor research practic springer lnc lorentzo foundat repres queri move object technic report da hagen gadia tempor parametr data tansel al ozsu tempor extens uniform behavior object model proc intern confer approach lnc springer tau tempor object model technic report manchest editor raymond recogn regular express mean dataflow network proc intern colloquium germani lnc springer juli rose segev tempor queri languag springer proc intern confer approach lnc riedel mh scholl formal odmg queri proc int confer data semant octob chapman hall rt steiner transit tempor support etzion al model pour mar de steiner mc norri implement tempor system proc intern confer advanc april snodgrass tempor critic comparison modern system object chapter addison editor tempor queri languag kluwer academ editor tempor publish toman tempor extens sql effici implement etzion al esprit project specif nation technic decemb dayal uniform model tempor version tansel al subrahmanian tempor modul approach feder tempor inform
DB/1257 3 approach index move object trajectori dieter pfoser christian jensen yanni theodoridi dept comput scienc aalborg denmark abstract dept comput scienc aalborg denmark domain spatiotempor applic treasur type data queri work area guid relat research spatial tempor attent true natur spatiotempor phenomena focu spatiotempor trajectori move point object present type spatiotempor algorithm process introduc access method kind tree base access method consid trajectori ident index hybrid preserv trajectori typic rang search data present perform studi compar indic fair vari set spatiotempor provid guidelin success choic introduct space time properti inher object real world model al effici wai queri kind data provid research effort field spatial tempor index respect data serv basi effort spatiotempor data research partial support chorochrono fund european commiss dg contract author support corpor permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow intern confer larg comput technolog institut greec world obtain satisfi solut spatiotempor problem context problem index queri spatiotempor inform work focu data stem movement spatial point object point size shape object posit matter exampl includ navig develop mobil comput data obtain move point object similar arbitrari orient dimens correspond space dimens correspond time sampl movement point obtain repres trajectori move point object pure geometr object movement term trajectori figur interchang design access awar natur type method typic queri spatial tempor rang queri queri spatiotempor data demand due extra semant involv trajectori treat spatial data spatial access method taxonomi work index present posit object futur queri al salteni al work index past posit object histor queri present work approach deal spatial data chang discret time continu account exampl includ multimedia data al overlap al variat spatial data al problem address access method preserv trajectori relat figur movement spatial object trajectori work treat data set line belong trajectori line segment group spatial properti proxim type queri requir access part trajectori present spatiotempor data consid respect data grow tempor dimens al captur spatiotempor data access method call organ line segment spatial attempt group segment trajectori belong term properti trajectori preserv tree call aim trajectori preserv leav spatial properti outlin paper section describ natur data type queri encount applic move point object section present algorithm access method section present algorithm section perform studi compar method appropri modifi gain knowledg entri index line segment section direct futur research move data queri discuss spatiotempor data give motiv introduc sampl method measur posit time introduc set queri import applic context sequel object move extend space movement straightforward trajectori optim highli popul challeng task support inform system core applic context fleet manag vehicl equip gp devic transmit posit central comput radio commun link mobil phone central data process util order record movement posit continu basi gp telecommun technolog sampl object obtain posit discret instanc approach repres movement object simpli store posit sampl answer queri object movement time sampl posit obtain entir interpol simplest approach linear method polynomi spline al sampl posit endpoint line segment movement object repres entir polylin space solid line figur repres movement point object space time coordin combin form singl coordin system dash line show project movement plane jensen figur illustr spatiotempor workspac cube solid trajectori solid time move upward top cube time recent posit sampl line top symbol growth cube time figur trajectori move point object spatiotempor workspac tempor dimens spatial dimens classic spatial posit inform deriv travel inform deriv combin spatial tempor data store number spatial object line entri part larger trajectori differ creat interest inher spatiotempor type queri queri typic search set trajectori includ select respect search inherit spatial tempor queri form object area time time interv time object respect point time al remain import queri type import tempor spatiotempor determin posit move object time point past al present section queri constitut special case rang queri queri window extent tempor dimens queri import due specif natur spatiotempor data queri classifi involv inform movement involv deriv speed head distinguish type spatiotempor queri result involv topolog trajectori deriv speed head object type queri involv perform studi section sequel discuss detail topolog queri topolog queri involv part trajectori object deem definit establish set model spatial data relat interv tempor data spatiotempor data erwig schneider discuss extend sql spatiotempor version basic spatial defin model composit predic base basic enter bypass figur topolog combin queri object bypass area determin examin segment trajectori object enter area respect time start point recent segment endpoint recent area refer point time stamp older time similar definit hold bypass illustr figur dynam inform navig queri dynam inform explicitli deriv trajectori inform averag top speed object determin fraction travel distanc time head object comput determin vector posit area object cover comput convex hull trajectori evid properti depend time interv consid head object ten minut strictli true speed object averag queri involv speed head expect import applic discuss speed plane top al consid instanc time aggreg longer time period comput examin set line segment belong lie spatiotempor rang tabl summar spatiotempor queri type adopt notat present al column list oper queri type column present involv queri insid oper determin segment rang notat simpli refer captur set constitut trajectori queri type oper signatur queri trajectori queri topolog queri navig queri bypass travel cover area park rang rang int real bool tabl type spatiotempor queri combin queri import issu deal spatiotempor queri extract inform relat select trajectori select part trajectori return select trajectori occur queri trajectori select segment trajectori spatiotempor topolog deriv inform previou left ident taxi select spatiotempor taxi corner avenu central park south show complic combin trajectori object left tucson queri identifi trajectori rang delimit part trajectori retriev figur illustr principl dot cube repres spatiotempor rang select polylin stand select trajectori move object bold part polylin repres part trajectori return construct queri combin plausibl spatiotempor applic context access method type data section defin access method type data queri give short overview tree index record leaf node pointer actual data object leaf node entri form id identifi point actual object bound interv node entri form ptr pointer child node cover interv node tree correspond disk page node entri insert entri singl path root leaf level path chosen respect enlarg criterion algorithm guttman cover adjust case insert split entri reassign node newli creat altern guttman delet entri insert procedur cover adjust case delet node occup fall node delet entri search check node entri overlap search window rang visit child node tree overlap level index entri overlap search window context spatiotempor data techniqu prove ineffici figur show approxim line segment introduc larg amount evid cover larg portion actual space occupi trajectori small lead high overlap small discrimin capabl index structur figur approxim trajectori map line segment aspect captur knowledg specif trajectori line segment belong ineffici provid fair perform comparison section modifi figur line segment wai extra inform store leaf level simpli modifi entri format domain assum number trajectori leaf node entri form figur insert algorithm invok node insert parent node invok point exclud current branch invok algorithm entri intersect invok point entri connect return figur insert algorithm suggest simpl implement improv effici index line segment part trajectori move argu queri process problemat approach index extens discuss support effici queri process trajectori move point access method differ strategi insert algorithm insert process procedur insert strategi base enlarg criterion insert consid spatial partial trajectori line segment belong trajectori insert line goal insert close predecessor trajectori insert involv return node predecessor room segment insert appli node split strategi figur show sampl index node return mark arrow ideal characterist index suitabl object trajectori space domin dimens simultan preserv trajectori describ insert algorithm shown figur includ addit call preserv number level preserv trajectori leaf node return algorithm check parent node full figur check node drawn bold level case leaf node split case parent node insert invok includ node current insert path grai shade tree figur algorithm ident origin algorithm extend version paper al establish choic preserv paramet smaller trajectori preserv spatial discrimin capabl index true larger split algorithm goal preserv trajectori split leaf node requir analysi kind segment node segment leaf node belong trajectori belong common endpoint node type disconnect segment connect segment connect top recent segment connect bottom endpoint segment belong endpoint segment connect endpoint segment belong trajectori distinguish split scenario figur case segment algorithm invok determin split case figur split scenario algorithm node invok invok algorithm put entri node algorithm entri node disconnect invok node type put disconnect segment node node singl disconnect put newest singl connect segment node figur split algorithm segment disconnect segment newli creat node case disconnect segment recent respect segment newli creat node figur summar split algorithm gener idea put newer recent segment node segment insert node higher older node potenti relax constraint minimum node capac split node split node creat node entri insert split obtain index preserv trajectori consid time domin dimens occupi space fundament present access method introduc strategi achiev trajectori space discrimin capabl index base access method radic step underli assumpt insert geometri independ context translat figur insert algorithm invok node insert segment creat leaf node segment creat leaf node segment figur insert algorithm line segment independ line segment part trajectori knowledg implicitli maintain structur aim access method strictli preserv trajectori leaf node segment belong index understood trajectori bundl approach make concess import node overlap spatial discrimin line segment independ trajectori lie spatial close store node overlap space discrimin classic rang queri cost give space gain trajectori preserv properti import answer queri insert algorithm goal trajectori move object piec line leaf node segment trajectori figur illustr insert procedur import stage procedur mark circl number insert algorithm formal shown figur insert simpli find leaf node predecessor trajectori start tree root step child node overlap line segment leaf node store entri format leaf level segment trajectori store leaf assign node entri format leaf node entri store header leaf node segment connect entri figur find segment summar ident case leaf node split strategi split leaf node violat principl total trajectori preserv creat leaf node step tree find parent node path insert node room parent node insert leaf node shown figur case split creat node level leaf node descend split propag upward grow left leaf node insert trajectori preserv point argu strategi lead index high overlap case arbitrari data index spatial respect space discrimin tempor dimens offer space data insert fashion al structur set leaf partial organ tree hierarchi trajectori distribut set disconnect leaf node discuss queri retriev segment base trajectori identifi simpl solut implement connect leaf node data structur doubli link list connect leaf node includ part trajectori preserv trajectori evolut figur part structur trajectori illustr approach trajectori drawn band line trajectori symbol grai band fragment leaf node connect link list visit arbitrari leaf link retriev trajectori minim fanout leaf size partial trajectori leaf node segment store assum definit segment find remain segment follow pointer link list previou leaf node queri process section type queri occur spatiotempor applic present figur structur algorithm process queri access method queri algorithm classifi combin section process queri straightforward extens classic rang queri process idea descend tree respect coordin constraint entri found leaf node queri topolog navig queri due space omit present topolog queri process discuss perform refer pfoser al algorithm combin queri combin retriev entri retriev entri belong trajectori separ algorithm method data structur link list retriev partial trajectori combin search step process combin queri retriev initi set segment base spatiotempor rang appli algorithm idea descend tree respect intersect properti entri found leaf node figur search tree cube retriev segment trajectori segment trajectori segment shown darker grai cube complet stage combin search extract partial trajectori found segment find connect leaf leaf node segment trajectori find connect top endpoint connect bottom endpoint find segment leaf search leaf node search leaf node conduct rang endpoint segment question predic arriv leaf algorithm check segment connect segment question retriev segment trajectori algorithm continu newli found segment cube segment return segment segment figur outlin combin search algorithm problem retriev trajectori initi rang search retriev trajectori segment start retriev trajectori avoid store retriev check queri trajectori retriev segment retriev partial trajectori store omit retriev segment combin search tb combin search algorithm similar present differ li partial trajectori retriev structur provid retriev connect offer modifi rang search algorithm link list retriev connect segment search stage combin search seed segment segment retriev partial trajectori outer rang connect segment leaf node node find trivial figur stage combin search follow pointer leaf node section approach retriev partial trajectori care retriev trajectori section partial trajectori store retriev check retriev figur updat combin search algorithm present figur perform comparison aim compar access method establish optim delimit situat access method compar access method vari set data queri perform studi conduct implement access method paramet chosen page size leaf node byte page fanout leaf leaf node structur fanout leaf dataset unlik spatial exist popular real dataset line file geograph boundari cover entir unit wellknown wide accept spatiotempor dataset miss due lack real perform studi consist experi synthet dataset util gener spatiotempor dataset al creat trajectori move object distribut user gener set line segment stem number move object algorithm entri intersect invok point entri satisfi trajectori invok algorithm loop find segment connect found add set loop find segment connect found invok repeat connect algorithm entri intersect invok point entri direct connect return figur algorithm queri algorithm set node point direct pointer figur algorithm updat probabl function describ movement object combin paramet user initi posit distribut object unit workspac step time space movement skew probabl function paramet gener initi distribut point point distribut center workspac movement point rule random distribut form achiev spread point workspac number snapshot tempor held constant number move object vari result dataset consist entri line space util index size aspect neglect compar access method size creat index structur tabl list size indic space util averag space util approach case reason construct strategi growth data tempor dimens account roughli big indic dataset object consist line size indic size mb differ due smaller space util smaller indic similar space fanout larger ten time larger index size factor approxim case space util fluctuat index size kb object kb object kb object space util tabl index size space util rang queri rang queri import spatial data spatiotempor data compar access method process rang queri dataset stem move object set queri window rang total rang respect total space queri set includ queri window figur show number total node access rang queri dataset note ax logarithm base base observ trend small number move show superior rang queri perform point trend depend queri size case rang point respect move move object figur rang size point move object move object figur case larger point move object figur trajectori orient smaller number trajectori total dataset orient time respect space term properti tempor dataset grow respect tempor dimens spatial discrimin capabl index import number trajectori segment exist point time spatial discrimin import overlap node natur discrimin data sole group object spatial spatial proxim small number ambit turn spatial discrimin minor import put connect segment node spatial discrimin exploit tempor discrimin data result approach number segment adopt approach extrem index perform small number heavili dedic trajectori preserv explain perform respect small number trajectori time slice queri applic determin posit move object time point past al queri type constitut special case rang queri queri window extent tempor dimens size queri window spatial dimens arbitrari perform studi respect rang spatial dimens correspond individu queri result shown figur similar previou section set queri exist point term number move point object number node access smaller breakeven point move move object move object trend observ case rang queri outperform figur observ gap indic rang outperform natur time slice queri retriev posit move object instanc time queri favor index organ content base spatial aspect reli tempor discrimin capabl data smaller rang phenomenon appar larger rang combin queri perform studi relat algorithm combin search present section dataset stem vari number move object size outer rang dimens total set queri consist individu queri result figur show case superior order magnitud gap proport number object trajectori preserv addit data structur link retriev neighbor node contribut result number node access case slightli larger number rang queri experi figur compar differ index structur combin search algorithm observ point method rang exist shown figur point move object involv larger secondari point move object summari support queri effici worth mention perform typic rang queri competit shown combin perform close connect move dataset rel gap rtree number move object design combin benefit perform except time slice queri futur work work spatiotempor queri process dealt rang queri spatiotempor context trajectori move spatial data due peculiar tempor dimens al paper present set pure spatiotempor call combin queri node access node access tree str tree tb tree move object tree str tree tb tree effici process queri requir indic access method spatiotempor simpl modif access index trajectori move point object trajectori data set queri defin deriv requir trajectori data obtain discret sampl movement point object time linear interpol consid sampl set queri present paper discuss determin shortcom method respect spatiotempor data node access tree str tree tb tree move object node access tree str tree tb tree move object figur rang vari dimens move object node access tree str tree tb tree move object node access tree str tree tb tree move object figur time slice vari spatial dimens node access tree str tree tb tree move object node access tree str tree tb tree move object figur combin outer rang outer dimens introduc modif overcom limit tailor requir trajectori data spatiotempor easili implement top adopt commerci extens system perform studi present result experi involv spatial rang experi relat navig combin queri prove access method suit good spatial search perform perform stai design combin weak concept superior respect domain recent literatur includ relat work index trajectori move object maintain complet histori object movement al al nascimento al work present paper access method address requir peculiar context trajectori implement specif modif order overcom ineffici respect present algorithm spatiotempor search typic rang queri work point futur research direct present work present algorithm process navig topolog queri deriv requir real spatiotempor fleet algorithm refin detail previou spatial queri deserv attent spatiotempor exampl includ neighbor search al join papadia investig geometr shape approxim move trajectori deserv extend relat work index line segment al refer maintain knowledg tempor interv commun pp mobil comput survei ieee transact knowledg data pp introduct spline comput graphic geometr model morgan kaufmann optim index segment proc confer extend pp topolog spatial relat journal geograph inform pp develop tempor queri proc dexa workshop data model foundat repres queri move object acm transact dynam index structur spatial search proc confer manag pp index mobil object proc acm symposium principl pp integr spatial join algorithm process multipl input proc confer manag pp evalu access structur discret move point proc workshop pp topolog relat world minimum bound studi proc sigmod confer manag pp captur uncertainti proc symposium spatial pp approach queri process move object chorochrono technic nearest neighbor queri proc confer manag pp index posit continu move object proc confer manag pp model time conceptu perspect proc confer inform knowledg pp specif effici index spatiotempor proc confer scientif statist pp gener spatiotempor dataset proc symposium spatial tempor index larg multimedia applic proc ieee confer multimedia comput pp conceptu data model spatiotempor pp overlap linear access method proc symposium advanc geograph inform pp
IR/1258 5 multimedia middlewar mobil onlin auction matthia werner report institut für informatik copyright matthia werner institut für informatik universität germani reserv multimedia middlewar mobil onlin auction matthia werner chair inform system institut comput reserv abstract internet servic todai provid user quick conveni access varieti commerci applic due unsuit architectur poor perform user accept low major success mobil servic provid content advanc web servic innov enabl technolog xml wireless commun time provid facil interact onlin applic anytim present prototyp implement effici multimedia middlewar approach ubiquit servic auction sampl applic advanc retriev technolog combin enhanc content deliveri show impact modern inform system applic mobil onlin middlewar internet multimedia applic introduct emerg standard technolog mobil web servic creat internet ubiqu user carri data user profil facil interact onlin applic anytim expect overcom internet problem provid user quick conveni pai find place product industri struggl advantag internet wireless simpl mobil applic short messag system cellular phone consid recent mobil servic base wireless applic protocol european telecommun carrier shown mobil commerc applic lack consum accept poor design inform architectur hamper usabl wap site lack special adapt multimedia content accept consum major success mobil servic target user content advanc web servic gener servic internet search engin succe mobil environ major improv happen mobil wap cellular phone internet enabl handheld support broad success applic public exist wap servic design applic feel success futur li approach mean exist web servic success expand support access number mobil client paper show smooth standard internet servic applic onlin auction web servic enabl ubiquit access develop inform system architectur applic main idea inform system provid interfac incompat data scatter varieti repositori system provid logic view common queri capabl platform inform sourc inform sourc gener limit relat imag archiv document sophist system extern web data directli integr queri result set gener ideal goal retriev assembl freeli access exchang system system provid suitabl connector advanc feder search deliveri user tailor inform mobil modern system experi major problem approach advanc feder search content deliveri recent present literatur paper show techniqu enrich multimedia middlewar prototyp applic rest paper organ section deal demand onlin auction present user interact modern auction applic user profil usag pattern recogn basi applic comparison exist onlin auction ebai present system auction search auction catalog fuzzi retriev method addit standard search criteria sampl auction applic enabl access middlewar approach explain section section deal natur feder retriev capabl benefit applic present applic algorithm leverag effici search capabl multimedia resourc deliveri result set gener content wide varieti possibl mobil client final discuss section conclud short summari outlook futur work rank imag descript current bid mobil onlin auction paint beauti modern oil canva paint pablo entitl creat year present occupi fabric paint titl paint painter georg uniqu style support paper past paper figur sampl result set complex queri onlin auction ebai offer wide varieti categori item present short descript digit photo search capabl auction applic focu standard attribut item keyword price rang sophist search capabl weight search visual retriev support claim accept applic develop effect multimedia search facil user complex queri intuit custom queri satisfi retriev result gener anticip typic usag pattern user profil broad accept queri profil short onlin auction assum custom frank interest bui modern paint furnish onlin auction state categori descript paint paint art carpet furnitur brown color preval auction queri engin aspect satisfi aspect rank result comput suitabl data sourc end object match aspect calcul return user shown figur typic user interact auction system provid queri inform search user profil present result auction system analyz queri constraint decid sourc queri merg rank result set object return profil deal piec art auction typic group custom understand architectur deal typic profil user frank frank user furnish modern paint paint brown color collector strongli interest copi paint oil canva techniqu fit collect prefer brown matter concern queri deepli section assembl queri profil tabl figur queri profil frank categori paint paint painter care techniqu care oil canva style modern care averag color brown brown usag profil mobil access figur queri profil user wireless technolog improv mobil devic situat user creat focu main type person digit person digit assist standard handheld comput pda user connect text inform imag wap wireless applic protocol design creat ubiquit access internet resourc mobil user perform simpl task deliveri result set technic environ user account hand user home offic connect lan high speed hand user wap mobil phone slow connect ride train user access process larg compound document user slow access prefer version document satisfi abstract document compound document adequ stage auction task mode tabl figur show typic usag pattern devic perform task task differ frequenc locat user advanc technic devic import thing enabl user perform frequent task prefer small mobil devic task integr daili routin maximum freedom queri usag pattern technic restrict user profil model usag pattern user devic frequenc locat item pc rare home find similar item pc pda rare bid pc pda wap figur usag pattern devic paint auction catalog prefer high resolut color imag descript text typic task catalog web browser pc fast internet access decid bid object follow auction bid onlin auction dai check current bid time time task descript visual inform catalog titl painter frequent task conveni carri mobil phone data exchang advanc mobil devic pda capabl perform slightli complex task instanc bid chosen object user search object similar chosen sampl user access internet standard web browser addit wap frank pda mobil access multimedia middlewar due rapid pace technolog emerg standard constant evolut mobil flexibl adapt technolog methodolog essenti applic content manag paramount mean applic content deliveri format strictli separ section illustr support virtu content manag xml base technolog address requir commerci web applic enabl web technolog world wide web consortium develop extens markup languag aim middlewar approach prototyp implement build xml tool extens xml markup xml subset sgml gener markup basic markup languag document structur inform xml standard markup languag internet applic xsl stylesheet xsl xslt power implement transform languag convert instanc specif xml document type basic document simpl legaci html document format mobil wap server technolog integr apach web server build web applic base dynam xml content xml develop design rapidli develop easili maintain dynam web page leverag xml applic relat technolog comput dynam content includ page servlet java technolog connect underli applic modul java program languag applic logic resid middlewar search combin search result code java execut java virtual machin apach web server servlet engin handl incom client search request initi content deliveri advanc multimedia middlewar architectur figur depict conceptu design system xml technolog mention plai explor short sampl auction wap phone pda queri engin content deliveri xml middlewar figur multimedia middlewar architectur carri wap phone track item auction catalog step initi search devic download search form applic server request applic server result prepar gener xml provid queri deliveri client search form pass deliveri engin client profil xsl render xml form wrt profil result client specif search form turn deliv devic search request issu client complet search form send back queri manag complex queri construct search form typic restrict result fulfil request explain section complex queri split atom part pass underli data sourc execut combin algorithm effici combin possibl rank result stream sourc middlewar search result encapsul gener xml document pass deliveri engin search form xml result set final transcod format satisfi client deliv devic part architectur present discuss depth section section deal comb algorithm feder section present techniqu multimedia deliveri feder search queri abil perform feder search queri demand inform system answer set gener consist compound document involv data type collect sourc search tradit search fuzzi search capabl includ phonet search thesauri queri reli syntact document length imag specif imag format advanc retriev reli semant semant document retriev queri visual techniqu queri shown state art inform system adapt techniqu auction system understand feder search queri perform user frank pose complex queri involv aspect categori object object style color brown queri model essenti categori evalu exact match queri keyword return rank result set descript queri color perform visual retriev return rank set document brown imag emerg standard queri express select repositori categori rank descript si averag similar sampl queri statement top imag retriev belong categori descript word averag color close shade brown express weight part queri consid equal weight commerci system support full auction system prototyp statement map specif implement underli manag system queri result case consist exact match part rank result list keyword rank result list visual retriev part effici combin result set object major perform bottleneck recent effici combin algorithm recent develop improv effici order magnitud prototyp auction system algorithm merg result list middlewar distribut data sourc correct retriev result score aggreg monoton combin function includ weight queri due heurist control flow algorithm narrowli score distribut result comput output increment result merg strongli user depend complex queri user weight special combin function function instanc arithmet mean ensur consist perform object queri part find top perform queri aspect queri aspect user prefer emphasi topic prefer combin function add semant inform relev search result auction system user profil gener combin function express search semant short glanc sampl combin function frank score auction item consist imag categori descript instanc comput score score score descript score si averag similar score frank score descript score si averag similar collector paint assign high weight categori keyword low valu prefer brown color evalu categori hard filter condit provid system frank hand furnish color paint high import assign equal weight categori case weaken filter effect categori cover instanc satisfi brown tapestri unlik tradit multimedia middlewar easili adapt requir approach relat applic middlewar approach garlic start capabl advanc retriev rank result set distribut data sourc merg retriev combin place insid middlewar queri paint oil canva techniqu keyword result set combin engin pass middlewar singl rank result set special combin task retriev engin algorithm prime candid show characterist effici insid retriev engin kernel content deliveri content manag applic address natur content capabl client platform content deliv user prefer technic limit user devic express user profil usag pattern demand deliveri format electron inform store transmit applicationspecif format xml data structur present layout account system benefit xml xslt illustr run section frank pose similar queri auction initi search standard web browser home left hand side figur depict search form enhanc multimedia input facil search criteria complet initi queri assum frank item auction catalog place bid dai auction check select item mobil phone bid hand side figur gener xml format xsl stylesheet tailor compound document support deliveri platform figur search request web browser track bid wap phone section track auction item enabl exist usag pattern decid check select item wap phone request download gener xml document displai left hand side figur page titl gener xml document defin search form input field defin select exist categori defin text input field submit auction xml document basic enabl platform request issu wap phone applic server transform gener search form gener xml wml prior deliveri hand figur figur gener xml form wml search form xsl stylesheet deliveri scheme xml document virtual base user profil client request server associ specif stylesheet xml document format instruct output deliveri document usag pattern figur stylesheet creation wml restrict html full resid track transform xml content partial illustr figur figur transform gener xml form wml search form transform rule express stylesheet templat rule attribut rule match xml structur defin tag found xml sourc rule fire result execut format instruct bodi xsl instruct process select field gener xml form displai note contrast html concept form defin current wml standard figur demonstr incorpor concept wml deliveri format continu bid eventu accept noon collect frank stop place bid piec art furnish palmpilot pda queri auction catalog similar item auction system properti primarili select item pose queri deliv result pda prior deliveri gener xml search result transform time stylesheet creation restrict html content satisfi limit resourc pda similar item result set pablo hand side figur show displai pda immedi place bid item auction home web browser figur hour owner nice paint figur search result web browser palmpilot summari outlook paper present prototyp virtual auction ubiquit access benefit modern inform system technolog implement evalu ibm manag system underli data sourc relat extend technolog support fuzzi retriev catalog queri due open design applic manag system gener data mediat support rank queri model easili adapt complex internet applic collect data varieti sourc possibl retriev engin illustr work retriev aggreg strongli depend user profil usag pattern effici techniqu enabl effici feder search wrt specif queri profil build effici middlewar applic mobil commerc xml technolog sophist algorithm merg rank result list content deliveri run prototyp present forthcom intern comput fair hannov aggreg content uniqu access standard web browser highperform network infrastructur progress rate mobil devic exist web applic lack ad enabl servic multipl devic content manag deliveri tune feder search leverag futur applic advanc multimedia middlewar architectur present paper effici support techniqu common internet environ multimedia deliveri format variat html binari format storag multimedia data auction catalog account deliveri format independ interrel option audio video format true multimedia content result larg varieti wai store deliv multimedia data format benefit techniqu partit deliveri data format physic store fast deliveri convert specif deliveri format shown futur work focu standard queri capabl access relat multimedia extens queri languag recent xml applic offer standard capabl incorpor speech recognit synthesi enrich multimedia middlewar present paper advanc technolog improv accept applic refer virtual feder inform share proc int conf expert system applic lnc vol page springer applic rank queri model proc delo workshop inform search queri digit delo wimmer heterogen multimedia inform garlic approach int workshop research issu data distribut object page gile user profil data deliveri proc int conf data san ieee comput societi world wide web consortium extens markup languag version februari editor inform technolog languag sql multimedia applic packag part imag equitz effici effect queri imag content journal intellig inform apach softwar foundat apach xml project optim queri imag proc int conf larg page effici queri heterogen environ proc ieee int conf inform code comput la april ieee jain multimedia inform manag proc int conf data page ieee comput societi michael kai xslt refer wagner project multimedia support histori human scienc annual conf page springer mell inform architectur final chang proc acm sigmod int conf manag page acm widom goldman practic approach combin queri web proc acm sigmod int conf manag page acm motorola wireless resourc li scalabl multimedia deliveri comput proc acm multimedia page acm press multimedia deliveri advanc internet servic proc int workshop multimedia intellig storag retriev manag effici flexibl web access imag collect proc acm symposium appli volum page wireless applic protocol forum offici wireless applic complet standard john wilei april
Agents/1259 1 categor softwar error led secur breach du coast laboratori depart comput scienc purdu coast laboratori softwar engin research center depart comput scienc purdu usa octob abstract set error led secur breach comput system analyz analysi led categor error examin scheme categor softwar error scheme develop scheme classifi error natur type made remov error error consid work found maintain coast laboratori categor step investig effect measur code coverag reveal softwar error lead secur breach introduct report outcom effort categor error softwar led secur breach set error studi error develop coast laboratori exist scheme categor softwar error evalu effort found fulli suitabl led develop scheme report categor secur error motiv desir evalu effect tradit coverag criteria reveal softwar error lead secur breach perceiv develop tool assist softwar develop tester assess test distribut softwar aim detect understand effect secur flaw plan categor report design conduct experi fulfil hope result portion work support contract rome laboratori sponsor coast laboratori portion work support contract rome laboratori sponsor coast nsf award experi lead inform satisfi tradit adequaci criteria concern includ control data mutat base criteria consid wong distribut system concern develop corba interfac standard distribut object java program languag remaind report organ section section briefli discuss current method detect secur flaw limit section critic examin exist scheme categor error softwar section present scheme report outcom categor effort section summar report discuss outcom categor design experi detect secur error report secur breach due error softwar increasingli common result secur relat concern softwar develop user product stage softwar develop effect desir make product secur vulner malici intent user work concern test softwar goal detect error lead secur breach refer error secur error secur flaw tradit method detect secur error includ penetr formal verif secur kernel penetr analysi reli secur flaw softwar system flaw gener team individu penetr system knowledg formal method mathemat descript secur requir system implement requir goal method formal show requir met system weak penetr analysi requir postul natur flaw exist system difficult task system oper system browser implement function system function lack experi render task difficult effect penetr analysi good team perform analysi lack object criterion measur penetr analysi lead uncertainti reliabl system penetr analysi reveal secur flaw attract due formal method suffer inher difficulti appli process check requir specif system specif view penetr analysi formal method adjunct test system secur flaw tradit method softwar test criteria evalu adequaci test softwar includ criteria base program control data cost util appli criteria differ wide assess appli detect secur error primari goal evalu effect adequaci criteria detect secur error investig question ffl number type secur error found test vari adequaci criteria ffl differ effect adequaci criteria evalu type softwar error secur error ffl qualiti amount penetr analysi improv adequaci criteria plan design experi achiev goal experi conduct inject secur error sampl program appli test techniqu determin techniqu reveal error experi thing thing collect secur provid resourc set size secur error thing categor secur error categor criteria decid error chosen inject sampl code peopl coast lab contribut collect secur error vulner establish ivan abund secur error conduct experi provid suitabl categor select secur error experi discuss conduct experi categor scheme classifi secur provid guidelin goal current focu categor investig secur error number store vulner conduct deep studi softwar error classif secur error final categor scheme experi error categor scheme baselin evalu reliabl system discuss categor scheme scheme investig secur vulner paper part unorgan data resourc part ad past work characterist error classif suggest taxonomi classif categori characterist categori mutual classif error categori categori exhaust categori includ possibl categori unambigu classif depend interpret multipl classifi properti lead repeat classif scheme mean repeat applic scheme set error result classif involv process research conduct classif secur error section discuss strength weak exist classif scheme secur error classif scheme taxonomi flaw found oper system object taxonomi provid understand record secur flaw occur base time locat genesi refer secur flaw find program time introduct point softwar life cycl error introduc locat part oper system hardwar error li scheme describ secur flaw accur scheme dimens genesi basi strategi secur flaw weak scheme categor genesi ambigu descript valid error includ error inadequ boundari condit error weak categori call exploit logic error classifi categori found error classifi categori possess distinguish featur categor differ time introduct categor error phase system life cycl introduc attribut error import understand weak softwar develop process find secur error introduc design wise mean improv design process valid result design categori directli work deal evalu test strategi appli code design reason decid categori locat error classifi error system introduc found dimens primarili relat secur flaw oper system research focu specif type softwar system categori found direct work scheme taxonomi object provid basi data organ vulner facilit queri perform store data consid classifi code error synchron condit valid attribut secur error improp evalu condit viewpoint narrow viewpoint error improp evalu condit state correct error chang condit program figur illustr point taxonomi deriv secur error found unix oper system exhaust weak algorithm encrypt password scheme bishop scheme matt bishop taxonomi softwar vulner vulner classifi ax ax natur time exploit domain effect minimum number compon exploit vulner sourc identif vulner object taxonomi describ vulner form detect mechan goal natur ax directli relev goal protect analysi project project flaw hypothesi methodolog classif scheme scheme share weak point discuss scheme classif softwar error addit classif scheme discuss scheme categor softwar error research categor scheme publish commun section review scheme discuss strength weak orthogon defect classif orthogon defect classif scheme object scheme provid fast effect feedback develop defect distribut measur develop process highlight part process attent defect type gener applic phase softwar develop process classif capabl reflect characterist defect distribut chang develop process studi implement test entir softwar develop overli complex provid suffici data determin exact natur error code scheme goal scheme give insight test reliabl classif scheme evalu reliabl test data select criterion data select criterion base program intern path branch statement test paper attempt show test base sole knowledg program intern structur lead reliabl test achiev classif reflect program intern control flow program problem scheme ambigu incorrect statement failur part programm test condit fault type miss control flow path type inappropri path select condit express incorrectli classif scheme narrow classifi secur error found secur error fit categori secur error race condit classifi scheme scheme scheme design goal evalu effect current softwar mainten techniqu kei featur scheme attempt identifi fault characterist distinct area valu chosen describ fault discuss accur categor easi avoid strong bia select secur error decid scheme attribut reflect kei featur relat secur error basili scheme basili goal analyz relationship frequenc distribut error softwar develop classif mention author analyst interpret categori differ scheme classif secur error characterist scheme primari goal research usabl practic scheme categor secur error scheme essenti understand control factor affect softwar secur categor reflect kei featur secur error scheme serv basi evalu effect softwar test techniqu reveal error lead secur breach multipl attribut approach similar approach classif place error singl categori close match featur error risk lose inform classifi error singl categori lead abstract risk throw featur error retain featur repres categori error classifi desir point view classif approach place error categori find test techniqu secur error reason high percentag secur error select experi attribut decid abstract implicitli includ categori classif categori result experi trustworthi categori select ignor categori abstract inform categor avoid bia decid assign error singl categori attempt identifi error characterist distinct area area valu chosen describ error area provid detail inform secur error singl categori scheme oper secur error due impact violat secur fix eventu sequenc shown figur oper sequenc expand section provid taxonomi classifi secur error impact fix figur life cycl secur error classif scheme categor genesi describ secur error detail focu inadvert intent part taxonomi modifi definit categori rid ambigu valid valid program interact environ item target error occur assumpt item conform realiti input valid ensur input expect includ type format input field forbid bad input enter softwar system origin valid ensur origin claim includ check ident origin target valid ensur inform place includ check ident target protect inform untrust target authent error permit protect oper invok suffici check author invok agent serial flaw permit asynchron behavior system compon exploit secur violat flaw fall categori includ flaw categori flaw occur object content chang unexpectedli invalid check appli boundari check error failur check boundari ensur constraint check excess valu tabl file resourc consumpt lead boundari check error buffer overflow result boundari check error domain error occur intend boundari protect environ hole inform leak implicitli weak incorrect design error occur error trace design phase weak encrypt algorithm fall categori exploit logic error fall categori direct impact execut code unauthor execut code target comput chang target resourc unauthor alter resourc target resourc includ process access target resourc unauthor access resourc target comput access includ alter resourc denial servic action degrad block comput network priorit categori sever execut code highest prioriti denial servic prioriti secur error kind categor highest impact fix fault classif scheme candid categor secur fault fix unambigu capabl autom importantli base origin sourc code code fit categor fix scheme classifi error categori spuriou fault correct requir remov characterist substr fall categori miss fault correct requir insert syntact entiti incorrect program fall categori miss entiti sequenc singl unari oper syntact entiti form miss entiti categori misplac correct fault requir chang posit classifi categori incorrect fault classifi miss misplac spuriou classifi categori scheme present figur sampl categor illustr categor give exampl problem descript show result classif exampl vulner maintain ivan coast laboratori execut code chang target resourc access target resourc denial servic spuriou entiti miss entiti misplac entiti incorrect entiti valid error authent error error domain error design error exploit logic error boundari check error impact fix figur scheme categor secur error problem secur hole script web server descript problem applic person web site electron leav messag version program vulner condit remot user execut arbitrari command server user id daemon condit server server side includ directori applic remot user write html tag comment field applic filter html tag descript figur kei foreach foreach kei foreach strip html sign replac bad word foreach origin code modifi code figur origin modifi code problem problem bind socket descript problem combin set socket option call process bind port previou process bound width user bind specif address server bound port steal udp tabl categor sampl secur error error id ix problem valid error execut code miss entiti problem domain error access target resourc miss entiti connect descript figur socket slot socket slot origin code modifi code figur origin modifi code problem tabl show fault categor result problem report summari futur work work report review exist scheme categor secur error gener softwar error base review scheme suit goal secur error classif scheme paper classif scheme distinct categor secur error criteria point view viewpoint reflect featur secur error provid basi futur work determin effect test techniqu reveal secur error plan inject secur error sampl program appli test techniqu determin techniqu reveal error data collect experi estim effect refer fundament comput secur technolog upper saddl taxonomi secur fault unix oper system master purdu august basili softwar error empir investig commun januari bishop taxonomi unix system network vulner technic report depart comput california grammar base fault classif scheme applic classif error tex technic report purdu al taxonomi comput program secur flaw acm comput septemb al orthogon defect classif concept measur ieee transact softwar novemb al secur analysi enhanc comput oper system technic report institut comput scienc nation bureau theori test data select ieee transact softwar june comput vulner analysi thesi technic report comput scienc purdu lind oper system penetr afip nation comput page pp design secur oper system nation comput collect categor softwar error data industri environ journal system page inconsist singl data time technic inform scienc southern decemb wong effect mutat data flow test softwar qualiti tabl categor secur error impact fix column mark fix suffici code categor error error id ix warm authent error chang target resourc boundari check error execut code miss term boundari check error execut code solari boundari check error execut code dn boundari check error execut code apach cooki boundari check error execut code miss solari ps error execut code incorrect socket domain error denial servic ni dn valid error execut code overflow boundari check error execut code vulner error execut code valid error execut code boundari check error execut code dip boundari check error execut code back tic valid access target resourc test cgi valid error access target resourc java acl path valid error access target resourc java ab path valid error execut code boundari check error execut code guess authent error chang target resourc netscap guess design error execut code incorrect telnet authent error execut code java dn valid access target resourc mime boundari check error execut code aix check error execut code dn bind boundari check error execut code auth authent error access target resourc tabl categor secur error fix error id ix winnt rpc vulner valid error denial servic ibm nl environ check error execut code shell escap valid error execut code inn valid error execut code buffer overflow boundari check error execut code authent error access target resourc incorrect buffer overflow boundari check error execut code incorrect authent error access target resourc winnt design error execut code remot nt password crack authent error access target resourc bind packet steal domain error access target resourc miss boundari check error denial servic sl guest valid error execut code miss nat lang buf overflow boundari check error execut code
HCI/1260 4 intern workshop digit comput video februari feedback video virtual realiti navig leonid center appli scienti comput california lawrenc livermor nation laboratori ca usa abstract import precondit wide accept virtual realiti system includ natur exist tracker su er issu tracker hand joystick helmet restrict spontan natur devic hand limit workspac liter bind oper ground control similar problem paper describ video regist depth inform commerci virtual realiti navig setup replac cumbersom tracker method includ select depth process robust segment handl illumin variat motiv approach virtual realiti human oper connect comput simul real imaginari environ enabl person perform real task environ exampl includ ight virtual product learn import part vr system posit track map track mean posit orient estim move map mean surfac measur depend track bodi part fundament success head ey track visual hand arm track haptic bodi surfac map track human bodi part vital context control object exist tracker su er issu mechan tracker accur tracker hand joystick helmet restrict spontan work perform depart energi california lawrenc livermor nation laboratori contract number intern workshop digit comput video februari natur devic hand limit workspac liter bind oper ground disadvantag limit number freedom measur multipl limb approach address track optic sensor posit track map address issu discuss approach emploi bodi marker easi structur light system give passiv light system proper system studi medicin present surgeon visual displai combin dynam chang view patient oper collect detail graphic data test scan surgeon view brain surgeri overlaid imag earlier cat scan ultrasound case exist tracker restrict surgeon hand sensit set tini camera softwar data analysi displai bene cial tradit control replac gestur convent control includ devic di er desktop extra button wheel control xy translat dimens rotat direct paper show track control hardwar replac optic analysi human gestur previou work includ optic data data tradit approach track typic reli segment intens motion data major method began segment human bodi background wren al achiev segment classifi pixel includ static world dynam user repres gaussian blob yang ahuja skin color geometri palm face region segment stage system yacoob black human movement cutler davi segment motion comput move object human motion review pavlov al address main compon direct gestur recognit research hci recognit applic bene includ depth data inform recov scene data feasibl speed cost recent avail faster rang data make feasibl addit sourc inform track al report intern workshop digit comput video februari cation rang virtual util comparison depth inform real synthet data addit ecient rang method deal major shortcom local variabl classi cation result di erent illumin condit ii algorithm result figur show optic addit control track element combin function point ecienc approach addit comfort issu discuss imag data system includ regist color depth imag algorithm involv step region classi cation color rang process move action comput select rang process import speed depth comput make depth analysi video feasibl sourc data vr system depth comput analysi region pixel classi ed skin spheric coordin transform separ color bright inform color normal insensit variat illumin pixel classi ed skin base statist shape skin region analyz separ similarli color area remain select rang process due select speed process pentium ectiv doubl frame environ posit vr world manipul oper interfac control tracker comput action map posit chang posit fig integr video process vr system intern workshop digit comput video februari fig typic color depth imag produc stereo vision system fig track region depth comput zoom gestur move experi involv applic algorithm color rang imag sequenc gestur color stereo vision system point grei captur sequenc modul connect pentium iii pc rang inform recov real time stereo algorithm typic color rang imag produc stereo vision system shown figur closer object lighter rang area hair wall indic correspond found stereo match process result appli rst step skin region select rectangular box figur figur show depth comput chosen region move hand select depth estim faster process speci comput coordin hand posit transfer vr system transfer real figur show applic comput hand motion virtual hand hand smaller move circl arrow repres direct motion xy plane intern workshop digit comput video februari fig appli comput hand motion virtual hand iii summari futur work main goal vr system user environ strong presenc interact import precondit wide accept vr system includ natur exist tracker su er issu tracker hand joystick helmet restrict spontan natur devic hand limit workspac liter bind oper ground control similar problem paper video regist depth inform commerci vr navig setup replac cumbersom tracker method includ select depth process robust segment handl illumin variat approach successfulli test basic hand gestur appli larger set gestur control virtual environ acknowledg work part scalabl visual project member visual group center appli scienti comput support min shin vision lab assist face tracker refer editor virtual scienti technolog challeng nation academi pentland track human bodi ieee tran juli yang ahuja recogn hand gestur motion trajectori ieee cs confer comput vision pattern volum page fort june yacoob black model recognit activ journal comput vision imag cutler davi period motion intern workshop digit comput video februari cation ieee cs confer comput vision pattern volum page fort june huang visual interpret hand gestur review ieee tran juli kanad stereo machin applic virtual realiti local rang track gestur ieee workshop human analysi hilton head june
Agents/1261 1 agent reason negoti argu simon carl sierra nick jen depart electron queen mari westfield london unit kingdom februari abstract negoti system stem requir agent solv problem pose interdepend negoti solut problem give agent mean resolv conflict correct inconsist knowledg agent world coordin joint approach domain task benefit agent concern base system permit agent negoti order establish accept wai solv problem framework formal model reason detail design philosophi ensur clear link formal model practic describ case studi relationship class architectur introduct number softwar applic implement notion autonom agent applic vari email filter electron commerc larg industri applic dispar notion autonomi denot fact softwar abil decid goal adopt goal achiev agent autonom compon interact inher interdepend exist predomin mechan manag interdepend process group agent commun mutual accept agreement matter negoti central sabbat leav artifici intellig research campu spain agent autonom agent influenc acquaint persuad act mean achiev state make trade offer mutual accept word negoti interest build autonom agent negoti paper make main contribut goal outlin gener model negoti autonom agent persuad act describ gener method approach build agent architectur clear link specif implement method found natur correspond system distinct theoret compon defin modular present agent architectur demonstr power flexibl approach number variant wide agent model conceptu structur contribut provid gener system argument suitabl agent describ specif version system bdi agent move agent bdi agent introduc addit issu handl exist system argument fourth contribut present framework describ reason process negoti agent framework base argument level agent intern reason level negoti agent approach advoc formal hewitt natur mean view reason oper autonom agent open system paper build previou work field negoti argument extens work present tighter integr argument mental model negoti deal argument justifi posit addit basic statement fix technic problem model argument present work complementari work concentr argument built commun languag negoti protocol remaind paper structur major contribut present separ section section introduc gener framework describ negoti section show system agent architectur gener bdi architectur section present system argument suitabl agent system section illustr framework negoti section place work context previou work field negoti system section conclud outlin number issu requir investig framework negoti examin literatur negoti field social psycholog game theori distribut ai reveal level agreement main stage involv process common underpin gener negoti model outlin gener model negoti negoti process place agent attempt achiev goal prefer achiev goal case agent bargain agent achiev agent depend achiev case discuss achiev goal process negoti proce exchang explan broadli kind solut problem agent face singl complet singl partial group complet partial solut made independ agent base previou comment made agent typic provid servic complex suggest joint includ suggest suggest condit hold provid servic provid servic provid servic provid servic date basic mechan negoti begin agent make agent receiv respond wai make critiqu critiqu remark comment part agent part dislik short dialogu exampl provid servic accept critiqu provid servic provid servic dont servic critiqu intend provok altern process gener critiqu method agent evalu return critiqu origin agent respond agent aim provok altern accept gener inform easier origin agent respond manner lead agreement altern offer critiqu agent respond made previou exampl provid servic provid servic provid servic extend initi provid servic provid servic provid servic provid servic amend part initi provid involv gener send altern favour respond agent critiqu statement agent suggest agent provid explan agreement reach quickli explan addit inform explain critiqu made agent suppli support critiqu explan form justif agent suppli posit form argument agent seek persuad negoti suggest valid simpl statement reach exampl part negoti agent suppli provid servic servic offer provid servic provid servic provid incur cost dialogu form explan explan statement provid servic provid servic good open negoti dont provid servic provid servic explan critiqu explan accompani initi attempt persuad good idea role focu local search agent solut suppli inform object agent focu search suggest explan form suppli absenc provid servic provid servic good im interest ill provid provid id ill provid provid bs utter piec express prefer servic process negoti consid process start agent gener agent accept critiqu make provid agent make fresh send clarifi respond process continu agent involv happi felt agreement reach case particip agent meant optimum point view repres accept negoti protocol negoti process introduc defin agent follow defin basi protocol protocol form state transit diagram legal state agent negoti legal transit state agent analysi lead figur broadli similar process begin agent make denot oe denot made explan agent care give withdraw initi state final state withdraw withdraw figur negoti protocol agent give idea pair explan map idea argument narrow technic term paper agent make wait agent accept make make withdraw process agent give explan critiqu support reason critiqu agent process move make respond initi process iter agent thing note protocol drawn figur altern offer model model agent make wait previou protocol make distinct start directli relat origin protocol includ accept withdraw type critiqu bring negoti close string stand transit label initi agent stand protocol explicitli includ explan accompani utter oe suppli agent reader invit imagin diagram full protocol includ set pair arc state back state arc pair label label section introduc gener describ negoti term broad interpret usual agent literatur negoti dialogu agent lead subject joint price initi opinion suggest agent reason formal system argument basic support build agent negoti gener subject section talk build agent system turn mean describ build kind agent system argument architectur negoti agent wai design build agent system common mean agent architectur role architectur defin separ identifi main function ultim give rise agent behaviour defin interdepend approach system design afford tradit advantag softwar engin enabl complex artifact design simpler compon problem work agent architectur ad hoc natur connect specif architectur implement situat undesir provid mean develop agent architectur clear link specif implement make system framework distinct theoret compon defin interrel context repres compon agent interact compon mean bridg rule context make move directli specif architectur formal descript term system context set statement logic axiom move directli implement context concurr theorem prover exchang inform theorem prover compon correspond directli compon origin architectur approach enforc modular structur accord good softwar engin practic section wai describ instanc walton section descript relat figur agent gener method system agent architectur section make discuss concret indic class agent bdi model approach section specif pair bdi agent domain gener agent agent architectur consist compon formal ffl unit structur entiti repres main compon architectur ffl logic declar set axiom number rule infer unit singl logic ffl theori set formula written logic unit ffl bridg rule rule infer relat formula unit figur show architectur unit proposit order logic specif theori bridg rule shown arc connect unit notat agent defin group interconnect unit repres pair set unit unit triplet hl axiom rule infer defin logic rule initi formula theori gener theori unit set bridg rule unit bridg rule understood rule infer unit mean formula deduc unit formula deduc unit figur write rule conveni bridg rule enforc relat compon agent architectur bdi bridg rule intent unit belief unit mean agent intent ff awar fact specif bdi agent develop predic order logic formula intent unit belief unit mean bridg quot method model modal logic order theori giunchiglia serafini natur unit vari architectur bdi agent unit repres theori desir architectur base function separ concern unit situat assess plan execut assum agent dedic commun unit figur enact agent commun assum exist unit encapsul agent intern structur uniqu defin interfac cognit interpret commun unit act metaphor agent sensor actuat mouth mean agent effect situat environ commun unit deal incom outgo split incom outgo messag feel moment rule possibl reason model simpl introduc unit captur cognit compon unit desir captur logic reason unit belief moment dont feel condit appli part commun unit formula agent utter determin languag lc commun unit lc result nest bridg rule make languag unit bridg rule plai kei role design architectur show section import differ behaviour attain simpli chang pattern unit interact agent carri interchang listen form speak form action commun unit make effect negoti agent set formula unit depend unit initi infer rule incom bridg rule formula introduc bridg rule depend formula present unit bridg rule depend bridg rule lead commun unit receiv formula agent extend alphabet order accommod dynam natur enabl flexibl languag lc defin partial formula propag commun unit unit mean bridg languag unit partial evolut reason process applic bridg rule commun extend languag increment fix set predic languag leav definit parametr respect term predic appli signatur declar mean bridg rule defin term predic appli bridg rule emb atom theori unit proposit unit similar job case order languag defin metalanguag similar omega partial natur languag essenti agent negoti process involv introduct concept agent languag extens agent deduct thought relat utter heard current theori agent unit utter gener agent mechan execut model base concurr execut unit deduct process formul dynam logic unit execut concurr bridg rule concurr process examin theori unit set formula match match found conclud formula asynchron ad theori unit reactiv commun unit immedi process add messag receiv agent enabl agent asynchron mechan simul synchron deduct unit figur type bdi agent left relat modal correspond strong realism weak realism respond manner import event occur environ situat bdi agent provid specif method approach advoc previou examin class agent model theori architectur base rao georgeff model evolv time compar section account recent approach modal repres state repres motiv repres end agent associ separ unit modal figur give unit interpret rao georgeff refer direct interpret involv give modal semant term world relat modal relat world relat semant model access world syntact model axiom form implic modal fact world agent believ syntact repres implic deduct read side connect ponen modu architectur associ bridg rule opposit implic instanc figur direct logic unit embodi tempor logic ctl rao georgeff addit axiom ctl common unit axiom encod behaviour modal exampl figur axiom set fact gener approach unit belief desir intent deem exampl complet discuss logic turn bridg rule state set bridg rule determin relationship modal behaviour agent establish set relationship bdi agent identifi ffl strong realism set intent subset set desir turn subset belief agent desir intend ffl realism set belief subset set desir turn subset set intent agent believ desir intend ffl weak realism case strong realism realism agent desir properti negat properti intend properti negat properti intend properti negat properti believ addit bridg rule relat desir rule relat intent formula commun unit formula commun unit belief commun unit commun agent perform illocutionari content determin rest unit architectur bdi agent commun unit agent act express bridg rule make intent denot formula insid commun unit determin make effect agent perceiv action accomplish presenc commun make belief unit awar fact mean bridg rule act predic argument inform action complet direct interpret bdi model term system interpret work prefer build system indirect interpret hint section system separ unit commun set bridg rule discuss set depend kind realism show illustr process defin provid specif strong realist bdi agent start recal compon unit present logic theori written logic bridg rule connect unit strong realist bdi agent compon discuss unit bdi commun unit desir intent unit logic unit commun unit classic order logic usual axiom rule infer belief unit order special predic denot belief agent mention modal logic interpret belief modal satisfi axiom make belief predic captur behaviour add axiom belief unit desir intent unit base order special predic usual treatment desir intent modal make satisfi axiom captur ad relev axiom desir intent unit modu ponen rule infer complet specif logic unit unit logic written languag present unit inform domain inform possess make gener statement strong realist bdi agent built find specif theori includ bridg bridg rule figur strong realist bdi agent deriv directli model rao georgeff ensur consist desir intend ensur agent intend desir ensur desir adopt intent bridg rule interact commun unit unit discuss note discuss bridg rule result quot formula interpret quot formula bridg point simplifi notat leav quotat implicit home improv bdi agent captur strong realist bdi agent continu introduc involv agent paper order illustr scheme negoti note intend illustr show approach show agent set approach set agent make bdi agent acknowledg knowledg agent reason world simplist realist theori action plan feel cloud issu theori make bdi model gener approach hing fact make agent gener specif agent approach repres action scope reason languag oper languag predic connect order logic languag quot scope predic connect term relev predic conjunct repres materi implic repres admittedli naiv goal agent mean agent achiev concern home improv agent strong realist introduc inform seek achiev agent intent hang belief resourc hang mirror hang hang hang note write subscript desir intent predic agent inform part theori agent intent belief unit initi theori intent unit part initi theori belief unit bit theori introduc agent intend hang mirror belief resourc action hang hang hang agent simpl theori action integr model resourc plan mechan form part theori belief unit theori model idea ownership agent owner artifact agent agent artifact longer benevol agent intend give agent adopt intent give natur complex cooper strategi defin stand formula contradictori treatment time complet specif main time handl includ time addit argument case formula read involv make base logic unit instanc system introduc agent similarli simplist theori plan suffic form part theori belief unit crude agent believ intent rule achiev rule intent recal materi implic parsimoni agent believ intend intend mean achiev pn reduct achiev agent adopt intent achiev precondit pn rm rm permut pn uniqu choic wai achiev intend note denot pn rm pn rm rm permut pn mention acknowledg theori action theori plan naiv interest reader encourag substitut theori desir initi inform agent provid limit theori enabl agent oper complet theori unit agent give agent domain depend bridg rule link commun agent intern request agent agent offer agent intent offer agent inform recipi trust agent told belief agent accept bx awar intent agent awar intent agent believ adopt intent bridg specif agent complet demonstr approach bdi agent defin home improv agent return subsequ section discuss argument negoti agent argument system argument basi negoti base fox colleagu system work construct seri logic step proposit interest extens classic logic classic argument sequenc infer lead true system argument adopt argument prove proposit true suggest proposit true strength suggest ascertain examin proposit relev argument form argument work inform logic argument philosophi stress develop independ set formula build suitabl consequ proposit argument set formula infer pair extend tripl account fact true give belief ff remaind section extend system argument multiag case demonstr agent architectur introduc section gener set section discuss complex issu set bdi agent argument fit argument agent build argument rule infer unit bridg rule unit import differ system argument emploi author ground argument formula argument grant agent question build proof ground desir assumpt necessarili hold system agent rule infer unit bridg rule mean agent reconstruct proof formula formula base ground complet includ rule infer bridg rule augment notat argument identifi rule infer bridg rule emploi exploit fact rule infer bridg rule similar deduct behaviour denot ident identifi agent make argument ng formula deduc agent set formula set infer rule bridg rule fr ambigu agent omit exampl notat defin deduct step agent agent bridg rule creat request appli infer rule stand modu formula unit fi fi qg make rule infer bridg rule explicit mean part argument make build argument applic rule agent rule infer bridg principl engag argument rule valid practic complex find wai repres reason mechan agent individu agent agent model wai acquaint reason main line continu paper point word relationship descript argument agent describ argument make statement agent concern talk agent prove talk argument gener pure term statement agent dont add possibl make thing clear remaind paper drop simplifi notat defin argument definit agent argument formula languag pair set ground give axiom rule give axiom rule agent necessarili convent ground argument relat formula deduc set formula deduc definit set ground agent order set hs dn formula theori formula theori agent call step argument sake refer deduct step identifi step agent equip proposit logic theori fa bg argument bg theori argument hs bg cg distinguish tautolog argument reli formula agent definit argument tautolog deduct step built rule bridg rule axiom logic agent unit agent agent build tautolog argument axiom theorem proposit logic agent build argument hs fg notion tautolog argument vari agent agent rule infer bridg rule agent rule differ classifi argument effect scope paper distinguish consist argument inconsist dont make definit argument consist call argument nontrivi argument proof formula suggest formula true indic argument formula argument interest type argument argument argument undercut definit argument argument attack stand axiom formul proposit logic whitehead russel mathematica restat hugh cresswel note notion defin section moment consid thought mean argument truth definit argument undercut argument exist formula attack dk attack reason dont defin depend logic argument built proposit logic make formula attack negat vice versa modal logic intent longer make notion attack captur clash idea undercut hold kind attack illustr revisit friend assum expand theori build bg cg dg proposit logic attack attack undercut relationship argument undercut wide instanc notion broadli line consensu issu form conflict argument stem rule infer bridg rule argument hint argument attack rule build argument form attack scope discuss note unlik present definit mean argument attack firmli form attack depend underli depend unit argument built unit repres discuss notion attack relev bdi agent section motiv classifi argument term undercut split argument class previou work argument system order class argument made class argument made class argument made proposit argument made class argument made proposit undercut argument made class tautolog argument made idea argument higher number class accept question argument proposit class argument argument argument class includ class lower order accept class defin set argument smaller class accept argument larger class accept import agent decid section accept class argument local agent depend argument built point handl contradictori process build argument monoton build argument standard proposit build argument build argument process argument argument argument conclud build argument accept argument chang complex analysi comput complex argument process depend languag argument built state construct argument formula set formula satisfi complex build argument depend complex satisfi languag question languag full order problem build argument satisfi order logic languag full proposit problem decid restrict languag proposit horn finit fulli instanti set order horn thing problem build argument decid achiev time proport number proposit languag problem build argument build argument decid time proport size languag worst case undercut argument involv attempt step decid time proport product number proposit languag length argument question argument bdi agent instanti argument model context agent section formula attack complex issu case singl agent argument formula attack negat bdi complic larg conflict agent believ believ conflict occur agent opposit intent activ intend bring incompat agent intend chang mental state word intend persuad agent desir negat current belief desir attack intend prime carl attack intend carl prime minist simon attack stand intend simon believ god kate simon attack believ god simon case simon carl conflict prime minist case conflict kate chang simon belief view opposit believ case attack attack agent identifi placehold definit agent formula languag agent attack formula languag agent case jn jn jn notion undercut accept class natur extens al multiag case differ notion attack al conflict approach identifi conflict virtu fact insid detect type attack import form attack figur promin interact agent import interact moment handl inconsist agent case agent deal contradictori belief handl make approach deal inconsist exist negoti argument point address negoti argument case argument negoti process step select agent intent agent find proof base resourc extern resourc negoti owner resourc start assum owner call agent build argument requir resourc pass agent receiv agent examin suggest simplest case agent find reason simpli respond messag agreement interest case occur agent type situat happen situat suggest directli conflict bs object state affair detect build argument attack kind conflict occur build argument initi suggest case kind conflict occur agent reject suggest made step suggest reach build undercut argument occur conflict agent bs intent case construct agent made incorrect assumpt bs belief desir intent case case inform object send back attack argument form agent reach agreement long find altern achiev origin persuad drop object type argument submit agent find reason reject accept negoti end process iter figur kind negoti clear fall framework suggest section mean gener construct argument agent intent construct process effect gener form ground pass agent desir evalu agent attempt build argument stress limit case pure pragmat make descript easier obviou reason procedur extend arbitrarili larg number agent agent pass ground requir agent negoti complet quickli discuss section paper assum pass argument formula question assum agent accept build argument argument critiqu attempt build argument mean gener ground argument pass agent serv guid accept solut act imagin agent pass part ground critiqu isol addit accept class reason mean agent determin strongli object evalu agent discov fall class accept fall class suggest accommod find altern achiev initi intent fall class wrong complet accept class evalu intern send suggest agent vet ensur detriment accept class mechan rate suggest ensur negoti agent home improv agent illustr idea introduc section step agent find proof intent proof build base theori make belief true mean bridg rule agent build argument fi convert action bridg rule note fact strong realist agent intent build proof base ia applic strong realist bridg rule proof indic intent achiev proof detail stand modu stand modu stand space omit axiom unit deduct made recal equat number refer step step stand ba agent gener argument accept class build undercut argument deem suitabl suggest pass step unit agent receiv formula bring agent form basi fi pt argument argument mean agent argument class mutual assum agent argument prefer util argument enabl satisfi intent argument intent hang negoti model return argument critiqu step agent receiv argument classifi origin argument incom argument class origin argument move agent gener argument altern hang mirror satisfi bs goal sr stand set bridg rule strong realism argument classifi undercut agent send latest argument agent build argument attack argument classifi strength accept crucial point construct argument previou argument longer reduct plan rule acquir rule hang mirror part bridg rule ad rule set belief argument longer maintain origin argument agent receiv agent screw reach goal note step crucial construct undercut argument step depend fact agent bridg rule strong realism agent bridg rule realism weak final suggest hint flexibl approach show chang basic assumpt relat unit make substanti differ behaviour agent view dialogu section shown agent built approach argument mean negoti section mention view mean view common field system broad merit wai classifi kind dialogu demonstr approach suitabl framework perform kind classif provid walton walton distinguish basic type dialogu base situat start goal dialogu goal particip dialogu result tabl dialogu present includ element inform high level view agent decid common dialogu walton term initi identifi conflict type dialogu initi situat particip goal goal dialogu conflict opinion persuad parti resolv clarifi issu inquiri proof find verifi evid prove hypothesi negoti conflict interest reason inform seek parti lack inform acquir give inform exchang inform dilemma practic choic goal action decid action tabl walton classif dialogu limit resourc agent engag negoti proce agent clarifi achiev mean agent share inform ground argument view gener mechan dialogu agent shift seamlessli type dialogu identifi walton point cast high level view agent interact agent attempt assembl proof achiev goal resourc idea argument overarch framework type dialogu echo work loui moor argu game theoret account negoti fail account number import aspect negoti point view argu report overlook pursu argu aspect captur model negoti draw idea artifici intellig work loui moor extent mutual support loui moor provid justif model negoti provid concret kind model argu favour model extend order captur kind dialogu deal relat work paper dealt number topic research formal model agent negoti complet review relat literatur make pass comment area concentr fulli final closest focu paper work reason concentr oper singl agent argu order establish belief discuss section basic approach framework extend account case tradit assumpt hold previou work produc formal model agent dmar fail carri forward clariti specif leap faith requir maintain clear link specif implement direct execut specif develop run differ work previou work system model agent belief belief repres belief agent belief acquaint agent nest belief agent lead structur unit belief structur solv problem wise men nest belief includ singl unit provid autonom agent show attitud incorpor architectur term autom negoti argument number relat item research bussmann muller draw social psycholog negoti model algorithm emploi agent cooper environ model richer found tradit system accord gener model lack rigor theoret underpin assum agent inher cooper al present similarli rich negoti drawn predominantli system make limit assumpt cooper agent rosenschein zlotkin research repres grow bodi work negoti base game theori work make cooper agent agent regard util produc import includ relat ly work embodi number limit assumpt main concern agent assum complet knowledg payoff agent util valu provid approach inher assum partial inform perspect qualit natur sycara work persuad system emploi argument part system oper domain labour negoti demonstr power eleg system arbitr handl disagr gener work led sequent research krau al provid logic model process argument approach involv defin logic defin agent properti identifi type argument conjunct model appeal appeal prevail appeal approach differ adopt system argument start point put place basic infrastructur argument negoti metaphor type implement system simpli instanti behaviour rule individu agent final piec relat work discuss close relat model negoti agent negoti exchang gener argument guid relationship relationship defin term argument attack defeat argument model intend agent converg solut resourc alloc problem give complet view real state world assum incomplet model lot common result perspect problem model start clear pictur agent ground system argument ty relationship argument mental state agent hand start give abstract view argument defin relationship argument term lead agreement turn mean ensur negoti procedur suggest lead step agent make accept futur work paper present formal model reason negoti autonom agent model agent capabl flexibl sophist argument gener term term type agent bdi shown agent construct argument justifi agent critiqu agent exchang argument guid problem solv behaviour mutual accept solut import benefit term practic implement agent follow approach modular architectur compon case bdi unit reduc complex theorem prove mechan easier defin proof strategi combin simpl deduct element system reason unit applic bridg encompass approach show clear link potenti implement agent negoti reason manner advoc link achiev implement unit concurr theorem prover connect bridg rule work import step aim build agent negoti extens work detail paper negoti protocol exchang complex languag express suggest agent build includ compel argument adopt paper back suggest indic argument construct creat provid explan exchang argument guid agent agreement topic number issu paper requir investig promin produc implement support gener definit agent architectur specif instanti type agent notion attack infer discuss section fulli elabor ascertain negoti agent achiev tractabl manner mean agent gener rate argument expand accept class provid mean order requir abil provid rank step section agent detail strategi base model acquaint record past make refin choic qualiti argument present agent effect intern mechan track maintain argument propag prefer knowledg time illustr step section acknowledg author anonym percept comment earlier version paper author partli support spanish grant spanish project refer viewpoint fundamenta brook intellig reason intern joint confer artifici page bussmann muller negoti framework cooper agent page chella modal introduct cambridg cimatti serafini reason belief approach case studi intern workshop agent architectur page cimatti serafini reason belief context mechan ijcai workshop model context knowledg reason artifici page cohen levesqu intent choic commit artifici dung accept argument fundament role nonmonoton logic program game artifici fox dialect reason inconsist inform confer uncertainti artifici page emerson tempor modal logic van handbook theoret comput page ambler contradict practic reason european confer artifici page georgeff lanski reactiv reason plan nation confer artifici page giunchiglia serafini hierarch logic modal artifici contextu reason ijcai workshop knowledg hewitt open inform system semant distribut artifici intellig artifici hodg logic featur horn van logic handbook logic artifici intellig logic volum page oxford hugh cresswel introduct modal logic rao architectur reason system control ieee jen control cooper problem solv industri system joint intent artifici varga archon develop dai applic part ieee sycara reach agreement logic model workshop distribut artifici fox logic argument reason uncertainti comput lesser gener model intellig negoti agent intern journal intellig cooper inform loui defeat system infer comput loui moor dialogu negoti mae agent reduc work inform overload commun noriega sierra layer dialog agent intern workshop agent architectur page parson jen negoti preliminari report intern confer multi agent page pollock justif defeat artifici negoti behaviour academ rao georgeff asymmetri thesi problem linear time branch time intent logic intern joint confer artifici page rao georgeff bdi theori practic intern confer page rao georgeff model ration agent intern confer principl knowledg page rao georgeff formal model procedur multiag system technic note australian artifici intellig electron auction intern confer practic applic intellig agent page rosenschein zlotkin rule encount mit shoham program artifici jen negoti model autonom agent european workshop model autonom agent page parson framework negoti intern workshop agent architectur page softwar engin addison sycara plan agent plan eleventh intern joint confer artifici page negoti reason choic stanford spring symposium qualit prefer practic page van fundament argument handbook histor background contemporari develop lawrenc erlbaum tempor reason system iiia feasibl defeat reason intern confer knowledg page walton commit basic concept interperson reason state york wellman program environ applic distribut flow problem journal artifici intellig wooldridg jen intellig theori practic knowledg engin
HCI/1262 4 combin mobil comput collabor augment realiti singl system make power comput enhanc interact commun real world access anytim paper describ work build mobil collabor augment realiti system support true stereoscop pen pad interfac direct interact virtual object system assembl hardwar compon serv basic test bed user interfac experi relat comput support collabor work augment realiti mobil platform implement featur collabor mobil stationari user demonstr augment mobil wearabl comput support collabor hybrid track introduct relat work work explor combin excit emerg mobil collabor augment realiti augment realiti enhanc percept real world comput gener mobil user access manipul inform anytim independ comput support collabor work comput medium human commun combin area excit applic mobil collabor user mobil ar engag spontan collabor involv manipul possibl construct complex model present technolog advanc gerhard dieter schmalstieg vienna technolog figur user wear mobil augment realiti kit direct begin review fundament issu relat work combin ar mobil comput cscw mobil augment realiti augment realiti mobil comput mention mobil comput platform reli kind displai provid continu access coupl oper ultim goal make mobil comput part normal daili life augment realiti user interfac mobil comput power comput access inform locat provid contextu inform promin serv inspir approach mobil multimedia inform system journalist tool head bodi world world head figur influenc head bodi rotat locat displai mobil present mechan identifi inform fix user inform fix rel user bodi inform regist real world locat figur applic ar mobil comput follow distinct augment field field typic figur applic mixtur approach field annot common field prefer simpl inform navig directli manipul applic mix connect annot field real object virtual annot bodi virtual object field field figur field object render field object directli manipul lack accur world referenc track system user locat make direct interact virtual ject hard imposs annot easier achiev field track user posit orient accur field perform mobil comput reason stereoscop render satisfi perform recent object posit user user limit indirect strategi requir stereoscop render recent advanc portabl comput show applic rich direct manipul object field feasibl collabor augment realiti main disadvantag desktop cscw applic function cognit separ user tool ar remov tool real environ collabor user experi share space fill real virtual object interact open applic area collabor comput aid design displai platform establish collabor optic hmd video hmd share space work displai approach constrain collabor ar special activ surfac heterogen collabor ar enhanc remot video conferenc mix user interfac except mobil portion system work tether stationari limit spontan restrict aim overcom contribut paper explor possibl mobil workspac collabor augment realiti system descend ar platform mobil platform full stereoscop displai freeli configur track system fusion arbitrari sensor complement provid manipul object reach user interfac manag user arrang multipl arbitrari applic bodi carri multipl user natur collabor augment share space instantan collabor establish user wear system meet demonstr collabor mobil stationari user establish mobil user walk lab underli distribut system transpar synchron graphic applic data stream run applic fly newli join member workgroup challeng address realiz situat distribut applic real time synchron share data present state user stationari mobil track system vari deliv data exchang platform integr limit capabl mobil platform requir applic provid degrad version content paramet negoti instantli mobil user join share space current system prototyp improv demonstr potenti merg mobil yield mobil collabor augment realiti applic scenario mobil collabor ar system applic reason actual scenario investig typic concern cscw applic meet indoor environ multipl user meet lab confer room discuss work aid augment realiti user work local stationari devic includ project wall workbench bring mobil equip depend devic share content refer separ import featur number particip compon chang runtim enter share inform bring automat log distribut system synchron ongo session meet outdoor environ imagin architect meet outdoor discuss build project locat user equip mobil wearabl workspac provid access note model tool architect approach kit set virtual collabor user show data brought modifi exist design popul plan locat build full object user interfac comput power stereoscop render comput vision mobil comput size weight system optim setup sole build hardwar compon avoid effort time requir build hand quickli upgrad devic add chang configur easili hand obtain smallest system hardwar power portabl graphic solut pc notebook equip video chip devic processor run window ad wireless lan network adapt notebook enabl commun stationari setup futur mobil unit carri user backpack output stereoscop color hmd displai fix helmet worn user orient sensor web camera fiduci track interact prop mount helmet main user interfac pen pad setup graphic tablet pen devic optic track camera marker posit pen incorpor process provid accur track pad figur overview setup section detail track user interfac manag softwar softwar platform user interfac manag system ar base limit stereoscop graphic support varieti displai devic includ stereoscop hmd section mean virtual object user interfac element regist displai pad applic implement runtim loadabl object execut design volumetr kind window origin stationari environ user arrang multipl applic stationari mobil setup marker graphic tablet pen web camera helmet orient tracker displai graphic notebook pc figur compon mobil setup commerci hardwar design pictur compon displai arrang inform wearabl workspac travel user applic stai put rel easili access aid propriocept spatial memori idea interfac implement resembl pierc al user interfac manag system capabl manag multipl number graphic object local import oper mobil user requir separ wearabl workspac defin distinct local user move local user movement graphic object local effect case add stationari graphic applic user work section support multipl user requir user interfac manag system build distribut graphic distribut distribut runtim softwar softwar develop environ realiz collect class built top open inventor toolkit core scene graph store geometr inform activ interact object system scene graph repres graphic object system separ applic state graphic object avoid problem introduc distribut share scene graph semant distribut share memori distribut perform implicitli mechan multipl local replica scene graph synchron process applic programm user extens distribut open inventor notif mechan distribut softwar system runtim extens subclass node class load regist system fly base approach logic consequ applic node scene graph applic written monolith link runtim applic class deriv base applic node applic class load binari object fly system instanc applic object scene graph multipl applic node present scene graph conveni applic class deriv applic foundat class extend basic scene graph node interfac fairli capabl applic interfac api conveni manag user interfac element support interfac document window multipl document implement applic instanc separ node scene graph share common applic code load demand scene graph distribut applic newli creat applic instanc ad replica scene distribut program model make applic instanc node scene graph impli applic specif data data member applic instanc part scene implicitli distribut div applic migrat migrat applic host import featur distribut virtual environ build distribut architectur applic node scene applic migrat straight applic state encod scene graph applic node graph marshal arbitrari scene graph memori buffer standard oper applic complet live state graphic intern captur transmit network target host reliabl tcp ad local scene resum oper sourc copi applic complet migrat destin host simpl replic destin step omit case destin host load binari object modul present memori binari destin share file marshal scenario support interest cscw applic late join host ad session distribut system build copi replic applic instanc host easili achiev applic migrat mechan variant delet sourc applic instanc earli exit opposit oper late join host earli host stop oper distribut system remain host continu execut applic migrat exit host simpli delet applic instanc track track softwar mobil ar requir significantli complex track tradit vr applic found exist track softwar packag high custom easi extend overcom develop open softwar architectur task involv track input devic process multimod input data typic vr ar applic track data pass seri step gener track read devic transform fit requir applic send network connect host setup applic requir subset combin step individu step common wide rang applic exampl invari step geometr kalman filter data fusion data sourc sequenc frequent adjust main concept break data manipul individu step build data flow network transform build offer approach extens set sensor state transform oper behavior specif construct graph track object spirit scene graph event user defin tracker configur file distribut simul network transfer event point graph structur decoupl simul transpar network event execut base model applic independ design base full advantag technolog standard xml tool configur document figur automat gener xml base tracker configur file experi section script capabl tracker configur easi integr track encourag exploratori construct complex track shown track configur track user interact prop achiev combin data sourc compon receiv data user head path optic pen graphic tablet optic pad orient sensor hmd locat rel transform default merg ref default posit button merg ref data base ref data base ref ref ref data base data base figur data flow graph mobil track setup automat gener xml descript orient sensor provid coordin system bodi stabil posit world stabil orient coordin system pen pad track video camera mount helmet process video inform video camera hmd fix helmet transform camera user coordin system fix determin calibr step pad equip marker standard user hold field view interact user interfac element displai pad equip cube featur marker side occlud track pen posit orient user touch pad pen accur inform provid graphic tablet set posit pen respect tablet data flow graph describ data transform shown figur round node top sourc node encapsul devic driver round node bottom sink copi result data ar softwar intermedi node receiv event track transform pass import type transform rel transform input devic interpret locat devic rel locat color denot path graph describ track data devic process rel transform mark cross stripe color path connect optic pen path describ marker transform relat pen point locat inform transform merg data graphic transform refer system establish orient sensor optic pad path describ comput obtain locat pad side optic pad inform step transform inform graphic tablet path actual pen posit subsequ merg pure optic inform final white hmd locat path provid inform head locat task provid constant transform orient sensor note visual xml complex configur creat write singl line code figur user interact paint applic select desir draw color move applic window posit experi illustr possibl set situat outlin report simpl demonstr applic show import properti direct manipul collabor user mobil user mobil setup configur section capabl provid workspac locat user space move orient world due orient tracker establish head rotat workspac full set function framework user place applic carri interact directli pen displai object user interfac element pad figur show pictur user interact simpl paint applic interfac present pad user select paint color grab shown red paint object select color manipul window place person workspac collabor setup investig collabor mobil stationari user user share local common collabor applic stationari user track tether magnet track system driven dedic track server commun track data host multicast group user stereoscop soni driven desktop pc render host mobil user equip setup section render host featur video camera render person view video imag document setup figur displai configur desktop pc lan access point mobil pc cam desktop pc figur interact host comput connect input output devic share scene network stationari track mobil user correctli regist stationari user coordin system local stationari user achiev addit optic marker environ posit refer frame magnet tracker regist establish anchor transform lan magnet refer frame marker magnet marker optic optic refer frame prop optic figur coordin refer frame regist mobil user stationari setup tion gener optic track mobil user magnet refer frame figur schemat overview involv coordin system standalon server run mobil unit track anchor marker locat rel camera invert locat inform yield camera locat rel marker inform registr data marker comput user locat subsequ interact prop magnet tracker refer frame send host multicast group note host receiv tracker data multicast group compon combin data correct displai interact track element host render user view configur individu output devic soni stereo video virtual glass devic stereo run instanc share chess applic track data commun multicast group render user action properli applic migrat featur section mobil user enter workspac run chess game current state applic stream mobil kit connect local network kit host particip ongo session figur show scene person view gener render view video camera background board pad notebook drive mobil user view figur game ar chess demonstr collabor stationari user mobil user user perform experi achiev displai frame rate fp track frame rate fp optic track found sum frame rate limit comput power fp fine tune system perform limit optic track rate displai rate limit optic track frame rate enhanc qualiti displai environ futur work describ mobil collabor ar setup featur stereoscop render direct manipul augment object advanc user interfac manag system user work applic present user interfac time person workspac surround user organ applic spatial directli interact natur distribut featur collabor user host situat migrat applic host support import natur integr mobil user collabor work situat flexibl track softwar compon build complex hybrid track setup mean write configur file devic easili includ enhanc qualiti track current system hardwar prototyp improv problem track interact prop inaccur slow provid natur principl track prop advantag modest requir resourc singl web cam dedic stereo track possibl comput greatli enhanc track qualiti incorpor wireless devic bluetooth input system softwar address challeng automat adapt track system negoti platform capabl aspect present futur applic system includ locat awar comput provid augment world referenc locat mobil user walk build collect data locat chang applic paramet locat requir interact applic fix locat data transfer mobil user workspac world referenc locat collabor includ mobil platform gener situat user session updat current state applic mobil user bring instanc run applic requir provid option synchron state instanc user leav collabor provid option copi applic research provid user interfac situat part plan futur work acknowledg project sponsor austrian scienc fund contract ivan viola contribut implement work gerd work distribut kaufmann product paper refer vassili wearabl augment realiti testb navig control proc page octob ieee acm wearabl spatial conferenc space proc octob fur share augment realiti interfac comput support labor work proc collabor virtual environ workshop great septemb iii wearabl comput cscw proc iswc octob envelop user comput collabor augment realiti proc page san octob ieee webster tour prototyp mobil augment realiti system explor urban proc page octob feiner hybrid user breed virtual bigger interfac smaller comput proc page novemb distribut open inventor practic approach distribut graphic proc acm page decemb explor develop indoor outdoor user interfac mobil augment realiti system comput höllerer situat multimedia present real world proc page san octob iter design seamless collabor media comm august höllerer inform filter mobil augment realiti proc page octob ieee acm kato billinghurst marker track hmd calibr augment realiti conferenc system proc san octob atkeson prototyp contextawar mobil applic proc macintyr feiner distribut graphic librari proc acm siggraph page juli move object exploit propriocept interact proc acm siggraph page van robertson retriev object desktop applic proc symposium interact page schmalstieg open softwar architectur reconfigur track base xml proc ieee virtual realiti page march rekimoto augment realiti system collabor design proc page septemb rekimoto augment spatial continu workspac hybrid comput proc bridg multipl user interfac dimens augment realiti proc page octob ieee acm gervautz environ collabor augment realiti proc collabor virtual environ workshop septemb pentland augment realiti wearabl comput special issu augment strauss carei object orient graphic toolkit acm gunther wearabl comput system augment realiti support terrestri navig proc page ullmer ishii model prototyp tangibl user interfac proc uist page octob acm press
ML/1263 6 psycholog robot complement brian scassellati mit arti cial intellig lab technolog squar room massachusett abstract paper present complementari idea relat studi human develop construct intellig artifact model critic requir construct robot system acquir larg repertoir cognit capabl robot system evalu model human develop simul studi evalu cognit model explor exampl author work model coordin simplifi task learn reach visual target humanoid robot evalu model normal abnorm social skill develop introduct research human develop research construct intellig artifact complementari studi human develop produc great varieti construct long inspir implement robot system research human develop serv inspir challeng research question task decomposit comput studi process impact theoret construct present psycholog uenc robot studi complet absent argu robot reli human develop inspir practic human develop pro evalu opportun robot er brie describ practic theoret wai model aid construct intellig artifact implement simpl coordin group implement humanoid robot nal discuss work progress robot platform uniqu testb evalu model social skill develop normal individu psycholog impact robot psycholog typic emploi robot research sourc inspir question address psycholog literatur infant learn orient salient stimuli children learn navig unfamiliar issu interest robot commun model psycholog er behavior decomposit observ task perform provid outlin softwar architectur techniqu studi skill progress adapt evalu techniqu robot system approach robot construct practic bene ts human develop exploit gradual intern complex extern complex complex regul optim acquisit skill infant born low vision simpli es visual input process infant visual perform develop step abil process ux stimul true motor system newborn infant independ control freedom gradual granular motor control learn coordin full complex bodi process sensori motor system gradual signi cantli reduc diculti learn problem caregiv act gradual task complex structur control complex environ group argu approach robot construct produc system scale natur complex task problem domain optim learn similar scassellati figur humanoid robot freedom varieti sensori system includ system gradual complex intern structur inform gain learn increasingli sophist behavior acquir coordin diamond shown infant ve twelv month ag progress number distinct phase develop visual guid reach infant phase consist demonstr sophist reach strategi retriev toi challeng scenario infant reach compet stage increment improv compet afford previou stage scassellati williamson appli similar bootstrap techniqu enabl humanoid robot figur learn point visual target point behavior learn repeat trial human gradient descent method train forward map visual paramet space arm posit paramet space problem point visual target map problem obviou train posit target visual coordin convert arm trajectori freedom arm behavior decomposit diamond observ al reduc function pair learn function xed function obviou error signal extern robot behavior rudimentari visual typic research wave object front robot saccad foveat reach arm target earli reach wrong direct hour practic accuraci improv drastic reach visual robot learn map target imag coordin coordin arm motor figur achiev robot rst learn foveat target saccad map relat posit camera imag motor command foveat ey locat target robot learn ballist movement map coordin coordin simplifi problem involv control arm posit speci ed linear combin basi postur primit saccad map ballist arm map construct learn algorithm saccad map train tracker error signal vector imag directli train map saccad map ballist map train compar arm motor command signal visual motion feedback clue local arm visual space figur visual track move obtain nal posit imag coordin vector tip arm imag center imag visual error convert error gaze coordin saccad map knowledg gain learn foveat target transform ballist arm error error signal train arm directli learn algorithm oper real unstructur environ explicit world coordin complex kinemat techniqu successfulli train reach behavior approxim hour train video clip cog reach visual target addit detail method found al identifi visual target retin coordin motion detect imag correl saccad map foveat target gaze coordin arm primit coordin gener reach ballist map figur reach visual target product foveat target gener ballist reach ey posit imag correl train saccad map transform retin coordin gaze coordin saccad map conjunct motion detect train ballist map transform gaze coordin ballist reach robot impact psycholog humanoid robot research investig scienti question natur human intellig humanoid robot serv uniqu tool investig cognit scienc robot implement model provid evalu predict power valid model implement robot model accur test valid model repeat experi slight variat isol evalu singl factor independ confound ect normal behavior observ experi repeat ident condit easi valid intern model structur manipul observ quantit qualit ect behavior robot model subject controversi test potenti conduct model explor test altern learn condit robot model suggest evalu potenti strategi appli human subject develop joint refer critic precursor social learn human develop abil select attend object mutual interest human larg repertoir social gaze point postur observ object collect mechan joint vital normal develop social skill children joint attent object event world serv initi mechan infant share experi negoti share mean joint attent mechan infant leverag skill knowledg adult caretak order learn part infant manipul behavior caretak part provid basi complex form social commun languag gestur joint attent investig research varieti eld expert child develop interest skill part normal infant acquir extrem stereotyp sequenc moor addit work behavior manifest disord syndrom disrupt joint attent mechan demonstr vital skill human social interact philosoph interest joint attent explan issu contextu ground precursor theori mind evolutionari psychologist evolut simpl social skill anim kingdom mean evalu presenc theori mind measur social function inspir implement joint refer model coher account observ stage joint attent behavior normal blind observ de cienci joint figur gener error signal singl reach trial visual target gaze coordin transform ballist reach ballist map observ posit move obtain reach error signal imag convert back gaze coordin saccad map attent children partial explan observ abil primat joint attent task model skill decomposit potenti system architectur construct system recogn respond ey gaze imper declar point gestur robot implement model construct implement perceptu system capabl nding face ey system rst locat potenti face locat imag match algorithm potenti face locat identi robot saccad target saccad map earlier locat face imag coordin map imag coordin learn map locat face imag extract ey process techniqu success locat extract ey varieti condit di erent individu addit modul includ attent system system ey neck movement scassellati system regul interact intens implement advantag robot implement robot approach studi joint attent social skill develop main advantag human observ readili anthropomorph social interact robot construct physic embodi system simpler construct simul sucient detail skill implement test model varieti practic robot task interact robot agent easili anthropomorph children adult embodi system human form natur social interact occur addit train prompt observ train special procedur interact behavior interact peopl interact natur robot empir studi reev nass peopl readili treat robot person human form import task constraint behavior robot observ object robot orient head ey target task constraint observ easili interpret behavior robot reason robot implement physic embodi simplifi comput task direct physic coupl action percept reduc intermediari embodi intern ultim ground interact world model aspect environ simpli figur exampl success face ey detect system locat face saccad extract ey imag camera posit ey part human subject enc ect natur human interact obtain comput embodi system perform complex task simpl wai exploit properti complet system put milk exploit pendulum action arm move milk swing explicitli plan natur behavior system plan system guid correct natur dynam social skill implement test model import engin perspect robot system recogn engag joint attent behavior interact robot capabl learn observ normal social signal human infant special train observ robot capabl express intern state social interact reli arti cial vocabulari robot recogn goal desir system accur react cognit state learn anticip reaction modifi behavior implement progress robot system simpl mean bootstrap behavior capabl detect maintain ey contact extend provid rough angl gaze track angl watch object salient robot mimic ecolog strategi ecolog ne algorithm determin gaze add mechan determin vergenc rough geometr strategi ned feedback caretak strategi requir abil maintain inform salient object eld view includ inform salient properti implement strategi requir make assumpt import properti object includ topic scope paper evalu robot implement robot implement behavior model standard evalu mechan behavior observ classi cation techniqu children adult appli behavior robot minim modi cation diagnosi assess relat evalu tool joint attent adapt behavior diagnost diagnost observ studi evalu obtain success implement effort test criteria appli human behavior behavior complet robot implement compar data normal children inhibit speci modul robot produc behavior compar data children evalu determin extent model match observ biolog data draw outcom outcom robot implement match expect behavior complet system demonstr normal joint attent ort provid evid model intern consist produc desir underli biolog process verifi model explan normal develop joint verifi model accur ect biologi robot implement meet behavior reason failur signi implement unsuccess intern logic aw model identifi shortcom model potenti suggest altern solut cult failur result condit di er signi cantli normal human social interact work reev nass lead result possibl draw implement model underli biolog factor futur work implement model work progress basic skill demonstr robot move ey includ maintain orient neck maxim ey rang coordin arm point perceptu compon ey detect robot detect foveat face obtain imag ey initi result provid encourag evid technic problem face implement natur grasp cog perceptu system success nding face ey environ simpl social orient easi interpret human observ found interact robot believ entertain futur work focu construct implement remaind modul model engin approach provid adapt solut classic problem behavior integr multipl sensori motor modal scienti optimist implement provid insight evalu method model social develop acknowledg part research fund contract number part fund onr contract number trainabl modular vision system result includ paper report scassellati scassellati refer mit press contextdepend attent system social intern joint confer arti cial intellig social interact robot human caretak adapt behavior robust layer control system mobil ieee journal robot autom arti cial intellig journal origin mit ai memo cog build humanoid analog vol springer lectur note arti cial altern essenc american associ arti cial intellig ed handbook john wilei compani time human infant infant neural base inhibitori control develop neural base higher cognit vol york academi pp orient behavior regist topograph anim societi adapt behavior cape pp easi control journal motor behavior evolut mit press constraint cortic develop pp danger categori reveal chicago illinoi point humanoid anim societi adapt cape pp ed joint origin role erlbaum evolutionari histori cognit special trend neurosci behavior assess individu cohen theori byrn social evolut intellect human oxford press media equat peopl treat media real peopl cambridg press capac joint visual attent natur mechan share attent humanoid cognit paper aaai fall aaai press build behavior robot paper aaai spring symposium aaai press find ey face foveat vision american associ arti cial intellig imit mechan joint structur build social skill humanoid analog vol springer lectur note cial base cohen dynam system approach develop cognit mit ma ed natur theori blackwel
ML/1264 6 submit public learn recogn object dan roth yang narendra ahuja depart comput scienc beckman institut illinoi il august abstract learn account problem object recognit develop pac approxim model learnabl kei assumpt underli work object recogn simpl term simpl relat raw imag potenti number simpl relat present observ imag fairli small number observ relev discrimin object show properti exploit yield ecient learn approach term sampl comput pac model assumpt distribut observ object learn perform quanti ed rel past experi success learn object natur ti abil repres function intermedi extract imag evalu approach larg scale studi snow learn architectur learn object columbia object imag result exhibit good gener robust properti method rel approach snow recognit rate degrad gracefulli train data fewer view show similar behavior preliminari experi partial occlud object introduct role learn comput vision research increasingli signi recent year statist learn theori uenc applic rang classi cation object group illumin scene reconstruct rise role learn made signi improv comput power larg motiv realiz explicit model complex phenomena messi world signi role learn learn requir model knowledg acquisit support gener avoid brittl statist probabilist learn model requir make explicit distribut govern occurr instanc world visual infer problem categor make assumpt unrealist work develop distribut free learn theori account visual recognit object recognit problem view learn object identifi target object learn account develop pac approxim model learnabl framework quantifi success rel experi observ make assumpt studi theoret limit learn imag term express intermedi learn process learnabl object sampl distribut govern experi learner recogn correctli framework guidelin develop practic algorithm solut problem earlier work discuss possibl identifi theoret limit learn imag found learn term raw imag intract attempt explain depend learnabl object fail provid satisfactori explan practic solut approach develop build suggest made reli heavili develop featur ecient learn approach learn process capabl learn quickli ecient domain number potenti featur larg concept interest depend fairli small number heart learn approach assumpt abstract exist collect object repres simpl function element exist process imag target object gener ecient present imag high assumpt prove exist ecient algorithm collect imag label posit neg exampl target learn good object learn high make correct predict futur imag object show learn robust realist condit signi approach prior knowledg distribut imag estim learn perform test imag sampl distribut govern data observ learn experi section describ framework detail clear technic discuss distribut intermedi gener imag framework develop gener explan allud repres varieti comput process inform sourc oper imag depend local properti rel posit primit extern inform sourc context variabl theoret support appli intermedi learn stage hierarch process order gener explan work assum syntact simpl term raw imag explan syntact simpl term learn infer give rise hierarch main assumpt framework discuss section framework contribut practic comput approach learn ecient term comput number presenc larg number potenti evalu theoret framework make snow learn architectur tailor kind task snow system publicli section section describ task object recognit present comput approach describ detail support vector machin discuss relat snow section describ larg scale object recognit experi compar snow approach mention experi snow shown exhibit high level recognit snow base approach compar favor approach behav robustli presenc fewer view train data conclud direct futur work section learn framework studi learnabl standard pac model model learn model assum exist concept class class function instanc space complex paramet xs unknown target concept learn learn learn algorithm predict told predict correct time learn algorithm make incorrect charg mistak learnabl exist predict algorithm sequenc exampl make polynomi mistak expect learnabl exist expect number mistak make sequenc exampl polynomi note expect random choic made probabl distribut sequenc learn unknown target function pac assum xed arbitrari unknown distribut instanc space learn algorithm exampl drawn independ label requir predict drawn denot predict algorithm error algorithm respect measur ff exist learn algorithm polynomi target concept distribut algorithm probabl sati es shown concept class learnabl expect model mistak bound agnost learn model variant relev practic appli assum label train exampl target concept structur model assum data element sampl arbitrari distribut simpli ect distribut data occur assum label gener pac goal approxim correct class term gener bound model similar discuss case learn set train perform evalu set unseen exampl hope classi er learn train set perform unseen exampl base basic theorem learn theori state train data test data sampl good perform larg train sampl good perform test data good di erenc perform train data test data paramet measur rich hypothesi class simpli cite uniform converg theorem size train sampl ln ln probabl error constant class combinatori paramet measur rich evalu section train small train set optim face detect studi larg train set theori quanti es depend perform size train data studi exhibit di erent algorithm approach fair small number exampl learn scenario input space imag goal learn de nition evalu output appl target function complex term input space depend relat inform quanti ed predic year research learn shown ecient learnabl complex function feasibl learn scenario learn ect directli term raw input learn target de nition term intermedi gener input imag learn simpler function quantifi learnabl term express intermedi function learn top make explicit requir intermedi learn instanc space space relat function view indic function de ning subset element map relat activ transform repres collect relat activ write explicitli relat activ domain ahead time nite domain situat domain element simpli imposs write relat ecient construct relat gener function de nition collect relat function map map set element satisfi thought de ne larg space relat present instanc concret gener correspond vertic edg size imag list edg present imag produc learn approach present algorithm class function repres dnf formula space relat impli pac learn proof case simpler section learn gener function linear threshold function conjunct relat discuss theoret result expand case machin learn literatur relat call featur term boolean predic higher order variabl simpl function relat de nition set relat gener set collect element polynomi cm class function disjunct call cm polynomi explain exist ecient algorithm function cm posit output necessarili probabl probabl ip algorithm note abstract gener conjunct nition gener conjunct simpl relat possibl learn top argument literatur ectiv potenti biolog plausibl element gener algorithm call suppli learn algorithm de nition implement assumpt abstract introduct algorithm procedur part small set syntact simpl de imag output instanti present imag requir output explan class cm implement assum simpl relat assumpt veri ed paper algorithm note function class cm note function class cm disjunct de nition requir output algorithm satisfi independ consid import clear analyz learn algorithm theorem cm polynomi explain cm expect learnabl cm polynomi explain algorithm output term cm learnabl algorithm similar algorithm present learn disjunct nite attribut model algorithm maintain hypothesi disjunct initi receiv algorithm predict predict updat mistaken proce execut algorithm assumpt cm polynomi add output remov sati ed analysi algorithm straight forward case subtl gener analyz algorithm rst disjunct case work note activ target function remov posit algorithm output probabl expect number mistak made posit exampl impli expect total number includ execut algorithm mistak neg result remov includ expect number expect total number mistak made algorithm note case number mistak bound algorithm conceptu similar main di erenc hypothesi gener linear threshold function element restrict disjunct drop element weight updat detail process crucial approach feasibl larg scale domain robust order expand theoret result appeal result modi ed case nite attribut domain target function disjunct element result hold improv mistak depend number element relev gener linear function behavior hold addit depend margin posit neg measur space detail robust realist learn framework support di erent kind input kind studi literatur context pac algorithm type shown robust studi type classi cation exampl assum learn algorithm label ip smaller learn framework shown robust kind realist case attribut descript input corrupt type relev current case learn term output introduc attribut relat note give bound case di erent execut belong di erent explain seemingli strong requir de nition import object recognit speci attribut model type occur object front target object formal notion concept obtain ip activ relat label gener origin introduc theorem class cm learnabl virtu polynomi explain learnabl exampl target class clutter attribut constant proof extens argument robust attribut case nite attribut model basic show algorithm work noisi number ip relat impact number exampl algorithm requir stop make mistak theori practic issu address order exhibit practic learn framework rst avail varieti extract data primit visual pattern di erent express simpl function de ned top discrimin object mention basic assumpt underli work hard work illustr approach util simpl edg detector issu composit complex relat primit crucial complex function term instanti relat learn simpl function descript composit languag support composit restrict famili conjunct encod structur relat imag left discuss work gener conjunct restrict size work assumpt gener famili discrimin featur issu learnabl focu work learn situat number relat composit potenti ect larg small number relev realist learn approach cient learn complex exampl requir depend number relev featur global number featur domain phrase depend gener qualiti number exampl observ featur ecient algorithm gener observ small number exampl realist learn approach domain variabl input size reason learn term relat gener imag make learn approach write featur deal variabl input size learn scenario comput ecienc potenti featur activ variabl input size complex evalu learn hypothesi instanc depend number activ featur input total number domain learn approach work develop snow learn architectur snow speci calli tailor learn domain potenti number featur part unknown nite attribut learn model speci algorithm receiv label instanc instanc present list activ featur label member discret set valu object identi domain instanc set evalu gener collect relat activ gener element list uniqu identi activ element present learn procedur learn level snow learn architectur snow network winnow learn architectur network linear unit common ned increment learn featur space node input layer network typic repres relat input instanc input featur linear unit call target node repres concept interest input current target node repres de nition object term element featur extract imag input input instanc map set featur activ present input layer snow propag target node target node link weight edg input featur fi set featur activ link target node linear unit activ weight edg connect ith featur target node threshold target node snow unit includ collect target relat featur space treat autonom target label treat posit unit neg rest target node subnetwork predict subnetwork deriv polici snow view predictor applic separ cha grain unit target subnetwork target object de ne di erent compet target object snow learn polici updat rule snow success variant littleston winnow updat rule multipl updat rule tailor situat set input featur nite attribut model mechan implement architectur snow input featur alloc data driven input node featur alloc featur activ input sentenc link exist target node featur activ label import properti architectur complex process depend number featur activ independ total number observ life time system import domain total number featur small number activ winnow updat rule addit threshold target updat promot paramet demot paramet updat current target set weight mistak predict made fi set activ featur link target node algorithm predict receiv label activ weight current promot multipl algorithm predict receiv label activ weight current weight unchang kei featur winnow updat rule number exampl requir learn linear function grow linearli number relev featur logarithm total number featur properti crucial domain number potenti featur small number relev number exampl requir converg linear separ separ data scale log winnow learn ecient linear threshold function robust presenc kind case function make perfect classi maintain depend number total relev attribut target subnetwork learn network support mechan select domin activ target node snow unit mechan produc nal predict applic support mechan cach output process output snow unit produc coher output figur provid detail snow learn architectur snow learn architectur successfulli varieti larg scale problem natur languag domain recent attempt problem visual domain object notat set potenti featur ft set target set featur link target net target activ activ level target snow ft net tg snow network fi repres list activ featur figur object notat final note crucial main topic snow learn architectur gener approach gener featur defend neural plausibl mind snow repres object unit connect physiolog fact ring rate neuron inhibitori ect featur occurr object consequ weight updat rule snow unit chang sign gener featur conjunct simpl binari detector snow unit suggest ectiv potenti biolog plausibl object recognit object combin ect illumin scene shape properti chang rigid pose illumin vari scene recognit method attempt data observ di erent pose illumin condit learn compact model object resolv recognit problem view point observ number scheme develop recogn object poggio edelman show object recogn raw intens valu imag call network gener radial basi function argu demonstr full structur object estim view object provid turk pentland train evalu train evalu evalu evalu figur train evalu train learn phase network construct weight adjust evalu phase network observ conceptu run line train network evalu exampl build block procedur activ procedur predict posit neg predict neg posit procedur set link featur set initi weight procedur predict winner argmax predict figur main procedur demonstr human face repres recogn repres face imag vector pixel eigenfac eigenvector largest eigenvalu comput covari matrix sampl vector attract featur method eigenfac learn sampl imag pixel featur select eigenspac approach di erent vision task face recognit object track nayar develop parametr eigenspac method recogn object directli object set imag object di erent pose obtain train exampl eigenvector comput covari matrix train set set imag project low subspac span subset object repres manifold compact parametr model construct interpol point subspac imag test object project subspac object recogn base manifold li subset columbia object imag librari show object recogn accur contrast algebra gener learn method support vector machin problem rst appli svm recogn object imag demonstr potenti approach visual learn verri svm object recognit experi subset dataset train set consist imag object test set consist remain imag object random select object system achiev perfect recognit rate comment section subset van hull compar perform svm di erent input success compar approach present present svm method detail support vector machin support vector machin gener learn method pattern recognit regress problem base theori structur risk minim section function describ train data belong set function low vc dimens gener small expect recognit error unseen data input space base svm systemat approach linear function belong set function form lowest vc dimens linear classi er comput nice properti explicitli quantifi vc dimens function class term minim distanc posit neg point data linearli svm provid function approxim map input vector high featur space linear hyperplan separ data exist extend case hyperplan result high dimens space separ data point set sampl input vector svm aim separ hyperplan properti distanc point class maxim vapnik show maxim margin distanc minim vc dimens contribut gener problem nding optim hyperplan pose constrain optim problem solv quadrat program techniqu optim determin class label data point form kernel map origin instanc space high sgn function output posit input construct optim hyperplan determin nonzero sampl vector correspond nonzero call support vector optim hyperplan small number support produc compact classi er kernel function avoid explicitli blow order reach state sampl linearli separ kernel form nonlinear function comput origin low dimens space hyperplan construct linear kernel function simpli dot product vector input space kernel polynomi function radial basi properti nonlinear construct varieti learn coincid classic architectur result drawback kernel function svm interest kernel function advantag svm theoret point studi linear found perform level kernel due fact higher level kernel sensit tting requir exampl gener snow svm worthwhil discuss similar di erenc comput approach experi develop expect di erenc result conceptu learn method similar search linear function separ train data base induct principl perform train data classi er low express result good gener data sampl distribut method work blow origin instanc space high attempt linear classi er space rise signi di erenc method close rel addit updat algorithm perceptron kernel explicitli multipl updat rule snow kernel explicitli signi snow variabl input featur space turn snow signi cantli ecient current svm implement notion gener transform kernel work conjunct polynomi issu method determin coecient linear classi er implic gener abil weight determin base global optim criterion aim maxim quadrat program scheme snow make algorithm attempt minim number mistak train loss function determin weight updat rule trace maximum entropi principl implic svm optim linear snow signi advantag featur relev domain number train exampl snow gener learn sucient exampl method compar practic svm binari classi snow classi er fair snow binari classi er evalu columbia object imag librari experi dataset consist color imag object imag object pose interv pose object imag normal larger object dimens ts imag size pixel figur show imag object frontal pose angl highlight object figur consid dicult recogn object includ experi color imag convert imag pixel pixel figur show imag object frontal pose angl highlight object figur consid dicult recogn object includ experi color imag convert imag pixel experi figur columbia object imag librari consist object vari pose object shown row order highlight consid dicult recogn verri ground truth dataset rst dicult recogn object coil dataset consist larg number object vari shape size object imag di erent pose recognit method train remain imag test turn sampl condit recognit problem dicult imag instanc belong object close imag space data point repres imag object veri ed experi simpl nearest neighbor classi er euclidean result averag recognit rate error figur show object misclassi ed nearest neighbor method avoid nearest neighbor method requir lot memori store templat recognit time complex high goal simpli show simpl method compar complex svm approach case sampl recognit problem comparison di erent method tabl recognit rate nearest neighbor classi er object object shown randomli select figur object coil select coil recognit rate figur mismatch object nearest neighbor method mean object view angl recogn object view angl show error test made nearest neighbor classi er view object train set interest pair object nearest neighbor method misclassi ed similar geometr con gurat similar pose close inspect show recognit error made pack bottl car sampl case easier method set select object experi direct ect recognit rate account evalu result subset object coil dataset experi tabl show recognit rate nearest neighbor classi er experi pose object templat remain pose test baselin experi decid perform comparison case number view object train limit preliminari result present experi setup appli snow object recognit requir architectur chosen input imag perform object recognit associ target unit target object target learn de nition object term input featur extract imag de ne singl snow unit target subnetwork di erent target de ne di erent compet target object approach advantag requir lot comput architectur select ect train learn de nition object make neg exampl object part unit make di erenc compet object hundr chanc spuriou mistak view point higher signi advantag term space complex appeal evalu mode svm classi er pattern recognit train binari classi er compar perform method order maintain fair comparison perform scheme snow unit size classifi test competit machin perform winner determin label test instanc recognit rate svm snow base method shown tabl perform scheme train classi er method evalu classi er test instanc result tabl show recognit rate method linear dot product kernel nearest neighbor classi er dataset import paramet vari number view object train rest view object test tabl result classi er object dataset test test test test snow linear svm nearest neighbor result show method perform method view object present train outperform method number view limit recognit rate number view train worth notic snow svm capabl recogn object dataset satisfactori perform view provid fairli robust limit number view perform method degrad gracefulli provid insight note input vector serv support vector potenti featur activ case show advantag gain architectur small number relev care snow output hypothesi reveal addit potenti advantag snow architectur learn learn predict scheme build hierarch shown tabl impli signi degrad perform find make predict scheme import issu futur exploit advantag approach tabl recognit rate snow learn paradigm snow result edg extract horizont vertic edg length encod featur conjunct edg number potenti featur sort averag activ object dataset reduc comput cost featur vector prune frequent occur featur retain imag tabl show perform method conjunct edg repres object vari number view object train rest view object test result conjunct edg provid inform object recognit snow learn good object featur result exhibit rel advantag number view object limit tabl result classi er object dataset test test test test snow conjunct edg snow intens valu linear support vector machin nearest neighbor model test learn framework select set object dataset add arti cial experi data object imag train remain imag test object imag occlud strip control paramet denot angl denot percentag occlud denot locat center denot intens valu strip figur show object imag occlud object imag gg figur object imag edg map snow classi er test dataset tabl show result set object view recognit perform degrad slightli note object nearest neighbor classi er make mistak tabl result snow classi er occlud imag view object recognit rate recognit rate snow futur work main contribut work view learn framework visual learn exhibit feasibl approach learnabl rigor studi make assumpt distribut observ object pac learn hypothesi perform natur depend prior experi import featur approach learn studi directli term raw speci object select set object nearest neighbor classi er make object data respect intermedi extract quanti ed term abil gener express intermedi make explicit requir learnabl research vision concentr studi intermedi evalu approach demonstr feasibl larg scale experi context learn object recognit experi perform fair comparison success relat learn method studi context object recognit illustr approach larg scale studi snow learn architectur learn object clear object recognit isol ultim studi show potenti comput approach basi studi support realist visual infer note fair comparison di erent present experi ectiv robust start point futur research question work gener support challeng recognit intent exhibit gener approach direct complex intermedi bene futur work recognit robust recognit type framework develop gener explan allud featur learn repres varieti comput process inform sourc oper imag depend local properti rel posit primit extern inform sourc context variabl theoret support appli intermedi learn stage hierarch process order gener explan work assum syntact simpl term raw imag explan syntact simpl term learn infer give rise hierarch pursu approach put visual knowledg instanti framework view kei futur research question suggest line work refer angluin comput learn survei select bibliographi proc annu acm sympo theori page acm blum learn boolean function nite attribut space machin roth snow learn architectur technic report uiuc comput scienc roth relat facilit learn proc intern confer principl knowledg page cort vapnik support vector network machin edelman learn recogn object exampl ieee transact pattern analysi machin geman grade learn object detect ieee workshop statist comput theori freund schapir larg margin classi cation perceptron algorithm proc annual acm workshop comput learn page gold roth winnow base approach spell correct machin special issu machin learn natur languag haussler theoret gener pac model neural net learn applic inform septemb warmuth model polynomi learnabl workshop comput learn page august hasti tibshirani classi cation coupl confer advanc neural inform process page mit kearn li learn presenc malici error siam journal roth learn visual concept dnf formula machin michael robert linda selli ecient agnost learn machin warmuth exponenti gradient versu gradient descent linear predictor proc annual acm symp theori warmuth perceptron algorithm linear logarithm mistak bound input variabl relev proc annu conf comput learn page acm littleston learn quickli irrelev attribut algorithm machin littleston redund noisi attribut linear threshold learn winnow fourth annual workshop comput learn page nayar visual learn recognit object intern journal comput learn approach shallow joint confer empir method natur languag process larg page june object recognit system ieee intern confer robot poggio edelman network learn recogn object verri support vector machin object recognit ieee transact pattern analysi machin van hull object recognit support vector machin ieee intern workshop neural network signal rosenblatt probabilist model inform storag organ brain psycholog neurocomput roth learn resolv natur languag uni ed approach proc fifteenth nation confer arti cial page roth part speech tag network linear separ intern confer comput page support vector learn phd informatik der technischen universitat learnabl visual concept ieee transact pattern analysi machin turk pentland eigenfac recognit journal cognit ullman comput pattern invari structur neural valiant theori learnabl commun novemb vapnik estim depend base empir data vapnik natur statist learn theori ahuja learn recogn object snow sixth european confer comput page ahuja face detector confer advanc neural inform process page mit ahuja object recognit snow fourth asian confer comput volum page
ML/1265 6 journal artifici intellig research submit publish paramet learn logic program model sato dept comput graduat school inform scienc tokyo institut technolog tokyo japan abstract framework statist paramet learn logic definit program probabilist fact distribut extend tradit herbrand model semant logic program distribut semant world semant probabl distribut applic arbitrari logic program includ bayesian network em graphic em run class logic program repres sequenti process independ run data structur call support graph describ logic relationship observ learn paramet comput insid probabl gener logic program complex analysi show combin search explan graphic em time complex exist em algorithm algorithm singli connect bayesian network develop independ research field learn experi corpora moder size graphic em algorithm significantli outperform algorithm introduct paramet learn common field neural network reinforc learn statist tune system classifi statist model unlik numer system mathemat formula symbol typic amen kind paramet learn literatur paramet learn program paper attempt incorpor paramet learn comput program reason twofold theoret add abil learn comput author step build intellig system practic broaden class probabl numer model complex phenomena gene consum natur languag process ai access foundat morgan kaufmann publish reserv sato type learn statist paramet learn appli logic program assum fact program probabilist true distribut definit true encod law pair blood type gene blood type call logic program type logic program statist model ground atom provabl program repres observ blood type paramet program infer perform ml estim observ atom probabilist framework sketch term statist abduct amalgam statist infer abduct probabilist fact plai role primit statist abduct power subsum framework hmm markov context free man bayesian network freedom arbitrarili complex logic program model semant basi statist abduct distribut semant introduc sato defin probabl set truth assign ground atom enabl deriv em algorithm ml estim call graphic em algorithm paramet learn statist abduct search em learn logic program phase search explan observ redund phase elimin tabul partial explan search return support graph compact discov explan run graphic em algorithm support graph logic program definit program definit program set definit definit form ln ln atom call ln bodi variabl quantifi read ln hold case call unit gener bodi negat atom program includ gener call gener program familiar synonym logic adject mean variabl abduct mean infer explan set observ formal search explan atom repres kb knowledg base conjunct atom chosen class formula primit flach consist kb exist model framework restrict limit type compar arbitrari logic program section bayesian network hmm stochast lack variabl data structur logic program haddawi framework assum domain finit function symbol prohibit stand class iter algorithm ml estim incomplet data paramet learn logic program model learn paramet distribut program redund phase remov introduct insid probabl logic program comput support graph graphic em algorithm combin search time complex special algorithm hmm algorithm gener conduct learn experi real outperform algorithm order magnitud term time iter updat paramet result enhanc prospect model logic program complex system stochast grammar model difficult simpli lack model tool sheer complex contribut paper ffl distribut semant logic program unifi exist ffl graphic em algorithm tabul gener effici em algorithm run support graph ffl prospect suggest learn experi model learn complex phenomena rest paper organ preliminari section probabl space logic program construct section mathemat basi subsequ section em graphic em logic program section complex analysi graphic em algorithm present section pseudo section result paramet learn graphic em algorithm real corpora demonstr effici graphic em algorithm state relat work section section reader assum familiar basic logic program probabl theori bayesian network stochast grammar man preliminari subject intersect logic program em learn separ preliminari logic program logic program db set definit execut search sld refut goal interpret select pseudo context sensit extens charniak carrol shorthand singli connect bayesian network deal gener logic program paper sato goal unfold subgoal nondeterminist chosen comput result sld answer substitut db refut search space refut sld tree infinit depend program goal applic requir solut natur languag process parser find tree sentenc syntact correct similarli statist examin explan determin solut obtain search entir sld choic search strategi standard logic program backtrack search solut conjunct fix search order goal due simplic implement problem backtrack forget previou choic prove goal result exponenti search time answer avoid problem store comput result instanc memoiz scheme sagona ramakrishnan shen prove subgoal search drastic reduc search time refut top goal includ common logic program code hmm string exist exponenti transit path output search appli program time linear length find unlik exponenti time prolog backtrack search statist viewpoint statist prove structur share bring structur share explan addit reduct search time mention produc highli compact explan em learn distribut multinomi distribut normal distribut provid conveni model devic statist random sampl size random variabl drawn distribut unknown observ determin ml estim mle likelihood maxim likelihood thing difficult data incomplet probabilist relationship observ effect symptom medicin assum uniqu determin incomplet carri inform complet determin joint distribut task perform ml estim condit solut ambigu answer substitut prove atom paramet learn logic program model observ random sampl size drawn margin distribut mle obtain maxim likelihood function mathemat formul alik ml estim incomplet complic direct maxim practic imposs case peopl indirect approach tackl problem ml estim incomplet data em algorithm standard solut mclachlan iter algorithm applic wide class distribut includ multinomi distribut normal distribut mle comput replac iter tractabl step calcul function introduc current paramet def ln maxim function updat argmax updat necessarili iter likelihood assur monoton em algorithm perform local varieti set due simplic good perform notic em algorithm class form depend distribut applic develop concret em algorithm algorithm hmm algorithm requir individu effort case function relat ml estim assum observ jensen inequ concav ln ln ln ln ln ln ln ln ln ln ln sato distribut semant introduc logic program defin declar semant basic idea start set probabilist fact set definit sampl determin set true herbrand model determin truth atom db atom consid random formal process construct underli probabl space denot db basic distribut db definit program languag countabl function symbol predic symbol set unit set simplic db set ground instanc assum consist countabl infinit ground finit case similarli construct probabl space db step introduc probabl space herbrand interpret truth assign ground atom extend probabl space herbrand interpret ground atom model semant fix atom regard infinit vector hx herbrand interpret true set herbrand interpret coincid cartesian def construct probabl measur sampl collect finit joint distribut equat call compat condit prove compat condit exist probabl probabl measur minim oe algebra open set herbrand interpret interpret function symbol uniqu function ground term assign truth valu ground atom interpret function symbol common herbrand correspond truth assign ground atom distinguish topolog space product topolog equip discret topolog paramet learn logic program model call basic distribut choic free long compat condit met interpret set hx result uniform distribut unit interv stipul interpret hc xn ow place probabl mass probabl rest defin logic program definit program db set unit set head unifi unit basic distribut obtain collect joint distribut satisfi compat condit complex flexibl cost tractabl choic finit distribut made sato bs bs bs repres probabilist binari bernoulli atom true trial paramet probabl switch result probabl measur infinit product independ binari outcom simpl express bayesian markov chain hmm sato extend extend probabl measur world set truth assign ground atom pf probabl partli reflect observ behav infinit joint distribut pf infinit random vector xn margin distribut reason intuit appli defin subsect necessarili ground sato herbrand model coupl notat atom defin herbrand interpret make atom true set atom made true imagin definit program db herbrand model db db fix point map db db def fi fi fi fi fi db fb set ground atom induct defin db db account fact db function henceforth emploi function notat denot db turn ground atom db similarli cartesian product identifi set herbrand interpret ground atom world extend probabl measur db introduc seri finit joint distribut db xn def xn db def xn note set xn db satisfi compat condit db db exist probabl measur db extens xn xn herbrand interpret ground atom true herbrand model program herbrand interpret make ground instanc program true note ground atom paramet learn logic program model finit atom binari vector hx defin denot program db wrt denot semant logic program defin call distribut semant remark regard kind infinit joint distribut mathemat properti list appendix semant prove extens standard model semant logic program world semant probabl measur program distribut distribut semant view logic program express distribut distribut express mathemat formula program distribut freedom flexibl mathemat formula construct distribut arbitrari composit program infinit random variabl probabilist atom describ stochast process potenti involv infinit random variabl markov chain deriv program enabl procedur express complic constraint distribut sum occurr alphabet output string hmm multipl procedur express arbitrarili complex model provid mathemat sound semant logic program implement distribut semant tractabl investig condit logic program make probabl comput make usabl mean larg scale model graphic em algorithm logic program db languag basic distribut herbrand interpret ground atom specifi distribut herbrand interpret step effici em algorithm paramet learn logic program interpret distribut observ event em algorithm term graphic em algorithm applic arbitrari logic program satisfi condit provid basic distribut direct product random slight complic binari introduc section section assum db consist usual definit variabl definit relat assumpt infinit deriv occur simpl fp start termin rewritten probabl ss probabl probabl occurr infinit deriv calcul max sato list predic introduc iff iff definit iff def vector variabl length equal ariti vector variabl occur defin def fb ground instanc head rg iff def head rg def function function ft term properli xg def iff clark equat theori deduct simul unif theori deduct simul sld refut replac head atom bodi introduc definit frequent atom explan wrt db conjunct set ae hold proper subset satisfi set explan call support set design motiv review distribut semant concret program db figur model blood type determin blood type gene probabilist inherit parent state blood type determin pair blood type gene blood type genotyp oi ai proposit rule state gener rule term logic variabl valu event genotyp gene gene connect rule probabilist fact gene inherit parent choic repres made definit support set differ sato sato implicitli procedur read logic prolog convent emploi stand string begin capit letter quot constant underscor anonym variabl abbrevi random express probabilist choic finit altern framework statist atom abduc explan construct conjunct paramet learn logic program model figur abo blood type program db genet knowledg choic chanc made og express joint distribut def father mother probabl inherit gene parent statist independ choic father express put atom repres observ observ infer explan minim conjunct abduc obtain appli special sld refut procedur goal preserv atom resolv refut explan found support set fs probabl explan comput proposit appendix sato fact mutual choic gene determin ml estim perform random sampl argmax db db argmax program function symbol semant program hmm simplifi condit db figur simpl probabl comput easi gener case primari interest effici paramet learn logic concentr identifi properti program make probabl comput easi db make effici paramet learn answer question formul model process exist phenomena gene inherit hope construct probabilist comput model target predic ground atom repres observ phenomena explain empir distribut write logic program db basic distribut paramet reproduc observ pattern observ random sampl ground atom adjust ml maxim likelihood approxim close empir observ distribut formul realiti event observ put likelihood simpli distribut random realiz random variabl quick remedi note case blood type program db observ true atom atom collect behav singl random variabl distribut valu introduc condit set ground atom repres observ event call observ atom uniqu paramet learn logic program model uniqu condit enabl introduc random variabl repres observ fix observ atom defin iff db random sampl size qualifi likelihood function wrt condit concern reduct probabl comput addit blood type comput summat explan support set introduc support set condit proposit appendix model point mean singl singl explan true observ introduc set explan relev def fix explan proposit uniqu condit condit introduc uniqu condit condit random variabl repres explan defin iff db condit concern termin measur gk satisfi gk put valu set measur affect part discuss appli definit xe sato finit support finit comput support set fs sm finit summat condit prevent infinit summat comput fourth condit simplifi probabl comput multipl recal explan conjunct abduc fa ae order reduc comput multipl assum distribut set ground atom distribut atom intend simul random switch outcom trial gener primit probabilist event coin toss dice roll consist probabilist atom argument ground term call switch switch assum finit set ground term call set hold write fv jv ground atom true trial paramet probabl true ground term random variabl independ introduc famili finit distribut xm def xm ow jv defin infinit product def comput probabl explan product paramet conjunct explan independ construct independ construct whichev condit comput paramet paramet learn logic program model model principl introduc uniqu finit support condit distribut simplifi probabl comput easi satisfi adopt assum distribut introduc previou subsect rest satisfi automat model experi mildli difficult satisfi uniqu condit condit long obei model principl model db describ sequenti process auxiliari uniqu produc observ atom express atom translat program care write program sampl uniqu exist goal success refut db confirm principl blood type program db describ process gene arbitrari sampl exist uniqu success sld refut idea principl process produc result observ process differ entail mutual observ atom uniqu condit condit automat satisfi satisfi finit support condit difficult virtual write program db solut search termin appar gener solut specif model bayesian network met program model satisfi finit support condit condit condit revisit discuss relax simplifi condit introduc subsect flexibl model examin uniqu condit crucial role adapt em algorithm semant uniqu condit exist map explan observ em algorithm applic relax uniqu condit justifi applic em algorithm assum mar condit introduc rubin statist condit complet data incomplet data assum implicitli explicitli statist appendix assum mar appli em made process finit subset sato algorithm observ uniqu condit seemingli destroi mar condit action simpl imagin walk road front observ state road dry assum water run probabilist program db rl rl rl figur describ sequenti process output observ road rl wet wet dry rl figur db rl basic distribut rl subsect omit program determin rain determin work fine sampl valu uniqu exist observ map yi appli em algorithm observ happen observ state road mean observ appar uniqu condit compat true appli em algorithm mar case translat observ road randomli state briefli check condit basic relax cost comput condit addit process transform support set goal set explan explan transform transform exponenti number atom effici concern lead assum condit finit support condit practic condit sld tree finit relax condit induc infinit comput transform disjunct atom paramet learn logic program model relax distribut condit accept probabl distribut serv expand horizon applic logic program introduct joint distribut boltzmann distribut switch valu make correl distribut facilit write logic program complic process independ interdepend learn ad flexibl distribut deserv learn time naiv approach em learn deriv concret em algorithm logic program db assum satisfi uniqu condit finit support condit introduc random variabl repres observ base fix observ atom introduc random variabl repres explan base fix explan understand joint distribut denot relev paramet section deriv concret em algorithm function defin def ln input random sampl observ atom output mle sake substitut observ atom write substitut explan write uniqu condit notat explan defin count oe def jf prepar make observ put def fi tg def set switch explan denot paramet switch finit due finit support condit sato probabl function comput proposit appendix assumpt fi fi fi oe def ln ln ln def jensen inequ obtain note expect count sld refut speak likelihood function shown subsect impli reach procedur find mle paramet arrai variabl store current procedur begin initi valu small posit number ln comput repeat foreach foreach updat paramet ln comput termin converg end em algorithm simpl correctli calcul mle calcul suffer combinatori explan db grow exponenti complex model db hmm state exponenti length string suppress realiz effici comput polynomi order suitabl avoid multipl comput subgoal paramet learn logic program model insid probabl probabl logic program gener notion insid probabl probabl logic program major comput term line comput redund naiv comput term show proposit program db mg observ atom assum independ bg dg support set calcul fa light comput fp fp fp fp comput requir multipl fp fp fp addit comput effici factor common comput ground atom defin insid probabl def appli theorem appendix hold independ assumpt made equat insid probabl deriv obtain solv multipl addit requir straightforward gener program db observ atom atom comput wrong ignor fact bodi mm mutual atom bodi mm independ set equat total incorrect note fact sato temporarili assumpt top condit finit support condit equat mathemat correct assumpt bodi mutual assumpt bodi atom hold note subsect special mean intend goal tabl explan obtain search explain subsect addit condit sourc program result search auxiliari comput satisfi occur db atom theorem appendix assumpt ensur suggest consid function equat insid probabl hierarch organ belong top layer left hand side refer belong lower layer refer condit acycl support condit acycl support equat form uniqu comput insid probabl advantag intermedi result store contribut faster comput tackl intric comput sum equal concentr comput def note explan express depend gener observ arbitrari ground introduc probabl ground atom wrt def logic relationship correspond tabl atom paramet learn logic program model assum condit insid probabl view problem comput reduc comput comput occur ground program db bk bk function chain rule deriv lead bk insid probabl probabl comput top downward program layer case db chosen comput desir sum calcul requir multipl addit compar multipl addit naiv comput gain obtain comput insid probabl small problem size addit restrict result search search comput insid probabl program level tabul mechan partial explan independ assumpt bodi independ sato subgoal henceforth deal program db set tabl predic declar advanc ground atom tabl predic call tabl atom tabl atom store support set elimin construct hierarch organ explan made tabl atom atom db logic program satisfi finit support condit uniqu condit random sampl observ atom make addit assumpt exist finit set tabl atom conjunct ffl subset support put call db def set tabl atom set denot function tabl atom ffl mutual ffl conjunct independ atom assumpt aim effici probabl comput acycl support condit make dynam program condit reduc independ condit reduc point effici note comput dynam program proce partial order db acycl support condit access tabl atom simplifi linearli order topolog sort db respect partial order call linear db satisfi assumpt acycl support condit independ hierarch system write db assum implicitli hierarch system successfulli built prefix abbrevi independ mention concern posit proposit independ execut wrt db invok directli indirectli hold paramet learn logic program model sourc equat insid probabl probabl automat deriv solv time proport size equat plai central role approach effici em learn obtain search complet refut method logic program goal call set entri solut tabl store answer substitut call instanc occur stop solv retriev answer substitut store solut tabl unifi record remain answer substitut prepar lookup tabl hold pointer detail search sampl program db figur depict hmm figur hmm state state probabilist destin figur state hmm gener string set initi state enter loop clock output state transit put clock ahead continu loop finish loop clock figur state hmm program db temporari part program hmm defin probabl distribut string set work stochast string gener output string sampl defin distribut sato alphabet bg emit note fact set distribut introduc notat declar atom form fv distribut subsect introduc atom program ground ground term distribut program run prolog program function stochast string gener return list alphabet variabl call select initi state execut subgoal return si initi state probabilist chosen call ground ground make probabilist choic output alphabet determin stop transit length output string fix execut term sampl execut correspond random sampl ground work return success failur explan sought atom resolv refut conjunct repeat process backtrack refut found backtrack abandon share partial explan imposs search figur translat program db call ground ground logic behav random variabl instanti term probabl select set declar valu atom ground term procedur semant equal paramet learn logic program model search case hmm program build hierarch system declar tabl predic conjunct atom atom translat program logic analog translat definit grammar prolog add argument form predic accumul atom tabl atom conjunct translat appli db yield program figur translat correspond input string tabl atom return auxiliari add tabl atom form time tabl predic origin tabl predic translat program auxiliari predic tab insert signal interpret check solut tabl check exist pair insert correspond figur solut tabl mean predic ariti share predic predic sato appli search note ad influenc associ solut tabl atom solut tabl list result solut tabl shown figur row read call occur enter solut tabl variabl bind remain task topolog sort tabl atom store solut tabl respect acycl support condit search obtain hierarch system support graph comput insid probabl hierarch system essenti boolean combin primit event compound event intuit graph visual learn introduc term support em algorithm subsect sole hierarch system illustr figur support graph graphic hierarch system db consist total order disconnect label tabl atom db subgraph label special node start node end explan explan graph linear graph node label tabl atom switch call tabl node switch node figur support graph obtain solut tabl figur tabl node label refer subgraph label achiev distinct tabl node refer subgraph graphic em algorithm describ effici em learn algorithm term graphic em algorithm introduc sato run support graph random sampl observ atom support graph hierarch system satisfi acycl support condit independ successfulli construct logic program db satisfi uniqu condit finit support condit graphic em algorithm refin introduc comput insid probabl comput probabl call main routin prepar arrai support graph ffl insid probabl paramet learn logic program model start start start end end end start start end end explan graph figur support graph gener hmm program db node refer tabl node ffl probabl wrt ffl explan probabl sato procedur begin select initi ln repeat foreach foreach ln end procedur begin begin begin foreach begin fa sj sj end foreach end end end procedur begin begin foreach foreach begin fa sj sj end foreach end end figur graphic em algorithm ffl expect count call procedur figur main routin initi comput insid probabl enter loop call comput expect count paramet updat insid probabl renew updat paramet enter loop paramet learn logic program model subroutin comput insid probabl store tabl atom bottom layer topmost layer hierarch system subsect conjunct multipli insid probabl comput subroutin comput probabl definit subsect store probabl tabl atom set probabl comput rest probabl layer subsect add expect count contribut increment probabl equat notic comput shown subsect mle theorem hold theorem db logic random sampl observ atom condit finit support acycl independ met find mle maxim likelihood sketch main routin comput show equat qed fact formal proof prove common paramet coincid paramet updat valu start initi paramet converg valu sato condit applic graphic em algorithm hard satisfi model principl section due care lead program meet program standard framework bayesian hmm satisfi condit complex analyz time complex graphic em algorithm appli framework includ pseudo bayesian network result show graphic em algorithm competit special em algorithm develop independ research field basic properti em algorithm iter algorithm unabl predict measur time complex time iter estim time iter repeat loop observ support graph scan addit perform multipl perform atom tabl atom time spent iter graphic em algorithm linear size support number node support graph put db def db num def max db def max db recal db set tabl atom db set hand side subsect num maximum number support graph maximum size obviou proposit time complex graphic em algorithm iter linear total size support num coincid space complex graphic em algorithm run support graph gener compar graphic em algorithm em rememb input graphic em algorithm support graph observ actual total learn time time number num paramet learn logic program model denot time construct support graph sum time search time topolog sort tabl part repres time search observ total size support graph exce time search evalu time specif class model time tabl oper observ search paper special tabl atom ground call resolut solv goal solut tabl ffl check goal entri solut call ffl add search list discov gs entri time complex oper equal tabl access depend program implement solut tabl program carefulli written argument tabl atom tabl access integ program subsequ complex analysi subsect db db subsect dbg subsect satisfi satisfi condit replac term integ solut tabl implement arrai tabl access time present detail analysi time complex graphic em algorithm appli pseudo bayesian assum time access solut tabl remark space complex total size solut tabl hmm standard em algorithm hmm algorithm rabin hmm shown figur subsect observ output string length comput lt time iter forward probabl ff backward probabl fi state time step string set state number state factor fact state destin search search atom tabl atom creat solut auxiliari comput time complex number atom tabl atom support graph coincid time topolog sort tabl atom solut tabl search sagona al ramakrishnan al discuss implement arrai balanc give access time number data solut give averag time access condit treat emit symbol depend state emit symbol depend transit treat similarli sato comput forward backward probabl destin state comput ff fi paramet updat total comput time iter algorithm estim lt man compar result graphic em hmm program db figur modif length state declar output alphabet string db read hmm state time output reach final state declar tabl predic translat figur appli search goal top wrt translat program obtain complex argument translat program db talk term db sake simplic fix search strategi strategi assum solut tabl access time length list argument finit choic state transit output search leav finit solut tabl figur satisfi acycl support condit sampl execut wrt db sequenti process made atom independ gener uniqu mean db satisfi independ condit uniqu condit graphic em algorithm applic set hierarch system produc search observ output string put db qg fi fi fi fi fi call pattern call call impli occur call call comput due tabl num appli proposit reach proposit string length tabl oper search time time db lt graphic em algorithm lt time iter number state lt time complex algorithm graphic em algorithm run effici algorithm translat program section identifi goal pattern argument constant algorithm graphic em algorithm input support graph gener updat paramet initi valu paramet learn logic program model viterbi algorithm rabin hmm effici find transit path string similar algorithm logic program determin explan goal deriv run time linear size support case complex viterbi algorithm compar graphic em algorithm algorithm algorithm em algorithm man grammar chomski normal form product rule grammar form number start form termin comput insid probabl probabl partial tree sentenc updat paramet product rule time complex measur time number number termin sentenc observ sentenc compar graphic em algorithm start proposit program db repres largest grammar rule nontermin nontermin start sentenc fi fi fi fi fi fi fi fi fi fi figur program db db artifici program sole measur size tree creat interpret sentenc wl context free backbon cfg probabl assign product rule nontermin product rule fa ff probabl assign ff probabl sentenc sum probabl deriv product probabl rule deriv tree dbg constant occur creat root node sato figur tree queri input sentenc wl program separ treatment affect complex read nontermin span posit posit substr textual order lexicograph order tupl set parser sentenc wl syntact categori make exhaust search queri search multistag search strategi time access solut tabl assum time complex search measur number node tree tree figur illustr atom omit tree similar put note figur due structur node leftmost atom underlin solut solv leftmost atom time entir refut process underlin atom comput left check solut tabl entri prolog variabl constant denot sentenc length tabl predic induct prove comput paramet learn logic program model time execut gener singl child node number node figur number node estim number node newli creat total time search comput size support graph program db figur ground instanc constitut proposit program db db probabilist variant program declar tabl predic semant db specifi probabl distribut atom form list figur probabilist program db sentenc wl wl invok measur length input sentenc call work ident ad suppli uniqu latest current hold substr ad argument affect shape focu rang fi fi fi fi number node number node number node neglig make program simpl assum integ repres ground term sn def assum goal return integ time proport omit obviou program comput length sn list time sato search tree figur extra comput insert time remain size support graph appli graphic em algorithm confirm condit applic appar refut form wrt db leav support graph satisfi finit support condit acycl support condit condit independ condit hold refut process faithfulli simul leftmost stochast deriv wl choic product rule made independ remain uniqu condit confirm program db modif db goal bodi goal move posit bodi db db logic semant viewpoint distribut semant sampl execut interpret wrt db search strategi easi execut refut sentenc wl return set atom resolv refut uniqu determin output sentenc wl sampl execut sampl uniqu gener observ uniqu condit satisfi db db sampl execut grammar gener finit give gener answer paramet valu obtain learn finit stochast deriv termin probabl assum paramet logic program db largest nontermin symbol satisfi applic time sentenc length size support graph proposit conclud proposit db logic program repres nontermin form db figur sampl atom repres sentenc length tabl oper search time search iter time call time call time refut record rule step deriv wl db repres integ ground term made program short integ ground term argument check goal call check time paramet learn logic program model time complex algorithm iter algorithm effici algorithm pseudo improv make choic attempt pseudo probabilist context sensit rule chosen probabilist depend nontermin expand parent nontermin pseudo easili program add repres parent predic figur replac deriv sentenc pseudo sequenti process modifi graphic em algorithm appli support graph gener modifi program observ sentenc correctli perform ml estim paramet pseudo pseudo thought rule form parent nontermin argument previou subsect carri minor proposit db logic program pseudo nontermin shown observ atom repres sampl sentenc length tabl oper search time search iter complet time bayesian network relationship effect probabilist mathemat captur condit probabl effect probabl candid evid calcul theorem bayesian network framework fit type probabilist infer bayesian network graphic joint distribut xn xn finit random variabl xn graph dag acycl figur node random variabl condit probabl tabl repres node repres parent node valu topmost node tabl margin distribut joint distribut defin product deal discret case sato figur bayesian network condit xn xn graph figur defin pg pg valu random variabl mention basic task bayesian network comput margin probabl margin distribut pg comput effici observ graph figur factor comput requir exponenti oper problem comput margin probabl factor assur graph singli connect loop view undirect graph comput time set vertic graph graph call exponenti time comput margin probabl show ffl discret bayesian network defin distribut pg xn logic program dbg predic pg xn acycl lose assum ancestor node hold notat omit random variabl paramet learn logic program model ffl arbitrari factor order comput margin exist tabl program accomplish comput ffl graph singli connect evid exist tabl program dbg time time complex iter graphic em algorithm bayesian network defin joint distribut pg xn fpg condit probabl set valu denot set valu parent node random construct logic program defin distribut pg xn program dbg fg rg shown figur fg rg figur bayesian network program dbg fg atom form probabl condit probabl pg empti list rg bodi conjunct atom correspond product condit probabl note identifi random variabl xn logic variabl xn conveni proposit dbg denot distribut hx xn realiz random vector hx xn hold construct pg pg xn case figur program prolog constant place integ sato sampl execut sampl realiz random vector margin distribut comput ad dbg comput pg add result db comput db equal pg db pg comput correspond factor effici probabl comput factor made carri summat proper order sketch carri summat order introduc joint distribut oe oe oe oe comput atom hope comput sum oe oe elimin introduc comput oe oe comput oe note bodi local variabl head variabl share atom view correspond easi confirm program realiz requir comput easi gener prove exist logic program carri summat order arbitrari bayesian simul ve zhang approach effici comput margin distribut class bayesian singli connect bayesian exist effici algorithm comput margin distribut messag pass show graph singli construct effici tabl bayesian network program dbg assign tabl predic node avoid explain construct procedur inform concentr case interest variabl singli paramet learn logic program model connect graph pick node probabl pg seek construct tree root node node dangl figur show transform tree select node root node transform graph figur transform tree examin node add node graph dbg visit node connect call start root node figur evid gener proce node call origin graph parent node fu child node fv topmost node tree figur gener situat node figur add call parent node gener valu call val call call visit node connect treat visit node connect parent node connect random variabl determin sampl atom jointli index valu sato visit xs topmost node origin add call call val call val call call call call dbg final program appar dbg construct time linear number node network note success unfold atom form call bodi start yield program db similar figur atom call dbg db defin prove proposit pg db hold figur assum construct start topmost node evid chang start node replac call time replac head add goal call bodi chang program db straightforward prove db pg hold true construct tabl program dbg shown crude lot room suffic show logic program singli connect bayesian network run time set node estim time complex search wrt dbg declar predic form call tabl predic verifi condit applic graphic em algorithm estim time complex search goal wrt dbg notic call occur scan node tree call call occur time call call invok call rest xs parent xs children graph caller set variabl call call refer solut store solut tabl time number ad comput step distribut semant base model transform preserv herbrand model transform transform appli logic program preserv denot transform program dbg transform interpret collect atom case hmm program paramet learn logic program model search bound constant case figur result time proport number node origin graph size support provid number edg connect valu random variabl bound proposit singli connect bayesian network defin distribut pg set dbg tabl program deriv number edg connect valu random variabl bound constant tabl access time time comput pg observ random variabl mean dbg time iter requir graphic em algorithm time complex jt time complex requir comput distribut singli connect bayesian network standard algorithm em algorithm conclud graphic em algorithm effici em algorithm singli connect bayesian network quickli add graphic em algorithm applic arbitrari bayesian proposit support graph avoid program case singli connect bayesian network graphic em singl gener em prove time complex special em algorithm algorithm singli connect bayesian network develop independ research field tabl summar time complex em learn search graphic em algorithm case observ repres singli connect bayesian network column show program db hmm subsect db program subsect dbg transform bayesian network program subsect time column time search complet search gem fourth column time iter graphic em algorithm updat paramet number state number nontermin length input string number node bayesian network column standard em algorithm model margin distribut pg variabl construct similar tabl program comput margin probabl time ad convei evid program check condit dbg figur uniqu condit obviou sampl uniqu gener sampl random variabl finit support condit satisfi finit number random variabl valu acycl support condit acycl bayesian network condit independ condit easi verifi sato model program time gem special em hmm db db dbg user model tabl time complex em learn search graphic em algorithm model languag prism develop model prism implement distribut semant sato languag intent model complex phenomena interpret natur languag process gene inherit interact social rule program extens prolog predic includ predic special predic manipul atom paramet prism program model util direct part declar system atom execut model part set definit defin distribut program atom util prolog program refer predic defin model part util part learn predic carri em learn observ atom prism mode execut sampl execut random sampl drawn distribut defin model part comput probabl atom return support set goal execut mode predic report implement graphic em algorithm search mechan complet prolog search section em learn share explan implement put comput problem express learn pseudo bayesian network model current version learn experi section parser substitut independ implement graphic em algorithm learn experi complex analysi graphic em algorithm popular model previou actual behavior graphic em algorithm real data section conduct learn experi paramet learn logic program model corpora contrast compar perform graphic em algorithm algorithm term time iter time updat result graphic em algorithm outperform algorithm order report review algorithm complet algorithm algorithm baker gener algorithm algorithm design estim paramet cfg grammar chomski normal form rule express number start input sentenc wl comput bottom manner insid probabl comput probabl wl manner comput paramet updat process iter predetermin criterion converg likelihood input sentenc achiev baker give analysi young show time iter lafferti prove em algorithm true algorithm recogn standard em train notori slow literatur explicitli state time requir algorithm al report train rule corpu german subordin averag ambigu machin sun sun hour complet iter discuss algorithm slow learn experi corpora report paramet learn exist corpora moder size compar graphic em algorithm algorithm term time iter mention support input em gener parser measur made sun memori solari threshold log likelihood input sentenc set stop criterion em algorithm atr corpu corpu convert po similar size contrast sentenc length ambigu grammar experi emploi atr corpu corpu develop atr short parser tomita parser develop laboratori tokyo institut technolog sato minimum averag length maximum length skeleton emploi context free grammar atr rule nontermin manual develop atr corpu yield algorithm accept cfg chomski normal convert atr chomski normal form atr atr rule nontermin divid corpu subgroup similar length randomli chosen sentenc compar length graphic em algorithm appli atr atr algorithm appli atr term time iter run converg gem gem gem gem figur time iter gem curv figur show learn result length input sentenc averag time em algorithm iter updat paramet support graph gener chosen sentenc paramet grammar left algorithm plot cubic curv label omit curv drawn graphic em algorithm drew middl graph magnifi left graph curv label plot graphic em algorithm appli origin grammar atr label atr length averag sentenc measur whichev grammar graphic em algorithm run hundr time faster time faster case atr time faster case atr algorithm iter graph show linear depend updat time graphic em algorithm sentenc length differ anticip learn speed gap algorithm graphic em algorithm unexpectedli larg conceiv reason atr corpu short sentenc atr paramet learn logic program model ambigu tree gener support graph affect favor graphic em algorithm conduct experi corpu longer sentenc ambigu grammar gener tree corpu articl sentenc process part sampl recent made label corpu compar atr sentenc longer averag length sentenc minimum length maximum length cfg grammar convert chomski normal form grammar develop ambigu coverag length length gem gem figur time iter gem figur show obtain curv experi corpu graphic em algorithm appli algorithm appli condit atr plot averag time iter process sentenc design plot time algorithm averag iter graphic em algorithm averag iter clear middl time graphic em algorithm run order magnitud faster algorithm averag sentenc length give speed ratio sentenc length give speed ratio speed ratio widen compar atr corpu explain mix effect time complex moder total size support graph wrt notic graph show total size support graph grow sentenc length time iter graphic em algorithm linear total size support graph sato implement algorithm faithfulli baker young room improv kita gave refin algorithm implement mark johnson algorithm implement lead conduct learn experi entir atr corpu implement measur updat time iter turn implement run fast naiv implement iter graphic em algorithm order magnitud faster similar comparison entir corpu moment abandon due memori overflow construct support graph learn experi compar time iter ignor extra time search requir graphic em algorithm question natur wrt comparison term total learn time assum iter learn atr corpu estim graphic em algorithm combin parser run order magnitud faster implement kita algorithm estim directli appli graphic em algorithm combin interpret time parser time depend search rough indic graphic em algorithm combin search support domain em learn exam perform gap previou compar perform graphic em algorithm algorithm corpora implement algorithm graphic em algorithm outperform algorithm fact time complex perform gap simpli algorithm slow lack backbon cfg grammar explicitli advantag constraint grammar review insid probabl span word calcul algorithm grammar st grammar probabl product rule bc note fix triplet usual term answer question implement search complet paramet learn logic program model small number determin success rest combin give term nonetheless algorithm attempt comput term iter combin repeat result lot redund kind redund occur comput probabl algorithm graphic em algorithm free redund run tree repres support graph superior learn speed graphic em algorithm realiz cost space complex algorithm requir space arrai store graphic em algorithm space store support graph number nontermin sentenc length understand notic graphic em algorithm appli consid partial evalu algorithm grammar introduct data structur final remark preprocess em learn uniqu graphic em algorithm approach redund compar graphic em algorithm instanc stolck chart comput insid implicitli reconstruct iter dynam combin complet item relat work discuss relat work work present paper logic program probabl enorm bodi work incomplet unavoid review relat work attempt made integr probabl comput logic logic program immedi notic type usag probabl constraint role probabl constraint necessarili seek uniqu probabl distribut logic formula distribut explicitli defin uniqu distribut model theoret mean proof theoret comput probabl proposit typic constraint approach earli work probabilist logic nilsson central entail comput upper lower bound probabl target sentenc oe bound compat knowledg base logic sentenc necessarili logic annot probabl probabl work constraint differ algorithm graphic em algorithm sole comput converg paramet valu start initi valu linguist evalu estim paramet graphic em algorithm report sato al omit literatur lean strongli logic overview sato rang linear program techniqu solv problem inevit delimit applic approach finit domain investig comput complex probabilist entail problem slightli set knowledg base statement form repres show infer tractabl class knowledg base call condit constraint tree influenti work haddawi introduc deduct system probabilist logic remedi nilsson comput intract lack proof system system deduc probabl rang proposit rule probabilist infer uncondit condit probabl rule infer fi ffi proposit variabl design probabl rang turn logic probabilist logic program formal ng subrahmanian subrahmanian constraint approach program set annot form fn basic conjunct disjunct indic probabl rang queri answer extens sld refut assum languag finit number constant predic function symbol similar framework lakshmanan sadri syntact restrict constant predic symbol function uncertainti set annot form atom confid repres belief interv ff fi doubt interv fl ffi expert defin uniqu probabl distribut secondari concern constraint approach sharp contrast bayesian network disciplin rest abil network defin uniqu probabl distribut research bayesian network seek mix bayesian network logic inher proposit express power logic program automat build bayesian network queri program union definit program set condit depend form atom bayesian network construct dynam connect queri relev atom turn defin local distribut connect atom logic variabl atom function symbol haddawi extend approach incorpor mechan reflect context form ff call context atom disjoint comput gener logic program paramet learn logic program model set evid context relev ground identifi resolv context atom sldnf local bayesian network built calcul probabl queri prove sound complet queri evalu procedur condit program acycl domain finit defin local distribut pool defin global distribut horn program consist definit disjoint declar form specifi probabl distribut fh assign probabl ground atom theori logic prove bayesian network framework unlik previou languag function acycl condit program semant defin sever restrict probabl defin quantifi formula bacchu al power probabilist languag annot probabl languag statist quantifi term denot ratio individu finit domain satisfi satisfi assum world equal defin probabl sentenc knowledg base kb limit lim number world individu satisfi paramet judg approxim limit necessarili exist domain show method cope difficulti default reason linguist muggleton formul slp logic extens probabilist logic program annot probabl probabl goal product ps refut modif subgoal invok refut probabl normal enrich slp introduc special class model sld refut wrt goal consid sld refut gener goal defin probabl refut exp number number occurr normal constant probabl assign sum probabl refut condit ground atom assign uniqu integ hold ground instanc form bn program includ write syntact properti variabl head bodi unit ground sato limit potenti problem approach similar limit potenti problem descript power confin finit domain common due linear program techniqu due syntact restrict infinit function predic symbol lakshmanan bayesian network limit finit number random variabl restrict logic program instanc acycl condit pool haddawi prevent uncondit local muggleton exclud program usual membership prolog program type possibl assign conflict probabl logic formula necessarili coincid aa refut troubl naiv interpret probabl true assign probabl arbitrari quantifi formula scope approach slp big problem common approach number gener binari random variabl determin probabl complet joint fulfil requir reliabl number quickli imposs grow situat unobserv variabl model appar paramet learn observ data natur solut paramet learn logic program studi distribut semant sato attempt solv problem line global distribut approach defin distribut interpret ground atom arbitrari logic program order languag assign consist probabl close formula distribut semant enabl deriv em algorithm paramet learn logic program time naiv algorithm deal larg problem difficult exponenti explan observ hmm effici problem solv larg extent graphic em algorithm present paper em learn em learn central issu separ mention work relat em learn symbol framework koller pfeffer approach model em learn estim paramet label express probabilist depend event definit annot similarli haddawi local build bayesian network relev context evid rpm probabl pfeffer koller extens bayesian network infinit random variabl organ attribut class probabl measur attribut valu introduc paramet learn logic program model queri paramet learn appli construct network special em algorithm bayesian network deal static construct bayesian network wellman combin em algorithm method estim paramet construct network singli time complex probabl comput potenti exponenti length input sentenc close relat em learn paramet learn model im algorithm approach probabilist constraint program im algorithm gener paramet estim algorithm incomplet data model probabl function form exp paramet featur observ object normal constant featur function model highli flexibl includ distribut special case price pai comput cost requir summat exponenti term avoid cost exact approxim comput mont carlo method whichev learn time compar em algorithm algorithm em algorithm applic pure normal slp fail deal special class model effici im algorithm statist framework distribut comparison graphic em algorithm difficult slightli tangenti em koller al develop function model languag defin probabl distribut symbol structur show comput result lead effici probabl comput singli connect bayesian network cash correspond comput insid probabl algorithm comput probabl untouch futur direct logic program expect model tool complex phenomena type stochast grammar bayesian model gene inherit rule marriag interact rule genet inherit model flexibl combin atom mean definit greatli facilit model process satisfi condit section ffl uniqu condit yield ffl finit support condit finit number explan ffl acycl support condit sato ffl condit mutual ffl independ condit explan applic graphic em algorithm model experi model principl section effect guid success model obtain declar model compactli high level languag paramet effici learnabl graphic em algorithm shown section futur direct relax applic uniqu condit prohibit gener model failur gener multipl observ event point section mar condit appendix adapt semant replac uniqu condit valid graphic em algorithm complet data uniqu determin observ data case bracket feel research topic investig role acycl condit theoret interest acycl relat learn logic program reddi paper scratch surfac individu research field bayesian network remain clarifi experi research field reflect framework logic program clarifi relationship symbol approach bayesian network spi approach unclear compil approach junction tree algorithm bayesian network incorpor approach exact approxim method probabl comput special logic program develop direct improv learn abil introduc prior ml estim cope data introduct basic distribut make probabilist switch correl worth futur import advantag logic natur approach handl uncertainti shown sato learn paramet neg exampl grass treatment neg exampl logic program infanc develop complex statist model base distribut stochast natur languag process exploit semant inform grammar good target featur structur logic ambigu featur valu express probabl distribut build mathemat basi logic program continu random variabl challeng research topic paramet learn logic program model framework statist paramet learn logic definit program probabilist fact probabl distribut extend tradit herbrand model semant logic program distribut semant world semant probabl distribut world applic arbitrari logic program includ bayesian network present em graphic em algorithm section learn statist paramet observ class logic program repres sequenti process independ work support data structur logic relationship observ goal estim paramet comput insid probabl gener logic program complex analysi section show complet tabl refut method logic emploi support graph construct tabl access graphic em time complex exist em algorithm algorithm singli connect bayesian network develop independ research field pseudo probabilist context sensit grammar show graphic em algorithm run time sentenc length compar actual perform graphic em algorithm conduct learn experi section real corpora contrast charact atr corpu short sentenc grammar ambigu corpu long sentenc grammar ambigu averag sentenc length graphic em algorithm outperform algorithm order magnitud term time suggest effect approach em learn graphic em algorithm semant limit finit domain finit random variabl applic logic program arbitrari graphic em algorithm expect give gener effici method paramet learn model complex phenomena govern rule probabl acknowledg author anonym comment suggest special takashi mori ab stimul discuss learn laboratori kindli parser linguist data sato appendix properti list properti defin logic program db countabl languag assign consist probabl close formula oe def db continu lim lim ground term proposit relat herbrand model prove terminolog factor close formula disjunct normal form existenti quantif quantif matrix length quantif call rank factor defin set formula made conjunct disjunct associ formula oe rank oe factor quantif fng oe factor rank oe oe oe oe oe oe stand union instanc order proof proposit usual induct complex formula work lemma oe boolean formula made ground atom prove lemma conjunct atom form xn xn db xn xn qed proposit oe close formula definit pf db section probabl assign logic formula respect law probabl paramet learn logic program model recal close formula disjunct normal form belong prove proposit formula induct order oe oe quantif proposit correct lemma write oe singl occurr factor assum similarli assum bound variabl renam avoid clash light valid free lim lim lim induct qed prove theorem iff definit introduc section distribut semant consid program db set infinit ground definit set fact probabl measur set head put def fb defin iff iff form rule db iff def herbrand obviou lemma iff theorem iff state gener side iff definit coincid random variabl instanti ground term theorem iff iff form rule express mean fl occur posit fl fl fl singl occurr fl fl posit boolean formula fl hold definit usual talk ground level true disjunct true sato db db lim db lim db lim lim iff iff qed prove proposit probabl comput support set atom introduc section set explan ground atom write fs defin set def db proposit prove proof parallel theorem replac fact true herbrand model form qed show distribut semant probabilist extens tradit herbrand model semant logic program prove theorem probabl mass distribut herbrand model defin set herbrand model gener fix vari subset program db set denot disjunct paramet learn logic program model def db note subset db conclud theorem state distribut semant distribut probabl mass herbrand model prove prepar recal atom chanc prove introduc def db ground atom herbrand interpret db restrict atom lemma db herbrand interpret iff part properti herbrand model satisfi hand side show coincid wrt atom prove give truth valu atom write impli conclud truth valu assign atom qed theorem lemma db proposit prove atom belong provabl db herbrand model lim db lim countabl conjunct measur set probabl measur probabl measur qed sato appendix mar condit origin formul em algorithm dempster al assum exist map complet data incomplet data case tree input sentenc uniqu determin uniqu condit ensur exist map explan observ face situat map complet data incomplet data nonetheless appli em algorithm dilemma solv introduct mechan make complet data incomplet distribut oe oe observ incomplet correspond yi natur rubin deriv condit oe miss random data observ collect call mar show assum mechan observ satisfi mar estim paramet distribut simpli appli em algorithm observ data adapt mar condit logic program gener model satisfi uniqu condit output goal tree extend model insert mechan observ assum satisfi mar condit extend model correspond explan gener observ mar condit appli em algorithm observ put uniqu condit seemingli em algorithm applic assum mechan satisfi mar condit refer stochast grammar comput learn acycl horn sentenc entail eighth intern workshop algorithm learn theori statist knowledg base belief artifici trainabl grammar speech recognit spring confer acoust societi pp paramet learn logic program model estim lexic german annual meet associ comput linguist pp construct belief network comput valenc induct confer empir method natur languag process expert system probabilist network model statist improv grammat languag model nation confer artifici intellig pp estim probabilist grammar comput probabl theori springer negat failur logic pp plenum press introduct algorithm mit press model probabilist reason confer uncertainti artifici intellig pp paramet estim stochast logic program machin infer bayesian network ai hybrid probabilist program intern confer logic program pp maximum likelihood incomplet data em algorithm royal statist logic logic program mit press abduct induct essai relat integr kluwer academ publish anytim deduct probabilist logic journal artifici probabilist method sentenc disambigu intern workshop pp japan electron dictionari technic guid technic japan electron dictionari research sato abduct logic program journal logic learn knowledg ph tokyo institut technolog effici em learn logic program confer comput logic vol lectur note artifici pp springer probabilist languag model tokyo effect bayesian infer stochast program nation confer artifici intellig pp learn probabl noisi rule intern joint confer artifici intellig pp uncertainti logic handbook logic artifici intellig logic pp oxford scienc public deriv algorithm em algorithm technic ibm research center probabilist deduct intern symposium logic program pp estim stochast grammar algorithm comput speech effici infer network combinatori optim problem intern journal approxim foundat logic program probabilist deduct condit constraint basic event journal artifici intellig foundat statist natur languag process mit press em algorithm extens wilei intersci stochast logic program de advanc induct logic pp io press probabilist logic program inform answer queri probabilist knowledg base theoret comput probabilist logic artifici paramet learn logic program model probabilist reason intellig system morgan kaufmann partial bracket corpora annual meet associ comput linguist pp definit grammar languag analysi survei formal comparison augment transit network artifici semant infer probabl model seventh nation confer artifici intellig pp probabilist horn abduct bayesian network artifici gener queri probabilist grammar ieee transact pattern analysi machin tutori hidden markov model select applic speech recognit foundat speech recognit effici tabl mechan logic program intern confer logic program pp mit press learn acycl horn program entail intern confer machin intern confer induct logic morgan kaufmann probabilist constraint logic program phd universitat infer miss data xsb effici deduct engin acm sigmod intern confer manag pp statist learn method logic program distribut semant intern confer logic program pp model scientif theori prism program workshop machin pp minimum likelihood estim neg exampl statist abduct workshop abduct pp languag model intern joint confer artifici intellig pp sato algorithm em learn statist abduct workshop fusion domain knowledg data support fast em learn famili technic report tokyo institut technolog linear tabul resolut base prolog control strategi theori practic logic art prolog mit press effici probabilist algorithm comput prefix probabl comput transform logic program intern confer logic program lectur note comput pp springer resolut tabul intern confer logic program vol lectur note comput pp springer grammar speech recognit method meet languag pp inform process societi japan atr integr speech languag technic report atr interpret telecommun research laboratori memo logic program commun probabilist review open question comput anatomi exploit causal independ bayesian network infer journal artifici intellig
DB/1266 3 impact select distribut search allison powel jame french depart comput scienc virginia jami callan school comput scienc carnegi mellon margaret connel center intellig inform retriev massachusett charl vile school inform librari scienc north chapel hill abstract onlin inform resourc import effect effici distribut search distribut search cast part queri result merg paper examin effect select retriev perform retriev perform distribut retriev testb distil gener result find good select result retriev effect achiev central find good perform achiev site select perform gener site select final find select maintain collect wide inform global idf local inform achiev superior perform mean distribut system engin autonomi cooper work suggest improv select lead broader improv retriev central singl system central good select retriev perform improv conceptu emploi select step introduct document retriev distribut environ compar perform effect retriev central environ recent xu croft discuss possibl retriev perform distribut environ exce perform central environ xu croft pessimist potenti achiev retriev effici effect heterogen distribut environ work support part darpa contract nasa work support part nsf grant materi base work support part nation scienc librari congress depart commerc cooper agreement number find recommend express materi necessarili reflect sponsor work support part darpa contract present intern confer research develop inform juli document collect creat cluster document achiev good result cluster cluster requir cooper site search potenti exist exce central retriev perform maintain search effici distribut environ cluster composit document collect organ control document collect public public equal size engin retriev system robust decomposit algorithm behav environ paper report experi conduct organ document examin retriev perform environ goal paper investig gener question distribut organ document retriev perform compar central impact select fewer impact document retriev dissemin collect inform distribut select result merg distribut inform retriev consist major step set select step queri queri process select produc set individu merg singl list document present user number approach collect select individu evalu evalu common environ found room improv select attent result merg collect fusion studi impact combin result multipl queri formul al examin combin result multipl queri formul combin retriev result obtain multipl retriev system al merg approach number document retriev base estim document merg probabilist approach yager consid merg lem state al determinist merg approach altern origin probabilist approach research effort compar multipl merg approach al consid merg approach distribut search experi al merg techniqu compar perform publish techniqu addit studi select result merg broader examin goal improv distribut retriev perform xu callan show poor select perform hinder distribut retriev investig queri phrase select vile french show dissemin collect inform retriev effect xu croft explor languag investig wai construct select index research question section discuss gener question prompt investig state question clarifi problem hypothesi good select distribut retriev outperform central retriev varieti environ hypothesi achiev good document retriev perform number select improv perform hypothesi distribut collect wide inform improv document retriev perform hypothesi requir clarif interest determin good select enabl distribut retriev outperform central retriev distribut environ document organ enhanc retriev document organ chronolog equal size methodolog experi report examin retriev perform central distribut environ testb vari select number search approach evalu impact variat final document retriev result search merg return evalu qualiti merg list document descript detail select merg detail descript evalu approach work differ previou research distribut retriev wai util multipl testb distribut relev document experi effort fix number select studi impact select fewer combin select dissemin inform vile french studi cwi distribut environ select xu croft cwi experi report testb document testb experi testb base gigabyt data particip experi data spread year primari ap newswir wall street journal comput select patent offic san jose mercuri feder regist depart energi testb construct organ document constraint document trec cd organ document roughli megabyt order trec restrict document primari sourc testb testb design tempor compon document organ document base primari sourc month year public ap newswir articl februari testb document doe document trec cd french al testb testb document document organ differ document organ roughli document order trec restrict document primari sourc testb evalu select algorithm studi scalabl cori select gener characterist testb tabl tabl show featur testb effect constraint testb creation testb construct approxim mb approxim depend individu document fix valu result variabl tempor variabl size gener patent offic document articl ap newswir testb repres conveni wai organ document partit larg smaller xu croft express concern distribut relev document decomposit affect effici effect distribut retriev discuss issu section summar distribut relev document testb tabl queri trec data includ set field statement inform field topic wai express inform complet map show placement document label found label month doc count found titl field descript inform concept field phrase proper noun occur relev document titl field trec topic construct set short concept field topic construct set longer queri topic chosen relev judgement topic portion data tabl illustr topic select methodolog emploi select approach chose achiev approach realist case unachiev approach scenario comparison exist select algorithm show cori approach outperform ggloss chose cori achiev select approach chose baselin evalu select approach al cori set cori approach creat select index repres term document frequenc df rank queri variant inqueri document rank algorithm belief depend queri averag valu queri term rank produc relev judgement suppli trec data trec queri set simpli order number relev document queri oracl order knowledg relev document queri locat knowledg document rank merg situat order produc document retriev perform queri process scenario queri process perform inqueri unstructur queri retriev document merg merg approach experi approach simpl merg inform distribut document score compar merg feasibl merg approach default inqueri merg algorithm approach combin score score document estim normal score score comput differ select approach cori normal score comput raw belief score definit raw belief maximum minimum score obtain queri normal score comput rank normal document score document initi score comput dmax highest score ideal document queri lowest score document queri normal restrict document score rang scenario enabl comparison distribut central judg impact cwi distribut scenario central document locat singl document distribut inform document retriev global idf valu document length valu document queri similar document locat central distribut document score merg document distribut cwi local inform document retriev document score directli default inqueri merg execut evalu distribut scenario select select approach rank testb consid select search queri rank execut select document return individu result list merg merg algorithm scenario descript top document merg list evalu trec eval program measur document rank pair pair wilcoxon test discuss hull test due presenc ti altern formul wilcoxon test high agreement wilcoxon result report result central scenario tabl result testb central document locat singl note result testb ident document subset perform result close result rank doc doc doc doc doc doc tabl averag valu central compar distribut central perform tabl present summari result distribut scenario testb tabl show result tabl testb tabl testb result distribut scenario shown cori select select due space result longer queri report similar perform trend short numer averag score lower tabl show result comparison central document retriev perform pair wilcoxon test item shown boldfac significantli central perform tabl item significantli default denot differ refer back hypothesi find good select exce central perform testb refer portion hypothesi meet exce central perform small number select select effect high document rank small number select effect due combin effect effect phenomenon concern xu croft relev document found effect aspect evalu approach relev document top exist queri relev document retriev top document retriev document document cutoff queri low queri depress averag valu high document cutoff valu result portion tabl shown figur figur illustr potenti exce central perform select achiev select result tend significantli central perform column tabl figur result approach central perform select discuss perform cori select emploi detail section compar addit comparison distribut approach central interest rel perform examin tabl note strict numer outperform question differ remain tabl repeat section tabl testb number boldfac denot case perform significantli greater perform case perform significantli perform find hypothesi find contradict find vile french number differ experi report experi perform work discuss differ analysi implic result section number search section note exce central small number select confirm portion hypothesi turn attent portion hypothesi interest impact select fewer search examin tabl note document rank number select search tend improv document retriev perform tabl address question observ improv tabl item boldfac type significantli pair wilcoxon test item column immedi left denot case item significantli item column left default denot differ note convent convent tabl number interest thing observ tabl cori select larger number search advantag understand select perform cori select relev document select chanc select benefici effect select addit cori select emploi illustr figur greatest improv select tabl figur due effect discuss section queri relev document found top search larger number number relev document lesser improv select explain similar exist queri relev document found top select search larger number provid larg benefit isnt point search addit tend improv retriev perform tabl limit trend relev document addit improv search addit degrad perform portion tabl select numer case outperform central construct total total number doc db number byte db testb doc db minimum averag maximum minimum averag maximum tabl summari statist testb ubc testb select cori select rank sel sel sel sel sel sel sel sel doc doc doc doc doc doc doc doc doc doc doc doc sym testb select cori select rank sel sel sel sel sel sel sel sel doc doc doc doc doc doc doc doc doc doc doc doc testb select cori select rank sel sel sel sel sel sel sel sel doc doc doc doc doc doc doc doc doc doc doc doc tabl averag achiev testb reflect comparison central perform significantli ital significantli document retriev central sel sel sel sel figur sel document retriev central sel sel sel sel figur sel document retriev central sel sel sel sel figur sel document retriev central sel sel sel sel figur cori sel document retriev central sel sel sel sel figur cori sel document retriev central sel sel sel sel figur cori sel select perform document central point select select perform began degrad discuss cwi merg analysi issu deserv attent appar contradict work work vile base work vile expect hypothesi true cwi improv distribut retriev result significantli result initi reaction differ result due differ merg step scenario merg default cori merg specul incorpor score cori merg contribut perform differ replac raw score merg case cori creat compar found perform perform elimin merg explan addit differ experi experi vile french explain result vile french investig problem show queri broadcast raw score merg cwi raw score merg local inform relat repres wai make document score compar cwi make document score directli compar normal step make document score compar gener interpret document score rank highli differ distract messag good perform enabl good document retriev perform select perform enabl document retriev perform par select enabl distribut perform exce central distribut relev document tabl summar distribut relev document testb number relev distribut relev document valu shown averag valu queri data label averag simpli averag number relev document remain data column summar distribut relev document divid total number relev document queri report maximum averag valu ratio note tabl testb relev document relev document due constraint emploi creat document note relev document evenli distribut testb xu croft express concern distribut relev document distribut organ public sourc size hinder distribut retriev perform distribut relev document larg impact retriev perform testb relev document distribut perform testb similar tabl select cori select rank sel sel sel sel sel sel sel sel doc doc doc doc doc doc doc doc doc doc doc doc doc doc doc doc doc doc tabl significantli bold significantli select cori select rank sel sel sel sel sel sel sel sel doc doc doc doc doc doc doc doc doc doc doc doc doc doc doc doc doc doc tabl impact select fewer collect search scenario bold significantli item directli bold ital item left averag rel doc db testb min avg max tabl summari statist testb altern interpret scenario consid context exist distribut environ potenti distribut retriev outperform central altern interpret central document conceptu organ arrang physic storag organ document document assign conceptu queri handl produc singl result list impact conceptu organ realiz step select step perform document select declar elig retriev elig document present user result experi suggest step improv qualiti order achiev improv select perform exist equal central perform select scenario improv central perform paper report experi support ffl good select distribut retriev outperform central ffl achiev good document retriev perform select small number heterogen select improv perform ffl good conceptu central select step potenti improv perform ffl inform complex issu scenario bullet straightforward approach cwi raw score merg produc good result distribut local inform work select emploi document score suitabl normal merg perform examin document testb shown wide applic implic central perform necessarili gold standard aim distribut search achiev retriev perform good retriev perform select impli distribut search good select scale conceptu singl subcollect introduc select step achiev perform search entir find select rank potenti improv effect rank simpl raw score merg case elabor local inform adequ good retriev perform good select emploi mean unnecessari dissemin inform select part search strategi set examin effect select retriev perform previou work focuss explicit evalu select techniqu work sought determin select impact retriev perform met goal provid concret usefulli guid engin distribut inform retriev system refer xu inqueri battl sixth text retriev confer shaw combin evid multipl queri inform retriev inform process connel effect sampl automat select algorithm technic report languag technolog school comput carnegi mellon croft search distribut collect infer network proc page thistlewait merg result isol search engin proc tenth australasian page rao combin evid multipl search text retriev confer page novemb mou compar perform select algorithm proc page prei evalu select testb experi proc page french vile ensur retriev effect distribut digit librari journal visual commun imag fuhr approach select network ir acm transact inform juli gravano gener gloss broker hierarchi proc discoveri internet acm transact june effect gloss text discoveri problem page harman overview fourth text retriev confer fourth text retriev confer hawk thistlewait method inform server select acm transact inform januari hull statist test evalu retriev experi proc page moffat zobel inform retriev system larg document collect text retriev confer page introduct statist method data analysi vile french dissemin collect wide inform distribut inform retriev system proc page juli learn collect fusion strategi proc page collect fusion problem text retriev confer page xu callan effect retriev distribut collect proc page xu croft languag model distribut retriev proc page yager fusion document multipl collect inform retriev system journal american societi inform yuwono lee server rank distribut text retriev system internet proc intl conf system advanc page april
HCI/1267 4 improv registr visual horizon silhouett match reinhold rockwel scienc center thousand ca abstract system enhanc situat awar outdoor scenario augment realiti techniqu util visual clue improv registr terrain silhouett provid uniqu featur match digit elev map data match visual extract silhouett dem silhouett orient develop registr system run pc port wearabl ar system introduct context augment realiti past augment realiti gain attent due rapid progress kei area virtual realiti ar technolog mean intuit inform present enhanc situat awar percept exploit natur familiar human interact modal environ complet ar requir user wear headmount displai requir calibr work support feder laboratori advanc displai interact displai consortium grant registr ar import issu ar registr inform displai real world outdoor ar applic util gp posit magnet compass sensor lack inerti sensor provid data rapid tend drift hybrid track combin inerti track static posit measur comput vision compon role comput vision ar system emploi comput vision achiev requir registr approach case detect visual featur recov camera orient posit match pose recoveri process indoor ar applic fiduci marker visual track visual landmark combin magnet leverag benefit track type hybrid system crucial comput vision approach correct camera calibr approach develop avoid explicit camera calibr ar benefit significantli progress comput vision research silhouett visual clue research util visual silhouett reconstruct curv object shape simultan motion estim outdoor silhouett occur structur natur terrain shape object background intens color contour silhouett detect appli comput vision method detect contour natur horizon silhouett visual boundari terrain sky necessarili determin posit orient observ area confin region stein demonstr digit elev map match visual predict horizon silhouett structur index digit terrain map digit elev map provid terrain elev data point grid pattern common file format denomin digit elev model map digit terrain elev data map dem data survei map nation imageri map agenc elev data digit elev map align profil line dem map minut map detail file format publish format cover region grid point align geograph coordin system latitud oe longitud ax arc sec minut map cover region minut arc boundari latitud longitud grid data sampl point ax zone silhouett contour terrain form terrain point surfac normal vector perpendicular view vector observ point figur normal view vector silhouett point comput silhouett contour digit elev map calcul scalar product vector normal ij view vector ij terrain point ij test neighbor point scalar product opposit simpler method select point highest visibl concept registr registr virtual world real world achiev match real world featur predict featur develop approach dem map obtain camera orient terrain visual horizon silhouett match posit assum gp measur approach outlin visual silhouett extract singl video imag edg detect techniqu extrema extract base locat horizon silhouett comput complet surround digit elev map gener correspond singular defin pitch yaw angl camera calibr paramet hypothesi minim distanc visual silhouett segment silhouett digit elev map assum optim match hypothesi pitch yaw angl match discrep horizon silhouett video imag steep grayscal gradient edg detect appli edg detector scan top bottom imag sobel oper detect horizont edg horizon nearbi tree build cover horizon horizon detect constraint appli flag area horizon edg identifi horizon silhouett visual cue problem determin camera orient reduc find optim match arrai silhouett segment digit predict figur gener hypothesi assum correspond maximum minimum video dem silhouett start combin extrema video silhouett hypothesi gener extrema silhouett hypothet match pair lead assum camera azimuth ff elev calibr match hypothesi hypothesi calibr paramet assumpt map hypothesi error measur calcul describ error hypothesi order comput video predict dem silhouett point closest interpol video silhouett point select point squar sum distanc field view camera error measur judg hypothesi hypothesi error threshold chosen valid result approach visual section implement develop setup integr outdoor ar provid visual aid navig hazard indic system port oper outdoor registr approach sensor develop system registr implement mhz pentium run window initi imag grab ccd camera imag size pixel softwar written microsoft foundat class video imag figur captur pixel clear contrast sky terrain area demonstr registr approach silhouett extract imag shown figur figur video imag rockwel scienc center thousand oak top bottom imag portion truncat dem silhouett maxima minima combin maxima minima video theoret combin correspond hypothesi appli constraint select combin remain investig figur match silhouett contigu line video dot dem silhouett point tabl numer result match algorithm hypothesi correct error ff ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi tabl match result summari demonstr horizon silhouett provid visual clue improv registr approach mean obtain camera azimuth elev calibr paramet work make approach applic varieti light visibl condit princip limit comput vision outdoor requir robust registr system includ sensor acknowledg research fund advanc displai interact displai cooper agreement refer imag registr comput augment realiti proc annual symp advanc displai interact displai feb pp introduct augment virtual realiti proc spie conf technolog oct pp comput registr techniqu augment realiti proc spie nov pp calibr displai augment realiti applic proc vrai sept pp structur motion estim dynam silhouett perspect project proc iccv camera track augment realiti applic proc sept affin object augment realiti proc vrai pp augment realiti system proc juli nation imageri map agenc web site superior augment realiti registr integr landmark track magnet track proc siggraph structur index object recognit phd southern apr problem proc darpa imag understand workshop sept digit elev model data user guid unit state depart interior va unit state survei web site recognit pose estim curv object model built activ vision phd yale
ML/1268 6 structur identif fuzzi classif han depart process engin po box hungari delft depart inform technolog system control ga netherland abstract complex identif classifi deal structur issu select relev featur effect initi partit input domain identif fuzzi classifi challeng topic gener algorithm effect featur select extract crisp classif initi fuzzi system fuzzi classifi flexibl boundari fuzzi model parsimoni dt easili interpret transpar classif structur identif algorithm genet algorithm base paramet optim dt initi fuzzi set combin similar base rule base simplif algorithm perform approach studi special design artifici data applic cancer classif problem shown introduct growth capabl gener collect data decad inform hidden correl behavior pattern datamin process perceiv anomali structur transform inform compact interpret system focu extract fuzzi classifi label subclass system classifi limit number predefin class linguist interpret import aspect classifi fuzzi logic improv classifi semant provid insight classifi structur make process fuzzi recogn real effort made result transpar main approach found select low number input variabl order make compact classifi larg set rule make select genet algorithm appli select model reduct obtain gener similar base set reduct techniqu identif scheme present rule gener extrema redund rule remov base fuzzi similar measur structur paramet fuzzi model optim genet algorithm gradient method rule gener extrema model result complex initi rule gener train data rule base simplif reduct step demand effect initi lead exponenti number rule number input variabl show initi step fuzzi model fuzzi cluster similar covari base initi techniqu put forward initi fuzzi set obtain orthogon project multivari membership function obtain cluster statist properti label data project result product space inform loss step make model suboptim result perform initi model base multivari membership function gain interpret main advantag deriv step avoid problem initi techniqu sought base tree motiv high perform comput effici exist crisp tree gener method applic regress tree initi fuzzi neural model complet idea tree map feedforward neural network variat method tree input domain discret approach extend model prune method feedforward neural network abund paramet render train procedur ineffici train set feedforward radial basi function initi method base placement radial base function center edg rectangular region defin dt complex result model control complex tree number ad basi function radial basi function function fuzzi infer system approach ident initi fuzzi model regress tree similar approach simpl fuzzif regress tree result fuzzi cart model part fuzzi model build fuzzi inequ fuzzi tree obtain directli data main advantag fuzzi classifi dt greater flexibl boundari classifi carri rectangular partit input fuzzi model gener parallel boundari fuzzi system parsimoni dt fuzzi model initi simpli dt complex suggest simpl transform dt fuzzi model step seri rule base optim simplif step obtain parsimoni interpret fuzzi classifi approach initi trapezoid membership function fuzzi model deriv tree initi rule base simplif algorithm genet algorithm appli improv classif accuraci ensur transpar paper devot initi step tune note detail elabor refer approach appli wisconsin cancer classif problem literatur section explain structur fuzzi classifi section transform tree fuzzi model discuss model simplif techniqu review section section consid classif problem artifici geometr problem cancer data classif problem literatur section structur fuzzi classif system studi fuzzi system consist classif rule describ class data set xn rule defin oper region rule featur space rule consequ crisp class label set denot number xn input output ith rule fuzzi set connect model product interact proposit activ ith rule calcul ij output classifi determin consequ rule highest arg max certainti normal fire cf transform tree fuzzi model binari tree tree structur consist intern node termin node intern node function node visit termin node repres output input lead visit node classif termin node label predict class shown figur binari tree repres term crisp logic concept repres disjunct normal form atom attribut test attribut sampl tree class class class class featur space figur tree attribut test partit input valu rule formul connect crisp domain repres crisp characterist set crisp characterist function special case trapezoid membership ij describ fuzzi set ij ij max min base tree repres fuzzi rule membership function rectangular region class defin depict tree repres simpl fuzzi class characterist point applic fuzzi set advantag fuzzi set transform addit class class classif problem approxim boundari crisp rule base system membership function fuzzi model give perfect classif figur solut linearli separ classif problem dt fuzzi model crisp fuzzi classifi addit inform membership class give hint ambigu advantag fuzzi system easili defin parallel dt approxim system manner shown figur figur accur approxim parallel lot crisp rule fuzzi model rule class class provid perfect transpar solut differ capabl fuzzi crisp fuzzi model initi simpli dt complex simpl transform dt fuzzi model seri rule base optim simplif step present section optim reduct transform model previou part paper recogn fuzzi model initi tree result fuzzi model parsimoni obtain initi model fuzzi classifi defin transform model complex aim section iter model prune method obtain compact transpar model improv model accuraci measur number genet algorithm tune membership function initi rule base extract tree fulfil criteria transpar good semant properti moder number normal coverag effect paramet optim present superior capabl fuzzi transpar compact initi rule base improv achiev rule base simplif method base similar measur quantifi redund fuzzi set rule base similar measur base oper intersect union ij kj ja ij kj ja ij kj denot cardin oper repres intersect express written ij kj ij ij minimum maximum symmetr measur ij kj membership function ij kj equal ij kj membership function rule base simplif procedur similar fuzzi set merg similar exce user defin threshold merg reduc number fuzzi set model transpar similar measur simplifi figur simplif rule base simplif tree initi ga optim ga optim data model initi prune fine tune figur scheme dt initi base identif approach detect fuzzi set element domain membership close fuzzi set featur similar merg led membership function featur elimin model method illustr figur complet rule base simplif algorithm combin paramet optim rule base simplif algorithm result model scheme shown figur dt base initi model prune phase ga forc redund model number remov fuzzi set rule reward similar iter misclassif rate combin similar measur ga object function achiev redund remov unnecessari fuzzi set iter fine tune step combin similar penal fuzzi set obtain distinguish term set linguist interpret tradeoff similar result function minim mse figur geometr classif problem figur tree gener geometr problem mse repres accuraci averag maximum similar present aggreg similar measur total weight function determin similar reward penal experi applic experi geometr data investig capabl classifi gener easili geometr classif problem defin train test set uniformli distribut exampl gener domain domain class repres shade area figur initi tree gener algorithm parallel complex tree result intern termin node shown figur result membership function model scheme solut model gener problem figur obtain membership function geometr classif problem larg number paramet perform result tree recognit rate train set test set figur result model transpar enhanc interpret result tree transform fuzzi model present model algorithm appli reduct optim simpl rule base class class model figur gener membership function close shape simplist show figur wisconsin breast cancer class attribut superior approxim capabl fuzzi system crisp fuzzi model gener base dt significantli reduc present dt base identif algorithm simpli fuzzifi boundari advantag fuzzi system applic wisconsin breast cancer classif problem previou case studi show optim rule structur rule simplif optim procedur real advantag dt base initi shown present realist classif problem wisconsin breast cancer data anonym ftp aim classif distinguish benign malign cancer base uniform cell uniform cell margin singl cell bare normal attribut integ rang instanc omit common studi class distribut benign classif problem wide test effect classif rule extract algorithm setiono appli feedforward neural network preprocess data rule extract kruse combin techniqu interact strategi rule prune obtain fuzzi classifi initi rule base made appli set result tabl classif rate wisconsin breast cancer data method result aver result worst result rule model eval sen al kruse paper figur tree gener problem rule reduc delet rule heurist learn method appli gradient descent applic triangular membership function semant properti account constrain final fuzzi classifi reduc rule featur misclassif valid time learn data valid algorithm gener dt classifi termin intern node interv test input extract initi fuzzi model built rule fuzzi set result correct misclassif model prune simplif result reduct fuzzi set rule contribut percent delet reduc classifi rule membership function optim ga object function section obtain classifi subject reduc addit set optim figur result membership function model scheme iter fine tune phase extrem transpar compact fuzzi model result recognit rate good small class class repetit simplif optim left featur term obtain classifi result compar result rule compar compar fuzzi set figur data figur show obtain rule highli compact model literatur high accuraci success rule base simplif tune result compact accur classifi approach successfulli appli cancer data obtain classifi accuraci compar result report literatur obtain model fewer rule classifi report literatur give accur classifi compact comparison studi quantit ga appli optim paramet fuzzi classifi refer ca fuzzi genet approach breast cancer diagnosi artifici intellig medicin kruse obtain interpret fuzzi classif rule medic data artifici intellig medicin compact fuzzi model complex reduct evolutionari optim san usa setiono gener accur classif rule breast cancer diagnosi van hr similar measur fuzzi rule base simplif ieee tran ja transpar fuzzi model fuzzi cluster ga june usa ja model complex perform ieee tran fs takagi sugeno fuzzi identif system applic model control ieee tran smc de oliveira semant constraint membership function optim ieee tran fs yen wang simplifi fuzzi model orthogon transform method ieee tran wang filter system int approxim reason jin fuzzi model system ieee tran fs learn fuzzi classif rule data uk jr quinlan program machin learn san morgan kaufman lk sethi entropi tree neural network proc kubat initi neural network mean tree setiono wk map tree neural knowledg base vol kubat tree initi network ieee transact neural orr combin regress tree rbf submit juli function radial basi function network fuzzi infer system ieee tran neural fischer local linear model tree nonlinear system identif cool european congress intellig techniqu soft comput germani jang structur determin fuzzi fuzzi cart proc ieee intern confer fuzzi cz fuzzi issu ieee transact vol issu kruse fuzzi cluster analysi method foc data analysi imag recognit john wilei son
AI/1269 2 expert system automat analysi facial express faculti inform technolog depart knowledg base delft po box aj netherland receiv august receiv form june accept januari paper discuss expert system call integr system facial express recognit perform recognit emot classif human facial express imag system consist major part form framework hybrid facial featur detect multipl featur detect techniqu appli parallel redund inform defin unambigu face geometri miss highli inaccur data part system infer engin call convert low level face geometri high level facial highest level weight emot label elsevi scienc bv reserv intellig user hybrid facial featur facial action facial express emot classif introduct user interfac comput system evolv intellig interfac move instruct natur mode audio sensori mean step achiev commun man machin human commun main verbal word atom inform unit verbal commun phenomena facial bodi movement physiolog reaction atom unit commun clear gestur success human interact phone research social psycholog shown gestur signal make dialogu smoother fewer interrupt find suggest commun system promot effici perform moment system automat speech recognit complet accur system facial author imag vision comput front matter elsevi scienc bv reserv gestur analysi develop trigger interest topic autom commun autom system commun ongo project knowledg base system depart tu delft goal project develop intellig autom system analysi commun system provid qualit quantit inform signal level lowest system detect signal shown observ person system detect signal specif facial action specif bodi action shoulder specif vocal reaction high speech specif physiolog reaction higher level system give interpret signal highest level system reason intent user intellig human commun cope process interpret commun signal input system consist sensor data analysi record facial bodi physiolog sensor data perform implement modul oper independ part singl system final result system result modul execut parallel repres hypothesi intent observ person investig automat recognit emot classif facial express order achiev automat human commun paper discuss result research implement integr system facial express recognit automat facial express analysi facial express plai essenti role human commun human commun commun messag due linguist due transfer facial express order facilit interfac multimedia facial gestur analysi studi world wide ten year numer techniqu earli work kato al map synthesi facial express point chang extract accompani chang facial effect emot classif facial express investig detail work terzopoulo water deal synthesi facial interpret dynam face model combin physic base model facial tissu anatom base facial muscl control process order anim human face face deform curv techniqu estim face muscl contract paramet video sequenc al report neural network recognit synthesi facial express zhao singular emot classif facial express backpropag neural network develop learn expert interpret facial express term emot label colleg student formal instruct emot signal facial express recognit system requir manual system introduc kanad al system action unit au combin facial imag sequenc hidden markov model manual mark facial featur point contour nose mouth frame imag kanad al optic flow algorithm track automat featur point remain imag vision comput frame case upper optic flow algorithm high gradient compon detect includ detail inform larger region forehead influenti research group field facial gestur analysi publish summari previou work essa pentland present result recognit singular emot classif facial express base optic flow method coupl physic face model motion energi histori templat encod magnitud direct motion learn motion view emot express happi defin templat express approach essa pentland fulli note templat facial express form uniqu method facial express emot classif black yacoob optic flow model imag motion facial express analysi work explor local optic flow model recognit basic emot express fear kobayashi hara report singular emot classif synthesi basic emot express work anim reproduc emot express bright distribut data facial imag backpropag neural network classif synthesi facial express research report singular emot classif anim human facial express construct virtual face discret snake face templat reproduc observ facial express virtual map carri track point face templat total minim percept action au fac approach emploi observ express basic emot class method limit deal synthesi facial express attempt give interpret give low level interpret complet manual procedur track facial featur descript basic emot express valid linguist descript ekman explain rule emot classif express system perform singular emot classif facial express approach deal issu blend emot express explain approach automat facial express analysi attempt cope issu list integr system facial express recognit imag vision comput aim research design implement complet autom system recognit emot classif facial express project ongo automat extract facial featur facial automat encod face action term action unit automat classif face action basic emot categori disgust contrast exist facial featur detector singl imag process repres hybrid approach facial featur detect exist method base discret snake templat match optic flow model imag motion wirefram face model bright distribut data facial imag combin neural network approach approach recognit facial express combin multipl featur detect appli parallel complet exist facial featur detector invent combin techniqu motiv combin detector qualiti combin detector algorithm circumst perform extrem facial featur detect combin detector weak properti perform singl detector introduc redund appli multipl detector facial featur acquir result final yield complet set detect facial featur workbench implement paradigm deal static face action mean facial movement measur comparison neutral facial posit movement measur deal continu trace face deal facial imag sequenc system classifi stabl pattern facial express avoid problem rigid head achiev success acquisit profil explicitli camera set camera mount holder attach devic camera holder front face side face camera move head facial view chang size orient face compar acquir imag current express classifi limit examin express emot categori capabl perform recognit classif express blend emot express overcom problem develop system complex face action partial manual system introduc kanad al deal emot classif facial exist system deal recognit face action repres complet autom system develop convert face geometri facial descript face weight emot label reason system mean process facial express recognit emot classif depend variabl observ person gener face facilit reason consist major part fig imag data data data analysi part system repres collect facial featur detect algorithm part system facial data repres connect data gener infer engin system part system make select redundantli detect facial featur result face geometri miss highli inaccur data obtain face geometri form input reason mechan call deal ambigu inform encount examin facial express partial base knowledg neutral facial express step perform automat analysi facial express analysi neutral facial express ensur correct extract facial featur neutral facial highli recommend result automat featur detect visual inspect choic facial featur detector manual made analysi express observ person perform complet automat theoret background face action recognit facial express emot classif section face model explain section framework hybrid facial featur detect explain section section describ deal ambigu facial express inform process facial data analysi explain section conclud remark section theoret background fundament issu recognit prototyp emot facial express visual inform examin face reveal process stage defin set categori deal classifi express defin mechan psycholog studi facial express classif relat step commonli studi classif facial express studi exist categori emot express ekman defin call basic anger imag vision comput fig structur disgust basic emot term facial express uniqu emot psychologist russel doubt basic research facial gestur analysi reli emot facial express product rule infer perform emot classif facial base descript basic emot contrast stage process express studi stage kind inform face order classifi facial express emot categori open question studi subject fac facial express repres visibl consequ facial muscl activ fac repres system describ facial express term code facial muscl involv activ muscl system activ action unit au correspond contract produc group relat muscl activ au term facial chang facial featur ey mouth activ underli fac visual distinguish facial movement fac develop human observ facial muscl activ extract directli digit imag resolv problem defin automat extract visual properti facial express result displai experi gave clue problem bruce request stimulu person make facial express white mark face random subject observ movement white mark monitor quickli awar face easili kind facial express movement white mark repres displai experi suggest visual properti inform facial made clear describ movement point belong facial featur relationship movement trigger research facial gestur analysi make attempt determin visual properti facial express concern defin face model defin mechan automat extract point digit facial establish relat movement extract point au descript basic emot express descript shown facial express process defin automat extract visual properti facial express face model relationship face model au defin section mechan automat extract model featur section descript basic emot mechan emot classif facial express explain section face model imag vision comput facial express recognit system complic wirefram face model averag optic flow local region vision difficult design face model accur repres facial geometr properti initi adjust wirefram surfac imag affect accuraci recognit result accur inform facial express lost averag optic flow local facial region estim exist face model facial landmark model suitabl automat extract facial point model facial characterist point kobayashi hara face model point belong lower eyelid upper lip facial effect displac lower eyelid upper lip model facial point al face model point eyebrow centr lower eyebrow border upper eyebrow form redund inform defin face model model facial side view number motiv choic shown bruce graphic face model resembl model human observ judg facial express rule human observ rule convert straightforwardli rule automat classifi base face model motiv simplic valid face model posit point face model directli observ compar model model valid model visual inspect combin dual facial view singl model yield realist face avoid inaccuraci manual model model consid redund inform facial featur coupl facial view reveal redund inform facial express depend success facial featur detect redund encod unambigu facial geometri term section section model characterist featur defin model extract automat imag case profil imag case deform featur defin model reveal mouth chin deform featur defin model reveal jaw chin establish simpl uniqu relat model featur separ au face descript au term model section face model face model featur divid group group form defin correspond set facial point point illustr fig tabl featur group tabl group form repres specif shape mouth specif shape chin featur tabl fig automat extract facial featur defin model section model gener valid linguist label describ visual properti au analysi label upward pull portion describ activ addit featur tabl facial point point point descript fig facial point left ey stabl point ey stabl point left ey outer stabl point ey outer stabl point left left eyebrow eyebrow left eyebrow outer eyebrow outer top left top bottom left bottom top upper bottom lower left corner corner tip imag vision comput tabl group featur model featur featur descript angl angl distanc ae distanc distanc centr ab distanc centr distanc distanc distanc fg distanc distanc distanc ib distanc distanc ci distanc cj distanc ij distanc kl distanc cm imag intens circl line imag intens circl line imag intens circl left line imag intens circl line imag intens left half circl imag intens half circl bright distribut line model observ train fac coder conclud activ total au defin au uniqu face model import uniqu achiev term face explain activ activ label upward pull upper lip activ obscur activ label root nose describ obtain uniqu defin describ fac descript au inform tabl tabl group featur model featur featur descript lower lip shape shown fig mouth shape shown fig mouth shape shown fig circular shape chin shown fig mouth shape upper lip shape shown fig fig shape lower lip pull fig mouth shape lower lip face model face model face profil point profil point correspond peak vallei curvatur profil contour function transform contour function graph offer possibl mathemat tool matlab locat automat maximum minimum point extrem curvatur profil point illustr fig tabl featur face model tabl profil point locat extrem curvatur profil contour function extrem found priori delet extrem descript find profil contour tabl order select chang tongu visibl case vallei repres attach upper lip peak repres tip vallei repres fig mouth shape fig shape chin chin imag vision comput tabl au model au fac descript map model brow outer brow lower brow frown brow upper lid lower lid lip lip nose upper lip mouth corner pull mouth corner pull sharpli mouth corner pull mouth corner pull depress lower lip fig present chin fig present lip pronounc word absent mouth stretch lip tighten press absent lip press absent absent lip part threshold jaw drop threshold mouth stretch threshold lip ˆ bottom lip present top lip present present widen absent compress lid drop attach tongu bottom detect point case lip vallei detect peak exist import track profil point order point locat point locat exclud extrem visibl point locat total au defin au uniqu face model face model tabl harmon develop similar model profil point face identif system facial express emot classif face identif task person characterist length nose consid unimport data facial express open mouth consid face identif face model develop suitabl facial express emot classif resembl model tabl facial point point point descript imag vision comput fig face profil point top joint point hair forehead eyebrow peak curvatur contour function root vallei curvatur contour function tip absolut maximum curvatur contour function upper vallei peak curvatur contour upper peak peak curvatur contour lip vallei upper lip lower peak tip chin lower vallei tip chin tip peak start end curvatur contour tabl au model au movement profil point curvatur row peak vallei curvatur remain local extrem curvatur distanc curvatur straight angular distanc curvatur upward distanc curvatur distanc distanc distanc distanc remain distanc curvatur distanc distanc curvatur tongu curvatur vallei peak distanc curvatur distanc distanc curvatur upward distanc distanc curvatur upward distanc distanc distanc distanc distanc point absent point absent point absent upper lip produc curvatur lower lip produc absent combin face model motiv combin model qualiti face model model uniqu describ activ au view combin singl face au uniqu tabl facial view suitabl observ au activ model suitabl descript au effect model suitabl descript au effect jaw chin au descript depend track noisi imag featur curvatur profil contour function tabl au combin face model au recognit base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model base model noisi imag intens present activ detect reliabl combin view yield face model fewer weak fewer complic model process facial view reveal redund inform facial express reduc redund depend success model featur suitabl describ au facial view model suitabl facial view model descript result rule tabl case model featur successfulli track rule tabl appli final gener face geometri case contour profil successfulli facial express rule tabl model featur locat relat rule tabl substitut rule tabl detail descript unambigu face geometri section imag vision comput hybrid facial featur detect contrast exist facial featur detector singl imag process techniqu repres hybrid approach facial featur detect repres part system fig combin multipl featur detect techniqu appli parallel exist facial featur combin techniqu workbench tool design paradigm structur design workbench gui explain al give overview workbench design section includ descript facial featur detector integr workbench section provid detail descript newli develop facial featur ey detector fuzzi classifi mouth express workbench structur workbench illustr shown fig modul workbench classifi group modul gener digit face filter imag data feed modul inform belong group modul group explain tabl modul perform detect facial region mouth belong detect group modul detect group tabl modul facial featur belong extract group modul perform track upper face featur ey tabl modul mouth profil tabl workbench oper mode mode mode user select connect arbitrari number modul order form network modul perform desir detect facial featur fig moment current network displai user form direct graph node graph depict modul branch graph depict connect modul modul connect network output modul form input modul time connect check data type modul match connect modul workbench modul fig algorithm eyebrow mouth facial detector integr workbench tabl user interact facial featur detector integr workbench invok automat result detector store separ file file form input stage miss inaccur data result final unambigu face geometri facial data evalu section neural network approach ey detect neural network excel capabl specif pattern properti exploit extract graphic pattern digit imag case graphic pattern search combin pixel valu due robust neural network pattern resembl origin pattern contrast convent imag process capabl perform approxim ey implement ey nn workbench backpropag neural network sigmoid transfer function detect ey imag grei detector process fine pixel box ey locat stage ey region segment input imag workbench modul pixel scan window scan obtain ey region pixel scan window attach input neuron neural train iri ey locat imag vision comput fig algorithm workbench highest neural reach assum centr iri scan window set point locat highest neural reach remain previou posit iri found step repeat iri found algorithm set iri fine ey locat idea search characterist point ey appli neural network origin hierarch perceptron featur locat method vincent al differ method choic ey locat illustr fig invari respect size respect shown facial respect person ey belong correspond iri ey stage pixel search area set micro featur pixel search area attach input neuron neural network train relat locat highest neural reach repres locat priori knowledg symmetr posit featur discard posit lie fact border eyelid ey algorithm end approxim border curv drawn locat fig experi imag person pictur divid group imag group consist time basic emot express shown person group imag train set test set imag imag resolut pixel colour depth reduc grei level imag human observ adob observ point exact locat ey imag train pattern obtain extract vector grei level pixel pixel set point user backpropag neural network imag vision comput tabl modul workbench belong group detect group modul modul descript imag colour java imag data flat arrai pixel colour grei colour pictur grei pictur convolut filter remov smooth imag appli linear convolut filter gaussian uniform filter median filter enhanc continu area constant bright imag slight sharpen edg appli median filter grei implement creation layer multi resolut pyramid calcul half current imag resolut higher integ averag squar half imag direct routin perform imag size equal illustr implement modul read multi resolut pyramid layer default layer raw featur map repres rough approxim locat facial featur head locat appli sequenti analysi vertic histogram success horizont histogram success peak vertic histogram head box correspond border hair mouth boundari chin neck horizont line ey local maximum peak vertic line ey nose chosen absolut minimum contrast differ found horizont line ey box bound left ey defin size upper left face quadrant horizont vertic lie horizont line divid perform analysi vertic horizont box reduc local maximum histogram procedur appli defin box bound ey initi box bound mouth set horizont line horizont line horizont line repres border chin neck initi box bound nose set horizont line horizont line ey horizont line mouth vertic horizont histogram initi box reduc track facial featur find head implement algorithm base hsv colour model step defin paramet hue analysi imag peopl result hue face colour seldom exce interv result yield fact rang hue exce imag singl irrespect chang condit hue defin averag hue calcul averag hue box horizont middl face box defin vertic horizont histogram input imag face extract biggest object scene hue defin rang similar gener human speci base rel rgb present yang waibel train network train input vector small squar error reach train vector approxim train perform detect scheme evalu calcul block distanc differ estim manual locat denot estim posit manual assign point perform indic express perform algorithm measur train set imag result test shown tabl tabl remain pixel imag error approxim pixel result detect perform test set imag shown tabl tabl imag vision comput tabl modul workbench integr extract eyebrow detector modul modul descript find nose implement curv fit simplifi draw polygon implement chain code eyebrow implement head segment facial imag horizont vertic signatur imag linearli filter clip imag threshold algorithm appli colour import facial region mouth symmetri line import facial region found adapt version algorithm base diagram present defin correspond deepest vallei bright distribut symmetri line similar algorithm hara kobayashi import facial found belong approxim perpendicular distanc symmetri highest intens locat tip chin locat peak deepest vallei bright distribut symmetri line left upper left face quadrant segment facial imag facial axi found modul contour face found modul find head contour region determin horizont vertic signatur linearli filter threshold imag upper left face quadrant eyebrow region obtain clip triangl defin ey point corner top ey found ey region depend colour eyebrow eyebrow region threshold uniqu colour assign object largest select rest object discard chain code appli eyebrow contour simplifi curv smooth obtain contour left upper left face quadrant segment facial imag facial axi found modul contour face found modul find head contour segment part threshold appli algorithm minimum varianc cluster region locat horizont vertic imag signatur signatur filter close morpholog filter width region set width index maxim smooth vertic signatur height region set width smooth horizont signatur similar procedur threshold segment appli order defin eyebrow region contour eyebrow found appli algorithm base chain code ey nn implement neural network approach ey track method detail section snake implement box method chain code eyebrow modul algorithm appli activ contour method kass al greedi algorithm energi function william shah error remain pixel error approxim pixel larger error differ ey centr case manual imag vision comput tabl modul workbench integr extract group featur detector modul modul descript curv fit mouth implement snake implement fuzzi implement imag intens facial implement find profil implement java box found segment facial imag filter gaussian filter lowest highlight pixel select start point directli connect pixel current repres cross deriv function mouth continu mouth boundari point conjunct lip end disjunct mark mouth corner refin estim mouth shape obtain fit upper lip lower lip order squar model algorithm find relat point extract mouth contour paramet box found linearli filter segment facial imag line found distinct vallei vertic section intens minimum line lowest horizont integr project repres centr found function vertic section intens found minimum creat minimum function found vallei detect search direct edg point deriv intens start found line defin alter algorithm algorithm start centr mouth add point current point intens lower intens found vallei algorithm appli activ contour method kass al greedi algorithm energi function william shah snake start shape horizont axi elong side fuzzi classifi mouth express method explain detail section modul develop algorithm base result chain code ey point nn curv fit mouth imag intens facial region face repres area vertic signatur function obtain facial region imag intens vertic axi mouth face obtain bright distribut data line al present profil detector hsv colour model calcul exploit threshold input profil imag tip nose found part binari imag tip chin found distinct minimum vector sum background pixel bottom solv problem face line tip nose tip chin system obtain profil contour binari number background pixel simpli count edg imag foreground pixel obtain vector repres sampl profil contour curv remov averag procedur perform wide vector cross st deriv profil function defin extrem extrem found local profil list extrem process direct global maximum extrem reject made consecut record list obtain list extrem reflect distinct vallei profil contour tabl estim automat estim centr ey defin centr iri neural network find centr point iri compar perform perform similar error distribut found averag error measur pixel resolut test imag fig curv fit ey imag vision comput fig screenshot workbench tabl distribut left ey train set imag ey left centr left ey left centr tabl distribut left ey test set error count fuzzi classifi mouth express examin draw led interest mouth express shown singl draw line perfectli reflect intent led mouth shape inform averag edg intens direct corner mouth edg averag mouth interpret edg averag mouth interpret idea implement research team form fuzzi classifi mouth express process modul start locat mouth region vertic axi mouth appli workbench modul fuzzi reason edg detect perform base characterist gradient correspond local steep function function local symmetr gradient direct basic idea fuzzi reason edg detect origin law al approach differ main inform direct gradient fuzzi reason proce numer valu repres symmetri steep level fuzzifi label medium high pass reason part process reason part base rule steep high symmetri level high edg intens point part result label medium depict edg intens point inform direct mouth symmetri imag vision comput ey left centr left ey left centr fig fuzzi classifi axi obtain inform intens direct edg point combin intens direct edg point result vector point obtain mouth region averag averag vector pass backpropag neural network network layout fig reflect vertic symmetri mouth implement architectur network set parallel side output pass network output network singular emot classif shown mouth neutral sad categori featur network perform task copi network case error propag singl network recognit network featur network speed train process result properti network evalu method set imag imag human observ classifi categori ten imag randomli chosen test set remain imag process fuzzi part algorithm pass network train set expir network achiev full recognit level train test set imag train averag epoch averag error network train process illustr fig averag error test set calcul prove method fig averag error train epoch suffici sensit method averag properti depict subtl differ mouth express fine mouth crucial proper interpret mouth express method prove check facil correct result integr workbench easili check basi present fuzzi classifi simpl set output fuzzi classifi compar properti mouth contour mouth detector rule smile corner mouth extend fuzzi classifi mouth express form check integr workbench fuzzi mouth modul deal ambigu facial express inform previou version face model track model featur appli network workbench modul illustr fig accuraci result face geometri perform modul illustr fig modul fail facial encount miss data infer engin system develop reason set exact data face mean system reason shown facial express correct facial featur successfulli case modul fail facial substitut miss data examin facial express data neutral facial express accur inform examin facial express lost enhanc introduc number novelti import face model hybrid facial featur detect face model base dual facial view result realist reliabl face imag vision comput tabl prioriti level workbench extract modul workbench modul prioriti find profil contour fuzzi mouth snake mouth curv fit mouth snake ey ey nn chain code eyebrow curv fit eyebrow find nose chin imag intens facial area mouth shape workbench ensur maxim reduct miss data output facial featur number detector base algorithm built workbench appli circumst perform reduc possibl fail track automat invok detector integr workbench result detector store separ file repres face geometri examin facial form input facial data evalu part fig inform store file redund case detector facial featur perform success workbench output file miss data facial featur workbench output file highli inaccur data facial featur point describ face deal ambigu facial express inform depend twofold suitabl describ au facial view model tabl success ratio detector assign prioriti facial featur detector base inform tabl test result obtain evalu detector base tabl highest prioriti assign detector ey eyebrow base evalu prioriti assign detector facial featur facial featur detector prioriti level tabl deal ambigu facial express inform process reduc adjust set file form output oper workbench check workbench output flag facial featur label highli inaccur process check workbench output section reduct adjust workbench output base prioriti level facial featur detector label assign featur check stage facial data evalu process explain section result deal miss highli inaccur facial data unambigu face geometri featur defin face model extract directli obtain face geometri form input infer engin check facial data imag vision comput deal miss highli inaccur data base kind knowledg neutral facial express knowledg facial proport system observ tool step consist acquir neutral facial express ensur correct extract facial featur neutral facial highli recommend result automat featur detect visual inspect choic facial featur detector manual made inform deal miss highli inaccur facial encount examin facial express facial proport facial characterist distanc distanc ey distanc centr knowledg facial proport acquir imag neutral facial express fact face captur facial proport retain head rotat camera set defin section ensur rigid head motion encount posit head size facial proport remain examin facial express neutral facial express facial view set output file result oper evalu term miss data singl point repres facial file featur label miss case pair featur singl point repres facial featur file label miss featur detect singl point file label miss workbench output file label miss evalu term highli inaccur data evalu process consist step conclud profil contour badli detect result badli perform threshold profil tip nose top forehead deviat ten pixel point neutral facial express slight deviat result facial muscl contract backward pull ear pull border hair forehead top file track profil contour label highli inaccur conclud ey badli detect requir fulfil point repres corner ey point camera set posit fig deviat pixel neutral express posit ey flag badli slight deviat posit corner ey uncov highli inaccur detect narrow widen ey proport ey compar examin express neutral express ey flag badli ey flag badli file track ey label highli inaccur ey flag badli file label highli inaccur procedur appli file result ey detector case import fact muscl contract elong eyebrow camera ensur area size eyebrow remain examin observ person size eyebrow area deviat ten pixel size area measur neutral facial eyebrow flag badli eyebrow flag file inform label highli inaccur eyebrow flag badli file label highli inaccur procedur appli file result eyebrow detector point repres centr point camera set irrespect perform modul find nose correct locat fig extract neutral facial express correctli modul find nose probabl tip chin badli detect high track locat deviat pixel neutral express posit file output modul find nose chin label highli inaccur check accuraci mouth detector pretti difficult task mouth movement mouth elong wide open laugh cry good check mouth track correctli compar track mouth shape subsequ frame facial imag sequenc extract shape differ conclud mouth badli track examin frame imag deal imag check perform consist step open lip fig calcul mouth contour compar distanc lip calcul profil contour fig compar distanc deviat file mouth contour label highli inaccur mouth contour pass check check facil implement fuzzi mouth modul section mouth contour pass file label highli inaccur procedur appli file result mouth detector evalu explain inaccuraci vertic stretch mouth case file profil contour label highli inaccuraci posit mouth corner account inaccuraci horizont stretch mouth form shortcom facial data evalu evalu accuraci modul imag intens facial area modul mouth shape implement modul develop form greater shortcom system fact result modul process system tabl order facilit reason facial modul integr version system file label miss highli inaccur label good facial data workbench output file label miss reduct adjust workbench output proce file profil contour discard label highli inaccur motiv perform detect scheme algorithm test profil imag repres basic emot express shown person imag imag vision comput tabl distribut profil characterist point test set error round higher integ resolut pixel colour depth bit adob profil characterist point manual point human observ imag perform workbench modul find profil contour evalu calcul block distanc differ estim manual locat profil characterist point test imag perform algorithm shown tabl error profil characterist point remain pixel imag error approxim pixel error differ profil characterist point case manual automat estim point defin extrem profil contour automat scheme find extrem curvatur profil contour file output modul find profil contour rare label highli inaccur perform algorithm averag error pixel workbench output result ey detector label highli discard file miss data substitut ey neutral facial express result ey detector highest prioriti tabl process result ey detector discard case file highest prioriti label miss highli inaccur result ey detector lower prioriti substitut data badli ey detector lower discard label highli inaccur relev successfulli ey substitut data badli ey imag vision comput case eyebrow process case ey file result workbench modul find nose chin label highli set neutral facial express reason movement chin base file profil contour label highli inaccur motiv perform modul find profil contour file result find nose chin modul label file profil contour label highli reason movement chin base model case rule tabl replac rule tabl workbench output result mouth detector label highli discard file miss data substitut mouth detect neutral facial express result mouth detector highest prioriti tabl process current process facial data evalu shortcom implement data evalu process discov mouth contour greatli extend horizont length actual mouth data label highli inaccur discard data label relev facial featur detect neutral facial express substitut miss featur accur inform examin facial express lost deal minor inaccuraci encount workbench output enhanc process implement deal facial imag sequenc fuzzi reason facial imag data facial express evolv minim intens maxim intens emot shock interrupt mean global characterist shown express chang drastic short time interv subsequ frame facial imag sequenc system deal imag track facial featur check correspond relev featur track examin frame enhanc facial data evalu process implement fuzzi certainti level assign obtain result assign certainti base accuraci perform facial featur system reason facial data level inaccuraci aspect deal facial imag sequenc develop result facial data evalu face unambigu defin reduc adjust workbench output file featur defin face model extract straightforwardli file result featur detector extract perform model data acquir step process illustr fig model featur form input reason mechan system facial data analysi infer engin call human emot recognit clip expert system remain origin version dealt manual measur facial data refin reason facial data form integr part perform automat facial express classif au categori emot categori classif express au categori section classif emot categori explain section automat face action track exist emot classifi examin facial neutral categori capabl perform classif express blend emot order develop system complex facial face action observ face imag achiev automat face action recognit step perform automat extract facial featur examin facial imag process workbench obtain face geometri automat convert set activ au rule infer engin rule tabl tabl rule repres descript term model valid certifi fac coder produc facial express separ au rule tabl tabl tabl facial featur left unchang dual view record acquir imag express separ au tabl evalu certifi fac coder imag repres activ produc label fac coder result fact rule repres term face model gener linguist descript fac valid test rule au recognit face model concern automat perform face action encod dual view imag repres express separ au activ shown certifi fac coder imag made strictli rule tabl dual view record constant illumin fix light sourc subject wear glass subject sex rang ag ethnic south american averag recognit rate upper face au lower face au imag detect fail complet lower recognit rate achiev automat manual facial express classif au categori point automat recognit error error result facial featur detector integr workbench semant error implement recognit rule improv integr involv improv imag process yield higher recognit rate face action activ au intens level assign intens level assign investig method make intens imag vision comput fig face action recognit perform dual view separ activ au activ au depend intens relat model deform condit reason system remain product rule convert face geometri result facial data evalu set activ form part infer engin fig part classifi shown facial express emot categori emot classif facial express classif shown facial express emot categori sad perform compar descript shown express descript express emot categori descript express characterist basic emot categori tabl descript acquir linguist tabl descript basic emot express term au express descript happi sad anger disgust fear descript basic emot express ekman descript basic emot express tabl repres fact product rule infer engin automat classif basic emot express semant correct rule evalu certifi fac coder produc facial express rule tabl dual view record acquir imag express shown evalu certifi fac coder tabl show distribut correct recognit ratio ratio correct recognit ratio basic emot express obtain train observ achiev averag correct recognit ratio case rule produc emot express valid rule human face seldom show emot express time peopl express emot express basic emot express express lower intens combin basic emot express blend emot express order deal emot facial set hypothesi subset descript basic emot imag vision comput tabl distribut recognit ratio emot express made rule tabl judg certifi fac coder produc express express fear disgust anger happi sad fear disgust anger happi sad tabl product rule infer engin emot classif facial express express classifi emot express hypothesi result set rule recognit blend emot express rule tabl rule repres complet set product rule infer engin rule recognit emot tabl repres combin rule tabl exist semant correct rule tabl evalu record certifi fac coder show relev combin au tabl made set imag imag certifi fac coder judg tabl show distribut correct recognit ratio achiev correct recognit ratio averag case rule tabl produc judg emot valid rule descript shown facial express term weight emot label conclud facial express analysi perform weight assign emot label calcul assumpt form descript emot express influenc intens emot express explain issu facial express illustr fig classifi au emot au emot au emot au emot sad anger disgust anger anger anger disgust happi anger disgust fear anger anger disgust fear anger disgust sad anger disgust fear fear anger happi sad fear anger happi fear sad disgust anger sad sad disgust sad fear anger happi activ tabl facial express express classifi disgust facial express illustr fig classifi case activ rule recognit activ tabl fig intens level assign activ extent jaw drop express fig extent jaw drop measur intens level assign activ express illustr fig classifi ˆ disgust perform automat emot classif facial express test set imag imag repres imag valid rule infer engin tabl imag repres emot express neutral imag blend emot express fig imag vision comput tabl distribut correct recognit ratio emot express made rule tabl judg certifi fac coder produc express classifi produc express classifi produc express fig screenshot output result emot classif facial express illustr fig priori process workbench classifi produc express classifi sad anger disgust anger anger anger disgust happi anger disgust fear anger anger disgust fear anger disgust sad anger disgust fear fear anger happi sad fear anger happi fear sad disgust anger sad sad disgust sad fear anger happi shown certifi fac coder dual view record constant illumin fix light sourc subject wear glass subject sex rang ag ethnic south american imag manual classifi rule tabl perform automat classif evalu count imag correctli classifi weight system imag detect fail complet averag correct recognit ratio encount error result error facial featur detector integr workbench error error estim shown face turn error emot classif face action improv integr detector yield higher recognit rate face action success emot classif face action perform system understand rule emot classif facial implement reason mechan complet base acquir ekman studi interpret shown facial express differ ekman differ system fig rule recognit activ base face model spite fact twenti year theori paul ekman commonli theori correct ekman psychologist school state facial basic emot express psycholog circl doubt correct definit term argu term express ekman stress verbal commun actual emot state goal research form solut psycholog debat automat analysi shown facial thing make system independ psycholog emot achiev retain interpret facil learn facil develop user defin simpli interpret label user decid label predefin system label fig blend sad anger emot express paper present prototyp situat independ system facial gestur imag vision comput tabl distribut correct recognit ratio ratio emot express express express fig blend fear express framework hybrid facial featur detect expert system face action recognit emot classif facial express dual view face model recov face action form integr part human behaviour experi certifi fac coder rule face action base face valid model shape face action local facial region model avoid inaccuraci manual model repres realist human face approach facial featur detect base multipl featur detect techniqu modul integr framework hybrid facial featur detect show result newli develop modul hope give reader indic perform framework hybrid facial featur detect paper present face action recognit strategi base face model multipl algorithm appli parallel redund result improv reliabl solv problem miss erron data encount output workbench deal ambigu facial inform fear disgust anger sad fear disgust anger happi sad result process workbench explain detail result face action recognit achiev accur system face action classif strategi multipl classif facial express basic emot categori number perform certifi fac demonstr valid rule emot classif face action implement system evalu perform fulli autom system facial featur face action recognit face action emot classif perform accur system system deal static face action facial motion specif defin camera set facilit system problem head motion system requir special marker user ongo work model facial deal facial imag perform system develop fuzzi expert system face action track face action emot classif qualiti system reason involv face action accuraci perform facial featur track design develop learn user defin interpret make system independ psycholog debat emot refer jn facial motion percept face emot journal human percept perform mj facial express imag sequenc local model imag intern journal comput vision ah effect visibl dialogu perform problem solv languag speech lawrenc east aj jj track optic flow discrimin subtl differ facial ieee intern confer automat face gestur pp van jd comput wv prentic wv facial action code system consult psychologist palo emot human cambridg ia ap code analysi interpret imag vision comput tion facial ieee transact pattern analysi machin intellig aj facial express review literatur aw nonverb behaviour lawrenc erlbaum pp graphic academ rm lg comput robot ld mk pf machin identif human pattern recognit ce face activ contour intern confer comput pp descript synthesi facial express base tl visual pp gd machin interpret design expert system interpret facial express term signal emot cognit scienc facial interact anim face robot human ieee intern confer man pp imag edg detect edg trace fuzzi ieee transact pattern analysi machin intellig jj jf cc autom facial express recognit base fac action ieee intern confer automat face gestur pp bd iter imag registr techniqu applic stereo seventh intern joint confer artifici pp commun psycholog todai emot space analysi synthesi facial ieee intern workshop robot human pp model facial express emot recognit human comput geometri cambridg autom nonverb commun facial sc pp ey track templat match automat codebook gener annual confer pp gx jn handbook comput vision algorithm imag crc boca van workbench facial express dia sc pp ja recognit emot facial review psycholog bulletin gm dr role visual commun social britain journal social clinic psycholog analysi synthesi facial imag imag vision comput sequenc physic anatom ieee transact pattern analysi machin intellig nm face virtual ieee rj van prototyp stress sc pp jm dj ra imag featur locat imag hierarchi neural network vision natur chapman dj fast algorithm activ contour curvatur comput vision imag imag understand jc mix artifici neural network approach autom recognit mouth eighth intern confer artifici neural pp jc analysi facial express base annual confer yt jf cc optic flow estim wavelet motion sixth ieee intern confer comput pp visual inform categor facial express appli cognit psycholog face workshop applic comput pp classifi facial emot backpropag neural network fuzzi intern confer neural inform vol pp
IR/1270 5 system automat person track scientif literatur web kurt steve lee gile nec research institut nj abstract introduc system part digit librari project automat track scientif literatur relev user research interest unlik previou system simpl keyword track recommend topic relev paper keyword base queri profil fail made heterogen profil repres user interest profil includ includ content base measur track system integr search facil user great flexibl tune profil match interest softwar system sampl onlin public servic user citat knowledg inform filter introduct human current import time effort requir enorm problem handl creation period quantiti public modern inform scarciti inform overload rate public scientif literatur grow make increasingli harder research relev publish work advent digit librari technolog overload easier method search publish fourth acm confer digit ca august copyright associ comput machineri period newspap consid roman began bc scientif research expend great deal time effort public interest introduc system perform autonom citat index scientif public web user wai tradit digit librari facil citat link find cite cite paper interest work summar citat context make quick paper citat statist includ number citat cite paper identif spend time make literatur search possibl download paper effort user put search forgotten lost user perform search topic find relev paper time search perform requir repeat manual labor search find paper time introduc track system profil repres user topic interest scientif literatur examin public determin paper relat user interest user alert web base interfac simpl keyword match determin user interest paper heterogen measur identifi relat document citat link monitor discov citat exist paper track interest paper configur facil user chang profil close reflect interest repres user interest track system act proxi user interest attempt decid newli paper interest user worth mention order system accur repres user opinion interest reli number user notion interest paper paper deem satisfi requir import reason person search literatur manner person set techniqu find paper repres user interest profil consist heterogen set wider varieti user accommod singl adequ captur user consid interest user opinion complex type partial cover user notion make paper interest gener method determin paper constraint match featur constraint match user describ interest paper constraint includ method keyword match text metadata constraint sourc url featur user set paper find paper relat set constraint match highli effect method determin paper relev constraint match digit librari search featur includ manual classif featur determin relev document includ constraint match method includ user profil keyword match commonli keyword match care effect mean detect relev paper context keyword high impact relat keyword central idea paper keyword context restrict specif part document part includ main bodi text document greater reliabl determin titl paper postscript titl paper download header begin paper till begin section abstract header import inform author refer paper publish user keyword match titl discrimin word titl versu word author affili keyword match power method identifi interest paper requir explicit determin good difficult poor keyword undesir paper incorrectli identifi interest good keyword valuabl paper miss varieti form relev addit keyword citat link citat previou publish research ti scientist work result earlier research build public cite paper indic effect cite work research commun indic refer end paper user search citat link cite paper context citat main text paper present citat context form summari assess cite work cite work import cite paper interest track system user interest citat cite paper user inform exist user interest citat public citat research work valuabl feedback prolif citat work time consum metadata metadata descript tag provid inform relev scientif public paper record url public link user url paper link ad list paper recommend form relev import user public research group institut limit url track relev literatur mirror keyword match extran url result uninterest paper recommend miss url paper miss form metadata includ futur version track system relat paper user perform literatur survei topic essenti end collect relev literatur keyword metadata user interest profil relev public cite found paper match constraint user simpli paper relat identifi paper measur attempt captur user notion paper task major identifi featur document semant creat function featur rang space distanc repres semant distanc case defin repres user attempt approach challeng gener inform retriev system interest special case scientif make problem easier scientif document creat set featur extractor applic scientif fx featur vector extract document measur document perspect small unrel topic larg talk relat issu idea challeng simpli amount good featur extractor challeng measur heterogen mixtur paper measur text base citat base measur determin paper relev user text bodi text long string common document collect word frequenc uniqu word measur featur vector extract document compon presenc uniqu word frequenc word document form measur term frequenc document frequenc scheme featur set vector word frequenc weight collect document set word document frequenc word stem ds number document stem document highest term frequenc dmax tfidf scheme word weight vector element ds calcul ds ds jdj ns jdj total number document jw vector ds valu featur vector extract distanc calcul dot word stem gener porter algorithm product euclidean distanc measur tfidf document dot product word vector tf idf tfidf distanc abstract text bodi paper determin newli paper relat paper user tfidf threshold abstract full consid relev recommend threshold tune futur adjust user learn user feedback total number uniqu word stem jw collect document jdj present sparsiti problem tfidf approach varieti wai chop smallest term reduc map latent semant index citat word base similar measur advantag specif featur scientif public addit word base similar common citat make estim document scientif paper cite previou paper relat cite work obscur power indic citat extrem cite public measur captur idea call citat document partial analog word vector base tfidf frequenc citat collect document wd vector frequenc di boolean indic document citat result boolean vector newli download document document interest defin wd trace function outer product document set threshold consid relev futur intend explor refin inform citat placement text context profil creation profil machin user notion interest public creation user profil integr process search function find paper interest home option edit profil recommend add document feedback paper order order search gile lee gile gile gile comput scienc document citat citat found click link cite document context citat track document citat articl cl cb hh gz yc lee learn extract finit state automata recurr neural network neural context bib relat track check stork deriv network optim brain surgeon advanc neural inform process vol page morgan san context bib relat track check higher order recurr network grammat infer neural context bib relat track check denker effici pattern recognit transform distanc advanc neural inform process system san morgan kaufmann context bib relat track check dayan hinton reinforc learn advanc neural inform process page san morgan kaufmann context bib relat track check section delet includ graph main number citat gile lee gile gile gile search citat citat search index articl citat figur result queri citat lee abbrevi queri cover wai lee abbrevi citat user web browser cooki assign user uniqu identifi number uniqu number track profil user remain anonym greatli simplifi process updat profil minim user effort user provid address recommend period order begin build user simpli citat cite paper document relat paper keyword url add profil citat figur show result queri citat lee order list exist citat paper extract finit state automata recurr neural includ user simpli context link citat interest track cite link chosen home option edit profil recommend add document feedback paper order order search support vector machin comput scienc document citat track document match queri retriev document document found order number citat detail context train support vector applic face detect osuna robert freund girosi center biolog comput learn oper research center massachusett institut technolog usa support vector applic face detect usa abstract investig applic support vector machin comput vision svm learn techniqu develop vapnik detail context support vector train applic massachusett institut technolog artifici intellig laboratori center biolog comput learn depart brain cognit scienc ai memo paper robert cognit scienc ai memo paper support vector train applic robert freund public abstract support vector machin classif techniqu develop detail context gener perform support vector machin pattern classifi gener author design sampl page peter bartlett australian nation john royal london author design sampl page gener perform support vector machin pattern classifi peter bartlett australian nation obtain high confid gener error bound support vector machin pattern classifi relat svm detail context featur select concav minim support vector machin bradlei comput scienc depart wisconsin wi mangasarian comput scienc depart wisconsin wi select concav minim support vector machin bradlei comput scienc depart wisconsin dimens space determin plane minim support vector machin approach addit minim weight sum support vector machin search citat citat search index articl citat figur result queri document term vector add citat profil paper make citat ad recommend user potenti interest document figur show part result queri full document term vector user interest paper support vector applic face detail link shown figur activ bibliographi section shown figur list document relat similar user track paper relat track relat document link chosen add document user profil detail exist relat document document relat track order add keyword user track document match queri button main search shown figur document match queri train support vector applic face detect osuna robert freund girosi center biolog comput learn oper research center massachusett institut technolog usa context sourc html track relat document investig applic support vector machin comput vision svm learn techniqu develop vapnik team bell method train neural radial basi function classifi surfac found solv linearli constrain quadrat program problem optim problem challeng quadrat form complet memori requir grow squar number data point present decomposit algorithm global train svm larg data set main idea decomposit iter solut evalu optim condit gener improv iter establish stop criteria algorithm present result implement demonstr activ bibliographi detail context support vector train applic massachusett institut technolog artifici intellig laboratori center biolog comput learn depart brain cognit scienc ai memo paper robert detail context rotat invari neural face detect henri rowlei baluja kanad decemb school comput scienc carnegi mellon pa pittsburgh research center henri street pa citat made context detect local face digit imag pattern recognit context burg simplifi support vector rule intern confer machin page context cort vapnik support vector network machin context vd malsburg determin face posit pose learn base graph technic report januari section delet figur document detail user select paper recommend user recommend combin web search web mail list monitor continu search scientif public public method check item match user profil notifi user recommend user begin session web base alert exist recommend main page user displai recommend recommend document displai compon profil find document figur show demonstr recommend page paper match keyword vector relat paper support vector applic face shown recommend home option edit profil recommend add document feedback paper document recommend comput document found support vector machin detail track relat reduc complex support vector machin august osuna girosi center biolog comput learn massachusett institut technolog ma usa document relat robert girosi train support vector applic face detect ieee confer comput vision pattern page detail context track relat face detect earli concept preliminari result baluja pittsburgh research center henri street pa school comput scienc carnegi mellon pa figur paper found recommend user potenti interest paper match paper suffici relat paper user interest import ad profil check exist user profil daili recommend user desir user provid valid address option page link main page address recov user uniqu browser cooki lost unavail profil tune easi add keyword profil process search web interfac detail profil stai interfac simpl eleg user evalu profil delet compon profil link main user present profil figur shown document user profil user compon desir ad delet profil user tune profil reflect interest previou work function perform fit lot research umbrella track system thought inform retriev system perform content base inform filter great deal inform filter research text base document import issu concern research includ document classif techniqu comparison learn user profil improv qualiti inform filter studi measur find interest public cast rout cluster data mine inform filter research problem gener structur document track advantag rigid structur scientif public featur repres relev internet specif track system similar capabl provid web page track locat system system find relat web page distanc measur base word vector featur page link find relat page work system alert user manual identifi interest web page gener inform filter scientif public track system track capabl partial share commerci tool provid institut scientif inform provid larg citat index scienc citat index citat link citat context support track paper keyword discov agent sort heterogen home option edit profil recommend add document feedback paper user profil comput keyword support vector machin track titl header abstract bodi vapnik track titl header abstract bodi url document robert girosi train support vector applic face detect ieee confer comput vision pattern page citat autonom web agent automat retriev identif interest public agent delet make delet make add queri delet add url delet delet figur sampl profil user user add delet compon reflect user interest close file inform track paper support archiv track submit scientif literatur archiv requir manual classif submit track match classif track system user automat date public web relev research interest user easili defin profil consist heterogen research interest system find potenti relev paper base profil recommend user email web interfac system uniqu abil find paper base heterogen measur track interfac tightli integr minim effort requir user creat tune profil softwar cost demonstr comput scienc public servic demonstr found index comput scienc articl million citat futur work track system power mean automat date research topic direct intend provid enhanc user profil updat process made easi intend explor learn implicit feedback base system track document assess interest paper found relat inform adjust sensit paramet great deal interest collabor filter text document investig method user profil enhanc individu profil recommend document interest futur hope expand capabl recommend author ad back track profil acknowledg eric robert eric haym steve bob andrea michael andrew michael craig brian ben warren david waltz comment suggest refer institut scientif adapt web page recommend servic intern confer autonom agent issu machin learn user profil aaai spring symposium machin learn inform access march autonom web agent automat retriev identif interest public intern confer autonom agent sycara acm pp index latent semant analysi journal societi inform scienc survei inform retriev filter method maryland technic report citat theori applic human ancient rome daili gazett journal histori automat citat index system digit librari acm confer digit librari june shipman acm pp learn user inform interest extract semant phrase aaai spring symposium machin learn inform access march autonom citat index ieee comput adapt retriev agent heurist neighborhood inform discoveri machin fourteenth intern confer pp inform discoveri filter multiag evolv ecosystem confer practic applic agent multiag technolog syskil identifi interest web site nation confer artifici intellig algorithm suffix strip program relev feedback inform retriev smart retriev experi automat document process pp term weight approach automat text retriev tech report depart comput cornel specif term valu automat index journal document sch comparison classifi document rout problem sigir pp social inform algorithm autom confer human factor comput system mine structur inform web sixth intern world wide web confer chang web aaai spring symposium machin learn inform access yao measur retriev effect base user prefer document journal american societi inform scienc
DB/1271 3 april paper juli virtual document interpret inform csiro mathemat inform scienc st vic australia inria rocquencourt bp le chesnai franc hill virtual document interpret inform virtual document interpret inform abstract import inform electron publish rare achiev satisfactorili complex integr handl updat address document author intuit approach address problem dynam gener updat document descript definit virtual document paper present document interpret gather inform multipl combin dynam produc virtual document strength approach gener inform object enabl access heterogen data interpret evalu permit minimum inform object data sourc virtual inform activ document synthesi introduct recent advanc electron publish greatli modifi concept document direct instantan access document longer constrain dynam includ piec inform document data transform reflect updat great document product larg involv part document virtual document defin hypermedia document gener user input document proven inform retriev wai implement virtual document rang simpl java applet advanc server disadvantag function make difficult write document repres exampl virtual document system produc natur languag descript home page hill anim knowledg dynam document distribut sourc produc person system gener explan major drawback system specif domain applic inform attract attent web commun queri languag retriev inform semistructur structur sourc lorel languag show full potenti integr document product process paper present virtual document interpret address plural heterogen sourc interpret queri combin data sourc format effici evalu applic gener document costli perform rare interpret previou document push idea interpret storag intermedi result integr lifecycl document write virtual document involv formul queri data possibl modifi queri result process implement coupl interpret evalu document prescript paper organ give overview goal architectur approach present data structur exchang inform data sourc detail describ structur produc evalu store discuss integr strategi editor virtual document electron publish rio inform project aim develop techniqu support inform context focu project move direct queri sgml includ construct primit virtual document interpret inform document interpret virtual document data sourc html oodb data sourc result data sourc document prescript author editor adaptor adaptor adaptor data sourc sgml adaptor figur integr approach virtual document publish specif interpret virtual document enabl structur inform heterogen sourc figur show strategi virtual document publish context instruct construct virtual document store document process document interpret gener updat virtual document editor facilit write document connect document interpret order provid dynam edit document prescript consist static structur text chang document command gener dynam part document transform convert inform object document object document prescript written sgml deriv html enforc complianc formal dtd static data express normal sgml construct queri transform instruct express sgml process instruct kind make easi turn static document virtual modifi dtd hill figur simpl document prescript nativ send request data sourc specif languag sql relat url html pick written languag design combin result provid search capabl data sourc lack featur figur show simpl document prescript gener html document list staff member pick fetch header html insert sgml code document pi produc output virtual store result sql queri retriev staff member relat variabl map iter staff member produc element staff content simpl show featur complet formal includ exampl join combin express figur path perform select result manner syntax inspir path express express find children label level express find children label level bracket modifi select child rang children role document interpret gather combin inform data instruct document map virtual document document interpret deal main integr distribut data effici dispatch queri data sourc assum local refer imag local convert global refer virtual document interpret inform inform object call inform object piec inform document interpret gather data sourc manipul order gener virtual document common inform object sql tabl html document treat interpret requir common system fuse data requir inform object interpret object store machin remot host minimum interpret access inform inform object implement implement data sourc program provid connect data sourc simpl queri implement left data sourc nativ document interpret approach defin interfac inform object data structur interfac shown figur idl languag inform object list children interfac make assumpt inform store data sourc data sourc build inform object demand avoid unnecessari html inform object map markup tag structur instruct call inform object structur tree node elem node composit children order sgml label tag children element node text node children correspond pcdata hill interfac node access enum string sequenc boolean comparison return true node match label type boolean string boolean boolean string string string figur idl interfac inform object attr node attribut elem node label child attribut correspond tag attribut sgml list node composit children order nativ queri path express return list interfac defin simpl comparison document interpret addit implement path express instruct includ entir inform object virtual document section document interpret interpret document prescript consist illustr figur document prescript produc prescript object storag thing distinguish element attribut children structur node type unifi path express virtual document interpret inform result sourc data prescript object prescript document virtual document integr inform object evalu figur document interpret process evalu inform object data sourc store result integr combin inform object includ virtual document describ step detail process translat document sgml set prescript object step order associ addit inform queri transform modifi document multipl interpret document share inform multipl document parser divid document prescript prescript contigu static data constitut prescript part map map instruct sgml element constitut prescript object defin instruct split prescript variabl assign pick instruct path select prescript object nativ queri prescript object hill variabl prescript declar iter variabl map document prescript shown figur gener prescript pick role prescript object captur depend dynam part document binari function return true ff depend practic fi ff updat true set depend prescript object ff ff trueg function dep introduc partit prescript object call prescript tree prescript root child child child evalu aim evalu process produc inform object prescript object involv send nativ queri data perform select transform result express pick assign repetit tag evalu occur prescript object updat previou evalu section explain achiev inform result result store prescript inform depend gener gener time prescript languag user construct inform add remov inform virtual document interpret inform object ff ff gener time depend ff fi equal fi time evalu ff ff depend equal time set store depend prescript object ff sd ff fi fi depend ff fi newer prescript object fi gener object ff set current time prescript object evalu prescript children evalu depend root tree evalu prescript object ff updat result condit ff sd ff fi depend object store object gener time store depend note prescript object updat event depend time inform condit depend prescript object gener subcompon defin variabl depend arbitrari prescript object evalu nativ queri encod prescript object document interpret compar ff time data send queri data sourc differ easi achiev present problem data sourc data sourc lack return current time evalu time url updat updat occur evalu html http protocol modif date content gener includ file hill object updat store result includ static object evalu case consist return string prescript object staff time document reevalu time updat simpl techniqu minim case modif document prescript document prescript alter staff list retriev staff similar object updat set dd updat dangl version control ensur correct evalu case multipl assign variabl practic recommend defeat result integr step combin map result evalu process virtual document result inform straightforward combin includ document inform object map virtual document textual content answer node inform object children attr concaten whitespac separ structur answer elem node tag attr children node content node pcdata children list node includ list default result includ predic predic perform direct map inform assum evalu gener time equal virtual document interpret inform ject futur sophist dtd map coupl editor import strength virtual document system focu document process virtual document prescript document bring prescript index search importantli user interact document document feel point aim virtual document system make easier peopl write virtual document crucial part virtual document system editor make easi write virtual document prescript section virtual document prescript languag static queri extern data instruct transform result queri requir edit part document prescript edit static data virtual document prescript languag base structur document languag editor static part virtual document prescript requir structur document editor import provid author view document structur document import requir editor support edit document structur content editor enforc document structur result conform structur requir dtd case flexibl user structur temporarili whilst edit interpret check virtual document prescript conform requir reli editor map dtd achiev moment construct modif instruct languag idea sgml part document editor sgml document tradit word processor hill edit data queri order enabl author construct edit data queri virtual document prescript editor provid view data sourc queri access edit author structur data sourc schema relat dtd sgml document class structur data sourc editor present kind data paradigm import present structur accur model data sourc nativ queri languag author correctli data sourc queri languag work relat tabl displai graph relat edg class structur diagram common oo methodolog booch rumbaugh tree structur dtd structur approach gener principl good design import virtual document system type data sourc data queri easi author languag queri editor displai data sourc reflect queri languag edit transform instruct editor enabl author edit virtual document prescript transform instruct requir author intern tree structur section structur reflect syntax semant transform instruct virtual document preview virtual document prescript editor provid facil author preview virtual document instanti aim provid user option view displai structur content separ window show virtual document show instanti virtual document similar structur editor displai virtual document interpret inform document structur present window requir editor commun virtual document prescript interpret portion interpret modul preview facil resolv data sourc queri transform displai error boundari condit result queri instruct virtual document queri return error data data requir preview facil virtual document editor perform partial evalu document user edit queri part document editor displai part complet document complex structur depend virtual document develop partial evalu strategi aim user control document evalu chang made part document prescript develop reevalu time chang inconsist part document depend user request part document prescript depend chang part remov inconsist stabl virtual document approach electron document publish facilit inform view virtual document restrict form activ document focu paper document interpret import point neglect literatur natur addit document interpret evalu document prescript object share data sourc evalu parallel distribut natur data interpret greatli benefit parallel interest addit provid version straightforward store depend approach prototyp applic virtual document prescript gener activ report implement queri feel major impact approach resourc discoveri data queri languag act select result hill work integr editor satisfi requir defin section integr add function import edit virtual permit partial evalu document part document edit increment evalu part incomplet document prescript evalu refer wiener lorel queri languag data journal digit alan editor inform retriev hypertext kluwer academ booch analysi design applic redwood vincent user scholl structur document queri facil acm sigmod confer manag page vassili sophi guido moerkott evalu queri gener path express acm sigmod intern confer manag page june franca luca paolo inform hypermedia applic seventh acm confer march object manag group syntax semant common object request architectur chapter juli rice virtual document gener technic report knowledg system extract semistructur inform web workshop manag semistructur page levi document document system electron decemb jacqu le elisabeth annot corpora languag csli lectur collect linguist cambridg maria robert dale text gener dynam hypertext environ australasian comput scienc januari februari donald norman design everydai thing publish psycholog everydai virtual document interpret inform object fusion mediat system twentieth intern confer larg vincent interact system structur document manipul text process document intern van cambridg page vincent make structur document activ electron publish june jame michael william frederick william model design prentic martin christian terri winograd share web annot platform inform usag exampl stanford integr digit librari project comput scienc stanford novemb jon hill inform virtual document australian document comput melbourn page april eric van practic edit kluwer academ paradi descript languag inform object virtual document intern confer inform system novemb
DB/1272 3 reclust data martin cern ep ch geneva switzerland abstract larg collid build enter oper experi gener pb data store odbm good object cluster disk drive critic achiev high data throughput requir futur analysi scenario paper present reclust algorithm data maxim read transfer rate object multipl overlap collect work store object number chunk rearrang mean heurist solv travel salesman problem ham distanc result prototyp present scientif object queri introduct atla experi due data year store approxim pb data year data expect lead total data sampl pb data detector split chunk data call correspond particl event data hierarch natur bulk data rare addit level vari reduct factor access frequent data store manag system applic control physic dep austria preprint submit elsevi preprint fig overlap collect fig collect split atom region object placement specif cluster hint cluster proven perform enhanc techniqu analysi job larg collect object collect object store object refer critic point perform job paper address cluster object multipl overlap collect data access data show special properti simplifi task data event independ relationship individu event fact event complet independ reclust algorithm import constraint order event collect irrelev physic point view reclust algorithm freedom advantag chang order event insid collect ref mathemat treatment cluster problem unifi descript heurist cluster algorithm cluster strategi work collect level suit data advantag freedom rearrang event insid collect altern approach automat reclust object larg present set object contigu store object duplic access engin transpar care copi object analysi job cluster algorithm ham cluster algorithm nicknam reduc cluster problem ham salesman simplifi discuss cluster algorithm explain case event split numer consist length atom region ham distanc block sequenc ham fig atom region collect cluster ham distanc atom region block sequenc ham length fig atom region collect cluster atom region sort ham salesman heurist object venn depict fig collect repres collect object access analysi task common consist call subsequ aim good cluster find object order read time analysi task minim collect divid plane atom region depict fig denot complement collect regard atom region determin set relat object atom access analysi task access good cluster strategi cluster object insid atom fig issu order atom region collect object sequenc maxim set object collect call object contigu store object sequenc fig block depict bold line collect union block disk search requir move drive head object block object block read sequenti number disk search requir read collect equal total number block reclust algorithm find order atom region total number block minim ham distanc length number digit atom region assign reflect membership atom region collect map illustr fig sequenc atom region deriv famili collect total number block relat denot bit vector sum call ham length object sequenc relat illustr fig fig minim number block search shortest path set regard ham distanc instanc ham salesman problem travel salesman problem numer heurist find approxim treat case event consist numer object cluster declust object stream event header store track hit order object insid stream cluster algorithm ham analysi job access hit track event experi perform degrad stream access read individu object problem solv implement read fix number object stream stream logic investig stream perform degrad report prototyp commerci odbm built perform cluster benchmark perform solari ultra system ultrasparc processor disk drive seagat elit disk disk transfer rate disk averag seek disk averag latenc msec result depict fig fig object size kb kb number object store page size odbm kb case find approxim nearest neighbor algorithm obtain speedup complex function object number distribut select data sampl present paper collect reclust speedup order magnitud found experi simul shown collect number read rate read rate fig read rate measur number select object size kb read rate read rate fig read rate measur number select object size kb hundr speedup expect refer atla collabor atla comput technic technic report naughton stochast approach cluster object base sigmod record special interest group manag june moerkott cluster object theori practic lectur note comput automat reclust object larg high energi physic proc idea page ieee reclust high energi physic data intern confer scientif statist juli salesman problem bit travel comput solut tsp applic lectur note comput cluster reclust data object proc
Agents/1273 1 analysi design system stephan christian jochen germani abstract visual model facil uml provid suffici mean support design system investig develop phase requir code gener multi agent system requir analysi extend case diagram identifi agent relationship environ design stereotyp class object diagram model agent type relat goal strategi diagram defin static agent system dynam agent behavior model statechart respect bdi agent approach code show diagram gener code execut agent specif languag integr exist framework introduct design system complex demand task agent softwar treat principl design system agent architectur lot work develop specif agent work direct solv softwar engin problem result advent agent system softwar distinguish ordinari softwar system kei characterist agent reactiv tempor continu system literatur distinguish micro macro view micro view consid local behavior individu agent environ interact intent investig macro view agent commun interest method techniqu verifi system standard design methodolog establish interest agent metaphor claim suitabl conceptu aspect complex system earli design approach consid visual model approach success unifi model languag unifi approach led idea appli uml design ma uml provid mean captur agent relat model aspect cooper recent effort extend uml model system uml improv macro aspect agent system agent interact design micro aspect agent complex miss knowledg approach cover complet design ma applic respect code gener paper focu aspect present engin approach base ma design support rapid prototyp autonom agent complex behavior model agent softwar system built object orient system implement program languag prior implement analysi design conduct model languag model languag develop final led advent unifi model languag standard uml omg uml wide industri academia uml consist form diagram case diagram captur requir interact user system built static structur diagram class diagram model static structur aspect system statechart diagram activ diagram appli model dynam softwar system implement diagram support model distribut compon system softwar construct tremend facilit tool softwar engin construct uml model softwar system built analysi design support softwar engin code gener consist check model system softwar model uml extens uml agent uml approach made establish model languag agent opinion agent success code gener techniqu support softwar engin develop system show model agent uml map uml model implement relat work softwar engin back gaia methodolog gaia approach analysi design system identif kei role system detail role model construct role map agent class model gaia base uml multiag system engin methodolog wood al goal agent class model commun class diagram notat approach mase includ mean model rule plan agent characterist role model graph transform introduc order model agent role oper perform agent global graph transform requir local graph transform model autonomi aspect agent graph transform model agent conceptu remain unclear transform system implement modifi uml softwar engin idea extens case diagram agent inspir techniqu extens includ adapt sequenc diagram repres agent interact protocol describ adapt uml fulli support model system show intern agent goal strategi achiev goal captur uml map diagram exist agent system describ map briefli sketch specif languag effici design complex ma system combin bdi micro view agent fipa acl macro view valid agent behavior gener select messag messag read control event input action output intent belief strategi control gener figur micro view agent specif agent base agentspeak guard horn extens complet specif cover definit agent individu control behavior intern state set intent figur belief agent local world model basic compar fact logic program strategi plan achiev goal discuss detail intent instanti strategi execut agent agent continu observ environ base observ perform send messag modifi belief behavior agent basic defin strategi strategi compar logic program agent strategi formal defin extend guard horn form bodi defin prioriti head strategi describ event agent perceiv order instanti plan guard element defin test condit argument perceiv event satisfi test condit valid strategi consid applic prioriti applic strategi agent distinguish type strategi guard test valid local strategi consid reactiv strategi guard includ strategi evalu guard requir specul comput evalu strategi order reduc goal level commun agent requir strategi strategi commun multipl strategi reactiv strategi delib turn commun strategi optim perform agent suspend execut strategi resum suspend special oper strategi intent event event select relev plan intent select execut messag action plan select context test event applic plan figur agent execut cycl oper semant agent mean abstract interpret illustr figur interpret manag execut agent activ interpret loop oper agent interpret control function control event plan intent select interpret start select perceiv event set relev plan process select event identifi precondit relev plan check belief plan store agent extract set applic plan precondit satisfi applic plan set select pursu strategi plan instanti agent intent concept agent investig plan parallel instanti interpret select intent execut start top element execut result direct send gener event interpret advanc process event agent defin specif languag context model agent behavior agent belief strategi relev focu specif fact plan fact structur list identifi fact fact plan consist identifi descript indic function goal plan design function definit guard horn achiev delib addit definit failur section defin elabor evalu bodi fail control structur wait parallel execut block appli failur section agent integr mecca agent manag framework implement fipa acl commun standard agent read write messag specif commun adaptor intern messag transport channel mecca system agent commun fipa compliant agent mecca framework shown figur illustr engin approach agent case studi figur mecca architectur plicat virtual world section case dog versu cat case studi autonom agent virtual chase game dog cat actor insert confin goal charact avoid chase charact cat goal avoid escap dog chase agent strong tendenc reach complex behavior enabl improv chanc success cat hide techniqu evad dog long hierarch fuzzi logic control model anim movement behavior pattern dog cat high cat make sharp left easili model fuzzi logic simpl fuzzi control process angl veloc hierarch organ result present show suitabl mean simul complex behavior agent autonom agent process sharp valu chase approach make custom fuzzi logic control librari develop recent fuzzi control easili system fuzzi rule base model special fact control oper infer model action approach requir extens type due strategi reach depend conflict goal vari import weight goal simul design agent behavior trivial figur show applic graphic librari present figur dog cat applic agent model map give overview model system uml map uml model micro view agent extend uml adapt support model system introduc stereotyp design case diagram appli captur interact system user order account notion distinguish ordinari user model agent model actor squar element environ model cloud ordinari goal case reaction case introduc express stereotyp case goal case serv mean captur high level goal agent reaction case model environ directli influenc agent arc actor reactiv case express actor sourc event trigger case figur illustr case dog trigger reactiv case cat agent tree trigger case cat case agent class diagram develop bdi agent agent fact react observ event environ commun interfac agent model activ impli thread control figur order captur agent relat aspect figur dog cat case diagram system make fact model attribut agent agent strategi goal strategi dedic fulfil goal event environ perceiv agent model ordinari oper method interfac agent note relationship reactiv case oper method interfac agent newli introduc compart fipa interfac model fipa messag agent respond figur agent class diagram cat goal strategi prioriti attribut default strategi rule consist precondit action model oper compart introduc precondit return boolean introduc instanc diagram concret object system term uml object diagram instanc diagram captur initi configur system figur illustr main part instanc diagram cat case studi attribut strategi initi goal set specif initi valu figur agent instanc diagram cat order captur dynam diagram uml dynam defin agent react messag environ commun agent micro action order achiev goal strategi consid plan order achiev goal strategi consist precondit form oper statechart provid model plan agent figur high level plan avoid dog distinguish detail plan plan illustr figur show plan cat avoid dog plan inact store plan librari percept activ analyz current situat cat escap plan inact plan view gener templat agent plan plan model plan visual refin plan lead detail level plan order map uml model restrict plan conform format precondit action statechart consist compound model precondit model bodi formula precondit compound oper precondit compart strategi call figur detail plan avoid dog plan avoid dog present figur precondit cat receiv posit current posit dog condit cat proce plan fuzzi rule appli calcul cat direct veloc addit present appli statechart agent micro view aspect process event perceiv select strategi strategi applic model agent behavior respect fipa standard commun macro level sequenc diagram model interact present briefli discuss extract inform present diagram gener code gener agent initi set belief valu recal figur code agent cat part due space fact posit tupl fact boolean method method interfac reactiv plan precondit gener goal event perceiv agent fire plan reactiv plan precondit gener diagram figur complex plan gener strategi explicitli model class diagram figur instanc statechart diagram figur code achiev parallel achiev achiev execut empti note plan prioriti instanc plan bodi statechart code present valu local variabl fuzzi oper miss extract detail statechart complet result code agent initi goal extract instanc diagram cat case studi initi separ achiev achiev code gener agent specif complet defin select function agent interpret select goal inform instanc diagram addit statechart diagram base observ uml provid suffici mean design develop dedic diagram extens respect develop requir analysi identifi agent relationship environ case diagram actor symbol case stereotyp design extend class object diagram model agent type relat goal strategi model dynam restrict format statechart micro view agent shown execut agent specif code gener present uml diagram investig code gener appli program languag make approach flexibl acknowledg gratefulli acknowledg marku work implement case studi paper guido anim creator provid power tool develop actor refer odel agent formal multiag softwar system proc workshop softwar june bauer steiner mecca system refer manual intern siemen integr visual model system proc int confer autonom june requir specif design system graph role uml proc workshop softwar june fipa fipa specif fipa acl messag structur specif foundat intellig physic flake geiger agent complex design implement agent theori agent implement proc european meet cybernet system april model holon manufactur system fuzzi control intern confer north american fuzzi inform process june franklin graesser taxonomi autonom agent proc intern workshop agent languag page geiger rapid prototyp interact anim phd septemb geiger prototyp complex plan base behavior actor proc int confer autonom june fuzzi clever dog smart cat technic report eth iglesia garijo agent orient develop intern workshop agent languag volum page juli springer object manag group omg unifi model languag specif version march model van bauer repres agent interact protocol uml proc workshop softwar june rao bdi agent speak logic comput languag european workshop model autonom agent shapiro famili concurr logic program languag acm wood deloach overview multiag methodolog proc workshop softwar june kinni methodolog analysi design annual confer autonom page wa acm
Agents/1274 1 evalu surfac realiz gener multimod act commun depart comput toronto king colleg road abstract describ applic domain requir comput simul commun interlocutor express commun disord import evalu call surfac commun agent discuss relat exploratori studi introduct spoken act speech act theori physic act perform act act utter sequenc shout illocutionari act act perform act act result act illocutionari act stand relationship multipl illocutionari act correspond illocutionari act accomplish multipl act act commun perform multipl mode commun act accomplish illocutionari act refer speaker isol mode speech deictic linguist gestur type deictic facial torso head movement distinct made embodi agent illocutionari act perform repres agent architectur plan commun form inform speech act aspect act accomplish multipl act commun plan multipl surfac realiz commun articul afford agent plan describ agent necessarili act convei illocutionari compon plan commun action act task deriv surfac realiz commun plan call surfac realiz gener multimod utter commun agent differ natur languag gener output modul agent architectur preliminari subsequ pass graphic output nlg readabl text agent behaviour output agent modul architectur includ reactiv product commun behaviour bypass process plan gener strategi avoid unnecessari comput step output type content determin import preliminari commun task subsum agent architectur human perform multimod act spoken mode commun coordin rel time action multimod commun act affect act interpret modul eca carefulli coordin agent mode necessarili interest emul human commun behaviour accur requir desir applic interest avoid unintend undesir consequ poorli coordin multimod commun act interest capit benefit order mode modul identifi capit interact ensur consist user sensit argu process agent architectur gener speech act act commun perform mode mode commun gener theoret consequ order illocutionari act perform listen recogn illocutionari intent speaker multimod act intent easili principl multimod commun doesnt make attribut result slope distinct commun process inform process blur commun make commun plan suffici articul embodi architectur potenti weigh multipl surfac realiz commun explor detail subsequ describ applic domain select import current research goal current research model commun involv interlocutor express commun disord cerebr function speech aac devic clinic provid individu mode speech focu commun disord physic disord individu commun includ articul underli mode speech articul underli mode facial gaze commun articul physic mean act commun perform stand relationship mode statu commun articul determin mode commun term usag refer physic manifest commun abstract properti share system mean act multimod utter produc articul constrain version produc individu physic disabl aid commun adapt perform multimod utter aid mode speech select linguist mode commun higher likelihood understood properli mode aid mode fatigu slow point breakdown commun interfac devic compet commun adapt strategi anticip displai devic order spoken utter point ey gaze import regul aid mode preclud mode commun aid mode depend common set commun articul aid mode speech replac exist addit individu repertoir current aac devic partial mediat commun disord increment improv precursor multimod improv aac design requir understand interrelationship aid mode goal research formal interrelationship model accur commun mediat exist devic subsequ model effect prototyp aac provid develop test environ design aac system simul involv commun agent model human agent differ work agent baldi instruct tool deaf children learn speech sound articul absenc auditori feedback perform face simul tool joint product facial express speech investig articul afford commun embodi paramet process paramet determin type surfac realiz modul produc vari paramet simul wide varieti commun physic disabl constrain scope focu multimod referenti commun refer express specif domain commun action felt start refer express fundament everydai aid highli multimod evalu methodolog motiv evalu import agent poorli defin modul select surfac realiz illocutionari act perform agent deriv prior invoc act surfac realiz modul scope influenc modul effect local select surfac realiz specif agent behaviour affect commun strategi determin account varieti global principl visibl modul effect global qualiti modul agent architectur consequ compon multimod utter perform agent primari sourc inform human user base subject judgment assess agent abil primari mean human user reli order perform requir task surfac realiz produc modul nlg system evalu respect standard written languag lexic analog standard exist surfac realiz produc modul agent architectur qualiti standard surfac realiz requir agent serv collabor task real estat agent work buyer differ requir pedagog agent agent serv instructor agent act research model posit priori make dimens determin evalu criteria abil handl varieti plan modul handl commun plan input scope domain depend applic modul architectur gener eca deriv surfac realiz wide varieti illocutionari model modul special deriv surfac realiz type commun function resembl human behaviour modul model human respect properti dimens relev commun context pedagog agent instanc human behaviour percept compet follow rule describ evalu criterion model adequaci model human express commun behaviour constru agent implement describ human process invok similar comput process behaviour investig adequaci model determin abil account rang behaviour scope evalu relat criterion model adequaci note model adequaci distinguish theoret adequaci model rang human commun behaviour account necessarili mechan human emploi model adequaci thought model theoret adequaci altern consist mode interact modul account interact avoid problem poor capit benefit subtl potenti interact depend embodi agent type commun action adapt modul adapt chang condit agent abil adapt global commun strategi factor agent adapt respect characterist surfac realiz agent modul deriv import surfac realiz benefici benefit express measur likelihood interpret posit impact commun percept agent adapt surfac realiz suit chang condit interact relat research applic import surfac realiz gener modul emul produc human commun analog circumst model adequaci serv basi evalu modul relev research conceptu framework agent modul defin function exist implicitli basic class evalu evalu assess manner interfac make embodi agent offer advantag type interfac evalu assess manner eca offer advantag eca evalu carri wizard oz simul actual implement system consid orthogon issu evalu interfac base eca differ type interfac respect manner qualiti surfac realiz level factor control fairli problemat attribut evalu outcom specif factor relat perform eca modul intuit correl exist determin subset agent express affect measur relat user subject experi type interfac prefer assess autonomi measur relat user behaviour perform interfac influenc eca modul rate error attent retent evalu comparison vari respect fewer factor manipul specif factor hold fix remaind comparison made version eca underli architectur ident respect modul effect modul demonstr subject behaviour measur effect user assess eca compet elicit manipul manner style multimod utter modul sole attribut differ modul uncontrol user elicit eca behaviour result variat global commun strategi undertaken agent multimod referenti commun task face set object posit tabl item commun ident select item subject desir mode entiti chose avoid confound effect anticip cs reaction step determin task perform successfulli tabl overview multimod referenti commun task type commun plan gener input modul control condit control reactiv layer contribut agent behaviour sourc potenti user sensit consist utter gener modul behaviour gener agent reactiv layer order avoid potenti confound type commun plan gener input modul control background exploratori studi previou work isol modul commun agent construct task agent specif type referenti commun shown tabl focu situat intend refer visibl task design perform human subject commun comput agent simul commun utter convei definit refer elicit human subject similar task pioneer work referenti commun task subject arrang ten figur order subsequ work similar type collabor task figur task explor role accumul common ground product utter convei definit requir subject visibl mode speech studi referenti commun task modifi elicit multimod utter commun agent simul behaviour human subject agent architectur design agent role select randomli intend refer perform utter convei semant inform requir identifi individu express commun disord simul agent valu repres properti agent embodi simul varieti mode commun conflict partial order semant intend maxim quantiti violat task modul select valid utter condit plan provid agent modul fix implement comput simul order record multimod utter gener modul agent agent repeatedli perform multimod referenti commun task paramet modul consid independ variabl output modul consid depend variabl condit manipul valu independ variabl interest type analysi base data deriv condit valu depend variabl compar reveal surfac realiz produc modul resembl utter produc human subject agent behaviour larg sampl utter agent emploi aid mode condit correspond condit human commun agent exhibit multimod human commun analog condit base data deriv condit longitudin data compar baselin surfac realiz produc modul demonstr type adapt human commun aid commun switch mode depend type commun exhibit vari empir baselin preliminari evalu deriv empir studi aac research literatur specif subsequ current research deriv baselin exploratori studi conduct exploratori studi order investig issu modul implement format output multimod utter gener adher action perform respect mode commun tempor interrelationship formal serv code scheme empir percept interpret multimod utter subject subject effect detail utter surfac realiz distinguish utter interpret materi set videotap dyad data code dyad involv subject job interview scenario interview question dyad particip role applic perform interview condit commun board serv aac commun aid serv aac devic code scheme base output specif modul focu code action code variabl defin subject mode commun shift ey gestur vocal code spoken utter code exploratori sequenti data analysi softwar packag analyz code video provid facil digit analog video code basi code variabl appropri custom fl knowledg afford packag observ fl inform order prepar videotap digit experi video compress algorithm found balanc compet requir low disk space adequ frame resolut rate data condit digit judg judg author paper research assist judg code half materi met discuss problem issu appli code scheme data code scheme data multipl iter code data refin remain data code discuss code initi approxim hour dyad rang requir approxim half time experi turn judg respect number type multimod respect start finish action summari disagr tabl onset offset valu action millisecond calcul averag absolut differ timestamp assign judg disagr effect muscl subject difficult determin exact start prepar phase finish retract phase deictic gestur code onset problemat subject retract subject code shift ey vari subject vari averag disagr onset onset offset ey gaze gestur speech tabl averag differ code event preliminari subject ey gaze period obstruct frame brow avoid futur improv camera angl level detail requir code ey track devic subject mode speech accept agreement code durat speech turn onset studi task wasnt control data provid answer question subject agreement respect code multimod utter made aid commun modif code scheme made basi coder discuss found order surfac realiz multimod import avoid descript appeal interpret commun intent lead slope coder permit intent difficult exclud behaviour code code effect remain factor subject percept interpret multimod impact factor correl commun behaviour ambigu process design subsequ studi baselin relev product multimod refer express commun behaviour produc particip includ refer situat applic domain simul commun physic disabl discuss import process call surfac realiz approach evalu advoc control confound factor specif elicit task commun action iter evalu model hope achiev commun agent coordin mode commun environ statu commun articul afford embodi acknowledg work support natur scienc engin research council canada care work research discuss influenc grate hirst fraser macmillan centr grate joe faloutso assist prepar digit video digit graphic project laboratori equip empir data kindli loan professor bernard okeef depart patholog toronto refer austin thing word harvard object refer augment assist commun submiss special issu talk mediat object multimod speech manuscript prepar comput simul commun constrain physic disabl workshop integr inform channel page august european associ inform incorpor multimod design commun disord fourth swedish symposium multimod page stockholm octob adapt multimod commun action north american chapter associ comput linguist workshop adapt dialogu system june lloyd multimod augment altern case studi augment altern march yan human system design embodi agent embodi page mit cassel thorisson power nod envelop emot feedback anim agent journal appli artifici cassel fulli embodi make commun behaviour autonom autonom agent clark arena languag chicago press center studi languag clark languag cambridg clark marshal definit refer mutual knowledg linguist structur page cambridg refer phrase function frequenc usag social preliminari studi concurr encod refer verbal commun journal person social effect refer similar commun mode verbal encod journal verbal learn verbal deictic emot commun anim pedagog agent embodi page mit commun interact young physic disabl children primari part iii mode commun augment altern cole develop evalu agent embodi page mit lee truth research embodi agent embodi page mit horvitz action uncertainti confer uncertainti artifici intellig page june poggi pelachaud perform face speech octob sander measur evalu embodi agent embodi page mit jame exploratori sequenti data analysi intern journal approach climb futur interfac technolog vision augment altern commun thorisson commun comput model dialogu skill phd massachusett institut
ML/1275 6 improv lazi oper theori andrew moran oregon graduat institut david sand chalmer technolog standard implement techniqu lazi function languag ensur argument function call evalu signi problem dicult compil writer predict ect program transform tradit theori lazi function languag base er determin transform optim program present oper theori base improv order improv termin termin cheapli show improv relat sati es support rich inequ subsum lambda calculi al al calculi inadequ theori transform permit transform speed program constant factor claim calculi provid power proof rule includ syntact continu basi style improv suitabl argu correct safeti program transform introduct ensur evalu function argument evalu compil lazi function languag implement evalu lazi function languag believ program compil advantag appli myriad transform compil jone santo notori extrem solid intuit andrew moran depart comput scienc oregon graduat institut scienc technolog david sand depart comput chalmer technolog moran sand predict ect program transform run time tradit theori lazi languag base give assur transform doesnt lead asymptot calculi lambda calculi al al er solut problem permit fewer equat calculi enabl reason ignor kei implement issu underpin limit equat calculi de symmetr mean local transform present calculi limit transform chang section independ context program con ne transform signi calculi proof rule interest program fusion function justi ed calculi approach aim limit ning notion observ approxim establish algebra law law calculi principl approxim relat kei result al standard observ approxim observ distinguish evalu obtain oper theori retain comput distinct observ cost term model comput step observ approxim de ned respect xed oper semant improv termin termin fast summari result develop oper theori lambda calculu case express theori base abstract machin semant ect comput distinct show improv relat rich inequ valid reduct rule calculi support power induct principl program speci origin result context lemma mean establish improv comput restrict class evalu rich inequ tick subsum syntact continu properti improv function term nite form basi oper theori induct style power proof improv theorem improv infer correct safeti program transform proce local improv gener method establish proof rule context open uniform comput overview paper split separ part rst half present oper theori major state proof half present technic machineri prove begin rst half paper discuss relat work section section present oper semant abstract machin discuss complex comput section show number heap access comput reason measur cost basi contextu de nition improv cost context lemma state inequ tick present section rel power algebra calculi discuss section syntact continu present section show unwind combin improv constant combin present syntact variant fusion establish syntact continu improv theorem introduc section improv induct exampl substanti present section half paper section notion program context con extend reduct open con gurat context establish open uniform gener techniqu prove context dicult algebra induct rule section discuss futur avenu research relat work improv theori improv theorem origin develop set sand varieti languag programm carri set long open question inspir gave con denc possibl tractabl improv theori lambda calculu present wadler al al signi canc calculi base reduct term sourc languag gure con term explicit substitut reduct rule con enjoi determinist notion standard reduct relat concept studi optim reduct moran sand yoshida limit origin work al treatment cycl extens calculi deal lead loss con uenc rei origin calculu consid brie recov con simpli disallow reduct al give full studi cyclic show approxim con uenc obtain equat term nite share calculu natur successor calculi reduct calculi good vehicl explor languag design space regard featur rose work al exempli es approach eleg combin explicit substitut combinatori reduct system view complementari rewrit oper semant con ne calculi develop oper theori attempt give semant je rei iyer natur abstract adopt number research formal de nition al hugh moran peyton jone adopt machin essenti updat heap oper model underpin theori observ work abstract machin induct semant bene ts proof comput found section techniqu open uniform comput proven robust appli successfulli languag al develop algebra show transform presenc share sand oper semant languag untyp lambda calculu structur case express work restrict syntax argument oper theori function var con mg case fc syntact restrict core languag glasgow haskel jone al peyton jone santo constructor xed assum satur xn valu lambda express constructor rang constructor valu write mg shorthand fx xn order bind syntact signi consid bound similarli write case fc case fc jc vector distinct distinct constructor write alt abbrevi case altern fc work restrict syntax lift restrict fx ng fresh variabl similarli constructor express kind substitut variabl rang substitut simultan substitut vector variabl written assum distinct abstract machin semant present section essenti abstract machin lazi prove abstract machin moran sand fx fx case alt alt fc mg fig abstract machin semant semant sound complet respect natur repeat proof transit con gurat consist express stack heap partial function variabl denot ident manner collect stack variabl argument case updat marker denot variabl updat marker ensur bind recreat heap result current share maintain semant write abstract machin con gurat heap express stack denot empti heap addit group bind heap mg stack written denot stack push top empti stack denot concaten stack st top refer set variabl bound set variabl mark updat stack dom updat marker thought bind occurr variabl con gurat dom dom disjoint write union con gurat free variabl set variabl write free variabl term denot fv vector term write fv abstract machin semant present gure implicitli restrict de nition con gurat group rule concern evalu variabl begin evalu remov bind heap start evalu mark push stack rule appli evalu updat heap bind rule concern function rule push argument stack function lambda express rule retriev argument stack substitut bodi lambda express oper theori rule govern evalu case express rule initi evalu case case altern push stack rule result evalu branch perform substitut constructor argument branch pattern variabl rule add set bind heap side condit ensur inadvert captur sati ed local relat term con gurat translat con gurat term induct mg fx alt case alt oper semant translat term con gurat program context hole denot insert yield term introduc detail section lemma exist proof simpl induct size converg oper theori reli notion properti close observ simplest observ converg definit close con gurat def def def close con gurat converg reduc ind stuck type stuck express con gurat semant identi ed write identifi close initi con gurat moran sand complex comput cost comput distinguish strategi build oper theori respect distinct observ cost compar term develop question remain measur cost attempt predict actual run assign implement speci constant abstract machin step compil perform myriad lead theori work abstract measur aim theori earlier version work sand moran sand simplic chose simpli count number abstract machin step measur unrealist assum abstract machin step reveal inform actual run work highlevel machin cost measur bottom line sucient describ complex comput measur constant factor reason question step abstract machin consid implement constant defer discuss point appendix move notion cost abstract machin step aim make notion cost simpl sacri bottom line measur cost depend constant factor sucient measur cost term number time lookup rule appli claim proven appendix de ne cost comput definit close con gurat def occurr def identifi close initi con gurat write demonstr sound cost argu number step depend constant factor actual run time implement base abstract number lookup step constant factor number abstract machin step discuss appendix proof found appendix theorem exist linear function close term size oper theori justi es number lookup measur cost de ne base measur improv start point oper theori approxim de ned term program context program context gener introduc intent express hole context central idea compar behaviour term compar behaviour program context context cx dg case fc context occurr usual oper lling hole term variabl term captur de ne observ approxim context standard ong definit approxim written written coincid incorpor inform build oper theori retain distinct thought natur properti compar reduct step requir termin theorem count lookup fact sucient recal write converg cost number lookup occur evalu definit improv written moran sand cost written cb de nition su er problem contextu de prove term relat requir examin behaviour context common seek prove context lemma oper show prove approxim compar behaviour respect tractabl set context establish context lemma lemma term con gurat context form hole correspond subset term context call evalu hole subject evalu make correspond section note context lemma appli open term common restrict attent close show preorder question close substitut strong improv improv notion oper approxim termin termin context compil natur stronger notion improv permit chang termin behaviour definit strongli improv written strongli improv improv ident termin behaviour de nition simplic present improv strong improv law proof rule present subsequ section hold strong notabl except diverg term syntact continu proof principl sound strong trivial rule illustr relationship approxim introduc oper theori cb diagram relat term greatest lower bound relat diagram equal tick algebra fx fx fx fx fx fx fx context lemma fx step converg fx step incur cost syntact introduc cost written cost inform statement motiv introduct written add unit cost comput write fx cb fx introduc tick syntact construct transit earlier tick de ned languag introduc spuriou de ned fx mg needlessli complic heap moran sand stipul count occurr transit calcul cost de add unit cost evalu chang behaviour note write kx slow tick infer rule collect crucial establish improv cost valid de nition easili prove number improv cost modulo present select section follow standard convent bound variabl statement law disjoint free variabl law present gure gure collect tick algebra beta law rst set present gure import mimic evalu algebra familiar law beta analog law case express valid note reduc cost irrespect context lemma cost law section easili establish replac occurr bound tick ect fact replac lookup step version bound variabl improv speedup achiev vari slight variat replac argument posit due proof valid reli gener techniqu outlin section deriv beta unrestrict version deriv cost cb fx ng oper theori law tick algebra follow standard convent bound variabl statement law disjoint free variabl cb case fc cb fx cb fx fx fx fx fx fx fx fx fx fig beta law cb cb case mg cb mg fx mg cb fv fig law evalu context mg cb fv lg mg cb mg fx mg ng cb fx mg lg cb mg cb fig law deal fx cb fx fy cb fy oat strict fig law strict fx fx fig beta conjectur moran sand variabl similar deriv law gener case express law evalu context evalu context context hole target evalu proce hole lled evalu context mg xn ang ax case fc rang evalu call applic context evalu context strictli mention extens de nition correspond con gurat context singl form made set evalu context lemma sg law gure move case evalu context common motif proof tick algebra interest valid easili simpl lemma section move tick evalu context simpl context lemma properti transit law inlin evalu context similar reason law manipul present gure law correspond garbag add remov super bind law bind move law concern movement bind gener context includ form essenc note jone al copi compon heap sole remov provid perform renam oper theori note variabl convent ensur occur free convent free law follow similar argument requir gener techniqu justifi complex law section diverg strict denot close term converg suce de nition rst law gure concern relationship oat similar place law follow straightforward manner context lemma fact termin behaviour preserv theori context strict de oat tick strict state proof techniqu prove turn tick oat properti strict cb beta conjectur analog valu replac gener fx fx intuit rule undo comput step improv provid pai potenti gain comput step made tick occurr variabl unfold lack satisfactori proof context lemma inadequ establish properti link fact axiom embodi essenti di erenc adapt techniqu base al conjectur improv lead asymptot worsen space behaviour sand conjectur deriv cyclic program occur free step proof proposit context moran sand fig axiom calculu al establish mg lg mg concern move bind variabl convent ensur occur free note essenti part transform consequ conjectur standard common fx mg convent ensur free variabl captur context relat tick algebra calculi reproduc axiom calculu al gure law collect gure subsum lambda calculi case minu symmetri calculu rewrit rule form turn except cost improv improv modulo tick exist obtain insert fact enabl prove term relat calculi comput constant factor program context speedup program obtain calculi linear natur idea improv modulo tick definit constant improv constant written exist mean constant factor slower faster note constant factor independ context relat show transit requir small improv relat origin paper rang variabl valu restrict evalu context oper theori special case program di er tick obtain remov tick exist congruenc lemma proof suce show show nest tick con gurat comput proce rule substitut term maximum nest tick show induct length comput impli statement con lemma establish theorem term restrict proof induct proof base case requir show equat easili improv improv modulo tick induct congruenc transit rule follow induct hypothesi dicult case symmetri sucient prove equat equat law tick algebra case lemma fact transit corollari calculu al improv program constant factor con dent result extend share calculu share rule repres directli collect improv law interest note assembl collect law requir tackl number encourag cover rule stand cost express rule rule cost formul rule obviou prove syntact continu function natur start point attempt mimic induct denot semant exampl kind oper analogu stefan provid point error earlier formul rule moran sand scott induct languag found smith mason al sand present rst result semant mechan describ syntact unwind function de variabl definit def def de ned ff de ne unwind ff fn expand de nition ff fn fn fn note restrict attent de ning bodi unwind trick work gener cycl loss share render extend method cycl requir extens lead problem show extens conserv respect improv relat point function ff fn complet behaviour ff essenc scott induct main properti justi es syntact notion ff upper bound chain ff fn preserv properti rst show ff form chain respect ff upper bound chain lemma ff fn ff ff proof prove ff fn ff rst similar argument proce induct base case easili induct case oper theori ff cb ff ff fg ff fg cb ff cb ff establish syntact lemma section ff converg exist unwind cost lemma ff ff theorem sound proof ff fn ff proof assum ff unwind exist ff result context lemma syntact continu valid mutual function proof rule sound strong note base case requir contextu limit applic strong improv version syntact continu syntact show unwind combin improv constant factor combin proposit rec rec rec proof rec abbrevi rec rec vn show rec rec result follow syntact cb cb moran sand rec rec vn rec cb rec rec vn vn cb rec rec vn cb rec rec cb rec rec cb cb cb fig induct case proposit proce induct base case trivial rec rec induct case deriv gure slightli slower version rec proposit combin give asymptot program syntact continu establish proof version call fusion al rang context theorem fv fv fx fx proof assum syntact suce fv fx fx base case fx cb fx cb fx cb cb fx fx oper theori induct case fx cb fx cb fx fx fx cb fx fusion establish number gener fusion law central approach program transform haskel improv theorem section introduc kei techniqu reason improv theorem improv theorem introduc mean prove correct program transform section show result carri set problem transform motiv improv correct problem program transform correct transform follow simpl fact basic transform step simpl illustr start function repeat produc list repeat properti easili repeat transform bodi function obtain version repeat de nition produc rst element list local step produc transform carefulli true fx mg fx ng longer case transform depend de nition fx mg fx mg fx mg fx ng moran sand order reason program transform partial evalu infer simpli sucient improv theorem fx mg fx mg fx mg fx ng sucient establish correct transform requir natur local transform step improv prove improv theori base fact theorem program correct consid signi question left open improv theorem hold improv theori suppli theorem proof rule ff ff ff ff wg infer sound replac cb cost improv theorem cost theorem state set mutual de nition proof theorem section notat establish improv context declar deriv form written abbrevi declar clear context limit congruenc context improv proven context de nition lift context illustr proof show standard combin convert restrict cost version rec proposit oper theori proposit cb rec rec rec proof cost requir show cb rec renam loss entail cb cb cb cb cb result cost theorem improv theorem syntact continu establish improv form ff ff wg moran sand side syntact continu unwind side side improv theorem immedi prove amount directli prove rule exampl prove method case improv theorem prefer calcul style improv induct mention proof rule close alli improv theorem rule deriv improv correspond call improv induct establish languag rule tting syntact theorem substitut proof rule cb proof section proof techniqu provid section program transform section larger program transform automat method elimin call append function view instanc scheme base illustr improv theorem evalu show correct argument strengthen encompass improv concaten vanish basic idea elimin occurr xs nil ys occur function yn achiev de ning function sati es yn yn present transform introduc initi de nition appli set rewrit term scope de nition assum de nition append function scope make oper theori syntact ident gener applic section form append initi target transform function de nition occurr term yn program initi step replac de nition xn nil transform appli rewrit express scope de nil nil case zg applic classic transform quadrat time list function linear time version de nition xs nil nil express candid xs nil case xs nil nil appli transform rule program garbag collect remov redund bind import part applic case express hand side de nition transform present gure correct standard transform achiev asymptot program speedup remaind section improv theori prove method slow program constant factor correct argument make simpli cation modifi de nition origin function ect moran sand case xs nil nil case xs nil nil case xs nil case xs nil case xs nil case xs nil fig transform sequenc simpli cation duplic transform work duplic exampl signi reason simpli cation replac bodi xn nil sound untyp languag reli equal nil type theori straightforward establish weak cost type theori scope present articl architectur proof introduct function patent sound remain step illustr law establish remain law establish associ properti properti improv theorem establish properti transform properti append proposit nil cb nil cb cb case zg cb proof proof routin calcul present proof case oper theori case cb case case nil cb case case nil cb case zg append sati es associ establish proposit cb xs nil ys proof calcul left side context cb cb moran sand result improv induct cb case nil cb case nil prop cb case nil cb case nil prop case nil found context cb remain show cb oper theori cb case nil cb case nil cb case nil cb case nil case nil work basic properti append proposit corollari obviou improv relat show associ properti append chang asymptot time complex program transform law proposit rewrit law transform improv proof rule follow proposit rule corollari cb cb moran sand lastli cb cb cor cb main correct argument improv properti individu step de nition transform proposit transform yield program improv origin proof assum transform form loss gener oat de nition appli transform rule transform rule oper theori improv theorem conclud transit proof main theorem section outlin technic develop proof main result proof follow direct style reason reminisc proof function languag ect mason al agha al order make style proof abstract machin semant work con gurat context con gurat hole ensur transit con gurat context consist hole lling work gener context approach altern approach context due pitt substitut context pitt syntax repres tradit de nition context section give fuller descript exampl found moran idea hole rang appli vector variabl syntax context cx dg case fc rang heap stack context xed rang form length ariti variabl bound lling gener ect substitut expect consid bound coupl written restrict applic variabl lling violat restrict syntax de nition substitut make identi moran sand de nition context usual de nition repres tradit context vector lling term repres tradit context repres fill hole term repres obtain usual lling captur note permit context identi ed henceforth work context write singl hole variabl assum ariti hole variabl respect implicitli de nition improv work context ident earlier de nition place term hole obtain substitut instanc term mean improv close substitut de nition properti di erenc minor technic gloss section open uniform comput basi proof comput con gurat hole free variabl mean normal reduct extend context treatment context support induct de nition term order ll hole con gurat identifi con gurat renam heap variabl stack bind occurr heap extend oper semant open con gurat hole note hole occur stack branch case altern rang substitut variabl variabl substitut substitut form rang con gurat context kei properti lemma ss ss ts oper theori proof inspect open reduct con gurat context amount standard substitut gener argument open uniform comput properti central evalu open con gurat context comput case lemma uniform con gurat context hole fv proof assum reduct proce induct case structur show illustr case similar type bound free fv bound dg reduc induct reduc con gurat context type requir type depend structur case reduc induct hypothesi result uniform reduct uniform translat extend de nition tran cover open con gurat con gurat extend translat lemma exist proof simpl induct context lemma proof context lemma reli complex lemma moran sand proof simpl lexicograph induct length transit translat lemma fv proof assum comput step proce lexicograph induct open uniform reduc step cost possibl case case open uniform reduc step cost possibl case reduc step cost requir case oper theori requir statement context lemma term lemma fact valid tick algebra present proof valid sketch proof correspond evalu context con gurat context form proof complex law similar structur requir open uniform comput recal fx cb fx suce show hole hole prove forward direct direct similar comput step proce lexicograph induct open uniform reduc step cost case case extens de nition induct hypothesi result case induct result moran sand recal mg cb suce show show forward direct show establish fact termin comput step proce lexicograph induct open con gurat context free open uniform reduc step cost case case elementari properti induct hypothesi appli yield desir result case induct hypothesi appli yield desir result oper theori lemma recal statement lemma show note set applic correspond free isomorph singleton alt set free stack denot sati es alt easili shown ident induct structur show statement show fx xn evalu context proce easi induct number updat marker show proce case analysi produc case dicult case xn ang mg case similar lemma valid similar reason cv denot captur variabl lemma exist cv ts moran sand proof lemma exist translat provid cv ts recal statement cb case standard bound variabl cv cv fv bv bv denot variabl assum bind introduc evalu valid hold side empti stack sucient case ts lem ts ts ts case cv ts lem fv bv evalu ect bind introduc evalu result context lemma congruenc entail perform calcul context declar notat introduc section deriv form oper theori declar clear context prove extens gener context context cv fv prove valid requir lemmata lemma prove lemma lemma proof simpl induct case structur sucient show termin impli true prove improv lemma lemma proof context lemma impli fv fv lemma fv fv fv step renam moran sand fresh fz fz fz fz fig calcul portion proof lemma lemma proof lemma provid proof sucient show singl renam case fact close variabl variabl substitut loss reason gure desir result move gener show sucient assumpt singl hole variabl ariti de nition suce show comput step proce lexicograph induct open uniform case case oper theori induct impli desir result open uniform comput case lemma assumpt impli lemma impli requir show reduc step cost open uniform case case appeal case case induct hypothesi desir result open uniform comput unwind lemma prove unwind lemma state proof lemma fx fx fx fv recal statement unwind ff ff suce prove fx fx moran sand fx comput step proce lexicograph induct open uniform reduc step cost hole result hold xn free case reduc step cost case xn fx reduc step cost induct fx xn repeat applic lemma requir improv theorem prove improv theorem de proof rule ff ff ff ff context lemma suce show assum comput step proce lexicograph induct open uniform reduc cost case extens reduc step case oper theori lem improv induct prove gener involv set declar term substitut proof rule cb lemma impli gener statement rst impli refer show gener comput step proce lexicograph induct open uniform reduc case case rst note fv similarli moran sand futur work present rich oper theori base improv order program theori subsum lambda calculi al al import extens proof techniqu reason syntact continu prove properti program kind sacri inform share improv theorem improv induct rule support calcul proof prove safeti program transform obviou applic theori argument run time sand cost sand direct futur work program transform inevit condit unfold function call straightforward de ne simpl syntact condit context mg mg case hole occur global form inform lambda express question appli type system al global interest prove system full satisfi desir improv properti section strict properti context fresh case properti semant acknowledg bene ted numer discuss aspect suggest led simpli cation proof context lemma keith comment refer full abstract lazi lambda calculu inform comput foundat actor comput journal function program lambda calculu proc acm symposium principl program languag pp acm press cyclic lambda calculi proc volum pp oper theori lambda calculi technic dept comput oregon extend version submit public lambda calculu journal function program lambda calculu explicit inform comput model share weak reduct strategi explicit substitut proc intern symposium program volum pp transform system develop program journal acm abstract framework environ machin theoret comput scienc lazi optim lambda tool speci cation analysi proc acm symposium principl program languag pp acm press ed higher order oper techniqu semant public newton institut cambridg press type base share analysi updat avoid proc acm sigplan intern confer function program pp foundat transform program gordon pitt proc workshop higher order oper techniqu volum electron note theoret comput scienc elsevi scienc publish bv make choic lazili proc acm confer function program languag comput architectur pp acm press fulli abstract semant concurr graph reduct technic report school cognit comput sussex fulli abstract semant concurr graph reduct proc ieee symposium logic comput scienc pp ieee comput societi press semant lazi function languag theoret comput scienc relat reason function nondetermin ph depart comput aarhu natur semant lazi evalu proc acm symposium principl program languag pp acm press call lambda calculu journal function program optim deriv weak orthogon term rewrit system proc acm symposium principl program languag pp acm press function languag ect journal function program oper semant domain theori inform comput function program envelop wire hugh proc acm confer function program languag comput volum moran sand lnc pp fulli abstract model type theoret comput scienc mccarthi ph depart comput chalmer sweden improv lazi oper theori extend version sand improv lazi oper theori proc acm symposium principl program languag acm press errat semant theori coordin languag coordin volum lnc function comput concurr comput proc acm symposium principl program languag pp acm press peyton move bind give faster program proc st acm sigplan intern confer function program pp acm press peyton haskel scienc comput program note induct techniqu semant function program note seri depart comput aarhu oper semant program invit talk confer mathemat foundat program slide theori program pitt semant logic public newton pp cambridg press oper reduct model function program languag ph denmark report oper theori improv function languag proc glasgow function program workshop comput seri pp time analysi theori cost journal logic comput total correct local improv transform function program acm transact program languag system rule proof oper function languag proc acm symposium principl program languag acm press comput simpl approach proc workshop higher order oper techniqu volum electron note theoret comput scienc elsevi scienc publish bv improv theori applic public newton pp cambridg press peyton pro ling higherord function languag acm transact program languag system oper theori oper semant share lazi evalu scienc comput program deriv lazi abstract machin journal function program oper denot semant schmidt proc confer mathemat foundat program volum lnc pp reason function ect public newton pp cambridg press intermedi program transform yale type proc acm confer function program languag comput architectur pp acm press concaten vanish technic glasgow note fp electron mail decemb transform program elimin tree theoret comput scienc optim reduct share environ proc acm confer function program languag comput architectur pp acm press appendix lookup appendix justifi count lookup cost prove theorem natur abstract argu abstract machin step implement constant depend size program execut observ crucial proposit execut term abstract machin con gurat substitut instanc subterm origin program proof inspect rule assum variabl lookup oper implement constant argu transit implement constant time oper straightforward argu rule requir amount variabl renam slightli lower level variant renam complet avoid environ correct modi cation clear clear rule implement constant time actual implement give ned bound simpli program size maximum number free variabl subexpress moran sand work im complet argu environ size bound program size im dont order prove theorem count lookup step sucient captur comput rst introduc size metric stack definit jxj jc jm jm xj jm fc gj jm jn mg jn jm jx sj jsj sj jsj sj jsj jn sj jm jsj except rule combin term stack size strictli abstract machin sj add group bind metric amount depend size bind made metric amount equal size term evalu recal statement theorem exist linear function close term size proof size converg step nal state oper theori partit transit sequenc km nm tm mm sm km nm tm total number instanc rule fact jm jn jm jm jm jn jm jm transit move transit metric fact term evalu substitut instanc smaller di erenc size jm yield argu lookup size bound jm conclud jm larger work moran sand jm jn jm jn jm jn sm tm jm jm jn jm jn sm tm tm jm jm jn tm jm jm jm jm linear argu number step depend constant factor actual run time implement base abstract number lookup step depend constant factor number abstract machin step demonstr sound number lookup measur cost
Agents/1276 1 workshop design person synthet actor june ed robert trappl sort control system aaron sloman school comput scienc birmingham england abstract paper outlin methodolog studi mind part broad disciplin artifici intellig framework architectur requir mind preliminari suggest made mechan underli person descript scenario birmingham framework research problem combin idea work synthet agent inhabit virtual realiti environ person belong agent work ai address cognit aspect design intellig vision form problem learn concept natur languag motor control tini subset ai research concern motiv thing regard relev person partli inspir simon semin late collabor colleagu address issu intim bound deep difficult problem human mind dont expect answer found reason make begin requir design agent specif cognit mechan difficult compon underli implement mechan combin design temporarili architectur kind research detail mechan hope gradual make progress complet realist design theori order make clear framework ill start make gener comment scope methodolog ai ill describ scenario explor architectur account aspect emot person ill sketch preliminari idea explanatori offer complet high level overview famili architectur end includ edit transcript tape record discuss present workshop vienna june remov common misunderstand includ section goal part reason peopl ai term narrow offer altern vision ai broad studi person accommod identifi unsolv problem weak current research identifi aim approach defin aim includ articul larger set goal fit ai unawar lot repeat definit ai origin produc ai recent recent ai ai book claim ai research superset scienc ai peopl tend specialist confer read specialist lose gener vision extern comment ai simpli find underli theme collect idea gener superset aim ai claim previou gener studi modifi control ffl natur ffl actual evolv includ studi individu societi social system add constraint design relat cooper conflict creation understand option differ includ cognit scienc subset ai studi human anim system ai defin number thought ill ai gener studi behav system search algorithm design ai system equal surpass human wed understand aspect design good altern good understand involv design relat design involv aspect implement essenti short understand space region design space properti class design mechan understand good good collect requir design fit question design level issu gener context understand complex cohen stewart terminolog slightli gener word refer collect requir work engin requir specif design fit nich nich physic thing geograph region branch tree nich perceiv thing perceiv thing inform softwar internet occupi comput nich portion world physic locat instanti nich time bee flower locat nich meet function requir defin part nich specif nich type agent ontolog act dynam ontolog event process mean environ type action requir collect task set actual task dynam chang includ depend nich task includ find consum food find learn social fit social constraint law physic legal system rule mean achiev set convent commun nich made constrain ad addit sort food sort agent aid portion world instanti set descript instanti nich simultan nich determin explicitli advanc human engin guid design work nich implicit collect evolutionari pressur oper class organ human design thing complementari role plug compil natur occur implicit nich complement ecolog collect interact chang dynam aspect chang chang climat alter requir discoveri creation suitabl nest chang chang amount kind knowledg alter requir individu collabor competit societi complex societi systemat social role requir individu type person requir extrem differ reproduct role concret physic instanc design abstract determin class design capabl instanti specif design narrow instanc talk impli process discoveri creation design noun design product argu approach defend genet algorithm neural net approach lost search design space true road follow parallel share learn approach empir theoret theoret intuit vagu formal make logic mathemat includ creation studi instanc design instanc creat design implement work part process understand top level goal investig implement common partli analog role thought experi physic design includ specif virtual machin design specifi complex structur interact includ structur featur behaviour capabl compon form causal power function role system differ design includ wai refin common gener start gener mechan appli specif produc parser differ due implement lower level program compil compil machin implement machin architectur physic technolog case design implement lower level mechan case design virtual instanc virtual machin occur physic instanc physic technolog implement comput sparc architectur process biolog evolut mechan explor design space make level result previou reproduct chemic structur neural mechan structur imposs difficult creat instanc design part design includ product process point stress cohen stewart notion dna fulli determin develop ignor role plai mechan dna human design capabl enhanc develop design manufactur tool close design set gener design product mechan nich determin kind design requir enabl facilit specif design scope vari implement detail thing dont understand class design neutral kind high level design intellig agent neutral compon implement collect neural network chemic collect symbol manipul mixtur mechan dont high level aspect design human mind neutral implement human brain abound answer question long term object ai defin relat question extent complex behaviour capabl explicitli built mechan capabl implement capabl directli process learn adapt physic kind directli assembl fulli form adult human brain inform normal adult function case system brain learnt great deal part requir earli person set motiv capabl capabl drive learn process understand give synthet agent person understand sort nich make person relev requir agent fit sort design capabl meet requir iv show complex question studi gener claim constitut scope ai involv found ai work studi studi collect requir constraint agent collect nich understand dimens nich dynam interact nich system made exampl ai includ studi requir nich space design space map design space nich space figur map design space nich space nich set requir map vari kind good kind trajectori design space nich space learn analysi sort perceptu task marr sloman marr comput level analysi paper colleagu concern requir motiv mechan human system sloman sloman sloman beaudoin studi includ analysi comparison design possibl level includ high level low level form type long term short term type perceptu type learn found discuss research paper compar work author rare find discuss design requir complet agent studi map map correspond design class set requir region altern fit nich perfectli style width arrow figur meant kind match map uniqu criterion optim satisfi nich simpl numer measur good fit design nich design nich design catch wider rang prei run good distinguish perceptu limit full analysi varieti map requir analysi logic complex concept peopl understand handl multipl partial order concern type comparison analysi dimens level abstract involv nich design standpoint disciplin studi trajectori concern process extend time complex system interact environ extern behaviour case involv intern behaviour compress chang stress bounc intern behaviour inform includ process develop develop normal infant birth produc capabl system extern agent redesign trajectori design space meet set requir satisfi constraint result trajectori nich space rememb talk movement point movement sort fuzzi explor learn system concern studi mechan move design space nich partli result interact environ trajectori depend environ point view nich part larger system interest question investig sort trajectori design featur make direct implement learn develop turn trajectori design space simpli imposs achiev evolutionari process oper gene pool distribut collect individu physic chemistri imposs individu transform eleph human transform logic organ includ potenti drastic produc gene pool type transform inform process capabl individu imposs born learn understand human born human human share enorm biolog heritag trajectori design space nich space gene pool individu agent turn imposs form conceptu develop exhibit histori human scienc cultur occur matter long individu live mixtur interleav individu develop social learn requir produc transit lead ancient greek scienc quantum physic case process necessarili involv mistaken cognit state enter part environ gener learn avoid state turn true evolut aesthet art moral type person topic studi gener head explor analysi trajectori design space nich space figur rough indic sort thing surfac suggest uniqu level analysi design nich case discontinu design space nich space point import ai theori evolut space discontinu design includ continu variat discontinu region design space smoothli vari chang electr fuel size involv small larg chang wheel inform process lot discontinu design remov condit branch discontinu put back half arbitrari fraction discontinu space capabl continu integ real point feedforward neural net thought larg collect condit action activ condit share action share weight determin influenc rule case influenc vari continu variat condit branch ordinari softwar convent approxim continu variat ad gradual chang probabl condit trigger differ design condit plai design condit discontinu structur chang research topic structur design space find kind discontinu complex design smooth discontinu reason climb search good evolutionari iv learnt colleagu irreduc discontinu understand relat trajectori nich space evolutionari mechan capabl produc discontinu acknowledg evolut requir discontinu chang discontinu ai philosophi hope discuss design nich space trajectori make clear limit conceiv ai search class design meet set requir practic deep studi mind design architectur part broader find sort architectur meet set area design space correspond area nich space enabl philosoph question replac sort mind sort mechan evolutionari learn process bring older philosoph mind suggest answer form design thing kind design kind mind differ similar design relat nich suffici condit order pursu studi set techniqu conceptu tool ill describ requir studi design space nich space languag describ nich work engin develop formal express requir similarli work biologist compar nich relat organ suspect bare scratch surfac requir satisfactori languag account fact nich physic environ nich type agent part design correspond part nich light fuel deliveri system steer mechan car part total design meet decomposit light system includ control power share compon batteri part occupi nich simultan aspect defin featur agent agent agent individu quickli live environ thing chang rapidli abil solv problem rapidli deep standard answer pattern recognit languag nich evolv theori design evolv languag formul design import specif design behav system concern call level newel level dennett stanc level descript level concern design part dennett involv semant content inform level inform process ration newel level dennett stanc evolut design produc system work situat blindli follow rule agent part larger societi ration viewpoint larger system ration viewpoint agent import understand featur motiv person agent concern reproduct care offspr human person human point view individu cost reproduct care young high highli women languag describ map describ map region design space region nich space design evalu rel gener simpl numer evalu includ descript possibl multipl coexist partial order case relat evolutionari effect promot surviv reproduct collect kind fit relev gener determin uniqu design solut nich shown biolog includ potenti futur trajectori lead fit nich individu develop success evolutionari stage cry current content ai book journal expect increasingli import peopl understand issu grasp shallow narrow current ai swing fashion mechan architectur resourc method explor agent design commonplac peopl make unnecessarili limit assumpt mechan methodolog ai ai mechan connectionist neural chemic restrict ai class mechan restrict physic experi mathemat newton ai commit class commit languag part aim ai find formal suit fashion recent year critic problem simul work carefulli chosen toi problem part conquer research requir scienc control simplif hard scienc complic robot ey arm necessarili tackl deep frustrat student found import sort simplif studi bate al call shallow function distinct simplifi find thing high level featur design space nich space build system discov lack qualiti learn architectur dont studi dont work import contribut fuller appreci altern design broad shallow approach perman commit clarifi requir progress deepen design case incorpor learnt narrow deep approach case draw attent miss studi visual percept assum sole function vision produc inform structur motion object sloman expand object explor scientif concern practic engin applic scientif object understand human capabl understand anim understand space design relat nich understand sort trajectori design space nich space condit ai work produc analysi region nich space altern design suffic engin object engin object design machin subset human anim design machin human anim machin compon machin make machin suit interact human depend learn practic object develop educ strategi improv human learn work understand wai human mind brain wrong design therapi easili fix dont work design form toi depend scientif engin requir progress product constant featur ai research design tool includ program languag form process explor implement design cognit affect project cognit affect project birmingham concern issu sever limit resourc forc concentr main effort tini subset task project partial requir preliminari partial specif type architectur explain human preliminari attempt map architectur phenomenolog emot sloman work includ ffl collect abil handl multipl independ sourc physiolog individu tast abil cope concurr process plan abil cope limit capabl level process ffl explor varieti design design mechan manag process motiv gener reactiv mechan chang mechan mechan control manag process aspect control hierarchi accommod long term short term chang ffl produc idea influenc problem involv control attent ffl produc interact demonstr teach primit implement interest initi deepen process work implement reveal inadequaci long run program present import role implement inevit requir contribut inform ftp affect minder scenario order focu investig provid possibl implement restrict develop specif extend scenario studi process interest sloman beaudoin scenario involv simpl collect robot roam interconnect mobil camera mobil hand minder kind troubl rescu develop point leav type problem babi encount includ fall die batteri run recharg point charg die babi turn tendenc damag babi damag babi medic centr repair damag great babi die scenario modifi wai babi move random act goal sort intellig determin nich minder scenario fix set aliv till readi steadi stream incom minder task rate matur surviv babi discharg minder auditori sound troubl trigger visual investig predat make task initi minder movabl movabl camera restrict view limit room minder main task design big task camera room time move cycl control attent process driven current goal altern complex scenario investig simpler agent context evolutionari led poli chose simpl complic motor interest interest control environ design give mind hard control problem work add complex bodi auditori complex previou refer minder part manipul richer visual similarli domain expand enorm complic problem present main focu interest time expect collabor research group implement richer world develop introduc problem commun plan act babi intellig wider rang learn mind possibl investig colleagu call simpl mind task made difficult ffl chang number babi ffl alter rel speed babi move minder bodili part ffl alter rel speed process occur environ process kind occur perceptu gener evalu rel import urgenc import concern requir relat limit process speed high level process constrain design architectur cope asynchron intern extern event simon sloman sloman beaudoin wright al minder collect sort intern parallel specif partli overlap sort thing workshop david bryan loyal intern process includ thing ffl realiz goal ffl decid goal ffl evalu goal likelihood success ffl decid adopt reject goal ffl decid act ffl decid achiev select exist plan ffl detect resolv conflict goal plan ffl carri plan monitor progress task turn unexpect complex turn includ urgenc goal measur time left urgenc function length delai cost benefit urgenc benefit time season plant turn fix sequenc manag task simpl flow chart adequ goal evalu made adopt prior case partial plan requir evalu cost benefit potenti process unpredict amount time problem simplifi minder infinit speed assumpt agent reason process subset cognit amount parallel limit limit parallel observ empir inform found number design factor explain expect amount concurr manag process limit reason appendix sim agent toolkit poli design support explor interact agent rich intern architectur vari rel process speed object agent compon agent toolkit make easi chang speed insid mind simul environ conjectur high level process occur necessarili ant limit speed amount extra level requir call defin process goal involv manag task definit dont mechan process detect plan process long urgent goal decid switch manag process carri partial plan hope plan complet detect rate occurr problem high switch manag task prevent progress lead threshold goal inform dynam attent filter architectur sketch broad architectur agent ai research work work narrow deep concern languag understand main concern put mechan oz group carnegi mellon chosen concentr architectur initi shallow combin sort function research gradual simultan involv complex environ make ad depth ad compon architectur older part human brain share ignor architectur close model live organ studi contribut gener explor nich design space relationship give full account work ill main assumpt sort architectur studi altern automat process manag process clear rout human brain sensor percept action rout share involv form cognit uniqu restrict small subset anim evolv process older rout involv automat process thought essenti larg collect system implement neural permit lot parallel propag activ network process condit action occur action intern trigger exampl includ perceptu postur control process trigger includ intern percept thing temperatur damag food bodi state process trigger process gener environ reflex train control intern gener desir drive learn mechan attent manag process rout percept includ process automat trigger condit intern extern action occur action automat happen altern possibl consid explicitli plan choic made elabor temporari structur creat evalu part process addit arbitrarili complex set store inform access deriv combin inform gener process involv combinatori attempt find combin action enabl problem solv task achiev select complet fragment solut requir choic explicitli construct select made mechan form implement attent manag process automat mechan work automat start function differ manag process automat process kind sort control mechan neural net provid mechan map input space output space fix defin metric automat problem requir creation structur vari complex distinct manag process automat process crude figur partli luc beaudoin ian distinct sharp defin good concept distinct good theori deep concept definit theori shallow start oper definit measur reflex environ architectur motiv agent variabl threshold motiv activ feedback attent filter automat process percept action reflect manag process process action percept figur intellig agent architectur layer involv rout percept action evolv earli share organ common harder terminolog part process theori build concept format featur manag process human resourc unlik automat process automat process portion brain oper manag process share slow parallel explain appendix kind mental task perform count count backward sing song silent altern thing hand talk amount parallel speed manag process interrupt filter mechan prevent disturb manag current task import fail temporarili disrupt goal automat gener automat act part concurr manag task requir plan handl manag system urgent requir interrupt suspend abort activ interrupt limit potenti damag interrupt filter mechan dynam vari threshold requir automat mechan assign measur goal determin abil filter call insist goal insist featur goal inform structur control process process involv motiv sort process involv motiv motiv inform structur potenti initi modifi intern extern directli case innat learnt cognit result process explicit evalu accept format plan execut intern behaviour concern synthet agent person requir ffl motiv gener set ffl mechan suppress protect manag process ffl manag motiv includ ffl assess motiv likelihood cost urgenc ffl adopt form intent ffl condit execut motiv ffl decid execut motiv ffl predict effect occur part evalu plan process ffl assign measur influenc abil motiv maintain control gain control ffl detect conflict motiv ffl detect mutual support motiv ffl set threshold manag interrupt filter ffl termin motiv explicit termin decai ffl detect relev event exist motiv ffl process control manag process decid ffl execut high level manag ffl improv extend improv method assign assess urgenc case ffl extend develop reflex ffl global switch mood optimist turn pessimist cautiou repres motiv structur order engag kind motiv rich structur includ specif featur vari defin motiv fix semant denot state true motiv attitud motiv explicit reason indic current belief ps import base assess consequ descriptor heurist comput determin interrupt capabl correspond estim import urgenc attract attent intens determin motiv attend act continu favour consid motiv kind momentum possibl plan set plan achiev motiv commit statu dynam state defer manag state current relev manag process current robot softwar motiv simpler structur explor possibl varieti type motiv structur requir differ motiv manag process execut process individu differ human explor space show deepen visual percept figur wai mislead suggest compon architectur simpl structur box concern percept complex figur attempt year model visual percept suggest visual system sort complex figur requir percept matter recogn pattern sensori input level analysi requir case speech acoust signal level interpret concern word semant speaker intend achiev call partial view visual architectur form histogram give global inform visibl surfac descript intermedi imag featur bodi imag scene object scene centr descript causal event level trigger motiv emot process control subsystem link postur motiv figur sketch visual case vision requir structur retin imag optic arrai find structur environ properti relat object includ causal relat potenti gibson refer surfac flat sit support cliff potenti danger intern complex varieti task visual process link sourc inform visual imag instanc visual process influenc input current sensor heard gener knowledg type thing form descript spatial structur marr visual mechan output sort includ postur control motiv gener cross link transmit control transmit inform content intermedi environ vision primari claim myriad rout includ rout automat process mechan serv includ control heart sexual sort attract doubt thing dont visual input modul postur aspect partli result physic person height rel doorwai individu aspect due earli childhood easili parent lead develop retir postur control state intellig agent global neural physic event effect semant content short term long term hard slow effect indirect skill semant control state prefer mood emot intent plan figur control state text visual process trigger remind interact influenc produc tendenc parallel common postur control signal detail sort process occur cross link occur depend individu form part uniqu person architect build differ occup percept spider affect person wai person featur high level control distribut system isnt thing distribut person distribut reason hard chang control state intellig agent figur impressionist diagram intend suggest dynam aspect exist level vari type chang dark circl repres event circl repres control long short specif global event fall thought control state subject influenc top influenc longer gener control includ aspect person sudden intens pain hand produc specif short term movement sourc pain long intens pain sort complex includ surgic read differ effect produc similar mental state found mental event endur state semant content state modul process local amount prior action modul quantit speed slow structur switch strategi languag arrow repres differ strength differ determinist probabilist rout system causal influenc link event endur modifi state distinct automat attent process made level diagram circl lower level diagram repres control state influenc event fairli typic readili changeabl moment annoi walk higher system thing indirect influenc capabl broader rang instanc tast food polit attitud influenc event disposit lower system creation motiv control state disposit exist produc actual chang event condit main theme brittl glass capabl determin persist long time produc glass hard similarli mental state produc effect condit level state gener rang potenti specif state control current postur specif prefer movi directli influenc specif item behaviour board train movi heard make close poster film show make librari read book high level control state evolv instanc tast film develop time manifest high level disposit mental state chang inform produc behaviour produc influenc earlier chang manifest long fact disposit activ condit thing suppress influenc exist intern lead extern sign peopl lot state manifest reveal aspect sort control exist express current import effect social complex social feedback loop differ level control hierarchi correspond direct differ manag process automat process depict figur differ level sort discuss section occur manag process automat process understand issu requir explor design space type control architectur problem defin manifest person varieti emot state individu capabl discuss fact word wide varieti definit peopl claim studi emot extrem peopl write motiv strong motiv person strong desir promot emot id call motiv kind extrem view defin term mechan system attent concept emot appli human anim share ancient evolutionari histori defin term extern behaviour corner mouth aggress postur defin term thing boundari intern extern muscular propriocept sensori skin concentr subclass emot state common human occur anim state deepli involv high level cognit process social excit pride kind emot poet write state partial loss control high level cognit process includ common word avoid technic definit project word label phenomena word intend reson concept perturb emot state heard woman interview radio talk son kill road accid year talk state muscl facial talk state mind theme extent unabl control mental process constantli drawn back prevent room children move inabl control meant pai attent normal task carri properli found inabl life made affect peopl thing includ children made depress felt inabl cope life end emot pile top possibl sort mental state occur kind consequ type architectur talk theori emot claim occur time link architectur state discuss fulli al case suspect peopl experienc state person made fool public remain concern time simpli happen frijda frijda stronger hold attent put mind drawn back dont anger common stop achiev goal return stop desir sort perturb state talk aspect anger addit find partli control desir back put mind continu draw attent thing disposit disposit temporarili swamp power child sudden danger suspect state occur anim share state process occur call part sort architectur make control thought process rat lose control thought process perturb state possibl perturb state inher sort architectur architectur evolv order produc perturb state similarli possibl thrash inher comput oper intend design possibl emerg function aspect design case manag mechan parallel protect kind filter mechan iv suggest motiv inform assign level insist determin abil filter interrupt manag process insist level assign automat process prevent high level insist assign goal conflict high level object attent frequent interrupt held item assign high insist level inconsist goal strategi select agent partli lost control thought process full account perturb state show disposit state persist temporarili insist accept thought goal grab hold attent wright al explor nich space design space relationship includ explor infer natur artifici attempt kind behaviour capabl environ understand human person context studi design agent nich studi prerequisit construct synthet agent aspect human emot motiv synthet agent paper show featur explain basi underli inform process architectur design requir implic studi ffl ffl ffl ffl ffl view fit scheme thing acknowledg work support uk joint council renaiss grant birmingham grate robert trappl colleagu austrian research institut artifici intellig prepar transcript talk discuss luc ian tim christian chri past present member cognit affect project birmingham addit paper group found ftp web page discuss edit transcript discuss lead talk part tape unclear edit transcript check access origin audio tape wrong ambigu incomplet portion transcript move portion discuss back main relev metric success design metric success design dont notion success easili measur babi minder manag aliv period time exist simpl vari rel speed movement babi movement minder intern process minder find imposs babi set babi depend initi geograph distribut babi random element sort full implement includ make extern event gener goal faster handl manag introduct process improv success babi aliv physic resourc limit point clarif emerg claim manag process resourc limit contrast automat process point reason parallel limit part architectur physic hand physic resourc limit distribut case robot thing fewer physic limit parallel talk physic resourc limit talk limit inform process resourc interest question fact evolv resourc good design reason good question discov fact human good design reason limit parallel fact learn thing solv complex credit assign decid combin good bad thing happen unexpectedli number combin exponenti function number rapidli effect delai type limit memori make highli parallel associ question time answer type limit concern requir build temporari structur unbound plan problem solv due singl coordin process level reduc risk independ mutual inconsist chapter design reason accid sophist agent limit number task simultan automat process limit parallel dont access common inform dont sophist dont build temporari structur unknown complex workspac notic automat process build complex visual languag understand process effect form train alloc dedic portion automat mechan task run parallel higher level process learn music circumst mechan minim mutual mention work resourc limit system differ architectur present good wai studi mental find organ architectur type discuss suspect find organ share call automat process impress speci includ attent manag process process control bird perform complex task automat mechan respond trigger produc stereotyp unlik human builder explicitli consid altern altern altern construct sequenc act meta manag process human approach defin research programm biologist filter implement bit intern percept intern prefer david mention filter system doesnt claim goal interrupt manag process total open mind implement implement neural dont explicit activ condit oper excit inhibitori link altern separ mechan explicit threshold set higher level process import point sort function total architectur explain requir kind nich requir kind design give nich minder simpl number featur chosen drive research world number thing happen capabl time gener goal system give system make select plan complet back simpl comput interfac typic window asynchron perceptu monitor concurr insid problem requir form part nich requir speed thing happen environ make intern resourc limit show intern architectur round problem resourc limit mean system deal goal immedi investig fulli potenti consequ cost benefit achiev decid adopt process import current plan process problem manag mechan support unlimit parallel speed thing happen slowli environ intern process run complet order opportun miss requir environ unpredict mean system decid advanc interrog environ build plan asynchron concurr perceptu process gap transcript due tape chang slightli sophist simul minder awar cry decid find problem contrast simplest version minder problem manag task decid act problem achiev babi low charg recov recharg pick move babi close current domain minder small collect requir subject babi troubl requir make design problem ad requir instanc add requir cooper order thing sensibl minder babi minder shouldnt babi nearest minder comparison schedul system kind problem solv comput dedic person problem schedul comput infinit infinit design function optim condit perform defin notion optim assum minim architectur thing make work perfectli open decid explor sort assumpt sort talk run genet algorithm evolv natur varieti situat find collect solut work wai thing map nich space design slide style isnt simpl notion design fit fit nich wai fit work normal slight chang circumst make design dont work normal work abnorm condit similarli design speed costli easier build varieti kind issu suspect dont understand issu explor partial answer question altern solut predict friendli understand environ understand implic deal unpredict environ environ minder minder babi lot constraint wont room partli predict environ partli predict part result environ make live persist featur concept cognit friendli environ dimens cognit friendli avail detail inform didnt electromagnet radiat bounc surfac thing detector retina tune environ cognit friendli type cognit friendli concern amount inform complex process requir discrimin physic structur object importantli behaviour hard differenti tree produc fruit produc fruit count leav tree find number odd cognit unfriendli thing evolv sort case occur environ total unpredict level manag question process defin level manag requir run step feel suffici independ nich characterist perform explor larg number nich space sort priori empir fact abil point work suffici gener doesnt solv problem nich peopl encount motiv level explor nich lead addit aspect architectur addit aspect requir concurr manag claim dont reason explain limit concurr rule coexist process involv build robot free put mechan find total sort mechan discuss control system requir complex autom factori sort architectur regard open nich wai wai requir architectur nich success solut sort mind filter identifi process identifi process control manag explan human emot havent relat emot talk total control thought process link fact attent mean potenti user resourc automat resourc imagin design start attend problem divert problem solv disastr case import urgent turn motiv captur attent manag process motiv manag process limit parallel task urgent import requir full attent detail dont brain surgeon oper brain distract sound thought holidai spain similarli give intric instruct listen miss crucial inform possibl interrupt manag prevent notion dynam variabl filter mechan vari open question origin start idea simpl threshold luc phd thesi suggest simpl numer filter qualit divert attent kitchen type level threshold determin process determin current manag task easili interrupt insist level automat process gener potenti distractor assign insist valu fulli resourc filter mechan protect disrupt insist assign mechan dirti heurist give approxim estim import base learnt pattern thing type interrupt occur insist assign occur sort filter threshold set kind circumst person vari thing call human emot state case continu grab dont mind kind pleasur partli control thought good thing peopl put situat partli freeli kind strang thing peopl claim aspect emot state call manag process partli occur context architectur suffici rich support possibl manag process occas control lost requir process evalu control manag process dont architectur make process architectur good current network server architectur worth back babi pretti convinc comment formul network server model system resourc reconfigur network complic basic serv custom system run situat period collect statist defin heurist local give static state behaviour dont static state situat emot content find violat kind formal model peopl kind situat convinc approach ai network lot distribut control rout talk talk serv lot comput question sourc motiv network server thing request babi class request arriv asynchron vari import urgenc finit death injuri problem domain express idea million analog problem domain question plan network depend problem case perform simpli numer statist maxim likelihood success oper claim human find thing difficult partli explain find optim engin solut problem sort architectur sort mechan wouldnt architectur planner collect wai figur basi distribut babi arriv distribut babi death time real eventu learn control fast heurist decid learn kind eventu build system design evolut tune adapt process plai import role automat process share anim flexibl deal circumst chang statist adapt process construct make complex form complex system concept nich human architectur fit complex typic network server present complic kind system point kind schedul optim condit matter extern problem architectur solv problem differ faster process kind claim uniqu distinct solv creat optim goal make work make turn easi lot wai make environ real human life regard fashion intellig agent explicit plan construct problem solv prior perform action workshop explor altern date mode travel creat includ decid airport coach car time interf plan kind nich defin research problem requir minder perform plan task compet engin find solut simpl domain made plan rule artifici domain evalu evalu isnt compar human kind metric artifici human circumst optim havent optim sort thing develop intuit made person dont direct answer thing person peopl class find framework didnt make miss architectur reason make reason human situat make made term time pressur happen start make neg point difficulti make comparison shouldnt distract ill give posit answer lower direct wai evalu system human drive simul compar behaviour produc softwar system indirect long time indirect wai framework gener explan thing psychologist social worker teacher concern produc mention paper emot al trigger read report experi intens long written love friend di long ill paper made shot show phenomena architectur process forc pai attent thing miss includ support experi pleasur kind defin meant control thought process led develop implement comparison model detail phenomenolog report sort evalu show paper expert clinic psychologist pleasur paper relev read editor journal psycholog immedi publish prove idea correct partial initi indic make progress direct regard kind indirect doesnt idea idea peopl havent turn scienc prove correct gradual closer closer accur theori test run simul point event happen simul find behaviour correl peopl observ behaviour dont correl peopl find explan term featur architectur interest explain problem address enorm complex solv lifetim current limit current understand architectur mechan formal time dont expect main form test studi actual behaviour work implement idea earlier mere task plan implement make discov gap make understand problem send back draw board extend requir specif nich aspect design dont implement produc implement peopl pai attent idea show work prove empti drive develop real unlik theori hope eventu produc nice teach tool psycholog student dont run run guess explor understand design space run bit extrem impact behaviour havent thought back understand person dont long line experi compar implement human behaviour advanc larg discrep implement futur peopl variabl regard import deep analysi effect differ design situat affect speed correct move higher level understand test understand test consist idea implement dont simpli run lot test program formul theoret predict architectur capabl run program relat theoret explan understood result architectur model person architectur start model variat chang manag complet real biolog social structur lot gener system gener differ individu start support diverg function societi differ amplifi differ individu grow vienna grow african minor variat expect kind person accommod gener sort motiv strategi evalu compar wai assign prioriti differ automat part main focu research long explor type genet differ human find wai implement interest make peopl happi airlin pilot bu kind life prefer claim genet determin depend extent individu absorb inform strategi gener perceptu categori process grow cultur regard chang acquisit type abil link compon rememb person thing larg collect inform control structur distribut system long term research suspect explain gener sort architectur interest individu variat term kind wai thing agent react situat wont varieti toi domain support richer scenario support individu variat sort human includ environ develop larg set detail problem individu solv structur environ produc long term affect futur process behaviour full studi person requir investig rang wai individu genet share common gener birth implement dont tini subset refer bate loyal broad paper present aaai spring symposium integr intellig sigart aug pp lp beaudoin studi motiv process prospect artifici ed partridg io goal process autonom phd school comput cohen stewart penguin emot cambridg press make robot consciou mental aaai spring symposium repres mental state access vision societi william ortoni gl clore cognit structur cambridg refer featur guid reason opportun fourteenth annual confer cognit scienc societi lawrenc erlbaum associ concept hutchinson motiv emot control reprint model yale comput revolut scienc model harvest press human sloman robot proc int joint conf vancouv interact philosophi role intuit reason proc int joint conf reprint artifici enabl machin proc int joint conf ai lo motiv mechan cognit emot reprint philosophi artifici design visual system comput model journal theoret note aisb theori commun ortoni slack commun artifici intellig theoret appli germani prospect ai gener scienc partridg prospect artifici io amsterdam mind control philosophi cognit cambridg sloman explor design proc european confer sloman semant intellig control philosoph transact royal physic scienc explor design space nich proc scandinavian conf io amsterdam poli sim toolkit explor agent intellig agent vol ii ed mike milind springerverlag pp present workshop agent august cognit scienc technic summari attent affect affect file project beaudoin lp analysi emot philosophi psychiatri psycholog
HCI/1277 4 tim marsh peter wright maintain interact virtual space tim marsh peter wright depart comput scienc uk abstract wide thought presenc induc user emerg media digit cinema teleconferenc virtual realiti system argu presenc particip absorb interact visual space creat media prior possibl induc particip absorb convei media attent broken lost potenti induc presenc particip encourag particip lose sight mean drawn convei paper develop design principl experi attempt inform design paper artifici highli success visual medium film paper concentr virtual design principl attempt maintain interact virtual space attempt provid platform resourc blend hardwar softwar virtual realiti enabl technolog support design virtual environ induc presenc particip develop introduct problem interact vr system identifi empir studi desktop vr al marsh wright vr head mount displai al evalu applic run standard graphic user interfac refer problem usabl exist reduc effect effici task turn detriment effect satisfact task vr perform gui paper term activ describ activ vr system perform acquir fun gener fall main educ entertain wide believ perform activ virtual space potenti induc uniqu experi particip experi broken awar artifici medium main problem usabl hardwar softwar vr enabl technolog lack interest interact poorli design virtual space pull interact virtual environ draw attent artifici experi broken inspir design ve problem usabl exist vr system make awar medium natur transpar interact world hold interest poorli design ve long period time reduc usabl problem resourc blend hardwar softwar vr enabl technolog achiev natur transpar provid platform support design ve lead greater experi interact ve criteria user satisfact satisfactori criteria evalu inappropri evalu good activ relat experi vr system altern paper argu develop design principl achiev criteria evalu vr system inform design vr system maintain interact ve creat enhanc experi design principl guidelin highlight inconsist vr system design identifi problem usabl poorli design virtual environ pull presenc tim marsh peter wright background common belief held vr worker fidel stimuli lead presenc al impli reach level threshold fidel presenc induc particip moment stage threshold occur design approach identifi replic world conceiv detail atom provid particip vr ultim presenc obtain real world introduc difficulti practic difficulti term complex memori mention cost unsatisfactori futur techniqu area fractal digit imag comput develop comput game industri prove quest ultim work requir threshold presenc experienc ve determin resourc blend hardwar judg induc experi situat scale continuum presenc low high absolut level replic world conceiv exist manipul presenc shift level experi back continuum impli presenc exist level low high situat assum present present environ exist threshold fidel requir reach presenc induc presenc exit remain worth potenti outcom design replic world conceiv detail sensori inform present particip present encompass arrai stimuli particip make total switch stimuli real world attend sensori inform virtual world identifi situat natur switch total accept stimuli virtual environ ii conflict switch matter accur stimuli particip environ view fact rememb real virtual world question long particip remain situat point reach particip feel detriment hazard effect health withdraw real experi kind blend hardwar softwar vr enabl technolog particip receiv sensori inform real virtual world identifi potenti situat suppress blend suppress stimuli extern vr system attend stimuli virtual world blend stimuli real virtual world creat balanc sensori inform particip ve graviti real world inform physic orient virtual world ii conflict sensori particip unabl suppress sensori inform extern vr system blend inform real virtual world examin common avoid design develop vr system provid conflict sensori inform real virtual situat conflict sensori cue break interact virtual draw attent make awar artifici medium reason suggest memori requir cost make replic world unsatisfactori option requir made reach paper develop design principl attempt suppress real world stimuli blend stimuli real virtual world inform design principl design evalu virtual paper artifici highli success visual medium film presenc tim marsh peter wright inform design principl vr film highli success visual medium inform excel medium success due experi spectat motiv experi film major goal mainstream cinema present inform narr artifici medium remain spectat spectat encourag lose sight mean captur project imag grab draw film absorb narrat attempt spectat experi critic film camera oper actor work spectat pictur audienc examin watch watch world save classic style film experi spectat view film main aspect cinematographi edit convent make spectat unawar artifici medium support aspect make film complex paper develop design principl film develop kind style vr attempt draw awar artifici vr system achiev resourc blend hardwar softwar vr enabl technolog support make virtual space complex broad design categori anticip inform design virtual environ experi design principl guidelin evalu vr system style vr term describ mainstream cinema term describ style encourag spectat lose sight mean absorb repres act convent support translat place narr sequenc visual imag hide make unawar underli artifici captur project imag awar convent break film draw attent artifici spectat awar spectat film present broken treatment cinema manipul time space reader refer paper describ work attempt inform design principl draw awar artifici interact vr system achiev blend hardwar softwar vr enabl technolog creat transpar seemingli form interact particip vr system develop style vr short paper describ ongo work attempt overcom problem interact navig virtual space restrict field view vr system displai screen neal restrict lost ve captur empir evalu studi desktop vr wright vr hmd al attempt overcom problem restrict focu cinematographi convent suggest space spectat film convent support fragment shot impli addit space action exist shown confin boundari screen inform design visual cue suggest virtual space ve anticip visual cue natur guid particip smooth continu anim maintain interact larger virtual space restrict displai screen marsh wright main convent impli space exit entri partial point view build guidelin presenc tim marsh peter wright inform design evalu virtual space wright paper restrict discuss exit entri point charact exit enter point suggest spectat space lead area shown theatr similar techniqu audienc construct space addit plai progress stori audienc learn door left set lead kitchen door back yard space pure audienc construct cognit map space essenti develop understand product implement exit entri point ve achiev graphic model exist trigger knowledg experi impli pathwai particip reach space confin displai partial frame convent captur charact object part bodi section object frame infer space screen object partli constantli remind spectat space rest object design similar techniqu emploi part familiar object shown displai screen part recogn section object impli rest object space inform design principl promot vr experi paper introduc ongo work attempt find criteria design evalu experi interact virtual space matter resourc blend hardwar ve bore hold attent long period time design virtual environ experi grab hold attent provid motiv interact ve long period answer question find al provid inform argument altern addit design evalu criteria effici user satisfact al argu criteria promot fun cite approach attempt analyz comput game achiev malon identifi broad design consist recommend design appeal comput game vr potenti provid greater wealth experi paper film rate good deliv pace lose break attent individu subject experi state watch film wai identifi pleasur joi experienc imagin object view gatewai put scene gut reaction sensat emot state watch film compet broad categori develop criteria rate evalu provid rate individu subject experi evalu film criteria provid broad categori trigger spectat film inform design criteria develop virtual inspir make ve complex grab hold maintain interact virtual space design experi criteria guidelin evalu experi interact virtual space presenc tim marsh peter wright acknowledg work carri human interfac technolog laboratori wa prof thoma fur prof don parker member presenc fund uk epsrc inquisit refer visual structur virtual object desktop virtual realiti virtual realiti annual intern symposium ieee comput societi make movi lo angel theori film publish ergonom qualiti aspect determin appeal chi acm press iso ergonom requir offic work visual displai termin di intern standard organ interact virtual environ evalu model interact vol elsevi landscap narr virtual comput vol acm siggraph theori motiv instruct cognit evalu desktop virtual realiti workshop user center design implement virtual york usabl spatial evalu stereoscop head mount displai virtual realiti system forthcom cinematographi convent inform guidelin design evalu virtual aaai spring symposium seri stanford march visual mind san francisco dc factor influenc spatial awar orient desktop virtual environ human factor ergonom societi annual human factor ergonom societi presenc tim marsh peter wright tim marsh peter wright present tim marsh paper argu presenc particip absorb interact virtual space problem usabl poorli design virtual environ make particip awar artifici medium support ve break attempt encourag particip vr system lose sight mean drawn convei ve paper develop design principl exampl design principl attempt reduc usabl problem resourc blend virtual realiti hardwar softwar enabl technolog paper introduc broad design categori recommend develop design ve experi anticip design principl guidelin evalu virtual realiti system inform design principl paper artifici highli success visual medium film
DB/1278 3 intern symposium integr network wa press proactiv detect distribut denial servic attack mib traffic variabl feasibl studi jo ao lewi lee ravi raman scientif system compani west cum suit ma usa manag technolog amherst street nh usa north carolina state depart comput scienc nc usa abstract paper methodolog util network manag system earli detect distribut denial servic attack larg number event prior attack suspici start addit sudden shift work depend sole inform mib inform traffic variabl collect system particip attack type attack effect research test mib variabl record show precursor attack work support air forc research laboratori ny contract scientif system fellowship program render detect target shut describ relev mib variabl attack extract automat statist test causal shown statist test appli time seri mib traffic target attack effect extract correct variabl monitor attack machin extract kei variabl shown anomali detect base simpl model normal rate chang kei mib determin statist signatur attack behavior observ suggest possibl autom procedur center network manag system detect precursor distribut denial servic respond keyword secur data wareh statist method network system inform model introduct secur manag grow interest industri research gener method softwar tool secur network manag tool trigger suspici data encrypt secur work paper belong monitor close relat area detect object investig network manag system detect present concern distribut denial servic attack specif goal determin precursor attack prevent damag context secur view anticipatori action procedur consist detect secur violat network oper attempt secur violat discuss paper focuss detect role network manag system expect nm coordin attack distribut denial servic attack distribut denial servic attack sever disrupt corpor earli technic analysi attack attack involv class system simplifi topolog attack figur system nm master system coordin effort phase master multipl comput instal script capabl gener larg volum traffic command master detail script refer call system slave phase attack place phase complet phase actual attack command slave gener network traffic bring target system system connect network target router web server typic exampl natur traffic differ type attack common factor abnorm larg number connect attempt target system small interv time process traffic shut target system time matter target handl volum traffic great network congest artifici traffic congest legitim traffic render target make attack ultim success assum master nm target slave nm nm capabl record activ system case necessarili nm awar system attack proce nm infer act call ensembl system nm monitor slave system insid path master target place network event record event observ ultim complet phase attack event expect proactiv detect defin class local identifi figur repres system insid path master repres system insid path slave si target system interest figur present simplifi timelin attack assum nm refer clock time measur irrespect nm awar event defin time entri repres time master start instal slave instal procedur till view instant defin local ensembl includ slave complet mark commun master slave start phase attack record event interest instal slave phase happen interv time time master command slave initi attack start attack time made master week human made master time smaller assum feedback master sequenc event interv determin interact tool resid network system interest stage slave master target nm figur distribut denial servic attack simplifi topolog target slave nm case master command initi attack slave start send disabl network traffic slave target target traffic reach disabl network shut target instal slave master initi master complet slave instal figur distribut denial servic attack simplifi timelin mib traffic variabl experi research test bed data set studi attack produc north carolina state research network topolog depict figur network manag system collect mib variabl mib inform group udp snmp variabl collect interv sampl rate target os red hat linux attack os red hat linux attack sun os data attack run normal run ffl attack type attack produc flood descript tool attack type mib collect attack machin attack figur target time seri mib variabl counter variabl differenti run record type attack terminolog introduc section attack attack master monitor network manag system ffl normal mib collect time machin target attack run target run attack run attack mib ethernet link attack attack mib queri mib mib queri target network manag system figur research network data set includ event start tool assum instal attack machin attack run start prospect definit mib variabl group pp proactiv rule relat event event illustr natur mib variabl relev attack figur depict align mib variabl attack machin show remark activ ping reach target remark outbound ping visibl larg number ip request attack flood target figur sampl ping sampl ping attack receiv packet commun master slave udp tcp packet command master slave initi constitut figur mib tcp udp group attack show variat coincid variat variabl obtain domain knowledg ping flood attack procedur extract kei variabl attack entir collect mib data attack machin procedur section result present case ping flood udp flood attack autom proactiv detect methodolog result larg describ oper inform view problem extract proactiv rule secur consist step delin step perform produc set rule detect secur violat focu paper distribut expect methodolog appli type secur causal relationship infer measur variabl detect attack object determin variabl target machin occurr attack call variabl kei variabl target recal step perform akin attack place final product step list kei variabl target attack attack attack attack figur ping select mib variabl attack target target procedur determin kei variabl target domain knowledg attack ping flood illustr figur variabl ping flood effect send packet target compar evolut variabl attack evolut variabl normal oper variabl displai larg variat normal oper declar kei variabl target local variat time seri segment small compar normal profil procedur detect anomali network due compon fault anomali detect variat paramet autoregress model case attack traffic variat target simpler procedur situat figur grow averag time seri properli chosen detect presenc attack shown larg class traffic variabl repres main featur interest util domain knowledg attack extract kei variabl target detect correl kei variabl target determin variabl prospect attack machin causal relat variabl attack machin relat event recal attack list variabl make assumpt causal relationship variabl prospect attack kei variabl target infer link attack target assumpt verifi final product step list kei variabl attack detect precursor attack detect object determin featur kei variabl attack attack target recal variabl found step causal relat expect anomali variabl indic incom attack featur shown construct proactiv constitut end product step proactiv rule implement alarm nm compon detail sequel step detect attack inspect script experi led conclud kei variabl target attack ping flood ping flood attack effect send larg amount packet target kei variabl target case attack effect send combin uncommon ip packet target uncommon packet consist invalid packet header tcp segment rout flag mib variabl reflect error layer kei variabl target select experi udp flood udp flood attack creat attack send udp packet random port target util kei variabl target case step detect correl attempt determin variabl attack machin causal relat kei variabl target proactiv determin variabl attack event attack detect target event section investig causal test determin kei variabl attack test causal involv statist tool test lag inform variabl statist inform variabl causal test compar residu autoregress model residu autoregress move averag model assum lag length estim unrestrict ff fi null hypothesi fi affect delai unit null hypothesi test estim paramet restrict equat fl denot sum squar residu test statist greater critic reject null hypothesi fisher distribut paramet high valu understood repres strong evid causal relat tradit causal relat denot statist pair find causal relat attack appli compar residu ar model kei variabl model pair output kei variabl input mib variabl tcp udp group base domain knowledg kei variabl attack tabl displai variabl determinist stochast realiz algorithm fit model stochast realiz algorithm fit ar model output appli run type attack event happen shown figur target machin receiv ping run ping flood durat run vari case case tabl relev inform run mib event tabl kei variabl attack ground truth mib event tabl kei variabl attack ground truth attack run sampl ev ping flood ping flood udp flood udp flood tabl statist attack paramet threshold statist level threshold critic level result scenario potenti attack true attack normal run appli measur causal strength mib variabl potenti respect kei variabl target attack mib variabl potenti attack result statist threshold level consid kei variabl analysi step count detect variabl present tabl correctli pick alarm correspond mib variabl flag tabl displai result run ping flood attack tabl summar result type attack notic run ping flood mib detect mib variabl attack machin relat mib variabl case diagram causal relat kei variabl target observ appli run ping flood run attack tabl notic mib variabl attack detect run set alarm proactiv detect fa rate mib obtain comput total number mib variabl found normal divid total number mib variabl run ping tabl give fa rate record tabl rank mib tabl ping flood run top mib attack statist run max sign mib tabl ping flood run perform normal run attack level attack run detect fa mib ping flood ping flood udp flood udp flood tabl result step detect rate fa rate mib variabl precursor attack step detect precursor attack kei variabl attack determin step label causal relat attack find kei event attack anomali detect postul behavior kei variabl attack consid kei event attack approach jump mib monitor absolut valu differenti time seri normal construct normal profil jump mib variabl kei attack variabl determin step kei event attack defin jump larger largest jump encount normal profil jump kei attack variabl kei event discard kei event set alarm result shown tabl found procedur led substanti reduct alarm produc step small reduct detect rate notic detect valid precursor attack run result suggest step serv effect prune initi ensembl candid mib variabl determin produc final ensembl manag fa rate remark verifi maximum jump occur kei variabl attack attack target signifi methodolog extract event enabl proactiv detect remark level tune paramet effect detect fa step larger level lead higher attack run detect fa mib ping flood ping flood udp flood udp flood tabl final detect rate fa rate event mib variabl work paper discuss methodolog automat extract probabl precursor attack mib traffic variabl attack methodolog extract valid attack rate alarm framework depend mib inform straightforward statist signatur implement mib watch common network manag system found result awar limit local test control traffic load work valid methodolog realist traffic condit applic realist multipl domain involv attack commenc target miami plan work scale approach environ problem network manag system multipl domain commun alert offend packet find race destin target destin manag system target solut race problem mind alert satellit acknowledg scientif system compani acknowledg continu support inform warfar branch air forc research laboratori ny grate peter encourag effort refer network secur manag intellig agent ieee publish statist traffic model network detect eighth intern symposium simul comput telecommun page san august ieee comput societi distribut denial servic flood flood network technic report depart energi incid advisori februari design implement secur manag agent coordin protocol ieee publish investig causal relat econometr model method hamilton time seri analysi princeton kendal comput attack evalu detect system master massachusett institut june data mine framework build detect model ieee symposium secur realiz algorithm technic scientif system levitt network detect ieee van de moor subspac identif linear system kluwer academ scienc technolog section internet secur anatomi attack februari page steven vol protocol subramanian network manag principl practic ji proactiv anomali detect distribut agent ieee page septemb zhang hellerstein approach predict detect eighth intern symposium simul comput telecommun page san august ieee comput societi
DB/1279 3 updat queri open nest transact alfr burkhard freitag passau depart comput scienc germani abstract updat languag ultra aim specif complex updat modular fashion logic semant updat goal base updat request correspond defer basic updat declar charact logic semant leav freedom evalu natur map system nest transact extend oper model basic oper perform commit independ complex oper defin updat rule lead open nest transact exploit semant properti complex oper gain concurr meta inform provid programm present kei element combin updat languag transact process flexibl system architectur introduct present updat languag ultra updat languag ultra transact logic updat implement rule defin complex oper goal concept similar classic program languag build arbitrarili complex oper modular fashion construct concurr sequenti bulk updat subsum classic oper logic semant updat goal wrt fix state defin term updat request set insert delet request ground edb tupl semant declar state evalu model paper present oper model implement fragment logic semant term open nest transact perform top coupl system implement declar logic semant updat structur complex oper reflect tree subtransact evalu preliminari oper model system architectur discuss recoveri nest transact investig approach develop major nest transact rollback partial abort transact backtrack logic evalu concurr control recoveri level basic addit semant knowledg complex oper concurr improv long gener model present concurr control recoveri perform complex oper lead flexibl sequenti program fragment evalu strategi discuss lead concurr possibl acid properti strategi featur parallel subtransact profit wrt concurr point ongo work open nest transact model issu subtransact commit subtransact transact ultra forward oper updat languag updat approach transact logic approach deal specif execut main scope investig appli result theori ultra repres updat languag extend map complex oper logic rule nest transact nest transact concurr oper logic languag compon architectur adapt evalu strategi schedul techniqu paper appli updat extend provid addit meta inform activ manag nest transact execut eca rule contrast model nest transact reflect intern structur trigger rule amount concurr accomplish requir activ coupl mode transact model extend special featur top semant defin base extend nest transact approach present combin pure declar semant ultra open nest transact base oper model paradigm eca rule inher ultra rule rest paper organ section recal kei element fragment ultra languag develop discuss oper model section section present central point meta section summar paper collect research issu address futur work paper fund german research agenc contract number fr ultra languag ultra extend syntax datalog basic updat atom technic descript ultra restrict insert delet del edb basic oper smoothli integr tra concept basic ultra introduc connect concurr conjunct deriv tradit conjunct datalog rule sequenti conjunct mean subgoal refer intermedi state result execut updat left subgoal sequenti conjunct associ commut detail descript ultra syntax semant found oper semant refer restrict sequenti connect extens full includ bulk subject present research section restat standard transfer monei bank account classic transact suitabl illustr featur oper model insert delet basic updat oper read access specifi edb idb order short avoid idb relat express deduct rule addit classic simpl constraint express arithmet comput updat program written ultra updat rule amo bal del bal bal amo bal del bal bal amo bal complex oper transfer built withdraw deposit oper edb consist binari relat make handl subtransact commit independ transfer transact lead open nest transact hierarchi ultra transact invok updat goal submit queri evalu perform transact acid properti ensur data access transact affect simultan transact transact appli achiev execut basic updat request read access certifi system execut oper possibl acid oper system decid delai abort semant ultra assign updat request set success updat goal updat request set insert request delet request tupl edb relat nondeterminist transact gener updat request repres transit initi state final state note transit updat goal depend evalu strategi transact invok queri transit updat request execut commit persist edb logic semant restrict choic transit time materi transfer recal queri ϕ transit ϕ encod updat request provid account balanc due space describ detail transit construct ultra refer reader note updat request set express evalu subtransact express result account oper model ultra execut transact consist type evalu queri bind variabl comput updat applic select updat request edb architectur execut strictli divid subsequ phase evalu resp transit transact goal comput chang physic edb transit materi oper semant base complet defer updat drawback detail hypothet reason refer intermedi oper lead intermedi state carri effect visibl comput reason compon practic problem result perform transact strictli separ phase system show continu behaviour suitabl extend interact compon evalu ultra semant comput transit evalu phase presenc specif hypothet reason lead lot unnecessari small exampl tractabl anymor solv problem evalu strategi wellknown prolog appli ultra program updat collect execut immedi evalu queri topdown fashion result resolut tree map nest transact tree figur fact model show structur subtransact implement logic backtrack simpli abort subtransact del del figur resolut tree nest transact tree subtransact aid backtrack satisfi nest transact invent commun amount concurr transact addit semant knowledg complex oper case logic updat languag investig paper schedul nest transact inform compat conflict oper discuss section evalu updat assum updat program rule ultra languag present section definit updat transact updat queri form updat atom write abbrevi usual logic variabl denot upper case constant written lower case note restrict queri atom complex queri form express rule queri execut transact updat queri logic evalu schedul hand black task logic evalu transact updat evalu return success failur addit variabl bind task schedul oper includ special oper abort transact execut atom reject oper outcom addit result return failur return transact updat queri evalu definit updat queri logic evalu queri resolv goal updat program result set instanti rule bodi rule send request schedul subgoal appli variabl bind obtain send instanti goal schedul wait result schedul return success result obtain variabl bind continu point subgoal schedul return success begin result variabl bind continu point subgoal schedul return failur exist result previou choic rollback current continu point schedul return failur possibl variabl bind choic react failur discard variabl bind send abort request rel current transact retri current oper continu point rule bodi continu point return failur subgoal send commit request schedul commit return success calcul result commit reject return failur schedul execut request request start transact commit request test schedul protocol commit return success commit execut abort current transact return failur abort request abort current transact report complet request oper basic schedul concurr control protocol oper send data manag execut return obtain data manag addit result return failur data manag oper schedul protocol request oper complex schedul concurr control protocol oper send logic evalu transact updat queri return outcom queri addit result return failur schedul protocol log action outcom system log logic choic point choic possibl lead failur goal evalu commit subtransact commit choic assum handl common ancestor fail oper transact retri evalu choic note thread logic evalu belong transact execut concurr central schedul ensur interleav execut concurr transact serializ proposit evalu transact updat queri definit perform updat requir logic semant ultra proof updat ultra semant yield updat request set captur logic mean queri execut set chosen materi oper model execut updat logic failur updat correspond updat request set ultra semant logic failur updat fail branch remov abort subtransact fail branch updat correct wrt logic semant evalu point choic made definit choic result fail updat remov choic lead success possibl detect ultra semant differ choic materi branch delai semant level updat request set oper model anticip choic execut queri oper model exploit concurr transact level basic oper descript schedul definit oper step simpl subtransact backtrack proposit interleav execut transact updat queri definit obei acid properti proof execut oper control schedul schedul concurr control protocol properti extend execut transact updat implic proposit transact system control ultra schedul transact oper directli destroi serializ interleav execut assum local transact execut techniqu develop feder system adopt handl logic transact failur shown logic failur correspond abort subtransact complex oper implement open nest abort subtransact requir advanc techniqu recal open nest transact made commit subtransact visibl transact run concurr oper undo commit subtransact mean order remov made oper explicit oper semant remov effect oper definit abort schedul proce record begin log consult log obtain success oper current transact execut oper start oper basic issu oper data manag complex send oper logic evalu transact updat queri record execut action complet oper execut transact abort commit oper execut oper undon simpli restor state complex oper gi definit oper provid programm oper updat rule normal complex oper section detail note schedul ensur execut oper violat serializ histori gener schedul prefix reduc introduc oper prohibit oper schedul concurr transact requir transact increment account delet concurr transact delet make imposs schedul avoid situat adequ schedul protocol base compat inform programm section discuss acc del fail del acc withdraw del del figur recoveri figur show failur deposit oper execut oper execut oper delet tupl read deposit subtransact commit failur report transfer transfer decid abort commit withdraw oper note argument proposit proof base fact fail branch updat abort subtransact fail branch fail branch fact updat semant point combin effect updat null oper level updat updat request set defin semant ultra handl formal develop model updat request extend simpl set structur resembl kind log model reason log suitabl captur concurr main advantag oper model exploit greater amount concurr transact defer updat approach semant knowledg compat conflict complex oper concurr transact schedul schedul free concurr control protocol adequ open nest result theori proposit oper model exploit concurr transact mention section full ultra languag featur concurr composit construct integr oper model slight chang point descript logic evalu definit subgoal send execut previou report concurr subgoal schedul similar execut concurr prolog provid share concurr subgoal share logic evalu decid sequenti model flow inform subgoal schedul concurr execut oper serializ concurr subtransact commit semant roll back reason restrict sequenti goal paper fact semant concurr ultra system slightli system regard concurr execut correct outcom correspond sequenti execut concurr goal concurr execut complex oper increment number result ultra semant concurr goal evalu initi state aggreg updat contradictori updat simultan insert delet tupl detail definit consist updat request concurr increment investig constraint gener semant ultra coincid serializ semant system appar coincid concurr goal oper data architectur oper model section realiz system architectur depict figur compon architectur ultra meta inform code rule oper subtransact compat matrix inform basic oper data manag edb edb access transact updat queri ultra evalu ultra schedul retriev recoveri data manag system retriev data log persist log complex oper evalu recoveri figur ultra architectur ultra extern db extern manag system persist storag edb data log data manag execut basic oper ultra program ultra schedul concurr control recoveri complex basic oper request execut schedul nest transact schedul basic data complex thread ultra evalu oper gener ultra queri user schedul queri result subgoal schedul execut detail section meta inform explain previou logic ultra enrich addit inform compat inform correct hand inform recoveri kei techniqu enabl recoveri open nest transact oper make undo oper provid remov commit independ transact transact read made recoveri simpli restor valu adequ remov undon semant undo oper extend ultra oper undo oper basic undo assum data schedul call directli complex oper complex oper schedul inform oper invok undo oper gener provid programm wrote exact semant undo effect system gener step automat structur oper current log essenc lead level base oper action addit paramet depend intern state forward action record log paper restrict complex oper provid addit inform complex oper argument cf definit undo oper call argument oper note properti hold basic insert delet undo insert schedul insert proper crucial point subtransact undo oper fail requir abort oper due transact conflict problem solv adequ schedul protocol histori prefix base simpl retri abort subtransact requir logic evalu oper evalu goal fail due logic recoveri programm made provid action logic solut system remain uncertain state recoveri manual transfer rule oper withdraw easiest case undo amount monei simpli credit back account undo deposit oper deeper thought tempt analog deposit lead problem recal withdraw oper check account fail balanc neg fail logic avoid deleg schedul ensur withdraw deposit fail logic essenti mean withdraw oper transact execut deposit withdraw sever restrict altern provid oper fail undo del bal bal amo bal declar undon undo note account neg forbidden toler question busi polici imagin polici balanc account neg due human oper notifi account appli undo oper transfer forbidden withdraw target account transfer transact finish successfulli accept balanc neg rule undo undo declar undo rule undo transfer nice repres undo oper gener automat rule similar goal execut transact abort definit point work simpl case oper defin undo rule addit test find rule bodi select case analyz effect special log entri reflect select rule bodi gener rule gener automat provid human programm problem transact abort definit system log analyz oper execut drawback automat gener undo rule programm addit semant knowledg system recal discuss deposit solut account human oper notifi deduc automat thing requir human familiar busi case oper undon undo automat gener action classic oper creat relat insert data human programm undon simpli drop automat gener action delet insert tupl drop relat compat inform element addit inform program inform compat conflict complex oper test compat oper issu transact schedul protocol wide serial graph timestamp base method found notion conflict compat oper central role compat inform advanc transact model nest transact schedul ultra system handl basic oper complex provid kind compat relat includ oper pure retriev oper edb note compat conflict inform schedul decid serializ interleav execut concurr transact oper compat realiti lead histori serializ incorrect conflict reduc amount correct compat relat form compat matrix oper provid matrix task grow quadrat number oper complex oper oper level abstract argument account transfer compat matrix bank oper transfer state deposit transfer conflict transfer oper fail succe order oper relev transfer affect deposit credit order oper irrelev express argument declar argument accomplish easili compat matric simpl languag condit oper compat conflict languag express power declar typic argument rang check compat test carri declar complex languag condit express argument oper refer current content requir access compat check definit gener form compat declar oper boolean express variabl argument predic compat symmetr declar impli declar set declar form call declar set transfer compat declar predic bank shown note argument amount irrelev compat behaviour depend account access true ac ac ac ac ac ac test pair oper compat schedul evalu condit declar pair condit evalu oper pair compat declar pair schedul assum conflict note declar pair oper definit oper compat declar set exist declar oper condit evalu true declar pair existenti quantif true miss declar indic conflict reduc amount correct compat declar user concurr undo oper handl schedul compat declar number declar made work adequ aid user task present oper model perform transact tra languag model base open nest transact featur exploit compat inform level basic enhanc perform modern inform system innov attempt bring logic specif languag recent result field transact theori assum clear semant logic languag oper aspect transact creat firm basi transact program environ current work includ extens idea present full ultra concept concurr conjunct bulk investig theoret level ultra semant extend arbitrari basic oper schedul transact model provid desir requir gener semant level ultra parallel work investig reason meta inform essenti deal extend transact model refer goodman model concurr nest transact system journal bernstein newcom principl transact process morgan bonner kifer overview transact logic theoret comput bonner kifer concurr commun transact logic proc joint int conf symp logic program page chen program logic bulk hypothet reason ieee transact knowledg data chakravarthi project widom activ system trigger rule advanc chapter page morgan theori für und von phd eth german silberschatz formal approach recoveri transact kumar recoveri mechan chapter page prentic atom transact morgan martelli transact updat deduct ieee transact knowledg data moss nest approach reliabl distribut comput mit ye unifi theori concurr control recoveri acm symposium principl page editor concurr volum mit schek unifi concurr control recoveri transact semant rich oper theoret comput freitag execut ultra transact proc workshop logic program octob page full version technic report freitag captur dynam defer updat proc int conf logic program juli page mit logic transact serializ transact chang logic volum lnc full version technic report
ML/1280 6 naiv approach word disambigu revisit gerard german abstract paper describ comparison standard learn naiv word disambigu problem aim work twofold attempt contribut clarifi inform comparison method relat literatur direct test modif basic learn algorithm vari featur space improv algorithm order deal larg attribut set basic consist posit inform improv greatli effici loss accuraci experi perform largest corpu frequent ambigu english word result show approach gener superior bayesian specif metric deal symbol attribut introduct word disambigu problem assign mean word text mean distinguish potenti attribut word resolv ambigu word central problem languag understand applic task machin inform retriev hypertext speech spell refer automat text import open problem natur languag process field wide rang approach investig larg effort devot tackl fact date highli accur word disambigu system built success current line research base approach statist machin learn algorithm appli learn statist model classifi corpora order perform approach learn semant annot obtain result method small set select highli ambigu artifici word standard ml algorithm learn bayesian learn learn list neural network research softwar technic girona barcelona moonei compar experi restrict domain cite method includ tree rule induct algorithm good result obtain limit method suffer lack wide semant tag construct broad coverag system acquisit ng estim manual annot effort build broad coverag semant annot corpu extrem high overhead overhead commonli algorithm scale real size explain method question due recent work reduc acquisit cost method line research design effici sampl method lexic wordnet www search engin automat obtain internet accur arbitrarili larg word sampl algorithm estim statist model paramet belief bodi provid evid acquisit bottleneck futur worth investig applic ml method compar exist altern comment relat work direct comparison altern method commonli state naiv neural network learn repres accuraci comparison naiv base work moonei ng basic refer paper moonei paper show bayesian approach superior approach explicitli accuraci naiv point higher slightli accuraci classifi obtain algorithm appli classifi exampl standard ham distanc measur close weight attribut weight set number attribut paper compar naiv approach bl sophist learner design deal exampl symbol featur paper show larg number perform algorithm cross valid paramet pebl slightli outperform naiv note comparison carri limit weight facil provid pebl author suggest poor result obtain moonei work due metric test metric pebl superior standard ham distanc result ng paper accuraci result obtain higher report author year run algorithm larger richer set attribut appar paradox differ featur prune process perform older paper contradictori result obtain previou methodolog drawback comparison point ng appli algorithm corpu report accuraci result singl test provid statist test moonei perform rigor compar altern method limit domain consist singl word reduc set claim extrem specif domain reach reliabl rel perform altern method appli realist domain aim paper studi sourc differ approach order clarifi contradictori incomplet inform empir test altern algorithm extens tag order estim choic paper organ section describ algorithm notat section devot carefulli explain set section report set experi perform analysi result obtain altern method test broad coverag corpu section section conclud outlin direct futur work basic method naiv classifi classic set cm class set featur valu test naiv method find class maxim assum independ goal algorithm state arg max arg max estim train process rel frequenc avoid effect count estim condit probabl simpl smooth ng paper consist replac count number train exampl method refer nb approach basic implement exampl store memori classif base ham distanc measur close exampl greater result major nearest neighbour ti resolv favour frequent ti algorithm refer order test differ naiv variant basic algorithm ffl weight variant introduc simpl modif vote scheme nearest make contribut proport import classifi test set nearest neighbour vote class weight proport close test variant refer ffl attribut weight variant consist rank attribut relev make contribut distanc calcul weight proport import attribut weight distanc measur belong famili attribut select show perform altern experi tree induct po tag variant refer modif put result algorithm refer investig effect altern metric ffl modifi differ metric cost salzberg make grade guess match symbol valu valu attribut distanc defin jp fi fi fi fi fi fi number number train exampl vx attribut classifi class train corpu nx number train exampl vx attribut class variant refer algorithm facil version incorpor attribut weight discuss plan address futur work set corpu approach evalu semant annot corpu occurr noun verb frequent ambigu english word corpu collect ng colleagu linguist data consortium group word noun frequent literatur select word left tabl goal acquir classifi row repres classif problem number class rang number train exampl rang mf column tabl show percentag frequent accuraci naiv classifi obtain tabl set refer word attribut word po sen mf ag art car child church cost fall head interest line set speak work avg noun verb attribut set attribut refer context consecut word word disambigu attribut refer context ffl correspond colloc consecut word repres local context ambigu word proven inform featur note attribut refer posit fall boundari sentenc default assign attribut tag word cm unord set open class word sentenc consist full sentenc ambigu word tag set label minor wordnet ldc ffl enrich local incorpor broad context cm intend repres realist set attribut note attribut denot presenc absenc content word sentenc context tabl inform number featur note constant number attribut number depend concret rang experi comparison algorithm perform seri control experi train test set method methodolog consist rate figur paper averag result fold statist test perform cross valid pair student confid algorithm run time number nearest neighbour result choic report tabl show result method variant test refer set frequent naiv ham distanc approach metric includ result word print boldfac ffl method significantli outperform mf classifi ffl refer perform significantli confirm result ng valu greater order achiev good perform approach weight attribut weight significantli improv combin achiev addit improv ffl metric superior ham distanc accuraci eb significantli higher variant weight exampl lead improv case drawback metric comput overhead introduc calcul tabl show fifti time faster incorpor attribut except morpholog target word syntact relat order construct real system paramet estim train set insid involv test process gener prohibit overhead current program implement run sun machin ram tabl result algorithm set refer word accuraci word po mf nb eb eb eb eb eb eb eb eb ag art car child church cost fall head interest line set speak work avg noun verb ffl approach achiev result naiv algorithm differ statist compar eb eb nb aim experi test method realist larg set featur tabl summar result experi column result nb achiev accuraci previou approach show low perform accuraci drop point slightli problem binari attribut algorithm lead extrem vector observ exampl repres vector situat exampl coincid major valu attribut speak differ posit fact wrongli similar measur favour store exampl shortest sentenc situat explain poor result obtain algorithm moonei larg number attribut explain result ng system work rich attribut set contextu lower obtain simpler set attribut order address limit reduc attribut space binari attribut cm singl attribut close class word sentenc similar valu fw fw redefin jj equal number word share detail result word includ recal author attribut bad result absenc attribut weight attribut approach impli test classifi account inform word inform word effici refer posit test naiv algorithm combin condit probabl word test exampl variant refer result includ tabl drawn ffl approach reach excel improv point accuraci eb result obtain significantli outperform obtain indic addit richer attribut lead accur classifi behaviour variant similar observ except addit longer ffl algorithm accur nb ffl tabl show posit approach greatli effici algorithm factor nb calcul variant simpli feasibl ffl compar bayesian approach reach experi hold accuraci significantli higher tabl set word nb eb eb eb nb eb global result order ensur result obtain hold realist algorithm tabl result algorithm set refer word accuraci po mf nb eb noun verb test set attribut corpu exampl noun verb averag number averag number train exampl result obtain present tabl note result calcul due extrem larg comput effort requir algorithm tabl result obtain coher report tabl global result corpu accuraci po mf noun verb noun verb ffl approach metric significantli superior rest ffl approach ham distanc weight significantli outperform bayesian approach metric lead current implement prohibit ffl posit approach comput addit unord contextu attribut lead improv accuraci approach improv greatli effici loss accuraci work clarifi contradictori result obtain compar naiv approach altern algorithm test attribut set largest corpu experi carri show algorithm gener perform naiv extend richer report experi show approach sensit concret type frequent natur languag problem avoid altern attribut successfulli test improv effici larg set attribut test corpu estim realist tradeoff perform comput requir achiev posit base set ham research present algorithm carri futur studi behaviour respect number train studi robust presenc highli redund test algorithm altern corpora automat acquir web refer cost weight nearest neighbor algorithm learn symbol machin statist test compar classif learn neural duda pattern classif scene engelson manual annot cost train statist symbol approach learn natur languag riloff wermter lectur note artifici sampl word comput method disambigu word larg comput id special issu word state comput corpu statist wordnet relat comput lopez de attribut select measur tree machin approach base phd softwar technic automat method gener tag nation confer artifici intellig aaai paper special issu intern journal semant concord arpa human languag experi disambigu word illustr role bia machin confer empir method natur languag word recent confer empir method natur languag word ng multipl knowledg sourc disambigu word annual meet associ comput linguist pedersen lean disambigu nation confer artifici intellig aaai towel highli ambigu comput list lexic ambigu applic accent restor spanish annual meet associ comput pp la acl
IR/1281 5 learn label unlabel data graph blum chawla comput scienc carnegi mellon forb pa usa abstract applic domain suffer label train data learn larg amount unlabel exampl gather cheapli great deal work recent year unlabel data aid classif algorithm base find minimum cut relationship exampl order learn label unlabel data algorithm similar measur data construct output classif partit graph minim number similar pair exampl label give theoret justif provid experi synthet real dataset method robust label exampl introduct learn algorithm face lack suffici label data task classifi text web camera learn algorithm label train exampl larg number unlabel exampl readili document easi access larg classifi hand good deal work recent year unlabel data usefulli emploi order produc predict nigam bennett zhang method base graph vision literatur problem clean pixel imag roi snow initi noisi imag creat stereo goal improv imag minim energi function combin term pair neighbor pixel depth algorithm term number pixel chang origin imag algorithm chang insight energi function minim graph show method appli machin learn problem combin label unlabel data dataset label unlabel construct graph exampl minimum cut graph yield binari label unlabel data optim function approach inspir work kleinberg connect work vision gener classif set call label convert learn problem technic simpler sion set binari solv approxim focu construct graph develop algorithm solv graph problem kleinberg approach combin label unlabel high level idea method assign valu unlabel exampl order optim object function kind function optim limit depend relationship exampl make approach function graph give algorithm find true global optimum trade gener approach em appli confid find exact optimum natur question similar techniqu wu imag partit shi malik give sophist approach base normal cut est object function approach make provid result direct describ approach detail prove number theoret show method unlabel data substanti clear found tune approach approach robust random reduct imag snow kind algorithm set label exampl set unlabel exampl find label point minim error appli entir dataset notic optim problem natur style algorithm greedi local optim set graph find global polynomi time graph approach relat style rithm transduct svm relat standard svm goal assign label unlabel data make underli learn algorithm explor section nice featur algorithm effici find global optimum compar local optim algorithm object function result differ interest global optimum typic local optimum term object translat differ term predict accuraci object function model perform experi form point assum unlabel train data underli distribut test differ problem unlabel data view larg set test properti entir test set make predict standard approach criteria world optim graph isol pocket give criteria section fix learn hypothesi test data experi put unlabel train data test data run read label assign test point predict paper organ section describ graph algorithm section present theoret result motiv applic algorithm section synthet data dataset uci repositori section present graph learn algorithm describ graph learn algorithm introduc notat set label set unlabel exampl assum set binari classif posit denot set posit exampl denot set neg exampl algorithm construct weight graph edg weight call vertic classif vertic vertic classif vertic connect edg infinit weight label exampl label edg vertic assign weight base relationship specif choic edg weight discuss rest function assign weight edg node refer edg weight function determin minimum cut find minimum total weight set edg remov disconnect found algorithm edg weight treat capac remov edg cut partit graph set vertic call multipl minimum set algorithm smallest easi obtain assign posit label unlabel exampl set neg label unlabel exampl set motiv algorithm edg exampl similar high similar exampl vertex subset obtain conform basic learn algorithm nearest similar exampl classifi similarli motiv fact suggest weight edg notion exampl expect nearbi exampl eral label distanc featur natur weight function put edg nearbi edg exampl initi hand distanc function expect straightforward base featur valu feed label data auxiliari learn algorithm learn distanc function label data weight attribut base inform gain freedom scale weight edg base interpol put unlabel data similar foot label data ignor unlabel data complet choic edg weight function greatli influenc qualiti output algorithm motiv minim error approach reason motiv approach goal assign label unlabel data order maxim learn algorithm prove relat technic kind learn algorithm defin edg weight algorithm duce label unlabel data result cross valid error appli entir dataset learn algorithm defin edg weight algorithm label result cross valid error exampl held type learn algorithm handl style begin simpl result type basic neighbor algorithm theorem defin edg weight node pair node defin nearest neighbor binari label exampl cost cut equal number mistak made neighbor theorem impli minim cut correspond minim error fix binari label exampl error neighbor simpli number label label xs est neighbor order pair cut produc put posit exampl put neg exampl natur extend result neighbor oper knn problem replac oper averag defin averag knn algorithm examin nearest neighbor test dict fraction number posit exampl set view posit exampl label neg exampl bel set label exampl test defin averag algorithm predict label weight averag label exampl nearest exampl averag weight exampl function distanc theorem averag algorithm defin edg weight minimum cut yield label unlabel data label minim error proof order pair exampl defin weight classifi defin edg weight fix binari label unlabel exampl denot set posit exampl denot set neg exampl cost cut equal wy denot classif rithm error entir dataset norm label minim cut minim error algorithm repres achiev error unlabel exampl defin symmetr weight nearest neighbor weight nearest neighbor algorithm predict made weight major vote exampl weight symmetr weight predict weight predict weight base distanc exampl knn symmetr nearest neighbor nearest neighbor theorem weight function symmetr weight nearest neighbor algorithm function weight edg graph classif return graph result algorithm error proof directli lemma lemma boolean classif return graph dataset view posit neg proof graph divid set exampl posit set neg set solv minimum ue ue move strictli improv cut impli desir case make claim strict inequ defin smallest set minimum cut desir proof lemma discuss result state graph produc label unlabel data learn algorithm measur dataset assign label make data nice style algorithm fact point worri label exampl unlabel assign unlabel exampl class label posit label neg connect edg weight nearest label unlabel point neg cut minimum cut dataset distinct classifi unlabel data complet shi malik address problem context imag segment normal version algorithm attempt equal size partit find split approach encourag potenti problem graph number disconnect compon graph base unlabel exampl form compon algorithm free label compon label import weight function happen motiv gener model vision approach extens motiv model markov random field model assum point pick label determin probabilist cord distribut distribut probabl global label product unari higher probabl nearbi point label lower probabl label object function model make physic system model spin behav magnet pixel satisfi learn exampl doesnt address exampl similar exampl similar label model satisfi assum underli distribut exampl union uniqu label posit region neg region region separ minimum distanc pick randomli point insid union give region idea set edg weight weight region unlabel edg region grow stronger region region highli connect singl label insid region correctli classifi point insid make bit region live assum total volum defin region set point distanc boundari defin set point distanc point ball radiu region fraction volum connect analysi borrow nice proof idea tenenbaum al vr denot volum ball radiu unlabel exampl result essenti singl connect compon analyz region fill ball radiu center ball insid ball notic fill entir point insid greedili add ball center ball import unlabel point label edg graph shrink radii ball factor disjoint fact mean total number ball number unlabel exampl discuss model theorem nearest neighbor style algorithm perform pretti case region long label data exampl easili closer label exampl region result shown figur corrobor fact compar neighbor synthet dataset type section discuss ur theorem data gener random union distanc region classif point depend sole region belong weight function graph exampl unlabel exampl correctli classifi fraction unlabel exampl high probabl similar result achiev weight function drop sucient rapidli distanc proof ignor region probabl mass properti remain region label log label exampl sucient occur high probabl add label simplic leav gener assum region ax manifold ly higher space affect result analysi test graph algorithm standard real synthet dataset intend fit model section standard dataset compar algorithm standard learn dataset obtain uc irvin machin ing repositori algorithm freedom term edg weight defin order make experi clean weight function specif motiv analysi previou section learn algorithm compar connect unlabel edg weight nearest neighbor avoid late compon section forc label connect nearest label nearest exampl metric tabl classif accuraci graph algorithm dataset uci repositori mushroom monk problem dataset small amount train set result dataset bold case involv pick bold dataset es vote pima mi comput distanc point point closer connect edg paramet depend dataset maximum graph cut size largest connect compon graph half number datapoint correspond classif error perform algorithm benchmark measur perform variant dataset attribut notion distanc distanc dataset larg number cue defin distanc metric weight attribut base inform gain inform gain comput label data weight function constant specif choic constant affect algorithm simpli lead converg result variant shown tabl outperform algorithm dataset main except monk highli problem depend attempt algorithm automat learn experi reason comparison examin result graph select base algorithm form fail noisi dataset dataset techniqu perform observ size largest connect compon result graph idea techniqu dataset long distanc depend graph effect idea techniqu work presenc futur extens interest explor method find good figur classif error graph room dataset function alpha observ graph similar nearest neighbor style algorithm nearest neighbor base classif label graph account unlabel exampl treat similarli perform differ differenti treatment label unlabel scale edg weight unlabel exampl factor result regular give weight unlabel make algorithm resembl underli learn algorithm signifi confid unlabel exampl compar label exampl figur demonstr result experi mushroom dataset algorithm minimum classif error achiev figur classif error graph synthet dataset function number label exam number unlabel exampl figur classif error graph synthet dataset function number unlabel exam number label exampl nearest number unlabel exampl synthet dataset order studi properti graph approach test algorithm synthet dataset base region model section dataset region separ minimum distanc region plane yz locat region altern posit neg data gener uniformli random union region norm determin assign edg weight function distanc depend classif error graph neighbor label unlabel exampl shown figur figur plot perform fix number unlabel exampl amount label data vari perform substanti label gap shrink number label exampl algorithm perform equal label exampl figur fix number label exampl amount unlabel data unlabel data substanti improv result real graph achiev huge amount unlabel label data figur classif error graph iter synthet dataset function number unlabel exampl size test set instruct compar perform graph iter style experi involv independ iter randomli select data perform classif algorithm report valu ax mean iter minim object function find local global optimum natur iter approach begin random perform flip label long reduc cut reach label compar algorithm synthet dataset find perform iter algorithm perform extrem poorli describ method util unlabel data classif base graph cut essenc approach assign valu unlabel exampl optim consist neighbor similar exampl classifi make approach interest theoret point view optim perform polynomi time motiv approach measur error fairli natur model find graph algorithm perform compar learn algorithm unlabel label exampl underli freedom design function found comput weight function inform time learn simplest case set weight base singl paramet experi show gap rule advanc ecient add techniqu algorithm repertoir find approach robust interest ation method reduct real world dataset suggest approach conjunct learn learn algorithm give initi label unlabel algorithm label enforc kind global consist intend explor futur work compar perform algorithm transduct svm acknowledg john number discuss suggest research support part nsf grant refer support vector machin advanc neural inform process system mit press combin label unlabel data confer comput learn theori markov random field effici approxim ieee comput vision pattern recognit confer rel label unlabel sampl unknown mix paramet ieee transact inform introduct algorithm mit press exact maximum posteriori estim binari imag journal royal statist seri text categor label unlabel model approach nip workshop unlabel data learn approxim algorithm classif problem metric label markov random field annual symposium foundat comput scienc learn classifi text label unlabel document fifteenth nation confer artifici intellig aaai press induc featur random field ieee transact pattern analysi machin ss learn mixtur label unlabel exampl parametr side inform annual confer tional learn theori acm ny nonlinear reduct local linear formul stereo correspond problem intern enc comput vision approach model select normal cut imag tion proc ieee conf comput vision pattern nition exact voxel occup graph cut ieee confer comput vision pattern recognit de global framework nonlinear reduct uci repositori machin learn html optim graph theoret approach data theori applic imag segment ieee tran pattern analysi machin probabl analysi unlabel data classif problem seventeenth intern confer machin learn
DB/1282 3 widen po effici scalabl ground analysi logic program michael andi andi king pat hill depart mathemat comput pob school comput comput kent abstract domain posit boolean establish analysi variabl depend logic program base os binari diagram shown effici wide rang practic program independ assum np os analysi effici potenti behaviour paper simpl widen ground analysi logic program scalabl effici result widen induc small loss keyword logic abstract posit boolean widen introduct logic program boolean function express depend program variabl commonli class posit proposit formula subclass definit denot po def numer independ implement program base po def formula accur suit analysi logic concurr logic constraint logic program deduct applic type analysi involv reason ground depend context definit formula interpret describ program state ground exist ground depend ground varieti techniqu maintain manipul class proposit formula program worth mention binari diagram reduc order binari diagram lead fast po dual blake canon form def set possibl atom alphabet falseg repres truth tabl formula domain oper support techniqu implement approach easili implement prolog techniqu sophist give reason perform sophist techniqu simplic implement iter effici number iter analysi requir iter po def number iter exponenti ariti predic oper encount iter analysi base proposit formula comput comput project formula existenti renam variabl formula iter analysi involv test determin fix point reach po def problem section put exponenti size test exponenti time whilst empir evalu result po def present suggest base po def effici hard evid robust effici program techniqu perform predic high ariti extend definit grammar pragmat problem cautiou compil vendor adopt analysi good perform scalabl paper studi problem widen po challeng widen tune analysi analysi applic practic compil applic requir call pattern inform focu primarili analysi logic program set possibl atom alphabet falseg repres truth tabl formula size grow widen appli restrain growth result suffici adopt simpl singl atom repres formula call answer pattern formula linear space number iter analysi linear size program approach lead fast analysi scale smoothli class formula widen import pragmat result express accommod backward flow ground inform program class formula import result loss wide class benchmark program rest paper structur section recal ground analysi base po section review scalabl issu po section introduc widen section section review relat section discuss direct futur final section present conclud remark direct research ground analysi base po posit boolean function follow convent identifi truth assign set variabl map true introduc map fm nm fx yg fx set posit boolean function denot recal boolean function posit complet lattic po order set boolean function true bottom top element chain class boolean function sequenc ae abstract constraint boolean function abstract domain formal defin relationship concret typic herbrand boolean function repres boolean function interpret describ ground formula express program variabl bound ground term formula express fact bound ground term eventu bind ground term propag vice versa interest reader find addit detail abstract program boolean function recal briefli implement techniqu ground depend logic program abstract concret semant abstract program correspond requir ground analysi figur illustr prolog program rotat element list abstract ground depend atom specifi formula intend interpret ground unif form jz concret program replac atom unif form concret program simpli replac specifi bound ground term paper suffici understand problem analyz concret program left part figur reduc problem appli concret evalu abstract program addit detail refer concret rotat abstract rotat auxiliari predic xs ys zs xs zs fig concret abstract program simpl interpret analysi figur illustr simpl prolog interpret naiv evalu logic program repres fact form user interpret divid conceptu compon predic loop algorithm user prove bodi fact deriv call predic cond assert head fact subsum fact deriv predic introduc abstract solv builtin control predic invok iter oper fact deriv fact assert prolog flag flag iter termin fail indic fact assert previou iter evalu initi queri iter leav result evalu prolog appli interpret figur abstract rotat program figur interpret repres proposit formula atom illustr goal independ analysi goal depend support appli magic set similar techniqu interpret basi effici implement base strongli connect techniqu detail iter oper fail iter cond cond cond oper user cond fig prolog interpret evalu scale problem analysi interpret depict figur stem formula set evalu strategi base bodi fact deriv call call ground atom repres proposit formula call advantag singl atom repres ground atom singl atom repres ground atom number atom requir repres arbitrari posit proposit formula remain exponenti sophist implement techniqu perform larg program simpl approach function po def complet mean test worst exponenti size np size import impact comput join project variabl renam variabl polynomi size obtain boolean function method worst case size grow exponenti number variabl addit longest chain lattic exponenti mean number iter requir comput fixpoint analysi base po exponenti analysi base po formula restrict limit maxim number iter comput desir widen po section simpl approach restrain size proposit formula encount program analysi kei idea restrict number disjunct disjunct normal form formula case nonground atom repres dnf formula program predic simpl carri analysi atom deriv atom chosen replac specif atom subsum approxim view widen po primarili interest reduc complex po order obtain fast scalabl focu case atom repres po formula amount specif subsum atom exist atom restrict interest posit note impli singl atom repres formula involv constant true variabl class formula repres formula involv symbol nest atom repres atom pair formula po similar domain denot con formula conjunct variabl con formula repres atom argument express enabl simpl depend inform repres richer con share import properti longest chain linear length bound number iter occur analysi lemma set variabl longest chain lattic length proof tupl ariti repres formula number model number distinct variabl bound chain formula longest chain length theorem number iter requir obtain fixpoint analysi base domain linear size program proof program predic pm ariti nm observ number iter analysi deriv success pattern bound number iter analysi deriv call answer pattern bound test formula boil simpl varianc check complet show oper complex lemma test formula proof test formula repres tupl test amount check argument ground argument tupl argument ht ht check true iff true iff step complex step complex result implement basic widen scheme import note suit improv perform evalu strategi figur show interpret figur modifi analysi time atom deriv specif subsum exist atom found fig cond assert predic determinist widen scheme notic solut time user multipl solut deriv solv due atom occur bodi abstract program note atom specifi formula po formula repres set atom atom deriv process find formula approxim atom deriv order assert atom deriv atom assert overcom problem repeatedli check assert retract make observ abstract head bodi includ variabl list xs solv call contribut truth widen subsequ replac valu variabl singl atom repres formula head detect call iff remain refrain solv call solv determinist true iff predic bodi solv determinist iter account solv predic determinist put perform local fixpoint termin iff predic determinist reduc approach introduc addit approxim iff predic reduc appli scheme entir evalu fulli determinist call analysi appli evalu method implement result experi base code prolog induc eager evalu perform effici evalu induc magic implement techniqu avoid magic bodi affect similar obtain supplementari magic avoid maintain partial solut bodi overhead reduc partial solut maintain implicitli underli prolog implement techniqu implement simpl evalu transform depend call answer express directli interpret eager evalu approach iter strategi obtain atom deriv procedur invok ensur atom bodi reevalu contrast mean overhead requir distinguish atom eager evalu involv slightli strategi eager evalu faster due simplifi preprocess time reduc magic set transform strongli connect compon comput eager evalu perform tabl analysi time con po con po experi perform compar argu time po invest lot effort po techniqu fixpoint column give comput fixpoint total factor overhead po overhead call pattern predic singl call atom po ground inform made explicit column give total number ground argument call answer pattern analysi time fixpoint comput minut tabl order respect number predic defin program code sicstu experi perform processor mhz sparc ultra mbyte memori run solari tabl statist benchmark program standard except aircraft air traffic verif system sim simul ga tsp genet algorithm travel salesman program uppsala chosen abstract queri queri suggest annot previou suppli programm column pred list number predic program chain length maximum chain lattic benchmark suit analysi result file fixpoint total con po con po con po append rev dnf queen serial meta life gabriel tsp boyer ga tr cs neural reduc read asm semi sim ann press simpl analyz chat parser aircraft result wide rang program virtual loss ground inform po analysi substitut analysi program small due fact iff predic remain result small respect simplifi po con disastr impact interest fixpoint time frequent domin preprocess file pred chain file pred chain aircraft ann append asm boyer chat parser cs dnf ga gabriel life meta neural parser press queen read reduc rev semi serial sim simpl analyz tr tsp analysi term number ground argument rel po dramat tradeoff conclud analysi time absolut analysi exce fixpoint engin prolog base achiev fine tradeoff po prolog sophist bdd appli program analysi benchmark rel po respect number ground argument benchmark ground argument cs read lost ground argument program tr termin minut po termin ground widen analysi relat work normal form boolean function rel po def investig implement base po conclud give fastest analysi def dual blake canon form found fastest larg test time faster conclud scale larg program achiev po found significantli higher def remark improv def analysi time implement po base report china tr domain magic captur separ call pattern call site mhz pentium ii pc benchmark vari time fast larg proport slow stem pattern compon framework consid analysi clp explain domain def repres term domain local variabl set herbrand constraint repres fhx hy hz encod abstract conjunct express term rewrit rule put conjunct formula normal form normal form essenti reduc monoton bodi form definit function repres monoton point iter po analysi requir solut problem consid complex implic bound number call answer pattern discuss increment refin semant base program show analysi increment full po loss cost perform po analysi scratch fact larger benchmark total cost phase analysi increment perform origin phase po analysi similar constraint propag gener algorithm arbitrari constraint domain success step approxim avoid answer propag constraint futur work futur work focu benchmark constraint program investig adapt appli widen sophist po formula adapt widen analysi forward mix po strategi switch number call answer pattern begin grow larg problem detect moment chang mode evalu present widen po base restrict size dnf po formula shown rel complex base significantli reduc compar po def experi domain basi scalabl logic program loss compar po analysi implement straightforwardli prolog made obtain analysi exhibit exponenti behaviour sophist present paper acknowledg florenc discuss implement work partli fund grant brian work carri andi visit refer boolean function depend algebra properti effici static analysi page lnc long version scienc comput program reactiv implement po program logic page lnc analysi constraint languag phd dipartimento di march person commun tr april baker definit analysi australian comput scienc page beeri ramakrishnan power magic logic effici goal direct evalu logic program technic demoen logic program logic program magic wand logic le effici abstract interpret prolog mean constraint solv finit domain program languag implement logic page lnc optim ground analysi proposit logic logic compar connect widen approach abstract interpret program languag implement logic page lnc dart deriv depend connect logic warren practic program analysi gener logic program system case studi program languag design page acm complex analysi logic program languag page lnc person commun larg ariti predic novemb garcia de la global analysi constraint logic program acm increment refin semant base program analysi technic le provost wallac gener constraint clp scheme logic marriott effici ground analysi logic program acm lett program lang ramakrishnan magic approach logic program logic van le evalu domain prop logic memo evalu transform intern workshop logic program synthesi page lnc articl process macro packag llnc style
Agents/1283 1 formal system mark dinverno michael fisher lomuscio michael luck de rijk mark ryan michael wooldridg school comput uk depart manchest metropolitan uk school comput uk depart comput uk agent system uk introduct comput goal motiv desir improv comput system make easier design robust prone easier field goal build system capabl flexibl autonom societi system cooper lot formal theori area obviou theori repres role theori intend plai theori agent abstract relat concret comput model formal tempor logic logic distanc agent implement formal convinc attempt explain claim theori express formal agent oblig establish clear link formal real agent applic panel concern fundament issu relat formal descript develop system role formal theori role formal theori plai agent specif formal common familiar formal logic ai primarili formal philosophi mathemat logic thing common reason reason knowledg knowledg basi program work hintikka good usag exampl logic knowledg basic idea wide attribut john mccarthi idea logic basi program exemplifi prolog languag split larg continu work agent strand work cohen huge influenti theori intent act catalyst relat bdi theori rao georgeff logic report result panel discuss uk workshop foundat system member panel list alphabet knowledg direct manipul agent exemplifi work konolig formal model logic program languag evidenc work fisher concurr metatem strand work claim measur success common fail formal work ai role clear formal agent theori agent provid descript constraint agent understand term mainstream softwar provid base implement verifi agent system agent natur step softwar repres fundament complex distribut societi cooper autonom compon aim build principl techniqu requir design implement aim assist develop system provid formal notat desir behaviour agent requir move principl specif system implement properti identifi formal serv measur evalu implement agent system properti deal aspect knowledg properti approxim basi comparison implement overrid develop formal theori guid practic applic agent agent theori formal agent type make agent type differ manifest formal repres exist formal reason agent model orient process algebra program tempor extra featur agent formal ffl provid unambigu languag system compon ffl address practic applic capabl express aspect agenc limit ffl identifi properti agent system implement measur ffl studi implement formal possess provid emphasi reason reactiv system situat environ maintain ongo interact tempor logic proven formal logic describ aspect agent system includ logic knowledg belief describ agent inform state logic goal intent describ agent reason agent term compon impli relat theori express term concret implement agent major shortcom theori link theori agent implement agent inform intuit shoham program introduc logic intend reason program languag program agent logic program languag clear logic intend semant program link made give logic semant agent program framework give logic semant standard program languag complet coher theori agent system relat issu unifi theori approach subset aspect make progress pursuit ultim goal theori formal system add dimens system formal extend extra featur system formal system deal ffl multipl ffl group properti agent common knowledg joint ffl interact commun cooper formal expand direct handl multipl agent logic good tool studi multipl agent interact deal group properti flow time logic emerg attempt deal aspect agenc address agent linder fagin krau logic address kei problem formal implement formal emerg behaviour exhibit system easili lend formal analysi reason local interact agent current formal reason agent impact whatsoev develop field view featur current approach make distinct import agent research fundament issu drive view emerg construct techniqu reason system hold make exist formal techniqu case develop formal system avoid undesir logic formal de rijk argu special tool formal agent theori objectori specif tool addit usual requir express tool obviou aspect modular mean interact featur uniqu claim panel distinct approach ffl adopt formal specif tradit softwar engin provid specif strict softwar engin express regard mental attitud agent tempor aspect ffl execut logic specif directli execut limit express capabl logic balanc absenc refin process ffl modal logic express mean defin relationship mental attitud desir doubt refin comput complex refin strategi model specif exist softwar engin techniqu formal provid easiest access formal limit lack express regard mental attitud tempor effect specif languag adopt dinverno luck mean construct formal agent framework distinct aspect agent system benefit unambigu defin common concept term readabl suffici express unifi structur account comput system enabl altern design agent model system explicitli compar evalu foundat develop increasingli refin concept schema schema facilit descript system level system complex ad success lower level agent develop level abstract suitabl framework dinverno luck develop model provid social relationship agent provid account autonom interact appli model exist system mean evalu comparison framework serv environ develop softwar design methodolog critic level inappropri model interact agent address model interact perspect singl agent altern formal csp defin structur commun protocol csp prove properti relat structur protocol absenc state agent messag stanc benefici context motiv kei determin formal techniqu abil switch formal import emerg complex technolog system view system engin jackson requir formal method chosen paradigm import issu defin consist constraint paradigm model singl unifi framework dinverno luck argu platform move modal tempor tempor logic fisher wooldridg advoc approach combin tempor logic repres dynam aspect formal repres state agent emphasi work give concret interpret term actual implement agent goal research develop formal method system mathemat ground techniqu verifi system logic modal tempor logic form theoret basi techniqu techniqu manipul combin tempor cognit notion develop proof method combin tempor logic knowledg belief produc execut method logic investig aspect give logic semant agent program state concurr execut tempor fisher wooldridg address subject research effort detail found report panel methodolog combin logic build logic scratch address aspect de lomuscio ryan studi exist logic deal individu aspect combin field combin logic emerg activ power result preserv import properti logic combin de problem combin logic logic combin singl logic extend express power address tempor aspect agent address epistem aspect combin express tempor epistem interact evolv knowledg chang world fusion fusion bimod logic show properti compon logic transfer finit model interpol finger gabbai describ techniqu logic insid origin specif tempor techniqu logic asymmetr talk properti symmetr combin provid gabbai techniqu formula combin logic mix oper compon logic semant defin back model compon logic techniqu literatur lomuscio ryan techniqu worth explor potenti tool build logic system system theori aim build formal model agenc basic logic studi interplai compon combin de skeptic potenti current technolog produc posit result combin logic interact concept involv knowledg gener agreement role formal plai healthi approach fulfil role mainstream comput aim build effect effici comput theori justifi refer formal method reason system agent system develop formal attempt adapt exist formal rang activ area larg span consensu opinion approach strong effort made resist develop sophist unnecessari formal crucial ensur research area guid impact field system refer fisher gabbai owen imper principl execut tempor logic research studi press de forthcom combin studia logica philip cohen hector choic artifici dinverno contract net goal direct van de veld agent break seventh european workshop model autonom agent multi agent lectur note artifici springer verlag dinverno autonom ecai european confer artifici john wilei son reason knowledg mit cambridg introduct execut tempor knowledg engin fisher wooldridg proof method tempor logic knowledg gabbai intern confer formal appli practic lectur note comput fisher formal method duke northern formal method electron workshop fisher formal specif verif intern journal cooper inform finger tempor dimens journal languag semant weav part modal intuitionist journal symbol halpern guid complet complex modal logic knowledg artifici knowledg belief cornel press independ bimod journal symbol krau theoret comput luck formal framework agenc intern confer aaai press mit press luck cooper motiv agent distribut artifici intellig australian dai lectur note artifici springer verlag agent theori agent case intellig agent iii intern workshop agent lectur note artifici rao ration agent intern confer principl knowledg morgan kaufmann research depart instituto superior portug van van der ch motiv agent work note formal model portug social eleventh european confer artifici logic bdi plan work note formal model portug oper specif ieee transact softwar
DB/1284 3 data mine intellig web cach francesco giusepp decemb abstract paper present vertic applic data wareh data mine intellig web cach introduc wai construct intellig web cach algorithm emploi predict model web gener idea extend lru polici web proxi server make web access model extract web log data data mine techniqu approach studi base associ rule base tree result algorithm show substanti improv exist cach term hit fraction web document directli retriev cach design develop prototyp support data wareh web log extract data mine model simul web cach architectur integr phase knowledg discoveri process system support systemat evalu benchmark algorithm respect exist cach strategi introduct data mine aim discov regular pattern hidden emerg area web mine aim discov regular pattern structur content web web resourc access paper describ mine applic base data develop intellig web cach capabl adapt behavior basi access pattern usag extract histor access data record log mean data mine techniqu idea extend lru recent cach replac polici adopt web proxi server make web access extract web log data introduc wai construct intellig web cach algorithm emploi predict model web request goal algorithm maxim hit percentag request web entiti retriev directli request back origin server compar altern variat lru cach present brie discuss approach uniqu adapt usag natur web due fact cach strategi parametr wrt data mine recomput period order track recent past nal step knowledg discoveri design refer web cach model mean evalu model extract data mine emul parametr replac support evalu comparison replac hit rate log data acquisit model extract evalu web cach formal implement manag microsoft sql server dt technolog data transform servic intellig web cach web cach recogn deploi cach world wide web improv net trac wai reduc bandwidth network latenc perceiv client server load improv network reliabl perceiv case temporari unavail network connect server local cach temporarili replac server web pose issu risk reduc dynam object secur legal issu evalu measur techniqu order evalu qualiti web cach measur depend resourc bottleneck system commonli criteria basic hit ratio request ful lled handl web weight hit ratio byte serv client time wait retriev resourc common work evalu cach strategi simul set collect log server result present term hit rate tradit cach strategi cach algorithm develop replac strategi criteria follow select object evict cach full present refer rest lru order object access remov rst older sort object product number request receiv access remov rst entiti higher strategi call modi cation weight entiti number request receiv access object strategi simul histor refer model intellig cach tradit cach strategi model entiti cach belong prioriti queue cach replac strategi coincid prioriti queue weight assign polici call polici exploit knowledg extract past request weight assign polici xed boil tradit cach de nition conserv gener model intellig cach strategi report figur initi data mine model built past data cycl repeat forev request entiti cach entiti fresh entiti return client case consid hit byte back client count weight hit rate weight entiti possibl weight element updat weight assign polici express long hit retriev loop forev hit figur intellig cach refer model entiti cach miss entiti delet cach fresh version retriev push cach push method consist assign weight entiti updat weight element cach make cach maximum entiti pop cach weight data mine model period updat condit xed time interv cach perform model updat method data mart web log data avail data serv multipl provid consist reliabl repositori data long period time data mart subset data speci group data mine analysi develop data mart web log support intellig cach strategi data mart popul start web log data raw server log le assum basic eld data mart popul consist number preprocess code step perform data clean transform data mart popul comput addit deriv eld transact input data mine algorithm data mart implement relat microsoft sql server beta process popul data mart formal autom sql server framework process data prepar data mart popul design sql server data transform servic tool import export transform process data text applic process concern main url eld hash code deal string easier ecient approxim size entiti origin comput time distanc request comput user session call refer length approach deploi refer model data mart data section instanti gener intellig cach model rst base associ base tree introduct gener mine task descript applic cach summari result eventu overview data mine model process associ rule set de ne associ rule express form set support de ned rate transact item item con denc de ned ratio rate transact probabilist approxim probabl item rule approxim probabl item item minimum threshold speci ed support con order signi rule applic domain item correspond web transact correspond user session rule inform mean user expect possibl order consecut approach lru criteria assign strategi extend modifi prioriti entiti cach reaction incom request set associ rule extract train obtain past log data time url set rule predict url request suggest evict accomplish assign prioriti request immedi move top queue workload split dai train set dai valid rst dai log data extract associ rule user minimum support minimum con denc threshold equal result extend lru strategi simul dai log data figur show result obtain simul lru cach extend lru perform plot di erent size simul mbyte mbyte web server exponenti growth cach size ass rule lru hit rate cach size lru figur hit rate wrt cach size strategi curv similar converg cach size grow graph reveal signi hit improv approach standard lru cach rang absolut gain smallest rest absolut gain absolut improv stand di erenc largest tree tree induct concern construct model classi er describ discret call entiti term attribut call observ attribut featur model construct set object train class valu predict unknown class object set central idea section approxim present section strategi access distanc distanc request url classi er train url request predict distanc chosen class continu discret valu set discret valu observ attribut build classi er cach transact time tree data mine model intellig cach system order assign weight entiti popular classi cation algorithm tree classi cation model analysi experi ecient implement tree algorithm gener strategi section instanti make choic observ discret access distanc weight assign rst choic concern select set observ attribut construct time url request strategi call restrict basic size request directori depth request hour part date continu le extens main directori request url discret attribut discret access distanc decid number class discret valu interv experi discret class intuit approxim adopt weight assign function correct lru weight ad displac relat prioriti request displac form access proport function associ base lru extens tree classi er built dai train set extract perform strategi comput simul dai valid set perform strategi lru compar term hit rate figur hit rate exhibit impress improv wrt consist absolut improv simul achiev gain lru consist gain lru theoret strategi achiev hit rate outperform tradit report lack space present approach enhanc web cach data mine model built histor aim hit rate design suitabl data mart main problem design solv approach di er kind data mine model associ rule tree hit absolut gain hit rate perform gure develop compar lru side theoret strategi substanti hit strategi outperform xed strategi combin orthogon enhanc achiev extens benchmark strong indic data cach yield systemat enhanc hit weight hit due adapt recent adapt reason make approach prefer xed cach strategi direct research complet benchmark phase log data web proxi data arti cial combin approach investig metric strategi start approach base cluster refer agraw srikant fast algorithm mine associ rule larg twentieth intern confer larg page srivastava group web page refer transact mine world wide web pattern proc ieee knowledg data engin exchang workshop novemb etzioni gold commun han data concept techniqu morgan san blockeel web mine survei acm sigkdd ts wy ys shih comparison predict train time classi cation algorithm machin learn microsoft corpor microsoft sql server quinlan program machin learn morgan san ecient ieee tran knowledg data
ML/1285 6 concept space hypothesi space learn algorithm griffith bridg depart comput york uk abstract order learn behaviour reason learn simpl learner pac learn algorithm show oei rich express boolean function defin famili simpl learn algorithm fix similar measur give suffici condit consist learn algorithm term chosen similar measur simpl train target concept restrict concept output chosen concept space case studi investig relationship concept space hypothesi space conclud algorithm studi optim learn algorithm concept space introduct perform reason system chang time case ad case base process prudent knowledg engin perform necessarili quickli perform system exemplar requir reach specif level accuraci problem solv simpl model case memori system present basi answer question analyt model function knowledg content case memori system model map input output domain analysi appli model worst case appli pac learn framework learn number restrict made order gain leverag problem hand focu learn behaviour model abstract aspect reason system interest context interact detail reason process conceptu implement level knowledg issu choic abstract indic paper classifi task decid input descript instanc concept definit model classifi oper space binari vector space current work refer dn stand bit vector ffl dn set total function defin domain denot bn hypothesi space refer set output learn algorithm train sampl term concept space hand refer specif subset bn target concept learn algorithm drawn section consid set function concept space learn algorithm express combin liter chosen replac set fu chosen liter negat ad classif function express interpret conjunct ae ffl ffl function function dn decid conjunct bit space function refer mn defin set liter learn algorithm work jantk case memori system model pair oei cb set store assum free observ oe similar measur defin space dn terminolog model model set pair descript vector space dn report singl bit denot classif make cb object cb similar measur oe function pair descript return real indic similar oe dn pair oei treat function bn interpret relat semant classifi jantk lang function repres oei defin ae po ffl cb neg ffl cb po neg point dn posit classifi store posit exemplar po strictli similar chosen similar measur oe store neg exemplar neg relat semant discuss jantk interpret resolv equal similar neighbour prefer order part retriev case neg exemplar prefer posit infer classif problem set exemplar similar posit neg classifi neg interpret oei depend interact case similar learn algorithm alter hypothesi manipul compon algorithm pebl show wai adjust repres hypothesi similar measur current restrict studi famili simpl learn algorithm definit learn algorithm classifi set cb set cb cb set learn ad member train sampl seri exampl case construct hypothesi fix similar measur oe depend choic similar measur assign high similar arbitrari pair descript defin viabl learn algorithm understood learn algorithm classifi correctli exemplar train sampl section demonstr choic similar measur behav consist consist theorem suffici condit oe make consist consist learn algorithm result lemma lemma intuit similar measur object similar suffici consist properti call dai faith definit definit similar measur similar measur oe definit iff comparison distinct object yield score strictli score comparison object dn properti ensur consist hypothesi exemplar case base judg strictli similar exemplar classifi correctli equat definit condit consist exemplar case base classifi correctli long similar object posit exemplar posit exemplar similar object neg exemplar neg distinct object assign maxim similar classifi relev classif function inform condit wess globig express framework definit predict prove suffici condit oe make consist learn algorithm definit predict similar measur respect concept space similar measur predict concept space concept ffl posit instanc comparison yield score larg comparison posit instanc ffl ffl dn neg instanc comparison yield score strictli greater comparison neg instanc ffl ffl dn note relat equat properti definit relax misclassif occur chosen classif function asymmetri equat reflect prefer neg exemplar classif function semant entail slightli form theorem theorem consist concept space bn consist learn algorithm chosen similar measur oe predict proof infer hypothesi train sampl target concept definit label exampl present train absenc observ error assum ffl cb ffl assum oe predict concept space posit neg exemplar case base neg exemplar neg ffl neg equat ffl dn neg ffl cb neg conclud neg ffl cb neg equat similar deriv equat po ffl cb po equat arbitrari train make consist learn algorithm necess shown similar measur oe violat equat target concept concept space train sampl construct consist requir similar measur satisfi equat equat descriptor target concept oe oe train sampl case base cb construct note equat neg exemplar similar train sampl similar assum equat train sampl result hypothesi consist learn algorithm concept space oe predict ut close relationship definit definit mean addit result easili corollari consist learn algorithm space bn total function dn oe definit similar measur state corollari similar measur oe predict concept space target concept ffl cb st proof oe st oe predict ffl train sampl exemplar point space dn theorem output consist function output ut final observ basic result pac framework learn algorithm consist respect concept space learn finit hypothesi space algorithm concept space number distinct boolean function defin dn hypothesi space finit similar measur predict concept space bn suffici make pac learn algorithm result classifi concept defin attribut pac learnabl answer origin question perform consist reason system eventu improv exemplar present interest exampl process good hypothesi sampl complex learn sampl complex learn algorithm respect concept space defin pac learn framework size train sampl level confid hypothesi chosen learn algorithm good target concept chosen concept space theorem upper bound sampl complex term vc dimens hypothesi space algorithm vc dimens space function quantiti relat size function defin size largest sampl space dichotomi posit neg exampl gener function set note relationship theorem result previou section refer specif consist learn algorithm theorem theorem hypothesi space finit vc dimens consist learn algorithm hypothesi space pac sampl ml ffl log ffl ffl log ffi ffi ffl requir level confid constant give upper bound sampl theorem show size train sampl process consist learn algorithm necessarili output good hypothesi high probabl vc dimens assum vc dimens sampl complex learn algorithm strictli depend specif properti learn algorithm hypothesi hold larger hypothesi train exampl learner order discrimin hypothesi accur high probabl requir hypothesi space learner hypothesi space respect concept space refer simplic mean target concept cb reachabl learn algorithm state hypothesi space proposit function member hypothesi space respect concept space bn target concept ffl case base cb st bn ffl bn ffl ffl corollari proposit ffl hyp hyp fh tg statement show hypothesi space depend choic similar measur concept space smaller concept restrict target concept train restrict number function bn output uncommon case base cb extens target concept ffl interpret equat function concept space gener hypothesi space necessarili function ffl bn function chosen concept space contribut remaind paper establish lower bound vc dimens hypothesi space instanc oe set function concept space featur count oe defin equat similar measur oe proposit report result partli space function corollari result term vc dimens give lower bound definit proof omit preliminari proposit corollari definit extrapol function extrapol function ffl mn function ffl ffl ffl proposit union extrapol function ffl mn equal class function ffl mn definit project descript project descript construct extend descript singl bit ffl dn ffl ffl proj definit project project construct ad set descript exemplar ffl cb ffl proj ig proposit function ffl defin function ffl mn defin dn conclud function repres express shown descript ffl dn return project ffl ffl mn ffl dn ffl ffl proj proposit case base cb posit function ffl st cb larger st ffl cb ffl po dn po ffl ffl cb ffl cb result proposit effect hypothesi space learn algorithm defin respect featur count similar measur oe set function set function mn defin dn mn proof induct proposit show requir result requir ffl mn concept ffl case base cb suffici show defin introduc extra restrict case base singl posit exemplar refer proposit subsequ ffl mn ffl po dn po ffl base case fu fu gg fg induct step make induct hypothesi ffl ffl proposit suffici infer equat function ffl extrapol member hypothesi space respect valu proposit turn show suffici deriv induct hypothesi ffl ffl cb posit exemplar repres entail result valu shown equat entail ffl function case base cb cb cb ffl ffl ffl ffl ffl ffl function ffl equat assert case base cb st ffl cb shown defin term cb satisfi equat shown project cb project singl posit exemplar shown function defin dn function repres project cb classifi project posit iff ffl ffl bn ffl dn ffl proj hp assum ffl dn project posit exemplar cb satisfi equat ffl dn oe oe project ffl proj project ffl proj ffl proj fl stand number bit fl stand number bit extend bit bit extend fl fl fl fl ffi ffl oe oe po project neg ffl po ffl neg ffl oe po oe neg hp ffl similarli hp shown function project cb repres function defin classifi project posit iff proposit hp hp remain show ffl uniqu ffl proj ffl cb cb ffl cb bit ffl refer bit ffl conclud shown case base defin po po po descript uniqu posit exemplar inherit smallest st ffl ffl target function ffl equat hp hp oe po oe definit oe po oe iff po strict major bit fu note po po ffl definit bit irrelev comparison common po oe po oe po substitut hp impli po singl posit satisfi equat shown note fail satisfi ffl case base defin fu ut corollari lower bound vc dimens vc dimens effect hypothesi space respect concept space proof mn sampl mn vc dimens mn ut contrast corollari note proposit upper bound vc dimens vc dimens greater log proof sampl size order set exampl subset ffl function ffl classifi posit subset label distinct member log ut vc dimens hypothesi space respect set function vc dimens theorem lead qualit reflect presenc number spuriou function hypothesi space optim learn algorithm respect sampl space expect number exampl reach accur hypothesi rapidli number learn algorithm hypothesi space repres function note proposit partial hypothesi space instanc addit formal direct establish presenc function addit show fraction bn output train sampl function jh vari valu gener learn algorithm rich hypothesi languag fix predict similar measur oe corollari oe total function dn addit explor natur hypothesi space output train sampl function specif concept space shown hypothesi space respect concept space includ function mn argument relat theorem lead addit presenc spuriou make ineffici learn algorithm respect sampl compar consist learn algorithm repres function suggest natur corollari gener wess globig point demonstr measur modifi bia prior knowledg concept space similar measur manipul output learner close target concept strategi demonstr improv effici respect sampl size perform degrad chosen concept space sophist learn algorithm outperform simpl algorithm result bia learn algorithm target concept algorithm test present attent hypothesi space learner provid tool rigor comparison learn algorithm form bia embodi work remain carri comparison extend possibl observ error case case base acknowledg author fund epsrc grant receiv addit support case award scheme logica cambridg author robert lead comput learn theori refer albert learn algorithm machin albert aha learn algorithm ninth nation confer artifici page anthoni comput learn theori cambridg warmuth learnabl dimens journal oct cost salzberg weight nearest neighbour algorithm learn symbol featur machin mar dai faith model partial order compar object measur harrison engin case memori system submit journal intellig inform system globig wess symbol learn classif annual confer gesellschaft fur ev march haussler quantifi induct ai learn algorithm valiant learn framework artifici haussler approxim correct learn nation confer artifici page american associ artifici jantk learn induct infer report fb mathematik jantk lang learn pattern languag work note european workshop volum page waltz reason darpa reason workshop page morgan turnei theoret error vote learn technic report knowledg system institut inform nation research council wess globig symbol classif algorithm case studi version space topic select paper lnc vol page articl process macro packag llnc style
Agents/1286 1 bibliographi michel bp cedex franc technic report motiv year collect refer relat detect detect major concern involv comput network thought time publish refer document date undoubtedli forgotten import ignor error remain citat send note error omiss updat document yearli basi order correspond raid made attempt classifi annot refer futur hope bibliographi bibliographi polici languag author technic report zurich research ibm research benchmark distribut detect system base preliminari result extend abstract present framework learn model data mine network technic report rc ibm watson research center framework learn model data mine network siam intern confer data mine activ descript evalu system technic report ibm zurich research laboratori activ descript evalu system intern workshop recent advanc detect number page activ descript evalu system extend abstract present adventur anomali detect corp detect method detect attempt secur breach pdf state practic detect technolog technic report softwar engin carnegi mellon design implement lightweight tool detect web server attack technic report ibm zurich research laboratori lightweight tool detect web server attack year network distribut system secur symposium data collect secur monitor fourth intern symposium recent advanc detect number page surviv inform warfar attack ieee symposium secur privaci detect book select criteria detect system annual comput secur applic confer safeguard final detect unusu program behavior statist compon technic sri safeguard final report detect unusu program behavior statist compon technic comput scienc sri intern comput secur threat monitor surveil technic jame anderson fort pennsylvania inform retriev techniqu detect web intern workshop recent advanc detect packet secur storag network data usenix workshop detect network monitor ad avail log servic untrust machin annual comput secur applic confer method trace intrud mobil agent annual confer internet societi detect method base discrimin analysi ieic transact inform detect rout trace mobil agent confer intellig agent technolog implement detect agent system annual confer comput secur incid handl local attack detect rout trace ieic transact mobil agent analyz comput network workshop mobil object system ecoop taxonomi secur fault unix oper system master purdu integr detect network manag hp associ workshop detect web intern workshop recent advanc detect research system survei technic report depart comput chalmer sweden implic detect acm confer comput commun page preliminari attempt appli detect estim theori detect technic report dept comput chalmer technolog aspect model perform detect technic report depart comput chalmer technolog detect taxonomi survei technic report dept comput chalmer technolog approach unix secur log nation inform system secur confer introduct detect assess complex event detect monitor system technic report microelectron comput technolog corpor develop common vulner exposur web intern workshop recent advanc detect architectur detect autonom agent technic report coast laboratori purdu detect network estim siam intern confer data mine plan secur manag workshop ai distribut inform network distribut detect system command control research technolog symposium multisensor data fusion gener distribut detect system iri nation symposium sensor data fusion detect system multisensor data creat cyberspac situat awar commun futur id usenix assoc magazin realtim detect expert system page interpret network network detector suspici event network detect parti forward integr secur audit log messag work linux kernel enhanc detect detect suppress atm network usenix workshop detect network monitor standard audit trail format technic depart comput california davi vulner analysi web intern workshop recent advanc detect goal orient audit log audit data detect workshop design issu anonym number page audit data privaci respect detect intern workshop recent advanc detect number page secur server open distribut system european symposium research comput secur page studi technic report doc depart comput uppsala system network detect ot intern confer intellig system passiv network monitor detect sensor web intern workshop recent advanc detect build surviv integr approach base detect darpa inform surviv confer exposit remedi secur vulner runtim ieee detect disrupt distribut network monitor approach ieee symposium secur page fuzzi data mine genet algorithm appli detect nation inform system secur confer detect fuzzi data mine ot annual canadian inform technolog secur symposium worri improv network secur bound system annual comput secur applic confer tool attack number page electron autom intrud tool inform surviv workshop distribut detect system base bayesian alarm network number page trace anonym packet approxim sourc usenix system administr confer page comput immunolog system administr confer measur system normal work anomali detect usenix workshop detect network monitor detect user privaci natur web intern workshop recent advanc detect secur mobil network anomali detect annual comput secur applic confer proactiv detect distribut denial servic attack mib variabl feasibl studi seventh intern symposium integr network manag tradit indic warn host base detect neural network detect nation inform system secur confer applic neural network initi result web intern workshop recent advanc detect gener autonom reinforc learn network attack nation inform system secur confer compar analysi current detect technolog fourth technolog inform secur network detect neural network intern confer comput intellig multimedia applic page methodolog intellig agent provid autom ieee cybernet inform assur secur workshop taxonomi role automat ieee cybernet inform assur secur workshop air forc detect system evalu environ web intern workshop recent advanc detect toler approach protect network infrastructur phd comput scienc california davi design detect system technic report uc davi comput scienc depart base approach protect domain system intern confer depend system network page detect technic report lo alamo nation laboratori detect relat dbm uc davi student workshop comput detect system system intern work confer integr intern control inform system detect system user web intern workshop recent advanc detect simul concurr test detect parallel proc nation inform system secur confer page pp wai defeat detect system faster match detect speed darpa inform surviv confer exposit legisl regulatori group telecommun inform share report web document detect system overview detect mechan detect reachabl attack network web intern workshop recent advanc detect protect system stack attack surviv special sei inform surviv workshop automat adapt detect prevent attack usenix secur confer method detect measur distribut denial servic technic report lawrenc livermor nation depart energi evolv program genet program confer defend comput system autonom agent technic report purdu activ comput system autonom agent technic report purdu appli genet program detect aaai fall gp symposium build block approach detect short paper present evalu detect system attack darpa detect evalu confer workshop detect detect sourc code attack privileg extend abstract present accur detect sourc code attack privileg fourth intern symposium recent advanc detect number page languag model detect attack intern workshop recent advanc detect number page detect messag exchang extens markup languag document type internet draft quantit assess oper model tool technic report protect network system servic applic snmp protect ieee infocom problem detect comput web intern workshop recent advanc detect identi host audit data detect attack ip technic report depart comput purdu network audit system detect linux annual comput secur applic confer nation inform system secur confer markov model intrud locat ip network ieee confer control network locat markov process extend abstract present detect gener framework nation inform system secur confer novelti detect time seri data idea immunolog editor fourth workshop futur direct comput anomali detect de da costa autonom mobil agent system protect gener network applic web intern workshop recent advanc detect applic de de neuron la sur le informatiqu phd universit de pari aid la pour mobil act de neural network compon detect system ieee symposium research comput secur page fix pattern detect suspici process number page refer audit inform gener detect system intern ibm zurich research laboratori taxonomi system intern ibm zurich research laboratori taxonomi system technic report ibm zurich research laboratori taxonomi system annal de workbench detect system intern ibm zurich research laboratori applic recurr network detect system intern joint confer neural page aggreg correl alert technic report ibm zurich research laboratori aggreg correl alert fourth intern symposium recent advanc detect number page approach perform issu system comput model ieee transact softwar protect improv network secur extend abstract present design implement anomali detect empir approach submit contribut quantit secur evalu detect web intern workshop recent advanc detect toler distribut comput system ieee symposium research secur page immunolog approach chang analysi implic ieee symposium research secur privaci ieee comput ieee comput societi press distribut approach anomali detect visual data mine conceptu monitor architectur thought practic implement world comput congress enhanc oper system authent techniqu intern network confer page limit common languag agil monitor cyber darpa inform surviv confer exposit event recognit signatur anomali ieee workshop inform assur page event recognit signatur anomali ieee workshop inform assur page comput detect base factor compar command transit probabl technic report nation institut statist scienc comparison test statist comput detect base princip compon regress transit probabl symposium comput scienc statist fast comput detect algorithm base hypothesi test command transit probabl fourth intern confer knowledg discoveri data mine page backtrack spoof packet detect prevent larg case studi usenix workshop detect network monitor flow detect test evalu comput detect system commun translat rule scenario short paper present attack languag detect acm workshop detect technic report depart comput santa barbara detect dynam softwar measur usenix workshop detect network monitor detect appli machin learn solari audit data annual comput secur applic confer detect secur wilei user emploi standard unix account master depart comput colleg art florida state anomali detect noisi data learn probabl distribut seventeenth intern confer machin learn adapt model gener detect system workshop detect prevent comput compar survei technic report depart comput multipl model approach detect eleventh european confer machin learn lesson learn commerci id develop web intern workshop recent advanc detect visual detect data extend abstract present activ notic interest behavior intern confer knowledg discoveri data mine isol data inconsist detect annual comput secur applic confer detect adapt negoti web intern workshop recent advanc detect common languag detect adapt negoti comput detect exchang protocol internet draft log formal intern workshop recent advanc detect number page hidden pattern statist intern colloquium languag program comput immunolog commun unix process ieee symposium research secur page ieee comput ieee comput societi press immunolog inform process design principl immun system distribut autonom santa fe institut studi scienc page oxford press genet algorithm explor pattern recognit immun system detect safeti network neural network approach detect technic harri corpor intellig current futur direct technic report california davi combin optim detect technic report tr depart comput scienc california san diego petri detect nation inform system secur confer donald research issu cooper detect multipl domain web intern workshop recent advanc detect conceptu architectur monitor inform manag comput gener taxonomi evalu theori approach ieee symposium secur privaci detect nation comput secur confer predict time seri fulli connect neural network train back propag comput control engin journal dun langag pour trail master comput scienc analyz program vulner attack nation inform system secur confer studi neural network anomali detect usenix secur symposium analyz perform program behavior detect ifip wg work confer secur realtim detect system base learn program behavior intern workshop recent advanc detect number page autom approach identifi potenti vulner softwar ieee symposium secur privaci learn program behavior detect usenix workshop detect network monitor program behavior detect san workshop detect detect unknown program annual comput secur applic confer integr detect system tivoli consol technic report ibm zurich research laboratori attack detect master mathemat comput vrije universiteit bandwidth attack detect usenix secur symposium ey network usenix workshop detect network monitor visual approach monitor log system administr confer framework distribut detect cooper agent technic report depart comput purdu framework distribut detect interest driven cooper agent short paper present method detect encrypt master depart comput florida state detect telephoni signal web intern workshop recent advanc detect framework distribut knowledg multiag network secur system world cybernet informat analysi techniqu detect coordin attack probe usenix workshop detect network monitor design implement detector web intern workshop recent advanc detect detect behaviour data symposium intellig data analysi preliminari report advanc secur audit trail analysi unix technic comput scienc advanc secur audit trail analysi unix implement design evalu technic comput scienc softwar architectur base languag audit trail analysi european symposium research comput secur page infer detect infer threat due knowledg discoveri ieee symposium secur privaci detect abnorm network behavior audit countermeasur hold intrud account internet ieee symposium secur page ca network secur monitor ot ieee comput societi research secur page covert surveil simpl method secur network detect host autom discoveri predict rule detect technic report depart comput iowa state featur select genet algorithm detect genet evolutionari comput page softwar fault tree approach requir analysi detect system symposium requir engin inform secur intellig agent detect ieee inform technolog confer detect attack network ieee sam secur adapt manag annual comput secur applic confer implement secur polici languag secur constraint object phd depart comput immunolog model distribut detect applic comput secur phd mexico immun design immun system genet evolutionari comput confer page architectur immun system evolutionari immunolog approach distribut network detect web intern workshop recent advanc detect detect sequenc system call journal comput unix anomali detect system map web intern workshop recent advanc detect stop hacker attack os level internet secur advisor distribut detect framework base attack strategi analysi web intern workshop recent advanc detect conserv flow secur mechan network protocol master comput scienc california davi conserv flow secur mechan network protocol ieee symposium secur privaci pattern match autom inform system alarm system proc nation inform system secur page interfac detect system applic extend abstract present enhanc network detect smart environ web intern workshop recent advanc detect detect malici activ port ieic transact inform detect system unix ieee symposium secur page state transit detect approach ieee transact softwar page autonom agent distribut detect environ master naval postgradu unit state navi distribut detect comput system commun agent command control research technolog symposium distribut detect comput system commun agent intern command control research technolog symposium anomali detect applic layer short paper present editor uc davi detect data share workshop detect faq detect tool audit log analysi visual audit browser toolkit technic report tr uc davi comput scienc depart detect system product survei technic report lo alamo nation laboratori expert system applic network detect nation comput secur confer prototyp network detect system technic report lo alamo nation laboratori phase approach network detect technic report lo alamo nation laboratori autom comput detect system technic report lo alamo nation laboratori detect lo alamo nation laboratori technic report lo alamo nation laboratori infrastructur system call platform detect year network distribut system secur symposium monitor secur manag annual comput secur applic confer appli mobil agent detect technic report nation institut standard comput secur mobil agent detect annual canadian inform technolog secur symposium gener detect expert system technic report sri statist compon descript technic report sri impact privaci data protect legisl share detect inform fourth intern symposium recent advanc detect number page doyl jon widen scope attack recognit languag pdf quantit model secur process base attack behavior ieee transact softwar architectur design scalabl detect system emerg network infrastructur technic report design implement detect system rout network web intern workshop recent advanc detect neural network appli detect system ieee intern joint confer neural adapt system detect network int inform secur confer hybrid markov chain model comput detect technic report nation institut statist scienc unix user process base occurr statist applic comput detect short paper present deal posit detect extend abstract present common detect framework submit journal comput detect system larg scale network evalu ieic transact minim bandwidth remot access cryptograph protect audit log web intern workshop recent advanc detect network detect system technic report santa barbara comput scienc comput attack evalu detect system master depart electr engin comput massachusett institut technolog neg select nich immun system network detect genet evolutionari comput confer immun model network detect european congress intellig techniqu soft comput human immun system network detect european congress intellig techniqu soft comput defend surfer attack usenix workshop detect symposium network monitor limit detect system high speed network web intern workshop recent advanc detect logic induct valid behavior detect ieee symposium secur page system health monitor hierarchi constraint fourth intern symposium recent advanc detect number page autom detect vulner privileg program execut monitor annual comput secur applic confer page detect counter system softwar wrapper usenix secur symposium analysi algorithm distribut recognit account acm confer comput commun page execut monitor program distribut approach ieee symposium secur privaci detect system call trace ieee detect window nt base navi audit polici master naval postgradu unit state navi authorship identifi author program technic report depart comput purdu survei detect system technic report distribut system technic vienna appli mobil agent technolog detect workshop softwar engin mobil mobil agent base detect system intern ifip work confer network secur research detect autom abstract audit data comput secur page detect comput phd purdu model detect nation comput secur page applic pattern match detect technic report purdu softwar architectur support detect technic report coast project depart comput purdu gener applic level audit data librari technic report pattern match base filter audit reduct fast detect potenti intern workshop recent advanc detect number page combin fraud detect meet requir nordic workshop secur system filter techniqu rapid user joint workshop ai approach analysi applic machin learn anomali detect proc nation inform system secur page detect machin learn comput secur technic report depart electr comput purdu sequenc match learn anomali detect comput secur workshop ai approach fraud detect risk page approach onlin learn concept drift user comput secur fourth intern confer knowledg discoveri data page tempor sequenc learn data reduct anomali detect acm confer comput commun page tempor sequenc learn data reduct anomali detect acm transact inform system secur realtim anomali detect nonparametr pattern recognit approach technic report depart comput scienc extract de pour la de informatiqu rapport de laboratoir de recherch en universit franc data mine framework construct featur model detect system phd comput scienc columbia model detect workshop detect acm confer comput commun secur model detect technic report comput scienc columbia data mine base approach detect distribut intern workshop recent advanc detect number page autom detect method experi usenix workshop detect network monitor data mine approach detect proc usenix secur symposium framework construct featur model detect system acm transact inform system secur learn pattern unix process execut trace detect workshop ai method fraud risk manag mine audit data build detect model data mine framework adapt detect intellig review data mine framework build detect model ieee symposium secur privaci algorithm mine system audit data data retriev data mine kluwer academ publish combin knowledg discoveri knowledg engin build web intern workshop recent advanc detect mine experi network detect measur anomali detect ieee symposium secur privaci measur anomali detect ieee symposium secur privaci behavior cluster statist detect master depart comput colleg art florida state enhanc anomali detect time granular acm workshop detect system role valid comput adapt strategi eleventh comput secur foundat workshop model avail face attack secur paradigm page resili broadcast strategi environ technic report depart comput scienc california san diego resili multicast strategi environ technic report ut austin fuzzi pattern data nation comput secur confer observ natur comput secur technic report chalmer technolog fundament analysi detect comput phd school electr comput chalmer systemat classifi comput secur ieee symposium secur privaci design data librari web intern workshop recent advanc detect detect comput network expert system toolset ieee symposium secur privaci secur research educ synergi world confer inform secur educ systemat gener stochast barrier surviv system softwar annual hawaii intern confer system scienc analysi result darpa detect evalu intern workshop recent advanc detect number page darpa detect evalu comput bottleneck find attack low alarm rate web intern workshop recent advanc detect improv detect perform keyword select neural network web intern workshop recent advanc detect detect evalu web intern workshop recent advanc detect result darpa detect evalu web intern workshop recent advanc detect evalu detect darpa detect evalu darpa inform surviv confer exposit isol inform system ot ifip work confer secur isol inform system journal comput detect product evalu criteria build adapt agil applic detect year network distribut system secur symposium privaci detect analysi web intern workshop recent advanc detect practic fundament problem anomali detect fourth nordic workshop secur system privaci concern problem comput intellig system detect intrud comput threat countermeasur detect intrud comput system confer audit comput technolog prototyp expert system ieee symposium secur page expert system technic sri intern progress report comput secur applic page survei detect techniqu comput integr fuzzi logic data mine method detect master depart comput mississippi state detect attack identifi network packet header technic report depart comput florida institut technolog transport applic protocol ieee infocom confer detect distribut comput ieee comput secur foundat workshop method increment learn applic comput detect ieee intern confer tool intellig partial memori increment learn methodolog applic comput detect technic report machin learn infer georg mason system partial memori learn eighth workshop intellig inform page select exampl partial memori learn machin data mine analysi alarm web intern workshop recent advanc detect common vulner workshop research secur vulner trap intrud larg web intern workshop recent advanc detect simul platform detect distribut system summer comput simul confer polici enhanc comput network technic report comput scienc florida state behavior program secur paradigm workshop statist method network usenix workshop detect network monitor flexibl detect behavior model distribut applic corba object intern workshop recent advanc detect number page measur detect system web intern workshop recent advanc detect benchmark detect system intern confer depend system page comput survei current detect system technolog ieee comput secur applic page framework cooper detect nation inform system secur confer lincoln laboratori id evalu intern workshop recent advanc detect number page detect intern journal inform secur secur audit trail analysi genet algorithm intern confer comput reliabl page audit de par algorithm phd universit de renn algorithm pour de dan informatiqu genet biolog inspir approach secur audit trail analysi short ieee symposium secur privaci de la act du intellig page genet algorithm altern tool secur audit trail analysi web intern workshop recent advanc detect de aix dan informatiqu de cart de kohonen pour de dan informatiqu la aper cu act du forum sur la de languag descript attack extend abstract present ieee symposium secur privaci layer framework placement distribut detect devic nation inform system secur confer detect system list bibliographi automat polici satisfact intranet wide system signatur base detect system master depart comput california davi acquir deploi detect system nation institut standard technolog inform technolog laboratori bulletin mobil agent attack resist distribut hierarch detect system web intern workshop recent advanc detect fraud detect regress analysi comput audit inform system detect fraud comput finit automata mine execut data preliminari report intern workshop recent advanc detect number page approach anomali detect annual comput secur applic confer attack descript languag detect intern confer inform secur distribut execut remot audit network distribut system secur symposium cern network secur monitor web intern workshop recent advanc detect languag tool distribut detect phd universit de continu assess unix integr detect analysi ieee symposium network distribut system secur tool result lesson learn project web intern workshop recent advanc detect hacker approach id network detect ieee integr data mine techniqu detect xiii annual ifip wg work confer secur integr data mine techniqu detect research advanc inform system page kluwer publish defend attack tcp web intern workshop recent advanc detect neglect aspect comput secur master naval postgradu school anomali detect markov model technic report ibm research zurich research laboratori masquerad detect technic report ibm research zurich research laboratori network footprint experi emerald date usenix workshop detect network page tunnel internet draft queri facil common detect framework nation inform system secur confer model request cooper detect system comput network detect rider detect subgroup report process analysi applic detect annual comput secur applic confer automat acquir rule event correl event log technic report dept comput shadow network manag system web intern workshop recent advanc detect perform mechan detect ieee inform surviv workshop experi quantit evalu tool monitor oper secur technic report id web intern workshop recent advanc detect detect tune journal denial servic threat methodolog journal toler system inform surviv workshop proactiv approach distribut attack prevent packet technic report dept comput probabilist packet mark ip denial servic attack technic report dept comput probabilist packet mark ip denial servic attack ieee infocom packet distribut attack prevent internet acm sigcomm heel posit short paper present system detect network intrud proc usenix secur symposium detect network experi statu web intern workshop recent advanc detect system detect network intrud comput defend network id web intern workshop recent advanc detect event pattern cyber awar darpa inform surviv confer exposit manag event process network technic report comput system stanford secur agil detect annual comput secur applic confer event monitor enabl live disturb proc nation inform system secur confer live analysi gatewai internet societi symposium network distribut system secur stat state transit analysi tool detect master santa barbara dan le informatiqu master institut de format en universit de renn handl gener signatur trivial extend abstract present declar signatur id fourth intern symposium recent advanc detect number page local area detect incom war dial activ detect convent oper system audit data collect master purdu audit reduct detect heterogen framework applic annual comput secur applic distribut learn appli fraud detect technic report depart comput columbia denial network detect special toolkit oper system icma workshop system softwar platform test detect system ieee methodolog test detect system ieee transact softwar engin lesson learn implement network base real time detect system web intern workshop recent advanc detect session state transit base larg network id web intern workshop recent advanc detect adapt techniqu detect ieee intern confer cybernet page implement gener tool network monitor eleventh system administr confer person secur assist secur internet commerc earli warn threat assess inform assur extend abstract present open infrastructur scalabl detect ieee inform technolog confer inform environ futur multipl map detect nation inform system secur confer target servic intern workshop recent advanc detect number page lightweight detect network usenix confer de de log master universit pari deni franc log audit model check ieee comput secur foundat workshop page lincoln adapt inform assur testb short paper present detect isol autom attack web intern workshop recent advanc detect intellig tutor detect comput system comput evalu detect system web intern workshop recent advanc detect detect neural network advanc neural inform process system mit press secur ongo internet intrud academ environ fourth usenix secur symposium architectur de pour mobil phd ecol de de pari detect architectur mobil network ieee journal select area commun hardwar support ip darpa inform surviv confer exposit page access detect comput scienc engin page crc press strict anomali detect model id practic network support ip acm sigcomm page network support ip transact infrastructur detect darpa inform surviv confer exposit cryptograph support secur log untrust machin seventh usenix secur page secur network audit log untrust machin web intern workshop recent advanc detect secur audit log support comput acm transact inform system comput detect masquerad technic report nation institut statist scienc malici email filter unix mail filter detect malici window execut usenix annual technic confer track data mine method detect malici execut ieee symposium secur privaci studi feasibl perform anomali detect window nt web intern workshop recent advanc detect establish common exploit inform detect workshop research secur vulner expert system case studi nation comput secur page fast method detect program behavior ieee symposium secur privaci prevent process behavior monitor usenix workshop detect network monitor approach build surviv system nation inform system secur confer network detect system acm symposium comput commun secur fast system technic report iowa state fast system usenix secur symposium network approach automat pattern gener detect intern symposium comput inform scienc methodolog detect anomali user behavior base tempor regular intern confer inform secur anomali detect handl tempor relat event web intern workshop recent advanc detect evalu softwar sensor activ window comput user short paper present model applic ieee transact data knowledg applic detect technic report dept comput virginia applic detect step applic machin learn network detect annual comput secur applic confer investig evalu behaviour detect data mine intern workshop mathemat model architectur comput network secur design implement agent detect master comput scienc iowa state detect system aerospac comput secur applic page system distribut detect intern confer commun control system page ip acm sigcomm confer protocol comput page detect sequenc system call master depart comput florida state detect system aid audit privaci enhanc detect ifip intern inform secur confer page detect system aid experi autom audit analysi commun multimedia secur proc ifip intern confer commun multimedia secur set optim threshold comput autom delai usenix secur symposium principl comput immun system secur paradigm workshop detect system evid web intern workshop recent advanc detect network detect test suit web intern workshop recent advanc detect advanc mark scheme ip technic report comput scienc berkelei advanc authent mark scheme ip ieee infocom autonom agent detect web intern workshop recent advanc detect direct architectur web intern workshop recent advanc detect design implement issu sensor detect extend abstract present practic autom detect acm confer comput commun secur distribut trace intrud master california davi id lesson learn date web intern workshop recent advanc detect progress open id alert standard extend abstract present grid detect system larg network proc nation inform system secur confer applic detect system environ extend abstract present autonom distribut denial servic attack fourth intern symposium recent advanc detect number page detect distribut applic commun glossari term secur detect model fraud result jam project darpa inform surviv confer exposit ip overlai network track flood review outlook detect detect system extend abstract present design implement detect system web intern workshop recent advanc detect protect log inform hide multipl backup directori intern workshop expert system applic log inform visual system detect technic report graduat school inform tokyo nomad network monitor framework anomali detect fourth ieee symposium comput commun detect switch network technic report sandia nation laboratori adapt realtim anomali detect induct gener sequenti pattern ieee symposium secur privaci detect base structur statist comput graphic progress report detect lo alamo technic report lo alamo nation laboratori internet law enforc insur coverag internet busi web intern workshop recent advanc detect support detect graph cluster graph draw extend abstract present middlewar approach asynchron backward compat detect prevent arp cach annual comput secur applic confer program languag manual trust system servic aud expert system secur audit comput secur sift perform packet technic report center inform technolog michigan distribut concurr detect scheme base assert sc intern symposium perform evalu comput telecommun page experi detect fourth intern symposium recent advanc detect number page detect comput session activ ieee symposium secur privaci architectur flexibl servic system short paper present monitor cyber attack detect intern workshop recent advanc detect number page approach sensor correl extend abstract present probabilist alert correl fourth intern symposium recent advanc detect number page detect system eighth ieee intern workshop enabl infrastructur collabor page visual mathemat model detect nation inform system secur confer studi insid attack rout protocol ieee intern confer network page attack languag ieee inform surviv workshop stat tool suit darpa inform surviv confer exposit detect approach annual comput secur applic confer detect system journal comput secur design web detect sensor fourth intern symposium recent advanc detect number page detect static analysi ieee symposium secur privaci step autom detect vulner year network distribut system secur symposium activ framework intern confer inform secur detect system call altern data model ieee symposium secur privaci activ compon detect technic report appli research austin monitor network log activ technic report appli research laboratori depart comput immunolog approach detect annual canadian inform technolog secur symposium develop analysi detect algorithm master depart electr engin comput mit log audit file system proc comput secur applic confer audit web intern workshop recent advanc detect interfac trust applic detect system fourth intern symposium recent advanc detect number page system base algorithm technic report zurich research ibm research system base algorithm detect audit trail pattern technic report ibm zurich research laboratori detect audit trail pattern intern workshop recent advanc detect number page audit trail pattern analysi detect suspici process behavior web intern workshop recent advanc detect build system detect suspici process behavior web intern workshop recent advanc detect paradigm reduct audit trail master comput scienc california cooper secur distribut detect system comput depend infrastructur challeng detect web intern workshop recent advanc detect comput immun system detect network fourth intern symposium recent advanc detect number page unix prototyp detect anomali detect secur network nation comput secur confer anomali updat nation comput secur confer integr detect infrastructur web intern workshop recent advanc detect detect rout protocol ieee symposium secur ca build toler applic usenix secur symposium measur system behavior event log usenix annual technic confer distribut system detect coordin attack intern confer inform secur page activ protect secur secur servic technic report depart comput florida state detect secur protocol acm confer comput commun secur environ secur protocol detect special edit journal comput polici enhanc comput network annual ieee cybernet inform assur page inform fusion techniqu network detect inform technolog page critic inform infrastructur protect process model inform fusion inform surviv workshop page detect attack web intern workshop recent advanc detect detect wireless network sixth annual intern confer mobil comput network detect usenix secur symposium detect step stone usenix secur symposium rome lab experi web intern workshop recent advanc detect
ML/1287 6 learn locat object space sequenc camera imag dimitri dept comput scienc carnegi mellon pa sebastian thrun dept comput scienc carnegi mellon pa abstract paper address problem determin object locat sequenc camera imag record mobil robot approach present peopl robot recogn specif present exampl object recogn tree method learn featur target object individu camera imag individu estim integr time probabilist model robot environ result illustr method enabl mobil robot robustli estim locat object multipl camera imag introduct recent progress field mobil robot applic robot guid blind mental handicap robot clean larg offic build depart robot assist peopl recreat slowli reach robot integr mobil manipul move capabl manipul environ practic success partial depend abil identifi local object paper address problem build robot train recogn locat object algorithm enabl peopl train robot simpli show pose object robot recogn object determin locat space contrast exist approach mobil assum object locat floor approach make restrict assumpt object locat pose challeng abil local singl camera imag insuffici determin locat object space approach probabilist estim ident locat target object multipl view map camera imag probabilist pixel camera likelihood pixel part target object map establish tree appli local imag construct train phase label imag probabilist map project work base straightforward geometr singl camera imag insuffici determin locat object approach integr inform multipl multipl viewpoint emploi rule gener consist probabilist model workspac approach account uncertainti introduc robot probabilist model robot motion robot move environ gradual improv estim ident locat final object result robot equip color camera show object locat robustli high accuraci remaind paper organ section briefli describ tree approach imag section show imag inform integr provid method accommod uncertainti introduc robot motion section present obtain hue hue hue hue hue hue hue posit neg probabl hue figur top node tree leaf repres probabl condit valu attribut intern node test fraction posit pixel tile fall hue rang survei relat research section comment assumpt limit approach suggest direct futur research tree learn tree succinct explicit repres function finit set discret element set real number input function frequent correspond discret attribut object output repres object properti predict node tree partit input space intern node partit space subspac base singl input associ result subspac children set tree complet space function function repres tree obtain context imag analysi fashion similar paper illustr fig approach tree approxim condit probabl densiti function tree answer queri output input tupl valu queri typic compar number posit number neg train exampl assign train leaf node partit input tupl li algorithm return major leaf tree differ output fraction posit neg exampl found leaf tree repres approxim probabl densiti function output space condit valu attribut input space appropri prune phase intend compact gener futur probabl train set valu input output due set input variabl insuffici determinist model pdf imag approach tree map camera imag probabilist describ probabl presenc target object locat imag input tree imag featur local region output probabl measur likelihood presenc target object respect tile approach appli arbitrari imag featur local color histogram input tree tree learn label train exampl construct test prune set input pictur obtain rectangl drawn object user includ part background imag divid matrix rectangular complet cover surfac size tile small rel project object imag paper tile construct singl posit neg featur occur continu extract input valu tile depend tile fulli assign posit set exampl equal divid test prune grow tree combin object environ result appli imag probabl densiti presenc target object figur illustr method shown top figur detect bottl previou exampl top row imag outlin part tile posit exampl rest imag tile neg exampl probabl mark unseen pictur bottom row shown set pictur consist neg exampl seri train imag target object label hand bottom row show test probabl field gener tree algorithm assign high likelihood correct misclassifi small number region imag background singl camera imposs determin locat target object coordin remaind paper describ approach integr probabilist estim space integr multipl camera imag approach integr probabilist extract individu spatial model world inform locat object repres occup grid grid cell approxim probabl part object occupi cell probabl initi number correspond prior belief object occupi cell inform world number learn typic count approach probabl exact prior long converg actual probabl suffici number observ evid object question occur frequent area shoe expect lie floor inform appropri initi prior probabl assign higher valu locat step updat probabl cell robot motion affect grid due uncertainti robot translat rotat veloc inform integr kei idea map imag inform spatial map imag tile pyramid space imag obtain environ inform locat part object assum singl camera inform depth featur tile imag make assumpt distanc part obtain inform euler angl altitud featur respect robot current locat pyramid eman converg side intersect corner tile imag plane perpendicular direct camera face grid cell intersect pyramid updat law updat shown fig pyramid shown gener camera imag locat rule appli integr order gener consist belief integr work probabl part object occupi cell grid locat time denot coordin respect coordin system local boolean random variabl denot exist part object locat insid grid cell sake breviti denot imag obtain time set previou command previou probabl grid cell locat comput figur robot experi shown equip parallel gripper object manipul illustr present inform imag viewpoint integr occup grid shown left singl project appli grid pictur show combin imag depict averag valu grid cell probabl view averag probabl valu prior probabl accumul cell previou iter account previou data make markov condit independ assumpt impli fact exist part object imag obtain depend previou imag obtain complement event probabl estim return tree tile cell current imag account estim problem common practic comput cancel similar formula belief integr found robot motion robot motion introduc uncertainti robot estim object locat imperfect actuat measur devic model translat rotat magnitud veloc robot gaussian random variabl equal nomin veloc robot motion make assumpt systemat error standard deviat pessimist estim deviat nomin veloc magnitud accur determin standard deviat significantli influenc locat estim frequent observ actual critic overestim magnitud veloc distribut standard deviat oe oe locat object veloc time random variabl oe standard deviat oe suggest uncertainti object locat time time shown fig result conduct experi mobil robot equip singl soni color camera focal length mount unit imag size acquir meteor locat evolut locat pdf time time figur probabilist model robot motion top belief locat object deterior time uncertainti magnitud veloc bottom graph illustr outcom specif motion command project axi translat connect camera train tree manner section chose simpl histogram downsampl version train imag input featur tree algorithm color histogram resolut color bin tile repres input pixel percentag color event tile part object train choic input featur account inform present simpli artifact current implement mean restrict choic input featur approach gener complex featur emploi futur implement demonstr simpl perform adequ frequent occur situat object suffici distinct inform recov approxim locat simpl object determin resolut color coupl amount hue variat light intens object result figur probabl map output tree train recogn red chair tile probabl map correspond probabl greater project map shown averag axi applic tree train exampl object background imag neg exampl shown fig top node tree shown fig similar fashion construct tree recogn larger simpl red imag addit imag chair pose manual maneuv mobil robot chair pictur angl pictur shown fig column figur depict probabl map output tree imag locat acquir imag project probabl map element cell cover pyramid affect probabl probabl map result project view ax shown rightmost column fig pixel project intens proport averag probabl axi project pass pixel project make locat chair pictur easi robot grid imag incorpor inform increment singl grid justifi markov assumpt appli law cell individu normal correspond semant assign probabl store repres probabl part object occupi cell make assumpt size object respect cell size robot maneuv manual spot imag motion uncertainti manner section robot experi motion consist rotat forward backward motion direct face model rotat translat uncertainti magnitud veloc updat grid procedur shown fig run sequenc belief correspond situat robot face chair grid size unit direct correspond real world belief shown fig project horizont fig initi locat target unknown robot belief conjunct output tree robot lose inform snapshot belief refin locat shape target object reconstruct high accuraci result approach accur determin locat target object robust error robot odometri robust result incorpor probabilist model robot motion relat work tree popular induct machin learn method date earli algorithm applic problem discret input output space tree learn algorithm ai input space reinvent earlier work regress method input output space found work present paper tree learn condit probabl densiti function approach present partit input space hypercub output repres condit estim approach relat result report show artifici neural network approxim condit probabl densiti function mathemat approach integr inform adopt statist literatur approach present paper bear close resembl occup grid occup grid approach popular techniqu learn model mobil robot environ sensor data approach repres environ evenli space grid grid point annot describ evid locat vast major exist approach differ aspect model locat specif target object construct rang measur camera imag notabl except approach construct occup grid sequenc camera imag moravec martin approach construct commonli stereo vision estim locat obstacl stereo vision gener distanc greatli facilit construct map approach report estim distanc integr multipl camera imag record locat approach incap deal error robot odometri object reconstruct investig context comput vision approach emerg model object typic repres polygon mesh stereo intens match construct fit mesh approach grid essenti similar paper emploi techniqu figur cumul effect motion probabl map project grid view run perpendicular door face interior room pictur fig distinct part chair discern updat cell differ approach cell updat count vote straightforward ad hoc manner emploi techniqu vote cell radiu intersect line line segment necessit partli inabl model inaccuraci viewpoint militari aerial camera locat estim accur techniqu learn probabilist model set featur emploi exampl featur equal necessit order produc recogniz select difficult statist approach threshold approach similar markov local method probabilist estim pose mobil robot environ markov local reli statist principl integr multipl sensor read singl belief approach basic evenli space grid markov rest assumpt object locat estim approach handl situat variabl number target object problem find manipul object receiv attent ai commun paper buhmann al approach robot train recogn specif object exist approach mobil robot make assumpt object locat case camera coordin directli convert coordin approach specif design find object arbitrari locat space import object frequent found discuss futur research paper present approach estim locat object mobil robot individu camera imag interpret tree map imag region probabilist estim presenc target object base straightforward geometr probabl map pyramid global world coordin multipl obtain camera imag record integr rule singl probabilist model object locat robot motion account probabilist model robot motion result demonstr method robustli local object space kei advantag current approach gener assumpt made typic locat object assum lie approach train easili recogn object current implement color primari cue object method equal appli richer rang imag make fit larg class target object object recogn local imag approach rest limit assumpt assum object move accommod move approach extend probabilist model object motion model typic motion speed target object approach gather suffici inform estim locat move object accuraci approach assum train imag accur repres situat test enrich train set small number pictur record random locat lab pictur neg train exampl grow tree found addit imag robust imag improv estim result method fail robot encount object similar target part train set spatial resolut experi paper due enorm complex involv updat grid comput overhead manag denser larger grid comput cost updat grid cubic number grid cell interest extens current approach repres object locat balanc comput memori model region target object densiti target object low tension improv comput effici approach substanti extens current approach method activ control robot maxim inform gain experi present human manual posit robot previou work develop success method activ inform appli context learn occup grid map context object method lead behavior robot investig object multipl order estim locat accur develop method subject futur research refer thrun mobil robot rhino ai schmidt estim absolut posit mobil robot posit probabl grid thirteenth nation confer artifici menlo august aaai press stone classif regress tree gc rl berger statist infer wadsworth pacif collin true match ieee comput vision pattern page elf occup probabilist framework robot percept navig phd depart electr comput carnegi mellon um fayyad kb irani discret attribut classif learn juli surfac combin stereo shade friedman multivari adapt regress spline annal march horswil special perceptu process technic report ai ai septemb rp editor mobil case studi success robot mit press mackai bayesian method adapt model phd california institut tm mitchel machin learn sk salzberg system induct obliqu tree journal artifici intellig hp moravec mc martin robot navig spatial evid grid mobil robot robot carnegi mellon moor effici learn robot control phd triniti moravec sensor fusion certainti grid mobil robot ai page summer robot ai summer pearl probabilist reason intellig network plausibl infer morgan kaufmann san quinlan induct tree machin quinlan program machin learn morgan san samet applic spatial data structur publish samet design analysi spatial data structur publish simmon aaai robot competit exhibit ai spring simmon koenig probabilist robot navig partial observ environ page august map learn navig rhino rp mobil case studi success robot system mit thrun bayesian landmark learn mobil robot local machin thrun learn map indoor mobil robot navig artifici solla consist infer probabl layer predict gener intern joint conferenceon neural san ieee tab neural network
HCI/1288 4 ubiquit web inform agent gerd bernd christian wolff institut comput scienc universitat koblenz abstract paper overview ai method techniqu develop build ubiquit web inform system method area machin logic knowledg system discuss context prototyp inform system mia mia web inform system mobil equip pda cellular phone gp devic cellular wap phone captur main issu ubiquit locat anytim inform access pda technolog introduct biggest chaotic unstructur sourc inform make amount inform ubiquit comput daili life great challeng hardwar issu wireless ubiquit solv wearabl comput integr pda telecommun major problem intellig inform extract www overwhelm mobil user document found offer short piec inform interest good inform system present address nearbi restaur retriev onlin web match prefer cuisin condit hold awar user react directli user present inform found user inform extract onlin web requir special prepar web page page special tag addit develop method artif intellig machin logic knowledg system paper give overview ai method techniqu build ubiquit web inform system prototyp test method system mobil inform agent main intent paper show implement ubiquit web inform system ai techniqu suitabl solv emerg problem mia system mia base inform system retriev short fact anytim fast queri time monitor posit mobil user autonom updat subject search occur user travel search interest section organ section describ briefli basic compon mia detail introduct ai method spider agent section conclud section mia session architectur mia system separ basic compon mobil server system mobil mobil comput agent local agent user agent matchmak mobil agent server init request agent commun fig system architectur user equip estim geograph posit commun wirelessli server locat internet mobil phone develop mobil agent mobil phone wap support system wai inform current posit read user add posit manual autom geograph posit gp gp work close work place lot build inconveni user interest system popul area bad percept gp signal eleg overcom problem mobil phone connect inform determin posit user mia prototyp work gp support manual posit inform geograph coordin deliv gp devic resolv local agent track user estim nearbi citi gatewai core base retriev system http protocol commun html wml page mobil agent core inform system consist interact agent current prototyp work agent user agent model local agent spider agent web search find inform relev current geograph posit regard interest user distinguish type inform search web topic extract topic web page inform relat user interest current citi restaur extract inform topic descript descript topic extract present profil web site structur profil configur gener specif mia method defin user profil captur hierarch structur structur plai import role spider section model topic constrain keyword list set constraint oper constraint defin topic restaur extract chosen predefin set due inform extract capabl mia prototyp support oper address extract mia user person profil consist topic figur show profil titl trip consist topic topic assign extract address user chang profil inform retriev user agent propag current user profil agent ai method intellig web inform retriev section overview artifici intellig base techniqu spider agent classifi extract inform web spider step inform retriev process find web page inform special topic contrast exist search approach search relev web page onlin call approach index web document due estim word frequenc build index determin relev web document relat page approach interpret www direct graph web page node hyperlink vertic label url text assum keyword start page found relev web page due keyword start start page find path node vertic label url vertex label path keyword keyword occur vertic label basic idea improv search site inform restaur follow path label edg link occur path introduc paramet keyword defin context radiu keyword similar cut search path depart occurr keyword occur kn label follow path paramet kn call defin approach set entri point set keyword start return link iff exist cycl free path node vertic connect wm label wm label kn kn wm label find path modifi search strategi mention keyword distanc paramet cost function similar standard inform search algorithm path link decid link set link nearest goal chose link path minim keyword distanc spider agent search keyword link follow path occur time link agent prefer follow web page classif ad text classif compon improv effect effici system web page provid spider algorithm address filter irrelev web speed system significantli effici inform extract compon inform facilit task extract inform web page inform extract agent extract address web page varieti method method address inform posit page addit inform inform extract compon make method classifi high confid qualiti web inform extract agent method method fail web page inform extract agent method simpli abandon page artifici neural network text classif network architectur chosen fulli connect network input hidden output node map web page input node select input node web page input node output node repres classif page page train output node set output node set recognit document put class output node higher activ neural network train offlin preclassifi page page authent web page gather spider algorithm network train error longer declin independ set page page train set classifi correctli excel classif result partli due distribut web web page gather spider agent address posit recognit rate word give web page chosen select word word web page train set inform word distinguish page page address machin learn inform extract extract inform web page understand involv semant text analyz find relev inform recogn underli syntact linguist motiv attempt semant syntact fail web document make special text format annot string document recogn extract relev inform syntax base approach automat learn extract procedur similar approach machin learn techniqu automat wrapper construct extract assum special text part delimit mark begin end relev inform extract kei idea learn algorithm set extract web address set address list collect surround text part compon address learn gener pattern anchor combin learn pattern addit constraint result learn wrapper intend inform extract task illustr gener idea learn wrapper user read web page list relat instanc relat inform found list shown web page user determin instanc list instanc posit set exampl learn task find definit relat address exampl list address instanc relat address mean learn extract procedur extract instanc remain instanc present page gener techniqu base combin method adopt area induct logic program detail reader refer major problem confront context mia lack exampl classifi unknown web page determin learn overcom problem develop learn algorithm deriv exampl mean knowledg techniqu model structur knowledg address logic kr languag queri knowledg base deriv exampl input modifi learner learn wrapper unknown page call approach learn meta exampl automat construct address techniqu show result mia session demonstr gener behavior function mia small imagin plan bit unsur citi visit journei interest address restaur offer chine cultur institut cinema home mia interest standard web browser interfac web browser instal pda start select mia applic fig pda result store pda activ profil mobil devic contact mia server cellular phone internet connect transmit current geograph posit preselect time interv user interact initi profil server retriev posit matchmak request mobil user extend matchmak decid initi user agent spider agent fulfil request agent activ inform user agent track locat search interest search interest defin chang move locat report user commun local agent local agent resolv geograph coordin nearest citi user agent inform activ spider agent perceiv spider agent start web page topic interest current citi drive nice town decid stai time time mia found select mia applic click button result user agent queri inform found activ spider agent result agent constantli listen request immedi task answer incom request result found return directli user agent final mobil user pda logic program base agent technolog kei issu mia architectur logic program languag agent agent commun languag techniqu agent control queri agent flexibl dynam initi assign agent handl matchmak special agent job match inform search inform provid agent track agent user task extend matchmak concept check simpl subsumpt techniqu incom request split handl activ agent techniqu spider agent prevent system agent search topic function agent mobil agent matchmak user agent spider agent logic programm lookup spider agent fig agent commun logic program program describ search web knowledg acquir agent ad uniform knowledg interfac base interfac base common inform exchang level type agent agent necessarili rule agent program activ agent receiv request actual basic task interrupt incom queri process rule agent program fire common defin uniform predic describ state inform acquir agent trust special servic builtin logic queri interest point agent add knowledg form rule agent logic program agent fix set commun rule similar kqml execut commun rule result consult matchmak agent type activ user userid agent commun directli activ agent matchmak initi call agent send initi command initi agent major advantag interrupt logic program base agent possibl provid anytim inform access agent ist found wait complet task interrupt basic task queri interfac base retriev result found send back work essenti mobil inform provid user anytim fast inform user send format retriev request mia system queri send matchmak user agent ua user incom request interpret proof ua proof queri appli rule result execut commun rule result matchmak activ agent type spider user small assum spider agent activ user search address chine restaur interfac base consist address found queri result comput knowledg final ua fulfil proof oblig send answer mobil agent futur work show detail major ai logic machin learn system combin build ubiquit inform system gener agent architectur base interrupt logic program techniqu implement anytim info access present section gave short introduct exist palm gp system cellular phone build mobil comput unit provid locat anytim inform access wireless commun point problem gp posit estim inconveni prototyp setup consist separ devic lead futur plan import point capabl mia retriev inform unmodifi web page limit special search web inform system access upto date onlin inform describ ubiquit system mia citi inform system stationari user pc home futur work extend pure keyword base web search algorithm deduct reason process deriv relat term keyword ontolog constraint keyword list combin deduct ontolog base enrich retriev process domain specif knowledg topic restaur deduct resolv queri restaur french italian offlin train web page classif train network creat adapt agent onlin feedback extract agent adapt network web result extract teach input pattern neural network start work eleg overcom problem relat gp base local cellular phone inform cell connect cell area serv fix basi station telephon network inform basi station phone connect geograph posit basi determin posit user fairli accur high resolut gp harm high resolut gp resolut price map significantli lower resolut gp moment switch html xml serv html page format serv page standard document format acknowledg work present paper fund land ur land ur und project intellig web inform agent refer califf relat learn techniqu natur languag inform extract phd texa august cover thoma element inform theori mayfield softwar chapter kqml agent commun languag mit freitag machin learn inform extract inform domain phd comput scienc carnegi mellon novemb thoma unifi approach html wrapper learn technic institut fur knight multidisciplinari survei acm comput march kushmerick wrapper induct inform extract phd lloyd foundat logic program muggleton raedt induct logic theori method journal logic plotkin automat method induct infer phd goebel comput logic approach oxford rumelhart mcclelland parallel distribut explor microstructur volum foundat mit thoma base learn inform extract workshop machin learn inform juli nation american confer artif intellig thoma logic program intellig web search intellig inform special methodolog intellig inform system editor multiag system mit wiederhold mediat architectur futur inform system ieee page march
ML/1289 6 cooper coevolut system han yong miikkulainen depart comput scienc texa austin tx usa technic report abstract task pursuit multipl agent coordin behavior achiev common goal interest question behavior agent control neural power method separ test common task call esp demonstr task approach shown effici robust evolv singl central control agent role commun domain shown unnecessari detriment effect behavior task express cooper synchron introduct problem agent work achiev common goal due distribut system flexibl central problem solver agent behav cooper greedili accomplish common object central issu cooper establish agent implement set autonom coordin central agent kind commun cooper effect paper explor question context machin team neural network evolv genet algorithm solv cooper task enforc subpopul method proven highli effici reinforc learn extend evolut method evalu task team predat cooper captur prei main contribut show wai coordin team agent affect perform demonstr interest evolv control entir team perform substanti set autonom neural network evolv cooper control singl predat result counteract notion central control team agent commun behav suffici establish compat role team commun team team member team consist perform team result due nich strong esp search entir space coevolut identifi set simpler optim team member separ parallel subtask agent expect explicit commun begin review relat work cooper domain enforc subpopul method evalu discuss futur prospect approach conclud paper background relat work coevolut evolutionari algorithm refer maintain evolv individu role common singl popul multipl popul competit role adversari agent loss gain cooper agent share reward penalti success failur kind problem util cooper coevolut solut natur modular subcompon interact cooper solv problem subcompon evolv popul contribut individu solut gomez miikkulainen develop method call enforc subpopul evolv popul neuron form neural network neuron select popul form unit neural evalu fit pass back particip neuron evolut develop esp evolv neural requir neural network cooper esp method extens discuss detail section potter de jong outlin architectur process cooper coevolut similar partial approach potter de jong focu methodolog issu automat problem number subcompon focu understand cooper includ effici model team control role commun seri hayn sen explor wai evolv predat behav cooper domain studi genet program evolv popul individu program repres strategi predat team predat share behavior strategi studi develop heterogen chromosom popul repres behavior strategi predat team report heterogen predat perform homogen step direct heterogen evolv control predat separ popul cooper coevolut esp shown power control task esp evolv neural network genet program evolv program control role commun cooper behavior studi artifici life experi studi shown commun highli commun individu outperform studi account cost energi expenditur danger attract complex apparatu requir exist form cooper strategi involv commun wagner suggest domain commun contribut solv commun trait evolv involv cost kind cooper strategi evolv depend factor natur popul avail resourc idea relev agent commun abil manag evolv cooper behavior balch examin behavior learn robot team reinforc learn found reinforc appli separ agent team learn ident global reinforc share produc team heterogen behavior result guidelin evolv cooper reward team good behavior privileg cooper agent contribut reward individu induc competit behavior individu maxim reward good entir team work diverg balch focu studi behavior nich evolv team figur domain environ prei predat arrow current direct movement respect global local control reinforc learn evolutionari learn neural give effici perform approach good match task domain simpl effect domain test discuss domain prei captur task paper special case problem task consist environ prei predat predat move environ catch prei evad predat task interest ubiquit natur offer clear object requir complex coordin respect agent adversari agent challeng learn measur success analyz visual strategi evolv domain test approach evolut control prei predat environ prei control simpl predat control neural network goal evolv neural network form effici team catch prei approach techniqu compar base long team catch kind strategi environ squar obstacl barrier squar refer agent move prei move fast directli nearest predat prei start random locat predat start bottom left corner predat caught prei trial termin count failur constrain imposs consist catch prei cooper predat start bottom left behav greedili chase prei pack direct prei avoid captur run direct fast environ catch figur illustr predat behav chanc coordin maneuv captur time limit chosen predat travel corner map time move surround mill bump prei eventu prei captur task wide test behavior hayn sen domain assess perform coordin system variant predat requir surround prei catch main difficulti task li coordin predat occupi posit captur prei move randomli slower speed predat catch easili predat move prei posit success captur prei move fast nearest catch prei simpli chase main difficulti neural network neuron subpopul domain fit figur esp architectur popul contribut neuron form neural evalu domain fit pass back particip neuron scheme evolv neural network control predat simultan figur detail architectur neural network predat face coordin chase end prei requir strategi esp approach enforc subpopul method esp extens adapt sane method evolv popul neuron complet network neuron select popul form hidden layer neural evalu problem fit pass back neuron network equal esp extend sane alloc separ popul hidden layer neuron number neuron popul evolv simultan cooper coevolut method evolv neural neuron popul converg role result highest fit neural network evalu esp problem find success network smaller result effici evolut robot control benchmark esp compar method cellular encod reinforc learn method adapt heurist critic esp turn consist solv problem solv harder problem form solid foundat extens system evolut esp adapt simultan evolut multipl agent evalu approach encod control approach cooper control approach entail method esp evolut predat control singl neural network system implement usual esp method distribut control predat control network autonom network evolv simultan network form usual esp method network evalu domain result fit team distribut neuron constitut network esp subpopul predat neuron subpopul predat neuron subpopul predat neuron predat neural network neural network predat fit fit fit domain neural network predat figur esp architectur predat control neural form subpopul neuron neural network form evalu domain time fit team pass back particip neuron figur detail architectur individu network agent evolv seri increment challeng task increment found facilit learn complex direct evolut goal task result mechan strategi evolut proce easiest task prei subsequ task prei move faster task move fast predat team manag solv current task harder task introduc increment learn predat opportun close stationari prei easier task gain experi catch prei close proxim place predat final task start give suffici exposur maneuv close difficult approach prei begin increment learn give evolut experi skill hard develop fit function consist depend prei captur de prei caught de prei caught averag initi distanc averag final distanc prei fit function chosen satisfi prei privileg team base start initi distanc prei factor privileg team end posit predat prei prei account distanc cover initi distanc prei factor success strategi involv surround prei predat travel long distanc map approach prei furthest direct time captur factor fit function fit function form stage increment make simpl conveni track progress neuron chromosom concaten weight input output connect neuron usual burst mutat weight avoid prematur converg progress evolut stagnat popul popul cauchi distribut current solut burst mutat typic place task transit prolong evolut difficult task happen coupl time difficult esp solv experi conduct experi test main cooper coevolut autonom control effect evolv central control agent control autonom neural network learn cooper commun learn power cooper behavior shorter time compar commun agent addit quantit comparison section describ compar actual behavior learn approach test robust verifi cooper task subpopul neuron approach neural network distribut approach predat neural network neuron subpopul consist neuron evolutionari trial run neuron randomli chosen subpopul form neural team evalu prei start random locat predat start corner fit evalu assign neuron constitut top neuron recombin crossov offspr replac bottom bottom mutat rate weight ad random note environ stochast prei start factor determin action predat order test strategi implement suit benchmark problem map divid team test prei start center squar turn arrang sampl estim gener effect team team manag catch prei benchmark case consid learn task team catch prei benchmark case consid complet solv team success rate gener scenario standard evolut central control cooper coevolut autonom control section compar result evolv singl neural network control entir team separ neural control singl predat make comparison term number evolutionari cycl neural learn solv task section actual predat behavior emerg compar network architectur shown figur evolv scheme outlin section simul techniqu run evolutionari cycl north east south west stai north east south west stai north east south west stai input offset offset prei prei predat predat offset predat offset predat offset offset prei offset predat offset predat offset hidden layer output predat output predat output predat output predat input input predat predat input figur central control network predat neural network receiv rel offset prei predat perspect output movement predat act central control team chromosom size hidden layer unit input predat offset prei offset predat offset hidden layer output input north east south west stai figur control singl autonom cooper predat neural network autonom control network simultan evolv task network receiv rel offset prei predat input chromosom size hidden layer unit input control gener solv benchmark case team evolv solv standard deviat benchmark case central simul distribut simul tabl learn perform standard evolut central control versu cooper coevolut multipl cooper control commun gener solv benchmark case team evolv solv standard deviat benchmark case simul simul tabl learn perform cooper coevolut autonom control commun tabl show standard deviat number evolutionari gener approach learn solv task catch prei benchmark case list number team learn solv task benchmark case coevolut neural network control time fast evolut central control find reason solut differ statist singl neural network unabl evolv level requir solv benchmark case evolutionari cooper neural network time result provid convinc evid cooper coevolut power standard central approach task cooper coevolut commun previou separ control agent disjoint autonom network power evolut control longer receiv direct inform agent domain complet repres predat prei offset section reduc inform prevent predat agent act direct commun object find commun cooper behavior evolv modifi network architectur shown figur predat longer rel offset offset prei network evolv esp method commun network figur simul system run evolutionari cycl learn perform commun control tabl system learn reason behavior time faster averag differ statist system learn solv task complet except result show explicit commun cooper behavior emerg effici analyz exampl evolv behavior gain insight case comparison evolv behavior behavior emerg point differ describ emerg behavior team autonom cooper control commun compar prei offset input hidden layer north east south west stai output figur autonom control neural network receiv prei offset input control singl predat predat commun chromosom size hidden layer unit input frame frame frame figur sampl strategi team predat pursu prei predat act discuss behavior team central control compar main result evolut commun produc team evolv specif rigid role team util singl effect strategi case evolut commun produc team flexibl agent emploi strategi figur illustr success strategi team strategi involv call predat predat move horizont move stai vertic axi pursu prei upward depend prei frame figur show initi posit agent prei predat move prei vertic predat prei frame vertic column start chase simpli prei vertic axi frame prei trap move captur notic strategi requir commun long prei vertic chase prei prei caught success strategi emerg involv prei opposit prei captur commun implicit knowledg opposit team network evolv separ frame frame frame figur strategi commun team strategi show start end opposit frame frame frame figur strategi commun team figur time movement horizont draw success team combin opposit combin kind team form constitut problem found robustli figur illustr behavior evolv commun team strategi shown team displai combin depend prei start locat locat predat timestep figur illustr behavior similar strategi frame snapshot start posit predat start pursu prei upward predat move left prei vertic axi start chase prei frame prei trap predat frame strategi versatil combin block opposit figur illustr strategi emploi team predat start move prei diagon upward predat move upward horizont prei predat start chase prei horizont trap predat strategi similar time prei chase horizont chase includ diagon movement strategi similar emploi team team combin depend start finish predat specif role perform modifi strategi depend situat predat behav prei rel observ predat decid act strategi effici team resembl player soccer player expect behavior commun team similar pickup team player constantli monitor determin player plai kind effici cautiou attribut undu intellig intent neural network simpli manag adapt differ behavior approach team emploi strategi team member evolv specif rigid commun team adapt emploi variat combin strategi commun averag number benchmark case solv prei move step prei move step prei move time random time random direct time direct time tabl adapt commun team prei behavior team robust long basic strategi cope prei emploi consist strategi result averag team approach evolut team produc solut solv benchmark case case fail mechan predat prei make step rel locat remain make move time ran behav similarli team team util singl strategi fail task robust network work soccer soccer interest unpredict player team intercept case team member quickli adapt strategi cope situat determin team deal conduct test evolv solv benchmark pit prei behav differ encount evolut test commun team team predat act rigid expect adapt commun team flexibl agent summar tabl team robust unpredict prei commun prei noisi version origin familiar rigid role team catch prei time agent track errat strategi remain commun narrow margin adapt agent tend switch strategi role base current state easili unexpect prei action prei move team unabl adapt behavior consist agent evolv expect team deleg rigid specif role member toler noisi unusu long basic strategi valid coevolut perform cooper coevolut necessarili coevolut essenti task evolv good predat put section demonstr approach agent evolv solv task singl predat commun input shown figur evolv domain increment learn standard esp method section figur predat evolv longer improv fit process repeat time produc independ capabl predat predat put environ evalu prei captur task frame frame frame figur strategi individu evolv predat environ predat chase prei nearest direct unabl catch result support coevolut predat evolv catch prei move speed predat learn chase prei reduc distanc capabl prevent prei distanc individu evolv predat put chase prei nearest unabl catch prei run maintain distanc coevolut task evolv success cooper behavior discuss section found evolv central control time long autonom cooper control reason level perform central approach achiev level gener solv benchmark cooper approach time cooper coevolut task simpler make easier search solut decomposit special case speciat evolutionari system speciat wide maintain evolut techniqu island fit share separ popul encourag effici search solut space separ popul evalu jointli reward global tend converg heterogen polici work drive mechan cooper coevolut observ cooper predat consequ cooper popul evolut evolut gener cooper agent integr part singl make system system coordin infant learn coordin leg walk cooper coevolut agent learn cooper indirectli correl central approach agent directli evolv cooper indirect learn effici central control perform predat complet synchron coordin singl neural theoret advantag central control accompani nontrivi cost central control perform comput autonom control central control neuron weight neuron weight figur central evolut drastic larger search space explor central control coordin agent link extra disjoint control coordin abstractli popul special subtask explor combin subtask lead good solut practic difficulti central network evolut optim agent overwhelm theoret advantag coordin central control section reveal unexpect result predat evolv cooper solv task time faster predat commun predat make base predat prei theoret complex strategi evolv discuss section found team emploi singl strategi agent rigid specif commun team tend util variat combin strategi role delin subpopul converg optim specif function long agent perform role team solv task team member evolut commun place strong evolutionari pressur predat perform assign role assign role place simultan adapt agent begin converg agent behav begin nich turn yield higher predat begin converg cooper role domain effici solv agent domain captur configur hayn sen difficult agent guess exact locat agent achiev success captur agent agent effect coordin posit comparison lead potenti distinct cooper behavior cooper behavior agent cooper synchron captur posit agent cooper role domain strictli commun commun sourc divert team solut interest note domain encourag agent tend share strategi discov unoccupi captur posit occupi domain encourag agent develop perform specif role domain involv cooper behavior includ control elev effici serv control agent search web inform task constitut interest direct futur work experi report paper show evolv cooper neural network control team agent effici robust evolv singl central control effici natur method cooper call esp class problem call cooper commun make evolut effect identifi problem real world task fall categori appli approach studi wai deal chang environ main direct futur work area acknowledg research support part nation scienc grant bryant insight suggest test cooper gomez suggest adapt esp system refer learn control invert pendulum neural network ieee control system learn behavior robot team aaai workshop multiag learn adapt element solv difficult learn control problem ieee transact innat critic combin evolut learn acquisit syntax fourth intern workshop synthesi simul live system life mit press optim cooper knowledg sourc empir investig technic report boe advanc technolog center increment import start small annual confer cognit scienc erlbaum increment evolut complex gener behavior adapt solv control task intern joint confer artifici intellig morgan kaufmann comparison cellular encod direct encod genet neural network genet program annual mit press team intern journal comput intellig evolv behavior strategi predat prei adapt learn lectur note comput springer berlin crossov oper evolv team genet program annual nich method genet algorithm phd illinoi learn finit state control partial observ environ intern confer uncertainti artifici intellig pursuit biolog foundat technic report school cognit comput uk symbiot evolut neural network sequenti task phd depart comput texa austin technic report effici reinforc learn symbiot evolut machin form neural network effici adapt evolutionari parallel genet algorithm function optim fourth intern confer genet algorithm morgan kaufmann reinforc learn control action noisi domain technic report school comput scienc south australia cooper architectur evolv subcompon evolutionari link rat robot connect search cooper popul genet algorithm evolutionari cooper strategi evolut commun artifici machin evolut commun artifici organ workshop artifici life genet reinforc learn neural network fourth intern confer genet san morgan kaufmann genet reinforc learn neurocontrol problem machin cellular encod appli neurocontrol sixth intern confer genet san morgan kaufmann
Agents/1290 1 midwest artifici intellig cognit scienc confer miami march april analysi design mase agenttool abstract paper overview work air forc institut technolog multiag system engin methodolog agenttool environ research discov method techniqu engin practic multiag system abstract provid multiag system develop distribut softwar system introduct multiag system brought disciplin effort build robust applic tradit wai design softwar fit multiag paradigm past attempt creat tool methodolog build system garijo gonzalez tool methodolog specif agent architectur lack suffici detail adequ support design complex system develop methodolog complimentari environ develop heterogen multiag system methodolog develop multiag system engin tool build support methodolog agenttool deloach typic artifici intellig view agent agent requir social agent simpl softwar process interact meet system goal case agent interact entir system exhibit seemingli intellig behavior view agent conveni possess intellig handl intellig system compon equal framework work aim larger problem build possibl dynam system futur comput build complex distribut agent work scott deloach air forc institut technolog graduat school engin manag depart electr comput engin air forc cooper agent heterogen environ sycara describ challeng multiag system problem alloc task individu coordin agent control make multipl agent act coher reason agent state reconcil conflict goal engin practic multiag system research attempt answer sixth engin practic multiag provid framework solv challeng abstract provid multiag system develop distribut softwar system accomplish mase number graphic base model describ type agent system interfac definit intern agent design multiag system engin research afit develop tool build practic agent system develop multiag system engin methodolog deloach deloach wood defin multiag system term agent class organ defin organ term agent commun basic phase analysi design includ captur appli refin role captur user requir turn system goal defin system level extract case defin sequenc chart appli case step step defin initi set system role commun path system goal role identifi refin extend initi set role defin task accomplish goal refin role step goal hierarchi concurr task diagram requir case sequenc diagram role agent class agent architectur captur goal appli case refin role creat agent class construct assembl agent class system design analysi design figur mase methodolog design transform analysi model construct implement multiag system design phase creat agent construct assembl agent system design creat agent defin specif agent class fill role defin analysi phase determin number type agent class construct agent class defin intern compon agent class analyst perform step parallel construct assembl agent class step complet defin system defin system deploi design defin number individu system specif item captur goal step mase methodolog captur initi system specif transform structur set system depict goal hierarchi shown figur mase goal defin object construct inherit goal context determin file delet modifi detect notifi admin system file violat detect user attempt modifi file detect notifi administr host violat notifi administr violat detect notifi administr login violat determin invalid user login ensur admin receiv notif notifi administr login violat figur goal hierarchi diagram step captur identifi goal structur goal analyst identifi goal distil essenc set requir requir includ detail technic user formal specif captur explicitli goal chang detail step activ involv accomplish analyst structur identifi goal goal hierarchi diagram goal hierarchi goal analyst organ goal import level hierarchi goal roughli equal scope analyst identifi satisfi parent goal analyst associ goal role set agent class satisfi goal appli case appli case step crucial step translat goal role task analyst draw case system requir user case narr descript sequenc event defin desir system behavior exampl system behav case determin actual commun requir multiag analyst restructur case sequenc shown figur sequenc diagram depict sequenc event multipl role defin minimum commun place role role identifi step form initi set role fulli defin system role step analyst event identifi defin task refin role step mase ensur identifi role develop task defin role user report notifi acknowledg figur sequenc diagram behavior commun pattern role identifi sequenc diagram develop appli case step system goal defin captur goal ensur system goal account associ goal specif eventu plai agent final design role abstract descript expect function similar notion actor plai offic organ goal gener map singl role situat combin multipl goal singl role conveni effici base standard softwar engin concept tempor factor includ natur distribut resourc special interfac issu role captur role model shown figur user figur role model role task creat part mase methodolog transform role agent class defin intern agent behavior accomplish defin task transform specif agent function function defin intern compon agent detail agent particip figur show detail version mase role model oval role denot task role execut order accomplish goal line node protocol task protocol defin seri messag task work cooper arrow protocol line point initi protocol respond task detect file delet detect login determin valid determin valid detect fail login invalid file delet fail login invalid login notifi invalid file modif file notif determin valid notifi login notif notifi user detect file delet figur mase role model defin concurr task finit state automaton specifi messag role task concurr task intern process activ state concurr defin higher complex interact protocol requir coordin multipl agent shown verifi correct oper interact protocol base concurr task deloach mase concurr task defin notifi user task shown figur wait figur concurr task diagram syntax transit notat interpret transit event trigger receiv number argument condit guard messag transmiss set argument item option transit guard receiv messag multipl transmiss event separ action perform state written function user displai creat agent class creat agent agent class identifi role document agent class shown figur agent class diagram depict agent class box line connect agent class goal gener defin map list agent class agent class design combin multipl role singl agent class map singl role multipl agent class agent inherit commun path path role respect class design assign role agent organ system defin make organ desir combin role share high volum messag traffic determin role concept volum messag traffic import violat notifi notifi figur agent class diagram user user construct design perform construct assembl agent parallel step close agent architectur defin assembl agent implement method defin construct mase defin coordin protocol agent consist commun class initi respond commun class diagram pair finit state machin defin particip agent class side shown figur initi begin send messag syntax commun class diagram similar concurr task diagram main differ concurr task concurr task includ multipl role task binari exchang individu agent assembl agent step intern agent class creat robinson describ detail assembl agent set standard architectur process simplifi architectur model languag combin abstract natur tradit architectur descript languag object constraint design detail failur figur commun class diagram system final step mase defin configur actual system implement system investig specif design dynam mobil agent system defin system architectur diagram show locat agent system system undefin implement program languag commun made pure softwar engin put time made part requir agenttool agenttool system attempt implement tool support enforc mase agenttool implement step mase autom support transform analysi model design model agenttool user interfac shown figur menu top access system includ persist knowledg base deloach verif deloach code gener button left add specif item diagram text window displai system messag mase diagram access tab panel top main window mase diagram design manipul graphic window panel type object text select object window enabl relat diagram access figur role defin collect concurr task user select regist research task click task panel tab visibl user access diagram select tab figur agenttool goal hierarchi diagram figur agenttool role model figur agenttool concurr task diagram part agenttool appeal abil work piec system level abstract mirror abil mase increment add detail oper agenttool implement capabl mase step work repres current diagram tab show move methodolog step system analysi design diagram tab main window order tab mase select tab left current pane move methodolog select tab move select object control diagram includ reach valid mase step select task tab concurr task diagram visibl select tab concurr task diagram design system agenttool design multiag system agenttool begin agent class diagram shown figur exist agent defin agent class defin add agent class agent class diagram ad add system connect agent class move section agenttool support gener matter person choic figur agenttool class diagram defin agent class defin detail commun class diagram button add state panel button add select state design verifi point creation verifi command verifi menu deloach agenttool verif process ensur specif deadlock free error verif result highlight section shown figur transit yellow highlight potenti error detect verif routin figur agenttool error agent class intern compon manipul manner similar agenttool panel figur agent class ad layer complex compon intern compon state diagram possibl addit beneath figur agenttool agent class compon design add detail design inform lower level abstract figur compon state diagram architectur tab lead compon state diagram diagram compon state diagram defin dynam behavior compon diagram addit compon connector defin compon design support recent work agenttool includ develop support transform transform set analysi model design model perform design assign role specif agent class assign design appli transform analysi model basic stage transform stage transform attempt determin protocol event concurr task belong case automat system determin protocol event system simpli design make choic shown figur system automat determin protocol bottom event belong design option design made system carri remain transform figur transform user input protocol determin transform continu creat intern agent compon concurr task role plai agent system copi concurr task definit intern state machin ensur behavior defin role transfer agent plai role stage intern state machin compon annot prepar extract actual prepar phase find start end locat ensur agent final extract intern compon separ diagram replac method call intern compon state machin retain intern process coordin mobil recent work mase agenttool includ research provid abil model mobil agent initi step model mobil includ move activ concurr task state move activ basic request agent move locat actual implement move activ assum part environ agent execut activ return boolean move occur simpl addit analysi phase analyst move request abil decid move success simpl model analysi mobil complex design phase design mase provid capabl inform compon move request provid capabl compon store current restart move design carri complex design similar previou develop implement agenttool summari paper present overview multiag system engin methodolog agenttool environ mase agenttool develop tandem provid guidanc practic support build dynam system research support grant air forc offic scientif research dayton area graduat studi institut view express articl author reflect offici polici posit unit state air depart govern refer multiag system submit intern journal softwar engin knowledg novemb agent behavior concurr intern confer autonom canada june scott deloach mark wood develop multiag system intellig agent vii intern workshop agent languag springer lectur note springer gonzalez survei orient methodolog intellig agent agent languag lectur note comput vol berlin kendal agent role role abstract multiag system analysi design intern workshop intellig agent inform process septemb captur structur analysi pattern european confer pattern languag program bad juli verif agent behavior model intern confer artifici intellig page deloach automat verif multiag eleventh annual midwest artifici intellig cognit scienc page marc raphael scott deloach knowledg base multiag system nation aerospac electron confer octob robinson compon base approach agent specif ms school air forc institut technolog air forc base march design specif reconfigur multiag system ms school air forc institut technolog air forc base march transform analysi model design model multiag system engin methodolog ms school air forc institut technolog air forc base march ai magazin vol pp deloach overview multiag system engin ciancarini softwar engin intern workshop june lectur note comput scienc vol springer
ML/1291 6 combin label unlabel data blum school comput scienc carnegi mellon pa tom mitchel school comput scienc carnegi mellon pa abstract problem larg unlabel sampl boost perform learn algorithm small set label exampl set descript partit distinct motiv task learn classifi web page descript web page partit word occur word occur hyperlink point page assum view suffici learn label goal view unlabel data augment smaller set label exampl presenc distinct view suggest strategi learn algorithm train separ algorithm predict unlabel exampl enlarg train set goal paper provid analysi framework gener problem learn label unlabel data provid empir result real data indic unlabel exampl lead improv practic part provid extend version paper annual confer comput learn page research support part darpa program contract nsf nation young investig grant learn misclassif independ interest introduct machin learn unlabel exampl significantli easier label classif program electron visit web site download web page interest cs faculti member home page train system automat classifi web typic reli hand label web page label exampl fairli obtain requir human effort web hundr million unlabel web page gather web crawler learn algorithm advantag unlabel data learn problem interest addit featur domain natur inform kind inform web page text document kind inform anchor text attach hyperlink point page web problem characterist mention cheap unlabel exist redund sourc inform suggest learn strategi initi small set label find weak predictor base kind find phrase web page weak indic page faculti home find phrase link indic page point faculti page attempt bootstrap weak predictor unlabel data search page point link phrase exampl train learn algorithm base word text call type bootstrap close connect bootstrap incomplet data question reason goal address question develop theoret framework understand issu involv approach provid result learn presenc classif give preliminari empir result classifi web page section encourag context gener question unlabel exampl augment label data point view standard pac assumpt address issu notion data distribut target function discuss relat approach combin label unlabel data formal framework defin model instanc space correspond pair assum view suffici correct classif distribut concept class defin assum label exampl probabl consist target function consist target function denot combin target concept entir observ label mean assign probabl expect unlabel data amplifi small label sampl question len standard pac learn set distribut talk target function satisfi condit assign probabl set exampl pair compat legal framework notic larg concept class high complex distribut set compat target concept simpler smaller hope unlabel exampl gain target concept yield inform reduc number label exampl learn algorithm hope tradeoff number unlabel exampl number label exampl illustr figur graph gd edg repres exampl probabl solid edg repres exampl observ finit sampl notic label learn algorithm deduc exampl belong connect compon classif coordin relev target concept coordin unlabel coordin produc neg nonzero probabl pair give inform tightli independ classif compon set random neg explor gener idea section show weak hypothesi boost unlabel data condit independ properti target class learnabl random classif term set uniform distribut distribut teacher model exampl suppli oracl bipartit graph problem view distribut weight bipartit write gd gd clear context side gd node point side node point edg probabl give edg weight equal probabl remov vertex view probabl figur concept partit graph defin extent partit compat weight cut induc compat target function distribut defin number assum full compat set unlabel exampl similarli defin graph gs bipartit graph edg notic exampl belong connect compon classif web page exact content correspond edg left endpoint requir label high level view relat approach gener add pac model notion compat concept data distribut postul target concept compat distribut unlabel data reduc class smaller set function compat intersect concept class cd partial unlabel data specif notion compat previou section imagin postul form compat set discuss relat model analyz combin label unlabel data standard set problem analyz assum data gener simpl parametr model assumpt castelli cover quantifi rel valu label unlabel data bayesian optim learner em wide practic learn data miss analyz type set common specif assumpt posit exampl gener gaussian center point neg exampl gener gaussian center point unknown learn algorithm exampl gener posit point neg point probabl hypothesi linear separ defin hyperplan bisect orthogon line segment parametr model rigid set incorpor hypothesi perfect classifi significantli restrict underli probabl distribut effect forc commit target concept case class linear concept underli distribut unlabel negat knew underli target concept left unlabel data set assumpt compat function concept probabl distribut attempt broadli distribut complet commit target function complet uncommit approach unlabel yarowski context disambigu closer spirit nice view model problem yarowski consid word dictionari definit type life form factori text document instanc word goal algorithm determin mean intend yarowski make unlabel data fix highli instanc word intend whichev mean learn algorithm learn make predict base local achiev good result label exampl unlabel yarowski approach context instanc word distinct document word local context surround word bipartit graph node left repres number instanc node repres local assumpt instanc document local context suffici determin word assumpt exampl connect compon classif rote learn order feel section simpl problem rote learn case partit consist learn algorithm simpli output dont label deduc train data compat assumpt jx jx imagin number gather unlabel exampl feasibl label singl view label exampl order cover substanti fraction probabl probabl label exampl order achiev low error view potenti smaller number label exampl larg unlabel sampl extrem unlabel sampl edg graph gd nonzero confid label label connect compon gd connect compon gd probabl mass probabl label label deduc algorithm graph gd connect achiev error ffl exampl view achiev tradeoff number label unlabel exampl graph graph edg observ observ unlabel number connect compon drop compon merg final compon gd set select random subset probabl label random chosen remain portion deduc algorithm js jsj make plausibl context web document small set attribut document number edg compon formula approxim jsj jsj analog equat recent result studi random graph process describ quantit expect compon converg gd unlabel base properti distribut connect compon gd ff minimum cut cut sum weight edg ff probabl random cross specif minimum cut sampl span tree includ edg minimum cut expect number unlabel sampl occur cut span tree includ edg cut karger show suffici theorem show unlabel sampl suffici ensur span tree found high probabl ff fff unlabel sampl suffici ensur number connect compon sampl equal number minim number label exampl point posit similarli distribut uniform subject place probabl illeg exampl legal probabl reduc observ graph connect compon span tree minimum cut compon karger log unlabel exampl suffic simpl case analyz easili principl bound number connect compon expect number label exampl produc perfect hypothesi imagin algorithm select unlabel exampl term number unlabel exampl theorem model edg independ observ graph probabl pe weight edg expect number edg chosen karger concern network reliabl problem edg independ probabl probabl connect hard convert set concern fix sampl independ distribut defin pe karger handl formal ff greedi process cut ff gd edg process repeat connect compon cut number connect compon remain ff constant karger mu larg singleton compon remain upper bound expect number label exampl cover ff lower bound greedi process made expect number edg cross cut pac learn larg input space previou section provid tradeoff number label unlabel exampl set jxj small algorithm perform move difficult case jxj larg goal polynomi descript length exampl target concept show condit independ assumpt distribut target class learnabl random classif standard pac initi weak predictor boost arbitrarili high accuraci unlabel exampl target function distribut satisfi condit independ assumpt fix nonzero pr pr pr pr independ label assum word page word hyperlink point independ condit classif plausibl start point page construct user made link theorem view show plausibl bipartit graph view section order state defin function function ffl word web page predictor page homepag fraction probabl page homepag higher probabl homepag word usual notion weak requir notic simpli predict worth note predictor condit impli ffl condit impli ffl theorem learnabl pac model classif condit independ assumpt learnabl model unlabel data initi predictor condit independ assumpt impli concept class learnabl statist queri model learnabl unlabel data initi predictor prove conveni defin variat standard classif model rate posit exampl rate neg exampl classif set true posit exampl incorrectli label probabl true neg exampl incorrectli label probabl fi extend standard model requir ff fi goal learn algorithm set produc hypothesi target function respect data case lemma concept class learnabl standard classif learnabl easi distribut target function pair function give probabl theorem interpret show access slight bia unlabel data polynomi time discov fact classif long ff fi run time polynomi ff target function proof ff fi learn algorithm loss assum ff fi learn simpli flip posit label neg label independ probabl result standard classif rate run algorithm learn presenc standard classif definit run time polynomi ff fi dealt make number guess evalu separ test turn evalu step requir lower bound extrem imposs distinguish case posit ff case neg fi ff fi proce data set exampl label creat hypothesi produc flip label random posit exampl run classif hypothesi produc flip label random neg exampl run algorithm expect good procedur ff fi view probabl distribut experi select separ test set hypothesi select minim quantiti observ label straightforward calcul show solv ff quantiti estim noisi linearli relat quantiti measur true error select hypothesi minim observ suffici larg sampl size polynomi result note empir error minim empir error ff fi empir error hypothesi half empir error true target concept hypothesi approxim minim properti true error suffici small function approxim minim approxim minim true error classif model thought kind classif result requir rate stronger statement present suffic assum sum ff fi proof theorem target concept probabl random posit qc condit independ random independ noisi label ff fi equat sum rate satisfi ff fi qc assumpt ffl ffl quantiti ffl appli lemma theorem point make analysi condit minim empir error noisi data label weak hypothesi correspond minim true error dealt proof lemma measur error posit neg region equal weight experi section kind reweight handl paramet equal correspond error measur proof lemma empir perform algorithm sensit issu relax assumpt made fairli stringent assumpt shown exampl target function show long condit independ assumpt significantli weaken unlabel data boost predictor proof theorem involv reduct problem learn classif relax assumpt add extent assumpt relax target function pair distribut pair assum definit extrem close replac assumpt ffi ffi maintain condit independ view underli distribut probabl select random posit independ random posit probabl select random posit independ random neg fulli scenario label probabl label posit issu simpli assum previou obtain inform label data obtain predictor care unlabel data theorem theorem hypothesi ff fi ff produc usabl classif ff fi produc usabl fi classif ff fi ff assumpt ensur quantiti small proof proof straightforward calcul ff fi fi fi ff experi order test idea appli problem learn classifi web page experi motiv larger research effort appli machin learn problem extract inform world wide web data experi consist web page collect comput scienc depart web site texa page hand label number categori experi consid categori home target home page posit exampl page neg exampl web page page web page consid bag word web bag word underlin link point web page page classifi train separ naiv algorithm refer naiv algorithm empir observ success varieti task algorithm tabl set label exampl set unlabel algorithm creat smaller pool unlabel exampl iter procedur train distinct naiv classifi base portion naiv classifi base portion classifi examin unlabel set select exampl confid label exampl confid label neg select ad label assign classifi select pool replenish draw exampl random earlier implement select exampl directli larger set obtain result smaller pool forc select data ffl set label train exampl ffl set unlabel exampl creat pool exampl exampl random loop train classifi consid portion train classifi consid portion label posit neg exampl label posit neg exampl add exampl randomli exampl replenish tabl algorithm experi report train naiv algorithm paramet set exampl repres underli distribut gener experi conduct determin algorithm successfulli unlabel data outperform standard train naiv classifi web page select random test set remain data gener label set posit neg exampl drawn random remain exampl drawn unlabel pool experi conduct paramet set compar train naiv classifi label train exampl train classifi defin combin base output classifi naiv assumpt condit combin classifi comput probabl class instanc multipli probabl output jx jx result experi summar tabl number shown test set error rate averag random split row tabl show test set accuraci classifi form row show accuraci classifi form note data default hypothesi predict achiev error rate figur plot error versu number iter run notic type classifi classifi outperform classifi form train combin classifi achiev error rate half error achiev train classifi due fact hyperlink fewer word capabl express accur approxim target function experi involv data set target function experi determin gener behavior determin pattern behavior observ result provid advantag unlabel data open question model unlabel data augment label base view redund complet correl theoret model target function distribut optim pair function expect inconsist exampl exampl notion distribut term compon minimum unlabel exampl potenti classifi classifi combin classifi train tabl error rate percent classifi web page home page top row show error train label exampl bottom row show error label unlabel exampl iter default figur error versu number iter run experi prune target concept reduc number label exampl learn open question extent consist constraint model mutual independ assumpt section relax provabl result util unlabel data preliminari result present suggest method unlabel data potenti benefit studi conjectur practic learn problem fit approxim fit model problem learn classifi segment broadcast learn identifi segment presid set video set audio cross product small sampl label learn weakli predict recogn spot imag presid recogn spot voic background present appli larg volum unlabel improv accuraci classifi similar problem exist percept learn task involv multipl sensor mobil robot learn recogn open doorwai base collect vision sonar laser rang sensor import structur problem instanc partit subcompon perfectli principl make larg volum unlabel instanc easili collect refer castelli tm cover exponenti label sampl pattern recognit januari castelli tm cover rel label unlabel sampl unknown mix paramet ieee transact inform novemb cy quek learn extract symbol knowledg world wide web technic carnegi mellon januari pac learn classif applic tree induct fourteenth intern confer machin page juli ap nm db rubin maximum likelihood incomplet data em algorithm journal royal statist societi richard duda peter hart pattern classif scene analysi ghahramani jordan learn incomplet data em approach advanc neural inform process system morgan goldman kearn complex teach journal comput system februari ag hauptmann mj witbrock multimedia inform acquisit retriev intellig multimedia inform jackson tomkin comput model teach annual workshop comput learn page morgan karger random sampl network design problem annual acm symposium theori page karger random sampl network design problem journal version kearn effici learn statist queri annual acm symposium theori page lewi ringuett comparison learn algorithm text categor annual symposium document analysi inform page joel venkatesh learn mixtur label unlabel exampl parametr side inform annual confer comput learn page acm mj witbrock ag hauptmann improv acoust model watch technic report carnegi mellon march yarowski word disambigu rival method annual meet associ comput page
Agents/1292 1 commit contract strateg tuoma sandholm washington depart comput scienc st mo breach abstract victor lesser massachusett depart comput scienc ma negoti system consist contract bind contract agent capit uncertain futur event contract solv problem contract impract due larg number interdepend unanticip futur event event mutual observ level commit contract mechan agent capit uncertain futur event possibl decommit contract base local reason decommit penalti assign agent freed oblig agent pai penalti parti concern agent reluct decommit chanc parti decommit case agent freed collect penalti shown equilibrium analysi level commit featur contract mechan expect payo contract parti make contract individu ration full commit contract asymmetr belief discuss di erent decommit mechan introduc compar practic prescript market design provid level commit contract optim er web materi base work support nation scienc foundat career award grant grant short earli version paper nation confer arti cial intellig introduct import autom negoti system agent reason technolog push grow standard commun separ design agent belong di erent organ interact open environ safe carri transact low reason strong applic pull comput support oper make level wit advent small transact commerc internet commun hundr electron trade site incorpor autom negoti capabl industri trend virtual dynam allianc agil advantag economi scale respond larger order su er scale multiag technolog facilit autom format dynam allianc order basi autom contract autom save labor time human save comput agent ectiv nding bene cial contract contract combin human strateg combinatori complex set tradit multiag negoti mechan contract parti back matter futur event unravel andersson ephrati krau cheng contract pro tabl agent view pro tabl view post contract tabl ant pro tabl post full commit contract unabl capit gain probabilist futur event provid multiag system consist cooper agent incorpor form decommit possibl order agent accommod event origin contract net protocol agent contract task send termin messag cancel contract partial ful lled contract agent mind lose part ort monetari role decommit possibl cooper agent studi meet schedul contract approach sen cooper coordin protocol unlik system cooper multiag system consist agent requir case agent follow speci ed strategi interact mechan consid perspect game mechan rule strategi viewpoint agent social outcom follow contract research game theori util potenti provid probabilist futur event contract agent oblig contract made futur event game method expect payo parti contract compar full commit contract deal enabl contract full commit contract agent prefer contract agent prefer major problem contract autom negoti parti agent repres futur contract optim parti program knowledg autom agent prohibit labori error prone contract anticip small cumbersom number relev futur event monitor domain event domain task arriv resourc break negoti event ect oblig origin contract condit futur event ect origin contract origin contract depend combin futur event rosenschein potenti combinatori futur di erent lead potenti combinatori contract size tabl repres addit practic di culti fundament problem event observ agent agent incent lie contract parti event case event disadvantag observ agent contract requir event veri cation mechan manipul prohibit complic costli level commit contract avoid drawback instrument capit possibl provid probabilist futur event condit contract futur mechan built contract decommit point time achiev contract decommit agent agent freed oblig simpli pai decommit penalti parti call contract level commit contract decommit penalti level commit method requir explicit condit futur agent condit dynam event veri cation mechan requir paper present formal justi cation ad decommit featur contract mechan principl assess decommit penalti studi econom law assess penalti agent breach contract breach occur penalti partial meet commonli motiv agent contract level commit explicitli decommit contract predetermin price activ method util potenti provid uncertain futur turn decommit possibl contract expect payo contract parti practic motiv level commit goal level commit contract mechan exibl case commit agent level secur case full commit full commit contract view end spectrum commit free contract end level commit contract span entir spectrum base decommit penalti chosen practic reason level agent pro accommod domain event task arriv resourc break agent contract event made cial decommit studi constant ow time cost search partner good bad decommit penalti function accept time condit event negoti environ dynam negoti contract task set basi sandholm analysi paper contract penalti negoti chang time agent pro accommod negoti event er er accept messag event make contract cial agent decommit contract backtrack instrument distribut search arti cial intellig work unlik tradit backtrack techniqu distribut search control pro tabl risk term search mean move search focu global search space commit decommit unreason space explor agent avoid riski commit task alloc agent accept task set contract task set separ full avoid agent stand er agent contract task handl pro level commit agent accept task set chanc task handl decommit pro tabl construct composit contract basic contract contract agent depend contract agent level agent cial contract anticip synerg contract make sequenc bene cial contract sequenc agent backtrack initi part sequenc save comput time autom negoti comput contract approxim practic sandholm level commit agent bid base rough calcul agent win agent invest calcul contract longer bene cial light ned agent decommit fact win bidder carri ned calcul save comput negoti carri faster agent bid base comput make local feasibl check unnecessari bid full agent make handl oblig pend bid accept major portion contract softwar agent resourc level agent carri feasibl check front agent end decommit contract feasibl avoid feasibl check save negoti carri faster agent bid base comput speed negoti process parallel agent make mutual er multipl agent case agent backtrack agent address parti parallel address time block wait answer address agent er contract parti commit commit strateg pareto cienci realloc risk contract price decommit penalti pareto cienci improv make risk agent carri risk risk agent agent higher expect payo substanti advantag level commit contract formal discuss reason level commit contract advantag advantag level commit intuit appeal practic motiv level commit reason obviou level commit contract superior full commit contract agent pro decommit smaller loss victim comput decommit penalti paid decommit sum contract parti payo view post full commit contract higher sum expect payo contract parti level commit contract incorpor inform expect inform nonneg result theori hold game parti gain inform multiag inform neg expect prison dilemma simpl player separ press cooper defect base button agent receiv payo tabl agent domin strategi sum agent payo outcom pareto cient remov label button agent press expect sum payo column player cooper defect row cooper player defect tabl prison dilemma game row player payo list rst expect inform obviou level commit incorpor higher sum expect payo contract parti full commit contract obviou level commit contract higher pareto cienci full commit contract agent decommit agent decommit er decommit penalti current contract ration agent reluct decommit chanc parti case agent freed contract pai decommit collect decommit penalti parti contract parti reluct decommit reason due reluct contract end cientli decommit pai penalti sum contract parti payo higher agent rest formal show level commit contract superior full commit contract strateg breach section present main model analysi level commit contract show level commit contract enabl contract improv expect payo contract parti show game agent futur involv uncertain analysi sequenti simultan decommit mechan section compar equilibria di erent decommit mechan section discuss set agent futur involv uncertain event section discuss game posit chang decommit game section present agent distribut futur event common knowledg act equilibrium deriv realiti agent belief section practic prescript market design section conclud present futur research direct compar level full commit contract analyz contract situat perspect agent attempt maxim expect payo call agent contractor agent de ne full commit contract de nition full commit contract contractor de ned contract oblig includ agent perform contribut lend contractor pai full commit contractor payo contractor pai contract payo paid contract focu set contract agent contract agent probabilist inform contract agent chang stem agent resourc fail chang due base rough comput contract di erent ned comput contract chang base er framework result speci sourc chang present result set chang stem option speci agent receiv er assum model er descript price concern assum agent involv contract contractor task handl handl limit resourc contractor er probabilist ant probabl densiti function contractor receiv correspond outstand er payo payo receiv contract made er probabilist probabl densiti function receiv correspond outstand er payo variabl assum statist independ distribut assum common knowledg contractor contractor make wait er call option null deal de nition null agent make contract contractor wait expect payo wait expect payo contractor make full commit contract instrument call level commit contract de nition level commit contract contractor descript agent perform contribut lend contract price contractor pai contractor decommit penalti contractor pai penalti contract oblig parti bound contract descript contractor pai contract price decommit penalti pai penalti contract oblig parti bound contract descript contractor pai contract price contractor decid decommit decid decommit contractor realist practic contract perspect easi er full commit contract interpret expect payment er level commit contract contract set consist stage rst call contract agent contract null futur event unravel call decommit agent decid decommit futur event unravel equilibrium decommit game ect agent prefer contract contract game decommit game analyz nash equilibrium iter domin solut concept contract game analyz respect individu ration de nition individu ration agent agent expect payo contract higher agent expect payo null deal contract individu ration individu ration agent contract price contractor decommit penalti decommit penalti price contractor full commit er price full commit er ant probabl densiti function ant probabl densiti function pa contractor decommit decommit pb tabl symbol paper contract ir agent contract time discount nash equilibria contract game full commit contractor strategi er contract price contract ir er null deal contractor er nash equilibrium exist de ne contract ir agent bargain theori address choic ir incorpor form time discount deadlin bargain cost bargain process assert desir properti chosen contract ful ll compar contract osborn address choic ir contract paper present algorithm comput ir contract price decommit maxim sum contract parti payo restrict attent contract agent paid decommit intuit appeal recent paper show restrict crucial exist ir contract maxim sum agent expect payo exist assum agent decommit de nition decommit contractor decommit decommit agent decommit er pai decommit contract agent believ high probabl parti decommit save agent decommit penalti make agent receiv decommit penalti parti game type di er signi cantli base agent decommit sequenti simultan case analyz section kei distinct decommit point agent agent decommit time reveal decommit agent decommit essenc simultan sequenti decommit sequenti decommit agent declar decommit agent present case reveal decommit rst case contractor reveal rst analog game tree present figur altern type level commit contract di er base agent decommit agent decommit penalti decommit agent pai decommit analyz decommit game iter domin solut concept speci start reason agent action leav game tree proce backward begin game contractor move decommit hold contract agent pai decommit penalti payo contractor move decommit probabl pa put contractor decommit decommit pa inequ nonneg contractor enter contract strictli ir decommit penalti nonneg inequ def pa make ad hoc assumpt case agent bother decommit assumpt result hing contract game level commit contract ρ full commit contract contract null contract decommit game natur natur natur decommit decommit contractor decommit contractor decommit ρ contractor decommit contractor decommit figur game game tree repres altern di erent game agent pai decommit penalti decommit agent pai decommit payo mechan di er dot line show inform set model aspect contractor er vice versa contractor payo neg pai task handl ir constraint state expect payo contract expect payo contractor ir constraint state expect payo contract game exist full commit contract level commit contract contractor decommit decommit penalti chosen high bound case decommit bound decommit penalti chosen high decommit assum bound full commit contract subset level commit reason hold contract agent penalti contract agent pai penalti decommit full commit contract subset level commit pareto cienci maxim sum contract parti expect payo exist ir full commit exist ir level commit contract addit level commit contract full commit enabl deal imposs full commit theorem game ned contract ir agent level commit contract proof full commit contract satisfi ir constraint requir imposs level commit contract constraint contractor ir db db substitut approxim inequ contractor ir constraint sati ed ir constraint substitut approxim inequ ir constraint sati ed game ir constraint sati ed wide rang level commit full commit contract level commit de ned satisfi ir valu exist constraint sati ed analyz contract valu satisfi ir qualit di erent case case chanc agent decommit case chanc contractor decommit happen maximum chanc decommit occur program model ir constraint case make algebra tractabl version ir constraint equat assum loss gener decommit penalti satisfi ir constraint plot figur left boundari program model check boundari plot figur left constraint sati ed case plot grai area figur contract ir agent decommit iter domin equilibrium ir constraint contractor ir constraint ir constraint agent decommit ρ ir constraint decommit ir constraint ρ contractor ir constraint ir constraint ir constraint contractor decommit contractor ir constraint figur decommit penalti satisfi agent ir constraint game case agent decommit case contractor decommit case contractor decommit case contractor decommit contractor decommit er note arbitrarili high decommit contractor ir constraint quadrat equat solut formula ir constraint ρ approxim approxim quadrat equat solut formula violat put open region type contract ir agent decommit iter domin equilibrium region color grai figur case decommit high decommit contractor decommit word decommit threshold contractor ir constraint approxim approxim quadrat equat solut formula violat ir constraint quadrat equat solut formula open region type contract ir agent decommit iter domin equilibrium region color grai figur middl addit case occur instanc gener trivial case occur contract parti decommit contract ir decommit penalti case ir constraint sati ed equal contract price set higher contractor highest contractor penalti contractor decommit contract price lower lowest decommit penalti decommit contract trivial penalti paid contract lead bene payo contract parti null deal game instanc contract lowest contractor highest trivial case occur addit enabl deal imposs full commit level commit contract cienci deal full commit contract occur level commit contract emul full commit contract set penalti high bound level commit improv cienci deal chanc contractor er lower expect chanc er higher contractor expect theorem cienci improv full commit contract game ned bound bound game level commit contract contractor expect payo expect payo level commit contract proof prove condit proof analog full commit contractor payo construct level commit contract expect payo agent contract price contractor decommit penalti proof show set set decommit high decommit bound contractor payo contractor expect payo expect payo call di erenc contractor payo full commit contractor payo contractor decommit contractor expect payo scenario decommit greater full commit contract long breach contractor occur probabl pa remain tailor contractor expect payo compar full commit contract put expect payo contractor expect payo pa pa chosen expect payo parti condit full commit contract pareto cient simultan decommit simultan decommit agent declar decommit simultan decommit contractor contractor altern type level commit contract di er base agent decommit agent decommit penalti decommit agent pai decommit figur present game tree contract type game type discuss separ contract game decommit game level commit contract ρ full commit contract contract null contract natur natur natur decommit decommit contractor decommit pb contractor ρ contractor decommit contractor figur decommit pai game payo repres decommit pai game dash line repres agent inform set model aspect contractor er vice versa model aspect contractor reveal decommit observ decommit vice versa pai decommit section discuss simultan decommit game mechan agent decommit penalti decommit set call figur pb probabl decommit variabl equilibrium depend contractor decommit pb rule type contract agent paid decommit inequ def pb decommit threshold contractor contractor er contractor decommit probabl contractor decommit decommit pa pa rule type contract agent paid decommit inequ def pa decommit threshold er decommit probabl decommit pb inequ de ne contractor strategi condit de ne contractor strategi condit variabl pb de ned equat condit variabl pa de ned equat equat de ne nash equilibria decommit game contractor ir constraint rst row correspond correspond decommit integr row correspond contractor integr correspond contractor decommit ir constraint bound contractor decommit chosen high contractor decommit lower realiz case contractor decommit bound decommit chosen high decommit greater realiz case decommit assum bound full commit contract subset level commit pareto cienci maxim sum contract parti expect payo exist ir full commit exist ir level commit contract addit level commit contract full commit enabl deal imposs full commit theorem game contract individu ration agent level commit contract proof full commit contract sati es ir constraint requir imposs analyz level commit contract choic work qualit di erent case case chanc agent decommit nonzero probabl agent decommit uniqu nash equilibrium plot di figur nash equilibrium decommit threshold di er exist nash equilibria proper rang nash equilibria satisfi agent ir constraint program model equat ir constraint make algebra tractabl version equat assum loss nash equilibrium curv curv truth decommit curv truth decommit nash equilibrium curv nash equilibrium curv ρ curv truth decommit figur nash equilibrium decommit threshold game di erent valu decommit penalti nash equilibrium deviat decommit chanc agent decommit gener rst task check boundari valid model boundari plot figur boundari turn line exist boundari greater plot valid boundari ir decommit contractor ir ir ir contractor decommit contractor ir contractor ir ρ figur ir region decommit game grai area qualit di erent region contract ir agent equilibrium decommit game dark grai area agent decommit light grai area agent decommit curv repres ir constraint valid constraint program model requir agent curv ir constraint root constraint sati ed side curv ir constraint held equal figur agent ir constraint induc bound ir region root ir side ir constraint sati ed dark grai area figur repres valu decommit penalti valid constraint program model ir constraint sati ed exist decommit threshold form nash nonzero probabl agent agent higher expect payo contract numer pick contract nash decommit threshold figur contractor expect payo approxim approxim agent expect payo higher contract ir agent su ce prove theorem illustr present type equilibria occur case contractor decommit contractor decommit decommit contractor ir constraint case game proven ir constraint game proven approxim open region type contract ir agent equilibrium region color light grai figur case decommit decommit contractor decommit contractor ir constraint case game constraint proven approxim ir constraint game proven open region type contract ir equilibrium region color light grai figur case trivial case contract agent ir contract ir decommit decommit penalti decommit agent payo contract agent payo contract contract ir agent agent payo contract decommit occur payment transfer addit enabl deal imposs full commit level commit contract cienci deal full commit contract occur level commit contract emul full commit contract set penalti high bound level commit contract improv cienci deal chanc contractor er lower expect chanc er higher contractor expect theorem cienci improv full commit contract game ned bound bound game level commit contract contractor expect payo expect payo level commit contract proof proof theorem level commit contract construct agent decommit agent game game proof theorem appli condit full commit contract pareto cient pai decommit section discuss simultan decommit game mechan agent pai decommit penalti agent decommit set call figur game type contractor decommit pb pb rule type contract agent paid decommit inequ pb def pb probabl contractor decommit decommit pa pa rule type contract agent paid decommit inequ pa def pa probabl decommit pb condit de ne contractor strategi condit de ne contractor strategi condit variabl pb de ned equat condit variabl pa de ned equat equat de ne nash equilibria decommit game contractor ir constraint rst row correspond correspond decommit integr row correspond contractor integr correspond contractor decommit ir constraint bound contractor decommit penalti chosen high contractor decommit threshold lower case contractor decommit bi bound decommit penalti chosen high decommit threshold greater case decommit assum bound full commit contract subset level commit pareto cienci maxim sum contract parti expect payo exist ir full commit exist ir level commit contract addit argument state level commit contract full commit theorem state posit result level commit contract deal full commit contract theorem game contract individu ration agent level commit contract proof full commit sati es ir constraint requir imposs analyz level commit contract qualit di erent case case chanc agent decommit nonzero probabl agent decommit nash equilibrium plot di erent valu figur note nash equilibrium curv curv truth decommit curv truth decommit nash equilibrium curv nash equilibrium curv ρ curv truth decommit figur nash equilibrium decommit threshold game di erent valu decommit penalti nash equilibrium deviat decommit chanc agent decommit nash equilibrium decommit threshold di er nash equilibria satisfi agent ir constraint program model equat ir constraint make algebra tractabl version equat assum rst task check valid boundari model boundari plot bold line figur plot valid boundari curv ir constraint held equal plot figur note agent decommit decommit contractor decommit figur ir region decommit game grai area qualit di erent region contract ir agent equilibrium decommit game bold line valid constraint program model requir constraint slice region root constraint sati ed side line solid line repres contractor ir constraint program dash line repres ir constraint agent curv constraint root constraint sati ed side ir constraint induc bound ir region root ir side ir constraint sati ed dark grai area figur repres valu decommit penalti valid constraint program model ir constraint sati ed exist decommit threshold form nash nonzero probabl agent agent higher expect payo contract numer pick contract nash decommit threshold figur contractor expect payo approxim approxim agent expect payo higher contract ir agent su ce prove theorem illustr proce present type equilibria occur case contractor decommit contractor decommit ar decommit contractor ir constraint case game case constraint proven ir constraint game case proven approxim open region type contract ir agent equilibrium region color light grai figur case decommit decommit contractor decommit contractor ir constraint case game case constraint proven approxim ir constraint game case proven open region type contract ir equilibrium region color light grai figur case trivial case contract agent ir case agent domin strategi collect decommit penalti rst agent contract ir decommit decommit penalti decommit agent payo contract agent payo contract contract ir agent agent payo contract decommit occur payo transfer addit fact level commit contract enabl deal imposs full commit level commit contract cienci deal full commit contract occur level commit contract emul full commit contract set penalti high bound theorem cienci improv full commit contract game ned bound bound game level commit contract contractor expect payo expect payo level commit contract proof proof theorem level commit contract construct agent decommit agent game game proof theorem appli condit full commit contract pareto cient compar equilibria level commit mechan nash equilibrium decommit strategi simultan decommit mechan di er signi cantli depend agent penalti case decommit theorem decommit penalti approach mechan mechan contractor decommit penalti decommit probabl approach contractor contractor penalti approach mechan contractor mechan contractor decommit penalti decommit probabl approach proof formula phenomena theorem describ observ context figur sequenti decommit mechan rst mover mover decommit decommit penalti nonneg freed contract oblig rst mover mover decommit remain strateg ect sequenti rst mover reluct decommit simultan decommit mechan proposit pa simultan mechan probabl contractor decommit pa sequenti mechan probabl contractor decommit rst decommit pa reluct decommit reluct decommit reluct decommit mechan pa strictli reluct pa strictli reluct proof higher decommit threshold reluct equat mechan rst prove reluct pa pa pa hold strict pa pa inequ prove reluct pa pa pa pa pa hold pa pa inequ strict uncertainti agent er discuss game agent receiv uncertain er deal uncertain independ section discuss game agent er uncertain game probabl mass point theorem appli set proof pick contract proof capit theorem state instanc game full commit contract ir level commit contract theorem appli set proof gener capit uncertainti word set theorem state chanc contractor er lower chanc er higher compar full commit exist level commit contract higher expect payo contract parti brie discuss game uncertainti order present result asymmetr belief agent present case contractor er probabilist agent probabl densiti function common knowledg case contractor er analog distinguish game uncertainti present call game er prevail figur contract game level commit contract full commit contract contract null contract decommit game natur decommit decommit decommit decommit contractor decommit contractor decommit contractor decommit contractor decommit ρ figur er prevail game contractor accept er contractor payo list bold solid line show choic occur bold dash line repres inform set model aspect decommit game thin dash line repres altern mechan agent reveal decommit contractor reveal decommit observ decommit sequenti decommit cop game reveal decommit rst gain inform begin contract game decommit decommit bene cial found origin contract bene cial er hold game agent reveal decommit simultan rst game depict inform set denot thin dash line figur sequenti decommit game contractor move decommit contractor save decommit penalti decommit contract void discuss branch contractor decommit branch payo independ contractor branch decommit contractor contractor decommit matter er turn decommit game plai contractor decommit kind contract game strictli ir decommit strictli ir contract mechan speci es agent pai decommit penalti decommit figur decommit case agent possibl decommit contractor contractor reason decommit case hold mechan speci es decommit mechan speci es pai decommit contractor payo contractor decommit probabl contractor decommit individu ration constraint state contract higher expect payo xed contractor decommit stai contract contractor ant ir constraint base idea er void decommit game section discuss set xed er accept contractor price case contractor receiv payo er void higher expect payo pass er riski contract accept er contract decommit contractor er valid contractor anymor case payo contractor decommit interpret er case er payo contract call set er void figur contract game decommit game level commit contract ρ full commit contract contract null contract natur decommit decommit decommit decommit contractor decommit contractor decommit contractor decommit contractor decommit ρ figur er game er accept contractor er bold solid line show choic occur bold dash line repres inform set model aspect decommit game thin dash line repres altern mechan agent reveal decommit contractor reveal decommit observ decommit sequenti decommit game reveal decommit rst gain inform begin contract game decommit decommit bene cial found origin contract bene cial er hold game agent reveal decommit simultan rst game depict inform set denot thin dash line figur sequenti decommit game contractor move decommit contractor save decommit penalti declar decommit contract void discuss branch contractor decommit branch payo independ contractor branch decommit contractor contractor matter er turn decommit game plai contractor decommit kind contract game strictli ir decommit mechan speci es agent pai decommit penalti decommit figur decommit case agent possibl make decommit game contractor contractor reason decommit case hold mechan speci es decommit mechan speci es pai decommit contractor payo contractor decommit pa ir constraint payo er contract contractor contractor ir constraint base idea contractor decommit stai contract contractor contract individu ration ant ir constraint constraint contractor ir constraint cop game full commit contract subset level commit game contractor decommit penalti chosen high contractor bound discuss decommit class level commit contract class full commit result earlier paper level commit contract enabl deal full commit contract ir result level commit contract improv expect payo contract impli advantag hold game easi ir constraint cop game contractor ir constraint cop game condit posit result cop game appli game natur hold make riski level commit contract desir ect desir contractor level commit contract advantag game su cientli proposit show result level commit contract game proposit enabl game game full commit contract sati es ir level commit contract sati es proof full commit ir case exist level commit contract de ned sati es ir constraint da contradict level commit contract sati es ir constraint proposit pareto cienci improv game game arbitrari full commit contract sati es ir exist level commit contract agent expect payo agent expect payo proof contractor payo exist level commit contract ned payo inequ strict da contradict level commit contract exist constraint sati ed mean contractor er requir nonneg payment contractor requir proposit neg result limit scope belief distribut er discuss game er common knowledg section studi agent common knowledg act equilibrium deriv realiti agent belief distribut main game uncertainti agent belief hurt contract parti game uncertainti ect asymmetr belief game recal agent uncertain decommit sequenti agent expect payo contract ect agent belief decommit depend subject contractor upcom decommit ect contractor expect payo contractor perceiv di ect asymmetr belief game recal agent uncertain reveal decommit simultan pai penalti agent expect payo contract ect agent belief decommit depend subject contractor upcom er receiv good decommit act believ contractor good er save decommit penalti decommit decommit ect contractor expect payo case contractor payo case contractor payo agent prefer order potenti contract depend agent belief game asymmetr agent agent belief order determin prefer order contract ect asymmetr belief game recal agent uncertain reveal decommit simultan pai decommit penalti agent expect payo contract ect agent belief decommit depend subject contractor upcom er receiv good decommit act believ contractor good er save decommit penalti decommit decommit ect contractor expect payo case contractor payo case contractor payo agent prefer order potenti contract depend agent belief game asymmetr agent belief order determin prefer order contract ect asymmetr belief cop game recal cop game game agent futur uncertain unlik cop game agent hurt agent belief proposit show speci agent inform expect payo independ agent reason process inform sourc agent negoti partner belief contractor subject distribut beth subject distribut contractor er proposit payo una ect oppon belief cop game agent inform fa fb agent expect payo contract una ect agent subject distribut agent prefer order contract una ect proof contractor inform fa contractor expect payo accept contract contractor payo full commit contract expect payo level commit contract depend inform inform fb payo accept contract payo full commit contract expect payo level commit contract depend contractor inform ect asymmetr belief game recal agent uncertain futur er agent er drop decommit game section discuss game agent belief di er speci contractor subject distribut subject distribut contractor er common knowledg perceiv individu ration constraint contractor constraint proposit show contract bene cial full commit contract bene agent perceiv level commit contract bene cial proposit perceiv enabl game game ned full commit contract sati es ir level commit contract sati es ir full commit contract sati es level commit contract sati es constraint proof full commit contract satisfi ir constraint full commit contract sati es ir constraint proposit level commit contract sati es ir constraint full commit contract sati es constraint requir level commit contract sati es constraint constraint substitut contractor constraint substitut level commit contract sati es constraint agent perceiv level commit contract sati es individu ration constraint due fact fa agent estim distribut contractor er payo su cientli agent proposit contract ir agent incur loss agent contract perceiv ir posit result state agent belief cop game unlik expect payo independ agent belief agent enter tabl contract due agent mean agent negoti partner belief proposit payo una ect oppon belief game agent inform fa fb agent expect payo contract una ect agent inform agent prefer order contract null deal una ect proof contractor expect payo accept contract contractor payo full commit contract expect payo level commit contract isr depend inform payo accept contract payo full commit contract expect payo level commit contract depend contractor inform corollari perceiv ir contract ir agent game agent inform fa fb contract perceiv ir agent fx contract ir agent proof de contract ir contractor prefer null deal proposit prefer order una ect inform de contract ir prefer null deal proposit prefer order ect contractor inform contract perceiv ir contract ir agent belief agent belief practic prescript market design level commit contract sandholm quickli adopt implement mitsubishi appli electron market construct wast recycl japan appli autom negoti manufactur set digit librari section present practic prescript design negoti system level commit contract result canon game suggest worthwhil contract enabl contract pareto improv perspect incorpor decommit mechan autom contract protocol decommit penalti chosen agent dynam contract time static mechan tune penalti speci negoti situat speci belief structur agent paper present ir constraint evalu contract decommit bene cial parti paper present algorithm comput decommit equilibria algorithm comput contract decommit maxim sum contract parti expect payo part gener electron commerc provid level commit contract web turn surplu provid level commit divid contract parti reduc long parti nonneg share requir distribut bargain occur contract penalti tailor price penalti set surplu reduc magnitud surplu level commit contract agent decommit base local negoti decommit time level commit contract simpler contract worst speci cation contract altern oblig altern world induc realiz combin futur event decommit method requir event veri cation mechan contract advantag make level commit contract practic autom negoti system contract set cost pareto cienci event advanc event mutual observ veri write contract set contract oblig optim futur world induc di erent combin event contract post cient level commit contract gener post cient ration agent decommit strateg contract end cientli cient breach sum contract parti post payo arbitrarili optim agent made arbitrarili reluct decommit set decommit penalti su cientli high show equilibria di erent decommit mechan turn optim contract di er mechan recent paper show mechan lead sum contract parti payo contract price penalti optim mechan separ sum contract parti payo criterion mechan agent mechan lead di erent sum rank mechan vari base agent util function sum contract parti payo criterion mechan criteria goal minim number payment transfer paper show contract optim separ decommit threshold mechan mechan fairli compar base depend er occur compar threshold outcom agent er threshold agent mechan lead penalti paid agent receiv er agent mechan lead penalti payment agent receiv er decommit simultan game rst agent decommit sequenti game case mechan lead lead lead case unfair advantag mover game simultan game surplu provid level commit divid arbitrarili agent pick contract price tailor penalti price perspect minim number penalti mechan worst mechan evalu criterion robust equilibrium decommit game sequenti decommit game iter domin solut concept simultan decommit game nash equilibrium suggest sequenti decommit mechan iter domin robust solut concept nash equilibrium addit promot sequenti decommit mechan decommit easi parti parti decommit decommit decommit recent paper show equilibrium uniqu sequenti decommit game multipl equilibria exist simultan decommit game speak sequenti decommit mechan asynchron negoti system trust implement decommit mechan carri risk agent reveal decommit agent agent decommit agent collect penalti agent problem overcom mechan agent encrypt decommit mail contract parti agent receiv encrypt messag send kei observ agent decommit scheme read agent commit agent chang web multipl mutual contract multipl classic full commit contract induc negoti focu consist oblig contract mechan multipl agent involv contract switch focu decommit contract pai decommit penalti happen switch make bene cial agent decommit contract avoid loop decommit possibl disabl implement mechan speci es contract er accept agent origin er void stai valid origin deadlin reach time decommit agent explicitli hard monitor mechan make contract ident content rise possibl useless loop loop lead extend negoti due deep backtrack nite loop avoid mechan decommit penalti time number domain event negoti low commit negoti focu move joint search space make contract level commit level commit agent backtrack deepli save comput recent research show clock basi price element absolut time avoid nite loop myopic su ce count time moment contract made similar issu agent carri strateg lookahead recent studi initi low commit contract mechan facilit link deal contract singl item bene mechan sandholm agent manipul scheme agent capabl tailor kei post agent encrypt messag chang mean sensibl cryptographi tailor believ di cult combin contract agent sandholm explicit cluster issu contract sandholm agent initi cial low commit contract anticip synerg futur contract agent make rst contract bene cial contract agent decommit similar initi low commit contract mechan facilit contract agent explicit multiag contract mechan multiag contract implement agent initi cial low commit contract anticip synerg futur contract parti make rst contract bene cial contract agent decommit explicit cluster issu atom contract multiag contract level commit mechan top contract bene cial identifi pro tabl combinatori contract di cult due lack global view set agent construct pro tabl combin sequenc individu level commit contract mechan involv explicit link issu level commit recent compar combin mechan simul studi develop theori level commit contract involv contract parti singl contract practic autom contract agent bound limit comput resourc bound capabl solv combinatori complex problem sandholm fact agent comput bound induc uncertainti contract probabilist agent contract time level commit contract mechan agent contract contract made contract turn lower agent decommit level commit contract mechan decommit penalti quickli time bound ration agent agent combinatori number futur world altern combin decommit occur auction bidder prefer combin item import potenti applic level commit contract combinatori auction design obtain cient outcom domin strategi requir bidder comput valuat combin item bid combin auction task determin winner complex sandholm potenti practic altern sequenti ascend auction bid individu item restrict combin level commit contract mechan bidder put back item project obtain combin auction receiv bid decommit auction process item alloc futur research present decommit mechan contract protocol agent accommod futur event pro unlik full commit contract contract speci es decommit penalti parti agent pai penalti agent mechan practic complex contract potenti combinatori hard anticip cation mechan decommit decid base local post concern ration agent reluct decommit chanc parti decommit case agent freed collect penalti agent reluct contract cientli equilibrium analysi decommit game show level commit contract enabl deal set full commit contract bene cial parti show condit level commit contract construct yield higher expect payo contract parti full commit contract speci contract construct chanc contractor er lower expect chanc er higher contractor expect er full commit level commit contract construct full commit contract contractor er bound achiev trivial set decommit penalti high parti decommit show result multipl decommit mechan di er base decommit sequenti agent penalti decommit case sequenti distinct matter feder commun commiss bandwidth auction bidder retract bid case item open win price lower bidder retract bid pai di erenc retract auction payo retract bidder risk penalti decommit mechan auction back item mover decommit rst mover distinct mechan left sequenti studi reveal decommit rst contractor rst essenc mechan studi decommit equilibrium di advantag hold condit addit quantit result present qualit observ made decommit equilibrium sequenti agent decommit decommit decommit simultan decommit mechan pai penalti agent decommit penalti approach agent simultan decommit mechan pai penalti agent decommit penalti approach agent simultan agent penalti agent decommit probabl approach agent contract probabl contract parti ration agent reluct decommit sequenti mechan rst reluct simultan mechan pai penalti reluct simultan mechan pai penalti decommit construct game instanc agent posit good deal level commit contract agent posit time contract time agent level commit contract discuss decommit mechan compar perspect minim number penalti simultan decommit mechan pai penalti decommit sequenti mechan simultan mechan pai decommit worst perspect robust uniqu ration sequenti mechan addit studi game agent futur involv analyz game uncertainti game agent futur prefer decommit contract origin individu ration agent agent decommit game agent payo contract una ect agent belief prefer order contract una ect agent possibl belief agent negoti partner agent incur loss due agent erron belief game agent futur involv agent payo contract depend negoti partner possibl belief agent agent belief present uncertainti stem potenti futur model appli set uncertainti stem uctuat worth contract contract parti option techniqu capit gain probabilist futur event provid option price paid option level commit contract paid level commit contract provid contract parti possibl decommit basic option exibl contract parti construct packag level commit contract packag option fact level commit contract lead strateg decommit game option suggest level commit contract fundament di erent nancial instrument extens research includ studi close pace decommit penalti time occur event norm theori relat control issu paper desir step norm theori game larson relationship level commit contract explicit multiag contract studi detail refer support framework asynchron negoti resourc transfer ieee cybernet japan level commit contract myopic individu ration agent intern confer system page franc tradeo realloc negoti combinatori contract type nation confer cial intellig page fl level commit contract myopic strateg agent journal econom dynam control special issu comput econom earli nation confer arti cial intellig law contract west publish edit converg distribut implement gener equilibrium outcom comput econom electron commerc macmillan technic publish market architectur contract intern confer autonom agent page mn design famili coordin algorithm intern confer system page san ca equilibrium analysi search breach steadi state bell clark tax consensu mechan autom agent nation confer cial intellig page ca agent contract task environ proc eleventh nation confer cial intellig page multiag negoti time constraint arti cial bargain complex problem nation confer arti cial intellig tx anonym credit card analysi transact theori oxford press analyz auction journal econom asymptot optim auction agent technic faculti industri engin israel bargain problem bargain market academ advantag strateg multiag contract mechan intern confer system page japan econom analysi law brown edit rai art scienc harvard univ mass rule design convent autom negoti comput mit press perfect equilibrium bargain model implement contract net protocol base margin cost calcul nation confer arti cial intellig page dc negoti limit agent phd amherst transact ieee internet special issu electron commerc algorithm optim winner determin combinatori auction sixteenth intern joint confer arti cial intellig page sweden extend version rst washington dept comput tech report januari gener electron commerc server fourth intern confer agent spain earli version workshop ai electron pp juli coalit structur gener worst case arti cial earli version nation confer arti cial intellig page issu autom negoti electron extend contract net framework intern confer system page san ca reprint read huhn pp advantag level commit contract protocol nation confer cial intellig page extend massachusett comput scienc depart technic report coalit bound agent arti cial special issu econom principl multiag system earli version intern joint confer arti cial page algorithm optim level commit contract sixteenth intern joint confer cial intellig page sweden extend washington depart comput scienc technic report improv algorithm optim winner determin combinatori auction gener nation confer cial intellig tx bargain deadlin nation confer cial intellig page fl surplu level commit contract fourth intern confer system ma earli version revenu commit contract aaai workshop settl con ict identifi pp technic report extend washington depart comput scienc technic report role commit cooper negoti intern journal intellig cooper inform formal studi distribut meet schedul group contract net commun control distribut problem solver ieee transact distribut constraint satisfact formal distribut problem solv ieee intern confer distribut comput page cryptographi mechan coalit format task orient domain nation confer arti cial intellig page wa
AI/1293 2 aaai fall symposium cognit robot embodi stuart shapiro depart comput scienc engin center cognit scienc state york buffalo bell ny usa abstract enhanc comput cognit agent embodi real simul bodi oper real simul world experi wai embodi influenc creation mean agent belief term knowledg percept privileg person bodili awar introduct engag seri project cognit agent shapiro shapiro shapiro implement group incorpor hardwar cognit robot capabl embodi input output fragment perform primit composit vision give overview discuss wai embodi influenc creation mean agent belief term knowledg base issu discuss percept privileg person bodili awar interact interact carri fragment english implement atn grammar input command summari loop input analyz current supplement infer interact world clarif dialogu user analysi input result term introduc belief repres belief input english sentenc gener term repres main proposit express gener statement output phrase understand input answer question retriev infer base current answer output english input carri output gener english sentenc express understand answer carri command involv project sponsor nasa embodi activ hardwar version commerci nomad robot amherst vision system consist pair camera hardwar softwar nomad suppli wheel role oper room ffl ffl human ffl ffl green ffl indistinguish red robot actual room nomad robot yellow blue green robot green red robot red talk stu bill person address address person talk told talk follow aaai fall symposium cognit robot peopl robot room engag limit number topic fragment similar architectur embodi architectur embodi layer architectur integr shapiro shapiro architectur consist knowledg level locat symbol implement knowledg reason term logic languag repres mental entiti conceiv reason level locat routin behavior carri data object behavior oper level locat control individu sensor effector implement common lisp sal implement implement highest refer implement common definit function implement activ repres middl set common lisp symbol function defin world packag common lisp foreign function facil link lowest implement common lisp sal run machin develop kl part simul robot world oper ascii simul replac function print indic garnet simul simul world garnet object garnet window vrml simul simul world vrml realiti model object visibl web browser nomad simul simul includ nomad enhanc simul world vision system code kl level chang switch simul hardwar robot requir file print make call object term object world conceiv mental correspond object real world hardwar nomad object real world simul simul object distinct term repres simul object common lisp symbol world packag rememb symbol resid level architectur individu constant repres begin interact belief logic shown syntax al shapiro implement group chapter interfac term denot mental person simul bill vision research big blue cube stand real bill hall offic embodi belief percept discuss harnad deal ground kr symbol percept object focu issu wai comput cognit agent convinc understand color green pure green contrast thing discuss shade pick green thing real world build experi cognit robot abil experi demonstr show garnet structur continu term avoid object aaai fall symposium cognit robot ground symbol percept kl term descript descript color shape number symbol lower level find real simul object garnet symbol import garnet packag color shape garnet object nomad number pass argument sal design color shape vision system tabl show descript kl term ascii world descript stu bill green red robot tabl descript align kl term color color categori robot ascii simul partial descript unifi full descript full descript green robot ascii simul nomad robot respond green parser find term repres green robot function find find descript call function find descript function call argument direct vision system move camera focu color shape implementor vision system train vision system color call shape call term creat repres belief found express belief gener sentenc found green symbol variabl serv icon memori term creat repres belief express belief gener sentenc green demonstr understand nomad robot turn camera focu green robot interact ascii version sentenc sentenc begin ascii simul sentenc output find green robot green circl found found green robot green robot fact descript symbol captur phenomenon describ repres mental entiti kl term bill blue doesnt descript arbitrari symbol vision system locat object world link ground kr term object world variabl serv icon case case hardwar camera sal vision system symbol stand object descript object directli access garnet green robot simul structur object slot fill symbol satisfi descript object request find doesnt robot green robot action addit demonstr understand shape demonstr understand verb green nomad robot move green robot camera focuss demonstr understand ascii green robot green robot green robot nomad robot follow move remain move follow bill aaai fall symposium cognit robot blue squar found found bill bill bill bill bill primit action term includ stop action term written function symbol argument term denot object action perform function repres act function term repres act find green repres event time interv agent object agent perform act object repres event repres green repres event find green robot find connect kl rule ffl precondit agent object agent object ffl achiev goal agent object agent object ffl precondit agent object agent object ffl achiev goal agent object agent find object precondit goal event form term repres proposit order event event occur proposit achiev goal occur occur action sequenc structur action repres implement ration engin action servic reason reason servic action shapiro precondit goal proposit execut ffl perform act proposit infer kl knowledg perform achiev event occur ffl achiev event occur proposit infer kl knowledg perform act individu constant built term variabl discuss action act action primit composit composit act execut perform composit act proposit infer kl knowledg perform primit act constitut plan accomplish primit action provid perform argument act order primit action provid implement group term denot primit action ground align call function function bit call version discuss section perform act repres primit act function align action term argument term argument term find align function perform call common lisp function argument retriev descript align call function descript argument primit action goto align function work call entiti precondit aaai fall symposium cognit robot entiti achiev find find entiti result set work correctli kei link connect vision action languag reason successfulli robot folk simul implementor symbol repres categori object ground symbol repres action ground behavior direct correct object coordin privileg knowledg knowledg physic obtain reason reason decid sit call privileg act execut function action term function creat term repres belief add term kl knowledg english gener output addit oper perform function mention belief creat act justifi true creat knowledg proposit agent perform action object time repres function term form proposit found green robot time repres repres recal perform call argument oper perform includ creat repres time find express index index word mean determin occas understand set index aid base center hewitt term repres term repres talk term repres current time input analyz interpret person pronoun refer interpret person pronoun refer interpret refer locat gener person pronoun refer person pronoun refer determin gener sentenc show index ascii version person talk talk talk bill start talk talk blue squar found found person talk talk stu talk notic ffl interpret depend talk ffl address talk refer stu talk bill ffl understand stu bill belief express ffl present report talk past report past aaai fall symposium cognit robot stanc instanc report present occur interpret index analysi gener index gener grammar affect interpret bill interpret stu refer individu repres refer express refer person time mention deictic center includ variabl term repres current time relat relat time addit tempor relat belief belief tempor order past action question simpl answer move involv categor action action dur modal base garnet stop action present problem nomad dur action talk modal tabl action modal interrupt dur find stop follow tabl categor action action modal direct object stop stu order find order interrupt action modal continu talk stu red classifi stop modal current dur action stop stop supp pp involv discuss problem find bill blue squar found found bill bill bill talk talk follow red robot red circl found found red robot red robot red robot red robot red robot talk talk person stop stop stop bill red robot red robot talk talk movement depend action action perform time addit time term creat time aaai fall symposium cognit robot move latest time action perform time addit time term creat time move latest time dur action action action modal direct object assert time action oper discuss subsect carri complet discuss function call function effect valu creat time creat proposit relat updat creat proposit gener english express proposit bodili awar creation action belief function captur notion privileg good captur time dur action nomad robot version version lower level oper process separ asynchron kl process function function call initi actual bodili termin bodili action complet find categor action dur action real robot function bill control sal move floor solv make accur awar bodi feedback sal kl nomad robot version vision avoid obstacl path bill object result specif avoid object feedback sal kl make accur answer question current domain rule action assum sequenc action illustr delet save green robot bill found green robot green robot green robot green robot found bill bill bill bill talk perform quickli function command hardwar function execut quickli didnt notic make movement green robot skip immedi bill chang subsequ action sequenc perform sal feedback sensori action earlier action complet clear ascii simul perform action goal accomplish began address problem final stage nomad continu transfer embodi domain remedi process transfer implement robot perform task robot oper rectangular field land robot find carri place corner set charg blow move safe place robot batteri interrupt recharg station recharg robot report time field develop kl level robot simul lower level transfer upper level real robot hardwar summari colleagu engag seri project cognit incorpor hardwar cognit robot gave overview discuss wai embodi influenc creation mean agent belief term knowledg base knowledg base resid knowledg level locu reason entiti robot discuss repres kl term system aaai fall symposium cognit robot implement kl categori term ground align descript real simul vision system locat object real simul place variabl robot icon memori action term ground align function carri repres hardwar vision system effect coordin action function insert knowledg base belief robot privileg knowledg action action function insert knowledg base term repres time action belief give tempor relat provid robot person time robot understand index word deictic center term robot person talk current time variabl updat action robot place world embodi aspect symbol function captur notion give kl feedback lower bodili level robot robot idea accomplish task acknowledg work support part nasa contract na na part onr contract comment made bill fran earlier draft paper refer languag learn robot csli public ed deixi cognit scienc perspect lawrenc erlbaum garnet refer version school comput carnegi mellon pa symbol ground problem physica embodi ground layer architectur integr reason autonom agent sixth florida ai research symposium florida ai research societi repres learn routin activ phd depart comput state york ny technic report act servic infer vice seventh florida ai research symposium florida ai research societi bdi architectur support system eleph men biologi technolog intellig autonom agent berlin ed semant network artifici intellig pergamon press consid fulli proposit semant network knowledg frontier model knowledg compet philosophi essai interfac mit press famili comput mathemat applic reprint pp implement group user manual depart comput scienc state york ny logic program languag technic note depart comput state york buffalo present workshop logic program intellig rm queen long gener augment transit network grammar gener semant network american journal comput linguist approach natur languag compet confer artifici intellig lectur note artifici intellig belief space set proposit journal theoret artifici intellig
Agents/1294 1 model evolut agent behavior samuel alexi drogoul case place pari cedex franc abstract paper introduc model aim design evolut adapt behavior agent multiag system discuss briefli main problem classic evolutionari intend produc agent behavior solv problem provid detail explan model compon show simpl system give result discuss featur model extens keyword genet evolutionari adapt artifici atn limit exist model model design evolv agent possibl agent oper organ level behavior agent level built substrat bit string call model attempt overcom problem classic evolutionari paradigm design behavior genet algorithm manipul genotyp induc case gradual modif phenotyp ensur individu produc children level adapt environ genet algorithm poor express optim set paramet behavior priori genet program paradigm base evolut program instruct express power higher genet oper tree oper syntact semant induc strong variat effect result program impact genet oper tightli depend level atn stand augment transit network oper modif root deeper influenc behavior agent reduc program interest attempt build formal string translat oper exist string produc genet oper system work evolv autonom hand translat string product string pure determinist process harm trap system intend produc product string artif life model investig possibl program virtual world world virtual machin produc random error program replic treat instruct data lifelik phenomena control evolut behavior virtual organ direct surviv specif environ attempt escap behavior limit genet reinforc autonomi express genotyp caught useless virtual implement model string translat list instruct call enzym function specif hand translat string hand genet oper string insert main obstacl system high enzym genet program issu crucial translat string perform enzym gene subject descript model gener principl framework tool model agent integr class design simul provid classic evolutionari techniqu gener behavior produc translat produc token interpret token instruct build graph atn graph determin behavior agent translat interpret behavior evolv provid system higher autonomi atn graph class intend behav atn graph atn design agent behavior subclass collect condit action action behavior perform condit percept stimuli induc action select edg graph label set condit sequenc action figur atn built ad node edg basic structur start end time agent start randomli edg condit condit simultan true perform action edg jump destin node stop work state end interpret interpret build atn token token action condit label edg node figur atn real start node real end node atn interpret creat node connect manipul structur construct mention section structur built token sequenc robust mutat replac token local transform graph program languag oper list tabl tabl languag token list node connect swap forget recal creat node creat node connect creat node connect creat edg condit label list action label auxiliari stack instruct execut simpli instruct oper node connect list node execut data interpret receiv token termin action condit token present node treat implicit connect edg consist atn check start link node incom node outgo edg link end translat translat simpl behavior read genotyp string decod sequenc token genet function set includ action condit agent understood interpret tabl depend number token genet code redund design order resist discuss issu paper experi section demonstr system work simpl singl class agent oper provid result behavior evolv experi setup illustr evolut simpl experi discret environ color light bulb singl agent subclass gener action percept abil tabl agent light green left red make agent behavior appli rule select popul homogen agent tabl action condit token agent action condit action move true light green move left true light red move true probabl move genet code agent interpret token genet code automat built circular list interpret action token chromosom agent initi random bit string random length evalu fit agent make run time step environ color light bulb randomli flip probabl time green red reward rule fit function point move point erron left case move move perform current time step reward consid agent evalu averag fit run select produc agent cross replac agent remov popul experi mutat agent subject random mutat chromosom rate bit randomli mutat random insert delet mutat result figur evolut fit mutat fit gener max fit avg fit min fit agent initi start time step jump node time figur evolut fit chromosom length insert gener max fit avg fit min fit gener max chr length avg chr length min chr length agent depend atn structur abil respond maximum fit experi answer time step figur show averag evolut fit mutat strategi calcul experi figur show averag evolut fit mutat evolut chromosom length experi case good solut found gener discuss problem solv result valid model evolv agent behavior substrat focu specif model give qualit analysi behavior produc natur select atn figur solut problem point simplest atn light produc bit theoret encod maxim implicit solut order natur token highli vulner mutat addit agent bit chromosom sourc inadequ behavior figur atn highest fit simplest real start node real end node figur atn built natur implement behavior strategi real start node real end node result show strategi produc adequ behavior consist build simpl atn close atn figur delai node creation token effect chromosom encod produc atn close figur label edg good properti languag agent strategi build complex atn small subset instanc atn figur lead behavior larg part reach node perspect present model evolut agent behavior evolut main featur separ genet inform structur bit lexic interpret semant semant structur built correct behavior atn mean adequ environ worri syntact correct automat design semant structur good point evolut approach main evolut featur relat genet oper level influenc classic genet oper mutat crossov depend part bit string involv locat bit string main advantag evolut approach matter mutat local impact express genet crossov involv bit substr carri local function genet code genet bit string oper permit smoothli manag string local impact model model design set restrict agent level specif agent introduc lower organ level instanc insid agent specif model automat behavior simplifi condit action agent atn structur behavior directli describ explain behavior agent plan introduc metabol regulatori action atn act disabl edg transit time refer thoma back schwefel overview evolutionari algorithm paramet optim evolutionari david edward goldberg genet algorithm machin learn pub freder gruau neural network synthesi cellular encod genet algorithm phd en lyon universit lyon januari op de concept de de syst em phd universit pari dougla etern golden basic john henri holland adapt natur artifici introductori analysi applic artifici intellig ann michigan john koza genet program comput mean natur select mit samuel stephan alexi meyer framework design adapt system technic editor artifici life addisonweslei samuel landau evolutionari model individu collect agent behavior technic report david freder kaplan system technic ecol de thoma rai evolutionari approach synthet zen art creat life langton al wood transit network grammar natur languag analysi read natur languag process
IR/1295 5 approach web inform extract nichola kushmerick comput scienc colleg introduct inform agent distribut system receiv goal user gather inform relev goal varieti process content deliv result user focu stage gener architectur survei varieti inform extract techniqu enabl inform agent automat gather inform heterogen sourc agent mediat request satisfi agent retriev address inform geograph servic freight forward serv request quot relev freight retriev duti legal constraint govern weather inform estim transport inform extract form shallow document process involv popul valu automat extract document past research develop rich famili gener techniqu suitabl wide varieti rigidli format document html gener automat document newspap articl email messag view inform extract core enabl technolog varieti inform agent focu specif inform tangenti agent discov relev sourc verifi authent retriev cach polici minim commun ensur fresh observ xml elimin automat inform extract terabyt content numer legaci servic export data xml imposs determin correct annot applic idiosyncrat unit currenc includ extract split date reason expect automat inform extract continu essenti year scalabl kei challeng automat inform extract relev dimens dimens abil rapidli process larg document collect system gener scale regard reli simpl shallow extract sophist natur languag process problemat dimens number distinct sourc agent request quot thousand freight weather inform dozen forecast challeng scenario sourc format content sourc requir custom set extract rule machin learn approach scale dimens chapter machin learn enabl adapt inform extract system automat learn extract rule train data order scale number sourc gener idea adapt inform extract human expert annot small corpu train document fragment learn system gener exampl produc form knowledg rule reliabl extract content document train data assumpt underli adapt easier annot document write extract requir program describ techniqu aim minim amount train data requir elimin manual annot adapt inform extract research commun develop wide varieti techniqu tailor extract task document type approach web inform extract categor learn extract knowledg structur formal regular grammar automata survei promin addit research relat entir wrapper core learn section introduc wrapper form adapt tailor highli regular web section describ varieti express extens basic wrapper induct section explor techniqu natur languag section describ hidden markov model adapt section discuss approach wrapper verif central issu adapt section describ techniqu extract fragment coher section explain activ learn techniqu minim amount train requir accur gener sake breviti describ techniqu inform idea wrapper induct kushmerick formal adapt web inform extract work wrapper induct kushmerick identifi famili wrapper demonstr wrapper express learn wrapper numer web effici hand train cpu illustr wrapper induct web page shown figur html encod content extract extrem exhibit featur salient discuss wrapper consist sequenc delimit string find desir content simplest case figur content arrang tabular format wrapper scan pair delimit total delimit notat delimit delimit case wrapper execut procedur lr scan string begin scan ahead occurr procedur extract text posit column row procedur scan extract text posit column row process start extract termin miss end figur formal idea wrapper class lr wrapper consist set pair column lr provid procedur procedur scan begin scan ahead occurr procedur extract text posit column row lr scan extract text posit column row process repeat column search procedur start extract termin miss end lr machin learn task automat construct lr set train document lr learn delimit learn independ kei insight candid valid delimit impact delimit base kushmerick describ algorithm learn lr wrapper algorithm simpli potenti valu select satisfi constraint wrapper work correctli train data kushmerick demonstr theoret pac algorithm requir modest train sampl converg correct wrapper effici learn algorithm exist wrapper discuss limit lr class show handl document complic format simpl lr class successfulli wrap web survei countri procedur occurr scan occurr save posit start attribut scan occurr save posit end attribut return extract pair procedur page occurr scan occurr save posit scan occurr save posit return label fig fictiti internet site provid inform countri telephon countri web html document content lr gener gener lr lr mean definit solut web inform demonstr simpl techniqu remark effect lr effect simpl minor complic format render lr ineffect lr class requir reliabl begin attribut delimit figur modifi includ head code top case delimit lr work fact show legal lr wrapper document modifi manner kushmerick tackl issu extend lr famili addit wrapper class class addit delimit skip text head tail page head delimit skip top enabl work correctli class addit delimit identifi entir tupl regular lr strategi extract attribut turn idea combin fourth wrapper class kushmerick explor simpl wrapper data format simpl tabular fashion class extract tabl content oper lr process possibl level continu level return level return level attribut class combin kushmerick develop special learn algorithm class empir complex express power wrapper class extent effici learn class successfulli wrap survei algorithm learn wrapper time grow exponenti number pac analysi reveal requir substanti train exampl converg compar class express wrapper class initi investig lr famili substanti research effort elabor altern wrapper deriv effici learn algorithm extend wrapper class numer limit muslea al hsu dung develop algorithm address miss attribut complic page involv miss null attribut valu delimit simpl wrapper process remaind page correctli french site countri address franc attribut simpl wrapper class discuss assum simpl relat model attribut singl structur attribut natur scenario hotel guid explicitli list citi serv wast binari encod citi multipl attribut order wrapper assum attribut occur fix variant order abound complic document movi site list date titl movi prior titl recent movi disjunct delimit wrapper discuss assum singl delimit complic site multipl delimit site list price bold sale price render red nonexist delimit wrapper earlier assum irrelev background token separ content assumpt violat case depart code separ number string problem relev asian languag word token space typograph error except document error occur format drive simplist wrapper fail entir page small portion badli format sequenti delimit wrapper class assum singl delimit simplest develop accur wrapper scan delimit sequenc extract restaur review simpler scan scan final scan forc wrapper scan document singl delimit reliabl extract content hierarch organ data nest class step handl result larg neg complic scenario extract nest structur hsu dung address problem learn wrapper express class determinist transduc formal handl requir mention transduc process document extract singl extract control return start state tupl extract attribut repres pair state identifi start attribut identifi end gener automaton model state connect arbitrari permit miss attribut attribut multipl attribut order path start end govern express rule languag disjunct delimit limit form system recov format error except hsu dung describ algorithm effici learn wrapper transduc train data report wrapper class handl site wrap wrapper class muslea al identifi class wrapper unlik hsu tackl issu mention main distinguish featur muslea wrapper multipl delimit call landmark insist exist singl delimit identifi relev posit deep insid wrapper sequenc delimit jump posit seri simpl step simpl step easier enabl robust extract major featur muslea work formal nest organ data express simpl hierarch approach kushmerick extract natur text techniqu aim highli regular html emit cgi program research inform extract natur email newspap result relev structur domain recent investig shown result freitag kushmerick explor wrapper defin class extract pattern essenti lr case attribut enrich class permit delimit token type specif instanc corpu email seminar algorithm learn rule extract start match document pm fragment extract underlin rule basic find start find end time token final simpl rule languag extract free text freitag kushmerick improv perform boost gener techniqu improv accuraci weak learn learn rule individu rule high low rule set high high recal result accur extract algorithm competit approach varieti superior boost wrapper induct perform essenti perfectli task extract seminar announc competitor attribut speaker seminar locat soderland describ relat approach techniqu inform extract free text extract rule correspond restrict class regular express regular express serv contextu pattern determin fragment delimit determin boundari target ment languag import design work document span spectrum unstructur natur text highli structur web page depend structur train learn algorithm automat creat pattern simpl extract suffici accur learn algorithm bother add addit contextu constraint extract price number bedroom list document br incl upper system learn rule portion regular express valu extract rule extract content document hidden markov model work freitag kushmerick soderland instanc gener approach rigidli structur html document structur document email newspap articl approach brittl facil evalu strength evid guid extract held seminar document typograph error held techniqu make binari uncertain evid hidden markov model principl effici approach handl sort inher uncertainti hidden markov model stochast automaton state emit token fix transit state occur fix distribut hmm attract comput devic effici algorithm learn distribut infer state sequenc observ token sequenc hmm inform state token extract email seminar announc hmm state start time end time speaker locat token addit state gener token perform standard hmm viterbi decod algorithm determin gener observ extract fragment simpli read path hidden markov model successfulli numer research varieti extract scenario kei challeng effici algorithm determin state topolog distribut probabl forc permit initi work gener state connect manual evalu train corpu fig snapshot altavista search site note present content chang attempt automat learn topolog gener approach greedili search space topolog maxim object function seymor al attempt maxim probabl train data topolog approach effici potenti goal hmm model train data perform accur extract freitag mccallum object function actual accuraci topolog extract valid corpu approach significantli slower result compact topolog gener wrapper mainten work earlier ignor import complic inform agent gener control sourc receiv data wrapper tend invari reli idiosyncrat format detail observ learn process sourc modifi format user observ regular longer hold wrapper fail concret figur show altavista search site redesign kei challeng wrapper mainten wrapper verif wrapper oper wrapper challeng wrapper verif difficulti web content format verif algorithm distinguish chang microsoft stock price check time extract valu intuit verif algorithm realiz valu outlier defect wrapper kushmerick describ simpl accur algorithm wrapper verif algorithm learn probabilist model data extract wrapper train period oper correctli model captur properti train data length fraction numer charact extract data verifi wrapper train extract data evalu learn model estim probabl wrapper oper correctli algorithm domain independ ti wrapper class learn treat wrapper inspect output algorithm handl xml relat applic wrapper class wrapper receiv attent al learn probabilist model extract data similar substanti express kushmerick sensit model enabl wrapper wrapper deem learn model identifi probabl target fragment document train data remov data wrapper induct algorithm al demonstr empir approach highli accur extract scenario extract content work highli simplifi task assum involv simpli process document extract target fragment extract inform extract distribut multipl attribut page relev extract object figur show simpl scenario attribut valu multipl extract valu harvest collect hyperlink document issu handl wrapper class defin earlier muslea catalog formal permit extract fragment multipl object inform extract commun long investig issu refer approach requir linguist process applic shown figur jensen cohen address problem languag extract data rule express raw extract data group larger composit object jensen cohen argu languag suffici express handl data extract web site export job product suggest algorithm automat learn rule exampl group data kei bottleneck adapt inform extract obtain label train data machin learn motiv fact cost label fig complic extract task attribut valu distribut multipl object document cost write extract rule hand label document requir domain gener tediou approach simpli assum adequ train corpu research effort investig method minim amount train data requir achiev satisfactori level gener basic idea activ learn start small amount train run learn learn wrapper predict remain unlabel document learn system gener addit train document trivial corpu duplic learner suggest document annot activ learn context wrapper muslea al basic idea approach inform extract task correl origin task dual system identifi unlabel document recal muslea wrapper learn algorithm learn sequenc landmark scan begin document start fragment extract altern find posit scan backward end document set landmark extens solv learn task parallel train data result wrapper appli unlabel document system user label document wrapper give answer wrapper unlabel document subsequ learn muslea al demonstr version algorithm requir significantli train data obtain level gener averag varieti challeng extract error learn wrapper user annot ten train document chosen intellig compar ten document chosen randomli brin explor sort extract user system exampl concept learn extract book user suppli small sampl robot job extract system flesh list addit instanc algorithm iter search web seed pair find document learn inform extract pattern appli pattern remaind page result extract pair ad seed process iter process converg extract pair correct preliminari experi demonstr result al focu bigger wrapper learn train page onlin bookstor return page format differ content extract intuit approach wrapper learn compar page find similar differ similar correspond common format structur differ correspond data extract repeatedli replac differ note repetit algorithm learn wrapper correspond regular manual label train data al report algorithm work varieti domain summari inform extract core enabl technolog wide varieti agent central challeng inform extract abil scale number varieti inform sourc varieti adapt inform extract approach machin learn techniqu automat learn extract rule knowledg train data due highli practic natur approach chapter test real world exampl mean gap pure research practic usag agent system smaller glanc adapt inform finit state techniqu learn extract knowledg regular mar automata addit core adapt briefli discuss issu relat entir inform extract fundament open issu adapt inform extract method determin techniqu suit extract task complic judgment requir methodolog heterogen document measur order predict simplest approach deliv satisfactori perform acknowledg bernd thoma discuss refer weischedel learn proc conf appli natur languag brin extract pattern relat world wide web proc sigmod workshop merialdo automat data extract larg web site vldb page freitag kushmerick boost wrapper induct seventh nation confer page juli august texa freitag mccallum inform extract hmm structur learn stochast optim seventh nation confer juli august texa hsu dung gener transduc semistructur data extract web inform jensen cohen group extract field proc workshop adapt text extract kushmerick wrapper induct inform extract phd kushmerick regress test wrapper mainten proc nation confer artifici page kushmerick wrapper effici express artifici kushmerick wrapper verif world wide web doorenbo wrapper induct inform extract fifteenth intern joint confer artifici volum page august japan leek inform extract hidden markov model san minton learn common structur data proc nation confer artifici muslea extract pattern inform extract survei proc workshop machin learn inform knoblock hierarch approach wrapper induct proc intern confer autonom page knoblock select sampl redund view proc nation confer artifici rosenfeld learn hidden markov model structur inform extract proc workshop machin learn inform soderland learn inform extract rule free text machin
IR/1296 5 languag process compon gate gate version beta cunningham diana maynard cristian sheffield html work support engin physic scienc research council grant smaller grant exp content introduct text context overview structur book read download gate instal run gate configur gate build gate creat resourc instanti resourc load resourc configur implement resourc write grammar emb applic creat edit test data creat run applic save restor lr data store measur differ annot set gate compon model java simpl compon architectur gate framework languag resourc process resourc lifecycl resourc process resourc applic languag resourc resourc develop resourc gate integr develop environ gui configur option cycl perform evalu languag work unicod visual document annot content ii simpl data set document featur content annot featur direct acycl graph document format xml regular express annot formal descript grammar relat algorithm rule applic label bind scheme class implement compil inform extract system gazett sentenc part speech tagger semant tagger orthograph design note pattern except handl state machin pattern date content iii org loc refer content introduct text context overview develop deploi languag process facil compon addit facil structur book read download gate instal run gate configur gate build gate creat resourc instanti resourc load resourc configur implement resourc write grammar trick speed emb applic creat edit test data creat run applic save restor lr data store measur differ annot set gate compon model java simpl compon architectur gate framework languag resourc process resourc lifecycl resourc iv content bootstrap implement process resourc applic languag resourc resourc develop resourc gate integr develop environ gui configur option cycl perform evalu languag metric evalu inform extract annot debug measur tool work unicod visual document annot simpl data set document featur content annot featur direct acycl graph annot schema exampl view edit annot type document format xml regular express annot formal descript grammar relat algorithm rule applic algorithm algorithm label bind scheme class implement rh code compil inform extract system rule content vi token type gazett sentenc part speech tagger semant tagger context prioriti orthograph step step list lookup step grammar rule design note pattern compon control interfac except handl state machin pattern person locat organ ambigu contextu inform date develop languag process compon gate org loc refer develop languag process compon gate tex titl content intro introduct gate compon model model java simpl compon architectur gate framework init languag resourc process resourc lifecycl resourc bootstrap implement gui process resourc applic languag resourc data store resourc gui develop resourc gate integr develop environ cycl perform evalu languag metric evalu inform extract annot debug measur tool work unicod vr visual corpora document annot simpl data set document featur content annot featur direct acycl graph annot schema exampl view edit annot type document format xml regular express annot inform extract system gazett sentenc part speech tagger semant tagger orthograph miscellan resourc annot transfer design design pattern recognit pattern grammar chapter introduct softwar document wai construct softwar make simpl make complic obviou defici comput languag comput perform oper formal medium express idea methodolog program written peopl machin execut structur interpret comput sussman make make beauti gate infrastructur develop deploi softwar compon process human languag gate develop languag process provid class implement architectur emb languag process capabl provid develop environ built top framework made conveni graphic tool develop compon architectur exploit softwar object orient mobil code framework develop environ written java complet live develop languag process compon gate free softwar gnu librari licenc gate unicod unicod consortium test varieti indic languag al al scientif contribut quantit measur accuraci repeat result verif gate develop sheffield wide varieti research develop project al version gate hundr wide rang languag analysi context includ inform extract wilk cunningham italian french version complet extens due version book describ gate develop languag process test perform deploi part applic rest section note section briefli note context gate appli languag languag section overview develop section describ structur rest section list public gate text good idea read introduct skip section continu wade thing chapter refer chapter detail structur book detail section restrict form gnu mean gate commerci product requir develop languag process compon gate context gate thought softwar architectur languag engin comput infrastructur softwar includ develop environ usual term denot structur softwar system garlan languag engin defin disciplin act engin softwar system perform task involv process human languag construct process output measur predict literatur field relat applic relev scientif result bodi practic relev scientif result case output comput natur languag process artifici intellig gener unlik engin entail process construct softwar perform softwar complet applic work comput linguist scienc languag comput investig tool natur languag process scienc comput subject matter data structur algorithm human languag process languag engin build system cost output measur predict softwar principl famili system context infrastructur softwar architectur languag engin softwar architectur develop tool appli nlp le practic field broader complex serv guid develop languag process compon gate scientif endeavour nlp role support context featur includ support autom measur section provid plai result easili repeat site environ overview develop deploi languag process facil gate architectur mandat element softwar system process natur languag usefulli broken type resourc compon reusabl softwar chunk popular architectur java bean activ gate compon type java repres entiti corpora repres entiti primarili gener ngram repres edit compon particip gui set resourc integr gate collect reusabl object languag engin resourc packag java archiv xml configur data jar xml file made gate put web simpli place local file space section introduc resourc set gate develop languag process function develop develop environ framework construct resourc type involv develop languag resourc grammar exist process mixtur develop environ data structur produc consum perform measur figur screenshot tool extract result term synonym context common term literatur cf languag resourc evalu confer seri develop languag process compon gate figur visual resourc develop languag process compon gate gate develop environ analog system mathematica java conveni graphic environ research develop languag process softwar set resourc target client applic gate framework framework suppli jar file emb languag process facil jar file jar file xml configur file resourc make facil compon gate includ resourc common le data structur includ corpora annot set languag analysi compon inform extract rang data edit compon gate support document varieti format includ sgml plain text case format convert singl unifi model annot annot format modifi form format made larg compat atla format liberman standard mechan gate corpora annot store develop access code level framework chapter detail corpora famili process resourc languag analysi includ shape inform extract system compon finit state techniqu implement task semant tag verb phrase chunk compon commun document annot resourc chapter detail chapter visual resourc chapter miscellan resourc addit facil facil gate deserv special java annot pattern base rule annot chapter main jar file suppli resourc file gate unicod unicod support addit input method languag support separ java extens privileg secur profil develop languag process compon gate tool develop environ implement perform metric recal compar annot typic languag analysi compon develop mark document hand diff tool automat measur perform develop compon section gate unicod fill gap support ad input method languag section detail version make cup tea section typic gate develop deploi languag process capabl applic imagin develop call build email client larg corpor intranet applic languag process system automat spot peopl corpor transform mailto hyperlink investig show exist compon tailor start develop creat document email load process resourc recognit gazett semant creat applic run compon document sequenc process result viewer annot gate compon decent alter deal special peopl personnel creat gazett semant tagger tool tool creat directori structur disk java stub xml configur file hour struggl badli written manag compil stub creat jar file resourc gate url file system load load resourc earlier java develop sun java implement unicod support activ improv time write languag unsupport unicod support chang time outlook express trash mail folder tire heard netscap emac put web server develop languag process compon gate creat copi email annot edit facil mark result system produc save version ran gate oracl effort technic support gate enabl claim lot follow run applic email test corpu check perform system run tool compar manual result result percentag accuraci figur graphic displai differ machin human output make edit pattern grammar gazett list recompil gate reload resourc make alter gazett local personnel data alter pattern grammar semant tagger recognit sourc job involv learn languag chapter base regular express difficult eventu system run accuraci problem peopl perform good product stop gate develop environ work compon email applic applic written easi gate jar file ad project compon web code load compon job finish half dai code talk gate line eventu copi class worri polici develop larg corpor west strengthen job academ cope student accuraci measur attain system write paper journal logarithm describ approach result obtain gate java requir addit interfac java nativ develop languag process compon gate cite repeat experi offer access binari version softwar put extern web server live structur book materi present book rang conceptu softwar practic instruct programm deal gate linguist write pattern challeng doubt solut collect specif instruct separ chapter chapter give present order understand system read order chapter refer materi cite chapter describ gate model languag describ lifecycl gate group applic store file chapter describ develop measur perform languag analysi facil work unicod chapter describ set visual resourc bundl gate chapter describ model document annot annot corpora cover facil read write xml data interchang languag chapter describ rule languag base regular express annot document grammar compil cascad finit state transduc chapter describ pipelin inform extract system suppli gate chapter describ resourc bundl system fit previou categori appendix discuss design system appendix describ detail pattern grammar recognit develop languag process compon gate read document live gate web server main system document tree api document html sourc code part requir analysi version base detail sheffield work human languag process nlp group page detail inform extract user guid sheffield page list public gate project onlin al discuss project recognit wide varieti text type genr defin field softwar architectur languag review previou work present requir analysi system basi design gate version evalu strength weak gate version describ philosophi motiv describ gate version live design al present project context unicod support indic languag develop develop languag process compon gate al document earli version present al al al present model languag access distribut al survei user gate al al experi gate version al languag engin compon discuss requir analysi gate version al al describ prototyp gate version integr multimedia markup tool max institut discuss experi gate version develop reusabl toolbox swedish languag process compon al al report work implement word tagger gate version al present motiv gate infrastructur system languag engin al cunningham al cunningham al report work gate version al cunningham al cunningham al report earli work gate version al discuss select project sheffield gate version tipster architectur implement al guid develop compon gate version al user guid gate version al languag process compon distribut gate version cunningham al argu softwar engin issu framework import languag process histori research assess ow chapter law evolut strongest exist social social human ethic strength gain hurt le chapter describ complet common task gate section relat develop environ flag relat framework flag section relat flag download gate download gate point web browser follow download link fill form ftp address download system instal run gate gate run support recent version includ linux platform test macintosh develop languag process compon gate conform java version free sun microsystem unix supplier test sun jdk nt jdk work final binari gate edit suitabl script start held directori call bin open mind binari unpack creat directori jar file script copi script run system set environ variabl run develop click unix run emb gate put java extens script start gate environ java home point locat set script assum path gate home point directori binari directori bin ext directori script assum file live directori script full sourc distribut system binari develop languag process compon gate gate config point directori configur file section set script check directori found item file present gate config pass system script java properti configur gate gate develop environ call gate load sort configur data store xml file gener call data hold inform save set font gui local oracl live type data store level order gener locat gate resourc packag system locat environ variabl gate config java properti user live home directori unix profil directori part file overwritten gate save user configur data specif overwrit gener mean set default gate user individu user overrid default interf gate develop config file chosen depend set gate config gate home section gate set site config locat prior call depend binari built version develop languag process compon gate build gate note conform java environ build gate develop system conform java environ unix shell make excel distribut free uk mirror facil uk mirror facil run unix stuff instal gnu pat back knowledg oper system appreci natur beauti build cd start shell script distribut make gnu make path run script configur ignor insult messag check path program java configur made mistak edit path construct depend list build class file jar file make depend make make jar develop languag process compon gate test build code make test make doc open network build develop document privat make chang server java platform document copi intern server gate miss mysteri eleg previou build structur find note drink milk good cure acid develop environ borland note gener jar file note run configur locat site configur file chang site creat resourc resourc java bean chapter languag process resourc visual resourc chapter section creat resourc write java class implement bean compil java archiv write xml configur data gate url jar xml file gate develop environ process creat set directori file implement basic includ java code file process call creat compon call process resourc instanc word document add annot type start gate develop environ section menu develop languag process compon gate figur bootstrap wizard dialogu select pop dialogu figur mean data entri displai gate load directori resourc live java packag class repres resourc creat process visual resourc case process document add annot select class java class repres resourc field add interfac resourc case leav default implement develop languag process compon gate field select directori resourc creat compil creat jar xml file gate load resourc build process gnu shell section creat ant command prompt directori creat make depend make make jar creat file gate load load resourc section instanti resourc section load resourc develop section configur develop resourc default java code creat resourc put copyright notic gnu exp packag import import import develop languag process compon gate import class implement resourc public class extend implement class default xml configur edit exp directori structur file shown figur live directori gener build directori sourc file call live src directori lib directori class directori java class file doc directori process advantag creat complet sourc tree build structur disadvantag creat complet sourc tree build structur compon sourc chop bit tree case copi exist develop languag process compon gate figur bootstrap directori tree instanti resourc load resourc configur implement resourc write grammar grammar set import order sequenc grammar appropri creat file grammar sequenc list larger number grammar make process make thing simpler develop trick languag limit rule pattern trick overcom problem prioriti resolv ambigu appelt style match rule develop languag process compon gate prioriti oper length rule rule match longer pattern fire explicit prioriti declar option prioriti function assign rank higher higher prioriti prioriti default order rule case factor distinguish order rule state appli rule state higher prioriti prioriti oper singl problem deal ambigu issu solut creat temporari set annot initi manipul temporari set phase convert temporari annot phase perman annot singl final phase default set grammar neg oper neg oper solut creat higher prioriti match style match appelt work creat neg simpli state lh rule pattern rh posit rule fire neg pattern vice end result neg oper variat develop creat dummi annot rh neg give dummi annot rule featur obviou neg rule fire java code rh print messag rule fire match neg posit rule rule match surnam comma set initi initi po categori neg rule fire categori prevent posit rule fire match develop languag process compon gate match match special charact singl doubl quot match doubl quot refer previou annot annot gener phase refer kind annot annot curli featur valu refer annot make input specif annot refer includ list context left context pattern round bracket round bracket pattern context locat annot locat import rememb context consum rule phase context left context rule pari debug add option top grammar control appelt debug true develop languag process compon gate avoid conflict wai match found text conflict handl prioriti mechan rule prioriti final rule simpli match random fire lead ot avoid java code rh java code rh rule featur percol delet previou measur length perform altern oper depend featur annot featur percol copi featur previou featur simpl code match annot featur gender featur assign gender featur add annot creat bind label match lh rule person creat call creat enabl add featur featur gender featur assign call gender add featur call rule assign creat annot add featur annot pattern match develop languag process compon gate speed grammar design huge impact process speed simpl trick process fast avoid oper replac predict string token longer avoid unnecessari element input specif begin grammar stipul annot consid input specif annot consid match token separ space token mention pattern rule phase requir judici move rule separ phase input emb applic creat edit test data creat run applic save restor lr data store measur differ annot set chapter gate compon model answer li good thing aspect concern worri intuit prove feel peopl martian direct contact extrem import part human life develop growth healthi person relationship punch keyboard symbol back suspect extend form abstract remot person effect peopl diminish quot gate architectur base reusabl chunk softwar welldefin interfac deploi varieti context design gate base analysi previou work infrastructur typic type softwar entiti found field nlp cl chapter research suggest profit support le softwar develop architectur break program compon type le practic vari wide predominantli research architectur avoid restrict sort compon develop plug infrastructur gate framework accomplish adapt version java bean compon framework sun section describ compon java section describ extend bean model develop languag process compon gate gate compon implement varieti program languag case repres system java class class call underli provid access layer hand implement compon gate compon repres entiti corpora repres entiti primarili gener ngram repres edit compon particip gui section discuss languag resourc process resourc set resourc integr gate collect reusabl object languag engin rest section describ lifecycl gate section describ process resourc group section describ relationship languag resourc data section set compon java simpl compon architectur gate resourc java java model softwar compon bean simpli java class obei interfac convent convent develop tool borland manipul softwar compon advantag user system extend wai touch underli core develop tool kei part java bean specif gate accessor mutat method data member member set tool figur inform provid java develop languag process compon gate bean constructor tool construct instanc bean complex rest section bean skip interest work gate quot al java websit javabean api make write compon softwar java program languag compon reusabl softwar unit visual composit servlet visual applic builder tool javabean compon bean context gate develop environ emphasi quot text visual note gate bean plug framework gate bean typic deploi applic compon featur public method builder tool visual manipul featur featur adher specif design pattern builder tool examin discern featur visual manipul builder tool maintain bean palett toolbox select bean drop modifi defin interact bean bean write line code gate develop set bean languag process task framework wire code builder tool discov featur process introspect bean support introspect adher specif design bean featur class examin bean design pattern discov bean featur class reli core reflect api section describ extend bean model develop languag process compon gate gate framework gate framework plug ol compon user system list url search start compon locat load system configur data load begin actual class load user request instanti perform compon load manag nativ data structur common inform data storag process execut set compon framework unit applic kei task develop environ facilit construct view measur result languag resourc process resourc section describ detail languag resourc process resourc terminolog introduc earlier happi term safe skip section le program consist data algorithm current softwar develop model data algorithm object system adopt approach refer good reason oo softwar easier build maintain varieti domain human languag process choic languag field frequent work independ algorithm process treebank develop independ parser train thesauru develop independ queri tag mechan type data languag resourc cover data lexicon corpora develop method jackson structur design structur analysi larg separ corpu text annot syntact develop languag process compon gate recognit adopt languag resourc refer resourc thesauri ontolog lr softwar wordnet user queri interfac prolog mean access underli data defin resourc lr process resourc refer resourc charact princip programmat parser speech tagger refer process perform text pr typic includ tagger word disambigu dictionari thesauru addit terminolog worthi note languag data refer lr core exampl languag corpora text speech record includ ad descript inform data languag refer lr pure grammar lexicon pr view algorithm map type typic lr map process mt map monolingu corpu multilingu align corpu support terminolog glean argument favour declar data structur knowledg argument current late earli mellish partli overli procedur natur previou techniqu augment transit network declar structur repres separ data languag algorithm data perform languag process similar separ gate adopt distinct matter conform establish domain practic terminolog impli model domain build softwar support model gate lifecycl resourc bootstrap note point due wim peter develop languag process compon gate redund implement process resourc applic languag resourc resourc gate languag resourc model document type annot schema chapter process resourc part system chapter visual resourc view edit chapter miscellan resourc chapter contribut develop gratefulli receiv note bug chapter develop resourc gate integr develop environ resourc applic creat run click creat doubl click tab select resourc run applic necessarili transfer compon set displai hand side main window set select compon click left arrow ensur compon list left correct order process select compon move list arrow bottom pane move left hand select languag resourc left final click applic select gui configur option note chang font config store develop languag process compon gate cycl perform evalu languag measur speak express measur express knowledg unsatisfactori begin scarc thought advanc stage scienc count count count metric evalu inform extract research decad connect muc muc evalu metric recal tend slight variat metric tradit field ir rijsbergen frake measur number correctli identifi item percentag number item identifi measur item system identifi fail retriev correct item higher system ensur identifi correct error rate measur number incorrectli identifi item percentag item identifi altern recal measur number correctli identifi item percentag total number correct item measur item identifi spuriou identif made higher recal system miss correct item tradeoff system easili made achiev make mistak identifi miss rijsbergen develop languag process compon gate conjunct weight averag weight set recal deem equal import posit metric deal wide varieti text depend rel document rich compar system document rel document rich equal system compar singl perform document type significantli number type result entiti type skew compar impact error total number correct entiti error total assum document length posit score ident common metric evalu system defin recal measur correct correct spuriou correct correct miss β β reflect weight β set weight equal spuriou constant independ document number token sentenc document note annot partial correct entiti type correct span overlap ident partial correct alloc half weight rel number entiti type found set document develop languag process compon gate evalu ir evalu metric error rate stem ir literatur man frake metric wai import differ typic inform retriev task consist binari item retriev relev item retriev rank order typic rank kei simpli set correct item question frequent addit retriev classif binari relev class alloc measur separ element misclassifi count wrong separ task miss class simultan spuriou class twist fact document retriev fact made typic peopl relev document found top percent rank reflect metric peopl typic entiti type entiti correctli classifi proport entiti belong type impact outcom proport relev document collect ir discuss section rel document rich import concept make distinct slightli type compar system set document compar perform singl system set document type evalu enabl system develop compar perform system system type evalu test perform robust face data adapt domain rel document rich major system compar equal foot crucial order result evalu method singl number measur perform metric darpa al model stem field develop languag process compon gate standard save time measur direct salari cost measur main advantag type evalu enabl evalu adapt depend requir model perform term cost error correct glass cost model expect prior target statist defin error cost typic miss categori result person import date expect cost error typic base probabl test make assumpt suitabl test corpu rate entiti occurr similar evalu corpu final score produc figur perfect score main advantag cost model appli applic chang applic model competit danger model develop tune system good end user advanc research annot debug measur tool annot diff tool activ select tool menu top window window select kei document load annot set annot type evalu posit select annot type relev annot denomin token weight chang default set give recal equal click displai result note window resiz drag window edg intern bar main kei annot displai sort categori click relev column header kei annot align indic colour code legend displai posit displai annot criteria averag reason criteria deal partial correct wai strict measur consid partial correct incorrect develop languag process compon gate measur consid partial correct correct averag measur alloc half weight partial correct averag strict work unicod chapter visual chapter detail visual resourc bundl gate chapter document annot simpl data set document featur corpu gate java set member document corpora document type lr java store inform resourc associ arbitrari inform rang document piec annot model document text present version add support java set content annot featur direct acycl graph annot model java set annot annot consid arc start node end type node pointer sourc develop languag process compon gate charact offset annot schema exampl section show simpl exampl annot document materi adapt tipster architectur design document gate version base version similar annot multipl span annot annot singl node pair current model larg compat liberman roughli isomorph adopt commun shown form tabl top tabl document immedi line document show posit charact scale pictur origin tipster architectur design document underneath annot line annot shown span offset deriv featur integ annot id featur shown form show singl sentenc result annot token sentenc boundari recognit token singl part speech tag set pennsylvania tree singl indic type annot typic organ describ hierarch decomposit text simpl illustr decomposit sentenc token complex case full syntact sentenc noun phrase verb verb phrase verb level individu token decomposit repres annot nest set span illustr elabor includ inform node tree repres annot type hierarch structur recov span desir record structur directli constitu featur sequenc annot repres constitu initi annot annot type constitu develop languag process compon gate text annot id type span end featur token token token token token sentenc tabl result annot singl sentenc text annot id type span end featur token token token token token sentenc tabl result annot includ inform develop languag process compon gate text anim chicken novemb descend prioriti urgent sky fall sky fall annot id type span end featur sourc date subject prioriti bodi sentenc sentenc tabl annot show document structur annot token sentenc constitu featur point constitu token refer annot repres tabl annot repres refer annot featur sequenc item separ comma special oper provid current architectur manipul constitu annot record structur includ document structur shown annot record document index perform retriev select inform field final involv annot effect modifi document current architectur make specif provis modif origin text made process spell correct inform record correct featur token annot possibl develop languag process compon gate text tackl annot id type span end featur token token token token token tabl annot modifi document view edit annot type system open document view doubl click icon left window note text displai long annot type belong annot set displai text select annot type view click text segment annot highlight main text window descript annot simultan displai bottom pane list sort ascend descend order click column head arrow indic direct sort click entri tabl highlight respect match text portion click part text main window bring box list annot select annot type highlight relev annot descript lower present present annot hand pane annot automat select relev text main window appropri highlight cursor displai scroll keyboard scrollbar main viewer displai click header top main window error occur messag tab flash addit popup error messag occur develop languag process compon gate ad annot order annot relev annot schema load default annot type automat type annot annot schema xml select languag resourc process repeat annot type repeat document order chang set default schema load file modifi gate built annot schema annot type schema present insid gate ad edit add select select annot set select annot creat annot window automat open select featur list click arrow transfer list current featur featur valu edit click annot ad annot annot descript tabl exist annot modifi select tabl doubl click bring featur window schema featur select annot edit featur add delet annot annot delet select click select delet annot text save data store creat data store click data store select option data select data store type creat directori data store data store directori save text data store click document select option creat modifi file save xml click document icon left window option reload usual select languag file menu select languag resourc icon load document data load languag resourc open data doubl click view content doubl click relev file displai text text main treat document develop languag process compon gate document format xml chapter regular express annot chapter describ java annot pattern engin finit state transduct annot base regular express version common pattern specif languag grammar consist set consist set rule phase run sequenti constitut cascad finit state transduc annot rule consist annot pattern regular express oper consist annot manipul statement annot match lh rule refer rh mean label attach pattern element section formal definit exampl section describ relat section describ algorithm label class section section explain compil process formal descript grammar similar except figur bnf descript grammar rule good descript origin version languag doug manual doug great implement develop languag process compon gate basic constraint specif curli conjunct specifi match point annot graph complex constraint specif round bound label label rh access annot match complex constraint complex constraint kleen oper appli sequenc constraint repres sequenti disjunct repres separ constraint convert format accept ll parser fragment grammar base origin specif tipster work group chair boyan constraint line basic complex develop languag process compon gate rule rule action constraint constraint constraint action action action java code figur bnf grammar develop languag process compon gate complet rule sequenc number creat annot span attribut rule relat differ spec context lh function call lh string shorthand lh rule applic algorithm section express relat label unbound lh evalu rh evalu bind scheme descript section arbitrari java code rh macro macro rh lh grammar compil store java object full implement formal power languag rh delet straight rule lh regular languag rule rh perform arbitrari transform rh fire lh effect rule applic referenc phase recognit power regular develop languag process compon gate algorithm rule applic rule appli rule appli point document longest match rule appli point appli appelt rule set phase consid singl disjunct express effici implement construct singl automaton rule solv emploi input build machin capabl recogn situat match rule make bind occur time rule appli machin finit state machin similar lexic determinist finit state fsm built algorithm annot graph order find situat fsm algorithm step order creat fsm read descript extern version step build nondeterminist fsm java object result process fsm initi state set final rule rh execut case nondeterminist fsm empti transit label order build fsm implement version algorithm convert regular express nondeterminist fsm convert determinist determinist fsm state worst case number state nondeterminist case effici backtrack nondeterminist fsm determinist issu address basic big mean initi state empti transit lead rule fig convert initi state set initi state fsm rule state comput transit classic algorithm requir check develop languag process compon gate figur nondeterminist fsm input symbol set reachabl state problem input symbol set restrict similar automaton infinit set input symbol set rule describ finit set real problem check transit restrict safe transit set restrict safe assumpt result state transit start transit consum symbol problem check outgo transit check transit lead issu imagin part transit graph fsm figur transit restrict transit depict graphic figur colour imagin set restrict common part yellow develop languag process compon gate assum moment current node fsm graph activ fsm state annot graph set annot start current node annot graph advanc fsm transit graph order find subset annot match restrict move state state classic algorithm match annot restrict return boolean set match restrict mean match restrict common part probabl structur fsm transit graph lot transit start node mean lot condit check time improv combin restrict outgo arc state fig figur combin match process match convert transit matcher fig compound restrict check state collect restrict label outgo arc transit restrict form form group restrict type branch creat compound restrict form develop languag process compon gate group care mix restrict creat unnecessari restrict queri restrict annot graph match note previou queri restrict ident branch creat data structur link bind result queri fig figur build compound matcher machin actual match queri run result store set annot pair annot st instanc instanc move state bound node annot graph pair annot st instanc instanc move state bound restrict refer type annot branch restrict type queri type run branch restrict type annot develop languag process compon gate node annot graph build compound matcher detect queri depend expect result queri subset result kind situat mark queri run oper avoid restrict search return result restrict search return object restrict queri algorithm figur annot graph algorithm graph start leftmost node rightmost path found sequenc match annot start match path view classic path sequenc step set annot start node path graph note step continu rightmost node reach annot current step match made finit state machin resembl lexic main differ scanner input transit state base match set object set restrict constraint group lh develop languag process compon gate algorithm leftmost node creat instanc fsm add list activ fsm instanc set current node leftmost activ instanc fsm instanc final state save clone set accept fsm fsm reach final read annot start current select set annot advanc step transit graph set creat instanc put activ list make consum set make bind process instanc advanc annot graph rightmost node end match discard end set activ instanc fsm empti end set accept fsm empti accept fsm select match longest path length select highest execut action final state select fsm match fail start node end set activ fsm instanc activ instanc continu set annot start current node case remov set brill style process accept instanc develop languag process compon gate label bind scheme label bind match annot scope label bind annot match scope label due ambigu kleen constraint group label kleen oper kleen label distinguish label constraint bracket kleen appli answer interpret difficult rule develop disallow make match annot label add label mean span annot match assign annot creat rh rel label ordinari span outermost corner annot match oper disappear gate version elimin problem rh interpret unbound label refer bound rule fire express assign rh refer unbound label evalu rh express involv unbound oper evalu class main extern interfac class parser implement input produc grammar final java lot class produc ascii live parser directori develop languag process compon gate grammar result object class set rule constant held interfac test har implement pattern applic algorithm make call boolean document throw method rule turn defer iter set match call return return rule void throw call success result applic rule document implement match method annot consum match composit span singl span cover set gener access maintain map access arrai refer rule give access annot built ensur built avoid store annot match element construct process iter element element annot bottom store annot time call bind environ yield repres bound annot span retriev develop languag process compon gate rh code imagin write rh rule bind set annot repres simpl number label creat annot span integ repres sum individu number rh consist list anonym label shorthand notat implement limit sum oper anonym block evalu block evalu declar made anonym block referenc subsequ block label block evalu bound lh match symbol doc scope document transduc rule belong process match sequenc store sum run total int loop round annot lh consum number string annot string number string add run total ignor number number annot develop languag process compon gate stuff convert code form class creat packag import import import import import public class implement public void int string develop languag process compon gate compil compil translat grammar java object target gate api regular express construct parser transduc base regular languag effect deploi similar techniqu lexic parser gener compil compil gener code similar chapter inform extract system gate origin develop context inform extract system languag shape size creat gate compon distribut al descript princip architect system gate version robert kevin humphrei work live system design idea system chapter system sheffield deriv distribut gate version vanilla system gate version distribut system call system borrow number idea tagger mark number includ relianc finit state algorithm languag chapter develop cunningham shallow process hook compon complex extract task full pipelin base backend shallow analysi figur compon includ develop languag process compon gate figur develop languag process compon gate gate linguist resourc reli gener simpl rest chapter describ compon split text simpl token punctuat word type distinguish word type punctuat aim limit work enabl greater flexibl place burden grammar adapt rule rule left hand side hand side lh regular express match rh describ annot ad lh separ rh oper rh detail primit construct file rule word begin singl capit state sequenc begin letter sequenc annot type attribut attribut develop languag process compon gate token type default set kind token word word defin set contigu upper includ hyphen form word attribut valu initi letter rest letter letter mixtur upper letter includ categori number number defin combin consecut digit number symbol type symbol currenc symbol symbol repres number consecut currenc symbol punctuat type punctuat start punctuat end punctuat punctuat punctuat symbol separ token white space divid type space control pure space charact control charact contigu set space control charact defin develop languag process compon gate descript appli default altern creat choic determin time text process gazett gazett list plain text entri line list repres set dai small section list unit european currenc unit fr german mark german mark taiwan dollar taiwan dollar nt dollar nt dollar index file access major type minor type column refer list column major minor type list compil finit state machin text token match machin annot featur major minor type grammar rule type identifi circumst gazett list resid directori index file specif dai minor type order match inform specif kind date major type enabl token annot inform date identifi inform found section includ languag list languag concern monolingu recognit develop languag process compon gate sentenc sentenc cascad transduc segment text sentenc modul requir tagger gazett list abbrevi distinguish full stop kind sentenc annot type sentenc sentenc break full annot line seri punctuat mark sentenc domain part speech tagger tagger modifi version brill produc tag annot word symbol tagger default lexicon ruleset result train larg corpu wall street modifi manual addit lexicon exist text text default lexicon replac lexicon load time default ruleset case semant tagger semant tagger rule act annot assign earlier order produc output annot entiti rule separ separ lh perform rh describ annot assign pattern term annot assign gazett main wai pattern string attribut token annot assign macro lh rule mean express inform call rule develop languag process compon gate reason simpli avoid repeat inform rule macro insid macro oper pattern descript label annot label attribut assign label local reason conveni necess pattern provid pattern set round bracket rh rule inform annot inform annot transfer lh rule label annot entiti type attribut valu ad annot rh rule java code creat manipul annot simpl pattern award annot type entiti annot attribut attribut attribut simpli process manual rule grammar rule essenti type type rule involv gazett defin small set format fairli straightforward offer potenti ambigu type rule reli heavili gazett cover wider rang possibl mean rule describ greater potenti ambigu lead necess rule order discuss singl rule suffici identifi ip basic format seri set connect dot rule develop languag process compon gate identifi date rule date inform format wed wed juli wed juli type date express classifi date late mondai st dai bc march april mean greater potenti ambigu month year christian mean contextu inform disambigu guess base frequenc dai week specif state length confin project ambigu develop languag process compon gate context context dealt grammar rule pattern annot set round bracket context includ set bracket context pattern match context pattern label annot context pattern occur context form part pattern annot rule time macro year occur word rule rule macro email address occur insid angl bracket form part rule prioriti grammar control begin grammar brill style mean rule match region fire result segment text alloc entiti order develop languag process compon gate rule fire match found make rule end match found rule attempt longer match style appelt rule fire region set prioriti rule prioriti oper rule match region document start point match longest region fire rule match highest prioriti fire rule defin earlier grammar fire option prioriti declar posit integ higher greater prioriti default prioriti declar rule prioriti lowest rule locat potenti match text rule assum text defin gazett sea defin type rule develop languag process compon gate match longer region text start point assum text rule prioriti rule produc import rule case import point awar oper singl grammar make prioriti global rule singl ideal due combin rule entiti type singl grammar index file defin grammar order fire orthograph compon procedur gazett grammar phrase entiti type featur give grammar rule type pattern develop languag process compon gate pound rule step separ phrase token word number letter includ number sequenc punctuat individu charact separ number consecut space control charact singl string kind length string kind length string kind length string kind length string kind length string kind length string kind length step list lookup gazett list search find occurr match word text find match string step grammar rule grammar rule monei invok macro million billion string exist pass develop languag process compon gate macro amount number macro option number sequenc comma option space option million billion rule invok string identifi amount number option unit currenc determin identifi currenc rule entir string annot number entiti type kind rule chapter appendix design note gate java bean plug bean respect commun mean gate framework commun handl model compon event compon defin conform interfac ensur separ interfac implement distribut parallel fulli work handl control compon distribut data http reason ad normal bean mech pr vr characterist gate model make explicit phase pattern gate structur number call clever idea mind mine pattern model thing extens set compon section separ compon control section hide implement interfac section design note interfac packag describ gate view compon architectur principl user architectur extend set type type express compon express architectur base agent avoid past associ term idea bit code move machin volit result anthropomorph mobil correl intellig drop gate architectur framework express class framework class conform interfac standard properti case properti base java bean compon addit compon autom load thread distribut compon inherit repres entiti corpora repres edit compon particip repres entiti primarili gener ngram model control al softwar pattern divid interact applic compon model core function data view displai inform user design note control handl user input view control user interfac mechan ensur consist user interfac model variant relax separ view control view compon combin control view implement user interfac system benefit arrang coupl document view compon enabl multipl simultan synchron view document java slightli mvc separ applic type maintain data provid data accessor method paint visual data handl event encapsul architectur mvc applic flexibl reusabl tradit counterpart java user interfac version classic mvc meant support pluggabl feel applic gener gate regard mvc architectur swing toolkit lr vr view pr control sit easili mvc pr control state machin pattern interfac architectur principl implement type gener hidden client architectur framework express except util client framework work packag packag interfac definit instanti interfac obtain factori class subsidiari packag gate provid implement interfac access factori avoid directli construct class packag annot factori except handl note stuff appendix state machin pattern chapter describ individu grammar gate entiti combin relat default ne grammar provid guidelin adapt creat grammar document specif grammar core document combin comment relev grammar file chapter inform design grammar rule tip ensur maximum speed file list grammar correct process order order grammar process grammar depend annot produc earlier grammar default grammar consist date state machin pattern org loc grammar process gener macro grammar set consist macro defin space control charact process grammar depend text defin restat grammar big advantag mean default grammar grammar adapt deal treatment space control charact file chang grammar individu grammar grammar dummi rule intend fire simpli ad grammar set specif rule add rule match pattern design produc output empti grammar rule identifi titl gazett list add gender featur list gender featur state machin pattern order improv pronoun grammar creat separ annot type titl grammar initi rule locat person entiti rule creat temporari discard major convert final annot grammar rule begin neg rule mean detect give special annot annot order prevent neg oper person defin macro end combin previou surnam po tag case inform person mark annot percol featur inform gender previou annot locat rule locat fairli defin grammar ambigu resolv top level locat combin entiti dealt annot entiti type combin phase locat gazett list kei word citi locat annot phase organ organ tend defin straight lookup gazett combin po case inform kei word organ identifi contextu inform phase org organ annot state machin pattern ambigu ambigu resolv immedi left phase christian locat resolv default person locat christian end resolv slightli rule contextu inform rule involv contextu inform invok invok join annot person organ annot type handl grammar run grammar fix erron annot creat eleg solut creat problem surnam person stop person firstnam organ tag annot left correct date grammar date includ extra context prevent date erron middl longer express treat case express tag tag date grammar base rule time date complex potenti pattern repres larg number rule macro state machin pattern time date mutual distinguish earli time year gener tag separ recombin form final date annot phase time year combin ambigu time span time fix time date grammar handl rel absolut date time hour month explicit kei word item gazett list grammar cover rule monei percentag rule fairli keyword gazett ambigu monei explicit currenc denomin rule address cover ip phone fax postal address highli cover simpl pattern phone number requir contextu inform uk format handl foreign zipcod phone number format envisag futur annot produc type phone replac phase final address annot featur rule email address url separ grammar address simpl reason identifi address type speed place state machin pattern separ grammar elimin input requir grammar identifi basic mean combin number letter act refer number entiti type grammar simpli identifi gazett add phase aid recognit entiti type person organ discard clean phase requir final annot type grammar temporari annot assign earlier convert final annot reason resolv ambigu entiti entiti type handl singl grammar ambigu resolv techniqu combin annot date singl entiti rule grammar java code rh remov exist temporari replac annot retain featur temporari annot track person male locat citi countri enabl track rule debug sake phase call final short grammar find proper noun unknown annot unknown annot match annot chang refer match entiti remain unknown annot debug input addit grammar process resourc grammar unknown annot occur context belong person typic grammar benefit learn automat context context hard find manual requir larg volum train core confin context fairli gener grammar org grammar oper similar principl slightli orient busi fulfil gener criteria previou grammar provid insight detail loc grammar oper similar manner gener context coordin pair hyponym type inform grammar simpli aim clean temporari annot delet refer liberman bird liberman formal framework linguist annot technic report depart comput inform al cunningham experi unifi textual infrastructur languag process workshop toolset architectur build nlp system booch analysi design edn al cunningham integr multimedia textual softwar architectur languag technolog technic report institut al team java tutori rest jdk evalu metric fourth messag understand page cunningham support softwar languag engin research technic report centr comput cunningham definit short histori languag engin journal natur languag refer cunningham inform user guid research depart comput cunningham java annot pattern engin research depart comput cunningham softwar architectur languag engin unpublish phd cunningham softwar architectur languag requir analysi submit al black softwar framework natur languag process method languag process septemb book form ucl al wilk gener architectur text engin approach languag engin technic report depart comput al manual technic depart comput al wilk compat project sheffield advanc text tipster program phase ii morgan al gate gener architectur text engin confer comput linguist august al softwar infrastructur languag engin aisb workshop languag engin document analysi april refer al current trend softwar infrastructur nlp confer method natur languag process septemb al wilk gate gener architectur text engin tipster text program month workshop morgan al wilk softwar infrastructur natur languag process confer appli natur languag process march al wilk level plai field languag resourc evalu workshop distribut access lexic resourc confer languag resourc al wilk implement tagger gener architectur languag engin confer method languag engin page al wilk experi languag engin year gate workshop refer architectur data standard april societi studi artifici intellig simul behaviour al wilk uniform languag resourc access distribut context gener architectur text engin workshop ontolog languag resourc septemb al wilk softwar infrastructur refer languag taxonomi previou work requir analysi intern confer languag resourc evalu al wilk experi gate nlp workshop toolset architectur build nlp system al java annot pattern engin research depart comput novemb al martin topic detect track evalu proc darpa broadcast frake editor inform data structur algorithm prentic englewood wilk wilk inform document retriev journal al humphrei gate user guid al humphrei gate environ support research develop natur languag engin ieee intern confer tool artifici intellig octob experi languag engin algorithm intern confer languag resourc evalu page mellish mellish natur languag process prolog refer grishman tipster architectur design document version technic independ assumpt rapid train execut po tagger annual meet associ comput linguist hong octob al modul specif jackson principl program design academ confer languag resourc evalu confer languag resourc evalu man foundat statist natur languag process mit support materi al wilk survei gate technic report depart comput al wilk entiti recognit text type recent advanc natur languag process al cunningham build corpu south asian languag quarterli artifici al wilk uniform languag resourc access distribut workshop distribut access lexic resourc confer languag resourc methodolog offic system acm transact offic inform garlan shaw garlan softwar architectur prentic al wilk tag languag engin european confer artifici intellig page unicod consortium unicod consortium unicod version rijsbergen van rijsbergen inform retriev yang evalu statist approach text categor journal inform modern structur analysi prentic rise american programm prentic make xml peopl feel wast time updat cv latest trick xml sourc translat pdf html version provid print web view nice readi end good html product don lesli lamport
IR/1297 5 visual rank link structur ulrik brand depart comput inform box germani abstract method rank world wide web resourc posit link structur web receiv provid rst ectiv mean search engin cope growth diversi cation web show layout ectiv visual underli link structur comput sync iter comput util popular rank visual provid valuabl insight link structur rank mechan alik analysi queri mainten search evalu web graph model introduct direct graph induc hyperlink structur web recogn rich sourc inform understand exploit structur proven potenti deal growth diversi cation web wide recogn kind pagerank index emploi googl search engin pagerank model algorithm rank web resourc posit link structur goal supplement rank visual graph comput graph visual activ area research integr quantit analysi begin receiv attent dicult understand determin rank visual prepar explicitli account design graph visual show vertex promin structur context introduc vertic dimens layout space reserv repres promin horizont layout adapt framework layer graph draw scale graph hundr vertic present highli desir subgraph web typic correspond relat resourc proc intl workshop algorithm data structur lectur note comput scienc class graph layout algorithm exhibit properti spring rang practic recent extend graph thousand vertic requir complex memori suitabl situat appli spectral graph layout formal comput similar common rank techniqu background rank sect actual layout de nition comput sect sect discuss applic provid exampl gener data structur rank web resourc structur featur web captur direct graph set vertic repres set resourc direct edg resourc resourc hyperlink graph consid paper assum connect parallel loop posit real weight uv edg uv adjac matrix uv uv uv vertex uv vw frequent adjac set eigenvalu eigenvector background matrix comput vector de ned vertic graph call promin promin vertex rank obtain promin index order vertic promin model captur explicitli implicitli ned notion vertex promin graph gener de ned undirect rst outlin eigenvector central nice illustr import common popular rank discuss assum promin vertex understood proport combin promin uv constant introduc system equat nonzero solut de nition yield adjac eigenvector rank vertic notion princip eigenvalu largest gener prefer princip eigenvector obtain power start nonzero vector iter multipli matrix current author pagerank katz statu fig promin indic direct grid matric consid origin larg multipl carri comput iter assum vector normal length start vector comput serv avoid numer diculti number grow ect rel promin vertic elabor indic de ned direct graph discuss fig illustr acycl grid grid plane grid point lift promin hub author natur notion promin web resourc extent refer web page special list resourc properti list resourc notion promin complementari mutual reinforc notion promin resourc call author hub hub score page proport combin author resourc link author resourc proport combin hub score page link hub author score comput iter altern iter written aa easi hub author indic graph adjac matrix correspond eigenvector central weight undirect graph adjac matrix aa fig vertic fall diagon grid highest undirect graph induc compar undirect graph induc aa indic hub found diagon pagerank variant eigenvector central contribut vertex vertex promin weight pu du requir probabl distribut set notion nice interpret stationari distribut simpl random walk graph random surfer edg leav vertex chosen equal probabl adjac matrix normal row sum diagon matrix diagon stochast matrix transit stationari distribut sati es notion promin vertex comput break strongli connect compon promin vertic avoid introduc escap mechan probabl distribut vertic user prefer gener popular probabl random walk pick edg graph remain jump vertex index de ned equal hold probabl distribut express pagerank eigenvector central weight graph complet set addit escap edg modi ed matrix irreduc aperiod iter converg uniqu promin vector grid fig random surfer jump walk upper side continu upper corner katz statu index gener simpli measur social promin vertex determin number direct path arbitrari length end uenc longer path attenu decai factor recal entri power adjac matrix unweight graph give number path length pair vertic notion promin determin paramet correspond fraction statu pass direct edg sucient small valu conveni choic maximum vertex sum converg statu vector obtain solv solv system linear equat directli prohibit larg graph standard matrix approach approxim solut iter updat step yield iter nice ect underli notion ad contribut vertic farther farther observ fig attenu uenc vertic lower left suce discrimin promin vertic upper de nition promin gener formul statu network put twist eigenvector central addit promin vector weight obtain eigenvector central pagerank provid exist equal uniform edg weight obtain promin index compon larger katz statu index spectral graph layout previou section formal similar de nition popular promin indic comput variant matrix power iter combin current score neighbor larg run time spent data transfer intern extern memori desir addit swap introduc layout algorithm produc layout synchron oper data promin implement base principl rank algorithm simpl matter augment exist system rank resourc comput layout graph layout eigenvector simpl graph obtain omit multipl edg recal direct repres promin dimens adjac matrix skeleton diagon matrix laplacian matrix interest applic area matrix interest graph minim quadrat form lx correspond minim squar distanc pair adjac interpret vector vertex posit correspond spring spring repel forc minima obtain assign posit vertic assum undesir solut avoid xing select vertic distinct posit minim subject boundari condit famou layout model requir knowledg vertic xed note undesir minima eigenvector eigenvalu lx lx minim lx subject eigenvector symmetr matrix orthogon desir solut normal eigenvector eigenvalu vector call vector distanc minim graph partit yield layout edg short subgraph cluster rank visual dimens desir fig reason choic free dimens normal eigenvector minim object function subject orthogon rst solut layout obtain typic spring embedd eigenvector fig spring embedd produc uniform edg eigenvector structur cluster vertic comput eigenvector eigenvector smallest eigenvalu larg matric comput lanczo method popular promin indic comput variant simpler power eigenvector eigenvalu largest magnitud synchron layout promin matrix spring embedd spectral layout fig layout random planar graph maximum vertex crucial observ eigenvector order magnitud eigenvalu straightforward applic power iter return princip eigenvector trivial eigenvector power iter vector orthogon princip eigenvector yield eigenvector eigenvalu desir layout rst dimens iter vector orthogon trivial eigenvector approxim solut rst dimens yield dimens vector orthogon respect vector set orthogon respect trivial eigenvector correspond entri entri obtain vector layout carri augment power iter random start vector repeatedli orthogon respect layout assum zoom multipl line omit dimens determin layout converg slower promin iter sucient reason layout applic web graph model queri result demonstr visual approach di erent kind random web graph gener slightli modi ed version evolv copi model model obtain altavista queri librari ecient data type algorithm web graph model linear growth graph grow vertex time time prototyp chosen exist vertex gener vertex assign xed number outgo edg xed ith edg point randomli select vertex exist remain probabl point vertex ith outgo edg prototyp vertex gener introduc multipl prototyp outgo edg introduc copi case graph evolv acycl exponenti growth graph grow xed fraction current size time step vertic receiv xed number exist target receiv incom edg xed sourc chosen uniformli random exist vertic probabl proport current simpler model exist vertic chosen uniformli random initi gener cyclic sequenc vertic vertex link xed number predecessor successor edg small probabl chose destin uniformli random figur show spectral layout graph gener model rank replac vertic dimens pagerank promin index visibl cluster evolv copi model promin resourc correl ag indic outlin sect gure graphic support death delet vertic evolv copi model realist spectral layout reveal cycl rank show model yield structur queri result data compil similar hit algorithm altavista search engin page word rst url return root set expand altavista page link resourc root set ad resourc link page root set graph complet ad edg linear growth evolv copi model exponenti growth evolv copi model model fig web graph model spectral layout spectral layout page result set vertic comput carri larg compon graph poorli connect vertic remov prevent extrem cluster graph vertic edg fig graph shown vertic posit vertic horizont promin indic link promin resourc color red promin resourc match expect recommend visibl serv distinct user directori upper note conclud vertic close vertic close connect zoom imag safe assum vertic separ vertic distant structur featur serv distinguish queri result keyword di erent context figur show top author surprisingli distinguish rest di erent expect locat larg repositori develop develop virtual connect virtu layout approach vertic posit phenomenon detect visual explor resourc site color yellow vertic high hub score site simpl graphic explain origin hit algorithm link site method web graph visual unambigu identi cation promin resourc show entir graph cluster layout visual comput synchron common rank techniqu reorgan storag reduc extern memori access directli appli layout algorithm expect visual visual inspect teach commun rank evalu illustr stochast model web graph main advantag spectral graph correspond distanc minim drawback case underli undirect graph poorli denser subgraph cluster small interv problem address full version analysi converg properti iter comput acknowledg marco collect data sect stephen muth discuss iter comput katz statu index fig author pagerank visual queri result refer bharat improv algorithm topic distil hyperlink environ proc ann intl acm sigir conf research develop inform pp factor weight approach statu score cliqu identi cation journal mathemat power famili measur american journal brand wagner contextu visual actor statu social network data visual proc joint eurograph ieee symp pp winograd web ieee bulletin technic data june brin page anatomi hypertextu web search engin comput network isdn structur theori network model social action academ kleinberg mine web link structur ieee kleinberg automat resourc compil analyz hyperlink structur text comput network isdn di graph algorithm visual graph prentic freeman central social conceptu clari cation social theoret foundat central measur american journal fast algorithm draw larg graph proc intl symp graph lnc golub van loan matrix comput john hopkin harel fast method draw larg graph proc intl symp graph lnc ecient comput pagerank technic report stanford approach cliqu identi cation katz statu index deriv analysi kaufmann wagner draw method lnc tutori kleinberg authorit sourc hyperlink environ journal stochast model web graph proc ann ieee symp foundat comput pp platform combinatori geometr comput cambridg applic laplac eigenvalu graph graph symmetri nato asi seri pp citat uenc journal aggreg scienti applic literatur physic inform process rao silk sow extract usabl structur web proc acm conf human factor comput pp spectral graph partit planar graph nite element mesh proc ann ieee symp foundat comput pp method visual understand hierarch system structur ieee transact man draw graph london mathemat multilevel algorithm graph draw proc intl symp graph lnc watt collect dynam network
Agents/1298 1 survei methodolog carlo iglesia garijo jose gonzalez dep ing universidad de spain dep de de sistema universidad de spain abstract articl introduc current methodolog extend exist objectori knowledg engin suitabl approach agent drawn survei introduct agent technolog receiv great deal attent year industri begin interest technolog develop product spite develop agent architectur success work techniqu develop applic agent technolog role methodolog assist phase life cycl includ manag articl review current approach develop methodolog avoid build methodolog research methodolog approach extend exist methodolog includ relev aspect agent extens carri object orient methodolog knowledg engin methodolog review area relev develop ao problem found appli directli exist methodolog extend solut review approach formal approach techniqu agent research drawn research fund part commiss european commun esprit basic research project modular integr connectionist symbol process spanish govern project research partli carri author visit dep de sistema de extens methodolog advantag approach reason cite justifi approach extend methodolog similar paradigm agentori paradigm earli time distribut artifici intellig close relationship dai concurr program establish state shoham agent consid activ object mental state paradigm messag pass commun inherit aggreg defin architectur main differ constrain type messag ao paradigm definit state agent base advantag commonli usag languag implement system consid natur framework popular methodolog potenti advantag methodolog industri success object model techniqu object orient softwar engin design drive unifi model languag experi kei facilit integr agent technolog softwar engin reluct learn complet manag prefer follow methodolog successfulli test advantag experi learn quicker common view system methodolog interest describ static object structur object structur dynam describ object function describ data flow method object techniqu object identif identifi case class collabor card aspect address spite similar object agent simpli object methodolog address aspect object agent commun object method agent distinguish type messag model messag frequent complex protocol negoti agent messag decid execut request action differ consist agent mental methodolog defin techniqu model agent carri plan agent social dimens procedur model social relationship agent defin exist solut section methodolog analysi design agent model techniqu system bdi agent agent orient methodolog model analysi design burmeist burmeist defin model agent agent model agent intern structur describ relationship agent role cooper describ interact agent process step develop model agent agent environ identifi extens crc card includ plan cooper attribut identif role agent elabor diagram omt notat inherit hierarchi relationship agent cooper cooper cooper partner type interchang messag protocol agent model techniqu system bdi agent method defin main level model bdi desir agent extern viewpoint consist decomposit system agent definit interact carri agent describ hierarch relationship agent relationship concret interact model describ servic interact agent extern system intern viewpoint carri model bdi agent class belief describ belief goal describ goal event agent adopt respond plan describ plan agent achiev goal develop process extern viewpoint start identif role applic domain order identifi agent arrang agent class hierarchi omt notat role servic provid fulfil step identif interact servic inform content interact inform collect agent instanc model develop intern viewpoint start analysi mean achiev goal plan respond event achiev goal repres graphic notat similar harel statechart ad notion failur plan belief agent object environ model repres omt notat method method intend appli ma field cooper work analysi phase consist scenario identif natur languag main role plai human softwar object environ typic scenario role function descript agent role behaviour describ relev inform interact agent data world conceptu model data knowledg agent diagram entiti diagram interact simul definit suitabl interfac interact scenario design phase consist ma architectur scenario select scenario implement role plai agent scenario object refin world model defin attribut procedur agent specif element defin data conceptu model step analysi belief structur graphic notat describ process account goal interact step state model system design valid agent orient methodolog model methodolog combin methodolog model methodolog definit function integr manufactur open system identifi model function describ function mechan diagram includ select method depend input control case describ actor involv case notat dynam model intend object interact case repres event trace diagram agent orient compound ffl agent actor case identifi agent main function agent goal possibl diagram ffl coordin protocol state diagram ffl plan sequenc diagram extend event trace diagram includ condit indic plan invok ffl sensor input function model belief obtain object achiev goal model belief modif effector extens knowledg engin methodolog advantag approach knowledg engin methodolog provid good basi ma model deal develop knowledg base system agent cognit methodolog provid techniqu model agent knowledg definit knowledg agent consid knowledg acquisit process address methodolog extens current knowledg engin methodolog advantag acquir experi methodolog exist tool develop ontolog librari problem solv method librari methodolog extend appli project success aspect address problem subject knowledg engin methodolog present design knowledg model methodolog conceiv knowledg base system address distribut social aspect reflect attitud exist solut solut system model extend commonkad main reason select methodolog knowledg engin methodolog european standard knowledg model commonkad defin model activ build number separ model captur salient featur system environ review extens preliminari work methodolog glaser extens methodolog commonkad ma model model agent main model methodolog defin agent architectur agent classifi cognit reactiv knowledg describ cognit reactiv compet agent distinguish problem solv reactiv knowledg task knowledg task decomposit knowledg task model knowledg describ problem solv method strategi select reactiv knowledg describ procedur respond stimuli task describ task detail task solv user agent cooper describ cooper agent conflict resolut method cooper knowledg protocol ad interact system defin aspect agent societi architectur aspect agent design collect previou model order requir methodolog methodolog extend model defin ad techniqu methodolog protocol engin describ agent protocol methodolog start phase inform phase collect user requir obtain descript system user point view case techniqu interact case msc sequenc methodolog defin model analysi design develop life cycl methodolog defin constitu relationship constitu methodolog defin textual templat describ constitu set activ build base develop state constitu activ facilit manag project extens defin agent describ main characterist includ reason skill techniqu agent analysi actor syntact analysi problem applic heurist agent compon develop usag crc adapt agent orient develop task describ task carri task textual templat diagram describ knowledg agent carri task knowledg structur kad distinguish infer problem solv knowledg instanc model develop model infer agent rest agent author distinct autonom problem solv goal subgoal directli carri agent cooper problem solv goal subgoal carri agent cooper agent coordin describ protocol requir capabl develop model defin mileston mileston intend identifi interact mileston intend improv flexibl protocol negoti identif group coalit interact model formal descript techniqu msc sequenc sdl descript describ ma introduc agent societi descript multiag societi extens object model describ agent relationship agent agent societi structur commun detail agent human factor develop user interfac design collect previou model subdivid applic composit decomposit agent pragmat criteria select suitabl agent architectur architectur design relev aspect agent requir knowledg telemat facil platform select agent develop platform agent architectur methodolog successfulli appli research project intellig network manag system network servic develop hybrid system multiag system modular integr symbol connectionist knowledg base approach methodolog methodolog approach call distinguish main step design appli robot soccer team domain element agent behaviour list function object orient techniqu relat behaviour depend agent studi coupl graph dynam start end coupl graph cooper inform agent design methodolog busi process perspect methodolog describ commun environ intern commun diagram identifi current redesign improv effici busi process commun refin previou model describ detail contract petri net transact agent model transact diagram describ relationship goal task specifi task decomposit task diagram concern model content messag exchang techniqu formal approach formal approach bridg gap formal theori implement formal agent theori agent specif complet specif system formal method easili scalabl practic special verifi critic prototyp complex cooper system tradit formal languag provid eleg framework describ system level abstract notion time suit agent interact approach tempor modal logic dynam aspect agent basi implement verifi agent base system implement specif directli execut agent specif languag concurr metatem compil agent specif usag formal languag specif desir interest altern detail design languag methodolog desir design specif interact reason perspect base task decomposit techniqu base experi agent develop definit methodolog develop multiag system recent develop multiag system successfulli appli field multiag platform agent develop softwar engin perspect defin ao gener guidanc ma develop recommend review import contribut collect common mistak agent system develop archon experi archon complet develop environ methodolog design ma analysi combin identifi system main task decomposit preexist constrain approach design subdivid agent commun design agent design agent commun design defin agent granular role agent author design user interfac skill interchang messag list agent design encod skill agent made experi made develop environ rapid prototyp ma develop methodolog design extend stage knowledg acquisit buchanan al decomposit agent implement test integr ma coordin languag coordin languag altern interact model includ ao finit state cool formal languag advantag formal descript techniqu protocol engin method method iter design approach model agent ad system test model agent model develop model consist identif activ agent specif world knowledg plan abil suitabl agent architectur agent world model model repres environ agent oper detail world law coordin agent test agent task feasibl world model model defin world reflect action agent agent perceiv world coordin model model protocol interchang messag agent studi suitabl joint plan social structur refin method interest approach bridg gap theori practic refin method method start solut problem gener method abstract step identif assumpt made agent knowledg relax assumpt order obtain realist version distribut system system formal languag method account part problem agent solv articl shown emerg methodolog review methodolog extens knowledg engin methodolog relev aspect knowledg engin aspect cover discuss model model process methodolog shown open issu includ review methodolog mobil agent design user interfac design mention develop methodolog review question ao methodolog question ao methodolog mention engin approach system develop kei factor introduct industri principl develop special number agent system standard advantag engin test appli develop system agent technolog matur defin long standard definit agent agent methodolog present individu research program agent base applic agent architectur theori methodolog review shown conceptu level matter agent agent architectur agent languag support conceptu level ffl agent characterist agent includ skill reason capabl task ffl relationship interact agent lack standard agent architectur agent program languag main problem provid code gener standard agent design agent agent architectur analysi model independ agent describ system relationship ao methodolog agent architectur agent architectur account wai review methodolog select agent architectur consid design agent architectur select depend requir analysi model gener agent architectur guid knowledg acquisit process solut problem select agent architectur address muller present guidelin type architectur suit type applic review ao methodolog individu converg state review ao methodolog compar kei mental interact group model complementari model elabor methodolog refer barbuceanu mark fox captur model coordin knowledg system journal intellig cooper inform juli alan bond le gasser analysi problem research dai alan bond le read distribut artifici page morgan kaufmann san booch design applic redwood treur model system composit formal framework int journal cooper inform januari burmeist model methodolog analysi design work note workshop program distribut dfki document david cockburn nick jen distribut artifici intellig system industri applic ohar foundat distribut artifici page john wilei ann alexi philipp agent orient design soccer robot team intern confer system page decemb ration softwar corpor unifi model version ration softwar rose cooper system knowledg acquisit intern workshop cooper system page januari publish proc intern workshop acquisit knowledg februari march page de wooldridg formal system knowledg engin buchanan al construct expert system build expert system fip pub integr definit function model softwar standard model techniqu fip pub comput system laboratori nation institut standard md wagner methodolog foundat system uk special interest group foundat system publish knowledg engin review fisher wooldridg formal specif verif system intern journal cooper inform le gasser concurr process distribut artifici intellig nichola le distribut artifici theori page kluwer academ norbert glaser contribut knowledg model framework phd henri nanci novemb lynn hall user design issu distribut artifici intellig ohar foundat distribut artifici page john wilei harel visual formal complex system sci comput carlo jose juan analysi design multiag system workshop agent architectur juli atal extend version paper publish intellig agent agent springer specif descript languag technic june softwar engin case driven approach acm jen jackson meet design implement electron institut electr march jen wooldridg appli agent technolog appli artifici elisabeth margaret chong jiang methodolog develop agent base system integr zhang australian workshop lectur note artifici intellig model interact kb user newslett bc methodolog interest august aiai kinni agenti agent interact model intellig agent intern workshop agent languag lectur note artifici intellig volum david michael anand rao methodolog model techniqu system bdi agent van der veld agent break seventh european workshop model autonom agent world volum european develop integr io toru coordin protocol descript multiag system intern confer system page san june michael nathan mark dinverno agent theori agent case studi intellig agent iii lectur note artifici intellig moulin collabor work base multiag methodolog perspect fred soft fuzzi neural network distribut artifici page bernard moulin mario design method environ develop multiag system australian workshop distribut artifici page jurgen muller system engin knowledg engin februari jurgen muller agent system engin intern journal data knowledg engin special issu distribut muller agent thing intellig agent intern workshop agent languag lectur note artifici intellig volum ohar mj wooldridg softwar engin perspect system experi develop made nichola le distribut artifici theori page kluwer academ oval catherin method system design expert system annual technic confer british comput societi specialist group expert develop expert system british comput societi confer page decemb cambridg press mar ia system protocol languag specif cikm workshop intellig inform decemb michael johan hierarch case model graphic ieee intern symposium workshop engin march jen peter tutori messag sequenc chart octob model design van de veld methodolog kb develop netherland energi research foundat free yoav shoham program artifici march munindar michael larri stephen declar multiag system ieee transact knowledg data octob cockburn integr intellig system cooper commun electr distribut manag intern journal expert system perspect design cooper inform agent phd katholiek march joachim jacqu commonkad cooper knowledg base system kad user wiener design softwar wooldridg agent softwar engin septemb wooldridg jen pitfal develop sycara agent intern conferenceon autonom agent acm michael greg rebecca elk case studi design implement expert system intern confer expert system applic articl process macro packag llnc style
IR/1299 5 xml peter buneman susan davidson fan hara tan abstract discuss de nition kei xml pai attent concept rel commonli hierarch structur document scienti rel kei introduct kei essenti part design fundament data model conceptu provid mean tupl relat refer import enabl updat ect tupl tupl repres kei invari connect tupl entiti xml document doubl duti kei examin exist dtd reveal anumb case element attribut speci ed comment identi number scienti typic store hierarch data format ripe hierarch kei structur pennsylvania support part digit librari grant ii nsf support fund universidad feder brazil byron choi sahuguet copyright held hong kong acm form kei speci cation xml found xml standard xml data xml schema id attribut dtd uniqu identifi element xml document clear id attribut intend kei intern id attribut scope contrast uniqu entir document design set element student person ssn id id attribut kei mean limit unari kei attribut element id attribut element practic kei xml data introduc notion kei explicitli kei speci ed type de ned element type collect element xml schema elabor start point paper extend kei speci cation xml data kei term xpath express number technic problem connect xpath xpath complex languag move document sidewai mention predic function main problem xpath question xpath express author issu import reason kei relat determin xpath gener method speci cation technic issu equal xml schema restrict equal author encount case kei restrict detail discuss found section main reason write paper exist kei address issu hierarch ubiquit hierarch structur scienti data format kei identifi compon compon kei identifi author kei cite part document su cientli import kei speci cation independ constrain structur xml document describ kei xml semistructur identifi compon xml document di erent identifi compon relat smith jone brown grade smith jone brown identifi tupl relat constitut kei absenc kei uniqu identifi tupl give entir tupl relat kei constraint tupl kei attribut xml document rst document posit document identifi part constrain xml document element subel element put distinct student element di er subel issu discuss structur node identi cation equal attent organ rest paper organ section introduc notion node address equal node address node equal test node node equal test node section introduc path express languag de nition kei discuss section section address issu connect reason xml kei concept rel hierarch kei altern notat discuss section section examin schema discuss altern form kei issu kei node address equal document object model insight semant xml document document hierarch structur node node type import element attribut text node illustr figur text node carri attribut node carri element node element node attribut text node termin addit dom speci es reach children element node text element children held essenti index arrai determin order subel document attribut children held dictionari uniqu index integ element text pre xed shown edg label figur import point edg label uniqu identifi children consequ model path edg label root uniqu identi es node call path node address write node address basic mean identifi node note attribut occur end node address talk address rel node node address hai node address form address rel node node root necessarili child node equal equal de nition order de ne kei rst de ne equal node restrict equal text author encount case kei restrict treat person complex structur consist subel gener describ equal tree equal node speci ed give set rel address partial function partial function string node respect textual xml de nition state order attribut unimport de ning equal observ order subel speci ed preserv index notat equal point equal text node js bach gf art tree equal satisfactori presenc type job de ning base de ne coarser form equal treat type real number equal problemat complet speci cation kei account issu path express path express express involv node attribut describ set path document tree choic languag de ne path express import express power number choic xpath express semistructur data regular express subsum analysi assum properti path db born work work titl num num period work num titl figur xml tree concaten result rst path path path move tree start node path reach address pre address properti enjoi xpath discuss choic languag path express meantim adopt illustr simpl languag subset xpath regular express languag path express empti node tag attribut wild card match singl node arbitrari path concaten path path de ned rule chosen altern syntax xpath concaten central understand uniform xpath translat xpath path meant start root pre xed denot root node empti path place place place path concaten place separ locat step disallow concaten concaten di erent mean notat denot set node reach start node path conform languag abbrevi syntax borrow wadler descript semant pattern xsl exampl figur restrict path express languag path sequenc label path call simpl path simpl path definit kei de ning kei set de ning kei relat relat set tupl identi ed relat terminolog set column uniqu identifi element set motiv central de nition kei speci pair path express set simpl path express idea path express identi es set refer target kei constraint hold refer target set kei path correspond absolut rel locat path xpath terminolog observ node set node found pi restrict size kei path constrain target set node pair set node found kei path pi intersect respect equal pair set node node node kei de fname target path identi es set node document target set node de ne label root kei path kei path node target set distinct node reachabl kei path node reachabl observ document figur sati es kei node end target path element set node found kei path element document sati es kei subel rst absent readi give formal de nition kei reason emerg de ne respect node document assum target path start root de nition es speci cation exist note form equal de nition kei rst deal node equal node node equal node address talk document satisfi kei speci tion root document sati es kei speci cation kei impact node kei path node empti pi observ pi miss de nition disjoint similar uniqu constraint introduc contrast uniqu notion kei speci cation capabl compar node path lead multipl node kei express respect root kei assert element uniqu identi ed valu subel document satisfi kei subel rst element rst subel ofth element de nition element requir element exampl express respect root document person id uniqu identi ed valu id person element disjoint id eld person node immedi root di erent valu empti empti kei mean path uniqu root node immedi root element id subel uniqu identi ed valu id node disjoint id eld note id element id kei captur semant id attribut xml standard id uniqu entir document kei relat de nition kei assert valu kei path uniqu identifi node target set requir xml document kind rst normal import di erenc definit path de ne kei exist equat miss kei path null valu arguabl depend semant languag queri xml document uniqu relat kei valu kei exist rst normal form requir attribut valu atom set kei path set address unlik relat case kei wai de ning restrict wehav justi cation choic order set kei path de ne kei order talk set tupl path express talk equal path express path express languag path express gener class regular express de ned equal kei path kei speci design document kei repres node problem constrain node tree equal desir ect restrict constitut unnecessari kei speci cation data model de nition kei satisfact di er signi cantli relat case set node end kei path examin restrict de nition kei satisfact requir kei path exist uniqu section languag path express regard weak power kei arbitrari path express restrict pi simpl path arbitrari path hard exampl power express mean person element father mother element emphasi languag path express arbitrari path express pi complic de nition kei chang theori kei infer relat infer kei presenc set attribut kei relat superset kei obviou fact great import queri optim kei typic physic simpl infer rule inform index xml kei present infer rule obviou rule fulli discuss companion paper exampl fact counterpart relat infer rule exampl counterpart fact fp fq sound document share node node identi ed tree ancestor determin kei path uniqu identi es node path ancestor fact path languag de ned includ de ned kei fact sound kei set kei subset observ subset fact requir reason path express kei infer close relat question kei xml document sati es follow document necessarili satisfi develop algorithm reason class path express determin implic xml kei detail discuss algorithm nite axiomat complex result connect kei languag found natur question kei constraint nite sati relat kei nite sati schema nite set construct nite instanc sati es hold xml document de nition kei fact nite set exist xml document satisfi fact hold kei path miss recal kei path requir exist node speci ed target path xml document nite satisfi kei strong kei section note fact hold absenc dtd illustr simpl kei simpl dtd foo exist nite xml document conform dtd fig nite xml document sati es kei fig xml document conform sati es requir xml tree distinct requir node immedi root show dtd interact xml kei constraint mention kei de ned introduc xml schema interact dtd type system xml studi interact constraint dtd rel kei rel kei partli motiv scienti data format scienti convent transmit data varieti data format data format gener domain speci data format easi translat xml xml emerg standard data data dtd speci cation hierarch typic top level consist larg set entri order molecular biologi rich structur metadata protein sequenc access number entri entri sequenc identi ed anumb entri identifi citat provid access number entri number citat entri intrigu found linguist case data set record held metadata provid part directori structur train dialect region femal sentenc text speech waveform reason repres metadata immedi obviou requir hierarch kei structur relat design notion hierarch kei structur weak entiti kei weak entiti consist parent kei addit identi cation depend entiti section describ hierarch kei structur introduc notion rel consist pair path express kei de nition document sati es rel kei speci cation node sati es kei word rel kei root node number uniqu identi es chapter grate mark liberman steven bird linguist data consortium provid chapter number uniqu identifi chapter book bibl node immedi kei observ rel kei start root start node reason de ned kei satisfact arbitrari node transit rel kei kei uniqu compon document rel kei uniqu identifi bibl give book chapter speci ed intuit formal observ rel kei kei kei de ned section special case rel kei distinguish notion refer absolut kei simpli kei rel kei immedi absolut kei immedi de ne relat transit closur immedi relat de nition set rel kei transit rel kei kei set kei set transit set rel kei absolut kei updat rel kei kei speci identifi node add depart kei speci cation depart wai add motiv nal de nition updat shown insert element part document unambigu insert element kei de nition set rel kei updat transit rel foo foo figur xml tree conform xml tree satisfi kei node de nition properti element pre path identi ed kei easi addit kei make previou updat insert depart addit add nest depart identifi reminisc anomali occur normal form relat wrong design document children depart node linkag depart express foreign kei formal concept document respect kei speci cation scope paper notat rel kei system rel kei form hierarch structur creat compress syntax system basic syntact form describ system rel rel kei fp de ned note rst form fp kei speci es updat system kei hierarchi speci ed linear speci fold singl speci simpli syntact transit set rel kei worthwhil remark identifi student awar school student belong insert student school addit insert student element avoid ambigu speci cation compact understand import ensur intern consist cite compon document import document subject chang construct minim system describ hierarch kei turn describ data model contrast relat speci cation kei speci cation describ close relat structur speci cation ensur student node major node kei speci cation ed node occur student node requir kind rst normal form document structur akin complex object nest relat structur studi surprisingli close interact kei constraint data model requir studi discuss main reason write document clarifi notion rel kei understand hierarch kei structur occur natur varieti data format kei de number variat de nition consid section review start includ syntax kei relat de substant di ignor issu rel kei possibl import languag path express xpath mention xpath languag access part xml document xpath support varieti ax move xml document tree move ancestor sibl emb predic function xpath select ancestor node path abcd start root observ predic speci ed child complex question xpath express remain open demonstr exampl section issu import reason kei practic relat summari salient di erenc de nition equal gener form equal point section full treatment equal involv type form ned equal de nition target set path express de ne target set start arbitrari node recal kei target path start root recal absolut kei straightforward start arbitrari simpli substitut notat speci write start path express de nition kei path talk list kei path avoid issu xpath construct kei present constraint issu xpath express gener method check speci cation rel kei direct notion rel kei circumst achiev relat ect kei xpath instruct move node part kei node infer make speci cation kei provid node target set child node clear reason gener speci cation stronger definit kei de nition kei adopt paper semistructur natur xml mirror requir relat uniqu kei equal kei valu explor de nition captur requir strong kei strong kei de requir kei path exist node kei path constrain target set node pair node found kei path pi pair node node node mean path express figur uniqu work num uniqu node de nition satisfact strong kei de nition sati es speci cation pi uniqu distinguish de nition kei refer kei de ned kei kei de ned section weak kei strong notion exampl person matter uniqu id subel di er element interpret kei remain unchang strong kei semant semant kei respect strong weak kei speci cation requir element kei includ element illustr strong kei nite sati abil nite model hold kei nite chain node nite document satisfi problem requir kei path exist mention kei id node base subel due exist requir path de nition strong strong kei structur constraint typic found schema speci cation tradit system document satisfi strong kei kei requir element exist element kei path document sati es weak kei weak kei permit weak kei distinguish element mention distinct structur constraint integr constraint ned dictat larg convent program languag treat type detail discuss topic concept rel kei natur adapt strong kei document sati es strong rel kei speci cation node sati es strong kei strong notion weak notion kei di erent restrict kei path end kei path exist uniqu structur constraint kei path possibl adopt slightli stronger notion weak kei substitut equal intersect node set reachabl simpl kei path choic path express languag languag path express illustr issu occur connect kei xml order reason essenti path express decid case express languag regular equal result ect exampl found ad express power clear larger languag practic interest issu de ning kei languag describ target path languag de ne kei path simpler languag kei path sublanguag languag target path requir tion target path kei path languag target path simplifi requir kei path simpl path bene simplifi languag kei path extend current kei path includ express languag target path rst de ne notion intersect observ regular languag de ned path express set simpl path rang simpl path path express denot simpl path languag de ned intersect node xml tree path express languag de ned section intersect denot de ned consist pair node equal reachabl simpl path languag de ned start extend kei speci cation kei speci cation kei pair pi path express languag section node sati es kei intersect mention complex result develop gener de nition kei node kei valu choic de nition kei xml ultim determin practic aim set kei speci cation cover practic case de nition complex kind reason kei paper cover practic issu xml type part widget express tag altern xml express attribut subel element kei part type id current kei constraint express introduc part kei speci cation includ kei path involv chang altern problem interchang structur data abil strong point semistructur data xml de nition kei extend express ad consist node kei express idg alter properti expect hold kei account practic tag kei acknowledg grate byron hartmut chri henri thompson number comment discuss refer serg peter dan suciu data web relat semistructur data xml morgan serg richard victor vianu foundat steve mike scott ian le jonathan robert chri lauren wood document object model level speci cation octob wendi van den pascal peter mari ann sequenc nucleic acid protein sequenc supplement nucleic acid benson ba wheeler nucleic acid tim jean extens markup languag world wide web consortium feb peter susan tan reason kei xml technic report peter jerom simeon scott weinstein constraint semistructur data xml sigmod record march byron choi sahuguet dtd demonstr jame clark steve xml path languag work novemb fan leonid libkin xml integr constraint presenc dtd pod andrew edward ev henri thompson januari raghu ramakrishnan johann gehrk manag system higher sahuguet afraid du thoma wilson green genom sequenc begin henri david murrai xml schema part structur work april philip wadler formal semant pattern xsl technic comput scienc research bell lucent directori file structur file
ML/1300 6 asymptot analysi adaboost binari classif case muller gmd germani abstract recent work shown combin multipl version weak classifi tree neural network result reduc test set error studi greater analyz asymptot behavior adaboost type algorithm theoret analysi establish relat distribut margin train exampl gener vote classif rule paper show asymptot result binari classif case underlin theoret find relat model complex train improv adaboost type algorithm practic discuss introduct ensembl collect neural network type classifi train task boost ensembl learn method recent great success ocr work investig function ensembl learn process greater detail asymptot charact boost ensembl method charact studi nice margin perspect discuss error function boost introduc intuit anneal suggest strategi improv boost method practic adaboost type algorithm fh tg ensembl predictor defin input vector weight satisfi binari classif output class ensembl gener label weight major sign order train ensembl predictor fh algorithm weight simpli weight scheme complic give descript perman commun inform research lab tokyo japan algorithm binari classif case defin margin pair class margin posit posit margin correct larger defin rate incorrect classif loss function adaboost type learn minim function exp note unnorm weight quantiti simpli normal version algorithm paramet oe oe retriev origin adaboost order find predictor learn exampl weight normal weight hypothesi bootstrap weight algorithm exampl train neural network respect weight distribut obtain hypothesi calcul error ffl set log ffl log oe updat distribut jbj figur adaboost type algorithm ple distribut train altern weight squar error train emploi weight updat exp exp exp exp train error ffl comput ffl minim select log oe oe log ffl ffl due refer unnorm exponenti adaboost type algorithm algorithm descript pseudocod fig gradient respect margin give predictor approxim true predictor minim note weight minim weight give ffl minim adaboost type algorithm approxim gradient descent method minim asymptot charact adaboost theoret asymptot inspect close adaboost type rule softmax function paramet jbj interpret anneal paramet anneal paramet jbj depend valu linearli number iter fig eq observ train error ffl small larg strong learner reduc train error strongli make jbj larg boost step case reach point converg necessarili achiev gener perform reason usual anneal process reduc anneal oe constraint oe ffl reason show adaboost independ hypothesi class charact anneal process vari strongli depend strength learner eq rewritten exp ae oe jbj oe reduct predominantli achiev improv margin margin error big amplifi jbj adaboost type algorithm neg margin maxim order improv error asymptot case number iter jbj larg valu valu small differ amplifi strongli margin margin jbj differ amplifi differ exp exp function number iter figur relat jbj number iter experi sensit small differ margin margin converg fix stabil asymptot train pattern margin area area stabil fig anneal paramet jbj big adaboost type learn hard competit pattern smallest margin high pattern effect neglect learn process recapitul train margin stabil stabil decid specif adaboost type anneal process speed anneal process depend fix paramet oe jbj implicit function strength learner train process order good gener slow cool set small oe adapt slower comput tradeoff real world problem ocr pattern strong learner adopt basi ffl small valu jbj larg order improv adapt oe ffl oe chosen smaller asymptot section present asymptot numer simul underlin discuss section radial basi function network adapt center learner fig show train data gauss blob ad normal distribut oe oe stabil figur margin distribut adaboost oe iter line adaboost svm low case similar error adaboost rbf network center adaboost appli data set fig show margin distribut adaboost iter time oe appar margin distribut asymptot make step fix stabil train pattern margin area numer result support theoret asymptot analysi margin distribut adaboost resembl support vector machin fig observ line construct adaboost similar construct svm support lie step part margin distribut adaboost analysi call height step ffi step ae fig show ffi ae depend train data complex basi predictor lead ae reason higher error ffl gener theorem prove asymptot lower bound ae ln ln ln ln ffl max ffl interact oe differ ffl oe side small smaller oe import differ theorem weaker bound ae oe oe small ae big oe small maxim minimum margin fig observ complex basi predictor lead error ffl repres higher achiev smaller ffl higher due margin area order number rbf center level level figur relat model complex ae oe ae ffi rbf center symbol clarifi capabl adaboost strong adaboost appli usp data rbf network network center repres high complex tabl oe svm iter iter oe iter error compar number misclassifi pattern test set svm adaboost rbf network boost iter method classifi digit number train pattern number test pattern train error ffl rbf network oe observ misclassif rate rbf network adaboost larger svm oe chosen superior perform adaboost rbf network compar svm result show select oe adapt achiev ffl valu real world problem simul observ slight overfit effect function number boost iter due jbj noisi pattern larg emphasi lead overfit earli stop avoid overfit adaboost type algorithm detail scope discuss shown adaboost type algorithm perform approxim gradient decent specif error function optim margin asymptot emphasi concentr difficult pattern small easi pattern effect contribut error measur asymptot analysi adaboost type algorithm show adapt oe hypothesi train error ffl real world problem observ earli stop avoid overfit shown theoret cumul stabil distribut train pattern margin area converg asymptot step step decid specif anneal type process govern jbj level present data context gener bound numer simul clarifi asymptot margin distribut adaboost similar margin distribut found adaboost svm futur work concentr continu improv adaboost type algorithm real world applic analysi relat adaboost support vector machin margin point view focu question good margin distribut valuabl discuss smola scholkopf fund dfg refer bishop neural network pattern recogn clarendon breiman bag predictor machin breiman predict game arc algorithm berkelei lecun al neural lee bengio vapnik natur statist learn theori scholkopf ieee tran signal
ML/1301 6 hierarch model screen iron defici smyth mclachlan depart inform comput ca usa depart ca usa depart australia abstract investig problem classifi individu base estim densiti function individu label histogram red blood cell learn problem build classifi classifi unlabel histogram normal iron defici class problem similar convent classif label train underli measur featur vector histogram densiti estim describ gener framework base probabilist hierarch model model data illustr model lend classif contrast approach directli defin distanc densiti distanc paramet estim densiti featur vector standard discrimin classif framework evalu method data set consist subject hierarch model approach yield error rate rang conclud discuss rel merit includ interpret model clinic diagnost viewpoint hierarch red blood iron defici email address contact phone number contact electron postscript email introduct background reduct circul red cell mass diminish capac common medic problem diagnost evalu monitor blood sampl patient routin analyz determin volum red blood cell amount protein red cell context highli abil perform autom accur diagnost screen disord measur manifest fundament univari volum distribut univari concentr autom techniqu recent develop simultan measur volum concentr patient blood sampl flow blood cell count instrument bayer white make measur laser light scatter system provid red cell volum joint red cell volum concentr distribut data describ paper gener machin typic blood cell produc plot univari histogram distribut univari hc distribut bivari histogram grid joint distribut figur show histogram count space healthi individu iron defici patient exist diagnost techniqu base measur larg limit simpl visual examin plot approxim estim abnorm base skew shift histogram direct bivari space gener approach captur patient distribut remov normal insensit subtl insensit differenti diagnosi paper focu problem learn classif model data autom diagnost screen clinic environ section discuss learn aspect problem gener make connect relev prior work section introduc notion probabilist hierarch model problem power framework model data set multipl level variat data variat individu subject level show larg amount data lowest level hierarchi exist effici close form approxim full bayesian solut section outlin algorithm learn densiti bin truncat data section discuss altern method approach classif base direct diverg standard discrimin framework classif tree section compar empir control iron defici figur histogram raw data count control subject subject iron defici classif perform hierarch approach altern section discuss merit includ suggest interpret learn model term relat prior work mccallum al hierarch model improv classif regress standard manner featur vector densiti hierarch model wide appli statist al bayesian awar publish work machin pattern statist literatur hierarch model specif classifi densiti contribut context screen iron defici colleagu seri paper demonstr distribut volum accur model mixtur densiti function paper extend work bivari explicitli model process hierarch evalu methodolog term classif accuraci machin learn descript problem slightli gener descript problem individu individu belong fc individu turn measur set individu problem level object individu red blood object patient set analyz type multilevel structur uniqu numer instanc similar scenario practic learn identifi individu base multipl facial base multipl spoken base multipl passag text written type data present gener problem learn classif procedur model assign individu term structur model relat multipl measur class defin gener learn model simpl approach reduc multipl measur individu standard featur vector fix hc measur individu summari dont advanc featur discrimin approach ad hoc flavor power idea context notion gener probabilist model data relev context natur mode present data physician form joint distribut word languag joint distribut form exist basi descript hc measur repres data ith individu set approxim bivari measur made patient blood probabl densiti function joint variat hc set paramet model turn base prior knowledg physic mechan gener function form mixtur densiti return point section assum form remain estim paramet individu standard densiti estim techniqu mclachlan densiti estim problem reduc problem learn multipl measur learn densiti function principl accur describ inform origin sampl point clear obviou model classifi individu densiti realm familiar classif model section outlin hierarch model framework natur elegantli model similar differ individu base densiti function observ data individu individu paramet mixtur model paramet class variabl membership chosen probabl paramet gener chosen prior compon data gener paramet figur graphic model direct hierarch model gener hierarch model classifi densiti function gener hierarch model model red blood cell product individu gener model model observ discrimin model gener describ boundari individu randomli call individu assign individu class probabl problem control iron paramet individu prior densiti function paramet class class densiti function describ variat paramet gener observ individu multivari measur individu red blood condit paramet model figur summar framework graphic probabilist viewpoint formal graphic model problem read relev condit independ relat data set individu independ data set condit paramet gener data hierarch model plausibl gener volum concentr control iron defici model control model ida figur scatter plot estim paramet individu iron defici control gaussian variat mechan data homogen class captur assumpt paramet densiti function individu belong class parametr common class densiti function paramet space perform overlap class densiti paramet accur classif figur illustr gener concept model variabl paramet space fit individu level mixtur densiti function detail section figur scatter plot locat estim bivari larger probabl compon fit densiti function individu control iron defici individu symbol fit gaussian model paramet class covari compon correspond densiti function paramet class interpret model type hierarch model setup common bayesian statist bayesian densiti paramet refer prior fact full bayesian analysi put level prior model accur classif data mixtur model prior probabl class paramet class paramet vector univari measur level model gaussian densiti function oeg bivari densiti function oe repres oe vari class oe repres set paramet describ prior oe paramet compon prior reason parsimoni descript gener mechan data figur systemat variabl mean learn prior paramet oe label data set measur denot data fd dn set measur blood cell ith condit hierarch graphic model figur likelihood data written dont paramet case margin likelihood function prior fairli larg number blood cell fit parsimoni bivari model reason assum integr peak maximum posteriori rel prior assum prior flat part paramet map maximum likelihood valu simpli denot integr peak assum data class individu belong gener partial label data straightforward discuss focu estim oe paramet describ condit membership class simplic notat assum data class fd dn data kth class individu estim densiti paramet ith individu arg max oe arg max oe arg max oe joe arg max oe joe arg max oe joe arg max oe joe equat standard likelihood condit independ assumpt time prior find map find find oe maxim map express parametr densiti model prior reduc maximum likelihood estim oe paramet base fit bivari mixtur origin result roughli mean covari paramet total independ paramet total detail paramet fit individu provid section classif fit model assum estim paramet hierarch model individu class probabl jc jc jc jc base map posterior class probabl simpl intuit find paramet fit data unclassifi rule classifi paramet rel prior equat arriv method perform probabilist classif hierarch determin model learn label data procedur class estim densiti function paramet individu label class estim paramet oe estim estim mixtur weight simpli proport individu belong class unlabel observ data estim densiti paramet individu find maximum equat densiti model level function form densiti model step model data distribut shown margin volum distribut singl popul theoret biolog mechan govern manner cell produc cell divid normal variat respect volum process repetit effect multipl cell result distribut argument densiti mixtur al biolog process constantli occur red blood cell produc bone cell die dai healthi individu singl popul red blood cell produc cell volum concentr normal rang iron defici red blood cell produc volum normal healthi individu develop subpopul red blood cell begin emerg period rel ratio subpopul red cell implement mixtur model count data actual valu volum concentr observ blood cell count measur rang miss model fit condit truncat studi mclachlan jone mclachlan jone connect fit univari volum distribut theoret result cite paper handl extens multipl dimens straightforward detail due space fit procedur em volum concentr control concentr volum control concentr volum control concentr volum iron defici concentr volum iron defici concentr volum iron defici figur contour plot estim densiti estim typic control patient typic iron defici patient lowest probabl contour plot systemat differ group algorithm problem solut case fit mixtur model data main quantiti evalu em step integr bin extend mclachlan jone procedur bivari case directli lead slow em algorithm execut time singl em step result present heurist initi method result reduc comput time em factor data point result drawn histogram count assum uniform distribut bin uniform assumpt incorrect true densiti smoothli vari assumpt fine rough guess standard em run converg simul sampl result densiti start point version em data perform numer integr bin em step reduc number iter full em algorithm drastic affect accuraci solut converg criterion defin full algorithm return local maximum likelihood function bin truncat data process repeat time randomli chosen subsampl avoid poor local maxima figur show densiti fit histogram data appli em mixtur model procedur individu term lower percent probabl contour estim mixtur densiti differ specif variat iron defici figur matrix diverg score fit densiti model altern classif techniqu compar qualit approach classifi ffl gener hierarch model approach ffl approach base densiti distanc scale section ffl discrimin classif cart classif tree algorithm breiman al section densiti distanc diverg scale idea defin distanc measur directli densiti complet avoid model paramet distanc measur densiti defin log strictli posit made symmetr defin diverg log log diverg notion densiti distanc subset control iron defici individu fit densiti section calcul diverg pair individu result distanc matrix shown figur separ group clear structur matrix pixel imag correspond smaller densiti control iron defici model control model ida figur matrix densiti distanc score vector space md techniqu fit gaussian covari class systemat differ group control upper left homogen term densiti iron defici group greater variabl term distanc greater spread consist figur spread compon mean lower control iron defici subject matrix exploratori analysi easili lend classif standard manner defin classifi data scale approxim distanc matrix vector space md place individu row column space distanc point preserv close euclidean vector space base analysi fit versu determin number dimens md data result vector show individu posit reflect close kl shown figur md tool emb densiti vector space defin notion gaussian classifi vector space classifi space discrimin classif standard discrimin classifi classifi paramet vector obtain densiti model section chose classif tree typic method discrimin classif cart algorithm tree approach direct approach od classif advantag interpret clinic viewpoint discrimin approach featur estim directli attempt made model densiti individu histogram summar vector simpl univari standard deviat estim histogram tree algorithm learn classif model space approach advantag simpler classif method refer baselin method rest paper methodolog result method compar classifi data collect studi complet refer sampl group healthi individu recruit staff physician hospit western scotland patient includ studi ward clinic refer hospit laboratori complet blood count result base control iron defici subject studi method begin em estim paramet individu estim obtain fit mixtur densiti em section set paramet class label iron individu method perform run data divid randomli chosen train set data test set consist remain perform method report standard deviat classif accuraci test set run note paramet estim run em determin complet independ data class pure procedur perform individu measur paramet estim place hierarch model paramet construct densiti model control iron defici experi densiti model model paramet gaussian mixtur block covari matric covari mean independ covari paramet compon paramet reflect tabl mean standard deviat classif error classif model run method featur error rate standard deviat baselin cart baselin hierarch natur scale model model compon weight log eigenvalu covari matric gaussian gaussian mixtur model block diagon covari matrix covari covari weight independ paramet train perform run automat determin singl gaussian gaussian mixtur fit run model gaussian mixtur motiv intern model automat reason structur paramet space project train data techniqu earlier intern strategi build gaussian mixtur model class md train data classif perform project test data point gaussian mixtur model result tabl summar error rate standard error method discrimin algorithm run origin rescal featur lowest error rate obtain densiti rescal baselin featur suggest densiti model worthwhil lead lower error rate simpl featur method hierarch method lower error rate discrimin tree method order factor hierarch error rate correspond error rate error rate cart baselin featur error rate error rate baselin featur hierarch model method superior term classif accuraci note time write pair experi perform formal statist hypothesi test routin clinic classif tree approach attract oper classifi explain simpl term clinician accur tree classifi produc accur posterior class probabl fulli variabl clinician rank subject base likelihood iron defici hierarch model approach produc plausibl posterior probabl produc tree model hierarch model interest medic research viewpoint basi complet blood disord space term typic variabl individu full group differ approach interest altern method competit hierarch method term accuraci suffer lack interpret md dimens necessarili strong visual appeal exploratori data analysi problem natur investig problem autom screen blood sampl individu detect iron defici problem complex typic machin learn classif problem individu classifi base bivari histogram featur techniqu classifi individu densiti probabilist hierarch kl distanc densiti vector direct discrimin densiti histogram paramet classif tree method accur rang method outperform simpler discrimin method conclud accur autom screen subject iron count feasibl acknowledg contribut paper support part grant nation institut health research travel grant award fund contribut ic ps support part nation scienc foundat grant thoma provid laboratori facil grate dr albert technic assist refer classif regress wadsworth press modern theori springer db bayesian data chapman hall huge number similar combin learn hierarch bayesian machin fifteenth intern confer shavlik san morgan likelihood estim group truncat data finit normal mixtur appli royal statist societi seri ng ay text classif shrinkag hierarchi machin fifteenth intern confer shavlik san morgan kaufmann mixtur model group truncat data em em algorithm john wilei son volum red blood applic algorithm group data model seri case statist method medic mixtur distribut doubli truncat analysi red blood cell volum inform research
ML/1302 6 construct qualit event model automat video input cohn hogg school comput uk abstract describ implement techniqu gener event model automat base qualit reason statist analysi video input exist track program gener label contour object view fix camera partit semant relev region base path move object path index tempor inform object move path speed distinguish notion proxim base speed move object qualit spatial reason event model describ behaviour pair object statist method system test traffic domain learn event model express qualit calculu repres human observ event system subsequ select event occurr unusu behaviour introduct dynam scene analysi quantit typic gener larg amount tempor evolv data interest shown higher level approach repres reason data conceptu qualit approach rich select qualit reason system exist applic motiv present work desir appli qualit reason techniqu dynam scene analysi princip support epsrc grant gratefulli acknowledg comment anonym preprint submit elsevi preprint april motiv ensur system build model elimin tediou hand built model inform provid exist track applic quantit posit spatial extent object provid screen coordin approxim zone region exact locat broadli similar behaviour class provid gener model scene arbitrarili segment region region conceptu relev physic structur domain arbitrari domain interest natur outdoor movement object styliz domain object tend compli number default movement vehicl figur scene observ static camera extend period provid train data learn process spatial model found gener hand outlin effect learn strategi automat gener similar spatial observ object movement extend model describ work fulli section fig test domain view static camera conceptu relev determin abnorm behaviour pattern subsequ continu observ object travel domain spatial model obtain statist evid observ behaviour quantiti behaviour significantli greater abnorm behaviour locat abnorm behaviour occur learn cycl effect spatial model includ appar movement unusu behaviour occur train period default behaviour movement domain object chang indic unusu situat visual surveil concern abnorm behaviour pattern conduct full behaviour system capabl recogn normal behaviour pattern typic system design recogn sequenc situat action provid priori system knowledg event model recogn instanc event provid event model priori system event learn strategi learn builtin induct bia influenc kind behaviour standard featur learn program choic languag affect learn system learn repres introduct provid broad outlin research context paper briefli describ techniqu learn semant relev region bodi paper demonstr effect model qualit event learn system support result compar contrast approach altern techniqu literatur discuss underli assumpt methodolog discuss present system extend evalu materi paper larg report briefli gener semant region outlin region base model space underli spatial structur automat construct extend observ object move real time region type includ leaf defin underli structur composit construct concaten adjac leaf describ area behaviour lane automat gener model similar hand gener model emploi exist track applic simpl background tracker collect train posit shape descript move object associ object label maintain period object remain object path construct area cover object travel domain path merg statist analysi entri infrequ includ spatial model leaf region spatial obtain combin remain path store form attent control mechan emploi visual surveil applic identifi potenti interest object follow rout develop techniqu identifi object behaviour involv object typic object object intend domain gener move vari simpl static notion close make close object depend speed refer object achiev extend spatial model incorpor tempor inform construct path object travel incorpor point coordin regular time interv form region composit region spatial model region spatial extent affect veloc object distanc camera size due camera main featur approxim time object composit path path speed busi set gener effect spatial busi period path smaller traffic move gener index move object occurr identifi path identifi object spatiotempor model uniqu literatur note qualit notion close object adjac match qualit methodolog detail gener process track process accept live video imag static camera shape descript move object scene produc basi analysi dynam scene data perform build path object inform pertain time store end train data store process gener discuss final function speed experi simpler notion work provid object similar speed select interv traffic domain uk rule recommend gap minimum inter vehicl distanc note common natur languag equat time answer composit region requir model diagram outlin system shown figur updat video imag sequenc track object shape scene track process model futur applic gener region gener path tempor interv path tempor gener path tempor camera fig overview tempor extend method main ffl track process obtain shape descript move object ffl path gener build model move complet sequenc tempor interv interv passag durat object path tempor interv sequenc updat inform model ffl region gener access path tempor interv sequenc composit tempor region construct model domain track frame process exact durat frame calcul number frame period time ascertain provid frame equal accept actual frame count select standard frame rate pal video tracker experi handl full tracker hogg handl chose test domain limit amount occur import handl main interest investig present felt justifi make domain select view angl avoid undu tempor path gener singl spatial path construct overlaid top greater reliabl spatial extent speed object contribut spatial extent faster object regularli path suffici show path separ path spatial reason speed spatial extent object path determin combin pixel occupi convex hull silhouett object convex hull domain tempor account camera perspect speed variat length maintain list point coordin indic locat object regular interv time tempor point coordin tempor region construct subsequ reason identifi object locat object record interv centroid point object readili track select tempor point coordin bia subsequ process locat object relev tempor region figur show path complet tempor point locat interv object path merg exist path search entri path test base percentag overlap found figur work constitu pixel path exist path path discov ffl tempor interv ad intend pedestrian scene function motor vehicl convex hull object frame produc smoother move object natur fill convex move straight line fig path complet tempor point interv altern tempor interv sequenc ffl link tempor entri path creat ffl path ad path path discov incorpor inform path combin path function analog addit frequenc constitu pixel indic number contribut path path threshold oper appli gener composit region tempor interv sequenc path requir merg tempor interv sequenc tempor test perform exist tempor interv sequenc entri check path path entri list link tempor interv sequenc tempor shown figur tempor interv sequenc tempor interv sequenc ad tempor link path entri tempor requir type test path unlik gener object constitu pixel check percentag overlap match point tempor interv sequenc object enter domain essenti locat path check tempor interv sequenc check number interv correspond length interv approxim sequenc path tempor fig structur path tempor track process detect initi object small enter combin light presenc detect immedi mean tempor test start point identifi match length remain tempor interv start point subsequ interv distanc make process simpler match approxim threshold toler space requir provid reason match toler space interv match calcul durat tempor interv match interv sequenc check start posit test point locat interv length toler space calcul length tempor interv side focu point sequenc focu point initi point interv sequenc prior interv interv length consid actual obtain current toler space threshold calcul tempor interv length figur show demonstr calcul threshold reason threshold higher match found fewer match lower start point determin remain tempor interv approxim tempor interv sequenc replac entri entri toler space fig calcul toler space tempor interv tempor interv sequenc determin tempor entri updat begin initi point match interv posit point calcul tempor entri updat posit account tempor point contribut locat current point tempor interv sequenc greater effect final locat point entri number contributor point tempor interv sequenc requir tempor entri calcul tempor point entri match tempor tempor interv sequenc total number contributor tempor point entri clarif sketch algorithm provid figur frame receiv object descript object frame gener convex hull object shape updat object path raster record tempor point coordin complet object path search path entri entri found merg path path search tempor entri entri tempor entri found updat tempor entri add tempor entri add path entri add tempor entri fig sketch algorithm path tempor gener region gener phase access path tempor interv sequenc composit tempor region construct model domain subsect describ pure spatial compon oper tempor subsect discuss full model spatial region gener time train period gener region spatial model effect halt gener process inform build region region model creat path gener stage time path complet merg unclear continu region gener spatial model chang frequent latest underli region map differ substanti previou state accur map adjac object behaviour prove difficult interpret region gener path verif accomplish path test path verifi path creat updat process merg path alter origin shape unmatch path found discov merg step advantag statist path strengthen path strengthen extra train step shorter train period advantag continu region gener oper perform updat process result path merg check oper prove bottleneck process merg unmatch path mean updat check requir test left start region gener path found singl pass result shown fewer check updat made singl path verif process continu updat reduc path uniformli low frequenc distribut discard low frequenc distribut repres infrequ object movement abnorm unusu behaviour displai applic inform method reli behaviour evid safe reject path statist frequent remain path process obtain binari rout depend path updat function threshold provid binari threshold select cumul frequenc histogram path percentag overlap emploi test path overlap requir merg path percentag pixel share path reflect cumul frequenc histogram path form highest histogram frequenc found histogram threshold oper binari path express composit region spatial model describ area similar behaviour object domain leaf region complet defin binari path overlap binari path alloc uniqu identif ad region map overlap segment form separ leaf region reassign uniqu identif path process leaf region identifi label adjac path share small area common ground shadow larg vehicl gener small region step leaf region gener remov small region merg adjac region adjac region select merg obtain smooth result merg region smooth check boundari small region proport share adjac leaf region adjac region share highest proport small region boundari select small region border length pixel share region region combin region form region fill subsequ smoother figur figur displai leaf region obtain test domain complet pure spatial discov union leaf region make composit region binari complic process result previou merg small region part larger leaf region member composit region path composit region leaf region complet overlap path repres select composit region displai figur identifi leaf region spatial model raster format suitabl vector effici appli raster data output obtain spatial fig merg oper small region model composit leaf line segment point region gener leaf region composit region construct previou subsect tempor entri path process gener set tempor region relev composit region similarli path set tempor entri belong path verifi ensur creat updat process discov merg previou subsect calcul locat point tempor interv sequenc gener account number contributor point locat tempor point entri match tempor tempor entri total number contributor tempor point entri total number contributor tempor point entri fig test road dual pedestrian scene displai identifi leaf region select composit region wider tempor verif stage ensur tempor point interv sequenc posit boundari gener composit region threshold oper appli path obtain composit leav point result area occur entir interv sequenc discard occur interv sequenc low statist frequenc locat point obtain combin frequent tempor interv sequenc place point boundari result composit region step remov infrequ occur tempor interv sequenc inform discard composit region left tempor interv sequenc composit region invalid composit region interv sequenc repres object travel speed path relev inform push bike typic travel slower motor bike travel similar time dai traffic heavier typic travel speed spatial extent tempor region bound line segment obtain composit region border point side tempor interv line segment composit region provid left edg tempor front rear edg obtain gener line pass point side tempor interv initi tempor interv start bound tempor region composit occur entri locat object object enter composit region enter tempor region point occur small object detect earlier normal spatial extent tempor region bound rear line segment composit region boundari front point interv sequenc point end tempor left edg line segment composit region tempor front rear edg achiev tempor turn previou line join previou tempor point calcul multipli gradient perpendicular line gradient line perpendicular line join previou tempor point defin equat perpendicular line pass current tempor equat perpendicular line find locat point intersect composit region boundari provid point tempor region figur special case point tempor interv sequenc unlik point tempor interv object travel path point leav domain requir complet interv mean final tempor region end composit region occur tempor interv tempor point obtain line gradient current previou tempor point gradient calcul previou tempor point tempor interv sequenc remain calcul model complet tempor entri composit region process summari region gener algorithm provid figur line connect previou point perpendicular line corner point fig obtain edg point tempor region end train period verifi path entri verifi statist path entri verifi tempor entri path valid threshold path matrix updat region map threshold data find merg small region relev adjac region verifi statist path entri identifi leaf region composit region tempor entri find corner point tempor region fig sketch algorithm region gener process result video imag sequenc traffic junction minut length averag object frame dual minut video footag time object frame pedestrian scene roughli doubl length object frame period object movement end train period traffic junction enter path reduc check prove frequent region gener give composit region initi leaf region remov small region reduc number rout identifi path strong consid composit region gener total leaf region dual approxim leaf region obtain recogn path pedestrian scene leaf region gener recogn path result reli threshold paramet unabl elimin system threshold remain overlap path actual threshold oper obtain binari path size leaf region merg adjac region overlap path path threshold oper link dual result overlap suitabl test domain percentag overlap relat camera angl scene angl object adjac lane natur overlap mean attempt path test higher overlap percentag requir distinguish path adjac lane determin small region pass track program minimum track object size pixel problem ten pixel percent total imag area size conserv system maintain perform updat stage margin slower gener region gener result provid number altern set tempor region major composit region composit region show singl set tempor region accept object travel speed path select tempor region composit displai dual figur event learn demonstr effect present qualit event learn strategi contrast usual method fig result tempor region ing event model priori system contextu relev featur model style learn procedur similar semant region learn system input data consist tempor extend descript match exist frequenc count elimin note begin qualit spatial relat describ behaviour reason valid applic develop qualit spatial reason qualit class broadli similar behaviour readili identifi reason commun behaviour human audienc natur languag descript tend qualit natur previou work event descript manual suppli event recognit system kind qualit languag choic primit affect learn wide varieti qualit spatial calculi pair interact obviou relationship interest orient direct motion assum physic possibl relat domain geograph domain object overlap habitat repres relationship restrict attent close worth record distanc pair car repeatedli repres learn qualit speed inform repres implicitli qualit repres chose focu kei relationship attent control object identifi qualit relationship rel posit rel direct motion maintain object relationship histori list object leav histori list verifi ad complet train statist analyz determin sequenc relationship occur suffici frequent consid basi event model diagram outlin approach shown figur main track process obtain shape descript move object distinguish distanc topolog distinct region connect qualit spatial calculi repres reason relationship video imag sequenc track object shape scene track process locat object object relationship tupl qualit relationship identif attent control object histori updat gener histori verifi histori updat object histori event event model event recognit histori verif object futur applic camera classif object histori model fig overview system classif stage identif qualit posit direct quantit inform provid track applic spatial model object histori gener attent control mechan identifi object qualit relationship object ad object histori object histori verif analyz object histori ensur relationship transit valid event valid object histori ad complet train statist analysi determin event model object histori induc event model subsequ camera input classifi classif step gener histori object correctli identifi posit object model classifi direct veloc object composit region occupi establish correct composit region classif posit data reduct term convert unnecessarili detail quantit locat desir qualit locat model process produc leaf region map posit leaf region occupi pixel scene region border lie pixel classif problem shape descript track object process provid silhouett locat leaf region map point set leaf region overlap object reduc potenti error number point overlap leaf region count predetermin threshold leaf region predetermin threshold object size object leaf region minimum size pixel track applic paramet remov small minimum size singl pixel smallest discern unit composit region identifi principl momentum appli composit region previou frame arbitrari choic made potenti mention creat prune leaf region minim occup includ correct composit region remov leaf leaf region overlap remain prove suffici identif correct composit region distanc centroid point object current locat ago correct set select composit region identifi object techniqu object deictic frame refer base posit camera classifi direct move object inform provid directli track applic classif procedur object descript quantit direct vector indic direct object domain qualit classif zone figur suitabl quantit qualit statist likelihood path readili path gener easili perform fig direct classif object histori posit respect composit region spatial direct object current frame histori object updat refer sequenc relationship object interact object object domain relationship model qualit critic record discuss relationship model object record histori ffl rel posit object respect refer object illustr figur similar orient model object ahead refer object reli current trajectori refer composit region occupi includ curv straight lane ffl rel direct movement object number rel direct present limit left left illustr figur tempor extent creat attent control mechan incorpor occupi refer object immedi front occupi object edg respect bring object share composit region distanc tempor left left ahead ahead ahead left left ahead ahead ahead left left fig posit object rel refer object perpendicular left perpendicular perpendicular perpendicular left fig rel direct motion extent identifi object adjac tempor extent present implement achiev extend lead trail edg tempor extent side width edg show tempor extent creat fig tempor extent gener attent control mechan attent control mechan capabl identifi object bound tempor extent centroid point object determin point occup ignor motion object left ahead ahead ahead left left fig classif rel qualit posit obtain tempor extent identif classifi rel qualit relationship direct refer object identifi object accomplish split tempor extent attent control object classifi path refer object neighbour path identifi object occupi determin rel qualit posit figur calcul rel direct motion actual direct motion interact object convert posit posit central locat occupi refer object note centroid object determin membership object ambigu li boundari case occupi subregion chosen suffici close object occupi chang relat occur forc valu valu compar determin rel direct relev object histori maintain refer object updat creat qualit relationship tupl compar recent histori item histori item match relationship tupl count increment total number match current relationship relationship pair append histori list refer object interact object separ histori maintain procedur refer object find object obtain rel qualit relationship object travel width tempor extent mean necessarili commut object deem true object deem result relationship correspond object frame refer object rel posit depend refer object frame refer object identifi relationship correspond argu featur consequ approach calcul evid spatial reason literatur close symmetr relationship natur size object involv close close object histori verif object leav domain object histori list merg ensur object histori valid free extran relationship track object histori verif procedur reli statist data provid gener histori verif procedur check histori suffici statist strength consid histori sequenc refer short interact interact element track actual object present determin object type short interact discard entir train suffici object histori process discard potenti histori affect learn histori sequenc locat irrelev histori item occur sequenc frame lie match item significantli frame relationship tupl occur singl frame split significantli longer sequenc import rememb singl frame essenti neglig prune oper strengthen relationship relationship tupl occur remov process complic transit relationship tupl respect underli assumpt motion continu achiev check transit refer continu network conceptu qualit spatial relat involv continu network qualit rel posit relat depict figur direct motion relat figur ahead left left ahead ahead left fig continu network qualit rel posit final verif step involv check adjac item histori respect continu network direct transit posit relationship perpendicular left perpendicular perpendicular perpendicular left fig continu network qualit rel direct motion continu network show transit hernandez simultan relationship direct rel direct occur chang directli singl histori insert miss relationship tupl remov extran gener uniqu number discrep easier safer discard entir sequenc histori includ sequenc figur exampl actual histori sequenc result histori sequenc verif occur singl frame relationship side ident relationship discard remain merg similarli complex result histori consist item minimum number frame set higher result event verif object histori list repres sequenc relationship tupl interact object depict singl event composit event episod event repres singl relationship tupl indic simpl behaviour pattern travel alongsid left singl event system gener english event direct direct direct direct direct direct direct direct direct direct direct direct direct direct direct direct direct direct direct direct left direct direct left direct direct direct left direct direct left direct direct left direct direct direct direct direct fig relationship histori sequenc result verif occur multipl relationship pull requir event follow simpler relationship pull refer object object pull object histori repres event event episod observ import updat search search entri match subset entri subset repres simpler event pattern event episod entri search entri histori subset histori repres event pattern discov event model composit event sequenc qualit scheme relationship search entri object relationship tupl sequenc ident relationship tupl match sequenc test includ item count verif procedur exact entri count entri insert count number time sequenc relationship tupl occur train period statist inform event model construct count reason search match subset subset search find complex event sequenc sequenc discov match event event complex event sequenc occur part complex behaviour pattern requir complex sequenc count match subset increment final subset entri sequenc form subset entri discov test search complex sequenc entri contribut updat count exist count entri increment search entri initi discov process perform entri initi subsequ updat previou search mechan end train period suffici frequent entri repres sequenc relationship event model result minut train period observ object interact dual divid distinct relationship sequenc captur subsequ analysi determin prove suffici frequent repres event observ behaviour relationship sequenc show focu object interact object travel direct complex object start pull finish front discov complex object start finish adjac model subset pull pull front observ area larg obtain inform form complex behaviour pattern discern demonstr effect event model discov learn process demonstr program set user event watch event model load file interpret desir format user cycl list event model decid event sequenc program watch diagrammat present provid user shown linguist descript transit event overtak event episod ffl travel direct ffl travel direct ffl travel direct simultan interpret observ action event sequenc repres state transit network figur displai overtak sequenc state transit network attent control mechan isol object vicin categor correct relationship check start state state transit network event episod potenti initi show potenti event episod relev object colour green target object relationship blue repres refer object overtak overtak overtak fig overtak state transit network involv event episod state transit network refer object turn red event episod recogn multipl window show event type simultan figur show sequenc frame show recognit overtak sequenc relationship shown relat work interest work conceptu descript imag evidenc recent workshop work assum manual provid model learn uniqu qualit calculu rest section briefli survei work attempt relat approach mention work buxton inspir approach wai work thought complementari learn semant region event model manual provid approach kei featur exemplifi bayesian network event condit probabl enabl explicitli explicitli consid kind knowledg condit probabl current event deriv knowledg base techniqu al scan german dictionari obtain final set verb verb phrase indic demonstr view fig sequenc frame show recognit overtak colour monoton condit postcondit express implement fuzzi set recent extend approach structur event descript call process fuzzi metric tempor logic program approach system requir predefin event order identifi mobil object region comput number measur motion current set previou distanc refer defin scenario car avoid automaton condit defin measur condit essenti qualit shah requir prior knowledg monitor human behaviour offic environ essenti system accur descript layout scene inform locat similarli chang detect perform area declar predefin list action recognit move object final provid state specifi transit action manual provid recognit difficulti provid model motiv research jebara pentland describ behaviour model directli enabl machin learn wai motiv work similar underli descript apparatu time seri predict give probabilist estim valu paramet shape consecut time lower level adequ task mind enabl comput mimic human facial qualit level system predict qualit quantit level system oliv al problem learn model predict interact hidden markov model techniqu trajectori model order extend kalman filter predict success blob posit system automat discov event set report event type train system specif instanc event type posit orient johnson learn behaviour move object quantit level pdf sequenc object simplest case configur instantan point veloc ground plane imag plane work recent extend learn joint behaviour peopl facial aim gener plausibl virtual partner interact final worth point work learn qualit conceptu descript static scene simpl qualit spatial calculu repres layout structur document discuss thought domain chosen interest assum regular respect behaviour pattern tradit approach learn approach wide observ knowledg base system acquisit rule base easi driven research investig wai acquir rule base machin learn suggest work complementari work previou section buxton suggest techniqu learn kind model work argu suppli background case languag qualit learn crucial affect choic languag inevit learn system kind induct bia suppli case choic qualit languag class learnabl event insensit actual choic verif hypothesi remain futur present content select small number qualit learn potenti larg class event actual event descript simpl figur advantag approach manual method tediou prone error incomplet learn system suffer error incomplet provid independ check manual rule histori knowledg acquisit full exampl acquisit domain video interpret suscept approach advantag learn statist frequenc domain event present human simpli encod event descript hand thesi automat identifi behaviour kind notion behaviour frequent suffici frequent pick rare pick statist method type behaviour built explicit event histori match exist model potenti repres unusu behaviour occurr claim properli defin constitut deserv techniqu approach worth explor question influenc system design hope expect system produc gener appli techniqu total domain investig techniqu good question futur work bring answer question choic induct bia mention notic space behaviour larg length event number spatial distinct number permiss actor search actual data obtain select element space search program search exist behaviour match newli observ issu concern learn probabilist model determin suffici train place specif address problem extent function user address ensur train place suffici long time suffici accur model built statist easili output aid rate path event ad rate chang rel probabl learn concept issu address approach synthet model turn beg question synthet model deriv present techniqu attent control crude simpli object refer account speed refer object remark overli restrict chase conduct actual metric cutoff close domain depend choic gap influenc uk necessarili traffic domain worth discuss approach handl elimin lower level region extract frame consid higher level coher motion region repres mobil object track number region due inaccur reach event learn stage semant region give basi reject motion path learn phase implic event conceptu neighbourhood diagram filter event histori miss intermedi view histori noisi frequenc count attach event descriptor express confid detect event fact learn event low frequenc count discard question interpret event runtim learn encount notion simpli event easi answer question imagin develop gener descript event classifi event class structur event constitu event type fell exist class classifi explor problem resolut remain futur work lead interpret frequenc count conduct detail investig area data frequent event occur infrequ occurr count minimum regard event subsequ surveil found larg gap frequenc event occurr reason approach determin mean gap futur work prototyp work plenti opportun idea mention ffl clear evalu exist system instanc intend appli traffic suffici rich varieti traffic hope reproduc verifi set traffic event type claim exhaust investig applic domain perceiv regular behaviour ffl improv underli track technolog improv qualiti data result wider applic qualiti learn model track applic time incap handl situat due camera object object label lost tracker model mean unabl recogn differ actual object move scene scene variat due camera vibrat note track applic appli paper shape descript util threedimens model base region gener methodolog capabl gener spatial spatial dimens event learn strategi extend incorpor spatial relationship ffl learn event type repres diagrammat form natur languag descript ffl present veloc inform repres implicitli membership path model veloc knowledg explicitli qualit manner classifi veloc finit discret set veloc rang induc simpli record rel veloc inform slower current applic program extend cope extra underli method remain exist work area qualit distinct wide spread qualit simpl behaviour distinguish part overtak predict ffl model extend repres event type learn requir extens event model event involv stationari object ffl possibl extens model languag calculu repres reason region indetermin boundari ffl system examin relationship object learn event involv interact object complex behaviour involv interact object model singl event multipl vehicl event vehicl model suffici repres complex behaviour observ system benefit enhanc model relationship interact object relationship model requir thought ffl attent control mechan paper identifi potenti interact object proxim base tempor region occupi object attent event learn strategi reli assumpt event occur object investig requir determin suffici attent control techniqu requir situat interact object vehicl chase polic car distanc object travel vastli pedestrian cross road proxim move pedestrian examin environ decid accid cross road time ffl singl static applic domain fairli limit extend combin camera overlap view object movement extend observ area connect camera posit system build spatial model view combin singl area find overlap featur ffl techniqu present appli domain situat obviou applic visual surveil secur system park event system combin easili identifi unusu behaviour person usual pedestrian path spend long polic immedi identifi speed traffic ing prove appar simplic applic spatial model identifi area minim occup shop centr public spatial model show typic behaviour pattern featur minim amount disrupt refer bobick editor ieee comput societi workshop interpret visual motion held conjunct volum workshop note jebara pentland action reaction analysi synthesi human behaviour ieee workshop interpret visual motion elisabeth gerd thoma rist simultan interpret real world imag sequenc natur languag system soccer proc page approach semant space semant preposit mental process natur languag de adam david hogg learn flexibl model imag sequenc european conf comput page editor eccv workshop conceptu descript uk buxton richard spatial tempor reason gener dynam scene descript page cohn qualit spatial reason techniqu ch brewka advanc artifici volum lnc page springer cohn approach repres spatial vagu doyl aiello principl knowledg proc page morgan shah monitor human behavior offic environ ieee workshop interpret visual motion gerard scenario recognit video imageri ieee workshop interpret visual motion gener qualit visual input phd jonathan anthoni david hogg gener semant region imag sequenc fourth european confer comput volum lectur note comput page springer util event increment scene analysi technic report nr de sung rist wahlster zimmermann increment natur languag descript dynam imageri int page buxton editor workshop conceptu descript imag volum workshop motion verb vehicl movement extract optic flow field proc eccv learn interpret layout structur document ch brewka advanc artifici volum lnc page springer hernandez qualit spatial volum lectur note artifici intellig highwai code stationari public po box interpret dynam uncertain control artifici richard cellular topolog unit space time page richard control spatial reason traffic surveil workshop spatial connect cognit theori formal august richard spatial control surveil system phd queen mari westfield juli richard buxton analog space time imag vision octob richard buxton analog spatial event understand traffic behaviour proc european conf artifici page john wilei son richard buxton select attent dynam vision thirteenth ijcai page august cohn hogg build qualit event model automat visual input proc iccv cognit refer point judgment symbol magnitud cognit hogg acquisit interact behaviour model proc ieee comput societi confer comput vision pattern recognit page ieee comput societi johnson hogg learn distribut object trajectori event recognit imag vision increment recognit traffic situat video imag sequenc workshop conceptu descript imag schaefer integr imag sequenc evalu fuzzi metric tempor logic program ch brewka advanc artifici volum lnc page springer joe qualit model space page lo morgan kaufmann hybrid reason scale space time aaai symposium principl hybrid page nov oliv rosario pentland statist model human interact ieee workshop interpret visual motion editor spatial tempor aug workshop von ein zur von mit von informatik der weld de editor read qualit reason physic system morgan san
HCI/1303 4 map base kohonen organ map empir approach thoma inform germani germani map valuabl interfac element visual inform retriev result larg set object method exist creation map articl describ compar evalu topograph map base organ result show map method chosen carefulli method test applic organ kohonen topic inform inform visual introduct keyword import strategi inform approach inform seek inform opportunist depend heavili inform inform approach evalu interfac approach built aim facilit document set approach visual base neural reduct algorithm neural network power comput algorithm human inform process successfulli appli inform retriev digit librari intellig map object topograph map capabl construct graphic displai order support strategi graphic environ topograph map regard multimod interfac advantag graphic languag element posit text object jointli express mean object topograph document displai document map receiv attent year commerci system develop exampl internet map import tool enhanc human comput interact grow number applic text document arrang inform object order merkl appli kohonen network softwar code order improv reusabl rauber creat som music piec coleman stress import system educ softwar point demonstr visual interrelationship concept import object teach social network theori comput central author scientif commun subsequ visual path analysi advanc retriev techniqu articl subject displai varieti system electron servic area demonstr attract method research applic financ trade develop map visual document set reduc prior inform retriev queri base metaphor map landscap metaphor vari strength map topograph produc abstract version map shown figur figur map perform stock green field highlight move field popup window detail inform specif stock figur demonstr schemat map data set document map simpl construct elev refer mayor topic document elev symbol collect document relev mention topic elev surround sea document inform visual comput graphic scientif visual figur topograph map dark color region symbol aggreg document elev construct manual simpl realiti map organ result document elev final map foreseen result topic identifi system strictli statist method elabor semant approach unpredict approach advantag disadvantag time hand approach facilit recognit document cluster cluster describ unknown topic hand cluster frequent complet useless semant aspect omit introduct xml lead improv map design strategi great import futur construct search engin document map exploit visual capabl human order creat interfac easi object close relat locat geometr distanc metaphor semant similar design strategi cognit plausibl understood user find inform realiz explicit search topograph map frequent base broad search user interact aspect inform gather main technic aspect creat map lai reduct data dimens document collect popular method creat map kohonen map som cluster algorithm cluster close similar method latent semant index factor analysi evalu interfac note lack evalu visual gener methodolog compar method design map layout relationship object result displai compar demonstr document di document dj comput similar dj method comput similar dj method build rank list dj build rank list dj compar list spearman correl coeffici comput averag correl coeffici central measur comparison spearman correl coeffici appli evalu ir system order measur differ similar matric deriv algorithm evalu show result document distribut differ larg tabl correl number document correl evalu interfac highest correl set document evalu method present document chosen start point user assum assess document order distanc start document typic user tendenc assess document read direct document start point consid evalu method present account closest document side start document consid chosen low experi ten twenti document orient map consid kohonen som rotat angl chang map input space kohonen doc doc doc doc doc doc doc doc figur variat displai evalu method consid typic user behavior interfac gener map start point interest user identifi keyword search system combin keyword search map common naiv question topograph map creat method variat creat topograph map differ greatli distanc object map simpl ident copi rotat actual user map similar rotat import creation algorithm moment evalu method orient correct chain user find interest document assess document closest densiti visual attent user attract central group object test confirm result experi conduct import aspect evalu intens filter regard adapt hypertext system user object case person overview map import goal user model user model method user map user paramet evalu topograph map extrem import grow number system usabl experi carri regard algorithm articl extend evalu methodolog requir user test lead quantit result doc doc doc doc refer comput method intellig inform access proc acm supercomput san ca pp neural network fundament applic york al learn space digit librari european confer research advanc technolog digit librari darmstadt sept berlin springer pp offen da konstanz im und technischen und der wien treatment semant heterogen inform retriev nr iz bonn person hypermedia present techniqu improv onlin custom st gmd interact domain interfac design adapt educ universität im document retriev und von und design bonn english summari toler inform retriev backpropag network neural comput applic special issu neural comput interact vol pp evalu method compar map hci intern intern confer august lawrenc erlbaum associ pp learn similar function inform retriev hj european congress intellig techniqu soft comput pp inform seek electron environ learn semant similar reusabl softwar compon william intern confer softwar advanc softwar reusabl rio de washington al pp enhanc inform retriev feder bibliograph data sourc author network base european confer research advanc technolog digit librari darmstadt sept berlin springer pp automat analyz organ music archiv european confer research advanc technolog digit librari darmstadt sept berlin springer pp
DB/1304 3 technic report plan disconnect mobil joann agraw amr el abbadi depart comput scienc california santa barbara santa ca abstract mobil todai comput commun applic infrastructur increasingli reli mobil technolog tradit applic inform servic applic integr mobil peopl comput develop distribut framework mobil environ kei requir environ support frequent connect disconnect site present algorithm implement framework asynchron system introduct mobil todai comput commun applic infrastructur increasingli reli mobil technolog current mobil applic tend larg central server mobil platform cach devic elev role mobil comput class entiti mobil user capabl independ central server mobil comput collect form entir distribut system interest mobil comput commun ad hoc manner commun network form demand commun occur wire wireless network subset comput collect connect requir reliabl depend access relev data interest distribut made mobil compon compon site peer replic site research partial support nsf grant number disconnect distribut replic site particip synchron transact capabl distribut replic extend site team member plan disconnect remain site minim disrupt mode independ updat portion disconnect member updat automat synchron integr reconnect mode permit concurr serializ implement asynchron system discuss approach mobil aspect system lack central server chrysanthi describ mobil comput truck industri truck comput satellit radio link interact corpor applic involv remot disast area militari applic mobil comput form network commun stationari comput discuss impact wireless technolog mobil host varieti replic strategi distribut replic file system coda extens experi disconnect oper accommod voluntari notion plan shown asynchron system present algorithm disconnect updat idea adapt version control softwar section present altern disconnect mode section present model distribut system section explain detail mode oper section show implement mode asynchron system conclud section motiv system compon distribut laptop comput belong member small team team member maintain replic laptop comput normal oper ensur team member complet synchron progress team member gather locat form ad hoc network perform work ad hoc network wire wireless varieti wireless lan exampl includ ncr wavelan motorola proxim rang laptop comput team member carri activ copi team member gather remot updat capabl connect fix locat comput system deal plan unplan disconnect scenario cover wai team member interact basic relax team member disconnect long period instanc travel remain team member inform continu process updat miss processor fail voluntarili disconnect copi travel member continu process readonli transact call mode basic idea plan disconnect reason comput distribut procedur disconnect remain member expect acknowledg vote disposit share data scenario involv ceo small fact decid spend budget laptop comput senior execut desktop comput execut secretari laptop senior execut replica corpor gener updat frequent meet connect comput network secretari comput bob travel meet custom give senior execut continu work corpor absenc laptop trip wait airport hotel room basic system capabl bob senior execut distribut system synchron compon updat manual overrid handl case member forgotten bob return copi automat brought date system procedur travel team member portion updat made portion disconnect rest member mode call mode mode team member travel locat gather inform relev portion portion concern work output team member travel team member portion team member complet unabl access data travel team member write lock data travel member access mode portion travel team member return reconnect laptop distribut made automat synchron integr contrast system mode requir manual integr mode involv part small sale team cover pacif northwest state meet team dai time bring laptop form network share inform common updat product product avail inform factori comput team member sale assign portion updat make sale deliveri contract alic updat portion queri portion access portion check team work laptop connect updat smoothli integr manual relax portion team member access mode unlik scenario transact result transact serializ situat relax serializ requir accept jane field research remot part world fellow research laptop remot observ platform weather station record anim migrat pattern download weather inform sensor station record anim migrat frequent check record earlier dai locat interpret measur field note comput jane fellow research relax mode check portion pertain locat anim speci studi fellow research queri portion queri result reflect valu time research gather form network view stale work end automat integr model distribut system consist site label sn partial fulli data item store redundantli multipl site inform locat copi data item store site directori site user interact invok transact site transact sequenc read write oper data item execut atom criterion correct serializ execut transact serializ execut concurr control mechan timestamp optimist concurr control lock wide assum site distribut system enforc lock local replic multipl physic copi user singl logic copi criterion correct replic serializ assum mechan enforc serializ synchron control protocol asynchron site manag scheme discuss section interest requir commun style distribut manag scheme long form global synchron deal distribut ffl number team member team member disconnect member distribut system frequent disconnect member gather form ad hoc network geograph locat ffl consist import serializ enforc local lock method global synchron preserv method ffl distribut system process updat team member desir design member primari site present network member equal particip plan disconnect type implement unplan disconnect disconnect inform distribut system intent disconnect reconnect orderli manner result disconnect site detect failur plan disconnect involv inform distribut system intent disconnect includ appoint proxi plan disconnect procedur enabl remain connect site continu process minim disrupt explor kind plan disconnect provid terminolog basic simpl plan disconnect basic disconnect site connect site continu read updat data item object system adjust list replica updat transact complet spite miss member plan disconnect accomplish proxi site appoint site vote behalf ensur replica updat action distribut system requir consensu power vote behalf member call proxi site power refer proxi site disconnect distribut carri disconnect dialog system awar disconnect period time contact member proxi read local copi data messag answer behalf disconnect track updat miss disconnect assum updat respond behalf assum site disconnect procedur site select proxi proxi peer connect special site design hold proxi data item site replic connect give proxi copi data item process updat transact data item read rest inform locat connect statu replica readili send messag determin inform data item site replic give proxi vote matter updat data item ensur proxi awar current updat process disconnect procedur reconnect contact proxi process messag site proxi broadcast messag determin proxi determin updat made bring incorpor updat retriev vote duti resum normal oper case site disconnect site give proxi simpli disconnect assign proxi distribut system perform updat matter basic protocol produc execut serializ argu transact disconnect site valu data read snapshot time disconnect transact disconnect site serial time disconnect mode site disconnect updat data declar intent disconnect object write accomplish obtain lock item disconnect order maintain serializ remain connect site prevent access object write object site time system phase make implement mode exist lock mechan site acquir write lock item object updat disconnect write lock ordinari write lock hold abort due deadlock ordinari transact mechan obtain lock transact mean order distinguish ordinari user call assum site disconnect set item disconnect procedur site select proxi basic mode step handl vote replic item initi obtain write lock item disconnect updat privileg item disconnect updat subset item reconnect procedur basic complet effect transmit item lock figur show activ time proce left asterisk disconnect reconnect point time version data item written transact figur acquir write lock disconnect exampl transact execut disconnect site site disconnect write lock execut transact read updat site remain connect execut transact notic execut transact disconnect disconnect figur mode write lock disconnect read item read lock disconnect item transact read version data item exist disconnect time order preserv serial transact execut disconnect point time disconnect item write lock disconnect time modifi disconnect item write lock disconnect time read written site hold write abort order lock item write lock disconnect time treat disconnect lock transact time serializ transact connect disconnect site respect phase lock disconnect site requir respect lock held transact site time disconnect figur execut condit write lock item lock transact site disconnect correct serial order transact mode produc execut serializ write lock obtain time disconnect held disconnect valu reveal reconnect time lock item data item modifi transact disconnect site transact serial respect local phase lock serial respect transact rest system point time disconnect read version item exist action disconnect site consid singl long transact point view rest system algorithm correct phase lock correct distribut manag system enforc global synchron explor detail site disconnect reconnect site item lock assum site disconnect site disconnect site observ write lock site data item disconnect unaffect transact involv data item read version exist disconnect reconnect transmit proxi updat miss write lock disconnect reconnect order reconnect updat lock process miss find write lock transmit process miss find lock complet relax mode remain connect site prevent access object preserv system oper lesser isol defin mode remain site access mode item site item site time transact site check wait write lock lock permit holder lock read dirti mode consist read permit write compat matrix lock disconnect read write shouldnt transact connect site access prevent transact read chang disconnect site reconnect send chang relax read transact site lock read lock item write lock site read write disconnect updat entir distribut reconnect relax mode execut permit greater concurr figur show execut lock transact site read lock lock execut occur lock figur depend cycl involv relax mode work site disconnect write lock read set item lock site transact lock realiz read data rule item lock disconnect time modifi disconnect item lock disconnect time modifi site transact item serializ transact site attempt write abort wait long time item lock disconnect time access read transact execut disconnect correspond ansi isol level lock write lock held permit read data read item disconnect site reconnect read uncommit dirti lock item write lock pseudo isol level implement asynchron system implement synchron system eager updat fairli obviou simpli obtain lock straightforward manner give asynchron system implement obviou epidem algorithm replica updat capabl maintain serializ system epidem style commun epidem commun requir distribut system member continu connect tradit replica manag system member individu updat system state commun updat member epidem commun period member decid contact member exchang inform kind knowledg updat spread system member connect short time exchang epidem model suit support user mobil disconnect environ distribut manag approach execut local local concurr control phase lock point record written event log record propag event log system member epidem commun member awar perform synchron commun action epidem messag disconnect figur relax mode lock member maintain vector clock captur causal order event member time tabl defin bernstein correspond recent knowledg event member time inform includ epidem messag time tabl ensur receiv record event time local record transact store event valu vector timestamp ith row time inform determin site awar set event base transact commit abort record garbag collect event log basic provid procedur basic mode protocol assum team member disconnect team member act proxi disconnect prepar stop gener transact contact member proxi read local copi data disconnect disconnect contact leav request act proxi stop accept epidem messag member stop accept epidem messag member local transact disconnect dialog send event log record believ time inform ensur disconnect send event log record time inform ensur accur pictur state brought back date reconnect messag disconnect receiv process mark event log identifi record point garbag collect bring date reconnect resum send receiv epidem messag act proxi transact process disconnect proce process incom epidem proxi check event log conflict mark record abort conflict vector timestamp transact consid concurr read write set check conflict execut transact local normal process updat timet timet updat origin member time set set assign mean awar record bear time disconnect unawar proxi acknowledg updat behalf member updat updat commit abort garbag collect log commit abort updat event log garbag collect finish process incom record ad record event log remot transact handl record similarli process receiv timet inform usual garbag collect log record local increment local clock transact timestamp write record log chang timet transact set clock contact updat log timet retriev vote capabl reconnect dialog contact member gave send act member act respond real begin reconnect dialog retriev vote stop process transact incom epidem record send entir event log garbag collect event log proce normal oper back proxi process messag manner epidem messag timet timet log timet date begin accept epidem messag member handl local readonli updat transact member accept proxi member team member act proxi team member maintain separ log timet member rememb member repres perform small amount extra process event log member proxi grow option requir complet copi reconnect mode discuss detail mode implement mode epidem system disconnect possess data read copi disconnect read write data item read item site read write accomplish make fact epidem transact attempt updat abort concurr conflict transact begin transact acquir complet transact disconnect special type transact disconnect send record timestamp distinguish clock timestamp site receiv updat process epidem updat record acquir write lock behalf timestamp incompar updat timet record remain event log garbag collect abort transact read updat updat note data item restrict prevent transact attempt read updat item updat record eventu site inform back conflict record fail abort fail item disconnect success possess data item disconnect time begin disconnect dialog disconnect data item successfulli acquir send epidem messag current record normal timestamp site compar record log conflict site origin site conflict log make updat site acquir write lock item lock updat disconnect complet record reconnect automat updat item relax mode send record timestamp clock timestamp send epidem messag recogn site relax transact option acquir lock item write lock transact read transact home site make acquir lock read item write lock transact capabl item includ readset detect potenti execut transact abort acquir write lock updat item site item execut figur system discuss mobil comput ad lot flexibl distribut system distribut flexibl synchron transact site mode flexibl distribut advantag mobil wai basic mode system requir complet synchron continu function site disconnect treat failur mode independ updat portion smooth distribut relax mode concurr mode cost perfect transact isol suffici applic refer el epidem algorithm replic acm symposium principl page goodman concurr control recoveri system addison replica manag strategi system mobil host intern hong kong comput societi mar grai reuter transact concept techniqu morgan abbadi exploit plan disconnect mobil environ ieee workshop research issu data engin page feb decentr protocol acm symposium principl distribut apr demer flexibl updat propag weakli consist replic sixteenth acm symposium oper system page resolv file conflict file system summer usenix page june epidem transact replic master california santa depart comput santa ca manag updat conflict weakli connect replic storag system fifteenth acm symposium oper system page transact manag develop facil standard system transact model advanc page morgan kaufmann chrysanthi manag mobil transact acm symposium appli bernstein effici solut replic log dictionari problem acm symposium principl distribut page aug
HCI/1305 4 gener interact base integr design real virtual world norbert peter christian konomi gmd german nation research center inform technolog ipsi integr public inform system institut germani contact norbert germani abstract central mainfram comput provid termin user current ag person desktop comput person observ earli adopt predict futur point era person multipl devic comput power ubiquit present vision workspac futur approach integr design virtual inform space real architectur space result environ call cooper build design approach base concept object result integr room furnitur inform devic part vision world interfac inform comput devic disappear interact inform exploit rich afford physic object present gener term interact electron wall interact tabl chair desk passag mechan cooper softwar system provid form interact cooper work kei word system workspac team humancomput inform virtual inform real architectur augment ubiquit cooper konomi introduct gener interact determin number context challeng evolv year evolv rapidli year root emerg technolog applic area approach vision futur year intent paper give account relev context focu select area complement contribut book doubt develop field hypermedia popular version virtual realiti technolog great impact type issu hci address interfac futur develop present approach framework mainstream orient guid design develop gener interact awar fact relat attempt describ framework area integr cooper work ubiquit comput augment realiti architectur note term primarili physic environ room build system architectur softwar architectur area arbitrari list constitu framework design hci futur mutual relationship depend shown figur hci ar cscw architectur fig view context futur hci cscw reflect applic scenario usag situat basic cooper natur mean build peopl work subgroup constel konomi member team organ interfac provid intuit wai share inform synchron asynchron peopl move smoothli configur chang applic ubiquit comput past central mainfram comput termin ag person comput guidelin person comput move era person multipl devic environ comput power ubiquit ubiquit comput peopl view special inform applianc extens view multipl devic individu group cooper natur multipl devic foreground devic network wai share inform peopl parallel individu group devic differ term size small larg differ term function provid local distribut set augment realiti contrast virtual conceptu technolog develop object real environ augment dive augment realiti result overlai ad digit inform real object integr comput power import convei real object relat approach direct relev combin architectur environ architectur hci area mention awar import real architectur space peopl interact devic hci applic space constitut build rang meet tradit desktop set motiv explicit relationship field architectur view physic space rich afford interact commun exploit research hci neglect larger context limit long time desktop comput issu notion cooper build elabor role area hci detail present design develop call constitu call object result integr room furnitur inform devic characterist requir time provid form humancomput interact support cooper work cooper experi activ cooper conceptu framework concret realiz term architectur envelop integr ubiquit compon result smart konomi artifact world interfac inform cooper tradit interact transform commun cooper paper organ section present point departur determin requir challeng gener humancomput interact relat work technolog section section introduc basic concept section describ design perspect workspac section introduc framework section complement conceptu analysi requir empir studi section describ implic design form interact cooper term compon realiz part environ section provid descript network infrastructur beach softwar final section point departur present area point departur order determin import requir gener inform commun work practic architectur set real world inform desktop comput introduct inform commun technolog shift physic environ place inform object desktop displai interfac inform tradit offic environ inform object physic paper document calendar announc bulletin board flip chart whiteboard meet room access manipul straight forward physic oper tool overhead realiti physic inform object replac larg digit inform object electron document larg bulki monitor sit desktop connect pc tower tabl standard comput equip offic todai desktop displai entranc virtual place find inform main focu research practic interact concern issu creat virtual inform space displai desktop comput interact interact interact rid comput devic similar drive car underli machineri fact modern interact microprocessor interact inform intuit cooper peopl basic underli idea express mark weiser konomi profound technolog disappear weav fabric everydai life indistinguish vision address time major concern recent year technolog move background turn interfac comput inform applianc hide technolog disappear adopt perspect extend direct main part paper work practic team work introduct inform technolog workplac chang content work work process effect organ work offic desk place work work home site result higher transit individu work collabor group asynchron synchron work organiz form chang busi world base develop manag scienc busi process effort organ adopt process busi model result flexibl dynam organiz structur promin creation ad hoc demand team order work project period time solv specif problem demand ad hoc format team requir power method tool support work phase team evalu meet support system develop past found empir studi provis hypermedia function facilit labor team work result result group problem solv activ investig role person public inform devic interact combin meet room collabor empir studi result show group balanc proport individu subgroup full team work achiev result group stai time work configur flexibl work mode larg determin rang combin inform devic provid team role structur offic build work cooper organ mobil todai develop exampl time reflect develop term work practic usag inform technolog design physic architectur environ workspac futur equal dynam flexibl introduct inform commun technolog chang content work work process konomi design physic work environ offic remain unchang form organ work practic reflect relev suffici depth design offic space build structur true issu relat mobil work work time challeng question offic build obsolet possibl modern mobil technolog point view offic build high role resp chang place individu work space plan team work group meet wide rang social interact spontan inform unplan opportunist cooper convinc social interact increasingli import establish corpor group team chang team member chang task establish higher rate start point framework cooper build design flexibl dynam environ provid cooper work experi space support augment human commun collabor relat work offer framework integr wide rang approach number develop influenc due limit concentr area recent develop augment realiti ubiquit comput select reflect central belief real world start point design interact futur larg bodi research area cscw build work electron meet room interact whiteboard contribut stefik pederson olson streitz nunamak due lack decid describ work detail overview cscw augment realiti understood counterpart virtual realiti wear helmet order virtual augment realiti concern comput devic order augment percept interact physic world overview initi work digitaldesk video project comput displai overlai paper document real desk project front project techniqu offic futur base comput vision comput graphic technolog util spatial displai order surround user synthet imag vision displai wall irregular shape major applic build system share exampl augment surfac develop creat hybrid environ konomi order extend channel percept make call water rippl project ceil room activ direct notion user interfac work inspir answer develop bishop incom phone call marbl specif area plai messag back idea describ passag mechan section relat approach system electron tag block sequenc onlin media realiz simplic mode special craft system insert dedic slot ubiquit comput direct consequ pursu approach augment realiti requir spread network inform devic displai provid function desktop comput concept ubiquit comput ubiquit media size devic rang small larg devic stand recogn environ physic space fill multipl set issu transfer inform intuit direct interact desir posit devic state room build issu techniqu concept section issu requir set infrastructur local technolog collect inform devic user perform task awar number controversi issu respect privaci scope paper design perspect workspac futur vision workspac futur world interfac inform ubiquit physic environ anticip peopl interact ubiquit interact landscap interact cooper augment real environ konomi mental mental space space task content social social space space work practic cognit process organiz structur human group organ commun facil manag fig design perspect work space futur inform inform space space inform technolog room architectur architectur architectur space space order develop workspac follow design approach human center address mental space potenti limit human process cognit process content task perspect design inform space repres map task content compat inform system realiz softwar hardwar human problem solv activ map wai interact mediat network inform devic provid function work task human part group team team view context organ requir social space reflect role work practic organiz context design cooper commun technolog cscw perspect account architectur space reflect characterist room architectur compon build obviou physic object placement architectur space provid valuabl organ content inform meta inform activ individu group design perspect space shown figur implicit distinct real virtual world plai special role back argu augment smooth transit real virtual world combin integr design develop enabl interfac build afford everydai realiti virtual parallel design interact interact seek aspect world konomi cooper build due role offic build reflect design workspac futur concept cooper build establish seri intern workshop cooper build term order start point design architectur environ person navig chat room cyberspac sit real space call build serv cooper commun user inhabit visitor emploi attent adapt compon build provid facil identifi condit part vision adapt chang situat provid inform knowledg past current state action plan peopl dimens shown figur structur requir design cooper build individu work local context virtual world real world fig dimens cooper build global context group work address world virtual dimens physic architectur space digit inform space cyberspac terminolog set interchang live work environ highli determin architectur space constitut build constitut rich inform space due inher afford direct inform sourc chart hang book memo ly provid ambient inform sound peopl pass encount peopl copi common rich opportun exchang social konomi term impli strong associ physic concept cooper build understand cooper build origin physic architectur space complement compon realiz object structur virtual inform space cooper augment inform interact space addit meet room inform technolog peopl retriev discuss inform ubiquit fashion requir integr inform space mean interact physic environ wall furnitur section aspect part dimens peopl physic locat distribut locat term virtual virtual virtual organ perspect encompass distribut set remot locat peopl work dwell remot locat offic build site organ build small offic home temporari hotel room salesperson framework cooper peopl share inform work cooper independ physic locat contrast restrict videoconferenc seamless integr inform commun technolog respect local environ result transpar direct intuit commun cooper distribut environ approach line work media space ubiquit media standard desktop video face challeng design issu creat background set distribut member issu distribut room coupl video conferenc address al interpret close relat global dimens dimens address issu design local environ respect requir result role role augment individu work support group work meet provid environ facilit global cooper distribut peopl intuit understand mean detail term synonym standard offic meet room scope hallwai part door place meet room floor local remot notion remot locat global context start citi sensor determin posit facilit inform devic local global context cooper build provid inform locat peopl relationship devic gener local global dimens address differ social context work organiz work local team organiz unit global organ compani konomi relev distinct base dimens type support coupl share workspac base earlier work cooper hypermedia groupwar determin coupl user provid awar share dimens reflect implic phase team present discuss complet split work individu assign resum integr idea merg intermediari opinion realiz pai attent dimens order constitut basi evalu workspac futur ongo work develop environ section concentr dimens discuss previou real virtual individu group dimens requir creativ team innov concept scenario advanc basic technolog import make principl design suffici develop system order inform conduct empir studi investig current work situat team requir futur environ due limit report select result studi select compani automobil oil industri consult busi compani chosen special group call work area strateg identifi futur design market interview repres visit project team meet distribut questionnair team member total number peopl team academ educ comput busi design result show meet facil case tradit meet room furnish standard equip larg solid tabl flip overhead projector coupl scanner printer perman instal meet room activ creation content meet aid comput creativ techniqu fashion result current state contrari expect expect usag technolog meet situat chang requir futur larg room requir flexibl setup variabl compon configur room charact market place landscap provid opportun spontan encount inform commun quot meet anymor konomi conduct meet room provid environ situat encount furnitur flexibl current situat great open support support inform gather prepar meet advanc access intern extern data version call support wide rang creativ techniqu version flexibl configur tailor underli support present style deviat tradit situat involv activ fashion label support visual inspir enhanc creativ support commun experienc content channel tactil emphasi videoconferenc expect team stress import person presenc essenti creat stimul product support strongli comput stai background quot creativ team freedom physic environ inform environ compon approach meet requir flexibl configur dynam alloc resourc physic inform environ parallel base concept call object result integr room furnitur inform devic term origin creat streitz regist trademark gener approach product area gener goal develop make progress design integr real architectur space virtual inform space context support team compon tailor form flexibl dynam serv multipl project team present learn inform goal common requir develop softwar enabl form interact cooper present exampl environ basi conceptu empir work integr idea relat creat visual descript plan environ figur show spring environ call interact landscap creativ innov gener environ consist compon wai develop term function provid beach konomi softwar develop work section origin vision scribbl show interact electron wall interact electron tabl mobil network chair integr interact devic initi set gener assembl darmstadt beach softwar constitut version environ develop partner industri part consortium offic gener redesign develop compon call fig vision scribbl environ earli vision scribbl suggest work place individu search background call paper suggest mobil integr devic scan paper document content immedi process network shown annot compon built gener type initi mention focu design workspac environ easili extend provid support global cooper distribut team inform found al give overview compon object provid devic serv team cooper project meet room consid electron larg area assembl sheet paper cover wall creat organ inform team enabl displai interact larg digit inform structur collabor consid electron current realiz consist segment back project larg displai surfac total displai size width height cover side room complet figur driven beach softwar larg homogen workspac interact boundari konomi segment person work individu parallel share displai space size challeng interact cumbersom drag object window distanc touch time hold walk side develop mechan address problem similar pick object place featur inform object walk contact displai bridg distanc close cooper group throw object side opposit side caught team member interact object content primarili requir select mode interact achiev increment gestur recognit provid beach detail section fig peopl sit cooper person figur mobil chair attach comput repres type furnitur combin mobil comfort inform technolog peopl commun share inform peopl stand front compon make person note privat space interact remot share make remot annot cooper share function provid beach softwar maximum flexibl konomi mobil chair provid wireless network independ power suppli gener figur develop dock facil left side figur peopl bring laptop comput drop desk part version side figur integr comput built desk gener made complet redesign result version shown center figur front fig gener figur interact tabl design discuss annot inform object small group peopl stand peopl write draw pen interact finger pen gestur inform object wireless keyboard extens text input horizont displai peopl stand interact area predefin orient top left found vertic monitor desktop comput horizont round displai requir form interact develop beach special gestur shuffl rotat individu inform object group object surfac orient automat accommod easi view perspect creat view shuffl side opposit team member correct view time view object correct perspect edit annot konomi version cm shown built vertic project unit imag project top tabl provid horizont displai cm cm diamet cm made complet redesign result version shown side figur project replac larg displai panel displai size cm cm diamet cm left side figur compon develop part gener design individu work cooper small group height displai quickli adapt order accommod work stand sit front arbitrari chair displai tilt angl provid optim view move multipl connect arrang form larg displai area left side figur integr sensor measur distanc connect initi automat coupl displai close cooper beach softwar enabl result larg displai area common workspac peopl work concurr move inform object physic border individu displai fig configur redesign peopl creat shuffl connect opposit rotat work parallel correct perspect mobil connect achiev emploi wireless network connect independ power suppli base metal accumul compon packag rotat induct consum passiv complet free konomi passag mechan passag describ mechan establish relat physic object virtual inform bridg border real world virtual world passeng enabl peopl quick direct access larg amount inform locat physic repres act physic virtual world longer open hierarchi worri mount passag concept bind content object intuit inform offic meet room passeng special physic object uniqu detect physic object passeng inform structur store passeng link peopl turn object arbitrari object restrict passeng identifi bridg uniqu figur show kei chain passeng dark area repres real part devic margin interact interfac area front displai repres virtual part bridg devic fig kei chain passeng object bridg interact virtual object assign passeng virtual part bridg real passeng real part bridg passeng make virtual counter part access simpl gestur digit inform assign retriev passeng virtual part bridg bridg integr work environ ubiquit intuit access data inform locat offic build cooper bridg integr tabl top interact electron tabl konomi interact mount front interact electron wall meet room passeng special physic uniqu detect object passeng develop method detect identif passeng method enabl arbitrari object prepar tag basic properti physic object weight identifi bridg electron scale measur weight passeng implement approach area electron tag approach similar bridg equip identif devic technolog small electron identif tag attach physic object passeng identifi uniqu identif weight object greater flexibl short term electron tag method higher reliabl long term assign requir prepar object elabor descript technic detail network infrastructur compon present full benefit integr combin network infrastructur connect softwar infrastructur wide rang cooper share capabl extend mobil team member compon lab build identifi locat requir local infrastructur identifi peopl front segment extens plan current combin local area network instal build wireless network maximum flexibl mobil compon connect wireless network compon equip antenna comput fix connect cabl lan network connect wireless access lan realiz act bridg ethernet beach support creativ point design compon gener develop environ main applic support team work focu creativ innov support type creativ techniqu relat gener function visual knowledg structur applic area organiz group cooper design support teach learn classroom group entertain environ konomi order meet requir develop beach softwar basic environ activ collabor architectur user interfac adapt compon requir form interact compon connect synchron collabor share document distribut multipl devic import larg interact area realiz separ segment technic limit displai requir user work multipl devic composit dynam configur model physic compon multipl user adapt orient shape beach layer architectur built top core model layer common model defin basic interfac user interact style top set gener compon basic function teamwork meet situat includ standard data type inform handwritten input privat public workspac gener collabor support base common model gener compon specif support defin tailor function distinct task detail beach beach built top coast framework platform distribut object coast develop implement groupwar system dolphin high level design goal beach reli intuit action peopl physic interact space gestur input major interact type standard input devic keyboard support plai minor role promin convinc provis function user object depend momentum provid object fly faster slower cover larger shorter distanc contrast posit exact handl pen input demand pen input consist stroke touch view object ui displai make imposs posit stroke distinct criterion import toler inaccuraci input decid stroke interpret command data input user enter stroke pen beach user shape stroke continu analyz form distinct stroke interpret gestur invok command scribbl inform complet control handl pen event offer possibl context sensit semant gestur beach offer user select mode action matter provid handwritten input scribbl make gestur oper exist object creat object achiev implement increment konomi recognit stroke current shape continu comput give feedback user color line inform oper result action present design implement compon central constitu vision workspac futur base integr design real architectur virtual inform space tradit desktop comput approach relat inspir develop augment ubiquit comput cooper meet support system initi experi addit extern instal bad month part regist project world exhibit expo previou demonstr intern fair octob compon gener won intern design award state germani inform futur develop found final comment afford architectur space guid metaphor design environ support cooper human interact inform import perspect mechan emploi arbitrari real world object interact form inform object larg interact thing report provid intuit form cooper commun point similar direct relat develop import tangibl object summar section relat work remain concept metaphor carri empir question plan address note term compon regist trademark gmd regist trademark cooper partner acknowledg torsten thorsten student valuabl contribut part project ambient cooper burkhard frank german offic furnitur manufactur michael konomi design compani context consortium offic sponsor part work present refer read groupwar cooper work morgan kaufmann san mateo media bring peopl comput environ commun acm live augment ubiquit media reactiv environ commun lawrenc reactiv throw keyboard commun acm lai foundat graspabl user interfac acm offic consortium tangibl seamless interfac bit atom chi march acm physic transport digit inform cooper build hypermedia group chang strategi comput support cooper journal collabor comput comput mit mass electron meet ten year lesson learn technolog applic upper saddl close comparison group design process simpl group editor streitz special issu cscw acm transact offic inform electron whiteboard inform workgroup meet amsterdam acm hand rock cradl id intern design magazin offic unifi approach model spatial displai juli acm york direct manipul techniqu multipl comput environ uist oct acm konomi user cooper environ consist multipl digit devic augment spatial continu work space hybrid comput environ acm bring mark whiteboard electron life konomi design objectori synchron groupwar coast cscw nov acm comput support collabor problem solv meet commun acm integr meet support local desktop environ cscw oct acm cooper integr design architectur space inform space cooper build integr organ architectur intern workshop cooper build feb lnc heidelberg investig role person public inform devic combin meet room collabor sep kluwer academ für und groupwar und innov steinmetz interact landscap creativ innov acm press cooper build integr architectur intern workshop oct lnc heidelberg architectur softwar infrastructur environ workshop present acm confer support cooper work decemb physic control onlin media siggraph juli acm comput centuri scientif american konomi power environ calm technolog open keynot speech intern workshop cooper build feb abstract speech back real special issu commun acm ambient turn architectur space interfac peopl digit inform
Agents/1306 1 secur dynam recon gurat scalabl corba system mobil agent fabio kon gill anand roi campbel denni depart comput scienc illinoi abstract internet electron inform commun system continu avail domin issu continu softwar evolut requir system recon gurat run system upgrad compon chang con gurat paramet internet servic serv thousand million user scenario con ict issu con scalabl mobil recon gurat agent scalabl dynam recon gurat internet system agent deploi architectur orb support safe recon gurat middlewar engin user applic graphic administr build recon gurat agent topolog recon gurat network agent recon gure distribut system agent return result inspect recon gurat oper distribut system administr introduct scope internet servic continu expand stretch reach number encompass human activ virtual world world wide web activ manag bank read access nancial ling incom submit articl regist scienti weather natur disast consolid vote presidenti elect stress import servic secur rapid evolut softwar requir frequent code updat recon gurat maintain exibl rapid growth system ensur servic requir scale internet dicult problem exibl servic grow meet applic exibl con ict avail servic provid shut recon restart internet servic order updat recon gure disrupt result busi case electron put live case mission critic system deliv disast inform research dynam con gurat seek solut problem break complex system smaller compon dynam replac recon gurat individu compon minim disrupt system combin high exibl avail scalabl con ict exibl address research dynam con gurat internet servic video search engin maintain high level parallel order ful ll million request receiv hour servic requir sale softwar readili di erent countri servic replic split machin di erent optim bandwidth cpu minim user time problem recon gure updat distribut collect server troublesom lead wast bandwidth duplic inform internet line research support nation scienc grant complet solut challeng problem secur primari concern recon gurat internet system control essenti provid support integr recon gurat request present architectur solv problem scalabl integr secur applic scenario applic mobil agent varieti distribut includ distribut dynam con improv perform signi cantli uniform deal code mobil disconnect oper di erent mobil agent dynam con gurat multimedia distribut system rst identi ed mobil recon gurat agent internet system develop system scalabl distribut multimedia stream system realiz distribut network ector spread network ector work receiv input multimedia packet list trust sourc forward packet ector client commun pair ector varieti protocol depend situat experi system rang audio conferenc live broadcast video audio network multimedia ector deliv multimedia stream million user ve contin diculti carri manag ector necess exibl mechan runtim recon gurat tool optim bandwidth util code distribut compon recon gurat ector carri live broadcast mar path nder mission pc station nasa jet broadcast month found program error ector code forc updat execut code machin manual meant upload code remot machin ftp telnet kill exist ector creat process repeat ector system recon maximum number client ad multimedia cumbersom administr connect ector separ section present solut problem mention section describ corba orb support dynam con gurat section describ recon gurat infrastructur build facilit manag scalabl internet system greatli reorgan ector code permit dynam replac fundament compon export con gurat interfac corba idl recon gurat ector administr distribut implement ector compon replac implement de ning suitabl recon gurat administr distribut code recon gurat command ecient avoid wast bandwidth minim time intranet manag corpor system administr manag thousand person workstat dozen server organ varieti applic text web spread data base system administr autom support elimin ineci requir instal maintain copi applic updat server entail duplic work mobil agent perform task corpor updat applic instal custom instal base user prefer store local le made access authent agent intranet span distant gain technolog save network bene ting data local low latenc mobil comput factori control system mobil recon gurat agent aid industri set softwar system control factori machineri administr walk factori inspect physic machineri pda inspect state digit control devic contact infra red wireless connect administr creat agent visit control collect return displai conveni form administr creat recon gurat agent optim product inject system agent visit recon gure system coordin order implement optim con gurabl middlewar research group develop distribut oper system base con gurabl middlewar layer compliant corba standard achiev built corba orb enabl recon gurat intern engin export interfac load unload compon orb runtim inspect orb con gurat state dynam recon gurat applic run top orb recon gurat applic architectur framework depict gure persist repositori store compon implement local le system organ hierarch categori er method manipul categori implement categori compon implement store local dynam load process runtim network broker receiv recon gurat request network forward dynam servic con gurat interact gurat suppli common oper dynam con gurat compon runtim deleg function speci compon con gurat gurat gurat shown gure deleg basic con gurat task compon ac framework ac servic config process startup con gurat le manag dynam link ac servic repositori manag load implement system administr recon gurat softwar drive recon gurat applic run top connect network broker local file system network broker dynam servic configur persist repositori administr tool reconfigur agent process boundari fig compon interfac sequenc void string sequenc void string void string void string string string void string string string string string string string string string void string string string string string long string void string string string string void string string string fig gurat interfac port corba idl interfac scheme distribut con gurat protocol de ne command code inspect dynam recon gurat runtim softwar recon gurat run compon figur show gurat idl interfac support rst oper shown gure inspect dynam structur orb domain retriev inform di erent abstract categori repres type compon categori typic di erent dynam loadabl code store local persist repositori categori call implement thread model reactiv thread thread pool strategi implement load system load implement logic compon orb domain compon hook repres compon depend compon depend repres attach hook depend ect runtim softwar architectur applic underli orb load implement oper dynam load compon implement orb persist repositori system runtim start run hook implement attach hook compon domain suspend implement resum implement suspend thread activ compon remov implement unload compon runtim configur implement send con gurat messag compon upload implement remot entiti store code implement orb persist link run process attach compon orb domain download implement remot corba client retriev code implement orb persist repositori recon gurat agent initi version implement requir connect administr tool applic process order con gure applic process signi limit system administr upgrad compon servic ten detail document command abstract refer found connect replica upload implement recon gure replica latenc internet connect process extrem labori rst solut problem consid implement manag administr type sequenc recon gurat action list applic node approach simplifi work solv problem bandwidth send larg amount duplic inform internet line solut adopt administr organ node internet system hierarch manner recon gurat administr speci es topolog distribut servic direct graph creat mobil recon gurat agent inject network recon gurat agent visit node graph interconnect orb orb rst replic forward agent neighbor execut agent process recon gurat collect recon gurat send back neighbor agent sourc administr organ recon gurat hierarchi optim data ow distant applic node recon gurat command execut parallel improv time graph di erent level redund system toler failur node recon gurat network enhanc scalabl decentr di erent administr domain select domain repres receiv recon gurat agent global administr includ domain repres distribut graph repres forward agent relev node domain implement implement distribut recon gurat system base mobil agent consist extens origin implement forward recon gurat graphic administr written recon gurat graph assembl send recon gurat agent administr select orb part recon gurat graph gure draw direct edg connect graph node gure time orb select list side gure node ad graph gure recon gurat graph graphic interfac assist administr build script command codi ed recon gurat agent administr instruct graphic send agent initi node graph figur show composit agent list list load list implement agent copi recon gurat graph di erent agent oper di erent graph script command interpret node uniqu sequenc number avoid process duplic copi agent node receiv orb rst check process local histori process agent agent distribut agent neighbor recon gurat graph includ process command wait result agent neighbor collect repli group result recon send inform back node receiv agent node wait result agent period time timeout comput number node agent result return node recon gurat graph nalli displai administr graphic system draw attent node select graph node creat graph edg fig repli timeout figur show result return agent inspect command call inspect agent dissemin system lightweight implement reliabl multicast adopt simpl reliabl solut agent transmiss concentr dynam con gurat aspect problem depend topolog recon gurat network node output worthwhil underli protocol distribut agent complex middlewar higher reliabl protocol java agent implement support agent simpl recon gurat script base protocol write extrem lightweight interpret process agent ecient pda system factori control scenario section limit express recon gurat agent power languag recon gurat administr write sophist agent agent orb state make action achiev extend infrastructur add support java agent encapsul sun java virtual machin compon dynam load compon export interfac oper load interpret java bytecod addit recon gurat topolog modi ed java agent carri dynam state node node java bytecod interpret insid action limit gurat idl interfac gure java bytecod issu inspect recon gurat command orb domain base result command agent updat state carri node chang behavior adapt environ user prefer modifi recon gurat decid migrat di erent set node framework er simpl agent base script environ limit resourc power java agent carri state modifi behavior agent inform collect inspect agent fig secur recon gurat internet system protect secur mechan access con gurat engin control framework support integr recon gurat featur recon gure mission critic sensit applic secur mechan implement altern secur socket secur corba opt extend recon gurat engin support access control encrypt group corba implement standard gener secur servic api extend design includ instanc subclass network broker support secur recon gurat agent shown gure compon implement api access control servic administr inject recon gurat agent network establish secur connect root node distribut graph version administr front end encrypt mechan data privaci integr unauthor princip decrypt agent tamper system ensur authent credenti deleg credenti suppli mechan enforc access control system recogn multipl role alien admin recon gurat read alien access forward recon gurat agent broker rst establish secur connect forward encrypt agent credenti role origin author agent receiv recon gurat broker decrypt check integr authent api forward agent node dictat distribut tree accompani agent access control check author command agent issu contact access broker execut agent local merg result result children node forward collat result parent decrypt integr check result forward manag agent receiv collat access control secur acceptor local reconfigur secur connector secur agent broker doctor con gurat tool fig consist experi distribut comput system shown wide rang applic requir strict consist compon di erent node deploi multimedia distribut system section di erent version ector compon simultan compon updat success part node fail distribut system continu work gracefulli updat achiev manual system small opt provid strong execut recon gurat command current implement singl recon gurat command fail agent catch except fail command treat recon gurat command succe node fail cope system detect failur graphic gure displai administr occur respect diagnosi messag separ tool call doctor dynam orb con gurat tool gure administr connect node failur inspect state recon gure node manual navig orb applic compon administr investig achiev ect atom transact function er java agent individu java agent program store previou state system start make error occur recon gurat process java code detect error messag bring con gurat back initi state achiev ect atom transact distribut system di erent techniqu recon gurat failur compon load dynam load compon depend compon recon save compon intern state con gurat occur restor case roll back initi state achiev requir compon implement oper captur restor intern state surgeon initi fail locat function alloc resourc instruct administr separ recon gurat phase resembl commit protocol atom transact administr send agent load requir compon initi execut oper load con gure error node administr send agent unload compon node doctor individu error compon implement load initi successfulli administr send agent attach proper applic orb correspond commit phase commit protocol found sucient applic scenario work applic requir strict acid properti atom transact recon gure marshal compon orb distribut import properti transact orb replac marshal mechan orb send request chang longer commun support extend infrastructur standard transact mechan distribut system recent protocol mobil agent mechan recon gurat activ compon interest research topic atom transact deal activ object data code run simpli data case tradit atom transact le system distribut result test infrastructur varieti system includ sun solari sgi irix linux red hat window nt order evalu time rel perform gain made mobil agent base recon gurat establish testb collabor depart comput scienc rei juan carlo spain state brazil testb consist group sun sun machin run solari pc run linux redhat pc run linux redhat domain machin insid group connect fast ethernet network group connect public internet execut instanc test applic run top inject di erent kind agent network avoid drastic oscil internet bandwidth minim undesir carri experi night tabl show averag bandwidth transfer le ftp ve latenc ping lab illinoi remot tabl show total time execut ve inspect command list list load list domain comp di erent techniqu subsequ tabl number arithmet run experi number bar standard deviat column show time execut agent instanc domain column show time execut singl orb remot node rst line show time agent distribut tree ran experi time high network trac perform number favor mobil agent approach bandwidth latenc ms ms averag network bandwidth latenc time ms orb orb agent graph agent time execut ve di erent inspect command tabl shown gure line show time agent directli singl node node shown gure line show time execut ve inspect command ve consecut request tradit model agent model agent distribut tree agent distribut fig tabl distribut obtain perform improv relat distribut scheme ms agent ve separ request led perform improv ms measur bene ts distribut tree gure vari size seri agent carri code compon instal remot node shown gure size compon upload rel gain distribut tree connect signi cantli gure show compar perform agent approach convent request number request implement improv signi cantli tune preliminari result encourag demonstr mobil agent provid extrem perform improv recon gurat distribut system relat work previou ongo research dynam con gurat develop system surgeon architectur descript data ow model repres structur complex applic con gurat languag dynam modi cation structur compon size distribut tree agent upload compon node number command agent agent versu convent fig paper show combin appar unrel research area agent dynam con manag dynam con gurat distribut applic scalabl integr system provid framework dynam con gurat base mobil agent common concern relat mobil agent secur requir includ authent involv parti protect execut environ malici agent challeng protect mobil agent execut unresolv method base languag code provid protect execut environ show isol agent protect agent malici host dicult partial solv approach secur agent concept approach provid secur commun channel agent protect extern attack host access control limit agent agent sign digit intermedi malici node modifi agent carri perform evalu infrastructur java mobil compar approach base rmi aglet experi agent network experi involv agent network work demonstr mobil agent model lead signi perform improv present elabor quantit model mobil code perform internet servic depend avail softwar continu version run system updat recon gure minim disrupt avail paper mobil recon gurat agent scalabl dynam recon gurat internet system prototyp implement orb support dynam recon gurat intern engin applic infrastructur includ graphic system administr build recon gurat agent path agent follow system empir result show agent improv perform dynam recon gurat greatli mobil agent manag con gurat internet system standard practic avail sourc code document recon gurat engin refer baldi picco evalu tradeo mobil code design paradigm network manag applic proc int conf softwar page april dynam recon gurat servic corba proc int conf con gurabl distribut deer multicast rout datagram internetwork extend lan acm transact comput page ssl protocol internet je rei alfr editor distribut transact facil morgan kaufmann al overview mar path nder mission assess land site predict decemb jim grai andrea reuter transact concept techniqu morgan kaufmann san fritz hohl time limit blackbox protect mobil agent malici host mobil agent volum lnc page packag dynam recon gurabl distribut applic iee softwar engin march perform evalu mobil agent paradigm page novemb jain dougla schmidt dynam con gure commun servic servic con gurat pattern june al distribut os heterogen environ tech rep univ illinoi decemb wong architectur scalabl distribut multimedia proc int conf advanc scienc page april kotz grai mobil agent futur internet acm oper system juli gener secur servic applic program interfac technic report internet rfc network work januari danni lang mitsuru oshima program deploi java mobil agent aglet kramer construct develop environ distribut program iee distribut system engin georg peter lee untrust agent code mobil agent volum lnc page katia multicast transport survei taxonomi ieee commun omg secur servic speci cation technic report object manag novemb jim robert rick editor fourth intern confer con gurabl distribut system ravi sandhu edward charl access control model ieee februari campbel design implement runtim ection commun middlewar proc icdc workshop june schneier kei gener agent mobil agent volum lnc page silva approach provid mobil agent fault toler proc int workshop mobil agent page septemb giovanni editor mobil agent volum lectur note comput scienc vitek mobil agent kernel proc octob denni program languag remot evalu acm comput decemb
AI/1307 2 confer cypru hybrid modular expert system effici infer explan ioanni jim school engin dept comput engin comput technolog po box abstract hybrid modular expert call present dual symbol base convent symbol hybrid base kind rule combin symbol connectionist symbol rule intern convert effici reason hybrid modular knowledg base construct scheme share common infer engin infer engin base connectionist prove effici possess effici natur explan mechan introduct construct convent expert system greatli depend avail expert abil make explicit hard task knowledg acquisit expert refer bottleneck construct neural network depend avail empir data make construct neural network easi neural network effici comput output lack explan contrast expert make black unnatur understand effort combin expert system neural network hybrid order exploit benefit call neural network infer engin expert system neural network select rule fire al neural network select node infer step theorem prove process lam neural network partial problem solver system exploit effici neural leav aspect natur modular research partial support project program connectionist expert system integr system repres relationship consid node neural network weight set make network infer correctli gallant system characterist abil reason partial data abil provid explan form rule improv perform connectionist expert infer introduc order assess base number input account number intern larg network import weak point connectionist expert system absolut reli empir data useless case data invalid symbol compon scheme present hybrid modular expert system tool construct expert system close symbol symbol scheme base hybrid scheme symbol rule convert common infer engin infer strategi explan mechan provid structur paper section present knowledg scheme architectur section hybrid infer strategi explan mechan present section present section result section conclud knowledg neural kind hybrid rule consid unit input ci unit condit rule condit ci assign number call weight input unit rule assign number call bia bia unit input set discret output repres calcul sf sf ci activ activ threshold output repres failur success rule gener syntax denot occurr denot denot symbol repres concept medic domain variabl condit input variabl intermedi variabl intermedi output variabl input variabl valu user intermedi output variabl valu repres intermedi final denot symbol numer predic symbol predic numer predic symbol predic denot symbol number factor condit repres condit draw cn form unit distinguish intermedi output depend intermedi output variabl symbol rule syntax semant bia miss symbol rule final convert section architectur cn architectur illustr system dash consist function similar convent hybrid rule base hybrid infer engin work memori explan mechan produc empir data symbol rule initi construct user depend inform concept train train mechan train exampl produc empir data user process user assist creation train data train data elicit mechan section symbol construct user knowledg acquisit convert train mechan process process produc symbol rule due fact symbol rule correspond function singl symbol rule easili convert set sfi number condit rule infer reason section condit rank descend absolut valu factor make infer account input data wm rule wm fact fact format condit rule special symbol fact repres initi condit intermedi final produc infer produc explan reason system reach form rule hybrid infer engin fig architectur hybrid infer engin implement reach base measur fire intent similar introduc output comput eq deduc output valu condit achiev defin sum remain sum set evalu set unevalu condit ci condit condi weight sum valu condit repres largest weight sum remain condit evalu condit output deduc valu unevalu condit output defin fire ratio fr fire ratio estim intent output fr valu evalu condit determin valu unevalu condit rule evalu block fire ratio mean condit evalu output evalu valu variabl system equal bia equal sum absolut valu factor variabl influenc valu condit remain sum fire ratio unevalu intermedi remain sum fire ratio unevalu condit intermedi variabl updat fire ratio updat remain sum equal unevalu variabl constitut particip infer mechan focu particip fire ratio close select maximum fire fire system evalu unevalu maximum absolut factor condit evalu kn fr comput fr evalu put wm system reach final stop infer algorithm input data updat remain sum fire ratio affect particip initi input comput initi valu remain sum fire ratio regard particip particip mark rule fire put wm particip mark rule block mark put wm remov particip rule updat affect condit remain sum fire ratio put particip execut step system reach final particip select maximum fire ratio particip select unevalu maximum fr unevalu condit select input user intermedi variabl find unevalu maximum fire ratio variabl execut step select clear particip rule input data updat affect condit remain sum fire ratio put particip wm output stop displai stop explan mechan explan mechan justifi infer produc set explain reach explan rule infer output variabl condit subset input intermedi variabl particip draw variabl valu user infer infer possibl predic condit explan rule posit contribut produc output explan condit evalu distinguish posit neg condit case fire posit condit evalu true posit factor evalu neg factor case block posit condit evalu true neg factor evalu posit factor condit unknown neg includ explan rule posit condit base fact process order find posit weight sum posit condit bia sum neg condit set unnecessari posit condit set includ posit condit empti set condit ci posit condit absolut sfi delet ci insert posit condit insert condit evalu chang predic vice versa formal outlin explan fire output gener rule condit posit condit make predic valu condit step condit intermedi rule produc base evalu condit predic condit chang vice versa place condit condit evalu output evalu chosen condit evalu output evalu maximum fire ratio chosen step execut chosen exampl knowledg base illustr function system present train data deal acut theoret symptom red hair sensit base symptom treatment depend inform provid depend inform construct initi train data provid train produc knowledg illustr knowledg base form multilevel network present gallant infer initi data fire ratio updat notic initi fire ratio calcul construct infer trace present affect updat fire block particip true true true true true true true treatment true treatment treatment treatment treatment treatment treatment treatment fig knowledg base fr propag intermedi affect updat fire block particip fr propag output rule put wm proce select particip set select maximum user affect updat particip fire block fr proce particip rule select maximum user affect updat condit fr particip fire block propag intermedi affect updat particip fire block fr proce select user affect updat particip fire block fr output intermedi put wm propag output intermedi affect updat condit fr particip fire block fire output put wm output particip particip fire block final final output explan present explan produc system infer give trace explan mechan provid explan order gener explan rule explan mechan examin output evalu explan rule extract treatment treatment treatment trace gener explan rule due fact evalu chang predic explan rule intermedi explan rule gener examin explan rule true treatment trace gener explan rule remain evalu chang predic output examin explan rule treatment intermedi explan rule condit provid time examin explan rule result section present result compar perform infer explan mechan present infer mechan appli base dataset infer mechan appli connectionist knowledg correspond dataset creat techniqu gallant comparison made term number input system order draw suggest number visit kind comput draw dataset knowledg base gallant dataset incomplet consist input data pattern dataset machin learn ftp repositori involv fit contact dataset complet input pattern consist input output attribut input attribut ag patient prescript product rate target attribut valu denot patient fit hard contact soft contact fit contact knowledg base form multilevel network construct method gallant data set tabl depict result valu variabl call acut type knowledg base comparison show infer engin perform slightli system number concern visit concern small knowledg import larg knowledg base tabl kb enc eval eval acut tabl explan rule produc system infer intermedi variabl construct knowledg base rule produc natur exist meaningless intermedi number explan rule make difficult comprehend tabl treatment ua treatment ub true true treatment treatment treatment true treatment treatment treatment treatment ua true treatment treatment ub true treatment present modular hybrid expert system call knowledg base consist type hybrid rule integr symbol rule neurocomput attract featur compar connectionist approach retain modular natur symbol rule system knowledg base construct convert exist symbol rule directli empir data form train exampl part system infer mechan draw base fact explan mechan justifi reach result base dataset shown improv perform infer engin compar system explan produc explan mechan natur produc system comput issu user concern explan rule present refer si connectionist expert commun si neural network learn expert mit press recenc infer engin connectionist knowledg appli integr symbol rule advanc world scientif improv perform symbol rule intern journal ai tool construct modular hybrid knowledg base expert system intern journal ai tool hybrid neural network expert kluwer academ boston theorem prover journal autom implement expert system rule condit neural network gener pp replac pattern matcher expert system neural network intellig hybrid john wilei son
IR/1308 5 approach relat web commun bipartit graph reddi institut industri tokyo japan abstract web harbor larg number commun structur earli detect commun structur reliabl search select paper investig problem extract relat web commun structur larg collect perform analysi algorithm extract potenti commun signatur extract bipartit graph structur data set web page algorithm relat extract commun signatur report result conduct gb trec retriev data collect million page million link result demonstr approach extract commun signatur relat index term commun link web data bipartit graph introduct internet rapidli grown integr element infrastructur societi power social aspect web abil connect group peopl independ geographi time zone web peopl join commun globe provid opportun form associ peopl web limit interest web dramat number commun bond past time part neighborhood commun social organ web vast opportun form connect entir world commun form import activ web web thousand explicitli defin commun group individu user share common interest commun manifest resourc collect directori yahoo home page paper focu problem find relat commun data set commun includ emerg commun manifest list yahoo search engin emerg commun potenti commun futur find commun earli serv commun provid valuabl possibl reliabl resourc user interest repres sociolog web enabl peopl exist target select commun form member govern engag commun meet object commun enabl peopl meet gossip wai context commun group content creator manifest set interlink page abstract commun set page form bipartit graph algorithm extract commun extract potenti dbg structur data set approach relat extract commun group commun relat common interest topic relat commun structur extract extract dbg structur extract commun extend approach higher build hierarchi commun data set report result gb trec retriev data collect million page million link result demonstr approach extract commun relat commun pattern rest paper organ review relat research section discuss abstract commun bipartit graph section explain present commun extract algorithm section report result conduct trec data section consist summari futur research relat work review approach literatur relat data mine link analysi commun detect data mine link analysi data mine approach larg find associ rule statist correl measur data set notion find commun approach differ data mine exploit data mine perform base support confid earlier link structur found analysi social network network properti diamet analyz collect properti interact agent field citat analysi bibliometr citat link work literatur identifi pattern collect search engin perform link text analysi qualiti search result base link analysi research scheme find relat inform web paper extend concept cocit web environ extract commun larg collect web page commun relat research commun analyz found base topic suppli user analyz link topolog hit topic algorithm hit wide algorithm search engin find authorit resourc web exploit connect inform web page intuit hit algorithm document document point good author document point good hub document point good hub similarli document good author hub hit algorithm repeatedli updat author hub score document high author score expect relev document high hub score expect link relev content paper commun defin core central page link page motiv hit algorithm find good author page collect page topic motiv detect potenti commun larger collect page cover wide varieti topic ravi kumar al trawl method find potenti commun abstract core commun group page form complet bipartit graph node link edg bipartit graph group node edg group larg collect trawl algorithm extract potenti find core potenti commun commun core extract trawl approach small group page form commun detect trawl algorithm base assumpt web commun call core commun larg collect trawl algorithm extract commun core extract potenti paper relax criteria exist commun defin dbg structur dbg abstract extend relat extract commun set crawl page problem detect commun abstract maximum flow cut sourc member sink consist set page commun defin set web page link page commun page commun flow base approach guid crawl relat page approach find relat page seed page present special hit algorithm exploit link weight order link page companion build subgraph web extract author hub graph hit author return relat page companion algorithm extend find relat commun exploit deriv relationship page approach differ approach dbg abstract extract relat web commun bipartit graph commun explain terminolog paper web page denot integ page refer denot node bipartit graph refer page interchang page page parent child page page consid edg node bg page set parent page set children page bipartit graph give definit bipartit graph definit bipartit graph bipartit graph graph partit set direct edg bg join node node paper extract commun perform analysi link inform ignor text inform paper investig link inform extract commun inform part futur investig approach extract commun text link web page repres bg ignor link page bg denot children commun consist member similar web commun repres consist commun identifi identifi member note bg edg exist linkag set defin bipartit graph captur linkag set definit bipartit graph nonzero integ variabl number node node establish edg node node establish edg node defin complet bipartit graph edg node node definit complet bipartit graph ic tc figur observ linkag denot number node linkag figur show differ theorem data bipartit graph complet bipartit graph instanc dbg fix extract automat extract note includ pattern impli includ ic tc note extract dbg data set extract pattern exist paper commun set close page form dbg dbg set commun abstract higher level commun defin higher level commun term lower level commun extend commun hierarchi form data set describ notion commun hierarchi data set definit commun hierarchi variabl denot number level hierarchi data set commun denot nonzero integ denot level integ denot uniqu commun identifi level member web page member commun level note input set bg web input set bg commun level sake simplic term node web page commun node level member multipl commun level input level set node note web page treat node level defin base definit commun integ variabl repres threshold valu commun exist set node level dbg form commun pattern select potenti dbg pattern fix threshold valu valu fix examin potenti correspond real commun pattern discuss commun collect page form linkag pattern equal dbg definit base web commun dbg web person creat creat page put link page interest isol put link displai multipl page creat similar common interest intuit phenomena captur dbg abstract commun phenomena captur abstract extract small set potenti member common interest find larg commun abstract put link page arbitrari manner rare put link page interest domain larg collect commun exist page form size web easi crawl larg collect web page collect larg collect page time consum process effect crawl recommend cover web page topic larg collect commun format reflect core data set potenti page form member commun share interest member compar abstract commun pattern dbg match real commun pattern gener commun view creat complex relationship exhibit member member establish relationship member commun integr member relationship exhibit commun phenomena context dbg abstract enabl extract commun integr relationship note approach base dbg extend find higher level commun lower level commun interest extend bottom build hierarchi commun data set set node associ inform dbg abstract extract commun set node approach creator link page reason put link page direct relev promot target page index pointer paper exist link page page displai interest page web web page group base type relationship defin page inform retriev document search base notion syntact relationship measur base exist number common keyword defin type relationship web page investig effici experi web environ research defin type relationship group web page exist number path web page exampl relationship paper investig find commun base relationship relax version relationship discuss relationship search relat inform web explain present algorithm note explain cocit relationship web page relationship extend node type cocit field citat analysi bibliometr citat link work literatur identifi pattern collect bibliograph coupl fundament measur similar document measur number citat common measur number document cite document inform retriev relationship document establish keyword exist document web environ consid link displai interest target deal link establish associ page base exist common children establish associ page number common children call relationship bibliograph term document refer collect common cocit formal defin relationship context web environ figur depict cocit relationship page definit cocit page repres nonzero integ relax cocit set page exist set common children defin establish relationship form associ multipl document page data set relat common link equal page relat page common children equal group page relat page form extract retriev collect page relat relax relationship find relat page manner page group true modif enabl relationship page multipl page note document relat cite group document group document cite commun extract algorithm base relax form cocit page form associ page impli page fail satisfi minimum criteria satisfi minimum criteria multipl page defin figur depict definit relax cocit set page page page nonzero integ variabl children page observ page compar relationship probabl associ larger figur depict relationship web page equal note gather page semant start page collect reason number page emploi effect prune method extract dbg pattern prune page algorithm present commun extract algorithm extract commun structur larg collect node note algorithm appli extract commun level commun hierarchi data set notat denot node level web page node level level input consist set bg data set higher input consist larg set bg level commun input larg number node level output dbg level commun extract larg collect algorithm extract dbg structur consist gather relat node extract dbg gather relat node gather phase relationship appli iter prune techniqu extract routin gather relat page step find set integ variabl set variabl set maximum number iter set find ii output dbg extract step input set produc step output bipartit set element parent child set select valu insert edg converg step repeat sort base sourc remov element sourc node type ii sort base destin remov element destin node type result repres set member commun experi result section explain trec data preprocess report experi result conduct trec data descript report result conduct gb trec retriev confer data collect million web page reproduc text web page explain properti data collect web track base snapshot world wide search techniqu reliabl evalu repeat experi conduct web comput develop web document base gigabyt crawl world wide web internet archiv earli larg collect consist web data crawl minim reformat dataset larg web task newest collect subset collect develop main web task properti hope make suitabl conduct kind web retriev includ involv method distribut inform retriev method preprocess prepar page link form prepar step detail extract elimin duplic remov popular unpopular page page text format html mark inform extract link ignor text inform creat entir page collect manner emploi bit fingerprint function gener fingerprint url page convert set edg form sourc sourc repres titl url destin repres url page total number page edg million million remov duplic page duplic common sequenc link emploi algorithm remov duplic select window size link page consid page duplic common found number page duplic duplic total number edg million remov edg deriv extrem popular unpopular page popular page highli refer web unpopular page refer consid page popular parent adopt threshold consid page unpopular parent sort base page number parent greater fifti remov remov page child contribut commun find sort base link number children remov step perform repetit number edg converg fix step number page edg million million retriev parent children page commun extract commun extract result report result gather phase discuss commun extract approach show exampl real commun pattern extract approach trec data collect gather observ number iter page found relat aim find extract commun restrict number iter extract figur show number pattern page constitut total number page constitut million column averag number page includ duplic node set member commun figur graph averag page figur commun environ commun exampl provid potenti commun exampl extract trec data collect set repres potenti member commun topic set repres potenti children commun graph repres member children member common child figur show graph comedi extract member web link busi york comedi member environ extract member saul law link resourc member extract member phone link member relat commun extract commun commun remov duplic extract relat commun set approach show exampl relat commun structur commun structur medicin health inform consum law medic wwww consum law medic relat link john www health fire public health fire emerg servic health council member web top tional specialti societi health resourc onlin hospit commun structur comput compani comput manufactur concord game comput game adapt multimedia multimedia technic support adapt manufactur web resourc comput hardwar technic support web vendor compani jump bookmark plug consortium hot link virtual world summari paper simpl effici approach extract relat commun signatur larg collect web page perform analysi commun signatur mathemat abstract dbg set page algorithm gather relat page base relationship iter prune techniqu extract potenti dbg structur algorithm time find commun relat commun linearli number page data set copi algorithm oper parallel part futur work investig issu observ commun signatur perform experi number node dbg extract commun conduct experi higher level build commun hierarchi data set addit link perform experi includ kei word method hope extract potenti commun data set commun macro phenomena creat complex relationship exhibit member micro member establish relationship member commun integr member interest exhibit commun phenomena dbg abstract enabl detect potenti commun signatur data set integr relationship acknowledg work support program japan societi promot japan refer fast algorithm mine associ proc andrei ravi prabhakar sridhar andrew janet graph structur experi proc andrei steven mark syntact cluster proc improv algorithm topic distil proc jeffrei monica find relat page world wide web proc bill speed warner anatomi larg scale hypertextu web search proc april pp web search visual web connect www pp april automat resourc compil analyz structur proc pp mark world wide web traffic evid proc acm pp ellen spertu mine structur inform web proc pp april steve effici identif web proc acm august cocit analysi tool journal infer web commun link proc acm confer hypertext pp bibliograph coupl scientif paper american authorit sourc hyper link proc symposium discret loren terveen hill evalu emerg collabor web proc acm confer comput support cooper social filter social pp ravi prabhakar sridhar andrew trawl web emerg proc john scott social network analysi handbook sage hg scientif measur relationship document journal american societi inform creat web commun chart navig relat acm hypertext text retriev evalu howard griffith author literatur measur intellectu structur journal american societi inform kw annual review inform scienc pp
IR/1309 5 discoveri similar comput search engin abstract typic situat practic interest determin similar text document queri due search engin global search construct top group local search retriev set local document global similar organ compar retriev perform search engin function wide similar function search engin determin similar comput search engin set weight term case techniqu present discov mathemat express formula valu constant similar function preliminari result experi webcrawl search engin illustr techniqu introduct document interest found sourc physicist interest latest technic report topic physic research laboratori countri approach facilit retriev inform scatter distribut sourc approach construct global search metasearch top group local search engin local search engin underli global search engin autonom respect similar document assign local search engin document determin global search engin document consid similar global preliminari version paper poster paper confer search engin low similar local search engin retriev user obtain document similar queri problem retriev similar document local sourc receiv interest recent approach problem requir global search engin comput document similar queri underli local search engin global search engin collect search result local search decid combin singl rank collect fusion problem difficult problem local document similar local search engin compar shown comput document similar local search engin merg search result reason interest discov comput document similar search engin determin organ collect set queri assess relev document queri interest obtain benchmark search engin web collect document base relev collect web collect trec collect document collect unit state nation institut standard technolog organ find similar document queri comput search determin perform search engin collect respect set compar retriev effect search engin collect document comput similar document queri text retriev confer initi unit state nation institut standard technolog sum product term weight queri document number similar function commonli includ wellknown cosin function simpli function weight term comput specif manner present base assumpt similar function similar document queri comput local search engin determin discov search engin determin weight term document queri text numer wai set weight term intranet formula comput term weight organ internet weight term retriev function search engin search engin inform method determin weight assign term search engin contribut paper consist ffl provid techniqu find form ffl provid techniqu determin constant formula comput weight ffl provid result illustr techniqu util similar comput webcrawl search engin recent paper problem discov languag model text address languag model describ word index term occur frequenc inform indic term occur method present sampl approach shown select servic search learn languag model sampl content process run carefulli select queri retriev document problem address paper determin search engin assign similar document respect queri techniqu develop discov formula rest paper structur section describ factor affect weight term common scheme section strategi determin constant formula comput weight term strategi assum system rank inform document similar valu retriev document section show mathemat express comput term weight compon deriv result probe queri result present section appli techniqu webcrawl search engin find weight term assign queri document preliminari data suppli confirm discov weight accur obtain averag accuraci applic accuraci requir conclud remark section formula weight term comput varieti gener influenc term term frequenc term number occurr term compon due term frequenc determin express involv constant valu tailor engin call term frequenc compon term frequenc weight term document document frequenc term number document index search engin document frequenc method assign call document frequenc term defin log df number document index search engin df document frequenc term variat idf definit uncommon frequent involv adjust constant document length longer document term term higher term frequenc mean document retriev favor long document document term weight frequent normal divid factor involv ment length document length normal factor involv constant note queri term weight comput queri length normal factor queri length normal factor queri term factor respect rel rank document unchang queri term weight queri length normal factor discuss discoveri constant queri length normal factor term frequenc weight term queri unknown constant term frequenc weight term document unknown constant idf weight term involv unknown constant document length normal factor make unknown constant denot term frequenc weight term queri term frequenc weight idf weight idf document length normal factor fk fa fb fc give exampl term frequenc weight formula exampl formula term weight compon found term frequenc weight term queri tf tf tf term frequenc term constant awar system formula discov formula webcrawl term frequenc weight term tf max tf tf avg dl log tf log max tf term frequenc term document max maximum frequenc term total number occurr term document avg dl averag number term document constant assum express idf properti properti queri strictli function tf term frequenc term term tf tf document strictli function tf term frequenc idf strictli function df document frequenc term monoton properti reason satisfi idf express simpli term frequenc term strictli higher term frequenc weight easili verifi exampl term frequenc weight satisfi monoton properti reason assumpt make queri term independ properti properti term queri queri term queri term frequenc weight term frequenc queri term frequenc weight term independ term frequenc queri term present properti ii essenti term depend term frequenc tf term unaffect occurr term easili check exampl queri term frequenc weight properti jqj queri length normal factor queri common term weight scheme make document frequenc weight scheme idf weight incorpor document term weight weight term document determin weight term queri comput jqj scheme idf weight incorpor queri term weight weight term queri determin idf weight term document comput term weight scheme wellknown wide make demonstr constant formula discov denot similar document queri numer similar function commonli similar function essenti function assum function comput similar document queri dot product dot product function standard cosin function document length normal factor euclidean norm queri length normal euclidean norm determin unknown constant term weight formula previou formula term weight idf adjust constant discuss find constant mathemat express formula user submit queri search retriev document rank order similar valu present user search engin similar retriev readili form equat involv unknown suffici number equat unknown constant solv analyt numer document similar transform similar unknown function similar document queri similar document queri relat form equat involv unknown constant task describ subsect rank order retriev document assum document frequenc term number document term document frequenc search engin number document index search engin obtain note search engin internet provid document frequenc inform user alta vista give document frequenc term retriev result form number hit term queri set equat unknown constant discuss similar retriev document difficult form equat constant term weight formula rank order document show overcom section kei step procedur discov constant construct queri similar document form equat relat similar sketch kei step denot queri involv term singl occurr tf denot queri involv term multipl occurr queri term queri queri length normal factor denot jqj document retriev queri rank document higher queri lower queri clear similar similar higher note scheme previou jq jq obtain idf queri term frequenc tf note term frequenc weight term function term frequenc term queri queri denot queri term frequenc weight properti monoton strictli function similar document jq equal jq equal jq note mean reduc queri term frequenc rel rel monoton rel set valu equal clear rel depend ratio queri term frequenc weight formula queri term frequenc depend ratio queri term frequenc ratio queri term frequenc equal fl develop algorithm adj determin fl accuraci idea algorithm essenti binari search ratio queri term frequenc document higher rank retriev result similar ratio document lower rank retriev result rel monoton ratio queri term frequenc ratio fl lie find set valu ratio averag resubmit observ rel rank order retriev result higher replac replac process repeat gap ratio posit number ffl note numer denomin larg practic set queri term frequenc equal set smaller number ratio close note ratio denomin ratio ratio queri weight time submit search set queri term frequenc ratio queri determin ratio fl fl fl continu fl problem ratio denomin solv order queri term frequenc ratio order subsequ comput find seek find algorithm adj wt queri term document retriev result queri assum rank higher queri lower term frequenc algorithm adj queri term frequenc rank lower retriev result ratio queri term frequenc queri term frequenc queri term frequenc set resubmit occurr occurr retriev result higher rank set comput set continu queri algorithm adj return valu queri term frequenc set queri term treat equal form equat unknown constant equat solv set constant provid systemat procedur facilit solut unknown constant case unknown discov section deriv term weight formula formula determin term weight compon theoret infinit retriev result probe deriv approxim term weight compon mathemat formula rule group mathemat express formula illustr idea show queri term frequenc weight formula space techniqu deriv formula term weight compon queri instanc term denot fn denot queri term frequenc equal tf simpl test perform ffl determin rank retriev document queri term frequenc term queri constant multipl check retriev result queri fn fn ident posit constant set document retriev rank document chang queri queri term independ assumpt formula weight term queri constant form shown term frequenc properti queri term frequenc weight independ term frequenc term present give deriv formula studi rank document vari term frequenc term determin queri term frequenc weight form tf constant find term equal document find document term frequenc rank document higher retriev result queri lower retriev result fix term frequenc term queri constant find pair queri term frequenc respect queri similar document step pair obtain set term frequenc adjust term frequenc method similar binari search similar manner adj queri term frequenc weight term queri depend tf term queri denot formula queri term frequenc weight queri term tf similar queri jq jq queri length normal factor document frequenc properti idf weight note term frequenc weight result equat similar rearrang obtain ff fi ff idf fi idf clear ff fi constant sum constant valuabl inform deriv formula queri term frequenc examin pair valu sum infer formula term frequenc weight term linear function term frequenc term queri origin formula tf constant form shown studi pair valu valu linear relationship sum product conclud queri term frequenc weight linear function constant constant function linear function verifi repeat step obtain set pair data pair document set term result techniqu present section base assumpt express search engin compon determin weight term previou demonstr infer mathemat express formula result probe queri appli techniqu similar comput webcrawl search engin aim discov webcrawl search engin assign weight queri term term articl page articl experi predominantli text comparison web simpler retriev list webcrawl relev rate articl retriev relev rate term weight estim adj set number occurr term queri document approxim similar relev rate gaug close similar document relev rate document conclud similar queri suffici document rank rel higher singl term queri lower algorithm adj adjust term frequenc similar equal determin valu accuraci interfac webcrawl search engin accept queri number occurr term queri larg valu obtain accur webcrawl search modifi algorithm adj continu long submit queri accept search engin describ formula webcrawl determin queri term frequenc weight queri term discov submit collect queri term queri term frequenc constant multipl term frequenc queri queri collect observ retriev result queri ident rank order relev rate queri observ phenomenon similar collect queri queri conclud properti ii term independ formula queri term frequenc weight form constant term frequenc term queri discuss previou determin mathemat express perform previou lead format set equal primari concern find pair term frequenc pair term frequenc pair term pair verif obtain ff fi ff fi note queri term frequenc weight queri term term frequenc equal tf determin comput obtain formula queri term weight frequenc determin found formula consist data collect formula estim term weight compon ffl document term frequenc weight number occurr term titl fm number occurr main text document ffl document frequenc weight idf log df df document frequenc term ffl document length normal factor euclidean norm formula test accur estim term weight formula approxim actual term weight formula submit set queri search engin queri includ queri queri document retriev search engin download comput similar formula obtain experi rank document order similar user interest top compar document retriev search engin document estim document similar tabl show retriev result obtain submit queri row queri number fourth entri column mean top document rank similar comput estim term found top document return webcrawl consist occurr term occurr term number tabl interpret similarli annot term number occurr term queri tabl sampl queri retriev result queri voter celebr presid citi busi season economi inflat find top document predict comput includ top document retriev webcrawl search engin percentag top document predict tabl detail result show averag percentag queri number queri term number column mean averag percentag row comput queri distinct queri number entri column queri queri top document comput includ averag top document return webcrawl tabl result accuraci attain predict reason web page articl text inform form text left margin articl retriev kind inform effect document length normal factor affect normal factor reason document length normal factor document involv weight term document note procedur determin term affect set term document oper system consid term term set term determin program set term determin webcrawl affect occur frequent document articl depend date document post factor conclud remark provid techniqu find form formula search engin provid strategi determin unknown constant formula make rank order retriev document techniqu strategi develop assumpt similar function determin feasibl chose search engin webcrawl experi formula found consist data term frequenc weight term time queri term frequenc weight term document fm occurr main text occurr log df document frequenc weight term search engin euclidean norm term weight document length normal factor test accuraci formula submit queri webcrawl search engin download document comput similar estim formula found top document predict includ top document retriev webcrawl search engin percentag top document data show estim good reason accuraci attain reason inform document relat similar comput kind inform account reason document pictur comput consid text inform document factor includ procedur determin hyperlink document date document post accuraci predict work improv estim techniqu factor refer baumgarten probabilist model distribut inform acm sigir jp wb croft dw retriev rout inqueri text retriev confer nist special public april sixth text retriev confer allan retriev local inform dk text retriev confer nist special public bruce croft document retriev inform research bruce croft harper probabilist model inform retriev relev journal connel du discoveri languag model text acm jame bruce croft distribut collect infer acm sigir ea boolean vector space model inform retriev queri multipl concept cornel frake data structur algorithm prentic gravano gloss broker gravano rank heterogen internet grossman frieder algorithm kluwer academ kl kwok network approach probabilist inform acm transact inform kl yu rish similar comput technic depart illinoi kl chang rish text search internet kl wu rish search intern confer data engin march yu kl liu heterogen multipl text moffat zobel retriev larg document text retriev confer salton mcgill modern inform salton bucklei approach automat text inform process mitra document length acm sigir gupta collect fusion strategi inform intl conf machin gupta collect fusion text retriev confer gupta collect fusion acm sigir wong yao model inform retriev probabilist acm transact inform yu meng queri process advanc morgan san
Agents/1310 1 actor develop environ paul nanci reed technic system laboratori depart comput inform scienc sweden octob abstract interact simul desir intellig actor plai role human draw wide rang previou work paper present system intend reduc diculti involv develop actor present system call actor speci cation tool method support end user develop intellig actor tool support develop process design test actor architectur system process contract make negoti agent determin action actor introduct interact simul highli desir intellig actor plai role human actor task dicult action exibl intellig design intent send command back actor reason complex account varieti factor includ current varieti potenti con ict team previou resourc constraint tamb order simul actor actor act manner knowledg actor act expert knowledg desir domain actor actor behavior plethora recent work result architectur actor wide rang abil case actor architectur dicult support adhoc develop process provid support virtual architectur domain expert directli actor behavior turn lead frustrat develop process jen desir improv process creat intellig actor draw wide rang previou work paper present system intend reduc diculti involv develop complex actor call actor speci cation group tool methodolog develop intellig actor system support stage develop design test system intend repres rst step put actor develop capabl hand domain expert provid structur support rapid develop process access actor basi end user develop overview actor speci cation consist hierarchi agent agent aspect actor behavior figur agent account speci task fairli simpl agent hierarchi agent perform part behavior runtim actor speci cation turn system actor behavior determin continu process contract make negoti agent agent form hierarchi contract agent bottom hierarchi negoti actual output actor top actor architectur enforc methodolog actor develop cover stage design tool support implement task complet graphic achiev tool design make simpl primarili enforc strict modular make process test quick integr tool support exist quickli inspect debug actor runtim develop aid system combin underli power agent runtim engin inexperienc user creat actor complex simul environ target domain initi target domain system simul aircraft pilot simul develop train human pilot test system domain actor behavior test system train pilot desir engin pilot trainer simul de ne behavior pilot actor peopl educ accustom comput necessarili expert scenario involv similar desir easili part exist speci cation pilot actor intellig act realist complex environ actuat aircraft extrem complex freedom tamb relat work recent lot interest develop methodolog agent exampl includ methodolog belief desir intent agent kinni georg behavior base agent distribut system safeti critic system gener method rang agent orient system wooldridg develop includ substanti graphic exist build actor agent varieti domain bond system collabor network agent agent base commun infrastructur cost zeu distribut agent nwana icon model tool mobil agent robot tool suit creat complex actor simul environ system exist develop actor interact simul design user limit comput develop fairli complex actor greatli restrict type act design inexperienc user develop intellig actor smith restrict behavior type environ ts nich system mention structur develop methodolog improv process build actor contrast methodolog emphasi process build system quickli easili intend actor program expert abil compar mean user experienc user wai attempt meet goal simul actor develop robot program make section function system control actor explain section develop process multiag system manag engin fly waypoint fly waypoint fly home avoid ground avoid aircraft contract figur part actor speci cation simpl pilot patrol actor main type refer manag system actor agent arrang hierarch forest tree engin leaf node bottom node manag connect node form contract manag type agent charg abstract task achiev task manag agent contract engin ful ll speci part task manag contract agent time break exist contract make contract time manag agent patrol mission manag contract sequenc agent ying patrol waypoint land aircraft contract form connect manag agent system contract form agent strict hierarchi design time design contract manag make handl servic broker negoti agent agent contract request manag fact implement level agent creat speci calli servic contract reason agent unabl ful ll temporarili inform manag contract contract manag report failur manag contract design agent start runtim speci ed agent agent contract agent runtim gener start agent form top hierarchi agent turn control actor special type manag call list type thing environ instanc type actor list manag contract agent assign speci instanc list manag avoid contract speci agent avoid obstacl contract agent concern speci obstacl assign main type agent manag engin engin bottom agent hierarchi engin agent negoti engin agent output command actor send environ engin output valu ful ll task contract achiev freedom actor simul pilot factori aircraft head speed complex negoti actor behavior split number simpler negoti factori continu suggest output valu engin regist interest output interest engin respond satisfact suggest output regular interv factori send environ output accept interest engin factori head aircraft interest engin engin avoid aircraft waypoint figur avoid engin sati ed head suggest lead avoid sati ed head result comfort avoid aircraft waypoint agent sati ed head result gener head waypoint result head directli waypoint factori head sati es engin process negoti continu environ chang negoti proce engin prefer di erent output valu chang engin contract exist engin stop factori negoti simpli continu albeit set agent continu natur negoti mean anytim algorithm suitabl actor negoti mechan multipl high level task attend simultan design explicitli consid interact task high level simpli contract agent perform piec task bottom subsequ hierarchi engin di erent task fly waypoint avoid ground avoid aircraft altitud head avoid aircraft avoid aircraft engin creat avoid aircraft dont output actor actuat agent negoti mission manag contract agent fly waypoint figur snapshot actor control negoti factori solut achiev manag task negoti process integr high level task design earlier question factori output sati es interest agent engin sati ed prioriti engin account prioriti agent function factor rst factor prioriti agent prioriti static base type task agent safeti critic ground avoid agent higher prioriti fuel conserv agent factor prioriti refer organiz prioriti organiz prioriti de ned role agent system fuel conserv agent high organiz prioriti contract manag leav hazard territori nal factor agent prioriti refer prioriti prioriti dynam vari signi canc agent current circumst fuel conserv agent high prioriti remain fuel low aircraft base signi agent prioriti manag prioriti organiz mean higher prioriti manag low level higher prioriti manag engin lower hierarchi high organiz prioriti negoti actor develop support develop design test develop stage explicitli support tool stage develop methodolog advoc section develop process explain detail emphasi tool support provid agent assign agent task test agent readi specif task forest agent feedback figur actor develop process develop actor figur begin design tree task behavior describ behavior actor continu aspect actor ground mix freeli time bound aspect actor ying waypoint design consist singl tree forest tree top tree repres high level abstract behavior actor tree speci aspect actor behavior figur time sequenc inform simpli breakdown function piec stage develop assign agent node task forest agent perform task assign node leaf node assign engin intern manag branch node replac contract speci cation intern behavior agent enforc sequenc task assign agent node step exist librari agent consult agent reusabl agent creat similar scenario case agent found match node behavior forest agent hierarchi found node branch agent import tune requir adjust prioriti import agent speci cation amount tune minim requir top import agent hierarchi agent found exist librari creat core system agent speci cation tool figur agent design speci es prioriti state machin control behavior contract factori assign agent agent describ intend function agent design agent manag engin prioriti set slider ect design assess import function agent consid isol prioriti function de ned function speci cation system function map actor sensor read valu repres import agent sensor read indic proxim ground map high valu agent ground avoid state machin agent mechan make individu agent de ned state machin make mechan current speci cation system import aspect state machin standard singl level moor state transit condit de ned function speci cation system agent state state machin engin assign negoti speci factori function speci cation system de ne function engin figur agent speci cation subsystem determin accept factori suggest agent state design speci es contract manag make state contract consist select agent contract instanti paramet contract agent waypoint actor partial fulli speci ed test target simul environ order support iter process test increment expand improv actor behavior number graphic interfac displai interact statu agent reason system main test interfac show activ agent current statu interfac design agent creat agent react environ desir creat contract argu reason output valu problem state transit wrong time wrong contract enter observ tool design return agent speci cation system make problem observ behavior actor correct agent activ correct design tool view statu negoti figur tool view output factori satisfact interest engin factori suggest design observ due overli high prioriti negoti back speci cation prioriti agent agent contract lower prioriti function agent agent contract chang altern observ agent calcul incorrect valu investig design pop window snapshot detail function calcul displai design problem return function speci cation system rectifi problem cycl speci cation test repeat requir actor behavior achiev nal stage develop process make newli creat speci cation requir actor speci cation part current speci cation complet black box fashion function speci cation function speci cation system design di erent function agent figur requir function speci cation system potenti extrem complex function speci activ function avoid enemi aircraft agent account wide rang factor rel posit requir programm time encourag function speci cation system base negoti vertic axi show level satisfact agent shown agent head valu region avoid agent unsatisfi head region sampl negoti point horizont axi vari head figur negoti debugg show current statu negoti idea spreadsheet spreadsheet paradigm chosen success develop complex function spreadsheet program function speci cation system convent spreadsheet cell laid tree featur convent importantli cell cell function turn function agent function agent lead high level reduc speci cation size major di erenc spreadsheet valu function enter text creat select option list remov possibl speci cation error due syntax type problem figur function speci cation subsystem discuss seri famou paper brook argu strongli domin wai ai build intellig system monolith system incap interact real world brook advoc approach behavior situat actor broken horizont smaller piec behavior argu actor built creat simpl behavior increment exist behavior complex behavior brook idea extrem intuit breakdown actor behavior low risk increment develop process immedi user build domain paradigm potenti er term actor speci cation match intuit breakdown actor task subsumpt system deliv kei reason subtl interact individu behavior mean complex ad behavior actor overwhelm recent varieti di erent approach reduc complex interact provid method develop handl complex method organ behavior di blumberg combin output behavior di erent yen actor architectur trend step behavior system agent elev behavior statu agent interact behavior simplifi complex system simpli es interact subsystem agent behavior make behavior passiv entiti interact agent strictli contract easili understood drastic reduc complex ect behavior due subtl interact reduct amount subtl interact behavior lead level actor complex design expect develop extens share properti system li reactiv end scale agent gener map sensor input contract negoti strategi agent potenti complex type plan reason behavior actor emerg result agent interact world potenti con ict requir usabl develop environ genuin actor impli underli actor architectur actor speci cation coupl speci cation runtim engin combin speci cation element power exibl manner aircraft point aircraft detect avoid aircraft waypoint waypoint control aircraft flight path aircraft figur result simul run characterist address usabl dicult build develop system user speci cation actor fairli close correspond speci cation runtim mechan close correspond constraint program imper program speci cation respect runtim reason assum actor architectur featur support develop abstract mechan kind speci cation problem design break problem manag piec coupl speci cation element desir featur program design reduc make readabl speci cation encourag power comput address problem creat genuin actor intuit exibl speci cation interpret runtim engin behavior observ speci cation size complex phenomena observ constraint imper program constraint runtim engin power imper lead smaller simpler constraint program actor runtim engin simpli rst applic rule list behavior larg speci cation fairli simpl end spectrum runtim engin speci supplement common reason previou experi invok sophist plan routin observ behavior actor fairli sophist runtim engin power actor architectur underli ful ll characterist hierarch structur individu agent coupl abstract desir runtim engin power reason system requir make actor figur show output simul run aircraft control notic aircraft smoothli integr waypoint avoid approach aircraft ight path reminisc obstacl avoid path behavior base robot simpl illustr multiag system produc reason behavior emerg behavior produc usefulli realist behavior work determin strength weak approach major aspect underli comput engin overli speci cation design exist system attempt improv modular previou experi develop agent suggest modular agent speci cation kei scale reduc improv testabl intend usag scenario make modular critic good modular provid desir rapid prototyp time librari agent built actor rapidli put part actor highli complex actor develop design complex system modular kei make speci cation manag novic librari agent develop rel novic piec agent order creat requir actor good develop process reason softwar develop process reli break problem develop actor di erent develop team good modular speci cation di erent develop work di erent part lead shorter develop time modular comput engin limit interact agent greater extent modular drive concern design develop system modular larg achiev ensur tool encourag break task piec idea speci agent leav room mix ying waypoint avoid obstacl complementari tool provid mechan intern agent exist agent hierarch relat futur work futur work intend push system hand domain expert realist target low level agent function creat agent expert piec domain expert time write begin test site simul expert futur work actor architectur includ experi di erent negoti includ method factori nding suggest protocol negoti function factori decid suggest present negoti occur level futur negoti manag integr multipl high level goal futur work speci cation system focu wai encourag design develop actor speci cation easili end develop cycl process identifi part speci cation exist agent exist agent identi ed improv acknowledg work support oper analysi swedish nation board industri technic develop grant center industri inform technolog grant refer militari aircraft user guid technic report technic militari edit blumberg bruce blumberg multilevel control autonom anim creatur virtual environ siggraph page acm press dan framework build collabor network agent technic report purdu kamel patrick thierri roger base architectur speci cation veri cation eleventh workshop knowledg acquisit model rodnei brook intellig reason intern joint confer page rodnei brook intellig arti cial intellig bryson agent architectur object orient design munindar fourth intern workshop agent architectur languag springer agent orient program manufactur control task intern confer page cost scott tim yanni yun ian agent develop annual confer autonom page benjamin ahm visual model agent base applic dec jen nichola katia michael wooldridg roadmap agent research develop autonom agent kinni georg david kinni michael georg model design multiag system intern workshop agent languag lectur note comput dougla mackenzi design methodolog con gurat mobil robot phd georgia institut nwana colli toolkit approach build distribut system annual confer autonom page nwana perspect softwar agent research engin lynn parker architectur fault toler cooper ieee transact robot paolo multipl object action select behavior fusion vote phd depart medic informat imag aalborg alexand tool build visual environ phd reactiv task execut mobil robot phd depart electr julio rosenblatt plan intellig autonom vehicl av symposium intellig autonom smith david allen jim appl appl comput softwar chapter program agent program languag aaai mit tamb rosenbloom constraint design choic build intellig pilot simul aircraft aaai spring symposium learn implement softwar architectur tamb milind lewi randolph frank john paul karl intellig agent interact simul environ ai spring wooldridg michael nichola david kinni methodolog analysi design annual confer autonom page michael nichola jen pitfal agent orient develop intern confer autonom yen john yen nathan fuzzi logic base extens rosenblatt command fusion method mobil robot navig ieee transact man zilberstein anytim algorithm intellig system ai
Agents/1311 1 model juan mit artifici intellig laboratori technolog massachusett abstract paper present comput approach model import aspect emot process integr model motor control emphasi mechan emot build block acquisit emot memori serv signal process make select action successfulli approach develop control autonom includ synthet agent physic robot introduct theori human reason fall posit argu make similar solv problem formal logic face form list option logic perform analysi provid choic view consid reason associ confront situat requir compar similar situat encount tend act review theori al motiv find studi patient lesion damasio colleagu recent framework understand human reason al al interest compon view reason depend emot process result involv imag relat state bodi contrast tradit cognit reason biolog inform bia steer process outcom base past experi similar situat al hypothesi mechan marker hypothesi hypothesi state made circumst similar previou outcom potenti potenti induc mark futur outcom import signal danger advantag neg marker link futur outcom serv alarm signal avoid action posit marker incent make choic find contrari popular intuit emot plai crucial role abil make ration field artifici intellig gener emot intuit guid reason interest model emot orient emot entertain blumberg elliot mae reilli specif model limit psycholog problem colbi recogn emot model physiolog hormon influenc emot kitano model influenc goal learn mae frijda pfeifer wright due space review relat work work relev present discuss mention overview includ list reader refer pfeifer fellow paper present approach studi emot inspir recent find reli comput framework call control autonom agent reli emot process model extens model previou work depict figur relev system repres modul perceptu system obtain inform world provid behavior emot system stimuli featur object system receiv error signal drive system emot system assess emot stimuli bia behavior futur percept relev behavior system gener execut motor action figur schemat framework emot control modular adopt figur exist sole illustr system exist singl modul connect singl consist distribut network independ process unit connect directli relev unit comput unit basic element framework correspond nonlinear comput unit repres relev system sensori emot drive motor system thought consist set mechan set output import compon mechan consist call correspond comput unit filter sensori data identifi special condit provid excitatori inhibitori input system innat learn kind repres stimuli tend predict occurr natur poss memori habitu stimuli model habitu similar gener form activ basic system nonlinear function input turn proport output strength equat activ system ki ki rang set system limit function standard ramp logist function drive system drive motiv system repres urg agent action hunger drive aid control behavior directli affect level food agent drive system differenti emot system emot system constitut main motiv agent drive system exploit power bia specif behavior error signal produc hunger distress motiv agent obtain food drive repres control system maintain control variabl rang variabl measur agent sensor compar desir set point match set error signal produc error signal fed combin error signal relev control system case mobil robot batteri power base actuat drive combin signal control control base batteri level control bodi batteri level activ drive system nonlinear combin control system equat emot system emot system repres famili relat affect panic member emot famili share mechan includ similar behavior physiolog pattern characterist differ emot distinguish draw idea theorist oatlei identifi creat explicit model emot select core set emot type base evid suggest includ distinct facial properti contrast model date cognit gener cognit emot kind tend aspect appli metaphor nonetheless relev physic agent synthet agent simul physic interact environ influenc world perceptu motor behavior emot system drive system system system system ki ki divid emot includ effect brain agent lead emot mediat condit includ sensorimotor facial bodi muscl action regul ongo emot experi elicit emot includ motiv lead emot motiv includ drive thirst emot pain regul exampl system includ innat tast produc measur studi davidson pain stimul emot sad elicit anger includ type cognit activ belief memori categori natur cognit learn previou cognit base cognit theori emot system includ cognit learn agent interact world main reason chang suitabl test theori cognit evalu emot comput model emot limit understand brain process emot primarili due fact model base cognit recollect emot experi concern neural mechan process activ emot system differ slightli gener form main differ includ excitatori inhibitori input emot tempor decai summar equat activ emot system time activ previou time function control tempor decai activ emot system ki ki rang set emot system li strength excitatori inhibitori input emot system activ time limit function standard ramp logist function fast primari emot model emot system distinct affect phenomena primari emot model natur emot system disgust fear primari emot plai essenti role prepar emot adapt agent fear emot fast primari emot detect danger situat gener maxim probabl surviv emot blend mix emot consensu basic emot research emot result blend mix basic fear gener joi fear produc mix higher order emot gener conceiv cognit oper concurr activ cognit affect system framework provid explicit model higher order blend emerg basic emot system emot system bia system perceptu behavior explain case behavior system emot memori secondari emot emot system capac acquir learn correspond stimuli tend predict natur activ emot system learn correspond refer research emot memori secondari emot damasio secondari emot occur start make orderli associ object primari emot requir complex includ retriev emot memori similar previou experi secondari emot plai adapt role deal situat occur escap find mate primari emot includ mechan detect potenti mate ensu mate secondari emot provid mean associ learn stimuli place potenti mate mechan inspir work ledoux emot memori model associ higher order emot previou emot blend mix emot ki ki li network compar minski salient stimuli percept repres object connect primari emot activ agent interact world emot connect network chang modifi hebbian rule prevent satur connect weight newli creat cognit activ emot system sum weight incom learn connect emot system multipl normal base exist excitatori inhibitori connect emot system figur illustr scenario emot memori form person interact robot pet disciplin robot natur joi fear emot fear emot system activ punish salienc present stimuli determin salient case presenc fear emot system learn figur emot memori learn abil act mechan process time agent encount mark person memori repres associ network reproduc emot occur influenc select action follow emot memori twofold learn secondari emot gener primari serv marker mechan influenc made agent behav mood perspect mood differenti emot term level emot consist high specif emot mood explain low level system consist enorm subtleti human mood common observ mood lower threshold emot occur emot system provid potenti activ emot consist observ durat mood longer low level intens emot system decai slowli model valu paramet decai emot system model lower activ threshold decai rate anger emot joi lower inhibitori gain anger joi behavior system damasio reason defin domain cognit agent respond situat al choic behavior repres drive system emot behavior system obtain filter sensori data order identifi special condit activ repres physic object specif recharg motiv state level activ behavior behavior system mutual inhibit excit inhibit run behavior excit earlier behavior system strategi behavior activ time made imposs walk cry execut time parallel behavior system behavior issu motor action simultan behavior comput equat behavior time nj nj weight rang behavior lj strength excitatori inhibitori input behavior system activ time joi anger sad disgust fear pet person punish nj nj lj implement result framework control previou section develop control synthet includ synthet virtual simul emot pet robot part ongo framework control emot pet robot shown figur sensori system includ color ccd camera part vision activ stereo audio system microphon mount ir sensor obstacl air pressur sensor model simpl touch percept form pain pleasur sensor align top camera detect temperatur due presenc simpl propriocept system figur emot pet robot drive system drive system control intern variabl repres agent interest emot system emot system natur set basic emot famili repres emot system interact drive unsatisfi drive produc distress distress lesser drive drive happi interact object happi pink elicit yellow object found environ dark blue activ fear emot loud interact peopl interact interact includ pet disciplin robot action gener pleasur pleasur pain anger behavior system robot behavior system distribut network approxim nineteen direct part satisfi interact human exampl behavior includ emot behavior emot condit model exhibit emot behavior circumst robot drive wander pink bone encount activ happi emot system specif activ time pass find activ distress emot system rise execut wander encount dark place elicit fear back direct regul gener emot behavior primari learn secondari emot store modifi cognit base associ network model fear emot system acquir loud sound classic scenario fear natur produc person disciplin gener fear sound stimulu produc activ fear emot behavior activ stimuli present fear emot system form cognit sound stimulu newli form loud sound capabl produc activ fear emot system connect sound fear emot system strong produc activ emot memori form locat pink bone approach robot interact person carri bone depend interact person pet disciplin creat posit neg emot memori respect futur select behavior approach avoid influenc result show emot condit mechan robot process present comput approach integr model behavior emot main motiv system influenc behavior select control wide rang affect phenomena includ fast primari emot emerg show emot condit creat secondari emot act mechan process make select action acknowledg support research provid part motor corpor work physic robot carri conjunct professor rodnei charl makoto yoshida refer rp comput simul cognit ed comput simul person wilei al approach reason al ed neurobiolog springerverlag role emot believ agent commun acm al decid advantag advantag strategi bad etholog lesson learn mit press lesson etholog mit press model motiv emot basi intellig behavior acm press km artifici pergamon descart human brain descart human brain argument basic emot ed basic lawrenc erlbaum cd affect process model emot system phd northwestern al human psycholog deduct lawrenc erlbaum facial sign emot asymmetri brain electr activ human newborn emot cambridg press review comput model emot psycholog emot plenum press system emot cognit process psycholog review basic folk theori ed basic lawrenc erlbaum model hormon modul learn montreal emot brain simon schuster mae artifici life meet lifelik autonom agent commun acm special issu applic ai minski societi mind simon schuster emot brain biolog psychiatri advanc biolog artifici intellig model emot ed cognit perspect emot kluwer affect comput mit press psycholog biologi emot reilli believ social emot agent technic school comput carnegi mellon habitu adapt mit press comput model gener emot influenc behavior autonom agent sm thesi mit model emot motiv synthet agent reinforc learn animat emot mit press
DB/1312 3 pergamon inform system vol pp copyright fl elsevi scienc print great britain reserv definit analysi index organ system bertino barbara catania luca dipartimento di scienz itali itali decemb final form januari abstract effici execut queri requir design specif index effici deal predic nest attribut class inherit hierarchi index techniqu classifi inherit index goal support queri inherit aggreg index deal effici evalu nest integr techniqu aim paper analyz techniqu provid integr path index respect tradit inherit analysi perform assum instanc null attribut present paper present consid techniqu extens path firstli defin deal attribut instanc null attribut valu analyt cost model extend version path index present cost model final cost model present compar index respect delet insert oper result show tradit techniqu perform respect delet insert integr techniqu lowest cost retriev copyright elsevi scienc kei effici queri data structur introduct data class organ type aggreg inherit relationship aggreg relationship class class domain attribut aggreg relationship definit result class aggreg hierarchi root encompass class term defin attribut class nest attribut inherit relationship class class defin subclass relationship impact queri languag orthogon dimens aggreg queri issu class predic nest attribut class predic refer nest predic evalu requir navig object perform implicit join object term implicit join fact join base object identifi inherit queri issu class includ instanc class member class set member class includ instanc instanc subclass dimens queri includ nest predic target subset class inherit hierarchi effici execut queri characterist requir turn design specif index techniqu index techniqu classifi inherit index aggreg index integr techniqu group includ techniqu support queri inherit hierarchi techniqu defin extens index base maintain singl index class recommend patrick oneil bertino al inherit hierarchi effici perform search rang page access effici process rang predic read page predic method combin advantag approach ramaswami al base extern dynam rang search techniqu group techniqu deal effici evalu nest predic techniqu base principl join index techniqu valduriez base precomput implicit join aggreg hierarchi main difficulti techniqu effici execut updat updat precomput join invalid recomput aggreg index techniqu classifi base maintain addit inform effici perform updat object modifi recomput join updat index object modifi object access recomput join updat index group techniqu integr support index aggreg inherit hierarchi techniqu investig depth goal paper analyz techniqu provid integr support techniqu extend version path firstli present techniqu index present import compar deal updat approach index maintain addit path index requir access object repres major approach updat handl techniqu compar complet tradit techniqu call simpli consist alloc index class inherit hierarchi perform sequenc implicit join call inherit differ index alloc inherit class extend version path index number major extens respect origin version support inherit hierarchi case attribut null valu algorithm extend deal case attribut major contribut paper definit analyt cost model path index substanti extend simpl cost model origin version path index main featur cost model fulli account object refer case attribut attribut null valu class inherit hierarchi account model distribut class inherit hierarchi consid analyt model develop paper easili extend model index techniqu object provid foundat research area import note implement path index attract extens variat notion access relat extend path index applic scope access structur similar path index implement part objectstor oodbm notion index path index techniqu object system scientif literatur incorpor commerci product definit analysi index organ system main contribut work summar present index techniqu queri aggreg inherit hierarchi extens path firstli defin deal inherit attribut null attribut develop analyt cost model extend version path main origin contribut paper cost model index found extend version paper includ complet cost model index techniqu extens comparison techniqu mention cost model remaind paper organ section introduc preliminari definit notion section describ techniqu present paper section present cost model extend version path index cost model techniqu omit due space constraint section insert cost techniqu compar section summar major paper outlin futur work preliminari definit notat refer rest summar assum object organ class class organ hierarchi sake assum hierarchi cycl class defin attribut superclass attribut defin domain domain primit integ attribut call simpl attribut distinguish instanc member class object instanc class special class object inherit hierarchi object member class instanc subclass instanc class member belong subclass attribut class attribut tree attribut object undefin assum default null figur show schema black arrow repres aggreg hierarchi white arrow repres inherit hierarchi exampl schema shown figur denot object identifi instanc class attribut highlight rectangl bold type figur schema present figur figur attribut valu relev discuss insert attribut valu class denot set includ subclass direct order navig path express commonli object base definit introduc main concept relat path express definit aggreg hierarchi path defin ffl class ffl attribut class bertino al book person author reader book reader boolean fig schema ffl attribut class domain attribut class ffl class call root path ffl repres length path equal number inherit hierarchi reach attribut ffl fc fc domain attribut class ng denot set class path ffl ffl class scope path posit defin subscript class root inherit hierarchi belong remaind notat identifi class inherit hierarchi denot class inherit hierarchi root class posit path denot class root inherit hierarchi posit path definit analysi index organ system anim farm fiction activ db system road fiction fiction inform system architectur angel fiction tom wallac graduat jame major teacher georg english jennif widom null american stefano ceri null italian jack american jame null william shakespear null null paul smith emploi john brown barbara catania phd null luca student fig instanc class present figur path schema repres figur scope reader book author bertino al definit introduc concept path instanti definit path complet instanti defin sequenc denot ffl member class ffl attribut object valu attribut partial instanti defin sequenc object ffl member class ffl attribut object valu attribut partial complet instanti path ffl call start object end object ffl denot project element ffl partial partial complet instanti exist refer partial complet instanti instanti note instanti instanc class posit path exampl complet instanti path respect instanc shown figur exampl partial instanti path exampl partial instanti definit introduc order path instanti order encod instanti index organ definit instanti path ffl member class ffl member class ffl object belong domain attribut definit analysi index organ system ffl object belong domain attribut path iff condit note object identifi implement integ compar relat defin order establish relat path lexicograph sequenc oid assum special null lower oid path defin path instanti path relationship hold path path path definit introduc concept predecessor successor insid path instanti definit path object instanc class scope path direct predecessor member class refer attribut predecessor member class refer nest attribut successor object member class attribut refer object object attribut respect path direct predecessor direct predecessor predecessor successor successor index organ present index techniqu describ data structur algorithm main introduc exampl bertino al index definit definit path path index defin set pair element belong domain attribut partial complet instanti og path index associ attribut instanti end definit path index defin set pair element belong domain attribut fo partial complet instanti index associ attribut oid instanc class scope attribut definit path defin fi nc singl index defin path nc denot number subclass root class singl index set pair element belong domain fo og attribut definit domain primit kei valu alloc class posit oid index kei valu object identifi call ident index index alloc class path subclass kei valu primit object number charact object identifi call equal index definit path inherit defin fi index defin path index organ associ attribut oid instanc class subclass inherit differ maintain singl index class belong inherit hierarchi techniqu requir number index equal path length schema figur instanc shown figur path index inherit defin path present figur definit analysi index organ system path index ffl ffl ffl index ffl ffl ffl ffl index subpath ffl index subpath ffl index subpath ffl index subpath ffl index subpath ffl subpath inherit ffl index alloc path correspond ffl index alloc subpath coincid ffl index alloc subpath correspond ffl index alloc subpath coincid fig exampl index organ path bertino al index data structur path index path defin path implement singl leaf node node format consist record structur tripl pointer physic address node order leaf node consist leaf node record assum size leaf node record greater page leaf node record kei leaf node record ffl record ffl kei ffl kei ffl number element list ffl list instanti end object member end class hold kei attribut instanti implement arrai length gener path instanti member instanti repres arrai cell special repres null cell oid class oid assum leaf node record size larger page instanti order directori begin record page occupi list store pair page path instanti instanti store page order relat maintain path instanti order path order introduc definit note list instanti leaf node record instanti start object member class instanti start object member class instanti start object member class final complet instanti figur show format leaf node record length kei length kei path record fig structur leaf node record occupi singl page path index record length kei length kei path record directori address address address address address address fig structur leaf node record size larger page size path index definit analysi index organ system track path instanti end object instanc attribut special leaf node denot record null kei structur leaf node record note path instanti store record partial complet instanti path pm path index alloc path shown figur leaf record kl american record node null null fig index content path index index implement index organ consist call primari auxiliari index format node primari index equal path index leaf node consist call primari record record ffl record ffl kei ffl kei ffl ffl class path number element list list structur list oid instanc class hold kei attribut attribut list pair compon oid instanc class hold kei attribut compon number successor hold kei attribut entri class path scope instanc kei attribut entri class identifi offset list oid primari record physic address auxiliari record inform direct predecessor instanc class store auxiliari record alloc root class path subclass auxiliari record sequenc tupl record length number tupl equal number instanc class format tupl auxiliari record class address address fp oid instanc class compon list pointer primari record kei nest attribut bertino al note object undefin list empti compon repres number list direct predecessor denot direct predecessor auxiliari record effici perform updat oid object remov primari check perform determin predecessor remov check list direct predecessor store auxiliari record check perform object member class path auxiliari record requir object expedit retriev tupl organ maintain auxiliari index oid import remark kei auxiliari oid object belong class posit path greater root class subclass auxiliari record organ consist index call primari alloc valu attribut associ belong domain set oid instanc al attribut class path scope call auxiliari index kei oid class instanc posit associ oid list direct predecessor object oid maintain connect primari record auxiliari primari record address leaf node record auxiliari primari index invert respect valu attribut retriev oper auxiliari invert respect oid instanc class root class path scope path auxiliari index determin primari record oid instanc store order effici perform delet insert oper figur illustr structur index content index alloc path present figur record length kei length kei record auxiliari record class record length list pointer primari record list pred offset class offset pointer auxiliari record pointer auxiliari record list pointer primari record auxiliari record class record length list pointer primari record list pred list pointer primari record list pred list pred fig primari record organ index definit analysi index organ system author reader book record node primari primari record auxiliari record class author auxiliari record class reader kl american rl rl node auxiliari pointer primari record kei pointer primari record kei fig index content index index nc implement leaf node consist record kei kei list oid identifi object class hold kei attribut inherit organ index inherit organ implement leaf node index consist record kei kei list nc list nc denot list list oid identifi instanc class hold kei attribut oper present exampl illustr insert oper implement organ exampl refer path instanc present figur bertino al retriev retriev oper form path retriev member class nc attribut satisfi condit instanc class call queri target call target class member root inherit hierarchi singl kei queri rang queri singl kei queri consist predic form han valuei rang queri consist singl predic type han op valuei op type show retriev member class kei american nest attribut introduc data present figur path index lookup path index execut kei american leaf node record complet instanti oid store element arrai extract retriev return result queri index lookup primari index execut order locat leaf node record american kei record search extract offset indic oid member class store offset class class locat offset return step execut evalu queri lookup index alloc subpath order fetch oid instanc class author american attribut nation oid return search author oid search index alloc subpath lookup result search oid search index alloc subpath book batch retriev oid note kei found index oid search index alloc batch lookup oid locat search oid return result queri inherit search perform approach similar techniqu number scan index lower class singl index maintain observ appli class book singl index alloc delet path index delet object step algorithm consist determin valu nest attribut nation consid object member class oper perform forward path begin approach perform lowest estim cost retriev american search batch lookup leaf node record locat previou search batch lookup simultan search kei forward path start instanc class path order class insid path instanc belong path approach process instanc time approach process consid instanc time approach reduc time access page definit analysi index organ system instanti element remov instanti remov leaf node record kei american instanti remov leaf node record kei italian algorithm end found null attribut nation object algorithm scan updat leaf node record null index remov object set valu attribut author determin access object sch set element search auxiliari index auxiliari tupl updat remov oid direct predecessor list auxiliari record tupl direct predecessor fetch address primari record read address primari record rec rec kei valu american auxiliari record delet primari record rec access offset relat class book reader extract portion rec oid class book access oid remov portion rec relat class reader access pair predecessor updat decrement field num succ note delet successor object american nest attribut nation primari record rec kei access offset relat class book reader address auxiliari record class reader extract oid remov primari record note remov delet object successor italian nest attribut nation tupl relat oid search auxiliari index oper carri address auxiliari record class reader batch lookup auxiliari size auxiliari record list address primari record access tupl remov address rec direct predecessor list consid record rec rec access offset relat class fetch reader oid immedi remov rec rec inherit remov object set valu attribut read book determin sch set oid search index alloc subpath book batch lookup leaf node record relat oid oid remov oid search index alloc consid organ index alloc consid organ inherit leaf node record locat search delet note search index alloc fail bertino al insert assum insert object execut mode object insert predecessor path index insert object valu attribut read book set object step execut forward path start object oper perform lowest cost set valu nest attribut nation element al set sp partial instanti end instanc class author al attribut gener situat sp sp set sp gener track instanti start end object undefin nest attribut nation sp batch lookup index execut order locat leaf node record valu leaf record kei redund instanti elimin instanti sp insert leaf node record kei instanti sp directli redund instanti present record address root access instanti redund respect instanti sp set instanti insert record index insert object successor object oid search auxiliari index batch lookup auxiliari record object object insert direct predecessor list address primari record tupl fetch primari record rec rec kei english author list gener order track number successor kei valu english american list consist pair rec rec primari record rec rec access access rec record scan order find offset class book pair insert rec offset extract similar procedur appli rec tupl compon list rec rec fourth empti list predecessor insert auxiliari index inherit insert object successor object object search index alloc batch lookup leaf node record oid insert list oid cost model path index organ present cost model path index introduc section assumpt paramet develop introduc cost model organ omit due space constraint refer reader detail descript cost model definit analysi index organ system assumpt simplifi develop cost model path make kei valu length valu attribut uniformli distribut instanc class attribut defin averag length kei equal size oid aggreg hierarchi cycl cardin inherit independ cardin subclass superclass relat number instanc class belong inherit hierarchi object belong domain attribut uniformli distribut class inherit hierarchi posit path distribut valu attribut class inherit hierarchi posit disjunct domain class belong inherit disjoint domain attribut class inherit hierarchi posit path paramet perform data organ influenc logic data characterist paramet index structur introduc logic data paramet deriv paramet relat characterist system index structur present tabl length size measur byte paramet descript length oid class identifi length oid class identifi length class identifi page size tabl system paramet paramet descript averag fanout node node root node root node rl size record length field kl averag length kei attribut size kei length field pp pointer length offset length num path size field number path instanti ol sum rl num path tabl index paramet order bertino al logic data paramet path paramet describ characterist class belong scope ffl nc number class inherit hierarchi class root ffl cardin domain attribut instanc class nc paramet interpret maximum number member class instanc class ffl cardin domain attribut member class paramet interpret maximum number member class member class assumpt distribut nc distribut ffl averag number instanc class belong domain attribut instanc class nc nc paramet defin averag number instanc class instanc class assumpt ffl number instanc class nc ffl nh number member class nh nc ffl fan averag number valu attribut instanc class attribut nc paramet interpret meaningfulli averag number member instanc class note paramet fan reduc ffl number instanc class nc attribut ffl averag number instanc class nc attribut assumpt fan ffl kh averag number member class attribut assumpt distribut kh distribut kh nc deriv paramet develop cost deriv paramet definit paramet present due space found ffl fan averag number valu nest attribut instanc class nc ffl averag number instanc class nc nest attribut ffl kh averag number member class nest attribut definit analysi index organ system ffl averag number instanc class nc defin attribut ffl averag number member class defin attribut ffl averag number partial complet instanti path start object specif instanc class nc end nest attribut ffl averag number partial complet instanti path fp start object specif instanc class nc end object member class null attribut paramet denot averag number instanti start end object null attribut ffl prob probabl partial instanti path start object instanc class nc redund ffl isp averag number page path access batch lookup ch kei ffl cost forward begin object instanc class nc reach attribut object cost formula path index cost model insert oper present cost measur number page access storag cost model path path index alloc averag number path pn store leaf node kei estim pn nc prob repres averag number instanti start object instanc class end object attribut formul note comput pn instanti start object member class separ consid instanti redund complet instanti space requir store instanti leaf node record xn def pn dim path kl ol dim path ae oid class identifi defin null defin record leaf node record null bertino al averag xp def leaf node record kei null xp def ae xn def xn def xn def def xn def page dimens ds def size ds def path path dim path defin path denot number page occupi number pn instanti formul path dim approach estim averag size record null averag number instanti leaf record null nc prob denot averag number instanti start instanc class end object null paramet formul null case consid start object consid instanti instanc class space requir null record store instanti formul dim path kl averag size alloc record occupi path path path dim storag requir entir record null ae number lp alloc leaf level lp ae xp def dn xp def rp denot number defin record store leaf node evalu rp def denot averag number page occupi defin leaf node record record estim def determin number lo leaf node lp make observ section xp averag size leaf definit analysi index organ system ffl xp lp size leaf node equal size leaf node lo dn note identifi null record ffl xp dn size leaf node equal size lo lp state lo lp number page occupi path index nlp ae lo lo term success divid term lower nlp root node note number express evalu nlp repres intern height path index denot cost evalu oper storag cost lp retriev cost model develop retriev cost model path singl queri rang queri case target singl class case queri appli entir inherit hierarchi gener path singl kei queri assum al similar analysi develop al null class posit path evalu predic al requir singl index scan maximum number access equal number section assum access leaf node occupi page instanti examin record start object member class number instanti formul path examin nc prob defin number leaf page access examin dim examin dim denot averag number page occupi directori store begin defin leaf node record size greater page size evalu dd def note express repres number page access perform lookup retriev cost ae xp def xp def bertino al evalu valid queri appli class instanc queri appli class member addit step execut case requir access secondari storag queri formul cost model rang assum index order determin leaf node lowest rang sequenti scan leaf node record perform leaf node kei highest rang determin number kei valu belong rang queri averag number index page access ae xp def xp def rp defin repres number page leaf node size leaf node record smaller page size paramet xp def defin delet cost model evalu cost delet object instanc class scope path path index alloc simplifi cost node updat determin set valu attribut object requir forward cost attribut step algorithm consist batch lookup path order locat leaf node record kei valu number page access visit isp number page leaf node record defin valu ae dn xp def fan xp def yao function paramet lp xp def defin determin number index page updat number path instanti remov defin leaf record estim path examin kh path examin defin repres averag number path instanti defin leaf node element note remov instanti object element arrai integ averag number page store leaf node number leaf node data yao function return number access search assum dimens data record lower equal page dimens function defin definit analysi index organ system number leaf page rewritten secondari defin leaf node record occupi path examin yao function examin dim number page defin leaf node record access write ae dn xp def fan xp def start object instanti end instanc null record null access address root updat number page access read updat oper estim ae examin dim examin dim examin nc prob paramet dim defin number record null written secondari storag ae examin examin nh examin dim total cost oper def isp def bertino al nh fan evalu base fact start object instanti end object null iff condit attribut successor null attribut paramet ae insert cost model evalu cost insert object instanc class scope path path index alloc simplifi cost node updat cost determin set valu object equal evalu delet cost model express al set sp path start object end object member class hold al gener total size set formul fan dim path dim path defin set sp gener store path instanti start object end object instanc null attribut size set estim dim space requir store set sp main memori set sp store main memori altogeth occupi page base storag set requir access secondari storag number written secondari storag set sp al determin dim number store set sp dim total storag cost set csp fan definit analysi index organ system attribut batch lookup execut kei valu element number access isp access record size greater page size instanti check redund start object member class number instanti estim pn nc prob defin number leaf page access read remov redund formul dim dim defin note repres number page access scan store begin record number leaf page access determin posit leaf node record instanti repres number page access directori lookup number page inp defin leaf node record access estim inp ae dn xp def fan xp def yao function paramet lp xp def defin evalu number defin leaf page written secondari storag updat path index number path redund insert formul path redund pn fan kh note redund instanti start object member class successor paramet ae dn xp def fan xp def paramet denot number page written secondari storag remov redund denot number leaf page defin leaf node record written secondari storag insert path instanti paramet formul bertino al redund pn dim dim dim paramet defin updat cost record null deriv approach similar case sp al null number page record access estim ae dim dim deriv obtain replac deriv pn number page store null record written secondari storag ae fan nh deriv obtain replac pn final dim dim perform insert path total size set sp greater page number csp secondari storag page access read fetch instanti cost sort set sp execut al leaf node record occupi oper execut main memori total cost insert oper csp def isp csp inp definit analysi index organ system def defin paramet ae ae comparison num num tabl input paramet cost model present section perform experi perform index organ evalu group preliminari experi perform determin paramet affect cost result show factor major impact perform ffl topolog repres paramet fan ffl distribut valu attribut class belong inherit hierarchi posit ffl length path target ffl presenc instanc null valu attribut path discuss perform index respect paramet result experi illustr impact inherit hierarchi null valu target class cost attent paid paramet fan repres number object referenc instanc class attribut paramet import paramet depend number instanc class attribut number fan valu instanc class order compar cost respect chosen presenc inherit fix valu paramet vari paramet system index paramet fix common implement valu paramet list tabl analyz impact logic paramet insert delet cost index organ introduc section report result path length reason path express longer practic frequent trend differ cost techniqu significantli chang comparison perform fix paramet formula assumpt compar case homogen discuss differ depend implement detail note lead result fix vari respect chosen distribut section consid path relat path present refer case requir analysi perform cost model real implement bertino al storag cost result fan target instanc null assum instanc null valu attribut path px optim paramet fan low valu mx lowest storag cost space requir medium high compar techniqu result directli depend definit index techniqu formal explan valu paramet fan influenc redund px high valu paramet fan impli high valu paramet repres number instanc class attribut leaf node record size probabl partial instanti instanti leaf node record high valu paramet fan inform leaf node record redund redund higher high valu fan close class begin length redund partial instanti case px storag occup low low valu paramet fan note redund mx high valu paramet fan optim cost high storag cost depend space occupi auxiliari index px storag cost lower shown due chosen high valu paramet fan close redund px overcom addit cost store auxiliari index illustr result report experi experi graph figur report result experi path length inherit hierarchi paramet fan fan fix fan vari fan refer share instanc class equal object path instanti redund inform store path index respect storag px fan path instanti instanc class common leaf node record larg portion space occupi redund inform storag cost px exce cost mx fan cost fan higher due larg size larg auxiliari index size px mx num page fig experi storag cost obtain vari fan fan fan result slightli higher cost mx inherit hierarchi presenc larg inherit mx ratio px storag cost influenc hierarchi ratio storag cost techniqu influenc chosen distribut high valu paramet fan class belong inherit definit analysi index organ system hierarchi requir storag case px case disjunct distribut perform mx influenc distribut distribut improv presenc larg inherit hierarchi size slightli higher size mx mainten leaf node record behavior observ graph figur inherit hierarchi trend chang space occupi store smaller space occupi mx maintain index impli case storag cost lower mx techniqu lower storag cost case distribut distribut number belong class inherit hierarchi path attribut lower primari record smaller size list paramet fan high valu class object belong perform disjunct distribut instanc class inherit hierarchi set object leaf node record path index greater number redund oid px storag cost higher perform fewer leaf node record store dimens leaf node record greater report confirm result presenc attribut analyz paramet fan influenc techniqu valu paramet fan storag cost px faster cost mx higher fan valu impli larger number redund instanti store px list oid longer larger number object nest attribut mx high valu paramet fan influenc size index relat class hierarchi fan paramet experi mx storag cost slower cost nx px result instanc null valu attribut behavior organ significantli chang perform px medium high valu paramet fan mx influenc presenc null valu null record px store instanti valu nest attribut instanti larger record px storag cost high medium valu paramet fan number instanti null nest attribut probabl instanti redund px perform good highest redund obtain high medium valu paramet fan px storag cost higher cost mx influenc presenc null structur maintain inform experi describ result present storag cost result storag cost summar tabl consid case identifi optim techniqu mx lowest storag cost situat px good storag cost low valu paramet fan import recal high storag cost px larg capac storag devic todai wide organ provid good perform larg storag requir bertino al fan valu inherit hierarchi null valu choic high tabl result summari storag cost retriev cost result experi singl kei queri similar result obtain rang queri addit factor influenc cost number includ rang larger number higher cost tradit organ cost px dimens lower extent mx result fan target instanc null assum instanc null valu attribut path px gener perform mx px influenc choic target mx cost strongli depend path singl cost px equal differ access cost px optim equal cost low valu paramet fan cost mx greatli high valu paramet fan target class end class path px perform mx data structur specif tailor retriev object base predic nest attribut previou result instanc null valu attribut path px leaf node record complet instanti retriev algorithm independ target analyz instanti access leaf node record perform px chang chang target class perform depend target class store primari direct access oid instanc target class mx perform greatli influenc target class number index depend queri target class end singl index scan mx optim cost note alloc organ present paper reduc evalu cost nest predic interest case target class class begin path tradit index worst experi illustr trend experi graph figur report result experi path length inherit hierarchi analyz case target class fan consid index valu attribut leaf node record size smaller page size intern height equal shown graph present figur singl kei retriev oper organ requir access secondari storag fan number object end attribut path definit analysi index organ system number instanti lead element domain size leaf node record index px start fan px requir alloc level mx intern height maintain class posit chang fan retriev cost mx lower cost px chang target perform px chang perform mx queri target class note graph figur fan mx total number page access index alloc index maintain retriev cost mx higher cost px fan number instanc number kei search index alloc cost mx cost differ techniqu px queri target class mx cost higher index alloc class scan px mx px mx px mx num page fig experi retriev cost obtain vari fan fan fan target class left top valu paramet fan leaf node record path index redund oid perform px good larg number instanti analyz differ px cost due fact page oid queri target access primari record greater size page px leaf node record complet access presenc attribut px high valu paramet fan target class end class mx cost greatli size index number kei search experi illustr trend bertino al experi graph figur paramet fan vari time graph figur perform px optim fan fan presenc high number redund oid leaf node record result alloc level index height start fan leaf node record size exce page retriev cost rapidli import note size primari record record size fan height fan page store primari record smaller px target class class end mx cost greatli valu paramet fan px mx num page px mx num page px mx num page fig experi retriev cost obtain vari paramet fan target class left top result path inherit cost mx equal lower cost queri target inherit class inherit hierarchi cost mx higher cost ratio px retriev perform greatli influenc presenc inherit hierarchi high valu paramet fan class belong inherit hierarchi presenc larg inherit perform px mx perform disjunct distribut inherit cost lower mx cost smaller number index scan mx cost depend number class unlik depend length path perform high valu paramet fan class belong inherit hierarchi case storag cost lower mx worst perform retriev class inherit hierarchi case larger number object retriev index relat class definit analysi index organ system behavior mx inherit illustr figur experi show behavior inherit hierarchi result impact distribut mx perform obtain report paper experi graph figur report result experi path length inherit hierarchi posit queri target class inherit hierarchi root retriev cost mx greater cost mx index scan retriev oid member happen queri target class presenc inherit hierarchi influenc cost px px mx num page px mx num page px mx px mx fig experi retriev cost obtain vari fan fan fan queri target singl class inherit hierarchi root left top distribut disjunct px influenc presenc inherit hierarchi instanc null valu attribut instanti leaf node record kei scan retriev cost presenc inherit hierarchi member target class retriev valu paramet fan list oid scan cost chang ratio px perform techniqu lower cost distribut storag cost lower number inform smaller hold disjunct distribut behavior px illustr experi result impact distribut px perform observ graph present figur fourth experi graph figur repres retriev cost obtain path length inherit hierarchi posit class note graph repres retriev cost px paramet fan vari time analyz disjunct distribut bertino al px mx num page px mx num page px mx num page px mx num page fig experi retriev cost obtain vari fan fan fan queri target singl class inherit hierarchi root left top distribut begin fan consid primari record exce page size retriev algorithm access page oid instanc target class algorithm px instanti queri inherit number page access greater num page px queri target inherit hierarchi root class queri target singl class num page px queri target inherit hierarchi root class queri target singl class fig fourth experi retriev cost obtain vari paramet fan queri target singl class entir inherit hierarchi root left consid distribut disjunct definit analysi index organ system result instanc null valu attribut perform px depend posit target class px optim high valu paramet fan mx influenc presenc null valu instanc null valu attribut path store instanti complet order determin instanti kei instanc member target instanti leaf node record scan presenc null portion leaf node record examin px optim high valu paramet fan mx influenc presenc null structur maintain inform experi illustr trend experi graph figur report result relat retriev cost obtain vari posit target class path length inherit hierarchi px fig experi retriev cost obtain vari posit target class fan fan fan px cost high queri target class examin leaf node record fulli access cost lower target class case instanti start object instanc examin px perform target class case complet instanti cost px lower cost result import show instanc class null valu attribut perform px optim high valu fan retriev cost result retriev cost summar tabl px lowest retriev cost situat mx good retriev cost retriev end class path import note chosen paramet consid model common situat object insert perform number direct class posit close bertino al queri target fan valu inherit hierarchi null valu choic high tabl result summari retriev cost delet cost call target class class object delet instanc result fan target instanc null assum instanc null valu attribut path px optim cost remov object instanc class posit path paramet fan class subsequ path low valu mx perform good mx optim delet object belong end class path medium highest cost optim restrict delet object belong end class high valu paramet fan low valu fan paramet paramet fan class high px bad perform behavior summar result due size leaf node record updat number leaf node record analyz depend valu paramet fan class object delet belong path valu paramet fan number record low note cost px optim delet object instanc root class algorithm mx requir lookup singl forward execut determin valu nest attribut object high cost oper lowest cost mx perform good delet object belong end class path px delet instanc class implicitli influenc paramet fan mx cost influenc paramet fan fan fan fan fan condit suffici make mx optim delet instanc belong end class path medium highest cost tree updat delet object belong end class good updat appli auxiliari primari index number primari record updat depend valu paramet fan high valu paramet fan low valu fan optim experi report prove subscript kn exist length path kn px optim delet instanc class kn low valu paramet fan definit analysi index organ system illustr result experi experi graph figur report result relat path inherit hierarchi fix fan fan vari fan graph mx perform delet object belong class px optim remov object belong class class paramet fan low valu experi graph figur fix fan fan vari fan paramet valu fix experi result px delet object instanc class px optim cost fan experi graph figur fix fan fan vari fan cost px delet object instanc class instanc experi show cost delet instanc class slightli influenc valu paramet fan nc high valu paramet tree height addit delet cost incur px number access delet instanc class high valu paramet fan nc due fact order perform valu nest attribut object delet determin perform forward path cost oper greatli influenc valu paramet fan nc fourth experi graph figur report result obtain vari paramet fan paramet chang respect previou experi graph show bad perform fan high valu ratio organ chang time low valu paramet fan high valu paramet fan mx optim shown figur px mx num page px mx num page px mx num page fig experi cost delet object class left top obtain vari fan fan fan bertino al px mx num page px mx num page px mx num page fig experi cost delet object class left top obtain vari fan fan fan px mx num page mx px num page px mx num page fig experi cost delet object class left top obtain vari fan fan fan result presenc inherit kind influenc ratio techniqu perform delet class px disjunct distribut mx influenc distribut definit analysi index organ system px mx num page px mx num page px mx num page fig fourth experi cost delet object class left top obtain vari paramet fan px mx px mx num page fig fourth experi cost delet object class obtain vari paramet fan perform distribut px disjunct number updat perform lower subsect result larg number instanc null valu attribut delet object belong end class optim cost px high cost mx influenc presenc null valu condit point previou delet object successor predecessor list object impli lower number modif requir updat primari auxiliari index size null record px due high number partial instanti lead null valu nest attribut delet instanti object delet mx influenc presenc null valu addit structur maintain store inform bertino al trend observ experi consid experi graph figur report delet cost path length larg number instanc null valu attribut path delet cost px high note behavior mx similar behavior illustr figur null valu influenc perform techniqu px mx num page px mx num page px mx num page fig experi cost delet object class left top obtain vari fan fan fan delet cost result delet cost summar tabl mx lowest delet cost situat px optim low valu paramet fan target class class instanc null valu attribut path present object delet instanc end class high valu paramet fan result confirm intuit updat effici join index px join index multipl mx join index updat cost higher px insert cost insert cost px lower equal delet object insert belong end class mx cost lower equal delet cost insert cost similar behavior delet cost shown mx insert perform optim situat present tabl summari result obtain experi mx lowest insert cost situat px optim low valu paramet fan instanc null valu attribut path present object insert instanc end class path definit analysi index organ system target class fan valu inherit hierarchi null valu choic high tabl result summari delet cost target class fan valu inherit hierarchi null valu choic high tabl result summari insert cost gener relat work result present subsect requir dynam system number oper perform amount index organ identifi strict space requir presenc strict space mx suitabl techniqu px chosen attribut queri instanc null valu attribut queri present strict time system presenc strict time px suitabl techniqu order simplic implement consid px implement simpler implement index aspect consid order make correct choic bertino al strict time system deeper analysi system queri optim understand techniqu suitabl situat tabl guid perform correct choic static system strict time requir handl materi advanc join build index materi view base precomput path valid altern tradit approach note px techniqu form materi implicit join aggreg hierarchi techniqu combin singl structur materi implicit join index tradit techniqu requir separ structur note comput gener view approach relat feasibl strategi larg size irregular structur object object result present paper compar present px mx compar respect retriev updat analysi consid definit equal organ attribut null valu consid paramet perform comparison section fan fix high paramet fan correspond high paramet simpl prove result present accord result present paper ffl storag cost shown low valu paramet px storag cost lower mx storag cost mx px result confirm result ffl retriev cost shown valu paramet px target class end class path result confirm result subsect show px perform equal retriev object class mx compar respect storag retriev cost attribut null valu consid result accord result ffl storag shown perform mx perform inherit hierarchi distribut improv mx influenc consid distribut result confirm result ffl singl kei retriev shown perform mx perform inherit hierarchi result confirm result shown disjunct distribut improv mx perform impact distribut analyz fix paramet assum fix paramet result distribut present compar present paper futur work present index organ support queri nest predic defin singl class inherit hierarchi path index substanti extend respect previou definit order gener techniqu path attribut assum instanc attribut path definit analysi index organ system cost model defin evalu perform techniqu cost model path index cost model present summar compar index techniqu main result tradit inherit lowest storag cost integr path index optim retriev cost situat note import result assum frequenc retriev oper higher frequenc work report paper extend direct px data structur modifi obtain perform insert instanc null attribut path deal problem partit record null maintain separ record null class belong scope path record store instanti start object instanc approach handl null data highli skew algorithm develop determin optim index alloc base statist inform relat topolog current relat issu compar techniqu mix updat result evalu provid interest insight problem optim index alloc interest issu concern queri optim index techniqu px result px present similar analysi address queri optim presenc relat dbm larg amount optim work spent determin strategi perform queri join explicit join relat queri case replac singl path express encod join singl path express precomput case px job optim simplifi path precomput extens analyt model index techniqu provid evalu relev direct implement index techniqu paper carri analyt model valid respect implement result valid show analyt model accur interest open issu implement enhanc perform refer bayer mccreight organ mainten larg order index acta definit analysi index organ system technic report analysi index organ system technic bertino index organ system ieee tran knowledg data bertino approach effici execut data knowledg bertino kim index techniqu queri nest object ieee tran knowledg data bertino system concept architectur chin ron justin lee bori barbara catania index techniqu advanc system kluwer academ boston dordrecht kemper moerkott access support index method object base inform moerkott index multipl set proc int conf larg data page bertino al kc dale index techniqu kim applic sd jr jh unifi analysi batch search sequenti file acm transact cc bc li dynam associ search index oodb proc acm sigmod int conf manag page ramaswami pc kanellaki oodb index proc acm sigmod int conf manag page san seshadri effici index structur object orient proc int conf larg data page user objectstor object design england execut ma valduriez join indic acm tran xie han join index hierarchi support effici navig proc int conf larg data page sb yao approxim block access organ acm
IR/1313 5 increment document cluster web page classif wong ada fu depart comput scienc engin hong kong hong kong juli abstract motiv benefit organ document web search problem automat web page classif emploi cluster techniqu document repres featur vector analyz cluster form assign document cluster class automat contribut featur extract mechan suitabl web page classif introduc tree structur call make cluster process increment sensit document insert order show experi set internet document cluster algorithm classifi web page effect increment classif introduct popular internet continu massiv amount web page web inform led grow challeng inform retriev internet search effici effect retriev inform document classif import process inform retriev system organ vast amount data internet search engin divid index web document number class user limit search scope document classif make retriev result easier search engin return larg amount result simpl queri submit difficult user find document result return internet search engin classifi group user interest continu document classif task carri manual order assign document peopl analyz content document larg amount human effort requir research work conduct automat text classif approach learn text classifi machin learn techniqu algorithm base set posit neg train exampl learn text classifi qualiti result classifi highli depend fit train exampl term class world wide web term concept creat everydai imposs domain expert identifi train exampl learn classifi text class manner order make document classif process cluster techniqu emploi attract cluster analysi find cluster directli reli inform train exampl provid domain expert document commonli repres featur vector featur correspond kei word phrase set document entri vector store numer weight featur document extract featur vector appli cluster algorithm set vector convent high data cluster result document cluster repres featur kei word phrase document support report user cluster algorithm introduc high data birch cure cliqu exist cluster algorithm gener suitabl solv document cluster problem requir suppli number cluster work number cluster class document set unknown user major issu document face high rate updat research found exist cluster algorithm suitabl maintain cluster dynam identifi problem updat cluster frequent perform complet reclust make tree structur increment document term web page web document document interchang cluster introduc tree structur call cluster document train set incom data object forc insert lower level exist child node similar data object prevent dissimilar data put cluster algorithm sensit document insert order toler document featur select major problem relat document cluster find tradit featur extract method suitabl web domain featur extract method select term featur term weight scheme commonli base term frequenc term frequenc combin document frequenc discov experi section web page small number word word time term frequenc word actual import word method ignor coverag featur extract coverag import tini cluster featur extract algorithm suitabl problem domain method number preprocess web page classif user suitabl class search effici onlin larg number result return techniqu classifi result provid guidanc user search increment web page classif updat repositori paper organ section assess previou work document cluster requir web document classif section background inform introduc featur extract method section structur insert algorithm detail section report evalu featur extract method web document cluster algorithm conclud summar contribut section relat work cluster techniqu data mine discov interest data distribut pattern underli data main advantag techniqu interest structur cluster found directli data background knowledg current cluster techniqu broadli classifi partit hierarch popular method partit method maintain cluster repres assign object cluster repres closest object birch view extens approach work larg birch dynam increment method cluster incom point coverag percentag document extract featur idea birch summar cluster point cluster featur vector summari storag store data point cluster built split dynam cluster store leaf node memori requir problem resolv method suitabl larg data set method present structur index document featur vector leaf node document node repres cluster document leaf node root document insert cluster similar base balanc problem possibl forc item node cluster suffix tree cluster algorithm algorithm treat document set word make proxim inform word reli suffix tree identifi set document share common phrase inform creat cluster summar content user time complex limit increment onlin web document cluster prototyp cluster web search document set size restrict limit document tree structur call similar node store summari inform cluster node entri absorb incom entri regard similar aim webpag classif summari inform major differ height balanc tree document cluster cluster qualiti measur algorithm birch featur extract document cluster task identifi good featur extract method suitabl web environ method document document cluster describ altern measur similar document featur vector cluster qualiti evalu method present statist analysi web domain order studi tradit term weight suitabl web document carri experi analyz number distinct word averag word frequenc web page stratifi random sampl techniqu collect document set experi ten topic busi comput recreat social societi chosen search engin randomli collect document topic collect web number valid word page count discard document valid word total web page collect search engin statist word web document shown tabl distinct word averag word frequenc median standard deviat maximum minimum tabl statist word web document made studi number distinct word web document notic web document word document equal distinct document equal distinct document equal distinct word averag word frequenc figur document distribut averag word frequenc figur tabl averag word frequenc term document mean word web document rare time tradit term frequenc weight scheme design longer document web domain document featur extract luhn frequenc word occurr articl furnish measur word order word frequenc result rank order zipf law product frequenc word rank order approxim constant document repres featur vector form numer weight featur total number featur featur correspond word train corpu stem word valid word defin remain word page remov word stem process remov common featur extract method base number occurr term elimin common function word document text consult special list function word comput term frequenc tf ij remain term document number occurr method combin term frequenc document frequenc document frequenc df number document collect document term occur typic document frequenc factor type weight term document ij tf ij df term highest weight document chosen featur experi section find featur extract method suitabl web document cluster algorithm due shown section web document small number word term frequenc kei word higher word user cluster cluster result method extract featur low document frequenc lower document frequenc give higher weight featur featur lead cluster result small cluster method ignor coverag featur extract coverag featur defin percentag document featur featur extract method term cover high percentag document coverag document repres featur vector weight entri featur extract method web document cluster algorithm depend term frequenc method balanc coverag number featur document problem domain cluster aim aid inform retriev web search narrow search scope user cluster result larg cluster small cluster desir larg cluster narrow search scope small cluster total number paramet set approxim number cluster size number cluster approxim total number document method involv randomli select subset document size corpu extract set word document remov stop word combin word root stem techniqu count document frequenc word extract step set lower upper select word document frequenc rang lower upper check coverag word larger threshold stop set lower lower upper upper goto step document set ineffici carri featur extract process entir document set order extract repres featur randomli select set sampl document featur extract step carri experi section show featur extract method extract set good featur web document cluster list remov meaningless word suitabl repres concept class stem techniqu combin word similar form shorter featur vector lead shorter cluster step minim number featur obtain reason coverag featur assum user result cluster document ideal featur cluster cluster document frequenc featur select featur document frequenc equal set lower upper step rang upper enlarg repeatedli step ensur suffici coverag result featur set rough actual number cluster cluster result method make coverag threshold ensur featur select suffici coverag experi section find good coverag threshold document document repres id id document identifi retriev document featur vector number extract ij weight ng binari weight scheme ij equal featur ij equal mention section web page typic word term frequenc word actual import word binari weight scheme suitabl problem domain document cluster document cluster tripl store inform maintain set document number set document featur vector cluster definit document fd dn document cluster entri node defin dc number document id set document identifi document id fid id dn featur vector document ij number extract featur tripl summar document frequenc insid measur close cluster close similar measur cluster section lemma flexibl combin cluster dc combin cluster lemma dc id dc id dc entri disjoint document disjoint mean document belong cluster time dc dc cluster form merg disjoint dc id number extract featur similar model altern measur similar document featur vector base classic vector space model measur call cosin correl commonli measur similar featur vector document larger cosin similar similar measur method euclidean common similar measur method high data cluster altern manhattan distanc document dc dc definit distanc similar method shown tabl altern dc dc cosin correl euclidean qp qp manhattan number extract note manhattan distanc requir simpler mathemat oper compar distanc evalu techniqu order evalu qualiti cluster adopt evalu techniqu introduc detail evalu methodolog topic document cluster topic form document topic cluster document cluster total document topic topic defin respect topic cluster highest cluster score topic tree cluster result weight averag topic measur jt set jt number document topic topic section web document cluster algorithm mean document cluster tree node consid document cluster tree structur guid incom document object document cluster leaf node similar index record leaf node pointer data tree structur design assign document cluster requir visit small number node tree branch factor similar threshold minimum number children node node entri form child pointer child node dc dc entri repres child document node repres cluster made repres entri dc leaf node entri form doc pointer document set dc dc entri call set document pointer document leaf distinguish tree leaf node dc leaf node figur dc leaf node repres cluster made repres dc entri incom document entri insert document leaf node level tree height balanc tree figur show sampl height note tree balanc tree threshold threshold order prevent poor document cluster result document class assign document insert singl document combin document dc leaf node document leaf node figur determin incom document entri pass level insert process exist child entri current node similar entri incom entri higher incom entri pass child node incom entri ad current node document leaf node threshold document cluster forc leaf entri point singl document order reduc insert incom document entri combin leaf similar higher entri combin make merg lemma save node insert split oper insert time reduc compact dataset entri leaf node singl data point cluster data point leaf node absorb data point threshold tree size function threshold valu tree height tree size set number larger similar balanc tree insert present algorithm insert document object document object singl cluster document repres dc entri document object singl encapsul dc entri insert algorithm proce step shown identifi leaf start descend closest child node similar higher child node insert document leaf node empti entri node empti node split requir section modifi leaf reach dc leaf find closest leaf entri test combin violat similar threshold requir dc entri updat reflect combin note dc entri cluster comput dc entri lemma ad leaf node space leaf node entri fit split leaf node section discuss node split algorithm detail modifi path leaf node insert leaf updat entri path root lead leaf node absenc simpli involv ad dc entri reflect addit leaf node split requir insert entri parent point newli creat leaf node parent node space entri fit higher updat dc entri reflect addit split parent node root root height tree root creat node split order add entri full node divid collect entri node similar node minim similar document node maxim turn algorithm partit set entri node straightforward find optim node split gener group number possibl larg approxim node split algorithm insert algorithm node split algorithm similar method consid pick seed pair entri comput similar pair lowest similar element group resolv ti pair largest number document check entri stop group entri rest assign order minimum number assign stop select entri entri calcul similar seed entri group assign entri highest similar group goto step split algorithm attempt find good node split quadrat time term find optim solut delet node merg data delet algorithm similar number remain entri larger equal minimum entri number paramet remov delet oper oper carri node merg sibl oper entri phenomenon occur parent node oper propag root node height tree reduc identifi interest cluster cluster identifi process start root tree algorithm appli discov interest cluster interest cluster defin cluster repres featur size predetermin rang make lower upper valu found featur extract method section determin cluster size rang lower bound upper bound cluster size determin lower upper data set size size sampl data set featur extract rang adjust manual obtain good cluster result identifi interest descend node scan repres featur defin featur support cluster document frequenc repres featur greater threshold call threshold repres threshold featur repres cluster result list result featur extract method web document cluster algorithm appli algorithm synthet data real data studi perform relationship paramet algorithm find behaviour similar real data synthet data interest report data set perform analysi experi run sun ultra mb ram program compil gnu execut solari oper system synthet data gener synthet dataset gener gener develop data gener control number document featur number number similar level rang featur vector cluster set featur randomli repres cluster document gener featur chanc set set featur chanc set higher similar similar document cluster web page collect collect set web page search engin ten topic ten correl topic web page index search engin classifi construct document select ten credit internet job astronomi psycholog depart collect web page total web page dataset correl topic web document select ten search smalltalk visual basic collect web page total web page dataset perform featur extract method mention section tradit extract method ignor coverag featur extract order compar featur extract method tradit method term carri experi record coverag number featur extract method real data set section collect sampl size document order creat sampl size randomli select page document set set paramet word document frequenc extract record coverag number featur found vari rang calcul weight featur document method section featur weight largest weight weight featur sort featur descend order weight featur order list calcul coverag featur figur show plot averag coverag averag number featur topic document set figur show plot averag coverag averag number featur correl topic document set figur notic featur extract method larger coverag method number featur coverag featur method method featur method method figur coverag number featur topic correl topic document set cluster qualiti order studi influenc coverag factor cluster fourth featur set featur extract lower upper cluster document set mention section tabl tabl show number featur coverag featur set sampl topic correl topic document set method method featur coverag coverag sampl sampl sampl sampl sampl averag tabl featur extract result sampl topic document set method method featur coverag coverag sampl sampl sampl sampl sampl averag tabl featur extract result sampl correl topic document set appli document cluster algorithm featur cluster mention real data set paramet cluster algorithm minimum number entri branch factor similar threshold similar threshold paramet chosen trial mean combin valu discov chosen valu compar good result binari weight scheme construct document featur vector evalu cluster qualiti term figur show result topic correl topic document set featur set method method featur set method method figur topic correl topic document set figur notic featur found featur extract method document cluster result extract method coverag featur set extract method larger featur set extract method low coverag document vector entri document vector assign cluster class low coverag lead poor cluster result binari weight numer weight shown section kei word web document time make comparison perform document cluster web domain binari weight scheme numer weight scheme featur set data set experi paramet experi emploi binari numer weight scheme construct document vector appli document cluster algorithm cluster document vector compar perform term cluster qualiti cluster result topic document set correl topic document set shown figur figur show binari weight scheme cluster result numer altern similar measur section defin method measur similar featur vector cosin manhattan distanc data set binari weight numer weight data set binari weight numer weight figur comparison binari weight scheme numer weight scheme term topic correl topic document set euclidean distanc order investig influenc similar measur function perform cluster time program similar function plot number document shown figur experi carri set synthet data web page mention ten cluster similar level paramet cluster algorithm minimum number entri branch factor similar threshold similar threshold paramet chosen trial mean combin valu discov chosen valu compar good result document document cluster qualiti figur comparison similar function figur manhattan distanc method perform term cluster time similar measur comput simpl figur show similar function give similar cluster result term manhattan distanc method similar evalu method remain experi characterist incom entri forc insert leaf node make cluster result sensit insert order leaf entri includ incom entri regard similar reduc node split maintain good cluster order measur impact featur document cluster effect carri experi variant creat variant call balanc tree balanc incom entri insert leaf threshold incom entri combin leaf entri similar larger threshold variant call combin tree balanc leaf entri correspond web page incom entri combin leaf entri similar expect case compar effect document cluster algorithm balanc combin term cluster result synthet data experi compar effici term cluster time shown figur show perform cluster result cluster time document document figur comparison variant compar make comparison effect document cluster web domain real data set web document correl topic topic featur set sampl tabl sampl tabl found experi convert document featur vector experi set note result shown figur set synthet data rang valu featur paramet previou experi emploi binari weight scheme construct document vector appli document cluster algorithm cluster document vector compar effect term cluster result topic correl topic cluster found cluster size rang repres threshold cluster time tabl real data cluster result repres threshold method case shown tabl chosen trial error tabl show measur result term topic document set correl topic document set shown figur figur show cluster result real data set term data set tree data set figur topic correl topic document set cluster calcul document support number document topic topic highest document support topic cluster tabl show valu cluster found algorithm show cluster result term result cluster result high compar result report term averag result shown compar directli data set result encourag tabl tabl list repres featur cluster classif simpl titl topic cluster guess topic cluster repres featur repres featur user cluster cluster topic author internet game wine credit bank soccer astronomi organ psycholog depart job opportun film organ averag cluster topic cobol fortran java javascript lisp pascal perl python smalltalk averag tabl cluster topic correl topic cluster topic document featur author year internet game review wine wine credit bank union soccer team astronomi organ psycholog depart job opportun locat film star organ organ tabl cluster found data increment updat real data set order studi impact increment updat cluster result topic document set insert addit document exist observ chang cluster qualiti convert document featur vector tabl show cluster qualiti addit document ad exist cluster result notic cluster qualiti term document ad exist document set note updat document set involv small amount comput cluster document cluster algorithm suitabl increment updat web page cluster topic document featur cobol procedur fortran fortran java event javascript javascript lisp object pascal perl port python thread smalltalk smalltalk visual tabl classif result correl topic web page collect document tabl increment updat result introduc tree structur call increment hierarch web document cluster featur extract method document cluster web domain method account special characterist web special requir problem domain show experi featur give good result term accuraci effici refer johann prabhakar raghavan automat subspac cluster high data date mine applic acm sigmod confer manag page june ii increment cluster dynam document symposium appli page mose chandra toma rajeev motwani increment cluster dynam inform retriev annual acm symposium theori page el ada yi zhang subspac cluster mine numer data acm sigkdd intern confer knowledg discoveri data page san august empir hyperbol distribut descript predict journal rajeev shim effici cluster algorithm larg acm sigmod confer manag page june guttman dynam index structur spatial search acm page han spatial data progress challeng acm sigmod workshop research issu data mine knowledg june wai lam chao yang ho gener instanc set automat text categor annual intern acm sigir confer research develop inform page august larsen aon fast effect text mine document cluster acm sigkdd intern confer knowledg discoveri data page san august david lewi william gale sequenti algorithm train text classifi annual intern acm sigir confer research develop inform page juli david robert jame ron papka train algorithm linear text classifi annual intern acm sigir confer research develop inform page august luhn automat creation literatur abstract ibm journal research raymond ng jiawei han effici effect cluster method spatial data mine vldb page santiago de septemb gerard salton automat text process retriev inform chapter page publish gerard salton mcgill introduct modern inform page gerard salton mcgill introduct modern inform page sean slatteri mark craven combin statist relat method learn hypertext domain intern confer induct logic juli van rijsbergen inform retriev butterworth yahoo search engin yime yang expert effect effici learn human text categor retriev annual intern acm sigir confer research develop inform page juli clement yu meng principl queri process advanc chapter page morgan kaufmann oren zamir oren etzioni web document feasibl demonstr annual intern acm sigir confer research develop inform page august tian raghu livni effici data cluster method larg acm sigmod confer manag page june zipf human behavior principl effort
HCI/1314 4 reliabl multicast protocol distribut mobil design evalu giusepp alberto francesco dipartimento di ingegneria università di pisa itali dipartimento di ed università di author giusepp itali università pisa dipartimento di ingegneria pisa itali reliabl multicast protocol distribut mobil design evalu giusepp alberto francesco dipartimento di ingegneria università di itali dipartimento di ed università di itali abstract reliabl multicast power commun primit structur distribut program multipl process close cooper paper protocol support reliabl multicast distribut system includ mobil host evalu perform simul scenario mobil host commun wire infrastructur mean wireless technolog featur sender multicast select increasingli strong deliveri order total movement trigger transmiss messag wire network notion set sender receiv dynam size data structur mobil size messag number messag wire network independ number group member wireless network assum provid incomplet spatial coverag messag loss occur cell movement negoti mobil host leav cell enter potenti long disconnect simul result show protocol good perform good scalabl properti mobil reliabl dynam causal total order introduct recent technolog trend greatli stimul distribut system research practic support mobil host cellular wireless palmtop wearabl user carri comput presenc function greatli extend scope exist applic distribut enabl applic domain field inventori factori data traffic monitor paper protocol reliabl multicast commun group includ mobil host reliabl multicast multicast deliv duplic reliabl multicast commun primit proven util context stationari distribut applic requir impli tight cooper number remot entiti maintain form share state protocol extend applic paradigm distribut mobil system mobil host typic special number reason tradit network protocol implicitli assum host chang physic locat time mobil devic sever resourc constraint term process storag resourc wireless network limit bandwidth high error rate mobil introduc issu algorithm level mobil host miss messag simpli perfectli reliabl commun link comput crash scenario consist distribut system mobil host commun wire infrastructur number spatial limit cell defin wireless link cell provid incomplet spatial coverag wireless commun movement unpredict mh leav cell prior negoti remain coverag time assum support rout messag reli mobil ip result scenario gener accommod contemporari wireless red network requir physic wireless network cell coincid room build disconnect mode movement protocol salient multicast commun reliabl multicast deliv sender multicast select increasingli strong deliveri order fifo causal deliveri occur order consist order transmiss total group member deliv multicast order order consist causal set sender receiv mobil host join leav group applic cell switch mh trigger messag exchang wire network featur support effici larg number mh frequent switch cell abil accommod neatli scenario gain import due current trend smaller motiv advantag term improv aggreg throughput smaller power requir transmit size messag size data structur number messag wire network multicast depend number group member factor contribut make protocol highli scalabl previou reliabl multicast protocol distribut mobil system offer support incomplet spatial wireless dynam membership protocol accommod cell switch messag exchang wire network support deliveri total analyz detail perform protocol simul anticip protocol good perform good scalabl properti deliveri latenc fix number sender remain approxim constant larg number receiv latenc limit queu time support factor mismatch wire wireless bandwidth peculiar protocol overview relat work overview protocol protocol section present overview background subsect discuss relat work area stationari host host connect wire network multicast origin mh process small subset attach proper control inform multicast detail process relat control inform depend deliveri select sender coordin send multicast mobil support station sh connect wire network cover cell broadcast messag coordin respect cell mh miss roam wireless link move switch cell multicast broadcast cell broadcast mh detect miss multicast retransmiss mean neg acknowledg scheme cach copi past multicast retransmiss request satisfi cach fetch pertin messag store copi past multicast deliv group member mh piggyback acknowledg past multicast retransmiss request forward acknowledg enabl coordin free storag resourc section addit method propag stabil observ interact cell switch mh protocol extens protocol develop author base singl coordin provid total order simplifi version dynam present relat work multicast mh perform mean multicast protocol design wire network stationari provid rout support mh decid reli mechan rout messag mobil reason track locat individu mh term latenc addit traffic wire cell switch requir updat distribut rout inform strategi make difficult exploit broadcast capabl wireless medium mh belong cell cell switch gener traffic wire network multicast gener mh remain coverag time compar timeout transport level problem recov miss messag remain multicast protocol reli mobil ip gener target applic domain provid deliveri messag deliv cell switch messag possibl lost recov cell lost messag recov mean usual recoveri retransmiss reduc retransmiss forward error correct techniqu idea transmiss time sender multicast messag transmit extra data messag separ receiv side extra data recov commun error messag loss extra data suffici miss messag requir mean tradit scheme hide mobil wireless adopt indirect wire commun path treat mh sh consid par indirect mh reliabl multicast messag send payload mss cell locat mss multicast messag behalf shown indirect protocol offer perform flexibl mobil wireless environ indirect protocol reliabl multicast protocol support static group membership deliveri clarif assum complet spatial coverag protocol maintain wire network chain pointer messag forward current locat group member mh switch dedic procedur updat pointer move messag deliv mss protocol maintain chain forward pointer wire network emploi notion featur highli desir reason gener traffic wire network multicast gener current trend smaller cell privileg strategi accommod frequent cell switch effici suitabl network larg amount inform forward traffic relat mobil manag high strive avoid traffic protocol absenc desir point view briefli mention detail claim found cite paper result protocol made toler crash sh easili impli store critic state inform inform travel cell approach cach state inform mss manag cach independ cell switch base correct practic mobil assumpt requir mh move portion relat requir speed user slower rate complet case correct depend mh move depend global form group member move movement time perform penalti affect correct penalti disappear mh stop move protocol extend preserv causal order deliveri state inform maintain behalf transfer augment vector integ mss vector element element set integ pair argument made appli protocol protocol support reliabl messag deliveri mobil distribut system paper present famili base deriv protocol stationari host crucial differ includ size messag header algorithm requir header nm number requir header ng number requir header posit integ variant protocol requir present protocol messag header size depend number typic smaller nm ng protocol restrict multicast commun protocol base protocol broadcast messag cell switch protocol support deliveri static group mh meant resid top locat servic mss mh requir form detail depend offer underli locat directori paper evalu simul traffic wire network absenc multicast number messag wire network multicast grow number protocol requir locat track locat individu gener traffic wire network multicast load wire network depend number number mh respect absenc messag fifo causal order requir messag multicast mobil support total order requir addit messag reliabl multicast protocol mobil distribut system gener insist prevent arriv duplic mh unicast messag transmiss singl transmiss main tool achiev properti protocol broadcast transmiss insid wireless cell mh receiv duplic multicast due absenc simpl neg acknowledg scheme duplic discard protocol layer mh deliv applic main advantag approach fulli exploit broadcast natur wireless medium drawback data structur maintain order detect duplic data structur requir byte memori section mh buffer messag arriv optim correct actual implement trade memori resourc deliveri latenc full perform obtain reserv kilobyt observ simul strive achiev ground impli substanti batteri broadcast natur wireless lower protocol layer mh cell handl messag direct mh handl unnecessari messag confirm simul duplic consum wireless bandwidth significantli import batteri save obtain minim transmiss oper mh featur exploit multicast explicitli individu acknowledg mh piggyback acknowledg protocol messag recov miss messag protocol mh acknowledg receiv multicast mss send multicast strategi consum scarc wireless bandwidth content wireless contribut averag deliveri latenc protocol explicit acknowledg delai transmiss multicast oper point protocol approach similar system model mh sh commun sole commun wire network reliabl mss broadcast messag mh cell send messag specif mh mh send messag mss cell locat commun cell wireless link basic messag lost mh roam area cover cell host failur scope paper mss maintain data call identifi set mh cell mss awar mh cell mean beacon protocol mss broadcast messag cell receiv mh announc presenc cell send back messag host identifi omit detail protocol sake breviti point mh switch relat exchang state inform simpli updat autonom respect local messag exchang mh mss lost mh continu belong local physic obstruct relat cell mh leav cell quickli movement track beacon protocol mh belong local multipl execut beacon protocol trigger cell switch complet simultan involv locat inform reflect actual cell composit inaccur interpret local actual cell composit alloc dealloc data structur content local critic correct protocol interfac mh group member execut primit stop group member execut primit group group member send multicast deliveri total order multicast deliveri consist causal order transmiss properti group member send messag send messag group member deliv messag deliv transmiss messag causal transmiss messag group member deliv messag deliv group member deliv pair messag deliv deliv deliv fifo order pair messag causal order pair messag total order appli pair multicast fact group member deliv messag reason assumpt physic group member move group member stop deliv messag start enter leav cell quickli messag arriv mss match acknowledg systemat pattern movement persist forev host group member manag group member move messag deliv group member consist membership trigger primit messag mark special flag current group membership properti total order appli membership implement overview host receiv messag arriv protocol deliv protocol forward applic present assum group member run mh group member host static defin set sh act coordin static defin coordin cb group member coordin initi assum group membership group member ident coordin remov assumpt section discuss group join leav section provid overview section detail action perform host overview base figur show simpl exampl messag pattern result group issu multicast exampl assum mh letter coordin associ mh boss cb field messag type call tag group member uniqu member identifi select group member join group section group member mid issu send messag payload local mss mss repli acknowledg forward messag coordin tag append sequenc number multicast result messag broadcast normal messag group member respect cell group member mid issu send messag construct normal messag forward normal messag boss cb multicast boss append sequenc number multicast result messag incomplet wireless unpredict movement mh make messag lost mid retransmit messag receiv match acknowledg mss retransmiss unpredict movement mh make arriv duplic messag coordin cope mid attach sequenc number messag enabl discard duplic process messag order gener incomplet wireless unpredict movement make loss normal messag group member arriv duplic order normal messag event detect group member base sequenc number attach coordin miss messag provok retransmiss request form messag local mss duplic discard messag buffer deliv violat order sender mss receiv group member mid retriev copi multicast send sequenc mid copi extract local cach maintain mss mss receiv normal messag broadcast cell store messag mss fetch copi coordin origin messag make fetch request coordin store copi normal messag discard deliv group stabl group member multicast deliv messag extract inform forward coordin part process retransmiss request action host section describ specif action perform group manag messag full detail found companion report action group member group member mid receiv request issu multicast applic normal messag local mss relat action mid issu send messag local mss messag includ identifi coordin desir sequenc descript messag deliv mid copi deliv group member period resend messag receiv acknowledg mss mid roam uncov region receiv retransmiss postpon enter cell receiv normal messag relat flowchart figur mid check duplic mid maintain arrai sequenc entri coordin initi join group entri coordin ck mid deliv normal messag ck sequenc number compar sequenc number receiv messag pertin entri mid determin case mid discard mid check satisfi deliveri condit order origin group member condit depend messag deliv origin group member send includ descript sequenc number arrai deliv mid condit evalu deliv desir order mid receiv messag deliv mid buffer request retransmiss messag send local mss messag describ miss messag deliv messag resent period lost satisfi deliveri condit mid deliv updat deliv process buffer normal messag deliveri condit true deliveri action mss receiv messag group member normal messag coordin action receiv messag group member mss send acknowledg mid forward messag coordin messag receiv normal mss store copi messag local cach broadcast messag cell receiv messag group member mss extract descript messag deliv mid forward descript coordin mean messag extract descript miss messag relai messag sequenc normal messag messag obtain local cach case coordin origin messag mss detect beacon mid left mss stop transmiss consid process retransmiss request complet receiv mss process previou mss determin recent discard mss abort sequenc messag relai start mss receiv normal messag period retransmit cell sequenc number normal messag includ sequenc number group member detect normal messag lost action coordin coordin receiv messag group member messag omit obviou handl request result cach coordin act boss receiv normal messag coordin action receiv messag relat flowchart figur send group member mid includ current membership discard check case discard messag carri sequenc number select check arriv case buffer case duplic arriv tag append sequenc number store copi result messag data structur normal messag deliv group member order send multicast process messag mid buffer receiv coordin extract descript messag deliv group member mid descript check static group order support dynam membership shown section copi deliv arrai sequenc number base updat record messag deliv mid remov messag deliv group member receiv normal messag event occur append gener sequenc store copi result messag multicast messag coordin messag dynam membership group join leav occur group member membership propag mean normal messag carri descript membership chang mh group member construct join messag send messag cb messag includ uniqu host identifi mh bit pattern select mh mh select past random pattern pair member identifi mid group member mh start listen normal messag cb receiv messag membership chang notifi group messag inform mh ident coordin initi valu deliv arrai mh deliv messag greater sequenc number group member leav group send messag special indic cb receiv acknowledg group member stop particip protocol action boss cb respect dynam membership cb maintain identifi past group member left group entri purg time suffici long ensur send mh listen normal messag cb order initi messag relat group member transit kind practic reason distribut comput receiv join cb check mid current membership discard messag instruct coordin mid join group provid respect sequenc number receiv cb construct normal messag sequenc number describ membership store multicast receiv messag send mid leav cb check mid discard messag instruct coordin mid leav group wait receiv cb construct normal messag describ membership store messag multicast mss inspect normal messag detect membership stop relai miss messag mh left group observ make observ protocol retransmiss messag acknowledg mandatori system model featur impli cost term power consumpt wireless bandwidth usag cost avoid model build protocol commun mh retransmiss system protocol assum messag loss cell absenc movement mh move arbitrari time send messag leav cell receiv relat cell request retransmiss miss messag cb receiv expect acknowledg cell messag exchang wire network mss interact mss group member mid remain unreach enter mss local cach bring mid case fetch multicast coordin detail requir implement reliabl wire network irrelev discuss add layer ip multicast stabil inform flow coordin varieti simpl method messag group member piggyback acknowledg messag coordin solicit explicit acknowledg group member miss messag long time kei issu acknowledg deliveri proce asynchron group member receiv multicast decid buffer discard buffer improv perform protocol receiv messag buffer lack buffer space discard discard buffer messag make room protocol recov lost reason loss matter notic mh decid autonom memori alloc buffer number cover area interest larger number group send normal messag unnecessari cost depend oper involv protocol cell group member simpl extens present independ discuss involv cell coordin maintain set identifi cover area interest send multicast call subscrib action modifi coordin includ subscrib set cell subscrib mss cell remain empti give detail sake breviti refer reader consid case singl coordin subscript consist remot procedur call boss cb process call consist updat subscrib set multicast wire cb coordin observ group member enter cell mss perceiv latenc messag deliveri delai order time process relat remot procedur small compar speed movement correct affect cell mss subscrib uncov area reliabl multicast protocol send multicast exhibit sort period group member enter empti cell protocol offer similar function mean scheme complex costli outlin extend form protocol data call locat set cell group member locat view replic view updat locat view perform replica serial properli synchron locat view manag beacon enabl mss identifi mh practic mh group member mss cell optim section dedic field messag messag inform form group member simul environ analyz perform protocol develop discret event simul model implement languag simul model fulli group member gener messag poisson time interv consecut messag random variabl exponenti distribut group member remain cell random time interv length interv exponenti distribut averag paramet call averag cell perman time group member switch cell enter uncov base paramet call probabl cell select independ current cell probabl group member coverag remain random time interv length interv exponenti distribut averag paramet call averag perman simul support singl multicast group static composit implement dynam membership execut time simul provid insight interest estim perform indic multicast protocol membership protocol obtain raw estim membership perform time mh group member roughli time deliv messag understand simul import compon delai time experienc messag send group member receiv group member compon shown figur case static membership event simul run contribut statist dynam membership simul experi group member requir mh join initi empti group order collect statist simul run time suffici long neglect event occur messag loss occur messag lost latenc includ retransmiss time detect recov lost messag process correspond protocol buffer occur messag delai arriv buffer group messag queu transmiss process complet pertin network interfac busi transmiss delai time put bit medium propag delai time bit reach intend destin time transmiss propag determin simul paramet buffer queu time predict advanc depend number messag gener number send group valuabl result simul estim buffer time queu time anticip queu delai specif wireless interfac group tend predomin messag rate result delai compon due mismatch wire bandwidth wireless ultim bottleneck multicast protocol distribut mobil system denot minimum latenc latenc queu buffer delai retransmiss delai null latenc determin transmiss propag result present result refer messag issu perform experi messag requir causal fifo order result similar report section state set main paramet detail section number member progress grew consid oper environ similar small campu build consid group send group member byte wire network mbp bandwidth propag delai uniformli distribut rang msec wireless network mbp bandwidth neglig propag wireless cell ten meter consid wireless bandwidth typic wireless lan probabl messag loss wireless cell result similar valu rang typic environ sourc mobil group member remain enter cell consid section assum group member alloc kb buffer adopt larg buffer stress protocol highli critic high messag loss rate wireless cell long disconnect period realist size kb proven suffici obtain full perform cb decid boss group member order estim averag latenc messag requir total order scalabl figur show averag latenc vari number receiv protocol scale featur protocol contribut singl wireless transmiss broadcast cell absenc cell cach past messag protocol exhibit latenc quickli number receiv section comparison latenc slightli greater minimum queu result estim independ replic method assum confid level retransmiss delai neglig workload consid figur show averag latenc vari number sender averag latenc remain close minimum latenc workload wireless capac grow significantli higher workload potenti bottleneck simul instrument identifi compon latenc understand bottleneck protocol high workload expect boss cb main bottleneck process multicast found intuit wrong major bottleneck wireless interfac latenc number sender wireless bandwidth row report averag delai experienc coordin boss part delai due queu averag total delai coordin boss practic neglig comparison total delai mss queu predomin factor latenc simul result shown delai experienc transmiss queue result due mismatch bandwidth wire wireless network aggreg messag rate aggr bit rate averag latenc destin mss coordin boss averag total delai averag queu delai averag total delai averag queu delai averag total delai averag queu delai averag delai experienc point system argu phenomenon peculiar consequ coexist network technolog significantli bandwidth argu multicast protocol wire messag mss broadcast wireless side experi protocol corrobor intuit section point observ bottleneck logic central protocol result correspond coordin boss cb group member consid case coordin cb coincid result averag latenc smaller half messag experi step coordin boss cb group member scenario effect host mobil figur show averag latenc grow valu host mobil host mobil number miss messag greater retransmiss delai miss messag retransmit greater buffer delai larger number messag buffer group member valu greater sec averag latenc remain practic constant grow significantli group member remain influenc host mobil averag latenc limit desir featur protocol distribut mobil system observ host move quickli experi perform penalti protocol remain correct speed back normal valu perform penalti disappear figur show percentag retransmit messag valu host mobil percentag defin number messag retransmit solicit number messag deliv group member measur percentag duplic exhibit similar behavior report sake breviti percentag retransmit messag high unrealist host mobil result corrobor design choic requir wire network movement group member retransmiss duplic potenti drawback absenc prevent arriv duplic messag group member useless transmiss messag host result show insist worthwhil effect incomplet coverag analyz influenc incomplet coverag divid group member disconnect member figur show averag latenc perceiv valu tout disconnect member influenc behavior disconnect member reason fact frequent long disconnect impli frequent fetch messag provok longer queu delai coordin perceiv member protocol tune allevi depend applic number reduc load latenc perceiv group member grow slowli tout ad coordin benefici disconnect group member figur show averag delai disconnect member valu tout delai averag length time interv instant member reconnect instant messag miss disconnect deliv delai compar length disconnect significantli influenc number queu delai coordin give small contribut time case long disconnect period wireless transmiss delai observ protocol indirect protocol reliabl multicast mobil wireless system structur highli influenti design protocol section awar perform analysi famili perform simul compar perform scenario analyz present work summar main result sake complet order protocol scenario present compat protocol fifo complet reliabl wireless network protocol outperform respect indic bandwidth usag effici quick manag cell switch mh latenc protocol exhibit trend figur protocol latenc notic number receiv slope latenc number receiv curv quickli number sender kei result protocol exploit broadcast natur wireless medium protocol broadcast multicast respect protocol individu unicast mh order preserv deliveri properti respect wireless wire bandwidth perform analyt predict addit simul interpret result protocol exploit broadcast natur wireless medium absenc found support claim made previou percentag lost messag high main compon delai main scalabl bottleneck queu delai found protocol potenti bottleneck system remain wireless interfac group confirm peculiar protocol simul result protocol found analysi consid multicast wire wireless bandwidth mbp paramet assum higher messag gener rate cite report detail found trend observ found causal inform maintain unnecessari buffer delai incur group member preserv causal order neglig unnecessari delai call inhibit similar drawn paper present evalu reliabl multicast protocol distribut mobil system support dynam membership accommod neatli increasingli strong deliveri order causal total system model assum gener includ incomplet spatial coverag wireless network limit pose mobil pattern group member movement mh impli exchang messag wire network cell switch requir interact protocol design mind mh scarc resourc size data structur mh messag header depend number mh mh acknowledg receiv multicast individu simul result shown protocol scale main limit factor wait time spent wireless transmiss queu delai due mismatch bandwidth wire network wireless factor consequ underli comput platform peculiar protocol point fact queu delai bottleneck similar protocol impli simpl architectur sound practic import result absenc introduc cost term duplic messag useless retransmiss abil accommod effici frequent movement larg number mh cost acknowledg author anonym detail construct comment refer framework deliv multicast messag network mobil mobil network june pp structur reliabl multicast protocol mobil wireless technic report januari submit public flexibl multicast protocol distribut mobil design project technic report februari multicast distribut mobil system wireless ieee symposium reliabl distribut system lausann octob reliabl multicast protocol distribut mobil design evalu technic report septemb provid ieee wireless lan advanc data simul wireless pp effici multicast protocol pc mobil network pp order distribut mobil ieee transact march pp multicast dynam membership wireless network incomplet spatial mobil network june pp perform evalu indirect ieee transact march pp layer architectur ieee person june pp causal atom group acm transact comput august scalabl wireless handoff support mobil internet mobil network pp support mobil host mobil design issu mobil network pp rout datagram internetwork extend acm transact comput analysi error characterist wireless proc acm august gh challeng mobil ieee april architectur commun protocol ieee person quarter level handshak requir establish distribut lectur note comput scienc springer verlag broadcast relat distribut system acm press evalu amoeba group commun proc ieee intern confer distribut comput ieee standard wireless medium access control novemb order event distribut commun juli pp messag connect distribut system acm press support total order multicast mobil wireless technic report april submit public model book ks dr gsm support high densiti person record ieee intern confer june issu mobil technic report inform technolog mobil rfc mobil ip work octob reliabl transport protocol internet adapt causal order algorithm suit mobil comput journal parallel distribut march pp multicast transport protocol ieee journal select area special issu network support vol april causal order abstract simpl implement inform process letter vol pp reliabl multicast protocol wireless acm mobil comput commun vol april overview reliabl multicast transport protocol ieee vol multicast mobil ieee commun januari pp udp perform wireless proc ieee protocol causal order messag deliveri mobil comput mobil network vol pp figur cb mss mss mss cb mss mss mss figur messag pattern thin line messag thick line normal messag duplic evalu deliveri condit record deliveri discard satisfi buffer deliv buffer empti search buffer deliveri condit satisfi retransmiss found figur group behavior process normal messag sender group discard discard buffer construct normal messag base store requir send tb search buffer sender multicast found figur behavior process messag mid mss mss mid wireless wire wire wireless process buffer proc queu transmiss propag figur delai experienc messag case messag loss occur length time interv reflect actual avg delai minimum latenc number receiv avg delai wireless network util number send group member figur latenc vari receiv vari sender avg delai minimum latenc cell switch sec group member retransmit messag cell switch sec group member figur averag latenc percentag retransmit messag host mobil avg delai tout avg time tout figur averag latenc averag delai perman time disconnect member nc includ boss
AI/1315 2 model probabilist reason jame dept comput scienc york uk abstract recent work model probabilist constraint logic program appli probabilist reason probabl defin directli proof atom atom formula stochast logic program label unlabel definit defin proof probabl conserv extens map logic random variabl show induct logic program induc featur model data compar present framework approach probabilist reason constraint logic induct logic program introduct framework merg logic probabilist infer theoret sound applic manner benefit benefit compact knowledg repres reason uncertainti found applic conserv extens logic program framework defin probabl directli proof indirectli atom formula tie probabilist logic concept close tabl list linkag approach establish paper laid begin section overview logic program concept logic probabl logic variabl random variabl instanti instanti relat joint distribut queri queri ground definit probabl tabl disjunct definit mixtur model defin relat term relat defin distribut term distribut tabl link logic probabl section form core paper introduc model stochast logic program section naiv infer method simpl section show complex exampl section discuss role ilp learn structur work dehasp discuss relat work section briefli mention futur work section logic program essenti give overview logic program reader consult standard textbook logic paper definit logic program definit program consist set definit definit disjunct firstord formula variabl implicitli quantifi denot variabl start liter atom formula negat atom definit consist posit liter neg liter posit liter head neg liter bodi goal queri form atom atom map variabl term substitut map variabl term includ call instanti substitut unifi atom atom atom atom appli atom ident atom resolut infer rule atom atom select unifi head substitut return goal goal sequenc resolut step produc empti goal goal tree root children goal produc resolut step empti goal branch end empti goal success branch success refut success set definit program set ground atom atom atom success set predic denot atom complet success set predic symbol gener goal predic form xn distinct variabl comput answer goal substitut variabl produc prolog repres repres model probabilist reason probabl distribut form exp featur model paramet constant probabilist constraint logic program develop abnei work defin model proof formula constraint logic program requir defin featur proof defin model paramet essenti approach logic program framework special case constraint logic program constraint equat constraint term stai standard logic program framework simplic logic program fig figur lp simpl logic program fig show gener queri empti goal show refut amount proof proof success fail success success figur defin distribut refut featur refut goal time time leftmost proof probabl probabl probabl singl proof simpli probabl defin probabl proof atom trivial defin probabl formula proof atom distribut success set approach appli natur natur languag process proof sentenc belong languag amount model find sentenc extend improv iter scale algorithm della della pietra lafferti induc featur paramet model incomplet data incomplet data consist proof atom nlp context mean corpu sentenc sentenc annot correct cheaper resourc sort incomplet data handl practic import stochast logic program framework arbitrari featur recent experi featur number featur indic parallel person concentr special case proof featur defin probabl label denot paramet examin approach nlp perspect muggleton introduc stochast logic approach issu gener logic program view applic induct logic program stochast grammar featur grammar logic program cfg product label sum probabl simpli product label product rule sentenc probabl sum sentenc distribut defin special case model grammar rule defin featur label paramet label sum ensur fail gener sentenc product rule appli nontermin number techniqu algorithm paramet estim appli lift fg lp abnei demonstr defin stochast logic program slp logic program label satisfi constraint refut gener goal predic label predic requir comput answer substitut unit goal predic ground constraint potenti refut product label undefin potenti goal set refut defin undefin refut goal undefin requir goal potenti finit constraint potenti gener goal posit constraint met requir slp variabl head bodi condit trivial met slp bound depth met requir label defin predic sum definit found muggleton requir slp label predic sum muggleton slp defin model continu term slp close connect work muggleton slp defin distribut predic slp distribut refut gener goal predic exp label number time model label defin featur log label model paramet simpli found simpli sum potenti refut sum potenti goal equat hold constraint ensur refut find member element found constraint ensur defin margin distribut ground atom probabl atom defin joint instanti distribut atom defin joint probabl distribut domain logic random variabl set valu found standard logic program finit countabl infinit predic appli predic ariti logic structur slp defin complex joint distribut show simpl slp repres joint distribut defin markov give naiv method probabilist infer slp slp markov net markov net undirect graphic special case model fig show markov net run implement bug system visit posit lung figur markov net vc set cliqu markov net potenti consist evid potenti defin cliqu potenti function depend state variabl cliqu evid potenti defin joint distribut node net constant undefin markov net fig cliqu random variabl net valu tabl potenti function defin cliqu tg instanti tabl evid potenti cliqu tg markov net consist structur paramet repres easili slp cliqu potenti repres tabl slp ground fact figur slp cliqu potenti defin tabl figur ground slp cliqu potenti tg singl unlabel repres structur markov net net fig repres unlabel shown fig call slp repres markov net fashion markov net slp figur clausal markov net naiv slp markov net slp simpl class make suitabl explain basic probabilist infer slp section complex easili implement slp implement demonstr naiv slp process probabilist queri naiv slp correspond naiv method markov net part prolog implement slp repres markov net found fig predic probabilist signifi tupl belong relat probabl tupl belong relat distribut tupl belong relat prob figur slp implement prolog joint distribut probabl found prolog queri prolog true bag list instanc templat proof goal found prolog add element list case proof refut probabl constant found put gener goal insid give answer make assert futur margin distribut easili found queri return prob defin return probabl prob condit distribut condit distribut defin quotient relev margin distribut requir find relev constant find constant comput involv condit distribut found prob method shown demonstr basic idea probabilist infer comput small exampl find avoid markov net slp fig show slp defin distribut languag fa note defin distribut structur constant naiv find prolog implement work countabl make implement procedur updat lower bound refut produc output lower bound converg figur stochast grammar defin slp figur linear markov net slp slp figur repres simpl linear markov net independ instanc condit independ phenomenon central probabilist graphic model markov net note independ justifi make strong assumpt independ valu condit condit independ independ crop applic investig boutili al repres differenti sort valu assum defin mutual achiev defin slp fig defin mixtur model altern negat negat slp properli current restrict definit def omit figur mixtur model slp defin independ ilp featur construct defin structur featur natur ilp techniqu induc structur featur data work ilp learn posit exampl relev incorpor probabilist approach ilp dehasp dehasp present algorithm construct model boolean clausal constraint featur dehasp ilp set prolog approach ilp gather inform relev prolog program normal instanc inform scatter background knowledg learn interpret condit variabl condit valu variabl iso prolog notat approach background knowledg akin throw rule cover relev queri succe repres dehasp appli simpl anim classif task illustr approach boolean featur defin term class queri true pair iff class match constraint queri succe instanc bring connect dehasp approach present dehasp clausal constraint label dummi target argument liter fig dehasp negat safe assum queri ground figur dehasp clausal constraint label dehasp associ boolean featur label defin pair background knowledg repres logic program defin distribut pair exp suitabl condit distribut biject proof atom proof dehasp treat proof paramet featur label proof featur defin probabl atom directli contrast slp approach proof featur set label defin probabl proof probabl atom slp sum probabl proof atom dehasp approach direct definit distribut reli proof pass label slp restrict probabl atom number proof desir dehasp approach case dehasp exploit lattic structur appli ilp techniqu guid search suitabl search beam search declar bia languag formal paramet fix search constraint techniqu learn structur net start unconnect net increment add arc techniqu strongli relat ilp search start maxim gener refin ad liter bodi found correspond total unconnect markov net node refin correspond ad arc node explor connect yield valuabl ilp net structur learn relat work give survei work connect logic probabl found statist logic literatur contrast approach present exampl close relat work translat cliqu function markov net relat essenti wong al wong al translat graphic oper markov net product distribut construct condit distribut margin oper mimic standard approach markov net literatur wong al argument oper requir effect markov net defin tabl defin margin probabl method develop niti manipul tabl current work seek extend wong al move relat set logic program set model construct rule probabl gener bayesian network queri queri match head result node repres ground fact ad grow bayesian network context defin normal explicitli logic program specifi logic condit label rule ground fact boolean variabl true bayesian network built comput probabl queri true work connect logic rule ff connect condit probabl statement ff object comput probabl atom true current focu undirect form part definit binari distribut defin term distribut make attempt model causal label rule defin probabl ground atom true provid bound probabl true binari distribut defin probabl instanti order reason probabl truth simpli augment atom introduc extra variabl repres truth treat variabl conserv interest truth atom vari model variat standard random variabl person parent person inherit probabl encod probabl slp boolean variabl fig find probabl big figur repres belief extra variabl true requir slp comput probabl big big potenti amount demand argument truth big falsiti effect balanc strength proof decid probabl truth differ approach clear similar net construct explor prolog deserv investig approach relat probabilist reason relat bayesian network interpret node bayesian net conceiv network implement suitabl unwieldi practic end interest easier deal resort complex slp model complex interact belief slp close relat stochast program koller al stochast execut function program defin distribut output program koller al show bayesian net repres richer formal base direct net observ node net stochast function parent show formal exploit independ unlik present provid detail effici algorithm probabilist infer mimic standard effici algorithm bayesian network koller al discuss method induc stochast function highli ilp techniqu appli open question futur work present naiv techniqu probabilist infer naiv remain develop effici approach mimic algorithm effici infer koller al stochast program work implement algorithm logic program relev expect techniqu logic program comput deduct program transform learn paramet approach store proof chart deduct make lot continu goal probabilist infer learn markov chain mont carlo attract slp gibb sampl argument goal ground iter constrain goal gener refut lead effici method hope current framework stimul research statist research benefit contribut relat work induc model data comput linguist bayesian network acknowledg sara farmer weed error omiss stephen muggleton discuss role slp stefan clarifi method jane robert put final luc de raedt encourag investig bayesian net refer steven abnei stochast grammar comput di implement algorithm constraint logic program proc joint intern confer symposium logic mit press henrik predic invent learn posit exampl european confer machin learn craig daphn koller independ bayesian network twelfth annual confer uncertainti artifici intellig page luc dehasp maximum entropi model clausal constraint induct logic intern workshop lnai page andrea probabilist extens grammar contribut peter overview recent develop bayesian problem solv techniqu ai spring manfr relat bayesian network thirteenth annual confer uncertainti artifici intellig page san morgan kaufmann publish daphn david avi pfeffer effect bayesian infer stochast program proc fourteenth nation confer artifici intellig page rhode august daphn koller avi pfeffer learn probabl noisi rule fifteenth intern joint confer artifici intellig august sj young estim stochast grammar algorithm comput speech sl lauritzen dj spiegelhalt local comput probabl graphic structur applic expert system journal royal statist societi john lloyd foundat logic program muggleton stochast logic program de intern workshop induct logic page depart comput katholiek universiteit muggleton learn posit data sixth induct logic program stockholm raymond ng subrahmanian probabilist logic program inform peter answer queri probabilist knowledg base theoret comput special issu uncertainti deduct system della della lafferti induc featur random field ieee transact pattern analysi machin april stefan probabilist constraint logic program de sfb bericht nr universitat shapiro logic program tool implement system proc page bug bayesian infer gibb sampl manual mrc method implement probabilist model relat eleventh annual confer uncertainti artifici intellig page queri evalu probabilist relat theoret comput
IR/1316 5 discov seed interest spread prematur page cite multipl commun mitsuru japan scienc technolog corpor graduat school system tokyo japan dept electron tokyo japan abstract world wide web great sourc topic trend birth creation method discov stimul commun peopl commun topic grow trend popular interest obtain web page absorb attent peopl multipl shown experi small group topic page trigger growth peopl bound exist commun interest web link introduct grow trend topic grow preval satisfi desir peopl inform simpl sensat quickli spread fit uncertain mind desir inform aim detect topic spread satisfi wide rang peopl peopl awar understand accept topic grow establish decai easili li topic lead preval worthwhil find benefit problem address kind topic grow interest support awar human commun topic section problem discuss make strategi challeng problem section point previou method find opinion aim section method link base web fit goal present method obtain includ topic prematur accept wide rang boundari person interest remark section mechan topic growth trend question mechan commun extens defin commun group peopl share peopl societi artifici intellig share admir aim make ai interest equal peopl commun regard commun share establish valu gather multipl commun occas meet talk newli born opinion share particip evalu posit measur evalu find greater commun share mean encount differ previou interest share trigger innov strong idea point awar relat initi belief commun belong inform urg topic understood establish commun robot game robocup curiou match latent interest gather achiev innov concept link model present method aid discoveri web page topic prematur attract multipl visual topic link interest establish commun studi devot extract commun web method obtain hub link page obtain googl popular establish commun method obtain group link author find emerg commun aim find prematur topic seed commun emerg grasp latent hard find due prematur preval obstacl exist predict futur trend extrem rare sign point section group commun evolv predict method reli past frequent pattern discov seed interest spread rare pattern rich past data applic hidden trend context commun relationship hard fulli consid featur data order cope appli principl visual sign trend user imagin hidden fulli autom predict principl popular commun made peopl share popular principl topic attract popular grow trend grow commun method principl set top page repres output page googl obtain link page regard page repres emerg commun select singl page repres commun order form visual output shown principl page link multipl commun topic attract multipl call page ancient meet algorithm outlin obtain web page repres step queri repres user interest domain enter search engin obtain step page obtain step obtain select commun step commun link multipl obtain obtain result link visual topic spread group peopl evalu experi stage interest domain group number peopl relev domain input queri stage output graph ad real fake red obtain shown subject red ad red link black subject report individu impress exchang idea group conduct evalu stage queri fig output domain queri queri subject human genom analysi area gather stage web page black node repres common knowledg area background subject red node show page grow interest red node target interest institut relev seldom meet frequent workshop consid achiev discoveri exchang knowledg largest cluster node link group american research grow interest lead institut nih genom research discov seed interest spread small cluster activ identif genom institut red data sourc human research institut data web page data research queri includ black node establish interest area black node appeal direct futur research red node includ futur subject individu embodi comment make discuss lead awar evalu criteria search engin measur user real seek inform retriev techniqu discuss red page hypothesi growth minor topic wide spread interest major peopl algorithm shown detect topic model method appli web link specif shown visual output aid discoveri growth concept refer psycholog product develop manag world auto industri harvard busi school press act automat resourc compil analyz hyperlink structur text proc infer web commun line acm hypermedia authorit sourc hyperlink ibm research report rj anatomi larg scale hypertextu web search engin proc web confer trawl web emerg proc frequent episod event proc conf knowledg discoveri data mine gm predict rare event event proc discoveri except rule base intens principl data mine knowledg lnai
DB/1317 3 object buffer replac algorithm system park han song march depart comput scienc depart comput scienc center artifici intellig korea advanc institut scienc technolog depart comput korea advanc institut scienc technolog depart comput korea advanc institut scienc technolog colleg inform scienc pa object buffer replac algorithm system park han song abstract system manag object buffer provid fast access object tradit buffer replac algorithm base page simpli assum cost incur oper buffer proport number buffer fault assumpt longer hold object buffer object cost replac object vari object replac algorithm object buffer algorithm replac object minimum cost unit time unit space cost model extend previou includ replac cost size object perform test show algorithm superior algorithm case fast idea replac appli buffer manag architectur adopt earlier algorithm system variat replac cost introduct tradit manag manag buffer physic unit call page fetch replac unit page buffer manag scheme call buffer manag buffer separ depart comput scienc center artifici intellig korea advanc institut scienc technolog depart comput korea advanc institut scienc technolog depart comput korea advanc institut scienc technolog colleg inform scienc pa area call object buffer page buffer object buffer manag object logic page buffer manag physic page object disk storag format object resid object buffer copi page buffer forc back page buffer replac actual disk oper perform page buffer scheme call dual buffer replac algorithm buffer typic algorithm lru clock replac process page page remov buffer written back disk order make space page common strategi replac algorithm select page expect referenc lru estim time refer page time refer page gener time kth refer clock simpl approxim approxim refer bit research area object buffer manag dual buffer oodbmss reli naiv algorithm simpli appli techniqu algorithm garbag collect techniqu replac object object buffer techniqu run potenti risk replac object referenc gemston lru replac object object buffer contrast case page page fix length cost replac page object object buffer variabl length cost replac object vari depend object characterist object buffer overlook convent replac algorithm affect perform buffer manag significantli defin replac cost cost incur replac object note replac cost includ cost fetch object fetch cost account separ assum cpu comput time neglig compar disk access time defin cost number disk access factor make replac cost object variabl length object index updat cost object size exce page size disk page updat object attribut index defin cost updat index includ replac cost relat updat index column tupl updat index avoid repeat index oodbm defer index updat updat object replac page buffer updat object updat copi resid object buffer replac algorithm object buffer cost model gener model previou algorithm lru includ replac cost affect variabl length object index updat cost algorithm replac object minimum cost unit time unit space idea buffer manag introduc weikum work algorithm distribut cach network environ account cost fetch object variabl length ignor replac cost object convent algorithm note idea replac paper develop independ work refer paper organ section briefli review underli concept replac algorithm section replac algorithm section evalu perform algorithm section summar contribut conclud paper basic concept replac algorithm briefli overview basic concept convent algorithm defin terminolog assum set disk page refer string sequenc refer page statement mean page referenc refer point discret time page referenc time buffer fault occur referenc page resid buffer cost process singl buffer fault consist fetch cost incur fetch referenc page replac cost incur replac victim page replac algorithm ignor replac cost assum fetch cost constant total cost process refer string proport number buffer fault forward distanc page denot time refer page page referenc refer start time page referenc time assum refer string optim polici page replac select victim page longest expect time till refer minim number buffer fault contrast type optim replac algorithm literatur assum refer string advanc replac page maximum forward distanc algorithm shown optim refer string lack practic refer string apriori gener theoret basi estim minimum number buffer fault assum refer string advanc replac page maximum expect forward replac page maximum time assum independ refer model page referenc shown expect cost produc algorithm minimum algorithm optim assumpt independ refer model assum refer string sequenc independ random variabl common stationari discret probabl distribut mean probabl page referenc constant independ random variabl repres forward distanc page time geometr distribut expect forward distanc page independ time lru algorithm base model dc algorithm past refer estim expect forward distanc backward page denot time refer page refer page time kth refer time page referenc time time assum refer string refer page gener estim expect forward distanc backward page algorithm replac page longest backward lru regard replac page maximum object buffer replac algorithm object buffer replac algorithm extend dc algorithm incorpor size object replac cost denot cost function cost fetch replac object function repres size object cost function determin oper execut avail index defin attribut storag structur oodbm cost function model dbm experi list appendix case replac oper updat cost vari significantli depend index defin attribut updat object replac time cost paid durat acquir amount space make space durat cost incur time object durat cost incur fetch back object expect distanc dc cost unit time unit space incur replac fetch back object defin defin unit cost object algorithm replac object minimum unit cost call algorithm object buffer replac algorithm unlik convent algorithm base sole probabl incorpor cost replac fetch object gener dc dc special case object constant replac object minimum ident replac object maximum optim case variabl optim assum independ refer provid approxim proof optim size object replac buffer fault gener fetch object larg object object replac larg object object fetch replac due cost analysi algorithm complic make simplifi assumpt object replac buffer fault account variabl length properti defin object minim expect cost unit space incur replac fetch object object buffer size hold object state buffer time express fx jx kg assum replac victim time expect cost unit space refer incur replac algorithm buffer state express eq fx jj ng set object resid buffer includ replac victim pr equat consist expect cost unit space fetch object expect cost unit space replac object resid buffer case object referenc time resid expect cost unit space fetch replac object term sum fetch cost unit divid fetch cost size object multipli probabl refer term sum replac cost unit space object multipli probabl replac object probabl object replac probabl object resid multipli probabl object condit probabl object referenc equal px term sum cost unit space fetch replac object time probabl object resid multipli probabl object referenc time term eq reduc term eq assum independ refer model eq express eq unit cost object px neglig larg simpli term period buffer state includ object highest unit cost replac object minimum unit cost object highest unit cost replac load buffer call state buffer steadi state steadi state unit cost object smaller equal object minimum buffer state strategi replac object minimum unit cost minim expect cost unit space refer steadi state effect ratio replac total cost incur algorithm assumpt object replac buffer fault object buffer belong replac referenc object buffer size refer string defin set object fetch time set object replac time defin measur effect replac algorithm definit buffer size refer string effect ratio algorithm algorithm defin effect ratio show superior algorithm compar algorithm repres ratio cost algorithm section show experi effect ratio dc estim expect forward distanc probabl expect forward distanc independ refer model probabl distribut method estim method refer estim expect forward distanc heurist techniqu base statist estim expect distanc interv past refer assum interv refer object deriv eq assum figur show interv refer object expect distanc refer object defin figur estim expect forward distanc replac algorithm refer estim expect forward distanc object contrast backward estim expect forward distanc hard appli approach algorithm requir cost object recomput time problem address literatur method recomput cost object period difficult determin optim period big overhead perform comput approach practic method experi show result approach differ approach problem determin case optim shown due wide variat interv object refer shown case perform practic algorithm practic algorithm experi confirm case perform case algorithm oper similar differ unit cost object replac estim expect distanc interv refer data structur extens algorithm simplifi implement maintain piec inform main ffl repres histori refer object time refer refer object object referenc ffl repres cost incur object replac calcul piec call retain inform maintain main memori separ object period time object replac histori object refer object referenc denot retain inform object retain inform maintain data queue maintain retain inform object histori inform refer maintain retain inform object histori inform refer kei unit cost object calcul object delet minimum unit cost approxim interv maintain retain inform object resid buffer fifo queue maintain retain inform object replac buffer data structur similar queue differ unit cost maintain retain inform object replac maintain object replac algorithm describ work algorithm describ process referenc object time retain inform object modifi insert data structur base histori inform object algorithm describ process reclaim space object fetch object buffer object replac retain inform replac object insert size exce limit retain inform remov fifo order algorithm begin remov insert remov insert add head endif end algorithm reclaim begin free space fetch free space free space begin remov tail replac add head end free space begin remov minimum replac add head end begin remov tail end fetch reclaim space end end perform evalu compar perform dc static refer probabl dynam chang inform refer object estim expect forward distanc object cost function appendix estim unit cost object obtain refer probabl object count number refer object divid total number refer refer string implement oodbm develop treat special case fetch cost replac cost size object set constant obtain cost incur count number page access base result examin effect ratio dc environ variabl perform evalu benchmark wide benchmark perform oodbmss benchmark model typic case applic deal complex part connect hierarchi assembl object experi oper simpl updat index updat model case replac cost case updat attribut replac cost vari case updat attribut object index defin replac cost vari significantli object perform replac algorithm depend rel size buffer measur number page access vari buffer size minimum byte size assum page buffer exist disk set page buffer size result number page access equal number disk access benchmark experi set size retain inform maximum size infin minim effect retain inform result perform cold warm cold set object initi empti warm set object cold cold includ initi cost fetch object empti buffer warm show cost incur buffer steadi state execut warm cold report result warm ensur warm object retain inform fill histori refer make buffer close steadi state examin figur show result cold warm replac cost object differ dc variabl length properti superior dc account size dc algorithm consid refer probabl object observ approxim algorithm dc similar pattern compar warm number page access buffer size kbyte dc cold number page access buffer size kbyte dc warm figur cold warm show lower cost cold cold incur initi cost fetch object buffer buffer size grow cost algorithm converg cold warm converg cold repres initi cost fetch object buffer examin result figur show result warm cost algorithm higher number page access buffer size kbyte dc figur warm replac cost due updat note differ dc differ larger reason account replac cost incur dc figur show result warm high cost index updat includ replac show greater differ dc figur show differ effect ratio effect ratio number page access buffer size kbyte dc number page access effect ratio percentag buffer size kbyte effect ratio figur warm dc show index updat perform fast replac object buffer model extend effect ratio high buffer absolut cost algorithm smaller effect ratio buffer size reach size theoret basi incorpor replac fetch cost base replac object minimum unit cost perform result show outperform advantag account size object updat bigger advantag consid replac cost object index updat perform fast gener algorithm applic buffer manag massiv storag system control devic read write cost effici buffer account differ access time storag devic magnet optic disk drive refer optim page journal vol pp jan studi replac algorithm virtual storag ibm system vol pp gemston object manag comm vol pp oct proc intl conf manag acm jr oper system model program behavior demand research report ibm watson research yorktown sept buffer acm tran vol dec low overhead high perform buffer manag replac proc intl conf larg data pp sept strategi object proc intl conf larg data pp sept introduct mit region split strategi physic design file proc intl conf larg data pp aug page replac algorithm disk proc intl conf manag acm persist object object buffer manag ph depart comput korea advanc institut scienc onlin method distribut proc intl conf data apr object technolog refer applic program interfac refer cost formula relat queri proc ieee aug object buffer replac algorithm korean file cost function describ cost model oodbm experi base model refer cost model modifi extend fit storag structur system notat nc la fa class attribut number object class size page block factor index page attribut select attribut basic cost function consist cost function read write object cost function updat index defin attribut cost defin number disk page function cost read object disk cost read object determin size object deriv simpl probabl model assum size object store page page object store page head start offset probabl page consum store rest object number page store object function ow cost write object disk ow write object cost read object page store object read written back disk function cost entri index defin attribut class dlog la nc fa nc updat search leaf page slot entri insert entri delet entri term cost index root leaf cost find entri leaf page search half number entri kei averag cost access leaf page includ subtract page access term cost write updat page disk basic cost deriv fetch replac cost object function cost fetch object function cost replac object object updat attribut object updat ow attribut index defin updat ow cost replac object determin state object object replac cost attribut index defin object written disk index updat occur attribut index defin index updat attribut updat disk delet kei insert incur cost attribut
Agents/1318 1 approach manufactur integr experi cost acknowledg work support part advanc technolog program administ nation institut standard technolog agreement depart maryland baltimor counti md depart comput scienc north carolina nc ibm corpor boca fl abbrevi agent manufactur integr mail address yun peng depart comput scienc electr engin maryland baltimor counti circl md usa abstract product manag system manufactur todai disconnect plan execut lack support collabor integr situat prevent manufactur fulli explor market opportun time fashion address explor approach intellig integr set agent special quickli assembl gather relev inform cooper part product manag system human arriv time deal scenario includ architectur present demonstr integr scenario involv real plan execut softwar system introduct product manag system todai manufactur consist set separ applic part execut process capac analysi softwar determin master product schedul set product target resourc plan softwar gener materi resourc plan schedul softwar determin sequenc shop floor resourc produc product manufactur execut system track statu work enforc rout report claim rest plan execut applic softwar system refer applic applic legaci system develop year softwar system perform design equip handl complex busi scenario jen scenario involv coordin applic respond extern environ request custom intern execut dynam mismatch plan time solut scenario crucial agil era telecommun scenario primarili handl human slow optim consortium intellig integr manufactur consist privat compani form match fund nation institut standard technolog feder govern primari goal consortium develop technolog intellig integr plan execut manufactur vision success integr system manufactur featur heterogen applic vendor oper integr part system integr softwar tool infrastructur support integr task cover exist applic provid integr solut support runtim dynam coordin deal unexpect event distribut resourc softwar data physic logic distribut open user select chang applic tool easili addit integr cost approach integr system rewrit applic softwar monolith integr system capabl handl scenario approach judg high develop mainten inflex monolith system convent distribut system inadequ work level lack support abstract higher level adopt kei technolog approach intellig softwar develop system integr sharp contrast tradit softwar softwar agent program peopl solv problem collabor softwar agent resourc network composit research jen individu agent design perform data collect analysi plan schedul constant vigil mismatch plan schedul level abstract time horizon agent design resolv conflict coordin human manag analyst person assist agent design assist human agent creat provid legaci system commun coordin capabl effect cooper agent societi autonom inher open commun capabl essenti mean agent collabor environ consortium research laboratori compani consortium applic system vendor user situat opportun work system imagin toi complex realist busi scenario immatur technolog reach industri understand receiv guard enthusiasm member consortium concern integr matur handl normal expect busi scenario prioriti design develop complet agent system integr aspect manufactur plane develop limit scope reliabl add commerci end user initi prototyp agent system minimum normal work exist applic base decid concentr scenario repres except normal expect busi process resolut involv applic scenario involv delai shipment date part supplier event manufactur plan action order substitut realloc materi detect except determin action applic possibl human involv exampl similar scenario includ favor custom request move ahead deliveri date machin breakdown report crucial oper process rate normal mention figur figur illustr conceptu level except shipment part handl integr system modul instruct human analysi constitut except monitor modul determin data monitor detect except conduct actual monitor data stream notifi monitor modul occurr modul make consult applic analysi modul request carri design note constitut except monitor dynam prior plan execut factori delai shipment order part except delai greater dai part crucial order prefer custom inventori part delai greater dai except make situat action address except trigger except occur reschedul handl delai shipment part delai deliveri date import order respect sale repres provid integr solut outlin simpl mean trivial undertak set agent special develop provid perform analysi monitor modul figur cover exist applic integr function fall applic reliabl flexibl commun infrastructur develop agent effect share servic mean support interact agentifi provid mechan runtim collabor piec develop describ experi develop system project rest paper organ briefli describ softwar agent technolog relev task manufactur integr section form core present system work scenario involv real applic section evalu approach compar relat work section conclud paper discuss ongo work expand agent direct futur research system agent collabor consensu definit softwar agent peopl suggest piec softwar object perform specif task agent prevail opinion agent vari import gener cooper agent agenda goal exhibit behavior simpli deem adapt impli agent capabl adapt includ agent human learn experi order improv chang environ cooper coordin agent import featur ma unlik agent ma share task collabor achiev common goal intellig properti ma reflect individu agent emerg behavior entir collect cooper coordin agent ma requir agent understand commun effect infrastructur support agent cooper ma includ kei common agent commun languag common format content share ontolog approach achiev infrastructur agent cooper compon technolog develop kse adopt knowledg queri manipul languag commun languag knowledg interchang format format commun concept share ontolog briefli describ compon justifi select context manufactur integr environ kqml kqml acl consid messag content attitud sender content agent send statement content messag agent process rate oper machin greater agent intent statement agent simpli statement true statement true bs attach intent statement kqml formal specif repres intent messag set perform messag subset kqml perform relev agent system includ kqml messag divid content commun messag layer content layer bear actual content messag languag chosen send agent commun layer encod set featur messag describ lower level commun ident sender uniqu identifi tag commun messag layer encod includ intent chosen content languag ontolog structur syntax kqml messag base balanc parenthesi list element perform rest paramet form pair actual kqml messag agent agent inquir price share ibm stock uninstanti variabl reader refer detail descript kqml specif kif ibm joe kif kqml agent content benefici agent ma exchang messag singl neutral format obviou advantag adopt common content format effici format agent convert content messag intern common format kif interchang due rich express power simpl wide neutral messag content format agent commun kif prefix version order predic calculu extens support reason definit languag descript includ specif syntax semant express fact kif support express encod knowledg knowledg procedur kif subject ansi standard studi share ontolog share content formal repres knowledg requir formal commun languag individu autonom entiti special aspect problem solv model world class properti object world conceptu differ object differ machin identif term definit agent intern refer rate agent annual rate taxonomi conceptu perspect individu agent ensur correct mutual understand exchang agent model part world exchang inform terminolog agent agent share common ontolog ontolog domain conceptu world term distinct domain share common ontolog refer explicit specif ontolog commit group agent specif object interpret descript concept relationship agent interact program legaci busi human share ontolog form document set machin interpret specif agent collabor common commun common content share agent commun understand world addit essenti common servic agent ma make agent collabor effici effect type servic agent agent server similarli white page phone serv central repositori contact address involv maintain address tabl regist access agent symbol newli creat agent regist contact address possibl inform send messag perform regist agent system contact map symbol regist agent contact address request agent type servic agent facilit agent addit servic agent simpl fa broker agent type servic regist servic offer request individu agent dynam connect servic request agent regist servic send ba messag perform request servic send ba messag broker perform descript specif servic content messag repli messag ba send symbol agent provid request servic request met current agent system architectur describ ma architectur support cooper agent commun infrastructur figur architectur integr ma integr part figur current stage entir integr architectur applic world agent support separ commun infrastructur legaci applic wrap provid limit commun capabl transport mechan mq seri ibm commun infrastructur wrap applic mechan support predetermin commun pattern agent servic agent type agent integr agent interpol extrapol raw transact data low level make aggreg inform higher level agent event monitor agent notifi abnorm event attend analysi agent evalu disturb current plan schedul recommend action address disturb scenario coordin agent assist human make specif busi scenario provid relev includ filter workflow chart agent kqml agent commun subset kif support horn deduct infer content languag chosen transport mechan commun share ontolog agreement document establish applic vendor user partner consortium agreement adopt format busi object document defin open applic group messag format commun applic agent applic special servic call gatewai agent creat provid interfac agent world applic world ga includ make connect transport mechan mq convert messag format agent system architectur outlin support agent commun infrastructur call develop consortium written java support agent commun kqml agent commun languag select java implement languag base network support multithread program subsect provid detail descript polici kqml defin syntax languag workabl semant imper conduct coher agent support syntact semant aspect semant interpret kqml labrou realiz part set polici polici procedur base perform sequenc termin start messag termin sender receiv proper repli repli includ error indic format messag indic receiv provid answer messag content answer messag retract previou start messag perform subscrib polici agent start agent remain open listen messag satisfi subscript criterion polici chosen determinist finit automata model start state call end state call stop move state state transit diagram figur show exampl subscrib figur overview design design provid present simpl interfac user consist roughli seventi distinct user interact channel hide detail implement figur figur present princip basic messag path system discuss illustr trace path messag system compon class bridg agent applic control startup shutdown applic access intern common data plai supervisori role commun infrastructur agent creat instanc extend agent shell great flexibl design implement part agent run transport modul commun protocol current implement includ modul user creat addit modul protocol transport modul messag transmiss receipt messag receiv direct place space role messag handler messag current thread base id direct assign ongo assign messag start independ thread ongo easi context provid constraint languag framework low level manag distributor share memori space serv match messag request messag sole interfac agent messag traffic api specif messag request request return messag receiv return traffic queue request messag base combin thread syntact form permit action remov acquir messag blackboard mark read prioriti set determin order match request set persist termin number match servic thread agent thing distinguish thread request prioriti thread set higher prioriti agent level pool reserv highest lowest prioriti servic direct messag agent clean act interfac transport modul rest facilit gather transport carri send request applic fairli complic multipl protocol formul plan deliveri aid address pursu unspecifi period creat bottleneck messag traffic problem agent system call kn develop kn hierarch scheme similar spirit dn agent sequenc agent sequenc denot registr agent agent regist form maintain multipl ident repres role system multipl registr agent network agent identifi fill gap agent maintain multipl contact inform agent chang locat leav forward arrang messag migrat dynam group format support kn easili extend support mobil agent varieti transport protocol final segment url provid static locat inform base agent registr chain address cach hold agent address order lookup cost cach support level provid high avail unsuccess address queri trigger underli kn lookup block access individu list support kn transpar intellig address cach messag path compon trace path receiv messag number arc figur refer messag receiv connect thread transport modul figur process messag transfer directli input queue wait uniqu thread manag target messag input queue advanc messag enter distributor intern blackboard messag distribut distributor turn match messag pend request order prioriti match messag queue queue point agent gain access messag servic attend blackboard request servic thread pick messag queue perform send repli assum arrang repli request distributor messag messag direct trace path previou incom messag distributor messag captur outbound messag request remov messag queue assign idl send thread result send proce avoid bottleneck due variat deliveri time send thread transport modul transmit messag figur depict typic design agent agent commun main thread serv primarili start direct collect servic thread servic thread interact distributor send receiv potenti main thread servic thread servic thread basic role process broker log messag traffic archiv agent figur applic demonstr agent system support intellig integr simpl busi scenario involv real manufactur manag applic softwar system scenario scenario call rate depict figur occur process time oper machin reduc significantli normal type event action base type oper sever rate reduct action automat busi involv human action simpl record event log complic request reschedul base chang oper rate real applic finit schedul scenario figur agent support manag mechan collect inform oper complet origin comput constantli updat process rate collect inform detect notifi parti current rate chang constitut reduct decid action handl rate chang carri action collect agent assembl support chosen scenario agent speak support servic agent system includ special agent process rate agent mine agent monitor agent activ mine request receiv messag transact data oper complet ga data origin convert kif format ga aggreg continu stream oper complet data comput current standard deviat process time oper make aggreg data agent access monitor receiv agent monitor criteria disturb event process rate notifi agent event occur scenario coordin agent set rate monitor receiv notif rate consult human chang rate action request reschedul determin rate chang make exist schedul imposs meet request sca kqml messag convert format detail intern logic algorithm sca handl scenario report directori assist agent auxiliari agent find person sca consult human find proper mode commun person authent assist agent auxiliari agent sca conduct authent check person interact sca proper author make scenario predic kif predic multipl argument defin content messag agent process process rate chang scenario predic relev inform complet includ start finish quantiti process time oper comput differ finish start time divid quantiti rate predic relev inform current averag rate oper machin product oper rate repres standard deviat period time rate instanc comput constantli updat base stream instanc predic obtain ga predic inform construct rate chang occur base rate call oper rate comput current schedul rate rate chang sca instanc send ga deem request base process rate chang notif consult human maker addit predic complic kif express deal complic scenario agent collabor messag flow agent system figur depict agent cooper resolv rate chang sketch messag flow agent system connect agent shown figur messag flow emploi establish connect sca da aa shown figur agent inform perform design task inform connect broker agent plai crucial role dynam establish commun channel agent inform exchang ba ga provid predic accept predic current process rate oper form rate predic messag ga ba ga ba request recommend ba ba recommend agent provid receiv recommend ga respond messag sca ba recommend agent provid rate predic receiv ba recommend agent accept predic receiv ga messag ba ba send messag ba recommend agent obtain inform send subscrib messag recommend agent sca ba provid current rate send subscrib messag sca kqml kif sca interest receiv instanc rate predic rate effect turn process rate monitor updat rate satisfi immedi notifi sca send messag rate standard deviat evalu prototyp agent system outlin previou section instal ibm boca raton integr center host applic includ run system test successfulli architectur system easili appli handl type except scenario recent assembl agent system manag except scenario applic sequenc addit experi conduct test reliabl scalabl experi support agent ring singl nt machin machin run messag averag entir ring easili handl messag larg size largest test binari imag data half megabyt prototyp system achiev discuss begin essenti manufactur plane execut integr special agent built provid function manag except manufactur agent fill white space legaci applic system commun reliabl scalabl easi develop individu agent minimum commun agent function polici implement model intend kqml polici enforc semant correct broker agent support flexibl collabor gatewai agent interfac agent world applic world make runtim collabor modul ontolog support limit enabl collabor agent legaci system compar exist work work integr environ work zeu dmar base procedur reason system adept retsina attempt provid gener agent construct environ toolkit gener agent architectur work point techniqu commun infrastructur agent unifi architectur agent interfac agent free intern structur share memori lightweight blackboard architectur interact great deal research activ develop agent system manufactur busi applic exampl system includ adept adept busi cool suppli chain manag manufactur integr mention distinguish characterist work explicitli deal real legaci system discuss legaci system principl shen legaci system seldom includ actual implement major differ work li agent collabor achiev cool high level coordin negoti extend kqml support specif negoti network mediat main resolv heterogen subsystem agent system knowledg agent contact system agent polici cool defin differ negoti convent implement intend semant kqml perform base speech act theori level insur assum knowledg agent servic provid announc servic servic request match broker commun match pair open agent architectur power facilit coordin agent activ system facilit work planner base knowledg task receiv agent deleg subtask monitor coordin execut subtask drawback oaa facilit commun center agent commun agent commun directli broker match paper present system capabl support intellig integr manufactur plan manag except busi scenario set softwar agent special quickli assembl gather relev inform knowledg cooper manag system human manag order arriv time deal scenario system test successfulli real manufactur scenario involv real legaci schedul work present repres step effort integr manufactur plan execut research experi extend current work address shortcom kqml constraint requir intern structur benefici common framework agent intern structur singl agent system lightweight blackboard architectur provid flexibl agent agent compon research direct function broker agent make intellig ba current implement conduct broker activ level predic machin interpret common ontolog infer intellig broker develop work object hierarchi make intellig choic current ontolog support limit definit constraint field insur data consist extend ontolog includ deduct rule addit interrel field support complic busi scenario work identifi complex scenario requir interact legaci solut repres ad valu manufactur product manag refer ms architectur agent build shell intellig agent springer advanc plan schedul breakthrough manufactur suppli chain report advanc manufactur ma decemb open agent architectur softwar agent jm mit press linda context integr manufactur softwar intellig perspect plug plai softwar agil spie vol pp methodolog applic journal program support human interact integr manufactur system intern journal agil manufactur composit research caltech project awar coordin share acm confer cooper share perspect weber al draft specif kqml agent commun languag june kqml agent commun languag softwar agent jm mit press al knowledg interchang version refer manual technic comput scienc stanford softwar agent commun acm reactiv reason plan wa organ chang work live manag busi process intellig agent bc expert system confer uk applic intellig agent agent market jen wooldridg semant agent commun languag unpublish phd depart comput scienc electr maryland baltimor august db build distribut softwar system open agent architectur practic applic intellig agent system uk hs softwar overview knowledg engin vol lc advanc engin distribut system practic applic intellig agent system uk agent system design knowledg share report principl knowledg proc intern confer knowledg swartout dan morgan novemb dh manufactur infrastructur distribut intellig manufactur system practic applic intellig agent system uk distribut intellig agent ieee lesson shade integr peter mit press manufactur plan control system york figur caption figur manufactur integr handl except figur integr architectur figur select kqml subscrib figur overview figur agent skeleton figur rate scenario figur agent system rate scenario applic monitor modul determin data sourc establish dataflow monitor modul set monitor spec determin action except occur analysi modul sever except feasibl action applic applic human interfac modul dataflow monitor spec notif except notif author applic consult consult figur erp schedul custom ca gatewai agent integr infrastructur agent commun infrastructur ba data mine agent monitor agent analysi agent scenario coordin agent figur figur start stop start stop figur distributor messag handler space address cach internet transport modul messag queue java thread servic nutshel messag path figur distributor servic thread main agent thread servic thread servic thread servic thread transport interfac oper msg complet rate monitor agent rate coordin agent peopl inform rate request msg inform peopl cell human monitor criteria figur ga ba sca da aa queue queue applic applic subscrib subscrib figur
DB/1319 3 web codd xml victor vianu uc san diego ag web challeng excit journei note road introduct web present area vast opportun challeng web organ connect level web site increasingli power collect link web page distribut internet tempt target emerg xml lingua franca web bring order greatli facilit techniqu manag web inform paper discuss develop relat web viewpoint theori web scenario requir revisit basic assumpt area theori remain valid classic industri continu repres dollar target applic futur web repres opportun scale import junctur theori retain classic focu turn attempt challeng web contribut import part formal foundat leav familiar shore reinvent good sign journei begun make web scenario classic classic coher design system system rigid control environ web escap control collect data sourc work support part nation scienc foundat grant number permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee pod santa california usa copyright acm shape interact flexibl protocol polish artifact web closer natur ecosystem bother tremend function effici provid access data web wide rang applic turn remain extrem valuabl effect design xml queri schema languag heavili influenc commun xml queri process techniqu base underli rewrit rule execut plan relat counterpart paradigm web success robust field tradit framework theori reinvent web scenario data longer fit nice tabl distinct schema data formal data cry complex schema provid richer mechan nest possibl order relat problem gener xml framework classic depend function depend requir navig nest path express queri languag differ significantli relat lack schema lead navig data explor specif entri point nest structur data lead form path express paradigm proven structur queri languag typic provid mechan construct complex answer result class queri neat queri languag close express easi complex queri hard evalu relev tradit mean queri complex size web call corollari rich schema queri typecheck import issu develop internet technolog occur initi leav theori case practic develop principl happen order formal beauti nonetheless emerg child mother child mother ag ag ag mari roi john root person person person figur data graph satisfi wai eleg theoret develop connect xml schema queri tree automata classic theori queri languag intim relat automata theori emerg natur formal companion xml research xml feed back tree automata theori area languag theori connect recur theme paper theori start tackl begin wide rang web applic provid frontier theori exampl manag integr view multipl data sourc technic issu includ queri relat queri optim semant cach emerg web commun establish ontolog metadata relat question deal sourc access limit pattern special challeng interact web commonli applic view sourc special form activ implement workflow model interact custom site repositori web data cope highli dynam natur deal tempor aspect relat data incomplet push pull technolog search engin mix inform retriev techniqu interplai challeng issu address section discuss data includ data constraint section deal queri web revisit classic issu queri complex present main approach queri xml section discuss queri typecheck frontier discuss section section paper mean survei develop theori relat web excel articl serv referenc paper book invalu sourc inform web constraint discuss kind data found mechan describ structur schema constraint data web web fascin target view web huge queri daunt proposit data web global distribut lack common structur mean make difficult locat data relev queri relat inform sourc web virtual object blind men discov central repositori web data retriev crawl local consist fragment rapidli stale uncertainti principl consist snapshot entir web radic queri full access input short mean queri web open discuss side stori web move arbitrari raghavan graph structur web page hyperlink exhibit interest fairli stabl structur properti exploit search engin structur properti find authorit web site identifi advantag stabl pattern chang web excit prospect perspect tractabl altern view entir web singl data exchang web place control environ end web site classic xml wrapper web site provid integr view collect distribut data sourc collect static defin limit commun user explicitli implicitli share ontolog metadata end spectrum server aim extend search engin answer queri entir portion central decentr approach figur relat figur data graph notion data found web focu specif aspect level web find data fit interest graph web page hyperlink focu xml document web intern structur interest provid retriev inform export xml view interact world form provid limit access data xml data abstract data found web motiv applic scientif integr heterogen data data label graph node view object object id atom complex complex object link object label edg atom object data valu intent schema data repres yield flexibl power formal describ data unifi manner figur show data graph relat objectori repres graph figur repres data graph figur note explicit distinct data schema graph variant data model minor differ formal data model object exchang model introduc tsimmi project vehicl integr heterogen sourc lore develop pennsylvania motiv oem model graph model biolog unlik data xml markup origin commun introduc document commun dealer ad ad year model model figur dealer xml document subset sgml xml augment html annot data inform mean present xml document consist nest order element call tag full xml bell simplest abstract label order tree label possibl data valu leav xml document hold ad car car shown figur abstract label tree data valu emerg xml import label tree captur structur xml document xml referenc mechan element simul arbitrari data aspect left formal model xml schema queri languag advantag worth mention xml view object model illustr standard api xml xml document term document object model extens xml dtd flavor web schema schema data flexibl data loss schema schema describ data queri queri optim effici storag retain attempt recov schema inform semistructur data schema data constrain path sequenc label found data graph natur extens data relat schema path found data graph repres relat relat schema ensur uniqu attribut path found data path present requir lead kind schema graph summar path semant base notion simul data graph graph schema simul relat vertic edg label exist edg label turn simul comput effici data graph satisfi schema graph lower bound exist simul ensur sequenc label found path found satisfi upper bound exist simul turn ensur path occur upper bound schema enrich disjunct label wildcard typic schema data provid priori extract data maxim minim schema extract data schema summar path data data guid accuraci extract schema data graph serv lower upper bound satisfactori middl ground interest larg open problem interest problem relat schema extract classif node data graph schema data graph natur defin class node place class node hold maximum simul classif defin datalog program semant upper bound schema defin graph schema data guid anticip repres object datalog approach type classif explor connect datalog simul special case gener connect datalog asymmetr pebbl game schema mark semistructur form data type definit schema languag extend dtd includ found technic report compar present xml schema languag found survei xml schema languag scope paper focu dtd extens decoupl definit structur element dtd extend grammar grammar label element label tree xml document termin symbol finit alphabet label dtd consist set rule form regular express rule dtd specifi label root xml document satisfi dtd deriv extend grammar label rule node label sequenc label children spell word dtd consist rule root section section conc label tree satisfi dtd intro section conc intro section section conc intro conc section intro conc dtd defin set label order denot turn dtd limit schema languag address extens state flux set tree languag defin dtd close union boolean import limit inabl separ type element dealer document figur dtd consist dealer dealer ad ad ad model year model natur car ad structur car ad mechan rule depend context overcom extens dtd provid mechan decoupl element type contextdepend definit structur lead closur defin set tree boolean oper show formal decoupl notion special dtd formal idea element type definit special dtd alphabet finit dtd map set special note induc homomorph word tree tree denot induc homomorph denot special dtd bold letter special dtd tree satisfi homomorph imag deriv tree label tree valid special tree valid respect dtd special alphabet write special dtd distinguish car ad car ad dealer ad ident ad dtd dealer dealer ad model year ad model power altern special make type specif depend context path express extens allevi limit conspicu miss subtyp drawback partial remedi interest aspect specif order constrain children element dtd regular express discuss excess power limit flexibl regular express power practic situat state properti number ad restrict regular suffici understand point view note string alphabet view logic structur vocabulari oe binari relat oe unari relat string repres logic structur oe natur order oe iff oe regular languag defin monad logic logic vocabulari string power dtd requir properti valid string express simpli logic correspond wellknown subset regular call regular build singl symbol ffl complement nice formal fo string proposit tempor logic finit word tempor make statement immedi eventu zip phone email commonli statement suffici turn replac regular languag languag complex problem relat type limit dtd logic augment quantif set lar express lack flexibl order constraint state occur write disjunct express oe permut ng extens xml direct specif constraint impact enrich syntax complex manipul unclear result succinct unord concaten interest basic question connect xml schema hard check valid xml document respect set xml document schema describ set xml intersect set valid document schema turn schema comput discuss effect tool deal remark connect schema tree automata xml tree logic inform review notion regular tree languag tree automaton tree automata devic function accept reject classic framework complet binari tree node label symbol finit alphabet variat tree automata tree automaton finit set includ distinguish initi state accept state automaton label node tree set call transit intern node transit form intern node symbol label state left children label leaf transit form qf chang label leaf symbol accept state comput start label root start state proce label node tree nondeterminist transit input tree accept comput result label leav qf set complet binari tree regular iff accept tree automaton determinist automata automata strong connect regular tree languag similar string case discuss regular languag string defin monad logic structur repres string standard extend regular tree languag defin structur repres binari tree regular languag finit binari tree survei prima faci mismatch dtd tree dtd describ unrank classic automata describ binari tree wai unrank tree encod standard binari tree machineri result develop regular tree languag extend unrank extens unrank infinit tree prove satisfi connect special dtd tree special dtd tree automata power tool understand xml schema languag properti regular tree languag transfer special includ closur decid empti automata techniqu yield algorithm insight process dtd naiv algorithm check valid xml document respect special dtd exponenti size document guess special exist determinist automaton special dtd show valid check linear time singl pass document constraint constraint essenti ingredi classic primari role filter invalid queri schema choic effici storag access method common constraint function depend depend continu import data xml differ framework lead differ constraint properti constraint data constraint emerg data variant depend express path constraint view logic statement atom express form regular express set label data graph state reach path label spell word relat figur data graph figur state depend easili schema data refer reach root path constraint form abbrevi statement stand scenario path constraint natur structur inform web site collect cach inform ullman class case start site path lead object path constraint hold site stanford site constraint ffl state path start site final label lead back site implic problem path constraint core technic issu test path queri replac path queri structur constraint cach inform captur set path constraint amount verifi path end label return sourc queri execut site shown queri simpler termin turn gener implic problem regular path queri decid shown place bound minimum size data graph provid implic tractabl case word constraint form singl word implic problem word constraint implic path constraint word constraint pspace implic word constraint reduc test satisfi fo sentenc decid nexptim improv ptime bound obtain show languag fv vg regular automaton accept construct ptime turn complex path constraint situat path consid start root data graph defin limit scope constraint root intern node reachabl global root path rise constraint mean hold node reachabl root path seemingli benign extens dramat impact earlier decid implic problem undecid word singl present reduct word problem finit extens express relationship relationship student relationship studi interact schema constraint studi shown schema impact constraint implic instanc problem decid case undecid schema constraint xml natur express depend xml document kei constraint part schema xml schema type constraint xml document gener kei constraint depend involv data valu leav xml document valu attribut view leaf data depend refer node valu easili model xml destroi tree structur fo denot fo sentenc variabl ci xml express data path extens case kei constraint formal pair path express identifi element kei constraint appli pn node data valu collect identifi element node reachabl root path node reachabl path node reachabl path valu node note definit separ notion equal node equal implic problem kei constraint harder relat involv reason regular path express recal regular express isol hard restrict path express lead algorithm test implic shown intric interact xml constraint dtd shown satisfi problem kei foreign kei constraint undecid presenc dtd unari trivial classic impact dtd schema formal constraint interest theoret remain larg unexplor survei constraint data xml present constraint data discuss queri web classic theori revolv theori queri languag relat familiar ground queri defin gener map relat relat languag complet express queri hierarchi rang conjunct relat calculu complet languag relat calculu standard yield notion complex class provid measur express web foundat data queri move queri input yardstick express replac relat complet nice match queri complex class queri languag mix declar navig involv limit idiosyncrat form negat express languag hard close composit challeng fascin ride back basic revisit basic element classic theori queri languag data independ gener singl distinguish characterist data separ logic physic level data direct consequ queri answer depend logic level data queri commut isomorph input distinct logic physic level clear url physic queri treat displai inform web page convei logic pure geograph locat web answer queri gener robust notion order issu order plai central role theori queri languag typic lack order dramat impact queri languag express order fixpoint queri express ptime absenc fixpoint express simpl queri pariti set conjectur languag express ptime data view case natur order queri web tend navig explor web hyperlink entri point fix obtain search induc order data limit target queri xml order presenc order mix good queri languag remain demonstr unord data advantag includ potenti queri optim parallel evalu unord xml lead replai mismatch queri languag gener program languag export xml order xml document made arbitrari determin lead inconsist xml view consum xml gener assum order semant elimin mismatch requir enrich xml model accommod mix order unord data queri complex measur complex queri pose web puzzl question queri term evalu difficulti queri complex size consid reason paradigm transfer web hard imagin queri standard complex size web consid reason queri evalu live cost access ship inform network paramount attempt develop cost model factor account cost model distinguish local remot link conjunct languag websql radic put forward suggest web model infinit graph node finit possibl infinit comput potenti larg finit memori model ture machin infinit tape exhaust explor web penal comput draw sharp distinct exhaust explor web control form comput simpl model queri map web infinit root return subset node queri classifi finit comput queri evalu finit time infinit eventu comput queri queri possibl infinit node answer output finit time comput queri queri finit find node reachabl root path length queri eventu comput finit find node reachabl output root iff belong cycl note queri finit answer nonetheless finit comput seemingli queri finit eventu output root iff referenc node clear classif natur finitari analog similar classif appli standard queri languag relat calculu express comput fragment defin express eventu comput queri datalog languag yield standard stratifi express eventu comput inflationari semant turn natur suit express advantag semant queri languag queri languag context web vari depend target data languag aim queri web base hyperlink structur web page languag includ websql languag aim lorel unql struql part strudel web site manag defin link web page view semistructur data input queri languag semistructur data base ambient calculu modal logic mobil recent xml queri includ xslt web xql quilt survei queri languag data xml scope paper survei queri queri languag xml state definit winner fairli stabl paradigm emerg illustr xslt queri consist recent xml queri languag web pattern extract bind set construct indic build answer set bind found pattern spirit conjunct navig flavor extend limit pattern view indic reach variabl root regular path express pattern graph variabl strongli connect root label regular path express case graph tree data valu node explicitli perform data join model data valu distinct variabl pattern bind node input reach path match regular express pattern xml document dtd root section section conc queri document pattern root conc intro variabl bind bind xs xs construct specifi build answer set bind languag output label languag label tree construct languag xml node link node label construct queri pattern answer specifi answer node creat bind bind node label bind node creat express refer skolem bind node link answer consist unnest sequenc section introduct nest queri construct subtleti distinguish xml data ensur output care link output order mechan desir order order induc bind input tree default queri languag queri order input place order condit variabl pattern bound sibl horizont path express languag depth nest construct static determin syntax queri limit make simpl chang xml replac label occur person structur queri flavor tree output obtain modifi input tree languag xslt defin transform complex structur tree notat denot tree root transform express binari tree function defin structur person express queri languag xml data easi languag style mix featur limit style datalog chain queri mix declar navig featur common core monoton lost minor variat regular path express data complex variant close composit languag horizont path express dtd root queri tree satisfi total number bs input express singl queri languag composit extract bs root check pariti sequenc bs horizont path express class queri express languag xml data idiosyncrat lack robust show formal framework convincingli subsum xml tree transduc xml queri tree transduc transduc xml queri languag tree input produc tree output turn tree manipul capabl subsum singl model tree call pebbl transduc uniform framework measur express xml instrument develop static analysi techniqu section transduc typecheck xml queri transduc pebbl mark node tree transit determin current node current exist pebbl node pebbl order number machin place pebbl move remov order limit power transduc pebbl restrict stack pebbl tree order remov pebbl present tree move transduc work comput start place pebbl root pebbl pebbl call current node sit current node current pebbl serv head machin machin decid transit base current symbol current pebbl current node kind move output transit move transit place pick current move current pebbl direct edg move direct transit appli move transit machin enter transit output transit emit label node move input head kind output transit binari output machin spawn comput branch comput left child branch inherit posit pebbl move pebbl independ output node output leaf branch comput halt global machin start singl comput branch output node construct top fragment output comput branch continu comput remain output entir comput termin comput branch termin turn transform unrank tree finit alphabet express exist xml queri languag fragment express transduc extend queri join data requir infinit alphabet transduc easili extend handl data valu found data complex case determinist transduc exist ptime algorithm comput input tree easi actual output size exponenti algorithm produc encod dag case transduc care ptime data complex mean produc infinit set output input tree set regular tree construct ptime size tree automaton accept languag transduc gener formal aho ullman introduc automata devic singl head move start root set tree languag accept automata includ set regular tree open problem strict question transduc simul bottomup transduc reduc open problem fact problem case analog automata express regular languag string automata restrict form consid harel prove lower bound gap succinct express automata turn empti problem automata lower bound model transduc model xml call queri work studi queri languag xml queri differ significantli xml input tree return set node tree contrast transduc return output tree abstract xml languag studi connect extend transduc establish static analysi problem rule shown rang transduc close intersect gener dtd tree regular automata relationship logic regular tree languag studi comput model base attribut consid captur queri return set tupl node input tree main variant consid express unari queri defin formula captur queri defin induct linear depth queri comput parallel random access machin polynomi processor term logic complex suggest attribut grammar provid natur robust queri mechan label tree remedi low express pattern languag base regular path guard fragment evalu effici studi shown fragment express fo extend regular path express formal model xslt defin incorpor featur paramet pass model comput simul extend equal test data valu contrari convent xslt simul feedback automata theori match xml automata theori problem classic formal adapt extend fit xml tree automata defin rank xml document unrank tree requir extend theori regular tree languag unrank tree rise fertil line research formal unrank tree includ extens tree transduc tree automata attribut grammar express mismatch fact xml document data tree infinit alphabet regular tree languag infinit alphabet investig string case transduc easili extend test data data join xml queri languag xml schema languag construct flexibl order mix order unord data xml queri languag turn provid construct order node answer aspect captur tradit tree automata transduc model interest question involv process includ valid respect comput queri special interest process stream xml formal requir automata transduc model perform singl input tree order xml stimul research direct languag trend amplifi success relationship symbiot relat theori theori typecheck xml queri relat typecheck standard relat queri schema result appar syntax queri situat xml result xml queri satisfi target dtd obviou import question scenario typic data user commun common dtd produc xml document valid respect dtd typecheck problem input xml schema queri output schema case relat typecheck problem type infer problem input schema queri comput output schema thing infer algorithm comput minimum requir case infer algorithm sound complet note sound complet infer algorithm solv typecheck problem verifi suffici check decid sound complet type infer standard xml queri input dtd root section section conc queri collect leav input document output consist string parenthesi intro open conc close parenthesi regular dtd dtd extend special abil content element type polymorph relat algebra variant state differ program languag assum input type sound complet type infer achiev restrict case shown style queri data limit select input extend sound incomplet infer algorithm queri complex construct answer approach incomplet type infer type essenti special dtd function defin xml data pattern match regular express perform static typecheck verifi output function claim output type typecheck algorithm write function return result requir output typecheck reject expect languag express function make typecheck applic writer languag implement similar approach languag semistructur data origin type base unord type admit incomplet type infer turn sound complet typecheck perform wide varieti xml languag long queri tree structur input data valu explor transduc discuss subsum tree manipul core xml languag mean type infer input special dtd tree output special dtd transduc shown regular tree tree automaton effect construct typecheck amount check decid limit approach complex typecheck full gener high tower exponenti height equal number gener typecheck prohibit approach restrict case practic interest typecheck reduc empti automata pebbl pebbl power typecheck select queri join queri extract list bind variabl occur tree reduc empti automaton exponenti state limit data valu presenc data valu lead undecid typecheck transduc extend equal test data valu sit empti undecid approach extend restrict class queri data join class consist queri equal test perform independ truth assign equal test consist typecheck actual equal test replac nondeterminist guess truth risk inconsist guess studi typecheck presenc data valu provid fairli tight boundari decid trace twist problem increasingli common scenario relat export xml view data queri map relat tree research prototyp enabl definit xml view relat typecheck problem view gener satisfi target possibl special satisfi integr constraint problem investig abstract queri languag gener problem limit decid establish frontier theori made good start provid foundat queri begin web applic scenario remain provid frontier theori briefli discuss data integr provid integr access multipl data sourc problem assum central import web applic common schema integr data chosen connect sourc integr data establish classif techniqu section connect explicitli defin main wai integr data defin view sourc queri pose integr view translat queri sourc easi effici view materi relationship sourc integr data turn sourc defin view integr data problem answer queri elegantli model queri answer answer queri amount rewrit view interest applic rang queri optim cach investig larg solv relat view queri defin conjunct queri survei framework data specif difficulti sourc limit includ restrict access pattern requir attribut provid access requir rewritten queri origin suffici rewritten queri subset real prefer maxim queri rewrit data xml larg unexplor complex result queri rewrit queri view defin regular path express provid interest approach problem queri answer term incomplet inform view provid sourc form system incomplet set view repres defin answer queri tupl answer set make assumpt sourc open world sourc subset tupl view defin tupl view hidden data web sourc explicitli export data lot valuabl inform hidden web site restrict interfac consist form accur model limit access pattern studi involv complex protocol extract data automat difficult task requir develop formal oper aspect web applic specif gener evalu plan queri integr compar data integr step bring workflow compon pictur recent research start tackl problem cryptographi access hidden data protect data transfer process web privaci includ ident data access bring fore larg unexplor issu integr technolog cryptographi context web workflow interact web site applic govern intric workflow interest includ digit scientif data applic protocol exchang partner transact occur agent interact web site simultan make approach applic order integr data workflow aspect busi model reminisc activ program similar amen static analysi formal model captur interact web site scenario relat transduc state applic relat interact world captur sequenc input relat applic respond sequenc output relat model view machin translat input sequenc relat output sequenc relat site custom interact site input catalog inform product price provid relat system respond input output predic process consult relat updat state inform run transduc consist sequenc input sequenc output gener input static analysi relat transduc studi goal reachabl goal achiev run possibl precondit verifi achiev goal long hold problem complic question slightli flavor verifi tempor properti satisfi run supplier verifi product deliv paid question turn decid restrict relat transduc step explor topic complex scenario interact multipl govern busi model data schema mine mine approach deal larg collect data hold inform potenti interest discov make web prime candid mine context flavor mine depend focu applic data mine concern pattern hyperlink web identifi web commun survei variant data mine involv identifi site interest topic applic data mine web involv sophist algorithm techniqu inform retriev machin learn xml schema mine data format wrap produc larg collect xml data collect hard extract manual altern mine candid dtd collect difficult question balanc accuraci dtd simpl data consist finit set word exact descript set regular larg practic descript relax cost word languag criteria good clear mine regular express pattern discuss survei queri web emerg xml standard data exchang interest servic aim specif collect xml document web approach queri web decentr exemplifi niagara project wisconsin approach interest question relat evalu web queri altern approach central xml data web collect queri central repositori exemplifi xylem project recent central approach complex problem relat refresh answer queri presenc partial stale opportun sophist servic tempor queri xml document queri xml subscript make push pull technolog problem detect manag chang difficult storag complic lack uniform semant attach syntax xml document chang order element signifi chang xml uniform answer case order semant accid due mismatch unord order wrapper gener arbitrari order xml document repres unord inform web repositori interest problem queri xml document incomplet inform explor incomplet inform semant cach inform retriev web mean domain paradigm inform retriev tough competitor plai central role extract inform web search engin mix ir limit framework integr ir paradigm context web remain essenti goal ontolog specif applic provid bridg ontolog provid structur limit miss ir essenti paradigm bring fore descript effect reason classif properti object descript logic fragment includ fo fo nice properti full fo decid satisfi explain reason ontolog tractabl survei descript logic provid order meaningfulli contribut formal foundat theori embark fascin journei basic assumpt classic theori convincingli recur technic theme includ extend conjunct limit form path order incomplet activ featur automata theori emerg power tool understand xml schema queri languag specif xml scenario turn provid feedback automata gener line research web scenario wealth challeng problem theori frontier explor acknowledg author grate serg peter frank luc dan mosh vardi comment suggest refer abiteboul queri data proc page suciu data web morgan abiteboul duschka complex answer queri materi view proc acm page vianu foundat abiteboul kanellaki object ident queri languag primit extend abstract wiener lorel queri languag semistructur data journal digit vianu repres queri xml incomplet inform proc acm abiteboul vianu procedur declar updat languag proc acm page abiteboul vianu regular path queri constraint abiteboul vianu queri comput web theoret comput extend abstract icdt yesha relat transduc electron commerc extend abstract pod aho ullman translat context free grammar inform vianu typecheck xml view relat manuscript vianu xml data typecheck revisit proc acm atkinson al system manifesto proc acm page al inform mediat mix acm sigmod conf page beeri milo schema integr translat structur data intl conf page neven formal model express fragment xslt proc page brin extract pattern relat world wide web webdb page wood regular tree languag unpublish manuscript wood context specif techniqu markup weak arithmet finit automata math logik tan kei xml proc suciu ad structur unstructur data proc int conf page suciu queri languag optim techniqu unstructur data proc acm page weinstein constraint data xml sigmod weinstein path constraint semistructur structur proc acm page weinstein interact path type constraint proc acm page vardi rewrit regular express regular path queri proc acm page vardi queri process constraint satisfact proc ieee page vardi queri process regular path queri proc acm page cardelli queri languag base ambient logic proc european symp invit paper florescu xml queri languag heterogen data sourc webdb page widom tsimmi integr heterogen inform sourc page wang scalabl continu queri system internet proc acm page simeon wrap queri languag effici xml integr proc acm page mediat data proc acm sigmod page ramakrishnan layer architectur queri dynam web content proc acm page den bussch type infer polymorph relat algebra proc acm page suciu queri languag xml page finit model theori springer verlag trip tree acta fan libkin xml integr constraint presenc dtd proc acm fan simeon integr constraint xml proc acm page suciu catch boat experi manag system proc acm sigmod suciu trade relat xml comput garei johnson comput intract shim data mine present futur acm workshop web inform data manag page shim sequenti pattern mine regular express constraint proc page tree languag rozenberg handbook formal volum chapter page schlipf semant gener logic program harel complex result automata logic goldman widom enabl queri formul optim semistructur proc page vardi complex problem logic bulletin symbol grahn mendelzon tableau techniqu queri inform sourc global schema intl conf page gurevich logic challeng comput scienc current trend theoret comput page comput scienc theori answer queri view sigmod hammer al inform tsimmi system proc acm sigmod page comput simul finit infinit graph proc ieee page pierc type xml process languag page pierc regular express type xml int conf function page relat queri comput polynomi time inf weld effici evalu regular path express stream xml data univ washington tech rep automata theoret comput kamp logic theori linear sgml xml content model markup kleinberg commun comput kolaiti vardi constraint satisfact kolaiti papadimitri negat proc acm page konopnicki shmueli queri system world wide web proc vldb page sept web graph proc acm page lee chu compar analysi xml schema languag sigmod lenzerini descript logic relationship intl conf page neven structur document transform base xsl proc page widom manag system semistructur data sigmod milo queri world wide web proc pdi milo integr custom applic vldb workshop technolog vianu typecheck xml transform proc acm page languag variabl math logik grundlagen motwani infer structur semistructur data sigmod chawath repres hierarchi data proc icd neumann locat match tree pattern forest proc foundat softwar technolog theoret comput page neven extens attribut grammar structur document queri proc page neven den bussch express structur document queri languag base attribut grammar proc acm page neven queri automata proc acm page neven express effici pattern languag data proc acm page neven power automata proc page vianu regular languag infinit manuscript queri subscript xml workshop inform search queri digit monitor xml data web proc acm widom object exchang heterogen inform sourc proc icd page papakonstantin vianu dtd infer view xml data proc acm page suciu program construct unstructur data proc ullman answer queri templat bind pattern proc acm page xml queri languag queri languag workshop dive tree proc page verif relat transduc electron commerc proc acm page durbin syntact definit data base manag technic report mrc laboratori molecular thoma logic rozenberg handbook formal languag vardi complex relat queri languag proc page
IR/1320 5 constrain nearest neighbor queri el abbadi comput scienc california santa barbara abstract paper introduc notion constrain nearest neighbor queri seri method answer class queri thought nearest neighbor queri rang constraint nearest neighbor rang queri analyz extens previou implic constrain nearest neighbor queri discuss due cnn queri suitabl wide rang applic gi system nearest neighbor queri multimedia applic develop method answer cnn queri properti advantag prove optim respect techniqu paper superior techniqu shown perform analysi introduct rang queri frequent applic spatial geograph inform system applic data point repres vector locat rectangular geometri easi typic approach gi handl complex shape simplifi minimum bound box emerg applic requir offer user flexibl defin queri type region context digit librari recent gi applic handl queri complex accur polygon numer index structur develop facilit rang search higher dimens includ grid file variant import class queri applic involv spatial data nearest neighbor queri similar rang nearest neighbor queri commonli spatial applic problem defin find nearest data point queri point nn queri span entir data similar comparison base distanc function point gi system applic nearest neighbor find closest citi citi closest restaur current locat imag similar queri find imag similar imag repres featur vector highlight import type queri independ class queri combin defin constrain nearest neighbor queri nearest neighbor queri constrain region type queri target user interest nearest neighbor region bound spatial search nearest neighbor entir data space develop techniqu process constrain nearest neighbor object amount data larger dai structur support index queri process larg data set optim cost queri process reduc number page access queri process larg amount prune search space nn search desir cnn techniqu minim number page access gener avoid retriev unnecessari page rang nearest neighbor queri independ effici index structur develop techniqu build current index techniqu develop queri focu base structur wide successfulli spatial discuss techniqu constrain nearest neighbor merg condit rang nearest neighbor modifi current nn algorithm structur chang underli index structur present exampl applic cnn queri section method answer constrain nearest neighbor queri briefli mention simpl increment nn search nn search rang straight forward approach solv problem sequenti execut rang nearest neighbor queri group common idea method integr method section interleav rang constraint nearest neighbor condit effect show adapt exist nn algorithm process cnn queri effici section prove optim techniqu section evalu integr cnn algorithm compar method section motiv exampl case user enforc spatial constraint nearest neighbor search gi cnn search queri nearest south locat queri point defin regular nearest neighbor point repres locat queri result closest data point queri point satisfi south queri point note regular nearest neighbor queri restrict directli queri result figur illustr queri simpl spatial data set citi store bound data repres point coordin locat queri result queri includ queri coordin queri result set defin repres coordin result queri point distanc function point figur regular nearest neighbor queri point point constrain nearest neighbor queri return queri result note data space bound queri nearest neighbor queri restrict lower rectangl figur figur constrain nn exampl figur illustr queri find nearest citi queri point locat queri result regular nearest neighbor queri result point previou constraint similar previou spatial constraint defin queri restrict rectangl data space note furthest point data set queri point previou queri point spatial connect constraint type constrain nearest neighbor queri user live citi san francisco request find state nevada closest san francisco system defin citi san francisco queri point defin rang state nevada region state nevada defin user geometr rectangl polygon queri find closest point specif rang state nevada approxim convex citi san francisco denot result queri point point result regular nn queri desir defin multipl rang singl nearest neighbor nearest neighbor multipl region vacat place desir region figur show cnn queri constrain spatial region hexagon san francisco nevada figur constrain nn exampl regular nearest neighbor point point nearest restrict hexagon constraint point result nn queri constrain region point final deriv domain inform manag advanc transport system travel pose queri closest restaur mile neighborhood rout region highwai constraint region cover mile left highwai region complic depend shape highwai portion highwai interest straight rang defin rectangl middl highwai complic highwai constrain rang defin polygon present gener model constrain nearest neighbor motiv exampl subset framework develop algorithm nn queri constrain convex polygon primit complex nn queri polygon constraint algorithm answer cnn queri constrain nearest neighbor queri natur involv rang nearest neighbor queri simpl solut cnn queri incorpor sequenc type queri order phase lead specif benefici applic present altern serv comparison integr singl phase approach increment nn search increment nn step comput nearest neighbor increment nn algorithm output nearest point order distanc queri point step check current output nn point satisfi constraint number nearest neighbor retriev point test exclud filter step algorithm continu retriev page regular nearest point retriev satisfi nn constraint regular neighbor satisfi condit retriev closer queri result point satisfi constraint figur queri result constrain nn queri furthest point queri point increment nn search approach consid discard point data set find special case queri region data point avoid queri entir search enforc limit nearest neighbor queri point constrain region nearest neighbor figur step algorithm shown figur figur illustr nn search rang queri approach answer constrain nn queri phase method retriev candid nearest neighbor data point test constrain lead unnecessari access leaf node depend size posit constrain region effici perform rang queri retriev data point test nearest neighbor condit obviou tradeoff size region compar entir data test nearest neighbor compar distanc point queri point constrain region includ small number data point page approach effici previou algorithm integr singl phase approach effici approach merg condit nearest neighbor region constraint phase goal obtain benefit prune search space earli rang nearest neighbor condit requir modif previou nearest neighbor algorithm search entir data space start briefli describ prior nn algorithm develop integr cnn method increment nn search algorithm number point data set test set point test find neighbor queri point retriev nn test return test test st return null nn search rang queri find set point retriev rang queri exclud point fp rg find pn st pg figur increment nn search nn search rang queri overview limit nn approach index structur develop base assumpt point data space group cluster limit minimum bound rectangl turn group form larger cluster mbr defin smallest rectangl parallel axi complet set point face data point level index tree correspond level intern node store pointer rectangl coordin posit mbr note data mbr defin coordin diagon opposit corner effect underli index structur properti facilit knowledg discoveri algorithm roussopoulo al advantag map data space develop effici techniqu find nearest neighbor queri point techniqu valid effect start point develop method accommod larger class constrain nearest neighbor search approach search nearest neighbor queri base prune order reduc crucial part algorithm search space region part queri answer prune comparison involv distanc children node distanc found nearest neighbor candid node lead nearest neighbor remain leav prune search space proxim comparison base euclidean distanc notion shortest distanc queri point mbr distanc queri point furthest point closest face metric ensur minimum bound rectangl data point rang mbr lead nearest neighbor queri point safe discard data point distanc queri point satisfi condit candid set nearest neighbor exist point root mbr discard search space interest support nn queri constrain modifi prune criterion satisfi constraint goal exist index structur nn extend notion prune rule hold illustr necess figur present case mbr region figur case posit mbr respect region mbr fulli partial implic posit mbr li consid constrain search mbr overlap constrain region edg rectangl belong exist data point region intersect region discard mbr nn search mbr edg belong case prune condit case search data space modif mbr edg queri region definit make assumpt data point overlap edg prune rule respect edg mbr edg rectangl region data point comput sole overlap edg note brought measur hold minimum bound rectangl partial constrain search space case boundari search region coincid data constrain problem reduc defin search interest gener modifi method support extend class nn queri present method answer queri constrain convex polygon minim tradit uncondit nn approach shown method answer samet solut access page queri answer algorithm differ wai visit order branch base comparison node partit includ children current branch node visit branch method step compar posit branch case visit node prune comparison branch visit order optim appli cnn algorithm sort node partit list straight base current mbr queri point differ nn method reduc prune power comput cost due useless comparison basic outlin nn search algorithm hybrid method depict figur order extend method support class cnn modifi prune condit constraint region improv prune power nn prune base comput minimum bound rectangl ensur data point includ rectangl queri point exclud search mbr closer queri point data point data point distanc closer queri point nn repres tight bound main discuss mbr partial intersect queri cnn search algorithm initi partit list children root sort partit list list node comput distanc dist queri point dist current distanc nearest node nearest neighbor continu prune add children current node partit list ii prune partit list sort partit list figur algorithm answer cnn queri hold modif section extend exist solut nearest neighbor queri order integr cnn queri process concentr case convex polygon repres larg varieti queri constraint region directli defin convex model region implicitli fall class convex polygon section applic cnn method gi system answer queri type nearest neighbor limit area special case convex polygon queri condit boundari data space form rectangl case worth mention applic cnn method answer nearest neighbor queri solut rnn queri data space equal region line queri point boundari data space restrict line form convex polygon gener note polygon obtain subtract convex polygon convex polygon show appli prune condit nearest neighbor approach lead incorrect result measur necessarili hold case constrain nearest neighbor search discuss order correctli effici prune search redefin minimum bound rectangl constrain region redefin notion assur minimum access figur minimum dimens distanc furthest vertex closest face face figur modif page figur illustr case calcul entir minimum bound rectangl lead dismiss fall face constrain region exist data point extend mean retain prune comput face complet region refer face mbr partial includ includ exist data point constrain area depend ms face includ region simpl test construct infinit line parallel upper lower corner mbr calcul intersect line edg polygon posit mbr corner respect intersect test corner includ edg mbr iff vertic calcul mbr edg explain step assum polygon vertic pair edg region note convex polygon inform figur line equat fulli describ region line line figur construct line note mbr defin low low high high construct line low high obtain parallel intersect edg constrain polygon vertic low low high low line upper corner low high high high line line intersect edg convex mbr vertic region posit mbr vertic respect intersect edg test intersect polygon edg intersect end low segment bound vertic segment vertic properti low low low low intersect edg intersect edg polygon point intersect low low high high point intersect high high posit mbr corner check iff high iff high high iff high high iff high modifi modifi notion lead simpl correct algorithm method optim restrict develop techniqu updat posit mbr respect constraint minimum bound distanc point queri bound algorithm elimin unnecessari page root mbr typic data set fit goal comput constrain nearest neighbor prune search space earli discuss modifi notion improv prune search space figur modifi intersect mbr polygon definit distanc data point greater queri point region subset mbr tighter bound offer nearest neighbor search exclud mbr larger mbr intersect complex geometr fact find intersect rectangl polygon problem comput graphic techniqu effici identifi intersect polygon algorithm sutherland algorithm edg intersect polygon simpli minimum distanc queri point edg memori small data modifi offer simpl effici method answer cnn queri larg data set modifi reduc time proof optim algorithm prove cnn techniqu optim respect number access develop methodolog queri point cnn constrain nearest neighbor cnn jj distanc constrain nearest neighbor queri point queri point defin sphere center radiu previou defin intersect constraint denot figur case page respect case implic posit page page intersect constraint page intersect page intersect page intersect page intersect defin optim cnn algorithm definit optim algorithm constrain nearest neighbor search optim iff retriev page intersect algorithm optim iff retriev page case lemma singl phase integr algorithm optim cnn algorithm proof easi partit intersect access search prune phase algorithm prove minim access partit set algorithm prune page check intersect constraint bound box page prune elimin reason show page case prune algorithm assum access page page intersect constrain comput respect intersect page constrain constrain radiu intersect page constraint intersect intersect partit constraint nearest partit root partit replac search process load algorithm access top partit list point search smaller constrain partit nearest load load algorithm prune partit constrain smaller prune access contradict assumpt perform evalu analyz perform cnn algorithm compar straight forward perform experi real data set data color color imag histogram data set size vector repres color histogram comput commerci data satellit imag textur vector repres textur featur vector imag textur inform block larg aerial photograph comput gabor filter gabor filter bank consist scale orient total number filter standard deviat filter output creat featur vector vector data set pose challeng problem index wide perform evalu index structur similar search algorithm built data set page size leav store disk implement cnn algorithm integr structur compar perform integr techniqu techniqu increment nn check constraint find nn ran cnn queri cost metric number page access cnn queri pick queri point randomli data set constraint region chosen randomli vari select constraint creat rang queri perform experi constraint spectrum averag number point cover constraint smaller edg averag number point cover constraint larger edg smallest constraint experi reason select number point vari select constraint analyz effect constraint rang perform techniqu figur show perform integr techniqu techniqu color histogram data set show side length rang constraint show number page access result queri figur illustr result figur illustr result queri result similar valu color histogram data set skew cluster dimens normal small size rang queri return reason amount data data set cluster pick constraint region fix corner constraint origin vari region constraint size techniqu natur merg number page access constraint cover data cnn queri simpli nn queri entir data space constraint size select rang constraint speedup achiev integr cnn approach queri constraint side length integr approach return neighbor access approach access page integr approach approxim time faster approach speedup queri figur illustr result similar experi data set data data point distribut data space normal color histogram rang constraint bigger color histogram data case cover number data point similar result previou data constraint larg techniqu access similar number page rang constraint side length integr approach access page approach access page queri smaller constraint size reason integr approach outperform techniqu rang constraint side length integr approach achiev speedup approach speedup number neighbor queri constraint integr techniqu achiev number page access rang queri size page access constraint rang size queri integr rang queri size page access constraint rang size queri integr figur cnn queri color histogram speedup techniqu singl phase integr techniqu access page techniqu access page number page access rang queri size page access constraint rang size queri integr rang queri size page access constraint rang size queri integr figur cnn queri textur featur paper introduc notion constrain nearest neighbor queri seri method answer cnn queri suitabl wide rang applic present process condit nn search sequenti separ step interleav phase approach inher properti lead specif advantag constraint nn search rang nearest neighbor queri independ effici index structur develop techniqu build current techniqu develop queri show adapt nn queri algorithm support cnn queri chang underli structur prove integr approach optim respect cost experi data set show integr approach effect answer cnn queri refer ullman asilomar report research acm sigmod decemb kriegel cost model nearest neighbor search data space proc acm symp principl page june kriegel index structur data intern confer larg page seeger effici robust access method point acm sigmod intern confer manag page el su scalabl access context digit librari ieee intern confer advanc digit page kriegel fulli dynam index structur data intern confer data engin march van hugh comput principl practic addison gunther access method acm comput motwani similar search high dimens hash int conf larg data page septemb guttman dynam index structur spatial search acm sigmod intern confer manag page june samet rank spatial proc int symp larg spatial page kamel faloutso pack intern confer inform knowledg manag page kamel faloutso hilbert improv fractal intern confer larg septemb influenc set base nearest neighbor queri proc acm sigmod int conf manag lomet salzberg index method good perform acm transact decemb manjunath dataset manjunath ma textur featur retriev imag data ieee transact pattern analysi machin august grid symmetr file structur acm transact system march faloutso complex rang queri region data store intern confer data engin march vincent nearest neighbor queri acm sigmod intern confer manag page robinson search structur larg dynam index proc acm sigmod int conf manag page el abbadi nearest neighbor queri dynam acm sigmod workshop data mine knowledg discoveri samet design analysi spatial structur addison weslei publish selli roussopoulo dynam index object intern confer larg page
Agents/1321 1 emerg neural comput architectur base neurosci stefan wermter jim austin david willshaw york march prefac book result seri intern workshop project emerg neural comput architectur base neurosci sponsor engin physic scienc research council aim book present broad spectrum current research biolog inspir comput system encourag emerg comput approach base neurosci gener understood present approach comput exibl reliabl biolog inform process system massiv bodi knowledg process occur brain central nervou system impact mainstream comput process develop biolog inspir system involv examin function architectur brain emphasi inform process activ biolog inspir system address neural comput posit comput evid creat gener system book main research area modular time learn memori storag issu consid part modular brain produc larg scale comput human memori manag continu oper failur brain brain comput slow comput element achiev rapid build comput model process design increment learn algorithm dynam memori natur inform process system exploit arti cial comput hope book stimul encourag research area contributor book hundr particip workshop express mark network assist network put tremend ort process publish book epsrc jame fleme support alfr hofmann sta springer continu assist march stefan wermter jim austin david willshaw tabl content comput stefan jim david willshaw mark modular robust imag brain imag neural network john taylor data analysi silk michael herrmann theo emerg modular sheet model comparison weber klau comput investig special interact jame explor interact split process stimulu type john modular special map agent architectur brain organ bryson lynn andrea stein competit mechan visual attent system recurr interact earli vision thorsten wolfgang neumann neural mechan repres surfac contour featur thorsten hansen neumann neuron model minim bilinear gari wood collabor cell build block cortic comput reilli uenc threshold variabl eld model visual cortex martin klau comput neural system evolut alistair rod georg complex function dynam modul kiss time bind role correl fire fast inform transmiss simon stefano segment state entiti implic learn jame henderson tempor structur neural activ model inform process brain roman role anatom basi control principl guido locust synchron oscil excitatori inhibitori group spike neuron david tempor code neuron popul presenc conduct time delai david hallidai role brain chao neural network classi cation word evok brain activ simul studi speed recurr process stefano edmund francesco learn memori storag dynam learn lesson neurosci michael biolog ground recruit learn vicin algorithm potenti plastic resolut appar paradox gari marcu cell assembl intermedi level model cognit christian model higher cognit function hebbian cell assembl spike associ memori scene segment synchron cortic activ andrea palm familiar discrimin algorithm inspir comput cortex malcolm brown christoph linguist comput state space trajectori hermann robust stimulu encod ecient signal transmiss tim paul joel white john comput analog neural step biolog plausibl investig role cortic synapt depress auditori process sue michael role anxieti hebbian learn explor comput neurosci robot john sharkei neural architectur reinforc signal learn autonom robot connectionist proposit logic simpl correl matrix memori base reason system daniel jim austin analysi synthesi agent learn distribut dynam data sourc vasant honavar connectionist stephen catherin hanson author index comput stefan wermter jim austin david willshaw mark hybrid intellig system group centr st peter uk depart comput scienc york uk institut adapt neural comput forrest edinburgh abstract present approach comput exibl reliabl neural inform process system order overcom convent comput system bene characterist brain modular time learn memori storag central nervou system overview incorpor kei research issu eld biolog inspir comput system introduct gener understood present approach comput exibl reliabl biolog inform process system massiv bodi knowledg process occur brain impact mainstream comput epsrc sponsor project entitl emerg neural comput architectur base neurosci initi york edinburgh workshop held scotland england book workshop explor comput system bene architectur process characterist brain process develop biolog inspir system involv examin function architectur brain emphasi inform process activ biolog inspir engin physic scienc research council system examin basic neural comput posit neurosci comput evid creat gener system restrict limit progress made biolog inspir improv system biolog realist model limit term attempt achiev compar brain advanc made understand neuron process level connect system level disagr larg amount inform provid brain imag techniqu mean comput system decad signi growth interest studi brain reason expect exploit inspir brain improv perform system observ bene ts biolog neural system child brain outperform power comput algorithm biolog inspir system grow belief kei factor unlock perform capabl brain architectur process lead form comput architectur inform process characterist brain includ comput system enabl achiev form includ modular inform process encod approach base time learn memori storag kei research issu chapter base workshop kei research biolog inspir system critic er comput scienc research biolog comput biolog neural comput comput scienc architectur inform process form inspir identifi research issu modular good knowledg build arti cial neural network real world knowledg bring system solv larger task associ retriev hint studi brain give idea solv problem human memori manag continu oper failur current comput fast brittl brain slow robust learn properti convent comput brain process brain prevent race condit found brain schedul brain oper central clock asynchron oper brain comput slow comput element achiev rapid brain deal exploit special schedul method natur system achiev learn method learn memori evid network brain level intern state neurobiolog system uenc learn memori build comput model process design increment learn algorithm dynam memori modular modular brain develop thousand year evolut perform cognit function compact structur form region region modular brain view distribut neural network region carri process parallel fashion perform speci cognit function brain group collabor specialist achiev cognit function split task smaller element cerebr cortex biggest part human brain highli region higher level function region modular featur region modular activ requir perform cognit function di erent brain show split charact visual process di erent brain improv visual word identi cation produc modular architectur brain imag techniqu successfulli provid great deal inform region cognit function oldest techniqu involv examin brain lesion held observ cognit de cit lesion approach identifi region involv cognit produc mislead result due natur occur lesion altern imag techniqu contradict nding due culti observ lesion approach technic altern techniqu emiss tomographi function magnet reson imag receiv attent pet examin neural activ brain indirect manner creat imag region cognit task pet identifi region greatest blood brain map blood oxygen level pet good spatial tempor compet limit eeg measur voltag uctuat produc region brain activ electrod posit surfac variat magnet eld establish brain activ exploit sophist quantum devic tempor properti eeg signi cantli pet sensit millisecond major issu investig biolog inspir comput system research manner modul brain interact volum taylor establish approach examin associ region identi ed subtask correl coecient approach incorpor structur model linear associ activ region accept path strength establish correl matrix bridg gap brain imag inform underli neural network activ coupl neural equat basic neuron outcom brain singl cell examin lead identi cation concept neural network relat cortic approach kiss volum kiss develop model interact cortic region ve cortic connect strength delai level connect matrix dynam outlin model cortex reilli identi ed feedforward feedback rout link modul perform cognit function concept region modular brain develop comput system bryson stein point volum robot modular time produc mean develop coordin modular system author show mean make function model modular decomposit volum region modular approach visual attent object recognit visual search system base modul match princip visual pathwai visual cortex perform learn recognit mode biolog inspir comput model contour extract process hansen al hansen neumann base modular approach approach involv feedback feedforward competit interact horizont recept eld orient contract process model depend simpli ed visual cortex region interact region layer larg number cortic descript mutual connect complex weber comput model learn relationship simpli ed cortic area base paradigm maximum likelihood reconstruct arti cial architectur adapt data repres modular cerebr cortex turn detail interpret brain modular kiss al mari built fact cerebr cortex complet block repetit modul cortic column basic layer structur variat cognit function achiev start end cortic neuron region speci integr regist featur reilli column diamet includ neuron column provid reliabl distribut cognit function creat pattern activ time million activ develop result evolutionari function bandwidth sensori system extrem view form cerebr cortex older view context independ kind link formal linguist logic depict view hold brain dynam system predic calculu relev describ brain function model cortex column design point layer structur recurr process approach system inhibitori excitatori synapt connect type neuron neuron inhibitori pyramid neuron pass excitatori signal cell column includ cell kind inhibitori neuron restrict spike pyramid neuron pyramid neuron inhibitori neuron control cell column relat model al visual cortex promin charact neuron primari visual cortex prefer input classic recept eld model combin structur orient column produc full orient column mutual coupl link gaussian pro le driven weakli input research creat model cell made link compart higher biolog plausibl diculti high process time due channel process element compart extent overcom lie seri solut lie algebra creat restrict type model brain consist distribut recurr interact billion neuron lot insight inspir comput architectur gain region column robust import featur brain robust robust human brain achiev recoveri function defect brain loss neuron neuron area function network constant basi recoveri robust depend factor level locat size ag patient recoveri felt patient younger matur approach recoveri complic variabl approach recoveri repair damag neural network reactiv network damag due close proxim injuri stop redistribut function region brain mix evid time repair tissu research found redistribut function region brain longer repair left superior tempor occur numer month injuri restor cortex region critic good recoveri function region inhibit realloc function region al volum brain region cognit function explain remark capac recov injuri process model recoveri model recoveri tissu neural network perform recoveri martin al examin recoveri tissu deep attain subject repetit test model examin robust interact activ competit neural network recoveri decai rate return normal level wright develop modular neural network model train perform function damag vari examin recoveri model incorpor method achiev robust recoveri closer techniqu emploi brain al consid creation neural system dynam adapt comput model produc recoveri adapt achiev produc link model robust function realloc form robust realloc recoveri function al volum biolog plausibl model region cerebr cortex function phonem sequenc creation letter identi cation model base recurr learn learn section model repres cerebr cortex left contribut recoveri level injuri signi grade form dynam robust current comput system time neurophysiolog activ brain random data import tempor associ activ neural popul brain region time featur brain consid critic achiev high level perform alter synapt pair activ signi cantli alter synapt link induct alter synapt pair reli signi cantli rel time onset excitatori potenti produc action potenti disagr import inform encod role plai interact individu neuron form schultz al secondari ring rate research question base tempor spike train critic featur time brain perform fast process slow process element instanc point role plan achiev process al commonli held view fast process speed cerebr cortex approach al contradict view produc model made layer excitatori inhibitori neuron includ recurr process import time comput model architectur achiev cognit function includ vision languag examin brain schedul process locust system desert locust system neural activ interest spatiotempor code featur system receptor cell connect project neuron inhibitori local neuron project neuron inhibitori local neuron group interconnect project neuron depict spatiotempor code made princip slow spatiotempor fast global oscil transient system ne spatiotempor depict biolog inspir model attent consid role plai formul al central oscil link oscil feedforward feedback link approach area act central oscil oscil cortic column sensit characterist attent produc network central oscil oscil henderson biolog inspir comput model segment pattern entiti simpl synchroni network simpl network enlarg simpl recurr network unit period unit activ level phrase period relat biolog inspir model address ect conduct time delai tempor code neural hallidai model cell common independ synapt input base morpholog detail model tree typic spinal tempor code input carri weakli correl compon present common input spike train tempor code output manifest tendenc synchron discharg output spike train conduct delai ms alter sensit cell tempor code present input spike train grow support chaotic dynam biolog neural activ individu neuron creat chaotic ring condit approach brain chao state volum stimuli brain repres chaotic neural object chaotic neural object provid stabil characterist superior inform neural object dynam activ pattern mathemat chao identifi import depict inform brain perform singl word kohonen network classifi word sixteen word class brain repres characterist word frequenc mean measur learn memori storag addit structur characterist brain central nervou system manner learn store memori argu charact neural connect approach learn memori storag brain major impact comput neural architectur signi bene ts school lead elman argu learn underli brain structur modi cation result experi face time model marcu point limit learn mechan innat infant month abil learn exibl necessarili entail learn reli greatli learn neural activ marcu hold lack toolkit biologi put forward approach develop neural network grow er experi toolkit includ cell migrat gene interact gene hierarchi year comput scientist attempt incorpor learn memori storag arti cial intellig comput system typic arti cial neural network system comput element gross simpli cation biolog neuron biolog plausibl indic brain constrain incorpor hanson al volum outlin arti cial neural network recurr perform emerg behaviour close human cognit perform network produc abstract structur situat hierarch extens perform activ learn grammar valid set exampl recurr network recod input defer symbol bind receiv sucient string sequenc synapt alter achiev learn memori storag region brain fundament learn memori storag cortex area involv shown describ model role learn system cortic subsystem found tempor lobe fundament role memori storag transfer memori cortex nal locat memori rst account learn occur model brain store memori simpl synapt approach base cell assembl cortic process alter synapt strength approach persist memori repeat memori retriev determin assembl connect structur neuron lend support anoth ring greater probabl reliabl fashion cell assembl found work memori storag interact cell assembl substanti amount work learn memori potenti growth synapt strength rapidli short period synapt stimul close notion alter approach strengthen link devic reduc synapt strength depress volum comput abstract greatli simpli ed process involv creation cell repres neuron integr activ arriv cell ring normal model relat burst reaction normal mode relat basic spike reaction made isol spike identi ed critic episod memori role model structur fast product cell bind match made entiti bind area role entiti felt primari cell bind million cell role entiti area match bind area biolog inspir model cell assembl system system made network neuron cell assembl link neuron neural network model connect strength alter local hebbian rule learn approach model learn recent model learn arti cial system interest base neurosci learn method mcclelland goddard examin role system learn biolog inspir model forward pathwai associ region cortex creat pattern activ cortex preserv knowledg pattern cortex input memori recod manner suitabl storag model split main invert encod memori storag retriev memori decod system learn process outlin volum simpl biolog inspir comput model model requir determin action potenti learn rule produc reli integr product potenti determin ectiv current equat passiv membran mechan biolog inspir system learn includ show system improv exist technolog sharkei develop model combin memori anxieti produc novelti detect robot robot er knowledg learn approach make alter anxieti behaviour explicit learn robot biolog inspir approach base learn al biolog plausibl algorithm familiar discrimin base energi base inform process cortex system approach assumpt relat distribut pattern discrimin pattern present knowledg familiar pattern weight hop eld network relat biolog inspir system learn found group hop eld network inspir cortic column grid network base interact nearest neighbour approach model individu network state discret transit synchron state alter grid carri asynchron fashion biolog inspir system natur languag understand sequenti process freeman work brain mean approach process compon output train nonlinear reaction modul excitatori inhibitori neuron creat oscillatori feedforward feedback link modul foster chaotic local learn mechan hebbian learn achiev modul pearc al argu system er ideal model examin issu robust sensori signal transmiss ecient inform neural system critic featur system larg scale converg spike receptor stimulu thousand fundament inform greater sensit typic inform approach cortex action grade rate code tempor code studi consid depict input restrict qualiti signal recov bulb outcom probabilist spike train grade receptor input auditori percept characterist brain capabl detect growth loud di erenti click close base nding result manner inform primari auditori cortex cortic synapt dynam repeatedli activ react manner incom produc depress facilit great deal activ amount resourc period recoveri neuron model input neuron model gain sum synapt examin model reaction featur neuron incorpor dynam close primari auditori cortex al set biolog inspir approach knowledg discoveri oper domain distribut constantli grow size approach achiev learn distribut data process data techniqu al distribut increment algorithm attempt determin inform learner ectiv approach provid distribut increment set split learn activ inform extract hypothesi product stage enhanc current learn approach perform distribut context hypothesi product element control part inform extract compon occur aim research develop system learn interact dynam system knowledg discoveri activ model memori storag section provid outlin biolog inspir model connect memori storag brain palm similar approach network willshaw extend base biolog neuron palm ad characterist repres spike action real neuron addit characterist integr individu cell model time potenti level threshold action potenti creat palm model associ memori includ model reciproc connect visual area area made neuron popul region input pattern match input object visual eld depict bitmap area visual made spike neuron inhibitori gradual neuron area visual model spike associ memori biolog inspir model episod memori outlin transient pattern rhythmic activ depict event alter persist robust memori trace creation memori trace match recruit complic circuit system includ requir element order analysi characterist model perform examin plausibl valu system variabl outcom displai robust memori trace produc assum episod memori capac event made bind argu machin model recurr neural network process biolog network perform continu time method memori postul produc natur biolog plausibl approach comput found recurr neural network input output function variabl neuron tempor reaction encod indirect manner machin sigmoid chang network amount research carri austin associ york memori storag work volum correl matrix memori austin simpl binari weight feedforward neural network task er indic memori store human cerebr cortex close singl binari weight neural complex learn recal algorithm doubt current comput system perform cognit function languag process level brain strong architectur inform process characterist improv system interest biolog inspir system grown signi cantli approach simplist understand brain system level limit kei research issu biolog inspir comput system relat fundament architectur featur comput scienc learn biolog neural comput characterist brain potenti bene system includ modular time learn memori storag modular brain form abstract includ central biolog inspir system robust brain abil recov function injuri tissu repair function brain region convent comput system present base clock process system potenti enrich base inform process encod time approach brain chapter volum fertil research area develop biolog inspir comput model learn memori storag perform cognit function move eld biolog inspir comput system architectur featur brain modular time learn memori bene perform comput system suitabl level abstract produc system identi ed nding er neurosci research understand constraint er comput hardwar softwar greater concentr dynam network architectur alter structur base experi elabor circuitri constant network modi cation understand brain central nervou system critic achiev biolog inspir adapt comput system refer role brain chao emerg neural comput architectur base neurosci neural network classi cation word evok brain activ emerg neural comput architectur base neurosci austin distribut associ memori scene analysi intern confer neural page san austin match perform binari correl matrix memori sun uni ed hybrid approach lawrenc erlbaum associ austin okeef applic associ memori analysi document fax imag british machin vision page austin associ memori imag recognit analysi imag vision uenc threshold variabl eld model visual cortex emerg neural comput architectur base neurosci role recoveri case studi binder function magnet reson imag languag cortex intern journal imag system familiar discrimin algorithm inspir comput cortex emerg neural comput architectur base neurosci tempor structur neural activ model inform process brain emerg neural comput architectur base neurosci bryson stein modular special map agent architectur brain organ emerg neural comput architectur base neurosci role anatom basi control principl emerg neural comput architectur base neurosci pet studi recoveri stroke acut brain honavar analysi synthesi agent learn distribut dynam data sourc emerg neural comput architectur base neurosci model higher cognit function hebbian cell assembl emerg neural comput architectur base neurosci relationship synchron neuron popul activ level neural competit mechan visual attent system emerg neural comput architectur base neurosci dynam learn lesson neurosci emerg neural comput architectur base neurosci investig role cortic synapt depress auditori process emerg neural comput architectur base neurosci jm data analysi emerg neural comput architectur base neurosci comput cerebr neural elman origin theori emerg page lawrenc kiss complex function dynam modul emerg neural comput architectur base neurosci comput analog neural step biolog plausibl emerg neural comput architectur base neurosci cognit neurosci research domain brain brain activ silent word gener evalu function mri brain mari modular achiev proper memori retriev intern workshop current comput architectur integr neural network page cognit biologi mind ww compani neuron model minim bilinear emerg neural comput architectur base neurosci neural network model cortic function base comput properti cerebr cortex journal physiolog hallidai tempor code neuron popul presenc conduct time delai emerg neural comput architectur base neurosci hansen neumann neural mechan repres surfac contour featur emerg neural comput architectur base neurosci neumann recurr interact earli vision emerg neural comput architectur base neurosci hanson connectionist emerg neural comput architectur base neurosci organ behaviour henderson segment state entiti implic learn emerg neural comput architectur base neurosci explor interact split process stimulu type emerg neural comput architectur base neurosci current carri ion membran giant cell assembl intermedi level model cognit emerg neural comput architectur base neurosci sharkei role anxieti hebbian learn explor comput neurosci robot emerg neural comput architectur base neurosci palm spike associ memori scene segment synchron cortic activ emerg neural comput architectur base neurosci brain plastic contribut brain austin connectionist proposit logic simpl correl matrix memori base reason system emerg neural comput architectur base neurosci marcu plastic resolut appar paradox emerg neural comput architectur base neurosci sa dell recoveri deep evid relat auditori verbal stm capac lexic error repetit brain comput system neural mcclelland goddard complementari learn system perspect oreilli complementari learn system insight success failur connectionist model learn memori prospect retrospect studi recoveri cerebr blood ow languag function linguist comput state space trajectori emerg neural comput architectur base neurosci evid chao spike train neuron gener rhythmic motor pattern brain research okeef austin applic adam associ memori analysi document imag british machin vision page ft neural associ memori associ process processor ieee comput lo simul studi speed recurr process emerg neural comput architectur base neurosci robust stimulu encod ecient signal transmiss emerg neural comput architectur base neurosci neural architectur reinforc signal learn autonom robot emerg neural comput architectur base neurosci comput investig special interact emerg neural comput architectur base neurosci reilli collabor cell build block cortic comput emerg neural comput architectur base neurosci introduct cognit page psycholog east comput neural system evolut emerg neural comput architectur base neurosci bind role correl ring fast inform transmiss emerg neural comput architectur base neurosci comput model episod memori format inspir system intern workshop current comput architectur integr neural network page biolog ground recruit learn vicin algorithm potenti emerg neural comput architectur base neurosci abbott competit hebbian learn depend synapt plastic natur mind model act mit locu synchron oscil excitatori inhibitori group spike neuron emerg neural comput architectur base neurosci taylor imag brain imag neural network emerg neural comput architectur base neurosci roll comput analysi role memori turner austin match binari correl matrix memori neural wise mechan recoveri evid emiss tomographi studi journal weber emerg modular sheet model comparison emerg neural comput architectur base neurosci recoveri emiss studi ann palm cell associ memori tempor structur brain signal time conceptu advanc brain vol academ willshaw approach arti cial intellig mind tran soc willshaw buckingham assess marr theori temporari memori store tran soc associ memori willshaw dayan optim plastic matrix neural lau marr theori neural network neural willshaw von der malsburg pattern neural connect set tran soc wright connectionist simul brain kennedi high perform classi er binari correl matrix memori advanc neural inform process vol
IR/1322 5 internet search neci research institut develop metasearch engin improv effici web search download analyz document displai result show queri term context context page analysi improv web search steve lawrenc lee gile nec research institut popular search northern maintain index world wide web reli singl standard search engin limit standard search engin limit outdat unavail due problem network engin standard engin result vari gener focu handl queri quickli simpl rank scheme rank keyword page rank order relev page obviou load find queri term metasearch metacrawl attempt contend problem limit coverag submit queri standard search engin primari advantag metasearch engin combin result search engin present consist user interfac metasearch engin reli document summari return standard search engin inherit limit vulner keyword spam develop nec research institut metasearch engin improv effici web search download analyz document displai result show queri term context user readili determin document relev download page techniqu deal web poorli organ result neci engin return progress page download page download page download parallel juli august ieee ieee internet comput context page analysi ieee internet comput juli august result typic displai time standard search engin displai neci metasearch engin nec research institut articl describ perform recent studi verifi advantag summari incorpor queri term context studi found user work summari found relev document faster perform relev judgment accur rapidli user work abstract document summari summari greatli reduc user access full text document neci metasearch engin figur show simplifi control flow diagram neci metasearch consist main metasearch code parallel page retriev daemon page retriev engin web alta vista excit send request page hit engin displai document queri term context immedi displai summari statist search engin parallel page retriev engin user enter queri modifi engin wait page retriev engin page search search engin send request web page analyz document displai cluster page meet displai page retriev maximum hit hit document meet displai figur simplifi control flow metasearch engin internet search juli august ieee internet comput incorpor featur queu load balanc multipl search delai request site prevent overload site figur show main search form neci metasearch engin user search engin hit amount context displai number engin support common search includ boolean syntax metasearch neci metasearch engin dynam modifi queri match search engin queri syntax user control amount text neci engin displai number charact show side queri term improv engin omit charact partial word begin end charact count sought improv context displai extract logic sentenc fix number charact user find method superior includ full sentenc screen space summari significantli improv user abil determin relev neci engin return result progress download analyz result necessarili displai order list individu search order approxim web search engin good relev rank begin differ document rank problem user figur show sampl neci metasearch engin queri bar top user switch view search link individu engin result queri provid specif queri format suggest queri proper shade bar left document titl close queri term document singl queri bar shade close term top document inform document titl show engin found document document refer document ag specif express form inform web duplic express varieti form inform express inform retriev search express inform succe neci engin recogn transform queri submit form question queri phrase form specif express form queri nasdaq stand transform queri stand inform express form inform exist satisfi queri techniqu trade recal inform experi effect retriev task web figur show neci engin result queri nasdaq stand answer queri local context displai page standard search engin queri answer document home option feedback neci meta search engin web usenet web usenet journal tech imag link main ag quot figur search form neci metasearch engin context page analysi ieee internet comput juli august list engin list support natur languag queri amount easili access inform viabil techniqu extens implement defin order stand find answer engin fall back standard queri search view main rank duplic page titl identifi search engin provid result site partial suggest summari search hotbot infoseek altavista excit lyco northern light yahoo digit opportun digit client strong interest call data digit technolog technolog emb ownership data digit digit specif order give site project articl relat digit work area digit feel free articl relat digit work area digit fell free ill happi digit digit patent digit technolog digit patent digit page quick overview basic nec announc ventur compani market multimedia announc establish ventur compani market digit softwar technolog protect copyright multimedia dvd versatil protect copyright multimedia dvd versatil content nec digit refer digit technolog enabl user perman digit satellit digit cabl nec pioneer develop digit intend market leader multimedia content secur state digit catalogu digit catalogu figur sampl neci metasearch engin queri figur neci metasearch engin queri nasdaq stand search stand nasdaq hotbot infoseek altavista excit lyco northern light yahoo oct nasdaq abbrevi nation associ secur dealer autom quotat system oper regul nasdaq stock market market nasdaq stand nation associ secur dealer autom quotat system ga electr nasdaq stock stand nation associ secur dealer autom quotat servic act exchang regul law canada mean report system secur meet definit nation market system secur oct nasdaq abbrevi nation associ secur dealer autom quotat system internet search juli august ieee internet comput neci metasearch engin techniqu number queri engin recogn exampl convert stand convert creat transform interest area research learn implicit explicit feedback techniqu reli engin abil search phrase typic word word filter tradit inform retriev system web search engin vari stop found filter phrase basi prevent engin return page phrase result rank steve kirsch rank scheme underli search engin modifi return addit time term occur document entir neci step unnecessari download analyz actual page appli uniform rank measur document return engin engin displai document descend order occurr page engin displai document maximum number queri term found page engin document simpl relev measur measur consid number queri term proxim queri term frequenc document frequenc equat page queri queri term found term distanc start page number queri term document term count total number queri term minimum distanc jth queri term measur number constant control magnitud document relev constant specifi maximum distanc queri constant specifi import rank criterion web search web larg search multipl term return document term unrel term exist bookmark bookmark page page engin displai top page rank term proxim figur engin displai addit duplic context result cluster document fewer search page download displai summari tabl result engin queri suggest subsequ sidebar user describ ad featur import metasearch engin categor page duplic normal url neci metasearch engin consid page duplic relev context string ident duplic page header singl mail list messag archiv place page match queri neci engin download analyz actual appli uniform rank measur document return engin context page analysi ieee internet comput juli august import engin relev engin return poor relev lead poor result standard metasearch engin metasearch servic provid featur typic turn default return result page check document displai figur show sampl document ari ari technolog ari technolog industri leader digit deal protect intellectu properti wire featur proven copyright digit project paper cross valid digit multimedia secur multimedia secur digit duplic context string site cluster search term uk canon eo mail list bui ph error found queri word queri digit digit digit error found review commun search engin altavista page page page page page page excit page hotbot page infoseek page page lyco page northern light page page page page yahoo document download suggest document ad extra term higher summari engin altavista excit hotbot infoseek lyco northern light yahoo total total retriev process duplic document found maximum number hit reach figur addit includ duplic context result cluster page displai queri complet internet search juli august ieee internet comput search link top jump occurr queri term number occurr queri term text link term link highlight user quickli identifi page relev neci engin track queri result page automat inform user match document found page modifi neci engin form cach engin cach download page limit time queri term link ad demand engin cach top result queri user repeat page displai exist queri term implement neci metasearch engin implement server oper nec research serv user client implement improv scalabl disadvantag process memori updat client modif made metasearch engin client implement cach benefit resourc requir neci search engin roughli order magnitud bandwidth search engin bandwidth requir limit number user simultan implement requir great requir web audio bandwidth access time internet continu improv engin necessarili analyz page queri web grow queri prototyp engin run pentium pro written optim effici queri execut time prototyp analysi typic slow time limit perform analyz time search northern light median time queri engin queri made engin median time engin respond similar advantag gain download web page hit result median time neci engin receiv page parallel architectur improv user queri analysi queri half show queri term show total simpl queri gener thousand match document poor built neci engin suggest queri improv user queri engin combin queri term phrase suggest phrase threshold queri term engin suggest requir engin stem queri term search page morpholog variant found suggest term ad queri suggest aim improv improv recal suggest user introduc phrase term requir counterintuit tradit inform retriev suggest exclud relev document web pose inform retriev problem pose tradit larger lower ratio web search trade recal number document improv percentag queri number term figur distribut number term queri context page analysi ieee internet comput juli august neci engin analyz page faster standard search engin standard engin download analyz current content page analyz time engin displai relev result queri median time relev result median time relev result figur includ queri return target number neci metasearch engin demonstr download analysi page match queri call web search engin download web page neci metasearch engin displai result quicker standard search engin metasearch engin web neci metasearch engin reli underli search engin import valuabl servic wide metasearch engin requir arrang underli search arrang includ pass ad system numer area futur research neci engin collect full text match good test bed inform retriev research area work includ queri relev feedback summari user assess relev view implicit feedback success improv relev automat relev learn specif express form area includ page classif extend search techniqu acknowledg eric kurt adam bill bob roi john steve jame lanc anonym review comment suggest refer selberg search comparison proc www onlin lawrenc cl world wide vol van rank queri inform gather agent queri web search tech report comput scienc colorado state fort selberg metacrawl architectur resourc aggreg ieee feb pp jump digit page massiv link organ link page specif give site project articl relat digit work area digit feel free ill happi put list figur sampl page view neci metasearch engin queri term link user occurr queri term internet search juli august ieee internet comput reflect user inform queri doctor dept comput univ st retriev network rank relev score comput client multipl patent patent automat text analysi retriev inform addison weslei internet perform keynot system show busi jan steve lawrenc scientist nec research institut nj research interest includ inform machin neural face speech time seri natur languag award includ nec research institut excel prioriti award telecom australia engin success prize annual australian mathemat competit lawrenc receiv comput electron system queensland phd electr comput engin australia lee gile senior research scientist comput scienc nec research adjunct professor institut advanc comput studi colleg park research interest applic neural machin ai area comput editori board ieee intellig ieee transact knowledg data ieee transact neural comput intellig parallel distribut neural neural appli optic gile fellow ieee member intern neural network optic societi center discret mathemat theoret comput rutger contact lawrenc gile nec research independ nj relat work idea queri collat result multipl compani pl dialog veriti long ago creat system integr search result multipl heterogen exist web metasearch includ infer highwai internet webseek quick review metasearch work area report text retriev confer special interest group inform retriev confer research relev measur includ term proxim research search engin improv result rank includ laser googl engin structur html page hyperlink inform determin page relev googl text link page descriptor page descript page page googl rank algorithm call base rank analysi number page point page benefit metasearch appli improv search displai queri term context import determin page relev result rank improv refer selberg search comparison proc www onlin gr mega search vol pp posit test proc intl acm sigir conf research develop inform pp onlin hawk proc fourth text retriev dk onlin architectur optim web search proc aaai workshop inform onlin brin anatomi hypertextu web search proc www onlin
IR/1323 5 tailor interact user web store anna dipartimento di di torino itali abstract describ user model person techniqu adopt prototyp toolkit construct adapt web store custom interact user web store creat suggest item fit custom adapt layout descript store catalog prefer stereotyp inform handl user model appli person rule dynam gener hypertextu page present product system adapt graphic length terminolog descript paramet user interest maintain model person good select multipl criteria appli tailor select item prefer user person inform custom web adapt approach person electron shop introduct popular web shop heterogen custom good access web catalog reli intermediari trend concern tradit domain movi rang bank servic electron power trade user inform altern advantag order compar identifi satisfi constraint discuss user softwar system differ prefer reason enhanc usabl applic extrem import factor account commerci tool creation web microsoft ibm net paper user model kluwer academ person interact custom enhanc establish relat contrast typic interact support electron commerc tool offer function identif item match user prefer tailor suggest good individu user adopt techniqu person present select typic present web catalog user issu central enhanc prefer select item satisfi abil requir filter identifi item suit specif includ catalog page target custom base select basi interest life style individu user access user prefer type inform provid interact style custom softwar hardwar connect web account facilit access navig web store user select altern media deliveri depend effici connect web altern media exploit deliv inform peopl special issu tailor inform user deepli analyz adapt hypermedia major distinct made person navig task person descript dynam adapt hypertextu structur user background tailor interact user web store dynam gener text tailor user analysi electron sale reveal issu address web user assist catalog select item system track rememb item data identifi real addit suggest product suitabl descript explicitli carri relev inform comparison base user individu evalu criteria enhanc system properti greatest impact custom highlight convinc bui item gener exploit inform filter research collabor term document select interest item environ heterogen inform sourc inform user billsu burk resnick fink techniqu suit deal inform retriev work shown specif techniqu appli person interact custom electron commerc fact inform partial structur describ recommend system structur movi exploit custom suggest item system analyz custom identifi product attribut affect inform custom select item suggest author dont includ system knowledg mean attribut relat exist approach support effect strategi person descript item select inform present system gener label museum item summar inform store record inform consist unstructur natur languag system exploit nlp techniqu interpret text gener summari deep analysi content basi gener person user interest requir applic complex nlp techniqu exploit detail domain problemat system instanti type object present work describ user model person techniqu adopt prototyp toolkit creat adapt web store tailor interact featur possibl suggest item fit prefer demo prototyp store creat store present telecommun phone rest paper concret describ function system support person suggest item present style adopt interact custom system evalu close item match user prefer suggest present style select relev inform product custom descript improv flexibl web store interfac introduc initi person layout catalog person concern basic paramet background color font face size page system present paper offer subset person function list section flexibl suitabl exploit knowledg techniqu support declar descript strategi exploit knowledg develop approach enabl extend enhanc configur sale domain paper structur section sketch system architectur section describ detail user model techniqu adopt section present strategi suggest item section describ person strategi layout content catalog page section report detail experi made test system section close paper tailor interact user web store session manag user product product extractor person agent dialog manag shop cart manag product taxonomi umc stereotyp kb figur architectur rectangl repres agent knowledg repres oval architectur custom store complex activ requir type knowledg user techniqu person layout content catalog complex softwar architectur exploit technolog manag complex effect multiag system agent offer special servic exploit heterogen interact produc complex servic jen architectur includ set special devot activ carri adapt web store design identifi basic role fill support person interact custom agent obtain architectur shown figur figur show complet system architectur situat user browser visit store parallel shortli describ descript architectur found session manag handl commun time user connect perform action web session manag catch action forward dialog manag session manag forward web store page user browser session manag servlet identifi action hypertextu click catch http request dialog manag maintain dialog context handl logic interact custom agent decid page shown basi dialog context action perform follow hypertextu click user model compon initi updat user model interact product extractor select product item rank suggest person agent dynam gener custom page web store shop cart manag track item select user item put cart displai updat content total amount monei pai shop cart group item basi user direct product user db manag handl product user product db inform good technic user db record custom visit includ good previou visit custom explicitli requir author system maintain data subsequ visit user db inform peopl long term storag person data web store support addit parallel execut task interact singl agent handl data activ user session figur show activ context repres shape denot session hidden simplic agent retriev knowledg declar knowledg base custom class relev sale domain defin stereotyp exploit umc handl user model product taxonomi store relat event tag exploit paramet hyperlink tailor interact user web store descript product specifi relat similar product basic product relat product offer function integr solut web store creat configur knowledg base inform depend sale domain knowledg base web store defin graphic interfac guid design definit data multiag architectur system implement voyag distribut agent enabl commun mean asynchron multicast messag web store connect internet mean apach web server focu activ agent person product extractor person agent manag knowledg user user model compon user model compon creat maintain user model custom access web store case distinguish custom visit web store inform prefer characterist recogn interact custom regist data previou descript gener user db initi user model start interact detail inform custom visit store regist data perman system creat maintain user model user consid custom subsequ visit system store data user db peculiar web shop correctli person system deal direct indirect user custom item peopl prefer requir product imagin young student present system person interact style direct tailor select inform good qualiti descript young student effect select gift system custom suggest good prefer intend student good model person interact style suggest good system user inform adopt person strategi interact start navig dynam page displai user product inspect good select perform product categori categori correspond root product taxonomi answer phone user select repres commit specif good user express compact end answer basi system guid user portion catalog relev good figur show page initi select product user top page introductori prompt explain user select product categori inspect navig catalog button demonstr product central area page show main product categori destin desir home offic unspecifi lower part user find button good direct click similar page desir identifi nicknam protect ident indirect user user select product drag relat icon drop multipl select user select phone fax inform destin interest determin prefer product properti home strict constraint cost offic influenc technolog level unspecifi relev user select gift peopl nicknam tag navig context select product tailor interact user web store figur page select product categori search phone select multipl product start parallel navig context web user inspect product categori item system separ track navig order monitor navig separ behavior describ section catalog page section activ interact path summar user link offer switch user carri multipl navig interleav manag user model umc creat direct user model tailor product present select good custom visit web store creat user model parti good model suggest good suit person intend direct user present style tailor direct user model indirect user subset inform store direct user omit user featur influenc present style rest inform type describ user model direct user user model custom regist data user db initi load record user db model custom creat initi prefer gener user system model inform collect user model refin monitor custom behavior appli user model acquisit techniqu effect inform behavior exploit stereotyp inform custom speed umc compar initi user data set describ characterist main custom class identifi sale domain comparison made exploit set person data job educ request user registr form result comparison exploit predict user prefer interact style product describ stereotyp knowledg section structur user model characterist relev person interact vari sale domain identifi perform market analysi design umc user model configur web store instanc user model fix set configur attribut defin specif web store fix part user model includ inform user characterist relev manag store user recept capabl absorb larg amount requir layout web describ user capabl read small text fix part includ user technic aesthet evalu user familiar product sale domain fill registr form inform store user datum maintain system work memori user perman store data close interact tailor interact user web store concept provid abstract descript person rule base approach simplifi configur web store support gener person rule custom present style limit user interest domain product telecommun product user good familiar configur part user model includ descript user prefer product properti figur sketch user model instanti paul user model main type identif user famili person data ag job user characterist custom interact style group type inform singl call prefer product system decid item suit user inform classif user stereotyp custom class inform explain section identif person datum simpl user featur prefer repres complex paramet slot list interpret probabl distribut linguist valu paramet user featur linguist valu user overcom maintain simpl manag user recent modifi explicitli describ user interest product categori store number concept includ user model correspond number product categori product answer phone famili person educ high user technic aesthet user life domain figur user model telecommun domain prefer defin store design set linguist valu decid set linguist valu tailor interact user web store number linguist lv user featur denot system estim likelihood shown figur likelihood paul domain medium high equal number linguist lv prefer denot system estim likelihood user prefer product lv properti likelihood paul prefer easi product relat prefer prefer describ system estim relev prefer user evalu good import rang mean prefer total mean extrem import paul user qualiti product import extrem import properti stereotyp knowledg umc retriev knowledg user stereotyp knowledg base hierarchi stereotyp cluster properti homogen custom group approach adopt italian assum correl identifi set user typic includ set user prefer structur stereotyp main set classif data individu belong repres user predict describ user featur prefer typic individu classif data evalu close individu custom visit web store match stereotyp predict basic data fill predict part user model user popul partit custom group similar prefer properti product qualiti cost identifi custom life style number sum order interpret probabl distribut linguist valu relat paramet popul partit account prefer properti product classif user model extent user familiar product categori store stereotyp kb includ multipl segment call stereotyp famili famili partit popul includ set repres class user similar characterist famili set classif predict profil predict part stereotyp belong famili famili overlap data relev segment popul defin stereotyp famili user domain distinguish expert custom telecommun domain novic life famili segment custom popul basi data support predict graphic interfac famili describ user prefer graphic properti store color background readabl text web page destin distinguish home busi involv prefer product properti famili describ set partit custom popul basi reason good stereotyp descript make explicit refer user underli goal relat shown figur classif data domain user job educ level predict concern user featur domain technic aesthet prefer product properti novelti design cost item correspond real concern evalu tailor interact user web store novic user predict user domain technic figur portion stereotyp telecommun domain structur stereotyp describ structur stereotyp refer figur show portion belong describ characterist custom telecommun domain profil stereotyp profil stereotyp defin inform evalu close user match descript stereotyp user belong profil set classif data compat linguist valu descript user class repres stereotyp datum compat linguist lv number correspond percentag individu belong lv class novic user predict part predict part describ featur prefer typic user belong custom class stereotyp predict number linguist lv repres likelihood lv predict user belong class stereotyp classif user classif process determin close user match stereotyp result process match repres number repres perfect match user repres null user typic custom stereotyp umc evalu close user match stereotyp match user classif data profil classif datum separ consid obtain individu score score combin calcul final match user evalu individu score classif datum linguist lv user individu score set compat lv profil piec repres ag job user user model linguist valu user compat valu score score notic linguist valu classif data set user model basi user answer registr form order respect user system forc answer evalu individu data miss omiss classif data make evalu match stereotyp evalu match famili stereotyp umc evalu user match respect stereotyp famili normal result valu make sum user match stereotyp evalu combin individu score classif data score merg appli formula score tailor interact user web store ag normal match figur match stereotyp score score score score score score score match user figur summar result match evalu stereotyp set job ag individu score definit figur repeat tabl reader line report score line report score valu ag line show match obtain appli match function individu score job line show final match obtain normal valu comput match sum notic evalu match case classif gener case formula associ function evalu fuzzi classif combin score multipl individu score contribut match conjunct notic match stereotyp account set classif match null datum total incompat profil requir deriv mean compat datum linguist valu relat compat repres percentag peopl belong stereotyp fit novic user percentag user belong stereotyp stereotyp import low medium high novic intermedi expert figur stereotyp predict prefer match stereotyp close user match rest profil predict user featur prefer umc fill predict part user model user likelihood linguist valu user featur merg predict stereotyp stereotyp kb stereotyp belong famili make predict set belong famili make predict disjunct set data adopt approach simplifi system fill part user model independ predict stereotyp belong singl famili assum addit evalu weight sum valu suggest weight user match stereotyp idea predict inform user basi similar user class user exploit user commun linear combin stereotyp predict appli system exploit user model famili prefer product figur report inform predict stereotyp user prefer classif process produc match predict import prefer null compat valu make datum plai role strict neg trigger stereotyp tailor interact user web store predict predict evalu linguist datum user result number sum interpret approxim probabl distribut datum comment comment evalu base fuzzi probabilist approach multiattribut analysi comparison probabilist approach custom class mean likelihood user belong class evalu match user data profil stereotyp match correspond probabilist evalu profil classif compat linguist valu stereotyp compat repres percentag peopl belong stereotyp fit specif datum percentag novic user work condit probabl specif datum approach clear advantag manag uncertain decid adopt approach fit requir store defin stereotyp kb stereotyp kb web store defin graphic configur enabl design introduc knowledg write java code design defin person data user prefer describ user individu web store defin inform process gener user model templat templat umc creation user defin stereotyp stereotyp stereotyp famili approach support easi elicit inform expert develop telecommun web exploit gener inform custom experi relat project domain expert feel comfort describ custom class type inform requir defin relev data approxim percentag peopl fit linguist valu novic user deep knowledg custom provid italian bank develop prototyp system recommend configur knowledg transfer easili similar successfulli domain physician configur knowledg base diagnost expert system probabilist requir definit numer depend user data distribut probabl altern class stereotyp famili user probabl novic expert user data datum influenc stereotyp famili store design requir identifi depend data defin matrix condit probabl relat user data stereotyp specif complex intuit requir deep knowledg probabl store design comparison multiattribut analysi evalu match user data decid exploit fuzzi match multiattribut analysi approach enabl system rule mismatch stereotyp effect multiattribut theori base addit evalu item calcul score weight sum individu contribut carri attribut item notic approach model human rate altern tailor interact user web store carberri decid close user match contribut classif datum stronger impact support match account classif presenc total incompat data repres extrem strong evid hypothesi user belong user class stereotyp datum receiv null individu score drastic impact match bring minimum stereotyp exclud pool stereotyp make predict user model multiattribut neg valu provid select valu support discrimin power difficult multipl formula make task produc score rang constrain interv contribut evalu process match null function comput fuzzi set minimum evid multipl notic minimum function consid contribut datum function support stereotyp minimum score function rest classif inform account produc match multipl similar function lower valu sensit cardin set score combin evalu match altern rank basi amount individu score number multipl reduc evalu greater number score high function maintain higher evalu score good match stereotyp famili evalu basi set multipl formula present formula evalu techniqu part compar item potenti set data multipl mislead system produc evalu altern stereotyp inform comment concern stereotyp perform detail analysi sale domain determin characterist custom group difficult inform typic design product select inform exploit custom behavior web store immedi set automat techniqu appli learn stereotyp case background knowledg custom store design user data prefer uncertain compat linguist valu issu explor research develop adapt system user model pohl complex issu definit solut exist major issu user model server identif inform user demograph data privaci user behavior share domain successfulli exploit heterogen system work automat acquisit assum store design manual stereotyp notic identif stereotyp famili simplifi task knowledg destin specif telecommun user life describ user featur prefer relev domain web target custom base dynam user model exploit stereotyp knowledg enabl system obtain fairli special user model user fill initi registr individu user differ stereotyp predict reason order address notic work acquisit inform share behavior work develop constrain definit action analysi log file produc gener excit identifi gener user trend user behavior current trend provid inform gener usabl support effect person strategi tailor interact user web store extend umc updat user model interact user action web store catalog captur session manag monitor analyz behavior dynam featur prefer identifi inform user interest prefer carri type action perform web store technic inform item posit inform user technic interest descript product featur inform domain inform item click evid user recept higher expect ad item shop cart suggest inform user prefer product system monitor amount scroll movement discuss inform evalu user interest content displai postpon analysi main page produc fulli displai user browser structur page button link push user inform activ monitor user action navig structur leav activ secondari sourc inform investig futur work navig umc maintain work memori relev user action period analyz event histori obtain descript user action type collect inform fed evid bayesian net model depend user behavior featur prefer result evid propag process repres system belief user featur prefer exploit relat data user model detail inform dynam user model techniqu exploit provid suggest good user product extractor handl inform product catalog item product agent retriev record match user queri phone product rank sort depend close match prefer store model person receiv sort list present item section user prefer concern product properti qualiti system suggest user item satisfi prefer leav impact individu featur item presenc absenc agenda evalu assum user prefer inform rank item product presenc strict constraint handl item identifi offer mandatori user prefer consid sort item result list prefer basi knowledg product categori item structur domain explicitli knowledg base call product conceptu catalog defin product relat inherit net taxonomi defin product rang admiss valu type defin restrict number defin mean featur gener exist function aesthet featur product categori set repres offer function gener size color addit descript product set prefer store user product db inform individu featur properti item web store item classifi product categori defin product taxonomi fax answer mean record specif inform individu featur properti record item store rang featur record color answer machin model grei black tailor interact user web store record record lit lit figur record item product db linguist fit item figur show descript answer evalu item product extractor umc prefer good rank item evalu close match prefer score item correspond match properti item number repres fact item mismatch user repres perfect denot item recommend user comput match evalu match item user properti separ check close match relat user score properti merg produc evalu item similar classif user contribut properti merg exploit multipl enabl system easili exclud mismatch match evalu basi set properti properti receiv null score item evalu item differ classif user stereotyp famili evalu account set user assumpt made item concern inform properti item product score comput user prefer lack inform item weaken system abil identifi item partial toler repres user user stronger weaker prefer product prefer impact evalu suitabl item item mismatch extrem import user prefer mismatch irrelev properti recommend item suit user match import possibl ignor irrelev mismatch properti issu handl formula merg individu score properti discuss section issu properti receiv individu score repres accept user score equal mean properti perfectli compat relat user prefer likelihood user model extrem properti irrelev import prefer user model extrem contribut downgrad rate item null individu score mean properti import user incompat prefer individu score receiv properti combin fuzzi product extractor exploit formula section evalu close user match profil stereotyp properti individu score score score item calcul score score score score score score describ import user prefer account evalu individu score properti tailor interact user web store import score figur evolut individu score properti basi import account import user prefer section prefer product properti type import prefer likelihood linguist valu import describ strongli prefer influenc user likelihood linguist lv approxim probabl user prefer product properti prefer product order import user prefer individu score properti comput combin import relat user prefer likelihood linguist properti individu score merg mean fuzzi formula neutral multipl irrelev properti receiv score close reflect user influenc properti match import user prefer score properti likelihood user prefer product properti high item properti linguist fit item product extractor user model import prefer likelihood linguist individu score comput figur impact import properti evalu score score bernoulli formula score import impact extrem influenti score properti total irrelev prefer prefer extrem import individu score relat properti evalu score figur show import properti influenc evalu individu case properti case repres solid likelihood linguist properti user model case properti likelihood import properti influenc result score equal higher valu respect likelihood import individu score import individu score valu close relat likelihood exact score comput exampl shown figur column report valu show likelihood score comput properti fourth column show valu comment product extractor comput score sort present match item displai section formula score sensibl downgrad match item tailor interact user web store item qualiti cost design facil figur individu score properti good discrimin enabl system rule item receiv null individu score properti null individu score assign properti item extrem import mismatch user prefer advantag respect formula evalu fuzzi set flexibl evalu item set inform properti item partial product item rank exploit inform system altern item evalu account set properti cardin item properti fulli evalu fair respect partial section discuss fact fuzzi match formula accur minimum minimum individu score joint condit result fuzzi sensit number score combin evalu item rank basi number receiv high individu score item largest number properti risk rank downgrad fact number combin paul user shown figur descript item shown figur figur report individu score receiv properti score obtain appli formula import likelihood relat store evalu base inform present record lead system ignor data potenti essenti evalu datum import properti mismatch user item rule paul model score suggest paul slightli prefer result obtain evalu score item multipl individu formula evalu score assum inform item properti assum item miss multipli individu obtain ffl full inform ffl partial inform item inform appli formula individu ffl full inform ffl partial inform item result show formula evalu item consist paul prefer item compar basi number properti item compar situat product db report full inform partial inform applic formula enabl system recogn item multipl individu score return match estim item formula return match consist paul figur compar set rank obtain multipl formula graphic tailor interact user web store ind score match formula multipl figur rank item mean multipl formula simplic individu score properti compar result appli grow number properti result grow number formula higher valu multipl rank sensit number evalu properti item combin basi signif number rank produc slowli produc item compar basi formula produc similar compar result person present person agent dynam gener html code catalog tailor content layout characterist individu custom page gener content determin basi valu featur prefer store user step interact custom catalog main select content select layout content concern amount type inform includ portion page layout concern graphic aspect background color number item singl page link structur catalog person agent offer partial item product categori present list sort user sequenc item present heterogen user set link enabl user catalog move product categori fix correspond relat product defin product taxonomi restrict drawback logic structur underli product categori user correspond store design view relat product categori enhanc consist web user visit catalog present hypertextu structur gener catalog page type page gener support navig web store begin system displai registr form user person system show page user select product detail user link item page dialog manag select type page produc request person gener code page send back dialog carri interact custom person agent exploit kind inform gener depend type page present product focu page describ item product interest custom viewpoint person agent inform gener web set item present inform featur inform retriev product taxonomi product db intern structur decid hypertextu link includ link product relat focu attent tailor interact user web store figur page gener system present answer machin user interact context user select memori product page store context maintain dialog track user focu attent user store user exploit select graphic aspect amount type inform technic descript person page altern color depend user featur item present select content includ page tailor user interest select linguist form descript tailor user inform content present depend user characterist structur page describ item describ person techniqu custom present outlin structur page figur portion web catalog page shown figur describ featur item present page describ answer machin shown figur portion page show pictur featur item repeat figur readabl shown figur catalog page split displai contextu navig control central area page devot descript item link inform topmost store link main product categori store leftmost portion page system displai activ interact path enabl user switch path repres dialog ffl target user product home busi inform displai mean icon select good product mari offic ffl initi enter user main product categori interest system track choic provid label link categori user initi select answer machin phone categori tailor interact user web store ffl visit dialog user move page present initi product categori page describ product show item system displai inform label figur label present context show user move initi page describ item current context highlight label replac user page present item answer machin central area describ function featur offer present item area depend user system assum user troubl inform provid describ item figur list item page displai area devot descript ffl pictur price ffl button put item shop cart ffl button displai technic detail item ffl descript featur system show subset link ad list lower area descript button link ffl link list ffl button displai list item current product categori user list descript specif page item link ffl button creat custom comparison user creat tabl select good examin featur avoid examin precompil compar item product categori basi featur ffl link back page describ product categori displai item link label refer page describ answer machin ffl bottom gener control link site map select content page describ item portion catalog page part depend interact context left area report user select depend product decid repres current focu attent content top bar show main product bottom bar fix page person interest area describ specif system tailor number featur order technic level linguist descript individu user person agent exploit set rule custom descript featur item oper sort featur basi relev user interest import descript item decid featur basi user recept fall limit link page mean button select linguist form basi user produc html code portion page describ task detail evalu relev featur assum relev featur depend main user interest object import featur descript item paramet item descript focu inform interest import featur dont fit user interest perfectli tailor interact user web store defin featur part user model technic featur repres technic inform print resolut technic featur fax function featur repres inform function offer agenda function featur phone aesthet featur repres gener inform color size gener featur includ miscellan price item featur product taxonomi type import type classif defin categori featur import denot object import descript imp low import imp medium import imp high import featur item rank combin import user interest addit score imp interest imp import interest calcul basi user interest categori featur belong interest user interest interest user interest interest user interest user interest retriev user probabl linguist relat user featur refer figur paul interest technic featur interest aesthet featur high weight formula tune influenc type inform evalu score featur store design configur depend user object import influenc evalu strongest item featur rank appli formula result sort list partit group equal score element evalu amount inform displai user user exploit tune length detail descript item depend system estim user abil absorb inform measur length descript term featur shown page number featur present appli sort featur list linguist set threshold describ maximum number featur gener situat maximum number featur specif item calcul account threshold number featur ffi threshold level user recept probabl linguist relat user ffi cut featur list flexibl fall insid group equal score identifi featur shown ffi enabl system extend restrict number featur shown assum user recept high number equal rank featur greater group featur shown principl underli person system omit highlight interest sort constrain descript relev inform present portion page describ rest list reachabl form adapt detail inform tailor interact user web store select linguist form linguist form present featur select basi user approxim probabl linguist user model simpl descript produc user low domain technic typic produc expert user version descript complet order separ specif mean featur descript structur part includ paramet express featur valu system extract product db valu featur offer item gener complet linguist descript fill placehold linguist express valu parametr linguist descript featur valu featur color extract product db paramet replac linguist descript difficulti level basic depend technic difficulti level relat linguist valu medium technic descript user domain select altern straightforward descript answer store receiv messag secur enabl listen store messag digit storag digit marker medium high complex level featur boolean item offer digit linguist descript featur posit offer neg descript simpli omit presenc altern descript requir introduct variant simplest tune languag user model descript digit memori low level explain featur simpl term descript high level short assumpt expert user digit memori system configur parametr descript level configur web design decid interfac tailor linguist form user parametr descript introduc difficulti level develop tool support configur store interfac tool automat descript introduc design level default store design descript digit store messag digit tool descript level design accept store work digit memori concern altern descript level includ redefin parametr descript valu domain gener descript step select content portion page devot descript item final html code gener exploit set layout packag section special marker includ highlight relev featur group featur highest score mark displai minor featur mark shown smaller font rest page comment custom product descript produc person agent differ set present featur order featur linguist style adopt descript tailor interact user web store figur detail present page describ answer tailor expert user compar figur fragment shown figur gener novic familiar telecommun low recept high aesthet interest figur fragment shown figur extract page present answer machin recept interest technic detail page simpl technic term show featur aesthet characterist descript figur technic descript includ featur page differ select displai descript inform featur figur shown figur sort differ featur hidden shown select descript link inform user necessarili follow link read hidden data discuss section constrain number displai inform item benefici recept short descript dynam gener catalog base inform provid declar knowledg sourc product taxonomi product avoid maintain multipl static version suit type adapt hypermedia dont store eleg profil technic medium aesthet high high life averag layout set centuri medium figur layout packag inform content page adapt user granular level individu product featur import redund altern parametr technic level latest version improv gener natur languag gener techniqu produc sentenc describ featur flexibl classif featur type descript user interest inform type support exploit rank techniqu applic sale domain approach requir introduct complex knowledg base explicitli repres domain concept inform appli person techniqu featur definit type import descript featur type defin relev technic sale domain suffici system extend modest effort select page layout layout suit type model current system select packag format catalog page layout packag altern layout differ background color font tailor interact user web store packag readabl inform suit elderli peopl packag includ bright origin font big pictur suit young peopl packag color classic font packag suit custom sensit pleasant present color font simpl pictur small packag suit custom interest technic aspect product describ intern layout packag definit shown figur gener catalog page figur prof il section set user featur exploit select packag featur correspond subset characterist interest defin user model except explicitli refer classif user stereotyp belong section user figur datum linguist valu compat packag layout set section definit describ imag html code page construct dont describ data evalu layout packag layout packag rank calcul match profil relat data user model linguist valu compat packag consid likelihood valu retriev user model datum compat score compat maximum likelihood select score packag calcul appli formula evalu individu score data datum total incompat user packag receiv null evalu likelihood linguist datum correspond match user relat report part user model select layout packag evalu altern layout person agent select match includ layout set html code store page content user model chang layout remain fix user exit web store provid coher view catalog person aspect person aspect influenc layout page present item number model shown page number configur store design valu level user defin user model current prototyp displai model page user recept low figur high number model page strong impact amount inform provid page length page longer page richer inform produc highli recept shorter simpler gener recept peopl comment decid datum profil layout belong system custom life style import factor determin life style exploit select style exploit factor layout basi inform provid set includ object user subject user tast import life assum sale domain custom popul segment basi viewpoint profil layout packag total life style consid specif store design easili modifi definit packag gener html code catalog page person agent gener final html code catalog page put html fragment portion page final step code system produc structur insert fix part tailor interact user web store retriev intern html tag repositori insert background color font set provid select layout packag includ portion html code produc area page person electron commerc system subset person techniqu exploit improv web store strategi ad enhanc system deliv textual inform media exploit improv usabl custom technic user special lifelik charact activ interact user special provis web store anim exploit basic virtual realiti prefer focu qualiti descript produc leav present care descript product featur opinion central requir domain sale telecommun product sale possibl user inspect shape short movi show crucial improv present account exploit monitor essenti recogn user prefer media custom layout present evalu current interfac interact style function result comment suggest involv subject evalu telecommun prototyp perform set laboratori evalu system real user prototyp real web peopl user select item put virtual realiti critic aspect portabl effici system concern shop pai behavior fulli select good concern report result test describ consequ system describ initi result test phase carri interfac paper conclud comment complet type applic system shell applic person server test phase collect inform behavior heterogen involv comput scientist peopl belong human prototyp make comment interact graphic present flexibl understand test carri system basi collect inform test check impact user summari result user complain initi registr person inform provid inform main ffl skip initi fill partial ffl request inform person individu session perman user author system end session accept registr form similar form typic provid servic critic issu select product categori user inspect specif relat good inform essenti tailor suggest good actual introduc overhead interact form introduct solut requir tailor interact user web store user separ answer long list question limit burden design select page shown figur page enabl user select multipl product multipl straightforward larg reduc number action user perform notifi system select critic aspect interact user concern hypertextu visit product section catalog structur determin product reflect store design view sale domain necessarili match user viewpoint user problem find navig path led desir product order improv clariti structur higher level describ product categori lower level describ item specif categori higher product page synthet describ function offer present product categori offer type link item categori enter lower level lead relat product categori link enabl user quickli user provid overview main function offer product check detail descript individu item present item user appreci person descript suggest interest item user introduct tool enabl bypass present order establish system access good direct system suggest user introduct tool compar evalu item extend interfac web store ffl extend page present item ad button complet list item belong product categori button enabl user directli request present page specif item ffl introduc possibl dynam creat comparison user effici item featur comparison work carri applic domain identifi user feel control interact switch system undesir result experi identifi order enabl user bypass system ad enabl user directli access page present specif enter web catalog custom navig mode function final solut repres step balanc system user control interact test phase organ test carri test involv pool select heterogen user share familiar web navig peopl enhanc version correspond addit descript featur item introduc summar properti item answer machin introduc econom medium qualiti low technolog level easi sentenc descript featur offer item shown figur main issu identifi test phase refer experi made user select peopl belong user class check reaction system person strategi extrem case experi carri collect inform behavior relev number user cover user class gener result experi suggest interest aspect relat layout qualiti descript interact style report interest profil user group switch dynam user model function maintain static user model verifi impact stereotyp inform predict user featur prefer tailor interact user web store peopl typic low educ level user web store search phone home young peopl high educ level dynam challeng work peopl catalog search fax offic stereotyp predict group summar typic user group low domain technic interest recept interest simpl econom medium qualiti low technolog level strongli prefer easi econom product typic user group high technic interest recept highli technolog qualiti import properti cost import valid stereotyp inform compar predict user featur prefer evid collect monitor behavior user interact system user free requir close select item depend user real case perform action function system offer comment type amount inform product provid qualiti linguist descript appropri system present order featur item concern result experi user belong group user group acquaint simplest telecommun technic domain approxim low estim number page visit number link explor inform medium case low navig behavior notic peopl path lead page describ phone inspect page found item typic click button technic creat comparison compar price interpret behavior avoid distract action peopl reli heavili system capabl tailor descript knowledg appreci descript item fact relev inform detail inform option attain link user read inform activ navig displai leftmost portion explain inform consequ limit navig catalog singl path item target singl inform inspect item central rightmost portion page peopl carefulli read describ properti item strongli reli descript select item compar confirm descript properti evalu item analyz technic complex featur notic user compar technic featur offer select base price descript produc system page present item result experi user belong group user group good telecommun domain fax high technic knew technic featur item domain approxim high recept displai mark technic interest navig behavior catalog activ click button comparison tailor interact user web store path hypertext maintain singl navig search fax explor page describ product inform activ context displai leftmost portion page confirm carri singl activ navig path switch navig path contextu inform summari provid link back initi select product tend ignor descript properti individu featur found descript properti answer gener trust qualit descript explain inform autonom infer descript featur item admit reason product familiar descript select select good check featur compar set featur consid import price technic analyz item offer featur progress exclud found devic featur superior aspect user small number compar altern item read relat present page creat comparison tabl check featur time result describ behavior type common user belong user group page select product custom inspect specif good effect bit problemat user problem interact modal user type interact simplic consid destin intuit user icon drag refer figur user drag product icon destin icon show upper part page system describ action ignor locat lower portion page solut problem ad select page button start short anim demonstr show select product destin redesign ambigu part page address introduc duplic icon user exploit shop cart temporari memori store interest item decid put altern item cart order subsequ prefer user appreci fact shop cart displai select item destin type present clear shop cart pictur item select item result analyz select good sort list present system interest fact check complet list item present solut satisfi order check rank power user select item examin item good initi skip admit number accept present solut degrad part present list evalu criteria user complain difficulti view pictur item read descript featur user prefer button creat comparison view list item check user group select item coupl user select sixth tailor interact user web store shop cart content displai top order attract user attent effect layout packag satisfi requir applic domain type test parallel initi carri peopl involv develop base provid servic develop small system work person server web exploit user model person strategi tailor detail level present user domain interest instanc present servic bank area system tailor suggest invest fund individu account factor disposit famili small prototyp base architectur guid user knowledg base inform cultur heritag area torino comment previou mention improv system import concern definit layout custom background font catalog exploit structur catalog page wai contextu inform portion describ properti option page layout futur redesign layout packag account evid collect experi usabl criteria suggest relat experi hypermedia feedback collect experi stereotyp knowledg exploit telecommun order possibl improv inform predict initi featur prefer custom develop prototyp instanti applic domain valuabl feedback concern improv prototyp simpler telecommun experi gain design develop enabl improv flexibl configur order enhanc applic domain adapt server introduc person select experi bank domain identif type dialog base presenc product base negoti product aim identifi specif item satisfi user integr function futur work user model person techniqu exploit shell support construct adapt web store system demonstr type techniqu appli electron sale goal interact task requir applic techniqu develop user knowledg interact research area web store realworld method robust usabl aspect pragmat approach develop system system maintain detail user model inform user prefer characterist store model initi mean stereotyp inform updat interact basi user behavior user model exploit dynam gener web page tailor system custom descript vari graphic basi featur direct interest recept system maintain model person user select good support user select suggest item suit prefer respect direct user tailor interact user web store rank item contrast exploit recommend approach superior evalu match user prefer properti requir explicit relev feedback previou custom exploit stereotyp inform prefer relev custom class support attribut prefer custom immedi connect web store futur plan investig benefit implicit relev obtain analyz properti select acquir inform product custom feedback obtain user rank observ behavior appli data mine techniqu discov hidden inform navig histori relat individu user descript stereotyp class acquir inform custom special offer acknowledg work develop project carri dipartimento di informatica torino nation initi grant telecom grate simon torasso contribut work suggest develop system anonym extend paper improv clariti detail fruit comment refer probabilist user profil ai magazin commun interact media multipl lifelik charact present system proc int conf intellig user interfac pp agent architectur person web store proc int conf autonom agent pp applic person techniqu server www lectur note artifici intellig springer pp interact user electron shop proc int conf user model pp gener adapt web catalog lectur note comput scienc adapt hypermedia adapt system springer pp configur system construct adapt virtual store world wide web user model web store shell proc conf ecai pp versu exploit learn user model text recommend user model interact interact data plan cluster approach proc ijcai pp inform patient cancer proc intern confer adapt hypermedia adapt system pp solut usabl problem user model interact person agent learn explain proc int conf autonom agent pp adapt hypertext read system user model interact techniqu adapt hypermedia user model interact approach assist ieee expert pp cognit perspect user proc workshop system user model world wide pp util model user prefer collabor consult dialogu comput intellig tailor inform citi visitor proc intern confer adapt hypermedia adapt system pp adapt featur virtual realiti interfac proc intern confer adapt tailor interact user web store hypermedia adapt system pp technolog digit tv world proc conf ecai pp document gener natur languag text demand proc int conf workshop expert system applic vienna de reactiv adapt hypertext gener proc conf ecai uk descript italian popul review analysi commerci user model server person world wide web user model special issu deploi user model adapt inform includ disabl elderli peopl review hypermedia multimedia navig histori recommend proc int conf intellig user interfac pp user interest observ normal behavior proc int conf intellig user interfac pp build consum trust accur product recommend gener document tailor individu patient proc conf user model pp provis task techniqu proc ijcai pp roadmap agent research develop autonom agent system kluwer academ pp multimedia present fun proc world wide web confer australia temporari user model approach adapt shop web proc workshop adapt system user model world wide web pp user model movi compar studi user model interact li pragmat approxim user proc conf user model pp multipl prefer tradeoff john wilei son user conceptu knowledg user model shell system comput intellig hypermedia present techniqu improv onlin custom relationship knowledg engin review adapt hypertext client user model system proc conf user model pp combin expert system int journal studi assess user prefer autom travel assist proc conf user model pp user expert model longterm observ applic usag proc int conf user model pp comport gain social accept perceiv polit societi work note user spring symposium aaai report pp hypertext user proc acm confer hypertext hypermedia pa gener dynam hypertext environ proc australasian comput scienc confer pp assist develop diagnost expert system domain independ packag acquisit expert medic knowledg proc annual symposium comput applic medic care pp probabilist reason expert system john wilei net percept learn user model system user model interact learn techniqu acquisit user stereotyp commun proc int conf user model pp mine usag data web site work note user spring symposium aaai report pp object descript user level comput linguist probabilist reason intellig network plausibl infer san morgan kaufmann publish learn knowledg approach user model proc int conf user model pp techniqu user model sale assist user model interact approach recommend select base past prefer user model interact templat proc workshop natur languag gener netherland varian special issu recommend vol commun acm user model kobsa wahlster user model dialog system springer pp special issu vol tailor interact user web store domain interfac design adapt educ hypermedia proc workshop adapt system user model world wide web pp survei excit user internet electron network applic polici intellig agent ieee expert diagnost problem solv north oxford academ approach user model hypermedia offic document system user model interact person travel guid plan proc intern confer adapt hypermedia adapt system pp agent electron power trade proc electron commerc agentlink barcelona
Agents/1324 1 system emerg process manag john comput po box nsw australia abstract system manag emerg busi process agent system gener architectur gener agent architectur architectur architectur cope plan goal develop mutat agent system action basi estim likelihood choic lead estim cost make choic introduct emerg process busi distinct product workflow emerg process opportunist natur product workflow routin emerg process inher distribut involv asynchron parallel work amount emerg process gener process advanc task involv emerg process typic predefin emerg process develop task typic carri collabor group individu emerg process manag system oper distribut environ emerg manufactur process trigger introduc product line emerg process manag emerg process pose problem typic found manag product workflow featur emerg process identifi goal emerg process creat initi goal express high level process advanc process goal refin mutat emerg process activ trigger quot termin achiev price product inher difficult estim cost time complet partli due emerg partli due lack prior knowledg type task invok process prone failur strategi manag work time expect work time manag strictli relat individu involv work group peopl work group mission critic execut senior staff progress independ manag system process advanc made peopl lunch featur place demand manag system emerg process emerg independ emerg process suggest manag system attempt process busi process manag establish applic area agent technolog process agent architectur develop system earli prototyp system chosen process place demand process manag system process agent architectur trial busi process applic administr system emerg process system attempt address manag problem pose featur emerg process brittl natur emerg process suggest person natur emerg process suggest distribut suggest manag system intellig agent cooper adapt process agent architectur design specif emerg process manag goal system support emerg process provid rang basic compon interact assembl compon plan compon set meet set virtual compon repres robust agent plan term wide rang mean research literatur term agent comput situat capabl flexibl autonom action order meet design term system refer type system multipl autonom varieti architectur autonom agent fundament distinct intellig agent architectur extent architectur exhibit delib reason reactiv reason agent architectur combin form reason call hybrid architectur conceptu architectur brittl natur emerg process suggest manag system robust cope natur failur report class robust architectur bdi agent architectur member class interrap architectur origin work process agent architectur extend interrap base set basic concept conceptu architectur describ agent control architectur describ agent oper process agent architectur differ architectur interrap architectur appli design load dock case studi applic safeti emerg process applic mission critic system thing robust agent architectur suit circumst gener busi process agent architectur intend specif emerg process applic conceptu architectur gener process agent shown figur architectur world belief deriv read messag receiv read document involv process read messag receiv agent activ fundament document read inform requir user agent send messag feel social belief agent observ agent system belief plai role partli wholli activ local cooper trigger lead agent commit initi intent execut plan achiev messag call delib reason partli wholli activ trigger pass data partli execut procedur advanc agent progress achiev goal commit messag opinion lead belief activ procedur call reactiv reason reactiv reason involv procedur procedur trigger watch arriv high prioriti messag social world belief agent design user document coop local proc goal coop local proc intent lattic term procedur trigger import data belief manag messag read messag area messag manag read layer cooper plan local plan procedur read figur conceptu architectur gener agent emerg process emerg goal refin mutat place requir manag system respond process goal process agent implement implement interpret agent specif interpret enabl agent built quickli enabl includ specif agent modifi execut implement interpret simplifi gener deal high level specif commun process agent interact user world wide web process agent commun user modifi user trai send user email messag user commun agent place document user achiev softwar document document user trai agent incom agent belief addit direct commun user system manag perform automat document check process agent commun agent send messag user process instanc uniqu identifi extern transact creat process instanc final number agent belief relat instanc remain garbag collect process remov belief basi commun protocol gener process agent sender messag life messag deleg kqml queri manipul commun process agent messag area agent agent post messag agent bs messag area agent messag manag role agent messag area messag instruct messag post messag remov sender receiv agent messag manag displai messag receiv agent messag area state condit remov sender receiv agent messag manag remov exist messag receiv agent messag area messag remov condit express term achiev goal trigger messag express term receipt messag origin messag agent plan emerg process independ emerg emerg process success execut plan relat achiev plan goal plan succe goal plan fail goal achiev mean plan termin explicit test plan goal achiev hybrid architectur process agent architectur exhibit delib reactiv reason delib reason manag framework framework deal natur plan failur plan built exist repres failur abort power approach insuffici emerg process plan execut successfulli necessarili relat plan goal achiev reason inevit fair amount activ emerg process process manag system process agent emploi form elabor plan emerg process necessarili reli achiev goal chosen path plan achiev plan fail execut plan goal achiev activ extern process manag system plan bodi call success condit procedur goal determin sc plan goal figur plan exit plan goal achiev success condit final path plan success condit execut procedur succe fail abort execut success condit succe success plan unknown plan exit result attempt execut plan shown figur plan bodi direct node label plan bodi usual condit construct iter construct diagram plan bodi start state condit activ action stop state label success state action fail state action unknown state action abort state condit abort action success state mean plan permit execut freeli plan goal achiev fail state mean plan permit execut freeli plan goal achiev unknown state mean plan permit execut freeli plan goal achiev abort state mean plan permit execut freeli attempt build plan block level plan sixteen exit plan shown exit exit denot abort unknown state fail state person side process emerg process suggest distribut architectur manag requir overlai person prefer execut process plan busi process model event process chain primit model control logic split unit defin inform object data emerg process model start sc figur person prefer fine level develop structur process agent plan process manag system compar system oper level polit natur human distinct made corpor corpor rule statement thing work person prefer knowledg system corpor rule state member work dai person prefer suggest receiv copi hour rest fred bit case system fred system work user plan shown figur mean distribut individu set person prefer model separ rule prefer describ make system work rule describ function prefer appli wide rang fred receiv sort materi colleagu rule prefer repres separ model process prefer repres goal plan modifi rule long oper constraint violat agent make emerg process reliabl forecast valu likelihood lead forecast cost forecast estim assist agent deriv measur made effect prior typic cost bring emerg process substanti due cost human process involv process manag system make consid base process agent architectur decid action estim likelihood lead estim cost make estim base observ past perform infer reason perform delib reason mechan bdi agent typic involv basi observ commit select plan select plan consist set thing agent appli procedur requir mechan identifi select plan schedul intent problem select plan set plan path composit plan disjunct problem call plan select plan perform badli plan perform defin term rate plan cost time execut ad process combin measur uninform agent made perform perform uninform agent expect make long agent perform stabl mechan achiev form adapt reinforc learn plan uncertainti discuss detail altern approach base probabl approach base principl probabl option probabl option principl appli valu discret continu variabl inform agent thing idea reason option lead failur reason translat probabl combin estim give inform estim agent perform account reason agent behav uninform adapt agent perform measur support adapt aim agent adapt make good execut avail plan goal flexibl choic plan goal presenc disjunct node plan flexibl choic path plan perform path plan measur avoid unnecessari descript refer measur method appli equal plan success execut path success plan success condit satisfi plan succe avoid wast time resourc annoi process manag system mean path relat likelihood path lead cost achiev time achiev path ad process achiev path paramet estim probabl path succe time execut expect time path execut expect cost execut path expect ad process execut path event previou termin path order recent termin termin path measur made observ time path execut observ cost path execut observ ad paramet binomi approxim distribut standard condit paramet assum distribut shape distribut paramet depend mean distribut assum normal li rang point estim extent estim emphasi recent behaviour determin chosen reflect expect pattern behaviour path estim geometr iter updat valu occas path execut point estim commenc iter initi init repres optimist start point assumpt hold requir estim point estim standard deviat distribut estim geometr estim fa recent observ behaviour path commenc iter initi fa init repres optimist start point method updat fa valu requir point estim statist path choic contribut virtu formula updat valu fa valu express term behaviour factor twenti trial contribut weight ten trial contribut weight trial contribut weight method estim probabl distribut path plan lead success cost path plan estim measur real argument similar estim estim mean standard deviat distribut paramet process agent adapt make basi observ perform prior probabl process agent select path equal probabl path path mean path plan term likelihood path time path path path probabl path path probabl estim probabl area normal distribut standard deviat mean method estim probabl path method extend estim probabl path choic number path inform adapt method path select select path estim probabl path path estim base observ past perform method account happen path select account belief present environ effect futur perform belief infer past perform expect effect futur perform inform agent address issu inform agent belief present busi unavail belief treat hypothet evid modifi uninform estim futur likelihood time cost uninform estim modifi give inform agent belief past belief infer past perform inform agent reason past select lead failur agent believ reason effect futur reason quantifi tempor effect belief translat estim likelihood cost belief lead estim reason select path plan behav extract observ interact user agent involv path present process agent make observ attend instanc process yesterdai attend instanc process schedul complet infer belief give observ perform present attempt made gaug rel belief uninform estim process agent make conserv tempor bound uninform estim process refin form simpl factor uninform likelihood success process agent implement java implement interpret agent specif interpret enabl agent built quickli simplifi deal high level specif featur emerg process strateg independ system attempt deal directli featur except process independ refer eh design implement architectur busi process manag jp mj wooldridg nr jen intellig agent iii nr mj agent applic market mh mp manag heterogen transact workflow cooper agent nr jen agent applic market pp jk architectur support make eighteenth intern confer knowledg base system appli artifici applic innov expert system vi cambridg decemb jk workflow system intern confer practic applic intellig agent march system mit mj roadmap agent research develop autonom agent kluwer academ jp design intellig layer approach note comput springer mp bdi theori practic int conf system san pp june ty kqml agent commun languag jeff bradshaw softwar agent mit busi process model workflow integr approach stickel busi process model rs ag reinforc learn mit mp formul tradeoff plan uncertainti morgan kaufman
ML/1325 6 goal direct adapt behavior neural lean evolv architectur frederick michael dyer artifici intellig comput scienc depart lo angel lo ca august abstract paper present neural network architectur base connect learn multipl goal task reinforc environ paper show learn spatial navig task faster tradit learn goal direct agent chanc surviv paper show portion learn rule evolv genet algorithm problem agent resid complex environ meet surviv goal simultan high prioriti environ agent meet learn meet paper present flexibl neural architectur learn faster tradit reinforc learn gener appli reinforc neural plausibl balanc requir multipl simultan goal paper describ genet algorithm evolv constant learn rule evolv portion learn rule im troubl motiv evolv environ task order evalu agent control environ task environ includ agent bodi physiolog extern world task metric measur rel success control architectur agent live continu object environ agent eat drink avoid agent receiv goal input form pain goal input singl agent store food water hunger thirst rise agent eat pain input rise detect extern agent primit visual system object detect agent field front vision broken input sensor type object agent world type extern agent twelv visual sensor goal input correspond input agent similar motiv unit network polici network figur network receiv extern input reinforc node receiv intern goal perform motor action black triangl input connect weight agent visual sensor side type object sensor perceiv closest object type distanc sensor measur distanc closest food agent left fal angl sensor measur angl food rel direct agent face agent action turn left smoothli move forward unit twelfth agent size agent automat consum object contact agent action carri parallel agent turn turn left move forward result agent simultan move forward unit turn basic task agent eat drink avoid eat agent begin approach item suitabl satisfi goal agent learn behav appropri satisfi goal architectur agent call made polici network polici network dynam creat agent action time network gener appli reinforc polici network time step polici network determin agent action perform network calcul reinforc polici weight polici network adjust base weight network adjust base extern reinforc order behav agent act base surviv goal goal involv sophist nest construct result agent multipl possibl conflict goal fluctuat figur polici dynam modul influenc connect urgenc time task environ agent design learn connect polici network agent satisfi multipl simultan goal reinforc extern world satisfact failur goal requir multipl satisfact goal agent learn correctli agent learn singl interact object agent eat begin avoid network serv convert intermitt reinforc reinforc time step polici network network agent polici action moment connect multipli pair input node input sum polici sensor node broken extern input intern goal sensor set extern input sensor consist visual sensor goal sensor consist pain agent receiv input sensor node activ activ extern input sensor multipli activ goal sensor weight sum output node shown equat extern sensor left food intern sensor output weight food left food left activ turn left turn left food left hunger food hunger polici network weight adjust agent learn approach food water learn avoid adjust weight base distribut reinforc reinforc agent time agent satisfi goal extern sensor gener separ reinforc singl reinforc signal organ reinforc extern input sensor node continu recalcul function differ activ current time step activ previou time describ neural mechan figur node hold amount reinforc adjoin extern input sensor node dynam gener distribut reinforc signal section weight polici network adjust shown algorithm algorithm adjust polici network weight weight network output reinforc extern input sensor vector current time extern input sensor vector previou time step goal sensor input vector current time step arg max arg max ffi ffi ji maxim respond output node maxim respond goal sensor node identifi highlight dark circl figur weight link line figur adjust product activ activ reinforc extern input sensor node weight adjust occur differ input extern input sensor node input previou time step extern input sensor node constant threshold reinforc calcul network singl layer network reinforc polici network time step consist connect goal sensor reinforc node extern input sensor acronym network figur updat weight network reinforc calcul shown algorithm activ maxim goal sensor circl figur multipli weight link line figur propag reinforc node extern input sensor multipli input network chang activ time gener local reinforc algorithm calcul reinforc extern input sensor node weight matrix arg max network weight adjust network hebbian style learn updat weight base tempor differ goal sensor node chang activ goal sensor node greater constant threshold weight link line figur goal goal sensor node extern input sensor node circl figur maxim respond previou time step modifi differ time activ extern input sensor node previou time step algorithm adjust network weight arg max ffi ffi jg activ rise sensor neg pain rise due eaten pn weight drop figur network pn pain input visual node receiv input object rp reinforc node architectur design featur uniqu featur architectur develop requir effici neural mechan learn task section describ requir met manag multipl goal connect goal extern input sensor give agent abil properli achiev multipl fluctuat goal network enabl goal input radic affect behavior goal distinct portion polici network control output learn modifi goal sensor goal sensor portion polici network meet goal goal node portion network meet goal turn imagin agent moder food left water thirst input turn connect water sensor output node make agent move water agent move food agent suddenli extrem water polici network thing agent approach water delai reinforc convert reinforc learn polici network requir reinforc order learn reinforc object eaten singl time step network solv delai reinforc problem function network convert short durat delai reinforc continu reinforc learn algorithm weight network reflect agent posit neg reinforc attitud extern object repres extern input sensor goal sensor activ associ input immedi led larg posit reinforc agent adjust object agent move rel network gener reinforc associ input convert delai reinforc reinforc agent eat activ goal pain sensor rise chang activ sensor trigger downward weight adjust pain sensor reinforc node extern input sensor detect agent move unit activ visual sensor time time tempor differ combin network gener neg reinforc extern input sensor node polici network result drop due eat food rise activ rise food sensor posit figur network hunger goal input visual node receiv input food object rf reinforc node agent priori knowledg food satisfi hunger neg reinforc learn avoid intermitt neg experi agent experi neg reinforc common visual experi case agent eat food activ goal hunger sensor chang activ sensor trigger upward weight adjust hunger sensor reinforc node extern input sensor detect food agent move unit activ food visual sensor time tempor differ combin network dynam gener posit reinforc extern input sensor node intermitt posit experi agent experi posit reinforc common visual experi polici network visual reinforc learn approach food maximum node focu attent attempt adjust weight time step result problem assign credit individu weight agent output larg activ medium activ agent result action turn left agent receiv posit algorithm adjust weight output agent adjust weight left weight cap prevent unbound error weight link grow agent food left turn left sensor receiv posit reinforc weight left sensor goal left output node adjust base posit agent learn incorrectli approach food credit posit reinforc improperli link show suffici complic error occur result agent learn bad polici order focu attent learn algorithm introduc idea adjust weight maximum node group adjust weight connect maximum output credit assign problem problem allevi left node maximum output weight agent turn left adjust weight connect maximum goal agent doesnt learn approach food hunger maximum goal weight link eman hunger handl problem tempor differ base sensor goal threshold atyp event occur agent learn behav typic case agent food left turn neg reinforc turn piec food view agent posit reinforc agent learn food turn good idea sort situat occur occlud object suddenli view order filter effect discontinu event threshold shown algorithm chang input sensor greater chang made weight link eman sensor object view larg chang sensor input data learn act filter disregard sensor fluctuat reinforc signal gener larg chang agent intern goal network detect event occur warrant chang agent reinforc attitud goal chang relat select goal associ extern goal chang greater threshold threshold algorithm goal sensor hunger part normal process hunger drop special occur satisfi hunger time agent note surround perform reinforc learn threshold function properti sensor physiolog physic world posit factor natur part situat set natur product evolut found natur simul threshold work method test ran experi environ food unit water unit task gather food water agent time step singl agent agent receiv extern visual connect goal node polici network polici network network lesion link agent hungri eat drink fast measur agent perform eat drink measur agent perform count number object agent give maximum score environ food water goal input lesion task eat food drink water agent eat measur agent perform subtract number eaten total number food water eaten environ link goal node polici network left intact agent longer eat drink hungri agent refrain eat agent maximum food water storag amount eaten capac lost measur agent perform measur long surviv environ maximum time agent surviv time step limit amount food water compar agent linear function random agent select action equal probabl select popular tabl discret form tabl pn pain agent food water figur random initi posit reinforc learn techniqu agent similar environ reinforc eat eat base learner present continu input discret number input depend discret linear function linear function input approxim suggest russel separ function action separ equat calcul left equat shown equat weight adjust gradient sutton barto agent consist polici network architectur section experi ran agent link goal node link lesion type ran train session report averag train agent train time step learn halt agent test time step environ start configur random start configur shown figur perform simpl method gener input adapt continu linear function learn agent learn linear function faster result intermitt reinforc continu visual reinforc continu linear function learn agent learn roughli speed learn parallel learn food water experi agent goal input agent conserv food water avoid result result experi water shown figur agent perform converg score time step agent interact type quickli thousand time learn consum food water linear function converg time step score slightli agent differ maximum score linear function agent statist fail learn good polici experi time frame inabl gener input figur show result experi water agent converg score time step extra time learn task time agent randomli consum type object linear function start peak time step score surprisingli begin drop agent begin move faster food eat eventu converg polici consum result score close fail learn viabl polici time figur show result experi food water avoid agent advantag goal input longest surviv time approach food hungri save resourc agent ignor goal input surviv eat drink avoid consum resourc di time step linear function initi learn perform agent ignor goal input improv effect goal input small compar rest begin eat linear function agent death time step perform compar experi polici previou consum food water perform strategi involv eat lot learn discuss comparison develop gener method learn arbitrari function gener method work domain method design domain shown difficulti input agent agent point number learn timestep random tabl linear function figur experi number time step score agent converg time faster linear function obtain higher score number learn timestep random tabl linear function figur experi agent converg good score time step linear function reach eventu converg score global locat design mobil agent balanc multipl goal continu environ perform experi agent surpass agent reach maximum perform order magnitud faster combin featur give good perform compar implicitli advantag continu spatial natur mobil robot task reinforc sensor node gener chang input time step valid motion continu environ input continu true input arbitrari move object input distanc sensor node fluctuat agent credit assign form distribut reinforc sensor distribut easier pick part network affect action respect extern object view weight maximum node adjust adjust weight maximum system concentr learn thing time reduc credit reduc error credit network learn rapidli avoid learn incorrect associ associ occur network convert singl reinforc eat unit visual reinforc activ period time learn place food food agent learn approach food time step observ food distanc input separ goal sensor extern input sensor separ goal sensor extern input system treat differ learn connect goal agent import major influenc behavior agent wast resourc consum doesnt featur incorpor function base multipli goal extern input number learn timestep random tabl linear function goal input goal input figur experi agent goal input surviv longest surviv time number time step data point agent di equat difficult incorpor featur fundament alter gener natur network figur illustr typic network result task agent start randomli connect knowledg object environ innat structur architectur eat pain input eat diminish agent learn interact learn sensori input control action output learn sensor food left side drive left output left drive output learn goal modul extern connect learn sensat thirst control connect motor output sensat pain control connect motor output tl tr figur initi polici network architectur full connect random weight rang tl tr pn pain fal angl food object sight par angl object sight distanc visual sensor node left clariti connect hunger goal input node shown tl tr figur simplifi structur polici network learn link hunger pain weight greater shown highlight learn structur link shown weight greater connect thirst omit clariti figur network learn initi full learn sensor relat achiev goal adjust weight due experienc pain eat learn neg reinforc sight distanc posit reinforc sight distanc figur show strongest connect weight tend polici weight close close weight close structur connectionist network distribut fulli connect network prune excess connect common neural develop evolv learn rule learn algorithm depend threshold paramet relat differ time agent input paramet exclud input learn process calcul felt good valu correctli exclud mislead minim number exclud event discrimin goal meet failur event eat normal physiolog hunger rise previou section show learn rule work threshold set discuss genet algorithm experi evolv valu evolv threshold portion rule order build automat experi hope gener valu similar set hand tradit ga model individu test agent determin gener prohibit long agent exist continu environ action recalcul frequent environ properli evalu time learn environ interact demonstr learn combin factor result simul run month hardwar allevi hope run entir popul explicit evalu agent time agent small probabl result agent offspr time ran agent unit agent consum environ replac type random locat agent replac offspr agent randomli select oldest agent time agent produc offspr probabl agent ag probabl agent genom repres calcul genom subtract divid result rang valu treat valu greater treat mechan binari number threshold larger valu mutat rate rang figur show averag popul vari time typic run vari densiti object reproduct mutat threshold converg valu examin longest live agent discov major perform random walk densiti food water random walk agent surviv learn result select pressur evolv agent environ made challeng densiti food densiti environ difficult born agent learn surviv vari densiti unabl develop suitabl felt solut difficulti environ agent ag select pressur agent chanc learn order select reduc densiti food water agent ag requir simul synchron gener member gener begin time replac food water difficulti environ number timestep figur plot popul averag time ga experi agent top agent live longest popul paramet figur plot gener run drop quickli eventu converg reason begin drop agent reason reinforc network begin evolv polici network converg close rang hover run similar averag time converg gener evolut threshold introduc question part learn rule evolv learn rule differ activ time step node connect link question compar differ threshold link compar tempor differ activ node connect investig chang learn rule accommod paramet polici learn rule ffi ffi ffi ffi ji ffi jg ffi jo determin rule test learn rule network ffi ffi number gener figur plot popul averag theta number gener ga experi averag gener length time step ffi jg ffi jr genom rule tempor differ threshold node connect link affect learn link expand agent genom bit number bit repres predict rule evolv resembl converg valu similar experi evolv effect evolv figur show gener run converg valu similar previou agent fall rise learn rule evolv form learn converg evolv threshold valu converg expect evolut discuss learn rule network weight learn abil behavior test experi show static difficult strike balanc strong select initi surviv gradual select pressur learn number gener figur plot popul averag theta theta theta theta time ga experi evolv learn task natur absolut level difficulti environ remain static agent difficulti simul social interact parent parent agent provid protect child agent learn parent gradual lower amount protect child agent abil provid select pressur evolut learn impli natur parent parent learn area requir research evolut threshold experi select learn rule mind converg impli import success agent larg differ event includ learn set event exclud rang equal valid valu learn rule converg threshold unexpectedli evolv threshold closer inspect show agent learn behav incorrectli adjust network base natur chang goal effect polici network find food effici stuck local movement learn rule begin throw data agent reduc agent fit relat work work relat fall network agent neural base reinforc neural associ genet algorithm techniqu control network braitenberg show agent direct connect left sensor left wheel made approach avoid object environ werner note connect combin connect goal input advantag properti control agent note combin goal sensori input enabl agent pursu goal direct interrupt behavior avoid danger advantag opportun satisfi import goal agent begun persist proxim object consum domin behavior agent priorit base activ input weight link agent perform simultan singl action time step werner hand design structur network genet algorithm set weight learn fulli connect network result structur similar werner hand design structur weight provid agent desir properti neural reinforc learn neural network reinforc learn system function approxim function network replac lookup tabl valu scale larg continu problem agent select singl maximum score action network time step maximum input output multipl simultan action system neural network difficulti complementari reinforc backpropag algorithm neural network specifi output make similar requir agent receiv reward delai reinforc environ convert delai reinforc visual reinforc associ network billard techniqu similar network mobil robot associ event time order label learn seri percept event recognit system feed forward identifi sensori event fed associ modul fulli connect modul associ event occur similar time frame weight link node repres event appli drama social imit learn mechan extern architectur enabl robot agent imit action robot associ auditori input imit motor agent learn simpl languag drama learn action select mechan polici output associ gener reinforc genet algorithm techniqu menczer belew genet algorithm evolv neural network learn parent found prolong immatur agent select agent abil learn parent dont good refer evolv learn rule desir difficulti environ learn agent baldwin effect agent learn environ import quickli accur advantag sort environ live maxim chanc success architectur connect goal extern input convert delai discret reinforc continu reinforc sensori appli credit assign make effect spatial continu natur task neural network architectur learn approach food learn avoid learn achiev multipl simultan goal faster flexibl gener techniqu genet algorithm evolv constant learn rule evolv portion rule techniqu confirm necess aspect learn describ natur learn algorithm provid insight natur learn role plai social agent acknowledg work support part intel research program grant author model run pentium ii base donat intel corpor lisp code random number gener kindli provid wheeler harvard refer littman gener scale reinforc learn advanc neural inform process system billard learn commun imit autonom robot intern confer artifici neural billard connectionist architectur control learn autonom robot adapt braitenberg experi synthet psycholog mit belew matur evolut imit learn artifici organ adapt parisi neural network motiv unit anim intern confer simul adapt page sejnowski comput brain bradford dyer neural network reinforc learner mobil agent continu environ technic report dyer network agent intern joint confer neural washington juli edelman neural darwin basic gile gener neural network appli organ behavior oppenheim natur occur cell death neural develop trend russel norvig artifici intellig modern approach mit sun peterson partit reinforc learn intern joint confer neural sutton barto reinforc learn mit werner order neural connect motiv behavior choic anim intern confer simul adapt
DB/1326 3 fundamenta informatica io press execut suspend logic program robert toni depart comput imperi colleg technolog medicin london uk gerhard logic base system depart comput scienc colleg ny usa abstract present extens logic program addit ordinari lp includ integr explicit disjunct bodi atom concurr logic languag result framework aim unifi constraint logic program abduct logic program semant queri deduct present proof procedur simplifi proof procedur alp discuss applic formul tradit problem clp logic program constraint logic program abduct logic program semant queri deduct author support epsrc project author support onr grant author grate hendrik decker sadri comment earlier draft paper ra execut slp introduct ordinari lp solv problem repres procedur mean form lm atom liter variabl implicitli quantifi scope entir call head lm call bodi form backward unfold atom goal quantifi conjunct negat interpret negat failur alp extens ordinari orient applic area clp extend lp constraint process ordinari lp predic unfold check satisfi simplifi mean constraint solver logic program repres problem order oper machin start time process time problem characterist schedul constraint solver linear goal goal succe comput answer note ordinari lp requir explicit definit clausal form prolog definit inadequ alp similar approach constraint solver explicitli mean constraint handl rule rule form goal constraint handl rule add conjunct goal add ad goal goal constraint handl rule add goal conjunct part answer ra execut slp alp extend lp perform abduct logic program goal alp aim find set abduc atom atom set candid set integr constraint ic notion entail depend chosen semant negat failur logic entail truth minim herbrand model program notion integr constraint satisfact understood wai weakest consist union ic consist strongest ic entail union logic program bird bird penguin fli integr constraint penguin fli goal bird fli explan satisfi consist view explan note ordinari lp fail gener answer fail undefin predic aim queri answer deduct logic program predic partit defin unit defin part larg queri part integr express queri execut limit greatli avoid access part db deduct defin predic posit integr constraint express properti db manag null bonu queri integr constraint show queri access db ordinari lp answer queri individu record access ra execut slp defin extens lp distinguish ordinari predic extern predic abduc predic alp predic constraint predic clp treat ordinari predic includ ordinari extern defin logic program assum logic program local stratifi admit uniqu perfect model entail understood truth perfect model ordinari logic program execut unfold atom definit logic program defin extern predic access integr constraint express properti inaccess logic program approxim definit integr constraint implic execut forward condit deriv integr constraint similar rule artifici intellig atom ordinari predic unifi head propag carefulli chosen integr constraint unfold logic program reduc amount suspend atom prevent unfold atom suspend extern ordinari atom unifi head notion suspend atom notion abduc atom atom constraint atom clp atom variant ordinari lp predic written disjunct control limit amount search atom unfold program rewrit program form atom instanc head definit multipl predic head predic defin mean true assum head defin predic unifi direct disjunct goal give declar altern branch search tree ordinari lp goal muse prolog paper section present call suspend logic program discuss problem solv knowledg section present basic proof procedur slp section describ applic section discuss extens basic proof procedur section relat slp approach section report result exist prototyp slp applic ra execut slp conclud framework slp knowledg base consist set set integr defin assum set defin includ special true definit formula form atom true conjunct liter variabl implicitli quantifi scope entir variabl disjunct existenti quantifi scope call head call bodi atom tupl term defin note atom predic restrict head unifi definit illustr framework mean highlight time framework repres constraint satisfact problem queen queen coordin rule chess queen queen coordin defin predic set specifi notion queen move note set similar part clark complet normal logic program consist replac clark complet logic form term head mutual distinct definit predic form multipl predic ra execut slp set replac set true true defin move subsidiari predic reli definit predic clp distinguish constraint treat constraint predic ordinari defin assum belong set ordinari defin term addit ordinari slp extern inaccess extern predic correspond abduc alp predic regard extern predic inaccess definit predic inaccess queri process extern placement queen coordin repres atom altern definit solut thought inaccess predic queen extern definit disjoint set predic extern belong set ordinari slp theori set head unifi defin ordinari extern call access part call inaccess part assumpt set extern predic disjoint set ordinari predic analog assumpt alp set abduc predic disjoint set ordinari predic note assumpt made loss alp assum head atom instanc head definit call atom reduc exist access definit instanc head definit call atom suspend ra execut slp extern atom suspend ordinari atom suspend definit exist head unifi atom failur ordinari multipl definit exist head unifi atom ordinari import featur concurr lp languag concurr clp elimin search concept relat delai mechan prolog dialect chip control statement form delai specifi atom select argument concurr lp languag slp gener control form search disjunct bodi user control extent search control form ordinari predic written predic defin singl atom predic reduc predic defin set atom predic suspend constraint predic ordinari predic set constraint constraint predic atom suspend access combinatori access correct definit gener infinit altern instanti assum atom atom reduc similarli slp integr constraint approxim inaccess case extern gener combinatori execut definit integr constraint formula form true variabl implicitli quantifi scope entir formula call condit call integr constraint note empti condit integr constraint forc queen locat note true note formula rewritten term relat predic ra execut slp integr constraint section integr constraint true integr kernel problem express singl integr constraint queen extern predic move ordinari predic integr constraint provid approxim extern predic definit ordinari predic process atom suspend integr constraint add reduc atom goal consist suspend atom newli ad reduc atom reduc mention assum ordinari logic program obtain theori rewrit set ordinari local stratifi local stratifi logic program admit uniqu perfect model integr constraint sound approxim assum true perfect model defin perfect model logic program obtain theori rewrit set ordinari lp perfect model regard mean theori definit slp knowledg base pair ht ici local stratifi slp theori ic set integr constraint ic cet clark equal theori mean true perfect model note cet assumpt true belong term applic decid knowledg repres form repres mean integr constraint problem partli address semant definit integr definit defin integr constraint true properti predic defin problem address desir algorithm definit obtain compon integr constraint obtain compon proof procedur defin section combin backward forward reason deriv sequenc goal start initi goal ra execut slp basic proof procedur definit slp initi goal conjunct liter variabl initi goal free initi initi goal stand problem place queen column row proof procedur deriv sequenc goal start initi aim deriv goal disjunct answer determin valu free variabl initi goal disjunct answer initi goal perfect model initi goal disjunct satisfi assign free variabl simplifi treatment integr constraint assum variabl atom atom equal variabl variabl goal deriv proof procedur free existenti quantifi simplest goal deriv proof procedur disjunct definit flat goal conjunct dm atom global constraint disjunct conjunct atom local constraint disjunct note initi goal flat goal neg liter condit implic treat implic implic obtain neg integr constraint obtain number applic infer rule proof definit flat goal declar tree depth atom implic leav tree section goal deriv proof procedur gener tree atom implic leav proof procedur rewrit consist number infer replac goal goal theori slp knowledg base ht ici infer rule proof procedur appli conjunct atom implic implic syntax integr addit quantifi existenti quantifi free occur goal ra execut slp definit deriv goal initi goal finit sequenc goal ic obtain appli infer rule conjunct atom ffl reduc atom access definit dm hoe substitut conjunct replac dm conjunct condit implic implic replac oe dm oe ffl implic conjunct suspend atom conjunct resolv ad conjunct ffl logic replac replac negat replac replac ffl equal implement unif algorithm applic substitut infer rule similar iff proof procedur fung kowalski sldnfa deneck de unfold propag similar unfold propag iff procedur logic equal rewrit iff procedur iff procedur addit infer rule section ordinari unfold form backward reason ordinari lp atom head definit logic program slp atom instanc head access unfold slp form unif note atom suspend iff unfold propag form resolut test formula satisfi propag termin restrict propag likelihood termin elimin redund natur restrict appli propag empti form forward reason call note equal implic result propag instanti suspend atom reduc ra execut slp logic transform simplifi goal split declar branch ordinari lp equal rewrit propag cet unfold term augment garbag collect redund equal equal rewrit appli rewrit implic quantifi scope repeat applic unfold gener multipl nest disjunct initi goal conjunct liter repeatedli unfold easi refin notion deriv ensur goal deriv disjunct flat goal suffici restrict unfold step split step definit unfold atom condit implic implicitli incorpor logic transform formula replac origin implic implic turn previou section set constraint predic provid perfect model constraint predic atom unfold true true unfold unfold conjunct equal oe variabl uniqu instanc true suspend unfold true suspend unfold suspend definit success deriv initi goal deriv rest infer rule appli success deriv rest initi goal set atom denial comput answer control stop comput point deriv answer compact inform unfold answer compact disjunct intend success deriv applic propag pair implic perform ra execut slp answer iff proof procedur defin comput answer set atom disjunct variabl instanti term denial satisfi instanti variabl answer lead inform answer denial part answer proof procedur sound theorem comput answer initi goal conjunct suspend atom denial suspend atom ic cet consist condit hold trivial definit comput answer condit assumpt ic fact infer rule preserv respect slp theori condit fact propag verifi consist condit condit abduct explan consist abduc atom abduc atom abduct answer answer slp variabl condit condit goal entail theori extend abduct answer condit weak version integr satisfact condit union integr constraint abduct answer consist direct slp ic ic cet consist condit strong proof procedur suspend atom test consist rel integr approxim theori goal integr comput answer goal inconsist correct theori condit integr constraint provid complet theori clp satisfact case applic applic slp includ constraint satisfact problem discuss configur oper research problem ra execut slp schedul locat tempor reason theori action artifici intellig problem configur comput system choic compon oper pentium sparc oper unix definit access system constraint person prefer repres integr form posit requir oper oper definit processor queri oper result comput answer queri oper result comput answer definit processor queri result comput answer oper oper correspond execut job machin problem order oper machin start time process time express job oper oper start time process time latest start time oper earliest start time earliest start time oper execut oper problem order oper express initi goal ic unfold reduc initi goal conjoin ic split ra execut slp ic ic propag disjunct ic ic logic transform disjunct ic unfold ic split ic ic applic propag disjunct give ic ic logic transform disjunct comput answer order simul effici oper research algorithm basic proof procedur extend sophist form propag section event calculu logic program formal tempor reason simplifi version event calculu express slp knowledg base hold express properti hold time initi event earlier time broken express properti broken time time event termin time predic integr constraint hold express event happen time precondit hold time predic initi termin umbrella borrow umbrella true true addit integr constraint repres reactiv behaviour prevent concurr execut action ra execut slp atom answer comput proof procedur interpret action perform achiev goal react event denial answer interpret prohibit goal hold proof procedur comput answer unfold hold applic start propag answer goal proof procedur comput proof procedur present paper infer engin agent architectur proof procedur interleav interact environ reactiv behaviour achiev improv proof procedur check consist goal integr termin goal obtain applic infer unrestrict propag defin section gener infinit sequenc goal restrict slp knowledg base integr constraint propag refin improv termin improv effici propag form resolut refin propag appli empti resolut subsumpt order emploi gener satisfi termin addit infer rule practic proof procedur goal manag infer rule atom goal return answer fung kowalski emploi addit infer rule give answer ra execut slp manag manag elimin logic redund inform recov time goal atom logic entail transit delet goal identifi criteria distinguish integr constraint propag delet split rule give rise exponenti size goal limit avoid split complet appli propag disjunct boundari form resolut call variant resolut constraint propag disjunct illustr schedul problem section goal propag global constraint definit disjunct conjunct ic avoid split complet logic call kind avoid split case applic tighter constraint propag immedi split place propag defin basic proof procedur thought appli appli global constraint fourth form extract local inform disjunct make global disjunct schedul problem previou goal thought start time dummi oper follow oper lower bound lower bound time schedul step introduc disjunct factor disjunct add inform context extend decid disjunct split addit conjunct gener level conjunct introduc disjunct conjunct render global constraint introduc disjunct conjunct initi goal produc ra execut slp answer perform split emploi power infer rule complet determin automat control strategi applic rule experi prototyp section gener similar rule autom encourag effici control strategi simplifi goal disjunct flat goal definit dm flat global constraint disjunct dm disjunct ffl propag global constraint resolv addit conjunct ffl propag global constraint local constraint resolv addit conjunct ffl propag local constraint resolv addit conjunct ffl disjunct disjunct local constraint addit conjunct simpl opposit split complex form illustr earlier comparison proof procedur origin work alp comparison approach alp found concentr comparison clp method view natur method handl clp disjunct disjunct atom constraint method includ chip techniqu propag construct disjunct tradit approach distinguish ordinari constraint predic constraint predic ordinari predic treat access predic defin atom ordinari predic suspend unfold combinatori kind predic approxim integr appli atom suspend constraint predic understood defin knowledg repres form form ra execut slp atom ordinari conjunct liter ordinari predic conjunct liter constraint predic answer goal quantifi conjunct set constraint obtain atom ordinari predic collect constraint encount process separ store check consist simplifi constraint solver instanc emploi constraint solver constraint solver instanc linear real reli algorithm solv system linear equat inequ gaussian elimin simplex algorithm propag integr constraint evalu perfect model plai role constraint solver user knowledg control intern constraint solver approach user set integr constraint slp major theoret disadvantag approach clp fulli understand mean comput answer lack implement detail constraint solver techniqu integr constraint solver solv problem effici number approach clp overcom defici approach reli user guid constraint solver find solut effici languag oper propag user emploi program chip disjunct constraint disjunct label constraint transpar constraint exampl approach treatment equal lp equal rewrit concret transpar constraint solver term coin constitut complet departur origin abandon idea constraint solver user specifi set constraint handl rule implement constraint solver similarli integr constraint approach constraint perfect model evalu reduc constraint pure slp combin clp alp combin languag differ instanc slp clp differ approach clp ra execut slp present suspend logic extens ordinari lp addit ordinari lp integr direct disjunct bodi atom concurr languag argu slp unifi constraint logic abduct logic program semant queri present proof procedur base proof procedur alp present proof procedur concentr logic control issu concret implement proof procedur emploi specif control strategi logic control strategi delai split favour simpl propag prototyp implement slp develop implement includ extens section test applic tabl show comput result version singl integr constraint integr constraint attack extern predic full column number queen number solut column give process time sun number split oper solut singl integr constraint make solut integr constraint full applic method includ number bracket fourth column number split oper perform emploi heurist split disjunct smallest number disjunct strategi implement heurist successfulli clp speed solv constraint satisfact problem note heurist express framework control matter part ra execut slp made option user switch comput result obtain similar experi care usag method cut size search tree comput time tabl show benefit version problem size comput time gain prune factor search tree node count version divid node count version report node count time higher time save full applic includ prune search present accompani comput time result obtain program ran memori effici implement slp develop yield significantli result report preliminari result suitabl approach present paper express oper research algorithm futur work explor area assum slp theori local stratifi work studi stratifi case slp concurr lp emploi similar notion unifi approach interest topic futur research refer theori declar minker foundat deduct logic morgan lo design implement prolog sic dissert seri royal institut approach semant queri acm transact system logic data plenum relationship abduct journal logic comput oxford de abduct procedur abduct logic journal logic program ra execut slp handl constraint basic lnc springer iff proof procedur abduct logic journal logic program logic proc acm symp principl program logic journal logic program versatil handl disjunct proc intern symp program languag implement logic springer logic journal logic comput oxford role abduct logic handbook logic artifici intellig logic program oxford abduct constraint logic proc int conf logic mit logic problem dual form logic lectur note workshop honour jack ra unifi agent architectur combin ration proc intern workshop logic san lnc springer ra calculu gener comput declar effici clp workshop le propag clp technic report effici unif acm tran prog lang system introduct technic report tr semant stratifi minker foundat deduct logic morgan lo constraint proc acm symp principl program ra execut slp search concurr constraint proc int logic program mit famili concurr logic program acm comput survei approach technic depart imperi van constraint satisfact logic mit van evalu constraint languag constraint basic lnc springer abduct constraint logic phd imperi unifi framework abduct constraint logic al workshop logic program munchen integr constraint delet al proc workshop chang logic program deduct port program constraint abduc proc joint int conf symp logic mit approach workshop
IR/1327 5 restrict optim classifi simon tong comput scienc depart stanford daphn koller comput scienc depart stanford abstract introduc notion restrict optim classifi classifi attempt combin flexibl gener approach classif high accuraci discrimin learn creat model joint distribut class label featur boundari induc directli restrict type boundari learn minim probabl misclassif rel estim joint distribut investig instanti approach densiti estim window gaussian kernel hyperplan boundari show result classifi asymptot maxim margin hyperplan highli success discrimin classifi provid altern justif maxim margin hyperplan classifi instanti mixtur gaussian estim experi show approach data miss valu handl principl lead improv perform regular discrimin approach introduct introduc notion restrict optim classifi classifi attempt combin flexibl gener approach classif high accuraci discrimin learn classif method gener separ gener discrimin discrimin learn method support vector machin logist regress directli optim boundari tend creat classifi possess higher accuraci gener method taylor dumai al gener approach classif creat model joint distribut class label featur classifi futur instanc belong class model classifi call optim classifi minim probabl misclassif rel copyright fl american associ artifici intellig reserv estim densiti presenc gener model joint distribut permit data miss data miss label encod prior knowledg handl principl manner model full joint distribut techniqu tend larg number paramet estim learn densiti typic sensit train boundari optim classifi typic high varianc optim classif high commonli simpl densiti estim common naiv classifi text classif altern approach deal problem varianc optim classif spirit similar mention hart simplifi restrict natur boundari classifi classif hypothesi induc optim select hypothesi restrict class hypothesi select minim probabl error rel learn densiti call error estim error hypothesi restrict defin hyperplan boundari call hyperplan minim estim error respect densiti optim hyperplan investig instanti approach part paper discuss densiti estim window gaussian kernel hyperplan boundari prove result classifi converg asymptot maxim margin hyperplan classifi maxim margin classifi success discrimin strong theoret justif empir success relat optim classifi provid altern justif maxim margin hyperplan classifi extent result wider class boundari part paper consid densiti estim mixtur gaussian hyperplan boundari perform experi real world data set benefit model joint distribut data miss valu handl principl manner lead improv perform regular discrimin approach gener framework focu paper task classifi data case class featur space ir train data yn fc call class label instanc number train data class write definit classifi map set fc null set fx fx classifi map point class label data instanc label independ ident distribut joint distribut defin probabl classifi make classif definit joint distribut classifi defin expect misclassif rate error rel ep ae optim classifi rel distribut minim error order optim quantiti gener approach classif train data estim approxim joint distribut optim classifi rel estim error denot error rel estim distribut optim classifi rel minim estim error optim classifi induc boundari fairli complex estim sensit train impli similar sensit boundari varianc optim classifi larg approach reduc varianc restrict class select hypothesi restrict class definit joint distribut set classifi restrict optim classifi respect restrict set classifi receiv lot attent set hyperplan boundari hyperplan featur space definit hold gener set order appli concret approach estim easier estim decomposit densiti featur vector class techniqu estim class condit densiti silverman type densiti estim mixtur gaussian window maxim margin hyperplan section standard method estim joint densiti decomposit maximum likelihood estim simpl variant densiti window estim gaussian kernel estim place gaussian kernel train instanc class estim densiti simpli averag kernel ident gaussian kernel data diagon covari matrix oe defin oe oe number train instanc class oe call smooth paramet oe defin joint densiti oe requir error oe denot oe valu oe correspond choic smaller valu peak correspond higher varianc lower bia estim densiti choic oe crucial accuraci optim classifi elimin bia induc smooth effect oe make arbitrarili close prevent varianc classifi grow restrict limit class hyperplan hypothesi optim hyperplan rel estim densiti induc data oe section main result linearli separ oe optim hyperplan converg maxim margin hyperplan show similar result hold wider class small classifi maxim margin lower estim error classifi smaller margin show linearli optim hyperplan natur minim train set classif hyperplan classif largest margin linearli separ data assum train data linearli separ exist hyperplan classifi correctli classifi train data restrict hypothesi space set hyperplan classifi correctli classifi train data restrict relax show tight connect optim hyperplan maxim margin classifi definit margin hyperplan denot smallest euclidean distanc hyperplan train instanc theorem hyperplan statement ffl st st error oe error oe oe ffl maxim margin intuit result base altern express estim error oe oe dx oe point euclidean gaussian kernel oe significantli higher densiti closer move boundari center mass contribut estim error oe kernel closest boundari domin care analysi show estim error hyperplan domin express exponenti oe hyperplan larger margin domin lower error rel theorem show hyperplan oe small beat suffic show reduc optim hyperplan oe oe maxim margin hyperplan case oe oe arbitrarili similar proof theorem show case corollari maxim margin hyperplan ffi ffi set hyperplan margin ffi exist oe ffi error oe error oe oe margin oe maxim margin optim hyperplan converg maxim margin hyperplan term margin gener classifi gener previou framework complex class classifi set hyperplan classifi set classifi obei condit set classifi ffl fx fx open set condit fairli mild larg rang classifi set classifi hyperplan polynomi hing hyperplan boundari induc neural network sigmoid linear activ function satisfi condit gener notion margin hold gener form classifi intuit margin smallest distanc train instanc boundari definit classifi min min inf kx min inf kx case definit coincid origin definit margin hyperplan classifi prove theorem theorem set classifi satisfi condit classifi statement ffl st st error oe error oe oe ffl maxim margin result classifi maxim margin eventu lower estim error classifi smaller margin proof theorem involv theorem intuit similar classifi larger margin find region classifi larger margin classifi opposit smaller margin classifi estim error incur wrongli classifi area domin reduc smooth paramet interest compar instanti restrict optim classif support vector machin cort vapnik svm find hyperplan maxim margin problem maxim margin cast convex optim problem depend train data product train instanc appli vapnik replac product satisfi mercer condit gaussian kernel satisfi mercer write implicitli project train data higher featur space find hyperplan maxim margin space kernel function implicitli project train data space hyperplan correspond complex boundari origin space commonli figur svm polynomi kernel polynomi restrict classifi window small oe optim hyperplan oe soft margin error function kernel induc polynomi boundari origin space relat restrict optim classif densiti fact svm maxim margin kernel function correspond perform window densiti estim project space find optim hyperplan project space oe fact svm maxim margin higher classifi produc necessarili maxim margin origin space decid kernel induc polynomi boundari origin space svm correspond polynomi largest margin origin space window origin space restrict polynomi maxim margin polynomi lower estim error polynomi suffici small oe figur show boundari produc svm polynomi kernel figur show boundari produc restrict optim classifi restrict set classifi set polynomi boundari produc approach necessarili coincid data linearli separ return set hyperplan classifi analyz behavior window optim hyperplan gener case data necessarili linearli separ corollari oe hyperplan write estim error error oe oe number misclassif train data oe ffl oe oe ffl minim larger margin exist oe oe oe oe hyperplan lowest score lowest classif error train minimum error greatest margin respect correctli classifi data reason hyperplan pick corollari consist result obtain linearli separ case hyperplan number misclassif suffici small smooth paramet optim hyperplan hyperplan correctli classifi train data previou theorem linearli separ case remov restrict hypothesi space hyperplan correctli classifi train data small smooth paramet optim hyperplan correctli classifi train data effect nonzero oe behavior optim hyperplan oe arbitrarili close discuss inform justif theorem oe data point closer boundari larger larger impact point closest impact clear margin necessarili optim approach oe classifi estim error distanc point margin larger make larger effect point margin estim error choic hyperplan figur illustr simpl larger oe lead hyperplan arguabl reason similar tradeoff interest note form error function corollari resembl form soft margin error function svm cope linearli data vapnik kwk hyperplan weight vector bia weight tunabl paramet influenc penalti assign error slack variabl upper bound number train error soft error function sum determinist function margin function train error error function function margin exact train error investig oe achiev similar effect soft margin error function indian uc irvin data set merz synthet data set pima data set train instanc label posit synthet data gener gaussian class condit distribut synthet case underli distribut comput true error pima data set classif error separ instanc test set measur valu search hyperplan minim estim error oe error differenti function weight gradient descent techniqu find optim hyperplan smooth paramet updat rule easili deriv omit practic issu deal implement idea search space convex local minima exist small space consist numer larg slope plateau naiv gradient descent converg suboptim solut slowli corollari suggest seed search maxim margin hyperplan improv speed converg qualiti result bold drive speed converg tabl list error set oe synthet data error averag true error ten data optim paramet chosen data set separ larger data set experi cross valid set oe paramet result list synthet data set size fifteen linearli separ maximum margin hyperplan comput result window optim optim arguabl natur error achiev similar perform soft margin hyperplan observ support pair fold pima data synthet data support intuit linearli separ optim hyperplan produc classifi maxim margin reduc smooth paramet optim joachim tabl comparison soft margin maxim margin pima oe error soft margin pima error underlin row set pick cross valid synthet size cv hyp soft margin max margin tabl resist outlier classif error outlier soft margin logist percentag hyperplan hyperplan regress restrict error incur misclassifi train instanc eventu satur instanc hyperplan soft margin error function penal misclassifi train instanc instanc distanc margin figur window hyperplan resist outlier soft margin svm test hypothesi perform simpl experi sampl data gaussian train set consist instanc outlier ad train set proport outlier approxim order magnitud distanc data point cross valid select oe tabl present gener perform row averag ten independ run tabl window hyperplan gaussian kernel tend resist outlier linear method mixtur gaussian consid densiti estim gaussian kernel densiti estim densiti restrict optim classif approach parametr densiti estim greater advantag model joint distribut mixtur gaussian densiti estim assum class condit densiti mixtur gaussian densiti defin ij oe ij ij tabl averag test set error complet data data set linear svm logist hyp breast diabet german heart hepat sonar waveform tabl averag test set error miss data valu data set linear svm logist hyp breast diabet german heart hepat sonar waveform ij mixtur weight determin gaussian contribut class condit densiti mixtur gaussian densiti estim notic number mixtur compon fix typic small contrast window densiti estim number kernel grow number train instanc estim paramet ij ij oe kg expect maxim algorithm rubin em find paramet local maxim likelihood observ data maximum likelihood estim class prior handl presenc miss valu train data principl em comput mixtur compon ij expect miss valu data densiti form comput optim hyperplan similar gradient decent techniqu window densiti estim case experi experi compar hyperplan classifi linear logist regress optim hyperplan mixtur gaussian optim classifi deriv mixtur gaussian densiti directli svm soft margin tune hyperplan mixtur gaussian optim classifi number class mixtur chosen data set uc irvin repositori merz creat randomli gener uc irvin breast cancer data obtain medic inst split data roughli data set miss valu realiz data learn logist optim hyperplan mixtur final optim classifi mixtur gaussian cross valid realiz paramet method tabl test set error rate data set averag hundr run bold face figur hyperplan method data set optim hyperplan mixtur gaussian outperform mixtur gaussian optim classifi data set restrict natur boundari densiti estim directli optim hyperplan competit discrimin method hyperplan method lower error rate svm set outperform logist regress method perform data miss valu train instanc randomli remov featur probabl em perform densiti estim mixtur gaussian regular svm logist method handl miss valu discrimin method common techniqu fill miss valu class averag tabl error rate data set hyperplan perform equal hyperplan method set logist regress hyperplan method data set svm equal set hyperplan outperform plain mixtur gaussian optim classifi data set equal linear svm outperform logist regress set gain mixtur gaussian hyperplan suggest overwhelm note naiv form mixtur gaussian estim gaussian compon class ident restrict form covari matrix flexibl covari matric lead improv perform futur work introduc altern approach deal high varianc optim classifi high space approach base find simpl minim estim error error estim rel learn distribut yugoslavia hepat data except remov probabl featur consist miss valu train set shown natur instanti window gaussian converg limit maxim margin hyperplan classifi analyz behavior window restrict method gener form classifi possess desir gaussian kernel tend numer local minima make practic system hard implement investig kernel reduc search space retain properti gaussian kernel window hyperplan result implic view provid probabilist justif maxim margin hyperplan studi explor probabilist context bayesian learn campbel strong justif intuit restrict optim classifi avoid high varianc problem unrestrict optim densiti complex consid extrem high varianc densiti densiti arbitrarili low kernel width optim hyperplan rel distribut maximum margin work space result suggest find simpl classifi optim rel complex densiti find unrestrict optim classifi rel simpler maxim margin classifi domain optim classifi observ obviou question specif choic densiti estim gaussian kernel led success restrict optim classifi address question investig mixtur gaussian densiti estim experi strongli suggest restrict optim classifi conjunct form densiti estim obtain competit classif perform complet data experi suggest restrict optim classifi advantag model joint distribut give edg discrimin method deal data set miss valu observ suggest perspect debat discrimin learn gener approach classif hart hasti haussler jebara discrimin learn empir achiev higher classif accuraci optim classifi usual explan gener approach spend minim error reduc classif error approach altern estim joint densiti directli form optim evalu classifi restrict class intend investig benefit restrict optim classifi model joint distribut provid advantag facilit encod prior knowledg principl em incorpor unlabel data plan experi approach varieti densiti estim approach hope combin benefit gener approach realist express high accuraci classif discrimin learn acknowledg work support darpa inform assur program subcontract sri aro grant muri program approach intellig refer neural network pattern recognit oxford press uci repositori machin learn support vector network machin volum bayesian classifi larg margin hyperplan hilbert space proc maximum likelihood incomplet data em algorithm journal royal statist societi pattern classif scene analysi york induct learn algorithm text categor proc intern confer inform knowledg manag introduct statist pattern recognit academ press bayesian learn reproduc kernel hilbert space technic report tr technic berlin linear applic pattern recognit proc volum maximum entropi discrimin technic report mit exploit gener model discrimin classifi ten conf advanc neural info process system machin neural statist classif elli horwood machin learn discrimin inform learn proc aaai densiti estim statist data analysi chapman london probabilist interpret bayesian method support vector machin icann estim depend base empir data springer verlag
HCI/1328 4 provid locat place aid human memori tan denni randi pausch school comput scienc carnegi mellon forb avenu pa abstract work build evalu comput system interfac make inform memor psycholog research peopl rememb spatial distribut inform base locat rel environ inform learn appli principl implement multimod prototyp multipl monitor surround user engag human memori ambient visual auditori displai engag human memori place report user studi demonstr memori inform present system compar standard desktop system keyword multimod spatial distribut human interact introduct system design make inform memor current interfac design tailor make task immedi easi user perform success interfac judg base usabl measur task complet time error rate order optim evalu interfac design larg oper consist demand interfac distract user inform emphasi cognit inform retent rate interfac easier make effort user rememb inform meant deliv access memori cue acquir time inform memori retriev work multipl cue recal inform acquir inform real inevit locat permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee pui fl usa copyright acm depart psycholog virginia box va context context encod learn inform serv cue memori retriev psychologist research spatial memori found import compon context locat place locat refer posit object space place refer environ inhabit time encod directli util locat place provid memori comput scientist explor concept design media space figur multipl monitor creat ambient visual audio creat place aim appli principl human memori design user provid learn environ demonstr built prototyp user distinct cue locat place improv recollect materi present figur conduct user studi show user recal inform tradit desktop user word pair recal task train user pair cue word target word test user recal target word present cue word creat locat multipl monitor memori cue hope provid locat interact notic locat object space automat encod locat inform rememb peopl rememb passag text recal posit page rare recal page page stack occupi essenti posit space current desktop system present inform singl monitor window spatial cue encod inform easili retriev inform rememb user manag multipl window monitor order bring inform chanc al shown peopl memori locat space turn bodi turn world presenc cue strongli affect spatial memori room metaphor data mountain provid spatial cue present space singl displai surfac interfac limit success provid cue rememb locat contrast current provid cue surround user multipl monitor distribut inform user forc orient inform inadvert notic encod locat inform user rememb associ locat monitor present creat place ambient visual audio memori cue hope provid place encod research psycholog past decad smith found associ made inform place learn associ provid retriev cue attempt recal inform comput research recogn import context user work lam implement portabl collect organ inform context form biographi user inspect biographi aid recollect past event salber context attempt defin standard notion integr context softwar compon toolkit support develop context sensit interact system work percept user give perceptu capabl comput recogn adapt context work environ context differ creat user distinct synthet provid place creat memori associ user feel presenc synthet environ environ serv memori aid prefer distract user draw attent focal provid ambient sound visual context davi al shown sound facilit recal reinstat time retriev construct locat place memori aid serv proof concept configur larg screen multipl displai system pro graphic comput drive displai simultan current configur consist focal lcd monitor surround ambient project displai figur set displai arrai lcd monitor directli project surfac pick configur leverag natur abil locat object egocentr respect cardin direct back lcd monitor serv main work area user interact inform project displai provid horizont view angl approxim primarili user place effort involv displai panoram imag project displai creat plai back audio context pro tool digit audio workstat run macintosh context channel sound surround user speaker directli front user ear level feet ear ear feet ear level speaker ear level feet user feet investig playback system user studi conduct initi studi examin effect user rememb inform test user memori pair word chose task paradigm understood memori research train user word pair word pair consist cue word target word user return dai test target word recal cue word word chosen frequenc english list cue word made harder user rememb respect target uniqu list valid pair list list histori user list memori studi condit defin system user learn word list group learn word list desktop comput singl learn user learn list monitor present panoram imag ambient sound user learn museum list center lcd panoram photograph interior museum heard ambient museum sound conduct studi learn phase recal phase learn system present user word pair user word train ensur user learn list complet system randomli present user cue word target word system provid feedback confirm answer correct provid target word process continu user provid target word cue word list user repeat process learn list order user time memori user return dai recal phase test user laptop comput room room learn word list previou dai improv user shown cue word target word test user abil rememb target word list separ list set cue user present cue word type target word feedback recal desktop figur user recal significantli word pair desktop user undergradu colleg student paid particip equal number male femal randomli assign condit found differ condit time number iter requir learn list criterion differ number pair rememb particip singl monitor condit rememb word pair particip condit perform rememb word pair figur repres improv memori perform assess user rememb learn word pair user view complet pair word laptop report monitor learn word thirti word pair present random order user rememb locat word pair recal locat highli correl number target word rememb correctli recal discuss futur work shown user rememb semant inform present standard desktop system memori cue provid locat place prove encod retriev inform activ user show recollect inform effect statist reliabl show memori mean evalu effect comput system import note differ condit time number trial requir learn pair influenc time effici learn materi effect sole recal identifi individu contribut locat place effect respect plan present inform lcd monitor synthet place cue preliminari result confirm abil encod locat inform present lcd monitor verifi result understand extend number locat examin place aid memori user work locat cue singl lcd monitor hope examin effect visual auditori compon individu place member group work method automat gener context associ inform present synthet place cue compar place cue user real room perform task test user context singl monitor laptop user explicitli provid retriev cue user memori improv test user system learn word pair explor devic reinstat cue locat place user memori advantag provid user locat place cue time inform acquisit user encod cue inform make inform easier retriev implement comput system util principl multipl monitor surround user provid locat cue ambient multimod displai user synthet place present user studi show memori improv system compar standard desktop system acknowledg collabor adam andrew stage research lab carnegi mellon tom steve evan witt percept lab chri southern california refer appl comput macintosh human interfac guidelin psycholog interact hillsdal lawrenc erlbaum associ locomot mode affect updat object encount contribut propriocept input path integr audio enhanc visual percept perform virtual human factor ergonom societi annual search imagin environ journal role place space collabor system acm confer comput support cooper multipl virtual workspac reduc space content graphic user interfac acm transact intim comput support human memori intern symposium gener human learn ii obligatori encod spatial locat journal human percept inform pro tool data spatial memori document manag paper present annual acm symposium user interfac softwar san ca usa memori locat inform text journal verbal learn verbal gd context aid develop applic confer human factor comput chi rememb context journal human learn memori context human memori memori element episod memori oxford press perceptu user interfac commun
ML/1329 6 discov fuzzi classif rule genet program roberto de alex freita julio av brazil abstract data mine consist extract knowledg data paper system discov fuzzi classif rule system evolutionari genet program algorithm evolv popul fuzzi rule set simpl evolutionari algorithm evolv popul membership function definit popul final result process fuzzi rule set set membership function definit adapt system innov idea respect encod gp individu repres rule set basic idea individu encod scheme incorpor syntact restrict facilit handl rule set disjunct normal form adapt gp oper work individu encod scheme introduct context machin learn data popular express knowledg consist rule due fact intuit human repres independ unit alter easili place content rule part part rule correspond conjunct condit verifi impli condit part rule consid true rule classic format condit constitut discret categor variabl presenc continu variabl creat situat thwart common ag problem sudden unnatur transit individu classifi safe driver todai complet year classifi safe driver lead data mine system complet predict interv singl dai altern work continu variabl overcom inconveni fuzzi logic express knowledg natur fuzzi logic flexibl power method uncertainti manag literatur techniqu discoveri fuzzi rule recent project evolutionari algorithm fuzzi rule discoveri global search state probabl converg global solut main characterist system make system system base fuzzi rule set membership function separ gener project base evolut singl popul popul fuzzi rule set evolv genet program popul membership function definit evolv simpl evolutionari algorithm system innov idea respect encod gp individu repres rule set basic idea individu encod scheme incorpor syntact restrict facilit handl rule set disjunct normal form adapt gp oper work individu encod scheme remaind paper organ section describ detail system section discuss comput result section conclud paper system fuzzi rule discoveri overview system section present overview fuzzi rule system system develop classif task data mine consist evolutionari algorithm genet program algorithm individu repres fuzzi rule set gp individu specifi pair rule condit individu rule set definit membership function interpret fuzzi rule condit individu provid popul algorithm simpl evolutionari work singl individu popul evolv principl natur select applic crossov singl individu specifi definit membership function attribut fuzzifi origin continu definit popul gp mention note categor attribut fuzzifi valu handl gp popul system simultan evolv fuzzi rule set membership function definit specif suit fuzzi rule set main advantag approach fit set membership function definit evalu fuzzi rule encod gp singl fuzzi set improv ness evalu basic idea discoveri recent main differ work system delgado work popul work delgado work genet algorithm evolv popul genet program evolv rule set work address classif task data delgado work address problem numer function approxim genet program popul rule system pittsburgh approach individu repres set rule rule condit predict predict rule attribut class valu goal attribut run system individu gp popul predict explicitli encod predict genom individu run discov rule predict singl system run number class approach process import simplifi individu avoid problem mate individu predict produc offspr individu correspond set rule encod disjunct normal form throat true ag true temperatur system function set logic oper individu repres fuzzi fuzzi version logic oper standard fuzzi oper denot membership element fuzzi set belong fuzzi set standard fuzzi set denot defin min denot minimum oper standard fuzzi set denot defin max denot maximum oper standard fuzzi set denot defin termin set consist condit attr attribut dataset attribut attr domain attr attribut attr continu mean fuzzifi system linguist linguist valu order reduc size search space order produc individu tree valid rule dnf syntact restrict tree root node except root node parent children kind node parent node children termin node parent node child node termin node condit form possibl cancel result genet termin node refer attribut rule tend produc invalid rule male sex fig show individu rule syntact constraint enforc creat individu initi popul modifi individu due action genet oper approach regard kind gp specif discoveri rule set disjunct normal make attract data mine applic fig tree repres rule main advantag work dnf directli tree convert rule set dnf gp make easier fulfil restrict hierarch posit easi collect termin node individu shown fig order check condit insert rule approach assur gp run syntact valid individu grammar implement syntact restrict drawback approach difficulti check syntact restrict lead number product rule grammar avoid logic grammar introduc complex system prefer direct implement syntact constraint select genet oper tournament select tournament size simpl individu smaller complex select complex measur formula complex number rule number condit extens motiv observ individu compet tournament fit individu individu select crossov perform similar convent gp differ case crossov oper respect syntact order crossov gener offspr crossov produc crossov oper fail children current version system crossov probabl common set literatur system offspr produc crossov necessarili insert popul popul updat strategi crossov produc offspr ad popul individu popul size individu sort fit worst individu remov popul number remov individu chosen number individu left popul constant popul set individu experi chose strategi select comparison convent strategi analog strategi emploi ea section main differ strategi top tournament classic strategi scheme system mutat oper node randomli chosen root node replac current version system individu undergo mutat probabl except individu gener undergo fit worsen fit function order calcul fit gp step comput tp number exampl cover individu rule class predict fp number exampl cover individu rule class class predict fn number exampl cover individu rule class predict tn number exampl cover individu rule class predict rule note true posit true neg correspond correct predict made individu posit neg correspond wrong predict made individu system fit gp individu comput formula tp tp fn tn fp tn data mine gener implicitli assum valu fn tn crisp commonplac assumpt invalid system discov fuzzi rule system cover rule rang correspond membership rule system comput fuzzi valu fn tn membership record rule set encod individu comput rule system comput membership condit rule membership entir rule comput fuzzi membership rule condit process repeat rule individu membership entir rule set comput fuzzi membership rule train class predict individu ls rule cover ls rule entir rule set cover current train cover rule fuzzi return membership entir rule set mean predict made individu correct wrong contribut number true posit number neg tree prune rule prune import data mine due effect code code greatli affect system perform initi prune dataset requir unaccept amount run time design oper prune gp tree basic idea oper randomli remov condit rule null coverag rule cover record cover record condit correspond remov entir rule rule set rule individu separ evalu null coverag condit drop rule condit randomli remov rule condit randomli chosen step rule remain null criterion number condit rule equal condit drop randomli rule cover record condit remov rule complet individu oper appli individu probabl individu worsen appli individu current gener motiv appli oper individu save process oper end individu undergo tree prune oper remov kind redund rule null coverag duplic rule final tree prune alter fit remov rule alter set exampl cover individu rule set membership function mention system valu continu attribut fuzzifi linguist high linguist valu defin trapezoid membership function continu attribut membership function membership function dynam modifi set paramet defin membership adapt attribut paramet membership function encod singl individu individu consid separ gp popul mention section popul gp popul individu individu divid part number attribut fuzzifi chromosom consist denot collect defin membership function shown fig gene repres attribut coordin trapezoid vertic belong pair membership function system ensur gl individu advantag reduc search space evolutionari algorithm save process number paramet optim evolutionari algorithm reduc enforc overlap membership function origin continu sum membership linguist valu intuit fig definit trapezoid membership function gene evolutionari algorithm evolv membership function perform crossov membership function evolut singl individu repres membership function result simpl evolutionari evolv mean strategi specif individu clone time clone exact copi origin individu system appli clone high rate mutat chromosom block contigu defin membership function singl probabl undergo mutat mutat question consist ad subtract small current gene effect shift coordin trapezoid vertic gene left note chromosom gene gene mutat rate chromosom correspond mutat rate gene motiv high mutat rate desir perform global search space candid membership function definit smaller mutat gene entir individu attribut modifi correspond kind local candid solut evalu fit differ solut account gene interact strategi scheme candid solut evalu differ solut effect gene modif evalu account gene interact attribut fuzzifi interact modif membership function evalu abil account attribut interact consid main motiv evolutionari local search algorithm clone undergon individu evalu fit function discuss subsect individu discard number clone experi empir determin good qualiti process time fit function recal individu popul repres definit membership function defin rule evolv gp popul qualiti individu popul depend predict accuraci individu popul scheme fit membership individu comput sum fit valu group individu gp popul comput system small portion gp popul experi report paper individu order reduc process time classifi exampl recal complet execut system gener rule set class found data set rule set classifi exampl test set test system comput membership rule set predict assign class rule set largest membership accuraci rate test set comput number correctli classifi test exampl divid total number test usual classif literatur comput result evalu system data set uci california data set repositori data set data set small number record unknown valu current version system cope record remov result report produc procedur order evalu perform system compar evolutionari system found discov crisp rule chosen comparison appli data set experi obtain good result comparison data mine system result report directli paper result produc result produc gener train test set tabl system obtain accuraci rate iri data set number bracket system standard data set system outperform system outperform iri data outperform system data set explan lower perform fuzzi rule discov system data set suggest larg number continu attribut data set suggest possibl simpl evolutionari algorithm section difficulti cope high number attribut fuzzifi case size search space larg simpl evolutionari algorithm hypothesi investig futur work tabl accuraci rate test data set system heart iri result bear mind unlik system advantag discov fuzzi tend intuit user threshold continu attribut crisp rule evolutionari system good amount comput time run singl iter process time vari coupl minut iri data set hour data set result obtain pentium ii shorter process time obtain parallel data mine techniqu point left futur research futur research system discov fuzzi classif rule system evolutionari genet program algorithm evolv popul fuzzi rule set simpl evolutionari algorithm evolv popul membership function definit tion final result process fuzzi rule set set membership function definit adapt main advantag approach fit set membership function definit evalu fuzzi rule encod gp singl fuzzi set make evalu robust order mitig problem long process system evalu set membership function definit gp individu system innov idea respect encod gp individu repres rule set basic idea individu encod scheme incorpor syntact restrict facilit handl rule set disjunct normal form adapt gp oper work individu encod scheme evalu system public domain data set compar evolutionari system found literatur data set result summar system outperform dataset equal data respect predict accuraci system competit data set data set system outperform outperform system data system advantag discov fuzzi tend intuit user crisp rule discov direct futur research gp tree prune oper system tree node prune randomli chosen research direct design prune tree node prune base estim predict power tree node note suggest research direct concern improv gp algorithm system import point investig futur research perform simpl evolutionari algorithm evolv membership function definit current version algorithm robust cope data set larg number attribut fuzzifi hypothesi investig lead improv current version simpl evolutionari algorithm refer fd genet program introduct morgan pj bentlei investig evolut fuzzi rule detect suspici insur claim proc genet evolutionari comput conf morgan la breslow dw aha simplifi survei knowledg engin mar fv modular hierarch evolutionari design fuzzi system proc genet evolutionari comput conf morgan um smyth data mine knowledg overview um fayyad al advanc knowledg discoveri data cs aa fuzzi rule induct algorithm principl data mine knowledg discoveri european conf lectur note artifici intellig aa freita survei evolutionari algorithm data mine knowledg discoveri ghosh advanc evolutionari comput aa freita sh mine larg parallel process kluwer academ dj hand construct assess classif rule john ishibuchi linguist rule extract machin learn proc genet evolutionari comput conf morgan hybrid fuzzi algorithm design compact fuzzi classif system proc ieee int conf fuzzi system ieee san usa cz genet algorithm learn machin learn gj klir yuan fuzzi set fuzzi logic wb poli ja foster evolut size shape wb oreilli pj angelin advanc genet program volum mit jj liu jt kwok extend genet rule induct algorithm proc congress evolutionari comput la usa juli dj montana strongli type genet program evolutionari comput ca sipper design breast cancer diagnost system hybrid methodolog proc ieee int conf fuzzi system se search tree build block evolutionari search classif proc congress evolutionari comput la usa juli walter ck mohan fuzzi classifi system diagnosi proc congress evolutionari comput la ca ml wong ks leung data mine grammar base genet program applic gener linguist fuzzi rule pattern classif genet algorithm principl data mine knowledg discoveri lectur note artifici intellig
Agents/1330 1 agent program languag hindrik mark michael luck abstract field system continu expand problem li compar evalu rel benefit disadvantag system due wai system present solut develop set architectur build block basi construct avoid ensur strong simpl mean present comparison analysi agent system address issu provid architectur framework agent program languag start point identif specif gener individu agent compon addit move work road contribut grow librari agent techniqu detail comparison system similar wai introduct problem face dynam field system draw dispar strand work aim address issu plethora agent languag architectur develop recent year highlight problem reaction effort receiv part understand argu kei relat reason extrem difficult compar evalu rel benefit disadvantag system result approach focu architectur languag obscur fundament build block built attempt avoid pitfal continu develop languag architectur inadequ justif relat broader work uniform perspect enabl stronger comparison system approach work dmar consist compar attempt address concern clarifi approach depart comput universiteit po box tb school comput london depart comput eral properti agent enabl set build block agent architectur schema action updat goal plan reflect paper formal specif compon dmar specif compar highlight major distinct difficulti compar approach part deriv fact clear formal present languag architectur question system present mean formal differ style formal readili facilit comparison aim introduc system mean case agent program languag architectur provid understand system gener access provid rout system develop achiev standard formal specif agent languag architectur uniform present languag architectur clear enabl easili relat compar system work move step closer unifi account agent languag architectur aim unifi account unifi languag system contribut work present outlin oper specif basi subsequ transit call theori practic facilit easi simpl comparison competitor system demonstr paper comparison consid data structur requir requir defin agent basic oper agent program languag provid access resourc specif techniqu develop agent system form relev agent architect develop provid intermedi level agent program languag complet provid librari build block construct agent architectur program languag focu present formal show point diverg kei system support design construct intellig agent develop complex system set intuit concept goal describ understand comput system natur support style program mean express set primit program consist set goal practic reason rule belief repres issu agent deal goal agent focu achiev repres achiev goal repres achiev goal plan practic reason rule provid agent plan capabl find plan achiev capabl creat capabl rule plan oper semant mean transit semant move closer good tool result comput model includ data oper isol effici implement altern highlight aspect languag architectur manifest similar transit style semant specif assum familiar note detail includ due space complet specif system compar action goal belief goal basic compon dmar base belief formula order languag defin usual order term defin mean set order variabl function symbol program languag distinguish order variabl variabl rang defin partit set variabl denot set order variabl denot set goal variabl set function symbol denot order term order variabl function symbol sequenc term paramet ¢ seq belief action belief defin build type belief atom predic symbol set symbol denot sequenc term argument belief conjunct implic true atom head term seq belief ¢ belief ¢ belief true definit term ident dmar limit conjunct whilst dmar disjunct addit featur simpl matter compar data structur build librari belief requir design agent languag agent accomplish task perform repres action symbol dmar action term seq goal goal repres goal plan achiev goal agent structur built basic regular imper program sequenti composit nondeterminist choic goal mental attitud plan action achiev state state affair desir agent agent adopt finish send ecai programm chair pursuit desir accept context formal describ introduc notion context notion context refer plan precondit term belief system goal extra featur call act placehold structur goal role context enabl eleg present architectur languag context basic queri achiev sequenti composit nondeterminist choic goal repres place context context definit set goal process call goal place context ¢ ¢ denot placehold hole distinct goal variabl £ facil goal variabl part defin goal context occurr £ formal definit auxiliari function count occurr £ context goal context data structur dmar goal achiev queri atom queri belief action goal procedur knowledg virtu fundament data structur essenti describ possibl includ action distinct repres plan plan sequenc basic queri goal achiev goal bodi seq bodi plan tree branch goal intern extern queri achiev plan path root leaf node found state ¢ goal ¢ bodi data structur ramif oper agent system dmar requir event trigger placement plan subgoal queue plan plan gener subgoal ad exist stack plan execut event unnecessari goal modifi process plan simpli attempt execut current goal practic reason rule compon practic reason tradit plan common reflect goal aspect plan fail respect goal pursu optim strategi kind rule reactiv rule respond current situat creat find plan achiev replan replac effect plan optim reactiv failur plan practic reason rule consist head bodi guard type defin rule head bodi guard state agent achiev goal situat replac plan mean achiev form achiev simpl rule state plan offer achiev state replac empti head appli guard bodi guard belief type head type reactiv head ran achiev bodi type plan guard serv situat rule enabl paramet retriev belief similar definit plan defin trigger event addit remov belief set bodi procedur knowledg agent sequenc goal action plan practic reason rule trigger bodi trigger option goal practic reason rule deal reactiv goal plan failur plan addit partli goal variabl agent section show agent construct base basic compon contrast dmar similar point diverg system dmar larg omit discuss due space constraint agent mental state agent term practic reason rule belief goal dynam updat rule fix chang agent defin entiti static set practic reason rule è è set capabl plan librari belief record goal make mental state agent updat execut è goal state agent includ execut event action perform belief è belief intent è intent event è action action system mention paper similar initi state state variabl part agent set empti defin mental state agent chang inform agent definit agent oper semant notion oper agent semant basic action defin global specifi action updat oper belief agent execut global agent capabl perform action thing execut import prevent program agent execut action ¢ logic consequ relat determin infer agent deriv global ensur agent draw belief amount global è ¢ è belief relat semant notion belief similar set belief logic consequ set belief system term perform action impact state agent gener global function definit determin belief chang perform action updat semant state construct introduc deriv view set gener architectur build block contribut link unifi work agent program architectur li reduc overhead occur frequent theori practic section specif address oper applic practic reason rule practic reason rule creat goal applic rule goal result replac subgoal match head rule bodi rule bodi rule subgoal simpli drop yield substitut appli entir result goal head guard deriv belief goal ad agent order explain rule introduc notion front context occurr £ front context element front context mean agent perform element £ front context replac goal perform remaind goal task rule applic find front context fc subgoal insert £ front result goal ident appli amount updat fc bodi rule crucial differ insert updat insert goal front context simpli mean substitut goal £ front updat front context goal mean replac £ goal commit choic made subgoal choic goal mean commit branch subgoal choic defin similar function insert goal squar front context updat front context goal present ug due space give signatur detail found insert goal ¢ goal ug ¢ fc goal ug £ empti ug fc ug comp ug fc ug choic ug fc ug choic fc ug fc empti ug fc ug comp ug choic ug choic fc note front context form choic goal goal insert ug yield ug choic reflect fact agent updat choic requir agent commit subgoal squar select made insert function simpli substitut goal insert choic rule applic head unifi agent guard rule belief applic respect set fc insert fc mgu dom þ definit auxiliari return set order variabl appli substitut belief rule applic simpli guard head rule appli rule amount replac subgoal bodi rule bodi simpli ad care avoid variabl occur rule variabl occur goal variabl rule appli renam variabl occur target function defin renam variabl rule variabl set occur renam rule auxiliari function analog function return set order variabl goal rr rr reactiv fc goal insert fc substitut dom mgu þ þ insert fc execut goal execut goal comput step agent perform correspond simpl action basic action queri belief recal semant basic action global function execut semant belief relat agent execut basic action queri occur front thing agent notion front context find action queri agent execut front context basic action queri insert result goal agent execut basic action queri execut goal updat updat front context remov £ execut basic action amount chang agent accord function execut condit dom execut express basic action execut fc action insert fc dom execut execut ug fc queri goal check condit agent free variabl condit queri retriev data valu retriev record substitut queri execut consequ fc belief insert queri fc substitut ug fc comparison aspect process event execut intent process event involv select plan trigger event ad intent intent stack execut intent select locat topmost perform compon queri goal achiev goal post intent finish execut point case action remov agent appli replac front context current goal bodi execut turn amount execut basic action queri goal front goal control structur involv process event select updat intent execut intent control structur base classif rule richer descript agent oper altern control structur provid agent substanti simplifi whilst retain function note concept specif repres oper clear execut plan simpli schema simpl function manipul list critic level recent agent research contribut relat similar work broader field unclear due inabl identifi link system compar lead agent architectur languag solut problem develop set architectur build block basi ensur strong effect mean present differ similar easili identifi compar provid specif address difficulti compar system similarli dmar languag architectur unifi present specif reduc complex semant languag architectur advantag build work illustr formal specif enabl kei build block agent architectur comparison benefit weak agent express power agent languag work aim perform function basi architectur framework present refer formal architectur program intern confer user formal specif intellig agent fourth intern workshop agent architectur lnai pp formal comput journal logic formal specif agent journal logic de van der ch semant abstract agent program intellig agent fourth intern workshop agent architectur lnai pp de van der ch structur agent intellig agent lnai bdi agent speak logic comput agent break seventh european workshop model autonom agent lnai van de veld pp refer prentic
AI/1331 2 local uncertainti estim occup grid clark olson jet california institut technolog oak grove mail stop ca abstract describ techniqu perform mobil robot local occup grid local uncertainti estim pixel pose space techniqu base local method match perform visibl landmark current robot posit gener map environ likelihood function space robot posit formul function probabl distribut map match error local uncertainti estim perform fit likelihood function surfac perform method analyz synthet experi mar rover prototyp introduct local critic issu mobil robot robot effect plan locat reach goal import perform accur local local estim larg uncertainti qualit failur local occur environ recogniz landmark locat similar robot crucial addit data collect improv robot local paper describ techniqu perform accur local pixel pose suffici inform gener uncertainti estim local standard deviat local probabl qualit qualiti data techniqu describ gener natur appli map concentr applic techniqu occup build report result perform local match terrain map comparison measur review basic local method techniqu comput map similar measur probabl distribut function distanc occupi cell local terrain map comput current robot posit closest occupi cell comput map environ accur approxim probabl distribut function weight sum normal distribut case cell constant distribut case cell pdf form core likelihood function robot pose local uncertainti estim perform fit peak likelihood function surfac approxim peak likelihood function normal distribut oper domain fit peak polynomi locat surfac yield local estim discret pose space rate surfac fall peak estim uncertainti local probabl qualit failur estim compar likelihood score peak likelihood score rest pose space techniqu appli mobil robot approxim size shape built jet laboratori order develop technolog futur mission mar techniqu test jpl mar yard simul condit figur gener rang map jpl mar yard mast camera local basic local techniqu compar map gener current robot posit local gener map environ global techniqu review relat techniqu terrain map gener local map global map stereo vision robot global map consist combin result previou local map gener panoram imageri robot start rang imag gener stereo camera rang imag convert occup grid canon orient bin oper assum robot orient averag height rang point fall bin height grid locat filter height search robot posit perform direct figur show terrain map gener data mar pathfind mission map similar measur order formul match problem term set measur function robot posit conveni set measur distanc occupi cell local map closest occupi cell global map denot distanc robot posit likelihood function robot posit formul product probabl distribut distanc work ln ln ln map similar measur defin probabl distribut function probabl distribut function discuss detail section search strategi search strategi determin robot posit method locat optim posit discret search space pose space discret resolut occup grid neighbor posit pose space move rel posit grid grid cell test nomin posit robot initi posit likelihood compar pose space divid cell cell test determin posit posit found cell prune divid smaller examin cell reach singl posit discret pose posit test explicitli determin cell pose superior found examin pose center cell bound comput maximum distanc locat cell local map transform pose cell call distanc space simpli distanc corner cell place bound qualiti posit bound distanc achiev featur local map cell subtract maximum chang distanc achiev center valu obtain propag likelihood function bound score achiev posit cell ln bill dice figur terrain map gener pathfind imageri imag mosaic rock mar terrain map gener stereo imageri maximum score ith featur local map contribut likelihood posit cell bound likelihood found posit cell max ln bound surpass found entir cell prune search cell divid cell slice longest axi process repeat estim pdf uncertainti estim import probabl distribut function close model sensor uncertainti accomplish pdf weight sum term describ error distribut cell terrain posit local map exist global combin error local global map posit absenc addit inform assum pdf monoton true reason desir closer match yield higher score respect sensor approxim normal oe term describ error distribut cell outlier case posit repres cell local map global map due rang shadow present global map construct outlier present rang data local map construct term true outlier occupi cell global map patholog case undu effect likelihood robot posit found model term constant conveni constant probabl distribut function ff probabl cell local map occup assum larg local insensit variabl oe standard deviat measur determin characterist estim empir examin real method local expect probabl densiti measur gener random outlier dxdy estim quickli examin euclidean distanc transform map local probabilist formul local estim uncertainti local term varianc estim posit probabl qualit failur occur likelihood function measur probabl posit pose space actual robot uncertainti local measur rate likelihood function fall peak perform local discret pose space fit surfac peak occur robot posit assum likelihood function approxim normal distribut neighborhood peak locat fit normal distribut comput likelihood yield estim varianc local estim estim peak locat approxim likelihood function normal distribut yield good fit local neighborhood peak result accur result achiev assumpt perform comput domain natur logarithm likelihood fit valu polynomi order assum independ ln ln oe ln oe order estim paramet interest oe oe project polynomi line ln ln oe ln ln oe fit equat likelihood function locat peak peak discret search space occur posit fit valu surround posit label fl fit ax solv oe oe deriv oe project line valu yield local estim locat peak likelihood function oe oe yield direct estim uncertainti local result probabl failur addit estim uncertainti local likelihood score estim probabl failur detect correct posit robot terrain yield landmark refer local posit similar robot estim probabl failur sum likelihood score peak select robot posit compar sum likelihood score part peak estim sum peak examin small number valu fall quickli valu remaind pose space estim effici addit comput search cell search space comput bound maximum score estim averag score achiev determin score center cell cell likelihood local error standard deviat likelihood figur distribut error estim standard deviat synthet landmark local experi comparison estim distribut local error observ distribut local error distribut estim standard deviat local estim sum increment estim score multipli size cell yield good region larg score prune cell small sum obtain largest peak pose space sum entir pose space estim probabl correct largest peak result techniqu test synthet data compar perform techniqu real experi rover prototyp synthet data appli techniqu local landmark synthet experi randomli gener synthet environ landmark squar unit cm entir problem scale arbitrari ten landmark closest random robot locat consid observ robot gaussian error standard deviat oe spuriou landmark includ map local perform observ landmark discret occup knowledg posit robot environ robot correctli local averag error correct trial unit dimens averag estim standard deviat local techniqu previou section unit figur show distribut actual error observ versu distribut expect averag standard deviat estim trial close similar plot averag estim standard deviat good estim actual estim slightli smaller true frequenc observ error slightli curv tail lower peak similar high figur show distribut estim standard deviat experi observ estim consist plot strongli peak locat averag estim plot standard deviat estim accur individu trial test probabl correct measur trial trial result correct averag comput probabl correct trial result failur probabl correct measur yield inform evalu local result reliabl comparison techniqu version perform local local reduc error local real addit experi perform mar rover prototyp jpl mar yard figur show rover gener map terrain start posit stereo pair imag cover area rock design local target rover captur stereo pair imag direct local target local perform match rang map gener move terrain map gener move rover determin move meter figur perform local move terrain map move area imag perform local origin close measur result meter summari paper techniqu perform accur local uncertainti estim discret occup grid method base method regist occup grid repres robot visibl environ gener map map registr measur formul probabl distribut function distanc cell local map closest cell global map order perform local uncertainti likelihood function fit surfac neighborhood highest peak probabl qualit failur estim examin score entir pose space experi synthet data demonstr approach yield superior result case techniqu uncertainti estim gener integr multipl local step techniqu kalman filter framework techniqu appli local mar rover prototyp acknowledg research paper carri jet california institut contract nation aeronaut space administr work element long rang scienc rover develop technolog futur mar mission project fund part nasa space telerobot jpl robot mar explor technolog offic refer elf map navig ieee journal robot june al mar prototyp ieee confer robot volum page huttenloch techniqu compar imag hausdorff distanc ieee confer comput vision pattern page kanad terrain map multipl sensor data ieee transact pattern analysi machin februari stereo vision planetari stochast model implement intern journal comput juli olson probabilist formul hausdorff match ieee confer comput vision pattern page olson rover local match rang map intern confer robot page pavel effici algorithm euclidean distanc transform parallel process
HCI/1332 4 technolog design reflect lar johan plai research interact sweden comput increasingli fabric everydai interact design chang creat fast effici tool limit time specif creat technolog surround part activ long period time present slow design agenda technolog aim reflect moment mental rest effici perform aim paper develop design philosophi slow discuss gener design principl revisit basic issu interact design philosoph point view discuss exampl inform art instanc slow technolog exampl design principl appli practic inform slow ubiquit comput introduct kind object reconsid principl design lead extens plural term design principl goal situat user group incompat demand expect main inform technolog make peopl effici carri task background comput offic autom effici scientif highli reason design agenda inform technolog origin offic environ scientif comput longer select group busi demand design technolog comput entertain long time comput game drive forc hardwar develop artist frequent comput medium creat genr interact art music area pose special demand lead develop special interfac compon draw tablet midi keyboard develop interfac compon import part hci research london person ubiquit comput ment concentr comput tool specif situat accomplish task comput increasingli turn tool explicitli specif situat continu present part design environ aspect transit time perspect simpli encompass moment explicit longer period time dwell compar design situat person sit design long period time peopl sit chair part environ case impli afford sit aesthet integr rest research work varieti aspect integr comput technolog physic environ ubiquit comput concern support peopl relev comput resourc work augment realiti explor digit inform integr object environ exampl calm technolog ambient media design smooth integr digit inform physic advantag human attent number inform displai aim reduc cognit load give user background access inform develop calm technolog ambient displai design resid peripheri continu provid contextu inform demand consciou effort behalf creat calm activ promot moment reflect mental rest rapidli chang environ challeng technolog answer call design philosophi slow technolog tradit design depend complet accur model dimens space time call left care scale design design object design thing design shape point design acknowledg rel ignor learn fig piec inform art beauti design time design design life form call touch felt insensit form jc jone interact design natur foundat understand relat environ continu chang behaviour turn chang environ interior artist long work technolog design initi recent issu design gain interest hci commun characterist inform comput technolog initi reflect partial answer question technolog slow natur imagin electron plai short fragment long melodi time press button fulli grasp stop reflect moment time ring time grasp melodi technolog claim time ordinari plai tone differ aesthet differ philosophi design effici signal mechan artefact express slow put reflect focu design reflect world express time presenc kei paramet compar distinct hamburg meal case food fundament differ hamburg effici uniform eat cuisin slow term prepar invit reflect art cook art eat question function versu aesthet analog distinct fast technolog slow technolog good design tool specif term fast fast effici function respect task fast technolog aim time aim time term make user effici work task make artefact fast easi question long averag user perform action learn technolog time long journei meet singl phone time reflect syntax languag disappear singl click word processor technolog slow wai time learn work understand work work appli find consequ reason slow bad design complex task unintent slow result frustrat behalf user descript basic intent slow understand presenc iv work piec music object design reflect design deep root art concern amplifi presenc thing make effici tool task express design invit slow technolog respect true time reflect presenc necessarili kei design notion slow technolog technolog slow respect import note distinct fast slow technolog distinct term time metaphor distinct time presenc thing effici time thing accept invit reflect inher design mean hand time open time presenc kei issu slow design slow understand presenc give peopl time reflect object time consum time time reflect activ technolog compress time technolog suppli time thing technolog useless fast impress time slow technolog technolog aesthet express function focu design concern relat express technolog thing function concern door open design focu relat express slow technolog design appli aesthet design basic reflect slow consequ design philosophi reflect consciou technolog slow slow technolog design reflect technolog technolog slow presenc simpli inher design reason pure aesthet design time central explicit notion technolog focu time presenc slow result concentr thing time effect slow reflect aesthet aspect chang perspect thing accomplish task effici delic design mechan watch invit reflect technolog make slow watch fast access time collect watch pure act reflect technolog thing mode switch back slow fast perspect strang design thing definit term function slow technolog share interest tight integr comput media rest design physic environ approach calm technolog ambient media slow technolog differ reduc cognit load make digit inform comput resourc readili slow technolog make technolog technolog encourag peopl reflect design challeng call consciou aesthet technolog technolog solut specif technic thing specif express situat live environ exampl project typic exampl artefact made encourag reflect art found art exhibit concert hall slow ubiquit inform technolog everydai life focu back tradit place design reflect environ present design built part time interior conceiv work art chang perspect art object build offic situat longer heat place rain sit complex uniti interest express root reflect environ artist work transit bring aspect express thing art object design everydai thing design programm slow technolog distinguish aspect reflect time technolog amplifi environ make specif design theme programm reflect technolog theme concern design technolog invit reflect time reflect express basic challeng design technolog elementari express open reflect question piec technolog technolog awkward grant tool technolog earli develop function express remind specif piec technolog technolog event perfect function slim design comput technolog typic earli stage develop awar elementari express technolog present lost express fast effici technolog call slow technolog slow design express instrument make room invit slow presenc elementari technolog tool make reflect inher design express time technolog theme concern design technolog express amplifi presenc absenc time basic challeng design technolog give time thing technolog time technolog stretch time slow thing good music instrument typic technolog master art plai good piec technolog express plai amplifi presenc time call slow technolog design technolog true reveal slow express present time amplifi environ theme concern design technolog set enlarg amplif environ amplifi realiti comput technolog enhanc express function exist artefact kind typic electron audio technolog combin amplifi enabl musician perform wai acoust instrument basic challeng design set amplifi express environ practic enlarg space time call slow technolog slow design express amplifi environ time present exampl slow technolog exampl fall inform art movabl thing room give room sound equip live make room movabl thing room equip sound sound sound start pattern air pressur oscil reach sound sound sourc defin constitut environ clock tick door hing oil wall floor room sound peopl move absenc sound properti furnitur thing fast practic tool sound central properti materi amplifi presenc thing make learn understand slower sing floor built warn rock chair complex sound behaviour fact live walk form interact environ made explicit sound floor piec view instrument plai familiar song connect focu elementari properti floor continu build room aspect presenc express thing modern comput audio technolog vastli possibl design challeng design furnitur focu sound materi design slow technolog matter sound central properti materi build furnitur matter modern audio technolog combin comput technolog amplifi redefin environ present exampl case differ creat piec instal creat build piec matter intersect area point slow technolog attempt join idea environ interior develop inform technolog microphon record sound fragment corridor offic fragment plai back corridor vari time delai record sound fragment slow technolog design reflect creat similar time seri fragment delai structur understand care reflect long period time predict audio mirror reflect present sound notic sound plai sound earlier sound event corridor structur class pattern make seri understand question technolog aim basic design question experi mixtur simpl audio technolog sophist time composit function basi reflect audio design make peopl reflect amplifi notion corridor public place order obtain structur suffici rich complex gain interest long period time multipl layer captur playback studio monitor audio level level ordinari corridor order obtain sound work part environ placement microphon critic experi attempt hide make act visual marker fact record place hide microphon ensur fig integr environ imagin room corridor design integr interior build art concentr light sound dark silenc lamp bring light dark bring sound silenc resid term piec base sound emerg complet complet silent respect background room ordinari turn case dark silent light lamp concentr act intens reflect sound made room compar music den implement wai sound difficult ensur complet silent order hear sound headphon sound extrem direct engag build complex acoust model room isol sound lamp background furnitur sound presenc issu comput technolog combin sensor audio technolog build wall thing reson resourc amplifi sound presenc peopl room sensor technolog implement floor inform histori presenc walk part floor peopl walk implement repres aspect aspect time audio express floor fashion floor gradual express time peopl build rock chair focu sound materi shape chair object control uniqu sound defin sit chair chair sit chair distinct presenc amplifi sound piec rich express chair chair aesthet sit focu close relat sonic furnitur build sort social interact modern comput technolog inform art furnish wall offic place partli emploi aesthet function decor object creat pictur poster serv kind statement enabl visitor clue place peopl live work inform art art capabl present inform locat map inform structur colour tradit form inform design problem creat structur repres inform effici readabl inform structur convent poster pictur order fit desir set aesthet prefer main problem make structur carri desir set inform note issu inform art creat art se explor design space inform present point view abstract inform displai experi displai time structur term clock inspir colour time structur interpret properti inform clock slowli displai time term small colour simpl geometr fig piec inform art left abstract clock slow technolog design reflect fig fig base system structur inspir paint experi map dynam inform structur geometr displai techniqu gener grammar system fig map inform complex pattern composit creat inform art slightli complex sourc box continu email electron document issu natur restrict extent natur materi store sentenc inform syntax fig continu gener sentenc base materi recombin materi swap word sentenc sentenc dine room public place peopl quick glanc pass experi kind includ base credit displai base word sentenc fall top screen speed whirl bottom basic idea provid entertain inspir variat materi produc offic serv slow tool workplac awar time small distort fragment origin materi present ordinari random part word sentenc structur slowli form understand underli materi final understand rule sentenc gener visitor familiar origin materi submit form kind understand activ reflect materi work serv slow technolog term visual perceiv understand time form function basic principl slow technolog amplifi presenc thing make silent tool fast access amplif matter aesthet concern thing talk function complet express thing context case word processor easi point tool support user write construct document design thing invit make room reflect obviou function support reflect issu simpli put sign reflect basic reason sign messag express give mean intend act reflect assum function paint hang wall make put mood smile remind sign wall capit letter paint kei reason substitut pointless remind sign paint smile express paint reproduct hang wall import function thing design invit make room reflect inher mean reflect total express function inher design express slow technolog interact design interplai form function form process learn structur build live environ form structur present design structur presenc slow technolog form bring function present context form necessarili consequ primari function object instanc slow object gradual turn mirror gradual delet mirror imag function form extent hide basic function mirror similar due form hide pictur form cover primari function object slow evalu slow technolog implic design evalu chang evalu design object specif slow relev question build prototyp set import slow technolog practic studi develop principl interact design present context question good design intim question design thing case argu basic tool understand tool case work basic understand explain piec empir studi collect concert visitor answer question formul empir studi rest exampl slow technolog present work art tool share properti extrem argu good design slow technolog primarili logic kei factor creat serv reflect object design evalu investig similar method develop art evalu art explan understand evalu slow technolog share characterist typic interact design methodolog aim creat build block peopl furnish environ empir evalu carri show slow technolog carefulli frame slow technolog design reflect introduc order perceiv poorli design useless tool part problem introduc kind technolog behav expect find art exhibit music context inform technolog everydai life rang set differ result peopl perceiv ineffici transform inform degrad inspir prototyp recept parti made peopl laugh talk text develop guidelin slow technolog basic idea exampl slow technolog simplic materi combin complex form digit creat immedi appeal impress case slow technolog creat excit visual present creat innov text gener natur languag parser import part main present materi submit special recombin transform partli familiar fragment text make impress technolog point start question start point reflect sentenc similar question exampl simplic materi invit peopl reflect obviou complex form modest stand find work combin modest slow make slow technolog interest case design make technolog interest stimul present long period time experi present basic guidelin slow focu slow presenc slow design presenc form focu aesthet materi simpl basic tool modern technolog clear simpl design presenc design give time reflect slow invit reflect distinct simpl combin simplic materi subtl complex form time basic element composit technolog bring hide conclud remark interact design area hci concern tool work method specif task gener interact design concern design environ task occur interact design design structur express presenc build interact environ notion slow technolog calm kind type interact design bring uniform approach basic notion inher relat form function design slow kei factor bring make room reflect idea design design form express clear point converg design art design philosophi slow technolog converg rang exampl modest form collabor program slow technolog call creativ artist express world inform attempt revisit basic problem interfac design perspect bear idea design deriv disciplin attempt discuss foundat design inform technolog import aesthet slow technolog consequ design focu logic design easi studi technolog design object function art predomin studi develop tool turn architectur interior environ combin aesthet technolog issu central comput increasingli part everydai combin interest great import interact design transit complement perspect technolog perspect inform technolog part complex design inhabit environ import futur design methodolog impli engag rang issu role effect open interest possibl possibl slow part ad support activ place acknowledg author tobia peter ljungstrand lar erik holmquist refer springer electron art anim catalog siggraph acm buxton empir evalu graspabl user input acm streitz konomi cooper integr architectur lectur note comput scienc nr weiser comput centuri scientif american rekimoto augment spatial continu work space hybrid comput environ chi acm wellner mackai gold back real world special issu environ commun weiser brown design calm technolog journal ishii tangibl seamless interfac bit atom chi acm hudson tanaka inform ambient inform displai decor object uist acm pedersen abstract presenc support mutual awar chi acm wisneski ishii brave ullmer ambient turn space interfac peopl digit inform streitz konomi cooper integr architectur lectur note comput scienc nr jone jc design edit john wilei dunn electron aesthet experi critic design research dunn project conceptu design cultur effect acm norman da psycholog everydai thing design everydai basic buchanan human design buchanan discov design explor design studi art aesthet redefin buchanan discov design explor design studi harri art innov xerox resid program mit resnick berg black bring transpar aesthet back scientif investig journal learn scienc falk amplifi realiti gellersen handheld ubiquit comput lectur note comput scienc commun futur benyon smith annual pf interact environ music multimedia multimedia system de anthropolog commun harri art innov xerox program mit tune world alfr au den slow technolog design reflect jone fs activ floor ieee person commun inform amplifi ambient displai mackai dare holmquist le continu visual web site traffic public place turner extend abstract chi acm faber artist idea improv applic usabl di interact acm search synergi inform technolog model natur phenomena art scienc ljungstrand text manipul entertain inform displai fel graphic interfac goodman art art pp art technolog person observ art scienc weibel unreason methodolog converg art scienc art scienc dunn methodolog art object design issu research design design research design issu nardi inform technolog heart mit correspond plai research interact box sweden
HCI/1333 4 applic oo analysi agent base system applic orient analysi agent base system elizabeth margaret harvei jiang depart comput system royal melbourn institut technolog citi gpo box vic australia email abstract agent import softwar abstract distribut problem solv activ behavior includ network advanc user interfac worldwid web applic agent system softwar engin methodolog relationship agent role object orient analysi multiag system develop discuss approach illustr case studi discret part manufactur introduct numer exampl found applic agent base system integr concurr engin manufactur agent base system develop network manag schedul advanc user interfac system exhibit advanc distribut problem solv behavior humancomput interact web busi process manag agent carri autonom behavior cooper negoti repres import softwar abstract metaphor agent orient system wide integr mainstream softwar engin import agent base system develop artifici intellig develop methodolog initi work softwar engin agent base system concentr softwar architectur omit specif previou work agent identifi process data store data flow diagram real time extens agent behavior data flow process work flow data flow agent agent cooper coordin activ individu organ agent design implement workflow exist methodolog object orient model analysi extend encompass agent orient system case driven object orient softwar engin approach extens constraint technolog result methodolog agent base system agent definit view weak strong weak definit agenc agent autonom agent oper direct migrat processor social agent interact reactiv agent perceiv environ respond occur activ agent affect environ passiv environ affect exampl weak agent softwar agent develop worldwid web applic act user behalf basi user trend strong definit agenc addit mentalist notion agent belief intent ration agent perform action adapt learn strong agent reflect behavior artifici reason knowledg belief order determin agent behavior repres term plan librari agent interpret select plan plan librari basi goal accomplish invoc condit met goal repres state affair agent test maintain plan instanti trigger applic oo analysi agent base system event occur instanti plan intent execut thread control hybrid agent aspect weak strong develop address problem formal human problem constraint base applic schedul resourc alloc type agent solv distribut constraint satisfact problem type problem repres term variabl constraint tempor natur due depend variabl agent variabl constraint solut sought search heurist base textur problem metric heurist attempt solv difficult aspect problem solut constraint relax procedur carri agent reli heurist mentalist approach problem solv reflect agent aspect constraint technolog address item learn address agent cooper agent oper distribut cooper agent agent requir mechan commun includ human agent kqml queri manipul languag simpl commun agent base program agent engag protocol repres speech languag develop support cool extens kqml agent make accept reject notifi agent goal failur special mechan introduc protocol extens predefin agent behavior defin script sampl script contract agent act contractor manag agent bid perform task suggest contractor state relat shown figur figur denot basic contract net manag script extend wai direct award option add check direct direct award made direct award script special basic contract net ad state transit success start failur announc task announc bid award award success start failur announc task announc bid award award check direct award direct award award award reject accept figur contract net script figur contract net script direct award addit relat work result preliminari categor basic type agent consid narrow singl function agent approach valuabl address applic abstract level problem view extens special problem singl function agent protocol understand agent work solv distribut constraint satisfact collabor resourc occur collabor competit shown give suboptim solut resourc exist agent form swap carri constraint relax order attain accept solut realist problem constraint technolog solv problem formal human knowledg applic oo analysi agent base system opportunist script protocol solut agent directli determin conflict resolut carri establish protocol procedur relev orient techniqu relationship agent object investig address differ agent object object sensor effector agent case agent object agent real autonom object carri behavior object object term activ sequenti execut method member strong agent encompass autom reason number altern object commun unstructur agent emploi kqml similar languag commun structur messag autonom agent abil migrat processor item discuss summar agent inherit unstructur messag activ concurr collabor structur messag distinct agent behavior cite address set depict figur agent figur reason proactiv behavior collabor structur messag research companion paper determin object orient design pattern relev activ object pattern broker pattern mediat proxi pattern structur start simplest relationship object agent section processor declar model capabl servic interpret agent agent migrat intent intent collabor intent collabor agent agent pattern pattern thread control extern object extern object figur agent behavior object object effector relationship agent object belief knowledg level passiv object store attribut belief inherit basi attribut emploi build compound data structur repres belief ontolingua project produc softwar system translat frame base knowledg kif belief vice versa ontolingua directli translat static properti object agent belief kif predic calculu vice versa agent declar knowledg involv thought interrel belief object orient constraint base develop made object intern state relationship object state variabl relationship object repres type constraint object encapsul aspect object orient util agent initi carri behavior true object sensor effector agent interact extern object shown figur sensor object applic oo analysi agent base system monitor filter output constrain unconstrain object alert agent condit exist effector object carri agent intent impact object environ effector object agent action relai object applic extern object agent emploi constraint solver collabor capabl initi effector team work accomplish goal agent sensor watch extern agent make effector bring desir agent messag agent sensor effector accomplish object understand structur messag agent commun object unstructur messag design detail address case agent collabor structur messag negoti protocol repres featur agent base system found kind system object orient analysi involv event trace messag larg scale applic event trace complex event trace mechan avoid abstract special case approach orient analysi capabl case type scenario event trace describ user interact system show object interact case class object special case extend mean insert ad definit extend relationship occur circumst context condit case vari level inherit util provid special case pure concret instanti multipl inherit emploi case ancestor case depict human organ enter interact object orient system case repres mode oper actor role agent enter applic augment autom human reason collabor agent replac directli support actor case full requir case scenario level detail case extens map actor plan condit extend relationship case insert circumst exist correspond context invoc condit determin agent plan intend condit case extens addit case relev scenario compat concept plan intend actor collabor cooper messag pass negoti agent base actor resourc agent negoti inform exchang coordin protocol case actor abstract special correct level type behavior exhibit recogn belong type singl function agent interchang actor event trace identifi abstract special coordin protocol agent specif analysi base discuss agent applic behavior autom make requir behavior autom make control requir augment replac human make agent case replac assist actor system compon case requir autom make behavior featur agent case case give rise control make workflow case workflow case diagram diagram complet level function directli case case group behavior relat sequenc workflow diagram show control flow applic term hierarchi function function mechan function control inform output captur make compon applic applic oo analysi agent base system result summar figur function modifi show agent input output interior show sensor effector agent passiv object shown belief instanti plan intent interpret kind intent illustr task involv coordin task invok effector task impact agent belief interpret sensor receiv input effector impact extern object case extens diagram translat agent plan control input output actor sensor object extern object effector object extern object coordin interpret belief case plan goal intent task task task legend agent function figur correspond case agent correspond case model agent system compon summar tabl function control output direct relev agent orient correspond type case case agent goal plan agent actor resourc mechan workflow control input determin case extens actor case agent engag cooper coordin sequenc script event trace case case script lead abstract agent protocol case object orient analysi agent mechan actor agent input entiti object actor coexist object sensor belief type scenario case case extens control condit case extens context invoc condit output entiti object actor effector coexist object collabor subsystem user actor case case event trace case abstract special agent collabor coordin protocol coordin protocol abstract special case studi methodolog specif analysi illustr case studi discret part manufactur custom place order part part select group cost control feedback import element cost impact polici cost cost trend consid analysi function model diagram provid figur actual form cut part input output mechan control feedback discuss feedback path batch schedul polici applic oo analysi agent base system impact cost evalu polici level diagram figur detail level determin function determin control output creat part part part list sale select part sheet select polici priorit part sheet select assign machin machin schedul polici assign batch schedul creat batch batch polici batch batch control priorit part sheet machin determin evalu cost cost polici cost batch cost materi figur function model overview case studi case case studi shown figur stick figur repres actor label oval depict case relationship shown dash doubl head actor case scenario extend relationship solid singl head case extend add step scenario condit actor base case case doubl arrow repeat assign machin set schedul polici set select polici select part sheet schedul set batch polici creat batch batch control select evalu cost determin evalu cost cost creat part sale figur case applic case diagram figur depict function level level system workflow actor mechan level function case extend level function case select set select polici select part batch set batch polici creat batch cost actor input actor polici case actor batch collabor final cost case set select polici case extend earliest due special cost wai part select carri maker earliest due date case refin part largest cost effect case extend cost effect part cost effect materi case extens base present context situat applic oo analysi agent base system dynam model object interact set select polici actor set select polici polici review cost actor cost polici accept polici suggest similar step occur set batch set schedul polici case similar event trace state diagram lead case deriv abstract set select polici case evalu cost deriv abstract evalu case cost actor review polici feedback abstract case select polici evalu shown figur doubl line actual case special case inherit shown doubl line arrow assign machin set schedul polici set select polici select part sheet set batch polici creat batch evalu cost determin evalu cost set select evalu abstract case inherit figur abstract case inherit examin figur actor set select polici actor perform evalu set select case evalu case collabor sequenc depict event trace selector respond back evalu result lead activ evalu selector perform messag evalu evalu evalu request addit suggest altern reject accept altern selector respond satisfi evalu recommend reject agent agent orient system case studi consist agent autom reason collabor agent set polici formul set schedul cost agent polici determin cost evalu agent correspond cost replac actor behavior case produc control output select agent belief goal plan intent set select polici materi earliest due date largest part cost effect special order earliest due date part earliest due date cost effect materi cost effect part earliest due date special order materi cost effect earliest due date largest part earliest due date part cost effect materi cost effect part figur select agent plan agent goal plan belief select agent discuss remaind section illustr goal select agent set select agent metalevel knowledg repres strateg goal agent plan level function case extens figur map directli shown figur agent plan draw achiev top goal set part select earliest due date earliest due date largest special cost effect part cost effect materi select agent work collabor cost agent plan collabor follow script coordin protocol deriv event trace script special script abstract case discuss conflict selector singl function agent evalu applic oo analysi agent base system extens special coordin approach evalu inform make make posit make neg evalu reject neg evalu evalu make ad fourth possibl start evalu fail start evalu fail reject fail success figur evalu script figur evalu script reject accept state diagram coordin protocol script evalu agent shown figur figur evalu request inform figur evalu accept selector critic evalu orthogon addit made state diagram script map directli role evalu event trace script selector agent state activ messag event sequenc coordin protocol abstract behavior evalu special behavior cost select agent cost evalu cost effect plan invoc condit involv cooper enact intend base strateg invoc context condit context invoc condit deriv case extens condit extens condit probe event trace origin base case case reach check extens condit true case extens descript sequenc diagram select part sheet case select actor form select context set select polici case extens extens return base case complet sequenc diagram case extens set select polici probe mark entranc exit locat case special order cost effect cost effect emploi special protocol figur context condit met probe strateg knowledg emploi determin extens agent effector inform retain agent belief obtain coexist object sensor goal subgoal brought belief modif coexist object case studi object part materi coexist object passiv object belief agent part materi coexist object concern select agent sensor monitor object agent effector impact instanc reset newli defin prioriti part materi constrain object case address object depend relat batch depend part constrain object base knowledg select agent reject costli batch costli place part batch back part list materi back inventori action carri effector constraint satisfi constraint relax negoti agent protocol consid addit case analysi summari futur work paper step methodolog agent base system methodolog base object orient case approach object orient softwar engin agent applic oo analysi agent base system belief sensor effector deal object exist environ agent collabor script methodolog analysi design collabor base case case abstract agent orient system case studi develop dmar implement util design pattern briefli outlin section companion paper acknowledg project partli fund cooper research centr intellig system cooper research centr intellig manufactur system technolog australian govern cooper research centr program refer languag describ coordin intern confer agent pp definit architectur comput vol pp methodolog model function structur comput vol pp dmar plan languag refer australian artifici intellig institut experi integr concurr engin ieee singl function agent investig ai engin design special issu conflict manag practic approach design build intellig softwar intern confer practic applic intellig agent multiag kqml darpa knowledg share initi extern interfac work base system factori read morgan kaufmann tutori intern confer practic applic intellig agent agent design element reusabl objectori procedur reason sri tr principl design ontolog knowledg technic report ksl knowledg system stanford schedul resourc alloc applic coat british intern confer practic applic intellig agent agent agent stream logic proc intern confer agent pp orient softwar case driven addison case construct orient base work technolog system ed john wilei intellig agent busi intern confer practic applic intellig agent agent ch methodolog develop agent base system ifip sig work confer model methodolog multiag system architectur base object orient design submit intern confer multiag applic oo analysi agent base system pattern develop multiag submit australian workshop distribut artifici pacif rim confer artifici conflict resolut cooper design ieee transact vol decemb process methodolog agent tutori intern confer direct distribut artifici intellig ifip sig work confer model methodolog describ multiag coordin protocol submit tool artifici intellig agent system manufactur intellig vol pp object behavior pattern concurr pattern program reduc work inform comm vol tutori intern confer practic applic intellig agent agent intellig agent framework ieee tran vol agent speed network intern confer practic applic intellig agent agent van dyke ai manufactur issu european workshop model autonom agent agent world intern confer agent
ML/1334 6 fuzzi rule induct algorithm alex freita av de pr brazil pr brazil abstract paper fuzzi beam search rule induct algorithm classif task fuzzi logic fuzzi set flexibl approach cope express discov rule intuit linguist term numer valu rule condit algorithm evalu public domain data set introduct paper address classif task task goal discov relationship goal set predict attribut system discov relationship discov relationship predict exampl numer rule induct algorithm classif task vast major work framework classic logic paper fuzzi rule induct algorithm classif task motiv work twofold fuzzi logic flexibl method cope uncertainti fuzzi rule natur express rule involv continu attribut rule induct algorithm implicitli perform kind discret cope continu attribut framework classic logic rule induct algorithm discov rule condit obviou disadvantag cope borderlin ag fuzzi rule condit young fuzzi attribut describ person year concept natur user principl rule induct method fuzzi tree algorithm past paper underli data mine algorithm variant rule induct algorithm motiv choic tree algorithm perform kind search explor altern make sensit problem local maxima beam search algorithm advantag sensit explor altern beam width paper work fuzzi beam rule induct algorithm beam rule induct basic idea beam rule induct algorithm figur algorithm receiv argument maximum depth search beam width number rule tree path explor algorithm paramet small integ number figur denot denot predict jk denot predict ijk denot rule creat ad condit jk rule start rule iter add condit time current special rule condit ad rule form belong domain attribut oper case continu attribut simplic fuzzi version iter algorithm add condit rule long attribut occur evalu rule rule proce search process repeat rule rule previou iter maximum depth reach note algorithm expand tree search root node rule path root current leaf node correspond current depth path correspond number condit rule paramet effect specifi maximum number condit rule comput qualiti rule variant confid factor measur denot rule conjunct rule consequ valu predict goal cf measur simpli denot cardin set cf ratio number exampl satisfi condit rule predict rule consequ number exampl satisfi condit rule borrow idea variant measur defin motiv subtract numer favor discoveri gener avoid overfit rule data rule rule cf rule overfit rule accur unseen data correct achiev realist cf measur rule fig overview beam rule induct algorithm note algorithm figur search condit add rule form rule consequ part rule predict goal attribut choic class predict rule made wai approach algorithm automat class form rule pick class major exampl satisfi rule belong approach run algorithm time run algorithm search rule predict class assum run algorithm discov rule predict class satisfi discov rule assign assign class opt approach work algorithm search rule predict minor class class smaller rel frequenc data major class default class chosen approach reason simplic discoveri rule predict minor class advantag rule tend interest user rule predict major class rule predict rare tend interest rule predict patient reason rule tend interest difficult discov comparison major class depth ruleset singl rule repeat rule ruleset attribut rule special ad condit jk call rule ijk comput measur ijk end end ruleset rule current depth depth rule creat iter rule previou beam rule induct algorithm section describ algorithm previou section continu attribut data mine set fuzzi linguist term essenti label fuzzi fuzzi membership specifi attribut origin belong attribut linguist term regard kind attribut linguist term flexibl valu attribut flexibl linguist term fuzzi set continu attribut trapezoid membership function kind function lead data model closer realiti note continu categor addit continu comput measur case correspond formula defin previou section attempt defin fuzzi version term train satisfi rule comput fuzzi satisfi condit convent definit fuzzi minimum oper rule condit young salari low sex ag salari attribut sex categor attribut train satisfi condit young condit low condit male case satisfi rule note femal satisfi rule involv categor attribut satisfi theoret disadvantag train exampl satisfi rule small summat small membership undermin reliabl cf measur avoid summat satisfi rule includ exampl membership greater equal predefin threshold train exampl oper base techniqu fuzzi arithmet fuzzi exampl class predict satisfi rule analog comput summat consid exampl satisfi rule greater equal membership threshold comput result fuzzi rule induct algorithm evalu public domain data data set experi pima indian diabet continu attribut exampl data set boston data continu attribut binari attribut remov data set continu attribut algorithm data set exampl goal attribut data set home origin continu adapt data set classif goal attribut class data set divid procedur perform data correspond run algorithm time partit test set remain partit train set experi maximum depth tree search set beam width set continu attribut linguist repres trapezoid membership function except attribut rad tax data linguist valu result experi report tabl cell tabl refer averag result run algorithm crossvalid procedur row baselin accuraci data rel frequenc major class basic requir predict accuraci classifi greater baselin trivial achiev accuraci predict major class row predict accuraci achiev fuzzi algorithm comput ratio number correctli classifi test exampl total number test exampl note data set algorithm achiev accuraci rate significantli baselin accuraci note accuraci rate account classif correct kind rule discov rule classifi analyz detail qualiti discov measur separ accuraci rate discov rule accuraci rate rule recal discov rule predict minor appli test satisfi discov simpli predict major class recal consid satisfi discov rule rule belong membership function describ linguist term alpha explain section row tabl accuraci rate discov comput ratio number exampl correctli classifi discov rule number exampl satisfi discov rule discov rule predict irrelev rule classifi fourth row accuraci rate comput ratio number exampl correctli classifi rule number exampl classifi rule number exampl satisfi discov data set default rule predict accuraci significantli discov rule difficulti predict minor class data set comput accuraci minor find valu diabet data point discov rule consid respect predict accuraci diabet data tabl comput result diabet data set data set baselin accuraci accuraci accuraci discov rule accuraci default rule issu consid discov rule subject common literatur evalu term syntact simplic discov rule smaller number rule smaller number condit discov rule set definit rule discov algorithm definit algorithm suitabl choic paramet algorithm discov small set number beam width algorithm discov short number condit discov rule maximum depth search tree linguist term fuzzi algorithm consid form improv rule comparison numer argu introduct high accuraci necessarili impli classic hospit easili mine rule sex rule highli accur state obviou algorithm discov rule predict minor argu section tend interest rule user detail analysi discov rule scope paper literatur method evalu discov rule trivial adapt method context fuzzi rule fuzzi version beam rule induct algorithm evalu algorithm data set result respect predict data respect discov intuit improv linguist term fuzzi rule comput result report paper algorithm appli data set futur research includ extens evalu algorithm data set disadvantag fuzzi approach requir preprocess phase fuzzi membership continu attribut solv problem approach specif user expert mean requir valuabl human fuzzi cluster algorithm membership function futur fuzzi fuzzi valu fuzzi membership function algorithm requir underli fuzzi avoid preprocess phase refer fuzzi fuzzi applic world scientif fuzzi rule optim handwritten numer recognit ieee tran fuzzi feb continu algorithm fuzzi entropi measur proc ieee int conf fuzzi san diego object measur rule principl data mine knowledg discoveri european lectur note artifici intellig rule measur system journal construct assess classif rule john wilei son uci repositori machin learn dept inform comput scienc data search nugget parallel um fayyad al advanc knowledg discoveri data mine aaai press introduct fuzzi set analysi design mit gener product rule tree proc int joint conf ai uci repositori machin learn univ dept inform comput scienc discoveri except rule base intens implic principl data mine knowledg discoveri european lectur note artif intellig artifici intellig ed
Agents/1335 1 plan fusion algorithm system de bo han delft technolog faculti inform technolog system po box aj netherland abstract introduc algorithm cooper plan system algorithm enabl agent combin plan order joint pro ts comput resourc skill framework develop repres plan activ agent time constraint present ecient algorithm fuse plan group agent joint pro ts improv framework algorithm illustr simpli ed freight transport domain introduct attent topic cooper cooper plan multiag system start point research problem observ exist class problem solv singl agent requir agent work interact coordin plan share resourc observ mention reason equal reason cooper agent solv problem prefer cooper coordin resourc activ agent save cost cooper plan problem multiag system divid task alloc agent perform part plan order reach set pro task distribut order maxim joint pro particip agent support research program seamless multimod mobil support research program freight transport autom multimod program carri trail research school infrastructur logist problem solv independ addit sourc diculti requir due solut problem low complex gener case aspect cooper plan care task alloc pro maxim problem dealt speci algorithm joint plan discuss coalit agent saddl dicult problem construct joint plan perform complex task scratch solv problem assum interact plan part neglect concentr ecient approxim optim task alloc method mean resourc distribut team agent alloc addit dicult plan problem approach cooper plan problem unlik account plan unlik agent face dicult problem construct joint plan scratch situat agent group agent plan perform part task plan includ resourc goal plan perform oper pro ts expect goal obtain agent social joint total pro fuse separ plan fusion process avoid deal explicit approach cooper plan approach discuss cooper bdi base agent negoti pass argument explicit plan detail algorithm cooper obtain ecient enabl agent ful ll intent exchang resourc problem build joint plan scratch ecient appli local adapt individu care ecient cooper process combin plan approach special properti encount approach mention requir complet replan activ agent prepar cooper cooper format process structur agent involv perform small plan optim step local adapt origin plan result plan result polynomi number step cooper algorithm partial optim origin destroi step perform give intuit idea approach cooper process rst present eld freight transport transport agent live assum agent independ plan activ agent bring load time load time agent bring load time bring truck favor transport compani truck start time load truck york time figur show upper level goal lower level goal assum travel neighbor citi figur cost time unit cooper agent lead dramat cost goal agent bring load baltimor truck agent washington side baltimor assum agent bs truck room time constraint bring load baltimor realiz agent incur extra cost agent bs goal bring truck agent bring load boston side agent truck boston agent decid cooper agent satisfi agent bs origin simpl notion time integ time unit bal bo figur goal cooper bo bal figur goal cooper goal figur depict nal arrang goal satisfact agent agent show cooper agent realiz initi goal product cost reduct realiz exchang goal exchang resourc analyz agent plan determin resourc side product notion plai central role elementari product framework call skill constitut build block product resourc goal time properti constraint goal skill de ne product time resourc introduct rst step deal kind constraint paper start introduc formal framework plan skill goal distinguish assum agent assign distinct set set skill agent individu construct select plan plan account activ agent cooper agent investig mutual approach lead cost ectiv plan advantag side product agent activ call fusion plan pro ts agent determin cost cost resourc execut plan time goal produc plan cooper analyz term realloc resourc skill plan agent order pro model cooper section describ framework model plan ti agent plan analyz term set resourc goal section introduc time constraint method deal time constraint framework discuss section present analyz polynomi algorithm process previou variant abil constraint remark framework share similar attribut grammar system speci ed knuth super cial correspond product rule ag set symbol attribut resourc time label constraint logic program close relat formal paper formal di erent formal languag gener comput clp manipul express order improv joint plan cost function skill formal section framework describ plan oper plan start give build goal skill combin resourc obtain goal describ plan realiz goal basic de ne agent context skill central discuss concept produc set product set resourc product resourc product call resourc resourc result resourc refer object real world di erent set resourc denot function resourc type resourc resourc belong resourc truck capac agent resourc realiz product label resourc type function type set resourc type domain function type extend set resourc imag set resourc resourc type resourc origin set resourc uniqu time interv valu set time point equal niti denot earliest time latest time assum time point resourc constraint time interv depend time interv di erent resourc resourc introduc time variabl refer earliest time point refer latest time time variabl construct time express time express form arithmet express time variabl time interv time variabl easili lift set denot set ft time variabl denot set time interv de nition skill scheme rule transform input resourc type output resourc condit time interv input resourc type constrain time interv output resourc type function time interv input resourc type skill scheme ss rule form ym xn tn ym xn denot arbitrari resourc type tn result set time output resourc time express speci arithmet express time variabl belong input resourc condit set time express time variabl input resourc give concret skill scheme bal bal gener set larger equal paper restrict version time interv notat sucient applic domain repres drive truck york truck york room load york baltimor bal truck baltimor time unit york baltimor neighbor notat time interv resourc denot set ft condit set denot set condit interv resourc skill instanc skill scheme ss ss skill scheme ym xn tn skill fr fr instanc exist substitut fx xn time interv input resourc sati es condit mention condit sati occurr replac time interv output resourc time express occur eval function evalu argument express denot set output resourc denot input resourc denot condit input denot result output resourc set skill denot initi set resourc transform set resourc describ product relat closur de nition set set resourc immedi produc abbrevi skill instanc resourc set produc denot transit closur set resourc set skill realiz set goal set goal mention type resourc obtain goal tupl cg vg set resourc variabl type cg set time variabl vg easi express agent resourc skill produc goal de nition set goal cg realiz set resourc time interv set skill exist set resourc substitut vg resourc requir vg sati es constraint cg cg set constraint obtain substitut occurr cg cg sati sequenc skill realiz problem set set skill goal fgg realiz deal feasibl cooper plan result import cation order deal plan resourc plan realiz goal nding plan nding plan hard focu local improv enabl develop algorithm cooper global cooper plan paper assum player plan plan comput gener plan system blackbox agent plan plan librari repres plan direct acycl graph ns nr denot set resourc ns set skill node set arc notat mean skill node denot applic skill node nr ns mean resourc skill mean resourc produc notat convent subset node dag ns set input resourc denot fr nr fr nr refer set nal product de nition set cg goal set plan dag ns nr repres nr ns fs ns goal realiz plan violat exist substitut vg type occur vg cg ns fr fr valid skill applic nr produc skill plan found figur explan term gure found section agent paper interest cooper number player produc product servic model kind player produc consist set skill cost function resourc skill de nition produc agent tupl sa set skill cost function agent function map skill sa natur number repres cost produc express short denot cost storag denot node denot resourc note includ cost alloc cost incorpor skill cost state agent captur resourc skill produc set goal de nition state agent tupl st ga pa plan goal ga set state denot st state st cga set ga repres set resourc alloc agent product goal order denot global function ident agent number repres resourc type pro ts agent state st cga de ned pro propag time constraint plan speci es set goal sati start set initi resourc replac resourc resourc section resourc satisfi time constraint describ time constraint deriv constraint goal distinguish simpl time express constraint propag method exist deriv time constraint input resourc goal constraint addit simpl time express plan repres skill complex propag input resourc resourc xed simpl time constraint section describ goal constraint propag input resourc de ne time express show constraint propag nalli show time constraint propag goal condit plan input resourc de nition time skill scheme ss de ned de nition input resourc variabl output resourc variabl time express ss simpl arithmet express result conform bnf te te time condit condit form skill scheme sati es skill scheme ss simpl time condit goal simpl form condit skill scheme plan simpl skill plan skill scheme simpl dicult simpl time due restrict rewritten canon te skill input resourc output resourc time interv output variabl de ned produc time step receiv time step produc time step assum goal state natur number easi time express simpl deriv time constraint input make de nition constraint analog de nition constraint greater equal respect rst valu time note deriv constraint input variabl simpl process call local constraint propag de ned de nition constraint skill scheme ss output resourc variabl input resourc variabl set canon time de nition output resourc nj depend type time de nition set time condit output time constraint oper deriv time condit input variabl call local constraint deriv ij ij de ned occur ij ij de ned ij ij de ned inequ combin deriv inequ input resourc min ij end valu time interv equal rst valu time equal depend type resourc proposit simpl plan time condit initi resourc deriv goal condit repeatedli appli local constraint propag constraint propag implement plan set rst deriv constraint input resourc skill produc goal local constraint propag skill scheme skill remov plan input resourc de ned set goal deriv constraint process repeat plan empti complex constraint applic domain unabl model constraint simpl time de ne time constraint involv packag transport resourc method previou section deriv time constraint resourc plan improv algorithm inform resourc constraint propag complex constraint replac time variabl resourc constraint transform condit latest time earliest time latest prod time figur remov simpl time method previou section plan optim fusion paid attent individu plan show plan repres time constraint propag import advantag formal describ cooper agent special form cooper agent share resourc call fusion present polynomi algorithm optim singl agent plan fusion multi agent plan section rst explain improv algorithm work discuss diculti introduc time constraint part show plan improv algorithm fusion process plan improv agent cooper fusion common pro ts de nition pro ts section pro ts remov skill agent exploit resourc produc origin assign agent ineci joint plan remov local improv involv skill remov improv necessarili lead global optim procedur local optim start describ plan improv algorithm algorithm algorithm optim plan agent remov skill algorithm skill note paper concentr restrict version time section algorithm improv algorithm find resourc latest latest prod earliest return true return found skill found found true found found find found remov skill remov output resourc denot substitut found function find replac resourc check resourc suitabl check time constraint involv assum time express resourc plan mean slack remov product produc time distinguish sort resourc half open interv close interv transport context typic resourc point time transport resourc speci time truck leav xed skill produc transport resourc remov skill produc resourc shown figur replac approach analogu present detail invari algorithm bal bo bal bo bal bo bal bo figur state agent begin pa resourc type half open time interv replac earliest time latest time time condit goal latest time calcul function latest time earliest time smallest time interv algorithm fusion algorithm plan resourc close time check dicult produc latest time execut skill interv check calcul earliest time replac call earliest time earli packag transport calcul slack product call latest prod latest time produc skill goal depend match condit function time function summar shown figur latest return latest time resourc current goal depend meet deadlin time calcul constraint propag procedur section propag deadlin goal initi resourc plan latest prod return side latest time interv resourc produc skill goal depend meet deadlin time calcul nding latest time output resourc return minimum latest prod time input resourc side time interv earliest return earliest time replac skill time deriv maximum rst time input resourc skill earliest max rest function improv algorithm condit statement find determin altern resourc accept substitut procedur resourc perform remov substitut output resourc found replac shift execut time skill fusion show make fusion algorithm plan nite set agent fuse plan pa individu plan goal agent realiz fusion result combin individu plan optim collect plan forest individu proposit easili veri proposit nite set agent agent goal ga plan pa fusion algorithm plan pa realiz respect jjp jj denot sum size plan agent function latest latest prod time earliest time plan time complex time complex find function call time skill remov skill check total skill remov proof easi tediou due lack omit size jjp jj plan equal size dag repres number vertic number arc plan bal bo bo bal bal bal bo figur state agent begin pb proposit fusion agent total plan size perform fusion algorithm implement set skill translat process blackbox produc plan agent plan fuse algorithm evalu compar process blackbox solv problem global preliminari test show solv problem agent fusion process faster instanc solv problem return solut term number skill run time blackbox exponenti time algorithm polynomi section appli fusion algorithm introduct paper save space resourc load truck locat xxx time interv notat xxx xxx symbol bal repres transport resourc load york baltimor time interv notat time constant denot type resourc initi resourc agent ra fl rb fl skill scheme figur skill truck york load space york baltimor bal load space baltimor washington bal skill load washington load york room load drive york baltimor bal room load drive baltimor washington bal figur show plan pa pb agent begin situat skill repres box resourc repres circl black color circl repres grei color circl repres side product valuabl agent ga fl bal bo gb fl bo join plan achiev run fusion algorithm shown figur futur work uniqu featur system individu agent cooper order achiev goal reason cooper agent realiz goal individu reason cooper lead ecient mean realiz goal concentr comput consist resourc model cooper process di erent agent central framework model side product agent exploit resourc time properti resourc skill time deadlin goal model durat skill result paper algorithm polynomi time fuse individu plan set joint pro agent current framework su er restrict time natur applic annoi domain dont abil addit properti relat resourc truck speed inabl handl con ict goal imposs achiev current framework express fact state type product present time experi possibl repres base improv plan cost properti resourc skill sa bal bal bal bo bo bo sb bo bo bal bal bal bal bal bal load truck transport resourc figur skill agent bal bo bal bal bal bo bo bal bo figur join plan pa shortcom dealt futur version framework pursu research deal plan creat robust plan plan altern built leav detail lled form replan refer wooldridg cooper structur fifteenth intern joint confer arti cial page fike nilsson approach applic theorem prove problem solv arti cial kautz selman approach applic theorem prove problem solv work note workshop plan combinatori held conjunct donald knuth semant languag mathemat system june cooper iter plan icma jp design intellig layer approach simon parson jr jen negoti argument preliminari report intern confer multiag sandholm lesser coalit bound agent arti cial shehori krau method task alloc agent coalit format arti cial emerg cooper system arti cial replan collect agent base system technic report faculti inform technolog delft van hentenryck constraint logic program knowledg engin werner distribut cooper algorithm demazeau decentr page elsevi scienc publish wooldridg nr jen cooper problem solv process journal logic
AI/1336 2 ieee workshop inform assur secur unit state militari west methodolog intellig agent provid autom curti john md john udo senior ieee paper methodolog autom softwar agent major system react attack gener report alarm introduc window vulner detect action defend attack research cohen success attack depend time gap detect skill attack ten hour detect success time thirti attack fail methodolog address window vulner provid autom incid heterogen collect softwar agent agent collabor protect comput system attack adapt tactic system administr activ role system index comput intellig agent introduct number inform warfar attack increasingli sophist annual report comput emerg team number comput secur incid year figur depict rise comput secur incid incid report attack sophist cert annual report report grow attack script tool control collect exploit cert distribut denial servic workshop report grow autom script launch control ten thousand attack target attack comput limit inform initi attack threat sophist comput attack grow author depart comput texa colleg texa detect system threat current detect system limit mechan inadequ current threat id research techniqu remain princip manual process id notifi system administr occur occur system administr respond notif mechan delai detect delai notif rang minut window opportun attack exploit cohen explor effect reaction time success rate attack simul result skill attack ten hour detect success time twenti succe time thirti attack fail simul result correl skill defend system administr result skill attack thirti skill system administr irrelev attack succe probabl success attack skill system administr fundament factor attack success success skill system adapt tactic system respond static attack simpli adapt approach mediat autom system shorten close window opportun system administr activ role defend ieee attack system exist ii previou work year past number detect tool develop tabl system categor notif manual automat system major detect system notif system system gener report alarm system provid addit capabl system administr initi manual limit preprogram set capabl notif time gap detect initi automat system immedi respond preprogram classif system notif manual automat total tabl classif system figur cert report incid year automat system simpl tabl attack attack preprogram execut preprogram predominantli execut singl command action invoc seri action limit effect attack except cooper secur manag event monitor enabl live disturb cooper secur manag distribut detect system proactiv detect central director command damag control processor damag assess processor command examin user command stream automat discard command identifi attack reactiv respond behavior taxonomi classifi attack suspicion level assign user detect system suspicion level emploi consist fourteen action continu respond intrud action intrud leav system suspicion level reset intrud attempt restor system state maintain state inform ongo attack suspicion level lack state inform limit effect system reset suspicion level ieee incid tactic toolkit detect system interfac master analysi analysi intrud leav attack opportun begin attack anew adapt base success previou accuraci detect system mechan gener action preprogram action suspicion level research address open research issu event monitor enabl live disturb distribut anomali detect system intend heterogen comput environ emerald architectur consist hierarch collect monitor princip compon profil signatur resourc resolv profil engin statist anomali detect compon system signatur engin infer compon resourc object pluggabl configur librari data compon resolv coordin analysi polici enforc monitor capabl resolv expert system receiv report analysi compon invok handler defin resourc object metric delimit threshold metric sever metric threshold metric defin evid sever metric defin harsh monitor system system admin tool polici specif figur methodolog taxonomi emerald mechan limit metric determin research extend emerald approach provid formal robust methodolog incorpor complet taxonomi adapt mechan util number addit criteria formul overview logger iii discuss methodolog summar figur multipl monitor comput system gener alarm interfac agent maintain model id base number gener model gener attack confid metric pass metric report master analysi agent master analysi agent classifi incid continu exist incid attack master analysi agent creat analysi agent develop plan attack incid continu exist master analysi agent pass attack confid metric report exist analysi agent hand attack analysi agent analyz incid resolv gener abstract action resolv incid gener analysi agent invok taxonomi agent ieee classifi attack polici specif agent determin goal limit base resourc constraint analysi agent pass select action tactic agent tactic agent abstract action specif action invok compon toolkit analysi tactic agent emploi adapt decisionmak base success previou logger record analysi tactic agent system administr review system compon discuss greater detail interfac agent interfac agent perform translat id specif messag gener messag format maintain confid metric report id techniqu messag gener commun languag knowledg queri manipul languag common detect format special languag architectur interact varieti assumpt common commun languag interfac agent translat servic messag intern system common format due requir rapid special languag intern system gener languag effici speed special languag import flexibl gener languag interfac agent maintain confid metric report id perfect gener posit neg alarm tailor system believ report incid real attack alarm confid metric ratio posit report actual report number posit gener feedback loop interfac agent system admin tool system administr incid real attack alarm result updat confid metric report id adapt incid gener high number posit sever report seldom gener alarm master analysi agent master analysi agent examin incid report gener interfac compon determin incid attack continu exist attack incid master analysi agent creat analysi compon pass incid report confid metric incid continu detect master analysi agent simpli forward incid report confid metric analysi compon classif incid exist requir reason uncertainti attack varieti techniqu hide ident techniqu equal effect confound incid classif incid multipl attack internet protocol address short interv time exact program provid clear indic continu exist attack attack distribut port scan multipl ip address dai week difficult detect determin attack continu attack master analysi agent fuzzi rule set consid time incid ip user program determin incid continu exist attack attack fuzzi rule base advantag easi captur knowledg domain expert verifi master analysi agent reach classif intent research infer mechan master analysi agent advoc classif incid repeat attack attack requir attack attack system adapt tactic util thwart attack classif adapt limit analysi agent analysi agent analysi incid determin abstract respond plan consist plan tactic accomplish plan step goal system administr gener approach exampl goal catch analyz mask attack sustain maxim data maxim data ieee minim cost plan step techniqu accomplish goal exampl plan set gather preserv commun slow identifi notifi system attack system tactic method carri plan step plan step gather varieti tactic accomplish plan step enabl addit enabl remot enabl log unchang enabl process trace commun enabl addit tactic number implement environ depend subnet consist machin saint saint peter tactic remot log implement log comput system analysi agent determin plan step tactic tactic agent determin suitabl implement analysi agent develop plan analysi agent receiv goal polici specif agent system administr goal influenc select plan set tactic provid rank support plan step tactic goal confid analysi agent receiv confid metric master analysi agent metric sever tactic emploi temper belief occur incid analysi agent receiv incid report master analysi agent forward taxonomi agent taxonomi agent inform classifi type attack type attack incid analysi agent maintain histori incid forward histori taxonomi agent proper classif type attack depend histori attack attribut attack analysi agent maintain inform taxonomi agent success analysi agent maintain success metric plan step tactic success metric ratio success total number plan step tactic metric updat attack system administr system dynam adjust plan step tactic select respond plan success weight plan system administr determin success tactic analysi agent coordin tactic agent determin tactic agent implement tactic implement implement polici analysi agent coordin polici specif agent ensur plan step tactic pursu complianc polici restrict comput environ restrict includ constraint analysi agent determin plan requir exist plan plan analysi agent invok taxonomi agent gener plan list viabl plan step tactic base taxonomi agent classif attack analysi agent invok polici specif agent filter plan shell elimin plan step tactic due resourc constraint confid metric filter plan step tactic sever system confid report detect system plan step tactic remain viabl filter process form plan set plan built select tactic viabl plan step goal weight tactic tactic success metric result tactic form plan pass tactic agent implement exist analysi agent reevalu plan determin success agent continu execut plan analysi agent determin plan adapt chang plan step chang request tactic agent chang implement tactic plan implement exhaust indic system analysi agent shut host system administr activ role system ieee taxonomi agent taxonomi agent receiv input analysi agent determin subset plan step tactic respond plan make taxonomi agent consid number time time fundament delin formul correct dimens taxonomi time defin attack attack preemptiv occur indic attack attack begun preemptiv attempt postur potenti affect system continu provid servic user minim degrad perform damag control occur attack detect ongo attempt limit effect attack continu provid servic legitim user damag assess occur attack detect attack left system attempt document repair damag attack system type type attack import determin denial servic attack race condit attack involv system util attack taxonomi complet correct type attack result taxonomi cia model theoret basi determin type attack suffici differenti type attack attack determin dimens taxonomi type type attack princip concern determin respond autom attack program compar respond human attack respond novic effect respond expert attack taxonomi agent classifi attack autom human novic expert attack strength suspicion import determin detect exact scienc detect system gener posit neg result temper strength suspicion actual occur suspicion limit account possibl detect suspicion broader rang attack dimens taxonomi implic attack system differ import organ differ critic lead target denial servic attack singl workstat compar attack institut domain server polici specif agent polici specif modul perform maintain limit plan step maintain system goal environ polici specif agent mechan restrict implement environ limit includ resourc constraint system administr system administr interfac enter goal limit checklist tactic agent tactic agent receiv abstract plan analysi determin implement abstract plan map specif set invok compon toolkit tactic agent maintain associ set implement accomplish tactic implement system depend tactic agent select implement execut tactic plan invok compon toolkit determin implement select tactic agent maintain success metric implement success metric ratio success total ieee number implement metric updat attack system administr system dynam adjust techniqu select respond action success weight action success tactic agent chang implement indic select implement work indic princip toolkit monitor implement execut successfulli toolkit toolkit modul collect execut system script implement program system depend invok tactic compon separ tactic toolkit compon methodolog support multipl system architectur provid separ logic implement plan user interfac system administr interfac modul interfac system administr monitor review incid suspend oper system assum activ role provid feedback system set system add detect system interfac compon system administr interfac receiv report interfac logger compon incid event correl displai attack system administr stop system activ defend system secur incid system administr real attack posit report system success interfac compon report id updat confid metric id analysi tactic compon updat success metric plan techniqu system administr set system polici interfac polici specif record polici specif compon limit system implement system administr add id interfac compon system administr interfac compon iv paper methodolog adapt intellig agent number complex comput attack robust system research significantli extend previou work framework build effect system refer cyber statist januari coordin center januari intrud tool softwar engin carnegi mellon decemb damag control taxonomi implement autom phd texa colleg secur detect ieee vol pp porra event monitor enabl live proc nation inform system secur octob pp neumann emerald usenix workshop detect network santa april pp softwar menlo aaai yen fuzzi control prentic systemat classifi comput secur proc ieee symp secur pp ieee
HCI/1337 4 bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp intuit design tool base direct object manipul morten martin bichsel matthia rauterberg institut appli physiolog institut construct design method swiss feder institut technolog switzerland natur context mean human action world tangibl object live subject introduc concept action regul relat observ human behaviour tool bring motor cognit action assur complet task regul aim set guidelin gener user natur user interfac present instanti call featur interact task specif context interact tool render virtual object tangibl multipl user simultan interact common space user experi briefli augment natur natur user graspabl comput mediat design virtual augment realiti introduct comput work place tremend impact task solv method base graphic displai desktop workstat defin frontier digit analogu world time energi spent transfer inform world effort reduc integr virtual comput world real user world vice versa dialogu techniqu develop dialogu techniqu object command function menu icon window essenti term bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp cast interact command menu select direct manipul common user combin real world virtual object interfac space adequ incorpor human hand enorm potenti interact real virtual object drawback gave reason develop data glove data suit user equip artefact easili interact virtual realiti system reason vr system emerg head mount displai output capabl vr system subject inher limit lack tactil touch give mismatch propriocept feedback special techniqu overcom problem delai control yield sever problem refer perceptu stabil ear apparatu electron commun social interact share sound space share social world bring remedi stimul human mutual interact time vr necess put user fulli intang world user part world interact materi object live human real world interact model mix tangibl virtual object overcom drawback concept augment realiti introduc approach incorpor fundament human interact real world subject object ar design strategi enabl human behav natur call behaviour natur action elabor concept natur interact base concept deriv design guidelin gener user natur user interfac base guidelin exist ar section suggest gener framework section describ task specif instanti call tool featur support construct plant design section offer refer user experi natur interact observ action interact machin part everydai life winograd flore abstract basi everydai interest dialogu commun effect physic behaviour bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp focu articl activ base observ task solv behaviour support offer campbel found learn process includ task relat greater retent greater transfer situat experi ti action order earli stage learn ahead observ behaviour describ bodi action gener undertaken sander class motor sequenti continu movement static posit hand interest work offer mackenzi outlin behaviour applic function effect forc hand object numer doubl hold hand mental dualiti make reflect part discuss motor cognit action show relat reflect bodi close cognit process render visibl languag hand mental activ strong relat manual activ vice versa describ regul human activ cycl comparison lead action claim regul human activ reduc ration activ manual part cycl lost import lack human problem solv due sharp mental manual work cognit process exclud observ action vice versa unifi concept human comput interact bring action reflect action regul theori action regul theori found answer base task tradit unifi action reflect great import attach concept complet task complet activ cycl start goal set part characterist complet task distinct step bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp task descript control feedback goal set action plan fig complet activ cycl context action regul theori independ set task goal independ action prepar plan select tool includ action goal attain physic event perform function feedback perform pertain correct action control feedback result possibl check result action set base action regul set enlarg view goal motor activ epistem pragmat action motor activ classifi kirsh maglio epistem pragmat pragmat action primari function bring user physic closer goal epistem action chosen hidden inform gain insight requir mental comput physic action facilit mental make faster reliabl cognit complex reduc epistem action memori involv mental comput reduc number step requir made fewer probabl error due mental slip reduc distinct epistem pragmat action mention gibson suggest hand movement classifi exploratori similar distinct made consid human activ plai labour design guidelin point led epistem action consid task relat answer question depend level bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp abstract epistem action goal orient aim learn tool process initi perform tool tool master provid intermedi aid perform superior final perform tool activ extern tool checklist complex longer step process class epistem time constitut task activ epistem action consid task orient find formul point design epistem pragmat action comparison correct wai find focu refer work educ show learn intim relat make mistak idea mistak student higher regul human activ student good goal action feedback higher grade idea point user behav exploratori make mistak behaviour impli low risk give construct feedback reach complet task solv comput mediat activ user behav natur emploi everydai motor faculti bring action bodi part face voic requir constitut point design guidelin interpret rang human express power intellig pattern recognit method sum set guidelin epistem pragmat action assur mistak impli low risk exploratori behaviour stimul user emploi everydai gestur motor pattern bodi part face voic gener framework section make elabor guidelin design extend concept augment realiti ar peopl real authent reproduc comput ar base real augment comput characterist gener design strategi bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp support fusion real virtual object understand acoust human wai express physic object human action speech hand write natur output base techniqu speech spatial sound necessarili impli mean modal input output project item refer directli user part express fig show architectur instanti electron document commun work area work area distribut user commun paper document fig architectur natur user interfac spatial posit user monitor camera creat stereoscop pictur potenti video confer partner speech sound record enabl system maintain spatial user model camera perman record state user activ place horizont work area virtual physic object fulli integr parallel input channel make commun multipl view remot face imag share work object multimedia output shown fig provid vertic displai commun work project devic illumin horizont work audio system tradit devic ad requir user person interact style moment human easili manipul object real world natur desir emploi faculti interact comput user interact real virtual object liter direct manipul planar work area place real object surfac direct map user manipul object virtual object percept action space coincid power design empir valid rauterberg bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp design weak instanti weak mean distribut commun remain impli task chose plan activ plant design prototyp call applic support engin design assembl line build plant fig design room design room fig enabl group interact space virtual real world object vertic work area background side view plant horizont work area view object select manipul bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp select fix posit rotat fig basic step user manipul interact handler work principl shown fig user select object put brick object posit object rotat fix simpl brick manipul materi everydai motor pattern rotat cover activ strong connect cognit process observ behaviour system dynam support user goal action control complet regul work cycl assur cost make mistak vital oper epistem pragmat action equal support hand system support interact effect user part simultan design process set guidelin formul section met fig object menu view interact handler bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp applic design support provid assembl line plant earli design process graphic displai base class librari system read render arbitrari virtual object fig object comput aid design system virtual realiti model languag geometri aspect product data grow interact configur variant system engin send receiv numer form metadata vertic work horizont work object menu side view height view view paper paper brick method menu fig work area view featur user action select virtual object specif virtual machin store place interact handler project imag machin object menu posit machin virtual plant move interact handler prefer posit view plant layout rotat machin coupl machin brick orient fix machin manual cover surfac interact handler remov machin place interact handler specif machin view remov machin move back object menu virtual machin modif object size height oper method menu appli object view direct modif object altitud height view automat dock object predefin contact line view scroll height view menu modif perspect height side view camera manipul view numer repres distinct bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp exist time select determin current perspect save work area content method menu icon print offer method menu icon interact previou action simultan execut brick tabl simul support simul softwar show manufactur steel sheet pass laser chemic bath drill user experi system carri talk tabl user swap role design prove stimul introduc work aspect real virtual view layout mediat talk tabl talk conceiv work set system manag engin compani produc assembl line plant test show system intuit easi learn peopl assembl virtual plant half minut introduct typic user comment concept phase import plant design custom involv direct manner partner languag sit tabl interact techniqu mean complet phase gener improv interfac offer phase simultan engin interact techniqu lead reduct iter step startup concept phase plant construct futur perspect interest benefit interfac possibl combin real virtual object interact space advantag implement framework multipl interact simultan interact user group singl tabl possibl call detail research bimanu gestur interact concept system perform task observ novic user compar expert notic custom cad bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp expert part discuss manag complex object product technic descript easili requir displai short time virtual camera design plant inspect tour give valuabl input complex system imagin inform flow custom larg product conceiv planner chang detail configur present tabl exact configur cost calcul displai refer develop multimedia softwar base applic framework verlag für simul analog und ernst pp fuller massachusett campbel train design perform improv campbel campbel product san virtual technolog park palo ca draper displai manag basi commun norman draper user center system design lawrenc pp graspabl user phd observ activ touch psycholog hacker action regul theori occup psycholog review german empir research german journal psycholog pp function organ social context nardi context mit press distinguish epistem pragmat cognit mackenzi grasp hand rauterberg die phd rauterberg competit collabor share social space proc intern conf interact pp rauterberg krueger bichsel meier comput interact techniqu plan tool bichsel rauterberg intuit design tool base direct object manipul gestur sign languag comput lectur note artifici vol pp thoma peopl comput proc pp rauterberg pattern recognit kei technolog gener user interfac proc ieee intern confer man ieee catalogu pp ieee reflect action sander human factor engin design mcgraw shneiderman design user interfac read tog softwar design read watt monk remot view work view proc pp wellner mackai gold back real world commun pp whittak rethink video technolog interperson theori design implic intern journal pp winograd flore understand comput foundat design ablex publish
Agents/1338 1 intellig algorithm optim winner determin combinatori auction tuoma sandholm comput scienc carnegi mellon forb pa usa receiv march receiv form septemb abstract combinatori auction bidder bid combin tend lead effici alloc tradit auction mechan auction valuat item addit determin winner maxim revenu analyz exist approach tackl exhaust dynam restrict combin studi possibl approxim winner prove gener discuss approxim algorithm special case present search algorithm optim winner determin experi shown bid distribut introduc algorithm combinatori auction scale significantli larger number item bid prior approach optim winner determin capit fact space bid popul practic algorithm provabl suffici select gener children search secondari search fast child heurist admiss optim preprocess search space wai increment winner determin quot comput techniqu present show basic combinatori auction bidder express complementar item introduc fulli express bid call bidder express gener prefer complementar languag show languag enabl grove mechan construct combinatori auction domin strategi materi present invit talk intern confer inform comput technic report version paper circul st depart comput scienc confer version paper intern joint confer artifici intellig juli pp overview approach winner determin support system front matter elsevi scienc bv reserv sandholm artifici intellig bid extend search algorithm preprocessor handl languag arbitrari bid elsevi scienc bv reserv combinatori bid winner multiag system introduct auction distribut wai alloc item agent effici term process outcom extens human bidder varieti task resourc alloc problem internet auction server built softwar agent particip auction auction server support mobil agent seller sell item highest payment bidder acquir item lowest price auction cooper work open system consist agent auction analyz game strategi agent auction desir social effici follow auction mechan design desir social outcom follow agent act base paper auction multipl distinguish item techniqu special case item indistinguish auction complex gener case bidder prefer valuat bundl item equal sum valuat individu item bundl electr equiti bandwidth auction market truck servic pollut auction airport land slot auction servic type auction mechan subsect discuss sequenti auction mechan sequenti item auction time determin winner auction easi pick highest bidder item separ bid sequenti auction difficult bidder prefer bundl determin valuat bidder estim item receiv auction requir specul bid futur affect item receiv bid futur depend introduc comput cost wast overhead auction reason number lookahead game sandholm artifici intellig tree bid ration bid ration involv optim trade comput cost lookahead gain depend strike tradeoff lookahead uncertainti remain bid agent exact inform lead ineffici alloc bidder fail combin parallel auction mechan altern sequenti parallel auction design parallel auction item open auction bidder place bid time bid publicli observ advantag bid partial signal bidder bid end uncertainti lookahead drastic sequenti auction problem prevail sequenti albeit mitig form parallel addit difficulti bidder wait end price optim bid maxim payoff final price bidder chanc bid commenc patch activ rule bidder bid volum bid predefin time point futur reduc prespecifi manner bidder bar equilibrium bid strategi auction outcom auction unknown ration bidder method fix ineffici alloc sequenti parallel comput cost lookahead attempt fix ineffici alloc stem uncertainti discuss approach set bidder exchang item auction close approach undo lead econom effici alloc impract larg number exchang agent approach bidder retract bid combin feder commun bandwidth auction bidder retract bid case item open win price lower bidder retract bid pai differ retract payoff retract bidder risk retract time retract end cost sandholm artifici intellig risk mitig level commit mechan decommit penalti set possibl item basi mechan bidder decommit auction decommit bidder combin subset auction believ higher price item level commit mechan interest strateg agent decommit chanc agent case agent freed contract pai decommit collect penalti agent show strateg nash mechan expect payoff parti enabl contract individu ration parti full commit contract develop algorithm comput nash equilibrium decommit strategi algorithm optim contract paramet studi sequenc level commit contract cascad effect approach sell option price option paid front option method implement bid retract win bid determin method fix ineffici desir effici alloc auction fix combinatori auction hold goal combinatori auction mechan combinatori auction overcom lookahead ineffici stem relat uncertainti combinatori seller seller act multipl bidder bidder place bid combin item bidder express complementar item specul valuat impact possibl complementari item feder commun commiss desir combinatori bid bandwidth combinatori bid due perceiv intract winner determin paper winner determin combinatori auction bidder bid combin number bid accept combinatori auction gener combinatori exchang multipl seller multipl buyer commiss direct congress balanc budget act develop combinatori bid system balanc budget act requir commiss directli provid design conduct competit bid combinatori bid system permit prospect bidder bid combin group singl bid enter multipl altern bid singl bid sandholm artifici intellig rest paper organ section defin winner determin problem analyz discuss approach attack section present optim algorithm problem section discuss setup winner determin section discuss result section discuss increment winner determin quot comput properti quot section discuss applic algorithm section overview relat tree search algorithm section discuss introduc bid languag handl develop algorithm determin winner languag section present futur research direct winner determin combinatori auction assum auction determin decid bid win maxim revenu winner determin easi auction pick highest bidder item separ time number number item winner determin combinatori auction hard set item place combin bid number item bid bid submit combin winner determin simpli bid highest discard irrelev benefici seller accept inferior bid highest bid price combin max bidder agent submit bid combin bidder submit bid combin winner determin combinatori auction problem goal find solut maxim revenu win bidder pai price win max partit ti maxim broken desir randomli prefer bid receiv earlier receiv assign carri long special care combin receiv bid show power algorithm stem explicitli assign combin receiv construct part solut space popul bid correspond auction set item free sandholm artifici intellig definit partit set subset item item includ subset set partit note partit item includ subset notion partit simplic explicitli state subset item partit trivial determin bid win combin bidder highest bid bidder win combin winner determin problem formul integ program problem variabl xs bid combin chosen xs max xs xs subsect discuss approach tackl winner determin problem exhaust partit item optim solv winner determin problem exhaust partit item definit exhaust partit partit item includ subset partit space exhaust partit present fig number exhaust partit grow rapidli number item auction exact number exhaust partit number exhaust partit number exhaust partit level graph quantiti stirl number captur recurr understood addit item set item count number exhaust partit form ad item exist exhaust partit choic exist exhaust partit subset consid item subset sandholm artifici intellig fig space exhaust partit vertex repres exhaust partit arc repres divid bundl exhaust partit arc repres merg bundl exhaust partit exist exhaust partit previou subset count proposit asymptot complex close form proof present appendix proposit number exhaust partit number exhaust partit larg imposs number item auction extrem dozen practic winner determin algorithm complet exhaust partit viabl set dynam program exhaust partit space exhaust partit explor effici dynam program base dynam program determin set item highest revenu obtain item algorithm proce systemat small set larg optim substructur properti fact maxim revenu singl bid price sum maxim revenu disjoint exhaust subset algorithm correspond smaller subset entir set higher revenu subset subset complement dynam program algorithm restat sandholm artifici intellig algorithm program winner input bid receiv optim exhaust partit maxim hand side goto start time save dynam program compar fact revenu maxim solut subset comput dynam program run time significantli faster dynam program time dynam program complex scale larg number practic dynam program execut step independ number bid algorithm gener combin bid interpret posit mean auction determin ant long winner determin number bid receiv independ number dynam program algorithm choic number item small interpret neg mean algorithm scale small number item number bid small section present search algorithm avoid gener partit includ combin item bid submit algorithm scale significantli larger number item compact problem bid receiv combin partit includ consid dynam program discuss capit observ capit restrict attent relev partit definit set relev partit bid receiv restrict attent set combin bid receiv sandholm artifici intellig number relev bid recal combin receiv highest bid bid discard winner determin formul integ max xs xs integ program fewer equal number variabl constraint integ program number combin receiv bid discuss complex dynam program log combin item receiv input includ mean run log polynomi size input proposit state gener condit dynam program run polynomi time proposit dynam program run ρ time constant constant dynam program run ρ log time proof complex dynam program exist constant larg ρ exist constant ρ larg case ρ solv impli exist constant larg mean log exist constant larg substitut ρ ρ log ρ log import question complex dynam program execut step bid receiv import question exist algorithm run fast size actual includ bid combin complex problem algorithm solv polynomi time size input problem integ program formul problem weight set pack view bid set weight set npcomplet winner determin fact weight set pack sandholm artifici intellig approxim algorithm attempt achiev tractabl find good relev optim trade expect cost addit comput comput resourc cost delai expect improv solut algorithm establish worst case revenu optim solut greater posit time revenu solut found algorithm amount research gener approxim algorithm run polynomi time size input relev approxim algorithm develop weight set pack problem weight independ set problem winner determin section translat algorithm result theori combinatori algorithm winner determin problem gener case interest tame comput complex winner determin combinatori auction approxim winner determin question close optim algorithm understood remain open neg result show polynomialtim algorithm construct achiev reason worst case proof base recent result maximum cliqu proposit winner determin problem algorithm bound np proof assum contradict exist approxim algorithm establish bound winner determin problem algorithm solv weight independ set problem polynomi time weight independ set problem instanc polynomi convert winner determin instanc preserv approxim gener item edg graph bid gener vertex graph bid includ item correspond edg connect vertex algorithm weight independ set problem polynomi independ set problem polynomi time algorithm independ set problem directli maximum cliqu problem polynomi time class problem solv polynomi time random algorithm probabl error weight independ set problem problem find maxim weight collect vertic undirect graph vertic adjac sandholm artifici intellig maximum cliqu problem independ set problem complement graph recent show algorithm establish maximum cliqu problem np contradict practic perspect question approxim worst case answer algorithm close bound result construct asymptot algorithm establish bound random algorithm winner determin problem conceiv random provid improv bound proposit appli random algorithm advantag gain random bound depend number establish polynomi time origin weight set establish bound auction asc bound improv run time step step step step naiv implement algorithm polynomi algorithm winner integ approxim optim relev partit repeat xt xt return return greedi algorithm winner determin simpli insert bid alloc largest order bid share item bid bid algorithm establish bound bound algorithm establish algorithm comput complex algorithm quickli exce algorithm grow sandholm artifici intellig number item small compar number bid case combinatori algorithm establish bound proposit bound algorithm establish al show bound establish polynomi time posit ε np bound high limit auction bound bound algorithm captur revenu approach construct approxim algorithm worst case futil gener winner determin problem special case gener winner determin problem polynomi special case bid special structur cap number item cap number bid bid share item desir special structur enforc bidder restrict bid lead ineffici auction bidder bid combin auction gener bid special case algorithm bid happen exhibit desir special structur section review algorithm special case algorithm develop weight independ set problem weight set pack problem show appli winner determin bid item bound establish number bid bid share item bid greedili insert solut basi local search improv search termin number step bid insert bid share item bid remov solut improv chosen maxim ratio price divid sum price bid remov algorithm develop case bid share item bid bound establish linear time size input partit set bid subset dynam program solv weight set pack problem subset algorithm set establish bound bid color color bid share item bound establish polynomi time bid share item bid share item bid free bound sandholm artifici intellig ε establish local search time algorithm establish bound inn time largest subset bid bid share item bid subset bound establish polynomi time approxim algorithm special case improv repeatedli possibl probabilist algorithm improv determinist addit special case desir approxim properti found current approxim algorithm base restrict structur bid famili restrict lend approxim stem limit price function close approxim easi reason auction restrict bid price discard outlier bid set upper bound reduc revenu higher bid occur set lower bound disabl bidder lower valuat bidder valuat bid combin reduc revenu forc special structur make auction capit special price structur structur present put work approxim algorithm special case combinatori algorithm special case winner determin problem worst case provid current algorithm optimum limit import auction practic restrict combin optim winner determin polynomi time sever restrict appli winner determin carri optim polynomi time capit idea restrict auction sever hold chanc section review bid restrict suggest achiev polynomi winner bid item winner optim determin time algorithm match problem bid item proven reduct bid length greater winner optim determin number bid length greater factor exhaust combin long bid long bid larg number solut includ long bid factor solv rest problem case part problem bid length item alloc long bid sandholm artifici intellig fig bid tree structur interv bid combin tree structur leav correspond item bid submit node leaf winner optim determin time fig bid bid tree structur winner optim determin propag inform tree accept singl bid item node solut children node item order requir bid consecut item fig bid bid winner optim determin dynam program algorithm start item optim substructur properti fact highest revenu achiev item achiev pick bid entir pick bid combin choic algorithm run time sandholm suri develop faster dynam program problem run time asymptot hope winner optim determin time rerun algorithm time cut chain point faster algorithm sandholm suri time introduc famili combin item winner determin easi combin famili intersect winner determin problem solv famili solut famili highest revenu chosen lai item rectangular grid famili column famili row lai item tree bid solv time dynam program problem item structur direct acycl bid direct restrict bid introduc ineffici present auction bidder bar bid combin inher tradeoff comput speed econom effici restrict bid achiev provabl winner determin rise econom ineffici optim search algorithm sandholm artifici intellig gener approach optim winner determin base highli optim search motiv approach bid approach restrict combin order avoid ineffici occur auction recal auction lead econom ineffici comput burden bidder ahead game tree find optim solut unlik approxim algorithm maxim revenu seller obtain bid optim winner determin enabl auction design bidder incent bid bid discuss remov motiv bid strateg bidder express prefer winner determin maxim welfar system good end hand agent complet avoid loop redund gener natur concern algorithm search graph exhaust partit directli algorithm search space search fruit space capit heavili dynam program amount time irrespect number bid practic space bid extrem popul item longer life bid person world submit bid peopl happen bid combin bid impli relev partit small subset partit unlik dynam algorithm search space relev partit run time algorithm depend number bid dynam program search space tree search achiev goal input highest bid combin item bid bid list bn bj set item bid price bid set compact bidder make expand larg number bid bidder state readi pai item set item expand bid sandholm artifici intellig path search tree consist sequenc disjoint bid share item bk bid point path correspond relev partit set item bj path set free path end bid ad path occur item path search proce talli sum price bid bj path search revenu compar found search tree determin current solut store solut found search store solut optim solut care correctli treat possibl auction proposit revenu alloc item bidder item revenu item bid posit submit item proof auction bid item bid item bid combin profit auction alloc alloc bid posit price item auction receiv posit revenu alloc item bidder auction alloc revenu strictli lower item possibl item implement preprocess step algorithm place dummi bid price individu item receiv bid fig item bid dummi bid tree gener optim lost dummi bid includ set relev partit captur path root node leaf search tree algorithm find optim solut rest sandholm artifici intellig fig search space correspond bid list left item shown price dummi bid techniqu term dummi bid includ list bid total number includ dummi naiv method construct search tree includ bid includ item children node proposit enabl reduct branch factor capit fact order bid path matter proposit relev partit repres tree path root node leaf children node bid includ item smallest index item path includ item path search bs proof prove relev partit repres path root node condit proposit lead fact partit gener order bid path exist path bid occur multipl time child node tree bid child node remain proven relev partit repres path root node tree assum contradict relev partit bid partit search item alloc bidder auction dummi alloc note differ alloc item dummi bid yield relev partit leaf search item alloc bidder bid auction dummi bid sandholm artifici intellig bid item smallest index bid insert path contradict search algorithm restrict children proposit level fig bid consid level includ item fig illustr fact minim coincid depth search tree gener search path root node leaf correspond relev partit relev partit repres path partit gener call search size tree section analyz worst case size tree proposit number leav greater number leav greater eq definit number leav greater number node greater time number leav number node greater proof prove number leav greater depth tree node path item ni set bid includ item item smaller index ni nj upper bound number leav tree branch factor node strictli path tree maxim problem max st solv maxim upper bound number leav tree greater prove number leav greater dummi bid path root leaf correspond relev exhaust partit number leav greater number exhaust partit gener lower exhaust partit section show number exhaust partit proposit prove number node number greater combin bid search path root node correspond uniqu combin bid true combin bid share combin repres path number node greater sandholm artifici intellig node path number node tree greater time number leav proposit bound tighter bound proof log log hold posit number bound show number leav polynomi number bid worst case number item fix number item number bid due dummi worst number leav remain exponenti number item fast gener children determin find bid satisfi condit proposit naiv approach loop list bid search accept bid child includ includ item time search node loop list bid loop list item sophist scheme make child gener faster version secondari quickli determin children node place data structur call binari tree bid insert front leav part tree gener bid differenti classic binari tree vector variabl progress left depth effect bid includ item prune instantli place progress depth effect bid includ item prune instantli place correspond prune base item left depth fig illustr valu prune gener children basic principl node block time reduc factor repres bs item machin comput bs xor bit time return bid includ item root tree depth sandholm artifici intellig fig data structur select part valu variabl return bid satisfi proposit naiv implement set valu anew gener entir list continu child θ deploi faster method set valu gener child θ time present techniqu detail child determin search top leaf reach bid node ad path time append path algorithm set block bs block valu chang back backtrack bid path realloc place bid append path unexplor sibl determin continu backtrack explor tree η note backtrack depth item smaller indic path order children search node θ gener lexicograph order set view vector auction item vector bid item demonstr lexicograph implement execut memori alloc search accomplish observ open list requir search algorithm search search tree decid suffic search focu recent enabl algorithm depth search focu recent sandholm artifici intellig current bid includ item item vector children θ gener order item children order gener children order search branch explor implic order bid item child explor gener children node store link explor children order base addit explor children improv perform good solut found earlier main advantag termin solut find good solut earlier prune search path base bound discuss section complex discuss begin previou naiv approach gener time worst case gener reduc worst case find entir set correspond conduct search complex greater number edg time account proposit tight upper bound number edg proposit tree uniform depth convent root depth node children case number edg nm bound tight assumpt log constant log assumpt log proof proposit appendix complex reduct naiv method moder worst complex reduct significantli greater extrem case time sandholm artifici intellig bid includ item item complex naiv approach remain good case upper part log edg lower part complex log analysi section pertain singl node due substanti prune node suffer worst case child gener futur research studi complex child gener amort node discuss node prune sophist analysi child gener amort node children gener anytim winner search strategi implement main search search run linear space count static alloc data structur slightli memori shown proposit feasibl solut found quickli relev exhaust partit found end search path leftmost leaf path root interior node convert feasibl solut auction item alloc solut improv monoton algorithm track solut found implement anytim algorithm complet desir amount termin feasibl solut improv monoton test anytim turn practic revenu gener earli diminish return comput preprocess algorithm preprocess bid wai make main search faster optim preprocessor conjunct approach winner determin search algorithm subsect present preprocessor order execut highest bid combin bid insert bid set item exist leaf creat bid bid higher price bid discard ti broken randomli favor bid receiv earlier insert bid insert involv creat path length bid insert time complex sandholm artifici intellig fig search tree gener prune dot path gener prune occur reach remov provabl bid preprocessor remov bid provabl bid disjoint collect subset bid sum bid price subset exce equal price prune bid bid item prune bid item bid item determin bid combin disjoint subset bid search main search restrict search bid includ item prune includ block item ensur subset bid contribut prune prune determin perman discard particip prune bid bid larg number time save main search bid preprocess search bid prune main search main search path bid save preprocess carri partial partial bid left unprun optim main search main search compar full prune implement wai restrict cap γ number bid combin prune prune bid limit depth search γ cap φ number item prune bid longer bid target prune entail cap φ tree depth exclud wide tree long prune lead tree larg branch factor log polynomi constant cap tree cap find child log method prefer analysi make assumpt log constant proposit complex find child sandholm artifici intellig wast comput long prune lot preprocess time significantli main search time main search shallow branch includ long bid due fact item occur path long bid item bid price close method lead prune path cut prematur base cap set bid connect compon bid divid set item share bid set set determin defin graph bid vertic share edg bid share item gener adjac list graph time number edg graph search gener forest graph time tree forest set desir properti main search set bid item includ bid set present denot number item connect compon number bid connect compon question mark tupl bid tupl disjoint bid mark consid path pair bid item item bid item bid item definit tupl exclud base exist bs tupl determin prune virtual bid item bid tupl prune price sum price bid unlik inequ price comparison strict tupl equal good optim concern bid discard determin sound exclud tupl draw order avoid overhead track rare exclud tupl draw sandholm artifici intellig comput determin pair bid partial preprocessor cap γ φ γ φ run log time pair bid tree pair cap find child log handl complex log handl larg tupl slow main search ensur tupl exist path bid append path exclud rest path bid constitut pair bid share item algorithm determin quickli list bid exclud determin count start bid append count bid exclud increment bid backtrack count decrement search bid append path bid count accept iter deepen heurist main search iter deepen search strategi search search gener children preprocessor stai ida find provabl optim solut search small fraction entir search tree pseudocod show appli ida search strategi winner determin problem function discuss detail upper bound revenu item alloc current search path contribut defin earlier sum price bid current search path search upper bound total revenu obtain includ search node solut basic ida ida iter increment equal revenu solut found order avoid futil search solut algorithm convert heurist modif includ pseudocod analysi make assumpt log constant proposit complex find child convert anytim preprocessor optim start small conduct preprocess stop complet user decid stop stop criterion met convert approxim preprocessor prune sum price exce fix fraction price bid prune make main search optim sandholm artifici intellig global algorithm winner return set win bid maxim sum bid price loop winner null return winner algorithm return set win bid comput method present return prune return end path reach revert leaf reach return bid children children found winner bid solut null ii solut null return return iter ida upper bound solut qualiti commun search progress auction winner determin maxim heurist function underestim revenu item alloc bid path optim design admiss heurist heurist sum item maxim contribut maxim contribut price bid divid number item maxim bid item belong max constant determin rang discuss sandholm artifici intellig proposit heurist upper bound revenu item contribut proof set bid determin item contribut revenu item win bid revenu contribut item upper bound item simpli sum heurist ident heurist accuraci recomput time bid append path bid exclud bid exclud item current path constitut pair determin current path proposit heurist upper bound revenu item contribut proof exclud bid affect revenu design win recomput exclud proof proposit hold heurist method speed talli valu updat bid append path precomput bid list item item includ bid bid exclud list make updat item list bid belong comput list highest bid count recomput number item number bid item belong time complex main search worst case time complex main search polynomi bid exponenti item desir auction control number item control number bid receiv search due cap execut time neglig compar main search time altern ida unlik main valu comput combin subset prune ida set equal prune price fraction thereof case ida complet iter care heurist tupl handl correctli base result preprocess sandholm artifici intellig proposit number node prune time node node activ gener node multipl time node gener iter iter lower maximum lower previou iter lower iter gener search node previou iter number node search tree ida gener search node practic gener significantli fewer present pseudocod discuss section result hypothet worst worst case complex remain polynomi bid node ida complex polynomi complex number bid complex number bid receiv contrast approach dynam program execut step independ bid receiv setup determin effici algorithm ran experi uniprocessor workstat mhz sun ultra gigabyt bid pick number item randomli randomli item replac pick price randomli weight pick price number item bid draw number randomli chosen item bid pick price give bid random item repeatedli add random item probabl α item ad bid includ item pick price number item bid bid gener version delet gener produc produc bid bid bidder conserv method prune bid good model realiti number item larg bidder place bid randomli chosen chanc agent bid combin small due number combin larg case effect prune bid bid combin bidder algorithm run faster suggest conserv experi paper result sandholm artifici intellig focu ida iter leaf order magnitud faster search lower iter previou highest lower previou ida whichev smaller shown pseudocod previou reason higher highest lower previou ida iter criterion faster tend good rate number search node iter lead larg number search node number search node iter repeat larg portion search previou iter cap φ gave good preprocess time main search time φ led good valu rest experi hard problem instanc short bid preprocess tend neglig time compar main search tree short prune small cap effect easi case long bid uniform distribut bid prune bid bid subset save time uniform decai distribut partit bid connect compon number bid small compar number bid short experi random weight random bid fell connect compon bid long real world combinatori auction number bid significantli exce number item suggest practic set bid interest special structur lead item independ automat capit main search gener node number item small bid short item rate slightli number significantli number item bid size weight random distribut item search gener node algorithm solv case easili search path short heurist search long bid make heurist check slower search tree shallow make easier algorithm short bid observ support result point graph repres averag problem instanc execut time present includ preprocess time problem size previou optim winner determin approach dynam practic prohibit discuss earlier paper sandholm artifici intellig basic experi bid distribut problem instanc drawn random distribut tend easi reason search shallow bid long bid larg number small number bid search path weight random distribut easier weight unweight curv sublinear mean execut time polynomi bid clear unweight case paper extend experi higher ratio bid item sublinear appar unweight case compar fig weight random bulk execut time spent preprocess search avoid turn preprocessor distribut experi honest algorithm distribut fig execut time random distribut run time point number vari order magnitud averag point unusu high point happen encount unusu hard instanc fig execut time time search weight random distribut sandholm artifici intellig fig search time weight random distribut fig execut time uniform distribut preprocessor φ distribut futur research focu automat identifi cap set base problem instanc distribut weight preprocess time small fraction search time plot execut time search time present plot execut time uniform distribut harder bid shorter search deeper fig show complex bid search shallow decai distribut hard complex left problem lead fast search hard peak move slightli left number bid grow decomposit success bid set complex α longer bid lead shallow search graph decai fix α hardest sandholm artifici intellig fig execut time uniform distribut number item bid vari fig execut time decai distribut averag point unusu high point happen encount unusu hard instanc fig execut time decai distribut α vari scale larger number bid sandholm artifici intellig auction control number item sold combinatori control number bid end submit import winner determin algorithm scale larg number bid section test algorithm scale larg number bid fix number item fig show random weight random algorithm scale larg number bid complex polynomi number bid reach addit bid complex slightli uniform decai distribut harder curv mean execut time polynomi bid fig execut time random weight random distribut fig execut time uniform decai distribut sandholm artifici intellig vari number item fix number bid studi complex number item fix number bid fig show random weight random algorithm scale larg number item curv mean execut time polynomi item fig show uniform decai distribut harder execut time rapidli number item curv mean execut time polynomi item fig execut time random weight random distribut vari number item fig execut time uniform distribut vari number item fig execut time decai distribut vari number item fix ratio bid item sandholm artifici intellig practic perspect reason number bid grow number item grow addit experi call number item number bid fix experi fix ratio bid item fig present execut time random weight random distribut curv mean execut time polynomi bid item fig present execut time uniform decai distribut significantli harder random weight random distribut fig execut time random weight random distribut fig execut time uniform decai distribut sandholm artifici intellig increment comput auction set import provid result auction open motiv design increment method comput result subsect discuss increment winner determin increment quot comput increment winner determin auction set import comput optim solut interim bid receiv receiv bidder told current winner bid receiv inform naiv produc run preprocessor main search scratch time bid arriv amount redund comput reduc observ bid arriv winner determin carri prune bid affect solut solut optim bid arriv remain main search execut bid perman discard bid arriv make competit bid prune bid prune prune bid winner determin optim revenu bid conduct winner determin item bid includ item bs call optim revenu bs optim revenu bs optim solut includ bid win bid winner determin revenu bid optim winner determin item bs iter set optim solut return bid singl iter involv unnecessari search price high rel price scenario solut solut found higher lead prune search reduc number node gener iter start higher lower iter solut found lower bs start lower upper bound upper ub revenu optimum minu highest revenu obtain nonoverlap bid item bid ub sandholm artifici intellig max comput bid increment winner determin bid arriv recent winner determin observ extend set bid bid prune bid determin solut bid prune solut bid target prune bid prune light bid observ extend set observ main search optim lower bound optim lower bound initi main search complet iter return solut optim solut found includ bid optim solut remain singl iter involv unnecessari search price bid high rel price scenario higher suffic find optim solut optim solut reduc number search node iter start higher lower iter solut found lower start lower upper bound upper ub ub max bid maxim revenu obtain item maxim revenu obtain item bid revenu determin preprocess search techniqu comput faster carri winner determin increment quot comput set import prospect bidder bid winner bid bidder post sandholm artifici intellig bid obtain set item bid develop method comput exact quot revenu current optim solut remov item bid includ item determin winner optim call revenu reduc exact quot reduc quot bound upper bound quot bid bid comput upper bound exact minu lower bound exact reduc lower bound quot bid bid comput lower bound exact minu upper bound exact reduc lower bound comput approxim algorithm discuss earlier run anytim search algorithm paper amount time earlier solut obtain newest bid lower bound winner determin run support approxim quot meantim comput lower bound provid highest upper bound comput linear program relax problem section directli upper bound upper bound provid upper bound advanc current iter highest lower previou iter increment comput upper previou subsect winner determin run support approxim quot meantim comput upper bound provid lowest binari search quot quot bound hypothet bid combin binari search carri price run preprocessor main search algorithm price binari search gener bid observ previou subsect directli speed execut price point price preprocessor quickli determin hypothet bid competit lower bound quot binari search proce price search quickli find solut includ bid give revenu exce revenu obtain bid search interrupt upper bound quot binari search proce sandholm artifici intellig properti quot quot exact combinatori auction interest properti quot combin necessarili sum quot individu proposit quot combinatori auction addit proof auction bid item item combin quot item quot item quot combin mean provid quot individu item provid inform bidder prefer combin usual quot stai bid arriv bid reduc quot monoton hold combinatori proposit bid submit combin individu combinatori quot combin individu proof proof proposit bid submit combin quot item quot item bid submit item quot item bid quot set item bid simpli price bid applic algorithm algorithm winner determin directli solv weight set weight independ weight maximum cliqu fact analog problem addit coalit structur gener characterist function game characterist function assign potenti coalit agent object partit agent exhaust disjoint coalit maxim sum valu coalit agent correspond coalit coalit valu bid price problem analog winner determin problem coalit nonneg valu achiev normal hold front coalit structur gener differ winner determin major wai valu coalit nonzero space popul reduc algorithm capit bid speak favor dynam program scale past small number agent sandholm artifici intellig coalit structur gener valu coalit valu complet coalit structur search process sandholm al recent prove result anytim approxim algorithm worst case case harder case valu coalit observ relat tree search algorithm amount work field oper research problem analog combinatori auction winner determin weight set pack weight independ set approxim approach discuss detail earlier paper research exact algorithm problem algorithm typic search strategi upper bound revenu item comput linear program problem obtain winner determin problem item bid usabl bid search chang constraint xs xs linear program search node solv polynomi time size input interior point fast averag simplex method upper bound linear program relax tighten introduc cut addit constraint affect solut integ constrain linear program polytop major research question algorithm includ invent sound construct fast algorithm construct experi tradeoff time spent gener cut time save due reduct search tree size stem tighter upper bound vast literatur modern book approach good overview appli approach combinatori auction written recent gener approach lead smaller number search node approach tighter upper spend time search node faster depend problem instanc distribut view approach mutual view complementari hybrid algorithm techniqu approach fast child gener combin ida fast tradit integ program approach linear program relax provid upper introduc hybrid algorithm slow accur linear program relax fast provid upper bound search node sound comput type upper lowest paper circul technic review artifici similar call publish al present focu gener find optim solut differ algorithm wai search sandholm artifici intellig strategi ida combin search strategi domin ida lead fewer search node prune part search space search lead fewer search node ida search node close root multipl time basic child gener techniqu develop elabor method log child gener bin improv averag case speed child gener list bid list bid includ item find children algorithm loop smallest index item path bin techniqu rough approxim support comput valu advanc search cach cach directli incorpor algorithm relabel item search bid earli search relabel directli incorpor algorithm prove effect child order heurist determin order children node incorpor child order heurist algorithm straightforward increment child gener order children discuss section child order heurist incorpor algorithm gener children node batch order children search proce sophist preprocess preprocessor conjunct bid method winner determin review earli work combinatori auction base set bidder bid combin number bid accept work bid bid lead problem agent bid auction alloc item agent bid combin current techniqu focu captur synergi item local substitut bid occur simpl bid land slot bidder host address issu internet auction prototyp part electron commerc server call develop bid languag bidder submit sandholm artifici intellig bid combin bid accept bidder express gener prefer complementar substitut bidder express function bidder auction submit input xor xor xor xor xor xor xor xor xor xor xor xor xor xor fulli express bid languag advantag bidder express prefer approxim utter express bid languag extra express gener econom effici alloc winner determin algorithm input fulli express bid approxim fulli express bid languag enabl auction extract truth valuat revel bid fulli express bid bid made incent compat domin mechan mean bidder motiv bid bid render unnecessari mechan appli combinatori auction set assum fulli express bid languag win bid determin maxim revenu constraint item alloc bid amount agent pai sum win bid agent submit minu sum win bid actual optim alloc winner determin problem solv win agent bid make fast winner determin crucial note remov win bid time constitut incent compat mechan incent compat lost winner determin price determin approxim fulli repres prefer languag lead larg number bid combin xor maintain full time make bid languag call support set bid combin form combin repres independ bidder submit offer submit input bid empti set item sandholm artifici intellig xor xor note simpl languag special case languag shortest repres function languag longer simpl languag tradit winner determin problem xor special case winner determin bid result appli winner determin bid languag winner determin xor winner determin algorithm easili adapt handl simpl languag bidder place arbitrarili bid bid bid append search path exclud append search path discuss earlier occur bid share bid constitut pair determin mechan part algorithm list bid exclud bid append search path count bid bid exclud increment decrement bid backtrack search point bid count consid append search path handl xor algorithm easi bid simpli ad algorithm handl xor correctli reduc size search search faster constraint preprocess xor preprocessor work directli section uncov issu design modif preprocessor correctli handl paper circul technic review artifici fulli express input method bid mutual dummi item creat includ bid bid occur solut share item sandholm artifici intellig preprocessor auction bidder submit xor bidder submit naiv applic bid perman remov bid maxim revenu accept bid auction achiev revenu discard bid easili modifi correctli handl bid achiev discard bid aggress bid prune bid set bid bid prune bid set bid preprocessor auction bidder submit bidder submit xor naiv applic bid prune bid prune maxim revenu discard bid easili modifi correctli handl bid achiev discard bid aggress prune bid bid prune item set subset price higher equal set bid prune bid bid set occur combin xor bid prune bid bid preprocessor auction bidder submit xor naiv applic problem connect bid winner determin run independ limit practic reason multipl bid set item sandholm artifici intellig connect compon total revenu actual maxim revenu problem easili modifi correctli handl bid achiev problem aggress graph construct identifi connect extra edg ad pair bid connect compon identifi main search carri connect compon separ fourth preprocessor auction bidder submit bidder submit bidder submit xor naiv applic bid mark lead maxim revenu actual maxim revenu easili modifi correctli handl bid achiev mark tupl bid aggress bid mark ensur search path bid mark bid bid increment winner determin quot xor increment techniqu determin winner comput discuss section easili bid modif increment techniqu main search preprocessor adjust discuss previou subsect futur research combinatori auction bidder bid combin tend lead effici alloc tradit auction mechan auction valuat item addit user express complementar winner determin algorithm account paper tackl winner determin combinatori auction bidder bid unrestrict combin item sandholm artifici intellig determin winner maxim revenu npcomplet space partit item close form asymptot upper lower bound number exhaust partit deriv number larg work small number item dynam program avoid scale auction small number item gener entir search space independ bid receiv show condit run time scale polynomi approach optim achiev winner determin futil interest worst case approxim recent proven maximum prove winner determin problem combin establish approxim algorithm weight independ set problem weight set pack remain weak domain auction practic main hope practic approxim special case li form special bid price sever restrict optim winner determin polynomi time restrict introduc econom ineffici present auction tackl limit exist approach winner develop search algorithm optim winner determin experi bid distribut show algorithm significantli enlarg envelop input combinatori auction optim winner determin feasibl highli optim algorithm achiev capit fact space bid popul practic unlik dynam gener popul part search space algorithm method implement includ provabl suffici select gener children search secondari search find children heurist admiss optim speed algorithm preprocess search space highest bid remov bid provabl determin problem independ mark tupl bid determin ida search main easili distribut multipl comput addit speed burden search bidder give bidder portion search space explor introduc risk bidder search portion partial save comput effort desir bidder find good solut bidder report suboptim solut solut lead higher payoff prevent auction randomli select bidder report solut portion auction find solut report bidder sandholm artifici intellig caught fraudul penalti penalti high compar cost comput compar maxim gain report probabl check suffici bidder motiv search portion algorithm winner determin directli solv weight set weight independ weight maximum cliqu fact analog problem coalit structur gener characterist function game similar differ featur discuss present techniqu increment winner determin quot comput show quot bid quot combin show basic combinatori auction bidder express complementar item bid languag call fulli express bidder express complementar substitut discuss bid languag enabl mechan construct combinatori auction domin strategi bid strateg introduc fulli express bid languag call advantag extend search algorithm preprocessor handl languag languag arbitrarili insert bid search algorithm easili extend set auction item accomplish dummi bid solut feasibl search item alloc bidder bid neg price accept current work develop faster winner determin algorithm combinatori auction algorithm clear combinatori auction exchang studi impact side constraint attribut complex clear combinatori market direct restrict market studi complex clear market good sale bidder bid languag curv studi select bid elicit combinatori auction design optim bid agent valuat bundl comput acknowledg kate larson significantli contribut proof proposit anonym review comment appendix proof proposit proof prove number exhaust partit item auction set locat combin item sandholm artifici intellig combin locat number locat state locat candid exhaust partit exhaust partit form exhaust partit combin item locat item time item item place number candid number exhaust partit remain proven number exhaust partit lemma proof lemma posit integ proof count number exhaust partit bell number bell number equal number exhaust partit gener item wai calcul bell includ formula show number exhaust partit suffic show lim term seri formula suffic im show lim number overestim number exhaust partit exhaust partit count multipl time combin exhaust exhaust partit count locat combin form count sandholm artifici intellig set constant express interest calcul lim natur logarithm exponenti function calcul limit ln lim ln ln ln ln lim lim lim lim shown appendix proof proposit proof term tree depth node children number leav tree number binari node rest node unari child claim worst case largest number edg construct binari node close root depth tree consist binari node remain binari depth call tree fig illustr power binari node depth differ base binari node distribut depth number edg contradict tree depth sandholm artifici intellig fig fig transform proof node rest node larger number edg unari depth loss child binari perform transform tree make child consist path make child empti result tree depth node binari rest tree larger number edg contradict prove worst case remain proven number edg tree depth node children sandholm artifici intellig fig power case power complet binari tree top tree number leav binari tree number node complet binari tree number leav minu case number edg tree number node minu case binari tree branch length log amount log edg total number edg log nm log case power top part tree complet binari tree leav number node complet binari tree number leav minu case number edg tree number node minu case middl part includ unari binari node leav entir node middl part middl part leav depth middl part number edg equal number edg middl part bottom part includ branch length amount edg total number edg tree nm note power number edg case case cover case special case edg count bound proposit tight remain proven asymptot complex nm nm log analysi split case base rel magnitud sandholm artifici intellig case log log log log case log note log log refer mr level commit contract myopic individu ration proc intern confer system pp mr tradeoff realloc negoti combinatori contract proc pp contract type sequenc realloc proc twentieth intern confer distribut comput mr level commit contract myopic strateg econom dynam control issu comput earli version proc pp sequenti auction alloc resourc proc pp mm greedi local search weight set pack proc annual symposium discret algorithm pp eh price public public choic advanc minim prefer elicit combinatori proc workshop econom pp prefer elicit combinatori extend proc acm confer electron commerc wj wh wr combinatori ce rl introduct mit de combinatori survei august improv design iter technic report california institut social tame comput complex combinatori optim approxim proc pp set partit set cover equal oper incent econometrica mm approxim independ set intern workshop approxim algorithm combinatori optim problem lectur note comput vol pp mm approxim weight independ set subset comput graph algorithm appl earli version comput annual intern confer japan lectur note comput vol pp mm ja independ set domin discret appl math intern confer program springer lectur note comput vol juli sandholm artifici intellig mm hc graph partit local search applic constraint max graph algorithm appl cliqu hard approxim acta mathematica db sequenti simultan manag sci ds effici bound stabl vertex set pack discret appl math ds approxim algorithm pw publish rm reduc combinatori jw complex comput plenum pp combinatori auction multipl winner manag sci optim admiss tree artifici intellig limit agent proc workshop agent pp costli valuat comput proc theoret aspect reason knowledg pp person commun nation scienc foundat workshop research prioriti electron li truth revel approxim effici combinatori proc acm confer electron commerc pp algorithm maximum intern stabl set weight internat comput math analyz econom perspect sell spectrum econom perspect put auction theori simultan ascend technic stanford depart bid alloc combinatori proc acm confer electron commerc pp ch comput pm algorithm find maximum weight independ set arbitrari internat comput math sj vl rl combinatori auction mechan airport time slot bell econom parallel proc canadian conf pp mh rm manag combinatori manag sci strategi total transport cost transport nordic oper analysi cooper turku school implement contract net protocol base margin cost proc pp negoti limit phd contract type satisf task theoret proc aaai spring symposium satisf stanford pp gener electron commerc proc fourth intern confer autonom agent pp earli version proc workshop ai electron juli pp sandholm artifici intellig washington st dept comput scienc technic report januari issu comput vickrei internat electron commerc special issu appli intellig agent electron commerc earli version intern confer system pp ks mr coalit structur gener worst case artifici intellig earli version proc pp vr issu autom negoti electron extend contract net proc intern confer system san pp reprint mn huhn mp singh read morgan san pp vr level commit contract strateg game econom behavior issu ai short earli version level commit contract proc pp extend massachusett comput scienc technic report algorithm optim level commit proc pp extend washington depart comput technic report improv algorithm optim winner determin combinatori auction proc pp market proc pp side constraint attribut proc workshop distribut constraint pp fast optim algorithm combinatori proc pp winner determin combinatori auction proc workshop approach pp competit seal financ wireless telecommun feder commun wireless telecommun action wt septemb la integ pr mp michigan internet configur auction server human softwar proc intern confer autonom agent pp
DB/1339 3 graph queri languag queri process ozsoyoglu ozsoyoglu depart comput engin scienc case western reserv abstract applic involv queri graph data present objectori graph data oql graph queri data model languag illustr applic domain multimedia present graph discuss queri process techniqu translat call extend oper deal path sequenc discuss approach effici implement algebra oper path sequenc introduct applic hypertext geograph inform world wide web heterogen inform requir model queri graph data present data queri languag queri graph data model support graph queri languag extens oql enrich construct manipul queri object type path edg class applic graph data simpli gener queri languag data model extend edg class tradit statement queri extend oql express relationship node edg path object graph object manipul object featur capabl queri sequenc path special case addit sequenc oper tempor oper connect queri path queri involv rel order sequenc element support queri translat extend oper object algebra design process queri offer small set similar counterpart extend relat algebra operand set object uniform structur object consist oid tupl level nest object map intern type object gener procedur present convert oql queri reduc nest queri transform extens deal path sequenc extend tempor oper connect tempor oper multimedia present graph applic multimedia present possibl deliveri multimedia data user content multimedia present includ content individu multimedia stream specifi order stream assum multimedia present creat store form multimedia present graph select store multimedia present graph respect navig path present graph base content inform node discuss effici implement oper domain multimedia present graph observ present graph larg graph schema base huffman code call repres present graph repres path inform present graph compress give implement algebra oper connect effici rest paper organ section present multimedia present graph graph data model section present illustr exampl context multimedia present graph section discuss queri process techniqu elabor oper incorpor handl graph section discuss effici implement algebra oper section give relat work section conclud paper multimedia present graph graph data model multimedia present graph multimedia present graph specifi order type stream make multimedia visual present plan node present graph media direct edg node specifi relationship stream multimedia present american literatur period rise realism modern figur present graph entitl literatur consist video stream rf rise world wl text stream period trl tm text stream cultur imag data video stream vm overview literatur video stream present sequenti order time video stream text stream author period present concurr introduct present give comparison world literatur text imag data present concurr provid background inform american literatur period fiction period rl rise realism wl comparison world literatur author ro rl author tm author histor usa map usa modern poet cultur background rep rf figur multimedia present graph literatur data model defin data model object class class repres class type object belong class object basic structur type complex construct set type class tupl sequenc constructor order structur object compon set sequenc node object multimedia present tupl object compon type node inherit type pre inherit stream type pre pre graph class stream tupl type shown figur node object tupl object stream attribut pre addit attribut graph children attribut incorpor graph data similar ffl node type ordinari object type object node type hand object data object type object ident attribut valu basic type object type object node type node graph ffl edg type sequenc base type node type edg type restrict object edg type sequenc length node element edg object call sourc target ffl path type sequenc type node type base type object path type sequenc node element sequenc length path object edg length repres trivial path singl node ffl graph type tupl type special node addit graph node attribut set refer node object edg attribut set refer edg object multimedia present graph direct acycl graph present stream node present edg describ sequenti concurr stream present graph titl type node node type give class definit video data type multimedia data type video stream consist sequenc repres frame content object relationship content object graph class pre graph type class stream type pre rep date edg class pre edg type class pre node inherit stream type pre attribut class frame type fc attribut class object type attribut denot set denot sequenc constructor figur data model multimedia present graph class extent pre pre object class pre pre pre frame object extens oql queri languag queri manipul graph data model section extend oql method construct express relationship graph object queri creat edg path graph extend oql abil queri path sequenc tempor oper build block graph method method graph return set path graph node node connect return empti set return set subsequ sequenc element element return empti set path usual sequenc oper applic path minor modif return node path return node path path result concaten path path graph node path node node sequenc result concaten sequenc note necessarili path graph path path addit path edg exist set node path note similar oper oql turn list set element note return set edg path return rue node path return return rue edg path return return rue element sequenc return queri object queri creat object select exist object queri languag support type mutabl liter depend object construct select result queri object object object gener queri languag produc current node queri node object queri object oql edg object path queri edg path object similar queri sequenc oql construct edg path object type constructor keyword edg path edg path object edg path class edg path object construct queri syntax select type constructor identifi identifi note edg queri return sequenc node node sequenc length give find present path node node present graph select pre present graph figur satisfi queri graph present path queri vm trl vm trl tm correspond path graph begin node termin node graph construct graph object keyword graph graph type constructor special thing graph object special attribut node edg graph object construct queri syntax select graph class queri queri identifi queri identifi note queri return set node object queri return set edg object queri sequenc path queri multimedia present graph involv sequenc node object sequenc object repres path special case fg denot insid fg time queri denot insid option queri graph class keyword graph sequenc oql support sequenc data type oper extract subsequ sequenc concaten sequenc queri involv rel order sequenc element indic support addit sequenc oper tempor oper connect queri path sequenc tempor oper util form boolean path predic path sequenc path formula defin variabl denot path node graph atom path path boolean condit return rue trivial path singl node satisfi consist builtin predic involv arithmet set membership oper denot path omit denot path denot path case path formula tempor path tempor oper connect atom path formula return rue rue path defin tempor oper singl edg path edg path node path satisfi condit satisfi path formula return similar atom path condit omit path variabl omit ambigu connect abbrevi path formula connect return rue path path formula tempor path tempor oper path formula tempor oper return rue path defin tempor oper denot path concaten note edg path satisfi path formula tempor oper path express sequenc concaten oper denot path concaten path satisfi path formula tempor oper connect path instanc return rue satisfi ffl ffl path path formula return path sequenc concaten oper path formula return similar path formula tempor intermedi path variabl path formula omit ambigu path path formula defin sequenc omit discuss queri exampl illustr queri graph exampl present graph find stream present video stream world select pre wl wl wl world connect connect wl find graph video stream concurr video stream text stream rise author edg object special case path edg path length tempor oper queri edg object select pre rise author note queri express simpli check edg graph select pre rise author present graph figur includ queri result present graph find path start video stream immedi video stream rise end video stream world select pre rise world connect queri illustr connect oper path queri return set path vm tm present graph find present path video stream select pre present present vm satisfi condit queri process queri translat call extend oper path queri process give overview elabor algebra oper extend deal path sequenc show transform exampl object algebra simpl operand design process objectori queri operand set object uniform structur object consist oid tupl level arbitrari complex valu tupl attribut transform oql queri bulk data type object map intern type object level nest algebra oper defin divid group group oper similar defin relat select cartesian product project union differ differ assign oid result tupl renam sg object renam creat object properti tupl os properti object result handl complex similar nest unnest extend relat algebra group map relat oid attribut valu assum attribut map oper oe return attribut hold oid object hold attribut valu object oe sg map core remap express core oper scalar map bulk data remap oper result map ag due uniform operand simplic small power set algebra law crucial build power optim small algebra rewrit search space gener procedur present convert oql queri express nest present complet solut reduc nest queri evalu effici gener transform method unnest queri discuss paper rest concentr process queri involv path main differ oql intern multimedia present graph type map intern type uniform structur type level type map intern type multimedia present graph figur figur pre graph oid node edg literatur pre node oid graph type children author rise author author world cultur nil pre edg oid figur multimedia present graph algebra oper queri path tempor oper queri path defin algebra oper connect tempor oper connect oper binari operand object intern tupl repres path attribut oid graph repres path path sequenc oid node path attribut oid graph path attribut return oid oid oid pair tupl refer graph path repres adjac adjac output tupl concaten path result tupl attribut graph concaten oid hold oid defin connect return connect oid oid set path cg pair tupl refer graph path repres connect connect path begin end multipl tupl creat connect path result tupl attribut hold graph object hold result oid hold oid return oid oid path made path path tupl creat path result addit algebra oper tempor defin algebra oper transform repres node repres path node attribut node object possibl attribut ng renam attribut list type attribut singleton sequenc origin repres singl node path present graph find path made consecut video stream select pre path express evalu step ffl evalu node remap ffl transform node path renam operand ffl construct path satisfi path express attribut hold path oid oid oid oid oid oid figur evalu present graph find present path video stream select pre path express evalu step ffl evalu ffl transform node path ffl construct path satisfi ffl construct path satisfi attribut hold path video stream oid oid oid oid oid oid oid oid oid oid oid oid figur evalu system multimedia present graph evalu graph queri involv graph costli base observ present graph expect larg node call repres present graph uniqu code assign node uniqu identifi node specifi distinct path graph node node node multipl multipl path graph node node exist path connect path deriv graph algorithm assign assign present graph node assign node empti set oid assign graph start node assign node figur present graph figur rep rf ro rl rl usa wl figur assign present graph figur briefli state featur system paper remark node children figur children form trl children trl remark node parent node multipl incom edg multipl figur node parent node remark assign node direct acycl graph remark correspond node path graph node node direct acycl node node descend node node form binari string form defin path node node order assign uniqu path uniqu node exist repres reason assign graph assign assign assign path figur node distinct path node correspond path correspond path remark assum binari string form defin uniqu path length figur node vm defin path length vm node rep rf rl order repres path wai repres path identifi node specifi distinct path graph node remark straightforward pair begin end node repres path remark identifi pair end path remark exist path repres multipl remark path total distinct pair end repres distinct path figur node path vm end pair repres pair identifi distinct path path begin node remark path length exist binari string end pair repres hold string begin child child child child child child child child child figur binari string describ path begin call path suffix obtain path shown figur follow edg lead child follow edg lead follow edg lead child base path identifi fix path suffix path suffix identifi specifi path remark corollari fb path suffix identifi fb mg determin specifi path figur path vm repres path begin string path obtain fix begin child vm child vm addit identifi path begin node path discuss path evalu end pair begin path identifi repres path set pair set begin path sake path shown path end pair repres pair repres remark pair repres connect path exist pair pair repres repres connect path repres path begin connect path figur arbitrari pair repres correspond correspond path connect path path pair fb exist pair pair correspond path correspond path identifi connect path identifi path figur pair path pair path connect path pick arbitrari pair connect path vm exist pair repres connect path tm exist pair identifi arbitrari pair repres correspond path pass hold pair true path pair path evalu evalu pair result mean pair order path repres path set end set path begin node path suffix corollari adjac edg pair repres exist pair pair repres repres connect edg repres path evalu connect path connect corollari pair repres pair jj repres path pass path pair set repres corollari show evalu pair connect path pair connect path evalu pair path suffix connect path remark pair repres path repres fb path suffix rest repres path set begin node path suffix inform set end compress make path evalu effici reason result evalu construct pair repres evalu end pair path suffix set begin result path set begin make path evalu connect oper algebra oper queri path path repres set begin path suffix assum repres path attribut begin hold begin string type attribut suffix hold path suffix give definit predic procedur definit algebra oper tupl repres path graph attribut begin suffix predic check adjac connect ae adjac return true adjac return ae connect return true defin procedur find path suffix connect path end node begin node fc return set string form path suffix connect path end node begin node special result set singl string form return empti set give definit algebra oper attribut graph oid attribut suffix possibl attribut begin set begin node path tupl attribut suffix string type path suffix return oid oid oid begin suffix pair tupl refer graph path repres adjac creat tupl repres concaten path creat tupl graph begin hold set begin result suffix hold path oid hold oid similar connect return oid connect oid oid begin suffix pair tupl refer graph path repres connect connect path multipl connect tupl creat output result result tupl attribut oper return oid begin suffix oid oid path made path path tupl correspond result addit algebra oper defin tempor algebra oper nc mean make path defin transform node path node attribut node object possibl attribut nc begin suffix ng nc extend attribut begin begin set type hold node suffix string type assign empti string begin suffix repres singl node path node oid sequenc path defin algebra oper fb suffix identifi present graph find present path video stream video stream select pre connect path express connect evalu step ffl evalu node remap ffl transform node path nc nc ffl construct path satisfi connect connect ffl materi node oid sequenc path attribut hold node oid sequenc path oid oid oid begin suffix nc oid begin suffix nc oid begin suffix oid oid connect oid oid oid figur evalu connect implement oper connect discuss evalu algebra oper connect path give compar altern note adjac list implement graph attribut storag model evalu tempor oper attribut oid graph repres path sequenc node attribut graph path attribut assum main memori buffer buf size page make assumpt graph oid oe oe oe graph fit main memori buffer buf page tupl graph page reason assumpt present graph graph node algorithm evalu oper implement oper basi sort graph oid graph oid load graph tupl graph evalu oper tupl pair tupl graph oid check adjac creat tupl concaten check pair check fetch pre node object end node check children attribut begin node algorithm improv graph oid sort element sort element begin attribut tupl oid tupl begin node oid check adjac check tupl adjac tupl graph evalu connect oper similar evalu implement connect oper basi sort graph oid graph oid load node tupl graph evalu connect oper tupl pair tupl graph oid check connect connect path begin node end creat tupl check precomput path form node node graph pair check path find connect path begin end exist path similar algorithm improv make sort order load tupl sort element sort element begin attribut tupl tupl begin node check connect node evalu oper oper evalu repeatedli call algorithm evalu evalu oe oe union improv algorithm repetit evalu basi evalu sequenc evalu time evalu sequenc oper graph load node tupl perform sequenc output load tupl graph avoid extra disk read cost repeatedli load tupl graph algorithm storag model evalu tempor oper attribut possibl oid graph begin set begin node suffix hold path suffix denot attribut assum main memori buffer buf size page make assumpt graph oid oe oe fit main memori buffer buf evalu oper oper evalu basi sort graph oid graph oid load tupl graph load node evalu oper tupl pair tupl graph oid check path repres adjac creat tupl concaten check pair path repres begin path check path tupl repres compar end node obtain concaten begin node path end begin node corollari section pick arbitrari begin concaten form end check find satisfi form adjac uniqu determin path adjac evalu connect oper implement connect oper basi sort graph oid graph oid load tupl node graph evalu connect oper tupl pair tupl graph oid check path repres connect connect path begin node end creat tupl path repres begin path check compar end node begin node connect path end node begin node pick arbitrari algorithm check begin node corollari find connect path evalu connect oper similar evalu differ check find connect number tupl creat equal number connect find check left evalu oper approach evalu oper evalu repeatedli evalu basi differ underli evalu algorithm preliminari comparison section algorithm tempor full version algorithm cost refer empir evalu cost formula deriv make observ observ tempor evalu algorithm smaller number disk access evalu algorithm observ fact algorithm load page node observ tempor evalu algorithm smaller number comparison evalu algorithm improv notabl connect oper algorithm evalu connect oper make comparison end point path costli graph elimin algorithm effici drawback system graph overhead assign transform path repres sequenc node oid path repres case graph mainten costli relat work gute data model languag explicit model queri graph data model salient featur kind class call simpl edg path class simpl object plai role node graph edg object repres edg graph path object object addit list refer simpl edg object form path graph statement provid fundament tool nest subqueri gute complex queri express step comput class path express restrict graph step step state deriv queri structur queri complex comput tree logic existenti quantifi infinit long path formula navig path repres branch time line tempor oper proposit linear tempor logic construct path formula assert satisfi singl path queri tempor oper successfulli richardson tempor oper express assert sequenc exist differ tempor oper tempor logic express assert tempor variabl instanti node graph element tempor formula appli start fix state state reach usag tempor oper oper binari tempor unari oper differ make tempor oper simpler straightforward express express approach queri sequenc data literatur wang sequenc logic famili sequenc oper base regular express add power manipul sequenc physic express properti sequenc base straightforward reason regular pattern mean regular pattern pattern match gener speak pattern specifi content compar order element pattern specifi locat element content element express sequenc properti procedur indirect align logic grahn al move window align element sequenc respect desir express assert align element comput counterpart align logic class automata align logic desir express power nondeterminist natur comput model make evalu queri problemat queri world wide web activ research area recent retriev inform web answer exploit structur topolog document network queri languag design web integr textual retriev structur topolog queri model web document node hypertext link edg hypertext link citizen model queri express path regular express constraint hypertext link theori queri cost base idea weboql queri languag offer class data restructur oper context web data model base order tree main data structur offer weboql abstract nest order weboql offer high level abstract web level abstract weboql high tradit model weboql perform complex restructur oper web weboql simul nest relat algebra oper simul comput transit closur arbitrari binari relat express power weboql li ext unql lorel languag semistructur unstructur data unstructur data organ similar oem data model lorel unql express queri express tree arbitrari depth regular express path unql offer procedur construct restructur lorel languag design semistructur data underli data model view extens odmg lorel extens oql main novelti lorel coercion reliev oql strict type path express make declar navig exact knowledg schema strudel manag system appli concept manag system build maintain web site novelti strudel separ task creat web manag underli manag site structur graphic present site data model strudel system graph data similar oem data model level data view uniformli graph struql languag li heart strudel semistructur struql regular express queri restructur graph novelti struql separ queri creation graph similar languag unql design queri graph tempor oper queri similar regular express languag import part paper queri process techniqu extend oper deal path convert queri express discuss effici evalu oper path sequenc present data model oql queri multimedia present graph power queri languag applic involv special sequenc graph discuss oper construct queri sequenc base content inform discuss queri process techniqu give implement algorithm implement top storag manag capabl process oper futur work includ optim express involv path sequenc algebra oper refer restructur lorel queri languag semistructur evalu path algebra technic queri languag optim techniqu unstructur pp unpublish object edit tempor modal logic handbook theoret comput chapter leeuwen pp boat experi manag acm wang match unifi approach queri sequenc acm pp van den object ieee transact knowledg data string acm sigmod pp model queri graph intern confer larg data pp huffman method construct data system stori pp present languag multimedia technic process techniqu multimedia submit oodb queri multimedia present base ieee tran knowledg data process techniqu multimedia journal multimedia tool kluwer academ complet solut reduc oodb nest tech complex structur symposium principl pp queri languag graph problem ieee tran knowledg data engin pp bonner datalog symposium principl pp world wide process techniqu queri acm relat algebra relat calculu attribut aggreg acm vol relat calculu set graphic ieee vol sep pp list data model time vldb multimedia present technic logic ieee symposium foundat comput pp ibm system
Agents/1340 1 support trust virtual commun depart comput colleg london unit kingdom stephen depart comput colleg london unit kingdom abstract stabil commun depend balanc trust distrust face inform uncertainti risk promin featur modern live member cope complex uncertainti reli basi social interact small number trust model virtual find larg impract artifici paper provid discuss trust model ground social trust base reput model agent decid agent opinion trust agent progress tune understand agent subject recommend introduct capac commit oneself fulfil legitim expect constitut virtu kei causal precondit exist everydai trust directli indirectli simpl item shop bui brand found trustworthi past reput wide directli trust store sell genuin product brand credit card transact electron transact system trust machin reject custom transact system gener trust sound monetari system cash transact proce tool complex reduct accomplish trust provid intern secur action uncertainti incomplet inform function trust includ trust essenti economi facilit problem solv encourag inform exchang influenc team absorpt formul basi polit sound trust silent presenc social interact social interact quickli concept span multipl polit cultur boundari virtual commun real commun meet physic member exist conveni proxim role trust plai commun appli virtual virtual interact human bound true artifici entiti softwar agent creat serv human person result interact fed back human form vital satisfactori trust model provid virtual commun complex larg distribut system internet manag electron commerc proce smoothli artifici autonom agent resili effect provid trust reason capabl relat work work trust comput scienc concentr area secur form formal logic analyz cryptograph protocol design flaw correct ill suit gener model trust applic specif domain design autom concret definit trust author assum intuit notion trust unsatisfactori trust notion hard lack definit open trust model subject interpret incompat protocol implement true trust model aim provid trust model base real world social properti found work social scienc similar approach marsh trust model sociolog foundat model shortcom present marsh incorpor aspect social trust introduc larg number variabl model make model larg complex trust complex facet thing variabl continu valu intend repres abstract notion abstract real world concept introduc ambigu semant concept hard repres singl real number applic amplifi ambigu effect practic trust model virtual environ exist goal approach goal work provid trust model virtual commun assist user identifi trustworthi entiti artifici autonom agent abil reason trust trust model base real world characterist trust model simpl understand intuit usabl metric unambigu user simpl implement code artifici subject strict resourc constraint approach discov characterist turn social scienc work carri subject trust field econom rich environ draw note decid work trust model base word import trust support social mechan notion reput reput inform extern sourc experi agent term agent refer activ entiti virtual human outlin paper section outlin specif typolog characterist trust review social scienc literatur section briefli defin reput section detail trust model relev data structur oper present applic model section present section trust trust social phenomenon artifici model trust base trust work peopl societi carri survei social scienc identifi characterist trust relev work outlin clarifi notion trust defin trust trust complex notion studi narrowli scope rise evid lack coher research definit trust find instruct definit trust level subject probabl agent perform monitor action independ capac monitor context affect action mathemat probabl properti make unsuit trust discuss section term probabl indic exist level depend typolog social scientist collect identifi type trust interperson trust trust agent agent directli trust agent context specif alic trust specif agent bob mechan specif context servic car context children system imperson refer trust base properti state perceiv properti relianc system institut trust exist monetari system disposit refer describ gener trust attitud basic attitud oneself independ parti context subtyp disposit trust defin al type concern belief benevol type disposit irrespect potenti posit outcom persuad act trust trust characterist trust object properti agent subject belief agent belief trust rang complet distrust complet trust situat agent opinion anoth agent ignor agent trustworthi trust action uncertainti outcom anticip posit outcom draw conclud trust game blind trust base relev prior experi knowledg experi knowledg form basi trust futur familiar situat trust reason induct deduct trust dynam addit evid experi time trust agent intuit repres trust probabl measur problem probabl valu meaningless base repeat imposs deal everydai experi problem probabl observ observ probabl inher transit trust necessarili alic trust bob bob trust necessarili follow alic trust formal argument trust consid problem trust discuss unsuit probabl theori deal uncertainti trust action follow rule ration choic theori agent reason cognit evalu risk util trust made term ponder futur outcom reput individu resourc evalu aspect situat make trust agent reli sourc inform complet knowledg trust anymor obtain inform sourc mean mechan propag reput mechan form social behaviour agent system influenc act cooper groceri store quickli gain reput surround neighbourhood long run forc close shop improv reput good reput reput consid form social commerc reput inform import make effect inform trust word manag complex social life singl trustworthi peopl interest meet definit reput work reput expect agent behaviour base inform observ past behaviour reput inform sole opinion includ reput inform complet base individu agent person experi reput inform combin person opinion opinion reput subject trust model trust model base sociolog characterist previou section model support properti social outlin section trust support neg posit belief agent short rang valu trust base prior experi agent identifi repeat experi similar context agent agent exchang reput inform support reput mechan assist trust trust transit evalu recommend account sourc recommend trust subject observ percept agent trustworthi trust dynam experi recommend level trust agent interperson trust support exclud disposit system trust descript model figur model model deal belief trustworthi agent base experi reput inform context experi result evalu experi reli recommend review paper point similar tan trust model agent action follow agent trust belief omit paper reason trust action base belief trustworthi aspect util belief motiv scope paper refer assum infer form trust believ carri state belief trust action model determin trustworthi agent base agent collect statist direct experi recommend agent agent maintain specif trust statement form trust respect context trustworthi agent obtain relev subset record experi direct trust repres agent belief agent trustworthi context td semant td tabl leav context variabl open agent defin context trust model tabl trust mean trust mean vt trustworthi vu recommend trust agent agent trustworthi give recommend agent respect context repres recommend necessarili repres belief recommend agent assum recommend lie give contradictori recommend agent distanc recommend xs percept recommend agent trustworthi appli recommend obtain mean recommend percept trustworthi equat perceiv recommend trustworthi appli obtain direct leav context variabl open data structur agent opinion base previou interact agent maintain separ set direct trust experi set recommend trust experi assum set context agent set agent interact directli assum outcom member order set repres bad valu correspond valu tabl set set agent directli trust agent context vg vb accumul experi vg vb defin set set trust recommend agent experi recommend result goal obtain similar refer semant agent recommend xs percept outcom simpl recommend agent trustworthi respect context xs evalu experi grade lower futur recommend adjust xs experi downgrad recommend differ domain adjust valu set agent context set adjust vg vb repres adjust recommend domain valu set vg vb defin evalu direct trust determin direct trust td agent respect context reput context obtain relat vg vb td td subscript index largest element return td assign uncertainti tabl symbol tabl uncertainti valu td mean vg good bad vb bad good combin equal amount good bad evalu recommend trust determin recommend trust agent context find relat vg vb obtain mod absolut valu member set vg vb distanc agent recommend actual experi reli recommend evalu semant distanc sd vg sd sd sd vb evalu recommend context find relat vg vb member sd assign mod member set sd mean uncertainti recommend experi requir resolv uncertainti adjust made evalu recommend futur recommend decid differ experi reli uncertain recommend evalu recommend evalu recommend bs trustworthi context repres evalu semant sd vg sd sd sd vb context shown previou appli adjust sd obtain adjust recommend trust shown sd denot oper order vg sd vg downgrad vg updat experi experi agent experi relat updat increment experi type counter vg vb relat experi increment experi experi result reli recommend agent updat experi obtain relat vg vb ad differ recommend trust shown oper number level upgrad downgrad rv good combin recommend agent encount recommend recommend agent evalu final trust ct combin obtain recommend trust recommend unknown agent obtain recommend recommend assign weight tabl adjust recommend recommend trust sum weight recommend recommend tabl recommend weight unknown weight defin assum recommend individu weight weight recommend set member weight recommend recommend sum final combin trust ct sum highest largest sum ct assign uncertainti tabl bootstrap model agent learn recommend agent complet prior experi trust recommend agent agent face high uncertainti agent meet unabl distinguish trustworthi agent make agent vulner complet newcom commun chanc rogu agent advantag newcom pretend offer malici hidden motiv real resourc guid newcom field travel guid give recommend travel aspect destin reduc uncertainti recommend agent equip number entri set initi interact made trust parti recommend trust recommend issu import artifici agent human agent artifici agent inher human agent artifici default human owner agent virtual commun complet intent seek avenu exploratori recommend deploi agent robust resili malici encount riski environ applic illustr rate recommend book author good author book author assum experi set state receiv recommend unknown tabl recommend author recommend recommend trust vg author author vb evalu recommend obtain recommend trust recommend illustr remaind show calcul result shown tabl adjust recommend appli find recommend semant find sd shown recommend sd adjust recommend appli sd tabl result evalu recommend author recommend adjust recommend vg author author vb combin recommend assign recommend valu tabl sum weight recommend author result tabl tabl result combin recommend author sum vg sum sum sum vb author author final author level column highest sum final recommend trust author author author updat experi book author author updat recommend recommend vg experi level vg vg vg updat experi book author author book found good complet updat result valu shown author author notic ad member set consist experi unknown recommend author author author ad direct experi set conclud trust form basi interact includ virtual paper issu trust societi outlin model support trust virtual base experi reput applic illustr acknowledg adhoc natur aspect trust tabl weight tabl futur research attempt identifi concret metric interest simul artifici societi implement trust model present paper refer pgp trust model april trust abadi needham logic authent acm transact comput februari barber logic limit trust klein valuat trust open network european symposium research comput isnt trust secur protocol intern dasgupta trust commod make break cooper basil blackwel dunn concept trust polit john lock philosophi cambridg trust make break cooper basil blackwel needham reason belief cryptograph protocol ieee symposium research secur street level epistemolog trust polit type trust distribut system secur paradigm trust power marsh trust comput concept phd maurer model infrastructur european symposium research comput mean trust technic report carlson school cum trust format relationship inform scienc trust modern societi cambridg axiomat basi trust distribut system ieee symposium research secur social control global agent system master swedish institut comput simul social control secur internet commerc secur paradigm lake tan gener model trust electron commerc intern bled electron commerc bled beth trust relationship secur system distribut authent perspect ieee symposium research secur zadeh probabl theori suffici deal uncertainti neg view uncertainti artifici kanal elsevi scienc
Agents/1341 1 taxonomi web agent huang anton alex van paul de bra free amsterdam depart mathemat comput scienc de boelelaan hv netherland center mathemat comput gb netherland eindhoven technolog depart mathemat comput scienc mb netherland abstract paper taxonomi web encompass agent provid interfac inform retriev servic guid visitor navig virtual environ taxonomi regard instrument delin target research realiz prototyp applic demonstr intellig web deploi establish implic target applic respect softwar architectur comput resourc kei web virtual commun introduct lot interest work research develop agent technolog applic web type web agent recent rang inform gather seek travel assist negoti problem solv agent mention exist virtual commun agent natur question relat phenomenon relat di erent type web taxonomi classifi taxonomi web encompass agent provid interfac inform retriev guid visitor navig virtual environ taxonomi regard instrument delin target research realiz prototyp applic demonstr intellig web deploi establish implic target applic softwar architectur comput resourc research part dutch research project web agent support program part research project develop person assist maintain electron archiv taxonomi present paper meant serv select suitabl agent architectur wasp project paper organ section overview intellig servic web section discuss role agent plai virtual environ interest virtual environ justi es dimens versu section section elabor exist agent comput consid applic virtual commun agent section dimens web discuss type web applic section research issu address realiz potenti intellig virtual environ section conclud paper intellig servic web overview short web de facto standard dissemin retriev inform due exponenti growth web inform nding relev inform dicult case longer user search speci inform view access web increasingli mediat intellig helper softwar assist user nding relev interest inform ed larg bodi includ view share author develop rst year web feasibl creat fairli complet subject index world wide web yahoo promin subject index search engin provid full text search virtual web approach prove sucient order serv user web combin search index search engin er combin access inform site begin er person portal custom user adapt user interest automat person step move portal gener inform servic person agent point user relev inform hide stu user eld interest similar evolut exist area educ person agent er bui suggest automat bui product price condit adapt learn system user studi subject show page read order order reach object adapt system found work de nition notion adopt includ characterist social strongli meant stress adapt approach provid assist user user assist involv intellig desktop support paper inform ltere storag augment search deleg task respond set share mainten user prefer pro le make proper select music applic bene metaphor stress kind situat softwar process interact process adapt individu user prefer avoid discuss agent state applic involv make applic bene emploi actual agent metaphor section brie outlin make technolog servic scope applic deploi agent technolog web overview agent research applic develop agent technolog restrict agent encount inform entertain domin applic area adapt system agent metaphor wasp project concentr inform manag rst distinguish varieti task applic domain agent inform retriev collect lter inform inform present te present inform understand intellig navig enabl select relev inform order realiz function framework agent technolog program framework declar descript base user includ cooper behavior softwar interact agent section research issu involv develop framework concentr realiz agent context virtual argu section addit constraint lead addit requir framework satisfi agent virtual environ virtual virtual realist architectur provid servic web world er possibl present larg inform space attract present servic adequ establish function agent virtual brie histori agent manifest explor agent technolog deploi virtual commun visitor inform retriev task navig encount creatur autonom charact game avatar guid virtual world section discuss autonom charact game section explor agent technolog plai role virtual environ agent commun server virtual enter visitor welcom guid case ect chat announc visitor visitor exampl guid found environ creat commun server technolog commun server platform creat virtual environ maintain inform state commun whereabout virtual world de ned ned world enter member visitor chat mean virtual environ surround possibl visitor agent guid belong space commun server provid support agent agent commun server program attribut react event origin agent call bot opinion function agent surpass simpl term agent interest detail behavior agent de explor enhanc behavior agent speak intellig agent agent program script languag agent bot script consist robot de nition de ne robot nicknam graphic reaction de nition de ne pattern event action session de nition scene server bot belong start session statement initi speci session robot de nition section rich repertoir includ interest busi card reaction de ned indic event event pattern action platform er rich set includ event chat channel event occur world action includ simpl chat channel movement beam desir spot world time action occur timer bot guid period undertak action larg number event rich repertoir agent platform limit simpli pattern power program complex behavior requir maintain inform period time agent platform er api develop augment function simpl bot put burden shoulder face task creat platform intellig agent virtual environ er present interact basi make develop complet support easier inform retriev virtual environ question agent virtual inform retriev line section interest inform retriev problem virtual environ consist detect relat gather inform object includ geometr shape imag sound object approach problem radic di erent featur detector meta inform increment knowledg gather featur detector featur detector common mean multimedia system obtain inform media imag audio order establish measur similar media object problem respect select relev set featur assign proper weight determin similar media featur detector ectiv deal binari encod materi imag audio materi virtual environ made note content virtual world program result algorithm gener geometri hard obtain inform world pure geometr descript featur detector inspect part content virtual imag movi textur sound object inform augment inform obtain virtual world altern approach meta inform meta inform ectiv search media content describ content featur media meta inform properti media object extract media object audio record inform singer conveni store meta principl imposs extract inform algorithm meta inform virtual environ addit descript inform describ content context world vrml node provid inform conceiv gener inform base user rate increment knowledg gather note problem virtual environ gener algorithm inform store geometr inform vrml le make world interest user interact facil provid navig behavior user interest static analysi virtual increment approach approach navig behavior individu user contribut call collect awar world record navig behavior user store featur world relev user user pro inform queri guid locat interest adapt environ present inform support inform retriev virtual question present inform user list altern user locat inform pattern list link inform sourc common search engin select link result port world inform locat web gener virtual world answer queri locat clear advantag gener world queri topolog properti world emploi sort inform criterion relev distinguish queri concern inform present queri concern relat world world access world queri queri concern materi li world request locat paint centuri paint rst case direct transfer locat interest provid locat resort gener world base inform found note approach extrem gener world base interest visitor start approach chosen present result amount inform present user overwhelm addit world desir guid agent show user inform relev transport user liter area interest agent augment inform user background prefer discuss avail virtual remark notion virtual world restrict virtual commun base commun server technolog distinguish educ environ environ er mixtur commerc entertain regard environ observ environ world interact facil gener navig problemat issu back question agent virtual list develop program research tackl issu involv dynam gener world virtual world gener base user pro inform correspond pro le accord style prefer user lack larg part due chat window properti word custom interact agent technolog contribut make conceiv user avatar made intellig augment featur make addit text balloon displai chat instrument custom interact experi show navig interact dicult averag simpli interfac complex counterpart aid user learn world helper agent show user interact manipul object place navig due inher visual complex virtual navig remain problemat issu fix viewpoint anim sucient direct user locat interest navig possibl augment intellig guid accompani visitor tour world autonom charact game wide accept develop comput game fuel develop techniqu comput control oppon present comput game consist basic logic enabl mimic complex behavior simpl comput control oppon charact simpli prede ned path eld sort simpl algorithm chase player recent comput develop realist virtual environ game place creat demand intellig behavior comput control inhabit game world autonom comput control charact autonom agent intend virtual realiti applic agent technolog game type game agent technolog game agent technolog appeal idea robocup initi agent technolog base intern soccer competit game arti cial life popular hype year ago recent hype game requir player support number virtual pet virtual pet view agent develop depend intern state interact complex kind agent interact stori type game user part stori user action uenc develop plot game put lot emphasi agent navig properli act realist system implement commun interact agent interact stori present interest applic agent technolog comput game concern virtual realiti person dedic game comput graphic game rule except realist behavior comput control charact import issu hand ight simul applic interest point popular game game virtual commun game classic game player walk virtual shoot oppon adventur solv puzzl recent game quak regard prime type game adventur plai regard restrict version onlin entertain sole intend player embodi humanoid avatar alien creatur player walk virtual virtual chat text make gestur interact environ includ abil manipul item push button gun entertain aspect world kill oppon avoid moral social interact evid import aspect world social structur rule behavior simpli di erent recogn repertoir interact appar advanc compar gener onlin commun web type agent excel virtual guid found game comput control charact guid player train teach player overcom obstacl expect actual game due repetit natur guid worth te consid agent interest kind comput control charact occur game consist comput control oppon vari monster encount adventur intellig limit attack player approach pose human oppon wider freedom action note comput control charact kind face problem agent onlin eld navig action comput control charact complex reason underli behavior split distinct step reason involv subgoal retriev object attack ee oppon plan rout world reach object navig plan account obstacl avoid threat reason iter mean time agent alter current object favor urgent chang action instanc agent attack oppon decid ee order surviv goal determin classic arti cial intellig problem techniqu develop hierarch approach case top level goal win game order achiev goal import subgoal kill oppon surviv exact predict made state world futur determin perfect action short term constantli reevalu due obviou ecienc reason implement fairli simpl rule rout plan complex issu fact virtual world numer constraint met make rout plan algorithm kind game complex instanc agent pass part world expect attack agent chase oppon rout expect destin ee oppon order set navig pose problem rout order reach locat travel world safe agent account physic limit instanc comput control charact pass wall addit make avoid shot possibl combin aim oppon navig diculti note obstacl avoid simpli predict action player taxonomi agent di erent aspect applic con gurat suggest di erent type web agent taxonomi web agent respect choic remark taxonomi bia agent virtual taxonomi valid respect servic gener dimens web agent type versu web agent awar ftp web agent awar virtual realiti protocol typic web agent provid inform retriev servic typic web agent guid visitor navig virtual environ client versu server client web agent client server web agent server side typic client web agent serv person inform assist typic server web agent serv web server er inform intellig singular versu multipl singl web agent interfac web multipl web agent interact di erent type web agent base consist complex lattic web agent shown figur top complex bottom dimens exhaust dimens versu combin base dimens versu gener base current taxonomi leav work dimens stationari agent execut agent platform begin execut mobil agent ts agent platform began execut subsequ transport agent figur lattic web agent taxonomi directli dimens speci es internet protocol agent awar dimens concern internet servic mode agent dimens decid agent commun languag function dimens directli relev cooper problem solv negoti discuss dimens domain seek taxonomi cover type agent agent client agent server singl agent multipl combin di erent type web agent suggest di erent type interact mode user web server discuss detail con gurat web shown figur agent part virtual realiti virtual commun interact multipl user agent user commun virtual realiti server web browser agent interact virtual realiti commun web user agent virtual embodi avatar discuss section section kind web agent great deal applic rang guid visitor inform retriev task navig virtual shop assist agent intellig agent multipl player comput game virtual realiti server web agent web agent web agent web browser user web browser user web browser user figur con gurat relationship server user shown figur agent serv server user directli commun intellig web agent locat server side agent regard portal server os access kind web agent intellig er creat person virtual environ base user queri request relat virtual realiti web user shown figur agent locat client serv user person inform assist virtual realiti server web agent web user commun server user web browser directli web agent user web agent omit gure reason type web agent chat agent serv intellig person assist user inform interfac intellig web agent con gurat shown figur similar kind web agent compon web server er user interfac navig applic serv intellig er intellig servic type web agent displai intellig behaviour internet mud virtual realiti server web agent web browser user web browser user web browser user figur con gurat virtual realiti server web browser user web agent web agent web browser user figur con gurat web server web agent web agent web agent web browser user web browser user web browser user figur con gurat simpli ed relat web compon situat shown figur agent similar type web agent serv person inform assist virtual environ restrict altern call intellig web server kind agent locat front end http server er user person messag serv ecient intellig support power infer engin con gurat analog shown figur power user interfac displai properti applic act internet chat agent user record analysi chat gather inform interact user agent request simpli call person assist relat server user analog situat shown figur manifest simplest form web lack facil interact web ful ll lot interest gather inform request research issu taxonomi outlin previou research issu involv develop person assist maintain electron archiv note applic rang agent applic mention applic end section primari requir ful ll summar autonom search capabl modi user present facil regard choic put support interfac embodi realiz singl agent system choic cation respect ort develop applic resourc deploi irrespect aspect plai role develop framework develop gener agent softwar compon user interfac compon manag agent commun primit agent commun posit applic lattic agent applic ect complex compon mention develop agent requir advanc interfac power commun primit deal complex involv develop rang agent aim provid support level softwar architectur architectur support agent applic includ program languag api applic framework distribut agent applic tool inform retriev manag order er agent metaphor guidelin develop deploi program languag support primit express reason domain context reason place ingredi logic outlin addit provid compon inform commun present agent chat avatar server world client eai figur agent platform agent virtual environ program languag core solv aim develop agent integr commun server compon inform inform web access commun structur commun event primari commun mechan adapt deleg issu compon build framework requir develop de nition extens api develop addit applic intercept event speci contact client gener vrml browser support share commun server platform point distinguish lattic agent locat ignor moment commun server platform er agent provid intellig servic figur summar agent framework interact platform concern agent act chat agent repres avatar world type agent requir extens agent api intellig facil aid user search navig user emploi chat interfac agent inform direct agent avatar space undertak instanc drop icon avatar agent live directli uenc modifi world hard suitabl form manifest text sound virtual broker show model bui support agent provid extend mechan addit applic intercept event gener addit event deploi agent visit virtual environ recal vrml er extern author interfac program vrml world java eai type platform lexicon search agent inform gather inform present inform navig broker agent figur demonstr agent technolog access agent includ provid function java agent deleg actual present inform gather agent resid browser demonstr agent virtual environ develop virtual environ challeng endeavor doom fail focu target applic demonstr deliv servic test practic conclud discuss research brie present list target applic serv agenda research figur present number applic virtual indic type agent indic part platform ect asterisk wildcard altern inform agent oper agent oper de ne broker servic visitor contact visitor choic agent lattic section conceiv provid navig rang altern limit case solut conceiv realiz target signi endeavor requir model servic provid servic platform seamless section strive realiz virtual mean structur present virtual world disrupt avail seamless integr intellig servic virtual world presupposit research goal paper present taxonomi agent web taxonomi gear agent virtual environ result taxonomi impli order conceiv agent dimens singl client resid taxonomi appli research issu cation target applic respect platform realiz intellig servic virtual commun server platform client refer alpha world america incorpor dynam goal intellig agent theoret practic issu lnai interact method techniqu adapt user model agent sourc book complet guid internet intranet agent broker creatur lab principl softwar fipa content languag foundat intellig physic situat approach implement charact comput game appli arti cial half life websit id softwar roadmap agent research autonom agent system human global interview ieee internet mud agent intellig ieee internet comput quak iii arena steer behavior autonom charact march robot world cup studio principl multimedia morgan ai agent virtual realiti world program intellig vr
DB/1342 3 queri format natur languag semant model statist keyword mean disambigu frank meng weslei chu comput scienc depart lo ca usa abstract paper describ natur languag interfac system base queri format capabl queri formul formul reli semant graph model data store natur languag interfac accept user input natur languag extract inform formul extract process perform keyword obtain semant graph keyword mean keyword mean disambigu statist approach involv compar vector contigu word text natur languag capabl captur lexic context natur languag interfac heavi grammar function interfac present paper portabl flexibl function feel interfac inform system inform system readili user introduct paper describ natur languag interfac system extens exist queri formul sql queri queri formul semant graph relat graph semant model underli formul valid sql queri incomplet inform user incomplet inform form inform reflect user intend queri casual user knowledg queri languag schema underli inform hard user suppli system interfac queri formul graphic interfac displai semant graph user attribut inform particip final queri paper describ natur languag interfac user suppli queri inform formul semant graph answer displai languag process oper valu formul queri voic keyboard input formul queri figur system diagram natur languag input goal natur languag process similar natur languag interfac extract inform user natur languag input feed inform formul process natur languag extract queri inform keyword statist keyword disambigu vector similar measur defin keyword word phrase hold mean domain keyword semant graph system determin keyword mean user mean user input determin mean keyword determin mean keyword keyword multipl mean domain due ambigu natur natur languag vector disambigu keyword mean contigu word natur languag vector summar lexic context keyword measur similar lexic context user input lexic context mean system determin keyword correspond mean figur show diagram system natur languag process compon text keyboard input speech input extract inform formul queri queri formul inform gener queri semant graph queri cooper relat answer return displai user link semant model natur languag discuss work statist method languag understand probabl comput larg corpu natur languag interfac system base syntact grammar semant grammar exampl pattern match system altern weather countri facil runwai airport aircraft runwai length storag area figur semant graph transport base system system templat match word phrase method process natur languag reli grammar knowledg carri overhead cost gather statist specif domain feel system fit applic carri overhead term sourc knowledg semant domain limit ontolog world wide web interfac domain limit ontolog semant graph queri formul research group develop method automat formul queri base incomplet inform user formul util semant graph describ object relationship object model semant graph consist link node object attribut featur link describ node relat figur show portion semant graph transport node semant graph repres rectangl attribut repres small circl link repres line node node attribut semant graph basi queri user input consist incomplet queri job formul gener valid queri base system user queri formul incomplet inform user form attribut link semant graph graph search gener valid queri defin formul input set incomplet queri select set queri constraint incomplet queri topic set subgraph semant graph chosen user compon final queri incomplet queri topic repres attribut link user part queri queri formul complet incomplet queri topic find set link node connect compon final connect subgraph repres specif topic queri call queri topic figur user familiar inform chosen node link connect join queri formul system capabl suppli join condit user base semant graph element chosen queri select list inform user system retriev answer queri select list sql queri constraint condit queri restrict answer retriev condit sql compon formul input formul produc valid queri subsequ section paper discuss formul input extract user input natur languag countri runwai runwai length figur queri topic find suitabl runwai aircraft natur languag process order process natur subset word phrase hold mean domain word phrase defin keyword user input sequenc word approxim mean mean keyword present sentenc perform natur languag process step user input system determin keyword system similar comparison vector determin mean keyword keyword inform mention user set keyword occur set mean keyword base keyword semant graph keyword valu keyword refer condit runwai weather condit airport transport order determin mean keyword lexic context user input statist method form vector comparison keyword mean disambigu appli keyword refer surround word context disambigu mean keyword cosin angl vector similar measur shown simpl effect section describ detail keyword acquir vector gener compar keyword queri word phrase mean word particip formul process queri keyword word phrase denot node attribut semant oper repres keyword categori system difficulti process natur languag input user intent express potenti ambigu indirect manner user intent clear user explicitli element particip final queri natur system extract inform user denot oper particip final queri node attribut semant graph uniqu identifi intern label schema intern label keyword written natur languag form semant graph domain expert attach multipl natur languag label node attribut descript natur natur languag label keyword system denot node attribut transport attribut intern length natur languag label system simpl pointer track natur languag label correspond node attribut valu constraint queri mention user natur languag input final queri relat attribut tabl set valu valu determin valu attribut constraint valu valid attribut attribut system keyword valu user queri feel attach natur languag label valu simpl pointer track valu correspond attribut compar oper queri constraint compar valu constant valu oper set natur languag label oper oper difficult handl valu natur languag label denot oper denot label depend context length denot height resolv problem richer set semant data type numer attribut unord valu equal common semant type height semant type set natur languag label standard oper includ transport attribut runwai length ft semant data type length solut forc user standard oper system design end tradeoff low overhead versu flexibl user note natur languag label correspond categori keyword keyword denot node runwai attribut runwai node airport system copi uniqu natur languag label multipl pointer oper correspond oper correspond keyword part keyword formal discuss section keyword transport user weather condit figur valu question keyword airport weather airport node condit attribut node incomplet queri topic formul input consist node weather airport attribut condit select list determin attribut mention user queri constraint section queri constraint determin result queri condit nm formul input gener part queri formal queri produc determin mean keyword trivial keyword oper defin function return categori keyword formal definit mean pair node attribut semant graph mean set defin mean set node semant set attribut semant return set natur languag label semant graph element return set valu attribut return set oper correspond attribut function oper valid attribut correspond attribut unord oper valid equat set mean keyword mean union node natur languag attribut natur languag valu oper keyword categori mean node keyword natur languag label mean categori attribut attribut keyword natur languag label keyword mean attribut correspond queri condit keyword correspond attribut countri nm final queri condit countri nm categori keyword repres mean attribut correspond queri condit keyword correspond attribut runwai length ft final queri condit runwai length ft mean system determin set pair km user input correspond keyword mention mean set km form refer keyword user input refer jth mean keyword keyword domain semant graph shown figur keyword correspond runwai countri mean set keyword mean keyword correspond oper full mean set process keyword determin mean set keyword user question fulli extract inform construct formul system determin mean mean mean set similar measur section vector captur lexic context provid lexic context measur keyword mean user input keyword mean depend lexic context word surround set contigu word section natur languag text rang length text black cat black cat basi statist keyword mean disambigu process set mean user input find mean match keyword context user input order list natur languag word wm set gener earli empir result shown captur lexic context degrad system perform vector trigram user input wm mean vector vm space set pair km extract user input km system determin rank measur mean measur similiar vector vector vm mean vector vm largest cosin measur rank highest cosin angl vector standard similar measur inform retriev field shown effect simpl continu previou determin mean keyword base past system retriev vector mean mean vector mean mean refer attribut vector airport nm similarli vector runwai nm countri nm attribut nm nm determin mean keyword context user airport runwai length vector user input gener cosin angl vector airport nm runwai nm countri nm calcul mean vector vm highest cosin chosen system mean keyword context work comput linguist statist languag understand word disambigu larg corpu keyword mean disambigu domain differ gener word disambigu problem user input short connect context result global context surround context word order disambigu keyword reason accuraci system group relat word perform syntact word phrase syntact structur group contigu word user function standard method word disambigu word measur likelihood word window word method perform type user input handl keyword mean harder distinguish question flight lo angel keyword lo angel york lo angel departur citi york arriv citi question flight york lo york departur citi lo angel arriv citi larg window surround word determin mean difficult determin differ window similar smaller window lexic context specif vector trigram lo uniqu trigram lo uniqu address issu concern process perform empir experi determin effect techniqu word phrasal colloc probabl determin select list select list formul input depend user return answer system handl type explicit select list implicit select list input explicit select list user explicitli specifi attribut return system exampl input includ weather condit runwai length runwai width airport input implicit select list includ airport sunni airport land input explicit select system heurist determin attribut belong select list system list attribut explicitli mention input attribut particip queri constraint automat put select list assumpt attribut queri constraint queri constraint valu retriev input implicit select list difficult handl clear inform expect user node semant graph kei attribut kei attribut uniqu identifi instanc node schema hold inform attribut kei node kei attribut node mention user input ad select list uniqu identifi return user inform user interest airport land keyword denot node airport semant graph input explicit select kei attribut node airport chosen attribut select list queri formul natur languag interfac recal input queri formul formul input consist incomplet queri select queri constraint incomplet queri topic determin node attribut mention user input valu oper construct queri constraint select list determin method previou section user input airport runwai length greater natur languag input correspond sql queri shown figur keyword spot user input involv match individu word subsequ word set natur languag label node attribut semant valu tabl oper specif user input keyword select runwai figur formul queri system determin mean set keyword mean function result mean set shown figur mean mean mean length mean length runwai runwai width mean length facil storag figur mean set notic keyword correspond numer attribut keyword correspond attribut mean set keyword set pair km gener set km distinct system assign rank measur cosin angl vector user input vector keyword mean vm vector similar measur assign mean highest rank mean keyword final mean keyword system gener formul input base inform extract user final mean keyword node attribut particip incomplet queri particip queri select list determin heurist mention section queri figur queri constraint correspond tion length ft nm assum vector similar measur rank mean length highest keyword mean length highest keyword keyword rank unambigu select list queri kei attribut node airport queri join condit runwai tabl airport suppli queri formul determin vector tradit statist languag statist gather train corpu languag similar languag system design handl system train order gather statist vector mean domain feel difficult obtain corpu natur languag question domain overhead port system avoid simpl method obtain data gather statist system time system user input vector ad mean vector vm keyword mean requir user correct mistak system made disambigu keyword mean feel clarif interfac clear simpl user interact system system present interpret queri user review form make form user form deem correct clarif form shown figur system displai user origin input displai relev inform style form user free chang element box keyword correspond countri user click box result menu attribut submit form keyword correct mean system gener set keyword user input produc vector pair system add mean vm updat statist time system obtain statist user interact advantag system accumul inform disadvantag accuraci system poor begin stage oper domain accuraci expect improv statist obtain area clarif dialogu gather statist system research countri submit runwai length airport runwai length greater runwai length runwai width countri airport storag area figur clarif user interfac develop natur languag queri formul methodolog base semant model semant inform keyword approxim mean user input keyword word phrase domain mean natur languag label node natur languag label attribut semant valu oper keyword system user natur languag system determin keyword present correspond compon semant oper statist method base vector disambigu keyword mean final mean keyword user input queri formul formal queri system grammar knowledg knowledg util system obtain system suitabl applic user input short support domain limit ontolog system portabl overhead move domain hard restrict user input feel advent inform system readili access gener inform sourc world wide portabl flexibl interfac system gather statist data research area interact user user correct mistak made system process keyword mean disambigu refer jame allen natur languag understand publish redwood natur languag interfac introduct journal natur languag eugen charniak statist languag learn mit peter chen english sentenc structur diagram inform weslei design implement acm sigmod page washington weslei hua michael chri larson scalabl extens cooper inform system journal intellig inform gari daniel jonathan develop natur languag interfac complex data acm transact gerard salton automat text process publish david waltz english languag question answer system larg relat commun wilk intellig analyz understand english commun wood semant quantif natur languag question answer advanc volum academ zhang interact queri formul techniqu phd lo
AI/1343 2 intellig support model peter januari submit biennial european confer artifici intellig brighton august artifici intellig applic institut edinburgh south bridg edinburgh unit kingdom fl abstract model integr model pertin aspect essenti manag chang integr view insight aspect effect specif aiai edinburgh ongo research programm ai techniqu cover requir model tool support ai techniqu aiai programm rang knowledg ontolog process model techniqu intellig workflow coordin technolog techniqu combin integr toolset deliv architectur part aiai programm project instrument determin requir model develop integr toolset support result project show combin task manag model directli control oper base result aiai project address coordin issu model support describ requir model enact gener discuss toolset design implement address requir evalu toolset describ extens undertaken page introduct model integr model pertin aspect essenti manag chang goal model view integr inform view basi integr view insight aspect effect specif aiai edinburgh aim provid integr set tool improv current level support model paper outlin kind support requir describ approach aiai develop support requir model order maintain view strong facil support requir detail ffl integr achiev relat inform obtain view relat task tool support establish connect tool ffl commun achiev peopl order ensur model share peopl ensur contribut common task inform tool perform task relev data pass ffl flexibl import adapt avail tool import flexibl enact process ensur peopl time effect give peopl choic ffl support provid care technic detail ensur flexibl result process carri effect bear issu aiai establish approach provid effect support model approach address strong model facil basi model support order make full task manag support integr tool requir requir area task integr detail requir model foremost requir model framework model determin inform captur inform express basic area kind model term common ontolog express page ontolog kei problem commun ensur agreement mean term part terminolog lead conflict ambigu resolv standard terminolog requir ontolog standard terminolog introduct field ontolog develop commit ontolog advantag term consist unambigu ontolog basi commun human agent softwar tool model ontolog aim cover specif term gener term gener term obtain full benefit ontolog import term defin context specif term ground gener term defin ai techniqu knowledg suit defin term relationship desir share ontolog differ terminolog develop reason remov differ lead difficulti express inform hinder process sake ontolog provid approach differ defin ontolog explicitli differ make translat set terminolog support commun model aspect environ cover model ffl structur ffl role held peopl ffl process carri ffl inform ffl flow inform ffl capabl requir ffl artifact produc ffl market oper ffl ai techniqu develop captur inform form model captur inform model document commun basi standard describ practic model varieti model techniqu requir order provid effect support problem requir model approach problem process model techniqu problem difficult describ page process model problem gener limit mean varieti model techniqu support describ aspect suit model techniqu requir base formal ground ontolog defin model creat content mean result model defin support model techniqu includ softwar tool captur model suitabl techniqu view share inform model type model captur full includ activ support oper ai techniqu type model model basi support system approach model techniqu type model establish relationship integr requir task manag captur inform model aim model real object obtain view develop understand oper import support model actual oper model document task peopl perform reflect model directli support task carri task manag altern inspect suitabl support form softwar tool made inform progress task provid monitor intellig workflow techniqu address issu task manag account peopl work achiev task task collabor effort individu interact complex support collabor work includ support commun coordin task advanc area intellig comput support cooper coordin technolog system advantag address issu task manag build pull effort put techniqu requir task manag advantag integr commun facil order provid support ensur flexibl achiev integr result requir integr tool varieti softwar tool support varieti task case tool solut problem integr limit number tool mean inform pass tool benefit support tool readili integr tool import aspect case tool directli support model case tool support oper addit integr tool advantag futur integr tool requir page flexibl framework integr handl current system develop field ai long concern integr softwar tool area system suitabl approach kind integr requir toolset model requir previou section address project project uk govern major initi promot base system support intellig system integr project number aiai lead project partner lloyd logica project decid concentr process model basic support model process model provid view enact run system develop support captur process model decid support integr tool chang tool framework architectur librari support addit tool tool style tool ad tool phase obsolet human agent involv system similar softwar agent provid support integr provid support enact process integr tool process model support enact enact progress shown altern line action manag task manag support recov failur task perform properli order achiev high level integr compon commun agreement term develop ontolog cover term requir talk includ inform capabl cover term talk busi environ system develop project toolset compon toolset ffl procedur builder captur process ffl agent toolkit agent ffl task manag enact ffl ontolog compon combin flexibl set tool work system figur show gener architectur compon toolset compon shown inform model data shown diamond user shown oval arrow show inform flow agent toolkit omit diagram page figur toolset architectur ontolog requir effect commun mechan achiev integr wide varieti independ develop tool terminolog lead conflict ambigu tool integr resolv develop ontolog set term frequent carefulli defin conform common usag concentr area activ market defin term term defin expect gener set term ontolog extend suit specif ontolog hierarch set includ relationship term term structur softwar system ontolog basi commun human softwar agent kei part ontolog hierarchi capabl basi task manag procedur builder procedur builder graphic tool describ record busi process model user build process diagram notat process flow network process descript captur method procedur builder user inform specif task capabl requir perform process input output specif process procedur builder ensur ontolog task manag repres process inform develop process model languag framework develop languag account emerg interchang format workflow applic programm interfac develop workflow manag coalit output procedur builder export directli task manag process enact agent toolkit architectur toolset investig varieti extern solut time page matur met requir develop solut support agent toolkit architectur toolset task manag softwar tool word legaci support process intellig agent technolog task manag layer control architectur user task guid agent commun task manag agent centr regist tool instruct perform result perform task agent toolkit support tool support approach exist softwar tool techniqu requir access tool sourc agent toolkit set tool interfac modul router assist process tim make connect exist softwar wrapper connect mechan agent toolkit tim standard facil requir mechan router connect wrapper agent network pass accept messag network control modul repres specif code specif make tool agent modul agent programm defin output tool process pass router commun task manag definit provid messag receiv task manag line emerg agent commun languag support kqml queri manipul languag messag express kif interchang format ontolog agent registr tool make agent detail capabl architectur agent ad remov toolset style task manag task manag interfac user toolset directli support user perform current task task manag techniqu intellig workflow plan user task agent inform task process model procedur inform agent agent regist agent identifi suitabl agent account agent time suitabl agent assess capabl requir task capabl agent ontolog task manag reason capabl relat capabl match requir close task manag handl output gener task store output inform pass task requir inform inform express term task manag knowledg inform relat inform knowledg provid intellig support inform manag task manag monitor progress task track task progress support process diagram captur procedur builder amount support task manag user page flexibl adjust user advic basi task readi execut recent complet task manag user recov determin altern rout action task manag effect put extra layer control top agent servic coordin agent level user task user particip task user engag evalu project approach project prove toolset implement demonstr built illustr advanc made result project show integr toolset provid suitabl support model support manag chang advanc main area work ffl procedur builder advanc earlier softwar captur captur export model form enact ffl task manag integr process model pass inform task unlik agent system put extra layer control top agent servic user particip coordin task user engag user chanc make effect flexibl provid technolog task manag workflow support system flexibl intellig support level user task intent pass set sequenc event ffl develop ontolog easi final result project develop method build ontolog ontolog distinct ontolog inform attempt broad coverag includ term import limit area exist form carefulli prepar natur languag glossari formal languag ontolog glean scatter exist formal languag inaccess reader major strength toolset process model built busi activ modif enact process step process link directli tool requir perform enabl suitabl tool support busi process toolset process illustr progress process enact major issu address project issu cooper realist busi environ task carri individu contribut task task manag toolset account singl user commun task manag enact peopl brought human treat user equal user issu address project issu model task manag support process model page basi task manag outlin section approach problem case inform model provid suitabl support start made issu develop public demonstr approach task manag specif problem provid approach alongsid extend toolset spite work carri project valuabl step support model result project encourag section outlin extens requir address issu coordin coordin task toolset extend coordin technolog provid support multipl user aiai involv task base process manag project investig coordin technolog support model project fund epsrc programm system engin busi process chang collabor aiai chemic engin depart project industri input bg provid support task coordin model lead requir tool integr commun task manag facil model requir task support simpler cooper work coordin requir real model peopl capabl model structur structur role peopl structur import type interact peopl engag kind relationship exist peopl relev tempor aspect task import peopl work concept author consid capabl concept lead richer model task manag environ lead power support model give issu involv discuss issu current capabl specif attach process function orient task perform human addit capabl attribut desir al categori role unit defin capabl person order perform task qualif similar current capabl specif current capabl specif perform task softwar agent select capabl includ unit widen specif person qualiti assur senior softwar address issu coordin concept deleg task import deleg weakest form deleg offer task set individu capabl perform individu voluntarili accept deleg task assign individu oblig perform page support tempor aspect peopl work construct requir remind issu express term time person process remind time interv amount time pass individu task inform person complet deleg task construct ad model facil ground ontolog construct effect mean construct part ontolog ad specif mean relat term ontolog ad coordin task manag requir sophist criteria select agent task aspect capabl commun detail suffici determin agent perform author consid task manag work basi strict agent accept deleg task mean commun task manag enhanc effect ad coordin facil visibl task manag aspect model type interact includ deleg type constraint requir author remind aspect progress problem dealt process start view current state task requir develop support requir coordin advanc field advantag chief field comput support cooper process model workflow workflow manag system ai techniqu suit requir model project shown ai provid integr toolset task manag facil valid approach approach extens facil coordin task approach task manag ad refer knowledg base techniqu flexibl workflow manag data knowledg don rich fritzson overview knowledg queri manipul languag technic kqml advisori march fraser manag chang model applic innov expert system ii decemb page genesereth fike knowledg interchang version refer manual technic report comput scienc stanford june genesereth ketchpel softwar member work group process interchang format framework version technic mit center coordin scienc work paper aiai process descript captur method report technic air forc system air forc intellig system bid manag intern journal project busi risk uschold king methodolog build ontolog technic report ai applic present workshop basic ontolog issu knowledg share held conjunct montreal ontolog world wide web url uschold method applic knowledg engin aiai world wide web site url workflow refer model technic report workflow manag
DB/1344 3 transact coordin agent composit system schek alonso institut inform system swiss feder institut technolog eth switzerland intern engin applic symposium august abstract composit system collect distribut softwar applic data depend continu violat local oper coordin process correct consist coordin process endow form execut requir particip subsystem function atom local oper defer function present applic implement transact coordin agent coupl applic discuss requir met applic transact coordin agent identifi minim set function applic provid order particip transact coordin process discuss miss function ad arbitrari applic transact coordin agent identifi structur gener transact coordin agent provid implement transact coordin agent tailor sap introduct coordin track depend subsystem environ involv autonom subsystem local oper perform user necessarili awar violat consist introduc part work fund swiss nation scienc foundat project wise base internet swiss prioriti programm commun data depend make disappear fundament aspect track depend reestablish consist subsystem involv depend arbitrarili suggest coordin process transact execut coordin process crucial transact execut includ correct case failur partial altern concurr process access share resourc previou elabor correct criteria transact coordin process identifi prerequisit met underli subsystem order support transact coordin coordin process reli underli subsystem provid kei transact function present deal manag system arbitrari applic function provid top subsystem transact coordin agent main contribut paper detail discuss architectur principl gener function provid basic prerequisit support endeavor present implement issu transact coordin select applic system paper structur section summar transact process manag motiv process base coordin approach scenario section present function transact coordin process discuss detail provid section implement sap applic system wide busi manag present section relat work section final conclud paper document agent agent busi app busi dbm product repositori system document applic program agent agent test norm data test norm agent cad construct coordin process transact prog rep agent transact product repositori agent coordin agent cad system cad program test technic document cad document human resourc write write part construct process process product underli subsystem coordin produc shipment perform activ local process coordin initi figur transact coordin process cim environ transact coordin present sampl applic coordin composit system transact process motiv necess transact coordin agent support endeavor order ensur readabl independ previou summar main idea aspect transact process manag motiv comput integr manufactur environ varieti special applic comput aid design product data manag busi applic system sap execut shown figur common process defin construct process trigger local cad construct bill materi product start product follow techniqu aim custom product deliv develop product manufactur strongli ti process run varieti shown figur construct process develop step design part final test subsequ technic document encompass cad product data manag system test reflect practic industri partner recent conclud research project technic document repositori product process includ manufactur step order materi product floor includ schedul creation numer control program process act core busi logic basi coordin subsystem involv due complex depend subsystem inher heterogen composit gener coordin realiz distribut transact top applic execut process support system act coordin provid flexibl requir coordin failur singl activ necessarili lead failur coordin effort possibl execut altern case failur import characterist process exploit coordin approach show benefit transact coordin process requir subsystem coordin interact support execut coordin interact underli applic local subsystem monitor identifi activ violat depend local activ execut cad system monitor order trigger construct process enact coordin process requir trigger activ underli instanc concurr local activ subsystem exist correct coordin process correct point failur occur concurr coordin process termin consist state assum failur construct process cad construct system creat busi applic system inconsist state due miss busi respect part produc atom activ activ execut coordin atom execut complet order avoid situat coordin process end inconsist state due undefin outcom activ subsystem activ correct easi enforc underli system offer function activ semant successfulli execut respect subsystem exploit coordin deal failur occur process enact activ construct process fail order avoid activ busi applic system system mechan easi complex object repres delet system restor consist activ product process busi applic system unlik system action undon part rollback coordin process semant termin provid subsystem activ process failur occur test newli design product fail delet activ wise work cad construct construct step remov occur document depict figur behavior captur replac atom coordin process notion termin process reach consist state termin order preserv consist interact coordin process product process run parallel construct process order minim delai activ arbitrari interleav process avoid coordin easili establish interleav order oper order respect underli system enforc order preserv execut subsystem parallel match coordin commit defer interact process close watch activ undon execut construct process succe failur lead activ invalid data product built sever inconsist system valid construct part exist commit activ defer avoid incorrect interleav concurr process resolv activ effect subsequ activ process correct execut activ product process failur shipment instanc due temporari broken network connect busi applic manag relev custom address previou activ product process end inconsist state activ process activ invok repeatedli succe recoveri network custom address transact process manag notion transact process manag suggest mean coordin subsystem main compon transact process manag consist coordin act top level schedul transact coordin agent particip act lower level schedul depict figur coordin process encompass activ invoc subsystem schedul coordin activ differ term termin pivot flex transact model local activ directli execut local user subsystem gener coordin coordin task execut transact process order reestablish consist violat local activ case failur concurr access share coordin provid execut process execut includ gener notion atom standard semant realiz partial altern execut correct parallel concurr process requir paper continu work present respect coordin start previou work provis execut transact process elabor correct detail found correct criterion address concurr control recoveri simultan special structur found transact process high parallel appli idea composit system theori import understand kei aspect transact process coordin act kind transact schedul gener tradit schedul semant commut properti activ altern execut path case failur base coordin ensur global correct assumpt activ coordin provid requir function discuss section function requir underli subsystem expect subsystem order deploi coordin transact coordin agent top subsystem depict figur subsystem treat transact coordin agent identifi function requir appli correct transact process manag respect pred criterion discuss local notion oper oper execut underli data sourc subsystem part activ vide identifi requisit applic meet order implement miss function atom activ requir provis termin singl transact coordin gener notion semant defer commit order preserv requir order support correct concurr control transact coordin process approach support requir properti discuss note close relat singl featur underli system implement enforc properti atom activ local execut failur occur site applic failur lead undefin state part activ execut order avoid undefin activ execut atom execut complet fail activ leav atom ensur exist possibl task subsystem atom directli provid respect subsystem case dbmss applic support notion transact sap provid atom servic invoc work subsystem support prerequisit met order provid atom activ execut subsystem provid inform execut fail activ failur requir interfac coordin agent undo effect fail activ log trace file applic singl oper execut data element activ record oper make persist applic base relat persist log sql statement perform activ specif trace file failur undo oper execut commit oper log file base engin applic similar trace record execut file oper requir base observ interact applic place api busi logic applic map underli data sourc perform integr check applic level oper execut directli dbm level data level awar unknown lead violat constraint due inher complex applic case determin oper data sourc level schema underli dbm total unknown activ special solut provid atom implement underli applic system perform kind version manag local oper fail activ previou version recov activ semant undon execut correctli failur occur enact coordin backward recoveri activ previou activ order perform recoveri approach determin activ exist registr activ semant activ defin undo approach limit execut undo oper underli relat dbm sap tabl reason applic semant oper monitor dbm level busi logic map direct access sap dbm dramat consequ system consist similar semant undo oper exploit model subtransact gener transact process flex transact model activ exist subsystem integr transact coordin process activ regist activ store persist initi activ manag metadata log requir dbm activ perform log order provid inform subsequ invoc activ cim section activ system log persist object creat order determin regist inform delet correct registr approach implement sap section undo applic log file trace oper execut activ inform exploit success singl oper perform activ mean undo oper undo oper subsystem api previou version fall categori activ coordin process termin backward recoveri success execut activ longer support termin properti coordin ensur activ activ termin successfulli temporari failur consid due network problem activ execut repeatedli final succe properti activ succe arbitrari number invoc subsum notion borrow flex transact model requir support activ directli met applic subsystem activ termin successfulli failur occur invoc intercept persist subsystem support persist queu ti lost network failur activ repeatedli invok put applic persist queue subsystem activ invok repeatedli identifi execut exploit properti sap transact remot function call repeat persist queu mechan provid execut activ repeatedli succe effect fail activ undon schedul time commit defer execut transact coordin process consist interact process case activ problem cim present section depend construct product process execut parallel activ commit termin construct process inconsist recoveri construct process requir perform defer commit local subsystem support phase commit protocol provid function emul block process subsystem commit activ defer safe proce strongest requir support xa interfac distribut transact process standard function phase commit protocol commit activ process subsystem commit successfulli global commit determin coordin defer restrict correct criterion transact coordin agent subsystem directli support xa interfac provid strict schedul function ad agent method block restrict execut activ trivial achiev block process activ schedul achiev lead worst case serial coordin process feasibl solut defer commit strongest prerequisit note met activ order preserv concurr process access share conflict activ process occur activ process conflict order execut return valu order execut coordin conflict activ order coordin order borrow composit system theori simpli requir serial order parallel activ contradict weak order weak order conflict activ parallel execut long result activ execut sequenti weak conflict order appli directli transform sequenti order weakli order ideal subsystem directli support weakli order execut conflict activ dbm protocol ideal subsystem directli pass conflict activ subsystem commit order deriv weak conflict order sequenti sequenti execut weakli order activ enforc act primit schedul invok conflict activ sequenti strict schedul system implement strict phase lock protocol dbmss applic system support lock function sap request lock defin applic base cad transform weak order sequenti parallel applic order preserv restrict properti provid subsystem sequenti execut suffic correct underli applic local concurr autonomi subsystem coordin import issu local user awar depend exist coordin perform kind activ exist subsystem lead local activ execut local user subsystem gui api activ global activ schedul coordin execut api subsystem concurr control coordin local concurr subsystem consid support global local subsystem provid function subsystem support multipl parallel connect requir weak conflict order addit local user work concurr activ execut sequenti connect subsystem api suffici subsystem provid limit form concurr control order avoid local global activ execut object simultan mechan sophist lock correct presenc local global activ coordin local coordin coordin notifi local correct establish weak order global activ local activ subsystem enforc weak order coordin awar local correct enforc serial global local activ commit global activ defer local activ isol global activ block correct local global activ local commit global activ defer commit transact coordin process restrict solut elementari prerequisit subsystem interact subsystem function provid top provid basic function interact underli applic coordin process initi local activ violat global constraint introduc perform monitor detect local activ order particip transact process subsystem support monitor task provid inform exploit discuss section subsystem provid api offer activ coordin process monitor support subsystem activ passiv activ passiv approach consid activ support provid activ support activ monitor applic subsystem provid possibl pass control call interfac trigger mechan custom applic logic sap mechan appli local filter affect global consist local oper mechan enabl notifi forward notif coordin control pass local activ termin mechan defer commit local activ safe termin base strongest activ monitor approach suit coordin full semant activ observ passiv passiv monitor prerequisit applic system perform underli data sourc detect compar current snapshot data sourc previou version schedul commun coordin execut monitor subsystem coordin agent transact figur structur gener exploit inform log file trace file asynchron passiv monitor semant activ underli data sourc captur approach suit applic simpl schemata structur gener respect function provid modul gener identifi monitor execut monitor monitor modul cover extract local oper underli applic exist interfac trigger mechan subsystem monitor modul tailor subsystem execut activ coordin map local oper interfac exploit execut modul tailor underli subsystem true invoc subsystem oper provis atom undo effect fail activ schedul schedul local oper respect activ coordin perform schedul modul includ preserv order provis local avail eventu defer local commit dbm persist log activ execut subsystem paramet storag metadata activ regist configur underli subsystem base access separ dbm made commun common commun protocol support interact coordin analysi subsystem properti discuss previou section summar tabl properti ideal subsystem point view requir transact process manag minim set properti met subsystem list basic properti requir enhanc subsystem function particip transact coordin process transact coordin agent sap sap commonli applic system busi manag consist special modul applic area product human resourc plai import role cim area present section system built architectur base relat dbm proof concept idea present transact coordin agent sap implement architectur depict figur agent specif part color light grai standard sap system depict white color tightli integr core system underli manag metadata access standard dbm interfac sap sap gener natur support execut arbitrari function sap complet workflow process system kernel sap workflow process function workflow execut gener simpli pass paramet meta process describ requir function identifi section implement sap agent ideal subsystem basic requir atom atom provid activ subsystem log oper api activ provid subsystem log oper registr configur undo api persist queue activ lead atom activ lead success provid commit support protocol activ defer strict schedul order support execut coordin preserv concurr multipl connect connect concurr local global activ rect concurr local global activ execut activ coordin activ subsystem api subsystem api monitor pass control filter perform pass control activ subsystem special passiv monitor tabl summari subsystem properti met transact coordin process interact commun coordin place exploit remot function call sap set librari function support multipl parallel call function extern applic call extern applic system sap gatewai commun modul librari thin softwar layer transform request coordin rfc call vice versa execut meta workflow call specif function process execut order support monitor transact relev coordin invok local user slightli modifi ad rfc call coordin perform synchron asynchron custom sourc transact atom sap support notion transact acid properti singl function execut activ atom complet workflow process failur handl mechan implement process rollback case failur order provid requir semant activ sap implement remot procedur call busi applic program gener program languag greatest part system small kernel implement meta workflow encompass function process execut idea explicit registr essenti advantag sap instanc workflow process paramet store persist underli dbm addit effort log paramet activ execut coordin activ function workflow meta workflow execut meta process perform idl consum resourc case coordin determin necess intern event sap gener rfc librari call activ meta execut explicitli requir paramet longer meta process termin order preserv requir order preserv met system execut transact respect weak conflict order support applic object updat gener lock transact conflict transact serial commit order requir activ achiev exploit sap transact remot function call mechan rfc librari sap sap gatewai meta transact comp workflow agent metadata coordin local user sap gui rfc rfc librari adapt sap figur sap adapt request identifi invoc activ perform id system execut multipli invok commit defer defer commit respect protocol extern rfc call rfc call restrict provid activ relat work term agent frequent varieti context formal reli definit agent persist compon commun definit gener subsum direct special agent technolog agent mobil reason compon agent abil act perceiv agent interact environ protocol kqml develop strong research direct agent technolog agent facilit complex system focu queri process execut endeavor agent model resourc common ontolog semant integr local model made agent form basi negoti agent integr model semant higher level abstract schema integr feder manag system individu model relat incompat resolv achiev base abil agent commun kind agent technolog exploit concept mediat wrapper applic agent defin workflow refer model workflow manag coalit similar provis common interfac top heterogen subsystem fundament task coordin agent provid schema integr scope paper concentr provis function directli support underli applic similar phase commit agent feder manag system provid function atom commit discuss necess transact coordin agent order enforc consist composit system consist distribut applic coordin perform base process defin top applic system support execut coordin underli applic requir provid transact function system meet requir enhanc provid miss function base correct criterion transact process elabor part previou identifi properti provid applic point view coordin minim set properti applic order implement miss function discuss subsystem properti enhanc detail classif inform order determin transact coordin process composit system applic appli function requir built sap present implement applic area comput integr manufactur transact coordin approach addit cim scenario discuss appli geograph inform system futur appli coordin approach wise project eth zurich applic area electron commerc refer schek correct parallel composit system acm symposium principl system busi busi proc int workshop research issu data engin mar distribut process system applic proc vldb aug alonso mohan workflow gener distribut process chapter kluwer academ goodman model concurr nest transact system journal apr goodman concurr control recoveri system sap technolog al heterogen multimedia inform garlic approach int workshop research issu data engin mar chen dayal transact nest process manag system proc int confer data engin page softwar gmbh rel mckai kqml agent commun languag intern confer inform knowledg manag page nov al tsimmi approach data model languag intern workshop gener inform technolog system acm sigmod genesereth ketchpel softwar agent commun juli grai reuter transact concept techniqu morgan workflow manag workflow refer model workflow manag dec document huhn singh agent multiag approach chapter page morgan huhn editor read agent morgan kaufman global inform manag local autonom agent page morgan jajodia editor advanc transact model architectur korth transact model system int confer distribut comput system page june cim coordin int confer data knowledg parametr technolog usa user schek export function concert ieee data engin special issu sap ag sap onlin transact heterogen feder system phd swiss feder institut technolog german ye unifi theori concurr control recoveri acm symposium principl system page june schek concurr control recoveri transact process manag acm symposium principl system coordin bring function applic system proc european concurr engin confer apr design develop coordin agent integr sap workflow process diploma research institut inform eth juli german sheth larson feder system manag autonom acm comp wiederhold mediat architectur futur inform system ieee agent achiev serializ presenc failur heterogen proc ieee page mar technolog coordin cim subsystem phd swiss feder institut technolog ensur relax atom flexibl transact system acm sigmod page
Agents/1345 1 knowledg system laboratori decemb report ksl synthet actor flexibl person daniel barbara knowledg system laboratori depart comput scienc stanford california abstract provid synthet agent intellig actor behavior interact environ detail human behavior base direct user person charact portrai model enabl author defin charact person influenc mood interperson relationship exampl charact experi show model exploit synthet actor produc perform synthet entertain introduct person set psycholog trait distinguish individu behavior al trait easili recogn peopl commonli term psycholog trait person dynam person lead charact select perform action charact shy dynam charact activ lazi artist creation person defin charact interest charact behav adequ plot provok good reaction audienc entertain bore charact provok audienc stori essenti author scenario configur trait elicit emot peopl movi actor give life person creat author perform relev action accord scenario direct receiv good actor creat commun believ person perform role creat person role bodi voic charact shown stage synthesi person creat author shape actor person work virtual theater project base form theater actor spontan cooper gener stori charact perform time constraint direct sourc abstract scenario actor detail case convent actor respect director demand provid synthet agent intellig actor behavior detail human van gent actor action build block construct stori plai interact direct receiv constraint behavior interact user order creat stori time give perform consecut perform actor scenario synthet actor show perform anim text synthet actor autonom user avatar autonom actor receiv direct scenario decid behavior virtual stage respect direct classic mode call direct al practic italian subsequ adapt theater compass citi chicago avatar larg direct user select action receiv direct scenario actor type actor behavior person charact portrai direct receiv avatar told user walk walk walk chosen avatar express charact person trait energet charact rush lazi shuffl model charact portrai synthet actor model enabl author applic defin charact person flexibl account mood interperson relationship reilli bate make perform believ emot social aspect flexibl person import featur synthet actor current person trait select action perform model definit person trait independ mood relationship remaind paper structur section review work person make agent believ interact environ describ basic compon synthet actor section section present basic compon model explain compon defin charact section explain model synthet actor section describ applic test model present result experi discuss result section relat work research scholar work softwar agent interact environ approach requir plan agent action select mechan base person emot oz project al real project believ agent interact environ bate student introduc term believ agent commun mean viewer user suspend feel charact real bate claim person emot import aspect believ add social behavior bate reilli exploit behavior featur express person trait model emot base al modul synthet charact behavior interact environ natur languag anim assum individu behav differ emot state interperson feel emot similar situat current behavior featur project person julia charact oper virtual realiti system interact coher peopl julia limit model believ person make behav human express emot rizzo al built elabor person model inspir approach polit system trait base deviat social norm goal tree schank abelson taxonomi abelson ambiti individu consid acquisit goal statu knowledg import averag preserv goal relat peopl import applic domain virtual environ believ agent interact human user modal project emot aliv project mit explor potenti entertain virtual environ wireless interact human particip virtual world inhabit anim autonom agent shown peopl enjoi softwar charact express emot motiv behavior person main interest project elliot intellig agent commun emot user multimedia environ agent base affect set program embodi theori emot ortoni al disposit person characterist influenc emot commun agent facial express research approach softwar agent walker al develop linguist style model lifelik comput charact gener speech act charact speech act linguist style person team work speech act hovi work linguist stylist rhetor goal express person natur languag gener system call stylist rhetor goal enabl agent thing differ person circumst produc virtual actor virtual realiti world virtual actor perform script role respect metaphor comput theater laurel model interfac agent dramat familiar dramat charact structur thought bodi theori methodolog place creat virtual actor concern portrai person charact cast relationship charact emot big issu virtual unlik synthet reli emot act gener believ descript synthet actor virtual synthet actor perform script detail perform base role portrai actor exploit model integr person attitud interperson relationship present describ synthet actor section synthet actor mind figur show mind comput program agent architectur updat actor knowledg base perceptu input control order bodi perform action modifi virtual world program call displai text anim screen show user action perform actor enabl actor perceiv event screen interfac enabl user perceiv chang virtual world interfac mediat interact mind bodi avatar user interfac menu present set action current direct user autonom actor interfac mind interfac user interfac bodi user virtual world synthet actor figur architectur synthet actor actor mind initi data creat author user inform model charact person mood attitud defin hierarchi action definit term person set state machin state perform context virtual world actor evolv defin term script actor appli perform action follow reaction action perform actor describ model explain role reaction action perform actor give inform knowledg structur reader understand synthet actor work action set relev condit fulfil class event condit actor instanti action current situat action annot typic valu person trait defin person charact annot compar charact trait time select action relev behavior figur show action definit sit stand sit stand differ respect person trait stand stand na na na intern na na sit sit na na na intern na na na stand slowli na stand na na na stand quickli na stand na na na sit na sit na na na sit na sit na na na fall chair na sit na na figur action definit action definit label format number row action menu shown user mean action text descript text menu identifi typic valu person trait person numer interv transit type result action perform appli state action speech object script perform action leaf hierarchi action paramet actor choic action respect direct receiv actor user avatar sit avatar wai sit fall chair sit rate differ term person trait actor action closest person charact portrai commun choic decid perform action screen text act sit textual wai sit sit sit state machin defin actor state transit state actor sit stand sit walk stand walk exampl action enabl transit synthet actor state machin aspect scenario state machin concern charact interact charact set irrelev action state time select actor discard irrelev action state effect current context behavior action relev transit state record actor script seri abstract direct synthet command perform action abstract direct action actor move sit command recogn inform obtain actor displai relev action text anim figur anim kind command defin displai actor sit stand autonom actor iter step al incorpor perceptu inform bodi current situat model state identifi behavior relev current direct current current rate relev action respect portrai charact person action match person perform chosen behavior send command bodi avatar ident send list identifi wait select user user select avatar instanti action compat behavior rate describ synthet actor select present model actor explain determin valu person trait rate select action descript model distinguish person attitud assum charact virtual theater applic essenti social individu emot describ compon model explain enabl specif charact psycholog social level person trait pattern behavior mode determin person adjust environ al chang time person depend individu assert person trait recogniz individu make person act differ mood correspond emot happi sensat physic hunger thirst emot trigger event sensat variabl time divid mood mood pride direct individu anger direct individu relationship charact distinct mood individu feel charact gener charact happi remain angri charact charact attitud interperson relationship rousseau vari depend natur relationship correspond essenc distinguish mood exampl attitud includ trust design person mood attitud defin psycholog social aspect claim set import compon defin connect compon make charact interest believ compon defin definit person person studi psychologist interest behavior mental process al psychologist behavior pattern individu order explain peopl react differ environ numer psycholog person theori uniqu distinct qualiti individu person model base type trait theori social learn theori trait theori assum individu person profil term set psycholog trait influenc behavior trait quantifi continu dimens scale scale person profil predict futur behavior waiter presenc custom theori person trait accept meyer number ident basic trait trait assum trait peopl behav matter situat social learn assum person modifi situat view learn experi observ reinforc person behavior vari depend specif characterist situat interact individu situat reinforc histori waiter shy men past quantif trait integ interv trait level activ charact lazi energet defin person type psycholog theori slight differ attribut default person trait correspond gener behavior psycholog trait theori default knowledg charact friendli fix default charact person trait correl compon knowledg real multipli give trait person trait correl vari compon model level confid statu current context composit level friendli default correl valu trait gener behavior default add specif circumst charact behavior respect social learn theori knowledg integ order situat trait import situat test appli person trait mood condit satisfi current person trait directli calcul multipli trait mood correl factor correl factor real anger anger structur identifi default level friendli specif situat anger influenc charact friendli tabl exampl valu anger friendli structur anger friendli tabl valu friendli versu anger definit mood person mood quantifi integ interv vari time charact interact initi mood knowledg charact happi neg charact sad mood individu charact interact initi mood defin charact angri grate otto express actor decid mood appli import mood correl person trait situat trait identifi type situat charact group design calcul differ global agentori mood influenc person trait defin charact angri behav charact react peopl angri defin calcul global mood knowledg highest lowest mood agent patient action knowledg structur anger charact tabl global depend paramet situat charact jim definit attitud attitud assign initi combin knowledg charact global averag highest target lowest lowest highest otto tabl exampl global valu mood structur charact call structur jim love trust complet dislik trust attitud correl person trait part situat influenc trait import charact agent charact global calcul determin correl trait design charact behav differ group defin calcul knowledg member group method calcul method fix tabl global jim otto otto wai calcul global jim friendli correl factor friendli circumst half global charact global averag otto highest otto lowest otto otto tabl exampl global valu model synthet actor begin session virtual theater actor initi valu attitud person determin social situat charact calcul current attitud mood base social determin current person normal distribut standard deviat trait effect correl default attitud recalcul heurist time compon depend chang trait correl mood recalcul mood modifi mood attitud chang perform action charact synthet actor emploi list reaction actor action modifi charact mood attitud agent lower anger level unit insult charact global valu attitud mood recalcul time social situat frequent modif introduc variat actor select behavior action rate respect person trait section person trait import action associ weight person trait smile reflect confid weight friendli weight trait import weight actor rate action relev situat compar person profil charact person trait select action reflect trait order action rate action trait person differ current charact add differ weight action lowest rate tabl give synthet actor rate action charact level confid level friendli select case action confid confid weight friendli friendli weight rate tabl exampl action rate person trait good indic charact behavior behavior consist person add flexibl synthet actor order give broader rang behavior context actor rigid predict behavior predict prevent user enjoi interact interact actor possibl slightli chang behavior ident context violat charact person probabl order add variat actor behavior assum actor behav normal distribut center averag calcul context time actor choic compar averag trait current lower higher person trait averag standard deviat actor evalu action valu design charact variabl person trait valu standard mean slight great variat level confid vari averag test model applic virtual theater call autonom actor avatar autonom actor portrai waiter call custom call jim avatar user plai role custom call user direct avatar select button action perform current context action perform actor text window scenario explor sit tabl otto bar jim enter sit jim sit jim jim call waiter order drink otto order drink short interact otto back drink jim jim answer end scenario defin trait defin charact specifi individu domin nervou charact energet show individu natur nice hostil compon person trait mood happi denot mood anger denot attitud attract statu defin ten person appli charact person english defin model trait depend compon rude nasti low level matter situat trait depend compon hostil quickli low threshold anger reach person experi rude nice show friendli confid show high high level low level chang aggress friendli peopl nasti peopl react strongli verbal attack figur show definit person model level friendli posit default neg quickli level anger neg confid activ trait default valu person trait standard deviat mood mood attitud relat relationship default person trait situat person trait situat mood attitud group situat figur definit waiter figur show interact jim otto friendli figur show interact jim dynam otto lazi otto click tongu jim gracefulli confid tabl jim sit jim sit gracefulli jim stare otto jim otto move sing happi song smile polit jim bring beer leav im bring thing otto ill back order walk bar smile face jim im jim nice otto tabl smile face gracefulli put glass tabl nice otto move bar pleasant gait jim figur interact involv nasti shy friendli otto experi result social scientist reev nass shown peopl treat human comput screen treat peopl kind behavior upset peopl make angri interact comput experi show sophist agent trigger social user synthet actor exploit model portrai goal social scientist actor interact obtain social give perform entertain characterist import system sustain interest movi plai otto wait jim quickli walk dash tabl jim share tabl jim sit dont make wait jim otto jim servic otto leisur tabl red ey jim bring cup thing im otto im pretti busi ill back point bar im wait jim jim im happi meet jim otto tabl hold glass lazili put tabl dont call rest otto rest move bar gait arriv pretti jim cross arm front jim im polic offic question figur interact involv confid dynam lazi otto charact autonom otto ten person run experi user test show model enabl synthet actor give perform desir characterist show actor express person depend mood recogniz user behavior experi synthet actor behavior set initi valu charact mood attitud set standard deviat person trait altern assign jim person system ten time person nasti waiter friendli friendli waiter nasti shy waiter confid confid waiter shy lazi waiter dynam avatar system fifti time nasti fifti time friendli jim behavior interact jim behavior consist variat behavior repeat procedur seri ten interact person standard variat check larger variat jim expect jim behav expect seri ten experi desir person predomin nasti jim time friendli polit polit shy confid dynam lazi seri situat jim show expect characterist predomin desir possibl charact show compat person variat jim behavior standard deviat variat jim rude time interact nasti otto friendli sd time sd jim dynam humor rude confid otto shy sd show rude sd jim show expect characterist time sd time sd jim show predomin characterist sd sd person defin independ mood attitud select reactiv jim verifi model work person defin depend mood attitud initi jim mood attitud jim angri grate jim angri otto dislik grate jim angri dislik grate otto combin initi attitud ran ten time pair charact experi behavior jim session jim show anger time angri charact charact nasti show anger initi angri friendli otto time make reactiv jim show anger otto time explain lower threshold fix reactiv person express anger select jim show anger nasti show anger time nasti show energi consist jim show anger nasti otto charact perform upset action conclud model enabl synthet actor select behavior consist person charact portrai recogniz believ variat show valu person trait influenc mood attitud user test complement experi run batteri test user prepar experi build set charact assign person previou section charact set set otto jim nasti set otto jim confid set reactiv angri otto angri jim hate otto peopl visit custom answer set question user visit set charact user women men twenti thirti told role charact identifi person charact describ end session question percept experi group question identif believ reaction potenti entertain question end session group question session complet identif person describ person charact decid question user describ person order influenc percept person person identifi correctli user session rude make scenario otto initi angri jim person identifi user case session dynam identifi user util term dynam descript session select reactiv person identifi peopl person difficult recogn length user recogn correctli longer scenario differ behavior result chang valu mood attitud percept person recogn user person difficult recogn scenario short addit user experi longer scenario clarifi issu believ charact test believ charact indirect compar charact behavior human consist charact avoid question charact term open wide varieti interpret human act charact peopl found charact believ session user charact believ found rude charact session charact consist user found charact behav consist person session person jim strang affirm behavior chang time peopl found charact consist found problem person sensit end peopl charact consist behavior extrem problem charact behavior jim session interest run similar user experi longer scenario problem exist user user role charact person interact avatar synthet actor evalu effect influenc charact person user select user reaction end scenario action select influenc charact peopl select action influenc charact person session gave similar answer session user session half user gave detail select action stai rude bold felt react strongli neg rude request user account charact person chose action case hard time determin charact begin scenario feel jim peopl creativ answer good continu respect emot user charact peopl emot gener user peopl charact person select action ignor person react person peopl mention prefer point scenario conclud user tend act charact avatar reaction charact hypothesi verifi user react charact react human displai kind person question charact spend time charact spend time charact spend time user set pick charact spend time person compar choic user answer compar user choic user forget charact plai synthet actor human kind reaction peopl possess similar person charact friendli dislik nasti rude potenti entertain assum emot condit user entertain system end user felt emot conclud direct question entertain feel emot user describ emot interact peopl experienc emot identifi emot scenario person mention mild understand motiv charact behavior expect user laugh laugh laugh audienc movi show peopl entertain peopl affirm slightli person user laugh jim ingredi contribut entertain peopl resolut question jim answer end session verifi experienc user user interact mention eager jim motiv find directli peopl found entertain system enjoi experi find motiv action charact part fun user peopl interact system find experi entertain reason joi laugh experienc user part stori avatar factor contribut make question experi discuss synthet actor behavior direct receiv interact environ model person attitud actor explain actor model select behavior present type experi run test experi synthet actor user test show synthet actor behav respect person perform action show relev characterist time expect characterist featur express actor close person believ variabl behavior introduc assign higher standard deviat current person trait vari depend current valu mood attitud charact flexibl person rang believ behavior context user show synthet actor express person recogniz user behavior person trait depend mood attitud trait difficult recogn scenario actor plai short notic chang mood attitud seri user experi exploit longer scenario enabl user observ mood attitud notic influenc person behavior user charact consist behavior extrem behavior time chang mood attitud difficult scenario short longer scenario seri user test confirm charact flexibl person variabl behavior believ peopl account charact person select action neglect person avatar peopl prefer shape person avatar predefin person user find difficult forget person adapt person chosen user social react synthet actor human friendli polit hate rude nasti real world applic involv user synthet entertain emot trigger activ particip requir user applic excel testb batteri experi experi consid point view synthet actor user point view explor author point view futur verifi author virtual world find model easi rich creat interest charact educ entertain environ analyz transcript perform synthet actor respect util transcript user test current test shown model express futur work determin flexibl adapt design author virtual space acknowledg work support natur scienc engin council arpa contract nsf contract gift intel benefit discuss member virtual theater research group peopl part experi patrick doyl comment content paper refer trait revisit american psychologist introduct psycholog brace social learn theori englewood role emot believ agent commun acm architectur social behavior technic report school comput carnegi mellon gift differ consult psychologist press process model human person trait artifici intellig scientif analysi person penguin social phenomena virtual realiti pick multimedia approach express agent intern confer autonom marina del guthri act york architectur adapt intellig system artifici intellig direct comput charact technic report knowledg system stanford van puppet actor technic report knowledg system stanford van act charact creat person synthet actor technic report knowledg system stanford bring charact life handbook short stori write writer pragmat natur languag gener artifici intellig theatr routledg interfac metaphor charact art interfac design comput theater believ agent languag intern confer autonom marina del artifici life meet lifelik autonom agent commun acm ture enter prize competit twelfth nation confer artifici intellig wa cognit social learn person psycholog review rousseau approach model simul essai speech act theori john benjamin publish compani technic report cognit structur emot cambridg press introduct person charl merril publish compani media peopl treat media real peopl place cambridg press methodolog build believ social agent intern confer autonom marina del natur negoti believ agent technic report carnegi mellon preliminari model person believ agent technic report nation research council itali person synthet agent technic report knowledg system stanford inquiri human knowledg structur lawrenc erlbaum hillsdal linguist style lifelik comput charact paper aaai workshop entertain ai technic report virtual actor perform script role intern confer autonom marina del
ML/1346 6 fl kluwer academ boston manufactur netherland introduct variat method graphic model michael jordan depart electr engin comput scienc depart ca ghahramani comput neurosci colleg london jaakkola artifici intellig ma lawrenc saul florham nj david heckerman abstract paper present tutori introduct variat method infer learn graphic model network markov random present number exampl graphic includ sigmoid belief boltzmann variant hidden markov run exact infer algorithm introduc variat exploit law larg number transform origin graphic model simplifi graphic model infer effici infer model bound probabl interest origin model describ gener framework gener variat transform base convex dualiti final return exampl demonstr variat algorithm formul case graphic bayesian belief probabilist approxim variat field hidden markov boltzmann neural network introduct problem probabilist infer graphic model problem comput condit probabl distribut valu node valu node repres set hidden node repres set evid calcul gener exact infer algorithm develop perform calcul algorithm systemat advantag condit independ present joint distribut infer pattern miss edg graph calcul margin probabl graphic probabl observ view function paramet graphic fix import quantiti likelihood suggest eq evalu likelihood close relat calcul infer algorithm simpli comput numer denomin eq fact gener produc likelihood calcul algorithm maxim likelihood relat gener make calcul subroutin case exact algorithm provid satisfactori solut infer learn discuss time space complex exact calcul unaccept approxim procedur context junction tree time complex exponenti size maxim cliqu junction tree natur architectur assumpt necessarili lead larg cliqu case complex exact algorithm reason approxim procedur note exact algorithm make numer joint probabl distribut graphic put algorithm complex probabl distribut famili distribut consist condit independ impli graph situat node cluster node situat node probabl determin subset neighbor situat small subset configur variabl probabl mass case achiev exact algorithm worth comput cost varieti approxim procedur develop attempt identifi exploit situat exampl includ prune algorithm method cooper method partial method draper hank virtu method close ti exact method full advantag condit independ virtu exponenti growth complex exact algorithm relat approach approxim infer arisen applic graphic model infer decod kim pearl algorithm graphic model successfulli iter approxim method infer graph approach design approxim algorithm involv make mont carlo method varieti mont carlo algorithm develop appli infer problem graphic model fung advantag algorithm includ simplic implement theoret converg disadvantag mont carlo approach algorithm slow converg hard converg chapter discuss variat provid approach design approxim infer algorithm variat methodolog yield determinist approxim procedur gener provid bound probabl interest basic intuit underli variat method complex graph probabilist graph connect averag phenomena render node insensit set valu neighbor advantag averag phenomena lead accur approxim procedur import approach infer outlin mean mutual exploit complementari featur graphic model formal solut problem involv algorithm combin aspect method present variat method link exact method exact method subroutin variat approxim jaakkola saul acknowledg outset current understand variat method appli probabilist infer variat transform form class gener mathemat pictur transform exploit yield bound probabl graphic systemat algebra variat transform match optim graphic model provid illustr exampl gener famili graphic model variat method appli provid gener mathemat framework encompass provid assur framework transfer easili exampl begin section overview exact infer graphic base discuss junction tree algorithm section present exampl graphic provid motiv variat methodolog provid exampl return develop detail proce chapter core materi variat approxim present section section fill sequenti method block return exampl work variat approxim case section present direct futur research figur direct graph associ local condit probabl node joint probabl product local probabl exact infer section provid overview exact infer graphic repres junction tree algorithm relationship junction tree algorithm exact infer recent develop exact intent provid complet descript junction tree introduc step algorithm understand creat data structur determin run time infer suffic introduct junction tree algorithm jensen graphic model basic graphic model undirect graphic model direct graphic model numer associ local condit probabl node acycl direct graph condit probabl probabl node valu js repres set indic parent node repres set parent node fig obtain joint probabl distribut node sn product local node js infer involv calcul condit probabl joint distribut undirect graphic model random numer associ cliqu graph potenti function set configur cliqu set figur undirect graph associ potenti cliqu graph cliqu fs fs fs potenti assign posit real number configur cliqu joint probabl normal product cliqu potenti valu node associ posit real number configur subset node form potenti oe fig joint probabl distribut node graph obtain product cliqu oe total number cliqu normal factor obtain sum numer fsg oe statist mechan terminolog refer sum junction tree algorithm compil direct graphic model undirect graphic subsequ inferenti calcul carri undirect formal step convert direct graph undirect graph call initi graph simpli skip moral understand note direct undirect joint probabl distribut obtain product local function direct function node condit probabl js probabl qualifi potenti function configur set variabl fs problem variabl figur simplest graph graph chord ad chord node render graph triangul cliqu parent common child necessarili link util node condit probabl potenti parent node undirect edg drop arrow edg graph result repres probabl distribut origin direct graph undirect formal phase junction tree algorithm complex moral graph input produc output undirect graph addit edg ad graph special properti calcul probabl place triangul build joint distribut sequenti condit block interconnect node predecessor block sequenc simplest graph cycl node shown fig write joint probabl sequenti problem depend unabl write joint probabl sequenc condit graph triangul chord edg node graph fig triangul ad chord fig graph write joint probabl sequenti graph triangul arrang cliqu graph data structur junction tree junction tree run intersect node cliqu cliqu lie path cliqu properti import consequ gener algorithm probabilist infer base achiev local consist cliqu cliqu assign margin probabl node junction run intersect local consist impli global consist probabilist calcul perform junction tree involv margin rescal cliqu potenti achiev local consist neighbor cliqu time complex perform calcul depend size discret data number valu requir repres potenti exponenti number node cliqu effici critic obtain small cliqu remaind investig specif graphic model comput cost exact infer model case displai lower bound size cliqu triangul graph cliqu moral graph specif algorithm triangul discuss triangul exampl section present exampl graphic model exact infer gener involv diagnost system fix graphic model answer queri remain exampl involv estim problem graphic model fit data subsequ predict diagnosi probabilist intend diagnost aid domain intern medicin provid overview detail cooper bipartit graphic model upper layer node repres lower layer node repres symptom fig approxim node symptom node evid set observ henceforth refer observ symptom repres vector find symbol symbol denot vector node compon binari random variabl make condit independ impli bipartit form margin unobserv symptom obtain joint probabl symptom figur structur graphic model shade node repres evid node refer prior probabl obtain al archiv data condit probabl find obtain expert assess model condit probabl ith symptom express ij ij paramet obtain expert assess case paramet interpret probabl ith find present present effect addit contribut addit factor ij probabl ith find absent find rewrit model exponenti ij ij ij transform paramet note probabl posit find ij form express model gener linear model form joint probabl distribut product local probabl eq neg find benign respect infer problem product exponenti factor linear eq yield joint probabl exponenti express linear neg find incorpor joint probabl linear number oper product probabl posit yield cross product term problemat exact infer cross product term input hidden output figur layer graphic structur neural network input node output node set evid node coupl phenomena coupl term lead exponenti growth inferenti complex set standard diagnost case al jaakkola jordan found median size maxim cliqu moral graph node triangul diagnost calcul model gener neural network graphic model neural network layer graph endow nonlinear function node fig activ function bound obtain logist function treat neural network graphic model associ binari variabl node interpret activ node probabl binari variabl valu logist ij ij paramet edg parent node node paramet node belief introduc neal advantag treat neural network manner includ abil perform diagnost handl miss treat learn foot learn realiz requir infer problem solv effici easi exact infer gener layer neural network model node neural network gener parent node layer moral neural network graph link hidden output figur moral neural network output node evid node train creat probabilist depend hidden node captur edg ad moral figur boltzmann machin edg node factor ij contribut multipl potenti cliqu edg node contribut factor potenti node layer fig link exact infer gener train neural network output node evid hidden unit penultim layer probabilist ancestor hidden layer hidden unit hidden time complex infer ignor addit growth cliqu size due triangul neural network dozen hundr hidden unit train neural network exact infer gener feasibl boltzmann machin boltzmann machin undirect graphic model node restrict set potenti function fig cliqu potenti form product term quadrat cliqu potenti product factor ij factor pair node overlap cliqu pair assum express ij factor cliqu potenti factor assum cliqu potenti product cliqu potenti eq ij set ij node neighbor convent sum pair respect cliqu boundari refer neg expon eq energi definit joint probabl eq gener form boltzmann distribut saul jordan point exact infer special case boltzmann pair coupl tractabl decim algorithm gener boltzmann decim immun exponenti time complex plagu exact method fact boltzmann machin special class undirect graphic special class virtu virtu condit independ structur exact algorithm decim junction tree base sole graphic structur boltzmann effici boltzmann machin gener graphic model triangul gener boltzmann includ layer boltzmann machin boltzmann obtain intract larg cliqu sampl algorithm attempt cope intract boltzmann machin sampl algorithm overli recent work consid faster approxim describ field approxim boltzmann machin special form variat approxim approach lower bound margin probabl discuss gener variat algorithm upper lower bound probabl boltzmann machin hidden markov model briefli review hidden markov model hidden markov model graphic model exact infer discuss hmm lai groundwork discuss figur hmm repres graphic model spatial dimens repres time output node evid node train process state node hidden intract variat hmm section jordan fuller discuss hmm graphic model hmm graphic model form chain fig sequenc multinomi node assum condit probabl node predecessor independ variabl index thought time chain assum matrix transit jx invari time requir probabl distribut initi state hmm model involv set node emiss probabl law jx assum hmm train treat output node evid node state node hidden node algorithm gener updat paramet algorithm involv simpl iter procedur altern run infer algorithm calcul condit probabl updat paramet weight maximum likelihood weight condit probabl calcul step easi exact infer tractabl hmm moral triangul step vacuou time complex read fig directli maxim cliqu size state node infer scale length time seri factori hidden markov model problem domain natur make addit structur assumpt state space transit probabl figur factori hmm chain transit matric horizont output probabl determin matric vertic edg simpl hmm framework number structur variat hmm consid recent year gener variat view belief simpl variat hmm theme hidden markov william graphic model factori hmm shown fig system set chain index state node mth chain time repres transit matrix mth chain repres view effect state space cartesian product state space individu chain transit probabl system obtain product transit jx jx symbol stand ghahramani jordan util distribut emiss probabl jx matric paramet figur triangul compon chain moral step link state singl time step triangul step link state diagon neighbor time step natur model system hidden state realiz joint configur uncoupl set dynam system repres larg effect state space smaller number paramet singl unstructur cartesian product hmm chain chain node effect state space size transit probabl repres compactli paramet singl unstructur hmm requir paramet transit matrix case fact output function state chain impli state stochast coupl output observ investig implic fact time complex exact infer fig show triangul case chain fact optim cliqu hidden state size time complex exact infer number state chain assum chain number state fig show case triangul triangul creat cliqu size graph fig cliqu size gener difficult cliqu size number complex exact infer scale singl unstructur cartesian product hmm number state complex scale exact infer exponenti growth complex case show exact infer gener figur triangul state node compon chain observ node omit interest figur graph triangul hidden markov model relat variat hmm consid markov model state depend previou state singl previou state case readili shown time complex exponenti discuss hmm variat algorithm hmm saul jordan hidden markov tree model tree endow markovian dynam tree view graphic model model tree multinomi random level tree refer fig time shade node top diagram repres input vector node input node node node condit input entir sequenc figur hidden markov tree shade node fu fy repres time seri element pair link input output sequenc node correspond branch tree link horizont repres markovian tempor depend vertic arrow term tradit tree depend indic path data point drop tree node bottom diagram output variabl make tree condit current data previou moment obtain hidden markov tree fig horizont edg repres markovian tempor depend note depend assum probabl depend previou level tree sequenc input vector sequenc output vector infer problem comput condit probabl distribut hidden state problem intract gener note includ special case basic variat methodolog variat method approxim method wide varieti includ finit element analysi quantum mechan statist mechan statist case applic variat method convert complex problem simpler simpler problem gener decoupl freedom origin problem decoupl figur variat logarithm function linear function form famili upper bound exact achiev problem includ addit variat fit problem hand terminolog root techniqu calculu variat start systemat calculu jump intermedi point import role convex variat approxim point view turn suit develop variat method graphic model exampl begin simpl express logarithm function min fx ln express variat requir perform minim express readili verifi deriv respect solv substitut situat appreci show fig note express brace eq linear slope concav line slope intercept line touch logarithm singl point ln eq intercept rang famili line form upper envelop logarithm function ln variat transform famili upper bound logarithm minimum bound exact logarithm pragmat justif transform convert nonlinear function linear function cost obtain free paramet obtain upper bound set obtain good bound recov exact logarithm optim choic directli relev graphic model node common repres probabl node valu monoton nonlinear simpl linear valu parent node logist regress eq weight sum valu parent node logist function convex simpl linear bound work logist function log concav function concav function readili verifi calcul bound log logist function linear function bound logist function exponenti min fx binari entropi ln explain binari entropi function suffic simpli intercept term log logist exponenti note minimum exponenti function min variat transform logist exampl plot fig note obtain upper bound logist function valu good choic provid bound advantag transform eq context graphic model obtain joint probabl graphic figur variat transform logist function model requir product local condit probabl eq condit probabl repres logist obtain product function form product simpl form augment network includ variat repres logist function eq bound joint probabl obtain product exponenti tractabl expon linear convex dualiti find variat transform variat transform util literatur graphic model exampl gener principl convex dualiti gener fact convex analysi concav function repres conjug dual function min vector conjug function obtain dual min relationship easili understood shown fig plot linear function short vertic figur conjug function obtain minim repres dash segment repres valu clear figur shift linear function vertic amount minimum valu order obtain upper bound line slope touch singl point observ justifi form conjug minimum differ explain conjug function intercept eq easi verifi conjug function logarithm ln conjug function log logist function binari entropi upper bound framework convex dualiti appli equal lower convex max max conjug function linear bound convex dualiti restrict linear bound gener bound obtain transform argument function interest function concav min fx conjug function transform yield quadrat bound worth note transform combin logarithm transform util earlier obtain gaussian upper bound obtain variat approxim posterior distribut gener methodolog suggest convex dualiti obtain upper lower bound function interest function convex concav simpli calcul conjug function function convex invert transform render function convex concav transform argument function calcul conjug function transform space transform back approach find algebra properti approxim joint probabl condit probabl discuss approxim local probabl distribut node graphic model approxim translat approxim global probabl condit distribut interest infer problem margin probabl interest learn focu direct graph concret lower bound upper bound local condit probabl js assum form js js provid upper lower variat upper lower bound upper bound product upper bound upper js js inequ hold arbitrari set valu variat paramet eq hold subset subset held impli upper bound margin probabl obtain sum variat form side equat disjoint partit fhg fhg js exampl discuss variat form js summat carri effici kei step develop variat eq eq upper bound hold set valu variat paramet hold optim set paramet treat side eq side eq function minim respect optim process induc interdepend paramet interdepend critic obtain good variat bound margin probabl interest global bound obtain probabilist depend distribut reflect depend approxim clarifi natur variat note import distinct made joint probabl margin probabl eq variat paramet set optim argument find optim set variat paramet recov exact joint probabl assum local probabl js repres variat exampl discuss section eq gener recov exact valu margin optim variat paramet depend argument case node parent rang fhg side eq involv evalu local probabl js valu parent variat paramet depend gener expect obtain exact js eq necessarili bound exact valu observ bit insight reason variat bound expect tight circumst js constant rang oper point variat fairli insensit set side logarithm fig bound expect tight condit present expect bound situat complic interdepend induc optim process return issu discuss discuss upper similar comment appli lower margin probabl obtain lower bound joint distribut condit distribut ratio margin obtain upper lower bound condit upper lower bound numer denomin gener obtain upper lower bound labor essenti numer involv fewer sum case numer involv sum simpli function evalu worth note variat method interest simpli tractabl approxim method provid strict bound sampl method obtain variat approxim bound margin substitut variat paramet obtain condit probabl distribut obtain lower bound likelihood fit variat paramet substitut paramet variat form util variat form effici infer engin calcul approxim section illustr gener variat framework appli number exampl exampl involv architectur practic interest provid concret exampl variat methodolog exampl serv case histori gener relat architectur import necessarili straightforward develop variat approxim architectur util appli method outlin section depend architectur includ choic node probabl graph topolog paramet regim model oper choic node condit probabl function lend readili variat transform algebra properti architectur simplifi readili variat transform margin bound eq simpl function case complex issu understood develop effect variat approxim case requir substanti creativ sequenti block method detail variat method appli probabilist infer problem basic idea suggest simplifi joint probabl distribut transform local probabl function choic variat simplifi form joint probabl distribut simplifi infer problem transform node cost perform transform obtain bound approxim probabl exact result option transform node impli role exact method subroutin variat approxim partial transform graph leav origin graphic structur intact introduc graphic structur exact method fruitfulli appli variat approxim limit transform graph simplifi graph exact method appli gener yield tighter bound algorithm transform entir graph regard tractabl substructur major variat algorithm literatur date divid main sequenti block sequenti node transform order determin infer process approach advantag flexibl pattern evid determin choic node transform obviou substructur graph amen exact advantag design advanc node transform block approach natur set paramet estim sequenti approach sequenti approach introduc variat transform node order goal transform network result transform network amen exact method exampl variat transform understood graphic node remov graph suffici number variat transform introduc result graph suffici exact method applic oper definit obtain run greedi triangul upper bound run time junction tree infer algorithm basic wai implement sequenti begin graph introduc variat transform node begin complet transform graph reintroduc exact condit probabl node time advantag approach graph remain tractabl feasibl directli calcul quantit effect transform reintroduc node approach graph intract assess transform qualit effect graphic sequenti approach present context specif section return network show sequenti variat approach infer network network jaakkola jordan present applic sequenti variat method network network bipartit graph condit probabl find base model neg find eq posit note symptom node symptom simpli margin joint distribut omiss impact infer neg find present difficulti exponenti form probabl eq effect neg find probabl handl linear time assum updat neg find made focu problem perform infer posit find repeat eq probabl posit ij function log case logist express variat upper bound term exponenti linear function conjug function ln plug argument eq eq note variat paramet transform ij ij final equat displai effect variat transform exponenti factor product simpli constant product node parent set node unlik case graph moral exact contribut node uncoupl factor ij simpli constant multipli probabl node coupl node product graphic effect variat transform shown fig variat transform ith find graph graph render singli connect exact infer algorithm invok margin unobserv symptom simpli remov sequenti methodolog util jaakkola jordan begin complet transform graph reinstat exact condit probabl select node order reinstat jaakkola jordan make base choic effect likelihood bound reinstat node individu start complet transform state suboptim found yield approxim order magnitud accur algorithm random order order algorithm proce node symptom figur graph lightli shade find subject variat transform effect node graph effect reintroduc link node current graph result graph amen exact reinstat node iter stop run exact method paramet make approxim tight difficult verifi product express eq yield bound convex function paramet standard optim algorithm find good choic figur show result jaakkola jordan approxim infer mention earlier case suffici small number posit find exact algorithm run provid gold standard comparison leftmost figur show upper lower bound case jaakkola jordan sort case execut time figur exact valu variat upper lower bound tractabl case correl approxim exact posterior margin function execut time solid variat dash sampl line sampl result repres standard error base ten independ run calcul approxim posterior margin correl margin gold standard shown rightmost figur figur plot accuraci run run posit find treat note accur valu obtain figur show result sampl algorithm requir significantli comput time variat method obtain roughli compar accuraci jaakkola jordan present result entir corpu case found variat method yield accur estim posterior probabl lengthi run basi comput time boltzmann machin boltzmann machin special subset class undirect graphic model potenti function product quadrat linear jaakkola jordan introduc sequenti variat algorithm approxim infer boltzmann machin discuss yield upper lower bound margin condit probabl interest recal form joint probabl distribut boltzmann ij obtain margin probabl joint calcul sum exponenti quadrat energi function obtain condit probabl ratio numer requir fewer sum denomin gener sum partit function sum configur fsg focu upper lower bound partit function gener calcul bound margin condit interest approach perform sum sum introduc variat transform ensur result express stai tractabl step process transform potenti involv quadrat boltzmann factor method view creat increasingli term margin sum transform boltzmann machin remain boltzmann machin lower bound write partit function fsg jk jk attempt find tractabl lower bound side difficult show express log convex bound logarithm ln jk jk ln ij jk ln ij jk ij sum term side sum pair equal binari entropi variat paramet node line simpli pull sum term involv line perform sum valu lower bound express eq lower bound term side found variat bound relat express treat logist recal eq upper bound case translat lower bound current bound util eq graphic consequ bound eq fig note node graph node boltzmann factor unalt term graph unalt node term neighbor node endow linear node link exact neighbor link remain link jk paramet node absent transform partit function absent left trace linear boltzmann factor neighbor summar effect transform note transform graph boltzmann machin fewer node jk jk ij figur transform boltzmann machin approxim margin node case lower bound boltzmann machin transform boltzmann machin jk equal remain unalt suggest linear coeffici chang node neighbor note final constant term track term interest interpret return boltzmann machin context block method upper bound obtain similar break partit function sum node sum configur remain node sn line ensu deriv lead eq ident complet deriv find upper bound jaakkola jordan quadrat bound note concav function verifi deriv respect impli quadrat upper bound appropri defin conjug function upper bound eq ln jk jk ij ij variat paramet node figur transform boltzmann machin approxim margin node case upper bound boltzmann machin transform boltzmann machin dash edg neighbor link link paramet valu suggest neighbor linear coeffici edg paramet unalt graphic consequ transform lower bound fig term case graph unalt node graph node neighbor link remain link quadrat rise link unlink neighbor node alter paramet link neighbor node acquir linear term expand eq collect approxim margin yield boltzmann machin jk jk ji ik ij ij ij constant term graphic consequ lower upper bound transform comput consequ lower bound transform introduc addit link node natur combin transform exact method algorithm simpli node tractabl structur point exact algorithm call subroutin upper bound introduc link neighbor reveal tractabl structur readili vantag mitig fact upper bound tighter bound block approach altern approach variat infer design advanc set node transform principl view applic sequenti approach case lower advantag gain develop methodolog specif block transform show natur global measur approxim accuraci obtain lower bound block version variat formal method mesh readili exact method case tractabl substructur identifi graph approach present saul jordan refin version field theori markov random develop number recent studi ghahramani ghahramani block begin identifi substructur graph interest amen exact infer method effici approxim infer pick tree set chain origin graph simplifi structur approxim probabl distribut origin graph famili probabl distribut obtain simplifi graph introduct variat paramet approxim distribut simplifi famili make choic variat paramet sequenti approach choic variat paramet made time evid repres joint distribut graphic model repres node graph disjoint subset repres hidden node evid approxim condit probabl introduc approxim famili condit probabl variat paramet graph repres gener graph repres gener famili approxim distribut distribut minim respect variat argmin probabl distribut kl diverg defin fsg ln minim valu variat defin treat approxim famili simpl justif kl diverg measur approxim accuraci yield lower bound probabl evid famili approxim bound logarithm jensen inequ ln ln fhg ln fhg fhg ln differ left hand side equat easili kl diverg posit kl diverg side eq lower bound eq obtain tightest lower bound convex dualiti kl diverg justifi choic kl diverg make appeal convex dualiti link block approach sequenti approach case node distribut view vector real configur variabl treat vector variat paramet eq log probabl ln view vector real defin set configur treat vector variabl eq defin ln verifi express ln ln ln fhg ln convex valu ln direct substitut eq min fhg ln ln minim respect ln conjug function neg entropi function fhg ln eq lower bound log likelihood ln fhg ln ln ident eq principl recov exact log likelihood rang probabl distribut rang famili obtain tightest lower bound famili paramet estim variat method neal hinton point lower bound eq role plai context maximum likelihood paramet estim make link lower bound paramet estim em algorithm augment notat includ paramet specif joint probabl distribut design subset node observ evid margin probabl thought function likelihood em algorithm method maximum likelihood paramet estim hillclimb log likelihood make convex relationship ln ln previou section section show function fhg ln ln lower bound log likelihood probabl distribut show differ ln bound kl diverg rang probabl distribut minim kl diverg standard result cover kl diverg minim minim verifi substitut side eq recov ln suggest algorithm start initi paramet vector iter maxim bound respect probabl distribut fix maxim bound respect paramet argmax argmax coordin ascent relat tradit present em algorithm note fix side eq function ln term maxim respect step maxim fhg ln maxim log em defin step tradit present em return situat unabl comput full condit distribut case variat methodolog suggest famili approxim distribut longer perform true em iter avail perform coordin ascent lower bound variat strategi minim kl diverg respect variat paramet defin approxim famili restrict form coordin ascent argument follow step lower bound respect paramet point view tractabl approxim em exploit number recent includ sigmoid belief factori hidden markov model hidden markov tree architectur discuss neal neal exampl return problem pick tractabl variat graphic model pick simplifi graph rich provid distribut close true simpl exact algorithm util effici calcul approxim distribut similar hold variat variat rich good approxim simpl procedur minim kl diverg hope find good paramet stuck local minimum necessarili realiz desiderata number case found simpl variat approxim yield accur solut section discuss exampl field boltzmann machin section discuss sequenti variat algorithm yield upper lower bound boltzmann machin revisit boltzmann machin context block approach discuss lower bound relat approach recal joint probabl boltzmann machin written ij ij node neighbor graph condit distribut boltzmann machin node contribut ij reduc vanish normal quadrat contribut linear contribut associ node linear term node constant vanish express condit distribut ij sum restrict rang node updat paramet includ contribut evid ij updat partit function fhg ae ij oe boltzmann machin subset approxim boltzmann machin form variat approxim complet factor distribut approxim simplest approxim obtain drop edg boltzmann graph fig choic repres variat choic variat repres larg approxim famili endow freedom variat paramet written product hidden node form kl diverg fulli factor distribut distribut eq ln ij ln figur node boltzmann machin markov blanket approxim field distribut base graph edg field equat yield determinist repres figur dot variat paramet node markov blanket node sum rang node deriv result fact independ random variabl valu deriv kl diverg respect independ set deriv obtain oe ij logist function defin ij equal ji eq defin set coupl equat field equat solv iter fix point solut note variat paramet updat base sum variat paramet markov blanket fig view variat form local messag pass algorithm peterson anderson compar field approxim gibb sampl set test case found ran time yield roughli level accuraci field approxim break case includ boltzmann machin boltzmann machin network potenti function embodi constraint neighbor node simultan satisfi case exact algorithm provid observ led exact algorithm subroutin approach pursu saul jordan paramet estim problem boltzmann machin write lower bound eq ln ij ln ln deriv respect ij yield gradient simpl term contribut deriv ln respect ij hard show deriv hs bracket signifi averag respect uncondit distribut gradient algorithm perform approxim ij hs assumpt calcul boltzmann distribut intract graph intract comput uncondit averag appeal field theori comput approxim hs factor distribut step differ gradient bound longer salient learn problem data set interest heterogen collect classif uncondit distribut gener requir multipl mode factor field approxim unimod poor approxim distribut approach problem util distribut jaakkola jordan discuss mixtur model approxim distribut issu find satisfactori treatment context direct section gradient direct graph eq requir averag uncondit distribut relationship field approxim lower bound obtain sequenti algorithm section run algorithm node elimin obtain bound ident field bound note boltzmann machin node elimin quadrat linear constant term remain recal section constant node remov refer updat absorb linear term elimin node updat ij remov node neighbor collect updat sum node find result constant term ij ln differ lower bound eq term ln disappear maxim respect neural network discuss section belief essenti neural network graphic model semant util logist function node probabl ij assum ij parent ij ji note probabl case case written singl express js ij ij obtain joint ij ij calcul condit probabl joint distribut fig infer gener sigmoid belief network variat approxim jordan saul jordan explor viabil simpl complet factor distribut attempt find approxim vari paramet comput kl diverg proce case field boltzmann machin entropi term ln energi term ln found logarithm eq averag respect put result ln ij ln ij ae ln denot averag respect notat defin valu set instanti valu note fact unabl calcul averag denot ij import term directli direct natur sigmoid belief network denomin factor defin sigmoid local condit deal saul al introduc addit variat due seung view refin form jensen inequ ff hz hz ln variat paramet inequ reduc standard jensen inequ final result util directli eq provid tractabl lower bound log likelihood variat paramet optim variat paramet saul jordan show limit case network hidden node larg number central limit theorem paramet probabilist interpret approxim expect logist function fix valu paramet differenti kl diverg respect variat paramet obtain consist oe ij ji ji ji express depend node child parent node term sum contribut parent node term sum contribut children node consist equat node involv contribut markov blanket node fig case boltzmann find variat paramet link markov blanket consist equat interpret local algorithm jordan saul jordan show updat variat paramet paper util paramet figur node sigmoid belief network machin markov blanket field equat yield determinist repres figur dot variat paramet node markov blanket node slightli wai obtain updat equat relat variat approxim sigmoid belief includ upper lower present jaakkola comput gradient respect paramet ij fix variat paramet result obtain saul jordan ij ij note calcul variat paramet uncondit case boltzmann machin fact note note interest regular term equat term maxim valu variat paramet paramet bound approxim maximum likelihood estim fact form penal maximum likelihood estim al test sigmoid belief network handwritten digit recognit obtain result competit learn system import advantag graphic model approach abil deal miss data saul jordan report degrad perform miss pixel digit slight compar empir work sigmoid belief network relat includ comparison gibb dayan factori hidden markov model factori hidden markov model multipl chain structur fig notat develop earlier figur variat approxim obtain pick tractabl substructur graph graph lead famili tractabl approxim distribut section joint probabl distribut fy jx comput probabl distribut gener cliqu size unmanag larg chain structur moral triangul approxim natur substructur base variat algorithm chain individu tractabl remov naiv field approxim discuss previou reason remov edg decoupl chain remov edg link state node output node fig edg moral process longer link state node longer creat larg cliqu moral process graph fig triangul cliqu graph size number state singl chain iter approxim infer run time number chain length time seri express variat approxim graph fig approxim idea introduc free paramet approxim probabl edg drop free denot essenti serv surrog effect observ time state compon optim diverg respect paramet interdepend view approxim probabilist depend captur exact algorithm moral process refer fig write distribut factor jx vector variat paramet defin transit matrix product exact transit matrix variat paramet jx jx similarli initi state probabl famili distribut respect condit independ statement approxim graph fig addit freedom variat paramet ghahramani jordan present equat result minim kl diverg approxim probabl distribut true probabl distribut result summar architectur equat variat paramet function term markov blanket node updat depend paramet link variat paramet time updat depend expect state expect distribut chain decoupl expect found run exact algorithm algorithm separ chain expect depend current valu paramet eq depend effect coupl chain fit variat paramet procedur exact algorithm run subroutin calcul expect hidden state independ make refer current valu paramet paramet updat base expect comput phase procedur return phase iter ghahramani jordan report result fit bach data set show significantli larger effect state space fit unstructur perform term probabl test set order magnitud larger evid overfit hmm state evid overfit state figur chain graph lead approxim famili distribut hidden markov tree final return hidden markov tree introduct briefli discuss variat approxim architectur essenti markov time seri probabl model time step tree hidden node markovian depend obtain separ transit matric level give model factor structur variat approach fit close relat fit addit choic variat approxim substructur worth drop vertic recov decoupl set chain chain handl algorithm drop horizont recov decoupl set tree calcul probabl tree posterior propag algorithm jordan refer chain shown fig write variat approxim forest chain approxim respect condit independ approxim graph incorpor variat paramet obtain extra freedom tree horizont link elimin fig tree fulli connect essenti naiv field approxim hypergraph develop variat algorithm analog viterbi algorithm hmm util approxim assign probabl singl path state space kl diverg distribut easi entropi contribut kl diverg ln evalu energi ln reduc substitut state chosen path distribut figur tree graph lead approxim famili distribut result algorithm involv subroutin standard viterbi algorithm run singl chain held fix subroutin run chain turn al found perform bach essenti advantag greater run result order tempor scale markov process top bottom tree discuss varieti applic variat method problem infer learn graphic model hope convinc reader variat method provid power eleg tool graphic algorithm result simpl intuit appeal import research variat method graphic model recent open problem unresolv issu section discuss number issu broaden scope present discuss number relat strand research relat research method discuss involv iter approxim algorithm interest discuss relat approxim scheme recognit model machin algorithm present core nonlinear optim problem introduc variat sequenti left bound eq optim optim bound gener achiev iter algorithm iter optim process induc interdepend variat paramet give approxim margin condit probabl interest problem direct graphic model learn common approach learn graphic model orient point hidden variabl observ case calcul elementari calcul calcul proce backward graph diagnost calcul gener requir full power infer algorithm altern approach solv iter approxim diagnost calcul learn gener model model approxim diagnost distribut associ paramet gener model recognit model reli paramet estim process bring regist basic idea kei advantag approach calcul reduc elementari feedforward calcul perform quickli disadvantag approach lack iter algorithm make machin unabl deal natur miss phenomena coupl hidden variabl chang function condit variabl case clear natur recognit model induc gener model linear model factor gener difficult insur model match appropri problem address combin approach iter variat essenti treat store good initi variat paramet sampl method section make remark relationship variat method stochast gibb set graphic class method reli extens gibb node learn current instanti markov blanket sampl node estim distribut markov blanket determin statist advantag scheme limit converg correct statist disadvantag sampl requir variat method coupl variat paramet node markov blanket messag form form approxim statist summar variat network binari gibb circul messag binari vector correspond instanti markov variat method circul number correspond statist markov blanket reason variat method converg faster gibb sampl disadvantag scheme necessarili converg correct statist provid bound margin probabl difficult estim sampl estim statist individu hidden comput margin probabl interest direct futur research combin sampl method variat method initi work direct ghahramani discuss gibb sampl point view variat approxim bayesian method variat infer appli gener problem bayesian paramet estim gener treat paramet addit node graphic model treat bayesian infer foot gener probabilist infer graphic model probabilist infer problem variat approxim variat method origin introduc fit neural network set paramet thought member ensembl van repres variat approxim posterior distribut ensembl fit minim kl ln line argument section minim maxim lower bound copi argument section find minim kl diverg yield lower bound ln ln logarithm margin kei quantiti bayesian model select model averag ensembl learn approach appli mixtur expert architectur hidden markov model interest aspect applic assum parametr famili make nonparametr assumpt factor specif variat minim determin famili factor prior jaakkola jordan develop variat method bayesian variat approach find analyt tractabl approxim logist regress gaussian prior paramet perspect prospect kei issu face develop variat method issu approxim accuraci develop intuit variat method perform perform poorli examin properti case case fulli factor approxim undirect good start point statist mechan literatur approxim give result case includ connect graph uniformli weak coupl neighbor node field equat network uniqu solut determin statist individu node limit larg graph kearn saul util larg deviat method studi approxim accuraci bound likelihood direct graph accuraci term number parent node layer shown gap variat upper lower bound converg rate approach util gener form upper lower bound local condit probabl depend convex properti result expect robust gener famili variat faster rate obtain variat approxim discuss current paper gener graphic model condit converg fulli factor variat approxim favor gener node small markov blanket strongli depend variat transform node yield poor bound strong probabilist depend model posterior multipl mode limit case determinist relationship readili creat switch automata multipl fulli factor necessarili fail case handl case requir make method transform subset incorpor exact inferenti procedur subroutin handl structur exact method captur strong leav weaker depend variat transform achiev kind labor requir strong depend identifi advanc inspect identifi context sequenti variat method simpl greedi calcul altern approach handl multipl mode util mixtur model approxim distribut distribut block variat jaakkola jordan jaakkola jordan discuss approach import stress differ joint distribut condit distribut classif problem repres categori joint distribut condit distribut factor approxim make infer problem poor approxim joint probabl model kei issu broaden scope variat method paper present restrict set variat base convex transform techniqu applic convex properti identifi easi small class model properti lead simpl approxim case local condit probabl gener linear gener easi develop variat algorithm kind graphic model broader variat approxim systemat algebra match approxim model open problem problem combin variat method sampl method search base problem make inform choic node order case sequenti develop upper bound block combin multipl variat approxim develop variat method architectur combin continu discret random variabl similar open problem exist sampl method method base incomplet prune version exact method difficulti provid solid theoret foundat case li fact accuraci larg actual condit probabl valu underli probabl model discret properti graph acknowledg david peter dayan comment manuscript appendix calcul conjug function logarithm function log logist function ln min fx ln deriv respect set yield substitut back eq ln justifi logarithm eq log logist function min fx deriv respect set ln ln plug express back eq ln binari entropi function justifi logist function eq note present point view moral combin local suffici exact infer show step exact infer jensen jensen identifi ith node random variabl node defin cliqu subset node fulli connect addit node ad subset subset remain fulli connect note fig moral fig acronym refer version medic pattern miss edg graph impli symptom independ jaakkola jordan calcul median size found rule exact method infer gener boltzmann machin multivalu potenti exponenti arbitrari function cliqu model essenti gener undirect graphic model eq repres probabl note treat gener margin necessarili assum jointli exhaust set node recognit model util machin layer make weak condit independ assumpt make captur fairli gener depend refer finit element procedur englewood maxim techniqu occur statist analysi probabilist function markov chain annal mathemat approxim posterior distribut belief network mixtur solla advanc neural inform process system mit cambridg ma element inform theori john wilei approxim probabilist infer bayesian belief network artifici machin neural model reason causal persist comput bucket unifi framework probabilist infer jordan learn graphic model mit press db incomplet data em algorithm journal royal statist local partial evalu belief network uncertainti artifici tenth confer san morgan kaufmann algorithm learn good densiti hasselmo advanc neural inform process system mit press backward simul bayesian network uncertainti artifici tenth confer san morgan kaufmann limit determinist boltzmann machin learn switch model report depart comput toronto factori hidden markov model machin languag program complex bayesian model tutori learn bayesian network jordan learn graphic model cambridg mit press method bound diagnost probabl larg belief net uncertainti artifici seventh confer san morgan kaufmann learn boltzmann machin rumelhart mcclelland parallel distribut volum mit press ge van neural network simpl minim descript length weight annual workshop comput learn acm press algorithm neural network hierarch commun expert jordan learn graphic model mit press gf bound flexibl infer scarc resourc confer uncertainti artifici confer mountain associ uai comput upper lower bound likelihood intract network uncertainti artifici confer san morgan kaufmann variat method infer estim graphic model unpublish doctor massachusett institut ma algorithm approxim probabl graphic model petsch advanc neural inform process system mit press bayesian logist variat approach smyth confer artifici intellig ft fl jordan improv field approxim mixtur distribut jordan learn graphic model mit press jordan variat method submit journal artifici intellig research larg probabilist expert system intern journal optim junction tree uncertainti artifici tenth confer san morgan kaufmann introduct bayesian network ucl press statist approach tree model warmuth seventh annual acm confer comput learn theori acm press hidden markov tree petsch advanc neural inform process system mit press stochast simul algorithm dynam probabilist network uncertainti artifici eleventh confer san morgan kaufmann triangul give small total state space research report depart mathemat comput aalborg denmark reduct comput complex bayesian network remov weak depend uncertainti artifici tenth confer san morgan kaufmann djc ensembl learn hidden markov model unpublish manuscript depart cambridg decod instanc pearl propag submit ieee journal select area commun uci repositori machin learn depart inform comput california connectionist learn belief artifici probabilist infer markov chain mont carlo method report depart comput toronto view em algorithm justifi variant jordan learn graphic model mit press statist field theori redwood probabilist reason intellig network plausibl san morgan field theori learn algorithm neural network complex convex analysi princeton press variat method statist academ press modern quantum mechan redwood learn boltzmann tree neural field theori sigmoid belief network journal artifici intellig exploit tractabl substructur intract network hasselmo advanc neural inform process system mit press field learn algorithm neural network jordan learn graphic model mit press anneal theori learn cho neural statist mechan perspect world scientif global condit probabilist infer belief network uncertainti artifici tenth confer san morgan kaufmann system bayesian analysi oper empir analysi likelihood weight simul multipli connect medic belief network comput research probabilist diagnosi reformul knowledg base meth inform probabilist independ network hidden markov probabl model neural djc mixtur expert hasselmo advanc neural inform process system mit press field network learn discrimin tempor distort string connectionist model summer school san morgan kaufmann
Agents/1347 1 gener electron commerc server tuoma sandholm depart comput scienc washington st mo abstract electron demonstr wai algorithm game theoret incent gui design jointli improv effici ecommerc configur auction support larg varieti auction type support gener combinatori auction algorithm winner determin bid graphic drawn graph expert system user decid auction type support mobil softwar agent bid optim user behalf base game theoret level commit contract optim autom negoti system consist contract bind level commit contract parti decommit pai predetermin recent shown improv pareto effici agent ration decommit nash equilibrium inflat threshold good offer decommit solv nash equilibrium threshold optim contract price decommit penalti introduct electron commerc full power algorithm game theoret tool har improv effici paper present gener ecommerc server demonstr wai techniqu improv ecommerc term process outcom result implement effort web compon includ auction level commit contract optim configur auction success internet auction site exist ebai motiv develop auction prototyp gener test feasibl term user comfort user internet bui sell good set auction parti seller buyer trust execut copyright american associ artifici intellig reserv materi base work support nsf career award grant grant auction protocol state auction support combinatori bid graphic drawn mobil agent combinatori auction item auction independ bidder prefer combin item common electr equiti bandwidth transport exchang bid difficult determin bid bidder specul item receiv auction introduc lead ineffici alloc bidder fail combin combinatori auction overcom lookahead combinatori bidder place bid combin item bidder express complementar item specul item valuat impact possibl item support varieti combinatori commonli discuss combinatori auction bidder bid combin bid join number bid accept determin winner maxim auction revenu tackl optim search algorithm capit fact space bid necessarili popul practic base common assumpt bid agent bid auction alloc item agent agent bid combin focu situat combin bid introduc captur posit complementar item real world set local occur address bidder submit bid combin combin accept bidder express gener prefer posit neg complementar bidder express gener worst case involv place bid combin user submit multipl tabl row combin row combin xor multipl bid combin user submit multipl tabl method maintain full express natur input lead shorter input descript gener combinatori auction combinatori doubl combinatori auction agent bid multipl unit item combin bid graph graph support bidder express continu prefer bid larger accept lower unit price support auction type support wide varieti auction type user auction type base game theoret econom experi offer expert system restrict choic auction type auction set auction user bid type price determin scheme chosen auction set differ base singl doubl multipl multipl unit item unit bid type includ regular price graph price scheme includ auction paramet mobil agent auction auction support mobil agent user agent activ particip auction disconnect mobil agent execut agent dock host machin auction server reduc network kei advantag bid auction server concordia agent dock provid mobil agent safe execut platform monitor set move user full flexibl java program design agent provid html interfac user agent system automat gener java code mobil launch agent alert bid optim user behalf base game theoret put novic bidder equal foot expert normal full commit contract unabl advantag possibl futur event provid contract profit agent view profit view futur event occur contract low expect realiz futur event desir level commit contract method capit uncertain futur event condit contract futur level commit control decommit agent agent freed contract pai penalti parti ration agent reluct decommit chanc parti case agent freed pai collect penalti lesser show level commit contract parti expect enabl contract set full commit contract benefici parti contract probabl distribut agent offer analog agent futur valuat system comput nash decommit threshold pair agent chang decommit strategi parti chang algorithm conceptu highli fast comput agent decommit probabl expect payoff distribut comput welfar rang optim contract individu ration suggest fair contract refer advantag level commit contract protocol algorithm optim level commit contract ijcai extend washington dept comput scienc implement contract net protocol base margin cost calcul algorithm optim winner determin combinatori auction ijcai extend washington dept comput scienc gener electron commerc server washington dept comput scienc
AI/1348 2 issn de recherch institut nation de recherch en informatiqu en automatiqu algorithm project bundl adjust minimum paramet peter sturm unit de recherch inria avenu de algorithm project bundl adjust minimum paramet interact movi rapport de recherch page bundl adjust techniqu comput maximum likelihood estim structur motion imag featur correspond larg system time iter optim process start solut obtain linear method term comput cost process depend repres structur motion address problem minim project structur camera calibr exist chang cost complic requir call model case loss restrict problem minim project fundament matrix classifi exist wai obtain minim set paramet categori present categori algorithm simpl implement yield minim address problem minim homogen entiti present call map tool optim homogen entiti minim number paramet make extens tool structur motion compar algorithm exist simul data real imag light algorithm perform exist term comput cost achiev perform term converg bundl project minim troi algorithm pour de avec nombr minim de de est techniqu pour calcul au maximum de dune reconstruct de correspond de primit imag en de tre la du temp en itr dune solut par de en term de le cot de calcul de tel de la pour le la structur le le dan cet nou le de de la structur du le ne pa calibr es la de dan le sen ell la de en express pour le ca san de nou le de la du deux dan le ca la matric nou de troi de de param tre minim troi par ce algorithm simpl de nou le de la de nou le nombr minim de nou cet dan le de la structur du nou algorithm avec exist en de donn simul de imag avec ce il le algorithm de perform en term de de perform gale en term de converg de project bundl adjust minimum paramet introduct bundl adjust standard techniqu structur motion optim base imag featur correspond view demonstr bundl adjust maximum likelihood estim provid error measur featur gaussian distribut interest bundl adjust enhanc estim practic case address problem bundl adjust point featur project uncalibr partial calibr view process import accur recoveri project structur motion subsequ algorithm bundl adjust yield larg optim problem consist minim cost function base discrep featur actual complet set paramet structur motion cost function local minima process provid result method bundl adjust remain kei featur bundl adjust algorithm properti converg global comput cost term time bundl adjust greatli depend algebra structur numer condit number paramet emploi minim main problem deal coordin frame project basi reconstruct express solut mind consist set coordin reconstruct point coordin impli priori check point gener project basi solut special form camera matric coordin frame minimum number view paper loss concentr case center project view ident scene observ planar problem express reconstruct basi insid refer shown minim fundament matrix problem direct global uniqu map minim set paramet entri fundament matrix sturm solut problem bundl adjust minim number paramet classifi solut categori present give approach algorithm solv problem simpl practic import issu consid paper minim homogen project structur refer homogen solv call make extens solut algorithm solv problem present paper organ problem state previou work project structur motion review map coordin present appli minim structur algorithm minim motion experi conduct simul data real imag shown drawn problem statement previou work give mathemat notat preliminari recal principl bundl adjust formal state problem coordin frame ambigu review exist approach gener case introduc contribut state review exist solut problem minim homogen entiti notat preliminari perspect project model camera repres homogen denot view consid matrix algebra homogen constraint correspond essenti camera rise repres geometr posit project space term design set view point project space model homogen denot point consid vector algebra homogen constraint correspond essenti term design set point actual imag point repres homogen denot imag point provid point project view handl easili mathemat point visibl view project bundl adjust minimum paramet problem repres motion structur function pq motion structur pq function repres singular function pq bundl adjust process paragraph minim fact number dimens equal number essenti problem formal state bundl adjust previou bundl adjust process conduct argmin pq cost function error sum squar euclidean distanc actual imag euclidean distanc import note rigid rotat appli imag point simplifi form project bundl adjust maximum likelihood estim imag point corrupt iid center gaussian optim bundl adjust conduct iter optim algorithm numer algorithm initi estim case project structur exist algorithm provid initi import aspect estim process consid data condit enhanc method consist normal center scale imag point distanc center imag scale imag cost function preserv term sturm coordin frame ambigu import issu bundl adjust coordin frame express recov structur motion coordin frame ambigu constitut gaug freedom inher problem structur motion recoveri numer stabil converg properti estim process mind choic coordin frame fruit estim process metric problem easili solv singl view coordin frame global scale project gaug freedom constitut main problem dealt bundl algebra structur manipul coordin frame complex view uniqu project basi view provid constraint understand reconstruct express coordin error drop index clariti present error estim actual imag point express reconstruct coordin link current project matrix point transform ph hq chang imag coordin ph hq leav cost coordin frame ambigu measur cost function project state number essenti equal structur motion minu coordin frame minim dim dim problem mean mean handl gaug freedom free gaug consist problem algebra entri gaug evolv project bundl adjust minimum paramet reli coordin reconstruct point chosen point gener achiev form camera matric reli transform imag point give form project matric point constrain gaug freedom achiev minim imag coordin camera matrix write inhomogen valu penalti free gaug problem prevent gaug drift ad soft constraint measur set constraint camera matric coordin frame add penalti term cost function make estim process converg solut approxim constraint mean advantag term numer number paramet number measur ad cost function free gaug advantag simplic implement numer instabl estim diverg involv estim paramet test advantag number paramet estim minim estim behaviour strongli reli choic made point form project basi point gener priori advantag slightli solut simpl test partial yield simpl express camera matric euclidean imag transform time leav cost function invari make bundl adjust penalti simpl implement prevent gaug drift paramet measur comput cost process test normal exist method combin possibl complet partial coordin frame give detail exist approach approach mix coordin frame set point coordin match standard project basi addit imag transform yield sturm simpl express camera minim bundl adjust imag coordin leav cost function yield suboptim bundl adjust result rel structur introduc relat camera matric plane plane necessarili observ camera set ident matrix column camera matric view respect null vector view framework approach minim exist work minim author complet algebra entiti prevent gaug drift ad soft measur cost entri project matric result approach satisfactori term converg comput cost neglig problem measur ad possibl view incorpor gaug constraint structur repres gener homogen entiti possibl paragraph reduc problem case mention problem coordin frame special form camera matric fundament fundament matrix express camera matric recov complet coordin frame attach view loss select view coordin frame camera matric special form write gener homogen gener distant imag sequenc constitut good choic refer view point fall singular case close view manipul notat design camera matric author camera plane relat relat plane rel scale problem project bundl adjust minimum paramet author plane call canon plane denot link fundament matrix plane satisfi homogen essenti essenti canon plane essenti strictli epipolar essenti fundament matrix deduc plane project matric ambigu choic remov normal version remov ambigu rel scale canon project canon reconstruct basi minim entiti fundament matrix minim analysi restrict case author extend minim gener case map depend fundament matrix express fundament matrix attach make method complic implement solut number map reduc imag transform distinct canon project matric fundament strictli canon project matric canon project matrix form slightli version origin canon project matric rel scale mean minim project motion state techniqu estim fundament matrix minim number paramet fall map express algebra entiti term model sturm local updat imag transform restrict number case categori matric fundament matrix estim categori algorithm illustr categori algorithm consist canon plane enforc constraint yield map repres motion map relat map coordin recov canon plane paramet map index factor fundament matrix scale highest singular null singular rotat matric obtain local updat fact cost function consid bundl adjust data condit invari imag rotat imag center ensur lead uniqu minim fundament matrix algorithm necessit minim homogen entiti state problem paragraph homogen ambigu problem dealt project bundl adjust homogen algebra entiti algebra reconstruct point camera matric entiti essenti account prevent bundl adjust process diverg save comput time estim minim number common strategi entiti homogen paramet measur soft constraint norm entiti reconstruct point element constraint norm uniti measur drawback method paramet estim measur comput cost estim process call perform optim minimum number paramet addit measur project bundl adjust minimum paramet map coordin homogen algebra entiti inher freedom scale factor minim coordin repres essenti tool call map coordin local remov word produc minim version homogen entiti homogen entiti map index subsequ recov homogen entiti show decomposit properti coordin undergo small inhomogen part map constant system adapt optim map step optim practic algorithm map coordin tabl give term uniqu bidirect correspond set paramet algebra bidirect correspond set paramet algebra entiti consist select case map number map number step give detail map coordin case homogen vector method valid homogen entiti dimens map index index chosen maximum import properti slightli chang creat numer instabl maximum tend step map requir divid vector exist null element ensur homogen entiti complet null assum probabl vari optim step element null step maximum absolut minim structur minim structur map coordin reconstruct point algebra paramet sturm homogen homogen entiti brought back case stack element singl vector inhomogen repres map coordin integ repres map index map argmax vv tabl map coordin homogen entiti includ optim process notat design vector form element vector insert posit point coordin map coordin map index tabl paramet minim set paramet map indic includ optim process direct minim canon project matric give solut minim project motion canon project matric algorithm yield consist paramet map unlik previou approach base map algorithm simpl requir express algebra entiti idea algorithm paramet repres enforc constraint examin constraint detail rewritten repres column equat linear entri assum elimin recov enforc constraint index column complet row recov entri exclud project bundl adjust minimum paramet necessit case map element small coordin argmax map exclud row index correspond map paramet remain homogen map coordin map coordin provid minim algorithm tabl canon plane constraint hold inhomogen repres set map indic subsequ recov routin call iter optim process call cost function comput map index extract obtain remov comput map index build set paramet consist map coordin paramet store map indic recov recov comput miss row form tabl minim canon project matric factor fundament matrix fundament matrix mean minim motion decomposit rotat matric null singular valu rotat matrix local updat ratio singular valu due homogen fundament matrix updat scheme decomposit rebuild fundament matrix directli canon plane canon project matric sturm denot fundament matrix orthogon matric diagon singular valu strictli posit scalar homogen scale rotat matrix updat paramet rodriguez formula complet includ fundament matrix recov column column canon plane formul equat orthogon algorithm tabl epipolar geometri entiti compon epipolar geometri epipolar transform directli entiti map coordin tricki part approach establish link fundament matrix canon plane multipl express fundament matrix multipl express imag transform transform chosen cost function bundl adjust preserv data condit epipolar geometri epipolar transform recal epipolar geometri notat state epipolar geometri project bundl adjust minimum paramet fundament matrix inhomogen updat estim call start optim process call cost function comput scale fundament set paramet updat updat sin updat sin recov canon plane recov tabl updat scheme motion epipolar pencil call epipolar transform denot point obtain epipolar pencil line repres homogen epipolar transform homogen map coordin obtain paramet includ optim process recov entiti figur epipolar geometri epipolar transform sturm recov entiti fundament matrix plane method epipolar pencil line intersect point epipolar denot intersect point relat call extend epipolar transform fundament matrix deduc shown plane form project matrix equat express extend epipolar transform form depend intersect line chosen ensur mean lie line priori deriv uniqu express extend epipolar transform fundament matrix imag transform ensur lie line intersect line view reason examin class imag transform form intersect line give mean estim transform ensur lie intersect line constraint wehav transform imag data cost function preserv optim charact bundl numer condit preserv converg properti data condit transform denot rigid rotat translat condit transform spread chang coordin center graviti imag point possibl rotat imag angl rotat show estim angl form intersect line line li imag rotat pass project bundl adjust minimum paramet te figur priori chosen intersect line transform rotat imag center center li remov author rotat intersect line line line pass imag center parallel sign distanc imag center choic simplifi notabl extend epipolar transform show comput transform pure center rotat move farthest intersect line farthest point rotat situat illustr optim rotat write te ke imag center note formula valid case lie rotat appli imag problem li close imag tend imposs build angl rotat estim simpli detect case set ident matrix rotat threshold order pixel distanc imag center algorithm comput tabl deriv extend epipolar transform chosen intersect intersect point write hp entri sturm step estim transform appli imag data make singular preserv data condit cost function threshold chosen order pixel set set tabl algorithm comput center imag rotat farthest intersect line repres hp epipolar transform appli ab cd easili verifi extent epipolar transform recov gp algorithm tabl experi simul data compar method exist simul data test bench consist point ly insid sphere radiu meter observ camera focal length number camera center sphere situat distanc meter baselin camera meter point gener project imag corrupt addit center gaussian vari standard deviat measur quantiti depict characterist bundl adjust comput time converg error versu standard deviat ad imag measur error current estim function time optim process plot correspond median valu trial bundl adjust initi valu obtain point algorithm triangul method compar project bundl adjust minimum paramet fundament matrix inhomogen epipolar geometri map subsequ recov canon project matric routin call iter optim step call cost function comput map coordin fundament estim appli imag transform imag fundament comput entri epipolar transform map coordin linear system equat form comput epipolar transform map set paramet store map indic recov epipolar transform form extend epipolar transform equat form fundament matrix equat form canon plane equat tabl approach base epipolar geometri subsequ recov canon project matric sturm svd free measur prevent gaug drift partial partial free gaug complet camera matrix imag standard deviat cpu time map svd free normal partial free imag standard deviat error converg map svd free normal partial free figur comparison time converg error converg versu vari imag method observ roughli method converg minimum cost function method slightli reliabl converg free partial free figur show roughli converg big dispar comput cost method method worst comput cost normal partial free method minim number paramet present svd lowest comput roughli clear result method comput cost converg properti order understand explain behaviour wehav measur number iter comput cost iter result shown found method free partial leav gaug drift freeli bad converg perform roughli method normal perform number iter smaller method involv solv costli linear system project bundl adjust minimum paramet imag standard deviat number iter map svd free normal partial free imag standard deviat cpu time iter map svd free normal partial free figur comparison number iter converg comput cost iter method present minim number paramet number iter comput iter low comput cost number iter free gaug method normal method explain method achiev lowest total comput cost show evolut error optim process time converg measur highli depend converg threshold consecut account abil algorithm reach converg experi conduct test bench level imag point posit pixel method base minim reach converg normal partial free method roughli time attain free method time experi real imag algorithm real imag case imag order cover possibl close imag pair imag camera posit shown initi valu structur motion comput case simul data result shown tabl combin imag pair estim time converg error converg result sturm time error map svd free normal partial free figur comparison evolut error camera posit observ scene figur real imag valid algorithm project bundl adjust minimum paramet view map svd free normal partial free averag tabl error converg time converg obtain combin pair imag obtain simul data make tabl show valu algorithm set imag pair product measur kind score algorithm respect test set imag rank converg properti comput partial free free test algorithm imag initi valu obtain regist view structur motion obtain camera matric view model gener homogen matric paramet map coordin result algorithm converg error pixel rel perform term comput time converg obtain case view studi problem minim constrain coordin frame recov structur motion special form camera matric classifi wai achiev categori present algorithm algorithm simpl implement compar exist result show perform term comput cost achiev result term converg properti exist algorithm constrain gaug mean perform algorithm recommend call svd simpl implement yield easi jacobian motion paramet algorithm sturm refer vision percept applic mobil scienc informatiqu horaud project structur motion view planar scene intern confer comput page juli faugera dimens uncalibr stereo european confer comput santa page pe mh wright practic hartlei defenc algorithm intern confer comput page june hartlei sturm triangul comput vision imag ri hartlei project reconstruct invari multipl imag transact pattern analysi machin octob reduc constraint theori experi intern journal comput algebra varieti multipl view european confer comput hanna direct recoveri shape multipl parallax base approach intern confer pattern page qt faugera fundament algorithm stabil analysi intern journal comput qt canon geometri multipl project view comput vision imag gaug invari project reconstruct fort error surfac structur motion technic project bundl adjust minimum paramet carlsson linear multi view reconstruct camera recoveri intern confer comput page juli hs sawhnei geometri planar parallax conferenceon comput vision pattern page rel canon model geometri applic transact pattern analysi machin cc editor manual fourth edit american photogrammetri remot fall common framework kinemat reconstruct motion deform object european confer comput page sturm trigg factor base algorithm project structur motion buxton european confer comput lectur note comput page april trigg plane tensor factor european confer comput page pf ri bundl modern synthesi vision theori lectur note comput page zhang determin epipolar geometri review intern journal comput march unit de recherch inria avenu de unit de recherch inria de campu rue du jardin bp cedex unit de recherch inria renn campu universitair de beaulieu renn cedex unit de recherch inria rocquencourt domain de voluceau rocquencourt bp le chesnai cedex unit de recherch inria sophia antipoli rout de bp sophia antipoli cedex inria domain de voluceau bp le chesnai cedex issn
Agents/1349 1 note theoret comput scienc page program agent volker roth fraunhof institut comput graphic dept secur technolog darmstadt abstract mobil agent secur young disciplin focu time write invent cryptograph protocol secur aspect mobil agent past experi show protocol flaw protocol remain unnot long period time game break fix protocol evolutionari process lead understand underli problem ultim robust secur system work publish break protocol mobil multitud protocol turn opposit true identifi flaw protocol corradi karjoth karnik includ protocol base secur protocol strengthen type attack launch kei mobil agent break secur protocol introduct paper inspir previou work ross anderson roger titl publish version abstract serv introduct alter origin text fit context mobil agent secur protocol system mobil agent protect confidenti integr data acquir agent distribut system identifi user authent involv protocol step hop exchang program size fairli easi absolut bug found routin year publish problem presenc hostil creat agent alter content messag task program mobil agent give answer publish elsevi scienc roth subtli malici wrong inconveni moment fascin hope lesson learn program agent tackl common problem program analyz cryptograph protocol mobil agent protect mean meet friend foe protocol flaw wai similar point anderson needham context program comput summar typic object protocol object mobil agent reveal trust host object agent protect acquir data host tamper data detect owner possibl host gener object protect featur mobil agent malici host host owner trust protocol address object address protocol target protect mobil agent mobil agent free respect hop dynam base data acquir execut attack follow gener variat combin execut cut attack host cut portion past agent data protocol run oracl attack host gener agent dispatch remot host agent transform requir cryptograph protocol combin pattern enabl attack cryptograph protocol case lead complet secur object case adversari forg replac subset protocol data make imposs owner detect tamper import observ protocol data acquir agent truncat author acknowledg attack control data return agent protocol failur write encrypt ciphertext symbol kei digit signatur written encrypt privat sign kei write refer bare signatur union signatur sign data assum ident signer extract signatur roth cryptograph hash input written note assum resist resist impli resist send messag write write confidenti channel concaten written refer entiti ev ev plai role alic plai role victim bob dave plai role addit entiti part protocol itinerari agent written alic host visit agent decrypt target state karnik tripathi target state mean protect confidenti data carri agent idea make data agent host trust respect data confidenti agent host order achiev encrypt public kei trust host target state target state sign origin agent target state receiv host inspect target state ciphertext decrypt host decrypt privat decrypt make agent illustr attack protocol loss assum target state singl encrypt public kei bob alic send agent ev hop bob return alic protocol start assum agent initi consist target state program attack straightforward ev strip copi target state agent sign target send agent bob innoc decrypt target state privat kei make result agent agent migrat back ev carri ev possess alic detect attack problem protocol due lack roth redund bob oracl alic includ identifi agent program uniqu agent design carefulli illustr mean malici state forg append addit target karnik tripathi append idea protect object agent object ad subsequ modif object detect owner protocol reli encrypt initi comput alic base random nonc nonc secret verif protocol return append defin object append append checksum updat signer append object host append oper place alic success decrypt extract verifi signatur object checksum equal initi nonc assum ev receiv agent cj ev collud server agent visit part loop itinerari ev discov checksum cj ev multipl choic truncat object grow fake stem agent add replac arbitrari object ml host order ev creat agent object add append checksum cj initi ev send agent bob agent insert target state migrat ev cut past target state back agent alic share program origin protocol signatur ident server append assum ident extract signatur append redund roth ev decrypt checksum privat public kei construct agent agent replac previou agent process repeat checksum ev agent bob detect cj publicli verifi encrypt public bob length estim number object append ev make bob reason suspici add sign object send bob long object properli sign matter sign lack redund ev host time sign checksum comput decrypt forg protocol stefanelli protocol call append present karnik tripathi fall prei type attack fake agent hop complet attack summar protocol agent π static code initi applic protocol data inform requir alic initi agent protocol requir nonc γ messag authent code µ initi valu chosen randomli agent add data applic protect host protocol protocol defin pn mn mn roth messag authent code serv chain relat bind result obtain agent obtain current host ident hop due chain attack execut append result star shape itinerari ev center obviou protocol data ev plan ahead step assum ev receiv agent obtain collud host result loop itinerari dave ev set mj pj mj pj mj pj ev send agent bob insert chosen hop dave insert random data discard return ev ev updat agent shown data acquir mj pj ev plan move attack order send agent dave ev suffici comput ev continu agent send resum normal execut underli weak multi hop protocol server oracl roth famili protocol publish famili protocol direct preserv integr confidenti data acquir agent gener scenario comparison shop agent visit number collect offer publicli verifi chain digit signatur publicli verifi chain digit signatur protocol defin mn cn dummi rn random salt make harder attack encrypt cn call chain relat deduc ident signer signatur pp signer deem owner agent author explicitli mention conclud owner agent secur protocol reli assumpt attack chang element mn chain reason attack oblig attack build complet chain agent remov chain element entri contrast honest prefix properti introduc yee pp import observ input previou chain relat assum ev receiv agent alic ev pick choic note free choic ij ev collect offer origin shop ij chosen order maintain chain valid ev ij ij ev throw increment pick chain relat encapsul offer build agent request offer agent bear signatur ev repeat process discret final satisfi collect encapsul offer past roth send agent alic fool forward agent sign charad carri hop ev stop attack hop stress problem ev truncat offer grow fake stem possibl acknowledg fact problem shop oracl gener offer term ev alic remark hold section alic blue red shirt prefer blue find ev shop offer blue agent red offer made agent return alic chain digit signatur forward privaci protocol chain digit signatur protocol forward privaci variat protocol discuss section order encrypt signatur comput swap goal arrang hide ident shop provid offer integr assur protocol defin mn sin cn problem resolv shop owner agent offer encrypt shop extract ident alic signatur dummi offer hidden author leav specul descript suffici detail point ident verifi easili signatur public kei certif ident bind assur certif public kei encrypt data assum ev receiv ev previou attack smallest number ev ij ev host agent case ev collect arbitrari sign offer agent includ offer ij cut chain append start fresh collect ij remain arbitrari order gener random nonc build chain relat consecut data chain relat comput ident entiti ev hand agent alic decid agent remain carri offer shop worth note roth integr assur protocol reli secreci associ mj ident shop sign offer mj mean privaci offer featur requir secreci itinerari requir truncat protocol data import abil set term offer return alic publicli verifi chain signatur remain protocol publicli verifi chain signatur protocol kei aspect protocol shop gener temporari asymmetr kei pair fly mean successor public kei certifi shop gener kei pair shop privat kei receiv predecessor sign partial chain public kei successor privat kei destroi subsequ temporari kei pair gener protocol mn oracl cn oracl protocol initi alic easi ev collect valid certifi temporari kei pair simpli dispatch agent promptli return ev transport bob send temporari privat kei χ certifi public kei assum ev receiv agent smallest number ev χ receiv ij exist ev cut encapsul offer collect kei pair shop fake includ shop start append arbitrari build protocol data consecut ident ev final chain relat entiti hand agent instanc alic roth protocol secur karjoth trust secur mean protect mobil agent distribut marketplac set equal section except shop trust hardwar tn issu certifi central market author ℜ market author act trust parti custom channel shop devic secur activ attack devic asymmetr kei capabl comput suitabl asymmetr symmetr messag digest devic public kei market authent public kei devic begin alic random set protocol continu tn tn mn sin tn mn final protocol shop send alic agent final encrypt alic decrypt verifi checksum consecut decrypt final verifi signatur assum ev run shop electron impli devic certifi market author ev receiv agent ev ev number encrypt equal number decrypt devic secret fact ev encrypt shuffl checksum begin initi checksum alic expect receiv match agent ev encrypt final checksum devic ev pass place devic expect receiv sign tn ℜ substitut offer roth devic extract secret kei encrypt public kei devic encrypt sign offer sign offer checksum pass back alic agent tn mn oracl comput ev pass public kei devic ev back devic tn leak result set sign offer mj encrypt secret kei ev construct valid return alic indistinguish ordinari run agent ev collect sign offer agent collect bob ev send offer tn offer tn mb offer encrypt devic return offer encrypt offer prepar ev attack checksum ev append offer collect agent attack simpler ev pass public kei devic devic hand agent case pass public kei return agent alic ev delet rearrang offer brought insert forg offer collect posit chain result mean protocol achiev forward integr claim author fact secur protocol fail softwar approach succe instanc chain mac protocol lesson learn hardwar improv secur ev touch encrypt offer hand agent shop pass agent return hop back alic roth protocol design problem mobil agent secur mobil agent control adversari possibl obstruct piec code send give answer subtli malici wrong inconveni moment order check protocol commit familiar devil pernici twist attack anderson needham gave rule thumb good bad quot clear encrypt produc number assum synonym ident princip essenti mean mention explicitli sign decrypt oracl continu quot entir section plea remain valid concentr mobil agent mobil agent compar activ pass entiti particip protocol import entiti owner particip gener begin end lengthi protocol run part demand autonomi agent underwai difficult notion timeout long attack carri valid period protocol data ident assumpt hold mobil cornerston secur protocol chess describ ident assumpt program attempt easili identifi person action safe assum person intend action assumpt fail appli mobil migrat agent malici virtu state assum agent properli repres intent subsequ hop state function program state program host visit ident assumpt held mobil agent alic send ident follow ev cut past protocol data agent instanc alic agent repres protocol anderson needham note distinguish protocol run lead roth import digit sign mobil code suffici assert agent ownership approach favor contemporari mobil agent system signatur code copi code code written agent instanc render agent protocol distinct desir sign credenti code base code ev potenti agent program agent program code base conjunct credenti refer code base alic sign static kernel agent includ code requir kernel uniqu agent protocol data bound kernel ident reliev burden write agent program easili mean malici state serv anchor protocol make harder legitim host oracl give sketch work section repair protocol problem repeatedli occur protocol legitim host oracl comput protocol data behalf adversari mobil agent system vulner type attack meant work human expect happen order valid author execut cryptograph servic provid agent agent server agent owner mean decid protocol data agent request process belong agent sketch approach suitabl solv problem approach bind confidenti data agent instanc bind verifi decrypt place slightli simplifi version protocol describ approach demonstr acquir mobil agent authent bound agent instanc alic immedi spot attempt fake protocol data bind confidenti data idea construct agent kernel ciphertext author host detect ciphertext brought agent belong agent assum ciphertext author host bob author host alic prepar agent roth kernel random number randomli gener secret long make chanc case found exhaust attack due time case sa public sign kei sign public kei assum ident deriv signatur signatur verif impli verif ident public kei mean public kei certif trust public kei infrastructur alic dispatch agent eventu migrat bob verifi signatur kernel verif succe bob recov privat decrypt kei comput verifi result counterpart kernel match bob decrypt make agent serv proof owner secret decrypt kei proof verifi entiti recov modifi break digit signatur agent encrypt data effect receiv agent plant egg bob plant egg instanc kernel uniqu ev tamper store place ev return design carefulli cope threat bind acquir data section construct agent kernel deriv uniqu implicit φ implicit kernel implicit za random number larg make chanc alic neglig agent kernel request bob sign protocol data bob comput valid context agent instanc implicit sign bind verifi alic return protocol data request agent reject note za requir agent program practic current time suffic anticip attack clock roth greatest trick devil pull convinc world exist motion pictur usual judg number respect public find mean world wide research basic cryptograph protocol protect mobil agent peter compar year reason protocol solv fair amount consid achiev approach area research analyz protocol object protect secreci integr data carri acquir mobil agent malici host protocol turn vulner combin cut past attack oracl exploit vulner stem fact design rule set year ago faithfulli improv analyz protocol order render robust type attack launch mobil agent kernel design uniqu identifi instanc mobil show kernel prevent legitim host oracl decrypt sign data brought acquir mobil agent improv protect gener truncat attack reach assum ev agent state ev receiv agent state ev reset agent state notion fresh discuss briefli section extern state control ev acknowledg karjoth comment initi improv inspir discuss evolv commentari refer ross anderson roger needham program comput comput scienc volum lectur note comput page springer david chess secur issu mobil code system giovanni mobil agent volum lectur note comput page springer berlin roth stefanelli mobil agent protect internet environ annual intern comput softwar applic confer page william joshua swarup secur mobil issu requir nation inform system secur confer page octob protect comput result roam agent rothermel intern workshop mobil agent volum lectur note comput page springer berlin septemb karjoth secur mobil merchant broker distribut marketplac kotz proc volum lectur note comput page springer berlin karnik anand tripathi secur mobil agent system technic report mn alfr paul van scott handbook appli cryptographi discret mathemat applic crc isbn volker roth mutual protect agent jan vitek christian secur internet secur issu mobil distribut volum lectur note comput page volker roth encrypt java archiv applic mobil agent secur frank dignum carl agent mediat electron european volum lectur note artif page springer yee mobil agent secur internet volum lectur note comput page
HCI/1350 4 low resolut text activ camera ocr paul justin lam depart comput scienc bristol england abstract read text scene context wearabl robot vision aid visual handicap peopl present automat text read system activ camera text region locat scene recent region text found determin optim zoom foveat number imag captur text region reconstruct mosaic region ed imag text good read human recognit ocr low resolut camera obtain good result high resolut ocr introduct locat understand text scene applic aid visual guid quick automat method transfer paper document electron form segment text scene rare dealt past ort concentr nding text overlaid imag tv program wu locat text real scene treat distinct textur textur segment techniqu segment text assum imag present method locat text real scene larg variat direct view scale text region text locat necessarili view plane stationari video camera tilt zoom control activ gener high resolut locat text region suitabl view read human fed ocr softwar packag text gener expect readi ocr concentr block paragraph low scale charact form major locat region standard indoor illumin assum system process text region plane camera view plane reason describ approach section run system overview input system region text locat earlier work region text treat individu text extract algorithm appli region turn rst zoom current region interest ed entir region frame averag height charact region inform guid determin partit region set tile segment tilt zoom tile segment separ obtain higher resolut partit partit nalli mosaic regist simpli ed cross correl perform fourier domain nal mosaic high resolut readi imag verifi result determin accuraci nal interpret simpl ocr packag extract text camera experi soni resolut camera dof rotat horizont zoom capabl calibr camera measur angl view sampl set zoom valu found measur repres quadrat model automat method zoom present calibr approach applic reason speed accuraci region initi segment comput centr graviti pan tilt camera region imag current zoom angl view determin refer quadrat model comput zoom horizont vertic direct minimum obtain optimum segment region shown figur optimum entir region adequ interpret text zoom section region obtain higher resolut patch mosaic gener high resolut imag figur initi text region text region camera pan camera zoom text region optim ts imag patch zoom resolut text low text small interpret zoom charact larg ocr softwar interpret larger imag process resolut camera ocr ideal charact pixel estim averag height charact determin zoom obtain charact approxim pixel height estim averag charact height ha imag edg map experi edg found simpl sobel lter maximum vertic edg approach make fact text region edg edg connect close threshold edg map binari imag vertic edg pixel threshold determin gradient imag work imag text region perform logic ve horizont pixel form block line simpli case morpholog dilat speci mask close gap charact averag height line form comput examin imag pixel vertic direct count length set connect pixel mode charact height height ha dilat process demonstr figur show part coupl edg line illustr algorithm charact height determin appli block text rotat partit imag text region occupi region size rx ry high resolut imag form scale figur threshold vertic gradient part special dilat logic set pixel region give cation accur ha mosaic overlap adjac partit imag reduc part frame number partit requir obtain run captur partit frame horizont camera tilt zoom shown figur patch form high resolut imag mosaic partit frame mosaic requir correct geometr deform elimin discard geometr correct assum camera su cientli text text plane adjac region translat di erenc templat match ectiv registr maximum simpli ed good indic locat posit templat detect instanc imag perform convolut multipl fourier fft restrict convolut number small sampl neighbour region overlap part partit final remark figur show reconstruct nal high resolut imag resolut fed high resolut imag ocr packag figur partit patch sidewai save figur final reconstruct imag text output ocr recognit figur origin imag nal ocr output text region obtain result shown figur measur accuraci ocr interpret express percentag correctli word input result ocr text engin process locat text zoom ocr nalli hear text tool visual impair sampl result word correctli shown figur anticip recognit rate upgrad camera ocr softwar futur work experi view refer automat text recognit digit video technic report decemb automat text detect track digit video ieee transact imag januari find text imag proc acm confer digit page acm juli clark find text region measur british machin vision page pl kittler target varianc optimum zoom set atr iee electron
ML/1351 6 layer learn peter stone manuela veloso comput scienc depart carnegi mellon pa abstract paper present hierarch machin learn paradigm layer learn appli task learn direct map input output principl intract exist learn algorithm hierarch task layer learn seamlessli integr separ learn layer learn subtask layer directli facilit learn higher subtask layer determin set train input output introduc layer learn gener form present full implement complex simul robot soccer introduct machin learn algorithm select hypothesi hypothesi space base set train exampl chosen hypothesi predict unseen exampl accur hypothesi map set input featur set output featur input construct inform domain output classif action research learn task learn direct map input output intract exist learn algorithm approach break problem hierarch learn layer layer facilit learn determin set train input output learn function enabl creation increasingli complex research sponsor part advanc research project agenc rome air forc materiel agreement number view document author interpret necessarili repres offici polici express air depart offic naval research unit state govern learn function call approach machin learn layer learn assum aspect task learn determin function specif domain includ autom hierarch decomposit task layer learn appli ml algorithm specif subtask characterist appli layer learn complex learn simul robot soccer rest paper organ lai gener principl layer learn paradigm introduc formal present layer learn simul robot illustr formal detail final relat layer learn previou research conclud layer learn tabl summar principl layer learn paradigm map directli sensor actuat tractabl learnabl hierarch task decomposit machin learn exploit data train adapt learn occur separ level output learn layer feed layer tabl kei principl layer learn principl layer learn design domain complex learn map directli input output layer learn approach consist break problem task layer concept acquir machin ing algorithm abstract solv local task principl layer learn increment approach hierarch task decomposit start process creat ml subtask continu reach highlevel task deal full domain complex learn granular subtask learn determin function specif domain task decomposit layer learn autom layer defin ml opportun domain principl machin learn central part layer learn exploit data order train adapt system ml train function difficult manual adapt task detail complet advanc chang dynam learn frozen futur learn learner adapt unexpect alter behavior execut task task decomposit choic machin learn method depend subtask principl kei defin characterist layer learn learn layer directli affect learn layer learn subtask affect subsequ layer ffl construct set train ffl provid featur ffl prune output set possibl illustr implement formal learn task identifi hypothesi class map set state featur variabl set output base set train repres unseen exampl layer learn complet learn task hierarch subtask layer fl layer defin input vector state featur relev learn subtask set output subtask set train exampl learn subtask element consist correspond input featur vector ml algorithm layer select hypothesi map base result run function set principl layer definit layer priori principl address stipul directli affect ffl construct featur ffl construct element ffl prune output set note definit consist featur construct gener version special case layer task decomposit assum priori layer learn combin algorithm learn abstract level algorithm learn task decomposit domain object metric compar decomposit appli layer learn task decomposit quantifi result perform measur util output implement illustr layer learn implement state principl layer design domain learn straight input output tractabl simul robot soccer robocup soccer server al domain attempt monolith learn agent behavior soccer server luke al al set creat complet learn team agent genet program ambit eventu scale back player skill creat hand basi learn result learn team won game intern robot soccer simul lose round genet program attempt learn entir team behavior made teller agent learn directli sensori input make impress progress challeng natur entri unabl advanc past round tournament layer learn approach contribut success intern competit team made won competit report empir valid individu layer layer learn implement simul robot soccer robocup soccer server al basi success intern competit research challeng al present detail fulli domain teammat adversari hidden mean agent partial world view moment agent noisi sensor mean perceiv world affect world intend percept action cycl prohibit tradit ai paradigm perceptu input trigger action commun opportun agent make action teammat result state transit unknown refer qualiti unknown state transit opaqu transit domain characterist combin make simul robot soccer realist challeng domain layer learn robot soccer task robot soccer agent retriev move ball decid dribbl pass shoot goal task encompass entir robot soccer task decid dont import part complet task task learn ball pass pass select hierarch layer learn creat effect team agent behavior tabl illustr set learn behavior level simul robot soccer domain identifi skill learn move strategi build creat team behavior full detail train test learn behavior report ball intercept individu skill agent learn individu skill control ball effect execut abil intercept move robust skill sophist team member agent architectur contribut significantli layer behavior type individu ball intercept pass evalu team pass select tabl exampl behavior level robot soccer ball requir due presenc block intercept oppon shot pass receiv pass teammat prerequisit behavior chose agent learn behavior easier collect train data behavior hand defin agent learn action base ball current distanc angl ball distanc fix time past agent angl turn intercept ball train procedur ball intercept involv stationari forward repeatedli shoot ball defend front goal defend collect train exampl act randomli notic successfulli stop ball test exampl classifi save goal miss wide neural ball intercept train neural network sigmoid hidden unit learn rate weight connect input hidden layer linearli weight decai start linear output unit weight decai neural network train epoch train intercept tabl show effect number train exampl learn save percentag train defend stop shot goal miss compar save rate achiev analyt ball intercept behavior veloso pass evalu behavior agent learn skill part behavior train behavior agent ball learn earli implement soccer server agent receiv veloc inform ball train save exampl tabl defend perform neural network train number train exampl option pass idea pass succe teammat successfulli receiv evalu depend teammat oppon abil receiv intercept pass creat train exampl equip intend pass recipi oppon learn chose agent learn capabl easier collect train data construct hand defin set continu ordin featur possibl affect pass evalu encod larg set attribut repres rel posit teammat oppon field statist count reflect rel posit veloso potenti pass receiv classifi success confid factor failur confid factor miss train procedur pass evalu involv passer execut pass teammat oppon train scenario illustr screen shot soccer server figur dash line region teammat oppon randomli intend pass recipi oppon learn trial classifi success teammat intercept failur oppon intercept miss player intercept pass random pass success learn pass tree train algorithm figur train scenario pass evalu dash line region teammat oppon randomli prior trial default paramet tree chosen neural network abil ignor irrelev attribut train train tree return predict classif confid result tabl tabul result indic train tree enabl passer successfulli potenti receiv result breakdown passer confid prior pass passer forc pass predict failur teammat pass teammat lowest likelihood failur pass pass predict succe high confid success success result success failur miss tabl result trial passer dt receiv result percentag number case fall confid interv pass select collabor adversari team behavior agent learn capabl creat input space output set learn pass select agent decid teammat pass ball depend huge amount inform includ agent current locat current locat teammat teammat abil receiv oppon abil intercept teammat subsequ oppon strategi merit measur perform team drastic reduc input space learn posit player pass evalu pass teammat consid defin fp input consist geograph compon featur veloso pass featur result execut receiv result pass select shot goal pass teammat train exampl gather individu team member real game individu agent learn separ partit posit field agent learn base observ effect action action elig member prune base pass predict succe consid train pass veloso reinforc learn method motiv applic domain simul robot soccer default paramet report veloso distribut test learn directli compar team ident behavior polici agent team begin pass agent team adjust behavior base experi agent continu pass randomli figur demonstr effect learn pass polici discuss learn layer illustr principl layer learn shoot agent option dribbl goal game number cumul goal game number learn random figur total goal score learn team plai randomli pass team independ variabl number game ffl decomposit task smaller subtask enabl learn complex behavior learn straight agent sensori input ffl hierarch task decomposit construct fashion ffl machin learn method chosen creat suit subtask question exploit data train difficult behavior intercept pass adapt chang circumst ffl learn layer feed layer provid portion behavior train intercept pass creat input prune action space evalu pass relat work origin hierarch learn construct improv gener singl learn task run multipl learn process boost stack gener improv function gener combin result gener run gener approach contrast layer learn layer layer learn deal task boost stack gener potenti layer line type hierarch learn discuss paper hierarch reinforc learn algorithm reinforc learn rl research interest hierarch learn approach survei moor hierarch rl approach gate collect behavior map environ state action gate function base state behavior action switch execut moor case behavior learn connel case gate function learn brook case learn behavior learn fix prior learn gate function hinton maxq algorithm learn level hierarchi simultan constant approach behavior gate function control task similar input action rl layer layer learn input learn method implement complex domain rl layer task decomposit construct manual attempt challeng task learn task decomposit nest gener hierarch control structur learn lowlevel skill time learn select hierarch rl test small problem order state paper present layer learn paradigm robot soccer domain agent behavior gain possess act ball learn ball pass pass select agent behavior agent ball learn creat behavior mean layer learn implement extend handl situat learn strateg posit strateg adapt strateg posit strateg adapt behavior construct ffl simul robot soccer agent stai fix format switch posit strateg posit adjust train observ reinforc learn ffl train fix oppon train behavior varieti polici learn opportun match current oppon similar past oppon quickli learn polici adopt current layer learn robust skill sophist team member agent architectur incorpor flexibl teamwork structur contribut success complet team simul robot soccer competit robot soccer world cup team made field team team won field team report full detail individu learn layer empir valid detail test layer learn learn task complex effect monolith learn appar orthogon robot natur languag understand applic layer learn natur learn understand clear hierarch task decomposit learn word disambigu facilit learn sentenc turn facilit semant encod sentenc paragraph gener learn sentenc semant straight string hierarch decomposit task coupl layer learn paradigm render learn task tractabl layer learn potenti applic complex learn problem hierarch decomposit exist refer refin soccer agent posit reinforc learn robot soccer world cup springer verlag evolv team darwin unit robot soccer world cup ii springer verlag reinforc learn advanc neural inform process system san morgan kaufmann maxq method hierarch reinforc learn fifteenth intern confer machin learn morgan kaufmann emerg hierarch control learn relationship reinforc environ intern confer simul adapt mit press reinforc survei journal artifici intellig research robocup synthet agent challeng fifteenth intern joint confer artifici san morgan kaufmann genet program mit press reinforc learn robot neural network phd school comput carnegi mellon pa soccer softbot team coordin genet program robot soccer world cup springer verlag learn coordin behavior eighth nation confer artifici morgan kaufmann scale reinforc learn robot exploit subsumpt architectur eighth intern workshop machin soccer tool research multiag system appli artifici intellig program machin learn san morgan kaufmann strength weak learnabl machin learn layer approach learn client behavior robocup soccer server appli artifici intellig team opaqu transit reinforc learn intern confer autonom agent layer learn system phd comput scienc carnegi mellon pa technic report stack gener neural network
DB/1352 3 static dynam inform organ star cluster daniela ru depart comput scienc dartmouth colleg nh abstract paper present system static dynam inform organ show evalu system trec data introduc star cluster algorithm inform organ evalu experi show line star algorithm outperform singl link averag link cluster algorithm star algorithm highli simpl advoc task requir inform topic topic detect introduct modern inform system vast amount unorgan data chang dynam flow inform arriv continu aggreg organ cnn stori stori previou stori type stori make previou report obsolet focu regularli flow inform dynam user locat inform quickli current inform system inqueri smart alta vista provid simpl autom comput rank list user scan list hundr document titl cull critic inform larg set potenti dynam method organ inform highlight topic content collect reorgan data adapt incom flow document inform organ algorithm support increment inform process task topic track topic detect stream document present system static dynam organ inform evalu system trec data introduc onlin star cluster algorithm inform organ describ method visual plane captur rel content evalu experi show star algorithm outperform singl link averag link cluster algorithm star algorithm highli simpl advoc task requir inform topic topic detect previou work extens research cluster applic domain good overview good overview cluster inform retriev cluster inform retriev driven cluster hypothesi state relev document tend close relat document made determin cluster hypothesi valid discuss evalu cluster hypothesi hold show neg result croft describ method cluster search shown outperform full rank system cranfield collect singl link method provid topic similar cluster jardin van rijsbergen show evid search result improv cluster hearst pedersen cluster hypothesi scatter system conclud hold task system provid mechan organ data fix number user feedback requir comput cluster accuraci scatter fraction comput cluster recent al dynam cluster algorithm partit collect text document fix number cluster number topic dynam inform system gener fix number cluster gener natur partit inform work work cluster present paper describ simpl increment posit evid cluster show task requir dynam adjust topic content collect topic detect topic track algorithm cluster static inform version algorithm cluster dynam inform algorithm comput cluster induc natur topic structur space work fix number cluster constraint solut lower bound topic similar document cluster comput accur formal cluster problem cover threshold similar graph cliqu cover cliqu intract larg document collect recent result shown problem approxim polynomi time cover subgraph cover comput static data dynam data show algorithm produc cluster run time algorithm roughli linear size similar graph defin inform space deriv lower bound topic similar cluster star provid theoret evid cluster produc star cover packag algorithm system support static inform dynam inform rout system contribut visual topic cluster disk radii proport size cluster plane captur topic distanc cluster provid data onlin topic organ result trec collect star cover exhibit perform improv singl link averag link method respect common cluster qualiti sacrif simplic util algorithm organ inform system wai algorithm step static inform system step specif document retriev queri system assist user decid free text document highlight relev topic irrelev subtop cluster data narrow detail queri formul system classifi retriev data cluster captur topic categori subcategori algorithm star identifi potenti cluster construct inform rout topic topic track inform organ begin present algorithm organ inform describ system built includ user interfac design visual techniqu present perform evalu organ algorithm begin examin organ problem introduc star algorithm star algorithm formal problem repres inform system similar graph similar graph weight graph vertic graph correspond document weight edg graph correspond measur similar document measur similar document cosin metric vector space model smart inform retriev system complet graph edg vari weight organ graph produc reliabl cluster similar cluster document similar obtain threshold graph perform minimum cliqu cover maxim cliqu result graph threshold graph undirect graph obtain elimin edg weight lower minimum cliqu cover featur cliqu cover similar document cluster desir similar minim cliqu cover maxim cliqu vertic belong cluster inform retriev applic desir featur document multipl algorithm comput cluster evalu figur show result star overlap cluster star overlap cluster small approach tractabl real similar graph larg cliqu cover problem admit approxim algorithm perform cliqu cover approxim cover graph subgraph lose similar gain comput section section describ cover algorithm analyz perform approxim cliqu cover cover threshold similar graph subgraph subgraph vertic consist singl star center satellit exist edg star center satellit vertic find cliqu threshold similar graph similar document glanc find subgraph provid similar star center satellit similar threshold vertex initi unmark calcul vertex highest unmark vertex star center construct cluster star center satellit vertic mark node newli construct cluster repeat step node mark repres cluster document star center figur star algorithm satellit vertic investig geometri problem vector space deriv lower bound similar satellit vertic provid formula expect similar satellit vertic formula predict similar satellit vertic subgraph empir evid support conclud cover subgraph reliabl method cluster set document star algorithm base greedi cover threshold similar graph algorithm summar figur star algorithm show star algorithm correctli implement threshold similar graph run time algorithm linear size input graph cluster qualiti argu cluster produc star cover high averag similar cluster produc accur high qualiti document vertic subgraph satellit vertic star center definit subgraph similar similar vector space similar obtain cosin angl vector document angl angl note angl lower bound similar satellit vertic subgraph theorem similar graph satellit star respect similar star center star similar sin sin conclud similar satellit vertic analysi base absolut similar satellit vertic higher studi determin expect similar satellit vertic assumpt document essenti perturb vector proven medlin squar error figur figur show actual predict error abstract subset medlin theorem similar graph satellit star respect similar star center star expect similar sin sin previou formula predict similar satellit vertic approxim test formula real result test medlin data set shown figur similar cluster center satellit actual squar predict error formula similar satellit vertic note root squar error small worst high error neglig test real conclud formula accur subgraph impli high similar document note sin figur screen snapshot cluster experi top window queri window middl window consist rank list document retriev user queri user select fetch document request graphic visual cluster bottom window left graph displai document dot circl cluster separ gap edg denot pair document similar fall slider paramet graph displai cluster disk radiu disk proport size cluster distanc disk proport similar distanc cluster system implement system organ inform star algorithm organ system experi paper consist augment version smart system user interfac implement star algorithm top smart index document smart search engin cosin normal weight scheme enhanc smart comput document document similar matrix set retriev document collect similar matrix comput cluster visual cluster user interfac implement organ system run collect document retriev user queri user input queri type free text choic corpora system support distribut inform paper focu distribut assum central locat corpu user smart invok produc rank list top relev locat similar inform similar inform entir collect comput queri engin provid input star algorithm algorithm return list cluster mark center visual develop visual method organ data present user view data figur list text graph show similar relationship graph show similar relationship cluster view provid user summari data level detail document facilit topic structur connect graph view node retriev document node node cluster gap node identifi cluster easili edg node color code similar document slider bar user establish minim maxim weight edg shown view present cluster disk size proport size cluster distanc cluster defin distanc central document captur topic separ cluster simul anneal find cluster placement minim sum rel distanc error cluster select cool schedul initi temperatur freez point set good placement number cluster return algorithm small algorithm run time depend number cluster number cluster method euclidean graph view titl window user select individu document cluster select made window simultan reflect perform comparison cluster algorithm order evalu perform test star algorithm classic cluster singl link method averag link method data confer test medium trec collect set document ascrib relev data respect topic document partit separ subcollect approxim document topic subset document relev topic goal cluster method organ set document subset document select topic cluster organ perform experi select set document organ cluster method cluster topic return issu immedi measur cluster determin appropri gener cluster measur qualiti common measur defin standard recal cluster respect set document relev topic note simpli minu harmon rang correspond perfect recal correspond recal worthwhil note view data compar cluster lower valu correspond perform order compar cluster method method run produc cluster respect defin measur previou compar cluster shaw case singl link star cover algorithm run rang cluster obtain threshold return view cluster obtain respect threshold hierarch cluster cluster hierarchi return case algorithm natur produc hierarch cluster hierarchi return unlik star singl averag link algorithm overlap cluster suggest perform attribut overlap actual properti algorithm investig issu conduct experi version star cluster algorithm elimin overlap cluster set star algorithm find set star partit collect assign document closest star center methodolog note result star overlap cluster star overlap cluster small algorithm outperform singl link averag link figur subcollect document correspond individu experi cluster algorithm emploi determin cluster defin topic optim recal valu calcul respect actual set document relev star star averag link singl link coll avg figur figur show comparison data star partit star singl link averag link algorithm subcollect trec document repres averag comput cluster found repres averag recal comput cluster found aggreg measur cluster star singl link figur figur show measur partit star cluster algorithm singl link cluster algorithm axi show axi show cluster number cluster sort valu star algorithm valu averag topic obtain number report experi cluster method figur averag find valu partit averag link singl link star algorithm repres improv perform respect averag link improv respect singl link partli due overlap cluster partit star algorithm improv perform averag link singl link cluster star averag link figur figur show measur partit star cluster algorithm averag link cluster algorithm axi show axi show cluster number cluster sort valu star algorithm repeat experi collect valu star averag singl link note measur algorithm larger collect star algorithm outperform averag link singl link figur show detail valu star algorithm singl link algorithm star algorithm averag link algorithm collect experi cluster comput algorithm readabl sort cluster produc star algorithm valu plot valu singl link algorithm oscil line figur averag link algorithm oscil line figur note valu star cluster lower valu singl link averag link star algorithm outperform method experi show star algorithm outperform singl link averag link method star algorithm simpl implement highli star algorithm inform organ text cluster applic inform organ figur figur show star cover chang insert vertex disk denot star disk denot satellit vertic star edg denot solid line edg denot dot line top figur show initi graph star cover middl figur show graph insert document bottom figur show star cover graph section algorithm comput organ dynam inform system deriv version star algorithm inform organ increment comput cluster similar document continu assum vector space model cosin metric captur similar document corpu star algorithm assum document insert delet collect time focu discuss ad document collect delet algorithm similar intuit increment comput star cover graph vertex insert depict figur top figur denot threshold similar graph correct star cover graph vertex insert middl figur origin star cover longer correct graph bottom figur show correct star cover graph addit vertex correct star answer depend vertex adjac list adjac list vertex star vertex ad star cover star center adjac list vertex center vertex vertex satellit vertex case destroi correct star cover vertex adjac collect star lower vertex star structur place modifi assign vertex star center satellit vertic star broken result motiv intuit previou describ algorithm increment comput star cover dynam graph algorithm shown figur algorithm special data structur maintain star cover undirect graph vertex maintain data satellit center list adjac vertic list adjac center flag process note infer infer conveni piec data algorithm vertex ad list vertic adjac algorithm figur appropri updat star cover detail correct argument analysi shown star cover produc onlin star algorithm correct ident star cover produc algorithm correct star algorithm initi implement star algorithm heap prioriti queue simpl link list list requir time requir insert vertex edg threshold similar graph appropri updat star cover larg govern number star broken break star requir insert element prioriti queue star broken updat figur due partli fact star exist time compar number vertic edg threshold similar partli fact likelihood break individu star small satellit foral true endif endfor true center foral endfor center foral endfor foral satellit foral true endif endfor endfor endif endif endwhil figur star algorithm cluster evalu star cover algorithm document corpu consist judg subcollect trec document augment depart technic report ran experi time select threshold insert document random star cluster algorithm result experi averag run time measur linear number edg similar graph figur show data note number broken star roughli linear number run time linear number edg lower order term aggreg number star broken number vertic figur depend number broken star number vertic trec data aggreg run time number edg figur figur show depend run time star algorithm number edg trec subcollect discuss evalu star cluster algorithm inform organ version algorithm organ static inform accur cluster effici version algorithm organ dynam data task requir increment updat topic structur rout topic detect topic track task implement algorithm contribut visual method cluster present user disk radii correspond cluster size plane captur topic distanc cluster evalu star algorithm compar singl link averag link algorithm experi trec data found star algorithm outperform singl link algorithm averag link algorithm star algorithm faster easier implement averag link advoc algorithm produc cluster algorithm evalu star algorithm suggest star algorithm task requir comput topic structur increment adapt find suggest star algorithm varieti task conduct experi star algorithm topic detect topic track cluster increment algorithm lead improv result solv task acknowledg jame allan comment suggest research work support part onr contract rome lab contract air forc muri contract grate support refer cluster allan automat hypertext construct phd thesi depart comput cornel januari person march evalu cluster inform principl digit document ed lectur note comput verlag technic report depart comput comput cluster inform technic report depart comput random academ retriev cluster algorithm function index journal american societi inform scienc increment cluster dynam inform acm transact inform increment cluster dynam inform symposium theori croft model cluster search base classif inform croft cluster larg file document method journal american societi inform novemb pedersen constant larg document collect feder optim algorithm approxim symposium theori pp hearst pedersen reexamin cluster retriev result unifi approach approxim algorithm bottleneck journal jain dube algorithm cluster prentic hall jardin cj van rijsbergen hierarch cluster inform inform storag subgraph annual symposium foundat comput scienc rabinovich geometri graph algorithm applic lund yannakaki hard approxim minim problem journal acm cj van rijsbergen inform retriev salton automat text retriev inform salton smart document retriev project fourteenth annual intern confer research develop inform pp foundat journal american societi inform vol pp control uncontrol subject descript cf comparison optim retriev inform process vol pp spark jone jackson keyword classif inform retriev inform storag turtl infer network document retriev phd thesi cj van rijsbergen document evalu experi cranfield inform process agglom hierarch cluster document phd depart comput cornel tr cluster hypothesi revisit pp willett recent trend hierarch document critic review inform process queri cluster larg document space ed smart retriev pp problem version hard approxim annual structur complex theori ieee comput
IR/1353 5 improv categori specif web search learn queri modif eric glover gari flake steve lawrenc william birmingham kruger lee gile david pennock nec nec research institut eec depart inform scienc technolog independ michigan pennsylvania state nj ann mi pa abstract user search document specif categori gener search engin difficult time find valuabl document improv categori specif show train classifi recogn page categori high text html structur show queri modif web search engin probabl document return specif categori evalu effect queri modif real search show approach highli effect locat person homepag call paper introduct typic web search engin index million page varieti return result rank expect topic relev small percentag page specif person call paper user examin larg number page desir categori describ methodolog web search classifi recogn web page specif categori learn modif queri bia result document categori develop metasearch tool effect retriev document includ person call research product guid faq document specif step train support vector machin classifi page membership desir categori perform improv addit word document html structur simpl word locat inform word top learn set queri modif queri modif set extra word phrase ad user queri likelihood result desir categori rank top search engin respond classifi automat evalu result search produc rank search engin queri modif pair approach differ perform train set search larger unknown order polici background primari tool locat materi web search engin strive index larg subset web addit search search metasearch crawler advanc tool design user find materi web web search typic search engin input user queri return result believ topic system support field base constraint url altern approach user subject hierarchi subject hierarchi typic creat human coverag larger search engin search engin northern light approach call organ search result categori result organ desir categori fix user manual filter result northern light user categori prior search light distribut algorithm user unabl evalu result search engin rule limit search engin low coverag entir web approach improv coverag combin result multipl search engin metasearch engin metasearch engin coverag web februari popular metasearch engin includ savvysearch metacrawl typic metasearch engin consid summari url search result limit abil assess relev predict categori result metasearch inquiru download result consid full text html document make relev judgment approach easili extend improv metasearch engin sourc base user desir metasearch engin savvysearch user subject categori search engin specif sourc improv exclud search engin valuabl result improv user abil find relev document specif inquiru extend inquiru inquiru figur add abil perform sourc select queri modif knowledg inquiru queri learn procedur paper procedur autom process sourc queri modif yield result topic relev desir categori classifi predict inform sourc select queri modif prefer set polici analyz retriev inquiru metasearch engin prove web search queri make search queri modif queri modif concept process call queri reformul relev feedback enhanc search system queri modif intern queri submit user modif includ chang term make remov ad extra term goal intern queri repres user knowledg content simpl user type jordan user queri michael jordan reduc chanc document return countri michael jordan mitra al describ automat approach discov extra queri term improv search basic relev feedback retriev initi set possibl relev discov correl featur expand queri unlik attempt focu relev entir set result consist user origin effect queri modif gener work assum user concern topic specif categori present relat work includ watson project integr metasearch tool modifi queri gener search engin make result consist result special search engin svm web page classif categor web page problem svm classifi handl larg shown highli effect compar method text classif descript svm set data input yi target output svm calcul weight sum kernel function output kernel function svm written function obei mercer condit case output svm defin object function subject box constraint linear constraint yi defin constant repres balanc model complex approxim error equat singl minimum respect lagrang minimum equat found famili base constrain quadrat program variat platt sequenti minim optim algorithm experi equat equat classif margin maxim train set case linear kernel tion svm find boundari balanc class ari class nonlinear margin classifi maxim kernel function result nonlinear classif boundari research addit text mean cluster classifi web page work assum determin class page base sole raw access inbound link page train exampl set search engin test queri number result rank list search queri modif tupl gener set featur train svm classifi top featur select set queri remov duplic redund modif qm set test modif qm return tabl queri modif infer procedur procedur tabl show main queri modif infer procedur algorithm train svm classifi label data algorithm automat gener set good queri rank expect recal learn classifi evalu queri modif real search rank order queri search engin tupl produc classifi tupl incorpor inquiru improv web search train classifi train binari classifi accur recogn posit exampl categori low rate train convert train document binari featur requir set reason featur svm classifi handl thousand ad featur low reduc generaliz classifi reduct perform initi featur set unlik typic text phrase underli html limit text locat inform document bold mention anchor sentenc document ad special featur captur url person directori tabl describ resent document featur initi reduct featur person rare featur occur code descript titl word phrase ts occur term document occur occur word special charact occur url path uf word special charact occur file portion url occur special symbol captur person top titl document vector type remov classifi perform step process reduc number featur user level remov featur occur percentag document featur remov occur requir percentag posit neg set posit exampl set neg exampl document featur document featur threshold posit featur threshold neg featur rank remain featur base entropi loss stop word list expect entropi loss entropi comput independ featur event indic document member categori document person denot event document featur prior entropi class distribut lg lg posterior entropi class featur present posterior entropi class featur absent ej lg expect posterior entropi expect loss probabl fix expect entropi loss synonym expect inform nonneg featur meet threshold sort expect entropi loss provid approxim individu featur approach correctli assign low score featur common binari classifi queri modif work mitra goal queri modif identifi featur enhanc queri unlik extra inform user intent form label data label data fine learn modif topic queri fall categori train set convert binari featur gener set queri modif featur field usabl search url featur occur full text top word gener rank list queri score queri modif expect recal defin qm set queri combin featur user desir minimum comput priori probabl random result search engin desir probabl random document train set posit set differ priori probabl distribut train add paramet defin tabl show algorithm rank queri modif set queri modif singl queri set qm set document posit featur set document neg featur factor priori probabl user provid paramet minimum desir rank list qm foreach qm comput predict end foreach return sort tabl initi rank queri modif algorithm return rank list expect queri modif meet measur measur recal knowledg result classif typic queri modif approach strive maxim queri modif overli constrain result high low recal feel rank queri modif expect recal long minimum requir user search specif page individu set homepag peopl low recal make desir page found relat recal approach user control balanc minimum level score queri modif engin search engin respond queri distribut document user homepag person work homepag peopl ford queri modif search engin rank search queri modif repres test queri appli classifi result tabl show simpl algorithm rank set search engin queri modif start set sampl queri rank base number valid document return classifi true learn list search engin queri test paramet rank list foreach qm qm end foreach end foreach return sort queri modif search engin test queri rel score tupl score foreach result url search engin se queri nil true score score end lo end foreach end foreach return score tabl function score pair classifi test queri paramet control result consid search engin queri result harm accur captur effect tupl defin train set queri modif singl web page search se search engin queri submit search qm set test download page respond url error defin function return true page url desir categori algorithm comput score hundr test queri ten thousand learn classifi consid dition word reduc chanc singl featur page classifi true svm design reduc chanc singl small set featur domin featur ts home page page tabl top featur person page top queri predict recal sibl queri caution run larg avoid send larg number queri search engin reduc burden search ran algorithm altern search engin quest small subset set rank queri queri modif comparison result test chose person call paper assum user start subject find set page desir categori case start dataset posit neg person homepag call initi dataset split train test svm evalu lap url train test set gener rank list queri evalu algorithm tabl classifi perform low person homepag call paper highli effect queri modif form naiv cover person homepag person homepag difficult concept defin object definit page made individu individu intent entri point inform person person person accept person dedic homepag interest corpor endeavor page manual redirect entri page imag gaussian classifi score rang figur distribut score svm test data person homepag call small amount remov start set posit neg exampl posit list creat classifi page includ person home page list research isp site offer person gather friend colleagu neg exampl page select log inquiru pass algorithm run gener classifi appli neg set identifi train set creat posit url remov page prevent classifi result posit exampl neg page randomli select train set remain posit neg exampl test set classifi paramet reduct threshold posit neg featur meet threshold top rank expect entropi loss set tabl show top featur rank entropi loss top queri rank algorithm tabl minimum ment test appli test note major page list result server network person homepag rank queri mod search prec eng fast av googl av av fast av googl mod av mod googl mod fast tabl summar result queri cation appli search engin sourc posit neg exampl categori open classifi accuraci person homepag present list person homepag misclassifi accuraci test gaussian posit neg classifi test train set accuraci queri modif gener test queri modif algorithm tabl tabl list top queri modif predict recal test queri chose search fast googl chose test cat test queri resum tabl show result tabl show wide variat search engin queri queri queri modif work poorli middl fast queri modif work perform significantli altavista perform altavista return result person home page naiv correct syntax ad stop gener queri tion googl perform fast altavista highli rank learn note rank queri modif depend choic test set test queri produc rank queri modif search engin call paper good call paper typic titl describ list program deadlin submiss inform obtain list cfp combin url list cfp result multipl search engin varieti queri yield page start set manual classifi call neg consist url inquiru confer relat page train set consist posit neg limit page remain posit neg exampl form test set classifi paramet reduct threshold posit neg featur featur meet top expect entropi loss set occur test svm appli test set person neg set test gaussian kernel accuraci posit neg person homepag train open directori categori accuraci creat set posit call paper confer site accuraci lower accuraci test set due larg number foreign page basic structur train set page queri modif person learn gener test queri queri mod search eng googl fast author fast googl author googl fast av av mod googl mod fast mod av tabl result queri modif call paper appli search engin modif algorithm ble queri modif call top queri modif roughli predict recal minimum requir test queri chose search fast googl test chose test languag algorithm test queri queri modif queri modif call notif tabl show result classifi call queri result queri modif call paper consist search engin person fast googl ident score queri modif modif fewer result call paper naiv modif perform googl highest naiv modif fast altavista learn modif perform highli rank naiv search engin chang order polici result chang summari futur work user specif inform categori find difficult locat relev result search engin present autom method learn queri modif result high reason expect person homepag call paper learn queri modif shown person homepag call paper compar queri modif classifi shown identifi posit exampl accuraci person homepag call paper naiv queri modif perform recommend algorithm classifi train automat extract featur word html simpl locat featur textual correspond implement simpl method reduct larg featur space expect entropi loss threshold simpl method appli measur effect queri modif individu search engin result search person individu search engin vari significantli respect ident queri call variat variat due differ individu search engin individu order polici goal explor method automat train set discoveri user initi provid posit train url approach enabl user easili gener categori inquiru acknowledg fran bob krovetz assist work work partial fund nsf contract refer inform theori code jai kristian hammond anticip contextu inform annual meet american societi inform indyk enhanc hypertext categor hyperlink sigmod record special interest group manag june van der dom approach web resourc discoveri fran steve lee marco gori crawl context graph intern confer larg vldb septemb gari steve lee gile effici identif web sixth intern confer knowledg discoveri data mine acm press susan mario gomez intellig fusion distribut search engin journal comput eric steve william lee gile architectur metasearch engin support user inform eighth intern confer inform knowledg manag page kansa novemb acm press david grossman frieder inform algorithm heurist kluwer adel daniel engin learn search engin queri ai thorsten joachim text categor support vector learn relev featur tenth european confer machin learn page jame kwok autom text categor support vector machin intern confer neural inform process page steve lawrenc lee gile context page analysi improv web search ieee internet page steve lawrenc lee gile access inform web amir chri bucklei improv automat queri acm sigir melbourn acm platt fast train support vector machin sequenti minim optim advanc kernel method support vector learn mit platt analyt qp speed train support vector machin advanc neural inform process selberg etzioni metacrawl architectur resourc aggreg web ieee cj van rijsbergen inform edit dept comput vapnik natur statist learn theori springer
IR/1354 5 core middlewar support mobil system gian pietro picco dipartimento di politecnico di milano da itali abstract comput avail wireless steer distribut system scenario comput increasingli dynam reconfigur popular demand applic exploit mobil interact symptom chang larg applic built ad hoc architectur stick tradit fulli captur support peculiar requir scenario present call design gear mobil system paper present model underli discuss architectur descript current implement introduct year wit grow interest paradigm comput increasingli decentr exhibit high demand flexibl reconfigur brought research problem involv larg number compon physic distribut oper autonom grow interest coordin multiag middlewar result situat problem support highli decentr distribut comput complic evolut commun technolog wireless commun mode exploit network user connect fix network physic connect submit remain connect movement addit refer base station radic mobil set user complet bypass fix network exploit opportunist form network typic call ad hoc network commun enabl level uniqu mobil host highli decentr comput mobil evid tradit paradigm longer suffici tight coupl client reli perman avail paradigm accommod requir scalabl flexibl pose distribut impract mobil scenario physic logic structur network made extrem fluid connect paradigm research commerci system napster exampl applic enabl distribut applic user share transpar connect peer inform resid local spur round hype reason motiv shift user directli host resourc share publish server inform servic longer gather singl point accumul peer subset global servic applic support mode exploit network forc user find server queri global space inform kei featur heavili decentr satisfi requir pattern interact internet user experi daili time search engin find specif web server motiv stronger ad hoc part pictur interact simpli constitut fundament mode commun forc network environ abil queri global space tion assum greater set connect peer kind refer peer quickli obsolet interest note develop applic larg ad point provid user implement exploit central approach scene concept applic program interfac support abstract simplifi develop applic specif system similar hold mobil comput middlewar applicationspecif coda bayou gear network layer problem address paper simplifi develop mobil applic middlewar fundament abstract middlewar paper reflect concret present version model call directli support adopt architectur distribut applic import applic domain expect distribut applic involv mobil tradit introduc stress scalabl evid influenc previou experi lime middlewar experi support albeit form case publish compon disconnect event dispatch reconnect locat lime conceiv support logic mobil agent physic mobil host ad hoc support coordin dynam reconfigur tupl space aim approach integr unifi goal seek simplic minim result applic interfac paper structur section present requir intend scenario design goal establish section reader background illustr approach borrow idea section discuss strength weak set scene present model section architectur implic descript current prototyp section summar main contribut compar similar research section hint futur work conclud remark applic domain goal develop target project involv give opportun verifi sound middlewar primit requir applic requir applic cover requir mobil comput section illustr detail characterist applic testb applic platform support distribut mobil develop project motion fund european commun goal project build framework teamwork servic tailor specif compani build infrastructur cooper target distribut teamwork applic support potenti larg group typic distribut network cooper goal possibl busi process platform support search document peopl belong abil subscrib occur inform mobil part requir enabl user advantag mobil host wireless link connect fix network involv cooper process base station mobil predomin disconnect assum happen control perspect natur support environ space inform relev applic built resourc individu made user testb applic concern problem provid support oper disast recoveri research project evalu italian research council disast recoveri typic applic demand extrem form mobil ad hoc network peopl oper disast scene earthquak typic reli form fix destroi commun advantag typic cooper exchang inform field send receiv notif relev event middlewar account mobil base station scenario longer disconnect frequent due fact user move commun field oper mention previou requir support dynam chang environ node connect disconnect identifi intuit clash notion central global server tradit architectur natur lead architectur piec applic act autonom compon commun coordin servic provid middlewar oper absenc central fix support main goal design middlewar abstract appropri encompass kind reconfigur requir applic domain driven object perform aim goal privileg choic definit model lead implement middlewar object minim aim goal identifi minim set concept abstract exploit build middlewar provid abstract root concept develop influenc idea concern develop distribut middlewar footprint approach identifi assembl develop idea goal integr perspect cover widest rang concern unifi model discuss approach provid reader background section provid critiqu set scene present system autonom compon interact event simpli call event compon notifi chang state environ interact publish event compon subscrib class express interest receiv compon subscrib class event includ receiv copi event architectur publish system includ event dispatch special compon charg manag event distribut collect event subscript distribut event subscrib exampl system exploit paradigm graphic user applic control flow regul interrupt framework sun javabean class distribut applic applic built middlewar implement time event event languag express event subscript middlewar embodi commun coordin model inher event notif interest ident sender hidden set recipi event notif chosen base chang event notif persist store compon subscrib event linda linda regard coordin model architectur style build central comparison middlewar tribut applic applic base linda model compon interact write read elementari data order sequenc type field call global share data tupl space compon read tupl tupl space read primit read primit accept pattern paramet return match chosen match tupl present tupl space match base ariti tupl type field match tupl read caller suspend match tupl synchron compon variant version access call provid linda implement context parallel comput number middlewar conceiv distribut comput middlewar typic implement enabl remot access central tupl space commun linda unicast depend synchron asynchron commun writer reader tupl tupl ad tupl space remain compon remov mobil code code mobil abil reloc runtim softwar compon distribut popular recent year idea typic java languag provis mechan program dynam load concept code mobil root architectur level technolog code mobil locat class design plai compon code comput move benefit expect express power design move applic knowledg close reduc requir distribut applic argu benefit strategi strongli depend characterist applic environ applic run design grant flexibl custom applic code ship fetch custom applic requir benefit obviou arguabl explain section mobil code tool obtain advantag mobil reader interest learn applic code redirect code provid small set primit custom programm provid requir coordin semant global virtual data structur concept global virtual data structur gener lime coordin model compon hold local tupl transient share tupl space connect compon access local tupl compon access global tupl space content defin union tupl space belong connect compon action perceiv local global term refer commun mobil center idea support coordin set mobil host data space transient share dynam built data space provid compon rang data space global includ data local data space connect virtual exist physic singl local dynam gener underli middlewar invoc local access connect paradigm natur enabl style coordin context content reflect state access compon observ paradigm commun coordin structur data matrix organ host hold part tree held primit provid access set primit access chosen hide portion context inform system configur locat piec reveal primit tailor scenario mobil specif incarn develop desir result middlewar middlewar approach essenti cover facet solut problem support mobil applic exhibit drawback paradigm suit distribut mobil applic pure commun larg leverag abil react state compon high reconfigur undergo scenario featur desir middlewar todai show paradigm amen implement scalabl distribut event dispatch adopt pure stateless commun primit middlewar limit support coordin synchron linda center persist global share data easili support coordin synchron compon limit support reactiv model execut essenti rejoin perspect singl coordin model ti event notif notion share data space hold global context comput event complet ti portion state data space applic queri global data space subscrib event occur notion conceptu framework cope reconfigur physic mobil system defin global data space transpar dynam broken reconstruct form support reconfigur physic mobil code add capabl dynam reconfigur logic level enabl dynam reloc programm redefin coordin primit interact share data provid level flexibl synerg combin approach potenti open opportun develop breed middlewar technolog section describ commun coordin model adopt strongli root idea provid architectur guid implement middlewar implement model describ prototyp middlewar model center notion global virtual data structur built local data structur contribut user point view user access content data structur automat dynam reconfigur occur typic induc connect compon approach similar exploit lime exploit richer data structur choic made oper intend give express power applic programm open opportun optim layer data forest tree data structur manag organ graph node collect refer item data structur ds set set node item set label associ node necessarili label total function node essenti meant structur classifi document manag middlewar enforc satisfi transit closur defin basic mean node structur forest distinct repres perspect document data structur node link parent node children node standalon document document link parent node children document multipl node node long root directli node formal mean compli set root organ node express complex data classif scheme document read found engin node node document figur global virtual data structur manag peer peer figur global data structur result user connect part tree root technolog node result depict figur similar standard file system multipl root directori plai role file hard link document share data call simpli local data structur ds content assum store local peer special data structur empti case lightweight peer run local data structur held peer connect made peer part global virtual data structur manag structur local data structur compli definit content obtain local data structur belong peer shown figur ds ds local data structur held set peer connect instant ds manag properti defin gener data structur ds satisfi observ label requir notic distinguish document label part model defin defin project function satisfi set root ds set root practic mean chosen satisfi constraint gener data structur ds defin function project content homolog node singl node hold posit project node homolog node node hold posit tree belong peer figur node peer singl document homolog node peer singl document content made includ connect peer determin content global data structur constitut local data structur disappear reconfigur place scene complet hidden peer access awar fact content structur chang time clear remaind section conceptu reconfigur implement minim reconfigur place layer oper data structur question tabl definit oper data structur import note point draw sharp line oper perform perform local data structur choic programm access singl data structur repres syntact mean restrict scope oper local claim separ local global scope made model level mirror fact local data structur concret data virtual data structur hide differ eleg uniform hide fundament local remot oper point induc programm oper heavili complic incarn model middlewar elabor section oper defin local data structur manipul schema local data creat node exist node nf remov node manipul content local data insert document node gener notif event occur item oper local global data fd execut arbitrari action project data structur identifi fn fd perform node filter function fn appli node data structur return set mn match node document filter function fd appli document includ node mn return set match item hand action code fragment start item possibl oper data yield set item return caller fd fe peer subscrib occurr event match event filter function fe publish project data structur identifi filter function fn fd event occur code fragment execut local caller fd fe execut arbitrari action project data structur identifi fn fd similarli execut atom subscrib event match fe occur code fragment execut local event occur fact signatur oper ident local global data limit scope natur data structur appli semant oper choic semant global oper regard distribut execut oper local data structur peer connect issu definit act account express implement intend domain applic distribut mobil special attent paid issu atom atom implicitli assum reason assumpt oper defin local data impract assumpt distribut set defin variant global provid global execut oper local data integr part global correctli serial execut atom local data interest note number oper introduc small consequ design design provid minim core primit runtim infrastructur emploi conceiv base middlewar provid abstract design criteria explain role execut essenti sort demand provid actual semant access data structur scenario set predefin action oper read document local data oper add metadata filter document wai applic depend oper vari implement applic applic action implement ensur execut context singl atom access local data structur execut oper essenti basic mechan enabl global execut action underlin action necessarili drawn predefin pool target local data structur defin chang dynam high level coordin primit access remark open architectur solut heavili exploit notion mobil elabor section notion action programm tremend local global data structur access principl action side scope local data structur send invok method execut level flexibl design middlewar applic tier similar hold extend execut abil realiz scheme provid strong consist inform retriev data monitor event occur programm retriev content node notifi document build graphic browser global data structur observ behavior obtain simpli invok execut subscrib inher distribut asynchron natur peer publish relev event execut subscrib event captur notif show lead inconsist state architectur ultim goal deliv model present implement provid reason conceiv realiz practic discuss implic model term deriv distribut architectur middlewar implement support section elabor illustr prototyp activ model natur suggest middlewar implement peer host repositori local data structur oper global perform dissemin connect peer request local invoc send result back caller peer host support manag rout system event notif request execut oper model prescrib rout topolog network interconnect algorithm perform rout top model leav free experi architectur essenti driven network environ middlewar oper function requir flexibl support mobil host investig implement aim fix network connect peer determin explicit action log aim ad hoc network logic connect peer determin physic connect host implement wide rout algorithm due assumpt made environ arrang peer logic network rout messag hierarchi simpl strategi fix network case solut impract ad hoc topolog forc continu reconfigur hierarchi logic network improv reliabl multipl peer content applic programm shield unifi program model scenario model includ choic made open opportun improv scalabl ware independ underli architectur evid choic hierarch natur provid natur restrict scope oper perform optim process involv distribut request execut peer node target oper relat node enabl implement subscript event occur node propag system outstand subscript parent node relat enabl sort event multiplex case peer outstand event occur event occur event match subscript occur send path event sourc singl event transfer destin target potenti save bandwidth applic pattern occur frequent relat relev issu resolv implement actual express languag filter fn fd fe tradeo express power hand programm burden ad complex overhead middlewar support node uniqu sequenc label node path root tree hold minimalist choic node filter fn programm sequenc identifi singl node prevent optim complic excess life programm exploit extrem power languag base regular programm filter node singl step filter thing complex case event filter data characterist larg depend natur event left unspecifi model definit event uniqu event filter regular express case complex event type imagin exploit extrem power filter languag approach similar jm prescrib subset document simpl data filter pattern match tupl field document complex xml filter complic xml queri observ case data capabl arbitrari action oper introduc addit middlewar design simpl languag data streamlin distribut exploit action perform filter place actual data highlight peculiar characterist model mechan action programm defin dynam exact behavior primit access comput move close open interest opportun cientli implement complex oper document mention previou architectur level involv mobil code technolog implement ship fetch code action peculiar model strong separ local global primit programm easili adopt model coordin push extrem provid mechan access local data structur remot host mechan left effici manag import architectur issu local primit made visibl remot peer strategi imagin pure implement model mechan access local data structur remot peer model enabl form program execut remot peer data found access local data structur peer middlewar adopt model provid full access local data structur remot peer implement strategi strategi implement increment start constrain applic environ concept mechan check sound complet experi develop toi evolv challeng scenario stage strategi involv build implement satisfi user connect fix connect rule explicit action log mobil user connect control user physic move fix network backbon perman activ care process rout control messag relat request subscript notif event leav host perman discontinu attach attach backbon dynam fring mobil connect enabl wireless devic scenario encompass applic involv nomad dynam collabor share document case mobil teamwork applic section architectur prototyp reli heavili albeit emploi event dispatch strategi base hierarch arrang support deal disconnect happen control event subscript implement event implement rout execut request time node creat local data structur special subscript hold full path call global execut node filter match implement send special event match subscript advantag mechan rout event rout execut call peer hold match node data filter execut local support mobil implement notion provid code lightweight flexibl toolkit code mobil observ requir testb applic domain perform chose implement version global primit plan continu work implement add featur futur discuss relat work coordin paradigm adopt set compon share inform react occur similar lime aspect contribut middlewar lime distinguish local global primit eleg model commun lime user adopt style program point culti result distinguish local global action preclud possibl adopt design solut primit result lime introduct notion lime compon compon destin tupl ad global tupl space compon connect time oper result call tupl ad local tupl space move destin tupl space singl atom step destin compon connect time oper tupl ad tupl space caller mark destin compon engag protocol run move misplac tupl local tupl space consist global tupl space presenc set connect engag protocol run distribut transact move misplac tupl expect destin evid approach impact scalabl middlewar lime compon react insert tupl event model complex result greater express power lime concept strong reaction strong reaction fire atom insert run fix point reach mechan impract appli distribut set lime constrain strong reaction run scope singl exploit support coordin mobil agent level data notion node tree node provid enabl mechan scope event queri express model potenti scalabl middlewar lime similar tupl space flat data provid mechan limit scope primit access class potenti competitor middlewar respect observ implement featur advanc fulli exploit content base subscript event filter add concept node tool classifi event reduc scope potenti scalabl middlewar tradit middlewar event publish result intern state middlewar client state manag middlewar immedi access client forc programm put place mechan make state visibl forc add event inform rebuild relev part state event directli item part manag peer directli access reduc inform carri event easili exploit complex interact pattern argu primit ad peer access reduc middlewar scalabl case fact primit design begin scalabl mind primit influenc primit primit previou easili implement pure asynchron approach practic proof claim current prototyp implement top middlewar explicitli design good introduc constraint rout event subscript compar environ recent attract attent commun internet user refer applic napster adopt style coordin user share document relev observ applic domain intend file share internet requir search execut entir set document mechan similar topic jm consid perfectli accept search return match file match file exist characterist exploit mention system put place special mechan reduc network gener search improv scalabl model behavior accept imagin implement special tailor applic domain relax semant global primit exploit similar approach reduc scope search execut natur scope mechan base concept node mechan obtain similar result futur work paper present middlewar mobil applic adopt model coordin base notion global virtual data structur peer share set data contribut creat manag middlewar model commun base data full support commun style model strongli benefit concept limit scope oper access event occur item design provid minim set primit access publish subscrib express power enrich mobil code core middlewar top primit implement present architectur guid implement result initi provid prototyp design guidelin research goal conceptu tool shape time time adapt scenario experi implement strategi start work prototyp tailor ad hoc network plan studi feasibl special implement tailor applic domain file share internet plan refin provid complet formal data structur manag primit goal identifi weak approach potenti improv acknowledg carlo valuabl comment made document francesco work prototyp refer liao programm support adapt mobil ieee person aug wade qualiti servic support mobil approach base tupl space proc ifip int qualiti di fuggetta exploit infrastructur develop complex distribut system proc int conf softwar engin di fuggetta infrastructur applic develop wfm ieee transact softwar gp vigna understand code mobil ieee transact softwar gelernt gener commun linda acm comput jan satyanarayanan disconnect oper coda file system acm tran comput gp roman linda meet mobil proc st int conf softwar engin page lo acm press mobil ad hoc network internet murphi enabl rapid develop depend applic mobil environ phd washington st aug gp roman middlewar physic logic mobil proc st int conf distribut comput system picco lightweight flexibl mobil code toolkit proc mobil int workshop volum page stuttgart sept springer murphi softwar engin roadmap futur softwar page acm terri al manag updat conflict weakli connect replic storag system oper system kendal note distribut comput vitek mobil object programm volum lnc apr
ML/1355 6 genet algorithm binari quadrat program peter merz bernd depart electr engin comput scienc germani abstract genet algorithm unconstrain binari quadrat program problem present shown small problem simpl genet algorithm uniform crossov suffici find optimum solut short problem high number variabl essenti incorpor local search arriv solut hybrid genet algorithm incorpor local search test problem instanc size result comput experi show approach compar altern heurist tabu search small instanc superior tabu search simul anneal larg instanc solut found larg problem instanc introduct unconstrain binari quadrat program problem symmetr ration matrix ij binari vector length quantiti qx ij maxim problem quadrat program quadrat program quadrat boolean program problem larg number capit budget analysi problem cad problem traffic messag manag problem machin schedul molecular conform combinatori optim problem formul maximum cut maximum cliqu maximum vertex pack problem maximum independ set problem exact method develop solv due comput complex heurist recent find solut larg problem includ tabu search simul anneal evolutionari algorithm genet algorithm base crossov mutat appli hybrid genet algorithm incorpor simpl local search present solv genet algorithm find solut small problem hybrid algorithm requir find optimum solut larg instanc shown hybrid algorithm outperform recent altern approach tabu search simul anneal hybrid algorithm paper repres genet approach appli larg instanc paper organ section genet algorithm includ hybrid genet algorithm result obtain experi conduct algorithm discuss section section conclud paper outlin area futur research genet algorithm type genet algorithm type consist simpl genet algorithm crossov type consist hybrid genet algorithm incorpor local search genet algorithm applic genet algorithm straightforward individu compon approach fit object function fit function genet algorithm solut problem repres binari string length bit combin feasibl penalti function due binari classic genet oper point uniform crossov appli modif crossov oper experi uniform crossov oper simpl mutat oper flip singl bit bit string constitut solut select techniqu genet algorithm divid surviv strategi random select scheme perform select pool parent newli creat evolut strategi ensur solut popul diversif strategi borrow algorithm eshelman algorithm converg averag distanc popul drop threshold chang popul popul mutat individu search restart kind select strategi shown effect small popul algorithm solv tsp hybrid genet algorithm approach domain knowledg genet algorithm incorpor local search result call genet local search algorithm algorithm proven highli effect combin advantag effici local search exploit neighborhood singl solut popul base algorithm effect explor search space gl individu popul repres local optima achiev local search appli applic genet oper creat offspr start popul local initi creat solut improv local search gener outlin algorithm shown fig crossov local search algorithm compon ident section gl algorithm local search algorithm variant uniform crossov recombin call creat offspr equal parent term ham similar oper local search appli result offspr recombin restrict region search space defin gene equal valu parent modifi local search local search simplest form local search local solut higher fit neighborhood current solut search neighborhood current solut defin set solut reach flip singl bit neighborhood solut ham distanc current solut search solut highest search flip highest gain fit gain procedur begin initi popul foreach individu repeat select parent add individu converg foreach individu endif figur gl algorithm flip bit current solut calcul linear time formula kk ik local search algorithm pseudo code fig procedur begin repeat find max return figur local search data structur maintain gain speed comput detail descript found close relat binari quadrat program defin kauffman object function function fit solut rewritten sum function call fit contribut site ij similar defin fit contribut site depend gene gene constant defin number entri column matrix instanc easili determin calcul densiti matrix defin number entri divid number total entri matrix densiti mean maximum gene depend valu view special class landscap special fit contribut function expect genet algorithm work instanc low ga shown perform low experi present section perform tabl comparison mutat crossov base algorithm uniform crossov mutat instanc den avg opt avg opt instanc high comput experi conduct experi appli algorithm instanc small instanc instanc medium size larg instanc popul size set case genet algorithm local presenc local search popul size rate set offspr creat gener individu mutat flip bit bit vector genet algorithm includ local search implement experi perform pentium ii pc oper system solari algorithm termin solut found predefin time limit reach appli genet algorithm uniform crossov genet algorithm sole base mutat set small instanc time limit set run result shown tabl problem size densiti matrix fit optimum solut provid sixth column result genet uniform crossov mutat oper column averag final fit valu number run solut found opt averag runtim algorithm instanc list solut found run remain solut found result tabl show mutat base search superior crossov base search instanc uniform crossov yield averag fit mutat case mutat ga find solut amount problem express densiti matrix influenc instanc algorithm perform significantli instanc low characterist problem higher influenc hardest problem problem type densiti wide rang investig scalabl perform experi medium size instanc vari densiti time limit set problem size problem size result ga uniform ga gl shown tabl densiti matrix tabl comparison genet algorithm genet local search uniform crossov mutat gl instanc den avg opt avg opt avg opt solut provid instanc column averag deviat optimum percent opt number time opt solut averag run time provid mutat base search outperform crossov base hybrid genet algorithm incorpor local search prove effect instanc size run time reach solut averag problem hard gl time limit solut found longer run time algorithm find problem harder comparison solut found time order put result appli genet local search algorithm larger problem size perform altern tabu search simul report tabl displai result genet local search algorithm larg problem densiti comparison result report averag number gener solut found averag final solut run runtim shown tabu search simul anneal solut found total run time silicon graphic cpu provid figur demonstr effect gl solut problem competitor found slightli solut comparison treat care run time directli compar due platform evolutionari approach al report approach similar gl approach individu popul repres local optima recombin perform util algorithm simpl form crossov unclear heurist crossov author contribut perform algorithm direct comparison platform provid averag final solut valu run time reach solut instanc report silicon graphic indi mhz algorithm averag pentium ii pc mhz find solut genet algorithm genet local search algorithm present solv binari quadrat program problem shown genet algorithm find solut problem problem size short time larger genet local search genet algorithm incorpor local shown effect outperform altern tabu search simul larg problem instanc problem instanc tabl comparison algorithm gl ts sa instanc gen avg tain solut found issu futur research addit heurist incorpor genet greedi heurist creat initi popul altern local search algorithm heurist recombin oper develop exploit structur problem effect search space analysi reveal differ fit landscap type instanc predict perform genet algorithm local search open question algorithm util order effici solv problem special case maximum cliqu problem maximum independ set problem refer quadrat program approach optim solut schedul intern journal system vol pp mathemat vol pp distribut test problem electron journal oper research vol pp algorithm unconstrain binari quadrat program tech manag imperi quadrat european journal oper vol pp adapt search safe search engag genet foundat genet pp morgan genet local search algorithm solv symmetr asymmetr travel salesman ieee intern confer evolutionari pp ieee knapsack mathemat vol pp garei comput guid theori npcomplet memori tabu search binari quadrat manag vol pp quadrat program cut mathemat vol pp adapt natur artifici system michigan network flow problem solv oper vol pp kauffman gener theori adapt walk rug journal theoret vol pp aid layout mathemat program vol pp binari oper vol pp evolutionari heurist quadrat tech depart de ecol polytechniqu de implicit algorithm quadrat integ manag vol pp merz genet local search approach quadrat assign intern confer genet pp morgan merz local search ieee intern confer evolutionari pp ieee merz algorithm fit landscap graph intern confer parallel problem solv natur ppsn pp merz effect evolutionari search ieee intern confer evolutionari pp ieee merz comparison tabu ant coloni quadrat assign congress evolutionari comput merz local search heurist unconstrain binari quadrat program tech rep merz landscap algorithm idea merz algorithm greedi oper graph evolutionari genet algorithm martial tech rep caltech concurr comput report california institut approach travel salesman problem implement comput ecolog combinatori optim parallel comput pp io pardalo aspect branch bound algorithm unconstrain quadrat vol pp pardalo branch bound algorithm maximum cliqu comput oper vol pp pardalo maximum cliqu journal global vol pp phillip quadrat assign formul molecular conform journal global vol pp von der vol interdisciplinari system crossov genet intern confer genet pp morgan van local search algorithm travel salesman parallel problem solv natur ppsn schwefel pp genet local search confer parallel problem solv natur ppsn pp
DB/1356 3 foundat data qualiti nation technic athen informatik und informatik institut nation de recherch en informatiqu en automatiqu deutsch forschungszentrum für intelligenz rome istituto la ricerca fm schaerf integr datalog descript logic journal intellig inform dwq esprit long term research contact person prof yanni nation technic greec tel journal intellig inform kluwer academ boston manufactur netherland integr datalog descript logic francesco maurizio daniel nardi andrea schaerf dipartimento di informatica universita itali abstract present system knowledg call base descript logic deduct languag datalog embodi call structur relat de nition structur knowledg class interest membership relat object class de nition relat knowledg object structur compon interact compon obtain constraint datalog requir variabl rang set instanc speci ed concept method queri answer base constrain usual deduct procedur de ned datalog integr method reason structur knowledg descript deduct knowledg queri answer introduct hybrid system special class knowledg system constitut subsystem deal distinct portion knowledg base speci reason procedur featur hybrid system system charg singl knowledg combin knowledg reason di erent subsystem order answer user question motiv build hybrid system improv basic featur knowledg adequaci deduct power case knowledg formal reason procedur adequ repres kind unsuit heavi possibl di erent formal framework pursu hybrid system order overcom limit singl paradigm improv deduct power hybrid system term infer system cienci deduct process regard rst set hybrid system draw union deriv subsystem advantag result obtain schaerf system regard special reason make improv deduct special reason typic perform gener deduct procedur base system brachman nebel von borgida baader subsystem call terminolog assert terminolog subsystem call abil creat hierarch structur concept descript assert subsystem user languag express properti individu close relat system studi rst order languag combin sort regard elementari descript logic paper attribut languag main featur add framework deduct structur power descript logic speci structur subsystem base descript logic alc relat subsystem base languag datalog interact subsystem realiz speci cation constraint datalog constraint express alc constraint variabl requir rang set instanc speci constraint individu object requir belong extens concept hybrid reason comput answer base speci cation structur relat compon knowledg base hybrid refut relat compon mean constraint collect rst step special check structur compon innov respect subsystem embodi knowledg base level structur subsystem highli express compar usual terminolog knowledg base concept de ned assert concept membership assert individu object comparison classi cation hybrid system made reveal embodi featur substitut framework theori resolut regard structur subsystem background theori datalog select ground instanc instanc satisfi constraint similar theori resolut refut knowledg base found prove valid background disjunct formula disjunct di erent integr datalog descript logic special case logic languag deduct exploit descript logic de nition structur compon knowledg base result system form integr object logic framework interest investig system provid deduct abiteboul kifer ling compar express structur sophist reason mechan compon main featur reason incomplet knowledg structur compon repres incomplet knowledg made rich set construct build concept class usual express state concept erson subset concept male denot set object instanc male assert integr constraint approach mean state instanc state accept explicit assert instanc male explicit assert instanc assert speci cation model knowledg integr constraint mean accept knowledg base assert instanc explicit inform instanc male system reason answer queri basi inform featur share recent paper integr horn rule descript base framework levi note high express power structur compon forc stick horn relat compon includ negat relat subsystem relat knowledg plai role deduc inform structur individu form integr subsystem weaker support deduct languag system special constraint logic program system datalog logic program assert structur compon constitut speci cation constraint possibl express incomplet inform constraint part common constraint logic program show rest characterist pose problem task queri answer method paper organ section describ present main featur structur relat de ning semant knowledg base system section show schaerf knowledg base express brie discuss express power formul queri section present method hybrid reason drawn section system mention embodi call structur relat subsect express knowledg role individu subsect user suitabl extens datalog order express relat knowledg semant knowledg set infer carri provid subsect exampl knowledg base discuss subsect structur subsystem structur subsystem de ne call base base structur level refer knowledg concept constitut set statement relev properti concept level knowledg individu constitut set membership assert object concept instanc pair object role relat role structur subsystem compon constitut constitut level show express power languag construct structur subsystem greater convent hybrid system speci descript logic build concept express descript logic alc concept repres class object domain role repres binari relat concept complex concept de ned mean suitabl construct appli primit concept denot simpli role concept alc form mean syntax denot primit denot denot arbitrari integr datalog descript logic quanti quanti concept erson rst denot faculti member teach advanc denot person teach full professor concept interpret subset domain role interpret binari relat domain consist set domain function interpret function map concept subset role subset equat sati fa fa interpret model concept nonempti concept sati model subsum interpret subsum turn attent problem de ning level base level speci es properti concept interest applic properti express term set statement buchheit statement simpli form arbitrari concept statement speci es instanc instanc sati es knowledg base de ned section schaerf shorthand pair rst state full professor faculti statement de ne concept set full professor teach nite set interpret model sati es logic impli statement written sati ed model terminolog system provid user mechan concept de nition form de nition mechan limit requir side concept primit statement concept exist system cycl terminolog compon permit primit concept occur directli indirectli de nition constraint form terminolog cycl occur system shown type semant terminolog xed greatest xed descript semant system languag de ning level structur compon limit form concept involv notic form easili express system pair form arbitrari express restrict system turn attent mechan er structur subsystem de nition level subsystem limit essenti relat object pair object role alphabet call individu relationship express term membership assert arb integr datalog descript logic role rst form state instanc form state relat mean role state assert knowledg base section john ai mari order assign mean membership extens function interpret extend individu map element notic restrict ensur di erent individu denot di erent object world interpret sati es assert sati es arb model set membership assert sati es assert summar featur structur subsystem structur subsystem de ne base pair ai set set assert interpret model model model notic virtu uniqu focu call interpret model point refer interpret implicitli assum deal sati model logic impli membership model sati es relat subsystem relat subsystem express relat knowledg term set constrain datalog deal give short summari order make paper schaerf datalog datalog queri languag base logic program paradigm interest datalog queri languag stem fact pure declar de nition class queri de nabl declar queri languag relat datalog program consist set de nite atom form pi predic symbol tj predic variabl symbol belong mutual disjoint alphabet note program posit assum variabl quanti ed requir atom predic symbol number argument atom variabl call ground substitut nite set form xi ti xi xj ground substitut substitut ti constant result applic substitut denot obtain simultan replac occurr xi ti written form left hand call constitut posit liter hand call constitut list atom neg form fact rule notat constant predic symbol string begin lower case variabl string begin upper case letter predic occur datalog program partit predic predic correspond relat fact correspond tupl predic correspond virtual view requir head predic rule base distinct datalog program divid call denot set fact involv part set datalog program satisfi safeti occur head occur bodi condit fact ground safeti condit set fact deriv datalog program nite integr datalog descript logic semant datalog program base notion herbrand interpret datalog program herbrand base hb set atom form predic ci constant write denot atom hb predic herbrand interpret subset herbrand base hb herbrand interpret posit ground liter sati ed neg ground liter sati ed herbrand interpret model ground instanc liter sati ed mean datalog program set model intersect model model herbrand subset herbrand model list ground atom conjunct logic consequ written gi sati ed model note herbrand interpret map set constant occur predic occur subset reformul herbrand interpret section de nition semant knowledg base denot set ground atom logic consequ sati ed model equal herbrand model mean logic impli ground atom case herbrand model sati es queri datalog program conjunct atom written gi atom answer queri substitut variabl answer correct respect datalog program answer set queri set answer correct respect ground answer set queri set ground instanc logic consequ constrain datalog program constraint datalog program de ned analog constraint logic program constraint logic program languag speci constrain set restrict variabl express languag alc schaerf constrain datalog datalog constraint form constant system constraint form constrain datalog state hold curriculum exist pass exam topic subject constraint constraint restrict valu rang set instanc speci ed concept constraint constant call ground condit denot individu instanc speci ed concept set constrain datalog call constrain datalog program semant knowledg base knowledg base de ned pair base constrain datalog program order knowledg base satisfi set datalog predic symbol disjoint set concept role symbol alphabet constant coincid alphabet individu constant occur note real individu add assert result base variabl integr datalog descript logic role plai constraint datalog critic system interact structur relat compon knowledg base determin constraint speci ed easi similar constant variabl sort languag structur subsystem power ordinari languag sort regard semant knowledg base de ne interpret union herbrand interpret set datalog obtain delet constraint part symbol ground instanc constrain constrain obtain substitut variabl individu occur call model model model ground instanc exist sati ed sati ed logic impli ground atom ground constraint written model sati es conjunct ground atom ground constraint logic consequ written queri knowledg base sentenc qi atom constraint answer queri substitut variabl answer correct respect knowledg base answer set queri knowledg base set answer correct respect ground easi verifi ground queri constraint form knowledg express relat compon role deduc fact structur compon exampl knowledg base knowledg base de ned figur column refer structur compon relat compon row refer level level symbol structur compon read fp full fm faculti tc st tp ac advanc bc basic schaerf structur relat fp fm fp ac bc ac bc john mari fp paul ai kr lp tp figur knowledg base tp fm part structur compon speci es full professor faculti full professor de ned full professor teach set partit basic advanc predic part relat compon intend student thesi professor student studi topic professor expert topic student pass exam topic treat relat compon condit student thesi professor notic model paul student kr john faculti member teach advanc expert kr rst relat easi logic impli rst realiz true set model mari teach advanc true set model mari full professor su cient prove repres model integr datalog descript logic structur relat bl ye bl figur knowledg base bl ye fore logic consequ order model model mari full full teach advanc present highlight show express queri express pure datalog graph problem check node graph color adjac node color color graph problem consequ write datalog queri polynomi size wrt size graph check graph graph check mean queri speci ground queri logic impli knowledg base figur graph repres predic arc graph repres predic arc color yellow repres concept case logic impli method section singl model knowledg base directli solut problem worth remark size relat independ size graph graph repres arc schaerf discuss detail express refer express similar languag formal address deduct structur compon section fundament deduct perform structur compon knowledg base consist check logic impli membership assert answer problem signi sati problem logic implic reformul abil check sati abil base problem rst shown decid result prove gener set reformul result show check sati abil base problem nexptim solv nondeterminist algorithm exponenti account adapt tableaux calculu descript build model base correct method establish theorem prove part attempt build model preserv sati abil part show contradict show tableau branch result calculu model construct termin prove theorem show tableau branch nite nite tableau branch alphabet variabl symbol total order disjoint alphabet de ned element denot letter variabl datalog variabl account individu exist requir explicitli present knowledg base rest section term object abstract individu variabl object element object denot symbol section individu denot assert involv assert syntact entiti form role object variabl interpret variabl de ned function map variabl element necessarili individu assert form sati ed pair assert form sati ed tableau branch set assert involv tableau branch sati interpret integr datalog descript logic sati es assert tableau branch order check knowledg base ai sati techniqu start tableau branch add assert contradict gener interpret satisfi easili obtain assert ad basi suitabl set propag rule introduct nite lter tableau branch variabl written involv assert fc sg fc sg reduc number assum concept negat normal form alc concept rewritten concept exploit logic propag rule variabl variabl concept schaerf condit applic rule ensur rule applic repeat implicitli assum tableaux rule notic requir introduct variabl tableau pose problem termin procedur repeatedli appli due presenc form applic subject condit involv notion condit basi termin rule appli tableau branch assert case presenc object rule appli assert object appli tableau branch propag rule appli adopt strategi appli rule appli rule variabl rule applic appli rule variabl rule applic variabl criteria list descend order applic rule applic produc con ict rst rst criterion overcom appli strategi ensur variabl process time order achiev stabil relat variabl tableau branch rule appli variabl applic rule result tableau branch show stabil import prove termin complex calculu assum propag rule appli strategi call nondeterminist rule condit rule call determinist tableau branch propag rule appli clash assert form observ strategi lead uniqu choic applic rule subsequ theorem prove choic applic calculu termin yield tableau branch initi tableau sati theorem integr datalog descript logic tableau branch obtain applic determinist sati sati nondeterminist rule appli tableau branch obtain choic condit sati sati tableau branch sati clash proof proof rst part straightforward reformul sound proof tableaux calculi tableau branch clash sati clash complet clash singl satisfi pair de ned variabl individu variabl variabl sg sg prove sati es assert induct length assert basic de nition de nition de nition induct induct similar previou case schaerf correspond basic case induct hypothesi complet case object induct hypothesi de nition induct hypothesi conclud object rewritten sati es sati es assert sati es sati es show number variabl tableau branch deriv knowledg base limit end de ne number di erent concept number concept assert number subconcept count separ occurr concept concept concept concept concept number concept number subconcept rewritten correspond dealt number concept knowledg base sum number concept assert lemma number concept knowledg base tableau branch deriv mean propag appli strategi atleast variabl proof inspect propag rule verifi assert concept di erent assert involv variabl subset concept tableau branch object variabl ller role assert integr datalog descript logic proposit number concept knowledg base tableau branch deriv object ller proof assert introduc applic rule assert rule appli assert condit concept concept object number assert bound object assert form ller kei lemma termin complex calculu lemma number concept knowledg base number individu tableau branch deriv variabl proof tableau branch deriv propag rule appli strategi variabl partit class relat make fact step proof step observ class variabl chang rule appli rule appli object ller criterion strategi forc applic rule rule appli observ condit rule introduc forc case rule appli rule appli criterion strategi rule appli rule applic individu variabl wrt criterion strategi forc applic rule introduc applic rule class chang exist variabl step prove tableau branch class variabl wrt ller variabl class exist variabl ller ller introduc rule appli previou tableau branch step class chang variabl wrt introduc condit rule sati ed rule applic yield contradict step observ variabl tableau branch introduc ller object proposit variabl class ller step variabl ller schaerf total individu ller claim prove tableau branch obtain knowledg base applic propag rule exponenti size wrt size de nition size assert number symbol assert observ assert form constant size assert form linearli relat number concept size number symbol linearli relat number concept size knowledg base sum size assert similarli tableau branch observ size linearli relat number concept theorem size knowledg base size tableau branch deriv strategi cn constant proof number concept number individu lemma total number object tableau branch deriv constant assert form constant size present number assert ad rule condit verifi case involv assert form number assert number assert form assert form size proport number concept concept number concept size number di erent assert form bound number object time number concept total size assert constant size bound conclud total size tableau branch deriv cn conclud nondeterminist calculu requir exponenti time build tableau branch theorem knowledg membership assert decid nexptim nondeterminist calculu turn determinist explor tableau branch time exponenti complet tableau conclud section state deduct structur compon decid doubli exponenti time correspond proposit dynam logic giacomo integr datalog descript logic prove problem decid simpl exponenti time procedur stem result requir build tree check empti method requir doubli exponenti time worst case queri answer section describ method hybrid answer queri knowledg base rst describ notion constrain constrain exploit notion sound complet method hybrid deduct refer hybrid knowledg base queri pose constrain datalog form call head posit liter de nition gener substitut qi qi resolv substitut queri constraint obtain appli simpli constraint form replac constraint provid de nition constrain de nition constrain simpli queri deriv constitut sequenc queri sequenc constrain datalog sequenc substitut resolv substitut call length deriv figur show deriv queri knowledg base section deriv termin queri form call constrain empti simpli empti proposit model qi schaerf figur constrain proof sound fact simpli cation constraint preserv valid point deriv empti constraint repres infer deriv queri true model satisfi order answer collect deriv end constrain empti model sati es constraint nal queri deriv formal notion de nition constrain queri nite set constrain denot ni sequenc queri deriv condit ni form qi queri deriv constrain empti model exist qi ni write condit figur show set deriv queri knowledg base deriv end constrain empti integr datalog descript logic figur constrain verifi model constraint rst empti paul ai lp mari fm constraint paul mari set constrain constitut constrain show notion constraint queri answer queri knowledg base standard answer call comput answer refut set comput answer call success set rst check constrain sound complet method check ground queri logic consequ knowledg base write constrain lemma queri knowledg base proof usual step prove correct complet logic program framework reconstruct hybrid framework ground queri constrain model sati es constrain empti sati es repeat applic proposit model sati es constrain empti model sati es schaerf deriv queri constrain empti call qi ni qi queri constrain model qi ni model qi model structur part monoton map de ned set hb ground set ground atom li head ground instanc sati es constraint atom bodi xpoint obtain iter nite number start veri ed identi es model model induct construct theorem state answer success set correct respect vice versa theorem queri knowledg base success set coincid answer set proof answer answer set directli lemma success set prove hold appli lemma show comput answer success set ground safeti restrict variabl queri substitut variabl queri deriv conjunct resolv bound constant conjunct resolv fact empti deriv variabl queri bound constant turn method answer queri easi usual reason method datalog collect nite number step number step polynomi respect size level constrain datalog constrain construct proposit queri constrain built collect constrain end empti length bound determin proof datalog program complet comput refut tree nite depth depend straightforward map constrain datalog deriv ignor claim integr datalog descript logic refut deriv di end constrain empti qi ni remain verifi structur compon ofth knowledg base consid baader al condit veri ed set assert cm ai ci constraint qi ni problem prove decid previou perform check km abil check maximum number constraint qi ni number constrain constitut refut theorem queri answer proof order answer queri knowledg base ground instanc collect set constrain bound length di ni check nm present system integr datalog descript logic consid structur subsystem base languag alc relat subsystem base extend bodi worth notic choic speci languag alc architectur mandatori descript logic emploi complex reason architectur di erent main goal work studi form hybrid deduct knowledg base structur knowledg concept relat knowledg object result reason procedur obtain ad deduct procedur datalog special deduct step structur compon point highli express structur fact lack interest treatment negat relat abil relat subsystem infer knowledg structur compon extens deal role assert constrain datalog studi system shown extens restrict order retain decid reason servic develop work analysi carri order singl sublanguag alc give rise polynomi time queri answer relat languag extend schaerf strati ed form semant method hybrid deduct adapt characterist enhanc relat compon acknowledg work support qualiti esprit long term project italian murst note function symbol constant symbol constant variabl call term tableau branch call constraint system avoid constraint constraint system constraint datalog paper term constraint system refer serg abiteboul deduct languag data knowledg serg abiteboul pari kanellaki object ident queri languag primit proc acm sigmod int conf manag page logic program languag inherit journal logic franz bernhard werner jorg concept logic john comput symposium page franz baader bernhard hollund terminolog knowledg system complet infer algorithm proc workshop process declar knowledg number lectur note arti cial page alexand ronald deborah lori resnick structur data model object proc acm sigmod int conf manag page ronald victoria hector levesqu essenti hybrid reason knowledg symbol level account proc int joint conf arti cial intellig page lo martin francesco andrea schaerf decid reason terminolog knowledg system journal arti cial intellig resolut principl constraint logic arti cial marco luigi maurizio lenzerini datalog descript express power preliminari report proc descript logic workshop tanca logic program cohn taxonom reason logic arti cial intellig giusepp de giacomo maurizio lenzerini boost correspond descript logic proposit dynam logic proc nat conf arti cial intellig page aaai mit integr datalog descript logic francesco maurizio daniel werner nutt complex concept languag jame richard erik proc int conf principl knowledg reason page morgan lo francesco maurizio daniel andrea schaerf system integr datalog concept languag proc conf italian associ arti cial intellig number lectur note arti cial intellig extend version work note aaai fall symposium hybrid fit logic autom theorem prove alan frisch gener framework sort fundament result hybrid reason ron hector rai proc int conf principl knowledg reason morgan lo alan frisch cohn thought workshop principl hybrid ai michael georg jame wu logic foundat languag journal alon anand joann ordil queri answer algorithm inform agent proc nat conf arti cial intellig page alon levi rousset limit combin horn rule descript logic proc nat conf arti cial intellig page wang alberto laurent editor deduct orient number lectur note comput scienc bernhard nebel terminolog reason inher intract arti cial bernhard nebel kai von luck hybrid reason back proc int sym methodolog intellig system page publ manfr smolka attribut concept descript complement arti cial mark stickel autom deduct theori resolut journal autom je rei ullman principl knowledg base volum comput scienc pascal van hentenryck constraint satisfact logic program mit schaerf francesco donini receiv phd universita di roma assist professor research interest descript logic comput properti knowledg formal maurizio lenzerini full professor comput scienc universita di roma itali involv research project conceptu data arti cial knowledg comput complex reason recent research work deal foundat approach knowledg applic conceptu data cooper inform system daniel nardi associ professor comput scienc universita di roma itali research interest includ theoret aspect knowledg concept descript reason practic applic intellig tutor system andrea schaerf receiv phd universita di roma assist professor research interest knowledg schedul constraint program
DB/1357 3 string data structur string search extern memori applic paolo roberto dipartimento di informatica dipartimento di sistemi informatica di pisa di april abstract introduc data string link tradit data structur short combin patricia indic made effect ad extra pointer speed search updat oper string overcom theoret limit invert prefix suffix compact suffix tree string perform manag string perform power search oper support suffix tree string effect main memori improv onlin suffix tree search dynam set string successfulli appli index softwar duplic patricia compound attribut data magnet optic prefix rang string search suffix suffix text index subject result paper present acm symposium theori comput author support murst itali fellowship fur germani author support murst itali introduct heterogen electron text collect rang publish document electron dictionari librari newspap telephon textbook privat market legal medic great number text spread internet dai form electron bulletin world wide web onlin provid legal newswir text hundr text gigabyt terabyt applic treat larg text collect chang data compress comput viru detect genom data bank telephon directori handl softwar mainten consid dynam text collect record essenti byte sequenc chang time index data structur search engin fundament tool updat extract inform data extern storag devic disk main memori electron extern memori essenti mechan devic access time percent access time improv past twenti year extern storag build main memori unbound capac access time ongo research improv subsystem introduc hardwar mechan disk disk investig arrang data disk mean effici algorithm data structur minim number access design analysi data structur import theoret practic point view surprisingli scientif good bound obtain algorithm data structur manipul string extern memori tradit data structur invert file prefix ubiquit tool manipul larg data perform effici kei arbitrarili long data structur suffix arrai patricia suffix tree effect handl string small fit main memori longer effici text collect time make extern memori ineffici due fact pack disk page order avoid page remain empti updat worst situat extern memori section discuss detail properti drawback tool design data structur perform provabl good worst case import introduc data string achiev goal short origin data structur don knuth point patricia indic made effect ad extra pointer speed search updat oper string link data structur data structur overcom theoret limit invert file atom suffix arrai contigu suffix tree tree prefix string data structur perform regular handl string perform power search oper support suffix tree formal oper mean basic problem standard terminolog string call prefix suffix substr occurr pattern string find substr jp equal problem search rang fffi ffi set text string total length store sort extern memori insert delet individu text string prefix retriev string prefix pattern rang retriev string lexicograph order occ denot number string retriev queri problem repres typic index problem solv gener treat string examin string set prefix retriev occ rang retriev occ problem fffi ffi set text string total length store extern memori maintain insert delet individu text string substr find occurr string denot number occurr occ problem extend problem deal arbitrari substr string substr retriev occurr occ gener inevit complic updat oper updat problem involv singl text problem involv suffix investig problem classic memori model assum fast small main memori random access slow larg extern memori secondari storag devic magnet disk extern memori assum partit transfer call disk atom charact pointer call disk page size disk page read write oper disk access analyz provid asymptot bound total number exist data structur stand disk access perform total number disk page occupi data structur scientif literatur index data structur emploi effici solv problem discuss detail section point problem solv plain combin patricia intern node log occ disk access prefix log disk access insert delet string length interest practic combin achiev optim theoret bound shown problem combin log occ disk access substr log disk access insert delet suffix string length notic bound quadrat string requir suffix examin charact interest solut singl patricia trie built set suffix string achiev log disk access substr patricia height insert delet string cost search suffix individu solut practic attract provabl good perform worst case main contribut show data structur result plain combin patricia refin made effect ad extra pointer prove structur properti avoid drawback mention mean string achiev problem ffl prefix log disk jp ffl rang log disk jk jk ffl insert delet string length string set disk access ffl space usag disk space occupi string set disk page problem ffl substr log disk jp ffl insert delet string length string set log disk access ffl space string string set disk page space usag string problem proport number string total length repres string logic pointer turn space occupi asymptot optim problem constant hidden notat small string oper asymptot optim cpu time algorithm read write disk constant number disk page load main memori time result extern memori examin pattern match introduc identifi duplic softwar system problem consist find program fragment ident systemat renam paramet program fragment repres call suffix tree call tree search onlin identifi duplic ignor paramet renam tree algorithm design work main memori deal dynam natur paramet renam formul problem appli string mean minor algorithm modif theoret result string extend search bound improv obtain larg set static refer interest reader section detail examin treat record necessarili textual compound attribut organ sect lexicograph order record combin properli maintain index string obtain concaten offic phone number prefix tool manag compound attribut organ work copi part kei data duplic space overhead string fulli exploit lexicograph order advantag prefix share kei string string support organ copi attribut data structur interpret record text string arbitrari length solut problem space usag string proport number kei string total string achiev space save respect prefix refer interest reader section detail result main memori fix string augment obtain interest result standard ram due balanc tree topolog ffl improv onlin search suffix tree store dynam set string charact larg alphabet reduc search time log log solut problem achiev static string set mean suffix arrai ffl implement dynam suffix arrai linear space techniqu obtain search updat run time bound refer reader section ffl obtain tight log comparison model problem sort string onlin start empti string insert string time mean procedur problem approach requir total log comparison lower log hold examin input charact output permut string straightforward compact requir log comparison worst case recent optim approach base ternari search tree rest paper organ section introduc string discuss main properti oper give detail descript section section review discuss previou work import data structur manipul text collect aim clarifi string main properti advantag section studi applic string conclud paper open problem suggest research string data structur assum string input set store contigu sequenc disk page repres string logic pointer address shown figur locat disk page charact string perform constant number simpl arithmet oper logic pointer manag kei form logic pointer string face major difficulti encount comput geometri ffl group logic pointer string singl disk page read retriev string charact ffl compar string extrem ineffici repeat time cost proport length string involv time call problem due fact input charact time zoo figur store string set extern memori string put order disk repres linear arrai disk page size logic pointer string start posit extern memori logic pointer string logic pointer suffix black box disk page denot special prevent suffix string equal proper organ string method avoid crucial solv problem provabl good perform worst show rest section begin describ data structur solv problem handl kei logic pointer string bound obtain claim perform step transform data structur simplifi version string btree properli organ logic pointer insid node mean patricia combin section introduc structur properti design search procedur avoid problem show solv problem effici show section obtain final version string solv problem ad extra pointer prove properti crucial achiev bound prefix search rang queri start describ data structur rough solut problem repres string logic pointer input string set total number charact denot fk set string lexicograph denot assum string resid link form bidirect string copi intern obtain denot order string set node denot leftmost string rightmost string store node singl disk page put constraint number figur logic layout intern node children js integ properli chosen singl node fit disk page root string distribut string node partit group consecut string group string map group form string set retriev scan leav concaten string set intern node children oe oe order string set obtain copi leftmost rightmost string shown figur copi string child make algorithm node children root result number level call number level start root figur problem solv layout discuss prefix oper detail base interest observ introduc manber myer string prefix occupi contigu part section string prefix rang string string retriev ks leftmost rightmost string prefix rest string retriev lie string string occupi contigu sequenc store logic pointer figur observ manber myer identifi leftmost string prefix string adjac posit lexicograph order section posit string leftmost string symmetr observ hold rightmost string discuss dynam set partit manber myer observ layout answer prefix retriev posit repres posit set mean pair level figur layout input string set set obtain sort string store leav mean logic pointer leaf posit number string lexicograph smaller js posit set leftmost leaf figur made string point figur illustr algorithm scheme identifi pair denot procedur determin posit set begin check trivial case smaller string larger string check turn start root step perform downward maintain invari node visit visit load disk page appli procedur order find posit string set determin adjac string verifi stop intern string belong distinct children leftmost rightmost js true load page leaf child oe oe leftmost descend child oe endwhil figur pseudocod identifi pair repres posit children oe string adjac set due layout determin posit leftmost leaf descend oe conclud posit belong child set oe order maintain invari continu level end find pair repres posit ks leftmost string prefix determin pair repres posit ks rightmost string prefix answer prefix scan link sequenc leav delimit list string string string search similar regular implement procedur perform binari search set examin js string binari search cost regular load disk pai disk access load string examin compar repres string logic pointer call log disk access worst case simpl approach prefix search call time total log log disk access occ disk access retriev string delimit leav bound suffix arrai search auxiliari data structur claim introduct layout good start point find effici implement prefix search carri step layout plug patricia trie node order organ string properli support search compact trie patricia trie figur number label intern node denot length string spell downward path root compar string set log js requir binari search call result data structur simplifi string examin node string patricia trie pt plug defin pt build compact trie string figur label compact trie node length substr store replac substr label arc charact call branch charact figur patricia trie lose inform respect compact trie delet charact arc label branch charact patricia trie import featur discuss fit string btree node independ perform lexicograph search branch node disk access worth note compact trie satisfi featur repres substr label arc pair pointer featur longer satisfi pair pointer number disk access search oper show exploit properti patricia implement procedur phase due call search procedur blind find sourc research literatur refer data structur base patricia intern resembl simplifi string programm data structur highlight structur properti crucial achiev optim bound problem correct posit leaf correct posit common prefix mismatch figur phase blind search mark arc phase blind search hit node mark arc find posit ffl trace downward path pt locat leaf necessarili identifi posit start root compar charact branch charact found arc reach branch descend leaf node ffl load ls string compar order determin common prefix prove properti leaf store string share longest common prefix common prefix determin ls ancestor hit label integ equal greater common prefix length ls string find posit mismatch charact proper patricia trie leaf descend hit node give figur figur depict phase repres rightmost leaf worth note identifi posit compar mismatch charact induc determin correct posit illustr figur start determin common prefix ls string find ls ancestor hit label greater mismatch charact identifi correct posit mark arc figur worth note load disk page store prefix ls string patricia trie store disk make branch charact disk access execut clear put patricia layout avoid binari search node reduc complex log log disk access bound satisfactori match claim introduct reason visit node begin avoid obtain final optim bound design improv procedur deriv directli previou exploit string layout patricia trie properti input paramet addit input paramet satisfi properti string charact equal return pair posit addit output paramet common prefix length ls string comput blind search comment order point show lemma design fast increment compar ls string load examin charact posit disk access theorem back algorithm scheme find posit set modifi pseudocod figur ad instruct step replac step readi analyz prefix search complex search ks leftmost rightmost string prefix identifi pair mean modifi pseudocod sequenc cost examin domin step disk access execut comput total cost log disk access fact telescop retriev ks string prefix examin leav string delimit occ disk access total cost prefix log disk access refer reader section formal discuss result simplifi string layout advantag dynam requir contigu space string insert regular insert lexicograph order identifi ks posit comput pair insert string set posit chang extend chang ancestor full split occur creat leaf oe instal adjac sibl split string set roughli equal part string order obtain oe string set copi string parent node order replac string parent full split worst split extend string root result string height delet string similar face leaf string merg occur join leaf adjac sibl leaf merg string set propag merg ancestor worst merg extend string root height cost insert delet string search cost cost prove theorem set string total length prefix log disk jp rang log disk jk jk insert delet string length log disk access space occupi string built disk page space requir string set disk page substr search show solv problem input string set fffi ffi total number charact denot suffix set suf ffi lexicograph order suffix problem concern power substr oper search occurr find substr equal occurr correspond suffix prefix prefix suf problem retriev suf string prefix turn substr string set prefix suffix set suf examin string shown figur search retriev occ suffix prefix occurr logic pointer store contigu sequenc leav figur set string set suf size execut prefix total cost answer substr log disk access theorem transform notabl simplifi search introduc updat problem repres challeng part solv problem point insert individu string string set jy consist insert suffix suffix set suf lexicograph order insert suffix jy log disk access theorem suf total insert cost log disk access log bound claim introduct bt bt bt bt bt bt bt bt bt bt bt bt bt figur string layout solv problem string set problem treat insert suffix arbitrari string problem solut li fact part string augment simplifi string introduc type auxiliari pointer avoid updat type standard parent pointer defin succ pointer defin string suf succ pointer suf lead string leaf succ pointer leaf describ logic insert delet treat subject formal section insert suffix string store suf longest shortest proce induct make satisfi condit suffix store string share charact adjac string string succ pointer correctli set string string mean dangl case pointer leaf refer reader pseudocod illustr figur detail assum condit satisfi execut procedur jy find leaf insert split occur string redirect succ parent leaf pointer endfor figur insert algorithm step make dangl pointer satisfi condit set repeat insert suffix main problem implement insert procedur ffl step find posit ffl step updat string redirect succ parent pointer effici examin problem find posit find posit string analog prefix approach rest suffix avoid induct exploit condit find start string leaf visit string tempt pointer identifi posit directli pointer dangl condit share charact adjac string condit adjac correctli set condit reach leaf verifi string share charact continu insert perform upward downward string lead leaf posit prove algorithm avoid examin charact posit show string correctli identifi disk access insert string split occur straightforward handl parent succ pointer log disk access insert suffix node split oper redirect pointer possibl distinct split oper insert suffix section show obtain amort cost suffix gener strategi base node cluster achiev worst case complex insert disk total log log disk access requir insert worth note achiev perform insert integ kei regular bound proport number insert suffix total bound give detail discuss updat oper section prove theorem set string total length substr log disk jp insert string length delet log disk access space occupi string string set amount disk page begin formal discuss technic descript patricia trie data structur oper give technic descript string data structur discuss oper detail technic descript patricia denot order alphabet denot lexicograph order string charact string defin longest common prefix iff definit extend case prefix vice append special string fact illustr relationship lexicograph order fact string order string set fx assum string prefix shorthand max maximum ss max integ posit set string lexicograph smaller fact illustr relationship max ss string fact posit max introduc definit patricia slightli suitabl patricia trie pt built satisfi condit figur arc label branch charact intern node outgo arc label charact arc order branch charact root child distinct leaf string denot string leaf store string length jw node lowest common ancestor leav label integ leaf descend outgo arc branch charact charact string intern node pt denot parent descend leav properti suggest denot string implicitli store node equal charact arc implicitli correspond substr length charact equal branch charact charact equal charact posit introduc definit hit node analog extend locu notion compact definit hit node pair leaf ancestor hit node root patricia pt leav intern node root child total space requir total length ss string blind search patricia procedur search method make patricia trie pt effici retriev posit arbitrari string order set state intuit logic section input triplet string output pair posit max introduc special charact smaller charact assum loss gener jp implicitli fact identifi ss leftmost string prefix determin rightmost larger alphabet fact mismatch string ss string prefix jp posit left main phase downward locat pt start root compar charact branch charact arc visit node outgo arc branch charact equal move child set reach branch descend leav leaf store ss string satisfi lemma denot max assum string show reach leaf denot lowest common ancestor leaf store properti patricia proper prefix branch child match branch charact branch charact obtain contradict ls ancestor reach end downward worth note retriev leaf perform disk access branch charact store pt disk page ls posit necessarili correspond posit figur retriev posit comput mismatch charact fact exploit lemma string max definit max lemma deduc lemma deduc charact equal comput start charact begin retriev disk store substr detect hit pair patricia trie upward find posit properti ss string prefix store descend leav lemma comput posit disk access main memori handl case hit node deriv correct patricia trie case branch charact outgo arc match charact move leftmost descend leaf number leav zs left move rightmost descend leaf number leav zs left determin branch move leftmost leaf reachabl arc label number leav zs left case infer string store descend leav share prefix length charact equal descend leav move leftmost descend leaf number leav zs left move rightmost descend leaf number leav zs left worth note comput step phase state basic theorem assum patricia trie pt main memori integ string return pair posit max cost disk access correct lemma analyz total number disk access make disk access perform charact number branch charact pt requir disk access comput charact comparison make disk access charact comparison determin hit node posit dynam oper patricia describ maintain patricia insert delet oper oper pt order string string lexicograph smaller string rightmost string leftmost input paramet satisfi concaten patricia pt pt order creat singl patricia trie pt order set obtain append string build pt merg pt rightmost path pt leftmost path lemma make disk access input paramet main memori technic assum pt pt dummi root connect origin root dummi arc label null charact examin node pt rightmost ff ff node pt leftmost fi fi ff hit node fi hit node definit deduc charact string equal string prefix charact posit equal string definit base concaten pt pt merg path ff ff fi fi concentr sequenc pair consist node ff branch charact label arc ff sequenc merg sequenc integ tie merg turn ff fi singl node fl branch charact build path final tree pt scan sequenc pair connect fl fl mean arc fl label concaten fl children child fl pt pt pair creat dangl arc label step treat hit node ff fi creat node attach set make parent ff fi label incom arc charact make check make node check relat arc ff contract unit ff make check fi correct deriv patricia properti fact order string set comput requir charact comparison js js disk access pt pt assum main memori input patricia trie pt string fx output patricia pt pt built string set fx fx split consid oper pt lemma make disk access input paramet main memori identifi pt leaf duplic pt creat temporari copi pt pt start walk upward pt node delet node descend sibl produc contract arc similar comput perform pt delet node descend left sibl result tree patricia built string set fx fx comput requir charact comparison jsj make disk access pt assum main memori pt add string string set maintain lexicograph order creat leaf instal pt left leaf store input string input paramet satisfi lemma make disk access input paramet main memori identifi leaf hit node instal leaf child label arc charact remov arc branch creat node set instal child label make children label arc arc instal branch charact order make disk access pt assum main memori pt remov string set identifi leaf pt remov child oper make disk access input paramet main memori theorem assum patricia input paramet main requir charact comparison disk access technic descript string technic detail string data structur section introductori concept figur fk denot set string lexicograph order repres ks string logic pointer obtain string set problem suffix set suf problem prevent string prefix append distinct make correctli build patricia trie subset ks string denot leftmost rightmost string leaf string store order string set js patricia trie pt built recal obtain partit leav scan set leaf augment pointer defin list leav string longest common prefix length mismatch charact succ pointer succ pointer string parent pointer inform introduc solv problem obtain suf rememb point leaf suffix succ point pointer intern node string children oe oe order string set obtain copi leftmost rightmost string children copi string child make algorithm node children node patricia trie pt built treat problem parent pointer make node string patricia stuf singl disk page occupi space exce disk page size proper result height properti properti descend lexicograph smallest string lexicograph largest string properti induct fact leftmost child oe satisfi figur properti adjac string longest common prefix length mismatch charact string belong string set leaf string patricia trie leav pt find lowest common ancestor properti patricia deduc mismatch charact branch charact belong outgo arc lead string belong distinct leav string obtain oe find page oe store mismatch charact point begin section search string string built string set fk search arbitrari pattern string state intuit string search section algorithm scheme figur input pattern jp output pair identifi posit set leaf string posit posit string set extend scheme mean power search string updat provid procedur input paramet satisfi output triplet identifi posit extra output paramet max length longest prefix common ks string node string string charact equal string descend leav posit avoid state posit left find string downward pseudocod illustr figur easili deriv shown figur prove lemma node string integ satisfi return triplet leaf posit posit string set max cost disk access procedur true load disk page leaf return child oe oe leftmost descend return child oe endwhil figur pseudocod find triplet hold loss assum fact hold mismatch string ks string prefix posit refer algorithm scheme figur prove step identifi triplet find child oe maintain deeper string set oe examin string set number string lexicograph ks string partit interv interv ks string strictli smaller larger interv string store descend leav posit insid descend leav load page step refin partit ks string interv properti patricia trie pt disk execut blind search mean step procedur return posit adjac string verifi integ max assign theorem feel comment order fact state equal max deduc max max string adjac safe set max paramet max definit leaf stop search contigu part intern examin child oe deduc posit interv set oe leftmost descend leaf properti posit set child oe impli posit insid interv reduc ks partit interv make hold belong oe string layout figur oe set oe loop hold eventu reach leaf simpl induct level string height string analyz total number disk page retriev deeper string extend match prefix examin charact sequenc comput step lemma gener string level disk access retriev node extern disk access execut comput pair theorem input paramet output paramet total number disk access exce readi state theorem prefix implement log disk access recal sort sequenc string perform prefix search oper section procedur retriev leav ks leftmost rightmost string prefix scan leav ly implement prefix retriev avoid string find posit check trivial case disk access direct comparison set leftmost leaf string longest prefix match direct stop search occurr condit execut trivial correctli return triplet log disk access lemma list ks string prefix po string occupi posit check fact po occurr examin po verifi common prefix length adjac string make direct comparison current disk page access contigu part leav string retriev occ occurr occ disk access suffix access leaf corollari rang disk jk jk substr log disk jp rang implement search posit set log disk access lemma list ks string ly cost occ disk access substr implement suf execut prefix theorem search bound state theorem corollari asymptot optim larg alphabet charact access comparison prove lower bound prefix oper pointer introduc aim gener pointer machin extern memori hold rang queri substr search oper pointer data structur graph sourc vertex vertex disk page size item link vertic pattern search algorithm start graph vertex access vertex lead access vertex access link access vertic chang provid number outgo link vertex exce lemma larg alphabet charact access search pattern list occ occurr ks string requir maxf occ log disk access extern memori examin case distinct charact charact ks string deduc page access verifi occurr simpl adversari argument occurr store explicitli total number access page list occ page maintain item search difficult find charact retriev string charact requir disk access graph maximum vertex lower bound verifi log procedur upward posit true load js posit leftmost leaf string return rightmost leaf string return endwhil downward return figur pseudocod find triplet hold search fundament procedur search string base discuss remov integ string load assum charact share longer posit descend leav string investig case design insert procedur problem extend procedur procedur call input paramet satisfi output triplet pair identifi posit max main featur string upward mean search procedur maintain stop satisfi string execut hold pseudocod illustr figur fk order string set lemma node string integ satisfi return triplet leaf string posit posit string set max cost disk access aim string number match charact perform assum loss gener case leaf left phase start string upward detect node lowest common ancestor prove correct phase show loop preserv assign valu step find posit comput max track number charact match procedur theorem face problem decid move upward string current node lowest common ancestor begin check condit step repres case readili find smaller ks return leftmost leaf string safe set theorem fact decid ffl step infer conclud ancestor meet upward properti exit loop begin phase satisfi ffl step satisfi verifi fact belong string set string figur verifi condit hold string layout repeat loop move parent set exist root phase trace downward path start node leaf hold begin phase step execut string start eventu retriev triplet lemma return analyz complex worst execut upward downward string upward disk access load page disk access execut theorem assign max upward total cost telescop sum equal string height downward disk access note step execut due assumpt step execut assum lemma satisfi final total number charact sum upward downward obtain disk access string insert discuss oper problem section implement challeng task face solv problem obtain suf treat problem describ updat string built suf ad string result string obtain insert suffix suf lexicograph order section discuss problem insert suffix elimin explain algorithm structur logic approach formal idea give detail descript insert procedur loss assum distinct suffix suf fy prefix fix number string suf fy lexicograph order denot suf fs suf suf make string store string set suf satisfi suffix store string share max suf charact adjac string succ pointer suf string correctli set suffix succ pointer dangl pointer leaf hold convent insert suffix longest shortest execut pseudocod illustr figur insert string store suf satisfi mean step figur obtain string store suf satisfi final string built suf fy rest section show insert suffix discuss step step step aim comput triplet pair identifi posit suf leaf string posit posit max suf length longest prefix common suf string begin identifi crucial node ffl root string safe set ffl string suf denot suffix charact share adjac string examin assum examin access leaf string leaf point correctli set observ string lemma string set share charact lemma trivial hold string satisfi assum denot string obtain remov charact deduc belong share charact charact equal hypothesi conclud corollari max suf string suf share charact lemma conclud lemma corollari suggest start node examin charact posit perform search execut lemma find triplet disk trivial satisfi root find triplet execut lemma cost disk suf lemma string suf denot suffix check condit hold store leav string properti make succ pointer set reach node disk access comput satisfi node lemma execut order obtain triplet lemma corollari cost disk access suf lemma step triplet insert suffix string mean procedur lemma insert string set requir disk access string suf correspond string insert execut pt paramet determin fact mismatch properti fact posit suf access set prove version lemma disk access insert involv complex case analysi improv complex step split occur insert js string possibl redirect succ parent pointer call handl straightforward postpon detail discuss section state main result lemma insert string string suffix suf log disk access call worst case refer pseudocod shown figur correct induct assum hold true convent find triplet step lemma share charact adjac string fact insert disk access step lemma handl split mean call step satisfi step set dangl pointer order satisfi conclud hold step end insert valid impli correctli built string suf fy complex step requir disk access lemma step disk access lemma step make call step disk access leav page main memori iter total cost hm log call hm insert process total log disk call worst case string delet updat string delet string delet suffix suf longest shortest locat leaf suffix mean log disk access lemma locat leaf suffix simpli pointer disk access load delet string set execut pt merg occur delet js string mean postpon discuss section worth note succ pointer dangl delet lemma delet string string suffix suf log disk access call worst case handl oper describ solut log disk access oper straightforward approach improv solut mean account method amort disk access oper show obtain disk access oper mean cluster techniqu introduc method explain node full insert string set size js larger node delet js smaller pointer handl examin full leaf split set oper appli pt order produc smaller patricia pt pt pt store patricia trie pt place pt insid pt put leaf oe disk page oe sibl updat node inform properli set oe pointer determin longest common prefix length string mismatch properti updat pointer succ lead string move oe point oe succ pointer determin locat maintain string structur insert string set insert parent pointer children chang point sibl ancestor make insert string parent split process continu involv ancestor ancestor encount root creat case height string oper affect adjac oe loss assum oe move oe leftmost string longer oe merg oe execut oper patricia pt pt oe section input paramet obtain properti analog redirect pointer succ oe dealloc oe disk page merg oe parent delet updat parent pointer children merg process continu involv ancestor ancestor encount root remov height string disk access handl node updat incom succ parent exce number store disk page updat total log disk oper involv requir disk access analysi make clear updat succ parent pointer major obstacl achiev effici string updat focu part updat process rest section amort account account method amort analysi show achiev amort bound oper loss assum redirect pointer node split merg deal pair string insert delet oper assumpt motiv string figur node string assign account credit partit suf string node string string root rightmost node level fewer add dummi string node show accumul suffici larg number credit pai disk access updat succ parent pointer node affect split updat leaf children split examin node affect split process string set size js treat pair string full js adjac assum loss gener oe move rightmost string oe oe creat node distribut string oe string oe remain string redirect succ pointer led node order point node examin node affect merg process string set size js treat pair string similar approach present treat problem detail order make subsequ discuss solut clearer js adjac assum loss gener oe move oe leftmost string oe put oe string form set string dealloc oe disk page redirect pointer oe charg cost redirect succ parent pointer previou updat oper achiev amort lemma string insert delet log amort disk access lemma log disk call show credit pai redirect succ parent pointer affect node maintain invari node string set account balanc fi fi fi fi fi fi credit credit updat pointer show manag account maintain invari bl assign credit current height string affect node string set size assign credit balanc order maintain invari bl emploi accumul credit assum integ node split node move string credit oe account delet credit oe credit handl oe split credit account satisfi invari bl credit distribut string give credit balanc js credit oe balanc js js oe spend remain credit updat pointer redirect merg node move string safe add credit oe account delet account maintain invari bl oe account account credit oe credit invari oe account credit concaten string leav credit balanc spend remain credit updat pointer redirect credit updat succ parent pointer oper amort disk access cluster move string pair adjac sibl node lazi fashion obtain bound main idea underli approach execut node frequent distribut cost increment oper involv node consecut oper amort split node adjac creat node oe distribut oe string node oe credit accumul lemma delai distribut process subsequ updat oper pointer node oe node mark string move node form call move mark string succ parent pointer oe time access perform subsequ updat oper merg node adjac set pointer link form mark string move oe move mark string succ parent pointer time access perform subsequ updat oper introduc notion singleton node involv split merg oper follow rule move mark string transform singleton cluster disk access worth note strategi affect insert delet algorithm ignor underli cluster string structur handl discuss deal problem manag full node term full cluster fix total number string mark store cluster singleton cluster string store string string cluster inconsist number string minimum maximum type prove fundament properti singleton cluster form cluster mark string succ parent cluster move form singleton cluster cluster involv occur prove lemma cluster singleton cluster state move mark string transform cluster singleton cluster assum inconsist string cluster access time inconsist treat string pair mark string pointer conclud mark string move cluster singleton cluster inconsist analog argument hold assum inconsist string access time inconsist mark string conclud mark string move cluster singleton cluster inconsist singleton cluster inconsist theorem string insert delet log disk access affect path node insert string node worst current height string access cluster worst case move mark string pointer examin cluster node path cluster case singleton cluster room string move string adjac oe oe oe singleton cluster creat made oe oe room move string oe move mark string intern creat singleton cluster mark string comput disk access cluster insert string inconsist lemma move mark string intern mark creat singleton cluster comput disk conclud total disk access handl perform analog analysi show spend disk access updat string insert delet string requir oper make disk access worst case bound claim lemma remark substr search updat problem solv bound claim theorem rel search bound prove theorem updat bound prove theorem previou work eleg data structur solv problem mention introduct good behavior good tool practic case support good search updat oper ineffici due method pack lot data disk page order avoid page empti updat make perform extern memori survei popular tool manipul text string point theoret limit appli problem tool group main kind explicitli design work extern memori invert file prefix kind index text main memori aim perform string match compact suffix tree suffix arrai easili adapt extern memori price worsen good perform main memori ffl invert file import index techniqu secondari kei retriev role record attribut mean list record attribut list attribut record invert file compon call invert list occupi space practic invert file solv problem interpret record text attribut text substr difficult obtain attribut treat text dna arbitrari substr search introduc lot duplic inform space overhead regard problem turn invert file support poor queri updat unnecessari disk access worst case ffl prefix variat leav kei intern node copi kei rout kei stuff group singl prefix store disk page bound capac string possibl longer problem overcom repres kei string logic pointer emploi separ implement rout kei intern node separ kei short string lexicograph order shortest separ chosen save space empir strategi separ short updat shortest uniqu prefix kei separ fail separ length proport kei length introduc lot duplic inform practic kei common prefix adjac lexicograph order strategi compress scheme store kei intern unix prefix kei begin charact kei store charact replac integ approach save space prevent kei lot charact rest posit perform prefix good kei charact long exploit power solv problem search occ log disk access updat disk access perform poor worst case treat occur problem ffl suffix arrai fast search cost depend alphabet size suffix arrai essenti store text suffix lexicograph order mean logic pointer data structur adapt extern memori partit contigu disk page limit kei length search log occ disk access practic point suffix arrai index data structur pointer suffix store suffix arrai modifi invert file contigu space store constrain text string longer dynam version main memori suffix arrai recent extend work extern memori price lose space optim occupi log disk achiev search bound ffl suffix tree compact gener power data structur wide emploi string match problem suffix tree compact trie built text arc label text tripl denot substr sibl arc order distinct node child root node string obtain concaten label found downward path root node append leav correspond text suffix leaf store distinct suffix suffix tree augment mean special call suffix link turn crucial effici search updat oper suffix link node store nonempti ay charact lead node store node exist suffix link lead denot suffix link charact suffix tree requir linear space call gener suffix tree treat string set search pattern string requir log occ number pattern occurr insert string delet log time suffix tree power data extern memori lose good search updat perform index larg text collect fit main memori due suffix tree unbalanc topolog intern node correspond repeat substr tree inevit inherit drawback point scientif literatur regard page unbalanc tree extern memori good solut problem group node page node insert make analysi extrem difficult avoid store downward path node distinct page worst case node pointer children fit disk page store separ disk access overhead branch node branch node children requir disk access order retriev disk page substr label arc label pointer order occupi constant space updat suffix tree string insert delet requir insert delet node unbalanc structur oper inevit reli merg split disk page order occupi approach split merg disk page disk access node move page suffix link lead node move redirect page conclud adapt suffix tree solv problem effici worst case search pattern length log disk access problem point insert delet string log disk access problem page split merg point disk access problem page split merg point compact perform extern memori heurist confirm clark munro obtain effici implement suffix tree extern memori compactli repres patricia data structur solv problem log disk access substr patricia height insert delet string cost search suffix individu solut practic attract provabl good perform worst case applic softwar duplic pattern match problem introduc aim find program fragment softwar system ident systemat chang paramet program fragment form token sequenc produc lexic analyz encod call formal point sequenc charact disjoint order alphabet fix symbol fix paramet symbol identifi occur transform paramet renam bg zg simultan replac jxj integ suffix tree gener call introduc subsequ improv perform onlin pattern match effici algorithm design paradigm deal properli dynam natur paramet renam main problem design effici algorithm concern properti hold ordinari string properti hold common prefix bt distinct context bt asc sc td properti defin suffix link suffix tree creat problem tree construct string properti lemma work undergo slight denot alphabet set integ disjoint defin oper transform string constant symbol map paramet occurr map leftmost paramet occurr map integ denot distanc previou occurr posit state arbitrari charact comput constant number arithmet oper examin natur extens problem problem stand show theorem string extend solv problem loss effici set made total length set suf made string obtain appli prev suffix suf ffi worth note suffix sort order examin string built suf search transform pattern pattern string mean prev search pattern string string string procedur section insert consist insert suffix current string section extend case properti string suf share charact requir identifi node mean due lemma properti execut continu section delet perform procedur section state theorem set total length string built occupi disk page search occurr log disk access insert set delet log disk access string main memori alphabet larg achiev search requir time improv log search bound larg string construct requir log time complex tree constant size bound index maintain indic copi kei string indic solut problem import compound attribut organ sect maintain lexicograph order record combin attribut make copi string turn power tool index necessarili text record fr alphabet made ascii introduc index function transform record string lexicograph order birthdai string format month string concaten field phone number map record power handl kind string manipul origin record field concaten necessarili logic pointer lead appli problem string set fk provid index requir space total string length recomput time access string comput load compar string level string patricia trie layout node string shown section approach requir string comput ds record order index function insert delet individu record compar solut obtain prefix introduc string duplic requir jk space larger store string explicitli index mean heurist section string exploit lexicograph order advantag longest common prefix string ff longest common prefix string fi string fi singl charact prefix store string string integ suffix fi string logic patricia trie string space usag proport number string involv total length achiev space save respect prefix maintain competit cost dynam suffix arrai dynam suffix arrai dynam version suffix arrai implement linear space techniqu obtain perform suffix tree larg alphabet reduc search time log log time bound obtain static string set mean suffix arrai dynam suffix arrai data structur combin flexibl suffix tree lexicograph order suffix arrai balanc search tree leav store suf suf set suffix logic delet suf dynam suffix arrai support find sublist suffix suf prefix insert suffix suf mark suffix suf logic remov insert unmark suffix remov implement oper string data structur main memori balanc search tree satisfi addit constraint leaf string leav string suf separ list ls list longest common prefix length adjac string ls leav string mark logic delet intern node mark descend mark fact leaf string nearest leaf suf left identifi time updat oper implement straightforward updat oper string section implement slightli section account fact suffix suf prefix mark delet list belong aim find sublist ls ls suffix prefix time complex depend suffix belong suf design search procedur ls return leav delimit ls size influenc total time complex find leav search leaf store suffix suf pg theorem proof appli fact leaf retriev identifi leftmost unmark leaf leaf found symmetr mean leaf suf xg ls condit check time check prefix theorem dynam suffix arrai string set total length implement augment string occupi optim space requir log appli string time data string effici implement oper prefix rang substr string insert collect string bound provabl good worst case regular support oper power manag string arbitrari length string successfulli appli interest discuss introduct section present effici work model perform disk cluster techniqu good theoret interest investig practic behavior string order valid gener approach singl theoret refin effect practic set preliminari set experi carri shown string string lead fast search updat reason amount time acknowledg jeffrei show adapt amort analysi order obtain bound updat oper theorem don knuth point refer grate point relationship string string sort comparison model mike rao fabrizio discuss earli result paper refer complex sort relat problem commun acm design analysi comput algorithm dynam dictionari match journal comput system scienc alphabet depend match inform process letter effici implement suffix tree practic experi myriad virtu subword tree combinatori algorithm word nato asi seri comput system pp theori pattern algorithm applic acm symposium theori comput pp pattern match algorithm symposium discret algorithm pp organ mainten larg order index acta informatica prefix acm tran syst fast algorithm sort search string proc symp discret algorithm pp commerci applic natur languag process commun acm effici suffix tree secondari storag symposium discret algorithm pp data compress adapt code partial string match ieee transact commun ubiquit comput survei introduct algorithm mit fast increment text edit symposium discret algorithm pp data structur extern substr search acm symposium theori comput pp fast string search secondari theoret develop result symposium discret algorithm pp dynam dictionari match extern memori inform human genom project informat commun acm inform data structur algorithm ch indic pat tree pat pp comput geometri ieee foundat comput scienc pp outlin organ system paper ann meet acm effici algorithm pair problem inform process letter sch multipl match pattern theoret comput scienc rapid identif repeat pattern arrai tree acm symposium theori comput pp biolog inspir comput intern joint confer artifici intellig pp art comput program ch sort search faster algorithm construct suffix tree ieee foundat comput scienc pp retriev combin index comm acm inform process letter suffix method string search siam journal comput suffix tree construct algorithm journal acm implement data compress scheme ieee transact commun practic algorithm retriev inform code journal acm oneil structur sequenti access acta informatica ieee special issu candid improv organ associ memori ieee tran commun electron trie method text spatial data structur secondari storag phd mcgill alloc binari tree secondari storag bit data structur rang search secondari memori symposium discret algorithm pp class algorithm requir nonlinear time maintain disjoint set journal comput system scienc data structur network vol region confer seri appli mathemat special issu algorithm parallel memori algorithmica unix tech bell laboratori linear pattern match algorithm ieee symp switch automata theori pp algorithm sequenti data compress ieee tran info theori compress individu sequenc code ieee tran info theori
IR/1358 5 adapt featur learn document learn web search richard comput texa pan american west tx usa depart comput citi hong kong hong kong contact depart comput scienc texa pan west drive tx usa abstract paper report research build featur intellig web search engin perform adapt featur document learn featur learn user document relev automat extract suggest index keyword relev search queri learn user keyword relev feedback speed search process enhanc search perform design effici learn algorithm work featur learn document learn featur emploi algorithm intern index perform adapt learn find desir document relev feedback user architectur perform featur discuss introduct world wide web rapidli evolv web search provid interfac human user vast inform web peopl daili life number popular success meta search engin googl metacrawl dogpil infer find exist engin support person predefin user profil collect customiz paramet suggest keyword includ languag document function search engin find relev document user user profil automat creat mean digit trace track user pattern manual creat user profil server side client side case collect customiz paramet fix case paramet automat gener track recent process user search engin compil list suggest keyword base intern rank user recent content futur search natur person static defin search process support adapt learn user relev feedback interact refin approach gener intellig search engin built top exist search engin design implement techniqu built integr intellig compon search engin collect search engin intellig search engin search result search engin start search adapt learn user feedback boost enhanc search perform relev accuraci featur document cluster method adapt learn process recent research web commun short list hit return search engin start set search effort appli machin learn web search relat scientif articl locat user profil crawl collabor filter user prefer boost adapt search algorithm basic search start url crawl neighbor featur part research build intellig search engin document featur limit keyword index approach appli case document featur search engin dynam featur dynam vector explor search result return queri user strategi dynam featur relev queri map document search space substanti smaller subspac dynam vector space relev queri present featur learn algorithm extract small set dynam relev index keyword search queri suggest keyword user judg relev featur learn algorithm work concurr document learn algorithm oper relev judgment retriev relev document user learn algorithm speed search process enhanc search perform intern index document index keyword design implement searcher featur index featur intern index learn algorithm perform adapt learn web search retriev relev document requir feedback dynam featur dynam vector space spite world wide web size high web document index tradit vector space model inform retriev web document search implement adapt learn limit comput ultra sun appli tradit vector space model directli recal back altavista system run ram disk space model effici time space featur web search implement limit comput resourc model enhanc comput perform web search system comput resourc examin index web search paper keyword document index featur denot set index keyword web portion web document denot set index keyword index valu size substanti smaller size bound constant simplest case keyword index implement keyword index document intern automat gener keyword index document retriev search process relat search queri denot collect document match set index keyword relev denot size vari substanti smaller size bound hundr thousand practic definit search queri defin set dynam featur relev search queri definit search queri dynam vector space relev defin vector space construct document document index dynam featur queri featur find set document match queri find search strategi search intern altavista found intern find set dynam featur construct dynam vector space featur start adapt learn process user document featur relev feedback learn algorithm parallel achiev goal algorithm adapt learn document judg user relev irrelev extract suggest small set keyword relev search queri learn keyword judg user relev irrelev featur learn algorithm document learn algorithm rank relev document learn algorithm featur learn algorithm rank relev featur featur learn document learn investig intellig web search model approxim adapt learn process learn search engin act learner user teacher user send queri engin queri search index return list document url rank rank function user relev engin feedback improv search return refin list document url learn process end engin find desir document user queri enter user understood logic express collect document user list document url return engin interpret approxim collect desir document rocchio relev feedback popular queri reform method inform retriev essenc adapt learn exampl show typic similar measur cosin dice jaccard list rocchio relev feedback algorithm lower bound linear boolean vector space linear lower bound hold arbitrari initi queri arbitrari classif threshold updat coeffici step algorithm linear lower bound prove base worst case affect effect applic relev feedback algorithm lower bound understand algorithm find strategi improv perform design learn algorithm perform gener set learn search queri search strategi featur find gener match document set dynam featur set dynam vector space ki denot dynam featur index learn algorithm featur maintain common weight vector dynam featur compon real valu featur learn algorithm extract learn relev featur document learn algorithm classifi document relev irrelev note learn process learn algorithm updat common weight vector concurr algorithm equip effici rank function provid good strategi simul queri document learn user realiti serv real teacher model learn featur learn algorithm dynam featur ki initi rank ki recal ki index keyword featur rank function common weight vector extract learn relev featur algorithm stage sort dynam featur rank function extract featur suggest user judg relev queri receiv featur relev feedback user featur ki judg user relev promot ki set wi featur judg user irrelev demot set wi wild featur promot demot tunabl document learn algorithm algorithm tailor version design successfulli implement recent project set initi weight set initi weight promot strategi set initi weight simpl motiv focu attent propag influenc relev irrelev document adjust search space approach feasibl exist effect document rank mechan coupl learn process algorithm tailor common weight vector threshold classifi document weight promot demot factor classifi document vector satisfi irrelev user document contradict classif make mistak denot weight wi current updat user respond document contradict current updat weight document judg user relev vector set xi xi xi document judg user irrelev vector set contrast linear lower bound prove rocchio relev feedback algorithm learn algorithm surprisingli small mistak bound learn collect document repres disjunct small number relev featur mistak bound independ index featur learn collect document repres disjunct relev featur index boolean vector make number dynam featur occur learn process averag relev featur index dynam featur relev document judg user learn bound theorem improv number dynam featur occur learn process theoret analysi mistak bound left full version paper actual implement learn algorithm requir document rank queri simul subsect figur architectur featur document rank rank function independ defin rank function web document vector xd remain constant document learn process strategi defin pagerank classic vector rank addit tune paramet individu document promot demot document judg user feedback fid updat similar fashion wi updat queri simul featur rank function rank document return top rank document user top rank document repres approxim classif made quantiti replac larg user interest small number top rank displai space limit visual user examin short list document end search document judg document relev feedback provid addit top rank document system provid user short list document top document short list select randomli motiv list give user view classif made learn algorithm featur architectur figur interfac featur featur implement ultra sun workstat storag hard disk ibm workstat program code architectur shown figur featur maintain intern index index index keyword intern index metasearch queri document retriev index work learn algorithm updat common weight vector concurr major compon function explain subsect featur work featur interfac shown figur user enter queri number document url return enter queri start featur featur invok queri document relev featur relev feedback dispatch decid current task initi search process learn process initi search dispatch call find relev document intern index relev document found pass rank document send final gener html content shown user fail find document relev queri featur call metasearch queri altavista retriev list document length list determin user list top match document featur call retriev collat index index keyword index keyword automat extract retriev document parser index document cach displai user show top rank top rank user judg document relev featur relev initi search show top rank document format present top rank document top rank featur shown figur document url featur radio button user document featur relev clickabl url select view document user make judgment accur relev submit feedback view document enter queri start search process figur initi queri result current task learn process user document featur relev dispatch send featur relev feedback inform featur learner document relev feedback inform document learner relev irrelev featur judg user promot demot relat featur weight common weight vector relev irrelev document judg user posit neg exampl promot demot weight vector perform individu document promot demot judg document finish promot updat weight vector dynam featur search find match document match document send select document featur displai featur altavista made featur open public access interest reader access url end paper check perform featur earli actual perform order provid measur system perform made comparison altavista featur evalu base approach similar recal search queri denot set document return search engin altavista denot set document relev integ search process shown figur perform march queri word desir web document relat learn interact total relev irrelev document relev irrelev featur judg user relat web document initi match document move top posit search engin defin rel recal rel conduct experi search altavista featur result return engin examin manual calcul summar averag rel recal averag rel notic ha featur beer perform altavista featur altavista featur column label pair integ total number document retriev engin search queri defin rel recal natur obviou altavista rel queri rn averag rel recal valu calcul featur averag interact refin figur result exampl featur judg conclud remark part effort build intellig search design implement featur util adapt learn algorithm work concurr extract learn relev dynam featur user featur relev learn relev document user document relev judgment featur earli stage improv enhanc aspect futur plan improv learn algorithm cluster method url infer refer angluin queri concept learn machin modern inform retriev billsu pazzani learn collabor inform filter fifteenth intern confer machin lee gile autonom web agent automat retriev identif interest public intern confer autonom page acm press lee gile system automat person track scientif literatur web fourth cm confer digit page acm press brin page anatomi hypertextu web search engin seventh world wide web kleinberg automat resourc compil analyz hyperlink structur text seventh world wide web page chen meng client site meta search learner accept aaai workshop artifici intellig web juli fowler search web queri knowledg inform fowler learn web search accept intern confer web inform system june chen zhu formal analysi rocchio relev feedback algorithm technic report dept comput march singer effici boost algorithm combin enc machin fifteenth intern raghavan infer web commun link topolog ninth cm confer hypertext id experi relev feedback smart system experi automat document page englewood adapt web search engin acm workshop web inform data jr jj rocchio relev feedback inform retriev smart retriev system experi automat document page englewood kleinberg authorit sourc hyperlink environ journal lee gile index retriev scientif literatur eighth cm intern confer inform knowledg lewi learn intellig inform retriev eighth intern workshop machin page littleston learn quickli irrelev attribut algorithm machin meng chen person web search inform client side advanc comput scienc page intern academ nakamura ab collabor filter weight major predict algorithm machin fifteenth intern renni mccallum reinforc learn spider web effici sixteenth intern confer machin salton automat text retriev inform comput salton bucklei improv retriev perform relev feedback journal american societi inform cs yang vector space model automat index comm dh tr yu adapt algorithm learn user interest cm intern confer inform knowledg page yuwono dl lee search rank algorithm locat resourc world wide web intern confer data page
Agents/1359 1 mental model impact social mental state autonom agent pietro nichola jen timothi norman dept electron comput southampton uk dept electron comput southampton uk dept comput aberdeen uk abstract paper present framework captur social natur agent situat environ impact individu mental state role social relationship provid abstract develop notion social mental shape extend standard intent model account common social phenomena collabor integr unifi theoret perspect reflect fulli explic model autonom mental state agent bdi social influenc introduct comput rapidli gain accept power model design implement wide rang softwar system paradigm base notion agent entiti situat dynam predict environ receiv perceptu input effect perform action graesser fact agent autonom mean high decid condit action perform agent requir attain goal made easier satisfi complet interact similarli agent gener term wide rang social behaviour joint cooper achiev common collabor search space problem order find joint negoti mutual accept agreement form interact unit fact inher intertwin process social influenc agent exert behaviour agent influenc acquaint make belief perform individu activ exist activ exist influenc process li heart social system behaviour agent determin intern driver interplai physic environ behaviour social agent influenc social interact engag process influenc repres essenc social receiv surprisingli attent date form influenc studi context specif type interact cooper krau jen werner coordin collabor al negoti al faratin al systemat analysi gener process se shortcom paper seek rectifi conceptu framework present process influenc work broad class agent model delib agent architectur jen view term belief agent desir agent intent agent commit canon exampl architectur includ irma al pr lanski mechan structur enabl social natur agenthood impact individu behaviour identifi focu cognit agent intent stanc term social mental shape al accur denot process influenc case provid clear conceptu model social natur agent impact individu work extend state art wai identifi fundament structur mechan underpin wide varieti social interact system shown notion social mental shape common form joint behaviour process collabor negoti identifi common paper unifi framework express dispar work formal model social agenc place date interfac model individu social social mental shape repres step goal produc account collabor system al social mental shape regard fundament process underpin relationship micro macro practic reason environ remaind paper section show inadequaci standard bdi model social section inform introduc notion social mental shape kei concept role social relationship central model section present formal framework model social mental shape express complet specif underli formal languag section detail model section introduc number axiom ensur consist mental state face compet social influenc section show social mental shape number kei type social relationship section describ experi notion appli econom domain section situat work relat section conclud avenu futur work natur exist bdi model bdi model wide advoc conceptu framework build intellig agent al lanski research attempt captur kei properti formal model levesqu georgeff work concentr individu explicit structur model social activ main reason limit mental state bdi agent view constitut intern motiv attitud overcom provid complet model bdi model extend mechan captur social natur agent abil interact defin newel issu address social natur agent impact individu mental state question mental state influenc system relationship mental state interact conceptu mechan enabl relationship number theoret model extend bdi framework deal facet question castelfranchi introduc notion social defin commit perform action castelfranchi argu notion reduc intern commit individu agent group captur depend relationship agent cavedon al notion social attitud reflect persist perform action attitud defin ternari depend relat agent team respect state affair cavedon al logic mean agent ai agent aj respect φ analogu belief social attitud captur interact convei idea agent adopt mental attitud commit agent social commit social attitud captur aspect relationship agent suffer number shortcom social natur agent impact individu mental state form social commit agent perform action agent persuad adopt mental attitud agent al parson al mode social influenc ground form social agent adopt mental attitud result persuad necessarili commit priori agent decid chang mental state basi confid concept mental state influenc role system social relationship agent basic reflect actual interact potenti potenti interact agent web interconnect exist role role structur system section fundament social enact impli enact role role relat adopt role impact mental state simpli role impli set expect behaviour agent actual social relationship agent necessarili involv social mental state influenc attitud eventu establish social interact relat role agent adopt role secretari expect adopt goal intern motiv mental attitud agent gener complet unaffect social set contrast social motiv attitud agent led adopt fact situat system agent fulfil goal requir case specif agent occupi role boss role actual social relationship secretari adopt goal achiev goal requir regard simpli driven adopt secretari agent eventu boss role social natur agent impact mental state actual potenti social relationship extent agent social capabl reason repres agent intent term mental apparatu chang complement simpli mental attitud happen actual potenti social relationship agent involv agent induc adopt agent awar social interact specif role occupi light social social attitud captur impact social natur agent mental state behaviour attempt made paper overcom limit provid unifi framework gener influenc social autonom agent mental state investig compon framework apparatu standard bdi model levesqu al parson al rao georgeff singh wooldridg framework enrich mechan principl interfac agent make modifi light social interact notion role type relationship role kei abstract framework role view kind task descript buchanan relationship type link role section prime professor secretari view role link relationship type abstract fact prime minist professor role typic involv control secretari role rise relationship type type instanti bring cavedon al describ team singl agent endow primit social attitud differ social relationship notion kei abstract provid neutral mean model social role relat easili express logic repres step interplai social agent section inform introduc notion social mental shape concentr defin role social relationship fulli section bring concept individu apparatu provid unifi pictur social agent introduc social mental shape social mental shape concern conceptu mechan describ goal intent influenc social natur concern issu agent influenc adopt mental attitud view agent social motiv adopt mental attitud agent social simpli agent social relationship social environ role agent social plai activ causal role govern agent intern motiv mental attitud mental broaden account impact role agent exert provid social motiv mental attitud reason maintain individu motiv attitud mechan enabl broaden effect identifi central idea aid examin natur function social mental shape system structur notion refer member system relat buchanan repres basic aspect system develop design manag gener interact protocol al agent relat establish wai agent relat studi term set stabl pattern interact system structur label give pattern interact type system structur dimens system differenti pattern interact identifi restrict attent concept role role structur system role structur defin stabl pattern relat exist role system buchanan stabl pattern relat role foundat stabil wai agent interact behaviour agent system regard constrain set expect agent interact member system expect repres cognit compon notion social role provid agent set expect role structur view sourc stabl pattern interact agent role structur system impact mental state main wai adopt role influenc constraint player set stabl expect respond set expect mental attitud set expect respond mental attitud behaviour role structur system instanti agent influenc social relationship flow interrel role social relationship involv relat role occupi agent awar connect social relationship impli instanti agent relat relat role give rise number instanti social relationship perspect dealt turn case adopt role system social scientist differ term definit depend role descript action definit concept role buchanan prescript definit concern agent plai specif role evalu assess role perform descript definit role base actual duti perform agent studi action definit base action perform pursu role duti role consid perspect view interrel interdepend role secretari job descript main duti manag minut repres prescript definit definit criteria standard make assess role secretari perform observ note detail individu secretari spend descript definit role secretari develop observ action perform pursu role task secretari speak establish action definit secretari develop cognit definit concept role requir section role conceiv system mental attitud agent adopt occupi role perspect role view provid agent inform goal attitud drive behaviour role inform problem possibl address role inform agent inform resourc achiev react mental attitud return secretari role busi role regard lead adopt motiv goal contribut success adopt specif goal draft routin correspond secretari role provid agent inform familiar task role influenc agent commit proce offici instruct requir differ agent substanti affect behaviour role ident standpoint conceiv ideal type role system attach mental instanti role invari involv mental attitud intern motiv role specif mental attitud drive behaviour mental attitud underpin agent includ idiosyncrat attitud reflect differ agent adopt attitud bring modif idiosyncrat attitud adopt goal attach role requir agent drop intern motiv goal inconsist section case manag believ adopt relax particip style role expect lead adopt formal direct style behaviour complianc set goal make difficult imposs compli goal expect set goal conflict creat inconsist inconsist social intern motiv mental attitud overcom order agent behav ration levesqu rao georgeff simon turn influenc exert agent mental state agent social relationship number wai agent influenc mental state main mode social influenc found system author agent influenc adopt mental attitud entitl guid behaviour author defin power agent guid behaviour affect mental state disposit agent influenc adopt mental attitud simpli intend contribut welfar assumpt benevol present earli distribut system al lesser trust agent influenc adopt mental attitud strength confid critic scrutini review evidenti basi luck marsh agent influenc adopt mental attitud process argument al parson al walton adopt mental attitud depend convict suggest judg partli actual process resolut achiev depend specif agent architectur scope paper section introduc axiom partli merit agent make true agent act recommend judg time constraint requir accept recommend agent trust agent persuad adopt agent mental attitud process bargain negoti buchanan agent adopt mental attitud return desir behaviour threat agent threaten adopt mental attitud basi futur neg deni al sierra al agent influenc adopt mental attitud threaten execut action conflict goal intent agent influenc threat act fulfil goal intent list main mode influenc found system meant exhaust mutual agent decid mental attitud base result mode social influenc suitabl circumst relationship main form influenc author boss disposit effect mode social influenc depend social relationship mode influenc exploit social social relationship exist agent unawar exist definit social relationship section benevol disposit reflect form social influenc occur exist social relationship author absenc social relationship agent prime minist author citizen awar ident social relationship consum persuad simpli adopt consist underpin social agent mental state intent bui product case social produc awar consum potenti interest bui product notion social relationship build concept system role structur instanti relat role agent role role presum enact role interrel pair relat role instanti agent role relat entail set expect mental state behaviour agent occupi attach secretari role belief goal intent attach boss attach boss role set belief goal intent attach secretari role specif instanti relat role agent rise social relationship agent social relationship regard major causal forc shape mental state behaviour role agent adopt belief goal behaviour constrain expect goal intent interact agent boss agent secretari role influenc adopt goal intent role agent adopt belief secretari goal behaviour influenc set expect princip effect chang goal intent activ interact agent secretari agent boss role induc rectifi updat modifi goal intent secretari activ social natur impact individu mental state behaviour impact explain term role adopt mental attitud term social relationship agent mental state provid reason individu motiv agent social relationship offer mental attitud adopt complement chang individu mental state suggest view mental attitud increasingli spread social environ social natur agent lead social situat mental attitud agent regard kind associ engag iter seri social action interact aim complet mental state complex interplai agent social environ turn process agent social relationship plai kei complement augment agent bare individu mental attitud complet process term social mental shape intuit section introduc formal languag process express basic definit section introduc formal framework process social mental shape explor detail complet formal definit give descript model time underpin logic concentr analyt tool principl reason repres individu apparatu notion role social relationship formal languag draw extend work bell huang cohen levesqu rao georgeff wooldridg jen reason agent mental explicit refer time point interv oper usual equal oper classic quantifi remain classic connect existenti quantifi assum introduc abbrevi usual punctuat symbol dot comma time term denot time variabl rang time point occurr formula φ stamp time written mean φ hold time ti time point assum discret linear addit time term denot tempor variabl rang time interv tempor interv defin pair point interv form equal written time point time point ti time point increment ti time point obtain extend ti time point interv ii interv increment ii ii ii conveni adopt interv term form abbrevi simpli ti multipl occurr interv term elimin result unambigu abbrevi complex sentenc tempor term repeat adopt convent miss tempor term formula closest tempor term bel goal state time ti agent ai believ time ti agent aj goal make φ true time ti agent term denot variabl rang individu agent agent typic requir perform make achiev number properti agent graesser jen wooldridg wooldridg jen agent control task resourc part cooper activ agent respond perceiv chang place environ affect mental state agent simpli act exhibit opportunist initi exploit creat serendip note formula special treatment appendix agent social initi social relationship mutual support execut joint action newel agent cognit agent endow mental attitud repres world motiv action al wooldridg agent intent stanc repres agent cognit agent similarli endow mental attitud motiv cognit agent mental state apparatu build fairli standard bdi framework al cohen levesqu rao georgeff singh wooldridg mental state set interrel mental doxast attitud motiv attitud develop technic apparatu deal semant individu agent belief desir goal intent section introduc joint doxast mental mutual build transcend individu agent belief belief belief set includ belief belief mental attitud introspect belief discuss belief set incomplet agent updat belief observ world receiv messag agent express introduc modal oper mean time ti agent ai belief φ hold formal semant modal oper natur extens tradit hintikka semant model world agent ai time point frame centr set world binari relat doxast altern ai ti ai distinguish actual world model world variabl assign semant bel sentenc bel iff φ assum usual schemata axiom modal rule bel bel bel logic bel bel bel bel bel bel bel bel introspect φ bel rule condit relat levesqu serial transit euclidean relat satisfi condit valid axiom axiom kb theorem complet normal modal logic necessit rule nb rule infer normal modal logic axiom assum unbound variabl quantifi ai ti dt set time world axiom assum φ ψ replac formula languag desir desir conceiv set state world agent bring bell huang krau al desir consist agent desir desir lead contradict agent desir conflict believ express introduc modal oper mean time ti agent ai desir φ desir de φ mean agent ai time desir φ hold tj semant de analog bel kd basi logic de de de necessit properti φ de axiom kd necessit rule theorem rule infer normal modal logic goal goal defin set consist state world agent autonom potenti candid motiv govern current futur behaviour goal repres agent agenda autonom select state agent expect bring huang agent goal nonetheless goal necessarili desir goal desir repres state world agent expect bring reflect agent achiev agent select goal desir constrain condit goal consist desir inconsist section subset consist desir potenti candid move select subset consist desir consist desir goal consist belief set feasibl desir potenti transform goal agent gener goal agent expect bring state necessarili repres state world achiev goal instrument achiev goal desir agent gener goal work hard simpli believ fulfil success agent desir work nonetheless adopt goal instrument achiev goal desir express introduc modal oper mean time ti agent ai goal φ goal goal φ mean agent ai time goal φ hold ti tj axiom kg dg state goal assum close implic goal goal goal goal goal introduc weak realism constraint goal agent goal proposit negat believ agent goal contradict belief goal logic goal condit serial properti contrast krau goal desir contrast framework agent goal desir φ cohen levesqu st iff relat satisfi condit valid axiom axiom kg necessit properti φ goal semant goal analog bel de intent fundament characterist individu intent involv special kind act wright long agent intend achiev commit act perform action deem achiev state reed distinguish form depend argument action proposit grosz krau intent subdivid intent involv perform intent involv achiev state affair perform action grosz krau type intent commit agent adopt conflict intent constrain replan case failur main concern paper agent make restrict attent repres basic attitud commit agent practic reason inher intertwin agent adopt goal intent intuit agent achiev goal simultan subset goal commit act assum belief goal properti framework agent adopt goal time grosz krau identifi potenti agent potenti conceiv similar call candid move fulfil subset agent commit fulfil intent goal intent goal intent agent adopt autonom potenti motiv behaviour extent result agent autonom select intent regard goal agent commit achiev definit goal section intent goal typic adopt agent relat instrument achiev agent agent oblig adopt result subject author influenc regul intuit agent autonom select goal automat compel adopt intent social environ instrument achiev autonom chosen agent forc adopt intent agent author control behaviour section base goal autonom decid subject anoth author relat agent oblig chang mental adopt intent modifi behaviour correspondingli agent oblig adopt intent set norm regul reflect system section agent autonom decid member system enter system agent chang mental state adopt intent rule norm govern system exampl adopt intent extern forc reflect deontic aspect agent practic reason modal oper repres agent intent proposit φ hold time ti mean time ti agent ai commit action φ hold desir intent int φ mean agent ai time intent φ hold ti tj intent present intent close implic consist int int int int int introduc weak realism constraint agent intend proposit negat believ ensur intent contradict belief al wooldridg int necessit properti φ int logic int condit serial st iff relat satisfi condit valid axiom di semant intent analog goal mutual belief develop mutual form joint doxast mental attitud jointli maintain group individu agent mutual belief defin infinit conjunct belief belief belief proposit hold levesqu focu mutual belief attribut pair agent extend group agent agent ai aj formula languag includ modal oper mean time agent ai aj mutual belief proposit φ hold semant modal oper defin examin semant member group mental attitud formula rao al introduc oper mean time agent ai aj φ hold aj ti bel bel time agent ai aj mutual iff time ti ai aj φ believ believ φ believ believ believ φ ad jen wooldridg defin aj induct aj abbrevi aj aj aj mutual belief φ group aj time ti defin aj aj al unlik previou work area al framework mutual belief requir entiti express term belief individu agent jointli maintain mutual belief common work field al definit advantag captur interplai agent individu belief propag upward level mutual belief regard transcend individu agent mental state role logic enrich term denot variabl rang role draw cognit perspect advoc earlier role view set mental attitud govern behaviour agent occupi posit structur agent system mental attitud typic defin role goal intent occupi adopt adopt turn impact agent mental state agent mental attitud simpli complement attitud conceiv role turn entiti sonenberg werner role entiti endow mental attitud physic social environ connect role rest cognit role term attach mental attitud concept role entiti clarifi respect mean endow mental role capac perform cognit process transform mental attitud role transform goal attach intent transform agent adopt attach final commit fulfil georgeff endow mental role construct regard capac perform action unabl affect extern world order reduc discrep world regulatori intern role endow capac pursu adopt bring state world goal attain attempt develop cognit model role literatur werner social role descript abstract defin state valu agent role agent role mental state ra rr part ra cavedon sonenberg role term mental attitud associ goal modal assert adopt role involv adopt goal φ level abstract express gener social commit section cavedon sonenberg agent adopt role commit goal φ social commit agent involv relationship cavedon sonenberg extend framework captur influenc role agent model introduc predic assert role relationship rn influenti agent role cognit model role present paper extend framework line role goal gener standard set mental attitud introduc describ reason ration agenc role section import order investig full impact role system mental state logic enrich primari modal oper predic express fact agent role assert agent ai role ri time ti ai linda ri mean time ti linda act secretari depart modal oper introduc develop cognit role term attach mental attitud section oper express mental attitud agent adopt role attach section shown role term attach mental attitud underpin impact role structur system mental state system member mental attitud section semant mental attitud express access relat world cognit role advoc attach role main type mental mandatori attitud option attitud mandatori attitud constitut relev role attach attitud agent adopt role option attitud intim constitut role attach attitud decid adopt attach role secretari goal correspond refer job specif oblig adopt goal attach goal friendli peopl secretari expect oblig behav colleagu section distinct mandatori option mental attitud shown fundament problem prevent automat agent occupi role system unnecessari danger strong forc agent adopt mental attitud role axiom schema doubt agent commit adopt subset mental attitud attach circumst autonom agent decid adopt mental attitud attitud attach role agent decid reason note model flexibl cavedon adopt mental attitud attach role approach advoc agent adopt subset mental attitud attach role subset mandatori attitud notion mandatori mental attitud consist concept commit commit commit adopt mental attitud attach role group commit group impli ai commit act accord oblig rel mental attitud attach role role set mental attitud includ mandatori consist prescript account role set behaviour privileg base commit group note notion role consist account role set behaviour distinct mandatori option attitud rich varieti individu collect norm posit author sergot mental attitud set mental attitud includ goal intent adopt impact behaviour modifi mental state complement chang inform maintain world inform attach role adopt role affect altern search ultim action select perform attach role goal repres set state world expect bring exampl goal includ gener indic conduct expect guid recommend support attitud mean commun role adopt agent complement modifi agenda motiv current futur behaviour huang goal option mental attitud decid adopt categori mental attitud provid mandatori attitud typic reflect player duti oblig exampl intent role prescript rule polici job direct superior intent mandatori mental attitud compel adopt role attach agent modifi act behaviour affect wright unlik individu agent mental role includ desir desir typic reflect cognit freedom agent endow fulli explic model cognit apparatu desir regard attach entiti role note intent reflect norm regul govern nonetheless freedom decid compli intent intent opportun determin role expect intent gener term give descript technic detail deal semant goal intent introduc modal time belief φ goal intent φ attach role ri belief belief set attach role includ belief world belief mental attitud attach role belief set incomplet agent hintikka world semant develop belief model world role ri time point frame centr doxast altern ri ti distinguish actual world semant sentenc similar semant bel sentenc simpli reflect fact belief assum close consequ usual infer rule necessit unlik individu agent belief consist attach role piec inform contradict situat typic refer role result lack clariti inform adequ perform role role ambigu relat matter method perform standard evalu perform unlik agent belief introspect neg introspect axiom axiom reflect cognit awar restrict capabl role belief access relat closur logic consequ necessit rule theorem rule infer normal modal logic goal goal reflect set behaviour expect occup relat role provid guidelin pattern behaviour impact mental state goal φ mean attach role time goal φ hold ti tj semant goal draw hintikka world semant analog goal simpli reflect closur consequ necessit properti unlik agent goal assum consist attach goal reflect contradictori expect behaviour inconsist goal typic refer role face situat simultan contradictori expect creat conflict complianc set goal make difficult imposs compli goal concern agent act manag director busi face expect financ director concern balanc outgo incom market director concern capabl product servic sold meet custom revenu typic inconsist goal role overload occur face expect unabl meet satisfactorili role expect neglect order satisfi lead conflict prioriti section unlik agent goal constrain weak realism condit mean attach role piec inform contradict pattern behaviour expect repres case role ambigu reflect uncertainti lack clariti requir role unabl adequ perform percept goal differ expect agent intent intent provid act wright adopt agent commit act role cognit agent capabl perform intent intent intent involv perform action entiti hold grosz krau intent intent reflect state affair potenti commit bring intent φ mean attach role time intent φ hold ti tj accord individu agent cognit intent subset goal mention section intent mandatori attitud adopt base goal option attitud autonom decid adopt belief semant goal draw hintikka world semant analog common intent simpli reflect closur logic consequ necessit rule intent constrain consist axiom weak realism properti attach role intent contradict inconsist piec inform attach role implic term role overload ambigu requir similar observ goal inconsist belief social relationship attitud adopt social impact agent mental state agent social influenc adopt mental attitud social relationship acquaint discuss section order form social influenc introduc notion social relationship agent addit term denot relationship variabl rang relationship type relationship repres relationship abstract pair role role link type social relationship empow dictat aspect work agenda instanti relationship type rise social relationship agent relationship type give rise number relationship instanc involv agent ai boss agent aj involv agent ai boss agent ak secretari introduc oper agent ai aj social relationship type time ti definit time agent ai aj social relationship type ai occupi role ri aj occupi role vice ai aj mutual ti form social mental shape social mental shape social process affect agent mental state refer phenomenon mere social natur agent impact mental motiv behaviour process social mental shape involv social social relationship simpli agent relationship discuss typic outcom modif agent mental state happen agent social motiv adopt mental agent social motiv reason mental attitud adopt earlier stage fact framework social relationship defin term type relationship role impli relationship agent exist long agent occupi relat role husband role boss market depart secretari human relat depart busi role connect give technic apparatu deal process social mental shape basic social mental shape base social role social mental shape occur agent social relationship social mental shape occur social relationship introduc modal oper form social mental shape write agent time mental attitud φ role social mental shape influenc role mental state express modal oper term repres goal intent agent ai hold ri role ti mean time ti agent ai social influenc role ri attitud att state world φ iff time att φ attitud attach role agent ai believ att φ attach ai occupi ai role ri impli ai adopt attitud att φ trivial note time ti agent ai social influenc role ri respect mental attitud att time ti agent ai hold attitud att social motiv attitud social mental shape rule individu social relationship respect pair role social relationship respect relat role note definit impli agent social influenc role role strictli motiv agent adopt attitud agent individu motiv attitud attach role occupi role believ attitud attach role provid agent reason attitud attitud individu motiv adopt origin support social motiv role agent occupi appli form social mental shape occur agent note schema ti occupi role hold mental attitud necessarili influenc role adopt attitud attitud attach agent simpli intern motiv adopt note schema hold mandatori base intent mandatori intent attach agent awar agent automat adopt intent occupi role subject social mental shape note hold option decid adopt attitud attach reason social mental shape agent social mental shape agent place social relationship agent influenc adopt mental attitud social relationship repres input output social mental shape process agent involv relationship decid persuad process argument aim type relationship establish social relationship repres outcom social influenc basic form social mental shape occur social relationship section social mental shape social relationship dealt detail social mental shape social relationship social mental shape occur pair agent social express modal oper term repres goal intent agent ai hold φ ti φ aj st mean time agent ai social influenc adopt mental attitud att φ iff time agent aj hold att ai believ aj hold ai believ aj hold att impli ai adopt attitud att form social mental shape cover influenc pattern imit desir spontan benevol exploit adopt belief section note case social mental shape agent social relationship awar form social mental shape detail social relationship social mental shape mental state influenc social relationship agent express modal term repres goal intent agent ai hold repres social relationship type agent ai aj ti φ agent mandatori intent occupi role time agent ai influenc adopt attitud att φ situat social relationship type agent aj iff time agent ai aj social relationship type aj hold mental attitud att ai believ aj hold ai believ aj hold att impli ai adopt attitud att φ schema trivial note time ti agent mental state social influenc social relationship ai aj respect mental attitud att time ti agent ai hold attitud att social motiv attitud ti form social mental shape agent adopt acquaint mental attitud social mental circumst agent involv social relationship requir adopt acquaint mental attitud agent autonom decid establish relationship agent relationship automat number mental attitud mental state mandatori intent section boss order perform activ secretari decid interact establish social chang mental state adopt intent boss int repres intent held agent aj aj author agent ai time ai relat aj relationship type agent establish social relationship agent hold mental attitud mandatori respect simpli provid agent reason intent intent agent automat adopt attitud note hold mandatori agent decid adopt acquaint mental attitud form social mental base instanti role enabl identifi type relationship agent reflect mental link bind introduc definit time agent ai aj social cognit relationship type social relationship type agent adopt mental attitud simpli believ hold attitud ti oper mean time agent ai social cognit relationship type place iff ti agent subject social mental shape social mental shape occur relationship group agent link set social relationship obviou project team number agent work influenc adopt mental attitud goal intent agent connect web social cognit relationship give rise social cognit structur step structur agent involv multipl social cognit relationship introduc notion role draw defin concept social structur social relationship structur autonom chose earlier mandatori intent agent note agent hold mandatori attitud enter relationship establish relationship agent reason attitud note agent author agent intent hold case captur mention section role structur set interrel role definit role structur rs tupl set social rj weakli connect set social relationship type defin social structur role structur instanti agent definit social structur tupl rs role ai ri st set agent social agent weakli connect relat exist role occupi agent social structur necessarili connect social relationship unawar deriv social construct describ connect agent term social enrich notion social structur cognit compon enabl agent awar instanti relat role defin notion social relationship structur social structur agent weakli connect result connect role awar connect definit social relationship structur tupl social rj st aj rj aj weakli connect set pair agent time ti relat social relationship social relationship agent weakli connect structur relat exist role cognit mutual belief occupi relat role social relationship structur agent cognit relat necessarili impact anoth mental state model defin social mental shape term agent influenc adopt act isol form social influenc mental state behaviour autonom decid mental state behaviour affect social influenc agent involv social mental shape process modifi mental state adopt social motiv attitud deriv social construct reflect social relationship cognit connect result social influenc agent exert couch notion social relationship structur term social cognit relationship lead definit social cognit definit social cognit structur tupl social relationship rj st aj rj aj weakli connect set pair agent time relat social cognit relationship social cognit structur social relationship nonetheless social relationship structur social cognit structur shown definit social relationship structur cognit agent weakli connect web binari social cognit relationship social cognit structur extens concept social cognit relationship situat agent involv complex form social mental shape axiom consist agent autonom cognit engag iter seri social action interact aim complet mental state role social relationship provid agent social motiv mental attitud replac complement individu motiv agent mental state constitut main type mental individu motiv social motiv attitud order mental attitud leav topic futur investig agent behav coher ration attitud consist levesqu rao georgeff briefli introduc main axiom underpin govern consist social motiv attitud individu motiv consist social motiv mental attitud agent social influenc modifi mental state adopt set social motiv mental attitud maintain complianc axiom govern agent mental state section mention section attach role mental attitud inconsist adopt agent confront problem role incompat overload agent plai number role influenc conflict order behav agent overcom inconsist neglect modifi attitud maintain model introduc set axiom consist social motiv attitud axiom hold agent subject number social mental shape process social relationship role agent subject form influenc agent social relationship involv social relationship subject influenc acquaint agent induc agent adopt number conflict agent involv social relationship influenc agent adopt conflict goal agent overcom inconsist order behav coher ration manner section model consist attitud face compet social number axiom introduc note consist axiom similar introduc section axiom assum unbound variabl quantifi dag axiom assum φ ψ replac formula languag justif similar social motiv mental attitud agent receiv role agent social agent social motiv belief contradict theorem social motiv belief contradict proof belief close consequ kb section appli axiom section agent desir consist simpli close consequ individu motiv social motiv contradict agent influenc agent adopt desir time emul agent adopt desir lead healthi life agent social motiv goal contradict theorem social motiv goal contradict proof goal close consequ kg section appli axiom goal govern weak realism constraint section social motiv goal contradict social motiv belief agent adopt goal φ eventu agent social influenc agent adopt belief φ social motiv intent contradict theorem social motiv intent contradict proof intent close consequ ki section appli axiom social motiv intent contradict social motiv belief axiom section consist individu social motiv attitud agent subject social mental shape mental attitud adopt consist agent individu motiv attitud consist relat govern group axiom att agent individu social motiv mental attitud agent individu motiv belief contradict social motiv belief bel bel theorem individu social motiv belief contradict bel bel bel proof axiom kb axiom section agent individu social motiv desir consist goali agent individu social motiv goal contradict goali goal goal goali theorem individu social motiv goal contradict goali goali goal goal goal goali proof axiom kg axiom goal govern weak realism constraint section social motiv goal contradict individu motiv belief agent social motiv goal φ eventu individu motiv belief φ goal goali individu motiv goal contradict social motiv belief goali agent individu social motiv intent contradict int int theorem individu social motiv intent contradict int int int proof axiom ki axiom agent individu motiv intent contradict social motiv belief weak realism constraint section agent social motiv intent contradict individu motiv belief int axiom present govern agent social mental shape consist mental state agent involv number social action expect make rang attitud adopt abandon modifi confront mandatori social motiv attitud agent adopt decid compet attitud drop modifi confront option social motiv agent expect select compet attitud maintain conflict attitud drop modifi base agent prefer function influenc function sonenberg agent local decid prefer attitud set compet attitud consid import influenti agent set conflict import issu leav investig remain discuss primari form social cognit relationship definit section section give indic applic model structur system form social cognit relationship illustr power flexibl concept social mental section number fundament form social cognit relationship introduc examin show fit conceptu formal framework chosen form fundament repres main wai social mental shape place social relationship agent chosen form social cognit relationship underpin wide varieti social negoti collabor note focu restrict social relationship vari form social mental shape place form occur social relationship imit imit form social mental shape ground desir imit place long agent ai believ agent aj desir motiv ai adopt desir φ st fir relationship husband wife mutual influenc adopt effort contribut happi imit imit occur result varieti reason relat mutual empathi refer spontan adopt innermost psycholog attribut inclin imit place social relationship social relationship base emot norm exchang author agent involv norm affect charm social spontan imit adopt desir adopt call adopt form social mental shape refer goal st salesman adopt goal sell ten life insur polici week believ rival salesman compani goal result competit adopt goal gener adopt kei form social mental shape li heart varieti social phenomena rang competit cooper form social behaviour agent strateg influenc adopt anoth goal base behaviour tactic suit competit environ market negoti al agent adopt anoth goal regard behaviour lead form joint cooper activ collabor al social adopt term spontan goal term effect behaviour expect agent mental state al agent spontan adopt anoth goal result varieti reason relat emot exchang adopt regard benevol form social mental agent adopt anoth goal simpli welfar circumst goal adopt selfish form social mental shape instrument achiev individu adopt inferenti agent practic reason achiev selfish repres form social mental shape instrument agent altruist intent al goal adopt occur result agent request simpli result agent intent impact anoth mental state unlik spontan form goal agent induc chang mental state extern pressur conform mental state al agent goal adopt induc anoth request instrument achiev form social mental shape ground agent motiv hold intent fact believ agent intent st note agent oblig adopt goal result author main reason unlik section goal adopt regard prescript base agent determin rule command observ agent behaviour goal relat behaviour section agent mental state observ imposs determin agent adopt goal norm author relat reli goal adopt ineffect fairli easi escap explain reflect govern system section secretari adopt intent report complet deadlin believ boss intent secretari adher intent adher eventu behav intent fulfil report complet deadlin secretari motiv intent intent fulfil form simpli induc unrel intent parti achiev intent secretari adopt intent simpli result confid sensit high social statu secretari adopt intent believ fulfil intent assist provid secretari instrument achiev selfish goal benevol selfish benevol mean agent adher anoth intent intend contribut welfar fulfil intent selfish mean agent adher anoth intent simpli order selfish fulfil goal spontan motiv request al milgram unlik goal place result request author agent intertwin author agent oblig adopt mandatori intent section mandatori intent norm form social mental shape refer influenc reward punish agent control agent subject al exploit agent store process inform costli wai social environ conveni oper concern social case agent easili lean inform possess agent job agent extend mental state includ belief mental extens base belief agent belief form social mental shape refer exploit st understand mean definit muscl person deliveri deliveri schedul dai believ van schedul believ schedul fred schedul schedul adopt belief result relationship ann fred ann reli ann content detail fred overload mental state inform ann base relationship fred exploit reduc cognit effort requir job cognit form social mental shape reflect concept agent mental state escap confin physic social environ hutchin social exploit regard relat form memori refer wegner notion refer fact base develop share system store retriev inform substant domain suggest draw network defin term agent exploit belief contribut system perform enhanc effici effect social mental shape context develop social mental interest give gener indic system theoret practic section model social mental shape appli extend broader context negoti practic reason system al domain interest sale privat held compani public offer share small investor involv activ investor small investor passiv potenti virtual monitor capabl activ investor individu group interest invest compani control interest bring resourc firm sell agent repres compani motiv intent share compani intent maximum amount revenu build mello parson distinct strategi identifi seller share privat held compani search activ attempt establish price sale control block offer remaind share small investor offer share small retain control block subsequ offer activ investor negoti activ investor simultan offer share small investor sell share small investor uniform attempt involv activ investor strategi reflect pattern social cognit relationship agent involv order examin prototyp agent repres activ investor small investor implement al implement procedur reason system lanski sell strategi predetermin plan detail ka relev strategi select sell agent impact mental shape exert enact strategi establish relationship potenti activ investor essenti import sell agent identifi activ investor prepar control share compani accept price activ investor commit pai price control interest firm control interest firm goal activ investor candid move intent statu question goal simplest goal intern gener activ relat agent model paper altern relationship establish sell agent activ investor regard social cognit relationship activ investor adopt goal sell agent control interest firm establish relat goal adopt activ enabl sell agent pursu strategi social cognit relationship establish sell agent activ investor form social cognit relationship close relat agreement price share sold number variabl contribut assess accept price share firm firm reflect turnov asset inform public domain activ investor bring asset compani form tend lower price paid share activ refer discount parson control interest compani bring privat benefit activ tend price paid refer premium parson interest activ investor sell agent awar asset activ investor bring compani interest activ investor establish relationship sell agent activ investor influenc sell agent asset brought social cognit relationship establish activ investor influenc exploit belief sell agent strategi sell agent offer share small retain control share offer activ investor market firm estim nonetheless sale minor stake small sell agent gain estim market share compani seller gather piec interest make activ investor updat belief market share social cognit relationship establish activ investor influenc sell agent exploit pattern social cognit relationship undertak set virtual experi simul data examin extent choic sell strategi impact negoti agent mental state gener agreement perform public process sell strategi reflect form social cognit studi enabl examin impact social cognit relationship social mental shape perform joint behaviour process interest interpret comparison sell strategi term underpin social cognit relationship strategi seller impact activ investor mental state offer price addit approach small investor influenc offer price control block sold strategi seller impact small investor mental state offer price addit impact activ investor mental state offer price share sold small investor variant strategi differ seller exert social influenc convincingli activ investor provid detail inform price offer made price establish result activ investor expect motiv accept offer receiv act case seller forward price inform justifi strategi seller impact simultan activ investor small investor mental parallel negoti process strategi seller approach influenc small investor price inform figur illustr revenu sale firm flexibl sell agent strategi seller flexibl model concess rate reflect seller deviat ideal share price negoti shown figur strategi perform poorli seller low concess rate negoti interpret result establish share price activ investor small investor seller gain inform share compani inform bia price seller expect receiv subsequ negoti small investor activ investor expect reward inflex impli seller unabl establish share price small investor strategi activ investor strategi strategi seller risk flexibl strategi negoti obtain higher revenu seller influenc activ investor commun addit piec inform justifi offer made greater amount inform make social mental shape ultim seller obtain higher revenu result evid figur medium high concess public offer share uniform price worst perform sequenti sale effect seller obtain inform subsequ social mental shape made effect exert preliminari experi illustr model social mental shape investig social cognit relationship relationship affect behaviour agent involv view interact term influenc abstract specif algorithm coordin negoti framework enabl applic design concentr essenc cognit foundat social worri relationship enact model tool develop understand practic applic system relat work bdi architectur intent social aspect agent situat system section architectur interact agent mechan structur manag coordin process paid attent apparatu number architectur attempt incorpor facet agenthood singl model al steiner architectur typic layer involv separ compon local social combin control framework seek strike balanc link main compon ad hoc natur clear underpin conceptu model problem social autonom work regard close relat architectur steam mecca steiner work deal incorpor cooper abil agent framework addit social construct oper joint intent common work standard bdi architectur provid theoret model extend bdi logic account social autonom delib agent broaden set mental attitud encompass intern motiv social situat attitud agent adopt result situat social environ approach common model base social commit social attitud discuss section castelfranchi state individu commit collect commit intern commit individu agent group agent claim notion social commit captur depend relationship agent cavedon al introduc modal social attitud concept reflect relat agent respect model notion gener commit perform action type social attitud turn mean incorpor social interact bdi framework notion social mental shape captur form social interact necessarili reflect commit agent spontan approach address problem role impact mental social relationship formal framework inform work cavedon sonenberg role abstract enabl agent design model sphere influenc agent respect associ goal role enabl express gener social agent adopt involv commit goal attach role conceiv role provid agent balanc compet oblig overcom tension person prefer social oblig work extend cavedon associ role goal belief intent impact instanti relat role mental state role similar werner associ role mental attitud werner defin role descript abstract agent endow state valu agent assum role adopt mental attitud attach notion role structur similar notion social notion refer set interrel social role werner role social structur develop theori social cooper refer notion cover wider rang social behaviour social role differ barbuceanu associ role function oblig definit role set mental attitud permit provid unifi framework gener investig influenc role structur goal belief futur work aim paper investig impact social mental show impact bdi framework term mental introduc refer phenomenon mere social natur agent mental motiv behaviour process social mental shape involv social social place role relationship typic outcom modif social agent mental agent adopt social motiv mental provid reason attitud gener earlier stage focu kind social mental shape captur impact role social relationship mental state address structur system model term role relat role agent adopt mental attitud attach role agent interact influenc agent adopt mental attitud novelti role social relationship rest fact captur import ingredi social bdi logic interact delib agent model term intern motiv mental impact agent role structur system mental state role social relationship provid agent social motiv mental attitud reason individu motiv order social agent behav coher ration individu social motiv attitud consist introduc main axiom govern consist attitud concentr social cognit main form relationship explor futur work involv investig issu social mental shape attent paid social mental shape develop time interest scenario involv case social mental shape persist time essenti dynam agent join involv adopt mental relinquish chang role drop social relationship import aspect social mental shape deserv futur investig issu inconsist section introduc number axiom underpin consist attitud studi conceptu mechan underli autonom agent behaviour role social relationship involv role social relationship impact mental state conflict sonenberg import local prefer function order agent decid overcom inconsist role social relationship conflict influenc agent adopt social motiv mental attitud preclud agent adopt compet model investig influenc function assert influenti agent situat relationship influenti involv agent control power acquaint role crucial agent role plai involv investig theoret techniqu constraint agent influenc role consid critic occupi bring util system move logic develop number obviou area futur work envisag provid detail account relat modal express individu social motiv mental attitud focu cognit model complex process attitud ti intern attitud social mental shape process model social motiv joint mental attitud group agent influenc group individu agent adopt joint attitud group adopt joint attitud consequ member adopt attitud futur work highlight kei step process individu agent social motiv attitud mesh joint mental attitud ensu complet definit formal framework appendix introduc quantifi logic formal express model social mental shape logic call languag draw extend work bell bell huang cohen levesqu al rao georgeff wooldridg jen main featur reason social mental explicit refer time point interv quantif term set modal reason repres goal intent agent base model time linear section intend detail formal languag section syntax account formula model social mental shape express section semant languag defin syntax definit languag countabl set const constant union disjoint set point type countabl set var variabl union mutual disjoint set countabl set pred predic symbol symbol pred natur number call time consist bell work individu mental attitud draw cohen levesqu rao georgeff wooldridg languag logic modal express mutual belief languag extend formal framework term reason role explicitli oper symbol punctuat symbol dot comma definit term constant variabl sort term term sort time relationship type object set defin term minim set const var vari denot var set const set term set variabl constant note demand predic appli term definit syntax formula languag defin wff wff term wff wff φ bel wff φ de wff φ goal wff φ int wff φ wff φ wff address social motiv attitud point departur logic φ wff χ wff ψ wff wff φ wff wff definit relat function time point interv min min max max max max max max min max min max max min max max semant semant assign formal mean syntact object languag section introduc formal semant semant present main defin model structur semant rule present notion valid satisfi formula base linear view wooldridg jen branch tempor model assum actual world set world dt set time point world thought world share common flow time dt dt di repres set interv defin term time point world popul set dag agent agent goal intent belief agent relat usual map time world world frame world agent interv condit captur idea set world assum goal intent agent access relat world set set role set relationship attach role number mental attitud agent belief relat rb map time world world frame world role interv condit captur idea set world assum goal intent attach role relat definit domain dag dt di languag quantif time relationship type object note fix world definit interpret biject const variabl biject var definit model set distinguish member dag set dt set time dt di dt set set set relationship set dag di dag di α centr dag di α centr dag di α centr dag di α centr di α centr di α centr di α centr const interpret function final pred function extens predic symbol φ φ preserv ariti definit variabl defin term valuat function vg defin vg τ vg τ vg vg τ semant languag defin satisfact hold interpret structur formula languag interpret structur tripl variabl assign rule defin satisfact relat definit definit formula φ true world φ satisfi assign formula φ valid interpret write usual definit variabl assign satisfi formula φ world model written true iff vg iff vg vg iff vg vg iff vg vg bel iff α vg de iff α vg goal iff α vg int iff α vg iff α vg φ φ φ iff α vg φ iff α vg φ iff ψ ψ χ iff ψ χ ψ iff ψ differ refer barbuceanu coordin agent social constraint plan fourteenth nation confer artifici page function harvard ma miller group group group open buckingham bell chang attitud wooldridg intellig intern workshop agent lectur note artifici page bell huang dynam goal hierarchi rao intellig agent theoret practic lectur note artifici page bratman practic harvard ma israel pollack plan practic reason comput carlei group approach advanc group theori vol jai page carlei newel natur social agent journal mathemat castelfranchi individu intent group intern confer aaai press mit san page cavedon sonenberg social role prefer goal intern confer page rao tidhar social individu commit rao intellig agent theoret practic lectur note artifici page chella modal cambridg ma clark put world mit ma coleman foundat social press harvard ma cohen levesqu intent choic commit artifici cohen levesqu teamwork dennett intent mit ma practic coordin ai magazin lesser reddi speech understand integr knowledg resolv uncertainti comput mose vardi reason mit ma sierra jen negoti function autonom agent intern journal robot autonom franklin graesser taxonomi autonom agent intellig agent intern workshop agent architectur lectur note artifici page georgeff lanski reactiv reason plan sixth nation confer artifici page griffith luck cooper plan select garijo system engin ninth european workshop model autonom agent lectur note artifici page grosz krau collabor plan complex group action artifici handi understand penguin fourth hintikka knowledg cornel ny hintikka semant proposit attitud refer oxford oxford buchanan organiz behaviour introductori prentic ny hutchin cognit mit ma jen control cooper problem solv industri system joint intent artifici jen softwar engin artifici werner plan team activ castelfranchi artifici social lectur note artifici page cognit social structur social sycara reach agreement logic model implement artifici kenni implement procedur reason system multirobot applic confer intellig robot page lesser corkil distribut vehicl monitor tool investig distribut problem solv network ai posit studi law reidel publish dordrecht steiner understand perspect intern confer page marsh trust distribut artifici intellig castelfranchi artifici social lectur note artifici page mello parson public ownership structur firm journal milgram harper ny mitchel norm mitchel social network urban manchest manchest mueller design intellig agent layer berlin norman reed deleg lesper intellig agent berlin norman jen model social bdi framework liu intellig agent asian pacif confer intellig agent world scientif page jen norman collabor practic reason system journal logic forthcom jen norman public sale share heterogen comput model comput simul intern journal group forthcom sierra jen agent reason negoti argu journal logic rao georgeff model agent bdi architectur fike intern confer principl knowledg morgan kaufmann san page georgeff sonenberg social preliminari report werner decentr ai page noriega parson framework negoti rao intellig agent fourth intern workshop agent architectur lectur note artifici page sergot norm posit logic inform io press simon model social john ny singh multiag theoret framework berlin tamb flexibl teamwork journal artifici intellig von wright freedom determin acta walton commit basic concept interperson state york ny wegner transact contemporari analysi group mind mullen theori group ny werner cooper unifi theori commun social structur gasser distribut artifici page wooldridg reason ration mit ma wooldridg jen intellig theori practic knowledg engin wooldridg jen cooper problem solv journal logic kinni gaia methodolog analysi journal autonom agent revenu strategi sequenti sequenti influenc parallel public offer flexibl seller figur revenu sale share concess rate sell strategi
ML/1360 6 pareto archiv evolut strategi baselin algorithm pareto multiobject joshua knowl dept comput scienc read read uk david corn dept comput scienc read read uk popular evolutionari algorithm multiobject maintain popul solut individu select reproduct introduc simpler evolut scheme multiobject call pareto archiv evolut strategi argu repres simplest algorithm capabl gener solut pareto optim set algorithm identifi evolut local search popul refer archiv found solut order identifi approxim domin rank current candid solut vector intend good baselin involv method serv applic local search superior competit method perform algorithm compar base nich pareto ga real world applic telecommun field includ result experi carri suit test demonstr algorithm gener capabl introduct multiobject genet algorithm investig author recent year problem perform genet algorithm overshadow local search method simul anneal tabu singl object sought multipl object combin weight research examin local search method appli multiobject problem order find solut pareto optim set paper introduc evolutionari algorithm emploi local search gener candid solut popul inform select procedur identifi algorithm evolut strategi suggest extens includ simpli convert es pareto archiv evolut strategi extend rang option open engin interest multiobject baselin involv algorithm compar problem object function yield reduct algorithm advantag local search method develop investig real world task field involv rout call network describ greater detail section pose singl object solv effect local search method research found simul anneal tabu search superior competit ea search solut space natur task problem multipl pareto optim solut efficaci local search method local search extend find nondomin solut problem answer question develop compar perform base nich pareto genet algorithm horn result gener set good solut compar significantli time algorithm compar version nich pareto genet algorithm suit test problem problem research fourth problem hard challeng find pareto optima aim comparison gener explor demonstr applic approach standard multiobject problem compar analysi topic futur intend make multiobject assess techniqu put forward fonseca fleme main focu paper introduc describ identifi statu multiobject evolutionari algorithm indic make comparison recent multiobject ea argu repres simplest pareto multiobject serv good baselin algorithm compar remaind paper section introduc rout describ object function background inform perform algorithm task pose singl object problem section introduc describ discuss extend futur result provid section includ solut set found rout task result demonstr capabl suit test problem find section rout circuit switch network aim section describ context algorithm support reader interpret result section briefli give object function comput solut qualiti descript heurist emploi encod mutat oper report find perform algorithm task cast form task linear blend underli problem specif rout task involv find set rout combin commun cost congest applic includ rout traffic synchron digit hierarchi network client book bandwidth traffic telecommun network current traffic profil commun cluster comput determinist function formul problem base work mann smith differ problem seri discret time step traffic condit consid problem static case formul problem bandwidth limit telecommun network rout multipl traffic request manner achiev feasibl rout link primari object secondari object link fix target rout assign attempt commun cost usag link network set node set bidirect edg edg bandwidth bandwidth capac edg network lie link type capac unit type capac unit network exist time frame denot discret time set commun rout specifi sourc node destin node ng connect ff disconnect fi commun bandwidth problem determin path connect time interv ff fi object state note path exist entir time frame call connect note total traffic edg time interv ff fi viabl rout total traffic edg distinct time interv exce bandwidth capac edg time achiev deviat long object object find minimum cost alloc traffic satisfi constraint cost rout time ff fi total cost rout commun entir time substitut ff fi final object deviat target link sum time step max ae oe long link time step exist pressur process find balanc solut experi set object defin initi combin singl object function weight weight coeffici report give feasibl rout strategi summari heurist kei result path pair node fast algorithm due yen candid solut vector formul element shortest path pair commun assign solut vector mutat neg exponenti probabl distribut strongli favour low valu shorter ensur fast solut evalu emploi candid solut lend great speed advantag local search chang element solut vector time standard evolutionari algorithm typic make good due larg induc recombin overcom problem crossov oper cross gene parent chromosom gene chosen function allel test mutat ea rang local search method includ standard tabu simul anneal evolut strategi rang network size traffic condit found local search method converg solut qualiti significantli fewer evalu popul base method report tabu search effect local search method ea perform ea emploi crossov oper requir significantli evalu local search algorithm find satisfactori solut find led develop enabl local search method multiobject algorithm overview algorithm develop main object mind algorithm strictli confin local search small chang oper move current solut nearbi neighbour make popular notabl nich pareto ga horn al deb al nondomin sort ga schaffer vega maintain popul solut select breed carri object algorithm true pareto treat nondomin solut equal achiev object major compar pair solut domin problem overcom maintain archiv found nondomin solut archiv mean estim true domin rank pair solut instruct view candid solut candid solut accept archiv view repres simplest approach multiobject local search procedur candid solut gener akin simpl random mutat maintain singl current iter produc singl candid random mutat object multiobject search find spread nondomin necessarili provid explicitli maintain limit number found hillclimb design accept function obviou case mutant domin current solut vice troublesom nondomin case approach learn horn al semin work comparison set decid mutant current solut case natur conveni sourc obtain comparison set simpler multiobject local search procedur simpler accept accept mutant current solut domin accept mutant domin current found result poor echo horn al find find size comparison set crucial reason result note idea maintain list nondomin solut park al recent describ maintain nondomin solut algorithm complic archiv repositori nondomin plai kei role pool parent select sourc comparison aid rank solut term solut gener base nondomin archiv extra sourc fill intermedi accept function simpli replac current popul newli construct intermedi popul normal found archiv gave improv result tradit test applic provid result futur breed method standard multiobject test problem scope publish work archiv aid estim fit popul member archiv pool select interest idea intend incorpor futur version structur shown figur algorithm begin singl chromosom current evalu multiobject cost function copi made mutat oper appli copi mutat copi evalu form candid solut current candid solut compar accept simpl solut domin case solut candid solut compar refer popul archiv nondomin solut comparison popul archiv fail favour solut tie split favour solut resid crowd region space archiv serv separ store updat nondomin solut readi present end run aid accur select current candid solut vector act approxim current nondomin front select push process find solut algorithm unabl differenti good bad solut result wander search space archiv process similar pool select archiv maximum set user reflect requir number final solut desir candid solut gener domin parent current compar member comparison set candid domin comparison set accept archiv candid domin comparison set nondomin accept archiv gener random current solut evalu add archiv termin search mutat current solut gener candid solut evalu candid solut current candid domin compar candid solut archiv member updat archiv select current solut candid current solut stop figur pareto archiv evolut strategi base crowd grid locat archiv accept logic made explicit figur track crowd region solut grid number object problem solut gener grid locat found note tree encod map grid indic grid locat solut archiv resid candid solut posit join full replac archiv solut highest long count lower system select current candid solut candid domin domin member archiv case solut lower grid count select futur develop identifi es serv good baselin algorithm multiobject investig perform variant ident mutant gener current solut compar current solut archiv replac current solut version maintain popul size copi tournament select select fittest respect archiv copi mutat fit archiv candid domin add candid archiv add candid archiv candid archiv candid resid space current solut crowd region reject accept candid candid member member archiv archiv candid replac member archiv resid crowd grid locat candid domin member archiv full remov domin figur archiv accept logic assign respect archiv fittest solut replac current popul result discuss rout problem compar ea base horn al present typic result singl run problem commun rout network node paramet set archiv number space grid encourag found paramet easi set problem archiv set archiv rare fill run evalu set perform algorithm begin divid phenotyp space time divid cube solut tag grid locat comparison set tournament select comparison set investig number set popul nich comparison set tournament size found set problem shown pop dom comparison set oe share rang object scale lie figur show plot nondomin front found run evalu solut found default assign cost object surfac found li level found ea show found solut larg region found solut popul found object pareto archiv evolut strategi object object object object nich pareto ea tournament size object figur nondomin surfac obtain rout task test problem potenti shown rout compar suit standard test function bentlei schaffer function fonseca renam function figur commonli research test multiobject algorithm reason note design test function call function singl object singl rang rang singl rang optima spread dimens test multiobject implicit set set nondomin solut deliv function pareto optima gener felt strong bia favour pareto optimum number copi pareto optimum final popul similar reveal bia undesir practic applic design provid stronger challeng easili nontrivi problem pareto optimum difficult find distinct pareto optima chromosom length frequenc easier find make challeng stringent test multiobject function chromosom gene object defin function ae ae ith gene experi compar preliminari paramet set investig conduct find good valu result record set maximum archiv size popul size suitabl comparison similar set problem converg singl optim expect figur perform remain test function algorithm run time number function evalu final archiv list record solut popul gener total frequenc distribut solut user algorithm plot frequenc point higher due fact repeat phenotyp remov archiv list fewer solut return run problem algorithm find solut rang return fewer solut return nondomin solut store archiv distribut problem distribut point separ pareto optim rang solut perform compar result rang problem algorithm perform spread solut entir rang rang function function function function figur test function distribut reveal find solut tradeoff solut centr gener extrem clean accur pareto archiv evolut strategi pareto archiv evolut strategi nich pareto ea figur test result pareto archiv evolut strategi frequenc nich pareto ea figur test result distribut bia central point distribut concentr closer true rang li straight line extend algorithm troubl problem find solut edg evalu gener good spread solut success problem distribut shift slightli optimum rang longer tail show found difficult solut difficult problem suit sampl algorithm local search algorithm futur work form view simpl baselin techniqu multiobject address multiobject form rout provid result strongli competit compar suit test function found strongli competit case term coverag pareto tradeoff gener absenc strong bia perform consist essenti simpl algorithm disclaim qualif investig rout yield result found altern algorithm deb al nondomin sort algorithm strongli elitist put forward park al emploi archiv nondomin solut absenc compar tent suggest power strategi multiobject problem comparison altern turn leav flounder remain true good baselin algorithm method repres good foundat design sophist altern explor preliminari result suggest algorithm outperform problem acknowledg author bt lab plc continu phd bibliographi thoma evolutionari algorithm theori oxford pareto archiv evolut strategi frequenc nich pareto ea frequenc figur test result nich pareto ea frequenc pareto archiv evolut strategi frequenc figur test result jp find accept solut rang multiobject genet algorithm present world confer soft comput engin design manufactur june pj overview evolutionari algorithm multiobject comp pj perform assess comparison stochast multiobject parallel problem solv natur schwefel parallel problem solv natur ppsn springer lnc volum pp de genet algorithm machin learn mp tabu search multiobject optim mot present cape south jan mp gener good solut practic combinatori problem vector simul anneal submit control august de nich pareto genet algorithm multiobject optim ieee confer evolutionari ieee world congress comput volum ieee servic multiobject nich pareto genet algorithm illig report illinoi genet algorithm champaign gd comparison heurist telecommun traffic rout publish modern heurist search editor john wilei son select breed multiobject genet algorithm parallel problem solv natur intern confer eiben springer multipl object optim vector evalu genet algorithm intern confer genet morgan kaufmann san multiobject optim nondomin sort genet algorithm evolutionari jy find shortest path network manag scienc juli
ML/1361 6 text categor weight adjust neighbor classif han georg kumar depart comput scienc engin armi research center minnesota eec union st se mn usa abstract text categor task decid document belong set prespecifi class document automat classif scheme greatli facilit process categor categor document number discrimin word larg exist algorithm simpli work number featur neighbor classif learn algorithm shown effect varieti problem domain includ document kei element scheme avail similar measur capabl identifi neighbor document major drawback similar measur featur comput distanc document data smaller number total vocabulari categor document approach overcom problem learn weight featur word document data weight adjust neighbor classif algorithm base classif paradigm weight featur learn iter algorithm weight adjust weight featur perturb small step chang improv classif object function featur improv object function identifi weight updat featur weight similar measur comput import featur contribut similar measur experi real life document data set show outperform state art classif algorithm vsm text nearest neighbor weight data mine work support nsf grant armi research offic contract research ibm partnership content necessarili reflect polici offici infer access comput facil provid minnesota supercomput research nsf grant relat paper introduct text categor task decid document belong set prespecifi class document automat classif scheme greatli facilit process categor human expert categor document fast growth onlin document difficult time legal publish west human index read legal document index manual step bottleneck publish legal document web browser user bookmark rememb site interest categor site interest movi great user automat text categor classifi search document web base exist bookmark document user categori text categor essenti classif problem word occur document set variabl featur classif problem moder size document set easili vocabulari ten thousand distinct word exist algorithm simpli work number attribut featur select method base document mutual inform gain reduc number word aggress reduc number lose critic inform categor task number word featur select thousand classif scheme potenti text categor exist scheme work text categor task due problem mention wide classif tree induct algorithm rule induct algorithm ripper work number distinguish featur larg classif rainbow commonli text categor independ assumpt sever limit applic neighbor classif learn algorithm shown effect varieti problem domain algorithm text classif kei element scheme avail similar measur capabl identifi neighbor document major drawback similar measur featur comput distanc document data smaller number total vocabulari categor document approach overcom problem learn weight featur word document data featur weight higher weight featur impli featur import classif task note weight approach featur select pebl classif algorithm modifi differ metric determin import categor featur distanc data point determin pebl build distanc measur valu featur distanc valu featur measur class distribut valu distanc small occur similar rel frequenc class distanc larg occur rel frequenc class distanc data point calcul squar sum individu featur distanc determin pebl document data set word present absent document major problem pebl comput import featur independ featur classif unabl account interact featur vsm classif algorithm learn featur weight conjug gradient optim unlik vsm improv weight iter optim function algorithm specif develop data euclidean distanc measur potenti problem approach fact neighbor classif problem linear optim function quadrat converg linear conjug gradient optim hold approach conjug gradient optim type problem converg global minimum optim function multipl local minima weight adjust neighbor classif algorithm base classif paradigm weight featur learn iter algorithm weight adjust weight featur perturb small step chang improv classif object function featur improv object function identifi weight updat featur weight similar measur comput import featur contribut similar measur experi real life document data set show outperform state art classif algorithm vsm weight adjust neighbor classif algorithm present detail data vector space model commonli inform retriev system vector document vector element correspond word document set train set view matrix row document column word valu matrix presenc word absenc word word frequenc document frequenc tfidf combin tf idf scheme inform retriev tfidf previou studi text classif cluster tfidf effect adopt tf entri matrix normal row row add step elimin problem due differ document size similar measur includ cosin measur cosin similar measur commonli inform retriev adopt basic similar measur weight cosin measur document weight vector set term normal tf word weight word weight adjust find optim weight vector classif task hand start initi weight make small chang weight vector improv object function relat classif import issu step issu evalu weight chang paradigm nearest neighbor object function close relat class label neighbor train document case neighbor train document class label train document simpl object function add number train document correctli classifi neighbor formal defin ob simpl correct simpl train document weight predic correct simpl true sum similar ds true neighbor greater sum similar neighbor singl class true neighbor neighbor class object function regard train document correctli classifi neighbor class label number class neighbor consid correctli classifi similar ds true neighbor highest similar object function consid document correctli classifi sum similar ds true neighbor percentag total similar sum object function formal defin ob ma correct ma predic correct ma true correct simpl true sum similar ds true neighbor percentag total similar sum call major percentag discuss object function equat train sampl consid correctli classifi similar ds true neighbor total similar sum issu weight adopt chang word weight time word multipli current word weight multipl evalu chang improv object function rememb chang word pick word weight object function updat weight vector continu round major step summar construct train row correspond train column repres matrix correspond number occurr word document normal word frequenc document add initi weight vector determin nearest neighbor train document weight cosin similar measur equat initi weight vector calcul good initi weight vector object obj ma equat improv obj ma repeat word determin obj ma valu multipli origin multipl factor select word obj ma previou updat classifi test construct test vector step find nearest neighbor test document train document weight cosin similar measur weight learn sum similar neighbor class label classifi test document class similar sum result compar ripper pebl rainbow vsm synthet real data set note publicli code vsm experi paramet import choic number neighbor major percentag equat perform experi chang result report due space show classif accuraci vari significantli major percentag subsequ chosen major percentag choic word discret variabl continu variabl result report obtain word discret variabl result experi word regard continu variabl differ report result option weight instanc differ result substanti result report obtain option vari number neighbor found neighbor gave result result shown base neighbor number iter conjug gradient optim result result obtain number iter result obtain fewer iter report result vsm total number iter number neighbor summari document data set experi shown tabl data stop word stem porter algorithm data set collect legal document publish west group collect select subset document singl label randomli select train set test set exampl class label document includ data set bi foreign broadcast inform servic data class label gener relev judgment provid rout queri relev sourc train test class word west group west group west group west group west group west group west group fbi reuter tabl summari data set ripper pebl vsm rainbow fbi reuter tabl classif accuraci classifi note highest accuraci data set highlight bold font collect document relev judgment select document singl relev judgment data set foreign broadcast inform servic la time data class label gener similarli fbi data set ad hoc queri relev data filter word mutual inform select top word mutual inform train set randomli select train set test set data set data set reuter text categor test collect distribut split document train test set modifi lewi split select document singl label select top word mutual inform train set tabl show comparison classifi data set ripper significantli lower classif accuraci compar data set due larg number featur document data set rainbow perform conform earlier report show classif techniqu effect text categor classif pebl simpl work data set vsm accuraci compar pebl compar result rainbow result show weight adjust improv classif accuraci document data set result data set compar data set significantli data set compar data set significantli data set result show weight adjust perform vsm weight adjust base conjug gradient optim data set tradit inform retriev multipl class document binari classif individu class consid effect retriev measur term class label separ experi report confirm outperform classifi term direct futur research present neighbor classif algorithm learn import attribut util similar measur result algorithm effect text categor task number kei issu remain address issu avoid local minima search weight vector addit main object function secondari object function move local minima solut local minima problem chang weight multipl word time big challeng solut identifi set word weight chang issu enhanc weight adjust lead overfit larg number neighbor high major percentag object function reduc risk problem data set comput cost weight adjust step number iter weight adjust step number data point optim scheme improv comput complex acknowledg paul thompson isabel moulini west group data experi david low vsm code refer eh moor cluster web document categor support system ww cohen hirsh join text classif whirl proc fourth intl confer knowledg discoveri data ww cohen fast effect rule induct proc twelfth intern confer machin cost salzberg weight nearest neighbor algorithm learn symbol featur machin tm cover ja thoma element inform theori john wilei thompson automat categor document proc asi classif research ro duda pe hart pattern classif scene analysi john wilei joachim probabilist analysi rocchio algorithm tfidf text categor proc fourteenth intern confer machin lewi naiv independ assumpt inform retriev tenth european confer machin lewi text categor test collect distribut lewi gale sequenti algorithm train text classifi dg low similar metric learn classifi neural page januari lewi ringuett comparison learn algorithm text categor proc annual symposium document analysi inform andrew mccallum toolkit statist languag text classif cluster mccallum nigam comparison event model naiv text classif workshop learn text porter algorithm suffix strip ross quinlan program machin learn morgan san riloff lehnert inform extract basi text classif acm transact inform salton automat text retriev inform comput jr introduct conjug gradient method pain trec text retriev confer trec text retriev confer relev judgement yang expert effect effici learn human text categor retriev yang cg chute map method text categor retriev acm transact inform yang pederson compar studi featur select text categor proc fourteenth intern confer machin
IR/1362 5 mine web creat minor languag corpora rayid ghani carnegi mellon technolog lab rosi jone carnegi mellon usa stefan slovenia carnegi mellon univ abstract web valuabl sourc languag speci resourc process organ util resourc dicult describ approach automat gener queri collect document minor languag di er feedback retriev document label automat languag classi er relev feedback gener queri experi method term retriev document target languag score calcul document acquir consist accur method describ experi hand word elicit user initi document show method perform similarli experi appli approach multipl languag present show approach gener varieti languag introduct electron text corpora model languag languag technolog includ speech recognit optic charact handwrit machin translat spell correct languag corpora linguist readili searchabl statist easili comput linguist data consortium corpora twenti languag web search engin perform languag identi cation dozen languag search languag document languag explicit label languag written www gain popular resourc multilingu content resnik web make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee copyright acm ical construct parallel corpu english french describ techniqu automat collect languag speci resourc web present system automat gener web search queri construct corpora minor languag refer languag minor speaker read creat web page invalu mean access web autom system learn web primarili instal spider gener algorithm seek augment set search capabl combin kind topic search glover colleagu machin learn automat augment user queri speci document term design document call paper renni mccallum reinforc learn crawler discov kind hyperlink follow postscript research paper diligenti al make hyperlink structur learn naiv model document target document give crawler inform type hyperlink follow chen al reinforc learn base feedback user relev queri match bolei al word queri gener webac gener seek maxim document frequenc term select stem version word queri show automat gener queri relat document queri combin conjunct disjunct term evalu system emploi automat ghani jone describ algorithm build corpu web queri experi limit small close corpu vastli limit gener power result web approach singl word languag queri web search engin result low nding document languag singl word languag acronym singl word languag present vocabulari item languag romanc share includ languag share mean count simpl small number term document languag quickli document speci construct queri wide rang document target lter larg proport close relat languag hypothesi select term document result classi cation languag construct queri automat experi show approach work requir special knowledg languag relat architectur section describ method lter approach di er feedback retriev document label automat languag classi er relev feedback gener queri gener algorithm iter creat order build collect document singl languag target languag de ned initi document provid languag lter high work initi input user set relev nonrelev term select method select word relev document term queri search engin highest rank document pass languag lter ad set relev document classi cation lter process updat set document word select step refer url return search engin hit queri search engin rst hit remain hit store le avoid search engin queri queri unseen hit cach result hit hit return gener algorithm initi gener queri term relev document retriev relev document queri languag assign document relev nonrelev set updat frequenc score base relev nonrelev document return step retriev singl document step algorithm maximum opportun improv perform languag lter step interest futur work involv investig number document retriev updat model possibl examin number posit document return current queri queri gener collect document classi ed relev task queri gener examin current relev nonrelev document gener queri document similar relev document similar document analog sampl replac web di erent document varieti natur languag queri gener search engin sampl document collect ghani jone experi sampl replac found strategi perform similarli dataset gener queri conjunct negat term queri de ned consist set term requir document retriev set term forbidden document retriev queri number number term select term select method contrast full boolean give greater express power emploi negat greater varieti scope chose conjunct simplifi experi set number term equal number xed term select method entir experi restrict queri languag permit learn scope term relat experi machin learn term select method iter term select method select term word occur relev di erent method di erent term weight scheme select term queri term select method probabilist rt probabilist term oper term swap relev document uniform select term relev equal probabl term select select frequent term relev document probabilist select word relev document probabl proport frequenc frequent word select rt df select top word rank rt df score score term total frequenc term calcul relev document classi ed languag lter idf score term calcul entir collect document total number document number document term rt df term product idf select term highest score score word ned probabilist select word probabl proport score simplest measur baselin random select uniform probabl distribut word vocabulari score term frequenc simpl measur give good result featur score document categor multinomi distribut frequenc term shown perform simpl frequenc similar problem croft show rt df good score mechan inform retriev mladen grobelnik show score achiev good result document categor deal minor similar problem scenario minor languag web motiv superior perform probabilist deriv variant select term multinomi distribut score term queri gener step method probabilist select term addit document chang word distribut uenc term select recoveri empti queri result case determinist rt df queri term select chang underli document statist chang addit document queri add method alter queri recov approach success increment counter rst kth highest score term till queri found return url languag filter pass document fetch search queri languag lter van implement charact ngram base algorithm shown accur varieti languag document length consid document belong target languag languag languag lter estim perform lter nativ speaker evalu randomli select webpag list thousand classi ed languag lter judg fact give analog evalu web page judg neg show page classi ed result report term automat languag classi cation manual evalu carri queri paramet detail section set paramet number includ term equal number exclud term addit method select includ term select exclud score base relev nonrelev document vari number term compar term select probabilist rt probabilist exist techniqu ghani jone show singl word queri sucient nding document select probabl current document perform import note experi run small corpu document distractor document collect web store disk compar method queri gener method task nding document web search engin featur relat order establish search engin incorpor function subsum ran experi altavista function start initi document systemat queri set includ exclud length term select method retriev highest rank altavista hit classi ed relev languag lter queri altavista document retriev add relev initi set queri length method perform experi initi condit access singl posit document target user keyword detail section experi suppli neg user keyword experi english stopword constitut initi neg document languag model languag lter suppli choic initi document queri gener method paper deriv queri term document import ect vari initi document di erent initi posit document properti initi corpu consist document document english brazilian ment shown tabl document document gener languag model type topic length size formal polit inform person tabl descript di erent initi document experi initi keyword easi entir document languag suppli system altern start posit document target start word target languag obtain user nativ speaker end nativ speaker suppli word question nativ elicit initi word vari type ten common obtain word rst ten uniqu nativ speaker intuit word languag share string word common nativ speaker word share languag share languag final ten word nding text web word nativ speaker suppli tabl word mock initi english initi neg document comparison method order compar term select isol number di erent queri length compar term proport document target number target document proport web access experi target languag gener languag systemat experi provid evid techniqu gener languag test hypothesi approach perform repeat experi czech result goal system collect document target languag minim cost evalu measur percentag document retriev target class number document target class uniqu web queri number queri issu de ned number time queri issu search engin altavista compar term select method perform measur length independ speaker common ki uniqu speaker common uniqu tabl word suppli nativ speaker automat queri construct speaker provid function word speaker provid common noun uniqu speaker provid tradit food artifact speaker provid uniqu word speaker provid internet speaker provid word nding di erent topic exist techniqu appli probabilist queri web result low shown figur queri gener method section outperform probabilist approach singl includ queri word queri perform singl word queri establish perform due choic perform evalu fewer document found trend remain nding document examin found document figur method outperform function altavista document target languag queri base document target languag time choic initi document figur show number document plot number document examin method perform compar initi document time result posit document found document found total document examin figur probabilist term select method term outperform term document found total document examin figur document target languag queri base document target languag time initi keyword set keyword suppli nativ speaker tabl initi posit english initi neg inform perform initi document interest note english work document close relat languag initi neg document set start condit search result queri bring document method term select method systemat compar term select method length independ comparison di erent term select method tabl valu retriev document valu issu result mark valu lower number document po document found total document examin initi doc initi doc initi doc figur di erent initi posit length perform similar result di erenc emerg long initi document dwarf presenc document length document length document show method issu queri return document longer successfulli queri return target class document observ number queri greatest number target document term number document method perform probabilist method select term randomli probabl proport score assign detail result shown figur note di erenc scale graph figur longer queri return document costli perform found document contrast found observ perform term select method di erent queri found di erenc method perform achiev length term includ term probabilist length probabilist includ exclud term small number target languag document high number queri gener languag tabl found target document probabilist number total document czech suggest superior mechan gener languag tabl show number queri depend target languag method ect number czech queri made frequent word uniqu web len method order perform wrt measur retriev doc wrt measur issu queri tabl comparison di erent term select method queri length vari document found total queri issu queri length document found total queri issu queri length document found total queri issu queri length document found total queri issu queri length figur comparison di erent term select method queri length includ exclud cost function number queri consist document number length high yield queri note di erenc scale longer queri return document costli method shown number document found exce method languag target doc total doc czech czech czech tabl found target document probabilist number total document czech method languag doc typic queri czech czech czech tabl number target document found queri found document probabilist number czech typic queri shown commonli found posit document experi queri randomli select shown document found total document examin queri length document found total document examin queri length document found total document examin queri length document found total document examin queri length figur comparison di erent term select method queri length includ exclud measur total document examin consist nding document number queri total document long queri method nding document omit discuss approach perform collect document minor languag start word document requir languag lter minor languag lter languag model eighti potenti limit approach earlier work experi construct lter start initi document experi yield encourag result evalu corpu collect approach sampl corpu verifi made languag lter inform corpu gener web assess measur rate document experi progress rate give bound number document method callan al ghani jone measur percent vocabulari coverag cumul term frequenc evalu coverag languag access entir corpu task construct languag model model compar measur calcul rate add vocabulari word distribut word vocabulari sampl space converg sampl distribut reason coverag util resourc search engin focu task gener queri highli accur cover di erent part languag space deal wai collect corpora web dictionari minor languag manual select function word queri iter time elimin function word share languag approach work requir domain knowledg form knowledg function word languag approach learn exampl requir hand document requir domain knowledg spider crawl page domain countri languag spoken case spider web page si domain result good coverag page si domain web page si domain found approxim web page si classi ed document si domain collect corpu crawl page start region countri slovenia categori yahoo categori countri languag accur yahoo exhaust list web site gener web page combin current method locat seed page crawler interest altern compar approach function search engin provid shown section approach outperform altern present system automat gener web search queri build corpu minor languag show varieti term select method queri gener queri perform collect corpora speci languag show select term score work languag wide varieti initi document keyword suppli user result similar perform approach automat applic build classi er search engin simpler ltere bring document satisfi classi save run classi er document retriev crawler kind er bene approach includ system system fetch decid classi cation system involv user input make approach applic import area acknowledg author support part nsf li grant refer moor document categor queri gener world wide web webac ai mercer mathemat statist machin translat comput du automat discoveri languag model text acm sigmod intern confer manag page acm text categor annual symposium document analysi inform page la april fowler learn web search intern confer web inform system gori crawl context graph intern confer larg vldb page septemb ghani jone learn monolingu languag model multilingu text ninth intern confer inform knowledg manag build minor languag corpora learn gener web search queri technic report technic report carnegi mellon center autom learn pennock improv categori speci web search learn queri modi cation symposium applic san januari gold roth approach spell correct machin croft relev feedback infer network sixteenth annual intern acm sigir confer research develop inform jelinek statist method speech recognit mit liberman distribut linguist data intern confer languag resourc grobelnik featur select unbalanc class distribut naiv intern confer machin learn renni mccallum reinforc learn spider web ecient intern confer machin resnik mine web bilingu text annual meet associ comput robertson sparck jone relev weight search term journal american societi inform jr relev feedback inform retriev smart retriev experi automat document page prentic van yang pederson compar studi featur select text categor intern confer machin learn
HCI/1363 4 tool visual group work abstract visual tool support usabl interact team environ particip activ engag manufactur testb project interact group mediat workplac member perform synchron asynchron activ depend project due chanc meet collabor space softwar instrument log interact system address problem investig analyz volum log data groupwar tool gener visual tool power larg amount data present collabor environ offer workplac provid level organ creat visual interfac perform exploratori sequenti data analysi preliminari tool show usabl engin emploi visual displai form interact gui interfac collabor softwar exploratori sequenti data analysi workplac commerci product identifi document describ collabor softwar environ identif impli recommend nation institut standard technolog michel pott steve nation institut standard technolog bureau drive md introduct current state comput environ chang remark dai applic applic user distribut interconnect organ creat virtual team work locat work asynchron time user work synchron plan accid workspac popul assort state compon subject chang depend myriad action user system groupwar system instrument captur system user clear type interact collabor system complex due multipl user evalu interact usabl tool determin interfac support goal object system extra complex groupwar system involv detect process interact interact visual power method perform complic data analysi subsequ section paper describ relat work area exploratori sequenti data data log granular scenario led develop log tool final direct futur work discuss background relat studi pertin literatur relat current topic main data captur data captur studi appli visual approach analyz data data issu sanderson fisher descript oo exploratori sequenti data analysi discuss rang event type interact author note granular captur event rang ey movement gestur chang time topic chang occur interv rang minut meet minut project extend month year enorm variabl granular durat event perspect lead parallel set event captur hilbert studi user interfac event categor yield usabl data author describ type abstract user interact hierarchi level physic input devic user interfac abstract interact event provid valu input relat event event attent level time difficult address level interact suggest visual present result transform data reduct techniqu leverag human visual abil detect relationship event yardstick measur scale clear data set creat interact user comput system larg collabor system necessarili experi combinatori due potenti actual interact multipl user environ obviou target visual solut visual lifelin develop plaisant al mechan displai person histori describ medic justic scenario implement interfac filter facilit lifelin displai data inform singl individu appar interfac extend cope data collabor set individu spring present set visual base data gather cascad augment support collabor author document system environ collabor data visual describ filter user render filter lead situat relationship team member detect logger develop mitr annot visual data varieti includ audio video visual tool part mml toolkit present usabl engin timelin set object object repres audio collabor tool invoc compon team environ filter data select user yield displai user activ creat make imposs determin user displai filter infer activ made difficult due potenti larg number object al present visual handl data deriv audio sourc system capabl detect boundari multipl speaker sound graphic displai show ident speaker attribut sound slide marker current posit playback marker drag wind media area interest interfac mechan overview zoom literatur relat data classif lead log data collabor activ gather suffici granular support made data mechan built interfac data accomplish dynam filter data work visual valid approach treatment show interfac develop provid full answer problem handl interact data manufactur collaboratori scenario develop support usabl interact manufactur research project nist involv autom robot weld testb nist figur workplac environ weld project weld research geograph work defin interfac standard weld work cell control power suppli achiev function weld testb implement test interfac equip power suppli analysi weld perform verifi effect oper core weld research team peopl role divid addit guest locat physic locat weld testb weld experi set defin experi develop interfac standard select part weld automot ship select type weld conduct synchron meet establish experi timelin deadlin perform sequenti primarili task procur prepar program test program simul perform initi team member virtual review weld typic perform synchron team difficult problem weld detect difficult problem weld typic weld engin review weld data asynchron analyz problem report find back group iter perform vari experi paramet defin experi plan weld result success set task repres group varieti wai achiev work cscw environ particip weld collaboratori access workplac client desktop comput comput weld testb workplac collabor system wysiwi whiteboard backdrop room provid boundari data group user interact metaphor transit groupwar doorwai provid portal room data organ room configur occup organ tool file messag board workplac commerci product identifi document describ collabor softwar environ identif impli recommend nation institut standard technolog figur user id mode figur tool id mode link document graphic creat workplac system synchron asynchron user importantli interact context relev data version project instrument captur inform room event timestamp server kei user descript function applic written java menu bar access special function replai symbol overlai leftmost panel label timelin shown main panel displai label toggl view figur show log data zoom time slice toggl button mode locat immedi label list button toggl overview entir log view singl dai lower portion logger window control analyst interact displai checkbox provid mechan show hide data view room panel displai map room log current view inform room panel show list room occupi current dai panel select subset user inform panel relat tool id instanc tool uniqu id displai panel panel hide tool inform level type tool analyst view invoc tool event shown panel user delimit set marker check box event type panel select time segment base dai found current master log panel crude zoom tool main displai panel figur show session occur time period investig bar show user occupi session tick mark color map event type overlaid bar time period shown reveal worker present collabor environ time show user engag multipl chat session filter data explor inform space infer drawn form subject statist treatment usabl analyst work collabor data set interest answer kind multipl user occupi space room frequent pattern path user set user lead answer question answer definit statist visual formul question detect gap innat abil human visual system figur perspect show list tool invoc rel time analyst manipul displai filter zoom combin tool conjunct tool room joint occup singl doorwai effect navig commun tool interfac serv rapidli decid formul relev summari futur direct usabl collabor environ difficult perform partli due potenti complex interact user groupwar user interact inform object tool provid environ usabl detect subtl subject quantit method analysi asynchron interact peopl creat room intent commun onset chat desktop conferenc easili flag synchron problem make infer contribut asynchron activ workflow log tool support detect trail tool usag prove suffici infer asynchron commun visual log tool usabl issu log record cover larg time intuit access part record correspond user activ navig problem relat excess amount scroll control main discret continu zoom work point depend workplac version instrument provid kind inform deem usabl futur version logger decoupl underli collabor environ applic broader rang applic acknowledg dr wu map idea larg group investig applic refer pm fisher exploratori sequenti data foundat special issu exploratori sequenti data analysi comput interact dm df extract usabl inform user interfac event david hilbert david technic report depart inform comput irvin er inform graphic ct shneiderman visual person histori chi el mb spring visual support group work ieee symposium visual septemb mitr logger ld fr chen tp moran speaker segment record chi nist autom arc weld seventh intern confer comput technolog weld greenberg design design tradeoff power workspac awar cscw roseman room metaphor transit research report depart comput canada collabor technolog global asm intern mechan engin congress exposit symposium manufactur logist global economi
IR/1364 5 workshop refer architectur data standard experi languag engin year gate robert kevin wilk natur languag process institut speech depart comput sheffield abstract gener architectur text aim provid softwar infrastructur research develop work area natur languag process version gate wide year paper review object motiv creation gate function design current system discuss strength weak current identifi area improv present plan implement improv introduct research human languag process write code ffl store data ffl displai ffl load processor modul data store ffl initi administ ffl divid comput client ffl pass data process machin softwar architectur languag process work applic softwar requir main activ carri infrastructur languag research field shouldnt reinvent compon resourc special job statistician doesnt detail ieee float point comput process specialist doesnt understand tag instal po tagger regard tool mathematica infrastructur work comput linguist languag chanc larg part work infrastructur support specif restrict area gener architectur text engin repres attempt fill languag process year experi work began widespread late system pivot point version draw cast critic ey progress present plan futur begin section architectur section describ gate current form section discuss strength weak draw pointer improv system section present plan implement final remark view text infrastructur languag process infrastructur natur languag process sort task deleg gener left individu project posit design gate focu common element nlp system tool perform specif task develop featur structur grammar evalu collect statist measur corpora vari entail adopt theori common factor nlp creat inform text develop system creat modul data resourc handl store exchang compar result test gener spend inordin amount time pour sampl enjoi relax type data structur typic involv larg good tool manag succinct view data work potenti stage progress write tree view program output syntax work exist view tool process data common languag process task solv accept previou work write part speech sentenc list common nomin store reusabl tool data plug system minim effort common instal integr problem solv case defin infrastructur architectur develop architectur pattern compon data resourc make languag process develop environ add graphic tool access servic provid architectur gate gate version ffl manag textual data storag ffl support visual assembl execut modular nlp system data structur ffl modular text process compon architectur ffl gate document ffl gate graphic ffl collect reusabl object languag engin manag inform text produc consum nlp visual access data manag control set resourc integr develop work gate begin subset basic sentenc paragraph identif tag add modifi modul specif task singl api access data store data back central line configur inform system displai data friendli graphic includ tree diagram system care data storag modul deliv embedd subsystem strip graphic interfac support modul languag includ tcl strength weak gate prove success number user report varieti work ffl teach undergradu postgradu colleagu umist sussex report system stuttgart ffl inform extract spanish greek colleagu collabor french athen develop greek gothenburg swedish barcelona work spanish ffl integr inform extract inform retriev naval offic san diego gate research text integr ffl integr nation collect nlp tool swedish ffl gothenburg athen system ad recognit mt system languag improv perform unknown ffl speech hear group sheffield model languag vie gate figur gate architectur ffl numer postgradu locat copenhagen surrei system avoid write simpl thing sentenc enabl manag data abstract experi user gate strength ffl facilit nlp compon reduc overhead document data ffl facilit collabor research provid modular system ffl facilit compar evalu method make easi interchang ffl facilit compon tagger materi arpa muc programm score softwar tree score tool gener annot score ffl contribut portabl nlp system problem domain provid markup tool gener train data learn input tool edinburgh sgml process librari weak area lack polish rough order version algorithm compon languag neglect resourc compon version text analysi neglect text gener compon visual interfac complex nonstandard instal support system skill run platform share modul depend share annot definit isomorph transform easi cater textual multimedia document support charact set point gener limit number modul integr system modul perform analysi gate integr model conveni power abstract layer base store inform associ text analysi resourc lexicon layer exist modul text util model limit version main aim extend cover core area languag engin support develop number abstract discuss extens resourc set includ predominantli data resourc thesauri corpora progress made decad provis resourc type standard barrier data resourc ffl resourc syntax access relat case custom api prolog sgml case british nation ffl resourc instal local usabl oper system support vari site consequ bullet linguist resourc share structur obviou lexicon word word common wast develop learn work seek investig exploit common resourc link lexicon build layer access routin top resourc evalu lexicon measur rel perform inform extract system instanti lexic end write code translat resourc sql sgml consequ bullet examin data resourc suitabl resourc provid give limit access product gain revenu suppli section resourc address problem plan develop common model resourc implement distribut server distribut code requir map model common model languag data resourc set inherit hierarchi top hierarchi gener abstract resourc thesauru group leav data item specif individu resourc wordnet synset program access develop select level common applic note excit element work provid algorithm dynam link common resourc connect eurowordnet develop simpli improv access exist languag data separ compat lexic data compress idea recent work standard build previou initi issu standard experi repositori lexic materi crl consortium lexic research suggest resourc deposit acknowledg de facto lexic resourc attempt render resourc usabl languag engin detail approach found cunningham al gate system ec fourth framework project instal site worldwid adopt tipster programm part final architectur capabl free charg licenc sheffield base collect experi user base eu system claim viabl nlp section field hope role wider varieti task acknowledg work support epsrc grant nato scienc grant crg arpa contract tipster programm contract max institut nijmegen refer wj black softwar framework natur languag process method languag process septemb publish ucl press wilk softwar infrastructur natur languag process confer appli natur languag process page wilk level plai field languag resourc evalu workshop distribut access lexic resourc confer languag resourc develop languag process system confer appli nlp system evan languag lexic knowledg steve rob cunningham entiti tag languag model technic report depart comput grishman sundheim messag understand confer histori intern confer comput page strzalkowski evalu syntax perform english workshop evalu natur languag process system associ comput thompson sgml basi nlp confer appli natur languag process electr word mit
HCI/1365 4 technic report motiv simul paint directli investig main issu face system issu includ provis natur user reproduct realist brush effect surfac textur map result paint store textur map technic report investig issu involv haptic interfac simul issu surfac textur map applic paint survei work relat haptic render surfac textur map present introduct textur map earli dai comput quest realist imageri proven polygon geometr primit inadequ repres requir surfac complex detail finer explicit model polygon geometr primit impract eleg solut introduc surfac detail repres imag map surfac approach textur imag call textur individu element call rectangular textur map resid textur coordin space textur map success techniqu ad realism imageri common techniqu person comput textur map capabl surfac textur map surfac normal vector perturb specular reflect explan textur map segal collect creativ textur map paint textur map typic creat scan exist gener procedur imag paint paint program textur map surfac establish map point surfac point textur coordin space creation textur map surfac separ hard part surfac map desir portion textur map knowledg map trivial accur creat correct textur map user simul paint low depart comput scienc north carolina chapel hill requir mathemat surfac creat textur map solut problem user paint directli surfac model surfac map result paint surfac textur perman store imag distort textur correct surfac solut pose number issu user interfac user easili paint surfac natur style surfac greater freedom movement brush enabl interest brush effect simul effici method creat effect correctli map result surfac textur map qualiti surfac model textur map suffici high effici storag paint result surfac textur map problem paint problem textur map surfac addit criteria judg qualiti issu discuss section main issu user interfac user interfac includ input output hardwar softwar input data input translat action provid feedback output devic main factor determin user interfac design associ relat specif physic action input devic actual action perform relat physic feedback output devic result perform action gener user interfac design principl common metaphor user reli everydai experi infer program work analog everydai thing work principl design user interfac direct manipul drag graphic screen act move directli action feedback immedi reinforc action direct manipul provid user realist place high demand capabl hardwar devic softwar control paint program input devic virtual model real pencil artist paint real object paint real object involv high spatial freedom movement placement object input devic simul limit spatial freedom made user interfac awkward unintuit advent input dimens user interfac open introduct haptic devic creat revolut user interfac haptic devic capabl provid forc feedback user recreat high input devic exampl haptic devic phantom technolog arm devic fit held simul paint creat possibl significantli narrow gap real paint simul paint user appli brush stroke differ surfac virtual object brush coupl visual undoubtedli provid natur user interfac paint figur phantom haptic devic creat realist touch haptic devic requir high haptic updat hz high rate maintain system stabil provid stiff virtual surfac contact determin virtual scene virtual object control user comput feedback forc high haptic updat rate impli contact determin effici accur order gener realist forc fast contact determin haptic interact challeng larg complex model effici algorithm power achiev sustain khz updat rate haptic render contact good effici forc model requir produc realist forc haptic devic devot section discuss issu haptic render brush effect textur map updat paint brush effect implement paint program surfac orient effect made interest realist surfac partial occlud surfac creat disjoint paint happen paint shape sphere brush brush effect chang orient brush brush deform vari pressur brush find part surfac affect contact determin comput intersect brush volum surfac surfac textur map intersect region textur map updat affect composit filter appli combin current paint paint laid surfac surfac result paint record textur map textur surfac assign surfac primit uniqu region textur region overlap successfulli avoid distort imag featur textur map textur map map textur map distort surfac desir surfac produc distort textur distort impli uniform resolut textur map surfac knowledg assumpt made simplifi speedup updat textur map paint appli adjac surfac primit assign adjac region textur benefit region adjac adjac textur map region adjac surfac primit simplifi speedup updat textur map textur map involv filter textur correctli boundari surfac primit adjac primit map adjac textur map region section technic report present motiv simul introduc main issu address system elabor main issu section present survei previou work simul paint section section discuss issu haptic render section survei previou work area section studi issu relat surfac textur criteria good applic paint survei surfac textur map present section section conclud technic report previou work paint haptic render surfac textur map activ work paint ultim goal simul paint provid realist experi user interfac simul realist paint effect review previou work chronolog observ advanc area paint input devic develop interact paint program user directli paint type materi shape pioneer work simul motiv overcom distort textur imag surfac user paint directli object brush control input move cursor screen imposs user freeli posit brush intend program assum brush predefin orient user paint surfac visibl discontinu brush stroke brush reach silhouett displai object paint geometr object repres rectangular mesh result paint intern record vertex attribut store file set textur map surfac simpli map consecut row column mesh vertic consecut row column textur map repres paint inform mesh vertic disadvantag ad paint detail requir mesh complex object remain typic paint stroke laid object chang view object full polygon affect brush method ensur render paint complex model brush posit object surfac comput item advantag graphic hardwar posit cursor screen item brush posit found read pixel item buffer cursor pixel object identifi polygon brush object stai stationari paint item buffer time determin posit brush assign orient respect object surfac orient determin brush geometri affect surfac type brush brush brush paint directli textur map textur coordin brush posit surfac brush orient perpendicular view capabl produc effect surfac brush orient perpendicular surfac brush brush project surfac direct parallel surfac normal paint scan surfac quest realist paint beer extend approach input devic polhemu space tracker track posit orient stylu system intend scan model paint scan regist physic model object paint stylu natur forc feedback haptic devic problem user interfac user move sensor physic paint appli mesh monitor user place paint appli scan model result multipl result mesh irregular difficult textur map paint result store mesh vertic textur map approach share disadvantag approach avoid sampl artifact displai polygon lead larg number polygon model speed contact determin virtual brush larg model spatial subdivid uniform voxel list vertic hash tabl index avoid wast space store empti voxel tip virtual shape defin volum paint appli posit orient brush determin brush volum posit space voxel intersect brush volum check vertic lie brush volum vertic assign select paint color disadvantag paint approach mesh physic object paint physic object requir accur regist virtual model registr process minut time user paint object registr error elimin virtual brush tip lie distanc mesh stylu physic touch object surfac paint model haptic interfac area cad model de facto model standard johnson al develop system user paint textur map directli trim model haptic interfac contact provid user draw portion model directli visibl contact determin haptic render directli trace surfac model method trace algorithm work track point surfac closest tip comput penetr depth probe penetr depth restor forc proport gener haptic devic resist penetr virtual model surfac simpli appli uniform discret paramet space method textur map highli distort region high curvatur perimet brush textur space comput surfac region textur map fill brush color method paint polygon model haptic interfac gregori al develop system interact multiresolut model paint haptic interfac model repres polygon mesh textur map store result paint contact determin haptic render method method hybrid util spatial partit bound volum hierarchi achiev requir method exploit coher author mention surfac paint laid textur map updat standard textur space affect triangl map triangl textur space surfac locat comput locat decid affect brush function haptic render type haptic haptic glove virtual virtual haptic joystick haptic steer wheel comput game vehicl simul devic similar arm technolog arm devic essenti small robot arm devic fit held simul paint haptic robot arm serv input devic haptic posit orient probe continu comput comput simul contact probe virtual environ comput reaction forc control haptic devic displai result forc action constitut typic haptic updat cycl contrast graphic displai updat rang frame haptic updat rate high updat order achiev system stabil haptic updat rate low user move virtual probe interior virtual object unstabl system devic damag user injuri high haptic updat rate requir produc stiff surfac skin sensit vibrat greater forc high frequenc percept main issu realist haptic displai requir high haptic updat rate impli effici contact determin algorithm forc model comput reaction forc capabl realist model touch virtual environ haptic render method produc forc feedback freedom translat forc tip probe correspond point virtual environ haptic updat cycl involv read posit comput contact point virtual object path swept virtual point updat comput translat reaction forc forc send control haptic devic produc physic forc haptic feedback coupl visual posit virtual point sampl graphic system displai updat comparison haptic haptic render difficult virtual probe translat virtual object arbitrari shape result forc feedback longer rotat contact determin identifi multipl contact point manipul object object virtual complex forc model gener translat forc torqu realist simul haptic system handl deform virtual order simul reaction forc chang brush shape vari pressur brush motion survei paper haptic address main issu previou work haptic render simpl haptic render hybrid hierarch fast accur gregori al develop simpl haptic system polygon model polygon hybrid hierarch comput spatial uniform grid cell polygon cell bound orient bound box tree spatial decomposit hierarch bound commonli speed detect spatial decomposit direct access individu cell cell potenti polygon intersect cell test actual intersect detect smaller space requir dramat altern data hierarch bound volum offer search individu polygon detect tree badli leav great depth combin spatial decomposit hierarch bound gregori al hope reduc undesir long haptic tip probe correspond point virtual environ contact point tip probe virtual environ comput intersect polygon path swept tip probe success time step special overlap test line segment bound surfac contact point forc proport distanc current probe posit contact point gener direct current probe posit contact point haptic updat rate maintain movement probe posit success time step detect algorithm util coher cach contact inform time step system achiev sustain khz haptic updat rate simpl object interact haptic model complex haptic simul requir complex object interact haptic model complex model make achiev desir updat rate harder addit measur reduc instabl system improv robust updat rate high tip probe correspond fall gap polygon numer error realist haptic render al place emphasi realist robust haptic render detect suggest haptic system capabl repres surfac object commonli found graphic environ environ line point haptic system make addit graphic inform surfac normal textur map haptic control robust degrad gracefulli limit perform reach virtual substitut physic probe virtual environ figur illustr motion virtual proxi posit alter virtual proxi attempt move tip probe proxi move directli goal direct motion proxi move surfac reduc distanc distanc stop local minimum configur interact forc gener haptic devic physic move goal locat proxi virtual proxi enabl system proxi exterior object proxi prevent slip tini numer gap found polygon mesh price costli comput updat proxi posit time step polygon model graphic displai surfac normal vertic al util normal produc proxi motion interpol vertex normal polygon proxi contact call forc similar shade produc surfac forc shade accur haptic model surfac system textur map modul surfac creat haptic effect figur virtual proxi contact determin path simpl hierarch bound sphere tree construct balanc tree simpl bound sphere bound volum polygon tightli bound path frequent intersect result longer detect time improv stabil haptic devic control loop separ updat haptic devic control high fix rate complex virtual environ system degrad gracefulli unstabl behav danger haptic render haptic render difficult problem haptic render haptic probe freeli manipul virtual object arbitrari shape main challeng manipul object simultan multipl contact object virtual environ extrem contact determin techniqu main challeng gener realist forc torqu haptic devic achiev requir speed detect multipl contact point time al sacrif contact accuraci haptic system virtual environ consist static rigid dynam rigid object manipul user haptic handl haptic devic static object approxim dynam object approxim point sampl surfac set voxel form volum occup set surfac point point surfac form point shell figur show point shell collid figur point shell collid forc model comput reaction forc torqu point shell contact occupi voxel point insid occupi tangent plane perpendicular normal construct plane made pass center voxel point penetr forc point proport distanc tangent plane effect creat forc field static object net forc torqu act dynam object obtain sum contribut intersect simpl model discontinu forc magnitud point cross voxel boundari improv occurr exact surfac object reduc offset forc field outward surfac voxel layer outer proxim voxel layer forc brake forc gener reduc reduc chanc forc discontinu mention earlier mitig dynam simul base virtual connect haptic motion motion dynam object virtual spring damper author claim system produc stabl convinc forc feedback surfac textur map result paint record textur map textur surfac object assign uniqu area textur map call easili satisfi map surfac primit separ unoccupi locat textur connect primit obviou problem approach larg gap textur region map primit wast textur space result textur map larg textur ineffici interact render optim algorithm minim problem inher approxim algorithm produc satisfactori solut addit criteria discuss satisfi approach map adjac surfac primit adjac region textur map refer adjac criterion textur map render filter textur map requir filter kernel larger pixel boundari surfac primit contribut textur region assign primit adjac criterion filter result boundari surfac primit incorrect advantag satisfi adjac criterion paint result easili updat textur map textur area updat contigu area mention section surfac minim textur map distort problem activ studi tradit goal map textur map textur pattern surfac minim distort textur pattern tradit goal requir adjac region textur map map adjac surfac primit surfac curvatur high topolog find satisfactori difficult made criteria fulli satisfi criterion briefli survei paper surfac textur target tradit goal previou work surfac textur map earli attempt minim textur map distort made bier sloan textur map separ step textur map appli simpl intermedi surfac cylind box intermedi surfac shape made paper distort textur map intermedi surfac simpl intermedi surfac project target object deriv final map choic intermedi project method dramat affect lot user interact requir method suitabl object geometr similar intermedi surfac object high surfac complex criteria met global minim textur distort research optim techniqu deriv surfac minim textur distort work al global energi function minim treat surfac deform elast energi function measur total energi perform deform origin energi function optim process slow obtain simpl al approxim origin energi function length edg surfac triangl object length textur space global optim handl object high surfac excess distort map textur al solv problem split object surfac independ appli optim separ split object curvatur inform surfac system interact tool user control split object split object adjac criterion consid partial met region big problem present motiv simul paint directli investig main issu face system realist haptic interfac provid user natur paint experi issu survei work haptic render discuss issu surfac textur criteria meet order paint textur map model complex shape remain open current surfac method suffici simul paint fast accur dof haptic render remain major challeng major challeng simul paint simul realist brush effect baxter al implement interact haptic paint system brush head produc realist brush stroke flat rectangular virtual canva haptic interfac enabl dof input dof output remain challeng extend method arbitrari surfac acknowledg greg welch suggest bibliographi andrew beer marc paint scan surfac acm symposium interact april bill vincent ming lin interact haptic paint virtual brush acm siggraph eric bier kenneth jr textur map ieee comput graphic pp septemb ed algorithm comput displai curv surfac phd depart comput decemb lin hierarch structur rapid detect acm siggraph august arthur ming stefan russel taylor framework fast accur detect haptic interact ieee virtual realiti confer pp arthur stephen ming lin interact multiresolut model paint haptic interfac ieee virtual realiti confer paul mark segal textur map fundament draw primit collect comput graphic june pat paul direct paint textur shape acm siggraph pp august paul survei textur map ieee comput graphic novemb david thoma thompson matthew donald nelson elain cohen paint textur haptic interfac ieee virtual realiti confer bruno textur map shear triangul mesh acm siggraph august ann interact textur map acm siggraph august william kevin jame troi haptic render voxel sampl acm siggraph august diego khatib haptic displai complex graphic environ acm siggraph august thoma thompson david johnson elain cohen direct haptic render model acm symposium interact pp april
Agents/1366 1 system increment gradient reinforc learn alain olivi bp franc abstract reinforc learn methodolog design system realist set situat agent local task automat build coordin system crucial import simpl reactiv agent learn behavior decentr cope difficulti inher rl develop increment learn algorithm agent face complex task illustr gener framework comput experi agent coordin reach global goal introduct system system autonom entiti call agent interact grow interest artifici intellig term research applic ma build simul tune system reach desir global paper deal kei problem design ma autom fashion learn learn ma form opt reinforc learn method requir teacher hand solut problem evalu current scalar learn system simpl reactiv situat agent local percept system easier build solv complex problem decentr agent face simpler task rl suffer combinatori decentr learn process bring agent learn behavior simplifi task learn consist local aspect realist situat agent major difficulti burden rl global state usual situat agent reli local partial percept world global state system stai prevent classic rl algorithm find optim shown assign problem posit reward evid credit posit action led reward problem crucial decid agent reward answer problem decentr increment learn algorithm base classic rl techniqu find stochast polici agent stochast behavior adapt problem partial percept agent progress pit harder harder task progress learn complex behavior aspect increment learn begin learn minim coordin export basic behavior task agent behavior refin learn demand environ origin approach twofold learn decentr increment present method learn multiag system experi test idea section detail section describ experi conduct test viabil approach discuss work section highlight comparison similar work futur direct remark end paper section framework present kind agent show problem face reinforc learn set explain increment learn bring partial solut problem agent interest design system individu agent learn behavior written decid work simpl reactiv agent complex reason concentr learn aspect design agent local percept local percept discuss section heterogen learn process agent learn agent acquir behavior agent share goal coordin reach characterist import framework easili incorpor agent limit classic rl reinforc learn method appeal wai learn optim behavior agent requir scalar feedback system agent learn techniqu uncertainti evolut converg rl algorithm proven markov process mdp defin finit set state set action system probabl system end environ gener reward problem find optim state action maxim reward receiv express util map call polici point evolut kind ma interest mdp solv classic reinforc learn algorithm state system composit state agent action joint action individu action agent number state action central view problem quickli prove big rl illustr section solv problem solv central aim solut agent learn shown solv problem agent partial percept state provabl polynomi algorithm solv problem face major difficulti transit reactiv agent local view environ joint action solv problem agent unpredict element environ transit state system probabl agent move ahead depend greatli action adjac agent partial observ percept local global state problem problem hand belong class partial observ markov model classic stationari partial observ markov process imposs solv hundr state combin problem partial make problem approxim increment gradient reinforc learn find approxim solut increment gradient rl main idea methodolog progress scale complex problem agent run local version gradient descent stochast behavior context partial observ stochast behavior perform determinist polici previou experi chose work gradient descent reinforc learn algorithm suit stochast polici design baxter detail section increment learn speed learn reduc problem complex credit methodolog increment learn obviou number agent learn start small number learn strategi agent solv problem agent initi polici origin agent refin learn increment learn complex dimens problem agent pit harder harder task task term number posit reinforc task learn begin simpl version task agent heavili guid solv task learn task made harder give freedom action agent local percept situat agent local percept reduc complex problem central problem huge solv section mean agent global state make rl difficult local percept prerequisit increment behavior agent base world scale immedi number dimens world complex task experi increment learn applic gener notion increment learn experi short descript give detail increment task harder task agent problem descript task chosen involv agent yellow grid world goal push yellow cube blue agent coordin movement attain goal pair cube temporarili disappear agent fusion receiv posit reward goal merg cube time simpli action move south west agent push agent cube consequ action depend constraint consid shown figur direct nearest agent opposit direct nearest yellow cube direct nearest blue cube yellow cube nearest blue cube nearest combin exist maximum combin percept reduc number symmetri problem number small compar state observ central independ size reward function chosen problem agent identifi origin fusion cube reward case reward agent reward coher agent local inform conclud remark simul focu learn implement simpl mechan avoid problem cube border cell grid cube reappear put cell color agent cube relat problem yellow blue agent yellow se blue nw nw cy yellow cube cb blue cube oa agent figur exampl agent simpl learn algorithm agent gradient descent algorithm learn polici version algorithm baxter polici set lead expect gradient descent permit find local optim polici set paramet chose real valu paramet polici defin probabl make case reduc problem step increment learn scheme small size world minim number agent agent cube color begin posit reinforc agent face harder harder problem progress task situat lead posit reward situat start point increment learn agent face sequenc task learn end learn defin sequenc step begin situat repeat suffici success call experi agent trainer defin sequenc progress experi learn design train sequenc start situat true depend case ma agent make move simultan start configur tabl sequenc experi increment learn number merg number step figur cube increment raw learn asada show effici method tabl show sequenc experi agent train start move reach agent push cube step reach explor time figur show evolut pair effici progress learn curv show effici learn period assist train begin step train delai notabl perform reach assist provid method cube agent tabl averag effici number merg step agent cube step increment learn agent reach goal world cube effici polici learn agent polici evolv popul world note agent learn polici case learn influenc number agent cube part interest check effici number agent deal number cube number agent agent fix behavior learn effici cube good reaction good result test carri cube agent world seri consecut seri begin random configur block situat seri made case tabl averag effici case effici number merg made quickli show optim number agent number cube denot bold number tabl grow number agent improv bring coordin problem grow number result improv optim number agent hesit cube work fall easili oscillatori sequenc move set condit agent random behavior bad number increment learn number agent agent fix behavior learn agent cube case grow number cube induc problem solv number merg number step figur evolut learn scratch practic confound number merg number step figur evolut learn behavior suffici number agent increment learn solut improv polici learn agent figur show effici evolv time learn case number agent learn scratch shown figur agent learn scratch slow evolut object learn speed rise rate group agent reach maximum result result obtain section situat fix polici confirm interest adapt learn notic optim effici reach agent increment learn perform reach learn scratch agent behavior knowledg find local optimum discuss similar work explicit coordin experi show work benefit address explicitli coordin problem case world coordin push pair agent easili work boutili studi problem theoret point markov process agent comput global optim polici coordin problem optim joint action uniqu coordin reach social commun learn mechan central plan framework decentr rl orient reinforc settl nash equilibria solv coordin problem theoret work difficult agent field research deal explicitli account agent ma agent build model estim action gener model bad model model lead complex agent commun solv problem explicit coordin attent paid fact commun cost worthwhil pai cost simpli put agent coordin problem agent explicitli solv question studi futur investig short term memori provid agent attent mechan coordin reward work system option adapt reward function action percept simpl reinforc algorithm reward kind boolean process reward big reward smoother reward adapt give frequent hint individu agent size state action space greatli reduc learn easier kind special agent made learn task chang agent learn process coin framework similar framework design ma learn main idea work adapt reward function cluster agent build system deal problem creat share experi conduct show learn difficult slow framework find idea adapt learn automat increment learn explain problem hand complex task start point decomposit posit reward situat decomposit process automat perform onlin learn agent addit classic agent randomli explor mark work knowledg learn transfer agent paper address problem automat design larg system framework base individu agent reinforc learn algorithm adapt behavior desir global task learn problem gener unsolv decentr aspect classic limit partial observ credit assign combinatori increment learn scheme agent face harder harder problem method gener adapt task adapt agent problem hand test approach simul environ agent coordin order reach share goal fusion color cube experi give credit framework show effici increment learn increment learn lead learn rate raw learn effici learn complex task initi stage increment learn learn directli complex task scratch framework led conclud room improv discuss wai overcom commun address explicit memori intent deal oscillatori behavior reinforc learn possibl adequ learn algorithm consid model behavior agent predict action improv behavior agent acknowledg bruno vincent numer discuss invalu write paper refer hosoda behavior acquisit real robot reinforc learn machin baxter bartlett direct reinforc gradient estim algorithm technic australian nation ds complex decentr control markov process proc conf uncertainti artifici boutili learn coordin multiag process proc de increment reinforc learn design multiag system proc carmel markovitch oppon model learn system workshop solv pomdp select proc european conf artifici ferber system introduct distribut artifici intellig john wilei son hu wellman multiag reinforc theoret framework algorithm proc kaelbl learn polici partial observ scale proc reinforc learn domain autonom jordan learn state estim partial observ markovian process proc stone veloso multiag survei machin learn perspect autonom sutton barto reinforc learn bradford mit vidal agent learn framework analysi collect paper workshop multiag learn aaai tumer gener principl multiag system proc page zilberstein commun markov process proc icma workshop game theoret theoret
IR/1367 5 icml enhanc learn unlabel data salli goldman yan zhou depart comput washington st mo usa abstract practic learn small amount label data larg pool unlabel data learn algorithm develop extens studi present strategi unlabel data improv perform standard learn algorithm unlik prior procedur blum mitchel assum redund view suffici perfect classif requir strategi place learn algorithm hypothesi partit space set class tree leaf defin evalu strategi experi data uci repositori introduct practic learn small amount label data larg pool unlabel data learn algorithm develop extens studi unlabel data improv expect learn algorithm complement provid label data wai expect algorithm pattern data label unlabel data motiv strategi present strategi unlabel data improv perform standard learn algorithm unlik prior procedur blum mitchel assum redund view suffici perfect classif learn algorithm origin train provid label data statist learner select unlabel data label learner repeat process long data select label combin result obtain final hypothesi requir strategi place learn algorithm hypothesi partit space set class tree leaf defin kei issu resolv design algorithm simpl techniqu base statist confid combin hypothesi learn algorithm obtain final hypothesi aim hypothesi correctli classifi portion instanc space correctli classifi combin error rate combin present methodolog decid learn algorithm label data confid learn algorithm predict label data learn algorithm predict error addit care ensur suffici low classif rate train data set expand evalu strategi result data uci repositori learn algorithm train label data strategi make provid pool unlabel data result run data strategi yield improv improv improv algorithm omnisci pick individu run remain paper organ section outlin relat work unlabel data improv perform learn algorithm section present cotrain algorithm describ theoret foundat techniqu section present empir result section present discuss direct futur work relat work approach studi unlabel data improv perform learn algorithm classic method learn unlabel data gener model classifi rubin approach model label estim paramet estim gener model wu work distribut unlabel data defin metric kernel function perform check support vector machin train label data idea larg margin classif transduct infer inspir unlabel data larg margin classif algorithm favor rule achiev larg classif margin creat depend unlabel data paramet function class approach make unlabel data probabl estim target weight estim label substitut estim probabl queri learn algorithm de relat area research goal activ learn lier algorithm repeatedli select unlabel expert provid correct rebuild hypothesi field queri unlabel data label queri import compon learn select unlabel assum expert provid label techniqu introduc activ learn studi built initi work perform blum mitchel show unlabel data augment label data provid instanc space repres view independ redund set learn classifi web page high low qualiti link page link page make strong assumpt view suffici label data goal larg set unlabel data augment smaller set label exampl present strategi situat gave empir theoret result show strategi work set craven al addit result classifi web idea assumpt natur redund data collin singer work studi applic area text classif riloff jone task learn classifi noun phrase posit neg redund suffici featur noun phrase linguist context noun phrase yarowski similar approach disambigu word determin word refer manufactur plant set independ suffici redund set redund view present procedur gener situat redund view method describ algorithm provid theoret basi design assum learn algorithm output hypothesi defin partit instanc space tree partit instanc space class defin leaf maintain set unlabel origin label set la data label set lb data label estim wa wb number exampl la lb mislabel make bia overestim error conserv label data refer estim conserv estim algorithm repeat step la lb chang iter start train algorithm label exampl la obtain hypothesi ha train obtain hb algorithm consid class decid label data algorithm test satisfi label data ensur class label data accuraci good accuraci hypothesi test prevent degrad perform due label data class ha pass label data place lb label data manner complet round procedur detail combin method tabl detail cotrain algorithm tabl discuss kei aspect combin ha hb hypothesi select data algorithm label round combin describ ha hb combin estim accuraci ha hb interv binomi paramet larson marx hypothesi class cross valid comput correct predict made comput interv denot make predict compar confid interv class class predict hypothesi correspond maximum quantiti confid interv class ha lower confid interv class hb predict ha ha highest confid cautiou predict ha hb confid interv class hb higher ha predict hb perform cross origin label data label data includ label base earlier origin label data advantag origin label data confid interv accur data label error comput confid interv estim origin label data class data class data confid interv larger maximum bs leaf confid interv predict confid bs leaf exampl label algorithm unlabel place lb label ha place lb confid valid label bs confid valid label amount data label suffici classif train futur round address question decid exampl suffici confid predict label vice combin interv binomi paramet hypothesi algorithm hb comput interv denot hb class defin ha comput interv high confid interv class ha higher low hb exampl class pass test ad lb describ test design control classif rate label exampl test base relationship hypothesi accuraci tabl techniqu combin ha hb creat hypothesi hb hb combin cross valid comput interv ha ha cross valid comput interv hb hb instanc space class ha cross valid comput interv class hb cross valid comput interv ha hb nn ha accur hb empti ha hb predict ha predict hb ha predict ha predict hb nn hb accur ha empti hb ha predict hb predict ha hb predict hb predict ha sampl size classif rate assum paramet held constant angluin laird ffl ffl constant relationship decid amount addit data label suffici classif rate simplifi formula comput squar error algorithm data label algorithm bs current hypothesi valu number train exampl classif jl lb conserv estim wb lb estim jl lb jl lb test comput set exampl ha map class conserv estim number exampl comput estim squar error exampl label jl lb jl lb indic belief hb improv exampl label ha ad lb updat lb wb method select data label procedur enabl algorithm label amount data requir iter evalu describ result algorithm gener tree algorithm graph algorithm algorithm select simpli part view arbitrari algorithm satisfi properti form partit data induct tree algorithm criteria split tree tabl method nn initi label data set unlabel data set la nn data label wa nn conserv estim mislabel exampl la lb nn data label wb nn conserv estim mislabel exampl lb nn main loop cross valid comput interv ha ha cross valid comput interv hb hb repeat la lb chang iter round run algorithm label data la obtain hypothesi ha jl la jl la estim run algorithm label data obtain hypothesi hb jl lb jl lb estim data label class defin ha exampl map cross valid comput interv test pass label exampl estim mislabel ha jl jl lb nn estim error rate label exampl label ha lb lb wb wb data label class defin hb exampl map cross valid comput interv test pass label exampl estim mislabel hb jl la jl la nn estim error rate label exampl label hb la la wa wa nn final hypothesi predict hb tabl test data characterist summari result data set show number test point misclassifi algorithm run median perform averag improv improv error rate round data number error round avg run set attribut alg improv jlj ju dt dg dt dg dt dg dt dg dt dg dt dg dt vote dg dt dg base inform gain attribut attribut lowest averag entropi inform made root current rest tree built stand oblivi graph induc build oblivi graph unlik replic disjunct fragment data problem result present result data set uci machin learn data set reduc amount label data rest unlabel data pick size label data set learn algorithm perform set algorithm design intend set label data make highli accur predict label data bootstrap process procedur size provid label data put test data form data perform independ random select label data tabl show relev characterist data set empir test summari result figur show result run data graphic form data set perform initi label data round cotrain procedur algorithm improv perform figur show result run breast cancer data set data set perform gener improv number round error rate combin figur result data set number round error rate combin figur result data set data set independ run show characterist term method reduc error rate obtain result run perform small amount case error run procedur reduc error rate summari reduct error rate obtain shown tabl averag number round round includ futur work present strategi learn label data unlabel data set redund view data empir result demonstr standard learn algorithm successfulli label data interest direct futur research standard confid interv binomi paramet test confid interv high confid interv tabl summari result algorithm avg error rate algorithm data low confid label data label boost procedur schapir singer train data set techniqu work confid rate rel obtain train data explor wai improv estim confid interv import direct futur work variat procedur studi algorithm label exampl class highest confid level significantli number error rate good approach consid number class break graph level higher leav intern node direct ancestor improv perform addit variat specif techniqu interest explor improv plan perform addit empir studi real data applic area redund set featur plan run test learn algorithm interest research direct explor techniqu activ learn decid exampl valuabl label perform empir hope develop theori procedur understand improv acknowledg author gratefulli acknowledg support nation scienc foundat grant dan dan discuss refer learn noisi exampl machin learn combin label unlabel data eleventh annual confer comput learn theori queri learn larg margin classifi unpublish manuscript model entiti classif joint confer empir method natur languag process larg corpora learn extract symbol knowledg world wide web fifteenth nation confer artifici intellig sean sampl train probabilist classifi twelfth intern confer machin learn san morgan kaufmann de posit unlabel exampl learn tenth intern confer algorithm learn theori db maximum likelihood incomplet data em algorithm journal royal statist seri induct graph european confer machin learn text categor label unlabel gener model approach work note nip workshop unlabel data learn discrimin technic report mit ai ma effici learn statist queri annual acm symposium theori comput acm press introduct mathemat statist applic prentic hall evalu optim autonom text classif system eighteenth annual intern acm special interest group inform retriev acm press activ learn text categor fourteenth nation confer artifici intellig uci repositori machin learn text classif label unlabel document em machin learn induct tree machin learn riloff learn dictionari inform extract bootstrap sixteenth nation confer artifici intellig improv boost algorithm predict machin learn approach model select fourteenth nation confer artifici intellig margin transduct work note nip workshop unlabel data learn unlabel data learn algorithm work note nip workshop unlabel data learn word disambigu rival method annual meet associ comput linguist asymptot result unlabel data work note nip workshop unlabel data learn
Agents/1368 1 agent implement logic express languag frieder oliv jan informatik universität institut für rheinau koblenz spatial agent implement logic express languag frieder oliv jan abstract present architectur spatial tempor agent focu laid declar make agent script express understand realiz logic program logic descript languag express action plan autonom cooper agent robocup system architectur host constraint technolog qualit spatial quantit data basic layer process sensor inform interfac transfer data logic facil access preprocess data suppli basic skill layer perform spatial reason top layer enabl complex skill fourth layer establish act team emerg explicit cooper logic deduct provid clean mean implement teamwork behavior introduct task solv team autonom agent complex order achiev singl agent set complementari subtask action perform pure reactiv meet requir task requir amount plan reason led idea combin advantag procedur logic program decid hybrid system layer architectur layer architectur advantag build clear architectur independ modul distinguish urgent task perform pattern requir time care plan cognit task implement agent logic contrast approach provid architectur system logic deduct formal specif languag implement languag widespread architectur origin mean modal logic axiomat kind architectur recent implement languag describ system architectur show deduct constraint robocup system combin bdi approach multipl agent perform collect action agent autonom implement manner similar logic program major goal undertaken modular system architectur meet requir robocup agent agent react desir complex behavior agent program easili declar manner handl format knowledg environ inform quantit pictori proposit natur deduct express plain logic constraint technolog integr axiomat approach spatial constraint theori numer sensor data agent act autonom cooper agent develop script languag specif collect action intend plan applic situat script translat logic program straightforward manner outlin approach discuss layer system architectur function respect layer fig show complet architectur lowest implement interfac layer implement logic program languag cooper behavior complex abil qualit spatial reason prolog basic skill percept figur system architectur basic layer host reactiv behavior implement prolog extens extens enhanc robocup interfac time critic comput task handl exchang data modul atom command complex action logic formal kick environ posit determin settl layer sect specif facil soccer scenario dribbl ball intercept spatial cognit requir spatial cognit content layer player recogn pass ball player approach pure qualit disregard quantit inform transfer qualit inexact vagu logic connect formal access data level abstract reason exact requir present approach detail sect layer host complex possibl requir singl plan question remain teamwork invok explicitli commun suffici robust implicit teamwork kind agent work current implement implicitli exploit knowledg implement agent except clone cooper behavior requir implement detail problem commun languag case gener approach exchang knowledg agent knowledg queri manipul languag domain applic kqml gener reliabl commun intern architectur unknown agent commun prolog predic directli advantag approach interpret receiv inform disadvantag success commun agent intern structur basic abil action lowest layer system architectur handl basic skill percept environ basic skill action perform immedi turn kick ball complex action spatial dribbl ball ball intercept current complex action part written prolog modul depend hardwar percept includ object local complex requir process simplest percept mean read data sensor data order make tractabl comput program note aim logic present combin advantag declar effici addit make constraint technolog logic descript languag introduc agent program written interpret manner similar clp line distinguish class tion percept ô execut percept predic ô return request data data argument predic real number percept predic ô return distanc measur meter real number main matter action perform action action predic primit action assign truth depend success failur action note truth predic depend actual time action request data execut interfac request sensor data knowledg base updat period request inform object visibl recent inform agent store inform object simul time step memori recollect data process complex inform global posit inform sect direct relat object refer actual agent relat depend rel posit agent independ properti pass time model wai mean creat snapshot world defin calculu track actual simul step time ignor prolog predic provid request current statu sensor inform demand data synchron action initi posit determin import piec inform agent posit system extens librari make object local give overview work inconsist inform agent egocentr view world actual sensor data provid inform posit landmark point border line rel posit orient agent polar coordin intern coordin system note agent obviou face bodi direct rel posit inform suffici complex task addit egocentr view scenario yield frame refer absolut global map environ extern coordin system robocup geometri plai field convert posit inform cartesian advantag absolut posit agent identifi locat respect object visibl moment absolut frame refer order commun agent situat cooper action system host procedur object local wrt extern coordin system introduc requir direct visibl landmark rel orient agent provid posit agent form circl lie straight absolut posit orient agent comput time complex linear number landmark equat system complex number data procedur estim posit appli squar method refer actual posit question li segment circl shown fig ϕ ϕ ϕ figur angl inform procedur limit sensor data landmark border line procedur posit determin requir case posit agent uniqu determin distanc angl landmark suffici posit determin rel posit landmark point border line center line view axi agent cross line provid point ident track movement estim current posit method implement order lai solid quantit basi qualit reason higher layer basic skill agent move environ basic requir practic robot system robocup scenario agent handl ball mean run kick dribbl ball import task ball intercept agent recogn comput ball trajectori comput point ball intercept stop ϕ ϕ ϕ ball macro execut situat qualit reason larg set abil robocup scenario state sight ball consid part architectur agent task requir deep comput quantit data made action reason reason classifi action basic skill complex action requir reason content layer sect basic skill implement describ special skill agent search account knowledg time ball dash kick condit avoid obstacl dribbl extrapol ball trajectori time futur enabl agent intercept oppon pass block shot qualit spatial reason human soccer player enter lot decid decid compar situat situat handl build provid client situat connect action recogn situat client experi plan action rare case situat fit store situat pattern set abstract pattern similar situat heurist action execut modifi order identifi situat abstract quantit data qualit level class addit class mention sect qualiti õ qualit predic defin quantit percept logic rule relat case qualit predic relat base case speak pure qualit predic relat left reduc qualit predic left distanc agent ball robocup scenario aspect interest distinguish close ball agent detect detail short shoot data remot quantit distanc interv map qualiti chosen plan scheme instanti quantit data actual execut relat work present reason qualit level provid fig illustr correspond quantit qualit distanc short distanc area constraint reason figur distanc quantit qualit approach qualit spatial reason reli region connect calculu renz advantag qualit inform seemingli complex situat reduc pattern concentr relev portion inform qualit descript rough approxim reason pure qualit level vagu question make quantit qualit inform sensor data good idea make quantit data abstract qualit level quantit inform pure qualit reason knowledg prefer combin quantit reason qualit spatial implement constraint system formal integr gener deduct framework constraint logic program process spatial reason context lai basi action perform problem sourc inform numer sensor deriv qualit knowledg control mechan decid request inform obtain current quantit data simpli convert qualit present rare case pure qualit reason perform appli transit rule topolog relat difficult decid situat option current simpli make backtrack facil prolog good idea emploi reason process axiomat approach investig problem model situat pattern mean logic program full theorem prove system protein pass ball situat player player reach player opposit model situat top logic relat properti qualiti axiomat possibl model top gener geometr axiom collinear basic concept natur order version base assum sensor data inform order order inform requir plan action detail axiomat approach neg inform oppon prolog negat failur problem complex queri led full logic protein theorem prover problem determin pass check logic rule negat rule intend mean rule pass oppon agent partner question negat existenti quantif protein classic negat usual theorem prove existenti quantif treat replac existenti quantifi variabl constant function potenti infinit player consid finit domain player visibl agent implement close world constraint domain reason complet termin system sophist kind negat context note compon integr actual koblenz axiomat situat higher abil task requir deeper express bdi agent architectur belief qualit predic negat conjunct belief achiev goal test goal õ qualit predic desir goal index list satisfi desir perform action build rule situat form written belief precondit intent strictli intend intend plan acycl graph desir design start node edg label actor subset actor edg outgo test goal label addit possibl delai subgraph wrt edg actor requir tree start node binari branch test node subgraph repres role respect actor achiev goal perform activ index wait achiev extern interrupt occur messag robocup agent return default applic precondit doubl pass collect action doubl pass actor actor kick ball actor actor run expect pass actor illustr fig order initi agent simultan recogn respect role current situat belief state belief doubl pass situat nearest neighbor belong player ball player oppon dribbl straight intend plan pass dash figur doubl pass situat pass pass ball run final pass ball respect rule express shown fig figur doubl pass script experi implement doubl notic main problem actor simultan recogn agent possibl agent commun agent lot cooper partner coordin belief state made similar experi simpler kind simpl pass main problem agent partner agent pass make order initi complex action probabl success action complex decid action agent remain autonom robust translat rule clp distinguish type basic plan actor complex plan actor plan implement higher abil realiz teamwork bdi script translat clp rule straightforward manner achiev test goal introduc rule default recip è ü ü ü è ü extern event updat main differ clp approach handl extern event concurr congolog giacomo qualit reason perform constraint realiz time account situat role bdi script translat directli logic program possibl concurr constraint reader notic situat ò role correspond ò clp rule rule ident wrt head precondit action differ actor role part actor plai role respect situat instanti plan actor doubl pass rule fig recal achiev goal convert test goal control sequenc give shown translat clp rule time complex decid action role perform problem partial overcom commun action directli partner implement send call prolog predic robust system case fail action fail commun summari present logic descript languag line implement languag understood gener clp quantit qualit spatial reason pure qualit reason effici calculi context quantit inform system clean mean program soccer agent declar koblenz player implement team peopl conduct test game score local mbit ethernet result success game shown fig koblenz pentium ii sun sparc mb main koblenz humboldt sun mhz gb main sun mhz gb main sun sparc mb main figur success soccer simul game problem solv small identifi main huge effect execut collect action fail imperfect implement low level facil activ agent recogn situat special role intend plan pass agent reach agent minim improv skill implement work adapt skill cmunit simul predict local optim skill point situat doubl pass implement agent frequent stick default situat unclear agent problem solv axiomat situat provid script agent work concentr requir except situat concurr mechan inform acquisit area research logic mechan lower level approach deduct build complet view world time agent set logic rule rebuild spatial applic techniqu real robot step research activ robust process improv mean reason specif commun languag reason formal investig refer peter baumgartn ulrich furbach prover theori extens interfac alan intern confer autom lnai page york anthoni combin multipl spatial reason system ieee intern confer tool artifici intellig page newport leonid mobil robot local landmark ieee transact robot april foundat geometri michael bratman practic reason harvard von und mit fachbereich universität marku jan wendler artifici soccer ai page di daniel qualit posit inform artifici klau fredrik johan helmut itsuki patrick peter version giacomo giusepp de yve hector levesqu reason concurr priorit exogen action situat calculu martha intern joint confer artifici page volum frieder pablo autom reason logic program german workshop inform intern comput limit user manual extens user manual volum lar axiomat approach spatial relat underli front steffen advanc artifici intellig annual german confer artifici lnai page york christian kai zimmermann util spatial structur cognit plausibl effici reason ieee intern confer jaffar michael maher constraint logic survei journal logic christoph jung layer agent robocup simul asada hiroaki robot soccer lnai yanni labrou tim finin kqml specif technic report tr comput scienc electr engin maryland baltimor md februari jan murrai goal castl die ein de fachbereich universität itsuki noda soccer simul robocup oliv user march oliv ein zum robocup soccer server fachbereich universität anthoni cohn spatial logic base region connect int conf knowledg page san morgan kaufmann anand rao bdi agent speak logic comput languag walter van de veld john agent break european workshop model autonom agent lnai page springer jochen renz bernhard nebel effici method qualit spatial reason henri european confer artifici intellig john wilei peter manuela patrick rilei champion simul team asada hiroaki robot soccer lnai research report frieder oliv jan spatial agent implement logic express languag kurt carlo simon zur hybrid system frieder stolzenburg power model gener peter jd bruce spencer merg path improv minim model hyper tableaux roger uh worldwid peter norbert ulrich furbach confluent connect calculu bernt andrea winter queri enabl technolog softwar reengin georg pick program ulrich ilkka nonmonoton effici calculi implement steffen infer mechan theori applic ws ki stefan teodor przymusinski super logic program dix logic program paradigm stefan burkhard ulrich zukowski comput model manfr kamp greql ein für da peter angelika manfr andrea winter und formal grundlagen peter da thoma marx workflow model wfmc dieter schedul criteria ag constraint process hard system ulrich furbach disjunct logic program horn program control program andrea schmid solut count infin problem distanc vector rout ulrich michael frieder stolzenburg proof debug peter model elimin simplif applic softwar verif bernt andrea peter ebert program system jorg lobo logic program nonmonoton reason kurt carlo jan technischen anwendungen manfr kamp manag softwar repositori program tool gener approach peter baumgartn hyper tableaux gener jen agent architectur model ma social scienc marcel softwar global illumin research marcel de bernt andrea cycl step jose mauricio osorio confluent rewrit system logic program semant lutz note nondeterminist comput stephan system model lutz mauric finit test tube predict peter baumgartn der der jen thoma marx angelika franzk object orient system angelika franzk recommend improv moniz teodor przymusinski logic program knowledg ilp lutz uniform approach interleav semant petri net ulrich furbach workshop model base autom reason frieder stolzenburg framework incorpor reason constraint logic program carlo thoma marx petri net tool andrea winter doctor consortium advanc inform system june roger omt metamodel stefan teodor przymusinski super logic program mauricio osorio semant suitabl aggreg peter baumgartn ration effici algorithm view delet wolfgang dieter integr fix prioriti static schedul maintain extern consist alexand oper semant visual notat thoma marx april der manfr andrea winter gener system support understand heterogen softwar roger ebert booch metamodel lui teodor przymusinski logic program reason angelika franzk gral refer manual ulrich furbach view autom reason artifici intellig ilkka research project disjunct logic program
IR/1369 5 effici learn data queri hiroshi arikawa dept japan japan scienc technolog japan abstract paper studi learnabl class order gap tree pattern order gap forest semant queri learn model angluin class model queri gener class tree pattern languag class regular pattern languag present polynomi time learn algorithm subclass repeat tree queri membership queri extend present polynomi time learn algorithm class forest repeat variabl tree repeat variabl queri subset queri give hard result membership queri learn introduct huge amount electron data web form html xml data decad heterogen collect electron data call data model order tree network remark attent data mine inform extract method extract inform simpl pattern data small number formal studi complex learn pattern data introduc class order gap tree pattern semant formal model recent emerg queri languag data studi learnabl exact learn model angluin label order tree tree gap arbitrari tree path substitut tree gap match pattern tree data tree fig show exampl constant tree refer fig order tree order gap tree dot line pattern tree repeat tree variabl class gener class order tree pattern semant tadep class regular pattern languag introduc order gap forest semant set semant defin union tree pattern languag start analyz complex membership problem show membership problem polynomi time solvabl show membership problem repeat variabl main show class subclass repeat polynomi time learnabl membership queri finit alphabet algorithm run polynomi time queri membership size initi counterexampl algorithm requir assumpt infinit alphabet give hard result membership queri learn extend previou algorithm present polynomi time learn algorithm class order gap forest repeat variabl subset queri infinit cardin target forest develop proper gener oper show full class order gap tree pattern repeat variabl polynomi time learnabl queri subset queri partit techniqu tadep result gener polynomi time learnabl al matsumoto semant origin introduc learn unord tree captur essenc pattern match data queri languag number research learn pattern base semant learn pattern work attempt analyz complex learn order tree pattern provid theoret base inform extract web xml possibl limit task paper organ section review basic definit section present polynomi time learn algorithm eq mq section show eq mq elimin effici learn super class section present polynomi time learn algorithm eq sq section extend algorithm section section full class repeat variabl section conclud preliminari order tree pattern defin class ot order tree class order gap tree pattern gener ot set denot cardin set label order tree node label acycl graph properti set node set edg edg parent children node special node parent call root node root parent node label label function node children order left number consecut number function node leaf intern node node chain node child order tree notat denot compon order tree node denot uniqu root defin size denot number node write syntact ident structur label defin class order pattern finit alphabet constant symbol countabl alphabet tree variabl order tree pattern order tree intern node label constant symbol leaf label constant symbol tree variabl order tree pattern denot set tree variabl node constant node variabl node order tree pattern constant tree variabl denot set constant tree introduc match semant ot al definit ot map oe satisfi condit map oe root map root map oe preserv constant label constant node map map oe map variabl node label node vn map oe preserv order children constant node children map node exist child map child variant definit condit common tree pattern match match semant match semant term ot restrict rank tree defin number children condit definit al ot denot exist oe defin class order gap tree pattern countabl alphabet gap variabl mutual disjoint definit order gap tree pattern order tree defin intern node label constant symbol gap variabl leaf label constant symbol tree variabl intern node label gap variabl chain node child constraint intuit mean gap variabl essenti edg label match path tree repeat occurr gap variabl node gap node constant variabl node defin similarli ot denot set tree gap variabl resp term notat fig written give definit note definit appli gap condit definit appli constant node definit gap map oe satisfi condit addit condit definit ot map oe preserv relat gap node gap node map uniqu child map proper descend definit gap denot exist gap oe fig gap constant dot line match gap conserv extens distinguish gap ff ong underli match semant ff gener instanc ff ff hold defin ff ff defin ff proper gener proper instanc definit languag underli semant ff ong defin set constant order tree ff ff consist instanc semant ff note constant tree infinit set singleton set lemma constant tree properti hold relat reflex transit ident modulo renam variabl jsj jtj jsj linear repeat occurr variabl call linear note linear gap variabl definit denot ot class linear linear resp class constant order tree semant write clear context assum class ot bottom tree defin problem class determin hold lemma problem polynomi time solvabl proof give sketch algorithm remov gap node pattern set small constant tree mark point tree total time techniqu similar jsj jtj dynam program detect match point time proof ut theorem problem ot npcomplet proof easi problem belong np give reduct sat problem problem ot cm instanc set boolean variabl fv vn alphabet fx defin instanc tm pm defin pair xn correspond assign defin index denot bit make liter true resp defin instanc hard sat match oe match node label node label complet proof ut learn model learn exact learn model angluin learn algorithm access inform target concept queri target hypothesi queri tree pattern denot answer counterexampl return counterexampl posit neg subset queri denot tree pattern receiv answer membership queri denot constant tree receiv answer goal exact learn algorithm exact identif target hypothesi make membership queri halt output hypothesi stage run time bound polynomi size longest counterexampl return queri mq eq polynomi time decid semant lemma exact learnabl eq impli learnabl model predict learn model mq full class semant theorem eq linear time decid lemma learn algorithm belong target class learn linear order gap tree pattern present effici algorithm learn membership queri definit oe node excess node wrt oe node map node map node wrt oe lemma oe jsj jtj exist excess node wrt oe proof oe excess node wrt oe jsj jtj hold contradict ut introduc oper reduc size node leaf remov oper remov leaf incid edg chain node contract oper remov replac pair incid edg edg denot tree obtain appli oper node ff replac ff oper replac label ff denot result tree lemma exist leaf chain node excess node wrt oe constant tree defin satisfi leaf obtain remov chain node obtain contract proof oe tree obtain remov contract show oe map oe satisfi condit definit condit definit excess condit satisfi condit satisfi case remov chang order sibl condit case chain path gap node child contract proper descend satisfi condit definit ut pair isomorph pair node posit number preorder number search algorithm oracl eq mq target return counterexampl return eq posit step properli reduc size leaf chain node constant tree obtain remov resp step properli reduc number constant leaf constant label tree variabl chain node constant label gap variabl defin return fig learn algorithm semant queri membership queri lemma instanc size isomorph node pair distinct constant tree variabl leaf gap variabl gap node proof oe differ jsj jtj oe oe isomorph condit definit node constant node variabl node gap node depend leaf chain node ut theorem algorithm fig learn linear order gap tree pattern semant polynomi time eq size initi counterexampl eq hold finit infinit alphabet proof algorithm output algorithm receiv posit counterexampl size termin algorithm easili size number jtj constant execut time enter step execut jtj jt jt lemma exist excess wrt oe leaf chain node intern node children follow edg repeat process eventu reach leaf chain excess node lemma show step execut repeat jt hold algorithm enter jt node constant tree variabl gap variabl lemma algorithm execut step correctli comput updat pattern hold step execut algorithm reach theorem prove ut corollari class semant polynomi time learnabl exact learn model posit mq necess membership queri show membership queri insuffici learn show predict preserv hard dnf formula hard result independ membership queri polynomi time insuffici exact learn queri random exampl assum hard dnf formula theorem algorithm learn linear order gap tree pattern membership queri run time worst size target hypothesi proof symbol binari sequenc length constant order tree pattern ot adversari maintain set candid set chain tree defin membership queri set chain tree path adversari return set bound size adversari continu process total size jw queri exce cost queri length time complex algorithm bound ut theorem polynomi time predict class hard polynomi time predict dnf formula proof suffici show predict preserv reduct tm dnf formula set fv boolean variabl constant symbol assign construct instanc map hypothesi map copi copi defin ff ff term ff term ff statement hold iff satisfi term match easili satisfi assum difficult show copi satisfi formula combin satisfi iff theorem ut extens linear order gap forest show polynomi time learn algorithm subset queri order gap forest finit set ft order gap tree pattern order gap forest linear member linear denot class forest ot rank alphabet call union tree pattern definit order gap forest defin languag union languag defin member properti call compact plai import role learn union languag lemma infinit alphabet order gap forest exist algorithm oracl eq sq target return counterexampl return eq set posit fl set fl refin oper defin definit return fig learn algorithm semant queri subset queri proof constant tree obtain substitut mutual distinct constant tree gap variabl exist substitut symbol invert substitut ut intuit idea learn algorithm identifi member target forest subroutin learn algorithm mq sq learn properti shown lemma essenti develop algorithm gener oper binari relat fl fl impli fl defin fl denot fl transit closur fl fl call effici polynomi bound jsj element print polynomi time fl call proper fl impli complet impli fl give gener oper definit fl hold obtain appli oper leaf tree obtain remov gap node tree obtain contract parent child leaf node constant label tree variabl chain node constant label gap variabl definit oper fl effici proper gener oper proof fl proper fl construct fl assum hold lemma ident modulo renam construct fl fl proper fl polynomi time comput jsj ut lemma gener oper fl complet proof suffici show sequenc fl hold claim trivial hold assum oe oper applic obtain case jsj lemma excess node wrt oe leaf node chain node gap appli oper case jsj exist constant node label chang tree gap node obtain fl ut fig present modifi algorithm learn eq sq correct prepar notat lemma target initi posit instanc return gener execut loop fl proper lemma crucial main result lemma sequenc gener algorithm form properli sequenc defin size complex jtj hold lemma hold full class lemma hold lemma algorithm fig learn linear order gap tree pattern semant polynomi time eq size initi counterexampl eq hold finit infinit alphabet proof similar argument theorem ut fig present main algorithm learn eq subroutin algorithm oracl eq sq target forest order gap forest counterexampl return eq run algorithm fig initi posit counterexampl sq tree pattern return ftg return fig learn algorithm semant queri subset queri theorem infinit alphabet algorithm fig learn semant polynomi time eq maximum size counterexampl eq proof initi algorithm receiv posit instanc induct number show subroutin posit denot current forest main algorithm initi hypothesi maintain subroutin show ensur subroutin correctli simul sq sq contrari lemma mean contradict show claim counterexampl match oe base exist subroutin eventu identifi main algorithm identifi member target forest execut loop main algorithm execut time complet proof ut learn unrestrict order gap tree pattern present modifi algorithm learn repeat variabl polynomi time subset queri base techniqu membership queri lemma result practic includ section indic learn complex tree pattern gener procedur simultan chang ident variabl distinct begin ss tree ss creat node label copi attach parent adjac sibl ss execut jsj ss remov root remov variabl node ss return properli gener end return chang fig partit algorithm subset queri requir simultan replac learn repeat variabl fl gener oper introduc section lemma condit exist fl exist defin set node fv label ident obtain replac node label copi variabl proof definit definit complet gener oper fl lemma ut overcom tadep develop eleg partit techniqu gener repeat variabl unord tree forest denot set occurr node root tree obtain remov root node fig show version modifi explain algorithm partit fig instanc assum fl appli applic constant tree algorithm pattern tree instanc tree delet initi state delet delet excess node fig comput partit algorithm insert copi variabl occurr constant algorithm delet leaf leaf sq step match split variabl group shown variabl result node split lemma target fl algorithm partit fig comput partit run polynomi time sq jtj theorem exist algorithm learn unrestrict order gap tree pattern semant polynomi time eq size initi counterexampl eq hold finit infinit alphabet proof modifi fig learn eq sq outlin modifi fl refin oper defin definit return counterexampl return eq set fl set return answer set return lemma fl proper complet gener oper lemma lemma lemma show similar properti lemma size complex valid repeat variabl lemma show termin execut execut requir sq lemma algorithm termin complet proof ut present effici algorithm learn class membership class class unrestrict subset queri semant show hard result type queri effici learn connect learnabl pattern languag logic futur problem refer lorel queri languag semistructur intl digit exact learn unord tree pattern proc acm exact learn tree pattern queri proc acm find pattern common set jcss queri concept machin gener gener machin learn union tree pattern theoret comput find minim gener union pattern languag applic induct infer posit proc lnc queri languag algebra semistructur data base structur vldb classic machin learn horn mach learn string pattern tree pattern proc internat confer machin effici tree pattern proc wrapper effici artifici matsumoto learn pattern languag proc euro learn pattern languag proc lnai note induct machin edinburgh univ extract partial structur html proc flair aaai extens markup languag version recommend queri languag xml aug comput system sci
Agents/1370 1 structur middlewar environ agent guido van franc mt andrew tanenbaum mathemat comput vrije universiteit amsterdam abstract develop process intend roam heterogen distribut system environ issu emerg paradigm provid structur environ mobil agent migrat import design guidelin develop introduct system aim support distribut mobil agent applic mobil agent number advantag tradit distribut system agent move comput resourc data allevi problem due latenc bandwidth limit advantag relat reliabl number solut agent system focu properti mobil agent exist solut offer welldefin paradigm framework applic design produc environ ma clear paradigm design applic middlewar system design provid locat distribut offer secur agent host system support heterogen agent design work platform worldwid distribut system paradigm applic model world consist hyperlink room room hyperlink room agent activ entiti object strictli passiv entiti agent commun agent interact object current room world entri agent enter world agent hyperlink room world room global servic agent world agent move exampl typic applic librari room book specif complet room form maze agent roam achiev shop world shop world consist separ occupi separ access entranc object repres item agent roam world find possibl bui item agent commun speed search notifi interest bargain middlewar world adapt specif applic middlewar distribut host room design respect number object world middlewar locat distribut transpar logic entiti world repres room object globe object architectur make distribut room object multipl host provid reliabl local data system middlewar extend function provid os world descript languag specifi basic includ constraint hyperlink layout reliabl commun basi world middlewar world deploi administr domain zone host room host room agent administr domain zone host host room room figur agent migrat constraint close world constraint constraint agent enter agent hyperlink agent agent interact object import constraint agent access object room inform carri agent subject constraint middlewar awar logic secur constraint world enforc administr domain repres group call zone room deploi zone zone multipl room access zone agent enter move host zone figur show agent follow hyperlink room result agent move host room access protect host administr place zone zone entranc defin agent enter zone room zone accept agent made base knowledg owner languag agent possess certif credenti protect host potenti malici middlewar start agent secur execut environ environ java sandbox java agent physic data store agent unit agent physic move host host move room code true class object receiv host determin form accept execut agent mechan protect agent attack host middlewar mechan make trace alter ac discuss paper gave overview basic function offer design distribut applic intuit natur base paradigm hyperlink room numer aspect relat scalabl control secur polici defin protect administr domain room object system constraint hyperlink make control logic topolog world configur middlewar world design languag make adapt middlewar specif applic author guido phd student comput system group depart scienc vrije universiteit franc brazier full professor intellig interact distribut system andrew tanenbaum full professor comput system group iid support acknowledg wijngaard contribut model paper refer chess grosof harrison levin agent mobil ieee person page octob rs ru secur system mobil agent page lnc wijngaard bj van steen fmt brazier support multiag system data knowledg tanenbaum van distribut system ieee karnik tripathi secur mobil agent system softwar practic
Agents/1371 1 act move healthcar paradigm collabor della mea institut ple della address della mea institut ple della itali ieee transact inform technolog agent act move healthcar paradigm collabor abstract present paper describ approach analysi develop telemedicin base paradigm agent reactiv proactiv mobil telemedicin ground commun share agent suitabl analysi adopt develop prototyp agent introduct telemedicin practic medicin mean telemat tool definit includ wide varieti rang distant teach applic distribut task involv share healthcar paradigm face inform technolog softwar program reactiv proactiv mobil agent design fulfil oper collabor agent behaviour system result complex interact agent telemedicin system singl workstat eventu commun interact aim support collabor resourc share medic field adopt point set telemedicin facil embrac analysi implement true mobil telemedicin introduc complex dynam aim paper introduc describ prototyp telemedicin applic base paradigm main concept defin agent intent develop dennett identifi entiti behaviour predict attribut desir ration agent theori adopt anthropomorph attitud abstract describ artifici agent behaviour wide definit properti commonli agent control maintain intern agent interact mean agent commun languag agent act consequ agent act pursu design show opportunist behaviour develop properti correspond specif primit develop paradigm compar distribut object involv entiti intern interfac base messag similar abstract modular differ make agent autonomi mean maintain complet control remot method invoc level control agent occur request method invoc main agent commun languag independ applic report agent provid metaphor describ artifici open dynam chang base heterogen disappear chang complex agent paradigm abstract system distribut control solut design legaci solut enabl softwar initi devot paradigm kse share mean knowledg includ knowledg languag knowledg interchang commun languag knowledg queri manipul great interest develop consortium aim deliv set standard recommend develop applic foundat intellig physic kse approach fipa repres relev approach initi includ masif object manag group target applic develop belong area electron industri process air traffic healthcar mobil agent add properti gener migrat system oper target machin reason distribut comput load reduc commun reduc server load extend dynam function commun protocol topic regard crucial develop mobil commun system includ deriv recent wireless commun great interest mobil telemedicin medic applic telemedicin telemedicin artifici system suitabl complex system heterogen manag distribut data integr legaci system inform mobil telemedicin system consid crucial base continu disappear distribut featur applic develop medic field import guardian system devot patient monitor surgic intens care unit support provid collabor expert specif domain commit share data knowledg continu monitor patient control al present system devot diabet cooper medic field support agenc languag adopt commun huang al present system collabor gener specialist patient healthcar experi framework telemedicin servic internet agent agent provid servic agent section describ approach telemedicin base fipa chosen emerg initi aim industri standard applic medic applic consid futur field lead framework interest telemedicin medic assist scenario scenario order identifi relev issu telemedicin tool integr exist system scenario medic specialist deal routin consult distant expert difficult case imagin specialist routin examin patient report agenda data patient electron patient case opinion diagnosi expert give servic happen specialist give opinion case relev mean abstract clinic record imag skin share refer consult specialist share occur synchron tool similar usual mail appoint date time parti opinion diagnosi insert electron patient record topic adequ solut interfac legaci inform system hospit laboratori establish appoint specialist matter negoti collabor effort user agent process discuss case time strictli relat capabl commun complex multimedia data protocol specialist user made awar kind servic provid seamless agent commun figur show sketch agent deal issu present main compon medic assist agent specialist medic gener agenda manag method access patient record support telemedicin softwar featur remot exchang patient annot case negoti appoint appoint enter directli obtain remot negoti agent assist appoint convent data relat patient retriev inform wrap present specialist time date appoint request specialist field chosen specialist broker agenc appoint negoti final patient data imag microscop remot specialist order readi mobil agent ontolog manag procedur knowledg graphic agent individu data temporarili pass part agent remot consult data imag studi remot collabor interfac cursor share text annot data result collabor work insert automat patient record connect hospit inform system toma instanc specialist insid hospit consid sake belong hospit agenc fipa reachabl hospit commun act broker intern capabl capabl user agent access servic provid access bibliograph inform obtain medlin wrapper connect internet retriev bibliograph refer commun agent develop java exist stationari mobil agent resourc version basic featur implement fipa recommend develop person assist preliminari result prototyp test institut patholog depart itali aim system support collabor diagnosi principl studi field static main activ exchang microscop imag patient data sampl test regard technic function evalu carri insid newli launch italian network educ qualiti control preliminari prototyp develop explor wai collabor occur agent agent design softwar direct correspond individu user system set medic assist agent directli relat agent provid specif agent provid singl access point entir agent commun common servic extens process registr agent insid hospit agenc main technic pitfal hospit commun requir agent insid fipa act bottleneck exchang extern agent carri kind problem occur local area network isol proxi gener overhead due agent messag gener languag great flexibl requir greater resourc work real behaviour societi agent exchang multimedia involv telemedicin task secur featur consid fipa adopt order practic system discuss paradigm similar evolut situat higher abstract integr featur agent aim distribut task solv softwar compon patient manag experi applic agent inher distribut natur occur telemedicin agent panacea problem secur crucial mobil agent problem result control approach involv inform secur present main research line agent fipa specif kqml provid secur privaci test health care involv healthcar role patient meet gener specialist administr access specif patient grade group continu contact inform exchang support agent exploit result relat research electron patient record medic terminolog standard fipa recommend exploit ongo industri effort adopt paradigm involv analysi medic order identifi actor relationship put forward explicit commun act refer dc intent mit softwar commun acm agent technolog darpa knowledg share progress proc knowledg fipa foundat intellig physic omg mobil agent system proc int workshop mobil lectur note comput impact mobil agent technolog mobil commun system ieee person commun softwar architectur class intellig patient monitor journal theoret artifici cooper softwar agent patient lectur note artifici approach healthcar intern journal appli artifici internet agent telemedicin medic toma toma medic assist toma toma medic assist medic assist medic assist hospit commun broker medlin wrapper www access medlin toma figur sketch agent commun collabor hospit agenc specialist broker agenc
AI/1372 2 parametr altern grid world model william depart comput canada introduct rang data approach commonli calcul evid point space base data provid rang sensor approach build occup function map point world real interv higher function point occupi approach credit simplic repres maintain world model area autonom robot prefer approach major drawback requir store process huge amount data convent occup function oper updat moravec requir updat million voxel rai view order build model meter room major prevent approach build larg scale world world model acknowledg world model provid inform map direct lot attent problem redund data occup model suggest circumv problem ineffici robot navig plan map topolog map gratefulli acknowledg support research establish nserc occup model desir optim effici navig paper explor possibl parametr occup function treat build occup function regress problem occup function shown suit visual sensor model valid approach demonstr appli problem world explor autonom robot special design vision system mount mobil robot call outlin approach outlin approach formul rang data fusion regress problem set sampl point evid valu occ find approxim function occ input domain adapt logic network regress tool techniqu fit sampl data linear function result fit produc binari tree minimum maximum linear function polyhedra space approach suscept extra care rid outlier imag process stage incorpor sensor model appli approach fuse rang data regist stereo sensor model stereo make knowledg util properti occup occ point rai view monoton distanc center robot reach highest observ point figur sensor model effici repres linear piec order achiev gener sampl point regist illustr figur chang coordin system import step contribut success approach replac cartesian system coordin coordin system system pan angl ff height distanc rai view figur suitabl sensor model environ horizont floor coordin system monoton constraint occup function function facilit fuse occup function make map extract effici appli robot navig robot acquir depth sampl data build occup function repres world term conjunct disjunct linear piec coordin system occup function repres local occup model surround environ robot decid navig paper present data obtain actual run robot occ rai view occ figur visual sensor model system coordin observ point sampl point gener sensor model refer mc hp moravec robot evid grid carnegi mellon robot institut technic report thrun learn map indoor mobil robot ai pp han moravec robot spatial percept stereoscop vision evid grid carnegi mellon robot institut technic report cm probabilist model dynam environ proc ieee int conf robot pp ww adapt logic handbook neural section iop publish oxford isbn singl camera mobil robot approach rang data world navig submit singl camera stereo mobil robot world submit
IR/1373 5 cambridg spoken document retriev system se gl sp pc engin cambridg uk comput uk abstract paper describ spoken document retriev system develop assess perform automat transcript hour broadcast data recognit engin base htk broadcast transcript system retriev engin base techniqu develop citi retriev perform wide rang speech transcript error rate present number recognit error metric accur reflect impact transcript error retriev accuraci defin comput result demonstr import high accuraci automat transcript final system evalu spoken document retriev task introduct widespread inform retriev techniqu access inform store electron text wide exampl internet search engin inform initi creat text spoken area audio radio broadcast audio sourc transcrib automat inform index relev portion broadcast retriev convent ir techniqu recent interest spoken document retriev task intern evalu spoken document retriev techniqu place part retriev involv simpl paradigm advanc singl document relev queri sdr track gener difficult queri type investig evalu standard ir measur recal paper describ experi develop sdr system evalu part automat transcrib test data transcript system evalu ir perform set queri relev assess develop interest relationship transcript accuraci retriev perform investig relationship transcript baselin ibm suppli sheffield set automat transcript provid wide rang word error rate paper firstli overview htk broadcast transcript system gener high qualiti automat transcript give overview inform retriev problem approach adopt number transcript error metric introduc relationship present final describ improv system develop evalu requir transcript nomin hour broadcast audio overview htk broadcast transcript system input data present htk transcript system complet episod broadcast show convert set segment process segment gaussian mixtur model divid audio narrow audio discard part audio stream speech pure output phone determin final segment intend acoust homogen frame input speech transcrib repres featur vector consist cepstral paramet differenti cepstral appli segment system wsj pronunci dictionari augment pronunci tt system hand gener correct context depend tree state cluster mixtur gaussian hmm word vocabulari full htk system oper multipl pass incorpor maximum likelihood linear regress base adapt complex languag model lattic hmm system gave word error rate darpa broadcast evalu experi test data hmm train nomin hour broadcast audio languag model train million word broadcast newswir transcript acoust train data version htk system experi sdr test data essenti pass system run time real time sun system gender independ bandwidth hmm trigram languag model system gave word error rate hour sdr test data htk system gender independ hmm faster pass output pass segment cluster algorithm group segment show perform adapt recognit pass bigram languag model gener word lattic adapt gender bandwidth specif hmm bigram lattic expand languag model pass lattic final output system gave word error rate test data ran time real time similar system full train gave word error rate evalu test data altern automat transcript assess effect error rate retriev perform nist suppli baselin transcript word error rate transcript obtain sheffield wer inform retriev system background inform retriev system user gener request queri inform obtain form command inform el question inform retriev engin present user rank list ideal relev queri topic user obtain answer seek order score match document method linguist inform document queri found match inform document encapsul offer start point document word thought remov document process call stop stopword includ function suffix word remov stem algorithm extract part word convert linguist method convei inform treat equal final index file creat number time word occur document number document word occur act input main retriev engin success ir system measur term proport return document recal proport relev document high mean irrelev document present user high recal mean system found relev document difficult task directli answer question pose queri consid lie field inform retriev ir system detail system stop word list perform stem porter stem algorithm porter algorithm suffer problem map equat overcom defici stemmer except list map stem directli stem except list incorpor map stage spell commonli word phrase make synonym stage document repres unord list word effect process number word stage ir system automat gener transcript shown tabl origin ibm baselin sheffield includ deal abbrevi tabl number word sdr stage process whilst simplest gener match score document queri count number share stem crude modern system term weight exploit inform document number document queri number time term occur system gener combin document match queri term system develop citi log number document length document averag dl tune constant manual tabl averag queri stop list map file develop ir system broadcast task improv stop list map file list task show effect tabl averag system manual transcript test data queri list map file improv averag measur transcript error metric ir speech recognit accuraci express term word error rate calcul align refer transcript made number insert delet substitut error found word refer word error wer reason error measur pure transcript task ir system manipul transcript stem ignor word wer error measur ir system wer ibm baselin sheffield tabl word error rate data stop align word error rate align word error figur correl word error rate map stem wer map stem tabl relationship wer shown figur result show stop stem document reduc wer whilst tabl number word document collect reduc interest note wer offer good predictor stop stem wer investig altern wai measur effect number error main retriev system compar tradit wer account effect stop stem lack import word order convent substitut error regard error miss occurr add spuriou defin error rate metric call term error rate independ word order ter repres number time word occur refer transcript model tradit substitut error error ter ibm baselin sheffield tabl term error rate data comput stori ter stop stem document set tabl case predict transcript align quasi term error stop term error term error term error word error term error align word error rate tradit align word error figur relat wer ter result tabl separ influenc count substitut ignor word order relationship ter wer shown figur interest note larg differ suggest error occur align cancel stop document term error shown word error rate thought major cancel error occur stop cancel effect reduc ter stem reduc wer ter sdr system result result ir engin ibm baselin sheffield manual refer shown figur graph averag align word error rate term error rate figur manual sheffield ibm baselin interpol recal averag recal figur graph vari wer align wer ter effect averag word error rate figur effect word error rate averag ir perform align wer ter interest note wer retriev perform start fall rapidli low recal level number document return user similar manual transcript version htk output graph show averag affect recognit error high accuraci transcript requir averag close manual transcript sdr system sdr task hour broadcast transcrib full train set hmm estim set htk hmm recognit setup languag model estim extend set broadcast transcript newspap text cover epoch test data vocabulari tune estim acoust train languag model train data reduc word error rate absolut baselin manual tabl improv averag ad refin ir engin weight queri term part proper noun common adject verb occurr stop queri defin addit score ad document word pair correct order meant term posit inform index file thirdli ad small amount statist queri term final tune constant system result averag show perform advantag queri data tabl complet system spoken document retriev effect transcript accuraci retriev perform evalu set term error rate defin feel relev measur transcript accuraci sdr futur work includ altern recognit encod word lattic ir speed transcript engin retain high accuraci larger data set transcrib acknowledg steve renal access sheffield sdr transcript work part support epsrc grant document refer refer cook robinson spoken document retriev system nist special public proc pp stanford sparck jone spoken document retriev track overview result nist special public proc pp porter algorithm suffix strip program pp robertson sparck jone proven approach text retriev technic report cambridg comput whittak young htk broadcast transcript system proc darpa broadcast transcript understand pp feb
DB/1374 3 implement perform analysi increment equat nest relat liu vincent mohania school comput inform scienc south australia australia abstract view materi import improv perform queri process updat occur sourc data materi view materi view updat consist sourc data updat process call view mainten increment method view comput view view updat sourc wide prefer full view recomput updat small size small updat size import concept measur cheap perform increment method investig limit small updat call size limit increment mainten size updat exce increment mainten longer cheaper view recomput investig base increment equat oper nest relat model review oper increment equat nest relat implement nest relat increment equat informix server cost model perform analysi equat analyz factor ect increment mainten nalli studi mainten limit oper combin oper introduct materi view deriv data store improv queri process time improv access data import data wareh technolog content typic consid set materi view materi view updat sourc data view deriv chang process call view mainten main approach view mainten rst recomput materi view scratch updat sourc data approach maintain materi view increment increment updat materi view comput current materi view possibl sourc data view de ned relat model set insert set tupl increment techniqu calcul chang comput equal exist equat support increment mainten view content increment mainten view recomput equat type call increment equat increment approach gener consid size updat small relat size sourc data analysi small determin limit increment mainten cheaper full recomput topic investig main focu paper investig limit increment comput cheaper recomput call limit mainten limit framework investig mainten limit develop nest relat model reason nest relat model import gener relat model import subset model predict relat model industri standard relat subset nest result appli relat approach determin mainten limit nest relat model nest relat nest relat implement informix server enabl implement nest type referenc nest emploi implement creation nest oper nest relat implement function view creat relat increment equat implement view server cost model develop analyz perform increment equat ect nest type oper increment mainten studi mainten limit increment equat obtain rest paper organ section review oper increment equat nest relat introduc schema implement section describ techniqu emploi implement cost model perform analysi perform common exist increment analyz section mainten limit oper produc section section conclud comment increment equat nest relat introduc notat paper review oper increment equat nest relat develop outlin implement experi notat denot set atom attribut atom attribut domain denot nest relat schema de ned set attribut mr call atom attribut nest relat schema call structur attribut denot atom attribut structur attribut de ne root set atom attribut structur attribut de ned outer schema structur attribut outer schema structur attribut properti de ne level arbitrari structur attribut ar number outer schema surround ar rst level structur attribut introduc nest relat schema stud subj mark addr schema design model inform address addr subject identi ed mark obtain test subject set atom attribut stud root stud set structur attribut stud addr mark structur attribut level addr domain schema power set nest relat set element tupl denot call de ne rg de ne oper project join prime set atom attribut set atom attribut structur attribut de nition schema schema denot exist structur attribut ar level ar ar ar ar de ne oper nest unnest mean nest de nition schema denot subset subset show continu stud structur attribut subj stud addr stud addr de ne tupl discuss relationship tupl relat de nition relat de ned nest relat scheme exist de ned tupl rest assum nest relat partit normal form kei relat properti appli assum null includ kei tupl relat abbrevi discuss oper nest relat review oper nest relat reader refer de nition oper highlight basic mean notat denot expand relat schema relat schema ad empti set valu structur attribut miss union denot combin relat schema return relat tupl relat directli result chang pair tupl combin tupl combin tupl origin tupl valu structur attribut combin tupl union pair tupl di erenc intersect denot function similar union di erenc intersect relat select denot select tupl relat select condit return relat select tupl project denot project relat schema join denot join relat schema relat schema multipl level schema nest denot nest relat schema restructur structur attribut unnest denot unnest relat structur attribut increment equat recal increment equat deriv oper previou section schema relat intersect schema relat select schema instanc project schema relat equat hold join schema relat schema equat hold nest relat schema aa equat valid aa unnest relat schema aa equat valid aa equat possess similar properti side increment equat recomput view deriv relat updat updat righthand side repres increment mainten view updat side item rst item delet view tupl delet tupl deriv tupl item remain part tupl select overlap tupl union di erenc produc temporari relat oper de ning view appli temporari relat view updat produc implement emploi implement ve relat schema relat figur schema stud omit attribut id schema teach describ lectur subject year lect schema model inform lectur test schema describ test detail subject year hobbi describ hobbi student subj addr year mark addr mark schema stud relat stud year schema teach relat teach salari special schema lect relat lc year descript schema test relat test hobbi hobbi schema hobbi relat hobbi tabl schema implement describ implement implement cost perform analysi implement platform queri languag implement perform pentium pc comput hard mb microsoft window nt oper system manag system informix server data oper version client interfac program connect server connect option window nt platform queri languag implement sql actual access program reason sql dialect familiar format form part sql relev implement function queri call complex object informix term set atom nest relat sql function access complex object basic achiev deriv tabl deriv complex object construct deriv tabl real tabl give show rel featur sql queri join tabl stud hobbi select hobbi student subject select stud hobbi exist appli deriv tabl deriv object queri row object deriv tabl implement detail describ implement detail experi version informix server insuci directli support implement increment equat section insuci shown aspect improp work limit deriv tabl limit support nest describ aspect rst de cienci server test oper system work properli oper connect broken overcom simpli creat function test problem server deriv tabl program mean write program simul sql queri queri tabl complex object consid program languag found call ned function server leak memori perform number call chose program languag queri simul limit server fulli support nest stud tabl informix server support nest limit extent schema nest de ned system tabl schema popul properli sql insert statement level nest problem problem tupl nest select insert null program insert row null insert relat stud row object subj mark insert set subj mark object null limit make directli implement tabl stud measur make implement measur split stud relat tabl sd sj tabl tabl link common attribut valu id subj relat sd refer id valu relat sj relationship subject student subj addr id addr schema relat sd id year mark mark schema relat sj tabl actual schema relat stud split schema exist type nest implement type nest insid mark insid tupl sj call type nest nest type nest nest store relat refer set nest subj sd sj call referenc nest readi creat creat shown figur popul program cardin tabl shown tabl cost model cost model perform analysi involv cost view increment recomput cost ect time comput item increment equat subsect increment equat join oper delet updat show relationship creat tabl sd subj addr primari kei creat tabl sj year mark mark primari kei creat tabl teach year lect primari kei creat tabl test year test type descript primari kei creat tabl lect salari special primari kei creat tabl sd detail hobbi primari figur creation schema cost item equat del detail cost cre time creat materi view rec time recomput view updat deriv relat view time increment maintain view side increment equat updat deriv relat view time consist compon del time delet view tupl deriv tupl time insert tupl view updat view tupl view updat view select oper insert fact set oper tabl cardin cardin set attribut sd sj teach lc sd detail cardin relat tabl cardin time select tupl relat label time conduct union di erenc tupl denot time comput view updat oper de ne view de ning total mainten time del cost del oper speci cost typic perform analysi diagram shown figur horizont axi di erent updat size vertic axi rel time view creation line diagram rel time view rec cre line denot rec downward corner updat delet updat size reach origin vertic ax line label rel time increment cre corner size insert updat updat tupl line close line rel time updat rel time bigger lead intersect line rec locat vertic axi horizont axi horizont coordin intersect point mainten limit line gure worst case tupl tupl produc tupl view updat insert view intersect rec intersect rec minimum maximum boundari increment mainten actual mainten depend updat type fall boundari figur perform analysi select level updat type perform case delet updat cost maintain view insert updat cheaper delet perform worst case obviou reason insert rec line upward downward shown figur delet size tabl bigger insert figur show perform diagram insert updat select oper oper studi perform increment equat oper unnest individu figur perform analysi insert updat complex queri consist oper leav analysi increment equat project oper studi equat oper perform obtain comparison oper similar de nition structur oper intersect oper join oper similar join relat join top level similar de nition structur fact oper amount operand match kei valu pair tupl tupl oper similar lead similar process time oper estim perform equat intersect oper de nition project oper similar studi equat select oper perform common oper test perform common oper oper includ delet tupl select tupl di erenc updat select insert view updat materi view time cost oper del equat test del cost del test schema begin select number tupl relat put test simul queri select temp temp queri select tupl put temporari relat mean valu tupl found valu del evalu delet queri delet delet tupl test insert tabl show test result cost data tabl averag repeat experi part tabl cost nest relat stud sd sj figur cardin tupl part nest relat sj cardin tupl part rst column show size rst row cost valu intersect rst column rst row averag process time thousand size del stud size del sd tabl del tabl make observ data larger data mean number nest level cost larger del del hold magnitud grade di erenc obviou cost slightli cardin larger cost random slight relat memori swap server process size number nest cursor virtual memori server expand quickli system physic memori swap virtual memori obviou test di erenc conduct put tupl delet tupl di erenc oper design test case nest atom set sd figur nest referenc nest nest rst level referenc nest level inlin nest refer implement sd sj nal nest case tabl sj result test tabl case shown top row tabl rst column tabl size valu tabl minut thousand size level level level tabl tabl draw vertic number slightli cardin explain swap virtual memori number nest level cost signi cantli cost level smallest rst oper relat oper di erenc case singl sql queri process server side data transport server client level cost doubl nest involv tupl top level intern queri client server tupl conduct di erenc level referenc nest di erenc level server data transport small cost di erenc level level small compar level level level larg time number intern queri client server nest cursor data transport server client nest server client process back server level cost higher level referenc nest data commun cost transport nest server client nest compar data tabl cost larger sum del number nest level larger main uenc total mainten time mainten limit oper analyz cost total mainten cost di erent updat size oper base determin mainten limit oper select oper studi mainten limit select simul queri list tupl tabl stud student good mark subject queri select stud exist exist note stud queri logic relat physic repres join sd sj attribut subj id reason logic form simplifi present select condit mark queri set level relat stud select perform analysi diagram figur mainten limit analyz mainten limit case select condit rst level level mainten limit select condit level list tabl condit level tabl mainten limit select data tabl show mainten limit number nest level level number determin mainten limit understand main reason mainten limit rememb cost found mainten limit chang trend ratio oper time increment list updat size row tabl select condit rst select server side time small larg select condit larger larger mainten limit drop level join oper queri studi mainten limit join oper jn jn select stud exist test exist tabl joint queri level level simul join oper rst level tree present join level figur mainten limit case tabl addr sd teach addr sd addr sd test figur join di erent level condit level tabl mainten limit join data tabl similar tabl omit explan compar tabl trend mainten absolut quantiti relationship mainten limit ect del introduc situat join tabl updat figur show cost updat size figur perform join tabl updat gure join sink deeper leav join size chang tabl call lower root join tabl ect time evalu queri time access higher tabl larger time access lower tabl increment comput view updat updat lower tabl cheap unnest nest oper complex queri mainten limit unnest nest oper tabl oper unnest nest complex queri tabl mainten limit complex queri analyz mainten limit studi mainten limit complex queri queri select stud exist test exist tabl mainten limit queri tabl number mainten limit complex queri queri singl oper implement increment equat nest relat informix server review oper increment equat nest oper creat nest informix server nest relat enabl implement nest type referenc nest nest studi ect nest type perform implement oper function oper relat view creat increment equat implement perform increment equat analyz perform analysi show union di erenc oper main reason perform increment comput mainten limit increment equat number nest level mainten limit refer serg abiteboul nicol bidoit rst normal form algebra data restructur journal comput system sean wang distribut view mainten increment semijoin tag distribut parallel informix server administr version timothi leonid libkin increment mainten view duplic proc sigmod page ashish gupta mumick maintain view increment proc sigmod gui restructur nest relat partit normal form proc vldb page informix corpor programm version informix corpor informix informix guid version mohania increment evalu nest unnest oper nest relat proc intl symposium cooper system advanc applic page mohania increment mainten nest relat view proc intl engin applic symposium qian wiederhold gio increment recomput activ relat express ieee transact knowledg data martin staudt matthia jark increment mainten extern view proc vldb page stonebrak paul dbmss track great wave morgan kaufmann widom research problem data wareh proc zhuge hector graph structur view increment mainten proc
IR/1375 5 intellig internet document organ retriev meng chang huang abstract present intellig internet inform system machin learn techniqu organ retriev internet web document consist knowledg document classifi search engin knowledg acquisit automat learn classif knowledg classifi internet web document classifi appli classif knowledg classifi newli collect internet web document class class hierarchi experi show perform good human expert knowledg extract document classif base learn classif knowledg class search engin present hierarch navig structur result user convent flat rank result greatli user discov inform diversifi internet document introduct growth internet dramat work live walk internet major sourc inform mean commun excess inform internet creat inform overflow problem allevi internet search engin internet user search engin implement facilit rapid retriev document user term extract store index storag system appli index approach user queri repres sequenc term match index term base tfidf algorithm similar algorithm retriev relev document order distinguish relev document retriev document present rank list consid extract document repres perspect retriev effici inform retriev system effici handl larg document base document collect internet extrem numer queri word submit search engin implement algorithm thousand document retriev queri hit hit hit webcrawl hit yahoo rank larg number document word produc order document meet prefer user user retriev uninterest document obtain desir inform search engin appli relev feedback expand refin queri base document select user queri base select document effect user intent difficult grasp feedback concept gap web document develop user creat differ retriev result user expect due rich languag web develop user term repres term describ thing search engin retriev desir user internet search engin gener retriev thousand document desir desir document retriev term document match term queri search term consid mean thesauru domain solv word mean word thesauru specif domain allevi problem due dynam natur static thesauru handl shift semant term internet search engin retriev relev document present document accord user expect effici search engin shrink document search document physic memori store effect system draw close semant mismatch queri document assign class document essenti effici manag retriev knowledg statist averag queri length word framework structur queri process classifi internet resourc design automat classifi document proper class class hierarchi provid system capabl learn classif knowledg classifi document mine associ rule term explor implicit term semant infer term associ refin classif knowledg class repli user system implement search present hierarch navig base discov classif knowledg class user rest discuss relat work section section section defin terminolog paper order illustr system section describ learn model section show experi automat classif justifi design implement search approach introduc section conclud contribut point futur work relat work past studi inform retriev system search engin focu improv retriev effici index queri reformul techniqu step document process extract word document base stem rule word wide method tfidf appli determin weight word term frequenc number occurr word document document frequenc document defin number document word occur weight word determin product tf idf tfidf method document repres set word call vector weight word similar function document queri document direct product vector weight cosin vector vector space popular index string document index approach popular search engin taiwan applic exact string match languag orient search string comparison index storag requir index approach pattern larger complic data structur time retriev retriev exact match string index approach fit internet inform discoveri queri give conceptu descript exact string index improv perform search prefix proxim rang longest repetit frequent regular express search search function rare internet document search index approach requir larg storag space maintain larger origin document huge document base physic memori byte requir retain good perform page fault oper system dramat degrad perform gener good idea organ index hierarch structur order reduc access time memori requir reduc access time organ hierarchi fit user retriev pattern hierarch index approach intern node hierarchi repres concept class fit internet inform discoveri procedur machin learn system capabl learn classif knowledg train document classif knowledg index combin index system hierarch index structur effici document retriev approach classif includ manual automat classif divid classif knowledg acquisit domain expert automat learn classif knowledg manual assign class document time consum knowledg acquir domain time effort develop support acquir knowledg incomplet classif knowledg automat learn train document effici time accuraci limit emploi learn model text categor studi inform retriev disciplin focu internet html document gener text document classif problem automat document group studi deal problem document relev text cluster similar measur categori rank method determin match categori classif input document past studi machin learn develop algorithm test perform domain popular aq algorithm algorithm appli structur train data textual data motiv approach document classif corpu document develop algorithm learn classif knowledg algorithm includ bayesian independ classifi induct algorithm mix approach inqueri system concentr document categor learn omit semant term document machin featur pair semant semant document featur vari domain document featur mean domain appli techniqu mine associ rule explor semant document featur domain mine associ rule appli discov import associ item transact applic mine item associ discov optim item arrang supermarket custom gather groceri conveni system main goal automat classifi internet resourc discoveri automat collect classifi internet document effici effect manag retriev initi motiv improv timeconsum manual classif process internet search engin emploi classif knowledg learn manual classifi internet system automat classifi incom internet document classif knowledg class hierarchi enabl search document retriev section overview detail system present section knowledg base learn internet document collect manual classifi internet document assign class class hierarchi class internet robot implement automat collect html document system assign uniqu object id document object store object html document set term weight calcul term frequenc weight html tag term weight pair form featur vector repres object knowledg invert index term object implement commerci relat manag system conveni access learn search classif learn process consist train phase test phase train class collect manual classifi document train data learn process start specif class gener class class hierarchi specif class leav class class knowledg gener knowledg object class knowledg gener child class test classifi built incorpor learn class knowledg newli collect document manual classifi expert compar class assign classifi order verifi qualiti learn knowledg classif learn techniqu mine associ rule emploi mine term associ enhanc class knowledg term associ highli depend class mine term associ appli refin classif knowledg specif class show mine term associ effect enhanc term semant experi search engin user retriev interest repres class hierarchi sequenc rank effect effici queri string formul sequenc call queri featur vector similar match base vector space model appli decid relev queri class repres featur vector search perform queri featur vector match qualifi class qualifi class form shrunk view class hierarchi user decid explor qualifi class queri featur vector emploi match subclass class phase match retriev qualifi document class search approach reduc search hierarch conceptu view effect user discov inform document collect queri term associ rule queri refin classif knowledg class lattic queri term class document fig overview fig summar system document collect class lattic origin document document collect assign class class lattic left fig term extract document appli learn knowledg classif obtain mine term associ rule classif knowledg refin refin classif construct automat classifi search search engin submit queri queri match refin classif knowledg discov relev class match retriev interest document notat definit defin terminolog paper introduc conceptu model knowledg denot entiti lower case set seri entiti upper case letter denot class denot set class describ system entiti notat higher level concept lower level concept learn system automat learn refin classif knowledg class set manual classifi object hierarchi call lattic hierarchi satisfi lattic properti lattic set class set relat class repres graph node edg class class node possess knowledg gener subclass object class object html document consist paragraph pg html tag object belong class paragraph pg consist seri sentenc term phrase term pg inform inform html tag defin paper separ charact system identifi boundari sentenc phrase sequenc term sentenc frequent class domain satisfi phrase rule automat construct phrase discov process appli phrase rule find phrase satisfi rule simpl noun phrase rule mean phrase tripl noun doubl noun construct semiautomat process system extract discov candid select user term word stop extract sentenc inform term support object support calcul term frequenc weight html quantifi import object knowledg set select term support object repres term support graph direct edg label number extract term denot classif knowledg class set term term support gener classif knowledg child class similar repres graph direct edg label number term denot class process mine associ rule appli mine associ term mine rule call term associ pair confid conf strongli connect graph term associ graph tag gener term node term associ edg label conf class term semant network construct union tag repres semant class associ term class perfect term support algorithm appli promot edg algorithm find optim path path maxim path product edg confid valu path support conf conf conf optim support defin keyword term pass filter process filter term threshold defin membership grade mg applic pt filter process refin refin classif knowledg knowledg base emploi search engin automat classifi fig view abstract shown systemat knowledg shown fig conceptu model systemat knowledg learn model describ learn model detail train adopt learn techniqu classifi document train object test phase section appli machin learn method learn classif knowledg shown fig learn model appli class lattic specif class gener class document preprocess weight term vector dimens vector reduc featur select process reduc complex learn specif knowledg class gener knowledg object repres term support graph mine associ algorithm appli mine associ term obtain term associ repres term associ graph combin term semant network deriv optim repres class term promot promot promot promot process appli stabl state reach specif learn process initi weight term vector subclass object fig learn model preprocess process knowledg preprocess process consist html parser term parser html parser object paragraph weight determin html tag term parser partit paragraph sentenc extract term sentenc term parser calcul term support weight assign html parser term frequenc html parser html document consist paragraph html tag import inform web develop highlight content html tag hn meta tag develop add extra inform document implic tag consid index document human expert assign weight html tag observ outcom numer experi classifi tag type inform paragraph tag meta knowledg document content present user tag higher weight classif keyword br effect semant document omit uninform content user tag content exclud statist content includ store statist implement html parser stack html tag paragraph execut algorithm complet file scan term parser term parser partit paragraph extract term count term frequenc term design handl consid english languag extract term stem sentenc segment term appar stop term parser term base term extract term term extract object support measur base tf html defin equat normal rang import term repres object normal tag weigh maximum sentenc frequenc term tag sentenc term max tf tf ij ij sentenc tag maximum weight calcul term support tf maximum tag weight calcul term support tfidf weight approach invert document frequenc design enhanc discrimin capabl critic term parser extract term base heurist longer term resolv ambigu term term part term parser longer term base built linear time access rule term segment suppli handl ambigu segment conflict candid term complex term extract length input sentenc includ linear time complex html complex preprocess process content length object featur select process html parser term parser process obtain object knowledg repres vector induct process appli immedi learn knowledg object knowledg complex learn process exponenti dimens vector dimens featur select process design reduc complex learn process threshold support discard import remain featur repres object knowledg problem featur select shift select higher discard featur remain term suffici repres lower effect featur select select adapt experi analyz distribut term support train data shown fig observ half term support rang filter term low averag number term object reduc obviou complex featur select linear number featur fig distribut term support train data classif knowledg learn discov classif induct learn gener object knowledg specif class knowledg gener class knowledg class induct process appli specif gener class class assign train object human expert convent learn valu featur train object true learn algorithm gener term class base occurr object consid term equal import ignor term support object class amend defin support denot equat similar normal rang normal class object support term max similar eq support term specif class obtain support term object subordin shown eq number object subordin class affect contribut super class normal object number class class support term max algorithm classif knowledg learner class specif preprocess featur select process specif calcul term support class base eq complex sort log nt nt number object nt maximum number term object class class subordin calcul term support class base eq complex log nt nt nt number nt maximum number term subordin class number term class larg due term support class gener low statist train term class averag support low shown fig term support locat low support rang featur select process reduc low support term threshold averag term term term filter process remov low support includ high support term term highli allevi mine associ rule approach discov term associ appli result enhanc support filter term fig distribut term support class mine term associ featur select process class level complic object level reason larger gener reason term object consist semant class object written web develop simpl filter method threshold good object class collect web server written web develop add term word usag appli filter algorithm threshold directli remov repres term low support valu concept recal rate low system identifi consolid term relat concept appli filter process mine term associ perfect term support algorithm promot repres term low support definit associ rule element problem set item set transact transact transact set item associ rule implic form rule hold transact set confid transact rule support transact set transact follow definit map problem mine term associ specif mine associ rule import issu consid mine associ rule granular transact defin mine associ domain gener associ transact defin granular mine associ system restrict granular gener associ sentenc paragraph order reduc comput complex restrict impract web document paragraph hundr sentenc import sentenc web document depend html posit granular mine term associ inform paragraph domain gener associ rule internet document publish semant term depend author context common word repres mean document mention semant appl fruit class mean appl fruit class observ support idea restrict domain mine term associ boundari class common observ mean form make associ good candid mine base appli mine associ rule process mine term associ term item object inform paragraph transact class transact concentr object class object advantag small complex mine associ exponenti size size simpl mine associ apriori effici appli definit confid support term associ modif term document number stand df df df conf class document number stand df confid regard associ term emploi classif knowledg refin refin support percentag transact support consid metric correct rule class art term art exhibit art art exhibit filter low support mine term associ class discov term associ art exhibit art exhibit conf art exhibit assum rule support consid definit defin previou art exhibit art exhibit art exhibit conf art art infer process promot support exhibit pass filter mine term associ shown fig repres term support tag repres term associ union tag document term semant network extract term mine associ rule term associ term support document document document learn classif knowledg fig construct term semant network classif knowledg refin term associ tag form strongli connect order decid path term class consid number path term class averag number term class exhaust search support term associ emploi filter remov rare small number term class term creat path effici algorithm requir pt algorithm find term class polynomi time definit conf conf conf max conf rang edg involv path smaller product optim path optim path greedi heurist heurist divid node group term node empti initi state time find node maximum move heurist appli empti pt algorithm shown perfect term support algorithm step initi partit term term optim term max step updat term latest term ad stop step continu empti conf conf step find term maxim insert output max prove pt algorithm find optim solut time complex pt effici promot term explor associ repres term fig illustr effect pt term refin side term promot repres associ repres term term associ elimin reduc complex learn support support support support optim optim repres term term term support mg mg mg mg mg fig pt refin threshold support class remain task knowledg refin process select threshold filter term experi design compar keyword select ten human expert experi show knowledg refin process refin knowledg content demonstr recal base criteria threshold type criteria evalu outcom experi top sort descend order term select keyword threshold criterion select term experi result shown tabl appli lowest due high select standard top select highli inform term recal low reason impli induct process learn implicit associ gener term object class comparison case appli pt recal top criterion promot import term cost remov import term top criterion select fix number pt recal promot term keyword class appli induct process knowledg refin hidden semant term discov carefulli chosen select accept recal achiev tabl experi result pt base pt algorithm pt algorithm select criterion recal recal top top threshold threshold evalu classif describ test phase learn process base similar implement automat newli collect internet object classifi assign class test compar class assign human expert evalu classif accuraci base seri experi observ effect support automat classif internet document similar measur classifi convent similar cosin featur vector document defin equat class norm norm grade membership support term common mg mg mg mg sim concept class gener class assign object impract categor object class object conceptu rel class input classifi class closest intens object classif accuraci estim criterion target class test object locat set match class experi result time perform total class specif class leav node class train object test manual classifi class train set test set disjoint learn ten human expert extract keyword class classif knowledg denot learn test process run mark fig result show qualiti par manual extract classif knowledg term accuraci class assign object threshold fig classif accuraci test object base exact class match classif accuraci case high analyz train test found suffici train object object keyword page page design experi circumv situat test process perform base gener class result classif accuraci shown fig accuraci fig user gener categor due suffici train object gener total number test class reduc level reduc fig classif accuraci test object base gener class number object keyword twelv gener class shown tabl distribut number class suffer problem insuffici train object keyword perform experi class suffici train object keyword test class train object total test class reduc contrast experi shown fig suffici train object call class class refin classif knowledg classif knowledg evalu qualiti classif classif knowledg gener ten human expert compar result fig show learn model capabl discov accur classif knowledg human suffici train object class shown classif accuraci dramat suffici train object tabl distribut train object gener class class object keyword compani entertain recreat comput internet educ societi cultur govern state inform health art social scienc natur scienc human fig classif accuraci test object classif knowledg comparison knowledg gener human expert search engin current search engin return user queri list rank document time consum inconveni user access document system search user perform search search util user associ inform class navig class find interest final retriev document design class procedur carri repeatedli desir inform access determin effect critic term user queri search return desir class conjectur queri term investig analysi queri log queri log analyz internet search queri log collect octob extract term queri count frequenc term inform frequenc refer discov inform user interest denot set ct refer seri test distribut keyword perform verifi conjectur test threshold select keyword denot keyword term ct refer count refer count refer count keyword summat refer count number keyword test shown tabl refer queri term queri log recal rate index rate test defin recal rate refer test refer queri log index rate index term test queri term queri log case keyword index keyword cover inform recal doubl index size queri term index cover inform index size accept search capabl shrink search domain inform loss appli effici search engin tabl summat refer count recal number keyword index base queri term threshold filter keyword refin classif knowledg refer inform number keyword search algorithm base worth perform search phase shrink search domain search capabl satisfi queri effici return structur present convent search search object implement user quickli review result user navig class hierarchi search class algorithm search data flow diagram shown fig search algorithm process queri queri string sequenc keyword keyword id retriev class calcul classs relev sort cid score descend order present result html format search retriev select calcul object relev sort oid score descend order present result html format search unabl find desir user chose convent search approach search object search retriev object calcul object relev sort oid mg order present result html format fig data flow diagram search algorithm exampl search engin user search desir object give queri string fig user select queri mode queri technic fig search result queri shown fig inform rank order match class search present class user resum queri class object show shown fig list object class object shown fig list classs direct object normal relev score link keyword page fig show match user press link bottom page perform convent search class interest user fig search match current version interfac figur shown english translat fig search list object search list direct object user class click perform search result refin shown fig present class object click list object class show object content link physic page internet latest date internet robot visit page show statu latest visit file length object html sourc count media user quickli preview page click link column search search object specif user press link perform result shown fig total relev object comparison relev class visit find inform larg number link fig search search futur work show machin learn data mine techniqu appli learn refin classif knowledg base automat classif automat classifi internet document class class hierarchi analysi queri log show knowledg shrink search domain index retriev class potenti desir document effici result search present view concept user associ queri present class perform search class desir document system user visit find inform larg number rank document learn model extend increment learn model cope dynam internet classif accuraci learn method classifi room improv issu studi extend research mine term associ class automat construct semant term specif domain analyz queri log system learn extract term found extend refer inform organ evalu term depend model inform lnc pp spark jone classif inform inform process manag vol pp spark jone term classif inform process vol pp framework effect acm transact vol pp ford problem solv environ scientif problem solv environ scientif ford elsevi scienc publish pp classif knowledg internet semant acm pp salton modern inform text retriev inform addison learn rule text acm transact inform vol juli pp design automat classifi internet resourc intern symposium inform process decemb pp frake retriev data structur prentic world wide web resourc discoveri world wide web vol winter dynam invert index intern confer research develop inform retriev chen automat classifi explor internet technic report agraw algorithm mine associ intern confer septemb associ rule set item larg acm sigmod intern confer manag srikant quantit associ rule larg relat acm sigmod intern confer manag june associ thesauru inform umass technic report lewi william text classifi uncertainti acm evalu phrasal cluster text categor acm pp duda classif scene john wilei techniqu acm transact offic inform vol januari pp multilevel approach intellig inform acm transact inform vol octob pp data base effici text acm vol pp keyword extract inform acm sigir intern confer inform machin vol pp program machin morgan kaufmann publish san clark induct machin learn vol pp induct learn overview technic report depart comput probabilist model text classif umass comput scienc technic retriev probabilist inform process vol pp larkei wb classifi text acm pp salton retriev perform relev journal american societi inform vol pp effect effici learn human text categor acm pp
IR/1376 5 decemb automat text detect track digit video li david doermann automat text detect track digit video david doermann languag media process laboratori institut advanc comput studi maryland colleg md mathemat comput scienc nation institut standard technolog md abstract text scene graphic ad video provid import supplement sourc index inform clue decod video structur classif paper present algorithm detect track text compon digit video frame system implement featur extractor feed artifici neural processor extract textual region track movement time extract region input optic charact recognit system produc index keyword text text video digit neural wavelet support effort depart contract mda gratefulli acknowledg introduct avail onlin digit imageri video interest problem index multimedia inform sourc automat manipul effici imag video sequenc manual annot small number keyword descriptor visual inspect human review process accept archiv inhibit abil perform filter retriev problem index understood address tremend success automat document optic charact recognit technolog transcript speech voic recognit technolog typic ascii text index tradit inform retriev techniqu deal visual linguist content video sourc movi sport event content form text text imag sourc complement abil provid essenti supplement inform index retriev address problem detect track text digit video sound close caption provid index inform spoken basic annot inform imag text sport product scene speaker movi program introduct special announc supplement summar visual content type annot render high contrast respect readabl keyword facilit index specif search actor refer stori easili realiz exist access textual content standard video code extend scope video stream multimedia effort motion pictur expert group part joint intern organ standard intern engin produc standard standard video encod static background move foreground ultim annot textual content object make easier extract index tool standard wide implement expect accept mainstream year extract textual content render part video text scene extrem valuabl index background embark gener subject text extract specif aspect problem discuss synthet natur sourc textual content video frame review relat work present approach scene text graphic text high text divid scene text graphic text scene text scene captur record devic integr part imag consid sampl real world exampl scene text includ street text truck write shirt text typic scene applic surveil read text gener index retriev except constrain text symbol identifi player vehicl scene text difficult detect extract virtual unlimit number shape color graphic text mechan ad video frame supplement visual audio structur close relat subject scene text exampl graphic text includ keyword time locat peopl sport score descriptor typic simpl produc intent read viewer graphic text number function differ domain text reinforc vital inform product claim provid disclaim sport text identifi specif provid game relai statist graphic text identifi kei featur locat speaker provid synopsi topic provid visual summari statist inform movi text product act case caption languag translat research area identif graphic text relat work relat domain work extract text road sign plate librari book www imag scene imag isol video frame method broadli classifi type connect compon base unlik binari document scene imag video frame multivalu multivalu imag decomposit requir connect compon extract gener idea method multivalu imag pixel valu integ greater set elementari imag fi pixel assumpt text repres uniform color connect compon extract elementari imag heurist restrict compon number align compon line orient identifi text line color color cluster techniqu requir binar process typic depend complex color cluster binar method method locat text difficulti text complex background touch text graphic object approach textur analysi method gabor filter gaussian filter spatial varianc locat text region jain describ method separ text imag area base group gabor filter wu present text extract system base gaussian filter treat text distinct textur pixel origin imag repres featur vector consist energi calcul filter imag cluster cluster featur vector text detect digit author analysi add miss charact delet incorrectli identifi region shim detect text consecut frame examin similar text region term intens shape extract text frame check region correspond text frame simpl region match frame filter incorrectli identifi text region work address problem track text find tempor correspond detect text digit video text video frame save recognit literatur object track extens includ face track human bodi track vehicl track medic imag agricultur autom detail survei track algorithm motion found literatur track text approach text detect track digit video view detect track problem multipl text block time move direct field view unlik typic track problem static background move combin static move text background treat background detect track text simpli motion analysi special case movi make motion inform segment motion inform suffici text detect scheme requir conjunct track simplist solut text track perform text detect frame frame match text block consecut frame close frame text detect phase absenc context prohibit make fact text remain scene number consecut frame reduc complex perform text detect process period track process text detect scheme base observ text region typic textur properti surround area textur similar frequenc orient make wavelet reason candid hybrid network segment segment text region facilit detect text pyramid imag gener origin imag halv resolut level extract text region level track process detect process figur scheme text detect track digit video pyramid input imag wavelet decomposit featur extract statist normal neural network layer bp scan window pyramid output imag integr imag scale figur architectur detect text video frame extrapol origin scale text ssd squar base track modul start track detect text make text contour stabil track text track robustli remaind paper organ describ text detect scheme section text track scheme section result present section section discuss applic work figur video binar manual pick threshold text detect video frame compar text detect text detect digit video challeng text digit video complex make difficult connect compon method figur show typic video frame figur binar version good threshold binar imag show charact compon background text digit video render low resolut document scan dot inch result charact occupi area larg pixel video frame limit spatial resolut low charact size approxim pixel effect low resolut text color cluster result scatter text text compon tend touch make detect difficult video natur scene leav tree grass field textur similar text featur text overlap illustr collect text block block linear discrimin analysi project subspac scatter maxim scatter benefit classif project result show text overlap featur space learn classifi text effect cluster techniqu artifici neural network natur figur distribut text subspac lda project text overlap choic classifi abil learn neural network approxim nonlinear function train success neural network relat problem motiv reli neural network classifi identifi text region methodolog small window scan imag classifi window text neural network address issu relat ffl decomposit ffl featur extract ffl classif neural ffl text identif scale space decomposit analysi scale space method identifi spatial frequenc content local region imag wavelet imag provid success approxim imag downsampl abil detect edg figur wavelet decomposit video origin imag filter filter creat success approxim imag detail signal term textual content easili imag decomposit shown figur origin imag wavelet decomposit note text region show high activ result local wavelet locat edg yield larg wavelet make text region detect high frequenc high frequenc compon import recognit jone palmer shown wavelet close repres profil neuron striat cortex depend choic suitabl wavelet decomposit level base criteria wavelet chosen adequ local detect line text region addit imag decomposit implement simpl mask weight sum make wavelet effici improv observ type base experi scale wavelet function wavelet written figur mask lowest vertic high horizont high high frequenc horizont vertic direct wh sequenc equat valu valu equat imag repres algorithm obtain wavelet transform ll lh hl hh imag decomposit process convolut imag kernel figur comput effici obviou featur extract select task featur extract select solv close form method featur select explain section featur extract extract featur wavelet decomposit imag shown figur text textur background detect featur central moment subblock calcul central moment subblock written featur comput imag origin window size maximum decomposit level pixel left imag fourth level featur salienc featur salienc defin measur featur abil impact classif benchmark compar featur salienc probabl error denot comput probabl error singl featur salienc metric featur measur mlp sampl rang input valu empir result metric similar rank error rate measur salienc error rate comput determin featur yield adequ separ class practic error rate estim finit set label sampl class typic estim posterior probabl class assign sampl class map decomposit level imag ll hl lh hh ll hl lh hh ll hl lh hh tabl error measur featur salienc decomposit scale probabl estim percentag sampl misclassifi appli map rule posterior estim estim error rate interfac implement collect text sampl sampl interfac user load imag simpl oper label text region region collect sampl collect text block block sampl class train remain sampl test tabl list featur drawn tabl featur larger valu featur level explan imag size level inform valu gener larger moment order imag smaller imag decomposit level impli moment calcul imag decomposit level order verifi test data wavelet ignor level level provid addit discrimin tabl result wavelet tabl result wavelet exist small draw level subimag expect varianc order moment decomposit ll hl lh hh ll hl lh hh tabl error wavelet level subimag expect varianc order moment decomposit ll hl lh hh ll hl lh hh tabl error wavelet wavelet case compar result tabl wavelet outperform daubechi wavelet problem featur select criterion featur featur set small featur maxim classif result obviou reason reduc featur set effici train smaller number paramet author address impact requir train sampl input featur curv show number train sampl requir grow exponenti number featur salienc analysi section featur set rank twelv featur order error shown tabl featur rank tabl rank featur order denot moment repres decomposit level repres scheme select featur featur tabl train classifi calcul classif error add featur featur repeat process step featur ad twelv featur limit method inabl deal data neural network classifi analysi salienc chang number input paramet neural network number input chang group adjust number minim classif error reach figur illustr relat classif error number featur classif result achiev twelv featur drop featur balanc accuraci process time conduct window video frame account princip process time text featur tabl select classif configur neural network consist layer input hidden node output node train neural network select neural network sampl collect featur analysi cover featur space extens easi repres sampl difficult repres sampl span vast space deal bootstrap method recommend sung poggio idea train sampl collect train train classif error number featur figur test set classif error number featur creat initi set train sampl includ complet set text sampl portion sampl train network sampl run system video frame text add imag block network incorrectli classifi text sampl set repeat step accuraci converg neural network map block real text figur show distribut neural network output test text block train threshold reason choic window text text class separ neural network classifi text identif train neural window scan video frame classifi window text larger step window smaller number window process refin result video frame size system classifi window window move pixel sun ultra step size window dont text line split window output neural network figur output distribut train neural network test text block solid line repres text dash line repres figur origin classifi label segment text area segment text area bound box gener detect move window pixel time window classifi pixel window label text pixel cover text window label result classif label map origin imag figur video frame figur classifi label map figur figur show extract text region text label small isol area incorrectli label text size consist block filter area bound box text area gener connect compon analysi text window figur result filter area gener bound box result integr depict figur pyramid approach detect text wide rang font size detect step appli bound box map back origin input imag bound box level overlap box simpli merg origin imag text string part text string multipl level box detect level overlap case merg form bound box figur integr result figur figur text region detect integr result postprocess result text detect algorithm set text multipl text line text spatial compact text detect result form block benefit imag resolut enhanc ocr text line provid context block typic good candid track size text line text block move text remain static text move divid text block compact text typic line word project profil extract text element text block avoid difficulti normal text project profil canni edg map imag imag figur set gener text element detect result figur block horizont orient track text track problem overview text track process start text motion digit video simpl rigid motion scroll movi complex motion scene text zoom rotat camera simpl imag match techniqu track text robust techniqu requir goal design scheme figur result text canni edg map detect text horizont project profil gener text line effici track text simpl complex motion arbitrari motion encompass wide rang motion transform gener paradigm estim motion paramet extrem develop literatur research approach deal motion restrict object behavior reliabl visual track object complex environ requir integr visual criterion emploi assumpt incom imag modul select complement modul aid treat text line close set bound box text line correspond boundari boundari interior provid complementari determin shape determin content integr track modul base imag content shape make track process power stabl gener ssd squar modul measur similar imag content interior make inform text contour stabil posit text block boundari rest section give detail implement ssd squar base imag match camera text pattern imag intens complex wai describ imag subsequ imag time obtain move point imag time amount ffi repres affin ffi deform matrix displac vector minim ssd squar match basic track algorithm refer block imag search region imag determin paramet deform matrix displac vector minim ffl solut equat complex qualiti estim depend factor size featur imag amount camera motion assumpt small simplifi equat set deform matrix ident matrix equat simplifi ffl model equat pure translat model search space rang predict locat simpl predict techniqu locat accur text posit current past essenc linear predictor robust model adapt linear predict kalman add comput complex frame number frame frame frame frame number ssd figur model track movi credit initi posit manual track graph ssd consecut frame ssd higher frame text line move complex background pure translat model track case simpl motion static text figur show track movi credit text line track move clean background complex background middl text line correctli track figur show graph ssd pure translat model adequ handl rotat distort long sequenc error accumul point tracker lose target figur show track result track text line confer video sequenc camera scene chang text move complex includ ssd small consecut frame tracker gradual lose target frame text stabil text undergo complex pure translat model track exist elabor track model includ parametr model articul frame number frame frame frame ssd frame number figur method fail distort confer exist scale chang rotat deform linear imag subspac result algorithm reli nonlinear optim techniqu requir minut frame comput text contour stabil track process stabil process implement effici match text posit gener slightli larger text block ffi real text posit includ gener edg map calcul canni edg edg map threshold imag avoid difficulti identifi normal text text appli horizont process edg map group form text block extract connect compon posit repres refin text posit figur show initi match posit figur show refin posit figur text posit refin base contour stabil initi match text enlarg text edg refin posit scheme work text move clean background text move complex problem occur complex text touch graphic object contour extract process oper slightli enlarg box leav extra space contour text contour larger text rigid motion text move complex ssd consecut frame larger pixel valu background chang contour harder extract contour stabil achiev satisfactori result case stop stabil process depend ssd model text move complex background smaller stabil start match reduc complex modul comput cost track larg text line perform match fine hierarch fashion gaussian imag pyramid frame size gaussian pyramid form combin gaussian imag frame frame number ng repres level pyramid size frame level figur multipl resolut base imag match text block pyramid frame imag pyramid form frame match process conduct imag scale match conduct start resolut level contribut determin posit match level search minimum ssd start level window size match point found level search minimum ssd conduct pixel window size process continu finest resolut reach maximum displac support search smaller requir displac doubl level total displac reach finest level figur illustr process level pyramid depend size text block text line small pyramid form match conduct directli origin imag scale text detect region text cross screen figur make tempor tendenc tempor tendenc goal system track text gener tempor tendenc text motion facilit track process text line scroll deduc text line bottom video frame restrict costli text detect process small region text cross frame analysi tempor tendenc track text correctli newscast announc cross bottom tv screen track text line case virtual text line bigger frame separ text line word track word find word text line move horizont direct word continu draw text monitor small area text word implement experi implement tool base method text detect tool text track tool text detect track tool program written run sun workstat oper system solari detect text region singl video frame track text region initi posit combin modul conduct epoch network error epoch figur relat train time detect track sequenc frame evalu perform tool experi text detect collect video frame split train set test set train sampl block collect video frame train set bootstrap method train time depend requir error figur show smaller longer train neural network detect procedur requir sun workstat ultra process frame unoptim code classif featur postprocess imag input output text collect includ scene text graphic text multipl font size evalu text detect system block level segment text block word charact text block text line close shown tabl total text block frame correctli detect algorithm miss error occur primarili low resolut text block frame number text line detect miss detect tabl text detect result figur part identif result text larg font text low resolut scene text text font text font style bottom small text block size text string block misclassifi text block figur exampl attempt ocr overcom problem slight detect segment task direct applic document imag segment chang number node output layer correspond class background figur exampl text block bottom frame detect due low text string detect due small block top frame block middl frame block misclassifi figur slight segment document imag document imag scan magazin segment result document imag washington segment result featur extract scheme number hidden layer node adjust maxim classif result chose train set document washington test system rest document scan magazin cover figur show work layout document complex text track collect ten video sequenc experi text track wide varieti video includ movi tv footbal confer descript video includ static simpl complex tabl conduct experi step studi perform text track manual initi posit text filter effect text detect quantit evalu track accuraci easi lack ground truth data output track result form mpeg video view websit track result shown figur experi show tracker work text simpl motion motion complex background clean video video frame text motion id type number line descript movi credit complex movi credit scroll static sport complex sport complex confer complex confer complex scene cross tv program zoom commerci cross tabl video sourc experi text move arbitrarili complex tracker frame adjust posit text move clean background figur initi posit touch object edg text size track posit deviat frame adjust text grow larg separ map track number athlet jersei footbal game task complic athlet camera motion tracker lose part target frame adjust correct posit averag track time text block frame text line larg match reduc track text text block tempor correspond block perform detect frame extra time requir find correspond block consecut frame applic text track tool ground truth video video process evalu resourc project lab function mechan creat ground truth data perform quantit evalu account cost ground truth video manual track reduc cost significantli user initi box track rest frame user check adjust text figur demonstr perform video sourc initi posit text block manual track movi text zoom displac zoom scene text text scroll vari background track text footbal athlet jersei track text confer room scene track result found mpeg video frame frame frame frame frame frame frame frame figur text detect track movi star war figur languag media process frame frame frame frame part experi combin text detect track modul input sequenc imag output sequenc detect track text region repres mpeg video ascii file record inform text block figur show track result movi star war frame includ scroll text figur show track result text line detect horizont scroll tempor tendenc analysi section divid line word track result view websit process time number text line frame track movi credit time video type text line frame movi credit movi star track frame averag number text line frame track text footbal game text line move detect text tempor correspond text block limit system text track start text detect text detect modul system miss text tracker imag match approxim posit text contour refin posit system track text speed predict predict posit text limit tracker difficulti text move move complex background sport video track athlet text occlud quickli athlet jump rotat applic discuss section discuss applic involv detect track text video index ocr digit video video ocr requir convert text imag format plain text block ocr mention text digit video low resolut limit commerci ocr softwar figur show text block extract video frame manual pick threshold binar imag output ocr softwar text readabl text digit video limit spatial resolut font size approxim pixel typic document imag commerci ocr softwar work scan dot inch translat charact occupi area larg pixel motiv perform text resolut enhanc achiev reason ocr result commerci ocr softwar index retriev improv text resolut multipl frame type techniqu sort movement frame object requir test xerox xerox figur text block font size approxim binar manual pick threshold output commerci ocr softwar text readabl world figur comparison ocr result interpol estim movement accuraci text static move integ pixel influenc imag interpol improv resolut directli experi encourag result chose text block extract video frame hold interpol shannon interpol imag resolut binar scheme ocr softwar test group imag ocr accuraci origin imag rise hold interpol shannon interpol detail descript topic scope paper found index retriev digit video ultim goal build index system digit video unlik retriev deal full video index base automat extract text interest problem expect miss incorrect charact word poor ocr perform exact match word approxim word match exact word match user submit word consid match problem text digit video lack semant breadth method deal semant latent semant index extens train data similar characterist construct semant dictionari great deal work make impract specif build semant dictionari relat specif topic user submit video frame return put semant dictionari activ investig topic report research result futur present system detect track text digit video automat hybrid network base method detect text region track modul imag match find initi stabil refin match posit system detect graphic text scene text font size track text undergo complex motion discuss ocr index problem video imag current focu make recogn text build video index retriev system experi conduct suggest text enhanc reason ocr result step deal poor ocr result extend semant breadth refer jk motion articul elast motion comput vision imag track medic data deform parametr model page eb baum haussler size net valid neural ellipt head track intens gradient color histogram page black jepson robust match track articul object page black yacoob track recogn rigid facial motion local parametr model imag motion page bregler learn recogn human dynam video sequenc page bs textur segment neural network neural network signal page prentic tm cover geometr statist properti system linear inequ applic pattern recognit ieee tran electron xuan automat recognit provinc plate move vehicl page br hunt imag process neural network recognit cartograph area featur pattern ds doermann video perform evalu technic colleg chellappa document page segment soft integr ieee tran terzopoulo track head mobil object video frame rate page dh folei sampl featur size ieee tran inform hh track occlud vehicl traffic scene page fukunaga introduct statist pattern recognit academ davi track human approach imag understand page yoshida flexibl algorithm book sort system ieee tran guyon applic neural network charact recognit intern journal pattern artifici gd hager pn belhumeur effici region track parametr model geometri illumin ieee tran sinha integr word level knowledg text recognit page rc dc pd system robot harvest machin vision voic signal process techniqu speech recognit noisi environ signal ak jain text segment gabor filter automat document process machin vision ak jain yu automat text locat imag video frame page jone la palmer spatial structur simpl recept field striat cortex cat journal kim effici automat text locat method index structur video journal visual commun imag sk dw hj kim recognit vehicl plate genet algorithm base segment page lee automat extract charact complex scene imag intern journal pattern artifici kim automat recognit car plate color imag process page jf project li ds doermann automat identif text digit video kei frame page ds text extract recognit digit video page tf li ss yu charact recognit probabl distribut featur intern journal pattern artifici automat text recognit digit video acm page multiresolut approxim wavelet orthonorm base tran amer math theori multiresolut signal wavelet ieee tran bs manjunath chellappa unifi approach boundari textur contour ieee tran neural nayar visual learn recognit object page recogn word singl symbol page recogn charact scene imag ieee tran neural network jointli voic featur mouth shape imag pattern de robust method road sign detect recognit imag vision rehg kanad visual track high dof articul applic human hand track page rehg witkin visual track deform model ieee intl conf robot page learn dynam complex motion imag sequenc page sk jm ce jc neural network automat target recognit neural recognit human movement imag sequenc imag dw sk featur select perceptron journal neural network shi good featur track page duncan integr approach track deform displac veloc constraint page boll automat text extract video annot retriev page sung poggio learn human face detect technic ai memo paper pentland track human bodi ieee tran em automat text detect recognit imag understand page ak address block locat complex mail piec page ak jain locat text complex color imag pattern zhou extract text www imag page find text color imag document recognit page
IR/1377 5 infocom local search engin queri implic cach xie david depart comput carnegi mellon popular techniqu reduc server load user time distribut system question cach effect search engin studi real search engin trace examin queri local implic cach trace analysi result show queri queri frequenc zipf distribut popular queri share user cach server queri user cach user side queri share cach user side cach user cach hour cover queri tempor cach longer dai user small lexicon submit queri frequent user submit search request tend small subset word form queri proxi user side prefetch base user lexicon introduct ¢ ach import techniqu reduc server workload user time client send request respond local cach data cach frequent access object proxi transmiss delai object minim serv nearbi cach remot server absorb portion proxi cach capac server enabl servic potenti larger interest question cach effect search engin serv search request requir amount comput network cach search result improv perform wai repeat queri result fetch redund process minim access latenc reduct server scarc comput cycl server cycl appli advanc algorithm potenti result dissemin user request proxi distribut part comput task custom search result base user contextu inform web cach wide research tackl problem cach search engin result search engin queri import question £ cach search engin cach intermedi determin type cach result hit queri popular level queri share user long queri cach £ £ benefit accru proxi client side cach distribut wai serv search prefetch queri result base individu user respect studi real search engin trace investig implic cach search engin result analysi yield kei £ queri local queri repeat queri submit queri repetit frequenc zipf distribut popular queri high repetit frequenc share user cach server proxi queri frequent repeat user queri repeat queri cach user side queri share user cach user £ side major repeat queri referenc short time interv remain portion queri repeat longer time interv larg share user cach user cach hour cover queri tempor cach base longer order £ dai user small lexicon submit queri frequent user submit search request tend small subset word form queri proxi user side prefetch base user lexicon proxi user side cach provid opportun improv queri result base individu user import futur research direct rest discuss relat work section describ trace analyz summar gener statist data section ii section focu repeat queri discuss queri local trace section iv present find user lexicon analysi implic review analysi result discuss futur research direct relat work due exponenti growth research impact web cach maxim perform benefit web browser support cach document memori local disk ieee ieee infocom duce time client deploi proxi client server yield number perform benefit reduc server network bandwidth usag user access latenc prefetch document proxi client studi perform improv util user access pattern previou studi search engin trace al analyz excit search engin trace determin user search web search silverstein al analyz altavista search engin trace studi interact term queri present result correl analysi log entri studi cach search engin suggest queri motiv work queri result cach investig reduc cost queri execut distribut system cach result queri studi queri local base excit trace shown ¤ ¥ ¥ queri repeat suggest queri result cach leverag cach replac algorithm work build systemat studi queri local deriv implic cach search engin result ii search engin queri trace trace analyz search engin excit search engin briefli search engin review trace data excit search engin cluster engin organ combin output multipl search engin recept user combin result search engin organ document group group gener dynam base extract short descript refer multipl major search includ feb return combin result logic oper support advanc search option user search engin number result logic oper perform includ phrase boolean excit basic search engin automat produc search result list relev web site inform recept user queri capit queri disregard default logic oper perform support logic oper advanc search featur excit includ wide card search relev feedback queri trace descript queri trace collect januari februari launch earli trace captur behavior earli adopt repres steadi state user group excit trace collect decemb trace excit trace collect independ tempor user statist result similar repres entri field anonym id identifi user ip address £ actual user ip address ip address origin trace replac uniqu anonym id timestamp user request receiv £ timestamp record wall clock time resolut queri string submit user advanc queri £ oper string number indic request page £ user queri statist summari trace extract queri string trace transform string uniform format easi process remov stopword queri search engin discard convert queri term lower case queri case typic search engin remov stopword case impact analysi result affect statist effect rest denot word enter user queri denot individu word user queri distinguish user multipl ip address user share ip address uniformli denot ip address queri fig summar statist trace excit trace hour singl dai trace collect recent period dai trace provid view user queri stand time scale fact obviou summari trace user issu request fewer page averag examin queri user repeat queri lot queri repeat submit user user excit queri repeat queri major user advanc queri queri trace queri excit trace default logic oper offer search engin user averag submit queri averag number queri submit user queri consist averag queri length fewer ieee ieee infocom trace trace excit trace number byte number http request number user queri page number user queri page number distinct user queri number multipl word queri number queri default logic number user averag queri submit user averag number term queri fig trace statist summari number http request infer excit trace trace inform http request user percentag queri percentag queri number word queri trace number word queri excit trace fig user queri distribut number word queri short fig show queri length distribut trace observ queri fewer term long result consist report iii queri local implic mention section queri trace repeat suggest cach reduc server workload network traffic focu studi repeat discuss number time base number time base queri base trace queri base excit trace fig distribut queri repetit frequenc scale queri id sort number time repeat local queri motiv kind cach queri repetit distribut queri repeat distinct queri mean repeat queri submit time repeat queri excit trace submit distinct queri repeat found queri repetit frequenc zipf distribut fig plot distribut repeat queri frequenc ieee ieee infocom trace data point repres repeat axi show queri sort repetit queri popular queri repeat reach queri number repeat singl time interest repeat queri user share user repeat queri user excit repeat repeat user queri repeat queri user trace excit count number distinct queri repeat user queri trace queri excit trace distribut nonuniform frequenc repetit defin queri number distinct user submit queri time period share measur popular multipl user fig show share queri base repetit frequenc find queri repeat time share multipl user queri repeat fewer time queri repeat share user queri repeat fewer share trend hold excit trace queri repeat share queri repeat fewer time zipf distribut queri repetit small number queri repeat frequent share user repeat user exist larg number queri repeat user result suggest cach queri result wai small number queri cach search engin server exploit high share user cach user reduc server process overhead due high repetit frequenc type queri repeat cach server limit server resourc requir larg number user cach queri user side uniqu requir individu user queri local base individu user queri share distribut queri local exist respect user user queri long tail repeat user explor queri local base individu user user record repeat queri user repeat queri repeat queri user id trace user id excit trace fig percentag repeat queri number queri submit user user repeat queri plot ag repeat queri excit user submit queri user repeat user repeat queri averag fig plot percentag repeat queri total number queri submit user user submit queri repeat submit user repeat queri observ user repeat queri repeat queri half user repeat queri lot user repeat user repeat queri lot queri repeat user search engin server cach limit cach queri queri result base individu user requir distribut import reduc user queri submiss overhead access latenc server load cach queri user opportun improv queri result base individu user achiev cach queri central server tempor queri local quantifi notion tempor queri tendenc user repeat queri short time interv fig show number queri repeat time interv queri repeat ieee ieee infocom type queri queri repeat time queri repeat time share share share share number percentag fig share queri trace type queri queri repeat time queri repeat time share share share share number percentag fig share queri excit trace fig share queri base repetit frequenc queri share submit user exact form queri submit singl user share short period time queri repeat hour excit trace queri repeat hour queri user queri repeat user short queri repeat longer time larg share user queri repeat user excit trace gener smaller percentag queri repeat user observ shorter time queri repeat user statist suggest cach queri result server longer period cach order exploit maximum share user cach queri result long time result stale data perform stale data remov server updat result cach perform user short period cach cover tempor queri result stale data queri local queri import account queri queri discuss section fig summar statist queri excit trace larger portion queri trace queri repeat observ queri repeat frequent compar queri repeat queri submit time compar time case excit repeat queri submit compar time case observ queri local exist queri repeat queri repeat queri min min min dai time interv number queri repeat number queri repeat user trace min min min time interv excit trace number queri repeat number queri repeat user fig repeat queri distribut time interv share fig show comparison queri queri respect share queri share user share queri share fewer user easili explain chanc user submit queri smaller queri queri local cach queri time comput queri result queri cach user side ieee ieee infocom number percentag excit excit multipl word queri number uniqu multipl word queri number uniqu multipl word queri repeat number repeat uniqu multipl word queri repeat number uniqu repeat uniqu multipl word queri submit user number uniqu multipl word fig queri summari type queri share queri share queri excit excit percentag number user fig comparison queri queri respect share trace mean portion share queri total number queri mean averag number user share queri user share ip address user dial servic aol access internet ip address dynam alloc server common identifi kind user impact analysi wai user share ip address queri lead overestim queri local user user ip address underestim queri local user aol client keyword record identifi aol user share ip address trace found queri queri submit aol client frequent user submit queri result trace user iv user lexicon analysi implic analyz user queri lexicon wai prefetch queri result individu recogn frequent term distribut user lexicon size notic word frequenc trace zipf notic graph fall begin unusu long tail lexicon group word user examin user lexicon size distribut word queri distinct word excit distinct word word queri notic user excit trace submit larg number queri user submit queri hour user engin normal user ignor user submit queri excit trace examin remain user lexicon size compar lexicon user lexicon size smaller largest user lexicon trace word find user lexicon size follow zipf distribut fig plot distribut user lexicon size graph heavi mean major user small lexicon relationship number queri submit user lexicon size queri submit larger lexicon fig show relationship number queri submit user user lexicon size base trace user lexicon size proport number queri submit user user submit lot queri small lexicon excit trace show pattern plot analysi frequent user lexicon user larg word uniformli interest word frequent queri user user trace submit queri calcul frequent word user excit trace trace short period ieee ieee infocom lexicon base lexicon base user lexicon base trace user lexicon base excit trace fig distribut user lexicon size logarithm scale ax axi denot user id sort lexicon size plot excit remov user submit queri period user metasearch engin robot normal user user lexicon size number queri submit user user small lexicon size submit queri user id lexicon fig user lexicon size number queri submit trace solid line plot sort user lexicon size dash line plot number queri submit user scale figur zoom part complet pattern shown gener complet figur focu frequent user trace call user user submit queri submit queri dai averag defin consist word time user fig show statist summari trace number number queri submit number size number size fig statist trace defin user submit queri dai user visit frequent submit queri dai averag defin set term user time queri size number queri gener user gener lot queri small user queri queri gener gener term id percentag queri gener fig number queri gener size id sort lexicon size percentag queri gener id sort percentag count submit queri account portion total number queri user cach improv queri result base individu requir observ figur small interest queri gener pure word user tend small number word form predict queri prefetch queri result simpli word combin fig plot number queri gener small number larger submit lot queri prefetch base user reduc number queri submit dramat larg cach size store word ieee ieee infocom due larg size user gener lot queri small user figur gener queri word prefetch effect major queri fewer interest queri fewer term gener fig show percentag queri percentag queri fewer term addit extra constraint number term affect result word combin greatli reduc number queri prefetch research implic review statist result deriv trace discuss implic futur research direct focu cach search engin prefetch search engin improv queri result rank cach search engin result ¥ ¥ repeat cach search engin result problem cach placement kei aspect effect cach queri result cach client optim make base scalabl cach scheme scale size densiti internet perform improv includ amount reduct server user access network traffic hit rate share higher hit effici cach cach queri result share user common interest overhead overhead includ system resourc devot cach extra network traffic induc opportun benefit dissemin user request benefit achiev exist fig compar pro con cach placement scheme gener server cach limit system resourc £ scale size internet avoid redund reduc number request receiv server reduct user access latenc limit server cach small overhead maximum queri share user hit rate high cach popular queri proxi cach effect reduc server workload £ network traffic case cach queri assum user nearbi proxi share queri main disadvantag proxi cach overhead place dedic proxi internet £ user side cach perform improv case cach hit redund user request compar limit system resourc sum individu user resourc infinit user side cach achiev scalabl overhead cach amort larg number overhead user side small user side prefetch improv queri result base individu user requir share exploit user side cach queri share repeat low hit rate case discuss share import decid cach queri result extrem case user repeat reach maximum share cach queri result server proxi user side cach result hit rate extrem case user share cach queri result user side trace analysi result show repeat queri account repeat queri user account portion queri repeat user nontrivi differ percentag suggest cach user side cach queri repeat cach user side rest repeat queri cach server proxi actual ip address user distinguish queri share nearbi user cach proxi clear trace percentag queri leav proxi cach futur work search engin determin place proxi queri suggest cach queri user side cach popular queri achiev larger hit rate greatli reduc requir system space import question cach long cach queri result tempor queri local queri repeat short time interv cach queri result short period work detail analysi section show shorter time queri repeat user user side cach queri result hour cover queri local exist user remov updat stale queri result time exist portion queri repeat longer time interv queri share user cach server cach coupl dai ieee ieee infocom level cach server cach proxi cach user side cach scalabl worst medium perform improv worst medium hit rate share medium worst overhead small larg small opportun benefit medium tempor queri local content dynam queri result directli impact mechan maintain cach consist search engin updat queri result order dai week user side cach queri result hour cover queri local mechan maintain cach consist associ queri cach field set rel short interv header field user http protocol queri result fresh mechan larger overhead user side server side user side interact server request server side proxi mechan maintain cach consist server side easili ensur cach consist remov updat stale queri result queri result comput proxi queri share user tend repeat longer time simpl base approach incur overhead reason set short interv prevent cach serv stale data reload unnecessarili advanc invalid protocol updat stale queri result overhead low proxi poll techniqu proxi period check back server determin cach object valid server notifi proxi queri result updat mechan web cach internet prefetch search engin result user lexicon analysi section iv suggest prefetch queri result base user prefetch import method reduc user access latenc case prefetch search engin perform user side proxi cach queri result user side inform user interest user side prefetch natur worth user lexicon observ major user lexicon size small frequent user submit queri small subset word word straightforward prefetch word combin prefetch queri result user level cach user queri latenc greatli reduc case cach hit interact remot server involv queri fig comparison cach placement scheme skip queri longer term reduc prefetch overhead achiev approxim perform improv prefetch queri naiv cost minut network download time modem disk storag overhead trivial normal pc todai idl time averag normal disk size ten gigabyt user interest chang updat match user interest queri form queri result prefetch achiev cach hit rate user interest stai major word remain fewer queri result fetch time prefetch perform prefetch overhead user side small prefetch algorithm potenti benefit server prefetch queri result redund queri request server network bandwidth system resourc consum compar case prefetch perform prefetch algorithm regularli user machin idl server request process time server addit burden server peak time server peak time workload reduc queri satisfi user prefetch scarc server cpu network resourc peak time save serv client appli advanc algorithm prefetch perform proxi global knowledg user queri pattern util decid prefetch prefetch proxi queri share explor achiev maximum hit rate case interest problem futur research improv queri result rank search engin return ten thousand result user result review user section show user averag review fewer page result improv queri result rank base individu user requir import person natur requir incorpor user context find desir inform central search engin provid servic million impract custom result user ieee ieee infocom search engin offer search result standard special user requir user defin requir user return search engin result base uniqu interest individu user naiv algorithm rank web page visit user queri result explor algorithm integr cach custom search engin result individu user vi cach import techniqu reduc server workload user access latenc investig issu cach work case search area studi real search engin trace investig cach search engin user long cach search benefit cach search engin analysi search engin trace excit search engin trace queri local queri repetit frequenc zipf distribut popular queri high repetit frequenc share user cach server proxi queri repeat cach user side queri share cach user side major repeat queri referenc short time interv portion queri repeat longer time interv larg share user cach user cach hour cover queri tempor cach user longer dai user small lexicon submit queri frequent user submit search request tend small subset word form queri proxi user side prefetch base user lexicon proxi user side cach provid opportun improv queri result base individu user import direct futur research vii acknowledg gratefulli acknowledg assist perez search engin team provid trace excit team make trace gener share trace data work jami callan comment suggest refer web proxi cach heterogen ieee march issu level web sigmetr confer measur model comput june ms proxi cach provis network acm sigmetr santa june perform cach acm sigmetr june prefetch bandwidth client acm sigmetr bound web latenc reduct cach usenix symposium internet technolog decemb bj life inform studi user queri sigir vol pp larg altavista queri tech rep digit system research octob ks cach optim distribut mediat jagadish singh proc acm sigmod conf pp acm press distribut queri result cach evalu queri parallel data mine proc int conf parallel distribut techniqu cach search engin tech rep institut comput foundat research technolog cach search engin queri intern web cach content deliveri ieee
IR/1378 5 evolv person agent environ reduc internet inform initi sinclair inform overload everydai internet user face problem inform occur overwhelm inform feed comput user face lead ineffici final result uninform frustrat user continu internet user confront labori difficult task inform filter inher process involv human labour effici speed comput system retriev process massiv amount data exacerb problem ineffect inform filter user user world wide web similar network inform experi phenomenon inform overload initi web search subject surf web subject interest case start page term portal begin surf lost web hyperlink page problem case simpli regard part habitu surf satisfi specif inform overload occur user present thousand user process classifi vocabulari problem issu ineffici numer research solut press issu past year led commerci solut paper address major inform overload habitu surf present research programm outlin support potenti solut issu visit comput home immin arriv inform chang major goal tackl problem provid solut inform overload technolog engin practic reach envisag success solut end judg human user aspect research programm scope paper touch relat work current solut problem inform discoveri filter web content produc satisfactori lead inform requir london sinclair dept electron system essex user perspect commerci solut current commerci solut examin solv inform overload user satisfi spontan queri keyword commerci approach current commerci servic offer user interfac massiv collect index web document time refer search engin major make user appli logic oper keyword form effect queri hide basic natur languag recognit interfac alta emploi massiv cluster server high bandwidth network order servic user queri larg full text indic web assembl index result search perform webcrawl work search algorithm alta pride web page cover small proport web roughli unlik approach alta vista search engin lyco larg index heurist order offer slightli intellig approach lyco index full portion advantag html structur order relev retriev document achiev structur construct order locat import keyword interestingli recent studi show homepag import keyword descript structur similar lyco approach googl work googl link structur interpret link page page vote confid grade import system googl enhanc review import voter result googl return filter relev term return page higher relev score request term import locat retriev page close user ideal spend time irrelev materi present structur vast web space build larg popular search engin webcrawl autom collect web page owner regist directli structur larg staff manual filter web page retriev user find inform document manual navig directori appli search engin queri make separ categori unambigu make easier faster user discov area local search appli time approach suffer limit abil human billion page grow exponenti combin user effect perform part search search present user friendli implement popular subject perform compani staff interest approach index popular queri user similar close present answer point correct categori site hide queri user offer behaviour lead user time expect perform met perform search engin present user engin answer strategi parasit engin retriev initi filter metacrawl offer coverag web space reduc time user spend search engin cover part web space latest commerci attempt provid inform filter agent appl introduct interest develop due combin featur fact tightli coupl oper system obviou differ live user comput desktop part filter search engin appl offer user interfac control center search engin act unifi search engin interfac emploi inform discoveri agent facilit inform group set search engin appl call channel channel singl search peopl find cheapest book onlin channel search engin plugin tailor search engin specif edit effect filter templat hide paramet search engin queri number hit appl move intellig agent arena futur approach solut present limit present select project resembl complement direct pictur commerci solut repres section give futur letizia project develop mit media aim autonom transpar assist user web task agent perform monitor user order infer pattern simpl heurist parallel user letizia explor web sourc collect hyperlink user explor perform bf hyperlink visit web page knowledg user infer make suggest possibl interest link follow letizia effect perform user offer recommend user feel stuck lost web space complementari problem inform overload due habitu surf problem search search servic search engin research similar commerci googl search develop ibm cornel clever search project clever advantag structur link page web order relev retriev document achiev investig origin web page refer page question page referenc site great term authorit result referenc page automat higher rank queri creat web hub clever make human judgement construct web page refer encompass approach surf search web effici inform webmat implement interest strategi form proxi user interfac control applet constantli monitor user action order increment establish user interest system make automat user profil discoveri increment classifi user habit number finit interest domain relev feedback perform give system posit feedback accumul knowledg interest domain make web page recommend letizia compil daili newspap tailor user webmat enhanc web search appli keyword refin parallel search search metacrawl ongo research illinoi digit librari genet algorithm base spider evalu global optim search internet research compar contrast ga convent bf spider algorithm offer user interfac present progress search user evalu bootstrap system achiev user indic web page interest seed page translat weight keyword vector evalu visit web page user interfac provid experi present page relev feedback idiom task intens made bootstrap system import choic seed page indirectli determin search method experi show seed page high densiti interconnect favour bf user system homepag ga perform discov techniqu research demonstr exploratori natur ga discov relev page connect rest artifici ecosystem evolv agent adapt compet order assist user inform overload implement amalthaea mit media lab project softwar agent divid inform discoveri id involv inform filter model learn adapt user interest augment weight keyword vector ga genotyp choic user domain interest finit set user domain interest cluster agent assign independ evolv bootstrap system import amalthaea achiev web page passag text subject interest amalthaea engin live monitor user action continu adapt user request digest interest categori user interfac relev feedback system dynam adapt result amalthaea experi encourag show adapt user interest happen system recov larg user profil search engin offer small part web space user order offer user entri point portal static limit granular interest time involv disclosur person inform person prefer onlin bui habit portfolio track sold market undoubtedli bring revenu oper site servic neglig user web user awar privaci formula chang search engin site make user navig directori order discov inform servic suffer rapid growth web space lead smaller fraction web index requir time user navig lead inform form banner search disrupt user consum vital bandwidth case mobil web portabl comput wireless inform devic connect mobil cellular costli term oper charg limit bandwidth top actual screen space occupi make practic imposs web site approach inform filter account agent user devic multipl platform conjunct physic locat time space evolv person agent environ mean deal problem inform domain paper outlin person adapt system central design suggest system evolutionari agent collabor trust locat awar continu adapt major system aim constantli continu evolv adapt locat behavior user system advanc search person agent aim transpar assist filter present inform base observ user individu enhanc adapt mobil goal subsequ mobil person system inform overload problem close individu user interest person system posit cope demand task person system record sensit user logic physic form devic follow constantli continu evolv world person system hold negoti relationship user surrog person portal major differ current approach inform overload fact filter retriev inform ideal happen prior user request system aim solv inform overload problem result user make spontan specif solv inform overload problem regard person portal unlik offer compani differ system commerci solut agent environ evolv user interest evolv user satisfact person mobil user term physic locat host platform introduc appreci delai present major retriev filter happen prior user approach solv aspect inform overload adapt evolv portal web network simpl offer mobil locat awar locat awar context sensit direct result portabl person data wearabl enabl mobil cellular wireless network abil mobil agent discov enabl wai user habit adapt evolv close present profil bu user satisfact feedback behavior locat record evolut includ individu profil statist behaviour anticip profil order posit present user correct portal user confirm creation profil agent system evolv base statist simpli make user profil bu mondai feel read morn initi survei author highli show larg percentag subject chang web surf habit locat survei show subject kind content dai chang surf interest time dai possibl chang arriv portabl low cost cellular internet access area addit inform overload result wearabl devic inform applianc gener exacerb problem impact user social behaviour time context sensit mobil introduc continu chang develop user potenti benefit suitabl engin person adapt individu portal user satisfact system person user satisfact essenti driver system improv agent environ improv adapt user individu prefer view heurist index keyword give good object ideal user prefer result tailor individu interest profil emploi individu determin estim user system close adapt user person yield continu improv result wai estim user direct user feedback indirect make infer user select user satisfact form part programm research user interfac close coupl user satisfact feedback user interfac mediat facilit human comput interact fact mechan user input fed back inform convei critic accept adopt system design ui stage research emerg outcom survei experi user group inform overload problem treat matter good bad potenti technolog drive human center deliv solut major challeng plethora devic form factor system host gener provid independ minim function make straightforward user adopt anticip potenti user distract present view portal directli relat current profil user reason approach user interest thing limit number subject convei time activ profil agent societi commun collabor approach intend exploit benefit inher distribut natur consid machin collect broadli model real form assembl commun group belong relationship hierarchi turn form belong abstract number agent set exist depend relationship perceiv person agent environ easier relationship built depend user relationship appli protocol relationship evolv commun place agent behalf user commun line user prefer time happen autonom engag user qualiti mean filter inform discoveri happen rapidli time breach trust consumpt user bandwidth intend investig achiev transpar collabor filter inform discoveri group evolv person determin effect approach illustr fig evolv person agent system retriev relev inform crawl web agent collabor commun agent system advantag agent societi ffl explicitli commun agent agent pool ffl act locat ident agent system secur privaci case form reput econom model broker friend contractor expert benevol agent pool spider world wide web figur discoveri inform fore adapt appli possibl prove benefici benevol agent serv contract speed inform retriev explor search space time exploit expert agent broker prove import domain lot volunt possibl agent compani goal make step exploit enabl human agent part evolv inform societi note flow inform direct machin speed import mechan deleg trust enforc commun polici accord user privaci person agent data relationship sensit person inform privaci vital requir user frank confid agent privaci secur time privaci fulfil major part human control system person larg extend decid agent system adopt person system record hold person inform system evolut adapt separ inform track user prefer profil habit extern setup user home comput configur home comput evolv agent person carri time user home person portal record user web habit feed back home system user return network connect provid wireless network internet servic provid person portal readi prior user possibl home lot inform retriev filter place transfer isp posit monitor transfer inform time due system necessarili posit infer inform filter user tast satisfi step inform exchang trust agent agent agent agent friend friend repli repli repli friend friend friend relationship figur trust relationship propag protocol system broker encrypt enhanc secur minimalist point inform filter person hand user system sensit inform exchang collabor discoveri applic trust model user relationship time enforc trust propag protocol fig main wai lost answer specif spontan queri directli search web search habitu surf web discov subject inform interest wai lead inform overload anticip person evolv agent system provid solut research programm craft system adapt user person mobil constantli continu adapt user behavior locat sacrif privaci refer pc ieee comput pp paradigm reduc inform comput control engin journal pp internet resourc research problem commun pp intellig person spider dynam support system pp solv vocabulari ieee pp wai manag comput pp distribut inform natur pp peopl interact softwar ch mit agent assist web proc intl joint conf artifici august pp ibm clever sourc hyperlink journal person agent proc intl conf autonom agent multiag pp cc smart spider journal american societi inform scienc pp inform discoveri filter multiag evolv ecosystem appli artifici intellig pp evolv inform filter discoveri system autonom agent system pp agent user ieee internet comput pp mj engin pitfal ieee internet comput pp mae softwar human global ieee internet comput pp mn ieee internet comput pp
ML/1379 6 learn control system dissert present submit graduat school massachusett amherst partial fulfil requir doctor philosophi depart comput scienc fl copyright reserv learn control system dissert present approv style content victor chair paul member member georg member sandip member david depart chair comput scienc mother father reddi acknowledg heard distribut ai deepli indebt victor lesser distribut ai research clai intellectu excit collabor life time word address victor sign post lost explor frontier direct die attitud face hard problem person problem fortun member academ sandip paul georg sandip sen guid serv role model friend sandip provid deep insight comment stage research late night confer state field serv spur interest direct express deep gratitud put learn system research map system artifici intellig commun paul utgoff question made notic connect rest research commun area learn read document carefulli provid keen feedback nail home point write make understand arrai distribut ai influenc present idea indebt zilberstein extrem support provid insight relev thesi facet thought make idea crisp avoid write style prof bring perspect contribut balanc treatment topic special susan lander product collabor friendli stage work sue provid team system perform work thesi chapter gave technic assist busi finish patient listen excit idea provid encourag guidanc follow idea thesi ow directli collabor collabor part work reli keith decker gpgp system alan garvei schedul keith easi task ten thousand line lisp code written readi keith lean walk latex coordin keith scholar role model alan garvei schedul essenti success experi learn coordin chang part sourc trust lab affair technic matter grate bart current member dai group norm mike frank dan tuoma thoma bob make group live excit place special dan suffer draft provid critic frank share thesi michel robert effici secretari assist work indebt andersen consult frank critic vi present style drive home import clariti present talk idea associ tremend influenc style write thesi gener peopl realiz good depart comput scienc massachusett exposur finest mind machin inform robot vision life move mit case jaw peer close associ tim oat love collabor shanmugasundaram great fun collabor mohan area interest famili friend usa maintain long process give chanc academ sister sriniva reddi reddi friend bk prasad big parent believ provid emot ow wife provid invalu support process prepar provid comment draft version slack importantli build share tender moment sustain time extrem grate vii abstract learn control system indian institut indian institut massachusett institut cambridg massachusett amherst direct professor victor lesser work present thesi deal techniqu improv problem solv control skill cooper agent machin learn local problem solv control agent interact complex intric wai problem solv control agent agent make effect control base pure local problem solv state effect cooper requir global state influenc local control made agent call influenc cooper control agent pure local view problem solv situat learn effect cooper control global due uncertainti state system rise learn global situat control knowledg agent associ view global situat knowledg learn effect control call form knowledg control thesi investig learn cooper control knowledg agreement research system import abil agent learn improv work repres viii attempt demonstr util viabil machin learn techniqu learn control complex heterogen system thesi empir demonstr effect learn control aspect cooper ffl organiz role organiz role polici assign task perform agent context global problem solv thesi studi learn organiz role parametr design system call ffl negoti search agent overcom partial local perspect problem engag exchang requir develop closest approxim actual composit search space thesi learn method endow agent capabl approxim search requir avoid commun ffl coordin strategi coordin mechan provid agent abil behav coher problem solv situat work present thesi deal incorpor learn capabl agent enabl suitabl subset coordin mechan base present problem solv situat deriv coordin strategi ix tabl content page acknowledg abstract viii list tabl xiii list figur xiv chapter learn system system system learn system learn organiz role heterogen system cooper learn composit search space learn coordin contribut thesi guid dissert review relat work reinforc learn classifi system ebl knowledg refin system robot soccer mutual learn learn system emerg behavior hybrid learner summari learn organiz role heterogen system introduct heterogen design system organiz role distribut search learn role assign result summari cooper learn composit search space introduct distribut search space design system learn effici search conflict driven learn learn result relat work distribut search conflict manag learn coordin gener partial global plan introduct task environ simul model task structur gener graph grammar distribut data process instanti coordin mechan cluster domain knowledg empir explor effect deadlin crisi task effect crisi task effect deadlin discuss learn coordin overview learn coordin form local situat vector form global situat vector coordin strategi experi learn coordin experi synthet grammar grammar grammar xi grammar experi domain experi experi discuss summari futur work learn organiz role learn requir cooper search process learn coordin complex system futur work learn rule potenti rough coordin implement rough coordin develop rough commit domain grammar grammar grammar grammar routin task grammar crisi task grammar low prioriti task grammar refer xii list tabl page tabl averag cost design averag cycl design organiz role team organiz role learn rang organiz role learn rang organiz role learn result potenti organiz role rang situat specif potenti organiz role rang situat specif potenti averag cost design averag number cycl design averag number conflict resolut messag averag qualiti deadlin averag qualiti deadlin averag qualiti grammar xiii list figur page figur goal repres goal ds repres data doubl head arrow goal goal interdepend arrow data goal data requir goal solut goal tree updat distribut goal goal tree previou figur distribut partial replic agent dot arrow interdepend goal data agent conceptu view learn agent steam negoti search local composit search space distribut search space role assign local search space pump agent composit search space pump motor agent view evolut composit solut local composit search space agent control task structur graph grammar rewrit data process problem graph grammar rewrit data process problem overview gener partial global plan xiv coordin strategi obtain cluster coordin strategi distribut data process averag qualiti versu size instanc base averag qualiti versu commun cost grammar coordin strategi chosen mode collag coordin strategi chosen mode collag averag qualiti versu commun cost grammar coordin strategi chosen mode collag coordin strategi chosen mode collag averag qualiti versu commun cost grammar coordin strategi chosen mode collag coordin strategi chosen mode collag averag qualiti versu commun cost crisi tg probabl strategi chosen mode collag crisi tg probabl strategi chosen mode collag crisi tg probabl averag qualiti versu commun cost crisi tg probabl strategi chosen mode collag crisi tg probabl strategi chosen mode collag crisi tg probabl situat versu qualiti learn xv learn system road diverg travel made differ robert road requir cloth henri david thesi deal learn system system reusabl agent learn interact coher learn manag interdepend improv push question effect introduc learn mechan realist agent sophist problem solver interact subtl complic exist machin learn techniqu serv leverag implement agent adapt act coher organ local comput account interdepend activ integr learn techniqu sophist problem solv agent straightforward task requir inform capabl distribut entir set agent agent complet view state system thesi concern util viabil learn heterogen system elucid issu defin explain number term discuss theme relev system begin definit term introduc problem solv distribut version goal tree system impact learn number basic issu area introduc major theme learn system conclud list major contribut dissert system literatur system recent time occupi promin place popular press evidenc debat internet group special interest mail list tricki question resolv satisfact sort tacit consensu commun characterist intellig program exhibit call agent woolridg ffl agent autonom extent behavior determin intern state experi direct human control action ffl process result action agent ti percept environ agent perceiv physic environ comput environ world wide agent act ffl social agent interact human user comput agent mix initi ffl agent exhibit initi act achiev goal behalf user make environ ffl mentalist section commun attribut stronger mentalist notion desir intent agent bodi interest research resort stronger notion agent characterist note term defin proactiv vagu defin research subscrib notion question program spectrum defin characterist program deal program strongli system research system concern studi manipul behavior group agent environ agent perform activ affect affect activ agent environ agent system partial possibl view global problem solv process action implic heart distribut artifici intellig ma concern problem agent perform action wider context problem solv process limit view action includ local task execut inform local state commun model intent belief agent state global problem solv strategi deal dispar conflict view distribut problem solv process search classic goal tree search space problemsolv system node tree repres requir earli distinguish system distribut problem solv system put distribut ai distinct blur dai commun thesi ma dai goal specif paramet option goal specif paramet solut output paramet level effort invest produc solut meet requir goal relat relationship data resourc constrain interrelationship figur origin show goal tree solut sibl goal distant goal constraint interrelationship independ specif goal highli depend exact charact constraint goal level implic achiev goal lower higher level goal relat complex chain interdepend interdepend import note entir goal structur elabor problem solv begin structur dynam evolv agent emerg composit view problem solv process goal task gener problem solv compon individu agent elabor base goal driven combin restrict consist goal structur resourc data figur goal repres goal ds repres data doubl head arrow goal goal interdepend arrow data goal data requir goal solut ground discuss introduc cooper inform gather figur show goal tree updat gather inform relev sourc maintain current inform compani involv environ relat job inform relat area acquir compani inform involv locat relev inform retriev index inform appropri lowest process involv gather data inform repositori rout organ case unstructur gener descriptor map content retriev materi semant domain constrain relationship overlap exist subgoal interrelationship discuss detail paragraph info compani involv info job environ relat area locat environ relat compani site retriev index relev data locat site relev env job updat local retriev index relev data retriev index relev data locat rout net amaz organ feed archiv internet newsgroup job lead report educ gopher server enabl enabl enabl facilit overlap facilit figur goal tree updat easi numer complic involv perform problem solv singl agent scenario agent detect interrelationship sibl goal level tree solv goal goal facilit goal solut qualiti goal interrelationship type decker facilit interrelationship impli valu solut output paramet facilit goal determin option goal specif paramet facilit goal facilit goal pursu option contribut improv search goal achiev process solut partial result facilit goal constraint solut facilit goal make achiev goal fewer resourc higher qualiti enabl interrelationship impli enabl goal produc solut output paramet determin requir goal specif paramet enabl goal overlap interrelationship exist goal share determin solut output paramet favor interrelationship impli plan achiev goal achiev favor goal minor modif chang queri slightli reform queri produc result satisfi goal detect goal interrelationship effici coordin hard problem complex ai figur show overlap subgoal facilit interrelationship inform compani involv activ provid refin retriev larg overlap exist provid inform compani compani maintain list relat organ overlap interrelationship goal involv similar work benefit share partial result enabl agent locat relat compani extract inform updat local case goal tree distribut multipl complet global view goal tree agent model part global goal structur base role problem solv process lead ad complex complex situat discuss figur illustr goal tree figur distribut agent detect coordin relationship agent difficult due partial view goal tree continu figur distribut goal tree agent agent achiev agent achiev agent charg result concurr lead speed make distribut amount inform access larg time limit resourc distribut rise effect manag interrelationship activ distribut maxim benefit inher trait architectur long agent wait inform agent exploit facilit interrelationship achiev kind protocol detect exist inconsist redund data agent agent overlap interrelationship agent ma face act uncertainti lack complet knowledg determin action affect global problem solv process depend charact organ vari complex sophist effici distribut problem solv larg amount domain specif knowledg system typic type amount inform commun resourc data agent agent figur distribut goal goal tree previou figur distribut partial replic agent dot arrow interdepend goal data agent amount time spent local comput versu cooper tradeoff involv local optim versu global optim practic imposs system design anticip code huge number possibl structur problem solv process achiev accept tradeoff system perform potenti oper environ repres tune domain specif knowledg cumbersom time consum view difficulti learn aspect structur problem solv process domain specif knowledg import ma section discuss learn import dai system identifi area incorpor learn benefici assum work definit learn denot system adapt enabl system task drawn popul effici effect time comput central process theori ture machin simul comput system pragmat point genuin ffl natur real world structur problem forc approach discuss distribut schedul system airport resourc manag number servic gate baggag cater agent agent requir meet arriv departur deadlin incom outgo aircraft resourc manag discret agent proprietari knowledg privat privileg forc central solut requir agent give proprietari knowledg requir radic alter social norm peopl work system requir enorm effort make accept system ffl talk promin social system problem domain exist interact subsystem weak neglig inher parallel subsystem make multiag solut time constrain scenario good inform gather amount inform seemingli resourc charg monei access user inform time resourc limit inform gather program nagendra prasad present framework multiag inform gather multipl agent simultan spawn access inform resourc interact meet cost deadlin requir ffl architectur offer separ advantag distribut system agent construct maintain separ agent build agent provid abstract inform sourc ffl fundament central intellig system compon exhibit compon interact compon uncertainti behavior compon benefit techniqu system model behavior compon level ffl addit engin pure intellectu justif studi system ubiquit natur distribut intellig system system appar natur problem solv capabl armi ant scope individu ant human brain result wire larg number intellig constitu element system act commun seek answer question decad dai system date capabl cope adapt uncertainti problem solv knowledg exhibit abil handl emerg context chang role particip robot coloni robot autonom intellig agent cooper avoid interf destruct agent cope emerg dynam problem solv context wear mechan compon chang behavior robot essenti surviv coloni possibl model uncertainti problem solv system importantli equip adapt capabl instanti base chang problem solv role agent initi work adapt system present yokoo system concern perform activ chang organiz structur involv agent monitor perform environ initi individu observ measur perform organiz structur repres long term commit agent organ local handl interrelationship commun order system amen reorgan constant monitor system base perform measur measur cross reorgan initi select organ present context process call organiz exist system perform base major ffl global approach agent monitor global perform system restructur organ ffl base local estim perform initi local restructur neighborhood ffl negoti process consist cycl agent distribut subtask task agent base outcom negoti organ static determin start problem solv rigid structur compar approach case failur except handl mechan invok reorgan place adapt system entail handl uncertainti flexibl strategi incorpor unknown knowledg chang cach benefici experi past problem solv episod activ fall regim learn base set agent learn reorgan effici encount problem solv situat structur similar subset past problem instanc discuss scope learn encompass activ bond gasser identifi basic problem dai research begun address discuss problem learn ffl alloc problem result group intellig agent problem decomposit process divid problem subproblem alloc agent subset agent solv subproblem issu result subproblem produc solut problem work problem formul decomposit contract net address issu problem learn area system learn problem decomposit acquir instanc human oper induct gener instanc learn told human teacher system decomposit specif problem instanc system learn gener decomposit strategi base problem instanc knowledg task ontolog ffl enabl agent commun commun languag protocol commun set intellig agent common languag set common convent work system lack common convent view requir agent lead conflict agent activ system negoti resolv conflict negoti process resolv conflict commun reason agent intent goal involv coercion relax requir order avoid harm interact creat cooper agent endow learn abil past experi reduc negoti make direct arbitr agent solv labor mediat disput manag union arbitr equip learn capabl converg solut quickli imagin simpl mechan classifi goal disput parti set predefin gener categori develop measur parti labor union health club membership work condit number hour work benefit ffl ensur agent act coher make accommod effect local avoid harm interact agent learn intent belief learn task environ agent task environ includ task execut effect task agent execut util system task environ direct impact agent abil realiz implic effect discuss detail gpgp decker learn task environ characterist achiev ffl enabl individu agent repres reason plan knowledg agent order coordin abil model agent goal belief direct impact agent abil reason agent make team player method agent model agent multipl level reason knowledg agent present agent method highlight agent model agent coordin system literatur date deal simpl model incorpor simpl form model order handl complex issu deal model learn plai promin role agent negoti reach agreement disput learn compon passiv observ map goal util agent base develop gener strategi start plai greater role gradual assist negoti compon make direct adept ffl recogn reconcil dispar viewpoint conflict intent collect agent coordin action agent system possess viewpoint situat relat situat abil model reason task environ agent conflict intent agent reconcil dispar viewpoint system demonstr benefit perform kind reason view learn logic extens capabl type system relat local problem solv global context recogn resolv kind uncertainti system lead solut lesser time ffl engin construct practic dai design technolog platform develop methodolog dai agent learn abil dai system move realm credibl real world applic dai system work uncertain dynam environ agent chang behavior base predetermin strategi consid adapt encod strategi complex system practic appeal long run complex system difficult chang lifetim system paramet obtain due privaci reason due lack common languag commun gener mechan learn paramet avoid cumbersom engin strategi tackl situat mathemat techniqu analyz simplifi real life system intract formal analysi heurist estim paramet import learn incorpor system learn system work present deal techniqu improv problem solv control skill cooper agent problem solv control process agent organ comput agent ma face control uncertainti due partial local view problem solv state agent system uncertainti progress problem solv characterist interact expect gener partial result lead global degrad system perform manag effect cooper effect cooper system requir global state influenc local control made agent call influenc cooper discuss design system call team number agent design steam agent expert design compon steam start problem user requir local constraint compon agent conflict requir steam design agent requir power motor compon agent requir hp compon produc agent incompat agent detect conflict negoti agent motor power process negoti aspect cooper control influenc futur search agent involv cooper agent explicit implicit explicitli cooper agent interact exchang inform perform action benefit agent implicitli cooper agent perform action part process action affect agent benefici implicit cooper present sekaran agent learn push box cooper locat agent unawar agent receiv larg reinforc box move locat agent maxim reinforc cooper emerg due fact lead maxim reinforc agent common form exchang inform agent commun agent ma commun agent acquir view problem solv make local influenc global agent perform direct commun indirect commun part process interact agent direct commun involv entail sender receiv commun aim deal system chapter provid exampl member agent set explicitli cooper activ involv direct commun indirect commun achiev observ behavior agent effect indirect commun involv cue behavior perform reason indirect commun bee bee import forag bee stai inform coloni nutrit statu implic kind flower patch chosen forag recruit forag forag deriv inform delai experi food bee unload hive longer food find place store incom wait time hive lot forag unload work present thesi deal explicitli cooper directli commun system local problem solv control agent interact complex intric wai problem solv control agent agent make effect control base pure local problem solv state local problem solv state map multitud global problem solv state agent pure local view problem solv situat learn effect control global due uncertainti state system rise learn global situat control knowledg agent util entir global problem solv state agent commun inform limit comput heterogen phenomena distract agent agent enorm amount problem solv state agent divert comput resourc local problem solv task assimil inform drastic consequ time constrain resourc bound domain phenomenon distract problem incorrect irrelev inform provid agent weakli constrain knowledg lead receiv agent comput heterogen impli agent repres domain control knowledg elimin possibl intim understand problem solv state agent agent understand work agent agent provid detail intern state similar metric similar case retriev bring import commun relev inform suitabl abstract agent call inform situat agent associ view global situat knowledg learn effect control call form knowledg control complex knowledg engin involv provid agent effect control strategi formid imposs task due dynam natur interact agent environ agent appeal machin learn techniqu learn situat specif problem solv control system conceptu view model learn agent present figur learn involv acquir strategi negoti detect coordin increment construct model agent task environ deal aspect cooper ffl organiz role organiz role form organiz knowledg repres polici assign task perform agent context global problem solv process organiz role plai agent intim ti problem solv process distribut agent extent knowledg agent agent state thesi studi organiz role parametr design system call ffl negoti search pure local view composit search space distribut search system lead solut mutual accept agent lead agent commun relev inform augment local view search space global view requir composit solut space agent achiev engag exchang feedback requir develop closest approxim actual composit search lander type search call negoti search thesi present learn method endow agent capabl approxim search requir minim avoid negoti search sacrif solut qualiti time ffl coordin strategi coordin act manag interdepend coordin strategi provid agent abil behav coher problem solv situat includ avoid needless redund provid inform level meet balanc workload agent work present thesi studi learn coordin strategi empir prove util learn organiz role heterogen system extens team develop support integr heterogen reusabl agent cooper distribut search domain system defin integr set softwar select catalogu anchor infrastructur commun control backbon enabl effect cooper parametr design form cooper search variabl valu assign paramet design configur design initi agent creat initi partial assign variabl valu problem context knowledg base learn compon environ commun figur conceptu view learn agent specif agent extend critiqu initi design complet mutual accept particip agent agent plai organiz role distribut search episod role defin task set task perform context solut role agent perform includ initi extend exist partial design critic exist design assign role agent defin solut develop role assign affect effici search process qualiti final solut produc underli reason differ trace part abil agent provid feedback inform agent set characterist individu agent determin interact inform flow agent set determin optim role assign thesi demonstr learn techniqu appli task organ agent set role assign util abil agent cooper learn composit search space search space system team view consist local search space individu agent composit search space system local search space privat agent composit search space share agent local search space defin paramet agent constrain local search agent defin local solut space assign valu paramet local solut problem solv team start agent possess local view search solut space highli lead mutual accept solut ly composit search space agent analyz natur conflict provid feedback agent begin build global perspect global perspect typic complet conflict readili global inform readili share make local implement learn algorithm enabl agent team build partial global perspect constraint exist agent set feedback seri design episod learn inform wai improv solut qualiti perform appli episod control search process intellig multipl episod augment replac runtim commun conflict feedback empir studi shown form learn lead higher qualiti solut gener reduc commun cost design episod declin solut qualiti learn coordin coordin repres pattern interact agent act manag interdepend effect coordin composit search space implicitli defin intersect individu search space agent detail found chapter import achiev cooper agent difficult due local view agent control global implic lead inappropri activ result transmit agent result agent decker agent view pattern activ make inform choic algorithm achiev call coordin strategi singl coordin strategi problem part thesi present learn algorithm coordin algorithm base situat hand reli approach distribut coordin call gener partial global plan decker consist extens set modular coordin mechan subset mechan select reaction characterist observ task environ result verifi subset mechan effect entir set decker current work involv develop learn algorithm endow agent capabl suitabl subset coordin mechan base present problem solv situat develop tool repres complex coordin problem instanti coordin mechan facilit empir studi effect coordin mechan environ reli stochast task structur descript languag gener tool model task structur domain stochast graph grammar captur morpholog regular domain grammar augment attribut captur addit aspect domain semant model agent organ interrelationship function domain distribut data process empir studi effect coordin mechan environ domain model effort facilit subsequ studi power learn task choic coordin protocol learn call test graph grammar repres domain theori empir result strongli superior learn static choic coordin algorithm grammar base abstract model distribut data process task contribut thesi thesi empir demonstr potenti machin learn techniqu address number issu system exploit exist machin learn techniqu studi modifi integr system concern compar perform type learn algorithm learn aspect ma contribut thesi ffl studi learn explicitli cooper directli commun system learn work system concern implicitli cooper agent work repres earliest result demonstr learn cooper heterogen system exchang complex inform section relat work detail coverag ffl recogn learn cooper control explicitli cooper directli commun system thesi show learn control viabl term produc good problem solv strategi deal problem gener abstract term situat show strategi evolv produc qualiti lower cost solut strategi aspect problem solv control ffl thesi empir demonstr learn achiev context aspect problem solv control organiz role design system requir cooper search process coordin complex parametr coordin system ffl attribut stochast graph framework abstract model organ task environ introduc attribut stochast graph framework model morpholog regular task structur domain simultan captur aspect uncertainti number characterist domain model demonstr power model distribut data process domain empir studi organiz design domain discov import limit coordin protocol design detect interact exchang amount inform ffl show util viabil learn heterogen system complex system endow learn capabl learn organiz role requir heterogen parametr design version develop team system learn coordin strategi gener partial global plan system construct studi coordin heterogen agent complex domain distribut sensor nagendra prasad agent system larg granular essenti sophist reason learn organiz role requir context reusabl design agent literatur learn deal system strip bare essenti learn problem state inform infer step work assum homogen agent section relat work detail coverag homogen implicitli provid agent abil predict control agent author deni import studi field learn learn complex system provid challeng interest insight forthcom simpl toi domain homogen agent system ffl concept potenti measur relat action progress introduc context role learn complex effect action relat intric wai end result receiv reinforc assign credit action pure base reinforc difficult imposs due myriad confound intermedi influenc occur action end result reinforc learn algorithm learn complex relationship action effect progress system achiev credit assign polici ffl learn task past work ibl algorithm concentr classif function approxim stanfil studi learn collag extend ibl algorithm task involv select good coordin algorithm cumul measur past perform select coordin strategi set guid dissert chapter discuss broad goal theme dissert rest thesi organ chapter survei relat work learn place work context exist work relat work specif dealt chapter discuss chapter chapter deal learn organiz role parametr design system call chapter formal empir studi distribut search process team process learn requir negoti search chapter deal learn coordin strategi complex parametr coordin system chapter summar research result discuss interest futur work possibl direct research review relat work learn learn hold thought close respect admir feel realiz im dont lesli bridg forev farther stand shoulder giant isaac newton agreement research system import abil agent learn improv aspect long time past year begun attent aspect learn system bodi work relat learn system potenti learn address number issu field chapter review work learn system review meant repres exhaust reinforc learn classifi system literatur learn reli reinforc classifi learn algorithm earliest attempt learn method simpl implement eleg theoret formal algorithm reli weak reinforc learn signal provid feedback environ signal demand term content case numer measur perform system present domain set predat learn surround captur prei escap grid world predat prei stai locat move step east west time step predat reinforc learn agent prei learn agent limit percept tan studi case agent share percept inform overcom limit sensor rang studi share polici deriv reinforc learn exchang episod peer predat result agent cooper share learn knowledg episod inform independ agent sandholm nagendra perform studi domain predat captur prei novic agent learn observ expert type cooper domain part simplic domain explicit cooper learn essenti part prei captur agent homogen system present thesi higher sophist heterogen learn direct commun explicit cooper sekaran present reinforc learn agent learn push box cooper locat agent learn complimentari polici move box start locat goal locat knowledg studi interest learn issu transfer knowledg complementari learn discuss implicitli cooper homogen agent system simpl knowledg physic domain plan capabl knowledg encod learn polici matrix studi learn robot coloni base anim behavior reinforc learn set robot learn social behavior forag gather simpl local interact interact base observ extern behavior interpret role commun minim primarili overcom perceptu limit simpl sensor robot commun involv broadcast posit extern state inform cooper primarili implicit agent capabl embodi similar goal structur agent collect basic group behavior home flock spatial tempor combin basic behavior form compound behavior herd homogen agent import implic control knowledg agent infer agent base extern state inform point homogen group behavior affect irregular behavior individu thesi deal system agent accomplish goal irregular behavior agent global ramif entir agent set introduc concept progress estim akin idea potenti chapter independ develop prasad nagendra prasad addit reinforc reach partial intern critic call progress provid metric improv context specif goal progress estim home behavior posit reinforc distanc home pick movement home gener neg reinforc potenti differ progress estim primarili method speed reinforc learn plai complex role work learn organiz role receiv lead unaccept design explicit exchang inform conflict explicitli cooper concept potenti lead qualiti result speedup devic result chapter role organ result learn potenti qualit potenti sandholm reinforc learn studi implicit cooper iter prison dilemma prison dilemma intens studi problem agent face act cooper entir societi defect act paper studi game agent oppon agent defect sum agent payoff maxim cooper iter prison dilemma agent interact repeatedli polici strategi map agent histori interact agent action agent selfish benefici selfish agent cooper manner evok similar cooper oppon agent maxim discount futur return iter fl sandholm crite lookup tabl recurr net learn polici present seri experi learn agent plai agent fix strategi singl learn agent system learn cooper successfulli agent face difficulti evolv cooper strategi studi varieti issu explor window histori agent make studi obviou insight domain engin complex system unlik system thesi studi implicitli homogen agent shaw discuss classifi system base multiag learn system agent set rule messag list rule trigger present cycl agent base variant holland bucket rule highest bid chosen execut output messag agent strength reduc amount bid redistribut rule messag trigger rule distribut agent agent perform action environ receiv extern reinforc classifi system effect reinforc chain effect action sequenc system test flexibl manufactur domain function framework bid feedback mechan drive learn agent announc task seri oper perform agent system bid perform task base past perform similar capabl announc job readi job win agent strength amount proport bid agent announc task strength amount repres kind market mechan announc agent pai win agent servic amount bid agent genet oper improv reorgan capabl perform job type learn pure local involv cooper control compon flexibl manufactur genet learn capabl map reconfigur avoid unbalanc util cell system explicitli cooper directli kind interact agent complex system dealt thesi mechan effect insul agent control mechan confin interact occur bid process actual problem solv perform oper cooper mechan dynam task alloc task agent work independ announc agent classifi learn concern good task alloc strategi classifi system requir specif requir agent construct homogen reusabl system satisfi requir scheme chapter learn scheme chapter special requir agent chapter ibl learn method exploit requir coordin problem instanc gpgp addit requir relat piec work classifi system learn suitabl hierarch organiz structur relationship present agent learn form dissolv hierarch group group consist compat agent group group leader agent variant bucket algorithm learn hierarch organ algorithm consist ffl group announc highest bid perform oper situat base strength measur oper win group reduc strength oper amount proport bid group won previou state pai classifi mechan discuss work shaw goal state extern reward provid group work process effect stabil sequenc win unit sequenc ffl agent form dissolv group slide window number time unit stagnat strength agent readi form super group agent group group announc compat group decid accept offer send lead merger group involv group place leader group notic strength group fallen threshold learn work similar shaw learn assembl good action sequenc discuss kind commun agent simpl primarili consist bid cooper offer commun affect intern control agent idea test simpl block world domain system learn repeatedli solv block world problem work repres interest step direct organiz learn order gener work hold singl instanc problem block world measur strength oper order situat repres abstract global state block world combin measur framework develop chapter serv basi gener organiz learn present earli result direct extens involv agent develop model agent bid situat view situat limit index model local situat potenti map global situat commun agent improv global view deal group format aspect algorithm work preliminari stage hold discuss ebl knowledg refin system work learn learn earli stage hold learn aspect cooper control statist verif scheme case nagendra lesser prasad hayn nagendra lesser prasad nagendra prasad nagendra prasad repres earliest attempt reason agent contribut composit case assembl treat distribut constraint optim problem conflict resolv search avoid elabor index goal subgoal repres context agent retriev local local knowledg agent cooper search space partial case assembl composit case mutual accept recent work prasad effici search method optim composit case notion global situat local case part work idea test test domain lesser complex kind domain dealt thesi present hierarch planner past plan minim messag plan time base approach distribut hierarch plan system multipl agent coordin consist avoid undo work simpl synchron messag block world domain agent find action agent potenti prevent execut action commun synchron messag agent insert local messag action agent insert messag action prevent execut action messag receiv extend mechan agent store plan synchron sequenc problem solv run plan index initi goal state problem instanc problem instanc occur past plan synchron messag exchang reduc plan time synchron agent agent singl reduc multipl synchron messag plan gener paper present anecdot evid reduc total plan time test case special similar metric dealt limit test case ident past case framework elabor part unclear learn perform reason gener instanc special case agent homogen agent requir planner modif synchron present system develop collect memori coordin present sophist approach learn coordin primit deal domain agent limit knowledg mandat cooper coordin strategi agent plan independ commun execut time find cooper dynam end agent reflect histori problem solv interact extract relev inform store futur deal domain agent differ abil move object truck coordin object heavi singl agent move request agent select reorder activ accommod request coordin consist agent send signal receiv messag wait signal agreement agent summar execut trace remov redund improv avoid ineffici break piec inform trace retain cooper action cooper knowledg agent anticip coordin dynam commun establish literatur earli stage difficult compar system work explicitli cooper directli commun system learn coordin coordin strategi concern question remain unansw exact natur index retriev past suspect situat index local case lead sophist form cooper agent load situat agent select send cooper request agent heavili load task pend request present stage view cooper control explicit system import question remain unansw deal agent retriev separ execut time adapt system push coordin case question techniqu present system agent domain larg number execut time coordin lead work support suffici empir evalu evid anecdot young learn hold good studi learn singl function agent highli special compet make design aspect parametr design agent function estim evalu deal singl paramet point view agent interact post partial develop design natur agent requir larg number interact order arriv mutual accept design brown investig learn reduc interact agent domain deal parametr design spring system consist eleven critic system number similar team learn bear number resembl earlier work learn chapter prasad order reduc number agent learn requir agent predict requir problem situat agent creat case interact agent index design requir agent result steep reduct number arriv design agreeabl agent view problem solv situat chapter simpl design problem specif visibl agent fact suffic aspect design work studi chapter chapter sophist view global agent commun abstract local situat agent develop partial view global problem solv state hayn present studi learn case resolv conflict system domain domain similar set predat surround prei captur grid world main idea work neg case repres conflict situat past problem instanc agent encount situat term board posit neighborhood agent index set move agent led conflict agent encount similar situat avoid default move encount case situat indic conflict deadlock due move move agent conflict agent move locat number captur improv significantli method agent work explicitli cooper implicit cooper outcom agent model group behavior case kind interact agent domain part simplic domain agent homogen work hayn repres attempt empir demonstr power learn cooper control mention thesi deal agent higher sophist heterogen learn agent explicit cooper direct commun sugawara discuss local area system node network segment intellig agent call monitor traffic lan initi agent reli control strategi detect problem control agent exchang detail trace perform compar analysi pinpoint problem network problem due satur low bandwidth link packet storm involv redund compar analysi execut trace agent end low bandwidth link reveal agent modifi control rule check control strategi agent local problem wait avoid redund check problem agent refin control rule work repres earliest attempt learn coordin notion situat abstract global problem solv state concern learn make situat discrimin avoid inappropri coordin strategi learn mechan reli deep domain knowledg agent homogen assumpt compar analysi involv lot domain knowledg method present thesi involv minimum amount domain knowledg engin situat compar analysi involv elabor domain knowledg mean pair paramet network diagnosi domain differ paramet wai map differ order refin control rule difficult problem map differ differ abil agent analyz execut trace agent impli homogen agent type task type network mass deal agent differenti abil task assign unlik studi evid work anecdot byrn discuss knowledg refin agent group set predat differenti capabl hunt set prei captur type prei cooper predat predat detect cooper predat hunt prei request support attack fail due number reason lack proper time predat back minut wrongli attack type prei detect failur lead refin process fault involv misclassif posit exampl action lead gener fault involv misclassif neg exampl lead special posit action success neg execut action inappropri circumst crucial refin process refin facilit coordin interact agent process central mediat solicit refin handl refin request priorit refin altern maintain consist make agent awar relev knowledg agent refin facilit circumv interest issu partial local knowledg agent perform distribut learn work rudimentari stage idea hypothet test realist valid robot soccer recent robot emerg domain gener lot activ learn commun realist version soccer game plai agent simul world team object team footbal goal post oppon team oppon team player prevent happen ball team robot soccer interest domain number reason number agent twenti requir behavior rang pure reactiv action strateg plan benevol agent team adversari agent team discuss repres work robot soccer simpl learn method correl intern paramet extern perform effect pass estim oppon skill level effect pass depend person pass effici uncertainti natur surfac footbal length oppon player guard receiv agent simpl learn techniqu linear regress coordin repres distanc pass amount error develop extern perform model describ learn mechan agent learn behavior ball intercept individu behavior incorpor behavior behavior involv learn behavior base agent field time type agent build call layer learn work domain involv commun involv simpl form commun player announc posit move author acknowledg import negoti form complex time robot soccer hold interest domain spur research advanc learn true complex form strateg plan execut plan failur start attent suspect learn plai import role process mutual learn goldman present mutual learn system deal explicitli cooper directli commun system agent learn agent model domain domain studi control traffic signal intersect agent charg signal road run charg signal road agent coordin signal red time green time agent commun achiev coordin agent learn model traffic distribut agent agent train agent act teacher agent send list wait time sampl valu annot sampl valu action agent list gener wait time action requir red green perform action work similar work chapter model interact cooper agent type agent natur interact complex work complex agent situat knowledg abstract global situat problem specif work present due simpl natur agent model entir environ agent learn system studi relev learn concern selfish agent seek maxim long term payoff studi simpl natur interact agent implicit cooper agent strip bare essenti learn problem interact agent reli assumpt common knowledg environ respond activ agent explicitli awar exist agent readi discuss system sandholm reinforc learn studi evolut cooper iter prison dilemma present relev work carmel discuss learn model oppon behavior pair selfish maxim sum reward repeat game agent simultan perform action encount agent learn strategi histori action system learn base induct finit state automata observ histori oppon behavior oppon strategi model finit state automaton discrep observ oppon action action predict agent model oppon strategi trigger increment updat model agent reinforc learn algorithm learn cooper network agent agent produc collect behavior base reinforc environ global behavior system agent learn perform role collect behavior base reinforc valu evalu behavior system agent explicitli awar exist agent agent agent part noisi environ simpl natur work repres pioneer attempt learn multipl agent crite similar techniqu improv elev dispatch perform emerg behavior recent excit artifici langton led bodi work emerg behavior larg number extrem simpl element engag local interact simpl natur give rise complex behavior type work relat kind system primari concern larg sophist agent possibl larg amount knowledg present repres piec work give flavor issu commonli investig area survei mean claim give reason coverag issu field shoham discuss emerg convent system agent interact pair interact activ lead local adapt paramet determin agent futur behavior larg number common convent emerg agent experi convent agent repres singl bit initi societi larg number agent start agent random convent bit number repeat success emerg convent occur major agent convent bit updat function cumul base number previou good bad interact agent agent convent bit investig agent updat function author design empir demonstr effect number updat rule permit emerg common convent present experi evolut commun cooper societi simpl simul organ call consist local state repres singl variabl integ local state repres part environ global state repres singl variabl integ valu global state repres part environ visibl agent organ model automaton transit rule form repres intern state fl global state local state intern state emiss signal cooper act emiss global environ variabl fl action repres attempt cooper situat cooper act succe local environ state emitt success cooper lead fit involv cooper unsuccess local environ emitt act transit genet learn compon lead breed gener cycl base fit low select replac offspr obtain result crossov oper parent high fit conduct number experi show advantag commun evolut simpl form commun commun achiev random global environ variabl lead poor cooper commun learn lead good fit measur societi simpl form learn transit rule genet oper lead evolut cooper commun strategi global fit societi agent hybrid learner learn system literatur deal task task learn problem solv control system techniqu build hybrid learner multipl learn agent system distribut domain data multipl learn algorithm learn system concern acquir knowledg domain place independ agent collabor improv refin improv consist multipl relat cooper control issu involv function agent develop integr learn agent kind algorithm learn telephon traffic control telecommun network system consist learn learn agent call ebl induct learn agent call learner call reactiv planner call central control call learn coordin manag control flow commun learn agent problemsolv start messag issu agent control action domain agent respond rate scale agent critiqu agent hypothesi rate scale rate averag rate hypothesi select perform data control action notifi agent action perform base feedback domain set action agent learn local secondari cooper form commun occur fbi agent agent fbi agent perform heurist predict classif data learn type hybrid involv adapt agent improv skill found give encourag result term reduc number lost call telephon network present learn system call agent learn local post good central interact board agent organ learn knowledg hierarch experi store hierarchi instanc lowest success level form increasingli higher level gener instanc learn algorithm make hierarchi node hierarchi instanc gener correctli instanc gener incorrectli learn algorithm creat maximum net node instanc current knowledg insert hierarchi specif gener classifi correctli gener node special cover origin instanc exclud instanc node interact agent lead hierarchi agent hypothesi level confid place interact board confirm hypothesi total consist hypothesi total modifi partial consist data hypothesi relev data hypothesi assert withdrawn agent evalu interact board place evalu back board evalu combin special integr function hypothesi highest confid remov interact board assimil agent modifi hypothesi subject iter evalu hypothesi hierarchi agent refin interact agent exploit knowledg structur subject select node collect evalu refin scheme deal integr knowledg learn independ multipl agent agent learn independ pool knowledg singl agent multipl rule learn agent vocabulari part repertoir agent agent receiv rule agent exploit rule develop approach learn vocabulari agent vocabulari primit agent rule commun agent induct learn method call base rel gener gener agent subject problem agent environ term vocabulari agent exchang sensat agent relat local sensat sensat agent gener learn vocabulari agent term local vocabulari hybrid learn system agent learn algorithm central control learn complement knowledg gap system emploi gener agent lazi partial induct learn agent domain learn concept anim featur rule target agent learn cover rule exampl domain knowledg agent fail explain classifi target send messag agent process agent explain target concept complet proof lower level concept send lower level concept agent induct agent case induct learn agent fact present construct tree classifi goal miss attribut knowledg exampl build tree turn lead messag agent provid relev attribut inform evid effect framework pure anecdot issu loop agent commun due miss discuss paper recent work step direct summari work machin learn commun concentr learn algorithm suppli abstractli repres form featur discov regular gener unseen data learn natur emb learn algorithm problem solv architectur coexist aspect local domain problem solv coordin conflict avoid coher group activ incomplet agent view problem solv state lead learn presenc uncertainti learn system lead environ learn agent environ obviat learn knowledg requir agent behavior learn agent learn knowledg lead behavior turn lead possibl learn knowledg make learn system interest challeng problem intellectu challeng requir substanti concert effort resolv essenc learn techniqu deriv exist machin learn problem problem solv architectur extract behavior algorithm presenc uncertainti pose problem offer deep insight ma commun machin learn commun deal learn problem solv agent deal incomplet view learn system deal environ work insight begin emerg ma commun applic gener machin learn commun progress estim effici reinforc learn emerg work thesi chapter present adapt learn algorithm task situat learn knowledg abstract problem solv context gener applic learn system work uncertain environ work hybrid learner develop insight gener applic knowledg hayn discuss case mechan avoid harm interact work learn system categor major ffl hybrid learner structur learn hybrid learn system borrow faithfulli exist machin learn approach goal closer commun agent primarili engag improv skill domain aspect coordin activ simpl knowledg learn independ agent inconsist reach consensu iter exchang local data learn subsystem problem solv edward interact augment local learn process system encount interest difficult problem level abstract learn knowledg exchang data prefer gener agent gener limit data inconsist data differ vocabulari agent affect knowledg exchang refin process ffl learn problem solv control problem solv control system includ number aspect coordin negoti organiz conflict avoid resolut deriv coher team agent grow bodi research begun address issu learn cooper implicitli cooper system toi domain homogen reinforc learn sen sandholm classifi literatur prasad nagendra prasad nagendra prasad knowledg mutual start address issu cooper explicitli cooper system literatur deal system state infer step work thesi distinguish exist literatur deal explicitli directli commun heterogen agent system work complex domain parametr distribut data process agent reli sophist plan search capabl complex state inform learn organiz role heterogen system continu talk repli roman knew discuss interest subject rude oscar remark rocket simpli rai introduct requir reusabl legaci system heterogen agent lead number challeng issu system lander lesser develop team framework examin issu heterogen reusabl agent context parametr design team open system assembl minim custom integr dynam select subset catalogu exist agent agent work specif part problem agent work achiev set local solut part problem mutual consist global relat problem reusabl agent involv system configur situat explicitli anticip time design ad learn compon agent modifi behavior base system configur lead enhanc perform present extens team call learn organ agent plai suitabl role search process construct solut heterogen design system fundament question drive research agenda team project system heterogen reusabl agent interact coher solv search problem requir inform capabl distribut impli system design anticip engin agent avoid potenti harm interact conflict develop time practic reusabl agent conflict inher part problem solv process equip agent conflict resolut mechan team gener framework studi issu conflict resolut mechan kei conflict manag mechan team negoti conflict drive interact agent guid local search agent conflict system due number ffl incomplet possibl knowledg agent ffl lack common languag mutual understood problem solv techniqu ffl differ intent prioriti disput labor manag compani due differ goal due inconsist incomplet knowledg parti involv negoti process iter applic negoti search involv multipl agent search mutual accept solut negoti intuit descript process agent gener agent review agent doesnt reject feedback doesnt agent gener counter agent agent gener review process repeat inform conflict appar agent agent respond conflict increment relax individu prefer mutual accept ground reach appar descript fact agent work subtask agent make compon solut multipl interact compon fact case parametr design domain team agent capabl critic compon design compon agent contribut compon part solut solut composit compon agent system negoti search solut initi agent compon solut system cycl agent extend evalu subsequ system cycl agent simultan develop multipl solut deal instanti team frame work domain parametr design steam parametr design configur design priori system valu paramet configur choic process involv domain knowledg type reason techniqu base argument choic point agent team heurist constraint optim search arriv low cost design agent local requir inform deriv feedback user requir design express constraint constraint implicit procedur constraint declar constraint formal treatment search team explicit constraint team organ hard soft constraint constraint optim constraint satisfi solut hard constraint satisfi soft constraint satisfi extent soft constraint satisfi relax soft constraint level flexibl choic arbitrari relax set constraint lead solut space superset solut space defin constraint steam consist motor power pump turn circul water chamber high temperatur steam inject chamber output steam figur steam consist major shaft compon design agent agent cooper evolv mutual accept design set agent interact interfac paramet interact agent process assign consist valu interfac paramet valu interfac paramet agent design compon steam possess critiqu evolv partial design agent assign consist set valu paramet design attempt minim cost design team global cooper impli local perform measur sacrif pursuit global perform agent produc compon poorli rate local term particip design high qualiti agent design compon seventh agent call frequenc critic agent evalu natur frequenc steam design excess vibrat occur oper motor pump heat exchang water exhaust steam input pump output pump shaft simpli support elast platform drive steam output water sourc figur steam search team perform space partial design initi place problem specif central share memori act repositori emerg composit solut partial visibl agent problem specif simpli assign subset attribut problem specif problem requir capac maximum platform deflect platform side length agent team perform distribut search obtain good design agent search obtain lowest cost design mutual accept agent local state local static dynam constraint design compon local agenda potenti action agent initi base base requir problem specif intern constraint local state base partial design serv anchor evolut rest design design compon produc agent central repositori agent turn extend critiqu futur process cycl form complet design extend partial design blackboard agent consist ad compon design agent agent detect conflict process critiqu extens detect conflict due violat hard solut consid solut path prune conflict due soft constraint solut recogn system solut stage search process solut consid due relax soft constraint attribut solut solut agent opportun critiqu solut aim team produc complet accept solut evolv composit design agent plai set organiz role organiz role repres set task agent perform composit solut agent work composit solut concurr ffl initi solut base problem local requir extern agent produc base plai role solut initi design initi serv search process extens agent earlier reject due initi agent receiv feedback constrain gener base produc qualit multipl agent initi base lead coverag composit solut space lead distract agent weak constraint initi poor base lead rest agent direct work observ distribut system agent find problem specif initi solut produc base relax requir expand search space extern soft requir commun ignor search relax extern agent relax local requir constraint highest flexibl chosen relax case extern constraint chosen constraint import paramet chosen agent order import local paramet ffl extend solut agent plai role partial solut extend evolv solut evalu partial solut initi agent extend agent extend solut search compat solut constrain solut requir requir assign share paramet valu solut result process evalu conflict compat valu partial solut interfac conflict type conflict gener feedback form metainform local search requir detect conflict extens motor send motor feedback type conflict facilit express reason conflict agent understand agent simpli agent receiv feedback agent assimil inform local requir extent assimil feedback agent view agent reorder search problem instanc avoid similar conflict ffl critiqu solut role similar result evalu conflict evalu constraint explicitli repres implicit procedur procedur constraint max end paramet implicitli constrain complex system case implicit constraint easili discern difficult express explicitli enabl agent share agent requir violat constraint explicit implicit explicit constraint share agent detect violat explicit constraint gener feedback agent partial design involv conflict explicit constraint limit simpl boundari constraint form maximum minimum valu paramet share explicit constraint share agent share paramet agent abandon design led conflict pursu design problem solv termin agent reach mutual accept design agent extend critiqu solut process problem agent relax requir move search qualit region solut space relax form relax occur reaction lack problem solv progress result agent move search region search space current team type relax occur specif agent relax solut requir process cycl strategi relax user situat occur heurist wai detect lack problem solv progress trigger relax process relax result feasibl solut solut eventu accept solut accept agent deadlock evolut composit solut team view seri state transit shown figur set agent appli negoti search produc design initi extend solut critiqu solut typic initi solut extend solut critiqu detect conflict soft constraint solut store futur constraint relax agent work solut assum lead unaccept state relax constraint violat made initi solut unaccept solut partial accept solut extend solut complet agent face problem role set role plai complic fact agent achiev choic local view object chapter investig util machin learn techniqu aid process situat set agent involv problem solv necessarili design singl agent result chapter demonstr effect learn techniqu task provid empir support import observ learn credit assign scheme lead enhanc learn consid relat action progress addit end result action true system complex interact involv transmiss inform treat problem solv control benefici detail section organiz role led problem problem specif partial accept solut complet accept solut partial unaccept solut partial unaccept solut complet unaccept solut complet unaccept solut solut initi solut critiqu solut extend solut relax solut termin search intermedi state initi state state figur negoti search rest chapter organ section discuss characterist distribut search space section present upc basi learn organiz knowledg section discuss implement learn version call base algorithm present result empir explor conclud discuss implic work point limit organiz role distribut search problem domain view set interdepend subproblem solut problem construct aggreg solut subproblem partial search path composit search space interrel extens path search space subproblem affect result extend subproblem complex search organ search action lead gener constraint subsequ search solv relat subproblem problem instanc system situat complic fact search space distribut agent organiz knowledg specif search organ term agent plai role search process commun agent effect reliabl handl cooper task organiz role repres form organiz knowledg agent part format composit solut capac organiz role task set task perform context singl solut role encompass role includ oper gener design evalu gener feedback case conflict pattern activ role agent set role assign agent plai organiz turn impli agent differ kind role allot organiz role plai agent import effici search process qualiti final solut produc illustr gener figur show search solut space agent paramet defin local search space paramet common agent darken portion local search space agent local solut space intersect repres global solut space clear agent initi agent greater chanc find mutual accept solut agent extend solut initi agent lead failur due small intersect space versu larg local solut space agent note rel solut distribut search space priori design hand code good organiz role design time cycl agent decid role plai base partial design agent initi design extend exist partial design critic exist design agent decid role assum construct design compon chapter investig effect learn organiz role solut space agent composit solut space agent agent figur local composit search space assign singl organiz role assign good situat agent adapt role suit current problem solv effect search process discuss situat detail learn role assign learn involv explor space role assign develop rate measur role situat formal basi learn role assign deriv upc formal search control reli calcul probabl cost valu final tupl util repres agent estim final state expect util role present state probabl repres expect uncertainti abil reach final state present agent plai role cost repres expect comput cost reach final state valu explicit posit search state respect potenti final state search space complex search upc formal plai role state expand role result problem solver understand interrelationship state role poor choic perspect local control polici good choic global perspect due inform make problem solver properti role refer potenti account rate role evalu function defin object strategi problem solv system base upc compon role potenti system reach final state quickli high qualiti solut maximum util unit cost agent appli evalu function role applic present state search role maxim rate applic role select start core upc modifi suit learn organiz role negoti search system modif involv classif state search finit class situat class situat repres abstract state search upc vector situat role situat repres featur vector valu determin class state search note order valu situat agent commun agent obtain relev inform featur relat intern state agent role index upc valu situat vector obtain relev upc valu role applic current state depend object function upc vector role plai organiz role chosen probabilist ratio rate sum rate organiz role agent situat permit system explor contribut role probabilist learn agent role maximum rate situat impli learn agent organ plai fix role situat approach predict learn learn estim upc vector situat agent collect explor space role assign identifi good role assign situat role assign agent affect state problem solv agent natur search space situat vector featur repres relev activ time agent choic role plai store agent perform measur time complet search sequenc step lead perform measur entir problem solv process agent back trace step assign credit perform role involv exact process valu upc vector role situat agent adjust upc assum singl final state gener complet design mutual accept agent set situat vector agent situat vector permut valu featur set role agent plai composit solut agent vector upc potenti agent ij ij ij ot ij situat object function select role describ learn make system heurist identifi point stop learn switch role maxim evalu probabilist proport rate note learn approach predict learn reinforc learn assign credit mean differ tempor success primarili concern show benefit characterist learn system merit learn method appendix characterist accumul function exhibit learn rule deriv satisfi characterist ab ab ab ot ab ib ib ib ot ib learn max ib ib ib ot ib learn repres role upc valu rate distribut search tree node annot tripl repres role plai agent situat figur set state path termin state termin state state expand due detect success failur final state termin state search end successfulli mutual accept design sequenc role plai agent set lead termin state success fr sm search enter termin perform measur propag back relev agent agent adjust upc valu respect pair scheme adjust perform measur discuss node sf sf sf node sf sf sf node sf sf sf node sf sf sf agent agent agent agent path end result success util path end result incomplet util path end result failur util figur distribut search space role assign wai actual upc potenti valu situat vector discuss simpl scheme ij repres predict util final solut achiev agent plai role state classifi situat accumul problem solv instanc set state path final state repres util solut ff step size ij ij ff ij state situat agent plai role modifi util situat ij repres agent ks estim probabl plai role state classifi situat lead final accumul problem solv instanc set state path termin state output termin state repres success failur ff step size ij ij state situat dwell detail cost compon updat rule evalu function work involv cost design problem solv comput cost primari successfulli complet good design comput cost involv long cost wide dispar obtain measur potenti involv process requir understand system extent activ potenti make posit neg contribut progress problem solv process earlier problem solv agent role lead solut due conflict requir process run conflict lead import consequ exchang constraint violat constraint agent receiv agent aid agent subsequ search episod relat local solut requir global requir role lead conflict inform exchang reward learn algorithm similar util learn potenti role ot ij repres estim potenti role plai agent state classifi situat accumul problem solv instanc set state path termin state ot potenti state ot conflict inform exchang ot ff step size ot ij ot ij ff ot ot ij state situat role tag result execut ad compon partial conflict local requir commun violat local determin potenti sequenc role end conflict result demonstr effect mechan compar domain parametr design steam discuss system built team consist problem solv process start place problem specif central blackboard problem specif consist paramet requir agent decid initi design base problem specif extend partial design bb critiqu partial design bb process extend critiqu agent detect conflict commun conflict agent articul agent commun numer boundari constraint violat receiv agent understand feedback paramet commun constraint assimil inform constrain futur search order avoid stagnat progress local problem solv agent relax local soft constraint level number cycl system termin format mutual accept design agent singl organiz role design mention identifi organiz role learn applic role work confin role agent agent learn initi design extend exist partial design situat agent fix organiz role extend critiqu role clear chose includ learn process experi report situat vector agent compon compon repres view agent system agent receiv extern constraint agent past time unit compon agent agent relax local qualiti requir past time unit compon agent receiv extern constraint relax local qualiti requir natur local search space agent prompt initi design seed blackboard partial design constraint problem solv episod start initi phase gener seed phase exchang inform involv conflict phase search inform inform lead conflict commun exchang initi compon intermedi phase conflict detect exchang compon final initi agent plai role initi design lead discoveri conflict requir exchang intermedi phase enhanc agent view requir local search import note featur base negoti search mechan underli steam domain gener domain parametr design address design problem probabl successfulli complet design obtain high util design primari complex open environ form guidanc problem solver intermedi stage search indirect bear final solut rate potenti learn rate heurist set small util probabl compon potenti compon train randomli gener design requir test team independ set randomli gener design requir team setup pump initi design extend design extend design agent initi design partial design blackboard extend paramet system perform primari paramet cost design produc paramet number cycl system produc cost design team agent turn chanc plai role evolv composit solut cycl number cycl repres good approxim amount search perform entir system import note design cost search cost design cost solut qualiti search cost comput cost design process comput cost credibl function role design problem inform observ repres search effici underli process ran team rang input paramet rang consist platform rang consist lower valu rang repres easier problem chose rang repres problem tabl tabl learn organ rang rang order understand contribut set learn organiz role situat independ manner learn understand negoti search involv effort identifi exact natur interact steam human expert assign good role human natur constraint assign role agent shown tabl rang tabl show averag design cost system team rang tabl show averag number cycl design system team tabl averag cost design rang team rang rang tabl averag cycl design rang team rang rang wilcoxon test reveal differ level cost design produc pair tabl rang team rang test reveal differ number cycl design team rang show differ number cycl design system rang experi suggest situat specif superior specif superior team term cost design produc search team system significantli team term number cycl point detail question perform term cost turn function relationship paramet easi problem gain sophist mechan tabl organiz role team agent pump motor shaft platform frequenc agent agent agent agent agent agent critic role initi initi extend extend extend extend extend extend critiqu tabl organiz role learn rang situat agent pump initi initi initi initi initi initi initi agent extend extend initi agent extend extend extend extend extend extend extend extend motor initi initi agent extend extend extend extend extend extend extend agent extend extend extend extend extend extend extend extend extend shaft agent extend extend extend extend extend extend extend extend extend platform agent extend extend extend extend extend extend extend extend extend frequenc critic critiqu critiqu critiqu critiqu critiqu critiqu critiqu critiqu critiqu head constrain set accept commun due restrict inform singl numer constraint commun discuss section initi design design captur relationship paramet pump initi design overwhelm number design initi outperform initi situat vector possibl captur subtleti case initi motor earli search led quicker discoveri conflict requir share paramet problem run perform attribut observ phenomenon distract frequent observ context role phenomenon map abil agent judg effect work design respond design gener tabl organiz role learn rang situat agent pump initi initi initi initi initi agent extend extend extend extend initi initi agent extend extend extend extend extend extend extend motor initi initi agent extend extend extend extend extend extend extend agent extend extend extend extend extend extend extend extend extend shaft agent extend extend extend extend extend extend extend extend extend platform agent extend extend extend extend extend extend extend extend extend frequenc critic critiqu critiqu critiqu critiqu critiqu critiqu critiqu critiqu critiqu tabl organiz role learn agent pump motor shaft platform frequenc agent agent agent agent agent agent critic role initi extend extend extend extend extend critiqu member agent set present situat true situat vector adopt suffici discrimin elimin distract total investig role potenti compon evalu function set experi train evalu function potenti system learn organ shown tabl tabl system test problem specif test previou experi tabl show result box entri default valu agent plai role situat success solut system learn discrimin role agent chose role plai situat default tabl result potenti rang cost cycl rang rang rang potenti perform ident organ tabl similar initi heat initi design situat rare occur rang potenti perform significantli potenti potenti fact potenti lead gain system perform bring import observ complex system case system perform action indirect bear final solut requir identifi action reward learn system lead enhanc perform tabl organiz role rang situat specif potenti situat agent pump initi initi initi initi initi initi initi initi agent extend agent extend extend extend extend extend extend extend extend extend motor initi initi agent extend extend extend extend extend extend extend agent extend extend extend extend extend extend extend extend extend shaft agent extend extend extend extend extend extend extend extend extend platform agent extend extend extend extend extend extend extend extend extend frequenc critic critiqu critiqu critiqu critiqu critiqu critiqu critiqu critiqu critiqu tabl organiz role rang situat specif potenti situat agent pump initi initi initi initi initi initi initi agent extend extend initi initi agent extend extend extend extend extend extend extend motor agent extend extend extend extend extend extend extend extend extend agent extend extend extend extend extend extend extend extend extend shaft agent extend extend extend extend extend extend extend extend extend platform agent extend extend extend extend extend extend extend extend extend frequenc critic critiqu critiqu critiqu critiqu critiqu critiqu critiqu critiqu critiqu summari previou work effici distribut search control involv simpl agent simpl interact part work present chapter repres attempt demonstr viabil util form system involv complex interact agent set open system reusabl heterogen agent parametr design agent learn organiz role situat negoti search mutual accept design situat gross abstract global problem solv state agent associ measur probabl potenti role situat learn measur process explor space user requir observ perform role test system steam design domain empir demonstr produc result requir elabor knowledg engin organiz role agent set contribut work learn organiz role experi previou section taught import lesson ramif issu learn system gener ffl situat kind organ system work insight step exploit learn techniqu provid system organiz knowledg techniqu acut system construct set reusabl agent ffl note perform significantli evalu function potenti role make indirect contribut final solut complex recognit exploit action potenti result learn process observ encourag system design end result seri action scheme role inform relationship action progress process work organiz role serv earliest indic power learn control organiz role limit form organiz knowledg system complex number agent grow organ system control combinatori interact organiz structur reduc option agent avoid combinatori natur interact hierarch organ human system classic import direct work left beg studi learn complex form organiz structur chapter initi step direct agent notion situat specif learn form hierarch group solv problem repeatedli group format heurist introduc notion situat specif agent form agent part hierarchi situat situat gener learn organiz knowledg problem instanc categor instanc class situat pertin learn system discuss final futur work relev context cooper learn composit search space farther back farther forward winston churchil introduct studi techniqu appli multiag system agent learn requir problem solv discuss chapter ubiquit problem system cooper search techniqu problem constrain inform distribut agent set individu agent perceiv search space bound local constraint constraint agent system problem easili address repres form explicit constraint collect process central algorithm compel reason build system make agent simpl agent complex system repres combin declar procedur knowledg captur set explicit constraint agent oper independ solv subproblem task individu solut integr global consist solut agent local view search space avoid produc subproblem solut conflict agent solut make intellig manag conflict occur formal negoti team learn process compar perform long term learn method address local perspect problem techniqu agent accumul appli constrain inform global problem gather result agent problem solv problem instanc techniqu classifi problem instanc appropri index retriev constrain inform appli problem instanc techniqu present context team configur present previou chapter remaind chapter organ section formal view distribut search space section briefli review team system discuss detail previou section introduc learn mechan enhanc search section present experi result end discuss relat work section distribut search space search fundament concern artifici intellig entir search space confin singl logic search central distribut search involv state search oper control partit multipl agent recogn distribut search framework understand varieti issu system distribut multipl agent requir search synergist solut mutual accept satisfi constraint global solut constrain inform distribut agent set individu agent perceiv search space bound local constraint constraint agent system distinguish local search space composit search space local search space privat agent defin domain valu paramet constrain local search set local constraint problem defin local solut space subset local search space agent ffl paramet ij respect domain ij valu ix defin local search space agent domain set discret real label interv ij paramet share paramet belong paramet set agent repres set agent paramet part paramet set fa paramet share paramet iff ffl hard constraint hc ij repres solut requir satisfi local solut agent produc time ffl soft constraint sc ij repres solut prefer agent time soft constraint violat modifi affect abil agent produc global accept design set hard soft hc sc defin local solut space constraint satisfi hard constraint necessarili satisfi soft constraint satisfi extent soft constraint vari flexibl softer relax agent satisfi oe problem respect strategi relax soft constraint ik discuss strategi adopt team relax soft previou chapter ik local solut agent consist assign valu ij ij paramet ij local solut util measur attach facilit select prefer solut solut prefer solut util util defin notion project section formal descript learn algorithm local solut fp ix ix set paramet defin project fp ij ij ij xg solut space project defin exampl steam design illustr definit agent team paramet set shade area figur show local solut space domain legal valu set simplifi view search space pump design shade area repres domain region paramet tupl specif solut search space figur local search space pump agent exampl simplifi expositori actual agent team paramet constraint explicit declar implicit procedur explicit constraint limit singl numer boundari implicit constraint involv multipl paramet procedur max end soft constraint team level flexibl constraint level repres highest prefer repres hard agent satisfi constraint higher level solut satisfi constraint higher level prefer multipl design compon satisfi number constraint highest compon cost chosen composit search space cs share search space deriv composit local search space agent desir solut space system subset composit search space paramet composit search space consist fp gk gg ij gk ij gk ij gk paramet set composit space repres featur design constrain composit search space domain paramet set deriv intersect domain paramet agent paramet share paramet figur show agent team system agent involv paramet set pump paramet head share paramet rest uniqu individu agent composit search space cs paramet head requir solut composit space mutual accept valu share paramet head design system section briefli summar descript team chapter sake continu team parametr design system produc steam consist agent design compon steam evalu local search space pump agent local search space exchang agent composit search space solut composit space figur composit search space pump motor agent team distribut search system agent design compon steam possess critiqu evolv partial design agent constrain local search base local paramet produc compon local state local static dynam constraint design compon local agenda potenti action search team perform space partial design partial design repres partial solut composit search space initi place problem specif central share memori act repositori emerg composit solut partial visibl agent design compon produc agent central repositori agent initi base base problem specif intern constraint local state agent turn extend critiqu form complet design evolut composit solut team view seri state transit shown figur composit solut agent appli set oper repres set arc leav state agent work composit solut concurr learn effici search problem solv team start agent possess local view search solut space limit perspect search agent avoid produc compon conflict agent compon section introduc machin learn techniqu exploit situat lead conflict avoid similar conflict futur conflict driven learn cdl present negoti search reinterpret process form learn provid formal basi learn mechan discuss pure local view agent lead composit solut mutual accept agent attempt extend critiqu partial detect design violat local constraint set paramet share agent ij agent extend critiqu solut detect conflict iff ij ij explicit constraint violat share agent agent detect violat gener feedback agent partial design involv conflict exchang feedback requir agent develop approxim composit search space includ local perspect explicit constrain inform assimil agent type view learn told exchang inform appli search current problem instanc lemma show exchang cdl improv agent view composit search space problem specif partial accept solut complet accept solut partial unaccept solut partial unaccept solut complet unaccept solut complet unaccept solut solut initi solut critiqu solut extend solut relax solut termin search intermedi state initi state state figur view evolut composit solut set constraint commun feedback agent time detect conflict fc fc ae lemma view composit search space conflict inform assimil refin previou respect relev portion actual composit search space proof lemma base simpl observ observ set constraint observ set variabl constraint defin observ hold composit search result constrain effect constraint agent base observ easi prove proper assum set feedback constraint fc fc fc impli agent commun fc detect conflict respect constraint partial solut contradict cdl work constraint involv conflict commun agent partial design prove fc true observ fc design lead conflict abandon agent pursu design enhanc knowledg composit solut requir figur show simpl share paramet system explicit constraint exchang iter process conflict detect explicit constraint agent approxim agent solut space share paramet shown lower part figur altern explor present team involv intellig backtrack earlier stage evolut offend design backtrack solut space agent agent agent composit solut space percept bs space bs percept space figur local composit search space exchang explicit constraint agent find mutual accept solut presenc implicit constraint share explicit constraint lead conflict exchang time result view agent composit search space approxim true composit search extent agent local view approach global agent effect learn agent learn predict composit solut requir base past experi endow agent capabl learn accumul local view composit search space requir design run view learn inform retriev futur problem instanc learn agent perform search learn discuss end agent store problem specif constraint receiv feedback agent approxim requir composit solut space problem specif agent learn suffici larg train replac process assimil feedback learn knowledg problem instanc present agent retriev set constraint store past problem specif similar present problem specif add set local requir start search agent avoid commun achiev approxim composit search space unlik chapter limit weak view situat global user requir defin local domain constraint constraint similar past case case base pc pc set constraint past similar problem identifi similar metric team problem specif normal problem specif retriev normal perform maximum minimum rang case base past problem instanc add constraint store instanc addit constraint local solut problem water flow rate minimum head head requir power constraint form paramet repres lower upper bound paramet valu boundari paramet flexibl level constraint agent commun constraint learn result empir demonstr merit learn composit present describ search strategi relat figur show control logic agent team solut solut repres role plai agent repres role agent present opportun current agent extend design initi agent repres assimil constraint commun agent previou cycl order demonstr merit learn experi search strategi ffl blind search learn appli agent detect conflict design pursu agent commun inform figur modifi agent control strategi state absent link lead state absent extens solut extens solut exist termin search termin test satisfi extern initi initi solut extend solut conflict detect start cycl commun explicit constraint conflict assimil info assimil info partial accept solut extend solut critiqu solut critiqu solut assimil info initi learn knowledg figur agent control ffl learn agent detect conflict gener feedback assimil recipi agent recipi conflict inform constrain futur search singl design extend altern design state absent figur agent control strategi ffl learn agent accumul case start awar constraint agent commun agent detect conflict design pursu agent algorithm find case similar present problem solv instanc initi requir constraint case minor modif remov link lead state figur agent control strategi ran algorithm case base team system experi agent initi design extend exist partial design extend design critiqu partial design agent chanc perform oper cycl number cycl repres good approxim amount search perform entir system problem specif consist paramet problem solv termin agent produc mutual accept design train cbl system randomli chosen instanc test search strategi set instanc train instanc tabl show averag cost design produc algorithm tabl show averag number cycl design tabl show averag number feedback messag requir agent arriv mutual accept design tabl averag cost design blind cdl tabl averag number cycl design blind cdl tabl averag number conflict resolut messag blind cdl wilcoxon test reveal cost design produc team cbl cdl lower produc team blind search level test reveal differ cost design produc team cdl produc team cbl cbl produc slightli design cdl cdl perform blind search initi run conflict gain view composit search space exchang feedback conflict cbl start problem solv good approxim global solut space requir manag cdl result demonstr learn learn improv solut qualiti process time compar blind search learn cbl requir commun note cdl requir learn phase question occur reader learn method mechan learn learn turn behavior search start inform view begin requir obtain learn accur specif problem learn system reli approxim knowledg requir similar past problem turn mechan shortcom order mechan function strategi handl conflict requir cbl knowledg requir power cdl knowledg requir power experi simpl strategi cdl knowledg favor cbl knowledg independ level flexibl conflict constraint yield result significantli mechan run mechan turn mechan run reason perform attribut distract effect approxim knowledg cbl accur cdl learn effect experi direct suffici make broad claim recogn experi sophist strategi resolv conflict learn knowledg involv flexibl import paramet constraint stage search conflict detect relat work chapter summar relat work learn relat work specif chapter literatur distribut search conflict manag distribut search distribut search explicit focu research small group dai research past year introduc distribut search unifi framework varieti issu distribut problem solv reli cdl versu cbl formul learn problem problem subproblem solv agent system solut problem obtain aggreg solut subproblem subproblem interdepend local search space agent interrel organ search activ agent local search space affect search activ agent conri sycara investig issu distribut search implicit piec work assumpt agent homogen local knowledg tightli integr strategi agent attempt develop formal descript distribut search algorithm asynchron backtrack preprocess procedur distribut consist algorithm distribut constraint modifi iter asynchron backtrack algorithm distribut constraint abstract hierarch search distribut constraint optim local state space search heurist search distribut constraint optim local graph search conri present negoti protocol distribut constraint satisfact problem agent progress gain understand effect local negoti inform assimil produc solut mutual accept exist agent initi make tent commit set altern announc intent turn confirm commit make local compat commit agent arriv global altern process solut found agent local tent commit process repeat sycara describ system decentr constraint heurist search schedul domain agent commun local demand profil resourc develop heurist textur measur variabl order variabl tight textur focu local search agent type depend direct backtrack call distribut asynchron perform effici backtrack show analysi abstract resourc requir agent agent reduc uncertainti local search schedul activ develop textur measur call effici search distribut system measur uneven distribut local measur variabl tight agent recent work build previou work attempt develop theori subproblem interact exploit design effici distribut problem solver conflict manag conflict manag approach similar conflict driven learn mechan present discuss work conflict manag detail develop theori comput model resolut conflict group expert agent base studi human cooper rest kei gener conflict resolut exist separ instanti specif conflict resolut advic context conflict conflict advic resolv conflict conflict class activ precondit satisfi strategi base set conflict resolut advic activ conflict class deal encount conflict klein work gener foundat handl conflict design applic system fall short conflict resolut mechan larger problem solv context involv studi issu solut inform exchang learn present strategi call progress negoti resolv conflict system agent provabl converg mutual accept solut exist converg reli crucial explicit declar exchang constrain inform system aggreg complex agent repres combin declar procedur knowledg captur set explicit constraint presenc implicit constraint lead break kind progress negoti offer work investig role learn improv effici distribut search set heterogen agent parametr design experi suggest learn drastic improv search result experi show agent reli past problem solv experi problem instanc predict kind conflict encount avoid commun feedback conflict case learn team view interim vehicl investig import issu concurr engin distribut design cdl mechan team adapt downstream constraint product design cycl brought bear assess earli altern cdl mechan suit ce system captur impact made phase product life cycl set declar cbl mechan team view rudimentari form autom captur design captur includ identif document design potenti cbl mechan team reli exploit violat constraint lead conflict past similar problem requir avoid disagr current design process futur area investig reason method perform sophist captur design process learn coordin gener partial global plan good idea stai dog work year make success eddi introduct coordin process effect manag interdepend activ distribut agent deriv maximum benefit decker base structur uncertainti agent tempor order activ mitig effect harm interdepend exploit benefici interdepend research human comput organiz theori point singl organ coordin protocol environ human factor dynam task uncertainti strong effect coordin action accept outcom effect observ pure comput organ decker nagendra prasad nagendra prasad achiev effect coordin system difficult problem number reason agent local control activ inform commun inform inappropri suboptim due limit view interact activ agent order make inform control agent acquir view task structur agent extent resolv agent uncertainti problem solv act coher agent expend comput resourc acquir exploit view agent activ involv commun delai comput cost provid inform assimil inform agent inher uncertainti agent activ cost reli sophist coordin strategi acquir view task structur worthwhil situat coordin protocol permit level activ avoid addit overhead coordin lead decker nagendra prasad sugawara agent sever time pressur load activ agent sophist agent coordin strategi gener payoff agent flexibl problem time benefit awar deriv coordin situat deal agent learn coordin strategi coordin problem instanc empir demonstr narrow class agent learn coordin strategi base global problem solv state outperform singl coordin strategi problem instanc order accomplish break coordin problem phase agent exchang inform directli coordin inform agent deriv predict effect coordin mechan present problem solv episod mechan differ amount inform acquir complex analysi interact activ agent agent subset coordin mechan coordin base inform enter phase ii coordin strategi select phase decid type detail inform exchang kind reason local activ agent perform achiev coher behavior inform abstract global view problem instanc call situat phase process call coordin learn coordin involv associ view global situat knowledg learn effect coordin mechan agent cooper system learn coordin proactiv resolv uncertainti global problem solv state situat learn global view rest chapter organ review task structur complex coordin problem describ stochast task structur descript languag illustr power show model distribut data process problem introduc gener partial global plan flexibl power achiev coordin exploit problem instanc introduc learn algorithm learn candid famili coordin strategi empir demonstr effect number domain environ task environ simul framework environ decker repres coordin problem domainindepend detail domain abstract essenc basic coordin problem choic tempor order action captur base abstract import task domain repres multipl wai accomplish progress achiev interact activ problem instanc effect activ perform system model aspect coordin complex state function rate accept necessarili binari deadlin task subtask solv independ isol multipl wai accomplish task tradeoff qualiti result produc time produc result qualiti refer accept characterist tempor decker task distribut multipl agent interdepend subproblem agent incomplet possibl outdat view task agent interact local task agent lead seek satisf agent miss inform agent simultan contribut multipl goal contribut multipl agent achiev goal summar framework section discuss agent coordin mechan reli problem instanc achiev type coordin model coordin problem instanc repres set task group task repres set relat arriv time deadlin structur task group elabor problem task structur node task structur graph call task root task denot task children call execut method short subtask task children root task figur show simpl task structur task structur actual exist arbitrari interrelationship make gener graph reason graphic notat describ context task group reader urg gener structur mind kind perform criteria base tempor interv task execut qualiti result execut qualiti term instanti environ set perform qualiti assum scalar quantiti defin complet cost desir aspect result task execut execut task lead number interact task affect execut start time deadlin task task group qualiti time construct qualiti subtask time qualiti function domain semant dictat form qualiti function arithmet specif deal qualiti function descript close exposit interest reader find detail exampl discuss function sum averag ffl qualiti task minimum qualiti subtask complet subtask task achiev qualiti refer ffl qualiti task maximum qualiti subtask complet subtask task achiev qualiti refer enabl facilit figur task structur lowest level task subtask execut method repres domain execut blackboard knowledg run instanti execut piec code data smallest schedul entiti task structur paramet defin execut ffl current maximum qualiti achiev execut time durat ffl current durat method time ffl number time unit spent execut execut start time finish defin ffl qualiti time method qualiti accumul potenti monoton function popular approach anytim monoton garvei garvei result task complet work deal model model framework restrict defin potenti effect task agent method agent method initi maximum qualiti durat time method task start execut method finish potenti affect execut effect qualiti chang durat chang deal common class effect extens studi effect occur method agent call coordin relationship enabl task enabl method execut task produc result requir input paramet method maximum qualiti complet result execut commun agent maximum qualiti schedul execut method enabl st return earliest time qualiti cross threshold facilit task facilit method execut task produc result affect option paramet method method execut result task avail result constraint execut lead improv qualiti reduc time requir facilit effect paramet call power oe oe effect durat avail oe oe oe oe algorithm heurist subset qualiti time produc schedul maxim qualiti deadlin cooper goal agent work produc highest qualiti task group agent base current belief maxim expect global perform measur local perform degrad agent partial incomplet view actual task structur subject view constitut belief agent current problem solv instanc problem solv control reli view action execut task structur gener decker decker illustr import extens empir studi determin role coordin strategi task environ studi reli weak task environ gener limit set numer paramet task structur depth varianc number interrelationship task structur rise wide rang task structur huge varianc type capabl system handl effect real applic involv infinit varieti task structur domain semant dictat limit morpholog task structur bound random highli regular model task structur coordin problem instanc paramet depth branch factor introduc graph grammar base task structur specif languag power model topolog relationship occur task structur repres real life applic briefli introduc graph grammar extens tradit graph grammar captur domain semant topolog relationship show model data process captur task structur grammat specif graph grammar graph grammar power tool number captur underli structur regular offer structur describ topolog relationship entiti domain graph grammar fundament similar string differ ly product graph product tripl subgraph replac hand subgraph insert place host graph transform number scheme graph grammar primari differ differ scheme tradit literatur graph grammar deal attribut valu node edg stochast product attribut captur number aspect domain semant addit topolog relationship entiti stochast product add power model potenti grammar captur aspect uncertainti domain call grammar attribut stochast graph grammar graph set vertic refer set edg node edg label attribut stochast graph grammar defin nontermin node alphabet termin node alphabet mutual disjoint respect set start label node finit nonempti set graph product graph product hg graph deriv rewrit graph involv call locat subgraph isomorph product establish area remov edg incid replac emb host graph figur show simpl connect connect connect product rewrit figur graph grammar rewrit rewrit stop node label termin alphabet set result graph consid member famili graph gener sake expositori clariti deal attribut distribut data process exampl section show instanc attribut extens definit graph grammar involv partial edg product link local label label host time applic product edg link node label time due rewrit host graph termin graph reach node hang edg remov point distribut data process function agent organ deriv domain distribut data process involv number geograph data process center center conduct type analysi task stream satellit data arriv perform data regular interv perform incom data probabl prioriti begin dai probabl low prioriti analysi involv perform special analysi specif archiv data type analysi task prioriti center attend analysi perform data time handl task process center limit resourc conduct analysi incom data deadlin result process data center commun center due interrelationship task center order begin analyz stream satellit center result relat analysi center question consid domain coordin center provid fairli simpl driven coordin standard oper complex algorithm commit gener partial global plan approach model coordin strategi vari sophist discuss data process problem repres task structur repres domain semant data process problem process interchang figur show data flow problem consist facilit enabl discuss previou soft interrelationship result process task start durat method achiev crisi analysi perform analysi depend extern situat reduc qualiti hard interrelationship impli result process start process problem figur leav task structur show method task figur show graph grammar task structur avoid attribut shown figur number attribut qualiti termin earliest start time termin time method qualiti durat attribut method distribut repres aspect uncertainti underli domain featur grammar lead larg varieti semant task structur structur varieti limit graph product tg data flow taem task structur figur data process problem model domain graph gener task structur repres type oper perform incom data grammar activ regular interv arriv time probabl type low prioriti task structur grammar activ probabl prioriti task time achiev crisi task higher final qualiti routin task achiev routin task higher qualiti low prioriti task task deadlin basic determin polici center repres amount process time center process data figur show interrelationship type process task investig experi task distribut agent shown rectangl demarc agent framework graph grammar base gener repres easili explor task domain connect connect connect qualiti fn max probabl attribut tg figur graph grammar rewrit routin crisi low prioriti figur data process problem instanti coordin mechan show effect learn coordin extend coordin framework call gener partial global plan gpgp flexibl modular method recogn creat tailor coordin strategi characterist task environ structur extens set modular coordin mechan subset mechan mechan invok detect featur environ interdepend problem solv activ agent coordin mechan configur wai deriv coordin strategi gpgp learn set mechan configur human deriv coordin strategi problem instanc environ demonstr environ subset mechan effect entir set mechan prasad present learn call endow agent capabl suitabl subset coordin mechan base present problem solv fix subset problem instanc environ agent view local coordin modul belief belief agent repres subject view present coordin problem instanc agent knowledg task structur task interrelationship decker agent believ time simpli repres agent belief facilit interrelationship coordin modul modul local schedul commit serv constrain set feasibl schedul commit repres contract achiev qualiti deadlin coordin modul notic task structur belief number activ gather inform task structur commun inform local belief agent receiv inform make retract commit work account commit provid coordin provid schedul maxim global util measur coordin modul number mechan notic featur task structur belief react wai describ mechan independ combin paramet set lead coordin strategi mechan requir type inform oper set coordin amount commun overhead coordin vari interfac coordin mechan local schedul bidirect permit coordin modul crucial abil util obviou describ learn algorithm detail describ detail give feel approach simpl adopt figur show agent agent partial subject view task structur task structur belief shade task method method task agent exist coordin relationship end agent agent exist facilit relationship agent enabl relationship coordin mechan call detect exist interrelationship lead exchang relev portion local task structur agent lead state shown figur mechan exploit hard soft coordin relationship invok agent local task facilit task agent make local deadlin commit complet time minimum qualiti commit commun agent potenti exploit build local schedul agent expect time receiv result execut task unit time account commun delai coordin mechan gpgp respond detect featur lead exchang inform agent post constraint schedul modul control produc schedul mechan gpgp describ detail ffl mechan updat viewpoint agent subject view current episod partial mechan enabl agent determin local inform commun agent coordin modul local schedul local schedul coordin modul agent belief belief max min max max min max max min max max min max max min max max min max finish qualiti violat altern finish qualiti violat commit deadlin qualiti commit deadlin qualiti finish qualiti violat schedul constraint schedul altern commit deadlin qualiti commit deadlin qualiti commit object task group subject task group object task method environ subject agent task min local task qualiti function min subtask relationship enabl relationship local method execut facilit relationship durat qualiti finish qualiti violat idl schedul altern schedul constraint figur overview gener partial global plan enabl updat partial view relev inform polici global view agent polici partial view polici explan agent inform agent perform effect coordin polici enabl agent commun coordin privat task context extent agent detect interrelationship agent set task method privat believ agent task group arriv time privat coordin fr privat task task agent coordin relationship exist local task unknown task set view mechan commun privat coordin privat task context ffl mechan commun result avail result execut method agent effect agent method execut result commun coordin mechan polici commun result satisfi commit relev polici inform minimum polici final result task polici commun result ffl mechan handl simpl redund set redund method agent randomli chosen execut send result interest agent agent commit execut redund agent refrain execut mechan present gpgp simpl method agent execut redund method redund method uniqu identifi method lexic smallest identifi chosen execut ffl mechan handl hard coordin relationship hard coordin involv relationship impli execut obtain qualiti hard coordin mechan examin current schedul method predecessor hard coordin relationship local social agent execut deadlin agent method successor end hard coordin relationship post commit constraint earliest start time method mechan est est earli set hard predecessor coordin relationship dl commit time dl satisfi time dl gpgp creat commit predecessor side coordin relationship time earli min est ffl mechan handl soft coordin relationship soft coordin involv oe oe relationship impli execut durat factor oe qualiti factor oe mechan function manner similar previou previou commit creat predecessor side coordin relationship mechan independ set set coordin strategi learn strategi larg set cumbersom suggest wai prune search lead manag set distinct coordin ffl cluster entir set strategi perform space prototyp instanc cluster agent perform number dimens total number method number termin time ffl domain knowledg prune set coordin strategi small number interest distinct strategi cluster idea exploit broad characterist famili strategi reduc search set mechan machin learn algorithm coordin strategi obtain combin paramet set mechan discuss group fewer set distinct class base perform wide rang task structur decker explor famili perform space coordin strategi base perform measur gener random task structur random environ ran coordin strategi collect perform total number method number termin time perform measur task structur repres standard normal form number standard deviat environ statist coordin strategi summar summari case perform measur hierarch cluster algorithm join complet produc prototyp coordin strategi figur ffl balanc mechan detect soft hard coordin interrelationship commun relev result turn relev partial view exchang agent detect interrelationship result satisfi commit exchang ffl simpl hard soft coordin mechan exchang relev partial view result obtain due task execut broadcast agent ffl myopic commit mechan view ffl tough soft coordin balanc ffl mute hard soft coordin mechan commun whatsoev domain knowledg knowledg identifi set coordin mechan result distinct coordin strategi suitabl specif domain deal distribut data process domain strategi data flow rough coordin strategi result hard soft simpl result hard soft myopic result hard soft tough result hard soft mute result hard soft balanc figur coordin strategi obtain cluster routin domain expert real balanc coordin strategi design decker sophist coordin strategi exchang minim inform exploit coordin relationship agent task structur strategi vari level sophist exploit commit mean achiev data flow rough coordin exploit tacit priori commit balanc coordin reli dynam gener commit discuss strategi figur balanc agent coordin action dynam form commit relev result gener specif time commun agent commit made agent schedul local task maxim qualiti base commit made ensur commit agent satisfi agent relev view coordin detect coordin form commit commun commit result data flow agent commun result perform task agent agent exploit result commit agent agent case facilit result arriv start facilit task recipi agent task enabl start execut receiv result gpgp characterist obtain turn coordin relationship exploit turn mechan view detect commun result rough coordin similar balanc commit commun agent agent approxim idea agent complet task commun result base past experi form tacit social contract agent complet time task unrealist expect commit low probabl crisi task low prioriti task follow tacit priori rough commit coordin type rough commit routin task behav data flow crisi low prioriti task agent relev view coordin detect coordin rough commit routin task commun commit result view rough commit social law empir explor effect deadlin crisi task present experi intend demonstr effect model tool ran set appendix detail rough coordin implement result hard soft balanc result hard soft dataflow result hard soft rough figur coordin strategi distribut data process experi set task structur grammar distribut data process domain discuss section vari paramet model effect coordin mechan manag activ center experi report involv learn present demonstr model tool facilit explor subtl interact domain demonstr coordin strategi situat experi reveal coordin strategi perform domain condit effect crisi task probabl center crisi task vari shown tabl cell tabl show qualiti averag run paramet set low prioriti task arriv probabl routin task time arriv deadlin fix time unit experi lower valu crisi task probabl balanc perform rough wilcoxon test level probabl rough strategi perform significantli crisi task probabl initi counterintuit closer examin run reveal reason commit mechan implement gpgp commit predecessor end interrel agent successor end agent commit crisi task structur figur time agent commit schedul crisi task commit agent latest time result execut task schedul method result agent advantag commit process delai execut method late agent execut method enabl result experi lead import gener observ sophist perform coordin strategi suffici appropri commit flow direct predecessor successor coordin strategi wast comput commun resourc lead inappropri behavior tabl averag qualiti deadlin crisi tg data flow balanc rough probabl effect deadlin ran set experi vari crisi task probabl set low prioriti task probabl set routin task time data arriv result experi shown tabl cell tabl show qualiti averag run paramet set balanc perform significantli coordin mechan higher deadlin initi deadlin time unit led averag qualiti balanc rough due subtl interact coordin mechan schedul deadlin time agent lower qualiti method lower durat perform task deadlin time higher qualiti method schedul activ agent coordin predecessor delai higher durat method long affect abil execut enabl method provid result time deadlin time averag qualiti time enabl method complet tabl averag qualiti deadlin deadlin data flow balanc rough discuss experi highlight fact stochast task model framework flexibl power model domain distribut data coordin problem instanc repres task structur earlier work learn prasad reli weak task environ gener task structur gener randomli control weak specif depth task structur number task interrelationship rise wide rang task structur huge varianc type coordin capabl system handl effect learn algorithm show modest gain prasad present learn coordin system exploit task structur achiev coher coordin problem instanc gener captur interact activ domain system learn coordin realiz commun organiz theorist situat coordin literatur deal dynam coordin strategi base situat present learn call learner multipl agent abstract coordin problem instanc coordin strategi class strategi discuss previou section overview learn algorithm fall categori learn involv subject system seri run obtain set situat vector system perform set coordin strategi coordin strategi run set problem instanc facilit explor rel perform strategi system configur train phase build set agent complet agent past instanc coordin strategi coordin problem instanc futur global perform agent system past similar instanc aid choic coordin strategi learn coordin learn collag involv run system larg number train coordin problem instanc observ perform coordin strategi instanc task structur agent subject view task structur base subject agent form local situat vector local situat repres agent assess util react characterist environ assess potenti gpgp mechan direct bear type coordin strategi coordin episod agent exchang local situat vector agent local situat vector global situat vector agent choic coordin strategi choic depend kind learn mode ffl mode agent run coordin strategi note rel perform coordin problem instanc agent run tough mute coordin episod store perform ffl mode agent randomli coordin strategi coordin observ store perform coordin strategi agent coordin strategi coordin repres number time neighborhood small radiu present global situat agent learn retriev set situat small radiu present global situat tabul number time coordin strategi repres set lowest obtain balanc coordin strategi space global situat mode algorithm develop noisi knowledg run coordin strategi problem instanc mode sampl larg number point featur space run problem instanc mode algorithm initi stage explor stage exploit learn inform studi collag setup typic onlin learn explor exploit high agenda futur work end run coordin episod select coordin perform system regist repres vector perform measur total number termin time work present cost schedul time schedul consid neglig compar execut time method easili gener account form coordin overhead number call schedul total number method execut view futur direct research learn involv simpli ad instanc form perform coordin strategi problem solv situat train phase build set triplet agent global situat vector abstract global problem solv state choic note begin problem solv agent commun local problem solv situat agent agent aggreg local problem solv situat form common global situat agent form ident build global situat vector commun learn algorithm similar learn classif learn learn choic choic process present end form local situat vector situat vector abstract coordin problem effect coordin mechan discuss compon deriv valu appar avail bidirect interfac schedul permit question crucial discuss compon situat vector ffl compon repres approxim effect detect soft coordin relationship qualiti compon perform agent creat virtual task structur local task structur facilit coordin relationship potenti affect local task effect order achiev agent detect facilit interrelationship affect task local task end facilit relationship arrow agent expect interrelationship affect task exact task agent affect commun figur agent local task facilit task agent view commun result execut task facilit method arriv start durat method reduc oe maximum qualiti oe virtual task durat qualiti facilit method replac oe oe call schedul back schedul virtual task structur agent produc virtual task time assumpt facilit relationship detect task potenti affect affect task structur schedul call task structur repres effect detect facilit obtain ratio qualiti produc schedul facilit relationship qualiti produc schedul facilit relationship fac qualiti effect facilit facilit note ratio approxim actual effect facilit interrelationship actual problem solv highli facilit interrelationship exploit full strength ffl compon repres approxim effect detect soft coordin relationship durat compon perform form method similar discuss durat schedul form virtual task structur fac durat effect facilit facilit ffl compon repres approxim effect detect hard coordin qualiti local task structur agent obtain manner similar facilit interrelationship agent creat virtual task structur local task structur enabl coordin relationship potenti affect local task effect impli method enabl interrelationship enabl virtual task structur pass schedul agent produc schedul virtual task time assumpt enabl relationship lead qualiti method affect durat larg enabl qualiti effect enabl enabl ffl fourth compon repres approxim effect detect hard coordin relationship durat compon perform form method similar discuss durat schedul form virtual task structur enabl durat effect enabl enabl ffl compon repres time pressur agent time pressur agent lead schedul adher deadlin requir qualiti higher higher durat method prefer lower lower durat method achiev task order estim time gener virtual task structur local task structur agent set deadlin task task method larg schedul virtual task structur agent schedul local task structur set actual deadlin time pressur obtain ratio schedul qualiti actual deadlin schedul qualiti larg deadlin time actual dl ffl sixth compon repres load form method similar discuss time pressur durat schedul form virtual task structur time schedul time pressur repres amount work agent ideal condit time pressur make agent work deadlin work deadlin find method fit chunk time load obtain load actual dl form global situat vector agent commun local situat vector agent agent local situat receiv form global situat vector number composit function experi report averag local situat vector global situat vector compon compon averag compon local situat vector global situat vector low compon repres larg qualiti gain detect coordin hard interrelationship sophist coordin strategi call balanc found perform situat global situat vector low valu sixth compon high time pressur load present problem solv episod agent sophist strategi time benefit simpl coordin strategi simpl scenario situat subtl obviou exampl difficult human situat easili predict strategi perform specif kind task structur occur domain strategi design practic altern entir featur instanc normal rang maximum minimum featur entir order avoid similar metric favor featur coordin strategi collag coordin strategi base set strategi perform similar past case adopt notat case triplet ri set situat repres abstract coordin set coordin choic set result run coordin strategi coordin strategi choic made base similar past case outcom decid desir strategi defin similar function util function experi present euclidean metric similar describ theori norm theori human behavior make adopt crucial differ motiv structur work primari concern descript theori human make develop concern primarili build comput system base theori desir coordin strategi determin sum util yield similar past case small neighborhood present situat vector observ averag process neighborhood present situat vector robust nearest possibl averag process sensit set past similar case problem threshold threshold fm ag util defin jm experi learn coordin complex system gpgp learn layer number potenti vari larg number paramet creat huge explor space experi design long term goal includ explor portion space work present primarili interest show learn feasibl benefici futur work touch number issu intend investig system environ agent execut sequenc interrel method execut method util agent maxim total util agent partial view global problem solv situat execut method posit neg affect execut method agent agent commun augment partial view detect interrelationship method schedul local method avoid exploit coordin protocol exchang amount inform vari level detail note problem solv situat coordin strategi experi demonstr learn global situat control knowledg lead effect choic coordin strategi class altern util primari perform paramet strategi evalu messag agent commun agent penal util small amount denot comm cost achiev view potenti lead higher qualiti add util util qualiti commun comm experi size mode learn determin plot perform averag instanc randomli gener size commun cost figur show order fit data perform versu size grammar discuss detail commun cost show variat explain regress fit observ figur perform improv size mode collag agent size mode collag agent train achiev averag perform similar mode collag agent averag perform instanc figur averag qualiti versu size instanc base experi synthet grammar test collag synthet environ gener grammar synthet grammar repres domain theori ground real life applic present result test collag grammar repres distribut data process domain agent system agent partial view task group environ task collag agent form local situat vector commun agent enabl global view problem solv process agent form global situat vector index instanc base past experi good coordin strategi present tough coordin strategi grammar mode learn collag involv train instanc mode learn involv train instanc figur show averag qualiti run coordin strategi commun cost curv mode mode learn algorithm lie coordin strategi perform wilcoxon sign rank analysi test differ level averag perform strategi commun cost upto test commun test reveal differ learn strategi mode mode coordin indic assert high confid perform learn algorithm commun cost static famili coordin strategi note commun cost perform learn algorithm high commun perform learn algorithm fall mute learn agent unit commun publish local situat vector cost commun local situat vector overwhelm benefit deriv choic coordin strategi commun cost high perform mode mode learner hand mute coordin gave perform figur give number coordin strategi type chosen test run commun cost mute overwhelm favorit high commun cost problem mute choic grammar grammar similar grammar structur distribut qualiti durat leaf method grammar mode learn collag involv train instanc mode learn involv train instanc figur show averag qualiti run coordin strategi commun cost curv mode mode learn algorithm lie coordin strategi part grammar wilcoxon sign rank analysi averag perform strategi commun cost upto reveal differ learn algorithm mode mode coordin strategi assert high confid perform learn algorithm commun cost static famili coordin strategi grammar commun cost perform learn algorithm high commun perform learn algorithm fall mute mode learn averag perform fact fall mute test commun cost justifi cost vari dai averag util commun cost mode mode balanc mute simpl tough myopic figur averag qualiti versu commun cost grammar mute tough balanc simpl figur coordin strategi chosen mode collag mute tough simpl balanc myopic figur coordin strategi chosen mode collag commun cost commun cost high perform mode learner higher mute mode learn algorithm fell closer examin figur show mode collag chose mute instanc mute good coordin strategi led perform commun cost mode collag chose commun intens coordin strategi lead poorer perform train mode case rectifi situat note stop train mode perform mode learner commun cost diverg perform occur commun detect learn note grammar grammar differ distribut qualiti durat leaf method figur mode mode behav slightli differ figur mode robust commun cost varianc mode figur mode robust commun cost varianc mode suspect attribut fact mode algorithm develop noisi knowledg run coordin strategi problem instanc lead advantag grammar mode sampl larg portion featur space run problem advantag grammar grammar grammar interest case studi mode learn collag involv train instanc mode learn involv train instanc figur show averag qualiti run coordin strategi prove huge agent term task structur grammar averag util commun cost mode mode balanc mute myopic simpl tough figur averag qualiti versu commun cost grammar mute balanc myopic tough simpl figur coordin strategi chosen mode collag mute simpl myopic balanc tough figur coordin strategi chosen mode collag commun cost curv mode mode learn algorithm ident tough li curv tabl show averag perform strategi commun cost examin hundr problem instanc case case notic interest perform characterist absenc commun balanc tough perform ident collag balanc case tie balanc tough commun cost tough chosen balanc unit commun balanc averag instanc commun requir balanc chosen default perform coordin strategi higher commun mute perform instanc learn algorithm chose mute correctli instanc tough perform instanc strategi instanc margin perform collag agent requir addit unit commun form global situat vector decid tough strategi choic notic differ averag perform collag tough comm cost lesson learn grammar overwhelm favorit perform famili pai collag determin perform addit situat commun stick favorit awar situat yield good perform statement grain salt case warrant choic strategi give superior gain strategi addit commun case environ produc grammar tabl averag qualiti grammar cost mode mode mute balanc myopic simpl tough averag util commun cost mode mode mute balanc myopic simpl tough figur averag qualiti versu commun cost grammar tough balanc mute figur coordin strategi chosen mode collag tough balanc mute figur coordin strategi chosen mode collag experi domain section discuss result empir explor effect vari deadlin crisi task group arriv probabl base note coordin strategi situat achiev good perform intend demonstr power collag coordin strategi situat perform set experi vari probabl center crisi task set crisi task group arriv probabl set set low prioriti task arriv probabl routin task time arriv dai consist time slice time unit deadlin fix time unit experi system consist agent data process learn coordin strategi experi mode learn involv train collag instanc mode learn involv train instanc figur show averag qualiti run coordin strategi commun cost curv mode mode learn algorithm lie coordin strategi part perform wilcoxon sign rank analysi test differ level averag perform strategi commun cost upto test reveal differ learn algorithm mode mode coordin indic assert high confid perform learn algorithm commun cost static famili coordin strategi case synthet commun cost perform learn algorithm slope perform rough coordin strategi smaller avoid commun form commit figur give number coordin strategi type chosen test run commun cost balanc perform learn algorithm high cost learn algorithm unit commun form global situat vector commun cost mode learner mode learner averag balanc produc averag perform experi mode learn involv train collag instanc mode learn involv train instanc figur show averag qualiti run coordin strategi commun cost upto perform coordin strategi unlik environ previou experi commun cost depend environ averag util commun cost mode mode dataflow balanc rough figur averag qualiti versu commun cost crisi tg probabl balanc dataflow rough figur strategi chosen mode collag crisi tg probabl balanc rough dataflow figur strategi chosen mode collag crisi tg probabl experi perform balanc collag agent exploit learn static coordin strategi long commun cost wilcoxon sign rank analysi reveal differ level learn algorithm mode mode coordin strategi commun cost high perform mode learner mode learner rough coordin gave averag perform discuss experi provid strong empir evid benefit learn coordin true task structur gener domain case domain theori repres task structur gener domain collag good coordin strategi project past similar experi newli perceiv situat collag agent perform singl coordin strategi instanc grammar cost incur addit commun detect global situat offset benefit coordin strategi base global ground learn knowledg grammar distinguish fact varianc choic coordin strategi tough case mute perform perform tough close highlight fact learn benefici dynam environ summari research shown singl coordin mechan good situat literatur deal dynam coordin strategi base problem solv situat present averag util commun cost mode mode dataflow balanc rough figur averag qualiti versu commun cost crisi tg probabl rough balanc dataflow figur strategi chosen mode collag crisi tg probabl dataflow balanc rough figur strategi chosen mode collag crisi tg probabl collag inform form abstract coordin problem instanc learn coordin strategi class strategi phase agent exchang local situat abstract view problem instanc form global situat global situat guid learn subsequ exploit learn coordin knowledg experi provid strong empir evid benefit learn coordin mention model overhead learn account commun cost cost schedul time schedul consid neglig compar execut time method collag gener straight forward manner account sophist model coordin overhead number call schedul total number method execut import direct agenda futur research experi issu touch rel import featur situat vector perform system directli translat weight vector weight featur base import wai determin weight vector system design assign weight base practic approach interact featur valu situat vector subtl approach involv drop featur observ degrad system perform system perform degrad drop featur import method gross estim effect featur learn weight featur fact develop algorithm learn weight perform initi experi set larg result show improv experi number weight learn function improv collag direct futur work briefli discuss approach weight learn broad intuit remain investig varieti function specif weight modif collag mode form usual weight function effect similar match learn mode learn weight learn modul make pass entir instanc base select instanc target instanc retriev neighborhood vector neighborhood instanc ti perform coordin strategi maximum perform coordin strategi ni ti featur similar move nearer ratio similar featur valu weight featur mean similar wt ff util ff fi small posit constant maximum perform coordin strategi ni ti featur similar move farther similar weight function make weight case work excit kind question challeng uncov result obtain import question suitabl level abstract situat determin specif instanc base domain transfer import concern collag scalabl number coordin altern learn phase intens size enorm respect mode integr method progress refin situat vector chapter learn reli deep domain knowledg agent homogen assumpt learn refin situat base explan compar analysi problem solv trace initi idea involv map problem domain independ coordin problem develop gener techniqu reason avoid knowledg engin gener instanc develop sophist formal theori compar analysi learn techniqu tackl scalabl problem organ access detect region insuffici learn direct learn randomli sampl problem space advanc scalabl problem make faith onlin version mode collag number train instanc involv explor exploit interleav explor probabl approxim order magnitud run system learn agent form ident design agent form coordin strategi configur set gener scheme mind agent coordin manner subset agent coordin strategi lead agent agent part group lead scalabl number agent larg number common situat vector lose detail situat coordin option deal issu inconsist conflict knowledg format amount learn group run sit arthur godfrei futur work travel thing true success labour robert complet journei recent interest learn system led work learn structur problem agent learn domain learn problem solv control system thesi concern aspect deal system cooper explicitli direct commun local activ agent global implic agent partial inform order achiev coher activ group agent resort cooper control activ exploit organiz knowledg negoti strategi coordin mechan briefli recapitul contribut dissert learn cooper control knowledg summar accomplish gist contribut thesi recognit global situat learn local cooper control activ implic global situat abstract global problem solv state deriv local problem solv state agent observ environ support observ indic gener ground control knowledg explicitli cooper directli commun ma learn capabl incorpor realist search coordin system learn organiz role organiz role repres assign set task perform agent context solut kind organiz role assign agent crucial effect search effici solut qualiti system system integr set agent assembl feasibl expect agent assign role chapter empir demonstr effect learn organiz role system call system heterogen reusabl agent agent perform asynchron distribut search obtain good design agent local state local static dynam constraint design compon local agenda potenti action agent compon design goal agent produc mutual accept design search perform space partial design start problem specif blackboard visibl agent agent initi seed base problem specif local requir design place blackboard agent extend critiqu process detect conflict conflict detect lead feedback relev affect search prune reorder path learn organiz role involv evolv credibl function base probabl potenti measur altern role agent role situat role instanti situat base probabl potenti measur reinforc learn techniqu accumul measur test system steam design agent learn choic organiz role result demonstr organiz knowledg ground global situat lead design harder specif organ organiz role assign introduc concept potenti plai import role reflect determin suitabl role agent situat empir demonstr organ potenti produc design learn requir cooper search process chapter deal learn cooper search parametr design system formal search process team distribut constraint optim search defin notion project view search space respect set variabl project share variabl agent deriv agent view agent local search space view incompat agent local search space lead conflict consequ feedback process composit search space feasibl solut li deriv intersect project agent local search space respect variabl design agent learn agent constraint composit search space respect share variabl perform local search effect contribut accept compon final design framework formal studi type learn cooper search negoti search formal short term learn method learn formal long term learn method bypass negoti search cach past experi term kind conflict encount result feedback agent shown chapter learn method perform significantli learn learn method achiev perform commun reli past conflict knowledg similar design requir empir result demonstr power learn acquir aspect cooper control weak notion design requir suffic studi notion situat evidenc studi chapter chapter learn coordin complex system chapter deal learn import aspect cooper coordin strategi studi chapter base gener partial global plan algorithm laid set domain independ coordin mechan achiev effect manag interdepend activ system work area empir show effect learn coordin learn method enabl agent exploit inform global problem solv state coordin strategi fix class strategi agent form local situat vector predict effect detect coordin load time pressur agent agent exchang situat form global situat vector repres abstract global problem solv state agent situat vector form instanc base store rel perform coordin strategi situat agent similar instanc past approxim rel perform coordin strategi problem instanc experi reveal learn agent perform coordin strategi problem instanc studi learn learn learn belong distribut data process task synthet learn algorithm perform coordin strategi problem instanc lack varianc coordin algorithm made worthwhil incur addit commun situat exploit learn knowledg process test insight learn creat attribut stochast task structur descript languag gener tool abstract model coordin activ domain framework captur morpholog regular domain task structur simultan model domain semant number attribut rewrit rule tool model nasa distribut data process domain studi issu function organ learn coordin creat number synthet domain test insight learn conclud learn effect dynam domain varianc effect coordin strategi larg ibl method task theoret choic coordin strategi ibl method past primarili confin classif task function approxim task futur work tough make futur work thesi lead interest question view work pass unifi theori learn system complex cooper system discuss issu pertin specif piec work chapter chapter chapter chapter discuss learn complex form organiz role agent evidenc sophist human studi direct end chapter discuss initi learn learn complement point studi varieti conflict resolut mechan agent type option resolv inconsist type learn knowledg point possibl extend learn mechan serv basi captur complex form design end chapter issu attent provid learn weight featur situat vector enhanc perform system issu scalabl collag dimens size number agent attent number coordin strategi explor space situat vector deriv manag suffici discrimin achiev structur organ number agent mechan form global coordin mechan subset agent gener context import question mind ffl agent design agent mention chapter detail discrimin situat lead inform learn part agent cost pai detail situat impli control cost term packag assimil inform part agent import futur direct work investig situat design principl appeal autom method abstract knoblock learn method sugawara knoblock discuss system call automat gener abstract systemat drop liter origin problem definit immedi obviou work extend system problem definit problem solv control necessarili express declar method relat system expect provid inspir search wai automat gener situat abstract work sugawara interest agent start weak notion coordin gradual learn evolv situat base failur driven learn learn method appeal knowledg intens learn compar trace method strong assumpt deep domain knowledg homogen problem solv process order facilit comparison spite work serv good start point explor learn situat interest line thought involv exploit idea anytim commun type qualiti result improv time system determin stop point base limit comput resourc result stop point longer anytim algorithm qualiti result distribut qualiti result versu qualiti problem solv control versu discrimin power aspect situat effect detail learn algorithm return result figur graph show respect qualiti learn versu power discrimin aspect situat discrimin power util gain figur situat versu qualiti learn ffl good learn number studi learn algorithm utgoff neural reinforc genet classifi work chapter learn numer measur good situat form learn classifi system achiev agent role bid activ highest bidder select role lead good solut strengthen work chapter ibl paradigm learn neural net iti learn algorithm ibl algorithm weight featur system agent control state space search oper search appeal learn mitchel techniqu learn problem solv control aspect cooper control task execut resolv express oper span search elabor possibl problem solv control activ learn search control system lead effici problem solv control iter conflict resolut sequenti reactiv applic conflict resolut oper replac learn ebl obviat sequenti applic oper creat effect applic oper singl applic main intent work compar perform algorithm fact featur environ learn task suitabl learn algorithm ffl method hold selfish selfish agent give inform agent local agent ly local closer examin reveal direct extend work selfish agent agent agent inform agent reveal extent work benefit futur agent cheat agent obtain situat scheme selfish agent negoti exchang form coalit benefit situat learn control system selfish agent remain unexplor interest direct research recent work learn explor radic end spectrum situat specif learn nagendra lesser prasad nagendra prasad nagendra prasad deal multiag reason agent contribut composit case assembl composit case achiev distribut search process assembl conflict resolv cooper search avoid elabor index goal subgoal repres context li major differ learn system present thesi work nagendra lesser prasad nagendra prasad order overcom agent augment process exploit past knowledg lazi search search avoid uncertainti priori ground global situat recent work prasad tackl interplai end spectrum li middl preliminari result prasad strongli understand interplai plai profound role evolv gener theori learn possibl shed light complex system interact compon question answer jame learn rule potenti learn rule chapter potenti measur base intuit properti present properti prove learn rule satisfi properti assum pass learn achiev system learn search result problem solv instanc updat util particip node learn updat rule satisfi intuit predict util state remain real number bound artifici advantag solut util grow unbound search perform higher util final predict accumul measur pass situat util oper situat subsequ pass search perform lower util final predict accumul measur pass situat util oper situat subsequ pass repres predict util final solut achiev oper state classifi situat accumul problem solv instanc search set state path final state util solut ff learn rate ff situat agent appli op modifi util op situat easi equat satisfi discuss properti util updat scheme exhibit discuss util iter order clutter present iter min min minimum maximum solut util proof induct assum iter start min true iter learner min max appar min min min min min ff min proof max similar line omit util solut iter similarli util solut iter deriv learn rule similar line updat estim learn rule desir probabl valu agent situat appli oper particip success solut path probabl situat increment subsequ iter agent situat appli oper particip unsuccess solut path probabl situat decrement subsequ iter repres probabl oper state classifi situat lead final acc problem solv instanc search set state path termin state output termin state repres success failur ff learn rate situat equat satisfi discuss properti probabl updat scheme exhibit proof similar discuss util updat scheme omit discuss probabl iter rough coordin implement rough coordin order implement rough extend exist set mechan gpgp hard soft coordin relationship mechan modifi inact rough rough commit agent belief past experi organiz knowledg hand agent design system paramet agent rough coordin option add rough commit belief set activ commit note agent predecessor side commit commun successor agent successor side deriv commit agent rough commit add set activ commit agent agent add commit rough rough rough rough earli rough commit soft coordin relationship treat similarli develop rough commit number wai agent develop rough commit agent endow rough commit domain expert agent learn past experi experi rough agent reli approach develop rough commit agent coordin strategi form commit dynam case time qualiti commit develop averag time qualiti commit varianc number run run qualiti result rough commit deriv averag qualiti standard deviat qualiti time deriv averag time standard deviat time domain grammar appendix specifi grammar experi learn coordin syntax grammar note grammar specif string grammar graph grammar rewrit rule impli node graph replac subgraph task subtask interrelationship field specifi addit type edg exist task attribut includ qualiti accumul method qualiti accumul agent agent method time gener task paramet distribut initi maximum durat method initi maximum qualiti method deriv grammar grammar grammar routin task grammar crisi task grammar low prioriti task grammar refer learn algorithm machin local model control movement advanc neural inform process system page learn sequenti make learn comput mit press learn statist cooper comput element human cooper network unit neural network comput page solv approach plan dynam environ phd dissert depart comput brown read distribut artifici intellig morgan kaufmann san softwar concurr engin ieee learn relat term multipl agent environ current trend artifici intellig io refin world workshop adapt learn august oppon model system workshop adapt learn august resolv global inconsist distribut sensor model agent interpret twelfth intern workshop distribut hidden syntact structur lazi partial integr gener partial evalu ninth intern machin learn page multistag negoti distribut constraint satisfact ieee transact novemb control coordin distribut problem solv network eighth intern joint confer artifici page august hierarch distribut environ sixth intern joint confer artifici page august framework organiz distribut network phd dept comput improv elev perform reinforc learn advanc neural inform process system mit dynam optim team reinforc learn agent phd dept comput distribut approach workshop agent learn taho juli negoti metaphor distribut problem solv artifici januari formal framework agent coordin forthcom technic report gener partial global plan algorithm intern journal intellig cooper inform june quantit model complex environ intern journal intellig system decemb special issu comput model model characterist agent quantit model complex comput task environ eleventh nation confer artifici page juli design famili coordin algorithm intern confer page san june aaai press extend blackboard architectur approxim process journal environ center analysi design coordin mechan phd dept comput environ center analysi design coordin mechan phd addit ag algorithm learn system cooper system june partial global plan coordin distribut problem solver tenth intern joint confer artifici august predict coordin problem solver dynam domain seventh nation confer artifici page st august negoti task decomposit alloc partial global plan distribut artifici vol ii pitman publish coordin distribut search hierarch behavior space ieee transact novemb heterogen machin learn system special interest group cooper organiz view distribut system ieee transact januari armi collect intellig american organiz design prepar knowledg aaai fall page schedul ieee transact schedul ieee transact man interfac schedul cs technic report social concept knowledg action artifici theori journal page august approach coordin multiag interact twelfth intern joint confer artifici page august mutual learn system workshop adapt learn august learn design accept present aaai spring symposium learn multiag person juli learn case resolv conflict improv group behavior adapt natur artifici system michigan ann properti bucket algorithm intern confer genet algorithm page organiz approach adapt product system eighth nation confer artifici progress strategi resolv conflict cooper distribut design conflict resolut septemb robot world cup initi workshop entertain page august support conflict resolut cooper design system ieee transact captur design concurr engin team ieee abstract hierarchi plan ninth nation confer artifici understand role negoti distribut search heterogen agent thirteenth intern joint confer artifici page august ijcai share guid cooper search heterogen reusabl agent comput scienc technic report ieee transact knowledg data distribut search heterogen reusabl system phd dept comput artifici life redwood artifici life redwood organ environ harvard distribut model experi ieee transact decemb overview distribut ai distribut search journal societi artifici retrospect view distribut problem solv ieee transact synthet etholog evolut cooper commun adapt interdisciplinari theori coordin center coordin scienc technic report mit sloan school textur control distribut problem solv work note aaai workshop cooper intellig san share interpret partial result distribut problem solv system ph june kin group behavior fifteenth annual cognit scienc societi page learn behav social intern confer simul adapt behavior reward function learn eleventh intern confer machin san learn search control approach kluwer academ unifi view machin grammat approach engin part research engin correl intern paramet extern learn soccer agent workshop interact organ multiag decemb prasad nagendra distribut case base learn forthcom technic prasad nagendra learn coordin gener partial global plan aaai spring symposium learn aaai press prasad nagendra learn experi heterogen system workshop adapt learn august prasad nagendra retriev reason distribut case base ieee intern confer system man octob prasad nagendra explor organiz design case studi distribut data process intern confer decemb aaai press prasad nagendra learn organiz role heterogen system intern confer decemb aaai press prasad nagendra retriev reason distribut case base journal visual commun imag special issu digit march tutori bibliograph survei graph grammar graph grammar applic comput scienc lnc page exploit inform distribut schedul system nation confer artifici seattl juli nagendra cooper inform distribut problem solv approach comput scienc technic report journal softwar special issu develop agent base induct tree machin design convent autom ai page fall learn error pdp research parallel distribut page artifici modern approach englewood structur plan behavior american reinforc learn repeat prison dilemma coalit format bound ration agent intern joint confer artifici page system coordin learn experi unpublish work grammar pattern recognit graph grammar applic comput lnc page bee coloni american learn coordin share inform twelfth nation confer artifici page juli aaai learn adapt dai system distribut artifici volum page emerg convent initi result observ synthesi social law artifici agent societi tenth nation confer artifici page san juli extend learn multipl issu model machin learn machin learn page framework learn seventh intern confer machin page scienc artifici mit machin machin artifici intellig page pp morgan organiz model organiz chang workshop ai theori group conceptu empir page juli reason commun inform organ california collabor learn robot soccer world cup soccer novemb learn coordin plan twelfth intern workshop distribut hidden past plan distribut plan intern confer page san june aaai press learn predict method tempor differ machin distribut constrain heurist search ieee transact negoti distribut artifici vol page pitman publish reinforc independ cooper agent tenth intern confer machin page tree induct base effici tree restructur machin learn improv algorithm increment induct tree eleventh intern confer machin page learn coordin action system thirteenth intern joint confer artifici page aug studi distribut machin learn organiz design technic report institut tu framework analysi sophist control interpret system comput scienc technic report intellig theori practic knowledg engin distribut satisfact formal distribut problem solv twelfth confer distribut comput june anytim algorithm intellig system ai
DB/1380 3 confer advanc inform system septemb partial complet tupl set deduct mengchi liu depart comput regina canada abstract nest relat complex object nest tupl set repres real world object tupl set partial complet discuss support deduct present deduct languag ii support partial complet tupl set base relationlog work firm logic foundat nest relat complex object partial complet tupl set introduct nest relat complex object nest tupl set repres real world object relat set tupl tupl relat inform real world object incomplet tupl set partial complet past partial complet tupl partial investig depth specif oper union join introduc integr partial inform complet set support set treat simpli partial set partial complet set complet investig relationlog oper call group integr partial set complet set partial tupl consist check consid focu gener problem combin work uniform framework studi support partial complet tupl set deduct present deduct languag ii base relationlog ii support partial complet set inconsist valu null extend nest relat algebra oper defin repres directli importantli make power languag lp col ldl relationlog work firm logic foundat nest relat complex object partial complet tupl set rest paper organ section present syntax ii section defin fixpoint semant section summar point research issu lack paper complet detail full paper ii deduct languag section introduc syntax ii assum exist attribut domain constant variabl type defin domain atom type ftg set tn type distinct attribut tn tupl type denot set type schema tupl type ft rn ft call relat schema term defin constant atom atom partial set tupl term depend variabl atom complet set tupl term depend context distinct ht partial set distinct term partial set construct partial set ft complet set term distinct attribut tupl term term ground variabl object ground term rn tn schema atom tupl term fr rn atom ground ground relat object ground atom atom term posit liter posit neg liter liter posit neg liter rule form ln head atom bodi ln conjunct liter program finit set rule xs cs ds bot cs ds xs fig exampl nest relat figur show nest relat special object defin extend relat algebra oper ii rule repres oper hx hx hx hx hx hx hx hx hx hx hx hx xs cs ds xs hx cs ds program show defin ancestor relat parent relat gener ii arent ar child ar ar child dec arent ar child dec arent ar child dec notion stratif languag give semant program involv negat set present similar notion program denot dp set relat relationship dp defin rule liter neg complet set term rule true program depend graph gp mark graph construct set node dp edg mark edg program stratifi iff depend graph gp cycl mark edg program partit program strata pn denot semant ii discuss semant ii languag defin notion domain set defin fin fin ng ng atom type assum set constant set call domain denot domain construct type obtain set type fin tupl type tn relat object schema respect iff exist relat schema object defin denot uc set complet object ground substitut finit map uc extend atom liter usual object complet object denot iff partial set complet set exist om object denot iff object denot iff ident object equal object compat iff tupl attribut compat nonempti set object compat iff pair object compat set object compat subset maxim compat set exist object compat object object denot complet set exist tupl set attribut attribut schema program interpret complet object respect interpret notion satisfact negat defin ground posit iff iff equal ground neg liter iff rule form ln iff ground substitut impli program iff rule program model interpret satisfi model minim iff model impli discuss defin semant stratifi program program interpret oper tp defin tp ln exist ground substitut tp respect tp undefin note tp similar tradit consequ incorpor type constraint complet introduc group oper integr partial inform complet inform gener union oper join oper group oper incorpor partit normal form introduc group oper defin set object complet set partial fo sg maxim compat set sg set object tupl complet object exist object compat set om bn bn attribut fp om bn pn interpret support iff power oper tp defin group oper tp tp tp tp tp defin tp tp tp defin sequenc oper iter power sequenc respect interpret defin defin mp mn defin theorem stratifi program sequenc oper mp minim support model program declar semant minim support model mp evalu exist continu program mp ar child ar child ar child ancestor dec dec dec dec dec dec present power languag ii support null extend nest relat algebra oper directli importantli solv open problem left provid herbrand minim model semant ii comput bottomup finit sequenc fixpoint work introduc updat construct ii effici evalu strategi ii prototyp implement ii refer abiteboul grumbach languag complex object acm kr ha walker theori declar knowledg foundat deduct logic page morgan kaufmann bancilhon calculu complex object comput system tsur set construct logic languag logic watter semant complex object approxim answer comput system kuper logic program set comput system mark leven georg loizou semant null extend nest relat acm mengchi liu type extens datalog set tupl journal logic silberschatz extend algebra calculu nest relat acm
Agents/1381 1 uncertain knowledg commun behavior coordin noh piotr gmytrasiewicz depart comput scienc engin texa arlington tx box abstract paper report result obtain commun artifici human agent interact simul air domain postul artifici agent method select optim commun characterist situat agent implement comput expect util altern commun execut agent probabilist knowledg formal repres uncertain inform domain agent present build earlier work model method appli ration commun domain distribut unit coordin commun defend territori number attack missil measur benefit ration commun show improv qualiti interact commun result show benefit ration commun measur interact relat expect util messag comput interact place compar result improv due commun achiev human subject circumst introduct paper report result obtain commun artifici human agent interact simul air domain artifici advoc messag select mechan agent make commun maxim expect util comput expect util altern commun execut highest principl maxim expect util agent intend ration commun send valuabl send messag damag circumst hand work paper consid specif domain simul build earlier report comparison messag select messag select human simpl scenario implement commun behavior agent kqml larg number randomli complex episod result includ commun agent coordin human agent agent fulli agent lack kind agent human coordin case intercept agent goal defend agent minim damag territori fulfil agent coordin commun agent commun bandwidth limit battlefield disclosur inform hostil agent critic defend agent select messag agent endow agent method commun behavior free extend version paper present intern confer autonom agent work support offic naval research artifici intellig program contract nation scienc foundat career award agent depend commun frequent advoc work feel reli protocol comput design lock agent suboptim behavior unpredict domain situat foreseen design occur approach model method endow agent compact special agent intent agent predict messag messag chang situat agent react model agent commun model agent state belief imposs properli assess impact commun act belief base messag dt method quantifi gain obtain due messag expect util obtain result interact appli approach improv achiev commun action recommend execut simul encount turn ration commun improv qualiti interact averag team agent averag damag unit suffer refer tabl team coordin human averag damag actual interact qualiti close relat expect util messag comput hand good indic approach comput result good predictor true benefit commun previou approach commun reli predetermin commun protocol protocol languag model cooper environ agent execut rule messag match rule messag rule set barbuceanu postul plan rule agent perform coordin behavior reward denot util find optim action assum run time tamb suggest commun select establish mutual belief agent team approach similar focu agent transmit messag approach select commun tree reward penalti valu domain knowledg obtain valu environ fulli observ statu agent fulli problemat reli reward comput base possibl incomplet uncertain model agent tamb work close relat prior work cohen grosz domain model domain consist number attack missil coordin depict figur sake simplic explain approach simpler case missil depict figur assum batteri conduct experi complic set involv multipl attack missil explain mission unit attempt intercept attack missil minim damag territori note model make coordin batteri attempt intercept threat reach destin damag proport size agent analyz situat term identifi attribut bear qualiti altern action agent attack missil present threat assum size unit prefer intercept threat larger unit probabl effect hostil missil descript domain larg coincid includ complet figur complex scenario intercept ij depend missil js direct motion line sight batteri ij ij constant knowledg model agent inform agent scenario consist gener knowledg kind object agent knowledg base instanti class correspond object agent call world model kb world model scenario figur depict figur implement agent kb world collect call agent hierarch system class object properti object recogn environ figur agent subclass subclass object leaf hierarchi figur repres object agent present environ object assum recogn certainti identifi instanc class aa correctli identifi instanc class missil predict action coordin effect make inform identifi figur present detail figur actual behavior depend situat turn includ number factor uncertain ran launch assum view make ey individu data left top corner screen point point batteri posit missil posit ib ia figur scenario object anim agent object inanim missil thing figur hierarch knowledg base simpl slot string simpl locat slot simpl mobil slot function util slot simpl slot string complex kb probabl slot figur detail type long short rang uncertain short rang left long rang unabl attack missil attempt shoot missil model fulli oper long short rang oper long rang depict state knowledg figur probabl fourth assign equal chanc action includ repres possibl model case call model inanim object anim object agent anim object agent anim object agent missil missil inanim object missil inanim object nil figur frame base system state knowledg defin altern situat repres complex slot call kb figur slot relat case type state knowledg reflect fact detail altern state knowledg case depict figur altern class hierarchi similar figur differ detail object instanc case assum correctli identifi incom missil case long short instanti proper subclass short rang short rang class instanti subclass instanti type long rang state knowledg model assign remain likelihood explain ration make agent compil inform declar kb compact payoff matric facilit expect util calcul payoff matrix game theori faithfulli summar inform frame list expect payoff depend paramet describ domain expect benefit shoot threat quantifi product size threat intercept probabl figur combin benefit shoot threat shoot threat amount enter top payoff matrix figur payoff matrix row repres altern action shoot column repres altern action figur top payoff matrix built inform figur compactli repres situat face solv predict shoot shoot expect shoot target figur model structur make construct payoff matric level model retriev inform kb actual behavior hit launch model figur repres probabl distribut type situat repres payoff matrix matrix level structur figur gener inform figur specifi shoot target inform compil payoff matrix matrix figur show short rang unabl attack missil attempt shoot missil fulli oper long short rang oper long rang depict level model figur probabl fourth assign equal chanc action includ repres possibl model case behavior probabl altern model arriv bayesian learn base observ behavior structur illustr figur call model repres model arriv inform agent kb model structur agent situat payoff altern model situat nest model includ model model case assum inform model nest model structur figur termin model assumpt nest model model figur solv dynam program solut proce result expect util valu assign altern execut detail solut procedur commun identifi commun act defin transform state knowledg situat model act bring model dt pragmat investig util commun act transform agent repres model chang expect util altern action natur identifi chang expect util brought commun action expect util action evalu altern commun act agent select send highest util messag greatest gain expect util agent action expect util commun act execut differ payoff agent expect execut util expect send util expect messag detail discuss appli dt pragmat domain intent model messag implement commun autonom agent close relat bdi theori describ agent intent coordin agent commun act remov uncertainti belief inform current intent current classifi messag formal natur handl case mean messag uncertain notion util messag differ notion inform consid theori express inform recipi messag sender make commun notion coincid special prefer agent perfectli speaker request inform hearer question intent messag model messag intent messag describ intend action model messag describ environ statu agent relev achiev goal type messag intend remov uncertainti present absenc commun languag implement commun act perform provid attempt assert agent send intent attempt case model assert simplic assum agent mutual understand commun assumpt easili long short rang model messag long rang short rang intent messag attempt intercept threat defin choic attempt send messag coordin environ made autonom agent agent comput perform benefici commun attempt send messag agent commun time agent simultan commun actual speaker pick simul commun channel assum agent ly restrict preserv truth dt pragmat messag agent receiv model messag updat belief messag receiv execut newli decid intent agent receiv intent agent make optim action sender intend behavior messag expect util exampl concret figur present evalu altern messag perform agent simplic focu commun behavior assum commun behavior commun ill intercept missil ill intercept missil long short rang long rang figur depict chang situat expect due send chang messag pragmat illustr expect intercept missil repres probabl distribut model action comput commun equat solv model structur figur compar result commun left part figur comput fulli oper probabl distribut action long rang probabl distribut figur dt pragmat action result obtain logic combin distribut level easili comput option shoot missil expect send part figur action behavior repres probabl distribut fulli oper shoot missil probabl distribut action long rang intercept missil probabl distribut combin model fourth result distribut expect remain uncertainti propag result level combin probabl distribut describ action comput expect util action shoot equat expect util commun act viabl messag messag dt pragmat depict figur transform show send messag long short rang includ fact model solv model arriv target select option shoot missil expect util comput solut structur figur reveal expect util expect util similar comput show messag damag neg expect util bad idea commit shoot missil scenario commun commun channel give prioriti messag highest expect util case figur dt pragmat experi simul commun written common lisp built top mice simul experi intend compar perform achiev team human test team coordin human team protocol human learn effect interact demonstr baselin perform random strategi target select method random team randomli intercept target reason experi unit face attack incom missil agent payoff matrix repres agent situat payoff agent belief environ agent abil maintain gener knowledg base unit initi assum uncertainti knowledg batteri fulli function long short rang probabl batteri oper long rang probabl shoot distant higher specif batteri enemi fire probabl batteri unknown probabl batteri deeper nest knowledg agent belief size missil unit missil posit unit fix missil randomli gener unit assum equip launch time episod set scenario team scenario human team commun time unit agent send speaker randomli pick human team flip coin determin talk listen silent receiv messag human cse ee graduat student present descript uncertain case student messag case batteri assum choic commun intercept missil intercept missil long short rang long rang evalu qualiti agent result express term number select target unit attempt total expect damag friendli forc launch total expect damag defin sum residu size attack missil missil target contribut total damag missil contribut size damag commun human episod ran illustr depict figur examin coordin achiev human team detail exampl unit fulli function long short rang size missil includ figur figur scenario comparison perform achiev human team result interact scenario figur present tabl batteri shot threat final depict tabl total damag sustain team encount choic made human team commun similarli displai upper corner tabl damag suffer human team includ optim fire sequenc result determin extern inform statu environ lower portion tabl illustr happen agent exchang messag talk agent charg messag long short rang shot target receiv control intercept case human initi messag intercept target human team shot target messag exchang fire shown lower portion tabl perform commun commun suffer damag human team score differ total damag human team commun show benefit commun expect util commun act execut team sum amount close relat benefit show expect util tabl perform analysi scenario scenario optim fire sequenc target total damag scenario commun agent human target total damag scenario commun agent human messag messag messag target total damag messag transmit adequ estim benefit commun realiz result human team score similar human chose commun act messag chosen human player intercept target expect util messag slightli suboptim point view tabl perform analysi scenario scenario optim fire sequenc target total damag scenario commun agent human target total damag scenario commun agent human messag messag messag target total damag scenario tabl target cluster front unlik scenario target scatter commun critic target intercept redundantli result greater damag incur target head target select biggest threat threaten shown tabl commun redund target select prevent total expect damag drastic reduc scenario sum expect util messag team benefit commun obtain result team tabl perform assess summari run shown tabl tabl present averag number select target averag total expect damag agent trial human agent trial focu perform team differ result obtain team due perform analysi varianc basi total expect damag randomli chose trial team trial tabl perform human team case team select target total expect damag anova case case ii case iii case iv case fulli function case tabl unit fulli function commun comput anova exce team equal effect level differ perform due chanc probabl case ii includ commun fulli function unit anova test show differ perform due chanc probabl commun perform achiev team team perform slightli team experi case iii iv intend examin fulli function batteri cope situat batteri long rang case result case iii iv prove effect commun anova test observ differ perform team target select level due chanc probabl case batteri control human advantag batteri behav randomli huge perform team distinct futur work implement probabilist knowledg base repres uncertain inform agent environ agent present implement evalu messag select autom agent coordin domain measur perform achiev ration commun behavior compar perform batteri result commun improv coordin perform achiev team interest differ commun behavior exhibit human agent human commun behavior similar select differ team achiev slightli perform found report case calcul show messag human subject messag result show messag select exhibit psycholog plausibl human choic commun behavior calcul predict benefit commun obtain result interact current work extend approach ration coordin commun behavior complex depict figur scenario address make algorithm flexibl time pressur refer barbuceanu coordin agent role base social constraint plan nation confer artifici page rhode juli aaai press cohen levesqu ration interact basi commun intent commun mit montgomeri flexibl testb intellig coordin experi distribut ai page sept gmytrasiewicz oper formal model intern confer page menlo aaai mit press gmytrasiewicz ration interact multiag commun submit postscript util commun coordin intellig agent nation confer artifici page juli bayesian updat agent model intern journal user model grosz sidner plan intent commun mit keenei raiffa multipl prefer tradeoff john wilei koller pfeffer probabilist system nation confer artifici page juli labrou finin semant approach kqml gener commun languag softwar agent intern confer inform knowledg nov noh gmytrasiewicz agent model sixth intern confer user page june noh gmytrasiewicz coordin belief updat distribut environ intern confer system scienc uncertainti model approxim reason volum page lo jan ieee comput societi noh gmytrasiewicz ration commun behavior intern confer multi agent page juli noh gmytrasiewicz implement evalu ration commun behavior coordin intern confer autonom page pearl probabilist reason intellig network plausibl infer morgan san system protocol languag specif technic universidad de lo rosenschein role knowledg ration interact seventh phoenix confer comput page feb russel norvig artifici modern approach englewood smith cohen semant agent commun languag base nation confer artifici page aug tamb agent architectur practic teamwork nation confer artifici page rhode aaai press
DB/1382 3 automat methodolog gener charact scan document center autom research maryland colleg md robert haralick depart electr engin washington wa usa abstract charact scan document imag crucial evalu perform ocr train ocr valid document degrad model manual collect accur charact real document imag practic accuraci delin charact bound box high extrem labori time consum manual labor requir task prohibit paper describ methodolog collect accur scan document creat ideal document typeset languag creat ideal document ideal document scan registr algorithm estim global geometr transform perform robust local bitmap match regist ideal document imag scan document imag ideal document imag transform estim geometr transform creat scan document imag methodolog gener creat document typeset style demonstr method gener fax document imag cost creat methodolog minim word zone real registr algorithm gener version document automat real document imag perform imag geometr imag warp introduct charact scan document imag crucial evalu perform ocr train ocr valid document degrad model manual collect accur charact real document imag practic accuraci delin charact bound box high extrem labori time consum manual labor requir task prohibit paper present methodolog collect accur scan document imag work document registr report literatur pertain case fix ideal form regist form gener idea extract inform insert human field form common method extract featur scan form match featur ideal form bodi work landmark fix locat type document imag registr studi area sensor fusion object align imag scene sensor work report present optim method match imag gener methodolog document imag analysi commun refer correct font time bound box coordin individu symbol document imag global document imag includ layout inform zone bound box demarc individu articl section style inform inform number justifi run percent system evalu train penal incorrectli gener method gener ideal document imag charact accomplish start document typeset creat bitmap gener ideal file typeset system print ideal document scan find featur point ideal real document imag establish correspond point estim paramet transform map transform ideal inform estim transform transform mention procedur map ideal point scan gener function true gener ideal document imag achiev synthet gener softwar softwar uw english document transform transform inform trivial transform bound box coordin ideal transform main find featur point document find transform estim geometr transform coordin featur point ideal document coordin featur point real document page featur point extract match section problem function form transform map ideal featur point coordin real point model ensur transform area document point document page candid geometr transform pixel perturb project transform articl describ project discuss affin similar transform found assum real imag perspect project imag plane plane function form map ideal point real point ideal transform oe transform paramet solv squar method point account translat center perspect paramet discuss oe assum function spatial quantiz error imag process algorithm detect featur point project transform equat equat rearrang ap wn paramet vector diagon weight matrix ideal transform point scan weight squar estim paramet vector initi solv initi iter comput estim previou iter find featur point document imag figur featur point interior document type document document rectangular text format format corner text area featur point featur point detect ideal imag origin top left corner imag coordin comput connect compon imag comput corner bound box connect compon find featur point arg min arg max arg max arg min equat comput featur point ideal imag algorithm comput featur point real imag blob real check bound box size compon toler potenti problem bound box corner line transform estim point method section registr result scan imag geometr transform section model transform accur nonlinear displac real point ideal transform point investig drew rectangl blank print scan opposit side scan figur longer equal length side suggest project imag plane origin document plane parallel project transform model transform mismatch nonlinear optic mechan system nonlinear combin suspect sensor motion account mismatch small perturb nomin posit due spatial quantiz figur show subimag scan imag bound overlaid lot error error systemat entir page figur scan imag overlaid perspect transform regist ideal document imag scan imag larg error confirm fact nonlinear set calibr experi perform statist test prove project transform model transform adequ experi creat ideal calibr imag consist symbol arrang grid print document back cross ideal imag match cross scan imag set point estim geometr transform paramet sampl sampl covari matrix registr error vector comput popul popul covari matrix error vector theoret test theoret deriv distribut paramet close gather sampl paramet calibr experi figur show imag calibr experi error calibr project transform registr error vector figur subimag scan calibr document detect calibr point shown ideal calibr point transform estim project transform overlaid real calibr point scatter plot error vector comput real calibr point ideal calibr point transform estim project paramet deal nonlinear due nonlinear scan estim bound box charact scan imag correct solut problem transform ideal document imag perspect transform ideal imag transform estim perspect transform paramet charact bitmap perspect transform imag local translat match ham subimag scan document imag nonlinear rise translat error templat match process match ham translat size search window decid calibr experi error vector search window made larg local search process highli accur potenti error pixel deal robust regress similar charact physic close templat match process match perspect transform charact wrong scan charact typic larg search window size mean error translat vector wrongli match charact procedur detect outlier error vector fit multivari function translat error charact small area imag assum small area error vector vari perform robust detect outlier error correct regress bilinear function discuss bilinear function fit imag warp found function nonlinear function ideal calibr point observ point problem construct bilinear function approxim minim bilinear function repres grid point imag identifi grid point point row grid point point column grid point natur order grid point note number grid point number calibr repres nonlinear function repres transform grid point grid point function transform grid point point lie grid cell corner grid point transform point approxim point transform defin similarli corner point grid cell point constant calcul equat equat state find minim element element uniqu repres grid point give uniqu label grid set system linear solv uniqu element squar protocol result data collect ideal data format document english ieee transact style typeset document document font format macro ideal binari imag charact ground truth creat softwar ideal document creat resolut size binari document pixel document print ii origin print document time xerox normal darker lighter set final document scan scanner scanner set resolut rest scanner paramet set normal set scan binari imag size protocol gener real real scan document gather previou registr algorithm section transform ideal binari document regist scan creat scan document transform form transform ideal document local nonlinear transform account search local neighborhood good match ideal charact symbol real charact symbol local templat match window size determin calibr experi perform earlier maximum error registr window gener algorithm highli accur result discuss section show sampl output automat gener algorithm subimag scan imag overlaid bound box shown figur imag real scan document regist ideal document shown figur imag show charact center charact differ charact edg differ due imag point spread function print scan expect time procedur sun sparc minut figur show automat gener fax document case ideal bitmap gener comput print print document fax fax output scan scanner interest figur real document show subimag document estim bound box charact show result real document regist ideal document imag show charact center charact differ charact edg differ due imag point spread function print scan expect note case scan document highli algorithm produc correct figur show document written script document typeset macro made fran methodolog gener handl document languag methodolog arab music document gener softwar english document page consist symbol algorithm minut page sun sparc document numer mathemat equat limit algorithm sensit featur point robust method scan imag bound procedur perform popul document gener print scan ideal document subset popul document imag real world figur subimag fax document overlaid notic charact bottom left imag legibl manual type document prone error softwar produc correct error subimag format document script overlaid bound box symbol overlap symbol arrang manner summari paper present method produc charact real document imag method start gener ideal document imag document typeset softwar binari document imag scan featur point extract ideal scan document correspond establish show project transform repres transform ideal scan document fact confirm test imag special design verifi statist distribut registr error theori predict local nonlinear exist account perform local templat match ideal charact search small neighborhood real imag match size local search neighborhood decid calibr experi calibr experi maximum deviat occur ideal featur point transform estim transform featur point scan imag methodolog document consist symbol procedur approxim minut page sun sparc method document modif procedur word zone real registr algorithm gener version document acknowledg ken horn rosenfeld comment refer casei ferguson intellig form process ibm system doermann rosenfeld process form document proc int conf document analysi page octob al uw english hobbi match document imag ground truth proc int conf document analysi page august document degrad model methodolog degrad model valid phd haralick valid estim document degrad model proc fourth annual symp document analysi inform la april haralick automat gener charact scan close loop approach proc iapr int conf pattern page august haralick automat methodolog gener charact technic report center autom colleg document degrad paramet estim model valid proc int workshop machin vision decemb phillip local global document degrad model int journal imag system knuth program lamport document prepar system editor imag registr nasa goddard space flight novemb macro latex digit imag warp ieee comput societi lo
HCI/1383 4 user interfac build system scott brown crew system interfac air forc research laboratori eugen santo jr comput scienc connecticut ct sheila bank calcul fl abstract knowledg continu bottleneck construct system methodolog techniqu increment knowledg uncertainti support user current goal desir paper present probabilist expert system develop environ user highli interact integr suit intellig knowledg engin tool system knowledg data verif valid distribut infer engin queri base concept activ user interfac actuat interfac number techniqu reduc inher complex develop realworld system accomplish provid multipl commun mode interact knowledg endow abil detect problem knowledg acquir alert user problem discuss intellig assist user acquisit knowledg presenc uncertainti data knowledg interact introduct everydai involv level uncertainti expert theoret system attempt captur knowledg advantag expert system wide preserv scarc greatest disadvantag expert system construct aid expert task design expert number expert system shell exist todai shell provid varieti tool expert system design captur verifi valid queri perform infer tool provid graphic mean acquir knowledg user incorpor form verif valid knowledg tool design primarili target knowledg goal tool satisfi constraint user modifi knowledg methodolog tool interact human user fashion system provid integr approach acquir test knowledg verif infer primari goal research develop softwar knowledg knowledg elicit methodolog support system human element involv central approach activ user interfac serv actuat user interact comput manner current interfac agent design assist associ metaphor activ user interfac shift focu system system paradigm highli interact collabor human expert machin activ user interfac share idea user model interfac agent research field draw heavili research interact artifici intellig research field interfac capabl collabor autonomi user activ user interfac fulli awar explicit implicit interfac intuit understand action paper describ probabilist expert system develop environ benefit activ user interfac approach applic brown al suit intellig knowledg engin tool develop integr activ user interfac paradigm simpli ultim goal action expert machin build support system effici correct knowledg engin increment choic altern make choic paramount remaind paper outlin section briefli discuss bayesian probabilist knowledg increment specif knowledg knowledg capabl determin problem acquir knowledg problem activ assist user correctli engin engin agent describ tem user interact knowledg engin agent increment acquir knowledg construct probabilist expert system conclud discuss futur research goal activ user interfac bayesian knowledg base support design desir knowledg support model uncertainti mathemat sound bayesian knowledg base probabilist knowledg meet qualiti support theoret sound consist probabilist infer incomplet knowledg intuit rule specif similar bayesian network direct graph capabl repres uncertainti knowledg probabilist relationship random variabl compon bayesian network incomplet built combin instanti support arc shown figur instanti repres oval repres instanc rv arc repres relationship support repres smaller rectangl circl assign probabl figur cloud heavi support singl probabl sidewalk wet support singl cloud heavi probabl order support case cloud activ cloud heavi sidewalk wet figur inher knowledg consist constraint endow result knowledg base abil detect problem knowledg acquir alert user problem result consist knowledg elicit valid constraint consist constraint violat correct user statu messag displai user user requir user correct violat intellig interfac agent knowledg data verif discuss environ expert integr probabilist expert system develop environ util bayesian knowledg user engin agent knowledg acquisit verif valid data mine inferenc capabl oper commun mode user consist major intellig interfac agent translat english question infer queri translat result back english commun exchang user provid intellig assist user infer engin intellig control strategi control select applic infer engin algorithm integ linear program genet algorithm obtain user queri base knowledg fact knowledg base explan interpret track reason path infer engin reach user queri system answer deriv knowledg acquisit mainten facil automat incorpor updat expert knowledg knowledg base activ user interfac organ subsystem figur compon serv multipl function subsystem combin compon subsystem subsystem occur bit detail user interfac intellig interfac explan interpret interfac compon engin agent knowledg organ valid consist explan interpret compon human expert knowledg engin tool organ accomplish commun knowledg acquisit mainten ensur complianc consist constraint valid similarli accomplish feedback reason mechan explan interpret debug reason mechan consist infer engin knowledg acquisit mainten compon incorpor knowledg acquisit mainten compon form reason possibl learn place order knowledg merg exist knowledg base problem consist dealt achiev inform hide isnt subsystem reason mechan concern choic knowledg except explan interpret read interpret inform user english translat user interfac analysi consult explan interpret analysi natur languag interfac expert rule fact queri infer dbm knowledg base domain knowledg knowledg organ valid figur architectur easili complet integr suit knowledg engin agent construct expert system domain altern architectur subsum architectur integr engin agent suit reason mechan lp ga infer engin rule fact knowledg acquisit integr abstract rule fact mention consist suit engin agent activ user interfac paradigm briefli describ agent integr knowledg acquisit verif mack agent knowledg acquisit mack design automat talli confirm consist knowledg elicit expert assist identifi sourc inconsist proactiv suggest correct regular increment check preserv probabilist valid logic consist knowledg acquir current valid valid perform agent git valid knowledg base requir test approach test case set evid expect answer knowledg engin submit test suit agent determin evid support answer submit queri infer engin compar solut test expect answer knowledg base correct automat reinforc learn probabl test case incomplet knowledg meet test condit miss causal relationship random graphic incomplet tool visual knowledg base incomplet user activ solut correct figur left show agent agent data visual guid user shade repair problem infer engin infer engin perform approach intellig control number anytim inferenc algorithm genet control specif provid expert result return user explan interpret subsystem data mine methodolog data mine associ rule incorpor rule knowledg base data mine knowledg acquisit verif valid process expert attempt correct problem discov result perform verif valid empir legaci expert mine specif rule relat attribut random variabl data mine agent find state random variabl elicit probabl singl state support increment knowledg elicit number wai knowledg user alert inconsist knowledg user attempt add rule creat cycl knowledg displai error messag mack attempt provid assist user resolv activ intellig assist agent activ assist expert perform task agent myopic collabor user solv task valid failur determin agent situat difficult user agent depend number variabl includ context constraint violat user prefer agent commun mode determin correct agent correct time daunt task aid user effici util power agent suit integr intellig assist appli activ user interfac paradigm highest level assist form interfac user goal assist offer benefici assist user interact accomplish accur cognit model user maintain user model captur goal user system event probabilist environ user profil maintain user assist custom tailor individu user interfac agent determin offer assist user inferenc user model util function agent act ration maker behalf maximum expect util principl theori goal maximum expect util suggest goal agent capabl offer assist goal agent correct consist constraint violat suggest user prefer commun mode agent preliminari result usabl effect activ user interfac approach found modifi intellig agent architectur collabor elicit inform user base goal past action ad domain knowledg interfac agent user model develop interfac agent develop environ assist softwar develop implement interfac agent domain futur discuss activ user interfac paradigm highli collabor interact appli knowledg engin discuss integr suit intellig agent capabl increment elicit addit knowledg user interact system conjunct intellig interfac goal accur predict user intent proactiv offer assist user util effici manner tradit linear lifecycl develop support system start knowledg elicit end system valid part engin bottleneck typic occur step wholli complet step limit valid entireti return expert minim guidanc debug activ user interfac approach highli interact continu collabor softwar agent human redefin knowledg engin make effici intuit human engin overarch intellig interfac learn adapt chang context expert work context includ obviou item prefer sophist item subset specif domain knowledg expert captur intellig interfac assist expert stage engin expert easili cluster domain knowledg interleav elicit valid demand methodolog permit encourag distribut approach knowledg engin singl expert potenti multipl expert figur firmli activ user interfac paradigm tremend potenti enhanc knowledg engin term global number support system world reduc time cost build system elicit mine verifi valid infer elicit mine verifi valid infer elicit mine verifi valid infer elicit mine verifi valid infer domain knowledg figur distribut knowledg engin foci inform acknowledg result year effort student research support part afosr grant offic secretari air forc refer aj engin theori santo model militari intellig interfac proc train system educ santo user model intellig interfac proc biennial conf canadian societi comput studi santo framework build journal theoret artifici intellig probabilist reason intellig network plausibl morgan santo tool acquir consist knowledg aaai workshop verif valid santo probabilist aaai workshop verif valid santo handl structur incomplet valid probabilist intern flair stein santo direct data mine incomplet repair knowledg midwest artifici intellig cognit scienc santo heurist bayesian annual confer uncertainti artifici base system ieee accept intellig user pilot associ intern confer intellig user read knowledg acquisit autom construct improv expert morgan santo develop environ architectur build gener intellig user interfac aaai workshop softwar tool develop santo intellig user interfac gener expert midwest artifici intellig cognit scienc santo reason gener ieee intern confer tool artifici santo explicit requir metric interfac agent user model intern confer autonom reduc work inform commun acm theoret approach interfac agent phd dept electr comput air forc institut
HCI/1384 4 accept gestur march franc appendix comment make paper scalabl asl break sign phonem christian vogler dimitri metaxa depart comput inform pa abstract paper present approach asl recognit phonem sign basic unit approach base sequenti phonolog model asl model asl sign broken movement consid phonem model distinct sign movement made previou work movement movement constitut sign subsequ train hidden markov model recogn sign movement recogn number phonem train recognit asl signal tractabl potenti lead recognit vocabulari experi word achiev similar recognit rate approach result scale task futur plan conduct experi demonstr phonem improv recognit rate comput complex introduct gestur destin plai increasingli import role interact futur human gestur everydai commun reinforc mean convei convei mean difficult imposs convei speech make interact comput recogn gestur addit speech gestur recognit import part virtual realiti user manipul environ hand close relat field gestur recognit field sign languag recognit sign languag primari mode commun deaf languag offer structur constrain research environ gener gestur linguist research earli properti sign american sign languag sign languag recognit offer appeal test bed research gener problem gestur recognit work sign languag recognit system make interact deaf peopl surround easier possibl properti sign languag sign consist broken part systemat word spoken languag broken breakdown essenti prerequisit build scalabl system larg vocabulari gestur research systemat break sign constitu part recognit sketchi research address problem earli transcript system asl system treat aspect sign occur parallel recent research late earli shown sequenti import featur sign fact base good phonolog model asl paper explor possibl base asl recognit sequenti phonolog model focu strictli phonolog distinct sign movement made previou work unifi singl phonolog framework movement movement constitut sign semant import aspect sign languag scope paper address facial paper express term phonem begin overview relat proce discuss asl show hidden markov model captur statist variat sign movement provid preliminari experi sign vocabulari valid assumpt phonolog model asl provid discuss open research question relat work previou work isol sign languag recognit clear sign make easier problem continu recognit individu explicit segment continu input stream individu sign difficult work isol recognit gener easili continu recognit kim neural network recogn small set isol sign transcript system separ movement aspect sign power glove recogn set isol sign emphasi method colleagu neural network recogn marcel hmm recogn isol sign accuraci vocabulari extract featur video record signer wear color glove work continu sign languag recognit base hidden markov model hmm offer advantag segment data stream constitu sign bypass difficult problem segment starner pentland approach singl camera extract featur input hmm vocabulari strongli constrain sentenc structur consist pronoun sequenc assum smallest unit sign languag sign make effort break sign constitu part nam data input hmm continu recognit small set gestur introduc concept movement make sequenc complex movement liang hmm continu recognit sign languag vocabulari sign work model detect movement aspect run sign unlik work hmm segment input stream implicitli perform explicit segment base discontinu movement perform integr movement aspect higher level hmm sequenti aspect sign languag manifest higher level vogler metaxa hmm continu asl recognit vocabulari sign complet unconstrain sentenc structur model segment input stream implicitli coupl approach pure base analysi segment input stream explicitli extract geometr properti back hmm model drop model favor model transit sign explicitli transit movement integr part asl phonolog sign smallest unit asl paper extens work goal abandon notion sign smallest unit asl replac phonem strive treat aspect asl phonolog hmm level includ sequenti aspect summar relev linguist research asl american sign languag phonolog review asl quick note terminolog sign languag radic spoken differ larg underli concept concept spoken languag linguist readili carri sign languag linguist reason follow establish terminolog spoken languag linguist phonem defin smallest contrast unit unit distinguish word phonem downward movement sign phonem interest recognit number limit unlimit number word built phonem limit set phonem speech recognit tractabl attempt show asl recognit tractabl system realiz sign broken smaller part observ transcript system transcript system assum sign broken paramet consist locat sign movement fundament assumpt system sig contrast simultan variat sequenc paramet sign consid transcript system base segment model johnson argu convincingli assumpt sequenti contrast asl made sequenti contrast basi asl phonolog simultan occurr phonem sequenc phonem model call segment model johnson describ major class segment model call movement hold movement defin segment aspect signer configur chang hand chang hand orient hold defin segment aspect signer configur remain hand remain stationari period time sign made sequenc movement hold common sequenc hold movement mh movement movement attach segment bundl featur describ hand locat movement segment featur describ type movement sharpli plane intens movement model absenc featur presenc basic sequenti structur accept sequenti phonolog model ideal suit hidden markov model recognit section paper follow idea focu movement type locat featur add wrist rotat movement direct movement place descript movement type model wrist rotat direct movement implicit found impract model recognit framework tabl figur give partial overview descript movement locat locat modifi distanc vertic horizont distanc basic locat locat touch prefix distanc order distanc bodi locat center front distanc marker suffix locat side distanc marker suffix locat distanc marker suffix mean locat comfort arm length side trunk marker describ vertic offset basic locat locat side opposit side bodi hand detail movement transcript straight str str str str str left str str str short straight str str circl vertic plane wrist rotat rot rot rot rot tabl partial list movement note descript movement deviat approach model mo cn ns fh ch st tr ab abu figur partial list bodi locat model phonolog process johnson describ phonolog process asl phonolog process utter rule chang mean utter order achiev recognit system cope process time import phonolog process call movement consist insert extra movement adjac physic characterist sign languag sequenc sign perform sign perform front trunk extra movement forehead trunk insert exist sign lexic form figur movement arrow middl pictur extra movement sign present lexic form movement pose problem asl movement depend sign sequenc handl problem model movement explicitli movement captur phonem movement sign movement research movement constitut actual sign model movement separ phonem time model phonolog process hold delet swap order segment cover briefli model asl phonem hidden markov model hidden markov model statist variat human perform perform ident sign success recognit system handl variat hidden markov model statist model suitabl model signal time successfulli speech recent gestur sign languag recognit underli idea distinct hmm phonem hmm train yield maximum probabl signal repres respect phonem recognit comput probabl part input signal gener hmm pick probabl hmm recogn phonem discuss hmm theori discuss detail hmm sign languag phonem model hmm train hmm repres movement hold phonem straightforward process phonet transcript asl clear sign start movement phonem follow classifi movement phonem type direct place sign good estim sign locat encount hold segment lead unnecessari classif error sign locat problem allevi ad hmm phonet model sole obtain estim locat begin sign begin movement segment hold model requir hand remain stationari length time train hmm repres phonem complic train movement hold hmm reason model model kind phonem worst phonem locat sign space locat sign space major bodi locat defin yield phonem reduc number model advantag similar phonem practic differ movement side forehead center forehead chest fh phonem cover singl model appli optim cut number model half futur work express model complet term movement exist amelior problem singl greatest advantag break sign individu phonem limit number hmm train finit number distinct number possibl combin word practic unlimit real benefit model phonem sign make applic benefit obviou hmm hmm sequenc phonem tractabl hmm sequenc sign vocabulari small number requir model squar vocabulari size local featur global featur recognit perform depend significantli featur extract input signal featur extrem signal vicin specif point time posit hand sign space veloc hand exampl local featur reveal behavior signal hundr millisecond time sampl asl movement phonem describ geometr properti signal global movement straight arc desir quantit measur signal global properti measur signal fit line plane specif time interv measur easili comput estim covari matrix point time interv eigenvalu largest eigenvalu significantli larger signal fit line largest eigenvalu equal significantli larger smallest signal fit plane relationship quantifi number squar root largest normal sum squar root eigenvalu experi design experi verifi break sign phonem viabl approach asl recognit vocabulari consist sign phonet transcript list tabl appendix note phonem begin movement phonem begin hold begin denot addit hmm mention section locat estim collect sentenc sign technolog tm magnet track system system gave posit orient hand bodi part frame split sentenc train exampl sign test exampl sign part test exampl part train hmm conduct type control experi measur perform hmm movement model control experi similar conduct experi test perform global global featur experi featur extract hand local featur hand posit rel signer base hand veloc global featur consist largest normal section result tabl word accuraci evalu criterion comput subtract number insert error number correctli spot sign result hmm perform significantli hmm global featur valuabl signal breakdown sign movement hold research global featur type experi word acc detail local featur global featur tabl result recognit experi denot number correct number delet number substitut number insert total number sign test set discuss futur work show hmm achiev asl recognit perform compar hmm work establish valid import entir question scale asl recognit larg vocabulari hing result show analyz input stream global featur potenti make larg impact recognit perform question resolv experi hand left hand remain independ hand linguist point view technic point view johnson argu hand independ bundl independ technic point hand depend combinatori phonem answer question li hmm coupl hidden markov model hand configur orient featur incorpor similar futur research wai express phonem term phonem occur regular cut number distinct phonem train analog speech improv recognit perform acknowledg work support part nsf career award onr young investig nsf refer pentland coupl hidden markov model complex action recognit ieee confer comput vision pattern geoffrei editor current issu asl volum phonet phonolog academ san approach gestur recognit workshop integr gestur languag marcel isol sign languag recognit hidden markov model ieee intern confer man page moham wale machin recognit sign recognit sign languag lynn workshop integr gestur languag page appli scienc engin laboratori delawar octob liang continu gestur recognit system sign languag intern confer automat face gestur page scott robert johnson american sign phonolog base sign languag nam recognit hidden markov model acm symposium virtual realiti softwar regina thoma jan hen version hamburg notat system sign languag introductori volum intern studi sign languag commun deaf rabin tutori hidden markov model select applic speech recognit thad starner alex pentland american sign languag recognit video hidden markov model technic report mit media william sign languag outlin visual commun system american deaf studi paper silver christian vogler dimitri metaxa asl recognit base coupl hmm motion analysi technic depart comput inform pennsylvania christian vogler dimitri metaxa adapt hidden markov model asl recognit comput vision method ieee intern confer man page christian vogler dimitri metaxa asl recognit base coupl hmm motion analysi ieee intern confer comput page kim isol asl sign recognit system deaf person ieee transact septemb phonet transcript sign transcript man woman father mother interpret teacher chair inform sit teach interpret lie left relat left good gross beauti tabl phonet transcript sign vocabulari phonem begin denot phonem begin denot phonem begin denot special hmm design estim locat begin sign addit note point origin paper consequ make paper ffl transcript appendix incorrect segment replac chang improv recognit accuraci ident accuraci achiev hmm ffl section add segment origin descript model appendix denot letter segment similar function segment descript model
ML/1385 6 gener approach handl paramet interdepend probabilist model reinforc learn optim algorithm victor william punch iii genet algorithm research applic group depart comput scienc engin michigan state engin build east mi abstract paper gener research paramet interdepend reinforc learn algorithm optim problem solv gener expand work larger class search algorithm explicit search statist form feasibl solut result suggest genet algorithm enrich benefit probabilist reinforc ant coloni optim similar algorithm valu encod prefer paramet assign approach shown effect asymmetr travel salesman quadrat assign problem introduct recent interest famili search algorithm store past experi solut abstract process emploi interest provok number factor solut memori search algorithm store solut necessarili valuabl experi abstract process probabl reflect import properti search space number approach inform obtain search cultur algorithm emploi version space stage algorithm moor approxim predict potenti locat optimum paper concentr problem group algorithm quantit inform estim expect qualiti free paramet assign group includ algorithm popul base increment learn baluja algorithm probabilist model search space bonet al pelikan al reinforc learn applic optim problem solv ant coloni optim al algorithm collect explicit search statist form probabl pheromon valu paramet assign contribut higher qualiti solut attempt gener inform genet algorithm popul creat probabl vector compon correspond probabl set ga chromosom bit captur paramet interdepend build block encod ga popul account paramet depend condit probabl organ chain bonet depend tree bayesian network al order build model search space major problem approach fundament model result low order condit intens comput effort requir maintain model handl paramet interdepend major complic applic statist reinforc learn optim viewpoint goal search algorithm gener solut high expect fit base previou feasibl solut rl algorithm base markov process theori typic rl optim map mdp state action maxim expect reward obtain mdp path function polici defin pair mdp map expect reward obtain start state action major rl optim applic dietterich bertseka reflect assign free paramet account assign made state longer rl algorithm track paramet interdepend detail applic quadrat assign problem travel salesman problem ant coloni optim al optim techniqu base mimick forag behavior ant heurist call pheromon desir choic assign free paramet assign good chosen futur solut simul process pheromon deposit found studi ant coloni fact inspir behavior real form updat rule solut creation process close resembl mainstream rl competit learn algorithm rl optim problem account paramet interdepend pheromon repres util independ assign inabl track combin paramet assign lead improv solut disadvantag algorithm diminish perform presenc approach problem paramet interdepend handl ga ga account combin paramet cooccurr popul chromosom desir combin implicitli encod frequenc schemata popul combin paramet assign lead improv call build block ga theori fundament concept ga schema genet design abil handl paramet interdepend ga major strength question ga mechan handl paramet interact statist search ga turn benefit popul probabl vector achiev popul probabl vector feasibl assign allel prefer paramet assign similar popul popul assign probabl power account interdepend transit evolut actual valu free paramet evolut probabl valu indic prefer assign make concept build block probabilist requir develop special theori oper topic present research hope publish shortli idea evolv probabl solut origin baluja avoid prematur converg simul parallel ga test support theori author evolv popul solut matric updat reinforc learn algorithm approach shown effect evolv popul weight control probabl free paramet assign appli problem map depend graph mesh processor find sequenc minim applic context rl weight control probabl special case gener outlin prefer size problem size chromosom encod alphabet entri desir symbol alphabet allel chromosom popul consist complex solut coupl prefer matrix coupl term agent lack natur entri prefer matric pheromon heurist weight depend rule updat matric approach repres shown pseudocod figur initi instanc solut prefer matric evalu solut assign fit complex instanc rule fit solut rule select instanc mate pool reset set gener instanc chose instanc crossov prefer matric oper evolutionari oper creat offspr solut parent solut prefer matric chosen step parent solut offspr prefer matrix obtain evalu offspr solut updat offspr matrix updat rule place onlin updat offlin updat step repeat step time select gener solut calcul fit complex instanc popul rule fit solut step possibl onlin updat step updat parent prefer matric offspr prefer matrix updat rule solut obtain place complex gener instanc remov parent instanc repeat step till combin restor origin size replac gener counter repeat step termin criterion met figur present approach pseudocod templat defin famili algorithm instanc test special instanc popul consist prefer matric solut lack advantag result combin prefer matric solut shown author result exampl approach test context reinforc learn probabilist model updat dayan updat rule run onlin mode prefer solut appli mont carlo updat rule tabl show result instanc benchmark set updat offlin paramet posit neg learn rate equal rest algorithm rl context mean column tabl optim solut approach qlearn updat approach result found averag averag solut found standard deviat averag fit solut obtain gambardella dorigo averag fit solut found averag fit solut obtain ga local search merz solut techniqu bold outperform approach show slightli perform comparison ga local optim compar base approach win low standard deviat scalabl algorithm larger problem present approach inherit advantag explicit search statist algorithm encod abstract problem solv solv problem handl interdepend suffici low comput cost develop approach introduct addit statist inform reflect certainti prefer valu introduct probabilist schema interest theoret issu present work relat issu tabl result bk averag averag refer increment method integr genet search base function optim competit carnegi mellon technic genet standard genet proc int conf machin learn morgan pp probabilist model combinatori proc nation confer artifici intellig pp aaai juli de find optima estim probabl neural inform mit vol boyan moor learn evalu function global optim boolean satisfi proc nation confer artifici intellig aaai pp crite ag elev perform reinforc advanc vol pp mit press ant optim coloni cooper ieee transact ieee dorigo symmetr asymmetr tsp ant proc ieee conf evolutionari ieee press local search proc ieee int conf evolutionari ieee press search combinatori optim reinforc learn proc congress evolutionari comput vol pp juli approach solv combinatori optim problem popul reinforc learn genet evolutionari comput conf vol pp morgan juli probabilist chromosom genet proc genet evolutionari comput vol pp morgan juli bayesian optim proc genet evolutionari comput vol pp morgan juli travel salesman problem orsa journal reynold space control genet proc annual conf ai simul plan high autonomi ieee pp bertseka learn dynam channel alloc cellular telephon proc advanc mit press ant system local search travel salesman proc ieee int conf evolutionari ieee barto reinforc introduct mit press dayan machin kluwer academ publish dietterich perform schedul proc advanc mit press
ML/1386 6 transact inform technolog vol septemb extract robust case studi medicin face challeng knowledg discoveri grow volum data data mine algorithm extract robust rule clinic practic understand prevent unwant medic event appli data set obtain children born heart result surgic design patient develop obviou identifi children develop surgeri perform prior attempt identifi children statist techniqu discuss paper show exist unambigu relationship measur featur data set studi show occurr accur predict prior comput experi medic data set percentag accur predict higher data addit featur collect larger data set index data medic medic rough set introduct grow volum inform call develop tool analysi understand data data mine offer solut process extract knowledg data set lead discoveri unknown relationship main area data mine process gener gener concept specif exampl hu classifi rule extract data set characterist assert concept satisfi data includ data symptom specif summar characterist rule classif assert discrimin concept class distinguish classif manuscript receiv octob januari intellig system iowa ia usa law depart iowa ia usa ii michigan medic ann mi usa publish item identifi andrew ian ii ieee rule summar symptom discrimin assert determin relationship condit type rule applic data mine enlarg scope learn rule gener method replac fix valu gener delet conjunct rule gener incorpor disjunct gener rule transform conjunct gener climb method appli algorithm learn algorithm higher level concept gener learn algorithm publish literatur aim extract gener rule categor algorithm induct logic rough set report perform benchmark data set algorithm paper design extract robust rule robust issu relat rule gener altern disjunct class rule gener user reluct make base minimum number reach altern set featur disjunct phrase transform conjunct form combin rule confid predict result rule gener confid measur redund factor express number mutual featur set minu user compound rule rule ieee transact inform technolog vol septemb fig train data set compound ii rule extract algorithm rule extract algorithm develop date fall class tree induct algorithm induct tree learn algorithm develop quinlan induct learn system gener condit logic formula induct algorithm rule induct algorithm rough set theori pawlak fundament class algorithm learn exampl rough set system algorithm develop base theori pawlak exampl algorithm develop learn data mine found edit volum lin carbonel michalski al book mitchel lim al present extens survei learn algorithm iii exampl rule extract present illustr rule deriv rule extract algorithm data set shown fig rule shown fig deriv form data fig tree algorithm object support rule list rule element data set includ rule fig result pattern shown fig featur valu column involv characterist tree type algorithm set rule extract rough set algorithm pattern shown fig column partial involv rule object rule exist rule extract algorithm aim form rule minimum number featur experi data set includ featur describ train data set make predict medic data genet includ thousand featur user satisfi rule minim set featur reason call redund notion similar system error valu featur make defin appendix measur featur set redund requir depend number featur includ number featur domain human treatment select cancer prudent set factor iv algorithm extract robust rule rule extract algorithm section meet requir robust accuraci comput complex low learn algorithm publish literatur explor relationship valu singular time addit function provid wide algorithm global view simultan explor relationship valu featur extract knowledg concept horizont vertic select featur valu illustr matrix fig reason highlight element matrix valu similar ident energi field energi energi defin total number element energi field featur neighborhood toler featur neighborhood number featur posit neg direct field centroid field fig featur neighborhood featur call toler featur depend express percentag featur deviat nomin featur role toler relat discret method discuss easi toler numer defin toler categor variabl challeng assum toler neighborhood energi entri fig valu energi metric discuss paramet simplist measur complex metric explor energi field measur total similar element includ field similar distanc measur publish literatur cite machin learn literatur perform detail analysi similar distanc measur discuss numer distanc metric featur neighborhood featur neighborhood control robust rule featur extract robust rule fig rule set deriv algorithm fig pattern rule fig fig rule set deriv rough set algorithm fig pattern rule fig fig energi field neighborhood posit correl toler impact rang featur valu rule posit correl rule support rule support defin data mine literatur number object learn set properti condit rule neighborhood plai kei role evolut rule featur neighborhood impact rule content evolut featur evolut impact toler extran factor impact toler discuss energi concept incorpor algorithm gener develop rule extract gener rule extract algorithm step present step set featur set cardin step select featur set determin featur set select scheme step produc class appendix select featur set step stop criteria step step step reorgan data set matrix structur process rule rule engin output rule step set step schema defin featur set select schema schema emploi explicit featur set select random featur set expert featur set entropi energi measur distanc parallel comput scheme stop criteria number support measur matrix structur schema merg cluster rule featur featur replac featur valu rang merg rule column remov column entri rule rule engin schema modifi featur modifi featur decoupl compound evolutionari comput illustr exampl data set fig consid step featur set cardin set ieee transact inform technolog vol septemb fig matrix fig mark element class sy iter step cardin featur set select random featur set select scheme step class shown fig identifi featur set step stop criteria set step return step iter step singl cardin featur set select random featur set select scheme step class cardin featur set identifi step stop criteria step step rule gener step summar fig data set fig wide data mine literatur consid demonstr step featur set cardin set iter step cardin featur set plai ball plai ball plai ball plai ball select random featur set select scheme step singl class identifi featur set plai fig remain featur set select step produc empti class step stop criteria set step return step iter step cardin featur set plai ball plai ball select random featur set select scheme step featur set plai ball lead class shown fig fig matrix fig mark element class featur set plai ball class rule elicit matrix fig shown fig rule fig obtain algorithm case studi present previou section appli data set gener children suffer heart medic literatur heart heart singl common group human birth defect due advanc diagnosi major clinic encompass approxim children heart children heart disord advanc surgic children born function live adult year stage requir convert circul seri oper final stage children heart spite success patient develop involv circuit top chamber heart circuit reli properti anatom surgic creat demonstr clinic studi conduct investig strateg linear complet prevent studi random prospect design candid patient receiv random assign convent oper oper strateg surgic subject studi clinic induc prior acut stage hospit standard program cardiac clinic monitor primari endpoint extract robust rule fig rule set produc fig popular data set fig matrix fig mark element class fig matrix fig mark element class py fig matrix fig mark element class sy prevent clinic failur induct test group compar control group acut determin exist relationship measur paramet outcom measur defin data set children consid data set collect law dick medic practic data set complet featur valu miss list featur consid patient defin appendix ii comput experi perform author address critic question potenti save live featur train data set subset paramount clinic potenti robust predict valu base histor address research test case consid test variabl consid variabl includ data set featur includ data set data test case subset featur observ clinic studi featur select base primari clinic relev featur data set defin appendix ii ieee transact inform technolog vol septemb fig rule set obtain matrix fig fig illustr oper test extend valv test case featur select medic expert valu test case test case subset featur fall secondari relev categori test case test case combin set featur previou test case comput result test case previou case discuss section vi vi comput result test rule extract valu paramet import medic practic prevent effect valu number exampl train set low valu rule valu list posit address post earlier clinic question extract present format rel rule discrimin support definit term appendix rule gener test case shown appendix iii test case rule rule rule rule extract robust rule rule rule rule rule rule test case rule rule rule rule rule rule rule rule rule rule test case rule rule rule rule rule rule rule rule rule rule robust rule rule rule vii make rule gener case outcom determin independ result produc result number independ wai design gener robust rule set requir ieee transact inform technolog vol septemb main extract rule predict small number exampl support rule result safe predict small number exampl due rel outcom limit number observ produc answer case unknown outcom rule rule support opposit outcom make rule stronger support deriv larger train set algorithm gener accur predict altern rule algorithm base orthogon concept present algorithm gener confirm orthogon algorithm appli data set consid paper produc accur predict infant featur list appendix ii predict remain patient involv probabl test scheme wide data mine data set broken ten consist train data test exampl rule extract ten train partit appli ten train set ultim success accur predict select suffici larg train data robust properli design algorithm comput experi discuss case studi led address issu futur data collect effort viii data set obtain children born heart consid result surgic design cure patient develop obviou identifi children develop prior attempt identifi children statist techniqu algorithm develop paper show exist unambigu relationship measur featur data set studi suffici larg provid definit prove children suscept identifi prior occurr prior comput experi medic data set accur predict children provid addit featur identifi suffici larg data set collect appendix definit class set object indiscern set featur dsm total number rule support express number object train set support number mutual featur set minu rule support number object data set properti condit rule rule coverag proport object data set identifi rule rule rule support estim condit probabl rule strength number object data set properti condit rule rel rule strength percentag object data set properti condit rule discrimin level percentag ratio rule strength rule support appendix ii list featur ag ag surgeri arrest time oper primari cardiac diagnosi secondari cardiac diagnosi dai intens care unit oper dai hospit oper type oper perform refer stage oper gender subject femal subject receiv test time indic subject induc test induct protocol induc induc extract robust rule induc statu studi subject prior oper patient induc induc test valv valv prior av valv mild mild av valv mod moder av valv sever sever av valv pressur suppli determin heart prior oper pressur vein suppli lung reflect pressur determin heart prior oper resist determin heart prior oper unit valv suppli blood prior valv mild mild valv mod moder valv sever sever valv assess function prior good normal mild mildli depress mode moder depress sever sever depress function valv valv av valv mild mild av valv mod moder av valv sever sever av valv valv suppli blood valv mild mild valv mod moder valv sever sever valv clinic document subject develop hospit subject develop abnorm heart rhythm oper assess function good normal mild mildli depress moder moder depress sever sever depress function bypass time oper effect period obtain time test oper test normal recoveri conduct effect period obtain time test test normal conduct cycl length obtain time test test normal conduct node recoveri time obtain time test node injuri affect automat total conduct time obtain time test injuri node affect ieee transact inform technolog vol septemb tion node weight oper appendix iii rule test case rule rule rule rule rule rule rule rule rule rule rule rule rule rule rule rule rule rule rule rule rule rule refer discoveri rough set phd dept comput univ canada cohen handbook artifici handbook artifici intellig san morgan vol program machin learn san morgan comparison dynam rough set method extract law rough set knowledg discoveri methodolog ed pp comput intellig design manufactur data industri case ieee tran electron packag vol pp oct mach vol pp extract robust rule increment learn system test applic medic nation confer artifici intellig palo aaai pp int inform comput vol pp version rule induct system vol pp set theori rule induct techniqu discoveri attribut depend medic inform proc european pp set tool studi attribut depend stone treatment data rough set data analysi lin ed pp lin rough set data mine machin paradigm method mit machin learn data mine mach learn comparison predict train time classif mach vol pp nguyen method data rough set knowledg discoveri methodolog ed pp perform similar dissimilar comput ind vol pp oper complex cardiac vol pp vol pp influenc develop vol pp versu convent modifi ann vol pp electr ablat accessori pathwai pace vol pp rough set approach induct rough set knowledg discoveri methodolog ed pp data mine ieee tran inform technol vol pp dec choic assess statist royal stat vol pp predict product artif vol pp proc int rough fuzzi mach discoveri pp andrew professor industri engin iowa citi author numer research paper scientif journal frequent speak intern conduct consult industri corpor serv editori board edit book journal intellig manufactur interest theori applic comput data optim health product manufactur ian law assist professor iowa citi specialti train interest encompass mechan manag children adult acquir primari interest area develop surgeri correct heart dr law member north american societi pace american medic associ council part american heart associ recipi american heart associ grant perform random prospect studi investig prevent heart surgeri ii professor michigan ann arbor interest mechan manag cardiac impact surgic repair cardiac activ develop cardiac applic rf energi treatment children author paper abstract diagnosi manag heart children dr dick american board fellow american colleg member american societi societi research
DB/1387 3 machin fl kluwer academ boston manufactur netherland text classif label unlabel document em kamal nigam andrew mccallum sebastian thrun tom mitchel school comput carnegi mellon pa henri pa abstract paper show accuraci learn text classifi improv augment small number label train document larg pool unlabel document import text classif problem obtain train label larg quantiti unlabel document readili introduc algorithm learn label unlabel document base combin naiv classifi algorithm train classifi label probabilist label unlabel document train classifi label iter converg basic em procedur work data conform gener assumpt model assumpt violat poor perform result present extens algorithm improv classif accuraci weight factor modul contribut unlabel multipl mixtur compon class obtain text show unlabel data reduc classif error text integr combin label unlabel bayesian learn introduct problem automat classifi text document problem great practic import massiv volum onlin text world wide internet electron corpor medic patient record digit librari exist statist text learn algorithm train approxim classifi suffici set label train exampl text classif algorithm automat catalog articl web page shavlik automat learn read interest user automat sort electron mail thrun mitchel kei difficulti current issu address requir number label train exampl learn accur label process task learn usenet newsgroup articl interest person read usenet system filter articl present user find interest highli great commerci interest todai work lang found person read label learn achiev make predict top document confid user practic patienc label thousand obtain level prefer algorithm provid accur classif dozen thousand larg quantiti data obtain high difficulti obtain label data import sourc inform reduc label paper address problem learn accur text classifi label exampl unlabel document augment label document text involv onlin collect unlabel document easi filter task thousand unlabel articl freeli unlabel data classif inclin gain access unlabel data provid inform joint probabl distribut word label data determin document word tend belong posit class fact estim classif unlabel find word occur frequent unlabel exampl believ belong posit class cooccurr word larg set unlabel train data provid inform construct accur classifi consid indic posit exampl explain correl sourc inform classif specif label data scarc paper learn classifi advantag label unlabel data em class iter algorithm maximum likelihood maximum posteriori estim problem incomplet data unlabel data consid incomplet class label algorithm train classifi label classifi assign class label unlabel document calcul expect miss class label train classifi origin label text classif label unlabel document em iter maximum likelihood em perform data likelihood find classifi paramet local maxim likelihood label unlabel combin em naiv classifi base mixtur commonli text classif augment basic em scheme order basic em improv classifi assumpt data gener satisfi assumpt data gener mixtur correspond mixtur compon class assumpt em degrad improv classifi accuraci assumpt rare hold realworld extens basic combin unlabel data improv classif spite violat assumpt extens introduc weight factor dynam adjust strength unlabel data contribut paramet estim em reduc bia naiv model class multipl mixtur singl compon show unlabel data significantli basic em algorithm suffer model assumpt unlabel extens mention overcom problem consist improv classif reduct number label exampl dramat identifi sourc newsgroup usenet articl classif tradit learner requir label altern algorithm advantag unlabel exampl requir label exampl achiev accuraci techniqu reduc label train exampl factor label document accuraci improv find illustr power unlabel data text classif demonstr strength algorithm remaind paper organ section investig problem learn label unlabel data theoret point illustr ideal unlabel data chang rate classif error converg polynomi exponenti amount label section present formal framework naiv section present combin em naiv extens algorithm section describ systemat comparison classif newsgroup web newswir articl proport class uniform class case filter rout benchmark inform retriev relat work discuss section futur research direct discuss section thrun mitchel argument unlabel data unlabel data learn unlabel data gener insuffici yield classif inform class label unlabel data boost gener accuraci limit amount label data unlabel data lack inform class membership unlabel data carri import inform target estim paramet reduc amount label data unlimit unlabel data converg speed learn algorithm polynomi exponenti analyz simpl classif instanc gener gaussian mixtur gener result mixtur multinomi data gener gaussian paramet unknown note make kei assumpt data produc mixtur correspond mixtur compon class figur show model result gener multipl dimens data gener gaussian unknown mean varianc oe oe mix priori likelihood class priori likelihood class classifi estim oe oe classifi sampl belong class posterior probabl class greater class classifi class figur illustr classifi grai shade area correspond class learn classifi form parametr estim problem problem recov gaussian mixtur model paramet oe oe data import unlabel data learn worthwhil compar unlabel data unlimit amount unlabel data avail unlabel data import consequ rate converg classifi case label sampl unlabel data label data estim mixtur paramet oe oe maximum likelihood paramet estim error converg rate proport text classif label unlabel document em class class figur classif mixtur gaussian unlimit amount unlabel data mixtur compon fulli label data assign label individu converg exponenti fast classifi unlabel data mixtur compon estim label data classifi converg slower rate number label sampl maximum likelihood estim effici estim converg faster rate smaller asymptot varianc asymptot expect paramet estim error converg rate proport paramet estim error directli translat classif error situat depict figur estim left gaussian error boundari class shift proport amount figur area label figur correspond addit classif error paramet estim small size bound express proport jd classif error bound converg error rate pictur extrem unlimit unlabel data label sampl unlabel data gener mixtur suffici recov origin mixtur compon mean covari matric gaussian recov mix paramet imposs assign class label gaussian label data remain learn problem problem assign class label gaussian problem converg exponenti fast number label sampl learn classif gaussian asymptot infinit amount unlabel data chang converg thrun mitchel tion error exponenti converg result amount label unlabel data found work castelli cover venkatesh remaind paper talk mixtur naiv text classif result shown gener multinomi case infinit amount multinomi mixtur model paramet recov map mixtur compon class impli exponenti learn rate discuss castelli cover hold case label rate converg paramet estim error rate classif error converg import notic analysi depend critic assumpt data gener parametr model domain text classif import empir question effect analyz observ practic spite violat assumpt section address detail parametr gener model text classif present empir result model data probabilist framework section present probabilist framework natur document classifi framework defin probabilist gener model embodi assumpt gener data produc mixtur correspond mixtur compon class naiv text classifi discuss fall analysi section document gener probabl distribut defin set denot probabl distribut consist mixtur compon fc jcj compon disjoint subset creat select mixtur compon mixtur weight class prior select mixtur compon gener document distribut jc likelihood sum total probabl mixtur jcj jc document class label assum correspond mixtur model compon time jth mixtur compon jth class text classif label unlabel document em class label document written document gener mixtur compon class label document text classif naiv section present naiv probabilist describ applic text naiv foundat build order incorpor unlabel data learn task estim paramet gener model label train data algorithm estim paramet classifi document calcul class gener document gener model naiv assum probabilist gener model text model special mixtur model present previou make assumpt discuss naiv make word independ assumpt gener model greatli reduc number paramet rest subsect describ gener model give specif model deriv probabl document gener class label introduc notat describ text consid order list word hw write ik word posit document subscript index vocabulari hw jv document gener mixtur document jd chosen independ compon assum document length independ class select mixtur compon gener word sequenc length expand term equat express probabl document mixtur compon term constitu document length word document note gener probabl word event condit word jc jd ik jc iq make standard naiv word document gener independ independ word document class label assum probabl word independ posit thrun mitchel probabl word posit document posit express assumpt ik jc iq ik jc combin equat naiv express probabl document jc jd ik jc paramet individu mixtur compon multinomi distribut collect word written jc jc jc jv jg jc assum document length ident classif paramet model mixtur weight prior written probabl select mixtur compon complet collect model set multinomi prior probabl jc cg train classifi learn naiv text classifi consist estim paramet gener model set label train fd jdj subsect deriv method calcul estim train data estim written algorithm maximum posteriori find arg max probabl evid train prior distribut paramet estim formula result maxim familiar ratio empir count estim probabl word jc simpli number time word occur train data divid total number word occurr train data count numer denomin augment prior distribut type prior refer laplac smooth smooth prevent probabl infrequ occur word word probabl estim jc jc jc jdj jd jv jv jdj jd text classif label unlabel document em count number time word occur document jd class label class prior estim involv ratio count jdj jd jcj jdj deriv formula directli maximum posteriori paramet appeal deriv paramet estim formula em augment em find maxim accomplish break express term term calcul product document likelihood equat prior distribut repres uniform dirichlet jc ff paramet effect strength constant greater set ff maximum posterior laplac smooth express maxim solv system partial deriv lagrang multipli enforc constraint word probabl class sum maxim yield ratio count classifi estim paramet calcul train document equat turn gener model backward calcul probabl mixtur compon gener document deriv applic substitut equat jd jc jd ik jc jcj jd ik jc task classifi test document singl class highest posterior arg max jd select discuss note assumpt gener text document correspond mixtur compon word thrun mitchel document length violat text data document mixtur multipl topic word document independ topic make naiv classifi good job classifi text document craven yang observ part explain fact classif estim function sign binari function estim word independ assumpt naiv give extrem class probabl estim estim poor classif accuraci remain high formul naiv gener model account number time word document multinomi languag model classifi mixtur multinomi formul numer naiv text classif li mccallum formul naiv text classif gener model document word vocabulari binari model mixtur bernoulli larkei koller empir comparison show multinomi formul yield classifi consist incorpor unlabel data em proce main topic unlabel data improv text classifi naiv small set label train classif accuraci suffer varianc paramet estim gener model high augment small set larg set unlabel combin set improv paramet estim em class iter algorithm maximum likelihood maximum posteriori estim problem incomplet data unlabel data consid incomplet class label appli em naiv straightforward naiv estim label document classifi assign class label unlabel document calcul expect miss class jd classifi estim origin newli label step iter chang shown dempster al process find model paramet equal higher likelihood previou iter text classif label unlabel document em ffl collect label document unlabel document ffl build initi naiv label maximum posteriori paramet estim find arg max equat ffl loop classifi paramet measur chang log probabl label unlabel equat ffl current estim compon membership unlabel probabl mixtur compon gener jd equat ffl estim compon membership document maximum posteriori paramet estim find arg max equat ffl unlabel document predict class label tabl basic em algorithm section section describ em extens probabilist framework naiv text classif basic em set train document task build classifi form previou section unlik section assum subset document class label rest subset class label unknown disjoint partit section learn classifi approach calcul maximum posteriori estim arg max term probabl train probabl data simpli product document independ model unlabel probabl individu document sum total probabl equat label gener compon label refer mixtur class probabl data jcj jc jy thrun mitchel maxim directli work step make maxim solv system partial tractabl equat write log jcj jc log jy notic equat log sum unlabel make maxim partial deriv intract access class label matrix binari indic variabl hz ij iff ij express complet log likelihood log term insid sum jcj ij log jc dempster al recogn equat local maxim expect place result algorithm find local maximum posteriori iter hillclimb procedur altern recomput expect maximum posteriori paramet expect note label document estim unlabel document denot estim iter algorithm find local maximum iter ffl set ffl set arg max correspond calcul probabilist label jd unlabel document current estim equat maxim complet likelihood correspond calcul maximum posteriori estim current estim jd equat iter process initi label document estim classifi equat cycl begin classifi probabilist label unlabel document time algorithm iter converg point chang iter determin text classif label unlabel document em converg occur observ chang paramet height surfac em tabl outlin basic em algorithm section discuss em find local maxim likelihood paramet label unlabel method unlabel data augment limit label data contribut paramet estim interest empir question higher likelihood paramet estim improv classif accuraci section discuss fact naiv perform classif violat assumpt em note theoret justif approach depend assumpt state section data produc mixtur correspond mixtur compon class assumpt case realworld textual benefit unlabel data clear result section show method dramat improv accuraci document label document data lot label lot unlabel case incorpor unlabel data classif accuraci describ basic em algorithm aim address perform degrad due violat assumpt augment em section describ extens basic em algorithm extens improv classif accuraci face violat assumpt gener model add paramet modul em weight unlabel augment model order relax assumpt gener model weight unlabel data common scenario label document order magnitud unlabel document readili great major data determin em paramet estim unlabel set em perform model posit mixtur compon maxim likelihood unlabel document number label data thrun mitchel small comparison effect label data initi classifi paramet determin em start point hill identifi compon class label mixtur model assumpt natur cluster data correspond class cluster unlabel document result mixtur compon classif section infinit amount unlabel data suffici learn paramet mixtur mixtur model assumpt natur cluster unlabel data produc mixtur compon correspond class detriment classif accuraci effect appar number label document larg obtain good paramet estim order magnitud unlabel document overwhelm paramet estim badli skew estim subsect describ method influenc unlabel data modul order control extent em perform cluster introduc paramet likelihood equat contribut unlabel document paramet estim term result method em maxim equat jcj ij log jc jcj ij log jc notic close unlabel document influenc shape em surfac unlabel document weight label algorithm origin em iter maxim equat perform entail substitut equat defin weight factor unlabel label ae estim jc ratio word count unlabel document factor jc jc jdj jd jv jv jdj jd text classif label unlabel document em class prior modifi jdj jd jcj jd jd equat deriv solv system partial deriv lagrang multipli enforc constraint probabl sum paper select maxim crossvalid classif accuraci label train data result techniqu section shown set result classif accuraci higher indic unlabel data natur cluster result poor classif multipl mixtur compon class techniqu address violat mixtur model assumpt reduc effect violat assumpt paramet estim altern approach attack problem remov weaken restrict assumpt subsect approach relax assumpt correspond mixtur compon class replac restrict correspond mixtur compon class textual correspond class captur word distribut multipl mixtur compon class captur depend word sport class consist document hockei word word depend captur singl multinomi distribut word sport class multipl mixtur compon multinomi cover hockei accur captur pattern word class multipl multinomi mixtur compon note label unlabel unknown mixtur cover gener label document paramet estim perform label estim mixtur compon document introduc notat separ mixtur compon class denot class mixtur write class continu denot jth mixtur compon write jc thrun mitchel ffl collect label document unlabel document ffl set discount factor unlabel section ffl set number mixtur compon class section ffl label randomli assign jd mixtur compon correspond document class initi mixtur compon ffl build initi naiv label document maximum posteriori paramet estim find arg max equat ffl loop classifi paramet chang log probabl label unlabel equat ffl current estim compon membership probabl mixtur compon gener jd equat restrict membership probabl estim label document compon renorm ffl estim compon membership document maximum posteriori paramet estim find arg max equat count event paramet word document count unlabel document reduc factor equat ffl unlabel document predict class label tabl algorithm gener result section algorithm enhanc vari contribut unlabel data option multipl mixtur compon class unmark paragraph common variat algorithm map mixtur compon class paramet estim em basic build maximum posteriori paramet estim multinomi compon unlabel document treat calcul mixtur compon jd label previou jd consid fix class label vari mixtur compon assign document class algorithm calcul mixtur compon membership label document jd jc rest normal sum multipl mixtur compon class initi randomli spread label train data mixtur compon match class label compon initi perform text classif label unlabel document em jd sampl uniform distribut mixtur compon jc multipl mixtur compon classif matter probabilist document mixtur sum mixtur compon probabl class jd jc jd ik jc jcj jd ik jc select number mixtur compon class crossvalid tabl outlin em algorithm extens previou section result techniqu section shown data natur model singl compon unlabel data em degrad perform multipl mixtur compon class perform unlabel data em superior naiv result provid empir evid combin label unlabel train document em outperform tradit naiv train label document present result text usenet articl web page newswir articl result show improv accuraci due unlabel data number label train document low newsgroup data classif error reduc train label unlabel document data number label document incorpor unlabel data basic em scheme reduc accuraci show applic em extens previou section perform naiv dataset protocol newsgroup data set mccallum collect ken consist articl divid evenli usenet discuss group task classifi articl newsgroup post categori fall discuss discuss religion word stoplist common short word uniqu word occur token skip usenet header discard subject thrun mitchel token form contigu alphabet left featur normal word count document length newsgroup data set collect usenet post period month data time nearbi time word practic classifi data set classifi futur articl train articl past preserv creat test set document select post date articl newsgroup unlabel set form randomli select document remain label train set form partit remain document set set creat equal number document class experi label set creat ten fewer set experi label set document train set trial experi result report averag trial experi webkb data set web page gather comput scienc depart collect includ entireti assort page page divid depart popul page task classifi web page categori stem found stoplist hurt perform excel indic student homepag word inform gain limit vocabulari inform measur averag mutual inform class variabl featur select method commonli text koller select vocabulari size run train data optim classif accuraci webkb data set collect part effort creat crawler explor unseen comput scienc depart classifi web page ontolog mimic crawler intend avoid report perform base singl test approach creat test page complet comput scienc depart test unlabel set page form randomli select remain web page train set form method newsgroup result report averag trial share number label train document reuter distribut data set consist articl topic categori reuter newswir studi text classif label unlabel document em lier popul class build binari classifi class identifi topic word insid includ titl remov reuter tag occur top bottom document stem classifi categori perform wide vari vocabulari size chosen averag mutual inform class varianc optim vocabulari size note categori strong correspond small set word titl categori complex characterist categori narrow definit attain classif small broader definit requir larg vocabulari vocabulari size reuter trial select optim accuraci measur crossvalid label train set newsgroup data time depend reuter standard split divid articl document form test earlier train document train set randomli select form unlabel set remain train randomli select ten train set ten posit label document neg label data set number label class justifi neg class frequent posit class binari reuter classif task result reuter report breakeven standard inform retriev measur binari classif accuraci good perform metric high accuraci achiev predict neg class task data set classif posit exampl larg sea neg exampl recal captur inher dualiti defin recal correct posit predict posit exampl correct posit predict posit predict classifi achiev recal adjust boundari posit neg class previou default jd breakeven point defin recal equal algorithm experi em tabl perform conjunct make simplif comput effici run em thrun mitchel number label document unlabel document unlabel document figur classif accuraci newsgroup data unlabel document small amount train em yield accur classifi larg amount label train accur paramet estim obtain unlabel method begin converg converg train subtract word count label document turn test document run em requir run residu effect document comput complex prohibit iter requir classifi train document build classifi em converg iter time read matrix build em model iter classifi test document minut webkb data minut newsgroup newsgroup data set longer document word vocabulari em unlabel data accuraci basic em incorpor inform unlabel document figur show effect basic em unlabel data newsgroup data set vertic axi averag classifi accuraci test horizont axi amount label train data log scale vari amount label train compar classif accuraci tradit naiv unlabel em learner access unlabel document em perform significantli label document document naiv reach accuraci em achiev repres reduct classif error note em perform small number label document singl label document naiv obtain em text classif label unlabel document em number unlabel document label document label document label document label document label document figur classif accuraci vari number unlabel document effect shown newsgroup data amount label vari amount unlabel data horizont axi unlabel data note dip accuraci small amount unlabel data ad small amount label data estim compon jd unlabel document naiv word independ lot label naiv learn curv close unlabel data label data accur estim classifi paramet label document classif accuraci result statist result demonstr em find paramet estim improv classif accuraci reduc label train exampl reach classif naiv requir label em requir label exampl achiev accuraci figur effect vari amount unlabel data quantiti label hold number label document vari number unlabel document horizont axi unlabel data label data notic ad small amount unlabel data small amount label data hurt perform occur word independ assumpt naiv lead jd estim small amount unlabel data distribut sharpli bia naiv spread unlabel data evenli number unlabel document problem disappear unlabel set larg sampl smooth sharp discret naiv classif move data set provid intuit em present detail trace webkb data set thrun mitchel tabl list word predict class webkb data chang iter em specif trial iter common word symbol arbitrari digit iter iter iter intellig dd dd dd artifici lectur lectur understand cc cc dist due ident handout ru due homework arrang problem assign game set handout dartmouth tai set natur hw cognit exam logic homework problem prove prolog sec postscript knowledg postscript solut human exam solut chapter field ascii ble show evolut classifi em iter column show order list word model class word judg weight log likelihood ratio symbol arbitrari digit iter paramet estim singl label document class notic document specif artifici intellig dartmouth em iter unlabel em unlabel data find word gener indic classifi column achiev em classifi achiev accuraci vari weight unlabel data graph perform data incorpor unlabel data classif accuraci graph figur show perform basic em unlabel webkb em improv accuraci significantli amount label data small label document tradit naiv attain em reach lot label em hurt perform slightli label naiv obtain em result statist test text classif label unlabel document em number label document unlabel document unlabel document figur classif accuraci webkb data unlabel document small number label em improv accuraci label em degrad perform data assum gener model discuss section em hurt perform data fit assumpt gener mixtur compon explain unlabel data correspond class label unlabel data throw paramet estim consid number unlabel document greater number label document versu point figur largest amount label great major probabl mass estim classifi paramet unlabel data remedi dip reduc weight unlabel data vari equat figur plot classif accuraci vari achiev rel weight horizont amount label train data bottom curv obtain label vertic slice figur point em unlabel data higher accuraci naiv weight unlabel data indic classif improv augment label data heavi relianc unlabel data middl curv obtain label slice point em naiv perform cross weight indic perform naiv basic em top curv obtain label slice unweight em perform lower tradit naiv weight unlabel data point note relationship label data set size weight smaller label data larger weight unlabel data trend hold amount label data em label train paramet estim guidanc em unlabel data spite thrun mitchel weight unlabel data label document label document label document figur effect vari weight factor unlabel data curv webkb data set correspond amount label data label accuraci highest weight unlabel data amount label data accur paramet estim attain label data unlabel data receiv weight moder amount label accuraci middl extrem note magnifi vertic scale violat assumpt label train data suffici estim weight unlabel data note valu rememb point correspond em weight gener figur regular naiv pair trial test show point curv statist significantli higher end differ maxima basic em label document practic tune paramet select experi select label train set discuss section figur show accuraci accuraci select basic em naiv accuraci shown comparison perfectli accuraci domin basic em naiv curv select small amount label perform em larg amount label select suffer degrad perform basic perform naiv document level pick accuraci compar naiv basic em statist significantli naiv statist significantli higher basic em test set result automat avoid em degrad accuraci larg train set size preserv benefit em small label train set text classif label unlabel document em number label document unlabel document unlabel document cv unlabel document basic em unlabel document figur classif accuraci webkb data modul unlabel data weight factor top curv show accuraci chosen small amount label result similar basic larg amount label result accur basic em weight larg amount unlabel data longer degrad figur algorithm retain larg improv small amount label data note magnifi vertic axi facilit comparison result train set size improv method select significantli practic perform note document end section suggest method perform multipl mixtur compon class face data fit assumpt approach address problem model increment ignor unlabel data direct section chang model natur fit data flexibl ad map mixtur compon class label multipl mixtur compon class expect improv perform data class ey test appli em reuter corpu document data set multipl class categori evalu binari classifi neg class cover distinct expect task strongli violat assumpt data neg class gener singl mixtur compon model posit class singl mixtur compon neg class forti mixtur unlabel data tabl summari result test set model neg class multipl mixtur compon column show thrun mitchel tabl breakeven point show perform binari classifi reuter tradit naiv multipl mixtur compon label data basic em label unlabel multipl mixtur compon em label unlabel data number compon select optim median number compon trial neg class shown note model natur neg class consist topic unlabel data multipl mixtur compon class perform naiv categori acq corn crude earn grain interest ship trade wheat breakeven point standard naiv label model neg class singl mixtur compon column show result model neg class multipl mixtur compon label number compon select optim breakeven point median number compon select trial parenthesi breakeven point note effect unlabel complex improv perform tradit naiv column label show result basic em singl neg notic perform naiv neg class fit singl naiv class em data accur captur neg class word distribut column label show result em multipl mixtur select number compon perform naiv multipl mixtur compon measur trial statist multipl mixtur compon perform tradit naiv combin unlabel data multipl mixtur compon perform interest note mixtur compon addit unlabel data reduc varianc support express model tabl show complet result experi multipl mixtur compon unlabel note mixtur compon hurt perform text classif label unlabel document em tabl perform em number mixtur compon neg class unlabel document breakeven point shown experi forti mixtur compon note mixtur compon result poor perform categori acq corn crude earn grain interest ship trade wheat tabl perform em number mixtur compon neg unlabel data breakeven point shown experi forti mixtur compon categori acq corn crude earn grain interest ship trade wheat tabl perform multipl mixtur compon number compon select compar optim select straight naiv note select compon categori acq corn crude earn grain interest ship trade wheat assumpt overli restrict paramet estim amount data thrun mitchel obviou question select number mixtur compon access test set label select weight comput entail run em end section result techniqu compar naiv em shown tabl note perfectli select number compon perform test set result consist show select smaller number compon comput bia model favor fewer compon perform model select method perform remain effici robust method ng minimum descript length schuurman unlabel data research improv method model select algorithm area futur work relat work famili algorithm long applic applic classif statist literatur idea procedur improv classifi unclassifi data mention publish origin em paper discuss paradigm descript refer found mclachlan book mixtur model page recent studi machin learn literatur em combin label unlabel data classif naiv mixtur miller mixtur expert demonstr result data set featur textual data set order magnitud exacerb violat independ mixtur model assumpt theoret investig util unlabel data result analyz converg rate assumpt estim label unlabel data base fisher inform show linear label versu unlabel data analysi assum unlabel data suffici estim paramet assum target concept recov target label assumpt unrealist shown unlabel data improv text classif label unlabel document em classif result absenc label data analysi investig classif error work appli em fill miss miss valu class label unlabel train exampl work ghahramani jordan machin learn literatur em mixtur model fill miss valu emphasi miss featur focu augment small complet set label data autoclass project investig combin naiv gener model emphasi research discoveri cluster learn unlabel data multipl mixtur compon class mixtur improv model probabl densiti function jaakkola jordan provid gener discuss mixtur improv field approxim naiv paradigm reduc label train exampl activ learn algorithm repeatedli select unlabel human label true class rebuild classifi activ learn algorithm differ method select unlabel exampl appli text lier relev sampl uncertainti sampl recent work author combin activ learn em appli unlabel document inform algorithm choic document label boost accuraci document remain unlabel result show combin activ learn em requir slightli half label train exampl achiev accuraci activ learn em varieti statist techniqu naiv appli text includ support vector machin nearest neighbor exponenti gradient cover algorithm naiv paper strong probabilist foundat effici larg data set thrust paper straightforwardli demonstr unlabel similar approach appli unlabel data complex classifi summari paper explor question unlabel data supplement scarc label data machin learn learn classifi text document import question text high cost data avail thrun mitchel larg volum unlabel data paper present motiv argument unlabel algorithm advantag result show improv unlabel document train classifi text classif task motiv argument set unlabel data accuraci learn probabl distribut gener document mixtur mixtur compon correspond class label condit fit model naiv classifi full complex text data complet captur statist model interest perform classifi base gener model make incorrect assumpt data data inconsist assumpt method adjust rel contribut unlabel prevent unlabel data degrad classif accuraci augment basic em studi effect multipl mixtur compon class effort relax assumpt make gener model match data result show improv suggest explor complex mixtur model correspond textual data distribut result recommend studi improv current method select unlabel data weight number mixtur compon class algorithm unlabel data requir closer match data gener model label data intend target concept model differ actual distribut data unlabel data hurt perform futur work intend make closer theoret empir studi tradeoff unlabel data inher model inadequaci interest direct futur work unlabel data task formul benefit activ learn explicit model unlabel data incorpor improv select exampl request label improv classif accuraci exampl remain unlabel initi studi area begun increment learn algorithm test phase unlabel test data receiv earli test phase order improv perform test data problem domain share similar text label abund unlabel data inform extract domain appli techniqu paper improv perform area text classif label unlabel document em acknowledg larri wasserman extens theoret aspect work anonym review suggest correct doug baker format reuter data set research support part darpa program contract note assumpt relax section make correspond argument unlabel data generaliz scenario work relax assumpt fashion paper standard notat shorthand random jy written jy random variabl valu previou naiv formal includ document length effect gener document length model basi dirichlet conjug prior distribut multinomi dirichlet distribut discuss detail stolck omohundro data set internet statist result number label exampl multipl pair number label exampl singl report result mcnemar test test discuss dietterich weight log likelihood ratio rank word figur jc log jc understood term word contribut averag ineffici encod word class code optim distribut word sum quantiti word diverg distribut word distribut word refer exponenti label sampl pattern recognit rel label unlabel sampl pattern recognit unknown mix paramet ieee transact inform bayesian classif theori result advanc knowledg discoveri data mine mit press optim rate converg finit mixtur model annal thrun mitchel learn method text categor sigir nineteenth annual intern acm sigir confer research develop inform pp element inform theori john wilei york learn extract symbol knowledg world wide web fifteenth nation confer artifici pp sampl train probabilist classifi machin twelfth intern confer pp maximum likelihood incomplet data em algorithm journal royal statist seri probabilist theori pattern recognit springer berlin approxim statist test compar classif learn algorithm neural optim simpl bayesian classifi loss machin data mine knowledg learn incomplet data em approach advanc neural inform process system pp improv field approxim mixtur distribut learn graphic model kluwer academ publish probabilist analysi rocchio algorithm tfidf text categor machin fourteenth intern confer pp text categor support vector learn relev featur machin tenth european confer machin pp hierarch classifi document word machin fourteenth intern confer pp learn filter netnew machin twelfth intern confer pp combin classifi text categor sigir nineteenth annual intern acm sigir confer research develop inform pp text classif label unlabel document em theori point estim wilei york evalu phrasal cluster text categor task sigir fifteenth annual intern acm sigir confer research develop inform pp sequenti algorithm train text addit data sigir naiv independ assumpt inform retriev machin tenth european confer machin pp sequenti algorithm train text classifi sigir seventeenth annual intern acm sigir confer research develop inform pp thread electron preliminari studi inform process comparison learn algorithm text categor annual symposium document analysi inform pp document classif finit mixtur model annual meet associ comput pp activ learn text categor fourteenth nation confer artifici intellig pp comparison event model naiv text classif workshop learn text categor tech rep aaai press improv text shrinkag hierarchi class machin fifteenth intern confer pp emploi em activ learn text classif machin fifteenth intern confer pp mixtur model marcel york mixtur expert classifi learn base label unlabel data advanc neural inform process system pp machin learn york prevent data machin fourteenth intern confer pp syskil identifi interest web site thirteenth nation confer artifici intellig pp thrun mitchel learn mixtur label unlabel exampl parametr side inform eighth annual confer comput learn pp prior integ estim minimum descript length annal relev weight search term journal american societi inform relev feedback inform retriev smart retriev automat document process prentic englewood nj approach filter junk workshop learn text categor tech rep aaai press develop automat text retriev approach model select fourteenth nation confer artifici intellig pp effect unlabel sampl reduc small sampl size problem mitig hugh phenomenon ieee transact remot intellig agent approach workshop learn text categor tech rep aaai press model merg hidden markov model induct tech rep berkelei expert effect effici learn human text categor retriev sigir seventeenth annual intern acm sigir confer research develop inform pp evalu statist approach text categor journal inform retriev featur select statist learn text categor machin fourteenth intern confer pp
DB/1388 3 applic learn italian languag depart comput engin school electr engin pob yugoslavia web engin tune advanc web educ internet develop technolog tool enabl interact creativ manag domain includ interfac artifici intellig base tool improv learn applic learn italian languag student product develop cooper paper present basic element applic implement discuss possibl gener environ describ experi explain lesson learn stress statist analysi success product reli classic approach introduct rapid growth internet medium internet technolog led point educ detach human book knowledg earli internet exploit educ institut dissemin research knowledg gener shape requir lot attent user sourc knowledg includ resourc inform drove user main subject step educ uniform page text imag context sensit system adapt hypermedia system attempt tune simplist fashion side common classroom teacher face row student student listen carefulli teacher learn juli august depart italian languag literatur school yugoslavia dipartimento di ingegneria ed ingegneria universita itali pose question bore subject postpon lectur suitabl session tradit educ approach strength weak good collabor coordin student limit knowledg hard upgrad fail adapt student educ lot learn make huge amount inform period paper present good effort unit advantag tradit cyber educ paradigm problem statement goal studi exploit outcom train environ paper special cover applic field teach italian languag environ easi maintain intellig educ environ design detail consid primari issu design data multifacet manipul intellig incorpor decid reli techniqu broadli standard packag solut offer requir function platform support abstract object easili deploi regular web browser addit softwar hardwar tangibl form underli manag easi access object easi function upgrad environ meant wider object improv train learn reduct train sophist industri intellectu capit declin learner train steeper learn outcom project includ basic customiz user domain methodolog qualifi compet test final realiz complet solut directli perform train technolog tend evalu abil adequ effect transmit inform great deal experienti evid real learn involv recept case languag issu intend examin posit learn place brain technolog design evalu basi effect student brain exist solut train concern learn wider exist numer flavor exist solut primarili aim prototyp specif train skill major put materi make author parti interest predomin type onlin educ static virtual textbook fix set network web organ textbook multimedia put studi similar standard book textbook advantag resourc net make deepen subject drawback attent drift interest easi find interest virtual browser window type educ regard potenti train technolog industri corpor train significantli drop product cost improv product qualiti challeng set develop educ applic offer amount interact adapt adapt import web access great varieti user work home teacher colleagu side recogn assist exhibit interact kei condit make adapt strictli categor educ describ gener techniqu critic adapt filter system user find relev drop knowledg knowledg pool system offer function intellig train system adapt inform system person inform knowledg specif user access inform perform blend inform artifici intellig ai orient plain multimedia simul condit hinder sophist approach includ adapt hypermedia system base appli set util user order adapt content link hypermedia page individu user intellig tutor system knowledg teach strategi provid adapt individu learn tutor good approach suit gener train requir collabor cooper perform system locat ah implement techniqu satisfactori lack robust educ tool cyber knowledg resourc rapidli accumul distribut call creation environ percept importantli adjust individu user requir enabl technolog circumst internet comput commun capac compar accustom logic deliveri standard solut logic retriev inform learn environ distribut network publicli electron equip network major environ transcend cyberspac resembl tradit classroom larg desk face straight row desk teacher longer present facilit group work make student question resourc answer fundament paradigm inevit teacher formula formula offer depend analysi presenc distant train import memor knowledg skill approach freedom reliev time posit anim student collabor answer question unanticip design system meant prevent teacher react obviou student question uncertainti requir knowledg base incorpor kind faq messag board knowledg exchang lead synergist result system monitor suppli materi suitabl teacher concentr main plain deliv guid student unforeseen encourag student benefit result approach highli qualifi person divid larger number achiev level compet tradit train environ customari student pose question uncertainti clarif offer mean commun student teacher level chat forum icq develop vrml interfac student classroom featur enabl synergist gener main qualiti classic approach type inhabit administr provid concern put piec knowledg tool upload capabl text raster similar file type requir provid contribut content call content provid knowledg provid resembl book publish administr concern give access peopl decid pedagog polici administr role develop system learn process mean learn materi fit ambit make structur knowledg student model student made student learn session monitor expert model learn perform curriculum decid knowledg materi hint offer mean student individu decid question converg person socrat fingertip special attent user interfac specif learn session occupi rare avoid activ window hint highlight item singl materi present detail import achiev comfort provid imagin blend ui design interfac reli robust technolog extens markup languag extens stylesheet languag cascad style sheet dynam support java program languag web deliveri solut advantag user reli web browser wide distribut central user provid advanc function java develop control behavior element render element latest xsl draft visual present css state approach enabl develop innov environ incorpor tangibl benefit virtual tradit learn minim shortcom approach classic languag learn tool tradit languag learn tool publish video accessori disc contemporari textbook base modern achiev appli modern psycholog learn linguist theori languag acquisit appli modern approach author place tradit mention commun aim gain level commun compet modern base theoret made european languag expert relev base initi clear theoret practic instruct linguist expert european council level threshold level base similar linguist independ european mention tool repres complet defin system enabl student follow process learn acquir foreign languag didact process base standard unit scheme textbook intend group learn individu learn scheme justifi introduc term respect prioriti easier unknown essenc approach solut relat relat linguist discuss essenc technic innov demand free user burden familiar technolog prerequisit minimum version web browser access web browser packag support multimedia standard found java applet javascript client side improv qualiti learn materi set static graphic raw audio file standard typic insuffici educ includ multimedia browser reli helper applic quicktim movi current effort main player web browser suppli product util automat download updat netscap microsoft activ paragraph condit assumpt enabl system access net architectur open compon level compon dedic transfer compon middl layer load balanc criteria enhanc reason capabl cbr modul integr part plug plai configur interfac defin metadata set standard complianc forward compat issu greatli reduc futur mainten effort reengin exploit implement specif elimin differ javascript world wide web consortium program modul pure java tm document project complet de facto standard design document softwar system uml diagram system design lot understand export java code enabl greater number develop programm project assum knowledg provid knowledg essenc linguist innov internet presum individu select mention possibl educ process train system tradit didact order relat tradit give possibl creat specif individu learn process approach languag learn presum initi possess level knowledg italian give result knowledg morpholog syntact categori knowledg basic terminolog detect wrong program lead kei lead grammat explan relat mistak option presum student updat knowledg creat automat individu didact curriculum student separ textbook vertic diagon tradit lose characterist tool type coher scheme tradit tool tool prospect greater shorter period lost time repetit teach program possibl creat group level acquir languag skill group creat program detect mistak particip subscrib connect encourag detect tini detail situat tradit languag teach difficult technic detail interest system present sketch architectur design view method outlin give detail architectur initi research encompass client applic server tier idea client thin perform busi logic java chosen languag offer test hold java remot method invoc client middl tier implement java http call pass argument applic server tier process input java connect commun jdbc driver implement api implement client inhabit middl tier resid data center campu compani inform server center ad architectur enhanc order fulfil extra tier server tier client applic reusabl servic server tier resid close reduc commun reduc cach prefetch mechan client http request process java webserv decid action servic server servic determin servic local servic rmi corba call remot server special featur knowledg provid curriculum sequenc author knowledg complex user implement java applic result architectur displai figur horizont number instanc comput commun client access server modem serv app server queri link optic link multimedia rich knowledg altern resid separ applic data replic mechan requir tier includ separ knowledg defin knowledg textual multimedia curriculum sequenc roadmap learn user profil complet user model includ prefer portfolio part expert model definit teach strategi commun applet creat rmi object regist object rmi object registri secur client invok java webserv url java servlet api manag secur addit tier solv problem reduc download time dynam download runtim applic cach applet static applic data closer client sandbox secur model java prohibit applet access local network resourc commun machin applet download sign applet relax secur set trust applet problem browser support trust applet substanti infrastructur ad acoust approach achiev import dimens compon ad system enabl student listen nativ speaker italian click individu student obtain acoust student practic skill listen client server applic tier receiv data request perform complex data acquisit issu set queri type architectur emploi wan environ corpor academ connect user java servlet receiv http rmi request determin servic user id pass augment javascript code connect user open creat cooki fast user profil activ user local perform inform exist object jvm memori object remain protect jvm memori updat long user drop queue environ optim approach consid java applet optim java tm perform engin applic pursu maximum java good employ applic consid applic intellig includ design architectur design program model program model tm compon design base outlin explan distinct issu provid section knowledg repres jdbc applic server figur architectur adapt individu advanc featur intellig cach adapt load balanc mechan implement applet resid server crucial compon intellig tutor system modul linguist experi mind train system successfulli appli industri thought program appli successfulli field languag learn acquisit chosen italian languag level possibl check immedi effect popul year student major italian school morpholog syntact problem italian includ element plane level knowledg curriculum aim enabl user gain adequ linguist compet special stress enabl read write speak italian translat bilingu dictionari properli consist part part consist didact label didact unit deal italian phonem orthograph didact unit deal central problem italian problem introduc italian text italian text gradual simpl text contemporari italian literatur acoust specif gradual lexic text literari written select order respond specif possibl student level knowledg text intend check read enabl lexic enrich applic acquir knowledg didact text popular contemporari italian song support acoust part text written section final examin consist translat treat case complement lexic grammat part text chosen read origin italian text prepar student autonom read linguist analysi contemporari italian literatur part contrast lexic point dealt part subpart subpart consist origin text acquisit check fix acquir knowledg instruct italian aim languag italian part newli introduc explain descript italian synonym knowledg level requir curriculum year student explan mean context cover statist student inform found internet teach process standard lesson teacher student possibl autonom internet occas written section questionnair distribut student final mark student decid oral fifteen dai written section exam valu correl questionnair made dai dai start internet major hypothesi underli questionnair summar internet grade final question improv internet attent student tire internet bring effect younger popul linguist questionnair order concret valu relat applic system field italian languag prepar questionnair question gener divid main wai possibl internet comput technolog wai possibl educ program italian languag learn question questionnair relat research hypothesi internet home home internet chat internet studi italian cultur student dictionari encyclopedia unreach greatest extent explan attract part grammat explan topic subject field italian civil close connect morpholog transform consid part close connect morpholog transform consid tire part student enrich greater extent authent materi topic subject field italian civil high school experi set textbook select elementari high school port high school student master subject creat statist compar experi expect posit effect technolog pronounc case younger popul detail experi scope paper continu educ experi popular textbook enabl gener popul learn italian port system book professor famou yugoslavia experi relat textbook creat end previou discuss essenti issu section discuss lesson learn find gener distribut student attempt internet technolog student high creat reliabl statist answer number import discuss student internet prepar percentag time spent compar total studi maximum figur tradit method deepli built habit typic student popul issu import distribut time spent student tendenc spend time long time expect total time distribut time chang futur expect futur student hope student spent time grade notic regular notic higher import exam question student achiev higher percentag answer case fairli situat classic approach question classic good thing expect student make easier follow materi internet technolog dramat percentag feel tire peopl fun student save amount time time rang save achiev advanc technic featur incorpor analysi student suggest domain subject follow research student habit interest feel technic structur function made compat gener habit interest innov effect system maxim analysi issu subject paper research left practic implic paradigm evalu practic revolut work attempt direct numer approach applic mean util technolog lot space research social implic suffici recogn good evalu experi show approach illustr futur effort research area cite object intern forum educ technolog societi encourag discuss issu affect educ system develop educ commun conduct multipl discuss thread specif topic approach develop specif aspect design implement integr learn environ sharpen vision process educ discuss aim definit reach discuss structur form problem fix term discuss end put concret form public blend good practic tradit exist train environ kei success train environ examin learn teach tendenc environ led creation hybrid train open futur develop insight internet domain make design crucial make system extens user futur develop forward creativ input insid environ futur plan includ prove concept util field studi research incorpor adapt ai techniqu expect follow environ win battl ultim user integr interfac linguist pedagog point demonstr student hold attent averag longer teach tool score exam tradit score exam effect pronounc student tire long hour learn note italian materi url chang interest parti consult updat refer divid refer paragraph found engin linguist engin refer brusilovski educ system review comput interact carnegi mellon java sun architectur applic internet vol number java bean ibm san francisco ibm white paper markup languag version web standard publish world wide web consortium object model level document version recommend stylesheet languag specif world wide web consortium work draft apr style level world wide web consortium recommend dec jan languag specif uml model languag object manag group intern forum educ technolog linguist refer italian il za
ML/1389 6 approxim oper boolean algebra goodman code space naval warfar system center san ca usa email depart comput scienc texa el paso el tx usa email abstract approxim result logic fuzzi logic show similar result proven boolean logic introduct studi boolean algebra start bool consid simplest boolean algebra algebra oper negat direct logic mean boolean arbitrari arbitrari function repres superposit basic logic implic repres logic area applic boolean start classic kolmogorov monograph boolean algebra algebra event import tool foundat probabl contrast boolean algebra complex boolean function repres term basic oper function rare probabl standard oper oper explicitli term complex event easili complex hypothet condit event probabl equal condit probabl oper result due detail chapter research thought express condit event basic oper boolean describ event boolean algebra recent oper explicitli repres term describ condit event boolean algebra formal describ condit event individu potenti infinit sequenc similar interpret true moment time comment describ formal term reader familiar main notion mathemat probabl reader skip comment formal origin boolean algebra event infinit sequenc event product measur construct standard probabl theori formul prove limit boolean algebra event event interpret end comment success oper natur import ffl boolean algebra oper composit basic ffl boolean oper composit basic add fourth oper finit oper composit ffl add fourth oper oper approxim composit give answer question definit boolean posit integ function proposit boolean algebra exist oper repres composit constant proof base fact boolean algebra oper oper repres composit smaller number reader proof end comment fact oper repres exist condit ch section suffici exist oper kn valu ki standard algebra describ standard logic boolean algebra algebra mean boolean algebra element correspond logic interpret oper repres composit basic logic situat similar wide logic call fuzzi logic set truth valu interv fuzzi repres arbitrari oper composit basic logic unari oper call hedg reason conjectur add unari similar boolean logic conjectur true finit boolean definit arbitrari boolean algebra defin absolut truth oper function similar crude function point similar ffi defin ffi ffi easili ffi proposit finit boolean posit integ oper repres composit constant form defin def equal similar possibl repres arbitrari function linear combin pp xn da dan case variabl integ analogu xn ffi ffi xn formula hold infinit boolean infinit union finit longer proposit exist infinit boolean algebra matter finit countabl class oper exist unari oper repres composit constant oper class repres approxim reason framework natur defin mean word true stone theorem state boolean algebra isomorph class compact open subset compact topolog space view definit definit compact metric space metric denot boolean algebra gener compact subset boolean defin hausdorff metric dh max ae max max oe def min arbitrari posit real number oper call dh proposit compact metric continu oper exist composit proof proposit boolean algebra element boolean algebra set mean number element greater oper simpli function set element set element total number oper oper repres composit gener rule boolean reduc composit xn disjunct normal form conjunct form def def constant boolean algebra express type combin element assign lead fix oper fix valu xn combin xn combin reconstruct oper correspond function set set function oper complet show number oper smaller total number oper ffl finit conclud ffl infinit finit exist oper proposit proven proof proposit definit describ equal term oper easili prove express equal equal express equal proof straightforward easili check arbitrari function repres form proposit proven proof proposit desir boolean algebra class finit complement subset set real number continuum continuum entir algebra repres countabl union set cardin set cardin continuum total number unari function equal countabl formula blank place constant continuum substitut constant continuum function unari exist unari oper proposit proven proof proposit oper continu function compact uniformli exist ffi dh ffi dh compact metric finit finit list union close ball fx radii center denot set show oper defin jn sequenc element construct union ball intersect jn show dh ffi due choic conclud jn prove dh prove ffl element element ffl element element prove statement form exist mean conclud boolean algebra definit conclud element prove statement defin union ball intersect conclud ball exist element show desir element conclud conclud ffi statement proposit acknowledg work support part nasa cooper agreement nsf grant unit space allianc grant na futur aerospac scienc technolog program center structur integr aerospac effort sponsor air forc offic scientif air forc materiel grant number nation secur agenc grant refer investig law walton reprint condit infer logic intellig north goodman relat condit event algebra random set applic data nguyen random theori pp der translat foundat theori form fuzzi logic applic kolmogorov intern journal vol pp boolean function north cardin ordin boolean academ axiomat set distribut theori transform
ML/1390 6 reason scienc applic david aha navi center appli research artifici intellig naval research code dc usa abstract surprisingli larg number research disciplin contribut develop knowledg lazi problem storag ground case demand driven queri reason increasingli popular approach design expert system implement approach paper list pointer contribut relat disciplin offer insight cbr research outlin small number navi applic base approach demonstr breadth applic list success fail attempt appli list predict futur role cbr applic reason reason subject experi difficult find consensu detail definit cbr mean thing group peopl interpret ffl cognit cbr plausibl model cognit process ffl artifici intellig cbr comput paradigm problem solv ffl expert system cbr design model expert system stand architectur introduc cbr requir identifi context variant aamodt plaza cycl frequent introduc cbr ai research figur displai view step input problem descript output solut retriev set store case problem judg similar appli solut retriev combin knowledg sourc adapt retriev attempt solv problem evalu appli construct solut current problem outcom solut requir ad triplet outcom librari case case librari problem retriev input retriev case retriev domain model solut retain learn case review outcom figur view reason problem solv cycl ai todai popular cbr research direct interact involv method refin step cbr multimod reason architectur cognit view cbr popular roger schank colleagu late yale riesbeck lead usa darpa workshop german cbr commun held annual cbr workshop european unit kingdom meet signal growth interest artifici intellig expert system cognit scienc recent cbr meet research comput scienc cognit intern meet leak recent book materi devot cognit model schank recent book relat cbr stress issu comput includ design maher expert system machin learn applic research disciplin machin cognit process contribut grow bodi knowledg reason case cbr public relat contribut cbr research base invit talk intern confer knowledg base system appli artifici begin section survei research relat cbr research benefit develop cbr approach describ small set navi project exemplifi varieti role cbr appli expert system task discuss success failur practic cbr list focu area cbr approach expect contribut reason basic notion reason storag similar familiar research disciplin cbr research uniqu posit learn advanc prove advantag studi altern strategi design expert system larg varieti role cbr techniqu assist expert system argu complet cbr symbol solut frequent studi cbr argu distinct characterist lazi problem ti cbr research disciplin lazi problem solv form problem solv comput perform basi defin pure lazi problem solver displai begin process input inform request respond request combin inform store data dismiss temporari intermedi result creat problem solv eager algorithm compil input data structur discard repli inform request priori compil retain futur request context learn neighbor classifi lazi algorithm greedili induc tree eager distinct exhibit interest tradeoff benefit lazi problem solv approach lazi approach requir avail case rule true machin learn significantli knowledg acquisit effort structur case problem solv case raw problem solv rule abstract gener guid compil increment lazi approach typic low train data cost comparison approach attempt compil data abstract tradeoff exist lazi approach requir work answer inform smart cach scheme workload clark disjunct solut lazi approach task solut space make approach replac data abstract virtu store discard case lazi approach gener explan base retriev characterist deriv store set case manner tabl research area relat lazi problem solv research area topic cognit psycholog exemplar model pattern recognit edit neighbor classifi machin learn approach cognit scienc analog inform retriev document retriev local weight regress data structur recent variant tree softwar engin softwar process plan variant process plan sequenti problem sequenti task benefit storag histori form state lead current state lazi approach store disambigu state compel reason lazi problem solv approach highli expert relat problem solv behavior wai suggest form reason discuss benefit lazi approach section collect articl focuss lazi learn lazi problem solv distinguish characterist cbr perform reason store librari case perspect describ impact research disciplin cbr research section exemplifi role cbr techniqu applic section scienc varieti wai research contribut reason relat benefit perform promot awar bodi knowledg research area list tabl relat cbr due time briefli describ research object provid pointer relev research cognit psycholog relat research cognit psycholog human concept cbr research claim algorithm base nearest neighbor retriev support human subject studi claim mislead smith inspir cbr argu support exist refer algorithm base probabl choic similar store case contribut categor predict base similar schaffer context model base approach implicit model shepard call law state probabl human subject stimuli exponenti function distanc psycholog shepard show law account year human subject gener context clarifi context model emploi assumpt report enorm support psycholog plausibl model claim human base categor store case show embodi account prototyp show exemplar model account behavior human subject data neural network architectur base radial basi function cbr behavior captur altern architectur area rich topic includ model select attent featur correl frequent empir comparison model concept studi cognit plausibl model concept featur research show extens favorit model outperform correl subject previou model altern introduc number free paramet assum process model exist set paramet valu model close correl subject extens model competit exemplar model design close imit abstract visa versa emphasi studi combin process model alert cbr research fact design approach advantag advanc eager lazi variant approach exist pattern recognit relat pattern recognit research lazi algorithm cognit frequent classif pattern recognit research topic began process model addit issu fix hodg gener credit discov simpl neighbor predict case class determin function similar store case cbr research benefit studi pattern recognit case delet research investig variant edit classifi research line wilson incorrectli classifi case delet brown research introduct algorithm probabl error close approach optim rate previou algorithm intuit classifi delet atyp deliv reason accuraci typic atyp case hart popular studi algorithm delet correctli classifi argu atyp case provid inform class boundari line research empir focu threshold iter delet featur select combin strategi investig detail dasarathi collect classic paper relat research interest ai commun case delet strong ijcai paper award paper topic probabl advanc pattern recognit topic interest cbr research work dasarathi learn make predict store case interest advanc approach data structur made research area pattern recognit research learn limit edit classifi interest studi retriev relat earlier contribut pattern recognit continu commun machin learn research machin learn lazi problem solv cognit psycholog pattern frequent classif advanc lazi learn modifi cbr problem solv research advanc lazi learn exist problem concern cbr research address relat ml form toler miss featur increment relat issu contribut ml relat lazi problem solv roughli dichotom concern incorpor eager characterist lazi algorithm visa versa research investig close integr combin lazi eager approach eager realiz lazi ml research work pure lazi needlessli memori cpu intens ml research method cach inform lazi algorithm earliest research lazi learn report ml meet bradshaw introduc phrase learn work dissert task recogn spoken introduc algorithm disjunct span attempt locat centroid disjunct kibler aha introduc similar algorithm perform instanc filter retain correctli classifi instanc averag algorithm highli similar earlier research pattern recognit disjunct span close algorithm simplif cnn earli lazi algorithm undergon dramat design enhanc research studi lazi learn includ ffl case select ffl concept distribut skew ffl concept shift ffl learn ffl discret wilson synonym describ algorithm includ reflect focu process reason prefer phrase lazi impli cnn ffl featur select weight cain ricci kohavi ling maron wettschereck ffl inform theori wettschereck ffl aha aha ffl parallel implement ffl prefer learn ffl speedup techniqu daeleman ffl storag reduct wilson ffl symbol featur ffl vote techniqu ricci incomplet attempt relat approach public improv scope applic interest research topic investig altern lazi approach salzberg wettschereck dietterich domingo investig algorithm gener case rule elliot scott examin defin similar hierarch structur emd wettschereck lazi algorithm case langlei al examin matrix probabl case amount ml research lazi algorithm robot control task connel mae excel survei relationship statist strongli advoc fairli pure lazi approach impress amount paramet tune perform predict task import lesson cbr research set paramet typic consid ai research lazi learn small subset paramet consid research statist research formal lazi inspir pac learn framework albert lin turnei analyz error research address averag case studi langlei okamoto griffith dissert addit work fewer formal studi case issu relat cbr research endeavor pursu contribut line research lazi realiz eager interest branch recent investig benefit lazi approach thought eager algorithm friedman smyth cunningham friedman al benefit lazi approach tree induct primari advantag tree creat algorithm featur tree pertin queri miss valu consid benefit includ classif accuraci webb investig similar idea algorithm lesson cbr research approach cbr impact design index strategi plan view lazi task epstein shih demonstr lazi reason sequenc case improv plan perform bridg plai task integr lazi eager section describ exampl coupl integr eager lazi learn approach categor contribut eager data structur emploi integr ml research explor benefit integr lazi eager approach enhanc learn perform weiss investig tree induct lazi algorithm leav ting examin util lazi learn small tree determin small disjunct exist answer queri quinlan examin tree predict modifi predict lazi learner utgoff examin tree effici increment updat store case leav reminisc cobweb evalu function updat hierarchi similar approach prove guid increment modif index structur case retriev rule widmer descript cluster set case relat similar research cluster mention zhang michalski extens aq approach rule induct specif case store rule set genet research featur weight select approach lazi algorithm genet algorithm kelli wilson salzberg investig genet algorithm provid good exampl lazi classifi context missil task neural earli research util specif instanc node neural network lazi classifi close relationship radial basi network emploi hidden unit fix specif locat instanc space bayesian heckerman describ bayesian network diagnosi specif focu learn issu al bayesian framework cbr fewer integr approach expect learn issu reinforc moor atkeson priorit sweep speed reinforc learn process gener idea focu learn effort guid previou interest experi mccallum explain store case tori explor trace solv state problem analyt research learn examin util lazi approach deduct tadep clark holt borrajo veloso shown lazi learn approach effici acquir control knowledg increment plan process summari section briefli investig research relat cbr neglect research close relat research pursu cognit scienc comput analog inform retriev infer network physic provabl correct adapt function set domain softwar engin softwar statist partit tangent distanc function hasti enorm amount research reason case research publish disciplin applic area good match lazi approach research natur languag learn daeleman involv work data set concept highli disjunct lazi approach benefit eager approach suggest studi lazi realiz eager approach natur languag learn task good applic area concern robot control survei select lazi approach control task discuss relat lesson suggest decid altern reason approach ffl increment approach suit increment learn task prevent prematur select summari abstract ffl highli disjunct approach suit task abstract tend yield highli disjunct space natur languag process eager approach combin disjunct repres reduc task perform ffl tempor reason sequenc proven effect task select move game disambigu state potenti cbr type sequenti task worth investig ffl lazi approach provid enorm benefit local inform state gener predict friedman abstract approach attempt fit case lose inform crucial specif queri ffl train approach cheaper store inform cbr prefer task storag speed valu highli effici cach mechan reduc time respond subsequ inform request ffl miss lazi toler miss valu lazi method exist requir process valu queri ffl retain specif aid system reason case explain system behavior approach discard characterist explan base abstract gener set case demand cbr approach limit tend larger storag demand attent definit case retriev adapt strongli encourag compar analysi pro con cbr approach task applic approach appli broad spectrum problem role reader interest detail consult www page kaiserslautern repeat discuss small number navi cbr role model plai featur select bankert aha describ eager realiz lazi approach featur select bankert report applic tradit featur select algorithm cloud classif task cluster algorithm evalu qualiti featur neural network classifi report reason found wrapper approach algorithm featur subset evalu prefer classifi significantli classif accuraci algorithm cach inform featur focu classif pure eager realiz lazi approach lesson learn low train cost requir cbr approach featur select evalu larg number featur subset train speed concern elimin hope eager approach examin altern output task found output code type distribut enhanc cost speed storag feasibl ecoc case retriev task assist distinguish case investig robot navig grefenstett describ integr lazi eager problem solv approach robot navig task anytim learn world state sensor input previou research shown genet algorithm learn rule control robot behavior guid robot solv navig task grefenstett interest develop extens research sensor failur toler pursu learn rule popul world state correspond subset sensor work properli monitor sensor trigger algorithm select rule popul grefenstett view multipl rule popul case case popul approach select import part case popul trigger world state monitor approach robot gracefulli recov sensor world significantli quickli multipl rule popul cach approach pursu ongo project naval research laboratori center appli research artifici intellig interact troubleshoot naval personnel work weapon system challeng troubleshoot task system volum dedic troubleshoot scenario difficult short dictat personnel time master machineri work cbr approach assist naval personnel troubleshoot complex system applic work onboard personnel contact fleet technic servic center troubleshoot question personnel center access cbr tool answer walk solut requir short system troubleshoot answer question point system permit troubleshoot answer small set system continu process pertin answer unknown field version approach requir construct case includ cach relev weight question ten call week handl naval personnel center successfulli appli eagerli realiz lazi approach summari addit navi cbr applic mention ongo project target cbr approach navi applic involv compar record process empir softwar test task task determin modul exhibit behavior anomali applic involv cbr technolog train user oper transmiss electron microscop success failur reason section briefli describ success fail cbr ventur concentr realworld experi pure larg part experi lesson suggest pursu import research direct success section list categori task cbr successfulli appli mention compani product focu task inform compani pursu interest task success cbr interact troubleshoot extens applic cbr technolog area interact troubleshoot infer corpor corpor contract organ infer cbr content navig product desk www applic product base cbr approach mention section extrem successfulli appli dai followup extrem popular pc game approxim client server answer troubleshoot question phone applic lower cost call center support reason infer success target nich good fit cbr remot troubleshoot client answer inform inform approach prompt question standard tree suitabl client design focu tool concern system demand learn curv author case librari group research simplifi case author task system creat aid pursu specif method simplifi case librari aha breslow describ compon enforc case author guidelin case librari case edit case modifi tree simplifi edit process found librari test show retriev effici burden case author design case simplifi task question method weight question exist case retriev algorithm classif task investig limit linear program approach automat assign compar method base extract weight tree elimin assign question simplifi task case author dialogu system begin input natur languag text descript user problem current method interpret text easili relat case librari text typic implicitli answer question case librari system permit user insert rule relat text relat question rule huge number advoc strategi case author interact guid system build model object case librari model question relat object model current problem descript user text answer model relat retriev engin answer question case librari examin parka support process inform cbr research activ view recommend firefli compani begin market softwar develop tool cbr compon make recommend client applic recommend book read system begin insert base past read experi interest consult larg case librari similar input book detail fact book system respond set suggest deriv similar read prefer exhibit case librari barn nobl develop applic firefli offic system function recommend system limit suggest book prefer challeng electron date servic kri hammond group explor similar idea chicago internet commerc develop product close relat recommend gear internet commerc task onlin tool task sale consult product catalogu extract product requir retriev product model client interest model updat feedback model product announc retriev learn user model distinguish characterist approach reason failur short list failur appli cbr familiar expert system research corpor support import object ai applic obtain corpor support project success applic flourish marc goodman creat applic project visual machin machin suffer cost sensor read shut prevent damag machin current content discard reduc goodman system compar current state machin record access simul predict futur state notifi user sensor problem anticip high probabl applic greatli reduc cost corpor support project due corpor polit result kill possibl futur cbr applic kitano al necess corpor support cbr project knowledg acquisit cbr magic bullet expert system commun technolog demand attent process case bear resembl knowledg engin emphasi develop case librari deliv solut client commerci cbr tool successfulli appli client task client recogn case author skill requir creat success cbr applic client option turn cbr compani consult servic proposit develop client compani compani decid pursu abandon cbr applic client compani chosen option simplifi case author task great practic prospect client commerci cbr tool scope applic cbr failur concern mismatch capabl cbr tool intend task task match cbr tool draw benefit cbr section tool practic task made potenti client compani invest cbr technolog strategi inform type problem cbr examin problem similar characterist cbr approach broad scope anticip kind reveal cbr compon role industri govern problem solv applic predict reason cbr research commerci commun current predict trend futur cbr applic continu current applic recommend system includ internet continu focu reduc user requir simplifi case author broaden abil integr eager learn model subsequ user prefer inform case repres structur respect compar unstructur data sourc document activ extract inform structur form record case cach approach simplifi answer similar inform request infer pursu strategi recent product design system solv sequenti problem solv task record histori inform cbr assist comparison made histori direct aid activ knowledg primari concern corpor entiti record knowledg motiv turnov mean loss loss intellectu capit excel applic area reason technolog begin pursu content remain predict interdisciplinari research reason disciplin advanc cbr influenc direct research variant process inform machin learn contribut drawn export commun summari paper briefli present argument reason research lazi problem solv model underli cbr cycl research part cycl typic interest disciplin larg assort wai approach contribut integr multimod reason architectur briefli discuss benefit cbr cbr futur trend encourag reader examin refer review compil www site cbr kaiserslautern acknowledg research support grant offic naval research report base invit academ keynot address specialist group expert system intern confer system appli artifici intellig bibliographi foundat methodolog system approach ai gener case case studi ninth intern confer machin learn morgan kaufmann lazi learn kluwer academ publish cloud classif output code artifici intellig natur refin case librari intern confer reason springer learn algorithm eleventh intern joint confer artifici intellig morgan kaufmann learn algorithm machin approach support dialogu inferenc reason report naval research navi center appli research artifici intellig learn algorithm ninth nation confer artifici intellig aaai press vote multipl nearest neighbor artifici intellig local weight learn artifici intellig local weight learn control artifici intellig cloud classif imageri region probabilist neural network journal appli improv neural network cloud classifi appli indistinguish exemplar memori abstract categori advanc social cognit lawrenc erlbaum context similar measur european confer machin learn lazi increment learn control knowledg effici obtain qualiti plan artifici intellig learn disjunct span michalski machin guid current research kluwer learn speech nexu project fourth intern workshop machin learn morgan kaufmann autom acquisit user prefer intern journal reason intern workshop artifici intellig statist ft unpublish navi aid environ report naval research navi center appli research artifici intellig multivari function interpol adapt network complex domain knowledg influenc similar judgement reason workshop morgan kaufmann search distribut collect infer network eighteenth annual intern acm sigir confer research develop inform retriev unpublish minimum descript length learn australian joint confer artifici intellig world scientif tree improv learn tenth intern confer machin learn morgan kaufmann improv predict featur weight fourteenth intern confer machin learn morgan kaufmann lazi partial integr partial evalu ninth intern confer machin learn morgan kaufmann learner entrop distanc measur twelfth intern machin learn confer taho morgan kaufmann learn control dynam physic system sixth nation confer artifici intellig morgan kaufmann weight nearest neighbor algorithm learn symbol featur machin van den tree compress classif lazi learn algorithm artifici intellig nose system structur classif rule recognit partial environ pattern analysi machin nearest nn pattern classif techniqu lo ieee comput societi press multiresolut learn intern joint confer artifici intellig morgan kaufmann rule induct unifi approach thirteenth intern joint confer artifici intellig morgan kaufmann featur select lazi learner artifici intellig learn procedur appli solv integr problem eighth confer societi studi artifici intellig relat learn thirteenth intern confer machin learn morgan kaufmann learn sequenti initi result learn wettschereck aha work note classif featur vector report naval research navi center appli research artifici intellig knowledg acquisit increment conceptu cluster machin jr discriminatori nonparametr consist properti report randolph unit state air school aviat medicin flexibl metric nearest neighbor classif unpublish manuscript anonym ftp lazi tree thirteenth nation confer artifici intellig aaai press reduc nearest neighbor rule institut electr electron engin transact inform reason complex case kluwer model retriev thirteenth annual confer cognit scienc societi lawrenc result control action project visual twelfth nation confer artifici intellig aaai press genet learn adapt autonom robot robot recent trend research applic asm press induct reason system report depart comput scienc integr reason tabu search solv problem intern confer reason nearest neighbor rule institut electr electron engin transact inform discrimin adapt nearest neighbor classif unpublish manuscript differenti forget prototyp simul classif model memori examin local vari weight nearest neighbor algorithm intern confer reason springer case data improv function approxim intern confer reason irrelev featur subset select problem eleventh intern machin learn confer morgan kaufmann hybrid genet algorithm classif twelfth intern joint confer artifici intellig morgan kaufmann learn repres exemplar initi case studi fourth intern workshop machin learn morgan kaufmann compar learn algorithm european work session learn pitman build integr organiz machin execut algorithm tenth nation confer artifici intellig san aaai press util featur weight nearest neighbor algorithm van widmer poster ninth european confer machin learn unpublish manuscript reason san morgan kaufmann learn kluwer relat perform edit nearest neighbor rule pattern connectionist model categori learn psycholog featur analysi symbol recognit elast match intern busi machin journal research analysi nearest neighbor algorithm thirteenth intern joint confer artifici intellig morgan kaufmann lazi acquisit place knowledg artifici intellig futur direct aaai press case base reason research intern confer springer learn method inform theoret approach european confer machin learn manag comput reason approach artech theori learn machin optim weight set neighbour learn algorithm artifici intellig learn coordin behavior eighth nation confer artifici intellig morgan kaufmann reason design erlbaum issu applic reason design lawrenc erlbaum associ race model select lazi learner artifici intellig conceptu implic learn machin human report depart comput scienc util distinct reinforc learn twelfth intern confer machin learn lake morgan kaufmann context theori classif learn psycholog learn local recept field connectionist model summer school morgan kaufmann acquisit dynam control knowledg robot manipul seventh intern confer machin learn morgan kaufmann priorit reinforc learn data time machin relationship journal theoret analysi case retriev method base neighborhood problem intern confer reason springer program machin learn san morgan kaufmann combin learn learn tenth intern confer machin learn morgan kaufmann extend local learner output code report naval research navi center appli research artifici intellig learn local similar metric reason intern confer reason insid reason erlbaum foundat applic similar theori reason intern confer applic artifici intellig engin itali toler concept sampl shift lazi learn predict error context switch artifici intellig nearest hyperrectangl learn method machin understand lawrenc erlbaum insid explan erlbaum process pattern recognit macmillan law gener psycholog scienc teach strategi control artifici intellig prototyp featur select sampl random mutat hill climb algorithm eleventh intern machin learn confer morgan kaufmann prototyp select composit nearest neighbor classifi report depart comput scienc categori concept harvard press comparison increment cbr induct learn work paper european workshop reason unpublish rememb delet polici system fourteenth intern joint confer artifici intellig morgan kaufmann reason appli english pronunci sixth nation confer artifici intellig morgan kaufmann reason commun associ comput intellectu wealth organ lazi solut intract theori problem eleventh intern joint confer artifici intellig morgan kaufmann concept learn sensor approach recognit sixth intern workshop machin learn morgan kaufmann problem small remedi tree tenth canadian confer artifici intellig discret lazi learn algorithm aha lazi learn kluwer bayesian framework reason european workshop reason kernel regress tree van widmer poster ninth european confer machin learn unpublish manuscript exploit context learn classifi european confer machin learn theoret error vote learn journal theoret artifici increment induct tree machin case base reason research intern confer springer applic techniqu refer select problem print recognit system pattern learn specif instanc biolog converg edit nearest neighbor institut electr electron engin transact inform appli reason san morgan kaufmann heurist cover algorithm outperform learn rule induct scienc world scientif review empir comparison featur weight method class lazi learn algorithm artifici intellig comparison nearest neighbor nearest hyperrectangl algorithm machin combin learn exploit qualit knowledg asymptot properti nearest neighbor rule edit data institut electr electron engin transact man learn genet deriv attribut weight intern confer artifici expert neural network unpublish manuscript improv heterogen distanc function journal artifici intellig instanc prune techniqu fourteenth intern confer machin learn morgan kaufmann select typic instanc learn ninth intern machin learn confer morgan kaufmann integr rule induct learn grade concept machin intellig select instanc predict function lazi learn algorithm artifici intellig
Agents/1391 1 agent organ giacomo letizia marco franco zambonelli dipartimento di scienz università di modena reggio emilia modena itali abstract mobil agent paradigm technolog develop complex internet applic effect develop mobil agent applic requir suitabl model infrastructur paper organiz approach design mobil agent applic idea model internet multipl local activ organiz intend place coordin activ applic agent occur rule paper discuss advantag gener case studi area tourist assist introduct issu relat model implement internet issu relat impact softwar analyz studi dimens mobil debat literatur agent mobil refer capabl activ object dynam transfer execut site mobil middlewar mechan abstract model activ autonom applic compon broad agent run mobil comput devic mobil consid characterist internet agent abstract highlevel design wireless applic mobil agent free problem relat handl agent coordin affect design develop applic proce agent access resourc distribut set independ manag site interact necessarili applic coordin introduc typic problem open heterogen languag protocol opportunist behavior interact secur polici constrain behavior agent access resourc site coordin local agent agent part specif applic requir coordin activ occur specif applic characterist internet site execut constraint face problem uniform model internet multipl local interact repres logic place agent coordin activ chang depend movement depend current agent situat interact context enabl access local resourc interact local execut agent interact context consid simpli logic activ charg mediat coordin activ applic agent enact specif local rule coordin activ model promot mobil agent organiz move local organiz enact specif organiz rule local coordin activ conceiv agent capabl configur activ interact mobil agent entiti belong origin enact organiz rule coordin independ current posit separ concern comput issu organiz promot organiz framework simplifi analysi design mobil agent shown applic potenti model base local organiz context fulli exploit applic develop execut avail proper coordin infrastructur latest implement mar coordin infrastructur implement concept organiz context term programm tupl support mobil mechan design preserv develop separ concern enforc promot write easi chang code model mobil physic mobil mobil agent flavor internet comput virtual agent mobil wide open internet scenario make suitabl develop applic term agent awar distribut natur target explicitli locat access agent agent internet virtual move resourc actual agent mobil refer capabl agent compound activ move internet site execut dynam autonom transfer resourc access physic agent mobil mobil devic access internet cellular model term autonom agent respect fix network infrastructur point access geograph movement virtual agent mobil abstract exploit design applic agent autonom compon possibl global interact environ fix minim conceptu complex suggest conceiv agent situat move network independ matter execut ti fix internet node actual agent mobil consid type mobil make agent mobil agent dimens autonomi effect execut applic agent technolog challeng term secur resourc agent mobil wise exploit provid save network reliabl effici handl mobil user similar advantag function exploit weaker form lowlevel mobil code mobil agent mobil natur map execut level virtual mobil exploit design level physic mobil issu account design internet servic applic applic servic design develop exploit devic exploit futur mobil set devic mobil access internet dynam chang access point softwar agent mobil agent simpli agent execut mobil devic exploit insid mobil observ behavior regard fix infrastructur autonom mobil model local interact context deal type mobil uniform suitabl model scenario applic execut requir suitabl model develop applic model movement movement multipl site internet node administr domain node figur site defin context agent execut interact site act execut place agent interact place agent coordin activ occur coordin activ includ access local resourc site commun synchron local execut belong applic foreign internet agent interact model exploit model interact context primari influenc interact occur messag pass acl meet share dataspac softwar engin local model enforc local interact reflect level applic model notion context mobil fact move agent access data interact depend current interact independ model interact occur agent agent local organiz context agent agent local organiz context figur mobil interact context case tourist assist case focu problem access inform servic relat tourist resourc citi goal properli organ visit citi provid suitabl distribut infrastructur citi distribut provid inform servic relat local region citi situat figur infrastructur found rome inform tower del provid inform visit museum inform tower provid inform santa maria church servic reserv seat typic restaur access inform servic inform tower provid mean inform tower internet node exploit fix navig virtual inform tower enabl host execut mobil user send person assist mobil agent roam inform tower access inform servic inform tower enabl provid inform servic wireless connect tourist visit citi move street exploit person digit assist physic mobil access local inform tower discov person walk connect local inform tower discov restaur possibl reserv seat agent fix user street request fix user street street street street inform tower figur scenario case studi scenario consid repres applic intellig traffic inform intellig presenc fix infrastructur base multipl specif locat provid inform servic model applic term autonom agent move local interact context undoubtedli suitabl hand provid inform servic natur model term local interact context access interact agent softwar compon access inform exploit servic model term autonom agent move interact context design applic influenc specif type mobil exhibit enabl model type mobil uniform design applic deal mobil term agent interact interact disregard model execut context depend specif type mobil design mobil agent organ interact context organ mobil access resourc interact depend posit interact depend context interact context plai activ role interact context act simpl data servic event messag forward interact context simpli place organ sophist form internet applic suggest activ role interact context lead organiz context specif characterist secur enact specif coordin law rule coordin activ local execut agent applic agent belong specif applic requir coordin activ occur specif applic agent enact specif coordin law coordin independ interact context place coordin law enact regard coordin activ mobil agent site occur local interact conceptu wrong local interact polici coordin law unrel interact context assum organiz interact context term organiz context enter movement interact enter foreign organ specif organiz rule social enact form coordin law sake conceptu interact context locu organiz law rule activ local organ resid regard account mobil agent execut distribut logic belong organ defin applic fact execut foreign organ context agent execut interact identifi local interact organ local interact context place local organiz rule place applic agent enact organiz rule form coordin law put introduc concept lead scenario depict figur repres usabl modular conceptu framework analysi design mobil agent applic interact context site enact specif organiz rule exhibit behavior interact event organiz rule enact agent applic visit act concurr local organiz rule agent agent local organiz context context law app specif law app specif law agent agent local organiz context context law app specif law app specif law figur local organiz context organiz context applic design framework defin abstract guid simplifi process develop mobil agent applic model natur invit design applic separ issu relat specif comput role applic agent relat interact agent agent applic visit execut environ framework promot clear separ reduc complex applic analysi design ambit introduc detail sketch gener guidelin identif issu guidelin coher identifi previou work area softwar engin methodolog process design deploi mobil agent applic role applic develop system administr point view applic design mobil agent applic organ analyz global applic goal process lead identif agent instanti relev intern characterist characterist includ function requir achiev assign intern agent architectur type agent mobil identifi agent relat interact role occur global applic goal correctli achiev amount defin protocol agent interact access resourc visit site impli defin constraint protocol execut comput activ issu organiz context properli mediat support execut protocol independ duti applic design duti assign model site administr kind applic agent deploi internet site feder share common administr site identifi local organiz rule find enact execut applic agent site rule facilit execut agent make structur local organ homogen expect requir form protect site improp exploit local context case applic identif local organiz rule intend defin local comput activ local context interact protocol perform agent design issu case studi relat organiz context abstract case problem applic charg properli organ citi tour tourist group tourist tourist defin person time budget applic organ tour citi user requir adopt introduc design applic amount design level decid criterion subdivid applic goal assign agent agent charg find select set interest site visit agent charg reserv seat restaur prefer visit agent basi goal achiev identifi decid intern architectur agent suit analyz coordin activ applic agent involv organiz rule enact coordin activ coordin activ retriev inform tower inform successfulli organ visit time price bu restaur coordin agent visit agent coordin restaur coordin foreign restaur agent coordin agent restaur make reserv coordin activ applic identifi organiz rule enact access organiz context focu point refer inform tower provid access restaur inform term agent access inform term high trivial ineffect solut forc agent retriev inform restaur select inform retriev basi price criterion altern effect solut agent behavior access organiz context impli integr comput activ organiz devot accept request restaur inform term restaur handl refer identifi visit agent restaur agent coordin leav open question coordin process rule decid visit agent restaur reserv schedul visit decid defin organiz rule avoid restaur agent proactiv initi coordin protocol involv restaur reserv visit agent fix schedul opt give food import organ visit basi select constrain execut protocol worth clear separ concern enabl chang design organiz rule chang intern viceversa separ design perspect local administr inform tower enact organiz rule inform control access coordin activ applic agent administr rule avoid ident initi protocol reserv restaur reserv place restaur time span final analysi mention problem relat specif type mobil applic address design choic abstract mobil detail discuss applic base virtual mobil mobil physic mobil plan visit tourist tourist walk citi futur work introduc organiz approach design internet applic base mobil agent shown promot modular approach applic design programm coordin map infrastructur level abstract lead develop easi program easi maintain mobil agent applic intend develop formal model organiz possibl exploit defin model mobil mobil agent intend investig integr model standard middlewar technolog corba jini acknowledg work support italian ministri scienc technolog research project infrastructur qo web multimedia servic heterogen modena reggio emilia fund young research refer coordin model internet ieee feb programm coordin architectur mobil ieee internet aug theoret comput juli finin agent commun intern confer inform knowledg novemb code ieee transact softwar softwar artifici program deploi mobil agent august engin futur softwar finkelstein acm pp note distribut mobil object lectur note comput pp berlin softwar bradshaw aaai pp gaia methodolog analysi journal autonom agent softwar engin internet coordin internet omicini al
AI/1392 2 ai medicin system werner horn depart medic cybernet artifici vienna austria austrian research institut artifici vienna abstract year research develop field artifici intellig medicin show path captur essenti knowledg expert system todai nowadai enorm amount inform access electron larg data set collect continu monitor physiolog paramet patient system make data cope inform tempor data analysi intellig inform visual summar view chang time clinic paramet integr aim modul softwar environ care provid great chanc maintain improv qualiti care partial view scope potenti paper person view research develop artifici intellig medicin base work cooper scientist year main point research aim shift year respect strong movement system static consult system captur current situat patient dynam close chang time preprint submit januari move move move intellig data analysi impli explicit knowledg insid system transfer expert knowledg system success worth note research aim major breakthrough ai technolog past medicin domain fruit explor intellig system understood requir adapt proper action contrast technic domain correct function optim perform medicin domain challeng consequ expect interest breakthrough ai technolog applic build domain area interest explor futur focu close person autom routin task domain suffici data intens care analysi abstract tempor order support pictur happen recent graphic visual tool make visibl hidden enorm amount data collect util practic guidelin individu case inform technolog addit methodolog applic build chang form system implement start monolith consult tool run hardwar lisp found practic clinic physician offic integr main issu ai modul gener system devic modul provid intellig support expert advic network world data data inform medic action longer sell modul distinguish intellig product essenti daili work comput ai technolog essenti ensur qualiti standard sector patient record give chanc todai examin program standard rule clinic ai modul develop wider rang maintain ensur qualiti standard modul cooper tool assist medic personnel daili routin task explor pathwai research aim start knowledg captur activ end aim system util knowledg practic medic world dynam devot qualiti care captur expert knowledg initi motiv research aim famou paradigm main goal captur knowledg pack comput add final excel support system hand group start work expert system field primari medic care cooper gener captur essenti knowledg daili practic step knowledg result system defin knowledg structur descript logic concentr ontolog terminolog field ai research activ find proper knowledg structur remain unsolv languag suffici formal consist support kind verif valid properti make knowledg express system reusabl time knowledg structur intuit physician chanc read comprehend content knowledg base infer structur work effici larg domain medicin formal structur offer advantag consist verif solv problem structur conflict requir good knowledg structur activ knowledg open issu research long futur return domain primari care work devot repres knowledg hope earli eighti reach suffici coverag basic knowledg unit requir progress visibl todai electron version intern classif standard nomenclatur terminolog server provid good start point task lack medic knowledg base rich semant relat find long list relat medic concept lack project stuck todai gener medic knowledg usabl task statist effort demand step limit restrict result expert system work properli limit space lisp gave dai reason capabl primarili result hierarch knowledg structur support effici clever mechan concentr evid main problem expert system lack background knowledg lot anatomi deepen knowledg base ad anatom layer layer basic knowledg system concept systemat function anatomi repres extens set relat defin causal pathwai insert nerv elementari movement reason combin gener descript disord detail knowledg underli anatomi combin causal affect bodi structur impair associ reason find result deep focuss explor bodi region gave impress result due complet anatomi system project health worker radio major acquir knowledg expert make support experienc person work research didnt found daili answer give comput rare system develop special hardwar softwar obviou machin find clinic physician work concentr ai methodolog rare system integr aspect expert system design applic found clinic set instal pc word data statist expert system consum enorm amount time due enter relev data hand lack electron patient record miss integr data put burden extens data acquisit user result system experienc posit side largest benefit achiev medic expert work project knowledg structur knowledg acquisit process expert system develop forc knowledg insight domain due requir clear structur larg benefit expert ai research initi step medic convinc infanc insight appropri specif knowledg model techniqu advantag deep knowledg structur extens research creat medic rich semant effici reusabl futur task project reduc inform overload earli year aim concentr expert knowledg captur data patient enter consult system manual opposit situat envisag modern data collect patient data base store enorm amount patient record electron todai modern equip intens care unit collect larg set data patient monitor sever problem icu todai alarm result rigid alarm rang monitor alarm result insensit medic personnel rang chosen rare give situat initi intent care monitor situat method intellig alarm produc account situat patient combin data integr data data valu evolv time great challeng futur requir monitor equip intellig view achiev integr devic ad knowledg monitor softwar icu physician confront dozen valu patient select patient manag activ requir extens interpret larg data set intellig data analysi research ai method support task handl larg amount heterogen data data abstract find high level descript elementari data item patient data abstract support critic manag icu combin inform monitor pictur situat patient result recommend set situat unsatisfi complex task lot experi expert clinic basic textbook knowledg built support patient manag task main advantag ai abil maintain continu pictur develop paramet time time clinician snapshot situat patient monitor patient data manag system provid spreadsheet form low resolut paramet result archiv sequenc snapshot data situat patient support proper action summari develop paramet recent past tempor data abstract provid essenti method abstract develop paramet time produc abstract descript paramet evolv time trend abstract time short term trend long term trend trend util control recommend set tempor paramet vari depend requir applic includ observ period continu detect repetit cyclic pattern tempor reason lot flexibl adapt domain icu monitor data collect domain chang year collect store method support comprehend complex data combin paramet abstract paramet time ai system give short summari happen minut altern method easi complex data data visual metaphor graphic method graphic object visual aspect complex data set shape color depict paramet metaphor graphic object show multipl visual chang situat patient hour visual system import data collect step intellig data interpret automat control medic devic autom suppli control continu read work main obstacl system larg number artifact receiv monitor equip sophist data valid data abstract method form essenti prerequisit fulli autom data interpret substanti improv robust monitor system opportun technolog util intellig data analysi wai improv qualiti care qualiti care kei issu todai discuss intens expect excel standard practic guidelin modul tool ensur qualiti care integr daili routin argu section system found daili routin success develop ai modul calcul daili nutrit newborn infant low birth weight nutrit standard intens care unit compon nutrit solut base daili requir prescript previou dai encod clinic practic rule expert textbook knowledg nutrit daili routin year icu vienna ensur maintain high qualiti nutrit icu essenti success modul fact mind deliv aim system user physician save approxim hour dai addit error rate reduc specif modul integr patient data manag system clinic part daili routin comput softwar patient encod clinic knowledg explain recommend base clinic rule explan novic user dai find system trustworthi learn rule prescript explan rare system maintain continu prescript nutrit compon abil dynam adapt daili individu patient success system narrow domain ensur qualiti care appli clinic standard daili patient manag action system activ ensur control practic tailor individu patient path work autom support care clinic guidelin set schemat plan manag patient show clinic condit guidelin repres clinic patient data data standard action method plan extens work knowledg formal flavor contrast earli approach procedur tempor aspect form essenti part result plan repres guidelin open dynam adapt individu patient strong method improv maintain qualiti care ai modul daili work environ physician great potenti contribut qualiti standard chanc wide dissemin practic guidelin aim modul verifi valid carefulli integr smoothli environ care provid year aim research develop show path captur essenti knowledg expert system todai enorm amount inform network world enorm amount data collect daili modern medic equip lead task cope inform overload knowledg essenti larg bunch inform data modul essenti tool find relev give pictur situat patient time promin featur life tempor reason fruit method react time aim system chanc dynam behavior exampl paper show step path situat system enter health care domain system replac system system make data cope inform acknowledg greatli support austrian research institut artifici intellig austrian feder ministri scienc cultur refer knowledg mj wooldridg artifici intellig todai jr vr ieee intellig system dissemin medic artifici intellig medicin knowledg structur definit expert system primari medic intern joint confer artifici intellig british support primari medic causal anatom reason medic expert proc european confer artifici intellig radiolog expert system pc design implement aim european confer artifici intellig medicin util detail anatom knowledg hypothesi format hypothesi test artifici intellig medicin effect data valid comput biologi medicin accur nutrit plan newborn ieee intellig system metaphor graphic visual icu data intellig data analysi medicin pharmacolog workshop note august deep model medic knowledg engin tempor reason special issu tempor reason artifici intellig medicin intellig data analysi kent encyclopedia comput scienc st cry alarm intens care critic care medicin expert system nutrit ninth confer artifici intellig applic therapi plan qualit trend artifici intellig proc util tempor data abstract data valid therapi plan artifici newborn artifici intellig medicin plan manag medic ai commun abstract steadi qualit descript time artifici intellig proc support system villag health worker develop appli artifici intellig al je high level proc medic informat europ al terminolog concept artifici intellig medicin rs fa systemat knowledg base design medic special issu causal appli artifici intellig ms cf data abstract method optim oxygen suppli austrian research institut artifici technic report framework applic critiqu clinic artifici intellig medicin world health intern statist classif relat health problem
IR/1393 5 distribut cooper work ing wang june abstract paper describ environ manag cooper share control inform heterogen environ confer process scenario appli environ process environ consist main document manag process manag transact manag system softwar internet intellig agent document process transact model introduct introduct project place heterogen environ inform work process distribut work dynam cooper involv multipl actor kind set peopl coordin share document manag access share resourc web make fairli easi distribut web explicit mechan plan coordin activ describ classifi control access ensur consist project document absenc fulfil user figur ad hoc solut small set flexibl tool readili configur support task hand project cooper agent global inform space aim support task combin softwar agent small tool paper describ section address challeng problem section present confer scenario make problem challeng environ appli scenario section section discuss approach conclud paper environ environ consist main system handl distribut document document system support cooper process distribut flexibl transact manag system distribut resourc describ effort research area detail document model tool document publish web classifi facilit retriev challeng task semant classif document content mixtur carefulli defin vocabulari scheme appli vocabulari describ document document model toolset dept comput inform norwegian scienc technolog norwai user project group domain model express conceptu model languag text analysi tool interfac perform actual classif search conceptu model basi creat descript descript access viewer enabl search document standard web browser environ doc subscript transact present search awar export figur conceptu model descript fundament approach conceptu model languag defin domain specif vocabulari classif retriev process conceptu model languag formal basi defin proper time offer visual user part read explor document interact directli model conceptu model languag entir process classifi retriev document web refer model languag languag strong abstract mechan sound formal basi approach domain model document classif retriev outlin domain model conceptu model manual process domain model relat text document construct model aid textual analysi tool refer set document domain run word frequenc analysi produc list high frequenc term document term input candid actual conceptu model task manual cooper task perform select set user order prepar finish domain model document add lexic linguist inform model enhanc ad textual definit concept model list synonym conjug concept match document text model concept document document classifi select domain model fragment reflect document content perform match document text concept model concept found document shown user select graphic model viewer user manual refin classif select deselect concept relat user select model fragment translat syntax store descriptor point document question user provid select set properti titl attribut store order retriev user enter natur languag queri phrase match conceptu model similar classif process domain model concept found search phrase extract search store document descript user refin search interact model found document present list interfac store document attribut enhanc read term document match model concept mark point definit model concept layer architectur document tool shown figur main part system user interfac set servlet run standard webserv model repositori classif store document lexicon storag word frequenc analysi toolset morpholog tagger prolog analysi sentenc analysi languag tool java servlet domain model classif search system control java applet refer model viewer model construct document classif document retriev user interfac figur overview system architectur ¢ user interfac centr viewer user interact explor concept definit viewer directli order perform classif retriev ¢ java servlet defin function system invok model viewer coordin linguist tool incorpor system ¢ servlet number linguist tool natur languag phrase give input construct domain vocabulari classifi retriev document word frequenc commerci applic count word frequenc document produc statist finnish tool nomin phrase tag sentenc classif retriev document smaller prolog applic relat concept sentenc develop intern applic assum disambigu tag sentenc relat concept basi rule altern tagger relat parser link extens semant lexicon ¢ document classif store web server xml format domain model store xml continu maintain reflect vocabulari document ad document collect linguist tool rest lexic inform partli store xml partli integr tool detail present approach system process model tool process centr environ prototyp develop give process support cooper process consist main workflow system support distribut mobil process workflow system model repeat workflow system offer workflow system workflow model distribut process fragment workspac benefit possibl adapt workflow local condit workflow instanc defin locat local chang time abil move workflow instanc realloc deal except activ deleg work workflow system implement provid detail process model languag workflow system defin process set activ relationship xml syntax activ set identifi activ execut identifi activ execut activ current activ written process distribut workspac activ definit specifi code part code part simpli simpl present start term process fragment group activ part process process fragment workspac list refer activ softwar agent support cooper process workflow system care repeat softwar agent support cooper dynam process softwar agent typic care activ negoti activ resourc coordin artifact workflow element mark support perceiv agent act buyer seller architectur consist main ¢ agent agent set achiev modest reactiv identifi main type work agent assist local product interact agent assist cooper work system agent give system support agent interact agent system work agent stationari ¢ workspac workspac temporari relev data suitabl format access process tool share file store repositori check workspac ¢ agent meet place amp agent meet interact amp provid agent support effici commun type amp amp defin agent follow perceiv special amp inform sell bui servic ¢ repositori repositori persist storag data experi base specif type repositori architectur support commun memori architectur implement ibm aglet framework provid mobil kqml corba offer commun applic agent system detail descript architectur found interact workflow system system glue model xml defin relationship workflow element softwar agent offer servic workflow activ trigger agent vice versa implement corba facilit commun agent system workflow system inform found figur show simplifi illustr compon interact figur run workflow tool local workflow model workflow tool local workflow model workspac relationship figur illustr wai softwar agent interact workspac agent interact directli user graphic user interfac configur interact agent user interact softwar agent directli interact softwar agent workflow tool workflow tool workflow model £ workspac ¤ workflow tool agent move agent agent interact move agent amp glue model agent move agent move agent move agent global repositori £ workspac workflow model figur process centr environ ¤ workflow tool activ agent activ workflow tool figur show agent access workspac access file repositori directli shown explicitli transact model tool transact basic work unit program segment execut perform function task access manipul share transact model concern captur essenti characterist transact includ transact behaviour appli constraint transact model motiv base assumpt system resourc manag system main transact system control manag access share make access prespecifi consist preserv constraint section briefli describ effort develop transact framework transact manag system cooper agent transact specif framework transact framework reason applic specif transact model main framework provid configur transact model user applic depend transact model crucial adjust requir control provid transact situat requir strict control correct data control framework divid main transact characterist specif transact execut specif characterist specif defin main properti actual acid relationship involv adopt correct criteria partli partli appli polici rule defin concurr control condit static defin design transact execut execut specif defin transact execut term composit manag oper deleg regular access oper execut specif conform fix initi remain oper adjust transact framework distinguish static runtim dynam specif compar relat acta asset main differ dynam properti import predict aspect applic advanc relev softwar agent cooper work detail present transact framework transact manag system system specif depict figur divid main specif environ runtim manag system ¢ specif environ facil transact model design characterist transact environ user set oper xml characterist specif special xml dtd dtd transact characterist initi execut specif transact execut specif environ characterist oper set runtim manag system transact manag log specif manag execut manag resourc manag system specif templat resourc request resourc store figur transact manag architectur run transact specif xml special xml parser valid prespecifi dtd parser transform specif characterist intern transact execut specif set oper transact manag control monitor transact execut transact specif specif avoid redund specif environ facil design transact characterist specif impli futur adjust perform specif scratch design current specif save version replac ¢ runtim manag system consist transact manag resourc manag system transact manag manag specif execut ensur transact execut characterist acid model enforc atom isol execut properti atom manag ensur failur necessarili global rollback partial abort issu shown figur transact manag consist specif manag execut manag specif manag control specif environ complet make specif transact characterist support semant repres specif fulli satisfi notifi design adjust closest support specif found specif make characterist inform execut manag manag ensur transact execut consist respect transact characterist execut inform base execut manag issu suitabl transact manag oper manag oper user resourc manag system manag provid system resourc run transact maintain execut inform run transact handl transact abort system recoveri resourc manag system make commit result persist store transact manag system implement work prototyp base java ibm serv transact specif framework confer scenario section describ briefli confer process present main activ confer process shown paragraph program chair initi process plan announc confer peopl attend confer submit pc member record submit paper inform author review chosen base paper review start pc member collect review review meet held determin accept paper accept paper group session final program includ confer session produc suggest session program chair preliminari schedul accept paper select paper plan session session group paper final schedul figur group accept paper session schedul session subject paper schedul focu main activ group accept paper session figur show main activ suggest session program chair process match paper document model defin term relationship research domain suggest session subject creat preliminari session schedul set session program select paper plan session member session process determin session subject initi session descript session subject goal check paper session member mark paper relev session notifi interest paper mark paper paper mark session session negoti paper paper alloc session mark check session mark session session session negoti session result ad session descript session descript state publish session session publish session descript session program chair paper assum program member distribut locat work confer comput interact physic environ appli scenario section outlin consist tool model support process appli scenario section suggest architectur support scenario shown figur main activ suggest session select paper plan execut program chair session solut chosen model scenario workspac program chair workspac session workspac local process defin process workflow tool enact process model process model defin process step defin suggest session select paper plan session section legend session ¥ workflow tool program chair document model process model ¥ workflow tool workspac user agent negoti agent glue model ¥ workflow tool amp session document tool negoti accept paper session ¥ workflow tool transact manag figur framework appli scenario repositori program process step divid paper topic document classif tool match paper domain model domain model defin vocabulari extract preliminari confer topic submit paper match paper domain model document model program chair interact model viewer achiev proper subject paper workflow tool notifi document agent access document document servlet process workflow tool present program chair document tool creat preliminari session schedul set session session select pc session member notifi email describ session attend workspac access session start work workspac process model enact workflow tool confer work distribut determin session subject workflow tool notifi brainstorm agent session member result brainstorm process end initi session descript written session chair step process session paper session workflow tool notifi paper select agent paper select agent retriev inform session mark interest paper paper select agent mark paper paper record repositori figur result mark paper return paper mark session negoti agent initi negoti session paper negoti process program chair make final schedul paper record session mark session process work paper session select agent session select final session descript publish final confer program produc transact manag manag integr document ensur agent accomplish task leav system consist state base descript session share schedul document paper record conflict occur possibl solv problem provid lock prohibit process finish unaccept delai session arrang process possibl hinder session total read permiss provid read intermedi process scenario permit simultan updat achiev consist system support sophist merg mechan captur task support session select process assign agent involv document access transact manag system ensur agent method invoc involv repositori access manag part transact execut ensur conflict document access manag properli transact consist agent method invoc initi assum involv agent select paper paper record tradit acid global discard made kill agent lot effort start task scratch cope model agent method invoc subtransact execut abort transact kill involv transact manag fail agent undo agent proce normal paper present toolset applic confer scenario toolset consist set separ tool provid support cooper work web major compon workflow document classif tool transact manag tool implement true web built standard web server xml data storag interchang format tool configur actual situat workflow tool creation individu workspac support activ workflow tool offer abil enact part process model workspac support document classif tool domain specif domain creat user classifi search document transact tool offer support specif execut transact model transact manag offer abil design requir correct criteria defin execut transact enforc criteria share resourc central bind individu tool configur set softwar agent activ tool glue model defin relat individu workflow element resid workspac softwar agent access individu tool compon toolset order provid situat specif cooper support environ applic confer process environ support process peopl work peopl inform distribut exampl process cooper softwar engin distribut educ distribut process sell bui web process distribut peopl requir peopl interact cooper reach goal process combin tool enhanc function specif tool document model tool enhanc architectur document model tool model agent defin languag softwar agent speak transact model tool paper call workspac offer manag consist chang workflow model mean environ offer select combin give specif support futur work investig tool pick scenario refer ing wang ander aa design principl architectur cooper softwar engin submit softwar engin data refer conceptu histor perspect futur lo int conf conceptu model shaul ramamritham system support extend transact richard snodgrass acm sigmod intern confer manag data acm support integr interact agent technic norwegian scienc technolog march technic dept comput inform scienc pano chrysanthi ramamritham synthesi extend transact model acta acm transact sept mark frank custom transact model mechan programm environ support reliabl workflow autom ieee transact knowledg data august ander aa dia ii distribut intellig agent system ii technic norwegian scienc technolog januari technic dept comput inform scienc lar technic norwegian scienc april student project hg inform system design compar review mad transact framework support cooper agent technic report norwegian scienc ander aa dia distribut intellig agent system technic norwegian scienc technolog april technic dept comput inform rune norwegian scienc john semant access document conceptu model descript dw sw advanc conceptu novemb john natur languag analysi semant document model intern confer applic natur languag inform system june ing wang experi xml implement workflow tool annual iast intern confer softwar engin octob ing wang support mobil softwar process seventh european workshop softwar process februari ing wang softwar agent support evolut distribut workflow model proc intern icsc symposium interact collabor comput page decemb ing liu integr workflow interact agent support cooper softwar engin submit softwar engin ing architectur cooper softwar engin proc eleventh intern confer softwar engin knowledg engin page june
IR/1394 5 research report institut informationssystem system technisch wien austria www institut informationssystem intellig anticip explor web site research report octob technisch wien research report research report octob intellig anticip explor web site abstract paper describ web search call global search agent integr enhanc search techniqu order achiev improv qualiti deliv inform compar usual web search engin featur intellig merg relev document search anticip select explor evalu link current autom deriv refin queri base user relev feedback system architectur account illustr della itali copyright author rr introduct recent overwhelm inform sourc made problem data select deliveri hard solv internet everydai web carri assist web search engin googl good hint guess actual difficulti problem web search usual tool inform face complex impli internet search construct maintain huge relev document retriev basi indic built exhaust explor web mean search bot featur limit explor web exist index successfulli track exist web recent project attempt inktomi index servic obtain recal capac fraction retriev relev page wrt total relev engin reach base genet ordinari search engin fail achiev good perform fraction perceiv relev document wrt total retriev concern global search illustr improv web search qualiti recal side global search usual engin rearrang set return result enhanc diminish implement base techniqu document select deliveri actual user prefer suitabl account featur intellig select path explor select approach greatli reduc search space significantli diminish recal anticip explor method fruitfulli advantag state neighborhood relev document rich relev document realiz applic instal user machin user request usual form set keyword queri relev set search collect rank result user document system search result search strategi select link adjac initi potenti interest document document select user prefer account user form structur concept tree structur emploi restrict search progress document expect tree user prefer user express approv document return user return document emploi provid user suggest improv correspond return result user inform achiev adapt rr architectur metasearch engin spider engin user schedul remot control feedback engin figur architectur schedul period configur set queri search document qualiti criterion aggress anticip search queri deleg remot instanc push back found result rest paper devot technic featur method implement anticip explor method section present softwar architectur section discuss gener anticip explor agent push link call spider manag discuss section set manag user prefer dealt section section report section account experi conduct order establish effect approach applic context section drawn relat literatur system refer paper system architectur overview coordin emb conceiv order achiev effect document retriev figur illustr architectur main softwar modul roughli correspond main system care major metasearch engin exploit rr spider engin exploit anticip feedback engin manag user prefer engin ship applic advantag featur order fruitfulli search activ arrang schedul remot control user user enter manag concept tree set queri set queri set relat document concept tree conceiv order maintain categori queri match structur classif approach assist user order handl past user profil term queri relat clear posit queri concept tree drive search user document feedback provid mark interest document queri user retriev pertain start se run parallel retriev interest document set web search engin submit queri set web search search engin wrapper special wrapper queri search engin correct select signif url page wrapper purg retriev answer page noisi hyperlink provid structur list url url se se manag collect emploi order valid score document spider agent crawl web pursu object find interest document start document se start url control spider intellig follow hyperlink decid document present direct worth explor order quantifi emploi suitabl score account frequenc mutual distanc enter respect document direct suitabl explor give spider memori past visit mean qualiti document surround high qualiti spider likelihood explor relev document recent explor relev document found past score document respect posit queri concept tree consid relev criterion evalu explicitli stop analyz result system perform search search perform finit time rr feedback engin work user opinion return document interest mark entri document list user opinion small subset set retriev fe start output fe set relev suggest user order refin search user emploi suggest word fruitfulli modifi concept tree current queri belong chosen strategi fe consist restrict set candid word signif improv score gap interest document uninterest merg document found search engin enhanc web coverag qualiti document automat collect techniqu search engin savvysearch recent commerci experi problem address successfulli merg result heterogen search resourc categori issu address deal semistructur inform pass inform sourc fight queri search engin result back user form html list includ page short abstract ad hoc wrapper order extract inform search resourc agent desir queri wrapper act independ entiti suppli applic set result queri submit lifetim wrapper slight modif result page encod affect wrapper recal wrapper act specif transduc expect find inform specif context html mark page data present rel period high wrapper redesign rate order fit data present structur problem crucial number resourc consult larg assum specif resourc data present structur year optimist engin reach search engin forc maintain rewrit wrapper dai issu address provid period updat featur wrapper librari wrapper simpl finit state automata deal mark document wrapper automaton templat figur ft tradit anchor tag input stream assum sequenc tag belong mark languag notat state transit usual form rr tag output refer url figur simpl wrapper automaton mean start state label note repeatedli select accept url immedi tag sequenc ft correspond recogn substr document hand belong regular languag eleven twelv wrapper collect fulli oper simpl structur shown wrapper mainten burden light automata oper fix chang ft valu valu lyco wrapper instanc finit state automata power extract inform web rare power model stack automata argu employ simpl class finit state automata gener trend special topic futur research investig properti search engin page encod order assist automat wrapper gener approach simplifi task design result sensit modif sourc long categori issu deal problem suitabl merg result sourc order score web sourc introduc relev criterion ident document referenc sourc address issu attempt merg result heurist techniqu intend deal unknown rank criterion search engin order give document suitabl techniqu account search engin present afford search engin term time abstract text refer page present encod lyco juli rr web wrapper automat updat readi period automat updat updat updat request score defer defer auxiliari inform extract defer tabl differ web search engin interpret provid term score document approach prove order provid suitabl sort retriev forc gather result singl document displai wrapper provid relev valu data pure list candid extract addit inform titl merg step defer phase tabl summar peculiar technic choic metasearch engin respect commerci product web wrapper updat modular architectur rapid deliveri date wrapper commerci product featur automat updat servic manual updat updat servic wrapper charg measur qualiti task deleg postpon step featur direct retriev document applic featur qualiti measur base heurist elimin direct document issu auxiliari inform extract prefer defer task direct retriev product featur extract address issu adapt explor spider engin prompt potenti call spider creat deploi spider creat deploi gener child spider act parallel simplic present partial sequenti version algorithm encod behavior spider spider retriev document start establish score combin score decid worth show current document user worth pursu task link includ current document current document score suitabl rank criterion subsect displai achiev score exce threshold provid document hand displai rr spider spider start url set word begin url feasibl document reachabl stop present present url depth url point url visit schedul spider depth set spider histori spider histori prioriti proport spider figur algorithm control behavior spider case child spider link found launch spider document depth origin spider distanc current document document search exce threshold termin search theoret theorem afford explor constraint introduc order control termin search reason amount happi exce threshold happi subsect measur qualiti document score gener spider current belong happi current spider spider spider high happi schedul higher prioriti earli deploi document hand valid format reachabl note feasibl reachabl document establish posteriori child spider child spider origin histori latest visit form set coupl pair track gener current establish oper system level intern timeout threshold rr belong visit document combin score visit perform spider depth child spider initi depth increment respect origin spider combin score definit measur qualiti document hand respect entir concept tree evalu queri belong approach document retriev effect remov rank reachabl homogen merg result search engin sourc number analyz document effect reduc emploi prune criterion base local lead introduct happi concept subsect rank function order associ rank adapt rank function base function emb presenc proport presenc occurr term page frequenc weigh quantiti occurr term distanc weigh distanc occurr term concept word occurr introduc stem algorithm word consid ident stem match word stem algorithm commonli special lar lexicon text assum written roughli occurr word consid similar keyword concept similar introduc order stem word compar differ classic porter algorithm chose stem criterion independ languag text written word wj set wj length charact si cardin definit similar function word return return similar consid occurr smaller opposit circumst defin common stem common stem length similar weigh wrt keyword note ratio rr power order serv lower similar word shorter argument word suitabl threshold compar similar emploi order cut occurr assum document sequenc word string definit rank function rank document set keyword search queri evalu shown figur figur rank function term repres presenc np max sum presenc valu threshold term word presenc similar found respect word signif occurr term repres frequenc ts total sum occurr word occurr weigh similar note word occur document occurr weigh rr term repres distanc ns number word signif occurr denot element repres minimum distanc found occurr word amplitud asymptot trend rank suitabl chosen weight maximum distanc consid signif occurr term current prototyp valu set user desir valu method privileg distanc presenc compon show effect chosen valu paper set order penal frequenc compon set queri word document displai exce threshold differ rank function emb directli stem natur penal frequenc express distanc word charact bound rang rank rang asymptot featur elimin normal rank valu end search priori maximum minimum score retriev provid sort fix relev scale maximum edg score interv concept happi function local idea spider coupl approach webwatch criterion effect prune number visit rapid recov interest document letizia agent guid user implicit prefer time url time user spent earli detect direct agent spider decid direct follow pretti independ user page user moment local page relat topic surround page make guid explor account order tailor search space exclud path lead high qualiti document happi make spider account list rank valu score past visit concept origin queri refer definit concept tree tree root node node rt set element pair leaf node repres user intermedi node call concept rr user enter concept forest set concept loss forest concept dealt dummi root concept introduc order bind separ compon definit sequenc repres visit dn recent visit concept tree queri concept uniqu path root combin score document min fix paramet note eventu set queri ancestor sci tutori figur evalu concept tree document concept set word consid respect keyword enter search queri assum queri ancestor concept enter roughli document achiev suffici notion combin score document import score comput concept word lighter farther concept origin queri rr figur word respect queri submit document assum low order give readi discuss happi function plai definit set document queri belong concept tree happi defin term combin score document set document concept tree queri roughli happi similar averag score document visit gener spider hand combin score emploi rank document score low rank spider score node origin root node reach worth score obtain combin score weight factor control word belong concept origin queri node happi design order encourag high prioriti spider recent explor document qualiti respect topic hand chanc spider recent explor document gener subject topic identifi ancestor concept subject explor termin worth note algorithm figur termin finit time algorithm formal visit label graph definit tripl set binari relat function st definit integ path defin hm rr mean intend order repres web set link set node coupl weight repres measur qualiti rank function hm repres gener happi function assum qualiti node measur mean ration normal algorithm figur encod formal algorithm start node ration valu hl integ ra data prioriti queue consist set pair queue ra node element set put empti begin extract pair st maximum output st mark begin mark ra put put algorithm perform usual visit node reach path node st displai note algorithm introduc constraint maximum distanc reachabl origin node assum finit huge web constraint order termin visit constraint termin reason amount theorem algorithm termin infinit time rr figur counterexampl theorem proof observ algorithm perform visit iter node node enqueu visit visit argu worth visit time document earlier reach spider greater happi spider card visit document potenti spider discov path follow link structur algorithm node visit show path visit definit start node end node integ ration hr path ph sp assum ht path theorem start node ration integ algorithm reach node exist path proof simpl counterexampl figur assum ht node insid graphic note path path rr node enqueu mark queue pair node greater prioriti enqueu pair enqueu pair enqueu exce turn avoid path discard multipl visit node algorithm meet termin finit amount practic concern discuss algorithm start node ration valu hl integ data prioriti queue consist set pair queue ration valu rt element map constitut associ rt ration number node rt map set put empti begin extract pair maximum output st set put put pair algorithm explicitli mark node visit past explor path happi lower current prove algorithm termin finit time theorem start node ration hl integ algorithm termin finit time proof show visit finit number time assum distanc proof easili extend gener case rr set path form note node necessarili set valu set time possibl visit compar node enqueu iff strictli lower proof time strictli set finit incom spider spider outcom spider figur circumst multipl visit document lead unwant happi level theorem start node end node ration ht exist algorithm reach start proof proof carri induct length path connect trivial path algorithm visit conclud set final greater equal assum connect path path assum theorem hold node set final greater equal rr ph enqueu pair phi tp tp greater path enforc visit conclud final greater equal shown termin evalu process maximum depth prefer adopt algorithm induc artifici spider figur show counterexampl happi gener spider alter node form cycl figur show mutual link node set incom spider initi happi set yield gener spider induc multipl loop node assum happi comput visit incom spider visit valu rang argu equip suitabl cycl control algorithm visit path duplic lead slight improv recal respect speed perform decai node worst exploit user prefer featur user profil intend enrich system inform perform search user express prefer manual edit concept order drive anticip explor role concept tree detail section express prefer retriev document present analyz prefer produc set interest fruitfulli user suitabl refin queri concept user express boolean prefer retriev ignor document mark care prefer express examin hot cold document produc set good term set bad term consid current present user user handl term order refin concept tree rr set good document set bad document set keyword set good word begin extract set nearest word word return word discrimin power wrt figur algorithm control feedback engin algorithm feedback engin shown figur input algorithm set word set good document set bad output algorithm set good word basic consist made extract candid word candid word select word occurr close distanc number occurr word document set word common priori exclud comput word occur word prefer respect farther candid word score suitabl measur crimin word output good word interest page higher score wrt uninterest word appli search keyword replac analog measur expect inform gain compar measur discrimin power discrimin power emploi order estim candid word effect appli queri word joint word definit set good document set bad set word origin queri discrimin power dp term defin term increment discrimin power obtain high score good document decrement discrimin power contribut enhanc rank bad document distanc compon techniqu natur privileg term occur origin queri word approach similar tradit bayesian classif appli text document word consid task classifi rr figur typic session document estim probabl document belong class chose adopt usual classif order techniqu leav heavi burden requir classifi larg set document prefer good heurist show interest requir handl small set document session typic session screenshot shown figur screen divid main concept edit document view frame side edit concept tree remov modifi concept queri drag drop node chang tree structur click apposit user enter queri drag drop icon chosen concept icon gener entri queri keyword displai top concept tree user click item document retriev select queri displai side document entri rr level depth spider found search engin origin gener spider found item level document directli extract search user rate smile face repres item mark good sad face refer bad page short abstract score search process activ select queri act apposit button figur report system activ short activ queri document view frame popul result displai arrai color frame bottom page report activ run spider color frame statu spider tone blue proport spider lighter tone correspond spider higher happi number spider wait activ shown screen user stop search process moment mark document good topmost document figur feedback engin act apposit button feedback engin analyz deriv process queri pop concept tree deriv queri enrich suggest word edit user featur illustr schedul period possibl push pop queri request remot instanc agent possibl save displai document content applic prefer browser result order prove effect approach test current prototyp evalu scenario pretti test set queri verifi spider effect environ local hold test set queri conduct order gener perform set test set conduct explor set document total text inform document collect set site heterogen topic quantiti document test set size explor definit test conduct document time term percentag disregard document explor data gather test estim extent local hold document set rr figur histogram document link test set figur tabl report aggreg valu probabl document score rank document score rank evalu rank score rank higher document reach node rank probabl boost found set test set conduct start spider googl order test improv googl hit tabl figur report aggreg valu set data collect set rank evalu note qualiti document high local appreci lower valu note data estim set test set conduct compar googl order test perform metasearch fix queri durat set worth note rank cluster document distinct set score document score document score rr total total tabl tabular valu document link test set ii total total tabl tabular valu document link test set due granular rank respect distanc presenc relev queri term present document rank score valu higher queri term present document queri term present connect speed constant chosen score function happi comput visit document test conduct scenario test set reflect typic circumst emploi search engin site percentag relev document order induc spider test set perform set initi happi happi threshold constraint maximum reachabl depth made potenti explor document set submit eleven queri result account tabl present rr figur histogram document link test set valu save recal introduc measur ill set explor document queri document set save evid fraction document wrt entir document direct measur reduct search space explor search document set ten document highest rank recal defin set document found present user queri recal interest document due search space reduct introduc object qualiti document assum rank save valu give evid reduct search space case high save valu recal worth low recal valu obtain test due rank function accuraci queri tabl notic set ten document highest uninterest point document set document retriev perceiv user highli valuabl conjectur rank function account qualiti neighbor document effect order improv perform rr explor queri keyword document save recal javascript tutori sail calendar crawford neural network english monitor repair drum comput fast memori avg tabl result test set respect drive spider studi kleinberg order put evid depend happi qualiti document reach estim probabl probabl document rank reach spider happi result figur tabl correl found total total tabl tabular valu document reach happi test set rr figur histogram document reach happi test conduct test set reproduc scenario emploi accompani tool googl expect qualiti quantiti reach document high set tabl set happi threshold start happi maximum depth threshold spite reach quantiti document tabl report result obtain queri constitut test set rightmost column account result produc directli ten relev document improv defin fi set document retriev spider depth level directli retriev googl level ten relev document note enrich relev page produc googl quantiti page qualiti result current implement limit relev perform term speed evalu test set reproduc condit emploi metasearch engin case appreci perform fix durat queri tabl report result set queri constitut test set queri consid ten relev document report search engin tabl search number document number document consid rr explor durat keyword document calendar sail english memori lisp tutori neural network faq drum crawford avg tabl result test set document relev found document altavista excit googl hotbot tabl result versu search engin set relev document wrt retriev result obtain stop evalu perform fast singl search engin short durat search overhead task directli retriev document balanc search engin queri simultan perform parallel webcrawl test googl outperform shown test set outperform googl threshold maximum evalu time paper illustr web search featur profil anticip select explor web test put evid effect anticip select explor approach rr term document save improv qualiti retriev respect tradit search engin argu choic explicitli retriev rank document effici current written perform badli term absolut throughput full advantag high test conduct internet bandwidth system document speed approach justifi applic document necessarili retriev unavoid payload clear advantag job techniqu successfulli appli period collect specif topic document compliant push user smart rapid index web indic size small indic produc agent assist featur intellig anticip explor highli parallel payload significantli blur parallel retriev document moment studi improv architectur automat gener wrapper argu spider behavior improv studi sophist happi function introduc logic base behavior worth reconsid rank function term document avoid document site present concept tree complet manag system improv introduc autom concept tree deriv provid autom paramet tune acknowledg author antonio eral thought discuss earlier develop particip softwar implement mainten author appreci comment significantli improv qualiti paper refer altavista web altavista corn rr bt belew optim paramet rank retriev system relev feedback journal american societi inform scienc gottlob visual web inform extract larg page relev rank term queri inform process web corn metasearch engin learn search engin queri ai excit web excit corn web alltheweb corn frake inform data structur algorithm gomez intellig fusion distribut search engin journal comput googl web googl corn gravano molina merg rank heterogen sourc proc vldb page hotbot web hotbot corn inktomi web inktomi corn mitchel tour guid world wide web proc int joint conf artifici page mitchel neci meta search engin proc seventh intern world wide web page ej keogh pazzani learn augment bayesian comparison approach uncertainti seventh intern workshop artifici intellig ft kleinberg authorit sourc hyperlink environ journal web cora web web cora lieberman agent assist web proc int joint conf artifici ijcai page lyco web lyco cora merialdo automat data extract larg web site larg page motwani infer structur semistructur data sigmod march billsu syskil identifi interest web site proc nat conf artifici page selberg etzioni metacrawl architectur resourc aggreg web ieee webcrawl web webcrawl cora yahoo web yahoo cora rr osawa plan guid concept understand aaai workshop ai inform page
IR/1395 5 page classif spatial inform diligenti marco gori marco introduct school civil dipartimento di ingegneria itali school electr abstract extract process inform web page import task area construct search inform data mine web common approach extract process repres page perform addit process flat paper hierarch includ browser screen coordin html object page spatial inform definit heurist recognit common page area left center page show preliminari experi heurist correctli recogn object case show naiv account outperform classifi inform content document web page design previou sentenc machin learn inform retriev techniqu process web page util implicit spatial inform html sourc spatial inform assum posit html object browser window imag top left corner screen inform paragraph center page occupi area pixel kind inform problem featur select document classif method perform featur select process inform gain frequenc document case estim relev word describ vector classif process assum web page design visual argu word repres respect page topic belong banner link page mislead classifi word belong central part page carri inform word corner weight differ word layout context present moment classic posit word span area consid mention problem design effici crawl strategi search engin specif topic start set page find page predefin number step step meant visit download page reachabl hyperlink page word import estim outgo link techniqu case crawler decid account page link link page insert crawl frontier interest page design xyz link belong menu mislead measur import link link posit page browser link center page import link left corner calcul link densiti area page weight link account densiti factor link surround text import topic link posit group link signifi hub page import crawler learn posit interest link inform posit belong area infer link note final problem cheat search engin insert irrelev keyword html sourc wide techniqu order probabl index page search engin repres higher rank search result easi detect reject keyword foreground color background detect keyword regular color cover imag coordin object page search engin filter keyword hidden object user answer outlin paper section defin format page render page virtual obtain coordin html object section describ heurist recognit left page section result predefin dataset shown section present result web document classif remark futur work section extract spatial inform html sourc defin virtual screen coordin system locat posit html object text insid web page text correspond displai area maxim browser window monitor resolut pixel page length theoret height infinit top left corner repres origin coordin system process spatial inform extract consist step step page html parser extract type element tag data tag element delimit data element consecut tag te includ tag list pair de repres list form data string consecut tag pair extract input html inject tree builder tree builder appli stack machin set predefin rule build tree repres html structur page output compon paper describ construct tree html page build singl pass rule properli nest te hierarchi html specif addit effort made design tree builder immun bad html sourc text defin definit mt direct tree defin set node set edg set correspond te html set correspond te html set correspond de equal list pair extract tag null node attribut set node align attribut token describ font size token carri inform token belong scope valid html describ align text text correspond tag write attribut root repres page set pair sourc url page node parent data belong context definit clear imag text node leaf mt mt obtain input page context object interest appli algorithm coordin calcul algorithm browser render page coordin object calcul step render modul construct mt input find specif algorithm page render recommend design decid imit visual behavior internet explor popular product simplif render modul calcul coordin node mt html tag mt rm support layer html frame style sheet opinion simplif influenc significantli final task recognit common area page start page lm end page rm complic fig posit area interest page text polygon render modul produc desir page text mt extend concept mt incorpor coordin defin heurist recognit common area interest mt page assum common web design pattern defin set heurist recognit standard area page menu area interest list header left menu menu center page present exact definit open literatur page area area group adopt intuit definit reli coordin logic group object page care examin page restrict area found describ recogn introduc specif partit page shown figur set page width pixel determin rightmost margin node mt defin lm rm locat lm rm found set pixel pixel defin locat found briefli describ heurist discov header left menu page lack skip remain heurist discov constitu page heurist consist node mt satisfi mt root rs belong iff rs type complet belong upper bound tabl equal mt root rs belong iff upper bound rs equal belong found number maximum upper bound node found heurist lm consist node mt satisfi mt root rs belong lm iff rs type complet belong lm bound tabl equal mt root rs belong lm iff rs type complet belong rs belong lower bound equal upper bound greater equal result experi perform show effici recognit process spatial inform mt setup experi construct dataset suffici number page site scan document manual label area perform automat extract mt page perform automat recognit area interest defin heurist mt estim area recogn manual label refer point step conduct download page open sourc directori dmoz start point crawler download file level root categori construct download set randomli uniformli distribut categori size person perform step person kind control ultim judg label step perform tool siena includ mt builder logic appli recognit heurist siena tree written java visual object interest web page person step make judgment recogn perform enter label file compar automat label hand made label step step result shown tabl order discuss result notion recognit process clarifi area exist label exist label mark evidenc object belong object label mark evidenc mark evidenc object label object label mark object object label recognit heurist complementari recognit includ perform measur result tabl obtain introduc total score page sum mark recognit area interest mark mark map assum recognit process file similar open directori project involv thousand construct complet accur url repositori area expert volunt editor dmoz largest directori web dmoz complet free download directori data header left menu menu recogn bad good excel tabl success recognit process shade row repres success recognit stand stand stand analyz page perform found mt correct mt correct render process good typic error portion page intern good render scrambl rest recogn page defin heurist suffici final select valu margin statist page classif visual inform render modul enhanc document tradit captur complex structur web page page document cluster perform document experi rich provid render time data set web commonli accept standard refer classif task decid creat extract url provid level dmoz topic select topic level hierarchi reject topic featur url class discov class randomli url class web download document url link broken page page effect retriev averag page page creat data set data set easili enlarg updat continu chang web format style emploi frozen data set month repres real document found encourag research group emploi data set order provid comparison classif algorithm data set download correct correct total art busi comput game health home recreat refer scienc shop societi sport total tabl comparison classif accuraci naiv classifi account page versu mixtur naiv classifi account visual appar document inform carri visual appar classif accuraci naiv classifi naiv classifi simplest instanc probabilist classifi output probabilist classifi probabl pattern belong class naiv classifi assum text data set parametr model singl model train data estim unknown model paramet oper classifi comput probabl express probabl document gener model theorem gener model comput posterior probabl model gener final classif perform select model yield maximum posterior probabl spite naiv classifi accur learn algorithm text categor task naiv classifi classifi web applic focu recommend select classifi measur accuraci improv provid account visual inform classif result data set split train test set equal size naiv classifi train word document classifi construct visual inform baselin valid effect data order classifi page account visual page train test set extract basic left center titl creat naiv classifi classifi train constitu document classifi train word belong classifi classifi assign score document equal mix score singl classifi perform final mixtur perform assign ith classifi weight wi account expect relev inform store specif part tune assign weight left menu menu titl center header tabl show classif result method account visual page improv classif accuraci paper describ web page object welldefin tree hierarchi belong html structur page object carri inform posit browser window spatial inform enabl defin heurist recognit common area left center page crucial difficulti develop suffici good render algorithm imit behavior popular user agent internet explor result show system recogn target area case preliminari result shown spatial inform import classifi web document classif accuraci naiv classifi account visual inform construct mixtur classifi train word specif portion page plan neural network find optim weight mixtur classifi hope system improv focu crawl strategi estim import link base posit neighborhood account spatial inform document find applic area relat search inform retriev data mine web refer machin pp introduct modern inform chakrabarti van den berg dom approach web resourc int world wide web diligenti lawrenc gile gori crawl context int conf larg renni mccallum reinforc learn spider web intern confer machin jiang ng discoveri web lim ng structur html document stack intern confer inform network world wide web consortium decemb bernard optim web design jame structur inform audio framework select audio mark techniqu repres document phd stanford onlin mitchel mcgraw sebastiani learn autom text acm comput pp
DB/1396 3 parallel view mainten concurr data updat distribut sourc xin elk rundenstein ding depart comput scienc worcest polytechn institut ma abstract data built gather inform distribut inform sourc integr custom repositori recent work begun address problem view mainten dw concurr data updat iss popular solut eca strobe achiev concurr mainten requir iss sweep solut requir local strategi process updat messag sequenti manner optim sequenti develop parallel view mainten call incorpor benefit previou mainten approach offer improv perform due parallel order perform parallel view identifi critic detect data updat parallel correct problem dw commit order correspond dw updat process order due parallel mainten handl provid solut issu modular system insert timestamp assign modul detect data updat requir global clock synchron introduc neg counter concept simpl eleg solut solv problem variant order commit effect data updat dw proven correct pvm strategi gener correct final dw state implement sweep pvm ev data wareh system perform studi demonstr perform improv achiev pvm sweep data parallel view concurr data perform evalu paper submiss work support part grant nsf grant nsf cise instrument grant nsf grant dr rundenstein industri ibm ibm partnership laboratori incorpor partial support xin zhang introduct background data wareh import technolog integr data distribut inform sourc order provid data support data mine applic dw problem maintain consist underli iss updat critic issu typic practic maintain dw increment recomput extent dw due larg size dw enorm overhead dw load process dw connect iss network network gener unaccept block updat transact order integr immedi accomplish view mainten process mainten typic conduct separ asynchron call defer view mainten defer view mainten block updat transact time period extent dw temporarili inconsist iss recent number algorithm defer view mainten eca handl view mainten concurr data updat central strobe sweep handl distribut iss solut improv perform view mainten reduc time dw lag inconsist iss optim lead improv qualiti dw import applic stock market system perform optim dw mainten focu work approach effici algorithm call parallel view short preserv advantag includ sweep overcom main limit term perform sequenti process sweep handl data updat sequenti enforc data updat queue dw manag data updat receiv fulli process sequenti process time dw system build distribut iss requir system dw process wait process dbm server transmiss result updat messag network variat call handl multipl du effici part queri put requir requir du order termin show pvm effici handl set concurr data updat previou solut parallel du handl process investig introduc parallel view mainten identifi research issu central enabl parallel solut view mainten issu detect conflict concurr data updat parallel execut paradigm issu handl random commit order effect data updat ws call parallel execut view mainten process block incom du introduc timestamp servic explicitli identifi incom data updat queri result receiv middl layer detect concurr data updat extend mean counter assum dw uniqu tupl duplic counter tupl dw includ neg count neg counter number faulti delet tupl due problem track order fix faulti tupl delai data insert detect correct solut base neg counter proven full implement pvm popular contend literatur ev data wareh manag system accomplish evalu base cost model studi shown pvm achiev perform improv sweep contribut main contribut paper ffl identifi perform limit view mainten solut term perform limit research issu address achiev parallel du detect problem problem ffl introduc timestamp servic algorithm solv du detect problem parallel execut paradigm ffl develop solut problem neg counter concept ffl correct pvm solut confirm gener final dw content complet algorithm proof present technic report due space limit ffl design modular pvm architectur incorpor solut techniqu base minim adapt solut achiev parallel view mainten quick adapt pvm current system ffl implement pvm primari contend literatur algorithm uniform ev data wareh system fair compar evalu implement experi perform studi sweep system report literatur base discuss algorithm complex ffl conduct seri studi assess perform benefit limit pvm compar sweep conclud pvm perform improv sweep section background materi work section pvm includ open research issu introduc section present result perform studi section relat work discuss section background view mainten data model data store integr inform multipl inform sourc materi view data materi view dw updat call view mainten process vm process happen call dw iss consist zhuge al defin notion consist view depend updat incorpor view data ffl updat incorpor materi view activ view consist relat inform sourc ffl strong order dw state correspond order state space space state result separ dw state ffl complet complet map state dw state inform sourc increment view mainten view mainten concern maintain materi view underli inform sourc modifi time straightforward approach recomput view extent data updat realist increment solut calcul effect data updat iss updat data increment typic effici data updat separ time increment approach straightforward data updat happen base relat receiv middl increment comput send subqueri queri respect attribut oe predic explain gener execut order subqueri equat introduc notat tabl notat mean du data updat uniqu subscript queri handl du qr queri result ism inform sourc uniqu index sq ism result sq du du uniqu timestamp effect du sq sq uniqu timestamp uniqu timestamp tabl notat subqueri gener sequenc start join relat left side continu join relat side du order gener scan scan sq sq sq sq sq sq notic dont send subqueri initi report updat simpl approach succe case updat space time complet increment comput view updat occur due autonom natur inform sourc particip data kind separ time maintain data concurr data updat separ accomplish naiv increment mainten illustr view mainten concurr data updat data updat happen concurr data updat du queri process queri middl layer handl data updat du call data updat du data updat place concurr mainten process servic updat definit du du denot du ism data updat du call updat du denot du du du receiv earlier du middl du receiv dw answer sq gener dw handl du updat du exist du du du previou work make assumpt facilit definit assumpt order middl layer receiv messag order send messag fifo assumpt dw legend du du du du sq sq qr figur definit data updat omit select condit project attribut appli relat relat subqueri figur du occur du occur assum du receiv time denot du earlier du time denot du dw dw gener queri order handl du queri broken handl sq gener du occur receiv sq assumpt du receiv earlier queri result sq denot dw dw assign denot middl layer dw middl base du receiv earlier du du receiv earlier mean du affect result definit du data updat assumpt assumpt held previou vm literatur assumpt iss independ data updat propag iss assumpt updat base relat assum insert delet tupl modifi model delet insert comparison view mainten algorithm eca strobe sweep algorithm solv problem comparison featur shown tabl inspir due featur complet high perform handl data sweep baselin algorithm aim improv perform set data updat algorithm architectur consist messag kei point execut cost eca central strong requir remot quadrat messag size strobe distribut strong requir uniqu kei assumpt distribut complet requir uniqu kei assumpt sweep distribut complet requir local nest distribut strong requir local sweep du tabl comparison strobe sweep major limit sweep handl du sequenti middl layer fulli handl du commit dw start process du perform set du forc unnecessari delai due wait mainten queri iss algorithm call pvm enabl parallel view mainten advantag sweep list tabl error correct increment view comput sweep sweep algorithm base techniqu call error correct complet evalu queri eca strobe sweep elimin effect concurr data updat evalu increment view mainten queri page detect middl layer assum process increment view mainten data updat queri partial evalu current queri result step calcul updat evalu result fifo properti middl layer middl layer receiv receiv queri middl layer error term evalu local elimin restor expect answer demonstr pvm solut sweep parallel view mainten solut architectur pvm base pro con previou vm introduc architectur pvm system figur extens initi architectur adopt vm system process updat materi view dw function calcul effect data updat dw function largest overhead wait process remot queri process handl multipl possibl restrict process remot queri sequenti order result wait due process transmiss network function system handl data updat time figur modul pvm process assign timestamp incom includ data updat queri detect concurr data updat item annot denot figur updat queri result receiv iss due assumpt queri result affect data updat order assign messag addit concurr data updat receiv earlier queri result queri result treat concurr data updat order parallel view mainten introduc relat process updat set parallel process updat set detail function section issu detect du parallel execut order handl concurr data updat parallel issu address correctli detect concurr du origin data updat detect sweep base store data updat sweep sequenti data updat wait order arriv handl sweep pvm parallel execut remov multipl du put parallel handl process pvm possibl extend sweep concurr du detect scheme check show check suffici present illustr pvm fail detect concurr data updat motiv illustr problem du du qr du wait du set du du qr du wait du set du set legend du detect problem solut problem figur du detect problem figur data updat du du iss du arriv dw du du handl du affect queri result qr process calcul effect du du data updat definit figur du wait handl store set handl final pvm system handl assum du handl faster process du du receiv queri result qr du remov pvm system pvm longer detect data updat du check final state dw handl du du updat inconsist state iss solut detect du reason problem track data updat complet handl futur concurr data updat detect address problem complet handl data updat special hold place check potenti concurr data updat call data updat relat process definit process data updat complet handl middl layer relat process updat exist data updat du receiv du dw hasnt complet handl process order solv put data storag pvm system call set maintain relat process updat retent longer process handl data updat du commit effect du data clean remov unrel process du satisfi definit simpli check timestamp indic du check du process put set figur illustr rel time interv du process issu dw commit motiv parallel view mainten algorithm work multipl data updat du shorter process time du termin iter due empti queri result due network delai connect view mainten thread commit chang data avoid unnecessari wait system perform commit order updat match order data updat receiv result inconsist state dw mean space state match assum relat dw defin dw extent dw shown figur data updat du du happen du add du delet middl layer receiv du du effect du denot defin du shown figur effect du denot calcul receiv du defin du shown figur appli order correct commit order part figur correct dw state sweep assum queri individu return correct qr time conflict encount time conflict result strategi calcul base time stamp du queri result assum local strategi adapt sweep du receiv order log data queri calcul depend select dw updat correctli dw du add du drop counter counter counter initi state relat data data updat du effect data data updat du effect data figur environ du du correct commit counter dw counter counter du du wrong commit counter vm legend figur problem commit order origin dw count posit tupl current dbm updat dw wrong commit order shown bottom figur subtract exist equal union wrong dw extent depict figur faulti tupl counter correct answer dw extent correct commit order part figur problem definit assum data updat du du happen iss space state iss effect du propag matter order execut space denot uniqu state iss correct extent dw view extent recomput directli space state iss parallel increment view mainten order commit effect data updat result extent dw correct order data updat effect commit dw definit problem inconsist final state dw space variant call problem dw dw du du iss iss increment view mainten concurr data updat figur correct criteria extent dw du du legend du commit du commit view view figur order problem theorem problem defin definit occur modifi tupl receiv middl layer handl parallel pvm space proof omit found technic report figur illustr problem view problem happen handl data updat du handl faster handl data updat du case du complet commit effect dw prior effect du commit dw solut techniqu call solut extent dw parallel increment view mainten multipl du correct basic principl underli solut store dw extent uniqu tupl counter show duplic exist tupl mean tupl valu exist uniqu twist permit counter neg ad tupl exist counter creat tupl counter remov tupl counter reach user access tupl counter visibl dw counter dw counter du du wrong commit order neg dw counter dw counter du du wrong commit order neg vm legend figur solut dw commit order problem figur compar extent dw previou section neg counter upper half dw tupl posit counter time effect du remov updat invalid dw commit ad faulti tupl delet delet attempt lower half figur dw tupl neg counter addit faulti tupl futur remov tupl neg counter dw tupl neg counter effect rememb tupl delet delet current time due dw lower dw tupl neg counter effect rememb delet eventu commit tupl tupl tupl final complet remov dw final state dw consist state iss lemma neg counter mechan section counter tupl posit dw reach quiescent state intuit lemma quiescent du dw stabl consist current space state outstand mainten process complet effect neg counter tupl neg counter dw pvm doesnt requir quiescent state commit updat dw user tupl posit tupl neg counter end user neg counter full reflect base updat occur dw time quiescent dw mainten process fulli complet converg reach theorem base algorithm figur correctli solv problem number du shown proof theorem base induct number concurr tupl lemma theorem confirm correct final state dw appli effect data updat prove pvm ensur consist type converg consist level pvm form ensur converg level consist order maxim parallel mainten process individu updat import achiev converg complet enforc effect data updat commit order arriv dw easili achiev pvm ad extra buffer updat view modul figur buffer readi commit updat data order receiv updat view modul updat view head buffer fill term du time wait previou du commit price term perform achiev due limit maxim paral vm process full advantag final commit refresh dw delai preserv desir order requir complet consist algorithm pvm process base kei featur give detail pvm process compon emploi figur tradit found vm modul constant process begin loop receiv send end process begin loop receiv send end begin initi end figur pseudo code modul figur depict softwar modul emploi dw view mainten main process invok updat receiv dw modul start process assign uniqu local timestamp messag dw includ data updat queri result process monitor check data updat log set room creat thread handl du move data updat set atom creat instanc process handl data updat set process handl data commit effect data updat dw move data updat set set data updat relat process data updat complet remov system set clean end process run dedic process clean set fix time interv perform studi setup implement sweep pvm algorithm java ev data system demonstr acm ev system interact data studi conduct oracl server run network nt machin technic report evalu perform pvm contrast sweep base studi analyt cost model studi demonstr advantag pvm sweep confirm valid cost model due limit review small subset find paramet analysi tabl assum set iss integ attribut dw defin iss figur extent randomli gener approxim number tupl relat tupl size size illustr perform gain pvm sweep larger iss lead perform improv due io process cost modul constant integ size global data initi correct view queue initi set length set initi process relat var begin comput left part increment view result comput part increment view result unrel updat cleanup critic area remov relat put end function boolean return return endif end function relat send data sourc line time stamp assign process receiv data sourc remov error due concurr updat endfor end process var current system time dw begin loop receiv messag data sourc receiv messag append assign endif end process begin loop full begin critic area remov append end endif forev end begin start manag end figur algorithm pvm perform pvm figur page show behavior pvm number inform sourc vari size figur size plot time pvm size present line correspond number iss number inform sourc vari number data updat inform sourc fix base figur make queri capabl iss larger maximum number thread total execut time pvm reduc size fix time longer call point observ show perform gain pvm base queri capabl space system capabl dw manag term maximum number thread found confirm experi perform pvm denot pv size proport sweep paramet experi number concurr du number iss size number parallel number queri process time time handl set du time handl data updat tabl paramet evalu creat view select rm rm rm figur data view definit scalabl pvm figur show approach scale number du number inform sourc fix number parallel thread pvm number concurr data updat inform sourc vari pvm perform linear number concurr data updat line move bit linear multipl thread wait accomplish queri iss number thread iss fulli perform linear number concurr du comparison pvm sweep figur page compar perform pvm sweep term number data updat number inform sourc fix set number data updat inform sourc vari compar notic pvm faster sweep explain section ratio sweep pv experi mean pvm achiev perform improv space constraint prevent present result detail discuss found relat work maintain materi view dw access base relat replic part base data dw data ad space complex size figur pvm perform number thread linear linear linear linear figur pvm scale larg number concurr du rise inform redund lead inconsist dw extent view view mainten method concentr ensur consist dw materi view eca famili algorithm introduc mainten problem solv singl strobe sweep view mainten algorithm multipl iss focu concurr data updat strobe algorithm introduc concept queue view updat dw commit updat dw unansw queri set empti algorithm solv consist problem subject potenti threat infinit dw extent updat mechan base requir iss timestamp view updat global time synchron environ consist mainten method infinit wait defici global timestamp servic tabl pvm doesnt limit handl multipl data updat sweep famili algorithm elimin mention limit appli local techniqu sweep special detect method concurr data updat dont global time stamp mechan requir quiescent state updat dw pvm address bottleneck sequenti process exploit inher parallel view mainten process due distribut iss independ server handl set du queri result due requir infinit call result mainten failur pvm doesnt appli process optim share queri result parallel sweep mainten process detail compar analysi pvm remain du sweep figur comparison pvm sweep number iss correspond undertaken poss framework introduc achiev highest perform select vm algorithm base higher concurr smaller messag size queri plan model choic mainten plan trade send separ subqueri queri iss versu send subqueri time piggyback intermedi result join remot option requir larg result messag return join option enforc sequenc subqueri process pvm tackl problem pvm parallel handl group du achiev higher perform investig problem parallel view mainten identifi bottleneck term sequenti handl du current vm solut call sweep sweep algorithm limit compar altern contend adopt sequenti process handl set data updat identifi open issu achiev parallel view concurr data updat detect parallel execut problem present integr solut call pvm capabl handl problem fulli implement sweep pvm ev data wareh system conduct set experi studi perform result demonstr pvm achiev perform improv compar sweep acknowledg author student system research group wpi interact feedback research grate andrea design implement ev system pvm prof input idea present refer el effici view mainten data page conserv timestamp materi view mainten data workshop materi page surajit chaudhuri dayal overview data wareh olap technolog sigmod algorithm defer view mainten page colbi singh mumick mainten multipl view workshop materi techniqu page hv mumick data integr view intern confer extend technolog page ashish singh mumick mainten mainten view gener inform technolog gupta mumick mainten materi applic ieee data engin special issu materi view ashish gupta singh mumick data wareh materi view intern confer larg data page panel hector janet zhuge distribut parallel comput issu data wareh symposium principl distribut page abstract subrahmanian maintain view increment page effici view workshop materi techniqu page june akira daniel singh dallan kenneth ross concurr control theori defer materi view page akira daniel singh kenneth ross implement increment view mainten nest data model workshop program page increment mainten materi view expert system applic page rundenstein view mainten view synchron intern engin applic symposium canada kevin amr el abbadi framework optim increment view mainten data data wareh knowledg discoveri intern dallan ashish singh jennif widom make view data wareh confer parallel distribut inform page li evolv view environ demo page vijai kumar maintain consist partial view data expert system applic page wu research issu data wareh technik und page janet hector jennif widom system prototyp view mainten workshop materi techniqu page widom research problem data wareh intern confer inform knowledg page rundenstein parallel view mainten concurr data updat distribut sourc technic report worcest polytechn dept comput hector widom view mainten wareh environ page hector wiener strobe algorithm consist intern confer parallel distribut inform page decemb hector janet wiener consist algorithm view mainten distribut parallel
DB/1397 3 perform data mine applic jeffrei bradford electr comput engin purdu west jose fort electr comput engin purdu west abstract paper perform behavior tree induct applic data mine knowledg discoveri perform studi execut driven uniprocessor model exploit instruct level parallel vari properti program note dispatch provid perform improv ipc versu improv ipc issu versu greater perform improv larger cach program limit cpu dispatch greater perform improv smaller cach size program small instruct instruct cach suffici bring instruct miss rate small data cach suffici captur result miss rate size data cach significantli improv perform fraction dataset fit cach procedur develop scale cach size result smaller dataset predict perform dataset introduct recent year multiprocessor server applic recent paper examin perform characterist commerci applic characterist commerci applic guid design comput system sql queri tpcd benchmark program except altavista web search engin desktop applic run window nt paper tree induct commerci applic commonli data mine knowledg discoveri data mine attempt find pattern exhibit characterist substanti simpl queri onlin transact process support system dss queri includ ship method part receiv custom commit queri data mine address question find emerg dispar medic detect fraud cellular phone discov global determin item improv store data mine applic tend exert pressur requir oper system solari binari program examin paper tree induct program kb static link dataset runtim data mine applic typic longer oltp dss scale respect dataset size program examin paper properti dispatch provid perform rang issu small data cach suffici captur reduc miss rate dataset size data cach significantli improv perform fraction dataset fit cach program small instruct instruct cach suffici bring outlook humid sunni plai rain plai dont plai dont plai true plai outlook temp humid sunni sunni true rain rain rain true true sunni sunni rain sunni true true rain true figur left sampl dataset induc tree classif goal decid weather nice plai golf attribut weather rightmost column class label tree base valu class label pair number node number instanc class node instruct miss rate remaind paper organ section briefli introduc creat section explor perform tree induct program detail section detail result dataset predict perform dataset section contrast characterist tree induct program commerci applic tree induct section introduct tree algorithm automat creation tree coverag necessarili interest reader point extens literatur detail tree common knowledg classif tree base data specif class instanc belong tree type test base leaf predict classifi begin root node node leaf predict made base label leaf node base answer test edg node process repeat leaf node encount dataset induc present figur paper examin characterist program perform automat induct tree program requir dataset label collect acquir data class label instanc assum entir dataset fit main memori reason current comput system gb main memori induc tree gb dataset requir modif exist dataset virtual memori overlai awar studi investig perform impact dataset tree claim handl perform number provid tree induc step pseudocod cart procedur view greedi search space pick singl split divid divid instanc base appli procedur instanc class instanc belong class pick test node form test outcom partit instanc base test outcom foreach step pick test node heart process goal determin test number instanc phase load data calc gain discret attribut sort continu attribut calc gain continu attribut group instanc prune tree evalu train data evalu test data print tree save tree disk total number instruct tree prune tree prune tabl number instruct instanc tree size phase input set size dataset case instanc train remain test step examin divid instanc separ make instanc pure measur differ import note calcul puriti typic requir coupl dozen instruct gain split differ puriti split determin test gain test determin test greatest gain chosen discret attribut exampl discret attribut weather boolean variabl test discret attribut form node test discret attribut continu attribut real number test continu attribut form attribut real node test continu attribut determin gain discret attribut singl linear scan instanc perform comput number instanc class attribut gain split attribut calcul determin gain continu attribut demand instanc sort attribut midpoint consecut valu gain split calcul test instanc split base test test attribut instanc attribut irrespect valu instanc partit step appli instanc node point leaf form complet induct process requir step includ read dataset disk estim predict error examin program sourc code induct step domin runtim memori access confirm measur dynam instruct count phase dataset detail section tabl inform number instanc vari step domin runtim step focu paper initi load data step requir number fact input file resid ascii format read string manipul input routin rewritten full commerci indic commerci methodolog result section discuss simul methodolog dataset examin perform tree induct initi result simul public simul develop rice perform simul model multiprocessor system support multipl instruct branch cach dataset number number featur instanc continu discret breast mushroom adult shuttl sleep tabl properti dataset section section simul instruct due small size applic program kb static instruct cach miss rate current cach verifi case section simul vari architectur paramet individu understand effect paramet cost slowdown execut requir dataset size scale issu address section induct process begin empti cach perform simul uniprocessor model exploit instruct level parallel vari processor model processor processor add support dispatch free cach support outstand miss processor model aggress issu width outstand cach miss processor branch predict entri processor entri processor cach byte fulli pipelin cach cycl hit write cach cycl hit cycl miss memori bu transact requir bu byte wide transfer byte cach line requir cpu cycl dataset tabl standard dataset repositori machin learn commun dataset typic accuraci instanc split set train induc test estim predict accuraci classifi paper interest characterist predict instanc accuraci estim step skip dataset section consid machin learn dataset primarili estim predict accuraci algorithm dataset consid commun dataset size yield reason runtim simul hour mhz ultrasparc requir coupl run nativ figur figur show ipc achiev miss rate size vari kb mb cach ensur entir dataset fit miss rate suffer cold miss cach size kb kb perform processor larger cach perform breast dataset dataset issu processor perform perform ipc ipc case processor size cach effect true cach figur figur show perform cach miss rate cach vari kb kb cach miss rate constant respect vari size small cach perform typic factor case processor perform advantag entir dataset fit mushroom ratio larger perform advantag processor provid perform mushroom dispatch perform small cach case mushroom cach mushroom smallest perform improv largest perform improv dispatch investig program limit memori access limit cpu simul vari cpu clock speed memori hierarchi speed constant program memori cpu speed provid perform improv program clock speed provid perform simul vari cpu clock speed slow paramet control cach size breast dataset ipc cach size dataset cach size dataset ipc cach size mushroom dataset figur perform cach size vari upper dark line show perform issu middl dark line show perform lower dark line show perform issu processor light line discuss section cach size breast dataset miss rate cach size dataset cach size dataset miss rate cach size mushroom dataset figur miss rate cach size kb cach cach size breast dataset ipc cach size dataset cach size dataset ipc cach size mushroom dataset figur perform cach size vari upper dark line show perform issu middl dark line show perform lower dark line show perform issu processor light line discuss section cach size breast dataset miss rate cach size dataset cach size dataset miss rate cach size mushroom dataset figur miss rate cach size vari cach size breast dataset cach size dataset cach size dataset cach size mushroom dataset figur perform cpu clock speed constant memori hierarchi speed cach size vari cach size adult dataset data cach miss rate cach size dataset cach size shuttl dataset data cach miss rate cach size sleep dataset figur data cach miss rate size kb cach size vari memori hierarchi hit miss bu memori speed report ipc measur ipc result present figur dataset significantli larger cach usual processor speed result improv result improv mushroom entir dataset fit cach processor speed significantli improv perform determin cach memori experi cach speed vari separ memori speed result faster cpu cach constant memori access time similar figur result faster cpu memori access time constant cach speed show speedup respect cpu memori speed memori access cach primari bottleneck scale dataset section discuss result smaller dataset estim perform dataset slowdown run simul nativ case result shown smaller dataset commerci environ describ method scale cach size obtain compar ipc perform simul find number instruct execut scale linearli dataset except scale cach difficulti data structur scale equal dataset size examin program reveal type data structur type scale linearli dataset size data structur includ tabl instanc pointer gain split type scale linearli number attribut size structur constant respect number number attribut smaller number instanc structur fit cach data structur tree unclear tree size scale number instanc evid suggest size tree size number predict accuraci tree improv refer type collect data perform memori simul memori refer data structur refer specif data structur memori access assum hit resourc conflict data depend model featur examin perform impact refer secondari data structur simul memori access primari data differ result result simul memori access perform impact secondari data structur reexamin figur figur figur figur lighter line show result simul refer larg data structur cach size pair line ident pair line ident cach size show dispatch hide latenc access small data structur singl multipl issu small cach size memori access secondari data structur number access factor number miss factor number miss unchang fact evid figur simul primari data structur significantli miss absolut number miss result show access secondari data structur captur small size found current commerci access larg primari data structur scale linearli number scale structur affect simul rerun full dataset result ipc dataset size cach size similar ipc dataset half larg cach half big miss rate cach unaffect dataset miss rate cach dataset size equal miss rate cach half larg dataset half larg hold smaller dataset achiev ipc larger counterpart guess dataset small number instanc program form good gener result discuss previou paragraph factor differ number instanc examin greater dataset dataset dataset number instanc miss rate adult shuttl sleep tabl instruct cach miss rate number cach tabl due size unabl shade calcul miss rate major drawback cach miss rate actual perform base result previou hit rate fairli accur predictor ipc start stop perform memori make difficult simul induct phase select simul base instruct memori simul perform function induct phase figur show data cach miss rate induct step cach size size dataset result gener show perform similar dataset size cach size ratio shuttl exhibit exhibit jump instanc cach instanc cach measur instruct cach miss confirm instruct cach miss significantli affect perform instruct cach miss rate shown tabl instruct cach miss rate case paragraph show cach size dataset achiev ipc final issu number instruct execut scale dataset size examin tabl instruct requir step induct process scale number instanc log show linear behavior examin instruct count larg dataset dataset show instruct count dataset size simul memori refer sort routin show due primarili dataset show linear sort dataset continu sort requir continu attribut process rewrit program remov part address issu work present perform memori program compon data mine applic previou work examin perform commerci oltp dss applic benchmark program tree induct program exhibit properti commerci program author identifi distinct type pattern sql queri found index queri sequenti queri consist access select area index consist singl linear pass subset tree induct program perform possibl pass order runtim author find commerci applic larger instruct work set scientif find instruct cach suffici bring instruct miss rate author find commerci applic yield high case pentium pro user code find risc processor dataset larger dataset smaller processor dispatch achiev find tree induct program characterist ffl dataset fit usual high memori bandwidth low memori latenc provid perform fast processor fact import typic greater memori access latenc larg data cach benefit occur fraction dataset fit cach ffl dispatch substanti improv perform tend dispatch greater perform smaller multipl issu greater perform larger cach ffl primari data structur input data shown minor perform gain size data cach kb small data cach suffici applic ffl data structur input data good memori refer data structur impact perform data minor impact data cach ffl type system cach low latenc high bandwidth compar main perform limit memori latenc bandwidth entir dataset fit bandwidth cach line processor cycl suffici high perform paper develop procedur scale cach simul dataset figur show small data cach larg captur memori refer secondari data small significantli affect access primari data structur simul speed greater rang cach size simul time larger refer larg data structur small cach result chang measur shape perform curv unchang wide rang cach size kb figur show wide rang data cach size show result fraction dataset fit cach figur impli perform constant ratio cach size dataset show reflect result dataset cach dataset cach measur perform mb dataset system mb simul dataset time smaller cach time smaller kb acknowledg due research group simul jeffrei bradford support intel foundat doctor fellowship refer system commerci workload pp classif regress wadsworth intern workshop comput architectur evalu commerci fast simul execut sigmetr longer version sun microsystem tr scalabl effici parallel classif algorithm mine larg joint quad pentium pro smp oltp pp analysi workload perform simultan multithread pp desktop applic window pp commerci workload window workshop system perform octob merz repositori machin learn machin oat effect train set size tree fourteenth intern confer machin learn refer manual version technic report depart electr comput rice august program machin morgan san workload system pp scalabl parallel classifi data larg pp memori perform dss commerci workload pp transact process perform
HCI/1398 4 learn agent wireless access daniel michael pazzani jame chen depart inform comput scienc irvin ca abstract describ user interfac wireless inform specif design facilit learn individu interest daili stori user feedback collect form basi machin learn algorithm system adapt individu reduc amount inform user access relev inform minim effort keyword intellig inform user machin learn introduct driven growth inform intellig inform access central research area comput scienc centuri commonli inform sheer amount inform readili todai creat challeng numer intellig inform agent softwar tool provid person assist user navig larg inform space literatur deploi intellig inform agent limit wit trend inform type wireless inform design tap vast inform resourc physic marketplac cell phone access inform pager alert user devic undoubtedli enhanc util onlin inform open opportun revolutionari technic constraint small size wireless inform devic lead inher limit user interfac bandwidth constraint limit amount inform transfer importantli current condit wireless inform transmiss servic provid charg user base amount data turn wireless inform access costli luxuri compar regular internet access transmiss cost palm vii amount approxim month extra charg cent addit kb intellig inform agent potenti significantli reduc amount cost data paramount import ubiquit inform access applic agent interest prefer simplifi inform access task substanti focu learn agent design user access interest stori palm vii organ wireless inform note learn approach interfac design report gener devic cell phone pager wit ongo trend person inform access part numer person servic emerg internet portal lyco excit offer person access daili stori larg rang categori servic base static questionnair user fill order make filter capabl level person inform access suggest intellig agent learn interest daili stori observ behavior machin learn algorithm origin develop client agent learn stori respect individu interest section illustr role part larger architectur person servic describ user interfac client design palm vii port client interfac assum larg screen high speed internet connect wireless pda requir translat client platform evalu element interfac determin featur reduc number size interact client shift process server interfac redesign inform user prefer infer normal usag system read explicit feedback briefli outlin machin learn approach motiv algorithm design illustr domainspecif requir discuss perform direct futur work conclud paper system architectur agent paper function part architectur person access gear requir usag access singl server refer server adapt inform server ai access provid maintain inform current stori person prefer user previou work report client architectur talk agent design work part intellig car radio addit client exist daili learner learn onlin public user multipl categori retriev full text stori click headlin system support explicit user stori interest user commun read event immedi server collect explicit form basi machin learn algorithm learn model interest user daili learner compil person learn model select stori interest user agent implement addit client ai framework adapt daili learner requir constraint wireless inform result client palm vii organ import note user profil access client mean user version person profil remot palm vii intellig user interfac wireless access interfac design wireless daili learner base usabl constraint portabl inform devic aim minim requir interact user amount data transmit devic server goal conflict explicit stori user commun explicit rate rate transmit server ideal agent wireless inform access requir addit work number slow network oper amount data transmit collect prefer inform simpli observ access pattern success implicit user feedback report context learn web agent figur show main menu daili learner palm vii interfac user associ uniqu devic id palm devic exist newli creat daili learner account oper ensur user access person profil explicit login user channel tap devic retriev set person headlin ai headlin screen shown figur due displai headlin displai addit set request time headlin transmit displai respect current interest profil reduc amount data headlin interest user devic headlin annot icon system highli recommend stori user occur probabl user interest stori greater user tap paragraph headlin relat displai figur ai find relat stori base textual similar comput weight summari user return previou headlin read page stori page refer paragraph byte remain text stori request page page user save transmiss cost determin interest user stori figur daili learner main menu palm vii addit function user keyword queri search stori save time transmiss cost user updat stori aspect search function order return result determin keyword person interest profil user search term multipl context past access ai learn user interest interest role presidenti fund campaign stori match submit queri ai give prefer reduc transmiss unwant inform interfac lend captur prefer inform implicitli assign score quantifi interest displai headlin user rate stori infer rate implicitli observ action interpret select stori posit feedback order make inform rate techniqu convert action score rang user tap headlin request posit rate gener set score select stori score user request page page bodi show user request page rate correspond stori user download complet reason heurist collect prefer inform user charg expect click headlin find interest assum proport stori user pai posit correl interest stori interpret skip stori neg feedback assign constant score skip predict stori account determin implicit score subtract constant set predict assign low implicit score confid skip stori receiv low predict stori thought high interest user user select gener implicit rate case user express prefer relat stori lack rate attribut lack extern factor loss connect server area weak signal strength effect implicitli label stori enter user model ai adjust interest subsequ current session headlin page request figur daili learner headlin summari screen learn user model label text document design algorithm ai stori motiv number observ requir account algorithm learn user design goal algorithm capabl learn potenti small set train exampl flexibl quickli adapt user chang long train period algorithm account user inform chang direct result interact inform point import stori interest long user addit stori event match interest profil transmit safe assum user read similar stori requir led develop learn approach learn separ repres user repres user interest learn model recent observ lead user model adjust rapidli chang interest separ model substanti specif task classifi stori user typic track ongo recent event task requir inform user interest stori current space shuttl system identifi stori present user dai user gener model gener prefer prove decid relat recent rate interest user respect space shuttl identifi characterist terminolog stori interpret evid user gener interest technolog scienc relat stori model base nearest neighbor algorithm full text stori repres vector space model weight base proxim recent rate algorithm determin stori interest user addit advantag determin stori neighbor classifi stori stori classif deleg model model base data collect longer period time repres gener prefer word stori ai period select vocabulari individu categori larg sampl stori featur set featur user goal featur select process select inform word long period time inform word distinguish document assum good topic indic select word consist receiv high valu larg set stori collect period month stori categori featur word recur theme daili model gener prefer model probabilist learn naïv bayesian classifi assess probabl stori specif subset featur order confid appli naïv stori minimum number featur default score assign naïv effici learn predict shown perform competit complex learn algorithm approach model base recent observ user track thread label stori stori classifi model algorithm detail evalu discuss palm vii devic develop evalu number regular palm vii user limit begin trend base data collect palm vii user download instal client applic palm vii devic octob observ regular user experi compar adapt recommend techniqu static access person period ten dai octob person relev predict half half receiv stori static order determin editor sourc odd user odd account registr number receiv person order user receiv static order polici quantifi differ measur displai select stori person static oper mode express rank function number select stori reveal differ approach restrict analysi stori select user retriev stori result averag rank static adapt mode select criteria hold user select stori practic implic differ appar distribut select stori separ headlin screen screen static select stori top headlin true stori person mode make notic differ work handheld interpret result evid util adapt access result suggest effect person achiev requir extra effort user due absenc explicit difficult evalu palm vii client standard inform retriev perform measur recal encourag previou evalu system base similar learn explicit feedback assum user train profil daili learner access palm predict approxim ratio correct recommend palm vii headlin screen train data obtain regular predict perform measur function number train session top recommend correct train session prior probabl stori interest data interpret result evid util california adapt inform server plan make system addit wireless inform platform version implement applic protocol send content cell phone wml present relat set challeng devic smaller screen slightli faster network connect palm vii summari present function underli algorithm learn agent wireless inform access system observ access implicit feedback input learn algorithm stori respect individu interest lead reduct time transmiss intellig inform agent import enabl technolog widespread ubiquit inform access refer yang topic detect track pilot studi final report darpa broadcast transcript understand user model inform retriev tutori sixth intern confer user person agent learn intern confer autonom agent pattern classif scene analysi john wilei learn filter twelfth intern confer machin learn taho agent assist web intern joint confer artifici intellig comparison event model naïv text classif aaai workshop learn text categor technic report aaai press pazzani learn user identif interest web site machin vol automat text process
IR/1399 5 test access extern inform sourc mediat environ mann budapest technolog econom depart control engin inform technolog jacqu peter karlsruh institut algorithm cognit system abstract paper discuss test commun increasingli import class distribut inform system base mediat architectur mediat integr exist inform sourc applic order answer complex mediat split subqueri send inform combin repli answer origin queri inform sourc autonom access notabl inform sourc subject modi cation error result incorrect behaviour system paper address problem decid inform sourc part system successfulli queri primari contribut formal framework gener inform access test problem investig import qualiti measur test method practic usabl present approach demonstr applic inform sourc empir experi conduct compar present method previou work eld inform access wrapper veri inform autonom inform sourc introduct previou work past decad tremend amount data store electron form recent consequ evolut world wide practic inform imagin found format www requir futur inform societi problem amount usabl inform sourc design complet di erent conjunct piec inform hold web varieti relat electron comput algebra special softwar mediat address problem integr autonom wiederhold suggest mediat pattern mediat implement common task split complex queri simpler underli iss combin repli answer origin queri includ detect handl potenti con ict iss return contradictori result iss bound mediat architectur wrapper compon translat queri languag mediat iss answer languag data model mediat result architectur depict gure inform mediat found inform sourc inform sourc inform sourc wrapper wrapper wrapper mediat user figur mediat architectur context work present paper provid open mediat technolog test access extern inform sourc shell develop karlsruh declar languag kamel mediat base annot logic framework easi construct enabl exist code mediat call metasearch implement special interest metasearch meta web search program queri deleg internet search engin altavista googl combin answer search engin answer page metasearch import reason spread world wide integr iss major challeng import applic mediat metasearch regard prototyp applic metasearch simpl mediat demonstr featur problem consequ integr autonom iss actual access extern iss perform special import paper point view case languag mediat boil encod queri url answer languag mediat actual answer titl excerpt relev page html plenti banner statist task wrapper extract actual answer result page regular express inform access test regular express possibl extract inform method illustr problem inform extract mechan reli regular output autonom turn prevent wrapper extract correctli aim paper investig problem test commun access extern special increasingli import class distribut inform system middlewar platform research relev work kushmerick algorithm statist number number special charact extract text segment learn paramet normal distribut describ featur distribut extract piec text normal distribut estim probabl wrapper output correct remain scienti work automat creation wrapper refer result wrapper test problem cohen notion textual similar web wrapper induct wrapper test detect structur html page al develop algorithm token gener repres learn signi sequenc token sequenc encount signi cantli expect chanc tupl extract set signi token chang discov html layout problem ia test mediat environ research exist result appli restrict problem class import restrict applic error produc layout syntact test method wrapper output paper address gener check access extern main result paper organ main contribut paper formal notat framework enabl de nition inform access test problem gener form exist result natur framework enabl prove hard major problem exist result method detect chang html give claim correct wrapper output erron section investig qualiti ia test demonstr high rate posit section method present gener ia test mediat environ applic set cover section case test access extern inform sourc present method appli case metasearch demonstr techniqu test qualiti achiev section conclud paper problem de nition section gener notat framework investig inform access test problem note framework cope toler ambigu repli test theori iss system test di erent understood case nite state machin unavail state speci cation inform order make de nition gure show commun model de nition commun alphabet commun system nite set messag element empti element symbol mean messag note di erenti empti messag messag de nition describ interfac iss note iss assum complet autonom knowledg intern state thing accept repli de nition inform sourc famili function mean time repli queri mean gave repli wrapper translat extractor tester channel inform sourc figur underli model de nition wrapper pair ture translat implement function translat queri extractor implement function fe extract repli note contrast wrapper intern structur chang time import note wrapper return fe state explicitli de assum wrapper aggreg inform usag perform task implement ia tester function access correct de nition access function sw judgement tester wrapper output extract repli queri state inform wrapper addit histor inform tester collect updat part output de nition tester make observ di erent kind note previou work ia test wrapper output de nition assum wrapper autonom access state inform wrapper observ ture machin de nition di erent goal creat de nition access test set ir object function gener consist construct tester maxim logic object function judgement nding perfect tester theorem perfect tester wrapper fallen nite loop perfect tester solv halt problem ture algorithm solvabl test access extern inform sourc settl ambiti object method work practic case suggest realist object function evalu tester section survei typic error cope access extern inform sourc note proof theorem made fulli notion perfect tester formal import futur research issu argu assum wrapper output detect nite loop true task input decid wait longer input requir produc output nite amount de nition restrict set search special import de nition search engin number tupl tupl consist titl url excerpt web page qualiti measur ia test strive perfect aim construct good section formal word good bene present qualiti measur guid construct ned comparison ia test mechan present section made introduc formal shed light common problem method present proven expect judgement tester natur requir correct high statist order formal assum tester perform test access wrapper extern number access number access error occur tester give judgement access erron number test judgement tester denot number test judgement tester de nition statist correct tester sc number sc bad sc answer question depend assum wrapper work properli error rare occur impli tester simpli judg access statist correct sc high sc bad signi cantli higher sc express phenomenon outcom test higher probabl similar problem medic context routin test small minor popul probabl patient su er low problem evalu qualiti test methodolog analog problem evalu ia tester solv di erent qualiti measur express sc de nition ty speci ty result sensit result adapt case ia speci ty correct sensit erron de nition speci ty sensit larg di erenc probabl judgement make di erent express order clarifi introduc condit de nition posit predict correct erron import qualiti measur show trustworthi tester tester judg access probabl access test access extern inform sourc interest connect captur theorem speci access theorem necessarili converg wrapper function correctli assum judgement tester correct case theorem deal case high low ideal expect predict valu converg rst claim theorem show true high mean tester posit reason test mechan present literatur su er larg number posit properti perfect tester high necessarili high impli express qualiti measur claim theorem explain reason region speci ty sensit depend sensit depend heavili ty huge speci ty posit predict su er sever proof judgement correct correct speci ty correct judgement erron erron sensit erron yp limit depend converg rapidli prove rst claim problem low condit impli tester prove express transform yp yp yp depend partial deriv yp yp yp prove theorem requir tester give correct requir met price paid automat test low import nonfunct qualiti measur program ort includ gener total cost test detail descript found test method section present ia test classi ed princip concept mode oper end section comparison present method practic applic suggest tester cover section test wrapper extract rst group test scheme test oper output regard test method import advantag method point inform output wrapper state inform wrapper de nition lost wrapper output result error valid repli wrapper work di erenti case test access extern inform sourc import disadvantag method high wrapper modi ed tester updat mainten cost reusabl signi cantli test output wrapper method paragraph make inform intern output thought test advantag disadvantag opposit complet independ intern state wrapper lack inform problem explain exist result paradigm wrapper test princip idea method wrapper output valu real subset string plausibl task tester de ned wrapper output theori formal languag invent method repres possibl nite set nite set sucient structur regular nite automaton case encod set classic result theori formal languag case insuci exist work literatur wrapper veri cation power method test wrapper output section test addit iss detect semant error requir knowledg mediat system natur integr addit knowledg integr iss iss tester determin output access make context redund gener improv system reliabl test queri test convent softwar regress test plai vital role involv comparison output system correct output input test gener scheme directli case mean answer queri repli method appli restrict class static iss similar method gener order decid empti wrapper output correct result test queri return repli gener state method categori ecient conjunct test method case test mediat system method higher test mediat system wrapper case practic iss integr mediat reduc number tester test ecient robust tester modi ed chang wrapper iss feasibl test repli addit knowledg main disadvantag method necessarili error clear output mediat system error remain lead lower sensit comparison suggest method applic commun textual choic syntact test wrapper depend implement detail result redund introduc textual commun error detect method method inaccur case syntact test scheme intellig method integr addit iss make detect semant error test cost overhead signi cantli method queri test oper case successfulli test queri method detect fraction error test oper wrapper make mainten absolut interfac de ned wrapper commun intern state test mechan section clari ed function test access extern inform sourc mediat architectur figur reveal place suitabl integr tester note choic tester integr mediat architectur complet orthogon review import possibl integr test function mediat case studi implement test method conduct experi order demonstr applic suggest evalu compar suggest compar result literatur implement implement place simpli ed version metasearch test mechan batch program written test implement test method larg set data implement detail ism experi made report implement test method batch test test method syntact tester regular syntact tester titl simpl practic perform method similarli syntact tester semant tester wrapper output internet addit tester check extract url point exist page step implement consist creat batch program evalu realiz test method sucient larg set test exampl wrapper error mean easi collect set test case erron access dr kushmerick depart comput colleg dublin made data collect period octob set data repli page actual internet site coupl speci collect month evalu implement test repli lyco metacrawl queri happi select period time case case lyco case metacrawl wrapper construct metacrawl page process correct wrapper search engin amount test case conduct set experi smaller set current data goal check result base data set transfer current identifi trend impact futur ia test possibl knew lot url return search engin year ago invalid corrupt test result check url return search engin queri happi invalid test result result batch test full detail gure store test number extract number error found implement test method import drawn result simpl test method combin virtual perfect tester big di erenc behaviour util method case correct incorrect wrapper output erron wrapper output appli method judg tupl erron case correct wrapper number tupl judg syntact incorrect judg semant incorrect turn experi current data gure rang wide gap behaviour test method correct incorrect case interest investig individu test method contribut good perform method syntact test method url test access extern inform sourc excerpt sucient distinguish correct incorrect wrapper output error test import test method element tupl error element detect note principl metasearch metacrawl test output metacrawl regard prototyp test mediat system clear test suggest method test mediat system import observ set output search engin similar modi cation human technolog rapidli similar occur futur make construct tester robustli year present gener inform access test problem mediat make integr autonom inform sourc formal framework present investig problem set gener gener past result literatur proven gener solvabl algorithm natur present qualiti measur make quantifi case properli work tester investig connect import qualiti speci sensit posit neg predict valu part solut suggest illustr practic applic present test scheme evalu mediat system import contribut paper gener framework exist result transfer explain care redund techniqu result framework proof properti mathemat mathemat method combin engin approach obtain import rule construct econom framework show futur research direct work present paper appli similar statist test problem signi canc qualiti coverag correct test refer system integr heterogen inform sourc intern symposium methodolog intellig system meta web search intern joint confer arti cial cohen recogn structur web page similar queri cornel colleg medicin diagnost accuraci etzioni grammar infer algorithm world wide web proc aaai spring symposium machin learn inform access ca aaai intellig inform home page muslea accur reliabl extract data machin learn approach data engin bulletin kushmerick regress test wrapper mainten proc page kushmerick wrapper veri cation world wide web issu web data minton learn common structur data mann von en auf extern einer master institut algorithm cognit mann valid access extern inform sourc mediat environ technic knoblock hierarch wrapper induct semistructur inform sourc journal autonom agent multiag editor predict depend comput system ward heterogen reason mediat system technic wiederhold mediat architectur futur inform system ieee march
AI/1400 2 complex logic program russel greiner depart comput scienc alberta alberta januari abstract program return set answer queri impur includ prolog cut return answer rule reason system return answer found depend rule pure system theori seek expect distribut modifi order rule paper show polynomi number train queri pair correct distribut inform identifi optim order task determin order distribut intract trivial queri atom seek rule base proposit prove task np polynomi time algorithm produc order theori accuraci fl fl prove similar result relat task impur optim order optim set rule optim set exist rule delet theori induct logic comput complex paper extend short articl challeng impur twelfth intern confer machin lake juli gratefulli acknowledg comment receiv anonym review work work siemen corpor nj complex logic program introduct system expert logic program product return incorrect answer underli knowledg base incorrect inform obtain correct answer queri answer suppli human expert call expert system return answer found incorrect repair correct devic answer debug code subsect pair produc theori correct typic logic system set queri produc accur theori initi theori accur typic case part deploi ilp algorithm effect wast effici correct theori process queri modifi initi produc accur theori implement theori system space oper simpl ad delet ad delet rule altern class transform rearrang order transform effect modifi perform system written shell oper prolog cut system return answer class shell includ priorit default theori product system prolog goal theori process improv accuraci reason system perform task answer queri section defin object identifi produc theori expect distribut maxim section prove polynomi number train sampl specif queri pair correct suffici provid inform identifi accuraci arbitrarili close arbitrarili high probabl section present main show task tractabl initi theori optim task intract trivial situat queri atom seek order return correct answer knowledg base proposit demonstr intract find smallest number requir produc perfect order deal version task accur trademark carnegi assum np impli problem intract impli approxim present defin term includ complex logic program case reorder produc perfect theori prove agnost task np algorithm identifi order theori accuraci fl fl result appli arbitrarili larg mean polynomialtim algorithm identifi order logarithm section prove similar result relat task determin optim order rule optim set rule add impur case appendix complet proof augment sketch main text close introduct mention obviou applic describ relat includ work logic theori anytim mention typic induct logic program build logic program base set train exampl exhibit desir behavior program program assum access suffici number correct train exampl determin logic program produc program obtain resourc algorithm return adequ program base naiv implement system start scratch time program run ilp system produc program tm run ilp system sampl produc program algorithm forc program time approach addit sampl improv store tm program requir algorithm initi set produc superior notic theori system design task debug logic earlier word task improv deploi obviou applic debug code peopl directli write perfect write code test behavior match task consid result test case class modif show task feasibl current program bug prove underli task extrem difficult origin program prove theori comput human effici find situat simpli throw origin program start neg result induct logic program complex logic program specif evid peopl write logic program debug note essenti step build shown work text knowledg acquisit relat research theori process produc accur theori result logic process fit logic program ilp ad inform initi start theori system wai modifi initi includ implement theori includ font delta system deal horn seek answer class transform paper delta system reorder rule empir result discuss show transform effect varieti relat complex result companion paper class transform ad delet rule standard pure context prove task find optim set rule add exist rule approxim factor pure context ling consid comput complex modifi theori deal type adjust numer network alter certainti factor chang structur arrang rule wilkin ma show intract determin set rule delet context weight believ function weight support rule exce threshold result show task proposit rule unit weight singl success rule suffici establish number result complex logic program scratch ilp outlin framework note focu horn theori syntact close initi ilp system return horn theori tend return theori syntact close empti theori small bergadano al consid challeng learn impur logic program includ prolog cut note difficult learn pure program paper addit teeth show specif task learn set rule add trivial approxim context pure impur program theorem complex logic program paper superfici similar articl complex find order set rule deal effici find answer paper deal accuraci answer return rearrang entail queri seek highest correspond model schapir selli show agnost learn task intract result differ deal class bit class calculu horn proposit present situat comput task theori belief system modifi theori incorpor observ world formal input initi theori assert retract return theori entail entail belief framework provid axiomat descript prefer explicitli prefer theori initi entail singl proposit result theori depend syntact structur initi theori theori obtain assert theori obtain belief system typic singl label queri modifi initi theori seek theori close correctli entail queri theori set label queri modifi search space theori syntact close theori optim accuraci respect queri notic theori system requir theori correct specif label produc theori semant initi theori search space final show theori task difficult initi final theori proposit belief framework deal arbitrari formula standard belief task complet higher level hierarchi work consid singl deal sequenc assert arriv longer distinguish inform present theori assert set element incorpor complex logic program framework section describ task context proposit prolog program section extend descript predic section present gener framework proposit horn theori defin order list horn includ posit liter order list liter finit languag theori liter theori includ rule prolog cut oper descript prolog answer queri oper relev prolog process theori rule reach cut prolog rule head unifi current subgoal trivial theori fail queri prolog find rule respect head unifi goal rule equat process order shown reach prolog commit mean subsequ atom rule prolog prove fail rule head unifi subgoal queri fail notic succe fail succe argument fail succe theori differ exchang order fail queri queri fail borrow view theori function map queri set set answer theori defin assum singl correct answer repres oracl mean hold complex logic program goal find theori close quantifi defin accuraci answer theori return queri oe respect oracl def oe correct answer return wrong answer function measur ts accuraci singl queri theori deal rang queri model stationari probabl function probabl queri oe pose comput theori set ft set theori form appli transform theori theori form rearrang theori task identifi theori opt expect accuraci opt challeng find optim theori base observ expect accuraci theori depend distribut mean theori optim distribut distribut estim observ set sampl drawn distribut section discuss number sampl requir obtain inform identifi good high probabl left challeng comput sampl section address comput complex show task effici algorithm find theori expect accuraci close defin optim distribut chang mean function descript lead result word claim term compat result complex logic program predic calculu handl predic calculu answer form express bracket bind list free answer found queri theori pc order obviou queri return pc queri return answer pc system return answer pc system ab queri return answer ab notic theori invert order extens theorem paper hold stochast encod correct answer queri probabl determinist oracl special case singl prolog capit simplifi singl variabl omit brace simpli write variabl write simpli complex logic program obviou wai extend analysi accuraci function appli reward penalti queri permit penalti incorrectli identifi locat versu locat contrast task find answer find task find seek answer queri extens lead strictli gener underli task identifi optim remain remain gener sampl complex short section consid train sampl requir obtain inform identifi good high function space theori consid mention oe multiset specif queri pair correct answer train defin theori written jsj oe oe notic law larg number quantiti approach ts true accuraci sampl size grow larg probabl standard statist tool bound probabl function sampl size tool deriv theorem theorem class theori constant ffi theori largest empir accuraci upper ffl ln ffi sampl label drawn stationari probabl expect accuraci ffl optim theori opt equat opt ffl ffi mean polynomi number sampl suffici identifi theori probabl polynomi relev paramet notic true stirl polynomi size initi theori jtj variant claim true essenti class theori consid paper complex logic program set horn function map theori set theori set theori form theori set theori form ts set theori form ad set theori form delet exist map theori set set theori form appli sequenc note function size initi theori map theori set problem defin definit dp arbitrari dp pur pure theori dp imp impur theori dp proposit theori dp predic seek answer dp pc predic seek answer optim map theori set max ae maxim ae ae tabl definit notat comput complex basic challeng produc theori opt accuraci larg mention step obtain label sampl high true expect accuraci theori empir accuraci ffl opt section discuss comput challeng determin sampl consid class set theori form initi theori ts ad delet exist notic function map theori set theori summar tabl state task map definit complex logic program initi theori label train sampl set label accuraci theori jsj hq notic simplifi notat write approxim base train sampl special ffl dp requir seek perfect theori ffl dp pur pure impur dp imp ffl dp deal proposit predic dp subscript fact seek solut notic correspond impur queri form proposit system return restrict proposit dp pc seek answer queri combin obviou gener write dp result deal context dp special case dp find dp immedi impli dp class mention arbitrari number modif initi set includ theori form delet number includ empti theori form delet ts refer theori form delet similarli defin set theori form ad move move posit slight function size initi theori neg result hold small constant bound train theori correctli label train complex logic program queri space theori consid task involv ad resembl typic logic hard appli ad atom gener note comput implicitli requir comput express theori result assum effici comput true proposit horn theori atom main focu assum oracl constant time return order rule subsect consid challeng transform task intract trivial theorem dp dp proof main insight requir dp proof suggest shown equat hold view assign depend order show reduc arbitrari problem liter theori form copi rule shown equat set rule jth set conclud liter assign liter defin set insist liter entail appendix remain detail proof dp ab equat observ answer return queri depend variabl depend order order reduc defin disjunct add queri insist detail theorem mean np algorithm find order list impur proposit horn list pure predic calculu horn return correct answer return correct set queri restrict space theori deal theori form appli limit number rule individu move move singl rule recal set theori form appli sequenc individu move simpl complex logic program notic dg dg ag cg dg bg dg cg cg includ includ permut trivial test theori obviou problem observ constant dp dp problem solv polynomi time larger task theorem dp dp proof basic shown deal problem cover neg result show intract obviou space rule seek minim set produc perfect test initi theori label return correct theori form appli return perfect theori appli pair return perfect problem correspond immedi optim problem graph ei posit integ independ set size subset ae jsj node connect hs correspond obviou maxim definit maxim graph find largest independ subset similarli identifi problem maxim accuraci algorithm instanc initi theori label train sampl comput syntact complex logic program necessarili bs ratio instanc defin opt max optim solut theori opt maxim accuraci arbitrarili larg function bs perform iff instanc jxj size instanc defin number symbol number symbol function close algorithm return answer instanc collect algorithm return legal answer instanc natur algorithm perform close optim feasibl comput time function constant algorithm produc optim solut np expect obtain result bound constant function effici obtain solut factor good applic problem approxim defin definit maxim problem max iff fl max max fl jxj fl al prove theorem np maxim fl algorithm produc solut arbitrari problem fl number node graph result theorem np constant optim problem algorithm comput solut cost factor maxim theorem complex logic program jxj arbitrari result mean task approxim logarithm factor suffici small order mention theori order list order form theori note theori produc answer impur context set theori obtain reorder ts question sampl comput complex obtain note jt number theorem mean polynomi number sampl address comput complex theorem dp dp dp dp includ limit unlimit proof proof dp dp resembl proof theorem theorem observ reorder theori form effect entail deal dp dp replac pair singl includ atom order equat return simpli invert order equat reorder arbitrarili set answer determin answer queri basic transform proof theorem show theorem np complex logic program ad delet subsect deal ad delet impur context find answer impur find answer pure program state result standard pure theorem pure ffl dp solv polynomi time ffl pc trivial ae ae theorem consid pure seek answer impur seek pure maxim problem trivial worst factor impur task difficult oper add rule end theori predic calculu task remain theorem dp dp np dp function unbound number proof claim follow earlier theorem note delet theori includ entail found proof requir requir queri liter entail appendix worth note result hold ad atom ad ground symbol distinguish result ad arbitrari address sampl complex notic mean polynomi number sampl suffici make familiar polynomi size theori languag proposit case predic calculu potenti arbitrarili mean analysi appli complex logic program order order add delet rule ant rule rule pure trivial np trivial np impur np np np np pure np np pure np np np np dp problem find perfect theori max optim problem find theori gener np poli trivial find reorder effect trivial queri atom queri task mean approxim factor immedi simpler impur proposit tabl summari comput result neg result deal comput hard task involv simpler hold easi show claim appli task ad delet pure trivial determin form perfect theori ad delet proposit task impur case term find optim theori space ad task easili pure impur context proof isomorph contribut theori system deal set techniqu delet rule implicitli assum underli theori pure user seek answer reason violat theori user seek subset answer paper present addit type modif rule describ complex inher show polynomi number train sampl suffici acquir inform determin transform sequenc task complex logic program inform produc order rule order effici algorithm produc good approxim optimum reson earlier theori justifi standard approach theori illustr addit complex inher learn theori problem learn pure show task ad trivial approxim pure set result summar tabl proof appendix explicitli prove task trivial problem np theorem dp dp reduc canon task definit set fu variabl formula fc conjunct disjunct satisfi truth assign deal dp formula fc variabl fu theori fail hc correspond posit neg show theori opt accuraci opt iff satisfi assign matter concern rel posit order shown equat theori entail entail entail fu correspond immedi legal assign notic complex logic program result theori entail iff assign satisfi mean satisfi assign iff order answer mean order perfect proof dp replac simplifi special includ posit neg liter subset element form fu subset element form fu hc predic disjunct view true predic disjunct negat argument satisfi assign iff theori opt order accuraci opt theorem dp dp proof problem definit cover set jxj element collect subset exact cover subcollect element occur member complex logic program deal dp xc fail xc pair xc hx task obtain perfect theori rel order exact fc form perfect theori reorder vice versa notic jt xc mean suffici handl dp xc ij ij hx explain element member jcj set head predic disjunct argument answer return queri subqueri return atom move find perfect theori iff theorem np base theorem reduc maxim problem deal graph jej proposit complex logic program fail good bad bad hn deriv good bad subqueri hn deriv happen exchang order repres set liter notic good entail node independ set observ good queri contribut jn program accuraci score liter member score program jrj jn ffl algorithm ffl theori ffl return theori ffl accuraci factor ffl accuraci optim ffl ffl algorithm find approxim optim solut problem ei jn transform form theori queri optim solut maxim number independ correspond optim solut ht call accuraci algorithm produc theori accuraci satisfi perform ratio ij notic correspond feasibl solut node jej jn jn jn fl mean produc solut perform ratio jn fl polynomi time fl arbitrarili contradict theorem assum np proof resembl complex logic program graph form jej theori good bad jej bad io bad hn bodi bad includ bad io defin predic hold iff hold iff jn queri affect accuraci move rel includ remain deriv proper bind good answer bad jej queri simpl induct hn bind io return bind io return mean order set node mean independ set io variabl good queri bound correctli liter program accuraci score jrj correspond independ set accuraci score rest proof essenti ident theorem dp dp dp dp proof dp essenti proof dp observ reorder form effect entail proof dp similarli relat proof complex logic program dp chang entail dp replac pair singl includ atom shown equat notic answer return initi rest proof ident proof dp theorem proof dp proof theorem trick replac pair fc singl includ atom equat reorder liter answer theorem np show modifi theorem proof queri chang initi theori fail good bad bad hn invert order observ rule matter rule reorder obtain effect rule atom theorem appli transform proof theorem appli theorem show modifi theorem replac pair rule ad atom equat replai proof theorem replac notic due order atom order bad rule order lead answer involv move liter liter move liter notic chang produc bind includ return suffici insur bad jej return mean result theori complex logic program accuraci similarli move io posit return io mean result theori accuraci move liter case io bound io match bind lead case mention io bound bind answer theorem dp dp np deal simpl extens earlier theorem show dp dp theori theorem note delet effect move delet mean answer idea convert proof theorem show delet produc theori entail theori shown theorem notic delet effect move mention theorem prove dp monoton formula posit neg oe fu oe noi oe show set addit lead perfect theori iff oe satisfi assign assign satisfi theori form oe ad iff notic fu includ ji mean ji entail entail ji mean entail addit ad find perfect oe mean satisfi form set iff includ deal dp chang theorem theori replac atom notic end chang answer return queri atom form answer complex logic program reduct ar hn ar noi notic accuraci initi ar ar ar entail ar prevent ad system add fm hn view mean node select independ hold node includ set process add mean independ argument result theori accuraci score jrj jn correspond independ rest proof argument theorem matter atom dp deal theori ar jej hn bodi includ queri ar hn previou initi theori ar accuraci score entail answer jej return return prevent chang theori return ad complex logic program atom structur fact add end approach notic add hn answer jej lead accuraci rest proof proof refer carlo peter david makinson logic theori partial meet contract function journal symbol rajeev mario proof verif hard approxim problem francesco daniel difficulti learn logic program cut journal ai mark boddi thoma dean solv time depend plan problem technic brown boutili sequenc nest condit page gerhard brewka prefer extend logic framework default reason page august herman measur asymptot effici test hypothesi base sum observ annal mathemat william christoph mellish program prolog william cohen logic effici algorithm journal artifici intellig william cohen logic neg result journal artifici intellig william cohen prolog artifici complet approxim class inform investig theori knowledg base preliminari report page complex logic program pearl logic iter belief page thoma dietterich machin learn annual review comput william jean gallier linear time algorithm test satisfi proposit horn formula journal logic jon doyl ramesh patil knowledg languag taxonom util servic artifici russel determin logic program workshop comput learn eiter gottlob complex proposit knowledg base updat counterfactu artifici rick autom analysi base procedur semant page freund lehmann belief ration infer technic report hebrew friedman halpern belief critiqu peter gardenfor knowledg model dynam epistem state bradford mit michael garei david johnson comput guid theori freeman increment recompil knowledg page russel greiner find optim deriv strategi redund knowledg base artifici russel greiner complex theori russel greiner complex theori artifici benjamin grosof gener priorit page april approxim optim problem phd royal institut complex logic program alberto mendelzon differ updat knowledg base page april selli effici agnost lean page acm john paul allan newel subgoal automat gener learn goal hierarchi kluwer academ pat georg bharat russel greiner theori fault hierarchi intern workshop principl diagnosi hector levesqu foundat function approach knowledg artifici charl xf ling marco result comput complex refin certainti factor intern journal approxim charl xf ling marco refin uncertain rule base reduct intern journal approxim muggleton buntin machin invent order predic invert resolut page morgan sh muggleton induct logic program academ dirk ourston raymond moonei theori refin combin analyt empir method artifici jan elizabeth gibson practic guid knowledg acquisit pub vn vapnik estim depend base empir data david wilkin yong ma refin probabilist rule interact artifici jame michael pazzani methodolog evalu theori result ii page
ML/1401 6 regular oper support vector kernel alexand smola gmd germani bernhard sch fur germani abstract deriv correspond regular oper regular network hilbert schmidt kernel support vector machin prove green function regular oper suitabl support vector kernel regular properti show larg number radial basi function posit definit function support vector kernel introduct support vector machin pattern regress estim oper exploit idea transform high featur space perform linear algorithm evalu map hilbert schmidt kernel correspond dot product map data high denot map featur space map properti unknown gener rule kernel map high space good seemingli show kernel correspond regular oper link green function denot oper sake simplic discuss case regress hold true case mention start briefli review concept sv machin regular network section main result state method section show applic find sv machin section introduc class sv section conclud paper discuss support vector machin sv algorithm regress exploit idea comput linear function high featur space dot comput nonlinear function space input data function form order infer train set minim empir risk function complex term enforc flat featur minim reg cost function determin deviat target valu regular constant shown case cost ae yj ffl yj ffl minim solv quadrat program problem formul term dot product turn solut express term support ff ff ff kernel function comput dot product featur space concept introduc al coeffici ff found solv quadrat program problem ij ff fi fi minim fi fi ij fi fi subject fi fi fi fi note choic cost function result quadrat program problem fact quadrat part infin detail discuss note continu symmetr function admiss kernel satisfi mercer condit regular network start minim empir risk function regular term defin regular oper similar minim reg term symmetr function fulfil mercer ff cost function defin lead quadrat program problem similar comput wolf dual detail calcul ij denot dot product function hilbert ff fi fi fi fi solut minim fi fi ij fi fi subject fi fi fi fi set problem preserv sparsiti term potenti decomposit term fi fi gener diagon hand typic vanish method compar lead question condit method condit regular network lead decomposit coeffici differ suffici condit kd goal ffl regular oper find kernel sv machin enforc flat featur correspond minim regular risk function regular oper ffl hilbert schmidt kernel find regular oper sv machin kernel view regular network problem solv emploi concept green function function introduc context solv differenti equat suffici green function satisfi ffi ffi symbol ffi ij properti ffi requir project null space relationship kernel regular oper formal proposit proposit regular green function hilbert sv machin minim risk function regular oper substitut ffi yield pg pg symmetr satisfi sv optim problem regular network counterpart admiss posit written dot product hilbert pg exploit relationship comput green function regular oper infer regular oper kernel translat invari kernel specif regular oper written multipl fourier space pf pg denot fourier transform real nonneg converg uniformli small valu correspond strong attenu frequenc regular oper defin fourier space shown exploit green function satisfi translat show satisfi effici tool analyz sv kernel type capac control exhibit vapnik al build block sake case recal definit denot convolut indic function util result ident construct fourier regular oper multipl equal show odd order neg part fourier spectrum result amplif frequenc stem fact compact support kernel trade reduc comput complex calcul point kx limit neighborhood determin possibl perform regular oper complet remov frequenc class kernel gener fourier sin avoid tediou kernel correspond regular oper desir damp finit number frequenc leav frequenc unchang lead overfit figur interpol dirichlet kernel order observ overfit solid origin data connect interpol data gaussian kernel width oe exposit yuill dx oe laplacian gradient gaussian kernel exp kxk provid term fourier oe kxk multipl constant train sv machin gaussian rbf kernel correspond minim specif cost function regular oper type explain good perform sv machin mean obviou flat function high space correspond simpl function low show gaussian kernel tend yield good perform gener smooth assumpt consid addit knowledg data class support vector kernel follow line nelson point girosi al main statement posit definit function gener admiss sv kernel properti easier verifi mercer combin result connect complet monoton function function lead class sv kernel necessarili satisfi mercer condit definit posit definit continu function defin posit definit order distinct point scalar quadrat form nonneg provid polynomi lower proposit function admiss defin space polynomi lower function order gener admiss kernel sv space function orthogon set shown function gener dx dx provid project space polynomi lower defin dot product featur space sv kernel function order practic interest sv method detail kernel sv kx yk kx yk ln kx yk thin plate discuss point connect sv kernel regular oper implic hope deepen understand sv machin found exhibit high gener abil sec exampl translat regular framework provid insight kernel prefer capac control strength sv structur learn choic suitabl kernel disregard gener class admiss sv kernel provid mean kernel newli establish link regular theori tool construct structur consist set function sv machin perform structur risk minim treatment sv kernel reproduc kernel hilbert space context final leverag theoret result achiev regular oper understand sv vice theori serv bridg connect separ thread machin learn trivial connect bayesian interpret sv machin case choic special kernel regard prior hypothesi space subtl reason understand capac bound regular network point view futur work includ analysi famili polynomi perform pattern classif acknowledg support grant dfg ja bs support de author chri leo van muller vladimir vapnik discuss comment refer theoret foundat potenti function method pattern recognit learn autom remot interpol approxim radial relat function ck ll dj approxim page academ girosi approxim support vector machin ai memo poggio stabil basi regular tensor addit spline ai memo wr sa nelson multivari interpol posit definit function ii mathemat interpol scatter distanc matric posit definit function construct ij metric space complet monoton function ann vapnik extract support data task fayyad proc kdd menlo aaai press vapnik compar support vector machin gaussian kernel radial basi function classifi ieee tran sign smola scholkopf method pattern approxim oper gmd technic report vapnik natur statist learn theori springer smola support vector method function regress signal process nip san yuill motion coher theori intern confer comput page ieee comput societi press
HCI/1402 4 mine data stream pedro domingo dept comput scienc engin washington box wa usa dept comput scienc engin washington box wa usa abstract organ todai larg grow limit rate million record dai mine continu data stream bring uniqu challeng paper describ evalu anytim system build tree constant memori constant time incorpor ten thousand exampl hardwar bound output asymptot ident convent learner studi properti demonstr util extens set experi synthet data appli mine continu stream web access data washington main campu categori subject descriptor data mine concept learn design methodolog design evalu gener term increment subsampl introduct knowledg discoveri system constrain main limit memori sampl size tradit applic machin learn sampl size domin comput resourc massiv search carri search small sampl lead overfit overfit avoid main fraction comput power data mine bottleneck time exampl typic imposs current kdd system make comput resourc exampl data model complex phenomena inappropri simpl model produc unabl full advantag data develop highli algorithm prioriti algorithm concentr make mine fit main memori requir sequenti scan disk algorithm test million exampl applic dai worth data dai retail chain record million telecommun compani connect million larg bank process million atm credit card popular web site log million hit internet continu ubiquit comput expect data volum rule except current data mine system equip cope exampl arriv higher rate quantiti data grow bound time progress simpli preserv exampl futur problem tertiari easili lost relev contextu inform longer sourc exampl data notion mine fix size question kdd system oper continu incorpor exampl lose potenti valuabl inform desiderata fulfil increment learn method success sequenti substanti literatur exist algorithm type shortcom kdd point view model learn similar obtain learn data batch mode highli sensit potenti recov unfavor set earli exampl produc model batch high cost point slower batch algorithm paper learn method overcom tree learn constant time time proport number ident tree convent batch learner exampl probabl convent tree learner test node exponenti number exampl describ evalu learn system base tree bound mine exampl time input disk store exampl part main requir space proport size tree statist learn requir exampl onlin stream store anytim algorithm model time exampl qualiti smoothli time section introduc tree studi properti describ system empir evalu paper conclud discuss relat futur work hoeffd tree classif problem gener defin set train exampl form discret class label vector symbol numer goal produc exampl model predict class futur exampl high accuraci descript client recent send custom catalog record fraudul classif method tree learn learner type induc model form node test branch node correspond outcom leaf class predict label dt obtain pass root test attribut node branch attribut tree learn replac leav test start root attribut test node chosen compar attribut heurist measur classic tree learner cart assum train exampl store simultan main sever limit number exampl learn tree learner sprint assum exampl store learn repeatedli read sequenti level greatli size usabl train prohibit learn complex tree tree fail dataset larg fit disk space goal design tree learner extrem larg dataset learner requir read small constant time process make directli mine onlin data sourc store build potenti complex tree accept comput cost achiev note catlett order find attribut test small subset train exampl pass node stream root root attribut exampl pass leav attribut solv problem decid exampl node statist result bound addit random variabl rang probabl rang inform gain rang log number made independ observ comput bound state probabl true variabl bound attract properti independ probabl distribut gener observ price gener bound conserv observ reach heurist measur test attribut measur inform gain gini index goal ensur high attribut chosen exampl small chosen infinit exampl assum xa attribut highest observ attribut observ heurist valu desir bound xa correct choic probabl exampl node assum exampl gener stationari stochast process distribut chang exampl read assum random order creat random index sort paper assum lower attribut smaller gain probabl true choic neglig plan lift assumpt futur work attribut node assum simpli involv correct serv bound true probabl xa attribut probabl valid long node view averag valu exampl case measur typic node accumul exampl stream smaller monoton function point node split current exampl pass leav lead tree shown tabl count ijk statist comput heurist quantiti similarli maintain carri node attribut consist split node split made confid split found split shown discret extens numer usual method test form ij comput threshold ij sequenc exampl case procedur point time parallel procedur current tree ht make class predict number maximum number valu number tree algorithm requir memori store count leaf number leav total memori requir independ number exampl size tree depend concept independ size train set common assumpt analysi relat fail practic section describ refin algorithm cope kei properti tree algorithm realist assumpt tree produc asymptot arbitrarili close produc batch learner learner exampl test increment natur tree algorithm significantli qualiti tree produc order make statement defin notion disagr tree probabl attribut vector indic return argument true definit disagr tree probabl produc class predict intern node leav class intern node tabl tree algorithm sequenc set discret split evalu minu desir probabl correct attribut node ht tree procedur ht tree singl leaf obtain predict frequent class class yk ij attribut ijk yk sort leaf ht ij increment ijk label major class exampl exampl comput attribut count ijk xa attribut highest attribut comput equat xa replac intern node split xa branch split add leaf xm gm obtain predict frequent class class yk ij attribut xm ijk return ht leaf path tree length node definit disagr tree probabl path path path path tree dt tree indistinguish pass sequenc receiv ident class predict disagr stronger notion probabl reach level tree fall leaf level assum probabl term leaf probabl realist typic approxim true tree gener practic ht tree produc tree algorithm desir probabl infinit sequenc exampl asymptot batch tree induc node attribut true greatest infinit exampl expect infinit train sequenc state result theorem ht tree produc tree algorithm desir probabl infinit exampl asymptot batch leaf proof refer disagr simpli disagr fall leaf level ht leaf level xs path ht level node level ht similarli xs path leaf class similarli repres proposit includ level true notic includ path length tree leaf intern node omit depend node ht tree gener train sequenc averag infinit train sequenc probabl path ht path set exampl fall leaf level equat probabl exampl path ht path length sum probabl fall leaf level equal leaf probabl complet demonstr theorem corollari theorem expect disagr ht asymptot case bound corollari proof omit interest exist asymptot batch tree expect disagr tree learn finit data small tree learn finit data similar asymptot batch tree applic theorem user input hoe tree algorithm maximum expect disagr exampl tree settl intuit understand work algorithm bound algorithm estim easili obtain run convent tree learner manag subset data practic attribut equat ensur requir ensur requir addit exampl exponenti improv expect obtain linear number exampl small leaf probabl larg good agreement obtain small number exampl node expect disagr exampl node number exampl disagr system implement learn system base tree call fast tree inform gain gini index attribut evalu measur includ number refin algorithm tabl ti attribut similar potenti exampl requir decid high confid case make differ attribut chosen option decid tie split current attribut threshold comput part time cost recomput recomput split made specif point user minimum number exampl accumul leaf recomput effect reduc global time spent comput factor make learn fast simpli classifi train exampl implement smaller exampl accumul strict minimum requir correct attribut confid time requir build experi show net larg shrink exponenti fast number input correspondingli larger target memori long process exampl faster case demand sole obstacl learn arbitrarili complex model finit ram memori domin memori requir count grow leav maximum memori deactiv leav order make room probabl arbitrari fall leaf observ error rate upper bound error reduct achiev refin leaf leaf estim count parent attribut leav consid lowest valu leaf memori singl number requir track leaf reactiv activ leav accomplish regular scan activ inact replac activ leav inact domin poor attribut memori usag minim drop earli attribut attribut greater attribut drop memori store count freed initi initi tree produc convent learner small subset data tree input node accept number exampl give reach accuraci smaller number exampl learn curv exampl option activ data arriv slowli time dataset finit small feasibl scan multipl time mean grow smaller potenti tree algorithm section describ empir studi util refin evalu empir studi synthet data system learn accur tree convent similar comput resourc advantag exampl convent system abil process section test empir compar seri synthet dataset freeli vari relev paramet learn process order ensur fair restrict system amount ram set paramet give maximum number exampl fit memori inform gain function fourteen concept class binari attribut concept creat randomli gener tree level fraction node replac rest split random attribut path root node tree reach depth remain grow node replac leav leaf randomli assign class size result concept rang leav leav median stream train exampl grew slightli limit enforc memori size unprun tree gener sampl uniformli instanc assign class target tree ad level class attribut train level mean probabl reassign equal probabl includ origin separ exampl test run default set ran experi pentium pentium pentium mhz run linux figur show accuraci learner averag run run leaf bootstrap version tree produc accur accuraci system similar rang exampl point unabl advantag exampl greatli improv accuraci earli advantag fact exampl make multipl level tree initi achiev high accuraci quickli perform accuraci higher exampl explan experi report figur catlett reduc overfit noisi domain figur show averag number node tree induc learner notic induc tree similar number achiev greater accuraci fewer node suggest substanti tree induc rel suggest prone overfit noisi data figur show algorithm respond compar run concept level ad train exampl accuraci report train set train set million exampl advantag compar level evid bound prune method exact concept form set paramet basi lesion studi report exampl figur accuraci function number train exampl node exampl figur tree size function number train exampl figur accuraci function level figur show algorithm compar concept vari size train set result learn million version concept size consid contrari concept size rel benefit remain approxim constant find million exampl induc tree approxim node size underli concept suggest good advantag train exampl carri run write train exampl disk gener fly pass directli time comparison measur time read exampl data set disk pentium mhz machin read million process learn time order magnitud input time read process gener million exampl concept figur compar data set make progress entir data begin asymptot million final million exampl contribut accuraci process exampl induc leav futur plan carri similar run complex concept billion exampl lesion studi conduct seri lesion studi evalu compon paramet system figur show accuraci learner data set show slight modif tree produc version run leaf addit data significantli improv accuraci set initi make progress eventu overcom poor made leav remaind lesion studi run data set leaf evalu disabl make split identifi clear winner concept turn atyp includ graph avoid obscur trend observ accuraci concept concept size figur accuraci function complex true concept exampl figur train million exampl exampl figur initi conduct hold paramet constant run split tie ti induc tree node compar node accuraci ti ti produc node compar node accuraci ti carri run hold paramet constant number exampl node gs recomput run recomput exampl comput gain accuraci time longer run lost accuraci time longer learner induc node frequent comput carri run hold paramet memori limit constant run mb mb induc node addit improv accuraci carri run hold paramet constant run delta delta lower induc fewer node higher accuraci higher accuraci higher lower web data appli mine stream web page request eman washington main campu natur data detail experi anonym trace extern web access made campu activ client trace entir popul estim peopl faculti trace million arriv peak rate minut size compress trace file gb request tag anonym organ id associ request organ data improv web cach kei predict accur host page request recent request appli learn problem manner split request log seri equal time slice experi time slice hour organ host log maintain count time organ access host time discret count repres time slice host access time slice gener attribut mod log doubl log approxim gb compress exampl figur perform web data class request time slice carri real time modest resourc statist current time slice count host time slice output exampl complet procedur obtain dataset million label common class host time test carri exampl dai run run carri mhz pentium machin tree obtain accuraci data pass train data initi major time spent read data disk bootstrap run learn subsampl exampl fit mb achiev accuraci learn faster million exampl machin gb ram run entir million train run hour result tree accur figur show perform gb ram extend run million exampl axi show number exampl present bootstrap phase complet accuraci improv steadili exampl achiev accuraci similar small fraction time memori requir batch natur scale trace larger easili incorpor data indefinit step appli predict page request host plan address issu relat behavior set run learn dictat data stream relat work previou work mine larg subsampl method includ catlett heurist method extend batch learner dataset hundr thousand exampl catlett russel test implement theoret model size subsampl compar attribut maron moor bound speed select regress model gratch sequenti statist method minim number exampl split tree similar batch tree looser deriv test repeatedli sampl small gehrk al boat learn approxim tree refin scan full provost al studi strategi mine larger larger subsampl accuraci asymptot contrast system learn main memori system sprint concentr optim access disk read exampl attribut sequenti combin access data sequenti subsampl potenti requir scale larger method addit advantag increment exampl quickli incorpor usabl model exampl progress refin mention larg literatur increment space limit preclud review system close relat learn tree batch restructur learn time linear number exponenti number attribut problem test slower viabl learn data stream number increment algorithm kdd task learn recent year cluster associ rule mine substanti theoret literatur onlin algorithm exist weak learner linear prove strong tree futur work plan shortli compar outperform fulli learn scan requir multipl domin compon cost time requir read exampl disk multipl time speed anytim charact make ideal interact data plan studi applic context direct futur work develop applic web log studi applic numer attribut studi optim comput recomput gs current bound adapt studi cach main memori speed induct exampl multipl compar increment adapt learn evolv concept adapt learn class asymmetr misclassif adapt extrem case final tree store fit main parallel appli idea type learn rule paper introduc method learn onlin data stream increasingli common tree learn small constant time strong high asymptot similar batch tree data mine system base tree empir studi show advantag massiv number exampl applic stream web log data acknowledg research partli fund nsf career award author refer stone classif regress tree catlett machin learn larg phd depart comput dietterich overfit machin learn comput xu increment cluster mine data wareh environ intern confer larg data page morgan kaufmann loh optimist tree construct acm sigmod intern confer manag page acm press gratch sequenti induct learn thirteenth nation confer artifici page aaai press probabl inequ sum bound random variabl journal american statist littleston learn quickli irrelev attribut algorithm machin maron moor model select search classif function approxim advanc neural inform process system morgan san rissanen fast scalabl classifi data mine intern confer extend page springer jr simultan statist infer moor lee algorithm minim cross valid error eleventh intern confer machin page morgan kaufmann russel theoret subsampl induct larg tenth intern confer machin page morgan kaufmann oat progress sampl acm sigkdd intern confer knowledg discoveri data page san acm press quinlan program machin learn morgan san quinlan layer search empir learn fourteenth intern joint confer artifici page morgan kaufmann mehta scalabl parallel classifi data mine intern confer larg page morgan kaufmann smyth wolpert anytim exploratori data analysi massiv data set intern confer knowledg discoveri data page newport aaai press toivonen sampl larg associ rule intern confer larg data page morgan kaufmann increment induct tree machin improv algorithm increment induct tree eleventh intern confer machin page morgan kaufmann webb admiss algorithm unord search journal artifici intellig levi analysi share cach usenix confer internet technolog page
ML/1403 6 hybrid architectur situat learn reactiv sequenti make ron sun todd peterson edward merril alabama al abbrevi hybrid learn januari abstract develop autonom procedur ignor explicit declar knowledg develop symbol reason declar ignor procedur knowledg develop learn model hybrid connectionist model consist distribut base approach sun learn util procedur declar tap synergi type enabl agent learn situat context gener result knowledg scenario unifi symbol learn synergist perform learn summari paper present version architectur result experi kei hybrid sequenti neural reinforc learn cognit model introduct present hybrid connectionist model unifi reinforc learn integr coher architectur model stand connectionist learn adapt rule induct summari motiv develop summar discuss advantag model focu reactiv sequenti involv select perform sequenc action accomplish object basi perceptu inform term agent set select finit set action perform time step discret continu select base current state world world present sensori state vector piec inform correl world autonom result action agent world present agent sequenc state point agent receiv payoff reinforc action perform prior current state agent perform credit assign attribut action point time tempor credit assign sutton barto accord aspect state structur credit assign gener teacher input agent start priori knowledg involv learn navig mine figur schultz agent target reach agent target mine destroi agent contact agent local sensori inform rudimentari vision small section space front agent reach target limit amount time learn navig maze figur sun peterson agent start cell maze navig reach destin cell limit sensori input consist local inform adjac cell agent knowledg actual current locat previou locat move turn left turn base current input perform kind agent time sequenti essenti human intellig behavior work area rang instrument condit cognit skill acquisit demonstr sutton barto vanlehn obstacl agent target figur navig figur run maze made fraction fall allen newel cognit process minut hour ai deal rosenbloom al agent sever limit memor analyz previou episod detail imposs form episod memori perceptu abil agent limit local inform learn task agent develop rule tent wait end episod make start learn point al human learn concurr true type task goal explicit priori agent impli receiv pursu agent maxim payoff agent maxim averag total maxim characterist world stationari viewpoint learn agent world nonstationari world chang knowledg learn agent substanti world se uncertain evolv agent learn cope region world exhibit characterist requir concept time kubat preselect set instanc close world provid fix view world knowledg structur agent view experienc wai knowledg agent experi world nonstationari learn base lack clear steadi criterion learn payoff receiv agent decid make agent intern limit memori intern state set reset action agent ballard formal view intern state relat action indistinguish extern view simpli part world case multipl agent present individu exist agent view part extern world action agent result chang world simpli view autonom occur extern world handl clear constitut sequenc long resourc limit prevent rememb sequenc agent assign basi constantli chang learn criterion move learn process nonstationari acquir specif skill exist method chief tempor differ method type reinforc learn learn exploit differ evalu action success step handl sequenc increment fashion approach appli learn navig robot control mahadevan connel lin kaelbl al dietterich genet algorithm al tackl kind task schultz handl tempor credit assign problem world distinguish procedur declar knowledg term learn declar knowledg rule characterist task render exist algorithm requir exemplar set quinlan increment consist instanc fisher utgoff complex manipul learn structur inconsist discov typic complex limit time reactiv agent hirsh analyz inconsist consid learn algorithm clark niblett involv time lead radic learn knowledg requir extra dedic mechan kubat rule learn algorithm handl learn sequenc necessarili involv tempor credit assign remaind highlight hybrid type task section discuss briefli set experi demonstr advantag model compar model conclud remark end paper algorithm base explicit gradual accommod hybrid model discuss subsect motiv model publish sun peterson subsect discuss detail involv rule learn algorithm publish algorithm model sun peterson procedur declar knowledg agent develop set skill highli specif highli effici acquir suffici gener knowledg readili appli varieti situat commun human possess abil achiev balanc exist system fall short miss dualiti coexist procedur declar knowledg specif skill gener great deal work demonstr differ procedur knowledg declar anderson anderson lebier keil damasio al sun believ balanc essenti develop complex cognit agent base line argument ampl psycholog data support distinct procedur declar knowledg anderson initi distinct declar procedur knowledg base fitt posner keil sun subsequ made similar point base psycholog data philosoph argument make distinct achiev balanc distinct analyt intuit smolenski distinct conceptu distinct consciou jame sun inadequaci system ignor point deal full rang complex intellig behavior lend addit support argument declar knowledg advantag make learn agent fact procedur skill effici easier learn note aim captur dichotomi denot dichotomi serv justif main distinct declar knowledg procedur skill ffl guid explor reduc time number develop specif skill situat transfer learn skill shown psycholog al ffl speed learn properli declar knowledg extract skill learn facilit learn process ffl declar knowledg commun learn knowledg skill agent declar knowledg easili constitut conceptu knowledg base agent procedur specif conceptu access gener lack perform procedur detail skill gener inaccess introspect acknowledg lead includ anderson newel constitut knowledg base agent consist framework sun level hybrid model provid framework repres type knowledg architectur hendler gelfand al schneider oliv sun erickson discuss level detail base idea sun exist evid show differ level li captur procedur term prefer subsymbol distribut provid backpropag network implicit natur procedur skill distribut natur captur properti procedur skill unit capabl accomplish task gener uninterpret symbol artifici assum similar access distinct arbitrari media cf anderson rosenbloom al term reinforc learn tempor differ handl sequenti sutton kaelbl al reactiv sequenti situat uniqu correct action roughli equal learn procedur applic good action bad measur good action signal adopt reinforc learn paradigm adjust made paramet chanc select action lead posit reinforc reduc chanc select action lead neg reinforc captur declar term prefer symbol unit clear conceptu mean declar knowledg highli access infer perform explicitli conceptu level sun reactiv natur symbol simpl focu proposit rule number wai symbol point learn algorithm increment assum stationari world suitabl algorithm suitabl relat cognit phenomena develop suitabl algorithm mean learn algorithm make level network train reinforc learn capabl specif procedur complet separ learn mechan top level extract inform form rule dynam acquir rule modifi rule subsequ encount human learn true rule learn specif discuss al al outlin model desiderata lead similar model develop sun specif design reactiv sequenti make consist bottom level procedur knowledg top level declar knowledg form proposit rule algorithm describ oper observ current state framework learn procedur skill serv dual comput bottom level action find action top base input rule place compar valu action perform action observ state reinforc updat bottom level accord updat rule network back step describ detail version determinist rule learn simplest version illustr basic idea architectur sun peterson detail statist rule learn bottom level evalu action desir action state consist sensori action base acquir standard algorithm tempor differ reinforc learn algorithm determin detail watkin recent develop bertseka tsitsikli kaelbl al parr russel dietterich precup al algorithm implement backpropag neural network tesauro boyan moor appendix review implement bottom level learn process perform approxim structur credit assign agent element state assign tempor credit assign agent action lead success failur term reinforc combin backpropag enabl develop procedur knowledg sole base agent explor world requir extern teacher priori knowledg explan work bottom previou sun peterson lookup tabl implement question continu input space result huge state space top level declar knowledg captur simpl proposit rule accord previou directli symbol rule facilit correspond bottom level encourag uniform chose connectionist model connect node repres condit rule node repres translat structur set rule structur network sun fu towel shavlik detail appendix quick discuss rule learn algorithm differ characterist concurr lack teacher input priori requisit basic idea algorithm action decid bottom level success success number detail agent extract rule correspond action select bottom level add rule rule network subsequ interact agent verifi extract rule outcom appli outcom rule made specif current outcom agent gener rule make special gener base encount search minim present convei model rule extract perform rule extract state action state enter action reinforc receiv action rule condit action condit made conjunct individu condit refer element input state criteria rule learn direct reinforc receiv tempor differ updat maximum state criterion indic action state directli fail account sequenc action criterion improv criterion concern action close phase criteria test phase direct reinforc phase tempor differ phase maximum max figur phase rule extract threshold paramet maximum indic optim action adopt phase number episod criteria appli respect phase figur criterion list phase test appli criterion determin construct rule rule wire rule network rule rule algorithm reexamin rule match current step decid discard number oper ffl rule successfulli appli criterion current rang condit expand interv gener expand condit rule time result rule condit expand full rang effect condit drop rule similar michalski al tempor abstract dietterich precup al ffl rule lead unsuccess result judg criterion current reduc rang condit michalski al mccallum select condit select base recenc perform shrink oper rule time creat shrunk rule phase transit automat determin base current perform level model interv condit determin granular condit binari reach full rang ffl remov rule rule network counter origin set rule extract encount ffl condit rule close rule combin gener rule produc requir condit rule overlap ident rang combin rang pair condit origin rule cover union origin rule rule learn formal find gener rule exist process tent heurist rule test happen combin step make final action incorpor outcom level justifi shown al declar knowledg influenc procedur oper reli top reli bottom combin outcom level weigh differ oper mode roughli correspond folk psycholog notion intuit delib mixtur percentag method combin outcom level stochast combin valu action level weight top level action activ rule bottom level activ final outcom stochast make boltzmann distribut weight perform select action action al psycholog justif combin model put level implement connectionist model figur rule level reactiv level figur detail architectur contrast characterist level top level rigor verifi random learn fashion bottom level statist natur rigor random learn gradual cumul fashion complement note gener rule complement gener bottom bottom level gener rule gener top level captur kind regular possess level learn combin stochast result improv perform freund necess architectur sum ffl bottom agent repres procedur skill suffici skill involv uncertain knowledg autonom stochast explor numer calcul probabilist captur simpler mechan anderson ffl learn bottom agent learn dynam acquir procedur skill bottom level brook rule top level current bottom level captur gradual learn rule learn ffl top agent repres easili crisp knowledg explicitli access commun knowledg agent explan absent sutton brook tadep dietterich situat encount certainti declar knowledg prefer explicit access explan import facilit cooper agent ffl rule agent acquir quickli dynam declar knowledg top resort extern declar knowledg ffl rule rule perform bottom level significantli analyz earlier shown experi sketch experi sketch set perform advantag model addit mention cognit valid import highlight empir result summari paper experi publish experi navig test simul navig task shown figur develop naval research task complex realist al agent navig underwat vessel reach target locat agent receiv inform number instrument shown figur sonar gaug show close mine equal area rang left agent fuel gaug show time left fuel run bear gaug show direct target present direct agent rang gaug show target current locat base agent decid turn fast move allot time reach target hit mine run fuel failur agent sever time reactiv make random environ gener repetit experi agent experi learn difficult agent account vari environ reinforc agent produc base success agent end episod peterson figur navig input displai upper left corner fuel vertic upper corner rang round middl bear sonar gaug bottom learn speed number case mine randomli start point agent target target locat randomli select time time allot agent episod step figur show differ bottom level pure term learn measur number success episod total episod train refer stochast combin level rule weight symbol gen oper omit show perform method combin level make differ vari temperatur paramet stochast examin learn consist mine superior bottom level statist case case temperatur transfer transfer defin perform improv agent test set rel agent similar assess train model episod randomli gener appli model mine mine figur number success episod figur percentag success episod set consist mine figur show differ transfer measur percentag success episod set train model train model appli total data averag outperform bottom level transfer differ bottom level statist match human data match perform model perform human subject test result publish detail human experi found sun al train condit human ffl standard train condit subject receiv block episod consecut dai episod episod mine perform agent lot relev shown block block human figur learn curv term success rate standard condit side human data left side model data ffl verbal train condit condit ident standard train condit subject step slow replai select episod verbal episod ffl transfer condit condit ident standard train condit subject perform task mine dai train switch mine start dai result experi ffl standard train condit averag data human subject averag model run correspond human experi model run initi random number sequenc produc data present figur set data fit power function failur similar evid pearson product moment correl coeffici calcul analysi yield high posit correl indic high similar human subject model run initi segment ffl verbal train condit requir verbal model posit effect verbal learn previou step episod addit factor episod memori playback attempt captur effect data human subject compar model run figur set data highli similar fit power episod memori playback involv train model perform episod block actual trial episod manner human experi block block human figur learn curv term success rate verbal condit block block human figur transfer data term success rate function calcul pearson product moment correl yield high posit correl compar perform due verbal human subject model run averag failur rate block separ human subject model run subject data anova result group exhibit perform due verbal due verbal group significantli ffl transfer condit subject train transfer model test condit human model data averag subject compar human model data figur notic learn human data slightli transfer exhibit drop model exhibit deeper drop comparison sun al cognit valid reason interpret data uniqu prove compar perform block chang mine densiti block chang success rate human subject model run drop statist experi experi architectur publish journal articl repeat sun peterson detail experi altern version architectur statist rule learn sun peterson detail comput experi maze domain result demonstr perform advantag architectur discuss experi verifi predict earlier predict section receiv empir support shown sun peterson rule learn speed learn shown rule learn improv train perform shown sun peterson rule learn facilit transfer shown learn rule transfer system sun peterson result serv exist proof necess model concept format symbol reason learn form concept distribut bottom level rule separ node set top level repres condit connect featur induc form kind conceptu basic prototyp model rosch node serv identif code direct node serv trigger relev featur direct concept brought attent facilit inherit reason base featur concept form form regard task hand exploit regular concept form part learn accomplish task environ task context experi agent determin featur environ kind object group constitut separ categori object acquir concept function combin learn reason martinez rule form rule action form constitut schema waltz form easili incorpor experi simpl addit power oper tradit backward chain counterfactu perform oper speed learn provid explan facilit commun agent gener discuss situat cognit deal reactiv sequenti task consist situat cognit cope world mean act driven fashion deal approach embodi work reflect view focu react current state world line situat cognit learn work ti close specif situat learn reflect exploit regular obviou differ situat cognit view claim elabor model world elabor view avoid rule show declar knowledg construct basi situat learn situat cognit unifi contradictori view process rule learn ai learn tackl task differ dealt tradit rule learn algorithm learn algorithm aq michalski quinlan requir consist data requir agent obtain data learn mean higher space slow start extra appli directli sequenti task perform tempor credit assign increment varieti learn version space algorithm mitchel utgoff requir consist descript instanc handl sequenc rule learn algorithm avoid problem sequenc evalu valu state action static static evalu assum lot priori knowledg task part agent natur learn problem assum minimum priori knowledg agent learn fisher stepp michalski unsuit type task feedback direct bar static evalu feedback order achiev complet descript instanc system base tempor credit assign recent martinez shen incorpor reason learn strive learn reason insepar cognit demonstr reason interact close concept learn rip show categor reli similar reason rule system util principl dichotomi process connectionist rule extract fu algorithm extract conjunct rule perceptron network find learner search combin posit condit lead found combin posit learner search neg condit ad case learner extract separ set integr substitut towel shavlik rule altern true believ rule express close resembl comput connectionist order avoid combinatori discern structur procedur extract group similarli weight link elimin form rule remain group rule extract algorithm meant appli end train network rule modif rule train network agent extract modifi rule dynam connectionist reinforc learn rule learn work util synergi algorithm improv learn dynam extract modifi rule agent adapt chang addit remov rule time recent work rule collect andrew hybrid model turn form model hybrid model reactiv rule popular model includ hendler gelfand al schneider oliv miikkulainen dyer sun gordon subramanian johnson al object claim research frustrat lack consist conceptu hybrid consist principl cognit architectur base theori dichotomi conceptu experi report perform advantag combin declar learn procedur learn adopt multipl learn method hybrid model dub sink insist present model mere unifi learn method integr synergi explor view extens rule learn distinct exist algorithm specif design hybrid connectionist model implement type knowledg kind connectionist network barnden sun implement knowledg miikkulainen dyer schneider oliv hinton touretzki gile gori implement knowledg distribut network sun gelfand al erickson johnson al attempt develop principl dichotomi conceptu architectur model incorpor tend simpli side dichotomi attempt explor synergi exist hybrid model perform barnden gat sun complex sophist perform learn batch miikkulainen dyer erickson learn task difficult perform learn schneider gelfand al cognit plausibl ecolog realist regard al al capabl integr learn develop connectionist symbol side unlik exist model exist learn model explor learn advic extern declar knowledg turn procedur knowledg gelfand al anderson anderson lebier oliv schneider maclin shavlik explor demonstr knowledg emerg interact world mediat procedur knowledg cognit model major differ cognit architectur fact util combin process exploit synergi acquir autonom explor extern requir larg amount priori knowledg begin sharp contrast cognit architectur act anderson lebier soar al develop architectur attempt implement constructivist view child develop learn mechan base statist collect interact world schema creat condit identifi tune statist mean base relev build abstract primit action model make distinct procedur declar knowledg account distinct implicit explicit learn al process differ level resembl psycholog model differ strategi tabl lookup al explain differ explicit implicit differ algorithm instanc retriev logan account differ initi trial skill perform skill differ mental experi stanlei al relat differ explicit verbal implicit skill type dichotomi slower effortless automat differ applic model varieti cognit process appli previou cognit model sun relat discuss sun crucial link model knowledg distinct human psycholog work implicit learn stanlei al al work show dissoci consciou unconsci learn human acquisit partial complet unconsci connect data model laid abil model account import characterist human sun model explain account phenomena psycholog literatur term level model mechan model readili accommod import featur exist model sun extens order explor perform experi varieti complex domain task locat inform make difficult extract gener order extend transfer abil task sensori inform learn space task environ noisi probabl distribut time investig concept format agent task develop concept automat pertin benefici task hand explor task environ varieti learn techniqu explor interplai learn techniqu extens incorpor addit accept extern advic assimil intern anderson lebier gordon subramanian implement varieti intuit process bottom constraint satisfact reason categor hybrid architectur learn develop subsymbol symbol learn develop procedur skill declar explor world util principl learn perform transfer effect model neglect dichotomi experi task demonstr aspect potenti advantag experi navig domain suggest combin type knowledg yield synergist result match human skill learn data extent match demonstr cognit valid architectur extent account human data critic select action state figur method appendix bottom level estim maximum discount cumul reinforc agent receiv current state fl fl discount factor favor reinforc receiv sooner rel receiv reinforc receiv step updat base minim fl discount result max updat base tempor differ evalu current state action chosen success updat agent learn account futur step longer longer sequenc notabl explicit plan implement chose network figur layer form backpropag network comput fourth layer perform stochast make network intern subsymbol decid earlier output layer output layer backpropag action individu node fourth layer determin probabilist action perform base boltzmann distribut ff control random process action cumul reinforc receiv action estim cumul reinforc agent action differ tempor differ evalu enabl learn approxim cumul reinforc train backpropag network base minim err index output node repres action backpropag procedur appli usual adjust weight lookup tabl implement question continu input space result huge state space navig task kind function approxim gener state lin mahadevan connel tesauro result converg learn rule encod number previou rule encod connectionist network sun fu towel shavlik draw set link connect concept condit rule rule number incom link rule equal number condit rule concept condit posit link carri posit weight carri neg weight sigmoid function node activ obviou function threshold node set number incom link number condit lead repres select make node activ condit activ condit met consid activ consid rule rule lead intermedi node creat concept condit rule link intermedi intermedi node link node repres complex rule form includ predic rule variabl sun work support part offic naval research grant univeristi alabama helen susan dave jack jeff subramanian comment discuss diana jim alan schultz provid navig simul franz suggest structur summari paper anonym review refer agr plan ed design autonom agent york acquisit cognit skill psycholog review architectur harvard ma rule mind lawrenc erlbaum associ nj anderson atom compon lawrenc erlbaum nj andrew workshop rule extract train artifici neural network nip foundat free encod connectionist data confer cognit scienc lawrenc erlbaum nj learn sequenti gabriel moor learn comput neurosci mit press ma bertseka program athena ma boyan gener reinforc safe approxim fu neural inform process mit ma bag predictor machin implicit explicit knowledg control complex system british journal psycholog intellig artifici intellig clark induct algorithm machin learn damasio neural region knowledg access cold spring harbor symp quantit press hierarch reinforc learn maxq function decomposit peopl discov manuscript mind mit press ma mind free ny erickson rule categori learn manuscript knowledg acquisit increment conceptu cluster machin learn fitt human perform ca freund experi boost algorithm proc morgan san ca lm rule learn search adapt integr plan react heterogen architectur morgan san ca integr system neural network robot skill morgan san ca gile adapt process sequenc data lectur note artifici springer verlag integr framework learn reason journal artifici intellig research user guid navig avoid task naval research lab dc gordon multistrategi learn scheme agent knowledg acquisit informatica gordon cognit model learn navig proc cognit scienc lawrenc nj evolut strategi multiag environ adapt behavior marker pass morgan san ca gener version space machin thagard theori learn mit ma principl psycholog york hybrid learn model abduct integr sun lawrenc erlbaum nj reinforc survei journal artifici intellig cognit develop mit press ma connectionist model categori learn psycholog review rc expert paradigmat technolog mind machin vol experi increment concept machin learn brain mechan emot emot learn current opinion neurobiolog reactiv agent base reinforc teach machin learn instanc theori automat psycholog review maclin incorpor advic agent learn reinforc morgan san ca mahadevan connel automat program robot reinforc learn learn select attent memori task proc confer simul adapt behavior mit ma constraint prefer induct studi human machin perform cognit scienc increment approach develop intellig neural network control robot adapt behavior theori methodolog induct learn artifici intellig increment learn system morgan kaufmann san ca miikkulainen natur languag process modular pdp network distribut lexicon cognit scienc gener search artifici model classif learn psycholog review parr reinforc learn hierarchi machin advanc neural inform process system mit ma model temporari abstract plan advanc neural inform process system mit ma induct learn tree machin learn learn logic definit relat machin learn implicit learn tacit knowledg journal gener categor ortoni similar analog cambridg ny principl categor rosch lloyd cognit categor nj soar research integr intellig mit ma increment adjust learn workshop machin learn morgan kaufmann san ca schneider oliv instruct architectur vanlehn architectur nj genet algorithm learn strategi local navig intern symp unman technolog durham simpl associ systemat tech report pa discoveri autonom learn environ machin learn control automat human inform process ii psycholog review proper treatment behavior brain insight interact instruct practic simul process control task quarterli journal psycholog stepp conceptu cluster michalski al machin ii morgan lo ca connectionist model reason incorpor rule knowledg variabl bind connectionist connect integr rule robust reason john wilei ny robust integr reason artifici intellig hybrid approach model neural special issu sun comput architectur integr neural symbol process kluwer academ publish ma sun hybrid learn model reactiv sequenti make sun work note ijcai workshop integr sun experi hybrid model learn sequenti make inform scienc sun autonom learn sequenti experi ieee transact neural model skill learn cognit scienc societi lawrenc erlbaum nj skill learn hybrid model proc european confer cognit uk nottingham press learn predict method tempor differ machin integr architectur react base approxim dynam program seventh intern confer machin learn morgan kaufmann san ca tadep hierarch reinforc learn proc intern confer machin learn morgan san ca practic issu tempor differ learn machin learn anim intellig touretzki symbol morgan kaufman towel extract refin rule neural machin learn utgoff increment induct tree machin learn rule acquisit event discoveri strategi cognit scienc cognit skill acquisit annual review annual palo ca build robot conf simul adapt behavior ed wilson mit press ma learn delai reward phd cambridg uk widmer learn presenc concept drift hidden context machin learn whitehead learn perceiv act trial error artifici intellig whitehead reinforc learn process artifici intellig develop procedur knowledg journal cognit interact data theori concept learn cognit scienc
ML/1404 6 neural comput research group dept comput scienc appli mathemat birmingham unit kingdom gener topograph map christoph bishop marku christoph william technic report april accept public neural comput abstract latent variabl model repres probabl densiti data space dimens term smaller number variabl familiar factor analysi base linear transform latent space data space paper introduc form latent variabl model call gener topograph map paramet model determin em algorithm principl altern wide map kohonen overcom limit som demonstr perform algorithm toi problem simul data flow diagnost oil pipelin gener topograph map introduct data set exhibit correl variabl captur structur model distribut data term variabl familiar approach factor base linear transform latent space data space paper show latent variabl framework extend transform remain tractabl lead topograph base constrain mixtur gaussian paramet optim em algorithm motiv work provid principl altern wide map algorithm set unlabel data vector data space summar term set refer vector spatial organ sheet algorithm achiev success practic suffer highlight kohonen absenc cost lack theoret basi learn rate paramet schedul neighbourhood paramet ensur topograph absenc gener proof fact model defin probabl densiti problem trace heurist origin som algorithm show algorithm overcom limit som introduc disadvantag import applic latent variabl model data visual model visual regard defin project data space visual space model defin term map latent space data space data map invert give rise posterior distribut latent space latent variabl goal latent variabl model find distribut data space term number latent variabl xl achiev function map point latent space point data space map govern matrix paramet neural network case repres weight interest situat space data captur fact data transform map space manifold data space illustr schemat case figur defin probabl distribut induc distribut data space refer prior distribut reason clear shortli distribut biolog metaphor invok motiv som procedur stress goal develop effect algorithm data biolog realism consid assum matrix partial deriv full column rank gener topograph map figur function defin manifold data space imag space map confin manifold singular realiti data approxim live includ model vector distribut gaussian centr varianc fi fi exp ae fi tk oe note model bernoulli binari variabl sigmoid transform multinomi mutual class normal exponenti transform combin distribut obtain integr data set data determin paramet matrix varianc maximum likelihood practic conveni maxim log ln prior distribut function form map principl determin fi maxim integr analyt intract linear function integr convolut gaussian gaussian distribut gaussian diagon covari obtain standard factor analysi model case radial symmetr gaussian model close relat princip compon analysi maximum likelihood solut column scale princip eigenvector extend formal function develop model similar spirit som algorithm specif form sum delta function centr node regular grid latent space gener topograph map figur order formul latent variabl model similar spirit prior distribut consist superposit delta locat node regular grid latent space node map point data form centr gaussian distribut case integr perform analyt point map point data form centr gaussian densiti illustr figur distribut function data space form log likelihood function ln jx model distribut correspond constrain gaussian mixtur model centr move independ relat function note provid map function smooth project point necessarili topograph order point xa xb close latent space map point close data space em algorithm parametr form differenti function network sigmoid hidden standard techniqu conjug gradient find weight matrix varianc fi maxim model consist mixtur distribut suggest seek em algorithm rubin bishop make suitabl choic model correspond solut set linear equat gener gener topograph map linear regress model form element consist fix basi function oe matrix gener linear regress model possess approxim capabl adapt provid basi function oe chosen appropri usual limit number basi function typic grow exponenti input space present context problem govern number latent variabl variabl typic small fact data visual applic gener maxim regard problem ident compon gener data point unknown formul em algorithm model point current weight matrix current varianc fi fi evalu posterior gaussian compon data point theorem form fi jt fi jx fi xk jx fi expect log likelihood form hl comp fi ln jx maxim respect obtain fi fw oe conveni written matrix notat form matrix element ij oe matrix element nk matrix element diagon matrix element ii solv standard matrix base singular decomposit note matrix constant evalu start maxim respect fi obtain formula fi fi kw em algorithm altern evalu posterior probabl solut jensen inequ gener topograph map show iter object function discuss bishop typic em algorithm satisfactori converg ten primarili interest converg distribut achiev rapidli converg paramet regular term ad object function control map interpret map estim choic prior weight case gaussian prior form exp jk regular lead modif give ident matrix data visual applic data theorem invert transform latent space data space choic prior distribut posterior distribut sum delta function centr lattic coeffici coeffici provid visual posterior map individu data point latent space desir visual set data point complet posterior distribut data point provid inform conveni summar posterior data point fi fi dx born posterior distribut case posterior give mislead summari true distribut altern approach evalu mode max arg max fig practic conveni plot mode data differ indic distribut choic model paramet problem densiti estim finit data set fundament exist infinit distribut rise observ data algorithm densiti model requir form knowledg addit data set assumpt distribut term reduc number latent variabl gener topograph map figur exampl manifold gener sampl prior distribut show effect choic basi function smooth manifold basi function gaussian width oe plot space basi function oe plot valu simpli affect linear scale manifold part prior prior distribut map function govern prior weight basi function typic basi function oe radial symmetr gaussian centr distribut uniform grid common width paramet number space basi determin smooth manifold exampl surfac gener sampl prior shown figur addit basi function oe select sampl point fx note sampl point relat number basi gaussian mixtur centr data space independ desir smooth properti lost larg number sampl difficulti comput cost number sampl point number freedom model control map function view role latent space sampl fx mont carlo approxim integr william choic number locat sampl point latent space typic gaussian basi function set case latent sampl point lie centr basi function note consid basi function paramet gaussian prior weight matrix prior basi function paramet treat map estim bayesian integr initi paramet model initi approxim princip compon analysi evalu data covari matrix obtain princip determin minim error function ux column eigenvector repres error gener topograph map project latent point data space model project obtain pca fi initi larger eigenvalu pca varianc data pca squar half grid space latent point data space note numer implement care evalu involv comput exponenti distanc project latent point data span rang valu summari algorithm forego discuss underli algorithm straightforward summar conveni consist constrain mixtur gaussian model paramet determin maximum likelihood em algorithm defin set point fx latent set basi function foe adapt paramet fi defin constrain mixtur gaussian centr common covari matrix fi initi train involv altern posterior probabl evalu fi evalu log likelihood end cycl monitor converg result present result applic algorithm toi problem involv data realist problem involv data diagnost measur oil flow pipelin exampl basi function oe radial symmetr gaussian centr distribut uniform grid common width paramet chosen equal separ neighbour basi function centr result toi problem case data space latent space shown figur oil flow data problem determin fraction oil pipelin carri mixtur water ga jame data point consist measur gamma measur attenu gamma beam pass pipe synthet gener data model accur attenu process presenc phase pipe water belong geometr data set consist point drawn equal probabl configur space goal data visual figur show oil data visual space data plot posterior vector point label gener topograph map figur result toi problem involv data gener curv project latent point gaussian distribut initi determin princip compon shown converg obtain iter shown figur left plot show project oil flow data latent space plot show data set visual princip compon analysi circl repres homogen configur note improv separ cluster gener topograph map configur figur show result obtain princip compon analysi relat map motiv provid principl altern relationship som focu attent batch version algorithm make relationship clear batch version som algorithm set refer vector defin data vector node regular lattic map latent space algorithm begin initi refer vector set random set equal random subset data princip compon cycl algorithm proce data vector node refer vector smallest euclidean distanc refer vector updat set equal weight averag data point ij neighbourhood function ith node gener chosen function featur map coordin centr win gaussian step identifi win node updat refer vector repeat iter kei ingredi algorithm width neighbourhood function ij start larg gradual reduc iter kernel versu linear regress point neighbourhood function depend ident win node data vector perform partial sum group data vector assign node form ij vector group number data vector group result analog kernel regress formula watson kernel function ij ij ij batch som algorithm replac refer vector cycl convex combin node mean coeffici determin neighbourhood function note kernel coeffici satisfi ij gener topograph map figur effect kernel ij plot function node node oil flow data set iter em kernel function analog neighbourhood function som algorithm centr gaussian compon regard analog refer vector som evalu solv equat find defin weight mean data vector obtain ij introduc effect kernel ij ij oe jj note effect kernel satisfi ij show ij oe oe basi function correspond oe result solut interpret weight regress vector weight coeffici jj figur show effect kernel oil flow problem discuss section som regard form kernel smoother kei differ som vector defin correspond hard assign data point vector involv soft weight posterior probabl analog distinct cluster fit standard gaussian mixtur model em kei differ kernel function som made shrink algorithm manner posterior probabl distribut latent data form radiu bubbl shrink automat shown figur bubbl govern extent individu data point contribut vector updat gaussian centr gener topograph map figur exampl posterior probabl latent space point earli stage intermedi stage late stage converg algorithm evalu singl data point train set problem discuss section plot scale form highlight variat latent space notic govern updat weight updat vector shrink automat learn process comparison som differ som algorithm defin explicit probabl densiti mixtur distribut consequ object function log likelihood converg maximum object function em algorithm rubin direct mean compar choic model compar solut densiti evalu likelihood test set gener distribut respect model som probabl densiti object function minim train process proven object function exist som limit highlight kohonen page condit som occur practic confirm empir train model desir spatial order natur map automat consequ choic continu function smooth properti som determin indirectli choic neighbourhood function chang difficult control prior knowledg form map easili prior distribut control properti smooth govern explicitli basi function illustr figur rel comput cost som algorithm problem involv data space domin comput cost evalu euclidean distanc data point gaussian centr calcul som distanc data point refer vector expect iter algorithm approxim time empir comparison comput cost som obtain run algorithm oil flow data discern chang visual algorithm gener topograph map sec batch som sec gaussian neighbourhood function simpl neighbourhood refer vector updat iter data point nearbi refer cpu time som algorithm reduc potenti advantag practic applic reduct number train run converg topograph order relat algorithm algorithm publish literatur close link review briefli elast net algorithm durbin willshaw view gaussian mixtur densiti fit penal maximum likelihood penalti term encourag centr gaussian neighbour point chain close data space differ defin continu data space manifold train algorithm gener involv anneal weight penalti coeffici similar princip curv princip surfac stuetzl tibshirani involv algorithm consist project gener model interest note hasti stuetzl reduc spatial width smooth function manner analog shrink neighbourhood function som modifi form princip curv algorithm introduc gener distribut base mixtur likelihood train em algorithm number gaussian compon equal number data smooth penal likelihood function addit regular term techniqu parametr map involv fit standard som model data set find manifold data space interpol refer vector defin continu interpol surfac form part train basic problem discuss section remain som vector quantiz context shown vector quantiz problem buhmann avoid problem som procedur discuss earlier network model mackai involv transform simpl distribut latent space complex distribut data space propag network discret distribut latent space interpret approxim mont carlo integr latent variabl defin data space distribut instanc framework sampl latent space regular specif form model paramet adapt em gener topograph map discuss paper introduc form latent variabl model train effici em algorithm view topograph map kei properti defin probabl densiti model probabl import practic problem deal miss valu data set compon data vector miss valu miss random rubin likelihood function obtain integr unobserv valu model integr perform lead simpl modif em algorithm consequ probabilist approach straightforward mixtur model case densiti written repres rth set independ mix coeffici satisfi straightforward extend em algorithm maxim likelihood function algorithm extend instanc independ mix coeffici gaussian estim straightforward extens em algorithm independ determin smooth function latent variabl normal exponenti appli gener linear regress case em algorithm involv optim varianc fi gener function import properti exist smooth manifold data local factor latent data space evalu function latent space coordin techniqu differenti geometri william likelihood straightforward principl introduc prior model paramet discuss section bayesian techniqu place maximum likelihood paper focuss batch version algorithm train data updat model paramet applic conveni sequenti adapt data point present time minim differenti cost sequenti algorithm obtain appeal procedur bishop find object function gradient sequenti form em algorithm web site provid includ postscript file relev softwar implement matlab implement data set develop algorithm gener topograph map acknowledg work support epsrc grant neural network visual data geoffrei michael tip discuss marku staff san group stockholm hospit part project refer neural network pattern recognit oxford press jame analysi flow gamma neural network nuclear instrument method physic research william fast em algorithm latent variabl densiti model hasselmo advanc neural inform process volum pp mit press william magnif factor algorithm iee intern confer artifici neural network vector quantiz complex cost ieee transact inform theori rubin maximum likelihood incomplet data em algorithm journal royal statist willshaw analogu approach travel salesman problem natur converg properti energi function biolog cybernet stuetzl princip curv journal american statist associ adapt elast model charact recognit lippmann advanc neural inform process volum pp morgan format topolog correct featur map biolog cybernet map tibshirani adapt princip surfac journal american statist associ rubin statist analysi miss data john wilei deriv class train algorithm ieee transact neural network bayesian analysi map neural comput bayesian neural network densiti network nuclear instrument method physic multivari analysi academ press gener topograph map iter kernel smooth process neural comput estim regress theori probabl applic parametr map intern confer artifici neural pp stochast approxim method annal mathemat statist princip curv revisit statist comput statist analysi finit mixtur distribut john wilei smooth regress analysi indian journal statist seri
ML/1405 6 present approach pose estim encod perform introduct determin posit environ ii sutherland emploi kalman filter deriv work emploi sensor includ iii overview imag sampl pose space posit input imag track landmark match final pose estim candid landmark track landmark merg independ pose estim candid landmark landmark extract set candid landmark configur space retriev match landmark candid iv detect darker intens repres larg valu track track prototyp set observ edg densiti candid landmark track landmark maxima extract recognit landmark posit track landmark essenti model vi estim li fn ffl nearest coordin cm pose estim singl imag coordin cm landmark featur vector decomposit reconstruct track landmark subspac recov ˆ ˆ cm ˆ portion locat σ unknown consist consist measur orient orient vii plot truth coordin cm pose estim ground truth coordin cm viii estim landmark set coordin cm pose estim ground truth coordin cm method exploit method suitabl refer sw contour grace rate smooth spline data smooth techniqu
IR/1406 5 concept index fast reduct algorithm applic document retriev categor georg karypi han depart comput scienc armi research center mn technic updat march abstract recent tremend growth volum text document digit intranet led interest develop method effici categor retriev relev inform retriev techniqu base latent semant index shown improv qualiti inform retriev captur latent mean word present document high comput requir lsi inabl comput effect reduct set limit applic paper present fast reduct call concept index equal effect reduct ci comput collect document cluster document centroid vector cluster deriv ax reduc space result show reduct comput ci achiev compar retriev perform obtain requir order magnitud time ci comput reduct greatli improv perform tradit classif algorithm knn introduct emerg led exponenti amount document electron digit intranet provid huge collect onlin document forecast text unstructur work support nsf armi research offic contract doe armi high perform comput research center contract number access comput facil provid minnesota supercomput institut relat paper www predomin data type store onlin develop led interest method user quickli accur retriev organ type inform inform retriev liter match term document present user queri method base lexic match lead poor retriev perform due effect term multipl unrel document includ answer set match queri term concept multipl relev document queri term retriev problem fact idea document relat concept word descript effect retriev method match concept present queri concept present document retriev document part desir concept queri prevent document belong unrel concept retriev queri term natur document reason problem document categor assign document class challeng year varieti document categor algorithm develop machin learn inform retriev commun result research naiv simpl classif perform document compar algorithm capabl learn substanti complex model robust perform attribut fact naiv bayesian model underli concept present class summar characterist class probabilist exploit natur document techniqu base reduct explor captur concept present collect main idea techniqu map document queri test lower space explicitli account depend term associ present lower improv retriev categor perform reduct techniqu classifi reduct refer set techniqu advantag inform comput lower space techniqu primarili document classif improv retriev perform document collect exampl techniqu includ varieti featur select scheme reduc select subset origin techniqu creat featur cluster term reduct refer set techniqu comput lower space inform techniqu primarili improv retriev lesser extent document categor exampl techniqu includ princip compon analysi latent semant index kohonen map scale context document data lsi wide experi shown significantli improv retriev perform wide varieti document collect paper present fast reduct call concept index reduct kei idea reduct scheme express document function concept present collect achiev find group similar group potenti repres concept group deriv ax reduc space case ci find group class case ci find group document cluster algorithm cluster found linear time cluster algorithm contribut ci low comput requir evalu qualiti lower space comput ci wide rang data set set experi show ci achiev compar retriev perform obtain requir order magnitud time case experi show lower space comput ci significantli improv perform tradit classif algorithm averag classif accuraci data set obtain algorithm reduc space higher achiev implement naiv bayesian algorithm remind paper organ section summari earlier work reduct section describ document model algorithm section describ concept index reduct algorithm section describ cluster algorithm concept index section evalu algorithm section offer conclud remark direct futur research previou work briefli review techniqu develop appli document dataset reduct techniqu reduc data set techniqu reduc combin multipl variabl attribut util depend variabl techniqu captur synonym document data set major techniqu tend larg comput memori requir wide techniqu reduct princip compon analysi pca eigenvector covari matrix ax lower space lead eigenvector correspond linear combin origin variabl account largest amount term variabl disadvantag pca high memori comput requir requir memori covari find lead eigenvector requir unaccept high document data number term ten thousand latent semant index reduct techniqu extens inform retriev domain similar natur pca find truncat singular decomposit covari find truncat singular decomposit origin singular eigenvector ax lower space lsi requir calcul covari smaller memori cpu requir experi shown lsi substanti improv retriev perform wide rang data set reason lsi robust perform activ area research techniqu includ kohonen featur map princip direct data set data set figur problem pca lsi classif data set scale scheme base neural network project high input data featur map smaller dimens proxim relationship input data preserv md transform origin data smaller space preserv rank order distanc data point reduct techniqu develop reduct potenti reduc set advantag class categori inform data set limit approach set illustr classic shown figur data principl direct comput lsi pca direct varianc project data set princip direct lead worst project data set lead perfect classif limit techniqu data characterist variabl describ smaller class tend lost result reduct classif accuraci smaller class bad reduc space reduct perform featur select techniqu techniqu broadli classifi commonli refer approach featur rank varieti featur varieti techniqu develop rank featur word includ document frequenc document word mutual inform statist main disadvantag approach featur select independ actual classif algorithm criteria rank measur effect featur classif criteria optim classif algorithm limit approach criteria measur effect featur independ featur effect classif conjunct featur select contrast scheme find subset featur classif algorithm black box approach featur select base improv classif accuraci algorithm approach shown effect approach applic major drawback approach comput requir high true document data set featur number thousand baker mccallum recent reduct techniqu base distribut cluster word techniqu cluster word group base distribut class label word word similar class group cluster condit probabl set comput weight averag condit probabl class individu probabl word cluster word similar class techniqu potenti identifi word synonym word belong polysem word identifi model document ci reduct document repres model document consid vector simplest document repres vector tf tf tf tf frequenc term document wide refin model weight term base document frequenc document collect motiv weight term frequent document limit discrimin reason commonli multipli frequenc term total number document df number document term document lead tfidf tf tf order account document length document vector normal unit tfidf rest assum vector document weight normal unit length similar document commonli measur cosin function denot vector document vector unit formula simplifi set document vector defin centroid vector vector obtain averag weight term document set refer support set centroid analog individu similar document centroid vector comput cosin note document vector length centroid vector necessarili unit length similar function measur similar document document belong support set centroid care analysi equat reveal similar captur number interest characterist similar ratio divid length support set easili shown averag similar document length centroid vector averag similar document includ note document scale unit equat measur similar document centroid set averag similar document document amplifi function depend averag similar document averag similar amplif averag similar amplif small import featur amplif paramet captur depend term document term posit depend term frequent averag similar document tend lead small amplif posit term depend document averag similar document lead larger amplif equat comput similar document account similar document support depend term support set concept index concept index algorithm comput lower space find group similar document deriv ax lower space rest section describ detail ci reduct algorithm analyz natur lower reduct ci comput reduc space set number desir ci comput cluster document algorithm section centroid vector cluster ax reduc space number number distinct term row store document ci cluster algorithm partit document disjoint set comput centroid vector defin equat centroid vector scale unit length unit length centroid vector vector form axi reduc document obtain project space project written matrix notat mk matrix column correspond document dc entir collect matrix dc queri retriev qc similar document reduc space comput calcul cosin reduc vector reduct case ci cluster document class topic document belong find group similar document simplest group correspond class data set rank lower space ident number class lower space rank greater number comput ci initi comput cluster creat cluster document cluster algorithm obtain cluster repeatedli partit cluster note final finer cluster document class approach comput lower space rank smaller number distinct repeatedli combin initi cluster agglom cluster algorithm lower space tend lead poor classif perform combin potenti recommend note cluster algorithm proce comput lower space fashion set discuss section reduct improv retriev perform document improv accuraci document classif algorithm experi present section show perform tradit classif improv dramat reduc space found ci analysi discuss order understand reduct understand thing understand encapsul centroid understand mean reduc document rest discuss assum cluster algorithm return good cluster set document cluster similar document belong cluster similar belong cluster set centroid vector mechan summar content promin dimens vector term highest correspond term import set exampl centroid vector collect document shown tabl collect section collect comput cluster comput scale centroid vector tabl show ten highest weight term number term tabl weight term centroid vector note term shown tabl actual stem number observ made term present centroid weight term account larg fraction length illustr comput fraction centroid length corn soybean unknown report export ga oil cubic reserv feet natur drill lt quota bag export brazil meet produc palm import oil januari beef februari export copper steel ct cent pound lb price crop grain wheat weather china rain plant crude post ct dlr distil price gasolin dollar bank portland yen load ship japan orang dealer sugar white trader interv ec tender cargo gold ton mine feet silver reserv coin ec tax european licenc commiss commun wheat soviet farm bill offer grain agricultur loan buffer deleg rubber stock consum rule council ship gulf missil vessel attack sea line oil tax explor energi import studi industri credit wheat ccc depart nil sale commod guarant bonu crude oil pipelin energi wheat tender taiwan shipment soft export home deliveri strike union port worker emploi ship pai talk oil price crude al russian russia moscow soviet nato militari vw lopez gm matrix inquiri churchil econom export percent enterpri russian reform product economi social russia tunnel rail school curriculum british pound channel labour food blank label fda speci cfr drug patient aid fda treatment korea north nuclear korean inspect seoul sanction tax bank cent pound incom rate tax financ japan china trade rice japan gat tokyo import women domest crime speaker victim abu bill sexual hunter tax fraud rose sentenc al arab isra israel kill terrorist cent compani dollar pound pharmaceut price paper sale market kong hong chine china beij journalist taiwan yang grain agricultur price rural product percent yuan farm farmer nuclear india weapon prolif reactor japan mexico speaker american trade job rep polic kill anc murder africa offic death journalist african drug polic arrest spanish water forest environ river project pollut amazon power energi tabl ten highest weight term centroid cluster data set term shown column tabl highest ten term centroid account centroid account centroid rel small number keyword term direct consequ fact support set centroid correspond cluster similar random subset document term effect provid summari topic discuss weight provid indic central topic centroid cluster document talk export agricultur product cluster energi relat cluster document relat featur centroid vector successfulli past build accur summari improv perform cluster algorithm preval term centroid term act synonym context topic describ easili cluster term russian russia present term vw present term drug present nineteenth centroid note term necessarili present singl term easili centroid vector interchang describ underli topic term centroid term multipl centroid easili happen support set centroid part happen term multipl mean case term drug sixth nineteenth cluster mean drug sixth cluster prescript mean drug nineteenth cluster polysemi term term abbrevi food drug administr occur sixth cluster mean fda cluster correspond function fda infer term centroid mean fda sixth cluster correspond function fda infer term centroid vector provid effect mechan repres concept present support set vector captur actual latent associ term describ concept set centroid vector document coordin reduc document similar document centroid vector measur cosin function note consist earlier definit coordin defin normal centroid vector dimens document reduc space correspond document match concept encapsul centroid vector interpret low document reason call reduct scheme concept index note document close origin space tend close reduc match concept centroid captur latent associ term describ document similar term close reduc space close origin improv retriev relev inform document close origin space due polysem reduc elimin incorrect retriev experi section ci improv retriev compar achiev origin space find cluster year varieti document cluster algorithm develop vari partit base document cluster algorithm gain accept provid good cluster time complex cluster algorithm ci deriv gener class partit algorithm partit cluster algorithm comput cluster set document directli bisect direct cluster comput set document select collect act seed cluster similar seed assign cluster similar seed form initi cluster cluster repeatedli refin procedur centroid vector cluster document assign cluster similar centroid refin process termin predetermin small number iter document move cluster partit bisect obtain appli algorithm comput cluster document partit cluster select process continu lead cluster number scheme develop select initi set seed document commonli scheme select seed random small number set fda regul food product prescript drug random seed cluster solut comput solut select final cluster qualiti partit cluster evalu comput similar document centroid vector cluster belong solut maxim sum similar entir set document ci cluster algorithm random seed select solut obtain random set seed ci algorithm comput cluster document bisect approach control rel size produc cluster size substanti lead reduct reason recal section ci centroid vector repres concept present collect small number captur concept present larg number document achiev centroid vector obtain larger cluster found experi report direct cluster solut creat small sensit outlier kei step bisect cluster algorithm scheme select cluster partit cluster algorithm select cluster bisect obtain cluster solut simpl scheme select cluster largest number document scheme produc cluster size substanti case concept final cluster happen case actual number document support concept substanti size bisect largest cluster easili lead solut larg concept captur multipl smaller concept complet lost bisect cluster larg number dissimilar captur time ensur concept present larg number document ci achiev goal recal section cluster centroid vector squar length vector measur averag similar document measur averag dissimilar aggreg dissimilar document cluster equal aggreg dissimilar ci quantiti select cluster bisect ci bisect cluster highest aggreg dissimilar cluster complex cluster algorithm log number document number cluster larg document data set www document index search cluster algorithm util increment cluster find cluster effici result section evalu qualiti reduct perform ci set experi present set evalu document retriev perform achiev ci comput reduct perform compar lsi set experi evalu qualiti reduct comput ci term document retriev perform term classif improv achiev tradit classif algorithm oper reduc space experi unit length document ci document collect data sourc doc class min class size max class size avg class size word west group west group west group trec trec trec trec trec trec trec trec fbi trec trec wap webac tabl summari data set characterist document collect experi summar tabl data set collect legal document publish west group data set deriv collect data set fbi foreign broadcast inform servic data data set lo angel time data class fbi data set gener relev judgment provid collect class label gener newspap section articl data set text categor test collect distribut divid label set construct data set data select document singl label data set ohsum collect subset medlin document index uniqu categori subset categori construct data set data set wap webac project document correspond web page list subject hierarchi data remov common word stem porter algorithm reduct goal reduct techniqu ci lsi project document collect low space similar document document part closer rel document belong topic lead substanti improv accuraci achiev regular queri queri perform measur number relev document present return document queri return relev document major document return relev number larger collect testb queri perform type evalu reason evalu perform term effect reduc space bring closer document belong class evalu extent reduct scheme bring closer similar perform experi data set shown tabl dataset document comput set origin reduc space set origin reduc count number document belong class count cumul count document data set perform reduct scheme evalu compar ratio greater reduc space success bring larger number similar document closer origin ratio reduc space refer ratio retriev improv achiev reduct scheme altern interpret experi document perform queri queri set result number measur number measur cumul recal achiev perform queri total number document retriev perform comput recal fix size tabl show valu ri measur obtain ci lsi largest data set testb ri measur comput column tabl show number dimens reduc space data retriev perform peak smaller number dimens result retriev improv achiev ci compar achiev lsi scheme achiev similar valu ri scheme comput space similar document closer ri measur greater ci lsi differ small compar row show averag ri achiev lower space result present tabl provid global overview retriev perform achiev ci entir collect document bring closer document comput ri measur class basi result shown tabl ci lsi due space present comparison singl number dimens tabl show ri measur obtain reduc number dimens data comput ri measur rel perform ci lsi remain includ result fbi wap ci lsi ci lsi ci lsi ci lsi ci lsi ci lsi ci lsi averag ci lsi averag tabl valu ri measur achiev ci lsi tabl show ri measur obtain reduc number dimens note column label show number document class class sort order number interest observ made result shown tabl perform ci similar lsi scheme improv retriev perform size class affect retriev perform scheme tend improv retriev larger class higher smaller class result ci compar larger class smaller class direct result cluster algorithm ci creat larg cluster cluster solut balanc tradeoff size varianc cluster potenti lead result smaller class area investig summar reduct comput ci achiev compar retriev perform obtain lsi amount time requir ci find ax reduc space significantli smaller requir lsi ci find ax fast cluster lsi comput comparison ci lsi shown tabl lanczo method lsi wide packag comput matric fastest implement svd algorithm result shown tabl ci consist ten time faster lsi reduct main featur ci quickli comput ax reduc space account priori knowledg class document belong discuss section reduct improv retriev perform collect document illustr set data set previou time centroid class ax reduc space ri measur class data set shown tabl note number dimens reduc size ci lsi size ci lsi size ci lsi size ci lsi size ci lsi size ci lsi size ci lsi size ci lsi wap fbi tabl ri measur data set space data set equal number class data set reduct comput ci dramat improv retriev perform class data set retriev perform smaller class improv smaller class suffici repres experi shown tabl class equal size reduct perform ci improv perform tradit classif algorithm illustr perform experi tradit classif origin reduc space wide classif algorithm shown produc good classif primarili low data set classif algorithm classif algorithm appli text categor earli dai research fbi wap ci lsi tabl comparison lsi ci time correspond amount time requir comput dimens data set dimens comput experi perform linux workstat equip intel pentium ii run set reduc experi perform entir set document split train test set train set find ax reduc space construct axi class train test set project reduc space case project train test set learn tree evalu case neighborhood comput perform project train test origin reduc space classif accuraci experi shown tabl result correspond averag classif accuraci experi randomli select fraction document train remain test column show classif accuraci obtain knn origin data set column show classif accuraci result obtain algorithm reduc space comput ci column show classif accuraci obtain algorithm reduc space comput lsi present set obtain space note lower space comput account class lsi perform reduct set column show result obtain naiv bayesian classif algorithm origin space nb implement provid rainbow softwar librari nb result present provid refer point classif accuraci note nb algorithm reduc nb effect handl continu attribut data highlight scheme achiev highest classif boldfac font benefit greatli reduct comput ci classif accuraci achiev reduc space greater accuraci origin space data set entir data ci improv averag accuraci knn compar result obtain naiv appli reduc substanti outperform naiv case compar perform knn origin space entir data accuraci knn reduc space greater naiv bayesian classif result obtain knn lower space comput perform mix compar perform achiev lower achiev origin lsi improv result obtain data knn ten data set comput lower perform experi number dimens reduc space time greater number class perform algorithm due space limit includ result size size size size size size size size fbi wap tabl ri measur data set reduct space significantli consist outperform classif result obtain lower space obtain lsi includ result knn featur select techniqu due inconsist perform scheme data set number dimens data set vari detail experi show characterist featur select scheme text reader direct futur work paper present fast reduct techniqu call concept index equal reduc dimens set ci reduc document collect concept present collect express document function concept analysi shown comput ci capabl captur actual latent inform document collect knn knn dim dim dim dim nb fbi wap lsi reduc space origin space ci reduc space knn tabl classif accuraci origin reduc data set ci captur concept respect word synonymi polysemi evalu shown ci perform equal lsi requir order magnitud set dramat improv perform classif algorithm perform ci improv varieti wai ci advantag document cluster lead lower space faster perform area investig develop robust cluster algorithm comput cluster directli bisect techniqu hold improv qualiti lower small reduc low comput requir ci reduct comput ci improv techniqu adjust import featur set varieti techniqu develop context classif scale dimens prior reduct comput centroid vector scale reduc dimens final classif refer stephen philip yu merit build categor system cluster proc acm sigkdd intl confer knowledg discoveri data page tg dietterich learn irrelev featur proc ninth intern confer machin page baker mccallum distribut cluster word text classif user guid mw st gw obrien linear algebra intellig inform retriev siam eh moor document categor queri gener world wide web webac ai review eh moor cluster web document categor support ps scale cluster algorithm larg proc fourth intl confer knowledg discoveri data tm cover ja thoma element inform theori john wilei thompson automat categor document proc asi classif research dr jo dr jw tukei approach larg document collect acm page dj spiegelhalt michi cc taylor machin neural statist classif elli learnabl acquisit stress technic report tr institut languag technolog artifici tilburg bv dasarathi nearest neighbor nn pattern classif techniqu ieee comput societi st gw tk index latent semant index journal american societi inform ding probabl model latent semant index domingo pazzani optim simpl bayesian classifi loss machin ro duda pe hart pattern classif scene analysi john wilei st dumai lsi inform experi proc text retriev confer nation institut standard ps bradlei initi iter refin cluster algorithm proc fourth intl confer knowledg discoveri data french cluster larg dataset arbitrari metric space proc intl conf data goldberg genet algorithm optim machin learn eh moor web agent document categor proc intern confer autonom eh han karypi document classif analysi result technic report depart comput www url han text categor weight adjust neighbor classif phd octob tj interact retriev evalu larg test collect research page hofmann probabilist latent semant index sj hong contextu inform featur rank discret ieee transact knowledg data text comparison categori search strategi page jackson user guid princip compon john wilei ak jain dube algorithm cluster data prentic joachim probabilist analysi rocchio algorithm tfidf text categor proc fourteenth intern confer machin joachim text categor support vector learn relev featur proc european confer machin gh john langlei estim continu distribut bayesian classifi proc eleventh annual confer uncertainti artifici page ks jone statist interpret term specif applic retriev journal kanal editor search artifici intellig kira la rendel practic approach featur select proc intern confer machin kohavi featur subset select wrapper overfit dynam search space topolog proc intl confer knowledg discoveri data page kohonen memori kononenko estim analysi extens relief proc european confer machin korf search encyclopedia artifici page john wilei wai lam chao yang ho gener instanc set automat text categor landauer st dumai solut latent semant analysi theori induct knowledg psycholog langlei sage induct select bayesian classifi proc tenth confer uncertainti artifici page larsen aon fast effect text mine document cluster proc acm sigkdd intl confer knowledg discoveri data page lewi naiv independ assumpt inform retriev tenth european confer machin lewi gale sequenti algorithm train text classifi lewi ringuett comparison learn algorithm text categor proc annual symposium document analysi inform lewi text categor test collect distribut david robert jame ron papka train algorithm linear text classifi annual intern acm sigir confer research develop inform page liu featur select knowledg discoveri data mine kluwer academ dg low similar metric learn classifi neural page januari waltz classifi stori memori base reason page mccallum nigam comparison event model naiv text classif workshop learn text andrew mccallum toolkit statist languag text classif cluster mobash web page categor featur select associ rule princip compon cluster workshop inform technolog dec latent probabilist analysi proc symposium principl fernando lee distribut cluster english word proc annual meet associ comput page porter algorithm suffix strip ross quinlan program machin learn morgan san forrest research cope complex data forrest april salton automat text retriev inform comput trec text retriev confer dw mohri review empir evalu method class lazi learn algorithm ai wettschereck tg dietterich comparison nearest neighbor nearest hyperrectangl algorithm machin marilyn bill punch find salient featur person web page categori www santa yang expert effect effici learn human text categor retriev yang liu text categor method yang pederson compar studi featur select text categor proc fourteenth intern confer machin effici data cluster method larg proc int conf manag
IR/1407 5 data index mine engin parallel comput architectur inform process internet richard richard wendi depart comput scienc texa pan american drive tx februari content introduct parallel comput architectur inform process internet inform servic model system architectur document explor inform retriev visual tool www extract organ www semant content deriv term associ pathfind techniqu network abstract spatial system network displai interact mechan network abstract navig orient tool stereoscop displai web access geograph inform system data function provid structur parallel web search machin learn machin learn approach web search interact web structur creat index queri tool inform retriev futur work list figur system architectur softwar structur abstract report index mine softwar architectur perform data index mine integr environ present user unifi view inform servic user issu inform servic call softwar compon provid servic request depend type servic call agent action satisfi user request extens architectur research develop add softwar compon increment includ compon document explor analyz text inform larg document collect present user suit visual tool searchabl index extend hierarch index scheme popular browser user build searchabl index parallel web search engin novic rank index algorithm provid user accur search result shorter time user access gi data web introduct internet great pose great challeng opportun rang build virtual supercomput access digit librari search piec largest prime great challeng includ resourc inform coordin parallel comput activ research effort underwai address problem divid major comput internet inform engin internet research effort comput internet network access comput power larg number comput issu studi includ share comput power heterogen distribut task individu coordin develop incent scheme share excess resourc gener model client extra comput storag access resourc offer host comput kei featur client access comput power storag host exampl categori includ client host regist broker coordin client internet intranet part comput infrastructur seamless host activ work overload client inform engin involv visual type inform access internet internet massiv amount typic unstructur natur languag base data requir approach challeng guid user formul accur locat relev inform properli index rank present user usefulli pioneer success internet inform access discoveri system harvest server run client index inform local store file servic server report result network interfac exist internet search engin send user request search engin lyco result rank back user design resourc knowledg discoveri global inform system approach inform gener transform layer lowest layer raw data highest layer fulli usabl inform user current research focu inform engin side visual piec concentr share excess comput power internet speed special comput excit feasibl implement usabl tool partial due fact extrem complic effect excess comput power storag capac internet effici scalabl perform attack concentr build tool internet make effici local wide comput power storag capac parallel comput architectur inform process internet view inform engin concert oper collect inform oper includ transmiss data mine architectur effect provid usabl inform servic internet goal provid user seamless inform servic visual techniqu cooper comput environ inform servic model gener inform servic approach user request inform servic visual servic fast accur agent inform servic vital import user formul proper queri larg portion applic effort properli formul problem optim algorithm detail data ai visual techniqu queri refin parallel search scheme retriev inform search result sort present user visual tool system architectur properli servic user inform request core research design goal extens architectur inform servic user increment develop research system divid major user interfac coordin data resourc coordin comput resourc coordin extens softbot overview figur user request inform servic user interfac coordin modul accept refin user request send request agent figur system architectur servic data resourc coordin handl data exchang compon compon intern extern data compon data compon check data format retriev data compon sourc internet crc architectur access extern comput resourc internet intranet crc regist request intern find host network share request servic host crc act broker compon extern comput storag resourc user request agent act request provid user visual collect inform process softwar expand increment includ compon document explor document analyz text inform larg natur languag document collect text analysi cluster perform suit visual tool queri formul present result dynam user searchabl index engin index suppli extend hierarch index scheme widespread parallel search engin search scheme similar user request forward exist search engin result return search engin digest present user index rank scheme metacrawl user access gi inform data web inform www gi data rigid intern structur gi softwar data organ inform data base structur inform exist gi present user web suitabl form discuss detail compon document explor inform retriev visual tool www challeng inform access internet issu common form inform retriev issu includ difficulti queri formul index index user inabl complet inform retriev inform meet user inform iter techniqu explicitli incorpor user relev provid mean autom aspect user guid retriev clear mechan provid altern path access inform enhanc retriev approach enhanc inform retriev internet visual facilit user percept document relat structur number system develop provid visual base mechan link structur internet typic distort space link connect show topic relat document system provid facil organ view document organ base semant content altern describ system oper semant content www document form visual displai hierarchi fix www document locat space user interact posit keyword pyramid describ system user view organ document visit hierarchi link construct separ hierarchi base document system visual www content structur queri formul mechan base document semant content mechan complement text link base search suppli visual search queri formul environ semant associ document user view interact visual www document relat deriv document space relationship individu keyword document repres visual support queri formul direct manipul content word document set system direct manipul facil form queri identifi start point document convent retriev suit visual tool interact displai suppli orient cue navig mechan assist user document keyword formul queri direct manipul system object extract organ www semant content document explor princip visual network displai base document keyword list list provid automat content extract deriv system keyword list document determin associ document term statist text reli recov conceptu inform natur languag frequenc word basic approach wide rang context util limit visual environ explor direct manipul visual associ document content facilit queri direct manipul system object underli visual displai minimum cost network deriv measur term document associ associ deriv natur languag text singl associ term thesauri document collect repres network document base similar deriv term associ set www document system separ set term form frequent occur word exclud function word form retriev simpl procedur suffer limit frequent occur term discrimin function associ thesauru give pictur concept document set frequent occur term tend gener term provid inform domain document collect deriv distanc term construct text analyz find sequenc term stem present text sequenc assign distanc term base lexic distanc syntact unit metric similar belkin term pair similar calcul sum valu ad term occur paragraph document similar provid associ deriv network displai system reason associ structur interact system reason view inform retriev system suppli user varieti tool retriev techniqu associ inform structur provid class retriev tool complement retriev aid associ thesauru base term document present structur term relationship present thesauru show term hierarchi associ thesauru encourag bring user associ plai inform user familiar inform associ structur provid mean explor gain inform defin inform reason associ structur desir deriv automat interact effort requir deep associ structur effect compon hybrid system incorpor deep shallow final reason desir provid common visual retriev tool network natur repres visual provid common system visual compon pathfind techniqu network abstract associ network system pathfind network pathfind algorithm develop model semant memori human provid paradigm scale psycholog similar number psycholog design studi compar scale techniqu found provid tool reveal conceptu underli system network displai minimum cost network deriv measur term document associ network document base measur keyword document pair network associ term visual user singl document associ deriv text associ measur keyword lexic distanc document conceptu path length limit minimum cost network algorithm deriv minimum cost span tree constraint network connect measur sum link minimum addit constraint ad graph connect minimum longest path length connect node measur number criterion deriv direct distanc pair node compar indirect direct link node includ data shorter path satisfi constraint maximum path length construct paramet determin path weight minkowski specifi maximum number edg consid find minimum cost path entiti paramet edg complex network form subset edg complex network algorithm gener famili control complex network obtain infin total number node network properti practic provid techniqu systemat vari network densiti provid network union global network local inspect reduc complex network central object effort visual internet inform structur complex reduc transform network document connect hierarchi remov link compar gener problem repres direct visual hierarchi develop sort transform mukherjea www document document explor node complet network identifi displai navig fashion similar identif cluster centroid singl link cluster document node continu displai overview diagram space user navig document explor network differ densiti provid separ view document term interrelationship path length satisfi minimum cost global navig orient show strongest relat element effect suppli view global navig structur percept provid detail view relationship system maintain element maximum path length creat complementari network link network displai benefici view small set element serv sort magnifi glass reveal relat element shown network spatial system network number data present problem requir draw displai interest visual attent methodolog graph displai dimens visual present graph layout criteria center quickli mean diagram convei readabl graph graph draw algorithm goal layout present inher mathemat entiti manner meet criteria human observ aesthet layout determin readabl formul optim goal draw displai symmetri minim number edg cross draw fundament aesthet visual present wide applic graph structur algorithm draw gener undirect due part inabl aesthet criteria individu understand restrict class graph express aesthet criteria satisfactori algorithm aesthet draw gener undirect graph minim edg cross bend uniform edg uniform node distribut aesthet optim prevent optim graph layout algorithm gener view optim problem typic observ suggest heurist approach gener graph draw applic spring embedd heurist approach graph draw base physic system algorithm simul mechan system graph edg replac spring node replac ring connect incid node initi configur ring system oscil stabil configur paramet control forc act ring movement spring spring spring initi configur gener heurist combin provid approxim solut compet aesthet spatial document explor network design facilit user percept network structur network node posit dimens graph layout base spring metaphor similar network layout algorithm spring embedd node treat connector spring length strength connector deriv network link distanc node vari dimens iter posit point minim energi system spring vari spring length strength layout user interact visual reveal cluster connect node displai interact mechan central challeng displai larg inform space overcom user feel feel document explor feel attenu part layout network node facilit percept global structur coupl overview diagram track user current view posit facil interact vari network densiti provid global orient examin local detail navig tool includ suppli mechan user control navig facilit find larg document term space network abstract size densiti internet document network requir view navig tool user perceiv structur document explor smaller region select view individu document displai interact mechan document explor suppli orient overview global structur document navig retriev tool explor local detail overview displai small number node select provid inform organ complet network node provid orient serv landmark assist user part network view node provid entri point network internet document collect deriv associ thesauri network document characterist structur tend small number node node directli connect short path highli connect high node network diamet small network form suggest criterion select node includ overview diagram system overview diagram includ node highest complet network term node select associ thesauri overview tend gener term provid guid content document node select overview tend gener articl content area overview node landmark suppli inform content structur user viewpoint main view portion network view overview diagram track overview node visibl view volum detail view attenu provid context individu network node view displai mechan chang network view design facilit orient structur examin local detail avail separ network differ number form network abstract enhanc user perceptu extract network suppli mechan navig network displai system essenti fewest link node connect network provid spring analog posit node space arrang node basi practic suppli characterist cluster node structur easi perceiv util deriv semant space document explor relat weak relat captur network user typic identifi singl document document region link document select weaker link node node set visibl link identifi differ color point select made identifi network larg easili zoom back explor navig orient tool navig tool suppli mechan return user previou view point provid inform current view posit context visual bookmark set user point move network bookmark displai annot snapshot user view select bookmark return user viewpoint time bookmark set visual displai color set time remain visibl long view distanc select anchor return user viewpoint point anchor set provid techniqu suppli context inform network region view detail mention user select node overview window navig viewpoint select overview facil initi method explor larg network practic user quickli familiar small set overview document label term exploit user familiar overview node mechan global context view detail local region creat displai similar visual form point arrow label nearest overview node label point arrow show direct closest overview node orient inform locat detail view relat complet network user inspect overview window portion network view discern locat local detail examin global context complementari type inform inform global locat overview present detail view addit displai orient facil link node color set part network high similar user queri backtrack facil user retrac path arriv viewpoint user select node repres singl document term expand connect node color mark network explor user enter associ thesauru node queri individu document result serv entri point network document navig maintain fluid movement viewpoint stereoscop displai explor displai interact stereoscop displai network sort network displai document explor user abil perceiv structur perform interact found number recent studi stereoscop network head posit recent attent interfac head mount displai displai typic provid user wide field stereoscop view head posit track determin view hmd effect evok feel presenc total apparatu restrict view preclud environ stereoscop displai lcd shutter glass afford perceptu perform advantag fulli interfac user free interact displai inform displai resolut suffici task suppli user work comfort desk switch task ht object posit volum bound screen perimet extend front screen screen util displai obtain user activ interact viewpoint user confirm disconfirm perceptu ht simpl head movement easili natur chang viewpoint object view paradigm call virtual human factor experi enhanc percept interact task ht view compar flat screen document explor stereoscop view head posit track ht view enhanc percept interact suppli displai address system aid user perceiv structur interact system larg network system suffici displai resolut user control switch dimens task typic document retriev system displai user move stereoscop displai view document collect term read document remov apparatu web access geograph inform system data geograph inform system rich inform censu busi highwai data inform store format includ text typic gi softwar displai inform dynam graphic wai tradit mode oper data access specif gi applic singl platform recent accept avail world wide web natur build linkag distinct world gi www order make wealth inform gi world publicli www system intend bridg gap exist gi softwar www access distribut dataset convert data form www access server distribut gi dynam updat inform www automat retriev user access gi data interact internet local gi function provid function ffl period extract geograph inform gi store inform local disk type amount inform extract base access statist frequent referenc inform extract store retriev demand save disk space network traffic ffl period collect inform gi server send www server process gi server www server connect internet ffl receiv data gi inform convert format recogn www server ffl commun www server displai inform user request structur consist number compon compon act independ process commun internet protocol major compon extract inform gi server request messeng accept raw gi inform gi server parser gi inform html format store local disk gatekeep act interfac local www server coordin main rest function compon figur show structur detail descript compon gatekeep parser convert data messeng gi data www server www server www server www client convert coordin figur softwar structur work close gi compon extract inform send main compon interact gi understand format structur gi inform commun rest world standard protocol compon written nativ program languag avenu messeng commun gi server accept inform inform imag messeng simpli data binari stream header data store local disk separ file parser convert gi inform receiv messeng format recogn www server includ convert plain text convert tabl html compat convert imag gif format parser build text gatekeep interfac local www server user request retriev inform file gener parser displai proper format user screen compon cgi script format order commun compon properli main program coordin activ compon parallel web search machin learn web search engin combin rank capabl search mechan similar user request number search servic internet parallel start process target search engin process work search engin process process contact search engin send user request search engin queri format individu process correct format order commun search engin process establish connect search search result back search engin process receiv larg volum data result process machin learn approach locat answer present user machin learn approach web search gener text search robot lyco engin extract keyword standard algorithm base word word frequenc statist indic provid advanc tool detect word word mean user eagerli flock indic navig sift growth web document subsequ gener text search built machin learn approach face problem label sampl techniqu uncertainti reduc amount label data elimin label problem cluster techniqu requir label appli successfulli larg collect web offer fertil ground document cluster research cluster techniqu weaker input data mine produc weaker output machin learn point suffici larg sampl label exampl identifi target concept machin learn theori attack problem web major obstacl data abund web unlabel solv label user train machin learn algorithm search web machin learn algorithm identifi concept show user label posit desir user label neg receiv input algorithm interact refin search find concept user process repeat inform user found approach dialog user search algorithm machin learn user label guess concept search algorithm target concept desir desir home repres rectangl discret vector exist machin learn theori appli web search machin learn algorithm work fast practic investig solut user provid feedback label guess concept search algorithm parallel search dimens time repres document web vector featur repres document imag document repres vector imag vector space dimens show home page imag repres rectangl establish vector space design machin learn algorithm identifi rectangl vector space environ show algorithm good implement softwar search web find desir inform work fast interact web structur facil support activ engag hypertext reader function characterist hypertext facil widespread web describ issu address hypertext system identifi dynam structur extens import compon user move system spatial conceptu structur hypertext document content suggest approach architectur hypertext document top level index inform bottom level content node link consist set indic link index term describ requir inform object underli retriev examin dynam user creat searchabl index engin dynam open index connect inform resourc individu sort function suggest augment web structur goal index reduc cognit overhead user defin index base understand index term semant inform relev user index system track node link conceptu provid navig tool conceptu space addit abil index relev user index creat author simplest term user facil construct index web document user defin list index make annot link relat concept context educ set primari function index process provid set term document reflect user conceptu domain effici effect retriev inform document system function suppli mechan creat node annot link point exist web document altern link exist web node addit term link point exist document content retriev manner similar architectur hypertext document top level index inform bottom level content node link implement set indic link index term describ requir inform object underli hypertext document base retriev examin retriev inform manner retriev navig select index inform hypertext base link displai browser annot displai browser inform retriev relat concept facilit retriev semant relat materi user move directli desir inform access relat inform rememb link structur detail reflect user conceptu index term consid link term relat concept term set index system express local relat cluster node creat index web document static explicit model link marker fulli user creat virtual structur model hypertext user defin index scheme virtual user defin term level annot capabl hypertext base level index made set index entri index entri consist term descriptor keyword suppli locat html annot set relat term descriptor term descriptor gener specif desir user index term focu set relat concept descriptor broaden refin concept repres focu index term focu term set relat concept creat structur support queri navig indic provid access requir inform navig document space index term defin index term node creat insert index level link made node locat hypertext document user node link annot provid space user make annot term index term user defin relationship index term index entri relationship link creat focu index term node relat entri node creat set index entri node link assumpt link creat user perceiv relationship index term repres node user percept concept materi user modifi index term network ad delet link node user defin relationship entri serv user defin thesauru index term distinguish synonym relat concept facil set index entri node navig explicit retriev inform user make annot term entri index annot explanatori materi extend origin document part actual document text annot modifi time user knowledg percept chang index scheme incorpor level implement level inform sourc index applic creat user defin conceptu client virtual architectur chosen simplifi modif system user interfac store user creat index structur file server index applic retriev inform creat user defin java javascript support user interfac user applic feel part pdp design hypertext document invok index option pdp hypertext applet download applic execut user inform index structur creat final user index command exit index engin displai queri tool inform retriev content retriev manner similar architectur hypertext document top level index inform bottom level content node link implement set indic link index term describ requir inform object underli hypertext document base retriev examin retriev inform manner retriev navig select index inform hypertext base link displai browser annot displai browser inform retriev relat concept facilit retriev semant relat materi user move directli desir inform access relat inform rememb link structur detail reflect user conceptu index term consid link term relat concept term set index system express local relat cluster node futur work report index mine softwar architectur data index mine integr environ present user unifi view inform servic user issu inform servic call softwar compon provid servic request depend type servic call softbot action satisfi user request extens architectur research develop add softwar compon increment includ compon document explor analyz text inform larg document collect present user suit visual tool extend hierarch index scheme popular browser user build searchabl index parallel web search engin novic rank index algorithm provid user accur search result shorter time user access gi data web investig implement issu design make softbot seamless behavior individu compon open servic internet interest refer snapshot harmoni eurograph symposium open distribut springer verlag inform harmoni internet inform lo ieee displai techniqu data present eurograph learn world wide work note aaai spring symposium inform gather distribut aaai stanford task perform fish tank virtual acm transact inform infrastructur global seventh acm sigop european workshop system support worldwid septemb access onlin design journal american societi inform layout algorithm ieee transact softwar logic queri languag hypertext european confer structur state knowledg document retriev acm acm virtual environ inform eurograph supercomput seventh acm sigop europ workshop system support worldwid septemb harvest inform discoveri access intern world wide web pp peter aid search european confer learn rectangl union machin special issu acm annual confer comput learn page parallel comput acm workshop java scienc engin june measur memori journal approach design document retriev journal american societi inform approach larg document fifteenth intern confer research develop inform page pathfind pathfind associ studi knowledg ablex di draw annot comput draw direct ieee workshop visual lo ieee heurist graph theori comput mathemat educ program environ system research gold commun novemb kdd process extract knowledg volum commun novemb explor visual www document term technic report depart comput texa pan rh electron creat learn world confer educ telecommun jl visual www semant content queri webnet world confer web societi va wal rh approach comput scienc educ unifi program journal educ multimedia augment static web user defin content link submit public set prime geograph resourc analysi support internet inform lo ieee acm siggraph confer acm issu gener hypermedia system commun resourc knowledg discoveri global inform scalabl multipl layer forum research technolog advanc digit librari visual user interfac support fulltext acm acm visual inform inform lo ieee subject scan mechan modern onlin acm acm algorithm draw gener undirect inform process work note aaai spring symposium inform gather distribut aaai stanford spring model algorithm posit node undirect graph technic report depart comput texa pan text classifi uncertainti seventeenth annual intern confer research develop inform circular intern journal comput role digit librari teach commun april probabilist inform retriev journal associ comput spatial user interfac internet aac gap gi poster present sixth intern world wide web april santa california theorem list complex hypermedia network multipl hierarch chi acm structur world wide web hyperbol geometri minnesota learn student experi theori student knowledg american educ research understand inform journal intellig inform vol psycholog educ psycholog guidelin school redesign reform visual interact commun browser direct softwar practic automat text retriev inform comput mosaic global hypermedia protocol pathfind associ studi knowledg organ ablex network structur proxim data bower psycholog learn advanc research academ press imag browser world wide proc ieee workshop access imag video metacrawl architectur resourc aggreg ieee expert sparck statist interpret term specif applic journal di graph draw readabl ieee transact understand gi system research supercomput januari stereo motion cue visual inform net acm transact composit multimedia preliminari studi confer educ multimedia
DB/1408 3 gatewai uniform web base access remot resourc geoffrei tomasz erol praveen parallel architectur center abstract exploit experi develop design gatewai system provid seamless secur access comput resourc asc gatewai commod compon implement modern system tier highlevel front end visual data analysi visual built top web oo commod standard distribut reusabl web server object broker middlewar form tier servic tier access comput resourc provid implement emerg standard api introduct year grow power capabl commod comput commun technolog larg driven commerci distribut inform system abstract model larg independ client connect distribut network server high perform obtain combin concurr middl tier parallel server result system combin perform applic rich function commod system commod technolog area impress rapidli improv softwar artifact import raw set standard open interfac enabl develop distribut modular softwar interfac low high level gener power softwar environ larg preexist compon quickli integr applic incent build environ natur inherit commod capabl applic benefit impress product commod system term approach high perform commod comput relat paper design demonstr achiev simultan high perform function commod system aspect activ specif program environ develop offer visual metaphor seamless composit distribut high perform dataflow applic reusabl comput modul editor applet offer intuit metaphor instanti middlewar repres visual icon activ editor interconnect visual form comput familiar av user middlewar mesh java web custom extend support session modul connect manag modul java interfac comput java class wrapper servic part tier implement globu toolkit applic quantum mont carlo simul develop collabor ncsa matter physic laboratori chain applic commerci packag gaussian custom run repeatedli data set applic run multiprocessor platform input output file move machin output file applic chain input suitabl format spite success project origin base java web suffer sever limit obviou area achiev improv fault toler secur add complex complex extend customari protocol exchang data industri standard javabean corba industri standard secur commun protocol base ssl develop system coincid initi develop intern standard seamless desktop access remot resourc standard replac remain custom comput graph gener front end abstract task specif specif globu interfac api implement part project aeronaut system center major share resourc center sponsor dod modern program environ train object project provid seamless secur access comput asc resourc interfac function gatewai system section section present system architectur descript major compon section discuss gatewai secur model section reveal detail implement section link relat section offer summari overview gatewai function gatewai system offer program paradigm implement virtual applic independ develop modul modul implement follow distribut javabean model user complet power program implement modul function function modul implement java exist applic written languag java easili encapsul javabean modul develop limit knowledg system modul run concern issu alloc run modul creat connect send receiv data run modul concurr machin gatewai system hide manag coordin function concentr modul develop modul serv proxi servic made gatewai system access provid jdbc deleg implement modul function dbm follow similar approach provid access gatewai modul implement api servic provid globu toolkit modul serv gram resourc alloc proxi gener resourc alloc request request essenti defin standard error output target machin execut run applic repres execut develop independ gatewai system legaci parallel code written fortran role gatewai modul written java reduc gener request globu resourc specif languag syntax gatewai system regard visual user interfac job broker globu system gatewai system support program model distribut comput dataflow model dataflow regim gatewai applic comput graph visual edit end user modul applic exchang data input output port similar av model gener implement gatewai system fact modul behav distribut modul invok arbitrari method modul involv comput gatewai architectur gatewai system implement modern shown fig tier front end visual data built top web oo commod standard distribut reusabl web server object broker middlewar form tier back end servic tier perform servic implement toolkit globu front end class applic requir function front end design gatewai system support flexibl author tool problem solv environ dynam creation preexist highli special custom frontend meet specif applic support comput gener objectori simpl approach flexibl achiev treat front end implement gatewai api gatewai api gatewai api user task form abstract task descriptor current recommend construct arbitrari number subtask lowest task correspond atom oper middl instanti establish interact object event bind case detail hidden gatewai api interfac submit singl job make file transfer user resourc complet requir target resourc satisfi order capabl execut job identif alloc resourc left discret system middl tier deleg servic extern schedul resourc abstract task descriptor job specif middl tier middl tier mesh gatewai server gatewai server maintain session user creat control applic servic provid mean control life cycl modul establish commun channel modul creat local remot host case task modul instanti initi transpar deleg peer gatewai server select commun channel adjust servic provid middl tier includ method submit control method file method provid access mass method queri statu statu user compon gatewai modul gatewai modul corba object conform javabean model function modul implement directli bodi modul modul serv proxi specif dbm servic servic servic standard develop initi specifi mandatori function system figur gatewai system architectur interfac globu toolkit servic function provid includ secur resourc alloc secur file transfer directori servic monitor gatewai secur model gatewai system support secur model compon secur web access system establish user ident credenti compon enforc secur interact distribut includ commun peer gatewai server deleg credenti compon control access resourc secur web authent author implement secur web transact http protocol commod secur web server server configur mandat mutual authent make user accept server certif present certif server commerci softwar packag certif gener user sign gatewai certif author author process control server express enforc access polici requir central enforc administr author architectur optim support secur servic distribut network environ compon secur servic access author user gatewai server polici defin repres stakehold access peer gatewai server access servic control independ compon gatewai secur base credenti gener initi contact gatekeep secur middl tier secur secur featur corba built directli orb easi user credenti secur oper distribut object enforc transpar includ author option secur term mutual access control base access control list provid mean defin polici individu user group defin method object comput domain role user assign polici defin access distribut object control stakehold corba secur servic access user credenti access resourc control owner resourc gatewai system system forward credenti corba secur servic interfac omg specif neutral respect actual secur technolog implement top pki technolog privat kei technolog implement mention popular distribut object inher secur tradit system enhanc risk level fact object deleg part implement object dynam object serv simultan client server implement object chang time origin programm care polici privileg deleg import element system secur corba flexibl support deleg model intermediari object simpl deleg model intermediari object imperson composit deleg intermediari object combin privileg follow composit model intersect client intermediari privileg applic appli secur make initi credenti control access back end resourc wide accept standard secur access resourc comput center appli design goal gatewai system preserv autonomi resourc owner defin implement secur polici similar situat similar research group provid secur access remot resourc strategi particip process defin standard common allianc pki infrastructur current prefer build futur standard top specif support simultan privat public globu project pioneer globu gram provid secur access remot resourc obtain access resourc gram user present certif sign globu ca addit item gatewai user set middl tier gatewai middl tier network gatewai server secur access system facilit dedic gatekeep shown gatekeep server gatekeep logic web gatewai server user access gatewai system portal web page gatekeep web server portal implement compon gatewai user authent gener user credenti eventu grant access resourc author process control server author web server creat session instanti user context gatewai permiss download applet applet creat control user applic iiop commun directli gatewai server secur apach web server servlet support servlet support base difficult instal configur apach server choic develop experi secur jigsaw server refer web server implement written support servlet mechan jigsaw http support build top ssl librari java institut appli inform process commun technolog implement gatewai server secur obtain free research secur servic implement top ssl jigsaw gatewai server gatewai server initi orb gener corba specif gatewai servic main function gatewai server manag gatewai session session establish automat author user connect gatekeep creat user context user context object store user applic applic object store compon user applic applic compon singl gatewai modul applic context gatewai server simultan manag user defin applic hierarch modul gatewai server maintain persist directori modul list modul read configur file initi gatewai replac run time gatewai server maintain directori activ gatewai server servic iiop http iiop ws gatekeep front end back end servic back end servic back end servic back end servic gs gs gs gs gatewai server secur web server server fig gatewai middl tier architectur provid directori made front visual select modul modul connect includ applic inform modul implement life cycl user modul creation user modul deleg lifecycl servic actual instanti modul depend local remot modul local modul factori run separ process creat local modul remot local proxi modul creat copi applic context remot gatewai server instanti modul remot host local lifecycl servic creation proxi modul break corba object locat transpar java make differ local remot object reason introduc proxi modul provid support control behavior modul front end applet direct commun applet host gatewai applet violat java sandbox secur model employ sign applet potenti solv proxi modul forward messag result consist secur model reason proxi modul control applic simplifi implement fault toler local gatewai server refer newli instanti modul modul factori proxi object refer return user user access remot modul proxi process modul creation final regist modul refer applic user context modul directori oper perform servic remov object refer directori destroi modul case remot proxi destroi interact gatewai modul gatewai modul follow javabean interact javabean method event properti properti bind event commun inform chang state bean event form core compon javabean architectur larg enabl bean plug build block applic builder event notif java work method invoc object sourc event call method destin object event event trigger destin messag implement method notifi event occur event object encapsul inform event event target connect event sourc registr mechan gatewai applic creat dynam independ develop gatewai modul provid support dynam event bind base standard corba dynam interfac invoc dynam stub invoc mechan implement introduc event adapt applic context adapt maintain bind tabl associ event sourc actual event destin relat work project address solv problem seamless access remot resourc list web site mention close relat project project introduc excel model abstract task descriptor strongli influenc standard similar approach middl tier network java web server project implement web access remot resourc cgi script project http protocol user authent implement custom solut access control project aim multidisciplinari design intend corba implement middlewar descript secur model summari exploit experi develop design provid seamless secur access comput resourc asc preserv origin implement tier order strictli conform standard corba javabean model build middl facilit seamless integr commod softwar compon connect typic commod softwar compon distinct featur gatewai system appli commod compon strategi incorpor system gatewai architectur implement emerg standard interfac defin provid uniform secur access resourc conform abstract task descriptor specif enabl seamless integr visual author tool prototyp gatewai system fulli function version expect deploi novemb work collabor ken ohio supercomput center bill dayton origin gatewai concept develop dana technolog larg develop arl dod high perform comput modern program major share resourc center program environ train activ ncsa allianc dod modern contract number nichol research nichol research corp system compani refer perform commod grid blueprint comput book edit kesselman san geoffrei hasan perform commod comput pragmat object report publish visual program paradigm base grain distribut practic globu home program environ visual author toolkit high perform distribut supercomput java grand home distribut access control home apach http home org java apach home jigsaw http home object orient home websit maintain von uniform access comput home interfac highperform comput home home gatewai project home page html
DB/1409 3 world semant disjunct edward pf chan depart comput scienc waterloo canada juli abstract investig fundament problem ground atom disjunct assum basic approach infer neg inform disjunct minker gener close world assumpt ross topor disjunct rule problem gcwa disjunct interpret intend interpret interpret disjunct argu approach satisfactori disjunct interpret explicitli neg inform infer state intent disjunct semant call pw solv problem show proposit neg problem determin neg ground liter infer gcwa problem solv effici pw gener problem pw relationship pw highlight disjunct interpret unpredict gcwa gcwa interpret disjunct assum head bodi consist atom introduct queri answer gener requir posit neg inform neg inform numer rel posit inform avoid store vast amount neg data commonli repres implicitli infer rule horn deduct gener deriv neg inform disjunct situat satisfactori minker gener close world assumpt wide consid semant disjunct gcwa reduc reiter close world assumpt definit gcwa extend wai extend gener close world assumpt neg neg infer minim model atom reduc gcwa neg ground liter gener assumpt appli subset predic recent work stratifi neg liter bodi impli rel prioriti assign predic relat comput order assign perfect model semant gener gcwa neg liter bodi reduc gcwa function symbol bodi head posit work base minim model semant ross topor observ gcwa undesir properti gcwa interpret disjunct intent interpret disjunct rule disjunct shown weak gener close world assumpt stabl model semant semant attempt assign natur mean normal logic program semant extend disjunct weak semant strong semant strong semant gener gcwa infer subset perfect model semant disjunct weak semant gener coincid neg liter bodi approach infer neg uncertain inform disjunct neg uncertain data infer depend frequenc model state ground atom infer provabl state infer state fa cg gcwa studi approach rigid interpret disjunct atom disjunct predic extrem extrem violent gener rule extrem rule state suspect violent suspect extrem danger evid crime scene suggest suspect violent person uncertain inform record disjunct atom result state disjunct minim model state minim model world gcwa atom violent simultan true world atom extrem consid gcwa assum disjunct impli minim model atom true disjunct interpret intent interpret disjunct interpret gcwa overcom altern call disjunct rule ross topor interpret disjunct argu correctli infer neg inform disjunct evid suggest suspect violent person state repres scenario extrem worth note neg repres interpret disjunct disjunct interpret neg infer process neg liter infer infer imposs violent semant call pw overcom problem gcwa disjunct interpret neg inform infer state intent sakama studi problem model semant turn pw sakama model semant prove pw introduc section order evalu ross topor criteria comparison effici effici deal question easi determin neg datum infer infer rule left open question gcwa settl question show proposit neg problem determin neg ground liter infer gcwa problem solv effici pw gener problem pw section defin notat paper section review result gcwa section studi section defin pw studi properti section highlight import relationship assumpt section show pw interpret disjunct condit identifi gcwa interpret disjunct drawn section definit notat introduc notat discuss section assum familiar basic terminolog theori logic program relat notat atom liter defin usual manner function symbol formula form atom variabl assum quantifi front assum head bodi head singl horn disjunct head bodi empti neg head empti neg consid integr constraint neg written section neg ad repres disjunct pw posit bodi empti mix head bodi finit set horn consist horn disjunct denot herbrand set ground atom subset call herbrand interpret interpret db set herbrand interpret db model db db true minim proper subset model db minim model dbg db consist model exist db inconsist denot db model db model ground posit minim deriv db db db atom posit minim deriv ground true current inform determin denot set posit minim deriv ground db remaind interest semant set simplifi assum consist proposit ground assum instanti constant db pc mc mc nc set posit ground mix ground neg ground gcwa horn reiter cwa state neg ground liter infer deriv cwa logic ad compon deriv dbg store explicitli easi show reiter cwa work disjunct db fa bg impli db db inconsist minker suggest gener version reiter call gener close world assumpt assumpt defin semant syntact version prove gcwa base idea minim model semant definit gcwa db consist ground atom infer minim model db minim model denot world db fa world repres db set minim model atom true world assum db minker gcwa close relationship class posit minim deriv ground herbrand base set aj ground atom syntact definit gcwa syntact definit gcwa db consist ground atom infer theorem establish version gcwa theorem db consist ground atom iff minim model db consist augment import properti gcwa theorem db consist db consist theorem db consist posit db iff db theorem state deriv posit db db proven db due fact ground atom minim model db infer neg liter proven db theorem db consist ground atom db iff trivial theorem minim model db model db essenti find algorithm determin ground atom work problem method base find resolut set problem intract show prove complement set ground neg discuss intract interest reader refer assumpt function symbol problem shown theorem db consist posit mix ground ground atom determin infer gcwa theorem deriv iff minim model db prove determin minim model db prove reduc instanc hit set problem problem hit set demonstr fs set subset finit set hit set subset hit set problem determin set exist instanc hit transform db set ground atom db fb fb dg disjoint fg distinct member ig set iq fa iq ij ij db fa jq jp jq jp db db consist set ground atom db model db show import properti db fact minim model db assum minim model fcg claim model db occur db true model contradict minim model db fact model assum model db true ij true ij impli iq contradict fact model ij ij trivial true fact minim model db ij ij distinct ground atom ip iq ip iq impli true fact readi show hit set exist iff minim model db minim model db claim hit set fact claim hit claim fb cg minim model db true assumpt hit set element true ip iq ip iq ip iq true model db prove minim remov element falsifi fact delet falsifi true minim model db disjunct rule studi disjunct rule introduc ross topor definit call weak gener close world assumpt present defin syntact fixpoint definit show problem determin ground neg liter deriv solv effici neg gener requir concept close set db observ head assum true close set set atom assum state db subset close set db element ground instanc db head exist atom bodi easi greatest close set exist obtain union close set db greatest close set db denot db definit close close set close set close syntact definit db ground atom infer defin fixpoint definit requir map tdb herbrand interpret db db herbrand interpret db tdb ground instanc head bodi defin tdb tdb tdb tdb tdb worth note tdb comput effici techniqu discuss tdb bg tdb tdb fg tdb fg notic neg tdb fixpoint definit db consist ground atom infer tdb denot tdb consist augment properti similar gcwa theorem definit tdb theorem db consist db consist theorem db consist posit db iff db lemma model tdb model db theorem db consist bm db db proof theorem import properti gcwa logic set neg ground atom infer db ag db fag db db logic infer db consid db repres world fag bg possibl assum possibl true db assum fundament question determin neg ground liter infer semant result show problem solv effici neg gener case theorem db consist ground atom db iff db tdb trivial theorem lemma db consist neg db db neg model db theorem db consist neg determin deriv time polynomi size db theorem lemma db iff tdb tdb comput theorem theorem db consist ground atom determin deriv theorem db iff db tdb show determin db problem theorem db iff db tdb db iff model db tdb comput effici problem np prove reduc instanc hit set problem problem fs set subset finit set instanc hit transform db set ground atom db cg disjoint fg distinct member ig set iq fa iq fa jq jp jq jp db consist db true interpret fcg observ tdb set ground atom db theorem db iff db tdb tdb db iff db claim db iff hit set exist fs hit set exist fs fbg model db db db model db true jm jm hit set exist fs world semant pw overcom problem gcwa shown neg correctli infer inform disjunct db tdb set neg ground liter ad db independ neg neg inform ad state state semant call pw overcom problem gcwa section give world definit fixpoint definit show section prove sakama model semant pw final studi properti pw section world definit fixpoint definit pw understand correct essenti world expect repres set db world repres observ world set assum true atom set form model db dg dg world satisfi interpret dg world necessarili model restrict atom db world repres atom world true set world world set posit assum true fact logic consequ subject restrict neg give formal definit world db captur essenc model atom logic consequ assum true fact bm mix fa fb bm denot subset note call step db pc mc consequ set ground atom respect db finit sequenc step satisfi db fcg consequ fdg consequ cover consequ respect db ground atom posit sg world db subset consequ cover model db consequ give rise world consequ fdg give rise world db dg model notic tdb defin section world tdb model db subset satisfi neg give rise world atom world proven consequ consid true world refer atom proven true world part world world fbg world empti consequ fbg rise fbg fbg model db world dg ffg consequ fag set model db notic set minim model db world consequ fag deriv set dg symbol world bg world model world model db world gener db world repres true true world ffg world ground atom true world world world db fw world dbg aj ground atom world dbg possibl ground atom dbg corollari possibl directli definit possibl world definit pw db consist ground atom infer augment neg ground liter posit counterpart true defin fixpoint kernel subset model pc set gener set set denot point deriv neg horn transform set horn fb set horn transform denot union horn transform subset maxim horn db kernel fcg db finit set maxim horn fixpoint definit pw db consist ground atom infer set maxim horn db theorem definit pw world construct consequ rise consequ transform step horn step replac step horn union transform step claim maxim horn transform show suffic show kernel consist trivial model db show observ minim model model assumpt logic impli model subset maxim horn db mix mix construct step consequ kernel construct step result consequ cover remain shown model db maxim horn satisfi posit trivial similarli neg includ consist neg db satisfi satisfi mix element maxim horn impli contradict satisfi model world db sakama model semant pw sakama model semant disjunct turn sakama semant pw defin sakama model semant disjunct recal fb fa split set horn subset gg split db obtain db replac disjunct db horn split model db model minim model split db sakama model semant db consist ground atom infer model db show sakama semant pw prove model world theorem db consist model db iff world db world db model db show minim model split split construct rise consequ observ mc ci append step chang loss assum mc replac atom replac horn mix replac horn split db result db transform db split db easi minim model split minim model split db db set ground atom db sequenc mix db involv comput minim model mix mix construct step consequ construct step model world db corollari theorem procedur semant defin pw properti pw studi world semant point pw coincid neg pw illustr show close relationship model world world model theorem show model world result directli correct algorithm algorithm model find subset world db db world db mc mc end output observ fact loop execut consequ cover condit statement fact fact final output world db show show model db model pc loop execut time mc partit fc fd mix process remov origin mc loop statement fact satisfi subset mean satisfi respect model mc nc satisfi respect subset nc satisfi respect model db fact world db theorem db consist model db world fact corollari minim world db definit minim model theorem theorem db horn pw coincid reiter cwa horn minim model db world set neg ground liter infer pw reiter cwa theorem db consist ground atom db iff world db model db theorem world subset contradict true model true world db theorem db consist ground atom db impli world db trivial fact world model db lemma atom posit world lemma db consist ground atom ground atom world db iff deriv db theorem deriv model element input algorithm produc world contradict denot set true atom fact consist augment atom theorem db consist db consist db model db theorem subset world db atom atom true model db lemma posit true model db iff true minim model db lemma db consist minim model db iff minim model db minim model db corollari minim model db world minim model db true model db subset db minim model db minim model db minim model db minim model proper subset minim model db similar minim model db contradict theorem db consist posit db iff db lemma lemma theorem theorem db consist ground atom db iff trivial assum db world definit world model db contradict result show problem determin neg ground liter infer solv effici neg gener proposit db consist neg ground atom problem determin infer pw solv effici theorem infer pw iff world db neg maxim horn comput theorem db consist ground atom problem determin infer pw theorem infer iff world show determin world problem show problem nondeterminist algorithm guess select subset sequenc step sequenc mix involv check verifi consequ comput final determin model db verif polynomi time prove reduc instanc hit set problem problem instanc hit db construct fs set subset finit set set ground atom db fb fb dg disjoint fg distinct member ig set iq fa iq ij ij db fa jq jp jq jp db show db consist interpret fb dg db ground atom true true trivial db consist readi show hit set exist iff world db world db subset fb consequ cover uniqu db fc element consequ deriv impli element db satisfi model db conclud hit set hit set fa fa fc fdg consequ verifi trivial fa dg model db world db complet proof pw investig relationship pw theorem db consist posit db iff iff iff theorem shown infer set posit impli consist true denot set wj deriv xg theorem pw tdb db monoton properti pw proper interpret disjunct pw disjunct atom interpret illustr exampl gcwa rigid interpret disjunct pw advantag gcwa interpret disjunct accomplish augment neg disjunct interpret disjunct interpret true bodi true interpret disjunct db interpret db augment set neg sc sc distinct atom head cg interpret interpret db obtain augment disjunct interpret notic consist db user specifi interpret mean true true augment set world captur correctli intuit disjunct interpret db show gcwa interpret disjunct claim db interpret disjunct atom expect simultan true minim model identifi condit gcwa interpret disjunct interpret db satisfi interpret condit wj consist extend world db world theorem consist assum disjunct interpret extend world db minim model minim model db satisfi interpret condit extend world db iff world world model algorithm section consequ cover disjunct interpret jw jw impli minim model minim model impli model db minim model easili shown minim model neg satisfi interpret condit minim model db satisfi interpret condit corollari world db satisfi interpret satisfi neg db world theorem consist disjunct interpret extend world db iff world db disjunct interpret augment db theorem trivial definit extend world gcwa popular infer rule infer neg inform disjunct problem gcwa inabl user interpret disjunct overcom problem interpret disjunct argu semant ground approach correct semant call pw overcom problem gcwa disjunct interpret neg inform infer state intent relat fundament question answer queri assumpt effici work problem studi pw show proposit neg problem determin neg ground liter infer pw solv gcwa problem gener pw comput pw desir gcwa assum neg liter bodi pw extend easili stratifi disjunct shown acknowledg author professor ao mendelzon wood stimul discuss author anonym construct suggest author member institut robot intellig system acknowledg support network centr excel program govern natur scienc engin research council particip associ refer theori declar foundat deduct logic program morgan kaufmann lo pp versu minim deduct acm symposium principl system pp close world assumpt pp logic gallair plenum pp mh semant predic logic program pp comput guid theori san stabl model semant logic symposium logic program pp extend close world assumpt relationship parallel acm symposium principl system pp queri indefinit null advanc comput vol theori jai pp foundat deduct logic program morgan kaufmann lo pp combinatori complex comput comput miller jw plenum pp foundat logic program symbol comput declar semant logic program foundat deduct logic program morgan kaufmann lo pp world intern confer principl knowledg reason morgan kaufmann lo pp indefinit close world lectur note comput scienc pp semant stratifi deduct foundat deduct logic program morgan kaufmann lo pp gener close world depart comput colleg novemb journal autom reason close world data logic gallair plenum pp logic reconstruct relat conceptu model ml mylopoulo jw pp ka found semant disjunct logic intern confer deduct neg inform disjunct journal autom reason pp model semant disjunct intern confer deduct pp comparison clark complet data base reiter close world journal logic program pp principl vol comput scienc van failur tight deriv gener logic foundat deduct logic program morgan kaufmann lo pp van set semant gener logic acm symposium principl system pp van altern fixpoint logic program acm symposium principl system pp journal autom reason pp
Agents/1410 1 extend agent uml protocol diagram agent art group liverpool liverpool unit kingdom introduct agent multiag system interact order perform task cooper coordin interact driven interact protocol protocol inherit commun protocol consequ formal descript techniqu emploi state machin petri net languag languag loto languag sdl tempor logic formal repres interact protocol point miss quot bauer previou argu uml basi model agent system due compar agent activ initi control process extern request agent act isol cooper coordin agent multiag system social commun interdepend member act class formal descript techniqu order tackl point cool exampl belong class graphic model languag emerg recent agent uml extens uml uml directli weak repres featur languag model languag associ fipa replac uml sequenc diagram protocol diagram agent uml standard evolv aim paper present featur featur deal reliabl trigger action except handl featur fact due work electron commerc suppli chain manag appli featur suppli chain manag remaind paper present agent uml protocol diagram present inspir paper refer protocol diagram section present featur add current give english auction protocol section section conclud paper present futur work protocol diagram agent uml notion encompass protocol agent agent constraint messag protocol unfold notion explain section agent agent role agent protocol diagram repres repres ident call instanc agent repres role protocol auction seller particip call auction repres ident role agent class complet role role reduc size diagram ident role share role agent protocol diagram box text instanc role class auction figur initi particip vertic bar messag role deadlin particip fipa contract net protocol inform cancel particip initi deadlin fig contract net protocol agent uml lifelin agent repres lifelin correspond particip protocol lifelin creat role activ protocol lifelin present long role action protocol lifelin vertic bar drawn vertic bar role link vertic bar figur messag lifelin split merg altern protocol path merg case figur answer agent uml connector interact protocol design logic connector describ altern choic figur connector figur mean messag concurr connector figur xor figur choic messag connector mean messag chosen connector xor mean messag chosen term ca refer commun act fig agent uml connector notion notion present protocol put condit send messag english auction protocol figur condit messag variabl greater messag condit insid curli bracket design abil send copi messag open auction protocol multipl send messag mean multicast number close vertic bar role send messag number number close vertic bar role receiv messag correspond number copi type messag asynchron figur messag synchron figur possibl messag receiv instantan delai figur fig type messag agent uml insert comment instanc start cfp time diagram figur repetit figur messag request payment curli bracket number repres time messag valu rang current price reserv payment request nest interleav protocol link protocol solut agent uml protocol nest protocol interleav protocol nest protocol correspond protocol protocol case repeat time protocol nest protocol continu condit hold interleav protocol correspond protocol call execut protocol bauer al give auction particip request inform bank account featur work domain electron commerc suppli chain manag featur present agent uml list broadcast synchron trigger action except handl time manag atom transact messag send receiv acknowledg receipt featur explain detail section describ includ agent uml broadcast term broadcast mean messag undetermin set agent sender unabl quot agent messag agent network mistak broadcast mechan multicast agent sender set agent mechan present agent uml protocol diagram design insert number agent arrow broadcast repres arrow circl figur broadcast appli structur hierarchi commun messag structur structur adorn close seller buyer fig broadcast protocol diagram broadcast manag task contract net protocol announc task auction inform agent auction begin item sell agent servic jini synchron synchron agent protocol decid assumpt assumpt synchron agent meet point interact agent reach point agent follow interact synchron repres arrow cross vertic line figur synchron realiz messag label arrow trigger action trigger action manag present similar except manag repres situat normal path interact note except trigger action repres abnorm situat situat occur send messag action trigger action ascend price bid seller buyer fig synchron protocol diagram auction agent send lower current price auction warn agent error send messag except messag endang auction trigger action locat arrow insid figur condit trigger action written messag condit true condit written ocl formal text bid max seller buyer fig trigger action protocol diagram trigger action appli suppli chain manag agent worker task time messag dispatch agent inform situat except manag notion except bare interact protocol situat commun protocol cite articl moor notion except protocol import design rid abnorm situat improp protocol system perform slow notion except refer behavior expect behavior case agent answer interact perform belong list perform state interact receiv except send messag sender case system perform drop answer time interest insert except deal delai messag delai messag greater except except interact stop termin case receiv previou messag disconnect network figur except repres protocol diagram design insert keyword except except design insert keyword except delet except written textual except timeout except timeout seller buyer fig except protocol diagram except suppli chain manag client agent cancel order negoti moment cancel stop protocol place order time manag current protocol diagram repres delai deadlin describ deadlin note comment deadlin contract net protocol receiv figur insert time manag applic domain multiag system interact protocol electron commerc negoti interest deadlin interact stall agent disconnect network case negoti longer progress except negoti stop deadlin insert begin protocol diagram agent role appli interact deadlin keyword time delai delai interact figur give delai messag agent uml comment give delai insid arrow keyword figur bid seller buyer seller buyer time fig time manag protocol diagram time manag except conveni deal delai agent trigger except consequ atom transact atom transact term electron commerc deal secur problem atom transact mean realiz transact link transact fail situat transact deliveri fail opposit insert atom protocol diagram insert messag packag figur messag properli messag cancel meet schedul person receiv sender cancel cancel perform messag receiv messag manag particip date atom fig atom transact protocol diagram send messag deliveri version messag deliv agent loss case receiv agent reach mean featur send messag receiv agent send acknowledg messag featur repres arrow plain circl figur featur agent acknowledg process protocol manag worker job fig send messag deliveri protocol diagram featur interest domain acknowledg correspond perform action messag protocol agent uml english auction protocol order exemplifi protocol diagram featur mean english auction protocol agent sell inform agent part interest auction auction begin auction inform auction particip item auction particip inform auction accept bid auction auction particip accept select agreement inform win round inform auction particip bid reject auction open till remain auction particip accept bid auction close compar current price item reserv price current price greater reserv item won agent accept bid auction particip inform auction close protocol agent uml shown figur protocol present fipa bauer al messag agent network broadcast fipa approach bauer approach send set agent repres protocol situat repeat messag detail item price deadlin bid arrow bauer al insert deadlin auction auction particip reserv understood reject accept fig english auction protocol agent uml comment auction particip answer understood messag messag auction particip send inform auction accept bid deadlin pass auction inform auction particip won round accept lost round reject winner auction particip accept bid auction agent accept item higher price auction close auction inform auction particip current price greater reserv inform auction particip accept bid win item main version trigger action condit end auction bauer al model complet fipa present model languag describ interact protocol call agent uml extens uml advantag languag graphic base languag wellknown programm compani programm pass agent uml develop uml interact protocol protocol diagram agent uml agent ident role fipa fipa agent send messag understood understand content messag messag function mean paramet action unfold interact lifelin repres path interact work domain electron commerc multiag system suppli chain manag featur present current version agent uml trigger atom transact send messag acknowledg paper show repres protocol featur agent uml featur submit insert agent uml featur accept agent uml insert agent uml exchang format languag model check process featur suppli chain manag refer sun austin thing word clarendon barbuceanu fox cool languag describ coordin multiag system intern confer system page san june aaai press bauer extend uml interact protocol submiss call fipa version fipa odel agent formal multiag interact ciancarini softwar engin odel extens uml protocol multiag interact intern confer multiag system page peng model agent color petri net autonom special workshop davi smith negoti metaphor distribut problemsolv dignum messag protocol dignum european perspect agent mediat electron commerc springer dinverno luck contract net system de veld agent break maamaw number lectur note page fipa agent commun languag foundat intellig physic septemb fipa foundat intellig physic fisher wooldridg execut protocol cooper action intern work confer cooper system haddadi commun cooper agent pragmat volum lectur note comput scienc springer agent uml class diagram revisit technic report depart comput applic agent uml suppli chain manag technic report depart comput extend agent uml protocol diagram technic report depart comput languag exchang agent uml protocol diagram technic report depart comput model check agent uml protocol diagram technic report depart comput design system atal workshop agent volum lnai page juli algorithm translat interact protocol formal descript ieee intern confer cybernet confer octob describ multiag coordin protocol inherit seventh ieee intern confer tool page novemb moor polici except autonom special workshop bauer extend uml agent inform system workshop nation confer icu publish omg uml technic adapt base cooper learn system demazeau decentr volum page elsevi scienc publish bv
DB/1411 3 queri process move object grid storag model don amr el abbadi depart comput scienc santa barbara santa ca abstract grow popular mobil comput devic wireless manag dynam chang inform move object feasibl implement system manag inform algorithm ecient rang queri algorithm ltere step ecient determin polylin trajectori move object intersect rang nearest neighbor queri algorithm studi perform show ltere moder larg rang queri algorithm outperform algorithm ltere introduct recent urban mobil texa transport institut total congest cost major urban area billion hour delai billion billion excess fuel consum ga price year congest cost billion year lo california rank congest cost ny road slow growth answer solut set ecient oper deriv bene ts exist system ecient storag retriev move object manag system receiv signi interest advanc gp technolog wireless manag dynam chang inform move object feasibl grow popular mobil larg number vehicl equip devic inform speci section rout period time divert vehicl altern rout allevi reduc congest astronom applic bene dynam chang inform manag accur estim arriv time shortest path locat crucial manufactur inform dynam chang track vehicl current locat continu poll hard achiev futur locat move object model linear function time trajectori move object line segment domain futur locat move object determin poll locat regular interv aspect problem trajectori move object ect move object observ trajectori move object result interact move lead model trajectori polylin singl line segment develop model manag dynam chang inform summar model section implement system algorithm process rang queri nearest neighbor queri report perform algorithm queri process line segment commun samet store index line segment partit approach paper di erenc work line segment data static spatial object al model trajectori move object line domain space dynam index line pfoser al model trajectori move object polylin polylin deriv locat inform record past move object result interact move object system work pfoser al focu queri past focu work paper organ summar system section ecient rang queri algorithm nearest neighbor queri algorithm section section report result perform studi section conclud paper background previou work develop model manag dynam chang inform move object give reader summari system implement model rst explain assumpt data structur de nition data de nition assumpt made domain space move path network line space divid belong loss assum move object move line consid line move object move physic limit number vehicl section vehicl maintain intend veloc assum section rout prede ned function maximum veloc move object move maximum veloc function section return maximum veloc move object move section depend number move object section deriv function statist section partit domain space correspond time domain correspond space arrai cell max cell de ned rectangl note time nite maintain inform prede ned period time time shift time domain forward assum entri move object provid initi inform start start initi maximum veloc intend move move object system provid initi insert system polylin system return polylin inform hp data structur singli link list extra pointer point repres polylin move object trajectori entir grid implement arrai ecient support random access individu cell individu cell store identi er intersect move object veloc move object cell skip list store entir inform move object store call object store hashtabl object support frequent random access explain insert algorithm section de ne notat term entri point polylin intersect cell intersect denot entri point cell point ms polylin intersect rst time insert explain insert system initi inform rst cell repeat comput maximum veloc depend number move object adjust ms veloc veloc add entri point link list polylin cell intersect comput entri point insert identi er adjust veloc repeat step process cell destin belong complet insert process insert object return polylin inform case insert seri updat situat shown figur move fm system insert assum move object threshold move object reduc veloc cell object exist object reduc veloc base maximum veloc function updat cell move object updat execut figur show result insert move object case rippl ect check number object reach insert move object cell check maximum veloc function invok algorithm call provid pair continu insert nish algorithm work start rst cell maximum veloc chang insert move adjust inform move object veloc continu process cell time locat interv greater equal process cell insert updat past previou locat cell left process rst time lower cell locat rst figur rippl order figur rippl ect queri process describ queri process algorithm context grid storag model rst class queri refer rang queri rang queri retriev identi er move object speci ed space time domain class queri nearest neighbor queri signi interest design solut applic rang queri grid model rang queri crucial applic typic rang queri retriev move object locat time period answer rst cell intersect wai cell intersect partial intersect part answer lter involv read object store pointer make ltere step option answer quickli time critic applic give approxim answer cell cell cell satisfi intersect complet partial note move object insert multipl cell intersect multipl instanc move object cell store move object identi er skip list order identi appli merg sort algorithm merg skip list cell intersect approxim answer rang queri call approxim algorithm develop algorithm retriev move object intersect call basic algorithm figur rang intersect cell move object basic algorithm develop retriev approxim algorithm retriev ve object basic algorithm rst merg cell complet note cell sati es complet move object move object cell figur rang queri check intersect add answer set check ecient ltere note polylin correspond trajectori move object repres singli link list point extra pointer point rang repres note polylin monoton assum move object move forward time evolv properti basic idea ltere algorithm minim number comparison prune unnecessari comparison speci rst trivial determin start scan link determin return answer elimin comparison explain algorithm detail start scan link rst examin polylin trivial determin figur point depict figur note check check check trivial case start point figur trivial case point trivial case point figur trivial case check base determin start scan link list case left intersect illustr figur refer figur left boundari lower boundari note intersect upper boundari intersect lower left boundari check case base case start point area end point area figur filter rst left boundari scan link list start greater case omit step process point comput locat greater polylin monoton continu scan comput equal conclud note process step greater point polylin upper direct point due monoton polylin polylin monoton algorithm termin respect number point link summar ltere algorithm figur move object insert multipl basic algorithm appli ltere algorithm redundantli move object address develop algorithm retriev move object cell complet separ temporari result addit temporari list temporari object check found intersect order identi er object binari search algorithm search ad move object simplic class move object return return rst return return column continu left column return return return return figur filter algorithm cell partial check ltere algorithm intersect add add ecient retriev move object intersect call algorithm exact algorithm compar section nearest neighbor queri nearest neighbor queri receiv signi interest recent context tradit nearest neighbor queri execut static static queri point concentr nearest neighbor queri context move object queri point move object categor nearest neighbor queri context move object static dynam static nearest neighbor queri queri execut static spatial move queri point queri move object time ve nearest ga station process queri rst comput locat queri spatial store inform ga station comput locat time queri tradit nearest neighbor queri relat work type address paper dynam nearest neighbor queri execut dynam move object queri point queri point static dynam dynam queri convert static point time queri execut di erenti static dynam queri point give dynam nearest neighbor owner figur nearest neighbor queri groceri close store sell fresh decid potenti time gener queri type time move object term find smallest distanc polylin return move object figur ve move object fm queri point cell cell store object identi retriev polylin inform object store comput distanc move object move object cell order determin closer move object cell order distanc examin move object cell queri point belong sucient answer nearest queri assum examin figur fm answer nearest move object actual answer fm nearest neighbor queri algorithm address issu explain algorithm work store nearest neighbor order distanc move object time maintain list kn ecient process variabl kd distanc object kn denot comput jy locat exact rang queri maintain temporari list unlik exact rang queri move object belong kn cell queri point belong retriev rst move object encount insert kn updat kd note maintain kn order distanc maximum number object kn insert move object kn discard element kn remain rest move object comput insert kn updat kd move object cell store object order identi er distanc check cell decid search cell figur check cell sucient order cell order distanc border cell figur nearest neighbor kd initi kn initi cell gd distanc kd cell return kn dm kn kn dm kd dm dm updat fd distanc rst element kn kn kn dm kn kn dm id distanc ith kn kn kn dm kn kn kd distanc element kn figur nearest neighbor queri algorithm closer cell search discov search cell chang kn return kn answer termin algorithm decid search cell rst comput distanc cell distanc lower boundari cell cell upper direct upper boundari lower direct distanc greater equal kd nearest neighbor kn object search cell nearest neighbor term nearest neighbor term time appli algorithm di erent distanc metric jt time summar algorithm figur report perform studi nearest neighbor queri algorithm insert rang queri algorithm perform studi rst explain set section report perform studi insert crucial part system compar rang queri algorithm report result section report perform nearest neighbor algorithm paramet adt amt maximum speed moder heavi sever extrem tabl daili trac volum lane estim speed set system implement main memori solut data main measur perform system term run time machin dedic system system machin machin pc pentium iii top window implement system java run jvm version basic variabl ect perform insert size number row column perform di erent size row correspond section move object move column correspond time cell monitor road mile long minut grid manag inform move object road hundr mile long hundr minut grid monitor road minut monitor mile minut granular cell monitor mile minut variabl ect perform insert threshold maximum veloc function return maximum veloc move object move depend number move object cell maintain maximum veloc question number veloc number move object cell store reach answer refer urban mobil report texa transport institut categor congest extrem observ daili trac volum averag number vehicl observ dai averag speed vehicl tabl show averag daili trac volum averag speed mile congest level amt mean averag minut trac mean mile minut comput number vehicl mile maximum averag speed faster averag speed previou level set maximum speed correspond mile hour fast niti rst vehicl cell drive fast long slower vehicl ad vehicl reduc speed show perform result insert algorithm number runtim insert object number averag number invoc figur fix grid insert studi perform insert algorithm run averag number intersect cell averag number invoc fact close relat run time mention previou variabl ect perform size grid threshold show variabl ect system perform grid size threshold tabl base case maximum veloc function test assum section capac entir road mile mile depend vari threshold initi gener random number move insert object system repeat step time time averag figur show averag run time insert averag number invoc method note number method call averag run time method signi impact perform system note higher threshold number method call invok higher grid capac hold object number method call incur test averag run time insert start point system satur figur satur point system threshold test grid figur show averag run time insert object term run time grid size insert insert object due fact grid satur earli method call occur run time grid size number runtim insert object number averag number invoc number averag number cell object figur fix threshold number method call method cell process grid size figur compar averag number cell move object intersect maintain grid size due fact gener move object randomli result averag trip distanc turn similar case conclud grid size small handl object system grid size insert move object big practic monitor object unlik grid threshold depend section road system intend monitor manag studi perform rang queri algorithm nearest neighbor algorithm assum grid size threshold set percentag runtim algorithm object system basic exact percentag runtim exact algorithm db size exact exact exact exact figur rang queri algorithm rang queri algorithm nearest neighbor algorithm compar kind rang queri algorithm report perform studi show encourag result rst algorithm approxim return move object cell intersect rang expect fast ltere merg id cell store skip list basic algorithm work approxim algorithm lter move object intersect exact algorithm section rst explain set result assum grid size threshold initi insert execut rang queri rang gener random rang rang size row column grid grid cover mile rang rang mile minut reiniti repeat step averag figur show run time algorithm rang observ trend ect number object system analyz case system object percentag run time retriev object interestingli basic algorithm outperform exact algorithm rang queri reason due fact exact algorithm temporari list answer found object check found intersect access list call method insert move object list end intersect check overhead perform queri process number object process small overhead amort size rang queri larger exact algorithm ecient outperform approxim algorithm size rang queri greater perform gap diverg size rang queri grow figur show result run exact algorithm number object system run time percentag rang growth rate run percentag percentag answer approxim algorithm figur overhead approxim algorithm time linear respect approxim algorithm time faster exact algorithm queri rang factor queri rang size rang perform gap reduc queri greater exact algorithm begin outperform approxim algorithm determin algorithm accuraci candid algorithm speed figur show percentag answer approxim algorithm return size rang queri trend independ object system rang answer set approxim algorithm return answer return time answer true answer percentag answer rang queri figur reveal tradeo perform accuraci approxim algorithm perform size rang smaller domain space return larg amount answer algorithm return actual size rang small basic algorithm outperform exact algorithm exact algorithm size rang grow perform di erenc approxim exact algorithm rapidli diminish percentag answer approxim algorithm return time di erenc algorithm experi size greater perform di erenc approxim algorithm return answer conclud exact algorithm rang queri basic algorithm rang queri applic toler answer wait explain result perform studi nearest neighbor algorithm section execut rang execut knn queri time figur show averag run time knn queri number object system gure show queri time system time retriev runtim nearest neighbor algorithm averag number visit cell figur runtim nearest neighbor algorithm object test figur show averag number cell knn algorithm visit termin return nearest neighbor visit cell system number visit cell system knn algorithm visit cell futur work ecient rang queri algorithm part ltere algorithm determin mr comput knn queri algorithm test case perform conclud grid size small handl object big practic monitor object xed grid size threshold studi rang queri algorithm basic algorithm outperform exact algorithm rang small ltere exact algorithm outperform approxim algorithm size rang larg size perform di erenc algorithm futur work includ extend system space answer shortest path problem improv insert part futur work refer shaft int conf abbadi grid ecient manag move object storag retriev move object int conf mobil data abbadi approxim nearest neighbor search multimedia proc int conf data samet ecient process spatial queri line segment advanc spatial tsotra index move object acm symp principl nelson samet consist hierarch vector data acm aug theodoridi approach index move object trajectori int conf larg data skip probabilist altern balanc tree commun vincent nearest neighbor queri proc acm sigmod int conf manag lopez index posit continu move object proc acm sigmod int conf manag urban mobil report technic texa transport dao model queri move object int conf data wolfson base dynam attribut index method acm symp principl
Agents/1412 1 autom discoveri predict rule detect gui vasant le miller depart comput scienc hall iowa state ia work support depart contract mda abstract paper detail essenti compon distribut knowledg network system detect describ distribut detect complet data mobil static agent distribut facilit analyz view larg distribut system agent detect machin learn approach autom discoveri rule system call featur vector describ system call execut privileg process featur vector label good bad depend execut observ rule learn algorithm induc rule monitor system detect potenti studi perform rule learn algorithm task featur subset select genet algorithm featur subset select shown significantli reduc number featur affect accuraci predict keyword machin featur subset select introduct detect distribut comput system difficult problem manual detect distribut system requir tremend amount effort prone error autom process detect topic research includ detect system base concept distribut knowledg network data techniqu distribut knowledg network agent inform retriev data transform knowledg discoveri data technolog data knowledg organ assimil heterogen physic distribut data knowledg sourc approach modular extens approach build complex adapt inform system applic distribut knowledg network offer natur framework design implement system monitor distribut system concert attack spread space initi suitabl countermeasur current implement mobil static data gather agent collect system log audit data render common low level agent monitor classifi ongo classifi pass inform higher level agent data mine agent machin learn acquir predict rule detect system log audit data higher level agent provid analyz attack execut support system administr pursuit attack data knowledg provid system agent system manag staff learn understand support action detect system implement java objectspac voyag mobil agent facil sketch design distribut detect system explain research applic artifici intellig problem identifi privileg program comput immunolog project java agent project explor system call trace privileg program detect featur vector approach describ system call execut privileg program appli featur subset select genet algorithm show featur vector work autom knowledg discoveri rule featur subset select reduc number featur featur vector improv accuraci result elimin extran featur relat work project close relat detect project includ comput common detect framework resembl project architectur standard group includ inform technolog offic advanc research project inform scienc odyssei bottom reconnaiss agent correspond data gather agent analysi agent correspond agent top agent correspond agent specifi architectur commun model compar system distribut detect system combin host monitor local area network monitor monitor system network activ central director aggreg inform monitor detect similar agent system detect countermeasur multipl monitor artifici intellig algorithm determin sever event differ system intellig pure make agent technolog comput immunolog project mexico explor design detect system base anim immun system portion project develop comput program creat normal abnorm system call trace instanc execut program detect attack compar execut trace process system call trace work recent varieti approach detect system call trace privileg program comput immunolog project differ project individu agent feed data data java agent project columbia similar agent system detect countermeasur jam distribut java agent data mine learn model fraud behavior project differ jam concentr data mine organ jam project focu data mine multipl organ project countermeasur combat jam project expand work forrest group detect attack privileg program work attempt improv jam approach group purdu coast project prototyp detect system paper analyz approach detect mention prototyp work project differ data mine detect attack multipl learn algorithm mobil agent design system system intellig agent collabor inform mobil agent technolog develop implement detect system goal system design learn detect host network individu agent target mobil agent technolog intellig process audit data agent collabor share inform suspici event determin vigil appli data mine techniqu heterogen data knowledg sourc identifi react coordin attack multipl subsystem notabl featur detect system base data mine support offer gather oper data knowledg sourc entir observ system system identifi sourc concert multistag initi countermeasur provid support document system administr procedur legal action attack attack involv subsystem combin nf attack attack determin nf file filesystem export unix nf attack file give login privileg attack host untrust attack login account attack attack host mistakenli trust attack attack system detect system base data mine correl identifi origin support system manag respond attack compon detect system shown figur router read log file monitor oper aspect system router provid data distribut data clean agent regist interest data data clean agent process data obtain log network protocol system activ monitor homogen format mobil data clean agent system form level detect mobil agent travel data clean gather recent classifi data determin suspici activ occur jam system agent varieti classif algorithm unlik jam agent level collabor set suspicion level determin cooper suspici action interest presenc suspici activ top mediat agent maintain data combin knowledg data lower layer agent mediat appli data mine algorithm discov associ pattern data tempor view knowledg activ monitor distribut system train system administr spot defend attack system assist system administr develop protect countermeasur system identifi attack user interfac detect system direct oper agent system show statu report mobil agent user interfac access data featur user interfac data mediat system call tcp connect authent function system log network event data system call data network event data authent event data function fix agent monitor compon mobil agent travel monitor compon figur architectur detect system project current data clean agent implement paper discuss agent monitor privileg program machin learn techniqu work progress includ integr knowledg discoveri agent distribut knowledg network monitor distribut comput system interest machin learn approach discov pattern coordin attack system individu attack spread space time rule learn system call trace program provid network servic distribut comput system execut special privileg popular mail transfer agent oper privileg unix system privileg program target trace system call execut program identifi program attack compactli repres system call trace program featur vector compact process trace easili store data claim simpl rule learn machin learn algorithm learn rule effect classifi prior techniqu forrest project mexico develop system call normal privileg program forrest system call data set file consist line give process id number system call number file partit base show behavior normal privileg program run suno forrest organ system call trace sequenc window provid context forrest show good sequenc window develop size set execut forrest show behavior determin find percentag system call sequenc match good sequenc data set forrest project electron form web site featur vector techniqu improv forrest techniqu depend threshold percentag abnorm sequenc find forrest techniqu extract knowledg problem analyz expert lee portion data forrest project show ripper learn algorithm learn rule system call sequenc window lee organ system call data window length step size valu found give result experi window assign label match good window obtain proper oper window label system call window label shown tabl system call sequenc label normal normal normal abnorm abnorm tabl sampl system call window train label ripper learn rule set appli test data gener classif sequenc window lee window classif length step size group label number label window exce window consid abnorm singl window classif shown tabl classif group ripper classif system call sequenc actual label normal normal normal normal abnorm normal abnorm abnorm abnorm abnorm tabl sampl system call window classif scheme filter isol due predict error cluster system call sequenc classifi abnorm tabl classif entir window label lee empir found valu work identifi window pass percentag abnorm region obtain divid number window total number window percentag compar empir deriv threshold determin process trace feel featur vector techniqu improv lee techniqu depend arbitrarili establish threshold concern establish arbitrari threshold difficult requir tune practic balanc alarm miss repres system call trace featur vector goal autom discoveri predict rule detect extract relev knowledg form lend analysi human expert natur question examin rule learn ripper experi essenti perform achiev altern approach induc smaller number simpler rule explor design altern scheme train test data inspir success bag word document successfulli group train text classif system honavar document repres vector element correspond word vocabulari simplest vector binari bit word document question bit denot absenc word data encod bit featur vector bit vector system call sequenc execut process sequenc window size normal sequenc abnorm sequenc system call data encod similar spirit bag word encod repres document word system call sequenc length featur vector comput basi system call trace train data featur vector randomli select normal trace featur vector arbitrarili select abnorm trace number abnorm record train data small proport set normal train data balanc abnorm train data duplic time abnorm record present train data explain balanc data obtain desir result ripper ripper effici learn rule set simpl good good good bad size set rule compar favor set rule ripper learn lee system call window approach appli learn rule set abnorm data normal test data produc result shown tabl trace boldfac trace train total number featur number vector predict abnorm percentag featur vector shown process featur trace featur vector trace total featur vector featur vector predict abnorm normal tabl result learn rule featur vector rule expect identifi process trace process involv handl transact indistinguish process handl normal transact process involv flag identifi place identifi experi except minor benefit featur vector approach simplic learn rule train place due amount time learn rule set learn rule set system call featur vector gener fewer rule consist conjunct boolean term small set rule appli simpl data structur approach detect agent place excess load system simpl rule set lend expert examin analysi featur subset select genet algorithm learn algorithm perform term learn classif accuraci test learn rule depend featur attribut repres exampl featur subset select shown improv perform learn algorithm reduc effort amount data requir machin learn broad rang problem discuss altern approach featur subset select found pfleger yang honavar benefit affect featur subset select featur subset select affect accuraci learn algorithm featur data set repres languag languag express accuraci learn algorithm affect featur subset select reduc comput effort requir learn algorithm size search space depend reduc featur set exclud irrelev featur reduc size search space reduc learn effort number exampl requir learn classif function depend number featur mitchel featur requir exampl learn classif function desir accuraci featur subset select result lower cost classif cost obtain featur valu measur simpli comput overhead process natur featur subset select mean improv perform machin learn algorithm detect genet algorithm relat approach offer attract altern exhaust search case due comput advantag commonli heurist search algorithm reli monoton assumpt addit featur worsen classif violat practic genet algorithm featur subset select start randomli gener popul individu correspond candid featur subset individu encod string number bit string equal total number featur bit string attribut attribut train fit featur subset measur test accuraci accuraci classifi learn featur criteria interest number featur complex rule ripper rule learn algorithm train classifi set treat attribut select miss train data provid ripper learn rule set data number condit learn rule set count ripper determin complex learn hypothesi learn rule set appli test exampl determin accuraci return featur subset select routin fit individu base number attribut accuraci learn hypothesi total number attribut fit rank individu select primari goal featur subset select detect problem improv accuraci high percentag detect alert report current detect system alarm system highli alarm minimum secondari goal reduc amount data obtain run process classifi reduc overhead detect approach monitor system featur subset select result genet algorithm standard mutat crossov oper probabl mutat probabl crossov select probabl select individu popul size run gener featur system call featur vector data genet algorithm train data previou featur vector experi featur addit addit copi uniqu featur vector train data featur ensur rare potenti import case reason probabl sampl train test phase gave total featur vector input genet algorithm show gener effect genet featur select tabl show result separ run genet algorithm ripper ident paramet run number attribut significantli reduc accuraci maintain trial train accuraci individu attribut individu tabl featur subset select result constant paramet tabl show result rule individu found genet featur select run compar result origin result learn featur trace boldfac trace train half featur origin data perform learn rule compar obtain entir set featur featur subset featur vector normal label abnorm show improv rate posit trace attack attribut attack featur select trial attack featur select trial attack featur select trial attack featur select trial attack featur select trial normal tabl result rule learn genet featur select analysi learn algorithm summari effect ripper ripper genet featur select algorithm measur ripper system call window ripper featur vector ripper genet featur select featur vector learn effort moder good intens accuraci learn hypothesi good good good complex learn hypothesi poor good good number attribut system call avg classif effort moder rule small rule smaller rule fewer tabl effect learn techniqu tabl illustr advantag featur vector system call window learn problem featur vector learn algorithm learn hypothesi faster compar accuraci normal test complex hypothesi smaller genet featur select featur vector time consum improv learn hypothesi reduc set attribut learn analysi rule learn ripper set rule learn trial ripper genet featur subset select shown good good good good good good good bad set individu rule correspond good good good good good good good bad rule set genet algorithm trial rule found rule set fourth trial uniqu run major rule duplic rule set rule set identifi normal process rule exist abnorm system call sequenc notic system call sequenc directli identifi small size rule set learn ripper system call featur vector perform learn rule set set rule distinguish good process attack futur work detect detect comput system network environ problem great practic interest paper investig classif system call trace detect featur vector system call trace ripper learn set rule success classifi shown featur subset select reduc number featur result data effort requir train due smaller search space featur select gave accuraci smaller set featur integr learn rule mobil agent run distribut system consist pentium ii system run laboratori network connect depart comput scienc network oper detect system control environ oper voyag server start host monitor distribut mobil agent travel classifi sampl system call featur report result user interfac implement set java class interpret appli ripper mobil agent move classifi travel distribut system rule set learn featur vector order magnitud simpler obtain approach report literatur noteworthi fact experi question rule learn algorithm conjectur featur vector experi primarili differ rule set learn open issu includ techniqu heterogen distribut system system call trace privileg program differ greatli unix oper system implement hope similar strong singl rule set appli system issu techniqu appli real time featur subset select train refin agent real time agent techniqu determin process intrud process real time detect lee techniqu anomali detect real time execut process techniqu refin determin likelihood process process give real time detect refin daemon http server techniqu appli privileg program work distinct privileg program identifi case threshold algorithm work program base expect techniqu success program work progress detect aim integr knowledg discoveri agent distribut knowledg network monitor protect distribut comput system inform infrastructur investig machin learn approach discov pattern coordin attack system individu attack spread space time interest context acknowledg work support depart contract mda comput immun system project mexico comput scienc depart system call data bibliographi jose diego architectur detect autonom agent depart comput purdu coast tr jm introduct softwar agent jm softwar mit fast effect rule induct intern confer machin lake morgan kaufmann defend comput system autonom agent nation inform system secur octob model ieee transact softwar number page februari stephani comput immun system research onlin comput immunolog commun novemb unix process ieee symposium secur page lo ieee comput societi press jeremi artifici intellig current futur direct nation comput secur genet algorithm machin learn york vasant le miller intellig agent detect countermeasur ieee inform technolog ny pfleger irrelev featur subset select problem eleventh intern confer machin pp nj morgan kaufmann genet program mit press stolfo data mine approach detect usenix secur symposium genet algorithm data structur evolut program york edit introduct genet algorithm mit ma ed featur data mine perspect kluwer academ boston todd karl levitt network detect ieee objectspac voyag core technolog user guid onlin version phillip vald live traffic analysi gatewai network distribut system secur march mark open infrastructur scalabl detect ieee inform technolog ny autom text process prentic hall chan java agent distribut workshop ai method fraud risk manag van onlin vasant honavar featur subset select genet algorithm ieee intellig system special featur transform subset select vasant honavar featur subset select genet algorithm featur data mine liu kluwer academ boston stephani pearlmutt detect system altern data model ieee symposium secur privaci
ML/1413 6 learn vision base mobil robot chri luke fletcher alexand zelinski abstract reinforc learn system improv behaviour base scalar reward critic work vision base servo learn method handl continu state action requir camera actuat knowledg teacher learn observ action behaviour improv learn speed experi perform mobil robot vision system introduct free wander visual servo build block robot behaviour target pursuit landmark base navig visual servo consist move part robot desir posit visual feedback wander environ explor behaviour work demonstr learn wander servo real robot learn elimin calibr process lead flexibl behaviour reinforc learn system improv behaviour learn act bring reward continu state action reinforc learn system gener motor command vari smoothli measur state demonstr learn system develop observ partli learn observ action wander wander partli learn observ action servo behaviour robot system laboratori depart system australian nation act australia figur camera view wander behaviour larg squar repres detect obstacl robot system architectur platform research nomad soni colour camera camera point forward downward robot nomad capabl translat rotat camera signal process fujitsu colour track vision card nomad card capabl perform sum absolut differ correl frame frame rate system architectur base behaviour base system report cheng zelinski experi system simplifi wander target pursuit ur show augment finit state machin behaviour base system wander behaviour robot move collid obstacl system free space detect carpet grid correl perform imag space imag carpet result matrix indic likelihood region ahead robot carpet camera view figur show smaller squar region carpet target pursuit behaviour perform visual servo move robot object object identifi interest carpet surround carpet interest object identifi target pursuit behaviour domin servo target begin target lost wander resum target pursuit wander creat forag behaviour wander visual servo emploi model pid control translat input imag coordin result translat rotat veloc camera calibr attitud posit rel floor measur previou work visual servo behaviour learn reinforc learn work wander visual servo behaviour learn camera calibr process requir figur nomad colour camera target pursuit wander correl result actual veloc request veloc camera motor figur system behaviour model target pursuit domin wander target identifi behaviour visual motor veloc data reinforc learn learn system requir form map includ visual actuat command learn approach requir model limit abil teacher reinforc learn requir scalar reward base behaviour introduct reinforc learn method provid critic requir measur task achiev task reward signal immedi action true effect action manifest time behaviour improv base knowledg action led reward punish good bad experi valuabl part learn process popular reinforc learn flexibl learn action histor data abil call prefer term work increment updat expect valu action state action assign function reward action expect reward futur base state result action express α γ max expect perform action state α learn rate control converg γ discount factor discount factor make reward earn earlier valuabl receiv implicitli describ action highest continu state action method understood discret case state action symbol numer real command motor concern lead state poor scale number state poor control continu state action method briefli earlier work method continu continu action reinforc learn algorithm base artifici neural network combin interpol approach investig simul combin neural network interpol hold action state input neural network state output set real valu action valu sampl interpol action baird describ suitabl interpol scheme call work combin memori base reinforc learn neural network function move squar close relat function combin action expect sampl function lim ˆ ˆ wire total number state ith action qi ith action action vector small smooth factor ɛ avoid action vector number continu variabl action function properti make interpol real feed state neural network carri action highest store result chang state state neural network valu chosen action state calcul estim current reward state conveni state neural network wire fitter updat estim calcul valu produc train neural network output conveni neural network wire fitter train valu figur train procedur step real opportunist ing updat requir calcul quickli function argmax calcul quickli action carri properti interpol highest interpol coincid highest valu interpol action highest input action action suffici propag state neural compar output find action requir calcul forward pass neural network work scatter data remain matric requir interpol wire influenc area wire averag wild extrapol occur suffer unlik polynomi scheme partial deriv term point quickli calcul partial deriv error output propag neural network chain rule train procedur shown figur train singl hidden feedforward neural network increment backpropag learn rate constant suggest experi buffer replai repeatedli advantag learn problem singl suboptim action prevent high action carri time action state action time step carri back approxim continu state action approxim power repres valu state action state rel valu action poorli result unsatisfactori control compound time interv control action smaller action deviat close relat problem advantag learn address issu action similar differ action advantag learn optim action lesser action scale factor make effici approxim resourc equat advantag learn updat quantiti analog γ max max simul experi advantag learn improv converg speed reliabl learn wander wander behaviour explor environ collid obstacl hardwir algorithm matrix correl carpet templat guid movement robot move direct longest uninterrupt strip carpet rotat carpet detect conjectur success wander involv amount carpet view forward veloc tabl show action reward reinforc learn algorithm reward weight sum compon shown carpet nearer robot weight heavili reward forward movement punish backward make blind desir compon reward signal punish motion unpredict eventu harm robot state carpet match matrix translat rotat veloc robot smooth trace previou action action target translat rotat veloc robot reward visibl carpet move forward smooth motion tabl reinforc learn specif wander import state accur complet earli veloc robot provid state inform learn fail case analysi data show restrict differ current state order system result state inform simpli filter effect correl command chang state difficult obtain accur data carpet match process light vari corridor test area wall similar colour carpet reliabl add constraint region detect region carpet figur smooth carpet correl neighbour horizont smooth frame process step qualiti state data standard learn found provid safeti buffer learn prevent damag robot ring nomad action occur audibl warn awar hardwir behaviour read part state learn algorithm make unclear vision system begin trial behaviour neural network small weight produc slow movement robot start directli face quickli learn forward veloc bring reward reach wall robot find move forward good adapt behaviour learn continu number action occur robot encount obstacl detect figur show path record wander point mark learn begin movement smoother consist trial posit metr start posit metr figur path wander experi open plan offic pillar plant pot avoid total trial time action trial end robot clip pillar view detect learn visual servo visual servo capabl manipul mobil robot visual servo requir abil track posit object control effector base feedback track area track process locat object success frame gaug effect motion imag space imag captur region imag space store buffer templat compar video frame neighbourhood locat previou frame method measur similar imag differ locat templat current frame match templat frame form vector motion target track templat start origin motion vector success frame ad track failur measur differ templat closest match current imag great basic approach control part visual posit base imag base gener requir form calibr posit base system error signal defin coordin system model describ relationship visual coordin coordin system requir learn model system suitabl servo manipul joint angl defin posit effector imag base system error signal defin imag space imag jacobian relat desir increment chang imag actuat set learn approxim jacobian complic vari state approach learn direct map imag space state inform actuat command reinforc learn approach develop independ method achiev perform calibr system gain camera bump move actuat configur chang system work tabl show action reward reinforc learn algorithm learn visual servo reward function includ term punish energi reduc visual state pixel error target pixel veloc target translat rotat veloc robot action target translat rotat veloc robot reward movement target save energi smooth motion tabl reinforc learn specif visual servo reaction minor target posit due track punish term target veloc due excess target veloc estim process robot successfulli learn servo camera camera mount face straight ahead learn behaviour turn target drive forward target goal posit robot slow closer target robot learn target closer goal locat camera posit robot unabl turn wheel direct target move target locat lose target complet learn system develop method move target learn work behaviour reduc period random behaviour requir close experi data gather wander provid learn servo system wander behaviour learn action servo behaviour learn data visual servo perform adequ minut real track frame perform continu improv hour robot learn servo object posit visual field relat work vision base physic ground obstacl avoid algorithm present visual servo reinforc learn demonstr learn wall avoid construct environ discret action asada develop vision base reinforc learn system discret action adapt state space recent visual servo system reinforc learn continu state action present demonstr wander servo behaviour real mobil robot learn trial error reinforc learn continu state action system gener action vari smoothli measur state learn time learn behaviour futur work move activ stereo vision system develop sophist behaviour acknowledg behaviour system softwar base work gordon cheng correl softwar develop jochen real time face track refer hosoda behavior acquisit shoot robot reinforc learn proc workshop visual baird harri reinforc learn continu action technic report wright fuzzi approach fuzzi dynam program proc ieee int conf fuzzi ieee comput press brook robust layer control system mobil robot ieee journal robot jl jp neural model visual servo robot manipul proc symposium optim comput engin system applic cheng zelinski visual behaviour navig mobil robot proc intern confer intellig robot system volum osaka chri luke alexand zelinski reinforc learn visual servo mobil robot proc australian confer robot autom chri david alexand zelinski continu state action space proc australian joint confer artifici decemb lectur note comput chri david alexand zelinski reinforc learn appli control autonom underwat vehicl proc australian confer robot autom manc harmon baird residu advantag learn appli differenti game proc intern confer neural washington visual servo system base neural network proc american control jochen alexand zelinski robust face track gestur recognit proc int joint conf artifici horswil visual avoid segment intellig robot page hosoda asada versatil visual servo knowledg true jacobian proc intern confer intellig robot system tutori visual servo control ieee transact robot octob mi jordan ra jacob learn control unstabl system forward model proc advanc neural inform process system san peter lancast curv surfac introduct academ wai lo robot visual servo control proc twelfth intern confer robot factori park se young dynam visual servo control robot manipul neural network journal korean institut telemat richard sutton andrew barto reinforc introduct bradford asada continu valu behavior proc intern confer multisensor fusion integr intellig acquisit relat vision action map reinforc learn proc intern confer intellig electron sebastian thrun approach learn mobil robot navig robot autonom christoph watkin peter dayan technic learn machin wu stanlei modular servo network proc ieee intern confer robot autom
HCI/1414 4 explicit requir metric interfac agent user model correct scott brown depart electr comput engin air forc institut technolog usa eugen santo jr comput scienc engin connecticut ct usa sheila bank mark depart electr comput engin depart mathemat statist air forc institut technolog usa abstract complex current comput system softwar warrant research method cognit load user determin inform form tool time monument task necessit intellig interfac agent abil predict user intent accur user model consid effect predict user intent method maintain accur user model main thrust paper describ approach dynam correct interfac agent user model base util theori explicitli account agent requir metric measur agent effect meet requir requir develop requir util function determin user model correct present correct model base bid process metric util function discuss critic research issu user model open fertil ground futur research introduct todai comput system softwar access user due reduc technolog advanc process sheer volum inform deal complex softwar comput system progress difficult automat determin inform form tool time monument task todai comput system attempt address complex issu current softwar inform softwar agent intern confer autonom agent steadili find applic research type softwar term interfac user complex system carri action user behalf infanc previou system agent fallen short provid autonom agent agent pedagog model small fraction narrowli result small number underli problem interfac agent research failur adequ address effect effici knowledg suitabl model user interact system current interfac agent lack complex manag uncertainti dynam involv predict user intent model user behavior research issu organ paper provid motiv background inform current research effort section section outlin requir interfac agent metric measur methodolog determin agent meet requir section discuss approach correct interfac agent meet requir modifi underli user model bid process draw research show area futur research background interfac agent area research artifici intellig interact user model commun word ai hci commun research interfac word ai commun concern interfac agent hci commun stereotyp research field feel advantag point gener research commun interfac agent research concern user agent strength ai research li year experi knowledg machin learn strength hci research interfac agent attent user perform repres inform user clear delin group research interfac approach research field interfac agent differ field user model good marriag artifici intellig interact user model concern repres user knowledg interact system adapt system user research field artifici investig wai exploit user model employ user model effect usabl system implement techniqu user model field recent number system numer uncertainti techniqu ai commun captur uncertainti inher model user research field intellig interfac agent demonstr core interfac agent architectur integr expert system shell call expert integr probabilist expert system shell user knowledg acquisit verif valid data mine infer engin tool capabl oper commun mode initi test implement usabl intellig interfac agent user select tool commun mode pointer direct manipul interfac draw current context interact initi base user model user class stereotyp causal plan model bayesian network user interact statist frequenc interact tool commun mode expand user model cover aspect domain inform air forc institut technolog artifici intellig laboratori web site support effect user intent predict incorpor abil model uncertainti user intent dynam user behavior user model effect predict user accur cognit model user consid problem cognit model intellig interfac agent reli knowledg lack flexibl power kei uncertainti dynam user model emploi knowledg correctli captur model uncertainti interact improv model user user interfac behavior ideal repres uncertainti bayesian network bayesian techniqu attract properti develop interfac intellig intellig interfac agent captur requir model user intent bayesian techniqu extrem predict futur event dynam user model captur user prefer random variabl bayesian network dynam bayesian network chang structur time symbiot inform reason support drive goal research develop softwar knowledg knowledg acquisit methodolog symbiot inform reason support underli idea user perform task agent perform task agent strength li abil perform data acquisit manag includ displai inform heterogen low level quantit qualit data routin infer enabl support user strength li abil provid guidanc insight inform draw higher level infer data symbiot approach object user comput share task approach task partit requir develop learn human comput interfac intellig agent kei aspect perform inform deriv inform requir control inform displai agent necessarili type task reason direct system data inform reason inform displai softwar architectur develop methodolog emploi realiz type agent step realiz research goal interfac agent requir metric agent perform determin import model discrimin metric determin defin dynam chang user model previou evalu identifi potenti problem interfac agent user model improv interfac agent util provid benefici assist agent develop explicitli account agent requir method determin requir met correct agent user model primari focu paper requir agent defin requir mutual requir set agent form softwar petri appar research ignor requir agent develop explicitli requir interfac agent develop concret measur set requir determin interfac agent meet requir categor metric requir clear delin requir metric measur requir metric evalu scale signifi agent perfectli meet requir present requir feel captur essenc interfac agent exist todai due space present subset metric requir determin interfac agent meet requir adapt defin adapt abil modifi intern environ environ order chang futur react determin user intent improv adapt impli number impli agent percept agent distinguish relev featur environ relationship method act react environ agent abil act adapt requir assum agent capabl affect environ act react reactiv impli time act connot delib event relationship agent react intern environ defin properti agent goodwin defin delib agent properti includ predict abil model environ predict action affect interpret abil correctli assess ration abil perform action obtain goal metric measur interfac agent abil accur suggest assist user defin metric number correct suggest number suggest metric account agent inabl suggest assist agent unabl suggest assist due slow reaction metric measur measur defin assist capabl measur agent capabl offer defin percentag time agent suggest correct assist base state world agent receiv inform applic measur abil provid time assist user defin assist capabl number correct suggest number state world assist capabl metric relat recal text filter system statist defin ratio number relev found document total number document found recal statist defin fraction actual set relev document correctli classifi relev reactiv metric measur quickli agent respond stimulu defin measur time stimulu agent time agent act note explicit action consid action agent determin user assist scale establish cutoff cutoff agent respond defin metric reactiv cutoff refin reactiv metric granular metric measur portion reactiv determin autonomi defin agenc petri argu note autonomi defin commun franklin graesser argu autonomi impli reactiv act time tempor agent base research conduct defin abil react time environ direct direct explicit user agent agent definit preclud agent respond sort collabor interact user agent desir agent act behalf user indirect form user determin user determin assist user autonomi impli sort save intern adapt explicitli requir extern measur measur number suggest agent offer user user request defin metric extern autonomi number autonom suggest number suggest collabor requir interfac agent collabor user collabor user differenti interfac agent type agent collabor simpl make suggest user suggest correct complic observ user action attempt determin intent provid assist time collabor agent intern resolv conflict inconsist improv support capabl collabor agent heterogen collabor impli agent commun languag commit languag central collabor behavior agent perform protocol commun behavior base defin interfac agent collabor abil commun includ pursu goal offer assist collabor metric measur collabor user agent correct adapt agent measur collabor requir correct adapt concern effici collabor agent commun languag plethora perform kqml commun protocol determin abil commun agent network factor determin metric control interfac agent network throughput larg determin bit knowledg commun bottleneck interfac agent make inform access applic inform sourc measur interfac agent abil collabor concern effect collabor defin metric measur level collabor defin metric measur percentag agent perform versu user agent workload agent action agent action user action note base metric action suggest suggest made action user determin amount collabor desir set collabor rang desir amount collabor interfac agent user collabor threshold mean user desir divid evenli agent threshold user agent perform action behalf defin collabor metric collabor agent workload tc user collabor threshold robust add requir interfac agent capabl gracefulli degrad perform requir capabl interfac agent interact complic agent user robust limit perform extens maintain kei desir abil easili adapt agent inform requir dealt adapt requir abil adapt dealt agent specif agent abil add sensor inform dynam environ requir robust abil degrad assist abil interfac agent correct user model partial relat number correct adapt agent receiv correct process detail reli interfac agent send correct adapt turn respond time cutoff ca assum correct adapt defin metric quantiti number ca agent respond measur averag time correct adapt agent time cutoff ca requir util function defin success agent agent abil provid benefici assist interfac definit attempt close end agent util meet requir util function requir defin requir metric weight respect base previou histori requir histori previou action weight factor requir metric util function map real number function weight chang depend current situat interfac agent make poor adapt requir denot import higher util interfac meet requir metric explicitli account recenc action determin metric metric calcul entir histori action event desir fade function weigh heavili recent util function requir histori account desir evalu metric ten limit histori ten event evalu metric histori desir metric evalu histori length correct model mention accur user model consid effect predict user intent inaccur user model plethora techniqu current user model simpl user user behavior time fact deviat user behavior origin design user model accur captur user model user model fail dynam adapt user chang behavior user doom inaccur short order account uncertainti dynam involv predict user intent model user set requir metric requir util function determin correct interfac agent user model section address dynam chang user model discuss set correct adapt agent requir requir util previou interfac agent behavior suggest user model research identifi type problem interfac agent knowledg problem result interfac agent fail meet requir agent user model inadequ deal dynam environ set advantag evalu metric vari histori length akin state mutual fund perform year perform requir metric requir util readili identifi requir met attempt correct problem alter user model approach correct user model interfac agent request correct adapt agent special agent capabl correct problem user model adapt improv interfac agent requir util discuss scenario correct adapt agent suggest interfac agent user base concept contractu bid process agent engag recommend interfac agent user model interfac agent serv manag determin contract requir util function chosen announc contract receiv bid bidder evalu util final accept reject bid base util correct adapt agent improv interfac agent requir util contract correct user model point address correct adapt agent suggest adapt interfac agent user model intuit interfac agent equip correct user model mention agent possess number wai adapt dynam environ agent requir util fall exist adapt mechan incap deal dynam environ special correct adapt agent interfac agent continu observ environ possibl offer assist util comput resourc correct user model present bid process model adopt muller underli learn mechan interfac agent model formal defin domain model repres ffl fa set agent mental state ffl domain ontolog ffl histori interfac agent suggest inform agent make user choic base assist offer ffl effect respect requir metric ffl negoti set semant repres bidder agent make user model ffl fu util function correct adapt agent base interfac agent requir util function time ffl negoti mention weight requir metric calcul requir util function chang store weight histori calcul correct adapt agent util histori ffl repres commun primit ffl protocol function map commun primit agent role reaction ffl foe oe set negoti strategi oe oe correct adapt agent architectur similar interfac agent correct adapt agent possess user evalu calcul metric requir util commun protocol handler commun agent correct adapt agent special bid compon capabl adapt user model complet descript architectur correct adapt agent scope paper correct adapt agent maintain user model ident interfac agent user model interfac agent request correct adapt time correct adapt agent adapt user model base bid behavior compon manag evalu util make user model store histori suggest made manag determin base bidder agent evid store histori requir util function recalcul correct adapt agent agent improv requir util function greatest magnitud bia evalu multipli bidder agent effect requir util function correct adapt agent effect updat simpl reinforc receiv posit learn reinforc learn account bidder agent determin correct adapt agent apt improv metric metric correct adapt agent bid behavior compon affect metric metric significantli greater metric metric significantli lower correct adapt agent capabl metric requir util function actual definit appropri left architectur adopt number bid strategi negoti protocol negoti defin gener muller singl award strategi agent idea agent bid strategi includ agent learn past bid improv futur bid analysi figur show interfac agent requir util function typic run addit requir util function equal weight requir metric threshold tu requir chosen base previou empir result requir requir fig requir util function interfac agent time agent requir util function drop threshold contract announc made bid made correct adapt agent bid receiv time interfac agent determin correct adapt agent bid highest contract agent effect user model correct adapt agent requir util discontinu futur approach dynam correct interfac agent user model base agent requir requir util function determin user model correct develop set measur requir interfac agent research explicitli agent requir provid wai measur requir stark state provid measur requir measur interfac agent util provid assist user approach specif relev requir chang requir import chang user model chang model fail recogn user model longer adequ chang user model problem effect incorrect user model measur set requir adapt make user model possibl detriment correct base bid process metric util advantag multipl agent suggest correct interfac agent user model analysi preliminari result deleg mainten interfac agent user model agent benefit extend interfac agent exist adapt mechan correct adapt agent correct user model interfac agent addit comput resourc determin modifi user model base methodolog construct user identifi problem occur model implement correct adapt agent larger issu user correct adapt agent implement suffici correct user model mention correct adapt agent suit improv metric attempt build correct adapt agent capabl adapt sort adapt interfac agent user model correct adapt system collect correct adapt research explor concept behavior team indic sort benefici task hypothet construct desir approach construct correct adapt agent desir correct adapt agent atom determin agent desir combin part make agent research topic futur effort provid tool develop construct interfac agent user model current agent develop environ focu collabor autonomi requir agent ignor adapt robust requir address issu explicitli develop concentr environ specif agent knowledg base reason mechan refer tucker balch learn behavior robot team collect paper aaai workshop multiag page aaai juli aaai technic report sheila robert eugen santo scott brown usabl test intellig interfac agent sixth intern interfac confer page sheila martin eugen santo scott brown user model militari intellig interfac agent train system educ page decemb david incomplet handl methodolog valid bayesian knowledg base master air forc institut scott robert eugen santo sheila bank user interfac agent expert system user model intellig applic page june held conjunct sixth intern confer user model scott eugen santo sheila bank dynam bayesian intellig interfac agent sixth intern interfac confer page scott eugen santo sheila bank util user model intellig interfac agent twelfth canadian confer artifici intellig june williamson design behavior inform agent intern confer autonom page marina del februari stan franklin art graesser taxonomi autonom agent intern workshop agent languag goldberg maja matar tool design evalu control fourteenth nation confer artif intellig page juli richard goodwin formal properti agent technic report carnegi mellon robert sheila eugen santo jr develop intellig user interfac gener expert system michael onlin seventh midwest artifici intellig cognit scienc robert sheila eugen santo jr reason gener expert system intellig user interfac ieee intern confer tool artifici page robert harrington scott brown intellig interfac learn uncertainti eugen santo eighth midwest artifici intellig cognit scienc page aaai thoma hayn sandip sen crossov oper evolv team john marco david max hitoshi rick genet program annual confer mit eric horvitz matthew barri displai inform make eleventh uncertainti artifici page anthoni jameson numer uncertainti manag user student overview system issu user model anthoni cecil carlo editor prefac user sixth intern springer wien patti mae model adapt autonom agent artifici life mit press patti mae agent reduc work inform overload commun juli jame yanni tim finin evalu kqml agent commun languag michael jorg milind intellig agent agent page jorg muller cooper model autonom agent jorg michael nichola intellig agent agent workshop page august dougla oard gari marchionini conceptu framework text filter technic report colleg pearl probabilist reason intellig network plausibl infer morgan san charl petri intellig ieee decemb elain rich user individu user model intern journal eugen santo sheila bank tool acquir consist knowledg uncertainti aaai workshop verif valid page eugen santo howard sheila bank probabilist valid aaai workshop verif valid page solomon carmel eugen santo jr heurist bayesian thirteenth confer uncertainti artifici page john joseph protocol design addison daniel stein sheila eugen santo michael util data mine incomplet repair knowledg base eugen santo eighth midwest artifici intellig cognit scienc page aaai katia keith mike zeng distribut intellig agent ieee decemb david zeng katia sycara agent learn jorg michael nichola intellig agent agent workshop page august
Agents/1415 1 present inform system multiag system methodolog languag design agent system scott deloach depart electr comput engin air forc institut technolog introduct current research relat intellig agent capabl structur individu agent order solv complex agent work cooper agent heterogen environ domain multiag system multiag interest coordin behavior system individu agent provid behavior sycara list challeng multiag problem alloc task individu agent coordin agent control commun make multipl agent act coher manner make individu agent reason agent state coordin reconcil conflict goal coordin agent engin practic multiag system research multiag system engin attempt answer sixth engin practic multiag provid framework solv challeng abstract provid multiag system develop distribut softwar system goal research defin methodolog specif formal agent system synthesi accomplish mase languag describ agent multiag agent model languag agent definit languag graphic base languag describ type agent system interfac agent base order predic logic complet describ intern behavior individu agent achiev defin formal semant mase methodolog develop support formal system restrict mase formal develop methodolog successfulli appli tradit softwar implement techniqu view mase abstract paradigm agent higher level abstract typic object simpl method invok object agent coordin action accomplish individu commun goal viewpoint issu agent view agent conveni possess intellig handl intellig system compon equal framework paper overview mase introduct critic compon agent model languag detail agent definit languag detail agent design left futur paper object agent agent typic perceiv basic trait tradit definit agent autonom control directli human cooper impli commun percept perceiv environ react affect environ exhibit behavior similar trait impli characterist object gener basic differ object passiv react extern exhibit goal direct behavior agent typic common messag languag agent object messag class depend basic characterist defin model agent view agent object goal common commun languag develop mase build exist object orient analysi design techniqu rumbaugh object model techniqu unifi model languag mase diagram similar omt uml ad addit featur modifi tradit semant captur notion agenc cooper behavior formal definit make system synthesi straightforward inform object orient definit languag methodolog omt uml mase methodolog mase methodolog similar tradit softwar engin methodolog special distribut agent paradigm methodolog basic step shown figur methodolog design gener compon system defin system domain level design agent level design compon design system design figur mase methodolog domain level design step mase domain level captur basic type interact agent system agent intellig agent defin import concern definit type extern interfac extern interfac defin coordin protocol agent defin agent coordin agent agent type coordin leav actual specif actual agent system system design step design identifi agent type identifi interact agent type defin coordin protocol type interact step identifi agent analog object orient techniqu problem space determin type agent effect model domain mase defin specif techniqu agent type role model collabor diagram proven identifi type identifi interact occur type agent interact agent defin coordin protocol protocol describ sequenc messag pass agent achiev coordin domain level design captur diagram discuss section agent level design step mase agent level design level defin agent architectur individu agent type agent architectur defin compon agent interact agent level document specif design step agent level map action identifi agent intern compon defin data structur identifi agent data structur repres input output agent defin addit data intern agent data structur repres data flow compon architectur compon design compon design level obviou level mase methodolog agent architectur compon design compon design scratch defin compon exist hope defin agent advantag exist compon enabl compon obviou agent compon includ infer search learn algorithm system design system design place design compon complet defin domain system design pick number type agent defin paramet agent definit technic part system system defin verifi properti interest safeti live system design diagram specif step system design select agent type determin number agent requir type agent physic locat address type agent hold paramet defin domain defin domain system requir set formal tool exist analyz properti system combin provid formal definit suitabl softwar synthesi compon discuss specif diagram section agent model languag diagram defin featur multiag system diagram defin domain model develop system domain model describ agent type relat agent combin form multiag system agent diagram defin type agent system commun defin agent system commun hierarchi diagram defin relationship class system type slight variant commun class diagram state machin base defin agent defin legal sequenc messag agent involv tie messag data intern compon agent diagram defin actual system develop diagram defin actual type agent system agent diagram class agent domain agent similar object diagram major differ agent diagram object diagram interfac agent semant relationship agent basic agent interfac defin set servic provid relationship agent defin held agent agent diagram defin exist agent class relationship logic view system agent class definit shown figur servic goal figur agent class class agent belong agent class class differ li interfac agent class attribut method extern object object attribut valu invok method agent agent goal provid servic agent inform agent monitor web page wait chang web page analyz chang send updat regist agent affect chang agent defin shown figur updat regist user regist unregist provid updat figur inform agent class order provid agent interact agent system interact agent place agent barbuceanu fox defin coordin protocol agent defin share convent messag exchang agent coordin action defin commun class diagram agent request servic agent order agent commun coordin protocol establish relationship object class abstractli associ agent associ concret agent requir shown figur perform data analysi updat regist user regist unregist provid updat regist sourc user sourc user regist sourc user figur label line agent denot center agent class label agent class role agent plai agent class involv class role defin part agent class plai control collector command sender receiv receiv sender collector processor receiv sender figur agent diagram agent diagram figur base renam provid clearer label shown figur control collector command sender receiv receiv sender sender receiv receiv sender figur agent diagram defin agent diagram class commun hierarchi diagram commun class discuss depth side notat describ multipl relationship agent figur collector side annot multipl control side annot basic mean control collector collector singl control multipl sequenc integ interv format interv separ comma asterisk unlimit upper bound default interv denot case agent commun hierarchi diagram commun hierarchi diagram defin relationship system send figur special shown figur basic type protocol subtyp basic commun hierarchi diagram simpli defin relationship commun class diagram special includ simpl modifi data ad addit state messag violat gener definit special investig figur commun hierarchi diagram commun class diagram commun class diagram set finit state machin diagram defin state agent defin agent role side defin separ fsm diagram complet defin commun class diagram binari figur defin fsm receiv side label arc convent uml notat shown notat state receiv transmit argument transit start state state point translat arrow figur wait state messag agent send send messag inform argument transit back wait state transit arc loop start agent send messag agent messag match exist transit start match start label transit start state defin affect transit defin wait transit occur state figur receipt acknowledg messag transit end state back wait state transit end complet valid inform receiv wait inform figur receiv role wait acknowledg sender figur sender role valid state figur construct specifi agent action link defin commun diagram process agent fact transit valid state null transit incom messag forc specifi remain state valid procedur complet base output valid transit end state remain valid state semant inform argument figur depend agent involv special basic meet specif interact agent clarifi actual figur figur show special collector wait acknowledg figur sender role real special renam inform special make semant clearer mission control element involv separ type special make clear held agent held command agent figur show receiv side show side special work processor valid wait figur receiv role figur figur show side control collector control start send messag sensor locat argument receiv collector move collect state action state repres process requir agent entri collect agent perform process process agent perform process argument sensor process output determin transit occur output null requir incom event transit control wait data reason acknowledg figur collect data diagram control acknowledg collector collect wait acknowledg locat figur collect data diagram collector worth note action amount time complet complet long period agent involv time control wait hour collector move locat collect unabl control collector collector incorpor send statu messag minut control inform current progress condit diagram diagram defin system base agent defin domain agent compon level design step diagram defin system paramet actual locat agent system figur show diagram domain defin figur data collect data collect data collect mission data collect command data collect intellig process figur diagram discuss formal semant discuss depth semant base algebra algebra approach advantag great deal work automat code algebra specif formal specif languag provid formal provid strong notion refin specif code formal shown figur figur specif formal side defin graphic figur figur formal algebra specif defin abstract data type defin effect incom messag specif specif categori theoret basi prove theorem specif system formal semant special reason verifi gener properti interest safeti live condit termin figur figur analysi reveal end successfulli spec sort info oper attribut state state messag boolean acknowledg boolean send info boolean state start state end state wait state axiom start start wait wait wait end end spec figur sender specif practic benefit similar mase exist methodolog benefit mase support formal multiag system graphic natur make easier understand textual base formal feel similar methodolog make natur person experi work mase attempt build formal base multiag system design realiz formal method mase provid advantag tradit softwar engin techniqu advantag higher level abstract tradit system engin techniqu agent higher level abstract object softwar engin mase captur tradit system system tradit techniqu inappropri techniqu formal definit tradit object orient associ gener associ standard lack formal usag inform techniqu make difficult softwar synthesi formal syntax semant advantag support autom softwar synthesi compon properti interest easili prove spec sort result oper attribut state state messag boolean acknowledg boolean send info boolean agent oper valid info result state start state end state wait state valid state axiom start start valid valid wait wait valid valid end end spec figur receiv specif relat work work similar respect agent methodolog base concept formal basi work formal agent system perform formal model autom code synthesi futur work paper repres initi attempt defin methodolog system model languag multiag system goal integr methodolog languag autom multiag system synthesi system call formal verifi gener multiag system correct construct agenttool provid graphic user interfac base design verifi multiag system ongo work includ formal definit semant complet descript seamlessli integr agenttool investig method verifi interest properti multiag system research requir formal definit underli commun framework implement defin protocol futur work includ definit predefin compon agenttool acknowledg research sponsor grant air forc offic scientif research bibliographi fox languag describ coordin multi agent system intern confer aaa mit june domain model accept public ieee transact softwar engin wooldridg formal specif dmar intellig agent iv vol berlin jc survei methodolog intellig agent intern workshop agent languag lectur note artifici intellig heidelberg kendal agent role role model intellig agent inform process manag institut user version octob methodolog model techniqu system bdi agent agent break seventh european workshop model autonom agent vol berlin instant uml uk softwar overview knowledg engin review practic methodolog softwar engin java technic tr depart al model design englewood jersei kid program develop system ieee transact softwar engin multiag system ai magazin intellig theori practic knowledg engin methodolog analysi design present seattl
IR/1416 5 evalu select testb experi jame french allison powel depart comput scienc virginia va charl vile school inform librari scienc north chapel hill chapel nc kevin prei depart comput scienc virginia va abstract describ testb select techniqu experi conduct testb testb decomposit data analysi data multipl includ analysi subcollect testb term number queri document evalu distribut relev document present initi result studi conduct testb examin effect ggloss approach select testb rank ggloss techniqu compar ggloss baselin baselin deriv trec relev judgement examin ggloss estim function approxim baselin initi result confirm ggloss estim excel predictor rank rank estim rank introduct inform resourc internet algorithm distribut search result merg increasingli import work support part darpa contract nasa work support part darpa contract permiss make copi part work person classroom grant fee provid copi made distribut profit commerci copyright titl public date notic copi permiss copi post server redistribut requir prior specif permiss fee australia fl acm investig center area gener compar result inquiri paper describ specif testb standard test environ conform evalu methodolog addit describ preliminari result investig undertak evalu collect select algorithm testb testb testb base tipster data trec confer larg collect smaller subcollect serv hypothet distribut inform retriev test environ specif detail decomposit discuss characterist environ follow number research work issu distribut inform retriev system work connect trec tipster data larg corpora usenet group distribut ir research encompass import problem ffl collect select ffl collect fusion result merg ffl dissemin collect inform retriev effect examin tabl show varieti test environ emploi research insight imposs compar find research effort descript data found group sourc db queri gravano group user moffat zobel trec vile french trec callan trec trec fox trec trec tabl summari attribut distribut document collect sampl previou work test data effect sourc data limit relev judgement research limit tradit ir test collect data relev judgement number data sourc potenti greater interest effici data realist start point main problem address partit data subcollect requir ffl natur partit earlier experi involv paramet driven creation document collect partit reflect physic time attribut sourc data trec data referenc term sourc disk subdivid attribut extent candid partit obscur grain possibl ffl subcollect feel realist experi involv distribut document collect hundr particip subcollect ffl tempor dimens specif interest examin differ document collect document partit date ffl easi composit compon creat partit data easili identifi composit creat document twelv subcollect label repres ap document disk standard trec referenc sourc disk number start data particip experi gross characterist data tabl data approxim gb text spread year primari ap newswir wall street journal comput select patent offic disk sourc size size wsj ap fr wsj ap fr ap pat total tabl summari characterist trec data disk disk doe omit san jose mercuri feder regist depart energi trec data sourc easili identifi date compon collect set document doe net result combin attribut trec data requir partit document collect deriv trec disk summari characterist partit tabl num total disk sourc db date rang db wsj ap fr doe xx xx wsj ap fr ap xx xx pat tabl summari characterist document partit total db column sum overlap disk subject except special case note split data sourc month smaller collect specif comment partit ffl doe document doe data ffl document trec disk data disk overlap tempor data disk consid place document involv disk document disk unambigu document id collect id map author violat requir ffl vast size heterogen dozen small collect document size deriv earli pat data ffl fix date increment month sourc partial data continu tempor attribut underli trec corpu ffl disambigu date small number document subcollect date month determin date document date document surround document question document immedi date assign document subcollect year ffl disambigu multipl date pat structur pat document complex refer issu patent file field document oper date subsequ occurr field document refer patent document equal altern partit strategi split data equal size subcollect partit approach attract characterist easi control number subcollect confound held constant chose pursu strategi equal size tempor chunk research interest coverag document sourc date figur research interest examin collect time judici subset basi work wall street journal collect test queri trec confer introduc document set topic set gener batch topic set evolutionari natur relev judgement combin topic document set total topic relev judgement portion trec document tabl summar coverag includ indic subset disk map number repres partit topic coverag import constrain combin topic set document collect distribut retriev experi relev judgement work topic sourc topic set num disk db tabl coverag topic trec disk drawn disk collect deriv disk subcollect work san jose mercuri data disk topic set applic final detail topic set subcollect exclud portion document disk relev judgement select experi section describ preliminari experi select testb problem distribut search fundament specif search chosen merg result interest focu specif activ callan call collect select problem gravano refer text resourc discoveri problem callan gravano formul problem similarli assum group candid search process queri rank decid order search group candid assum prefer order search natur prefer order cast differ research evalu phase work predict rank queri compar prefer order decid rank methodolog work natur comparison differ research group research group point develop fulli section evalu experi investig methodolog test environ compar perform standard standard callan optim rank fulli figur document queri coverag testb partit origin sourc ggloss gravano approach select problem gloss origin assum boolean retriev model gener handl vector space inform retriev model ggloss assum group good respect queri ggloss job estim good candid respect queri suggest rank estim good good ideal rank gravano al make group emploi algorithm comput term weight queri document threshold defin notion good calcul db respect threshold ideal rank queri threshold form sort descend order good note ggloss comput advanc goal ggloss rank compar strategi emploi ggloss attempt estim good creat rank hypothesi util queri express reason measur perform ggloss estim good leav open question good correl relev good estim ggloss vector inform db order make estim document frequenc df ij term db sum weight term document db column sum matrix inform gather period unspecifi mean group formul estim ggloss creat rank queri estim good respect queri wai make report queri term db df df document db assumpt rise estim disjoint term queri document assumpt rise estim case assum weight term distribut uniformli document word ggloss assumpt underli estim number document db similar queri greater threshold form basi ggloss estim good db complet detail calcul estim reproduc refer note threshold estim give ident rank queri experi origin ggloss evalu compar ggloss rank produc rank author argu base relev evalu scheme claim hope tool ggloss predict answer give present strongli feel learn evalu end interest metric user standpoint plan question ggloss estim predict predict rank call optim rank callan rel gravano simpli order number relev document order avoid overload term acronym rank evalu methodolog test ggloss methodolog benchmark full subcollect trec data earlier trec topic test queri set ggloss estim prepar test collect smart version smart paramet consist gravano ffl document index document weight form familiar tf idf ffl queri index queri weight base term frequenc ffl similar measur dot product document queri vector note experi site paramet search engin process queri step prepar union vocabulari incorpor term separ collect gave canon global vocabulari store document frequenc weight sum requir ggloss make estim trec topic index smart convert term list global vocabulari ggloss produc ggloss rank queri threshold ggloss estim threshold valu gravano experi baselin comparison gravano conduct perform evalu ggloss rank baselin produc refer process queri subcollect good rank subcollect rank produc queri relev judgement suppli trec data metric comparison gener agreement type comparison gener problem baselin rank queri rank produc collect select algorithm goal decid candid rank approxim baselin rank chosen approach literatur approach squar error callan report comparison squar error predict rank desir rank group rank candid rank comput mse est base baselin desir rank est predict rank db recal analog section discuss perform metric analog ir metric recal begin introduc terminolog notat make analysi neutral gener includ varieti baselin recal queri provid baselin repres desir goal queri plan queri id mse figur squar error compar algorithm produc estim goal decid approxim assum db collect db queri expect baselin express term expect estim rank formul implicitli explicitli estim merit denot rank posit rank merit merit denot merit rank baselin estim rank note viabl baselin rank case baselin report true assum baselin rank determin sort order merit definit merit gener case perform measur attempt quantifi true estim rank gravano defin rn rn measur merit top rank baselin accumul top estim rank altern definit present perform result definit max bk ordin posit rank breakpoint useless definit defin altern metric rn queri id mse figur squar error compar rank denomin total merit contribut queri rn measur total merit accumul top estim rank measur relat rn rn rn rn rn rn provid perspect select merit estim versu total merit estim rn gravano pn defin pn jt fraction top estim rank merit result follow convent calcul defin number relev document db result squar error evalu ggloss rank baselin standard squar error rank earlier theoret simpli verifi case case produc plot mse queri id error distribut low mse gener compar due scale mse compar small mse valu variabl figur compar graph displai variabl higher mse valu figur compar ggloss rank baselin figur show mse compar figur typic mse compar comparison made determin baselin approxim baselin mse analysi suggest ggloss estim accur model mse analysi suggest strong predictor mse identifi variabl resolv sourc variabl probe section recal analog plot number scatterplot plane point plane repres rn pn valu measur queri compar oper baselin metric plot consid fix valu fix valu chosen determin estim rank perform select small number potenti queri affect plot interpret make distinct clear write rn plot visual distribut show arc center increment line note definit evalu appli baselin rank recal plot ident rn rn plot rn rn produc differ scale outcom plot compar simpli plot compar agreement figur compar queri predict rank agreement pronounc figur figur show perform respect baselin figur typic comparison made ggloss estim baselin count figur distribut histogram distanc show point figur lie radiu point suggest effect deliv document criterion mse analysi suggest strong predictor figur part explan appar contradict result shown figur due distribut figur show rang test time estim rank includ accumul amount merit chanc reason effici desir search collect optim max figur compar optim max figur compar estim merit prefer search select rank list evalu result perspect plot rn pn fix valu figur show result point compar note level figur show fairli uniform scatter point pn rn wider rang suggest top estim rank frequent includ greatest merit plot label figur form eb estim rank baselin rank rn pn metric report gravano comparison figur illustr differ interpret rn rn figur track merit top baselin accumul top estim figur track fraction total merit accumul appar measur produc drastic numer result note plot figur confirm larger scale phenomenon max sum figur rn max sum figur rn max sum figur pn shown figur merit term relev tend rank extrem highli ggloss estim note figur show estim incorrectli predict merit percent time compar baselin result corrobor mse ggloss model approxim made contribut paper ffl standard test environ distribut inform retriev algorithm ffl conduct preliminari evalu promin collect select technolog ffl introduc altern metric rn show relationship rn gravano ffl investig evalu methodolog ggloss estim model accur test environ site index weight search accur approxim express basi similar practic situat confound methodolog document margin similar document larg similar case similar score heterogen document collect essenti reason ggloss correl contrari gener ggloss rank good necessarili rank highest note rigid standard scheme insight technolog realiz potenti merit system intent declar ggloss good discov condit perform intend question algorithm collect select gain insight collect select problem undertak investig reach definit intend reproduc experi test environ assess approach acknowledg walter iii research review thought comment refer nichola paul edward shaw combin evid multipl queri informa tion retriev inform process chri bucklei smart version jame bruce croft search distribut collect infer network intern confer research develop inform page edward prabhakar joseph russel rao combin evid multipl search text retriev confer page novemb jame french charl vile ensur retriev effect distribut digit librari journal visual commun imag lui gravano hector gener gloss broker hierarchi intern confer larg lui hector anthoni effect gloss text discoveri problem page donna harman overview fourth text retriev confer fourth text retriev confer alistair moffat justin zobel inform retriev system larg document collect text retriev confer page charl vile jame french experi drift fourth text retriev confer charl vile jame french dissemin collect wide inform distribut inform ation retriev system intern confer research develop inform page juli charl vile jame french updat term weight dynam inform retriev syst ms intern confer knowledg inform page novemb ellen merg track text retriev confer novemb ellen narendra ben learn collect fusion strategi intern confer research develop inform page ellen narendra ben collect fusion problem text retriev confer page norbert michael rout retriev collect feder environ text retriev confer page novemb
AI/1417 2 integr document cach prefetch storag hierarchi base predict gerhard weikum depart comput po box germani abstract larg multimedia document archiv hold major fraction data tertiari ag librari cost reason paper develop integr approach vertic data migrat primari storag reconcil specul mask high latenc tertiari replac polici document cach secondari primari storag level consid interact polici tertiari secondari storag request schedul integr migrat polici base model predict expect number access document time horizon prefetch initi expect higher document drop secondari storag free space resourc content tertiari secondari storag account dynam assess benefit ing document versu penalti incur time pend document request paramet probabl document interact time success dynam estim evolv workload pattern onlin statist integr polici vertic data migrat implement prototyp system system make profit model schedul volum exchang tertiari storag librari detail simul experi synthet workload gain term client time experi show overhead statist bookkeep comput access predict afford kei perform cach prefetch schedul tertiari storag stochast el markov chain work support esprit long term research project herm high perform multimedia inform introduct problem statement intranet infrastructur gain import medium inform access larg world narrowli restrict bandwidth internet limit amount type data offer web electron product tremend growth multimedia data expect futur rapidli network bandwidth web server dbm manag terabyt byte data provid effici access million client refer data object server gener document multitud document held typic small fraction frequent access hot fraction evolv hot document request archiv access perform reason cold access hour resid tertiari storag librari librari provid access data gener refer resid number typic order magnitud fewer drive volum document high latenc um exchang drive incur time minut crucial hot document held secondari storag level storag hierarchi presenc evolv document popular access disk essenti serv cach regard tertiari storag hot document held cach primari storag level good cach replac polici length document extrem import server perform vertic data migrat primari storag cach hit rate improv emploi prefetch high latenc tertiari storag mask client case design good replac prefetch polici vertic data migrat primari storag substanti difficult standard dbm er manag realiz straightforward approach eagerli initi prefetch document tertiari storag volum prefetch run cach space simplist approach bound fail properli assess potenti cach hit cach space scarc suffici worthi document prefetch cach call polici base good estim access usual dbm page prefetch behalf sequenti scan major problem context quantit assess cach worthi document versu cach standard algorithm lru lack bookkeep inform suscept swamp cach newli document unit data high varianc size dbm buffer manag understood page practic work granul cach polici limit outdat oper system architectur memori applic set overli aggress prefetch detriment effect cach replac possibl reduc effect exploit cach size prefetch data turn access futur quantit understand throttl prefetch activ identifi worthi prefetch candid resourc content tertiari cach replac prefetch schedul polici tertiari storag librari involv transfer rate tertiari storag fairli limit prefetch lead substanti queue delai serv pend document request control tion util tertiari storag drive robot arm tertiari storag librari potenti incur high latenc volum exchang throughput suggest minim volum affect time schedul volum exchang plan carefulli resourc content secondari vertic migrat document schedul polici secondari storag cach resid migrat tertiari storag secondari storag cach primari incur fairli high write load cach client request ultim serv network cach hit requir read cach type disk activ reconcil possibl high content primari storag small amount faster cach replac storag level affect intens read document disk cach memori extra cach effect potenti block document migrat path tertiari secondari insuffici intermedi buffer memori tradeoff consid problem outlin complex manag storag hierarchi intellig manner approach paper heurist address potenti bottleneck develop build block base rigor mathemat reason care assess bookkeep comput overhead contribut outlin paper develop unifi approach cach replac specul base stochast model predict document integr vertic migrat polici schedul polici tertiari storag librari secondari storag cach aim minim time client request approach consid impact potenti cach hit rate secondari primari storag contribut queue delai tertiari storag potenti queue secondari storag disk cach awar similarli work manag larg document archiv addit advanc state art system design major novelti paper li model underli theori dict futur document access model involv access probabl document success request client probabl client request document previou request access document monitor interact time success session arriv rate client session util mathemat result markov chain dict expect number access document time horizon model fit navig client start session access proce hyperlink structur al access typic applic virtual model reli type access mode captur access document affect probabl access document futur model applic equal descript access model transit probabl document reflect document semant relat inform result set queri client cach document automat factor request serv client cach server bookkeep consid paramet perfectli adequ model pursu substanti richer term captur workload class model aim estim stationari access probabl refer document current state activ client request lead tion simpler model evid paramet estim model incur bookkeep overhead reason model receiv attent cach manag memori secondari storag high latenc tertiari worthwhil emploi richer model overhead neglig markov chain literatur access singl client approach proce substanti incorpor client interact time success document request markov reconcil access pattern simultan activ client session global mathemat dynam arriv client initi state unknown access predict base request termin session incorpor time model crucial order captur high varianc client action time document user typic spend time html ment graphic enrich anchor long text imag document complex interest content tool support automat link lead short interact time approach paper initi suggest confer paper paper primari storag cach account perform issu result write cach document secondari storag substanti extend issu gener extend quantit cost model od captur replac cost drop document storag captur resourc content tertiari storag multipl drive accur issu interest consid level storag hierarchi crucial import eral storag hierarchi current paper rest paper organ section discuss relat work section present assumpt system architectur section develop model predict document access section present integr vertic tion polici incorpor schedul polici tertiari secondari storag section discuss bookkeep overhead polici term cpu memori consumpt section overview prototyp implement section present perform result base simul section discuss extens gener develop approach section conclud paper relat work tertiari storag manag file archiv import issu ing polici replac file secondari storag limit simpl base file ag estim stationari access probabl recent work data placement tertiari storag volum request schedul includ work special requir video data motiv larg data volum data tertiari storag manag receiv attent context relat dbm queri prefetch system studi applic futur access pattern larg predict due specif structur underli program access system multimedia applic effect object prefetch implicitli achiev page intellig cluster object page field mobil pursu similar approach refer user program access pattern predict file work prefetch base probabilist model fundament properti page investig focu asymptot competit onlin algorithm practic associ memori approach predict object request initi prefetch major disadvantag approach associ memori offlin render ment archiv evolv workload pattern relev rank scheme buffer video frame multimedia applic aim captur access reli extern input determin relev measur compress scheme base markov chain appli problem prefetch markov chain specul prefetch distribut system gi tailor support singl access sequenc run dedic client applic scenario dynam arriv depart session compet cach space interact time prefetch studi isol mention interdepend cach replac storag devic schedul approach aim reconcil replac prefetch polici page cach assum perfect knowledg futur page access applic hint explicitli special data page access histori method invoc inform prefetch page method work space memori ing replac victim base remain number access method execut develop rule aggress prefetch throttl order avoid effect page replac prefetch page replac cach page earlier prefetch analyz bound suboptim address issu integ optim problem present relax find optimum prefetch schedul develop simpl cost model constant cpu disk access time page request heurist control dynam cach space cach separ prefetch cach approach gear case applic access perfectli predict unix grep command run directori tree problem set work consid threshold throttl prefetch ti stochast viewpoint context prefetch data web server base cost global prefetch threshold deriv term minimum document access ti overload network approach prefetch address server cach manag access predict base discret document access probabl user reaction time consid system architectur document server storag primari storag main memori share processor server smp serv cach hot document transfer buffer ment secondari storag cach hot warm tertiari storag form drive robot arm exchang volum optic disk serv perman home ment point ts load subset volum volum exchang ts constitut separ access altogeth lead storag hierarchi onlin tertiari storag offlin tertiari storag denot set document resid level storag hierarchi assum upper level storag hierarchi form true cach lower level document resid higher level ts subset data transfer path ts ss ps occur document brought ts ps intent write time disk write start document cach situat document brought ps due high probabl request futur singl session load quest serv ps document written ss document request fairli cold ss ps quest satisfi system architectur approach depict figur server deliv ment client ps bring document server retriev document highest storag level copi document resid ps cach document request ss cach brought ps document copi storag level drop speak data migrat upward data migrat lower level higher level place fetch explicitli request document fetch explicitli cach document ss cach prefetch document ps specul anticip fetch prefetch document ps ss write view phase prefetch document ss load offlin volum ts view implicit migrat set document downward data migrat result implicitli drop document resid higher onlin volum ts drive implicit migrat result um exchang perform ts schedul modular assum ts schedul separ compon system architectur gener ts critic ss cach sustain high load continu transfer document ps ss transfer ps ss manag ss disregard schedul issu cpu network tion extens feasibl complic algorithm fig overview system architectur ps ss prefetch fetch document server client ship stochast model section describ stochast model predict futur document access client open session server proce number document access termin model interact multimedia inform system denot document set store server consist document denot set activ user session denot document session request server model request pattern singl session markov chain develop section show section multipl session dynam arriv session incorpor model markov chain model impli interact time success request user exponenti firm analysi www server trace discuss extens captur gener distribut section model singl session markov chain stochast process proce state time epoch basic properti probabl enter state depend current previou histori markov markov chain relev properti mathemat implic time process resid state exponenti distribut random state resid state denot uniqu matrix ij transit probabl resid time hold state transit rate ij state ij ij term state departur rate denot applic state correspond session stochast access document document ij denot probabl session request document request document server state resid time time session resid captur actual interact time human user document content browser process document request interest predict futur access session exploit knowledg session current state relev measur interest probabl ij session state access document time resid state document method perform type transient analysi difficulti appli method fact resid time uniform state overcom appli method uniform transform uniform resid time mean process state probabl time ij ij ij refer origin ij uniform uniform method essenti adjust state transit probabl factor resid involv introduc transit back left state mathemat ij ij max formal proof uniform found central properti exploit epoch uniform gener poisson process rate maximum state departur rate origin transit probabl ij uniform ti session state transit state induct comput equat ij ik kj ij final obtain transit probabl ij product step perform time transit sum product valu part deriv greatli simplifi previou ij ij show section probabl comput effici increment approach infinit sum ij valu denot probabl session resid document time condit session resid document benefici prefetch document tertiari storag disk possibl drop document secondari storag ment interest expect number request document head time horizon postpon discuss set possibl lookahead time section note singl session estim expect number request document reconcil activ session essenti sum expect valu expect amount time session resid state spend state time horizon durat obtain product resid time visit state expect number visit departur state time er departur arriv count complet visit time horizon complet resid differ matter transient time horizon short expect number departur turn obtain sum valu total number transit time product probabl transit perform time state reach state step arriv formula ij ij deriv expect number arriv state access document predecessor state transit ij ratio total time spent complet time expect number complet visit departur final obtain expect number transit multipli expect number departur predecessor state transit probabl jk sum valu predecessor state yield access time ij jk final mathemat found predictor number access ment basi assess benefit prefetch document tertiari storag cach incorpor multipl session dynam arriv termin predict formula deriv subsect hold singl session current state request optim reconcil predictor multipl ongo erat session arriv dynam advanc initi state request document problem easili solv sum ongo expect valu number access document spec number access time jk document session resid current session refer expect expect number specul denot spec addit deriv expect metric potenti interest probabl request document time transient analysi model yield close formula deriv costli calcul expect number access involv addit path markov chain obtain probabl ment access time avoid costli advoc approxim estim probabl access document view process request document poisson process rate access time estim probabl time horizon spec issu newli arriv session disregard ongo session underestim number access document access session access ment arriv eleg incorpor newli arriv session framework simpli add model fictiti state repres passiv client session expect arriv time threshold min assum arriv session poisson process rate state resid time state time passiv client start ident exponenti tion number fictiti state repres entireti passiv client bound solv inequ fraction min session arriv min set min transit probabl stationari access probabl entri document session extend directli appli deriv section state ad thing addit logic add fictiti session resid state set session expect sum number access document comput access greatli simplifi multipli expect ber access singl arriv session number consid session note transit probabl contrast session explicit notion session termin simpli session termin issu request timeout period term model impact termin ongo session similarli ad transit state fictiti state transit probabl denot probabl session termin remain inact timeout access document probabl estim continu monitor transit probabl incorpor gener distribut state resid time www server trace shown exponenti distribut state resid time ture real interact pattern model easili extend er gener distribut approxim actual state resid time distribut gener random sum distribut scale paramet valu state gener distribut resid time map consist branch sequenc state exponenti distribut resid time exponenti distribut resid time directli incorpor framework figur depict resid time random probabilist sum distribut distribut wide spectrum gener distribut coeffici variat rang branch probabl state resid time determin moment actual resid time distribut jn fig model state gener distribut state resid time jk ij transit state transit state substat jn incorpor expect number access document time obtain sum expect number access time substat method involv introduc addit state incur higher overhead map document resid time approxim exponenti distribut number addit state small unimod distribut distribut probabl densiti function singl distribut interest applic context integr migrat polici section present vertic migrat polici aim reconcil prefetch tertiari storag secondari primari replac primari secondari schedul volum exchang algorithm base expect number cess document deriv section give overview algorithm tion present prefetch replac algorithm subsect prefetch request schedul ts subsect write request schedul ss cach section subsequ elabor tertiari storag schedul volum exchang section final subsect discuss lookahead time horizon predict overview algorithm approach quantit assess worthi ment respect improv time document request algorithm aim place worthi document ss document cach ps static result migrat step account dynam evolut server load measur worthi aspect heat document access frequenc estim lookahead time window size contrast earlier work base approach consid current state server session activ client react ical state gener load paramet estim heat document expect number access time deriv previou section model deal normal heat metric order obtain benefit space unit divid heat document size deriv temperatur similar worthwhil discrimin document resid level storag hierarchi incur cost retriev document document cach highest decid worthi document regard cach import document fetch ss resid possibl captur replac cost document cost incur retriev highest lower storag level copi resid worthi document proport replac cost put aspect yield definit weight base weight approach maintain list document top document term weight chosen document complet fill cach space ss ss cach larger ps document list prefetch ps ss ps cach weight exce maximum weight document drop ps ss replac victim order make space replac cost refer current storag level prefetch ps ss replac victim replac cost refer highest storag level level drop document weight metric tent identifi prefetch candid replac victim prefetch reconsid late sibl input paramet chang time ts start data transfer prefetch weight document select replac victim ps ss reevalu turn prefetch request longer cancel point import aspect lead cancel prefetch request overli aggress prefetch lead content ts drive robot arm ts crucial potenti interdepend data migrat ts request schedul solut throttl problem assess individu prefetch serv onlin actual benefit prefetch penalti request incur futur request defin benefit prefetch request aggreg save time futur request prefetch penalti prefetch request aggreg delai product request time delai section deriv formula benefit penalti metric benefit penalti prefetch request comput request reflect load paramet intermedi formula precomput point make assess suffici effici onlin prefetch request initi benefit exce penalti cancel similar activ throttl ss potenti point content read request fetch cach document ss ps deliveri client delai write request prefetch fetch document ps cach ss cach address issu assess benefit penalti document write formula deriv section integr migrat polici view process stage perform stage tent identifi prefetch base rank document descend insert prefetch request queue ts um stage prefetch request serv onlin volum select lowest rank document target level ps replac victim compar weight document chosen victim document weight smaller maximum weight prefetch request cancel prefetch request consid benefit penalti comput penalti prefetch term delai exce prefetch request cancel stage prefetch fetch document written ps weight comparison comparison repeat write request cell comparison document longer suffici worthi scenario action polici scenario depict figur figur show document resid onlin ts document onlin ts shown order serv volum scan heat document shown simplic assum document unit size client explicitli request document ts scan reach posit document document worth cach potenti victim document lower heat cach disk penalti prefetch point incur request explicit client request delai prefetch compar benefit prefetch penalti regard quantit detail figur simpli assum benefit lower penalti cancel prefetch request fig scenario integr migrat polici ss ps pend request pend request initi situat ss ps pend request pend request situat fetch ps ss ps pend request pend request situat fetch ps ss ps pend request pend request situat prefetch ps ss ss ps pend request pend request situat fetch ps document fetch ps pend request determin replac victim lowest drop retriev ts offlin retriev lower cost ss account replac cost suggest replac victim ps level focu moment document brought ps request ss schedul consid write ss cach write delai fetch document ss request client client request arriv immedi fetch trade benefit ss cach avoid futur ts versu penalti incur read ss outcom comparison time delai high write cancel space impli drop ps complet deliveri request client document ps prefetch document weight reassess lowest rank ps found worth prefetch ps final question overli effect pend request document scenario compar fit cach ps versu penalti prefetch request incur request assum benefit exce penalti ps reclaim space drop assum weight exce weight pend request ss drop document ss ss quickli final pend request immedi ps space temporarili occupi ps document ss fast order reclaim valuabl ps current situat content outstand ss read scenario give albeit exemplari impress made migrat algorithm prefetch replac document access time tertiari storag order magnitud higher disk import initi object migrat polici maxim number document request serv disk maxim cach hit rate cach worthi document reflect spec spec denot number specul request formula normal cach worthi byte deriv spec maxim cach hit rate sole rank document descend order highest fraction ps ss order minim factor replac cost document rank lead weight document point ideal assign document ps ss cach reflect rank document descend weight approach ideal rank behavior onlin migrat algorithm consid prefetch request document weight exce document algorithm maintain rank list descend weight top document consid prefetch chosen space capac ss cach complet exhaust document document element top document cach primari secondari storag prefetch tertiari storag document prefetch weight document prefetch compar weight replac victim prefetch cancel replac victim mine base ascend weight order start bottom sort list point bookkeep cost polici assess weight inform readili number pend request document size number specul request deriv model core approach assum inform onlin relev document replac cost document problemat glanc bookkeep highest storag level cach document resid drop replac cost document depend storag el inform highli dynam ts volum drive statu onlin replac cost cach document ps cach document resid impli rank document ss ps cach recomput volum exchang ts contrast stabl valu evalu lazili bookkeep cost weight metric lead tion document ps maintain rank weight metric justifi number document ps cach low expect fairli larg document multimedia ss number ment maintain rank basi stabl ture metric hold tent identif prefetch candid stage prefetch request serv weight compar weight select replac appli comparison base full weight metric candid document prefetch weight exce maximum weight replac victim avoid maintain complet rank cach document weight remain point actual deriv replac cost ment distinguish document copi document drop retriev ss relev ps cost retriev document back time ss condit probabl access lookahead time window replac cost amort spec expect yield rc ss spec rt ss spec rt ss denot empir estim time ss document size spec probabl access time time document copi drop document retriev distinguish onlin versu offlin case offlin document onlin assum situat entir lookahead time window cost retriev back time offlin document rc rt onlin document determin remain onlin time volum volum offlin point head time window remain onlin time continu chang time avoid continu estim onlin volum deriv time success volum assumpt ts robot arm perman busi exchang view constant easili measur volum robot arm make random choic onlin volum determin number volum exchang volum remain geometr surviv exchang expect number exchang onlin time volum time period length remain time current period estim hold volum schedul volum exchang robot arm move set remain onlin time put yield formula onlin time volum schedul final replac cost onlin document comput condit sum remain onlin time replac cost time onlin ts condit probabl cess onlin time cost paid spec expect normal request basi fraction lookahead time window volum expect expect request pai cost offlin probabl request remain onlin period yield rc spec rt spec spec rt prefetch request schedul onlin volum tertiari storag gener assum ts schedul aim maxim throughput ts batch request scan elev servic polici volum schedul maintain queue queue pend request issu queue specul prefetch request prefetch sider worthwhil scan polici begin forward backward sweep track onlin merg current content queue singl request queue order track number schedul repeat volum sweep decid exchang drive load offlin volum drive polici volum exchang separ migrat polici modular simpl advanc polici consid heat document favor discuss section invok larg number specul prefetch request onlin volum result delai request pend prefetch volum onlin penalti recogn quantit assess migrat manag order throttl prefetch activ avoid form content onlin introduc step cancel prefetch request immedi ts start serv compar prefetch candid ps replac victim term weight incent base assess heat comput benefit document prefetch term expect document higher level storag hierarchi comput penalti prefetch incur pend request ment onlin ts pend request delai yield impact time metric compar number request time time improv decid cancel prefetch request penalti exce benefit benefit prefetch document onlin volum estim prefetch save fetch request document mask latenc onlin ts request arriv remain onlin time benefit equal prefetch explicit fetch request hold fetch request su volum probabilist probabl fetch request remain onlin time probabl visit spec analyz section time horizon set onlin time deriv section section replac remain onlin time volum onlin time tractabl reason time delai save prefetch time fetch onlin time document size rt onlin time volum assum volum offlin prefetch document potenti save delai request offlin ts number request benefit prefetch equal expect spec deriv section term relev explicitli request onlin time condit factor spec altogeth yield formula benefit prefetch spec rt spec spec rt evalu bookkeep inform comput major build block previou section estim penalti prefetch request incur outstand realiz prefetch request delai pend request document volum length delai servic st read onlin ts penalti refer request volum hold onlin categori penalti fact prefetch request potenti delai delai pend request serv remain onlin time pend request offlin volum delai hold volum schedul prefetch request extend onlin time lead estim penalti penalti ts pend st pend st schedul pend number explicit client request document write request schedul secondari storag cach similarli content ss bottleneck potenti point content read request fetch cach document ss ps deliveri client delai write request prefetch fetch document ps cach ss cach natur data transfer path dynam reconsid disk util ss level critic occur document prefetch behalf singl session mask high ts time written ss heat drop sharpli write request cancel make involv kind assess introduc schedul prefetch request ts level differ detail underli quantit formula benefit assess fact ident deriv section benefit captur expect improv result cach document disk access tertiari storag consid section write document ss delai pend request length delai disk servic time write document size denot st ss yield formula penalti ss penalti ss pend st ss disk schedul consid document write ss remov ps document drop ps fetch request ts ss fetch ts replac document ps lowest weight save document ss ss schedul maintain list document ascend weight order start document lowest determin set candid fetch request pend document consid replac fetch prefetch request ts drive denot averag document size number ts ps cach size freed case fetch request pend ps space freed ss read request consid addit space ts read case requir document ss free space unit ps size document read ss ss schedul consid document ascend weight order total size exce requir amount ps initi write request order write request assess pend ss read request perform comparison candid note case write request penalti empti disk queue note candid end overwritten ps cach save benefit smaller penalti regard pend ss read request schedul volum exchang high delai incur volum reason tertiari storag ing polici attempt batch request volum limit minim time wast volum exchang hold pend request specul fetch pend request critic term time postpon benefit batch schedul polici advoc queue pend spec volum id pend request specul ing request issu long pend queue volum load drive pend request prefer volum high number pend denot pend set volum prioriti basi danger request starvat prevent volum load drive descend order product pend wait wait longest wait time pend request volum volum load pend request prefetch request combin reorder serv sweep volum point benefit penalti serv prefetch request prefetch request cancel section volum subject final sweep perform volum weight document prefetch benefit penalti section request arriv final sweep posit volum pass held back queue time volum load drive regard explicitli issu pend schedul polici load volum sole serv specul prefetch request volum select polici advoc give prefer volum high number expect access um simpli sum expect number access prefetch candid document resid maintain queue volum descend order total number expect access refer algorithm expect access polici result stochast model section initi prefetch serv heurist schedul volum exchang lookahead time horizon migrat polici crucial depend proper set lookahead time horizon plai promin role predict benefit specul request true choic paramet perform set small mean highli specul request recogn set high overestim benefit specul request high content ari storag drive case lead situat volum load drive sole behalf specul request explicit pend request issu delai long time specul request queue volum drive long secondari storag space scarc prefetch prefetch document replac document turn earlier fetch simpl set lookahead time horizon averag time period success load metric onlin denot load final sweep volum subject latest point time document prefetch volum request document result pend request offlin volum order avoid cach specul request time volum onlin load time unit consid load lower bound lookahead time horizon specul request arriv time load consid request suffici prefetch document volum load time specul request time load prefetch document volum load wast cach space show load upper bound lookahead time access predictor load canon choic lookahead time implement bookkeep section discuss implement overhead bookkeep access prefetch replac tertiari storag schedul er consumpt memori space cpu time statist state transit probabl dynam ag counter frequent transit state resid time total resid time visit paramet set incur space overhead grow quadrat number document transit probabl matrix typic provid workload exhibit spatial observ web server trace reason assumpt statist inform hash tabl index state time session state request document expect number futur access document chang equat graph markov chain start transit state highest probabl reach visit state ij increment product resid time accumul probabl reach time equat procedur termin probabl reach state lookahead time drop threshold set note stop threshold bound overhead note entir comput increment intermedi result extent final note comput ij valu subsequ access predict er long basic statist transit probabl state resid chang real expect base major shift occur scale algorithm gener prefetch request decid cach replac driven sort list doc list document document weight document weight determin tent prefetch candid section list order aggreg size inspect document exce total space capac ss cach inspect document cach ss prefetch request gener ps list document document weight document cach ps ss list document document weight document cach ss list sort document weight sort adjust time session state case small ps sort adjust exchang volum discuss section list ps ss determin replac victim ps size list depend number document resid storag level incur neglig space head size doc bound document session predict access document time probabl threshold overhead tertiari storag schedul neglig track valu spec pend wait volum basi recoveri bookkeep data bookkeep data main memori lead loss data server crash bookkeep data sole serv control cach loss result futur affect princip function document archiv infrequ access reconstruct lost ing data state resid time state transit long result perform degrad extend time period data stabl storag secondari background process period copi updat bookkeep data main memori stabl give prefer data document high number access save bookkeep data frequent access document statist chang significantli loss statist data highest impact server bookkeep data load stabl storag main memori cach bookkeep data statist state resid time state transit probabl main memori document archiv million case storag requir bookkeep low compar document data bookkeep overhead document archiv reach ten hundr exce amount main memori pose server emploi cach replac strategi ing data object replac bookkeep data main memori frequent algorithm comput expect number ture access document algorithm statist start current document session navig document transit frequent statist statist document high expect access tion access guid cach bookkeep data weight bookkeep data document defin analog document access document size bookkeep data bookkeep data minimum weight chosen replac main memori storag manag migrat manag session manag disk weight timeout loader ss ts schedul spec pend fig overview prototyp system pend rt ps doc main memori spec spec rt rt ss st ss st pend ss schedul pend prototyp architectur section describ architectur implement detail document archiv prototyp figur show gener architectur data structur depict oval dynam adjust control paramet depict hexagon top system consist session manag maintain inform state activ tion manag predict schedul document storag manag session manag track arriv session current state activ decid session termin mean timeout discard bookkeep inform session manag implement thread receiv document request signal underli migrat receiv signal migrat manag complet document transfer client migrat manag organ migrat document tertiari secondari storag primari storag serv prefetch request pend request consist loader schedul document migrat ts ps ss ps ps ss loader control exchang volum migrat manag thread implement schedul loader track onlin statist weight estim replac cost benefit penalti document migrat import submodul migrat manag weight implement access predict manag list sort document weight weight inform volum statu onlin ber specul request volum request session session arriv departur signal weight updat volum inform ment weight section weight gener prefetch request loader prefetch weight migrat perform potenti replac migrat account section weight inform perform migrat volum statu weight consult volum exchang form concurr updat retriev bookkeep data provid weight standard primit thread synchron base interfac secondari storag disk tertiari storag maintain directori inform address map tabl free space manag alloc algorithm cach level tertiari ag volum storag manag interact real simul devic librari detail devic model base csim simul packag late devic includ control realist seek rotat head switch paper consid simul devic reproduc statist confid perform result evalu section present simul result perform overhead vertic migrat polici restrict studi synthet workload kei paramet current web applic contrast higher statist confid abil systemat vari paramet obtain insight load expect futur applic compar variant markov chain base migrat polici pure migrat polici polici polici schedul volum exchang markov chain base migrat polici storag polici base integr vertic migrat polici develop paper number specul request deriv model gate variant basic document weight consid ture replac cost formula set unit storag level retriev basic polici eagerli prefetch document base weight comparison replac victim perform comparison account sibl content ts ss devic section polici extend basic polici replac cost weight metric ad comparison fledg variant includ section polici basic variant prefetch switch strictli weaker variant correspond pure cach replac polici access predict intellig choic replac victim temperatur base migrat polici temperatur base migrat weight document temperatur heat heat document reflect stationari access dynam estim track move averag interarriv time request document method view straightforward gener cach algorithm case buffer granul consid variant base variant counterpart basic enc temp initi prefetch select replac victim base document term temperatur estim replac cost consid temp comparison perform variant extend temp replac cost compar fit penalti prefetch request stationari counterpart variant basic temp polici prefetch switch testb experi carri prototyp system section simul secondari tertiari storag devic paramet devic experi tabl devic reflect todai scsi disk ratio ts drive volum chosen high captur influenc ts volum exchang schedul experi set carri essenti show effect trend report special case ts drive report secondari storag tertiari storag paramet paramet number disk number drive averag seek time ms averag seek time ms averag rotat latenc ms averag rotat latenc ms transfer rate transfer rate control cach size mbyte control cach size mbyte number volum volum exchang time tabl system paramet simul testb consid archiv document size exponenti distribut kbyte total archiv size approxim gbyte document alloc randomli volum tertiari storag librari analyz trace virtual museum skew transit probabl tion state resid time incorpor observ synthet workload realist larg archiv investig wide spectrum load synthet workload gener document arrang tree constant fanout tree serv skeleton gener state cycl document node transit probabl document ancestor gener gamma distribut coeffici variat greater captur skew rank transit probabl document start document proce ment number modulo total number document mean tion lead leftmost child transit ancestor node tree leaf document transit target sen randomli document skew transit probabl document determin expect gamma distribut transit probabl drawn assum valu exponenti distribut document gener paramet gamma distribut exponenti tion set impli percent probabl mass ment outgo transit cover probabl transit document document section treat separ successor repres document gamma distribut state set impli percent probabl mass outgo transit cover probabl successor state state resid time exponenti distribut valu drawn uniform distribut session arriv poisson process rate exponenti distribut interarriv time durat session term number request session number gener normal distribut consid workload differ session arriv rate distribut resid time workload low session arriv rate high state resid workload lower resid time workload higher session arriv rate differ resid time workload paramet list tabl paramet session interarriv time session length request standard deviat session length request minimum resid time maximum resid time tabl workload paramet simul experi fig time result workload disk memori cach size disk size memori size disk size memori size disk size memori size disk size memori size result concentr omit result temp consist variant time result remain polici depict figur load chart show time client request size ry secondari storag cach space note disk cach size correspond percent total archiv cach size reason size rel archiv size small sake experi limit comput note result scale extrapol straightforward manner archiv cach size constant provid skew access pattern remain invari term fraction frequent transit number drive detail tabl show hit rate time storag level workload mbyte disk cach memori cach size time figur close neglig rel time storag level disk size memori size polici rt hr ps hr ss rt ss hr rt hr rt mb mb mb mb mb mb mb mb mb mb mb mb mb mb mb mb tabl hit rate time storag level workload evid newli develop polici prefetch outperform polici includ basic improv time factor highest gain achiev lowest interarriv time explicit client request leav time prefetch document tertiari storag detail tabl show workload mbyte disk cach mbyte memori fraction request refer offlin tertiari storag percent percent significantli hit rate hr ps hr ss document ps ss inher limit inform knowledg stationari access probabl polici fail fetch relev document fairli cold term stationari access probabl high access probabl session resid document nice illustr fundament superior base approach stationari probabl model polici reduc time basic polici percent larg size disk memori ment tent prefetch request lead improv reason prefetch activ disk memori cach potenti lead prefetch document low expect number specul request cost delai pend request experi report shown compar influenc case ts case prefetch delai pend request entir server case larg disk cach size small memori cach size mb mb tion tabl ps bottleneck replac cost document benefici hit rate ps higher reason inher maxim ps hit rate consid replac cost document prefer replac document ps cach ss load onlin ts volum replac throughput prefetch request ss hit rate ss tabl investig ps significantli reduc hit rate request onlin offlin hr hr drawback higher prefetch activ high time fetch request serv ss onlin ts volum cialli small ps document high weight frequent replac ing disk import compar benefit penalti fetch document ts ss yield time improv note fairli high ss time high disk util due ss larg document intens activ ps ss high disk util ss serv cach mask larger latenc offlin ts extent comparison polici prefetch switch polici show larg ss benefit prefetch form lose small disk cach ss hit rate benefit schedul algorithm base predict stationari heat conjunct polici achiev significantli hit rate onlin ts volum addit experi variat workload paramet essenti confirm ing omit breviti investig bookkeep overhead prototyp implement total space overhead bookkeep data polici mbyte gbyte document cpu consumpt predict session includ markov chain comput adjust sort millisecond averag faster commod translat cpu time order secondari storag access time small price achiev substanti gain term client time cpu overhead reduc moder number recent comput predict special lookup buffer extens gener appli access predict base markov chain problem prefetch document storag hierarchi storag model interest potenti approach optim issu applic area load consist interact access pattern client session document document archiv randomli distribut volum ts random distribut typic lead number pend request offlin volum intellig cluster document volum number pend request onlin volum render ing polici effect cluster document exploit access predict model scenario multipl session pend request volum load drive document high heat session resid volum cluster base markov chain predict studi context system cluster object limit markov chain interact resid time approach increment document archiv electron dynam continu extend document content document chang lead evolv access pattern document creat document held time secondari storag collect bookkeep inform access note document updat document typic popular document frequent collect bookkeep format document time bookkeep data insert updat document suffici document migrat tertiari access pattern desir ment reclust due evolv access pattern reclust mental concurr normal oper server reclust document base principl static cluster document data parallel declust data object multipl devic standard techniqu presenc evolv workload horizont data tion devic storag level dynam mental load balanc disk markov chain model substanti richer model explor manc improv prefetch cach web internet larg proxi server cach document access local client reason cach document provid perform deliv request document fast proxi server depend poor network perform iti document sourc reason mask unavail ment comput network failur intent comput larg busi unit typic server avail characterist cach cach document home server expect unavail futur server announc proxi server start prefetch document server order mask announc offlin time intellig choic made document worthi prefetch migrat strategi develop paper appli problem fairli straightforward notion server offlin similar ts volum offlin data mobil similar maxim data access avail problem cach prefetch document mobil comput predict intellig decid file mobil comput disconnect data dissemin broadcast asymmetr network bandwidth send versu receiv data client server broadcast inform mobil client depend wireless commun broadcast serv minim explicit data request mobil client server idea broadcast data item high frequenc network data lower frequenc interest investig predict adapt broadcast frequenc dynam evolv mobil client conclud remark vertic migrat method storag hierarchi present paper base quantit assess benefit cost cach replac tion specul schedul tertiari secondari storag devic kei reconcili aspect markov chain model develop predict access underli mathemat theori analyt model kind deserv attent abil drive onlin resourc manag inform system note develop method ly requir human administr tune expert input paramet automat estim mean onlin statist method includ number control paramet provid practic viabl guidelin robust valu paramet studi shown richer stochast knowledg markov chain model substanti outperform simpler model sole base stationari probabl intrigu appli richer approach issu storag system distribut cach exploit aggreg memori network care regard overhead markov chain model gain richer model order case tertiari storag comput overhead order millisecond space overhead order megabyt worthwhil tune disk access remot memori order faster rule sort markov chain model successfulli emploi storag hierarchi high latenc level paper form model make intens cach precomput estim cach meta combin markov chain predict specif interest simpler ty access predict major data encourag excel result research direct storag manag worthwhil explor refer broadcast data manag asymmetr commun acm sigmod de refer local int conf parallel distribut inform system miami prefetch broadcast int conf data minim stall time singl parallel disk technic report institut comput queue theori comput scienc academ specul data dissemin servic distribut inform int conf data studi integr prefetch cach acm sigmetr implement perform integr prefetch disk technic report princeton perform issu int conf parallel distribut inform system miami exploit inherit structur semant effect ing buffer dbm acm sigmod practic prefetch data acm sigmod optim storag object mass storag system robot int conf extend technolog principl optim place data ari storag vldb data placement acm mod user softwar austin user guid librari secondari tertiari ag devic simul cooper remot client memori improv file system symp oper system design optim placement randomli retriev block optic acm transact inform prefetch support relat object int workshop object store cluster ject theori int conf foundat data organ algorithm analysi stripe techniqu robot ag technic lo minut rule trade memori disc access byte rule trade memori cpu acm sigmod san random schedul onlin tertiari storag acm sigmod network prefetch ieee journal select area indic data int conf data autom mobil acm symposium oper st octob markov ieee symposium foundat comput vertic data migrat larg document archiv base vldb storag server multimedia int conf data buffer manag strategi interact data flow multimedia vldb relat join data tertiari int conf data stochast queue theori mathemat comput perform simul studi migrat scalabl tape int conf system advanc page replac algorithm disk acm sigmod inform ing acm symposium oper system cach learn vldb introduct disk ieee comput queri process tertiari memori vldb long term file develop evalu acm data intellig cach vldb manag persist object acm sigmod onlin method distribut int conf data disk cool parallel disk ieee data engin bulletin data partit load balanc disk vldb optim data placement solut herm technic multimedia system institut manag ibm buffer maxim ibm system journal stochast model algorithm john wilei stochast approach cluster object acm sigmod perform object cluster acm sigmod san data elev hierarch multimedia ag vldb memori manag scalabl web data int conf data comfort automat tune inform system algorithm studi mass storag comput scienc prefetch realtim acm sigmod
AI/1418 2 confer comput pp vol optim motion minim paramet fr inria av de st franc www abstract address problem optim project motion minim set paramet exist work problem simplifi estim process ensur comput cost unknown involv method kei featur number paramet emploi minim method requir singular decomposit minor algebra manipul straightforward implement plug optim algorithm version method reli orthonorm camera motion introduc local updat minim paramet give detail descript implement case bundl adjust correspond maximum likelihood estim fundament matrix scene structur extend algorithm case straightforward result simul real data show algorithm base minim paramet perform term comput converg achiev compar result term converg local optimum implement method made introduct problem recov structur motion imag central challeng comput vision imag featur correspond view studi geometr aspect imag format process led numer techniqu act affin project depend camera calibr partial solut obtain linear techniqu motion structur recoveri jointli subsequ refin effici techniqu structur motion optim bundl adjust involv minim cost function base discrep origin imag featur behaviour term converg properti local optimum cost function comput greatli depend algebra structur numer condit number paramet emploi minim bundl preserv origin model imag featur crucial bundl adjust theoret correspond maximum likelihood practic optim problem emploi cost function local minima optim process trap address problem repres motion goal obtain minim number paramet consid optim minim focu project camera calibr unknown topic primari import accur project reconstruct subsequ succe perspect view rigid scene imag signatur rel posit project motion epipolar homogen fundament matrix mental matrix freedom paramet optim project motion exist fundament matrix paramet due constraint ambigu exist work fall entri perspect camera matrix unknown involv simplifi multipl minim minim combin imag transform reduc number techniqu optim paramet fundament matrix ad constraint normal constraint virtual ment paper make contribut address project motion case introduc call orthonorm project motion base show estim project motion minim number paramet import point method depend optim techniqu consid illustr method bundl adjust framework base result minim maximum likelihood estim fundament matrix scene structur reader interest practic issu refer directli section extend framework multipl view introduc orthonorm project motion similarli mean perform optim minim set paramet result simul real data shown show algorithm base minim motion orthonorm perform term comput achiev perform term converg properti project motion preliminari uncalibr perspect camera matric due freedom freedom coordin frame ambigu structur project motion freedom fundament matrix entri freedom homogen rank extract project matric view fix coordin frame project matric constitut realiz fundament matrix famili common choic canon project matric defin kernel canon plane defin canon coordin frame provid normal constraint unknown constant conveni choic method note mean entiti repres homogen defin scale relat previou work previou work minim project motion deal directli epipolar geometri fundament matrix epipolar lb project transform relat epipolar repres homogen repres entiti minim paramet requir elimin homogen normal largest entri yield possibl epipolar obtain fundament matrix entiti extend epipolar transform canon plane requir distinct model case case coincid previou author restrict configur consid case finit express affin coordin due homogen epipolar distinct uniqu form tal matrix method extend gener finit infinit shown full distinct lead cumbersom implement optim process method reduc number imag transform imag transform metric number distinct restrict bilinear constraint entri transform reduc number main drawback transform imag origin model imag featur preserv mean preserv order bundl adjust orthonorm deriv introduc call orthonorm project motion fundament matrix motion matrix fundament repres motion project motion repres uniqu fundament matrix deriv minim project motion fundament matrix impli straint normal fix rel scale fundament matrix previou work shown constraint tricki enforc directli fundament matrix overcom directli fundament analyz singular decomposit orthonorm matric diagon singular valu orthonorm deriv enforc strictli posit scalar homogen scale singular decomposit rr decomposit show project motion repres orthonorm matric scalar orthonorm project motion lie group orthonorm matric minim freedom easili comput singular decomposit fundament matrix note correspond case essenti camera calibr element repres uniqu motion uniqu fundament matrix matrix normal constraint enforc fundament matrix orthonorm orthonorm freeli switch sign leav repres motion invari space fundament matric orthonorm minim estim recov entiti fundament matrix orthonorm resent recov simpli singular ui vi column potenti applic orthonorm bundl adjust extract project matric fundament matrix achiev directli orthonorm recov canon plane equat column canon plane formul yield canon plane project matrix normal constraint discuss satisfi canon basi optim process estim minim paramet orthonorm motion local updat estim minimum paramet updat minim paramet examin case rotat exist complet set rotat space rotat matrix minim euler angl lead singular find local minim neighbourhood estim process rotat minim current local updat typic rotat matrix local updat minim local euler angl method recoveri metric structur updat reset iter optim scenario project motion exist complet space local updat estim minim paramet orthonorm tive motion matrix local updat paramet method rotat scalar ensur complet remark immedi method configur cover fact posit neg updat posit determin sign chang optim process claim problem fundament reach initi guess prove show fundament matrix repres altern sign switch due singular equat observ column affect result constrain orthonorm sign arbitrarili switch sign determin matrix switch sign dec leav invari repres fundament matrix conclud proof implement detail rr boundari problem motion valid possibl ensur boundari linear constraint enforc boundari iter leav current estim invari found experi affect behaviour underli optim process proce rr rr rr easili check orthonorm leav repres motion invari bundl adjust show orthonorm bundl adjust point featur view summar tabl similar result deriv minim distanc point epipolar line criterion project bundl adjust express framework initi guess fundament matrix denot add step initi orthonorm scale singular composit vt turn full camera jacobian matrix minim matrix orthonorm rth rth equat chang paramet updat step updat orthonorm yt motion updat updat structur paramet ad increment vector comput error add step return comput equat uv tabl implement minim estim bundl adjust framework note number residu project matrix extract orthonorm equat comput error cost function bundl adjust consist solv optim min motion structur paramet paramet updat vector residu point residu error qi qi imag point reconstruct point depend project matric current motion estim repres correspond realiz fundament matrix shown equat canon realiz directli obtain orthonorm analyt optim wide necessit comput jacobian matrix residu vector respect motion structur paramet achiev numer finit differ analyt form comput effici numer accuraci focu comput depend structur number entri consid fix canon reconstruct basi depend chosen realiz fundament coordin frame emploi chosen canon project matric jacobian matrix emploi directli deriv analyt form op relat orthonorm motion concentr deriv express rth minim method jacobian matric deriv advantag updat scheme shown tabl base exist simpl express rth orthonorm motion updat paramet minim defin updat updat respect current rth evalu ao updat equat deriv express canon project matrix orthonorm differenti evalu express oa cx case extend project motion multipl view model addit view orthonorm project motion serv element optim project motion minim paramet model addit view view coordin frame fix tional view free gaug complet project matrix model project matrix freedom wai sider metric decomposit decomposit deal uncalibr camera interpret plane respect refer project matrix repres view scalar account rel scale freedom interpret relat relat previou work common strategi optim homogen entiti entri normal constraint norm drawback method paramet comput cost estim process numer instabl renorm iter fix entri singular main drawback techniqu uniqu minim suffic express case lead necess multipl express jacobian matrix implement issu orthonorm orthonorm deriv cm inhomogen scale version freedom encapsul rel scale directli element homogen case fundament examin singular decomposit orthonorm matric diagon singular valu canon plane orthonorm write deriv orthonorm start point minim estim transform obtain orthonorm denot minim freedom optim minim paramet mimick method project motion obtain minim estim project motion set camera repres orthonorm project motion fix coordin frame view model orthonorm matrix updat minim paramet directli optim deriv algorithm ensur boundari solut jacobian matrix residu respect motion paramet deriv manner similar case advantag directli comput lead part orthonorm project line estim symmetr cost function result simul data compar algorithm orthonorm motion tabl exist simul data method perform optim point minim test bench consist point ly insid sphere radiu meter observ camera focal length number camera center sphere situat distanc meter baselin consecut camera meter point gener project imag corrupt addit center gaussian vari standard deviat measur quantiti characterist bundl adjust comput cpu time converg error versu standard deviat ad imag measur error current estim function time optim process plot correspond median valu trial bundl adjust initi valu obtain point algorithm triangul method view view regist turn linearli comput camera matrix compar minim method tabl map minim method research report method number unknown free entri camera matric measur prevent gaug drift partial free gaug complet camera matric imag standard deviat imag standard deviat fig comparison cpu time converg error converg versu vari imag method conduct seri experi camera observ figur roughli method converg minimum cost function method reliabl converg free figur show roughli converg big discrep comput cost method method highest comput cost normal explain fact method unknown estim minim requir comput time iter perform method minim number lowest comput roughli light clear method minim paramet prefer comput cost converg properti method reli orthonorm paper advantag simplic order understand explain behaviour measur number iter comput cost iter result shown figur imag standard deviat time fig comparison number iter converg versu vari imag evolut error map tabl cpu time iter method found method free leav gaug drift freeli bad converg perform roughli figur method normal perform ber iter smaller method involv solv linear system tabl method minim number paramet number iter comput iter low comput cost number iter free gaug method normal explain method achiev lowest total comput cost figur show evolut error optim process experi time converg measur highli depend converg threshold consecut account abil algorithm reach converg experi conduct test bench level imag point posit pixel figur method base minim reach converg normal method roughli free method time conduct experi view observ differ algorithm observ case requir lowest comput time experi converg properti algorithm case yield similar case experi real imag valid algorithm real imag case imag order cover possibl close imag pair imag shown figur initi valu structur motion comput case simul data fig real imag valid algorithm result shown tabl combin imag pair estim cpu time converg error converg row tabl show valu algorithm set imag pair result confirm obtain simul data map free oo oo oo tabl error converg time converg obtain combin pair imag figur test algorithm imag figur initi valu obtain regist view initi guess structur motion obtain result algorithm converg final error pixel rel perform term comput time converg obtain case view studi problem optim project motion minim set paramet orthonorm project motion show local updat project motion minim set paramet canon project matric directli extract orthonorm extent project motion deriv orthonorm method plug optim gave express jacobian matrix residu respect motion optim techniqu introduc orthonorm power tool minim optim homogen entiti conduct experi simul real data method base minim paramet set perform term comput cost achiev result term converg properti interest result obtain case exist algorithm constrain gaug mean perform make implement method futur plan investig orthonorm introduc paper model algebra entiti minim estim techniqu refer sturm algorithm project bundl adjust minimum paramet research report august horaud project structur motion view planar scene intern confer comput volum page juli zisserman model acquisit extend imag sequenc buxton european confer comput volum lectur note comput page april hartlei defenc algorithm intern confer comput page june hartlei sturm triangul comput vision imag ri hartlei euclidean reconstruct uncalibr view darpa esprit workshop applic comput page octob ri hartlei project reconstruct invari multipl imag ieee transact pattern analysi machin octob ri hartlei zisserman multipl view geometri comput vision cambridg june irani parallax geometri pair point scene analysi european confer comput page qt faugera fundament algorithm stabil analysi intern journal comput qt canon geometri multipl project view comput vision imag pf gaug invari project reconstruct fort error surfac structur motion technic wh sa wt bp flanneri numer recip art scientif comput cambridg cc editor manual fourth edit american societi photogrammetri remot fall sturm trigg factor base algorithm project structur motion buxton european confer comput volum lectur note comput page april pf ri bundl modem synthesi vision theori volum lectur note comput page zhang determin epipolar geometri review intern journal comput march zhang loop estim fundament matrix transform imag point project space comput vision imag
Agents/1419 1 bid repeat vickrei auction felix brandt institut technisch technic report novemb abstract recent year auction import eld multiag system mechan resourc alloc task assign case vickrei auction protocol prescrib individu agent interact order agreement main reason vickrei auction low bandwidth time consumpt due round bid exist domin bid strategi condit show vickrei theoret bene inappropri agent particip auction process speci attitud econom agent make reduc pro competitor main goal maxim pro introduc agent deviat domin strategi report present strategi bidder repeat vickrei auction intend ict loss fellow agent order absolut group bidder strategi evalu simpl task alloc scenario introduct area multiag system concern system technic entiti call agent interact intellig achiev steadili grow interest past decad kei problem address area autom resourc alloc task assign individu agent solut problem common practic appli result insight auction theori understood auction protocol english dutch vickrei auction di erent vickrei auction receiv attent multiag commun appli varieti context oper comput network vickrei auction favor main requir low bandwidth time possess domin bid true valuat section characterist make vickrei auction protocol appeal point view autom vickrei origin formul sell good resourc work bidder make seal bid express amount bidder submit highest bid win price pai winner equal lowest bid task assign scenario vickrei auction work round reason refer vickrei bidder execut task make bid express amount pai task bidder submit lowest bid win winner receiv amount equal lowest bid payo lowest bid minu prime cost win winner pick randomli report concentr vickrei auction task assign present result hold vickrei auction origin formul import bid seal bidder win auction necessarili lowest bid low bid gener assumpt made applic multiag system individu agent intend maxim pro care pro ts mean case set observ maxim pro delib ict loss rival compani minim pro ts practic compani accept lower pro sell good loss nancial damag compet compani bind gain costum compani exhibit behavior attitud consid period time absolut pro import pro rel compani pro ts worth point behav ration act condit object maxim absolut pro report investig perform vickrei auction multiag system presenc agent exclud paper structur section explain agent aim maxim absolut pro ts bid true valuat vickrei auction section formal captur attitud sketch section show impact bid strategi section introduc analyz strategi repeat vickrei auction section present result illustr implic strategi section conclud report overview advantag disadvantag agent domin strategi vickrei auction domin mean agent appli strategi receiv highest payo matter strategi bidder domin strategi bid true valuat task agent bid bid privat valuat condit exist domin strategi equilibrium bidder symmetr independ valuat task impli task bidder dont estim privat domin equilibrium exist independ risk neutral agent privat valu submit bid pro ts agent de ned equat pro pro easili bid task optim strategi agent investig pro ts make bid privat suce model agent repres entir competit care win lose draw distinct fellow bidder bid prime cost condit agent bs bid win auction receiv monei bid lose win bid win gain task price remain payo bid case describ result paid amount monei monei prime lose lose reduc bs payo bid yield pro bid true valuat extrem simpli es bid due absenc wast dutch auction attitud multiag applic assum object agent team maxim absolut pro care pro ts made agent applic open enter system realist assum agent present gain monei rel scenario wise avail agent accept small loss ict great loss agent make formal descript attitud start point reason assum agent maxim di erenc pro gain mean pro hand agent loss hand consid equal import point view agent view captur agent intent rival achiev higher exibl describ analyz di erent agent object harm competitor agent put emphasi pro loss lead formal speci cation agent agent agent maxim weight di erenc pro pro competitor agent intend maxim payo payo pro paramet call rate rate crucial formal agent behavior obviou formula cover agent set higher hurt greater prioriti pure destruct agent de ned agent balanc pro pro competitor equal import vickrei auction implic formal notion attitud vickrei auction enorm remain implic theoret investig combin equat payo agent function bid payo case section agent ectiv win price agent receiv complet depend bid carefulli adjust bid capabl reduc bs pro bs privat optim strategi bid figur reduc bs pro absolut minimum figur reduc bs pro minimum prime cost prefer ict great loss gain small pro ts rate bid reject gain make lose rate bid va safe figur top monei lose bs strategi bid va payo agent simpli pro figur aggress bid bid strategi agent unrealist assumpt agent privat valu lowest privat omit margin includ avoid random result occur bidder share minimum bid strict version theorem state vickrei auction balanc bidder strategi de ned equat nash equilibrium assumpt state agent appli reason singl agent deviat payo agent suce agent account di erenti individu bidder vickrei auction sole victor payo payo va ba payoff payoff max ba payo bid receiv equal payo bid payo diminish strategi de ned equat equilibrium independ rate bidder claim strategi optim strategi reduc loss occur worst case encount mean bidder singl agent reduc agent payo min payo min yield minimum pro win yield minimum pro lose auction maximum minima max ba min payo max ba min payoff min payoff due fact equilibrium point comput set bid repeat auction basi theoret foundat previou develop bid strategi realist environ gener agent privat bidder principl agent possibl gure mean estim base intern knowledg auction learn previou auction deal techniqu reveal privat valu auction xed number repeat round balanc agent lose auction rst round task auction bid win auction receiv amount equal lowest privat cheapest agent agent appli domin gure privat place bid middl privat valu lose di erenc valu safe cut competitor pro auction round total number round high invest pai scenario agent de nite follow domin bid strategi bid strategi bid bid step step approach bid eleg agent appli strategi agent win paid monei lowest bid produc huge de cit reduc bid round round small margin agent bid reach figur displai modi ed strategi step size equal privat algorithm emul aggress strategi algorithm work stabl dynam environ agent vanish time time strategi balanc agent appli agent reduc win agent pro gure real privat cheaper agent time care agent small step size order safe competitor su er huge loss make neg pro agent bid won lost start bid bid lost lost won won lost won bid bid figur strategi repeat vickrei auction reason set depend number distribut privat valu rate round auction de ne comput round ensur loss ict oppon greater loss induc yield upper bound indic denot cheapest cheapest unknown agent privat valu uniformli expect impli step size agent rate lower equal privat result serv rough estim bidder account bidder intend harm agent bidder situat complic detail issu section assum agent appli domin strategi level commit contract task execut contract bind breach pai penalti commit contract unavoid loss agent produc cheapest competitor reduc break neg contract due fact reason close deal gure privat agent incent accomplish task break contract loss make accept contract greater penalti pai break deal common de nition penalti fraction contract agent breach contract pr actual task price pr penalti rate give assumpt pr agent break contract task price equal privat distribut prime cost true case result set investig report similar number buyer execut task associ prime cost task execut interest task price higher cost price bid integ valu sell task interest calcul submit seal bid submit lowest bid declar winner lowest bid price announc paid price execut task equal win winner pick randomli mention kind auction view standard vickrei auction agent submit highest bid good resourc win auction highest bid earn monei handl privat task prime cost assum execut task round strategi set limit level commit set previou order thing straight full commit contract ident tabl prime cost ident abil handl cheapest price bid privat valu gain horizont line figur show pro ts accumul round ce ce appli domin strategi bid prime cost ce harm competitor reduc pro ts minimum ce agent rate larg step chose care step size set reason ce task task task ce ce ce tabl fair cost tabl auction round ce figur ident set visual strategi work contrast normal case appli domin strategi make equal pro ce outperform rival lose sum pro entir group reduc singl agent aggress strategi vulner vickrei auction bid rst glanc agent care pro make highest pro odd ect explain fellow bidder ad equat ce risk entir pro order hurt ce ce complet gain perform break expect figur agent cut pro ts rival auction round figur ident random order examin perform behavior realist scenario arti cial prime conduct experi random cost tabl includ vari qualiti task task task task ce ce ce ce tabl random cost tabl figur show accumul pro round weakest strategi ectiv minim pro competitor gure prime cost round surpass ce success lowest prime cost compar competit figur show pro develop nal pro rank ce ce ce di er result domin strategi pro ts reduc compar pro ts accumul hostil auction round ce figur random auction round figur random attitud agent formal introduc report lead signi import strateg behavior agent argu impli exist agent report vickrei auction show auction addit de cienci vulner bidder ect polici enabl easi price manipul common english auction privat bidder vickrei auction strategi report work english auction inabl prevent pro reduct regard major disadvantag auction type dutch auction su er strategi problem strategi repeat vickrei auction intend cut cheapest agent pro highest margin reduc bid bidder stai bid privat lose monei harm round task price publicli announc auction agent rate fellow problem solv english auction bid public obviou inferior agent ect win bidder agent capabl perceiv fellow bidder halt riski activ behavior report opposit bidder bidder coordin bid order agent bid intent harm research step explor strategi agent detail plan examin strategi complex environ number vari time task refer busi busi auction auction task assign multiag system base auction level commit contract klusch cooper inform agent volum lectur note arti cial arti cial page berlin auction auction california weiss user control mode ip alloc present mit workshop internet econom miller incent engin comput resourc manag ecolog comput ferber system introduct distribut arti cial intellig john wilei son huberman clearwat multiag system control build environ intern confer multiag system page menlo aaai press varian price internet public access internet confer school mcmillan auction bid journal econom weber theori auction competit bid ohar editor foundat distribut arti cial intellig john wilei son game inform basil rothkopf model cheat vickrei auction journal kahn vickrei auction journal polit sandholm limit vickrei auction comput multiag system intern confer multiag system menlo aaai press sandholm lesser issu autom negoti electron extend contract net framework intern confer system page sandholm lesser advantag level commit contract protocol nation confer arti cial intellig page sun microsystem manag share resourc market mechan vickrei counter competit seal tender journal distribut comput economi ieee transact softwar editor multiag system modern approach distribut cial intellig mit
ML/1420 6 comput model word learn multimod sensori input deb roi media massachusett institut ma usa abstract infant segment continu stream speech discov word current theori role acoust evid discov word boundari de wessel test altern record natur speech caregiv engag plai infant center common object record visual context speech occur captur imag object analyz data comput process acoust model integr acoust visual input model implement standard speech vision process techniqu enabl model process sensori data show visual context conjunct spoken input dramat improv learn compar acoust evid result demonstr power learn suggest infant evid visual context aid speech segment spoken word discoveri introduct infant begin word refer salient aspect environ includ peopl learn word attend sensat acquisit process complex infant successfulli segment spoken input unit correspond word languag identifi semant categori correspond mean word infant capabl process continu variat natur phenomena noisi input provid perceptu system paper present comput model earli word learn address interrel segment fluent speech lexicon order discov spoken categor context refer establish correspond spoken word contextu term paper accord webster speech sound combin sound mean basic unit languag human categori problem treat facet underli discov structur spoken visual model implement standard speech vision process techniqu learn microphon camera input roi model evalu benefit structur problem speech segment word discoveri gaug rel integr visual implement system discov word base acoust analysi access visual evalu demonstr dramat gain perform attain inform leverag result suggest infant benefit attend multimod input earliest phase speech segment spoken word discoveri work differ previou comput model languag learn feldman al linguist contextu input deriv physic sensor reli human gener symbol abstract model learn input develop model earli lexic learn summar figur model discov word search segment speech reliabl predict presenc visual shape input consist spoken utter pair imag object approxim input infant receiv listen caregiv visual attend object environ speech processor convert spoken utter sequenc phonem probabl built abil categor speech phonem categori similar abil found infant exposur nativ languag al rate processor comput probabl past millisecond speech belong english phonem categori silenc phonem estim achiev train artifici recurr neural network similar network train phonet transcrib speech record adult nativ english speaker zue utter boundari automat locat detect stretch speech separ silenc visual processor develop extract statist shape imag object visual processor order repres object suggest theori earli visual process edg pixel view object locat pair edg normal distanc point rel angl edg point comput distanc angl accumul histogram shape order shape repres collect shape deriv view object gather visual data evalu robot devic construct gather imag object automat robot imag stationari object vantag point paper discuss learn input underli model learn combin input model depend speech vision detail object repres shape histogram deriv imag arbitrari pose robot diverg statist compar shape measur shown work object comparison crowlei set imag compar sum diverg match individu histogram figur cell model camera imag object convert statist shape spoken utter captur microphon map sequenc phonem probabl short term memori buffer phonet recent spoken utter pair shape recurr filter search stm repeat speech occur match visual context result pair speech segment shape long term memori filter base mutual inform search pair occur rare occur pair retain reject pair period discard garbag collect process phonem utter visual temporarili store short term memori stm capac approxim word speech input fed entri replac oldest entri stm recurr filter search content stm recurr speech segment occur match visual context stm initi attent input occur close time limit analysi small window comput resourc search memori sensori input minim requir cognit plausibl determin acoust distanc metric develop compar pair potenti speech segment drawn utter store stm metric estim likelihood segment pair question variat similar underli phonem sequenc repres word diverg metric earlier compar visual compon stm utter acoust visual distanc segment shape copi entri repres prototyp speech segment visual refer figur robot built captur imag object multipl vantag point schemat show freedom imag system includ turntabl rotat object photograph system design synthet charact experi notion embodi interfac roi al speech refer context speak caregiv rare refer object event locat happen past guid mutual inform filter assess consist pair mutual inform random variabl measur amount uncertainti remov variabl thoma mutual inform measur amount uncertainti remov presenc specif shape visual context observ specif speech segment mi symmetr measur uncertainti remov speech segment visual context pair high mi period garbag collect process remov encod associ high mi model learn acoust input compar develop segment speech acoust inform acoust process recur ident cell compar evalu data recur discov word search recurr sequenc speech sound underli idea common current theori speech segment de learner view languag construct underli process concaten word gener utter notic subsequ speech learner detect common word begin segment fluent speech word boundari figur recur model acoust waveform record microphon convert phonem probabl utter buffer short term memori provid input recurr filter search repeat sequenc speech stm result set speech segment store long term memori recurr filter search entri repeat long span time repetit evid segment repres word target languag retain garbag collect process period remov segment fail pass recurr filter infant search match speech segment spoken utter heard recurr analysi requir huge amount memori verbatim demand impract comput resourc suggest theori human memori model resourc requir search recurr phonem sequenc short term window input model perform exhaust search repeat segment stm time utter ad recurr speech sequenc extract stm copi recurr detector compar segment acoust distanc metric stm segment phonem similar speech segment retain reliabl word candid match entri remov garbag collect process evalu evalu model collect speech imag similar infant observ natur plai caregiv model effect test learn word similar infant expect learn studi involv caregiv infant conduct gather corpu speech particip engag plai center type object speech coupl set imag object input model particip femal respond classifi local newspap infant rang ag month particip interact natur infant plai set object chose class object commonli earli infant speech toi toi toi toi truck total object obtain caregiv particip session plai infant dai period particip provid set object class order object set provid random particip object box mark start session particip object plai return told teach infant word particip free order object select durat plai object speech record session automat segment utter robot gather set imag object approxim infant plai session set imag captur object vari perspect result imag randomli select imag object plai utter record imag pair utter present input model model run separ speech record caregiv model gener set output speech segment pair test model ident spoken determin provid visual context speech segment identifi evalu measur accuraci measur assess segment segment start end english word measur assess word speech segment correspond singl english consid word attach articl inflect accept measur initi final conson error measur measur measur segment pose extrem difficult challeng deal acoust data segment boundari correspond boundari english word segment boundari extract cell chosen actual word boundari measur word speech segment acquir cell complet english word perform recur drop output cell measur semant accuraci output speech segment pass measur pair semant visual recur process visual measur meaningfulli appli output cell achiev measur result show visual semant deriv context connect word number case guess mean speech segment yield maximum recal earlier set address problem earli word word contextu establish correspond cell achiev unifi framework speech segment prototyp spoken word extract continu speech visual prototyp word identifi spoken word cell learn spoken word visual ground multimod sensori data comparison recur model demonstr benefit incorpor inform word discoveri process structur lead word discoveri accuraci compar analyz structur acoust channel speech improv result implic understand languag acquisit infant segment speech preparatori step acquir effici strategi combin segment process map process earliest stage languag learn addit structur contextu channel process earli lexic acquisit learn consist discret stage case learn earli natur altern mind infant learn earli concept spoken label fit concept learn salient speech sequenc refer model experi verifi close knit process fact occur advantag learner learner leverag inform captur structur stream input acknowledg work benefit greatli discuss alex steven allen bernt schiel refer dl lj cue mr probabilist sound algorithm segment word machin tm ja element inform york segment rhythmic solut acquisit chapter page mit de languag phd massachusett institut technolog ad knowledg infant speech percept earli word case object languag core bloom mit foundat chicago linguist experi phonet percept infant month ga magic number minu limit capac process applic recurr net phone probabl ieee tran neural network pentland synthet charact guid stori visual lo ca acm siggraph learn word sight comput model phd massachusett institut technolog integr speech vision mutual inform proc int conf speech signal statist learn jl probabilist object recognit recept field proc int conf pat transcript align proc symposium advanc interfac spoken ce speech input interact ce snow ca ferguson talk languag input acquisit cambridg jf rc childhood percept speech canadian
ML/1421 6 web gener framework user interest adapt crawl strategi martin matthia kriegel institut comput munich germani gross abstract compar standard web search crawler yield good recal good restrict limit domain introduc introduc gener framework crawl consist major specif user interest measur result relev web page method user interest formula combin atom topic significantli improv express power user crawl strategi order link crawl frontier challeng task page low relev path highli relev page tunnel explicit specif user interest defin strategi tunnel system ariadn prototyp implement framework evalu crawl strategi demonstr perform gain obtain crawl dynam adapt focu introduct world wide web continu grow amaz speed begin number web page billion exce billion assum daili million page larg web search engin maintain huge cover small portion approxim million paper id page case northern light recal web search ratio number relev page return number relev page typic low return web page date url invalid problem low ratio number relev answer number answer due fact keyword user occur context irrelev user larg number irrelev web page return small number relev page drawback web search engin result claim cover web serv queri topic crawler overcom drawback web search yield good recal good restrict limit domain reli larg static indic web crawl current content web crawler set web page exemplifi user interest search relev web crawler start page explor link web page crawler refresh indic web search engin perform search crawler explor web search user interest search web graph hyperlink connect web page deal topic web page connect hyperlink higher probabl relev topic randomli chosen web page major problem crawler effect order link crawl frontier visit web maximum number relev page load load minimum number irrelev page challeng task page low relev path highli relev page temporarili visit moder relev page find relev tunnel long crawler topic small percentag relev page web crawler decid stop capabl current system open problem adequ specif user interest crawler user set topic implicitli connect oper argu gener formula standard web search context crawl method measur relev web page respect complex formula develop relat work discuss question order link crawl frontier order obtain import page metric exploit text sourc anchor text respect link url destin page introduc basic idea anchor text reason predictor text destin page user interest drive queri relev page measur calcul similar drive queri page major limit approach explicit strategi tunnel reinforc learn train crawler tunnel effect relev page consid reward relev page path current web page futur reward base web site relev crawler learn link reward time maxim note learn method requir larg collect visit web page hyperlink train perform sever limit applic approach crawl present gener architectur crawler classifi distil major compon user interest set page system set adequ categori taxonomi relev visit web page measur text classifi categori distil support strategi order link crawl relev text sourc page measur central concept author rank hub rank modifi topic hyperlink initi weight relev destin page distil order crawl frontier substanti crawl author rank hub rank order method iti measur implement implicit strategi approach includ explicit strategi tunnel introduc context graph mean model path lead relev web page context graph repres typic link hierarchi relev web page occur text content page drawback approach fact reli indic web search engin order obtain direct indirect start page learn context graph index search cover relev topic date relat work develop learn strategi improv standard web search engin system syskil webert webwatch learn user process obtain web document order answer find addit relev document present approach learn base web queri process bridg gap issu keyword real user system learn user answer system capabl find relev page neighborhood web page keyword contribut paper introduc introduc gener framework crawl present prototyp implement evalu framework consist major specif user interest measur result relev web page user interest express logic formula topic taxonomi liter measur relev text classifi measur relev basic topic combin formula user interest crawl strategi gener algorithm scheme crawl strategi discuss compon order rank link crawl exploit html meta data text url explicit specif user interest defin strategi tunnel form import aspect crawl strategi show formula user interest deriv criteria stop crawler gener framework power flexibl crawler consid instanc framework system ariadn interest direct neighborhood prototyp implement framework compar instanc demonstr gain obtain strategi crawl dynam adapt focu paper organ section introduc framework measur user interest crawl strategi present section section import aspect implement ariadn system discuss result evalu report section section summar contribut outlin interest direct futur research measur user interest basic assumpt notat web crawl identifi web page url denot time pt σ σ denot string receiv download time error messag number page content page html tag java script binari file treat frame separ page immedi follow redirect reason assum web constant time crawl drop depend time limit crawl run snapshot store access page local assum function transform string content web featur vector term occur collect text stopword exclud remain term dimens result featur vector note featur vector restrict text standard approach repres multimedia set link page anchor text ai link sourc page destin page identifi absolut replac rel url absolut url link page remov regard defin world wide web direct graph set exist web page exist broken link defin union add page empti content broken link set σ qi speak link page exist page substr url protocol file section domain subdomain ip address defin host link call crawl act transform subgraph pn subgraph gm step edg vertex ad gi obtain call set start page talk assum class web good bad respect user interest set start page consist good goal crawler find good page ad bad page subgraph import effect measur crawler user interest taxonomi wide organ larg collect web directori taxonomi tree consist node repres topic defin set sampl document note sampl document web page text document scientif articl measur relev web page respect typic classifi train sampl document respect node special node form root taxonomi edg repres subtop relationship induc partial order node topic figur depict typic part taxonomi experi accomod tourism sport hotel camp water sport cycl sail figur part taxonomi experi exist crawler user interest defin mark node interpret disjunct mark topic topic model explicitli taxonomi tree structur replac complex graph figur redund extra node ad taxonomi node classifi evalu figur complex topic graph comparison flat taxonomi gener formal express user interest interest formula logic oper topic part taxonomi oper model intersect topic ad addit node taxonomi taxonomi flat number user formula measur user interest measur relev web page user interest formula φ quantifi elementari relev singl topic transform formula arithmet express yield total relev page possibl construct evalu function singl give document train classifi build evalu function base domain knowledg function regard score function weight keyword queri model consid gener frequent queri type search web learn evalu function ampl denot set document taxonomi node empti set indirect defin classifi relat node base set term document assign document relev belong son node avoid patholog requir disjoint compar respect topic taxonomi defin evalu function properti larg small note evalu function appli text repres featur text content web anchor text link url destin page assum valu document compar order problem occur evalu formula defin evalu function arbitrari user formula formula consist defin structur arithmet interpret logic oper disjoint independ topic hard prove tend possibilist probabilist model possibl theori interpret μ implement weight result appli evalu function text call score text respect formula web page call relev respect formula score high minimum strictli posit score start page crawler problem possibilist approach concentr formula paper run crawl crawl exclud page score method user interest formula combin atom topic significantli improv express power user roughli approach integr search support web search engin altavista search web directori approach benefici crawl strategi deriv criteria tunnel termin crawl specif user interest crawl strategi load web page score singl topic formula store local reduc problem crawl problem retriev object highest score algorithm solv problem shown algorithm optim uniform distribut score singl topic realist case score distribut present algorithm improv termin condit effici applic context crawler due fact random access sequenti access web page access web page load page link crawler effici obtain list web page sort descend score atom merg top page list clever obtain page complet estim score destin page link page reachabl page load page central problem crawl strategi present section gener algorithm scheme algorithm scheme figur describ wide class crawl strategi compar approach easili assum input crawler consist set start page formula φ user interest section topic evalu function assum start page strictli posit score respect formula φ case web page document node set start page empti automat start page document work φ consist topic disjunct document score φ initi session crawl strategi termin condit start termin chang crawl strategi chang figur algorithm scheme crawl strategi crawler crawl strategi chosen focu set formula user interest crawler repeat session crawl strategi termin condit met web page process crawl frontier empti case crawl stop crawl crawl strategi focu crawl section crawl strategi static call crawler simpl characterist chang number crawl page preprocess appli evalu function score page threshold score page relev score section link crawl frontier process singl step obtain link maxim delet link crawl frontier point destin page lot link special destin page score crawl download calcul relev page page convert featur present user page extract calcul score add crawl frontier classifi crawl strategi import basic kind prune host problem page url syntact semant properti link low page process simultan implicit effect score link calcul subject subsect rank link crawl frontier central task crawl strategi estim link crawl frontier import crawl estim score destin page link page reachabl page load page estim score respect link relev web page defin direct page relev indirect relev page reach directli indirectli process page function link link set crawl page return score high score high relev destin page method estim indirect relev literatur framework order link crawl frontier limit discuss section follow altern approach defin explicit strategi section concentr direct relev give list criteria exploit local depend content page sourc mention relev sourc relev user formula special section meta score relev url destin relev anchor text link text close relev host destin page page specif host unimport true path filenam link distanc start page destin page count link distanc path lead page replac page link page shortest path subgraph addit cost file level url import destin page link user interest page host number outlink sourc hub page measur relev url anchor elementari evalu function page content term url anchor expect score high complex formula strategi modifi formula φ task case φ topic global estim frequenc domain knowledg estim base crawl page observ number anchor text relev featur low benefit anchor text url main reason good ariadn standard strategi section begin crawl select criteria direct relev organ common compon lexicograph order vector prefer combin singl criteria direct relev weight geometr obtain score set weight impli ignor criterion tune weight criteria appropri link crawl frontier order descend valu score support tunnel explicitli tunnel phenomenon crawler reach relev page path consist relev page crawler irrelev page phenomenon prevent prune strategi follow link irrelev page strategi posit effect result low recal gener tunnel high reader explicit strategi tunnel crawl frontier link low visit irrelev search typic yield low topic strategi good typic case link distanc onward aim good extrem prune search method effici control process tunnel method call chang focu answer situat focu focu crawl answer question long crawl faster expect broaden focu crawl method page gener topic frequent lead page special topic crawl random web page crawl temporarili find relev focu gener page link page assum crawler finish session section si denot percentag relev page page investig si ri denot percentag relev page page visit crawl paramet method detect situat focu si gener si special respond gener focu lead crawler gener page focu origin user interest option gener focu crawler explain formula φ ignor frequent topic topic frequent web page gener frequent frequent experi multimedia show index valu run start maximum answer reach faster run attribut lower averag infrequ attribut notion infrequ topic visit smaller number relev respect topic case lower score weight infrequ topic weight evalu larger weight infrequ topic gener infrequ topic taxonomi hotel island gener hotel hope link back method import taxonomi clear topic gener drawback approach broaden priori knowledg topic infrequ reason estim infrequ topic base subgraph crawl subgraph continu estim converg real valu estim converg start relev page untyp web comparison special easi frequent topic formula special simpli gener step redon focu basic adapt score link crawl frontier yield store data cost recalcul score appli calcul score link ad crawl frontier save space store addit attribut time profit fulli techniqu termin previou tunnel strategi react point continu crawl mean forc percentag relev page topic time stop reason criteria termin crawl crawl frontier empti case occur number relev page found number irrelev page visit number irrelev page visit relev page found fall threshold maximum score link crawl frontier fall threshold tunnel strategi decid focu formula gener gener level relev page found subset web page close link page belong subset note criterion realist met costli test nonparametr criteria requir paramet user base domain knowledg implement framework crawl implement system ariadn written java main text english porter stem stopword list english german due robust case page simpl text classifi base select keyword sophist naiv classifi applic framework develop link follow link syntact properti dynam file end gif lead page text exclud host number page download restrict file respect appli kind prune relev score link calcul weight geometr local criteria mention section weight assign manual interest anchor text url influenc relev sourc page domin case give posit weight criterion implement breadth search crawl implement multithread exploit full bandwidth internet connect thread download process immedi score newli extract link ad crawl frontier fetch page simultan chang adapt score turn effici ariadn gener public relat store inform collect crawl type cach relat crawl relat cach relat form structur web cach part web investig crawl page download assumpt time invari web crawl hold run multipl experi user page regard evid stabil crawl techniqu crawler access inform cach page url crawl relat specif crawl relat basic store inform page visit store inform link repres crawl collect data specif number timeout contact evalu present result evalu framework system ariadn crawl user formula perform typic formula relat taxonomi depict figur tourism sail defin broad user scope narrow island small part state german state locat baltic sail cover tini portion topic tourism web search engin return page page note rough approxim total number web page relev crawler return page requir topic occur web hand crawler restrict search engin score relev page exce minimum score start page chose relev start page page ariadn run hp workstat mb version run hp workstat mb cach relat index grown gb page link entri host entri restrict analysi major crawl simpl tunnel strategi compar respect respect link distanc relev page found figur depict cumul number crawl page crawl point report cumul simpl number crawl page figur cumul crawler surprisingli effect broad user interest due larg number highli central start page simpl crawler significantli outperform strategi note simpl load page compar page requir order find relev web page simpl crawler drop session crawl crawler decid tunnel extra graph strategi cumul simpl tunnel number crawl page figur cumul narrow user interest crawler yield poor simpl crawler perform φ relev page fewer relev anchor text url crawler obtain significantli higher long run reason phenomenon discuss strategi broaden focu taxonomi tunnel strategi gener sail water sport sport tourism gener tourism link distanc crawler find relev figur answer question formula crawl page relev page link distanc figur link distanc simpl figur demonstr simpl crawler find relev page link distanc note feasibl run crawl link distanc user interest specif domain observ simpl crawler good larg link distanc relev page link distanc figur link distanc crawler tunnel figur depict link distanc relev page crawler tunnel find narrow area sail notic ue link distanc singl relev page larger link distanc result impli tunnel phenomenon fact happen time report crawl deduc exist path relev page irrelev page note peak link distanc due singl host lot relev page analyz path crawler start page page reach tunnel link distanc discov ten page path irrelev sail relev fulli gener tourism relev page found gener focu taxonomi result show explicit strategi tunnel effect mean find lot relev page select user formula reason cost introduc gener framework crawl consist major specif user interest crawl strategi user interest express logic formula topic taxonomi explicit specif user interest defin strategi effect tunnel gener framework power flexibl crawler implement system ariadn compar instanc demonstr perform gain obtain strategi crawl adapt focu framework crawl open lot direct futur research user formula oper investig respect measur user interest chang focu crawl interest issu integr evalu method measur indirect hub rank author rank web page explicit strategi criteria develop crawler automat optimum strategi depend user formula paramet obtain user strategi termin crawl implement compar user interfac crawler deserv user adequ support interest result crawl present good present intermedi result combin interact facil enabl user control search huge web graph effect refer chakrabarti van den berg dom approach web resourc proc world wide web confer chakrabarti van den berg dom hypertext resourc discoveri proc int conf larg pp cho page crawl url proc world wide web confer diligenti lawrenc gile gori crawl context proc int conf larg pp duboi lang prade robinson handbook logic artifici intellig logic vol oxford lu chen tian learn base web queri proc int conf larg pp elkan paradox success fuzzi ieee august fagin fuzzi inform multipl journal comput system vol pp fagin wimmer formula incorpor weight score theoret comput vol pp flake lawrenc gile identif web proc int conf knowledg discoveri data mine pp queri imag proc int conf larg pp surpass billion press jan joachim freitag mitchel tour guid world wide proc int joint conf artifici intellig pp kleinberg sourc hyperlink proc symposium discret mitchel light technolog dramat expand intern feb pazzani muramatsu billsu identifi interest web proc amer conf artifici intellig pp renni mccallum reinforc learn spider web proc int conf machin learn
Agents/1422 1 mix initi interact softwar agent daniel rousseau bernard moulin knowledg system laboratori comput scienc depart gate comput scienc ca usa canada abstract work past year techniqu model softwar agent initi interact interest build multiag system softwar agent interact human user sophist wai analog human describ project work multiag approach simul softwar virtual theater introduct softwar agent assist user achiev collabor entertain act behalf greater softwar agent comput system exploit knowledg goal perform interact agent peopl autonomi essenti characterist express initi agent initi decid act agent provid person goal satisfi softwar agent human share goal form team order satisfi common goal work past year techniqu model softwar agent initi interact interest build multiag system softwar agent interact human user sophist wai analog human describ deal initi project work approach base human model interact softwar interact synthet actor receiv direct behavior multimedia environ model multiag order explor interact mode softwar agent sophist simpl exchang analyz human elabor interact approach softwar agent base model develop multiag system simul involv softwar agent initi import aspect human interlocutor initi altern express speaker initi research formal interlocutor initi feel friend involv inform discuss interact synthet synthet agent interact richer agent initi feel limit react agent human mix dialogu group person peopl speak time time speak listen person appli mechan interact synthet human agent agent common satisfi goal satisfi initi satisfi goal develop conceptu framework model simul integr techniqu found speech act comput artifici multiag cognit psycholog framework plausibl adequ simul sophist interact place softwar agent softwar agent autonom reason mental state plan behavior perform action order influenc agent mental model modifi environ softwar agent build model involv model knowledg structur describ type inform exchang call rousseau unfold respect level commun perform commun act order transfer manag subject discuss qualiti maintain commun commun act speech act gestur influenc agent mental model assum softwar agent interpret plan commun act life cycl level commun life cycl level commun show state transit state level rest describ initi life cycl negoti life concept life global state rousseau manag initi studi sack al franci notic wai initi research artifici intellig consid aspect includ traum work creat life cycl model protocol initi softwar agent transit life cycl realiz perform kind action agent initi speak stop speak give initi specif agent agent question approach appli dialogu group reflect fact negoti compet agent track state initi particip special knowledg structur call initi agenda structur agent current state life cycl shown figur describ transit identifi number set start initi perform commun act agent wait initi wait initi impli listen speaker wait finish speak agent perform commun act initi initi offer specif agent question order leav agent speak case occur stop speak lower give opportun agent initi agent agent initi wait leav listen speaker initi agent initi agent wait initi agent perform commun act initi agent wait initi consid speak speaker initi agent wait initi speaker hand initi grant deni agent request initi interrupt agent speak speaker interrupt speaker initi back speak wait leav implement test approach softwar agent interpret commun act respect life cycl interrupt offer figur initi life cycl interact virtual theater collabor barbara stanford work interact system call virtual theater van gent virtual theater system provid synthet actor avatar portrai charact textual graphic environ user plai role context interact actor avatar order build stori interact synthet actor behavior respect direct receiv predefin script user applic autonom agent plai role user portrai custom avatar number autonom agent avatar vari depend applic user screen menu present action select avatar current textual descript anim stori life cycl defin state transit charact abstract level custom life cycl state transit order serv life cycl sit life cycl specifi transit realiz action context state life cycl custom stand custom sit walk stand stand context user autonom actor decid lead initi initi manag perform life cycl virtual theater identifi type situat user commun user avatar time type commun special window messag transmit user interact autonom actor select option action menu autonom actor wait avatar action action menu shown user depend current context avatar life cycl autonom actor commun actor actor life cycl decid perform action wait life cycl account turn time act time wait agent reaction waiter custom readi order wait custom action act type situat encourag user autonom actor comput applic initi interact softwar agent life cycl base human simul agent includ specif life cycl deal turn virtual integr initi manag life cycl life cycl actor behavior approach agent initi prescrib accept approach identifi situat initi abstract level approach requir identifi transit abstract level decid approach depend desir strategi refer explan comput gener explanatori dialogu mit cambridg everydai advanc spoken van puppet actor technic report knowledg system stanford approach model simul essai speech act john benjamin publish compani technic report person synthet agent technic report knowledg system stanford simplest systemat organ turn studi organ academ act spoken comput intellig
DB/1423 3 captur queri multipl aspect semistructur data curti dyreson depart comput scienc jame cook australia michael bohlen christian jensen depart comput scienc aalborg denmark abstract motiv larg extent substanti grow promin web potenti benefit obtain appli concept techniqu web data data model queri languag emerg contend web data model organ data graph node denot object valu edg label singl word phrase node label path lead descript serv basi queri paper extens framework captur queri properti semistructur data model properti tempor aspect price data qualiti rate access restrict data consid paper defin extens data model accompani queri languag facil coalesc properti briefli introduc queri languag extend data model includ addit construct effect queri graph properti introduct web arguabl world frequent inform resourc current web data local web data futur extend markup languag expect replac permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb hypertext markup languag xml web page schema data page structur xml provid structur data schema vari page page abil semistructur data model accommod data lack schema make attract candid queri manag xml data web cf rdf standard unlik web metadata typic addit inform url paper term encompass web semistructur data model organ data graph node repres object edg repres relationship object valu repres edg node edg direct label label import make node node sequenc label path graph lead node paper introduc semistructur data model gener exist semistructur model label set descript properti properti kind typic properti edg level secur protect properti label describ node reachabl edg exemplifi edg figur part show convent edg label connect node part show kind label introduc paper label set properti pair pair collect refer properti label transact time gener exist semistructur label part assum implicit paradigm label properti appli properti figur transform label indic tran typic edg label properti figur kind edg label english word natur label properti theoret limit util uncommon framework captur queri nest focu singl level metadata paper previou research semistructur unstructur data model focuss basic issu queri languag design restructur queri result tool naiv user queri unknown semistructur techniqu improv implement effici method extract semistructur data web languag present paper treat edg label singl word string buneman al semistructur model complex label kei inform object ad label make path uniqu focu ad data label addit oper manipul label paper augment label present queri languag data model extend oem special annot edg record inform time kind updat permit histori semistructur maintain extend scope power annot edg label gener framework languag queri extend data model support limit kind tempor lack coalesc oper import correctli support tempor semant paper organ section motiv extend semistructur argu util introduc richer structur label section present extend model format defin import featur set properti present vari label label section proce introduc extend queri oper contend properti label section incorpor queri oper deriv lorel queri languag call queri semistructur data properti section cover futur work summar paper url interact queri engin document exampl implement packag motiv background section aim describ type semistructur emphasi underli design relat exist semistructur sampl movi span semistructur data total site internet movi site wealth movi onlin movi industri portion du site charg fee access film fee collect broker clip joe doe user site devot scienc fiction site movi data rate portion restrict web surfer ag internet archiv site offer movi data collect robot period part web figur show portion movi edg direct valu object depict oval semistructur edg node exist complet movi model pertin fact inform star war ad review movi june issu made review paid subscrib joe doe review star war deem low qualiti du charg dollar star war iv film deal paid subscrib clip free magazin review bruce willi star star war iv misspel correct movi data rate color star bruce willi surfer secur clearanc permit view movi sampl illustr paper tran tran low review text movi clip movi war iv review high subscrib tran valid paid night movi clip clip star tran bruce bruce willi star joe doe figur web movi sampl properti data model present paper capabl captur fact part properti label label locat properti node complet path lead node figur intern node easili call star movi exist incom edg label turn reach movi edg descript father label path node shown data model properti discuss partial list properti mandatori properti miss text descript domain set string alphabet unicod properti set paper exampl singl data secur intend qualifi user access data essenti ingredi support kind secur provid method restrict access edg queri requir properti discuss section paper assum secur control certif descript properti breviti shorten protocol exist obtain manag certif certif combin certif permit access servic document render certif plain text encrypt form secur formula built individu instanc secur subscrib user certif access secur subscrib certif suffic secur extens data model support transact transact time time edg current call transact time time interv time transact led edg time transact delet updat edg edg current special end edg current remain chang special role transact time modif elabor section valid valid time fact fact true model realiti properti edg reflect real world transact timestamp close interv data spread access data substanti greater cost term monei price properti reflect differ cost obtain data multipl price properti comfort simpli assum price dollar amount inform web credibl commonli rate inform cnn server credibl inform user person home page qualiti properti record qualiti sourc inform assum qualiti intuit rank low high list cover properti movi exclud properti dublin core url space featur properti label label consist properti edg node shown figur transact time common properti unusu circumst edg abil accommod schema irregular found web data import featur semistructur data model data model present paper featur worth mention featur properti found label miss label figur transact time properti label properti miss dont care properti miss dont care german improv descript data featur properti requir requir properti requir match queri gain access node properti secur properti edg night requir properti properti meant user match secur edg detail requir properti present section restrict properti label common properti share number label bag collect object label easili part number label multipl edg connect pair node overlap redund label requir label disjoint descript unnecessari restrict multipl properti label captur data break exist queri languag path war iv misspel bruce easi retriev path regular express properti label valid path transact time edg path edg path final edg delet time edg coexist current state paper offer collect queri languag oper support correct manipul requir properti similar keyword privaci tend edg label oper extens semant properti fix data mean suppli design test valid transact time properti test differ properti queri oper match match path regular express label path semistructur entir path singl edg label comput label edg path coalesc comput properti distribut number label edg pair node slice restructur label path slice portion select properti label contrast exist semistructur data model model capabl repres exist semistructur data model simpl string label explicitli captur metadata inform label encod split edg separ data properti branch end edg problem approach encod data special statu queri involv wildcard match access data user formul queri data challeng unnecessari left user guess repres write queri explicitli avoid data fundament special semant account queri assum semistructur simpl string transact time object repres edg node discuss path valid edg concurr semant incorrect give queri correctli retriev concurr intersect oper comput intersect time select movi intersect intersect test transact time object path ensur concurr user explicitli formul queri correctli manipul transact time strategi highli undesir featur properti account queri queri incorrect correctli handl secur properti semant properti enforc user simpli omit queri test condit transact time queri run complet return result semant transact time properti result includ path naiv user formul queri user properti familiar semant appropri contend properti queri queri brittl correctli form queri short ad delet exist break exist queri theoret capabl user repres queri properti ordinari semistructur extens data model present paper view implement layer top normal semistructur data model layer implement semant properti correctli translat queri result user underli extend semistructur data model properti section defin semistructur defin foundat queri final consid updat semistructur model properti semistructur db consist set set direct singl root collect socal properti determin semant properti defin root set edg eman edg lead consid root extra level indirect serv record properti root edg node node label denot label properti definit label set xm drawn properti properti oper exist properti requir denot figur edg connect night label set properti secur properti requir properti intend limit access node individu year ag accommod properti oper properti properti properti match properti coalesc properti slice section oper determin semant properti includ definit properti oper signatur present ffl ffl boolean ffl prc ffl oper slice properti valu properti introduc time regist oper default semant discuss section tabl list oper implement properti discuss paper role properti oper clear queri retriev inform semistructur properti section extend inform retriev capabl ordinari semistructur queri languag handl label properti emphasi queri languag aspect affect label aspect label path regular express path semistructur part extens retriev valid path discuss section defin valid predic test path valid determin path singl edg label preserv inform content label path path regular express gener support label properti requir properti involv redefin label match evalu express conclud observ extens strictli extend retriev mechan work expect semistructur simpl string label path valid path semistructur valid intuit path valid transit properti share common comput label path valid time secur transact time price qualiti truth assign overlap overlap concaten intersect intersect sum minimum prc union coalesc coalesc min averag semant error conjunct elimin intersect intersect prune prune tabl properti oper case path movi star path shown figur solid line path form virtual edg bruce willi virtual edg depict dash line virtual edg label describ edg label determin label path singl label tran tran tran movi war iv star bruce willi figur edg movi star oper path label path pair label determin common properti label properti propag label miss properti label interpret care mean miss properti accept label properti constructor comput properti constructor result undefin signifi label common properti path sink effect mean constructor definit path edg path path comput label virtual edg node path oper extens depend semant properti constructor pair properti valu properti requir properti treat properti lm lm depend semant properti tabl suggest constructor common properti properti constructor properti transform domain reduc extent domain time interv intersect transact time properti path figur intersect transact time edg path bruce willi current time note path current slightli longer interv determin path path properti check ensur defin definit path boolean valid properti undefin valu valid path war iv misspel bruce figur path properti result label transact time properti undefin transact time edg path intersect produc valid transact time path invalid cost check path valid length path number properti label expect smaller path valid check path discuss path match provid mean determin match label label match oper incorpor match oper match path regular express path semistructur label match exist semistructur queri languag straightforward descriptor typic singl word phrase string label regular express basic build block regular evalu descriptor person match label person edg flexibl string comparison descriptor label support lorel wildcard oper sql descriptor match label start semant label match involv model label set properti string comparison insuffici properti string complic address label match oper defin oper succe individu properti descriptor match label miss label extra properti label oper note descriptor label oper definit case requir properti label miss label match succe requir properti present label properti label miss label match succe miss properti treat dont care inform properti present label specif properti determin properti valu match requir properti treat definit label label label match label depend semant properti properti label individu match predic match properti valu equal time interv overlap transact time tabl label requir movi descript movi figur label movi properti describ war iv sw label match ffl movi requir miss movi ffl movi sw extra transact time properti sw oper basi interpret regular express descriptor regular express interpret semistructur queri usual regular express oper usual mean essenti differ languag standard semistructur queri languag match path check ensur valid oper extend set path sequenc label extend path match regular express entir path valid definit db path path set start path root regular express alphabet label match path db extend path match db fx valid defin fv lm vm vm lm lm jy matcher extend path path regular express express unifi matcher extend standard semistructur matcher match individu discuss note presenc cycl semistructur lead infinit result match semistructur queri languag oper strategi adopt break cycl node mark gener finit result set stop strategi left languag node mark break cycl cost match essenti path match normal semistructur worst entir semistructur explor path valid comput path cost extra factor number properti label assum properti label sort hash cost match framework grow factor size label set final node set path desir definit path node set path fw lm pg user interest retriev inform movi star set node obtain movi star db movi star recal root set edg root semistructur regular express sequenc descriptor requir edg transact time requir edg miss transact time presum exist transact properti mention descriptor path properti case label match instruct path figur path night misspel bruce match requir level secur miss descriptor user digit certif authent add descriptor match edg path night bruce willi match reason path war iv misspel bruce match regular valid path path war iv bruce willi path match regular express valid path backward compat compat current semistructur model achiev assum string label model default properti framework repres exist semistructur model label properti retriev queri remain unchang exist semistructur path valid label consist singl path valid string result undefin exist semistructur label match string path regular express match path model observ framework seamlessli support mix data exist semistructur data richer properti vari label label data desir migrat type label addit queri oper section present queri languag oper queri inform label label restructur call carv portion label path defin oper trivial gener oper result match coalesc oper defin extract properti distribut label slice slice portion properti label path common queri determin properti transact time path slice slice properti label check result path valid definit label path path slice label path set slice fv lm lm valid label slice properti properti slice complic miss properti properti miss present pass unchang result miss properti label miss descriptor requir case properti descriptor ad result properti label descriptor constructor slice properti appropri add result definit label label slice sg recal constructor slice properti tabl show slice oper user interest retriev properti movi star current time set path obtain lm slice match db lm note slice argument differ match descriptor transact time properti label transact slice path transact time properti match path unchang underli data oper introduc section trivial gener path set path match db set path match regular path properti coalesc path definit path edg set path independ valid util oper investig semistructur queri languag call oper queri languag implement comput path variabl coalesc edg connect pair node edg connect pair node figur edg ad review began develop secur set restrict edg page develop edg publicli part june issu secur weaken includ paid subscrib war iv review subscrib tran review tran develop movi figur evolv inform review edg connect pair inform singl properti distribut multipl label order determin full extent properti pertain relationship pair inform properti distribut number advantag coalesc properti set edg definit edg assum set connect pair node coalesc singl coalesc prc fx prc oper constructor unlik coalesc constructor mutat result coalesc strategi determin transact time review star war iv irrespect valid find path root review note requir level secur path virtual edg coalesc transact time virtual edg movi review db movi review coalesc result coalesc transact time union transact time interv figur updat transact time support special semant updat enforc accommod transact time trust enforc semant trust mechan updat individu site collect page site archiv correctli support transact time flexibl inform page support transact time freeli mix inform page describ constraint exist correctli support transact leav open issu constraint enforc updat updat data consist chang consist addit properti discuss kind modif turn data updat edg insert time semistructur transact time label insert edg set time definit current time edg insert db insert db fv redund overlap label permit data store coalesc note edg insert insert node node exist give separ oper insert node focu relev support properti edg delet termin interv definit current time edg delet db delet db fv fv label transact time properti transact time transact time properti miss node delet remov incom edg modif model edg delet edg insert transact creat edg figur war paid edg insert db edg delet db edg insert db ad remov properti data evolv properti ad delet properti ad label time exist properti simpli miss label subsequ insert properti properti consist uniqu domain prc design add inform semant db default semant oper suffic definit properti valu properti semant error prc semant error properti default path root leaf recent properti leaf relev properti url properti url datum resid url page datum relev url parent comput default constructor properti match equal default provid prc gener default exist oper invok mention properti specif queri languag oper properti delet remov properti semant exist label data store mention properti subsequ oper label requir properti delet fail match subsequ save remov requir properti delet costli disrupt simpl support properti enhanc maintain histori properti insert delet accomplish transact time properti label previou state queri properti previou issu transact time support properti scope paper section offer overview queri queri semistructur extend properti lorel addit construct permit queri exploit properti focu present small select statement support extend queri languag oper discuss previou section reader encourag interact queri variabl kei understand understand specif variabl variabl variabl primari differ variabl rang result extend queri oper discuss section queri find movi star select adequ queri set variabl rang termin node path match regular express term oper discuss section variabl mean lm db lm interpret explicitli select descriptor default requir properti commonli properti default default properti set simplifi queri default properti subsequ oper properti specif mention oper overrid default valu syntax set default straightforward retriev movi star current semistructur set default properti select secur common default set user secur certif subsequ queri set default set default properti summari futur work paper extens framework captur data semant semistructur data model framework extens incorpor latest advanc web secur addit semant domain captur enrich label label set descript properti properti exampl paper includ transact valid time properti label framework permit miss properti support requir model properti built framework oper manipul label properti match set path semistructur match path regular express combin properti label path creat label entir path slice slice portion label path coalesc coalesc properti set edg oper built queri queri briefli paper work extend number direct label extend includ set label greatli model power multipl descript relationship split individu label multitud edg essenti store coalesc conveni user research translat rdf set properti translat straightforward clear map path xml path map label path properti termin path properti impact framework path index address expect spatial index gener index path properti plan investig issu futur acknowledg research support part grant danish technic research council grant chorochrono fund european commiss dg xii research contract refer meng explor dynam abstract sep arocena mendelzon restructur web pp feb wiener lorel queri languag semistructur data intern journal digit keynot address apr soo coalesc tempor pp sep suciu program construct unstructur data suciu queri languag optim techniqu unstructur data pp jun buneman semistructur data tan determinist model data workshop web queri jan widom repres queri semistructur data pp feb secur evolut web ascent xml xml special issu world wide web suciu queri languag manag system sigmod sep mendelzon techniqu survei sigmod sep fernandez suciu optim regular path express graph schema pp feb goldman widom enabl queri formul optim semistructur pp sep goldman widom interact queri search semistructur intern workshop web pp mar crespo extract semistructur inform web workshop manag semistructur data associ sigmod jun jensen dyreson consensu glossari tempor concept februari version etzion al tempor research lnc pp schlepphorst manag semistructur deduct perspect inform system lassila swick resourc descript framework model syntax specif technic jan widom manag system semistructur data sigmod sep milo suciu index structur path express icdt jan motwani infer structur semistructur data workshop manag semistructur data associ jun sagiv queri semistructur heterogen inform journal system suciu semistructur data xml platform privaci prefer technic jan
Agents/1424 1 architectur intellig websit insur jonker lam jan treur vrije universiteit depart artifici intellig de boelelaan hv netherland netherland abstract paper architectur intellig websit present appli insur architectur design implement composit develop method system desir agent architectur base gener broker agent model shown exploit design intellig websit develop softwar compani insur compani introduct analysi current busi websit perspect market custom relat suggest websit activ case contact base human intellig agent provid possibl reflect number aspect situat simul enabl opportun integr websit gener architectur intellig websit present paper offer possibl shown architectur appli project intellig websit insur compani test bed chosen project inform document exchang insur agent insur compani main offic goal intellig websit provid insur agent accur account document inform specif topic support softwar agent provid match strict demand inform support inform base profil insur agent dynam construct section insur applic domain introduc section global design intellig websit type agent particip websit distinguish section gener broker agent architectur appli obtain intern structur agent involv websit section applic architectur insur discuss detail illustr behaviour pattern applic insur largest insur compani netherland work sole basi insur agent support agent websit creat inform product offer form support administr action relat inform site aim support insur agent work simpl setup chosen websit structur main offic store place inform insur product offer insur polici found head request form person found section store coupl program download toolkit insur dictionari insur agent stuck turn desk section question frequent question page form specif question agent websit section editori found address depth problem insur agent address book depart team oper compani found visitor site find latest inform newslett found calendar check upcom event link interest site offer interest site visitor notifi assort amount articl sale insur product support resourc improv insur agent job newslett fill sale letter agent find person product figur firm product make websit collect variabl inform sourc person data make span inform type type inform ad daili latest relev time type inform daili updat insur agent manag support multi agent system develop agent latest interest inform aim multi agent system integr websit improv resourc websit offer visitor point interest inform thing visitor intim knowledg user shorten time visit websit applic form fill agent maintain inform collect multi agent system develop direct form market research visitor contact product offer interest visitor inform find visitor interest product offer offer architectur intellig websit section global basi intellig introduc section top level process composit system present section type agent basic agent characterist behaviour identifi requir express global section intern structur agent discuss architectur reason present aspect illustr context insur applic architectur domain identifi domain make start agent highest process abstract level system class agent distinguish level custom person assist agent websit agent fig shade area hand side show agent relat shade area left hand side show agent custom site short websit person assist agent custom person depict applic websit agent relat depart compani distinguish part websit user agent person assist fig architectur note person assist involv mediat agent commun user websit agent user receiv inform interest provid inform assum interest receiv inform websit specif inform websit agent commun person custom commun person assist agent serv interfac agent custom custom visit websit time person assist agent instanti offer custom softwar agent section agent consid structur insid remain intern structur present section extern agent concept defin interact characterist interact world action commun agent websit agent interact characterist observ part websit presenc behaviour custom visit websit perform action make modif websit show custom pa commun agent request custom profil custom privaci constraint info custom info person assist interact characterist observ notic offer websit websit item custom commun agent info offer custom privaci constraint custom profil inform info inform intern design softwar agent agent applic design basi gener model broker agent process broker involv number activ respond custom request object word object product inform object text maintain inform build custom profil basi custom maintain inform maintain provid match custom request product inform strict soft search inform respond offer product inform custom offer fit profil section gener broker agent architectur present support activ gener model basi websit agent person assist agent introduc section gener broker agent architectur design gener broker agent main aspect process knowledg relat knowledg process composit composit gener agent model support weak agenc notion highest abstract level number process distinguish support interact agent process manag commun model compon agent interact manag fig commun info observ result wim observ agent info commun agent info agent task control process control mainten agent inform agent specif task mainten world inform agent interact manag world interact manag process info wim process info aim process info mai process info info commun commun info ast commun world info observ action observ info ast observ world info action observ info ast commun info ast agent info world info agent info wim agent info aim world info aim world info wim fig composit highest level broker agent compon incom inform determin process agent commun inform outgo commun prepar agent maintain inform agent mainten agent inform compon mainten world inform includ store world inform inform attribut process process control defin characterist agent determin foci behaviour compon world interact manag includ model interact world world wide web initi observ receiv observ result agent process discuss gener agent process agent perform process process perform task specif directli relat specif domain applic broker agent determin agent inform object inform provid agent compon mainten world scope interest agent compon mainten agent combin determin agent interest object fig depict broker agent compon part exchang inform gener broker agent model broker agent input scope interest put forward agent inform attribut object commun inform provid agent produc output agent object attribut object produc output inform provid interest intern design websit agent person assist broker agent architectur mean establish intern design type agent involv section compon websit agent briefli discuss websit intern storag updat inform world agent belief perform compon mainten world inform mainten agent inform profil inform custom obtain person maintain custom permiss identifi behaviour instanc person assist give input profil mainten world inform info inform mainten agent inform info custom custom privaci scope agent specif task compon match techniqu emploi relat demand offer person websit intern storag updat inform world agent perform compon mainten world inform mainten agent inform mainten world inform includ inform inform mainten agent inform custom custom privaci scope system behaviour system behaviour explain behaviour initi inform request user behaviour initi updat addit inform websit initi reactiv chain case main reactiv chain path half path deal half answer queri case main reactiv chain path half deal offer inform half feedback offer inform order updat profil inform system system work actual inform websit sampl inform object websit descript made fig user interfac question state user interest peopl insur compani attribut select describ titl inform object depart person creat inform object subject inform object relat subject relat subject date languag inform indic inform outdat form inform object type inform inform object person hyperlink actual inform object found behaviour initi user user thing happen simultan person assist agent question find similar previou question interest creat agent respond inform request find inform pa contact websit agent thing answer question found process updat user profil discuss handl question behaviour user detail descript multi agent system fig displai answer question offer made pa user interact user inform car insur user commun question person assist interfac user select subject insur list head press button person assist start acquir inform behalf user fig detail inform found inform gather contact websit agent inform gather inform commun displai fig titl clickabl descript inform descript user evalu inform interest process system user commun question person assist agent question compon agent interact manag question relat task specif compon determin person assist compon determin question match inform object memori agent mainten world match inform object agent knowledg type match strict match soft match strict attribut overlap rang soft valu attribut consid close necessarili close relat base techniqu current prototyp close relat subject attribut point abstract manner determin assum match rule subject match relat subject rule object select answer answer definit object differ subject rule final answer question websit agent person assist awar consid inform step person assist agent websit agent provid inform subject person assist agent model websit express compon mainten agent subject question rule succe question subject term websit agent subject person assist agent fall back method find websit part agent model websit final person assist default websit agent contact turn default wa store compon process control compon determin final select wa contact term term transfer compon agent interact manag commun initi select websit websit agent receiv question handl person assist handl compon determin find match inform object match commun back person assist compon agent interact manag pa receiv answer pass user inform object store person futur suppli inform updat user profil prototyp focu lai agent interact document select profil manag lower prioriti mechan profil manag extens research state pa compar question similar found similar ad user interest system compon interest creator question compar question simpl method chosen creat question match attribut pair combin candid interest extra constraint ad creation candid question distanc queri id combin creat temporari candid id creat candid compar exist interest compon reason compar compon mainten agent interest maintain reason interest encapsul term rule candid duplic exist interest ad user interest uniqu interest identifi creat interest creat compon maintain agent inform inform link behaviour initi websit type behaviour directli serv user interact behaviour updat user profil detail offer user inform behavior user detail descript multi agent system user interact person assist notifi user initi interest inform found displai answer inform request displai fig bottom half screen user click titl inform inform user accept inform reject process system inform websit agent start interest parti person assist built profil websit agent built profil person assist contact compon determin websit agent inform match person assist interest collect scope object comparison interest object partli specif scope match interest interest object differ differ exist object select offer made compon agent interact manag person assist receiv offer compar user specif user person assist determin websit conflict scope found interest offer object select select offer commun repli offer updat user profil user told person assist found offer interest profil updat process repli updat user remov interest receiv neg feedback feedback compon interest remov select interest remov creation simpl mechan select interest remov kind circular list offer base interest list object object show neg interest mark interest mark remov automat remov user give approv user interest reset reject row receiv agent consid interest remov user approv remov interest compon reason interest compar compon mainten agent inform interest remov inform similar interest creat discuss paper architectur intellig websit base inform broker applic intellig websit insur support architectur person feel usual websit negoti facil incorpor applic broker agent implement principl explicit design conceptu support mainten gener broker agent architectur design implement principl composit develop method system desir due composit structur support easili adapt architectur result broker agent model facil integr provid autom support agent mainten composit verif method system introduc architectur introduc requir properti intern compon express tempor logic relationship properti proven applic insur gener broker agent model instanti domain ontolog domain knowledg prototyp instanti ad hoc intent instanti gener approach domain current research address principl manner dynam taxonomi profil creation techniqu induct logic program induc profil exampl acknowledg pascal van support experi variant broker agent model author grate discuss richard insur compani refer formal specif case lesser intern confer mit pp extend version intern journal cooper inform special issu formal method cooper inform vol pp composit design gener agent model appli ai journal agent marketplac bui sell good intern confer practic applic intellig agent practic applic compani pp experi creat agent market place intern confer practic applic intellig agent practic applic compani pp composit design mainten broker agent technic vrije universiteit depart artifici composit verif formal analysi reactiv wp de pnueli intern workshop lectur note comput vol springer pp kqml matchmak lesser intern confer mit pp inform broker agent architectur intern confer practic applic intellig agent practic applic compani pp issu autom negoti electron extend contract network lesser intern confer mit pp virtual architectur strategi intern confer practic applic intellig agent practic applic compani pp agent survei pp nr intellig proc intern workshop agent architectur lectur note vol springer
ML/1425 6 symbol classif algorithm case studi version space stefan wess christoph globig po box germani abstract contrari symbol learn repres learn concept approach describ concept implicitli pair measur similar sim set cb case pose question differ learn power approach articl studi relationship case measur target concept learn process transform simpl symbol learn algorithm version space variant achiev result strengthen hypothesi learn power symbol method show interdepend measur algorithm target concept introduct articl compar learn power import learn paradigm symbol approach step jantk analyz common point induct infer learn term symbol learn subsum code knowledg provid present case symbol concept tree learn task studi classif object aim classif task map object concept subset simpl scenario decid membership problem concept separ disjoint subset present work partli support deutsch sfb intellig project system symbol knowledg term work reader term contrast special class learn approach system neural term approach special scenario show approach learn power symbol approach introduc approach classif show result achiev work independ approach present simpl symbol learn algorithm version space transform algorithm variant show symbol algorithm learn power base show approach exist strong tradeoff set learnabl concept minim number case case base conclud scenario bia compar strength approach fundament problem approach solv learn phase moment learner correct classif finit subset knowledg algorithm incomplet comput hypothesi correct basic algorithm classif applic phase system classifi case respect set store case base cb case tupl descript case classif case unknown system search case base cb nearest neighbor similar measur similar sim state classif nearest neighbor classif case basic algorithm approach present fig basic algorithm classif defin cb initi sim case present find case cb maxim state classif user correct classif classif correct classif incorrect modifi sim cb respect classif step fig basic algorithm classifi viewpoint machin learn concept format task question learn concept repres approach contrari symbol learn repres learn concept system describ concept implicitli pair relationship case base measur classif concept case base measur similar equat analog arithmet repres concept multipl exist pair sim sim sim concept equat hint learner improv classif abil possibl improv system system store case case base chang measur similar chang cb sim learn phase system fig sequenc case build sequenc pair sim sim sim cb fx aim limit pair correct classifi target concept system appli techniqu classif symbol domain basic idea knowledg case directli solv problem directli system extract explicit knowledg learn phase appli abstract knowledg applic phase method retriev import point approach method retriev similar case main approach method retriev similar case code structur case base case connect index structur order determin similar case index structur case neighbor index structur state similar comput reason learn case store unstructur set similar case determin evalu similar measur sim dual notion distanc measur sequel term measur distinguish similar distanc measur type measur power respect context exampl specif valu sim interest relat relat similar import comput sim sim iff sim retriev similar case defin sim sim call similar respect iff relat tupl case call order prefer relat case induc specif prefer relat mean case solv classif task case comparison comput approach construct case case base distanc similar measur approach relat repres index structur analyz method comput prefer relat influenc result retriev process answer question realiz relat system retriev case case base solv problem defin measur similar sim pre sim pre ae maxim compar sim pre case obviou method retriev case find similar case search maxim element sim pre search case maxim similar case sim pre maxim maxim element realiz prefer relat numer measur similar method transform prefer relat compat measur similar conclud result retriev process affect paradigm comput prefer relat chang result work appli system follow comput approach case retriev reason restrict sequel system realiz prefer relat measur similar sim measur distanc variant symbol learner demonstr fundament learn power symbol transform symbol learner version space variant version space algorithm simpl symbol learn algorithm simplic easi show lot hold learn difficult prove symbol version space case consist finit vector finit set wn decid membership problem concept concept learn fix attribut describ concept vector cn ij case fulfil concept fulfil demand concept call consist set posit set fulfil concept symbol version space solv learn problem updat set concept specif concept consist case includ gener concept consist case task symbol algorithm chang set order preserv properti figur show algorithm simplic assum posit case initi set import moment case subsum case subsum concept concept repres conjunct atom formula shape circl size big version space algorithm initi fa actual case posit remov concept subsum posit case search specif concept version subsum posit case defin fcg defin actual case neg remov concept concept subsum search gener subsum posit case replac found concept empti concept specif concept concept version concept fig algorithm symbol version space neg observ lead partial function classifi long classifi case case cover clear belong concept return answer case semant illustr version space algorithm present simpl shape size figur show graph learnabl concept studi learn process posit case case neg forc special concept concept replac consist gener special chang case posit gener concept special concept concept consist fig set learnabl concept case turn equal singl concept learn concept defin case decid fulfil target concept present set chang variant version space analyz version space obviou main learn task distinguish relev irrelev attribut observ construct variant algorithm previou section attribut call part target concept attribut defin function map ae function combin fn distanc case defin metric jf jf fn obviou chang function fn chang underli measur intend function learnabl algorithm fig algorithm expect case posit concept function case base cb classif case set fx cb cb algorithm learn initi posit case cb case bn store case base cb cb posit map exist case cb df target concept member version space concept determin concept learn classifi consist case base cb measur df step fig algorithm learn comput classif similar case classif case case case classif determin fix strategi solv conflict strategi strategi induc function conflict solv strategi state minim classif order concept strategi cb cb solv membership assum case classifi neg minim distanc posit neg minim achiev behavior classifi order concept analyz classif abil illustr algorithm simpl section function shape size posit case initi function ae circl ae big cb case sequenc store case case base ae circl ae big cb classifi case distanc case assum defin valu store case case base ae big cb test element correctli classifi obviou algorithm learn process stop point analysi analyz classif detail posit neg case differ learn posit case chang adapt distanc measur store case base except posit neg case store case base cb chang distanc measur inform chang chang case base measur similar easi show case classifi symbol classifi correctli differ variant comput classif case distanc measur symbol classifi classif correct case fulfil concept concept produc classif add classif nearest neighbor correct forc produc test variant origin algorithm relationship shown reformul version space algorithm manner variant behav symbol algorithm import understand implic measur similar set concept assum case finit decid membership problem concept distanc measur total satisfi condit import relat defin relat member relat classif exist case separ number induc state repres concept satisfi member class classif measur distinguish concept concept repres case classifi measur defin set learnabl concept case base cb select concept set dimens comparison system case case base cb fill class induc measur case lower number class chang measur target concept identifi fewer case lower number class mean modifi measur distinguish fewer concept compar system respect minim dimens relat implicit knowledg code measur sim measur implicit knowledg size case base knowledg code measur sim result smaller size case base cb classifi similar measur sim system sim call inform measur sim system sim iff system classifi concept cb ae cb sim classifi concept dimens relat set learnabl concept distinguish learnabl concept concept call measur exist finit case base cb classifi concept call learnabl measur exist strategi build finit case base cb limit classifi concept similar measur sim call similar measur sim iff set concept learnabl sim proper subset set concept learnabl sim similar measur conflict minim case base reduc size case mean code knowledg result similar measur distinguish extrem knowledg code case similar maxim compar case measur learn binari concept case cb result system minim knowledg code similar maxim classif compar case measur similar sim definit concept learn knowledg concept code measur case base posit neg case trivial variat measur distinguish concept rue case case result system minim measur minim size cb number learnabl concept fig measur minim case base number learnabl concept illustr contrast natur aim fig figur show measur sim relat minim size case base cb learn concept total number learnabl concept case consist attribut attribut size concept measur fix attribut measur tabl extrem maxim repres concept minim case base distanc measur comput case present dimens map map vertic cube measur learn concept distinguish relev valu concept build class process reduc size learnabl concept size case base perform measur fig simpl reformul symbol algorithm actual symbol hypothesi construct measur store posit neg case case base choic distanc measur argu distanc measur learn concept concept learnabl distanc measur depend definit distanc concept learnabl distanc map greater make distanc measur map distanc case set reason complex distanc measur hope reliabl concept class measur fill illustr compar measur learn concept consist case attribut valu attribut concept learn distanc measur ae ja measur repres concept figur show classif rate concept case base size classifi correctli measur requir correct number case portion correctli classifi case grow measur constant measur inform measur differ measur distanc measur distanc greater hint classif case ident small distanc measur high probabl case equal classifi result impli choic concept defin concept small distanc case impli high probabl classif mod mod mod mod rate correct classif concept rate fig discuss symbol approach comput classif case present input output algorithm distinguish symbol approach symbol algorithm build hypothesi reveal common characterist case predefin hypothesi languag hypothesi describ relat case concept compon learner state similar distanc case measur defin prefer relat case section independ exist concept transform prefer relat measur shown section result work appli system follow comput approach case retriev main differ symbol classif algorithm learn concept section classifi consist case base cb measur similar sim repres concept multipl tupl sim case base cb measur sim suffici build classifi knowledg concept spread hypothesi produc algorithm repres concept symbol procedur build explicit learn concept trivial task extract explicit symbol concept case base measur shown method section reformul symbol learn approach variant problem power symbol approach similar simpl scenario section question approach interchang situat assum classifi explicit descript concept system choic symbol approach interchang context symbol approach correspond kind compil process approach kind interpret run time approach concret situat question adequ previou knowledg previou knowledg concept neighborhood lead section approach good choic scenario code neighborhood principl measur approach produc good concept class measur fill analyz section relationship measur case target concept scenario classif task learn algorithm strong assumpt target concept order solv task accept number case assumpt exclud concept hypothesi space symbol learner assumpt restrict languag repres learner code assumpt measur similar restrict hypothesi space call bia divid abstract learn system bia describ amount power learner section system number learnabl concept number case identifi target concept algorithm case case base fill class induc measur knowledg case lower number class chang measur target concept identifi fewer case measur defin set learnabl concept case case base select concept set bia relat restrict set learnabl concept induc measur similar compar minim size case base reflect inform learner correct power learner similar measur conflict minim case base reduc size case mean code knowledg result similar measur stress measur modifi bia reason system base bia deduc reject thesi classif situat low amount previou knowledg conclud classif task fundament advantag learn power system maintain cost salzberg section intellig classif system depend intellig measur similar properti approach thesi intellig properti approach state cost salzberg number case algorithm learn concept directli relat size hypothesi bia compar strength approach symbol approach extra evidenti knowledg restrict languag repres algorithm measur similar mm kp jantk discuss review comment refer david aha learn algorithm rai reason workshop morgan kaufmann david aha denni kibler learn algorithm intern confer artifici intellig page usa david denni marc albert learn algorithm machin learn kodratoff michalski page cost steven salzberg weight nearest neighbor algorithm learn symbol featur dasarathi nearest neighbor nn pattern classif techniqu ieee comput societi christoph globig stefan wess symbol learn classif proc der der gesellschaft fur springer robert holt commentari proto learn michalski page klau jantk learn induct infer proc yve kodratoff editor artifici volum iii morgan janet kolodn retriev organiz strategi conceptu memori lawrenc editor artifici intellig volum palo tm mitchel gener search artifici rendel gener framework induct studi select induct machin michael richter classif learn similar measur proc der der gesellschaft fur ev springer michael richter stefan wess uncertainti reason robert autom essai honor page kluwer academ craig stanfil david waltz reason articl process macro packag llnc style
Agents/1426 1 van dyke parunak po box ann mi defin agent po box ann mi abstract discuss agent interact frequent behavior seri formal distinct term argu special foundat categori measur joint inform system categori orthogon reflect correl special satisfi user requir explor lack correl show formal stochast case lack correl stochast keyword agent interact introduct agent thing research system design work system discuss disciplin vocabulari current fashion circl cooper domin theme pioneer work function accur cooper system subtitl case system design care agent cooper contend long behavior coordin market mechan achiev coordin larg mechan competit level individu agent content cooper presum cognit model agent satisfi interact architectur term agent interact includ english made latin prefix term begin refer collect point capit permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee aama juli itali copyright acm po box ann mi jame odel jame odel associ river drive ann mi capit fashion world agent vocabulari sampl paper field paper poster present show form term occur titl account remain lone instanc made pack introduct term lead research simplist agent interact clear agreement member differ taxonomi describ agent embrac term accommod varieti agent architectur taxonomi enabl research describ greater agent interact mechan involv interact section paper illustr part set section begin gener defin term formal statist metric popul correl make assumpt intern structur agent rel central decentr behavior section discuss restrict correl result inform flow agent flow result intent individu speak discuss section intersect cooper coordin section discuss group behavior emerg interact system design section return fundament notion correl examin wai avoid section offer summari includ noun adject refer grammat form intend reader appli observ mutual inform gener describ agent term joint correl joint mutual entropi quantiti determin access intern structur agent broader system describ set agent posit joint inform time agent access ni action definit term state action affect prefer focu action unlik extern visibl probabl agent execut action aij measur behavior time defin standard ni ai log entropi system term combin action individu agent restrict discuss concept readili extend number maximum total number system action pj index joint system entropi system entropi equal obtain behavior individu agent statist independ system entropi strictli sum individu agent differ joint call joint inform prefer term avoid connot disord implicit behavior agent system high joint inform statist correl system low joint inform basic agent correl action statist depend agent matter level correl result inform flow agent central root cognit gener correl manifest joint fact quantiti measur system correl speak higher correl joint inform greater benefit perspect permit distinguish fact correl mechan achiev agent access widget perform duti widget simplifi agent access widget half time probabl agent access widget probabl agent access widget probabl agent access widget probabl agent σ access widget assum widget work agent time individu agent entropi log system joint agent access widget access widget access widget widget vice versa agent coordin possibl equal probabl system entropi log equal sum individu agent joint inform assum behavior correl avoid joint action widget case system probabl system entropi sum agent entropi joint inform agent illustr applic joint inform model resourc minor detail time step agent popul seek alloc resourc agent receiv point turn find system goal maxim total point award entir popul agent minim varianc popul resourc success inform agent time seri identifi resourc minor past cycl turn agent consult entri time resourc access time step quantiti reflect normal size strategi space turn critic paramet dynam game figur plot normal varianc σ function low varianc reflect high desir behavior locat minimum dash line show behavior result agent figur perform size strategi space minor measur system ineffici size strategi space access agent dash line random choic agent joint inform figur joint inform minor bar mark standard deviat phase transit figur correspond made random choic minimum phase discuss detail system perform quickli agent made random choic studi time seri minor group show behavior distinct strategi small probabl high agent overlap phase agent perform approach random limit asymptot illustr joint inform minor game popul agent entropi agent comput basi probabl resourc entropi system comput basi probabl specif vector individu agent choic time step system state space reason run system order estim probabl state space system data focu subsystem agent subsystem state space reliabl estim probabl experi step run step ten subsystem agent conduct thirti run figur show measur joint inform figur import region figur correl highest low consist analysi show herd behavior region low declin size standard deviat correl compar valu distinguish strategi agent low result higher correl behavior high low region agent approach random limit gener shape curv low slope low high steep slope deviat gener shape region correspond phase transit experi sampl joint inform reflect structur curv measur thing figur measur estim system figur measur correl measur statist point discuss section commun gener term current commun agent interact acm comput classif system artifici discuss differ describ simpli fact statist agent impli process process involv inform flow individu agent environ li individu boundari option flow stem content includ agent state variabl side effect definit requir redefinit paper titl environ includ softwar agent human system convent comput system relationship pair agent point time depend state agent rule system role protocol agent rule agent call relationship agent fairli fix relationship human programm softwar vari time peer agent negoti work plan call result relationship concept develop formal depend autonomi theori develop present discuss environ set state variabl agent environ support process coupl state variabl chang time distinguish categori variabl valu endogen variabl chang time depend action peer agent valu exogen chang time independ action peer view result action distinguish script system design mechan correl central decentr fact correl describ result mechan enabl frame disciplin comparison central inform flow tabl categori commun topolog relationship central decentr peer peer direct construct command indirect constraint stigmergi messag competit decentr solut problem inform flow involv direct agent agent aspect environ make commun indirect explicitli model state tabl reflect categori central mechan correl involv commun distinguish agent subordin flow place directli distinguish agent construct command indirectli distinguish agent coerc subordin manipul exogen variabl visibl correl command highli ma focal point algorithm advoc common util function implicit reli construct indirect central subordin jointli share exogen variabl dynam independ agent move inform subordin serv synchron signal correl action configur target obstacl testb constrain support correl indirect central action decentr mechan correl involv commun peer bulk research negoti direct inform indirect decentr flow occur peer make endogen variabl class coordin call greek word work perform agent environ turn guid action techniqu common biolog distribut decentr system insect coloni common form stigmergi resourc occur agent seek access limit resourc agent consum part share agent access resourc observ reduc modifi behavior agent resourc mainten load mainten resourc avail agent access directli process contribut dynam state variabl involv term begin term establish research commun warrant suggest altern reserv term resourc competit subset stigmergi gener opposit prefer term discuss awar activ role environ plai negoti experi instanc contract net manufactur control carefulli prove protocol ran physic control promptli deadlock negoti question concern movement physic part workstat analysi protocol neglect movement physic part movement convei inform softwar agent repres repres extens invalid proof system deadlock arriv part receiv workstat gave workstat inform state system part deliv studi negoti coordin mean inform flow directli agent situat robot world suggest problem domain deserv promin role process motiv understand role environ learn exploit support heterogen societi agent environ definit access agent negoti agent deal domain manipul physic environ defin common standard agent contrast arbitrari standard programm direct commun integr reflect state dynam process global level visibl intern model maintain agent captur interact effect escap notic individu agent priori model maintain individu agent assum agent interest resourc load resourc integr inform demand agent emb domain constraint resourc directli reason identifi model advanc stock market illustr import inform flow mediat endogen variabl affect stock trader busi wai trader obei sec commun directli determin share bui sell trader offer sale share offer depress share make compani attract potenti buyer inform flow tween trader environ stock market busi execut reli extens reach contract custom supplier pai attent indirect inform includ stock market stock price drop supplier spite explicit fulfil oblig minor game excel competit discuss implic indirect coordin mechan reflect coordin mechan recogn organiz design promin discuss distinguish mutual inform commun correspond direct decentr quadrant tabl call direct repres portion quadrant standard work process set work station assembl adjust environ constrain agent behav correspond quadrant standard output insur intermedi output produc worker serv input mechan enabl quadrant standard skill knowledg worker train ensur behav coordin wai quadrant tabl cooper intent determin correl popul agent empir process requir knowledg intern structur agent outward organ focu commun process coordin requir investig organiz leav intern logic agent undefin main approach defin intern logic agent agent defin outward intern program make claim imit detail function cognit agent inspir work artifici life cognit soar bdi seek imit process human cognit determin agent cooper insid trader commod market exhibit high correl result inform flow cooper observ outward action trader bid commod contend seek control cooper price current simpli compet defin section differ resolv determin intent particip agent definit support space work full theori cooper competit suggest condit cooper exist cooper agent joint intent content suggest intent part agent frustrat intent notion line joint intent requir intent respect common term discuss agent seek common limit resourc harbor cooper content correl driven agent intent definit import implic cooper content imput popul cognit agent agent coordin competit scarc cooper meaningless describ behavior agent minor game behavior driven hardwir incap form joint antagonist intent cooper content requir direct decentr commun tabl result central inform flow mediat interact special case agent cooper worthi suggest reserv term situat congruenc mode interact discuss necessarili desir simpl problem correl access agent widget consid section agent avoid achiev joint inform agent correl case product lower correl system random similar exampl construct illustr competit result product system crucial insight system goal individu agent agent reason explicitli agent agent categori content cooper account individu agent system goal pattern agent interact level correl content satisfi congruent relat agent yield congruenc term acm comput classif al defin goal wai engin defin creator term cognit multiag emerg agent interact democrat process agent individu goal agent gain control posit societi goal point made congruenc inform flow individu agent intent exist form correl conceiv system system congruenc defin emerg goal requir cognit agent agent emerg exhibit congruenc wai creator defin goal exist larger system includ cognit cognit agent defin emerg system goal entir portion system judg persist effort meet vari success system conflict goal popul agent inconsist popul cognit agent tension emerg creat system cognit agent disjunct topdown goal goal emerg popul congruenc defin respect goal set goal goal defin affect depend individu agent respond emerg goal chang behavior minor game good system topdown system goal total point award goal agent reason system congruent vicin phase transit correl reflect structur system perform statist correl highest level correl occur low system congruent agent coher intermedi level subject studi ma commun refer case intent section space work detail simpli suggest distinct contribut congruenc coher figur congruenc express align system behavior system goal coher relat agent produc congruenc theori defin set standard assess congruenc argu member refin defin inform flow individu intent goal underli assumpt challeng discuss congruenc correl good thing worth inquir form interact manifest situat peer distinguish control seek elimin correl situat wai agent system content adversari advantag observ regular perform system seek avoid made statist independ entiti due similar intern agent tend problem spread job effect agent system form weak search particl swarm optim evolutionari comput search space system behavior mechan reli assumpt depend dynam system sampl state correl agent impli region state space repres sampl default set agent make basi random process central control run random process direct action agent run random process inform flow guid make observ system agent correl correl set subset entropi entir entropi ith peer perfect requir sum element agent contribut sum element make full contribut requir sum element definit contribut entir system correl set agent random process achiev assum agent random process action determinist function central signal observ behavior behavior statist independ action system correl observ make ma research deal perfectli system correl happen agent behav aggreg behavior reflect put emerg behavior ubiquit behavior correl simpl herd behavior market ma research suggest emerg behavior threat suppress constrain behavior individu agent system exhibit subset total potenti behavior realist approach understand mechan drive emerg har product observ import stochast element system agent spread joint state flip coin statist devic avoid undesir correl techniqu swarm intellig includ stochast element ant path plan requir ant follow pheromon gradient weight random walk base gradient swarm sort algorithm pick deposit base function recent observ concentr emerg organ wasp depend stochast transfer forc agent stronger wasp win agent thing clear discuss effect design requir term describ joint behavior suggest ontolog fundament characterist defin nonzero joint inform popul agent agent correl pure behavior notion requir knowledg observ action agent admit sort refin orthogon wai coordin correl focu inform flow enabl flavor competit main distinct inform flow central direct indirect coordin impli architectur silent intern process cooper content correl modul intent individu agent cooper requir joint content requir intent part agent frustrat intent concept requir intern architectur individu silent independ coordin system cooper intent part individu exhibit collabor congruenc measur agent system align defin endogen exogen independ interag architectur coher relat agent yield congruenc congruenc necessarili monoton function correl correl yield lower congruenc disciplin attent distinct enabl research commun multiag system user select intellig technolog acknowledg work support part darpa ant program contract darpa pm vijai raghavan view document author interpret repres offici express advanc research project agenc govern refer acm acm comput classif system introduct artifici life springer arkin cooper multiag robot navig journal robot bond editor read distribut artifici intellig san morgan brook intellig artifici bussmann program manufactur control task intern confer system page ieee comput castelfranchi found agent autonomi depend theori european confer artifici page io cohen levesqu teamwork sri menlo cavedon social sophist bdi agent fourth intern confer multiag system page ieee comput corkil coher cooper commun problem solver ieee transact rosenschein coordin valid focal point techniqu intern confer system page rosenschein cooper commun nation confer artifici intellig page la reconstruct du le coordin sp la de la essai du comport de termit insect huhn editor read agent san morgan jacob illustr evolutionari comput mathematica san morgan jen softwar engin artifici shi swarm intellig san morgan lesser corkil function cooper distribut system ieee transact steiner understand agent perspect intern confer system page mit structur adapt competit minor game program studi complex ann url exact solut modi el bar effici role market impact pdf structur design effect organ englewood newel unifi theori cognit harvard parunak manufactur experi contract net distribut artifici page parunak distribut ai manufactur issu insight demazeau decentr page parunak engin principl natur agent system annal oper approach agent workshop radic agent concept page parunak odel repres social structur uml softwar engin workshop softwar page experi indirect negoti aaai fall symposium negoti method autonom cooper rao georgeff model ration agent bdi architectur intern confer principl knowledg reason page morgan adapt market phase transit program studi complex ann url simul emerg downward causat small group base simul page hale learn coordin share inform nation confer artifici intellig page shoham tennenholtz social law artifici agent design artifici shoham tennenholtz emerg social analysi simul journal artifici wooldridg jen pitfal orient develop int conf autonom agent page yokoo distribut constraint foundat cooper system
ML/1427 6 analyt mine associ rule hua zhu scienc technolog thesi submit partial fulfil requir master scienc school comput scienc fl hua zhu simon fraser decemb reserv work reproduc permiss author approv hua zhu master scienc titl analyt mine associ rule examin dr jame chair dr jiawei han senior supervisor dr qiang yang supervisor dr william haven extern examin date abstract wide applic comput autom data collect massiv amount data continu collect store creat immin great opportun mine interest knowledg data associ rule mine kind data mine techniqu discov strong associ correl relationship data discov rule market basket busi manag develop interest associ rule mine call analyt mine associ integr recent develop olap analyt technolog effici associ mine method lead associ rule mine high perform algorithm develop base approach mine kind associ includ hybrid associ algorithm implement system studi show approach present great advantag exist algorithm term flexibl effici olap analyt data associ rule data acknowledg senior dr jiawei inspir data wareh date interest excit gratitud invalu support guidanc write thesi dr qiang extern dr william read thesi give good suggest opportun express intellig laboratori school comput scienc simon fraser invalu suggest year studi friend made simon fraser make time love parent zhu sister zhu brother lin zhu continu love encourag gratitud understand love thesi written dedic parent content abstract acknowledg dedic introduct analyt process associ rule discoveri associ rule area applic motiv problem lack gener associ rule mine algorithm problem user overwhelm number rule identifi problem strong associ rule necessarili interest thesi organ relat work data wareh olap technolog data wareh data cube analyt process concept hierarchi associ rule discoveri market basket analysi associ rule mine associ rule mine associ mine associ rule current project system gener framework overview data work data cube olap engin work data cube olap engin associ mine engin basic concept framework associ mine engin visual graphic user interfac associ mine gener work cube gener frequent itemset apriori algorithm associ mine associ mine hybrid associ mine gener strong associ rule frequent itemset mine associ rule associ rule associ mine constraint constraint perform analysi system implement interfac associ rule visual futur work summari research discuss futur work bibliographi list figur architectur analyt associ mine base cube product profit data cube gener sale data cube mine associ rule gener frequent itemset minimum support gener frequent itemset minimum gener frequent apriori minimum support perform comparison cube perform comparison cube hierarchi locat dimens cube gener roll frequent number bracket price product frequent frequent itemset perform analysi threshold algorithm perform analysi threshold algorithm gui page associ rule mine gui page associ rule mine gui page hybrid associ rule mine mine countri level locat dimens mine region level locat dimens interfac constraint dimens interfac constraint dimens valu interfac constraint dimens bodi head interfac constraint dimens bodi head valu tabular associ rule ball graphic associ rule bar graphic associ rule list tabl cube tabl cube figur sale data attribut gener relat sale count attribut transact tabl gener sale dimens cube experi size candid itemset associ mine min supp cube inform experi size candid itemset associ mine min supp size candid itemset associ mine min supp price product constraint categori constraint chapter introduct wide applic comput autom data collect massiv amount data continu collect creat great demand analyz data turn knowledg knowledg discoveri data mine import field recent year address analyz data larg discov kind knowledg larg associ rule mine attract great attent research commun recent year associ rule mine form data mine discov interest relationship attribut data discov rule busi manag rule custom tire auto accessori automot servic rule easi catch import relationship data larg mine associ rule larg data set topic recent research data mine similar mine mine associ rule involv major includ understand real world data mine task appli data consist million concern effici scalabl mine associ larg order substanti reduc comput complex data intens process essenti research issu surround associ rule mine find fast effect associ rule mine algorithm develop interest call analyt mine associ integr recent develop olap technolog effici associ mine method develop method achiev associ rule mine high perform develop method present great advantag exist algorithm term flexibl effici analyt process due import data techniqu develop analyz data larg effici effect analyt process techniqu proven popular tool effect data analysi olap technolog view aggreg data provid quick access strateg inform analysi facilit queri larg amount data quickli tradit relat techniqu olap raw data larg organ multipl dimens multipl level abstract organ user flexibl view data perspect data gener achiev approach data cube induct olap includ select data data build data analysi cube data cube comput algorithm exist materi data cube effici olap algorithm exist manipul data slice advantag wide techniqu combin associ rule mine techniqu associ rule mine associ rule discoveri associ rule mention mine associ rule find interest associ correl relationship larg set identifi set frequent occur formul rule relationship formal definit definit associ rule rule form predic item rule interpret item case item occur constitut item transact depend applic give associ rule concept item transact rule transact branch home variabl repres transact item thing custom transact set item rule custom ibm home comput tend bui soni printer time rule data product item distinct attribut valu transact tupl data rule custom student ag possibl bui laptop area applic associ rule mine origin problem market basket appli problem domain includ financ basi task data associ rule achiev goal data mine model predict futur support ffl market basket analysi understand custom bui habit prefer essenti retail make includ put design place shelv order maxim associ rule mine provid inform effect mine applic retail environ market basket analysi shop basket analysi analyz attribut custom shop basket electron point sale data appli find launch effect promot rule consequ plan store boost sale diet ffl present strong competit environ servic retain custom make custom base import import attract custom compani involv provid servic product exist custom data collect target custom product reap quick profit term problem attempt sell product exist custom compani custom product custom larg larg organ manual sift difficult automat associ rule discoveri techniqu incorpor domain discov knowledg domain expert solv problem ffl partial classif problem requir partial classif describ discoveri model show characterist data cover class exampl class convent classifi ineffect larg number valu attribut miss problem solv associ analysi exampl data consist medic test patient hundr medic test singl patient doctor rule model discov associ analysi medic test result predict combin test result test avoid give patient redund complex test replac simpl test ffl servic associ rule mine extens servic industri secur analyst analyz massiv data order build trade risk model develop invest strategi number compani sector test techniqu produc posit result product util currenc data claim autom stock credit identifi fraud mortgag screen futur motiv associ rule technolog reach level matur associ rule techniqu includ commerci mine area remain area activ research limit current associ rule relat issu motiv continu studi knowledg base associ analysi problem lack gener associ rule mine algorithm associ rule classifi categori criteria ffl base dimens data involv rule ffl base level abstract involv rule algorithm gener applic situat rule current research confin simpl associ repetit natur discov associ rule repetit case hasnt attract attent gener algorithm base current algorithm algorithm combin algorithm rule mine algorithm rule mine experi show algorithm resolv limit discuss effici lose scalabl speed appli previou case problem user overwhelm number rule identifi support confid threshold limit number rule danger rule genuin interest user lost threshold set low motiv user desir form partial content rule mine user provid form pattern templat system attempt confirm search rule satisfi constraint constraint item head rule rule satisfi method mine add rule mine effici appli larg approach problem push constraint procedur associ rule make effici reduc rule search space problem strong associ rule necessarili interest associ analysi suffici find interest rule sale show transact made includ involv minimum support minimum confid associ rule discov confid rule mislead percentag transact includ larger locat product neg involv likelihood involv fulli understand make busi base rule filter mislead associ form perform correl analysi method strong interest rule calcul thesi organ remain thesi organ chapter outlin exist work relat thesi gener descript associ mine system chapter base discuss address problem gener associ rule correl mine approach algorithm solv problem result present chapter discuss system implement chapter futur work chapter chapter relat work basic concept associ rule introduc chapter review current research olap technolog associ rule mine overview relat topic major effici olap oper larg data fast effect associ mine algorithm data wareh olap technolog data wareh data cube data collect data support applic construct data data clean data view import preprocess step knowledg discoveri task construct larg data analysi credit codd coin term olap analyt process portion data precomput materi effici process materi call data cube data structur point data cube view larg arrai consist set dimens respect analyz set valu cell call measur oper point data cube refer relat oper comput aggreg subset dimens treat aggreg attribut aggreg set attribut valu point space rapid accept oper led variant cube sql standard data data cube primit concept raw data knowledg extract express base desir abstract data low concept level reason higher import function call data gener analyt process olap analyt set oper provid data manipul data multipl dimens multipl level abstract basic olap oper includ level level pivot view olap engin demand fast process larg volum data data requir highli effici cube comput queri process techniqu common power queri optim techniqu materi comput raw data time al gave detail discuss techniqu greedi algorithm select materi view studi index techniqu task research speed comput aggreg consist influenti repres agarw al work extend group method effici combin common oper multipl repres al algorithm system facilit effici data current data system support index structur includ bitmap index join bitmap join index concept hierarchi essenti background knowledg appli data gener concept hierarchi dimens concept hierarchi tree lattic structur organ concept dimens partial order level closer root gener closer leaf node concept hierarchi directli deriv schema refer specif defin user domain expert knowledg attribut call specif case automat gener concept hierarchi dynam adjust exist hierarchi desir method automat gener concept hierarchi numer attribut base data distribut dynam refin gener concept hierarchi base learn request introduc associ rule discoveri concept associ rule introduc effici associ mine mechan larg extens domain subject studi studi cover broad spectrum topic fast algorithm base apriori framework includ partit sampl increment updat parallel algorithm mine gener rule mine quantit rule mine long pattern data set mine correl causal structur mine ratio rule constraint mine associ mine cyclic associ rule mine partial period rule mine queri languag limit space limit scope survei aspect studi extens overview field associ rule mine confin scope method extend thesi motiv huge amount sale data basket interest institut market problem associ rule mine introduc lot research aspect topic lot excit result made techniqu origin applic associ mine import tool data mine market basket analysi initi associ rule mine market analysi sale basket data record data typic consist transact identif item bought transact interest influenti algorithm mine frequent call rakesh agraw ramakrishnan srikant apriori emploi iter set frequent found find frequent find frequent found import call apriori reduc scan time improv effici gener frequent item detail apriori algorithm discuss chapter base apriori variat aim improv perform algorithm techniqu reduc size candid scan reduct techniqu reduc number transact reduct techniqu reduc number transact scan futur iter strategi base partit data show stronger effect scan reduct method studi reduc number scan requir associ rule mine research found difficult find strong interest associ data item primit level abstract due sparsiti data strong associ discov high concept level common knowledg mine system capabl mine associ rule multipl level abstract easili abstract space desir base concept hierarchi exist algorithm mine associ group effici algorithm mine multilevel associ rule method han fu concept hierarchi inform encod transact origin transact iter data mine progress deepen techniqu extend exist singl level associ rule mine find larg data item level deepen mine progress larg descend lower concept level reduc support recommend progress lower minimum support threshold mine touch deeper level abstract locat minimum support threshold mine item high level smaller mine level lower smaller mine level lower found uniform support level gener suffici associ low level rule gener high level suffici interest associ rule mine terminolog rule commonli mine transact data refer associ rule singl predic repetit occurr recent progress data wareh olap transact find associ data refer associ rule data cube model mine associ rule al combin cube data structur olap slice layer cube search effici algorithm develop exist data cube construct data cube fly idea find frequent frequent grow frequent slice data cube perform analysi show method outperform direct extens algorithm method easili extend mine associ rule associ mine interest import associ mine attract attent user provid addit constraint rule pattern gener rule interest user specif effect influenti research mine transact conduct al introduc analyz properti constraint critic succinct effici call achiev constraint prune optim push constraint deepli mine process type mine guid constraint express method extend method associ rule mine solv problem algorithm base avail data cube basic idea cube cube search appli summari cell directli find frequent associ rule discuss strong associ rule discov interest present user object base statist step goal weed uninterest rule research paper discuss problem craig al test measur independ classic statist topic associ rule mine studi parallel distribut mine associ rule goal mine extens applic associ rule data sequenti formul mine oper sql queri integr associ rule mine manag system current project system larg number project associ rule associ rule applic commerci great deal interest commerci softwar vendor govern agenc project area larg commerci softwar pronounc research project initi silicon sa contribut ibm almaden research center notabl develop associ rule technolog investig effici method find associ formul associ rule mine queri continu project includ quest data mine project silicon graphic develop sophist data mine visual packag call base public domain machin learn packag includ abil mine associ mine capabl sa institut data mine statist analysi techniqu microsoft fund basic research data mine theori adapt system group microsoft put forward ol db olap set object interfac extend ol db provid access data sourc specif support larg major compani data mine applic addit major numer smaller compani develop product support associ rule govern notabl support data mine research support research directli collabor data mine project includ stanford helsinki develop intellig research laboratori intellig data mine data wareh system consist includ cube data cube summar classif associ predict tool associ modul discov associ relationship larg dataset chapter gener framework problem associ mine view pattern search problem find respect exist strong associ interest pattern introduc gener architectur associ mine system framework associ rule mine implement successfulli system explain basic concept frequent discuss overview mention research associ mine base flat relat tabl associ mine method base data cube structur integr associ mine olap techniqu method refer analyt associ mine observ motiv explor method minimum support threshold associ rule satisfi impli examin nontrivi number time attribut initi relat observ serv constraint prevent examin meaningless candid attribut kei candid kei attribut mine associ rule student relat attribut student student id remov rule refer accumul nontrivi support pass minimum support threshold student student home data numer attribut gener level abstract order accumul suffici support pass minimum support threshold valu attribut student relat gener rang high level retain primit larg larg number user interest small subset attribut data relat larg number data relat attribut extract interest relationship small number facil friendli interfac provid set attribut mine exclud set irrelev attribut examin automat remov gener attribut origin tabl reduc number dimens level abstract attribut examin cube construct small compar huge amount raw data enrich function olap date cube facilit associ mine data cube construct inform raw summar data method effici work data cube associ rule mine engin olap engin user data user interfac figur architectur analyt associ mine access data cube extens olap system successfulli explor data cube structur realist reason effort facilit effici effect mine associ lai architectur associ mine system shown figur gener architectur consist data work data cube olap associ mine part discuss section data data semant consist data serv physic implement support data model store inform make strateg ffl integr histor data miner easili quickli vista histor data data data integr perform dedic system compon kei encod valu structur data great effort data data miner work integr data concentr task associ mine ffl materi data cube substanti cost comput data cube call precomput materi cube materi view requir huge amount disk space partial materi select suggest altern solut select materi save data save amount mine work associ miner ffl metadata metadata serv road map miner describ content data context inform import kind metadata concept hierarchi mention hierarchi basic knowledg data dimens specif data set stage success effici explor world data work data cube olap engin work data cube associ mine task involv dimens precomput materi data data west south locat good tent product profit poor figur base cube product profit data cube dimens cube ja valu ja number distinct valu dimens ja row repres distinct valu cell row store gener initi relat row special cell store aggreg previou row aggreg valu repres essenti featur data cube structur explor chapter map data cube refer cube attribut repres dimens attribut repres count cube cell match tupl tabl figur show tini cube consist profit dimens valu cube tabl cube tabl data cube view partit multipl dimens space base kind cell space consist data cell space consist cell singl space consist cell space consist cell locat product profit count south carri bag poor south carri bag good south carri bag south tent poor south tent good south tent south poor south good south north tabl cube tabl cube figur base cube cube space space consist row fifti row shown tabl space consist row seventh eighth row shown tabl exampl space consist valu ninth tenth row shown tabl case cell space shown row tabl olap engin work cube complet inform task preserv cube cell includ aggreg refer origin relat cube serv data sourc interfac data mine task data mine work larg essenti enrich effici function creat plai data olap major task comput user olap creat data return result user interfac show import role entir data mine architectur detail olap techniqu major part paper effici comput data cube perform olap associ mine engin associ mine engin major compon associ mine system major part discuss thesi introduc gener framework associ mine engin detail algorithm discuss chapter introduc import term frequent thesi basic concept set item refer itemset itemset item left hand side rule part definit bodi hand side head rule frequenc itemset total number transact itemset support confid major measur rule reflect certainti discov rule rule support probabl transact confid probabl transact concept itemset comput support confid defin itemset frequent support minimum support threshold associ rule consid strong satisfi minimum support threshold minimum confid threshold concret rule gener sale relat support rule mean carri bag bought north good custom repres custom studi minimum support threshold minimum confid threshold rule interest type associ analysi discuss ffl associ associ set dimens item rule dimens call associ repetit ffl associ associ dimens item rule call associ ffl hybrid associ associ set item rule dimens call associ previou associ mine refer associ mine repetit ffl associ prefer constraint guid associ rule mine process constraint appli rule item rule form user find rule item rule desir rule satisfi framework associ mine engin gener work problem discov associ rule find frequent itemset support minimum support frequent itemset gener desir rule base data cube framework system ffl phase gener frequent itemset satisfi threshold constraint input work data cube minimum support min supp set constraint rule item output list frequent itemset satisfi constraint output type associ frequent itemset itemset hybrid itemset ffl phase gener desir associ rule input frequent itemset output phase minimum confid min conf set constrain rule form output satisfi frequent phase gener desir rule confid constraint bodi head associ rule satisfi confid threshold constraint output examin user option perform correl analysi associ analysi suffici find interest rule associ rule satisfi confid threshold output visual graphic user interfac visual discov associ rule form user background identifi rule interest guid system discoveri good user enrich queri mine tool serv user implement form tabl view graphic view discuss topic chapter chapter associ mine discuss previou task associ mine explor data cube structur mine associ rule studi effici mine method structur type rule problem hybrid associ subclass mine problem refer hybrid associ mine step associ algorithm divid part gener work cube desir gener frequent itemset support greater minimum support threshold gener associ rule frequent itemset give algorithm subclass associ mine associ mine discuss start introduc data sourc sale exampl chapter sale sale includ sale inform compani part data shown tabl product categor numer exampl data sourc raw data locat product profit seattl alert devic seattl alert devic seattl alert devic seattl alert devic seattl seattl seattl tokyo tent tokyo tent tabl sale data attribut gener work cube mine gener work data cube extract relev date data show work cube gener perform associ mine involv product cube gener olap shown figur numer dimens profit gener gener level locat product profit count sport wear good sport wear excel water good mexico alert devic poor mexico carri bag poor mexico carri bag averag mexico tent mexico tent excel seattl carri bag good seattl sport wear poor seattl sport wear good seattl water averag tokyo carri bag tokyo sport wear averag tokyo tent tabl gener relat sale count attribut map real profit valu raw data aggreg relat attribut count relat shown tabl base cube construct algorithm gener cube dimens profit dimens valu includ distinct attribut valu tabl special count tabl save cube cell count product alert devic sport wear water tent poor excel averag locat profit tokyo seattl mexico good figur data cube gener sale definit cube cube space depict figur color space white cell space cube gener frequent itemset learn gener work data cube mine task studi algorithm gener frequent itemset mine associ rule categori hybrid associ algorithm import apriori algorithm fulli discuss section apriori algorithm apriori agraw srikant interest influenti algorithm gener frequent itemset base transact tabl typic transact tabl consist transact item transact id group transact transact tabl transform tabl item share transact id merg tupl tabl base sale locat transact id attribut product item attribut total assum item transact store lexicograph order shown tabl tran product water sport wear mexico alert tent seattl water sport wear tokyo alert water sport wear tabl transact tabl gener sale detail algorithm depict step apriori find frequent step divid gener frequent candid gener gen join frequent elimin frequent frequent gener procedur gen frequent candid subset function find subset transact count candid candid satisfi minimum support algorithm gener frequent itemset iter approach transact minimum support threshold min supp set frequent itemset method candid fall distinct valu item comput frequent gen repeat gener candid gen comput frequent gen function gen gener frequent candid itemset transact count subset candid return fc min function gen gener candid itemset itemset item item delet add return apriori algorithm emploi iter approach frequent denot find frequent turn find frequent found improv effici gener frequent import call apriori present explor reduc search space theorem apriori subset frequent itemset frequent properti prove agraw srikant base observ itemset adopt minimum support threshold min itemset min ad item itemset combin set occur frequent min supp properti belong special categori properti call set pass superset fail test call properti monoton context fail test properti import optim discuss detail chapter base apriori frequent obtain join frequent frequent subset remov candid list observ facilit gener candid superset member frequent frequent final check support candid result determin candid support minimum support threshold frequent belong gener small base apriori gener step candid gener join member member share common fa ae ja bj remov member frequent basic understand apriori algorithm work transact effici access data cube extens research successfulli construct olap explor data cube structur realist reason effort data cube structur facilit mine associ multipl level abstract section examin effici method mine associ rule larg data cube structur start simplest mine associ associ mine associ associ call item group call transact dimens dimens involv associ mine cube creat olap engin serv work data cube mine give cube mexico water tent sport wear alert devic locat product tokyo seattl figur data cube mine associ rule base sale data locat transact dimens product item dimens cube creat shown figur cube cell save count gener origin relat associ mine base cube algorithm show detail algorithm procedur similar apriori algorithm support candid itemset comput scan part data transact tabl algorithm gener frequent itemset ffl data ffl minimum support min supp frequent itemset method candid fall distinct valu item gener frequent gen repeat gener candid gen gener frequent gen function gen gener frequent candid candid fi frequenc transact item count save cube count item transact item itemset transact frequenc support min frequent itemset return function gen gener candid frequent function work algorithm base apriori algorithm start find frequent candid item slice cube item slice cube number transact defin cell count save decid item transact larger mean item transact number cell slice account larger number item frequenc comput support compar min supp judg frequent discov frequent algorithm gener candid join procedur apriori algorithm candid itemset item dimens posit data search slice cover item transact find item occur transact cell slice transact count valu save cell larger mean item occur transact number transact frequenc itemset frequenc comput procedur exten candid base cube figur mine associ rule locat transact product item dimens min supp ffl iter total candid product slice cube plane cell product compar count valu valu greater frequenc algorithm simpli repeat procedur candid frequenc result shown figur ffl compar frequent determin consist candid frequenc ffl discov candid algorithm gener itemset ffl itemset slice cube plane cell product product check count valu pair cell transact find pair cell valu larger frequenc itemset repeat procedur itemset result shown figur ffl frequent consist candid frequenc ffl gener candid divid step itemset dice cube comput support water mexico seattl tokyo locat product support candid item itemset supp compar candid support minimum support supp itemset gener water carri sport water sport water itemset dice comput support water seattl tokyo mexico water carri bag locat support candid item itemset supp water carri sport water sport water compar candid support minimum support sport water water itemset gener dice comput support itemset supp candid frequent figur gener frequent itemset minimum support base apriori properti subset frequent itemset determin candid possibl frequent remov save effort unnecessari support comput ffl order determin cube slice scan gener frequent itemset final result shown figur ffl frequent itemset found algorithm frequent itemset found discuss problem find associ rule olap technolog discuss algorithm present algorithm work gener candid candid scan cube cell comput support decid itemset frequent part advantag apriori frequent item join decid candid track back itemset subset candid analyz algorithm total number track back comput equat size longest candid jl number gener join frequent number subset join check part cube scan number scan total number cell frequenc comput candid itemset comput equat jc number itemset candid number transact data cube time spent associ mine roughli divid track back time cube scan time fix minimum support variabl jl jc major factor affect valu data cube densiti number distinct valu item dimens denser cube bigger number distinct valu item time spent mine associ mine associ associ set dimens procedur base apriori algorithm support comput method item itemset summari layer data frequenc itemset directli obtain cube make mine procedur effici detail algorithm shown algorithm gener frequent itemset dimens apriori prune ffl data ffl minimum support min set frequent itemset dimens method gener candid dimens fall distinct valu dimens gener frequent gen repeat gener candid gen gener frequent gen function gen gener frequent candid candid fi frequenc count cube space support min frequent itemset function gen gener candid frequent item item dimens infrequ delet add return base apriori algorithm start find frequent discov set frequent algorithm gener candid candid supp gener gener itemset count locat product supp itemset count support cell support candid compar minimum profit supp support cell support candid compar minimum itemset support locat product profit itemset itemset itemset supp figur gener frequent itemset minimum check cell cube space definit count save cell aggreg initi data frequenc itemset repres cell compar collect support min show algorithm work base cube shown figur section associ mine product profit algorithm mine perform ffl distinct valu dimens candid item product cell cube count save cell frequenc itemset iter item comput frequenc ffl threshold min frequent determin consist candid frequenc result shown figur ffl intersect frequent dimens gener candid refer figur ffl itemset cell cube count save mean frequenc itemset frequenc result count shown figur ffl frequent consist candid frequenc ffl step candid join track back frequent fact ad ffl comput frequenc itemset search cube space check count save cell algorithm associ mine method base apriori candid gener join frequent prune subset procedur reduc size reduc frequenc comput spend time join join check frequent itemset data cube size frequent procedur worthi compar optim gain prune candid itemset data cube frequent itemset huge spend time join prune candid itemset implement apriori properti requir complex data structur tree advanc tree structur apriori algorithm show advantag give algorithm solv problem apriori properti prune frequent gener candid obtain combin item algorithm gener frequent itemset dimens apriori prune ffl data ffl minimum support min frequent itemset method gener candid dimens fall distinct valu dimens gener frequent gen supp gener support candid compar minimum gener locat product supp itemset profit supp itemset itemset support itemset itemset figur gener frequent apriori minimum support repeat gener candid gen gener frequent gen function gen gener frequent candid candid fi frequenc count cube space support min frequent itemset function gen gener candid frequent item dimens add return show method work algorithm differ ffl iter dimens gener candid itemset obtain frequenc cube space compar min supp frequent itemset decid step result shown figur ffl gener frequent candid form join frequenc itemset count save cell cube space result shown figur ffl candid join frequent dimens join item locat product dimens profit dimens form candid compar total itemset gener shown figur ffl frequenc itemset gener frequent scan cube space result shown figur discuss problem find associ rule olap technolog discuss algorithm present base apriori properti gener candid join frequent prune frequent method apriori gener join frequent give comparison algorithm base number track back prune number scan cube cell comput frequenc discuss algorithm algorithm complet apriori base discuss algorithm total number track back candid cell check obtain frequenc number scan cube cell algorithm apriori properti candid gener frequent directli track back procedur cell scan candid number scan cube cell comput equat number jl number frequent dimens jc chosen dimens data cube small number itemset pass frequenc size itemset grow algorithm apriori properti gain benefit prune candid itemset reduc frequenc comput prune itemset number dimens itemset gener join frequent work frequenc comput algorithm cube prune candid itemset base apriori properti track back subset itemset algorithm apriori properti track back experi analysi real data show differ algorithm perform analysi present result experi conduct analyz perform algorithm present respect factor cube densiti number experi pentium pro memori run window nt test data real attribut tupl attribut tupl pick attribut dimens construct data algorithm gener frequent itemset run cube experi cube effect date cube algorithm examin select dimens construct data cube algorithm apriori algorithm apriori minimum support threshold figur perform comparison cube number dimens jd size dimens number distinct dimens cube size cube densiti comput cube size jd cube densiti number size inform cube list cube number dimens cube size cube densiti cube cube cube tabl dimens cube experi inform cube run algorithm cube minimum support figur show result execut time analysi perform cube cube algorithm threshold reason frequent gener candid step begin gener frequent gener candid join frequent itemset perform frequenc comput curv cube overlap cube cube cube cube distinct differ algorithm pair curv algorithm apriori properti algorithm apriori properti conclud previou discuss data cube apriori properti prune candid reduc support comput lot combin frequent gener candid apriori frequenc comput gather inform number candid list part cube cube min supp tabl size candid apriori properti time size apriori optim cube algorithm candid candid candid execu cube apriori cube apriori tabl size candid itemset associ mine min supp phenomenon differ algorithm cube bigger differ cube apriori number frequent itemset reduc size candid algorithm apriori number candid itemset depend combin frequent larger bigger number candid dimens involv associ algorithm apriori properti gain differ algorithm depend min supp threshold threshold differ greater easili understood frequent threshold smaller combin tremend apriori make number candid itemset huge experi cube scale experi perform analysi algorithm cube examin effect date cube algorithm data cube construct dimens tabl inform cube cube number dimens cube size cube densiti cube cube cube tabl cube inform experi inform cube cube run algorithm cube minimum figur show result execut time algorithm apriori algorithm apriori minimum support threshold logarithm execut time millisecond figur perform comparison cube analysi perform cube cube threshold algorithm reason discuss experi step begin gener frequent gener candid join frequent cube cube cube cube notic threshold algorithm apriori properti apriori properti gather inform number candid list part cube cube min supp gener frequent cube subset candid gener step frequent apriori properti prune candid support comput save spend time track back procedur cube algorithm candid candid candid candid execu cube apriori cube apriori tabl size candid itemset associ mine min supp threshold algorithm apriori properti perform inform candid itemset cube min supp tabl cube algorithm candid candid candid candid execu cube apriori cube apriori tabl size candid itemset associ mine min supp find threshold frequent combin frequent size candid larger number candid time differ number candid time track back time trivial compar reduc frequenc comput apriori properti notic differ algorithm cube bigger cube discuss experi hybrid associ mine discuss simpl case associ associ associ view call associ mine predic rule call associ mine discuss cover part associ predic rule repetit gener associ desir rule includ multipl repetit predic answer discuss problem give simpl algorithm dimens repetit predic dimens case repetit combin candid itemset written fl inter intra inter item intra easili inter intra frequent fl inter intra frequent itemset find natur easier separ procedur find frequent itemset find frequent itemset merg part frequent hybrid itemset detail algorithm depict algorithm gener frequent intra iter gener frequent merg intra gener candid hybrid final candid itemset satisfi minimum support ad set frequent algorithm gener hybrid frequent itemset dimens data cube ffl data ffl transact dimens item dimens item ffl ffl minimum support min set frequent itemset method gener frequent intra apriori intra empti exit intra iter size gener frequent oe merg iter size repeat merg gener candid gener frequent itemset prune itemset extens prune itemset oe intra gener strong associ rule frequent itemset gener frequent reach final step associ gener strong associ rule frequent itemset step easi associ includ hybrid associ mine definit chapter strong associ rule rule confid minimum confid threshold confid comput base simpl straightforward algorithm step algorithm gener strong associ rule frequent itemset frequent minimum confid min conf strong associ rule method frequent itemset subset conf min conf gener interest rule rule rule gener automat satisfi minimum support requir rule gener frequent itemset frequent itemset store frequenc access quickli algorithm appli procedur frequent itemset demonstr algorithm work step step base gener frequent itemset associ rule gener subset result associ rule shown list conf conf conf conf conf conf minimum confid threshold rule strong confid greater strong rule gener frequent itemset gener conf conf conf mine associ rule previou algorithm studi mine associ rule singl level dimens data cube examin fix level abstract difficult find strong associ data primit level abstract due sparsiti data space strong associ discov high concept level common knowledg desir mine associ multipl level abstract base discuss previou data system implement effici interact dice pivot oper data cube primit olap oper data cube structur olap oper provid conveni base interact mine associ multipl level abstract basic method process chosen dimens concept hierarchi desir find associ rule level abstract mine algorithm olap oper shown base cube figur hierarchi dimens locat figur perform associ mine dimens locat level region level citi mine gener work shown figur base cube figur dimens locat algorithm associ mine run work cube north america seattl mexico tokyo asia level region level citi locat figur hierarchi locat dimens asia north america locat alert devic sport wear tent water poor averag good excel profit product figur cube gener roll discuss strategi set minimum support threshold level abstract depend threshold chang independ min support relationship min support level min support min support level reduc min support lower level abstract smaller min support mine compar approach simpl user expert provid singl uniform minimum support threshold associ rule mine simpl execut mine algorithm fix minimum support threshold itemset lower level abstract occur frequent higher level fix threshold problem set miss lot associ occur low set gener uninterest associ occur high level comparison recommend reduc support threshold progress lower minimum support threshold mine touch deeper level abstract gener suffici associ low level rule gener high level suffici interest associ rule discuss algorithm gener frequent itemset final discov rule experi real thousand rule found small size data rule discov interest present necessarili rule interest judg subject object user judg rule interest differ user object base statist step goal weed uninterest rule present user rule rule deriv support rule confid rule strong associ rule base framework rule incomplet mislead support greater custom bui bui custom inform truth neg depend bui bui filter mislead strong associ rule studi event correl find depend rule order give rule definit defin event possibl event fact event nomin event denomin case activ independ mean bui neg bui rule interest report combin comput associ mine return rule posit depend reduc size result make gener rule notic support item term associ rule definit defin rule algorithm gener interest strong rule algorithm step ad gener strong associ rule method discuss previou section step comput rule filter rule algorithm gener interest strong associ rule ffl mine task relat work data cube ffl minimum support confid min min conf interest strong associ rule method gener frequent itemset gener strong associ rule satisfi min conf threshold algorithm rule rule interest continu gener interest rule gener strong rule comput rule base equat rule interest present user chapter associ mine problem mine associ rule discuss case view process associ mine summar step user specifi part mine user specifi minimum threshold support confid system execut mine algorithm end highli intens data larg number associ user user interest subset desir associ mine system abil user constraint mine focu refer associ mine main task set constraint seek find algorithm sound complet algorithm sound mean find frequent itemset satisfi complet mean frequent itemset satisfi constraint found simpl put forward appli algorithm discuss chapter gener rule satisfi min min confid add step select rule gener rule candid check constraint simpl extens apriori algorithm call algorithm detail algorithm algorithm simpl algorithm associ mine ffl task relev data cube ffl min min conf ffl set constraint rule associ rule satisfi threshold constraint gener frequent itemset satisfi min threshold rule type select perform step gener associ rule satisfi min conf threshold appli algorithm gener desir rule satisfi constraint rule function rule return rule satisfi constraint rule satisfi cf prune return continu examin local store interest rule relat confid threshold mine procedur basic step gener frequent itemset exact method result figur perform algorithm strong associ rule gener associ check item find rule interest ineffici chang constraint notic frequent locat shown figur item satisfi constraint rule deriv violat constraint conclud associ rule gener constraint check gener rule satisfi threshold involv lot unnecessari process kei technic challeng level perform select constraint common test candid itemset constraint satisfact gener associ rule effici approach sound mine constraint item appli constraint frequent frequent miss frequent rule easili perform analysi properti constraint push deepli insid frequent itemset comput kind constraint constraint constraint constraint properti constraint analyz simpl descript set violat superset violat constraint formal definit definit constraint iff set satisfi satisfi exampl constraint itemset proof itemset satisfi mean superset present proof lot constraint kind constraint min constraint easili constraint minimum support constraint call frequenc itemset violat minimum support superset discuss properti enabl apriori algorithm prune number candid itemset requir support comput motiv fact minimum support constraint question prune constraint similar algorithm answer give lemma jsj frequent js jsj satisfi cam js satisfi cam conclud similar constraint incorpor mine algorithm effici frequenc constraint apriori algorithm consist frequent satisfi cam candid gener apriori algorithm prune check itemset satisfi constraint cam frequenc constraint element violat constraint cam support comput lai algorithm associ mine constraint algorithm divid part part gener frequent itemset satisfi constraint part gener associ rule satisfi min conf threshold basic gener frequent candid apriori data directli procedur gener method discuss discuss detail gener prune check constraint procedur simpli check itemset compli constraint frequent gener support comput algorithm chapter algorithm improv mine method constraint ffl data cube ffl min min conf ffl set constraint cam associ rule satisfi threshold constraint cam collect candid prune base constraint gener frequent gen repeat gener candid prune base constraint gener frequent gen gener associ rule frequent itemset function prune itemset satisfi cam itemset satisfi prune function gen gener frequent candid itemset comput support support min supp return base algorithm discuss algorithm basic add step perform constraint check check constraint gener frequent algorithm algorithm conduct constraint check candid itemset support comput properti satisfi constraint deriv prune candid prune number candid set requir support count show improv gain properti product price alert devic carri bag sport wear tent water tabl price product continu price inform product tabl gener associ rule minimum support threshold minimum confid threshold satisfi sum price item itemset price associ mine base algorithm item member set candid tabl price check drop price greater result candid constraint check shown figur form consist comput total price itemset drop set total price greater minimum support set procedur gener frequent itemset finish gener associ rule frequent itemset discuss chapter detail shown comput support gener frequent itemset itemset equal prune itemset itemset water itemset itemset gener prune comput support gener frequent itemset itemset water figur frequent number bracket price product address problem properti associ mine question left recogn constraint belong class prune optim analyz categori constraint summar tabl attribut itemset itemset singl constant dimens set constant simpl proof tabl proof itemset satisfi mean superset true satisfi constraint prove itemset satisfi mean superset true constraint minimum support constraint tabl constraint categori satisfi constraint itemset satisfi mean superset fi fi satisfi constraint itemset satisfi mean superset true satisfi constraint itemset satisfi mean superset ad number item make true satisfi constraint prove prove procedur easili demonstr left group constraint give detail sake space final constraint min support threshold constraint base apriori properti discuss constraint constraint algorithm optim achiev properti restrict iter prune iter level apriori prune candid requir support count satisfact constraint mean gener test candid discuss comput support gener frequent itemset greater equal prune itemset itemset figur frequent chang constraint minimum price item itemset tabl optim similar time candid itemset check item prune constraint check candid shown figur frequent deriv absolut satisfi constraint check observ pose class constraint constraint check iter gener itemset satisfi constraint avoid paradigm complet answer formal notion constraint properti definit constraint iff equat satisfi itemset ae satisfi satisfi give constraint constraint constraint reason item conclud minimum price item mean item form subset minimum price satisfi constraint contradict notic tabl constraint give constraint proof tabl constraint prove minimum price item base fact minimum price item conclud minimum price definit prune constraint satisfact constraint affect result iter candid itemset gener support comput prune candid constraint support itemset deriv prune absolut satisfi constraint question full advantag properti approach directli appli properti sound discuss begin explor combin properti properti defin definit constraint iff easili fact constraint satisfi itemset ae satisfi left direct equat direct properti optim point fact mean constraint prune candid support itemset deriv satisfi constraint mean constraint algorithm lai associ mine constraint candid gener select valu data directli prune itemset satisfi constraint gener frequent support comput iter gener candid frequent itemset apriori gener frequent support comput procedur method discuss chapter discuss detail associ rule gener frequent itemset algorithm improv associ algorithm constraint input ffl work data cube ffl min min conf threshold ffl set constraint pp output set associ rule satisfi threshold constraint pp method collect candid prune base pp pp gener frequent gen repeat gener candid gener frequent gen gener associ rule frequent itemset function pp prune satisfi constraint pp itemset satisfi pp prune function gen gener frequent candid itemset comput support support min supp basic structur algorithm similar algorithm constraint optim differ constraint check procedur compar iter prune comput support gener frequent itemset prune itemset itemset itemset gener greater equal itemset comput support gener frequent itemset itemset sport figur frequent itemset algorithm perform prune candid constraint check deriv prune candid satisfi constraint satisfi constraint deriv prune candid finish gener associ rule condit item rule satisfi constraint constraint proven base algorithm associ mine result shown figur item member candid item price check constraint result drop price constraint tabl constraint frequent gener support comput candid gener comput support itemset itemset shown figur candid gener associ rule gener frequent itemset analyz categori constraint summar tabl analyz constraint properti result tabl proof give simpl proof tabl tabl prove satisfi satisfi mean item form subset satisfi constraint contradict constraint prove tabl prove constraint demonstr satisfi satisfi constraint satisfi mean item form subset satisfi constraint contradict constraint entri tabl tabl simpli prove refer give detail perform analysi present result experi conduct analyz perform algorithm respect optim experi perform pentium pro memori run window nt experi optim techniqu affect step gener frequent run time refer execut time step experi optim experi optim gain appli constraint optim examin experi run base data cube locat product tabl price inform product associ mine task product item dimens locat transact mine associ rule minimum support threshold constraint total price item rule min sum algorithm prune algorithm prune number prune itemset conflict constraint sum price threshold experi number prune itemset conflict constraint figur perform analysi threshold algorithm tabl constraint mine task algorithm base algorithm execut task fourteen valu min sum intuit smaller threshold min sum candid prune perform algorithm figur show perform result number curv repres number itemset prune algorithm threshold analysi curv compli expect gener algorithm outperform min sun differ algorithm min sum itemset prune curv approach close min sum larg part itemset prune frequenc algorithm price threshold experi execu time algorithm algorithm number prune itemset conflict constraint number prune itemset conflict constraint figur perform analysi threshold algorithm experi optim experi conduct experi optim gain constraint optim experi run base cube experi associ mine task experi product item locat transact mine associ rule minimum support threshold constraint minimum price item rule min price tabl constraint mine task algorithm optim apriori execut task ten valu min price easili conclud bigger min price candid prune perform algorithm figur show perform result analysi algorithm min price threshold small item price higher algorithm show perform algorithm size candid reduc prune comput save chapter system implement previou associ rule mine discuss problem topic algorithm system implement point lot issu interest topic design user friendli mine associ repres mine result visual base introduc user interfac visual associ rule mine interfac associ mine system analyt mine integr analyt process associ mine algorithm integr power usabl perform ffl mine associ rule user gener rule mine system design figur conveni guid user associ mine dimens involv mine task list left interest associ rule product part side upper part type rule lower part dimens hybrid associ mine associ rule click button ahead page perform hybrid associ shown exampl figur gui page associ rule mine mine associ rule gener associ rule product locat transact dimens pick locat dimens put product dimens upper list box check check mark mean dimens item dimens associ mine repetit result rule mine hybrid associ rule figur gui page associ rule mine gener hybrid associ rule product product dimens item dimens locat transact dimens dimens left side gui pick locat dimens put product quantiti dimens upper check product dimens ffl mine associ rule difficult find strong associ data primit abstract level due sparsiti data strong associ discov high concept level common knowledg user mine associ multipl level abstract system conveni associ mine multipl level shown figur top main toolbar user select desir dimens desir level dimens figur gui page hybrid associ rule mine mine associ rule perform associ mine locat product locat countri rule output shown figur higher level select region level current level locat rule shown figur figur mine countri level locat dimens figur mine region level locat dimens ffl associ mine analyt associ mine requir fast data mine request mine request requir mine perform limit scope confin queri adopt data mine algorithm constraint push technolog system optim system fast effici lack implement part constraint discuss chapter base care design data easi hook constraint system interfac provid gui page dimens number item requir valu limit dimens detail constraint rule bodi head give exampl constraint dimens associ mine quantiti cost interest rule relat locat dimens gui page shown figur put locat upper side mean locat shown rule limit size rule time rule equal item put string edit box side shown figur interest rule relat locat constraint page obtain click button current gui shown figur constrain rule bodi head figur interfac constraint dimens continu locat dimens head rule quantiti dimens shown bodi rule limit size rule bodi equal gui perform constraint specif shown figur figur associ rule visual visual tool user work interact environ understand rule implement kind visual tool view mine tabular ball graphic view bar graphic view tabular view associ strong rule repres tabular tabl tupl rule column rule bodi implic head rule support confid rule displai order figur interfac constraint dimens valu support confid user clearer view rule locat rule easili tabular view suitabl repres larg number rule vari easili understood figur kind visual tabular view good user view rule aspect view relationship rule item tabular view item repetit rule tabl long rule base system kind rule visual tool ball graphic displai bar graphic displai shown figur compon ball ball line connect ball arrow ball repres frequent line repres rule arrow line point head rule width arrow correspond support width arrow head correspond confid bar visual shown figur rule repres figur interfac constraint dimens bodi head bar conjunct head bodi item rule support height rule confid repres color bar graphic visual clear vivid view rule item limit graphic softwar implement method small size rule figur interfac constraint dimens bodi head valu figur tabular associ rule figur ball graphic associ rule figur bar graphic associ rule chapter futur work perform studi associ rule algorithm detail discuss result conclud summari studi futur research direct field summari research goal thesi solut problem gener associ rule larg data research report thesi develop interest call analyt mine associ integr recent develop olap analyt technolog effici associ mine algorithm cover interest studi issu includ discov categori associ measur rule optim mine constraint ffl architectur associ mine chapter architectur base flat relat tabl architectur integr data olap technolog associ mine algorithm data serv data store integr histor materi data meta olap technolog act interfac data mine task essenti part effici deal larg data set provid data cube enrich effici function plai data cube associ mine algorithm gener desir rule compli requir ffl mine associ rule cover chapter mine hybrid rule method adopt gener frequent frequent itemset found import apriori reduc size candid itemset detail algorithm provid categori discuss effici issu associ algorithm apriori properti present discuss perform analysi show case data set larg number algorithm apriori properti case data ffl design method base olap technolog perform associ mine abstract level concept hierarchi approach set minimum support threshold compar base recommend reduc support threshold method threshold progress lower mine touch deeper level abstract user gener suffici associ low level rule gener high level suffici interest ffl studi rule measur conduct end chapter simpl effici method base properti ffl chapter associ rule mine discuss analyz import constraint constraint prune candid itemset constraint prune candid deriv prune automat satisfi constraint perform show improv algorithm integr properti effici notic algorithm thesi reli manipul data cube activ research topic recent year advantag data cube structur list chapter data olap technolog facilit select dimens abstract level conveni effici make abil mine implement system show approach present great advantag exist algorithm term flexibl effici discuss futur work previou discuss analyt associ assum fulli materi cube built mine task real case cube store disk number dimens larg cube size big materi data mine method advantag materi speed mine process research includ build cube support candid itemset materi gener frequent itemset measur associ method base simpl properti recent method explor predict power gener associ rule work part integr method olap technolog result interfac feel implement algorithm power associ rule modul current interfac visual tool user understand rule respect interfac integr visual tool import futur issu concern associ mine discuss simpl categori constraint fall categori complex perform optim constraint big research issu futur extend work defin unifi templat associ mine gener languag design templat extract arbitrari associ type bibliographi sarawagi comput aggreg proc int conf larg data page sept swami mine associ rule set item larg proc int conf manag page quest data mine system proc int conf data mine knowledg discoveri page august agraw srikant fast algorithm mine associ rule proc int conf larg data page septemb agraw srikant mine sequenti pattern proc int conf data page march bayardo effici mine long pattern proc int conf manag page june gunopulo rule mine data set proc int conf data engin april silverstein market gener associ rule correl proc int conf manag page kohavi integr system data mine proc int conf knowledg discoveri data mine page newport august chaudhuri dayal overview data wareh olap technolog acm sigmod dw cy wong mainten discov associ rule larg increment updat techniqu proc int conf data page feb support comput juli uthurusami advanc knowledg discoveri data mine data mine optim associ visual proc int conf manag page june pirahesh data relat aggreg oper gener data mine knowledg kumar scalabl parallel data mine associ rule proc int conf manag page zhu system data mine relat data proc meet page novemb yin effici mine partial period pattern time seri proc int conf data engin april han fu dynam gener refin concept hierarchi knowledg discoveri proc workshop knowledg discoveri page juli han fu discoveri associ rule larg proc int conf larg data page sept ullman implement data cube effici proc int conf manag page june ibm ibm intellig miner user version chiang mine associ rule data cube proc int conf knowledg discoveri data mine page newport august kimbal data toolkit john wilei ai verkamo find interest rule larg set discov associ rule proc int conf inform knowledg page nov faloutso ratio paradigm quantifi data mine proc int conf larg data page august widom cluster associ rule proc int conf data engin page april ceri oper mine associ rule proc int conf larg data page sept microsoft olap programm refer version rj miller yang associ rule interv data proc acmsigmod int conf manag page pang exploratori mine prune optim constrain associ rule proc acmsigmod int conf manag page june silberschatz cyclic associ rule proc int conf data engin page feb js ms ps yu effect algorithm mine associ rule proc int conf manag page san js ms ps yu effici parallel mine associ rule proc int conf inform knowledg page nov silberschatz discoveri interest pattern associ rule proc int conf larg data page august navath effici algorithm mine associ rule larg proc int conf larg data page sept zaniolo integr induct learn deduct technolog proc workshop knowledg discoveri page juli ullman scalabl techniqu mine causal structur proc int conf larg data page august srikant agraw mine gener associ rule proc int conf larg data page sept srikant agraw mine quantit associ rule larg relat tabl proc int conf manag page june agraw mine associ rule item constraint proc int conf knowledg discoveri data mine page newport august toivonen sampl larg associ rule proc int conf larg data page sept naughton algorithm simultan aggreg proc int conf manag page
HCI/1428 4 head mount displai robert research center colin data visual research center coastal ocean abstract perceptu factor effect transpar head mount displai includ binocular visual depth focu report result experi design evalu effect factor user perform tabl task background dynam move background provid larg screen tv bookshelf provid complex static background tv background larg effect found attribut visual effect roughli addit smaller effect found bookshelf suggest monocular transpar hmd unsuit visual dynam environ background transpar displai prefer opaqu displai keyword wearabl mobil comput head mount head augment binocular visual introduct popular wearabl comput devic motiv devic user remain mobil simultan advantag comput power head mount displai develop enabl user high resolut displai carri bulki lcd displai restrict small screen pda hmd varieti configur displai monocular opaqu case earli model call privat ey displai monocular transpar binocular transpar opaqu hmd virtual realiti applic transpar displai prefer interact world displai applic hmd involv displai inform pertain real world task hand specif potenti applic aircraft inspect aid user inspect bridg inspect user produc bridg inspect report terrestri navig provid user visual navig aid order perform orient task game portabl video entertain plai video game watch movi augment realiti approach inform present displai relev real world imag commonli hmd simpli interest highli light weight displai devic afford hand free oper perceptu issu number perceptu factor pose difficulti transpar hmd section follow describ binocular ey receiv approxim imag environ transpar monocular configur hmd ey view imag ey view real world ey view virtual imag shown hmd optic real world creat transpar effect imag combin optic weight averag mirror binocular term phenomenon occur dissimilar imag present ey brain react unstabl state unstabl state altern period figur show illustr pattern binocular import characterist binocular durat domin suppress phase unrel durat £ prior phase durat ey domin ey unpredict rang introduc transient anim suppress ey gener return £ ey domin point domin fragment mixtur £ view imag result domin part imag result binocular consciou control object £ visibl disappear consciou awar time number includ recent panel tactic displai soldier identifi binocular potenti perceptu problem relat hmd orient spatial frequenc motion direct color figur pair pattern stimul binocular studi involv monocular hmd night vision system pilot apach helicopt type system imag environ displai ey ey view environ directli rush al report pilot experi troubl switch attent resort close potenti hazard visual visual term describ notion imag distinguish imag difficult observ separ visual studi transpar menu harrison show similar greater visual found transpar perform significantli degrad depth focu hmd construct virtual imag fix focal distanc typic meter real world imageri focal distanc expect virtual imag real world imageri focal distanc imag blur user attend hmd imag ey automat bring attend imag focu blur remov high spatial frequenc inform expect minim high spatial frequenc text figur text foreground object focal distanc background figur show text focal background object simul focal distanc fruit closer focal distanc text make text harder read text front tree easier read simpli direct gaze ey prolong ey result measur activ monocular hmd work process report minut word process task subject measur chang mon william al studi subject wear hmd short term found twenti disappear subject approxim minut report long headach effect research note rapid return normal displai remov observ instrument displai brain oblig maintain focu imag singl ey result ey imageri normal situat ey time chang object attent instrument effect occur focu chang short consequ monocular view instrument microscop situat similar monocular effect expect occur effect small transient ey movement peopl coordin movement ey head conduct visual search environ hmd redirect gaze head movement scan ey movement distanc target involv small angular ey move head angular distanc head move conjunct ey read materi ey persist axi strain present problem hmd fix respect head movement center displai visual field scan displai ey movement point factor problem menu icon close edg screen suggest angl center uncomfort maintain suggest horizont span hmd screen comput termin ey domin peopl domin imageri ey ey binocular situat domin ey imageri frequent longer ey hmd worn domin ey make real world imageri view ey harder perceiv problem report displai studi tactic fighter aircraft report thirti percent pilot report head displai pilot report troubl real world pilot report maintain aircraft orient head mount displai displac line sight normal problem coordin previou work preliminari studi investig factor subject perform tabl select task transpar monocular head mount vari background complex movi shown larg monitor sound uniform distanc background view distanc hmd imageri approxim focal depth background expect found imageri result time higher error rate fail find effect vari focal distanc studi suggest problem occur hmd rel contribut binocular visual isol effect separ effect compar hmd configur ey cover ey opaqu hmd occur user displai binocular occur user uncov ey imageri compar opaqu displai perform transpar displai perform isol effect visual ey view hmd opaqu flap head mount displai ey view real ey patch figur hmd configur user patch ey opaqu flap hmd method rest assumpt cover ey test ad condit subject perform task view monitor directli ey subject view monitor directli ey cover compar hmd perform view monitor directli method previou studi tabl task evalu perform wear hmd directli view monitor configur shown figur ey view comput monitor hmd ey view comput monitor directli hmd ey ey view opaqu hmd ey view opaqu ey view bookshelf real world background ey view opaqu ey view tv real world background ey view transpar hmd bookshelf ey patch ey view transpar hmd tv ey patch ey view transpar ey view real bookshelf background ey view transpar ey view real tv world background dynam tv background static bookshelf background ey view ey view opaqu hmd transpar hmd ¥ figur ¤ matrix summar hmd configur evalu view condit summar figur evalu combin number background redund condit shown figur bookshelf background configur opaqu tv background configur redund remov actual experi note control condit ey view comput monitor directli ey view comput directli shown figur hmd hmd modifi displai resolut displai convert displai remov left rearrang optic ey shown figur blend extern imageri displai imageri light extern imageri transmit produc virtual imag comput displai focal distanc approxim meter combin real world imageri optic unalt reduc lumin view hmd displai imageri extern imageri roughli compar bright order block left ey view condit subject opaqu ey patch order convert transpar hmd opaqu hmd ad flap close block real world imageri task task answer question price present top hmd screen answer obtain scan tabl illustr figur user provid result normal question randomli order item left randomli order question user requir conveni move cursor click cell correct tabl cell equal probabl correct answer font style total item applic chose random user made applic sound system beep subject priorit accuraci time background effect binocular visual evalu background background fulli popul bookshelf dynam background inch tv show movi sound content tv imag subject background view approxim meter effect hmd patch evalu control condit user perform applic task hmd view inch comput monitor ey directli comput procedur train session subject answer question condit replic subject complet block question block consist answer question condit describ section total question block present random order subject question present random order block independ variabl monocular binocular transpar type real world background depend variabl time click question number error equip applic written java run top red hat linux pc pentium iii mhz processor mbyte ram hmd section curv mirror screen beam figur real world imageri combin displai imageri shown subject total student faculti hampshir volunt particip test ey paid voluntarili withdraw penalti time particip open end feedback end experi result result summar figur show time averag subject hmd configur test control condit effect binocular due transpar summar tabl comparison assess effect binocular comparison assess effect visual tv background time attribut binocular time attribut visual data summar tabl analysi varianc reveal factor highli interact factor combin effect pattern static imageri bookshelf background case main effect interact condit subsequ analysi show highli effect variabl opaqu displai approxim time due binocular opaqu displai compar control condit monocular direct monitor found cover ey result time differ compar monocular opaqu hmd view monocular direct monitor view reveal perform degrad show hmd effect monitor displai optim view condit obtain effect error rate figur task subject requir answer question present top select tabl cell figur averag time versu hmd configur configur label number view ey hmd opac type background bookshelf opaqu transpar monocular binocular tabl summari binocular transpar effect tv background unit anecdot result user report transpar configur hmd make task difficult opaqu condit tv background subject show perform penalti averag user report tv background requir concentr order complet task particip initi complain read hmd pointer transpar hmd configur tv background user requir short interv visual adjust configur start task initi period adjust reflect result mean underestim magnitud problem opaqu transpar monocular binocular tabl summari binocular transpar effect bookshelf background imageri unit discuss result present consist hypothesi binocular visual neg effect task perform effect binocular larg anticip bookshelf background literatur lead suspect hmd view ey displai time doubl task perform time found time attribut bookshelf background opaqu condit explan base observ introduc transient ey return ey domin case pointer suppli transient ey view hmd account expect perform text transient letter question chang question transient hmd displai reduc effect binocular explan account tv background disrupt bad tv suppli frequent visual transient factor tightli control studi rel lumin environ hmd ey roughli equat lumin displai environ displai necessarili reduc lumin environ kind displai smaller reduct environ lumin bright rel displai import factor displai legibl bright environ displai dim dim environ bright factor factor investig strategi develop automat adjust displai lumin result restrict user kind displai suggest transpar monocular hmd unsuit crowd dynam environ mainten visual attent critic unsuit individu oper move vehicl bookshelf result suggest displai usabl background static small perform decrement accept futur work futur work area multipl direct evid effect control practic rush al report apach helicopt pilot switch attent head mount displai clear view ey studi understand unansw question long term perceptu effect user adapt perceptu effect user learn mitig effect binocular select attend imag individu user learn reduc effect visual prevent imag divid addit studi long term perceptu effect hmd research order evalu effect hmd motor skill coordin simpl task involv coordin affect expect transpar rel lumin hmd import factor futur work includ experi subject provid verbal test subject click answer cell slow task simpli inform screen react motiv experi observ interfac common wearabl comput interest result transpar hmd configur ey factor address futur studi lumin displai displai lumin rel real world influenc displai background legibl strategi automat adjust displai lumin import resolut displai displai size discuss make ey movement edg larg displai strain optim displai resolut amount visual field cover critic import transpar level find ideal transpar level strategi automat adjust transpar base environ advanc displai review introduct import design hmd configur usabl widest rang circumst acknowledg primari support project provid center coastal ocean map hampshir secondari support project provid research center receiv fund austrian program member data visual research laboratori hampshir feedback suggest prepar final manuscript refer david randolph blake group visual featur binocular vision page al tactic displai human factor panel human factor design tactic displai system individu soldier chair nation research council nation academi press chapter visual factor displai randolph blake absenc visual randolph david robert fox tempor perturb binocular percept inhibit psycholog jame collin loren blackwel effect ey domin retin distanc binocular perceptu motor limit american journal webster tour prototyp mobil augment realiti system explor urban environ intern symp wearabl page iswc hiroshi kim william buxton transpar layer user evalu displai design enhanc divid attent chi page acm harrison kim evalu transpar menu usag chi page acm april robert colin ware visual head mount displai chi extend page acm april lee randolph blake rival idea binocular vision page septemb coordin neurolog ey colin martin binocular aid visual inspect human phenomenolog descript retin american journal binocular vision virtual visual deficit wear displai physiolog transcript open forum session aircraft attitud awar workshop air forc flight dynam laboratori preliminari investig wearabl comput task guidanc aircraft inspect intern symposium wearabl page octob georgia institut ieee comput societi visual issu head mount monocular displai optic visual effect head mount displai distinguish comput displai vision eli perceptu issu displai optic design visual instrument quantif adapt virtual ey locat displai ieee virtual realiti annual page ieee comput societi stanlei ey prefer real imag taylor washington sr mk aj pictori commun virtual real environ cognit demand transient vision crowlei human factor safeti night vision system flight thermal imag system report armi research sethi vergenc adapt posit physiolog period strength pattern binocular perceptu motor picard augment realiti wearabl comput volum page jame garrett dan siewiorek wearabl comput bridg inspector intern symposium wearabl page octob south ieee comput societi io displai system bruce victor wayn david bernard gunther wearabl comput system augment realiti support terrestri navig intern symposium wearabl page octob carnegi mellon ieee comput societi coordin gaze normal subject acta page wolf domin suppress singl flash vision
Agents/1429 1 automat landmark select navig panoram vision simon alex zelinski srinivasan robot system laboratori depart system australian nation act australia abstract visual landmark robot navig field appar success navig visual landmark depend landmark chosen paper review monocular camera system automat select landmark navig task monocular system landmark select polici result limit area robot successfulli landmark navig system panoram vision system overcom restrict step develop system report introduct visual navig kei problem make success autonom robot vision sensor sourc inform mobil agent inform vital solv navig problem limit visual navig narrow field view offer normal monocular camera system greater field view camera inform environ extract visual process problem vision inform fact main task vision scienc work part inform job discard put panoram imag navig panoram imag solv problem mention convex mirror shape greater field view achiev panoram mirror give full horizont visual field vertic figur panoram imag field shown figur visual field cost resolut part pictur captur camera normal field view full horizont field view inform achiev navig task path plan path matsumoto panoram pictur navig robot corridor view sequenc approach robot sequenc panoram imag acquir imag current view drop set correl threshold imag work corridor environ chang suffici warrant view meter open room rate acquisit dramat panoram imag chang sharp small distanc natur landmark navig attract solut problem landmark navig task landmark navig requir part environ store contribut accur aid triangul techniqu landmark overcom acquisit rate problem requir entir visual field remain area set landmark landmark reli templat match store landmark landmark current imag normal correl techniqu match reliabl smaller landmark smaller pattern undergo chang due environ distort effect due movement robot matsumoto al view sequenc approach thought big landmark navig avoid problem small templat suffer high imag acquisit rate high storag cost success navig small landmark depend choic landmark describ monocular system landmark chosen basi reliabl landmark displai uniqu surround abil remain reliabl robot move environ end system monitor reliabl landmark seri small arc back behaviour inspir observ bee flight pattern collet paper review al monocular system applic panoram camera system visual navig landmark light field view landmark select strategi procedur adjust step develop panoram system present plan work detail monocular system al system monocular camera captur format video imag imag input fujitsu track card hardwar templat match region video imag main stage system landmark select phase phase landmark case refer small unprocess imag captur camera hardwar introduct panoram sensor system detail fujitsu track card found landmark select process landmark select aim navig abil mobil robot subsequ exposur environ mean landmark strongli distribut imag error navig withstand distort due tempor translat distort end al figur vallei method automat landmark select select number landmark section static environ base reliabl reliabl test dynam environ move robot seri short arc static reliabl landmark static reliabl landmark al determin uniqu landmark local region imag local uniqu defin landmark templat differ area imag immedi surround landmark approach base vallei method mori al mori gener attent token scene al adapt method present task automat select landmark shown figur candid landmark top left corner pixel correl templat pixel remov landmark templat top left corner compar minimum match distort result match landmark sixteen templat distort landmark correl local uniqu landmark found reliabl distort landmark match minimum match distort surround circl pixel result distort due higher distort minimum surround steeper vallei distort matrix subsequ uniqu local templat figur reliabl landmark subject dynam test phase note size landmark select plai role reliabl mention figur vallei distort matrix reliabl landmark figur al matsumoto effect entir imag landmark prove reliabl problem dynam environ part scene occlud number smaller distribut landmark solv problem size landmark comput reliabl size landmark imag locat dramat comput time requir automat landmark select al reason explain section chose landmark pixel store templat magnif factor landmark imag sector al divid visual field number sector equal number landmark chosen sector ensur good distribut landmark triangul chanc larg proport visibl landmark landmark track locat dynam scene move object environ result landmark sector occlud visual field equal distribut landmark sector possibl landmark visibl landmark group sector shown figur part interest case corner grei result landmark close select avoid al evalu landmark imag pixel size figur part reduc amount comput time search pixel pixel figur landmark group sector landmark group interest featur landmark evalu pixel dynam reliabl landmark good navig landmark reliabl chang environ remain strongli identifi small light shift perspect end al test reliabl static select landmark seri small arc turn back phase inspir observ wasp bee flight hive collet figur show path al robot phase robot move posit camera orient potenti landmark track path reliabl measur evalu approxim step landmark dynam reliabl averag reliabl measur entir path averag greater set threshold landmark discard question al local uniqu reliabl measur dynam phase landmark select intuit chose landmark minim match distort current origin landmark phase fact al system monitor reliabl distort measur strang choic discuss section essenti locat select landmark current imag posit landmark current origin navig vector point goal posit calcul note experi assum robot area landmark visibl monocular model brute forc global search visual figur phase dynam landmark select posit landmark determin area visual field close match store landmark strategi result success small area surround goal posit robot posit goal posit landmark size current view match deterior similarli posit robot closer view affect match size landmark move figur landmark model select figur al robot left goal posit perspect shift lead poor match result al address chang size problem conduct match landmark magnif store landmark mention select static landmark size pixel store templat magnif search landmark grown shrunk due motion scene al simpli conduct search landmark magnif rang chang landmark due simpl solv inspir approach issu home flight bee wasp lie straight line resolv magnif differ due perspect shift attempt specif address problem monocular system dynam check evidenc conic shape area robot correctli base path phase flight bee wasp al incorpor limit system admittedli field view offer monocular camera contribut limit observ insight choic local uniqu dynam measur discuss previou section landmark vari significantli perspect shift make retain strongli identifi natur simpl magnif differ alter basic structur landmark locat navig vector reach goal calcul landmark displac vector found simpli differ current posit landmark origin posit vector weight differ magnif current landmark compar origin landmark larg magnif weight small reflect vari distanc goal posit infer magnif vector fuse give navig vector reason simplic al weight averag weight base reliabl individu landmark fuse landmark mean individu landmark match error correct averag trust put landmark show high reliabl result navig vector convert sort motor command robot understand depend robot detail descript navig vector calcul found panoram step goal panoram vision system landmark navig area mobil robot successfulli set landmark abil learn navig environ panoram system develop base al monocular step report point system automat select static landmark panoram view cancel effect rotat camera imag panoram camera result imag full colour pixel panoram view landmark select assum landmark select phase time crucial factor robot exploratori phase static phase robot move time relax maintain high frame rate ensur basic optic flow obstacl avoid behaviour maintain stage static reliabl landmark landmark panoram system select monocular system local uniqu identifi potenti landmark select landmark subject test global uniqu global uniqu refer landmark uniqu entir imag al system check landmark global uniqu reli assumpt field view similar warrant comput time requir assumpt reason visual field normal begin break panoram field highli structur repetit offic environ loss resolut due panoram system time import constraint stage robot behaviour make make full search imag determin global uniqu landmark local global reliabl measur combin give static reliabl measur potenti landmark landmark imag sector al model imag divid sector landmark select equal number sector panoram model divid vertic sector offer prospect power triangul properti distribut landmark visual field chanc error due object move environ dynam reliabl landmark discuss al monocular system show phase crucial determin area correct occur field view phase import extend conic space bee inspir phase obviou simpli alter path incorpor direct figur part show arc extend circl simpli move seri line segment part figur phase landmark imag undergo due perspect shift absent monocular system dynam reliabl measur local uniqu longer reason distort measur assess dynam reliabl interest note point sector unaffect perspect shift local uniqu distort measur appli phase pick landmark smallest perspect landmark furthest camera altern measur directli test set landmark perform step path node shown figur part prove full investig landmark locat brute forc search phase landmark select experi limit resolv rotat trivial task import act test stage landmark robot orient respect environ robot select group landmark locat head direct repeat robot orient initi steer correct figur phase panoram system arc extend circl phase path direct current system simpli determin displac vector origin current landmark averag valu produc navig vector navig panoram system approach sophist monocular model brute forc search approach locat found landmark search space remain landmark geometr relationship vertic sector panoram imag set landmark singl import calcul navig vector vector landmark lie direct goal trustworthi landmark lie side reflect perspect shift landmark sector evid weight reliabl measur goal vector found order landmark lai goal line assum navig vector total vector calcul stronger weight goal line landmark panoram system result space surround goal extend equal side al monocular system navig visual landmark base concept reliabl landmark landmark static dynam reliabl system navig back posit landmark select area task successfulli restrict monocular camera system path phase panoram system develop overcom restrict field view extend phase system stage result suggest panoram approach suit task refer zelinski biolog inspir visual landmark learn navig mobil robot submit iro visual landmark learn navig mobil robot phd dipartimento di universita degli studi di collet ts collet flight learn journal american psycholog page zelinski visual interfac interact field servic page bee turn back journal compar matsumoto inou navig sequenc int conf field servic page mori inou attent point gener base classif correl distribut annual conf robot page thrun bayesian approach landmark discoveri activ percept mobil robot navig technic school comput scienc carnegi mellon omnidirect imag sensor navig ieee transact robot
ML/1430 6 increment learn control knowledg nonlinear problem solv daniel borrajo manuela veloso carnegi mellon school comput leav universidad de de departamento de spain carnegi mellon depart comput pa usa abstract paper advoc learn method deduct induct strategi combin effici learn control knowledg approach consist initi bound explan predetermin set problem solv featur proof set suffici captur correct complet explan control rule acquir appli incorrectli exampl method appli directli nonlinear problem search space complet present system implement learn context prodigi architectur learn control rule individu learn opportun offer nonlinear problem solver linear opportun qualiti opportunist make show empir result illustr learn perform introduct problem solv gener oper describ action task search solut problem chain oper control knowledg ad plan procedur guid search improv plan perform focu attent present author learn control autom acquisit process guid heurist approach learn control knowledg problem solv trace consist gener explan individu made search process explan control strategi futur situat prune search space work gener control rule problem solv static domain descript strong deduct approach invest substanti explan effort produc correct control strategi singl problem solv trace induct approach acquir correct learn knowledg observ larg set exampl present system learn control knowledg increment induct initi deduct gener bound explan problem solv episod experienc problem solv refin control knowledg increment acquir increasingli correct control knowledg paper organ section section overview complet architectur prodigi substrat problem solver section discuss learn gener bound explan problem solv search gener rule refin strategi driven encount neg exampl section present illustr execut learn algorithm problem logist transport domain section show empir result domain section compar approach previou relat work final section draw overview architectur learn effect control knowledg problem solv experi work develop nonlinear problem solver prodigi architectur section provid descript prodigi nonlinear planner present architectur compon substrat problem solver nonlinear problem solver prodigi analysi backward chain search procedur reason multipl goal multipl altern oper relev goal figur sketch problem solver algorithm input procedur set oper task knowledg problem term initi configur world set goal achiev plan reason shown figur involv goal select set pend goal subgoal oper achiev bind order instanti chosen oper combin oper bind appli oper precondit satisfi continu subgoal unachiev goal dynam goal select set pend goal enabl planner interleav exploit common subgoal address issu resourc content search control knowledg appli relev oper select goal subgoal address reduc subgoal appli select oper precondit object state bind type variabl oper stand heurist acquisit method learn search tree check goal statement true current reason suspend current search path return final plan backtrack comput set pend goal set applic oper goal select oper directli applic expand goal set relev instanti oper goal oper step oper select directli appli step fig skeleton prodigi nonlinear problem solv algorithm choic base learn control knowledg guid search convert intellig commit search strategi control knowledg guid search process prune exponenti search space previou work linear planner prodigi learn techniqu extract problem solv trace explan chain success failur compil search control rule similar effort linear planner prodigi learn control rule partial evalu domain theori paper present work learn individu control rule nonlinear problem solver prodigi identifi challeng problem extend directli previou algorithm develop linear planner nonlinear nonlinear plan face learn includ issu plan opportunist make work appli directli nonlinear problem solv trivial encompass linear problem solv nonlinear problem solv learn control rule individu compil condit rule transfer individu step problem altern learn approach nonlinear plan includ learn complet gener plan develop learn method case form global strateg knowledg discuss relat work section compon main induc refin modul learn control rule search tree rule refin induct modul solv problem make gener posit exampl refin modul attack find situat learn rule wrongli gradual learn refin converg set correct control rule figur show modul connect prodigi figur present procedur st st search set control set control rule learn bound explan set learn induc explain detail compon section bound explan modul prodigi problem domain refin modul induct modul st st st st fig high level architectur refer set learn control rule st refer search tree problem solv initi empti train problem st result solv rule st result solv current set rule fig high level descript learn algorithm bound explan initi learn control rule directli explain problem solv search tree algorithm reli main label credit assign search actual gener control gener control rule label search tree credit assign solv problem solver gener search tree domain theori implicitli defin subgoal structur link goal oper achiev goal linear search tree reproduc interleav goal subgoal search space nonlinear problem varieti interleav wai subgoal structur captur search tree lead larg search space tractabl gener correct explan made uniqu problem solv experi label algorithm search tree label leaf node assign kind label leaf solut fail planner expand node label leaf back valu root search tree figur summar label strategi credit assign time consist identifi learn occur choic access inform problem state plan explicitli maintain search tree structur exampl knowledg learn includ goal goal planner work gener altern fail inform gener modul creat control rule paramet control situat control rule gener learn select node success child conserv learn mode rule learn children label success failur child label failur mode correspond level learn eager paramet learn solut incorpor qualiti criteria delai learn complet tree find select select altern reject select control rule shortest solut number node extend result procedur label successor node label case case label node success label node failur label node unknown unknown success children store successor learn successor label node success label node unknown success store successor learn successor label node success failur label node failur success label node success fig skeleton label credit assign algorithm solut descend solut learn select level eager algorithm build earli previou work learn problem includ extend pioneer method discuss section gener control rule proce gener control rule acquir postcondit precondit control rule establish relev condit made defin situat rule set featur bound explan techniqu evolv previou work author set featur suffici number iter design gener confid empir experi confirm set induct refin phase applic effici learn kind control select goal set pend select oper achiev select bind chosen decid appli oper precondit met current state continu subgoal select goal set unachiev goal rule correspond gener target concept target concept made attach precondit requir make oper target concept select oper achiev goal number target concept domain total number oper schema number predic number postcondit oper gener set rule target conjunct set precondit view disjunct conjunct learn rule target concept learn dnf descript target concept kind control rule templat describ precondit templat share set common featur kind control local featur exampl common control test true current state search solut test goal pend goal current node search tree test goal conceptu path node planner exampl featur test planner achiev test applic current state precondit control rule creat inform state state link node search tree postcondit lect oper goal section number sum number target concept kind learn control rule select oper kind control rule goal achiev oper number target concept kind variabl repres bracket learn control rule rule condit variabl bound induct rule check neg exampl target concept set neg exampl target concept empti section explain refin modul includ identifi neg exampl section show illustr learn process figur show learn control rule domain learn prodigi solv sussman anomali control rule problem solver select goal hold goal top block goal hold creat subgoal goal top control rule prodigi solv similar nonlinear problem effici rule learn select goal fig rule learn select goal hold goal interf block configur induct gener rule gener bound explan method analyz rule aspect explain rule lower transfer problem follow deduct phase gener algorithm induct modifi rule base reduc set precondit rule transfer potenti wai induc aspect learn practic cover featur precondit rule irrelev featur state note order appli control requir rule total match make precondit satisfi subgoal relax subgoal captur goal gener subgoal goal section interact identifi correct subset set pend goal affect extend learn scope qualiti type gener level variabl control rule belong ontolog type hierarchi nonlinear version prodigi oper learn oper hierarchi enlarg scope gener procedur induct compon consid induct oper rel preserv main remov precondit found affect valid control rule main precondit variabl directli relat learn delet rule subsum rule subsum rule target concept substitut make precondit superset intersect target creat rule precondit intersect precondit intersect refin subgoal share prior goal merg rule test presenc prior goal rule refin goal similar previou refer meta predic relax subgoal evid prior goal delet find common rule unifi variabl belong subclass common class root oper gener variabl common class implement variat techniqu appli procedur singl rule find intersect rule oper find correct intersect cover previou neg rule previou delet backtrack learn altern intersect rule consid plain backtrack accumul inform altern found neg gener induct phase significantli improv transfer potenti rule gener applic condit induct oper trigger posit account neg exampl found describ section refin previou learn produc rule special situat induct rule benefici induct learn strategi provid neg exampl applic main issu detect neg refin learn knowledg rule neg situat control rule result led failur expect solut identifi neg neg process current rule target concept figur shortli describ procedur refin refin modul relax effect induct oper ad test remov induct step goal find larger set liter cover posit neg exampl check type control rule type refin deduc rule gener modul induc gener induc rule refin gener refin exist cover neg exampl procedur precondit mind main add precondit test cover neg exampl return precondit procedur search bind variabl rule gener bind substitut precondit rule cover neg exampl kei thing induct method captur featur learn descript concept respect current version rid irrelev featur learn posit exampl target concept featur find neg exampl target concept featur present eager induct refin modul remov featur speed converg introduc inform elabor wai remov ad featur descript target inform gain similarli procedur procedur precondit procedur precondit fig high level descript algorithm refin control rule method test analysi complet set explor extend increment learn procedur hill climb perform global learn algorithm approach ultim correct control knowledg converg gradual closer rule set learn algorithm reason converg point gener space prohibit costli maintain specif gener set version space method illustr show learn method appli logist domain illustr phase gener control rule induct refin packag move citi packag carri citi truck citi domain introduc airplan post offic airport transport domain repres scale length size search difficult learn larg number plan altern problem solv situat illustr figur airport citi problem interest object airplan move citi object load airplan airplan move optim solut problem sequenc post post post post goal statement initi state fig illustr initi state goal statement notic optim plan correspond uniqu gener learn procedur reason depend network plan step label assign credit made search tree gener prodigi rule figur learn prodigi find delai move carrier object load rule planner plan achiev move includ effect control problem solver work arriv carrier trip select goal fig rule learn appli show learn opportun order deal problem effect qualiti learn possibl encount linear problem solver handl multipl goal independ compil local choic learn method appli nonlinear plan precondit initi bound explan problem solv rule record posit truck object present post turn irrelev featur instanti target concept oper preserv main precondit remov precondit mark simplic instanc problem variabl rule note rule refer gener variabl extens empir test ran problem greater complex section show result test star descript note irrelev featur locat directli relat goal reject oper relax subgoal depend remov precondit mark doubl star encount problem goal addit truck addit airplan figur show rule learn appli oper select goal fig rule learn problem gener rule figur induct method combin rule oper intersect refer merg goal gener consist intersect gener initi rule figur show result rule select goal fig rule induc rule figur induc rule fulli correct correct coupl train situat irrelev featur remov posit import featur captur neg exampl proce search space converg set correct rule induc gener experienc posit exampl refin learn control neg exampl found empir result perform extens empir experi domain report result logist transport domain domain experi nonlinear learn similar sussman anomali result illustr main claim effect combin deduct induct method nonlinear version prodigi search heurist substrat problem solver underli make difficult learn mechan outperform larg perform set problem randomli gener learn control rule learn control rule rule appli test set randomli gener problem vari time bound prodigi solv problem obtain similar result time bound figur show result obtain time bound unsolv problem account run time term equal run time bound logist perform train phase problem problem result learn control rule test test set complex term initi state number goal vari time obtain similar result shown figur time bound number unsolv problem run time node explor domain problem test set rule rule rule rule rule rule logist fig tabl reflect perform logist transport domain increment induct perform depend order exampl main tabl number unsolv problem drop logist correspond solvabl horizon problem solver rule matcher control rule optimum retriev organ algorithm time spent match rule repres usual util problem result shown tabl relev learn set rule outperform problem solver rudimentari matcher relat work dimens compar work previou includ correct control essenc substrat problem solv algorithm respect control guidanc prune problem solv search space introduc addit precondit oper domain simpl plan control knowledg explicitli distinct set oper describ domain knowledg introduc knowledg problem solv select address oper bind select oper backtrack case failur clear declar domain procedur control knowledg simplifi initi specif domain autom learn control knowledg learn control knowledg local global local control knowledg problem global knowledg guid problem solver strategi develop learn method prodigi consist store individu complet problem solv guid planner solv similar problem guid similar plan provid global control knowledg consist chain exampl learn global knowledg granular system learn complet gener plan learn local control rule appli independ individu step greater potenti transfer studi integr kind strateg complementari benefit problem solver previou work learn control knowledg simpl problem solver linear planner goal kind problem solver underli complex interleav goal level search learn method lack learn opportun learn opportun present linear problem consist opportunist oper choic driven plan goal nonlinear planner introduc factor learn task due find languag describ thing kind complex studi immedi clear directli compar result system learn local control appli nonlinear problem solv differ found posit neg instanc present system system learn algorithm work exampl time learn increment control knowledg rule produc learn method produc expert learn method produc control rule faster acquisit control knowledg harder acquisit domain knowledg result present learn rule expert refin make accur issu clariti rule major point rule easi read requir effort debug refin approach present address speedup learn strategi effici acquir control knowledg improv perform nonlinear problem solver solut combin bound deduct explan method induct techniqu tradeoff accuraci learn control learn effort requir address bound learn step fix set test manual adapt experi author experienc problem solv refin control knowledg increment acquir increasingli correct control knowledg combin problem solv search refin gener control rule exampl show empir result demonstr improv learn strategi prodigi nonlinear problem acknowledg greatli juan pedro previou step insight comment jaim anonym review work sponsor author grant de ciencia project de madrid research sponsor wright aeronaut system air forc materiel advanc research project agenc grant number view document author interpret necessarili repres offici polici express wright laboratori govern govern author reproduc distribut reprint govern notwithstand copyright notat thereon manuscript submit public understand govern author reproduc distribut reprint refer jim blyth manuela veloso analysi search techniqu nonlinear planner intern confer ai plan colleg june daniel juan jose lui learn heurist plan sixth intern confer system informat daniel juan juan knowledg compil model learn heurist workshop knowledg compil intern confer machin daniel borrajo manuela veloso bound explan induct refin acquir control knowledg intern workshop knowledg compil speedup page june jaim prodigi research group manual tutori technic report school comput carnegi mellon june jaim craig steven minton integr architectur plan learn architectur intellig technic report robert doorenbo manuela veloso knowledg organ util problem intern workshop knowledg compil speedup page june oren etzioni structur theori learn phd school comput carnegi mellon technic report oren etzioni steven minton ebl produc critiqu prodigi approach ninth intern confer machin page richard fike nil nilsson approach applic theorem prove problem solv artifici iba heurist approach discoveri machin kambhampati kedar explan base gener partial order plan page richard korf weak method learn artifici pat langlei learn effect search heurist page zukerman learn search control rule induct approach machin learn steven minton learn effect search control approach phd comput scienc carnegi mellon technic report tom paul learn acquir refin heurist machin artifici intellig page tioga palo perez jaim carbonel autom acquisit control knowledg improv qualiti plan technic report school comput carnegi mellon april perez oren etzioni role train problem ebl sleeman ninth intern confer machin learn morgan san ross quinlan learn logic definit relat machin gerald sussman comput model skill acquisit american technic report artifici intellig manuela veloso nonlinear problem solv intellig technic report school comput carnegi mellon manuela veloso learn analog reason gener problem solv phd school comput carnegi mellon august technic report manuela veloso jaim carbonel deriv analog autom case util machin hua yang dougla fisher retriev partial technic report depart comput zell moonei combin foil logic program articl process macro packag llnc style
DB/1431 3 model gener semant analysi universitat de fachbereich informatik abstract semant analysi refer analysi semant infer basi semant inform world knowledg present potenti applic model gener model gener theorem prover construct analysi semant process model gener comput model valuabl sourc inform discuss bry tableaux calculu ep approach model gener semant analysi introduct goal modern semant captur condit sentenc utter semant formal theori grammar construct sentenc logic formula model construct semant reconstruct part restrict ambigu introduc prior analysi process account pragmat background knowledg specif situat semant analysi refer analysi semant infer basi semant inform world knowledg model gener area autom deduct investig automat construct model logic theori logic theori built combin semant logic encod world knowledg model theori repres mean repres rel world knowledg present applic model gener model gener theorem prover construct analysi semant process model gener comput model investig potenti sourc inform research area interest deduct problem semant analysi model gener method infer task process model gener classic logic found applic instanc finit mathemat deduct diagnosi task exist famili model gener program calculi base tableaux advantag properti regard intend applic area tableaux compact implement adapt logic modal logic extend posit tableaux calculu bry uniqu properti complet complet finit satisfi mean theori ep prove produc close tableaux input theori satisfi finit ep theori finit minim model twofold complet process overwhelm major lead theori unsatisfi finit satisfi ep calculu viabl approach model gener process start preliminari section recapitul import notion logic section present potenti applic model gener model gener theorem prover semant analysi section discuss ep approach model gener semant analysi preliminari assum reader familiar predic logic tableaux calculi present instanc fit present basic terminolog section classic logic interpret theori pair ii domain individu evalu function map predic function symbol predic function ariti domain evalu formula govern logic connect quantifi usual definit semant model set close formula interpret nonempti domain valid evalu function evalu formula true domain herbrand term interpret evalu predic symbol vari herbrand model repres set ground liter valid set formula herbrand model domain herbrand model term occur set liter satisfi set fc arbitrari constant herbrand model finit iff domain finit herbrand model uniqu set posit ground liter satisfi model theori call minim iff model model call domain minim iff model satisfi smaller domain individu semant analysi model gener present select deduct problem semant analysi illustr model gener solv problem detect inconsist redund import constraint human commun obei maxim applic deduct method detect inconsist redund marri husband marri husband anomali depend context world knowledg situat inform marri entail husband order notic inconsist redund infer prove sentenc husband entail sentenc marri resolut anaphor inform linguist modul access common reason easili lead inconsist redund instanc husband sister marri parser resolut pronoun husband sister marri husband sister marri read valid read lead marri inform implicitli earlier detect anomali read small autom theorem prover grammar formal gener logic semant background knowledg made theorem prover set assumpt select amount background inform suffici detect lead intract proof problem open problem semant analysi exist research prototyp system implement interact semant common reason theorem prove problem convent theorem prover semant analysi theorem prover find contradict halt satisfi theori semant major consist inform lead satisfi specif block theorem prover equal combin quickli lead theori satisfi infinit model theori undecid model gener complement refut theorem theorem prover prove model gener system parallel search model model theorem prove process stop vice versa likelihood infinit proof search abort neg result reason time span common case semant satisfi finit effici method complet finit satisfi consid cover proof problem occur process advantag model gener theorem prover context search refut proof build calculu provid calculu implement effici task simultan search model refut separ system anaphora resolut model gener complementari method theorem prover semant model gener emploi directli method anaphora resolut simpl bill sleep classic pronoun repres existenti variabl gender inform model instanti implicitli includ pronoun resolut set linguist valid resolut coincid domain minim model semant except mathemat instanc infinit prime suitabl instanti constant produc model appli constant domain repres linguist valid resolut pronoun kamp theori dynam variant place bound variabl account dynam phenomena natur languag access refer govern subterm relat access relat induc dynam connect unlik bound variabl classic refer model dynam behaviour model gener advantag access relat order restrict set individu resolut individu resolut part situat case presid constitu presid mention individu order model logic accommod individu properti presid accommod individu presupposit model gener process logic valid interpret interpret domain individu properti true individu suitabl instanti anaphora prefer set mention current domain model gener individu instanti individu introduc current section individu option extend current implement tableau rule domain extend infer method applic model gener extend syntact infer method emploi semant construct interfac common reason instanc ambigu omiss verb love mari sentenc mari mean depend sentenc infer context ambigu mari love sentenc consist interpret variat marri mari world knowledg women marri man interpret mari marri inconsist al show unif permit treatment successfulli captur ambigu stem resolut ellipt sentenc hou approach treat anaphora variabl valu comput solv equat construct linguist theori linguist theori semant variabl equat appli linguist valid solut origin lead resolv hou syntact tool make world knowledg linguist theori aim construct logic subject model gener process obviou extens hou model gener reject solut lead inconsist redund semant slightli eleg method extend model gener unif input model gener semant possibl world knowledg set constraint describ valu free variabl equat process gener model includ necess instanti higherord variabl gener consist inform logic theori hybrid calculu hou model gener easi implement tableaux set hou model gener defin tableaux infer system debug semant interest model gener method debug theorem prove analysi model reveal fact user find counterintuit underli theori set minim locat fix error logic specif grammar system prone error translat system intern format structur predic logic bug yield faulti output input correct locat bug semant analog locat error mathemat semant easi semant repres input intend model detect flaw origin grammar theorem prover applic model gener method comput model faulti specif model gener semant tableaux infer system properti make attract practic theoret research comput linguist tableaux implement system consist line prolog code adapt logic logic modal logic commonli semant simpl basi autom theorem prove partial deriv tableau read partial interpret case infinit model tableau branch inform readabl instanc debug problem extend posit tableaux calculu complet theorem prove calculu base basi model gener theorem prover special ffi avoid ep model gener calculu complet finit minim model fig displai ep infer rule ep accept posit restrict quantif rule function symbol input theori translat normal form fig tupl constant occur expand node constant determin evalu conjunct posit construct herbrand model determin set ground posit liter occur current branch handl implic extend current branch complet match implic left side construct interpret ffi instanti existenti quantifi formula constant fc occur current branch form current herbrand domain extend tableau branch instanti constant constant ensur ep construct model minim domain ffi fig ep calculu advantag ep semant analysi applic semant ep obviou advantag import properti gener model larg import class finit satisfi common focu linguist deal finit particip properti finit set calculi theorem prove herbrand model gener lead theori finit herbrand model calculi halt input finit requir care background knowledg order prevent unnecessari infinit proof search model gener calculi decid special class theori infinit model cover class finit satisfi theori tableaux ep comput partial interpret import debug tool semant tableaux approach advantag comput store possibl ep increment system analysi natur languag instanc peter watch father smile give finit open satur repres resolut pronoun extens peter father tableaux system simpli extend open branch inform continu tableau extens close elimin read pronoun resolv peter father altern comput tableaux kuhn add inform open redund read repres current branch reject mean redund detect construct separ proof problem ffi origin develop domain form reason model domain import infer resolut anaphora particip resolv anaphora prefer set mention particip case pronoun refer sought repres newli introduc constant ffi indefinit articl requir particip resolut peter karl enter bar man laugh clear man refer peter karl behaviour indefinit articl implement logic special quantifi instanti quantifi variabl mention constant extens ep form dynam quantif straightforward disadvantag ep semant analysi tableaux calculi requir normal form comput gener input theori classic analyt tableaux present fit negat normal form easi obtain ep rule requir substanti transform input theori flexibl tableaux term extend logic suffer greatli requir tableaux system modal logic base classic analyt tableaux infer rule basic redesign scratch calculu normal form defin logic algorithm comput normal form ep logic requir great effort develop suitabl routin combin ep form reason hou increment routin hou gener formula instanti variabl altern rule classic analyt tableaux requir tableaux system variant ep quantifi formula instanti ground term occur current branch instanti gener effici enabl incorpor form tableaux reason normal form penalti blind instanti circumv partial introduc sort mechan restrict quantif split domain smaller set instanti quantifi variabl subset domain costli instanti full domain gener formula open question classic tableaux system ffi effici semant analysi complet finit satisfi finit minim model complet proven proof tableaux calculu interpret construct ep consist ground posit liter mean model semant negat complet model utter care design semant posit part model repres mean instanc logic tom date minim model empti model circumv effect introduc auxiliari predic repres negat instanc neg eleg main problem ep simpli gener model repres mean posit part subset theori model model gener program develop finit mathemat base proof procedur comput complet herbrand base proposit model model gener finder finit model size size domain advanc unlik search simultan refut increment model gener possibl grow domain ffi avoid sourc ineffici ep refut proof procedur refut proof ep mean systemat refut herbrand interpret construct rule calculu convent tableaux proof procedur encod individu instanti existenti quantifi variabl singl ep explor possibl current domain combinatori ffi restrict ep small domain individu constant penalti finit minim model complet ep deal gener inconsist theori requir refut larg set branch sort mechan enhanc effect ep sort reduc number instanti individu ffi applic model gener model gener theorem prover semant analysi model gener prove consist inform anaphora extend syntact reason interfac common debug semant discuss bry ep calculu approach gener model gener calculu process semant analysi larg area previou attempt systemat solv problem area method develop model gener present meant sketch problem solut model gener calculi exce ep gener finit class infinit model current complet theorem prove calculu ep provabl cover class finit satisfi specif semant class arguabl import extend ep logic logic requir substanti effort classic analyt effort ep rule avoid blind instanti variabl advantag deal larg background theori complet finit satisfi ep reduc effici theorem prove calculu ep sort mechan order effici infer method process emploi combin theorem prover model gener system simultan search refut proof model hybrid system attract properti ep usabl dynam model gener refut system increment process natur languag system interfac extern deduct evalu practic advantag disadvantag model gener semant analysi futur acknowledg result report ow clarifi discuss tim clair david wolfram norbert gratefulli acknowledg deutsch forschungsgemeinschaft australian nation anonym critic refer nejdl tableaux diagnosi applic proc tableaux number springer page niemela hyper tableaux logic european jelia number springer lean deduct journal autom orient infer satisfi check integr constraint proc intern workshop deduct logic gmd report june bry deduct method complet refut finit satisfi proc european workshop logic ai springer pereira ellipsi unif linguist davi putnam comput procedur quantif theori journal juli autom model build journal logic fit logic autom theorem prove springer fit tableau modal logic studia stolzenburg proof debug technic report universitat institut fur schutz compil function variant journal autom godel formal der mathematica und system der english version model gener theorem prover applic intern confer logic page mit press hintikka model minim altern circumscript journal autom kamp logic counter exampl semant tableaux number phd thesi concurr autom theorem prover base tableaux proc intern confer theorem prove number springer person commun tableau prover domain minim journal autom proper treatment quantif ordinari english formal philosophi select paper yale techniqu pour la construct de ou en deduct automatiqu phd institut nation polytechniqu de finder domain note guid technic report australian nation autom reason stickel autom reason exhaust exist problem comput mathemat van editor godel sourc book mathemat sourc book histori scienc harvard
IR/1432 5 search navig tool program document richard mark leven depart comput scienc london london uk abstract present search navig tool automat gener program build trail inform space user interfac show web page explain structur code introduct document process import part softwar develop extens document program essenti enhanc meet compani organ tool capabl produc hypertext typic html format suitabl place project web site compani intranet document typic gener special markup code exampl system tool ship version java develop kit explor googl index reveal exampl document set creat html page archiv restrict true number higher similar system exist object orient languag cs java gain benefit map class web page tool creat document provid search facil autom navig support user search navig call address problem sun java develop kit search navig challeng visitor web site lost lose context unsur proce term satisfi origin goal unresolv problem web site assist user find term navig problem order tackl develop navig system build inform trail navig user queri basic architectur system user present result structur user interact discuss trail present tree structur gener link structur hierarchi directori structur problem attempt address interfac similar problem exist program document program onlin support opportun enhanc product user longer find requir inform system document highli interlink link creat due packag class inherit type refer great benefit inform harvest link exist case relationship class suggest greater number potenti trail exist filter densiti link inform challeng achiev combin trail algorithm set heurist custom document interest question link base usag object code treat base human creat distribut preferenti link found web affect perform metric assum link denot qualiti kleinberg hub author brin page solut tool base technolog websit navig inform retriev subsystem remain major compon user interfac index corpu trail find algorithm probabilist search tree select candid trail result return xml format adapt xslt stylesheet format requir user interfac advantag restrict flat user interfac flat user interfac similar tradit search engin trail sequenti user follow link interfac choic introduc user familiar search engin idea return trail difficult context node structur site adequ support navig session improv user interfac user interfac glanc ident present main element navig tool bar sequenc url navig tree window rest trail improv provid faster queri filter result remov duplic entri redund inform figur user interfac show result queri result show class jdbc softwar connect sql examin link page connect class clickabl user interfac develop prototyp program displai result form trail colour trail set output simpli pipe clickabl imag map gener product quicker book manual navig document ideal experienc user answer provid smooth introduct languag novic programm expand develop knowledg provid contextu inform relev class implement interfac extern give pedagog teach tool futur work java extend coverag cs languag intend develop user interfac product window inform similar includ document summari metadata intend person programm work field queri result tailor refer emden stephen vo niqu draw direct graph ieee tran softwar engin page sun microsystem tool home leven loizou web interact navig problem hypertext jg cm encyclopedia microcomput marcel leven web site navig engin poster nation world vide web hong nielsen design web practic simplic rider martin brad onlin design onlin support system technic page
IR/1433 5 select world wide web £ server select world wide nick craswel peter bailei david hawk depart comput scienc csiro mathemat inform scienc australian nation canberra australia canberra australia abstract evalu server select method web model digit librari make exist web search server build index evalu framework portrai web realist wai search server index real web cover topic area emploi retriev method select base statist extract result probe queri submit server evalu publish select method method enhanc select base expect search server effect result show cori effect publish select method cori select steadili degrad fewer probe drop earli relev document modifi cori select base estim expect effect yield improv effect modifi cori base effect yield small improv result effect select ten server outperform select server index cover document acknowledg coverag limit real web index model index half quarter document result sharp drop effect distribut inform server world wide effect evalu £ author acknowledg work carri cooper research centr advanc comput system establish australian cooper research centr program permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee digit san tx copyright acm introduct materi physic librari process bring inform polici librarian materi meet expect inform qualiti quantiti includ desir digit librari web document mislead inform step goal chang issu maintain inform qualiti web page includ simpl qualiti control method includ web site similar polici build collect digit librarian link includ site digit librari depend document likelihood document case continu provid document includ chosen target site digit librari simpl provid link home page search interfac tighter integr permiss document mirror target assign target document schema cross referenc page page target site paper consid digit librari incorpor distribut inform retriev broker broker capabl queri present result number chosen web search server broker address web search server case link web base continu qualiti document question larg number web search server search server list list search server broad rang subject area list health medic area claim list search server cover document index build index document imposs claim list fraction true number web search server manual select effort cover web search perform automat select server examin paper unreason broker concurr queri multipl server merg result exist web exampl includ inquiru metacrawl savvysearch paper concentr problem server select assum retriev merg carri method implement inquiru paper goal evalu cori select method base probe queri queri environ heterogen web search server test hypothesi server effect import introduc method estim differ server effect modifi select base inform goal compar effect distribut retriev environ background section background distribut inform retriev server select web distribut inform retriev distribut inform retriev system document search server broker document web simpli provid document search server index search set document server respond queri result list ri document set di rank order oi order search server larg gener small paper concentr smaller list index document collect broker facilit search multipl search server set search server user queri process distribut inform retriev select retriev merg rm illustr figur step select select subset server achiev low search cost term network commun comput high search effect effect mean qualiti merg result list rm retriev retriev search result list commun queri translat method result appli server merg gener rm dm om effect rank effect rank document user find relev list user find irrelev select merg method simpl simpl select method select server simpl merg method present concaten result list concern paper singl highli effect merg method evalu number select method design retriev effect distribut web search section compar promin wai provid search facil web document involv build search server cover document interest distribut involv broker address exist search server real web search system base combin base properti search server document server question drawback central index run measur term network traffic cost requir comput power storag network traffic includ cost download document time index updat respond queri network total cost number document central frequenc index updat queri load dedic search engin compani troubl index index web index week month date problem central index miss document common reason central index requir download ultim index document web front end document link mean method locat document local server claim list search server index document central index distribut retriev disadvantag receiv queri provid search server perform disk io comput broker figur distribut inform retriev broker select subset server retriev result server creat singl merg result list present user perform retriev finish result list arriv network merg previou studi found distribut retriev server select effect retriev result paper show central index index document document server approach depend system goal resourc avail fast effect result provid cost maintain search larg index miss document afford coverag document achiev distribut cost queri process speed possibl effect select motiv assum distribut approach reason perform server select select improv search effici obtain result list ri involv limit network bandwidth monetari charg network comput broker search server select queri fewer server reduc total cost distribut search select improv effect queri server result ri relev document wast comput network resourc irrelev document rm demot relev document reduc effect effect import situat larg topic small proport server relev document case studi server select method past studi select base select effect search cost search cost includ search network traffic charg monetari charg fuhr develop theoret model select base cost benefit compon perform select base past search server queri process speed paper concentr simpl view search cost assum server search cost user bear cost select ten server queri number reflect number server queri exist web search broker method broker build server rank base current assum broker select top rank server cori method rank search server document consist concaten server si due rm ment belief ing term determin dt dt log log log db db log df max document frequenc term tk server si df frequent term si total number sf number server term number uniqu queri term studi default term default belief set server rank descend order belief server rank base modif inqueri document rank df tf number time term occur sf df server rank method base valid varianc queri term term discrimin server higher contribut suitabl score df ss cv si server si cv popul cv server server rank order score si server rank method max sum rank server server document frequenc statist vector sum document vector server si term sum weight wt wt vector weight term tk document vector repres document server si max sum estim sum score document score current queri vector space retriev model rank evalu ideal actual sum document score document score produc max score si achiev server si si formul evalu experi evalu framework server rank method base user input exclud studi web search broker savvysearch perform server select queri term futur select score boost user visit page return reduc server return result web search broker probe queri server test queri select server figur probe queri test queri queri broker send probe queri search server download top result broker extract statist document server result estim server effect appli server select method select top ten server perform select base user visit result page queri server select method reli past relev judgment top merg result train queri visit event relev judgment test collect train queri method evalu server select method base server evalu method reli manual classif impract due lack classif document due time constraint method base automat classif evalu probe queri tive web search server export inform document term occurr select inform extract lowest common abil search server return search result connel du suggest queri base sampl send seri probe queri server figur queri download document return extract term occurr statist document sampl studi found extract statist repres full server statist approach appeal appli search server return document broker address server time simpli send probe queri hawk thistlewait select method base probe call probe probe perform queri design obtain term frequenc statist cooper server sampl document server studi document sampl approach connel du step statist extract sampl document indic full document set statist give indic abil return relev document set server index run highli effect retriev system perform boolean unrank retriev base statist server select practic environ web retriev system retriev effect vari estim server effect import initi method estim server retriev effect paper requir studi point rank ten ten server includ merg list estim effect probe queri select model fuhr base expect point result rank method empir step estim server effect estim select broker send probe queri server suggest connel du queri singl term queri probe queri broker build highli effect merg list document server base download document content merg method suggest queri make merg problem interest assumpt top document merg list high absenc real human relev broker mark top document merg list techniqu similar automat relev feedback top rank document queri broker calcul server tend return document ei expect number relev document return server ten probe queri simul server sn document ten merg top give expect number ei queri conjunct frequenc collect size figur server size evalu rang server size content base server rank method cori unmodifi server rank modifi modifi cori belief ad time base rank modifi belief valu constant calcul ideal expect effect base real relev judgment test tune constant select effect constant combin evalu evalu framework experi evalu effect broker address larg number web search server select method real web server properti index search web document server retriev cover wide dispar number document concentr document specif topic area server index offer web document singl document provid section describ element model test collect test collect offici small web track document trec queri offici nist relev judgment gigabyt web document collect document partit document server boundari simul search server search server number good properti cover offer web document singl document search server server wide rang hand document thousand figur size vari small real web search broker face higher proport larg server limit test collect consid number topic index random index document server spread relev document figur topic skew document spread randomli evalu high topic skew relev document topic tend concentr server sort skew occur web result partit document server boundari server realist topic relev document topic tend concentr server spread server figur retriev server simul retriev algorithm highli cornel variant okapi probabilist rank function rank server base sum queri term simul web search server document bonu term occurr sophist model statist retriev method simpli assum boolean conjunct queri list match document arbitrari order rank function modifi slightli retriev usual presenc term occur half document reduc relev weight occurr statist small server size high topic neg valu due high document frequenc proport term effect retriev algorithm assign search server server list document retriev algorithm assign altern order ensur roughli number server retriev small larg server assign resourc experi merg base download document ing okapi document rank found highli effect requir broker refer collect statist statist sampl gigabyt trec collect place accur collect statist web search broker refer statist merg carri broker select ten server queri return ten document server return ten document match queri evalu probe queri server inform probe queri select ten server test queri probe queri previou extract collect statist estim server effect test result merg evalu chosen web user page search result web broker return result page offici trec experi experi probe queri carri requir broker download thousand level probe evalu probe queri titl trec topic level probe probe prefer newer queri test queri trec topic probe queri interest implic implement probe queri retriev document server term queri server return document document boolean server return document ten probe queri found inform probe queri miss server probe level index document averag boolean server implic inform server comput server rank yuwono handl make result compar distribut difficult web scenario real web server document index clear proport server proport document central index level server server proport standard select method select deviat ten relev index select server index cori cori ei cori index random select tabl distribut tabl present result test topic list result realist select select ten server base probe queri present result retriev server titl queri relev feedback distribut final present result base select select ten document select ten random server assign retriev set server unavail index select order server size order index fourth level retriev method queri distribut retriev relev feedback result discuss interest select base fewer document compar effect base document probe queri good extract inform web search server cori select degrad fewer probe modifi effect reduc surprisingli rightmost point cori lower unmodifi cori differ statist modifi cori select base ei show improv cori select due method estim tune possibl improv confirm intuit select improv account server effect result base method combin cori reason small scope case small server size current experi small server document return qualiti rank document server queri term larger hundr thousand document server queri variat retriev effect appar estim initi upward slope full inform probe queri case problem server size size broker size variat server tend select larger server probe queri mask server size explain improv fit observ french al correl server rank notabl featur bonu queri term high document frequenc assum good discrimin server good current collect test queri includ term fluid document rank term consid import rare fluid highest queri term lowest document frequenc fluid server document intuit term vari document frequenc good discrimin term time server fact relev base select ten server effect show potenti server select enhanc search effect select current algorithm provid improv effect select ten server interest experi select ten level requir improv effect select note current result select unnecessari compar select select ten requir retriev effort roughli twenti interest result highli effect select ten base knowledg relev outperform retriev result improv relev feedback techniqu result distribut case distribut result base fraction document ten retriev heterogen server explan ten server beat index stem topic skew ten server relev document averag relev topic relev document case topic document discov probe queri ten relev select server cori cori ei cori random figur select effect probe queri figur present evalu result level probe queri test topic modifi data point left probe queri rightmost point cori base full collect probe queri point cori ei ei base probe inform figur includ result tabl base select ten server relev server ten random server number bracket number server select queri retriev subset relev document effect retriev add huge proport irrelev case experi lead earli result present specif type user specif configur distribut environ user interest top search prepar wait broker select search ten merg result configur distribut environ includ specif assign retriev algorithm search server index server base singl server subset result describ realist web search configur realist previou experi term document topic skew server heterogen result gener distribut web search scenario experi type test gener result paper evalu select method applic web search server method implement digit distribut inform retriev address larg number server send queri select subset evalu design realist model web search list real web heterogen retriev algorithm real server awar studi present public evalu select base probe queri paper evalu effect select method introduc method estim server effect conduct probe queri find cori select set outperform select method maintain reason level effect base probe low number probe cori effect degrad modifi cori estim server effect ei provid improv effect modif cori modifi ei base relev yield statist improv ten probe queri distribut retriev ten server queri effect retriev index coverag web case index coverag distribut case fare mean digit librari incorpor server select base probe queri expect perform compar select base full server inform select improv account document retriev initi attempt estim effect success studi tune estim method method incorpor estim select yield result futur experi interest vari user system model present model typic web user interest earli futur experi model user perform select server attempt recal construct test collect underwai larg realist evalu refer jame bruce croft search distribut collect infer network edward peter acm sigir page juli acm press jami margaret du automat discoveri languag model text acm intern confer manag data acm nick david paul thistlewait merg result isol search engin john australasian page januari bruce alistair cj van ross justin editor acm sigir august acm york el abbadi scalabl collect summar select edward fox neil acm page august daniel adel experi select search engin metasearch acm transact inform juli fan susan gauch adapt agent inform gather distribut inform sourc aaai symposium intellig agent cyberspac stanford march jame allison jami charl kevin yun mou compar select algorithm marti richard acm sigir page august acm york jame allison charl kevin prei evalu select testb experi croft al page norbert fuhr approach select network ir acm transact inform juli lui gravano hector gloss broker hierarchi vldb morgan san francisco ca stanford technic report david nick paul donna harman result challeng web search evalu page david hawk paul thistlewait method inform server select acm transact inform david ellen nick peter bailei overview web track steve lawrenc lee gile neci meta search engin seventh intern world wide web steve lawrenc lee gile access inform web juli mm okapi text retriev confer novemb nation institut standard technolog nist special public selberg etzioni metacrawl architectur resourc aggreg web ieee amit gerard chri bucklei document length normal technic report depart comput cornel ithaca judi bernard jansen search survei excit user internet electron network applic ellen siemen experi merg proc fourth text retriev confer page novemb nation institut standard technolog xu jami callan effect retriev distribut collect croft al page yuwono lee server rank distribut text retriev system internet rodnei topor katsumi dasfaa page april world singapor
HCI/1434 4 singl displai model collabor jason stewart comput scienc dept mexico nm benjamin bederson comput scienc dept umiac interact lab maryland colleg md allison druin colleg educ umiac interact lab maryland colleg md abstract introduc model support collabor work peopl physic close call model singl displai groupwar describ compar tradit remot collabor describ requir sdg place comput understand benefit cost sdg system describ prototyp sdg system built result usabl test ran elementari school children keyword singl displai educ input introduct earli research xerox parc creat live work technolog futur world person singl keyboard fundament design legaci carri modern comput system network peopl collabor primari assumpt remain singl individu access displai time valid work desir interact design technolog elementari school frequent observ children crowd comput screen interact comput applic children enjoi experi comput control activ control applic time multipl peopl interact comput lack technolog support affect peopl collabor technolog design improv collabor explicitli design comput support collabor singl comput introduc model defin singl displai groupwar comput program enabl user collabor share comput singl share displai simultan multipl input devic recent work includ begun explor sdg attempt creat framework ti motiv futur system design includ support sdg scenario imagin comput environ futur support visit offic feedback latest project person data assist carri wireless network easili commun comput approv start demo touch screen pda control cursor workstat workstat gestur chi cursor indic area question find number bug code interact work bug interrupt input devic hand design review plan live room paper design offer show model comput give idea plan fit rest guid program live encourag pick extra investig layout troubl navig unfamiliar softwar design demonstr navig tool quickli learn mimic reloc furnitur experi room layout color scheme daughter finish work latest geometri project difficulti theorem teacher teacher busi group student work collabor learn daughter friend friend pick mice explor problem work move squar triangl measur result feel comfort theorem fact cooper work network comput biggest sell point comput scenario part todai world comput miss form collabor suggest collabor research cscw todai focu support peopl work comput network suit support remot support peopl work requir solut problem base comput paradigm discuss singl displai groupwar suggest effort investig technolog bring peopl enhanc interact peopl work relat work project support peopl collabor room electron meet provid member desktop comput privat work control share displai front room earlier share room built krueger instal art piec drawback electron collabor room requir special hardwar prohibit peopl benefit enhanc support school children liveboard digit whiteboard tivoli applic enabl multipl simultan user interact share digit whiteboard author point simultan whiteboard rare occur specul lack adequ softwar level support collabor kind present pebbl project investig handheld person digit assist portabl input devic sdg set explor limit current gui applic toolkit make toolkit support sdg implement sdg mmm enabl multipl user interact multipl editor comput displai provid user independ input devic system made research user studi conduct investig limit idea mmm research work transfer technolog studi input singl user research investig sdg technolog influenc group learn environ work show provid user separ input devic gave learn devic activ time activ devic toggl predetermin access protocol import result sdg benefit task user expect work edit paper built softwar architectur enabl build sdg applic teach collabor skill guid metaphor applic built sdg architectur goal run race requir particip learn cooper order run applic includ user find rgb valu chord matcher user find note chord rekimoto approach enabl user creat work palmtop comput move data share public digit pick drop protocol work greenberg boyl investig boundari public privat work design applic collabor sdg set pda network workstat conduct critic review empir studi date technolog impact group interact import contribut work list variabl evalu test effect technolog group process list outcom variabl task user member relat outcom variabl commonli technolog influenc group member feel commonli measur exampl technolog support collabor place categori hardwar interfac includ categori vehicl multipl steer aircraft flight control driver educ car system enabl simultan user multipl input softwar interfac teach design sdg system exampl sdg system includ video game softwar primarili support user navig scene shoot plai fight support share creation inform spatial support inform retriev social issu video game interest sdg offer guidanc interfac develop input channel output channel understand implic sdg comput system design investig sdg applic differ applic user interfac consist input channel enabl user commun output channel enabl comput commun user defin input channel input devic independ input comput current comput system keyboard consid separ input channel keyboard input depend set keyboard focu futur comput system support independ keyboard current typic current system singl input channel laptop comput multipl point extern devic depend share input share control system activ time definit cover observ divid task give user keyboard result good collabor experi defin output channel part comput interfac independ modal provid user feedback exampl displai visual speaker audio joystick haptic feedback current comput potenti visual audio ui audio feedback reli visual feedback except audio system blind overwhelm minor exist system chang futur typic current system provid singl output channel singl displai groupwar tradit groupwar comput applic written todai singl user applic special support multipl user groupwar applic group fundament knowledg multipl user sdg subset groupwar multipl user time place tradit groupwar system creat applic intend run multipl workstat commun comput network commun distribut fashion singl central server similar singl user applic tradit groupwar applic singl input channel singl output channel user figur user interfac singl user applic sdg applic provid input channel user separ input share singl output channel figur qualiti give sdg applic uniqu combin multipl independ input channel singl share output channel tradit groupwar system chose share user coupl limit function applic appar gain user remot languag smalltalk commun express concept model correspond underli inform data view correspond part control output channel control correspond part handl input tradit groupwar system singl share user separ separ pair commun share model sdg system singl share differ tradit groupwar system singl share view comput give feedback singl share control user interact comput sdg applic multipl control applic replic user interfac element provid user uniqu copi solut scale quickli screen space user interfac figur tradit groupwar figur singl displai groupwar mvc model previou discuss input channel output bring central differ design sdg tradit groupwar system share user interfac user separ input user interfac element commun comput design handl multipl simultan user restrict correspond singl share control mvc descript share feedback user interfac element comput commun state inform user share user capabl relai inform user simultan consequ share view mvc discuss coupl navig user navig part model user affect coupl user navig navig coupl user part view obscur user navig area model singl chosen expand scope model includ multipl output call groupwar goal studi architectur concern support collabor singl person comput overwhelm major current pc system displai main output channel commun user feedback audio user collabor singl collabor displai hard drive reason chose singl share displai central metaphor paradigm singl displai metaphor intend connot properti applic design groupwar system share possess share ui share coupl navig constitut singl singl comput multipl full wall project devic projector creat singl seamless constitut blind person comput feedback sdg blind groupwar gener form major comput reli sole visual displai decid lost gain back concret includ exampl relax strict condit multipl user singl displai comput user share user interfac restrict longer appli monitor sole provid extra physic screen space provid independ condit appli system consid sdg tradeoff singl displai groupwar current comput system encourag collabor multipl user singl user system provid explicit input channel multipl user attempt collabor system user develop share mechan util channel sdg applic inher notion multipl user provid user input channel impact aspect comput benefit enabl collabor inhibit social barrier cultur reluct person space person person space surround close friend smaller surround space surround largest chapter due proxim peopl inhibit attempt share comput person sit front explicitli provid separ input person space person person comfort interact comput time enabl type interact requir multipl user explor number collabor interact requir multipl simultan user singl comput goal research creat tool strengthen collabor learn enrich exist collabor comput turn view unnecessari cumbersom enabl multipl input devic case enabl work make collabor effici ey user number studi benefit collabor due collabor enhanc verbal nonverb commun pp reduc elimin conflict multipl user attempt interact singl applic difficult creat share mechan share difficult obei mechan creat provid separ potenti conflict push step encourag exist singl user technolog collabor learn competit user interact applic inhibit learn benefit collabor provid applic multipl commun enrich learn diminish competit access input channel strengthen commun skill strong user longer task control input user commun resolv conflict potenti benefit comput paradigm potenti neg conflict frustrat user attempt simultan incompat action work parallel disadvantag user conflict agenda concern area navig singl share output channel user decid navig data neg affect user sdg applic squeez function limit screen result reduc function compar similar program due process sdg applic slower singl user tradit groupwar version success sdg implement depend oper system window system applic portabl exist popular complet task longer strong user direct collabor control input devic user collabor work set complet task commun user order build success sdg tradeoff carefulli balanc applic potenti applic domain sdg present complement exist singl user replac anticip collabor situat interact singl displai network synchron collabor asynchron collabor expect sdg potenti creativ domain user involv construct task artist brainstorm creativ project benefit group activ restrict natur current system limit express potenti benefit sdg domain includ work effect work parallel elimin unnecessari turn learn domain user involv explor materi problem solv learn simul learn shown domain group activ import learn current comput system creat inequ partner due differ skill restrict singl input devic potenti benefit sdg domain includ effect learn work time reduc cognit differ partner give parallel access instruct domain user experienc skill knowledg impart train peer teach inform instructor sale domain sale person custom configur item crucial point custom plai activ role select configur process inclin product supplier area benefit sdg applic accomplish data entri work show ad multipl input devic benefit task user expect work area unknown effect sdg collabor edit paper effect multipl provid user highlight gestur tool local tool order investig sdg affect group interact singl implement architectur build sdg local tool architectur underli oper system event model built linux oper window system applic layer built tk toolkit written perl section describ import high level issu complet descript architectur implement provid discuss intend motiv futur system includ support sdg current pointer metaphor build gui applic number limit build sdg applic toolkit implement widget work sdg paradigm global variabl assum singl applic store user state inform global variabl lead share interfac state singl pen color font applic store state feedback techniqu insuffici displai state applic redesign entir interfac high interact semant widget design singl user lock mechan prevent multipl user interact modal dialog box appli user user activ user interact user select chose metaphor sdg applic develop metaphor repres tool separ icon lie data surfac user data goal repres applic function tool user tool creat line tool pen color line width user chosen person configur tool behav differ click color draw color chang tool color provid click sharpen line width modifi tool tip size provid tool feedback made simpler user cursor enlarg tool tradit approach feedback sdg system requir home area cursor construct order test local tool build applic earlier work build collabor draw program children rich sourc potenti conflict interact provid task benefit sdg earlier work show import iter design process involv children design partner build applic kid felt iter design import build applic collabor children local elementari school design test applic period month start applic consist share end design process kid creat tool applic enabl user collabor creat import pai attent applic affect user relat collabor behavior effici draw creat evolut tool origin overli entir draw kid quickli frustrat small mistak start gener user individu line entir draw addit collabor behavior group chang fairli dramat overli critic work rid spent major time good solut problem week iter involv creation bomb tool user mode line drawn current user click mode line click hand tool pick move line combin tool user easili simpl easili start scratch big mistak affect move line usabl test evalu success idea conduct usabl test involv student grade elementari school nm student group randomli assign singl input devic sdg condit summar result studi earlier pilot studi demonstr posit interdepend collabor partner goal structur johnson johnson children involv studi told partner team design contest sponsor mexico research build technolog kid kid thought technolog technolog futur team complet seri draw enter team effort team compet prize children access mice depend condit assign week minut regularli schedul comput lab period week final session switch group singl devic multipl vice versa interact applic session observ investig record videotap verif observ final team inform verbal felt abil work group condit condit felt easiest condit condit applic due schedul difficulti student complet final session result initi result data post evalu debrief anticip group split environ consid easiest singl input devic multipl input devic children thought devic easiest complet felt devic condit children undecid children answer felt fun devic child thought devic fun answer final question condit kid comput ident answer question condit suggest fun import kid effici task complet children opportun felt condit girl prefer devic condit prefer sdg condit summari frequent frequenc exampl turn didnt parallel work stuff comment worth highlight follow question prefer child comment kid thought obviou partner stuck advantag kid awar girl didnt enforc kid work chose major kid condit complain singl final im back work typic reaction opposit reaction common group singl girl didnt complet final session frustrat share told didnt share anymor attitud didnt leav comput session paper describ model collabor call singl displai groupwar research group recent develop form sdg describ framework project understand common suggest wai technolog develop incorpor support sdg scenario introduc paper realiti usabl studi conduct exist technolog number shortcom collabor sdg technolog enabl interact modal reduc shortcom observ exist technolog creat interact problem understand impact sdg technolog design sdg naturalist studi hope peopl continu develop evalu sdg technolog system acknowledg children elementari school nm make user studi chi chi evalu earli version work member jim hollan jon meyer gener larg fund darpa grate refer local altern tool palett user interfac softwar technolog acm pp zoomabl graphic sketchpad explor altern interfac physic journal visual languag user interfac architectur share editor singl screen user interfac softwar technolog acm pp collabor control object support collabor doctor washington mirror holist approach user interfac interact virtual environ wilei children collabor style extend abstract human factor comput system acm pp design collabor educ human factor comput system acm pp move person devic public displai tech report depart comput canada hidden dimens anchor effect protocol children learn collabor environ graphic interfac canadian inform process pp tangibl seamless interfac bit atom human factor comput system acm pp learn edit prentic hall artifici realiti ii group interact technolog sage collabor multipl pda connect pc comput support collabor work acm connect bridg digit gener gap press electron whiteboard inform workgroup meet human factor comput system acm pp multipl devic approach support interact human factor comput system acm pp groupwar experi design comput support collabor work acm pp preliminari experi problem solv environ european confer comput support cooper work comput scienc pp singl displai groupwar doctor nm hand enhanc collabor singl displai groupwar extend abstract human factor comput system acm pp
HCI/1435 4 environ augment realiti system ronald azuma laboratori canyon ms ca usa jong jun ulrich neumann integr media system center southern california lo ca usa abstract augment realiti applic requir accur track exist track techniqu requir prepar environ ensur accur result paper motiv pursu augment realiti track techniqu work user modifi real outdoor applic accur track situat requir hybrid approach paper summar system compass inerti system fuse optic inerti input describ preliminari result track method run simul futur work limit motiv augment realiti displai system composit virtual object view real real time user virtual object exist real environ kei requir accomplish track system accur measur posit orient locat space accur virtual object drawn correct locat correct coexist real object problem accur align real virtual object call registr problem exist augment realiti system achiev real system work prepar environ environ system design complet control exist environ modifi tradit ar medic visual displai manufactur assumpt reason potenti ar applic feasibl accur track environ potenti user includ navig soldier driver oper vehicl user oper carefulli prepar ar displai improv situat inform select retriev ar interfac natur mean control interact wearabl comput current wimp standard open applic track environ import research direct reduc prepar make ar system easier set oper compar virtual environ ar system rare found research laboratori prepar environ ar system hard requir amount measur calibr ar system easier end user set oper system requir expert user set calibr environ system accur track achiev carefulli prepar environ major step reduc difficulti oper ar system ultim goal ar system support accur track arbitrari environ user move ar system outdoor import step direct track environ difficult reason user oper outdoor long resourc system limit due mobil constraint prepar environ user stai bandwidth cpu constraint limit budget physic factor user move wear equip power constraint concern rang oper condit greater prepar environ light temperatur factor environ displai bright sunni dai visual landmark video track system reli vari light condit visibl night system design control environ modifi environ ar track system reli place special fiduci marker locat approach practic outdoor applic assum cover landscap color marker accur measur object interest environ inabl control environ restrict choic track technolog tracker requir place activ emitt environ differ prepar environ illustr challeng accur track environ survei track technolog oper find singl technolog offer requir perform futur global posit system measur posit point earth satellit ordinari gp measur typic error differenti gp system reduc typic error meter carrier phase system achiev error measur centimet condit gp directli measur orient work user sky militari gp easi jam inerti dead reckon sensor technolog main problem drift cost size restrict limit perform unit suitabl mem technolog chang futur recov posit requir doubli integr accur posit estim acceleromet extrem difficult confound effect commonli tracker reli activ environ passiv optic applic approach gener full solut clear comput vision algorithm brittl intens electromagnet compass combin tilt sensor tracker commonli displai measur posit vulner distort magnet requir extens calibr effort magnet clean measur distort high qualiti electron compass singl track technolog offer complet solut approach develop technolog combin multipl sensor wai weak individu compon pursu hybrid combin optic inerti sensor complementari natur sensor make good candid research colleagu gari greg welch north carolina chapel hill develop hybrid sensor type problem area previou work virtual exist augment realiti system work prepar environ ar system oper environ user modifi control real world system type tour machin commerci orient typic compass tilt combin differenti gp recent version orient sensor develop accur tracker focu tour machin system exhibit larg registr error user move quickli concurr group rockwel scienc center develop method registr outdoor environ base detect silhouett horizon line compar silhouett model local system determin current locat orient research develop tracker environ direct philosophi hybrid approach offer reason chanc success previou ar track system hybrid system ad rate gyroscop optic tracker aid motion predict set sensor gyroscop compass tilt similar initi base system differ result mathemat combin sensor distort actual demonstr accur track ar system contribut rest paper summar result system built track environ describ recent result tackl posit problem system focu orient compon call freedom result initi base system combin compass tilt sensor rate gyroscop stabil appar motion virtual object system run real time demonstr field registr typic error reduc significantli compass hybrid add input video tracker detect natur featur video sequenc reduc error pixel test tracker real comput requir run real time simul step activ track posit orient sole reli result demonstr algorithm detect featur initi unknown locat incorpor posit estim user move wide area environ base system attempt hybrid tracker subset problem system address problem subset base build assum object distant hundr meter reli sole differenti gp posit track focu research effort orient problem largest error distort orient sensor dynam error system latenc main contribut base system calibr electron compass sensor stabil displai output respect user motion built hybrid tracker combin compass tilt sensor rate gyroscop effect fuse compass gyroscop input requir care calibr develop sensor fusion algorithm measur distort electron custom built turntabl millisecond delai measur due inher sensor properti commun latenc compass read hz gyroscop sampl khz filter fuse gyroscop updat rate true kalman make tune easier reduc comput load desir properti figur filter output lead raw compass show gyro slow updat rate long latenc compass filter output smoother benefit gyroscop input filter output settl compass motion stop gyro accumul filter absolut head provid compass inerti drift simpl motion predictor delai render displai subsystem base system oper real hz updat rate run pc window combin opengl render run system geograph locat figur show sampl imag virtual label identifi landmark laboratori base system outdoor ar provid smallest registr error current outdoor system compar compass base system enorm improv registr accuraci smooth benefit provid hybrid displai virtual unread user move registr perfect peak error typic averag error compass distort chang requir system detail read hybrid system improv registr ad video form hybrid fuse type sensor offer benefit integr gyroscop yield reason estim provid good initi guess reduc search space vision process algorithm fast motion visual track fail due blur larg system reli gyroscop user stop video track lock recogniz featur correct accumul drift inerti tracker hybrid perform calibr map rel orient tracker video coordin system differ adjac imag map orient differ provid correct vision track reli fiduci locat search scene set featur robustli track featur point featur select automat vision track suitabl environ method fuse input vision inerti tracker method integr gyro orient vision estim mean inerti estim drift time advantag error vision track propag corrupt inerti method robust method increment gyroscop motion visual estim correct gyroscop drift video visual error affect orient visual featur track robust method yield smaller error hybrid greatli reduc error base system fast error base system figur show correct provid incorpor video input output stai pixel true locat actual oper label stick perfectli comput vision process run real time result simul record motion sequenc real inerti data method real unprocess data achiev result investig wai incorpor correct system detail simul previou result orient reli gp acquir posit situat gp object interest close error gp registr error explor method posit track environ section describ approach track rel motion direct addit base observ motion hybrid ar system tradit perspect camera optic system weak measur linear camera motion ambigu discrimin imag motion small pure translat small pure rotat planar project camera sensit direct translat li field view panoram project reduc elimin problem larg field view make uncertainti motion estim independ direct motion compar planar panoram project algorithm essenti matrix condit imag point posit figur show result simul plot camera rotat translat direct error pixel show moder track panoram project accur result show gener motion path test yaw pitch translat cm pixel panoram project show superior accuraci planar perspect term lower error standard deviat error simul rang track system limit area minimum number calibr featur view partial featur failur error track robust dynam extend track achiev dynam calibr posit uncalibr fiduci natur featur effect approach depend behavior pose calcul experi show track error propag rapidli extend track pose calcul sensit unstabl figur show error camera posit dynam pose calibr error propag scene featur simul system start track calibr featur camera pan rotat system estim posit initi uncalibr featur volum green line figur show error camera posit comput estim pose estim method frame accumul error exce largest oper volum dimens perform adequ frame fiduci camera motion track area extens accur pose estim reduc error growth rate address pose problem develop pose comput method significantli improv perform dynam calibr possibl achiev track environ method base robust averag solut base iter extend kalman filter constraint filter method design specif low frame rate measur frame video vision system pink blue line figur show result obtain method initi test show improv lead method import approach track environ detail pose estim method futur work remain continu develop tracker work accur environ result paper step limit visual track algorithm assum static add compass calibr routin chang magnet field distort user walk assum view object distant minim effect posit progress rout includ real object varieti rang futur ar system work environ address issu concern system oper outdoor acknowledg paper base invit present ron azuma eurograph workshop virtual environ special focu augment june work fund darpa contract invit submit paper refer survei augment realiti virtual environ challeng make augment realiti work outdoor mix merg real virtual tamura azuma improv static dynam registr optic hmd siggraph outdoor augment realiti system ieee virtual realiti registr outdoor augment realiti applic comput vision techniqu hybrid sensor ieee virtual realiti coupl rotat translat motion estim planar surfac ieee confer comput vision pattern höllerer tour prototyp mobil augment realiti system explor urban environ intern symposium wearabl wireless system augment realiti virtual set applic siggraph hartlei algorithm intern confer comput huang motion structur featur review ieee neumann augment realiti system acm virtual realiti softwar neumann extend track augment realiti ieee virtual realiti annual intern park natur featur track extend robust augment realiti intern workshop augment realiti pose robust accur augment realiti track intern workshop augment realiti superior augment realiti registr integr landmark track magnet track siggraph hybrid hybrid track system unc chapel hill dept comput scienc technic report welch increment track incomplet inform hybrid inerti vision track augment realiti registr ieee virtual realiti figur differenti gp receiv orient ii sensor rate gyro voltag filter mhz pentium pc video figur base system dataflow diagram optic hmd figur sequenc head data compar compass input filter output figur virtual label outdoor landmark laboratori video featur automat select track figur graph compar registr error base system hybrid run method figur virtual label annot landmark video sequenc show inerti track result figur comparison error function track pixel figur propag camera pose error experi
HCI/1436 4 softwar model specif languag user interfac robert stephen morrison tuft present softwar model languag describ program aspect interact user virtual environ approach base view essenc dialogu set continu temporari model combin compon continu relationship compon discret enabl disabl individu continu relationship demonstr present user interfac manag system set exampl run visual editor user interfac descript discuss implement restrict constraint interact situat goal provid model languag captur formal structur interact previou techniqu captur style suggest perform categori subject design tool interfac user graphic mean verifi reason techniqu gener human languag addit kei word interact specif state transit user interfac manag system introduct user virtual continu interact user work support nation scienc foundat grant offic naval research grant naval research laboratori grant depart electr engin comput tuft colleg ma permiss make copi part work person classroom grant fee provid copi made distribut profit commerci copyright titl date notic copi permiss copi post redistribut requir prior specif permiss fee acm acm transact vol march page jacob al current user interfac descript languag softwar system base model articl test model describ program finegrain aspect interact model combin compon continu relationship compon discret enabl disabl individu continu relationship kei ingredi separ interact compon framework commun model abstract detail specif input devic treat term discret event produc continu valu provid framework reduc current difficulti integr devic virtual realiti provid devic fit model discret event continu variabl found fit model applic describ element user interfac continu input scrollbar slider articl discuss model implement softwar model captur style interact introduc jacob user interfac descript languag embodi program environ develop languag exampl illustr express languag describ interact issu constraint virtual environ similar interact situat background user interfac provid multimod contrast current gui wimp style interfac jacob interact style virtual realiti fundament characterist common gener class emerg includ type music accompani intellig agent interact entertain ey ubiquit comput nielsen share higher interact previou continu exchang occur dialogu acm transact vol march user interfac goal develop implement model abstract captur formal structur interact exist techniqu captur interact current user interfac inher dialogu singl stream input treat conceptu singl multiplex interact proce altern user comput user meaningfulli move type time interfac continu interact user comput asynchron channel devic interact system draw exist skill interact real system offer interfac easier learn make interfac difficult build advanc user interfac design technolog advanc user interfac softwar tool result todai command languag interfac implement direct manipul wimp interfac moder serv user interfac softwar emerg multimod interfac handl exampl virtual realiti necess design implement model suit previou interfac style model fail captur parallel interact interfac requir ad program approach made system difficult seek techniqu abstract describ implement interfac higher closer point view user implement interfac difficult current specif languag user interfac manag system applic wimp interact characterist current versu wimp versu interrel token versu continu discret input token versu probabilist difficult acm transact vol march jacob al versu user command versu passiv monitor user characterist tradit interact style correspond characterist program languag process compil current uim technolog built compil process singl stream discret token singl bnf atn transit syntax specif interfac violat assumpt serv approach current uim technolog typic handl multipl input devic serial input common stream suit convent dialogu style style input logic parallel user simultan parallel dialogu program prefer describ program term logic concurr singl serial token stream similar parallel process program explicitli time slice process unusu todai write parallel process explicit time slice write parallel program top process assum parallel separ layer handl transform singl physic processor seek similar kind abstract user interfac softwar model combin applic aspect user interfac descript languag framework intend match properti dialogu exist techniqu extend ad hoc wai describ unusu aspect dialogu real problem find describ user interfac program languag find languag captur view interact underli properti interact identifi basic structur interact user essenc sequenc interact posit set continu temporari virtual user object hand posit object posit relat continu function ident map user grasp object scrollbar acm transact vol march user interfac convent graphic user interfac view region file displai relat continu function linear scale button held press scrollbar continu relationship user button continu relationship perman convent physic control rotat posit knob perman connect variabl continu function linear map rotat posit cockpit flight posit throttl lever set throttl paramet perman connect continu function essenc interfac set continu perman engag disengag time time relationship accept continu input user typic produc continu input system action engag disengag typic discret button grasp softwar model current specif model base token event trigger qualiti make easi program event wrong model describ interact declar relationship continu variabl interfac style tend kind interact address continu aspect interfac explicitli specif model continu input treat quantiz stream event handl discret token describ continu user interact element model describ type relationship connect continu input variabl continu applic data continu network function intermedi variabl result resembl wire diagram set constraint model support parallel interact simpli declar specif set relationship principl maintain simultan singl processor requir time constraint issu implement discuss level note describ interfac pure continu term pure discret term physic action view quantiz order obtain discret input acm transact vol march jacob al press keyboard kei continu action space quantiz state continuum underli simpli group point consid view keyboard interfac continu term claim user model keyboard input discret user simpli press kei press continu action view discret continu input ultim quantiz order pass digit comput drag transmit comput sequenc discret move discret pixel posit typic window process sequenc individu discret event claim user model input continu user gener individu make continu gestur interact drag interact wimp section convei continu interact concern captur continu qualiti directli implement hardwar input output realiz seri discret event grasp object move continu interact underli ultim implement discret seri input event lead model user interact part graph function relationship continu variabl relationship typic activ moment part set discret event handler event handler specif continu relationship activ deactiv kei issu continu discret domain modern user interfac typic main connect model discret event activ deactiv continu relationship pure discret control push toggl menu fit framework tradit discret state diagram cover discret event handler part model part serv engag disengag continu relationship handl discret interact model combin continu relationship event handler goal provid languag integr compon map close view interact interfac model languag intend independ choic mechan implement built solver discuss section exampl section acm transact vol march user interfac intend depend solver section discuss potenti type solver depend basic model set continu user interfac directli connect input applic semant variabl commun user interfac model continu discret variabl simpli interior node graph intermedi result set function map continu variabl continu variabl link oper time turn user input abil enabl disabl portion graph user input kei featur model set respond discret input event includ produc set make procedur call applic set clear enabl disabl group link model cast framework separ class hierarchi fundament basic oper softwar framework user interfac manag encapsul base subclass specifi defin kind link variabl connect graph input disjoint tree enhanc express power model model commun discret continu portion commun discret continu occur set clear effect graph analogu data turn discret event handl commun path continu discret link gener token process event handler link function gener token input variabl cross threshold gener token complex function input true input paramet link function attempt recogn hand postur fire token recogn acm transact vol march jacob al augment transit network similar provid abil continu discret compon set test arbitrari user interfac access compon refin express event handler individu state transit diagram state event handler intermix arbitrari form event handler state diagram event handler lead method integr continu discret compon imagin state state transit diagram entir graph system enter begin execut graph continu state state diagram view set transit graph provid abil enabl disabl set link graph explicit action associ set automat enabl disabl link belong state state enter exit simpli shorthand set clear condit explicit apt descript mode continu oper basi altern form user interfac descript languag user interfac descript languag develop languag base model implement form main form languag visual show interact graphic editor section languag text form intend user input intermedi languag graphic directli set class expositori introduc element graphic version begin simplifi slider widget convent wimp interfac user press button slider slider begin scale appropri follow truncat lie vertic rang slider directli set applic variabl move view function relationship posit slider continu variabl ultim realiz pixel relationship enabl user drag slider button provid event handler form state transit diagram process event enabl disabl continu relationship acm transact vol march user interfac fig specif simpl run illustr graphic notat upper half screen show continu portion oval repres rectangl arrow data flow lower portion show event handler form state state repres circl transit arrow figur show specif simpl slider visual run graphic upper portion screen show continu portion specif oval repres rectangl arrow data flow variabl shown kind kind role user interfac actual devic variabl affect displai semant data share syntact data share compon user random interior node graph link shown rectangl condit activ mean activ lower portion show event handler form state state repres circl transit detail state diagram notat found jacob state diagram insid condit activ state acm transact vol march jacob al letter state condit arc token boolean express true transit action execut transit addit type input output slot link case bodi link written line code evalu inform enter view dialogu box flow transit layout element screen arrang white space convent program languag topolog connect element diagram system continu relationship slider divid part relationship posit variabl applic semant relationship displai slider handl perman variabl share semant level chang applic function kei slider handl respond variabl input current locat output control slider handl drawn displai underli user interfac manag system automat variabl updat base input posit slider handl updat base link simpl scale truncat function relat posit control link condit enabl disabl state transit diagram link scale variabl back screen posit slider enabl discret portion specif form state transit form event handler specif interchang underli system start state accept token occur slider handl make transit drag condit enabl long state diagram remain link connect slider explicit specif token trigger transit initi drag condit disabl relationship maintain automat condit drag provid layer indirect singl condit control set condit link enabl condit simpl illustr separ acm transact vol march user interfac fig slider figur illustr altern form graphic notat larg circl repres arrow repres transit state graph show data flow oper system state ou discret specif enabl disabl continu relationship state diagram connect abowd dix carr al carr al present specif slider separ continu discret aspect wai section constraint languag born support temporari constraint roughli similar figur show altern form visual languag figur visual editor form figur illustr describ editor screen form languag unifi compon singl state state transit diagram entir graph system enter begin execut graph continu reach state state diagram view set transit graph note apt descript mode continu oper slider handl nest diagram approach al case confin level syntax obviou drawback type languag difficult scale graphic fit complex interfac singl static imag interact zoomabl editor address rapid continu provid system al project techniqu al figur show interfac figur zoom diagram visibl edit acm transact vol march jacob al fig interfac figur zoom edit graph state program environ editor editor visual program environ languag implement graph editor call similar digit logic prototyp state diagram editor simpl form menu provid programm facilit entri inform element programm annot figur figur screen dump show base screen editor upper draw area variabl repres link data flow arrow flow small rectangular handl control curvatur arc handl serv smooth anchor point spline middl handl capabl gener arc state diagram editor lower draw area state repres circl resiz transit label action dialogu box brought select transit dialogu box user enter code fragment link bodi method state dialogu box option boolean condit form express return true option action transit made code transit ad menu command placement modifi drag data flow user prompt select start end node node data flow link input output dialogu acm transact vol march user interfac box user slot flow attach smart delet facil automat elimin dangl element text languag main form languag visual figur show form form dump restor inform graphic editor tool languag sgml order avoid introduc incompat increasingli support edit tool figur illustr intermedi languag show figur form defin data flow state make interfac fairli straightforward figur show inform enter dialogu box visibl figur kind attribut link bodi routin delimit kind field predefin chosen librari link perform common mathemat geometr case element absent actual content insid variabl data show state transit diagram portion express list transit similar jacob form languag translat code load base class implement interfac languag option shown retain layout inform gener graphic affect mean languag uim simpli set class implement underli user interfac manag system build interfac directli subclass defin link interfac write code method form ultim translat run user interfac softwar testb editor dump text form form translat code uim class compil run directli sgml write requir manual updat languag updat translat exampl manual edit uim design intend preclud edit current implement requir compil cycl chang uim ad transit point execut delet provid acm transact vol march jacob al fig specif slider figur illustr intermedi save restor file input user acm transact vol march exampl user interfac fig grab drag object hand simpl interact virtual realiti user grab object hold button cursor figur button object posit cursor posit drag condit enabl button relationship cursor continu hand grab object figur show simpl interact grab drag object hand figur show object hand cursor run system cursor perman attach hand user grab object hold button cursor refin button object posit cursor button relationship cursor continu hand figur straightforward hand input variabl polhemu control posit link cursor enabl cursor control posit object ident condit acm transact vol march jacob al fig object hand cursor figur run user interfac manag system cursor perman attach object grab move drag engag condit engag press button state transit disengag button transit worthwhil note subsequ exampl requir user write code maintain relationship defin link respond event user simpli declar specif desir relationship turn arm figur show simpl movabl attach base figur show user grab arm move dimens left end constrain fix base attach doubli hing rest arm pivot follow hand cursor perform calcul relat hand cursor posit perform rotat matrix movabl portion arm link acm transact vol march user interfac fig simpl movabl attach base column state diagram show state chang occur user grab arm activ condit arm relat hand cursor posit arm posit continu activ user grasp arm activ user grasp user arm link arm remain left state diagram show state chang occur user grab arm activ arm unlik simplifi figur user press button hand cursor touch arm segment variabl constant inform size shape gener initi geometri specif arm variabl transform matrix rotat movabl portion arm follow hand cursor tag output variabl directli reflect necessarili sink graph subsequ uim automat obtain updat valu output variabl period scene valu relationship output variabl screen displai repres visual straightforward relationship complic calcul link variabl fed simpl output acm transact vol march jacob al fig arm figur run system user grab arm move dimens left end constrain fix base attach doubli hing rest arm pivot follow hand cursor simpli actual transform matrix dc node perform scene graph shown simpl data variabl diagram data type vector give posit figur transform matric type match slot link connect variabl type inform type input output slot link enter displai dialogu box section complex arm figur show give interest link figur show reduc cursor shown figur discuss candid encapsul separ interact acm transact vol march user interfac fig link variabl activ hand cursor control rotat proxim segment arm activ hand control distal segment figur depend hand posit control reduc cursor shown subsequ figur object user grab move segment arm previou segment attach hing tip proxim segment user grab distal segment rotat respect joint tip proxim segment activ hand cursor control rotat proxim segment arm activ hand control distal segment diagram depend hand posit control time time calcul rotat distal segment arm requir knowledg rotat proxim portion arm note longer sink output variabl point view directli drive element graphic displai figur behavior figur add variabl graph stretch limit singl mechan discuss call acm transact vol march jacob al fig arm figur user grab move segment arm previou segment attach hing tip proxim segment user grab distal segment rotat respect joint tip proxim segment vector present absolut locat tip proxim distal object make user interfac direct bear visual calcul link calcul variabl variabl link user interfac uim devot resourc recalcul request make variabl world arm note posit input simpl arm figur simpli posit vector world coordin gener hand cursor tip posit variabl produc arm creat arm constraint joint point tip acm transact vol march user interfac fig object behavior figur export addit vector give absolut locat tip proxim distal made user interfac figur direct bear visual calcul object figur stretch limit mechan discuss section call arm order creat complex investig discuss section figur show virtual world instanc figur grab hand gener rotat variabl provid collect arm background link tip foreground arm input posit variabl half background arm point tip rightmost foreground point arm lower center foreground altern background arm point proxim tip foreground distal tip minut examin figur immedi appar arm segment move live applic world shown figur creat simpli instanti figur figur chang input posit variabl pointer background arm modifi add extra featur appar screen dump background arm state diagram acm transact vol march jacob al fig world instanc figur figur input posit variabl slot set point tip foreground arm grab hand gener rotat variabl arm background tip foreground arm input posit variabl background arm point tip foreground altern background arm point proxim tip foreground distal tip turn keyboard color base column arm demonstr perform turn arm foreground arm segment substanti number constraint solv chang amount render virtual environ figur show complex small virtual object widget user manipul object individu load main program object cube cursor hand posit upper acm transact vol march user interfac fig screen dump complex virtual includ cube cursor hand posit upper arm arm arm point part center lower foreground view orbit pyramid top joint arm left arm foreground arm point part includ sphere visibl displai geometri ident addit object introduc discuss larg ball center orbit pyramid top lower foreground center interconnect object share constraint graph variabl object control arm connect point slider connect control speed orbit pyramid slider highlight chang cursor touch highlight extend handl user engag drag handl acm transact vol march jacob al straightforward extens figur state diagram track highlight state turn drag actual drag handl figur larg sphere user drag toss air object maintain friction user catch throw pyramid top frame orbit user speed continu control slider foreground orbit pyramid ball simpl exampl physic introduc order discuss topic output variabl send graphic system locat speed user control term speed direct link perform calcul convert data wai toss object illustr easier locat object simpl function current clock time time moment toss calcul current locat integr histori data cpu time scarc evalu link motion ball speed jump correct posit current prefer degrad strategi virtual environ al shaw al orbit object difficult current locat depend integr entir histori previou set slider control speed unlik calcul correct locat time initi posit veloc histori potenti depend choic constraint solver run frequent handl situat special provis lazi evalu solver user output request time period handl tag constraint special treatment instanc subclass discuss section note evalu figur show orbit object link subclass graphic notat reveal read current variabl export slider current obtain timer input connect system clock section link intern variabl accumul input integr continu gener rotat transform correct current locat orbit pyramid acm transact vol march user interfac fig specif orbit visibl top figur speed variabl export timer variabl connect system rot variabl transform current locat pyramid object discret compon figur show toss show addit show distinct ball fly air user grasp hand cursor simpli calcul posit ball anew current time initi condit toss forward chain step toss measur veloc ball moment make transit drag toss polhemu sensor measur hand veloc user drag save posit hand timestamp share state transit commun moment user toss state transit call recent save posit time determin set initi condit acm transact vol march jacob al fig specif visibl center figur interact reveal distinct ball fly air user grasp hand cursor continu calcul posit current time initi condit toss updat posit ball base hand cursor measur veloc ball moment toss link save posit hand timestamp state transit determin initi condit toss toss share state explicitli visibl object head posit orient polhemu sensor control viewpoint simpl set link variabl obviou object usual moment section interchang viewpoint simpli instanti object produc output variabl viewpoint interact techniqu virtual realiti addit present experi sketch specif interact techniqu virtual acm transact vol march user interfac fig specif develop liang mark green select command vr menu pop sphere command icon posit polhemu sensor held hand state transit diagram show link activ deactiv button diagram show menu sphere select cone follow posit hand sphere rotat hand cone point ey turn surprisingli straightforward exampl shown geometr calcul link interact sequenc input action easi express grab drag interact resembl exampl menu select interact repres state transit diagram portion figur sketch innov interact techniqu type menu develop liang green implement graphic shown figur menu pop sphere command icon posit polhemu sensor held hand primit menu command chosen shell spheric call bat polhemu sensor button primit select rotat menu desir primit enter select cone face hallidai state acm transact vol march jacob al transit diagram show menu activ deactiv button link shown figur sphere highlight select cone move diagram show menu sphere select cone follow posit bat hand sphere rotat bat cone point ey figur action transit show select action transit cone cover menu select hide select menu fairli straightforward reflect power reflect rel infanc area interact techniqu wimp interfac stabil set standard point develop interact techniqu widget rare interfac long type provid richer rang mechan engag commun search set interact techniqu realm begun al ware balakrishnan languag enhanc program wimp widget major practic genuin widget develop program widget current tool difficult plug exist creat incent make exist grow usabl languag facilit invent experi interact techniqu virtual environ implement issu constraint uim implement softwar user interfac manag system written unix silicon graphic perform softwar graphic render separ portion depend independ sgi perform graphic run flavor provid mean draw output screen simpl slider figur graphic run sun unix mr toolkit al commun polhemu tracker main loop read window input convent window perform input addit acm transact vol march dispatch input input variabl event handler recalcul propag output variabl perform scene graph read head call perform render scene graph state diagram interpret base develop previou work constraint solver discuss section constraint solver requir system implement convent digit comput serial input output ultim continu goal provid model user interfac design continu variabl languag design program posit user design aspect interact continu system ultim merg continu portion specif run discret step singl thread main includ constraint solver point user interfac specifi concern level long provid suffici good fundament class uim function encapsul set base class list princip method public interfac discret event handler constraint solver condit connect input devic event variabl connect output variabl screen provid io class variabl variabl user interfac node repres continu user interfac directli connect input devic output variabl class hold code determin recalcul access variabl depend call insid constraint solver routin return set insid solver bodi acm transact vol march jacob al extern routin return recalcul subject time manag degrad intern routin simpli access field trigger recalcul cycl implement variabl divid base class common routin templat instanti class hold data aggreg data type kind tag constructor variabl system make limit inform choic input directli devic output destin devic perform scene semant data share applic semant uim syntact data uim track state user interfac inform intermedi node constant data link enabl disabl static abstract evalu link part connect node function map variabl variabl base constructor add link ad instanc subclass class list link evalu solver run base remov list librari specif kind link provid user subclass link overload evalu routin access variabl syntact avoid overload provid variabl shadow mention section link call respect section implement divid basic function irrespect solver add specif solver implement solver trigger acm transact vol march call variabl complet recalcul dirti node graph static method link satisfi request method condit add enabl disabl condit princip commun path discret continu portion effect graph user input link boolean flag group link turn state link belong number link ad condit add method option condit condit method enabl disabl call user state state transit diagram condit state diagram interpret enter exit make call automat static ih object receiv token discret input inherit class uim send token dispatch method individu instanc user suppli method receiv token respond includ make state set make procedur call applic semant defin state precompil gener bodi method state transit diagram object rememb state state transit diagram instanc variabl object gener token call user interfac read dispatch subclass class receiv input dispatch input discuss detail section subclass provid keyboard event regular window perform acm transact vol march jacob al share input ey ey tracker serial provid feed current time system interact object static abstract updat object produc output variabl propag scene graph inherit io suppli bodi updat method io constructor maintain list instanc subclass static method perform connect input output constraint solver receiv input process constraint ultim gener output variabl discuss input variabl connect actual input devic output variabl connect output screen aspect visibl user interfac basic capabl uim provis extend uim includ addit subclass input devic input half encapsul subclass current input devic commun fed uim discret event continu variabl subclass method separ accommod unusu devic requir schedul read dispatch separ requir period servic devic devic stream data routin drain serial port input queue data process input read devic latest devic data save input gener event dispatch simpli convert token call process event synchron call input destin continu variabl polhemu ey point dispatch input send method input variabl map input devic data input variabl code dispatch method perform set dirti flag calcul constraint solver run note section provis design link reevalu input half interfac world connect continu variabl output screen displai output devic mean acm transact vol march output variabl ultim control data element perform scene graph underli output hardwar continu variabl ultim read discret time frame buffer unlik input perman connect hardwar output variabl differ applic grab object output posit grab object world produc rotat matrix movabl joint object output user provid valu variabl set piec data perform scene graph code simpli call variabl copi element scene graph retain substanti calcul manag schedul simpli copi data final destin object subclass remain main loop perform step repeatedli step english shown method input devic devic shown keyboard ey includ polhemu read system clock section special callback argument read read read dispatch dispatch dispatch special section iter instanc recalcul io iter instanc io call updat method turn trigger recalcul side user interfac head posit render observ routin call variabl trigger constraint solver work main loop written run video frame run frequent acm transact vol march jacob al discuss special provis evalu frequent frame accumul input histori stream input constraint find constraint good element virtual realiti restrict simpl constraint graph simultan solvabl case execut solv execut time constraint written satisfi permit effici mechan turn constraint trigger discret user interfac constraint specif combin addit mechan discret interact incorpor introduc constraint graph express power describ continu constraint view introduc perform penalti compar convent approach leverag improv perform interact formal separ concern desir interact behavior implement mechan user interfac design concentr express underli runtim system perform discret step beneath level tailor speed element user interfac individu constraint constraint comput resourc moment moment separ user interfac describ desir behavior behavior infinit comput resourc link variabl continu portion system declar specif desir user interfac constraint solver requir implement interfac languag point intend independ constraint solver princip contribut model introduc constraint solver world semant make modest demand constraint set execut video frequent acm transact vol march user interfac implement constraint solver discuss briefli intend languag work solver detail current solver integr ingredi approach implement perform characterist implement altern definit link variabl deriv common class exampl run code shown load subclass desir solver note tag link extra inform backward chain implement correct constraint solver variabl perform complet recalcul dirti node graph set variabl set dirti indic link depend variabl recalcul recalcul iter flag clear maximum count break infinit variabl request input full recalcul clear dirti flag solver love lazi evalu algorithm base system hudson smith optim evalu minim set link request love accept cyclic defin relationship previou variabl love find link reevalu evalu correct order link evalu algorithm link reevalu depend love find link mark visit cycl exist algorithm clear dirti flag variabl depend link record fact variabl love add aspect algorithm specif abil turn condit reiniti set hook accommod time manag featur love set user chang constraint graph run time redefin relationship variabl modifi behavior system dynam algorithm data structur remain penalti chang graph desir run time perform benefit case formula simpli express acm transact vol march jacob al solver assum lazi output variabl calcul frame constraint feed directli indirectli evalu frame exampl case straightforward express algorithm assum constraint call fairli state solver mention section support defin instanc subclass call regularli ordinari solver output situat orbit section simpl physic simul involv collid object easier write predict ahead move object write code step simul fix time step scan input stream pattern ey fire token recogn main loop evalu explicitli cycl process frame link process stream input search pattern gestur ey fixat accumul input histori execut input handl handl option callback argument dispatch call dispatch call routin input evalu link experi solver distribut workload comput improv speed design provid ident semant parallel process improv perform shadow system morrison jacob incorpor solver similar featur time manag decim link bodi interfac princip distribut constraint exploit comput power addit workstat solv link variabl faster support collabor virtual world graph automat share workstat updat made workstat make easi implement interfac acm transact vol march user interfac consist singl set state diagram describ input user devic workstat interfac point differ interfac typic refer input user individu polhemu workstat differ refer requir describ interact code interfac refer user specif user role collabor interact versu accommod graph arrai token button mice develop version grab toss grab state transit diagram written user drag user grab state diagram track turn toss user drag user grab user throw catch simpl extens shown figur special code handl multipl input devic launch distribut version system workstat workstat particip calcul call mice perform interfac meet sever perform requir order maintain perceptu virtual requir drive forc design current implement introduc higher cleaner user interfac descript languag perform claim underli model impact penalti paid link constraint event handler technolog straightforward model conceptu simpl leav freedom system manag cpu resourc special tune peculiar vr system simpl homogen system link build optim constraint system underneath provid semant incorpor optim separ concern interfac model optim obtain rough subject impress perform love modifi world figur complex constraint acm transact vol march jacob al make arm point neighbor chain foreground arm run sgi extrem workstat singl run irix perform love grasp foreground arm cursor move rapidli found frame rate call vari subject effect rapid rate maintain input cursor stationari move rapidli condit turn turn turn condit subject instantan scale larger world develop ambiti system base approach morrison jacob shadow combin constraint continu part state transit diagram discret part add enhanc area hierarchi object object entir subsystem defin specif plug larger constraint graph activ deactiv event handler demonstr scalabl develop nontrivi vr world fairli complex world penguin ic requir visual program diagram total line code languag diagram averag state constraint line arrai initi vertic graphic object gener model librari modul devic window handl written anew remain line code modul procedur bodi averag constraint bodi averag complex measur lower code valu gener consid relat work contribut model make interact separ interact continu framework commun intern compon draw exist techniqu separ interact continu discret build thread previou user interfac softwar research discret compon draw research user interfac manag system continu compon similar graph set constraint actual input output acm transact vol march user interfac draw research constraint system hudson smith model abil graph dialogu varieti specif languag describ wimp previou gener user interfac user interfac manag system built base approach bnf specif shneiderman state transit diagram newman event handler hill declar specif frame al green myer sibert al hartson bnf good match program languag batch command mode graphic interfac captur state transit approach modern wimp interfac fit model continu research constraint graphic interfac hill al hudson myer al vander al born languag motiv wimp explicitli support temporari constraint system constraint model describ interact graphic constraint effect graphic anim interfac al gleicher constraint turn event recent work interfac continu approach al approach al robertson address descript interfac continu model discuss interfac syntax set connect rang domain input devic intermedi devic al focu widget found current wimp abowd dix carr al carr al present specif languag separ discret continu sphere line model approach support separ interact continu discret natur desir model modern interact interfac carr express graphic syntax type type connect transmit event abowd eleg formal specif languag describ type specif slider kei strongli differ discret call event refer continu relationship occur discret event cremer al approach combin acm transact vol march jacob al discret event continu data flow program sophist virtual environ automobil drive simul work formal specif area jackson provid formal basi combin multipl specif techniqu describ singl system coher interactor al combin discret state view continu action continu action handl sequenc state transit provid transit state back accept input token hill chatti provid handl parallel input multipl input suit approach base discret event softwar architectur virtual realiti interfac develop feiner colleagu pausch colleagu al green colleagu develop toolkit build virtual realiti system al work concentr architectur toolkit user interfac descript languag ling address interfac virtual concurr dialogu al present softwar model describ program aspect style interact embodi base notion essenc dialogu set continu temporari underli model combin compon continu relationship compon discret enabl disabl individu continu relationship languag separ interact compon framework connect present visual editor languag simpl run illustr applic languag describ interact constraint interact situat love constraint system softwar virtual environ event queue devic poll model slightli write constraint graph small import write code variabl acm transact vol march user interfac constraint express closer maintain relationship input distinct system short case virtual environ closer view situat closer programm express experi exampl show straightforward declar specif interfac design write code maintain relationship handl simpli declar relationship turn desir restrict declar specif hurt make introduct time manag optim design specif virtual environ note area interfac languag specif connect treat separ offlin system import import perform open inventor similar varieti figur show process object model iri inventor import figur make clear research interact attract graphic anim languag interact user aspect interfac integr underli anim system provid paramet input control system connect user action anim paramet lever variabl graph action state transit user interact start stop chang destin user interfac anim softwar lever vr system includ extens geometr physic model contrast typic wimp applic system requir capabl mimic real world simpli physic properti wai fly issu creat delet search facil physic world analog behavior reli analog view physic model similar anim underli physic engin simul engin control provid mean input control paramet physic simul languag good sort ad physic model found vr system acm transact vol march jacob al envisag separ system handl physic simul render geometri handl separ graphic system aspect interfac follow directli physic law turn input simul normal action simul handl aspect follow directli physic law current system explod complex build bigger figur clutter address design defin straightforward set link variabl packag singl input output encapsul electron encapsul set compon reduc set input output pin access editor note encapsul bear oper run compon explod back individu link variabl execut constraint encapsul perform impact function figur simpl candid assembl implement modul replac mode control posit cursor export variabl interchang goal provid model abstract captur formal structur dialogu previou techniqu captur dialogu seek bring cleaner user interfac descript languag construct problem interfac construct demonstr languag implement shown perform acknowledg alan david ying georg eric daniel work student recent electr engin comput scienc depart tuft linda sibert jame naval research laboratori valuabl discuss issu refer integr statu event phenomena formal specif interact system sigsoft eng note acm transact vol march user interfac advanc interfac acm human factor comput system confer companion exploratori molecular visual system interact sequenc acm confer comput graphic aug ed acm specif interfac interact object acm confer human factor comput apr acm interact object graph develop graphic widget tech rep institut system colleg md extend graphic toolkit interact acm symposium user interfac softwar technolog marina del nov ed acm design complet visual program languag visual ed ny rapid prototyp system build virtual environ adjunct acm human factor comput system confer framework behavior scenario control virtual environ acm tran model comput simul drive challeng vr technolog ieee comput graph appl high level framework anim graphic applic acm confer comput graphic juli ed acm world metaphor explor virtual world annual acm siggraph symposium user interfac softwar technolog oct ed acm ma complex dialog acm confer human factor comput system graphic interfac apr carrol ed acm defin interfac high level abstract ieee design implement constraint imper program languag ieee comput societi intern confer comput languag ieee graphic toolkit base differenti constraint annual acm symposium user interfac softwar technolog nov vander ed acm distribut virtual environ research platform ieee symposium research frontier virtual realiti oct ieee nj alberta user interfac manag system comput graph softwar architectur metaphor user interfac comput graph acm transact vol march jacob al geometr model anim system virtual realiti commun acm support synchron humancomput uim acm tran graph rendezv constraint mainten system annual acm symposium user interfac softwar technolog nov vander ed acm rendezv architectur languag construct applic acm tran comput hum interact survei design issu spatial input acm symposium user interfac softwar technolog marina del nov ed acm concept test interact techniqu acm confer human factor comput system ed acm publ sand practic system compil constraint object tech rep visual usabl georgia tech graphic graphic specif flexibl user interfac displai acm siggraph symposium user interfac softwar technolog nov ed acm increment attribut flexibl algorithm lazi updat acm tran program lang syst execut specif interfac acm confer human factor comput system formal specif design interfac commun acm execut specif techniqu describ interact advanc ed ablex publish specif languag user interfac acm tran graph ey interact interfac advanc hartson ed ablex publish visual languag user interfac ieee symposium visual languag ieee comput societi lo interact style devic behav inf tech user interfac manag system comput graph dataflow siggraph comput graph dialogu structur virtual world confer human factor comput reach acm transact vol march user interfac technolog apr ed acm highli interact model system comput graph semant analysi design space input devic interact specif paradigm design implement interact phd dissert tuft ma specif paradigm design implement user interfac acm confer human factor comput system lo angel creat user interfac demonstr academ press perspect comput academ press san ca user interfac softwar tool acm tran comput hum interact vander support user interfac ieee comput system interact graphic program spring joint comput confer afip user interfac commun acm user interfac manag model algorithm morgan san california formal grammar human factor design interact graphic system ieee tran eng extens interfac program acm siggraph symposium user interfac softwar oct ed acm iri high perform toolkit graphic acm confer comput graphic juli ed acm decoupl simul virtual realiti mr toolkit acm tran inf syst grammar relat featur defin interact system ieee tran syst man cybern user interfac manag system comput graph architectur extens interfac toolkit acm symposium user interfac softwar technolog marina del nov ed acm analysi refin interact process formal method harrison ed cambridg modular implement present acm confer human factor comput system graphic interfac apr carrol ed acm visual languag imag process visual lang comput vander integr pointer variabl constraint model acm tran comput hum interact reach object vr lag frame rate acm tran comput hum interact acm transact vol march jacob al tand supervisori methodolog notat system develop advanc ed ablex publish conjunct composit acm tran eng januari januari april acm transact vol march
IR/1437 5 probabilist greg keim michael littman puzzl class depart comput scienc duke north carolina februari probabilist greg michael catherin joseph jason fan shannon karl depart comput scienc duke nc abstract attack problem solv puzzl set clue maxim number word correctli fill analysi larg collect decid open architectur independ program special solv specif type draw idea inform machin learn expert modul gener candid list list merg grid central solver probabilist system common interchang languag subsystem drive search optim solut complet averag word correct letter correct minut puzzl sampl puzzl york time puzzl sourc correspond miss roughli word letter daili make introduct make certainti word truth puzzl attempt daili million requir solver extens knowledg histori popular search answer find set fit grid dual answer natur languag question requir broad search optim set answer make puzzl interest challeng artifici intellig describ comput system solv puzzl perform human exce casual human averag word correct test set puzzl commerci solver publish softwar intend solv good inform test poorli grid fill word describ problem provid insight gain studi larg motiv design choic discuss underli probabilist model architectur includ answer clue suggest expert search optim fit answer grid present system perform larg test suit daili tournament puzzl solv problem solut puzzl set interlock word written squar grid solver present empti grid set clue suggest target pair fruit obliqu base word date clue dozen word averag word sampl clue weve collect solv puzzl assum grid clue machin readabl ignor special format unusu mark solv problem task return grid number clue label grid focu target letter length long target construct string multipl word word empti squar grid part target target larg problem distinct creation al hard solv target exampl clue note target length sampl clue paper complet specif clue puzzl sourc train test york time lo angel time usa todai creator tv guid dell total tabl drawn number sourc gain insight studi larg corpu exist puzzl collect puzzl varieti summar tabl onlin version daili print newspap puzzl york lo angel usa tv onlin site featur puzzl specif produc onlin medium puzzl constitut serv knowledg sourc project novelti human solver improv part clue target tend recur human solver recogn lake common pair puzzl correspond number puzzl encount human rate puzzl dai percentag target clue puzzl present system exist figur graph probabl clue word number element subset rang clue calcul percentag item clue uniqu estim common target eri al target eri puzzl common clue common pair pair clue target novelti clue target clue word figur clue target novelti size expect puzzl pair hood item complet expect pair expect word clue tremend amount inform york time puzzl york time consid daili puzzl editor attempt make puzzl difficulti easi mondai difficult saturdai sundai hope studi trend puzzl provid insight make puzzl hard human tabl show distribut clue type chang dai dai note clue common week clue trail question mark sign theme pun common distribut target length word letter rang common mondai saturdai sundai includ tabl bit outlier partli due fact puzzl larger categori clue common syntact categori shown tabl quot clue structur lead simpl wai answer clue clue oe miss mon tue wed fri sat blank blank singl word final tabl clue statist vari dai week scan text sourc phrase match word boundari letter encount clue return list abbrevi number expert categori stand synonym duck letter movi mutant ant film geographi river music singer literatur charact clue fit simpl solv exist inform retriev techniqu sourc inform brought bear solv type suggest architectur consist collect gener combin result modul gener solut puzzl decentr architectur larg group contributor ten contribut modul techniqu rang gener word list highli specif string match inform retriev section describ modular design architectur figur illustr compon coordin separ clue grid send copi clue list target expert modul expert modul gener candid isol grid constraint expert modul free return candid collect candid list reweight merger differ modul combin singl list candid clue solver weight list search solut find satisfi grid coordin modul merger expert modul clue candid candid merg implicit candid letter dist solver grid solut puzzl figur consist set independ commun program written perl straint implicit distribut modul section probabilist model unifi import understand underli assumpt problem assum puzzl creat repeatedli word slot creator distribut clue cross constraint cross constraint creator puzzl creator draw normal account illeg puzzl gener probabl distribut legal puzzl slot probabl distribut word slot clue solv number probabilist optim problem produc fill grid defin puzzl maximum expect number target common creator maximum expect overlap discuss optim import candid gener establish probabl distribut solut discuss individu modul creat approxim combin unifi final search find good solut optim problem gener step modul gener candid target length modul return confid score answer li weight list answer clue place movi modul rai modul return confid higher weight person show give lower weight cast member note modul gener actual probabl distribut make approxim merg step discuss attempt account error estim test train adjust scale paramet import modul give candid weight control modul exert confid score merger modul predict built briefli contribut major tabl summar perform clue puzzl drawn sourc test ten list measur percentag clue modul guess percentag time target modul candid averag length return percentag clue modul correct answer weight higher modul final statist import measur modul contribut system modul gener word target list gener individu weight target lower assign predictor time contribut modul probabl assign target clue target probabl maxim product probabl assign quantiti directli relat solver maxim figur top line repres probabl assign bigram modul probabl low low hard target add group effect probabl assign target lower correspond assign probabl target note larg due exact match modul notic small segment poorli target modul bigram return probabl assign target clue perform set expert modul bigram model word list exact match transform syntact modul modul inform retriev figur cumul probabl assign modul group ad show type modul make contribut line sort independ introduc extens system rang word list modul modul ignor clue return word correct length dictionari list term wide varieti includ onlin dictionari construct produc combin relat entri includ combin merg adjac word clue million term uniqu target return target clue weight estim probabl target arbitrari clue modul exact match modul return target correct length clue confid base bayesian calcul involv number exact match correct incorrect length transform modul learn set textual transform appli pair gener pair face appli applic transform return weight base previou transform transform includ remov phrase begin end clue ad phrase begin modul guess acc len bigram transform movi writer compass geographi myth music wordnet encyclopedia tabl perform puzzl show differ number target return contribut list measur shown implicit modul end word clue plural list exampl ten thousand transform nice franc prefix short citi capit inform retriev modul clue present interest challeng tradit inform retriev techniqu queri similar length clue return short sequenc queri phrase share word return natur varieti exist ir techniqu document collect encyclopedia modul base index set encyclopedia articl queri comput distribut term queri term text term count time distribut time distanc word queri term term count articl queri term vice versa term correct target length assign score proport frequenc divid frequenc corpu distribut score normal queri multipl score distribut combin linearli log frequenc queri term corpu queri common term partial match standard vector space model mcgill defin vector space dimens word dictionari clue repres vector space word clue compon dimens magnitud clue find clue share word give target weight base dot product clue assign weight geometr interpol base dot product lsi latent semant index extens vector space model singular decomposit identifi correl word lsi successfulli appli problem synonym select standard test dumai close relat solv clue lsi modul train clue target treat separ onlin encyclopedia return closest word clue dijkstra modul dijkstra modul inspir intuit relat word similar word suggest measur base graph distanc select set text modul build weight direct graph set term pair term place edg graph log document document clue assign term score document weight path find highest score term search break clue individu term add score comput dijkstra modul system variant techniqu encyclopedia modul movi internet movi onlin resourc wealth inform manner movi tv show modul number pattern clue quot titl star linda boolean oper lee formul queri local copi varieti form geographi modul simpl pattern match clue keyword citi formul queri topic literari cull onlin encyclopedia resourc geographi inform addit data suppli onlin list synonym distinct synonym base thesauri wordnet al modul root form word find varieti relat word type relev feedback gener list synonym synonym form relat word covert back form origin clue word syntact modul percent clue blank search varieti find clue pattern miss word literari side modul search pattern time fill includ multipl word ran search gener sourc text encyclopedia archiv left final run clue similar clue involv pattern match short phrase identifi cue clue switch merg candid list expert modul gener weight candid merg unifi candid list common weight scheme solver problem similar problem face search engin separ weight return list combin advantag domain readi access abund train data expert modul return weight set candid numer level confid correct target set expert modul set real reweight candid set weight power normal sum multipli confid level product comput combin probabl distribut linearli combin modifi candid set modul weight modifi confid normal sum spread paramet give merger control inform return expert modul incorpor final candid list set paramet naiv hillclimb techniqu object function optim averag log probabl assign correct target correspond maxim averag log probabl assign solver correct puzzl model probabl puzzl solut proport product prior probabl answer slot optim achiev puzzl train set grid fill realiz repetit occur target cover coverag constrain domain extent algorithm find case simplist grid fill yield result measur task left iter weight candid list target top candid list slot algorithm algorithm emploi keim model grid fill optim problem letter intersect establish constraint grid fill cite constraint satisfact problem dont find satisfi set candid fit defin puzzl test suit test attempt maxim expect overlap creator term word correct definit includ maxim probabl entir puzzl maxim expect letter overlap expect word overlap motiv score system human tournament find optim solut problem emploi varieti effici approxim implicit distribut modul probabl measur assign probabl target suggest modul probabl solut target assign probabl letter sequenc list explicitli augment solver reason probabl distribut candid list implicitli repres implicit distribut modul gener addit candid solver give inform letter probabl distribut slot import letter bigram letter sequenc length return letter bigram distribut learn bigram probabl solut modul tightli integr solver note figur clue modul bigram return target run lowest probabl wear target occur occur multipl low probabl letter pair target process probabl distribut letter longer target limit search candid address creat implicit distribut modul implicit distribut modul letter probabl distribut letter slot return weight candid list list ad previou candid algorithm continu process candid happen time solut process modul suggest candid base letter built hope provid model word boundari bigram model mention list term segment segment calcul probabl word sequenc respect letter probabl word probabl sourc dynam program base word probabl unigram word probabl dijkstra modul suggest word current clue weight unigram probabl combin distribut word probabl clue letter distribut combin word segment return top ten note reweight dijkstra modul examin clue relat word boot result evalu ran larg collect daili recent human tournament puzzl daili puzzl test system puzzl daili list tabl tv guid puzzl back sourc august decemb select train puzzl system reweight process train clue puzzl addit debug modif modul evalu train puzzl fix modul reweight ran system puzzl final pool system averag word letter puzzl complet correct implicit distribut figur plot score daili puzzl attempt group sourc split puzzl mondai wednesdai thursdai sundai note effort made make puzzl increasingli difficult week respect perform earlier finer trend mondai data set la ut cs uni daili result figur perform varieti daili puzzl tournament puzzl gaug system perform test puzzl american puzzl tournament held annual attend peopl score system requir time limit set puzzl solver score time number word bonu puzzl complet correct number incorrect letter subtract full minut earli solver finish number multipli ad score puzzl offic time limit rang minut version previou section result puzzl shown tabl human solver competit finish puzzl winner determin finish time champion averag minut competit human score puzzl median human solver contest puzzl includ trick multipl letter word written singl grid target written wrong slot spite fact produc answer bend rule correctli fill word averag implicit distribut modul improv word score brought tournament score work slowli avg rank total time tp tp jj mf mb tabl compar elit human contest line theoret score solver puzzl minut solv puzzl present uniqu artifici intellig demand competit system broad world power constraint speed widespread system design larg number exist puzzl test tune human compar success solver requir artifici intellig idea probabilist constraint inform machin learn natur languag process found probabl theori practic tool organ system improv perform level success year depend extrem fast comput vast memori disk tremend amount data machin readabl form time ripe resourc attack problem deem challeng ai acknowledg receiv guidanc member duke michael mark robert fred steve alan donald robert sam steve william made contribut refer search lesson learn puzzl eighth nation confer artifici solut latent semant analysi theori induct knowledg psycholog review introduct onlin lexic intern journal lexicographi introduct modern inform retriev constraint satisfact probabilist prefer variabl valu submit ed american fawcett
DB/1438 3 altern abstract move sensor zimmermann comput scienc depart southern california lo california abstract move sensor refer emerg class data intens applic impact disciplin scienti applic consist xed number sensor move produc stream data function time requir system match stream store stream retriev relev data speak impair individu util haptic glove translat hand sign written word glove consist sensor di erent nger joint sensor report locat valu function produc stream data stream match repositori stream retriev english charact word contribut studi fold introduc framework store retriev data framework advoc physic data independ investig altern storag retriev data support queri process quantifi tradeo altern empir data robocup soccer match categori subject descriptor spatial gi storag composit structur research fund part nsf grant contract nr darpa usaf agreement nr unrestrict gift intel sun introduct applic involv move object sensor pose numer challeng inform retriev commun move object applic store spatial coordin object chang posit time applic includ queri locat car plane time interv challeng investig recent studi model larg data track posit object time present store instanc object time locat shape result larg grow continu chang object car gp devic studi techniqu track current predict futur posit move object reduc target data set size move sensor applic collect data sensori devic move environ sensor robot surfac devic insid human bodi perform remot applic class constitut focu studi share common characterist move object uniqu featur number sensor applic xed lifetim sensor ad remov infrequ data sensor provid context sensor data sensor convei inform sum piec multipl time independ movement singl sensor unlik car gp analyz sensor frozen time frame short time import queri applic move sensor american sign languag asl gestur languag hundr thousand north american primari mean commun machin recognit asl research hidden markov model classi cation cluster techniqu studi approach recogn sign approach analyz haptic data gener haptic devic cyberglov worn individu sign model cyberglov consist sensor sensor system report hand coordin space number sensor xed small recogn sensor analyz collect robocup robocup annual robot competit team autonom robot compet environ soccer robocup data autom analysi data signi problem pattern recognit system robot repres move sensor xed environ framework captur characterist move sensor facilit queri process present section environ consist ball player collect sensor analyz identifi team side posit statist analysi avatar order produc realist anim model human environ sensori devic video camera track capabl monitor captur real human movement project lucent present siggraph support teleconferenc low bandwidth commun research comput graphic track featur point util avatar anim contribut studi fold present framework applic advoc physic data independ softwar focu lowest layer framework investig altern approach repres data produc move sensor evalu physic implement approach data robocup soccer match elabor addit trajectori model emploi move object conceptu term group sensor time instanc demonstr section improv time queri type studi logic store move sensor data emploi singl tabl encapsul chang posit multipl sensor time row tabl denot data pertain singl sensor time instanc unit emploi singl tabl column row correspond sensor time instanc closest exibl trivial introduc sensor environ sensor data object data subject data task data reason context resolv ambigu transform procedur transform procedur transform procedur figur hierarch framework repres move sensor signi import class applic constitut focu studi construct tabl sensor row tabl speci sensor time instanc evalu consid altern index structur design enhanc queri process time unit index version closest model index version strive cluster trajectori inform extrem version approach result reveal unit superior queri involv short time interv sensor ecient evalu unit opposit type queri choic depend workload avail cheap mass storag store data redundantli runtim process speci queri remaind paper organ section outlin framework repres move sensor section describ altern approach repres move sensor section robocup applic demonstr tradeo unit section er futur research direct framework framework repres move sensor base layer architectur figur show di erent layer framework di erent layer start bottom layer abstract physic sensor relev target applic start descript layer describ robocup demonstr layer describ transform procedur facilit data exchang layer sensor lowest level hierarchi describ data produc sensor data depend input devic preprocess featur extract store data tabl relat manag system number column equal total number sensor er devic row repres sampl collect function time sensor veloc explor altern repres sensor tabl row describ applic speci algorithm lter level reason layer devic gather data queri data low level data express vocabulari vocabulari applic intuit user index nger angular sensor greater automat cluster classi cation algorithm perform present abstract scheme futur intend investig richer improv perform classi cation system studi object de ne set point region set standard predic oper appli point predic includ pass oper includ good descript predic data provid object de ned level speci ed applic interest collect data human relev object includ posit angl joint data approxim sensor data concern set robocup soccer plai relev object posit orient robot angl robot goal object found level base featur scheme neutral respect predic oper neutral respect devic posit coordin object determin sensor method asl previou obtain physic data independ advantag work level basic common denomin task devic independ predic oper gener independ physic input devic applic built data level descript portabl reusabl subject asl inform term speci human hand spoke object index properti extens speak term goal stand contrast object data level queri formul gener object touch object term index nger order pose queri user ne taxonomi term map term featur lower level term map object repres posit higherlevel comput posit characterist object programm speci es function automat solut base machin learn user present exampl predic classi cation infer gener rule determin predic advantag work high level abstract correspond human problem hand sign recognit tutori sign languag express instruct term amen level imagin sign languag tutori work low level term object data hope show level abstract raw data machin learn bene featur extract task previou level made formul queri hand level gener speci sign easili applic virtual surgeri fourth nal level user formul queri speci task sign languag user sign virtual surgeri teacher queri medic student made queri provid greatest user unfamiliar speci cs abil formul queri lower level abstract taxonomi term predic de ned high level deriv rule connect lower level abstract speci ed hand kind emploi hope highli structur natur scheme enabl pattern recognit simpl tradit approach classi cation perform data robocup soccer framework target applic section demonstr power data hierarchi robocup soccer applic task data queri describ gener featur entir eld singl player robocup team game tighten relev queri event team score achiev rst step queri queri subject level queri rewritten event team score formal goal goal subject data requir decomposit de ne true robot team closer team bs goal robot team goalkeep time de robot exist robot distanc distanc team bs goali de nition permit goali closest player goal note case perform deriv subject task data pattern recognit techniqu distanc predic deriv object data gener appli type speci robocup decomposit part queri object data level trivial decomposit goal occur level subject interest time goal score pass queri sensor data pass true time intersect time insid null pass de ned term object data queri intersect de ned directli examin sensor bring back level sensor data distanc predic de ned directli term sensor data transform procedur transform procedur gener higher level predic sensor inform import issu user framework procedur case goal score predic insist player ball left obviou addit condit model time sensor id figur easili handcraft user procedur complex analysi requir posit valu angular sensor case requir automat pattern recognit algorithm recognit asl sign subject data describ con gurat hand case futur hope build system support user transform data level hierarchi present conceptu design construct store retriev move sensori data conceptu sensor data section outlin approach repres move sensor data lowest layer hierarch framework central idea encapsul data deriv xed number move sensor lead orthogon conceptu term frame base trajectori base frame base captur data sensor sequenc frozen time frame time frame cube describ sensor data figur illustr trajectori base captur data sensor time illustr solid line point line repres posit sensor time figur illustr trajectori base base conceptu logic bin base relat model obviou choic creat singl tabl row sensor time instant result multipl row sensor time term multipl encapsul figur illustr group move sensor construct index structur minim number disk requir process queri investig index composit kei consist sensor discuss task data layer layer applic speci figur sensor di erent time frame posit repres dimens sensor id pair figur sensor id id posit repres dimens sensor label line time analyz emploi sensor rst portion composit time rst portion composit kei cluster inform sensor cluster inform time frame figur illustr correspond frame base correspond trajectori base experi section informix dynam server implement con rm detail implement composit index structur result support intuit cluster behavior consid scenario singl index time sensor id altern outperform discuss consid index sensor coordin time attribut perform drastic id implement intend investig index structur part futur research studi exibl attribut index de ned complex data type compar short result queri process time sensor easili simpli involv ad remov tupl tabl result redund assum sensor move emit inform independ sensor move stai time tupl move sensor append sensor move emit inform collect cyberglov time tupl ad sensor unit applic sensor move captur inform sensor time instant singl object unit encapsul inform object time singl tabl figur illustr unit set move sensor individu row tabl data sensor time instant abstract inform sensor object close resembl frame base conceptu index time attribut ensur ecient retriev object tempor queri unit exibl sensor involv column tabl larg number sensor result larg tupl impact queri time drastic move sensor applic deal small xed number collect unit superior altern tupl ad posit singl sensor assum sensor sensor id time time sensor id figur index time figur unit result great deal redund applic consid paper categor class move posit valu sensor chang time unit collect inform sensor time instant queri time unit expect low result verifi fact move sensor class applic major queri probe sensor collect short time interv bin inform relat sensor time instant separ tabl approach creat bin repositori inform studi base bin approach hold inform sensor singl time instant move sensor set tabl depend number discret time instant close resembl frame base conceptu data sensor time instant tabl gener class move sensor applic deal larg number time frame render approach impract due extrem larg number tabl creat move sensor applic hold inform time sensor set complet tempor evolut sensor idea abstract inform sensor trajectori base conceptu feasibl gener class move sensor applic small number xed sensor figur show group sensor cient retriev data index data index time attribut tabl time posit time posit figur updat oper simpl involv append tupl bin similar sensor move independ bin queri sensor complic write perform multipl join oper involv experi sake complet perform evalu experi perform sun sparc server dual chip gigabyt run solari implement informix dynam server datablad spatial extend robocup data dataset consist log le robocup domain log le preprocess broken separ data le ball averag size data le roughli kilobyt data le includ frame repres tenth preprocess store ve attribut time player game state size data roughli spatial granular angular granular queri perform cost queri refer conjunct disjunct predic perform rang combin di erent sensor perform consid conjunct predic refer sensor time consid queri stand denot rang impli rang predic act identi es exact match elimin queri low select sensor provid compar perform queri pertain possibl queri team side time frame defend goali box prior score ball team half court interv time player team unit distanc goali team note queri queri type detail queri result conduct experi queri result shown queri averag run conduct di erent time instant sensor prevent distort result due cach previou queri result coecient varianc run show independ result speci run queri type unit queri queri queri queri tabl time queri shown tabl queri perform signi cantli unit queri evalu examin sensor singl time frame discuss section cluster sensor time frame show fairli good time queri queri unit execut time faster queri unit show time improv time compar queri involv rang sensor rang time instant approach fail queri prohibit cost join time rang multipl tabl queri perform signi cantli queri evalu examin singl sensor time frame unit approach fairli good time queri show time improv time time rang rang time unit figur impact vari time rang time unit conclud unit model suit move sensor applic consist perform spectrum queri con rm tradeo exist size unit number time synthet number sensor conduct test unit entir spectrum queri exact sensor rang time rang sensor figur show tradeo exist number sensor time result show unit superior queri select examin sensor valu time instanc superior queri select examin sensor valu time figur depend number sensor time rang system design unit intend develop analyt model consum queri constitut workload system unit direct paper report preliminari investig move sensor primari contribut framework build layer architectur investig approach altern repres sensori data perform result demonstr tradeo unit approach superior queri evalu examin sensor singl time instanc short approach superior queri evalu examin sensor time instanc mix approach store data redundantli render intend extend work direct plan design physic layer unit setup implement top ultim goal build directli page underli le system frame unit consid disk block bene background design continu media server order place schedul frame block plai back record haptic experi page disk block incorpor directli node spatial tempor index structur cluster cluster sensor reduc number disk improv perform demonstr pattern recognit techniqu bene structur hierarchi data appli pattern recognit techniqu attempt recogn high level inform directli sensor hope improv speed accuraci pattern recognit specul hierarchi collabor approach human design transform rule autom algorithm improv approach make easier human understand result futur bridg gap user semant queri raw sensori framework user prefer queri environ subject human percept plan build previou work incorpor human percept queri imag refer rist gener multimedia present robocup soccer game technic report german research center arti cial bishop neural network pattern recognit oxford manag time approach recent advanc tempor page zimmermann analysi cluster techniqu detect hand sign intern symposium intellig video speech zimmermann altern abstract move sensor technic report southern url vazirgianni data approach model queri move object pentland track interact anim face head input video ieee comput schneider data model data structur move object acm sigmod intern confer manag schneider data model data structur move object acm sigmod intern confer manag ghandeharizadeh shahabi distribut multimedia system john wilei encyclopedia electr electron engin john wilei son ch vazirgianni foundat repres move object acm transact robot world cup initi intern confer autonom agent acm jy ty kim construct realist head anim mesh speci person technic report southern url american sign volum duan spatiotempor data model tempor analysi geograph data intern journal geograph inform page marsella autom team machin learn approach intern robocup competit zimmermann challeng manag data gener environ intern workshop multimedia inform system indian octob zhang altern techniqu ecient acquisit haptic data acm sigmetr june nam soft queri imag retriev system spie internet imag electron imag scienc analysi haptic data sign languag recognit intern confer access august dao model queri move object thirteenth intern confer data april birmingham page starner pentland visual recognit american sign languag hidden markov model intern workshop automat face gestur hadzilaco logic data model spatio tempor de nition model intern engin applic page vogler metaxa adapt hidden markov model asl recognit comput vision method ieee intern confer man chamberlain move object track sigmod acm sigmod intern confer manag june page
ML/1439 6 int conf data knowledg system manufactur octob az reason approach learn control glasgow dept comput scienc dept comput inf sci toronto queen ontario ontario abstract paper describ applic reason system control task robot differ previou method approach greater flexibl improv accuraci perform success robot manipul smooth high repeat major drawback tendenc limit repertoir movement extend costli kinemat calcul direct teach approach start limit repertoir increment add posit higher flexibl architectur evalu real world albeit result compar machin learn algorithm appli problem learn control flexibl kinemat task research support inform technolog research center ontario author indebt john mylopoulo comment suggest introduct robot control studi past decad start simpl posit control serial link field diversifi sophist control adapt control learn control control system capabl rememb repeat oper call learn control system learn process number solvabl task acquir improv effici solv repeat task current applic machin learn robot orient perfect control process learn control system endpoint move geometr constraint describ iter learn system track control converg architectur reactiv system system robot control combin subsystem rapid reaction planner handl unanticip learn mechan construct rule cover situat system increasingli time plan requir machin learn compon acquir control rule candid system acquisit control knowledg system learn qualit model system base select creat increment control system sin system improv reactiv control system autonom robot navig system base techniqu reinforc learn learn modul monitor system increment modifi case accommod util problem sin system case real time perform learn control system incorpor reason system approach reli concept similar problem similar solut face base system retriev similar case store case base adapt fit problem hand evalu system paper evalu system suggest reason architectur robot domain improv manufactur flexibl system similar architectur acquir knowledg time improv control compon differ form acquir knowledg construct acquir episod knowledg similar system techniqu case base sin consist analog inform hard explain retriev knowledg limit applic small case base case easi explain system larger case base sacrif perform case solut feedback evalu solut control system loop result appli solut reason involv process accept problem descript case solut client part retriev relev case case base problem similar adapt retriev case fit problem hand produc solut reason similar case adapt solut task measur case relev retriev highli relev case retriev fewer case retriev relev case result poor solut cbr system optim modul underli perfectli accept cbr modul produc approxim result optim flexibl relev measur scenario model system desir relev assess retriev relev case core part system theoret basi system introduc subsequ section definit provid case sophist knowledg scheme impli power reason system complex knowledg difficulti knowledg acquisit order automat increment acquisit requir real world robot system simpl case sourc case real world episod kinemat task problem desir posit end effector solut set joint angl case repres finit set pair fa pair sourc case store persist storag case cb fc input case input special sourc case describ problem full subset attribut defin valu compar case case case equal case attribut valu case equal valu case case equal match problem assum solut context partial equal exist subset attribut valu case match subset valu case order control partial match defin context goal retriev exact match partial match context paramet relev relat map case base set relev term case context control consid partial match defin finit set attribut constraint attribut cv cv cv attribut constraint cv specifi set valu attribut context specifi import attribut attribut order consid match context varieti rang complet ignor valu consist valu valu section demonstr flexibl retriev specif simpl method queri context chang support dynam similar function obviou select method context scenario creat initi context depend actual implement robot initi context human base task solv simplest complet input case map cv problem coordin characterist robot initi context subsequ chang automat context explain sequel machin learn knowledg mine algorithm select import attribut task characterist valu inform initi context specif specif context modif strategi case satisfi denot pair cv exist pair cv iff cv cv assum case servo data motor screw rise time context specifi motor screw import valu case match valu attribut consid relev approach chang context dynam gener hierarchi constraint context automat context domain knowledg constraint cv call gener constraint cv denot cv oe cv cv subsum cv cv cv cv cv cv gener cv attribut cv call special attribut cv denot cv oe cv hierarchi case servo domain obviou gener attribut lead enlarg number retriev case case satisfi special context lead number case satisfi definit relax restrict context control number case return retriev process restrict iff cv cv cv cv restrict relax domain descript test data base previou definit defin type context relax restrict context modifi number attribut requir match cardin modifi attribut valu cover situat initi constraint made attribut restrict perform opposit make attribut constraint specif context formal present express initi fv oper modifi context cardin initi match requir attribut requir attribut initi set arbitrari make chang input paramet function explicitli assum note rang valu make substanti smaller match criteria defin experi present show set result ratio correct incorrect answer previou servo case cardin relax mean requir attribut match case motor screw attribut match relax motor valu similar similar consid relat case defin supplement partial match order control level match context part similar relat case similar case satisfi context case satisfi context treat context assum case problem descript solut similar relat case gener relat set case assum set case base cb relat state case set sc cb consid similar relev request retriev case consid relev similar queri respect context case relev request treat system base theori relev assess introduc reason system design implement architectur system present figur individu compon sequel cb gener cb gener gener case base persist storag case main gener case gener case uniformli work gener case learn observ process approach learn method approach onlin method method discuss detail studi section main idea learn support case base retriev adapt case process problem solut evalu feedback case base gener input process output figur architectur flexibl addit learn issu determin knowledg learn retriev compon base problem retriev compon locat relev case case case similar problem theori relev measur base similar assess servo case problem descript includ pair retriev algorithm figur locat case match problem descript subsequ adapt modul predict rise time attribut algorithm simpl input case context modif chang initi context algorithm index cluster improv search perform show major improv retriev input cb retriev mark match continu end return match case end figur naiv retriev algorithm ffl increment view mainten algorithm context ffl induct learn knowledg mine techniqu retriev process desir exact match close match retriev note attribut equal import match attribut prefer retriev process depend applic domain task retriev algorithm flexibl chang import individu retriev highli relev case problem solv task chang servo data motor screw attribut import locat case relev predict rise time attribut contribut partial match case pair problem match case case motor screw relev partial match case base attribut import switch import simultan import attribut perform human expert stabl domain support predefin profil individu task note profil encod human expert learn machin learn knowledg mine techniqu relev case retriev case initi system automat modifi context appar context chang relax system reevalu queri naiv approach queri submit system sophist approach advantag process queri increment modifi result increment approach successfulli system view mainten increment approach substanti effici naiv effici improv visibl consecut queri iter larg case base small updat queri gener produc small queri result local queri requir increment approach basic idea increment comput store queri result similar queri similarli number attribut case significantli smaller number case increment context outperform recomput answer scratch support type increment context partial result attribut partial result categori level obviou approach pose requir storag versatil suitabl case base frequent context modif fewer attribut case approach perform gain increment approach modest storag requir approach frequent context case base case attribut naiv increment algorithm present figur naiv appar iter context modif requir algorithm evalu increment approach requir algorithm evalu match case includ sc set obtain evalu sc part eval function function evalu initi evalu retriev naiv partial match result store sc retriev input sc exist attribut gener sc ij cb continu end sc sc return case sc end figur increment retriev algorithm partial result partial result exist case sc sc part sc cb number case partial result partial result attribut sc ji sc number attribut idea increment context relax restrict base differenti queri determin part context affect part context relev chang affect part recomput attribut remov chang chang sc part sc part sc part sc jp sc sc sc jn sc sc sc categori relax sc part sc sc sc jn sc sc sc mean attribut categori match cardin restrict perform ad attribut context restrict relax base principl adapt modul adapt modul relev case input produc solut problem output current case automat adapt form weight averag attribut valu retriev case retriev case order relev give relev case highest weight averag desir attribut time rise servo comput domain automat adapt exist complex attribut valu domain specif adapt rule improv accuraci provid domain knowledg possibl improv adapt result current modif context case modif plan movement relev case retriev discard base inform previou step discard case similar descript solut evalu compon evalu compon consid produc solut gener underli problem solver kinemat task solver path part system user train phase dispar case base context modif strategi updat order prevent inaccur solut futur process ffl relev case produc solut solut problem solv mean store ffl retriev case solut adapt strategi modifi case longer relev situat note concept hierarchi adapt automat perform principl section perform evalu real world domain report evalu predict rise time term gain set choic mechan linkag servo predict joint angl angular robot desir coordin robot case studi case studi servo data servo data publicli data set creat karl ulrich mit due avail test machin learn servo data cover extrem nonlinear phenomenon predict rise time term gain set choic mechan linkag knowledg base servo data case base case attribut attribut attribut valu motor screw rise time real number creat servo data case simul servo system involv servo lead slide case creat problem solv store pair case base gener observ output servo system simul repres time requir system respond step chang posit set point rise evalu retriev function servo data complex term number larg term number interest involv continu class predict machin learn algorithm evalu compar respect tabl summar result version servo machin learn obtain simpl averag random trial error trial determin remov random case case input predict rise time obtain compar actual determin predict error method averag ab error rel error guess regress model tree neural net model servo servo tabl domain absolut rel error predict rise time result obtain simpl averag random trial relax strategi obtain result servo motor attribut relax left side relax servo result obtain relax strategi motor attribut relax direct relax note relax scenario situat initi relax yield addit method cardin relax motor screw cardin relax perform error comparison perform evalu system suffici gener data present tabl inform confid inform error confid interv statist evid miss comparison present tabl conduct statist evalu result present tabl averag ab error rel error method confid confid confid confid servo servo tabl domain absolut rel error predict rise time result obtain simpl averag random trial retriev strategi confid level interv tabl show advantag option relax constraint attribut servo obtain accur result compar servo statist confid observ trial suffici confid reason small confid interv averag trial case studi robot data robot data cover extrem nonlinear phenomenon predict joint angl angular robot desir coordin kinemat angular robot robot larg work area figur task robot paramet creat case base criteria distribut due practic natur data avail object relev similar task test machin learn algorithm past task kinemat comput robot joint angl ensur coordin reach desir complex task intract complex system figur spheric angular robot system complex number robot arm addit solut kinemat task method approxim solut constraint task approxim method includ fuzzi neural net control search space limit energi maxim speed maxim accuraci exist small robot robot paramet present tabl denot length link rang joint angl tabl robot characterist robot joint angl link equat comput coordin forward kinemat sin sin sin kinemat comput necessarili yield solut complex kinemat structur analyt solut optim criteria defin comput possibl previou knowledg comput increment current posit equat kinemat obviou kinemat task plan robot point move point usual task follow curv process kinemat comput fast simpl store solut reason reason perform achiev easi movement repertoir knowledg base robot data data set case attribut attribut attribut mean attribut valu coordin float coordin float coordin float length link float length link float length link float base angl float shoulder angl float elbow angl float coordin frame float knowledg base creat case uniformli distribut work space robot learn reason answer situat possibl gener case gener main reason repres real world rare random move robot arm work space possibl actual case robot perform normal task problem approach requir oper work space repres evenli case system work similar situat observ perform degrad chang robot task gener knowledg base extend learn gener knowledg base gener adapt retriev case learn provid experi recenc inform defin prefer exist case inform grace task extens chang evalu retriev function system evalu vari size case densiti individu distribut individu case adapt techniqu vari relax process evalu simpl comput interv varianc averag random trial tabl robot cardin relax attribut requir similar approach present yield analog result accuraci improv robot relax relax attribut fail cardin relax perform interest note robot outperform robot domain independ relax method averag ab error rel error method robot robot tabl robot domain absolut rel error predict joint angl result obtain simpl averag random trial confid interv summari case studi control task robot domain appli system predict knowledg mine medicin charact recognit support softwar iter intellig retriev domain characterist perform evalu present measur robot result accur deliv real time time constraint manufactur process demand fast accur result factor affect size case size case queri complex strategi consid averag queri vari case base size strategi comput time requir perform consecut context modif queri case base size compar naiv increment algorithm show consecut context modif requir applic naiv algorithm naiv approach requir cb evalu contrast increment algorithm evalu produc sc part subsequ context modif handl increment result assum size initi retriev result sc part implement sun workstat present experi obtain sparcstat ipc memori substanti smaller case base size cb produc sc increment significantli effici categori affect context recomput categori affect local handl recomput present section note naiv increment algorithm improv index avoid access case case simpl issu scope paper figur show relax restrict depend case base compar standard increment approach relax cardin relax restrict cardin restrict result compar result medic charact recognit domain normal logarithm scale cost cost ln figur cost retriev context modif present result support claim increment context manipul effici naiv approach perform improv case base size case attribut subsequ context modif requir simpl retriev base consecut context naiv approach due smaller memori requir result experi suggest viabil approach learn control kinemat task experi motiv work robot path system select path robot base task definit creat sequenc valu joint angl order fulfil task approach control suitabl task situat repetit system gain experi time success robot manipul smooth high repeat major drawback tendenc limit repertoir movement extend costli kinemat calcul direct teach approach start limit repertoir increment add posit greater flexibl combin learn reason system offer perform flexibl present evalu show fairli high accuraci achiev cbr control applic requir higher combin cbr approach approxim solut optim produc accur solut feasibl case base gener answer big case base tradeoff speed case distribut case uniform distribut random distribut complex robot configur combin cbr approach optim techniqu includ complex robot architectur kinemat subtask part task path plan refer swami perform perspect ieee transact knowledg data oper fo robot learn journal robot aha salzberg learn appli nearest neighbor algorithm dynam control task cheeseman select model artifici intellig statist gambardella iter learn control theori robot manipul ieee journal robot effici updat materi view page mark increment comput queri express ieee tran knowledg data sn balakrishnan literatur survei mathemat comput ceri widom deriv product rule increment view mainten page griffin libkin increment mainten view duplic proc acm sigmod intern confer manag page san ross adapt materi view redefinit proc acm sigmod intern confer manag page san greiner aaai fall symposium seri relev aaai jantk nonstandard concept similar reason proc annual confer gesellschaft fur springer verlag tj ch hs ahn iter learn control feedback system glasgow appli reason control robot robot system st glasgow classif retriev ieee intern confer tool artifici casper reason predict knowledg mine ai medicin special issu cbr shapiro comput model reason st conf american societi reproduct retriev relev page extend version tech report intellig retriev advisori tool acm confer societi futur retriev tool softwar repositori workshop ai softwar break induct learn reason canadian ai workshop induct support flexibl reason approach aaai fall symposium flexibl comput intellig kolodn reason morgan process control machin increment control ieee tran automat minton quantit result util learn proc page st publish journal artifici page mitchel increasingli reactiv proc workshop innov approach schedul san mylopoulo partit inform base context int conf cooper inform learn control robot task geometr endpoint constraint ieee tran robot ortega inform dna promot sequenc domain theori journal artifici intellig research note quinlan learn continu class proc australian joint confer page quinlan combin learn proc intern confer machin ram santamaria continu reason proc workshop histori robot control research intern journal japan societi richter adapt control robot arm driver program artifici intellig sg neural network robot control artifici intellig industri control robust motion forc control constrain manipul learn
IR/1440 5 inform manag web intellig web intellig defin process scan track inform world wide web gain competit advantag paper describ system flexibl organ competit intellig transform raw url return internet search engin person inform portfolio foci build inform portfolio gather organ inform prefer method call user person portfolio term content inform structur person portfolio track inform organ folder show sampl session foci illustr user creat person inform portfolio prefer system discov inform group organ familiar inform userdefin theme introduct competit intellig refer process analyz extern environ gain competit advantag includ inform factor manag strateg make wide acknowledg increasingli riski busi competit intellig softwar industri invest resourc produc busi competit intellig product estim sale busi intellig competit intellig softwar reach billion web refer process analyz competit inform world wide web compani intellig cycl consist plan publish inform human intellig analysi report inform ci refer publish inform collect secondari sourc human intellig collect primari sourc import publish inform collect dai digit ag amount inform continu onlin challeng tap organ massiv amount inform action knowledg report popular internet search tan kent ridg digit lab singapor retriev document search queri organ search result sophist tool northernlight organ search result automat gener folder facilit navig typic cluster system user control inform organ inform cluster gener match requir internet search tool gather intellig manual compil materi prefer inform updat frequent paper introduc system call foci flexibl organ competit assist knowledg worker perform competit intellig web foci bridg gap raw search result person competit inform portfolio provid integr platform support kei activ competit intellig cycl foci construct inform portfolio gather organ inform automat gener folder inspect inform modifi structur requir prefer suit cluster manipul function interact process discoveri user turn automat gener cluster structur prefer organ person achiev method cluster incorpor prefer inform cluster system person portfolio constantli updat track organ inform automat portfolio function publish share user system environ publish competit inform web rest articl organ section present foci architectur descript main compon section present kei enabl technolog foci section illustr foci track exemplari inform portfolio final section summar conclud fig foci system architectur ii foci system architectur refer figur foci inform gather modul retriev integr onlin inform content manag modul organ person content mine modul analyz inform content publish modul share user interfac modul graphic visual user interact briefli describ kei function support competit intellig cycl inform inform gather modul user build inform portfolio send search queri major internet search engin searchabl integr search result return user insert link document found search result portfolio directli automat track function monitor select set onlin sourc updat portfolio content period content content manag modul host util user organ manag competit inform prefer manner templat provid organ inform predefin section domain inform technolog recommend templat organ competit inform event coupl automat cluster foci set person function split cluster addit function includ annot delet portfolio content content mine modul extract kei attribut raw inform content transform intuit format inform discoveri kei analysi function includ topic trend link associ due space content mine scope paper content content publish modul handl permiss control individu inform fig screen shot foci portfolio user elect portfolio public access view support present portfolio level detail foci server run unix solari workstat version system user interfac base servlet dynam applic access internet explor version figur screen shot foci action iii cluster cluster system inform cluster engin cluster inform base user interfac modul displai inform group obtain user person modul modifi cluster knowledg base store cluster structur person modul work conjunct inform cluster engin incorpor user prefer modifi automat gener cluster structur adopt vector space assum unit inform encod inform vector user indic prefer group encod prefer vector user interfac modul person comput user influenc organ inform vector form inform group indic prefer prefer vector user perform wide rang cluster person includ split inform cluster custom cluster structur store cluster structur knowledg base retriev stage process inform base person cluster inform organ prefer captur previou session inform info cluster system cluster structur knowledg base person modul user interfac fig cluster system cluster engin user inform cluster engin present paper belong class predict network adapt reson associ map learn inform group cluster dynam encod pair inform prefer vector natur extens famili learn adapt reson theori incorpor supervisori prefer signal compar tradit cluster advantag onlin increment critic requir support interact person discoveri process system visual overlap adapt reson theori modul consist input field categori field art modul art categor binari analog art modul art art fuzzi art categor binari analog pattern fuzzi base fuzzi art foci field activ inform vector field activ prefer vector inform cluster creat learn synchron cluster inform prefer vector recognit node cluster learn encod pair templat inform vector templat prefer vector wb encod inform vector adopt approach repres document perform content aggreg estim content page base inform provid search result page return search engin load origin addit keyword titl descript make url address provid meta inform web page featur field featur field categori field fig adapt reson associ map architectur document deriv inform vector ai total number keyword featur select document set filter stopword function term frequenc number time keyword wi document document ratio comput document frequenc denot number document wi number document collect term weight scheme advantag keyword approxim half document collect encourag compact cluster structur inform vector normal ai ai ai term ad featur valu enhanc ai ai encod prefer vector user form theme label assign user individu document cluster label user store label tabl label encod prefer vector bn wi bi wi entri number label tabl label found label ad tabl dimens prefer vector updat tabl algorithm cluster inform set inform predefin cluster structur load network initi network loop inform item deriv inform vector base deriv null prefer vector present learn record index cluster encod stabl cluster algorithm inform cluster summar tabl predefin cluster structur system load network cluster network creat cluster unit inform pair vector present inform vector null vector ei inform vector system search cluster encod templat inform vector wa closest inform vector choic function check templat inform vector select categori match inform vector match criterion templat inform vector cluster modifi encod input inform cluster reset system repeat select cluster match found cluster creat cluster complet set inform cluster creat templat vector specif threshold predefin cluster fuzzi organ inform cluster structur predefin network reduc pure cluster system selforgan inform base similar inform vector inform group control vigil paramet person oper insert mode pair inform prefer vector insert directli network learn mode cluster obtain cluster assign inform insert mode enabl comput user influenc cluster creat indic prefer form prefer vector vigil paramet set ensur user prefer explicitli encod cluster structur creat cluster node encod input inform prefer vector insert event input inform vector ident templat inform vector exist cluster mismatch templat prefer vector input prefer forc templat prefer vector equal input prefer vector person favor prefer directli user present algorithm perform cluster person function label inform cluster associ cluster label theme user specif inform group interest user inform found readili futur inform organ futur inform group associ cluster label simpli insert prefer vector repres label reflect interpret group landmark user navig locat inform ad inform cluster user defin insert cluster network inform organ inform group insert cluster reflect prefer group inform default slot organ inform insert pair inform prefer vector deriv base kei attribut inform cluster cluster label cluster structur cluster inform vector addit cluster gener process delet inform cluster user delet cluster associ trash label inform delet cluster handl separ hidden user trash cluster serv filter remov unwant inform similar content futur delet cluster pair templat inform prefer vector insert cluster wa templat inform vector cluster deriv base trash label merg inform cluster merg cluster user combin inform group gener cluster common theme merg cluster algorithm deriv prefer vector encod label vector pair jn insert time templat prefer vector cluster modifi encod common theme split inform cluster split cluster user reorgan inform deem smaller cluster specif theme split cluster user select number inform item cluster pivot algorithm deriv inform prefer vector inform vector bn prefer vector deriv cluster label ln insert vector pair individu inform origin cluster smaller cluster depend similar iv experi illustr foci track specif topic interest user show person function creat person inform portfolio demonstr person portfolio serv templat track organ inform cluster inform portfolio creat integr search result internet search engin illustr constrain size portfolio select top hit search engin remov duplic hit figur depict cluster result base combin keyword featur keyword templat inform list order import inform promin document person base raw cluster structur section illustr user cluster manipul person portfolio figur show partial person portfolio fortun cluster articl fortun site label theme fortun number cluster creat theme technolog document cluster origin knowledg cluster figur cluster keyword refer cluster keyword keyword list fig cluster creat foci base document collect internet search engin fig partial person portfolio text mine ibm manag pull link ibm busi mine page buri cluster emerg group discov websom cluster link websom relat inform figur show exemplari fulli person portfolio number split merg cluster oper perform organ cluster theme portfolio combin organ scheme inform group sourc natur content horizont group technolog organ inform subfield relat topic text knowledg data inform retriev track show benefit track cluster inform person portfolio fig person portfolio text mine inform organ theme fig cluster creat foci base document person set document collect addit search engin prior document organ cluster shown figur figur show cluster result document organ base person cluster structur document combin portfolio chunk knowledg cluster organ theme technolog cluster highlight inform fit person portfolio promin group cluster articl site system discov inform group organ familiar inform person structur paper present system foci perform competit intellig web person inform manag track person foci achiev inform manag techniqu call cluster fig organ document person portfolio integr complementari strength cluster categor illustr foci support interact process automat discoveri user exist interpret environ term inform inform fall defin cluster structur potenti interest user enabl user discov inform respect prior experi refer carpent grossberg massiv parallel architectur neural pattern recognit machin comput imag rosen fuzzi fast stabl learn categor analog pattern adapt reson system neural compani intellig softwar review tan topic track trend analysi neural network confer knowledg discoveri data mine hong page kohonen creat order digit librari map san kohonen associ memori tan adapt reson associ map neural tan predict network text categor confer knowledg discoveri data mine hong page tan pan ad person inform cluster submit public
IR/1441 5 statist phrase autom text categor maria de ciencia universidad de air stan matwin dept comput scienc ottawa canada fabrizio sebastiani istituto di dellinformazion dell itali abstract work investig document index text categor call set word occur document sequenc word stop word remov consist stem order previou research investig variant context specif learn obtain gener answer tc work investig tc independ specif learn algorithm appli featur select pool check score high select top report result featur select function vari valu perform standard tc benchmark report result make actual select context linear classifi induc mean rocchio method categori subject storag inform search retriev inform storag system softwar perform evalu learn induct theori machin text text classif work author partial carri visit depart comput scienc support grant universidad de air introduct kei issu inform retriev text manag applic document task automat construct intern text interpret document manag compactli captur mean choic format text depend textual unit problem lexic natur languag rule combin mean unit convei problem composit ir concentr issu neglect issu assum good document obtain simpli account frequent word document disregard semant pragmat context occurr rise bag word approach text repres vector weight rj number word occur document collect kj word contribut identifi mean weight kj comput frequenc document collect variant bag word approach obtain word stem word disregard frequenc issu simpli binari assign kj base set word term vector featur denot vector weight characterist document decid variabl denot featur choic count featur limit current text process extract fulli autom scalabl text principl identifi featur concept document deal problem document piec knowledg reach current knowledg extract technolog phrase index ir tc past number ir research express bag word notion featur time semant richer technic feasibl number author investig phrase addit individu featur linguist phrase textual unit larger word smaller full exampl noun phrase nuclear wast dog cross bill exampl verb phrase plai ic hockei school term syntact phrase denot phrase grammar languag syntact phrase index interest phrase closer individu word stem express structur phrase smaller ambigu constitu mutual disambigu word word hand drill ambigu hand card shake oil drill pronunci hand drill constitu word creat context unambigu interpret phrase index document phrase occur request rank higher document constitu word unrel current natur languag process technolog individu phrase perform good robust number research investig index syntact phrase ir obtain discourag result section reason index languag base phrase superior semant inferior statist qualiti respect index languag base singl word phrase nuclear wast denot articul occur frequent document collect make impact term situat worsen fact concept trigger relat linguist unit nuclear nuclear standpoint similar underli concept recogn syntact phrase denot interest associ professor tall professor phrase call research attempt find problem understand notion phrase statist syntact call statist phrase sequenc word occur contigu statist interest statist phrase number advantag syntact recogn mean robust demand irrelev syntact variant factor uninterest phrase tall tend filter interest associ inher statist natur disadvantag error phrase recogn incorrectli recogn phrase work deal assess statist phrase document index context text categor activ induct learn classifi natur languag text topic categori set previou research investig impact statist phrase tc context specif learn obtain gener answer tc tout court work analyz problem aim obtain indic statist phrase tc independ learn algorithm order extract phrase corpu document assess run classif experi test score phrase mean number featur evalu function extent phrase comput singl phrase bring result index potenti phrase tc perform number experi run rocchio algorithm start run parallel experi ripper system result readi submiss experi aim assess result experi confirm field qualiti index languag measur criteria result classif paper organ section briefli introduc basic notion text categor section defin notion statist call section describ method evalu section describ result obtain appli method standard benchmark tc research section discuss experi perform appli rocchio method section describ relat work phrase index ir tc section remark term text process literatur set word occur sequenti text sequenc charact occur part word sequenc word occur contigu typic literatur index noisi result text asian dealt conclud text categor text categor text topic activ automat mean machin learn automat text program capabl label natur languag text themat categori predefin set frequent approach build text classifi categori build independ capabl decid document classifi categori process requir avail corpu manual preclassifi document document gener induct process automat build classifi categori learn characterist train set document classifi capabl categor test appli test set te check correspond automat classifi encod corpu featur select classifi induct method comput cost function length vector repres document kei import work vector shorter number word occur document number ten thousand featur select techniqu origin set subset featur compactli repres mean call reduct factor techniqu consist score featur mean featur evalu function select featur highest score featur select benefici reduc phenomenon classifi classifi data train classifi data tradit inform tc interest present work illustr tabl column probabl interpret event space document probabl random document featur occur belong categori estim count occurr train set tabl function specif categori order assess featur weight averag avg maximum max max valu comput definit start statist phrase definit number ir context case tc section detail paper make gener assumpt document principl belong categori assumpt verifi benchmark experi techniqu discuss paper straightforwardli adapt case document belong categori variabl gener document variabl preclassifi document function denot mathemat form document frequenc df inform gain log odd ratio tabl featur evalu function literatur formula cardin train set definit word stem alphabet order sequenc unigram occur document sequenc word stop word remov consist permut inform retriev occurr text express inform retriev retriev inform inform retriev retriev inform retriev inform retriev inform retriev inform retriev note evid stop word alphabet order factor notion number semant variat note noun phrase verb phrase full sentenc occurr semant note noun phrase case give rise defin base hypothesi syntact express convei form conflat type gener perform mean problem defin fact exampl refer concept fact express retriev interest inform arguabl refer concept recogn note mere contigu occurr word text refer complex concept text illustr dialogu harmon variat nest bigram dialog dialog harmon nest var convei articul concept clear index presenc method filter interest filter number occur collect high number occurr linearli occurr occurr number averag occur frequent averag base frequenc expect interest bigram inform retriev occurr bigram recur evalu statist phrase text categor method establish tc consist gener occur corpu score mean type discuss section rank score receiv proport top rank list constitut indic potenti text categor order introduc notion penetr level definit train set document number unigram occur defin penetr level reduct factor fraction top definit unigram train set perform featur select appli unigram reduct factor obtain unigram consid valuabl bigram order comput penetr level appli check top bigram higher valuabl bigram prospect worthwhil extract worthwhil chosen reduct factor chosen repeat experi reduct factor averag result fairli clear pictur bigram tc invok singl learn mean result arguabl valid specif learn algorithm chosen method applic pro con approach move discuss result remark approach evalu tc altern approach consist gener subset prospect good select statist filter heurist document check classifi exhibit respect standard case method doubt advantag comput heurist gener unigram frequenc substanti reduc comput time gener complet avoid comput time score practic applic feasibl method drawback result obtain depend chosen heurist chosen classifi learn algorithm method chosen abstract aspect point point method reli gener statist inform method reli applic rang obtain result real object work tc algorithm extract work foundat assess prospect interest tc applic worth algorithm clear analyz gener select heurist perform analysi gener refer specif learn algorithm refer widest spectrum experi perform number experi order test tc method experi report paper limit case investig case worthwhil bigram proven set experi distribut wide benchmark text categor research consist set partit split train set document test set document document averag length word stop word label averag number categori document rang minimum maximum number posit exampl categori rang minimum maximum definit unigram total run experi set categori train commonli subset full set categori includ categori posit instanc induc reliabl classifi task experi discuss stop word remov stop list provid page punctuat remov letter convert stem number remov perform corpu freeli download discuss subset categori ig result figur displai result comput penetr level bigram appli tabl vari reduct test avg max variant chosen turn perform compar experi figur penetr level comput reduct factor tabl set featur select reduct factor valu repres averag score attribut featur valu repres averag number document featur valu repres averag number categori document featur occur entri tabl includ case unigram case obtain switch case order correctli interpret note entri valu unigram case obtain number featur interpret row result note reduc set unigram reduct factor yield number featur obtain reduc set reduct factor speak reduct figur immedi evid penetr level function reduct factor df df df df df df ig ig ig ig ig ig avg avg avg avg avg avg max max max max max max tabl valu comput reduct factor entri list score unigram case case percentag number unigram bigram select featur featur select random unigram select odd larger magnitud odd select smaller mean odd tend mean proport bigram set top featur grow figur evid studi partit group consist avg group consist max avg displai similar group displai higher penetr level group confirm result yang pedersen experi involv unigram collect shown df ig highli conjectur pattern gener observ penetr level defin bigram definit statist characterist make prefer unigram rate high mean trust give faith pictur bigram substanti improv index languag result list column tabl show achiev high penetr level figur achiev high confirm penetr level reason comput contribut qualiti featur set experi perform number experi aim assess qualiti index measur result classif evalu methodolog experi classif measur term classic ir notion recal adapt case document categor wrt defin probabl random document categor deem posit correct true posit tp tn fp fn denot number true true recal wrt defin probabl random document categor estim obtain obviou count occurr test set valu turn averag obtain valu global categori set altern obtain global sum individu tp tp fp tp fp tp tp fn tp fn recal evalu averag result tp tp fp tp tp fn measur depend applic experi evalu measur combin contribut defin similarli research paramet place equal emphasi result tabl compar unigram linear classifi induc rocchio tabl reduct factor rocchio paramet set section full discuss rocchio featur weight mean standard variant tfidf log tr tr denot number document occur log denot number time occur weight normal cosin kj set featur result featur select convent format tabl similar discuss tabl recal entri describ perform rocchio classifi unigram number ultim mean bigram tc measur report result magnitud improv result tabl show result insert bigram featur contribut categor rocchio case wit improv case loss perform bigram bring perform seldom improv obtain max bigram deterior worst deterior obtain result figur tabl penetr level featur set improv evenli distribut case observ improv achiev low high reduct factor reduct factor perform reduct factor invari bring loss loss introduc bigram higher achiev high penetr level case bigram improv perform obtain ig df avg group yield smallest penetr level smallest produc high penetr level group perform case max case avg achiev valu clear pattern observ excess bigram unigram detriment bigram import unigram push top set bigram inform carri exist unigram inform inform retriev select top inform retriev push unigram unrel remain featur consequ natur approach featur fact featur evalu independ featur approach approach featur select featur subset evalu global approach impract set featur larg elimin potenti inform select bigram drawback stochast depend situat odd principl underli text classifi method design handl maximum entropi maximum entropi combin featur select similarli bayesian method confront word frequent situat maximum entropi avoid predictor class report mix perform maximum entropi practic applic domain improv report respect bayesian deterior classif accuraci note kantor lee report similarli mix result inform retriev task relat work phrase index close relat problem automat term recognit subfield comput linguist investig identif extract df df df df df df df df ig ig ig ig ig ig ig ig avg avg avg avg avg avg avg avg max max max max max max max max tabl comparison unigram rocchio classifi reduct factor text linguist unit domain review atr draw distinct research fact linguist express qualifi syntact point research fact linguist express qualifi semant point distinct drawn syntact statist phrase ir tc similar relat work inform retriev work syntact statist phrase ir date back earli review earli fagan work comparison standard syntact phrase index statist phrase index perform experi fagan found syntact phrase yield small notwithstand fact sophist linguist techniqu emploi phrase extract found statist phrase obtain simpl method improv perform lot syntact phrase lewi croft investig idea extract syntact phrase cluster order endow result index languag statist result improv mitra al investig impact syntact statist phrase ir research show overlap set phrase identifi method union set show phrase index benefit low recal benefit tend high recal level import observ tc tc recal level paramet learnt valid mean phrase tc recal level maxim perform automat chosen system statist phrase bigram empir statist filter place bigram occur document result statist phrase essenti confirm studi phrase obtain substanti result relat work text categor research investig phrase index ir tc context number syntact statist phrase tc provid explicit comparison perform phrase syntact phrase lewi studi syntact phrase index tc context report context nave yield significantli lower standard syntact phrase success cluster lewi phrase index languag consist phrase work present index languag includ unigram phrase dumai al report benefit syntact phrase varieti text classifi context furnkranz al show syntact phrase yield improv low recal confirm result obtain mitra al ir context statist phrase mladen grobelnik extract length mean fast algorithm reli document frequenc statist filter nave classifi appli corpu web page found length give benefit respect singl word provid addit benefit furnkranz algorithm similar extract length found ripper improv perform length longer reduc classif dataset usenet newsgroup articl found neg contribut larger confirm investig bigram text categor perform studi assess indic studi confirm real text categor experi experi restrict methodolog emploi gener studi shown featur evalu function routin text categor experi tend score bigram higher unigram select featur select give rise high bigram ad index languag bigram hypothesi high bigram penetr level conduc improv confirm experi shown featur evalu function rise high bigram penetr easi conjectur due elimin inform unigram part bigram partli duplic inform carri exist unigram issu inform duplic result bigram insert central understand bigram penetr level result classifi improv investig wai avoid duplic main direct plan continu work approach shed light role bigram role publish experi cloud issu remark studi definit standard ir context evalu tc experi experi obviou issu stem alphabet order import discuss section stem alphabet order factor number syntact semant linguist express comparison uniformli shown produc mix induc stem alphabet order avoid bigram extract remark research work discuss section compar deriv standard index deriv phrase number featur fix bigram substitut unigram work case bigram ad unigram case work uniformli improv chosen work substitut unlik tc featur space import paramet section comparison scheme number featur acknowledg luigi make text classif softwar environ greatli simplifi william cohen make ripper collabor implement extract softwar make meet refer weiss autom learn rule text categor acm transact inform mitra queri zone correl text retriev cohen singer learn method text categor acm transact inform damerau evalu term text inform process sahami induct learn algorithm text categor acm intern confer inform knowledg page acm automat natur acquisit terminolog journal quantit fagan experi automat phrase index document comparison syntact method phd depart comput cornel fagan approach automat phrase index document retriev journal american societi inform frake stem algorithm frake inform data structur page prentic englewood multistag index system larg subject field intern confer par page elsevi scienc nl furnkranz studi featur text categor technic report fur artifici case studi linguist phrase text categor www aaai workshop learn text page experi featur select neg evid autom text categor technic report istituto di dell submit public european confer research advanc technolog digit pt pfleger irrelev featur subset select problem intern confer machin page method automat term review kantor lee test maximum entropi principl inform retriev journal american societi inform lam lee featur reduct neural network base text categor chen ieee intern confer advanc system advanc page ieee comput societi lo lewi evalu phrasal cluster text categor task acm intern confer research develop inform page acm lewi learn inform retriev phd depart comput lewi croft term cluster syntact phrase acm intern confer research develop inform page cardi analysi statist syntact phrase intern confer par page extend version forthcom inform process manag mladen featur subset select text learn european confer machin number lectur note comput page springer de mladen grobelnik word sequenc featur seventh comput scienc page mccallum maximum entropi text classif workshop inform schapir singer system text categor machin singhal boost rocchio appli text filter van acm intern confer research develop inform page acm pedersen comparison classifi document rout problem acm intern confer research develop inform page acm sebastiani machin learn autom text technic report istituto di dell submit public acm comput survei retriev colloc comput statist phrase inform retriev acm intern confer research develop inform page automat index base bayesian infer network acm intern confer research develop inform page acm yang pedersen compar studi featur select text categor intern confer machin page morgan kaufmann san zhou phrasal term ir applic natur languag inform page kluwer academ
DB/1442 3 analyt studi object identifi index depart comput inform scienc norwegian scienc technolog norwai abstract object identifi index system typic size larg small part index fit main memori avoid index retriev effici buffer strategi minim number disk access develop analyt cost model find optim size index page buffer index entri memori index access pattern exist buffer hit estim model applic index page buffer case tree base develop analyt model index page buffer perform cost gain result report typic order result valuabl optim tool configur tune system introduct larg oodb logic object identifi oid index typic order size mean small part oid index fit main oid index retriev bottleneck effici access buffer strategi appli studi oid index retriev result reduc averag number disk access retriev index entri reduc cost oid map case fraction origin cost recent index page buffer pool make oid map manag lru chain index entri low case oid part inform page buffer interest util recent index entri oid entri cach shore oodb improv perform import memori buffer index cach index entri issu studi detail access cost issu underestim research oid map cost includ cost model averag number disk access equat deriv index buffer buffer talk index page cach cach talk index entri memori establish real differ buffer cach techniqu case avg number disk access index buffer index size figur averag oid map cost memori size illustr figur evid figur cost show gain optim amount memori frequent access part index fit main cost infrequ access data index structur repres disk bottleneck develop cost model oid incorpor exist model studi index buffer memori partit index page buffer index entri describ memori size affect partit organ rest report section overview relat work section explain model approach section describ special characterist oid assumpt access pattern section present dan dia lru buffer model index buffer model section base section develop oid retriev cost section studi memori index size affect perform section conclud report topic futur work relat work approach estim number page access case file studi characterist valid estim access pattern buffer account access assum infinit buffer access page count approxim interest work dan dia improv model present dan model request lru model valid assumpt request independ previou request describ model detail section model buffer case hierarch tree make request independ assumpt complic situat model approach present model index scan lru buffer present model assum complet scan model uniform access entri probabl access access cost model oodb includ buffer oid map cost benefit analyt model compar algorithm architectur simul analyt model extens relat research evalu complex simul commonli proxim implement problem model concurr event simul import time result small part paramet space easi explain opportun easili chang result easier determin depend analyt model analyt model analyt model research cost assumpt bottleneck amount main memori necessarili cpu cost easili incorpor analyt orthogon issu discuss report cpu cost affect qualit result import aspect amount main buffer characterist buffer space reflect model object identifi index object system identifi uniqu object identifi logic disk page object resid directli index find page object resid physic oid potenti perform major reloc migrat object make schema chang difficult logic oid gener prefer choic realiz hash file base simul result comparison studi al studi oid variant suit oid limit discuss tree base index report relev hash file differ index access simpler hash file number oid fast effici index structur special properti exploit achiev ffl kei uniformli distribut domain kei commonli uniqu part oid integ assign object page index page index entri figur buffer page server oodb monoton valu insert kei valu exist kei ffl object oid difficult space util index space util close combin knowledg properti techniqu tune split unfortun result difficult index good local page cluster exploit local index page requir oid gener leav suffici space oid oid insert oid cluster desir result effici oid entri search requir entri index delet object result larger index problem extra index access time object check oid exist approach exist clear benefici buffer buffer page server oodb buffer object index index illustr figur rest denot index page buffer size oe cach size sum illustr real separ buffer area object index page index data page resid common manag buffer manag buffer manag put restrict buffer alloc avoid situat oper replac page scan oper manag control amount memori easi amount buffer occupi index page simpl bookkeep size oe cach fix system startup adapt report studi adapt oe cach improv perform fix size oe cach oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid leaf node logic view tree base oid physic view map root node figur oid index lower part show index logic upper part index realiz physic arrai entri distribut leaf node partit set partit set partit access probabl fi fi ff fi fi ff fi fi ff tabl partit size partit access probabl partit set studi index entri access model assum access object system skew object access assum partit rang oid partit size access probabl illustr bottom figur stabl obj object obj index analysi model access satisfactori analysi major shortcom estim number distinct object access higher number distinct access object real system reason insid hot spot area smaller higher access probabl reflect model simul analysi emploi partit partit access page partit hot spot area model partit partit hot spot hot spot area partit size partit access probabl summar tabl fi denot size partit partit fraction partit size word book access probabl db fs db fs db fs fi fi fi tabl partit size partit access probabl analyz show assumpt access pattern justifi fraction total ff denot fraction access partit peopl question valid assumpt larg amount request small area realist assumpt show give imagin spell spell check document compar word document word access index danish bibl english version genesi norwegian file system book distinct word book dictionari uniqu spell check book word access probabl partit summar tabl show assumpt access probabl justifi index page access model assum low local index page oid entri partit cluster index illustr figur leaf node index entri unrel entri partit mean access pattern leaf node access pattern logic view initi index entri partit index entri access basi deriv index page partit index page access total index entri partit distribut leaf node binomi distribut simplifi make approxim hot area number entri suffici larger number leaf fi reason page size fi assum access entri belong hot spot model random hot spot area decid index page access pattern approxim binomi distribut assum index entri distribut leaf node uniform distribut simul result show error accept number hot spot entri smaller number leaf fi obj tree number hot spot entri larger number leaf fi obj tree case number hot spot entri smaller number leaf node number object hot spot area number leaf page belong hot spot fi fi obj tree fi fi access ff ff fi ff ff ff case number hot spot entri larger number leaf node case hot entri uniform distribut page page hot index entri case hot index entri import captur fact model page extra index page fi obj obj tree cn tree tree fi fi access ff fi tree obj tree fi obj ff ff number hot spot index entri access uniform bdd lru buffer model estim buffer hit probabl lru manag buffer bdd lru buffer model briefli explain model deriv detail equat found bdd model size data granul partit partit partit fi data ff access partit distribut partit assum uniform access assum independ access number distinct data granul index partit access fi fi ff number access number distinct data granul access buffer size buffer hit probabl partit fi ff buffer hit probabl figur index tree partit ff steadi state averag buffer hit probabl approxim buffer hit ratio buffer chosen largest satisfi case number data granul fit buf gener index buffer model previou present bdd lru buffer model access model buffer hierarch access complic search leaf page consid random node access tree independ section present gener index buffer granular access page gener tree size index page size index entri give fanout bs consist obj object number leaf node tree obj bs approach approxim buffer hit base obviou observ level tree access probabl root leaf tree index node fanout number level tree dlog tree note equat correct origin version technic report initi partit partit size tree tree number index page level tree access probabl partit account hot divid leaf page partit fraction fi li leaf access probabl ff li rel leaf page partit partit size fi li tree access probabl ff li partit hot spot leaf page level make access node upper level long fanout suffici hot spot area treat access node upper level uniformli distribut level modif tree height leaf page equat ff fi probabl fraction size ff ff li fi fi li tree tree tree tree partit illustr figur partit leaf mark partit access probabl ff respect partit denot number leaf node tree total number node tree calcul tree tree tree tree denot buffer bdd buffer hit probabl equat ff fi defin buf tree buffer tree total number index page tree analysi assum complet root leaf leaf node strategi index leaf page describ search check relev leaf page buffer leaf page tree call strategi choic strategi impact result buffer hit show compar model simul result section valid index buffer model valid analyt compar simul result simul perform index buffer index page access pattern simul simpl maintain lru chain index page resid buffer simul oper strategi section buffer hit probabl index buffer index size simul model buffer hit probabl index buffer index size simul model figur buffer hit probabl buffer fanout fanout satisfi leaf page request buffer assum leaf page buffer inform access directli tree root node leaf buffer alloc replac time node resid buffer access node resid make node move front buffer chain equat deriv previou assum hot buffer warm buffer larg number start measur buffer hit probabl simul result section result simul index tree leaf page perform simul larger index qualit result figur show buffer hit probabl index fanout fanout number leaf page buffer hit perform close point complet index tree level space buffer rise reach point level fit complet buffer close model simul result logarithm scale buffer size axi logarithm curv figur show rel deviat estim simul buffer hit rate deviat small left hand plot partit set hand plot partit set tabl previou explain root leaf avoid desir leaf node resid buffer affect buffer hit compar simul compar result result analyt assum complet figur plot rel deviat estim simul buffer hit rate case strategi show deviat small case measur deviat partit result leaf page leaf page size suffici index approxim million object deviat index buffer index size index buffer index size figur rel deviat buffer hit rate analyt model partit set partit set deviat index buffer index size deviat index buffer index size figur rel deviat buffer hit rate analyt model simul strategi partit set partit set oid retriev cost model oid retriev cost model base number disk page cost common bottleneck disk request inform found memori model includ index page oe cach import note gener ordinari data oe cach situat costli side effect oe cach size reduc number complet page make lot costli index page instal read entri index updat issu import index entri modif happen object migrat schema chang tree base essenti potenti troublesom oper delet index modif batch background activ oid entri cach amount reserv oe cach assum size entri overhead byte number entri fit oe cach access oe cach assum follow assumpt bdd independ random appli model object entri data estim probabl oe cach hit partit defin section buf obj result analysi highli depend amount overhead entri minim benefici total index memori oe cach reason implement time cpu cost hash tabl provid fast access entri approxim pointer entri averag addit data structur buffer manag base analysi lru clock algorithm perform close lru storag bit entri small ignor analysi total oid retriev cost probabl oid entri request oe access index disk access probabl index page memori averag buf ff li fi li defin section level root leaf buf disk access averag cost disk index lookup buf index buffer index size partit set partit set figur optim oe cach size amount index memori optim oe cach buffer size deriv equat calcul cost lookup section studi detail condit oe cach index memori reserv oe optim perform optim problem amount index find combin lowest rest give oe cach size fraction total index memori size studi million million object optim oe cach size size result number section studi index page size access pattern partit set optim oe cach size versu index size figur present optim memori optim minim interest optim medium buffer size oe cach captur access hot medium hot area evid figur memori size size larg captur rel fraction index memori oe cach note memori buffer data page issu orthogon studi avg number disk access index buffer index size optim oe cach oe cach oe cach oe cach oe cach oe cach figur partit set buffer size small part hot set fit entri oe cach access time brought oe cach result reserv larg part memori oe cach wast space reduc retriev benefici upper level index tree index buffer size index memori point hot set fit oe addit frequent access page fit index page buffer memori size index largest oe cach size memori hot set fit oe advantag extra memori index page rel size oe cach absolut size stai memori point optim oe cach size drop reason store index entri separ entri incur high order store higher number entri fit index higher buffer hit probabl page oe cach map cost oe cach size figur figur present averag map cost partit set illustr benefit oe cach import optim oe cach size figur constant size safe optim perform oe cach size adapt tune memori index size import fact memori oe cach size oe cach oe cach avg number disk access index buffer index size optim oe cach oe cach oe cach oe cach oe cach oe cach figur partit set effect access pattern optim oe cach size highli depend access pattern figur illustr partit set narrow hot spot area narrow area larg oe cach smaller studi effect access studi chang size access probabl affect optim cach size oid retriev cost figur show optim oe cach size distribut interest note wide hot spot benefici index memori oe point optim cach size drop previou smaller hot spot area case result drop optim oe cach size rel total index memori oe cach larg hot declin point buffer hit probabl higher index page result distribut wider hot area reason wide hot leaf page access distribut uniform figur map cost shown oe cach size show import optim oe cach fix size oe cach typic make oid map process percent costli index buffer index size distribut distribut distribut distribut figur optim oe cach size amount index memori avg number disk access index buffer index size optim oe cach oe cach oe cach oe cach oe cach oe cach figur distribut access avg number disk access index buffer index size optim oe cach oe cach oe cach oe cach oe cach oe cach figur distribut access avg number disk access index buffer index size optim oe cach oe cach oe cach oe cach oe cach oe cach figur distribut access avg number disk access index buffer index size optim oe cach oe cach oe cach oe cach oe cach oe cach figur distribut access develop analyt model retriev cost includ index buffer oe cach part develop analyt model hierarch index buffer base lru model al retriev cost model studi memori index access pattern oe cach size affect buffer hit perform show rel amount memori reserv oe cach depend size index rel size index absolut valu rel amount memori reserv oe cach highli depend access pattern gain optim size oe cach high import size memori commonli data index fit infrequ access resid memori disk bandwidth result model report valuabl optim automat tune tool oodb studi memori index page index entri issu orthogon find optim fraction total buffer memori index data page incorpor cost model exist oodb queri cost studi buffer relat buffer transient care buffer manag system startup workload chang improv perform refer bertino model cost function ieee transact knowledg data dia simpl analysi lru buffer polici relationship buffer transient ninth intern confer data analysi perform invert data base structur commun chou dewitt evalu buffer manag strategi relat system vldb dan approxim analysi lru fifo buffer replac scheme acm estim block access organ ieee transact knowledg data principl buffer manag acm transact kossmann perform evalu oid map techniqu vldb tang cost model cluster vldb luk estim block access organ commun lohman index scan finit lru valid model acm transact storag manag method object system phd wiederhold estim block access close formula commun yao approxim number access organ commun
DB/1443 3 extract semistructur data lesson learnt udo ann de paul sam rai nick webb depart comput unit kingdom abstract yellow page assist natur languag dialogu system guid user dialogu order retriev address yellow page part work project concern construct extract raw input text onlin access address discuss aspect involv task report experi interest project introduct directori system user access address inform classifi directori substanti part work project extract data sourc file creat backend sourc data word raw strictli type convent notabl fact access vast amount sourc rang megabyt solut construct backend onlin queri process inform retriev relat entiti address singl index entri paper describ aspect backend construct learnt process structur paper give gener overview architectur system section point relat work section focuss backend compon final describ recent experi evalu result conclud outlin futur work nick webb sheffield yellow page talk page regist trade mark british telecommun plc unit kingdom system overview interact system queri address classifi directori queri consist simpl phrase address hotel en suit figur overview system architectur data cycl roughli user utter speech recognit type graphic user dialogu manag dialogu manag track current stage dialogu control submodul hand back control relev input natur languag frontend return queri dialogu manag consult queri construct pass result process modifi depend dialogu histori queri construct compon transform input queri backend possibl world queri backend return retriev address dialogu manag final dialogu manag hand back control toplevel displai retriev address put question user pass dialogu access success result set stage cycl start relat work compar natur languag dialogu system lot onlin dialogu system deal time train schedul interest dialogu system built retriev address yellow voyag implement restrict sampl domain address object voyag tourist relat list galaxi unrel fact spoken languag dialogu system task extract repres semistructur data system tackl wai commun approach problem deal sort data wai perspect manag system research interest repres data extract part lore manag system design specif manag semistructur data inform manifold system dialogu manag queri construct compon world model speech recognit gui yp assist toplevel backend natur languag frontend fig architectur access data heterogen sourc declar describ content queri capabl uniform access resourc typic ir approach tackl problem tradit task select set document larg collect select document satisfi user queri access semistructur data onlin preprocess data offlin reason extract data corpu document repres tradit relat system remain problem repres content sourc document system natur languag inform retriev system parallel indic repres document index method natur languag process incorpor ir system po tag techniqu effici amount text access typic measur ir system reli statist point amount data system region megabyt abstract ir task involv short queri access short document classic ir task consid trec point view approach mention publish commerci product retriev pictur base caption mean short compar standard ir task point worth mention concern similar problem wordnet base semant hypernym broaden search wordnet tailor includ delet remov odd link addit term exist wordnet lexicon wordnet suit ir task hand work conceptu index knowledg base built base observ true synonym languag gener relationship car automobil motor vehicl express subsumpt relationship emploi yellow yellow page head steam basic fact car automobil wash kind clean algorithm infer car wash sort automobil clean knowledg base appli content retriev standard ir approach effect short queri approach final backend input data backend construct process raw data call yp print creat retain inform relat onlin system detail input data semistructur record structur address head exist intern structur entri formal defin consist partial english address telephon pattern type line entri carri inform address typic entri print directori case list hotel en suit park high town centr bed actual sourc code print tape give structur inform print town centr bed en suit park compar data typic user request hard find satisfi complet user queri initi user hotel en suit found list good match task dialogu system narrow gap user request index system suppli figur present task front end cheap common knowledg indic water suppli classif hr servic free text hour user classifi directori fig narrow gap input data transform match user queri good combin sort inform keyword free text entri centr bed order obtain backend indic distinguish extrem posit construct knowledg express data logic theorem prove onlin system inform morpholog string match intermedi posit chosen extract flat relat incom data method offlin appli method onlin system data backend compil offlin consist set tabl indic tabl repres base form simpl keyword relat index tabl onlin system string match speak knowledg rich indic perform retriev depend queri construct compon dialogu manag exploit knowledg simplifi inform store tabl includ locat indic head indic busi indic free text indic suit head refer indic head street indic extract inform encod prolog shown inform easi head hand inform street spot free mark creat decid combin index tabl retriev process case user guest list list guest displai refer hotel inn list address extend list user choic head select match strategi trigger setup option user user interest high recal case strategi emploi default strategi head hotel inn retriev guest interact compon refer backend knowledg rich indic remain task compon system appli sophist parallel work creation queri construct compon complet frontend exploit backend knowledg backend influenc turn flat robust parser call slot fill process group inform domain depend process step slot transact product mean gener syntact structur semant inform preserv process transform input queri intern implicit semant slot explain detail separ paper frontend queri construct compon flat structur solv task retriev inform backend queri construct compon relax constrain queri trigger simpl simpl syntact inform detect preposit phrase exploit relax queri work effici semant slot relax constrain queri knowledg encod ffl slot relat slot locat relax queri achiev empti slot leav locat untouch ffl slot product servic import method payment part domain depend backend encod semant slot queri construct compon combin flat heterogen sourc retriev process appli backend report experi gain work involv usag backend initi high recal lot queri answer queri term map indic backend test system real user notic high desir high report irrit user address retriev explain user car magazin result system offer find head scrap metal merchant result expand queri term car magazin hypernym cross refer directori match initi word product hypernym magazin head reclaim wast product scrap metal merchant head car commerci vehicl scrap metal merchant restrict queri procedur address retriev file match complet queri request kitchen specialist version result user friendli happen match complet queri partial match result partial match consid specialist address inform user request relax queri latest version system user address queri user relax request dialogu step offer relax wai match wider search kitchen search option checkbox displai default input field user continu dialogu case displai option make user happi case user input restart version simpl stemmer match queri press photographi head photograph press work porter simpl stem algorithm time user queri hospit retriev address list match experi convinc stem stem recent experi evalu input data recent develop creat similar system richer data fit backend structur relat ad extract repres part inform store product servic region wed photograph pr legal photographi competit price wed portrait special hour busi dai week includ bank holidai arrang hour facil small studio studio photograph frame prove simpl convert data file set script develop minim script essenti extend extract process addit step main advantag access data free text longer version inform print directori address short document inform retriev task free text inform phrase inform group label word phrase highlight wai capit write line break text split inform type open brand sort free text indic exist task base pattern match perform data type inform extract step treat word mondai creat indic type open case distribut keyword head show frequent keyword describ head gener keyword group occur explicit head keyword ticket frequent head travel quickli built system base data result valid data evalu evalu version colchest area address perform sort technolog focuss technolog base evalu interest find problem compon base evalu system perform compar result user queri note trivial task adapt standard ir method measur recal point dialogu system displai address long find set address appli simpl metric evalu queri corpu real user case bristol corpu user queri measur result address black box evalu system hidden result present queri continu dialogu initi system evalu system assumpt simplifi initi user queri success calcul averag address count result averag address retriev initi queri baselin defin averag case queri give result case request satisfi match address queri colchest ignor queri corpu match address calcul averag explain averag calcul assumpt assumpt assumpt final assumpt result simplist evalu aspect reflect order rank valu success user queri continu evalu moment concern detail evalu measur recal outlin continu work system interest part extract structur inform data file time influenc compon queri construct compon dialogu vari backend refin queri construct user friendli dialogu notic function dialogu manag chang lot process develop task initi locat dialogu manag implement queri construct compon futur merg compon plan make develop data extract tool gener appli complet domain major task futur remain deep evalu system involv user trial develop framework acknowledg test user bt brave queri system stage give refer queri data intern confer theori pp natur languag technolog content retriev confer natur languag process industri applic pp philip automat train timet inform system speech commun de intellig directori assist bt technolog journal layer approach inform retriev acl cole confer pp multilingu understand mit voyag system speech commun dialogu semant oral dialogu system intern confer spoken languag process queri heterogen inform sourc sourc descript vldb confer sparck natur languag process inform retriev commun acm dialogu manag telephon inform system intern confer appli languag process manag system semistructur data sigmod record lexic intern journal lexicographi algorithm suffix strip program evalu dialogu system workshop dialog process spoken languag nlp nlp resourc inform retriev task natur languag inform ed kluwer academ natur languag inform report text retriev confer special public ed sixth text retriev confer nist special public trec web translat dialogu european confer speech commun technolog pp de natur languag workshop natur languag dialogu partner model fur kunstlich intelligenz conceptu organ knowledg technic report sun microsystem mountain fast statist noun phrase document index confer appli natur languag process system understand spoken languag ieee expert magazin februari navig inform spoken languag interfac ieee expert magazin octob voyag speech understand preliminari develop evalu ieee intern confer speech signal process
DB/1444 3 reason inconsist structur text anthoni hunter depart comput scienc colleg london street london decemb abstract reason inconsist involv classic logic rang logic paraconsist reason inconsist pro con select paraconsist logic applic depend requir applic review paraconsist logic potenti applic area technolog structur text structur text gener concept implicit varieti approach handl inform item structur text number grammat simpl phrase semant label phrase item structur text nest larger item structur text semant label structur text meant stereotyp item structur text instanc stereotyp situat inform potenti structur text includ tag text text relat output inform extract system form instanti templat review formal concept structur focu identifi inconsist item structur reason inconsist review kei approach paraconsist discuss applic reason inconsist structur text introduct inconsist ubiquit phenomenon comput sophist increasingli import issu comput scienc inconsist bad thing inconsist alert potenti offer basi conflict interest situat discuss inconsist approach inconsist necessarili inconsist act issu handl wai reason presenc act inconsist order compar reason worthwhil applic logic applic focu potenti applic area technolog structur text item structur text data structur number grammat simpl phrase semant label phrase set semant label structur text meant stereotyp item structur text instanc stereotyp situat semant regard structur text abstract item text report corpor acquisit repres item structur text semant label includ date semant label semant item structur text intend semant coher phrase structur text simpl proper number unit word phrase prescrib lexicon prescrib lexicon delin type convei item structur text materi potenti structur text includ item text structur xml tag output inform extract system templat onlin agenc journalist file report structur text entri editor gener free text report languag notion structur text overlap data review whilst structur text develop techniqu reason check consist structur text draw infer structur text inconsist item structur text domain knowledg support requir domain includ integr default rule hold resourc assum word phrase suffici simpl restrict requir natur languag process repres word phrase constant symbol logic repres function symbol constant symbol argument date function symbol argument provid basic definit structur notion stereotyp show structur text translat classic logic reason domain knowledg review kei approach reason inconsist inform show reason inconsist structur text formal structur text section formal notion structur text stereotyp structur text adopt basic definit easi view adapt idea varieti field relat languag system definit word string phrase string word text entri phrase null semant label phrase exampl word includ phrase includ april warm sunni assumpt assum set semant label set text entri disjoint definit oe semant text hoe atom featur exampl atom featur hname sunni definit complex featur defin hoe atom hoe complex oe semant label oe oe complex hoe oe oe oei complex featur item structur text complex featur assumpt assum order item oe oe complex featur hoe oe oe oei import assum hname john hname john complex featur april cold sunni stereotyp set semant call delin recur situat structur report item structur text semant label stereotyp definit oe semant set text atom stereotyp definit atom featur hoe instanc atom stereotyp iff definit atom stereotyp complex oe semant complex complex complex stereotyp complex stereotyp left symbol compulsori stereotyp complex stereotyp option stereotyp view complex featur instanc complex stereotyp complex featur instanc compulsori stereotyp possibl instanc option stereotyp captur definit definit complex featur hoe oe oe oei instanc complex stereotyp iff oe instanc oe instanc ng oe foe oe oe instanc stereotyp call weather report set set set wet sunni wet warm notion complex stereotyp incorpor explicit form disjunct complex set firstnam set subsect easili skip read paper stereotyp disjunct stereotyp definit complex featur instanc complex stereotyp structur stereotyp structur report stereotyp oe stereotyp stereotyp gener number concept comput includ relat templat inform frame system similar stereotyp document type declar xml dtd incorpor implement featur default form structur framework surprisingli involv question handl escap charact logic reason structur text repres item structur adopt classic logic assumpt logic reason assum usual languag classic logic usual symbol quantif usual symbol logic connect assumpt domain knowledg set classic formula item structur text isomorph tree tree form item structur text call structur text tree definit translat item structur text logic formula structur text tree intermedi definit form structur text tree item structur appli rule complex featur rule complex featur form hoe oe oe oe root oe oe give oe oe complex appli complex featur rule oe atom appli atom featur rule atom featur rule atom featur form hoe oe child oe buyer seller firstnam john surnam smith firstnam mari surnam jone figur structur text tree gener uniqu refer label node structur text tree semant assum node uniqu refer label node structur text tree label semant label text entri semant label atom call atom semant call complex semant label item structur text node semant leaf node text penultim node atom semant label item structur text structur structur text tree exclud leav structur stereotyp item structur text root tree illustr gener structur text item structur give tree figur hname namei hname namei obtain classic logic formula structur text tree definit offspr node iff child child offspr node definit set formula form structur text tree obtain exhaust appli complex semant label uniqu refer label parent uniqu refer label atom semant label uniqu refer label parent text entri child root tree atom semant uniqu refer label root tree atom semant uniqu refer label text formula definit rule uniqu identifi item structur rule path root node rule text entri rule text entri tree repres atom featur continu obtain formula includ definit review kei paraconsist section paraconsist logic reason logic item structur text paraconsist logic system approach inconsist inform includ paraconsist logic approach effect remov data produc consist approach leav prohibit logic deriv trivial infer follow approach mean lose inform forc make prematur select make select focu advantag disadvantag kei paraconsist approach rang paraconsist logic give infer inconsist inform logic full classic subset classic proof logic subset classic languag subset classic proof intuit argument logic reason consist subset classic logic classic proof theori restrict notion natur deduct proof prohibit applic elimin proof rule applic introduct proof rule option behav wai data regard perfect handl inconsist inform gener provid spectrum approach approach aim stai close classic reason classic logic appeal featur knowledg reason aim cover approach base logic modal logic logic avoid logic classic proof theori normal notion ff fi substanti weaker term negat number wai achiev drop axiom schema classic logic ad hold paraconsist logic call logic da costa give present schema logic schema classic logic definit logic defin axiom schema modu ponen proof rule ff ff fi ff ff fi fi ff ff ff ff fi fi ff fi fi ff ff proof theori consequ relat illustr set formula fff fl fi ffg symmetri ff ffi argument ff ffi argument ff proof theori deriv infer includ fi fl deriv ffi rule modu disjunct fail ff ff ff fail fi ff fi ff logic classic logic negat mean classic infer step involv negat fail logic remov classic infer rule mean proposit connect languag behav classic fashion case classic negat result classic connect trade exchang manifest discuss disjunct modu hold ff follow ff follow logic number interest logic proof rule ad give logic logic logic logic defin similar relev logic anderson logic reason inform logic support modu ponen give guidanc natur inconsist facilit action consist check paraconsist logic formal basi truth mainten logic logic interest altern logic present previou section illumin intuit semant complement proof theori definit languag logic subset classic logic usual set formula classic logic form connect set formula denot fff fi fi implic definit formula languag denot symbol accept assign truth valu ff fi fl intuit view form assign term lattic figur obtain gain gain inform definit assum distribut lattic figur assum oper satisfi condit ff ff ff fi fi ff order relat lattic figur lattic lattic definit semant assign function observ monoton logic xy meet yg xy join give truth tabl connect fi formula infer fi ff valid iff fi order relat logic lattic ff fi signifi infer ff fi valid ff entail fi ff semant assign function assign formula set formula close conjunct ff fi complement definit proof theori logic definit fl proof rule logic ff fi signifi ff fi semant context ff ff fi fi provid ff fi fl iff ff fl fi fl ff iff ff fi ff fl ff fi iff ff fi fi fl impli ff fl ff fi iff ff iff fi extend definit proof theori ff fi fi ff ff fi fi ff ff fl fl ff ff ff ff ff fi fi fl impli ff fl ff tabl truth tabl negat tabl truth tabl conjunct tabl truth tabl disjunct illustr proof theori argument ffi argument ff fl ffi fi ff ff ff fi ff fl ff fi fi ff ff fl fl ffi ff ffi ff ff ffi ff consequ relat deviat consequ relat detach ffi ff ff part due proof theori incorpor modu ponen elimin logic natur intuit form paraconsist reason semant base approxim lattic logic lattic applic reason fact logic aggreg conflict inform problem reason respect lack modu ponen disjunct proof theori consist check rang logic base set truth valu boolean valu number interest base valu mean kleen review interest variant valu logic develop review argument system obviou strategi handl inconsist reason consist subset close relat approach remov inform inconsist explor issu relat approach context classic proof theori definit set maxim consist subset set minim inconsist subset set inform maxim consist subset common relationship maxim consist subset captur view set import definit present rest section equal captur inform set captur data ff flg maxim consist ff ff flg minim inconsist subset problem infer consist subset inconsist weakli justifi gener handl adopt notion argument notion accept argument argument subset infer subset notion set argument partit set accept defin class consequ relat definit argument oe argument consist denot set argument oeg argument set iff definit argument construct oe defeat fl oe undercut defeat defin symmetr relat chang system base explicit prefer system base specif argument structur set subset intent definit argument structur subset accept present argument structur explain definit captur notion accept definit set constitut argument structur oeg oeg oe oe oe oe oe oeg convent argument set motiv tautolog argument follow empti set free argument al argument follow data free inconsist back argument follow maxim consist subset data ru argument subject undercut argument subject undercut argument due call inevit argument follow maxim consist subset data argument subject existenti argument due argument consist definit clear focu remaind ar argument maxim consist subset au argument item maxim consist subset combin condit ar au notic ar similar differ ar versu similar remark appli au ab ab strengthen ar replac summar relationship set diagram figur main featur notic linear au give item argument set ff ff fi ff ff fig fff argument set induc consequ relat figur partial order induc set lower diagram subset set higher diagram definit consequ closur argument structur denot defin consequ denot gener consequ closur expect oe iff oe argument logic kei restrict paraconsist logic consid pair formula mutual argument logic deriv consequ conjunct formula case logic drawback comput complex reason argument logic reason base consist check fff flg consist subset infer fl fl lock inconsist concept argument notion argument conveni framework develop practic reason tool base simpl definit argument concept carri possibl refin remain gener taxonomi argument suggest loui properti logic induc number system includ wagner fox al loui lin parson review model argument logic differ argument logic focu incorpor connect machineri approach accept argument dung approach assum set binari relat pair subset argument hierarchi argument defin term rel attack argument subset argument plausibl argument defend argument subset common featur argument system incorpor formal individu argument techniqu compar conflict argument number argument aggreg function determin hold framework aggreg function binari exist argument sensit number argument logic logic weaken proof theori mean connect behav classic fashion address altern call logic hunter proof theori restrict applic introduct rule applic elimin rule proof theori formula rewritten cnf de morgan doubl negat arrow elimin conjunct elimin resolut appli result rule appli obtain de morgan doubl negat conjunct disjunct arrow introduct fff ff ffi consequ includ ff ff ffi includ fl fff consequ includ ff ff fff ff ffi consequ includ ffi ff fl ffi qc logic motiv handl belief address issu proposit aim logic belief logic truth regard formula belief heart qc proof theori resolut resolut regard process belief resolv fl fl pair belief ff fi resolv fi fl ff fi ae applic resolut set belief assumpt properti resolut ff resolv liter ff liter set assumpt resolut proof rule mean belief infer assumpt hold set assumpt classic inconsist resolut constitut basi paraconsist reason restrict proof introduct proof rule elimin proof discuss mean paraconsist reason preserv introduc definit model arrow elimin appli formula ff fi fi arrow introduct appli formula fi ff fi definit set atom languag qc logic set object defin posit neg object ff ag ff ag model mean reason belief ff reason belief mean reason belief ff reason belief model reason belief incorpor notion truth falsiti atom complement level link formula complement kei part definit satisfi relat logic definit satisfi call strong satisfact defin ff ff liter ff atom ff ff ff ff iff ff ff st ff impli ff ff ff complementari liter ff ff ff origin formula ff ff disjunct ff part definit cover liter part cover disjunct definit disjunct restrict classic definit addit disjunct notion incorpor definit disjunct ff ff ff model satisfi complement ff model satisfi formula ff ff formula origin formula disjunct ff definit satisfact easili extend formula definit entail reason definit disjunct restrict classic decoupl link formula negat model order provid mean put link definit disjunct ensur ensur satisfi fl fl formula satisfi qc consequ relat offer infer data logic disjunct qc logic fi ff logic logic fi form relev reason infer ff proposit atom common ff assumpt develop paraconsist necessit classic logic give qc logic paraconsist logic applic comput qc logic mean obtain resolv set problem trivial qc logic tractabl unlik argument logic constraint qc logic result tautolog empti set assumpt problem applic whilst paraconsist logic fail adher properti classic consequ qc logic fail combin properti properti hold qc consequ ff ff fi impli fi modu ponen fi impli ff fi ff fi impli fi deduct fi ff impli fi cut ff ff fi impli fi weaken failur properti detriment applic applic infer obtain system user infer item structur properti requir paraconsist reason structur text review kei approach paraconsist return question paraconsist reason structur text summar applic requir assum set item structur repres set posit liter assum domain knowledg repres set classic formula assum paraconsist reason structur identifi infer structur text domain assum domain knowledg consist weather report form structur text applic assum scientif knowledg natur weather regard scientif knowledg domain knowledg assum aim paraconsist reason weather report find infer weather report merg inform report detail consid option paraconsist argument logic summar pro con option handl structur text account applic requir ffl weak reason domain knowledg kei classic proof rule modu disjunct hold classic hold mean full appreci intricaci proof difficult engin behav expect simpl insert disjunct obviou infer follow modu ponen follow resolut problem logic qualif infer ffl logic aggreg inform proof theori weak reason domain knowledg notion implic weaker classic proof rule modu ponen resolut whilst qualif truth conflict ffl argument logic give infer intuit qualif infer proof theori base classic respect logic behav classic logic restrict languag domain long domain knowledg problem knowledg lock formula condit argument logic ideal infer qualifi ffl respect power argument logic qualif incorpor discuss assum domain knowledg consist logic comput complex qc logic significantli argument logic inconsist domain qc logic ideal net draw argument logic ideal reason structur text assum domain knowledg consist item structur text repres set posit obtain inconsist structur set structur reason domain knowledg inconsist structur report defin respect domain axiomat inconsist axiomat involv uniqu axiom domain closur axiom defin stereotyp illustr argument logic reason inconsist structur problem conflict weather report suni section rang argument logic base reason maxim consist subset argument logic parallel find draw existenti qualifi advantag properti inform lock inconsist subset formula logic report repres formula assum domain knowledg identifi inconsist weather assum domain knowledg merg weather report function denot form conjunct domain knowledg includ axiom commut idempot function return qualifi infer obtain free infer existenti infer formula domain restrict infer maxim consist subset domain maxim consist subset impli infer infer reason restrict infer assum domain knowledg consist union domain knowledg structur text assum structur text inaccuraci adopt definit domain formula repres structur ff infer iff ff infer set maxim subset act inconsist paraconsist reason part wider framework inconsist handl kei aspect inconsist handl incorpor paraconsist reason inconsist act inconsist inconsist analysi inconsist make inform handl inconsist label qc logic record track inform reason proof rule label qc logic track inconsist inform propag label reason approach provid inconsist inform identifi sourc suggest action essenti facilit develop presenc inconsist explor techniqu set inconsist inform give measur inconsist set formula defin wai set classic inconsist set set inconsist set set measur base featur set formula number minim inconsist number maxim inconsist number atom symbol occur minim inconsist proport formula occur minim inconsist proport formula minim inconsist subset measur describ inconsist priorit resolut select action context structur weather analysi includ identifi factor root inconsist find newspap frequent conflict domain regard doubt find number newspap larg dai significantli case regard predict weather dai subject high uncertainti prone error act inconsist resolv inconsist includ truth mainten system merg belief develop includ iter belief relationship updat review belief theori immedi restor inconsist restor lose valuabl inform inconsist resolv involv seek inform advic argu deal inconsist necessarili restor consist suppli rule act inconsist continu weather report act inconsist set weather ignor report reliabl seek date inform switch seek authorit inform phone govern weather high conflict proce basi worst case weather occur effect action presenc inconsist requir gather wider appreci natur context inconsist accept act presenc inconsist requir extern adopt approach prescrib inconsist handl rule inconsist impli action approach deploi tempor logic past context sourc inconsist order prescrib futur action handl inconsist action ignor inconsist complet continu develop circumv inconsist part specif develop continu remov inconsist altogeth correct mistak resolv amelior inconsist situat perform action situat possibl futur resolut discuss paraconsist reason structur text logic paraconsist reason review main approach compar respect applic technolog structur text logic reason inconsist structur text offer formal basi address conflict inform report ffl argument logic give infer intuit qualif infer ffl logic weak reason domain knowledg notion implic weaker classic notion infer qualifi conflict ffl weak reason domain knowledg kei classic proof rule modu disjunct hold qualif infer ffl logic respect power argument logic domain knowledg inconsist qualif incorpor discuss structur text gener concept implicit approach handl textual inform comput includ tag text text relat output inform extract system structur text natur view logic item structur text repres formula classic logic mean consist check inferenc undertaken structur text domain knowledg vast amount inform potenti form structur analysi alert tool base paraconsist tool base reason tool merg report valuabl technolog acknowledg author simon parson feedback draft paper author grate anonym made number suggest improv paper refer anderson logic relev necess princeton abiteboul queri data intern confer page makinson logic theori partial meet contract function journal symbol arpa messag understand seventh confer morgan imaginari logic na da model theori comput north paraconsist proposit logic prade argument infer uncertain inconsist knowledg base confer uncertainti artifici page morgan prade logic approach reason inconsist stratifi knowledg base ch symbol quantit approach reason uncertainti volum lectur note comput page valu logic modern logic ph paraconsist logic approach knowledg de gla world confer fundament artifici page ph hunter classic reason inconsist inform symbol quantit approach volum lectur note comput page subrahmanian combin theori comput brewka prefer extend logic framework default reason eleventh intern confer artifici intellig page buneman semistructur data proce acm symposium principl hunter inform fusion overview symbol quantit approach uncertainti lectur note comput page hunter merg requir rank agent technic cowi lehnert inform extract commun manag prefer assumpt base reason inform process manag uncertainti knowledg base system volum lectur note comput scienc da costa theori inconsist formal system notr dame journal formal krau unifi framework hypothet practic theoret foundat gabbai practic volum lectur note comput page doyl truth mainten system artifici pearl logic iter belief artifici duboi editor handbook reson uncertainti manag volum dung accept argument fundament role nonmonoton logic program game artifici hunter argument reason classic inconsist inform data knowledg inconsist handl specif transact softwar ambler contradict reason european confer artifici gardenfor knowledg flux mit gabbai hunter make inconsist respect logic framework inconsist reason ph fundament artifici volum lectur note comput page gabbai hunter make inconsist respect handl inconsist data symbol qualit approach reason uncertainti volum lectur note comput page gabbai hunter negat contradict gabbai volum appli logic seri graham xml specif guid grishman inform extract techniqu challeng inform extract philosophi logic cambridg hunter manag inconsist analysi action acm transact softwar engin hunter merg inconsist item structur text technic depart comput colleg hunter reason contradictori inform logic journal logic hunter techniqu set inconsist formula technic depart comput colleg hunter ramif analysi causal map data knowledg fox logic argument reason uncertainti comput de kleer tm artifici mendelzon differ updat belief page perez logic merg sixth intern confer principl knowledg reason page morgan perez merg integr constraint anthoni hunter simon qualit quantit approach reason uncertainti volum lectur note comput scienc lehmann belief intern joint confer artifici intellig page lin logic reason consist presenc inconsist confer theoret aspect reason knowledg morgan schaerf arbitr merg ieee transact knowledg data infer inconsist inform theori martin shapiro model belief artifici parson defin norm system qualit argument gabbai practic volum lectur note comput page web publish xml easi step ap loui reason taxonomi principl resolv conflict principl knowledg intern confer morgan pool logic framework default reason artifici argument framework default reason annal mathemat artifici volum model argument logic handbook philosoph logic logic reason inconsist knowledg artifici loui mathemat treatment reason implement artifici damasio moniz pereira survei paraconsist semant logic program gabbai ph handbook reason uncertainti manag volum page abstract argument system de gla world confer fundament artifici intellig abstract argument system artifici wagner intern joint confer artifici intellig
IR/1445 5 inform compress multipl unif gerard wolff februari school electron engin comput dean uk abstract articl introduc idea comput linguist natur languag process understood inform compress multipl unif search align mean similar mean mean simpl merg match mean relat simpler mean term logic concept embodi softwar oper model simpl model present show theoret framework softwar model support product analysi sentenc accompani articl present realist exampl show syntax repres formal sentenc term syntax latest phase programm research develop conjectur kind comput formal reason usefulli understood inform compress pattern unif search anticip framework facilit integr syntax semant integr thing learn linguist cognit structur draw deduct probabilist infer matter scope provid import motiv develop expect extend modif fulli integr system understand product languag framework method repres syntax natur languag manner simpler direct method exampl present accompani articl show thing discontinu depend depend syntax accommod contrast simpler sophist method framework accommod ambigu syntax natur deliv altern introduct articl introduc idea notion understood process inform compress multipl align align mean similar mean mean simpl merg match mean relat simpler mean term logic articl describ softwar concept exampl model novelti concept literatur data compress mean process data replac short segment segment kind simpler kind theoret comput linguist branch ai concern natur languag process altern chosen level kind focu interest altern arbitrarili level grammar guid research relat topic comput linguist ai topic term inform compress berger al hu al tradit linguist analysi term concept abnei woodland takahashi wu sproat al luck close connect probabl ic featur idea understood multipl align problem concept multipl align relat idea syntact structur express simpl direct manner explain idea significantli establish concept open wai understand analysi languag structur discuss code method huffman kei connect probabl ic background context articl develop programm research develop conjectur kind comput formal reason usefulli understood inform compress pattern unif develop gener comput system base unif search framework potenti accommod aspect includ learn deduct probabilist reason inform retriev pattern recognit argu model gener ture model regard gener model comput relat research attempt integr concept area sp programm natur connect research connect wolff closest link work algorithm complex theori li minimum length encod minimum descript length encod minimum messag length encod wallac rissanen gammerman gammerman close relat bayesian infer cheeseman import differ object orient area work sp programm wolff section wolff section evalu reader justif pursu altern approach servic method exist subsect relev answer question speed process term current model rival current method run convent comput multipl align problem gener term process power ic interpret process remov unnecessari complex inform whilst preserv descript time author model aspect comput solv quickli convent comput born mind develop programm research aim develop form comput differ radic convent comput anticip high level parallel result dramat excess requir achiev adequ speed practic syntax integr part approach method repres syntax languag potenti advantag exist method simpler exist method discontinu depend syntax repres illustr discuss accompani articl reason larg scope method repres syntact structur facilit automat learn syntax learn framework framework ambigu system yield set altern grade term measur ic compar simpler sophist method method detect ambigu exist materi provid altern show natur ambigu system adapt manner disambigu context exampl present discuss accompani articl integr syntax semant line goal research programm work method repres syntax chosen ey wider issu knowledg syntax kind hierarchi inherit attribut knowledg repres manner close parallel method repres syntact structur articl prove repres kind knowledg uniform facilit smooth integr syntax semant integr function scope wide anticip section model modif embrac function deduct probabilist pattern inform learn idea accompani articl step develop system understand product fulli integr aspect present section introduc multipl align problem gener term simpl section describ languag multipl align section describ search metric model align distinguish term ic section describ comput simul sp run convent comput section describ product languag term multipl align sentenc rule grammar articl end discuss anticip futur develop conclud remark accompani articl demonstr capabl model exampl complic exampl consid articl topic cover articl includ ambigu discontinu depend syntax dd dd overlap syntax english auxiliari verb kind depend swiss german dutch multipl align problem term multipl align comput analysi sequenc dna base sequenc amino acid residu part process elucid function evolut molecul aim comput find align match symbol sequenc mean term discuss section align dna sequenc shown figur insert figur figur align dna sequenc fig permiss oxford area wide number align symbol larg search exhaust achiev search accept comput techniqu heurist techniqu includ climb call program search progress narrow search success stage kind measur good align guid search techniqu gener search ideal solut accept good approxim solut found excess comput demand fairli larg literatur method find good align sequenc symbol exist method review taylor barton wong al dai reason explain current method suitabl incorpor sp system varieti multipl align problem multipl align problem sequenc symbol align special statu design context sentenc sequenc sequenc design context sequenc symbol repres grammat section align unif symbol symbol unif symbol lead larg amount compress term sequenc explain section implic frame align problem sequenc time align align obviou restrict instanc symbol align clear concept multipl align pattern stage sp extend idea articl domain dimens multipl align section describ sentenc term grammar term multipl align section describ evalu term ic repres grammar pattern symbol figur show simpl grammar describ fragment syntax english grammar gener sentenc sentenc term grammar give label bracket form tree np np np figur describ fragment english syntax figur show grammar figur express set sequenc pattern symbol pattern rule notat rewrit arrow symbol introduc symbol sake clariti exposit save grammar shown accompani articl simpler requir practic system mean subtleti english omit grammar similar exampl present chosen small fit page resort font size small read reason section articl gener scalabl realist larg grammar initi number rule number rule figur frequenc occurr rule notion sampl languag frequenc occurr discuss np np np figur simpl grammar written pattern symbol number repres frequenc occurr rule notion sampl languag reason symbol ad rule clear word explan order symbol introduc differenti version pattern pattern enter match unif symbol symbol context repres number mean number grammar symbol begin serv marker pattern grammar inform descript marker suggest symbol meta symbol special hidden mean enter symbol string charact bound space pattern order set symbol line pattern long width continu line shown articl conveni distinguish concept substr subsequ sequenc symbol larger sequenc symbol larger sequenc sequenc symbol larger sequenc larger remaind quot mark drop refer grammar figur express pattern symbol word respect kind grammar refer quot mark match unif symbol symbol figur exampl present accompani articl enter match unif symbol serv distinct hidden mean attach formal distinct letter digit symbol alphabet symbol align sentenc rule grammar figur show sentenc align pattern includ sentenc relev rule grammar shown figur similar align convent symbol align singl np np instanc column align merg instanc column instanc symbol column insert figur figur sentenc align sequenc repres sentenc relev rule grammar figur project convent symbol bracket symbol replac marker qualif assert forego assert strictli true method evalu align model section principl meta hidden mean ideal research aim attain temporari solut problem score align pend distinct symbol begin symbol case symbol regard structur left bracket structur notic pattern align figur accord section pattern grammar time align exampl shown accompani articl note section sentenc sequenc symbol regard rule grammar regard sake readabl top align pattern sake clariti figur figur articl align shown accompani pattern align line figur convent order pattern top bottom arbitrari align pattern order total align provid aspect align evalu align term compress good align hit match gap symbol part short measur directli comput program find good multipl align commonli confid valid measur broader theoret framework concept ic relat concept probabl provid suitabl framework work evalu multipl align tradit includ cohen al wallac al wong al allison wallac wolff section good align defin basi econom code term pattern compress method section exploit elementari principl sequenti pattern repeat time bodi inform replac shorter pattern pattern kind pattern instanc pattern data unifi pattern repositori pattern basi standard method ic present differ standard method code serv dual identifi pattern uniqu mark left end pattern present role requir remov ambigu exist sequenc symbol align present code principl appli symbol encod sequenc level instanc recurr pattern code higher level exampl present discuss kei point connect recurr pattern discontinu symbol pattern necessarili contigu occurr recurr pattern subsequ larger pattern sequenc symbol recurr pattern set instanc includ pattern give inform explan method calcul compress align shown figur principl embodi method discuss section formal summari method present section encod individu symbol simplest encod individu symbol sentenc grammar code fix number bit symbol grammar figur symbol type minimum number bit requir symbol bit symbol model section code assign accord code scheme cover thoma shortest code repres frequent symbol vice standard method data compress code explicit termin unavoid inform left boundari code pattern inform provid implicitli space charact charact trie encod decod data versa notic number bit requir symbol independ number charact symbol shown exampl symbol chosen pure aid variat refin made level choic code system individu symbol critic principl focu interest exploit redund attribut sequenc symbol redund attribut unbalanc frequenc individu symbol reason section connect decod code symbol valu cost theoret minimum number bit repres symbol cost number bit robust decod inform decod section inform descript encod distinct cost cost symbol import sake simplic assum symbol encod number bit symbol treat minimum unit inform encod word word sentenc encod shorter code word dictionari identifi word uniqu dictionari grammar figur plai part dictionari segment standard compress system accord remark code pattern show word start finish achiev letter symbol word abbrevi abbrevi ordinari write natur advantag code symbol introduc huffman code sourc scheme effici term ic scheme probabl infer reliabl size code assign scheme anticip advantag model appli draw probabilist infer begin end word light clear word grammar shown figur encod word encod word case modest save symbol word grammar word fewer case encod phrase phrase encod code pattern result symbol smaller origin encod phrase fewer symbol advantag fact sequenc substr pattern grammar notic sequenc discontinu sequenc earlier phrase pattern replac sequenc encod word noun phrase add final code sequenc notic symbol code pattern serv disambigu context symbol identifi pattern symbol identifi pattern cost code pattern symbol compar origin symbol save symbol similar phrase encod symbol smaller origin encod sentenc noun phrase encod form encod sentenc encod np sequenc subsequ np sequenc substr pattern np np grammar replac sequenc np sequenc discrimin word sentenc add symbol sequenc np result encod sentenc symbol encod sentenc repres substanti compress compar symbol sentenc account size gap account pattern match code section illustr scheme embrac match subsequ match symbol tradit match coher substr match symbol peopl strong intuit gap small gap gap larg regard match intuit area justifi analysi term inform theori attempt analysi present section account size gap model discuss pattern express sequenti redund data encod sequenti redund exploit reduc number symbol written explicitli grammar shown figur pattern individu word express sequenti redund letter pattern noun phrase express sequenti redund pattern sentenc express sequenti redund phrase phrase principl oper level symbol intermedi level omit complet sentenc symbol mark start end sentenc pattern interpol symbol discrimin altern lower level notic idea applic align singl ti ti ti ti sequenc case align shown figur align evalu present align exclud sp model area intend align shown evalu alongsid project mismatch method illustr role context encod inform symbol ambigu term pattern grammar figur context pattern assign instanc unambigu word give sequenc word origin sentenc mechan encod form discuss section summari method calcul compress align method calcul compress score align pattern formal term method embodi section method design calcul compress inform sentenc achiev inform term inform inform pattern symbol repres grammar cs calcul cs number bit requir repres inform form encod code level singl number bit requir encod inform term inform valu calcul method appli align singl sequenc symbol section intend method futur accommod align kind inform cost symbol simpl block code symbol bit number symbol type alphabet symbol type symbol type individu calcul method symbol input calcul frequenc occurr symbol type deriv straightforward manner frequenc ith pattern grammar number figur number occurr symbol ith pattern number pattern grammar whichev symbol factor size critic bigger calcul minimum number bit requir encod pattern calcul align requir pattern align frequenc occurr pattern calcul theoret minimum pattern method altern method calcul present adopt model section altern method calcul ith symbol subsequ symbol pattern identifi pattern uniqu pattern grammar pattern discrimin symbol pattern subsequ pattern distinct posit symbol pattern constraint st simplifi assumpt made discrimin symbol smallest substr symbol start begin pattern enabl pattern identifi uniqu grammar easi discov substr process systemat comparison candid substr symbol pattern grammar constrain subsequ symbol calcul pattern symbol pattern fulli partial subsequ symbol pattern end symbol hash charact symbol ad set discrimin symbol pattern constraint conflict principl symbol statu mean constraint adopt fact symbol larg redund identifi pattern duplic inform symbol pattern primari function symbol mark end redund mean method calcul section fail discrimin align differ potenti econom encod calcul number bit requir express symbol calcul cost symbol ith hit sequenc adjust paragraph hit sequenc hit symbol symbol pattern symbol hit sequenc subsequ sequenc pattern formula adjust account exist hit previou hit sequenc hit pattern align treat sequenc sequenc symbol sentenc sequenc symbol project align singl sequenc symbol ith hit sequenc adjust calcul actual cost symbol ith hit entri tabl factor appendix hit variabl repres current hit calcul posit symbol ith hit posit symbol hit analog posit project align singl sequenc mean repres column align method adjust gap symbol discuss appendix calcul number bit requir encod cost pattern line align top line save encod cost fact pattern align convei inform sequenti arrang pattern align select pattern align altern context cost pattern calcul section notic pattern time encod cost ad number time sum encod cost calcul depend main pattern fulli partial subsequ pattern specif symbol calcul pattern gener rule grammar larg free valu relev symbol gap add subsequ symbol identifi pattern uniqu pattern grammar redund bit achiev uniqu identif pattern gap sequenc inform valu reduc accord rule calcul appendix present gain pattern pattern match pattern minimum number symbol achiev identif save encod sourc maxim addit hit pattern give addit save encod cost calcul row align pattern creat variabl pattern row align left examin column symbol symbol column design column symbol pattern design ho examin row hit symbol column ho calcul account gap exist ho previou method make adjust calcul appendix ho gap measur row align ho treat singl pattern pattern ho align calcul assum gap pattern ho examin ho identifi hol pattern start furthest left align make arbitrari choic figur column hit hol case row column hit np np hol row np np ho ho exclud hol row subtract row set subtract instanc relev column examin valu variabl calcul number row align summat exclud top line method calcul sum valu pattern row align reduct hit pattern adjust gap accord reason present appendix reason reduc hit pattern hit reflect pattern pattern extent pattern inform exist pattern reduc pattern identifi encod extrem pattern identifi encod save encod cost result coverag pattern exce pattern addit hit row reduc method row column hol regard row symbol column unifi row reduc bia definit row theoret concept symmetr left direct align concept found work model sentenc discuss earlier top figur grammar figur model find align shown figur accord identifi align form sentenc grammar relev sentenc model capabl find align shown articl identifi term ic altern align sentenc grammar model find align shown accompani except note discuss articl model work build align fashion select term compress stage method constitut fairli straightforward applic examin larg search space narrow search progress stage kind metric guid search align built manner align accept pattern section align treat singl sequenc symbol match origin pattern grammar align form earlier stage program start search align sentenc pattern grammar figur align found stage individu word sentenc pattern grammar program align align found pattern grammar align stage align word level pattern grammar form align give form align np np give np form align give align np give result shown figur align form weed select process outlin model work shown figur section intend complement explain aspect model fill detail requir insert figur figur outlin model preliminari process calcul inform cost symbol section rule grammar frequenc occurr notion sampl languag step figur model deriv frequenc occurr symbol type section frequenc step calcul minimum number bit repres symbol type code scheme cover thoma section result valu symbol type assign cost valu symbol symbol cost minimum cost arbitrari round ensur actual cost bit larger minimum cost section code symbol impli trie devic divid unseg bit stream constitu symbol strictli inform cost trie enter calcul encod cost alphabet cost constant small proport total cost larg volum data case inform cost identifi code symbol establish encod cost pattern figur pattern grammar assign minimum number bit requir discrimin pattern pattern grammar frequenc pattern outlin section build structur function figur function figur heart model section amplifi aspect descript figur model design search align singl sequenc section stage align project discard section temporari measur treatment align requir model includ learn section align retain model project singl mean align treat pattern symbol facilit build sketch begin section figur infer outlin descript begin section function appli iter pattern simpli sentenc subsequ list drive pattern subset align form cycl iter stop align found satisfi condit fuzzi match pattern step function base central process process relat dynam program wagner fischer design find match pattern pattern match subsequ symbol pattern match symbol pattern vice versa techniqu symbol drive pattern make match symbol set target pattern record sequenc posit match structur sequenc hit hit repres align drive pattern target pattern wolff hit structur form trie node repres hit path root leaf node repres sequenc hit import differ match process hit sequenc drive pattern target drive pattern match singl target pattern model find hit sequenc drive target pattern instanc symbol match drive pattern target pattern align check made ensur instanc symbol match match meaningless term identif redund symbol drive pattern symbol target pattern deriv unif check made exclud hit set symbol hit symbol deriv symbol common set symbol hit symbol deriv pattern grammar time symbol origin pattern column align order symbol preserv match process system align pattern consid earlier pattern np align avoid format align violat order symbol system make check order symbol honour estim compress score hit structur compress score align hit sequenc calcul stage cost lot process slow model simpl method estim compress score step figur result correspond valu calcul formula present section differ critic purg hit structur figur section determin threshold convert hit sequenc align figur section purg hit structur space alloc hit structur exhaust hit structur remov branch worst hit sequenc mean determin estim compress score calcul step space sequenc hit store distinct featur techniqu techniqu record hit trie list coupl mechan purg hit structur space import differ techniqu find partial match tradit kind string compar arbitrarili long search control vari space hit larger space give result smaller unlik standard dp system deliv set altern align sequenc singl align score select align build align score hit structur set drive pattern hit sequenc convert exclud align singl sequenc section exclud align cs threshold low neg search process explor region superfici lead good result process convert hit sequenc align achiev creat sequenc symbol unif drive pattern pattern target pattern creat arrai repres align arrai occupi portion memori alloc dynam time align form sequenc enter match unif iter arrai full structur align check ensur instanc symbol match ensur order symbol violat time ident align form rout program check align align align duplic discard process compar align order top pattern align section align surviv check duplic ad cs comput method formula section preliminari select align model boolean paramet switch start run control align discard stage function paramet switch program discard align gap sequenc symbol symbol column symbol paramet switch program discard align gap sequenc symbol pattern symbol part hit symbol li column symbol main paramet save time test exampl align gap hit sequenc program give final result paramet switch process quicker switch select align purg hit structur space major model narrow search space select align end cycl exclud origin pattern program examin align ad start process select subset method align remov discard program select subset align remain drive pattern cycl align remov function target pattern sight natur select align pure basi compress score easili happen intermedi stage align trivial variat involv subset symbol select made align cs align chosen involv subset symbol symbol part lost model build align symbol find answer solut problem work make select relat symbol align achiev set arrai column symbol number row model examin align order cs enter refer align column symbol form hit symbol provid column full align examin cell arrai list align arrai count subsequ align arrai merit techniqu align align subsequ symbol low cs compar align number align select inter number row arrai select align retain number result typic determin paramet model select drive typic number determin paramet model row number align select larg begin process align small part stage align symbol comput complex grammar articl accompani smaller requir realist comput demand multipl align reader framework scale handl realist larg grammar longer sentenc shown time complex function find good partial match serial process sum length drive pattern sum length pattern big typic system perform dynam program parallel process time complex approach depend parallel process appli space complex substanti space complex dynam program algorithm align built align pattern align number pair requir build align sentenc approxim log length sentenc constant valu success pair start small length sentenc sum length pattern grammar larger align ad select drive pattern select process section ensur initi size remain align stage longer earli stage fewer assess comput reason assum variat size start finish process discount time complex serial process environ approxim length sentenc sum length pattern grammar parallel process time complex approach depend parallel process appli space complex reason approach embodi lead run time demand storag impract approach appli realist larg grammar sentenc longer consid articl decod product languag section code sentenc deriv align set sequenc includ sentenc rule grammar section idea sight contradictori decod code sentenc achiev process compress multipl unif achiev origin superfici care read section convinc reader sound law logic mathemat violat origin process sentenc creat find align set sequenc includ pattern encod sentenc rule grammar creat encod encod align evalu term potenti compress sentenc case encod sentenc case figur show align kind top figur sequenc encod version sequenc figur rule grammar shown figur align interpret project constitu symbol singl sequenc case align figur result project shown section sequenc grammat symbol word order regard sentenc code sequenc insert figur figur align sequenc includ encod sentenc rule grammar shown figur compress judgement align figur good reach essenti align figur measur extent sequenc top encod term grammar rule align case sequenc encod term grammar compress sentenc unlik sequenc encod redund symbol repres theoret minimum number sequenc redund kind discov extract model encod net compress achiev lossless unif match symbol grammar mean distinguish align align achiev compress input sequenc guid program enorm search space align prospect find mean align answer problem provis distinct valu section minimum theoret minimum calcul actual larger constant factor calcul cs align section actual valu symbol comput number bit requir repres sentenc sequenc form minimum valu symbol comput number bit requir encod align cs deriv repres maximum compress theoret maximum compress usabl practic lead trap decod code sequenc distinguish decod cs calcul impli smaller code serv search process distinguish align ad redund symbol encod form sentenc decod achiev process compress ident process encod origin form forego remark reflect gener truth lossless compress bodi inform requir origin form inform encod form inform residu redund exist residu redund obviou decod decod model capabl find align shown figur grammar shown figur sequenc earlier version distinguish cost cost capabl find align exampl identifi altern includ correct yield compress futur develop section discuss briefli wai idea develop futur refin model model fairli robust produc result accord close intuit area weak room improv issu explor futur search method grammar incorpor convent trivial easi arithmet express express nest bracket model easili fail find kind lost easili altern wai bracket express align bracket grammar stuck peak search space achiev result set paramet model explor larg part search space altern model find align assign compress score higher penalti long run time requir answer problem constrain model work parser modif model ad hoc specif problem gener search method discontinu depend syntax accompani ambigu syntax discuss accompani solut problem gener model requir search strategi emploi model search strategi adapt paramet control size search space refin search method model achiev effect scope search speed process parallel process hardwar model develop softwar system convent comput conveni develop demonstr concept form suitabl practic heavi comput demand larg search space model explor abstract model envisag develop applic high level parallel initi softwar virtual machin exist hardwar case develop hardwar tailor requir model model research programm aim develop singl simpl framework accommod deduct probabilist pattern recognit ad hoc provis function framework articl small modif meet goal subsect describ briefli model futur overview rang concept fit framework present wolff mean work hypothesi research programm pattern symbol coupl ic manner suffici repres kind includ effici manner support shown framework accommod class hierarchi inherit attribut linguist structur accommod natur grammar kind shown extend seamlessli includ syntact form product languag radic round model languag understand product languag base mean futur work aim establish true process languag requir infer idea state explicitli languag anticip develop area advantag appar potenti model devic draw deduct probabilist outlin section learn process sentenc sequenc symbol term grammar context system regard process inform term inform encod term inform inform receiv unifi fulli pattern part unifi exist pattern simpli ad hypothesi research process ad knowledg manner redund captur essenti learn match unifi pattern result partial match unif set pattern symbol ad point origin pattern reconstruct time match unif symbol result compress begin grammar pick discret entiti assign syntact class defin context word extens account grammat structur learn match unif pattern extern present wolff articl referenc infer pattern system incomplet good align make infer predict miss part part input pattern input pattern grammar pattern repres common yield infer word probabl interpol model total natur pattern model make kind system make interpol predict suppli pattern attract framework context accommod infer kind infer connect indirect indirectli link align unif pattern outlin idea area present wolff concept understood framework discuss length wolff symbol assign accord longer code bit symbol symbol rare pattern shorter code common pattern increment model kind easili happen pattern initi rare common vice versa process period review frequenc occurr pattern make adjust length code pattern similar process occur shorten word turn shorten shorten shorten gave process occur gener lengthen word fall point make effort word intend intend potenti model probabilist infer system explor futur articl show languag understood ic multipl unif search concept depend human judgement evalu approach depend part deliv experi date suggest experi establish approach reflect linguist intuit featur superfici paradox idea singl process inform compress multipl unif search achiev encod decod analysi product sentenc simpli practic term offer prospect search engin offer theoret bonu extend explanatori rang model ad hoc addit modif appar benefit altern view languag process repres syntax natur languag simpler exist method discuss present accompani repres linguist knowledg benefit creation grammar natur languag simplifi automat learn grammar natur languag envisag futur develop programm research motiv develop idea potenti offer integr aspect comput includ pattern inform retriev aim research programm success failur develop model exhibit favour combin conceptu simplic explanatori descript power adjust inform valu symbol light gap hit calcul section adjust made inform cost symbol light gap exist hit sequenc involv appendix explain adjust describ method comput tabl factor make adjust approach gener approach assess sequenc hit sequenc symbol product chanc process sequenc symbol random unrel expect find subsequ sequenc match subsequ sequenc sequenc hit sequenc regard lack detect redund compress inform accord standard practic hit set hypothesi hit sequenc result chanc find probabl find hit sequenc inclin reject null hypothesi accept proposit hit sequenc result chanc congruenc structur pattern appli individu hit hit sequenc hit hit sequenc immedi hit judg hit previou hit gap unmatch symbol symbol sequenc probabl translat valu shannon argu occurr event probabl convei inform occurr event improb absolut inform valu calcul rel inform valu adjust made inform valu symbol involv hit sequenc span probabl sequenc null hypothesi sequenc symbol sequenc regard result roll size alphabet symbol present matter sequenc fact intern structur null hypothesi model serv null number combin side roll die roll die number combin null hypothesi relationship stream probabl obtain hit roll die roll die null probabl obtain hit roll die roll die die roll die roll number greater chanc obtain hit probabl obtain hit die roll time calcul probabl obtain hit situat discuss repres number opportun obtain hit number opportun obtain hit symbol dub roll time roll larger tempt sight span case reflect show number opportun hit case appli analog symbol sequenc hit hit read hit hit number unmatch symbol start sequenc subsequ number unmatch symbol previou probabl hit span sake focu attent probabl hit span practic includ present interest li probabl hit span calcul discuss explan formula lowri indebt dr stephen observ formula assum hit hit valu assumpt made unreason begin symbol sequenc refer point hit hit sequenc begin symbol sequenc refer point underlin arbitrari read read give requir resolv uncertainti hit hit hit probabl hit pair symbol probabl pair symbol method make calcul base directli method present lowri chapter inform scale factor span hit amount inform convei hit occur span amount inform calcul log hit clear probabl obtain hit smallest progress biggest progress convert rel scale divid tabl scale factor rang span comput start process size alphabet obtain scan symbol tabl compress score align calcul adjust inform symbol hit depend hit adjust achiev simpli multipli inform cost symbol relev scale factor hit scale factor inform cost symbol involv hit reduc progress larger valu scale factor inform cost correspondingli reduc largest entri tabl scale factor larger scale factor acknowledg grate prof wallac monash discuss idea present dr tim porter depart mr john school electron engin comput construct comment earlier version articl refer stochast comput combin bayesian predict techniqu rapid speaker adapt continu densiti hidden markov comput speech posterior probabl distribut align applic paramet estim evolutionari tree optim multipl align journal molecular evolut model align macromolecul journal molecular minimum messag length encod comparison macromolecul bulletin mathemat barton protein multipl sequenc align flexibl pattern match method experi solv analog problem minim length encod present appli technolog april stream comput learn probabilist pp della della maximum entropi approach natur languag comput survei multipl sequenc comparison method bulletin mathemat find probabl model langlei comput model scientif discoveri theori chapter morgan san element inform theori john wilei critic comparison consensu method molecular sequenc nucleic acid probabl adapt speech comput speech evolutionari tree dna maximum likelihood approach journal molecular manipul algorithm probabl measur problem solv annal mathemat artifici languag model stochast automata variabl length comput speech introduct kolmogorov complex applic york architectur chanc oxford press bayesian belief network tool stochast speech encod induct infer frawlei knowledg discoveri mit cambridg mass applic inform theori genet mutat match sequenc journal theoret model shortest data descript search common pattern stochast algorithm comput data method theori comput scienc maryland smooth bayesian learn fast increment comput speech pattern match method protein sequenc comparison structur predict protein correct problem journal inform measur classif comput inform compress multipl unif exampl issu logic inform compress multipl unif search octob inform compress multipl unif search gener theori comput februari learn reason inform compress multipl unif search gammerman comput learn probabilist pp earlier version present appli technolog april stream comput learn probabilist pp comput overview sp theori system gener comput gener multipl align comput august scaleabl techniqu retriev sequenti inform search journal inform comput inform repli ai cognit inform compress ai concept softwar softwar engin theori cognit comput elli chichest simplic power unifi idea comput comput learn syntax mean optim distribut analysi brain categori process languag acquisit lawrenc nj reprint chapter wolff languag data compress gener languag reprint chapter wolff stochast transduct grammar bilingu parallel corpora comput figur figur read rule frequenc occurr notion sampl store pattern frequenc read sentenc store frequenc deriv frequenc symbol grammar section frequenc symbol assign symbol number bit repres inform symbol calcul inform cost symbol section pattern calcul minimum number bit encod pattern section select sentenc add pattern empti list drive pattern align compress align print css figur clear structur drive pattern select drive pattern set drive pattern symbol current drive work left current drive select symbol pattern symbol make match symbol pattern record posit match structur symbol hit structur build record sequenc hit drive pattern target pattern hit sequenc compress score align estim comput method estim space alloc hit structur fill system worst hit sequenc hit structur space select estim compress score assign hit sequenc step hit sequenc estim compress score threshold singl sequenc convert hit sequenc align discard align ident align comput compress score method section print align add align quit function exclud origin pattern examin align ad begin process subset align method text remov align select origin pattern remov clear list drive pattern method restrict select subset align remain add refer align list drive pattern pattern remov target pattern
IR/1446 5 document classi cation arti cial neural network dieter merkl andrea rauber institut technisch wien austria abstract text collect regard perfect applic arena neural network oper comput perform text document classi cation task base noisi pattern reli map produc map document space train process map repres inform space applic provid hierarch view underli data collect form atla start map repres complet data di erent region shown ner level granular user easili region interest gener map orient show similar displai obtain hierarch featur map repres content document archiv neural network layer architectur layer consist number individu map content text archiv repres arbitrari detail gener map global orient introduct todai inform ag constant massiv product dissemin written inform power tool organ mass inform aspect explor found limit attent current inform retriev technolog reli system retriev document base similar document queri attract assist user document archiv explor base arti cial neural network document space number research public show idea found appreci commun map visual similar document term distanc map displai similar document found neighbor region map displai dieter merkl andrea rauber map metaphor document space limit document repres singl map document featur space constitut index term repres content map necessarili show world di erent page atla page map show portion world speci suggest kind atla document space page atla document space show portion librari resolut omit part librari long gener map provid overview librari user librari map provid detail view area interest comparison tradit document archiv reveal archiv organ hierarchi subject matter document observ stimul research inform retriev direct hierarch cluster techniqu base statist cluster analysi speci strength weak approach explor interest recent approach reli cluster queri process paper argu favor establish hierarch organ document space base neural network show ect hierarch featur map text archiv organ distinguish featur model layer architectur layer consist number independ selforgan map train process result hierarch arrang document collect map higher layer hierarchi repres organiz principl document archiv map lower layer hierarchi provid distinct individu document organ close expect convent librari import bene train process note librari organ deriv sole document semant label label subject matter remaind work organ section give descript architectur train rule neural network studi section dedic descript text document constitut document librari section provid result document classi cation describ result librari organ map metaphor result hierarch featur librari organ document classi cation arti cial neural network atla metaphor section give review relat research document classi cation map arti cial neural network model adher learn paradigm section present topolog preserv neural network map map promin arti cial neural network model adher learn paradigm model consist number neural process unit unit assign weight vector import note weight vector input pattern train process map term input pattern present weight vector adapt train iter start random select input pattern input pattern present map unit determin activ euclidean distanc weight vector input pattern calcul unit activ unit lowest activ refer train express min weight vector winner weight vector select unit vicin winner adapt adapt implement gradual reduct di erenc compon input pattern weight shown express ci geometr weight vector adapt unit move bit input pattern amount weight vector movement guid learn time number unit ect adapt determin neighborhood ci number unit time end train process winner adapt neighborhood function unimod function symmetr locat winner monoton distanc winner gaussian model neighborhood function express repres vector point locat unit jjr jj denot dieter merkl andrea rauber distanc unit winner current train term output space common practic begin train wide area output space subject adapt spatial width unit ect adapt reduc gradual train process strategi format larg cluster begin input discrimin end train process spatial width adapt guid mean paramet ci exp jjr jj movement weight vector euclidean distanc input weight vector weight vector similar input pattern respect unit win futur present input pattern consequ adapt winner number unit neighborhood winner lead spatial cluster similar input neighbor part map similar input pattern present input space mirror output space map train process map describ topolog preserv map input space output space pattern similar term input space map geograph close locat output space figur graphic map map consist squar arrang shown circl left hand side gure black circl unit select winner present input pattern weight vector move input pattern nearer adapt perform number unit vicin winner unit mark shade circl figur shade correspond strength adapt weight vector unit shown darker shade move closer unit shown lighter shade hierarch featur map kei idea hierarch featur map hierarch setup multipl layer layer consist number independ map map rst layer hierarchi unit map map ad layer hierarchi principl repeat layer hierarch featur map figur document classi cation arti cial neural network output space input space fig architectur map provid hierarch featur map layer rst layer map consist independ map layer map layer consist map layer fig architectur hierarch featur map train process hierarch featur map start map rst layer map train standard train process map rst map minor adapt weight vector train proce map layer map train portion input data map respect unit higher layer map amount train data map reduc hierarchi vector repres input pattern shorten transit layer shortag due fact input vector compon expect equal input data map unit equal compon omit train layer dieter merkl andrea rauber map loss inform loss inform omit portion input vector repres higher layer unit comparison model hierarch featur map bene ts map make model attract inform retriev set remaind paper hierarch featur map substanti shorter train time map reason twofold obviou input vector dimens reduct transit layer shorter input vector lead directli reduc train time faster winner select weight vector adapt train process perform faster spatial relat di erent area input space maintain mean network architectur mean train process detail treatment issu found hierarch featur map produc disjoint cluster input data disjoint cluster gradual ned move hierarchi contrari map basic form produc disjoint cluster separ data item tricki task requir insight structur input data map input data similar pictur contrast model neural network map produc map input data hierarch featur map produc atla input data differ model obviou point provid user singl pictur underli data archiv long map pictur sucient map grow tendenc provid orient user case chang hierarch featur map model repres content data archiv data organ hierarch facilit relev portion data archiv map world order singl map document archiv document atla follow hierarchi map path world europ austria vienna order nalli similar atla document archiv document classi cation arti cial neural network document collect task text classi cation aim uncov semant similar document rst document map languag order enabl process term index inform retriev literatur number di erent strategi suggest year inform retriev research common techniqu singl term index text document access word form document extract word map word stem yield term repres document result set term clear word rare document collect uenc discrimin di erent document unnecessarili comput load classi cation model inform retriev document collect repres mean featur vector form correspond index term extract document speci correspond import index term describ document hand lot strategi prescrib import index term document loss assum import repres scalar rang mean index term absolut unimport describ document deviat proport import index term hand similar text document correspond distanc vector experi present edit cia world sampl document archiv cia world repres text collect inform countri region world inform split di erent categori forc descript austria figur index repres document complet inform countri index present set experi refrain identifi document segment inform categori edit cia world consist document index process identi ed content term document index omit term document document term weight dieter merkl andrea rauber austria geographi total land compar slightli smaller main land km hungari itali switzerland frg yugoslavia km south question itali cold winter frequent rain snow cool summer mountain alp west gentl slope eastern northern margin natur iron crude land perman forest includ steep poor cold popul concentr eastern strateg locat central europ easili pass major river peopl growth rate birth popul death popul net migrat popul infant live birth life expect year year femal total fertil children ethnic roman german labor industri agricultur estim austrian emploi european foreign labor austria number labor forc organ member austrian trade union feder govern republ austria feder republ vienna administr state wien novemb legal civil law system roman law judici review legisl act constitut separ administr accept compulsori economi austria stabl economi proport nation industri extens welfar benefit excel raw materi technic skill labor strong link west german industri austria successfulli occupi special nich european industri servic produc food feed labor forc agricultur live standard roughli compar larg industri countri western europ problem includ ag popul struggl welfar benefit budget capabl real growth rate ation rate revenu expenditur includ capit expenditur na billion iron paper commun km km govern km privat km standard gaug km km doubl km narrow gaug km km primari network km km km km pave km km commun road forc fly militari male fit militari reach militari ag annual billion fig cia world countri descript austria document classi cation arti cial neural network simpl tf weight scheme term frequenc time document frequenc index vocabulari document repres model inform retriev vector repres document neural network train map world base document descript outlin rst train map repres content document archiv figur graphic train result identifi row unit graphic separ row horizont line unit mark number countri dot countri unit serv winner countri input vector repres contrari dot unit select winner document figur show map success arrang input data mutual similar obviou gener countri belong similar geograph region similar respect di erent categori cia world geograph region found map displai order interpret map train mark region manual area left hand side map alloc document describ island cia world larg number descript island interest descript ocean found map region neighbor area island lower middl part map lower center map european countri cluster repres countri cluster small san cluster western european nalli cluster eastern european countri cluster repres singl unit row output space unit neighbor countri attribut belong north soviet union point import recal document archiv edit cia world descript refer time cluster interest region countri latin america cluster arab countri cluster african countri dieter merkl andrea rauber island french land baker island isl island johnston island ocean atlant ocean indian ocean pacif ocean german dem rep hungari poland peru brazil chile rep da india island island island juan de nova island island island wake island north korea costa el mexico island coral sea island heard island island island denmark finland sweden japan unit state soviet union yugoslavia egypt indonesia jan zone norwai austria belgium franc german fed rep spain switzerland canada portug unit kingdom australia zealand china taiwan israel jordan south georgia world strip west bank itali greec ireland turkei singapor south korea sri south unit arab north island isl man island san south africa india cypru coast british island island turk island jersei island saint french french hong kong netherland cook island puerto rico island saint saint saint vincent cape central african rep sierra leon island island island saint pierr north island american marshal island solomon island western latin america ocean island western europ europ small state arab state africa island fig map world sake note result document classi cation map mention cluster western european countri misclassi ed respect geograph locat econom situat reason speci placement intuit netherland map island cluster upper left part map countri unit hong kong document space highli success similar document locat close easi orient document space neg document classi cation arti cial neural network document repres map selforgan map repres data space index natur inform lost map process dicult identifi cluster imagin figur dash line indic cluster boundari inform african countri prior inform document collect atla world previou section result map data cia world major shortcom neural network model document repres output space make dicult identifi cluster boundari profound insight underli document collect hierarch featur map provid essenti assist isol di erent cluster isol cluster achiev architectur neural network consist layer independ selforgan map highest layer complet document archiv repres mean small map term number neural process unit develop branch neural network experi present setup hierarch featur map layer respect map rst fourth layer setup determin empir seri train run shortcom arti cial neural network model architectur de ned train begin order understand underli data materi address issu work increment grow version hierarch featur map architectur de ned result learn process prior inform depth hierarchi size layer determin train rst experi arti cial neural network model highli encourag similar result present work obtain figur present content rst layer map order inform minimum refrain show countri gure present aggreg inform countri dieter merkl andrea rauber island island island ocean small countri africa latin america econom develop countri asia arab state small countri fig hierarch featur layer remaind discuss present branch hierarch featur map call econom develop countri branch shown work space form similarli figur show arrang layer branch econom develop countri countri separ roughli geograph locat polit system cluster symbol di erent shade grei state asia north america western europ fig hierarch featur layer figur show branch econom develop countri case identifi cluster boundari cluster repres individu map higher level similar shown higher level hierarch featur map relat work document classi cation arti cial neural network gain attent inform retriev commun rst paper mention work author argu favor neural network queri neural network role system perform document classi cation arti cial neural network soviet union austria switzerland japan north korea german dem rep itali german fed rep belgium finland sweden denmark poland yugoslavia hungari norwai greec denmark finland sweden spain south africa portug belgium german fed rep itali unit kingdom ireland canada zealand australia unit state south korea turkei franc state asia north america western europ fig subset world econom develop countri retriev order describ relat document hand line research continu compar work approach reli network report paper author describ experi weight neural network comput learn strategi set directli term frequenc histogram studi di erent line research perform neural network paper lin al mark rst attempt util neural network inform retriev task similar author reli map document made manual select index term realist line research time index document shortcom map mention remark comput demand learn rule possibl speed learn found learn rule biolog motiv concept inhibit di erent realiz principl pragmat learn function incorpor inhibit push weight vector unit distant winner slightli current input pattern ect learn function phase rough input cluster term number learn iter reach stabl state process conveni behaviour learn rule remark accuraci pattern term remain quantiz error complet train process dieter merkl andrea rauber mean speed learn process relat document featur space free correl due inexact map natur languag text lexic entiti interest transform origin document lower space underli principl latent semant index techniqu compar result achiev princip compon analysi order reduc featur space refer recent report princip compon analysi area document process approxim princip compon gain util feedforward neural network train reproduc input output layer smaller layer hidden unit smaller hidden layer repres input pattern ect dimens reduct document subsequ map train compress input pattern summar experi basic cluster result achiev spend fraction time train process number paper publish util map text base semin work subsequ interact explor websom project interest aspect project radic di erent document methodolog pragmat word document analyz mean map lead word categori map repres document text archiv gener word categori map compar work word categori reli convent report recent work interest issu investig feasibl map organ distribut document archiv paper argu favor repres portion document archiv mean selforgan map integr order give overview complet archiv develop method automat assign label unit map label deriv analyz term pattern document map neural unit label give clear hint content document facilit interpret train result map limit number model evalu usabl inform retriev applic author report applic grow cell network adapt architectur learn document classi cation arti cial neural network process arti cial neural network highli similar map train cycl weight vector winner number unit neighborhood winner adapt slight variat concern de nition neighborhood direct neighbor winner account fundament xed number train cycl unit ad network posit highest quantiz posit largest deviat weight vector input pattern repres unit unit serv winner delet network ect learn strategi network structur adapt requir input space map network structur term number unit topolog de ned prior train process requir learn relat network structur adjust advanc suscept minor variat paramet map report applic adapt reson theori network document cluster provid major advantag type network fast learn speed combin continu network capabl add data item rudimentari form adapt reson theori network consist repres input pattern repres cluster term number competit unit distinguish characterist type arti cial neural continu achiev ad competit unit case exist repres actual input pattern satisfi accuraci regard adapt reson theori network earliest arti cial neural network model adapt weight adapt architectur inform deduc result number appar usabl arti cial neural network model unexplor applic document cluster concern gener topograph map recent suggest develop substitut wide map neural network describ latent variabl densiti model sound statist foundat claim advantag properti compar signi disadvantag import advantag gener topograph map open rigor mathemat area map remark tradit ectiv resist imagin altern model lend mathemat treatment reduc highli larg number empir test order dieter merkl andrea rauber realiz success arti cial neural network applic question neural unit repres set input pattern satisfactori accuraci answer found empir map hierarch featur map neural network proven remark success tool explor analysi document archiv number studi demonstr neural network highli capabl uncov similar text document paper provid account feasibl neural network highli import task inform text classi cation document collect descript countri edit cia world document collect easi judg qualiti classi cation result document reli vector space model simpl tf idf term weight scheme demonstr map hierarch featur map highli assist user orient document space shortcom document shown larg map borderlin cluster relat cluster unrel document hard case user sucient insight content document collect hierarch featur map overcom limit cluster document visibl architectur neural network document space separ independ map layer hierarchi user world similar document shown level map lower layer hierarchi organiz principl document archiv shown higher layer map hierarch arrang document common organ convent small intellectu overhead requir user document space acknowledg anonym review insight comment earlier version work document classi cation arti cial neural network refer domain languag independ featur extract statist text categor proc workshop languag engin document analysi unit belew connectionist approach conceptu inform retriev proc intl confer arti cial intellig law belew adapt inform connectionist retriev learn document proc acm sigir intl conf research develop inform retriev william principl altern map proc intl conf arti cial neural network william gener topograph map technic report neural comput research unit carpent grossberg art adapt pattern recognit neural network ieee cottrel fort dun annal de henri thing kohonen algorithm proc european symposium arti cial neural network crestani learn strategi adapt inform retriev system neural network proc ieee intl conf neural network san index latent semant analysi journal american societi inform grow cell network learn neural hearst pedersen reexamin cluster scatter retriev result proc intl acm sigir conf inform retriev honkela map word natur languag process applic intern icsc symposium soft kohonen newsgroup explor websom method interfac technic report helsinki laboratori comput inform kohonen websom map document collect workshop dieter merkl andrea rauber kohonen contextu relat word grimm tale analyz map proc intl conf arti cial neural network princip compon analysi schwartz synapt transmiss principl neural scienc wilkinson hierarch ltere proc intl conf practic aspect knowledg merkl visual similar high input space grow split neural network proc intl conf arti cial neural network kohonen format topolog correct featur map biolog kohonen map kohonen larg document state art proc intl conf arti cial neural network honkela larg som newsgroup proc intl conf arti cial neural network kohonen map document approach interact explor proc intl conf knowledg discoveri data mine marchionini semant map inform retriev proc acm sigir intl conf research develop inform retriev merkl connectionist view document classi cation proc australasian conf merkl document classi cation highli compress input data proc intl conf arti cial neural network merkl softwar classi cation proc ieee intl conf neural network merkl ect inhibit learn speed map proc australian conf neural merkl explor document collect approach similar proc european symposium principl data mine knowledg discoveri merkl explor text collect hierarch featur map proc intl acm sigir conf inform retriev merkl text classi cation lesson learn merkl rauber uncov associ document proc workshop text document classi cation arti cial neural network connot analysi thesauri base interpret context mean proc intl confer expert system applic miikkulainen script recognit hierarch featur map connect miikkulainen process base inhibit synapt resourc redistribut proc intl conf arti cial neural network miikkulainen subsymbol natur languag integr model memori rauber merkl creat order distribut digit librari integr independ map proc intl conf arti cial neural network rauber merkl automat label make reveal secret proc paci asia conf knowledg discoveri data mine ritter kohonen semant map biolog rose symbol connectionist approach legal inform retriev lawrenc rose belew legal inform hybrid approach proc intl confer arti cial intellig law ramsei inform forag adapt visual proc acm intl conf digit librari salton automat text retriev inform comput salton bucklei term weight approach automat text retriev inform process turtl croft comparison text retriev model comput wilkinson incorpor vector space model neural network inform retriev proc acm sigir intl conf research develop inform retriev willet trend hierarch document critic review inform process zavrel neural navig interfac inform appeal arti cial intellig
ML/1447 6 boost rocchio appli text filter robert yoram amit singhal lab research park florham nj abstract discuss learn algorithm text modifi rocchio boost algorithm call adaboost show algorithm adapt maxim gener util matrix associ cost pair machin predict correct label show adaboost significantli outperform highli effect text filter algorithm compar adaboost rocchio larg text filter task algorithm compar effect adaboost produc classifi rocchio train collect larg number relev document rocchio run faster adaboost introduct amount inform inform filter system automat send articl potenti interest user increasingli import user interest filter system exampl system automat learn user profil relev classifi user articl exhibit substanti match user filter user text filter binari text classif categori problem text filter studi commun machin learn inform retriev algorithm text filter evalu bayesian nearest neural studi rocchio method algorithm ir commun relev recent document rout comparison baselin classifi studi weak version rocchio text filter recent ir commun modif rocchio algorithm vastli improv perform term weight dynam feedback optim notabl improv adapt state art rocchio algorithm text filter compar fairli ml algorithm call develop text filter algorithm base freund schapir adaboost algorithm permiss make copi part work person classroom grant fee provid copi made distribut profit titl public date notic copi permiss copi post server redistribut requir prior specif permiss fee australia fl acm success famili boost algorithm main idea boost gener weak classif rule combin singl highli accur classif rule boost algorithm attract theoret shown perform standard machin learn task compar adaboost algorithm blum studi freund al appli text filter cohen singer algorithm shown effect current text filter algorithm show text adaboost definit superior compar adaboost rocchio method show algorithm competit algorithm learn linear adaboost superior rocchio larg amount train data learn faster train rocchio classifi previou studi text filter dataset evalu measur render rel comparison approach imposs evalu measur past evalu filter effect recent trec confer move util measur choic evalu text filter studi present result util research comparison futur studi aim ffl develop algorithm text filter base show algorithm highli effect algorithm text filter ffl adapt recent version rocchio algorithm text studi rel merit classifi ffl present result base evalu measur research futur comparison rest studi organ section discuss evalu measur text filter section describ adapt adaboost text filter section present modifi version rocchio algorithm text filter section describ dataset studi section describ experi discuss result section conclud studi evalu measur past studi text filter varieti measur evalu perform measur frequent comparison breakeven point lewi measur measur choic studi text filter roughli point point recal filter system point system recal system aim filter system obtain high point problem evalu filter system ffl interpol score obtain point interpol valu achiev system ffl point recal equal desir inform target user perspect strongli point evalu text filter studi measur evalu text filter ffl averag fix rank studi measur evalu filter effect measur intend evalu rank effect system filter effect filter effect system relat rank relationship strong rank evalu measur evalu text filter ffl van rijsbergen evalu singl valu measur depend rel import user assign recal pp main drawback measur directli interpret hard user judg rel import recal user find hard recal import ratio suit evalu filter big drawback measur list depend recal recal test document measur evalu system comput measur portion document classifi rest classifi instanc user check end dai filter system assess perform system measur studi evalu measur dont suffer drawback mention report perform result averag web page averag suit evalu filter report figur comparison research notat rank assign classifi document set relev document denot rel averag jd util trec text filter evalu util assign reward pair machin predict correct label number relev document classifi relev number relev document misclassifi irrelev number document classifi relev pair human relev machin predict associ util denot util valu rel perform classifi term util matrix rel aim filter system maxim util evalu measur simpli number mistak classifi sum number posit classifi number document classifi posit note minim classif error maxim util rel learn algorithm maxim util minim classif error problem classif error dataset relev classifi simpl strategi predict document achiev low error handl common specif reward classifi find relev document util explicitli reward system find relev document util measur studi rel boost text filter describ adapt freund schapir adaboost boost algorithm text filter main idea boost combin test presenc simpl word document predict document predict relev rule kind misclassifi document main idea gener combin rule principl manner produc singl highli accur classif rule call weak boost assum access algorithm subroutin gener call weak learner weak learn algorithm boost algorithm call weak learner time gener combin singl classif rule call final combin hypothesi featur boost algorithm assign import weight train document weak learn algorithm weight correctli classifi account greater import correctli classifi assign greater weight algorithm train document hard classifi correctli increment higher weight document document integ number iter initi classif call weak hypothesi hs calcul error hs ffl ds set ff ln ffl ffl updat ds sy hs zs ds zs hs ff hs zs normal factor output final fin sign ff sh figur adaboost algorithm binari text filter easi classifi lower weight forc weak learn algorithm concentr document misclassifi deriv final combin hypothesi classifi document comput predict weak document vote predict descript adaboost shown figur adaboost input train set pair yn document train label document mean document relev irrelev judg human adaboost call weak learn algorithm repeatedli seri round round adaboost set import weight train set comput weak hypothesi hs document classifi discuss weak learner experi import weight maintain formal distribut train document distribut denot distribut round ds weight train document distribut ds written maintain condit posit classif set weight equal initi procedur util goal weak learner find misclassifi document rel distribut ds weak learner attempt find weak hypothesi hs low weight error ffl error interpret probabl misclassifi document chosen randomli distribut ds sum weight relev document classifi irrelev hs irrelev document classifi relev obtain hypothesi hs adaboost updat weight document document classifi correctli lower weight misclassifi document higher weight adaboost multipli weight document correctli classifi hs weight incorrectli classifi document ff ff number comput discuss assum moment ff updat weight effect weight correctli classifi document weight incorrectli classifi document ff ensur weight form distribut renorm result updat rule shown figur zs ae ff zs normal factor note product equal rewrit updat rule succinctli figur process gener weak updat weight repeat round decid discuss section ht valu ff ff document classifi final fin sign ff predict weak evalu document predict combin vote weak predict document relev irrelev sum posit combin predict relev predict irrelev assign equal import predict weak weight vote weak valu ff updat distribut ds discuss exact choic ff ffl weight error weak hypothesi hs comput figur eq comput ff ff ln ffl ffl understand choic highli accur weak hypothesi hs found ffl small ff larg translat drastic updat distribut greater weight assign predict hs comput final hypothesi hs highli inaccur error ffl close ff updat distribut predict hs final hypothesi receiv low weight freund schapir complet motiv choic ff ff neg case weak hypothesi hs found error ffl greater discuss find weak weak learner gener hypothesi hs word pair adjac word potenti term implement capabl arbitrari long restrict word word bigram studi weak learner comput error distribut ds incur predict document relev term error mean term occur document rel mean document select term lowest classif error consist main aim select term maxim differenti relev term ta lowest term tb highest tb discrimin ta relev tb document higher confid confid relev document ta select tb hypothesi hs term minim ts select term form hypothesi hs document ae ts ts mention select term high error hypothesi hs boost algorithm automat assign neg weight hypothesi mean word predictor presenc automat reduc score document boost gener util function remain describ modifi algorithm order maxim gain gener util matrix rel util matrix notat introduc section gain classifi rel make natur assumpt gain correct classif incorrect rel minimum gain classifi classifi document gain rel assign initi gain aim classifi maxim addit gain amount time classifi classifi relev document gain rel time document classifi gain misclassif account misclassif result util rel util matrix impli relev document rel irrelev document relev document worth factor set initi distribut exampl round boost reflect ratio posit neg exampl fairli straightforward show maxim util matrix minim error initi distribut weight relev document time weight irrelev document handl gener util modifi adaboost manner weight initi set ae rel normal factor ensur note rest algorithm unaffect chang initi distribut number round set number round theoret analysi number round boost weak set empir found procedur yield good result run boost algorithm train error reach minim number round reach minim train error continu boost addit round total number round typic mean run round boost algorithm problem requir featur attain small train error put size result function number featur depend classif problem difficult problem larger classifi build rocchio text filter retriev document challeng problem field inform retriev earli research realiz hard averag user formul success aid good queri formul provid user automat queri formul relev user mark document retriev initi relev ir feedback queri creation algorithm develop rocchio proven relev feedback algorithm rocchio algorithm develop framework vector space model document rank ideal queri rank relev document document queri exist train train document gener document lower aim develop queri maxim differ averag score relev document averag score train error combin hypothesi uncommon boost proce reduct test error occur schapir al discuss document rocchio call optim queri page rocchio show optim queri vector differ vector centroid vector relev denot weight term vector document number relev total number articl collect neg compon result queri assign weight maintain focu research found includ origin feedback queri creation process coeffici introduc rocchio formul control contribut origin relev articl feedback queri modif yield queri reformul function ff fi fl develop rank document relev interact successfulli text filter inform filter document mark relev user inform creat rocchio formul articl high similar vector similar measur page user profil consid potenti user user techniqu improv effect rocchio method develop effect conjunct rocchio algorithm term understand term weight develop ir commun recent year term weight train document yield rocchio queri rocchio queri term weight test document yield improv score test document queri recent singhal al select set document relationship user interest rocchio method sampl document form queri zone dynam feedback bucklei al shown optim term weight rocchio formul train collect improv qualiti feedback queri test data view techniqu tool bring rocchio queri closer ideal queri techniqu version rocchio initi text filter factor eq ff system queri singhal al shown fi fl eq reason paramet set text back origin rocchio formul eq eq centroid vector relev document train corpu initi queri vector form queri zone step involv modifi rocchio method text tf tf tf idf df normal number uniqu word text averag number uniqu word document tf term frequenc text total number document train collect df number document averag number trec averag number trec factor factor factor factor factor factor factor factor tabl term weight initi creat centroid vector relev document train data document weight tabl remov word fewer relev document phrase fewer relev document infrequ term influenc queri select highest weight nw word np nw averag number word np averag number phrase document initi queri initi weight train form train select similar max document initi queri total number document train collect number relev document queri train collect document relev document train form feedback queri rocchio formul ffl document term weight ffl word word relev phrase occur relev articl consid feedback queri ffl top nw word np phrase step weight origin rocchio formula retain feedback queri weight predict formula term weight queri nw word np phrase optim dynam feedback optim pass ratio optim averag train fix number top document rank process rank top max document step optim feedback queri rank weight train document rank list train find similar threshold maxim evalu measur rate train data threshold classifi test document weight test document similar higher threshold feedback queri classifi algorithm similar rout algorithm ffl user queri relev centroid form queri zone previou work queri initi user queri ffl zone size grow class size class train relev document ffl modifi rank document larg class ffl word cooccurr pair didnt tune rocchio algorithm cover weak analysi show improv rocchio method larg class number term classifi didnt tune enhanc tune rocchio classifi explicitli maxim util tune studi plan investig futur test corpora text corpora test pai special attent document variat origin topic text suppli user experi text categor test collect made publicli web page david origin compil collect document collect collect reuter newswir modifi apt split assign document date april train document date april test set nineti topic categori relev train document relev test document test collect made document ap newswir includ trec disk document year train document year test collect document collect distinct titl field sgml tag distinct bodi field sgml tag bodi document experi twenti class collect descript class corpu deriv number posit exampl number posit exampl error error number posit exampl number posit exampl error error figur comparison adaboost collect lewi al note origin distribut data document year year make total train document format structur omit lewi al test skip detail document skip creation collect david lewi trec disk rout task text retriev train collect trec disk test collect made document disk total train document test document fifti trec number individu class collect trec topic long word text topic text system relev judgment topic trec data summari collect experi shown tabl preprocess entir collect train test long time run adaboost entir trec collect subset train collect train set select top document retriev train collect queri learn rocchio method idea ad relev document retriev procedur train set appli procedur collect test document classifi built adaboost test relev document test collect top test document retriev rocchio queri obtain sampl train collect rocchio method mean train test collect includ nonrelev document difficult classifi result obtain dataset good estim perform classifi true sampl test collect automat reject larg number document pool document classifi adaboost classifi potenti misclassifi possibl yield result poorer result report studi adaboost algorithm task util number min po max po train set test set dataset check task size size tabl summari dataset experi experi result section discuss experi result adaboost compar sleep expert give result show adapt adaboost text filter achiev result effect algorithm text filter studi recent cohen singer compar perform adaboost task figur show result comparison scatter plot left hand side figur show class adaboost function number relev document train collect reuter collect hand side plot ap collect point inferior adaboost make error plot class size size class number relev train document adaboost gener outperform larg margin figur show similar compar plot perform adaboost rocchio dataset left hand side scatter plot give differ middl plot show differ plot show differ adaboost rocchio function number relev train document point adaboost achiev point rocchio outperform adaboost error scatter plot corner indic adaboost rocchio class larg number relev document train collect raw find class adaboost significantli outperform earn acq class highest number posit train gener observ class larg number relev document train adaboost achiev lower error rate higher util valu observ rocchio adaboost result shown figur parallel result twenti adaboost rocchio term error largest class class japan class relev document train set advantag isnt differ perform algorithm time algorithm task current implement averag minut class learn classifi implement minut class averag differ run time make rocchio method attract slight loss effect big trec observ figur notic differ perform algorithm observ scatter plot point class relev train exampl indic rocchio margin case task notic differ method observ trec rel perform adaboost weaker evalu rocchio method adaboost analysi foremost result studi state art version rocchio algorithm competit modern machin learn algorithm text filter result contradict claim made previou studi infer rocchio method inferior state art machin learn algorithm result show train data learn principl learn algorithm deriv theoret foundat comput learn specif design gener learn classifi algorithm design rank document minim learn data learn strong learn algorithm adaboost stand chanc data reason expect rocchio consist outperform adaboost small class small rocchio effect task design rank relev document select threshold filter class rocchio achiev averag averag adaboost evalu util algorithm essenti perform indic rocchio unabl capit superior rank similar behavior observ averag evalu text filter suffici current implement adaboost util term crucial ir task basi good perform rocchio algorithm adaboost benefit significantli term studi wai incorpor weight adaboost error rocchio adaboost number posit exampl adaboost rocchio number posit exampl number posit exampl error rocchio adaboost number posit exampl adaboost rocchio number posit exampl number posit exampl error rocchio adaboost number posit exampl adaboost rocchio number posit exampl number posit exampl figur comparison adaboost rocchio result show filter relev document import hard job algorithm neg indic troubl classifi measur appar rocchio robust skew rel import relev document adaboost doesnt error compar rocchio havent studi phenomenon greater detail suspect high import relev document forc adaboost select featur relev result classifi train relev document poor perform adaboost trec possibl attribut sampl train algorithm task section adaboost train small set train unabl learn global occurr pattern word inform term weight due adaboost common term happen occur relev document sampl document train train entir wouldnt result develop effect algorithm text filter base recent develop machin learn base rocchio method develop inform retriev competit find adaboost significantli effect text filter algorithm prior research adaboost rocchio larg number relev document learn notic differ perform algorithm clear larg number relev document oper text filter system current rocchio significantli faster adaboost classifi base rocchio method viabl tool larg scale filter system order make adaboost attract larg problem relev algorithm improv significantli reduc comput time sought acknowledg david lewi data comment work refer jame allan increment relev feedback inform filter nineteenth annual intern acm sigir confer research develop inform page associ comput august fred weiss languag independ autom learn text method seventeenth annual intern acm sigir confer research develop inform page juli blum empir support winnow base result calendar schedul domain machin twelfth intern page class averag valu studi leo breiman arc classifi technic report statist california chri bucklei import proper weight method human morgan chri bucklei gerard salton optim relev feedback weight eighteenth annual intern acm sigir confer research develop inform page juli jp callan inform filter infer network nineteenth annual intern acm sigir confer research develop inform comput august william cohen yoram singer learn method text categor annual intern acm sigir confer research develop inform page yoav freund robert schapir experi boost algorithm machin thirteenth intern page yoav freund schapir gener learn applic boost journal comput system yoav robert yoram manfr warmuth combin predictor special annual acm symposium theori page harman overview text retriev confer text retriev confer page nist special public april david hull filter descript analysi sixth text retriev confer david jan hinrich schutz method combin document filter nineteenth annual intern acm sigir confer research develop inform page august thorsten joachim text categor support vector learn relev featur european confer machin learn david lewi person commun david lewi evalu phrasal cluster text categor task fifteenth annual intern acm sigir confer research develop inform page june david lewi evalu optim autonom text classif system eighteenth annual intern acm sigir confer research develop inform page juli david lewi filter track text retriev confer page nist special public novemb david lewi william gale sequenti algorithm train text classifi seventeenth annual intern acm sigir confer research develop inform page juli david lewi mark ringuett comparison learn algorithm text categor analysi page la april david robert jame ron papka train algorithm linear text classifi nineteenth annual intern acm sigir confer research develop inform page august andrew mccallum kamal nigam emploi em activ learn text classif ht wb kl low featur perceptron usabl case studi text categor twentieth annual intern acm sigir confer research develop inform page juli quinlan thirteenth nation confer artifici page se robertson walker simpl effect approxim model probabilist weight retriev seventeenth annual intern acm sigir confer research develop inform page juli jj rocchio document retriev evalu phd harvard comput jj rocchio relev feedback inform retriev smart retriev automat document page englewood prentic gerard salton automat text analysi retriev inform comput addisonweslei publish bucklei perform relev feedback journal american societi inform gerard salton mj mcgill introduct modern inform retriev mcgraw hill book gerard cs yang vector space model inform retriev commun novemb robert yoav peter wee sun lee boost explan effect vote method machin fourteenth intern amit singhal sixth text retriev confer amit chri mitra pivot document length normal nineteenth annual intern acm sigir confer research develop inform page associ comput august amit chri bucklei learn rout queri queri zone twentieth annual intern acm sigir confer research develop inform page juli van rijsbergen inform retriev harman overview sixth text retriev sixth text retriev confer yang evalu statist approach text categor technic report school comput carnegi mellon april yime yang expert effect effici learn human text categor retriev intern acm sigir confer research develop inform page juli yime yang reduct statist approach text categor eighteenth annual intern acm sigir confer research develop inform page juli
ML/1448 6 algorithm blind deconvolut marcel heinz georg signal inform process swiss feder institut technolog switzerland accept ieee intern symposium circuit system june fl abstract updat equat gener blind deconvolut convolv mixtur sourc signal deriv base updat equat blind sourc separ shown altern interpret natur gradient appli minim mutual inform criterion comput complex held minimum carri task frequenc domain algorithm compar similar blind algorithm valid demonstr simul acoust filter order assess perform perform measur blind deconvolut signal paper introduct blind blind deconvolut combin blind task carri number acoust commun structur separ algorithm understood neural train algorithm activ function depend partial statist signal separ train algorithm base method statist fast converg achiev natur rel gradient updat equat instantan mix case extend deconvolut case paper long filter requir deconvolut make implement frequenc domain advantag algorithm deconvolut sourc deriv verifi simul measur signal process linear mixtur origin sourc signal weight filter time denot total number sourc sensor denot forward shift delai convolut oper element convolut mix matrix filter lj repres path sourc sensor depend signal mix sampl time omit legibl blind sourc separ blind deconvolut easier blind sourc separ problem xu figur blind sourc separ fig show setup system blind sourc separ sourc signal mix mix matrix recoveri attempt blind adapt algorithm adjust coeffici separ matrix output algorithm order separ signal wa approxim close scale permut matrix updat equat separ matrix result minim mutual inform output signal appli natur gradient ident nonlinear blind mean compon involv updat equat separ process wx similar updat equat deriv written complex signal close final solut converg natur gradient learn algorithm simul shown decorrel process slightli faster exhibit fewer outlier separ process larg varianc separ perform measur gener smaller averag separ elimin matrix accomplish appli matrix case obtain blind deconvolut older problem blind separ blind deconvolut convolv signal sourc signal system channel interest constantli problem refer blind equal refer problem blind deconvolut simpli blind deconvolut adapt updat equat deconvolut filter repres input output complex conjug written impli time simpli obtain exchang replac updat equat evalu discret frequenc frequenc domain transfer signal tap frequenc sampl index isi figur blind deconvolut hear aid feedback path measur feedback path spectrum rang obtain spectrum global spectrum perform measur blind deconvolut algorithm versu time frequenc domain updat equat deconvolut filter frequenc domain vector block denot multipl vector frequenc vector matrix note nonlinear appli time seri output signal dft matrix demonstr efficaci updat equat shown measur feedback path hear aid depict fig tap filter white blindli fig show filter algorithm fig convolut filter filter illustr deconvolut perform locat control initi deconvolut filter length adapt filter chosen longer origin satisfactori result obtain tap fft length block length adapt process perform measur order find measur judg separ progress scalar number describ averag residu combin separ sourc output network blind sourc separ scale permut matrix entri row happen diagon ij power transfer sourc output row domin entri ij indic power transfer separ sourc entri end realist squar reveal power sourc leak output sourc equal power vice squar entri column power sourc leak output provid problem algorithm observ permut matrix render perform index measur ici ij ij max ij ij max ij ici simul environ practic true matrix matrix unknown blind deconvolut bd perform measur reflect deconvolut indic extent signal influenc adjac sampl signal defin system order global fir filter similarli defin isi max max blind deconvolut gener interest measur denot matrix filter polynomi global system entri ij ij ijk global filter sourc output find averag ici ici ijk max ijk ici measur algorithm separ sourc signal attempt calcul averag row permut matrix search entri filter energi calcul isi entri averag isi max ijk max max ijk altern measur reflect averag isi ici defin ijk max ijk calcul averag simpl relationship found row ici row isi row ici row isi row ici row isi row small separ row roughli equal sum measur result obtain analysi tap tap tap tap figur blind deconvolut filter sourc upper plot show randomli window filter lj sourc sensor lower plot show obtain deconvolut filter il sensor output blind deconvolut real problem blind deconvolut blind separ consid refer blind deconvolut approach side replac scalar matric filter polynomi bd side replac singl filter polynomi matrix filter polynomi merg equat borrow fir matrix algebra notat denot fir matrix vector element filter vector frequenc il il matrix tap tap figur blind deconvolut filter sourc plot show element ij sourc output notic desir channel approxim delai close demonstr deconvolut separ simul filter sourc carri block length adapt algorithm fft length mix channel obtain deconvolut filter tap center tap shown fig result depict fig good separ deconvolut close permut row column domin element close simpl time delai element approach perform curv shown fig chosen separ process converg similar deconvolut lead fastest converg larger smaller converg time slower process separ smaller deconvolut larger interest properti ici isi converg valu term sampl index ici isi figur perform measur blind deconvolut filter separ perform measur ici deconvolut perform measur isi separ perform measur neglect small db higher ici isi note delai channel differ delai indeterminaci blind deconvolut task harder mention converg time larger compar similar filter similar number sourc suitabl updat equat implement blind sourc separ found modifi updat equat blind sourc separ matrix interest case updat equat adapt solv blind deconvolut blind deconvolut short filter result long separ deconvolut algorithm oper frequenc domain advantag effici implement algorithm realiz frequenc domain similarli perform measur introduc paper shown efficaci algorithm refer comparison combin sourc separ proc intern confer independ compon analysi blind sourc separ januari pp learn algorithm blind signal advanc neural inform process vol pp aj bell tj approach blind separ blind neural vol pp aj tj unifi framework independ compon intern journal mathemat comput adapt sourc vol pp dec rh lambert aj separ multipl speaker intern confer speech signal april pp measur figur merit sourc proc intern confer independ compon analysi blind sourc separ januari pp rh blind fir matrix algebra separ southern er implement lm adapt ieee transact signal vol pp
ML/1449 6 explor reinforc learn factor mdp carlo depart comput stanford usa dale schuurman depart comput canada abstract central challeng reinforc learn balanc tradeoff scale larg problem reinforc learn promin method address recent progress gener renew interest pursu theoret work explor tradeoff yield provabl sound algorithm rmax work factor mdp yield algorithm scale larg problem recent benefit achiev combin factor algorithm kearn koller address shortcom factor requir oracl planner feasibl implement altern approach practic approxim approxim linear maintain desir properti develop explor strategi target improv perform linear program oracl planner lead simpl explor strategi visit state relev tighten lp achiev sampl effici logarithm size problem descript result show target approach perform approxim plan implement factor factor rmax introduct research reinforc learn consist develop algorithm effect manag explor tradeoff attempt scale larg problem research direct direct approach indirect approach amen scale larg problem recent develop reinforc learn markov process plan creat opportun techniqu algorithm kearn singh techniqu manag tradeoff yield approxim optim polici explor work recent simplifi gener rmax parallel develop progress develop compact larg mdp scale logarithm size state polynomi size state descript polynomi size thought essenti scale mdp plan realist problem factor mdp develop koller parr proven conveni combin linear function approxim practic effici plan algorithm base linear program easili implement line compact recent brought factor algorithm kearn koller algorithm combin theoret abil scale larg state space afford factor mdp shortcom reli oracl plan algorithm approxim optim plan explor exploit step approxim plan inher hard problem factor mdp factor algorithm feasibl implement main contribut paper investig practic approach implement factor version rmax approxim plan algorithm preserv theoret approxim linear program practic plan effici appli larg problem factor difficulti contribut develop step demonstr explor strategi tailor specif approxim plan algorithm explor requir term scale problem size approxim term constant factor target explor unknown region unknown region relev oracl effect direct explor domain uncertainti affect result approxim planner direct show linear program offer eleg avenu identifi relev uncertainti domain direct explor effect implement practic factor version rmax relev direct compar benchmark strategi simpl domain result confirm direct explor scheme yield benefit approach markov process problem calcul optim behavior stochast formal plan markov process mdp defin finit set set reward function rmax repres reward obtain state action markovian transit model repres probabl state state action stationari polici mdp map action agent state assum mdp infinit horizon agent interest maxim averag reward receiv time lim state system time expect sequenc state assum stationari polici result markov chain ergod averag reward independ start state optim polici set equat max maximum averag reward function interpret advantag start state random state chosen stationari distribut function defin polici obtain act greedili rel arg max greedi polici rel optim function optim polici algorithm comput optim polici averag reward mdp conveni approach linear program exploit formul explicit version requir linear state xn variabl linear program vn repres linear program vn subject polici implicitli repres slack variabl linear program state constraint fact optim action problem comput optim polici mdp import linear program variabl complet state state space larg set number state problem assum full knowledg model transit probabl reward function limit major hindranc applic mdp control real stochast system shortcom turn address issu larg state common approach function approxim compactli repres linear combin basi function linear function function written coeffici subset state variabl depend linear function linear program approach adapt produc approxim optim subject linear program feasibl set basi function analog linear program discount infinit horizon case qualiti approxim obtain recent work discount reward case analysi error rel approxim subspac transform effect reduc number free variabl linear program number constraint remain algorithm exploit structur factor mdp section obtain compact effici solut linear program limit explicit mdp plan unknown model focu extens work field reinforc learn recent exploit rmax obtain provabl perform time polynomi number quantiti number state larg handl explicitli method practic exploit structur factor mdp make algorithm feasibl kearn koller factor version algorithm factor mdp section present algorithm section factor rmax similar extens rmax algorithm factor mdp factor mdp exploit problem structur repres exponenti larg mdp compactli idea repres larg mdp factor model boutili al present factor mdp koller parr factor set state set random variabl xn valu finit domain state defin variabl defin state transit model dynam bayesian network denot variabl current time denot variabl success step transit graph dbn direct acycl graph node xn denot parent graph parent simplic assum parent arc dbn variabl consecut time slice node condit probabl distribut parent transit probabl defin variabl parent defin transit dynam mdp defin separ dbn model action provid compact reward function assum reward function factor addit set local reward depend small set variabl formal concept local definit function restrict scope ir restrict shorthand part instanti correspond variabl concept local reward set restrict variabl cluster xn reward function state defin ir transit assum decomposit action multiag action space exponenti larg result present paper extend system appli plan algorithm al factor larg mdp repres compactli address problem plan mdp tempt factor transit dynam reward result factor planner compact function polici descript factor function rare maintain intern structur koller parr suggest domain function linear combin function refer small number state variabl definit factor function linear function basi restrict subset variabl function type long histori area util theori solv factor mdp linear program factor function provid kei perform effici comput state space encount factor mdp kei insight restrict domain function basi oper implement effici basic oper combin creat practic algorithm briefli review linear program approach outlin solv effici mdp repres factor model kei oper comput backproject basi function dbn action expect summat exponenti number futur state shown simplifi substanti recal assumpt scope small subset variabl scope parent note cost comput depend linearli depend scope complex process dynam backproject basi function write constraint exponenti function restrict scope depend small set variabl demonstr al constraint repres compactli exponenti smaller set constraint lp variabl algorithm resembl variabl elimin schuurman show constraint set built increment effici constraint gener scheme discuss section obtain strong formal qualiti polici obtain approxim linear program demonstr linear program effici gener reason polici approach obtain linear approxim factor mdp factor algorithm plan mdp exponenti larg state space address concern standard mdp approach section scale address unknown model paramet estim unknown paramet dbn model factor mdp easili achiev straightforward maximum likelihood maximum posteriori approach difficult issu explor environ effici acquir observ form suffici estim domain quantiti kearn koller factor algorithm tackl issu factor version kearn singh algorithm factor mdp simplifi problem case dbn structur paramet mdp estim maintain assumpt paper intent strike effect balanc explor uncertain region state space gather exploit knowledg region state space optim reward factor distinguish state emploi plan calcul polici exploit part state space maxim averag reward calcul polici leav space enter uncertain region high probabl plan algorithm achiev provabl polici respect factor approxim optim polici reason time dbn inher hard problem produc approxim optim polici implement feasibl version factor emploi approxim plan strategi base linear program approach outlin linear program upper bound actual qualiti polici produc explor exploit form requir achiev reason made compar object linear program favor object small factor max tennenholtz max algorithm algorithm yield polici mdp polynomi time rmax algorithm simpler explicitli decid exploit max make implicitli agent continu exploit explor polynomi follow polici gener factor implement approxim factor form max linear program approach weak upper bound linear program polici prevent implicit explor exploit theorem provabl factor max directli implement linear program simpli provid approxim requir plan algorithm factor rl factor factor rmax suffer strong concept limit state consid plan state depend bound error probabl estim state visit requir state relev plan factor factor rmax depend mix time asymptot optim polici quantiti central decid number step current polici rmax avoid horizon time put horizon maintain polynomi run issu difficult factor case factor requir numer bound current polici decid abandon discuss section bound hard theoret factor factor rmax depend exist plan algorithm factor mdp gener compactli repres polici algorithm achiev bound effici gener factor mdp conjectur suffici small algorithm requir exponenti amount space repres polici plan algorithm factor factor rmax maintain strong theoret stop criterion factor depend fundament exist approxim algorithm difficult appli lemma approach reinforc learn factor mdp ing full factor model assum strong approxim adopt linear program approach factor mdp plan learn critic part model algorithm call approach factor reinforc learn optim criterion attempt approxim optim assum user obtain linear approxim linear program subject assum basi function nonneg max loss gener simplic assum posit weight necessarili make lp basi function choic subset solut lp set basi function true transit probabl reward function appli approxim algorithm procedur yield approxim function estim averag lp denot averag reward estim lp note necessarili averag reward polici obtain lp lp object achiev chosen set basi function mdp model context reinforc transit probabl reward function estim model defin error lp estim averag reward obtain appli approxim algorithm model paramet object linear program approxim model paramet place true defin optim measur definit defin approxim model yield lp approxim linear program plan estim paramet factor mdp lp object obtain approxim model close achiev true model upper lower bound lp step approach gener upper lower bound averag reward estim lp specif lp upper lower bound reward maintain start trivial bound rmax updat valu reward observ state part backproject basi oper simpli expect small set state variabl yield backproject basi function scope restrict maintain upper lower bound assign estim upper lower bound simpl empir comput transit visit explor path start state transit consist sampl estim backproject set nb transit backproject nb defin upper lower bound hold high probabl error paramet nb ln basi function maximum backproject scope size max import note nb trivial upper lower bound sampl complex depend logarithm number basi number action size domain logarithm size obtain desir upper lower proposit lp averag reward estim obtain solv lp true model paramet averag reward estim solv lp estim upper bound backproject reward estim obtain lp probabl prove applic hoeffd inequ defin eq upper lower true backproject assign probabl upper lower bound hold assign probabl union backproject assign remaind proof assum upper lower bound argument true high probabl lower bound case place make side constraint lp solut lp true model feasibl set basi weight solut true object obtain smaller estim averag reward upper bound replac side constraint lp larger solut lp true model longer feasibl mean upper bound object smaller lp similar reason prove influenc upper lower bound reward lp explor solv upper lower bound lp section obtain stop obtain approxim addit stop upper lower bound lp give inform state explor make bound tighter note solut point lp problem basi constraint activ constraint correspond critic pair inequ constraint equal constraint upper lower bound lp defin activ activ set activ pair upper lower bound critic state illustr mdp model pair happen backproject reward pair formal easi show activ pair happen found optim proposit activ set activ pair upper bound set state backproject reward activ lp probabl note probabl constraint pair upper bound lower bound lp true transit probabl linear remov constraint activ constraint object remain unchang add linear constraint linear program object upper bound lp activ constraint pair activ activ denot pair constraint creat transform lp substitut constraint pair activ constraint lp true model properti linear substitut object object probabl constraint transform lp lp true state activ assumpt theorem object transform lp lp mean lp recal proposit lp conclud lp proposit suggest direct explor activ lp estim state suffici obtain optim approxim bound lp sensit analysi determin error bar ensur estim intuit proposit suffici motiv algorithm algorithm describ reinforc learn approach factor mdp factor assum structur factor mdp paramet unknown maintain upper lower bound backproject reward function visit updat function solv upper lower bound verifi stop criterion reach collect activ pair upper lower bound activ activ outlin section visit state fundament import improv lp approxim defin factor mdp agent receiv reward explor state reward function structur dbn state variabl defin local reward function scope restrict parent reward function state consist assign variabl agent receiv reward visit state correspond activ constraint upper lower bound lp note backproject estim suffici necessarili add reward state variabl avoid unnecessari explor construct yield explor mdp polici mdp guid agent relev unknown state obtain explor attempt appli lp approach transit probabl explor mdp origin appli lp appli upper lower bound lp strategi origin problem suffici tight upper lower satisfactori explor strategi add critic constraint lp set repeat process note state ad state delet set success obtain satisfactori explor polici explor mean auxiliari explor perform current approxim explor polici standard explor balanc wander result assess qualiti algorithm compar factor factor rmax problem problem simpl comput network administr domain investig problem resourc alloc problem network administr problem binari state variabl correspond statu comput network cycl lp rmax exact figur polici qualiti network comput fig report result network explor strategi run time graph plot averag reward obtain polici function explor time current polici extract separ evalu ascertain asymptot rate reward evalu conduct larg auxiliari mont carlo plot averag reward obtain ideal lp planner exact mdp model fig show techniqu exhibit superior behavior smaller network problem partial due switch mode statist earlier rmax advantag predomin larger problem fig show preliminari result resourc problem fewer problem larg action space wai alloc resourc method longer converg result show good behavior method error bar run complet trend posit present strategi reinforc learn factor chine crash probabl ancestor action machin time step reward obtain machin extra reward design server machin transit probabl machin depend statu statu direct ancestor direct network resourc alloc task activ spontan servic resourc pool resourc appli appli addit resourc probabl complet task resourc deplet slow random rate lp rmax exact figur polici qualiti network comput resourc resourc lp rmax exact figur resourc alloc resourc mdp strategi address strong practic limit factor algorithm assum exist oracl perform plan factor tailor explor plan algorithm approxim linear recent shown scale larg problem target explor unknown region unknown region relev oracl algorithm effect direct explor domain uncertainti affect result approxim planner directli strategi make data collect label state unknown transit probabl factor incorpor confid interv estim model paramet linear program approach estim good sampl number sampl confid level depend logarithm number basi function domain size backproject basi function contrast factor hard threshold decid state dynam decid confid interv tighten result benchmark problem demonstr effect explor strategi practic approach reinforc learn applic factor mdp model algorithm problem acknowledg grate parr anonym review suggest work support muri program support scholarship refer berri sequenti alloc experi chapman hank theoret structur assumpt comput leverag journal artifici intellig goldszmidt exploit structur polici construct page boyan tempor differ learn bradtk barto linear algorithm tempor differ learn mach tennenholtz gener polynomi time algorithm reinforc learn proc page brown switch packet arbitr proc crite barto improv elev perform reinforc learn page dp de van roi linear program approach approxim dynam program thoma dean kanazawa model reason persist causat comput russel bayesian qlearn proc page parr project factor mdp proc page parr multiag plan factor mdp proc kearn koller effici reinforc learn factor mdp proc kearn singh reinforc learn polynomi time proc keenei raiffa multipl prefer tradeoff koller parr comput factor function polici structur mdp proc koller parr polici iter factor mdp proc result partial observ markov process complex markov process markov discret stochast dynam program schuurman direct factor mdp proc gener polynomi approxim markovian process math analysi sutton barto reinforc introduct mit van roi learn function approxim complex process phd
DB/1450 3 repres school timet disjunct logic program languag wolfgang faber nicola leon gerald pfeifer institut fur tu wien austria abstract show school timet problem prefer origin person repres highli declar natur extens disjunct datalog strong weak constraint introduct peopl school timet live long time school timet creat timeconsum yield suboptim schedul thirti system design autom timet creation timet gener problem find suitabl combin type resourc place discret period time satisfi addit constraint constraint strict express prefer case school timet problem resourc teacher class meet fix call typic scope week constraint problem prefer origin person timet problem studi depth artifici intellig oper research commun support scienc project queri system disjunct deduct address correspond author special confer topic instal observ research paper survei develop area show suitabl extens disjunct datalog disjunct logic repres school timet prefer natur highli declar section give basic syntax semant definit languag repres school timet problem section describ basic assign problem augment prefer declar framework section give comparison exist timet system framework languag definit assum reader familiar basic concept deduct logic program languag paper extens disjunct datalog constraint part extens defin syntax term constant variabl atom form predic ariti term liter posit liter neg liter atom rule form atom strong constraint syntact form liter rule empti weak constraint syntact form liter integ denot prioriti layer weight layer default strong weak constraint languag datalog datalog program finit subset languag datalog herbrand model interpret defin usual note function symbol part datalog semant part datalog program semant defin subset herbrand model program question refer survei semant exampl assum model chosen semant minim wrt set appli relev semant refer model chosen semant part datalog program candid model mean constraint defin constraint iff liter falsifi candid model model datalog program satisfi strong constraint weak candid model consid sum weight violat constraint greatest prioriti sum weight violat constraint previou express object function candid model wc max max wn wc denot total number weak constraint max max denot maximum weight maximum layer weak constraint denot set weak constraint layer violat wn denot weight weak constraint candid model satisfi strong constraint minim candid model consid prefer model wrt candid model semant program minim model cg cg case ps ps ps prefer violat import weak constraint appli total partial semant school timet literatur formul school timet problem relev timet problem regard problem assign problem practic timet valid satisfi prefer give modular formul problem provid definit tradit assign problem timet consist rule strong constraint extend hierarchi desir properti express weak constraint basic problem input set class fc set teacher ft set period fp set requir state teacher give lectur class class teacher unavail repres set period class teacher problem assign lectur period class teacher involv lectur teach requir unavail honor find set characterist function defin usual problem formul datalog introduc problem abstract provid concret framework class teacher figur program basic problem input data assum lectur teacher class number lectur input fact store iff mean store number lectur store lectur assum period store relat defin repres unavail class teacher assum defin pair class problem formul base write program comput timet rule guess subset assign constraint ensur lectur rule constraint ensur lectur constraint state lectur differ number period due involv number lectur solut constraint enforc lectur plan order number assum simplifi easi support system model condit condit implement directli similar fashion condit formul problem extend basic problem unavail constraint strictli number desir constraint state approach express desiderata practic flexibl formul articl group desir properti ffl feasibl condit oe ffl didact requir ffl ffl teacher prefer oe basic defin previou period associ period dai describ desir timet pedagog point view exampl teach hour dai class teacher dai distribut hour teacher pair requir point view exampl teach hour dai hole teacher hole dai meet assign teacher teacher individu teach teach prefer dai give object function base prefer approach albeit formul object function optim necess repres formul datalog extend basic problem weak constraint framework defin object function prioriti layer import didact requir desiderata teacher prefer auxiliari definit basic assign problem import figur design problem establish hierarchi class desiderata weight prefer class figur show extend basic problem weak constraint relat descript prefer relat notion includ assum period relat period dai desir criteria import class suggest view level import import choic arbitrari didact requir gener import creat hierarchi prioriti layer constraint present group prefer constraint vagu framework distribut hour teacher week accomplish period period mean lectur possibl schedul distribut dai defin weight weak constraint rel weak constraint prioriti layer teach hour dai read singleton teach hour dai teacher dai criterion formul straightforward manner introduc auxiliari period period period note layer lower describ weight constraint constraint dai easi lectur schedul period dai teacher weight period relat work present disjunct datalog extend strong weak constraint repres school timet problem eleg declar manner ad support weak constraint dlv prototyp implement disjunct datalog stabl model handl strong constraint inform dlv implement exist timet system highli problem encod declar approach gener constraint logic program system constraint languag tailor timet special specif complex problem languag capabl express basic assign problem satisfact strict eleg declar languag fail captur prefer equal recent learn system creat timet problem similar school written constraint handl rule handl weight inform layer constraint review point refer slim michael mart fur workshop und technic report stein victor school wave burk ross page francesco nicola rullo ad weak constraint disjunct datalog joint confer declar program june francesco nicola rullo strong weak constraint disjunct datalog intern confer logic program reason juli edmund burk peter editor practic theori autom intern confer number lnc alberto marco maniezzo metaheurist high school timet comput optim tanca logic program tim cooper jeffrei complex timet construct problem burk ross page dix semant logic intuit formal properti overview action inform proc konstanz colloquium logic inform page martin henz jorg timet case studi appli artifici martin henz jorg oz colleg time tabl burk ross page jw lloyd foundat logic program schaerf survei autom timet technic report comput softwar en ullman principl knowledg base system comput scienc watanab approach timet case studi nation confer artifici intellig page
DB/1451 3 isomorph class place transit net state machin agent model dan comput scienc depart purdu west novemb abstract recent introduc state machin model implement design applic agent framework paper address translat petri net languag blueprint languag agent descript translat blueprint petri net simul class place transit net part effort creat workflow manag system content introduct state machin agent model bond core bond servic bond agent plane implement facet behavior simul class net bond finit state machin map bond blueprint petri net workflow manag model workflow manag system bond workflow manag architectur acknowledg appendix definit appendix petri net translat blueprint introduct multi plane state machin agent model compon base architectur build agent bond agent construct network solver support adapt resourc alloc multimedia applic discov resourc distribut object system project includ workflow manag system discuss briefli section paper agent design uniqu featur consequ philosophi repres behavior agent state machin discuss section ffl behavior data structur behavior agent blueprint strategi state defin behavior state ffl explicit concurr agent structur base state machin run concurr ffl dynam agent agent surgeri ffl integr heterogen behavior model ffl possibl autom program autom program fine grain level unrealist current level structur compon model grain semant simpl creat automat base circumst model behavior frequent system uml base system statechart model design david harel agent state machin express parallel statechart express concurr substat hand chosen simpler state machin state chart statechart transit condit action state gener action transit uncondit theoret foundat model structur compon state activ compon model world separ introduc condit boolean function make state machin depend model action transit impli action gener altern strategi determin state vector semant express model insert intermedi node sourc strategi node perform desir action evalu condit state machin model larger task easier analyz simpler semant real time system easier statechart format featur possibl defin substat miss system function case replac state vector state machin investig benefit introduc substat improv express introduc difficulti implement migrat agent surgeri adher definit stan franklin art graesser autonom agent system situat part environ environ act pursuit agenda effect futur agent execut model assum agent explicit goal agent receiv extern event gener action action agent determin pursu goal event trigger agent perform action extern input agent termin execut goal accomplish execut model execut reactiv applic execut figur characterist tradit numer simul goal gener output result set input data input start applic execut involv interact user environ start finish reactiv execut applic provid user input extern event applic explicit initi termin extern event absenc extern applic idl cycl exampl interact program word oper system tradit server file server http system linear program interact program agent input output event event action figur execut model reactiv applic agent continu progress input gener output reactiv applic defin pair behavior agent spontan gener pair exist execut model agent gener complex model combin execut model modern server airlin ticket reserv perform number action origin request repli server view agent agent emul execut research inclin view program agent approach lend effici simpler execut model optim implement optim time stateless server agent complex state paper organ section outlin agent model section discuss translat petri net section outlin architectur workflow enact engin state machin agent model bond java base distribut object system agent framework core object model messag orient servic layer distribut servic directori persist storag servic agent provid basic tool creat autonom network agent commonli strategi develop assembl agent minim amount program bond core heart bond system java compon architectur bond object extend java bean user attach properti object offer uniform api access regular dynam properti javabean style virtual field programm flexibl languag lisp maintain familiar java program syntax bond object network object sender receiv messag object code rmi stub bond messag pass rmi compon architectur remot method invoc system larg independ messag transport mechan commun engin interchang provid multicast engin commun engin implement api commun engin bond object commun engin chang recompil code properti commun engin reflect properti implement applic udp base engin offer higher perform reliabl deliveri bond object commun agent commun kqml bond defin concept highli close set command gener messag perform specif task exampl gener bond properti access agent control secur altern formul introduc structur semant space messag group function messag remot method invoc system group interfac larger flexibl messag system techniqu difficult implement remot method call ffl implement object properti object properti access implement bond find common set commun ffl object control path messag deleg process messag subcompon call regular probe regular probe attach dynam object ffl messag intercept deliv provid conveni implement secur mean fire filter preprocess messag oper perform subcompon call preemptiv probe activ object messag deliveri chain ffl group function lifetim subcompon call object instanti handl incom messag understood exist subcompon attach object ffl object address uniqu alia servic provid object probe object multipl multipl object regist alia enabl architectur support load balanc servic techniqu implement mean languag treat method smalltalk java implement compil deleg design pattern techniqu recent corba specif simultan trade servic implement similar larger significantli complex code bond servic bond number servic commonli found distribut object persist monitor secur messag provid messag pass servic remot method invoc base system due architectur system bond servic perform differ counterpart middlewar corba bond requir explicit registr object servic find properti remot set implement direct negoti object directori servic bond combin function trade servic system implement distribut fashion object locat search process propag local directori local directori directori link virtual network transpar distribut awar transfer directori inform piggyback exist messag discuss previou section compar servic implement system corba base exist approach advantag singl point distribut awar mechan network directori catastroph failur distribut search slower lookup larg network bond program bond object regist extern corba servic gatewai extern directori servic ldap access bond agent bond agent framework applic facil provid bond core layer implement collabor network agent agent assembl dynam compon structur state structur special languag call blueprint activ compon load local interpret program languag blueprint script state inform knowledg base agent collect singl object call model world easi checkpoint migrat agent state machin describ behavior agent modifi agent surgeri behavior agent action agent perform action perform strategi reaction extern autonom order pursu agenda agent current state state machin state strategi activ moment multipl plane express parallel bond agent good techniqu express facet agent act environ transit agent modifi behavior agent chang current set activ strategi transit trigger intern event extern messag extern messag form control agent limit interfac requir good provid code bond agent framework strategi commonli start control extern agent legaci applic number base strategi common task dialog box messag handler develop implement specif function extern written java easili portabl strategi interfac plane implement facet behavior behavior agent consist coupl aspect agent exhibit ffl reason agent reason abil run gener true statement base current knowledg ffl visual interfac agent present visual interfac interact user present part knowledg agent part visual collect user interfac event user ffl reactiv behavior agent react extern event user interfac ffl activ behavior agent perform action pursuit agenda extern event separ facet rel independ facet justifi separ treatment step agent pursu goal activ necessarili lead chang reactiv user reason process agent argu state machin structur eleg express multifacet behavior plane express facet behavior agent restrict natur behavior agent design creat structur suitabl problem hand independ facet interdepend exist state machin interdepend plane captur fact plane share common model transit trigger plane appli provid signal mechan plane model world agenda visual interfac reason action remov file send messag check item item item figur plan agent repres facet behavior agent case plane control visual plane reason plane perform action figur repres agent present visual interfac perform background action facet behavior reflect agent dedic facet agent model world agenda agent model world agenda state agent previou state agent figur remot control messag messag agent trigger transit plane agent chang behavior part commun behavior control agent chang result action control agent term behavior agent state chang alter state state vector trigger transit extern messag implement transit trigger kqml messag messag group determin state machin turn blueprint consist reason transit state machin trigger semant success depend current strategi figur present agent chang behavior agent chang strategi plane send messag label transit transit perform plane agent transit specif label plane transit label state state vector chang state plane messag inform control implement bond network agent solv partial differenti equat extern transit synchron result independ solver agent import aspect agent cooper achiev goal argu agent cooper term knowledg share structur mean part model agent copi model agent agent model world agenda agent model world agenda figur cooper knowledg share agent push part model model agent basic wai share depend agent initi ffl push mode agent copi part model model agent ffl pull mode agent copi part model remot agent model secur semant concern relat inform share model address determin part model ident confid level share knowledg bond system support inform share commun layer mechan enforc secur cooper figur present cooper knowledg share push mode agent push part model model agent knowledg share model appli cooper deal cooper pattern servic negoti implement success seri small inform interchang case handl view negoti messag interchang appli result recent research area model creat negoti plane multipl negoti conduct simultan agent cooper knowledg share agent start agent pass part knowledg newli creat agent solver agent system mention partial result comput commun simul class net bond finit state machin straightforward simul execut petri net bond agent involv alloc separ plane transit net correspond fact transit fire independ requir bond assign plane correspond actual java approach disadvantag state transit mechan present bond explicitli actual parallel simul petri net case smaller number transit present present altern approach applic larg class petri net goal build simul tool framework coordin softwar conveni framework petri net simul environ petri net lowest net transit transit incom arc outgo arc initi mark token net strongli connect net token time immedi fact set fire sequenc token initi place equal languag accept finit state automaton fp map defin effect simul bond finit state machin state petri net place refer transit call transit petri net arc petri net partit disjoint simul separ bond plane connect net partit attempt cover origin net conveni introduc definit theorem quot subnet petri net tripl subnet gener subnet net gener nonempti set node ffl ffl place ffl strongli connect set net place net belong net cover theorem free bound safe net set net import class petri net possess properti desir distribut concurr system design exist effici algorithm find algorithm bond run dummi dummi dummi dummi dummi figur procedur top diagram repres origin depict transit select bottom diagram repres dummi transit contract order simul petri net introduc separ bond plane obtain decomposit procedur case decomposit procedur produc disjoint bond state correspond node origin petri correspond transit action undesir allevi problem simpli label petri net transit turn correspond associ strategi start immedi termin report success order simul petri net bond state machin add synchron function strategi assign fire petri net transit made enter role strategi perform gener transit transit place transit belong mark charg synchron determin unambigu strategi state wait place transit enter succe wait trigger condit fire transit satisfi transit eventu remov chang behavior system transit place merg place strategi wait enter modifi wait enter process iter improv achiev fig map bond blueprint petri net perform dynam modif agent definit call modifi definit exist petri net analysi method desir develop techniqu translat blueprint petri net absenc coordin plane translat trivial plane independ finit state machin state add transit place arc transit state add transit ij arc ij ij transit place special place exist transit account fact action execut time state strategi suppli transit perform extern messag synchron plane place difficult impract attempt translat petri net domain strategi execut arbitrari java code emploi ad hoc synchron scheme inspect share variabl perform translat synchron introduc control fashion provid primit isol locat primit invok strategi access share memori approach prevent strategi synchron method encourag program order achiev requir blueprint normal form state plane divid incom outgo transit arbitrari strategi arbitrari number incom outgo transit restrict strategi strategi evalu express model variabl chang strategi plane perform transit base evalu note translat petri net present previou paragraph base blueprint function origin blueprint transit transit place strategi state rewritten result success write actual bond transit perform design model variabl subsequ bond state repres transit dummi strategi state repres place transit ij special strategi place function perform transit base design model variabl state synchron construct make function block execut plane context invok plane enter state primit strategi condit easili express term petri petri net blueprint augment place ffl pj ffl rj jq ffl jr ffl workflow manag model workflow system design autom complex activ consist depend task workflow manag wide autom busi process grow interest applic scientif engin problem ampl evid busi workflow product improv qualiti product organ expect similar benefit scientif engin task involv data collect site intric comput extract inform data wfm support process concern coordin legaci newli develop applic exist varieti commerci develop ground wfm built top applic design relat manag ibm comput support collabor work lotu note interest wfm led creation workflow manag coalit bring design user wfm system workflow manag system workflow system consist definit workflow support monitor client applic exist system advantag avail scalabl featur underli system practic workflow system requir advanc transact model support commerci dbm workflow manag system built top dbm exhibit desir properti task workflow system autom natur interact integr applic provid transact semant limit benefit base workflow manag system dbm worth note typic usag profil wfm dissimilar rdbm rdbm system subject read request updat case wfm queri elabor requir sophist data queri languag updat occur higher frequenc agent wfm discuss public wfm implement agent act person assist perform action behalf workflow particip facilit interact particip exist wfm recent architectur workflow enact monitor compon workflow manag system concentr agent case autonom entiti overlook process singl unit work assumpt implement capabl deal dynam workflow complex process requir paramet influenc rout requir inferenti capabl softwar engin workflow manag system critic creat monolith system assembl compon attempt compon part standard workflow manag coalit defin common describ workflow process definit textual format interchang workflow process definit workflow definit languag author semant workflow defin wfmc petri net consid lingua franca workflow entiti defin model workflow particip repres set resourc human act perform activ process workflow applic invok support wholli autom process process activ repres unit work process particip transit defin flow control activ option condit particip workflow relev inform pass activ influenc execut workflow process paper concern entiti describ flow control workflow process activ transit design choic author specif includ rout inform activ definit retain transit definit simpl rout assign effect activ descript defin behavior activ multipl incom transit refer join type definit actual describ behavior multipl outgo transit refer split type activ activ split type activ perform activ split type xor activ perform author semant workflow defin wfmc petri net consid lingua franca workflow bond workflow manag architectur object workflow manag framework discuss paper build case manag agent base static descript workflow wai workflow exist commerci product base definit languag design workflow definit languag industri standard intend base framework petri net concept possibl maintain mention provid translat facil workflow definit languag petri net base requir transform obtain bond blueprint workflow definit analysi pn translat analysi tool workflow descript pn blueprint translat blueprint pn translat blueprint repositori bond agent framework agent factori monitor agent bond agent framework agent factori wm agent figur workflow manag bond figur illustr definit execut workflow bond design support dynam workflow complex monitor workflow manag agent origin creat static descript modifi base inform provid monitor agent workflow creat result mutat suffer origin workflow blueprint creat analysi procedur store blueprint repositori distinct monitor agent workflow manag agent merg singl agent state agent model map easili petri net comput model realiz develop workflow manag system current realiz agent bond agent compon base architectur strategi encapsul behavior individu state combin coher system clear agenda isomorph agent net model exploit varieti applic workflow time benefici agent commun access rigor analysi methodolog static dynam properti agent petri net analysi tool includ incid matrix provid answer intrigu question relat agent design paper present translat petri net languag blueprint agent descript languag blueprint petri net acknowledg work report paper partial support grant nation scienc scalabl grant intel corpor refer mohan function limit current workflow manag system technic ibm almaden research multi plane state machin agent model technic report cs tr comput scienc purdu chang scott support environ comput network isdn workflow manag coalit interfac process definit interchang process wfmc workflow manag coalit workflow manag coalit terminolog glossari technic report workflow manag lee structur behavior analysi state machin net base net decomposit ieic tran free choic volum cambridg tract theoret comput scienc cambridg tim finin al specif kqml languag agent polici franklin graesser intern workshop agent architectur languag springer bond system secur access control model iast confer parallel distribut page acta sherman formal semant statechart ieee symposium logic comput resourc discoveri technic report depart comput purdu intellig qo support adapt video servic technic report depart comput purdu object manag group omg unifi model languag specif obrien wiegand agent base process appli intellig agent workflow knowledg engin rice design softwar agent network solver workshop agent technolog high perform agent page ieee van der inherit workflow approach tackl problem relat chang scientif workflow system nsf workshop workflow process state art futur sheth advanc transact model offer workflow intern workshop advanc transact model architectur august appendix definit model simpl vendor creat workflow creat workflow activ start implement applic split activ implement applic activ implement split xor alta activ alta implement applic activ implement applic activ rendezv implement join xor activ stop implement join transit start transit start transit stop transit alta transit transit alta rendezv transit rendezv transit rendezv stop appendix petri net translat blueprint start branch stop feedback branch alt alt figur workflow definit appendix translat petri net import import creat agent workflow plane add state rendezv strategi add state strategi add state feedback strategi add state strategi add state alta strategi add state stop strategi add state start strategi model argument add state strategi model add state strategi model add state output strategi model add state input strategi model add state strategi model add state strategi model intern transit rendezv rendezv output feedback feedback input alta alta stop stop output input start start end plane add state strategi model argument add state strategi goto intern transit end end creat
ML/1452 6 learn mobil simul practic john hallam depart artifici abstract paper present implement sin learn control mobil robot navig control reactiv control modul learn system base reason reinforc learn reason part captur regular environ reinforc learn part gradual improv acquir knowledg evalu control present real simul mobil robot introduct behaviour robot long languag assembl robot classic ai approach control prove slow fragil real world show difficult produc interest behaviour agent react current situat limit scope design behaviour hardwir behaviour good reflex learn mobil robot control advantag lessen burden exhaust specif learn make continu updat behaviour robot control learn flexibl prone succe task meant solut object discuss paper improv navig system sin learn architectur ram learn system top reactiv system stand discuss blend strategi appeal design knowledg put system reactiv behaviour plastic control learn scheme complex behaviour learn bia design low effort program paper appli time real robot origin work develop comput simul sin highli compet control proven simul good hybrid solut good result incorpor advantag techniqu reactiv reinforc learn reason capabl tempor learn encod acquir knowledg structur sequenc time learn divid type sin achiev ffl learn numer function calibr paramet adjust oper paramet exist behaviour structur life robot ffl learn world intern function world construct alter line adapt learn modul reactiv control modul behavior behavior behavior action control paramet sensori inform behavior sensori inform control paramet current time case case case case case figur sin architectur ffl learn coordin behaviour exist behaviour structur effect world chang condit sequenc trigger control intern learn function ffl learn behaviour sin learn behaviour behaviour configur add plastic section descript sin architectur section describ test methodolog result obtain final section ponder result obtain sin architectur sin navig system ram learn control architectur make reactiv reason develop test comput simul modul ffl reactiv control modul ffl adapt learn modul modul free access sensori inform robot run concurr modul collect reactiv behaviour account system reinforc learn system learn set numer function time case figur output control paramet behaviour modul function case attempt repres sensori inform control paramet control paramet function case control paramet behaviour sensori inform function case repres histori sensori indic valu indic function sensor indic reflect robot obstacl base proxim sensor inform predefin design fix behaviour run parallel independ access vehicl sensor comput vector point direct pursu simpli sum produc final vector command robot behaviour paramet regul oper magnitud gain output vector behaviour paramet pertain function behaviour paramet dynam set adapt learn robot oper learn adapt modul consist loop ffl perceiv monitor sensor vehicl comput current indic ffl retriev detect discrimin configur search exhaust collect learn case case match current situat good match measur comput learn case reflect similar part current ffl adapt set behaviour paramet dynam manner base case pick base assumpt similar situat encount case led posit result ffl learn simultan updat intern case current experi learn phase involv method incorpor knowledg relev learn case situat determin directli good match measur higher relev relev case ffl creat creation case base current situat perform relev exist case ffl modifi modif associ made relev accept function time store case reinforc learn formula improv case form depend experi success associ case reinforc altern associ explor randomli amount proport failur ffl extend extens size case yield associ larger time window perform relev high goal sin navig effici target posit clutter environ reactiv control modul ffl produc vector direct ffl produc vector ffl produc random vector time make robot describ trajectori paramet control random vector gener paramet learn adapt modul control gain behaviour paramet analogu valu bound rang set paramet determin moment composit behaviour robot behaviour influenc total behaviour robot maxim indic implement ffl reflect free space vicin ffl reflect robot progress ffl reflect robot motor ffl reflect effici motion robot low robot move khepera world sin requir modif order run khepera mobil robot simul cartesian comput simul imper architectur requir global world inform case cartesian rel motion absolut motion list made descript ffl rel absolut motion indic base dead reckon left global coordin produc effect happen cartesian coordin robot prone error ffl random behaviour produc jag line trajectori left motor command cartesian coordin ffl goal repres light distanc goal measur robot light sensor ffl behaviour constant gradient light robot doesnt behaviour light sourc ffl bump sensor program trigger distanc sensor satur physic bump sensor khepera ffl reinforc function chang function bump low function reward figur clutter maze environ figur practic setup lego maze khepera robot light experi set experi address specif implement origin implement experi khepera simul clutter environ compar result effect maze environ navig clutter environ navig figur effect run real robot compar khepera simul result maze environ real khepera perform real maze environ comparison estim evalu percentag run solv averag step world averag distanc travel world averag travel optim distanc world averag world number run const sin sin random random averag step run number run random sin constant number run random sin constant averag distanc run number run random sin number run random sin constant figur khepera simul result clutter environ light estim provid direct compar result type control test effici learn adapt ffl sin reason reinforc learn learn adapt ffl constant yield constant behaviour paramet behaviour set rang paramet ffl random continu set behaviour paramet randomli perform evalu base concept run run trajectori random start light limit step run set mean run solv optim distanc distanc measur straight line start point run goal function graph run mean control run step distanc travel optim distanc solv run run run run sin sin sin ratio constant constant ratio random random random ratio tabl khepera simul result clutter environ light result implement origin implement experi report replic khepera simul clutter world light long distanc gradient light felt part arena origin implement goal made compar studi faith tabl show perform control origin implement implement estim ratio present pair compar perform implement sin random conform accept extent constant control behav differ constant heurist paramet unknown figur show evolut result run conclud sin random significantli constant perform badli effect maze environ navig simul result faithfulli compar light made begin local vicin circa area environ maze environ shown number run sin constant random averag step run number run sin constant random number run sin constant random averag distanc run number run sin constant random averag run number run sin constant random figur khepera simul result maze environ figur maze configur creat local minimum locat wall robot light special pitfal control escap zone mean surg random behaviour sin converg fast run manag hold perform sin learn effici surpass notic control indic step run control run step distanc travel optim distanc solv run run run run sin constant random tabl khepera simul result maze environ control solv step distanc total run run run run sin sin constant random tabl khepera robot result real maze environ run sin low constant control trajectori sin tighter spot manag prove explor sin lean navig lower veloc time step reach goal learn care obstacl navig speed sin converg good constant measur travel bump time constant effect run real robot khepera experi made real khepera lego environ practic setup figur configur simul environ figur wall small round hole light accord simul obstacl wall light limit number run made fewer perform estim due natur real robot experi practic result attain shown tabl compar tabl albeit reduc number sin hold khepera robot manag outperform constant random control run sin averag run manag robot learn indic improv constant control fail reach light unabl negoti wall light worth mention disadvantag sin suffer comput time random constant control unnot real robot implement time robot physic move model control develop simul capabl effici adapt navig mobil robot present effici control order work real robot simul real robot improb toi world simul replac real khepera world extend simul sin manag constant control maze environ random control clutter environ real robot statist show real world sin control learn run maze environ time workshop ongo studi extens evalu sin control acknowledg support praxi xxi grant sandra comment facil provid edinburgh refer real real learn problem robot chapter page kluwer academ publish robust layer control system mobil robot ai memo mit intellig reason ai memo mit intellig artifici page robot program ai memo massachusett institut technolog artifici intellig laboratori khepera simul packag version mobil robot simul technic report approach reactiv control autonom robot aaai fall symposium autonom mobil ma percept percept action page ieee comput societi press reactiv method select adapt reactiv control paramet autonom robot system technic report georgia institut technolog colleg comput multistrategi reinforc learn approach reactiv control system autonom robot navig intern workshop multistrategi wv harper ferri multistrategi learn reactiv control system autonom robot navig intellig dynam biologi technolog intellig autonom berlin
IR/1453 5 probabilist model reduct inform retriev filter chri hq ding lawrenc berkelei nation laboratori ca januari novemb abstract dimens reduct latent semant index appli semant space built text improv inform inform ltere word disambigu dual probabl model base similar concept introduc explain observ success semant associ quantit statist signi likelihood semant dimens redund noisi inform separ contribut statist signi canc give rise lsi optim solut model peak likelihood curv exist semant dimens import lsi dimens indic lsi dimens repres latent concept document frequenc word follow zipf number distinct word distribut experi standard document collect con rm illustr result concept present latent semant semant dimens probabilist model introduct comput internet part daili ectiv automat inform retriev ltere method essenti deal growth access inform inform text base current internet search retriev inform match queri keyword word index document ambigu word choic search relat item miss item relat ventur express similar search web search engin retriev di erent set webpag overlap kind problem solut manual classifi inform di erent categori human judgement categor ltere reduc size relev inform space conveni automat approach dimens reduct method latent semant index method berri al lsi automat comput smaller semant subspac origin text improv recal inform retriev bartel husband inform ltere text classi baker word disambigu ectiv lsi empir studi attribut reduct ambigu synonym polysemi problem reduc process recent studi bartel shed light lsi method section detail central remain unresolv lsi pure automat noisi redund semant inform numer quantiti reduc minim lsi de ne quantit measur semant verifi quantit probabilist model measur semant inform reduc minim paper address question introduc probabilist model base show lsi optim solut model statist signi quantit measur lsi semant dimens calcul likelihood curv standard document lsi subspac dimens likelihood curv sharpli gradual turn convex steadili unambigu demonstr dimens peak statist inform repres noisi redund inform exist semant subspac maximum statist semant explain observ perform improv lsi model statist signi canc lsi dimens relat squar singular document statist signi canc lsi dimens found follow indic lsi dimens repres latent concept english word studi document frequenc distribut explain characterist lsi dimens investig distribut distinct word reveal intern structur document collect studi statist framework understand develop type dimens reduct method rest paper organ section brie outlin vector space model inform retriev provid context notat section lsi explain fundament question start point model similar matric discuss section dual probabl model outlin detail section semant subspac calcul collect section section statist signi canc lsi dimens found follow distribut document frequenc distinct word examin section context notat relat work discuss probabilist model detail section discuss invari normal separ word document lsi space section made section preliminari result work present semant vector space fundament relationship human languag dual mutual word concept concept express choic mean word infer usag di erent context cast relationship semant vector space document abstract rst repres vector linear space index word vector word clear content commonli refer repres vector linear space span vector dual captur associ matrix column repres document row repres word matrix element term frequenc term occur document properli weight document frequenc tf document frequenc df number document word occur ir tf denot term frequenc df denot document capit letter refer bold face letter vector subscript repres document vector superscript repres sum term sum document probabilist model directli mathemat note matrix element index word occur document section inform retriev document collect typic handl keyword match user queri consist set keyword treat document keyword match queri vector document vector document length account normal document vector unit relev score document form row calcul document sort relev score return user inform ltere call text classifi incom item email prede ned number wai simpl method calcul centroid vector categori averag document centroid vector categori form matrix cm method solv map vector arg min squar matrix de ne categori document norm matrix de ned jj incom document project centroid map vector similar score categori threshold note document belong categori word calcul involv colloc similar matrix column repres context target capit column word colloc target word text window xed number word sentenc index word context space matrix context cluster di erent target word word state govern probabilist model dimens latent semant index initi semant vector relat subspac semant associ smaller initi space method achiev perform dimens reduct semant subspac essenti associ relat lsi dimens reduct method automat comput subspac semant associ smaller initi space singular decomposit van rank matrix singular left singular vector typic rank order truncat rst largest result good approxim note substanti reduct illustr exampl berri al lsi document repres project document repres queri map vector transform document text score vector lsi subspac evalu lsi dimens document recal improv bartel husband greatli reduc dimens reduc complex text categor centroid matrix map matrix reduc probabilist model substanti reduct freedom dimens reduct ectiv naiv lead accur categor result word lsi dimens reduct reduc comput complex cluster process di erent word lead cluster result disambigu result success lsi attribut lsi subspac captur essenti associ semant relationship origin document partial resolv word choic problem inform redund semant relationship text categor lsi truncat svd approxim reduc subspac improv result inform retriev ltere lsi mathemat approxim statist point lsi amount ectiv similar princip compon analysi statist dimens small singular valu view repres semant gener fundament clari ed small singular valu order dimens consid small singular dimens import larg singular directli impli question quantit measur associ semant relationship quantit proce verifi dimens smaller singular valu repres directli assign numer score associ relationship intang approach problem probabilist statist signi quantit measur semant dimens govern relationship probabilist model similar document discuss probabilist model similar matric gener accept document vector account di erent document good measur correl similar word usag similar document de ned similar pair similar matrix document word vector measur document close similar xx similar pair word similar matrix assign binari weight matrix element easili xx frequenc context window size set document length tfidf xx good measur word similar matric de ne semant fundament import inform retriev note similar de ned similar de ned strong dual relationship document word kei featur model dual probabl model tradit ir probabilist model focu relev queri approach associ matrix inform includ futur develop document data entri occur randomli assum gener probabl probabilist model distribut gener assum probabl distribut govern characterist document vector denot identi ed lsi occurr document proport similar project dimens sign statist independ contribut total probabl document addit motiv gaussian gener jc normal constant call partit maximum likelihood method obtain optim paramet probabl model note assumpt requir mutual orthogon assum ident model calcul log jc xx algebra relat note similar matrix xx word natur consequ similar matrix expect dual relationship document word di document data point live index space xx measur compon data correl word properli xx chang data point serv role similar covari matrix princip compon analysi understand document relationship ultim relat understand word interest result model probabilist model nding maxim involv complic numer due analyt intract high dx dx note slow chang function comparison xx similar vector gaussian normal constant independ independ logarithm slow chang function slower regard concentr maxim rst term symmetr nite matrix xx spectral decomposit eigenvalu xx ith eigenvalu eigenvector optim solut characterist dimens maxim xx left singular vector svd lsi lsi optim solut refer lsi dimens nal maxim likelihood analysi carri word document vector model word de ned occurr document data point index document repres row vector matrix row vector denot repres characterist word assum probabl occurr word jr log jr jt xr note ij probabilist model similar matrix natur maxim line reason slow chang maxim rst term symmetr posit de nite matrix spectral eigenvalu xv optim solut characterist word maxim jt xr construct singular vector svd lsi optim solut maxim dual probabl lsi dual relat enhanc xx eigenvalu left lsi vector relat probabl maximum small slowli chang normal constant direct consequ dual relationship word document statist model observ probabl model consid number case svd suggest contribut statist signi canc lsi dimens approxim squar singular quadrat depend lsi dimens small singular valu perceiv gener thought contribut lsi dimens proport singular valu singular valu directli svd lsi dimens singular valu probabilist model compar import rst dimens import result rst insight small number lsi dimens ignor larg number dimens small singular valu semant subspac central theme lsi lsi subspac captur essenti semant associ reduc redund noisi semant inform model quantit mechan verifi claim studi statist signi canc semant semant dimens ectiv data likelihood ectiv repres semant de ned cosin similar conjectur semant dimens small eigenvalu statist probabl densiti likelihood repres redund noisi semant inform kei resolv central question reli behavior function model analyt intract evalu numer statist sampl gener uniform random number domain unit sphere compon posit found sampl method converg quickli achiev accuraci decim place point dimens lsi word dimens ned calcul similarli due fact column vector normal matrix norm normal row jj domain integr rst quadrant sphere radiu document space probabilist model likelihood curv calcul standard test document collect document abstract aeronaut eld institut cacm abstract articl commun med abstract nation librari abstract institut scienti matric standard term document frequenc weight calcul likelihood curv shown figur cacm medlin figur curv document collect solid line modul document word dash line modul word document semant subspac int word space int document number word number document collect collect likelihood grow rapidli steadili int indic probabl model provid statist descript data reach peak int start int likelihood indic probabilist model statist inform repres lsi dimens smaller eigenvalu dimens determin int int fairli close figur correct dual probabl model note theoret int likelihood curv cacm close determin text classi int larger determin base averag standard queri model inform reason agreement statist model statist signi argument captur essenti relationship involv gener trend collect clear likelihood curv quantit unambigu demonstr exist semant dimens small eigenvalu repres redund noisi contribut neg statist signi canc main result work lsi dimens repres lsi dimens optim solut characterist document vector introduc dual probabl model note similar view project document characterist vector lsi dimens project obviou svd point view project lsi dimens repres document project direct explain origin paper exact mean lsi dimens complex directli infer semant probabl model addit insight issu statist signi canc import lsi dimens directli relat singular squar probabilist model cacm lsi dimens lsi dimens medlin figur statist signi canc dimens document collect paramet ts data extrem origin data essenti indistinguish calcul document collect shown figur statist signi canc lsi dimens follow zipf expon close ts data ts indistinguish collect conjectur obei singular valu squar document collect harvard linguist georg zipf observ frequenc occurr function rank function expon close wide rang social phenomena obei frequenc word usag english languag probabilist model rank citi world follow recent rank websit number user webpag popular obei common theme english distinct charact ident lsi dimens document collect displai clear infer lsi dimens repres latent concept ident similar manner english webpag characterist document collect provid perspect statist approach discuss investig characterist document collect studi statist distribut context natur languag process refer emphasi word frequenc distribut rang simpl poisson distribut distribut studi distribut close relat model discuss document frequenc distribut rst studi document frequenc number document word occur matrix correspond number nonzero element row figur show distribut document frequenc collect plot number word document histogram larg number word small df word word number word larg small total number word df df reach high word expect earlier kind distribut probabilist model document frequenc term document frequenc term med document frequenc term cacm document frequenc term figur distribut document frequenc term collect ts shown zipf distribut power df ts data shown figur expon gener close origin describ frequenc word govern document frequenc content word distribut document frequenc understand lsi dimens discuss previou section lsi dimens essenti linear combin behavior word directli impli statist signi canc lsi dimens follow analog strengthen previou argument lsi dimens repres latent index word averag document frequenc quot numer document collect gaussian type center curv good probabilist model zipf type captur essenti featur distribut word includ chang signi cantli domin averag chang paramet characterist quantiti document frequenc uniqu determin distribut clear expon govern expect number word fact expect number word count word analysi document frequenc distribut document frequenc global weight document vector space tfidf distribut understand ect weight improv weight distribut distinct word investig number distinct word document number nonzero element column matrix figur plot distribut number document number distinct word eld minimum number distinct word document maximum peak point histogram document distinct word lead distribut di erent zipf distribut document frequenc distribut follow probabl densiti function exp calcul varianc var directli solv probabilist model obtain paramet probabl densiti function drawn smooth curv figur simpl procedur good data distinct word document distinct word document distinct word document distinct word document figur distribut distinct word document collect smooth curv distribut document number distinct word follow distribut expect quantiti follow normal distribut due fact quantiti count expect logarithm variabl follow gaussian distribut varianc lead distribut origin variabl rst histogram cacm deviat substanti shown smooth singl peak curv determin varianc entir data point cacm care examin pattern tted distribut peak part similar peak number document occur distinct similar magnitud vertic scale simpl cacm histogram distribut probabilist model shown figur good weight calcul number document distribut calcul valu doc left peak doc peak part cacm collect consist titl abstract articl commun acm cacm document titl number distinct word document remain document titl number distinct word statist analysi automat pick substanti di erenc close estim document document document statist analysi document collect relat work context notat provid give pertin descript relat work tradit ir probabilist binari independ retriev model focu relev queri relev speci queri iter determin relev individu queri basi approach matrix probabilist gener model occurr probabl languag model approach ir similar matric xx kei model primari goal scale lsi shown lsi approxim reduc subspac probabilist model similar gener includ arbitrari improv retriev rst singular valu svd separ subspac prove stabl smaller perturb probabilist corpu model built topic introduc shown essenti lsi subspac model structur introduc lead relat determin optim subspac dimens int singular valu relat origin develop arrai signal process minimum descript length principl spheric method cluster document lead concept vector compar lsi vector subspac span concept vector close lsi subspac method develop ecient cluster algorithm concept index introduc latent class variabl joint probabl result probabl aspect model written svd direct probabilist formal develop handl queri effect shown latent class concept common featur brie mention improv lsi coordin rotat footnot section lsi subspac span set lsi develop method work larg develop iter scale improv retriev import advantag lsi reduc storag requir store small number singular origin matrix matric inform retriev storag save signi recent develop method signi cantli reduc storag singular vector probabilist model crete approxim threshold valu discuss outlin dual model work result point featur model invari properti model invari properti model invari respect order word document depend invari wrt order singular vector valu depend xx invari wrt order similar relat document word preserv lsi subspac lsi document repres column word repres row xv similar matrix lsi subspac minor di erenc due truncat svd similar matrix lsi subspac xx minor di erenc due truncat svd note diagon element similar length vector document vector normal origin remain approxim normal lsi subspac document normal lsi provid consist view model invari respect scale paramet averag probabilist model incorpor jc similar standard deviat gaussian distribut repeat analysi section obtain lsi dimens likelihood curv vertic scale enlarg shrink depend normal factor start document jjx jj impli cosin similar similar sim jj jjx jj sim dot normal column impli term normal averag impli similar cosin similar problem similar ned similar measur symmetri document word preserv row column normal answer arm achiev simpl iter altern normal row column uniqu de rst normal column normal rst normal row normal column result case di er rst iter prove simpl nal result simultan normal row column uniqu gener condit appendix result iter di erent depend column rst normal process nal result independ initi step experi matric verifi correct theorem column row normal probabilist model constant simultan term sim jj jj sim dot show similar cosin similar proport constant chang rank separ term document lsi document word repres project dual relationship longer directli repres row column matrix relat ltere similar learn mean word number ltere origin raw context summari introduc dual probabilist gener model base similar measur similar matric natur maximum likelihood estim lsi optim solut model semant associ lsi dimens measur statist signi likelihood calcul standard document collect exhibit maximum likelihood indic exist semant subspac import lsi dimens indic lsi dimens repres distinct ident latent concept matrix main focu studi number nonzero element row matrix document direct reason statist signi canc lsi dimens follow zipf law number nonzero element column matrix number distinct distribut insight structur document collect probabilist model automat inform text classi word model appli imag recognit long relev structur essenti de ned similar model statist framework lsi similar dimens reduct method analyz improv present queri enter develop involv queri explicitli yield insight inform retriev process iter scale method improv lsi util model process involv inform retriev comput lsi basi theori knowledg acquisit cognit scienc result lsi optim procedur semant subspac smaller initi semant space lend deeper understand support theori acknowledg author dr provid matric studi initi ir dr husband simon valuabl dr berri seminar motiv dr susan dumai commun work support oc oc laboratori polici depart energi contract appendix prove nal result simultan normal row column gener matrix uniqu introduc weight factor column normal row normal probabilist model element matrix quadrat equat variabl fa fb solv iter altern normal row column prove solut uniqu distinct set fa substitut subtract view fa fb solv variabl combin homogen equat gener determin coecient matric equat di erent combin impli solut nal solut uniqu refer latent semant iter scale improv similar measur proc acm spectral analysi data mine proc annual acm symposium theori comput ld ak mccallum distribut cluster word text classi cation proc acm press bt gw rk belew repres document explicit model similar al mw st gw obrien linear algebra intellig inform retriev siam experi lsa optim rank basi proc siam comput inform retriev octob ed berri probabilist model st tk gw ra harshman index latent semant analysi concept decomposit larg text data cluster machin learn ding probabl model latent semant index proc st dumai lsi inform experi text retriev confer nation institut standard technolog special fuhr probabilist model inform retriev comput gw tk st dumai vocabulari problem commun commun glassman cach relai world wide web comput network isdn golub handbook automat comput linear algebra van golub cv loan matrix comput ed hofmann probabilist latent semant index proc simon singular decomposit text retriev proc siam comp info retriev octob ed berri jiang ml approxim dimens equal inform retriev proc intl conf machin karypi eh han concept fast reduct algorithm applic document retriev categor proc intl conf info knowledg manag sm katz distribut content word phrase text languag model natur languag tg dp oleari matrix decomposit latent semant index inform acm tran inform probabilist model tk landauer st dumai solut latent semant analysi theori induct knowledg psycholog cd man foundat statist natur languag process mit press ma ch latent semant probabilist analysi proc symposium principl system june acm press pont wb croft languag model approach inform retriev proc cj van rijsbergen inform retriev ed salton mj mcgill introduct modern inform retriev salton bucklei approach automat text retriev inform process automat word discrimin comput stori explan ectiv latent semant index mean bayesian regress model inform process yang reduct statist approach text categor proc marqu model inform retriev applic latent semant index proc irregular lectur note comput simon approxim factor basic algorithm error analysi juli submit siam journal matrix analysi gk zipf human behavior principl ort
DB/1454 3 queri xml data regular path express £ abstract advent xml standard data exchang store queri xml data import xml queri languag common featur languag regular path express queri xml data pose challeng index search xml convent approach base tree meet process requir heavi access request system index store xml data base number scheme element number scheme quickli determin relationship element hierarchi xml data algorithm process regular path search path element scan sort element attribut find find repeat path element algorithm highli effect search path long length unknown result prototyp system implement show algorithm process xml queri regular path express £ work sponsor part nation scienc foundat career award research infrastructur program author assum content paper permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb li moon dept comput scienc az der magnitud faster convent approach introduct extens markup languag xml recent emerg standard inform exchang internet xml data xml consid mean defin expect ubiquit larg volum data sourc applic web xml user make tag descript markup applic tag data element identifi semant data relationship element defin nest structur refer xml metadata describ web site structur facilit navig gener interact site map retriev xml queri languag exampl lorel quilt xpath xqueri xqueri public work draft queri languag xml recent world wide web consortium xqueri languag design broadli applic type xml data sourc document object repositori common featur languag regular path express abil extract inform schema data user navig arbitrari long path data regular path express xpath path notat url navig hierarch structur xml document past research wide believ current state art relat technolog fail deliv function effici store xml data process regular path express straightforward approach base convent tree report literatur approach fairli ineffici process regular path express overhead hierarchi xml data substanti path length long unknown system call index store xml data base number scheme element attribut index structur effici find element attribut common oper process regular path express queri number scheme quickli determin relationship element attribut hierarchi xml data algorithm process regular path express search path element scan sort element attribut find find repeat path element algorithm highli effect search path long length unknown main contribut solut number scheme design base notion extend preorder accommod futur insert gracefulli number scheme determin relationship element attribut constant time major index structur element attribut index structur index index store xml data support search string structur effici join algorithm process regular path express queri hierarchi xml data result prototyp system implement show algorithm process xml queri time faster convent approach rest paper organ section present number scheme major index structur system section discuss potenti ineffici convent queri process regular path express describ decomposit regular path express present join algorithm section present result evalu system join algorithm overview relat work briefli section section summari contribut paper outlook futur work xml index storag system xml data queri combin search structur search search match xml valu document element attribut search structur examin relationship regular path express queri facilit xml queri process structur crucial provid mechan quickli determin relationship xml element fast access xml valu number scheme xml element enabl effici search structur xml index storag system major index structur element attribut data loader queri processor number scheme xml data object commonli model tree node repres attribut text node pair repres nest xml data compon speed process regular path express import quickli determin relationship pair node hierarchi xml data queri regular path express element includ element element figur element element set join produc qualifi element pair join oper carri xml data relationship pair figur element determin quickli main idea present section number scheme tree order determin relationship pair tree node proposit node ü ý tree ì ancestor occur preorder tree figur node annot number scheme node label pair preorder number node ancestor node node node preorder node obviou benefit approach relationship determin constant time examin preorder number tree node limit approach lack flexibl preorder recomput tree node insert number scheme extend preorder rang descend number scheme associ node pair number tree node ý parent ü ý ý ý ü ü interv ý ý ý interv ü ü ü sibl node ü predecessor ý preorder ü ü number scheme preorder number scheme pair figur number scheme exampl ý tree node ü è ý ý direct child ü ü arbitrari integ larger total number current descend accommod futur insert gracefulli difficult show node order number scheme preorder number scheme pair tree node ü ü ý ü ý preorder relationship pair node determin examin valu figur node label defin interv interv node properli interv parent node node node order descend node order observ lead lemma lemma node ü ý tree ì ü ancestor ý ü ý ü ü proof proof induct compar number scheme flexibl deal dynam updat xml data effici extra space reserv call extend preorder accommod futur global reorder reserv space order consum note number delet node node easier number scheme recycl order valu delet node element attribut pair uniqu identifi document tree addit care xml raw data document loader queri queri result processor element index attribut index structur index page file figur index structur overview index tabl ensur attribut node sibl element order number scheme discuss section enabl faster element attribut join oper index data organ mention system support search element attribut structur achiev system mechan process oper effici element list element string group document belong attribut find list attribut string group document belong find parent element child element find parent element index structur major element attribut index structur shown figur compon figur index store string tabl valu entiti xml data consid charact distinct string collect implement ab distinct string uniqu identifi identifi return index index minim storag comput overhead elimin replic string string comparison string valu attribut text collect tabl xml document assign uniqu document identifi index kei retriev document element attribut uniqu identifi order entir system element attribut index structur index index support essenti function list element index attribut index implement identifi kei entri leaf node point set record element ident group document belong element index quickli find element element document id document id list element list document figur element index arrai element attribut document figur structur index parent id element record parent child sibl attribut order common oper process regular path express queri element record includ pair relat inform element record sort order valu shown figur attribut index structur element record attribut index identifi kei obtain attribut tabl organ structur index shown figur collect linear store set record element attribut xml document element attribut sort preorder record structur index store identifi valu attribut path join algorithm algorithm effici process regular path express queri xml data sampl queri borrow xqueri work draft symbol function symbol denot singl node denot separ node path denot union node denot occurr node denot occurr node denot occurr node predic express denot attribut tabl notat regular path express find figur frog chapter chapter figur xml xml attribut queri run section note notat paper slightli xqueri work draft tabl full notat regular path express paper convent approach straightforward approach process regular path express queri hierarchi xml object bottomup fashion process queri topdown downward path start element find exist figur element descend step repeat chapter element xml impli absolut examin path element leaf node xml element found path element root xml entir tree cost tree reduc bottomup approach queri element caption tree frog search figur xml tree examin tree find exist element ancestor upward simpler exist upward path element frog cost approach higher approach hybrid approach meet middl path express hybrid approach advantag approach xml data structur characterist effect describ decomposit regular path algorithm process regular path express queri xml tree decomposit path express main idea algorithm complex path express simpl path express simpl express produc intermedi result subsequ stage process result simpl path express combin join obtain final result queri interest analog regular path express process join oper process seri join relat queri processor regular path express form union figur decomposit path intermedi result join regular path express combin basic subexpress singl element singl subexpress element attribut subexpress element subexpress kleen closur subexpress union subexpress figur illustr complic regular path leaf node top figur subexpress singl element attribut circl repres subexpress type subexpress singl element attribut process access element index attribut index system section union subexpress process merg intermedi result group document straightforward subexpress type subexpress type subexpress type subexpress type algorithm section algorithm algorithm join intermedi result list element list attribut regular path express search figur element caption tree frog xml document system intermedi result input algorithm list figur element list caption attribut group document belong algorithm algorithm algorithm element attribut join set element common document set attribut common document pair element parent attribut doc identifi foreach relationship foreach parent output end end element index maintain element record sort order document identifi join intermedi result obtain oper addit cost sort element set attribut set merg document identifi stage pair element list attribut list match document identifi extract element attribut merg examin relationship base valu number scheme mention briefli section import ensur attribut sibl element order number scheme perform impact oper potenti addit requir number scheme element attribut match document identifi merg singl scan list group document scan outer foreach loop algorithm element list attribut list scan foreach loop algorithm explain shown figur note tree node annot pair xml tree left hand side figur attribut number sibl element time relationship attribut pass examin relationship attribut list xml tree hand attribut number sibl element relationship pair pair determin chapter chapter chapter element node attribut node chapter figur exampl correct incorrect case algorithm algorithm join intermedi list element obtain subexpress regular path express search pair relationship xml document system intermedi result input algorithm list chapter element list figur element group document belong algorithm algorithm algorithm element element join set element common document identifi pair element ancestor element doc identifi foreach relationship foreach ancestor output end end algorithm perform join set element oper addit cost sort element set merg document identifi stage pair element set match document identifi extract element set merg examin relationship base valu number scheme unlik set element match document identifi merg singl scan algorithm lemma pair relationship determin examin point rang join set element relationship view join rang set point set point element figur descend chapter chapter chapter chapter figur figur figur figur extrem case join element figur extrem chapter element match element scan list figur element fact element set scan multipl time foreach loop algorithm algorithm highli search path long length unknown section compar algorithm convent approach base tree effect corrobor result worth note algorithm support join path element pair relationship coupl depth element xml number scheme determin relationship constant time special case process algorithm subexpress subexpress pair element algorithm process singl scan subexpress process algorithm algorithm algorithm kleen closur algorithm group element xml document kleen closur appli algorithm repeatedli set set repeat set set output union algorithm process regular path express repres occurr subexpress process algorithm appli result previou stage repeatedli result produc find obtain set data set size file element attribut shakespear sigmod tabl xml data set chapter element join result chapter final result union result previou stage algorithm algorithm experi implement prototyp store xml data index primit queri interfac provid xml parser xml data gist librari index queri process directli implement queri interfac experi perform sun workstat run solari workstat mbyte memori gbyte disk storag ultra eid interfac disk local attach workstat store xml data index direct featur solari experi avoid oper cach effect data set perform metric chosen data set applic synthet data set gener xml gener ibm data set characterist data set summar tabl number entri repres total number element number distinct element data set plai xml mark jon sigmod data set xml version acm sigmod record small file issu sigmod record xml gener industri text gener version xml data data set store singl larg document file data set store separ document file perform queri process present perform measur analyz algorithm join join oper convent method compar algorithm cost output gener algorithm output cost includ measur measur perform larg determin perform algorithm queri queri join oper queri find element descend chapter element actual queri experi shown tabl compar method method expect outperform method data set method process queri step search element start element tree find element output path figur figur show time data set synthet data set algorithm perform small number buffer page method longer time process synthet size buffer pool small algorithm access sort element disk sequenti method access element structur index randomli result low rate page fault high rate page fault method vertic line figur show sever elong process time method extrem case buffer page point buffer page perform measur remain constant irrespect number buffer page experi synthet data algorithm outperform method wide margin data order magnitud faster method synthet data time faster bottomup method measur io time separ observ trend perform figur disk io domin cost factor queri evalu percent total time spent disk access algorithm queri queri join oper form queri find element attribut type compar perform algorithm time data set element element result shakespear act speech sigmod articl author block block shakespear sigmod shakespear sigmod number buffer page tabl summari queri time number buffer page data set synthet data set method actual queri experi summar tabl shakespear data set data set attribut total time shown figur data set small number attribut sigmod data method expect outperform tree small number attribut effici tree branch sigmod data method method figur synthet data number attribut larger number element data perform method parent element attribut figur attribut child scope element child attribut limit level tree method fairli effici synthet data set perform algorithm topdown method main reason scan element list attribut list tree scalabl test carri scalabl test algorithm larg data set gener document type definit observ queri process time size xml data result show linear scalabl figur total time queri £ evid algorithm improv perform queri process xml path express convent method order magnitud previou work xml data path plai central role queri optim navig path express import issu optim queri plan depend valu shape graph data queri evalu strategi queri optim strategi exploit path strategi exploit hybrid strategi speed queri process lore type index structur index text index search object specif link index path index provid fast access parent object object reachabl label path keyword search import queri xml structur xml data user effort integr keyword search xml queri process florescu kossmann extend queri languag keyword base search capabl index facilit keyword structur invert file extend support index addit inform granular xml type depth relat element instanc wolff al make structur inform xml document retriev process base probabilist model index structur time data set element attribut attribut result sigmod author id block dir block dir sigmod sigmod sigmod number buffer page tabl summari queri time number buffer page time number buffer page sigmod data data data index preserv hierarch structur underli text index support evalu textual queri problem optim regular path express studi context navig data web site semistructur data model node denot html page edg denot hyperlink abiteboul vianu deal path queri evalu advantag local knowledg path data graph captur structur inform web site address issu decid regular path queri constraint fernandez dan suciu queri optim techniqu rewrit regular path express queri reduc scope navig index structur search algorithm perform effici filter xml document select inform dissemin environ role queri data effect target inform user profil pose stand queri appli incom xml document order determin user document stand queri written xpath languag regular path express queri determin document tree view complet tree virtual node identifi node assign tree ancestor children node calcul identifi problem approach ariti height complet tree identifi huge number complet tree height total node number larg store word integ make approach unrealist larg xml document locat locat figur total time node tree select ancestor node level tree identifi ancestor node prefix descend method space store time determin relationship constant depend length identifi recent work posit depth tree node index occurr xml element posit pair begin end locat order properti base posit depth similar extend preorder independ invent paper futur work develop xml index storag system store index xml data effici process regular path express queri number scheme base extend preorder determin relationship node hierarchi xml data constant time number scheme adapt gracefulli dynam xml data object alloc number region extra space plan investig document type definit determin size number region element attribut major drawback convent method base tree requir extens search xml data tree avoid innov approach process regular path express complex path express collect basic path subexpress subexpress process directli access index structur system appli algorithm subexpress pair algorithm perform process oper result prototyp implement show pose algorithm achiev perform improv convent method order magnitud queri process paradigm paper pose interest issu xml queri optim regular path express wai decomposit lead queri process perform affect substanti regular path express import optim task find express conjectur document type definit statist xml data estim cost size intermedi result current prototyp implement index structur organ page file effici disk io observ disk access effici storag util worth investig find optim page size point criteria refer wiener lorel queri languag semistructur data intern journal digit april serg abiteboul victor vianu regular path queri constraint acm sigart symposium principl page michael franklin effici filter xml document select dissemin inform vldb page septemb tim jean ev maler extens markup languag edit recommend technic report world wide web octob stefano sara stefano letizia tanca graphic languag queri restructur xml document intern world wide web page don daniela jonathan queri languag xml work draft technic report world wide web februari don jonathan daniela florescu xml queri languag heterogen data sourc intern workshop web jame clark steve xml path languag version recommend technic report world wide web novemb robin cover xml cover page februari mari daniela alon dan suciu queri languag xml intern world wide web page angel lui diaz dougla xml gener septemb paul maintain order link list fourteenth annual acm symposium theori page san mari fernandez dan suciu optim regular path express graph schema inter confer data page februari daniela florescu donald kossmann perform evalu altern map scheme store xml data relat technic report daniela donald ioana manolescu integr keyword search xml queri process intern world wide web roi goldman jennif widom enabl queri formul optim semistructur vldb page septemb joseph jeffrei avi pfeffer gener search tree system vldb page septemb understand queri languag technic report version ibm august olivi mark ichikawa structur graph xml metadata describ web site structur comput network isdn jason mchugh jennif widom queri optim xml vldb page septemb jason jennif serg anand rajaraman index semistructur data technic stanford stanford februari jen holger armin cremer search collect structur inform ieee advanc digit librari page xml librari januari yong index structur structur document acm intern confer digit page march chun jeffrei david gui lohman support queri relat manag system santa
HCI/1455 4 visual interpret hand gestur review vladimir pavlov rajeev sharma thoma huang depart electr comput beckman institut advanc scienc technolog illinoi mathew il usa abstract hand gestur attract altern cumbersom interfac devic interact visual interpret hand gestur achiev natur desir hci survei literatur hand gestur recognit context role hci number approach hand gestur recognit grown recent year systemat analysi aspect gestur interact develop discuss complet model hand gestur possess spatial dynam properti human hand gestur accommod natur type class model emploi interpret hand gestur hci consid util model human reli human hand imag investig model paramet analysi featur impact interpret hand gestur present light natur desir hci hand model offer complet model hand gestur lack simplic comput effici highli feasibl model suggest method effect gestur interfac hci integr hand gestur natur mode commun provid potenti answer problem work put advanc comput vision understand interact produc effect natur hand gestur interfac introduct human societi live interact entiti environ daili live interact peopl object perform varieti action import comput machin element societi increasingli influenc aspect perform interact environ concept interact interact comput advanc common hci reli simpl mechan devic mice joystick tremend reduc effect natur interact limit evid emerg concept surround interact virtual realiti recent studi shown natur point virtual space index finger explor virtual object hand easier understand peopl virtual environ manipul object idea virtual collabor environ research jointli design test prototyp product realiti mean hci perform interact environ natur earli dai comput attempt make understand speech year interest introduc mean interact field hci mean includ class devic base spatial motion human hand gestur human hand gestur mean interact peopl rang simpl action point object move complex express feel commun exploit gestur hci provid mean interpret comput hci interpret gestur requir dynam static configur human arm bodi measur machin attempt solv problem result mechan devic directli measur hand arm joint angl spatial posit group repres devic devic complet fulfil import requir hci natur gestur interfac forc user carri load cabl connect devic comput hinder natur user interact comput control environ overcom limit devic approach hci recent year approach suggest set video camera comput vision techniqu interpret gestur result interfac result burst recent activ area work gestur hci recognit static hand gestur postur varieti directli gener object recognit util imag geometr hand skeleton model exampl dynam hand gestur easili disregard interpret light object track hand gestur dynam action interpret motion hand convei mean postur fusion dynam characterist gestur hci recent role deserv numer rang global hand motion independ fingertip justif rapid growth hci brought surfac systemat analysi aspect light natur task accomplish technic literatur paper attempt achiev goal paper organ section formul problem hand gestur mean hci discuss model method hand gestur hci definit taxonomi gestur suitabl hci framework section section establish unifi approach analysi recognit hand gestur choic featur analysi human imag influenc model gestur perform gestur interpret scheme stress import hand gestur briefli discuss section number applic light analysi recognit techniqu present conclud review discuss limit current approach visual interpret hand gestur number solut prospect research direct hand gestur hci hand gestur mode hci visual interpret movement carri tremend advantag techniqu requir mechan restrict user movement restrict weight discomfort mechan devic visual interpret carri burden complex implement numer approach appli problem visual interpret gestur section approach chosen implement focu aspect hand pose hand postur effect studi process hand gestur global structur interpret system establish global gestur interpret system system requir mathemat model gestur establish model pivot success function system devot section discuss gestur model issu model decid system gestur descript mathemat model gestur model paramet space class grammar recognit analysi paramet model input video figur block diagram gestur interpret system classic path model paramet comput analysi stage imag featur extract singl multipl video input stream select featur specif task gestur interpret crucial effect model paramet comput note section section analysi stage recognit block paramet classifi interpret light accept model rule adequ grammar grammar reflect intern syntax gestur command possibl interact gestur commun mode facial express natur interpret gestur measur point encompass variabl number class movement cover requir mileston remain fulli reach futur gestur model qualiti gestur interfac hci directli relat proper model hand gestur model hand gestur primarili intend applic hci context simpl model suffici model establish natur gestur interpret comput discuss question model hand gestur hci definit gestur hci hand gestur easili defin relat commun aspect human hand bodi movement webster defin gestur motion limb bodi mean movement bodi limb express psycholog social studi tend narrow broad definit relat man express social interact domain hci notion gestur comput control environ human hand perform task mimic natur hand commun function classic definit concern mention human hand call establish mean interact comput control virtual environ definit hand definit vector describ pose hand arm spatial posit environ time paramet space hand gestur repres trajectori paramet space suitabl defin interv note definit suggest possibl gestur spite note gestur perform natur environ type except includ manipul hand modal question construct gestur model paramet set defin gestur interv focu attent question gestur taxonomi lack clear definit gestur gener taxonomi gestur taxonomi suggest literatur deal psycholog aspect gestur vari author author kendon distinguish occur independ occur associ mcneill levi recogn group icon metaphor taxonomi hci recent develop quek adopt gener taxonomi proposit taxonomi gestur applic hci figur classifi movement major gestur unintent movement unintent movement movement convei gestur inform gestur commun manipul manipul gestur act object environ commun inher movement gestur unintent movement commun manipul act symbol referenti modal deictic mimet figur gestur taxonomi hci commun natur environ accompani speech commun gestur act symbol symbol gestur linguist role symbol referenti action circular motion index finger refer speech modal gestur wing hci context gestur commonli gestur repres static hand discuss section act gestur directli relat interpret movement movement classifi mimet imit deictic taxonomi gestur larg influenc paramet space gestur interv determin relat gestur taxonomi classif gestur dynam issu tempor model gestur human gestur dynam process issu tempor characterist gestur practic natur resolv problem tempor segment gestur unintent movement question determin gestur interv psycholog studi gestur provid fairli consist answer previou question kendon call interv establish phase make nucleu stroke retract prepar phase consist preparatori movement set hand motion rest posit nucleu gestur form enhanc dynam hand return rest posit reposit gestur phase except rule call relat rhythmic structur discuss guid process tempor discrimin gestur set rule develop lead tempor classif set rule suggest quek formul modifi version rule form proposit hci environ set rule determin tempor segment gestur interv consist retract hand pose stroke classifi path paramet space gestur confin spatial volum repetit hand movement gestur manipul gestur longer gestur interv length commun gestur tempor phase distinguish gener rapid chang posit exhibit slower hand motion proposit hold case gener gestur hci section complex gestur interpret stringent constraint tempor variabl hand gestur work gestur hci reduc gestur static hand pose spatial model gestur movement action descript involv spatial properti hci domain influenc kind applic gestur interfac intend applic requir simpl model static imag templat human hand tv set control requir sophist hand model rise model movement provid complet descript gestur proposit complet gestur model hci paramet belong paramet space construct fx posit hand arm segment joint fingertip proposit reli assumpt human hand arm thought articul object valid hci deform human hand skin convei addit inform interpret gestur hci model provid inform requir correct analysi hand gestur hci hindranc approach paramet space high paramet obtain paramet model comput vision techniqu prove extrem complex overcom obstacl major approach gestur model util figur model gestur hand arm model approach examin approach close subsect spatial gestur model hand joint angl palm posit imag imag geometri paramet imag motion paramet fingertip posit motion figur spatial gestur model model employ model gestur model direct consequ proposit deal paramet mention proposit reduc set joint angl paramet segment length reduct accomplish set assumpt gener hold introduc depend joint bound move rang joint angl model base simplifi skeleton human research concern global motion cylindr model human arm bodi segment model human skeleton model common figur model mimic human hand skeleton kinemat exampl studi human hand morpholog biomechan found briefli describ basic notion relev discuss human hand skeleton consist divid bone bone bone joint connect bone natur exhibit freedom joint connect limit freedom movement hold joint figur finger joint show tm joint dof pip dip joint dof equal import notion dof notion depend movement neighbor joint natur peopl bend finger pip dip joint rang angl hand joint natur assum set constraint joint angl static dynam set constraint dof hand middl distal proxim distal proxim distal proxim middl ring thumb index figur model human hand static constraint finger thumb dynam constraint ip dip ip ip tm tm superscript denot movement joint center coordin system lee develop freedom hand skeleton model analog set constraint similar model equal lesser complex author model group model base imag mean model paramet encompass paramet mention proposit directli deriv model gestur relat gestur set templat gestur larg varieti model belong group base deform templat human hand arm deform templat set point outlin object interpol node object outlin approxim simplest interpol function linear function templat set variabl paramet describ variabl element obtain princip compon analysi train set data model simpl gestur classif base multitud class templat group model hand imag sequenc gestur templat gestur set gestur model sequenc repres imag element correspond view hand arm common view paramet model imag featur deriv imag complet imag sequenc human hand motion templat se gestur imag finger emploi templat finger track applic major paramet deriv imag templat denot class paramet hand imag properti paramet contour imag imag mention paramet featur analysi gestur section contour direct model paramet simpl contour polar exampl contour emploi basi eigenspac analysi paramet imag moment easili calcul silhouett contour paramet zernik moment orient histogram group model fingertip posit paramet approach base assumpt posit fingertip human rel suffici differenti finit number gestur assumpt hold space note lee palm assum finger limit number dof model locat fingertip palm applic concern deictic gestur singl fingertip refer point hand bodi gestur analysi previou section discuss wai model gestur hci analysi stage estim paramet paramet gestur model base number low level featur extract imag human oper act hci environ paramet gestur model acquir multistag analysi mono multi camera video input sequenc imag step constitut featur model paramet comput featur figur analyz step imag featur extract imag featur extract hand local segment hand local segment hand model paramet comput model paramet local imag featur camera camera global imag global imag figur gestur analysi hci hand local segment local segment process hand arm extract rest imag complex task lower burden local segment analysi varieti restrict restrict restrict restrict imag restrict background commonli distinct background greatli simplifi segment task addit restrict user requir wear long dark simplifi local problem restrict imag extract hand background perform threshold imag directli restrict setup emploi color histogram analysi color analysi applic characterist histogram footprint hsv color human skin mention approach requir addit process step applic resort uniqu color glove marker comput point method easier implement tend reduc natur interact techniqu advantag motion analysi move produc movement segment hand static object featur extract low level imag featur depend model gestur model type featur emploi calcul paramet similar model model finger trajectori requir fingertip extract featur imag featur wide scope paramet section featur obtain imag silhouett simplest wide silhouett easili extract local imag restrict background setup case complex techniqu emploi color histogram analysi hand exampl silhouett featur found hand analysi techniqu higher level featur paramet extract silhouett imag contour repres group featur edg detect scheme produc contour base simpl silhouett color imag contour model model analysi gestur recognit form set finger link candid model paramet instanc function point contour commonli featur gestur analysi fingertip fingertip locat obtain paramet hand model model detect fingertip locat space trivial effect solut detect problem mark glove color marker design characterist fingertip extract fingertip locat fairli simplifi perform color techniqu detect fingertip pattern match templat imag fingertip finger gener cylindr model techniqu enhanc addit imag contour fingertip extract algorithm base characterist properti fingertip imag curvatur fingertip characterist pattern heurist fact finger repres foremost point hand deictic indirect approach detect fingertip emploi imag analysi special tune gabor kernel discuss featur reflect featur combin featur form robust set effect paramet comput paramet comput comput model paramet stage gestur analysi gestur recognit stage recognit block track paramet comput stage produc final output type comput depend model paramet featur gestur model emploi success approxim method paramet comput basic idea vari model paramet featur extract model match obtain data imag figur match procedur begin palm end match finger initi model paramet select match gener hand posit obtain predict analysi paramet previou imag sequenc multitud featur hand paramet huang hand silhouett vari volumetr model paramet model silhouett match hand imag applic reli fingertip locat calcul model paramet lee prove locat fingertip addit characterist point palm uniqu defin hand pose assumpt similar discuss section model similar approach deriv kang al approach contour edg guid success adjust model paramet select candid finger arm link al al davi model paramet adjust model featur extract featur comparison model featur imag featur model paramet initi model figur model paramet comput success approxim techniqu deform model similar success approxim model orient princip compon adjust success satisfactori match model imag achiev simpler model direct map featur paramet space map explicitli defin moment imag emploi interpol correspond tabl obtain train gestur recognit gestur recognit phase trajectori paramet space analysi classifi member subset paramet space problem recognit optim partit paramet space implement recognit procedur problem partit design partit paramet space reflect percept determin class membership map paramet space relat implement issu recognit process question practic intens recognit procedur discuss question detail partit gestur paramet space influenc primarili kind applic hci system intend optim partit produc singl class paramet space gestur minim intersect gestur class provid complet descript gener partit reflect taxonomi movement tempor properti gestur tempor properti present proposit suggest tempor partit obei phase model model paramet space partit base tempor phase model initi final phase gestur inform follow gener taxonomi gestur proposit provid main taxonom differenti mimet gestur complet gestur model proposit induc paramet space partit rule produc set distinct class natur gestur hand gestur model closest complet gestur model provid possibl gener gestur recognit complet model wider class gestur cover system model fall short gener gestur recognit paramet space model insuffici describ gener gestur gener gestur difficult distinguish assum restrict restrict taxonom group paramet space optim partit respect gestur disregard dynam properti gestur analyz static postur restrict simpl model exhibit satisfactori recognit perform perform actual method time partit requir global motion distinguish tempor phase proposit model paramet space partit perform number classif method method requir repres gestur class class repres ad hoc determin hidden markov neural network membership map class base minimum distanc measur class repres hidden markov model techniqu case state hmm easili tempor gestur phase gestur hmm state hmm train procedur built base classif recognit procedur dynam time warp tempor invari classif gestur model hmm emploi recognit notabl success success recognit scheme gener base classif membership function context specif gestur establish introduc grammat element recognit procedur grammar reflect linguist charact commun gestur spatial charact manipul gestur subclass gestur action respect current previou state hci environ plausibl user reach valid manipul cup handl handl visibl user point hci system discard gestur small number system exploit fact grammar simpl introduc artifici linguist build learn user question comput effect recognit model complex versu recognit applic versu recognit time complex model wider class gestur appli comput complex recognit time gestur model ten paramet paramet calcul requir success approxim procedur price lower system base model rare show close perform time perform rang minut singl frame predict frame applic system gener hci gestur recognit arena superior simpl model model restrict applic narrow subclass hci enhanc comput concept hand postur classif instanc lower complex afford easier implement real time applic applic system recent interest gestur interfac hci driven vast number potenti applic hand gestur mode hci simpli enhanc interact desktop comput applic replac comput similar devic replac joystick button control machineri physic impair commun easili major develop gestur interfac growth applic situat virtual environ manipul gestur commun gestur gestur interfac manipul commun natur figur applic gestur interfac hci unlik gestur natur manipul commun gestur hci emploi direct manipul object convei messag hand gestur natur environ manipul action commun section commun role gestur subtl hand gestur tend support element speech except deictic plai major role human manipul aspect gestur prevail current applic hand gestur portrai manipul virtual object depict figur vo comput gener simul object window abstract physic devic control panel robot arm perform manipul object hci combin track commun gestur direct comput rotat object user interfac issu select object rotat object action hand track move pointer ve vicin object rotat object user rotat hand back produc metaphor rotat manipul pose commun gestur manipul commun gestur impli finit vocabulari gestur manipul natur movement answer question complex analysi recognit type gestur model section hand gestur model suit model manipul commun model gestur applic commun hand gestur model model section achiev usabl perform resort desir model gestur summari characterist system aim applic tabl applic hand gestur hci meant yield manipul action gestur hci convei messag storag transmiss process american sign languag provid opportun applic reduct bandwidth major issu typic solut problem code techniqu techniqu imag sequenc state physic object scene particip case updat descriptor receiv end comput gener model physic object driven receiv data code requir human bodi model appropri depend amount detail achiev model upper bodi limb fine tune model human face hand model gestur substanti applic applic gestur model techniqu gestur command complex cd player control panel hand silhouett moment track fp virtual squash hand silhouett moment contour track metaphor fp fingertip templat track na aliv templat correl track combin recognit facial express tv displai control templat correl track fp heurist detect point action track metaphor combin speech window manag hand pose recognit neural network track metaphor imag moment fingertip posit track metaphor fp heurist detect point action track dof hand model track fp silhouett zernik moment metaphor fp automat robot instruct fingertip posit grasp track na robot manipul control fingertip posit metaphor hand sign recognit discrimin featur imag sign na asl recognit silhouett moment grammar word fp frame tabl system emploi hand gestur hci speed measur complex interpret lack accur measur applic implement comput system level optim recognit asl consid applic natur emploi human gestur mean commun applic plai vital role commun peopl commun impair deaf devic automat translat asl hand gestur speech signal undoubtedli posit impact individu practic reason asl testb present hand gestur recognit system compar natur gestur human fact impli model techniqu suit asl proven recent applic prospect hand gestur hci vast applic mention section step introduc hand gestur hci develop natur point import issu excit applic hand gestur hci detail section futur direct fulli exploit potenti gestur hci environ class recogniz gestur broad gestur perform user unambigu natur interfac state art gestur recognit provid satisfactori solut achiev goal hci system present time address narrow group symbol command base hand postur type point section reason complex analysi recognit gestur simpl gestur model result gestur point direct quickli found silhouett human hand environ figur find hand distinguish simpl imag difficult interfac system base hand figur silhouett imag hand postur silhouett interpret reflect vertic ax silhouett silhouett unambigu defin hand postur base gestur model model commonli emploi hand track hand postur analysi analysi paramet hand model result wider class hand gestur identifi analysi link model lead point natur hand gestur model offer prospect model prospect present hinder lack speed restrict background hand approach issu adequ solv solut problem problem complex model featur extract fingertip posit featur section difficult extract solut problem emploi skin nail textur distinguish tip finger comput complex model paramet reduc optim number paramet satisfi level natur emploi parallel comput involv aspect pertain construct natur hci address futur aspect involv gestur human gestur natur emploi action hand gestur system focu attent gestur except system develop krueger inevit present time analysi techniqu requir hand extract global imag gestur ambigu situat occur case occur dealt distinct index versatil gestur analysi techniqu exhibit major speed techniqu handl gestur applic restrict simpl gestur requir hand adequ address issu gestur effect analysi techniqu consid techniqu reli improv classic techniqu exploit interdepend hand perform gestur case hand perform singl gestur assum symmetr postur issu relat gestur multipl gestur success interact environ multipl user virtual model task benefit enorm design simultan particip process implement interfac difficult issu foremost analysi gestur analysi present assum workspac gestur proposit case multipl user intersect workspac probabl event differenti user pose problem activ comput vision camera adapt focu area offer solut problem address issu interact multipl commun mode hci relat hand gestur hand gestur bodi mean commun section natur commun human concurr involv mode commun accompani gestur accompani word sentenc control deictic gestur involv index finger point control panel gaze direct panel commun gestur affirm complement mean speech messag literatur report psycholog studi human interact speech gestur mean commun explor lead multimod interact render hci figur affirm hand gestur gestur speech virtual environ gaze figur multimod hci system courtesi rich illinoi state reduc uncertainti speech recognit provid robust interfac gestur complement carri complet commun messag interpret speech gaze multimod messag reduc complex natur interfac hci design complic gestur command object select consist deictic gestur symbol gestur symbol object point hand simpl concurr deictic gestur verbal command number studi explor multimod hci steadili past coupl year present integr commun mode system perform command portion mode independ recogn interfac structur simplifi inform pertain interact mode lower level lost util multimod interact approach fuse multimod input analysi recognit consid futur studi interact human machin attract princip interest research past year coincid burst activ surround applic situat abstract natur surround virtual environ wide interact devic lower natur interact hinder effect environ direct natur mean interact hand proven plai essenti role solut problem paper focu discuss hand gestur visual interpret hand gestur yield potenti solut problem interpret hci comput control environ number approach hand gestur recognit grown tremend recent year systemat analysi aspect gestur interact emerg paper address task present unifi approach analysi recognit hand gestur visual interpret effect model hand gestur hci account characterist natur hand gestur complet model hand gestur reflect spatial dynam properti human hand gestur accommod natur type class model emploi interpret hand reli model human util human hand imag investig model paramet analysi featur influenc recognit hand gestur present light natur prefer hci hand model offer complet model hand gestur lack simplic comput effici highli desir accomplish model studi motiv potenti applic hand gestur natur interfac applic hand gestur interact system todai infanc find current system emploi hand gestur manipul complex interpret gestur dictat achiev gestur convei manipul action todai commun type hand gestur hci restrict produc singl user system downgrad effect interact suggest method elev effect gestur interfac show integr hand gestur gaze natur relat mode commun provid attract potenti solut problem substanti research effort connect advanc comput vision basic studi interact futur develop effect natur hand gestur interfac acknowledg work support part nation scienc foundat grant part grant electr industri refer hauptmann speech graphic intern journal vol pp feb prototyp mechan system concurr concurr tool technolog mechan system vol pp lu system workbench integr facilit intern journal intellig cooper inform remot control object commun vol pp fel neural network interfac speech ieee transact neural vol pp jan survei ieee comput graphic vol pp jan recognit ieee nation aerospac electron vol wang virtual point system robot inspect surfac flaw neural network base skeleton ieee intern confer robot vol pp issu studi biolog foundat motor semiot aspect pp lawrenc erlbaum mcneill languag activ studi deixi relat topic imag vision vol august hand gestur virtual realiti softwar technolog pp aug freeman control hand proc pp june base hand model intern confer comput june face gestur recognit video proc pp june analysi sign languag progress imag analysi process intern confer imag analysi pp descript gener cylind complex occlud system comput vol pp track recognit human proc pp june vol perspect vol pp oct hand model gestur recognit human comput master illinoi lee hand model techniqu comput pp lee analysi hand ieee comput graphic pp septemb rehg human hand tech rep school comput carnegi mellon rehg track articul tech rep carnegi mellon school comput pa decemb usabl hand ieee asilomar base hand pose proc pp june meyer recogn postur perspect pixel artifici neural network alexand elsevi scienc publish shape model train comput vision imag vol pp januari structur deform mode object long imag intern workshop automat june interpret human face hand gestur flexibl proc pp june darrel comput vision pattern recognit darrel express gestur analysi interact proc pp june input devic augment proc pp june cho shape ieee transact pattern analysi machin vol pp sept comput virtual realiti april interact freedom monocular imag proc pp june cui hand sign proc pp june moghaddam likelihood detect face proc pp june identif gestur input hidden markov ieee workshop applic comput pp decemb starner recognit american sign languag hidden markov proc pp june base hand gestur interpret asilomar confer freeman histogram hand gestur intern workshop automat june miss uncertain intern confer neural vol pp davi tech rep depart comput central human comput interfac user center pp point interfac imag comput vol pp point proc pp june hand gestur recognit window system proc pp june structur motion motion intern confer comput pp gestur input devic virtual ieee annual virtual realiti intern pp make real world commun vol pp juli ura gestur recognit edg proc pp june davi gestur iee proc vi imag signal vol pp april comput graphic driven verbal previou current activ comput vol pp davi hand asilomar confer wai oper proc pp june kang automat robot instruct percept recogn grasp ieee transact robot vol pp aug estim gestur input intern workshop automat june ieee vol pp artifici realiti ii time hand gestur recognit predict intern confer pp octob recognit human gestur imag process recognit gestur move ieee intern workshop robot human pp video commun system transmiss sign languag ordinari telephon imag sequenc process dynam scene analysi pp berlin imag code commun realist sensat recent ieic vol pp june blake activ vision mit vision visual ieee workshop visual applic open levi pp commun coordin gaze commun vol pp decemb multimod framework interact virtual proc symp human interact complex north septemb vo combin gestur speech adjunct april learn arpa spoken languag technolog workshop januari human ieic transact inform vol pp june
IR/1456 5 relat algebra web thorsten jurgen weiss guido moerkott fur informatik iii fur mathematik und informatik universitat mannheim mannheim germani abstract main idea underli paper extend relat algebra process queri web extens minor domain level domain introduc domain deal fragment path express domain defin function access algebra subscript relat oper approach oper relat algebra major modif extens introduct map oper modif scan function typic engin capabl comput unifi rank base tupl order provid underli search engin introduct web myriad page target design queri languag deal unstructur data queri languag give birth underneath adher design principl start check expand develop core relat algebra core queri languag web translat relat algebra raw short raw slight extens common relat algebra introduc domain map oper model web contrast approach due design start point futur reveal express check relat restrict relat grant continu raw introduct main idea relat algebra gener raw consist set algebra oper relat import point relat request research document obviou document referenc favorit research group valuabl restrict easili express nowadai simpli altavista advantag netscap bookmark raw organ relat set relat readili exploit raw express netscap input request good start point search engin altavista hotbot search engin suit request search engin web page world obviou solut engin retriev languag restrict search engin nice rank order output rank order lost exist engin disadvantag solv raw oper raw index scan physic customiz rank function integr rank function order output relat algebra oper subsequ raw oper select provid arbitrarili complex search predic point raw point technic reason start develop raw queri languag web algebra easier evalu extend queri languag queri optim execut engin rest paper organ section introduc domain section describ oper set raw raw queri web give sketch implement topic section integr rank result search engin section raw relat model relat schema finit set attribut fa attribut domain relat schema fa subset dn standard thing raw relat model domain standard domain raw featur domain function int resourc identifi defin function domain filenam retriev part return string function concern document referenc ffl string return mime type referenc document ffl int return size referenc ffl string bool addit string paramet return bool indic string occur document consist altern sequenc string indic descript refer document referenc link href click domain plenti function ffl int return length ffl append append ffl string bool check occurr string underlin part ffl return path ffl return path assum collect fragment address describ path lead sequenc describ titl function domain ffl string bool check repres lead fragment ffl bool check lead ffl content fstringg return set string repres ffl content fstringg return set string repres note function return set string section raw algebra oper common relat algebra raw consist set oper oper set standard set oper standard relat algebra oper denot type relat schema fa attribut relat repres domain type ffl select boolean select predic ffl project fa fa fa ffl join bn bn bn bn bn bn boolean join predic select join raw accept arbitrari boolean express possibl function data type introduc map oper belong oper set raw map input tupl map oper extend input relat attribut result evalu function found subscript possibl result function case oper gener output tupl element set case multipl set valu output tupl combin follow path resolv raw design physic algebra typic physic relat algebra oper scan present raw scan scan oper input relat paramet express result set string string search occur dereferenc scan referenc document extract dereferenc input relat expand addit attribut domain path build process input tupl result string set scan comput set path start address path path tupl expand attribut path scan oper predic restrict output length result path restrict select predic build special domain function accept scan oper select predic paramet illustr scan document string referenc favorit research group assum relat favorit research group attribut address assum queri answer scan restrict path length predic free variabl bound path found process raw signatur search string timeout input produc output relat attribut result rank comput section string search engin gave result engin concaten titl document sophist exampl section present sophist queri exampl evalu illustr express raw queri answer raw express featur scan select search document string document referenc server select time limit gave small time result tupl assum interest postscript document referenc referenc netscap bookmark constraint postscript document start point queri evalu bookmark folder titl research evalu queri extract interest bookmark find postscript document answer queri step step bookmark queri evalu start relat consist attribut address relat lead netscap bookmark consist html definit list list singl bookmark html definit list repres bookmark folder bookmark folder titl map oper extend relat attribut content attribut consist string repres fragment repres content bookmark folder bookmark file select interest folder function step start scan search phrase input relat extend valid path express path express start point scan oper search postscript document map oper add href uri found postscript document result final project oper relat postscript document implement relat repres ascii file line repres tupl attribut separ arbitrari separ charact default raw implement bunch program perl program implement raw oper commun oper temporari file pipe implement scan oper script plenti function domain refer actual document buffer fetch document manag raw system part implement concern error occur carefulli http statu code action analog cach successfulli fetch dangl refer manag technic detail implement scope paper rank raw algebra unifi customiz rank function integr order produc search engin data model relat set order set develop unifi customiz rank fact discourag integr rank search engin ffl search engin explicit rank document ffl search engin rank algorithm ffl rank algorithm search engin ffl result rank repres ffl search engin document base context make explor rank valu search engin explor rel document order provid search engin factor relev order set document retriev search number referenc search rank refer queri qualiti referenc search engin origin develop oscar inform qualiti search engin determin influenc rank search engin result rank note paramet queri specif motiv customiz rank integr function qualiti search engin user system specif system depend size search engin document base number relev size queri result combin factor build rank integr merg queri result search engin assum engin return order list refer order correspond document rank result list build tupl refer occur list ffl refer document search engin ffl correspond order refer queri result refer start elimin tupl list tupl lowest gener tupl refer refer document integr rank integr rank determin total number search engin weight factor specifi qualiti search engin weight provid system je je repres number document document base engin je number refer queri result construct final queri result tupl sort document referenc tupl lowest assum futur step raw nice featur express evalu queri disadvantag express structur exploit nice simpl path document mean provid raw model queri list entri raw question domain expand algebra support data model appli futur research answer question point futur research analyz carefulli exist queri languag translat raw raw extend optim issu core algebra approach investig good start point rank integr function evalu compar rank integr function resist design queri languag embrac full featur raw experi rank function found refer serg richard victor vianu foundat addison secret web comm august paul de bra find inform web cwi decemb kevin hector garc andrea paepck boolean queri map heterogen inform sourc ieee transact knowledg data august inktomi cooper hotbot digit equip altavista search hypertext transfer protocol januari lui hector garc ia andrea paepck stanford internet acm sigmod intern confer manag david konopnicki od shmueli queri system web vldb iyer subramanian declar languag queri restructur web proc intern research issu data ride februari alberto georg milo queri world wide web proc pdi decemb marc karl bohm appli flexibl coupl structur document handl proc intern confer data engin page
IR/1457 5 knowledg discoveri definit yve kodratoff lri univ orsai cedex unpublish paper summari paper claim knowledg discoveri text scientif stem knowledg discoveri reli specif definit understand rapidli explor definit appli definit kdt illustr detail kind result kdt show interest result long exist natur languag process research field introduct kdd data mine academ interest dm develop method extract knowledg set data expert interest kdd process data data transfer dm appli dm valid result dm final interpret user process cycl improv critic expert machin learn kdd common strong link acknowledg import induct normal scientif field reluct accept larg common point show acknowledg definit approach exploratori statist essenti kdd extract potenti interest unknown knowledg larg amount data section underlin import express unknown section present opinion person paper author kdt carri treatment natur languag concept develop exemplifi system fact find associ collect text basic differ nlp methodolog make systemat induct reli classic deduct goal main bulk handl larg amount text explor mean kdt analyz structur hidden larg amount order underlin differ knowledg kdd common definit knowledg provid classic scienc tabl summar differ xxx classic scienc kdd theoret valid theoret valid proven understand valid knowledg eleg knowledg defin mdl base deduct reason uncertain valid knowledg repres case eleg knowledg defin adequ user model base induct reason kdd deduct import adequ user induct definit knowledg discoveri text express cover kind text due fashion link word real progress commun natur languag process claim syntact semant inform retriev find text set keyword french ambigu american inform extract fill pattern problem easi part gener kdt call definit give suggest defin kdt scienc discov knowledg knowledg mean kdd section knowledg extract ground real modifi behavior human mechan agent definit introduc kdt problem proper show kdt differ nlp grammat knowledg provid syntact deduct reason nlp process extern kdt discov knowledg mean induct nlp interest induct process xxx past statement strong present nlp research appli ml techniqu nlp nlp ir worth special ir strictli ir find text belong class induct perform order retriev class small amount research perform induct classifi kdt find structur knowledg text stereotyp pattern recogn fill text kdt task invent pattern knowledg understand directli usabl qualifi statist tabl princip compon belong nlp specialist present xxx knowledg tabl transform text start point kdt includ kdt constitut complet kdt system knowledg discov larg amount show kdt aim improv text discov relat hold bodi text xxx obviou ir address problem relat text long strictli deduct consid kdt discov knowledg discov text fulfil knowledg condit discov knowledg give differ rule describ knowledg year miscellan le mond show kind deep understand articl xxx summari tabl specif differ nlp kdt nlp kdt deduct process induct process ir induct research special aim text understand aim text useless understand relat text ir invent relat text exist nlp system provid analysi text variat depend tool problem kdt transform usabl data tool french languag sold compani execut analysi text tabl syntact semant result constitut row column featur text tempor syntact concept semant featur concept order give probabl word instanc met text set thousand paper found year french newspap le select criterion larg order work preliminari perform output kdd tool clementin compani produc rule conclud fact le mond larg speak concept text analyz europ commun conflict europ famili europ woman economi europ set rule express paper insist catastroph concept talk underlin unexpect behavior newspap part world concept strongli evok le mond speak commun interest analysi statist absenc evok concept speak strongli le mond speak north economi notic concept le mond avoid speak significantli absent speak strongli detail analysi understand absent concept absenc show kind knowledg notic kind text amount potenti research enorm definit show kdt differ classic nlp topic industri tool aim inform retriev inform extract exist attempt nlp commun deal kdt defin attempt make full power kdd develop knowledg analysi present follow data nl text express implicit relat compon typic data partli understand machin complet understand inform relat machin usabl format relat implicit data made explicit human inform ambigu depend address human machin unambigu defin set knowledg result process human typic knowledg result complex agent kdd knowledg inform view knowledg complet sharpen differ kdt nlp detail text mine show extract knowledg larg text nlp system compani kdd system clementin isl belong data prepar prepar consist gather text page deal clean file documentari base creat includ index step concaten file larg uniqu gather text deal telecommun execut research call larg select criterion forget potenti interest text creat part shown main window cluster retain lower window show relat term text commerc time text window enlarg relationship upper window show concaten text instanc underlin click window show kind inform click term result window result middl part window show list term text lower part term concept instanc time text upper part show express style du text linguist inform text list term text word compound design entiti text term instanc term discov text express design owner cellular phone creat user firm mr philipp call mr text put univ de st level taxonomi term isa taxonomi fix modifi user order delet add relationship specif user creat taxonomi directli text text displai member class underlin term wrongli acknowledg member class order correct open scenario click miss term instanc class oper repeat systemat note exist taxonomi term primari import tm term constitut featur tabl mine place thousand exist dm system handl tm featur concept relat discov place term term concept present build cluster repres concept interest term made belong class gsm documentari base scenario gener tabl probabl occurr concept text tabl frequenc provid number comput term belong concern concept total clementin transfer data clementin clementin process stream process type featur input output process clementin visual abil concept visual mean associ ignor valu uninterest record valu frequenc gener concept spoken frequenc found equal neg inform web associ graph concept privaci give detail strike relationship discov show director compani studi text concept inform gather human small sampl absolut imposs thousand text easili handl induct learn instanc rule gener call clementin launch apriori set concept discret apriori measur statist apriori result show long list correl absenc concept interest specialist priori confirm screen show measur result apriori accuraci result apriori accuraci work symbol numer input output shown show rule low cover rule carefulli check expert order recogn due clear low coverag link small size sampl conclud accord field input version clementin show set concept causal relationship output field chosen automat gener tree conclud concept conclud accord conclud accord input field plai role tree built coverag expect descriptor causal link descriptor rel high probabl text start intens avoid problem classic text rule discov relev absenc presenc illustr result apriori accuraci result show discret probabl deliv coher data real life start cycl research discret present discuss strike differ kdt nlp kind knowledg kdt yield provid kind knowledg absolut express properti link larg number text analyz refer knowledg discoveri appli softwar product process knowledg acquisit brin motwani ullman tsur itemset count implic rule market basket proc fayyad smyth data mine knowledg fayyad smyth advanc knowledg discoveri data aaai feldman hirsh associ collect machin learn data rs kubat john wilei ny feldman unpublish commun ecml workshop text metric select principl data mine knowledg pp lnai berlin de informatiqu scienc textur klau schmidt inform pp kodratoff bisson epistemolog conceptu journal intellig inform kodratoff organ machin multistrategi volum tecuci michalski page san francisco kodratoff discoveri proc june kodratoff machin learn knowledg discoveri applic knowledg discoveri proc juli ph interact read interpret approach content klau schmidt inform pp partridg case induct ieee comput complet version case induct comput comput intellig softwar pedrycz peter world press searl brain penguin london searl scientif american pp order understand disjunct version workshop machin learn organ lri report universit choic disjunct version space proc intern confer machin saitta pp morgan ca suzuki discoveri reliabl except proc suzuki kodratoff except rule base intens principl data mine knowledg pp lnai berlin june review publish univ po box le netherland
IR/1458 5 reactiv tupl space mobil agent coordin giacomo letizia franco zambonelli dipartimento di scienz di modena modena itali author abstract mobil activ comput entiti introduc peculiar problem coordin distribut applic compon paper survei coordin model mobil agent applic outlin advantag uncoupl coordin model base reactiv blackboard paper present design implement mar coordin tool mobil agent mar defin tupl space program react specif action access made mobil agent mobil reactiv tupl www inform retriev introduct tradit distribut applic design set process static assign execut environ cooper fashion mobil agent defin applic entiti capabl chang execut environ transfer execut shift mobil agent paradigm broadli justifi advantag tradit approach wide distribut applic mobil agent dramat save move local resourc requir transfer possibl larg amount mobil agent carri code manag remot resourc remot avail specif server lead flexibl applic mobil agent requir continu network interact entiti move site connect interact requir network consequ mobil agent paradigm suit mobil comput system system program environ support develop distribut applic base mobil agent open research issu make mobil agent technolog wide program languag coordin effici mobil agent fundament activ coordin agent entiti encount entiti agent resourc host execut environ mobil open scenario impli problem tradit distribut system paper section simpl taxonomi coordin model adopt mobil agent www inform retriev applic case studi show coupl coordin model suit mobil agent applic forc complex design choic fulli uncoupl coordin model adapt suit wide heterogen network scenario lead simpler applic design flexibl safeti stem reactiv coordin model semant interact program meet specif shown section motiv design implement mar agent reactiv section mar base definit tupl space execut environ agent arriv bound tupl space coordin applic agent access local resourc differ raw tupl mar tupl space program local administr agent react specif action access made agent characterist mar grant flexibl mobil agent defin specif state coordin polici enforc secur agent execut reaction exampl testb applic show effect mar approach coordin coordin model mobil agent applic nomad agent coordin activ agent resourc host execut environ applic mobil agent cooper perform task coordin activ mobil agent roam remot site access resourc servic simpl www inform retriev case studi paper agent remot site www page back url page specif keyword agent clone remot link found page interest send clone found continu search work coordin avoid multipl visit agent site common find html execut environ coordin aim defin protocol access retriev inform site coordin model extens studi past mobil open environ introduc problem defin simpl taxonomi coordin model mobil agent survei mobil agent main characterist distinguish coordin spatial tempor coupl spatial coupl coordin model requir involv entiti share common spatial uncoupl model enforc anonym tempor coupl coordin model impli involv tempor uncoupl coordin model achiev asynchron interact categori coordin model deriv figur spatial tempor spatial uncoupl tempor spatial coupl tempor spatial tempor uncoupl direct java agent ara omg event ambit tucson tempor spatial coupl uncoupl coupl uncoupl figur coordin model mobil agent direct coordin direct coordin agent initi commun explicitli involv partner impli case agent commun typic case access host environ coordin occur gener adopt direct coordin model mobil agent applic suitabl repeat interact requir stabl network make commun highli depend network reliabl commun mobil entiti requir complex highli inform rout protocol mobil agent applic dynam dynam agent difficult adopt spatial coupl model commun partner identifi case studi agent agent agent dynam creat depend found link establish commun agent forc activ asynchron autonom presenc wide mobil direct coordin model effect exploit access local local server provid manag agent interact applic local www server suppli html page agent odyssei adopt style typic object exploit agent tcl direct commun base asynchron commun mode coordin agent interact explicitli involv partner interact occur context meet point agent explicitli commun meet abstract role server execut environ activ entiti assum role initi open meet point meet local avoid problem relat commun unpredict delai meet place execut environ local agent particip agent share common knowledg meet event forc join full spatial uncoupl achiev meet model partial solv problem identifi involv drawback enforc strict agent schedul posit agent risk miss interact high testb avoid multipl visit site introduc addit agent visit site agent explor creat agent back user site meet agent forc resid creation agent arriv enter meet meet agent detect site visit solut gener suitabl applic possibl meet agent die agent remain visit site malici agent exploit time site furnish privat inform extern coordin implement ara agent assum role meet server announc meet point host incom agent enter meet coordin concept commun defin omg group appli mobil agent coordin model spatial uncoupl achiev associ meet access object specif agent share refer meet coordin interact occur share data local host agent common repositori store retriev messag agent common messag identifi commun exchang data spatial uncoupl advantag coordin model deriv fulli tempor messag left blackboard receiv read messag suit mobil scenario posit schedul agent monitor grant easili interact forc perform host environ easili control lead execut environ model secur previou coordin applic effect exploit blackboard model coordin agent arriv firstli check local blackboard agent applic agent obtain site charg put messag blackboard regard execut environ blackboard exploit agent retriev inform requir presenc resourc manag local environ provid blackboard data publish protect privat data case studi execut environ form pathnam publicli access file agent retriev pathnam html file messag retriev success select search html file system implement coordin model mobil agent applic ambit recent formal model mobil agent attach read messag blackboard local site agent system defin mobil agent interact agent local resourc host execut environ inform space access http data read extract coordin access local blackboard base associ mechan inform retriev associ mechan associ blackboard tupl enforc full requir tempor agreement mutual knowledg agent coordin associ coordin suit mobil agent applic wide dynam complet updat knowledg host execut environ applic agent difficult imposs agent requir mechan adapt deal dynam worthwhil integr mechan directli coordin simplifi agent program reduc applic complex testb associ mechan agent messag retriev blackboard avoid multipl shown previou applic kind devot search keyword associ mechan agent check blackboard presenc marker messag keyword field match agent ignor messag left agent search keyword regard execut environ pathnam public readabl file agent simpli tupl pathnam match extens concept associ blackboard atop system objectspac abstract mobil agent store associ retriev object agent creat privat objectspac privat interact affect host execut environ ad reactiv tupl space tupl space coordin reactiv stem embodi comput capac tupl space issu specif programm reaction influenc access behaviour tupl space longer mere tupl repositori stateless associ linda state react specif action access made mobil agent reaction access tupl chang content influenc semant agent access reactiv tupl space provid advantag reaction implement specif local polici interact agent host execut achiev control defend integr environ malici agent reaction adapt semant interact specif characterist host simplifi agent program task fix mechan linda reactiv space specif coordin rule achiev clear separ concern algorithm coordin issu applic reactiv blackboard exploit wai administr site decid exploit blackboard reactiv delet messag local left basi maximum lifetim difficulti applic agent marker messag visit site applic agent recal linda model defin disrupt oper extract match tupl malici agent attempt extract html tupl site local administr decid except program local tupl space order transform disrupt oper perform foreign agent read give agent capabl decid coordin instal reaction tupl space visit advantag provid applic direct agent instal visit tupl space reaction deni incom agent access html file page modifi visit coordin area identifi necess ad reactiv raw linda model appli concept mobil agent tucson model defin programm logic tupl centr coordin mobil tupl space defin reaction program logic tupl interest effort area reactiv tupl easili extend support mobil project defin enrich coordin model distribut web applic presenc special agent access space chang content provid capabl influenc coordin activ applic agent reactiv integr coordin model omg commun model object embodi specif polici influenc interact agent involv meet mar system mar agent reactiv develop modena context moon research project implement portabl reactiv coordin architectur mobil agent section describ architectur mar interfac provid java reaction model integr mar sourc code mar implement document implement made moon server week mar architectur mar system conceiv coordin mobil agent applic wide heterogen network assum node network host mobil agent server charg accept execut incom java agent agent move node explicitli migrat mobil agent server refer local tupl agent arriv node figur local server refer stress aim build engin execut goal develop gener portabl coordin architectur java agent mar tupl space coupl agent server bound specif server implement mobil agent ibm aglet odyssei slight extens execut engin refer local space provid incom mobil agent server adopt prototyp packag develop california berkelei similarli agent basic mechan agent execut mobil mobil agent java thread move site site explicit stationari hall server implement mobil agent server choic driven fast environ easi document make full sourc code agent bound local tupl access extract put tupl figur permit retriev tupl associ primit data item refer object repres host environ resourc tupl space exploit commun local tupl space resourc agent access problem dynam bind local refer mobil entiti limit mar mar defin reactiv tupl space model effect oper tupl space dynam modifi agent access tupl space basic set oper specif reaction access tupl space made mobil agent figur section tupl space introduc associ manag reaction tupl space tupl space internet refer local tupl space reaction network node java agent server figur mar architectur repres mobil mar interfac mar tupl object repres order set type field defin tupl deriv class entri class defin basic tupl instanc specif tupl field order field valu pass paramet class constructor defin order field tupl object repres primit data type object java field tupl defin null tupl space realiz java instanc space implement interfac agent access tupl space adopt interfac extend javaspac specif commerci specif de facto standard tupl space interfac java public interfac mar extend javaspac method interfac inherit javaspac void transact ident put tupl space entri transact ident read tupl space entri transact ident extract tupl space method ad mar vector transact ident read tupl space vector transact ident extract tupl space figur mar interfac javaspac interfac defin oper access tupl space put suppli retriev tupl basi request tupl suppli paramet pattern match work read oper extract match tupl space addit tupl transact paramet specifi characterist read oper block oper find match tupl return null ident paramet specifi oper identif secur mar interfac add oper give capabl retriev tupl match tupl suppli match javaspac read oper request tupl suppli read oper defin null valu tupl space match request tupl defin valu equal file local file system repres tupl type string date file request tupl match tupl request tupl match tupl javaspac tupl object element tupl match rule account presenc class object request tupl tupl javaspac specif introduc addit class repres tupl serial form invok oper access tupl javaspac requir paramet pass serial form sake disregard peculiar specif match condit instanc ts class javaspac extend linda model permit match tupl provid belong class defin field repres primit type respect field defin field equal serial form respect recal java object assum serial form instanc variabl equal includ null correspond null tupl obtain actual field object access java object reactiv model unlik mar permit associ programm reaction event tupl tupl space access perform agent reaction state object singl method access tupl space chang influenc semant oper perform agent compon consid associ reaction tupl item oper type agent ident associ reaction access event repres reaction method reaction object execut agent ident invok oper tupl match associ reaction tupl dealt tupl result tupl space associ mechan tupl space ple associ reaction access match specifi associ reaction read disregard peculiar tupl type content agent ident associ reaction specif tupl class put extract tupl tupl space provid instal reaction event tupl space tupl space mechan activ access tupl space check presenc reaction execut agent ident invok retriev read oper suppli request tupl mar system execut issu pattern match mechan tupl space identifi tupl match match tupl execut read tupl space provid request tupl match issu tupl check presenc match match reaction execut result return invok agent case write search perform find reaction match perform write oper reaction access tupl space perform kind oper exploit tupl space repositori reaction state addit reaction object state behavior reaction depend actual content tupl space past access event avail result match mechan issu oper reaction influenc semant oper return invok agent tupl result stateless match mechan aspect model fulli investig relat agent authent tupl space access grant javaspac specif defin simpl identif mechan access control enforc control access space capabl program tupl space possibl reaction access modifi tupl space introduc secur issu system manag site fulli program local reactiv tupl space shown section great flexibl provid agent instal lead programm coordin polici mobil agent applic evalu extent agent instal reaction remot server access tupl restrict reaction access modifi content tupl space mar case studi applic section show exploit mar system implement reaction present www inform retriev applic local execut environ provid access html page tupl identifi file gener dimens modif refer file object access content file tupl instanc code shown figur agent node html page obtain refer access tupl space explor agent applic retriev html file node invok oper mode avoid indefinit block case local site avoid oper tupl space perform code reaction issu reaction wrt state evalu safer tupl space repositori state inform provid html oper suppli request tupl extens field defin return match tupl repres html vector element agent access html page file search keyword interest content fragment java code applic agent shown figur class extend entri entri root class tupl hierarchi object field string pathnam file repres tupl string repres file type date date updat file file file object access content file constructor tupl order paramet defin tupl field order public string date file pathnam extens figur class tupl repres file tupl space creation request tupl vector read match tupl return vector tupl refer match tupl found agent return user termin tupl file search keyword file store file privat vector search link clone figur code search agent enforc safeti tupl space local tupl file manag local system manag full access decid deni foreign agent extract tupl repres local file malici agent perform oper tupl system administr decid except unauthor oper agent read content match tupl delet administr instal reaction transform oper perform foreign read oper reaction record bad attempt system regist java code simpl stateless reaction class shown figur class implement reactiv public entri oper ident paramet refer local tupl refer match oper type ident agent perform oper check identifi agent perform oper return tupl delet space administr full log access return tupl return delet space figur reaction class avoid duplic search avoid multipl visit coordin agent instal reaction tupl applic agent instal state reaction simpli avoid retriev duplic account updat html page agent access tupl space retriev refer html reaction check match tupl file modifi visit applic agent file tupl return agent code figur show reaction class case state reaction store instanc variabl reaction object store tupl tupl space class implement reactiv privat date date visit public constructor visit reaction instal date visit automat set constructor public entri entri oper ident document modifi return tupl return visit set time visit return return tupl repres updat page figur reaction class work progress coordin model forc form strict coupl interact entiti suitabl develop wide distribut applic base mobil agent paper show context www inform retriev coordin model prefer capac enforc anonym asynchron interact addit capabl embodi programm reactiv coordin model permit tune semant interact lead flexibl secur coordin paper show design implement mar aim defin gener coordin architectur base reactiv tupl space coordin mobil agent applic extend mar integr mar tupl space encapsul http proxi monitor program tupl space simpl easili access www interfac time simpl www interfac instal remov integr mobil agent server http proxi server lead gener framework execut distribut interact www applic base mobil agent import issu investig relat secur aim defin extent agent program remot tupl space feasibl agent freeli distribut reaction remot site capabl agent instal reaction provid flexibl adapt requir mobil agent applic refer languag resourc awar mobil mobil object lectur note comput springer verlag pp februari coordin model ieee vol april pp concept mobil st intern workshop mobil berlin lectur note comput pp commun vol pp model languag softwar acm comput vol pp june ciancarini passiv page coordin agent intern symposium autonom decentr pp coordin commun java lectur note comput pp mobil code mobil object lectur note comput pp februari express power languag programm coordin acm symposium appli atlanta feb agent interact heterogen intern workshop mobil lectur note comput april pp languag commun vol feb pp gener magic www flexibl secur mark mark roseman fourth annual workshop juli dg comput aglet workbench program mobil agent ibm corpor white septemb st intern workshop mobil berlin lectur note comput april moon home object lectur note comput springer verlag februari object manag object servic volum march coordin model mobil submit feb author architectur ara platform mobil st intern workshop mobil berlin lectur note comput pp april remot ieee transact softwar vol pp juli javaspac sun june waldo note distribut mobil object lectur note comput springer verlag pp februari interact power commun vol pp
AI/1459 2 linkop electron articl comput inform scienc vol nr linkop electron press sweden dynam logic program jose julio alfer lui moniz pereira przymusinska teodor przymusinski publish decemb linkop electron press sweden linkop electron articl comput inform scienc issn seri erik jj przymusinski typeset author format style recommend linkop electron articl comput inform vol nr decemb url link author home page publish articl internet replac network period year date bar except circumst separ avail articl impli perman permiss read articl print singl copi unchang research educ includ make copi classroom permiss revok subsequ transfer copyright articl condit consent copyright owner public articl date state includ product limit number copi archiv swedish librari written work publish sweden publish technic administr measur assur version articl perman access url state perman equal archiv print copi expir public period addit inform linkop electron press procedur public assur document refer www home convent mail address state paper investig updat knowledg base repres logic program order repres neg gener logic program default negat bodi head start introduc notion updat logic program logic program provid semant studi basic properti program updat show updat program gener notion interpret updat extend notion sequenc logic program updat defin dynam program introduc paradigm dynam logic program paradigm significantli facilit modular logic modular reason set logic program describ state knowledg world state repres time point set prioriti viewpoint program modul mutual contradictori overlap inform role dynam program updat mutual relationship exist state declar procedur semant combin result modul present address jose julio dep univ ai univ nova de mont da portug ai univ nova de mont da portug lui moniz ai univ nova de mont da portug depart comput california state polytechn ca usa teodor depart comput ca usa logic nonmonoton updat introduct work field logic program repres static world world chang drawback attempt deal knowledg base repres dynam world mean logic extent part program part chang paper investig updat knowledg base repres logic program order repres neg gener logic program default negat bodi head order atom delet logic program updat mere insert delet fact author address issu updat logic program call origin knowledg base db consid updat knowledg base db set model coincid set individu updat model db approach reduc issu knowledg base updat issu find updat individu interpret order determin updat interpret typic chang statu liter affect updat rule liter intact inertia approach justifi part knowledg base individu lead strongli counterintuit result part program undergo chang logic program sleep tv tv watch tv tv stabl model watch updat state power failur power failur tv longer repres logic tv power failur power failur mention approach obtain watch updat power watch tv order satisfi updat add delet inspect initi program updat argu true remov make default expect true intend model updat model updat logic power failur state power back expect tv power rule tv power effect truth obtain rule illustr updat insuffici truth liter figur head rule truth rule bodi affect updat liter approach adopt author advoc principl inertia appli rule initi program individu liter model transform initi program updat produc updat program present import transform fall short exact model updat shown initi program stabl model updat program fnot tv tv ong ong fg model updat program consist result updat updat case ong accept note violat desir principl minim chang paper defin program updat properli extend model updat introduc reformul languag logic program initi program set fact program updat model updat coincid extend notion updat sequenc defin dynam program updat set program modul describ state knowledg world state repres time period set prioriti viewpoint role dynam program updat mutual relationship exist state form order declar procedur semant combin modul mean world increment subject success program updat occur state world section defin languag gener logic program default negat describ stabl model semant special case approach restrict languag section defin program updat semant section elabor properti section section dynam program updat set notion support import paradigm dynam logic program tradit logic program concern static show success updat knowledg gener form logic program show updat program process iter gener logic program stabl model order program updat program neg logic program default negat head call program gener logic program class differ class program call strong negat section describ notat extend stabl model semant normal program gener logic program order syntact repres gener logic program proposit proposit languag includ proposit variabl form arbitrari set proposit symbol begin proposit languag lk gener set languag set proposit variabl consist fa kg fnot atom call object atom atom call default atom definit set disjoint arbitrari set proposit symbol lk languag gener interpret lk set atom lk satisfi condit atom belong forthcom paper extend result model logic model fa mg fnot mg gener logic program languag lk finit infinit set proposit horn atom lk atom head object logic program normal syntact standpoint logic program simpli view proposit horn theori semant significantli differ semant classic proposit theori determin class stabl model defin definit model gener logic interpret lk stabl model gener logic program model horn theori fl atom lg assum program stabl model dg stabl simpli observ fnot interpret fnot dg stabl model fnot proposit easili definit stabl model proposit class stabl model gener logic program extend class stabl model normal program program updat arbitrari set proposit gener logic program languag lk denot superset fa kg fa kg definit assum origin set proposit variabl newli ad symbol form au disjoint set symbol symbol renam place denot extens languag lk gener definit program gener program languag lp call origin program updat program updat gener logic program consist extend languag rewritten origin program bm bm bm bm origin program rewritten updat program au bm bm bm bm updat program updat au object atom updat rule state atom true true updat program inherit au object atom inherit rule atom inherit origin program provid forc updat program default au object atom default rule state atom true origin program updat program atom assum default ensur true easi show model true iff stabl model satisfi constraint simpli regard default negat program sleep tv tv power failur watch tv tv power failur tv updat program program logic program rp sleep tv rp tv power failur watch tv tv power failur tv stabl model irrelev semant program updat section provid complet semant updat program describ stabl model updat program show semant updat program depend syntax semant program begin defin natur extens arbitrari interpret languag interpret extend languag definit interpret denot extens interpret extend languag atom iff iff exist bodi bodi iff exist bodi bodi au iff exist bodi bodi iff exist bodi definit interpret model fnot bodi fa bodi bodi bodi fnot bodi bodi bodi set default negat unsupport atom negat unsupport atom assum default set repres set origin program reject updat program model residu consist union program reject updat program give descript semant updat program provid complet stabl model theorem stabl model updat interpret languag stabl model updat extens model satisfi program sleep tv tv power failur watch tv tv power failur tv fnot watch sleep tv watch tv tv tv power failur power failur easi properti program updat section studi basic properti program updat conclud condit impli immedi proposit stabl model restrict stabl model condit stabl model complet determin set atom set negat unsupport atom assum default stabl model proposit stabl model union program extens stabl model updat program semant updat program weaker equal semant union program result hold union contradictori program stabl model program trivial contradictori empti stabl model stabl model proposit empti stabl model iff stabl model semant updat program coincid semant union proposit normal program negat atom stabl model iff stabl model case semant updat program coincid semant union program program updat gener interpret updat interpret origin introduc marek truszczynski subsequ simpler przymusinski turner constitut special case program updat identifi introduc standard gener logic program theorem updat gener interpret interpret updat program languag denot gener logic program fa ig fnot ig stabl model program updat program program iff interpret updat remark easi includ posit rule program make normal program interpret updat program fnot tv tv ong stabl model ong correspond interpret updat ad strong negat show repres strong negat gener logic program show class gener logic program broader class logic program strong negat updat logic program strong negat strong negat updat program definit strong arbitrari set proposit variabl order add strong negat languag lk augment set proposit symbol obtain set extend languag lk order ensur true strong negat gener logic program remark order prevent strong negat rule inadvert overrul updat program make part current updat program dynam program updat section notion dynam program updat sg order set sg program import gener notion program updat idea dynam inspir simpl fundament set program modul index state world program knowledg true state state repres time period set prioriti viewpoint individu program modul mutual contradictori overlap inform role dynam program updat fp sg mutual relationship exist state form order state declar procedur semant combin modul notion dynam program updat support import paradigm dynam logic program individu larg independ program modul describ knowledg state world knowledg acquir dynam program updat fp specifi exact mean union program dynam program significantli facilit modular logic program modular reason fp sg finit infinit sequenc gener logic program languag lk index set call element set state refer initi state remark linear sequenc state finit infinit order set smallest element properti state predecessor finit finit infinit tree root properti node finit number ancestor denot superset set proposit fa kg fa fa ps ps denot extens languag lk gener definit program dynam program updat sequenc updat program fp sg logic program consist extend languag rewritten program ps bm ps bm bm bm program updat ps ps object atom inherit ps ps object atom default rule initi state object atom default rule describ initi state make object atom initi remark observ dynam program updat normal logic default negat head inherit rule default negat bodi note program atom head atom bodi rewritten program definit program updat fix state dynam program updat state denot dynam program updat augment current state object atom current state rule current state updat program consid notion dynam program updat gener introduc notion updat program theorem arbitrari gener logic dynam program updat fp state semant program updat fp order set program sleep tv tv power failur watch tv tv power failur tv power failur dynam program updat logic program rp sleep tv rp tv power failur watch tv tv power failur tv rp power failur dynam program updat state singl stabl model watch singl stabl model power singl stabl model watch model modulo irrelev notic futur work weve defin program transform logic program produc logic program result updat program weve semant program updat present properti gener result weve shown special case initi program set program updat coincid justifi initi program program updat rule remain valid reject weve shown strong negat easili incorpor gener logic encompass updat dynam program weve extend program updat order set logic program order interpret time dynam program updat describ evolut logic program subject sequenc modif open possibl increment design evolut logic program weve call dynam logic dynam program significantli facilit modular logic program reason applic dynam logic program intend evolut mainten softwar specif logic program specif dynam program mean describ evolut softwar specif order set program modul necessarili evolut time logic program modul repres set viewpoint agent case dynam program updat specifi exact mean merg prioriti respect intend compar dynam logic program approach prefer knowledg explor dynam program updat queri current state state modul viewpoint truth read true agent situat knowledg agent result approach gener updat program semant present work implement case queri approach program updat grown research reason logic program envisag enrich dynam program featur abduct contradict remov applic intend studi includ model product reason tempor refer pereira updat program pereira select paper ws vol page pereira przymusinski strong explicit negat reason logic program pereira jelia volum page gelfond lifschitz stabl model semant logic program kowalski bowen editor int conf page mit gelfond lifschitz logic program classic negat warren int conf page mit mendelzon differ updat knowledg base jame richard fike erik principl knowledg proc intl conf page morgan kaufmann logic program updat msc universidad nova de pereira gener model program workshop logic program knowledg port octob lifschitz woo answer set gener nonmonoton reason rich principl knowledg implement proc intl conf page truszczynski specif mean program pearc jelia volum page przymusinski turner updat mean infer rule lpnmr volum page winslett reason action model approach page
Agents/1460 1 architectur conflict intent desir jan huang van der torr mathemat comput scienc vrije universiteit de boelelaan hv amsterdam abstract paper introduc architectur feedback loop ect action commit mechan resolv con ict output compon agent type realist social agent correspond speci type con ict resolut architectur introduct compet model autonom agent unclear type model type applic model base plan variant theori qualit theori model base cognit model model model base social concept oblig norm deontic action program model base attempt reach satisfi ful ll oblig model agent overload typic live complex noisi environ main problem reach satisfi desir ful ll desir oblig follow belief intent main problem resolv con ict attitud paper agent architectur compon compon output intent desir repres condit inform motiv attitud con ict output resolv architectur control loop permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee canada copyright acm separ select compon output intent agent type repres control loop realist agent belief overrid intent stabl agent intent overrid desir unstabl agent desir oblig overrid sel sh agent desir overrid oblig social agent oblig overrid desir con ict extens extens select idea adopt thomason logic base reiter default logic repres ect action commit architectur base feedback explain detail paper dignum implement architectur discuss paper content inform motiv attitud repres proposit formula simplest compon input set formula call extens output full input output set extens resolv type con ict add compon select extens output input plan compon paper focu implement architectur logic discuss detail focu singl autonom agent agent import repres implicitli norm social commit convent coordin joint plan trust cooper competit scope paper awar compel deal larg agent futur research layout paper section di erent type con ict discuss classi cation agent type introduc section control loop introduc section exampl section formal architectur implement detail discuss desir reason intent desir discuss practic reason philosophi formal build intellig autonom agent recent discuss qualit make arti cial intellig closer inspect concept consist relat knowledg prohibit commit concept group class due role make belief inform attitud world expect oblig desir extern intern motiv intent result make section focu interact class discuss fteen type con ict occur discuss di erent type agent resolv con ict di erent discuss problem relat con ict resolut section background understand choic made present section concept belief desir inform motiv attitud relat structur model make relat probabl util classic theori interpret belief desir inspir bd logic thomason interpret intent introduc relat previou philosoph literatur bratman intent deserv special statu belief reduc special statu central focu comput bdi approach cohen levesqu rao georg prior intent action agent commit previou incorpor intent make agent behavior stabl make bound reason account oblig controversi compon architectur reason introduc compon incorpor norm commit social agent social ration argument research deontic logic comput scienc question norm implement explicitli comput system easi answer comput program model behavior violat fail object counter dignum argument oblig agent autonom typic agent desir desir stronger oblig social agent violat oblig intend earlier reconsid intent exampl case order deal con ict agent drop oblig favor conflict main task delib agent solv con ict inform motiv attitud subsect list fteen di erent type con ict class class depend exact interpret con ict type interest import distinguish gener type con intern extern con ict intern con ict compon extern con ict intern con ict distinguish unari subtyp con reason light daughter turn reason light time con obligatori honest obligatori polit honest con intend nish paper sundai intend beach saturdai beach nish paper sundai con desir smoke desir healthi smoke endang health extern con ict distinguish binari ict subtyp bi bd od ternari con ict type quadrupl con ict type bo con obligatori weekend time bi con plan weekend imposs car broken bd con id long vacat id time work long vacat time work oi con obligatori weekend plan confer od con obligatori smoke area desir smoke oc ce area id con id intend catch plane boi con smoke smoke area intend smoke area con smoke smoke area desir smoke area bid con intend confer desir travel cost travel cost oid con intend confer desir stai luxuri hotel obligatori stai luxuri hotel con intend confer obligatori spend monei confer pai cheap ight ticket stai pai ight ticket stai budget hotel desir stai hotel secretari book ight ticket subsect structur resolut con ict type classi cation con ict resolut type introduc discuss argu type con ict resolut correspond agent theori call agent type agent type sel agent conflict resolut agent type con ict resolut type order overrul order overrul order belief compon overrul motiv attitud compon reduc number overrul order exampl con ict resolut belief con ict belief prior intent mean intend action longer execut due chang environ belief overrul prior retract deriv consequ prior intent retract prior intent overrul result unrealist behavior con ict belief oblig desir mean violat occur observ thomason belief overrid desir argument appli oblig con ict prior intent oblig desir mean intend prior intent overrid properti intent bring stabil call intent con ict resolv intend cinema oblig visit cinema reconsid intent order string letter overrul wai resolv con ict repres note overload type agent gener agent architectur realist con ict resolut type belief overrid compon call realist call prior intent overrul desir oblig sel sh call sel desir overrul oblig social bodi call oblig overrul desir classi cation call agent sh sel sh social mean sh agent start bd bo partial priorit constraint exampl discuss section con ict resolv prioriti order minim condit complic complic implement con ict type agent type approach con ict resolut develop area arti cial intellig diagnosi default reason fusion knowledg problem exact de nition con approach con ict de ned minim set con ict set strict subset minim set obviou choic diagnosi problemat make condit dignum discuss extens bdi architectur oblig gui call al oblig perform task bob incompat oblig perform task chri al norm bob intend meet oblig problem discuss paper exist norm ect al intend ful ll al oblig commit meet oblig bob potenti signi impact task bob imagin task trivial direct consequ task social consequ inform bob high al perceiv point resolv con ict restrict minim set set agent ect action commit reason architectur discuss complet extens construct solv con ict encount agent architectur section discuss architectur rst discuss case con ict resolv agent exampl section build singl set formula singl extens discuss full cover complex case section architectur calcul multipl extens output compon introduc addit compon select nal repres agent intent compon agent black box observ input intend action relat environ detector ector architectur attitud map compon agent compon output attitud compon attitud implement varieti di erent wai belief compon maxim cross entropi appli belief output probabl set plausibl belief desir compon base quantit model maxim expect util determin goal oblig intent compon reason person social oblig commit select goal plan reach select goal architectur discuss behavior compon speci ed proposit logic form rule input output compon repres set logic close logic consequ thomason call extens distinguish agent static architectur dynam behavior concern agent concern agent environ singl extens start architectur build extens logic speci es behavior architectur order function resolv con ict constraint order deriv step di erent compon undertaken type rst discuss agent type nalli dynam control loop determin interact environ logic calcul scheme calcul start set observ unlik normal default observ overridden assum initi set rule write set prior intent rst de ne order function rule repres type agent case multipl applic lowest appli version assign uniqu rule resolv con ict rule compon calcul build extens de ned definit calcul proposit tupl di theori subset set order pair written function integ rule applic extens de ne fw applic applic extens practic extens calcul architectur set output set rule calcul agent run resourc agent type start observ calcul belief extens iter appli belief rule belief rule applic base agent type con ict resolut compon chosen applic rule select appli rule chosen compon appli belief compon attend belief rule appli rule chosen compon base agent type compon chosen rule compon process termin xed point reach extens calcul calcul scheme de nition approach mean construct definit mutual set rule prior set agent type de ned function assign uniqu integ rule note assign uniqu valu rule compon valu rule compon smaller greater valu rule compon agent type section social stabl agent sel sh agent social agent sel sh agent special architectur agent architectur speci es compon inform ow combin calcul scheme agent type induc agent architectur social agent de ned agent type induc architectur illustr figur interpret compon receiv input extens gener output extens input output extens ident rule output extens ow ow back feedback loop initi extens base set empti belief rule appli feedback loop compon belief rule calcul extens compon prior intent appli extens back compon feedback loop extens ob act figur social simpl mind gener architectur realist agent type share belief compon overrul compon order compon appli depend paramet mean consid paramet underli logic extens gener agent architectur agent type addit plan process plai import role plan decid action perform order achiev intent repres calcul extens addit compon ad determin action perform input plan compon output set action schedul perform result gener agent architectur illustr figur architectur interpret output extens compon di er input ow back feedback ow access compon determin function control loop con gure dynam environ receiv input calcul decid action updat start observ environ agent type order process de ne control loop determin behavior agent ob act figur architectur dynam environ control loop written set repeat calcul plan forev note extens calcul part control loop complex process explain de nition multipl extens account gener subsect multipl extens calcul set extens singl extens reason multipl extens larger set discuss section exampl discuss section exampl discuss section lead multipl extens agent type speci discuss agent type rx base de nition agent type introduc previou section de ned function properti agent agent sh agent sh agent function ned induc agent architectur illustr figur extens gener compon back compon feedback loop desir rule successfulli appli compon compon choic sh agent oi con ict obligatori intent confer sel sh agent resolv con ict automat decid ob act figur sh calcul scheme order calcul multipl control loop adapt function assign uniqu number rule compon rule appli stage extens calcul definit calcul di theori agent type function de ne applic applic extens extens select addit call intent compon ad result architectur illustr figur compon select extens calcul set extens send plan compon oi con ict model interact plan compon compon assum order input extens extens select strategi select send extens plan compon reason select extens translat feasibl compon send extens plan compon ob act figur multipl extens updat compon control loop modi ed speci updat base fact select extens form prior intent round updat compon updat base select extens note compon order input extens base extens select strategi drawback agent act extens select chose select extens select select desir minim con ict select maxim minim select extens select extens larger intersect extens import issu address studi extens extens decid con ict belief simpli make check world belief true lead problem plan partial observ oracl test proposit extens practic add mathemat structur prioriti priorit rule logic complex due option associ loss gain rule line research interest problem issu extens select left research implement exampl idea architectur compon implement mechan produc behavior descript assum compon simpl product rule assumpt crucial prolog prototyp found implement prototyp exampl section di erent agent behavior exampl expect sourc code found made implement choic compon implement product rule form index variabl situat model formula proposit consequ disjunct rule disjunct consequ replac rule disjunct uncondit intent oblig repres rule true extens repres set atom formula negat atom formula order test rule appli rule broken liter part de morgan part check sati extens rule consequ rule broken liter ad extens version implement rst implement simpl priorit product iter loop rule applic current con ict set select rule minim con ict set appli select rule result extens loop repeat applic rule xed point reach assign uniqu prioriti singl extens result implement approxim version make explicit prioriti rank compon section type belief compon intent feed back result compon rule time feed back result compon rule time feed back result compon con ict rule compon solv order applic prolog produc di erent extens similar partial agent type dealt produc altern extens altern wai implement prototyp make standard priorit mechan deal con ict product system suitabl implement clip expert system fast rete algorithm match applic rule design knowledg engin cluster rule compon select priorit mechan base desir agent type exampl illustr con ict attitud solv architectur control loop work exampl present section binari bd con ict introduc thomason repres true true observ realist agent empti rst deriv belief result extens input desir compon nal result remain agent hand produc nal result agent su er complex quadrupl con ict section repres true monei cheap hotel monei hotel true confer true examin social simpl mind type input agent empti control rst deriv belief result ticket social oblig rule appli rst result intermedi ticket extens fed back compon trigger rule applic ticket produc nal cheap ticket sel sh agent type appli result nal ticket note send result back belief compon make di erenc relat research previou theoret research neglect show implement provid theoret provid architectur includ control procedur style rao georg bdi interpret extend bdi oblig con ict resolut thomason desir plan capabl model wide rang practic serv gener exibl model agent architectur thomason approach explicitli de ned desir overrid approach determin control loop detail comparison found dignum altern extens bdi oblig base extens bdi interpret potenti action reason ect conclud remark discuss con ict type inform motiv attitud explain con ict resolv architectur resolut con ict base thomason idea implement architectur order deriv di erent type attitud shown order deriv determin type agent deriv desir belief produc agent deriv oblig desir produc agent order deriv identifi di erent type agent import ingredi architectur presenc feedback loop feedback loop deriv desir intent back input feedback input trigger desir intent oblig assist neighbor induc oblig desir induc belief pain result desir pain result issu research method extens select relat plan schedul intent immedi realiz futur uenc schedul intent present version prior intent back feedback loop intent overridden motiv attitud earli deriv intent remov schedul plan note ad schedul plan compon architectur give rise delai stimulu respond earlier observ stimulu agent intend vacat receiv inform mother law hospit visit visit return intent vacat opinion gap architectur underli logic smaller larg gap modal bdi logic bdi architectur present architectur benchmark exampl materi close gap theori practic agent design refer makinson logic theori partial meet contract function journal symbol bell huang dynam goal hierarchi cavedon intellig agent theoret practic lnai page boutili logic qualit theori page bratman practic reason harvard cambridg van der torr treur delib norm principl architectur cohen levesqu intent choic commit arti cial van der torr dynam desir workshop approach agenc van der torr bdi comparison base classic theori aaai spring symposium dignum autonom agent norm arti cial intellig cavedon social sophist bdi agent icma page pick heterogen activ agent semant arti cial forgi fast algorithm object pattern match problem arti cial jone sergot law comput norm system perspect deontic logic comput norm system speci pearl condit qualit theori page rao georg model ration agent bdi architectur rao georg abstract architectur ration agent rao georg bdi theori practic intern confer system reiter logic default reason arti cial reiter theori diagnosi rst principl arti cial thomason desir default morgan van der torr tan reason dyadic oblig annal mathemat arti cial van der torr tan diagnosi make norm reason arti cial intellig von wright practic reason basil
DB/1461 3 semant xml dtd text data mine techniqu abstract unstructur document textual archiv public patient record annual report share inher structur order facilit search archiv enabl inform integr text collect relat data inher structur made explicit detail infer semant structur xml document type definit archiv subsequ transform text xml document success method achiev object main contribut paper method deriv structur xml dtd order extend deriv flat dtd framework deriv unstructur xml dtd compon support larg number document xml tag preliminari dtd priori assum mandatori fix order xml tag automat tag archiv deriv dtd implic tag error introduc notion probabilist xml dtd compon assign probabl semant structur correct method establish probabilist xml dtd base discov associ resp frequent sequenc xml tag keyword semant dtd knowledg data cluster introduct organ cope huge amount text document tan point inform store unstructur textual document captur interest action knowledg textual major challeng data mine commun creat semant markup form provid explicit knowledg text archiv facilit search enabl inform integr work author fund german research societi grant sp winkler £ spiliopoul leipzig graduat school manag depart germani relat data sourc user manual creat metadata due effort cost involv text mine techniqu requir automat creat semant markup tag document present kdd approach pursu research project german acronym stand integr legaci system structur document mean data mine goal semant tag textual content facilit identif integr text relat data aim deriv structur xml dtd serv document collect enabl provis queri servic textual data text collect vocabulari syntax frequent share structur framework semant tag domainspecif text introduc appli workbench text archiv result collect semant tag xml document extract unstructur xml dtd ultim aim integr result xml document relat data sourc deriv preliminari dtd transform structur dtd reflect order option tag xml tag deriv data mine techniqu iter cluster explain section crisp due tag error critic fact introduc notion probabilist dtd describ order xml tag statist properti tag structur dtd basi futur inform integr effort involv xml archiv gener workbench introduc algorithm infer probabilist dtd util associ rule discoveri algorithm sequenc mine techniqu rest paper organ system der von und da von und eur gesellschaft mit der ist und ist zum die der gesellschaft im tabl xml document annot commerci regist entri section briefli discuss relat work section overview framework semant tag domainspecif text collect section introduc notion probabilist dtd textual archiv develop method deriv conclud give direct futur research section relat work moonei combin method kdd inform extract perform text mine task appli standard kdd techniqu collect structur record featur text feldman al text mine term level linguist tag word author repres document set term construct taxonomi term result dataset input kdd algorithm associ rule discoveri framework adopt idea repres text term concept goal semant tag structur text unit sentenc document global dtd entir content loh al suggest extract concept individu word subsequ kdd effort document level similarli author suggest exploit exist vocabulari thesauri concept extract describ workbench acquir domain knowledg text similar approach combin method field research unifi framework approach share research thread object extract semant concept text concept extract serv element xml dtd discov concept peculiar singl text unit suffici perfectli reflect content order deriv discov group text unit share semant concept concentr significantli differ averag text respect word frequenc statist collect process standard text mine softwar integr relev domain knowledg prerequisit success knowledg discoveri research activ aim transform text semant annot xml becker al introduc search engin ess support queri process text deriv process xml text abstract abstract summari text separ origin text provid semant text intact process visual linguist applic domain dtd content document infer content order transform exist content xml method infer dtd tag document input method tag plain text document deriv dtd closer approach work keyword rule convert legaci data xml document approach reli establish rule base drive kdd methodolog reduc human effort data topic relat research commun lot effort recent put method infer repres structur similar document approach deriv schema set document simultan solv problem text document semant tag infer appropri structur xml dtd describ relat archiv awar scientif commerci approach emploi probabilist document type definit introduc paper describ text archiv integr text relat data sourc framework notion semant tag refer activ annot text xml tag addit attribut classifi entir document tag singl aim semant tag text unit sentenc paragraph tabl illustr concept semant sentenc german commerci regist entri text unit semant sentenc made explicit xml tag partli addit attribut describ extract entiti person amount xml document depict tabl creat appli framework collect textual commerci regist entri text unit collect includ entri relat foundat compani district german citi compani oblig law submit inform busi affair local commerci regist commerci regist import sourc inform daili busi textual content search queri moment semant textual archiv basi inform integr creation servic relat inform brokerag xml queri languag emploi submit queri semant tag xml archiv framework pursu object archiv text text document semant tag preliminari flat xml dtd deriv archiv semant tag dem process design knowledg discoveri textual process constitut phase order build cluster semant similar text tag document xml result deriv xml dtd describ archiv kdt process introduc result final set cluster label serv xml tag dtd element huge amount document convert xml document product phase framework text unit document cluster built text unit cluster subsequ tag cluster label concentr semant tag similar text document origin common domain approach semant tag kind archiv public announc court administr quarterli annual report textual patient record health care applic product servic descript publish electron marketplac text document entiti text unit cluster accept cluster xml document type definit person date corpor place currenc uml schema thesauru entiti descript nlp preprocess creation text unit extract replac entiti select featur unit map text unit featur vector set paramet execut algorithm evalu cluster qualiti cluster inspect unaccept cluster refin cluster semant label accept cluster xml tag text unit creation dtd xml document xml document figur iter interact kdt process remaind briefli introduc phase framework iter interact kdt process depict figur process term cluster algorithm invok repeatedli notion iter cluster fact cluster algorithm perform multipl pass data converg process knowledg engin consult cluster evalu final cluster end iter initi text document domain knowledg constitut input kdt thesauru taxonomi term preliminari uml schema domain descript specif entiti person compani uml schema reflect semant entiti relationship initi conceiv applic expert schema serv refer dtd deriv discov semant owner tabl preliminari unstructur xml dtd commerci regist entri final dtd schema similarli convent kdd process start preprocess set level granular determin size text unit workbench perform basic nlp preprocess normal word stem remov stop establish drastic reduc featur space select limit set term concept text unit thesauru uml schema text unit descriptor chosen knowledg engin reflect import concept applic domain text unit map boolean vector featur space entiti interest extract text unit separ modul workbench case creat small thesauru select relev descriptor point descriptor pattern discoveri text unit vector initi archiv cluster base similar content object discov homogen text unit cluster cluster perform multipl iter iter output set workbench partit qualiti criteria cluster text unit vector cardin larg text unit homogen semant small number text unit descriptor member cluster subsequ remov dataset remain text unit vector input data cluster algorithm iter cluster similar threshold cluster progress specif content process base concept execut cluster algorithm workbench case emploi demograph cluster function includ ibm intellig miner data maxim criterion workbench discov altogeth cluster approx text unit phase consist label cluster assign label cluster label determin knowledg engin workbench perform rank candid cluster label expert default cluster label deriv featur space dimens text unit prevail cluster cluster label correspond xml tag subsequ annot cluster member origin document tag valid xml tag xml tag enhanc attribut reflect extract entiti valu tabl excerpt unstructur xml dtd automat deriv xml tag case studi describ semant structur result xml collect entiti serv addit attribut xml tag fulli evalu workbench establish probabilist dtd output workbench set semant xml tag xml tag describ content archiv document reflect content archiv abstract essenti tag dtd semant annot deriv data mine crisp essenti valid tag express quantit term estim properli order tag deriv semant xml combin probabilist dtd deriv order tag comput statist properti tag insid document type definit reader recal semant annot label cluster discov workbench underli cluster mechan produc nonoverlap cluster impli text unit belong effect annot label cluster deriv workbench nest extens workbench hierarch cluster algorithm establish subclust nest label plan futur work object dtd establish method specif order identif correl mutual tag adorn tag correl tag statist properti properti form basi reliabl queri determin expect recal queri result introduc statist properti dtd tag associ describ methodolog comput statist model complet statist inform pertin tag hypergraph structur introduc mechan deriv probabilist dtd graph statist properti semant xml tag statist properti dtd tag depict tabl paragraph column properti column reflect properti peculiar set tag cluster label tag group tag column mechan appli deriv properti tag accuraci workbench deriv semant xml tag label cluster cluster constitut model convent statist term data model subject misclassif error identifi type error type text unit assign wrong cluster label reflect content text unit error type text unit assign cluster label reflect content text unit envisag error type relev term accuraci model probabl cluster label reflect content cluster member accuraci affect dtd peculiar individu tag incorpor statist adorn individu tag order evalu qualiti approach absenc drew random sampl text unit domain specialist verifi annot text unit respect error type error type type occur text unit tag text unit correctli process percentag error type ii text unit indic text unit cluster semant belong error rate entir dataset interv result tag dtd cluster label deriv statist approach term observ option se applic domain expert provid suggest tag observ mandatori suggest hold true text unit inform misclassifi inform simpli absent document expect movi movi unknown due natur movi properti offer indic tag consid potenti mandatori defin ratio document tag total number document archiv associ miner identifi item occur interest tag affect tag term tag ü tag ý confid defin associ rule ratio tag ý ü document ý similarli associ correl tag ü set tag ý high support ü popul statist call lift improv defin allevi ratio ü ý ü popul ratio ì ü statist properti tag order tag account order tag essenti term tag ü sequenc adjac tag ý number document sequenc ý number document ý ý ýò definit differ convent statist sequenc mine concentr adjac disallow occurr arbitrari tag convent sequenc mine satisfi requir web usag miner design distinguish adjac event frequenc tag frequenc group set sequenc term properti radiu comput method accuraci model workbench tag simpl statist set tag associ rule discoveri set tag associ rule discoveri sequenc tag sequenc mine set sequenc tag ratio number document group tag total number document set properti assum set valu perturb set member show model statist inform pertin individu tag group set relationship seamless model statist xml tag valu statist properti depict tabl made part workbench remain comput data mine algorithm exploit valu establish probabilist model algorithm build dtd process model introduc gener graph statist inform group tag tag relationship depict structur establish dtd xmlschema rich statist adorn discuss algorithm dtd establish repres tag associ direct graph node individu sequenc adjac tag set tag node adorn statist properti pertin resp tag group edg repres relationship form ý convent ü sourc node group node lh target similarli edg adorn statist associ repres semant tag graph node set semant xml tag deriv î ¢ set graph node conform ì ì tag graph consist fact xml tag deriv kdd method group distinguish group perform step model tag group order tabl statist deriv xml tag list annot list flag group depict list order list irrelev uniqu permut group tag map requir list lexicograph order è î set list element î ü è î form ú ú list element î list repres group ü repres uniqu group ú î î tag annot lexicograph group distinct group element group group element group group list violat lexicograph order list element è î defin î è î ¢ î group threshold threshold input mine usual kdd set low threshold affect size graph execut time algorithm build dtd tag relationship graph edg set node constitut graph î î indic node singleton tag group tag statist edg eman element î point element î tag group tag set edg subset î ¢ î statist properti refer sourc group node target target sequenc adjac locat confid valid statist associ confid lift target set locat confid statist properti assum null graph properti compon group tag relationship adorn statist valu tag discov workbench present graph group tag present depend threshold group support conceiv minimalist approach high frequent group approach tag combin occur document present opt minimalist graph connect gener case group tag frequent frequent relationship tag rare combin tag contrari approach ensur combin tag document depict graph case document singl tag occur document size graph depend threshold group support confid lift valu approach deliv upper limit comput ñ number label output workbench ò ñ largest number distinct tag document è ò perturb result equal number ò ò group edg tag particip maximum result ñ ñ ¢ graph node ñ ¢ edg upper limit graph size threshold valu statist properti essenti obtain manag graph cutoff impli inform loss observ graph approach refer structur introduc algorithm deriv probabilist dtd construct part graph dtd deriv graph version captur relationship semant tag found workbench similarli process schema establish convent design decid relationship entiti worth captur refer statist presum dtd reflect relationship present document rare graph relationship set sequenc adorn partial statist present algorithm deriv dtd construct part graph tag dtd adorn probabilist refer tag locat insid dtd algorithm heurist deriv concentr pair tag frequent prefer maxim sequenc tag reader recal comput statist relationship tag requir activ data mine softwar algorithm back miner return desir statist backward construct dtd sequenc algorithm observ dtd set altern sequenc build sequenc start tag algorithm build maxim mean tag sequenc tag document support sequenc backward algorithm start arbitrari tag identifi tag tag sequenc expand anymor mark algorithm shift sequenc arbitrari tag tag process predecessor prepend sequenc iter predecessor subsequ built found predecessor altern incomplet sequenc produc duplic sequenc built algorithm process iter predecessor tag found invok sequenc miner return frequent sequenc adjac tag algorithm frequent pair ü lead confid ù tag predecessor hold è ù ratio document predecessor divid total number document maximum ù determin rest element sequenc sequenc mark maxim criterion mention larger ü predecessor sequenc case maximum margin larger valu tag show maximum locat confid differ locat confid tag small tag accept result altern subsequ identifi maxim algorithm consid longer frequent sequenc return sequenc end subsequ built frequent sequenc found subsequ check maxim impli comput ratio document start number document compar ü tag support comparison perform guidelin altern tag document start maxim document start adher maxim sequenc statist maxim final algorithm filter sequenc maxim assign probabl valu tag insid maxim sequenc multipli accuraci model output workbench locat confid tag respect subsequ lead backward versu forward sequenc construct method gener altern sequenc dtd tag prune frequent sequenc adjac tag produc sequenc miner method construct advantag incorpor sequenc core miner categori perform forward sequenc mine kernel modifi expand sequenc successor tag dtd tree altern algorithm observ dtd tree altern subsequ adorn tag support respect subsequ lead insid number document start subsequ tag similarli algorithm tag predecessor observ dtd tree impli common root gener document archiv start tag assum dummi children tag document tree node refer tag children refer tag context predecessor dtd tree altern resembl dataguid statist adorn differ algorithm consid sequenc tag document frequent observ complet sequenc miner return arbitrari subsequ tag method realiz preprocessor modul web usag miner modul coerc sequenc event common prefix place tree call tree input navig pattern discoveri process perform core sequenc tag document observ sequenc effect preprocessor build dtd archiv tree altern tag sequenc figur depict tree relat case studi note xml document depict tabl partli dtd excerpt knowledg hidden electron media organ encapsul document acquir knowledg impli effect queri document combin inform piec textual asset function confin queri text search engin scan individu asset return rank result present methodolog enabl queri process join text sourc structur deriv xml dtd text archiv mean data mine techniqu semant text unit core approach deriv xml tag undertaken workbench part studi main emphasi combin tag reflect semant text unit archiv singl dtd reflect semant archiv shown dtd probabilist proxim archiv content deriv set statist properti reflect qualiti tag insid dtd relationship tag statist properti tag relationship form basi combin complet dtd xml xmlschema graph structur depict statist serv basi oper mechan deriv dtd emploi mine algorithm set heurist rule test methodolog archiv document region commerci regist deriv set tag workbench implement mechan deriv dtd futur work includ implement mechan dtd deriv establish framework comparison deriv dtd term express accuraci ultim goal work establish queri mechan text archiv intend coupl dtd deriv method queri mechan data dtd deriv probabilist impli design model evalu qualiti queri result acknowledg german research societi fund project mbh provid data project collabor stefan conrad discuss ibm intellig miner data kindli provid ibm term ibm scholar program figur dtd tree altern tag sequenc refer suciu data relat semistructur data xml morgan kaufman san agraw srikant mine sequenti pattern proc int conf data mar hugh navig pattern discoveri internet data page neumann construct linguist search index internet search engin intern confer applic natur languag inform june berri linoff data mine sale custom support john wilei buneman semistructur data sixteenth acm symposium principl page staab manual semant text annot tool journal section semant zamir text mine term level european symposium principl data mine knowledg page septemb mine web navig path fragment goldman widom enabl queri formul optim semistructur page aug winkler framework convert text xml document data mine techniqu ieee intern confer data san spiliopoul semant tag text document intern workshop inform fusion page editor workshop web mine challeng aug acm schema find regular semistructur data principl data mine knowledg european volum lectur note artifici page septemb heidelberg oliveira knowledg discoveri text extract web acm sigkdd im masand editor advanc web usag mine user lnai springer juli workbench acquisit ontolog knowledg natur languag seventh confer european chapter comput page march moonei inform extract aid discoveri predict rule text sixth intern confer knowledg discoveri data mine workshop text page august manolopoulo effect predict data mine approach workshop mine log data custom san august motwani infer structur data sigmod schmid probabilist tag tree intern confer method languag page septemb transit exist infer document structur der xml xml meet page spiliopoul labori data mine web mine int journal comp sci special issu mar spiliopoul tool web util analysi extend version proc edbt workshop lnc page springer tan text state art challeng workshop knowledg advanc page april wang liu discov structur associ semistructur data ieee transact knowledg data
ML/1462 6 greedi function gradient boost machin jerom friedman februari abstract function approxim view perspect numer optim function paramet space connect made addit minim gener paradigm develop addit base fit criterion specif algorithm present loss function logist likelihood classif special enhanc deriv case individu addit compon tool interpret model present gradient boost tree produc highli interpret procedur regress mine clean data connect approach boost method freund tibshirani discuss function estim function estim problem system consist random variabl set random variabl fx xn sampl fy goal find function map joint distribut expect loss function minim arg min arg min frequent emploi loss function includ absolut error jy neg binomi common procedur member class function fp set paramet paper focu form fi ffi function chosen simpl function paramet fa heart function approxim method neural network william radial basi function csiro lock bag north nsw mar wavelet support vector machin special interest case function small produc cart tm stone tree paramet split split termin node mean individu tree numer optim model function optim problem paramet optim arg min arg min numer optim method appli solv involv express solut paramet form pm initi guess success increment defin optim method simplest frequent numer minim method defin increment current gradient gm comput gm fg jm step pm ae arg min ae neg gradient defin direct step call direct numer optim function space approach appli numer optim function space evalu point seek minim individu directli respect function space infinit number data set finit number ff numer optim paradigm solut fm initi increment function defin optim method fm gm assum suffici regular interchang differenti multipli ae line search ae arg min ae finit data approach break joint distribut repres finit data sampl fy case evalu accur estim valu train sampl point strength borrow nearbi point smooth solut assum form paramet optim discuss section approach arg min fm fi signal process strategi call zhang loss call basi dictionari machin call exponenti loss criterion schapir schapir singer neg binomi tibshirani function call tree loss base learner solut difficult obtain current approxim mth function fi greedi step minim solut constraint step member class function view step constraint unconstrain neg gradient step direct possibl member class parallel data space unconstrain neg gradient highli correl data distribut obtain solut arg min constrain neg gradient place unconstrain strategi line search perform ae arg min ae approxim updat fm ae obtain solut smooth constraint constraint appli unconstrain solut permit replac difficult minim problem minim algorithm approach minim loss conjunct forward addit model lead algorithm algorithm gradient boost arg min ae arg min ae arg min ae fm ae endfor end algorithm special case loss function depend product analog boost minim note machin learn literatur muller elegantli exploit analog motiv procedur quantiti call descent perform space margin space function valu approach permit applic gener loss function notion margin appar drucker emploi strategi cast regress framework classif context adaboost algorithm schapir addit model section gradient boost strategi appli popular loss squar huber logist binomi serv lead boost algorithm regress line algorithm line simpli fit current residu line search produc result ae fi fi minim fi line gradient boost loss produc usual approach iter fit current algorithm ls boost arg min fm ae endfor end algorithm regress loss function jy impli fit sign current residu line algorithm line search ae arg min ae jy arg min ae fi fi fi fi ae fi fi fi fi ae oe weight median weight insert result algorithm yield algorithm base base learner special case base learner node tree applic numer optim singl line search perform descent direct partit paramet subset pl gradient correspondingli separ line search perform respect subspac paramet fall natur group line search simpl optim problem paramet function valu ff tree partit termin node membership mth iter separ line search correspond appli separ data termin node tree ae lm ae fi fi fi fi lm oe subregion termin node tree induc mth iter valu equal reduc ae lm lm median fy updat line algorithm simpli fm median fy iter tree built predict sign current residu base criterion approxim updat ad median residu deriv termin node algorithm node fl lm fy fm fl lm endfor end algorithm algorithm highli robust tree order inform input variabl line search node median altern approach build tree directli minim loss criterion tree arg min tree jy fm tree algorithm faster induc tree error loss rapidli updat search split tree build process techniqu attempt resist error distribut outlier maintain high effici distribut error huber loss function ae jy ffi jy ffi ae jy ffi ffi jy ffi line search ae arg min ae solut obtain standard iter method huber transit point ffi depend iter number ffi distribut ff control point procedur point fraction observ arbitrarili modifi degrad qualiti result tree base learner partit strategi separ line search termin node lm ae lm arg min ae lm fl lm ae lm arg min fl updat fm fl lm lm solut approxim singl step standard iter procedur start median lm fr fr current residu approxim fl lm lm nlm lm lm nlm number observ termin node algorithm huber boost algorithm ffi ff ae jr ffi ffi jr ffi fr lm node lm median fr fl lm lm nlm lm lm fm fl lm lm endfor end algorithm theori robust algorithm properti similar boost distribut similar regress long tail distribut error distribut moder long tail perform superior logist regress loss function neg binomi log log line search ae arg min ae log tree base learner partit strategi separ line search termin node ae lm arg min ae log lm fl lm ae lm arg min fl log fm fl lm lm close form solut strategi approxim singl step turn fl lm algorithm gradient boost algorithm log node fl lm oe fm fl lm endfor end algorithm final approxim fm relat invert yield probabl estim turn classif cost predict truth influenc trim empir loss function logist regress problem mth iter oe depend small moder valu impli ith observ influenc loss solut arg min suggest observ larg delet comput mth iter substanti effect result view measur weight ith observ estim ae gener influenc estim paramet paramet gaug deriv loss function respect paramet evalu solut space function paramet ff deriv mth iter measur influenc ith observ estim ae mth iter influenc trim delet observ solut ff fw weight fw arrang ascend order typic valu ff note influenc trim base ident trim strategi emploi real observ delet sacrif accuraci influenc measur result reduct comput factor logist regress develop algorithm problem loss function fy log symmetr multipl logist transform log log substitut deriv ik ij ff ik predict current residu fy ik produc tree node iter fr separ line search perform termin node tree fl arg min fl oe ik oe log updat function km fl close form solut approxim singl step diagon approxim result step fl ik ik ik lead algorithm logist gradient algorithm lk ik ik fr node ik fl ik ik ik km fl endfor endfor end algorithm final estim ff km obtain probabl estim fp km turn classif arg min cost predict kth class truth note algorithm algorithm algorithm bear close similar procedur algorithm tree ik ik weight appli observ ik termin node updat fl ik differ algorithm split criterion induc tree termin region fr improv criterion evalu potenti split termin region subregion left daughter mean sum weight unit weight give valu weight sum unit weight favor split symmetr number observ daughter favor split sum estim varianc ik equal lk implement advantag numer stabil numer unstabl close observ frequent perform strongli affect handl lk difficulti close observ termin node easier deal happen influenc trim procedur implement case outlin section ik influenc ik ik ik delet observ induc kth tree current iter regular predict fit train data close reduc expect loss train data point loss stop start regular method attempt prevent constrain fit procedur addit natur regular paramet number compon analog regress consid explanatori variabl sequenti enter control regul expect loss train data minim estim model select goal predict found regular shrinkag superior result obtain restrict number compon arg min minim train data expect loss class function optim constant solut arg min fl simplest form regular shrinkag direct proport shrinkag regular control gener expect train data loss largest give fit train data optim minim popul expect loss estim model select context addit model construct forward manner proport shrinkag implement replac line gener algorithm fm ae make specif algorithm updat simpli scale introduc proport shrinkag gradient boost regular number compon control affect ideal estim optim valu minim model select criterion jointli respect valu paramet comput size produc comput illustr simul studi train sampl consist observ fy target function randomli gener section gener normal distribut varianc adjust jf median give ratio base learner termin node tree induc manner figur show ls function number term valu shrinkag paramet measur averag absolut error estim fm rel optim constant solut fm jf fm jf logist regress obtain threshold median distribut valu greater median assign median assign error rate boundari fairli complic measur minu misclassif fm valu measur comput independ valid data set observ fig smaller valu shrinkag paramet result diminish return smallest valu larger behavior characterist perform reach optimum diminish point effect pronounc criterion smaller valu expect difficult misclassif continu logist likelihood reach optimum degrad likelihood improv misclassif likelihood measur aspect fit qualiti depend sign fm likelihood affect sign magnitud degrad qualiti magnitud estim affect sign misclassif error sensit tabl summar simul result valu includ shown fig shown iter number minimum achiev minim tabl iter number give fit shrinkag paramet boost method smaller valu give rise larger optim provid higher diminish return misclassif error rate flat optim unstabl illustr target qualit natur result fairli target function give rise behavior suggest depend number iter made larg conveni feasibl adjust achiev minimum close chosen number iter prefer sequenti natur easili restart finish comput repeat function iter number conveni estim test sampl simul studi perform function estim method depend problem appli import characterist problem affect perform includ train sampl size true underli function distribut distribut binari gener variabl distribut seldom natur unknown order gaug estim method accur evalu perform situat conveni accomplish mont carlo simul data gener wide varieti result perform accur calcul section studi iter absolut error iter absolut error iter iter error rate figur perform gradient boost algorithm function number iter curv correspond shrinkag paramet valu order extrem plot present attempt understand properti gradient procedur develop previou section studi evalu method select real result larg studi regard suggest absenc theori random function gener import characterist problem affect perform true underli target function method target natur target function vari greatli seldom evalu merit tree gradient boost varieti randomli gener target form coeffici fa randomli gener uniform distribut function randomli select size variabl fx separ random permut integ ng size subset drawn exponenti distribut expect number input variabl fewer reflect bia high order interact frequent target commonli encount practic realiz good chanc function involv higher order interact function input variabl gaussian function vector randomli gener distribut input variabl covari matrix randomli gener random orthonorm matrix dn eigenvalu randomli gener uniform distribut jl limit depend distribut input variabl studi present number input variabl joint distribut standard normal eigenvalu limit tail normal distribut shorter data encount realist uniformli distribut input simul studi tree immun effect long tail input variabl shorter tail rel advantag competitor comparison simul studi target function randomli gener prescript perform evalu term distribut approxim inaccuraci approxim error misclassif target approach wide varieti target function gener term shape contour input space lower order interact function suit addit tree tree produc tensor product basi compon target tensor product function ten input target function data mine applic ten input relev input number input influenc output variabl problem input variabl high collinear number roughli independ variabl smaller target function strongli depend small subset input error distribut ls compar term perform target function error distribut tree termin node algorithm paramet set default ff hundr data set fy gener repres target function randomli gener section error gener normal distribut varianc adjust jf give ratio studi error gener scale factor adjust give ratio slash distribut thick tail extrem test robust train sampl size left test sampl estim optim number compon trial addit valid sampl observ gener evalu approxim inaccuraci trial shrinkag paramet set default left panel fig show distribut approxim inaccuraci target error distribut method shade area show rang distribut white bar median outer hing repres point closest rang unit quartil isol bar repres individu point rang plot comparison give inform rel perform individu target function panel fig attempt provid summari show distribut error error target function error method target divid smallest error obtain method compar method receiv receiv larger method target result distribut point mass note logarithm ratio plot lower panel left panel fig target repres fairli wide spectrum difficulti approxim error vari factor distribut error ls superior expect smallest error time averag ls error normal ls normal ls error slash ls slash figur distribut absolut approxim error error rel ls normal slash error distribut ls perform normal error distribut perform slash error close error distribut note logarithm scale lower panel ls error thing averag approxim error ls explain target variat individu trial perform compar time time averag ls target result suggest method choic extrem case behav badli behav perform close suffer normal ls disastr slash error ls versu mar gradient algorithm produc approxim number piec gener larger produc singl aspect approxim function fm expect repres disadvantag respect method provid continu true underli target continu fairli smooth randomli gener target function continu smooth section investig extent constant disadvantag compar accuraci gradient mar target mar produc tensor product base approxim continu function product produc continu approxim involv strategi induc tensor product mar base compar ls distribut ratio setup section interest note perform mar enhanc test set model default criterion panel fig compar distribut mar approxim randomli gener target function ls fig mar distribut vari factor target mar ls substanti illustr fact natur target function strongli influenc rel perform method panel fig show distribut rel target method exhibit similar perform base error number target substanti outperform bottom panel fig show plot base error weight larger error assess ls error measur close valu target error typic higher error mar predict tend close target error ls evenli distribut fewer larg error small error consequ natur approxim make difficult arbitrarili close smoothli vari target approxim finit size fig rel perform sensit criterion measur result aspect approxim disadvantag environ normal normal input variabl competit mar advantag approach immun effect wide tail outlier distribut input variabl method produc continu extrem sensit problem shown section accur ls normal error highli resist output data mine applic cleanli data assur outlier high consist robust repres substanti advantag lk versu section perform lk compar singer randomli gener target class gener threshold target quantil distribut input train observ trial divid train model select independ gener valid sampl observ estim target error rate induc boundari depend natur individu target function tree termin node method figur show distribut ratio smallest target method method vari substanti target lk gener superior perform smallest error trial averag higher trial target mar error mar mar error mar figur distribut approxim error error rel ls mar top panel base bottom error absolut error mar distribut wider indic frequent perform ls mar perform measur error indic frequent make larger smaller error ls adaboost adaboost rel figur distribut problem rel lk lk exhibit superior perform tie higher averag averag figur show procedur modifi incorpor proport shrinkag shrinkag paramet set lk pictur benefit substanti shrinkag perform procedur slight advantag averag valu lk result suggest rel perform method depend aggress structur differ addit intern shrinkag stabil denomin close account slight superior comparison shrinkag appli lk perform ident shown fig shrinkag paramet carefulli tune perform differenti tree boost procedur primari number iter shrinkag paramet discuss section addit procedur estim base learner primari focu paper induc tree fix number termin primari base learner choic depend strongli natur target highest order domin interact variabl rel figur distribut problem rel lk proport shrinkag appli perform method similar function jk sum call compon consist sum function depend input variabl function ff provid closest approxim addit constraint sum consist function pair input variabl call chosen main effect provid closest approxim limit interact sum repres interact highest interact order limit number input variabl larg target function encount practic close approxim anova decomposit lower order term requir captur domin variat success achiev addit compon tibshirani pure addit approxim produc method highli success classif motiv bia interact randomli gener target function simul studi goal function estim produc approxim close match target requir domin interact order similar boost interact order control limit size individu tree induc iter tree termin node produc function interact order boost process interact order entir approxim larger largest individu compon tree size ab error rel error figur distribut absolut approxim error error rel ls size measur number termin node distribut smallest tree indic frequent perform larger similar perform govern interact order target unknown procedur estim model select criterion subsampl train discuss larg tree desir figur illustr effect tree size approxim accuraci randomli gener function simul studi setup section shown distribut absolut error error rel lowest target produc addit main effect compon produc addit variabl interact termin node tree produc interact level maximum typic valu fig smallest tree produc lower accuraci distribut wider mean produc approxim smaller restrict low order advantag target happen low interact level badli approxim high order interact target larger tree consist accuraci low order interact higher order function perform differ larger slight deterior tree produc accur approxim number averag tree error larger lowest valu higher accuraci obtain tree size individu estim target interpret applic interpret deriv approxim involv gain understand input variabl influenti contribut natur depend influenti input extent qualit reflect natur target function tool provid inform underli relationship input output variabl tool present interpret approxim interpret singl tend effect context boost tree interpret tool section illustr section context real data exampl rel import input variabl descript approxim rel influenc individu input variat joint input variabl distribut measur constant approxim produc strictli exist approxim surrog measur reflect properti breiman al summat node node tree split variabl node empir improv result split unit correspond breiman al directli measur collect tree obtain gener averag tree sequenc motiv base pure heurist argument partial justif show produc expect result appli simplest context linear target function covari matrix input multipl ident ci case influenc measur produc ja tabl show result small simul studi similar section linear coeffici signal ratio shown standard deviat valu ten random influenc estim influenti variabl arbitrarili assign estim valu scale estim import rank input variabl correct ten trial tabl estim rel influenc valu consist tabl estim standard deviat input variabl rel influenc linear target function var std breiman al influenc measur augment strategi involv surrog split intend uncov mask influenti variabl highli strategi singl tree opportun variabl particip split limit size tree context boost number split opportun vastli surrog correspondingli essenti partial depend plot visual power interpret tool graphic render function argument summari depend joint valu input variabl visual limit low argument function singl variabl plot graph valu function singl categor variabl repres bar repres bar height function function variabl pictur contour perspect mesh plot function categor variabl variabl summar sequenc show depend condit respect valu variabl cleveland view function higher argument difficult view partial depend approxim select small subset input variabl collect plot seldom provid depict produc domin low order interact size input variabl fz ae fx xn nl complement subset nl condit specif valu variabl nl consid function variabl chosen subset nl nl function form nl depend valu chosen nl depend strong averag function nl nl nl dz nl repres summari chosen variabl subset nl nl margin probabl densiti nl nl nl dz joint densiti input special case depend addit nl nl multipl nl nl form nl depend joint valu variabl nl complet descript natur variat chosen input variabl subset altern summar depend subset directli model function train data nl dz nl averag condit densiti margin densiti reflect depend select variabl subset appar depend induc sole associ complement variabl nl contribut addit multipl evalu term factor joint densiti happen product nl nl tree base partial depend input variabl subset straightforward evalu train data set specif valu variabl weight tree perform root weight assign node split variabl left daughter node weight modifi node split variabl member complement subset nl daughter visit current weight multipli fraction train observ left node termin node visit assign current weight tree weight averag valu termin node visit tree collect obtain result individu tree simpli averag interpret graphic input variabl subset low cardin inform subset input variabl deem influenti contribut variat illustr provid section closer depend subset addit multipl complet partial depend function captur natur influenc variabl deriv approxim subset group influenti input complex interact provid revel partial depend plot nl separ comput candid subset multipl correl train data nl nl nl nl gaug addit factor respect chosen subset addit nl comput small number nl randomli select train data result function compar judg variabl partial depend respect chang valu nl real data section regress algorithm illustr moder size data set result section suggest properti classif algorithm lk similar extens appli data data set consist chemic concentr measur rock sampl survei questionnair data data set partit learn sampl consist remain data test sampl model size iter shrinkag paramet set garnet data data set consist sampl garnet collect world al garnet complex commonli occur minor phase rock make earth variabl garnet concentr chemic plate set rock collect cr eleven variabl repres concentr variabl categor stabl shield miss valu distribut variabl tend highli skew larger outlier estim concentr function joint concentr chemic plate index tabl error ls garnet data vari number termin node individu tree term node ls tabl show error predict output rel optim constant fi fi fi fi fi fi jy base test ls valu size termin constitu tree note error measur includ irreduc error underli target function typic substanti larger error approxim target method addit approxim distinctli inferior larger indic presenc interact effect input variabl termin node tree adequ termin node tree provid accuraci error smaller ls similar slight edg result consist obtain simul studi shown fig fig figur show rel import input variabl predict concentr base approxim termin node tree ga influenti import top panel fig show partial depend approxim influenti variabl natur approxim dramat bottom panel show partial depend pair variabl strong interact effect ga evid depend variabl smallest valu depend correspondingli amplifi smaller interact effect demograph data data set consist questionnair fill shop mall custom san francisco bai area columbu answer relat illustr question list tabl data consist mixtur real categor small number distinct valu miss valu ga zn cao sr rel import figur rel influenc eleven input variabl target variat garnet data ga influenti tabl variabl demograph data var demograph type sex cat martial statu cat ag real educ real occup cat incom real year ba real dual incom cat number household real number household real household statu cat type home cat ethnic classif cat languag home cat illustr data model incom function variabl tabl show error predict rel constant predictor regress algorithm ga ga ga figur partial depend plot influenti input variabl garnet data note vertic scale plot strong interact effect weaker occ mar ag eth lan num sex rel import figur rel influenc input variabl target variat demograph data small group variabl domin tabl error ls demograph data vari number termin node individu tree term node ls differ perform method ow highli discret natur outlier long tail distribut real valu input output reduct error constitu tree size indic lack interact input approxim addit individu input variabl adequ figur show rel import input variabl predict base ls approxim small subset domin figur show partial depend plot influenti variabl categor variabl repres plot center data approxim addit sum plot complet describ contribut input occup sale labor student militari retir household statu rent live famili statu marri live singl ag educ type home mobil home figur partial depend plot influenti input variabl demograph data note vertic scale plot valu ag educ code repres consecut equal interv depend incom ag nonmonoton reach maximum repres interv year result fig depend part confirm prior suspicion suggest approxim intuit reason data mine tool predict data procedur attract properti inherit favor characterist tree mitig unfavor favor robust procedur invari monoton transform individu input variabl log jth input variabl yield result input variabl transform elimin consequ sensit long tail distribut outlier elimin complet robust outlier output variabl enjoi fair measur robust output outlier advantag tree induct intern featur select tree tend robust addit irrelev input variabl inherit properti princip disadvantag tree inaccuraci consequ natur approxim smaller instabl larger fact involv predomin high order interact mitig boost procedur produc illustr fig granular finer enhanc stabil small effect averag interact level approxim effect control limit size individu constitu tree biggest advantag singl tree boost tree thought lack featur small tree easili due instabl interpret treat caution interpret larger tree question approxim interpret partial depend plot conjunct input variabl rel import illustr section provid complet offer insight natur relationship tool approxim special characterist tree base model rapid calcul partial depend plot singl note caution requir ow greater instabl sort input comput regress procedur scale linearli number observ number input variabl number iter scale roughli logarithm size constitu tree classif algorithm lk scale linearli number class scale highli number iter influenc trim emploi point appli garnet data section requir minut pentium ii comput section boost iter requir obtain optim base small valu shrinkag paramet mitig small size tree induc iter illustr fig improv rapid initi level slower increment optim approxim achiev earli correspondingli comput approxim initi explor provid indic final approxim suffici accuraci warrant continu improv dramat improv continu judg procedur restart left comput invest lost larger valu shrinkag paramet speed initi improv fig provid accuraci optim solut iter case boost restart begin smaller shrinkag paramet subsequ emploi abil procedur give quick indic potenti coupl extrem make preprocess tool appli imperfect data suffici predict data clean invest render suitabl model procedur data model boost continu data start previou solut improv accuraci provid independ test data set monitor improv prevent overfit data accuraci gener obtain redo entir analysi combin comput save boost success subset data insuffici random access main memori store entir data set boost appli data sequenti read main time start current recycl previou subset time permit crucial independ test set stop train individu subset point estim accuraci combin approxim start diminish acknowledg discuss robert tibshirani gratefulli acknowledg work partial support csiro mathemat inform depart energi contract grant nation scienc foundat refer design control displai comput statist graphic predict game arc algorithm univ dept technic report submit neural comput past bite predict larg data set univ dept statist technic report classif regress tree wadsworth shrinkag statist soc nonlinear wavelet method recoveri spectra indirect noisi data perspect proc symp appli daubechi amer math provid improv boost techniqu fourteenth intern confer machin learn ed pp geometr approach leverag weak learner santa technic report springer experi boost algorithm machin thirteenth intern multivari adapt regress spline annal statist friedman addit logist statist view boost stanford dept technic report friedman garnet gener addit model chapman hall robust estim locat paramet annal mathemat match pursuit time frequenc dictionari ieee transact signal process radial basi function multivari review algorithm ed mason pp clarendon press soft margin adaboost technic report pattern recognit neural network cambridg press learn error natur improv boost algorithm predict eleventh annual confer comput learn theori program machin learn morgan kaufmann natur statist learn theori springer mathemat model medic diagnosi applic heart amer med assoc
IR/1463 5 privat inform retriev commun christian marku februari preliminari version paper lectur note comput abstract present privat inform retriev scheme commun complex construct base reason intract call assumpt essenti difficulti decid small prime divid composit integ unknown factor integ euler privat inform retriev introduct privat inform retriev notion privat inform retriev introduc receiv lot attent studi motiv grow concern user privaci queri larg commerci problem independ studi cooper birman implement anonym messag servic mobil problem consist commun protocol involv secret input secret input call data string user secret input integ protocol enabl user learn time hide trivial ineffici solut send entir string origin paper show problem solvabl effici set consist singl multipl hold data string commun user model ibm zurich research research laboratori comput mit laboratori comput ma usa po box reminisc proof system model offer individu player learn matter comput long collud player solut model present paper al commun commun complex subsequ construct commun complex comput notic achiev commun requir constant number server show achiev commun complex minim replic requir comput privaci user theoret weaker practic suffici notion give scheme commun complex system make secur paramet long individu perform polynomi amount comput collud learn comput possibl assumpt server separ mirror content practic show replic prove exist comput commun quadrat assumpt exhibit protocol user commun complex repres length data string refer comput note addit commun complex polynomi secur paramet addit amount commun de facto absorb mention practic chosen small result question construct lower commun complex main result provid posit answer question base plausibl short consist assumpt assumpt state intract decid small prime divid composit integ unknown factor oe euler comput input hard factor state effici find random composit prime divid attract simpl concret find crisp plausibl assumpt import task design analysi cryptograph prove context attract studi base prove main commun complex polynomi secur note commun complex disregard privaci user input order user obtain ith bit data log bit commun user case comput complex effici point view user run time polynomi log run time proport time polynomi properti close optim context user comput complex close optim scheme achiev user send log bit perform log step comput comput complex close optim read bit data string user possibl receiv unread bit gain inform user input round complex round complex essenti optim long user input exist privaci model achiev comput privaci privaci scheme optim privaci send entir data preliminari definit notat integ denot set natur number natur number present binari input algorithm denot unari concaten denot evenli divid write ajb zz ring integ modulo zz multipl group euler function integ denot defin number posit integ prime string oe binari denot oe length oe ith bit oe concaten oe oe ffi rule possibl altern model user learn bit posit execut data string bit comput model algorithm ture machin algorithm effici exponenti small fraction random run fix polynomi time circuit finit function comput acycl circuitri boolean gate input gate binari input binari probabl space input notat refer probabl space assign string oe probabl input output oe probabl denot algorithm assign element randomli select finit notat denot algorithm assign element select probabl space sampl space uniform probabl distribut sampl point notat prob denot probabl true order execut algorithm fulli work round achiev commun complex user comput complex sake formal type effici algorithm fulli privat inform retriev scheme exist constant string ck circuit fi fi fi fi call fundament constant data string pair user queri gener retriev queri secret secur paramet queri user input bit content secret remark correct constraint slightli gener correct requir hold probabl requir hold high probabl mention commun complex length data time polynomi secur independ larg polynomi depend domin depend definit exponenti amount number theori set defin set assumpt construct denot prime set prime length set composit integ product prime length hardest input factor composit integ prime denot set prime denot set prime denot set product prime fact state proof basic fact construct fact exist effici algorithm input output random prime prime fact exist effici algorithm input output random element fact exist effici algorithm input prime integ integ output fact exist effici algorithm input ms integ output root mod assumpt ffl assumpt ek circuit prob ffl assumpt exist sampl algorithm prime output random number ms integ factor refer fourth fundament constant remark reveal larg prime divid ms factor prime effici factor input easi decid divid similar suffic decid divid hard constant fraction shorter polynomi shorter note complex factor log constant reveal prime divid possibl ms factor significantli log significantli smaller repres log reveal contribut dlog pe factor note hold congruent mod mod obviou divid weaker wide accept extend hypothesi algorithm prime integ integ factor code repeatedli random integ pq prime random prime return algorithm find suitabl expect polynomi time chapter design high user queri consist compact program user input hidden run program data result comput bit compact program run data string fashion data user send algorithm secur comput sequenc user retriev evalu predic hard guess secret kei user design work essenti predic enjoi properti rel sequenc valu induct implement give algorithm user algorithm algorithm common effici subroutin describ algorithm probabilist primal test primal prover gain advantag notat present run basic input number sequenc integ unari secur paramet primal prover integ composit code gener integ sequenc string integ prime overwhelm gener sequenc prime code oe aj ffi log oe aj string oe aj interpret element gf oper gf return step queri gener integ queri secret composit constant zz sequenc consist ms prime factor code randomli independ random integ integ factor random zz output queri secret algorithm queri output zz code mod output retriev output zz output bit overwhelm code root mod output output proof theorem run time subroutin effici input intens oper evalu polynomi gf run primal prover algorithm effici subroutin prime overwhelm select random composit effici present run time algorithm effici perform essenti exponenti mod bit data string run time polynomi linear algorithm effici fact ms factor secret input run time polynomi ms length polynomi correct start quick dirti analysi gener element randomli independ execut valu independ probabl lower bound prime length data string satisfi probabl exponenti close output prime probabl exponenti close consist random distinct prime length observ modulu constant number prime set randomli chosen prime exponenti small probabl probabl exponenti close prime sequenc divid suffic correct hold exponenti high assum execut distinct prime length divid predic zz root mod user retriev evalu easi check properti design hold properti fact function mod zz prime exponenti small probabl random element zz root mod exponenti small assum root mod correct hold root mod root mod prime divid root mod size prime show exponenti small divid properti root mod mod root mod construct fact root mod exist mod mod root proof properti privaci contradict privaci condit hold exist indic log bk circuit binari jff ff ff prob ff prob advantag bigger exponenti small defin fi prob zz gf sequenc experi defin defin prime prime overwhelm jff jff assum jff ff fi construct guess circuit contradict guess circuit number prime random ensur root mod facilit prove privaci constraint bit code uniformli random number run primal prover smallest return lagrang interpol find coeffici polynomi gf ij ij oe ij gf correspond string ffi gener random zz run return return return return notic construct number gate polynomi greater number gate defin oper prime analyz cs behavior input distribut requir probabl probabl calcul probabl guess correctli distribut drawn prob prob prob prob prob distribut output depend directli run input distribut definit ff case find prime step case examin input distribut compar input distribut definit fi experi lead fi distinct case note case call occur overwhelm probabl ffi probabl case comput assum moment random prime probabl ffi random element prime upper bound condit probabl case impli prob prime prob ffi case prime detect step ideal primal probabl ffi bound prob prob ffi prob ffi prob prime ffi ffi ff ffi fi ffi ff ffi fi ffi ffi ffi ffi inequ assumpt ff fi distinguish correctli probabl ffi ffi ffi ffi exponenti small exce exponenti small remain advantag exponenti small clear violat acknowledg author mao interest comment earlier version paper refer leonard recogn prime random polynomi proc annual acm symposium theori comput pp upper bound commun complex privat inform proc lectur note comput vol manuel de giusepp siam journal comput michael joe avi multi prover interact remov proc annual acm symposium theori comput pp eric bach jeffrei algorithm number vol effici mit david cooper kenneth preserv privaci network mobil proc ieee symposium secur pp privat inform proc annual acm symposium theori comput pp od privat inform proc ieee symposium foundat comput scienc don find small root bivari integ factor high bit advanc lectur note comput vol don find small root univari modular advanc lectur note comput vol don person joe prime quickli proc annual acm symposium theori comput pp probabilist journal comput system scienc ronald digit signatur scheme secur adapt siam journal comput replic singl inform proc ieee symposium foundat comput scienc pp michael exchang secret oblivi tech report fast test siam journal comput
DB/1464 3 dynam data mainten fulli concurr environ xin elk rundenstein depart comput scienc worcest polytechn institut ma septemb abstract data emerg technolog support make gather data distribut inform sourc repositori dynam data maintain order stai consist underli sourc recent view mainten algorithm tackl problem data mainten concurr sourc data view synchron handl sourc schema concurr interleav schema data updat remain unexplor problem solut framework call successfulli address problem framework detect concurr schema broken queri scheme con ict concurr data updat local timestamp scheme fundament idea framework develop architectur separ concern concurr data updat concurr schema handl restrict updat transact lower level emploi local algorithm handl concurr data metadata map strategi handl concurr sourc renam oper higher address problem concurr sourc drop oper design strategi detect correct concurr execut plan ect updat develop view adapt call execut plan increment adapt view put algorithm rst provid complet solut data manag fulli concurr environ introduct data wareh dw manag data built gather inform iss integr virtual repositori custom user data wareh import applic environ heterogen distribut travel support system manag modern distribut iss typic di erent inform provid function independ impli updat data schema concurr concern ect dw de ned gener awar synchron dw manag system type task relat dw manag distribut environ popular research area increment dw view mainten distribut iss view mainten algorithm maintain extent data data updat occur space research area call view synchron concern evolv view de nition schema chang iss result view de nition und ned research refer view adapt concern adapt view extent increment view de nition modi ed directli user indirectli view synchron modul view mainten attent problem concurr du iss recent work rst begin studi concurr problem du sc environ approach integr exist va algorithm system protocol iss enabl correctli collabor solut limit requir inform sourc cooper rst announc intend wait dw nish servic outstand permit execut sc overcom limit previou solut framework handl fulli concurr sc du put restrict updat iss illustr kind problem occur restrict cooper iss motiv dw mainten concurr problem illustr dw mainten concurr problem motiv assum inform sourc shown figur view data de ned sql queri equat assum data updat custom requir custom info tour info particip info reserv info figur descript iss send increment view mainten queri de ned equat perform join creat view asia custom select custom asia select ben ben asia assum case occur case transfer time queri commit data updat tupl captur tupl insert view dw start process tupl insert view duplic anomali observ case transfer time queri schema queri process call queri broken queri due inconsist schemata speci ed queri schema underli sourc concurr autonomi updat con ict dw mainten process concurr du result incorrect queri result concurr sc result broken queri process error messag solut approach framework present gener approach call dynam data manag framework rst complet solut solv problem maintain view data de ned distribut iss pose restrict note drop attribut oper commit process restrict assumpt updat transact restrict assumpt cooper iss delai schema evolut receiv permiss data drop unexpect schema chang dw mainten queri iss broken framework incorpor strategi detect broken queri depend identi ed problem type concurr framework incorpor strategi handl maintain data correctli contribut work dw mainten concurr problem point broken queri problem concurr sc introduc solut framework call adapt architectur separ concern concurr du concurr sc handl restrict iss strategi detect correct concurr sc studi depend updat design prove advanc va algorithm call increment adapt view extent multipl interleav du sc distribut iss outlin paper de ne background concept remaind paper section describ architectur solut framework detail explain level concurr control section discuss detect correct concurr sc section introduc va algorithm aim adapt multipl distribut sc du section present result section review relat work section conclud discuss futur direct work background materi data mainten process brie introduc view mainten view synchron view adapt import task build basic background dw view mainten view mainten aim increment maintain view extent sourc data updat basic idea send mainten queri base du calcul delta chang du lot work literatur address con ict mainten queri concurr data updat work assum schema relat remain static mainten process view synchron contrast view synchron aim rewrit view de nition schema base relat chang distinguish primit type sourc schema sc renam attribut relat call sc delet attribut call sc add attribut call rst ect exist view de simpli ignor straightforward deal renam meta data invalid view de ned strategi deal brie describ formal present section drop relat custom altern relat particip replac rewrit view shown equat creat view asia custom select asia creat view asia custom select custom tour asia drop locat altern attribut replac note join step assum attribut locat relat tour replac view rewritten equat relat view de nition replac tour view adapt view adapt increment adapt view extent rewrit view de nition wont ect view brie describ increment view adapt basic idea gure delta relat replac relat join rest drop view rewrit shown previou va increment adapt chang custom longer restor join data custom final calcul view delta chang send call view adapt queri view mainten aim incorpor sc drop rst calcul tour view delta chang adapt custom formal descript introduc section de nition mainten concurr problem tabl de ne main notat remaind paper sequenti uniqu denot order updat reach system number denot tabl de nition denot du sc updat mainten concurr short updat denot receiv dw answer updat receiv dw updat mainten mainten concurr updat assumpt includ attribut condit select refer assumpt view recomput notat mean inform sourc subscript data updat sequenc number sequenc number updat uniqu updat iss schema chang sequenc number mainten adapt queri handl updat du queri result queri result tabl notat mean dw du sc updat messag du sc report queri issu dw queri result dw refresh period du sc process period vm va unexpect queri result queri broken time figur time line mainten concurr data updat figur illustr simpl mainten concurr updat de ned de nition time line updat occur process earlier dw concurr type mainten concurr updat list tabl case shown type type mean denot mainten concurr du happen handl du du du ii mainten concurr du happen handl sc sc du iii mainten concurr sc happen handl du du sc iv mainten concurr sc happen handl sc sc sc tabl type updat de nition broken queri problem de nition examin type concurr problem notic rst queri result incorrect result call queri broken process schemata speci ed queri consist actual schema distinguish type broken queri base type concurr sc provid intuit deal type broken queri case data access interfac relat chang metadata map strategi rewrit queri type broken queri data dw mainten queri succe current mainten order longer feasibl altern plan mainten assumpt broken queri de ned de nition return space empti queri result error messag assum iss smart analyz broken queri return partial queri result data show solut framework handl type data consist framework architectur solut paper develop part dynam data wareh project fund call system aim resolv concurr problem understand context rst introduc framework figur depict architectur system framework divid dw middl space dw space extent data receiv queri middl space bundl data updat data space iss wrapper assum transact local data updat schema chang report commit delta detect extract note dw space set similar relat dw vm va updat messag queue assign time stamp wrapper wrapper wrapper legend modul con control queue data flow dw space middl space subspac queri engin subspac queri engin vm figur architectur framework middl space integr system aim maintain dw sourc updat divid subspac higherlevel subspac call dw manag subspac consist gener dw manag va vm combin system handl data updat schema type sourc vm algorithm updat dw correspondingli lower layer consist time stamp updat messag queue queri engin time stamp manag assign timestamp sourc updat queri result arriv middlewar make trace sequenc updat global updat messag queue collect manag commit updat data updat schema queri engin middlewar queri view queri individu send queri iss collect assembl queri result level concurr control framework concurr handl framework separ handl concurr data updat schema level concurr control middl space lower level concurr control queri engin concurr du concurr sc type handl qe dw manag subspac aim process concurr ect view de nition view handl low level concurr control qe subspac level handl concurr du concurr local handl concurr du queri data modul space rst qe modul includ increment view mainten view adapt view recomput queri assumpt network commun individu dw fifo queri type queri engin local algorithm side ect concurr du base assumpt determin concurr du set result concurr du transpar modul dw manag subspac appli local solv concurr type ii shown tabl map handl concurr addit featur plug queri engin order handl concurr emploi metadata map tabl handl lemma concurr sc result broken sc problem found sc break queri sc broken queri result sc happen earlier process queri assumpt dw receiv sc receiv broken queri sc found broken queri receiv concurr sc rewrit queri correct schemata metadata map send qe handl broken queri anymor high level subspac handl lower level solv type ii concurr problem tabl qe level local strategi part type iii iv problem metadata map strategi high level concurr control dw manag subspac qe handl concurr dw manag subspac handl rst introduc detect concurr problem execut plan ect updat describ advanc va process plan detect correct concurr introduc detect concurr problem correct execut plan ect updat concurr drop depend rst formal concurr problem de nition updat denot de nition denot denot updat commit concurr drop depend denot refer common relat queri result mean receiv mainten queri result assum time receiv updat du process du issu mainten queri send ism time receiv queri result assum ism arriv assumpt sc commit queri arriv ism du concurr drop depend mainten queri du uenc fail kind du process du process case section type semant depend semant depend concern semant requir process order updat resourc updat insert delet renam renam process order preserv process order updat share resourc relat case formal de ne semant depend de nition denot du sc inform semant depend denot sd refer share resourc relat depend properti type depend share import repres constraint process order updat abstract common manner de nition updat de ne depend denot def sd def de ne depend order direct depend arrow depend order null lemma updat depend def process case section drop attribut process process insert succe de nition updat messag de ne depend relationship independ depend def safe depend depend order def unsaf depend depend order theorem broken queri demonstr exist unsaf unsaf case unsaf broken queri occur de nition depend construct direct direct edg updat sd cyclic depend examin properti depend graph set depend depend graph circl illustr process succe figur adopt sampl assum sc relat occur sc attribut base descript section dw send view adapt increment adapt view extent creat view select custom fname drop tabl drop chang equat adapt queri select custom fname drop chang equat adapt queri select custom fname process sequenc drop tabl custom process sequenc figur circl depend process sc succe drop sc process sc succe encount failur relat custom drop sc notic updat depend depend order de ned def circl give formal de nition depend circl concept de nition updat messag depend updat messag depend circl satisfi depend edg depend graph result deadlock process wait depend circl mixtur sd sd sd directli relat sequenc updat commit commit sequenc circl correct unsaf depend detect unsaf depend determin chang unsaf depend safe base depend graph de ned solut emploi depend correct oper achiev rearrang merg updat assum unsaf depend order updat messag depend def oper correct unsaf depend intuit method reorder process order depend exist depend oper merg elimin depend merg updat process refresh process process merg larg updat focu section depend correct algorithm static snapshot shown figur procedur begin snapshot exist unsaf depend begin pick unsaf form cycl depend relat messag figur static depend correct algorithm semant depend concurr depend figur gener execut plan figur depict step appli snapshot discov sd unsaf cycl merg depend stop proof termin assum algorithm correct depend turn back unsaf nite unsaf depend cycl found relat updat merg result reduc number updat worst case larg updat origin updat algorithm stop algorithm execut updat mainten broken queri depend safe call static newli updat break mainten process method gener execut plan endless sourc schema dw mainten nalli proce algorithm batch distribut updat previou algorithm gener execut order ect updat oper work individu updat oper merg larg updat messag sc du distribut iss current algorithm handl mix updat batch develop advanc va call aim increment incorpor batch sourc updat dw notat tabl de ne notat algorithm notat mean data view de ned data view de ned state relat state relat coupl updat relat replac view rewrit sc schema relat sc schema relat combin sc du data updat relat du data updat relat combin du tabl notat mean formal basic algorithm rst formal va algorithm sampl section focu oper process drop relat replac drop relat va increment adapt chang longer restor final join rest relat delta chang view extent process drop attribut view synchron drop locat altern attribut replac note join step shown section gener attribut relat view de nition replac number attribut drop state attribut drop view adapt drop increment incorpor view rst calcul delta origin replac join delta rest relat view chang calcul delta algorithm step preprocess sourc updat merg oper describ section larg updat messag updat multipl sourc maintain de ne merg updat messag du du dun du sc updat set notic schema renam simpli renam data updat inconsist schema due schema rst step preprocess updat rst combin schema make data updat schemat maintain batch refer assumpt footnot section similar assumpt held combin sc set sc combin sc minimum set sc optim dw schema chang tabl show combin sc result combin combin shown tabl mean combin oper ect combin result drop drop drop cond drop drop capit letter repres low case letter repres attribut tabl combin rule sc notic didnt ect dw view de nition case drop creat drop di erent data term dw extent reason ignor combin final sc combin sc rule combin du combin du schemata inconsist de ne du project common attribut relat origin attribut minu drop du tupl data updat common attribut relat note drop relat occur sc du empti reason sc chang du theorem view singl relat join multipl relat du du drop attribut replac view de nition newli ad attribut wont ect view de attribut includ view de nition combin du view mainten result origin combin valid move assum relat add attr drop attr du updat du du du relat relationship sc du sc drop relat du sc drop relat sc drop sc du empti sc du origin du algorithm step increment view adapt dw step incorpor schema view rewrit view adapt describ maintain dw step view rewrit preprocess rst appli note rst rewrit view de nition sc method formal section view de nition rn view de nition replac replac join origin assum valid view rewrit view invalid maintain increment view adapt order increment adapt view gure delta chang view extent rn view extent compar view delta chang rn rn rn previou examin drop du drop rel drop attr du calcul increment adapt view ect du examin relat drop relat du empti relat du care shown formula relat drop attribut notic du explicitli formula prove du ect implicitli includ theorem du proof lemma du refer relat view du lemma hold delta ect du lead import observ drop relat occur discard data hold drop attribut gener observ occur du relat safe discard simpli preprocess section evalu experi testb implement idea jdbc connect dw server server inform sourc relat relat attribut tupl materi join view de ned relat conduct experi pentium iii pc run window nt studi individu updat process rst studi updat process dw mainten type du distinguish signi di erenc mainten cost figur depict dw mainten cost measur millisecond di erent type updat cost du mainten cost mainten signi invok va modul observ intuit costli abort process studi process studi system perform kind concurr tabl note system extend system function deal concurr sc rst studi overhead extend function bring normal system du process extra cost du renam drop du renam drop time sourc updat process figur comparison individu updat process broken queri detect scheme appli scheme sweep concurr du compar sweep number concurr data updat distribut sourc sweep time du process figur sweep du process figur depict total dw mainten cost measur millisecond di erent number du broken queri detect cost small number du conclud system extra cost du process studi process studi concurr handl type concurr note appli scheme sweep concurr du measur mainten cost sc process number concurr du sc number concurr du cost sc figur process figur depict mainten cost sc measur millisecond di erent number concurr du cost ignor number data mean good strategi concurr handl cost broken queri recal mainten queri break due exist concurr sc kind broken queri du process abort sc sc process abort sc distinguish type sc break break drop previou mainten work redo extra cost dw mainten simpli rewrit queri extra cost studi cost type broken queri observ exact cost broken emploi simpl case du process abort sc sc process abort di erent environ set compar measur mainten cost updat space wont updat occur complet dw mainten consid minimum cost concurr handl cost broken queri occur measur cost figur depict total dw mainten cost term millisecond du renam du drop drop renam drop drop broken broken time broken figur cost broken queri di erent kind broken queri extra cost abort process signi reason complet abort process cost concurr handl small loss dw mainten simpli rewrit queri du mainten cost complet abort redo cost trivial mix updat process previou observ cost handl di erent concurr studi perform mixtur updat environ du sc emploi mixtur updat sc randomli gener iss vari number total updat result concurr problem figur depict total mainten cost di erent number updat result show number updat concurr problem broken queri result mainten cost appli worst case studi sc combin du discard section perform mix updat process number updat time figur mix updat process relat work maintain materi view sourc updat dw environ import issu data wareh research studi increment view mainten assum concurr algorithm maintain data sourc data updat call view mainten algorithm ev project studi problem maintain data data updat schema essenc ev automat rewrit view de nition base schema locat replac ect view compon view rewrit schema iss call view synchron view adapt increment adapt view extent view de nition ned view approach maintain dw extent limit access base relat optim multipl view mainten intermedi view common subexpress approach send mainten queri concurr problem introduc eca algorithm increment view mainten concurr data updat restrict singl strobe extend approach handl multipl iss agraw al ensur consist data larg number case compar strobe famili algorithm improv perform sweep parallel sweep materi delta iss view view asynchron refresh extent introduc interest propag algorithm signi cantli reduc number queri handl sourc schema chang system fail schema chang occur earli work studi problem dw refresh concurr data updat schema assum report schema chang wait permiss commit iss assum fulli cooper work drop restrict assumpt emploi concurr control algorithm handl concurr problem assum system resourc materi extra data work rst address data mainten problem fulli concurr data updat schema iss overcom limit previou approach handl concurr du sc drop restrict assumpt protocol dw space space rst identi ed broken queri problem dw manag concurr du sc solut framework solv problem layer queri engin level handl concurr du local correct concurr metadata map dw manag level gener execut plan concurr process newli view adapt algorithm batch mainten sourc updat natur extend framework refer el ecient view mainten data page algorithm defer view mainten page jun chen elk rundenstein transact approach data mainten technic worcest polytechn novemb rundenstein data mainten fulli concurr environ sigmod demo page santa libkin increment mainten view duplic page gupta mumick mainten materi applic ieee data engin special issu materi view ka ross adapt materi view rede nition acm sigmod intern confer manag page rao adapt materi view techniqu perform studi technic report columbia nam data wareh environ intern confer larg data page rundenstein queri rewrit intern page citi hong kong hong juli jame guido joachim subrahmanian cient mainten materi mediat view michael carei page san rundenstein virtual inform resourc run ibm centr advanc studi confer paper page novemb mohania dong algorithm adapt materi view data intern symposium cooper system advanc page decemb ramamritham materi view select mainten optim page rundenstein cv algorithm view synchron evolv inform system intern confer extend technolog page march rundenstein inform view evolut dynam distribut environ intern workshop data design olap technolog august rundenstein view mainten view synchron intern engin applic symposium page canada widom make view data wareh confer parallel distribut inform page elk andrea xin zhang maintain data chang inform sourc commun page june preserv view evolv environ int workshop knowledg meet intellig access heterogen page august lindsai roll asynchron increment view mainten page widom research problem data wareh intern confer inform knowledg page widom view mainten wareh environ page wiener strobe algorithm consist intern confer parallel distribut inform page decemb zhang rundenstein framework integr exist algorithm data mainten task intern engin applic page xin zhang elk rundenstein integr mainten synchron data cooper framework inform xin elk ding parallel view mainten concurr data updat distribut sourc data wareh knowledg septemb
HCI/1465 4 creat compel collabor augment realiti game abstract thad brad pair contextu comput colleg comput georgia institut technolog ga comput game offer uniqu market advanc concept comput human comput interact collabor work intellig technolog comput game explor young field wearabl comput augment realiti paper present develop augment realiti pattern cross martial art fight game agent implement wearabl augment realiti network game system interact base head movement input audio graphic warp system demonstr comput vision techniqu exploit intellig interfac keyword augment wearabl comput vision comput game uniqu prototyp arena interact due entertain natur user explor innov hardwar appar fluid design hope plai user interest test prototyp system advantag game plai design hide limit current implement research rapidli implement field test techniqu limit practic experi demonstr concept worth pursu game tend draw possibl consid exposur real user demonstr techniqu degrad gracefulli unexpect condit comput game excel applic work wearabl comput augment realiti construct autonom mobil pattern wireless distribut explor commun wearabl comput convinc commun equip infrastructur determin infrastructur metaphor introduc improv direct develop longer wearabl comput game game design complex weak system encourag continu iter improv rapid wearabl augment realiti network game system present attempt develop extens infrastructur line augment realiti wearabl comput game augment virtual world composit physic result obviou restrict benefit game design environ user physic surround design concentr creat virtual artifact deviat physic world game augment realiti game simpl hunt virtual flag hidden physic environ compel effect emul abil myth modern stori scienc fiction augment realiti hardwar augment give abil physic wall virtual object hear whisper great player aura avoid follow detect hidden trap system associ graphic player physic shoot envelop forc leav trail footprint effect biggest benefit result input possibl mobil proxim user wearabl comput mount camera user ey microphon user wearabl comput user user hear recogn user current wearabl adapt behavior input output modal situat techniqu ground user interfac design percept encourag seamless interfac comput begin understand user everydai mobil behavior wearabl comput observ player bodi hand lip input game player role wizard hand gestur recogn spell cast order creat system measur player heart beat plai amplifi heart beat sound time faster player warp warp system combin advanc percept interact techniqu foundat creat augment realiti game warp augment desktop augment realiti platform make extens comput vision interfac complet descript percept workbench found percept workbench warp augment desktop extend util workbench base displai devic percept workbench consist larg wooden larg glass surfac equal larg projector figur imag displai workbench project system reflect invert imag mirror mount diagon correctli displai project viewer opposit side project glass surfac unit displai stereoscop imag shutter glass workbench emploi wire glove electromagnet tracker user input warp attempt replac function comput elimin wire restrict number particip number input devic side view user ceil mount ir illumin workbench projector camera mirror ir illumin filter top view ceil mount ir illumin user projector ir illumin ir illumin camera filter workbench arm shadow figur apparatu percept workbench color camera extend techniqu initi design author ullmer ishii adapt workbench light comput vision identifi track object surfac camera vision algorithm black white ccd mount close projector light sourc mount adjac project camera system desk illumin provid ir human ey desktop project black white camera captur light filter front len camera visibl light block ir vision system displai workbench reflect ir light bottom surfac object contact comput vision system recogn track wide varieti object surfac desk user track latenc adequ context game vision system extend reconstruct object desk abil desir reason object reflect infrar bottom camera chang intens object surfac result blob darker uncov desk surfac lighter method identif recov shape network workbench user introduc share object freeli stereoscop capabl object recoveri conveni natur includ physic object virtual collabor ring infrar light sourc mount switch independ comput control camera desk record sequenc shadow object tabl cast illumin light approxim shadow polygon necessarili creat set polyhedr extend light sourc polygon intersect cone creat polyhedron roughli object reconstruct process trigger discoveri object center desk object virtual button render surfac user workbench automat switch light sourc rapid success reconstruct object reconstruct process requir complet figur show reconstruct water desk test cone error reconstruct vertic hausdorff distanc metric distanc point refer virtual button reconstruct object figur reconstruct object workbench result polygon object select rai hand icon figur recov point gestur addit color camera mount side desk figur percept workbench recoveri point gestur made user surfac gestur refer object render reach surfac desk note side camera slow gestur infrar spotlight recov arm posit switch speed light limit frame rate mobil interfac figur mobil user apparatu order creat power mobil augment warp pixel soni equip camera figur camera mount direct player physic world player hand player head posit track hand gestur watch microphon mount displai provid user voic control order maintain mobil wearabl experi wireless video transmiss player head rotat recov visual track fiduci mount wall room current warp player assum stai head rotat inform render graphic regist physic world hope registr adequ clip virtual creatur physic object room tabl figur adapt comput vision gestur toolkit develop author recogn player gestur base hidden markov system shown recogn american sign languag sign accuraci implement simpl templat match method suffici gestur recogn track hand segment color graphic sound compon current warp system creat simpl virtual environ toolkit program librari develop georgia institut technolog virtual environ group built librari support rapid implement interact world applic select replac compon user input devic poll applic compil run pc sgi platform silicon graphic hardwar platform warp system depend desir machin percept workbench machin mobil user implement figur control monster percept workbench demon game implement warp system game pit fighter direct monster magic desk fighter perform magic gestur shout attack demon mobil player put statu screen visibl user prepar start fight percept workbench overhead view fighter graphic regist physic world perspect place oppon plastic bug figur virtual game player oppon plane low plane attack type attack ant spider fli middl effect attack virtual fighter perform hand gestur combin kung fu design form attack figur demonstr gestur mind warp function part recognit indic start end gestur audio threshold suffici recogn speech recognit technolog emploi futur game correct gestur monster make death sound fall success navig monster touch player lose health point monster destroi figur show view perspect figur middl level attack gestur figur view mobil perspect game plai system author graduat student found experi surprisingli compel balanc control monster difficulti pace opposit expect workbench user team attack mobil player combin modal engag mobil player hear monster overlaid physic room respond sharp gestur futur work object track abil percept workbench futur implement desk player insert object game manipul point gestur futur test explor speed effect gestur voic input mobil desk base player paper demonstr wearabl comput augment realiti base comput vision context comput game result implement suggest potenti techniqu futur intellig interfac acknowledg author larri bill virtual environ group paul line fit code boolean set oper polyhedra solid refer simpl virtual environ librari guid gvu georgia virtual work environ ieee comput juli percept workbench submit introduct solid model comput scienc hockei proc nonparametr segment curv ieee pami american sign languag recognit desk wearabl video ieee pami augment realiti wearabl comput presenc sullivan automat model pose object recognit photograph triangular spline ieee pami collabor game augment realiti proc taiwan ullmer proc
IR/1466 5 user model aid human web assist johan depart comput inform scienc linkop sweden abstract paper explor user model work aid human assist user support system web site inform user facilit assist tailor consult individu user inform repres structur user model made assist user model approach implement deploi real web environ part user support system consult dialogu log answer questionnair particip assist initi result show assist user model consult dialogu import sourc user model data collect introduct previou research recent commerci develop highlight import web assist system web assist system user support compon ad kind web inform system electron digit home system collabor forc support handl routin user support human assist deal complex issu inform user human assist provid high qualiti support tailor consult individu user inform readili make consult dialogu save time resourc step support provid human assist user model tool kind tool present assist relev inform user consult dialogu aim paper explor feasibl user model web assist system chosen implement deploi simpl user model tool human assist studi real web environ system deploi site call focu relat art literatur voluntari assist world particip made user model tool assist user support router system assist user model tool view edit question consult dialogu answer fig overview web assist model user period week test technic feasibl studi subject opinion assist concept user model kind amount user model data collect consult web assist system overview illustr web assist model present fig user support process initi user question natur languag user question fed automat system faq item close match return potenti answer user question user find return answer support router connect user human assist match topic question assist user wait queue assist user connect assist proce consult dialogu textual chat user model inform user store predefin attribut overlai style attribut structur defin cooper expert artist writer member user model displai assist consult dialogu start assist make inform model tailor consult individu user automat infer perform data user assist free make infer part interpret user data assist updat model fill attribut valu base learn consult dialogu user field studi result object work web assist system explor kind system applic field studi natur research method period user regist support user work system consult dialogu assist collect data paper result questionnair particip log text chat consult dialog place inform field refer present complementari result questionnair user assist usabl web assist system questionnair assist user model tool directli period questionnair question tool process work tool respond express agreement disagr statement scale textual explan quantit answer total assist respond complet fill questionnair rate roughli main result assist find user model tool disregard score assist assist user inform standard deviat tool tool initi analysi consult dialogu log consid circumst user model inform circumst identifi count occurr user inform possibl user task occurr circumst main result analysi assist import role plai gather person inform user approxim half user inform direct question assist remain case user volunt person volunt inform background inform problem descript piec user inform consult dialogu refer johan role human web assist analysi usabl studi internet electron network applic johan collect exploit expert knowledg web assist system hawaii intern confer system januari johan empir studi human web implic user support web inform system chi confer human factor comput page stephani jennif sandra carberri recogn util user prefer collabor consult dialogu fourth intern confer user page
IR/1467 5 common hypertext link identifi phrasal descript target web document amitai languag technolog group microsoft research institut school nsw australia csiro mathemat inform scienc lock bag north nsw australia abstract paper describ previou work studi compar distribut word web document distribut word flat text base find studi suggest tradit ir techniqu web search text articl base describ document descript model exploit valuabl anchor text inform provid web tradit techniqu problem amitai corpu analysi web page lexic distribut document written web significantli lexic distribut observ corpu english languag british nation corpu web document collect html file verb determin word html word web english languag collect studi found web convent peopl write number word describ target document anchor text linguist convent word sentenc list previou work solut section describ previou suggest solut problem find inform account structur addit provid web author solut present chronolog order interest note solut reli inform provid author web page link anchor paper suggest inform anchor link studi chosen order show past trend inform frei describ semant content hypertext link retriev present index algorithm make document text link content content link mark semant link mark textual content relat mcbryan suggest search perform refer compon url string system index url anchor titl page titl target page contextu weiss al combin link structur textual inform search perform singl document higher level collect gener link cluster search perform label cluster gradual document level synonym inform ad label frequent term cluster label filter implement document consid similar share similar link link similar document al combin text content natur web structur find queri term relat imag found text immedi surround imag page point page imag search text surround imag node kleinberg present exampl word queri found relev found netscap found microsoft author make link pointer comput hub author point author text present difficulti search techniqu approach suggest base cooccurr link link larg collect link index problem queri term exist suggest search spatial hub author kind semant network connect frequenc term defin observ hub page tend higher occurr term topic defin good indic anchor descript target page hub larg collect link brin page page al reli link structur link text provid inform make relev judgement qualiti filter associ text link page link page link point claim anchor provid accur descript web page page anchor exist document index search anchor propag notion anchor text provid qualiti result chakrabarti al introduc notion text href link point page descript content page text descript topic occur text href point page good reinforc belief page author topic assum string typic text yahoo close studi test set web page drawn web distanc nearest occurr href page result suggest occurr byte href qualit similar experi href yahoo suggest similar result output system word anchor rank sourc page anchor model present search result data provid web user work part phd outlin model solut suggest result publish section describ idea motiv amitai find consist linguist behaviour web author write word anchor model make descript provid author creat collabor descript tool web page larg collect document place case hypertext link link consist url address visual cue phrase imag physic distinct surround environ web document point find similar point anchor comparison formul relat link target document formul relationship improv automat web understand peopl construct web document anchor word insight peopl prefer link provid short phrase sentenc provid hint found target page short descript target page prove compar anchor point document extract anchor web document document point provid valuabl inform content target web document method mention outlin idea hope publish result coupl month stage implement algorithm list system top exist search engin web brin page system present result engin return found document short descript gener anchor point stage collect list url anchor point target page collect map document spatial relat stage compar word anchor point target phrase overlap inform inform provid syntact australian tourist australian tourist inform australia tourist site australia australian site australia australia australian tourist inform info australian info australian oz australia tourist inform australian guid trip photo place australia inform contact stage measur word chosen anchor target document bursti algorithm smith salton stage process find anchor predict topic keyword detect ir algorithm order find descript involv anchor creat longer shorter australian tourist australian tourist inform australia tourist site australia australian site australia idea algorithm work studi detail peopl write web document continu research trend make direct inform provid peopl write web web author dedic hour dai time present tailor document time inform term statist refer amitai import msc centr cognit scotland technic report brin page anatomi hypertextu web search engin seventh world wide web confer special issu journal comput network isdn volum issu chakrabarti dom gibson kleinberg raghavan rajagopalan automat resourc list compil hyperlink structur text intern world wide web special issu journal comput network isdn volum issu frei make hypertext link retriev inform acm confer hypertext acm pp sanderson md imag retriev hypertext link kleinberg authorit sourc hyperlink symposium discret algorithm ibm research report rj mcbryan oa tool tame web intern confer world wide web geneva australia tourist inform australian guid trip photo place australia inform contact page brin motwani winograd pagerank citat bring order web smith amitai detect subject boundari languag independ approach confer empir method natur languag brown usa salton bucklei approach automat text retriev inform process salton mcgill mj introduct modern inform retriev weiss sheldon duda gifford dk hierarch network search engin exploit hypertext cluster seventh acm confer dc
ML/1468 6 speed relat reinforc learn increment order tree learner kurt jan ramon hendrik blockeel depart comput scienc kuleuven belgium abstract relat reinforc learn learn techniqu combin standard reinforc learn induct logic program enabl learn system exploit structur knowledg applic domain paper discuss improv origin introduc fulli increment rst order tree learn algorithm tg integr algorithm system form demonstr perform gain similar experi demonstr behaviour origin system introduct relat reinforc learn learn techniqu combin reinforc learn relat learn induct logic program due express languag repres action relat reinforc learn potenti appli wider rang learn task convent reinforc learn relat reinforc learn structur abstract speci goal exploit result previou learn phase address situat concept introduc de raedt section focu detail shortcom origin implement improv suggest consist fulli increment rst order tree algorithm base algorithm chapman kaelbl start discuss implement origin system introduc discuss integr form overview preliminari experi compar perform origin system discuss characterist assign pair exampl empti set true gener episod consist state action action state standard current hypothesi qe gener max exist replac add exampl updat qe tild produc exampl action ak state state action pair ak optim gener ak gener ak updat pe tild produc exampl ak fig algorithm relat reinforc learn consist learn task rst classic algorithm extend relat regress algorithm repres logic regress call gener describ optim action describ pair part optim polici repres logic call inform logic tree cation found origin implement figur present origin algorithm logic regress tree repres built start knowledg base hold correct exampl action triplet gener exampl tree start run normal episod standard reinforc learn algorithm store action encount temporari tabl end tabl ad knowledg base tree induct phase predict gener tree calcul gener scratch exampl gener deriv obtain state system encount investig action classi es action optim predict learn classi cation state action input build algorithm note exampl knowledg base time delet avoid exampl knowledg pair encount knowledg base replac hold updat problem origin identifi problem origin implement diminish perform track amount di erent pair encount pair encount replac mean knowledg base replac tree built scratch episod replac increasingli time set exampl grow nal point leav tree identifi cluster updat pair pair leaf automat origin exist updat moment pair pair leaf improv solv fulli increment induct algorithm algorithm reliev tree data increment algorithm gener reinforc learn wrong begin algorithm handl appropri algorithm doesnt requir exampl elimin inform elimin replac exampl knowledg base fulli increment problem store di erent similar distinct pair solv section introduc increment algorithm tg algorithm learn algorithm extens tree learn algorithm updat theori increment exampl ad import featur exampl discard process avoid huge amount memori store exampl high level figur store current leaf node statist test split leaf time sort tree test intern leaf statist test updat creat empti leaf data split data leaf updat statist leaf split grow empti leaf endwhil fig exampl gener simul reinforc learn strategi tupl extend rst order logic extend algorithm relat languag describ exampl test tree advantag model exampl store proposit model featur space theori case block world limit number problem tractabl smaller number featur relat languag construct featur block block provid featur block relat languag structur featur space treat construct test nement oper detail descript part system found fig logic tree figur logic tree test node read existenti quanti ed conjunct liter node path root tree node statist leaf consist number exampl test sum valu sum squar valu predict leaf store obtain statist test split parent leaf creat updat exampl sort leaf statist sucient comput test signi varianc exampl reduc split node test node split minim number exampl collect test signi high con denc contrast proposit track nement task proposit case set candid queri consist set featur minu featur test higher tree rst order set candid queri consist wai extend queri longer queri variabl larger number wai bind variabl larger set candid test larg number candid test store ecient aim queri pack mechan introduc queri pack set similar queri structur common part queri repres structur set conjunct repres term yield signi gain practic constant branch factor store pack queri length memori execut set queri structur pack exampl requir time execut separ empir comparison speed pack section store queri pack requir memori pack leaf node similar node pack leaf node origin pack node left add test introduc variabl case queri pack left leaf node equal pack origin node chosen test queri pack dicult case test ad introduc variabl integr remov call tild algorithm tg adapt experi form solv problem mention section tree longer gener scratch episod tg store statist exampl tree refer exampl insert rememb search replac exampl reliev tg begin leaf complet empti exampl limit life span exampl delet exact pair encount bia increment algorithm theori learn tg algorithm search hypothesi space tg misl begin due increment limit qualiti approxim experi section compar perform origin system comparison system dicult implement number rst order regress techniqu limit full comparison rst order regress scope paper rst experi origin test block world di erent stack block stack speci block block oor stack state set action block block oor goal reach block stack goal block oor goal stack speci block reach fact part state note learn stack speci block substitut block rst type learn block gener strategi goal learn polici learn vari number block discuss experi studi converg behaviour sensit algorithm paramet fix state space number episod stack stack stack number episod number episod fig learn curv xed number block experi xed number result shown figur gener polici test randomli gener exampl reward reach minim number step graph show averag reward episod indic gener optim polici compar origin number episod algorithm converg correct polici larger explain characterist system origin system automat correct mistak gener tree start system mistak make root tree due faulti gener begin ad extra branch tree fact paramet ad speci es number exampl led leaf split factor overhead correct mistak delai put split leav system converg slower number episod compar time result system outperform ad number episod tabl compar execut time time system origin run experi state space block quickli imposs learn minut learn converg stack goal tabl execut time algorithm sun ultra machin block block block origin stack min min min min state state min state state stack sec sec sec pack min min min min min min stack sec sec sec pack sec sec sec min min min vari state space strategi cope multipl start learn smallest expand number learn episod strategi work origin system exampl knowledg chang exampl previou gener appli strategi rst gener tree small chang larger expand tree state complet forget learn ad branch make test origin tree di erent er di erent episod exampl split leav di erent experi block vari number block learn make exampl spread set minim number exampl split leaf bit higher xed requir higher number episod converg episod start note depend presenc good increment tree learn set start build time suboptim split insert begin due increment natur learn suboptim split remov end lead complex tree learn slowli start reason number ect necessarili remov continu parallel averag reward number episod stack var var var fig learn curv vari number block start episod figur show learn curv di erent goal gener polici test randomli gener exampl number block vari rst part curv polici gener perform episod test result base graph visibl sudden drop perform back learn curv start converg fast perform level qlearn attain longer test unseen deriv jump accuraci phase stack block pure disappear start model encount accur gener point time shown figur tree repres correct accid lead correct polici stack number block larger repres repres optim polici anymor fig stack episod algorithm converg goal perform origin due fact learn episod minim sampl size decid explor behaviour algorithm respect delai paramet speci es minim sampl size tg split leaf test ect minim sampl start total episod start episod vari minim sampl size exampl ran test goal figur show learn curv di erent tabl show size result tree episod start averag reward number episod fig learn curv vari minim sampl size episod algorithm converg sampl size exampl optim reach algorithm make mistak reli small set exampl test sampl size slower converg optim polici sampl size dip learn curv chang learn size gener obviou gener polici bene larger minim sampl cost slower converg experi smaller minim sampl size correct earli mistak build larger succe gener optim polici tabl gener tree size vari minim sampl size conclud remark paper upgrad algorithm chapman kaelbl greatli improv speed system present studi converg behaviour respect minim sampl size tg split leaf larger sampl size slower converg smaller function plan appli algorithm game studi behaviour complex domain block world futur work includ investig possibl work rst order neural network bayesian network provid altern work improv tg algorithm includ multipl tree repres attempt amount memori work automat moment start optim minim sampl size uenc size gener polici converg speed acknowledg author luc de raedt mauric bruynoogh suggest work jan ramon support flemish institut promot scienc technolog research industri hendrik blockeel fellow fund scienti research refer blockeel de raedt induct rst order logic tree arti cial june de ramon induct cluster tree intern confer machin page execut queri pack ilp intern confer induct logic volum lectur note arti cial page juli springer david chapman lesli kaelbl input gener delai reinforc algorithm perform intern joint confer arti cial de relat reinforc learn machin moor reinforc survei journal arti cial intellig de raedt bayesian logic program tenth intern confer induct logic work progress langlei element machin learn morgan mitchel machin learn sutton barto reinforc introduct mit
DB/1469 3 evalu function join nest refer set reinhard jen kemper fur universitat germani abstract previou work function join constrain approach assum refer implement physic object identifi approach limit refer attribut sever limit system support nest refer set object system implement refer oid develop function join algorithm realiz form oid gear support function join nest refer set algorithm appli evalu join arbitrarili long path express includ refer set algorithm gener pointer join repeatedli appli partit interleav evalu function join algorithm term stand partit denot merg prototyp implement analyt assess base cost model prove algorithm perform superior configur work support part german nation research foundat dfg contract ke ke permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb confer introduct refer kei concept system refer directli object effici navig limit queri process huge number refer evalu function join naiv pointer chase techniqu yield competit perform research investig advanc pointer join techniqu optim function join approach materi function join form gener join indic index path access support relat systemat approach materi function join arbitrarili long path augment join index hierarchi exist systemat evalu pointer join techniqu hash comparison join work augment parallel system nest set report group nest set perform function join incorpor kei idea pointer join starburst extens system emphasi work support hierarch hidden pointer concentr find optim evalu order chain function join complement algorithm effici evalu function join queri engin concern find evalu order previou work function join constrain approach assum refer implement physic object identifi approach limit refer attribut vere limit objectori system support nest refer set model object associ object system implement refer oid develop function join algorithm realiz form oid gear support function join refer set algorithm appli evalu join arbitrarili long path express includ refer set algorithm gener pointer join repeatedli appli partit interleav evalu function join algorithm term stand partit denot merg technic motiv work simplifi applic schema model relationship order order product natur model nest set order creat type order quantiti creat type product cost order refer order product nest set refer attribut order relat type store order object queri retriev order total select order queri start order nest set refer order product retriev cost total cost order comput note unlik pure relat nest set constitut explicit group belong order maintain physic level algorithm exploit physic maintain group avoid danger inher naiv nest loop pointer chase approach prototyp implement analyt assess base cost model prove algorithm perform superior configur perform small memori size paper sql syntax close commerci ordbm product comparison commerci ordbm product obei standard length limit prevent show standard odmg object type oql queri similar remaind paper organ section give short overview physic logic oid realiz techniqu section overview algorithm introduc section explain integr algorithm queri engin initi perform comparison section present perform analysi base cost model compar algorithm configur section conclud paper realiz object identifi object ident fundament concept enabl object referenc system object uniqu object identifi remain unchang object life time basic implement concept physic oid logic oid physic object identifi physic oid part initi perman address page identifi base object directli access data page direct access facil advantag long object fact store address updat object move page place holder store origin locat object hold address object move object page origin page forward page carri object number perform dbm gradual point make reorgan inevit objectstor illustra exampl commerci system physic oid logic object identifi logic oid object address locat independ find object addit map structur requir map logic oid physic address object object move entri map structur updat describ data structur map give detail perform comparison map logic oid serv kei access tree entri actual object address figur letter repres logic oid number denot physic address object object identifi store address simplifi real system address direct map figur map techniqu page identifi locat page tree root larg set sort logic oid sequenti scan leav shore system emploi oid map map hash tabl logic oid kei hash tabl lookup find map entri carri actual object address figur implement oid map hash tabl direct map logic oid constitut address map entri turn carri object address logic oid index vector map inform direct map immun hash requir singl page access figur logic oid store explicitli higher storag densiti achiev direct map system function join algorithm subsequ discuss algorithm base simpl abstract creat type data creat tabl creat type attr data creat tabl queri discuss select rr select rr ss attr note queri side standard sql nest queri return set tupl ordbm product support oql queri slightli algorithm naiv algorithm pointer chase algorithm scan refer store nest set individu logic map obtain address referenc object access combin size map exce memori capac algorithm perform poorli system emploi physic oid naiv algorithm perform lookup map access page physic oid refer reveal object move page forward pointer order retriev object algorithm perform poorli size exce memori capac algorithm flatten attribut partit sort flat tupl achiev local logic oid evalu plan denot unnest oper replic object replac attribut attribut nest oper form attribut attr function join denot argument join partner argument perform function join map techniqu appli achiev partit sort partit flatten tupl partit partit refer partit map replac logic oid address obtain map tupl partit function join sort flatten tupl map lookup tupl sort attribut function join sort address object final oper evalu group flatten tupl base oid origin object group algorithm physic oid evalu plan omit function join map join join plan assum object note plan equal applic logic physic oid realiz object refer compar adapt retain group flatten tupl arbitrari number function join achiev interleav partit merg order retain group intermedi partit step captur notat describ basic appli evalu singl function join logic oid intermedi longer function join chain evalu section join join map replac logic oid physic counterpart result join evalu join adapt hash join algorithm probe input join logic oid replac physic call phase unlik origin hash join probe input explicitli partit build map fault buffer rang partit load explicitli buffer partit step map involv addit disk requir success step visual flatten partit join map obtain rm partit rm rm partit join merg flatten object partit appli map logic physic partit result initi partit perform join final merg partit restor group flat tupl belong object partit function hm ffl hm partit map chunk map logic oid partit number ffl partit chunk map address object partit number simplifi assum partit requir algorithm work map partit partit mn sk partit function appli map logic oid store nest set physic rm appli map algorithm perform flatten nest partit flat object denot rn object gener flat tupl insert tupl partit hm hm attribut data replic suffici includ flat tupl leav end section partit written disk ffl partit initi empti partit denot rm rm ik gener ffl scan element replac logic oid physic counterpart obtain partit map insert tupl partit rm note oid map perform step concern partit prefetch fault buffer complet step partit rm rm rm disk ffl scan partit rm simultan merg singl tupl stream merg restor group flat tupl merg gener tupl stream ffl tupl function join perform object locat relev retriev insert tupl partit rm object referenc step belong partit prefetch fault partit ensur entir fit memori complet step partit rm disk scan partit rm simultan flat tupl nest group tupl oid ig ig ffi oid map oid rm rm rm rm merg merg ffi oid attr oid attr rm rm merg ffi rm oid attr figur applic denot lookup function handl addit attribut data note write disk gener partit probe input applic gener partit appli partit obtain join intermedi partit subsequ merg partit partit kei idea algorithm group flatten tupl preserv partit step partit function hm observ immedi distribut object partit appli map destroi group retain partit respect induc basic section cpu cost lower basic involv flat tupl object sequenti order happen partit tupl room optim base retain group applic algorithm section figur show concret applic partit step tabl rm rm label disk symbol temporari partit store disk start tabl object logic oid addit attribut omit attribut set refer process step flatten set partit stream flat tupl partit function hm map dg partit ig partit process step start read map logic oid attribut object address portion map map explicitli step partit tupl stream partit function map partit partit result partit rm written disk process continu partit tupl partit rm partit partit essenti preserv order flat tupl belong object subsequ merg scan partit parallel order partit partit function join step skip finegrain partit partit partit rm partit preserv order tupl phase start merg rm rm simultan object refer tupl fetch rm object address dereferenc request attribut written partit rm tupl process partit rm retriev rm object address yield tupl partit rm flatten tupl belong rm rm merg continu partit rm rm rm rm merg yield singl partit rm final partit rm rm merg form result rm flat tupl nest form attribut aggreg nest attr valu request carri final merg physic path express repeatedli partit unnecessari system emploi physic oid intermedi join map simpl case function join variant appli queri longer path express queri group custom set manufactur order select custom assum addit type custom manufactur attribut custom refer nest refer set order manufactur referenc product refer attribut queri determin custom aggreg order select sum custom concentr manufactur queri evalu plan physic oid logic oid outlin figur plan unnest oper flatten compar differ higher number function join map logic oid assum map map plan base physic oid draw profit interleav step base logic group custom order retain success function join final group oper realiz plan fine point fine point design address pm pm custom order product manufactur pm pm pm pm pm custom order map product manufactur figur manufactur queri physic logic oid obtain order algorithm requir order tupl merg iter compar tupl rm rm figur determin order origin order kei addit sequenc number insert step merg step note flatten tupl object assign sequenc number map access partit phase map techniqu account partit function hm achiev rang partit favor direct map hash tabl map differ rang partit partit highlight partit rang partit rang partit page partit individu fault disk access vicin demand rang partit prefetch entir partit transform random chain prefetch reason page map access perform oid map tem map share object type prefetch reason achiev rang partit direct map simpl rang page map logic oid page identifi slot page hash tabl map scheme hash function appli logic oid hash valu page rang partit map scheme prefetch partit feasibl page partit physic adjac typic case dynam growth oid sequenti gener built adjac leaf page physic adjac access similarli partit step map rang partit benefici partit step access data structur cluster queri engin knowledg physic organ partit function access achiev rang partit page store access object belong partit local fault individu page rang partit prefetch larg chunk sequenti full unnest retain set algorithm flatten attribut attribut fulli unnest feasibl set intact partit oper split set subset element belong partit object tupl partit tupl nest set refer belong partit partit oper complet set input partit tupl tupl attribut refer figur object split partit approach avoid multipl flat tupl object benefici larger set small partit distribut refer set requir higher implement effort queri engin offer variant partit iter capabl split nest join iter iter element nest set queri briefli section capabl process nest set project attribut attribut request sever inflat amount data written time partit file reduc measur replic attribut flatten unnecessari attribut written algorithm retain order attribut project merg final result contrast join standard attribut fact result order attribut simpli handl stream merg oper scan high select bulki attribut qualifi object save temporari segment initi scan final merg earli aggreg aggreg request result set addit aggreg fold appli subgroup belong object written rm result storag save rm final intermedi aggreg result combin easili achiev aggreg count constitut commut monoid oper satisfi associ ident avg inform maintain enabl earli aggreg buffer alloc algorithm consist consecut store intermedi result disk simplifi buffer memori queri alloc current phase phase easili deriv figur delimit set partit rm rm store disk phase initi process end set partit map dereferenc final merg phase major amount memori alloc cach map small amount alloc input output buffer partit algorithm modest memori phase requir costli toler small main memori size algorithm easili degrad main memori scarc comparison size proof concept compar evalu implement queri engin section outlin implement describ perform measur queri engin assess base cost model section queri engin base iter model implement figur outlin implement dash box iter basic function join process start scan appli option select predic project unwant attribut kei flatten unnest oper yield tupl attribut partit iter partit input partit base partit function hm introduc half iter scan partit time pass tupl function join probe logic oid map replac address partit size partit function hm chosen depend oid map techniqu map lookup evalu memori section join output directli fed partit oper time physic store serv partit input partit obtain prior join split output partit yield total partit store disk dot arrow symbol commun channel start set partit time input partit complet process partit partit refer partit object merg match initi yield partit output merg oper partit turn join join result written partit file oper call final partit merg form singl output stream project attribut final cheapli inform final merg simpli ad temporari segment project data merg stream merg oper aggreg perform note order result group kei aggreg function comput benchmark setup benchmark perform sun sparcstat run solari held aggr merg mk cach fold rm partit merg partit fold rm map partit scan partit figur oper system disk disk temporari file order avoid side effect file system direct option turn file access ensur file access system disk satisfi os file system cach import experi small write result tupl suppress relat buffer cach segment configur optim estim individu queri plan run time total amount cach queri exce mb time direct map emploi resolv logic oid restrict queri aggreg section queri final aggreg oper replac group oper object complet group attr conserv singl aggreg algorithm requir explicit algorithm retain initi group suffer larger result evalu queri commerci relat dbm extens creat type tabl section refer constrain point singl tabl scope queri crash hour dbm error prohibit identifi product jrj jsj page page small larger map page object size object size small larger tabl cardin initi fall back smaller order result comparison cardin small larger tabl refer distribut uniformli full extent instal faster machin cpu clock higher faster configur mb setup commerci pure relat refer nest set refer set omit addit tabl rs creat implement associ rs tabl jrj row lack tabl extend addit integ attribut kei tupl size byte smaller tupl size comparison object size byte due miss nest refer set pure relat schema tabl rs attribut rs rs serv foreign kei yield result select rr rs rs ss kei rr kei group rr rr data comparison measur run time creat tabl prototyp oodbm implement algorithm previou section plan cheap aggreg algorithm calcul emploi group retain hash aggreg initi group destroi partit plan implement hybrid hash join build input optim section set retain full rang partit appli access bulki data attribut project final step tabl overview observ run time algorithm predict cost model section shown run time queri base schema section nest refer set pure flat relat schema addit tabl rs join perform small build input project oid attr cheaper final hash aggreg addit cost occur plan larger longer complet build input memori perform hash aggreg compar run time naiv perform gap order larger absolut run time naiv algorithm amount requir minut outperform drastic naiv pointer chase algorithm flatten plan suffer high cpu cost sort small run file due restrict amount memori commerci show perform naiv algorithm queri flat relat schema reason run larger spite faster host analyt evalu develop cost model vehicl broader analysi cost model cpu oper assumpt base cost model extens deal attribut algorithm due space discuss individu formula cost formula model disk mean differenti transfer time grasp differ sequenti random influenc transfer block size model cpu includ oper major influenc cpu buffer manag iter call state base larger tabl default configur chosen mb memori logic oid resolv direct map label plot construct describ access method part describ access extent access method partit directli chase individu partit small larger method cost commerci cost commerci prototyp model ref set flat rel ref prototyp model ref set flat rel ref naiv tabl run time mb avg direct memori nn ns ss pp figur cost model result larger select object nn build build figur select mb refer object nn ns ss pp figur vari cardin mb direct merg sort hash join fit classif simpli label vari memori size run time algorithm vari memori size report figur nn plan pointer chase map lookup dereferenc show plot due run time hour mb hour mb buffer ns queri naiv map sort physic oid access compar ns sort flatten tupl map lookup pai map smaller mb mb plan rang curv small memori configur merg sort variant suffer high cpu cost sort partit plan pp yield significantli perform plan small memori size perform advantag partit sort small memori size due larg number run file gener sort hash join perform costli compar winner omit partit step show poor perform small memori size mb plan run time partit map access coincid impress result curv toler small memori size algorithm degrad vari select figur percentag object part function join vari axi small number page map hit page referenc expect point naiv algorithm high select run time refer overhead induc naiv algorithm quickli degrad number refer map plot hash join build input variant full select small number object due fix cost hash join hash naiv plan vari set cardin previou number element constantli figur show run time algorithm set size algorithm scale run time explod flatten variant behav poorli naiv plan suffer enorm amount random calcul run time roughli hour flatten plan suffer larg temporari file memori figur inflat oid map vari memori size memori figur pointer direct map entri memori dm bt ht figur comparison oid map inflat oid map assum distinct map object perfectli cluster analyz behavior algorithm cluster oid occur global oid map small fraction select oid map inflat insert distribut page million entri queri run standard object element amount memori legend figur size map smallest symbol denot configur figur map optim cluster larger plan show slight run time inevit higher number access larger map map page fetch disk number partit partit step adapt partit map cach memori cope larger map induc enorm number page fault long map fit memori figur compar hash join extrem attribut refer averag map inflat million obsolet number object remain setup favor hash join map hash join draw profit larger amount memori larger scale project serv build input hash join memori larg memori configur join oper load page entireti memori extent ca mb fit addit memori avoid partit step flatten written disk partit compar oid map techniqu figur compar oid map techniqu discuss section combin hash tabl map show perform step step occur memori mb mb scan merg oper reach optim amount memori step occur omit partit phase oid map structur complet cach memori total size smaller hash point reach smaller memori size bt curv bt gener due higher cpu cost tree lookup direct map approach partit step omit memori size mb due compact map compact storag map reduc total number call cpu overhead singl map lookup cheaper dm map techniqu logic oid comparison physic oid assess algorithm scenario logic oid turn physic oid simplifi algorithm extra map lookup oper omit algorithm partit sort partit hash join independ underli oid realiz figur includ plan logic oid realiz direct map naiv plan show plot rang hour run time partit plan similar hash join queri perform significantli pm plan perform slightli plan logic due prefix compress special split procedur entri page hash tabl pm figur physic oid logic oid direct map forward pm figur effect forward oid addit cost map lookup low level mb memori pm plan cheaper physic oid advantag incur sever perform penalti presenc forward creat vari percentag forward refer extent figur show plan fairli robust high cost forward object consecut multipl hit forward object plan plan alloc addit page load forward object plan alloc buffer partit forward pm behav similarli line retain advantag plan logic oid shown low level forward refer logic oid superior physic oid futur work relationship typic repres nest set separ relat pure relat model queri nest refer set requir retain implicit group set refer paper develop algorithm base success partit merg algorithm retain group partit restor group merg oper prototyp implement quantit assess base cost model proven algorithm superior method kei idea consist retain order nest refer set multipl function join idea applic pure relat schema preserv order regular join investig futur refer bertino kim index techniqu queri nest object ieee tran knowledg data high perform configur storag manag proc ieee conf data page editor object odmg morgan kaufmann san shore persist applic proc acm sigmod intl page increment join attach starburst proc vldb page august mehta join techniqu proc intl ieee conf parallel distribut inform san januari kossmann perform evalu oid map techniqu proc vldb page septemb tang select path express process algorithm proc vldb page septemb scholl queri evalu calculu algebra coincid proc conf jul graef queri evalu techniqu larg acm comput june shukla seek truth ad hoc join cost vldb harri ramamohanarao join algorithm cost revisit vldb system technic summari metro mn usa copeland object ident proc acm conf program system languag page novemb kemper moerkott access support object base proc acm sigmod intl page atlant april objectstor system comm server concept manual oracl versail franc technic overview juli accur model hybrid hash join algorithm proc acm page santa shekita carei perform evalu join proc acm sigmod intl page atlant schek scholl relat model attribut inform stonebrak great wave morgan kaufmann san valduriez join indic acm tran june object technolog octob xie han join index hierarchi support effici navig proc vldb page septemb
HCI/1470 4 visual mediat interact model jonathan howel buxton june issn cognit scienc research paper visual mediat interact model jonathan howel buxton school cognit comput brighton uk abstract paper report initi research support visual mediat interact develop gener express model gener gestur model control activ camera investig recognit head pose express simpl train gener model radial basi function network describ variant network evalu perform simpl point wave hand gestur imag sequenc result present show high level perform gestur recognit obtain individu set individu characterist visual evid automat select individu depend task demand introduct paper report initi research support visual mediat interact develop gener express gestur model model intent activ camera describ adapt learn techniqu develop model robust track object human bodi difficult due rapid ambigu segment model match ongo research mit media lab shown progress model interpret human bodi activ simpl approach action recognit similar attempt made microsoft research system attempt intent track model control activ camera visual mediat interact previou work camera control base execut script set defin camera action system fix wide angl camera virtual window control model exploit set gestur reactiv visual control interpret user intent live control activ camera adapt view direct attent focu point wave import delib control reactiv camera movement provid visual context applic group autom studio direct grow interest human gestur video nonverb modal interact main approach involv comput featur motion form tempor trajectori track hidden markov model dynam time warp explor potenti simpl differ video sequenc conjunct power connectionist learn paradigm account variabl set predefin gestur adapt learn compon base rbf identifi valuabl model wide rang research main advantag comput simplic robust support mathemat theori studi video sequenc recognit point wave gestur involv rbf provid fast train perform interact requir applic activ camera control main paper show fast train recognit gestur express present result show high level perform type gestur recognit obtain techniqu individu set individu characterist visual evid automat select individu depend task demand rbf rbf model rbf network hybrid learn network combin layer hidden output unit layer input hidden unit network model individu radial gaussian function hidden simul effect overlap local tune recept field dynam neural network construct ad recurr connect standard perceptron form contextu memori predict time partial recurr neural network train problem stabil long train sequenc dynam altern neural network model incorpor concept order process tempor combin data fix time singl vector fig successfulli appli speech handwrit recognit task structur design reduct trainabl paramet fulli connect model simpl mechan ad rbf term network robust solut difficult problem origin network construct rbf train combin idea slide input window standard network train procedur ad adjust rbf unit requir appli simpler success previou work rbf network rbf unit train simpl process calcul weight integr layer rbf unit input unit time fig structur singl class network time window integr window express pose experi data standard weizmann test ident standard rbf network presenc express pose variat illumin condit constant test peopl imag head pose ffi ffi ffi ffi ffi correct column show raw rate rbf network adapt measur shown power method improv remov ambigu result discard column classif discard correct discard show final rate result output express invari experi ident recognit imag establish abil rbf distinguish data term ident class move train network class tabl show train test imag class earlier test pose invari face recognit select train data pose variat found data person exampl ffi ffi ffi test ffi ffi approach shown provid good level pose invari train rbf focu express variat data check express invari train exampl neutral express express invari train exampl express tabl test perform rbf network train classifi imag weizmann initi discard correct correct discard tabl rbf network provid good ident express variat explicit exampl variat train class harder network invari pose compar result error rate report major differ collect knowledg viewpoint express individu train extrapol strength rbf larg improv perform extra train exampl class provid discard measur ambigu result effici shown high classif rate correct discard column classifi express pose addit identifi develop network specif task weizmann train rbf network classifi imag term express pose regard ident imag number individu train exampl express class head pose class column show train test test train exampl total express class pose tabl show result obtain type network head pose class easier tabl test perform gener rbf network train classifi express head pose imag type class initi correct correct discard discard express head pose express class fail give good result larg number train exampl due express requir higher resolut data discrimin head easili identifi low resolut imag summari initi test weizmann show simpl rbf classifi develop static recognit task parallel give rang inform current frame live video input clear improv high level error rate gestur experi tempor gestur recognit imag sequenc simpl experi made network learn behaviour base axi head rotat distinguish movement static head pose network shown maintain high level perform test data individu train task simplifi constant arbitrari short segment sequenc identifi direct head turn address complex point wave hand due complex motion characterist part complet action time window present network order gestur context activ camera control concentr specif behaviour move camera adapt field interpret request pass camera implement zoom pan point interpret request camera implement pan zoom type give gestur shown tabl tabl definit gestur gestur bodi movement behaviour point hand left left point hand wave hand head wave wave hand head wave collect exampl gestur sequenc sequenc imag collect roughli total imag imag sequenc result collabor project gong queen mari westfield london stephen mckenna research face detect track standard rbf network shown work imag sequenc face recognit task specif interest area motion frame differenc previou pixel current frame pixel previou frame discard fig count number pixel retain frame process segment gestur simpl threshold signal frame number chang fig frame threshold discard align start point gestur sequenc pad end nil valu length longest gestur give equal length sequenc integr layer network combin result success time give smooth serial action sequenc reli tempor segment give singl frame posit classif arrang gabor filter preprocess differenc data sampl scale orient sine cosin compon total coeffici frame gestur result tabl result obtain experi split separ train test sequenc column show actual number sequenc part experi correct column show raw rate discard column classif fig differenc consecut frame result hand gestur fig imag sequenc differenc frame previou hand demonstr type variabl present singl subject start frame automat determin frame end frame subject start frame end frame discard correct discard show final rate result output gestur model creat train test data individu sequenc person separ turn distinguish class learnt tabl list result train averag set data show task learnt extrem train gestur provid exampl reduc number indic effect separ gestur class network tabl averag result gestur train test gestur sequenc singl train test gestur sequenc train gestur sequenc test gestur model initi discard correct sequenc correct discard gener gestur model combin data peopl network group train test distinguish class learnt result tabl slightli final result lower level train exampl gestur gener gestur model test network singl gestur peopl gestur effect absenc class network exampl person test tabl pattern previou test train exampl network learn classif task person effect data higher discard rate previou experi abil potenti specif peopl appli gener data improv peopl train combin gestur ident model final test identifi ident gestur class learnt tabl result test compar result tabl proport test data correctli classifi postur form addit evid face recognit applic tabl result train test gestur sequenc ident gestur initi discard correct sequenc correct discard discuss berthold integr layer cope shift scale event discuss cope speed movement start frame gestur variabl speed variat handl recurr train data explicitli demonstr class speed simplifi result integr layer test stage movement effect identifi start end point robust gener scene person anticip ad integr layer improv extra variat start point test sequenc iter applic success give extra contextu inform identif observ point effici rbf classifi develop static recognit express pose straightforward preprocess techniqu frame differenc threshold effect extract motion inform tempor segment gestur type network gestur model train recognit specif time train test person train test group train test peopl network shown distinguish arbitrari high level benefit integr layer tempor segment singl time window appli consecut posit characterist individu express gestur suffici distinct identifi person rbf network show perform gestur recognit creat gener gestur model result rbf techniqu high potenti present highli constrain interpret predefin gestur individu aim develop evalu user behaviour model base tempor predict continu pose gestur chang user minim awar system aim estim predict essenti bodi paramet head point wave gestur express model essenti order provid behaviour interpret predict import note attempt model full work human bodi aim exploit approxim effici rbf support partial suffici peopl express gestur dynam scene avoid unnecessari comput cost dynam scene interpret exist recurr network model long time simpl rbf network provid fast effect method identifi arbitrari behaviour main problem altern strategi learn behaviour model difficult classifi behaviour evolv speed singl solut problem requir subdivid behaviour fast slower version merg stage behaviour analysi flexibl turn advantag practic intent forc fast point action slower action plan explor full gener rnn gener behaviour control learnt increment exampl rbf individu intent control learnt rapidli exampl refer tresp solut miss featur problem vision advanc neural inform process volum page san morgan kaufmann berthold time delai radial basi function network phonem recognit ieee intern confer neural volum page ieee comput societi press bishop neural network pattern recognit oxford bobick comput action fisher british machin vision page press buxton gong visual surveil dynam uncertain world artifici cutler turk interpret optic flow gestur recognit ieee intern confer automat face gestur page ieee comput societi press buxton method gener face recognit pose express ieee intern confer automat face gestur page ieee comput societi press elman find structur time cognit gong visual observ reactiv learn spie intern confer adapt learn page palmer introduct theori neural comput redwood citi hinton ghahramani gener model discov distribut philosoph transact royal societi seri howel buxton recept field function face recognit intern workshop parallel model neural oper pattern page howel buxton face recognit radial basi function neural network fisher british machin vision page press howel buxton unconstrain face recognit imag sequenc intern confer automat face gestur page ieee comput societi press howel buxton simpl behaviour rbf network neural process jordan serial distribut process approach elman advanc connectionist speech lawrenc le jackel backpropag appli handwritten zip code recognit neural mckenna gong track face intern confer automat face gestur page ieee comput societi press raja face recognit dynam scene british machin vision page press raja gestur recognit visual mediat interact probabilist event trajectori british machin vision press moodi darken learn local recept field connectionist model summer page morgan kaufmann moodi darken fast learn network process unit neural ullman face problem illumin european confer comput lectur note comput volum page mozer neural net architectur tempor sequenc process weigend time seri predict futur understand page redwood pentland smart room scientif bobick approxim world incorpor qualit linguist inform vision system page gong model trajectori face signatur partial recurr neural network ieee intern confer neural volum page gong track segment peopl vari light condit colour ieee intern confer automat face gestur page ieee comput societi press turk visual interact lifelik charact intern confer automat face gestur page ieee comput societi press lang phonem recognit neural network ieee transact signal pentland track human bodi intern confer automat face gestur page ieee comput societi press wren pentland dynam model human motion ieee intern confer automat face gestur page ieee comput societi press
IR/1471 5 ieee publish intern confer system januari hawaii collect exploit expert knowledg web assist system johan depart comput inform sweden abstract recent research commerci develop highlight import human involv user support web inform system earlier work web assist system hybrid support system human web assist support import issu web assist system make optim support resourc knowledg manag approach frequent question system act question filter human assist knowledg continu collect assist exploit augment capabl system deploi evalu analysi log questionnair user assist result show approach feasibl lesson learn set recommend introduct previou research recent commerci develop highlight import web assist system web assist system user support compon ad kind web inform system includ system electron commerc digit librari home bank system web assist system clear potenti user trust wi give wi person human touch trust import aspect wi user larg consequ user earlier evalu subject show great enthusiasm web assist support special human touch assist give web assist system hybrid support system featur support human web assist provid support wi user kind interfac text chat voic chat support kind support execut recommend function search function import issu web assist system make optim resourc support knowledg manag form cooper web assist support full strength kind hybrid support system paramet kind resourc alloc paramet includ user trust human assist affect user trust wi posit support advantag user prefer user prefer human prefer inform peac quiet resourc cost human assist costli support support effici support effici solut problem support altern case import paramet highli depend applic domain wi wi bank user trust user prefer crucial resourc cost import tradit site resourc cost support effici import paramet figur illustr resourc alloc problem web assist system user question system expect receiv answer job support router decid answer question make effici support order construct answer user approach support rout web assist router send question assist assist find answer make support approach support proper answer question achiev question pass web assist support work filter handl routin difficult question deleg human web assist approach divid question set problem deleg support support answer construct end return user observ commun support compon user order answer question support compon part rout web assist system support knowledg balanc support rout user support figur support rout web assist system choic rout approach depend paramet set wi hand wi field studi site commerci interest site resourc cost support effici user prefer import filter approach attempt number assist exploit web assist knowledg automat compon compon work extend knowledg continu extract assist user relev knowledg extract assist exploit capabl system expand mean work load assist illustr balanc figur knowledg extract assist repres frequent question approach kind knowledg manag detail section implement web assist system extend compon user question question match faq file top match question answer top match faq shown user attempt solv problem faq item solv user problem user proce web assist faq item exce match threshold user automat connect web assist test evalu support rout approach deploi extend web assist system support compon exist wi wi art literatur domain intern user commun serv daili visitor session recruit number volunt assist live time zone give hour daili human support web assist system deploi period week evalu support rout approach log emploi questionnair user assist remain part paper structur section describ approach support rout section implement system user assist perspect section describ field studi section present discuss evalu result section lesson learn studi section discuss relat work section conclud give direct futur work support rout overview approach support rout filter user question natur languag system propag question human web assist task automat question answer requir domain knowledg domain knowledg collect repres suitabl form reason requir order gener answer question domain knowledg present motiv main design line larg domain make exhaust collect domain knowledg initi phase chose collect knowledg increment manner collect base actual user impli relev knowledg collect altern approach collect initi knowledg extend knowledg increment base system usag knowledg repres faq item question tailor averag user altern repres knowledg knowledg mechan descript logic facilit reason knowledg creat knowledg base larg domain complex resourc demand task altern store knowledg textbook format number featur articl book articl difficult refer user relev part approach hand present knowledg short piec user quickli overview advanc approach version faq item tailor group user stereotyp reason perform repres knowledg similar comput repres faq item user question system chosen collect knowledg assist base knowledg answer user question knowledg repres question style faq assist construct faq item base user formul faq tailor user averag system user figur illustr tool assist creat faq item number faq topic categori assist select topic faq item creat figur show faq index file assist check faq creat item make avoid duplic emploi inform retriev techniqu select faq item match user question item return user answer question automat system preliminari step user connect web assist faq item answer user user connect assist describ implement context web assist system section figur screen shot faq editor figur screen shot faq index file inform retriev architectur implement consist main index question manag index creat intern faq item question manag creat intern user question comput match faq item overview system architectur figur client server client question manag intern faq index faq item client faq editor faq updat figur architectur system approach faq finder system vector model repres faq item question index document repres weight keyword vector actual keyword word remain set faq item stopword remov stem stopword algorithm stem algorithm porter implement faq weight keyword faq item calcul wi log max ni total number faq item number faq item keyword freq frequenc keyword faq item maximum formula comput keyword faq item user weight keyword question calcul wi log freq ni frequenc keyword question similar user question faq item calcul formula weight similar calcul proven work gener ten faq item similar user question similar return result question result page gener rank list link match faq item make system fast faq item vector memori charact text creat result page faq item index index run ten minut altern approach system natur languag system gener knowledg question definit answer repres noun phrase procedur answer system make encyclopedia techniqu proce basic keyword queri construct natur languag question pass inform retriev system encyclopedia find text relev question retriev text noun phrase hypothesi extract match hypothesi return answer question quot text noun phrase occur return show user system gave answer techniqu work question work question procedur answer techniqu system question requir procedur answer system call geni system answer user question natur languag gener techniqu prototyp system design applic knowledg base consist plan uniqu goal system user model knowledg store form plan user system attempt identifi current goal base question user gener piec answer text system shown perform applic domain success techniqu depend complet knowledg base case creat knowledg base cover action plan due larg task domain attempt cover system email list moder aim provid autom question answer list match knowledg base question match item return user item answer question user send question subscrib list item knowledg base predefin express question match express conjunct disjunct keyword satisfi user question techniqu flexibl match creation match express requir extra manual effort implement limit manual effort chose automat match techniqu techniqu possibl kind support filter achiev altern includ expert system context system expert system approach feasibl size applic domain context system emploi part support support provid actual wi page context user servic user wi relat issu independ issu cover wi page web assist system section give overview implement web assist system automat capabl web assist system user question relat wi user process question system illustr figur user natur languag question user provid categori base predefin topic hierarchi user question match faq match faq item return user user find answer question return faq user request chat human assist step question categori match model assist log system system attempt establish chat connect user match place user queue assist moment user topic categori question order match user intuit solut user user question view match faq item answer found answer found wait queue assist assist tire wait queue chat answer found stop stop stop figur session user point view system illustr assist point view show system usag figur assist log web assist receiv request system user time assist accept chat connect establish user question question categori displai assist chat start user model displai assist directli chat start model view updat entir chat session chat user start base inform user model assist tailor answer current user skill experi time assist log creat faq item assist system request user chat view updat user model chat user user satisfi add faq item stop figur session assist point view field studi evalu outlin web assist system attach exist wi test period week call art literatur domain amateur artist writer displai materi site writer displai work scienc fiction genr wi visitor session daili basi interact import user write comment page part site dedic teach art user number featur articl art creation topic kind user support intend provid web assist system wide rang basic site relat support gener aspect art literatur voluntari assist live countri contin approxim assist user field studi remain assist chanc user log time user wi field user regist support system user assist evalu evalu test approach support rout find improv evalu system wai made analysi place field studi made evalu assist user point view questionnair questionnair interest opinion assist user altern evalu tool interview protocol consid difficult due wide geograph distribut user assist methodolog question analysi evalu amount user question suitabl turn faq item log place base faq item creat assist question consid issu question answer question question made faq item question made faq topic categori questionnair order evalu approach point view emploi questionnair questionnair question relat usag system assist particip field studi held user assist fulfil criteria questionnair experi receiv answer state automat answer system answer question left properli fill questionnair rate respond assist north america europ asia assist ag gender distribut due loss data demograph cover respond assist questionnair statement respond give rate agreement disagr scale respond motiv rate statement question system user made questionnair user regist web assist system assist questionnair user receiv answer rate slight major respond femal major north america europ remain south asia ag distribut due loss demograph repres respond questionnair particip human web assist reason list respond possibl give reason respond give number reason design questionnair consid guidelin result question analysi analysi found total user question question real question question found question duplic made faq item main reason question suitabl faq item assist answer question problem idiosyncrat faq item notic question assist answer special left question turn faq item studi distribut question predefin topic hierarchi faq item distribut illustr tabl case difficult decid topic categori reason altern case made arbitrari consist choic tabl topic distribut faq item art navig art art art digit art art stori navig stori stori stori stori member function user function questionnair result rate question assist questionnair present tabl discuss question learn assist interpret instruct creat faq item differ state question turn faq item gener assist gener faq assist user assist grew assist thought feasibl approach assist construct faq session tabl question answer construct faq item statement dev decid faq item creat base formul faq item base categori faq item tabl present result user questionnair notic altern reason question user regist time test support system tabl question answer assist regist assist human answer number system work answer question directli displai faq question system talk human assist assist log system regist check thing real chat human assist understand system system long time load reason discuss base evalu result discuss question relat feasibl support rout approach question suitabl faq system larg share question handl assist creat suitabl faq item base analysi main find larg amount question made faq item number question variant question user faq assist user behav faq item creat likelihood find match faq item smaller total respond user chat assist system provid answer short time system faq built good result show support rout approach note user prefer faq simpli prefer inform peac quiet involv evalu perform support rout approach interest evalu tradit recal measur estim larg share user question handl system argu measur directli applic kind system contrast tradit inform retriev interest retriev document relev question assum faq item answer question definit recal modifi faq finder system adopt definit recal percentag question system return correct answer exist measur call reject defin percentag question system correctli report unansw exist faq item faq finder system evalu domain measur tradit statist inform retriev approach faq finder system result valid system reject high recal low match threshold expect reach recal combin result data rate duplic question question analysi find system expect handl roughli question low larg domain support system good result limit domain expect rate higher achiev recal advanc inform retriev method creation assist initi instruct creat faq item base question instruct turn interpret wai assist express questionnair shown result notic assist thought difficult construct faq item find categori item clear instruct train improv situat recommend experi field studi provid number recommend design implement support rout web assist system defin kind question made faq item vagu definit make web assist unsur lead fewer faq item good definit question possibl user made faq assist thought difficult formul faq item level english languag requir short train period assist recommend start work assist problem topic categori faq item topic hierarchi modifi system design facilit modif spell check import faq item inform retriev method base user risk miss good faq item due spell error import user faq reli complet natur languag system relat work initi work commerci move direct discuss paper compani offer commerci system human assist web site trend import kind studi report paper effort user interact kind system benefit combin human assist support context alexandria digit librari onlin desk call develop idea librarian onlin user digit librari design implement prototyp system present applic collabor custom servic applic bank kiosk home bank internet bank kiosk applic share browser approach ink annot commun home bank applic share browser approach support voic chat relat research approach similar approach limit provid support descript system architectur form evalu provid answer garden system ackerman system involv human expert relat work import differ form support ag similar user model approach system support synchron commun user assist textual question answer expert ag consist asynchron messag question answer ag system extend version call answer garden featur function automat escal sourc form collabor refin system sourc user question featur incorpor interest studi futur work problem queri faq natur languag question studi faq finder system natur languag system number faq web collect faq finder work interfac system combin statist similar semant similar reason approach find answer faq outlin probabilist approach problem work system differ relat work knowledg time kind question answer appli human support resourc futur work approach support rout web assist system approach make paramet resourc cost support effici design web assist system web assist system implement deploi evalu field studi shown approach feasibl experi set recommend implement deploi kind user support rout construct faq item difficult tediou task interest investig kind support provid assist task natur languag techniqu machin learn techniqu assist possibl tailor answer user question base user model kind support provid faq system work faq item version system version present user base user strongli human involv user support stai futur work great potenti close collabor human exploit respect advantag common acknowledg work partial support assist user particip experi johan deserv special acknowledg work implement system final indebt thoma field studi refer role human web assist analysi usabl internet electron network applic pp organiz field studi answer confer cooper pp garden merg organiz memori collabor confer support cooper pp modern inform addison research particip handbook industri organiz rand pp base inform retriev work note aaai fall symposium ai applic knowledg navig pp languag process faq finder result work note aaai spring symposium nlp pp answer question experi faq finder technic report depart comput june applic independ intellig user support system exploit base user seventh intern confer user pp analysi inform data structur pp inform data structur pp moder electron mail intern confer inform knowledg pp approach knowledg aaai workshop index multimedia pp illustr comput collabor work confer cooper pp consum trust commun april pp inform commun juli pp adapt onlin simul expert annual intern confer comput pp softwar evalu handbook elsevi scienc pp custom servic synchron web browser confer cooper wa novemb robust linguist approach question answer annual intern confer research develop inform pp document intern confer pp unavail match intern symposium toler pp design interact onlin desk alexandria digit intern joint confer work san februari pp system popular comput annual intern confer comput pp import trust electron internet electron network applic pp commun march pp user user model dialog springer pp knowledg phd universiteit twent opportunist enrich custom intern workshop intellig user pp custom comparison voic confer cooper wa novemb pp
IR/1472 5 word web hugh william justin zobel depart comput rmit gpo box melbourn australia abstract design data structur text valuabl word encount collect vocabulari accumul central index construct text estim space requir perform characterist data structur task clear distinct word found text collect word continu inspect larg volum data practic definit investig word occurr model larg text collect inspect billion word occurr gigabyt web found million word million word observ word continu larg data stricter definit constitut word limit impact number word found introduct web grow billion searchabl page singl repositori specul page dai cover topic scope current web greater tradit encyclopedia page index major search engin includ materi technic corpor person written multitud imaginari web search engin word occur web page locat page user queri word extract page construct invert index wide experi text queri shown effect abil find page satisfi greatest word limit number function word complet index present practic vocabulari smaller greater likelihood maintain simpler support queri mode vocabulari number word observ web data taper volum data gigabyt text william searchabl word web vocabulari continu grow ongo occurr rare person place occurr complex chemic materi dna word document written unusu typograph error space string grow rapidli string million string letter investig rate word observ word occur queri observ process larg volum text extent question depend parser defin definit document word word deriv small conclud potenti valuabl word continu occur defin simpl definit constitut sequenc charact bound extend includ singl occurr quot hyphen charact word includ exclud string cover string english regard word practic vocabulari accumul task refer class class includ string gener regard goal elimin explor restrict class word alphabet restrict class convert charact regard ident treat approach overli restrict elimin string gener regard search approach word occur document languag document text permit document provid addit filter search task vocabulari reliabl identifi document heurist reliabl heurist base word occur dictionari word distribut version util requir word document occur requir word constitut page materi html markup test heurist sampl english page found threshold percentag found english page found filter gave set word occur page final approach consid class word dictionari class extrem dictionari includ person chemic place defici technic william searchabl word web tabl occurr statist definit alpha english english dict stem page distinct word word occurr terminolog impract definit comparison point experi section slightli broader class word stem root word dictionari stem process remov variant suffix version porter stemmer possibl inferior stemmer wide practic util class word comparison point restrict dict class truncat string charact data examin trend occurr word data gather web track intern collabor evalu inform retriev techniqu approxim gb web deriv crawl web undertaken extract word data preprocess elimin materi except materi includ long string gener secur elimin materi binari simpl heurist base assumpt word neighbourhood white space legitim text includ white space long string white space includ punctuat assum elimin http address directori path common sourc distinct string treat word process ascii text process encod data sourc word postscript content type decod ascii text result number distinct word occurr class shown tabl line show number word found million word occurr implement porter stemmer stuart implement program languag work mark ir resourc william searchabl word web inspect english filter found page experi process gigabyt experi alpha class million class test million page tabl show billion word word occur averag rate restrict rate restrict class dictionari class impract serv word class dict rate word found million word occurr dict class observ word begin end collect found document uniqu word found document discuss error phenomenon consequ document order scheme dictionari word found english document inspect util correct remain correct gener word occur inspect larg text collect discuss simpl evalu correct word section develop practic restrict found tini fraction word occurr digit reduct vocabulari size million word distinct word larg due case alpha result similar averag word occurr figur show trend number word definit word word occurr inspect show point repres total word million word occurr trend fewer rate arriv word word million word occurr million million million word occurr inspect million word ad million word word million word word occurr stricter definit variat reduc variat frequenc word figur show total word million word show repres scheme readabl peak region word occurr result encount document cover topic page report research chemistri physic meet threshold sourc encount site page result peak common sourc word list rare place proper noun occurr peak region continu occur english filter class investig util carri simpl experi produc larg distinct list word occur inspect collect william searchabl word web number word alpha dict number word occurr figur word occurr versu word inspect collect gigabyt web document point shown total word million interv scheme deriv definit word shown alpha scheme show word process million scheme show word million page filter written english william searchabl word web number word number word occurr figur word occurr versu word inspect collect gigabyt web document point shown total word million interv scheme figur shown readabl william searchabl word web tabl word alpha class tabl show local word occurr percentag word judg correct word exampl correct incorrect word shown line local show word judg correct incorrect line show word judg correct incorrect author author judg word occurr correct word word occurr correct accept exampl unaccept exampl make mail sober alpha class list word word occurr local extract word list word local produc sort list independ judg word reason erron word choic tabl show result experi averag percentag correct word fall word inspect inspect billion word suggest correct word million word occurr encount page ad collect twelv select word judg accept unaccept shown line local word judg correct incorrect line show word judg author word occur billion word occurr spell typograph error fall proport transposit attract automat correct word automat correct pitfal list word correctli context unusu place technic ten million person home dictionari possibl fulfil role easi identifi correct spell simpl word occur ten time find neighbour measur edit distanc common word complet reason definit rare word rare word typic word misspel neighbour rare word misspel rare word correctli william searchabl word web emerg place newswir chemic technic rare valid recent thesi explor issu internet search servic find match wide rang queri rare word obviou method distinguish mistak word potenti queri term rare term option search engin discard mean queri correctli resolv simpl url commonli pose word url occur document count occurr rare word larg queri log million found approxim distinct queri word remov charact class word word word occurr queri log word queri log extrem rare data result correct word continu occur practic definit word model word occurr discuss occurr refer made georg zipf observ frequenc occurr function rank rank determin frequenc function fr α constant zipf phenomena frequenc word english size citi largest citi popul profit compani phenomena wide explain adequ faithfulli view illustr principl effort frequenc distinct word english text text wall street journal distribut part trec project constant α fr observ frequenc word word occur word turn occur time frequent word web law relationship approxim fr origin formul overestim frequenc rare word observ occurr word english text distribut model predict number distinct word english text collect report shown text collect occurr distinct word grow collect proport close observ fact made earlier pareto econom financ work lausann similar observ earlier made area includ number author make contribut make contribut frequenc distribut scientif journal washington academi william searchabl word web squar root state law vocabulari size β size text β posit report typic β law work predictor collect size good estim constant β small collect mb word vocabulari word word occurr β text sourc displai strikingli larger collect experi β class number word newli inspect text accur predict constant text drawn sourc shown frequenc arriv word vari unpredict law work predictor vocabulari size sampl fraction collect sampl ten million word occurr collect β accur determin class word continu occur larg text collect data inspect develop definit practic sequenc charact bound permit singl quot permit digit definit found occurr inspect gigabyt data restrict definit word string number process page reduc frequenc word billion word occur rate restrict definit word limit result space time save vocabulari accumul search task modern hardwar mb save process gigabyt data alphabet string permit averag charact addit low overhead byte offer number word fall data arriv word occur constant predict rate model law approxim vocabulari rate word conjectur hold larger collect flexibl definit appar unpredict result show simpl bound number word found text web appar limit find contradict common wisdom topic practic implic technolog internet search engin prefer method construct index search engin assum complet vocabulari text held memori result show assumpt vocabulari grow linearli data volum william searchabl word web acknowledg work support australian research council refer modern inform retriev harman overview text retriev confer inform process hasan automat dictionari construct larg collect text school comput scienc inform rmit william burst effici data structur string kei acm transact inform techniqu automat correct word text comput li comment law structur evolut natur languag moffat bell gener compress invert file journal american societi inform mf porter algorithm suffix strip saracev search public queri journal american societi inform heinz tree practic larg text collect softwar practic ih witten tc bell sourc model natur languag text intern journal man machin ih tc bell manag compress index document imag morgan kaufmann lo ca xu wb croft stem cooccurr word variant acm transact inform gk zipf human behaviour principl effort zobel dart find approxim match larg lexicon softwar practic march william hash tabl accumul text vocabulari inform process zobel william combin model compress larg text collect string process inform retriev page ieee comput societi press
HCI/1473 4 march commun acm perceptu user interfac matthew turk georg guest editor law user interfac interact chang fundament decad user interact comput click major work interfac recent decad aim creat graphic user interfac give user direct control properti provid user clear model command action affect user accomplish interact comput applic endeavor wimp paradigm serv provid stabl global face clear paradigm scale match myriad form factor comput futur comput devic smaller interact daili live displai begin converg comput gener intuit wai interact technolog comput peopl interact major comput devic long interact techniqu match peopl comput mobil devic carri worn power devic size fit paradigm captur essenc futur hci ground peopl interact real world essenc perceptu user interfac pui interact techniqu combin understand natur human capabl perceptu comput devic machin percept reason seek make user interfac natur compel advantag wai peopl natur interact verbal nonverb devic sensor transpar passiv machin perceiv relev human commun channel gener output natur understood expect requir integr multipl level technolog speech sound recognit comput graphic anim languag commun acm march pui feedback user dialogu manag accompani figur illustr pui encompass research area figur show inform flow context tradit comput form pui intend form factor percept ui add perceptu capabl make comput awar user hand interfac provid input comput leverag human commun motor skill multimod ui close human commun skill multipl modal engag lead effect commun work multimod ui comput input speech multimod output visual tactil engag human commun skill understand present multimod modal independ simultan tightli coupl multimedia experienc enorm amount research perceptu cognit skill interpret inform present user video typic media multimedia research multimod research human perceptu channel point multimedia research subset multimod output research pui integr multimedia interfac bring human capabl bear creat natur intuit interfac pui enhanc comput tool directli enhanc account ey gaze technolog enabl broad comput interact wai perceptu interfac enabl multipl style speech speech text march commun acm synthet desktop mobil household system number challeng face develop pui ambiti endeavor element articl special section present challeng earli result goal perceptu interfac serv exampl effort area oviatt cohen summar multimod extens work speech system work show multipl modal lead stabl robust system reduc error pentland perceptu intellig kei interfac gener describ smart room smart class adapt technolog requir support crowlei al delv specif area comput percept human activ provid broad view field describ project visual percept enhanc graphic interfac reev nass address understand human percept psycholog relat interact describ result experi sidebar tan picard provid addit inform specif pui research haptic affect bobick al describ pui applic call inform flow perceptu figur inform flow perceptu user user interfac interfac multimedia multimod percept refer ed workshop perceptu user workshop matthew turk research vision technolog group microsoft research wash georg robertson senior research microsoft research work user interfac inform visual permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee acm
ML/1474 6 comparison samuel landau laboratoir dinformatiqu de pari rue du scott pari olivi aviat marcel cedex pierr abstract paper present framework base indirect encod genet algorithm build automata control deal perceptu compar extens studi learn benchmark experi discuss asset drawback context comparison keyword evolutionari learn perceptu augment transit network introduct learn system tackl problem situat adapt agent involv loop environ agent perceiv situat sensor vector repres perceiv featur task agent learn optim polici action perform order goal gener reinforc learn framework goal lc scalar reward provid environ polici set rule action condit perceiv situat real world happen agent perceiv situat requir optim give rise perceptu problem environ agent perform optim time step depend percept time step solv markov attempt appli lc instanc explicit intern state ad classic pair intern state provid addit inform optim action problem problem properli set set intern state devot genet algorithm compar lc system ga automat design behavior agent face problem perceiv situat vector select action order environ goal measur present featur properti model reli label graph describ behavior action select procedur model consist build graph bitstr handl bitstr genet addit oper show formal similar lc compar approach classic experi result discuss asset drawback criteria conclud state ad improv comparison favor descript express behavior architectur provid model involv transit graph basic label graph start node end node node repres state edg repres transit automaton graph describ behavior agent label edg set condit enabl sequenc action perform edg chosen graph begin agent agent start node time agent cross comput set elig edg start current node edg elig condit label condit label simultan true set action chosen edg randomli chosen set edg occur perform action label current edg action part label action chosen randomli current node destin edg agent stop end node note behavior structur involv classic evolutionari program tree genet program interpret time step determin action perform case approach reli intern node cycl perform time step process behavior graph built ad node edg basic structur start end node evolutionari techniqu automat design structur machin neural network program tree sketch opposit approach genotyp encod set paramet genet algorithm evolut approach genotyp structur produc phenotyp genet program evolutionari program program tree advantag kind behavior phenotyp produc interpret genotyp produc order gradual explor solut space genet oper follow process bitstr translat sequenc token token interpret instruct robust program dedic graph build bitstr token translat structur interpret stack figur principl genet express produc behavior graph bitstr genotyp string decod token interpret step instruct creat label translat translat simpl process read bitstr genotyp decod sequenc token genet function set detail mechan natur token provid token role depend number genet code redund binari substr size token call interpret token instruct languag oper stack data token part futur graph store token fall condit action put data label edg node creation node connect token node token stack manipul token action stack node token order cope evolutionari process base random mutat graph built robust mutat replac token local transform graph instruct execut simpli token graph made link node node sequenc token languag robust variat genotyp syntact semant constraint genet integr evolutionari framework model appli produc agent behavior evolutionari algorithm agent bitstr genotyp produc graph genet code depend percept abil agent action agent comput evalu behavior environ individu select depend produc select action current situat local percept select match move east atn graph figur locat cell perceiv block surround cell decid move adjac cell current agent perceiv true east cell current state edg condit part label match percept randomli action part perform current state updat genotyp produc classic crossov oper genotyp parent mutat strategi introduc variat genotyp classic random insert delet sequenc token produc complex graph chang node edg fact ad remov evolutionari condit label learn system explain problem tackl lc fact situat attribut repres perceiv properti environ lc learn behavior system shown lc dont care symbol condit part result dont care symbol make singl descript describ situat dont care symbol match consid match select action current situat local percept condit action classifi list move east select figur agent perceiv block surround cell start north current agent perceiv list lc select match current situat select match action perform attribut main issu gener organ condit action dont care symbol lc call ga pittsburg ga evolv popul lc list list combin crossov oper mutat lc evalu measur respect pittsburg style lc evolv popul control michigan ga evolv popul list singl agent combin michigan style lc ga perform onlin improv life time agent lc reli util function depend scalar reward rl framework earli lc directli util classi simpl lc call zc wilson found accuraci util predict xc wide lc solv markov problem deal simpl endow agent abil behav optim perceptu problem kind happen current percept provid inform optim agent perceiv situat action action inappropri state introduc intern state lc bull link order bridg situat stand extens xc explicit intern state manag intern memori regist bit explicit repres intern state lc part tabl extern condit intern condit intern extern action perform environ intern action modifi intern state intern condit intern action attribut bit memori regist order select classi match extern intern condit lc perform action environ intern state intern action dont chang symbol dont care symbol intern action result bit memori regist appli draw gener extern intern condit intern action memori regist percept permit deal perceptu ad inform past experi agent formal relat learn system atn evolv translat list obtain michigan pittsburgh style process node atn plai role intern state permit deal perceptu edg atn carri inform translat sourc destin node edg repres intern condit intern condit edg correspond extern condit action edg correspond extern action clear import formal due possibl perform sequenc action consequ match condit restrict featur singl action experi action part edg label empti action randomli chosen repres formal consequ featur discuss regard inher featur approach gener rule match situat intern state experi perceptu problem environ state induc ident percept action perform issu frequent encount environ compar natur result obtain evolut produc lc environ setup reproduc setup close model agent experi perceiv block adjac cell grid move adjac figur environ repres goal reach cell cell unambigu perceptu situat requir similar action north south cell move cell empti genet code includ condit action token order encod token stack manipul node bit token mean token encod experi involv initi popul agent random bitstr build graph agent evalu environ select individu higher produc cross parent system perform probabilist mutat insert delet bitstr iter process gener order evalu put start blank cell food limit amount time time agent perform action time action incompat environ simpli discard agent lose time run number blank cell discov time step spent bonu food found remain time food found time limit design advantag explor agent reach quicker food remain time step reward discov reinforc learn provid delai inform measur qualiti behavior agent evalu time start empti total sum comput run optim experi report carri initi genotyp bit origin popul genotyp size chang evolut experi bound case reach high valu result ne ne figur graph individu repres experi repres report show averag valu tabl graph extern intern extern intern action ec ic ea ia ne nw sw se ne ne sw figur present behavior graph obtain individu repres experi repres formal agent graph fit gener max fit avg fit figur averag obtain genotyp vertic reach horizont ne straight food optim solut graph present show optim behavior obtain clear distinct bottom vertic corridor cell top vertic corridor horizont corridor crucial ne corner discuss readabl minim import advantag respect atn result evolut easi understand featur question graphic produc constant size list size extern condit part memori regist chosen advanc gener intern state build graph number label edg advanc build minim control solv problem kei sequenc intern state agent run explicit state deriv hand care examin sequenc perfectli clear read atn intern state stabl advantag counterpart discuss repres rule intern state case intern condit gener import formal call element gener place current implement gener respect intern condit action prevent deal default intern state intern condit classi appli intern state repres memori regist mechan permit act intern state current implement explicit select pressur gener condit product gener inher lc approach necessarili obtain gener rule condit label redund ne corner condit encount graph gener good solut popul homogen size genotyp stabil genotyp lead similar assum bia compact solut reinforc learn select import atn produc list produc endow predict repres edg equal probabl select condit token match current situat edg select select determinist optim behavior compat nondetermin behavior strictli select pressur prevent situat detriment strong bia minim control match strongest match delet import advantag lc respect strength learn rl algorithm combin ga rl individu faster markov process rl algorithm inform experi agent ga ga select agent global rl algorithm distribut reward obtain goal reach rule contribut account exact sequenc action perform agent reward order remedi fact includ function element carri inform actual behavior agent tune function crucial success experi optim behavior obtain complet agent start west recogn nw corner directli vertic corridor check ne corner partli due function part time lost explor ne corner balanc explor reward structur recogn nw corner requir node edg token constitut major structur chang graph respect small select advantag futur work perspect adopt similar pittsburgh style lc endow abil tackl problem contrast michigan style lc depriv rl mechan shown produc control term behavior gener parsimoni behavior good start point address complex problem benchmark experi studi comparison suggest point agenda research investig possibl ad paramet combin rl ga address suboptim problem highlight optim individu environ present requir structur ga improv mechan abil deal intern state kei give properti featur implement time consist copi edg exist ad special connect token genet code refer de jong analysi behavior class genet adapt system phd dept comput commun walsh arti intellig simul evolut john wilei goldberg genet algorithm machin learn gruau neural network synthesi cellular encod genet algorithm phd en lyon universit lyon holland adapt natur cial introductori analysi applic intellig michigan ann meyer evolut develop neural control insect ieee transact neural koza genet program comput mean natur select mit editor genet program annual stanford mit press drogoul model evolut agent behavior symposium adapt agent analysi memori mechan genet program wilson optim system perform environ evolutionari mathemat model cellular interact part ii journal theoret luke spector evolv graph network edg preliminari report koza al page montana strongli type genet program evolutionari volum landau evolutionari design agent behavior world cybernet informat volum page schwefel evolut optimum seek john wilei sutton barto reinforc introduct mit bull learn foundat page springer wilson level system evolutionari wilson fit base accuraci evolutionari wood transit network grammar natur languag analysi commun associ comput yao evolv neural network
AI/1475 2 cbr dynam situat assess set jan wendler pascal mario lenz abstract describ approach reason set cbr environ select action soccer player base collect experi encod case artifici agentori program introduct recent technolog caught attent research commerci area provid testb test agent robocup feder start robot world cup initi attempt foster ai intellig robot research provid standard problem wide rang technolog ai robot integr examin annual robocup team util model method compet domain soccer plai kei issu domain true multi agent behavior requir player correspond autonom agent cooper agent deal uncertain primarili unpredict behavior oppon team leagu robot simul leagu part robocup soccer player simul leagu mean softwar program real robot robocup feder simul event occur pitch movement player visual game restrict simul softwar agent ignor major problem analyz sensor input move uncertain environ concentr problem intellig agent behavior difficult player action real time state world provid msec player produc command describ action dept comput humboldt address issu agent learn game adapt oppon behavior cbr techniqu term categori approach belong cbr support reason mechan intern agent outlin problem detail section describ cbr approach detail section section present preliminari result problem uncertainti kei problem player deal robocup uncertainti soccer world ffl inform provid player mention insecur kind fuzzi includ inform data player pitch ffl behavior oppon team unpredict uncertainti kind inher entir wai overcom point approach learn oppon behavior adapt action soccer player enemi ball figur find good posit expect movement fl submit ecai march situat depict figur posit teammat pb player oppon player ps decid move order good posit expect action pitch refer posit prefer posit inform calcul situat time step inform includ speed direct player ball drawback attempt calcul prefer mention inform provid insecur calcul prefer posit number paramet account requir complet model involv player player react real time calcul requir complet domain model compil programm system situat possibl occur game behavior player unpredict due environ player implement mean autonom true oppon player teammat altern calcul prefer posit reason approach snapshot game consid case similar situat recal evalu determin prefer posit section cbr dynam situat assess order appli number actual design cbr system includ ffl case ffl similar measur ffl structur case ffl case address question case structur base inform provid paramet includ case figur state posit player account repres consid area mean segment occupi player distinguish teammat player oppon team select prefer posit interest make move place occupi player team time step pb control base inform provid calcul expect time pb control ball pass ball teammat ps pb player autonom agent assumpt pb behav optim respect perform entir team prefer direct pb pb member ps prefer movement pb depend start posit plai defend forward posit power power resourc player ps account action perform time frame player suffici easili reach posit power reach neighbor segment distanc ball order save power reason ball move run movement select carefulli depend distanc point ball reach base case repres featur vector encod paramet aspect encod difficult paramet sketch figur segment pitch posit pb control ball middl circl real segment correspond area meter length arc similar measur case definit similar measur paramet state neighbor segment consid paramet encod mean numer simpl similar assess defin composit similar measur simpli comput weight sum local similar featur relev case memori retriev crucial point robocup domain player react real time urgent highli effici memori organ retriev procedur appli case retriev net model figur briefli sketch spread activ mechan determin similar case describ observ situat upper pictur show case case base circl denot segment occupi posit player mark squar arrow denot prefer posit situat lower left part figur current problem situat sketch descript case case queri queri similar activ figur find good posit expect movement similar propag model result situat shown lower part figur size circl correspond achiev activ segment inform inform similar paramet shown situat consid similar situat player move left case onlin versu offlin learn appli cbr approach dynam situat wai player obtain case reason ffl kind train player build case player learn behav situat standard situat ffl player acquir case game opportun adapt oppon behavior preliminari result outlook team humboldt world champion robocup base architectur agentori commun agent recent extend compon player capabl acquir case maintain case base repres observ situat determin effici requir test retriev perform number configur robocup feder player simul singl ultra case final robocup retriev case base case averag msec maximum msec estim case base case manag strict time frame robocup investig perform determin qualiti case approach open question state pitch mean segment current segment structur suffici investig mode offlin onlin combin question case acquir onlin adapt oppon team gener make knowledg forthcom match acknowledg entir team humboldt contribut success marku kai ralf refer wendler humboldt practic theori proc intern workshop springer wendler bdi artifici soccer ai magazin lenz case retriev net appli larg case base burkhard lenz german workshop lenz burkhard case retriev basic idea extens advanc artifici springer lnai noda soccer simul ai societi artifici decemb rao georgeff bdi theori practic lesser proc int conf system
Agents/1476 1 program david milind nicola lawrenc cavedon inform scienc institut comput scienc depart southern california marina del ca abstract system lead develop heterogen design varieti group distribut varieti platform environ teamwork heterogen agent critic realiz full potenti system scale demand applic develop flexibl agent team extrem difficult paper significantli process build team abstract framework call program programm specifi agent organ hierarchi team task organ abstract coordin plan potenti ensur robust flexibl team oper system support top layer integr core teamwork coordin commun capabl recent top integr team heterogen distribut agent perform complex task outlin current state top implement outstand issu develop framework introduct system oper dynam environ user interfac robot space virtual train environ internet inform extract agent distribut varieti platform domain user desir agent work accomplish complex task exist agent prefer build monolith applic significantli reduc softwar develop effort preserv modular agent work team tackl task complex perform individu construct team remain difficult challeng current approach design agent team lack teamwork model enabl agent autonom reason commun coordin requir teamwork absenc teamwork model make team construct highli visit centr de recherch de franc visit comput scienc australia enabl agent autonom reason human develop provid larg number coordin commun plan plan develop domain result team suffer lack robust flexibl team face varieti team member unanticip failur fulfil member diverg belief unexpectedli noisi faulti commun teamwork difficult anticip vast number coordin failur due uncertainti paper minim complex build robust flexibl team infrastructur support program view set agent build team accomplish build larg number coordin repres knowledg team organ hierarchi exist agent intend execut team plan top infrastructur automat ensur agent coordin commit team mainten coher group task reorgan teammat unabl perform assign task infrastructur chang problem domain section describ view top detail recent complet initi implement top infrastructur softwar integr teamwork model core teamwork capabl individu agent wrap section call individu agent agent pure social core teamwork possess action capabl domain interest exist agent action capabl make interfac agent agent made rapidli assembl team domain unlik past open agent architectur central blackboard facilit integr set fundament distribut system unlik direct task team level program appli current top infrastructur concret evacu civilian strand hostil area target build system enabl set helicopt fly coordin format land pick strand fly back safe area system enabl human command interact provid helicopt locat land safe kei point evacu rout system plan rout avoid dynam obtain inform enemi chang rout evacu top successfulli integr eleven agent team agent helicopt transport helicopt rest includ set agent creat user interfac agent agent quickset collect framework treat singl agent agent written comput run oper distribut top enabl teamwork program agent capabl descript programm develop system perform joint task programm pool possibl develop base agent implement run oper system softwar engin trend agent system modif implement team assum agent potenti team member function interfac describ capabl capabl descript agent set task agent input paramet task constraint output perform request constraint output figur partial capabl descript agent evacu scenario capabl descript outlin kei featur relev common ontolog translat mechan provid clear semant descript issu scope paper fig partial descript capabl agent evacu scenario figur show agent perform request messag provid start destin input output list point helicopt pilot agent perform includ coordin aircraft paramet includ altitud follow aircraft constraint input unit paramet helicopt pilot agent perform task observ featur agent pilot agent monitor statu paramet identifi specif vehicl attribut monitor output attribut task vari type involv achiev mainten case helicopt pilot coordin flight task initi exampl task termin activ task request agent termin task initi task extend activ achiev goal includ passiv observ condit potenti affect team monitor task discuss program pool programm job implement aspect system aspect level abstract requir programm team organ hierarchi achiev team goal team goal team procedur achiev ffl model initi team goal ffl model condit team termin goal coordin constraint agent execut team joint activ team readi layer domain level agent commun execut team orient program task monitor fig abstract view program program execut top consist layer interfac agent written languag figur illustr view top infrastructur enforc team behavior ensur coher execut team plan provid task instruct agent time layer hide detail coordin flexibl implement abstract specif top infrastructur make assumpt intern structur consist set distribut agent singl program specifi organ hierarchi role fill individu agent group agent figur illustr portion evacu scenario organ leaf node correspond individu intern node correspond team agent descript requir capabl agent role requir abil acquir knowledg mission paramet label ital agent fill role organ implement team goal procedur aspect program reactiv team plan reactiv team plan situat plan reactiv plan individu agent kei differ explicitli express joint activ relev team reactiv team plan ensur agent team procedur team procedur execut team plan team collabor design collabor collabor monitor flight team transport transport fig partial organiz hierarchi agent evacu team reactiv team plan team program requir programm initi termin action execut part plan top infrastructur ensur team synchron appropri execut plan programm program synchron action infrastructur ensur synchron respect time plan execut ident member plan set multipl candid programm specifi termin team plan irrelev unachiev explicit specif ensur team member team termin goal coher programm procedur coher plan termin top architectur termin condit basi automat gener commun jointli termin team plan figur show team goal procedur evacu domain node correspond goal agent team achiev team programm specifi role organ perform goal top infrastructur assign role assign quickset role note quickset achiev goal link figur correspond decomposit abstract relationship goal subgoal evacu pickup fig partial reactiv plan hierarchi evacu scenario respect action reactiv team evacu sequenc subgoal begin agent interpret order provid human command team achiev agent label achiev goal programm action assum achiev goal level abstract programm ignor work member simplifi specif task program collect agent abstract programm omit explicit task agent top architectur automat gener task messag run time programm coordin constraint execut team goal goal lead parallel perform pickup perform transport programm repres constraint transport perform pickup reach mask locat begun observ programm top infrastructur handl gener commun proper synchron top current system distribut wrapper base soar integr agent support featur requir program framework categor wrapper agent teamwork program reusabl compon steam compon previou work steam compon teamwork model model encod rule explicitli outlin team member commit teamwork steam joint intent theori basic build block sharedplan theori strongli influenc steam teamwork knowledg consist class coher preserv rule requir team member commun ensur coher initi termin team team member inform uncov crucial inform render team plan monitor repair rule ensur team member substitut critic team member fail rule theori weigh commun cost benefit avoid excess commun team steam soar rule public domain domain report literatur extens steam system extend origin steam model support featur desir full top teamwork knowledg encapsul wrapper agent support heterogen agent kqml multicast commun automat gener task request agent automat gener monitor request agent top gui facilit specif organ team plan origin steam teamwork knowledg resid directli agent knowledg base place knowledg separ wrapper longer reli abil modifi code agent system support kqml commun wrapper agent automat procedur kqml messag task agent servic current team goal figur repres system structur implement evacu scenario illustr commun broadcast messag member relev team illustr depict sixteen helicopt agent full implement kqml kqml agent domain level agent task monitor kqml team orient program execut quickset rout planner ariadn helicopt kqml kqml kqml kqml fig agent structur commun evacu scenario implement steam rule provid agent automat procedur commun privat belief provid procedur commun belief agent agent agent access observ relev termin condit team plan pilot agent observ helicopt knowledg current team plan resid agent observ relev pilot agent helicopt extend agent knowledg includ gener monitor request steam requir model condit team goal unachiev agent capabl specif describ condit agent observ model monitor deriv automat procedur gener monitor request capabl specif specifi translat monitor privat belief ultim commun agent standard steam procedur creat top interfac facilit programm effort team organ plan figur show sampl screen shot program evacu pane correspond left programm oper requir left pane assign role tion middl pane oper role team organ inherit requir assign programm assign agent rightmost pane role figur programm attempt assign agent rightmost pane role middl pane notic capabl mismatch notifi programm icon specif assign gener soar file wrapper agent run scenario fig screenshot sampl organ oper specif evacu scenario appli evacu team programm agent figur cohen multimod input agent window rout sycara path planner aircraft window minton usc engin dynam threat helicopt usc agent fly simul helicopt agent provid fix specif commun task capabl agent social wrapper agent teamwork behavior wrapper agent knowledg team hierarchi joint goal repres part evalu evacu scenario team successfulli met initi challeng gener correct task monitor coordin agent behavior successfulli accomplish evacu scenario interest effort involv encod modifi agent teamwork capabl compar effort altern reproduc capabl provid agent coordin requir abil modifi code agent coordin plan languag agent altern wrapper team oper requir separ commun plan coordin plan signal commit signal termin commit reproduc select commun requir addit special case extrem combin valu commun cost reward requir separ special case oper total econom special case discov encod gener specif greatli facilit modif team rout planner addit team extend organiz simpli ad rout planner member ad branch goal hierarchi branch involv simpl goal agent submit request plan wait repli rout commun rout team member teamwork model support commun bulk code effort ad rout planner specif messag format task constraint research issu current implement system mark step stone path ultim goal program previou research integr heterogen research problem agent work solv problem address challeng flexibl team behavior kei issu proper gener monitor task request current mechan automat gener monitor request agent capabl monitor lead multipl agent monitor event redund provid robust wast agent resourc explor issu fulli order design correct mechan monitor task lack gener capabl descript obstacl current system achiev full top function implement full capabl languag section specif plan requir agent capabl creat team membership structur run time current implement assum agent meet plan exact case agent meet exact requir agent perform mediat inexact match evacu quickset rout planner repres point helicopt pilot agent coordin chang pilot code translat abil chang agent code origin rout planner code provid rout tank rout point suitabl produc undesir flight pattern helicopt design rout planner modifi behavior provid fewer intermedi point gener approach recogn mismatch run time invok translat agent capabl mediat limit wrapper agent agent current autonom make commit assign task prefer commit organ research investig method agent balanc compet demand potenti extend architectur incorpor method reason commit make behalf individu agent relat work issu address program environ design implement influenti shape idea outlin uniqu idea realiz distribut set agent integr heterogen set exist agent tidhar term describ conceptu framework team behavior base mutual belief joint coupl organiz structur framework form basi implement base dmar agent architectur tidhar organiz hierarchi ensur agent team fill specif role offer author privileg tidhar describ unfold team plan plan individu agent commun act ensur rudimentari coordin framework address issu team select team select match requir execut team plan agent skill featur tidhar al conceptu implement framework import context critic issu agent involv heterogen attent section exist agent wrap addit task monitor commun teamwork layer flexibl reorgan commun select steam part abstract implement teamwork reason relev current work includ implement model cooper base joint intent similarli steam agent cooper level handl negoti involv joint task maintain inform agent involv joint goal model dialogu user agent form joint activ base sharedplan model joint action model collabor compar implement steam steam modul teamwork deeper level singl joint capabl monitor role perform role substitut repair team activ specif issu agent fairli clean separ teamwork layer individu layer agent system explicitli program outlin articl target wrap singl agent collabor human issu program team agent relev similar complex natur team team task led explicitli focu top explor issu automat gener monitor address adept architectur model busi process hierarch team organ adept consist multipl handl commun interact agenc agenc maintain avoid central facilit broker task agenc capabl perform task adept fairli clean interfac individu agent social level adept framework address issu agent architectur potenti incorpor heterogen agent adept provid explicit model base joint basi collabor close relat castelfranchi notion social commit singh recent abstract framework coordin heterogen agent singh model repres plan activ automata intern work transit repres extern action event coordin servic maintain knowledg individu agent action joint plan receiv request perform inform agent intend action omit fit joint activ agent singh model address issu potenti tool augment joint plan framework languag coordin interact abstract level steam rule modul cool coordin framework coordin reli oblig agent explicitli reject notion joint goal joint commit individu commit cool inadequ ing teamwork work understand relationship cool code autom support import issu softwar engin meyer notion design contract involv function abstract softwar modul precondit safe incorpor analog defin agent capabl system perform oper larg heterogen softwar exist softwar wrap small program manag execut handl commun central concern relat focu agent compon assum behav task organ chang dynam issu concern exploit notion provid coordin commun servic automat futur work program effort motiv rapid develop agent team distribut set agent develop infrastructur support top wrapper agent form distribut layer augment agent social coher commit termin joint goal team reorgan member failur select commun incorpor heterogen agent kqml commun infrastructur automat gener task monitor request distribut agent repres advanc top greatli simplifi effort render agent enabl function coher joint goal evacu complet social capabl list remain task team program successfulli gener correct team program goal hierarchi figur organ hierarchi figur initi success develop program evacu scenario modif util top framework rigor experi valid claim compar program effort construct team effort requir hope provid quantif benefit quantifi robust organ construct evalu system perform number type failur execut implement top framework wrapper agent identifi kei research section illustr issu agenda current wrapper agent singl agent potenti wrap multipl reduc team commun central greater comput render failur agent catastroph analysi tradeoff support automat procedur gener optim structur agent investig machin learn learn team failur enabl agent correct miss incorrectli coordin modifi exist organ hierarchi appropri match task hand kei learn improv skill individu acknowledg research support darpa award control agent base system program effort manag research site phil katia sycara steve minton collabor provid ariadn queri agent gratefulli acknowledg support hank host mention ensur smooth integr refer barbuceanu mark fox architectur agent build shell intellig volum lectur note artifici intellig catherin gio wiederhold languag system heterogen distribut proc dexa intern workshop softwar guido cooper group util nr jen intellig agent vi proc sixth intern workshop agent languag lectur note artifici intellig volum role impact prefer multiag interact nr jen intellig agent vi proc sixth intern workshop agent languag lectur note artifici intellig volum castelfranchi individu intent group organ proc intern confer page paul robert eric adam albert barbara david murrai burk darpa knowledg base project ai philip michael david sharon jai ira liang josh multimod interact distribut applic proc annual intern multimod page jame firbi investig reactiv plan complex domain proc nation confer artifici barbara grosz krau collabor plan complex group action artifici lisa hogg nick jen variabl sociabl make nr jen intellig agent vi proc sixth intern workshop agent languag lectur note artifici intellig volum nick jen control cooper problem solv industri system joint intent artifici nick faratin approach busi process manag acm sigmod craig steven jose lui jai ion andrew sheila model web sourc inform integr proc nation confer artifici hector philip jose nune act proc nation confer artifici intellig menlo aaai david adam dougla moran open agent framework build distribut softwar system appli artifici meyer appli design contract comput allen newel unifi theori cognit harvard univ charl rich candac sidner agent collabor peopl proc intern confer autonom agent munindar singh customiz coordin servic autonom agent proc fourth intern workshop agent architectur languag milind tamb flexibl teamwork journal artifici intellig milind ali gal ion muslea build agent team explicit teamwork model learn artifici milind lewi randolph frank john paul karl intellig agent interact simul environ ai spring gil tidhar preliminari report technic report australian artifici intellig gil tidhar social structur technic report australian artifici intellig gil mario fly model air mission team journal appli gil anand elizabeth sonenberg guid team select proc intern confer thoma wagner victor lesser relat quantifi motiv situat agent nr jen intellig agent vi proc sixth intern agent lectur note artifici intellig volum mike katia keith decker execut plan environ proc aaai fall symposium plan problem novemb
Agents/1477 1 specif reconfigur multiag system thesi usaf depart air forc air air forc institut technolog air forc ohio approv public distribut unlimit design specif reconfigur multiag system thesi present faculti graduat school engin manag air forc institut technolog partial fulfil requir master scienc lee usaf march approv public distribut unlimit ii view express thesi author reflect offici polici posit unit state air depart unit state govern iii iv acknowledg list give give strength finish program thesi love fault failur support process love heart finish work advisor major deloach guidanc patienc research fellow student support entir time afit lee tabl content acknowledg tabl content vi tabl tabl problem background problem statement approach relat research thesi overview ii problem analysi phase option move activ concurr task special move role mobil agent search system analysi option analysi option summari design phase creat agent vi agent compon step basic agent step transient agent step persist agent compon step agent compon construct assembl agent class option individu compon handl move function mobil compon handl move agent compon handl move mass system design option design option design option select analysi design option mobil summari iii design transform transform analysi ensur mobil remain agent compon agent compon transform agent compon transform agent compon transform agent compon transform agent compon transform agent compon transform vii agent compon transform agent compon transform agent compon transform design design agent compon mobil agent compon mobil transform agent compon mobil transform agent compon mobil transform agent compon mobil transform agent compon mobil transform agent compon mobil transform compon compon mobil transform compon mobil transform compon mobil transform compon mobil transform compon mobil transform compon mobil transform compon mobil transform compon mobil transform compon mobil transform compon mobil transform compon mobil transform summari iv demonstr travel plan system analysi mobil design viii creat agent construct agent class creat agent agent compon mobil compon carolina implement summari futur work futur research clone instanti ad secur design model formal proof transform automat code gener summari background dynam agent dynam agent advantag summari softwar engin methodolog analysi design multi agent multiag system engin summari mobil agent platform concordia aglet workbench ix carolina summari summari transform model design model definit state state action summari bibliographi vita tabl figur figur mase methodolog figur relationship analysi design phase model mase figur carolina architectur figur analysi option goal hierarchi diagram mass system figur analysi option case mass system figur analysi option sequenc diagram mass system figur analysi option role diagram mass figur bid task mass system figur analysi option search task mass system figur analysi option goal hierarchi diagram mass system figur analysi option case mass system figur analysi option sequenc diagram mass system figur analysi option role diagram mass system figur analysi option search task mass system figur analysi option move task mass system figur messag pass architectur start figur basic agent compon diagram figur agent compon agent transient compon figur agent compon agent persist compon figur agent compon agent transient persist compon figur sequenc diagram mobil compon handl move figur sequenc diagram move compon handl move figur sequenc diagram agent compon handl move xi figur analysi option agent class diagram mass system figur analysi option agent class diagram mass system figur bidder compon mass system figur design option search compon mass system figur design option agent compon mass system figur design option mobil compon mass system figur design option search compon mass system figur design option agent compon mass system figur mase transform architectur figur compon transform defin figur compon diagram figur transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur agent compon diagram transform figur state transit ad compon xii figur state transit ad mobil compon figur state ad mobil compon figur transit ad mobil compon figur transit alter mobil compon figur state transit ad compon figur transit ad mobil compon figur transit alter compon figur transit ad compon figur mase role model tp system figur gather travel inform task tp system figur task tp system figur task tp system figur agent class tp system figur transform menu agenttool figur compon agent class tp system figur agent compon agent class figur agent compon plan travel agent class figur agent compon agent class tp system agent compon mobil transform figur compon transform defin figur inform dialog select state receiv move requir messag figur state select window figur compon compon mobil transform figur travel planner graphic user interfac tp system figur tp system output show agent start travel plan process figur agent address xiii figur agent final address figur final result tp system figur fipa simpl mobil protocol figur gaia methodolog figur role model schema figur fill protocol definit figur mase methodolog figur goal hierarchi diagram figur sequenc diagram figur goal map role figur registr task figur mase role model figur agent class diagram figur mase compon diagram figur diagram figur concordia architectur figur carolina architectur figur agent state carolina figur graphic type figur class diagram type design phase mase figur agent type figur compon type figur type figur class diagram figur state type figur transit type figur action type xiv figur type figur paramet type figur event type figur type xv tabl tabl tabl agent compon transform tabl agent compon mobil transform tabl compon mobil transform abstract multiag system power collabor softwar agent solv complex distribut problem softwar engin methodolog assist system design creat multiag system methodolog agent dynam properti mobil agent instanti thesi start process bridg gap methodolog dynam agent platform incorpor mobil current multiag system engin methodolog mobil compon mobil agent class agent compon creat integr behavior compon agent class transform handl move mobil agent agent compon compon mobil transform integr agenttool demonstr system built mobil specif implement execut carolina mobil agent platform design specif reconfigur multiag system problem background introduct imagin leader battlefield detail inform critic point mission stop mission search global inform grid analyz inform leader send dynam softwar agent agent travel server hold data analyz data server compil request inform travel back leader report find leader freed direct soldier current environ wait requir inform order move forward complet mission joint vision air forc vision stress superior major arm forc control ongo multiag system research field artifici intellig provid solut gain maintain superior support centuri true multiag system bring power multipl collabor softwar agent solv complex distribut problem current softwar engin methodolog design multiag system agent properti clone agent instanti critic solv problem faster effici research develop numer dynam agent platform handl agent properti mention multiag design methodolog platform differ methodolog term abstract model system abstract includ complex system interact mechan agent flexibl organiz structur current methodolog includ analysi design multi agent multiag system engin air forc institut technolog agent research group develop matur methodolog mase methodolog shown graphic figur design cover entir life cycl develop implement multiag system mase analysi phase consist captur appli case refin role design phase mase consist creat agent construct assembl agent class system design graphic model mase step assist design process goal hierarchi concurr task diagram requir case sequenc diagram role agent class agent captur goal appli case refin role creat agent class construct assembl agent class system design figur mase methodolog analysi design defin methodolog specif formal agent system synthesi main goal afit agent research group order accomplish analysi model mase transform design model design transform execut softwar code develop transform convert mase analysi model design model order build semant analysi design model defin map model creat mase analysi phase model consist role agent plai concurr task defin behavior role coordin role analysi phase model map design phase model shown figur compon exist mase design architectur guidanc build agent coordin agent compon agent design creat intern architectur task belong role agent plai compon correspond concurr task assum execut thread compon execut thread control coordin pass intern event compon agent class coordin agent class state tabl concurr task remain intact compon state tabl state transit extract state diagram compon replac action transit repres execut model organiz structur design phase captur inform present analysi model maintain multiag framework independ retain basic idea coordin compon extern commun agent deal extern intern coordin behavior role agent figur relationship analysi design phase model mase transform system consist stage input system complet role concurr task diagram assign role agent class compon agent class creat protocol extern event protocol compon replic design convert extern event intern event stage activ includ label start end compon state diagram match start event compon stage harvest compon state tabl state transit belong half extract compon state diagram replac singl transit action repres execut agent design mase dynam clone mobil instanti type agent dynam agent system shown solv network relat problem find servic inform world wide web system shown advantag robust function interact remot procedur call messag socket dynam agent agent possess clone abil agent creat instanc instanti spawn abil agent creat instanc type class agent mobil abil agent move machin machin network agent focu research distribut artifici intellig arena properti mobil receiv attent multiag system analyz design util dynam agent platform requir handl execut agent agent gener softwar system abil dispatch termin agent foundat intellig physic agent defin agent manag refer outlin logic compon includ physic implement agent platform exampl mobil agent platform concordia aglet workbench carolina carolina platform develop connecticut part distribut goal satisfact project wright state conduct research jointli logic compon list fipa provid agent execut agent manag system agent commun channel execut agent execut environ place agent code execut handl agent manag carolina agent manag deal handl agent move platform maintain relev inform agent agent commun channel agent exchang inform servic commun messag channel carolina mention carolina framework handl dynam agent multiag design methodolog develop agent execut carolina environ port carolina problem statement execut port port thread system manag interfac figur carolina architectur system manag port multiag system bring power multipl collabor softwar agent solv complex distribut problem current softwar engin methodolog design multiag system agent properti clone agent instanti critic solv problem faster effici ad properti methodolog methodolog power solv complex problem problem address thesi modifi step model current multiag system engin methodolog design specif multiag system dynam agent scope methodolog mase methodolog modifi incorpor specif design dynam agent mase methodolog develop afit complet multiag system design methodolog methodolog gaia mobil aspect dynam agent dynam properti incorpor mase research time limit simpl demonstr system design implement carolina server softwar provid connecticut agent platform dynam agent server softwar research readili support mobil agent carolina server softwar modifi support thesi assumpt mase methodolog carolina server chang research due ongo improv research master student afit connecticut account decid modif mase support research effort approach step solv problem incorpor concept dynam agent mase defin properti dynam agent thesi examin option integr mobil properti analysi phase mase advantag disadvantag explor option option select examin option integr mobil properti design phase mase advantag disadvantag outlin option select develop transform analysi phase model incorpor mobil design phase model mase method chosen demonstr feasibl problem solut mase design implement multiag system mobil agent carolina relat research build high qualiti softwar real world applic difficult construct task face human todai number complex real world compon relationship compon make model real world difficult real world problem dynam heterogen approach disciplin softwar engin tackl task model distribut system includ orient softwar engin methodolog methodolog build softwar system agent agent softwar system autonom control directli human agent cooper agent commun achiev goal percept agent react make environ agent passiv entiti object exhibit behavior agent natur extens object methodolog agent differ object respect exhibit flexibl autonom behavior oper thread control current intellig system consist singl agent singl capac solv problem limit perspect comput resourc real world problem gener complex unpredict handl singl agent artifici intellig research realiz limit singl agent work multiag system system execut machin distribut multipl network machin distribut multiag system bring power modular form flexibl base organ handl complex size real world problem multiag system provid effici solut real world problem resourc distribut mase methodolog introduc section cover entir lifecycl multiag system design methodolog similar base view multiag system comput organ consist interact role methodolog agent plai role time agent methodolog interact methodolog differ term amount detail provid build multiag system mase provid detail defin gaia methodolog interact mase provid model build intern knowledg structur agent mase methodolog specifi locat agent final system major exist methodolog abil analyz design multiag system agent dynam appendix detail analysi methodolog properti dynam clone thought extens gener definit agent dynam agent poss tremend network function replac current network protocol remot procedur call messag function provid dynam agent system singl altern provid level function advantag dynam agent includ reduc commun bandwidth cost hardwar oper system independ depend mobil agent platform execut fault toler maintain optim configur main reason dynam agent technolog replac remot procedur call messag deal lack specif network function accomplish dynam agent dynam agent system network protocol reason rpc messag successfulli year dynam agent technolog infanc issu work includ secur dynam agent system mobil industri date fipa object model group begun develop wide accept dynam static capabl provid execut environ fipa defin agent manag refer model defin capabl logic compon dynam agent aglet workbench agent agent manag system agent commun channel platform written java provid hardwar oper system independ differ platform function agent commun agent mobil handl concordia function term fipa logic compon autonom abil agent concordia requir agent fix itinerari agent manag deal resend agent platform carolina forc commun server platform agent move call command agent system platform hierarchi method form agent life cycl method end specifi locat agent travel appendix detail analysi platform thesi overview document organ chapter ii discuss option integr mobil analysi design phase advantag disadvantag option discuss chapter iii begin select option choic present chapter ii base develop transform mobil analysi model mobil design model chapter iv demonstr multiag analyz design solut chapter ii iii chapter complet thesi summar contribut thesi effort describ futur research expand contribut work start thesi ii problem approach incorpor dynam agent multiag design methodolog entail studi phase methodolog determin concept ad chapter describ approach add mobil concept analysi design phase mase illustr system analyz design option present section section introduc sampl problem illustr differ option present sampl problem chapter iii analysi phase mase analysi phase captur appli case refin examin mobil captur goal step goal system extract initi system context goal detail inform goal request goal find inform request includ detail definit find chang time mobil concept fall detail process agent behav order fulfil goal agent move order fulfil goal find request inform previou goal inform function move requir move mobil includ system goal mobil pertain appli case step mobil system goal role system goal goal includ mobil role system goal includ mobil mobil role possibl form basi analysi option present subsequ section mobil includ previou mobil option refin role step appendix mase methodolog concurr task defin intern agent behavior agent class concurr task oper thread control defin process action role activ task repres actual function role perform number predefin activ includ task activ move activ move agent address singl boolean variabl result move activ boolean result repres move occur syntax move activ shown boolean simpl boolean result move action adequ agent properli reason mobil reason move requir provid agent flexibl recov move failur reason failur move mobil agent platform destin address machin agent move isol rest mobil agent platform deni move secur move activ defin return boolean reason boolean repres move occur reason variabl denot reason applic syntax move activ shown design reason move failur origin move activ option option mobil mase analysi phase option mobil concurr task refin role step option mobil step analysi phase requir special move task role refin role step option discuss detail illustr mass system section move activ concurr task option mobil mase analysi phase ignor mobil refin role step concept mobil confin special move activ discuss concurr diagram defin task mobil task move activ task task move activ advantag approach requir addit robust move activ exist concurr task model advantag approach flexibl design system evid design option discuss section concept mobil individu task attach role mobil task alter deal task modifi design phase special move role task place form move activ special move task separ move role option incorpor mobil analysi phase mase role model architectur task multipl role special move task separ move role combin role design phase protocol establish task system move task reusabl modular main advantag approach role multiag system mobil predefin mobil task role insert protocol defin role move task move role main disadvantag option protocol defin task requir mobil special move task ad mase role diagram make role diagram complic mobil agent search system multiag system introduc illustr option discuss system analyz current mase methodolog addit move activ discuss section user vast amount inform distribut data storag infrastructur technolog user perform requir research topic gener document search pertin document find requir inform daunt time consum task solv problem multiag system develop assist user search goal agent search data compil result report inform user illustr analysi problem step mase analysi phase analysi option figur show mase goal hierarchi diagram mobil agent search system analysi option notic mobil list system goal role mass system initi defin appli case step case defin oper mass system shown figur figur show sequenc diagram case figur analysi option goal hierarchi diagram mass system figur analysi option case mass system figur analysi option sequenc diagram mass system figur show analysi option mase role diagram mass manag role announc task bidder role contract net protocol bidder role won bid process search send request search role search request protocol search task search role search request inform report result back bidder forward back manag role figur analysi option role diagram mass defin concurr task part refin role step figur show bid task mass system task start idl state begin process receiv announc task manag task persist reactiv task receiv bidder role decid bid task state bid task transit back idl state wait announc task bid task bid bid reject manag accept bidder role send search task search role search role repli result search success figur bid task mass system design determin search role abil move order find request data figur show complet search task includ move activ task start receiv messag bidder role activ task input return locat data sourc activ return current address agent compar activ destin current address determin agent move agent find activ search state execut return result reason applic agent move activ state execut move success find activ execut search state move messag back bid task reason failur complet analysi mass analysi option analysi option figur analysi option search task mass system analysi option incorpor mobil start captur goal step differ goal hierarchi diagram figur shown figur goal figur analysi option goal hierarchi diagram mass system case sequenc diagram analysi option includ mobil searcher role send destin mobil agent send back confirm move figur show case figur show sequenc diagram figur analysi option case mass system expand mase role diagram mass system option shown figur differ analysi option addit mobil agent role move task search task search role determin move messag destin move task move task defin move activ perform move bid task previou section search task call move task move activ shown figur search determin move messag destin move task search task receiv back success messag messag reason failur move task figur analysi option sequenc diagram mass system figur analysi option role diagram mass system figur analysi option search task mass system function move task mobil agent role basic search task analysi option shown figur receiv messag paramet role gener task mobil protocol defin task move task complet mase analysi mass system analysi option summari figur analysi option move task mass system ad mobil analysi phase mase possibl stretch step confin mobil goal includ captur goal step includ appli case refin role step mobil concept confin refin role step loss system definit option chosen option incorpor mobil design phase end chapter design phase case incorpor mobil analysi design step review impact due mobil creat agent construct system step respect mobil assembl agent class step option incorpor mobil mase design phase discuss creat agent class creat agent class design role system agent class agent class consist role analysi option chosen step analysi option special move role incorpor agent class role task protocol defin move task analysi phase analyz construct assembl agent class made mase agent architectur address necessit creation agent discuss section agent compon mase agent agent consist group compon connector compon compon environ defin map task protocol defin analysi phase compon repres actual function agent class design phase categor life span task life span persist transient persist task null transit start state state task start agent creat run task agent termin transient trigger event transit start state task start agent creation agent receiv trigger event transient task make multipl concurr execut task type type task proactiv heterogen reactiv task persist transient persist reactiv task null transit start state idl remain receiv trigger event agent transient reactiv task receiv trigger event agent begin process proactiv task continu gener request agent persist idl state heterogen task combin proactiv reactiv task start idl state gener request task agent enter idl state mase agent architectur defin compon creat task part role agent class compon classifi proactiv heterogen depend type task creat concurr task assum oper thread compon assum oper reactiv agent agent reactiv task proactiv agent agent proactiv heterogen task fact agent transient agent exist order receiv extern request agent start transient compon problem necessit creat agent start agent control initi handl initi messag receiv agent system figur show messag pass architectur agent compon start creat agent compon accomplish separ step step basic agent state transit common creat step agent compon complet agent transient compon step agent compon complet agent persist compon step agent compon complet agent transient persist compon start compon compon start mase agent messag initi send agent compon initi receiv agent execut environ transform agent compon mase agent initi receiv initi send messag figur messag pass architectur start step basic agent compon start compon compon start basic mase agent compon shown figur part compon combin transient persist compon agent class possess messag agent initi handl agent compon shown transit idl state state activ receiv messag determin execut recipi determin compon receiv compon start messag ambigu solut problem left futur research compon run relai action forward messag compon agent receiv termin messag owner case agent termin compon oper idl step transient agent compon figur basic agent compon diagram transient agent compon creat agent class consist transient compon move activ compon addit basic agent compon support case shown bold figur idl figur agent compon agent transient compon null transit ad start state idl state transient compon start receipt extern intern messag state ad activ handl case messag belong exist compon compon startup ad list activ compon activ state receiv messag event start transient start agent messag step persist agent compon persist agent compon creat agent class persist compon move activ addit basic agent compon support case shown bold figur state activ ad null transit start state state persist compon start agent creat case error start transit state end state trigger compon start transit state idl state trigger transit action function input design period time set timer idl figur agent compon agent persist compon time interv transit idl state state trigger activ state determin compon process compon transit idl state trigger timer reset compon process work complet transit trigger check statu persist compon agent termin case compon failur transit state idl state requir handl case extern messag belong exist compon step agent compon agent compon creat agent class consist transient persist compon move activ state transit diagram option basic agent transient compon addit state agent compon combin shown figur idl figur agent compon agent transient persist compon timer logic ad agent transient compon consid process forev termin messag receiv owner agent compon label reactiv proactiv construct agent compon analysi construct assembl agent class step mobil impact accomplish state diagram compon replac diagram action transit repres entir execut model call move permit restrict move activ compon elimin complex interrupt call move reconstruct proper state move ensur move activ defin compon addit construct design step assembl agent class compon creat assembl agent class step analysi option move activ transform directli state diagram compon compon compon mobil agent includ move activ state mobil compon compon mobil agent includ move activ state case analysi option move compon creat special move task mobil compon option option discuss incorpor mobil mase design mobil compon handl move separ mobil compon handl move agent compon creat section modifi handl move option discuss detail section discuss list move requir option address present activ minimum perform order move successfulli activ compon inform move request mobil compon agent persist mobil compon compon receiv move request messag agent singl transient mobil compon compon receiv move request messag instanc transient mobil compon execut time agent mobil compon compon respond move request messag inform move compon save work perform termin error impli compon save current state termin task end state end state ad compon creat task compon termin agent move address agent compon activ restart requir impli function ad restart compon correct state address addit activ add robust fall autonom natur compon decid stop current process move move compon decid move complet goal case compon deni move request compon decid move hinder complet goal case compon accept move request compon call move handl move call list design option fulfil requir list vari respect compon handl requir individu compon handl move function mobil compon transform handl move entir agent mobil compon satisfi requir discuss handl interfac agent mobil agent system agent execut advantag approach minor requir agent compon compon move logic move capabl compon disadvantag compon move capabl awar activ compon notifi compon move occur commun overhead shown figur disadvantag duplic move function compon requir mobil move capabl compon exact code conduct move final disadvantag approach move capabl compon control compon control compon notion agent compon agent compon compon list compon list move requir readi mobil compon move requir move requir readi readi compon figur sequenc diagram mobil compon handl move mobil compon handl move function special move compon creat handl move entir agent case design move compon satisfi requir discuss handl interfac agent mobil agent system agent execut option obviou result analysi option separ move role task combin agent class role move requir special move task transform special move compon design phase move compon handl move agent mobil compon previou design option advantag approach duplic move function compon move function move compon disadvantag approach commun move mobil compon design option inform compon agent compon initi move request receiv compon result ad addit messag move process present design option sequenc diagram show commun overhead shown figur agent compon compon list compon list move requir readi move compon move move requir mobil compon readi compon figur sequenc diagram move compon handl move agent compon handl move function agent compon transform handl move entir agent case design agent compon satisfi requir discuss handl interfac agent mobil agent system agent execut advantag option reduc commun activ move process compar design option shown figur reduc commun fact messag requir compon receiv inform compon elimin agent compon access compon inform easili send messag compon advantag duplic move function mobil compon design option move function handl agent compon option central design option disadvantag option modular option conclud discuss design option option illustr mass system section agent compon mass system move move requir move requir mobil compon readi readi compon figur sequenc diagram agent compon handl move creat agent class system role agent class shown figur analysi option bidder role searcher role combin agent class manag role separ agent class call agent class diagram exampl illustr design option figur analysi option agent class diagram mass system shown figur analysi option searcher role combin agent class manag role separ agent class call agent class diagram illustr design option figur analysi option agent class diagram mass system compon belong agent class transform task transform process defin mobil requir section ad compon bidder compon design option present section compon resid agent class mobil function fulfil requir list section bidder compon transform requir mobil addit shown figur transit state state fulfil requir state state select design receipt messag state start state end state elig receiv move request messag requir satisfi function state transit state fourth requir fulfil transit restor state transit restor state state diagram ad function fulfil requir list section deni move request left design includ bidder compon impli automat accept move requir messag receiv figur bidder compon mass system agent compon design option search compon design option reason diagram compon present design option section design option figur show search compon agent class section transform handl mobil search compon start intern start messag paramet state inform process state search compon compon search compon call move null bid compon search compon search task search compon transit state null agent move search compon restart compon shutdown previou address restor wait search updat figur design option search compon mass system restor function restor state handl restart compon compon start reason agent perform goal intern termin messag agent compon function restor state determin current address result function conjunct determin state compon start boolean variabl state transit restor state proper state continu execut search compon transit search state agent move move made function state design agent decid move move search compon list activ compon agent compon list empti broadcast function send move requir messag activ compon includ agent compon compon save state search compon signal mobil agent system agent move move deni compon restart move success agent compon start address start search compon reestablish function reestablish state figur show agent compon design option agent compon combin transient persist discuss section bidder compon persist compon search compon transient compon idl reestablish figur design option agent compon mass system addit due mobil paramet null agent start transit state agent start transit reestablish state state activ compon time move restart proper state problem start compon agent termin agent transit idl state intern messag receiv mobil compon agent compon retriev list send request compon messag receiv mobil compon agent compon transit state agent compon state mobil compon agent compon termin design option option move compon creat move task part agent class figur show move compon mass system move compon transient compon start agent move mobil compon request move mass search compon request move process move search compon design option figur show search compon option compon unchang transform defin numer mobil addit compon start intern messag agent compon compon null impli compon creat time messag bidder compon agent move compon restart locat updat wait restor figur design option mobil compon mass system compon transit search state move success move messag bidder compon search compon termin search compon creat search compar function state determin move order fulfil search request move compon transit state state compon save intern messag move compon move termin messag receiv move compon compon termin move compon send messag bidder compon termin restor search design option wait figur design option search compon mass system option agent compon handl move agent figur show agent compon option search compon design option transit trigger startup agent compon agent instanti agent compon transit state agent move agent compon transit reestablish state compon activ move call previou address restart agent compon transit idl state agent compon receiv intern request move messag agent compon transit state case previou design option design includ logic function state move deni agent compon send intern move deni messag compon call move move deni agent compon transit state idl reestablish wait updat figur design option agent compon mass system function state return list activ compon agent compon access method call function directli search move compon previou design option send messag agent compon request inform compon call move remov list compon receiv list activ compon empti activ compon intern messag repli receiv compon compon remov list list empti agent compon save state call move method interfac mobil agent system perform move move fail agent compon transit reestablish state compon restart proper state move success mobil agent system shutdown agent compon address restart agent compon address select analysi design option mobil select option phase determin examin advantag disadvantag option relationship option analysi option select analysi option restrict design analysi option design option feasibl option select design option feasibl design phase option select analysi option step analysi phase option affect analysi phase step option left major move detail handl design reduc complex analysi option addit move specif section analysi option mention design choic design option select reason duplic move function similar option requir addit compon ad system option option process move agent agent compon option option gave mobil compon amount power compon option power agent compon option lowest commun overhead option move process summari phase step mase methodolog examin determin mobil incorpor mobil present mase analysi phase expand ad analysi phase mobil option explor detail advantag disadvantag option exist mobil design phase mobil present analysi phase creation map concurr task exist agent compon mobil carri analysi phase design phase model design phase addit function order properli handl mobil option ad function present analyz advantag disadvantag option analysi design phase select chapter transform add mobil analysi design model mase defin iii design chapter present transform increment add mobil function agent architectur section present transform develop chang gener agent architectur design model gener mobil design model section present analysi phase transform section present design phase transform transform option ad mobil function mase methodolog formal transform defin complet analysi model design model transform process shown graphic figur analysi design design design code gener carolina implement mobil design model analysi model transform gener design model mobil transform code gener aglet implement figur mase transform architectur code gener implement transform transform process defin includ transform ensur move activ remain compon state transform creat agent compon agent class defin section chapter transform mobil transform defin subsequ section secur commun protocol transform mobil transform discuss thesi softwar code gener futur research mobil agent system accomplish mobil design model complet order defin formal model transform formal defin model requir exact semant predict behavior transform model thesi subset model defin discuss detail appendix transform function defin function determin type compon exist defin list function return true start end state move activ function return true transient compon agent class function return true persist compon agent class function return true mobil compon agent class function return true mobil compon function return true mobil state function count compon move activ mobil agent class function return true compon transient defin function return boolean precondit postcondit true tend transit function return boolean precondit true postcondit st transit st start null function return boolean precondit true postcondit st transit st null function return boolean precondit true postcondit st st fname function return boolean precondit true postcondit st fname function return boolean precondit true postcondit fname function return integ precondit integ postcondit st st action fname function return boolean precondit true postcondit st transit null analysi design complet transform move activ carri analysi phase design phase agent compon creat agent class transform creat ensur move activ remain compon state tabl transform insert stage transform process defin special case transform build agent compon defin ensur mobil remain compon compon state check ensur state call move activ remain compon state tabl happen extern occur compon state move activ extern pertain occur move state compon state diagram shown result perform transform left end discuss section mase agent architectur state figur compon transform defin start end state move activ transit move state label end transit move state label start transform add end marker transit move state end marker transit move state figur show compon figur transform complet transform state transit transit tend state figur compon diagram figur transform agent compon creation agent compon agent class system requir mobil compon tabl determin agent compon transform execut agent compon mobil transform build agent compon accord function defin chapter ii section tabl agent compon transform mobil type compon act transform transient persist transient persist agent compon transform agent compon transform creat basic agent present section type compon possess agent class transform add idl state transit handl agent termin extern messag start compon figur show agent compon transform complet act ag agent ac st se paramet null null null null null null null null null null null null null null st ac ac idl figur agent compon diagram transform agent compon transform agent compon transform add present section handl start transient compon handl receipt invalid messag agent agent compon figur show agent compon diagram transform complet act ag st dr state st dr paramet null null dr null null null null null null null null null null idl figur agent compon diagram transform agent compon transform agent compon transform present section transit start state idl compon agent class transient move agent compon figur show agent compon diagram transform complet act ag st ss state st ss transit ss null null null tend idl figur agent compon diagram transform agent compon transform agent compon transform add present section handl receiv messag belong agent agent compon figur show proactiv agent compon diagram transform complet act ag st dr state st dr paramet pname fname null dr null null tend idl figur agent compon diagram transform agent compon transform agent compon transform add present section start persist compon agent creation set time interv agent compon transform execut agent transient persist compon figur show agent compon diagram transform complet act ag st es state st es fname null null es tend idl figur agent compon diagram transform agent compon transform agent compon transform add present section start persist compon agent compon transform execut agent persist compon figur show agent compon diagram transform complet act ag st es state st es null null es tend idl figur agent compon diagram transform agent compon transform agent compon transform add present section period check persist compon aliv agent compon transform execut agent persist compon figur show agent compon diagram transform complet act ag st es state st es paramet null null null null null null null null es null null null idl figur agent compon diagram transform agent compon transform agent compon transform present section transit state idl state ad function period check statu compon transform transform execut agent transient persist compon figur show agent compon diagram transform complet act ag st state st transit null null tend idl figur agent compon diagram transform agent compon transform agent compon transform present section transit start state agent class persist compon move agent compon figur show agent compon diagram transform complet act ag st ss state st ss transit ss null null null tend summari idl figur agent compon diagram transform design transform defin prevent move activ creat agent compon agent class system transform creat agent compon execut base mobil type compon agent class design transform process defin gener design model mobil design model transform complet design design transform execut analysi set transform deal ad mobil function compon includ agent compon mobil agent class group transform increment add mobil function agent compon transform ad mobil function compon belong mobil agent class defin agent compon mobil section cover transform add mobil function agent compon section tabl defin agent compon mobil transform execut agent class type compon agent class determin transform execut class shown tabl transform execut automat transform execut depend compon type transform execut combin transform separ understand readabl tabl agent compon mobil transform type compon transform transient persist transient persist agent compon mobil transform agent compon mobil transform present section state mobil agent compon figur show agent compon diagram transform complet ag st st paramet om ov idl reestablish wait updat figur agent compon diagram transform agent compon mobil transform agent compon mobil transform add present section state agent compon figur show agent compon diagram transform complet ag st tm state st md tm paramet null null md null md null null null md null null null null null tm idl reestablish wait figur agent compon diagram transform agent compon mobil transform updat agent compon mobil transform add present section wait updat state agent compon figur show agent compon diagram transform complet ag st state st tm ws paramet fname null null null ws null ws null null null null null null ws null ws null null tm ov idl reestablish wait figur agent compon diagram transform agent compon mobil transform updat agent compon mobil transform add present section end idl state agent compon figur show agent compon diagram transform complet ag st tm state st tm es ss rs transit tm null null es null tm null null rs null ss null null rs null rs null null null rs null null es idl wait reestablish figur agent compon diagram transform agent compon mobil transform updat agent compon mobil transform present section final transit start state idl agent class transient agent compon figur show agent compon diagram transform complet ag st ss state st ss transit ss null null tend idl wait reestablish figur agent compon diagram transform agent compon mobil transform updat agent compon mobil transform present section final transit start state agent class persist agent compon figur show agent compon diagram transform complet ag st ss state st ss transit ss null null tend compon mobil idl reestablish wait figur agent compon diagram transform updat compon mobil agent class transform tabl transform execut compon broken smaller piec readabl tabl compon mobil transform compon persist transient mobil end transform mobil compon mobil transform compon mobil transform add end state compon belong mobil agent end state end state unreach point due fact compon belong mobil agent termin compon type ag st state st state es state es es compon mobil transform compon mobil transform add transit start state restor state compon belong mobil agent class transit start state restor state ensur compon start correctli agent move occur transit intern messag compon save termin move restart function restor state pass compon creation determin start state compon boolean variabl state transit restor state proper state continu execut figur show restor state transit ad compon ag st ss state st ss paramet pname fname ss null null null tend null restor figur state transit ad compon compon mobil transform compon mobil transform add transit restor state mobil compon mobil agent class function restor state return current address agent result function conjunct determin start state compon null agent move null agent move state compon save prior move boolean variabl state transit restor state proper start state compon figur show restor state transit ad mobil compon ag st ss state st ss paramet ss null null null tend null restor figur state transit ad mobil compon compon mobil transform compon mobil transform add state wait state mobil compon belong mobil agent class function state save state compon variabl move call compon function return compon pass agent compon call move wait state suspend compon receiv termin messag mean move request accept move deni messag figur show wait state ad mobil compon ag st st wait figur state ad mobil compon compon mobil transform compon mobil transform add transit link state creat end state mobil compon belong mobil agent class intern messag destin compon compon agent compon move compon move request compon wait confirm denial messag messag denial messag termin messag confirm messag figur show termin messag ad mobil compon ag st es state st mc ws es paramet mc null null null ws null null null ws null null es null true null ws null null es null true wait figur transit ad mobil compon compon mobil transform compon mobil transform modifi state guard condit transit state state move activ mobil compon state chang restor state creat guard condit chang concaten string state figur show transit transit modif ag st state st rs rs restor restor figur transit alter mobil compon compon mobil transform activ activ compon mobil transform add state transit partial handl process belong mobil receiv move requir messag agent compon case modifi compon mobil agent receiv messag agent mobil compon compon persist compon transform mobil compon compon transient compon transform mobil compon transform state ensur compon mobil agent respond intern messag agent compon readi transit inform agent compon termin pass current state agent compon state inform restart compon proper state address figur show state transit ad compon mobil agent class ag st es state st es paramet null null null es null tend null figur state transit ad compon compon mobil transform compon mobil transform add null transit state move activ state creat figur show null transit ad mobil compon ag st state st mc figur transit ad mobil compon compon mobil transform compon mobil transform modifi transit origin start state transit start state modifi start restor state ad guard condit transit chang concaten state transit figur show transit modifi ag st rs state st ss rs ss rs restor restor figur transit alter compon compon mobil transform compon mobil transform add transit handl process compon receiv messag agent compon valid state compon select design transform design select state compon move requir messag select state transit ad state state creat transit ad restor state select state guard concaten select state figur show transit ad ag st mr state st true rs mr rs event null null mr null null null null null mr null true figur transit ad compon compon mobil transform compon mobil transform remov move activ mobil compon agent class agent compon request move agent move activ mobil compon longer fname summari chapter process incorpor mobil mase methodolog formal predic logic equat present transform finish process gener gener mase design model analysi model gener mobil design model gener design model gener design model finish make move activ remain compon transform process defin ad agent compon agent class transform gener design model mobil design model accomplish ad mobil agent compon ad requir mobil function compon belong mobil agent class chapter iv demonstr oper gener mobil design model system convert model softwar code execut carolina mobil agent platform iv demonstr demonstr solut present chapter iii involv problem entir mase process includ mobil function problem mase analysi show mobil includ activ concurr task diagram analysi model transform design model transform process defin transform defin chapter iii gener design model transform mobil design model transform defin chapter iii mobil design model translat softwar code result program execut carolina mobil agent system section describ problem problem detail mobil agent mobil compon section present mase analysi problem section present mase design incorpor mobil made agenttool section present carolina implement screen captur show actual execut softwar solut travel plan system peopl constantli travel busi leisur reason travel air peopl travel agenc handl arrang trip peopl handl travel arrang arrang includ airlin reserv reserv hotel rental car person put arrang softwar system mobil agent handl task user input basic travel inform trip mobil agent dispatch make requir reserv automat report back complet itinerari user mobil agent travel place agent make reserv analysi analysi option mase analysi tp system shown start refin role step role model diagram shown figur displai task protocol tp system role bridg user system user input basic flight rental car role attempt make proper reserv airlin role reserv failur inform displai user role figur mase role model tp system task diagram present explain task task virtual ident task task present task role catalyst start system present figur show task diagram persist heterogen task start null transit begin state gener request receiv input user input separ flight rental car inform role counter start order determin result receiv reserv failur receiv final compil result displai user displai result task transit back idl state wait travel plan request user figur gather travel inform task tp system shown figur start flight inform messag receiv agent inform pertain reserv flight inform list place airlin agent list activ state determin agent move place agent requir move activ state execut agent move seat request prepar airlin agent approv reserv receiv reserv messag agent displai airlin agent make failur messag receiv task transit back state list place empti list agent attempt move place make reserv process continu reserv made list place empti list empti failur messag agent displai figur task tp system task final analysi phase task present explain shown figur task persist reactiv task start null transit idl state remain reserv messag receiv reserv reserv messag agent forward reserv agent reserv failur messag agent figur task tp system conclud analysi tp system mase concept mobil includ activ state task diagram section cover mase design analysi model transform design model agent compon creat agent system transform defin section agent compon belong mobil agent class tp transform handl mobil transform defin section mobil design design tp system mase consist step agent class identifi creat agent class step construct assembl agent class transform defin conjunct design transform defin chapter execut tp analysi includ agent class construct compon task harvest compon mobil transform defin chapter iii execut finish assembl agent class design step creat agent class step creat agent class tp system figur show agent class agent class creat role role combin agent class airlin role airlin agent class role agent class figur agent class tp system construct agent class transform defin includ transform defin execut analysi model agent class definit mobil transform defin chapter iii execut result analysi model transform defin chapter iii main agenttool menu bar transform head shown figur analysi design transform defin section group menu head creat agent agent compon mobil transform defin section group menu head agent compon mobil compon mobil transform defin section group menu head compon mobil creat agent compon figur transform menu agenttool select creat agent compon option transform menu agent compon transform creat agent compon agent class system high level view agent compon creat agent class plai role shown figur compon persist proactiv compon agent compon diagram creat section agent class shown figur figur compon agent class tp system figur agent compon agent class agent compon creat agent class agent compon transform compon shown figur transient agent section compon transient reactiv compon transit start state agent class mobil agent compon transform agent compon mobil add transit start state idl state figur agent compon plan travel agent class conclud analysi model agent compon transform mobil ad agent compon mobil agent class system agent compon mobil transform agent compon mobil tp agent class mobil select agent compon mobil option transform menu agent compon mobil transform execut add mobil function agent compon agent class result agent compon section shown figur figur agent compon agent class tp system agent compon mobil transform conclud made agent compon agent compon mobil transform mobil ad compon mobil agent class system compon mobil transform compon mobil tp system compon mobil select compon mobil option transform menu mobil function ad compon compon mobil transform show result figur show compon transform defin execut notic move activ state activ chang whatsoev agent compon creat base type compon agent class compon shown essenti compon figur compon transform defin agent compon agent compon mobil transform requir input design system compon mobil design select state receiv messag rule govern design present section dialog box shown figur inform design select state compon figur inform dialog select state receiv move requir messag design press button dialog box state select dialog box shown state receiv messag design select state figur show state select window select state compon demonstr state chosen receiv messag figur show complet compon compon mobil transform execut conclud analysi tp system mase methodolog incorpor mobil design transform softwar code execut carolina mobil agent platform figur state select window figur compon compon mobil transform carolina implement carolina mobil design model gener transform defin chapter iii tp system convert softwar code agent compon agent class system extens carolina base agent class special compon class creat compon agent class gener automat agenttool requir slight modif correct error code gener process startup tp agent carolina agent address compon belong agent start address agent airlin agent start carolina agent platform network agent transit respect idl state creation wait travel request plan agent incorpor graphic user interfac order requir travel user figur show gui tp system user input start end start end dai airlin choic rental car agenc choic click plan itinerari button start plan button press agent send travel inform agent agent start compon base inform receiv agent base inform start plan process figur travel planner graphic user interfac tp system airlin agent locat address compon decid move send move request agent agent automat accept move inform request compon termin inform compon save state termin output machin shown figur compon request move agent move network address compon agent ignor move request compon agent receiv messag move request messag compon compon termin gracefulli agent move locat figur tp system output show agent start travel plan process figur show output agent address agent compon run address agent arriv agent restart compon state inform compon save previou address compon determin agent move locat begin compon compon receiv rental car inform compon begin make reserv compon determin address airlin agent locat send messag agent destin agent receiv automat approv send termin messag compon send move requir messag compon compon shutdown agent attempt move locat compon compon compon agent move carolina agent platform track agent move forward messag address agent move compon reserv compon figur agent address figur show output tp system final address airlin agent compon run address agent arriv agent restart compon state inform compon save previou address compon determin agent move locat begin compon compon receiv flight inform compon begin make reserv compon determin move address wait reserv compon enter wait result state rental car reserv messag arriv compon forward result compon user machin termin fulfil goal compon receiv flight reserv compon forward result compon user machin compon termin goal fulfil remain aliv reactiv agent figur agent final address figur show final result tp system compon collect result messag compon displai user summari figur final result tp system chapter demonstr solut present chapter problem chapter feasibl system analyz design mase methodolog addit function defin chapter ii iii mobil design model creat mase model convert softwar code execut carolina mobil agent platform softwar code automat gener agenttool carolina environ travel plan system execut carolina environ demonstr feasibl solut present thesi chapter summar previou chapter discuss futur research extend work begun thesi futur work incorpor mobil mase methodolog turn intens origin enhanc requir design phase methodolog order support mobil chapter summar research accomplish thesi effort describ futur research augment broaden research addit mase methodolog previou chapter satisfi end goal research analyz varieti option incorpor mobil analysi design phase mase provid great insight requir agent mobil option select phase requir incorpor defin transform straightforward mobil ad mase analysi phase minim impact addit predefin move activ requir refin role step mobil design agent compon requir mase agent architectur incorpor behavior compon agent class agent compon control creation compon handl initi messag start transient compon agent class ensur continu oper reactiv provid fault toler case persist compon failur transform defin build agent compon agent class assembl agent class design step transform build model transform defin consid part process mobil compon mobil agent class agent compon handl move agent mobil compon determin destin agent movement compon requir receiv requir save current execut state termin autom convert gener design model mobil design includ agent compon mobil design model convert carolina agent platform softwar code model convert softwar code mobil agent platform discuss background section chapter mobil agent platform section appendix execut code carolina demonstr feasibl research ad mobil softwar engin methodolog power methodolog solv problem research softwar system design mase invalu capabl analyz design multiag system advantag mobil fulli autom transform process defin thesi addit basic underli function specif process multiag system minim effort futur research wai expand verifi work thesi discuss limit area incorpor dynam agent properti clone main area expand thesi area creat transform add secur design model area defin formal proof transform thesi verifi valid correct transform final softwar code mobil design model code gener automat gener clone instanti clone instanti add power dynam agent system mobil special case clone full clone capabl bring advantag parallel comput optim distribut task multiag system order solv perform bottleneck clone case agent compon carri detail instanti agent capabl perform task ensur agent multiag system fulfil goal agent collabor instanti differ mobil respect agent compon decid instanti agent start process instanti ad secur design model secur major concern area comput multiag system mobil agent except defin transform add secur gener design model mobil import addit mase methodolog capabl design system mobil agent ad mase secur concern mobil agent multiag system design secur mase design model greatli formal proof transform exampl thesi show transform work cover formal proof requir make transform correct order formal defin semant mase model formal automat code gener gener code execut goal research field comput scienc agenttool automat code gener agent carolina agent platform demonstr system chapter modifi extend includ code compon code mobil agent system straightforward attain goal summari mobil agent technolog excit field area artifici intellig softwar engin thesi start bridg gap softwar engin methodolog mobil agent system merg area power solv complex problem face air forc depart era distribut comput background order solv problem integr dynam agent concept multiag design methodolog good understand dynam multiag softwar engin methodolog agent platform support dynam agent oper requir section devot discuss dynam agent advantag special agent cover section current methodolog section overview properti capabl mobil agent platform cover section dynam agent build high qualiti softwar real world applic difficult construct task face human todai number complex real world compon relationship compon make model real world difficult real world problem dynam heterogen softwar engin approach tackl task model distribut system includ orient methodolog methodolog model real world abstract call object object repres real world entiti airplan room encapsul attribut object capac speed limit object encapsul method access chang attribut describ object method perform action object method exampl interact object consist object call method object interact defin design phase static life system mean object call method object call model origin design system object structur hierarchi organ design phase organ static chang lifetim system system aspect oo inadequ develop complex distribut interact comput entiti defin priori chang execut system organiz structur defin priori chang execut system interact entiti occur plan organiz structur time ensur system goal accomplish internet distribut comput environ begun domin comput world approach develop applic oper environ critic research disciplin artifici intellig start develop approach solv problem distribut environ current past work artifici intellig develop softwar system intellig human agent agent softwar system displai trait properti autonom control directli human agent cooper agent commun achiev goal percept agent react make environ agent passiv entiti object exhibit behavior past work artifici intellig consist singl agent singl capac solv problem limit perspect comput resourc real world problem gener complex unpredict handl singl agent ai research realiz limit singl agent work multiag system system execut machin distribut multipl network machin distribut multiag system bring power modular form flexibl organ handl complex size real world problem multiag system provid effici solut real world problem resourc distribut agent make system static dynam dynam agent agent possess clone abil agent creat instanc instanti abil agent creat instanc type class agent mobil abil agent move machin machin network agent focu research dai arena properti mobil receiv attent specif properti found current literatur foundat intellig physic agent instanti mobil group mobil simpl full protocol defin properti agent simpl protocol reli agent platform involv perform work agent full protocol split work agent platform shehori fipa specif mobil special instanc clone group mobil clone definit mobil fipa simpl mobil protocol figur show fipa simpl mobil protocol protocol agent send request move agent platform execut home platform termin agent send destin platform agent restart destin platform agent protocol effect deleg mobil oper agent platform agent agent platform dynam agent advantag termin request request agent platform agent execut figur fipa simpl mobil protocol dynam agent system shown solv network relat problem find servic inform world wide web system shown advantag interact remot procedur call messag term applic network factor dynam agent reduc commun bandwidth cost hardwar oper system independ depend mobil agent platform execut fault toler maintain optim configur dynam agent advantag network commun cost bandwidth exampl type network includ internet connect cellular phone network network current network commun reli heavili synchron protocol rpc protocol network machin call procedur machin call machin send data receiv machin wait send data messag pass network request servic acknowledg receiv messag approach requir continu connect establish protocol messag exchang multipl interact order complet task great deal network bandwidth ti type connect frequenc commun dynam agent avoid commun overhead migrat machin perform data gather machin data process agent travel back origin machin commun traffic case reduc agent move bandwidth save relev inform network current distribut system includ internet heterogen term hardwar run softwar defin dynam agent platform written java devic independ softwar languag natur fit wide heterogen execut environ platform reli execut environ independ dynam agent platform layer independ system loss network connect period problem occur regularli network dynam agent system perceiv environ function action case system crash dynam agent system persist storag agent recoveri agent straightforward network agent system migrat connect restor machin agent notifi agent system agent option migrat machin network store machin oper processor agent overload occur multiag system processor overload dynam agent migrat machin network processor overload case multipl dynam function distribut network optim configur order complet task case agent overload dynam agent make clone perform task dynam agent capabl instanti agent perform task summari agent natur abstract object methodolog properti dynam agent clone thought extens gener definit agent shown dynam agent poss tremend network function replac current network protocol rpc messag function provid dynam agent system singl altern provid level function main reason dynam agent technolog replac protocol deal lack network function accomplish dynam agent dynam agent system network protocol reason rpc messag year success dynam agent technolog infanc issu work includ dynam agent system mobil industri date fipa object model group begun develop standard wide accept softwar engin methodolog differ term abstract model system abstract includ complex system organiz relationship includ build mechan agent flexibl organ current methodolog includ analysi design multi agent multiag system engin methodolog discuss section analysi design gaia methodolog base view system comput organ consist interact role analysi phase role model interact model gaia design phase agent servic model acquaint model main model gaia methodolog shown figur arrow repres input model role model requir statement agent model servic model interact model figur gaia methodolog role model schema identifi kei role system role abstract definit expect function role type protocol permiss identifi resourc knowledg agent limit resourc carri role defin function role gaia categori live safeti live impli refer action defin role safeti ensur undesir condit live carri protocol formal defin pattern interact occur system role protocol repres interact model role model schema role shown figur fill protocol definit interact model role shown figur acquaint model analysi design role role involv ensur fill inform worker fresh read suppli maker empti level ω figur role model schema fill fill machin suppli figur fill protocol definit design phase gaia concern transform analysi model suffici low level abstract tradit design techniqu appli model gener design phase shown figur agent model identifi agent type system agent instanc repres agent type servic model identifi servic main properti servic agent role servic coher block activ agent perform multi agent analysi design method develop multiag system view multiag system system softwar agent plai role predetermin scenario protocol analysi phase consist scenario role function conceptu data static dynam descript world interact model design phase consist ma architectur scenario object agent system design valid model techniqu user collabor analysi phase describ role main knowledg structur scenario graphic visual descript peopl perform task scenario set role plai agent involv scenario behavior diagram describ scenario diagram outlin scenario term agent role local inform knowledg store contribut interact agent plai specif role local inform knowledg store behavior diagram analyz term attribut conceptu data structur creat featur main element includ local conceptu data structur specifi static properti fact base object diagram reflect occur attribut world agent act step consist identifi structur artifact creat manipul interact place user sa model form gener hand comput object design phase transform model analysi formal specif input gener actual code agent scenario analysi role make scenario sa support role identifi behavior diagram analysi step assign behavior role select structur procedur behavior object model obtain fourth analysi step design formal knowledg structur sa action space reason space belief structur agent deriv data conceptu structur creat analysi step space action space creat role agent plai scenario descript analysi phase start point model code ma gener system valid manual trigger behavior sa system multiag system engin air forc institut technolog agent research group develop matur methodolog mase methodolog design cover entir life cycl develop implement multiag system overview mase shown figur analysi shown hand side step box repres model step goal hierarchi concurr task diagram requir case sequenc diagram role agent class agent captur goal appli case refin role creat agent class construct assembl agent class system design figur mase methodolog major differ oo mase analysi deal problem initi broken oo analyst evalu initi system specif context term separ exist system creat object diagram show object analysi design step mase goal system identifi specif structur goal hierarchi diagram shown figur goal identifi function system goal stabl chang develop cycl determin file delet modifi detect notifi admin system file violat detect user attempt modifi file detect notifi administr host violat notifi administr violat figur goal hierarchi diagram detect notifi administr login violat determin invalid user login ensur admin receiv notif notifi administr login violat step mase deal creat case identifi role exist system outlin initi commun path role role abstract descript expect function agent system requir perform made system goal role expect satisfi role thought posit compani structur presid chief inform offic posit agent plai role goal role partli defin sequenc diagram case gather initi system context user stori case sequenc event defin system behavior type case properli describ system behavior sequenc event role defin sequenc diagram event correspond inform pass individu role case sequenc diagram gener correspond case mase sequenc diagram shown figur user report figur sequenc diagram notifi acknowledg goal captur system behavior model case sequenc analysi step transform goal accomplish step structur goal sequenc diagram transform role task role task basic build block develop multiag system system goal accomplish goal role agent class plai role gener map goal role case goal combin singl role map goal role mase shown figur figur goal map role role exhibit behavior order accomplish goal behavior model concurr task role concurr task defin behavior sequenc diagram step appli initi defin task concurr task task oper thread control graphic concurr task diagram built finit state automata action state diagram function role perform transit state repres intern coordin task role interact task role figur show concurr task diagram figur repres role multiag system task idl regist figur registr task concurr task goal mase defin behavior agent ty intern reason interact intern process extern interact agent task categor life span task life span persist transient persist task null transit start state state task start agent creat run task agent termin transient trigger event transit start state task start agent creation agent receiv trigger event transient task make multipl concurr execut task type task task task figur mase role model task task task type task proactiv heterogen reactiv task persist transient persist reactiv task null transit start state idl remain receiv trigger event agent transient reactiv task receiv trigger event agent begin process proactiv task continu gener request agent persist idl state heterogen task combin proactiv reactiv start idl state gener request task agent enter idl state analysi phase step design phase step creat agent class agent class model type agent exist system similar object class agent class defin role plai attribut method agent instanti agent class case object oo dynam plai role execut system assembl agent class class identifi mechan agent commun mase coordin protocol defin agent agent class graphic displai agent class diagram shown figur agent class role agent plai box line box repres line point agent initi agent respond notifi figur agent class diagram user detail defin construct design step detail deriv concurr task event messag task sequenc diagram translat send receiv transit complimentari commun class diagram commun class diagram defin state model finit state automaton state initi agent respond agent small support goal design phase assembl agent step step concern creat intern agent class accomplish defin agent architectur compon make architectur exampl agent architectur plan knowledg architectur essenti compon connector compon state execut graphic repres class oo diagram attribut method compon assembl defin agent class architectur combin architectur form architectur defin architectur compon scratch method modif compon architectur delet modifi attribut method compon state interact compon connector type agent outer agent agent connector connect compon agent give compon access attribut method compon outer agent connector connect compon agent class extern compon agent class entiti environ agent outer agent connector repres arrow outer agent connector thicker dash direct arrow denot entiti access entiti compon diagram mase outer agent connector shown figur control messag figur mase compon diagram effector system final step design phase mase step defin agent class instanti type locat agent system shown diagram box diagram repres agent line repres agent dash line group box mean agent resid machin diagram primarili identifi machin agent tune system maxim process power network bandwidth diagram shown figur summari notifi figur diagram shown mase methodolog cover entir lifecycl multiag system design methodolog similar base view multiag system comput organ consist interact role methodolog agent plai role time agent methodolog involv time methodolog differ term amount detail provid function found mase provid detail defin gaia methodolog interact mase provid model build intern knowledg structur agent mase methodolog specifi locat agent final system major exist methodolog abil analyz design multiag system agent dynam mobil agent platform multiag system analyz design util dynam agent agent platform requir handl execut agent agent gener softwar system abil dispatch termin agent foundat intellig physic agent defin agent manag refer outlin logic compon includ agent agent platform execut environ agent exist agent manag system agent manag access ap agent commun channel agent exchang inform servic commun messag directori facilit directori servic servic agent provid system agent platform secur manag agent maintain secur polici ap negoti access request agent agent resourc broker agent maintain broker softwar servic provid agent wrapper agent agent commun agent interact softwar current agent platform support includ concordia aglet workbench carolina provid variat capabl mobil agent platform discuss section concordia concordia mobil agent system develop mitsubishi electr horizon system laboratori concordia logic compon list fipa figur show current concordia server architectur figur concordia architectur agent manag handl transfer agent concordia server place agent execut persist manag queue manag work tandem agent manag ensur reliabl agent migrat surviv queue manag store state agent transfer concordia server server queue manag period attempt resend agent node back onlin persist manag store state agent disk recoveri system crash agent itinerari control movement server server itinerari consist server address method agent start travel place list itinerari run method locat method finish agent travel locat itinerari process continu itinerari finish itinerari modifi agent execut agent creat author user carri ident travel secur manag verifi agent user creat secur manag protect agent agent transmiss server resourc directori manag directori facilit function concordia event manag agent commun channel asynchron distribut event agent collabor form commun concordia server event basic messag agent agent event mail list event type automat subscrib agent agent join event group agent group receiv event member group event form basi agent collabor telescript odyssei version commerci implement mobil agent system telescript implement fipa agent manag refer model logic compon agent resourc broker wrapper agent technolog concept electron public network servic good provid consum find transact busi electron network exist begin internet telescript base author permit telescript model network comput collect place place offer servic mobil agent exampl electron marketplac directori ticket flower place agent agent manag directori facilit compon fipa model agent repres provid consum stationari travel place agent travel place call instruct meet occur agent locat place agent conduct busi connect agent machin commun connect meet correspond agent commun channel compon fipa model author deal verifi ident agent secur reason permit control capabl place agent exampl permit agent permiss execut maximum lifetim maximum amount comput resourc agent author permit correspond agent platform secur manag compon fipa model aglet workbench aglet workbench mobil agent architectur design ibm aglet workbench implement agent agent manag secur manag agent commun channel compon fipa agent manag refer model aglet mobil agent execut workbench agent platform function provid workbench workbench toolkit creat aglet place aglet execut context stationari object workbench act agent manag aglet context manag aglet run workbench time context creat aglet creat context aglet move context context call aglet commun messag pass messag simpli object pass aglet synchron asynchron multicast support context messag pass aglet proxi proxi object repres aglet commun interfac secur locat transpar messag pass proxi object proxi object send messag intend aglet aglet local remot host context proxi jointli handl secur aglet context provid secur protect host system resourc aglet oper context context protect aglet interf context proxi protect aglet ensur commun handl messag pass aglet invok method aglet carolina carolina develop connecticut part agent distribut goal satisfact project wright state conduct research jointli figur show current carolina server architectur port carolina execut port port thread system manag interfac figur carolina architectur system manag port logic compon list fipa provid agent execut agent manag system agent commun channel agent execut environ common ap place agent code execut handl agent manag carolina handl agent execut local arriv port repositori inform agent server make kei compon commun system consist inform store directori agent uniqu agent creation machin current machin pointer messag store agent make agent commun channel carolina commun agent run carolina environ handl server due problem track mobil agent deliv messag time manner commun constitut departur multiag system made order ensur system condit agent size interact agent node system consist view network overhead minim central point failur commun agent complet reason time frame agent size accomplish requir agent uniqu agent commun locat inform inform share node maintain consist view share accomplish mobil commun agent wander agent commun agent inform current carolina server agent continu move server merg inform reflect accur inform wander agent track server physic locat startup server agent notifi carolina server server give locat server server shutdown server wander server move server shutdown broadcast messag virtual elimin commun protocol directli discuss consist view agent locat store agent broadcast messag find agent central locat lookup tabl directori agent singl point failur node system consist commun complet reason time commun agent run carolina server accomplish pass serial java object messag post server decid messag address local agent agent move remot host agent forward messag destin agent agent messag put remain agent address read server mean carolina agent constantli poll server messag wait messag address agent id agent type interact specif agent commun agent type messag agent messag server agent activ put agent correct id read messag agent agent type read messag messag read remov agent type read messag servic broker good address method work agent announc servic broker agent agent id piec inform record broker agent request list servic provid receiv list agent id host request agent send messag directli agent requir servic mobil handl object serial ident state class encapsul state ident pass agent platform reconstruct program code type mobil agent resid server code pass agent move carolina agent class basic method call arriv leav shown figur agent creat execut start birth method destin machin end job method leav method execut agent pass machin destin ip address death method execut agent di figur agent state carolina mobil agent arriv port process intend destin local machin regist agent deseri hand thread execut agent creat intend destin regist inform agent serial port summari dynam agent capabl provid execut environ fipa defin agent manag refer model defin capabl logic compon dynam agent system discuss aglet workbench agent agent manag system agent commun channel platform written java provid hardwar oper system independ differ platform function agent commun agent mobil handl concordia function term fipa logic compon autonom abil agent itinerari carolina support direct commun reason outlin platform agent move call command agent system platform method finish execut agent move requir summari chapter provid background inform critic piec system defin research field artifici intellig critic piec definit definit dynam evalu current softwar engin methodolog evalu current dynam agent platform agent natur extens object paradigm percept dynam agent agent addit instanti mobil differ term abstract model system abstract includ complex system organiz relationship includ build mechan agent flexibl organ special agent platform requir handl execut dynam agent agent platform softwar system abil minimum provid place dynam agent execut emploi dynam abil understand piec essenti order correctli integr dynam agent exist methodolog transform model appendix summat design model defin chapter ii thesi model model transform thesi chapter iii subset design model defin model formal defin semant model clarifi ensur predic behavior transform design model definit section defin type make mase design model type model defin object format exhibit figur curli bracket repres set squar bracket denot attribut sequenc type unifi model languag syntax graphic class diagram show type model relat uml class diagram figur show agent compon class class type defin model aggreg compon class diagram attribut type repres parent class aggreg relationship atyp figur graphic type agent figur class diagram type design phase mase agent class diagram model mase design phase show agent class role agent defin agent class agent type repres agent defin agent class diagram defin particip agent type uniqu distinguish agent type system role attribut transform definit thesi compon agent string figur agent type state defin compon figur show compon type agent type compon reserv agent compon agent class state tabl compon string figur compon type defin behavior concurr task compon figur show type state transit state attribut repres set state task compon time transit attribut repres set transit state uml class diagram figur graphic overview type defin show relationship figur type state figur class diagram mention previou state tabl state transit figur displai state type transform defin thesi state repres intern process compon attribut uniqu state tabl sequenc action execut state entri state tabl start state begin state tabl state tabl end state end state tabl applic state string figur state type transit transit element make state tabl defin commun system connector state state tabl transit defin start end receiv guard action transmiss event syntax transit state diagram trigger transit assum occur instantan progress entiti state state state back state action execut order transmiss transit enabl condit true state current state trigger event gener guard condit evalu true action state complet transit trigger condit assum hold transit enabl guard transit enabl transit type concurr task compon model shown figur differ semant transit model compon model attribut shown transit event transit state tabl compon defin intern event compon agent instanc start end attribut mark start end part transform defin thesi action transit state event boolean express state boolean boolean figur transit type action repres read percept intern reason activ effector make environ repres actual process state state tabl action defin form function number input paramet result form singl tupl tupl assign syntax action shown result figur displai action type repres assign statement repres result action sequenc string repres assign statement sequenc string action figur action type defin attribut sequenc input paramet type type shown figur paramet type show figur defin attribut event string figur type paramet string figur paramet type event repres messag intern system figur displai event type perform intent messag repres attribut content messag repres sequenc paramet previou section event string figur event type intern event distinguish extern event concurr task diagram extern event repres shown figur messag receiv repres event sender messag repres string event string figur type trigger transit concurr task diagram syntax transit shown summari appendix model mase relationship model model made type defin chapter ii thesi thesi defin transform chapter defin attribut relationship type bibliographi technolog telecommun good mobil object system programm internet intern mo agent behavior concurr defin behavior social autonom agent agent behavior concurr defin behavior social air forc institut technic report juli wood system intern journal softwar engin knowledg agent manag contract negoti applic nich mobil intern distribut object comput workshop gold ieee comput lo ca softwar artifici joint chief joint vision aglet applic program interfac white paper draft ibm tokyo research db mobil person approach integr entiti relationship concept softwar engin approach softwar north holland design method environ develop multiag australian workshop distribut artifici intellig work base multiag methodolog soft fuzzi neural network distribut artifici prentic hall compon base approach agent specif ms school air forc institut wright patterson air forc gm distribut goal satisfact intern icsc symposium mobil agent virtual organ approach agent mobil resourc ieee commun transform analysi model design model multiag system engin ms school air forc institut wright patterson air forc ai vol unit state air air forc vision agent white gener infrastructur collabor mobil mobil intern mf sa overview multiag system engin intern workshop softwar engin ireland nr theori knowledg engin nr gaia methodolog analysi journal autonom agent multiag vita lee born washington dc octob graduat rome free academi high york earn bachelor scienc comput scienc state york institut technolog earn commiss lt unit state air forc reserv complet offic train school march assign commun system comput august august assign joint staff support global command control system technic manag august august marri janet joachim york anna
ML/1478 6 chromat structur natur scene thoma howard hugh medic comput neurobiolog la california sloan center theoret la california lee howard hugh medic comput neurobiolog la california institut neural san la california sejnowski howard hugh medic comput neurobiolog la california institut neural san la california depart san la california abstract appli independ compon analysi imag order learn ecient color natur scene spectra singl algorithm found basi function broadband basi function similar natur spectra appli small imag algorithm found basi function chromat variat line color indic color oppon direct oppon strictli orthogon comparison princip compon analysi basi statist measur averag mutual show ica transform result sparser coe cient higher code ecienc nding suggest oppon encod signal lead higher code ica reveal underli statist properti color inform natur scene introduct ecient encod visual sensori inform import task imag process system studi provid insight code principl biolog visual system barlow goal sensori inform process transform input signal redund input reduc method nding linear basi function imag natur scene reduc redund imag field criterion found basi function local orient recept eld visual cortex similar result obtain ica algorithm bayesian approach lumin domin visual structur natur speci develop color vision make inform variat spectral composit light reach ey interest ecient code chromat structur natur imag color code code ecienc respect signal al found oppon code ecient encod human signal analysi cone natur scene al found princip compon close oppon function al studi al decorrel function depend spectral properti determin sole spectral statist environ ecolog factor constraint number spectral posit sensit oppon code optim transmit chromat inform optic necessarili ect chromat statist natur ultim goal visual system neuron nucleu primat show orthogon ax color space cortic cell restrict direct suggest code scheme encod chromat structur natur imag goal paper ecient chromat sensori inform redund reduc signi cantli independ compon analysi adapt learn spectral spatial natur chromat imag section describ motiv ica analyz spectral imag section illustr spectral decomposit ica basi function ecient encod natur spectra section describ spatial properti natur color found small imag patch spatial basi function encod imag ecient manner section discuss result compar method learn code color imag ica ica algorithm initi solv blind sourc separ mixtur set underli task separ mix signal retriev origin sourc signal mix distribut sourc contrast princip compon analysi ica decorrel signal order reduc statist make output signal statist independ ica base restrict orthogon ica assum sourc vector compon mutual independ sourc observ directli linear combin sourc scalar matrix column call basi function assum addit sensor goal ica basi function adapt learn observ data adapt process cost function mutual inform function minim adapt rule minimum sourc linearli independ variant ica adapt algorithm categor parametr algorithm main di erenc class algorithm parametr approach assum adapt prior distribut sourc densiti approach approxim underli statist cumul primari interest learn ecient distribut constraint learn ecient code natur imag case assum data encod sourc coecient figur show laplacian densiti function comparison gaussian densiti function distribut unit varianc laplacian prior sharpli peak heavi small percentag inform valu tail laplacian distribut data valu data distribut code perspect assum encod decod data small percentag coecient gaussian densiti data distribut larger portion coecient requir encod data basi function produc distribut statist ecient code learn rule natur gradient extens deriv appendix laplacian prior adapt basi function ident sign sign denot matrix chang basi function ad assum squar number sourc equal number sensor adapt process matrix goal analysi basi function data linearli extrem distribut adapt basi function ecient code repres spectral data imag natur scene analyz set imag natur scene detail descript imag paper al brie full data set consist imag size pixel pixel repres valu nm sampl nm step nm pixel size correspond deg visual angl imag record insid glass bristol garden chose imag obtain outdoor appar di erent illumin condit note imag grai plate mount tripod kodak intend refer calibr determin area imag occupi standard tripod imag sampl analysi restrict imag region area figur illustr experi ica figur spectral data imag pixel learn basi function observ spectra repres linear superposit scale basi function figur illustr linear decomposit observ imag patch spatial basi function section describ learn basi function experi independ compon natur spectra randomli sampl spectra imag pixel imag figur studi field al logarithm valu issu logarithm discuss al bene logarithm valu investig color signal import process ect spectral ection multipl natur convert process addit oper suitabl assum linear combin sourc unlik studi attempt made correct di erenc illumin di erent imag data variat illumin object imag imag preliminari found speed converg algorithm slow small peak sampl width occur fairli smooth basi function peak chang combin imag basi function stabl attribut small peak artifact introduc scene imag acquisit movement due wind natur wider spectral variat spectral rang nm relev color vision smooth spectra convolut triangular kernel nm half width half height speed converg reduc small peak basi function train train adapt step train spectra imag chosen randomli region imag standard set spectrum vector ensembl data scale unit varianc ensembl learn ica basi function sequenti block spectra learn basi function pixel spectra shown figur plot order norm figur show rel contribut basi function pixel spectra imag rst basi function broadband spectra basi function slight bia long wavelength basi function contribut part visibl basi function slightli short wavelength basi function singl peak dip higher wavelength basi function peak broader shift longer wavelength nm basi function peak locat peak basi function lack dip note show basi function obtain logarithm data spectral contrast low basi function linear valu similar shape calcul pca basi function imag spectra figur show result basi order eigenvalu contrast ica basi function show multipl basi function high spectral frequenc basi function peak region ica basi function con rm variat spectral characterist natur spectra eigenvalu spectrum rst compon explain varianc imag compar code ecienc compar code ecienc ica pca shannon theorem obtain lower bound number bit requir encod pixel spectrum log log input spectrum code deviat introduc error likelihood data base averag number bit requir encod pixel spectra randomli select imag figur xed code bit ica bit indic ica basi function encod natur spectra ecient pca compon compar form result coecient densiti pca comput normal sourc coecient pca ica transform data averag normal result ica sourc coecient pca note normal gaussian densiti suggest ica basi function produc spectra illustr ica minim mutual inform comput averag mutual inform spectra data tabl averag mutual inform origin pca transform data ica transform data independ compon color imag goal experi illustr figur analyz spatial properti chromat inform data set reduc comput ort number result basi convert spectra pixel vector cone excit valu attempt ecient code natur imag human cone excit valu multipli wavelength valu human cone sensit sum result valu imag reduc dimens dimens pixel imag patch chosen yield vector case data transform logarithm valu adapt basi function train train set spectra imag chosen randomli exclud imag region standard visual result method al plot basi function pixel color pixel indic combin cone valu patch normal valu cone excit compon pixel repres rel excit figur compon order norm histogram norm shown figur illustr chromat properti basi convert vector pixel project plane color space space similar macleod al coordin ax de ned show project horizont vertic axi pixel basi point plot locat color space color point pixel top part gure project plane dimens infer bright point figur show homogen chromat basi function order basi function tend chromat basi function ect fact natur lumin variat gener larger chromat variat basi function local similar found analysi grayscal natur imag chromat basi strong color chromat pixel lie roughli line origin color space basi function code green purpl figur basi function strong contribut rst quadrant chromat basi function high contribut modul light blue dark plane de ned lumin modul lower highli orient chromat basi function tilt blue versu orang color chromat basi function occupi fourth quadrant basi function lowest contribut strictli align color tend color direct basi function chromat horizont pure versu cone pca basi function gure show lter mark basi function local direct color space note chromat direct lter enhanc compar basi smaller contribut lead chromat variat lter chose scale data chromat direct approxim equal varianc scale factor comput figur show histogram rel contribut rst basi function gure plot distribut coecient rst basi function imag distribut high pair basi function low indic contribut pixel contribut basi function imag shown figur pixel imag rst divid pixel imag patch contribut calcul comput sourc coecient coecient show low contribut sky area high contribut tree indic basi function encod green dark area grai plate imag low green contribut similar sky region comparison pca compar ica result princip compon data singl found princip compon al princip ax unit direct vector logarithm cone space valu ica basi function singl pixel ica result ect fact natur color highli cone type respond color analyz imag al found separ chromat spatial patch color vari chromat spatial pattern found chromat ax analysi imag patch show similar clear deviat rule number patch show pixel color princip color pure compon low spatial frequenc separ chromat spatial dimens direct correl data compar code ecienc compar code ecienc ica pca imag patch method pixel spectra section averag number bit requir encod imag patch randomli select imag figur xed code bit ica bit pca di erenc ica pca signi support argument basi function ecient code orthogon compar form result coecient densiti pca comput normal sourc coecient pca ica transform data averag normal result ica sourc coecient pca suggest ica basi function produc imag patch case chromat imag averag mutual inform origin pca transform data ica transform data patch independ basi function found independ imag pca basi discuss appli independ compon analysi set imag natur scene goal ecient code chromat structur natur assum probabl densiti function sourc coecient data set consist imag terrestri natur plant rock strong specular imag basi function spectra singl pixel ica found basi function case broadband contrast pca basi function obtain data spectra natur occur illumin typic broadband small number paramet relat ica basi function natur spectra recent al investig illumin spectra natur environ rst ica basi function fairli broad band slight region visibl spectrum shape qualit similar illumin spectra forest scene al illumin ica basi function peak nm shape similar light forest shade al al determin rst princip compon spectra forest scene al basi function peak medium wavelength dip short match qualit variat spectra repres princip compon shown al show figur basi function spectra leav determin al peak basi function match close peak spectra natur illumin vari independ similar basi function natur spectra question ica separ chromat contribut illumin natur scene investig futur due spectral locat basi function ectiv stimul basi function question relat primat cone spectra natur spectra discuss studi sensit evolv monkei nding food imag data set search ecient code yield function peak region human sensit basi function imag appli small imag ica found homogen basi function chromat basi function chromat basi function show pronounc chromat compon fell line origin color space direct line coincid color space ax basi function lie chromat basi function form line tilt respect cone axi ect distribut chromat imag natur coordin color space neg correl ica direct correspond maxim independ extract statist structur input ica found direct pca yield basi function limit orthogon constraint chromat properti neuron primat correspond variat ax cortic neuron show sensit intermedi direct result pca match di erenc suspect oppon code direct cone oppon visual system transmit reliabl visual inform inform recod order ect statist structur environ reduc spectral dimens convert spectra human cone space reduc comput displai interpret result chosen interest visual inform natur choic recent studi tailor al analyz jpeg imag extend ica algorithm result basi function de ned rgb space basi function qualit similar basi chromat basi function main direct respect color space result compar detail data qualit di di erent ica algorithm lead code di erent ecienc ica method ensur result sensit choic prior ica appli ica includ method oja data set found produc similar result result basi function coecient distribut encod di erenc di erent ica method note method xed distribut coecient independ compon result insensit speci ica method result laplacian prior similar di erenc ica method reason laplacian prior distribut model densiti coecient essenti ecient encod signal sourc densiti model result similar basi function densiti give code shown al sucient condit signal code maximum posterior code method found ica method bell sejnowski lee al tailor al result basi function give distribut method lee al appli grayscal imag independ compon analysi natur spectra yield basi function broadband broad peak shape show similar spectra natur illumin natur indic ica analyz chromat structur natur scene analysi imag patch reveal basi function oppon direct comparison princip compon suggest basi function lead ecient encod chromat inform appendix independ compon analysi ica nding linear system multivari data minim mutual inform axial project input data direct ax system determin statist origin data goal ica perform linear transform make result sourc output statist independ assum vector compon mutual independ vector correspond independ scalar valu sourc signal write multivari pdf vector product margin independ distribut data vector xn observ scalar matrix column call basi function mix assum sourc mix channel case rank data correl matrix estim number sourc case set basi function adapt assum squar mix matrix compon observ vector longer multivari pdf satisfi product equal mutual inform observ vector diverg multivari densiti densiti written product form log dx mutual inform posit equal compon independ goal ica linear transform depend sensor signal make output independ wx estim sourc sourc recov permut scale chang learn algorithm adapt basi function deriv inform maxim principl maximum likelihood estim method mle approach data likelihood deriv margin sourc note inform maxim approach ica maximum likelihood estim approach case addit assum squar matrix uniqu express data condit likelihood function delta note integr scalar data likelihood express function log log log learn rule obtain maxim respect natur gradient extens aa aa log gener ica learn rule involv prior knowledg implement applic speci ica learn rule primari interest learn ecient distribut case assum data inform encod coecient laplacian prior sharpli peak heavi tail constraint studi learn ecient code natur imag laplacian prior reduc simpl sign function learn rule analysi learn rule experi figur nding basi function acknowledg michael david field fruit make imag data set anonym review valuabl comment lee support foundat correspond thoma current biologi iii und refer hb barlow principl underli transform sensori messag wa sensori page mit press ba dj field emerg recept eld properti learn code natur imag bell sejnowski independ compon natur scene edg lter vision ms ba framework adapt comparison imag code journal optic societi america oppon colour code optimum colour inform transmiss retina royal societi london statist cone natur implic visual code journal optic societi america partridg visual acquisit visual inform journal cost spatial vision nato asi seri life vol page plenum press field goal sensori neural chromat mechan nucleu journal chromat mechan striat cortex journal interact stimulu background chromat primari visual cortex investig visual blind separ part adapt algorithm base architectur signal comon independ compon analysi signal bell sejnowski approach blind separ blind deconvolut neural lee independ compon theori applic kluwer academ sejnowski independ compon analysi extend algorithm mix sourc neural oja fast algorithm independ compon analysi neural jf contrast independ compon analysi neural color lumin inform natur scene journal optic societi america sejnowski spectral independ compon natur scene technic report institut neural comput septemb ms sejnowski learn neural johnson spectral sensit human cone journal optic societi america macleod chromat diagram show cone excit stimuli equal lumin journal optic societi webster adapt color statist natur imag vision color concept quantit data formula ed evalu linear model surfac spectral small number paramet journal optic societi america linear basi natur arti cial illumin journal optic societi america osorio color signal natur characterist spectra ect natur illumin journal optic societi america measur analysi object spectra color research place grew origin primat colour vision journal osorio colour vision adapt primat royal societi london nagl osorio tune human minim chromat signal natur condit royal societi london independ compon lter natur scene soc neurosci ms exibl prior independ compon analysi neural bd tj sejnowski code joint symposium neural volum page institut neural comput sejnowski classi cation mixtur model ica advanc neural inform process system page mit cover editor element inform volum john wilei mackai maximum likelihood covari algorithm independ compon analysi august pearlmutt gener ica intern confer neural inform hong septemb page maximum likelihood blind sourc separ ieee signal process april amari natur gradient work ecient learn neural tabl tabl code ecienc ica pca pixel spectra imag patch data method entropi mutual inform averag pixel spectra ica pca imag patch ica pca figur schemat comparison laplacian densiti gaussian densiti figur color imag natur scene schemat decomposit observ spectrum spectral basi function schemat decomposit observ imag patch basi function figur analysi pixel spectra independ compon analysi learn basi function pixel order number upper left corner plot denot basi function number refer text show histogram norm basi function figur analysi pixel spectra princip compon analysi pca basi function pixel order eigenvalu show histogram eigenvalu figur analysi imag patch independ compon analysi structur learn ica basi function imag patch chromat valu color pixel correspond rel excit function order left top bottom addit column mark show lter rightmost column basi function chromat basi plot color space horizont versu variat vertic variat dot repres coordin pixel respect basi project plane lumin infer bright dot note basi function vari dot tend lie top figur rel contribut ica basi function histogram norm rst ica basi function figur histogram coecient valu rst ica basi function figur distribut high figur contribut level ica patch basi function imag imag grayscal render origin imag contribut level dark region correspond low contribut basi function figur analysi imag patch princip compon analysi structur pca basi function imag patch compon order eigenvalu chromat basi function color space coordin data plot ica basi function figur figur rst princip compon figur figur comparison ica basi function spectra leav al figur sourc coeffici sourc coeffici fig wavelength wavelength fig norm basi function fig princip compon norm varianc fig fig norm basi function sourc coeffici fig fig fig princip compon normal varianc fig rel unit wavelength fig
IR/1479 5 unlabel data improv text classif kamal paul nigam school comput scienc carnegi mellon pa submit partial fulfil requir doctor philosophi thesi tom chair andrew mccallum john lafferti massachusett institut technolog copyright fl kamal paul nigam research sponsor nation scienc foundat grant advanc research project agenc contract digit equip corpor view document author interpret repres offici express govern entiti text text unlabel learn abstract kei difficulti text classif learn algorithm requir exampl learn accur dissert demonstr learn algorithm small number label exampl unlabel exampl creat text classifi assum document creat parametr gener find local maximum posteriori model classifi unlabel gener model captur intricaci domain techniqu substanti improv classif label data problem basic approach unlabel data hurt perform domain gener model assumpt strongli violat case assumpt made repres model class model hierarch class relationship model probabl classif accuraci unlabel data improv classif perform problem repres improv unlabel data suffici label data limit label data provid em initi lead model perform significantli improv activ learn select altern em avoid local maxima acknowledg peopl provid input brought thesi good recommend tom mitchel tom enthusiast provid valuabl perspect shine catalyst work extend andrew mccallum year gener sincer thought close friend memori graduat school tradit walk box complet paper submiss john lafferti tremend provid mathemat insight rigor provid great moral support left meet john feel renew optim confid jaakkola provid fresh extern viewpoint research question hope hear difficult attent critic area fortun privileg work research field provid invalu knowledg shown mean perform care research collabor doug mark dan dayn rayid rosi john andrew tom jason ellen sean sebastian ungar year provid ear alex bryan dimitri michael eric andrew tomkin thesi love support parent teacher inspir love learn natur faith confid endur enjoi vi content introduct unlabel question road map incorpor unlabel data gener model introduct gener model text model probabl optim criteria naiv text classif train naiv classifi label data classifi document naiv learn naiv model label unlabel data discuss result dataset protocol em unlabel data accuraci em unlabel data hurt accuraci discuss vii enhanc gener model introduct model structur em multipl mixtur compon class dataset protocol result discuss model structur estim paramet hierarch model dataset protocol result discuss find probabl model introduct influenc label exampl random start point random start point dataset protocol result discuss activ find good em initi activ learn text classif dataset protocol result discuss avoid local maxima determinist anneal viii determinist anneal result discuss relat work text classif learn label unlabel data likelihood maxim approach discrimin approach theoret unlabel data activ learn unlabel data learn find futur direct complet hierarchi keyword bibliographi ix chapter introduct work web site maintain public list job open compani user web site find career opportun open specif job categori job post spider categori label read job post manual determin system automat examin text make automat process call text classif text classif system categor document set topic interest text classif great practic import todai massiv volum onlin text recent year electron text world wide electron corpor chat digit librari organ overwhelm amount data classifi descript topic taxonomi yahoo maintain larg topic hierarchi web page automat popul maintain aid peopl search knowledg inform automat text classifi earli attempt base manual construct rule set approach person detail set rule automat class document rule read job post phrase java job categori comput highli accur text classifi built cost construct complet rule set requir lot domain knowledg substanti amount human time tune rule correctli impract approach text classif effici approach learn construct classifi provid algorithm set document find rule classifi futur document approach significantli manual construct algorithm automat construct rule text classif algorithm successfulli wide varieti practic domain exampl catalog articl web page shavlik learn read interest user sort electron mail sahami learn approach effortless hope kei difficulti algorithm requir number label train exampl learn accur label typic process task learn newsgroup articl interest person read usenet work lang found person read learn classifi achiev make predict top document confid user practic patienc label thousand obtain level prefer algorithm provid accur classif dozen thousand larg quantiti label exampl import sourc inform reduc label goal thesi demonstr learn algorithm small number label exampl larg number unlabel exampl creat text classifi unlabel exampl easier label exampl true text classif task involv onlin data web huge amount unlabel text readili collect text frequent feasibl quickli gather larg set unlabel exampl unlabel data integr learn build text classif system significantli faster unlabel gain unlabel data unlabel document doesnt import piec class intuit unlabel data interest recogn web page academ web larg number web page unlabel label data determin page word homework tend academ fact estim classif unlabel web find word lectur occur frequent unlabel exampl believ belong posit class word homework lectur larg set unlabel train data provid inform construct accur classifi consid homework lectur indic posit exampl explain unlabel data classif label data scarc inform unlabel data give knowledg distribut exampl featur space gener distribut knowledg provid inform learn classifi uniformli distribut instanc base conjunct liter relationship uniform instanc distribut space classif task unlabel data introduc bia learner assum depend instanc distribut classif task standard learn label data introduc bia order learn watanab theorem show bia pair train exampl equal gener class imposs result long ago william philosophi radic nomin david zhang ol formal prove learn unlabel exampl assum depend instanc distribut classif task thesi assum depend captur parametr gener model text document class statist process creat word class document gener model encod word common class creat document class randomli select word classs word frequenc process statist model captur subtleti author process assumpt encod relationship document distribut classif task unlabel data incorpor learn specif classif select model paramet valu evid label unlabel data judg probabl model gener data learn text classifi search paramet set probabl gener label unlabel data statist techniqu typic find probabl paramet find local maxima paramet space em paramet gener model text classif test document class evalu class label gener word document hope highli probabl gener model found unlabel data correspond text model perfect question thesi answer central gener model approach unlabel data improv text classif type gener model text classif simpl comparison complex human author maintain word order obviou maxim probabl imperfect model classif accuraci el repres text reason initi pessimist similar gener model approach relat text tag inform extract shown incorpor unlabel data learn perform system text classif depend task model correct local level demonstr gener model valid approach unlabel data text classif text classif domain gener text classif domain properti short dispar length task easi complex class wide varieti task successfulli unlabel data gener model class demonstr unlabel data easili straightforward gener model suggest incorpor unlabel data basic model lower classif accuraci adapt basic gener model unlabel data challeng text classif unlabel data gener model classif accuraci model likelihood correl perfect model suffici unlabel data simpl model text model assumpt approxim true data distribut unlabel data improv classif chang relax assumpt close match data adapt model direct model structur hierarch class relationship adapt model unlabel data learn text classifi difficult domain improv accuraci label data gener model adapt unlabel data improv accuraci extrem lack label data em maxim process unabl find highli probabl paramet view em iter initi label data sourc troubl confront weak select document label provid likelihood maxim techniqu insensit poor initi road map outlin thesi technic content chapter chapter present baselin gener model text document class deriv learn algorithm incorpor unlabel data learn likelihood maxim em show result show benefit unlabel data dataset basic approach inadequ unlabel data hurt classif accuraci chapter explor chang model assumpt poor perform unlabel data baselin model domain complex structur class accur model relax assumpt correspond mixtur compon class domain hierarchi indic class similar structur accur model relax assumpt independ class enhanc unlabel data improv text classif accuraci domain basic approach chapter improv perform classifi built unlabel data label data analysi effect limit label demonstr em initi hinder perform improv accuraci activ learn approach select label document initi show determinist likelihood maxim techniqu similar sensit poor initi find accur text classifi chapter survei current state text classif relat approach combin label unlabel contrast approach thesi chapter discuss dissert answer question pose avenu research suggest find chapter incorpor unlabel data gener model incorpor unlabel data learn assum statist process gener document gener statist techniqu find paramet model combin label unlabel data model turn text gener model notion class evid show unlabel data classif accuraci addit evid straightforward approach perform explain assumpt made gener process result model probabl classif accuraci expect search suffer stuck local maxima model remaind thesi show overcom problem introduct appeal framework statist model text written peopl strong complic set rule govern composit simpl statist gener model product text document implicit model assumpt document gener probabl word occur document independ class model straightforward find paramet set label data gener successfulli naiv approach text classif year begin combin label unlabel data statist model naiv add evid unlabel data find gener paramet assum model introduc algorithm learn label unlabel document base combin naiv classifi em iter techniqu maximum likelihood maximum posteriori paramet estim problem incomplet data unlabel data consid incomplet class label algorithm train classifi label assign class label unlabel document classifi calcul expect train classifi origin label iter em perform model probabl find classifi paramet local maxim probabl model label unlabel combin em naiv classifi base mixtur commonli text classif obtain text show unlabel data reduc classif error fix classif error unlabel data dramat reduc number label exampl identifi sourc newsgroup usenet articl classif tradit learner requir label altern algorithm advantag unlabel exampl requir label exampl achiev accuraci techniqu reduc label train exampl factor label document accuraci improv ad unlabel data find illustr power unlabel data text classif demonstr strength algorithm show basic em suffer model assumpt unlabel data result number interest question motiv remaind dissert outlin chapter section specifi naiv gener baselin thesi section discuss model probabl optim criteria paramet set gener model section explain optim model likelihood set label data model text classif section present local optim model likelihood combin label unlabel data section present result show combin label unlabel data outperform label data section discuss find pose challeng question address rest dissert gener model text section present probabilist framework natur document classifi framework defin probabilist gener model embodi assumpt gener data produc mixtur correspond mixtur compon mixtur compon multinomi distribut individu word document produc independ class assumpt deriv naiv simpl tool text find probabl paramet model document gener mixtur multinomi mixtur compon correspond class jcj class vocabulari size jv document jdj word creat document roll die determin class document pick jv die correspond chosen class roll die jdj write word word form gener document document gener probabl distribut defin paramet mixtur denot probabl consist mixtur compon fc jcj compon disjoint subset creat select mixtur compon mixtur weight class select mixtur compon gener document distribut jc likelihood document sum total probabl mixtur jcj jc document class label assum correspond mixtur model compon jth mixtur jth class class label document written document gener mixtur compon class label document consid order list word hw write word posit document word vocabulari hw jv paragraph document word document document gener mixtur compon document jd chosen independ compon assum document length independ class select mixtur compon gener word sequenc length assum gener word independ length expand term equat express probabl document mixtur compon term constitu document length word document note gener probabl word event condit word jc jd jc standard notat shorthand random jy written jy random variabl valu previou naiv formal includ document length effect gener document length model basi make standard naiv word document gener independ independ word document class label assum probabl word independ posit probabl word homework posit document posit express assumpt jc jc combin equat naiv express probabl document jc jd jc paramet individu mixtur compon defin multinomi distribut collect word written jc jc jc jv jg jc assum document length ident classif paramet model mixtur weight written probabl select mixtur compon complet collect model defin set multinomi class jc cg model probabl optim criteria ultim goal build text classifi find high accuraci unseen exampl dont exampl hand find altern criteria select classifi paramet statistician note multinomi coeffici miss multinomi distribut put word order gener model real mixtur multinomi coeffici cancel criteria reason amount success larg set label exampl potenti criteria maxim classif accuraci label exampl hand gradient descent approach problem approach easi find paramet maxim classif accuraci label good gener futur exampl text classif larg easi overfit train data solut correctli classifi label clear hard imagin unlabel data optim label exampl plai role estim classif accuraci criteria maxim margin class support vector find linear separ class furthest data approach find separ lie vallei low document densiti approach adapt work label unlabel data shown result classif boundari separ data data method achiev low classif error presenc assum gener model scenario build classifi approach maxim probabl model train data set strong probabilist natur talk probabl model set data gener model infinit amount data probabl solut give solut maxim classif accuraci dont necessarili gener interest question maxim model probabl reason optim criteria naiv text classif section present naiv text classifi train collect label document naiv find probabl paramet statist model introduc section set label data naiv foundat build integr unlabel data learn train naiv classifi label data learn naiv text classifi consist estim paramet gener model set label train fd jdj estim paramet written naiv maximum posteriori find arg max probabl evid train data prior perform map estim prior distribut model space prior distribut form product dirichlet class multinomi class probabl dirichlet conjug prior distribut multinomi form dirichlet jc jv jc ff ff constant greater set ff correspond prior favor uniform distribut introduct dirichlet distribut stolck omohundro paramet estim formula result maxim data prior familiar ratio empir count estim probabl word jc simpli number time word occur train data class divid total number word occurr train data count numer denomin augment dirichlet prior jc type prior refer laplac smooth smooth prevent probabl infrequ occur word word probabl estim jc jc jc jdj ij jv jv jdj ij count number time word occur document ij class class estim involv ratio count jdj ij jcj jdj deriv formula directli maximum posteriori paramet estim find maxim accomplish break express term term calcul product document likelihood equat prior distribut product dirichlet express maxim solv system partial deriv lagrang multipli enforc constraint word probabl class sum maxim yield ratio count classifi document naiv estim paramet calcul train document equat turn gener model backward calcul probabl mixtur compon gener document deriv applic substitut equat jd jc jd jc jcj jd jc task classifi test document singl class highest posterior arg max jd select note assumpt gener text document correspond mixtur compon word document length violat text data document mixtur multipl topic word document independ topic make empir naiv classifi good job classifi text document craven yang mccallum observ explain part fact classif estim function sign binari function estim word independ assumpt naiv give extrem class probabl estim estim poor classif accuraci remain high learn naiv model label unlabel data previou section show find maximum posteriori paramet estim set label data label unlabel similarli find map paramet label unlabel equat previou section applic techniqu find local map paramet estim gener model em techniqu appli case label unlabel data naiv yield straightforward appeal algorithm schemat algorithm shown figur naiv classifi built standard fashion limit amount label train data perform classif unlabel data naiv model note class probabl class rebuild naiv classifi estim class probabl true class label mean unlabel document treat fraction document class probabl iter process classifi unlabel data rebuild naiv model converg stabl classifi set label data statist foundat algorithm section figur schemat build text classifi label unlabel data em set train document task build classifi form previou section unlik subset document class label rest subset class label disjoint partit section learn classifi approach calcul maximum posteriori estim arg max term probabl train probabl data simpli product probabl document independ model unlabel probabl individu document sum total probabl equat label gener compon label refer mixtur class probabl data ffl collect label document unlabel document ffl build initi naiv label maximum posteriori paramet estim find arg max equat ffl loop classifi paramet measur chang complet log probabl label unlabel equat ffl current estim compon membership unlabel probabl mixtur compon gener jd equat ffl estim compon membership document maximum posteriori paramet estim find arg max equat ffl unlabel document predict class label tabl basic em algorithm section jcj jc jy maxim directli work maximum maximum equat log log jcj jc log jy call incomplet log unlabel data complet label drop constant term log notic equat log sum unlabel make maxim partial deriv intract access class label document set binari indic ij express complet log probabl log log term insid sum log jcj ij log jc replac ij unlabel document expect current model jd equat bound incomplet log probabl equat shown applic jensen inequ result find local maximum hill climb procedur formal techniqu proven dempster al iter hill climb procedur altern recomput expect maximum posteriori paramet expect note label document ij estim unlabel document denot estim iter algorithm find local maximum iter ffl set ffl set arg max correspond calcul probabilist label jd unlabel document current estim equat maxim complet likelihood correspond calcul maximum posteriori estim current estim jd equat initi paramet lead local maxima em instanti em begin start model randomli select start point unlabel label data iter process initi prime label document estim classifi equat cycl begin classifi probabilist label unlabel document time algorithm iter converg point chang iter determin converg occur observ chang paramet height surfac em tabl outlin basic em algorithm section discuss em find local maxim posterior probabl paramet label unlabel method unlabel data augment limit label data contribut paramet estim interest empir question probabl paramet estim improv classif accuraci section discuss fact naiv perform classif violat assumpt hold true unlabel note justif approach depend assumpt state section data produc mixtur correspond mixtur compon class gener model assumpt maxim model probabl good criteria optim classifi correspond map paramet estim model assumpt case textual benefit unlabel data clear section show empir method dramat improv accuraci document label document famili algorithm long histori applic applic classif statist literatur idea procedur improv classifi label data predat formul em survei relat work section applic em mixtur multinomi applic approach text classif result provid empir evid combin label unlabel train document em outperform tradit naiv train label document present result text usenet newsgroup web page newswir articl result show improv accuraci due unlabel data number label train document low newsgroup data classif error reduc train label unlabel document dataset protocol newsgroup data set mccallum collect ken consist articl divid evenli usenet discuss group task classifi articl newsgroup post categori fall discuss discuss religion word stoplist common short word uniqu word occur featur select token skip usenet header discard subject token form contigu alphabet left word count document scale document constant potenti fraction word count preliminari experi newsgroup naiv classif accur word count normal newsgroup data set collect usenet post period month data time data set internet nearbi time word practic classifi data set classifi futur articl train articl past preserv creat test set document select post date articl newsgroup unlabel set form randomli select document remain label train set form partit remain document set set creat equal number document class experi label set creat ten set fewer set experi label set document train set trial experi webkb data set web page gather comput scienc depart collect includ entireti assort page page divid depart popul page task classifi web page categori consist previou studi data set token webkb data number convert time phone number token stem found stoplist hurt perform stopword excel indic student homepag word mutual inform limit vocabulari inform measur averag mutual inform class variabl featur select method commonli text koller select vocabulari size run train data optim classif accuraci webkb data set collect part effort creat crawler explor unseen comput scienc depart classifi web page ontolog mimic crawler intend avoid report perform base singl test approach creat test page complet comput scienc depart test unlabel set page form randomli select remain web page train set form method newsgroup reuter distribut data set consist articl topic categori reuter newswir studi lier build binari classifi ten popul class identifi topic document data set multipl class categori evalu binari classifi word insid includ titl remov reuter tag occur top bottom document stem vocabulari size differ depend categori interest varianc optim vocabulari size note categori wheat corn strong correspond small set word titl categori acq complex characterist categori narrow definit attain classif small broader definit requir larg vocabulari vocabulari size reuter trial select optim accuraci measur label train set newsgroup data time depend reuter standard split divid articl document form test earlier train document train set randomli select form unlabel set remain train randomli select ten train set ten posit label document neg label data set number label class neg class frequent posit class binari reuter classif task result reuter report classif accuraci breakeven standard inform retriev measur binari classif accuraci good perform metric high accuraci achiev predict neg class task data set classif posit exampl larg sea neg exampl recal captur inher dualiti defin recal correct posit predict posit exampl correct posit predict posit predict classifi achiev recal adjust boundari posit neg class previou default jd breakeven point defin recal equal algorithm experi em tabl classif result report classif accuraci averag trial number label unlabel posterior model probabl report shown addit multipl constant rel valu maintain comput complex em prohibit iter requir classifi train document build classifi em converg iter time read matrix build em model iter classifi test document minut webkb data minut newsgroup newsgroup data set longer document word vocabulari em unlabel data accuraci basic em incorpor inform unlabel document figur show effect basic em unlabel data newsgroup data set vertic axi averag classifi accuraci test horizont axi amount label train data log scale vari amount label train compar classif accuraci number label document unlabel document unlabel document figur classif accuraci newsgroup data unlabel document small amount train em yield accur classifi larg amount label train accur paramet estim obtain unlabel method begin converg accuraci tradit naiv unlabel em learner access unlabel document em perform significantli tradit naiv label document document naiv reach accuraci em achiev repres reduct classif error note em perform small number label document singl label document naiv obtain em lot label naiv learn curv close unlabel data label data accur estim classifi paramet label document classif accuraci result statist view result unlabel data reduc label train exampl reach classif naiv requir label em requir statist result number label exampl multipl pair number label exampl singl report result mcnemar test test discuss dietterich log probabl model figur scatterplot show correl posterior model probabl accuraci model train label unlabel data strong correl impli model probabl good optim criteria newsgroup dataset label exampl achiev accuraci result incorpor unlabel data learn gener model significantli improv accuraci text label data em find accur optim posterior model classif accuraci directli gener model perfect expect model probabl accuraci correl em simpl gener model captur properti text newsgroup result show perfect model em text classif gener model repres text classif model probabl accuraci em indirectli optim accuraci illustr newsgroup empir measur correl figur demonstr point scatterplot label unlabel split figur label data set em initi iter plot classif perform accuraci section show label data set start point essenti perform em iter exclud label data accuraci number unlabel document label document label document label document label document label document figur classif accuraci vari number unlabel document effect shown newsgroup data amount label vari amount unlabel data horizont axi unlabel data note dip accuraci small amount unlabel data ad small amount label data estim compon jd unlabel document naiv word independ test data show posterior model probabl classif accuraci model probabl good correspond correl coeffici accuraci model probabl strong correl verif dataset amen unlabel data gener model approach optim criteria model probabl applic tandem accuraci shown amount label data accuraci figur effect vari amount unlabel data quantiti label hold number label document vari number unlabel document horizont axi unlabel data label data notic ad small amount unlabel data small amount label data hurt perform occur word iter model probabl number compar trial iter iter iter intellig dd dd dd artifici lectur lectur understand cc cc dist due ident handout ru due homework arrang problem assign game set handout dartmouth tai set natur hw cognit exam logic homework problem prove prolog sec postscript knowledg postscript solut human exam solut chapter field ascii tabl list word predict class webkb data chang iter em specif trial iter common word symbol arbitrari digit independ assumpt naiv lead jd estim unlabel document heavili weight class strong evid bia naiv spread unlabel data evenli number unlabel document problem disappear unlabel set larg sampl smooth sharp discret naiv classif provid intuit em present detail trace evolut classifi em iter tabl show chang definit class webkb dataset column show order list word model predict accuraci number label document unlabel document unlabel document figur classif accuraci webkb data unlabel document small number label em improv accuraci label em degrad perform data assum gener model class word judg predict weight log likelihood ratio symbol arbitrari digit iter paramet estim singl label document class notic document specif artifici intellig dartmouth em iter unlabel em unlabel data find word gener indic classifi column achiev em classifi achiev accuraci weight log likelihood ratio rank word figur jc log jc understood term word contribut averag ineffici encod word class code optim distribut word sum quantiti word diverg distribut word distribut word breakeven classif accuraci categori nb em nb em nb em nb em acq corn crude earn grain interest ship trade wheat tabl breakeven accuraci show perform binari classifi reuter naiv basic em label unlabel data em unlabel data hurt accuraci em accuraci webkb data incorpor unlabel data classif accuraci graph figur show perform basic em unlabel webkb em improv accuraci significantli amount label data small label document tradit naiv attain em reach lot label em hurt perform slightli label naiv obtain em differ perform statist test em hurt perform data fit assumpt gener mixtur compon explain unlabel data correspond class label webkb em hurt accuraci larg amount label data em hurt perform label data tabl show reuter dataset incorpor unlabel data paramet breakeven classif accuraci gener model accur dataset reuter categori em find significantli probabl evid label unlabel data frequent probabl model correspond hope discuss domain label data unlabel data classif find demonstr text classif task address significantli human label effort clear begin maxim probabl simpl gener model reason optim criteria unlabel data text classif likelihood accuraci correspond gener model approach work case domain unlabel data label data plenti label data reason explain em hypothesi explain mix perform em back assum gener model discuss text document gener mixtur multinomi process em maxim probabl subject assumpt gener model em produc reason classifi simpl model text em give paramet base unlabel give good accuraci webkb dataset label data suffici satur order magnitud unlabel data great major data determin paramet estim unlabel set em perform cluster mixtur multinomi model posit mixtur compon maxim likelihood unlabel document mixtur model assumpt bit natur cluster unlabel data produc mixtur compon correspond class detriment classif accuraci text posterior probabl maxim detriment amount label data reason em likelihood accuraci tagger inform extractor defin small amount local context correct model correl featur text document sensit local correct gener model understand perform reuter addit unlabel data valid gener model newswir domain multinomi compon model document singl trade document topic model multinomi compon model document singl entir newswir document relat desir classif task probabl cluster data multinomi natur cluster multinomi correspond unusu separ data gener model account classif task natur distribut unlabel document hypothesi explain em poorli unlabel data em caught poor local maxima model probabl space hillclimb process troubl model probabl accuraci good correspond em converg local maxima global solut paramet space mixtur certainti local maxima case mixtur data point introduc singular likelihood surfac statistician concern poor local maxima em standard approach combat problem run em time randomli chosen start select local maximum highest probabl adopt approach presenc label data good start point approach find probabl maxima address chapter model higher probabl correspond classifi higher accuraci remaind thesi explor detail chapter address concern hypothesi chang gener model wai bring model probabl accuraci correl complex dataset chapter address hypothesi show wai reduc cost incur local maxima approach benefit unlabel data model repres chapter enhanc gener model gener model assumpt vari realiti addit unlabel data hurt classif accuraci model high probabl unlabel data correspond classifi test data neg effect accur statist model domain question structur class repres gener model improv model repres structur model class mixtur singl topic captur structur integr model hierarch relationship class evid show sophist model model give accur text classifi basic model hurt classif improv model learn benefit unlabel data introduct previou assum simpl statist model gener text document dataset model posterior maxim approach estim paramet model label unlabel addit unlabel data enabl find probabl paramet em label data label data domain probabl figur learn label unlabel data gener model repres presenc unlabel data hurt classif accuraci model paramet strongli correl classif unlabel data select gave accur classifi domain model probabl accuraci gener model dataset unlabel data hurt classif perform chapter confront problem chang gener assumpt wai make model repres unlabel data text classif challeng domain model decoupl relationship accuraci model binari classif task dataset shown figur assum gener model mixtur fix uniform covari estim paramet data shown note wrong gener cluster data repres covari matric maximum posteriori method build classifi linear label datapoint perform accur add unlabel dot model maxim larg mass neg exampl captur small posit gaussian draw posit gaussian iter em result scenario shown hand classif accuraci poor gener model repres data em found probabl put mixtur cover side neg leav posit class model repres fix covari matric em model data give accur classifi text classif domain made strong assumpt gener model text document document gener mixtur correspond mixtur compon mixtur compon multinomi distribut word peopl document fashion domain posterior model probabl accuraci correl gener unlabel data classif case correl toi suggest modifi assumpt repres true data distribut chapter relax turn assumpt text document section assumpt class model singl mixtur compon classif task demand singl class cover complic topic case unrealist model class mixtur compon repres model multipl mixtur compon class express separ previou chapter reuter dataset origin gener unlabel data hurt classif perform multipl mixtur compon includ unlabel data paramet estim make text classifi accur section assumpt data produc mixtur model mean document class unrel case natur hierarch organ class similar model class relationship paramet share class estim accur cora collect comput scienc research hierarchi cs result show leverag hierarchi improv classif accuraci unlabel figur data violat assumpt correspond mixtur compon gaussian label unlabel data maxim probabl incorrect model poor classifi basic model classif accuraci model structur assumpt gener model state correspond class compon mixtur model assumpt strongli incorpor unlabel data model estim hurt classif perform return gaussian mixtur model previou section assumpt mixtur compon covari matrix unrealist harm figur show label unlabel data violat assumpt class mixtur compon posit class neg class data distribut sea posit class small island repres model sea neg exampl singl mixtur model compon neg compon captur sea exampl figur show data model mixtur compon neg class realist figur data figur time model mixtur compon neg class assum gener model repres model data section approach suggest text relax assumpt correspond mixtur compon class replac restrict correspond mixtur compon class model structur class text analog scenario unusu task text identifi small class document larg pool stream document system watch network administr incom email identifi rare emerg situat requir page vacat model email neg class multinomi distribut result model neg class email varieti person multipl mixtur compon accur model neg class model probabl maxim label unlabel data give classifi significantli higher accuraci section show relax assumpt em gener model estim highli probabl paramet data section return problemat reuter dataset incorpor unlabel data origin model hurt perform section show repres improv model probabl em improv classif accuraci em multipl mixtur compon class correspond mixtur compon origin gener model previou chapter longer applic gener model account structur pick class die roll class pick die roll document word gener pick length draw word multinomi distribut unlik miss valu unlabel class label data miss class access miss class techniqu em estim local map gener paramet section em instanti iter algorithm altern estim valu miss class calcul map paramet estim label em converg paramet estim gener model text classif turn rule tabl overview modifi em algorithm deriv detail algorithm start point notat introduc chapter gener model specifi separ mixtur compon class denot denot jth mixtur compon write class compon belong class aj repres map mixtur compon class class label label document document gener mixtur compon document belong class class label find map ffl collect label document unlabel document ffl set number mixtur compon class section ffl initi mixtur compon randomli assign jd label document base document class label ffl build initi classifi label document maximum posteriori paramet estim find arg max equat ffl loop classifi paramet measur chang complet log probabl gener ffl current estim class membership document equat restrict membership probabl estim label document compon class renorm ffl estim compon membership document maximum posteriori paramet estim find arg max equat ffl unlabel document predict class label equat tabl modifi algorithm integr unlabel data em multipl mixtur compon class estim gener paramet straightforward applic equat similar naiv section formula word probabl paramet ident equat naiv jc jc jdj jd jv jv jdj jd class probabl analog equat notat class jdj jd jt jdj probabl estim refer document compon jt jdj jd jcj aj jdj jd classif estim class membership probabl unlabel document calcul membership sum class probabl membership calcul analog mixtur compon membership naiv small adjust account presenc prior jd jt aj jt jd jc jcj jt br jt jd jc class membership calcul sum probabl classs jd jcj aj jd equat learn applic train document class label em deriv em process find paramet model label unlabel data run analog section basic build maximum posteriori paramet estim multinomi prior equat probabilist class subtop membership estim previou unlabel document calcul class membership label estim membership class label membership belong class calcul membership unlabel set normal topic belong class origin gener model initi em label data approach multipl mixtur initi subtop label provid randomli spread label train mixtur compon belong class compon initi perform random jd sampl uniform distribut mixtur compon belong document class set set unlabel appli em specif number class inform typic result resort techniqu model select approach model select cross bic avail limit number label select number classif perform tension model select process complex model data sparsiti perfectli model train cover train document larg number accur model exist gener perform poor multinomi paramet estim document suffer data opposit problem accur estim model overli repres true document distribut select good tension specif regard classif perform note multipl mixtur compon class captur depend word sport class consist document hockei word ic word bat base depend captur singl multinomi distribut word sport class multipl mixtur compon multinomi cover hockei hockei word probabl ic significantli higher class make hockei document singl multinomi assumpt dataset protocol test domain gener model return collect newswir articl previou chapter document dataset multipl class categori evalu binari classifi origin gener neg class cover distinct expect task strongli violat assumpt data neg class gener singl mixtur compon model posit class singl mixtur compon neg class forti mixtur unlabel data data follow protocol section ten posit neg document unlabel classif result report breakeven point classif accuraci algorithm experi em tabl perform conjunct make simplif comput effici run em converg train subtract word count label document turn test document perform specif combin paramet run em requir run em label residu effect document result tabl summari breakeven result reuter column reproduc result section origin gener model mixtur compon class rememb incorpor unlabel data em hurt perform neg class fit singl naiv class em data accur captur neg class word distribut column show result model neg class multipl mixtur label data number compon select optim breakeven point categori acq corn crude earn grain interest ship trade wheat tabl breakeven point show perform binari classifi reuter tradit naiv multipl mixtur compon label data basic em label unlabel multipl mixtur compon em label unlabel data number compon select optim median number compon trial neg class shown note model natur neg class consist topic unlabel data multipl mixtur compon class perform naiv median number compon select trial breakeven point note unlabel complex improv perform tradit naiv em automat find neg class improv classif column label show result em multipl mixtur compon label unlabel select number compon perform naiv multipl mixtur compon compon class em unlabel measur trial statist multipl mixtur compon perform tradit naiv combin unlabel data multipl mixtur compon perform gener model repres model likelihood em classif categori acq corn crude earn grain interest ship trade wheat tabl classif accuraci reuter tradit naiv multipl mixtur compon label data basic em label unlabel multipl mixtur compon em label unlabel data tabl accuraci tabl show result tabl classif breakeven gener trend accuraci optim number mixtur compon neg class greater natur model posit accuraci model neg frequent mixtur compon neg accur model achiev interest note averag mixtur compon suggest addit unlabel data support complex model unlabel data sparsiti problem tradeoff model paramet gener li fewer mixtur compon class unlabel data present complex model repres accur provid scatterplot model probabl versu accuraci demonstr correl multipl mixtur compon acq classif compar ten mixtur compon median number pick provid fair comparison number label document em neg compon em neg compon naiv figur comparison model unlabel data reuter acq task accuraci ten mixtur compon neg incorpor unlabel data mixtur em find model correl classifi train set label data set em initi fix vocabulari top word train data median vocabulari size vari number label ten random train set split amount figur show ten mixtur compon consist classif accuraci compar em singl mixtur compon naiv note em compon naiv scatterplot singl compon poor figur show correl model probabl classif accuraci mixtur compon ten mixtur compon note correl strong wrong model higher probabl significantli lower classif accuraci examin solut found find mixtur compon probabl cluster data compon major neg document posit significantli neg document section show label data set start point essenti perform em iter log probabl model log probabl model figur scatterplot show relationship model probabl classif accuraci reuter acq task mixtur compon neg probabl accuraci ten mixtur compon moder posit correl model probabl classif accuraci class separ model ten mixtur compon stori figur show moder correl model probabl classif accuraci direct solut compon cover posit document neg ten compon distribut remain neg document model repres data classif task classif accuraci model probabl correl benefici unlabel data gener model approach tabl show complet result experi multipl mixtur compon unlabel note mixtur compon hurt perform assumpt overli restrict model repres paramet estim amount data suffer data sparsiti substanti larger amount unlabel support mixtur point model longer repres obviou question automat select number mixtur compon access test set label categori acq corn crude earn grain interest ship trade wheat tabl perform em number mixtur compon neg class unlabel document breakeven point shown experi forti mixtur compon note mixtur compon result poor perform comput entail run em end section result techniqu compar naiv em shown tabl note perfectli select number compon perform test set discuss experi advantag explicitli model structur text classif singl multinomi restrict model class multipl multinomi mixtur compon fit paramet em model unlabel data improv classif accuraci naiv label data ten reuter classif task complex model method consist select mixtur compon comput bia model favor fewer compon categori acq corn crude earn grain interest ship trade wheat tabl perform em number mixtur compon neg unlabel data breakeven point shown experi forti mixtur compon categori acq corn crude earn grain interest ship trade wheat tabl perform multipl mixtur compon number compon select compar optim select straight naiv note select compon perform model select method perform maintain comput effici includ robust method ng minimum descript length schuurman unlabel data research improv method model select algorithm area futur work learn gener model situat label unlabel data requir closer match data model label data intend target concept model differ actual distribut data unlabel data hurt perform label data thing resili figur assum covari matric label data deriv classifi accur naiv text give good classif class probabl estim linear boundari import classif unlabel depend gener model model give unlabel data estim class label reuter improv label data case expand gener model label unlabel differ larger model structur previou section model structur relax assumpt relationship class mixtur compon model structur chang assumpt relationship class mixtur model requir parametr form class independ class section model depend class hierarch relationship text domain class interest arrang hierarchi hierarch organ yahoo canon decim system assign book hierarch fashion patent classifi larg hierarchi field innov research arrang comput research repositori acm comput scienc hierarchi categor submit research paper complex dataset class larg amount unlabel data italian food garden food figur simpl hierarchi demonstr relationship class suffici model document distribut accur likelihood maxim find paramet model unlabel data reflect true distribut data algorithm overfit unlabel data significantli unlabel problem finit amount unlabel data exist present gener model exacerb problem overfit classif task figur frequenc gener cook word similar italian food food class basic gener class assum word frequenc estim class data estim match peculiar document class model note relationship train data class pool form accur estim gener cook word frequenc repres model encod hierarch class ensur model unlabel data model true data distribut relationship paramet estim find classifi section show learn paramet hierarch model em section present cora collect comput scienc research paper class hierarchi describ ffl collect unlabel train class keyword class ffl gener initi label unlabel document keyword fashion ffl split data disjoint ffl initi shrinkag weight jc uniform path leaf node root hierarchi ffl estim word probabl class prior paramet initi label data ffl loop paramet ffl current classifi estim class label document accumul ancestor word gener count document ffl shrinkag weight normal ancestor word count class prior word probabl paramet document ffl text classifi unlabel document predict class label equat tabl modifi outlin likelihood maxim unlabel data hierarch model em cs section demonstr repres learn paramet unlabel data classif basic accuraci section discuss implic result estim paramet hierarch model leverag hierarchi techniqu shrinkag hierarch shrinkag calcul word probabl estim leaf class calcul weight averag estim path leaf root techniqu balanc specif reliabl estim leaf specif hierarchi estim reliabl mixtur weight set em time word probabl paramet set label unlabel data joint em process figur hierarch shrinkag gener model hierarchi leaf hierarchi class pick class die roll base class prior pick document length gener word gener word hierarchi ancestor class node path root includ possibl shrinkag weight word multinomi select ancestor repeat process ancestor pick word posit document document creat mixtur specif gener word drawn hierarch relationship provid introduc notat describ hierarchi class leaf node hierarchi node hierarchi denot note make distinct class node leaf hierarchi node class ancestor includ node path leaf set class leaf node possibl node hierarchi hierarch shrinkag weight denot jc note shrinkag weight depend impli class set weight node tree weight node ancestor class ran em set word probabl shrinkag weight set shrinkag weight concentr leav happen model fit train data result overfit prevent avoid split train data disjoint set document subset estim word probabl class prior paramet shrinkag subset concurr perform em set shrinkag weight em set multinomi estim class label unlabel document class probabl previou jd jd jc jcj jd jc shrinkag accumul count word class gener ancestor node accumul document subset jd jd jd jc ja jd jd jd jc ja estim class label document count word sourc calcul paramet estim higher likelihood maximum posteriori paramet estim motiv prevent word probabl infrequ occur word accomplish augment hierarchi place root node top perman fix word probabl root node uniform vocabulari uniform multinomi ensur word mix path class extra hierarch maximum likelihood estim maximum posteriori estim benefit approach class determin amount smooth laplac fix dirichlet prior data determin smooth effect true shrinkag weight level hierarchi class lot word distribut expect shrinkag weight favor leaf node class train data expect significantli higher depend share includ uniform root node calcul shrinkag weight easi simpli accumul count normal jc jc estim class probabl sum fraction membership origin gener jd jd jcj jdj calcul word probabl step document calcul ancestor node word probabl pool count leaf calcul maximum likelihood ja jd jd jvj jd jd calcul word probabl paramet weight averag ancestor shrinkag jc jc jc complet explan em iter dataset label data paramet estim em make em initi process label domain provid small number kei word phrase class keyword assign initi label unlabel document step keyword place document categori keyword match document match initi treat initi label class membership estim initi shrinkag weight uniform path leaf root initi label shrinkag weight calcul word probabl paramet initi em prime initi label discard replac estim iter limit domain knowledg keyword provid reason initi em artifici intellig system oper inform retriev robot robot robot robot learn machin interact reinforc learn neural network retriev filter librari comput scienc hardwar architectur document filter text classif document document categor classif digit librari plan plan nlp languag nlp natur process tempor reason reason time inform retriev figur subset cora comput scienc hierarchi complet keyword list categori keyword find unlabel document initi em complet hierarchi keyword detail appendix dataset protocol test domain hierarch gener model cora collect comput scienc research paper classifi cs dataset build text classifi automat place research paper spider web postscript format search engin paper citat resourc research support hierarchi comput scienc part shown figur hierarchi creat examin confer comput scienc site web small test set creat expert random sampl research paper paper cora comput scienc archiv time experi fit categori result label document discard paper area comput scienc paper complet hierarchi consid comput scienc paper class frequenc data test popul class account document research paper repres word abstract segment automat extract train hidden markov model extract perform independ classif task detail seymor al word occur fewer document word standard stoplist discard stem document document test set measur classif accuraci leav document label train data replac label kei word phrase class set start point em keyword quicker gener small number label document keyword gener initi label unlabel initi label set em start point figur show exampl number type keyword select domain complet hierarchi keyword detail appendix provid keyword classif keyword match inaccur incomplet keyword tend provid brittl leav document unlabel document match keyword wrong class unlabel document keyword document keyword match test set complet algorithm hierarch experi tabl experi document estim shrinkag weight remain estim word probabl fewer document accur estim small set shrinkag paramet result provid empir evid em unlabel data hierarchi produc text classifi tabl show classif result classif techniqu interest baselin provid difficulti classif task label document test set naiv reach accuraci test set relabel human agreement origin label show classif task question challeng method label initi label unlabel accuraci naiv human agreement keyword match naiv shrinkag hierarchi hierarchi tabl classif result keyword naiv em hierarch gener model classif number initi unlabel document variant shown algorithm perform achiev unlabel data hierarch gener model begin keyword initi label document em start point keyword appli test give accuraci appli unlabel keyword gener initi label document initi label document build naiv classifi treat label accuraci fix run em ignor remain accuraci origin gener model em find paramet higher likelihood unlabel data classif accuraci likelihood maxim naiv model complex classif task data switch hierarch likelihood maxim classif accuraci hierarch em unlabel data improv accuraci show repres gener overcom neg effect overfit discuss interest result differ perform em hierarchi hierarchi likelihood maxim document test set keyword assign class assign popul class default em lower classif accuraci repres likelihood em classif accuraci repres model model higher likelihood unlabel data correspond higher accuraci due overfit interest notic hierarch shrinkag improv perform data label data classif accuraci model evid learn label unlabel sensit match data model regular learn unlabel data hierarch model text literatur cluster pure cluster label data mccallum al hierarch shrinkag form reliabl paramet estim label train data text classif show improv classif accuraci dataset hierarchi hofmann puzicha relat model creat hierarchi fashion collect scientif abstract work chapter appli model learn combin label unlabel data chapter chang gener assumpt studi examin relax word independ assumpt learn label data context bernoulli gener sahami limit word depend class specif word depend essenc creat depend tree find classif perform model higher strict word independ model multinomi distribut unigram languag model mladen grobelnik explor sophist bigram languag model classif word occurr probabl depend word previou document find show bigram model classif perform work relax correspond differ correspond cluster relationship number mixtur compon introduc probabilist relationship compon class model chapter extend natur wai multipl mixtur compon class hierarch gener model combin approach suggest hierarchi class hierarchi complex hierarch model natur extend model direct acycl restrict class relationship express tree structur chapter demonstr gener model repres model model probabl accuraci unlabel data hurt gener model improv shown wai make model demonstr unlabel data successfulli learn text classifi chapter find probabl model demonstr assum gener model incorpor unlabel data learn improv accuraci text classif chapter wai improv perform unlabel data gener model repres label data number label exampl bottleneck improv bottleneck label data provid poor em initi result low probabl local maximum mitig run em time random start point text classifi random initi initi determinist label data paramet space larg randomli explor good initi altern techniqu limit interact human specif document select label learn algorithm learner influenc em initi approach activ learn request label document prototyp high classif varianc data label fashion provid higher accuraci accur classifi improv weak em maxim techniqu determinist anneal techniqu avoid local maxima maxim smooth probabl surfac gradual make track maximum surfac complex determinist anneal find probabl model label train data accuraci number label document unlabel document unlabel document figur classif accuraci newsgroup data unlabel document unlabel data label data room improv introduct previou dataset make good unlabel data basic algorithm chapter gener model assumpt strongli violat true data paramet high probabl correspond classifi high accuraci modifi assum gener model repres classif accuraci model probabl correspond integr evid unlabel data improv model find classifi higher accuraci chapter explor improv learn perform classif accuraci model probabl good correspond section present evid newsgroup dataset show classif accuraci model probabl strong integr unlabel document posterior model maxim improv text classif accuraci label data improv perform substanti achiev plenti label data origin shown figur shown figur figur infinit amount unlabel true paramet gener model recov label class assign result classifi label data matter case estim univari normal distribut classif infinit amount unlabel data recov global maximum posteriori paramet mixtur figur label correctli match class compon classifi thing realiti larg infinit amount unlabel data featur space local maxima abound probabl easili find global maximum reason resign weak perform label unlabel data modifi make effect unlabel data hand chapter explor wai improv perform gener model repres label data limit case perform suffer stuck local maxima em search model probabl space section show primarili poor em initi label data section show standard approach multipl em run random initi text classif section activ learn conjunct improv initi lead classif accuraci section demonstr tabl randomli select matrix test set label document newsgroup true class predict cluster column document ly diagon correspond factor classif accuraci determinist maxim algorithm similar achiev higher model probabl classif accuraci local maxima avoid influenc label exampl understand role label data plai algorithm perform label data learn label unlabel label data influenc result algorithm correl cluster influenc paramet estim em initi start point em section examin rel strength conclud initi import role plai label data number label document unlabel document class reassign unlabel document unlabel document figur classif accuraci newsgroup data set label unlabel document class reassign benefit reassign indic faulti class correl factor classif em find classif poor simpli swap class ident cluster classifi perfectli distinguish sport art suddenli accuraci swap definit experi cluster correl class assign cluster class document initi make implicit assumpt initi place cluster neighborhood cluster successfulli track class em iter contrast correl process iter cluster classs label document fall cluster perfect method requir small amount label data correctli match cluster class correspond happen poorli label data tabl show typic matrix newsgroup label document class cluster assign class plural document diagon matric domin measur loss accuraci due incorrect class correspond greedili reassign class maxim accuraci accuraci number label document em label start iter em label start unlabel data figur comparison em differ label data top line show normal em label unlabel data overlap show perform em label data set initi paramet em strong similar power label data set initi paramet base perform test data figur show minim loss poor reassign label document class class correspond problem lower accuraci deduc classif accuraci small amount label data suffer significantli due class correspond problem effect label data iter em applic em perform cluster label data provid iter em remain fix correct class order magnitud unlabel document label great major data unlabel set em expect class mixtur compon posit maxim likelihood unlabel document explicitli measur effect label data iter optim reassign class feasibl class involv permut smaller classif factor problem huge number number error grow simpl experi test effect perform regular label data em iter compar effect label data initi initi iter result experi newsgroup shown figur accuraci classifi built label data iter essenti typic algorithm label data label document class accuraci case curv start diverg larg amount label data influenc label data em iter minim simpl experi elimin effect label correspond influenc em iter deduc limit label data hinder unlabel data approach primarili give poor em initi initi explan probabl poor local maxima complet bypass model probabl initi successfulli avoid local maxima lower probabl explan regular probabl local maxima initi direct em region paramet space tend higher maxima optim algorithm domain focu explicitli effect model regular local maxima select good initi wai address problem limit label data give poor em initi initi strong depend label data continu label data initi ensur label data highqual idea em algorithm maxim model posterior sensit label data direct address section turn section explor random initi label data determinist section activ learn select label data section determinist anneal em avoid poor local maxima random start point previou section demonstr learn text classifi label data primari influenc form initi paramet estim em label data initi paramet high probabl em incorpor evid unlabel data output classifi label data initi paramet estim lower probabl result em caught local maximum improv significantli obtain initi initi paramet estim map estim deriv label data initi place classifi approxim neighborhood paramet space correspond document class distribut applic em framework analog label data set start point em typic initi random paramet estim singl random paramet initi frequent result poor local maximum paramet space local maxima small minor high probabl overcom standard practic run em time random initi set em highest model probabl select multipl random run explor local maxima provid robust poor paramet initi appli approach text classif task unlabel set start point determinist label exampl classif room improv hope randomli select start point find initi determinist produc classifi hard practic find initi label data provid inform random start point wai random paramet initi possibl set word probabl paramet small perturb uniform distribut reason approach poor implement set repres basic knowledg text mixtur compon significantli probabl common word round em unlabel document classifi belong cluster run em initi give terribl classif model preliminari experi random initi show consist low probabl model text domain good guess word probabl limit label data vast unlabel data word larg differ probabl estim fair approxim uniform distribut baselin mixtur word frequenc label unlabel data baselin experi prime assign uniform classif posterior unlabel document set baselin initi compon map paramet estim limit label document unlabel baselin accur repres knowledg label influenc unlabel introduc random perturb estim appropri gener model approach label unlabel baselin class map arg max train data specifi probabl distribut paramet mixtur probabl distribut introduc random select paramet probabl distribut label unlabel probabl notat introduc chapter data defin dirichlet distribut multinomi paramet jv jc ff ff smooth number word occurr train data ff jd dirichlet distribut conjug prior distribut multinomi good intuit introduct dirichlet distribut stolck omohundro sampl dirichlet distribut straightforward perform draw tj word class gamma tj set paramet jc normal weight jc tj sj sampl gamma distribut method detail press al initi paramet randomli gener model assumpt enabl paramet fall reason rang text space provid gener amount variat random initi em find local maxima give high probabl high model dataset protocol remaind subset newsgroup dataset class dataset evenli divid class data section ignor usenet subject order provid compar model probabl fix singl vocabulari experi top word mutual inform number label document regular start point random perfect class assign random empir class assign naiv unlabel data figur comparison techniqu start point perform achiev singl determinist initi label data probabl model random initi accuraci label train data class cluster match result determinist initi measur entir label dataset chapter discuss issu featur select learn label unlabel data random document class treat unlabel fix number label exampl class randomli select remain document test set experi fix number label perform ten random split split pair condit exact split compar algorithm perform multipl random run em time select run highest model probabl random start point chosen section model highest probabl select chosen model measur classif accuraci test data result figur show accuraci achiev multipl random restart moder amount label data random initi perform essenti accuraci determinist initi train exampl accuraci random initi significantli determinist initi label document class random initi find model singl determinist initi model accuraci problem start point randomli random overcom signal label data label data random problem worst small amount label baselin mixtur compon close random variat easili throw correspond measur strength effect easi make test data reassign class compon maxim classif accuraci test set identifi case data cluster class repres mixtur compon initi result analysi shown figur demonstr perform random initi accuraci random initi optim class assign essenti determinist initi label set size label document class improv compar singl initi random initi dramat improv perform label data perfectli correl cluster class result suggest belief model probabl accuraci correl multipl random initi approach find probabl model determinist approach chanc find local maxima model probabl accuraci strongli correl analyz find case random initi find probabl model figur show scatterplot indic relationship model probabl accuraci random determinist initi show log probabl model regular start point random perfect class assign figur scatterplot show relationship model probabl accuraci random initi determinist initi label data case distribut reinforc evid model probabl accuraci strongli correl point set figur indic result determinist start point show random initi find interest strong correl accuraci model newsgroup dataset subset share properti note random initi approxim distribut determinist initi correl accuraci model probabl relationship accuraci model probabl hold strict subspac defin determinist start point label data discuss experi shown fair bit random find em initi label data infinit amount random maxima identifi lot local make difficult find good label data pretti good job region reason local maxima label data thing difficult previou section argu label data room improv improv find initi paramet em experi find good initi random explor alloc order magnitud time random found gain qualiti start point suggest improv activ find good em initi creat label data inher involv human effort domain small amount label data expect typic document select randomli label document reason learn algorithm perform select document label machin activ learn set limit amount interact human label learn algorithm select exampl present label task learner select inform exampl learn classifi exampl activ learn algorithm learn label data activ learn framework natur access unlabel document select document natur appli activ learn learn label unlabel exampl select label provid valuabl inform incorpor algorithm explicitli kei idea section activ learn algorithm carefulli select unlabel document label inform label document provid initi valu model paramet em find paramet label document remain unlabel document expect approach work tradit method randomli select document label activ learn activ learn aim select inform set defin class label maxim reduc error classifi train extra assum learner reduc classif error reduc classif varianc data distribut decomposit error bia varianc case expect varianc reduct estim data iter select label approach calcul expect varianc reduct prohibit complex impract case activ learn proce appeal framework select document maxim reduc classif select document label high classif varianc consist learn label document high classif varianc elimin label case exponenti learn rate random select document label learn task theoret intuit document high classif varianc lie region learn algorithm true label uncertainti elimin approach successfulli appli text task tag hmm text classif winnow perceptron learner measur classif varianc creat classifi variant suggest data label classifi unlabel document measur disagr approxim classif varianc class label document strongli newli label document includ train sampl make set request probabilist framework classif label train data posterior distribut classifi select member ffl collect label document unlabel document ffl calcul densiti unlabel document ffl loop person loop creat initi member sampl dirichlet distribut defin label train data initi em combin label unlabel data find probabilist label unlabel document calcul disagr unlabel document multipli request class label highest score ffl run em combin label remain unlabel creat classifi ffl unlabel document predict class label tabl activ learn algorithm find em initi step ital option sampl posterior distribut classifi approach successfulli dagan probabilist gener model approach applic framework ad hoc approach random initi text classif section detail appli activ learn find good initi em learn label unlabel data form measur select document disagr metric result algorithm summar tabl form size approxim distribut classifi cate label data wai individu member denot discuss section distribut classifi induc label data set dirichlet class mixtur compon draw set dirichlet paramet member approxim distribut em initi direct goal select document improv initi draw dirichlet initi incorpor unlabel data chang paramet em classifi member approxim paramet distribut local select document improv put initi region high local maxima note techniqu set dirichlet label unlabel data section unlabel data set dirichlet initi captur inform word frequenc focu explicit weak label cover measur dagan engelson suggest vote entropi class label distribut result member vote probabl mass win class disadvantag vote entropi confid member class probabl pm jd member measur disagr document diverg unlik vote compar member top rank diverg measur strength certainti disagr calcul differ member class pm member produc posterior class pm random variabl class diverg averag diverg naiv accur probabl estim naiv classif score correl fact naiv score successfulli make distribut avg avg class distribut avg pm measur differ captur number extra inform requir send messag sampl distribut code optim kl diverg distribut jcj log disagr calcul document select class label request wai select previou applic lier simul stream unlabel document time document measur classif disagr base select document label dagan engelson heurist divid vote entropi maximum entropi creat probabl select document disadvantag sampl sampl full distribut document label label made document irrespect altern altern aim address problem sampl select unlabel document largest disagr lose benefit implicit model data select document high popul region retain distribut inform select document classif disagr densiti region document sampl method prefer document high classif varianc similar document stream approach approxim accomplish accur label small number model densiti explicitli approxim densiti region document measur averag distanc document document individu document measur exponenti kl jd jj jd random variabl word jd maximum likelihood estim word sampl document jd margin distribut paramet determin smooth encod distribut ensur prevent infinit fi paramet determin sharp distanc metric averag kl diverg document measur overlap exponenti convert number scalar distanc calcul averag distanc document effici calcul geometr arithmet distanc document share word word calcul make correct word geometr defin document jdj combin densiti metric disagr select label document largest product densiti disagr sampl select document repres confid disagr present algorithm choic dimens form initi maxima select document simul pick straight unlabel densiti weight pick pool section evalu choic empir show activ learn find initi em give classifi dataset protocol section document randomli select placement test set initi document class remain document unlabel learn proce tabl experi run activ learn round select document label smooth paramet sharp paramet fi made effort tune fi tune size initi experi show size effect em run perform em found classif accuraci improv seventh iter result present averag ten run condit result begin evalu select strategi compar sampl calcul baselin random select document techniqu draw member directli run em local maxima figur show qualiti em initi measur classif accuraci select sampl achiev accuraci acquir label document reach unweight sampl label document switch sampl label accuraci random select baselin requir label document sampl statist significantli method interest note document select approach faq newsgroup effect densiti weight content faq repres class document incorpor select longer number train document sampl sampl sampl random sampl figur comparison select strategi show sampl em initi strategi note order legend match order curv resolut vertic ax rang document word distribut repres corpu gener label long short document label effort long document inform word compar creation techniqu provid initi figur show accuraci initi accuraci final classifi compar baselin start label mark initi reach accuraci em incorpor unlabel document local maxima lag requir label document accuraci random select label document select techniqu statist significantli statist significantli random select threshold select method perform roughli equal em incorpor unlabel initi provid accur start point em local maxima understand rememb focu attent differ initi specif accuraci em accuraci number train document initi local maxima random select initi local maxima random select figur perform activ learn select em initi format techniqu perform random select note order legend match order curv resolut vertic ax rang start point indirectli improv final classif qualiti em start point correl accuraci final classifi local maxima focu final initi techniqu initi accuraci lower interest techniqu recov loss em discuss studi probabilist classifi similar studi activ learn improv text classif survei activ learn section previou work activ learn combin algorithm unlabel data comparison previou activ learn studi text classif domain lier magnitud classif accuraci modest previou studi binari classifi skew distribut posit class rare infrequ posit random select perform extrem poorli document select label neg class task class distribut random select perform improv activ learn dramat separ work experi select techniqu reuter skew prior show larger improv conclud accuraci improv class random select strong perform baselin result section activ select label accuraci em initi accuraci final classifi activ learn import small number exampl perform random select weakest avoid local maxima determinist anneal previou section approach find em initi modest improv unlabel data find accur classifi local maxima problem label train data time seek altern em find highli probabl model section maxim techniqu robust local determinist anneal typic variant altern em creat speed rate converg chapter domain text classif converg fast easili altern em improv local maxima situat slower converg determinist anneal make tradeoff intuit determinist anneal begin maxim convex surfac remot relat true probabl surfac interest initi find global maximum simpl surfac chang surfac close true probabl surfac follow origin maximum surfac ffl collect label document unlabel document ffl initi fi small number ffl build initi naiv unlabel document spread evenli class label document maximum posteriori paramet estim find arg max equat ffl loop fi ffl loop ffl current calcul expect cluster membership unlabel ij equat ffl cluster expect cluster membership document maximum posteriori paramet estim find arg max equat ffl fi ffl unlabel document predict class label tabl determinist anneal algorithm section origin surfac highli probabl maximum avoid local maxima em caught determinist anneal section sketch deriv determinist anneal specif appli learn label unlabel data text classif gener treatment determinist anneal rose al mention notat introduc chapter determinist anneal algorithm summar tabl approach problem learn classifi label unlabel data cluster cluster assign label data unknown unlabel data cluster multinomi distribut cluster multinomi distribut correspond class naiv classifi repres cluster assign made matrix binari indic variabl hz ij iff ij entri cluster membership datapoint treat cluster optim problem loss function optim function model paramet class ij jc loss function neg complet data log probabl mixtur multinomi model determinist class label minim loss function good target build classifi loss function motiv model probabl explicitli assum data gener target paramet classifi model data gener find model fix loss find model class assign minim loss solv relat task task find select cluster specif loss subsect give algorithm minim loss step fix loss function set pair model cluster assign loss target select pair answer question appli principl maximum entropi principl absenc estim probabl distribut uniform maxim entropi principl commonli successfulli appli learn task find distribut model paramet data select model paramet solut target goal find paramet distribut paramet assign give target loss target distribut model paramet cluster assign maxim entropi log subject ij jc constraint enforc requir target distribut valid probabl distribut constraint enforc fix loss model paramet cluster label solv constrain maxim problem lagrang multipli find solut problem gibb ij jc ij jc fi lagrang multipli determin desir loss fi rang desir loss desir loss form joint likelihood model cluster select singl classif rememb cluster assign unlabel data find classifi express probabl classifi incorpor prior paramet avoid word probabl easili replac maximum entropi criteria minimum rel entropi prior distribut gener deriv minimum rel entropi complex present give minimum rel entropi algorithm independ label unlabel data margin equat simplifi express classif log jc fi jy fi note except equat equat incomplet model probabl gener ident fi ident intract find model log sum unlabel data equat analog section appli em framework find local maximum likelihood solut iter ffl calcul expect class ij ij jc fi cr jc fi ffl find model expect class arg max ident section includ refer loss constraint fi note pedagog distinct made section em process calcul expect class label respect assum gener distribut document calcul expect class label respect maximum entropi distribut class label classifi target loss find model find maximum likelihood model fix find model minimum loss model affect target loss target loss fi close probabl model prior probabl influenc data neglig limit fi probabl surfac convex singl global maximum smaller loss fi small neglig probabl data stronger influenc longer singl global fi familiar probabl surfac previou local maxima observ suggest process find model temperatur algorithm fi initi temperatur easili find global maximum posteriori solut surfac convex lower temperatur probabl surfac slightli data likelihood larger impact probabl model maximum close maximum lower temperatur slightli search maximum initi maximum converg good maximum probabl surfac gradual lower temperatur track highli probabl solut temperatur good local maximum probabl model maximum entropi rel fix loss assumpt good local maximum gener model probabl surfac ident point found local maximum label unlabel data classif note comput cost determinist anneal significantli higher em iter iter determinist temperatur reduc slowli perform iter determinist em extra comput benefit accur classifi number label document determinist perfect class assign determinist empir class determinist default class assign em unlabel data naiv unlabel data figur perform determinist anneal compar em assign perfectli determinist anneal accur em label data default correspond correct small amount domain knowledg result section empir determinist anneal find probabl paramet accur classifi em label train data dataset setup protocol section run determinist initi fi iter fi multipl factor fi made effort tune paramet determinist anneal proce tabl time fi probabl surfac run iter em temperatur set figur compar classif accuraci achiev determinist anneal achiev regular em initi result method perform essenti label data determinist anneal perform label data label exampl class em accuraci determinist anneal close investig matric show detriment effect incorrect correspond determinist anneal label data make accuraci log probabl model regular start point determinist anneal figur scatterplot compar model probabl accuraci em determinist anneal result show determinist anneal succe find model significantli higher probabl temperatur global maximum multinomi mixtur compon close prior prior mixtur compon essenti ident temperatur lower mixtur compon compon easili track cluster wrong class attempt remedi alter correspond base classif label determinist anneal complet word count subtract final effect cluster figur show accuraci obtain empir select optim accuraci achiev perfect correspond empir set determinist anneal improv margin chang correspond em perform perfect class accuraci determinist anneal higher em verifi higher accuraci determinist anneal find probabl figur show scatterplot model probabl versu accuraci determinist anneal optim class em result note stand determinist anneal find jpeg imag graphic imag gif format pub rai siggraph window ei win um ms ini microsoft nt el scsi id drive control bu dx bio drive mb card appl mac lc window widget motif server lib entri usr sun tabl top ten word class dataset word sort weight ratio note ten top person domain knowledg correctli correspond cluster class probabl small amount label data account ad accuraci determinist anneal note interest model found determinist anneal lie correl line evid model probabl accuraci strongli correl correl artifact em discuss result show determinist anneal classif correspond solv problem determinist anneal successfulli avoid trap poor local find probabl model model correl determinist anneal make good unlabel data text classif problem sever limit label data fewer label small perturb lead correspond bit human problem typic solv trivial largest classif straightforward identifi class indic measur metric weight ratio top ten word class dataset metric shown tabl ten person bit domain knowledg problem perfectli assign class compon unreason requir small amount human effort correct class correspond determinist anneal finish label train data determinist anneal successfulli find probabl accur model tradit em limit domain knowledg class correspond automat perform em determinist anneal data em solut gener correct class model fix correspond determinist anneal model measur distanc em class multinomi determinist anneal class multinomi matrix distanc assign class label em multinomi closest match multinomi determinist anneal model make explicit determinist anneal insensit label data determinist anneal insensit initi influenc label data perform determinist anneal unlabel data residu effect label data perform cluster correspond recommend castelli cover determinist anneal introduc rose al construct hierarchi cluster motiv strong analog statist physic relat determinist anneal applic estim paramet mixtur gaussian unlabel data construct text hierarchi unlabel data chapter address techniqu improv unlabel data label data condit provid opportun benefit unlabel pose challeng process integr unlabel data gener model suffer poor initi em optim improv unlabel data wai learn algorithm interact human limit label carefulli select document label find initi lead accur classifi temper variat em determinist anneal avoid local maxima find probabl accur classifi techniqu made unlabel data label data chapter relat work field text classif rich exist ongo scientif research relat theoret empir approach incorpor unlabel data learn provid strong foundat thesi work chapter survei current state field intersect text classif text classif form time earli applic text classif author identif semin work wallac examin authorship paper bayesian analysi featur word sentenc frequenc function vocabulari recent text classif appli wide varieti practic catalog articl classifi web page symbol ontolog find person homepag automat learn read interest user automat thread filter email content sahami book recommend earli popular machin learn techniqu text classif naiv straightforward probabilist natur made amen varieti extens limit word depend model tan tree leverag class hierarchi provid statist shrinkag techniqu correspond relax thesi extend naiv unlabel data gener model naiv thesi multinomi languag model classifi mixtur multinomi track number time word document formul numer naiv text classif li mccallum formul naiv text classif gener model word vocabulari binari model mixtur bernoulli larkei koller empir comparison show multinomi formul yield classifi consist higher accuraci varieti machin learn techniqu naiv appli text classif support vector machin recent shown dumai approach maximum entropi neural net shavlik rule learn algorithm cohen moulini craven method neighbor cohen varieti boost approach apt sebastiani singl techniqu emerg recent evid suggest knn svm perform algorithm lot label data class interest studi text classif simpl document track number time word occur occur effort includ substanti linguist semant inform provid modest improv classif accuraci furnkranz al shallow syntact phrase pattern find improv naiv rule learn algorithm mladen select phrase text classif web page yahoo hierarchi studi incorpor text classif inform semant network english languag scott learn label unlabel data turn survei combin label unlabel data initi work area start recent join machin learn commun likelihood maxim approach idea learn classifi combin label unlabel data statist commun earli suggest label unlabel combin build classifi likelihood maxim test class assign semin paper dai present iter approach paramet mixtur normal covari unlabel data similar iter algorithm build maximum likelihood classifi label unlabel data primarili mixtur normal distribut dempster al present theori em bring formal common suggest iter techniqu likelihood maxim miss data applic estim maximum likelihood maximum paramet mixtur model label unlabel data classif recogn immedi approach continu studi excel survei histori em applic mixtur model book mclachlan mclachlan krishnan mclachlan likelihood maxim mixtur model combin label unlabel data classif recent made machin learn commun nigam work approach earlier similar mixtur model gener model paramet fit em cheeseman hofmann ghahramani jordan em fill miss featur valu exampl learn incomplet data assum mixtur model hierarch similar mixtur paramet typic set em work dissert explor combin label unlabel data text classif discrimin approach transduct support vector machin discrimin find paramet linear separ label data data test approach equal applic scenario label unlabel data high work find linear separ label exampl class maxim margin label unlabel exampl joachim demonstr efficaci approach text classif task bennett find small improv uci dataset easier variant transduct intuit transduct svm assum boundari lie class region instanc unlabel exampl find area zhang ol argu theoret transduct svm classif gener maximum entropi discrimin framework classif approach make unlabel data find maximum entropi minimum rel distribut classifi subject constraint label fix margin boundari classif perform calcul integr expect exampl class induc paramet distribut unlabel data ad distribut unknown class label jointli estim maximum entropi margin constraint ad unlabel data encourag estim commit label unlabel exampl make tion estim iter relax algorithm converg local minima rel entropi encourag result combin label unlabel data context predict dna splice point recent work jaakkola unlabel data classif kernel featur label datapoint includ kernel densiti label unlabel maximum entropi discrimin framework maximum likelihood deriv linear separ classif task intuit unlabel data weight rel import label data base instanc densiti weight inform discrimin train exampl approach essenti carefulli select form width kernel accur model underli instanc distribut open challeng question theoret unlabel data effort quantifi rel label unlabel exampl learn mixtur distribut classif result literatur concern mixtur gaussian mclachlan calcul approxim asymptot rel effici label unlabel exampl classif univari normal equal varianc oneil step quantifi asymptot rel effici multivari normal covari matric venkatesh perform similar pac framework gener case mixtur class mixtur distribut chen bound rate converg paramet estim unlabel exampl number mixtur compon bound result cover paramet estim classif error mention result assum global maximum likelihood found problem local data gener model gener challeng case applic result castelli cover show label exampl exponenti valuabl unlabel exampl result appli estim class probabl paramet underli compon distribut correct relat show label data reduc error exponenti fast infinit amount unlabel data compon distribut correspond recent zhang ol examin unlabel data discrimin trainer transduct svm activ learn mention question gener transduct svm activ learn explicitli select sampl integr unlabel data learn select sampl form activ learn select exist label approach select exampl maxim reduc varianc compon classif error freund classifi variant select high classif varianc theoret analysi show consist learn exponenti reduc number label exampl learn shown power paradigm practic dagan approach learn tagger similarli work section statist model classifi creat sampl vote entropi measur disagr text shown sampl diverg base metric perform lier winnow perceptron learner activ learn text classif document select label randomli select member class label member form multipl random initi classifi studi investig activ learn select sampl specif domain text categor lewi gale examin uncertainti sampl relev sampl set techniqu select document base singl classifi approxim classif varianc uncertainti sampl select label classifi uncertainti class relev sampl certainti class cohn approach similar uncertainti support vector machin select label closest linear boundari classifi tong koller perform select sampl support vector approach motiv maxim reduc size version space good studi shown benefit activ learn appli text classif domain unlabel data learn set unlabel data wai specifi disjoint view data web classif instanc word occur web word hyperlink point web page blum mitchel show theoret weak learner arbitrarili improv suffici unlabel exampl present algorithm iter select unlabel nigam ghani argu algorithm variant succe part robust assumpt underli classifi collin singer present learn minim disagr unlabel data classifi view data goldman zhou show approach succe dataset disjoint view carefulli select underli classifi develop label data proven label data data label relat direct map task hand system document label domain interest automat extract indic case frame match item extract seymor al data estim output paramet hmm inform extract research paper domain similar hirsh unlabel data background knowledg augment classifi match test directli closest label match test label measur similar common set unlabel exampl bootstrap techniqu learn algorithm begin label data iter develop concept interest riloff jone start small dictionari locat set unlabel data bootstrap larger dictionari locat case frame pattern indic locat yarowski bootstrap word disambigu algorithm start small set seed colloc word unlabel data reduc prevent overfit strong evid overfit disagr unlabel data candid classifi larger sum error label data observ select complex polynomi regress prune tree unlabel test data reduc overfit linear regress augment minim criteria squar error term base unlabel data chapter dissert address problem integr unlabel data learn text classif label data human time effort label frequent case label train data contrast unlabel data plenti true text classif task type text readili electron form find find unlabel data text classif approach simpl statist gener model class paramet model highli probabl evid label unlabel document basic model document distribut mixtur model mixtur compon gener document class multinomi distribut word label data familiar naiv text maximum posteriori paramet found close form equat access unlabel find local maximum paramet data techniqu paramet model turn rule classif domain strong correspond model probabl classif find probabl paramet yield accur classifi experi detail section label unlabel data build text classifi collect usenet articl dataset show classif accuraci model probabl strongli unlabel data reduc classif error label train data conclud integr unlabel data learn reduc error text classifi initi gener model approach em text classif accuraci unlabel data intricaci text document captur mixtur multinomi model interest find model maxim probabl model accuraci classifi model captur inform document classif model structur make model repres dataset adequ model basic gener process case unlabel data paramet estim classif error find paramet poorli match true data distribut class singl multinomi mixtur compon repres model requir section multipl mixtur compon class reuter dataset model singl class stori topic unlabel data basic model classif error gener model multipl mixtur compon class repres dataset bring model probabl classif accuraci classif error topic compar label data suffici repres maxim model posterior probabl find accur classifi label unlabel data label data research shown gener model word depend yield accur classifi unlabel data principl model strongli assum model correct label unlabel data paramet assumpt strongli gener class label reflect model provid accur model paramet case adjust bia assum parametr form model close match true document distribut model hierarch class relationship reduc overfit classif domain hierarch relationship class basic gener process ignor relationship model class independ mixtur compon paramet class close relat class separ opportun overfit unlabel data explicitli model hierarch class make effici unlabel data estim share paramet data approach reduc overfit make model probabl unlabel data close match model probabl true document distribut cora dataset comput scienc hierarchi leverag section show hierarchi unlabel data reduc classif error repres hierarch make effici data error reduc naiv baselin rel human perform conclud model hierarch relat gener process effici unlabel data produc accur text classifi activ learn creat improv em initi algorithm incorpor unlabel data label unlabel data plai role primari effect label data initi maxim unlabel data effect em iter qualiti initi typic determin accuraci result classifi opportun unlabel data improv text classif accuraci limit interact human activ learn select unlabel document label provid initi em section appli approach dataset initi em activ select document reduc number label reach accuraci threshold classifi conclud activ select unlabel document label reduc bottleneck label data determinist anneal find accur text classifi em reason em initi strongli influenc classif accuraci em trap local maxima probabl space em approach perform maxim altern techniqu determinist anneal robust local maxima maxim smooth surfac gradual make probabl surfac maxim end maximum origin probabl surfac determinist anneal track maximum settl classifi section appli techniqu dataset determinist anneal consist find probabl solut label data initi poor determinist anneal prone error easili correct minimum human effort probabl determinist anneal classifi reduc classif error em conclud determinist anneal find probabl model accur text em effect avoid local maxima basic approach unlabel data maxim probabl statist gener model approach work model repres classif accuraci correl model probabl basic model accur model found successfulli repres unlabel data label data bottleneck perform issu address activ select label maxim techniqu sensit label data futur direct work thesi suggest direct research deserv attent outlin gener model approach recent approach incorpor unlabel data learn gener model approach jaakkola discrimin focu directli estim boundari class interest import area futur work understand type domain amen approach extrem data gener statist posterior model maxim approach bia algorithm correct effici data text dataset complet captur statist model suffici repres model data discrimin approach discrimin approach make assumpt subject violat transduct svm assum low densiti region linear separ pass gener approach suit excit understand assumpt approach violat ideal base unlabel limit label predict approach benefici number statist test multinomi mixtur multinomi distribut prove poor fit mixtur multinomi suggest discrimin approach suit domain case fit model good model repres benefici gener approach exist test suffici approach directli compar rel accuraci document distribut measur mixtur multinomi densiti estim estim predictor discrimin approach perform possibl explicitli examin correl probabl gener model classif accuraci modest extrem small set label accuraci measur paramet set found total cluster strength correl good predictor appropri gener model section perform run em random initi displai figur correl model probabl accuraci indic appropri approach dataset featur select multipl classif task gener model approach suggest singl classif task domain global maximum mixtur multinomi set goal document typic author intent fit arbitrari categori imagin classif task domain addit task newsgroup interest classifi data nation relev comput scienc relev system administr reconcil contradict gener model multipl classif task reconcil featur select set featur domain gener dramat posteriori featur select essenti step build text classifi label data limit label data difficult select set featur word occur label data interest set featur select algorithm applic combin label unlabel data direct iter featur style improv iter scale pietra boost model maxim featur select influenc unlabel data maintain direct label data provid robust overfit local maxima determinist anneal appendix complet hierarchi keyword appendix present entir hierarchi kei word phrase cora experi section ffl inform retriev ffl retriev inform retriev ffl extract inform extract wrapper induct wrapper www ffl filter text classif document classif document categor document filter ffl digit librari digit librari ffl encrypt compress ffl encrypt encrypt cryptograph cryptolog cryptographi mutual distrust decentr author secur secret ffl secur comput secur secur hole secur hole secur attack ssl network secur ffl compress compress entropi code video audio audio code video code mpeg ffl human comput interact ffl multimedia multimedia ffl interfac design gui interfac design ffl graphic virtual realiti virtual realiti comput graphic siggraph ffl cooper cscw ffl wearabl comput wearabl comput wearabl comput ffl artifici intellig ffl expert system expert system ffl knowledg knowledg ffl machin learn ffl reinforc learn reinforc learn tempor differ learn ffl genet algorithm genet algorithm genet algorithm genet program natur select evolutionari evolutionari comput ffl probabilist method rule densiti estim bayesian network network bayesian network network belief uncertain infer probabilist reason uai ffl neural network neural network neural network gradient descent project pursuit map ijcnn ffl theori pac colt warmuth freund schapir ffl rule learn rule learn ilp ffl case base instanc base memori base ffl robot robot robot robot ffl vision pattern recognit pattern recognit pami comput vision ffl speech speech recognit ffl plan plan tempor reason reason time ffl nlp nlp natur languag process ffl theorem prove theorem prove ffl agent agent agent multiag artifici life ffl game search game search combinatori optim stochast optim ffl data mine data mine mine ffl ffl tempor tempor tempor ffl deduct deduct deduct ffl concurr concurr ffl queri evalu queri ffl object orient oodbm object orient ffl relat relat ffl perform parallel parallel scalabl ffl program ffl garbag collect garbag collect ffl semant program languag semant denot semant program languag ffl compil design compil design compil algorithm parallel compil compil languag optim code compil program ffl debug debug ffl java java ffl object orient object orient program smalltalk ffl function function program lisp ffl logic logic program logic program prolog prolog ffl softwar develop softwar engin design tool softwar metric program environ comput aid engin softwar softwar portabl configur manag ffl oper system ffl memori manag memori manag share memori ffl distribut distribut system distribut comput distribut comput distribut os distribut system distribut system distribut network environ distribut oper system distribut oper system distribut file system distribut file system network file system mobil comput network workstat cluster workstat distribut storag system ffl realtim realtim real time ffl fault toler fault toler toler fault ffl network ffl protocol network protocol commun protocol commun protocol multicast atm udp ffl rout rout qo switch network switch network rout network ffl internet internet internet architectur web cach ffl wireless wireless network wireless network mobil network ffl hardwar architectur ffl high perform comput high perform comput ffl vlsi vlsi ffl memori structur memori structur hardwar ffl distribut architectur distribut architectur distribut architectur distribut hardwar ffl microprocessor control ffl logic design circuit circuit cmo logic design gate level circuit analog circuit analog system analog convert gate circuit gate circuit circuit transistor circuit fan ffl input output storag disk drive scsi ffl data algorithm theori ffl random random algorithm ffl parallel parallel algorithm ffl formal languag finit state machin method languag formal model automata theori automata ffl comput complex space complet complex decid complex class bound complex ffl sort sort ffl hash hash ffl comput geometri comput geometri ffl logic finit model theori program verif format analysi verif modal logic ffl quantum comput quantum bibliographi autom learn rule text categor acm transact inform text mine tree rule workshop learn text confer autom learn discoveri sampl select probabilist classifi journal artifici intellig probabilist model face orient learn label unlabel exampl advanc neural inform process system pp support vector machin advanc neural inform process system pp combin label unlabel data cotrain annual confer comput learn pp learn evalu function global optim doctor comput scienc carnegi mellon empir method data analysi chapman hall exponenti label sampl pattern recognit rel label unlabel sampl pattern recognit unknown mix paramet ieee transact inform incorpor test input learn advanc neural inform process system pp bayesian classif system machin intern pp bayesian classif theori result smyth uthurusami advanc knowledg discoveri data mine mit press optim rate converg finit mixtur model annal penal test finit mixtur model multinomi observ canadian journal join text categor whirl fourth intern confer knowledg discoveri data pp learn method text categor sigir nineteenth annual intern acm sigir confer research develop inform pp improv gener activ learn machin activ learn statist model journal artifici intellig model entiti classif joint confer empir method natur languag process larg corpora element inform theori john wilei son learn construct knowledg base world wide web artifici relat learn statist predic model hypertext machin learn web mine european confer machin pp multinomi test journal royal statist seri inform theori hanson silver maximum entropi bayesian method kluwer academ publish sampl train probabilist classifi machin twelfth intern pp estim compon mixtur normal distribut della della induc featur random field ieee transact pattern analysi machin maximum likelihood incomplet data em algorithm journal royal statist seri approxim statist test compar classif learn algorithm neural optim simpl bayesian classifi loss machin induct learn algorithm text categor seventh intern confer inform knowledg pp fourth acl confer appli natur languag pp select sampl queri algorithm machin data mine knowledg case studi linguist phrase text categor www learn text paper aaai pp tech rep aaai press classif mixtur approach cluster maximum likelihood appli effici linear discrimin function base unclassifi initi sampl neural network dilemma neural learn incomplet data em approach advanc neural inform process system pp enhanc learn unlabel data seventeenth intern confer machin maximum entropi hypothesi tabl annal mathemat classif estim analysi varianc problem review intern statist statist model data tech rep ai memo artifici intellig mit exploit gener model discrimin classifi advanc neural inform process system pp maximum entropi discrimin advanc neural inform process system pp inform theori statist mechan physic probabilist analysi rocchio algorithm tfidf text categor machin fourteenth intern pp text categor support vector learn relev featur machin tenth european confer machin pp transduct infer text classif support vector machin machin sixteenth intern confer hierarch mixtur expert em algorithm neural hierarch classifi document word machin fourteenth intern pp learn filter netnew machin twelfth intern pp combin classifi text categor sigir nineteenth annual intern acm sigir confer research develop inform pp evalu phrasal cluster text categor task sigir fifteenth annual intern acm sigir confer research develop inform pp sequenti algorithm train text addit data sigir naiv independ assumpt inform retriev machin tenth european confer machin pp sequenti algorithm train text classifi sigir seventeenth annual intern acm sigir confer research develop inform pp thread electron preliminari studi inform process comparison learn algorithm text categor annual symposium document analysi inform pp train algorithm linear text classifi sigir nineteenth annual intern acm sigir confer research develop inform pp document classif finit mixtur model annual meet associ comput pp activ learn approach effici learn text categor linear threshold algorithm doctor depart comput oregon state activ learn text categor fourteenth nation confer artifici pp diverg measur base shannon entropi ieee transact inform discuss paper professor professor laird dr rubin journal royal statist seri comparison event model naiv text classif learn text paper aaai pp tech rep aaai press emploi em activ learn text classif machin fifteenth intern pp autom construct internet portal machin learn inform improv text classif shrinkag hierarchi class machin fifteenth intern pp mixtur model marcel dekker finit mixtur model john wilei son iter procedur construct asymptot optim rule alloc discrimin analysi journal american statist updat discrimin function basi unclassifi data commun simul em algorithm extens john wilei son tag english text probabilist model comput gener gaussian mixtur classifi learn base label unlabel data confer inform scienc system machin learn machin learn distribut text data doctor faculti comput inform slovenia featur select unbalanc class distribut naiv machin sixteenth intern pp book recommend learn text categor acm confer digit pp infer disput text symbol approach annual symposium document analysi inform pp estim problem data mixtur appli prevent data machin fourteenth intern pp analyz effect applic ninth intern confer inform knowledg pp maximum entropi text classif workshop machin learn inform pp learn classifi text label unlabel document fifteenth nation confer artifici pp normal discrimin unclassifi observ journal american statist syskil identifi interest web site thirteenth nation confer artifici pp numer recip cambridg press learn mixtur label unlabel exampl parametr side inform eighth annual confer comput learn pp automat gener extract pattern untag text thirteenth nation confer artifici pp learn dictionari inform extract sixteenth nation confer artifici pp prior integ estim minimum descript length annal relev weight search term journal american societi inform wordnet complement train inform text categor intern confer recent advanc natur languag pp statist mechan phase transit cluster physic review vector quantiz determinist anneal ieee transact inform learn limit depend bayesian classifi intern confer knowledg discoveri data pp bayesian approach filter junk learn text paper aaai pp tech rep aaai press system text categor machin activ learn support vector machin seventeenth intern confer machin learn approach model select fourteenth nation confer artifici pp adapt regular criterion learn seventeenth intern confer machin learn text classif wordnet hypernym usag wordnet natur languag process pp improv boost algorithm applic text categor ninth intern confer inform knowledg pp queri machin intern pp learn hidden markov model structur inform extract machin learn inform paper aaai workshop tech rep aaai press effect unlabel sampl reduc small sampl size problem mitig hugh phenomenon ieee transact remot intellig agent approach learn text paper aaai pp tech rep aaai press model merg hidden markov model induct tech rep berkelei kernel unlabel data advanc neural inform process system updat diagnost system case appli support vector machin activ learn applic text classif seventeenth intern confer machin learn determinist anneal variant em algorithm advanc neural inform process system pp statist learn theori john wilei son quantit studi infer inform john wilei son neural network approach topic spot fourth annual symposium document analysi inform pp evalu statist approach text categor inform map method text classif retriev acm transact inform featur select statist learn text categor machin fourteenth intern pp word disambigu rival method annual meet associ comput pp improv classif unlabel background knowledg assess document similar seventeenth intern confer machin learn test larg multinomi distribut journal american statist probabl analysi unlabel data classif problem seventeenth intern confer machin pp
ML/1480 6 mitsubishi electr research laboratori style machin matthew brand aaron merl nyu media research laboratori broadwai broadwai ma ny april abstract approach problem stylist motion synthesi learn motion pattern highli vari set motion captur sequenc sequenc distinct perform distinct style learn identifi common choreograph element style element small number stylist freedom span variat dataset learn model motion data interpol extrapol style convert novic motion grace modern danc expert model driven gener virtual style siggraph juli usa work copi reproduc part commerci permiss copi part payment fee grant educ research provid partial copi includ notic copi permiss mitsubishi electr inform technolog center acknowledg author individu contribut applic portion copyright notic republish requir payment fee mitsubishi electr inform technolog center america reserv copyright mitsubishi electr inform technolog center massachusett submit decemb april merl confer siggraph matthew brand mitsubishi electr research laboratori style machin aaron nyu media research laboratori synthet style drawn space modern bodi type synthet show trajectori left hand foot abstract approach problem stylist motion synthesi learn motion pattern highli vari set motion captur sequenc sequenc distinct perform distinct style learn identifi common choreograph element style element small number stylist freedom span variat dataset learn model motion data interpol extrapol style convert novic motion grace modern danc expert model driven gener virtual style cr graphic probabl seri code inform compact art perform art behavior charact behavior introduct natur stylist variat basic motor theme directori point style motion convei mean underli motion exist anim tool provid control style anim paper introduc style statist model gener motion sequenc broad rang adjust small number stylist knob style machin support synthesi style identif exist data driven kind includ comput kei result method learn style includ number natur stylist data style machin model highli nonlinear nontrivi behavior modern work long unseg sequenc learn model gener improv danc style machin make easi gener long motion sequenc action transit offer broad rang stylist paper show earli result manipul weight formal danc style style machin learn modest collect exist present highli gener flexibl altern motion librari potenti begin modest amount motion anim train result style machin gener larg amount motion data order action cast random walk machin produc thousand plausibl motion motion data uniqu style motion captur perform style expert athlet dancer motion captur data energi bodi style machin driven comput impoverish sensor comput offer altern relat work recent effort address problem edit exist anim common approach provid interact anim tool motion goal captur style exist edit content gleicher interact motion edit tool search motion meet constraint minim distanc motion relat optim method method adapt motion charact lee al provid interact multiresolut motion editor control motion edit merl confer siggraph figur schemat illustr effect minim simpl walk cycl project data point repres bodi pose observ time convent fit singl model data arc learn overwhelm variat fail discov essenti structur walk cycl individu estim model overfit individu gener data divid cycl blend compar minim model constrain similar qualit structur identifi similar phase cycl gener model abstract inform set style variabl recov specif model interpol extrapol system produc result violat law witkin describ method edit motion space order edit motion maintain physic valid method complement techniqu present altern approach provid global anim control signal process william al provid control edit style motion witkin blend exist motion provid combin motion style rose al radial basi function interpol extrapol set align label motion walk kinemat solver smoothli string motion similar function fall framework interact system provid fine reli labor skill anim produc compel convinc result gener difficult produc motion substanti exist style content convert hand ponder walk method requir motion sequenti correspond found compon motion rare case set complex motion properti style machin automat comput flexibl correspond sequenc fast dynam program algorithm work unit theme separ research histori motion estim dynam model style content separ al analyz motion video gaussian model al learn control physic system physic simul author hidden markov model analyz motion bregler brand hmm recogn analyz motion video sequenc brand analyz anim human speech audio video regard wilson bobick parametr motion recognit model learn style tenenbaum freeman separ style content gener domain bilinear model factor individu linear cooper multipl effect effect light pose imag face model depend larg set sampl exponenti number stylist freedom explicit statement stylist dof introduc method extract inform directli automat modest amount data learn stylist model seek model human motion gener varieti style attempt engin attempt learn extract data function approxim mechan cast learn goal acquir gener model captur essenti structur discard properti specif properti includ bia sampl essenti structur divid call structur style stylist variat dynam system simpl tempor determinist loop model make distinct structur locomot small set qualit state rule govern state style variat map qualit state quantit observ shift weight load leg state common form model data hidden markov model hmm probabilist machin consist set discret transit emiss state gaussian distribut small space pose motion hmm detail add hmm style variabl vari call result stylist hmm style machin formal defin space fix paramet yield uniqu hmm show separ properti dataset minim entropi main advantag separ style structur wind gener model significantli data requir gener learn set framework fulli automat identifi number natur stylist freedom fewer number variat merl confer siggraph discov freedom lend intuit oper style analog gener model begin famili train sampl sampl gener mechan motor program danc sampl instanti variat sampl action vari sampl sampl model goal extract singl model cover gener behavior entir famili train easili made model individu combin extrapol set style variabl learn involv simultan estim gener model set model model fit specif model close gener gener model simpl maxim probabl correct gener data constraint express eqn section explain constraint interact produc desir model express small variat gener space variat captur paramet describ style machin appli pure signal data detail specif work data estim entropi minim learn minim sum measur ambigu probabl measur diverg distribut principl minimum advoc form seek simplest model explain complex model paramet estim fulli support data maxim inform extract train data boost odd gener correctli learn object constraint list model distribut statist extract data measur data gener specif model measur inconsist analysi data entropi gener model measur ambigu lack structur analysi data minim make model faith data minim essenti maxim overlap gener specif model congruenc hidden state mean model similarli hidden state similar dataset motion hmm converg similar machin model locomot state hmm refer qualit similar pose motion locomot cycl nth state model tune pose weight shift style motion figur minim optim predict model make pictur hidden state explain delin phenomenon data figur flatten align gaussian minim entropi gaussian distribut visual ellipsoid contour put learn object function θ θ posterior likelihood prior data entropi entropi θ vector model ω vector expect suffici statist describ data θ refer model entropi cross entropi measur eqn formul bayesian posterior likelihood function prior data entropi mention normal likelihood measur ambigu statist calcul model effect prior worth examin prior give final model θ special gener properti prior term express belief parsimoni model give maxim minim uncertain explan structur train set optim bia extract inform data appli prior gener model prior interest effect emiss distribut pose gradual remov dimens flatten distribut effect reduc volum entropi figur prior term style model close congruent gener hidden state model similar behavior practic assess prior emiss distribut specif effect emiss distribut cluster tightli gener emiss distribut minim distanc state entir model add term vari strength prior optim constrain gener gaussian constrain distribut gaussian style small number freedom gaussian narrow align direct narrow overlap disk figur illustr dimens overlap gaussian fewer freedom rel model drawn gener model model settl paramet subspac figur variat model paramet identifi freedom solv smooth manifold model merl confer siggraph figur schemat style dof discoveri model drawn data typic span dimens paramet space drawn gener settl paramet subspac dash experi show linear subspac good stylist freedom subspac easili obtain princip compon analysi set repres paramet extend prior addit function θ ad vari determinist optim strategi forc system explor error surfac scale myopic converg nearest local optimum optim learn hope simultan segment data motion match similar primit execut estim structur paramet minim maxim gener model entrop estim framework solv partial discret optim problem continu space entropi numer method form maximum posteriori paramet estim attempt find gradual excess model paramet data solv discret optim problem distribut segment singl segment optim proce fast power fixpoint algorithm converg local likelihood optimum initi estim give modifi em optim anneal anneal strengthen map optim probabl approach anneal assur due number combinatori optim problem solv model paramet estim full algorithm initi gener model model motion sequenc em loop comput expect suffici statist ω motion sequenc rel model calcul maximum posteriori paramet valu ˆ θ statist entir train set calcul maximum posteriori paramet valu ˆ θ statist current sequenc adjust temperatur find subspac span paramet variat model calcul pca differ gener model initi random full anneal initi condit encod hint initi em loop partial anneal start lower temperatur hmm properti save troubl label train action train sequenc squash stretch basic hmm dynam program algorithm find optim segment label sequenc prior simpli add constraint frame exhibit similar behavior necessarili sequenc figur illustr induc state machin label similar induc state machin captur choreograph element transit work motion captur make problem harder easier depend data repres algorithm learn algorithm statist salient pattern variat data motion pattern human find perceptu express salient preprocess data highlight sourc variat bodi suppress irrelev sourc inconsist marker placement world coordin sequenc model stylist sourc variat bodi scale domin style space describ method convert raw marker data suitabl learn motion data gather preprocess gather human motion captur data varieti sourc acknowledg data consist posit physic marker human acquir short interv motion captur studio data sourc provid data arrang marker bodi defin reduc marker marker input sequenc convert combin delet extra marker miss marker recov data remap style machin origin input marker doubl size data set resampl sequenc captur synthet motion captur data figur anim show motion marker connect fake skeleton skeleton algorithm ad illustr make marker easier follow step convert marker data joint angl limb global posit global orient base root kinemat tree joint angl train joint angl natur period rang train assum input signal li infinit domain pain joint angl merl confer siggraph discontinu jump train data fulli elimin discontinu partial due input data invert knee joint angl remov inform articul greatest bodi pose restor scale joint angl variabl make statist salient articul vari measur data set procedur similar gleicher reduc depend individu bodi pose subtract reduc typic ten fewer dimens data variat train train model initi state transit matrix probabl declin exponenti gaussian initi randomli center nth frame sequenc initi condit save learn algorithm troubl select factori number differ order state train set temperatur high make decai exponenti forc estim explor error surfac scale commit region paramet space set temperatur forc variat model stai gener model high commit made initi larg gener temperatur briefli heat model ventur find datapoint explain gener model drive temperatur estim converg entropi minimum temperatur schedul hint guid find global offload local variat specif simplifi model result train collect model distribut γ hidden explain frame inform sequenc typic distribut mean γ singl state sequenc explain data γ sequenc probabl encod content show appli model content style γ remap emiss distribut joint angl angular scale import joint inform synthesi remap mean emiss paramet observ synchron train data make style encod hmm vector state mean µ covari state dwell time long model stai state transit style creat interpol extrapol space space reduc treat hmm singl observ gener hmm origin pca cyclic ideal von essenti gaussian wrap analyt varianc estim subspac model ax variat style train set stylist dof span variat train dimens style variabl interpol style train set vari coordin model style hmm result paramet vector interest convex hull train theme explor analyz data obtain style coordin motion sequenc begin copi gener model model assign high retrain model constraint respect origin gener model project result paramet style manifold style coordin obtain state occup matrix γ mention summar content motion sequenc kei virtual motion data style variabl state sequenc encod content style calcul path arg maxi brand describ method calcul sampl time timestep gener improv inform γ result path inher smooth curv vari system dwell hidden state veloc constraint frame motion discontinu sampl differ veloc success state larg rel frame rate preprocess step produc virtual data final output action longer move style accommod scale dwell time state sequenc match style wai make time incorpor dwell time directli emiss distribut list clock frame addit exist gener motion data directli model learn automat extract motion primit motion cycl data figur form state cut past state sequenc state machin arc state consecut schedul motion model automat modifi end begin primit transit smoothli find path state machin primit insert state path interest effect achiev random walk state gener random plausibl exampl collect set locomot varieti sourc sequenc featur varieti kind bodi marker placement convert motion data common set marker prototyp bodi normal walk kick spin state merl confer siggraph walk kick spin male state femal expert femal modern danc state time time time time state femal lazi figur state machin learn danc sequenc total frame arc remov clariti motion cycl primit linear sequenc occup matric sequenc segment label note variat cycl sequenc figur complet analog synthesi stylist motion stick figur show show trajectori extrem extrapol energet arm swing power run figur motion sequenc style align spin odd bodi geometri reflect marker placement train merl confer siggraph algorithm typic identifi variat bodi geometri princip stylist hint train hmm data entrop estim yield model essenti locomot cycl initi full train lightli constrain final gener model retain inform initi pca result model reveal stylist freedom explain variat model stylist dof global tilt forward back inform speed motion style dof control balanc vari modifi distanc swing arm style dof amount energi yield sequenc extrapol hull specif model yield motion expect properti doubl amount tilt walk forward demonstr analog analog interest form extrapol problem solv term style coordin complet style coordin corner run walk result sequenc form pop danc analog model fashion show turn exampl handl exist signal process method complic system train perform classic train dancer durat roughli move perform similar vari style move model roughli minut train interpret matlab code singl cpu paramet extinct left roughli paramet figur show system discov roughli qualit structur danc figur show flowchart discov learn sequenc novic dancer attempt similar move wrong wrongli lose obtain notabl improv grace recogniz danc shown accompani video gener random walk state machin result state sequenc varieti shown video figur illustr result show pose align perform demonstr drive style machin video essenc techniqu gener stylist motion captur hmm state sequenc distribut exampl obtain state sequenc exist motion captur random walk hmm state machin state sequenc calcul arbitrari shadow techniqu infer state sequenc bodi pose veloc video imag sequenc mean creat anim act motion front style machin map style accompani video show stylist variat thereon discuss framework autom task edit data explicit statement theme stylist freedom thing discov learn algorithm automat segment identifi primit motion learn transit identifi stylist dof make primit sequenc approach treat anim pure infer prior kinemat dynam prior annot segment data primit style gener anim learn directli data user forc stai expect method easili coupl quadrat synthesi object function linear gradient penalti term larger optim incorpor constraint foot paper video make clear potenti raw infer method gener small train fail problem train set explor varieti strategi increment learn motion data import open question choic temperatur learn time qualiti model result sensit theoret result optim schedul concentr style machin framework gener appli varieti data type underli model model varieti textur mixtur learn stylist extrapol textur summari style machin gener probabilist model data broad varieti interpol extrapol stylist variat learn train set introduc optim framework make learn style machin sampl unlabel style exampl show appli style machin demonstr kind exist styliz motion data styliz motion video show style machin danc student pose motor skill expert dancer novic acknowledg merl confer siggraph dataset train model made bill michael adapt anonym sourc special bill choreograph collect danc sequenc analysi assist convert motion captur file jonathan defin joint angl refer baum inequ maxim techniqu statist estim probabilist function markov process brand pattern discoveri entropi minim heckerman artifici intellig statist januari brand explor variat structur optim intern confer machin brand voic siggraph page august brand shadow iccv septemb bregler learn recogn human dynam video sequenc cvpr william motion signal process graph page august buhmann empir risk induct principl learn technic report institut für informatik universität bonn knuth lambert function advanc comput freeman tenenbaum learn bilinear model problem vision conf comput vision pattern page san gleicher motion edit constraint symposium interact page april gleicher retarget motion charact siggraph page juli hinton fast neural network emul control model graph page juli freeman bayesian reconstruct human motion video advanc neural inform process volum mit lee shin hierarch approach interact motion edit figur siggraph page august witkin physic base motion transform siggraph page august rabin tutori hidden markov model select applic speech recognit feb verb motion interpol ieee comput graphic septemb octob tenenbaum freeman separ style content advanc neural inform process volum page mit takeuchi fourier principl human figur anim siggraph page august wilson bobick parametr hidden markov model gestur recognit ieee tran pattern analysi machin witkin motion warp siggraph page august mumford minimax entropi principl applic textur model neural time figur graphic model hmm path map observ signal xt explain hidden state variabl case style variabl hidden infer probabilist arc condit depend form compat function paper give rule learn paramet analysi synthesi consist behavior arbitrari set hidden markov model hmm probabl distribut depend structur diagram figur θ set discret stochast matrix probabl transit state state stochast vector pi probabl sequenc begin state emiss probabl probabl observ state typic gaussian µ µ covari ki cover hmm essenti detail tutori path configur space hmm merl confer siggraph mean divid configur space hidden emiss probabl distribut likelihood path respect sequenc hidden state probabl point path respect current hidden state ps time probabl state sequenc product state transit ps sum hidden state obtain likelihood path respect entir ps ps ps ps hmm estim data altern step distribut hidden local optim paramet valu respect distribut dynam program eqn save troubl sum exponenti number state sequenc pi α call forward similar backward variabl variabl β calcul expect suffici statist ω form basi paramet estim statist talli expect number time hmm transit state probabl hmm hidden state si serv datapoint xt statist optim respect inform entir sequenc due forward backward calcul maximum likelihood paramet estim simpli normal eqn remap model synchron replac power estim stylist hidden markov model stylist hidden markov model hmm paramet function depend style variabl figur simplic develop case emiss probabl function gaussian mean covari vari case θ µ vector µ covari matrix variat matric style vector multivari gaussian probabl observ datapoint xt state µ ki styliz covari matrix ki iv posit definit map eigenvalu absolut valu paramet µ obtain data entrop domin eigenvector obtain pca estim data vari user fix model standard hmm call case gener hmm simpler version model treat context mean hand structur transit function number dimens stylist variat train sequenc framework learn automat gener wide varieti graphic model entropi term object function essenti likelihood measur fit model log remain term measur fit model belief form deriv likelihood function multinomi paramet θ log log gaussian covari dlog ij µ µ likelihood function multinomi gaussian multipl set hidden work composit optim sum measur model code typic bound entropi composit model entropi declin bound tight posterior merl confer siggraph optim continu figur expect maxim find local optimum repeatedli construct convex bound touch object function current paramet estim calcul optim paramet set bound figur object function shown energi posterior optimum lowest point curv anneal add probabilist find global defin smooth blend hard optim problem symbol foremost maxim easi problem repres track optimum blend estim optim gaussian paramet set minim datapoint xi refer gaussian µ covari xi µ ˆ optim multinomi paramet set event count ω refer multinomi distribut fixpoint log defin factor vari strength entropi prior anneal deriv technic report estim maxim step illustr figur path map path map statist model support predict behavior target system observ cue system path map essenti hmm share backbon hidden state transit function deriv target system figur output hmm gaussian emiss distribut target configur veloc path cue configur calcul distribut γ hidden state eqn distribut calcul optim path target configur space equat synthesi improv solut motion sequenc matrix state occup probabl γ entropi γ distribut motion sequenc lim γ vector target posit veloc time minu state constant mean µ covari ki set gaussian emiss probabl ps ks ing covari aj obtain maximum likelihood trajectori motion solv weight system linear tion ej yt ej endpoint obtain drop term equat dj dj dj aj bj cj dj yt yt fj gener inform occup matrix state sequenc solut ly system calcul time introduc improv set train data eqn solv set gaussian mean µ minim weight reconstruct data state sequenc factor rh eqn ly gm indic matrix built sequenc probabl state solut calcul ly enorm dimens precondit make problem lg tension perfectli fit train data gener larg amount set mean minimum squar error set
Agents/1481 1 java applic framework agent base system comput system engin royal melbourn institut technolog citi campu gpo box vic australia email abstract agent softwar distribut system agent base system develop person custom user interfac assist user fault toler distribut system solv complex problem open system compon compon continu ad migrat load balanc network solv disciplinari problem agent wide rang agent develop date independ develop team led includ duplic inabl satisfi industri strength requir secur incompat agent system applic framework chapter captur clarifi kei aspect agent base system reusabl industri strength agent design compon agent applic develop framework achiev agent agent develop framework inher compat cooper form agent societi java util implement languag support platform mobil introduct agent wide rang includ person user electron busi process agent develop date develop team led problem lack agent built team capabl duplic agent compon inabl satisfi industri strength agent integr exist softwar comput infrastructur address secur scale concern agent interact cooper develop effort result agent compat chapter describ product year implement agent system carri rmit effort concentr produc methodolog platform develop robust maintain agent system object orient softwar engin framework primari invari abstract agent base system identifi recur design pattern uncov brought result facet framework chapter rmit agent framework applic horizont framework agent gener softwar framework captur applic client domain agent framework evolv mean significantli modifi unforeseen chapter document framework design pattern due framework driven driven client custom class behavior problem domain rmit agent framework address issu list plagu agent base system date accomplish captur document detail definit agent flexibl encompass simpl sophist agent agent societi layer design java code implement agent base system softwar develop custom framework respect specif applic context design code industri strength agent address scale integr issu compat agent creat framework inher compat cooper form agent societi chapter outlin section present context agent system problem address framework understood section describ layer agent pattern underli architectur framework section includ sampl layer agent section describ design found intern individu layer detail section deal agent configur includ infrastructur integr layer section document term kei abstract design pattern pattern detail section illustr framework emploi sampl applic java kei interact diagram section summar framework agent base system weak agent strong addit mentalist notion adapt learn agent multiag system open combin activ behavior distinguish agent actor robot agent softwar distribut system exampl illustr kind problem agent address traffic control system countri abc suddenli due weather base traffic control system neighbor countri negoti deal affect potenti disastr situat pass incid log present list group sort order import base person digit assist assist draw attent articl work area discuss obtain technic report ftp site paper submit import confer pda make travel arrang rmit agent framework base model agent behavior strong agent reason select capabl achiev state plan capabl librari instanti trigger event instanti plan intent intent execut agent intent execut concurr agent negoti protocol agent societi central decentr manag strong agent collabor disciplin requir ontolog cross disciplinari semant exchang aspect agent behavior summar figur agent reason capabl librari agent knowledg base input sensor monitor extern object capabl chosen interpret manifest sampl intent shown intent involv effector object impact extern object intent featur collabor origin societi extern agent agent virtual order collabor sen je ec rs je od ls ti es te rp ter ig ati ti gen gen ey ag ent nt ponen read figur model agent behavior layer agent architectur pattern agent behavior organ structur softwar architectur support behavior agent layer agent architectur pattern support aspect agent behavior flexibl address simpl sophist agent system agent system span level abstract depend depend neighbor level interact featur inform flow softwar architectur encompass activ behavior agent interact sensor effect architectur address agent translat agent virtual actual central decentr collabor agent layer higher level behavior depend lower level level depend inform flow neighbor level layer identifi model agent real world figur structur figur layer agent gather sensori input environ agent model environ agent determin base model plan gener request servic request agent intent plan reason carri pend action agent deriv incom request accept collabor layer agent determin collabor agent includ accept reject incom request servic agent formul messag translat languag semant collabor agent layer requir messag figur top inform flow shown left agent belief base sensori input present agent reason belief determin agent decid carri directli action involv agent requir collabor layer agent decid negoti agent approach collabor actual messag formul translat layer collabor agent semant messag distant societi deliv mobil layer layer messag updat layer store agent updat belief sensor input layer process belief determin layer transport agent distant societi store reason plan layer store carri intent undertaken agent layer translat agent messag agent semant layer verifi direct outgo messag distant local agent mobil translat collabor action reason belief sensori layer gather regular sensor updat layer updat belief reason layer reason select action layer pend action layer bring messag distant agent societi layer translat incom messag layer determin incom messag process top bottom figur layer agent architectur pattern distant messag arriv mobil incom messag translat agent semant collabor layer store contact determin agent process messag messag pass action layer action dequeu pass reason layer depend type process continu belief sensori layer plan instanti intent action requir servic lower layer intent call higher layer involv agent task agent societi collabor translat mobil action reason belief sensori action reason belief sensori action reason belief sensori agent societi action reason bel sensori action reason bel sensori action reason bel sensori agent societi action reason bel sensori action reason bel sensori action reason bel sensori figur layer central collabor translat share mobil layer sampl sampl layer agent architectur pattern figur individu agent action societi agent share collabor layer manag deleg task handl collabor societi collabor layer call translat layer distant agent societi share common mobil layer belief reason layer framework sensori layer sensori layer agent proactiv environ updat kei abstract sensor cooper domain specif interfac class design sensori layer adapt pattern shown figur suppli abstract sensor interfac method applic develop user framework domain specif sensori layer list extern object plan sensor virtual void domainspecif interfac figur adapt pattern sensori layer belief layer belief layer store belief primit composit belief chang sensori input action reason layer notifi belief layer composit pattern primit composit belief treat uniformli observ pattern notifi reason relat belief updat role pattern belief layer shown figur composit belief void void primit belief belief void observ belief repositori figur composit observ pattern belief layer reason layer reason layer determin agent strong reason layer encompass mentalist notion emul human weak agent match action stimulu strong weak reason interpret belief request determin reaction reason defin object grammar defin abstract express plan interpret strategi pattern emploi figur agent plan repres express interpret interpret pattern figur gener involv logic termin symbol strategi pattern emploi plan object regular express belief element logic express express express figur interpret strategi pattern reason layer action layer overview kei abstract action layer carri plan select reason layer plan instanti separ thread call intent action layer handl collabor intent util interfac collabor layer reaction intent environ specif interfac effector provid schedul priorit schedul priorit action action layer framework consist command make plan command abstract factori creat plan object base class librari factori method creat intent thread object dynam decor implement priorit futur observ asynchron method invoc intent thread activ object schedul action affect environ command pattern intent encapsul request client queu log support oper motiv intent plan plan specifi primit action primit action oper execut directli effector collabor plan framework explicitli implement plan defin structur plan high level oper base primit plan intent thread reaction thread concret plan factori concret info librari creat read figur command abstract factori pattern action layer solut command pattern solv shown figur command object implement interfac declar high level oper receiv command object instanti runtim base configur inform provid user concret plan primit method method abstract factori intent provid interfac creat famili relat depend object concret class motiv framework concern provid abstract command interfac concret plan concern implement applic develop provid collect class plan separ class implement interfac plan instanti intent creation framework instanti plan reveal command interfac implement solut abstract factori pattern solv problem figur abstract interfac creat interfac object implement creat concret product librari store class instanti request plan object plan object intent thread factori method pattern intent defin interfac creat subclass decid class instanti factori method class defer instanti subclass motiv address reaction collabor intent type intent depend action plan type intent runtim class instanti object anticip type inform composit intent object subclass deleg instanti intent object respect subclass solut factori method pattern offer solut abstract class implement factori method creat declar interfac default definit factori method object depend subclass instanti defin virtual method class method class creat respect intent thread object subclass determin object instanti decor pattern intent attach addit object dynam decor provid flexibl altern subclass extend function motiv agent base prioriti handl execut priorit object object priorit order prioriti hand action intent critic intent thread execut normal prioriti suspend normal intent start suspend state critic intent execut concurr execut critic intent normal prioriti intent resum solut decor pattern shown figur pattern decor behaviour method action plan execut method declar runnabl interfac call thread start addit prioriti handl ad dynam decor class encapsul client messag class conform runnabl instanc class transpar place subclass control concret decor control forward request perform prioriti handl intent runnabl void thread control control execut normal thread run prioriti function post execut oper figur decor pattern action layer futur observ pattern intent futur object placehold result expect futur motiv action run thread return result directli void return type agent separ intent concurr commun asynchron result return server thread identifi mechan support asynchron commun complet mechan simul solut futur pattern instanc futur placehold futur client execut asynchron instanti futur object return refer client messag futur object block thread execut futur updat state concurr execut updat state futur object futur object observ observ client regist relat futur futur updat notifi observ notif execut updat method method block client thread resum futur client coexist server observ futur block restart block thread updat state call client updat block state updat futur figur futur pattern action layer framework combin activ object pattern adapt pattern intent activ object pattern decoupl method execut method invoc order simplifi access share resourc motiv agent intent act concurr thread control object environ affect impact agent sequenti manner intent invok method affect environ concurr execut method sequenti mechan queue dispatch requir convert concurr sequenti flow solut figur schedul form activ object method object method repres subclass inherit abstract superclass applic develop provid class encapsul includ method affect environ practic repres method class instanti runtim solut problem provid adapt pattern class user provid marshal method call method invok method object dispatch schedul void futur string object activ queue concret object object object void object concret plan figur activ object adapt action layer framework collabor layer framework collabor layer carri exchang servic negoti agent determin collabor address coordin protocol collabor layer handl reject repli central mediat pattern central collabor mediat manag intent mediat pattern agent freeli collabor agent direct knowledg exist motiv agent agent knowledg agent interconnect depend complic reduc reusabl solut mediat pattern made colleagu class categori mediat abstract mediat defin interfac commun concret class implement behavior requir coordin colleagu mediat multitud abstract concret level agent direct knowledg collabor decentr collabor overview kei abstract decentr collabor agent deal directli structur messag agent maintain state negoti avoid endless loop agent support agent interfac maintain knowledg agent interact decentr collabor complic section describ present state design decentr role individu agent client server agent pass request agent agent client agent server inform provid make counter request extra make client server negoti session uniqu identifi agent send messag protocol receiv messag convert collabor layer commun agent layer multithread activ collabor layer manag includ messag deliveri recept address connector collabor layer consist pattern singleton manag collabor thread decor behaviour thread dynam activ object schedul request forward action layer futur combin observ method invoc strategi convert messag languag destin agent synchron singleton pattern ensur instanc class group thread collabor layer singl access point thread order process messag state thread maintain task singl object duplic creation object type synchron singleton pattern solv problem sequenti program achiev make object singleton concurr program singleton pattern work thread execut simultan instanti object type creat solv lock achiev wrap constructor singleton method shown figur public static public static instanc return privat figur synchron singleton pattern collabor framework decor pattern collabor layer thread time send receiv messag dedic thread acceptor connector thread achiev requir behaviour primit thread class approach effici possibl send thread busi idl acceptor doesnt behaviour perform agent strategi pattern behavior ad dynam special collab thread command command decor connector command acceptor command decor public command command void void void void void void figur decor pattern decor pattern shown figur abstract command class method concret command actual process messag receiv agent method send messag agent method class concret decor method wrap execut method command class user framework add behaviour authent defin concret decor collabor interfac activ object futur intent thread forward messag collabor layer requir collabor interfac activ object messag forward collabor layer request repli acknowledg expect collabor interfac activ object modifi return futur object intent thread method invok return expect futur act placehold messag intent thread expect collab schedul activ vector collab interfac messag holder futur object object collabor figur design collabor interfac collabor interfac activ object collabor interfac figur carri activ forward messag includ pass messag determin agent servic request hashtabl creat messag obtain destin agent id perform hashtabl find protocol agent convert messag appropri creat forward messag translat forward messag translat object involv step depict figur collab concret strategi hashtabl creator creator hashtabl rep rep translat translat messag handler hashtabl manag handler handler figur design collabor interfac messag arriv readi idl thread messag handl situat chanc agent connect messag lost hold messag separ thread idl thread acceptor receiv messag agent check hashtabl check messag futur acceptor insert convert messag agent intern forward action layer forward messag connector thread thread insert vector hashtabl send messag destin agent object involv shown figur collabor layer hashtabl maintain provid common access point listen port agent societi inform servic provid agent hashtabl inform agent dialect hashtabl futur object session id server socket acceptor connector socket command decor command acceptor command connector command vector hashtabl hashtabl messag forward decor hashtabl hashtabl manag messag holder poll thread collab figur design messag handl mechan collabor layer mobil layer overview kei abstract mobil layer share agent agent societi support virtual migrat provid locat transpar collabor agent support actual migrat provid framework clone agent environ agent migrat physic societi societi clone agent gener societi clone sensor effector compat environ client proxi agent mobil layer agent remot configur agent societi actual migrat virtual migrat agent mobil layer client proxi remot configur agent societi agent broker inform repositori share mobil layer figur architectur mobil layer figur show architectur mobil layer design base corba mobil layer consist share region region belong individu agent made kei abstract client proxi marshal servic request messag act class loader proxi server lower provid locat transpar virtual migrat remot configur support actual migrat clone agent dynam runtim broker central object agent mobil client remot configur object regist broker broker bu transact inform repositori store inform regist object design mobil layer base design factori method pattern activ object pattern visitor pattern proxi pattern factori method pattern motiv agent request servic societi migrat physic type request behaviour requir type dynam creat handler object incom request framework extens servic requir abstract class handler special solut figur show design broker abstract class handler declar factori method interfac factori method concret definit factori method subclass select subclass client request instanti call object creat object broker agent repositori acceptor void void handler creator thread manag configur classload messag servic repositori societi repositori handler handler virtual void creat handler figur design broker activ object pattern motiv thread thread access object concurr provid access share object associ mutual lock mean class inherit servic repositori inherit mechan solut pattern defin client interfac access thread object interfac messag repositori interfac object method wrap call schedul turn instanti method enqueu instanti schedul pass refer encapsul specif method object defin repositori method command object defin wrap method call repositori stage method invoc method execut separ dispatch method dispatch schedul dequeu execut activ queue method object societi agent repositori creat schedul method figur activ object pattern visitor pattern intent repres oper perform element object structur visitor defin oper chang class element oper motiv actual agent clone destin societi configur detail plan librari belief configur detail format depend requir societi agent support kind configur access oper agent similar object structur creat framework repres configur access function separ agent agent support distinct unrel oper object structur solut figur show visitor pattern handler transfer visitor distant societi migrat agent mobil layer instanti visitor object visitor object pass call shown reason object turn call back visitor object visit method pass refer visitor object object structur layer agent visitor gather configur inform public interfac reason defin separ method transfer configur detail societi servic ad ad visitor chang agent structur layer virtual visitor virtual virtual reason belief broker figur design visitor mobil framework proxi pattern intent provid surrog placehold object control access motiv client proxi object act proxi server agent perform virtual migrat locat transpar server creat effect migrat client proxi act local repres remot agent societi solut proxi inherit defin method declar collabor interfac agent perform collabor servic connector connect broker request broker virtual migrat handl handler transpar client client proxi server object agent configur integr overview process creat agent consist creat layer integr creation framework requir instanti structur individu layer configur provid applic develop remain object structur creat configur independ configur independ object structur configur object structur defin gener structur decoupl structur dynam integr individu layer mean layer access neighbour layer interfac object interfac object gatewai respect layer agent configur integr kei abstract layer object implement interfac concret interfac object wrapper implement global public interfac decoupl configur object requir decoupl regist access cio configur integr configur creat cio regist integr object individu layer refer integr individu neighbour layer layer model agent design creat object structur individu layer integr shown figur design pattern defin interfac object builder pattern creat object structur layer configur cio concret integr configur configur layer figur model creat agent builder pattern intent separ construct complex object construct process creat configur virtual virtual virtual creator creator configur action configur reason configur reason configur reason interfac action effector interfac info cio effector user defin interfac creat creat creat figur builder pattern pattern mobil layer motiv agent creation process directli relat layer model agent creat includ creat individu layer integr isol creation process gener object structur configur provid user solut collect user configur detail pass creator object builder pattern creator director object store process creat agent instanti creator configur configur object builder object creat object structur base inform configur configur declar virtual method configur concret definit method provid layer specif subclass action layer object configur inform store object creat object structur layer configur creat object object form configur structur pattern simpl interfac decoupl object implement unifi interfac layer promot layer independ portabl configur regist configur repositori repositori object refer integr phase execut creator object framework sampl applic section present network manag agent framework network manag agent network manag server coexist object environ server handl manag inform host server host oper system depend agent belief model manag inform server inform request server issu affect environ give command server applic develop follow creat arrai configur creat arrai configur object arrai index conf point number layer architectur agent store sensori layer configur inform store configur detail belief arrai configur conf object creat step object framework build object structur individu layer integr initi configur action layer creat configur object action layer shown action layer configur class deriv configur superclass step manner implement effector interfac user interfac declar method effect environ describ effector type adapt simpl show type effector activ object note execut deriv adapt class deriv class execut object adapt pattern show public class extend adapt implement public actual public string string str marshal displai return public object object method call method return return end class public class implement privat public public string return write step implement interfac user provid list object object public class implement privat hashtabl public hashtabl kei field field class object note action plan separ class class public hashtabl interfac method return object defin user defin import import import public class implement privat action plan effector object defin method effect environ privat string bind public public interfac cio pass effector object form part object public void interfac method method set list bind action plan public void string bind execut interfac method command method framework execut intent thread public void string effector method displai string action snmp number store object sensori belief layer configur initi collabor layer configur collabor port number agent file provid agent listen nativ agent commun languag servic provid agent thread object type class inherit state depend cool state independ languag kqml note argument method classnam dynam load instanti runtim framework enforc datatyp check classnam pass plan librari type datatyp check implement user creat applic develop creat arrai configur translat layer implement creat final creat agent creator configur creator configur creat start agent configur note method configur agent object structur individu integr final start agent interact diagram figur provid interact diagram illustr framework virtual actual includ agent clone broker configur societi repositori messag refer start regist remot configur detail figur creat start handler migrat messag connector agent connect client connect instanti desir servic request repli repli instanti client connect figur perform virtual migrat messag classload connector client connect connect load byte remot configur connect client connect instanti class byte figur actual migrat connect visitor request byte instanti class class start figur remot configur visitor object creat agent summari framework framework chapter ambiti rmit agent framework consist substanti consid distinct framework framework present repres contribut agent system understand platform develop agent base system rmit framework area mobil anticip framework extend encompass object orient softwar engin techniqu special deleg area develop intern semant structur commun defin action interfac reason layer send action plan action layer refin work defin detail gener flexibl user commun semant action collabor layer reason action layer collabor agent collabor activ area respect conflict manag cooper mobil mobil migrat aspect agent requir make framework compat corba base mobil area actual migrat issu secur authent respect agent agent societi explor belief belief layer simpli collect belief object develop carri object orient repres belief translat work translat layer refer model concurr comput distribut system mit press ms languag describ coordin intern confer strength open distribut agent jm bradshaw softwar mit robust layer control system mobil ieee journal robot softwar system pattern wilei son design element reusabl softwar mp al reason sixth nation confer artifici intellig agent manag busi intern confer practic applic intellig agent multiag framework polymorph futur class function type concurr object orient journal object orient system mt ch methodolog develop agent base system ei ifip sig work confer model methodolog mt ch layer agent pattern languag program sept mt ch applic analysi agent base report object orient analysi design conjunct journal object orient mt ch system design base object orient report object orient analysi design conjunct journal object orient describ multiag coordin protocol submit tool artifici rg dc object behavior pattern concurr pattern languag dan program java john wilei base softwar develop prentic hall seri program tool ac encapsul light weight concurr tim lock object behavior pattern initi access object pattern languag integr applic distribut heterogen ieee commun vol jc tr lesson shade integr model intern cj editor mit press basic comput mj nr architectur workshop agent mj nr intellig agent workshop agent languag lectur note artifici ed jg carbonel
DB/1482 3 inform momi project demonstr beneventano bergamaschi castano vincini di modena reggio modena di milano di overview goal demonstr present main featur mediat global schema call momi environ multipl inform momi conceiv provid integr access heterogen inform store tradit file semistructur sourc demonstr base integr simpl sourc structur section integr project momi inform integr base conceptu inform function vial bologna permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb momi joint project di modena reggio di di nation research project theme inform coordin de di common data defin odl describ sourc schema integr odl defin momi subset standard mediat languag develop work group odl introduc constructor support semant integr translat metadata descript common odl mediat global schema builder queri manag modul process integr odl descript receiv wrapper deriv integr inform sourc qm modul perform queri process optim gener oql queri start global oql queri formul user global schema descript logic qm compon gener automat translat gener oql queri involv local sourc origin contribut momi relat oql subset eat datasourc address menlo park green park phone categori china chicken nearbi address specialti specialti categori spaghetti armi street italian mcdonald specialti categori john smith green street owner address big bar restaur restaur restaur restaur park avenu york street citi zipcod address fast food manag figur eat data sourc phone figur object pattern sourc ed avail set techniqu design face common problem integr inform semistructur structur data momi capabl explicitli introduc kind knowledg integr design suppli domain knowledg momi support inform integr autom perform valid kind knowledg integr momi combin reason capabl descript logic cluster exploit common ontolog sourc construct lexic knowledg wordnet valid integr knowledg demonstr run order illustr momi approach integr restaur guid involv datasourc collect inform restaur datasourc eat datasourc guidebook special figur food guid ture object restaur west coast inform fig illustr portion ed datasourc notat similar oem model notion object pattern repres level object describ concept semistructur sourc object pattern object semistructur sourc shown fig symbol denot object pattern inform inform peopl inform address restaur atom specialti restaur object atom address complex complex object nearest address job restaur owner datasourc food guid relat inform usa restaur fd fig inform relat restaur maintain relat instanc subset instanc inform small inform restaur serv wine manag person inform place drink serv store relat demonstr architectur global schema builder mediat compon process integr odl sourc descript receiv wrapper deriv integr global virtual schema gui data coordin modul set servic integr figur modul corba object interact establish idl interfac datasourc integr reachabl wrapper modul corba object simpl common figur demonstr architectur design perform integr process step suggest step graphic form figur form object idl interfac strictli retriev data save inform provid design common common ontolog sourc integr sim integr extract relationship basi sourc slim integr extract relationship attribut class exploit wordnet lexic system relat term automat select relationship predefin lexic system artemi tool environ terminolog relationship common thesauru assess level affin odl class interact comput set affin account ontolog structur knowledg odl class artemi classifi odl class affin level hierarch cluster tool base descript logic infer detect subsumpt perform odl schema valid evalu implicit isa relationship integr process subdivid phase common thesauru global virtual schema gener build global virtual sequenc interact ffl extract ffl extract relationship attribut class exploit wordnet lexic system interact extract relationship shown design confirm provid inform ffl comput affin coeffici odl evalu level match result perform check valid common thesauru common thesauru artemi tool invok perform cluster identifi cluster class affin threshold affin cluster odl class interact select artemi pass construct global virtual schema mediat integr global odl class interact defin select cluster exploit gener global odl class set global odl class defin constitut global virtual schema momi mediat pose queri sourc figur inform repositori act coordin object integr session object exist integr process object statu space complet model global virtual schema object constitut input queri manag object manag queri integr schema figur sourc bind interfac slim interfac refer vincini semant integr semistructur structur data sourc sigmod march cy knoblock retriev integr data multipl inform sourc intern journal intellig cooper inform mt roth dont scrap wrap wrapper architectur legaci data sourc proc int conf larg ullman mediat languag april wiener lorel queri languag semistructur data journal digit object exchang heterogen inform sourc proc ag miller lexic english commun castano de antonelli schema analysi reconcili tool environ heterogen ieee proc int engin applic artemi home sartori consist check complex object schemata integr constraint ieee transact knowledg data
DB/1483 3 relationlog system user manual mengchi liu shan depart comput scienc regina saskatchewan canada content content introduct instal relationlog platform step organ set start basic command start relationlog unix command show command histori load command creat destroi open close current displai quit relationlog data definit languag domain type schema definit rule view queri languag data manipul languag relationlog program program stratif system architectur troubleshoot syntax relationlog introduct introduct relationlog deduct system develop canada support natur scienc engin research council canada object relationlog system directli support storag infer data complex data support nest relat complex object model implement relationlog top system program turn persist deduct system support data complex valu perform nest relat store flat relat program control queri optim top exodu persist storag manag exodu good longer support work latest solari oper kind oper system develop system host provid reason debug environ difficult develop larg system relationlog implement final abandon persist object chosen persist object code reason perform small medium essenti relationlog research prototyp make suitabl implement origin code modifi includ meta inform definit index manag relationlog system develop sun sparcstat run solari line code languag point relationlog system declar queri languag base relationlog declar data manipul languag base power set construct repres manipul partial complet inform set implement featur relationlog ffl schema relat ffl persist domain relat rule ffl user friendli interfac ffl direct infer access valu nest complex object relat relat normal ffl data definit data manipul languag queri languag ffl meta inform manag system catalog track exist system introduct ffl effect combin evalu strategi base natur queri data user queri form mode ldl coral ffl fact rule queri evalu dynam select result temporarili store queri ffl rule queri evalu dynam rewritten base queri ffl data materi evalu dynam time queri ffl recent mechan remov data memori memori space relationlog system busi inform retriev industri tool teach academ research document introduc relationlog system exampl exampl part relationlog directori demo instal relationlog instal relationlog section describ instal relationlog system platform relationlog system version run hardwar oper system sun sparcstat solari sgi workstat irix sun version provid file sgi version provid file step creat root directori relationlog compress tar file directori copi relationlog file directori uncompress file command machin type download gz file uncompress machin type download file tar file command tar machin type instal relationlog organ unpack version demo relationlog organ bin directori relationlog relationlog execut doc directori import document relationlog system demo directori illustr exampl relationlog program set order run add path variabl invok relationlog command explicitli full relationlog root creat directori store relationlog set system environ variabl point directori relationlog system store system catalog file gener relationlog system directori creat directori point variabl access directori point make path set unix desir directori set variabl relationlog select current directori store file time enter directori time creat environ variabl set run relationlog put gener file current directori make current directori clutter access directori relationlog creat relationlog program chang current directori directori relationlog program dont instal relationlog set environ variabl sourc point directori relationlog program readi start relationlog system start start section start relationlog system introduc basic featur languag inform system relationlog program call person line comment domain fact rule comment relationlog program start scope program type part domain type definit schema part relat schema relat fact part tupl base relat rule part rule defin view domain type type part omit person tradit dig relationship true person famili tree repres tom pam john liz bob mari ann pat jim locat kei kei start kei kei order start type unix prompt messag relationlog prompt version depart comput regina canada type email start type relationlog prompt command set persist deduct system creat alter load unix command show command inform creat destroi open open close current displai definit program displai displai definit domain type displai displai definit relat displai schema displai relat displai schema displai schema definit relat displai fact displai rule displai displai creat creat domain creat domain type creat schema creat tabl creat view creat view rule separ return alter relat add alter relat alter relat modifi start command alter attribut relat drop drop drop view command drop relat view input queri evalu queri evalu queri form ei combin set tupl term li condit insert insert tupl partial set term element exist set delet delet tupl set element match queri pattern queri delet insert complex updat command updat involv delet insert delet relat delet fact relat load load command file list histori quit execut relationlog program person current directori directori point environ variabl type relationlog person relationlog system check person exist relationlog system relationlog system program file creat person open access relationlog system return error person system fail creat domain fact rule person relationlog start displai domain type type type displai schema relat relat person type maxim limit type type kei relat type maxim limit type kei relat type maxim limit type kei start relat type maxim limit type kei displai fact relat person start displai rule rule queri queri result quit relationlog quit exit relationlog run user manual locat paper start kei relationlog program user creat file consist relat fact rule start relationlog set file creat relationlog system relationlog program relationlog system creat relationlog relationlog creat relationlog program section basic command basic command introduc basic command relationlog start relationlog relationlog interact system start simpli type unix prompt relationlog command unix command execut unix command relationlog environ type execut unix prompt relationlog rm core file directori input show command histori relationlog facil show command previou enter relationlog interact environ show list command previou enter type histori open person queri queri queri repeat repeat nth command open person queri basic command queri queri command execut queri load command user put command command file relationlog load command load relationlog system select command execut command file current directori directori point environ variabl load load current directori complet path file command set program queri queri queri queri queri queri quit file current directori directori point environ variabl user load load open person queri queri queri queri basic command queri queri quit execut open execut seventh queri execut ninth exit suggest user creat command file store command put file directori point environ variabl creat creat call test command test test doesnt exist relationlog relationlog creat open access check program file test exist relationlog system creat program file creat empti creat relationlog binari file read user directli file format store tupl file format store tupl relat file format record indic file format record indic relat relationlog add meta inform relationlog system catalog file binari file schema rule creat basic command open relationlog variabl relationlog file store directori point store current directori creat user updat command delet modifi domain relat fact rule section detail creat inform test relationlog system fail creat creat inform person open creat current close destroi destroi test command test remov file creat relationlog system remov relationlog system file remov destroi inform test test open destroi inform test open destroi current close note command remov file wont remov program file basic command open open command open access open illustr happen open relationlog open person person creat open command make access person creat error messag check exist fail open open time dont close current open messag open open current close person updat updat updat inform automat store inform save program file note exist program file program current directori directori point environ variabl doesnt creat open program file type program unix prompt db exist relationlog open type db unix prompt close current simpl close current open type close close command close make open current destroi basic command displai relationlog facil show fact rule relationlog displai open command show domain type relat fact rule fact includ fact fact show creat displai command show domain type definit displai schema command show relat schema definit displai schema command show relat displai schema command show schema definit relat displai command show fact displai rule command show rule displai command show creat quit relationlog leav relationlog system quit user doesnt close enter close automat relationlog system mention directli creat program file relationlog languag command user manipul section introduc relationlog data definit languag data manipul languag queri languag data definit languag data definit languag data definit languag relationlog specif domain relat view rule similar sql data definit ingr user familiar dbmss system easili creat test relat rule person domain type primit domain type support charact string string alia string hyphen quotat charact maximum charact token alia integ integ integ integ integ alia byte real number byte real number float alia exampl accept unaccept valu primit domain type appendix type accept unaccept bob bob wife bob sam bob bob bob addit primit domain relationlog system support bag type defin primit domain type exampl type tupl type set type list type bag type type creat user creat domain creat type command note bag list type treat set type relationlog system notat data definit languag show defin domain type relationlog open test creat domain creat domain creat domain date creat domain incom creat domain creat domain locat creat domain paper note complex base relationlog circular type definit creat domain erson type delet drop domain drop type command command delet type drop domain type definit type relat delet type modif type relationlog system type definit alloc storag space relat data definit languag schema definit domain type defin relat schema relationlog system support kind base relat view base relat store persist disk view defin rule base base relat view schema kind relat defin explicitli creat relat creat tabl command show defin test relat schema person creat relat person locat kei creat relat kei creat relat kei creat relat confer kei creat relat journal kei creat relat public data definit languag integ kei tradit relat relationlog support definit kei kei defin atom attribut index mechan tightli integr creation delet tabl tabl creat indic creat drop relationlog manipul index mechan automat user handl mean relationlog system check schema definit creat index exist default gener attribut defin sequenc user explicitli defin attribut number kei relat user provid select default primari kei user enter end statement oracl newli creat relat empti user insert command discuss section load data base relat rule deriv data view note current implement relationlog support storag partial tupl partial set introduc set relat complet relationlog suitabl complex relat nest tupl set robot relat schema figur program file robot relat repres part real robot main id arm gripper gripper tupl attribut string id ion arm tupl type id ax ax tupl type tupl type kinemat ic dy dy attribut float mass accel kinemat ic set type dh matrix tupl type joint attribut integ max min dh matrix tupl integ type set float subset robot relat shown figur remov relat relationlog drop relat drop delet relat delet command delet inform drop relat delet tupl relat retain schema relat modifi schema relat relationlog delet modifi attribut relat user alter relat alter tabl command alter relat erson add alter relat erson drop alter relat erson modifi command add attribut type relat data definit languag creat relat robot id arm id ax kinemat ic matrix ector joint angl min dynam accel gripper id ion figur robot relat schema erson relat exist attribut defin oper fail relat tupl oper fail result exist tupl current implement relationlog attribut append end exist attribut erson relat command delet attribut relat schema erson attribut valu tupl command modifi type attribut parent relat erson list type oper fail attribut exist tupl relat violat type constraint rule view base deduct inform defin rule relationlog rule form similar bodi posit liter neg liter consist negat keyword posit arithmet data definit languag robot id arm gripper matrix joint figur robot relat comparison liter variabl constant head posit liter rule deduc attribut valu exist describ construct object obtain attribut valu rule mean variabl head bodi liter relationlog follow convent treat word start upper case letter variabl word start lower case letter constant variabl relationlog start anonym variabl word start upper case letter treat token type constant string set express version relationlog support arithmet arithmet comparison arithmet assign string comparison set comparison assign express relationlog version relationlog support arithmet arithmet comparison relationlog support string comparison relationlog support set comparison assign relationlog support data definit languag variabl operand exampl rol set comparison arithmet arithmet arithmet assign string set comparison note express end rule queri set express string arithmet express string arithmet express rule queri view defin rule base base relat view kind view relationlog materi materi view store persist disk base relat maintain current view evalu queri materi view creat command creat store view view creat command creat view unlik tradit relat languag relationlog support defin view command defin view materi view base base relat confer journal defin earlier test creat view creat view creat store view public num logic variabl parent command data definit languag variabl rang set parent person tupl term view definit call partial set term head group ancestor specif person set bodi denot element set match tupl partial set term head view definit group partial set term bodi rule denot tupl set match tupl command fail schema relat defin rule view definit respect relat schema note view ancestor defin relationlog requir rule stratifi stratif rule automat check time view creat stratifi rule discuss section relationlog directli support extend relat algebra oper relat schema nest relat figur program file algebra discuss show extend relat algebra oper function nest relat algebra oper repres directli rule note rule variabl denot tupl variabl repres atom valu nest set tupl materi view drop drop view command view view drop data definit languag figur nest relat defin extend relat algebra oper data definit languag command fail view view drop view view drop rule defin view delet view drop rule defin view deriv relat delet queri languag queri languag relationlog directli support datalog queri rule direct access infer deepli nest data provid power set partial set term form complet set term form fo tupl term form set tupl term attribut queri languag relationlog user directli queri base relat materi view queri command queri express queri sequenc posit negat object usual arithmet comparison liter posit liter queri organ relat em em combin set tupl term similar rule negat liter queri consist keyword posit liter arithmet comparison liter rule relationlog system give answer queri queri citi queri list parent person live regina current implement attribut valu tupl order anonym variabl tupl express omit base order abbrevi queri citi result queri base relat displai set bind ag parent citi ag parent citi show find sibl live citi queri locat tupl variabl rang nest tupl match tupl view relationlog queri base relat queri queri languag queri queri queri queri queri fact relat queri stand partial set parent bob parent jim person tom parent fourth queri find titl paper bob wrote queri find locat author wrote paper logic note view queri answer directli retriev data disk file relationlog system evalu relev rule proper strategi find answer queri result store temporarili queri longer activ displai result queri set bind user result previou queri queri relationlog queri repres rule bodi specifi queri head specifi format queri result queri queri tempor attribut implicitli deriv rule bodi explicitli declar user head handl output head relat declar result queri store tempor delet relat queri queri queri displai result base relat person nest relat queri displai result queri flat queri languag find relationlog command file directori environ variabl queri result load load open person queri queri queri queri queri queri quit result result queri languag result result result data manipul languag data manipul languag data manipul relationlog system involv data updat data updat user delet updat base relat elementari data manipul languag command insert insert delet updat liter liter rule section updat command tightli integr queri dml command handl complex updat queri delet insert queri posit liter posit liter insert note variabl previou queri liter command fail delet part omit updat command relationlog treat transact succe fail effect base updat express updat user insert fact delet part exist fact elementari complex dml command relat person shown figur popul insert insert insert insert insert insert insert insert insert insert tupl insert check respect schema definit tupl insert successfulli note attribut valu tupl order current relationlog system clear syntax mean appendix exampl show delet tupl person delet delet delet ag command delet tupl tom erson relat tupl oper fail command abbrevi anonym argument omit command delet person ag note command impli find person ag delet data manipul languag exampl show updat atom valu tupl relationlog relat delet insert queri delet insert command transfer person toronto vancouv command combin updat transfer sam parent canada note explicit queri command updat command complex updat perform relationlog complex queri updat command exampl show updat element delet insert queri insert command delet jim parent set tupl oper fail jim parent set command insert bob liz parent set oper insert bob parent set pam creat tupl tupl pam relat note complet attribut valu tupl kind insert thing dont attribut valu updat relationlog system declar semant straightforward extens semant present note complex updat command explicitli implicitli involv queri updat command perform relationlog step queri base instanti perform updat updat base relat result materi view result previou queri invalid relationlog delet result previou queri invalid updat materi view relationlog program relationlog program discuss order simplifi creation relationlog system user put inform creation relationlog consist fact rule type part domain type definit schema part relat schema relat fact part tupl base relat rule part rule defin view domain type type part omit run introduc section call relationlog program file program relationlog program mean liter rule relat relat satisfi schema definit fact program program schema fact rule rule respect schema fact program stratif rule relationlog program requir stratifi stratif automat determin depend graph mark graph construct set node consist predic schema edg rule head bodi edg mark negat relat express complet set term exist rule complet set head rule stratifi depend graph cycl mark edg program finit number predic static determin program stratifi person program section depend graph shown figur cycl mark edg mark edg label graph relationlog program famili program stratifi graph show rule divid view view consist stratum view lowest stratum evalu person stratum stratum figur depend graph person program relationlog program cycl program schema fact program stratifi mark edg cycl depend graph figur figur depend graph famili program system architectur system architectur relationlog system implement persist deduct system relationlog system architectur shown figur system organ layer layer user interfac textual user interfac primari commun medium user relationlog system accept process user command includ updat perform syntact analysi command pass valid command data manag queri subsystem reject displai result desir error user interfac buffer manag index manag persist main memori updat manag storag updat subsystem ddl manag dml manag queri manag data manag queri subsystem command result figur relationlog system architectur layer data manag queri subsystem consist ddl queri dml manag cooper tightli direct storag updat subsystem handl smaller task ddl manag process ddl maintain system catalog indic answer type check request dml queri manag check rule stratifi view creat view ddl manag drop materi relat rule view drop queri manag data retriev rule evalu data retriev relat materi simpli match indic find result data retriev fixpoint evalu rule order pipelin mechan find result troubleshoot dml manag perform updat relat updat impli dml manag request queri manag process queri perform updat relat request queri manag propag updat materi view depend updat relat layer storag updat subsystem consist main buffer index updat manag buffer manag deal updat relat relat indic rule main memori persist consist disk file index manag charg creation updat hash indic relat transpar interfac updat manag deal updat relat relat indic rule troubleshoot case power core directori point set type rm thing current directori refer refer data model queri languag exodu acm sigmod intern confer manag page liu type extens datalog set tupl intern logic program symposium page decemb mit press liu extend datalog updat submit liu type extens datalog set tupl journal logic liu shan design implement relationlog deduct system intern workshop expert system applic workshop august press sudarshan rule order fixpoint evalu logic program intern confer larg data page morgan kaufmann shan liu introduct relationlog system intl workshop deduct logic program june al steven develop syntax relationlog syntax relationlog rule schema schema relat schema relat schema domain type domain type domain type relat schema predic symbol type domain type type string type atom type set type tupl type atom type set type type tupl type predic symbol token fact fact fact fact predic symbol object individu partial set complet set tupl individu integ number real number charact string partial set object object gi complet set partial object partial object gg tupl object object partial object individu complet set partial object partial object rule rule rule rule rule head rule bodi rule head atom rule bodi liter liter liter atom atom atom predic symbol term term term variabl individu partial set term complet set term tupl term variabl capit letter letter partial set term term term complet set term partial term partial term tupl term term term partial term atom term complet set term partial term partial term queri liter liter
HCI/1484 4 model techniqu dialogu system virtual environ bw van faculti comput twent po box netherland march abstract text present result ongo aim develop framework develop multimod natur languag dialogu system oper virtual environ aspect multimod presenc virtual environ chosen main focu research argu speci cation techniqu form basi framework gener overview evalu exist speci cation techniqu interact base literatur previou research result includ process interactor agent system agent system subdivid intent product rule agent commun agent agent architectur agent system base updat noti cation mechan found interactor function found agent platform commun proce bu er channel agent manag number channel agent queri agent inform properti argu awar constantli chang virtual environ system illustr exampl agent system speci ed arbitrari languag argu languag base product rule natur choic content project descript natur interact framework develop natur interact current state research process commun model model discuss process algebra discuss model process algebra interactor data ow discuss agent intent logic product rule system task negoti scheme agent platform agent architectur agent commun languag standard discuss agent system prototyp discuss futur research develop guid overview api small design guidebook exampl refer project descript text result work phd student part en group van op den review part version text natur interact comput peopl attempt make interact comput system useabl learnabl attempt natur languag dialogu simpli call system dialogu system system understand mimick human linguist behaviour human interact learn interact rst gener framework build dialogu system includ methodolog framework design guidelin solut templat speci cation techniqu evalu techniqu jone clear framework dialogu design remain hard problem attempt dialogu system impli system rigid deal user utter limit domain nl knowledg dialogu manag remain hard problem gener theori provid gener solut exist develop dialogu system matter iter develop engin framework engin framework ensur qualiti point problem er solut practic develop framework requir gather extens data peopl argu improv made complementari inform channel displai graphic dialogu ectiv enabl control dialogu make easier manag human cue complement process lead improv lead idea multimod dialogu system virtual environ unlik regular dialogu system involv concurr dynam architectur dynam ve highli speci cation structur techniqu exist manag complex graphic user interfac basic form ve depict domain form manipul complex issu show exist complex manag techniqu develop gui dialogu gui design attempt provid interact mimick physic object system combin dialogu system obtain multimod natur graphic combin ve concept ve manipul multipl dialogu system physic presenc world current virtual music centr make multipl simultan user combin network ve user dialogu system gener framework develop framework develop natur interact goal research develop framework design interact pattern dialogu system chosen model multimod lot progress made framework speci cation techniqu speci cation languag languag de ned standard librari includ design solut softwar librari evalu techniqu includ evalu setup metric methodolog prescript develop kind speci cation evalu order start develop speci cation techniqu ve provid basic facil structur ve provid awar dialogu system situat extend exist speci cation techniqu speci cation techniqu obtain extend standard shorthand librari obtain exist framework gui dialogu experi subject futur research evalu techniqu methodolog de ned requir hci extens practic experi expect fall scope project speci cation techniqu consist speci cation languag languag mean explicitli leav aspect system speci problem speci cation techniqu speci cation languag part techniqu highli unambigu relat realiti languag ned languag de ned mean formal coupl predic call formal languag fundament di erenc speci cation languag program express program languag unambigu de ne comput behaviour level detail program languag consid high tractabl tractabl properti speci cation languag program function languag ly border cation languag languag express theoret describ domain languag limit make theoret imposs fulli describ system languag weak languag complement languag fact system express mean languag necessarili model form model cumbersom practic useless tractabl properti cover situat tractabl write larg formal speci cation make mistak hard detect actual test comput feedback extrem costli write larg comput program test prototyp abstract version program rst peopl troubl write small speci cation mean speci cation languag execut great advantag kind comput feedback simul user behaviour automat veri cation intern consist formal theorem autom syntax type check cognit tractabl highli readabl relev parti includ user design relev aspect problem obviou read reason speci cation techniqu provid meant di erent aspect stress import note softwar develop reli heavili extern speci cation memori aid develop expert develop note languag describ model speci cation languag pure speci cation larger system system thousand million make unread larg model tractabl gener model languag speci cation process algebra note properti similar found similar overview evalu emphasi hci speci cation softwar engin ai techniqu aspect properti treat cognit tractabl properti shown techniqu test larg great techniqu interact limit number gener approach identi ed greatest common denomin techniqu model system collect separ modul privat data explicit speci cation interact world list wai model softwar engin aspect ve proven dicult list give rst indic kind model issu list current practic issu develop identi ed inform observ strictli modular structur modul explicit limit interact modul make softwar develop gener cognit simpl reason modul meaningfulli examin isol mainten made easier knowledg model dialogu system ve requir knowledg object ve speci cation ve object modul make knowledg easier model formal abstract speci cation made exist directli knowledg dialogu system simpl list ve object locat enabl linguist refer made complex knowledg object behaviour behaviour enabl dialogu system track idea object interact speci wai concurr interact multipl agent oper structur ve highli concurr modular concurr problem manag level modul concurr process privat data modul enabl basic concurr data access problem manag easi agent track relev inform environ model modul interact make easier model chang noti cation multipl user distribut servic unavail multipl user connect disconnect time easi describ case modular exist avail servic client de ned level modul present absent model interact model easier modul identifi handl failur interact modul addit softwar engin explicit facil human factor issu model framework enabl commun di erent peopl typic involv ve develop gener human factor facil develop framework provid speci cation conceptu model user task model user proper conceptu task model highli compar describ languag provid framework dialogu system develop framework model user goal manner consid essenti determin system reaction user utter prototyp framework enabl prototyp built easili prototyp import feedback tool usabl engin evalu evalu log relev proper tool abstract properti number oper visibl relev dialogu system common practic collect user utter data rst prototyp built jone system modul zoom level model techniqu speci calli focu level micro perspect singl modul model techniqu meant model structur behaviour singl speci system multipl modul built macro perspect system speci cation languag provid overview system obviou data ow framework er guidelin structur standard set modul current state research research start literatur give gener overview eld dialogu design hci result studi publish technic report rst model languag predic logic notat process algebra csp csp turn interest describ dynam easili attempt complet coverag csp model workshop paper csp model web includ found csp high comput tractabl enabl intuit descript aspect limit facil data speci cation parallel process cumbersom nding detail section examin interact system model decid model techniqu overview exist approach includ review establish techniqu exampl process commun model model classi ed process interactor agent system agent system subdivid intent product rule agent commun agent agent architectur properti process commun framework review classi ed set featur commun protocol interfac compat updat reaction data depend knowledg base uniform knowledg model task negoti exibl architectur lookup servic open system rout migrat network commun commun protocol messag process send order basic main featur process algebra object model provid model provid mechan react propag ect chang occur process system relev process interactor data ow model provid agent system base mention import featur agent system kb typic store number rule set de ne behaviour agent kb di erent agent typic speci ed languag agent behaviour speci ed uniform agent exchang knowledg uniform agent model provid task negoti mean facil model task possibl includ task task incorpor plan mechan classic ai agent request task request negoti decid task achiev exibl account agent happen present failur model model possibl con task note exist task negoti model limit negoti strategi task qualiti task failur task structur agent lookup servic servic provid separ maintain knowledg agent system descript agent match properti featur system constantli vari number system migrat reloc program comput disturb execut rout pass messag comput network rout physic medium agent comput visibl practic network commun problem address model concept mechan found process algebra agent system found system view model commun oo model oldest date back consid model made oo develop popular conceptu view oo model commun abstract data found exampl smalltalk book cite point view close recent model section exampl smalltalk book typic exampl model instanc object consist number intern determin state number speci method depict speci paramet return oper intern variabl di erent object di erent method object class object method object refer object call method call method call method call messag pass subset method refer determin class object refer class class object hold refer class gener order classi cation class de ned inherit properti import method variabl class de ned term call subclass call class superclass class class de ne method de ning method class call abstract actual method lled subclass class model provid classi cation call class class object class object factori object method object class stand return refer arbitrari number object class creat call method class object extra method variabl manag object class object hold refer class object point execut method execut comput call execut thread thread run simultan di erent comput thread run insid exist refer object object run object delet object gener delet forc refer drop idea method call pass suggest abil object execut separ thread object object react immedi messag pass make sender wait nish uniqu de ne control ow model singl thread case multipl thread coupl speci object separ thread class multipl thread run insid singl object discuss oo model techniqu good speci cation techniqu gener remain open question comparison softwar built oo softwar built tradit program techniqu yield result problem point oo design invit modular mean di erent modul close coupl experi show understand behaviour typic object class dicult process appar requir understand class wai class control ow program hard locu control constantli jump object behaviour class depend superclass mean understand inherit class requir understand superclass optim inherit structur crucial depend natur problem domain domain inappropri choic made easili close coupl modul inherit result exibl program nal note origin smalltalk languag close integr gui fact provid rst gui descript model gui compon correspond send messag result user oper compon gui program librari arrang similar manner import contribut oo model model provid gui process algebra inform descript process algebra csp cc conceptu compar procedur program languag lead process algebra model commun section process algebra describ system number parallel commun channel identi ed process thread process creat process unlik oo automat creat thread process process ectiv delet dynam process form similar nite state automaton long total number state system remain system dynam behaviour veri ed main advantag process algebra commun process proce identi ed initi particip process signal readi speci set call commun determin process system csp sequenti commun symmetr order determin process channel set channel process particip execut start set call chang lifetim process process subset alphabet process channel alphabet commun channel proce cc commun commun asymmetr process reader writer commun proce channel reader writer process alphabet order determin system behaviour csp commun model atom particip particip simultan particip process submit process remain block case commun channel channel typic chosen randomli data pass conceptu di erent channel data pass channel model arrai obtain concaten origin channel data domain pass byte repres end string write data channel model request speci channel read request channel arrai reader subset forbid valu written possibl read fundament di erenc rang speci ed process limit constraint eventu chosen cc slightli di erent data model capabl writer write speci valu reader simpli read constraint er constraint reader read unlik reader read rang speci ed reader enabl constraint eventu written csp creat process order combin scheme creat channel process scheme found csp languag channel hide renam construct process set channel speci ed privat commun start process creator call channel hide process channel renam startup scheme commun structur system chang arbitrarili section altern model discuss mention section evalu csp speci cation languag dialect minim subset channel hide shorthand pass mean system speci ed xed number parallel state automata gener consid sucient advantag system model system architectur modul interfac speci explicitli task model csp task hierarchi natur express establish task model gom task model execut system model gener prototyp csp descript coupl implement make csp event trigger function translat user input event csp event prototyp gener illustr dynam aspect veri cation system dynam properti veri ed model check track bug formal identifi usabl problem limit requir write parallel state automata cumbersom problem identi csp speci cation behaviour complex agent state automaton larg remain abstract csp make speci cation smaller split agent process multipl process clear forc languag complex agent speci necessarili ensur process correct alphabet increment chang speci cation process turn ad temporarili comment process alphabet made signi part error made speci cation alphabet problem limit facil data model practic model pass complex data practic model process maintain lot data intern complementari notat includ data dynam separ aspect speci found loto facil veri cation data aspect limit abil model process arbitrari commun channel system dynam number process direct commun parent children cumbersom extra shorthand wai model commun address section central synchron commun model ineci distribut environ mean dynam system directli transcrib nal modi ed automat transform simpl solut prohibit commun model obtain common denomin found csp cc cc improv csp term cognit tractabl origin reason csp chosen cc csp descript map close logic constraint make easier describ addit extern constraint system ad extra make easier transcrib system logic speci cation note concept multipl constraint form speci cation written mean alphabet speci cation problem mention part fundament problem system speci ed argu separ alphabet speci cation kind similar type comput point program error ectiv unlik type process speci es wrong alphabet result di erent system clear deadlock situat kind clear error indic kind doubl check produc compil error mismatch alphabet speci cation action behaviour speci cation type check typic caller call format call reduc back caller speci cation alphabet check speci cation belong problem found write csp speci work csp system order model reader multipl writer scenario easi natur asymmetr model nal gener cc model closer tradit procedur program languag csp mean transfer program knowledg easier cc peopl ad process mean limit behaviour rest system term procedur process rest program action model process algebra clarifi correspond object model process model csp cc model er describ arbitrari address problem mention section model serv rst step formal account dynam model directli model privat commun process creator achiev add explicit notion pass kind refer privat channel data channel process receiv refer access channel refer scheme complet substitut channel hide scheme found extens cc simplist readili closer ident object channel pointer scheme adopt scheme found model mean process separ set uniqu number process channel process obtain process ident separ set channel model concaten similar process obtain separ set channel concaten ident channel commun obtain concaten method object analog method call method read written enabl possibl commun process impli separ channel pair process commun privat concaten mean refer process concaten channel origin process alphabet determin refer channel refer channel process channel csp system channel de ned concaten complet set method process ident id alphabet id id access alphabet alphabet process set access set method process access process spawn factori alphabet channel process class nish start potenti call call process exist long caller block process execut method privat solut make class factori block channel belong caller exist model ecient depend facil shorthand er model checker model checker examin power deal kind composit model remain sketchi cc version turn readili implement ad arbitrari commun easier worri requir set channel process enabl method call stand process call veri cation languag easili channel arrai construct er channel de ned chan arrai channel de ned chan readi write channel speci ed readi read speci ed type loop de ned od de ne chosen execut iter loop oper signifi sequenti execut action program start execut init process construct found program languag defin arrai channel maximum process system chan chan chan chan id handler channel process creator obtain id commun id handler chan chan byte endless handler wait process creator queri id process creat expect process read id od process byte process ident intern data process read id process set method order compli dynam method call return caller remain block finish unlik restrict tempor order constraint od startup procedur init byte refer process creat run start id handler creat id request process read id run caller call method state space remain model check exhaust state space smaller csp maximum set channel note process delet account id handler eventu run total number process remain limit hard id handler track exist privat boolean process signal delet exit note real garbag process automat harder add note semant constraint present model enforc process prohibit channel obtain valid refer rst refer model closer refer model real objectori constraint model data type limit assign variabl type model oo style thread separ process thread creat creat process method run return thread start call method process retain regular structur similar java thread scheme process algebra style concurr introduc simpli process deviat strict interactor data ow object model process algebra form basi describ interact interactor data ow model extra featur make chang propag interact system easier manag interactor basic special kind object exampl interactor model interactor store actual data model abstract object view modifi data made data object modifi interactor propag object structur restrict wai system noti cation data ow system relev ned propag scheme main di erenc respect regular model interactor provid standard facil de ning call structur di erent usual object call structur provid callback enabl object call method registr interest parti regist speci updat messag interactor restrict system dynam manag pac prescrib strictli hierarch structur establish interactor model provid standard form softwar librari vr speci cation languag vrml ow model conceptu close interactor model vrml world consist data node speci input output point event arriv input point trigger procedur insid chang node produc event output point basic case simpl data input point chang output point notifi node output point spontan gener timer event arbitrari rout connect input point output point speci ed mean rout long input data type match output point rout lead similar model found event event listen method analog vrml rout command sensor declar user click drag oper group node node physic conceptu arrang hierarchi sensor enabl detect oper sibl node hierarchi sensor sphere uenc overridden sensor situat model analog event propag advanc data ow model found gui develop kit amulet gui object number attribut speci attribut ad delet runtim attribut determin mean attribut formula determin formula speci ed term object attribut state vrml formula implicitli de ne rout object attribut attribut time updat arriv amulet group de ne system hierarchi object unlik amulet formula explicitli speci ed term hierarchi amulet illustr po po messag text header list messag id control node group id newsgroup list list po list po reset reset reset reset figur ow model netscap applic netscap built interactor approach window scrollbar control pan posit list window notifi select control react select reload content window root node sensor sensor sensor sensor set detect node figur vrml sensor detect scheme node speci es physic object script sensor node node arrang tree sensor node enabl click drag physic object sensor includ object tree sensor node overridden sensor node locat tree return return set set set set set set set set set rst statement de ne formula return integ rst return width height object owner return width height arc part attribut object owner rest statement de ne group object circl rectangl insid width height de ned de ned circl size group rectangl size circl group object size circl rectangl automat adapt size rectangl insid group arc part insid adapt size object size structur queri design compon amulet de ne standard interactor compon oper sibl object vrml oper owner event propag propag discard discard user event hierarchi window root window event store queue store queue propag event event figur event propag mechan hierarch window structur window root window call parent user gener locat speci window window subscrib speci type event event gener window subscrib store window event process process manag window window subscrib gener propag parent window discard event spontan gener event model special made system node oper parallel recent java node connect denot synchron area node connect sync node execut model event sync event synchron connect node node chosen subscrib speci type event discard type event node send asynchron messag sync node delai send deliveri arbitrari gure asynchron event synchron event sync node sync node figur event model gure show sync node node indic synchron area synchron messag sync send node time instant asynchron messag thick arbitrari delai discuss distinguish kind explicit implicit event node explicitli send event event stand creation chang variabl reaction receiv node arbitrari ect event speci ed lead notat depend de ned form alu valu implicitli gener event updat alu event gener result chang alu depend structur system diverg path node node uniqu race condit occur node receiv multipl updat result singl chang path uniqu node multipl path exist node graph cycl figur di erent propag graph structur node top spontan number time step event pass rout tempor order shown rst case data ow implement ordinari method call leftmost extra node shown spontan chang valu note spontan chang result propag structur distinguish kind explicit rout implicit rout addit usual explicit model provid hierarch structur mechan structur implicitli determin exist addit rout posit posit children typic rel posit parent event propag event sensor structur facil amulet gener model implicit facil node queri structur depend speci cation lead speci declar rout term properti node lai rout directli speci node interactor model give detail account dynam constraint model place system structur reliev dynam descript dynam classi ed ve type sender send data sender receiv buffer data transfer send sender buffer receiv buffer buffer asynchron receiv synchron send return process process receiv sender sender receiv receiv sync cast parallel serial send return send send return send send figur sequenc diagram di erent event pass mechan axi denot time vertic line denot node lifetim solid process readi receiv dot process readi horizont arrow denot arrow denot network commun solid commun dash commun data synchron synchron event handl sender wait event receiv receiv event arriv order synchron model basic model process algebra provid basic node handl event readi receiv event send output event immedi mean receiv readi receiv type sender wait readi bu er special case synchron commun commun bu er mean incom event store queue part receiv handl node eventu mean sender wait receiv reach readi state process algebra typic provid standard shorthand describ bu er commun asynchron asynchron model distribut commun case requir sender wait network typic store outgo event local event transfer eventu mean event arbitrari time event di erent sourc arriv order model found commun model constrain asynchron model model speci es event sourc arriv order practic part data network transfer lost order arriv data serial event handl propag arriv includ interactor java event listen amulet method call return model section instanc serial model send action sender forc wait return signal event handl complet relev process ensur event gener call concurr problem execut order serial prevent event arriv current handl complet parallel event gener handl simultan model model enabl possibl model resolv cyclic time updat handl subsequ updat ensur simultan handl data multipl object stai rel posit move unlik object process algebra interactor model facilit macro issu micro issu structur mvc pac provid structur design guidelin rout independ part speci declar separ object commun make data depend facilit data ow part system standard facil treat program data implicit rout scheme agent clari term di erent de nition classi cation agent system exist lectur classi cation typic de ne agent term social classi cation includ gener applic area softwar properti inform internet interfac agent argu import aspect agent concept metaphor design metaphor view modul possibl autonomi action exibl request handl er model robust softwar easi understand intuit ts neatli possibl er internet internet search electron perceiv group comput user comput expert user interfac autonom advantag metaphor mention literatur lectur idea complex commun protocol modul make design system coarser composit granular oo granular oo system prove ne section practic wrap legaci system insid agent hope call idea discuss argu paradigm creat describ modul term complex possibl vagu human modul behaviour clear simpl paper address electr load balanc problem approach complex issu problem system collect converg solut issu address control system theori problem made easier model approach plain control system theori complex move commun protocol data complex exampl agent commun prolog commun languag problem mind complex languag interpret prolog version engin prolog interpret fatal problem process messag languag approach directli execut code suppli program behaviour system consist modul commun send arbitrari code execut hard understand intern includ program freeli word type softwar modul process privat data explicit long metaphor ts spirit view give overli long de nition attempt de nition found literatur sucient nement concept interact system develop framework develop framework rest descript techniqu standard librari fundament di erent includ techniqu emerg focu recent interest agent concept intent logic varieti literatur discuss logic agent distinguish characterist languag avail construct describ intent product rule languag product rule languag special kind program conceptu close logic tradit method ai program meant se interact concept interact world show natur product rule base speci cation techniqu task negoti scheme softwar system incorpor task negoti scheme agent platform agent program focuss practic network commun typic provid softwar librari internet commun scheme rout locat agent agent architectur agent architectur model prescrib complex agent built smaller compon agent commun standard context agent agent commun languag attempt worldwid commun standard languag ect lot exist idea subject interact discuss detail intent logic intent logic gener logic framework describ agent mental state highlevel belief argu explicit model agent system framework de ne extra set oper top exist logic framework describ time event exampl bdi desir base tempor abil result base dynam logic oper bdi sheet hold hold hold believ hold privat goal achiev intend achiev believ intend achiev believ exist agent achiev assum privat goal doesnt privat discuss ideal situat agent complet rule simpler rule agent behaviour speci ed mean rule section easi write kind logic small expert make mistak problem meyer exampl ned intent framework popular agent commun standard form logic requir reason predic veri cation modal logic comput behaviour tractabl comput feedback tool remain theorem prover syntax checker relat express intent logic comput program point includ class logic enabl model knowledg knowledg agent enabl express speci intent logic light requir section speci cation languag question model languag model gener framework framework speci cation lled concret framework rst note peopl word refer bdi kind explicit model intent section product rule system basic product rule speci cation complement state automata speci order event explicitli state system number behaviour number rule condit express term action chang fact condit hold criterion product rule found expert system pressur normal abandon patient action note condit rule made rule trigger goal plan system action make condit perform fact chang unexpect possibl chang action initi action fact execut sequenc action mean system reaction fact split process state maintain part fact set product rule process state form pend goal note correspond interpret goal intent found intent complex model knowledg state model behaviour set sequenc goal long histori hci task softwar engin illustr complex formal hci task model languag move cursor move cursor rule de ne user delet word text editor rst rule de ne cursor top word case case rule de ne word cursor delet unlik structur program plain hierarch task model enabl arbitrari manipul goal state mean pattern match product rule system kind pattern match facil built found rst actual cursor posit match goal cursor posit illustr monkei object weight goal statu type object activ hold grab liter statement de ne tupl data type length number tupl exist type set tupl set fact system pattern match consist match speci fact test condit part rule match rule trigger valu eld match found action part rule speci es monkei pick goal pick object object locat pick goal mark sati ed pattern match view abil type queri condit part rule fact set fact form found sql type mean pattern match regular queri engin interact agent interact world model fact chang spontan model exist speci calli build system product rule interest desir desir hierarch composit agent turn agent agent connect xed channel disabl enabl system run agent rule set rule interact manag compon search xed setup number discret locat impass screen place absent fact updat inform mainten perform assert output compon illustr data constrain pattern match posit data type speci subset set fact data type part type speci ed separ activ naiv implement product rule system endless condit check system check condit iter case sleep event world occur fact system implicitli rule method rule edg queri subtl model gure condit chang subset rule altern usual type event trigger rule subset condit true result event immedi obviou activ condit form event condit action mean simplest event number condit procedur rule implement plain event handl loop plain event handl loop simplest type product rule system activ regular updat made directli rule speci ed consist regular updat translat updat condit action updat start condit action updat end condit action updat start denot updat updat end denot updat nish begin total order client order total stock begin total stock order total incom abort rst rule client order amount order stock case order ll amount stock rule veri stock order monei pai order client order result stock order paid abort discuss product rule system enabl descript complex successfulli ai applic complex behaviour speci ed rule system rule easili descript softwar mainten product rule base speci cation er complement process enabl complex part agent speci ed easili success histori show useabl peopl comput expert task negoti scheme provid gener model task negoti ambiti goal model exampl task negoti model describ model team format intent logic team form singl goal relat action address detail number potenti team member queri abil individu action initi convinc individu agent cooper goal mean work detail set agent determin collect achiev broadcast signal task alloc begin achiev goal decaf task hierarchi goal task eventu atom program written languag program input speci output data ow task action speci ed rout coupl output input action task model data ow node multipl output produc output input task speci ed sequenc subtask call atom subtask remain task recip data model world state action occur note similar global variabl properti atom exist determin global util function agent determin recip task achiev discuss task speci ed tempor order atom similar usual hierarch task model qualiti speci cation durat chanc semant atom action gener speci ed system issu manag scope ow data action address detail overview remain actual negoti part task negoti make model immatur agent platform agent platform agent oper provid librari make program easier dozen agent platform recent model open distribut dynam number perform lookup function lookup function gener perform separ agent call matchmak jatlit appar popular agent applic system ve layer agent layer bottom abstract describ abstract api speci provid commun concept messag bu agent commun modul provid method react receiv send messag base implement abstract layer tcp kqml basic support receiv messag messag speci ed kqml section detail descript kqml router rout messag queue separ rout agent call agent messag router email locat messag relai protocol api access exist internet layer locat kqml expect router jatlit wrapper standard internet servic task knowledg function provid kao kao agent exist environ call agent domain domain track exist agent domain proxi agent commun agent domain matchmak obtain agent capabl descript capabl speci ed commun protocol agent speci ed automata agent plai speci role protocol protocol part coher set call suit speci cation suit requir agent capabl particip speci agent discuss model typic agent platform found provid internet includ process migrat provid facil formal protocol speci cation agent lookup servic facil model physic domain rout mechan consid case prove deleg lower layer interest featur agent platform agent lookup servic agent lookup gener perform special type agent call broker facilit descript properti agent facilit model import mean obtain ident agent properti descript facilit assum protocol modul object class facilit conceptu close dynam unix ld java classload multipl facilit speci agent facilit stand speci context agent platform explicitli discret locat agent resid migrat similar autonom robot insid locat track agent locat model physic locat de ne conceptu context start screen displai window sound distribut environ assum distribut system gui user assum agent agent task window task window displai screen assign task gui gui agent access screen task made speci window speci user exibl option send request directli agent commun assum agent option restrict request speci user make user implicit agent physic context doubl address mixtur implement conceptu issu older version jatlit user bound speci physic uniqu de ne access gui physic context constrain action autonom robot system distinguish gui gui thing tradit system exibl conceptu good idea separ physic context layer manag physic issu context disjoint facilit global facilit local local facilit speci agent context overlap user screen request request context user screen class displai user context screen class local facilit local facilit figur facilit conceptu physic context gure illustr request gure displai window speci user speci type screen describ situat found agent physic context conceptu constraint user implicit describ illustr conceptu arbitrari physic context screen class implicit describ scheme agent di erent kind refer facilit gure refer type ve object agent physic presenc ve context visual user situat ve user interfac window user interact user screen simultan agent user dialogu object topic current physic relat view agent system agent facilit di erent kind stand di erent kind distinguish label refer facilit type basic facilit lookup scheme system straightforward manner gure agent architectur agent architectur provid standard librari composit guidelin build complex agent simpler macro aspect agent design simpler agent address speci aspect function complex reaction social maintain world model complex agent call hybrid agent overview agent architectur found section agent architectur interrap interrap agent local plan cooper plan layer layer agent speci capabl interrap includ softwar librari speci calli meant type agent architectur er part composit guidelin desir model section desir agent task agent interact mainten agent world interact mainten world process cooper manag discuss basic composit structur system similar layer found bottom layer split separ modul speci task gure agent chang found interrap interrap architectur detail workabl standard librari develop complex agent applic built agent commun languag standard kqml queri manipul acl foundat intellig physic attempt intern agent languag standard messag indic mean request messag messag type number valid type repli messag content section bodi messag speci ed format content languag ontolog sort speci ed protocol determin messag follow speci ed separ languag gener leav detail open exist notabl addit messag type inform messag bid sl auction messag type de ned bulk document languag describ number ned messag suggest frequent speci es formal requir messag type agent knowledg note semant remain ned speci es primit messag con messag built overview type classi cation partial kqml action negoti unlik type acl elabor kqml speci perform action action type action request acl action cfp call action accept perform action reject request request action action cancel request agent stop action failur inform action fail kqml achiev request action make content true unachiev request undo ect previou achiev knowledg inform give command directli manipul anoth knowledg simpli suppli inform note kqml perform state versu suggest agent knowledg base acl inform con rm rm kqml content sender knowledg base content found sender knowledg base deni negat content sender knowledg base insert insert content undo previou insert delet sentenc match queri delet sentenc match queri undo previou delet knowledg queri acl insid request question insid request question object descript truth speci proposit object descript kqml exist speci content variabl instanti content true variabl instanti content true error signal acl kqml error signal error previou messag signal agent understand unabl process previou messag automat noti request manag contin stream data kqml acl perform request updat agent knowledg acl er request action result knowledg inform kqml enabl queri result answer stream messag kqml er gener stream control perform acl request action condit true request action time condit true subscrib object subsequ object kqml subscrib updat perform messag instanti eo signal end stream messag standbi signal readi respond messag readi signal readi respond previou messag previou messag rest rest previou messag discard discard previou messag find agent speci agent call queri agent facilit enabl messag forward agent perform regist facilit unclear acl acl propag messag agent properti descript propag constraint agent assum exist agent messag propag proxi request send messag agent speci properti bug document kqml capabl agent capabl agent cancel regist regist addit inform facilit unregist cancel previou regist cancel made facilit announc chang address forward forward messag agent broadcast forward messag agent receiv messag agent receiv messag agent receiv agent respond messag agent respond messag make agent respond messag make agent respond messag respond discuss languag essenti gener messag syntax format syntax involv content left open set suggest messag type mean messag type ed agent platform support languag kqml popular retrospect remain unclear mean support messag trivial part languag facil messag sequenc protocol protocol speci ed suggest messag ed separ protocol eld standard necessarili gener lled standard includ suit messag type deal aspect section includ updat reaction agent lookup servic discuss interest distress note composit issu model larg toi scale full size show larg softwar system larg work nalli kind concurr problem necess handl kind complex commun protocol knowledg base turn granular agent system techniqu exampl classifi action capabl task negoti facilit hard action hierarchi structur good weak structur program respect data document maintain action speci intent task negoti acl er dialogu system ve rel immatur make applic question rst agent model base interactor model agent incorpor interest featur level speci cation languag develop part base product rule speci cation featur agent architectur incorpor top exist model agent system system attempt updat noti cation model encompass concept found exist model updat noti cation basic arguabl featur model main idea agent system system view data agent local awar similar interactor section facilit model section limit tree data interactor model gener case direct label graph agent queri graph structur rel posit graph agent valu queri agent unlik agent send messag directli arc connect refer oo model unlik oo commun proce symmetr parti initi commun arc call relat prototyp feasibl idea test build prototyp applic simpl implement dai quick feasibl stabl prototyp week complet extens implement adopt prototyp implement java remot method invoc provid distribut commun agent run standard web browser current architectur moment agent number properti involv number agent agent send messag relat model modi cation relat attribut relat attribut common construct model agent attribut make noti ed agent relat similar refer oo model oo process easi de ne protocol determin valu type sequenc protocol formal automata process algebra speci cation kind ternari relat relat model basic commun model chosen rst version bu er synchron provid process algebra practic process wait process handl number network improv perform signi cantli model emul bu er model agent privat control agent behaviour delet properti relat establish consent parti initi queri queri updat remain activ termin initi queri result automat noti ed gure view relat attempt establish relat kind queri mailbox action data rule properti relat privat queri result queri read figur architectur agent agent number public properti relat determin outgo commun privat part kind execut code privat make properti relat separ set rule determin behaviour speci ed privat part initi result collect messag agent relat server client request provid request provid agent id note syntax correspond java statement de ne regular queri graph structur queri paramet relat result set assum agent xg fig xg note relat valu queri parti complex queri provid futur version set join intersect term particip relat suggest parti capabl role distinct case altern written call call client term altern de ne queri establish paramet relat parti id parti start queri parti start relat parti receiv acknowledg messag queri receiv messag parti order request provid queri issu import agent request relat agent id request provid pass result queri noti cation chang properti relat immedi relev mailbox arriv order view parti obtain situat moment read mailbox date program queri assign arbitrari ident number number assign messag ad mailbox mailbox messag easili mean simpl construct current queri handl central accept chang time easi ensur inform remain consist updat messag queu order actual event happen distribut implement subject futur research server maintain exist relat valu properti practic advantag central comput run server run rmi registri client standard java facil small applic built gure small ve room agent talk easi multipl standard scheme implement easi move room agent queri room inhabit relat agent speak updat shape properti object room brain control action remain pick drag pick establish hold relat object automat posit holder point relat establish enabl agent track object agent point type user enabl object control user part sentenc relat theatr perform ai react user close easi multipl user multipl agent system discuss applic meant model work practic practic improv made observ section natur updat queri make amount data pass small queri channel mailbox implement modul knowledg server figur prototyp implement rst knowledg shown left public properti relat shown top knowledg server dash line partner relat dot arrow point channel correspond agent relat relat number queri bottom left shown bottom middl channel read agent shown messag arriv mailbox assign ident number shown channel knowledg server agent program shown program handl agent solid arrow commun knowledg server agent program po shape object po shape object control po shape locat control po shape hold instanceof instanceof simpl ve kind agent brain object posit shape repres object simpli visibl object enter room establish accept number relat object accept control relat brain send properti updat accept hold follow posit hold server shown top sketch code control object brain agent enter room object receiv posit shape inhabit individu noti ed agent posit pass agent model suit ve complic vrml load normal object make vrml descript noti ed bu er model ensur amount network call limit typic ve agent fetch messag updat displai multipl agent move receiv list time multipl singl updat turn perform overhead rmi call overhead network gener bu er model improv ecienc er model agent read mailbox abil block mailbox empti provid futur version chang larg rmi call chang properti scheme properti commit sing signi cantli network perform problem work put inform chang singl properti agent behaviour turn easi inform failur handl turn problem bug emerg speci cation agent actual interact remain expect interact ve complex model provid basic commun facilit function model highli agent program speci ed simpl program queri initi relat begin main loop consist sleep execut plan handl messag loop turn sucient agent applic messag mean ident number work readabl program structur neg aspect model place current java tape code separ list number channel separ list variabl track queri result send handl messag relat method case failur case messag type check rst unlik obtain refer establish relat requir request wait accept special macro languag automat gener code case develop limit limit queri rst applic extens found miss discuss extens mention set intersect union strictli perform separ queri individu perform oper abil ad set oper directli queri format ecienc issu limit set queri result agent room queri agent hold client turn bypass rule queri oneself absolut refer point agent set singl queri creat delet queri agent enter leav room introduc possibl di erent queri result run sync queri result set object agent room result hold coupl addit oper server result set set great improv option adopt exist engin support updat queri ecient simpl queri futur research attempt complet overview interact system model made overview meant document previou provid sucient model overview necessarili remain sketchi fragment possibl gap overview lled futur develop model shown work simpl ve warrant investig rst thing build larger order test feasibl model version ve applic develop incorpor origin vrml environ rest section describ aspect model develop agent speci cation languag argu provid standard macro program raw java languag structur similar speci cation languag plain procedur program languag agent program typic event handl rule type languag detail evalu process intent detail account product rule speci cation point document check agent program agent model complex dynam requir techniqu document check agent behaviour mention possibl protocol describ sequenc valu natur automata sequenc combin relat de ned agent speci ed kind relat combin sequenc intern behaviour descript agent complex mix product rule type speci cation java code part speci cation abstract depend practic experi nement model capabl setup model part determin implement extens mention queri extens di erent wai commun abil send messag directli cycl queri enabl agent kind agent accept relat relat order type similar object oo model gener speci queri speci ed access restrict relat properti reliev requir central knowledg server central knowledg server easi circumv concurr problem handl queri updat natur model agent maintain part knowledg local concept liter order ensur inform remain chang parti concern chang modi cation properti relat achiev agent awar agent observ inform creation relat mean parti transfer queri inform relat achiev commun exist relat possibl implement distribut model knowledg server di erent knowledg server commun inform cross border knowledg domain server requir inform time relax develop guid section rst attempt develop system interest practic develop guid consist api overview small guidebook overview api agent particip agent system deal special object class rmi object messag object agent channel identi er valu incorpor set set element addit attribut rst thing agent contact mean rmi lookup obtain ident mailbox agent agent registri void del delet agent mailbox mailbox agent agent lookup agent id agent obtain uniqu id agent agent obtain uniqu id agent mailbox messag arriv read agent mailbox channel ident channel ad mailbox channel separ type ident set messag receiv messag origin easili distinguish void add channel add channel futur messag mailbox void del delet channel mailbox close channel fetch messag mailbox properti relat knowledg access modi ed rmi object properti relat class method set queri return channel stand channel queri result messag pass note channel turn input enabl complex queri made channel input multipl add channel queri input mailbox channel channel test agent set speci cation properti obtain void object assert agent properti chang void assert agent properti channel channel de ne queri queri set agent serv agent suppli queri channel channel de ne queri queri set agent client agent suppli queri channel channel agent agent request set channel event relat develop relat monitor channel channel creat channel monitor request agent void void agent messag agent messag enabl parti relat send messag parti void void agent agent delet relat neat request delet request provid messag messag class incorpor inform pass channel list constant messag type eld speci ed messag int type messag type int channel type messag origin und ned messag read mailbox content messag actual content agent sender sender null state long timestamp set messag rst pass channel messag type type de ned prefer subclass messag class queri set messag type content set attribut set agent sati es queri messag moment queri set set agent ad origin queri result set agent delet origin queri result messag indic transit relat state relat sender eld set particip side warn parti queri relat accept parti accept relat parti abort relat abort miscellan messag type request queri messag type sender eld set agent channel close de ned type content lifecycl relat pair method lead state messag gener state diagram gure main establish note call point revert relat state nonexist small design guidebook model design preliminari design idea guidelin illustr note guidebook address macro speci cation techniqu develop implement agent softwar modul conceptu relat agent softwar modul gure agent program simpl wrapper commun privat softwar independ data structur insid softwar separ le le server separ window screen modul data view part agent user control agent view part agent modul handl agent agent system requir regular entiti model agent rest agent awar program handl larg data structur access uniform import larg model singl agent queri messag pass maintain view common practic model gui ve object separ modul coher group model agent screen agent repres displai maintain request provid provid request relat figur diagram graphic csp speci cation line text insid box circl denot state state order save space multipl action occur xed sequenc drawn singl save space messag repres underscor parti receiv type messag end intern variabl access repres underscor begin action relat del correspond method mailbox agent note transit main state trigger method intern variabl access messag occur relat return main state agent privat commun modul agent implement separ program modul agent agent handl singl program figur correspond implement modul agent graphic object privat commun screen good choic gui object observ singl user displai di erent depend relat object properti describ commun relat good choic object ve ve multipl autonom agent obviou choic model agent user separ object avatar user input output view avatar user view maintain avatar queri environ comput avatar possibl relat structur environ graphic model physic world maintain physic model physic constraint object model addit advantag semant readili useabl comput agent object top model top relat system similar model model scene manipul stack object model explicitli support relat agent pick object easili made client top relat bottom object top object easili made move object object accept depend shape spheric object model object top request exampl room border possibl separ room object insid attach avatar hold object highli complex physic relat agent handl separ constraint check send result agent concern room agent locat natur place hear rang checker approach similar vrml constraint program system constraint maintain send updat constraint send back correct command constraint violat semant inform strictli physic model graph structur user point object model point relat obviou advantag comput agent easili track user point behaviour point made observ object highlight point exampl manipul visibl model write access write access agent proce establish relat relat impli queri speci properti writer valu written commun relat depend agent valu model properti queri agent agent attempt write data concurr problem circumv agent establish write relat time starvat problem circumv agent break write relat text editor scrollbar similar found multipl user simultan edit text user edit made pan posit edit window user observ user awar locat figur show version system assum pan posit chang gui scrollbar button enabl save current posit restor save posit kind concurr user access document compon access pan posit noti ed write model updat relat read agent read written valu simpli queri open store result properti agent observ mean text increment updat scheme implement commun displai updat relat user observ mean queri arbitrari number user posit compon simpli document window arbitrari number displai posit server model uid anim multipl possibl run di erent anim concurr shape posit updat proce automat noti ed agent agent run frame rate anim agent run low frame rate interpol scheme detail inform interpol asynchron scheme contrast parallel scheme concurr anim asynchron scheme scrollbar po scrollbar po text document displai displai posit posit posit text po text po edit window usernam usernam updat updat edit window po jump button figur editor multipl text posit compon thick line updat relat dash line data ow result current relat structur accept object move advantag requir central problem occur anim agent interdepend block stack bottom block top move top block queri bottom posit lag make anim convinc scheme address problem er gure possibl make top block rel regular posit durat top relat block move rel posit chang independ relat observ revert regular posit possibl emul synchron model local sync node block sync node stabl observ determin updat receiv valid rel po block po po block sync sync po po po po sync node block block block block top posit delai wrt rel posit follow bottom posit bottom posit valid true figur posit block exampl conclud small sketch larger applic gure id titl bodi messag titl id bodi messag newsgroup id newsgroup id window height width anchor scrollbar scrollbar select select displai scrollbar scrollbar figur agenc similar netscap gure note resiz model system model standard gui compon easi model mail compon similar setup note window separ agent area window number relat explicitli posit relat posit size modi ed anchor compon middl speci es point window meet window speci ed rel anchor relat relat displai select determin content expect lead agent relat item pick properti item expect lead agent bodi properti actual model hierarchi server agent top agent handl wrapper actual server wrapper implement load item displai select relat establish user po shape plai plai plai plai po shape po shape po shape entranc main hall slide door po shape poster po shape select select po shape karin gui displai queri queri figur agenc gure show sketch agent model bottom structur music model web room agent connect determin physic area room navig view singl room size site arbitrarili client load part site locat distribut machin navig helper agent structur user rout speci place ideal case locat convex ve convincingli navig walk straight gate gate room ve agent inform board conceptu displai relat determin show karin maintain dialogu nearest maintain select relat latest queri result shown privat user displai hit user point inform board click select relat plai similar relat establish user point poster easi karin observ point click resolv linguist refer karin inform board queri relat return queri hit agent relat queri result refer refer role prior experi task characterist empir studi intern journal logic epistem action van der foundat applic collect agent base system logic approach build activ work repres reason action lectur note design interact speech rst idea user test springer verlag util base approach cooper agent van der foundat applic collect agent base system introduct iso speci cation languag loto comput network isdn analysi edit distribut reactiv machin technic report franc agent negoti load balanc electr intern confer distribut comput system page taxonomi evalu formal speci cation interact system peopl comput confer natur languag dialogu servic appoint schedul agent confer appli natur languag page architectur design gener softwar architectur model cscw chi annot vrml refer edit softwar agent environ construct system technic report mit ai usa program morgan kaufmann publish common base languag norwegian comput center ect inherit maintain empir studi intern confer softwar mainten strategi comput program peopl comput hci confer dialogu team formal approach van der foundat applic collect agent base system van speci cation techniqu multimod dialogu technic report centr telemat inform technolog combin csp technic report handbook standard resourc spoken languag system de berlin languag program languag inform structur psycholog program peopl page support formal reason system high integr formal model techniqu interact acta commun sequenti process prentic york design valid comput protocol prentic hall compar mvc pac architectur workshop formal aspect human comput interfac john agent framework sixth intern workshop agent languag simul social anim behaviour intern confer industri engin applic ai expert system volum page agent concept agent introduct part handout interact decemb inform broker agent appli architectur intellig websit part handout interact decemb dialogu manag natur languag interfac phd depart comput inform scienc modern system chang impact identi cation object orient softwar mainten intern confer softwar mainten intellig en part handout interact decemb calculu commun lectur note comput vol springer verlag tutori springer verlag design intellig layer approach springer verlag amulet model ectiv user interfac softwar develop ieee transact softwar speech dialogu facial multimod humancomput annual meet associ comput linguist usabl engin academ york embedd product rule languag journal intellig ieee decemb philip dialogu descript develop overhead sheet philip constraint describ object behaviour vrml interact agent workshop confer constraint describ behaviour virtual world design heurist distort distribut virtual environ rst intern virtual world confer evalu strategi select utter veri cation spoken natur languag dialog confer appli natur languag page mainten readi inter confer softwar mainten sparck evalu natur languag process analysi review springer verlag formal method human commun workshop formal aspect human comput interfac van de van der oper semant agent commun languag van der foundat applic collect agent base system van model interact virtual environ process algebra interact virtual world van build framework develop interact overview current research dialogu interact system technic report centr telemat inform technolog miscellan sheet interact system system part handout interact decemb framework evalu spoken dialogu agent annual meet associ comput linguist understand natur languag academ york veri semant agent commun languag intern confer system ieee press intellig chapter mit press methodolog analysi design agent intern confer autonom agent
AI/1485 2 express descript fact ian horrock medic informat group depart comput scienc manchest manchest uk abstract descript logic form famili formal close relat semant network distinguish characterist semant concept descript languag formal subsumpt relationship concept descript comput suitabl algorithm descript logic prove rang applic wider accept hinder limit express intract subsumpt algorithm paper address issu describ sound complet tableaux subsumpt test algorithm express descript logic spite logic worst case shown perform realist applic introduct descript logic form famili formal grown knowledg techniqu frame semant distinguish characterist formal defin semant enabl subsumpt relationship comput suitabl algorithm schmolz dl base knowledg system prove rang applic al guha lenat gobl al levi rousset wider accept hinder limit express patil macgregor intract subsumpt algorithm al al paper address issu sound complet reason discuss issu describ tableaux subsumpt test algorithm express dl spite logic worst case shown perform realist applic applic domain dl growth area ontolog construct mainten larg conceptu schema ontolog al horrock al rector horrock applic european aim promot share medic data build larg medic terminolog ontolog applic design flexibl extens classif schema al design studi outset project identifi express requir satisfi implement dl system abil reason transit causal composit relat role al import reason transit role long artal al identifi requir applic concern complex physic engin work present motiv desir provid complet empir tractabl algorithm dl express power requir kind applic logic develop extens alc dl smolka alc support concept descript standard logic existenti role simpl primit role augment alc transit close primit role role combin enabl hierarchi transit role fundament requir reason respect gener terminolog section featur requir applic rousset tableaux satisfi test algorithm proof sound extens algorithm support reason attribut highli implement algorithm form basi terminolog develop demonstr feasibl algorithm subsumpt reason realist applic transit role extens alc support form transit role includ lenzerini sl alc alc sl support role express transit transit reflex correspond proposit dynam logic satisfi problem alc alc dl support transit role provid gener transit closur investig hope restrict form transit role lead satisfi problem lower complex class alc augment alc transit close primit alc terminolog includ axiom form role set transit role terminolog algorithm decid satisfi alc concept express present proof sound complet demonstr complex alc satisfi problem alc al alc extend alc associ role transit orbit transit orbit role denot transit role subsum defin axiom interpret superset interpret transit closur complex alc satisfi problem shown alc support transit close primit role arbitrari role axiom form gener alc express dl support transit closur role form satisfi problem tableaux satisfi test algorithm simpler simpler detect cycl tableaux construct lead cycl detect involv compar set complic deal concept role express identifi role express problem simpler deal cycl algorithm cycl lead valid cyclic model differenti cycl lead valid cyclic model suffici express rang simplic satisfi test algorithm mean easi implement amen wide rang techniqu descript logic section tableaux algorithm test satisfi concept express proof sound complet present algorithm proof extens alc syntax semant dl obtain augment alc transit close primit role primit role introduct axiom terminolog consist finit set axiom form concept role set transit role concept express form cn cn concept concept express role standard tarski style model theoret semant interpret concept express justifi subsumpt infer al mean concept role interpret pair domain interpret function interpret function map concept cn subset role set valu function binari semant concept express deriv semant compon shown figur semant axiom figur simplifi descript syntax semant cn cn fd fd figur semant concept express syntax semant figur semant axiom relat defin terminolog fr axiom role iff axiom role axiom loss assum concept express negat normal negat appli concept terminolog concept axiom axiom form concept atom primit arbitrari concept express transform negat normal form combin law ident algorithm test satisfi wrt gener terminolog section tableaux algorithm prove satisfi concept express demonstr model interpret model repres tree node correspond individu node label set test satisfi set restrict subset closur subexpress defin atom primit concept fdg atom primit concept cn definit cn cn form fdg form uc tc fdg sound complet algorithm prove show concept model iff algorithm construct tableau concept iff exist definit set role occur tableau defin tripl set map individu set concept express subset map role occur set pair individu hold ti st ti ti lemma satisfi iff exist tableau tableau model defin cn fs cn concept cn denot transit closur induct structur concept shown defin concept form uc tc correct interpret directli definit semant concept express figur concept form correctli interpret concept form uc uc correctli interpret concept form tc tc correctli interpret concept form ti fd correctli interpret concept form correct interpret definit semant concept express ti ti ti exist path ti st properti definit properti definit fd correctli interpret definit individu model tableau defin fc remain demonstr tableau satisfi properti definit direct consequ semant concept express ei fi ei fi semant role axiom figur fi fi satisfi properti definit satisfi properti definit direct consequ semant role axiom figur construct tableau algorithm build tree node tree label set mark satisfi tree expand extend leaf node ad leaf node node clash concept call conjunct disjunct concept note edg tree label label role occur edg label ad expand concept mechan algorithm search altern edg label role ad expand term correspond relationship pair individu node call node edg yi label call consist node ancestor node path label edg note ancestor relat reflex node connect empti path algorithm tree singl node call root fdg expand repeatedli appli rule figur root node mark satisfi rule applic note condit rule prevent multipl applic rule concept block perform part algorithm construct tree root node mark return tree tableau trivial construct algorithm termin mark root node return unsatisfi sound complet lemma sound complet algorithm demonstr prove termin return satisfi iff exist tableau lemma tableau construct termin leaf fc fc leaf fc creat fc fc concept form leaf rx fcg fd sg sg ancestor rx creat creat rx node concept form successor mark satisfi mark satisfi mark satisfi mark satisfi figur tableaux rule node label subset node node appli time size limit appli time path appli time path ancestor st rx lemma exist tableau iff tableau construct return satisfi direct algorithm return tree construct tableaux algorithm tableau defin fx node mark satisfi yi successor ancestor rx role yi rg shown tableau root successor mark satisfi mark properti definit satisfi properti definit satisfi fc rx rx yi properti definit satisfi creat rx rx ancestor properti definit satisfi rg sx sx yi properti definit satisfi yi yi algorithm return shown induct height mark satisfi concept mark clash unsatisfi mark mark fc fc mark satisfi induct satisfi mark mark satisfi semant restrict concept express satisfi extend attribut extend limit support attribut give unlik nutt includ support attribut map concept form requir minor extens algorithm extend syntax axiom form role set function role attribut correct concept interpret satisfi addit condit singl valu partial dom tree construct algorithm extend deal attribut express form dealt express form requir special treatment extend rule treat attribut similar express label node lead creation node label edg group multipl express xs label creat singl label edg yi set attribut multipl express group model repres constrain multipl express attribut interact attribut role hierarchi mean express constrain individu attribut attribut attribut constrain attribut attribut constrain attribut node set attribut constrain denot fa constrain extend shown figur gener terminolog algorithm section test satisfi concept express wrt terminolog concept test satisfi wrt arbitrari terminolog restrict acycl concept achiev simpli unfold definit expand concept atom primit algorithm test satisfi concept express respect gener cycl gener concept axiom axiom form arbitrari concept express concept definit axiom form cn cn cn concept left hand side axiom concept definit acycl refer directli indirectli concept defin axiom form cn call primit defin axiom form cn call concept form leaf rx fcg fd sg sg ancestor rx creat creat rx ii ax fc sg iii ancestor ax creat iv creat ax figur extend axiom loss restrict attent procedur call test satisfi concept express respect terminolog arbitrari set fa bn work test satisfi concept express form special defin transit role subsum role occur properti ensur model construct tableaux individu satisfi satisfi assum descript fix point semant terminolog cycl easili dealt treat concept axiom al method highli ineffici reason introduc larg number disjunct costli terminolog cycl dealt effici manner lazi definit expand concept requir progress tableau al build tree lazi unfold ensur terminolog primit definit axiom cn node cn model repres cn axiom satisfi refer directli indirectli termin tree construct algorithm implement dl unabl deal terminolog cycl block mechan termin lazi unfold care definit axiom cn provid unfold primit primit interpret assign valu interpret primit interpret cn cn unfold primit model construct algorithm satisfi cn unsatisfi model empti test satisfi cn algorithm build tree repres model fxg cn fxg problem dealt check definit axiom cn unfold primit transform axiom primit definit cn cn axiom cn convert primit definit cn cn lead cn ad node unfold cn add clash fact system fact system terminolog classifi develop testb highli implement satisfi test evalu empir tractabl fact reason role attribut maintain concept hierarchi base subsumpt relat algorithm subsumpt test usual subsum iff satisfi correspond modal descript logic fact theorem prover proposit modal logic kt techniqu naiv implement algorithm limit realist classifi medic terminolog singl satisfi problem encount algorithm fail solv hour cpu time improv perform rang emploi ffl lexic encod concept techniqu hierarch structur terminolog logic lexic encod concept express concept express consist concept conjunct cn restrict express form transform express form cn transform form conjunct sort duplic elimin process identifi simplifi satisfi unsatisfi replac extrem case express simplifi tableau complet elimin encod process uniqu identifi lexic distinct concept express conjunct lazi unfold retent unfold facilit earli clash detect identifi negat occur node label al ffl techniqu elimin terminolog absorb primit concept definit axiom terminolog axiom elimin terminolog absorb axiom give absorpt add disjunct primit concept definit effici reason wrt requir disjunct ad label node absorpt restrict applic disjunct node requir ffl semant search techniqu adapt procedur commonli solv proposit satisfi problem al semant branch work select concept disjunct label node search fcg wast search avoid branch strictli disjoint fc fcg found ad possibl evalu unsatisfi fcg avoid similar techniqu modal alc satisfi test algorithm sebastiani ffl depend direct techniqu adapt constraint satisfi problem solv address problem thrash amount backtrack inher unsatisfi conceal label concept express depend set indic branch point depend clash depend set identifi recent branch point explor branch allevi clash algorithm jump back interven branch point explor altern branch similar techniqu harp theorem prover ffl cach partial techniqu advantag repetit structur satisfi problem gener terminolog classif cach partial tableaux demonstr satisfi satisfi concept express demonstr show tableaux join root node result valid tableau empir evalu perform fact system evalu varieti empir test procedur assess result test import note current system prototyp written common effici issu test perform cl sun sparcstat equip cach ram fact system test kb author home page demonstr feasibl fact realist classifi kb repres medic terminolog ontolog kb test extend part ongo fact classifi kb cpu perform total subsumpt test averag test fact perform contrast kri system hollund classifi small proport simplifi version kb cycl transit role hour cpu time fact perform modal logic theorem tabl compar fact crack al kri suit benchmark formula modal test class formula provabl form type exampl exponenti difficulti tabl show number largest formula system solv cpu time hardest problem solv fact significantli outperform case exhibit complet qualit perform formula figur system show exponenti solut time formula time fact larger formula fact time faster largest formula solv note formula prove demonstr unsatisfi negat tabl modal theorem prove fact crack kri test branch lin path ph poli cpu time problem size fact crack kri figur solut time formula discuss paper describ sound complet satisfi test algorithm express reason respect gener terminolog primit hierarchi transit role contrast theoret practic system implement algorithm fact system investig practic algorithm subsumpt result suggest spite logic intract algorithm provid accept perform realist applic fact shown perform proposit modal logic theorem detail result experi subject futur paper properti transit transit closur oper section made simpl implement techniqu investig tableaux satisfi test standard futur tableaux base dl implement encod absorpt perform dl subsumpt test integr encod classifi prefer order avoid overhead classifi concept gener encod process result obtain fact suggest express dl tableaux algorithm usabl realist work underwai produc implement algorithm acknowledg graham alan carol gobl richard support ulrik sattler made technic inspir due franz sean enrico peter ian roberto sebastiani invalu suggest feedback enrico franconi recent hospit itali work present carri work support engin physic scienc research access heterogen italian space agenc data european esprit long term research project refer editor princip knowledg intern confer morgan kaufmann san relat overview data knowledg baader augment concept languag transit closur altern terminolog cycl research report deutsch forschungszentrum fur kunstlich intelligenz gmbh ma editor reason structur knowledg meet workshop empir analysi optim techniqu terminolog system make kri move princip knowledg intern confer page san dfki terminolog knowledg terminolog logic technic memo deutsch forschungszentrum fur kunstlich intelligenz gmbh baader hollund terminolog knowledg system complet infer algorithm process declar intern workshop number lectur note artifici page baker intellig backtrack constraint satisfact theoret result phd moor wright classic prose enabl technolog knowledg base system technic page borgida descript logic util foundat descript logic technic report brunswick depart comput rutger implement test express descript preliminari report elli al page schaerf decid reason terminolog knowledg system journal artifici intellig loveland machin program theorem prove commun nutt complex concept languag research report deutsch forschungszentrum fur kunstlich intelligenz gmbh doyl patil knowledg languag taxonom util servic artifici gerard robert andrew veronica editor knowledg ag intern kruse de giacomo lenzerini tbox abox reason express descript logic aiello al page giunchiglia sebastiani procedur alc aiello al page bechhof describ classifi multimedia descript logic grail vol storag retriev imag video page san guha lenat enabl agent work commun empir analysi terminolog system artifici benchmark method proposit modal logic technic report hollund nutt subsumpt algorithm concept languag research report deutsch forschungszentrum fur kunstlich intelligenz gmbh horrock tableaux procedur descript logic phd gobl descript logic base schema classif medic data baader al page hor descript logic relat workshop part conceptu relat formal page appli dl automat dialog interpret collect paper intern descript logic workshop page levi rousset descript logic model reason view baader al page macgregor evolv technolog knowledg system princip semant explor chapter page ol scalabl express medic terminolog fall nebel reason hybrid system number lectur note artifici intellig nowlan structur method inform manag medic record phd theorem prover journal autom framework hierarchi terminolog logic princip knowledg fourth intern confer page san solomon grail concept model languag medic terminolog artifici intellig rector horrock experi build reusabl medic ontolog descript logic transit concept workshop ontolog aaai spring symposium aaai menlo goal concept project annual symposium comput applic medic care page washington sattler concept languag engin applic relat intern confer descript page sattler concept languag extend kind transit role deutsch ur number lectur note artifici page springer schild correspond theori terminolog preliminari report intern joint confer artifici intellig page smolka attribut concept descript complement artifici van van der mar runtim memori usag perform descript logic elli al page wood schmolz famili comput mathemat applic special issu artifici
IR/1486 5 open hypermedia lesli carr sean bechhof carol gobl wendi hall multimedia depart electron comput southampton uk keyword open link metadata word count abstract inform manag group depart comput scienc manchest oxford road manchest uk paper describ attempt project defin deploi conceptu open hypermedia servic consist ontolog reason servic repres sophist conceptu model document term open hypermedia link servic offer rang facil scalabl integr form conceptu hypermedia system enabl document link metadata describ content improv consist breadth link www document retriev time reader author time author creat concept metadata metadata data describ data enhanc librari catalogu schema canon exampl metadata fall broad catalogu artist structur pictur colour semant person hold joi metadata activ major focu interest www inform publish digit librari extens markup languag concern applic express data recent defin resourc descript framework aim rdf provid standard framework express statement data statement give inform version keyword inform attribut dublin core metadata link provid conceptu inform attribut web page import enabl search engin provid queri result pertin concept simpl keyword hypermedia system distribut link servic make inform provid rudimentari cluster document tag keyword retriev link document tag navig keyword effect classifi document cluster share set variat stem achiev kind associ requir web document link dimens base content construct link manual inconsist obfusc chief reason associ content similar conceptu hypermedia system hypertext structur behaviour term conceptu schema type document includ conceptu domain model describ document content inform hypertext repres explicitli metadata reason domain model classif structur classifi document share metadata deem similar author link document activ author concept link document link open hypermedia system link servic common usag web involv link document html web consid hypermedia system inher web infrastructur prevent hypertext link abstract document manag link open hypermedia system link class store manag separ multimedia document cach instrument research hypermedia commun increasingli web publish applic adopt open hypermedia approach dl power framework aid navig author address issu distribut inform manag intermediari model dl add link annot document deliv proxi origin www server ultim client browser number softwar modul opportun ad kind link creat navig overlai coher interfac set unlink resourc archiv address open citat project dl treat link creation resolut servic provid number link resolut engin resolv peopl bibliograph citat potenti link anchor heurist knowledg base link resolv hardwir monolith system chain sequenti document link ad previou resolv inher synchron arrang mean delai delai critic path document process tightli coupl distribut link resolut servic link resolv distribut multipl server decoupl deliveri document aim complex involv implement conceptu inferenc logic provid ad document author deliveri core document queri system ad portfolio link resolv provid consist navig link base concept content multimedia page unlink document parser ontolog link link servic servic gener request editori vocabulari knowledg request resourc instanc servic link document request hint metadata servic figur ontolog servic map natur languag term concept graph resourc servic obtain web page repres concept link gener ontolog term make link editori knowledg prune expand link ontolog semant link servic integr browser consist java applet monitor interact browser set javascript function manipul html dom compon link servic brought bear web page receiv longer form obstacl deliveri document set link page refresh ontolog servic java shown oper figur manag set concept relat schema ontolog form concept relat store xml queri result mediat simpl xml document type figur ontolog servic queri term concept relationship link gener modul link servic contact ontolog servic obtain complet list languag term repres concept ontolog term occur gener ontolog servic prefer prefer term map concept identifi concept string link gener contact resourc servic obtain list document instanc concept number destin identifi link anchor editori modul evalu number qualiti potenti link obtain gener number link consist format request broader narrow term ontolog servic order expand cull set anchor destin term document constructor add hypertext link present style behaviour figur show link ad document control panel figur link behaviour shown debug link expand document metadata servic independ servlet document decor languag term specif ontolog servic harvest specif tag document appli extern document independ effect declar rang process specif region content correspond term ontolog figur page figur link cloth figur term link correct number destin figur prune part link resolut process editori knowledg compon advantag implicit structur ontolog make inform kind link make select set list link usefulli reduc whilst broaden concept strategi number link altern approach concept predefin ontolog candid anchor creat link section list system concern manipul wai repres mode deploi meta tag tag author inform web resourc highli uncontrol tag unconstrain term varieti page special thing applic metadata tightli bound document order discov metadata examin document central metadata process web robot harvest cach metadata web resourc resourc figur simpl meta tag index duplic metadata easi access web issu mainten crucial difficult index date repositori index simpl gener ontolog list arbitrari keyword yellow page yellow page page classifi content taxonomi hierarchi subject area broken gener achiev classif hierarchi categor page manual page situat metadata store extern document real link classif web resourc resourc figur yellow page yellow page problem classif date autom approach gear support human locat resourc provid knowledg shoe simpl html ontolog extens develop parallel understand system group depart comput scienc maryland shoe mechan definit ontolog assert claim resourc respect ontolog assert web page includ page mark html base meta tag inform agent page shoe assert form instanc assert membership class relationship instanc web ontolog resourc resourc ontolog figur shoe queri engin shoe shown figur inform spread metadata attach explicitli document shoe html gather place robot queri browser user examin metadata situ reach shoe annot page ontobrok ontobrok system architectur similar wai shoe annot web page kb ontolog metadata express framework specif annot data queri ontobrok shoe share characterist annot document reli web crawler harvest store knowledg base kb queri ontolog schema queri form differ coupl aspect shoe ontolog extens mechan explicitli place ontolog web clear gain access ontobrok ontolog make link instanc markup ontolog appli ontolog describ content document multimedia repositori metadata construct author present fit user metadata index emphasi ontolog order structur result close relat ontolog produc structur rdf rdf descript differ system shoe ontobrok framework implement system system ontobrok rdf format compar rdf framework talk metadata rdf data model base idea relationship intent rdf metadata held separ document attribut separ metadata document rdf rdf document repositori access web resourc resourc rdf document figur rdf ontolog search engin figur show rdf descript work note rdf simpli number wai thing put rdf prescript ontolog specif rdf order minimum data set dublin core clear ontolog sit web rdf document form repositori collect metadata number resourc discuss system focu primarili metadata inform discoveri intend make metadata annot order build construct hypertext discuss issu relev issu discoveri versu author conclud describ space metadata applic base rich model system close system link associ resourc fix origin author tag html open system addit extra structur resourc document necessarili direct manipul amend origin proxi similar add link metadata resourc read approach metadata provid metadata resourc discoveri resourc annot metadata describ content user queri metadata order find present result open hypermedia concern resourc author process construct hypertext link ad metadata close world manner repositori metadata exist queri order discov find resourc discoveri close metadata thing resourc locat ad metadata framework resourc describ link resourc open metadata resourc figur show benefit ad metadata approach close metadata link resourc open metadata induc link resourc close discoveri open figur ad metadata discoveri author author resourc discoveri implicitli target link obtain metadata prototyp differ system support extra inform link exist web page note confin set web page link servic deal web long mechan metadata document involv match word term recognit explicit metadata resourc ontolog simpl richer model emploi stage project hypertext approach conceptu metadata web concern resourc discoveri user locat resourc inform web treat huge hypertext structur link resourc locat base content markup indic line link search blur gener resourc discoveri approach sit firmli search end spectrum contrast intend address problem construct hypertext build simpli provid resourc discoveri metadata annot discov author system agent locat resourc annot result simpli present rank list metadata index mechan link metadata author return notion link ad sourc document result metadata annot resourc determin metadata ascrib determin relev simpl index process retriev resourc index question approach involv insert metadata document repositori kind queri space metadata approach section focu issu metadata annot web resourc question metadata resid examin exist approach introduc space compar system term distribut addit materi notion express metadata figur attempt classifi metadata approach fit relat open open web internet cd filesystem dl platt altavista wai ontobrok keyword thesauri ontolog dl tambi dwq metadata author provis structur author descript space read richer queri figur metadata space dimens improv repres rich metadata move keyword ontolog final underli reason descript repres open distribut intent move simpl standalon file system distribut addit link final open hypermedia classif thesauru static hierarchi order index web resourc platt demonstr applic sit web open hypermedia point link gener runtim metadata model simpl keyword tambi system suppli access distribut inform sourc net descript logic model dwq wareh project descript logic approach problem improv schema integr distribut link servic keyword anchor ad link document dimens improv gain addit metadata structur shown figur metadata rich author provid descript turn enabl reader pose richer queri meet inform searcher addit structur author power jump open hypermedia architectur enabl link author provis metadata holi grail upper hand corner graph open hypermedia richli express model reason futur work ontolog structur space languag term consist keyword descript difficult creat subsequ lead model concept inaccur document interpret commun develop control base thesauru languag art architectur thesauru wordnet gener languag thesauru base semant net acm comput classif system base abstract hierarch classif scheme classif scheme hamper larg static unsound singl classif hierarchi resembl base systemat ontolog declar specif concept principl linguist term phrase rigor fix interpret attribut human interpret lack make hard queri check extend principl reason base terminolog resembl collect elementari concept assembl form complex composit concept sound effect terminolog repres knowledg scheme express support dynam automat classif complex composit concept base scheme descript logic convent frame semant network logic concept subsumpt satisfi reason servic offer dl flexibl construct evolv conceptu network retriev stage develop ontolog servic incorpor dl control updat mainten ontolog encount term web system conceptu model form link document explicitli navig classif scheme implicit issu present render visibl ontolog link queri construct inform navig impli inform user potenti link document share relat concept user search term control vocabulari control constraint visibl ontolog link queri construct issu investig final editori activ link servic strengthen concept document calcul link concept spread evenli document space ontolog space strategi link cull valid instanc effect kind action depend design construct conclud remark aim conceptu hypermedia servic escap limit pure lexic string match approach link discoveri prototyp success link construct softwar interact independ suit servic fact offer reason altern link candid select link unsuit reason demonstr advantag approach subsequ work improv user interfac link improv sophist ontolog process mainten descript logic acknowledg work support epsrc grant refer transpar access multipl bioinformat inform sourc intellig system molecular biologi canada pp place produc manipul web seventh www brisban support public art galleri collect intern confer workshop expert system applic dexa septemb uk classif base navig pictur archiv ifip confer data kluwer wd terminolog terminolog server inform environ proc ieee conf softwar technolog experi pd model retriev document index express sigir forum pd aid search acm link queri intern project de open inform comput network isdn elsevi de distribut link tool author world wide web journal oreilli associ comput classif system current statu futur mainten report cc updat comput jan conceptu navig world wide acm hypertext june acm san texa ontobrok research advanc technolog digit librari springer verlag lnc xml link languag version candid recommend juli integr link resolut servic queri open hypermedia workshop hall hill distribut hypermedia link ieee comput societi press creation hypertext link document measur retriev effect journal american societi inform fellbaum electron lexic mit isbn access inform sourc world confer www internet hawaii open hypermedia control metadata web intern world wide web confer browser proxi support open hypermedia structur mechan www eighth intern world wide web cope chang ontolog distribut aaai confer ontolog manag workshop aaai press knowledg languag internet applic dept comput maryland colleg technic report lagoz harnad develop servic open integr impact link acm confer digit librari concept base design data dwq acm intern confer manag data dalla usa resourc descript framework model syntax specif recommend hypertext engin approach wilei son structur type incorpor knowledg acm hypertext flag taxonomi open hypermedia acm hypertext introduct art architectur dublin core warwick review literatur march septemb automat construct manag larg open inform process navig automat link base semant close inform process manag
DB/1487 3 gener framework evolv schemata support enrico franconi fabio grandi mandreoli dept comput manchest uk di dip di informatica itali abstract paper semant approach speci cation manag evolv schemata introduc shown gener model schema version evolut semant schema chang oper de interest reason task base encod descript logic introduct problem schema evolut version context store data consid worth surviv schema wide accept terminolog support schema evolut permit modi cation schema loss extant support schema version queri data nabl version interfac sake schema evolut consid special case schema version current schema version retain schema di erent schemata identi ed select mean suitabl symbol label design system proper time valu elect choic tempor applic present discuss formal rst introduc speci cation manag schema version gener data model adopt data model common choic literatur schema schema version relat studi deepli approach base de nition extend model support evolv schemata adopt schema semant formul interest reason order support design manag evolv prove depend suitabl descript solv task de ned schema version main problem connect schema version support formal logic comput viewpoint practic applic approach enhanc function system support evolv schemata direct follow complex schema potenti addit classic schema chang primit taxonomi found approach enabl de nition complex articul schema techniqu consist check classi cation automat appli result schema de ne di erent notion relat exist legal global schema singl schema relat consist singl class consist schema classi cation task de ne includ discoveri implicit relationship class decid complex result mention task tool base descript logic solv task process schema transform formal check provid semant schema chang oper make reduc correct proof complex sequenc schema solvabl reason task semant approach address chang propag problem concern ect schema underli data instanc chang propag accomplish popul schema version result queri involv extant data connect previou schema version theoret point deal presenc object identi er correspond real conceptu object repres problem de nition queri carefulli design section review light previou approach object languag deal oid direct futur develop sketch paper survei current statu section rst introduc syntax semant model evolv formal de ne relev reason problem support design manag evolv schema comput complex section mention provabl correct encod model evolv schemata descript theoret practic result descript logic eld objectori model critic discuss approach relat work problem schema evolut schema version support di studi relat excel survei main issu concern introduct schema chang facil system involv solut fundament semant refer ect chang schema chang refer ect underli data instanc problem involv check mainten schema consist involv consist extant data modi ed schema eld relat main approach ensur consist pursu problem rst approach base adopt invari system base introduct axiom invari de ne consist de nite rule maintain invari sati ed schema chang invari rule strictli depend underli object refer speci model element sound complet set axiom infer dynam schema actual manag schema system oper approach gener captur behaviour di erent system comparison uni ed framework complianc primit schema axiom automat ensur schema explicit incorrect schema version gener solut implement real system simpl default mechan function de ned extant object updat complex schema consid sequenc schema chang primit make solv propag object problem simpl schema integr techniqu consist result check primit de ned set primit schema consist result schema ensur invari preserv elementari step constraint applic order consist preserv depend accur design schema reli skill data model evolv schemata section introduc gener model evolv schemata support taxonomi adopt schema rst formal introduc syntax semant schema support schema formul interest reason problem comput properti rst attempt formal de ne semant schema base semant underli data model singl schemata syntax semant model multipl schema version express version model introduc extend elabor relationship descript logic paper borrow notat languag embodi featur static part odmg account aspect relat de nition method end section suggest extend express data level schema languag class type level schema chang languag de nition evolv schema base set class attribut includ partial order set schema version initi schema version set class de nition class disjoint disjoint class de nition introduc condit type class standard case data model view de ned mean sucient condit symbol denot type express built union end record end cs denot option cardin constraint schema version de ned applic sequenc schema schema version schema chang taxonomi built combin model element subject chang elementari modi drop undergo paper basic set elementari schema chang oper includ standard found literatur dicult complet set oper respect construct data model end end end end end end end end end end framework support schema mechan de ning version coordin requir coordin refer distinct schema version emploi interfac queri extant data modi ed mean schema requir di erent schema version di erent version coordin omit de nition schema version coordin mechan simpli refer distinct schema version mean di erent subscript matter approach gener order identifi di erent version kind version dimens consid literatur emploi transact valid time symbol label provid suitabl map version coordin index valu de ned de nition evolv schema tupl sv ms cs nite set class nite set attribut sv initi schema includ class view de nition cs ms set modi cation ij denot pair version coordin cation nite sequenc elementari schema set ms induc partial order sv nite discret set schema version minim element sv sv schema version schema version sv repres outcom applic ij sv call elementari ij ms elementari modi schema version sv predecessor loss elementari evolv schemata introduc mean evolv schema semant assign schema version legal state legal instanc schema version conform constraint sequenc schema start initi schema version instanc tupl consist nite set object identi function give object identi sequenc version instanc schema version sv set valu de ned induct smallest set includ union valu valu set instanc nite set activ subset form union set valu assign version instanc consist total function cs give set object identi er extens class cs function interpret map type express set sati jg fk open semant record adopt order give semant inherit set constructor minimum maximum cardin explicitli speci assum legal instanc schema satisfi constraint class de nition initi schema version schema schema version de nition instanc schema legal end fo end fo end fo fo end fo fo end end end end fo end end tabl semant schema class de nition class disjoint sv hold fh view de nition disjoint sv hold fh schema chang ij version instanc satisfi equat schema chang type hand side tab reason problem semant de nition previou reason problem order support design manag evolv schema de nition reason schema evolv schema global consist admit legal schema version sv local consist evolv schema obtain reduc set modi cation linear sequenc schema ms led version sv sv admit legal instanc global reason problem refer local refer class class global inconsist legal instanc version sv extens class local inconsist version sv legal instanc extens disjoint class global disjoint legal instanc version sv extens class local disjoint version sv legal instanc extens class class global subsum class legal instanc version sv extens includ extens class local subsum class version sv legal instanc extens includ extens class class subsum viceversa note classic subtyp problem nding explicit partial order induc set type express extens special case class restrict attent view de nition chang propag fundament task address literatur sec dealt popul class version result queri previou version appli languag speci cation view de ned popul class version previou data requir queri languag express view provid mechan explicit creation object identi er approach includ singl data pool set version instanc thought view data pool updat schema augment problem origin logic schema augment data refer input data result appli view sourc data pool involv oid sourc requir oid creat associ sourc oid target target data pool retain section altern approach discuss point problem global consist evolv schema involv addit constraint de ned data instanc legal sati es constraint de nition constraint speci ed view schema involv schema chang semant express equat tab data incompat admit legal instanc introduct data view make reason problem de ned complex explain applic reason problem evolv schema describ compani schema includ initi schema version sv de ned class union worker worker secretari manag execut fig initi schema version uml notat class manag disjoint worker class secretari disjoint worker class worker senior record worker junior record worker class execut disjoint union junior end figur show induc initi schema sv note class pre xed slash repres view evolv schema includ set schema modi cation ms de ned manag manag secretari number integ string ect schema chang ij schema version sv produc notic sv junior senior class disjoint class instanc record type de ned union view class complementari respect record record instanc object belong senior junior secretari inconsist sv secretari manag extens includ manag extens empti version instanc secretari secretari local inconsist sv sv schema version sv inconsist secretari superclass disjoint intersect extens version instanc exist local inconsist respect sv global inconsist local consist wrt schema sv deriv execut local subsum subclass disjoint secretari worker secretari worker partit schema version sv exempli es case attribut inherit attribut ad manag class inherit execut class mean legal instanc instanc execut sv attribut type execut fo number restrict class relat multipl inherit gener inconsist elementari schema chang modi cation type attribut proviso type incompat semant elementari schema de ned tab base assumpt updat view coexist start context updat schema augment object object identi er notic lead inconsist version number string de ned disjoint class elementari chang refer object order schema chang involv restructur data creation object case chang type attribut incompat type sequenc speci data view data convert version delet class sv inconsist result schema version sv extens empti subclass continu exist constraint extens subset extens sv notic classic object model class hierarchi explicitli base delet class requir restructur dag rid dangl reason evolv schema section establish relationship model evolv schemata descript logic provid encod evolv schema knowledg base reason problem mention previou section reduc descript logic reason extens theori found ecient implement system exist encod ground fact correspond model knowledg base legal instanc evolv schema fi fi fi ng fi ng fig concept role express semant give introduct descript full basic type descript logic concept role concept descript gather common properti collect logic point view unari predic rang domain individu individu repres mean role interpret binari relat domain syntax rule left hand side figur de ne valid concept role express concept interpret set unari role set pair binari predic interpret pair consist set individu domain function interpret function map concept subset role subset equat hand side figur sati ed knowledg base nite set axiom form involv concept express write shortcut interpret sati es interpret includ interpret subsum interpret model knowledg base axiom sati ed sati check kb sati abil decid model knowledg base logic impli axiom sati ed model reason decid knowledg base sati abil logic proven problem encod schema knowledg base base rei cation type express explicit individu exist denot valu complex type introduc concept repres concept repres role model associ class role member type element set record repres individu connect mean role attribut ller attribut map function translat type express concept translat function ith schema class di erent schema version di erent map distinct concept de nition knowledg base evolv schema sv ms axiom basic class de nition class disjoint sv view de nition disjoint sv attribut schema modi cation ij ms axiom tab base result prove encod correspond model knowledg base legal instanc evolv schema semant correspond exploit correspond reason problem level evolv schemata reason problem level descript logic theorem evolv schema reason problem de ned previou section decid exptim pspace lower bound reason problem reduc sati abil problem descript logic note worst case complex pspace exptim impli bad practic comput behaviour real preliminari descript logic system fact show reason problem realist scenario evolv schemata solv ecient nal note high express descript logic construct captur extend version present extra cost respect comput target descript logic problem encod chang includ taxonom arbitrari boolean larg class integr constraint express mean depend point suggest end end end end end end end end end end tabl axiom induc schema axiom model schema freeli combin order transform schema combin de ned level introduc primit discuss paper introduc approach schema version consid schema chang schema sequenc schema version set de ned tabl elementari schema chang introduc constraint vocabulari augment class version updat schema ect introduct view level data popul class version data previou version approach view coexist base data pool data proper evolut object emphasi evolut schema complex case object maintain ident di erent version object evolv vari structur properti request overview evolut version case queri possibl conceptu schema requir answer object version case explicit treatment partial order schema version induc schema requir level semant partial order de ne sort lead evolv data tempor tempor extend conceptu data model di erent formal di erent schema object connect schema version assign data pool repres homogen state evolut formal time axi object belong di erent version mean object oid timestamp view express data express tempor queri queri languag oper schema translat schema data presum independ sourc data explicit map maintain queri tempor queri involv formul distinct timestamp case schema version tempor dimens interest deserv tempor version paper deal support schema evolut version introduc gener framework base semant approach reduc gener orient conceptu model framework made provid sound foundat state introduct adopt descript logic framework speci cation impli avail power servic queri consist prove decid refer abiteboul kanellaki object ident queri languag primit journal rst version alessandro artal enrico franconi schema integr tempor technic alessandro artal enrico franconi tempor er model descript logic proc intern confer conceptu model novemb korth semant implement schema evolut proc annual page san bergamaschi nebel automat build valid multipl inherit complex object schemata intern journal appli case correspond solut tempor schema version snapshot data taxonomi advanc principl chang schema object proc intl conf advanc inform system engin page diego giusepp de maurizio daniel nardi reason express descript logic robinson handbook autom reason diego maurizio daniel nardi descript logic conceptu data model jan chomicki logic inform page kluwer academ diego maurizio daniel nardi unifi formal journal arti cial intellig chang richard hull wit gener support updat proc acm sigact sigmod sigart symposium principl system de schema version relat inform schema evolut object system proc intl conf larg page septemb enrico fabio mandreoli semant approach schema evolut version proc sixth intern confer rule object grandi mandreoli odmg languag extens gener schema version support proc workshop conj novemb gener model framework schema version support proc australasian confer januari gregersen jensen tempor model survei ieee transact knowledg data tobi practic reason express descript logic intern confer logic program autom reason number lectur note arti cial page richard hull yoshikawa declar creation manipul object identi er proc vldb cli jajodia al consensu glossari tempor concept februari version tempor research page lnc propag mechan popul schema version proc intern confer data engin page april stein class modi cation gemston dbm proc intl conf program applic page decemb peter ozsu axiomat model dynam schema evolut system acm transact roddick survei schema version issu system inform softwar
ML/1488 6 gener principl system david wolpert nasa research center ca kevin wheeler nasa research center research ca tumer nasa research center research ca abstract problem design larg decentr system autom approach agent run reinforc learn algorithm convert problem automat reward function agent global goal achiev don agent global goal concern term artifici collect intellig refer system embodi solut problem paper present summari mathemat framework coin investig applic core concept framework comput show coin perform optim difficult variant arthur bar problem avoid common illustr optim perform coin problem introduct paper interest comput problem ffl agent run reinforc learn ffl central commun ffl provid world util function rate histori full system exampl promin design control system constel commun satellit constel planetari explor vehicl util case measur qualiti scientif data ii design control system rout commun network util aggreg qualiti servic intern confer autonom pp iii construct parallel algorithm solv numer optim problem optim problem constitut world iv control distribut chemic plant kind problem readili address larg system agent restrict commun agent run reinforc learn algorithm crucial problem ensur agent rl algorithm collect behavior maxim provid global util function difficulti achiev system central dynam govern collect effect individu agent modifi behavior rl algorithm interest system agent extern structur forc agent reward function system structur automat set updat machin facilit achiev global object ma altern approach potenti labori model entir global perform scale larg maxim exploit power machin learn term collect intellig refer mass design case natur occur mass investig perspect coin framework relat field detail discuss involv hundr ffl ffl comput ffl reinforc learn adapt ffl statist ffl comput ffl game theori evolutionari game theori previou mass similar coin includ agent reinforc learn agent activ attempt model behavior agent paper introduc concept coin present experi test concept restrict version framework present suffici formal optim global perform system experi design empir investig concept illustr domain section present gener background coin experi conduct section present portion coin framework investig paper section describ bar approach deal pitfal encount motiv background natur occur system view coin human economi agent individu maxim person reward declar world util time averag gross domest product se construct intern human defin achiev high global util avoid agent work phenomena common individu work lower global util avoid phenomena modifi agent util function legisl real world attempt make modif regul design prevent practic design coin freedom regul local util function incent entir individu agent design coin freedom major strength coin obviat form central compon convent econom recent investig coin approach distribut control network packet rout convent approach packet rout router run shortest path algorithm router rout packet expect packet destin quickli unlik rout router concern rout global goal concern induc ran simul demonstr rout system throughput system paper present investig coin major compon methodolog examin separ set experi investig initi coin initi agent local reward ensur agent work cross problem chose challeng variant arthur bar attend problem agent determin night week attend bar problem set peopl attend peopl attend total drop goal design reward function total night maxim problem similar number problem electron agent select market trade set experi investig runtim modif agent util function interag interact improv perform initi coin set experi chose problem agent mimic activ agent idea investig scenario action benefici agent global effect copi agent coin framework appli coin framework main compon investig formal local util function world util implicitli defin class local util function meet agent interact type ii explicit concern dynam natur coin compon dynam subsum assumpt agent achiev larg valu local util rl learn due dynam agent inadvert achiev larg valu local util function compon coin framework address problem mean restrict set local util function call design system local util function compon coin framework coin initi system iii success coin initi ensur agent system achiev larg valu local util world util larg due uncertainti type agent real world local util function set coin initi good guess compon coin framework address issu modifi local util function base local statist inform call modifi process call reinforc learn agent perform optim local reward paper state system set consecut time loss relev characterist agent time includ intern paramet time extern visibl action encapsul euclidean vector call agent time state agent time world function state agent time goal coin design maxim world util concept definit form core coin set make exhaust partit agent agent util function local util function set agent collect effect agent work agent affect substanti share local util concept system system chang state agent time effect state agent time system agent separ affect hold real world system rare system consid chang time state agent result result side effect rest system util end world util separ agent successfulli pursu separ goal frustrat world util concern definit carefulli craft concern util chang state concern state agent chang time entir system improv util simultan improv world util appeal altern construct exampl system obei properti quickli evolv minimum world util case proven agent reinforc learn algorithm perform world util critic point correct global behavior correspond learner reach nash equilibrium common system life defin vector modifi state agent arbitrari fix life util system affect rest view wl util analog chang world util arisen util cf frank note cl pure mathemat oper assumpt made consist dynam system success state agent definit wl util obei dynam law system crucial strength wl util mean evalu wl util infer system evolv agent set time system evolv long extend long wl util true dynam system crucial advantag wl util fact oper larg system experi difficulti discern effect action util problem obviat wl subtract term wl util remov activ agent leav underli agent hand affect util make easier improv util agent system properti facilit improv world util cancel characterist wl ensur util function obei applic priori local restrict commun agent experi paper revolv system life util combin system nash equilibria previou result system equilibrium critic point world result lead expect system wl util approach valu world util assur accru wl util system set experi investig system perform wl util attent paid ensur system set experi focu algorithm modifi membership wl local util function bar problem method conduct set experi investig coin framework set variant brian arthur model interest directli compar result convent arguabl reinforc learn algorithm investig pick night attend bar process repeat agent reinforc learn algorithm decid night attend maxim util world util fl mean jth compon attend night week fl ff exp fff paramet world util sum world night week chosen reflect effect bar attend profil agent case bar suffer lack activ world util low agent bar reward low note fl reach maximum argument equal ff weight import night choic fff investig treat attend night ff concern attend night ff chosen significantli larger number agent agent attend bar result agent explic algorithm work provid signal agent week agent reward function surrog util function agent differ function reward function reflect state system moment time potenti util function reflect agent ultim depend full histori agent time investig function reward time ffl uniform fl ffl global fl ffl life fl fl fl fl night select note distinct util reward world util sum time global reward ud reward consid natur choic agent reward total reward night uniformli divid agent attend night provid gr reward time agent consid reason provid agent approxim world util ensu current polici agent henceforth frozen current polic reward function result agent receiv feedback inform system automat evalu function requir central commun wl reward time consid reason approxim wl util contrast gr evalu wl reward agent total attend night attend expect wl reward readili discern effect reward util necessarili true gr reward agent agent algorithm euclidean vector repres expect reward night week end compon vector night attend adjust actual reward receiv begin agent pick night attend boltzmann distribut energi compon vector expect reward decai temperatur aid explor earli stage process algorithm set paramet learn boltzmann decai reward function learn algorithm clau boutili independ learner algorithm reinforc learn result figur present world reward valu function time bar averag separ run note world util sum time world reward present perform reward function ff ff system wl reward converg optim perform bar problem suffici interact diminish perform true interact occur wl reward easier exploit expect converg wl reward quicker gr reward gr reward eventu converg global optimum agreement result obtain crite bank elev control problem ff gr reward converg week time converg time wl reward ff gr reward week time time wl reward converg slow converg result reward signal larg number agent system contrast behavior reward function base coin ud reward function result poor world reward valu deterior progress case world reward depend singl essenti instanc agent interest attend shrink world reward averag perform week averag perform week figur averag perform ff ff top curv middl bottom ud vide agent experi demonstr initi prescript coin framework result excel global perform problem method experi previou section system suffici wl reward result optim perform set experi involv leader follow wl reward experi investig make initi system improv world util consist chang membership agent experi bar problem modifi incorpor constraint design frustrat wl reward forc night pick agent pick agent leader follow world util valu reward matrix indic night leader follow night leader night attend follow leader week system dynam restrict member tripl equal night pick leader week defin defin dynam tripl oper rs exist membership dynam assur poor world util wl reward type problem design correct investig efficaci set separ experi conduct reward matrix chosen leader follow agent separ leader maxim wl reward result minim world reward contrast bar problem due coupl leader agent badli violat idea chang membership correct induc set reward investig efficaci broader spectrum reward matric gener randomli reward membership result system leader follow belong occur leader follow separ addit case investig random membership investig case worst case full spectrum random reward matric experi bar problem experi wl reward implement run number week work estim correl night pick agent examin attend agent week agent estim correl group restrict number agent result figur present perform averag run world reward function week worst case reward matrix comparison top curv repres case leader follow perfect bottom curv repres extrem leader follow result minim middl curv show perform averag perform week averag perform week figur problem worst case reward matrix plot top curv repres perfect bottom curv repres minim middl curv repres random week averag perform week averag perform week figur problem full spectrum reward matric order plot figur appli plot randomli initi perform randomli assign differ slightli agent start poor valu world reward deterior time perform system initi random system quickli rectifi converg optim perform reflect sudden vertic jump middl plot point membership demonstr chang membership result perfect wl reward function quickli induc maxim world reward figur present perform averag run world reward function week spectrum reward matric select random order plot figur appli plot simul figur lengthen figur converg time longer algorithm result transient degrad perform week converg optim system perform longer vari week combin result present figur experi demonstr coin construct work mass fulfil full larg system strong limit interact automat system achiev provid global goal approach problem agent run reinforc learn algorithm configur reward function agent facilit achiev global goal central concept embodi coin paper present summari portion mathemat framework coin present set experi empir valid predict framework set experi sider difficult variant arthur famou el bar problem experi show condit requir theorem initi coin hold hold appli confid coin quickli achiev optim perform local natur inform coin automat avoid common design experi true reward function set manner set equal global reward set experi consid problem maxim difficulti coin initi theorem experi explicitli test updat procedur coin framework overcom initi problem initi perform coin poor updat procedur brought perform quickli rose optim contrast case reward function set manner set equal global reward experi prescript coin framework configur larg ma appli exact condit requir theorem hold unusu circumst initi prescript coin theorem result optim global updat compon framework rectifi optim perform achiev author ann duncan jeremi frank discuss refer arthur complex econom induct reason bound ration american econom baum manifesto evolutionari econom intellig neural network machin learn berg engel matrix mix statist mechan preprint wellman econom principl system artifici intellig editor softwar agent mit zhang prototyp model stock exchang zhang emerg cooper organ evolutionari game physica clau boutili dynam reinforc learn cooper multiag system fifteenth nation confer artifici page june crite barto improv elev perform reinforc learn advanc neural inform process system page mit levin theori learn game mit game theori mit common hu wellman multiag reinforc theoret framework algorithm fifteenth intern confer machin page june hu wellman onlin learn agent dynam multiag system intern confer autonom page hogg behavior comput ecolog ecolog page wooldridg roadmap agent research develop autonom agent hui volatil agent adapt market preprint februari anytim coalit structur gener worst case fifteenth nation confer artifici page sen paper aaai workshop report aaai menlo sycara multiag system ai wolpert tumer overview collect intellig handbook agent technolog aaai frank collect intellig rout internet traffic advanc neural inform process system mit tumer collect intellig distribut control
HCI/1489 4 element embodi agent justin cassel appli teach process machin normal child provid fill coal possibl ey defici overcom clever send creatur school children make excess fun machineri stori automaton deep root pernici human figur gener begun convinc wooden request sing danc plai listen manner actual thought feel introduct human commun languag carri skill develop human exploit uniqu afford human bodi make complex gestur gaze corner central set pitch melodi voic clarifi defin human human metaphor appli interfac design time earli argument util metaphor gave list featur appli fruitfulli includ mix nonverb rule transfer control featur gain widespread recent metaphor design metaphor attempt design comput interfac hold end interfac bodi interfac realiz behavior function demand dialogu function social convent book address featur implement genr embodi model function underli featur problem face imagin succe dream build comput carri human ture test imagin panel judg challeng determin real live young woman automaton judg screen part video conferenc displai human film screen displai autonom embodi agent run comput order win ture underli model human surfac behavior embodi agent chapter assembl demonstr breadth model behavior natur inform product behavior emploi author function model explanatori devic rang verbal nonverb behavior implement embodi agent examin nonverb behavior background underli model present chapter describ briefli natur model author address model person design eca work andré al autonom charact carri user charact person make inform easier rememb narrat compel realiz distinguish individu area interest account specif task context charact displai set attitud consist reveal charact motion interact user charact ball user person agent person match user churchil al focu gener creat person charact suggest success achiev user creat thumbnail person sketch charact basi interact point person influenc word reaction reaction temper slight unpredict characterist human person behavior realiz person embodi author book reli research cue human read person verbal physic nonverb behavior address import manipul behavior correctli demonstr lee show embodi agent present consist person cue perceiv author address model emot inform behavior chapter badler al emot profil eca determin style carri action adopt charact chapter lester al eca serv charact exhibit emot facial express express gestur student behavior gener pedagog speech background rhetor emot ball describ gener emot eca recognit emot part human bayesian network approach underli model emot implement simpl emot recognit model capabl carri strictli basi observ featur facial express poggi pelachaud gener commun behavior basi speech act poggi pelachaud concentr commun kind speech perform perform kei part commun intent proposit interact act defin reason speaker commun goal speaker includ act poggi pelachaud gener directli aspect commun engag speech text mean face author volum discuss function separ speech person cassel al model function gener behavior model support action modal convei commun goal featur kei design embodi agent distinct proposit interact function hand facial express import time behavior synchroni distinct behavior eyebrow function turn model wai predict behavior action model realiz set surfac behavior principl turn behavior action concentr nonverb distinguish embodi agent tradit dialogu system good overview issu speech inton interfac dialogu focu hand gestur facial displai ignor aspect nonverb behavior overview nonverb behavior nonverb find spontan gestur accompani speech commun situat cultur common belief great peopl gestur speak telephon listen attend gestur gestur situat form mental commun intent speaker follow process al gestur realiz function model proposit interact content face chang express synchron concurr poggi chap steedman facial displai link underli model mention book facial displai realiz interact function speech eyebrow attent emot eyebrow person perform wide behavior variabl facial displai replac sequenc word dress stick accompani disambigu acoust signal degrad occur randomli synchron speech speech kendon ey gaze import featur nonverb behavior main function regul flow signal search feedback interact person signal search inform upward search express emot downward case person characterist person show back duncan kind gestur wide varieti facial displai comput scienc commun recent part attempt integr kind gestur kind facial displai interfac gestur put palm emploi absenc emot facial displai build embodi exploit power gestur facial displai function conjunct speech construct embodi type gestur facial displai serv kei role natur human facial displai gestur add redund speech situat give listen cue add inform convei accompani speech facial speech profit work embodi agent remaind introduc nonverb behavior integr underli structur model emot person human hand face figur mike colleagu media shown give speech possibl commun object world dynam trace judgment anim facial displai quick gestur figur talk mosaic tile hand face live mike memori hand give talk import note hand form squar speak mosaic tile build mouth open eyebrow utter stress word current utter interlocutor rememb nonverb behavior regist behavior level form opinion gestur facial displai demonstr mike implement eca peopl hand face function modal relat kind gestur reflect kind gestur type gestur gestur cultur singl gestur differ interpret cultur cultur ekman friesen american gestur made palm back hand listen gestur made back hand listen inappropri polit societi exampl american cultur ring gestur signal gestur exist french italian cultur america cultur gestur constitut percent gestur produc speaker gestur everydai uniqu gestur interest interfac design point comput vision system attempt invent gestur replac languag interact term gestur exist make idea gestur term simpli make gestur daili basi speech part make concentr integr gestur accompani speech proposit gestur consciou gestur object studi interfac commun proposit gestur hand measur size symbol space speaker point chair point spot gestur interact speech interact grammat constitu interact commun channel demonstr placehold syntact role accompani gestur gestur import type discuss paper voic gestur graphic gestur found notabl commun situat physic world place topic gestur make major gestur found spontan part receiv attent consciou wit gestur spontan gestur turn vast major unconsci gestur vehicl commun intent potenti comput partner consciou person produc person watch produc fact lose access form class gestur analog situat speech lose access surfac structur utter immedi hear produc solomon listen heard word word refer piec word sound odd rememb heard slight variat pronunci speech listen difficult hear listen speech order extract throw word mean extract lose access form gestur attend inform convei spontan common gestur icon gestur depict form gestur featur action event gestur outlin side triangl speaker distinct gestur cut icon gestur viewpoint action narrat gestur demonstr narrat imagin imagin stand point rare convei listen infer viewpoint gestur particip comput vision confer describ neighbor techniqu lab emploi wide field cam hold hand open bent wrist finger point bodi hand sweep gestur show wide field cam perspect bodi put hand hold camera plai part viewer view metaphor gestur concept repres physic form gestur common metaphor gestur confer speaker made continu made roll gestur indic ongo process common metaphor gestur illustr inform repres concret object held hand listen conduit metaphor commonli accompani segment commun box gestur accompani talk discuss work metaphor gestur sort contextu place larger context social interact speaker prepar give segment confer typic metaphor gestur academ context metaphor point gestur commonli associ featur peopl talk spontan gestur dialogu point phil cohen audienc talk todai pen associ phil cohen work pen gestur deictic locat physic space front aspect entiti physic overhead projector point entiti explan accumul inform speaker space refer defin big globe point perform previou gestur deictic gestur popul space speaker listen entiti introduc continu refer deictic point index finger hand repres entiti idea event space casual speaker open palm left flip deictic function interact index person room speaker index kind agreement speaker listen gestur commonli classroom accompani teacher point student beat gestur small movement chang form content accompani speech serv pragmat occur comment linguist speech report speech beat gestur signal inform convei accompani speech advanc evalu orient comment narrat home repair show content part tv episod gun window accompani speech beat gestur role part relev impart inform beat gestur serv maintain check attent listen ensur listen al gestur type produc manner emot state speaker chap elliott differ function person chap churchil chap chap predict commun goal proposit interact chap fact convei inform convei convei impress cognit activ requir product speech give impress produc embodi enhanc believ interact system exploit properti construct eca requir understand integr gestur speech turn integr gestur spoken languag gestur integr spoken languag level structur tempor integr gestur speech short introduct physic icon metaphor gestur phase retract phase differenti short hold phase surround stroke deictic gestur beat phase movement gestur space movement distinct gestur correspond addit semant icon gestur number phase correspond type versu mean featur interpret gestur cassel level type individu gestur word synchron time energet part occur promin syllabl accompani speech segment mcneill phonolog lead gestur unit gestur perform product stretch synchron gestur speech gestur accompani gestur relationship gestur phrase word hand sketch kind box front carri gestur complet hand rest end maintain locat hand hand remain locat cut short gestur point ground occurr word accompani affect occurr gestur accompani issu time difficult resolv discuss lester al rickel al cassel al level hand motion robust cue turn chap duncan speaker bring hand gestur space end turn hand speaker speaker begin talk clinic massiv disrupt flow interrupt synchroni gestur freez hold speech gestur resum synchroni linkag gestur languag strongli resist interrupt semant integr speech nonverb behavior accompani present complementari nonoverlap inform complementar level previou wrote gestur linguist segment close resembl mean mean gestur relationship mean gestur gestur convei redund complementari mean normal gestur contradictori convei speech notabl consid normal semant mean semant featur make concept distribut speech gestur semant featur manner motion made mean mean verb distinguish speed verb distinguish achiev goal mean semant featur ad word drove drive gestur mcneill shown speaker languag make choic featur put speech gestur speaker english convei path gestur manner speaker spanish put manner gestur path speech mcneill claim deriv typolog spanish versu english shown english rang featur convei aspect runner made gestur hand turn steer wheel gestur manner portrai runner made walk gestur hand subject runner index finger extend made fast gestur forward indic road runner zip path movement speed portrai manner left unspecifi road runner aspect relationship speech gestur ongo research issu psycholinguist begun implement eca stone semant featur distribut speech strong evid gestur product gener process produc speech children blind birth experienc commun gestur produc gestur speech blind perform gestur conserv task explain amount water pour tall thin short wide blind sight perform gestur speak blind child make gestur tabl make gestur indic short wide dish close tabl surfac gestur wide natur shorter dish integr occurr determin structur talk inform structur plai kei role find gestur inform structur utter defin relat utter proposit relev knowledg pool sentenc fifti clear semant interpret symbol repres simplist proposit relat proposit sentenc equal question fifti georg georg determin item import salient depend question type salienc distinct encod inform structur utter hallidai hallidai term theme denot distinct inform structur attribut utter distinct similar distinct theme roughli correspond utter deriv model correspond interest theme utter depend utter divid semant pragmat ground themat constitu varieti wai depend question contribut current answer inton serv import role mark inform contrast pitch accent mark inform exampl demonstr associ pitch accent inform structur pitch accent shown boldfac fifti fifti georg speak sentenc notic answer question ident term word utter differ word phrase stress sentenc element mark difficult listen predict gestur serv import role mark inform structur gestur found vast major element utter prevost inton gestur serv similar role inton contour time occurr gestur prevost distribut gestur unit stream speech similar distribut inton wai gestur domain isomorph inton domain hand rise space begin inton rise begin hand fall end utter final inton mark effort part gestur pitch effort part gestur part find inton tune part speech part speech contribut ongo listen make convei addit content speech flag part merit found explan find gestur theme mark contrast theme cartoon cover rock fall themat materi gestur occur context inton gestur function similar synchron implement properti eca unsolv due part difficulti reconcil demand graphic speech synthesi softwar gestur type speech wai associ mark statu turn identifi item import interpret convei mean complementari convei speech result true north cultur differ natur cultur specif gestur impress italian gestur differ british speaker true question quantiti speaker languag commun demonstr greater number gestur utter phenomenon link fact cultur embrac gestur segment british societi gestur children encourag hand speak effect belief constraint gestur strong experi videotap peopl carri speaker claim hand speaker watch gestur speaker languag videotap soviet gestur american man made singl gestur entir gestur abort grab gestur hand hand bring lap natur gestur mention vari wide languag commun languag commun american make palm orient listen british palm orient exceedingli rude italian speaker demonstr wide varieti gestur carri mean absenc american english speaker access limit number gestur rememb gestur make percent gestur found everydai type spontan gestur form metaphor gestur differ languag commun languag commun conduit metaphor gestur found narrat narrat narr abund metaphor gestur kind depict abstract idea bound metaphor narr languag spoken gestur wai hand gestur nonverb behavior produc differ cultur cultur lee cultur identif eca import estim abil topic import futur research kind facial displai turn face hand facial displai classifi placement respect linguist utter transmit inform talk facial interest time eyebrow express movement head gestur hand eyebrow smile mouth happi express friesen move head nod facial displai link person remain constant lifetim link emot long emot felt ey synchron unit short time addit facial displai muscl part bodi amount time function facial displai phonolog lip shape chang phonem utter shown lip shape significantli improv facil peopl understand al chap facial displai fulfil semant nod facial function exampl quick nod head listen glanc person finish speak function facial displai social relationship correspond grammat function note movement bodi function smile serv function emot indic serv pure social function happi nod head replac content simpli envelop cultur differ facial displai semant function vari cultur cultur nod unit state shake head greec beat facial displai dialog function similar cultur gener interlocutor turn termin glanc listen semant agreement shake head feedback accomplish nod similar face respect regulatori function behavior remaind concentr facial behavior descript valid integr verbal displai spoken languag hand facial displai tightli coupl speech occur tempor synchron synchroni occur level phonem phrase long utter facial motion isomorph group kendon adapt phonem ey occur word frown eyebrow start end accent syllabl blink start end mark end utter facial displai emphasi match show synchron level sequenc head nod punctuat nod word phrase system movement reflect difficulti coincid hesit insid hesit produc begin speech correl avoid speaker concentr facial displai occurr facial displai classifi placement respect linguist utter transmit inform facial displai linguist utter serv biolog lip synchron chang shape lip utter sound remain facial displai dialog function primarili movement ey eyebrow nod discuss behavior verbal utter facial behavior classifi primari categori depend role cook describ behavior categori function plan ey movement correspond phase turn speaker organ thought speaker tendenc order prevent overload visual linguist inform execut speaker listen short turn durat plan speaker listen maintain mutual gaze accent linguist item punctuat head speaker listen moment eyebrow synchron pitch accent ey movement regul commun channel function synchron signal request listen listen suppress behavior occur primarili end utter grammat boundari speaker give gaze listen end utter listen slightli speaker facial behavior elicit feedback give speaker listen grammat glanc signal request verbal nonverb turn floor listen listen respond establish gaze speaker nod head movement refer turn signal speaker emit signal gaze listen emit feedback turn continu signal speaker behavior depend behavior find feedback absenc feedback elicit signal descript facial behavior function structur function inform structur facial behavior gaze behavior repres cue turn organ predict turn organ turn partial account gaze behavior research show explan gaze behavior integr turn inform structur proposit content utter prevost begin theme frequent accompani begin frequent accompani hearer categori turn gaze behavior end correspond end speaker listen data link gaze inform literatur gaze behavior turn suggest speaker hearer end turn signal floor hearer turn find suggest speaker hearer begin inform kei point contribut convei gaze focu attent speaker hearer kei part utter signal contribut utter signal finish speak independ speaker give turn convei materi contribut dialogu gaze behavior signal kind relationship inform structur turn role facial displai turn associ inform extent behavior coordin regul clear eyebrow head nod speaker listen collabor construct synchron turn effici nonverb behavior fill function suggest robust speech interfac end life excerpt human speak show rule action figur figur show papert talk comput everydai object toi breath turn audienc kid make devic real behavior hand chest point hand hand devic interact hold point posit speech hand move finger speech integr verbal nonverb behavior strikingli similar papert gaze turn gaze audienc begin speak gaze end unit turn back continu papert kind gestur illustr frequent gestur align promin phonolog unit speech semant unit resembl motiv embodi dialogu system comput capac object environ desktop room intellig environ militari battlefield user imagin part reason continu pursu dream comput accept natur untrain input respond kind situat natur multipl charact interact build embodi agent skill mike papert model rudimentari number behavior realiz real time anim bodi extrem limit begin understand abil underli human behavior make human approach dai ture test imagin note research lead prepar chapter support nation scienc foundat deutsch gener sponsor mit media lab andrew handl administr aspect student gestur narr languag research group dedic call duti book project david provid intellectu physic context write profound david mcneill introduc share teach scholarship academ commun takeuchi nagao term avoid automat connot emot link term squar bracket extent speech accompani nonverb behavior descript topic subject debat pretend complet theori scope chapter call behavior convei fact concern outer envelop content similar distinct content envelop made takeuchi nagao refer differ commun commun content nod tend fewer produc slowli envelop nod part chapter form cassel refer cook gaze mutual gaze cambridg press gestur special dialogu person social psycholog bulletin wade interact gestur process sequenti tempor pattern speech gaze dialogu nonverb select voic gestur graphic interfac comput graphic waibel improv connect letter recognit intern confer signal process interact feedback spoken languag theoret framework system pretti embodi interfac agent commun acm forthcom embodi natur languag framework gener speech gestur forthcom stone live hand theori speech gestur interact system aaai fall symposium psycholog model commun collabor system power nod envelop emot feedback anim agent journal appli artifici intellig evid underli linguist inform pragmat cognit stone anim gener facial gestur spoken inton multipl agent comput graphic siggraph acm siggraph prevost turn model multimod machin kluwer forthcom facial displai research languag social interact emot express lawrenc erlbaum associ speech bodi motion synchroni hearer percept academ press bodi rhythm relationship cue speech encod nonverb commun oxford press signal rule speak turn nonverb commun oxford press gestur environ press emot signal von human claim limit cambridg press friesen repertoir nonverb behavior code face palo consult psychologist press pick multimod approach express agent intern confer autonom agent del order principl journal pragmat inton grammar british english point unifi treatment referenti gestur interact context chicago linguist societi annual meet grammat chicago linguist societi gestur blind children unpublish depart chicago solomon memori tacit implic sentenc journal psycholog relationship bodi motion speech studi dyadic commun pergamon press movement coordin social exampl nonverb commun oxford press aspect process relat verbal nonverb commun gestur illocutionari structur marker southern italian linguist societi america symposium gestur context talk hand gestur journal person social psycholog intent articul mit press spoken dialogu system mit press forthcom hand gestur reveal thought chicago press model speak meet gestur languag window thought action lawrenc erlbaum associ forthcom interact comput baecker buxton read human comput lo morgan kaufman steedman gener facial express speech cognit scienc affect comput mit press elimin visibl behavior social effect nonverb interperson variabl european journal social psycholog function nonverb sign st clair social psycholog context lawrenc erlbaum associ block flow speech relationship chronic ma depart mcgill nagao commun facial displai modal cassel recov tempor structur natur gestur intern confer automat face gestur recognit
ML/1490 6 interpol video sequenc base algorithm alexi ming oscar depart electr electron engin hong kong scienc clear water hong kong abstract tempor interpol recent solut tempor resolut predict miss corrupt frame video sequenc paper techniqu tempor interpol exploit properti popular highli effici base motion estim introduc techniqu motion motion classif filter addit give analysi tempor interpol possibl avoid unwant artifact creat time significantli improv perform interpol introduct tempor subsampl simpl techniqu video code system order achiev high compress techniqu video transmiss network vari bandwidth internet wireless frame drop filter techniqu order satisfi bandwidth requir method result significantli reduc tempor possibl undesir jitter playback tempor interpol techniqu solut improv tempor reduc artifact techniqu work slow move sequenc gener achiev good desir perform predict miss frame reliabl occas introduc addit artifact result visual qualiti claim accuraci techniqu reli qualiti accuraci motion vector predict sequenc highli effici motion estim algorithm base algorithm significantli reduc achiev similar qualiti brute forc full search algorithm predict motion vector field adapt search techniqu reli spatial tempor predictor motion estim process addit fuzzi logic techniqu adapt pattern search enabl algorithm perform good fs algorithm term achiev motion field close true motion frame discuss significantli process tempor interpol present highli effici basic reli tempor interpol procedur predict miss field interlac sequenc obviou similar approach emploi predict interpol miss frame normal progress video figur motion field frame base algorithm algorithm tempor interpol base algorithm achiev smoother motion vector accur motion closer true compar algorithm includ fs examin tabl entropi differ current motion vector versu close relat motion vector spatial tempor adjac block present adjac block highli tend similar motion vector properti suggest closer true motion field algorithm smaller entropi versu set predict predictor includ motion vector spatial adjac block top current motion motion vector colloc block previou frame predictor constitut predictor set import perform algorithm tabl algorithm significantli lower entropi compar algorithm fs gener claim algorithm give reliabl motion vector approach true motion sequenc question motion vector estim miss full search algorithm sequenc median set median set stefan bu tabl motion vector entropi versu predictor predict frame frame assum posit insid frame motion vector present predict pixel miss frame block posit shown figur basic coordin frame essenti track block estim block found insid miss frame improv perform gener block miss averag method evid pixel insert frame gener pixel leav empti gap insid insert field frame averag pixel blank pixel predict assum motion predict techniqu method consid bit complic accur complic accur predict valu blank present assum posit insid miss frame motion vector equal time point insid frame figur assum block motion time equal time point frame reconstruct averag block similar frame advantag rel standard motion architectur frame insert frame frame figur track motion interpol block techniqu combin tempor interpol case miss frame reconstruct select averag frame process method special case motion techniqu perform normal motion method motion tempor interpol techniqu combin improv accuraci overlap block motion approach mv mv mv frame insert frame frame figur simpl motion vector interpol method techniqu benefit significantli smooth motion field gener base process work motion estim algorithm includ fs current video sequenc motion estim algorithm algorithm benefit requir comput give perform motion estim algorithm desir practic tempor interpol system perform addit motion estim smaller transcod entir refin motion motion techniqu discuss case motion give satisfactori result classifi mb stationari examin motion vector mb classifi stationari predict consid good addit process perform addit tempor median give addit prioriti origin predict tempor interpol case addit artifact improv qualiti avoid problem classifi frame predict examin evalu motion vector addit error gener predict frame frame reli error differ claim frame threshold total error differ frame larger threshold tempor interpol frame skip motion vector correl process simul result select simul algorithm advanc predict diamond search select similar perform note recent accept recommend motion estim optim model superior speedup qualiti versu algorithm import practic system encod immedi motion vector perform tempor interpol repeat entir motion estim process improv perform search area select simul compar techniqu fs techniqu tempor filter motion classif frame consid predict addit simul perform gener good interpol frame sequenc miss tabl tenni select simul result tabl gener interpol frame sequenc miss america figur frame perform sequenc miss america tabl tenni final present figur figur note miss america salesman frame interpol due error sequenc conferenc filter perform case perform significantli techniqu db observ perform fs expect perform fs case tabl tenni outcom motion classif filter process fs improv correl motion vector refin motion enhanc perform case algorithm predict frame perform term significantli improv tabl fewer frame interpol paper present tempor interpol techniqu base algorithm algorithm combin motion approach method motion classif filter achiev significantli perform preexist algorithm frame predict perform algorithm enhanc artifact process reduc elimin refer system stream proc packet ck oc motion tempor interpol proc spie sym visual comm imag vol pp ck oc cw tempor interpol proc ieee int sym circ vol pp cw oc motion tempor proc ieee int sym circuit vol pp jun motion estim circular proc vol san pp advanc block base algorithm motion proc ieee inter conf imag proc section oct oc ml motion vector field adapt search techniqu block base motion proc visual comm imag proc san result base motion estim algorithm advanc predict diamond proc ieee inter symp circ syst optim model version interlac techniqu base proc visual comm imag proc san incorpor proc visual comm imag proc vol pp figur predict frame frame sequenc miss america fs sequenc frame select select tabl tenni salesman miss america tabl comparison tempor interpol techniqu fs figur tempor interpol sequenc miss america tabl tenni
ML/1491 6 type increment learn klau jantk fb informatik htwk leipzig leipzig abstract paper intend introduc closer increment learn develop concept increment learn increment learn concept appli problem learn list demonstr relev introduct intent present paper introduc notion increment learn classif phenomena finer area concept denot phrase increment learn increment roughli increment algorithm requir work increment permiss back histori inform present learn process increment learn algorithm permiss inform past effect concept depend detail specif process inform present turn concept introduc provabl formal set concept formal area learn list differ increment learn work partial support german ministri research technolog grant increment learn deduc formal illustr author led discoveri differ increment increment behaviour compar earlier work type induct infer strategi includ increment call iter standard induct infer literatur recent work induct infer anim sakakibara siromonei recent investig pac learnabl list initi research induct infer list side effect endeavour model learn idea domain list ongo work yasubumi recogn effect framework inform paragraph induct increment learn method method call iter crucial problem iter method tend forget inform fed learn process effect adopt transform method prove result automata learn algorithm invent artifici intellig point assum work effect manner formal gener theoret mean restrict class algorithm admit restrict algorithm account problem solv frequent impli methodolog process inform present learn devic learn algorithm assum collect case finit case base collect encod case base formal restrict class algorithm compet problem solv occur type increment algorithm effect inform present histori case area learn list increment learn function present chapter base earlier work intend relat result learnabl manner background introduct finer classif increment learn induct infer induct infer invent gold semin paper total function assum target object learn exampl excel survei regard gener function complet present graph admiss inform fed learn devic arbitrari partial function learn function present finit initi sequenc order graph order denot initi segment exampl wrt abbrevi order argument understood sequenc learn inform cover initi segment gener ident repres correctli present inform basic definit induct infer famili learn problem solvabl definit call lim instanc earli work socal identif type denot call recent american literatur author call partial function solv learn problem induct infer machin adopt notat sequel reader direct detail larg varieti addit requir consid natur properti learn strategi properti built increment hypothesi recent inform hand construct hypothesi increment induct infer small number concept introduc nice formal increment learn arbitrari learn strategi built hypothesi inform increment construct sequenc iter hypothesi build depend hypothesi hn recent piec inform provid initi fix standard inform order led identif type call sequel note approach version requir initi hypothesi construct technic reason crucial problem investig arbitrari order introduc gener approach upper index definit class total function increment learnabl limit arb exist partial induct infer machin satisfi target function inform order natur number denot assum initi lim hn exist correct program formal correct assum priori condit rewrit complet definit concept formal case increment learn priori assum inform order definit assum standard order natur number class total function increment learnabl limit exist partial induct infer machin satisfi target function natur number denot assum initi hypothesi lim hn exist complet definit note classic result induct infer lim equal lim arb introduc collect learn problem problem class solvabl uniformli arb formal increment learn inform sequenc author investig present type learn call increment proof classic result exhibit essenc problem theorem arb ae ae lim arb lim proof proper base problem increment store inform learn process problem forget classic result earli dai induct learnabl depend effect gold invent principl identif famili class total function effect total function denot num classic result induct infer learnabl requir gener identif principl power learn principl result learnabl problem class belong num incorpor theorem extend found theorem num ae ae lim arb lim num arb denot incompar studi combin seemingli natur properti turn restrict power forc work increment typic hold consist arbitrari inform sequenc work hypothesi gener reflect inform built definit class total function consist learnabl limit con arb exist partial induct infer machin satisfi target function inform order natur number hn lim hn exist requir total prefix lead identif type con arb analog definit complet definit mention desir combin postul natur kind model motiv artifici intellig algorithm design meet condit simultan author algorithm problem combin impact amount solvabl problem definit combin postul defin identif type con arb partial satisfi con arb total satisfi complet definit assum work consist con arb con arb work restrict learn power properli discoveri base problem forget inform process learn face difficulti achiev increment behaviour theorem con arb ae con arb con arb ae con arb increment learn forc meet restrict learn power essenti theorem con arb ae con arb con arb ae arb exhibit charact statement point problem reader direct sum result present amount theoret work illustr impact increment behaviour learn care inspect proof exhibit natur result relat phenomenon forget inform earlier crux appli approach author view increment learn restrict investig problem face phenomena increment learn phenomenon charact relat increment learn investig sequel increment learn list motiv domain motiv current work induct infer list sketch recent applic learn tree list type interest simplic list provid practic success relev applic address explor deepli approach learn list recent work learnabl list pac framework deduc posit result provid hope learnabl result provid background pac learnabl list suit learn approach detail explan reason recent artifici intellig import reason human expert tend knowledg form case episod frequent gener knowledg hope reason widen bottleneck knowledg acquisit reader direct recent introduct survei reason learn natur design learn procedur recent formal exhibit remark power learn algorithm set learn total cover problem learn effect classifi formal learnabl induct turn learnabl manner understood normal form result induct infer algorithm gener result question interpret set natur concept case case conceptu target object learn area learn function output exampl consid case intend target behaviour choic underli program syntact differ program exampl behaviour posit program exampl occur syntact minor class except includ textual dialogu compon area list list understood accept formal case formal label list construct directli case describ languag accept yield syntact correspond inform process gener induct learn process formal expect insight natur learn investig power limit base learn appli list present kei reason learn list domain suitabl illustr prove import concept increment learn syntax semant list assum alphabet technic element word build usual denot set word set word empti word written list finit list label word empti list denot nil formal assum alphabet basic relat sequel denot definit definit uw definit base induct nil list step induct list word list class dl smallest class wrt base induct step induct complet definit list call node form understood test process input word case comput process termin output list devic accept formal languag word fed list perform test subsequ node posit result list pass node turn substr determin accept interpret posit answer node list satisfi final node defin formal defin languag accept defin languag pass technic empti list accept empti languag drop definit base induct na lp na step induct lp lp na lp na lp lp lp class ldl class languag accept list alphabet ldl subclass class regular languag alphabet distinguish number interest properti includ pump phenomena space normal form result theoret provid assum bg infinit sequenc list defin nil technic clear list xn reduc chang languag accept easili recogn sequenc languag defin satisfi oe oe oe learn list label word understood case describ languag learn list tailor node list distinguish case describ behaviour reader consult regard list easili transform pair consist cb measur oe defin languag requir specif semant pair natur definit assum finit set cb ae comput map oe set defin formal languag ffl ffl cb ffl cb simpl class similar measur oe suffici express languag gener list reader easili check mean target class similar measur defin definit assum alphabet oe ffl oe comput ffl formal approach learn adopt directli deriv algorithm area publish recent similar approach base refer mention formal directli reflect crucial properti resp algorithm algorithm work increment collect start empti cb eventu addit case hand gener type work call increment distinguish type increment learn investig limit stem lack oper restrict algorithm learn similar measur start naiv measur oe easili invok gold semin work learn finit determinist automata limit gold result adopt prove algorithm learn arbitrari list limit posit case result impli directli learnabl arbitrari list complet sequenc posit neg case limit result refer learn manner increment learn ist explicitli attack formal learn reflect idea increment learn definit class ffl dl list learnabl limit manner basic consist comput procedur ffl sequenc case complet describ hold cb def cb oe def ffl cb def lim oe def lim oe oe condit formal intend behaviour specifi increment learn condit reflect basic properti learn limit definit turn restrict class list learnabl introduc kei reason increment learn theorem class dl ist learnabl limit manner intend learn list suffic find subclass dl slight modif simpl discuss lack sketch kei idea sequenc expon kn defin list kn kn list construct sequenc case describ languag repeatedli present posit case form exce kn stabil condit case step present hold cb def cb case present turn unabl learn definit learn devic permiss back inform complet proof finer classif increment learn consist distinct increment learn increment learn type learn restrict power compar unconstrain learn algorithm learn theori provid firm result regard formal increment learn restrict increment learn crux limit strong learn approach understood hint relax requir enlarg scope learn devic argu overcom limit exhibit deriv miss case effect current case present exce standard approach lead problem gener abstract case suffici gener approach learn arbitrari list class regular languag learnabl inform reason gener spirit reason result present suggest case distinguish typic understood necess introduc formal approach concept prototyp cognit scienc provid rich background guid formal note problem prototyp relat concept good exampl import issu recent induct infer research nonstandard approach similar widen scope reason method import nonstandard idea lift similar local properti global express similar object uniformli paper intend step area refer david aha learn algorithm rai darpa workshop case base washington page morgan david denni marc albert learn algorithm machin takeshi machin discoveri amino acid sequenc tree regular pattern intern confer gener comput june volum page institut gener comput technolog dana angluin carl smith survei induct theori method comput mark gold languag identif limit inform klau jantk case base learn induct infer proc acm workshop comput learn juli page acm klau jantk combin postul natur induct infer janet kolodn introduct reason artifici intellig sandra jerom feldman learn automata order exampl machin rosch cognit refer point cognit yasubumi sakakibara siromonei model learn set string proc acm workshop comput learn juli page acm
HCI/1492 4 call paper sigchi chi submiss complet detail submiss print page save record find error edit click electron submiss call paper page paper put feel upload byte file ian comput marilyn mcgee dr stephen brewster philip grai haptic devic commerci touch potenti realist solut varieti interact design challeng investig touch reduc visual overload convent desktop investig phantom haptic devic mean interact convent graphic user interfac experi compar effect haptic augment user perform simpl target task experi involv ecolog orient search scroll task result haptic effect improv user perform term task complet time number error made significantli reduc subject workload measur show particip perceiv aspect workload significantli haptic result implic haptic user interfac design discuss subject multimod interact augment realiti empir evalu input devic interact technolog chi home page chi call paper tactil gestur click view anonym version paper receiv paper standard adob viewer version review addit electron submit paper form chi mari microsoft research microsoft wa time meet paper deadlin receiv email confirm submiss email explain problem mention paper put feel ian marilyn rose stephen brewster philip grai glasgow interact system group depart comput scienc uk abstract haptic devic commerci touch potenti realist solut varieti interact design challeng report investig touch reduc visual overload convent desktop investig phantom haptic devic mean interact convent graphic user interfac experi compar effect haptic augment user perform simpl target task experi involv ecolog orient search scroll task result haptic effect improv user perform term task complet time number error made significantli reduc subject workload measur show particip perceiv aspect workload significantli haptic result implic haptic user interfac design discuss keyword forc multimod devic introduct desktop interfac increasingli ad problem begin emerg problem inform inform present graphic difficult attend relev part present inform sensori modal potenti lessen problem attempt made overcom inform overload sound interact button click scroll convinc empir attempt reduc overload haptic forc technolog technolog user feel interfac potenti radic chang comput futur power touch altern mechan send receiv inform comput interfac augment graphic user interfac haptic feedback idea develop haptic abil produc term abil vibrat simpl softwar control friction effect devic show significantli complet time target task offset slightli error rate engel al found improv speed error rate target task modifi trackbal direct freedom forc feedback devic earli studi advanc devic technolog phantom technolog develop devic augment desktop interfac al demonstr perform desktop interact provid empir evid support claim commerci product aim offer custom haptic enhanc desktop evalu devic publish phantom creat haptic enhanc desktop formal evalu enhanc found literatur pace technolog advanc field term hardwar produc softwar develop current project desktop constrain primit haptic effect engel technolog advanc progress evalu dispar led situat formal guidelin feedback situat evid show arbitrari combin inform present ineffect lead empir evalu modern haptic augment desktop urgent requir time effort wast end interfac fact harder standard haptic kei improv interact technolog haptic terminolog term definit literatur describ haptic interact reason area infanc rectifi problem set unifi haptic definit word haptic grown popular advent touch comput term gener mean relat sensori inform state bodi defin human haptic system consist entir motor cognit compon system defin haptic relat touch umbrella fall distinct import kinesthet inform inform refer sensat skin contact object object skin kinesthet inform refer movement muscl motion limb overlap critic convei sensat contact object distinct import attempt describ emerg technolog haptic devic posit input stimul touch appli output user form forc smaller scale forc produc tactil devic affect skin surfac stretch pull larger forc produc forc feedback devic affect bodi posit movement definit tabl devic understood sensori system primarili affect term definit propriocept relat sensori inform state bodi kinesthet haptic relat touch pertain skin skin organ tactil pertain touch kinesthet mean feel motion refer forc feedback sensat origin joint mechan product inform human kinesthet system tabl definit terminolog paper describ experi empir test haptic augment standard desktop interfac forc tactil feedback evalu work experi compar user perform button haptic effect simpl target task experi involv ecolog orient task particip search select target haptic scroll experi haptic posit effect perform method devic devic experi phantom figur forc feedback devic forc feedback devic kinesthet inform defin tabl act cursor control devic place tradit figur phantom forc feedback devic technolog optic sensor phantom monitor movement devic mechan actuat appli forc back user calcul posit inform store algorithm model object user interact oper devic user held stylu system softwar intel run window nt phantom experi softwar written ghost api provid phantom develop haptic code softwar architectur experi simpl separ coincid maintain graphic haptic displai state inform extract haptic model map event event graphic interfac haptic creat manag class individu haptic effect class manag class held posit size haptic effect model pointer haptic effect class implement feedback present user effect class oper local frame creat manag class architectur simpl specif haptic augment independ geometri ultim flexibl posit haptic effect constraint haptic effect locat instanc architectur simpl creat button augment effect ident workspac experi box mm wide mm high mm deep haptic effect present back wall workspac haptic effect haptic effect experi built ad effect previou studi effect aim improv target reduc problem slip interfac widget effect textur button flat workspac potenti haptic signifi cursor posit interest object textur implement form set concentr circl mm centr middl target textur creat vector rotat maximum rotat appli shown figur textur pattern felt possibl user encount ridg irrespect direct began travel figur diagram geometri haptic textur effect friction effect damp veloc interfac friction effect common previou literatur partli produc simpl hardwar instanc electromagnet base partli advantag provid feedback user stop interest target friction effect realist model static dynam compon static compon restrict user point attain escap veloc dynam compon attempt slow whilst motion effect hole back depth mm edg slope effect featur strongli previou literatur diagram geometri present figur potenti provid feedback simpl fact leav wall edg climb make harder button problem note brewster al figur diagram geometri haptic effect graviti graviti effect user move button constant forc appli push centr forc taper centr user rest centr graviti benefit reduct error simpl mechan prevent user slip button gener measur experi order full rang quantit qualit error subject workload measur experi subject workload measur modifi version nasa task load index nasa reduc workload mental physic time effort perform level frustrat experienc ad seventh fatigu potenti problem forc feedback devic physic demand user ad factor find haptic effect addit fatigu particip workload chart condit experi experi experi haptic effect compar investig effect ad haptic effect standard graphic button investig target cursor error button press experi exploratori experi investig differ haptic effect control condit differ occur task complet number error subject data gather predict graviti provid largest reduct time workload provid feedback highli simpl target task particip sixteen particip femal twelv male ag eighteen thirti comput student glasgow regular fluent comput user user trivial previou exposur phantom design experi design particip haptic encompass effect control condit control condit phantom devic haptic effect appli essenc devic work normal order present condit evenli distribut effect practic fatigu particip randomli alloc condit train condit session immedi prior experi instruct read prepar script task simpl button task task chosen featur promin previou literatur elementari oper simpl perform fundament cursor oper factor engin task make suitabl haptic augment felt particip experi experi visual distract circumst typic oper case expert user concentr central task interact graphic widget peripheri attent visual assert haptic feedback prove task encompass repetit motion sort repetit motion haptic task rapidli dissolv exhaust search entir workspac haptic distinct area ineffici strategi compar visual scan screen repetit motion common desktop interact menu click encompass factor window screen time figur instruct occupi side screen instruct target seek window occupi centr side screen target form button button posit posit quadrant diagon window posit diagon chang button remain singl quadrant window meant button remain direct rel centr window time button move diagon prevent user emploi pure mechan repetit ensur equal distanc travel button press centr button button label accord posit instanc instruct window target successfulli press present figur interfac experi measur perform measur time trial number subject workload rate time measur time find target time move target time press target time move target button error measur particip move button fail press user simpli arguabl part normal target process error occurr user press button move select button feedback occurr success click error type unnot time subject rate acquir nasa measur result experi error data present figur result anova test effect found compar score haptic effect slide slip error summari result reveal analysi mean confid interv shown tabl dramat result particip graviti condit made significantli fewer error sort control true textur condit significantli error control graviti friction textur control graviti sig sig friction sig textur tabl analysi slip error graviti friction textur control graviti sig friction sig textur tabl analysi slide error analysi tempor data analysi total time complet trial strongli number error made condit felt invalid measur reflect number error condit total time button figur anova reveal differ subsequ comparison bear worth note differ perform effect short time figur show workload score score textur condit significantli control board measur graviti condit consist reduc workload achiev significantli score control perform level achiev categori experi experi attempt simul realist task read accompani scroll select return scroll bar whilst visual attend materi user requir scroll document materi interest scroll bar user concentr read materi find forc move visual attent scroll bar ensur cursor posit appropri oper time make frequent shift visual frustrat experienc reduc usabl scroll bar import error error time graviti friction textur control effect figur slide error experi graviti friction textur control effect figur error experi graviti friction textur control effect figur total time button experi visual attent primari crucial reduc visual distract scroll scroll bar particip significantli time complet move scroll bar significantli perceiv workload task significantli particip twenti particip femal remain nineteen male ag particip comput scienc student averag score mental physic time figur workload result experi glasgow regular fluent comput user user particip trivial previou exposur phantom particip experi design experi design particip condit visual haptic condit visual condit standard graphic scroll bar haptic scroll bar overlaid haptic effect graviti chosen effect experi arrow button graviti act haptic indic user place press button successfulli rest scroll area effect user fall slider area haptic feedback user reserv visual attent primari task widget touch order present condit evenli distribut effect practic fatigu train particip condit session immedi prior experi procedur figur show interfac task particip read numer code instruct window scroll vertic larg data file code data find target highlight code doubl click drag press button send code target window data window list randomli gener numer order code forti code enter condit list format column simul standard document read left effort perform workload categori frustrat fatigu graviti friction textur control top bottom highlight oper includ forc user scroll bar ensur repeat target scroll bar figur interfac experi top left window instruct bottom left target larg window data window centr send button measur perform measur time trial number movement scroll workload rate time measur user activ send button end previou trial send button activ end current trial subject rate collect result experi time tabl show time movement scroll bar result pair establish haptic feedback significantli reduc averag trial time predict trial time time scroll bar visual haptic visual haptic tabl time movement result experi movement scroll pair show particip haptic condit move scroll bar area significantli visual condit workload figur show workload score pair carri visual versu haptic condit categori mental demand significantli haptic condit expect workload hypothesi effort frustrat rate significantli reduc haptic condit differ fatigu experienc hypothesi haptic condit reduc workload confirm part averag score mental physic time haptic visual figur workload result experi gener discuss time result studi haptic effect ad button scroll bar reduc time real differ effect ms worst effect experi explicit separ error data time data doubt contribut factor lack tempor variat condit main reason lack time reduct effect particip exert forc overcom haptic effect control condit slide interfac haptic condit climb overcom graviti forc particip produc forc requir time work haptic effect type desktop task benefit haptic effect chosen inappropri reduc time task chosen experi previou work claim reduct perform time present work suggest thing care haptic reduc perform time error result experi show order magnitud reduct number error produc haptic condit graviti fewest error textur graviti effect made hard slip target particip pointer make explicit movement leav made stai target easi textur cursor constrain user reason effect case textur problem perturb movement make hard effort frustrat perform workload categori fatigu stai target result kinesthet forc feedback devic stimul feel rich textur real world kinesthet devic simul gross requir larger make harder user move textur suitabl product tactil devic campbel al effect simul graviti effect requir movement task combin tactil kinesthet forc feedback result show design awar facil devic order gener haptic effect improv usabl area infanc devic function movement result experi show reduct number time particip move scroll bar haptic condit show haptic aid particip remain target haptic scroll bar user scroll slip bar cursor stai move lift scroll bar difficult mistak requir consciou effort subject workload measur experi import paper desktop present data develop multimod interfac multipl sensori import effect workload user perform task quickli find frustrat requir effort complet expect dissoci behavior measur subject experi address studi workload hart suggest cognit resourc requir task finit amount task level perform achiev invest resourc measur time error rate give pictur usabl haptic devic workload import area cognit effect devic experi show effect markedli level workload graviti indic effect reduc error rate workload suggest robust successfulli haptic interfac type textur worst term suggest hard effect devic experi show effect haptic realist situat case reduct effort frustrat fact easi stai scroll bar due effect made task effort reduct number movement scroll bar confirm expect lead reduct categori mental show reduct suggest studi workload learn affect haptic desktop interact area investig fatigu devic requir user appli forc potenti fatigu import investig forc feedback devic desktop situat peopl interfac long period result experi show graviti effect fatigu control condit textur significantli fatigu control reason discuss simul textur kinesthet devic requir larger forc appli requir user exert larger forc overcom experi show fatigu graviti effect research show haptic effect correctli impact incorrectli significantli step investig problem work ensur design interfac avoid fatigu research shown haptic provid perform benefit graphic user interfac reduct number error made subject workload experienc gain shown haptic effect match capabl devic simul effect support devic effect aspect usabl technolog progress easi focu benefit equip afford whilst forget measur benefit produc recent work desktop firmli orient implement experi balanc empir find provid firm foundat futur research build basic principl develop acknowledg research support epsrc project epsrc revel technolog virtual presenc refer tactil forc feedback intern journal studi movement characterist tactil forc feedback intern journal human comput studi auditori audio feedback acm confer companion acm sa sound overcom inform overload sa design widget interact kw feel ad tactil feedback ifip io improv effici trackbal contextu forc feedback intern journal sg workload assess predict approach system van nostrand reinhold rl cognit salienc haptic object role bia haptic ad forc feedback desktop acm multimod user interfac system forc feedback physic model ifip chapman larg workspac haptic devic interact summari acm acm touch hear design issu system acm acm lb ad realist feel comput experi ma haptic virtual research challeng comput
HCI/1493 4 commun acm pretti embodi interfac agent justin cassel mit media laboratori st massachusett introduct anim human manifest social qualiti dog recogn domin stand correct demonstr consist human commun carri skill develop human exploit uniqu afford human bodi make complex gestur gaze corner pitch melodi flexibl voic clarifi defin human human metaphor appli interfac design time earli argument util metaphor gave list featur fruitfulli appli includ mix rule transfer control featur gain widespread human comput recent metaphor recent design metaphor attempt design comput hold end articl describ featur implement genr embodi agent describ embodi agent base featur argu primari skill skill infant mother turn bodi support embodi agent turn power wai human interact comput claim order embodi agent live implement base actual studi human human architectur reflect properti found embodi interfac comput interfac repres human anim bodi interfac human anim bodi lifelik believ action reaction human user embodi interfac specif specif bodi embodi agent defin properti human abil recogn respond verbal input abil gener verbal output abil deal function turn repair mechan abil give signal state contribut proposit research lead prepar articl support nation scienc foundat deutsch gener sponsor mit media lab tim lee kenni jennif scott kri ob talent dedic student student work embodi agent project colleagu matthew stone continu invalu contribut work jame jeff rickel ben shneiderman gener comment improv paper embodi agent bring slant argument wise anthropomorph interfac shown human respond comput social entiti experienc comput user interact comput social rule polit gender accept comput authorit comput expert wai react comput human fact react comput beg question interfac design tendenc build comput human critic shneiderman function serv point anthropomorph interfac success fact lead slower time part user embodi give interfac function human bodi evalu function embodi interfac simpli build anthropomorph interfac talk talk shed light debat embodi belief embodi interfac agent address met current interfac wai make dialogu system robust face imperfect speech bandwidth low support effici collabor human human mediat machin bodi bring embodi agent bring dimens discuss relationship emul role foundat principl true phenomena implement interfac sell wave interfac agent bodi autonom embodi characterist call autonom synthet charact gener interact social skill research develop charact believ lifelik deriv model life research found turn insight anim user suspend attribut realiti interact charact oz project cmu brought artist actor earli develop process interact charact convei featur person compel design approach carri weight develop embodi agent scientist began build dialogu system comput understand human research find forc turn theori investig detail ensur interfac share skill human user lester cosmo charact refer object environ descript point complex algorithm base linguist theori referenti ambigu rist associ gestur aspect plan gener point gestur rhetor action turn action elabor rickel johnson pedagog agent move object virtual world gener point gestur begin explan object engag debat anthropomorph good emphasi implement characterist human interfac research develop embodi agent turn issu adequaci theori human behavior task implement effect interfac skill embodi agent start actual scenario human user embodi turn behavior sampl interact rea embodi agent domain real estat access sale boston displai pictur properti point discuss salient featur excerpt actual interact rea mike approach project screen rea turn side gaze mike move rang camera mount rea turn face im bui place mit rea indic show pictur rea blink mike rea plan big rea make gestur hand mike bring hand speak rea wait speak thing nice garden rea sketch curv gestur hand indic garden extend side minut porter squar station rea make clear minut foot station make walk gestur finger big mike interrupt rea stop speak immedi wait master im didnt catch master rea point master bedroom rea bring hand relationship bedroom tour continu model scenario excit rea engag subtl set properti human model order system demonstr pattern properti function synchron interact proposit function behavior govern set behavior exhibit differ person person successfulli build model refer surfac behavior emphasi identifi high level structur element make element term role function exchang typic function includ turn provid contrast break import emploi varieti circumst produc commun commun function realiz set behavior form give function depend current avail modal face type cultur pattern person style dialogu order listen provid rea nod note context behavior carri head nod emphasi feedback commun function commun behavior initi react person short glanc break glanc head wave give turn eyebrow turn hand gestur space turn glanc start talk feedback request feedback eyebrow give feedback nod head tabl exampl function behavior realiz synchron behavior fill achiev commun occur synchroni properti lead human assum synchron phenomena mean mean nod determin occur msec scale differ bracket tempor extent great dialogu rea nice time sketch outlin garden effort part noun phrase gestur occur simpli rea desir turn occur human user speech proposit interact contribut contribut divid proposit inform interact inform proposit inform correspond content includ speech hand gestur inton complement elabor speech content size sentenc rise inton question sentenc interact inform consist cue regul process includ rang behavior head nod bring hand lap turn listen give regulatori speech interact function creat maintain open channel commun proposit function shape actual content function fulfil verbal mean dialogu excerpt rea behavior contribut proposit gestur question minut foot regul rea understood mike utter interact behavior tend shorter durat proposit human strike varieti time scale involv msec long signal particip particip continu deliv contribut long minut mean behavior longer decid shorter produc feedback nod simpli reactiv dialogu msec mike rea nod verbal sec plan deliv strike aspect eyebrow head nod speaker listen collabor construct synchron smooth particip increasingli synchron behavior ensur proce effici function suggest robust speech rea behavior listen human quickli begin nod turn head turn embodi agent talk essenti properti embodi human human sketch benefit incorpor properti human comput interfac section turn detail implement accomplish order embodi human comput insight set incorpor stage architectur embodi agent turn back embodi agent verbal behavior design term properti rea bodi wai ey bodi hand facial displai contribut organ regul understand aspect modal emploi human interlocutor properti system rea watch feedback turn human user send time modal architectur flexibl track thread commun wai thread thread time architectur process concentr activ time scale deal proposit inform requir build model user knowledg architectur includ static knowledg base deal domain real dynam knowledg base gener proposit inform system plan present output manag order present interdepend fact understand interact system build model current state respect process current speaker listen understood speaker core modul system oper function modul edg system translat input function output produc symmetr architectur function modal present input output model work extend work develop model reli function behavior make explicit interact proposit contribut behavior architectur figur show modul rea architectur kei point embodi agent input accept modal input devic modal integr singl semant pass modul modul semant frame slot interact proposit inform regulatori contribut act maintain system categor behavior term function mirror organ architectur central made term function gener move peripheri made term behavior input manag action input manag collect input modal decid data requir instant reaction process hardwir reaction handl spontan reaction stimuli user stimuli directli modifi agent behavior delai agent gaze seamlessli track user movement delib process modul handl input requir model proper interpret includ interact behavior proposit behavior lastli action schedul schedul motor event anim figur repres agent crucial function schedul prevent compet motor request modul commun base commun serv make system modular extens implement system consist larg project screen rea displai front user stand camera mount top project screen track user head hand posit space user wear microphon captur speech input singl sgi comput run graphic sgi engin comput manag speech recognit recent ibm move gener microsoft move bt imag process input manag action schedul gestur recognit input devic speech bodi posit gaze direct output devic anim render speech devic understand modul gener proposit process interact process planner modul modul hardwir reaction delib modul figur rea architectur palo alto implement rea attend proposit interact compon model term proposit rea speech gestur output gener descript gestur describ gener natur languag gener modifi gener natur gestur kei aspect rea speech gestur treat gestur chosen convei rea mean word approach motiv literatur psycholog linguist suggest similar process human citat dialogu rea extent garden convei attract garden speech rea gener engin interact demonstr dialogu function acknowledg user presenc turn face feedback function rea feedback nod head emit short statement short user eyebrow partial understand phrase sentenc function rea track speak speak hold turn rea verbal yield turn user begin speak user gestur interpret express desir halt remark nearest sentenc boundari end speak turn turn face user function realiz behavior turn specif rea gener gestur facial express base current state function convei user approach rea signal open engag toss head orient bodi face user angl user speak rea turn user rea finish speak readi give turn back user drop hand gestur space eyebrow expect approach directli social scienc literatur human human tabl summar rea current interact output behavior state output function behavior open interact user smile toss head attend face user end interact turn user present greet wave give turn relax hand user eyebrow rea speak wave give feedback nod turn user hand user speak turn user hand begin gestur speak tabl output function model behavior categori function develop natur principl combin multipl input output rea decid give modal base moment paper argu embodi agent logic extens metaphor human comput anthropomorph interfac point assumpt order maxim system permit interact peopl comput resembl interperson argu social interfac gener popular interfac attent paid implement embodi base understand addit ad hoc model relationship modal verbal behavior qualit differ human bodi enabl commun protocol bodi postur plai essenti role proper execut initi interrupt feedback error kind behavior enabl exchang multipl level inform real time peopl extrem adept extract mean subtl variat perform slight variat feedback nod time gaze behavior significantli alter messag speaker send interest interfac design commun protocol user train nativ speaker languag skill daili embodi interfac agent exploit potenti provid higher bandwidth commun flip side commun protocol execut correctli embodi bring benefit interfac date empir investig kind embodi interfac result shneiderman point ampl histor form junk pile abandon anthropomorph anthropomorph design interfac van specif examin evalu recent anim interfac conclud benefit system arguabl term user engag attribut intellig point virtual system evalu exploit afford human bodi design paradigm expect improv human comput interact show behavior function regard system embodi sake pretti graphic work note recent embodi agent implement rang properti outlin start carri rigor evalu benefit embodi lab encourag result earli comparison embodi agent embodi interfac avatar system compar rea ancestor detail ident bodi utter ident interact found user judg version interact behavior exhibit natur languag version ident natur languag perform task significantli group evalu rea cousin graphic world anthropomorph avatar autonom gener behavior show posit benefit task perform user studi prefer autonom version version behavior motiv embodi agent dialogu system comput capac object environ desktop comput smart room intellig environ militari battlefield children museum user imagin part reason continu pursu dream comput accept natur untrain input situat robust face higher bandwidth speech benefit embodi interfac agent demonstr approach paradigm rea system capabl make intellig proposit contribut rea sensit regulatori interact function verbal capabl produc regulatori behavior improv interact user remain awar state rea embodi agent increasingli hold end refer ai method control behavior anim interfac appli artifici vol pp role emot believ commun vol pp feedback spoken languag theoret knowledg base vol pp embodi embodi ed mit press hand theori speech gestur interact aaai fall psycholog model commun collabor cape direct commun behavior autonom agent vol pp impact anim interfac review empir press emot commun anim pedagog embodi ed mit interact user orient design interact graphic acm siggraph media peopl treat media real peopl place cambridg collabor embodi agent virtual embodi ed mit design user strategi effect ed
DB/1494 3 router architectur differenti servic tomorrow internet vp tv bell laboratori lucent technolog crawford corner road nj usa abstract transform internet commerci abil provid differenti servic user wide vari requir rapidli import meet massiv bandwidth demand deploi transmiss system internet servic provid provid custom specif differenti servic share network infrastructur describ router architectur support trend rise bandwidth demand rise demand differenti servic focu router mechan support differenti servic level contempl due concern implement type differenti servic servic provid offer discuss mechan router support describ plausibl implement mechan scalabl perform demonstr implement prototyp argu technolog level differenti servic servic provid offer restrict differenti servic rudimentari offer network introduct transform internet import ubiquit commerci infrastructur creat rapidli rise bandwidth demand significantli chang consum expect term servic servic provid evolv network higher higher speed plan introduct servic address vari requir custom internet servic provid maxim share costli backbon infrastructur manner enabl control usag network resourc accord servic price revenu potenti trend rapidli rise bandwidth demand rise differenti result intens effort build fast packet forward engin effort defin mechan servic differenti build fast forward engin address varieti wai discuss section paper focu router capabl fast forward provid servic differenti gener flexibl model servic differenti restrict specif servic differenti discuss industri research forum gener model discuss detail router mechan provid differenti servic discuss architectur constraint provid differenti servic fast import compon packet buffer manag schedul support differenti servic network element level discuss implement draw experi gain prototyp implement theme network element technolog viabl incorpor mechan provid differenti servic high speed implement restrict servic offer simpl scheme encod bit ii differenti servic compani multipl site isp provid connect site scenario expect servic similar obtain line network mean corpor site commun share interconnect backbon perceiv perform equal line minimum capac traffic site affect traffic user share network queu delai congest occur traffic gener individu load gener isol traffic custom provid minimum bandwidth custom specif custom isp servic determin bandwidth requir satisfi base traffic line addit flexibl manner intern access bandwidth desir defin level servic type traffic manner custom ftp web transfer low servic provid aggreg multipl flow type custom defin queri high servic provid ensur good perform give traffic type prioriti minimum bandwidth custom bandwidth custom requir extrem reliabl predict perform small set applic requir network dynam reserv exact bandwidth specif delai bound indic explicit signal resourc reserv protocol implicitli mean servic provid infrastructur capabl end user possibl servic requir scenario gener guidelin user servic provid requir design router mechan support differenti servic custom requir custom network provid behavior addit bandwidth custom typic consolid exist network connect site singl connect ad flexibl divid bandwidth manner intern user traffic type effect support applic lan web internet time alloc bandwidth flexibl intern user servic provid requir meet custom servic provid maxim share multiplex infrastructur maxim revenu advantag possibl statist multiplex servic provid identifi traffic belong custom differenti conjunct provid differenti servic manag revenu traffic account bill servic level assur charg appropri servic provid flexibl distinguish servic provid tailor servic offer competit manner impli router control resourc share permit servic provid maxim util network meet custom requir current internet architectur preval internet servic model model send prai model permit user obtain matter critic requir matter pai servic internet commerci model differenti satisfactori isp mean meet exist market demand internet architectur success servic model adequ current internet architectur evolv network provid reliabl link thousand user internet intern network million user control mechan origin implement prevent congest depend cooper user network infrastructur incorpor mean differenti sever specif portion network network bandwidth network lightli load order support differenti servic select custom achiev time commerci reli cooper dispar user congest control desir assum user cooper slow transmiss rate congest detect assum cooper behavior lead network mean isol traffic user enforc cooper problem end user ignor expect correct usag tcp transmiss disabl mechan due incorrect degrad perform compli user malici user easili degrad network perform rout traffic specif path local congest recent report attack number applic udp congest control optim adapt congest manner applic transmiss rate lossi period introduc forward error correct behavior quickli lead poor perform user network suffici mechan isol penal user improv effort argu effort good provis form differenti desir overload part network popular web site heavili event account traffic engin router mechan treat custom differ event resourc give reason servic provid form differenti requir network state inform requir translat memori requir process power major instal router architectur experi dramat perform mechan ad provid sophist differenti featur safe assum exist implement sophist function network imposs speed requir prohibit commonli held belief sophist end system core network simpl shift incorpor intellig network current discuss differenti servic assum edg router core network smart classifi packet user requir sophist differenti servic tradit router limit term differenti recent research advanc hardwar capabl provid mechan overcom limit router tool provid differenti servic base oper high packet classif distinguish packet group requir buffer manag determin buffer space kind network traffic packet discard case congest packet schedul decid packet servic order meet bandwidth delai requir type traffic implement made develop area schedul result simpl effici algorithm manag complex schedul algorithm implement atm switch show implement high speed packet small atm cell state inform manag aggreg protocol specif inform context argument flow numer backbon inform maintain tcp flow continu router queue provid support ten thousand perform requir higher number tcp flow met advantag statist multiplex argument rout packet classif oper valid research area fast effici algorithm scheme examin complet inform ip packet header method classif combin fast switch remov process bottleneck tradit router iii process model forward engin describ architectur featur ip forward engin design provid differenti servic show tradit router architectur offer differenti present rout architectur design specif requir mind forward engin identifi context determin hop ip assign packet buffer output link bandwidth forward engin prime point control determin manner packet handl router requir oper requir differenti servic maximum delai header process larger delai packet servic class delai experi header process determin servic level accord packet violat servic assur prior header process toler delai packet circuit emul type architectur queue impli packet header process traffic depend router method forward packet justif packet arriv tempor correl group connect flow packet belong connect arriv packet belong connect expect arriv futur definit connect sequenc packet sourc destin interarriv time reason favor architectur packet internet initi applic form connect expect packet applic process slow path analyz complet header header packet insert cach hash tabl action appli packet packet applic subsequ packet flow action determin directli cach hash tabl main problem current backbon number connect activ interfac extrem high recent studi shown interfac averag connect activ concurr hardwar cach extrem fact hardwar cach requir cach size implement hash tabl hash tabl scale size lookup time hash tabl averag case perform hash tabl poor multipl header hash locat number bit packet header typic hash tabl limit coupl million entri hash function randomli distribut bit kei header bit hash index knowledg distribut header valu packet arriv design good hash function trivial due larg number connect simultan activ router due fact hash tabl gener good hash arriv perform cach base scheme heavili traffic depend larg number connect arriv slow path system implement complet header process temporarili overload result queue packet process intellig mechan appli buffer schedul packet header process inform destin packet field relev differenti packet servic qualiti violat happen due fast path slow path fast path switch fabric output buffer output buffer slow path fig queue model system architectur packet process forward process overload due output link congest illustr model figur packet arriv interfac queue process packet classif lookup oper forward outgo interfac queu transmiss interfac idl packet destin interfac wait input queue packet destin output block slow path process modul packet destin output output remain packet buffer transmiss system suffer type block limit router throughput substanti note tradit block problem input buffer switch knowledg destin packet queue fundament problem system figur context packet queu header process imposs appli intellig queue mechan input queue form block elimin commerci internet infrastructur robust provid predict perform time variat throughput forward engin base traffic pattern undesir network vulner attack malici user block refer tradit block switch fabric output interfac idl packet destin interfac wait input header process buffer user group user discov limit hash algorithm cach gener traffic pattern forc router slow drop larg portion packet arriv interfac claim packet queue delai accept header provis differenti servic robust import process principl appli header process oper enabl router determin servic level accord packet larg queue form wait header process oper violat servic assur router determin servic level accord connect implic design forward engin perform forward engin determin true maximum packet process rate averag case perform averag traffic arriv averag case perform determin support packet process buffer process varianc process time header process function delai buffer servic assur violat criteria packet process system constraint list criteria capabl fast router router fast support link internet servic provid envisag build network link capac forward engin router process packet arriv physic interfac recent traffic studi shown packet smaller typic tcp packet size byte half packet byte tcp acknowledg tcp control segment forward engin buffer absorb variat process oper packet small byte mean forward engin provabl small process time independ traffic pattern process engin backbon perform classif packet filter oper oper order make router network manag packet filter rout oper base aggreg rule aggreg memori access domin factor determin execut time oper high speed process algorithm amen hardwar implement overview router architectur give overview popular router architectur show fail meet requir dual differenti servic singl processor share bu gener router base singl cpu intellig realtim oper system choic architectur fact protocol time constantli chang oper meant router optim specif protocol establish maintain connect import high forward capac router consist comput multipl interfac card interconnect share bu packet arriv interfac forward central process engin determin hop address back outgo interfac packet transfer share interfac card processor outgo interfac card rout control protocol implement forward engin perform router depend heavili throughput share bu forward speed main processor singl processor perform multipl select oper system critic import lot emphasi sophist design oper system architectur scale meet throughput requir interfac card multipl processor share bu straightforward improv introduc gener router distribut forward comput packet transmit share bu interfac card intellig addit fast cach process packet local time packet connect forward main forward engin cach entri ad interfac card cach subsequ packet connect forward directli interfac cach entri basi basi argument number connect number rout larg network core highest forward speed true packet destin part network local specif subnet packet distribut router network architectur traffic depend throughput share bu bottleneck memori size cost distribut interfac card enhanc larger memori complet forward tabl copi interfac card approach enhanc perform router share bu gener cpu scale high capac link provid traffic pattern independ throughput multipl processor space switch gener router design allevi obviou bottleneck gener router congest share bu replac switch fabric provid suffici bandwidth transmit packet interfac card throughput order magnitud forward path interfac card bottleneck bottleneck packet process gener router architectur gener cpu design handl larg link capac share parallel processor space switch nice concept parallel packet process scale process speed introduc basic observ highli interfac bottleneck time share forward engin port densiti router share processor architectur present figur forward engin resolv address result address resolut back interfac card subsequ forward packet outgo interfac note packet header high speed interconnect interfac card forward engin router control fig router architectur multipl parallel forward engin separ interfac card load balanc mechan attempt equal process load forward engin forward forward engin elimin unnecessari packet payload transfer switch fabric packet payload directli transfer interfac card forward engin control specif destin forward engin ad reach forward capac backbon assumpt architectur singl processor handl peak throughput interfac process pool share multipl interfac time requir process packet depend actual load forward engin load balanc mechan transmiss trigger tcp fast retransmit degrad perform load balanc connect interarriv order magnitud packet arriv connect assign load processor hard predict traffic gener connect load balanc packet queu long period process violat servic assur connect claim number forward engin suffici larg free forward engin clear note copi forward forward engin consist architectur discuss architectur present router architectur scale architectur studi process signal protocol load balanc scheme detail analysi present larg forward speed provid traffic independ bound process time made process element perform specif task easi router optim packet process evid link capac differenti servic stretch processor base architectur limit multiprocessor previou attempt address issu forward engin perform packet process packet arriv set link develop econom effici solut base function partit packet process process element optim specif task oper traffic independ manner step approach identifi main function forward process kei function discuss detail subsequ buffer forward packet switch fabric appli filter packet classif determin hop packet forward creat rout protocol determin outgo interfac packet specif link layer address queue packet queue base classif rout tabl schedul packet transmiss outgo link meet servic requir process function input packet header data structur creat rout network process element execut access packet header data structur multipl processor forward packet packet complet process data structur processor synchron problem achiev perform analysi problem context process signal packet requir access data local refer data structur requir processor processor forward engin physic interfac schedul filter processor rout lookup buffer switch interfac fig process architectur parallel achiev partit forward function processor forward inform data memori requir larg gener slow easier exploit special requir packet process perform reduc cost architectur shown figur packet arriv interfac process function split multipl processor processor handl packet process function forward forward function processor requir processor perform type processor data structur function inform relat forward processor memori requir processor smaller faster cheaper special task processor perform make high local refer program memori access addit advantag architectur assign process unit connect discuss multiprocessor assign load balanc disadvantag point flow identif requir store packet output link queue import oper system diminish processor singl process element dedic function higher throughput applic specif integr circuit replac process element easili natur processor enabl effici hardwar implement note combin architectur multipl architectur minor problem commun interfac processor add addit constant latenc packet forward subsequ individu function implement traffic independ manner backbon link rate architectur support twin requir high speed differenti servic variant architectur develop implement part bell lab router project router design process engin process million packet process element implement gate arrai system speed obtain high throughput differenti servic featur low clock speed evid scalabl architectur iv rout tabl long rout tabl consid challeng oper perform forward process problem defin search data base destin prefix locat longest prefix match destin address packet longest prefix match introduc consequ requir number network address rout approach longest prefix match tree modifi patricia tree combin hash tabl algorithm complex proport number address bit rout complet microsecond memori result forward rate million packet greater time requir lower wast memori space earli implement afford comput router reli connect rout cach cach base result unpredict traffic depend perform rapid growth clear anymor effect cach network backbon recent research result faster solut stratifi trie algorithm van emd boa util de van algorithm point problem restrict discret valu number bit requir repres rang techniqu recent context rout tabl main idea creat perfect hash tabl prefix prefix length binari search prefix hash tabl search prefix find longest prefix match time algorithm fast execut calcul perfect hash slow slow updat eleg approach basic principl creat small compress data exploit actual entri space rout tabl repres larg tabl small amount memori result lower number memori access fast memori faster algorithm calcul perfect hash updat rout tabl easili approach implement compress minim complex updat present packet filter classif import requir forward engin support differenti servic abil identifi context packet appli action satisfi servic requir mechan support function term packet filter packet classif tradit applic packet filter provid secur function import support differenti identif classif packet origin specif applic provid resourc meet differenti servic requir larg scale packet filter function enabl edg core router support differenti servic flexibl restrict servic offer base interpret bit packet filter larg portion packet includ inform transport forward made base set rule defin network manag softwar reserv protocol action industri forward base transport protocol inform refer forward packet filter appli includ tradit secur drop unauthor redirect packet proxi action relat rout destin address sourc sourc port destin port desir attribut packet filter filter rule appli rang port restrict exact match rule appli aggreg number rule manag filter algorithm handl exact preprocess translat rang filter rule exact valu size rang grow exponenti length packet field rang defin rule assign explicit prioriti order resolv conflict rule overlap gener packet classif problem gener packet classif problem view point locat problem set object repres filter point space repres arriv problem find object point classic problem comput geometri numer result report literatur gener case problem packet algorithm time space complex space algorithm complex bound directli packet filter illustr assum router process rule dimens sustain million packet algorithm log execut time space requir memori access packet impract current technolog time space space requir prohibit larg rang gigabyt algorithm address problem arbitrari overlap packet filter high speed constraint problem appli router sketch idea prototyp implement interest reader refer detail implement algorithm simpl approach problem packet search idea state origin queri intersect number simpler queri challeng obtain problem intersect step time requir bound point log solut packet filter practic applic thousand emploi parallel sort requir simpl element oper make algorithm amen hardwar implement algorithm asymptot interest queri intersect fast cost thousand memori feasibl current technolog rule repres object arbitrarili overlap preprocess step algorithm project edg object axi worst project result maximum interv number classif rule associ set rule dimens rule belong set rectangl overlap interv set correspond note method interv rectangl half interv locat interv ax point repres arriv packet set locat highest prioriti rectangl cover point simpl intersect oper algorithm implement dimens bell lab router prototyp singl fpga devic synchron chip support rule process million packet worst case achiev devic run low speed mhz memori chip person cost memori low devic gener processor handl part ip forward function improv algorithm present process filter rule million packet clock classif dimens classif problem import evolv internet architectur similar reserv offer servic specif clear reserv base model scale oper backbon larg number flow concurr activ altern approach rout aggreg flow specif traffic engin path direct rout base destin address sourc address similar reserv protocol set aggreg rout rule kei mechan support scheme core router classif lookup scheme determin resourc packet function sourc destin address classif traffic engin multicast forward requir lookup base sourc address multicast group problem restrict case gener classif problem rule dimens destin defin term prefix rule overlap prioriti rule resolv conflict ip interest solut scale hundr thousand entri interest perform algorithm avoid queue header process order provid servic assur fast algorithm problem present shown number prefix length filter number memori access make process million packet mhz clock speed combin fast filter dimens base rout widen rang option feasibl evolv current internet internet futur capabl provid custom differenti servic restrict filter edg simpl oper bit ip packet header vi resourc manag previou section discuss process scarc router manag meet differenti servic requir internet import principl queue principl consequ architectur choic engin critic resourc output link bandwidth coupl manag output link bandwidth buffer alloc section bandwidth buffer manag buffer bandwidth alloc jointli address schedul dynam bandwidth alloc opportun flow link access flow wait packet opportun wast schedul retain lost opportun credit futur adapt import provis transmiss opportun coupl proper buffer alloc ensur flow link access opportun achiev desir level link share desir level link share set class packet administr mean dynam reserv protocol packet filter mechan map arriv packet class schedul determin sequenc packet transmiss link account desir link packet class histori recent servic sequenc fair queue schedul summar system distinguish type flow impact flow packet arriv rate independ past schedul exampl udp traffic video audio stream bandwidth requir flow set provis establish signal provis aggreg requir amount bandwidth assur flow type site network bandwidth establish signal set aggreg reserv irrespect resourc control mechan requir node enforc reserv adapt flow adapt transmiss rate base schedul made recent past tcp flow adapt flow constantli link mbp cbr voic svc queue select class traffic fig applic hierarch link share node shape virtual clock fair queue schedul probe bandwidth transmiss rate network bandwidth adapt tcp flow loss sensit requir care buffer manag schedul buffer manag point discuss buffer manag detail paper requir commerci internet differenti servic model support infrastructur serv user requir candid scheme bandwidth alloc meet differenti servic requir hierarch link share hierarch weight fair queue discuss hierarch link share hierarch link share flexibl resourc manag scheme partit resourc level aggreg initi expand hierarch link share partit bandwidth hierarchi class defin set flow specif packet belong packet travel specif subnet level hierarchi made lowest packet individu applic hierarch link share illustr figur main idea link capac partit administr domain partit base applic type step bandwidth applic type partit individu flow type view model link capac partit class bandwidth traffic class partit administr domain individu flow prototyp implement hierarch weight fair queue extra advantag scheme hierarchi level make implement simpler model present theori shape server node hierarchi shape server node hierarchi share excess bandwidth node shape traffic bandwidth alloc node hierarchi shape virtual clock ideal shape base fair queue fair distribut bandwidth compet class algorithm shape server data structur advantag gener mechan explain assum administr domain support type constant bit rate administr give voic traffic full prioriti traffic level servic assign schedul weight shown figur assign virtual clock schedul cbr fair queue schedul effort traffic domain mechan traffic excess bandwidth class domain assign bandwidth high prioriti voic traffic effort traffic servic voic traffic present assign weight level effort servic advantag scheme algorithm provid varieti servic administr domain applic question aggreg flow level implement queue larg number flow deriv advantag flow isol benefit queue enhanc tcp perform combin queue buffer manag benefit discuss detail scalabl queue prevail assumpt queue prohibit router state flow hundr thousand activ flow network backbon notion activ flow flow activ long interarriv time packet sourc destin notion studi mechan ensur small number packet forward slow path handl cach fast path problem basi maintain flow state schedul queue scheme overli conserv maintain state activ flow provid fair queue extrem situat type state queue mechan weight individu flow inform servic offer flow provid differenti weight establish set flow characterist individu flow differenti tcp flow tcp flow packet filter function perform differenti typic filter rule classifi flow class separ class flow weight class flow queue enabl queue mechan isol flow desir differenti discuss state inform provid isol requir maintain state activ flow ideal weight fair queue weight fair queue schedul emul system constraint packet system ideal fluid flow packet infinit flow simultan serv rate proport assign weight instantan servic offer individu flow determin weight assign flow weight assign flow schedul state flow number flow limit number flow state maintain limit number determin buffer avail weight fair queue packet schedul emul ideal maintain state inform system inform relat state packet system packet schedul emul system packet flow serv time set flow refer fluid system set flow packet system complet disjoint maximum state inform packet fair queue system maintain approxim system lower number activ flow class schedul defin simpl mechan extract state system actual state packet system inform schedul packet packet system schedul associ function flow call connect track normal servic offer connect connect activ system potenti track normal servic offer flow current system busi period flow newli flow potenti calcul maximum previou system potenti type bound differ connect potenti flow system potenti addit state maintain small subset flow past case fair queue system potenti larger connect potenti flow state maintain flow detail ideal weight fair queue schedul worst number flow equal number packet system assum router support link assum averag packet size byte assum buffer size easi verifi maximum number flow router reason number current technolog normal servic defin ratio offer servic alloc bandwidth limit buffer manag tcp control traffic constitut compon internet natur incorpor mechan router enhanc tcp perform gener criteria act guidelin long tcp flow larger obtain link share close desir short small queue delai tcp flow telnet flow achiev good tcp perform presenc tcp control manner unfair tcp sourc link util high tcp observ traffic tcp creat bursti network traffic data transmiss tcp ack clock ack bunch fifo queue creat bursti tcp bursti due doubl window size time loss phase lead poor throughput buffer equal approxim bandwidth delai product avoid loss phase throughput long gener accept buffer equal bandwidth delai product larg packet queue larg burst file transfer experi larg queue delai mechan red good separ sourc tcp inher unfair connect trip time unfair bad squar time impli activ buffer manag router allevi unfair suggest reason buffer manag tcp window synchron lead poor oscillatori link util reduc synchron buffer manag random loss tcp assum loss congest loss reduc transmiss rate tcp throughput vulner explain case link share class fair link share loss fix throughput squar product loss sensit slow path ack path congest sensit proport ratio transmiss time ack packet path data packet forward path random loss transient fast fluctuat traffic uncontrol udp traffic buffer manag protect tcp sourc loss sourc react loss reduc transmiss fast tcp fair queue suffici achiev tcp perform fair queue fair flow small window fair translat fair link share proper buffer manag conjunct fair queue ensur tcp flow share bandwidth fair manner control unfair manner goal tcp achiev high fair bandwidth share compet tcp protect conform connect malici reduc phenomenon tcp network traffic bursti smooth provid low latenc telnet applic tcp buffer manag absenc control achiev buffer manag packet discard scheme random earli detect goal lack state hamper goal achiev goal achiev combin queue buffer manag buffer manag fair queue divid buffer space red queue appeal buffer space wast drastic good buffer share buffer space flow red share buffer space break natur flow isol queue tcp connect affect tcp unfriendli sourc uncontrol buffer usag flow lead unfair solut give flow nomin reserv buffer space nomin alloc set proport weight ratio bandwidth time flow buffer usag exce reserv buffer space total buffer occup exce global threshold packet arriv packet buffer push candid queue elig queue occup nomin alloc candid pick queue excess occup longest deviat nomin reason pick longest queue tcp flow short time high bandwidth usag longest queue nomin window grow faster flow longer time allevi unfair long time connect drop packet longest queue flow long queue longest trigger tcp fast retransmit featur faster reduc length congest episod improv link util improv fair fifo reduc chanc window synchron mechan drop ack case ack tcp ack cumul elimin chanc retransmit packet lost loss retransmit packet lead tcp consequ loss throughput buffer manag scheme protect tcp sourc tcp unfriendli flow buffer applic reliabl multicast congest control applic adapt traffic manner prefer compli tcp congest control buffer manag elimin applic aspect buffer manag tcp larger initi window speed complet short affect tcp flow protect sourc protect buffer manag scheme tcp sourc illustr figur figur show fraction link bandwidth persist tcp sourc share link sourc offer load cbr src link fig aggreg throughput tcp sourc share link constant sourc send rate unfriendli sourc vari link bandwidth consist overload produc buffer manag drop strategi stronger impact bandwidth share schedul polici sourc fair queue global red similar perform degrad longest queue drop figur denot approxim longest queue fair queue schedul perfectli maintain rate irrespect flow total loss insensit figur show coeffici variat throughput tcp flow share common link red buffer manag scheme previou section buffer manag scheme fair red implement issu long stand assumpt implement larg scale queue hierarch link share reason cost current technolog implement queue hierarch link share bell lab router shown implement mechan scale high speed primari limit appli intellig buffer manag schedul mechan process element perform fraction integr throughput buffer ms fig coeffici variat versu buffer size tcp differ time schedul random earli fair queue random earli fair queue longest queue drop fig bell lab router prototyp tion header process limit throughput function distribut process function basi shown figur throughput function state inform queue prohibit assum bell lab router shown figur demonstr queue hierarch link share scale backbon singl fpga devic run support output link capac vii switch fabric switch fabric design studi context atm network detail discuss switch fabric design issu omit breviti kei point mind transport fabric servic preserv manner viii discuss internet evolut effort network network servic import topic interest type differenti servic servic provid provid possibl encod bit set canon differenti servic type incorpor mechan network infrastructur clear simpl evolutionari approach satisfi differenti servic demand point view paper incorpor router mechan addit enabl simpl differenti servic enabl sophist servic requir mechan header process wire queue packet classif rang match field larg number extend rout lookup sourc destin base lookup flexibl gener schedul buffer manag techniqu mechan flow isol switch fabric capabl preserv servic mechan router aggreg custom flexibl isol individu custom alloc resourc customiz manner permit isp custom servic offer suit custom demand offer servic virtual privat network custom servic virtual restrict router function simpl differenti servic possibl due technolog constraint current technolog enabl sophist differenti servic offer level thought practic acknowledg author member bell lab router team build prototyp router encompass idea discuss paper contribut refer high speed switch schedul local area network acm transact comput novemb digit system research center technic design ip router technic report bell novemb ip router journal bennett zhang hierarch packet fair queue algorithm acm page palo august de van point locat rectangular journal van emd design implement effici prioriti queue mathemat system boyl extens aggreg data flow internet kk zhang recommend queue manag congest avoid internet internet march chazel search histori inform chazel friedman point locat hyperplan unidirect rai shoot comput theori fm perform implement architectur input output buffer larg fast packet switch technic report june fm jg vp kumar scalabl switch solut broadband network ieee commun decemb kc internet traffic phd san clark servic alloc profil internet zhang support realtim applic integr servic packet architectur mechan acm sigcomm page august kl clarkson applic random sampl comput geometri discret comput pink small forward tabl fast rout lookup acm septemb shenker analysi simul fair queue algorithm research rout prefix transact februari wei protocol independ multicast mode protocol specif rfc june fuller al rout june dc improv gatewai perform cach ieee march floyd jacobson traffic phase effect packet switch gatewai research septemb floyd jacobson random earli detect gatewai congest avoid transact august floyd jacobson link share resourc manag model packet network transact august tv huang parallel architectur process network signal protocol transact page decemb sj fair queue scheme broadband applic ieee infocom page april jain packet train measur model comput network traffic ieee journal select area applic sampl methodolog network traffic acm page septemb tv perform network high product random loss transact june tv error recoveri flow control slow acknowledg studi perform ieee japan april tv tj strategi tcp atm control featur ieee infocom page san tv polici base forward effici rang match acm septemb li provid architectur differenti servic traffic engin internet lin morri dynam random earli detect acm septemb achiev throughput switch page march flow label approach atm ieee page san april nichol blake differenti servic oper model definit februari tj stationari behavior ideal tcp congest avoid overmar af van der rang search point locat fat object journal van emd boa preserv order forest logarithm time ieee confer foundat comput page parekh gener processor share approach flow control singl node case infocom volum page partridg local rout cach nsf workshop internet statist measur san februari dd clark observ dynam congest control algorithm comput commun page octob rout tabl berkelei unix technic provid bandwidth switch infocom april design analysi fair traffic schedul algorithm network acm sigmetr page gener methodolog design effici traffic schedul shape algorithm ieee page design methodolog fair queue algorithm transact april tv design support tcp queue ieee san tv effici activ queue manag internet router interop engin la gj wilder traffic pattern characterist ieee decemb fast packet switch architectur broadband integr servic digit network novemb longest prefix search compress tree technic report bell deer distanc vector multicast rout protocol june scalabl high speed ip rout lookup sigcomm septemb zhang architectur packet switch network protocol phd mit comput resourc reserv protocol ieee septemb dd clark observ dynam congest control effect traffic acm page
Agents/1495 1 network agent frederick michael dyer ucla comput lo ca abstract paper describ robust neurocontrol group agent perform construct task enabl agent balanc multipl perform sequenc action surviv build patch develop agent build structur build materi found continu environ consist circular object call disc agent complet sequenti build task perform task drink predat order perform construct task import agent neural control mechan balanc multipl robust conflict resolut opportun agent perform long sequenc action agent find object grasp find locat drop object agent detect problem includ agent fail complet action prior state sequenc undon problem agent return earlier step sequenc correct problem agent carri disc back stop drop disc carri order drink agent longer carri disc find return pile site agent make adjust behavior order advantag opportun agent carri disc destin pass eat food encount paper describ architectur neural network enabl agent perform construct task exhibit properti task algorithm order test agent agent specif construct task agent algorithm execut control section describ task algorithm agent complet agent construct task build straight build corridor build patch agent handicap lack cognit map lack sophist sensor detect geometr relat agent locat specif color research locat kei posit construct wall construct wall set contigu disc stretch gener direct corridor parallel intersect wall meet form cross corridor patch arrang heavi disc pattern gap disc gap larg agent pass small prevent entri larger predat build agent construct pile raw materi addit agent materi construct wall start singl disc wall built start point pile disc figur agent set locat initi disc sa sa wa wa figur schemat algorithm action color purpl disc mark orang disc red disc rs agent bring red disc pile mark brown disc agent orang disc closest purpl disc agent motion dash arrow show work disc build materi find red carri singl brown disc brown disc mark place gather build materi brought red disc brown drop red disc color orang orang color signal agent materi readi construct disc left build agent build red disc red disc color brown pile build agent build brown disc inadvert brown pile marker form part wall orang pick purpl disc singl purpl disc environ start wall builder orang disc purpl disc color orang purpl color disc purpl builder inadvert disassembl part wall build wall color orang disc purpl disc ad wall agent wall end carri orang disc patch construct build agent divid group group pair heavi disc bring back spot patch brown group color disc purpl leav touch disc patch proper distanc disc group pair stai patch adjust agent patch disc futur predat agent patch agent work move disc figur schemat partial complet batch agent bring disc patch agent adjust posit disc agent complet portion patch hide predat disc brought group adjust posit purpl disc distanc disc part color disc brown make perman part patch patch offer protect disc make patch heavier potenti predat move heavi disc requir agent carri back patch adjust builder adjust group divid lead assist agent make cooper easier lead agent locat disc pick wait assist pick disc leader guid disc locat figur show builder disc adjust pull purpl disc back brown disc lead builder approach red disc touch red pick color disc orang wait orang color sign assist builder disc heavi assist builder arriv agent pick disc lead builder move brown disc lead builder push assist builder lift agent disc arriv brown lead builder color disc purpl indic adjust agent disc posit adjust lead builder begin sequenc approach larg red disc assist builder begin approach orang disc lead agent find lift orang color red agent disc builder recogn red disc lift approach agent move assist hold lead builder move result agent avoid move opposit direct cancel assist builder continu lift disc detect disc point begin sequenc intersect construct commun build intersect environ agent builder mark twelv disc locat intersect disc mark junction outer disc mark direct corridor wall grow move agent signal wall agent build gener simpl signal label signal specif mean builder agent build wall disc color agent find piec materi environ bring disc color instruct agent bring raw materi drop color color disc agent build wall agent build creat intersect neural network architectur construct agent neural network consist connect activ node calcul sum product pair input individu ji ji node activ valu visual tactil sensor set action perform base activ motor node set visual receptor node color set blue set red disc set consist sensori left portion corridor agent figur schemat partial complet intersect agent shown build wall center agent disc time construct wall agent assign agent motor node goal node sensor node node detect sequenc node figur agent network subnetwork connect dark visual center portion weight network divid layer control singl node input connect control node modul amount effect agent behavior higher control lower chang activ control node top sequenc input detect output goal network touch red disc hold red disc disc held touch brown disc approach brown disc hold disc approach red disc hold color disc orang figur sequenc network hand approach similar order perform complic sequenti behavior section agent perform action correct order control sequenc sequenc sequenc node shown modul activ pass detect node goal node detect part detect detect condit environ goal node control goal enabl agent achiev approach red disc sequenc shown figur agent begin hold detect node state feed activ approach red disc goal node agent approach eventu touch red disc touch red disc node spread activ hold disc node touch red disc hold node lose activ hold red disc agent hold disc approach brown disc agent arriv brown color disc carri orang longer hold red disc stop hold drop longer hold disc held touch brown lose activ hold restart sequenc notic goal failur state detect node agent automat move back prior place sequenc agent sequenc construct surviv skill find food sequenc node activ research start simul determin structur agent build figur show goal touch red disc activ hold red disc turn left move forward turn red disc left red disc red disc center approach red disc touch red disc red disc left red disc center red disc touch front figur approach purpl disc network touch red disc detector connect touch front ensur agent red disc touch disc connect sensori node connect effector agent move red disc approach red disc activ agent red disc connect red disc left turn left agent turn left multipl red disc activ reach turn left turn action parallel turn cancel agent end move forward slight turn whichev side stronger activ red disc slightli agent turn eventu head disc curv path resolv conflict level similar braitenberg vehicl approach red disc node repres agent goal approach red disc make connect red sensor node effector stronger agent red agent move red collect goal control agent approach object environ detect detect node input sensor node activ state extern world detect figur show touch red disc node touch red disc activ agent touch red disc connect perform conjunct visual tactil input goal node ti approach red disc goal control agent move red disc make commun difficult order build desir enabl give command worker build command wall build order sensor bind turn left move forward turn purpl disc left bind red bound color approach disc purpl bind purpl disc center purpl disc red disc center red disc red disc left figur portion bind bind red agent approach disc bound color give step sequenc capabl refer set color bind color variabl refer variabl bind figur set bind node bind red bind make color variabl approach disc bound color node agent approach disc color bind node activ bind red connect activ pass red disc sensor node sensor bind node approach disc bound color act approach color sensor bind node input bind bind blue agent approach blue disc bind red bind blue approach disc bound color move agent blue red disc sensor bind node avoid detect simul result ran experi construct initi mark raw build water environ gather build agent maintain suffici level food water wall construct ran simul agent red disc build brown disc mark materi spur agent agent wall pile figur screen dump wall built red bring orang disc add wall agent portion screen shown figur screen dump patch purpl disc mark start water disc food disc world run wall emerg time maximum variat straight averag variat forag agent proce collect red disc drop brown disc agent build wall extend initi purpl disc brown disc wall uneven variat locat orang disc agent bring orang disc straight closest purpl deviat agent start posit deviat wall spur wall figur creat agent hungri carri orang disc agent drop orang disc agent pick back brought wall line food wall perpendicular line wall brown agent disc spur linear addit wall patch construct ran patch simul agent builder red brown disc mark start patch agent collect disc patch suitabl shown figur disc arrang patch figur intersect built area form enclosur intersect construct ran intersect simul agent builder disc locat intersect disc mark junction outer disc mark direct wall red disc intersect built time discuss network connect connect deriv principl behavior sensor goal orient connect combin goal sensor input choic action goal activ goal node combin activ sensor determin behavior goal node dynam modul output true sensor node connect learn weight reinforc discuss sequenc explicitli encod track order step explicitli similar set product rule action order sequenc preserv state environ agent perform sequenc virtu detect node activ network exhibit balanc multipl goal agent multipl goal node activ choic pursu goal product goal sensor inform satisfact goal opportun displai agent close disc satisfi weak goal agent move disc strong sensat overwhelm stronger goal agent perform sequenc simultan perform multipl interrupt sequenc import sequenc find food neural architectur control agent achiev sequenc goal agent intern sensori feedback advantag chanc occurr environ execut multipl action parallel achiev proper order behavior agent optim construct agent shortest rout emerg naturalist robust complet multipl agent work concurr distinct subtask acknowledg work support part intel research program grant author refer beer intellig adapt behavior experi comput academ san bishop neural network pattern recognit clarendon braitenberg experi synthet psycholog mit dyer neural network reinforc learner mobil agent continu environ technic report dyer learn mobil neural control architectur intern confer artifici neural comput mechan action select phd werner order neural connect motiv behavior choic intern confer simul adapt page
IR/1496 5 parallel preliminari investig mine web bilingu text philip resnik depart linguist institut advanc comput studi colleg md usa www home abstract parallel corpora valuabl resourc machin present avail util limit basic difficulti locat parallel text domin world languag parallel corpu resourc explor world wide host abund page parallel offer potenti solut problem uniqu opportun paper present step method automat find parallel translat document web techniqu conceptu fulli languag preliminari evalu result method accur appli human introduct recent year larg parallel corpora import role resourc machin translat multilingu natur languag lexic acquisit gale statist translat model brown inform retriev davi landauer languag parallel corpora special form unit nation religi text local version softwar manual top dozen major parallel corpora tend repres primarili text languag parallel corpora fee restrict data advic church mercer abandon balanc favor difficult parallel corpu resourc explor world wide host abund page parallel offer potenti solut problem uniqu opportun web parallel page multipl www gener candid pair candid pair candid pair filter translat pair evalu fig strand architectur genr content continu enrich languag chang modifi cultur context paper attempt explor sourc linguist content control parallel corpora todai paper present step method automat find parallel translat document web call strand translat recognit acquir natur techniqu conceptu fulli languag preliminari evalu result method accur appli human section lai strand architectur describ detail core structur base algorithm assess web page intend parallel translat section present preliminari section discuss futur work strand architectur figur strand architectur simpl pipelin pair languag candid gener modul gener pair identifi world wide web page parallel translat languag independ candid evalu modul behav candid pair translat modul filter appli addit filter criteria depend resourc end result set candid pair reliabl ad parallel corpu languag approach candid evalu paper side assess likelihood html document parallel uniform resourc address document resourc world wide web modul produc align document segment chunk text markup strand potenti produc parallel corpu addit parallel corpu qualiti align evalu candid gener present candid gener modul implement simpli queri submit altavista web search identifi web page hyperlink text url link altavista boolean queri queri english french locat home page academi american british imag identifi altern languag version flag franc link word visibl user queri locat page html markup page includ languag displai browser alt field img languag part url file imag french flag altavista queri succe identifi case numer step candid page return altavista automat process extract pair anchor ha line html sourc page distanc criterion captur fact web page point parallel link translat close case figur experi variant simpl method candid improv numer wai retriev greater number good candid make hypertext markup author languag web page strand approach applic discuss piec html document encod hypertext link typic includ url page link text user click url altavista page fig page link parallel translat issu queri seek document anchor queri altavista page french pointer captur pair connect link exploit parallel url directori url url pair refer parallel directori en fr fictiti server worth explor potenti candid pair initi gener reason set candid simpl approach work altern current candid gener modul explor futur work candid evalu core strand approach method evalu candid pair determin page consid parallel translat method exploit fact parallel page fill great deal ident html markup work bilingu text align establish reliabl linear relationship length text translat algorithm work piec ident markup reliabl point correspond comput align markup chunk document comput correl length chunk test correl decid candid pair identifi parallel text fig candid pair figur show fragment pair page identifi strand candid gener modul experi section english page spanish notic extent page layout unit text list correspondingli greater smaller length step candid evalu linear document candid pair run markup analyz act produc linear sequenc kind align linear sequenc approach align sequenc element current unix util fine job match ident start end token sequenc chunk token ident length minim differ sequenc document begin de si seat exit dune align linear sequenc threshold linear sequenc base mismatch page high proport mismatch align sequenc token side token token element document translat document includ great deal content proport high document prima faci bad candid translat pair candid pair mismatch proport exce elimin stage current set manual base experi develop frozen experi section experi evalu strand set unseen languag pair develop comput confid yn length align chunk token step equal virtual mean align segment natur languag text includ inflat correl align comput pearson correl coeffici comput correl textbook fashion note calcul number align text segment account note whitespac count chunk length fig scatterplot illustr reliabl correl length align segment good translat pair lack correl bad pair result threshold standard threshold confid correl obtain work retain threshold evalu section figur show plot real candid pair left pair illustr figur correctli accept candid evalu modul center pair correctli reject candid case mismatch proport exce pair correctli unusu correl lower statist reliabl larg number data point notic candid evalu scheme set align chunk token correspond align segment document pair evalu accuraci align left futur work filter experi filter candid pair shown high experi small number posit suggest automat languag identif remain candid pair weed remain high accuraci languag identif charact model requir modest amount train text languag interest evalu develop strand prototyp english french relev pair languag evalu code paramet ran prototyp english english pair web candid gener approach section gener candid document pair hit return altavista search lead set candid pair url met distanc criterion candid pair point ident elimin case page pair retriev server remain case consid set candid pair evalu evalu candid pair determin repres true translat pair criterion determin pair page intend provid content admittedli judgment gener includ url appendix reader judg strand prototyp perform test set candid evalu modul identifi candid pair true correct filter modul correct languag identif elimin give filter evalu algorithm identifi true translat recal manual assess translat pair retriev algorithm suggest repres expect find page vari wide proport usabl parallel natur languag text comparison found yield genuin parallel text content languag translat encourag reader form judgment page identifi appendix futur work present difficult estim pair translat page exist world wide web fair great number web continu expand method candid gener paper make candid pair encod pdf document exclud priori strand capabl limit html quickli locat candid pair build web principl fact entir set page web sourc candid gener preliminari figur recal suggest larg parallel corpora acquir web small human filter accur filter base languag section reduc substanti reduc recal true document pair addit area investig futur work addit evalu titl result preliminari strand approach evalu languag larger candid independ evalu order accur estim upper bound reliabl judgment candid pair repres true translat evalu vari task suffici genuin translat pair web suffici high recal focu maxim altern approach candid gener discuss section topic investig scalabl implement fashion combin shell evalu candid pair approxim candid sun ultra workstat megabyt real page resid disk local network local workstat exclud retriev time page evalu million retriev candid pair exist prototyp week real time strand easili run parallel arbitrari number prototyp reimplement order obtain main bottleneck time spent retriev page trivial compar manual construct corpora real strand run continu constantli extend cost retriev amort long period segment align discuss section candid evalu modul strand set align text segment qualiti align compar altern align algorithm base collect addit filter primari goal work obtain heterogen filter document pair applic restrict attent document pair conform genr belong topic strand architectur figur amen addit filter modul document classif incorpor pipelin filter stage dissemin text web gener intend public nonetheless protect copyright corpu collect strand legal distribut straightforward legal constraint prevent multipl site run version site distribut list url retriev implement relat approach care observ protocol govern automat program agent web final interest question futur work parallel corpu drawn world wide find possibl linguist corpu offer opportun compar work lexic potenti provid rich realiz underli semant content perspect corpu obviou resourc acquisit translat lexicon deriv word mean interest possibl link seemingli end web acknowledg work support part contract depart contract research grant sun microsystem laboratori grate dan doug david traum discuss data url interest reader find appendix complet test set section strand classif author judgment refer della della statist approach machin translat comput introduct special issu comput linguist larg corpora comput trec evalu queri translat method text retriev fourth text retriev confer nist statist identif languag comput research laboratori technic memo mcc mexico state la mexico identifi word correspond parallel text fourth darpa workshop speech natur california program align sentenc bilingu corpora annual meet associ comput california compar languag identif scheme intern confer statist analysi textual data itali fulli automat document retriev latent semant index sixth annual confer uw centr oxford english dictionari text pp page uw centr text ontario ldc linguist data consortium home page world wide web page geometr approach map correspond confer empir method natur languag pennsylvania automat discoveri compound parallel data confer empir method natur languag process brown model translat irc technic report pennsylvania text retriev research usa delo workshop european research consortium informat mathemat acquisit translat lexicon confer appli natur languag dc bibl parallel annot
HCI/1497 4 extens scalabl content adapt pipelin architectur support heterogen client thoma georg lo angel parallel comput laboratori lo ca abstract import middlewar content adapt demonstr applic paper scalabl middlewar compon call content adapt pipelin perform content adapt arbitrarili complex data type limit text graphic imag architectur part web browser work leverag xml languag uniform mean describ element includ client devic user data transcod oper perform result adapt data illustr flexibl architectur support data type adapt oper show data medic applic extend capabl handl anim graphic stream data demonstr scalabl architectur execut content adapt pipelin distribut set server run effici protocol introduct mobil devic escal client heterogen high client devic todai vari drastic wire workstat mobil person digit assist connect cellular data modem account variat devic result combin make approach uniform data distribut client ineffect paper build foundat previou effort investig necess adapt data fit vari client research develop extens scalabl architectur call content adapt pipelin perform content transcod distil extens content adapt emerg vital topic ubiquit comput due necess handl softwar hardwar requir heterogen client make idea concret demonstr relev implement cap architectur context interact mobil applic support heterogen client research project work fund nation scienc foundat award adapt middlewar network support nomad goal creat softwar hardwar infrastructur support wireless comput mobil physician applic server act repositori user work number client client machin vari cpu displai storag network instal runtim characterist typic legaci system specif design provid servic client heterogen devic characterist address architectur middlewar server layer provid content adapt effect serv heterogen data object present chang suggest research work graphic imag fit network displai limit client machin reduc colour reduc crop portion previou work involv adapt data type imag text predominantli current web content paper address broader describ extens scalabl content adapt architectur handl varieti data object store repositori applic server request heterogen client devic web page typic data object type multimedia sound imag system capabl support arbitrarili complex data incorpor hook softwar packag architectur handl futur type implement ad type system run www interact http architectur requisit activ adapt separ function collect client identifi characterist data heurist gener command adapt produc result adapt data demonstr implement middlewar system perform content adapt benefit medic client applic call teach file middlewar execut portion content adapt pipelin leverag exist java librari xml languag uniform mean describ data stage architectur modular architectur expand support data type client devic illustr pipelin flexibl show origin intend proprietari teach file medic data extend capabl transcod anim ing data insur approach scale design content adapt pipelin oper distribut set server run effici protocol paper discuss background research project relat detail content adapt pipelin compon provid inform implement extens handl data type initi anticip address issu describ multipl middlewar server aggreg improv perform high load quantifi design perform varieti experi gather perform shown conclud work background relat work project collabor effort ucla medic school comput scienc depart doctor technolog access medic record legaci time hospit equip wireless connect ubiquit comput improv patient care inform access figur architectur support depict figur applic server inform multipl heterogen client connect wire wireless network middlewar server tier introduc support nomad access layer posit data client tier middlewar server layer distribut number separ form aggreg middlewar servic improv scalabl previou work shown architectur support nomad access notion applic session handoff user work client devic transfer applic session client minim interrupt servic typic set variabl data machin network grant user freedom uninterrupt access mobil fix focu paper show middlewar provid extens scalabl capabl content essenti environ adapt requir user client devic lack hardwar softwar properli present data type cpu suffici handl render pda displai colour plai desktop lack proper decod type stream devic network bandwidth limit suffici support larg user role limit access data assign physician view patient data staff member record filter order enforc privaci content adapt plai central role effici easili augment mechan perform adapt vital paper describ capabl adapt data deliveri heterogen client activ explor research effort address easi extens support arbitrari data structur earli work field shown part project author implement adapt engin network workstat transcod data fit palm person digit assist research odyssei applic adapt network condit inform toolkit facilit deliveri manipul data chang mobil network qualiti servic condit present analyt model transcod middlewar framework deploi adapt agent network project transcod system html page separ part page annot file give descript kind adapt web page larg transcod web page disabl user busi portal product offer access server web content compani fit specif user group effort implement transcod middlewar techniqu shown add function www architectur altern server provid content negoti maintain data specif rang client adapt architectur structur call repres content multipl modal resolut make object retriev requir object adapt server situat object request author proxi augment client request server run content negoti function http provid applic server addit calcul storag support violat fundament tenet applic server remain paper develop capabl algorithm content adapt area adapt scheme plug extens discuss middlewar server client profil data characterist data function adapt command gener network condit adapt command adapt data object client data object data object stage data content adapt executor applic server figur oper content adapt pipelin architectur content adapt pipelin overview situat user work client download data object applic server figur illustr sequenc step carri cap support access client applic regist middlewar server order particip environ registr user authent servic discoveri part client client profil store shown step provid mw paramet perform content adapt client profil includ repres inform client devic user client devic profil inform devic instal runtim network interfac user profil inform user access privileg role type inform dynam chang initi provid time registr client profil explain subsect client applic proce request data object mw data object cach mw request object shown step cach mw identifi data pass object data determin data type characterist detail subsect data object characterist client profil option current network pass input adapt command produc set command object adapt match client constraint command content adapt call routin pool adapt librari function perform actual transcod cach object adapt object pipelin client adapt function discuss subsect xml extens architectur consist mechan repres import inform de facto standard data content adapt pipelin mw access inform document object model routin easili extract inform xml document tag run demonstr content adapt pipelin remaind applic call teach file program develop radiolog professor clinician ucla medic school pedagog tool medic student program teach file displai graphic imag accompani text annot aggreg requisit inform file call teach file inform teach file custom data type data structur standard graphic imag manipul annot text order leverag program multipl heterogen client content adapt pipelin handl custom data type mechan flexibl data structur demonstr capabl complex data type client profil client profil xml document predefin set tag client attempt complet respect inform upload profil mw set tag specifi inform adapt function pipelin client unabl determin default provid provid client profil mw incur repetit network transmiss overhead profil cach mw xml document simpl text file compress prior send client profil serv similar role composit profil implement lightweight set inform avoid excess note client profil client devic profil user profil client devic profil includ attribut figur devic profil ipaq pda show identifi vertic horizont screen maximum number screen ram oper network interconnect client ram oper screen resolut figur show profil devic compaq ipaq person digit assist half client profil user inform identifi user access privileg depend applic run client user profil grant limit select user modifi data object access inform level secur client profil cach mw data function object request data function identifi object data type produc descript metadata imag data determin attribut number colour object metadata inform store data characterist xml stage cap object data type determin type architectur client request servic act proxi behalf client commun client mw perform messag api client applic request object case client data type expect part servic request client convei data type inform mw servic turn inform method prefer mean obtain type return data object return data type web server return mime type return datum part http protocol data object determin type data format header determin type jpeg determin object attribut inform extract predefin set tag type object exist appropri call templat retriev requir templat fill store xml document woman refer center evalu reveal size consist date base prior ultrasound larg structur measur mm left area identifi figur data teach file custom data type text format similar sun javabean activ framework librari extens api type data recognit process make assumpt object suffici result attribut pipelin assum function exist java imag class imag teach file data leverag proprietari code applic determin attribut case object transcod perform data xml role data descript languag make natur choic describ data object figur show data characterist teach file data structur note structur aggreg smaller item data system capabl handl arbitrarili complex structur provid data function configur identifi data system descend type atom item identifi run teach file data structur item jpeg imag figur show xml descript jpeg imag teach file show figur data identifi aggreg data structur obtain metadata perform adapt arbitrari jpeg imag descend abstract data structur find constitu atom data type jpeg algorithm easili handl composit data approach import encount proprietari data pac imag medic domain studi note implement constraint defin jpeg imag figur data jpeg imag teach file custom data type correspond imag list middl teach file data structur shown figur file appli transcod object aggreg data type method appli constraint atom type easiest manner handl data type multipl hierarch futur develop methodolog appli constraint atom element weight measur approach transcod html page constitu element object descript creat store object request approach incur extra secondari storag commun overhead assum reduct time mw worth tradeoff event legaci store characterist file mw note approach impli data object updat client object characterist immedi updat avoid concurr problem stage pipelin easili extens support identif data type object type ad provid procedur execut properli identifi object type characterist xml templat specif type provid repres characterist extens easili made identifi characterist import data type imag alpha channel consid addit resolut number colour adapt command gener adapt command gener complex stage gener set command appropri adapt data object command invok adapt function object pipelin input client profil xml file devic data characterist xml file option receiv inform bandwidth function start compar restrict client profil object characterist data characterist file decid adapt made requir gener adapt store xml file adapt command develop protocol make base set rule adapt object match hardwar limit set profil client profil specifi devic displai imag colour reduc match profil similar adapt match attribut screen instal runtim number audio channel work network bandwidth input factor jpeg imag figur adapt command produc adapt command gener sampl set adapt command shown figur command adapt imag figur match constraint pda profil figur stage augment handl varieti situat handl data incorpor heurist order properli produc command effect adapt content data type heurist reflect modif client profil client hardwar chang user permiss data function audio stream sampl rate consid addit compress content adapt executor suit function algorithm transcod jpeg imag content adapt executor content adapt executor suit procedur perform actual adapt modif object stage perform success step command deliv adapt command lookup tabl map adapt command adapt librari final execut adapt proper paramet request object final output newli object client assum function perform actual data transcod exist architectur algorithm perform adapt extens research scope paper teach file transcod imag data structur graphic imag manipul function provid java imag class final show run illustr final result figur show adapt imag teach file implement compaq pda applic written program environ similar java intend pda note data adapt profil shown subsect content adapt executor stage pipelin directli incorpor figur teach file prototyp run compaq ipaq pda devic profil shown figur mw reduc number colour resolut imag scroll view annot sign softwar compon perform actual transcod found success manipul method java imag class handl discret imag java media framework handl stream data incorpor code handl anim graphic xml manipul packag adapt data xml form function handl data easili ad pipelin stage extens princip strength architectur extens accommod data object type content adapt includ discuss architectur design support goal subsect follow specif case studi extens origin goal teach file specif augment cap handl html anim imag data stream extens design fundament design tenet architectur directli aid extens cap function stage clear softwar compon process data type client requir ad modul design xml standard mean convei inform cap make easi enhanc function paramet ad client profil simpli defin tag valu cap implement leverag wealth softwar librari legaci code written program success merg code java java nativ interfac librari extens view handl data type handl client constraint extend cap handl data type similar ad mime type handler web system identifi type act correctli addit type requir cap perform identifi produc command adapt content base object client network perform actual content adapt step correspond directli stage data adapt command content adapt refer back figur step stage extens introduc web browser requir vendor provid dynam load handl mime cap requir applic engin administr provid modul data function adapt command gener logic form proper command adapt data fit content adapt executor perform transcod data type system extens easili made support client constraint client devic introduc requir restrict content adapt exist data type made follow similar action data function data type chang order identifi characterist import adapt command gener account client devic profil data characterist produc correct command adapt function introduc order perform adapt effect client add procedur pipelin order perform addit function ad procedur simpli requir posit routin proper locat cap augment system code perform applic session handoff extens case studi mention cap architectur initi design support teach file medic data type section shown cap successfulli perform transcod duti teach file specif case studi demonstr cap extend handl data type origin intend support case studi xml html case studi involv adapt object format xml advantag fact html subset html file data object deliv sampl data decid bookmark file creat commun web browser program maintain bookmark html file xml object case studi extend cap reduc size bookmark file filter bookmark visit week transcod produc smaller file retain link heurist context step extend cap correspond step discuss user request bookmark file applic file xml file extend data function introduc code segment properli data identifi xml data adapt command gener adapt command gener augment heurist result gener adapt command link visit week filter ag link determin commun annot bookmark link date recent visit simpl transcod direct easili replac arbitrarili advanc set adapt rule note direct filter link deriv directli standard user profil situat transcod requir constraint extens easili accommod simpli extend profil xml tag valu perform actual augment content adapt executor suit function languag transform xml document run stage creat xslt document filter rule discuss execut direct bookmark file xslt processor processor successfulli manipul html adapt stage produc reduc html document complic note commun bookmark file data object encod xml commun xml extens encod myriad data properli written html file xml file transcod successfulli cap individu atom unit html imag transcod identifi descent case studi anim imag extend cap incorpor capabl handl graphic format imag standard format multipl graphic frame aggreg form gif file modern web browser support present imag type anim browser stream individu gif frame server object case augment cap transcod individu frame imag type deliv client anim gif adapt data augment virtu extens produc adapt fix user profil requir graphic file reduc colour bit depth case extend heurist present handl jpeg imag transcod gif ad modular code content adapt executor suit individu frame identifi header inform extract softwar publish usenet frame characterist identifi adapt command transcod frame meet specif adapt command adapt function java imag class method transcod individu softwar aggreg frame singl gif file readi deliveri client case studi stream data extens ad capabl handl realtim stream data transport protocol protocol transmiss audio video unicast multicast protocol standard commerci product case studi object transcod stream fit multimedia constraint client deliv data implement adapt audio file encod mpeg layer implement identifi audio stream base encod rate number channel creat adapt command base fix user profil match constraint sampl rate execut adapt function audio lower rate implement leverag sun java media framework librari robust packag support displai format audio mpeg video mpeg toolkit architectur hook cap transcod process api receiv stream direct configur direct output transcod maintain stream deliveri audio content note transcod implement effect reduc data payload transcod mbyte file encod result file reduct size scalabl present cap run middlewar layer architectur illustr figur function provid cap easili execut singl middlewar server box approach scalabl perform number client request simultan servic frequenc request size payload deliv middlewar cpu servic middlewar cpu network load produc extern sourc problem potenti solv intellig cach number client profil repres cap handl growth profil upload client devic user log profil middlewar servic middlewar server middlewar server middlewar server applic server client client client servic figur broad view middlewar servic cach disk memori cap execut data function encod characterist data xml datum request user object cach middlewar server content adapt function task advantag multithread uniprocessor object cach load gener solut solv perform degrad problem refer solut provid server act aggreg middlewar servic provid scalabl function intend shown figur architectur involv aggreg separ comput station network workstat form network individu middlewar server distribut local wide area show distribut scalabl handl offer load condit limit maximum servic time experienc client grow bound approach similar previou work distribut comput initi mw distribut determin autonom capabl provid servic compar repres metric proxim mobil cpu servic queue threshold quantiti implement simpl polici base cpu load show mw servic regist registri servic list client registri client discov mw perform work client behalf mw determin longer adequ provid registri mw capabl oper regist mw capabl fulfil client mw chosen randomli action lookup registri attempt poll random drop client servic request return error note approach immedi offer distribut scalabl mean load distribut admiss control mw autonom determin avail evalu metric mw prevent enter state unstabl workload registri scalabl servic servic locat protocol jini subject bottleneck dynam balanc load individu server client servic result portion client session state cach mw point mw unavail avoid servic request mw provid servic client admit client mw enforc polici respond mw perform servic transfer client session mw target mw found mw registri point client inform interact target mw client attain inform mean registri give address target requir client asynchron receiv updat registri maintain normal commun channel mw instanc client request servic initi mw give address target mw updat regular api interfac client mw perform section provid addit implement detail present result measur architectur perform function cap written java sun jdk simpl jpeg imag adapt found standard java librari adequ tool found awt class complex data structur teach file custom class provid programm identifi data type xml activ handl java implement document object model class encod decod xml inform cap interact teach file client varieti commun protocol stem teach file legaci implement origin client commun directli http java servlet run return teach file introduct mw interact behalf commun http servlet client commun mw java remot method invoc choic made due familiar rmi remot procedur call semant fact enabl teach file cap show architectur design capabl support web client experi quantifi overhead incur cap perform adapt jpeg imag cap capabl handl complex data simpl jpeg experi size easili control measur time complet adapt function size origin object target client compaq ipaq profil figur show screen colour origin jpeg imag thousand colour scale correspond imag byte size time measur cap exclud network transmiss time client mw includ time commun mw measur involv step figur experi mw mhz pentium ii desktop run window nt connect ethernet breviti omit result clear process time cap size origin imag intuit simpl result show larg size complet time cap millisecond note middlewar server share machin execut incur network http traffic retriev imag latenc millisecond iter number time execut cap middlewar server middlewar server figur latenc multipl middlewar server demonstr address issu present result shown figur reflect execut cap distribut middlewar server aggreg middlewar discuss structur middlewar servic perform transcod capabl jpeg imag implement simpl scheme demonstr servic transfer algorithm import note polici trigger mention reason includ client mobil bandwidth implement heterogen collect sun ultrasparc machin connect ethernet middlewar servic older machin chosen due access conveni figur graph latenc perform transcod function experienc client repres iter client progress time experi launch client random interv base poisson distribut client request data object applic server mw continu make request random interv poisson distribut measur tick repres request iter client random data plot case show latenc client grow bound client introduc system growth due fact mw perform task jpeg transcod implement load distribut polici mw monitor current cpu load check averag process queue length return unix librari call load pass arbitrarili chosen mw servic case client observ continu request servic server redirect servic mw easili implement client complet latenc grow fall show scheme scalabl futur work previou work shown benefit middlewar tier perform content data applic server heterogen mobil devic function data content provid suitabl present imag client devic research effort perform adapt context world wide web typic data text graphic imag paper suggest scalabl architectur content adapt data arbitrarili complex includ aggreg data type system limit www applic part type interact commun protocol demonstr util implement support initi medic applic cap architectur extens support data type client demonstr power augment system support data type origin includ anim stream audio order system scale offer multipl middlewar server architectur distribut servic futur augment cap architectur varieti wai work content adapt function integr adapt function implement stage pipelin complex applic includ advanc version teach file intermedi futur carefulli studi issu architectur pipelin execut distribut individu compon stage facil gener set adapt command match constraint optim list command futur step treat context constraint satisfact problem user inform access explor area refer katz activ servic framework applic multimedia sigcomm patterson case ieee februari liao programm support adapt mobil ieee person august zhang nomad ucla technic report activ transcod proxi support mobil web ieee symposium reliabl distribut henderson network architectur heterogen mobil ieee person octob miller proxi server http stream world wide web decemb profil work chandra elli compress metric imag usenix symposium internet technolog chou abraham balanc distribut ieee transact softwar juli document object model homepag duda hart pattern classif scene floyd adapt algorithm spatial grai societi inform vol brewer network client variat infrastructur lesson ieee person commun august brewer top gun graphic web browser usr ifip intern confer distribut system platform open distribut process lake septemb guttman locat automat discoveri ip network ieee internet juli adapt imag transcod proxi mobil web ieee person commun decemb singhal web content ninth intern world wide web anita huang semant transcod system adapt web servic user acm confer assist nov va javabean activ framework sun java media framework home joshi proxi mobil web baltzer mobil network applic joshi approach wireless web intern workshop wireless network mobil april hunter idl intern confer distribut comput june li multimedia internet content ieee transact walker adapt acm symposium oper system quantiz ieee transact signal vol applic session time ieee intern confer commun june twist mobil interact session ieee workshop internet applic san juli distribut middlewar servic architectur support mobil internet acm wireless mobil internet workshop juli itali converg heterogen client ieee person commun april jacobsen transport protocol rfc implement confer pac homepag waldo jini architectur commun vol extens markup languag xslt transform distribut adapt heterogen phd
HCI/1498 4 semiot hci peter andersen dept comput human machin fredrik denmark abstract semiot mathemat abstract languag cover special semiot bring insight older media task interfac defin special characterist comput medium semiot limit interfac design contribut proper design program text yield predict interact comput system context keyword comput base context mathemat human semiot pure analyt charact tradit semiot supplement construct semiot commun acquir solid understand technic possibl limit comput system order creativ domain explain problem simpli good semiot creat interact system convei intend messag reason semiot abstract individu disciplin art drama theori film theori serv common languag transfer insight domain systemat design comput comput inher multimedia code field meet amalgam practic capac mathemat abstract languag insight disciplin repres compar semiot semiot offer set gener concept analyt procedur appli semiot disciplin substanti practic insight offer claim effect lead frustrat unfound major reason semiot caught hci commun elabor basic posit semiot make hci coher exploit insight older media defin characterist properti comput medium situat broader context peter andersen motiv point hci involv interact machin human side strong faculti border make imposs describ interact coher framework comput aesthet media evolv older media borrow restructur older techniqu media uniqu artist time discov mean creat mean comput system interact semiot system surround make hci coher interfac design domin comput scientist psychologist problem put comput scienc concept human psycholog lack concept algorithm data theori domain find place core semiot sign integr physic side semiot talk algorithm data structur interpret interpret domain concept sign part comput process influenc part interpret influenc analyz semiot method inher bridg social expect topic tradit textbook interfac design find place semiot theori coupl influenti book import differ system model model simpli signifi interpret produc group access part system imag collect sign interpret user direct manipul style defin domin icon sign base similar technic notion view correspond neatli pragmat notion organiz geograph posit determin select structur interpret fact user interpret system differ design predict fact interpret sign insid larger semiot system semiot system interpret sign differ part semiot enforc reinterpret technic issu semiot process comput scienc data storag retriev commun process storag inform channel commun mean conform normal principl commun provid context interpret patient hospit sender inform doctor import possibl email phone connect enabl interpret doctor easili enter kind negoti frequent commun semiot hci exploit insight older media interfac design inform knowledg skill collect older literatur theatr older insight valid turn invalid movi movi similar comput interfac exploit spatial en tempor dimens screen tradit develop sophist techniqu montag tempor success shot involv natur chang shot pattern shot type match learn edit techniqu order avoid hypertext scene translat easili comput basic shot continu sequenc comput interfac made sequenc pixel abstract notion shot find closest analog interfac transfer concept hing shot systemat fashion abstract smallest sign signifi continu hypertext correspond node page realiz substitut film theori guidelin result semiot research confin user interfac fact part comput system made sign interpret stakehold program code sign creat interpret programm semiot interest program methodolog tradit comput scienc reliabl import contribut make respect organ program text make understand defin characterist properti comput medium comput interfac movi basic point view comput system add interact move click button sake move click move click special program signifi opposit passiv pictur interact exploit abil interfac object influenc movement hand creat mean interfac consist passiv icon action ad interfac object consist featur work concert produc individu sign possess perman transient featur movi har action handl featur part drama film accumul lot insight art produc interpret sequenc transfer comput comput theatr movi realiz sign characterist pictur concept restructur shot major differ shot hypertext node shot follow peter andersen hypertext node follow node mean node combin shot accomplish linguist smallest independ unit languag word combin word produc mean situat broader context subsum aspect neglect hci textbook predict import human interpret human make sign perceiv avoid read subtitl mean user interpret interfac make guess cf point strict separ interfac technic process stage hinder user understand friendli interfac eventu break leav posit motiv semiot interest program tailor human commun work describ task colleagu commun make organ hang behavior comput system talk technolog hinder vital commun interfac work languag start point design system elabor point interpret hci systemat disciplin born earli comput travel comput depart million worker prior knowledg comput requir experienc difficulti programm built user interfac concept construct system technic concept export order offic autom strategi develop aim interfac design invent metaphor user intern work system underli strategi organiz user softwar make technician repair labor metaphor break creat technician scarc resourc number comput grew user understand labor modern user support system prevent perform function decad distinct user interfac mysteri major obstacl weav web mean chang understand tend fear semiot hci make user medium develop reproduc thousand year technic repair extrem complex system reason languag modifi languag problem inadequaci discuss solv languag user send linguist time misunderstand occur comput system design inspir system type languag exemplifi suggest formal properti worth process output input turn previou turn point add turn talk world languag smoothli shift topic back comput smooth transit domain system system argu syntax semant essenti structur similar sentenc structur similar subordin lexic mean word explain lexic mean string word coincid dynam distribut comput system page produc mean current meta mention work organ exist commun report solv problem coordin teach newcom requir skill maneuv man machin telegraph wheel describ oper colleagu maintain updat knowledg current situat mention verbal commun commun regul commun captain forget rememb turn wheel modal commun verbal verbal languag backbon modal resort method fail comput system media organiz obei law commun circuit organ happen ship present full engin comput system comput system sign requir sign system easili enter surround commun semant mean basic mean distinct system cross languag basic dimens classifi task system classifi peter andersen cord tempor sequenc repres major break exist languag user ignor system sign invent chang languag exist languag account commun organ chang desir notion practic guidelin interfac relat element screen imag describ simpl sentenc write captur mean wrong conclud small illustr enhanc project featur verbal commun comput show theori gener concret idea illustr semiot framework multimedia system design shop sell music world countri fig multimedia system shop sell world commod system main anim set page text pictur countri music track plai music select countri part interpret locat globe countri depress button text pictur music plai verbal interpret easi stand criterion verbal improv suggest includ featur stark syntact structur languag facil control inform structur inform theme semiot hci introduc background inform present adject locat africa plai kind music inhabit inform locat africa plai kind music inhabit order translat inform structur suggest locat africa background blur pictur globe music background loud filter inhabit inform make part screen color theme discret show connect import part remov color button show theme moment sentenc locat africa plai kind music african countri inhabit locat music present inform sentenc locat background number inhabit inform express enter fig screen globe rotat music loud globe rotat locat chang fig globe color freez locat loud music filter account semiot framework talk sign mean commit medium phenomena background express construct verbal blur graphic inform express posit stress verbal vivid graphic paper argu semiot serv coher framework exploit insight older media characterist properti comput medium semiot posit design comput system broader theoret philosoph context show properli earth design refer sign signal interfac languag design peter andersen interact system design da sw user center system design lawrenc theori comput semiot semiot approach construct assess comput system cambridg understand comput cognit norm system klein sign work de transpar data base film og design af read film oxford film art comput cognit contribut comput medium cambridg semiot approach program comput medium cambridg machin handbook foundat natur cultur mean semiot interact comput medium cambridg design languag andersen og comput languag cacm de semiot engin principl evalu program environ de em da inf comput scienc michael interfac system mass languag mass andrea brandt dynam semiot lai experi radic tailor tool cooper work acm transact inform www system cybernet human dimens paper intern workshop perspect commun model
HCI/1499 4 intern workshop softwar design principl resourc manag system intellig space luke howard mit ai abstract idea ubiquit comput smart environ longer dream long area research technolog start enter dai live major obstacl prevent technolog spread smart space equip kind devic projector comput tv multipl applic run space time inevit contend devic scarc resourc underli softwar smart space provid tool shield rest softwar physic constraint dynam adjust alloc scarc resourc number prioriti activ task chang argu resourc manag provid function paper present set guid principl build resourc manag tool smart space present arriv year explor topic intellig room project mit ai lab paper base number implement test tool introduct research group mit ai lab develop space interact user sensori technolog machin speech recognit natur languag understand room equip rich arrai technolog technolog intend provid interfac user intellig room design util provid reason servic user easili predict continu provid servic equip failur content resourc work support delta electron hp ntt nokia research philip research mit project oxygen darpa offic naval research contract number draft redistribut user applic desir provid improv addit servic higher qualiti equip ad crucial thing programm system wizard intellig room system spirit monitor environ varieti techniqu accomplish make intellig choic techniqu current context paper describ experi build system kei insight peopl interact intellig room term term abstract servic intellig room capabl map servic request varieti solut intellig room solut base solut meet minim costli rare resourc make runtim respond chang set request chang environ resourc manag smart space resourc manag system capabl perform fundament resourc map arbitr resourc map process find actual resourc specif request arbitr process make resourc capac arbitr alloc resourc scarc resourc paper concern manag resourc os level manag cpu intens agent multipl machin limit focu resourc physic devic larg softwar compon system deal resourc smart space os concern lie user softwar screen real sound input output cd lamp definit defin potenti ambigu term system form softwar base work intellig room project manag commun rmi system agent start obtain refer agent method agent uniqu part id interfac agent implement agent collect societi multipl user space distinct make easi coordin startup run agent number machin differ oper system agent agent distinct object instanc capabl provid servic make request resourc manag mean agent consid type resourc provid servic devic physic logic devic akin devic necessarili repres agent devic provid servic resourc servic servic provid agent singl agent devic provid servic kind servic provid number agent devic explain detail section resourc resourc provid servic agent physic devic resourc physic led sign resourc led sign hardwar obtain agent turn resourc servic obtain agent servic work date paper base work intellig room project mit ai includ unpublish research resourc manag summar result relev paper order give reader idea arriv observ past year develop resourc manag tool intellig room tool differ approach level sophist extrem resolut servic map complex system languag repres knowledg servic servic constraint satisfact engin arbitr resourc manag implement common interfac interchang chang code system reason resourc manag scheme motiv find assumpt resourc mobil person space devic comput larg static space mention complex resourc conform design principl laid paper deal issu privaci access control began work cooper mechan reli agent extern descript descript includ list startup list provid servic list descript request resourc agent make startup provid servic ensur assign agent provid servic agent satisfi agent request devic candid ensur speech gener comput screen assign candid request startup dynam machin agent start softwar instal space small small live larg offic small confer room instrument space vari singl projector coupl light small offic projector larg number devic confer room live room equip agent startup reason absent agent agent system smart space autonom start agent resourc manag reason agent aliv brought life agent startup basic featur grant agent system support briefli argu agent startup desir featur agent system charg smart space discuss consequ resourc manag support agent startup smart space agent system deal spontan creat unstabl collect agent creator system refrain make assumpt system time resort dynam direct negoti techniqu agent servic resourc gener attitud assum creator agent system control smart space standard jini implement hive good exampl system smart virtu base stabl physic special set constraint underli softwar infrastructur true lot adapt compon peopl devic brought time benefit assum level persist featur physic space compon static dai space reason expect devic present dai level predict reflect underli softwar infrastructur softwar capabl dynam accept compon agent startup highli flexibl space varieti wai make multipl instanc agent perform version task complex interrelationship agent larg number agent startup craft elabor startup script agent talk collect forti agent agent chang depend start task system room system start start singl high level agent suffici obtain servic provid agent agent request agent order job conveni argument set illustr addit benefit start agent dynam assum phone servic provid phone agent agent comput voic modem hook phone line order provid servic imagin system consist machin voic modem hook singl phone line share graduat student agent start phone agent prespecifi run risk machin servic longer start instanc phone agent machin voic modem connect mislead solut agent phone servic provid time machin share singl phone line automat agent startup robust agent provid comput servic comput automat restart locat understand point potenti dwell aspect lie realm resourc manag impact resourc manag assum agent startup support underli softwar stand reason resourc manag system reason absent agent uncommon agent charg smart agent account coordin effort belief potenti agent account resourc manag system make intellig resourc alloc previou section section import consequ embrac agent startup reli agent provid descript servic run resourc manag access descript instanti agent requir agent programm creat separ descript file solut easili creat descript cach resourc implicit previou section assumpt resourc start agent specif comput virtual machin capabl main primit unclear moment extent system support section concentr knowledg resourc manag knowledg encod argu build resourc manag smart kei point repres resourc term servic provid text type scroll led ensur rich request tool job caution java interfac describ resourc ensur capabl describ resourc repres agent system agent special proxi object exampl resourc hardwar directli control agent system crucial perform low level comput compon parti softwar servic devic smart space impli build mass interconnect compon includ hardwar softwar imagin futur packag softwar room offic todai desktop comput creat prove difficult difficult desktop comput similar make softwar run difficult smart space peopl great pride arrang work live environ creator softwar smart space space arrang equip softwar creator desktop comput requir comput equip sound requir level uniform smart space make applic run varieti space devic configur differ desktop comput minim softwar driver devic instal comput matter kind video card monitor driver make card monitor provid servic applic intellig space situat space kind rang tv larg space displai express abil devic smart environ abstract term provid uniform interfac desktop provid uniform interfac servic provid devic distinct profound fact servic provid number conceptu devic devic provid number distinct servic servic render comput displai speech output devic line displai led provid short text provid simpl graphic anim uniqu suggest devic repres devic driver insuffici smart approach suggest winograd al argu ubiquit comput environ space collect mobil network resourc easyliv repres resourc term servic provid rich rich request examin servic repres resourc manag detail depend implement open agent architectur oaa reli facilit agent commun task icl commun describ capabl languag servic provid describ agent term task perform term resourc repres decker kqml commun abil agent common tendenc system jini hive interfac resourc list pair describ capabl interfac inform capabl invok inform agent advantag interfac describ agent interfac easili understood programm adopt larg commun stress interfac provid access servic agent number servic design hive jini type interfac implement agent provid lot valuabl inform capabl expect behavior interfac suffici describ agent fulli interfac descript number contribut full descript displai servic term color detail descript servic agent show map lot request color displai mail alert agent deal low resolut displai long visibl displai addit paramet abstract resourc import featur distinguish multi agent system charg smart space multi agent system resid frontier physic comput world function system accept embrac physic world refer point section consequ system explicitli describ servic provid agent provid physic hardwar softwar present comput common approach problem add agent repres physic comput capabl host environ repres physic devic access comput agent repres individu devic start shadow unsatisfactori startup human script leav system reason action case agent startup retriev comput tie agent directli interact hardwar softwar start dynam section dynam find comput equip softwar main provid servic person wireless microphon connect comput run parti speech recognit softwar confer room comput audio rout microphon signal comput agent request resourc check descript speech input agent servic provid servic includ comput speech recognit connect speech recognit engin microphon softwar proxi agent system resourc manag reason ensur agent start comput speech recognit engin award microphon task ensur exist connect section discuss arbitr heart resourc manag arbitr definit resourc agent vie limit resourc manag evalu section argu arbitr essenti larger system smart space individu agent applic written basic appar smart behavior space arbitr scheme applic open agent resourc prove effect base prefer proven good solut combin access control limit request untrust potenti malici case resourc request satisfi effort made find replac withdrawn resourc arbitr arbitr easier implement individu agent writer view world arbitr mechan arbitr agent programm agent resourc system care realloc properli oper system programm worri yield benefit arbitr achiev appar behavior space anim expect bodi part coordin expect space interfac devic arbitr simplest resolv ti request award resourc recent request reason prove insuffici desir email notif screen video confer boss exist analysi alloc resourc simpl analysi decid award servic scheme reli agent accur report urgent resourc approach potenti problemat malici natur simpl approach arbitr potenti open system smart space access control mechan conjunct scheme situat access control mechan weed request untrust unauthor agent prioriti mechan decid trust author request resourc model agent act behalf space access control model viabl option discuss access control section approach develop open system notabl base market mechan approach requir exist central sort currenc natur suit smart environ thousand mile bui control room extra virtual currenc resourc manag resourc reason request resourc finish task expect resourc futur email notif agent output channel desir sake consist behavior notif channel good reason chang arbitr clever space equip tv lcd video comput vcr act tv connect projector tv set video connect projector user watch resourc satisfi request larg displai user hear import decid share friend watch rest newscast request email agent simpler resourc manag scheme projector alloc email agent desir newscast move tv set email displai projector point case accommod request resourc activ request disturb realloc request servic insight set servic satisfi request overlap partial relationship complex proper figur reason kind devic provid set physic connect kind signal rout differ space video signal multiplex connect projector tv connect hard tv set video tv video ¢ projector £ erenc text ut speech output led sign fig kind task perform overlap set tv set projector watch video tv projector teleconferenc led sign speech output text output make arbitr request resourc manag receiv request solut satisfi request simpl task select resourc request turn global constraint satisfact problem point costli move newscast projector user bound find distract case disturb mail notif agent mind time simpli output devic case agent rebuild lot state exampl camera carefulli face area internet browser browser histori reason cost part arbitr process request costli cost vari cost servic altogeth cost fix cost request differ util request request stipul smaller ownership resourc time section argu servic provid agent smart space displai servic provid task manag differ task request ownership resourc period time agent resourc engag job chang modifi discuss compar resourc manag task manag perform agent open agent architectur open agent architectur good agent system control smart space complex facilit scheme oaa perform task manag resourc manag facilit agent break task simpler task alloc individu agent fulfil ensur resourc task agent oaa suit task send current boston weather report friend task broken inform obtain messag oaa suit task thought time implicit oaa model assumpt agent conflict scarc resourc task manag import system control physic space larg number scarc resourc task manag work hand hand resourc manag natur agent life independ job agent listen record room order bring back audio snippet keyword resourc extend period time complet job show movi thought task abandon middl prevent agent displai job show movi oaa view task parti resourc request annot core resourc manag system easi write modul specif type reason reason annot request limit reassess match knowledg world direct impact natur specif resourc specif knowledg resourc realm request easi parti entiti contribut knowledg user room desir plai song agent user start agent locat bit attempt gain access agent plai actual file resourc request agent abil plai sound criterion desir locat user wander room import sound plai agent room user knowledg append resourc manag song request agent appropri knowledg violat normal notion modular agent check locat annot resourc request unwieldi resourc manag find maintain knowledg resourc knowledg natur flexibl agent system knowledg codifi resourc manag translat output agent proper resourc request annot solv problem activ area case make massiv larg unwieldi project write resourc manag solut found parti agent extend function resourc manag author write agent function pattern match resourc request add addit criterion request distinct agent track user eavesdrop resourc request annot relev physic local possibl request annot happen wai modifi request list match gener method filter match list resourc gener parti annot real agent transact job hand idea dumb object wire heavyweight object hard write maintain advantag parti annot provid room dynam adapt equip failur write modul extend reason resourc alloc problem agent projector broken screen easili agent updat resourc manag resourc request projector automat remov projector abil parti annot serv nice futur contempl ad larg featur system access control section model request resourc receiv pretti thought modifi chang appropri resourc annot preexist request connect style resourc deserv special attent connect connect vital piec background smart system resourc manag fail manag bound end troubl room switch inform flow sourc devic output devic tv comput integr web sourc sink trunk wire connect carri signal time limit resourc long time optim carrier inform signal account special wire intellig space mean fulli connect graph signal sourc physic connect limit resourc manag due enter connect manag agent vcr projector request collect resourc consist path connect lead vcr projector connect aspect system scene extens resourc manag crucial piec forefront agent attent agent resourc caveat resourc involv connect connect extens resourc manag forg actual path special request discov resourc lie bit paramet discuss extens ad layer top exist system briefli discuss agent resourc background effect resourc ticker weather forecast agent led sign type request automat resourc agent agent resourc free give back free advantag approach prevent busi wait side agent poll resourc manag lost resourc obtain altern solut block work close examin auto upgrad resourc applic worth check agent serv resourc agent special request mind switch resourc time loan request reason resourc moment alert agent briefli speaker room inform room occup call wait occup watch smooth alert agent borrow audio moment give back origin agent lost poll situat previou make cost analysi resourc manag difficult found easi answer futur section talk issu resourc manag smart space identifi import research depth access control real world full access control mechan wai access space equip restrict peopl true inform stand reason agent act behalf peopl subject similar constraint owner alic kei vcr parallel step introduc interest problem member lab enter confer room control extent extend electron peopl grant access devic physic present trip access devic grant author peopl condit physic present assum physic presenc requir scenario research group meet member citi meet show result control projector slide show treat equal physic peopl physic present meet grant grant permiss clear access control perform smart space resourc manag part process resourc manag grant agent access resourc resourc manag find resourc request cooper research smart space space control softwar number peopl move smart space expect make request space expect agent build singl resourc manag manag resourc space peopl impract number resourc repres collect resourc request space border agent act behalf peopl resourc provid resourc manag commun perform optim resourc alloc contribut outlin number issu found import design resourc manag system smart space smart space research area project reach point resourc manag critic project eventu face problem basic infrastructur place independ applic ran space time acknowledg peopl contribut research present stephen peter provid lot implement test resourc manag softwar stephen work repres multipl user multipl space system research issu privaci access control smart space refer design implement intent system acm symposium oper system principl decemb ken bryan robert jim ann wollrath jini specif jonathan david daniela ru model resourc alloc agent system franco coordin internet agent jonathan david daniela ru formul resourc alloc fourth intern confer autonom page june rodnei brook intellig room project intern cognit technolog confer august meyer shafer technolog intellig environ handheld ubiquit septemb wai chun constraint program java intern confer exhibit practic applic constraint technolog logic april michael coen build brain design distribut softwar agent ninth confer innov applic artifici intellig michael coen design principl intellig environ fifteenth nation confer artifici intellig michael luke stephen peter finin meet comput intellig system keith mike katia sycara matchmak broker intern confer system jacqu ferber system introduct distribut artifici intellig java expert system shell technic report sandia nation resourc manag system intellig room massachusett institut resourc manag multi agent system smart space robert activ softwar paul robert howard number lectur note comput scienc robert paul howard result intern workshop adapt paul robert howard number lectur note comput scienc victor lesser reflect natur coordin implic agent architectur autonom agent david adam dougla moran open agent framework build distribut softwar system appli artifici nelson matthew oliv patti mae distribut agent network thing intern symposium agent system applic intern symposium mobil august phillip program languag multi agent system massachusett institut manuel roman roi campbel enabl activ space acm sigop european septemb tuoma sandholm distribut ration make gerhard multiag system modern approach distribut artifici intellig mit ravi edward charl access control model ieee februari simon amin bat provid servic chang ubiquit comput environ workshop infrastructur smart devic make ubiqu huc septemb extend multi agent system massachusett institut terri winograd interact space centuri comput john interact design implement resourc manag system
IR/1500 5 speaker inform technolog summar visual informedia digit video librari howard wactlar carnegi mellon forb avenu pa usa abstract informedia digit video librari project provid technolog foundat full content index retriev video audio media librari hour video grow daili good queri engin suffici inform retriev candid result set grow number librari grow video digest summar set stori provid user visual mechan interact queri refin digest gener dynam direct user base automat deriv metadata video librari informedia digit video librari foundat work informedia digit video librari develop integr technolog inform extract video audio content enabl full content search retriev terabyt onlin data automat gener metadata indic retriev video segment librari informedia successfulli pioneer automat creation multimedia demonstr empir proof rel gather usag data summar abstract fundament research prototyp conduct shown sampl refer integr imag gener multimedia segment video tailor present base context text headlin gener text cluster topic classif inform retriev spoken document audio speech recognit segment align spoken dialogu exist transcript silenc detect abstract imag face detect match base color video kei frame skim video ocr video trail visual result set informedia process provid state art access video content techniqu pursu commun inform trend sourc analysi understand context content futur digit video librari present challeng requir approach informedia interfac optim content singl document queri result illustr figur show document return text queri video open document interfac prove insuffici librari grew hour video work util video inform content set video direct video inform extract summar carnegi mellon queri result shown figur user countri repres kei peopl minim overlap coverag figur present schema system extract metadata video relev inform present driven user visit numer video collect search answer reveal bit unfold stori famou crimin trial region polit conflict video inform collag dimens import user full context understood navig narrow focu inform result video piec plai collag video inform synthesi sourc text extract summar rich area research work complement inform speech recognit imag process video inform collag built result integr technolog achiev inform extract summar video domain numer templat organiz scheme includ collag view plai documentari video shown figur queri area spatial distribut result filter polit boundari repres imag geograph area shown user effect fire user drill shown black rectangular produc collag figur user option show addit map inform repres imag highlight show el effect concentr island collag enabl user aspect facet digit video librari user figur face kei player short event descriptor indonesia time period el effect figur show stratifi adjac face men meet figur informedia interfac text queri displai text video metadata extractor peopl event affili locat topic time collag templat collag user interfac figur conceptu system overview direct video inform extract summar carnegi mellon north pacif ocean south pacif ocean map collag distribut nation overlaid thumbnail march april econom reform meet discuss econom text face ad process plai view attempt sequenc relev repres audio visual imageri present coher stori unfold topic control user inform layout import build video collag inform visual techniqu includ cone tree tree map dynam queri slider visual lifelin media stream repres tempor inform timelin shown multipl timelin simultan singl video document make templat geograph perspect inform collag templat significantli advanc field enabl inform visual multipl video document user show detail due limit screen real show context detail video inform collag system design capabl summar singl set video librari semant zoom el student protest indonesia map collag produc user zoom box area indonesia shown area portion indonesia shown overlaid polici indonesia java presid timelin collag player short event repres data shown indonesia map collag figur multipl video inform collag interact direct video inform extract summar carnegi mellon zoom natur dimens collag templat zoom contin region countri citi zoom dai year support zoom reveal fire start peopl clear land el result fire control zoom synthesi repres collag specif contribut document informedia multimedia abstract document underli inform extract metadata creation abil extract date time essenti correl occurr import metadata video central product inform collag techniqu extract entiti output speech recognit system ocr appli video integr modal achiev result current approach shortcom method requir amount manual label train data achiev reason level perform method identifi small part inform person politician locat vacat resort geograph refer video segment repres singl set distinct rang valu locat video situat locat refer video user locat locat coordin order queri event locat locat built set video enabl user spot pattern trend event respect el contribut significantli forest fire indonesia distanc locat express refer polit geograph defin boundari determin region region common notat metric integr robust geograph inform system data place countri chang coordin data accur displai retriev histor data preposit refer lexic pictori caption challeng includ vari granular rel versu absolut posit synchron locat inform video likelihood inaccur error identif locat explicit indirect time date refer resolv encod consist manner time refer rang current stori documentari retrospect overarch goal informedia initi bring spoken languag visual document function capabl written includ aspect categor summar research direct enabl special advantag rich holist visual tempor present provid analysi tool techniqu extract requisit assembl context respond user minim summar multipl dimens granular work enabl user gener visual perspect conflict multipl report foreign press corp contrast video cultur histori produc nativ countri direct video inform extract summar carnegi mellon methodolog societ impact scientif commun provid set capabl aid understand event evolv correl time geograph citizen potenti empow analyt question global video record societi creat evolut event track perspect globe brought bear present medium visual rich engag acknowledg materi base work support nation scienc foundat cooper agreement refer visual inform tight coupl dynam queri filter proc acm chi confer human factor comput compact rapid proc acm chi confer human factor comput bbn corpor web speech languag url improv access digit video ifip conf juli multimedia abstract digit video proc acm intern confer digit evolv video skim multimedia proc acm confer human factor comput lo april inform extract knowledg aaai organ electron aaai fall ai applic knowledg navig ma url intellig imag advanc imag retriev kluwer academ mj mg artifici intellig techniqu interfac digit video extend abstract acm confer human factor comput orlean march ag hd index search multimod intern confer speech signal process april mj informedia multimedia inform acquisit retriev chapter intellig multimedia inform ed aaai menlo stori segment detect commerci broadcast advanc digit santa april ag topic label broadcast stori informedia digit video proc acm confer digit june mj experi inform retriev spoken proc darpa workshop broadcast understand system februari approach visual hierarch inform structur proc ieee visual direct video inform extract summar carnegi mellon access multimedia concept acm chi confer human factor comput jl ed balanc combin symbol statist approach languag mit massachusett video repres visual structur video acm multimedia simultan word document proc workshop learn text web combin classifi text proc acm sigir confer research develop inform retriev exploratori data analysi multimedia acm confer human factor comput april broadcast intellig multimedia inform ed aaai menlo ca content extract visual broadcast video acm multimedia ma seventh messag understand confer april morgan kaufmann publish visual document system inform process inform visual interact commun human face detect visual scene carnegi mellon school comput scienc technic report pa video ocr digit proc ieee intern workshop access imag video jan associ face video ieee confer comput vision pattern recognit puerto video skim quick base audio imag carnegi mellon school comput scienc technic report pa video skim combin imag languag understand ieee confer comput vision pattern recognit san puerto automat learn text analysi technic report automat learn text analysi technic report rk automat index retriev caption ieee sm intellig access digit informedia project ieee hauptmann lesson learn build terabyt digit video librari ieee special issu digit februari pp ag improv acoust model watch carnegi mellon school comput scienc technic report pittsburgh ag speech recognit digit video journal american societi inform scienc expert effect effici learn human text categor proc acm sigir confer research develop inform retriev juli direct video inform extract summar carnegi mellon studi retrospect event proc acm sigir confer research develop inform retriev august
HCI/1501 4 wearabl comput configur discoveri situat inform cliff randel henk muller depart comput uk abstract paper describ work progress wearabl comput configur provid audio visual output base posit orient user introduc wearabl wrist comput posit head sensor combin user interfac emploi speech recognit small displai applic includ search implement minim augment realiti system effect approach convei locat base inform discuss describ continu research posit base audio visual interfac keyword wearabl augment locat speech recognit introduct background bristol wearabl comput project part interdisciplinari research initi equat aim promot integr physic digit varieti relationship physic digit world equat challeng bring research uk work varieti project draw approach comput social cognit scienc art design wearabl comput ideal platform develop test relat applic suitabl widespread cost prototyp electron devic comput fund work receiv uk engin physic scienc research grant work perform collabor support research europ interest present inform link physic locat earli work web page gp posit experi carri applic tourist guid recent interest displai dynam link posit orient mobil wearabl comput access situat digit inform potenti displai physic digit artefact devic creat form plai promot particip support activ insid includ maintain famili social relationship previou work field tablet palmtop comput map base applic laptop palmtop commerci figur describ research wearabl research contribut significantli design current wearabl comput cpu run oper flash pixel serial interfac enabl contextu data gather devic gp electron compass speech recognit modul call figur devic test applic requir small investig potenti user interfac combin speech input visual output form factor intent experi displai intuit simpl map full augment realiti consid scope similar principl requir ar appli sensor initi select usual freedom assum user sit stand upright lean ahead design encourag user adopt attitud deal freedom posit direct view head data easili collect gp receiv electron compass user interfac emploi speech control displai capabl provid text graphic comput output pc produc method user feedback configur explor hypothesi speech displai prefer interfac configur mobil devic compass displai automat align mount compass displai speech recognit modul microphon optim arm view displai locat gp receiv requir line sight sky upper arm shoulder mount found satisfactori solut experi architectur continu poll sensor devic number commun port approach prove power hungri subsequ event manag architectur achiev power save afford opportun carri limit test architectur figur design pic microcontrol handl low level contextu data pic continu econom poll data event request main processor main processor event gener handl queri displai function complet system worn comfort compass gp speech rec micro control pc poll event figur architectur compar effect approach provid locat relat data user applic main applic develop test origin prototyp bristol simpl augment realiti util function pub crawl applic aid user find locat easili distinguish readili locat technolog gp experi site interest tourist worthwhil gener site everydai interest english public pub place visit frequent point refer direct applic respond user request search find nearest pub displai distanc head figur user select pub addit inform includ address featur pub beer garden produc beep user face select pub figur applic augment realiti advent wearabl comput suffici process power enabl augment realiti applic enabl research carri head mount displai system bring challeng head latenc handl loss track interest opportun augment realiti head mount issu everydai displai arm mount displai latenc critic head track unnecessari separ displai encourag user intuit skew height model incorpor main vertic build situat bristol citi centr gp head data make render outlin face build displai wirefram figur addit inform ad displai give augment realiti effect figur augment realiti displai result continu research applic chosen demonstr significantli method provid locat direct format user singl beep user head desir simpl augment realiti program guid user emploi simpl graphic displai graphic displai effect qualiti model suffici visual cue identifi build addit label model bristol instantli intric offic readili identifi characterist displai wire frame model small displai advanc limit process capabl specif displai gp accuraci clear view perfectli adequ problem experienc augment realiti applic urban environ user frequent erron posit gp insid build render problem overcom simpli render build user direct user conclud simpl messag audio beep provid effect interfac augment realiti displai displai provid textual descript nearest place interest user speech prove expect implement found inton plai part odd effect recognit work user user concentr hard correct user recognit perform badli form factor found readili accept total integr devic consid desir main drawback speech interfac found frustrat current research work develop distinct direct limit address move palmtop platform colour displai combin processor fulli capabl graphic interfac ultrason indoor posit system electron compass work indoor experi effici graphic field view work carri part equat project work inform citi aid understand children interact virtual object real space result evalu extens user test line research build import audio interfac construct locat virtual space access wearabl comput differenti gp posit electron compass sound render provid locat audio experi user real space partner collabor interest provis servic wireless technolog develop contribut posit current intend return wearabl comput gener wrist comput emerg refer equat interdisciplinari research challeng situat comput intern symposium wearabl page octob randel muller manner wearabl comput person ubiquit page februari fridai cach dissemin inform guid system ieee workshop mobil comput system februari le holmquist inform link inform view navig visual inform small displai intern symposium handheld ubiquit page septemb muller randel sensor architectur low power wearabl workshop softwar engin wearabl june webster tour prototyp mobil augment realiti system explor urban environ intern symposium wearabl page octob safeti comfort displai intern symposium handheld ubiquit page septemb randel muller low cost indoor posit system ubicomp intern confer ubiquit page septemb
Agents/1502 1 australian artifici intellig institut la street melbourn victoria australia telephon formal specif dmar technic note mark dinverno school comput london uk david kinni australian artifici intellig melbourn australia michael luck depart comput uk michael wooldridg dept electron queen mari westfield london uk paper fourth intern workshop agent abstract procedur reason system establish agent architectur deploi major industri rang fault diagnosi space shuttl air traffic manag busi process control theori system wide intellig agent research model practic reason underpin pr arguabl domin forc theoret foundat ration agenc interest pr bdi complet attempt made behaviour real pr system led develop rang system claim conform pr differ import respect aim paper rectifi omiss provid abstract formal model dmar system recent implement pr defin kei data structur present architectur oper manipul structur focu dmar kei tool program dmar agent specif present enabl implement pr easili serv benchmark futur architectur enhanc evalu introduct mid control architectur practic reason agent wooldridg deploi limit artifici appli realist fewer led develop applic notabl except procedur reason system origin georgeff architectur progress lisp version fulli fledg implement distribut reason system appli applic date georgeff pr architectur conceptu root model practic reason develop michael bratman colleagu bratman tandem evolut pr architectur product theoret foundat bdi model close investig rao success pr term demonstr applic problem theoret date systemat attempt unambigu defin oper attempt direct rao rao georgeff give abstract specif inform discuss extent embodi satisfi axiom bdi theori rao specif high lend direct implement relat attempt embodi agentspeak languag develop rao program languag base abstract pr irrelev implement detail pr strip bare essenti build dinverno luck construct formal specif dinverno forthcom specif rao origin descript couch term state oper state easili refin implement system base simplifi version specif start point actual specif sophist system continu extend give abstract formal specif system base provid oper semant provid benchmark futur bdi system implement compar specif abstract import aspect dmar system unnecessari detail omit approach similar formal specif architectur develop formal specif languag close relat remaind paper structur section present overview dmar system section describ basic type primit compon section proce complex compon includ plan section specifi dmar agent descript cycl oper end paper contribut made relat previou prospect futur belief goal plan librari interpret intent sensor input action output figur bdi agent pr notat specif present languag formal specif languag base set theori logic kei compon specif definit state space system oper transform state space auxiliari function definit account bind complet account relat system found dinverno forthcom introduct explan aspect cover full dmar specif request author overview dmar procedur reason system develop georgeff lanski georgeff agent architectur pr successor dmar exampl popular paradigm approach bratman figur bdi architectur typic kei data intent plan librari agent belief correspond inform agent incomplet incorrect belief simpl variabl pascal implement bdi agent typic repres belief symbol fact georgeff agent desir intuit correspond task alloc bdi agent requir desir logic human desir fail intuit bdi system agent achiev desir consist agent fix subset desir commit resourc achiev chosen desir agent typic continu achiev intent believ intent believ intent longer achiev cohen bdi model dmar agent plan agent plan set action undertaken agent order achiev intent agent plan librari repres procedur knowledg bring state affair plan compon trigger invoc condit plan specifi circumst plan term event plan trigger event plan context circumst execut plan commenc plan context plan mainten circumst remain true plan execut plan defin potenti complex consist goal primit action plan bodi boil add add water cup boil water achiev plan execut reach point add cup add water cup primit action perform directli agent primit action thought procedur call dmar agent monitor world intern event perceiv event queue interpret figur manag oper agent continu execut ffl observ world agent intern updat event queue reflect event ffl gener desir find plan trigger event match event event ffl select set match plan execut intend ffl push intend mean exist intent event ffl select intent topmost plan execut step current step perform post subgoal event queue plan start subgoal post event queue plan achiev subgoal basic execut model dmar agent note agent plan plan gener agent programm design time plan agent consist subgoal defer point time subgoal select execut effort give formal semant bdi architectur includ rang bdi logic develop rao georgeff rao logic extens branch time logic emerson normal modal connect repres intent work bdi logic focuss relationship state rao develop proof method restrict form logic rao futur work investig relationship work oper semant paper action begin specif defin belief agent belief dmar prolog essenti ground liter classic logic posit neg atom formula order defin atom stock function predic symbol concern content specif term variabl function symbol appli sequenc term term seq atom predic symbol appli sequenc term atom head term seq term belief formula atom negat atom set belief set ground belief formula belief fb ffl bg auxiliari function assum belief return set variabl dmar agent goal term simpl tempor modal languag unari connect addit connect classic logic oper formula dmar read agent goal goal perform sequenc action oe true formula mean agent goal goal perform sequenc perform oe true order defin addit defin situat express truth evalu respect set tempor true tempor goal belief formula prefix achiev oper situat formula prefix queri oper agent goal achiev state affair determin state affair hold goal type action agent perform classifi extern case domain action environ intern case domain action agent extern action procedur call method invoc agent programm extern action extern action symbol procedur set sequenc term paramet term seq term intern action add remov belief data base prolog assert retract note add remov atom variabl intact plan plan adopt describ plan constrain agent behaviour act intent plan consist invoc condit trigger option context situat defin precondit believ agent plan plan bodi tree repres kind action mainten condit true plan continu set intern action perform plan set intern action perform plan fail tree repres bodi state arc repres intern action extern action defin execut plan successfulli involv tree root leaf node defin trigger event trigger event plan adopt type event acquisit remov receipt acquisit goal type trigger event process ii ii note plan bodi tree arc label goal action state place holder state import defin set arc plan bodi label intern extern subgoal branch defin plan bodi dmar plan bodi end tip fork state set branch lead tree bodi branch bring compon definit plan formal definit option type relat found appendix plan inv context option bodi bodi succ seq intact fail seq intact plan bodi call primit plan fp plan ffl pg instanti plan basic execut mechan dmar section involv agent match trigger context plan chosen event event queue current set gener set match select make plan instanc plan instanc copi origin plan environ plan bind gener execut current state reach plan root plan set branch attempt branch attempt identifi uniqu identifi plan instanc agent owner set statu plan indic plan part indic plan temporarili branch action subgoal branch fail remov set branch branch agent attempt agent chosen branch attempt choic made substitut type repres set substitut bind variabl function prefix appli substitut dmar express substitut denot composit function prefix mgu function return gener unifi express descript relev definit found appendix plan instanc formal defin statu activ suspend plan env substitut state state branch option statu statu id state state state branch auxiliari identifi set branch state plan give state plan specif give state plan appli current state branch determin start state plan plan current state state plan plan reach end fail end state branch fail branch fp fp fp fgg intent intent dmar sequenc plan instanc extern intent creat gener plan instanc creat intern event agent respond plan concaten intent plan top intent stack plan execut intent intent seq event consist trigger event plan instanc identifi identifi set plan instanc fail event trig id option env option failur option extern event exist plan instanc enter buffer plan instanc gener subgoal event intern event occur branch execut intent achiev goal achiev immedi variabl event defin constraint domain environ variabl event trigger event trig ran undefin env undefin failur event trig ran defin env defin failur oper semant dmar agent oper dmar agent driven interact intent event addit delet gener goal provid trigger execut plan agent plan librari event post agent event plan select agent plan librari relev applic event determin plan relev applic event reduc attempt unifi invoc condit context event set applic plan found agent gener plan instanc ad current intent agent plan intend mean plan dmar sequenc action goal choic point path order complet plan plan determin action agent give rise gener occur agent effort carri plan formal model specifi relev applic plan determin event gener add exist agent select intent execut depend current compon behaviour requir action execut directli lead post event modifi goal lead instanti post event execut plan section detail specif dmar agent cover agent agent gener relev applic event execut final achiev failur plan dmar agent state bdi dmar agent consist plan function function function altern function select branch plan attempt intent intent plan plan seq event event substitut substitut branch state aspect chang time compon agent belief ground belief event process belief intent event seq event oper affect state dmar agent agent agent provid event queue set belief intent subsequ intent gener action seq event belief intent event agent perceiv extern event end event buffer event event event relev applic plan plan relev respect event exist gener unifi bind trigger event plan event equal function event set plan ps return set relev plan ps event oe gener unifi signatur function defin gener unifi appendix event subgoal event substitut appli trigger event relev plan gener event event lib ffl undefin lib fp oe substitut oe ffl defin lib fp oe substitut oe ffl relev plan applic context logic consequ belief agent defin hold situat formula belief base situat formula logic consequ belief base logic consequ defin applic plan relat hold relev substitut current set belief set plan substitut make current return applic plan updat substitut bel ffl bel substitut rel ffl oe process event dmar agent state defin dmar oper cycl mode depend event buffer empti event buffer event select relev plan applic plan determin applic plan select gener plan instanc extern intent plan instanc singleton sequenc creat intern plan instanc push intent stack gener event fail plan instanc intern event auxiliari function plan creat plan instanc initi state event extern updat includ id event event event ffl event belief ffl ffl ffl instanc ffl event instanc event intent intent event event event intent event ffl intent intent execut intent remaind section address agent oper event buffer empti refer intent execut oper variabl includ schema enabl specif intent execut written defin reset oper cycl event buffer variabl set undefin option option option step select identifi execut top intent stack plan select branch plan event intent activ case type select introduc schema move state branch delet branch fail auxiliari plan instanc move state determin branch variabl execut plan depend branch extern intern queri achiev goal extern branch extern execut immedi success failur model function plan instanc select branch extern return bind function model action fail substitut success bind action substitut environ ran dom branch reach schema oper achiev extern action move state defin tree defin composit oper unsuccess branch fail state chang ran occur branch remov intern branch intern action local variabl modifi action action result chang event ad set event intact belief bs ffl add bs bs fbg remov bs bs fbg action ffl belief belief action action belief belief event event action belief belief event event auxiliari schema simpli construct event constitu compon oper case queri environ appli goal unifi set gener unifi gener chosen bind substitut environ state reach relat hold goal set belief goal unifi belief ran subgoal subgoal ran queri env ffl substitut ffl env env ffl env unif branch fail ran subgoal subgoal ran queri env ffl substitut ffl env achiev unifi rest execut plan unifi previou branch succe goal goal achiev event execut plan suspend set statu set instanc defin set empti set identifi intern event set current execut plan ran subgoal subgoal ran achiev suspend subgoal env ffl event event achiev goal execut cycl oper perform achiev fail plan success branch lead state end case execut branch end case plan succe substitut appli success give sequenc ground intern updat perform ground action time current set belief give set belief auxiliari definit fold appendix env ffl map ffl belief fold belief case plan succe plan current substitut updat includ bind achiev environ plan success plan instanc remov top select intent execut origin stack return set variabl trigger event intern event gener complet plan remov ffl ffl tail activ ran event ran event ran event intent remov extern event gener intent intent ran event ran event ran event branch fail branch attempt plan fail plan intent fail complet substitut environ appli plan fail ground fail intern perform plan trigger exist goal event event found updat record fail plan instanc retri statu plan remain suspend event env ffl ffl map ffl belief fold belief ran event event tail conclud remark bdi model underpin dmar similar comput model agent program environ close relat concurr metatem program mulder concurr agent program give execut specif specif express set tempor logic formula form past futur execut rule proce match past time tempor logic rule futur time rule fire agent subsequ attempt satisfi main conceptu differ concurr metatem dmar model control structur explicitli code concurr execut algorithm determin attempt find execut simultan satisfi commit mulder relationship concurr metatem dmar encod interpret set concurr metatem rule paper encod abstract bdi interpret desir system execut specif framework abstract program languag formal semant term transit system base bdi model languag featur logic program imper captur featur languag kei distinct languag oper dmar agent notion event author suggest event agent languag attempt captur intuit bdi model dmar comput model oper dmar agent claim system clear strong relat semant implement made work technolog intellig agent matur expect progress earli investig work formal contribut grow bodi intellig agent present complet formal specif import agent architectur develop date specif present paper number reason understand architectur work order evalu implement evalu place formal standard softwar engin tool wide ideal medium commun oper architectur dinverno june understood method move abstract specif systemat process refin process natur languag descript reimplement evalu pr architectur languag environ realist possibl understand foundat rigor defin data structur oper structur constitut make develop proof theori architectur proof theori develop architectur rao restrict version pr exist straight line implement pr make compar actual behaviour architectur philosoph develop bdi theorist rao futur hope investig michael georgeff anand rao provid illumin insight discuss author develop specif paper australian artifici intellig support host author develop work specif document check type correct fuzz packag de identifi error origin specif refer bratman pollack plan practic reason comput cohen cohen levesqu intent choic commit artifici dinverno forthcom dinverno luck formal specif journal logic forthcom dinverno june luck formal framework hypertext system iee softwar engin emerson emerson halpern branch time versu linear time tempor logic journal genesereth genesereth nilsson logic foundat artifici intellig morgan kaufmann san georgeff georgeff lanski reactiv reason plan sixth nation confer artifici intellig page georgeff georgeff rao profil australian ai institut ieee decemb de van der formal semant abstract agent program languag volum mulder fisher agent model concurr metatem desir volum rao rao georgeff model ration agent fike knowledg reason page morgan kaufmann san april rao rao georgeff abstract architectur ration agent knowledg reason page rao rao georgeff bdi theori practic intern confer system page san june rao rao georgeff formal model procedur system technic note australian ai level la june rao bdi agent speak logic comput languag van de veld agent break seventh european workshop model autonom agent volum page spivei manual comput scienc oxford spivei notat prentic hall wooldridg wooldridg jen intellig theori practic knowledg engin wooldridg logic testb dai wooldridg intellig languag volum page januari auxiliari definit fold initi sequenc appli element sequenc initi turn function appli element list appli function element set fold map ys seq ffl fold fold fold ys xs seq ffl map map hxi hf xi map map xs map ys xs px ffl xs fx xs ffl xg assert element option definit provid option exist defin undefin test element option defin extract element defin member option option fx px xs defin undefin option xs option ffl defin xs xs undefin xs xs xs option defin xs ffl xs bind standard definit substitut map variabl term variabl term domain map genesereth repres partial function variabl term variabl map term substitut ff var term function appli ident map variabl variabl domain appli substitut domain substitut var term var ffl var ffl var defin mean substitut appli intern situat belief formula trigger substitut oe variabl bound oe composit written obtain appli term oe combin bind oe variabl bound oe oe case oe substitut substitut substitut oe substitut ffl oe fx var term oe ffl substitut unifi express appli make equal substitut gener substitut exist substitut gener unifi express substitut unifi express unifi gener defin signatur gener unifi trigger goal set trigger event goal substitut substitut substitut
Agents/1503 1 requir engin congolog wang yve lespéranc dept comput york canada approach popular softwar architectur model framework requir engin design inform languag requir engin support model social depend agent process design choic affect goal function congolog express formal process involv multipl agent tool develop support valid congolog process model simul verif formal complement develop methodolog combin requir engin languag extend process specif sr model system refin map congolog model map satisfi set map ensur specifi element model relat model consist methodolog illustr meet schedul applic introduct advent web electron trend softwar open integr system adapt chang develop start adopt system autonom entiti interact flexibl instanc work goal react environ support develop suitabl softwar engin method tool requir effort area direct design phase softwar develop focu requir engin phase requir engin start studi system requir specif autom earli phase requir analysi import phase requir analysi system desir system meet altern relationship actor stakehold interest actor achiev formal requir model languag framework requir instanc kao earli phase requir analysi gener inform support author framework develop earli phase requir analysi inform notat support model social depend agent process design choic affect goal formal languag limit support describ complex process congolog formal languag process specif agent program support formal specif complex multiag lack featur model design choic framework complement good methodolog combin present approach combin congolog framework requir analysi framework model altern desir analyz function model depend relationship actor process design congolog framework formal system behavior inform model congolog model provid detail inform goal relationship complet congolog model execut valid specif simul bridg gap congolog intermedi notat involv process specif annot sr diagram introduc set map rule constrain model map element annot sr diagram congolog entiti ensur model consist methodolog combin congolog framework earli late phase requir engin illustr methodolog meet schedul model framework framework develop model analyz organ support busi process reengin requir engin framework model intent strateg relationship actor consist main compon strateg depend model strateg model sd model captur network relationship hold actor sr model describ detail altern method actor accomplish goal task model understand exist gener altern order reach process design address object sd model graph consist node link node node repres link actor repres actor depend order accomplish goal task depend actor call actor depend call object depend relationship center call actor posit agent physic actor subsystem role function organ posit group role organ meet schedul meet initi depend meet schedul agent organ meet meet initi meet schedul goal depend relationship meet initi meet schedul base natur type depend depend bring desir state free decid achiev goal specifi depend depend complet task task specifi depend depend avail inform physic resourc express depend depend achiev goal achiev vari optim depend vulner case fail bring strength depend sd open critic sd model intent depend actor usual understand base entiti flow activ model obtain deeper understand process identifi impact depend fail sd model describ process structur support process evalu altern solut strateg model model address sr model graph consist main type main type link link link describ task subtask subgoal link goal achiev provid inform actor perform pursu model altern chosen section give model meet schedul applic congolog model framework congolog framework process model agent program base situat calculu languag predic logic repres dynam chang world congolog framework model complex process involv multipl framework accommod incomplet initi state system complet process involv nondeterminist evolv number wai congolog model domain includ compon specif domain model initi state action action perform effect specif process behavior agent involv domain congolog situat dynam domain model term agent involv system repres meet schedul agent applic primit world result primit action perform agent primit action repres particip agent accept request ms agent attend meet date correspond world histori view sequenc action initi situat action repres constant distinguish binari function symbol term denot situat result action perform situat sequenc action order obtain situat term read action instanc left repres histori perform start initi situat function chang situat situat interest repres predic function symbol situat term particip receiv request ms hold meet date situat dynam domain kind action precondit axiom state condit action predic mean action situat meet schedul precondit situat particip perform action accept request ms hold meet date receiv request effect date free successor state axiom fluent affect action domain meet schedul successor particip receiv request ms hold meet date situat action request request counter receiv request situat successor state axiom gener automat specif effect primit action assum wai fluent chang successor state axiom introduc provid solut frame problem describ conveni notat effect action tool compil specif successor state axiom initi situat axiom initi state model system meet schedul initi situat agent yve busi initi situat process system procedur congolog model main procedur behavior agent congolog procedur repres behavior system congolog framework includ construct commun agent repres action sender agent affect fluent recipi agent access process simul valid tool implement interpret congolog implement prolog implement requir precondit successor state axiom initi situat express prolog simul perform complet initi state verif tool develop discuss applic congolog robot person applic process model requir engin approach combin congolog sr diagram notat aspect process model produc incomplet subtask task decomposit link perform time congolog process complet process bridg gap introduc set annot sr diagram miss inform tight map annot sr diagram congolog specifi part model relat identifi part congolog model chang sr model modifi vice versa requir model defin map ensur map respect semant defin set map rule defin map methodolog combin congolog framework sr diagram annot type annot composit annot link annot composit annot appli group decomposit link sr model annot clarifi link order perform super nk figur sequenc annot appli group decomposit link type composit sequenc altern concurr priorit concurr sequenc annot put link figur sequenti perform left complet task sequenc default gener leav link annot appli individu decomposit link connect link link annot describ condit perform repeatedli type link annot annot interrupt annot annot pick annot iter pick valu variabl subtask satisfi condit annot correspond congolog oper mean map rule model defin map element annot sr diagram entiti congolog model defin map rule ensur consist asr model congolog model map respect semant formal set map map rule sr diagram node defin map rule type node asr agent goal task role posit node ensur node map congolog entiti agent agent congolog agent congolog procedur repres behavior agent refer agent refer behavior rule congolog procedur repres behavior task task congolog procedur primit action repres task goal goal congolog fluent congolog procedur select set mean achiev goal agent perform adopt refer fluent refer procedur map rule sr diagram link map rule type link asr task decomposit link link map rule task decomposit link task node node task decomposit composit annot γ appli group decomposit link link annot appli individu decomposit link ni nk congolog procedur ψ ψ ψ end γ γ congolog oper annot γ congolog procedur node ni task node ni goal node bodi congolog procedur task node decomposit defin asr diagram straightforward autom translat map rule link decomposit similar requir procedur goal node decomposit defin asr diagram addit fluent goal true procedur complet execut deal depend role posit sr model depend depend accomplish task goal suppli resourc sr model gener abstract detail interact agent congolog model oper aspect process aspect repres depend relationship congolog model requir model depend asr suffici extent task perform depend interact ensur suppli task goal result map congolog normal detail depend depend case fill model section discuss issu complet resolv definit map studi complet map sr diagram node link congolog fluent map practic point answer analysi simul paramet procedur goal list explicitli present hidden explicitli made visibl tool easili support goal declar procedur interpret procedur specifi select set mean achiev goal procedur achiev goal termin treatment diagram notat support distinct gener system system instanc simul extend captur distinguish design goal goal distinct fuzzi map rule view give formal semant annot sr diagram map notat languag semant larg consist abstract axiomat semant develop view formal semant sr diagram gener point semant diverg respect decomposit gener assum congolog map rule assum accommod distinguish set decomposit studi issu requir methodolog combin congolog framework outlin methodolog step build strateg depend model applic sd model specifi intent depend relationship applic step build strateg model applic sr model identifi insid decomposit contribut altern depend relationship node insid step build annot strateg model applic involv suppress unnecessari inform sr model link depend suppress process altern select suppress relativ goal goal achiev interact depend realiz actor fill process detail annot task goal annot atom applic decomposit ensur process system suffici level detail step develop initi congolog model model map element asr model entiti congolog model conform map complet definit initi congolog model primit precondit successor state axiom system step valid congolog model simul verif specif initi state simul experi perform develop congolog model result valid evalu model iter step refin congolog model object met model congolog model modifi base result valid model refin part model continu object achiev step produc requir specif document note step perform analyst success work introduc annot congolog domain specif case meet schedul process case studi deal meet schedul applic drawn initi requir process express meet determin meet date locat intend particip effect altern select process involv meet schedul agent particip assum maintain time schedul process oper roughli receiv meet schedul request ms request potenti particip inform avail meet date rang provid initi particip repli set date date suit ms notifi initi particip fail find date schedul meet ms select date particip meet date particip meet date schedul time particip initi notifi confirm meet date particip reject date occupi ms inform particip accept date cancel date notifi initi meet schedul fail build strateg depend model strateg depend model meet schedul process base figur special actor sd model figur specifi depend actor provid model understand process altern develop meet organ model figur actor meet agent import role node link repres depend meet initi depend attend meet sd repres depend link initi particip initi particip assur import particip meet meet initi particip schedul enter enter resourc depend meet schedul task depend agent goal depend role depend critic depend figur strateg depend model meet schedul process depend type express kind relationship depend involv type freedom constraint meet initi depend meet schedul schedul meet model goal depend meet schedul decid achiev goal figur resourc isa depend depend task depend describ kind depend actor sd model analyz meet schedul process term intent relationship actor desir system model understand opportun vulner actor abil meet schedul achiev goal repres opportun meet initi achiev goal initi vulner schedul fail achiev build strateg model sr detail level model perform actor model intern intent element model extern intern element link relationship sr model figur elabor relationship actor repres sd model figur meet goal intern goal intern task altern mean achiev goal altern contribut repres task subtask obtain date particip subgoal find date slot resourc depend suppli subtask obtain agreement particip task repres resourc depend element accomplish subgoal achiev wai subtask refer specif wai accomplish task intern enter date meet resourc indic agreement attend meet subtask develop annot sr model develop annot sr diagram detail descript process map congolog model diagram larg figur show part concern particip diagram develop suppress unnecessari inform initi sr model simplifi sr diagram suppress node link node initi sr relev map sr model congolog model focu schedul meet particip attend suppress node depend node initi figur suppress task node select altern schedul meet meet schedul goal node suppress particip passiv answer request meet schedul reli meet schedul find agreeabl date meet initi attend particip organ meet meet particip attend arrang low meet meet quick schedul effort conveni qualiti schedul agreeabl meet richer medium schedul enter initi enter schedul meet slot obtain agreement meet schedul merg legend goal task resourc link actor link actor boundari contribut agreement figur initi strateg model meet schedul process relativ goal achiev figur goal achiev date particip attend meet weaken goal achiev attempt schedul meet made mean achiev goal refin ms particip particip meet schedul meet particip send obtain agreement figur annot sr model particip depend discuss involv make explicit interact task involv depend provid task depend figur introduc task particip perform receiv request meet schedul task make request introduc ms subtask shown figur fill process detail annot add annot subtask iter condit shadow rectangl area figur task node subtask node group decomposit link label concurr annot mean subtask perform concurr link connect node accompani annot mean request agreement date task perform develop congolog model model map entiti asr diagram element congolog model complet develop model give exampl describ map rule appli entiti annot sr model obtain initi congolog model node map role node map congolog procedur behavior particip task node shadow rectangl area figur map congolog procedur task ms request agreement date ms request cancel agreement link map discuss earlier task node subtask annot subtask perform concurr condit hold bodi congolog procedur annot decomposit link asr diagram map element asr diagram congolog process begin domain dynam primit action fluent introduc model relev featur domain successor state axiom model primit action affect fluent illustr give exampl congolog domain specif primit action model action particip accept request ms attend meet date exogen action model action agent system particip occupi date schedul predic fluent model fact occup date time schedul acknowledg exogen action function fluent time schedul particip defin fluent model fact ms wait particip meet date primit successor state axiom captur affect primit action domain successor axiom fluent request occupi date schedul acknowledg situat result action situat action acknowledg occup acknowledg situat note notat prolog implement congolog action precondit axiom primit action precondit axiom action action perform situat particip receiv request ms hold meet date date free valid evalu congolog model simul complet congolog model execut run process simul experi model instanc system defin main initi agent meet schedul particip yve concurr execut oper congolog implement model initi state system meet date repres integ order simplifi explan initi time schedul particip busi time schedul particip yve yve busi initi schedul meet yve model execut main procedur obtain simul trace simul trace obtain instanc system start interrupt initi situat request schedul meet yve request enter date rang meet enter feb meet date request date particip yve send date send date find merg date empti notifi fail schedul meet step methodolog involv find gap error specif simul process altern specif compar refin congolog model produc requir document step repeat error inadequaci found process model congolog model perform simul determin model lack element desir modifi appropri similarli find congolog model addit detail aspect modif made satisfactori model requir system requir specif document produc approach requir engin involv combin congolog framework requir engin exploit complementari featur framework model social depend agent perform analysi opportun busi goal process design model tradeoff analyz congolog model complex process model valid altern process compar simul verif notat support progress specif process commun client approach integr framework involv sr diagram extend rich set process specif annot annot sr model provid specif process result diagram map directli congolog model set map rule defin constrain model map element annot sr diagram entiti congolog model ensur model consist trace element model made methodolog develop guid analyst requir combin congolog framework approach case studi detail test methodolog case studi involv busi applic requir engin framework exist relat languag build elicit formal framework design distribut system base tempor logic state behavior constraint express notat aspect state action agent formal typic pattern constraint identifi support analyst requir elabor combin requir engin investig approach paper attempt develop intermedi notat enabl direct map formal framework work independ al extend sr diagram combin congolog support model analysi trust agent network extend sr notat repres task precondit explicitli interpret trigger annot plan compar studi extend sr notat work combin sd diagram formal notat base tempor logic analyz model check techniqu relat kao framework formal model function nonfunct requir framework address issu requir requir specif work framework target system work fulli realiz benefit approach develop tool analyst complet step methodolog tool broader achiev work verif method tool congolog framework integr methodolog methodolog test realist project extend methodolog design phase system develop refin methodolog model mental state agent extend version congolog framework explicitli repres knowledg goal modal affect commun action percept action refer requir engin method deal function msc dept comput formal specif agent case proc st intern confer system san de levesqu concurr program languag base situat artifici du albert ii languag design formal specif languag requir phd dept comput van requir scienc comput model check earli requir specif submit ieee intern symposium requir engin model impact trust distrust agent proc intern workshop inform system nr agent yu model dynam domain advanc inform system intern june lnc vol berlin situat calculu approach model program wooldridg foundat ration requir posit intern workshop inform system june philosoph problem standpoint artifici machin edinburgh frame problem situat simpl solut complet result goal artifici intellig mathemat theori paper honor john academ san model multiag system cognit agent specif languag featur interact resolut intellig agent volum vii workshop agent languag commun system agent system requir engin congolog msc dept comput york methodolog analysi jp agent intern confer autonom model reason support requir proc ieee int symp requir engin model strateg relationship process phd dept comput du duboi organ model system requir cooper inform trend papazogl academ
IR/1504 5 queri evalu mediat web catalog yanni nicola pano depart comput greec institut comput laboratoir de recherch en universit de franc email abstract web catalog open directori queri web index fraction page index search engin catalog domain expert high qualiti present model build mediat web provid user custom view catalog focu queri specif complex queri answer mediat introduct search inform web requir user pose queri control vocabulari structur control vocabulari effect retriev forc user sourc familiar term ontolog requir pose burden user extract inform sourc ontolog index object sourc increasingli distribut natur inform reason expect user unrealist expect user familiar ontolog index solut singl standard ontolog narrowli defin subject solut feasibl altern solut provid softwar solut permit user pose queri necessarili index search softwar translat queri term search render heterogen sourc transpar user mediat concept mediat initi wiederhold architectur function mediat determin kind underli mediat relat sourc retriev system model build mediat sourc kind web catalog author present paper studi queri evalu model specif complex queri answer mediat sourc sourc consist ontolog interpret ontolog pair set subsumpt relat reflex transit relat interpret function obj associ term set obj denot set object underli domain term sourc correspond comput user sourc formul subsumpt relat concept ai comput comput store interpret extens concept term object underli domain typic sourc defin web catalog web catalog consist set term structur subsumpt relat term set url word set obj web catalog set url figur show sourc store object denot natur number dash orient line connect object term solid arrow solid line synonymi defin iff rdb db comput scienc ai articl figur graphic sourc queri boolean express string deriv term interpret extend interpret set queri answer queri base store interpret subsumpt relat sourc answer queri model terminolog interpret model sourc answer queri minim model greater denot comput tg mediat mediat sourc consist ontolog set articul sourc articul subsumpt relat figur show mediat sourc provid access electron product articul shown figur set subsumpt store store articul articul product cam electron reflex camera camera reflex instant miniatur figur mediat catalog electron product mediat receiv queri terminolog store interpret mediat answer queri interpret obtain queri underli sourc mediat sourc comput interpret term mediat send sourc queri approxim term union answer return sourc definit approxim base articul mediat specif approxim term respect articul lower denot upper denot approxim defin fs sa tg fu ta fu ta ug exampl approxim mediat shown figur miniatur instant reflex reflex reflex reflex reflex mediat obtain interpret obtain send sourc lower approxim term send upper approxim evalu queri base interpret answer queri set object set user desir answer inform user retriev object relev inform prefer user miss object relev inform prefer queri evalu mediat evalu queri send queri sourc complex measur queri number queri mediat send sourc order answer user queri reason measur complex mediat spend lot time wait answer sourc queri singl term evalu ap ap ap fs ap tg ap mediat send queri sourc tabl show maximum number queri mediat send respect form queri analysi show queri conjunct normal form queri disjunct normal form evalu requir send smaller number queri sourc specif queri queri form dm jn evalu ap ap ap jn queri queri form jn evalu ap ap jh mediat convert user queri cnf evalu cnf queri send queri sourc recal queri logic connect convert dnf cnf exist algorithm queri form max num call singl term disjunct tn conjunct tn cnf dm jn dnf cm jn tabl complex queri evalu mediat mediat model defin user view web catalog analyz complex queri evalu model easili mediat store interpret terminolog drive network mutual articul sourc environ build system user terminolog order queri page web refer antoni inform john wilei hector jeffrei jennif widom system chapter prentic alon divesh thoma kirk model queri evalu global inform journal intellig inform salton modern inform mcgill yanni data fusion inform retriev mediat intern confer comput system june yanni nicola pano inform intern confer web inform system wise decemb yanni nicola pano translat mediat inform confer artifici april collect fusion text retriev confer wiederhold architectur futur inform ieee
Agents/1505 1 intellig agent avatar huang vrije amsterdam de boelelaan hv amsterdam netherland abstract approach programm intellig agent support distribut logic program languag dlp intellig agent avatar consid applic web agent testb web develop implement soccer plai avatar discuss languag dlp support soccer plai avatar rule guid behavior network virtual environ categori subject descriptor artifici miscellan gener term intellig agent keyword intellig distribut logic network virtual environ introduct recent applic network virtual virtual develop popular virtual commun server activ world interact simpl static user avatar avatar repres intellig agent significantli improv interfac capabl network virtual environ commun server provid support agent agent commun server program attribut react anton vrije amsterdam de boelelaan hv amsterdam netherland vrije amsterdam de boelelaan hv amsterdam netherland event origin agent call bot opinion function agent surpass simpl bot term agent larg number event rich repertoir agent platform limit pattern power program complex behavior requir maintain inform period time approach programm intellig agent avatar support distribut logic program languag dlp research part dutch research project web agent support program part research project develop person assist maintain electron archiv gener architectur web agent interfac agent focu approach agent develop implement soccer plai avatar web benchmark exampl web agent framework web agent architectur taxonomi web agent type web agent recent rang ecommerc inform gather seek travel assist virtual commun negoti problem solv agent natur question relat phenomenon relat type web redund taxonomi classifi taxonomi web encompass agent provid interfac inform retriev guid visitor navig virtual environ section introduct taxonomi web agent major dimens web agent versu web agent awar ftp web agent awar virtual realiti specif protocol typic web agent provid inform retriev servic typic web agent guid visitor navig virtual environ client versu server client web agent client server web agent server side typic client web agent serv person inform assist typic server web agent serv web server offer inform intellig singular versu multipl singl web agent cooper web framework multipl web agent exhibit agent collabor pattern order achiev common goal figur lattic web agent type web agent base consist complex lattic web agent type outlin figur top complex bottom dimens exhaust dimens versu combin base dimens versu agent gener base current taxonomi dimens taxonomi directli dimens specifi internet protocol agent awar dimens concern internet servic mode agent dimens determin agent commun languag function dimens directli relev cooper problem solv negoti agent discuss dimens domain seek agent agent taxonomi cover type agent agent client agent server singl agent multipl agent combin type web agent suggest type interact mode user web server detail web agent focu discuss web agent exampl describ typic web agent web agent configur web shown figur agent part virtual realiti virtual commun interact multipl user agent user commun virtual realiti server web browser agent interact virtual realiti server commun web user agent virtual embodi avatar web agent web browser user virtual realiti server web agent web browser user web agent web browser user figur web agent kind web agent great deal applic rang guid visitor inform retriev task navig virtual shop assist agent intellig agent multipl player comput game agent relationship server user similar counterpart multipl singl agent serv server user directli commun intellig web agent locat server side agent regard portal server access kind web agent intellig offer creat person virtual environ base queri request relat virtual realiti web user shown figur agent locat client serv person inform assist virtual realiti web browser user virtual realiti server web browser user web agent web agent figur server web agent web user commun server user web browser directli web agent user web agent omit figur reason type web agent chat agent serv intellig person assist user inform interfac intellig web agent architectur web agent lot intellig agent architectur agent commun popular architectur bdi architectur consist mental attitud intent extend bdi architectur web bdi architectur extend set sensor shown figur architectur cover web provid interfac inform retriev web agent guid visitor navig virtual environ focu architectur web compon interfac virtual function sensor effector web agent web agent extend bdi architectur interfac virtual world built virtual realiti model languag vrml vrml popular languag network virtual environ describ complet set sensor sensor effector ad develop web agent core primit sensor predic web agent viewpoint viewpoint intent effector desir belief sensor figur extend bdi architectur web agent rotat core effector primit web agent load vrml set viewpoint set viewpoint set set rotat distribut logic program distribut logic program combin logic object orient program parallel distinguish featur dlp respect support distribut backtrack result rendezv object dlp languag implement intellig web motiv languag function dlp accept syntax semant logic program languag declar suitabl construct softwar architectur domain artifici intellig flexibl languag reason manipul knowledg belief dlp incorpor object orient program make tool program object orient featur dlp shown figur distribut dlp distribut program languag dlp program execut comput distribut architectur dlp multipl thread control singl make conveni tool implement reactiv agent dlp declar object object declar variabl var destruct assign erm express occurr replac current object method commun accept bodi bodi figur featur dlp program compil java make power tool implement mobil web agent extens dlp extens languag requir applic domain easili integr exist languag framework extend system vrml includ sensor effector primit mention vrml eai author counterpart includ oper manipul agent object relat attribut predic consist float number assign sf object benchmark soccer ing select soccer game benchmark exampl test implement web agent explor scenario avatar plai soccer game vrml virtual world avatar support ordinari human intellig control activ dlp object dlp program control scenario game formul physic dynam soccer behavior soccer ball score game demonstr version wasp soccer game download wasp web site program run netscap web browser vrml browser instal screenshot soccer plai game shown intellig agent avatar wasp soccer game cooper player reason posit cognit model soccer formul physic soccer discuss soccer agent role base control soccer player avatar classifi soccer player soccer player user soccer player control softwar soccer player user control human user avatar plai goal forward role activ area soccer field player cognit shown figur avatar sensor retriev inform current situat main inform sourc agent soccer ball goal gate posit perceiv inform part belief stage avatar reason posit decid base desir inform current belief compon result set set intend action avatar effector intend action cognit model soccer game current version soccer requir agent rule soccer penalti free corner simplifi soccer soccer player kick action pass belief desir intent act figur cognit loop intellig avatar agent wasp soccer game simpl cognit model soccer agent inform critic make kick consid critic distanc ball distanc ball goal distanc player goal ball distanc agent directli kick goal distanc agent kick ball runnabl distanc agent run distanc agent pass ball desir player desir gain kick goal player prefer shoot pass ball simplifi soccer game player show intellig behavior formal physic soccer ball virtual coordin point repres soccer ball kick initi point initi veloc due graviti neg step step step figur soccer ball behavior static start soccer game var url var main ball ball object soccer game figur start soccer game dlp vx vy time bodi drop surfac earth soccer ball kick ground static start total time soccer ball kick fall back ground calcul equat behavior soccer ball kick static start express dlp shown figur multipl thread control dlp creat multipl thread control make easi model behavior multipl player start figur ball dlp eyebrow eyebrow eyebrow lip figur facial anim dlp shown figur extens dlp extend set core primit web agent primit extend higher abstract level soccer player avatar soccer defin oper term core primit oper shown figur intellig behavior game plai avatar heavili depend situat knowledg agent avatar inform determin plai strategi reason posit player oppon posit soccer ball logic program languag offer conveni knowledg shown effect tool programm intellig agent avatar gestur facial anim wasp soccer avatar gestur design anim control rout avatar control dlp program decid gestur made dlp program creat gestur anim avatar avatar compliant humanoid figur simplifi dlp program control facial anim embodi agent commun eyebrow approach programm intellig agent support distribut logic program languag dlp select soccer player avatar benchmark exampl web agent wasp soccer game experi shown technolog intellig web agent distribut logic program conveni power tool implement distribut intellig agent avatar refer interact wolfgang thoma symbol avatar act share virtual dlp web anton languag distribut logic law soccer anton alex van paul de taxonomi web intern workshop expert system ieee comput pp anton paul de architectur web confer humanoid anim work de ey commun synthet ai io virtual realiti model part function specif virtual realiti model part extern author model ration agent intern confer principl knowledg morgan kaufmann action analysi collabor analysi advic robocup wasp project home ai agent virtual realiti world program intellig vr
HCI/1506 4 architectur persist storag £ abstract john david yan steven patrick denni sean chri ben zhao berkelei util infrastructur design span globe provid continu access persist inform infrastructur untrust data protect redund cryptograph techniqu improv data cach anytim monitor usag pattern adapt region denial servic monitor enhanc perform movement data prototyp implement develop introduct past decad growth perform comput devic rapid pace miniatur relat reduct power consumpt devic base world ubiquit comput devic add intellig adapt ordinari object revolut comput devic reliabl resili complet transpar user pursu question immedi persist inform persist inform permit behavior devic independ devic compon replac lose vital configur inform loss destruct devic lead lost data note uniform infrastructur access manag persist inform provid transpar synchron devic maintain consist devic infrastructur user safe access inform devic £ research support nsf career award darpa grant darpa grant patrick support nation scienc engin graduat fellowship denni support john hertz support intel master fellowship ninth intern confer architectur support program languag oper system asplo usa copyright acm simultan share requir manual synchron ubiquit comput place requir persist infrastructur form connect provid comput matter small level connect provid consum wireless data servic inform secur assum extra measur make inform protect ey malici hand inform extrem durabl submit infrastructur earliest sort proper order consist commit archiv inform automat reliabl inform divorc locat central server subject unavail due region network bandwidth core internet doubl latenc improv quickli connect leav network high low bandwidth achiev uniform access server geograph distribut exploit cach close client model inform free migrat style share memori multiprocessor rough imagin provid servic roughli file support file true data util cooper util model consum pai monthli fee exchang access persist storag util emploi automat replic disast strong secur provid perform similar exist network storag system circumst servic provid compani user pai fee consum storag bandwidth resourc provid bui sell capac make differ airport small instal server give custom return small particip global util user data economi scale yield reliabl geograph distribut server support deep archiv storag surviv major disast region time desktop workstat routin ship ten gigabyt spin manag data storag media hope advantag excess storag space make manag data seamless uniqu goal system design goal differenti similar abil construct untrust infrastructur support nomad data untrust assum infrastructur fundament untrust server crash warn leak inform parti lack trust inher util model cryptograph system client trust inform enter infrastructur encrypt assum server passiv repositori inform cf server particip protocol distribut consist manag assum server work correctli class server trust carri protocol behalf trust content parti integr data nomad system larg local extrem import goal data cach illustr figur call polici cach data flow freeli call nomad data note nomad data extrem consequ separ inform physic locat cach complic data coher great flexibl optim local trade consist avail exploit continu introspect monitor discov tacit relationship object result local manag cach import distinct system nf af cach data confin server region network system xf system connect fast lan rest paper section overview system section show sampl applic section architectur section report statu current prototyp section examin relat work conclud remark section system overview prototyp develop section overview plan system detail individu system compon left section fundament unit persist object object global uniqu guid pool pool pool pool figur system core system multitud highli connect data freeli client connect intermitt object replic store multipl server replic avail presenc network partit durabl failur attack replica independ server resid refer float replica replica object locat mechan probabilist algorithm attempt find object request machin probabilist algorithm locat left determinist algorithm object modifi updat updat inform make object assum state object bayou system updat object creat version consist base implement cleaner recoveri face system failur obviat backup support pointer inform object exist activ archiv form activ form object latest version data handl updat archiv form repres version object archiv version object encod code spread hundr thousand server data reconstruct suffici larg subset result short global disast destroi inform call highli redund data encod deep archiv storag applic writer view number session session sequenc read write request relat session style bayou system session dictat level consist read rang support extrem consist semant support acid semant favor support legaci arrai familiar interfac unix file system interfac simpl transact interfac applic semant avail provid consist group updat combin creat plan provid interfac retir eleph file system pool pool pool flexibl afford mechan promot system exploit number dynam optim control migrat object classifi optim head architectur paradigm formal automat dynam optim emploi system applic section present applic applic construct enabl develop easili complet provid singl infrastructur difficult problem problem includ data dynam durabl disconnect oper solv problem applic develop focu concern obviou class applic groupwar person inform manag contact distribut design tool applic challeng implement concurr updat peopl requir user view share conflict occur flexibl updat mechan solv problem wai merg inform detect infrastructur dissemin inform interest parti ubiquit access data devic access inform email interest groupwar target email applic mundan implement difficult obviou solut filter messag singl email server scale distribut solut complic intern consist issu email simultan written numer user read singl user messag move occur atom face concurr access client avoid data loss email requir privaci secur natur allevi client implement lock secur enabl power featur nomad email collect disconnect oper introspect permit email migrat closer reduc round trip time fetch messag remot server enabl disconnect oper optimist concurr oper local cach email disconnect modif automat dissemin reconnect addit groupwar creat larg digit librari repositori scientif data applic requir massiv quantiti turn requir complic manag common mechan store manag larg data collect replic data durabl avail deep archiv storag mechan permit inform surviv face global disast benefit applic provid seamless migrat data quickli dissemin vast stream data physic laboratori research world analyz data ideal platform stream sensor data aggreg dissemin specul util data eman plethora small mem sensor uniform infrastructur aggreg huge volum data result system architectur describ underli technolog support system start basic access control proce descript data locat locat object world discuss updat model issu involv consist manag untrust infrastructur word architectur archiv discuss api present client provid descript role introspect lowest object identifi global uniqu identifi thought bit string user access facil provid facil decentr resist attempt adversari belong adapt idea path due object guid secur hash kei scheme server verifi owner facilit access check resourc account object act map guid arbitrari directori hierarchi directori pointer directori user directori secur directori extern public kei author root directori root respect client system root scheme solv problem gener secur guid reduc problem secur kei lookup address problem local link space framework note guid identifi number entiti server archiv fragment guid server secur hash public guid archiv fragment secur hash data hold section entiti address directli guid access control support primit type access reader restrict writer restrict complic access control work construct restrict prevent unauthor encrypt data system complet public distribut encrypt kei user read permiss revok read owner request replica delet kei reader prototyp system secur hash note user public kei public kei privat public object share group read data cach copi server fail delet problem uniqu convent forc reader forget read restrict prevent unauthor requir write sign server client verifi access control list owner object secur acl object foo provid sign certif translat acl object acl object indic common default acl entri extend privileg describ privileg grant sign explicit privileg user make entri publicli readabl server check write plan adopt idea system tao user express reason formal wide rang polici note asymmetri introduc encrypt read restrict client kei write restrict server ignor unauthor updat data locat rout entiti free resid server freedom maximum flexibl select polici migrat complic process locat interact entiti restrict placement data aid locat tackl problem data locat paradigm queri network activ role rout messag object distribut rout address entiti float archiv identifi guid entiti function replica identifi guid client interact entiti seri protocol subsequ section support messag label destin random small predic destin ip address messag role rout layer rout messag directli closest node match predic desir guid order perform rout network layer consult data structur explicitli track locat object rout phase process messag begin rout node node distribut data structur destin discov rout directli destin import note rout layer ip addit function top ip advantag combin data locat rout task rout messag handl aggreg resourc node exploit multipl rout path serv limit power node deni servic client messag rout directli avoid multipl separ data locat rout process incur underli infrastructur inform current locat figur probabilist queri process replica ò object guid hash bit local bloom filter ò show neighbor filter ò ò intermedi node en rout object queri move ò bloom filter document neighbor neighbor ò queri forward ò verifi object client combin locat rout permit commun entiti client heard past replica move user mechan rout approach featur probabilist algorithm back reliabl hierarch method justif hierarchi entiti access frequent resid close mechan ensur local section probabilist algorithm rout entiti rapidli local vicin attempt hierarch data structur style al locat entiti found local describ techniqu section attenu bloom filter probabilist algorithm fulli distribut constant amount storag server base idea queri satisfi local inform rout queri neighbor modifi version bloom filter attenu bloom implement potenti function attenu bloom filter depth view arrai normal bloom filter context bloom filter record object local current node bloom filter union bloom filter node distanc path current node attenu bloom filter store direct edg network queri rout edg filter presenc object smallest distanc process illustr figur current metric distanc futur hope includ measur roughli latenc appli local distanc node protocol automat rout class attack figur portion global root node path node root tree resolv id digit bold arrow show rout node node data locat structur note object search travel root global distribut data locat global algorithm variat random hierarch distribut data structur emb multipl random tree network version data instruct understand basic scheme server system assign random construct mesh neighbor shown figur link label level number denot stage rout link link construct divid chunk bit level node point closest neighbor match lowest node id combin link link link construct node meet proper scheme node match constraint close process repeat node level node kei observ make figur link form seri random node root tree neighbor link rout simpli resolv address link structur data map object singl node match guid bit call node root inform guid store find inform simpli neighbor link reach root node guid scheme nice load distribut guid randomli map infrastructur mean respect underli ip rout infrastructur roughli measur metric time rout ip random distribut reduc scheme achiev local replica locat rout infrastructur publish process work root deposit pointer hop process requir ç ò ò number server world search climb tree run rout directli object author show averag distanc travel proport distanc sourc queri closest replica satisfi queri achiev fault basic scheme sensit number failur object singl singl point potenti subject denial servic avail problem address weak simpl hash guid small number salt valu result map root gain redund simultan make difficult target singl node denial servic attack rang guid problem scheme sensit corrupt link pointer import structur suffici redund toler small amount corrupt bad link immedi rout continu jump random neighbor node locat structur supplement basic link scheme addit neighbor link infrastructur continu monitor repair neighbor link form section server slowli repeat publish process repair pointer advantag distribut advantag data structur highli redund structur spread data locat load evenli find local object quickli combin probabilist global algorithm comfort scale million server aggreg inform data structur suffici recogn server identifi data reconstruct server perman remov featur import maintain minimum level redund deep archiv storag link form natur substrat perform network function admiss control multicast achiev exist work data structur includ algorithm onlin creation mainten global produc node insert remov algorithm make redund neighbor link mention gener public algorithm support replic remov failur data locat optim failur mode beacon detect fault field react rout algorithm minim cost recov lost node inform coupl continu repair mechan recogn tree span node reach root server long time data reconstruct practic implic work infrastructur automat adapt presenc absenc server human greatli reduc cost manag updat model applic section exhibit high write share concurr updat avoid problem inher emploi updat model base conflict resolut conflict resolut introduc bayou system support rang consist includ acid semant conflict resolut reduc number abort scheme optimist concurr control conflict resolut requir abil perform comput data untrust replica access server trust perform commit issu complic updat architectur current design handl type conflict resolut directli encrypt data paragraph describ issu involv progress solv updat format semant data object made list predic action semant updat appli updat data replica evalu predic order predic evalu action earliest true predic atom appli data updat commit updat abort updat log commit abort note updat semant similar bayou elimin merg procedur arbitrari comput manipul ciphertext intract preserv kei function found express number sampl applic includ group share bibliograph mail applic model appli applic coda provid specif merg procedur conflict updat type conflict resolut easili support model slight extens model support lotu conflict unresolv conflict result branch version stream model provid acid predic made check read set action appli write pair extend model work ciphertext replica trust inform complic updat restrict set predic replica comput set action appli predic search predic trivial note natur inform make reconstruct section block block block encrypt insert block block block block figur block insert ciphertext client insert block append block replac block block point append block server learn content block object oper easi encrypt technolog block client simpli comput hash encrypt block submit block number comparison impress predic perform directli ciphertext oper reveal search perform boolean result search string server initi search addit oper appli append assum block append oper simpl reason perform group block object index block data index block pointer block object replac block insert point block point block insert append object scheme illustr figur replac block question empti pointer block note scheme leak small amount inform suscept user uncomfort simpli append encrypt log record object reli power client gener object log scheme present section impact format object scheme subject ongo flexibl techniqu follow serial updat untrust infrastructur process conflict resolut start seri total order appli atom order easiest comput order requir updat pass master replica trust replica perform task incompat untrust infrastructur assumpt built replac master replica primari tier replica replica cooper agreement protocol final commit order updat secondari tier replica commun primari tier enhanc epidem bayou class float replica motiv protocol agreement protocol assum ñ total ò ñ replica faulti figur path updat gener client send directli primari random replica object primari tier perform agreement protocol commit secondari replica propag updat epidem primari tier finish agreement result updat multicast dissemin tree secondari replica ant arbitrari replica failur hand replica primari tier consist small number replica locat region network offlin verif parti particip explor proactiv signatur techniqu certifi result serial process hope extend protocol techniqu applic gain perform avail requir lesser consist acid semant applic motiv secondari tier replica secondari replica particip serial incomplet copi numer primari replica organ multicast call dissemin serv conduit inform primari tier secondari tier dissemin tree push stream commit updat secondari serv commun path secondari replica pull miss inform parent primari replica architectur permit dissemin tree transform updat invalid progress transform exploit leav network bandwidth limit secondari replica tent commit data emploi commun pattern quickli spread tent commit pick tent serial order chanc tent order match final order chosen primari client optimist timestamp updat secondari replica order tent updat timestamp primari tier timestamp guid order serial secondari tier safe decid untrust applic requir stronger consist simpli wait updat reach primari tier direct path client archiv storag full path updat shown figur note path optim low latenc high throughput ideal choic replica includ primari tier left ensur chosen group satisfi assumpt mention tent data data primari replica commit updat flow directli client primari tier serial multicast secondari server messag shown address section updat protocol oper refer physic locat replica import aspect differ exist system fact archiv mechan tightli coupl updat activ final order tier server sign result send dissemin tree server gener archiv fragment distribut wide updat made extrem durabl direct commit process section discuss archiv storag detail effici consist protocol main point interest effici consist amount network bandwidth protocol latenc updat creat client receiv notif commit abort assum agreement protocol total cost updat byte ò ù ò ù size ò number replica primari size small protocol messag equat domin ò constant order byte suffici small ò larg equat domin ò term ò minimum amount byte transfer replica date ùò figur show cost normal minimum function updat size note ñ ò normal cost approach updat size approach updat size byte updat byte system doubl minimum amount network bandwidth replica primari tier date recal ñ number faulti replica toler agreement protocol normal cost updat size figur cost updat byte normal minimum cost send updat replica latenc estim consist protocol difficult function prototyp suffic phase messag protocol assum latenc messag wide area domin comput time messag approxim latenc updat latenc complet prototyp system verifi accuraci rough estim deep archiv storag archiv mechan emploi interleav code code code process treat input data seri fragment transform fragment greater number fragment ò mention section fragment gener parallel tier server commit process essenti properti result code ò code fragment suffici construct origin data assum spread code fragment server prevent recoveri data call argument deep archiv storag simpl illustr assert assum uncorrel fault calcul reliabl instant time è è probabl document ò number ñ number unavail number fragment maximum number unavail fragment document retriev million ten percent simpl replic code reliabl code document fragment document reliabl consum amount storag reliabl factor support assert faster encod requir slightli ò fragment reconstruct inform fragment reliabl consequ law larg number preserv natur fragment fragment retriev correctli hierarch hash method verifi fragment gener hash hash concaten pair hash form binari tree fragment store hash neighbor path root request machin recalcul hash path hash guid immut archiv make fragment archiv complet provid syntax explicitli incorpor version number includ document form perman interfac exist examin modif histori set version polici principl version object client produc version frequent archiv copi produc object idl long time object inact gener archiv float replica object particip gener disjoint subset fragment dissemin infrastructur maxim surviv archiv identifi rank administr domain reliabl trustworthi avoid fragment locat high correl probabl failur number fragment durabl determin basi process slowli sweep exist archiv repair level replic durabl reconstruct archiv send request kei guid archiv version note make excess capac insul slow server request fragment absolut reconstruct data fragment request propag locat tree fragment discov request search nice local properti closer fragment tend discov api draw strength global wide epidem propag flexibl updat polici system complic behavior applic program interfac enabl applic writer understand interact system base api full access function term session callback session sequenc read write potenti object relat session defin level consist access session api mechan develop arbitrarili complex updat form section api callback featur notifi applic relev event applic regist handler invok occurr relev commit abort updat applic basic requir support standard api interfac api familiar interfac transact provid abstract atop api develop access system optim comput observ figur cycl introspect term tradit transact simplifi applic job ensur proper session standard updat automat comput read set write set updat system world legaci unreason expect author exist applic port work system number legaci implement common includ unix file transact gatewai world wide web interfac exist librari exist browser oper system permit user access legaci document enjoi ubiquit secur perform advantag introspect consist million server vari disk comput power server devic fail sporad server network load vari moment moment manual tune system larg vari prohibit complex design oper util manual tune involv cooper administr boundari address emploi architectur paradigm mimic adapt biolog system shown figur introspect augment normal oper observ optim observ modul monitor activ run system histor record system behavior emploi sophist extract pattern observ optim modul result analysi adjust adapt comput introspect mechan system insuffici space describ give flavor techniqu architectur design common architectur introspect system figur system process local forward summari distribut hierarchi form approxim global view system event includ incom messag noteworthi physic measur approach framework atop develop specif observ optim modul high event rate preclud extens onlin process level fast event handler summar local event summari store local leav resid loosen durabl restrict local observ order attain event rate machin initi receiv roughli messag local area network file system rout infrastructur requir commun proport logarithm size network event stream event handler db forward aggreg process issu local optim command figur fast event handler summar respond local event soft state process analyz trend aggreg inform node describ event handler simpl languag languag includ primit oper averag explicitli prohibit loop expect model provid suffici enabl verif secur resourc consumpt restrict event handler level power algorithm period process inform level perform sophist incorpor histor system detect respond trend process respond level node forward summari knowledg parent node process wider scale infrastructur standard locat mechan locat identifi guid distribut inform remot optim modul object access standard locat mechan introspect introspect manag number subsystem discuss compon cluster cluster recognit attempt identifi group close relat file client machin event handler trigger data object access handler increment construct graph repres semant distanc data requir oper access run cluster algorithm consum graph detect cluster object frequenc oper adapt stabil input process resourc result cluster algorithm forward global analysi layer publish small object describ establish cluster directori object remot optim modul colloc prefetch relat file replica replica manag adjust number locat float replica order servic access request effici event handler monitor client request system note access specif replica exce resourc allot access request overwhelm forward request assist parent node track local creat addit float replica nearbi node allevi load replica manag elimin float replica fallen notif termin propag parent adjust dissemin tree addit node regularli analyz global usag addit optim detect period migrat cluster site site prefetch data base cycl user find project file email folder local machin work wait home machin night introspect mechan aspect introspect improv manag perform rout enabl construct effici updat dissemin ensur avail durabl archiv identifi peer perform continu confid estim optim order reduc harm feedback cycl statu implement prototyp deploi test evalu system written java state request model fast commun applic unix file system interfac proxi world wide web addit nativ api explor requir secur place storag architectur explor differ enforc read write permiss untrust import abil client valid correct data return explor includ check integr data check data request data level metadata protect strongli data prototyp cryptograph file system provid testb specif secur mechan prototyp probabilist data locat compon implement verifi simul result show algorithm find nearbi object effici implement prototyp archiv system code redund encod half fragment requir reconstruct found issu request extra fragment prove benefici due drop request implement introspect prefetch mechan local file system test show method correctli captur presenc combin mechan optim modul network relat work distribut system tao assum untrust network reli trust comput base cryptograph file system cf provid includ provis share protect integr independ secreci secur file system support share access control fail provid independ support trust singl server distribut encrypt kei project similar assum untrust address infrastructur address problem secur distribut kei certif decentr manner maker deal descript trust relat path separ kei manag system secur bloom filter commonli compact larg set distribut calcul demand implement effici semijoin summari cach push bloom filter cooper web method scale number cach distribut data surviv studi extens file system commun summari distribut file system found bayou coda replic improv avail consist introduc special conflict resolut procedur replic cach improv avail consist incur perform penalti face multipl writer system address rang secur concern bayou examin problem occur replica corrupt grai al argu replic differ class system describ bind float replica specif replic object server tier float replica similar transact taxonomi algorithm perform valid check commit time contrast similar merg predic number transact abort due cach previou project explor adapt extens oper system file system global oper system storag devic project emploi differ techniqu analyz respect introspect model project formul concept semant distanc collect cluster relat file autom file system observ drive automat prefetch introspect replica manag web content examin radar project consid data trust infrastructur project address replic econom model optim commun cost select locat replica placement singl administr domain similar project cauchi code archiv wide scale durabl anticip combin activ archiv object form greater updat perform retain surviv benefit rise ubiquit comput spawn urgent persist inform paper present util infrastructur design span globe provid highli access persist object properti distinguish util untrust support nomad introspect enhanc perform maintain util model make notion global system introduc possibl server system assum server run adversari trust oper perform encrypt inform nomad data permit wide rang optim access inform bring enabl rapid region attack optim assist continu onlin collect analysi access pattern construct paper present design element algorithm implement convinc reader infrastructur desir obviou acknowledg peopl instrument refin thought alphabet william michael jim jame joseph anthoni josh david dawn bill doug steve richard wheeler acknowledg enthusiast support darpa program jean industri fund ibm refer abadi link local space proc ieee acharya zdonik effici scheme dynam data replic technic report depart comput brown wang network file system proc acm dec proactiv secur toolkit applic proc acm cc page nov blaze cryptograph file system unix proc acm cc nov decentr trust manag proc ieee bloom hash code error commun volum page juli theimer feasibl distribut file system deploi exist set desktop pc proc june rashid oper system direct millennium proc castro liskov practic fault toler proc usenix symp chaudhuri index analysi util proc acm sigmod page june wang cooper remot client memori improv file system perform proc usenix symp nov welch bayou support data share mobil user proc ieee workshop mobil comput system dec theimer design implement asynchron collabor applic bayou proc acm symp user interfac softwar page certif theori rfc broder summari scalabl web cach share protocol proc acm sigcomm page sept livni transact cach altern perform acm transact sept goldberg yianilo archiv proc ieee page apr shasha danger replic solut proc acm sigmod volum page june reduc file system latenc predict approach proc usenix summer technic june memori architectur ieee sept system architectur direct network sensor proc nov west scale perform distribut file system acm transact comput feb secur file system proc atlanta linux oct replic document manag group commun system proc acm cscw sept satyanarayanan disconnect oper coda file system acm transact comput feb long predict action prior event proc usenix winter technic page jan design predict cach system proc ieee workshop mobil comput system dec kung robinson optimist method concurr control acm transact june gener problem acm levi silberschatz distribut file concept exampl acm comput dec analysi low densiti code improv design irregular graph proc acm lohman optim valid perform distribut queri proc intl conf aug anderson improv perform file system adapt method proc acm oct separ kei manag file system secur proc acm ousterhout cach network file system transact feb nist fip digit signatur standard norman page mit tutori code system softwar practic sept access nearbi copi replic object distribut environ proc acm page rhode june aggarw dynam object replic migrat protocol internet host servic proc ieee page june rivest simpl distribut secur infrastructur lyon design implement sun network filesystem proc usenix summer technic june decid forget eleph file system proc acm dec seltzer small oper system proc page yu data replic proc ieee page feb search encrypt data publish proc ieee terri deal server corrupt weakli replic data system proc page sept stonebrak design postgr storag system proc intl conf sept weiser comput scientif sept sullivan hp hierarch storag system acm transact comput page feb authent tao oper system proc acm page dec
AI/1507 2 expert system analyz rule deploi essenti verifi configur properli problem find configur network administr parti perform technic secur audit organ problem approach techniqu prefer exist tool analyz configur reli algorithm analyz access list paper present tool base constraint logic program user write higher level oper detect common configur mistak tool understand cisco router access implement constraint logic program languag problem analyz configur lend natur solv expert system found surprisingli easi logic statement express knowledg common configur instanc exist gener infer engin focu defin core concept relationship knowledg base introduct essenti organ connect internet simpli configur properli configur written languag hard understand order rule import difficult find connect servic configur bring relat express secur polici languag understood find configur problem occur network administr parti perform technic secur audit organ present tool helsinki technolog tor analyz rule tool design administr question network traffic tool list port host network traffic analysi base sole configur file topolog inform user tool implement constraint logic program present eleg framework ad rule make complex queri addit perform simpl oper find rule tool includ expert knowledg field knowledg includ detail network protocol secur common configur mistak real life flexibl offer logic program make ad oper check easi rest paper organ section describ background expert logic program present basic structur concept knowledg section function demonstr concret section relat work briefli discuss section section evalu approach light altern solut give idea futur work section research background due space assum reader background network function router connect network segment base restrict traffic flow network depend protocol layer oper classifi packet circuit applic level proxi techniqu emploi organ connect internet kind permit udp host eq deni udp host permit udp eq permit udp host eq deni ip figur cisco router access list note fourth rule match rule router simpl packet filter router addit complex product router simpl packet lack good user interfac desir secur polici simpl packet filter simpl order list rule cisco router access list shown figur packet list scan start action match packet match default action rule includ end list make easier verifi list truncat separ list network interfac rule field ip protocol level protocol tcp sourc destin ip field upper level tcp udp port number complet discuss syntax rule cisco match rule easi make mistak write access list long hundr rule fourth rule figur match packet stop rule expert system expert system comput program solv problem answer question problem domain ordinarili requir human goal achiev combin logic infer engin knowledg base inform knowledg base set fact set product rule infer fact acquir inform expert system appli wide rang industri commerci problem typic applic includ process monitor control promin applic expert system secur field detect survei good overview field constraint logic program logic program program paradigm logic infer solv problem give comput step requir solv logic program logic fact depend describ solut infer engin solv problem constraint logic program logic program extend constraint satisfact capabl constraint satisfact gener oper unif normal logic program unif oper resolv structur final exact constraint satisfact add possibl constrain valu variabl abil set gener constraint real clp system type linear equal inequ real number complet explan constraint logic program system work scope paper interest reader check textbook applic logic program comput logic techniqu comput secur rang gener secur test case aix oper system analyz cryptograph protocol implement tool major knowledg infer user interfac structur typic expert system knowledg base collect fact product rule repres store knowledg problem domain infer engin process unit solv present problem make logic infer fact rule store knowledg base user interfac control infer engin manag system input output knowledg core detail infer engin user interfac briefli discuss end section knowledg base knowledg base system collect logic rule fact express program languag declar languag make easi express knowledg mix inform comput detail knowledg base static dynam inform knowledg network protocol common configur access list inform network topolog user start system combin prolog standard logic notat show exampl rule knowledg base make easier reader prolog background understand express prolog style omit existenti qualifi expect variabl start capit existenti qualifi repres packet simplest fundament concept system packet ip packet repres sourc destin sourc destin entri number flag field tcp repres packet start connect syn bit set ack bit repres packet belong exist connect predic defin basic concept knowledg proto src dst flag declar span discret space call individu packet thought point packet space part packet space give constraint declar specifi set tcp packet destin http port host proto dst repres access list access list collect packet filter rule rule consist rang match packet action token packet filter treat packet match rule access list rule process order match found match rule specifi action packet filter system repres access list rule constraint packet space defin rule part packet space hypercub defin action token rule udp eq rang token system rememb line number content rule declar access list file repres entir access list order collect rule defin packet match list algorithm rule knowledg base approach turn counterintuit ineffici overcom difficulti eleg simpl access list decid split rule access list file rule decorrel result rule set ad knowledg base predic shown proto src dst flag predic correspond access list rule permit tcp host eq standard logic notat fact knowledg base collect logic statement actual syntax defin knowledg base straightforward map logic notat import notic rule mean clp ordinari actual clp system syntax ordinari ordinari prolog rule test packet match clp rule answer question kind packet rule base predic infer engin find answer question action packet permit access sourc packet destin auxiliari inform store infer engin answer question packet rule permit packet repres topolog connect network effect analyz access network address rang locat interfac inform repres knowledg base simpl indic connect internet address explicitli mention access list combin topolog inform construct higher level construct workstat server mail server intern network zone predic indic tcp connect sourc address host port implement simpl predic simpli inform network predic note predic check action syn packet expect permit packet connect permit common check predic requir action packet make predic detect erron configur predic answer question host connect telnet port web connect host extend knowledg base knowledg base system extend ad higher level rule fact exist concept knowledg basi design function connect concept defin previou section good start point rule predic test dn server access correctli udp tcp web server dn server router extern network figur network hypothet small compani ppp network termin server internet predic queri permit incom tcp connect slightli complex sourc section infer engin infer engin tool constraint logic program languag base prolog exist gener tool concentr core problem avoid labori implement work gain standard extens platform proven perform qualiti port system constraint logic program languag easi user interfac user interfac tool preprocessor access list set input output handl simpl command prompt interfac manag system user interfac compon administr interact inspect access list oper implement tool classifi queri oper access list queri network data flow access expert rule recogn solv common configur problem oper categori concret section user interfac written prolog librari preprocessor text file cisco access list written perl facil string experi perl program user interfac function oper concret figur illustr network hypothet small compani network intern network workstat zone web extern network internet servic system administr load access system descript topolog type user shown inform store file shell cisco read decorrel cisco read decorrel cisco read decorrel interfac interfac int interfac ext network int network network network ext network ext internet network properti basic problem analyz access list recogn network data flow list exampl common servic access access kind traffic network host question easili answer predic infer engin queri knowledg base find substitut free variabl goal user interfac compon collect result present easili readabl format command show servic host web server udp servic port tcp servic port report show servic sourc address port correctli access port access intern network good idea depend case end user trust configur problem oper mention previou section implement directli specif behavior access list requir addit simpl expert system recogn common configur problem mistak simpl oper block direct broadcast packet destin broadcast address connect insuffici prevent address incom outgo packet domain system server reachabl tcp work fine predic check kind configur problem easili built top defin predic network properti proper block direct broadcast check shown report show broadcast packet extern broadcast properli block section describ oper easili built exist rule access list properti properti access list analyz oper access list recogn rule match configur mistak fourth rule figur network administr intend smtp protocol host earlier rule block packet rule rule rule rule permit tcp host eq permit tcp host eq defin predic oper previou section real power tool li abil easili add higher level rule knowledg base demonstr describ rule check address spoof host locat interfac spoof address packet network sourc address network locat interfac express interfac unfamiliar comma end line repres conjunct underscor wildcard match predic directli find spoof ext net repli substitut make queri true result show extern interfac miss ip rule add coupl line output readi spoof relat work research perform problem express secur polici languag understood tool creat access list commerci product access control list manag secur polici manag modern product specif rule graphic user interfac work similar analysi engin base graph repres expert knowledg rule harder logic program tool support network address translat turn commerci product corpor similar work base logic background al order binari diagram analyz access list effici manipul find redund rule instanc system express custom rule logic program syntax research implement tool describ content access list base approach guttman describ approach gener filter base secur polici verifi packet filter implement secur polici describ tool print human readabl descript access list al written tool draw access list graphic form implement packet call packet classif problem receiv lot attent work perform issu hardwar feldman give recent summari good bibliographi topic perform issu directli relat problem detect conflict packet filter al appli techniqu analyz access list secur al present fast algorithm detect conflict evalu futur work main benefit system logic program gener infer engin logic program make easi express extend knowledg base system knowledg express standard declar languag close match construct logic gener infer case greatli reduc implement effort system prototyp implement system coupl week fulli express knowledg build user interfac tool show solv kind analysi problem requir custom algorithm data structur tool demonstr constraint logic program problem feasibl possibl enhanc user hide prolog syntax make tool easier support complex rule make tool realworld environ port system open sourc clp commerci environ requir bui interest develop possibl problem clp capabl possibl access list implement higher level secur polici express logic constraint abil analyz configur import circumst exist tool base algorithm approach make ad function harder difficult emb knowledg common configur mistak gener constraint logic program system logic program make easi write function analyz expert knowledg repres compact form analyz cisco router access show approach work practic acknowledg comment earlier version provid access list test refer stefan detect taxonomi survei technic report depart comput chalmer march alain manag toolkit ieee symposium secur page christoph tool build configur comput summer usenix associ cisco cisco io router product command refer cisco access control list manag overview novemb jacqu cohen constraint logic program languag commun juli janet matthew john wei secur test aix system call prolog summer usenix page june robert edward feigenbaum expert system artifici intellig system japan technolog evalu david internet packet filter manag rectangl geometri annual symposium discret algorithm page januari feldman tradeoff packet classif ieee page tel march joshua guttman filter local enforc global polici ieee symposium secur detect resolv packet filter conflict ieee infocom page tel march scott algorithm router access list technic report depart comput south juli scott raymond algorithm improv depend filter rule list intern confer depend system network page june ieee comput societi press scott anton andrew binari diagram router access list technic report depart comput south octob susan hinrich bridg gap annual comput secur applic decemb ieee comput societi press kent gil held cisco access list field guid march jain introduct system electron technolog direct year page ieee comput societi press alain analysi engin ieee symposium secur page andrew architectur advanc packet filter usenix unix secur salt lake june model cryptograph protocol helsinki decemb lui sanchez matthew secur polici protocol work internet draft juli christoph implement technolog doctor purdu decemb mark stefano joachim platform constraint logic program technic imperi august architect analyz usenix secur august
HCI/1508 4 platform ivan rutger adapt collabor wire wireless platform architectur collabor environ xml adapt share data dynam devic wide dispar capabl expand reach wireless link mobil termin establish infrastructur permit individu roam interact collabor complex workspac classic expert cad model workstat collabor field handheld devic possibl collabor elabor advanc visual technolog small portabl devic graphic librari digit pocket librari obstacl collabor hing dispar platform network interact comput storag user broadband wire servic mere make difficult meet applic requir client equip rang workstat multimod interfac elabor graphic cell wearabl comput small displai address manifold develop rutger center advanc inform process approach develop collabor multimedia applic abbrevi distribut system collabor inform process relat approach repres data modifi gener standard medium standard commun protocol user obtain subset share data visual differ user amount data present visual techniqu reflect interest juli august ieee ieee internet comput collabor system toolkit address applic data share dissimilar termin share displai al develop adapt share displai devic degrad imag match hardwar capabl author user replic applic appli reduct groupwar toolkit emploi separ develop creat distribut data model drive implement distribut model case central groupwar architectur simplifi develop groupwar true heterogen requir exist groupwar system sharma group system polici architectur relat work collabor dissimilar devic comput commun capabl articl begin introduc architectur abstract collabor task edit data descript role xml manag heterogen intellig softwar agent discov network comput environ condit present instanti furnitur arrang applic test approach groupwar architectur architectur structur data defin format repres develop control data adapt xml data exchang xsl stylesheet data present adapt su comput platform heterogen affect semant consist project introduc proxi adapt heterogen client commun heterogen network author appli architectur web collabor desktop pda client pda essenti act remot displai proxi maintain share applic make support difficult disconnect client oper adapt effort realiz potenti inform exchang heterogen wireless applic protocol forum standard wireless markup languag xml languag optim present user interact termin cell phone compani nokia offer wap architectur util separ time publish research method applic share kei applic adapt task support interact tailor devic adapt task devic collabor center share data set store repositori distribut structur data repres hierarch organ semant object data set repres engin text virtual world sake assum data structur tree gener direct acycl graph tree structur effici data type settl data type simplifi groupwar design collabor applic render data object user interact render multimedia command design abstract data call adapt collabor separ dynam runtim adapt interact applic model visual heterogen devic refer tw tool packard vol pp architectur synchron conf cooper work acm groupwar groupwar acm tran vol mar pp experi heterogen collabor proc european conf cscw pp fox network client variat activ ieee person comm issu adapt network client wireless applic markup languag approv specif feb download ieee internet comput juli august wireless platform intellig agent intellig agent user javabean inform collabor bu network fabric bean inform transform wire collabor internet protocol multicast model share object basic data unit consist global uniqu identifi kei list oper creat delet modifi properti intellig agent inform transform properti geometr id form hierarch data structur approach world wide web model standard medium commun protocol prescrib client server specif repres data repositori commun protocol permit access perform primit oper repositori messag repres xml client server applic understand commun standard commun applic develop user tailor applic devic comput network resourc framework figur show architectur framework figur show framework ponent figur show simplifi view architectur distribut heterogen wire client belong class wireless client server compon client server javabean administr function unlik client support user interact wireless option act proxi deal data imag video intellig agent plane ensur client particip effect heterogen collabor session knowledg base track comput qo requir translat client profil defin type level inform abstract agent inform transform modul base profil adapt incom data visual outgo data network transmiss transform data platform capabl user inform modul maintain suit inform abstract algorithm inform abstract aim reduc inform content maintain ensur fundament object integr mobil wireless client exampl inform abstract includ juli august ieee internet comput wireless gatewai intellig agent bean inform transform wireless collabor figur architectur collabor framework compon includ javabean suppli applic distribut compon heterogen environ show wireless client constitut shade access capabl text central compon collabor handl common groupwar process abstract specif applic built infrastructur consist commun channel applic subscrib publish kei replic state share data repositori server maintain data client access xml document client join session access repositori content store local offlin work client server local server repositori maintain synchroni system support synchron asynchron collabor import associ work time zone unabl particip synchron session unlik framework requir continu user continu work link temporarili wireless connect includ proxi data applic logic resid client proxi share javabean applic applic guid creation custom applic end user complet applic runtim select import javabean share permit group share bean repres applic enhanc gener java applet enhanc web browser function collabor select base task hand import select bean workspac manipul import bean part applic interact object bean awar distribut servic share interact javabean event model event sourc distribut data gener manifold bean handl heterogen primarili level repositori user repositori action long properti hashtabl applic logic interact level creat manifold framework facilit develop collabor exist heterogen comput environ manifold design pattern includ base packag java interfac basic default implement interfac assist applic develop manifold architectur consist vertic applic domain storag tier present tier virtual free applic logic simpli visual domain data accept user input domain tier handl semant data manipul task rule tier manag collabor provid framework partial resid manifold bean focu permit abstract user activ data repositori conceptu model shown figur describ applic logic set primit oper sequenc addit passiv gener editor permit behavior object trigger behavior includ detect spreadsheet cell coordin manipul task includ data search sort user issu primit oper facilit user present tier visual adapt collabor behavior properti action histori ieee internet comput juli august figur conceptu model gener repres unifi model languag notat collabor task abstract edit repositori gener data wireless platform manifold bean user present bean domain bean figur event exchang intercept manifold bean command gener local user affect domain bean action pass command collabor broadcast remot peer tool modifi graphic call refer correspond composit glyph user modifi glyph properti editor similar javabean properti directli glyph manipul manipul process step primit oper gener pass domain tier execut properti edit direct manipul encapsul primit oper command object command class implement command pattern track argument valu invok oper repositori oper undon redon manifold compon commun pass command messag present tier manifold bean commun domain tier pass client commun client server command messag focu data manipul event propag maintain independ client server domain present bean glu execut environ assum singl bean manifold interact collabor bu send receiv collabor command figur show bean interact manifold bean dispatch command local domain bean collabor bu simultan bu local command reflect depend concurr control algorithm implement present domain distinct bean packag singl bean permit mix match complex bean domain bean implement complex behavior present bean implement visual vari realism depend user download pair demand control modul manifold bean equip inform provid download domain bean base comput network environ characterist xml data transform visual object devic comput commun capabl requir content transform desktop client repres object great part repres independ handheld wireless client permit simpl client visual object coordin convert vice versa simpl solut discard ad coordin work rotat difficult handl multimedia object imag video repres problem figur illustr basic process data adapt assum user interact client α result command carri inform activ command consist sequenc primit oper graph creat vertex delet vertex modifi vertex properti command transform format deliv remot transform render command deliveri site β stage transform decid primit oper command appli remot site oper appli remot local repositori true juli august ieee internet comput client α α β follow program data adapt reflect interest platform capabl properti type op oper convert match remot domain java small devic support coordin convert integ make imposs data format client final result op β op β op β op β data adapt agent transform data xsl transform xslt α β α server ω β client β inform transform transform advantag compliant xml markup languag plan agent power rule descript automat learn maintain consist distribut repositori repres graph isomorph problem due graph isomorph gener client state consist repositori graph approxim isomorph subgraph repositori graph current research determin exact condit map maintain state consist intellig agent network awar deploi system build environ task intellig adapt collabor ieee internet comput juli august β repositori graph figur transform adapt data client structur repositori graph ui mobil client applic na agent na daemon base station na manag infer engin proxi gatewai snmp manag snmp agent na daemon na data repositori internet figur network awar servic awar task distribut na agent mobil host na manag wireless preserv wireless bandwidth comput resourc wireless platform na manag na agent applic activ na servic interest activ registr subscript messag applic queri case case case agent figur agent span architectur layer inform make intellig agent network environ determin transform inform exchang match data domain comput network capabl agent dynam determin manifold bean composit base client devic capabl profil compon intellig agent determin commun link measur throughput wireless link transmiss qualiti framework automat adjust environ appli inform transform data adapt overview network awar architectur show network applic optim heterogen commun environ wire wireless link exist detail network awar architectur adapt network applic awar network paramet figur show servic design provid inform applic main na na data na na agent unlik tradit network awar framework measur task occur sole mobil na framework measur network condit piec piec network awar includ discern mobil wireless fix wire segment na manag na agent integr intermedi measur part manag repli final result applic na agent implement awar techniqu deleg measur snmp network manag agent minimum configur infer make architectur lightweight small devic na framework distribut na compon mobil devic shift awar task na agent mobil host na manag preserv wireless bandwidth comput feat proven analyt result deploi network awar queri network awar agent applic qo requir subscrib inform broadcast agent figur illustr gener procedur network applic startup runtim phase startup phase proactiv runtim phase proactiv reactiv mode bandwidth awar commun channel measur bandwidth conceptu bandwidth bottleneck link space estim bottleneck characterist packet travel queu contigu pair bottleneck space proport process juli august ieee internet comput agent repli applic queri agent queri figur commun procedur network applic network awar agent time agent repli time requir bottleneck link transmit packet modifi techniqu present appli asymmetr wireless link inform bandwidth prove import applic present wireless cellular link connect palm pilot network narrow bandwidth larg latenc make imposs broadcast direct object manipul event collabor queri framework link bandwidth delai buffer manipul event link collabor busi icon manipul object manipul deliv buffer event collabor anim happen manipul test manifold test sought answer practic gener arbitrari user collabor manifold offer extens architectur build collabor applic oper gener structur data editor applic logic edit data repositori remain task platform data paramet accuraci differ domain bean dispar process machineri remain java class platform applic implement test date includ collabor virtual environ collabor situat speech signal acquisit imag medic diagnosi system diagnosi applic sampl manifold creat graphic editor versu object trial applic develop enabl creation collabor virtual environ shown figur sampl collabor virtual environ built telepoint current locat line sight figur floor plan render plan correspond room shown figur telepoint view figur requir special hardwar oper keyboard support magellan space movement navig space perform primit oper op creat simpl geometr figur light furnitur object composit import file telepoint composit adapt collabor ieee internet comput juli august wireless platform op delet op set properti manipul constraint furnitur object light addit properti spread angl user appli affin transform manipul glyph user command result primit oper move figur background group requir primit oper user uniqu telepoint function primit avatar discret telepoint reflect posit orient line sight figur show applic develop desk shown figur oper tree includ op creat simpl geometr figur polygon bitmap imag figur group composit op delet op set properti contour fill manipul constraint movement line arrow spline properti user appli affin transform manipul glyph telepoint arrow point current view differ typic found sidebar page show posit orient control visibl micro edit limit devic develop simpler version run palmpilot basic function rotat accept user input palm stylu button human factor experi devic heterogen affect human explor question instanti approach furnitur arrang applic applic present task view consist platform capabl conduct experi measur displai differ affect collabor result show hinder platform user perform collabor displai user observ user speed visual fidel exchang access inform futur work abstract collabor task edit data approach synchron collabor preserv applic logic platform task main differ groupwar applic present logic address differ visual interact tool present modul platform current framework lack featur group concurr access control design implement featur follow pattern establish consist applic logic platform combin present logic proxi complement approach data imag plan explor futur mobil devic cpu memori resourc displai network full applic feasibl small devic approach unlik approach requir continu user continu work link temporarili includ proxi data transform applic logic resid client proxi juli august ieee internet comput issu address pertain ubiquit comput applic download run platform focu data commun protocol liber develop tailor applic access devic continu work concentr develop applic improv perform data transform repositori network data adapt inform project heterogen web site acknowledg research contributor project includ professor jame marilyn allan meng graduat student liang research support nsf contract darpa contract rutger center advanc inform process corpor affili refer framework multimod collabor heterogen acm comp vol june architectur heterogen groupwar proc conf softwar engin ieee pp world wide web extens markup languag home extens stylesheet languag home sa roth user interfac environ explor proc inform ieee pp onlin advanc commun toolkit implement broker proc ieee conf distribut comput system ieee pp cheng framework end network awar servic heterogen data submit public gamma design element reusabl rl carter bottleneck link speed tech report comput scienc boston mar examin proc conf system scienc ieee jan ivan assist professor electr comput engin rutger chief architect system current research interest includ mobil comput interfac member ieee acm consult industri govern reader contact author inform comput visit digit librari write ic adapt collabor ieee internet comput magazin applic support seek articl develop internet technolog leverag engin appli internet aim support individu collabor coordin work articl peer review submit pdf postscript submiss relev typic subscrib ic illustr applic effect specif technolog test applic hard result prefer prototyp includ test result submiss longer word detail author guidelin ieee internet comput juli august
Agents/1509 1 belief system van frank de wieb van der hoek ch meyer utrecht depart comput scienc po box tb netherland abstract de ne program languag system agent interact common environ cooper exchang individu belief environ handl inform agent emploi oper remov updat individu belief base tradit concurr program inform system constraint system repres environ belief agent give syntax program languag develop oper semant term transit system introduct lot ort made develop program languag system cover typic agent concept speech cooper concurr aspect exist multiag languag lack clear modular due intricaci interact agent featur signi canc modular discuss contribut fisher al ect fact exist languag fulli understood semant point view order obtain semant multiag program advoc increment approach design languag start contribut schild bdi logic volum li tradit concept mechan introduc studi research area concurr theori concept parallel concept order model epistem featur agent ect observ interact main characterist present shift tradit gener mechan studi implic context interact agent act reason common world opinion present framework provid solid basi extens deal motiv attitud desir intent instanc increment modular develop advoc framework studi interact epistem motiv attitud agent preliminari paper examin abstract program languag agent interact pass inform repres store constraint call sati ed properti inform inform ind nite present restrict environ satisfi enabl concentr set gener program framework present drop assumpt behaviour environ inform remov workspac major impact agent inform obtain observ true respect current environ belief updat view system system interact agent inhabit extern environ feet agent assign mental state consist intent focu agent cope inform acquir environ explicitli state mentalist notion agent belief environ speci assum agent framework maintain privat store call belief constitut belief environ agent acquir examin ect current belief base updat conform newli acquir data sourc agent abil observ environ abil share inform mean commun understand issu system figur build consist wait room servic agent stai wait servic room build focu agent stai wait room observ agent room agent track number agent insid sum number agent wait room number agent servic observ separ assum agent commun commun channel initi situat agent observ assert fact agent insid build belief base agent empti subsequ event agent observ number wait agent equal observ assert agent commun assert agent agent commun assert agent agent leav servic room build exit observ agent agent report event commun assert wait agent leav wait room agent situat observ assert examin strategi agent emploi deal inform occurr event remark abstract notion time assum assert observ agent consid reliabl assert obtain mean commun entranc exit wait room servic room fig system naiv approach rst approach process belief updat mind agent maintain belief base updat fact acquir agent event belief base fact occurr event belief agent overrul assert note wise thing agent observ ey fact contradict discrimin approach discrimin approach solv problem sketch agent act strategi accept inform commun consist current belief base emploi event agent reject assert inconsist belief agent hold belief approach satisfactori light event strategi reject inform inconsist current belief base situat note wise thing split approach overcom drawback discrimin strategi suggest belief base divid belief result observ observ belief result commun commun situat depict figur label diagram repres inform updat updat observ belief commun belief fig belief updat scheme circumst agent decid updat belief introduc split belief care agent belief stai consist procedur agent observ inform condit observ belief updat recent inform obtain inform mean commun commun belief result consist observ belief figur updat commun belief carri case updat observ agent commun belief inconsist belief agent recov inconsist event inform commun belief agent overwritten inform event agent observ belief overwritten assert commun belief left consist observ belief remark imaginari situat possess commun belief belief remov commun belief observ assert split approach ii claim approach outlin satisfactori examin event detail addit agent clue ect observ total number agent instanc distinguish case wait agent left build entranc case wait agent enter servic explicit ground belief deal strategi observ con ict agent observ commun belief appli commun belief agent observ assert remark observ serv trigger answer current relat mean commun agent approach section reveal updat strategi belief base order show consequ strategi develop program develop program framework light split approach ii workspac integr constraint abil observ workspac abil agent establish fact section workspac constitut describ emploi notion integr constraint express properti structur behaviour data workspac satisfi time distinguish type integr constraint type constitut persist present inform store remov integr constraint hard necessarili repres workspac obei workspac time situat outlin persist constraint fact number agent build equal sum number agent wait servic room hard constraint fact integ program framework describ includ construct identifi persist constraint workspac assum agent access background theori consist hard constraint workspac obei rest paper section describ inform system underli program languag de ne syntax oper semant languag section conclud section outlin direct futur extens framework constraint system order stai close concept eld concurr program concentr set focu constraint languag repres inform languag repres workspac belief base construct accumul denot hide constraint oper logic oper uniform mechan describ workspac belief base updat de nition constraint system true var set variabl constraint languag cover collect primit constraint constant true var denot accumul hide constraint oper repres refer variabl occur constraint denot arbitrari denot workspac denot belief base constraint system system outlin introduct var zg variabl refer number agent wait denot number agent servic number agent build refer total number agent system typic primit constraint assert denot vector xn abbrevi xn project variabl de ned def var de ned logic syntax program languag de ne program languag agent interact share environ languag build concept underpin concurr program concurr constraint program commun sequenti process algebra commun process analog languag constraint system intend program agent system built agent oper parallel interact extern environ repres workspac framework outlin figur side diagram show interact mechan observ establish fact commun back ground window workspac establish commun agent commun belief observ belief agent observ theori fig agent interact inform sourc side gure depict inform sourc agent agent maintain privat belief base consist observ commun access background theori consist hard constraint workspac sati es possess privat window observ workspac de nition program formula vector variabl commun channel belief base de ne atom action program statement agent system est skip agent system languag de ned basic agent parallel composit agent construct mean constraint workspac persist execut agent system encapsul agent system commun channel local agent basic agent denot vector program belief base behaviour agent execut primit action establish verifi observ workspac commun agent agent control mean program familiar program express parallel denot pre xing stand denot call procedur skip stand statement succe side ect assum set procedur declar form denot bodi procedur construct skip abbrevi agent belief base constitut belief obtain observ environ belief obtain denot notat write denot write sourc denot agent assign model variabl variabl give rise window part workspac agent variabl requir agent establish constraint variabl mention agent variabl number agent wait agent number agent framework assum vector suppress notat write de ne agent window workspac part workspac agent access workspac constraint inaccess variabl hidden de nition window workspac respect variabl de ned window def mean program construct clear subsequ section discuss oper semant oper semant theori belief updat tradit distinct type updat belief base addit potenti inconsist result base belief base adjust longer deriv updat adjust belief base consist deriv agent emploi oper maintain belief base decid updat assum agent access background theori constitut hard constraint workspac subject inform consist agent current belief made light background theori de nition background theori constraint de ned consist subsequ de ne belief updat oper agent framework emploi belief constraint vector variabl oper de ned def studi nement signatur collect access variabl model situat agent observ fact capabl observ red yield belief base consist conjunct constraint de ne def denot persist belief variabl oper hide constraint variabl constraint identi ed persist persist belief assum true de ne def consist updat case yield inconsist hide constraint variabl occur transit system section develop oper semant languag mean transit system plotkin cf system formal deriv transit transit system con gurat subsequ con gurat form ha denot agent system workspac perform comput step workspac agent system repres part execut label intern comput step local comput step send constraint commun channel local comput step receiv constraint channel transit system transit ha ha han ha ha cond rule transit line deriv transit line deriv cond hold transit rule transit abbrevi collect axiom transit system rule transit line identifi special symbol denot termin de ne statement agent system equal transit rule rule assum denot belief base repres base de nition consist action est yield consist workspac inform variabl subsequ refer system outlin introduct initi workspac fact sum number agent wait room number agent servic room equal fact agent wait agent exit servic room build exit model est establish current constraint result action workspac logic remark instanc action est yield workspac de nition consist var action success constraint impli agent observ belief subsequ updat case inconsist observ belief case commun belief inconsist observ commun belief situat agent belief observ number agent wait room equal heard sum number agent wait room number agent servic room equal situat event agent successfulli perform action constraint inconsist agent observ agent observ belief equal inconsist agent commun belief updat logic true de nition action succe formula impli agent window workspac observ commun belief updat case formula observ belief de nition statement def statement abbrevi choic veri cation cation case guard window window boil determinist choic agent possess belief base occurr event wait agent leav wait execut chang agent belief base inform longer valid workspac de nition de ned de nition action highli inform observ yield inform variabl visibl agent window workspac situat event workspac belief base agent agent perform updat belief base current inform variabl yield base commun focu agent sincer commun constraint constraint belief base de nition event agent possess belief workspac con ict current agent commun constraint awar con ict de nition consist constraint serv direct constraint actual inform receiv action success case updat agent commun belief formula receiv channel yield belief base deriv observ prefer commun observ belief left intact situat event agent possess belief case agent perform receiv constraint agent chang agent belief base equal inconsist observ event agent perform recept assert yield belief base nal mention event agent execut statement receiv inform current relat de nition rule pre xing procedur comput step pre xed statement consist transit pre statement denot part statement subsequ execut transit procedur call transit bodi de nition rule choic transit choic deriv transit operand execut statement skip succe leav belief base workspac intact de nition rule parallel ha ha ha ha ha ha comput step agent system comput step commun constraint channel agent agent stress label refer local comput step agent system actual commun place execut step parallel composit de nition rule persist ha impli transit workspac deriv transit result workspac deriv origin workspac deriv impli persist constraint deriv deriv transit agent system integr constraint express number agent build sum number agent wait room number agent servic construct care execut agent system persist constraint remov workspac de nition rule local ha involv channel transit agent system deriv transit case involv intern comput step intent commun channel agent agent system commun commun channel agent locat semant languag transit system rise oper semant languag identifi notion comput de nition comput sequenc ha ha ha ha deriv transit subsequ con gurat agent system sequenc nite nal con gurat transit deriv case con gurat form identifi comput successfulli termin case comput deadlock comput sequenc transit nite give oper semant languag state properti comput belief base basic agent stai consist theorem belief base basic agent initi agent system consist consist hold con gurat ha comput ha ha ha ha belief base consist oper semant program languag notion denot observ comput observ languag nal workspac termin comput observ instanc account epistem attitud agent deal comput de nition successfulli termin agent ha han ig futur research framework present paper consid rst step develop theoret methodolog design system develop methodolog distinguish major stage rst suitabl program languag incorpor promin concept system dynam behaviour languag develop mean oper semant oper composit descript descript give rise design facil speci cation veri cation techniqu paper al volum outlin composit veri cation method base tempor logic interest applic framework li analysi comparison concurr aspect deal commun exist languag desir concurr metatem congolog futur applic commun mechan negoti agent conclud short summari futur research direct studi extens framework cover gener inform system constraint system agent system commun translat intend extend framework gener logic translat mechan describ initi framework understand mechan issu incorpor belief belief agent system addit belief environ aspect incorpor aspect inherit subtyp introduct extra level belief addit observ commun belief instanc default issu introduct notion agent ident set reliabl assert judg light time stamp sender ident commun primit framework explicitli commun channel constraint send futur extens incorpor constitut form commun destin channel speci ed advanc mention mentalist attitud assign agent intent commit approach extens cover attitud line acknowledg research partial support esprit work group concurr constraint program applic refer ja jw process algebra synchron commun inform treur formal speci cation case intern confer system page mit brewka prefer extend logic framework default reason intern joint confer arti cial page morgan cohen hj levesqu intent choic commit arti cial fs de jn concurr constraint program intern logic program page vancouv van fs de van der meyer languag modular agent technic report universiteit depart comput van fs de van der meyer construct translat individu vocabulari system intern confer arti cial system applic volum lectur note arti cial page rm van fs de van der meyer system commun agent henri biennial european confer arti cial intellig page john wilei treur composit veri cation multiag system tempor logic intellig agent intern workshop agent languag lectur note arti cial intellig volum fisher survei concurr languag applic intern confer tempor logic volum page fisher repres abstract agent architectur intellig agent intern workshop agent languag lectur note arti cial intellig volum kv fs de van der meyer formal semant abstract agent program languag mp mj fourth intern workshop agent architectur languag volum page car hoar commun sequenti process commun ao mendelzon di erenc updat knowledg base intern confer principl knowledg reason page morgan kaufmann hj rb scherl foundat logic approach agent program intern workshop agent architectur languag volum page van van der meyer believ hear jump topic arti cial intellig volum page plotkin structur approach oper semant technic report comput scienc aarhu anand rao bdi agent speak logic comput languag van der veld jw agent break volum page rao mp georg model ration agent intern confer principl knowledg reason page va concurr constraint program seventeenth acm symposium principl program page schild relationship bdi logic standard logic concurr intellig agent intern workshop agent languag lectur note arti cial intellig volum shoham program arti cial clark content base rout basi commun intellig agent intern workshop agent languag lectur note arti cial intellig volum jd ullman widom system prentic wooldridg jen intellig theori practic knowledg engin
ML/1510 6 brock depart comput scienc genet program definit translat grammar brian ross tech report june brock dept comput scienc st ontario canada genet program definit translat grammar brian ross brock dept comput scienc st canada ext abstract genet program system definit translat grammar logic version attribut grammar support definit semant inform languag easili accomod grammar genet program defin interpret target incorpor syntact semant contraint evolutionari search system improv gp system permit semant aspect languag defin grammar automat analyz grammar rule order determin minim depth termin requir gener random program tree vari shape size applic introduct genet program implement benefit simpl program denot koza denot program tree implement simpl languag nontermin basic grammat definit program structur make program gener reproduct implement effici execut gp system grammat requir express singl singl nontermin argument defin potenti advantag scheme permit rich search space wide syntact varieti tree permiss implementor ensur closur program execut error simpl treatment program structur detriment gp system requir branch program tree special case complic implement adf definit requir special denot adf branch research suggest rigor program tree data type grammar benefici evolut effici reason basic necessarili favour semant program evolut effect critic target languag restrict syntax lisp grammar permit problem domain specif syntact constraint inject evolv program boost evolut effect refin search space system genet program system definit translat grammar logic grammar permit style specif grammar permit multipl semant definit includ definit syntact definit languag unifi semant properti benefici gp system number wai complet comput semant languag defin order defin complet environ separ interpret compil semant rule defin semant properti simplifi target languag grammar syntact constraint aid semant refin constraint conveni depend partial interpret program order determin tree gener reproduct process evolut gp system gener random tree initi popul creation program mutat size tree control random tree ensur tree varieti shape initi popul control tree size gener gener grammar overcom grammar analyz grammar rule characterist rule minim depth gener rule inform requir effect gener program tree desir depth initi popul program mutat section review genet program definit translat grammar system present section applic section compar gp system section section conclud paper discuss background genet program genet program method automat program program evolv genet algorithm gp ga gener initi popul loop current gener maximum gener fit individu consid loop popul size maximum popul size ffl select genet oper select individu base fit perform crossov add offspr popul select individu base fit perform mutat add offspr popul ffl increment gener counter print solut obtain figur genet algorithm figur initi popul random case gp finit number result replenish popul depend fit individu numer score indic individu abil solv problem select program select reproduct proport reproduct crossov mutat select gener offspr gener essenti differ gp ga denot individu popul pure ga genotyp decod phenotyp problem solv gp comput program directli execut interpret program code genotyp gener permit vast number problem solvabl mean gp closest realiz true automat comput program descript problem solv main reproduct oper gp crossov mutat crossov import permit genet combin program code program act mean inherit desir trait evolut crossov select find random crossov point program intern swap crossov point crossov point select result offspr syntact correct koza simpl program structur mean nontermin root select swap nontermin root program mutat commonli perform gp random mutat point found select node replac randomli gener tree mean genet trait introduc popul evolut crossov mutat preserv grammat integr user ensur closur result program execut long closur program deriv gp system execut fit fit deriv definit translat grammar invent mean syntax semant languag unifi fashion syntact possibl multipl semant compon syntact compon definit grammar permit definit languag style syntax logic grammar implement prolog syntact compon permit prolog call semant rule nontermin product semant refer repres inform verifi grammat construct semant viabil gener definit inform fundament formal grammar product form start symbol deriv step repres applic product fl nontermin deriv conveni denot deriv tree root intern node leaf descend node repres applic product nontermin node note nontermin multipl product applic logic program goal nontermin termin refer side product set goal product bodi product includ refer nontermin product option data argument variabl denot place holder data structur element head goal syntact form rule line head defin syntact definit nontermin encod bs goal product refer termin prolog list call prolog refer semant compon case goal brace symbol delimit syntact rule semant definit head semant definit product goal refer semant goal prolog code goal semant specif refer semant goal syntact goal syntact product variabl link semant goal syntact goal goal semant definit refer semant compon tree nontermin syntact definit product semant scheme permit access semant compon typic product natur languag process rule verb phrase syntact defin singl cfg product state verb phrase verb noun phrase interven refer transit prolog verifi verb refer transit rule interpret user evalu true sentenc consid grammat correct semant rule product rule gener agreement class verb base agreement class verb singular plural logic form rule gener logic portion detail call logic form verb noun phrase portion tree system design genet program system implement prolog silicon graphic irix window platform librari author harvei engin convent gp gener tournament local search paramet gp control outlin section remaind section discuss featur grammat logic foundat grammar syntact semant definit grammar initi librari util translat standard prolog argument list token rule grammar permit gener sentenc conform grammar intern tree structur repres tree program nontermin node node leaf node repres nontermin structur repres singl intern node tree call copi head grammar product exact rule identifi id number list node descend node encod product node node includ refer semant goal prolog code goal goal rule interpret parallel interpret tree call parallel interpret goal fail tree tree gener reproduct step fail main gp engin evolutionari action undertaken grammar preprocessor gener random select rule deriv gener random program shape size semant goal prolog goal rule bodi repeat rule process progress ffl examin rule rs bodi made termin min rule nontermin rs bodi minima min rule maximum minima nontermin label min found time step min min depth nontermin rule bodi test step succe put back iter figur minim depth algorithm execut random act addit verif tree construct tree gener initi popul mutat step evolut gp run commenc gener initi popul random program convent wisdom evolut effect initi popul program varieti shape size popular mean deriv popul koza ramp gener strategi half program gener tree gener rang maxim branch tree maxim depth half popul rang tree depth tree branch greater maxim depth gener tree desir depth easi koza grammar grammar specifi express nontermin express argument deriv termin termin nontermin deriv tree desir depth trivial grammar tree nontermin node expand product nontermin difficult ensur tree desir depth directli determin applic product result branch requir depth product termin immedi bodi consist termin product infinit problem gener grammar number investig problem solut share characterist simpl algorithm yield accept albeit complex approach gener ramp popul analysi grammar order determin characterist minim depth tree gener rule gener termin arbitrarili deep tree characterist rule select prudent characterist identifi rule termin branch characterist identifi rule result tree fuller branch analysi determin minim depth gener grammar rule multipl rule applic rule gener vari minim tree depth gener tree select rule assur gener tree depth limit algorithm comput minim rule depth figur iter algorithm process grammar rule set fashion time minim depth determin minim depth nontermin refer rule base case rule leaf minim depth iter case rule nontermin minim minim depth rule level deeper maximum minim depth process continu rule minimum depth comput rule undetermin minim depth discov rule mean fix user analysi determin termin characterist rule rule descend result nontermin deriv finit tree rule knowledg properti rule gener full requir branch deep order gener full random select rule enabl deepest branch select rule gener finit depth tree forc termin shallow depth desir rule descend rule gener tree requir maxim depth algorithm determin termin properti rule figur algorithm case attempt label rule label continu label rest unlabel label user overrid termin design gener deep program structur languag construct gener deep pascal set structur gener set includ member space method determin minim rule depth rule base sole nontermin label analysi product algorithm give repeat rule process progress ffl examin rule bodi made termin nontermin bodi label termin label termin nontermin label nontermin label nontermin nontermin rule label nontermin test step succe put back iter ffl label remain unlabel rule nontermin figur rule termin algorithm approxim minim size tree deriv natur product actual minim depth product product nontermin applic due exist argument semant prolog goal rule featur ignor sake effici practic design support fact argument valu depend time data popul gener main goal tree gener desir shape reproduct oper major crossov mutat oper offspr grammat correct respect origin suggest maintain grammat integr crossov ensur crossov select result grammat correct offspr select parent root nontermin type termin select unlabel easili identifi correct user select termin inform nontermin rule defin nontermin root select mutat tree nontermin type select replac select product semant goal prolog interpret crossov mutat order verifi correct tree consid verif step perform offspr applic syntact semant rule prolog semant verif unnecessari omit crossov mutat fail number wai nontermin type select parent exist parent offspr exce maximum depth bound semant verif fail situat reproduct step retri parent number time reproduct oper fail select evolut continu select parent reproduct experi section present applic evolut probabilist pattern match languag experi spirit work consult detail overview problem mean probabilist languag implement discuss illustr main benefit paramet evolut strategi result experi assum reader background formal languag probabilist pattern match grammat infer classic problem machin learn ga gp successfulli appli infer formal languag ga gp stochast languag infer investig stochast languag formal languag probabl distribut set member point addit burden infer languag membership probabl distribut member ascertain probabl distribut advantag infer algorithm number reason probabl preclud neg probabl posit member automat account neg membership probabl distribut lend addit freedom lend natur mean statist accuraci accept solut probabilist languag infer natur suit gp effect problem requir accur good correct latitud error target languag probabilist regular call stochast regular express similar stochast regular languag convent regular express regular oper numer field indic probabl produc result languag number notat express stochast regular stochast finit automata call hidden markov stochast regular grammar notat theoret convert stochast regular natur express notat simpl express describ complex stochast regular vice versa linguist express denot impact effect infer complex solut natur requir effort infer algorithm syntax ff rang alphabet rang rang posit integ rang decim valu decim place syntax defin ff loss empti string ffl includ alphabet languag express mean oper atom action action ff gener probabl guard choic ff ff ff term choic express prefix uniqu atom action found express make guard choic contribut smaller express gp process compar nondeterminist choic term probabl express term probabl probabl probabl entir express product probabl chosen term probabl express encapsul concaten term probabl product probabl express kleen closur term repeatedli execut time iter occur probabl multipli probabl probabl iter express denot set string belong probabl distribut languag interpret probabl field inform explain oper descript express string member probabl term chosen probabl term iter probabl final iter termin probabl string member probabl string ba member probabl definit syntax expr expr expr expr expr iter choic choic choic expr figur syntact definit figur encod grammar elucid simplifi remov semant rule rule variabl semant rule rule function rule expr rule defin guard express order includ kleen closur rule refer semant goal construct nontermin choic construct list prefix term choic express call prolog goal uniqu guard succe prefix uniqu tree fail due instanc duplic prefix rule encod addit syntact constraint directli nest iter permit prior experi found nest iter commonli construct gp unfortun effect dramat slow interpret time gener minut probabl due compound applic iter probabl disallow significantli speed neg effect evolut rule simpl check semant express express rule fail rule defin defin guard express term notat succe rule termin member alphabet rule defin integ float point choic probabl iter abil grammat constraint permit implement worth examin contribut semant rule detail rule semant check nest iter inform express nest rule iter determin tree semant complex grammar requir expr expr iter expr iter involv simpl check rule altern unwieldi separ set rule requir order captur action process guard express attribut grammar process guard choic figur choic choic choic choic choic choic strategi grammar small alphabet definit oper semant choic figur oper semant choic oper section evid fairli oper semant oper oper oper semant conveni encod semant field fit gp test express recogn string target languag oper semant encod express interpret attempt recogn membership produc probabl recogn string actual implement find probabl largest prefix recogn express complet account implement oper semant scope paper give flavour figur semant rule figur rule pertin choic occur end tree choic choic rule string start process choic string process equal suffix sum probabl valu term choic list denomin probabl comput process current string express compon read earlier prefix final comput probabl pr process complet rule rule process term pair choic express call construct retriev actual integ probabl field term probabl term multipli probabl intermedi probabl pass recognit semant express choic term rule invok multipl wai string recogn express oper semant exhaust rule string complet altern deriv express probabl obtain differ deriv path collect yield probabl string greatest prefix case experi detail tabl paramet paramet target languag termin root expr fit function modifi random test set gener type initi popul size run popul size uniqu popul member maximum gener probabl crossov probabl mutat probabl intern crossov probabl termin mutat probabl numer mutat numer mutat rang max reproduct attempt initi popul shape ramp depth initi max depth offspr tournament select tournament replac test set size approx max test string size probabl limit task evolv express correspond languag target fit strategi test express recogn random test set string gener target descript test set randomli gener entri result test set list string valu frequenc test set string interpret encod membership probabl comput modifi formula fit evalu jt jt frequenc test set jt maximum prefix recogn term string complet recogn formula prefix recogn proport size prefix recogn normal formula prefix score credit express recogn portion drive evolut express recogn complet exampl gp paramet list figur gp literatur mutat special mutat numer termin found express probabl numer mutat state time numer field select mutat rang specifi numer randomli perturb fail reproduct oper nontermin match select parent probabl limit specifi lower cutoff probabl recognit probabl lower recognit current express deriv path deriv attempt boost effici deriv result tabl summar experi result valu tabl comput run fix test set note variat fit individu test randomli gener test set vari gener run averag test set indic test set vari averag solut obtain set run solut good figur show averag perform run tabl summari total run uniqu exampl avg test set fit min max avg fit translat readabl probabl choic directli simplifi remov term statist essenti target languag express note remov express term materi genet inform ill effect fit size poor solut fit transform manner term accur process prefix target languag partial termin occur correctli probabl work inspir system implement logic program logic grammar paradigm crossov procedur blindli select node potenti gener fit averag figur fit curv succe determin offspr grammat correct crossov proport crossov oper fail overcom select similarli label node type crossov detail system program logic grammar argument structur maintain crossov reproduct oper simplifi tree structur denot essenc grammar tree semant compon requir verif crossov grammar interpret grammar encod program permit semant execut circumv requir major advantag addit semant express inher motiv place encod substanti semant inform grammar overli complex unwieldi overcom weak encod semant separ ty rule pertain argument notat permit semant inform goal syntact rule extract requir net result complex includ entir languag encod semant definit practic incorpor syntact constraint grammar target languag syntact constraint defin syntact semant greatli simplifi paper gruau cfg enforc syntact properti genet program user syntact constraint solut encod properti grammar target languag search space semant search space constrain user semant constraint effect control syntact constraint gener mean control search logic grammar gener constraint gruau system call count ensur program tree exce depth limit ensur rule select program gener result unduli small identifi termin properti rule rule gener program initi popul tend shallow lack control gener program size crossov system select nontermin grammat correct gruau transform grammar normal permiss crossov possibl product gruau binari encod grammat resourc argu encod hinder execut speed cheap memori cfg gp gruau system node nontermin identifi select crossov exchang control size gener tree requir user manual encod product number indic minim tree depth rule automat determin inform analyz termin characterist initi popul favour smaller tree research suggest linear gene number map grammar rule gene map perform legal grammat tree index map erron grammat structur translat denot arguabl akin ga chromosom convent gp translat step basic genotyp phenotyp undertaken grammat correct preserv erron chromosom map circumv gene translat grammar rule tree gener list depth tree termin characterist grammar rule consid implement ga gp system grammar formal grammat gp jacob grammat gp encod grammar natur graphic model natur phenomena plant structur attribut grammar gp evolv neural network work relat grammat gp data type gener grammat data type constrain solut respect rang argument valu pass program construct motiv principl pure grammat constraint problem gener random tree size shape constraint investig number algorithm algorithm basi work linear algorithm gener random grow tree gp show basic grow tree gener algorithm produc uniform distribut tree rang depth tree gener algorithm gener tree uniform distribut shown posit influenc evolut algorithm design koza basic cfg directli applic complex cfg bohm address random tree gener grammat gp exact shape depth metric tree size number deriv step requir grammar deriv tree combinatori view languag tree gener set number deriv step belong partit languag search space algorithm knowledg word partit randomli deriv tree partit deriv tree varieti tree randomli gener admit implement algorithm partit space depth breadth characterist tree algorithm paper simpl result accept variabl random tree shape paper discuss implement gp system encod syntax semant target languag build earlier extend system borrow idea maintain grammar correct reproduct system analyz user grammar inform termin characterist requir effect random tree gener illustr practic semant simplifi grammat definit encod oper semant target languag languag composit oper defin interpret procedur forward syntact problem constraint defin grammat definit unwieldi result tree program syntact properti grammar semant substanti simplifi grammar semant encod complex semant properti interpret partial program order determin accept benefit prune search space manner outweigh result overhead perform reproduct search space evolut success investig semant constraint gp number enhanc gruau normal form product worth normal form transform ensur termin nontermin ancestor transform perform robust opportun node select direct crossov experi evolv product evolut suggest grammar evolv order discov instanc work attent direct substanti bodi work grammar prolog lisp ai symbol paradigm make ideal genet program implement slow compar gp system program compil languag interest interfac gp system implement faster languag work support nserc oper grant refer dahl logic grammar alonso random gener tree kluwer academ angluin comput learn survei select bibliographi annual acm symposium theori page acm fd genet introduct morgan bohm exact uniform initi genet program rk belew foundat genet algorithm morgan brave evolv determinist finit automata cellular encod john koza proc genet program page stanford morgan kaufmann charniak statist languag learn mit wf cs mellish program prolog regular grammat infer posit neg sampl genet method intl coll grammat infer page jj freeman linear gp context free grammar jr koza proc genet program page morgan ks fu tl booth grammat introduct survei part ieee transact januari vk si marcu probabilist languag framework stochast discret event system technic report institut system april fuzzi expert system genet machin learn studi fuzzi soft edit program languag genet program john koza proc genet program page stanford morgan kaufmann gruau syntact contraint genet program pj angelin ke advanc genet program page mit td da rl type inherit strongli type genet program pj angelin ke advanc genet program page mit jh holland adapt natur artifici system mit je hopcroft jd ullman introduct automata comput addison ts ra attribut grammar genet neural network syntact constraint genet program workshop evolutionari iba random tree gener genet program parallel problem solv natur proc intern confer evolutionari page jacob evolv evolut genet program jr koza proc genet program page mit te rk belew stochast grammar induct genet algorithm local search rk belew foundat genet algorithm iv jr koza genet program mit jr koza genet program ii mit mm grammat infer genet algorithm confer massiv parallel process applic page evolutionari learn larg grammar jr koza proc genet program page stanford morgan kaufmann luca structur chromosom grammar evolut intern confer evolutionari page ieee dj montana strongli type genet program evolutionari pereira warren definit grammar languag analysi survei formal comparison augment transit network artifici lr rabin tutori hidden markov model select applic speech recognit februari bj ross probabilist pattern match evolut stochast regular express technic report brock dept comput june jj oneil grammat evolv program arbitrari languag banzhaf proc european workshop genet program page sakakibara recent advanc grammat infer theoret comput infer stochast regular grammar massiv parallel genet algorithm proc intl conf genet algorithm sic sicstu prolog user june learn regular languag genet program jr koza proc genet program page morgan pa genet program jp workshop genet theori page pa induct bia genet program intern confer genet algorithm engin innov applic page ml wong ks leung evolutionari program induct direct logic grammar evolutionari zhou jj grefenstett induct finit automata genet algorithm proc ieee intl confer page ieee press
IR/1511 5 intellig architectur inform retriev internet martin muller institut semant inform process germani abstract world wide web offer number document deal inform list topic question find inform turn question find relev inform search engin crawler base index vari recal offer bad meta search engin overcom lack base monolith architectur inform inform filter integr heterogen inform resourc search engin emploi intellig techniqu order user model techniqu popular person agent base system web develop straightforward idea incorpor idea user model machin learn method web search servic abstract prototyp develop incorpor method machin learn base user model intellig environ order tackl problem find user relev inform filter inform introduct articl develop abstract prototyp intellig inform retriev internet restrict scientif part www main focu li user model base price higher grow time search process carri onlin present system notifi user search client check complet price motiv describ current state art search engin meta search engin collect number idea lead intellig search mechan explain section section put idea section work architectur system final give discuss prospect approach inform retriev world wide web seek inform www hard search find page classifi relat interest www find match interest search engin search engin oper huge carri kei word search recal cover entir www offer pile page refer major expect intellig answer search low web robot call crawler search engin scan www document request store local page index search page keyword simpli word phrase occur respect kei word lexicon search servic base manual index search engin differ crawler crawler search engin cover part web differ extent extens crawler scope gener correspond inform retriev term recal crawler enter crawler scan site depth restrict crawler order search index recompil web delet index manual characterist page analyz delet server statist analysi full document gain significantli result analyz search servic restrict partial document analysi www bot search interfac web db search index db client http queri cgi index figur gener search engin index sophist index strategi improv document index frequent word phrase stop keyword detail document analysi index process index time consum altavista averag week url found crawler list index search queri topic concern queri languag languag vari simpl logic base express quasi natur languag figur present gener search engin crawler data web index store access cgi script detail analysi reveal search servic result significantli differ perform due intern user altavista cover web page index entri refresh rate report index latenc report week local refresh rate excit cover page smaller index method appli big search engin report quick test local domain reveal latenc infoseek date week crawler perform exhaust search breadth depth data crawler test domain obtain meta search engin lack simpl search engin tackl meta search engin meta search engin metacrawl forward search request search engin integr search result result list collect search result search engin integr multipl rank deliv util search engin interest page irrelev figur face page record metacrawl result queri intend request note machin altavista deliv figur page url hit sober metacrawl deliv list refer regard hit link page perform depend util search queri wrap integr method score page comput normal sum rank page deliv search engin measur easili modifi account weigh number time deliv appli measur meta search engin deal score relat deliv util search servic order meta search prototyp account number domain deliv page domain extract servic result page rank domain integr result order simpl method gain boost sampl result page deliv prototyp shown figur challeng task meta search engin design extract url search engin task implement wrapper search engin constantli chang html layout rise develop automat wrapper induct special domain meta search engin built depict figur architectur monolith core compon strict task sequenc base head url hit artifici intellig public page machin learn vol machin learn vol paul public game program page machin learn paul public kb research project figur search result note machin metacrawl cgi script trigger result list client http connect open immedi server script call bad connect server search engin tempor high cpu load server due request simultan result integr process result connect timeout reason straightforward architectur time critic result present quickli time lost http interact sake quasi lower meta search overcom problem stand search trivial build refresh frequenc crawler width depth figur meta search result deliv intellig search engin intellig search engin evolv descend simpl meta search motiv machin learn base user model kei boost semant mean boost meta search process short list ffl syntact measur http html intern document descript word weight base html tag meta inform document type infer url detail document analysi explicit label user feedback ffl semant measur user model base user feedback user histori user search engin search engin search engin www search interfac client http queri cgi wrapper integr search servic http figur gener meta search engin collabor user model user group content base document descript exist automat gener abstract descript respect ontolog librari user search morpholog seek mathematician approach demonstr system meta search cluster document cluster algorithm seek cluster repres phrase assign search result cluster cluster repres statist deriv valid lexicon user implicit queri refin queri simpli forward search request desir search engin track user histori organ www correspond hierarch content base subnet follow similar design structur descript user seek negoti cluster descript cluster content base cluster approach annot semant descript project natur languag interfac heterogen develop intellig meta search intellig meta search sophist featur order user specif intellig search engin specif inform filter process respect user interest lead user model base overview recent research consult order mean describ document user model determin link match user interest profil meta search engin queri search machin indic queri refin user model formul search engin queri interfac wrap incorpor search engin specif rank ordin wrapper plan option add easili chang restrict enhanc achiev tent url guess base queri relat document categori specif ml cf filter carri set complet document deliv meta search statist filter incorpor weigh word occur inform extract includ quick document type guess url deep analysi document type method autom abstract content base classif method reli user model initi gener bookmark analysi textual descript user interest explicit feedback manual refin search obtain label sampl user interest respect ontolog induc learn user prototyp individu user model user model chang process independ meta search servic run offlin data gather search procedur refer hierarch index systemat librari classifi public disciplin public data ecml confer signatur librari user deduc locat scienc kei class artifici autom theorem learn system expert prefix subclass comput scienc literatur approach decim classif manual classifi document respect content system explicitli toler sever search carri part www search carri fly multi agent strategi enter process long expect user wait onlin result search perform offlin architectur return result end user defin period multi agent system intellig search blackboard server maintain agent commun channel socket function divid highli cooper concurr fulfil task note blackboard special agent carri optim procedur incom request interfac agent expand grammar goal request board expand higher level plan carri underli basic plan blackboard result process interpret search node state blackboard goal node empti board node evalu estim work incorpor estim net congest confid agent solv task qualiti time import determin boundari respect current system state time complex plan guid heurist decid altern describ class involv agent interfac agent search inform www carri www www inform resourc import inform deliveri servic mention ffl inform servic travel sale agenc queri web kind special user highli specif user model short html gerhard project autom classif project nl interfac librari retriev system system nl gener base modifi algorithm plan optim tabl verbal paramet describ text sentenc prefer style actual tabl larg abstract gener base templat templat choic guid search routin heurist comput ffl librari deliv refer book partner librari inform user internet public queri search submit gener task deriv plan await special written blackboard arg uid timestamp mode type top level agent request notif task enter mode wait agent task mark complet assign flag successfulli process mark treat assign special flag underli process kill rewritten blackboard time retri prefix initi mode user id uid identifi user model suppli client request case http cooki explain featur plan syntax exampl request meta search search string respect user model timeout ad cgi script www interfac mail interfac agent retriev system librari search agent request simpl meta search figur plan search excit yahoo job mark process potenti timestamp process kill blackboard master plan ad trigger filter integr process result execut agent encount comparison precondit annot mode special wrapper agent request result search servic intellig meta search user model depend queri refin initi request model user section user model agent explan queri set meta search queri clear wrap command lead situat part initi request process timeout occur deliv result subgoal wrapper pass id top level wrapper write result temporari tabl link temporari inform deliv search domain snippet score search servic url uniqu tabl score integr knowledg search order updat system intern url agent url updat plan parent id lead indic daemon agent point attent task function explain section daemon agent result store temporari join inform url join complet respect number deliv url url unknown progress annot section daemon process url point result result process snippet part byte sentenc displai result search engin call tackl integr agent account user model order sort result search start html document gener request client interfac agent receiv result request dump inform retriev system url result page www base search engin user model agent user model core technolog user specif search queri search term expand search request user profil linguist meta search request written keyword store user model search result broad special keyword multipl occur url priori heavili weigh user model initi contin refin ffl user homepag bookmark process url updat daemon plan deriv user specif kei word list document categori interest ffl result deliv search engin search request model updat url document categori form ml techniqu learn specif gener complex categori descript document type agent implement perform user model induct sort domain ffl url explicit rate user posit neg exampl user interest refin model techniqu ffl explicit label support user submit url posit neg label url meta search user opportun transform result list topic specif bookmark file explicit label hidden sort routin search engin gener user fold sort ilp problem hard receiv explicit user feedback explicit label option neg exampl collect hard receiv internet domain long time spent url http transmiss abort mean reliabl fact lead posit neg unfold node result page gener bookmark file action interpret posit neg feedback url ffl gener individu user make collabor user good bad exampl similar user profil mutual exchang order refin user model document categori descript daemon agent daemon agent class agent run independ current search request task intern www date inform suppli ordinari search servic inform higher web search daemon updat intern url salienc task express term timestamp wrapper agent check blackboard entri temporari add addit sign daemon simpli write result updat daemon process wrap request mark complet process delai manipul timestamp work delai long wrap plan declar long wrap plan successfulli url temporari check suppli inform equal url inform url url check process mark finish url titl snippet updat suppli inform newer inform temporari tabl copi inform document document categori oper document request daemon activ oper carri ffl document document type determin pretti quickli simpli url case rise url case uncertain candid hit newer servic deliv hit servic report consequ rank pretti safe rough suffic prototyp current simpl meta search prototyp figur path check regular express develop make recurr neural network tree base string descript languag incorpor system detail document analysi deliv document type descript base text structur ffl simpl agent determin keyword simpl statist analysi agent enhanc lexicon method deliv keyword autom abstract system ffl document document categori compar signatur book librari content base formal descript document perform document classif keyword deriv descript map librari index footnot clear agent deliv data confid full entri url ffl document person ffl keyword martin machin learn intellig inform artifici intellig cognit scienc ffl document categori compar path tree cluster document respect ontolog annot probabl correspond similar conceptu cluster summari intern url document type document content descript enabl specif filter meta search result expect significantli web search scientif subdomain www deliv sketch base intellig meta search engin depict figur keyword occur document meta keyword declar html header document search servic www client client mail master agent planner www client librari url wrapper agent user model temp url db http http blackboard http mail user model agent url updat agent figur architectur intellig web search prospect abstract architectur system intellig search www approach domain ffl highli open architectur easili expand agent mainten ffl robust framework lock unavail function partial behav ffl function ffl highli transpar system state analysi daemon passiv observ agent commun ffl easi integr user interact depend independ ffl framework highli distribut system maximum flexibl machin agent run oper system program languag defin protocol languag agent commun effici incorpor compon simpl interfac repetit cgi interfac prototyp develop project institut semant inform work prototyp project earli fall involv ma phd project url abstract document type wrap user model induct refer balabanov collabor commun acm dieter michael rudi make www banff knowledg acquisit workshop case studi tabl advanc ai tour guid world wide ijcai august anthoni cecil carlo tasso user sixth intern kushmerick wrapper induct inform ijcai learn document categori descript extract semant proc workshop data engin induct wrapper induct inform phd paul maglio rob build model agent support web jameson al pp ein der resolut auf extens resolut horn zum lernen der morik der universitat fachbereich august pp www report pp intellig inform retriev submit public georg zur text einer und von master institut semant inform georg ein und ansatz zur text im medium von und hypertext engin pp qualit bei der informatik informatik und shake dynam refer case studi homepag proc int www pp
HCI/1512 4 interact storytel space children allison jaim lisa jack joe hammer alex kruskal thoma plaisant lauren rebecca wagner jim hendler interact institut advanc comput studi colleg md usa abstract limit access costli complic author technolog reason children rare enjoi experi author interact stori typic kind children restrict stori stori author begun develop storytel experi children storytel children author physic storytel experi share children paper describ design design process current technolog implement keyword augment educ participatori cooper inquiri introduct child sit stori doll famili child sit dinner tabl mom stori read school dai child run catch friend imagin fly airplan place septemb storytel power tool creativ tool junior member design ag year hcil technic report centr user orient design royal institut technolog sweden storytel critic part world theme park toi comput offer storytel opportun support develop social cognit skill commerci softwar comput game flexibl author tool todai wide rang interact depend children listen interact stori softwar experi offer creativ learn lack import element physic environ critic part earli cognit develop negoti physic world longer restrict children desktop plastic box import familiar object stuf anim block minim number research past decad combin power comput familiar world group found led year professor papert group research explor concret wai children intuit understand physic world combin program languag logo mechan lego programm brick recent work commerci popular robot invent system research concentr robot stuf anim enabl children listen stori research initi includ mit media sage pet commerci product commonplac barnei tiger comput augment object import step power technolog physic limit imagin children stori toi enabl children stori part pursu research interact storytel space children physic interact space long rich histori establish scienc technolog museum san children explor complex concept physic interact experi todai hundr kind museum world children explor histori restor centuri armi famili experi elli york children interact inform reactiv voic plai role artist manipul physic object addit theme park displai sophist physic interact space pioneer compet recent year compani warner flag research pursu activ area physic interact space gener develop adult common find research area children user environ room found environ offer activ learn social opportun learn coloc motiv experi drawback environ limit access design present space gener found school museum public costli prop rang typic complic technolog program author easili modifi technolog difficulti children stori stori particip research develop set address complex issu begun focu develop consist storytel offer easili access physic storytel experi children emphasi support children author particip found storytel environ type result children gener choic experi children read write environ support children storytel start experi paper describ design current technolog implement built maryland enter island place dr stori enter small box wear inhabit star notic bright green star lucki find plai figur room prop machin machin walk mysteri cardboard middl room react blink light notic work star sad hear person mr island special machin star spotlight cardboard machin tunnel flash light sound crawl star plai fair origin star told mr machin remov star crawl star disappear crawl cardboard machin add remov star machin time hear cash regist notic project mr make lose pai trip star machin monei star machin anymor left star left star find plai decid friend part built maryland summer design built design adult children year cardboard overhead creat interact version dr stori learn flexibl author tool design section discuss design process design challeng design challeng team area natur technolog design difficult design comput screen singl object sketch paper complet captur notion found brainstorm kind understand user time space critic common combin scenario lot sticki note challeng design partnership children discuss chosen includ children year design partner work school week summer reward opportun work team storytel project storytel robot zoom softwar environ difficult project date primarili due abstract natur technolog design team particip child experi develop environ found children team adult answer direct adult team felt knew children build design desktop challeng team team process challeng section follow discuss team design method adapt support develop children design partner children contribut wai design technolog children past half year develop technolog children children design team consist elementari school children adult comput robot adapt chang design process support children full design team partner call process develop design philosophi includ team member matter ag experi skill uniqu import children adult found start rule school ultim goal design process team member build idea children adult casual work environ cloth support idea includ sit wear jean design team member reward adult paid children yearli gift child labor law unit state complex time patienc build effect design team found month team children adult effect support chang set brainstorm reflect team section descript area present set expect found expect lead coher design commun team opportun frustrat team member care set team expect start start design session children adult design team simpl meant origin replenish energi young children graduat student time critic part design methodolog session start minut adult children inform discuss mind dai discuss homework dai share embarrass situat encount found team spend time adult children peopl live lab partner eager share brainstorm idea commun literatur discuss type inform social theori suggest develop work relationship social contact inform typic talk work dai find agreement design team member goal activ accomplish make adjust focu base team member input brainstorm written great deal brainstorm process children realiz unpublish import found idea difficult origin idea adult children ultim goal team person build idea obviou peopl work goal lost typic design team adult brainstorm develop initi idea adult bounc idea child form gener discuss elabor idea feedback includ idea moment start design process techniqu prototyp participatori design sticki note white board give design partner voic brainstorm process techniqu lead idea team quickli chang brainstorm method work research carefulli follow session similar curriculum plan kind research flexibl method commun critic suppli design materi freeli access sticki lego adult children upset design methodolog found children learn goal dai method goal fine specif brainstorm techniqu develop concept interact section team reflect found team design children easi lose track idea data gener team due quick chang brainstorm process dai due young inabl rememb left team note due adult forget hit button video child team member interrupt middl thought combin journal video camera team adult debrief wai captur lose figur journal term journal children adult includ found import make list thing project journal track project examin design addit design session video record activ children team video camera young team member feel camera peer adult team feel uncomfort tape child videotap thing room team reflect occur great deal discuss time split smaller group accomplish seri task dai end dai full team discuss thought found design time adult team reflect design process wai children understand difficult time adult stand back big pictur difficult children present reflect process critic captur design effort futur reflect team set expect chang team brainstorm practic design process section focu appli methodolog design began research develop share concept attempt build environ final began develop author method tool defin began work decid adult team start notion collect sensor actuat peopl interact interact convei stori concept children team began understand start research figur augment phone seri walk dock team member emul comput program color paper stori start narrat part particip continu choic object line ran particip chose augment tag sensor continu depend chosen object team began entir room interact stori child team bit scenario walk perform parent friend turn knew decid time local research scienc technolog museum baltimor jump rent van drove port discoveri explor children solv crime explor mysteri dai back lab wrote sticki thing thing child sum frequent discuss broken thing thing danger slip ag august team line ag august team found storytel aspect room physic implement appeal contextu inquiri share understand prototyp team step build prototyp dislik previou experi split smaller group adult children work aspect problem hardwar team sensor actuat softwar team attempt design softwar author tool stori group work write stori room arrang find miss stori content work abstract adult children hardwar group figur hardwar group studi sensor figur design sketch room figur softwar group work difficult time imagin sensor actuat stori stori group develop imposs complex stori understood stori group step back team found simpl stori stori vote dr won thing start shape quickli stori group develop adapt stori interact room drew event happen room hardwar group built prop stage prop made cardboard decor children augment prop comput electr connect prop macintosh comput control room interact video projector playback voic displai graphic room addit softwar group develop softwar includ code creat graphic voic stori graphic voic record part origin stori schedul demonstr member parent friend demonstr found aspect good interact storytel miss prototyp design room implicit knowledg particip miss connect element critic understand stori particip expect time experi particip find interact possibl observ children team built environ greatli enjoi interact time reflect experi sticki note build stori nice easier build stori prop creat gave chanc build room quickli figur children build prop materi familiar prop temporari built prop fine thought act build room fun particip stori kid experi set goal research team includ build author tool children creat provid tool make augment physic object develop softwar architectur easili integr augment object author tool brainstorm author method fall began focu storytel experi process technolog stori understood adapt exist uncertain stori scratch explor began stori verbal brainstorm experi work tradit collabor storytel methodolog pass plate began time magic time person team receiv plate add stori stori coher reflect realiz storytel symbol ultim easi stori pass plate collabor storytel experi critic prop magic plate thread stori prop stop make stori build coher share stori magic plate split group develop gener idea specif approach continu brainstorm compet group children adult found team competit group easi spur continu excit research competit stori particip storytel builder figur role plai design process propel team member refin idea thing struggl team move builder team member time stori make ag septemb team adept stori stori stori outer stori anim develop accid dai sit tabl stori began throw magic plate plate prop start kei figur magic plate idea card cup start connect prop stori left leav left septemb stori start experi discuss prop prompt stori discoveri prop lead stori prop produc prop produc stori order prop produc prop inspir stori began realiz built possibl prop peopl sticki note team member wrote prop idea sticki share team pick idea pile stori develop prop chang sticki note written word card pictur written idea call realiz kit build prop world made children make eventu settl storytel routin begin brainstorm stori idea card stage design process transform team storytel builder accomplish transform team member step make base stori told idea card talk sound comput build talk project imag room aspect robot part stori child team member explain work big idea project door wall thought thing main charact stori fun ag octob thoma began make progress understand understood start kit understood prompt children make stori prop prop aliv sensor area defin author softwar defin magic team member grasp idea author wai author stori team member idea comic strip stori visual idea shortli fact visual program languag languag construct build kind interact object particip support event happen room spatial tempor featur defin visual program chose develop team stori visual wai divid team task draw stori format evalu idea decid combin idea comic strip main arrow note connect comic strip reflect design realiz design step mirror role understood began particip explor move storytel phase design excel imagin stori told final move builder energi develop technolog pass design phase role told answer spent time build tool creat brainstorm process quickli luxuri research enjoi explor technolog vision build consist softwar hardwar concept comput critic year author environ part system support user idea peopl start stori compar program languag packag lego construct lego kit work child design observ younger children plai idea team member specif surround object stori easili materi build consist wide spectrum materi wireless enabl electron materi plastic cup build belief room children school home develop build prop stori materi object find surround augment prop technolog essenti work wireless sensor actuat power comput develop stori program prop develop fact build robot part spread room user interfac issu complet lower level problem commun robot easier compact artifact final product compar robot kit children lego complex develop technolog type overwhelm children possibl larg number augment object wire connect object small task lightweight technolog commun wireless medium challeng address main challeng work design visual program tool prototyp run lab refin work softwar easi inher suitabl develop stori room softwar system provid support augment object room challeng develop underli softwar architectur support kind event happen event consist spatial tempor inform spatial process event concept lack previou attent lego program robot locat space easi interact stori locat object room develop idea stori theme wai encourag children develop idea card print imag object word describ object system store inform idea card author stori softwar children gener idea card printer stori stori theme simpl adventur instruct make base hardwar sensor heat light wireless radio transceiv actuat older friend put form comput augment physic object room comput child make talk stuf anim touch wireless modul build prop materi found home creat select attach idea card kind object build handheld comput relat prop idea card point system awar prop type activ perform system stuf anim capabl plai back touch children inform softwar connect element stori children toi futur toi augment comput commun devic children incorpor favorit toi particip stori friend share stori freedom realiz world hope focu futur enhanc enabl user share particip stori occur separ room softwar child author base prop made chang add prop author stori accomplish seri comic strip frame comic strip show prop room current locat frame comic strip happen stori object light turn comic strip figur strip stori transit make light turn room comic frame transit comic frame statu sensor comic strip transit typic open frame touch sensor particip frame show touch sensor activ frame show activ stori talk prop start talk particip close prop begin frame repres prop talk transit frame show particip close prop system decid frame activ base posit particip prop frame measur close particip frame activ special clock object enabl user activ frame base passag time hint stori user close prop minut ad clock object frame hint frame user time requir time frame clock minut frame clock navig softwar part stori support develop maryland support complex user encapsul part stori zoom encapsul underli detail zoom interfac set control prop navig prop user simpli zoom interfac select frame zoom prop user chang statu activ challeng futur import area improv continu refin technolog user experi great deal understand support children author environ addit tool children environ impact environ learn question hope answer futur empir studi area intend focu design process intend continu effort refin understand cooper inquiri design process children research project continu rethink ultim build futur acknowledg work fund gener support european school environ teach excel institut advanc comput studi colleagu interact lab continu inspir support numer wai refer interact stori environ virtual surviv interview american indian poet arizona press tucson cooper develop technolog children acm role children design technolog submit acm transact comput interact children technolog design partner druin design children technolog morgan san francisco hendler plaisant kruskal olsen wagner design person electron teller acm physic approach comput interfac companion chi april acm stori random essai american literatur mexico albuquerqu child berg contact theori review evalu theoret empir literatur intern journal group bolt larg dream real product hendler robot technolog learn morgan san francisco press evolut construct kit magic machin hendler robot technolog learn morgan san francisco press speak nativ writer write arizona tucson scienc museum environ learn physic interfac talk learn media barnei chi angel ca april acm soft toi comput build person storytel environ extend abstract march acm thought languag mit cambridg
IR/1513 5 machin learn issu filippo srinivasan iowa iowa ia abstract topic driven crawler increasingli address scalabl limit search distribut crawl process client comput context crawler guid navig link goal effici locat highli relev target page develop framework fairli evalu topic driven crawl algorithm number perform metric framework emploi evalu algorithm proven highli competit literatur previou research focu tradeoff explor exploit cue adapt crawler machin learn techniqu guid search find perform achiev combin explor exploit introduc evolutionari crawler equal perform crawler analyz comput complex crawler discuss perform complex scale resourc evolutionari crawler achiev high effici scalabl distribut work concurr result ratio introduct search web difficult task lot machin learn work appli part rank index page estim relev respect user queri crucial task heavili influenc perceiv effect search engin user top make achiev rank algorithm paramount import earli search engin rank page princip base lexic similar queri kei strategi weight algorithm repres web page queri vector close space correl semant relev recent structur hypertext link recogn power sourc evid web semant machin learn techniqu emploi link linkag estim relev link analysi pagerank algorithm successfulli emploi googl search engin machin learn techniqu extract mean link topolog base identifi hub author page eigenvalu analysi approach pure method found effect case link analysi combin lexic research address half problem matter sophist rank algorithm result good page index search engin page retriev index bring aspect web crawl web search page index visibl web estim size billion page write offer challeng inform retriev problem estim doubl billion page largest search report fact coverag web search engin improv past year hardwar bandwidth resourc search engin growth web retriev challeng compound fact web page chang frequent cho daili crawl page period found dai web chang found rate chang vari domain dai domain versu month gov domain extent chang valiant attempt search engin index expect subspac index continu grow solut offer search capac answer queri user recogn limit develop topic driven crawler algorithm receiv attent recent year topic driven crawler respond inform express topic queri interest profil individu user time onlin commun share interest search engin topic driven crawler support decentr crawl scalabl approach addit benefit crawler driven rich context user interpret page select link visit start earli breadth depth crawler defin begin research varieti algorithm shark search aggress variant de fish search crawler reli heavili link base criteria diligenti backlink base context graph estim likelihood page lead relev sourc page relev exploit lexic conceptu knowledg chakrabarti al hierarch topic classifi select link crawl contextu knowledg topic includ receiv relev feedback aggarw al learn statist model featur topic crawl previou work menczer belew show portion effect crawl strategi learn evolv agent neural network evolutionari algorithm present highli creativ phase design topic driven crawler accompani research evalu complex problem challeng specif web crawler magnitud retriev result limit avail user base relev judgment previou research start explor altern approach assess qualiti web page summar crawler perform companion paper expand methodolog describ detail framework develop fair evalu topic driven crawler perform analysi base qualiti space resourc formal class crawl task number evalu metric base sourc relev analyz time complex scalabl number crawl algorithm studi relationship perform crawler topic characterist goal paper examin algorithm aspect topic driven crawler evalu framework group crawl algorithm repres domin varieti publish literatur base evalu crawler design implement class crawl algorithm stand perform crawler task consid crawler class focu crucial machin learn issu studi domain web crawl role explor versu role adapt evolutionari versu static approach intent obtain complet reliabl pictur advantag disadvantag crawl strategi drawn current literatur section summar aspect evalu framework relev studi includ system formal crawl descript dataset evalu metric emploi assess effect effici crawler section outlin number crawl algorithm literatur compar perform respect effect effici scalabl algorithm analyz vari resourc constraint crawler class crawl algorithm class algorithm introduc section studi tradeoff explor exploit issu adapt discuss section class crawl algorithm individu learn estim link base local linkag lexic popul evolv bia explor process area web section discuss robust result face longer final section discuss find conclud paper idea research evalu framework order empir studi algorithm issu outlin illustr evalu framework experi focu aspect framework relev paper complet treatment reader refer companion paper concurr crawler logic concurr crawler logic frontier privat data web system architectur lexic analyz html parser url util http http main frontier privat data keyword seed url url map cach topic benchmark histori data offlin analysi descript target url figur architectur crawler evalu framework figur illustr architectur crawler evalu framework system design logic specif crawl algorithm encapsul crawler modul easili plug system standard interfac crawl modul share public data structur util optim effici affect fair evalu exampl common facil includ http interfac simpl html stemmer benchmark report routin system implement perl berkelei store persist data data structur share concurr process test crawler visit max page page start seed set max page paramet set state timeout web download larg page chop retriev kb protocol http filter page content stale link yield http error code remov good link analysi resourc constraint crawler consum network bandwidth download memori maintain privat data structur support cpu evalu select disk storag store text link fetch page persist data complex select greater resourc order fair comparison crawl track cpu time crawler page ignor time fetch common crawler imposs control network traffic benchmark oper monitor cpu time compar complex crawl algorithm limit memori crawler constrain size buffer buffer crawler temporarili store link typic frontier page link explor crawler track maximum max buffer link buffer crawler decid link substitut ad max buffer paramet vari gaug perform crawl algorithm scale memori resourc crawl task start seed set discuss word target repres subset relev page identifi target set crawler reach target page similar seed page begin crawl figur illustr gener crawl task seed page chosen seed exist path target distanc link practic identifi seed page inlink target page submit queri figur gener crawl task seed page path target shown grai search engin yield url page link page repeat step target start end maximum uniqu url subset seed url pick random set note procedur path seed set target gener crawl task formal class problem difficulti intuit seed coincid target crawler start page assum relev task mimic search mode user crawler sampl relev page altern strategi seed obtain web search engin idea crawler find relev page topic approach crawler evalu research date assumpt implicit crawl task page relev tend neighbor object crawler stai remain neighborhood relev document identifi seed evalu perform crawler typic applic crawl task search agent result search engin start point provid user recent person result compli robot standard variant task part target set seed set evalu capabl locat rest task part web mine competit intellig applic search start home crawl seed target page case prior inform crawler relev page crawl begin idea crawler find relev page crawl task involv seek relev page start crawl link link relev page crawl task rare consid literatur fact difficult problem task problem realist commonli user unabl relev url effort relat task author start crawl gener point cho al start crawl gener stanford web topic primit role research target set identifi import understand crawler task context singl vari difficulti serv valid search mode analyz perform number crawler paper limit difficult note larg averag fanout web problem bit needl haystack illustr observ crawler chanc visit target seed assum averag fanout link start seed visit impli expect upper bound recal target page topic target dataset order evalu crawler topic relev target theoret gener topic target set frequent queri search engin user assess approach make obtain larg number topic target cumbersom dataset date time dynam natur web fortun data web directori updat human editor past research due popular current work open directori commerci maintain larg number volunt editor collect topic run random crawl start main categori open directori site crawler identifi dmoz page children categori node leav extern link deriv topic topic repres type inform deriv leaf page word dmoz hierarchi form keyword extern link form target concaten text descript anchor text target url dmoz human form descript differ topic keyword topic descript give model detail gaug relev crawl page analysi tabl show sampl topic experi paper topic perform metric previou research explor altern methodolog evalu crawler includ method assess page relev linear similar comput explor method summar crawler perform plot similar retriev page topic descript time comput averag fraction retriev page assess classifi end base previou companion paper discuss detail number measur select minim set provid round assess crawler perform assess recal static dynam lexic criteria page relev lead matrix perform metric addit assess effici crawl algorithm aspect consid literatur tabl sampl dmoz topic descript bottom topic truncat space limit keyword descript target comput softwar workflow consult societi activ consum sport document manag workflow consult eid provid document manag workflow consult year heavili involv establish industri standard servic rang feasibl studi implement fast guard softwar servic special softwar sale consult nt exchang network email directori synchron workflow document manag nt print manag internet manag wang migrat softwar group workflow consult web applic develop train corpor govern gain ag consult implement educ busi process engin workflow case qualiti manag healthcar industri area small larg imag inform consult imag workflow consult implement busi critic electron document manag workflow plc financ intranet extranet workflow technolog secur invest deploi front offic client relationship manag back offic applic enabl straight process provid collabor knowledg manag internet content manag busi process softwar solut servic group project manag larg scale applic integr legaci migrat ebusi project sector compani pdf solut servic solut provid print publish sector pdf digit workflow train consult softwar hardwar bad busi bureau rip report consum report web site enter complaint compani individu rip peopl consum consum advoc offer free servic reconcil consum disput problem foundat consum nation recogn california base profit consum educ organ deal insur reform healthcar reform bill error complain uk poll show major peopl uk hate number shop restaur travel compani mistaken belief good sale find protest home design common construct defect side defect rip confront group reader report anti consum fair swedish consum coalit consum goal influenc consum market util consum action network san diego california consum watchdog group consum energi util internet consum supermarket privaci number consum group supermarket club card program list card statu supermarket fight privaci registr surveil program number bui food grow surviv wi thing american associ creat promot log roll run river sourc inform water american associ group women dedic upgrad standard jack festiv festiv held dai held juli beauti st entertain guid inform contest show world record competit world world annual event wi includ competit includ chop tree climb paper emploi perform metric dynam measur effect machin learn techniqu perform crawl algorithm time focu studi issu greedi effect vari crawl dynam measur provid tempor crawl page fetch crawl progress metric simpl recal level base target page determin crawler locat highli relev page relev page target set assess capabl locat relev estim relev crawl page lexic similar page topic descript recal crawler knowledg topic descript manual compil human expert describ relev site page similar descript good likelihood close relat topic induc binari relev assess guess arbitrari similar metric measur similar topic descript set page crawl recal similar plot number page crawl obtain trajectori time displai dynam behavior crawl state art crawler crawler exploit hyperlink structur retriev page link retriev page outward link ad list unvisit refer crawl frontier kei challeng progress topic driven crawl identifi link follow frontier algorithm select link necessarili ti goal crawler crawler aim index web make kind aim collect page web site page movi review crawl order syntax url limit retriev page foreach link link doc figur pseudocod crawler similar sourc page guid link select crawler serv goal adopt crawl strategi crawler descript section describ evalu crawl algorithm implement evalu infospid tion intend broad crawler algorithm report literatur deriv prior current research section gener algorithm greedi level crawler simplest strategi crawl algorithm explor earli webcrawl recent research frontier fifo crawl link order encount note frontier crawler add link crawl page algorithm shown figur baselin knowledg expect perform provid lower bound sophist algorithm bf foreach link link doc score figur pseudocod crawler crawler studi basic idea frontier link estim criterion select crawl typic initi case set guid crawl specif link select process comput lexic similar keyword sourc page link similar page topic estim relev page point url estim select crawl cosin similar crawler link minimum similar score remov frontier order exce buffer size max buffer figur offer simplifi pseudocod algorithm function return cosin similar topic kp kq fetch frequenc term preliminari experi task shown bf competit crawler assess compar state art algorithm challeng crawl task pagerank pagerank foreach link link doc figur pseudocod pagerank crawler pagerank brin page model user surf behavior pagerank page repres probabl random surfer link randomli page page time score depend score page point sourc page distribut pagerank outlink γ page set page point set link constant γ damp factor repres probabl random surfer request random page origin pagerank intend combin content base criteria rank retriev set document fact pagerank googl search engin recent pagerank guid crawler assess page qualiti previou work evalu crawler base pagerank effici algorithm calcul pagerank equat pagerank requir calcul comput resourc intens process ideal situat recalcul pagerank time url select frontier improv recomput pagerank regular interv pagerank crawler algorithm illustr figur function return cosin similar topic page measur equat pagerank comput equat note pagerank algorithm maintain data structur visit page addit order comput pagerank buffer max buffer page assum page url implicitli link page requir pagerank algorithm converg γ threshold converg set aggress version crawler search extens area web relev page found algorithm discontinu search region yield relev page offer main improv continu valu function measur relev binari relev function refin notion potenti score link crawl frontier potenti score link influenc anchor text surround inherit score ancestor point page figur show pseudocod crawler paramet repres tive maximum depth rel import inherit versu neighborhood score implement set close detail al infospid infospid adapt popul agent search page relev topic evolv queri vector neural net decid link follow evolutionari approach fit measur base similar local select criterion origin algorithm shark foreach link link doc foreach outlink score figur pseudocod crawler simplifi implement crawler modul crawler outperform bf due extrem local behavior absenc memori link agent visit page link page made number improv origin algorithm retain capabl learn link estim neural net focu search area select reproduct result algorithm schemat illustr pseudocod figur infospid agent independ crawl parallel adapt agent consist list keyword topic neural net evalu link input unit neural net receiv count frequenc keyword occur vicin link weight give import keyword occur link maximum anchor singl output unit simplif retain implement neural network hidden foreach agent link doc foreach outlink score alpha delta theta figur pseudocod infospid crawl agent consist simpl perceptron impli neural output unit comput nonlinear sigmoid function input neural network learn linear separ input space feel power intern level correl relev distribut keyword link output neural net numer qualiti estim link consid input estim combin estim base cosin similar keyword vector page link paramet α regul rel import estim base neural net versu parent page base combin agent stochast selector pick link probabl λ λ link page combin score β paramet regul greedi link selector experi paper α β page agent receiv energi proport similar keyword vector page neural net train improv link estim predict similar input page link lead epoch standard error learn rate learn techniqu infospid uniqu capabl adapt behavior crawl associ relev estim pattern keyword frequenc link agent move newli select page function return true condit figur determin stochast base probabl δ differ similar current page keyword vector temperatur paramet energi level determin agent reproduc visit page agent reproduc energi level pass constant threshold offspr receiv half link frontier keyword vector mutat ad term frequent current document mutat infospid uniqu capabl adapt search strategi base clue captur reproduct popul bia search area lead good page max pop maintain distribut frontier total size exce max buffer behavior individu agent base local link estim keyword unlik origin agent retain global search space frontier result outlin result number crawl carri evalu compar effici scalabl state art crawl algorithm section result section base crawl task discuss section task find target page difficult akin search needl haystack result section base averag topic error bar plot correspond standard standard deviat topic interpret error bar statist differ confid level assum normal dynam perform prior experi pagerank crawler found competit due minim exploit topic context resourc limit pagerank metric design global measur valu comput small set page averag similar page crawl pr bf figur averag similar topic descript pagerank crawler task data base topic figur plot averag similar topic descript start target page poor perform pagerank perform measur task report crawl algorithm remaind paper perform state art crawler infospid compar figur ran variat crawl algorithm valu max buffer recal similar yield qualit consist result expect perform poorli constitut baselin perform significantli similar metric max infospid significantli outperform crawler end similar metric max infospid suffer larg initi loss fulli recov page displai advantag infospid earli stage time page crawl differ longer case except recal max plot suggest initi stage crawl bf error bar bit larger max averag base topic due time constraint averag recal averag recal averag recal averag recal shark breadthfirst bf page crawl shark breadthfirst bf page crawl page crawl shark breadthfirst bf shark breadthfirst bf page crawl averag similar averag similar averag similar averag similar shark breadthfirst bf page crawl shark breadthfirst bf page crawl shark breadthfirst bf page crawl shark breadthfirst bf page crawl figur averag target recal similar topic descript infospid crawler task plot row correspond max buffer averag recal shark breadthfirst bf averag similar shark breadthfirst bf figur scalabl averag target recal similar topic descript max buffer infospid crawler greedi infospid pai penalti adapt neural network evolutionari bia chanc kick stochast selector make local suboptim choic featur prove stage crawl similar topic descript hold steadi improv slightli infospid graph crawler show downward trend page scalabl figur show perform affect max buffer paramet assess crawl algorithm scale space resourc figur plot perform recal similar topic descript versu max buffer affect frontier similar topic descript significantli max buffer limit space resourc hurt crawl algorithm priorit due higher risk throw good link perform frontier size discuss effect section effici analyz time complex crawl algorithm focu cpu crawler equal subject noisi network delai exclud cpu time rel cost shark breadthfirst bf shark breadthfirst bf figur scalabl time complex ratio max buffer infospid crawler common util function share crawler section caveat actual time algorithm irrelev depend larg load hardwar configur run crawl crawl experi paper run larg number machin wide hardwar configur chang load obtain measur time complex compar effici introduc rel cost crawler ratio time visit page cumul time set crawler visit max page tmax page set crawler rel cost metric robust respect crawl topic long crawler run singl topic machin metric combin sourc evid perform effici end defin metric ratio perform rel cost crawler product target recal similar topic target similar topic set topic figur plot versu max buffer state art crawler search crawler effici effici larger frontier size trim frontier frequent intermedi complex effici frontier size link compar infospid effici time complex converg max discuss complex infospid frontier size section ratio plot figur yield infospid winner ow good manc excel effici clear posit trend frontier size pai price complex surpass smallest frontier size poor perform ineffici place posit result strongli depend time complex algorithm depend applic crawler explor versu exploit section issu explor versu exploit defin characterist web crawler issu machin learn artifici present task search guid qualiti estim regular measur qualiti point search space inform qualiti nearbi point greedi algorithm exploit inform concentr search vicin point strategi lead miss equal good estim search space local optima trap algorithm locat global optima visit point order arriv algorithm complet disregard qualiti estim continu explor uniform random fashion risk stuck local inform bia search spend time explor suboptim area balanc exploit explor clue call heurist search optim point unknown topolog search space understood typic case interest search space topic driven crawler fit pictur view web search page point neighborhood defin hyperlink crawler decid page visit base cue provid link nearbi page assum relev page higher probabl relev page random qualiti estim page provid cue exploit bia search process short rang relev clue web graph relev page link appar irrelev balanc exploit qualiti estim inform explor suboptim page crucial perform topic driven confirm empir crawler descript section describ gener version design tune greedi level crawler studi tradeoff exploit explor crawl applic gener section gener bf iter batch top link crawl select complet crawl page crawler decid batch figur offer simplifi pseudocod class offer ideal context studi paramet control greedi behavior crawler result crawler greater emphasi explor reduc emphasi exploit select smaller set link exploit evid potenti merit link experi test crawler set foreach link foreach link doc score figur pseudocod crawler correspond algorithm figur gener section figur show pseudocod class gener shark algorithm extend bf iter batch top link crawl select complet crawl page crawler decid batch made exploit explor vari greedi crawler crawler algorithm made explor exploit regul amount link estim case frequenc pagerank calcul redon kei greedi frequent exploit crawler infospid regul greedi chang paramet stochast selector β greater exploit greater extrem case β gener uniform probabl distribut frontier foreach link foreach link doc foreach outlink score figur pseudocod crawler correspond algorithm figur averag recal averag recal bf page crawl shark page crawl averag similar averag similar bf page crawl shark page crawl figur averag target recal similar topic descript repres crawl result focu class crawler behavior straightforward interpret term explor paramet result section summar extend preliminari experi show yield perform number dynam perform dynam result summar figur paramet max buffer set link plot perform select subset crawler behavior remain crawler extrapol curv hold crawler case clear explor perform crawler averag recal bf averag similar bf figur scalabl averag target recal similar topic descript max buffer repres crawl gener significantli crawler gener page gener paint interest pictur observ exploratori bear initi penalti explor recov long page catch case recal eventu surpass result consist observ previou section greedi earli hinder perform longer run import note pure explor suffici achiev perform figur show outperform bf conclud success crawl strategi emploi combin explor exploit gener case interest search problem local optima inspect figur reveal perform page crawl task achiev max link scalabl figur plot perform page versu frontier max buffer trend unaffect frontier size rang adapt crawler web heterogen space link lexic cue vari greatli depend page homepag carefulli link page colleagu relat commerci site carefulli avoid pointer competit fact shown page domain tend link lexic similar page significantli higher likelihood page domain question topic driven crawl algorithm advantag adapt techniqu chang behavior base experienti context page term misl link music wise give import term futur previou research shown type spatial tempor context exploit individu adapt crawl algorithm experi limit small portion web onlin crawler descript section studi noisi web crawler signal intern improv crawl perform crawl signal reliabl hinder capabl focu search infospid crawl algorithm section design princip explor number adapt mechan built infospid individu neural network weight adjust agent learn predict link weight unit term made larger rel weight term happen agent link highli rate neural net proxim find page point link small similar topic algorithm similar teach signal train neural network make accur predict studi effect individu learn crawl variat infospid algorithm learn disabl neural network frozen initi ident weight popul adapt mechan infospid select search favor portion web agent encount page high similar topic indic frontier higher qualiti link agent agent local intern inform creat offspr energi surpass reproduct threshold practic doubl frequenc link parent agent jointli explor parent offspr agent fair collect frontier popul maintain max buffer reproduct local frontier split parent offspr impli cost adapt crawl algorithm local link estim base smaller frontier subject local fluctuat max pop size paramet determin maximum algorithm explor valu studi tradeoff perform distribut crawl strategi evolutionari bia adapt mechan stem evolutionari bia select topic keyword offspr agent pick term page parent recal agent maintain random walk page high probabl page high similar topic keyword figur equat offspr potenti improv crawl perform intern lexic featur posit correl relev estim add pai attent term realiti good indic relev select topic keyword disabl set max pop size paramet result compar variat infospid crawler learn evolut enabl valu explor max buffer paramet dynam perform figur show dynam perform plot infospid variat differ observ gener trend frontier small evolut learn hinder target recal problem evolut understand small agent small set link work risk make poor decentr link select process evolut hinder similar topic page similar target descript miss target necessarili impli miss possibl relev page neg impact learn perform small frontier clear deserv analysi figur plot error made infospid agent pop estim similar page point link plot show error neural net error actual estim pick obtain combin neural net output similar parent page section actual estim improv neural error subject sharp initi slower data show heterogen web lead agent hundr page neg effect learn interpret risk spawn agent page learn effect frontier larg figur max similar topic domin factor evolut learn effect fact evolut explain larg frontier agent retain adequ number link pick decentr search riski crawler advantag posit effect search averag recal averag recal averag recal averag recal learn learn learn learn page crawl learn learn learn learn page crawl page crawl learn learn learn learn learn learn learn learn page crawl averag similar averag similar averag similar averag similar learn learn learn learn page crawl learn learn learn learn page crawl learn learn learn learn page crawl learn learn learn learn page crawl figur averag target recal similar topic descript variant infospid crawler plot row correspond max buffer squar error page crawl estim neural net estim figur link estim error singl infospid averag topic area select keyword inspect figur reveal infospid evolut compet perform page crawl task max link introduc find disappoint adapt capabl infospid harm good short crawl limit resourc scalabl plot figur show perform infospid variant scale frontier size neg trend discuss section differ perform variant observ figur largest spread observ small frontier size learn evolut hinder target learn hinder similar topic descript effici complex plot figur reveal interest result learn complex crawler requir extra time train neural net evolut averag recal learn learn learn learn averag similar learn learn learn learn figur scalabl averag target recal similar topic descript max buffer variant infospid crawler rel cost learn learn learn learn learn learn learn learn figur scalabl time complex ratio max buffer variant infospid crawler larger frontier size figur effici evolut stem fact distribut algorithm divid problem simpler tackl independ agent agent popul cumul simpler job central agent absenc complex max buffer work order central manag larger frontier link presenc evolut trend point max extra advantag evolut extra cost learn interpret trend imagin popul size grow faster larger frontier trigger earlier reproduct event plot figur close rel cost algorithm ferenc perform data short crawl suggest infospid evolut learn long crawl crawl consid visit page user wait behavior crawl algorithm turn crawl larger number page explor section briefli longer crawl crawler descript select repres crawler paper rel perform qualit page crawl obviou candid displai perform infospid learn strong perform short interest studi learn turn longer run select infospid evolut learn select usual provid baselin note theoret limit long crawl page expect crawler converg question fast crawler crawler converg fastest converg slowest baselin lower bound result ran crawl infospid max link dynam perform figur show dynam perform crawler longer crawl error bar larg ow small number result similar topic descript noteworthi infospid maintain constant averag recal breadthfirst page crawl averag similar breadthfirst page crawl figur averag target recal similar topic descript infospid page crawl suggest continu find relev page target infospid significantli outperform differ infospid result consist shorter crawl note recal pretti close converg page page infospid suggest longer crawl final recal level target pretti good result difficulti task effici ran long crawl max scalabl data complex algorithm discuss previou section conclud analysi ratio plot dynam figur infospid emerg clear winner combin competit perform penal complex end close figur suggest short crawl page effect conclud remark hope describ state art topic driven crawler unifi evalu framework foster studi lead improv crawl algorithm ultim page crawl breadthfirst figur dynam ratio infospid page crawl search tool public larg conclud summar main contribut discuss outlin direct futur work summari major contribut present work summar crawl introduc gener improv previou algorithm base evalu crawler perform difficult crawl task seed url link relev target recal level achiev number crawler literatur reimplement evalu fair condit rel effect shown consist perform metric space resourc algorithm shown effect short run short crawl lesson incorpor algorithm queri time crawler shown consist explor lead coverag highli relev spite penalti earli stage crawl suggest explor tradeoff short term gain longer term potenti larger gain found blind explor lead poor demonstr mix explor exploit good perform studi adapt techniqu demonstr machin learn improv perform achiev difficult crawl task make local inform infospid competit shown reinforc learn provid suffici strong advantag predict link offset cost risk addit mistak train phase analyz time complex crawler found distribut algorithm infospid extrem effici improv larg amount resourc point blind algorithm infospid achiev ratio greedi algorithm requir larg amount time sort candid link scalabl final result shown remain substanti unalt crawl order magnitud longer effect kick infospid thousand page discuss find disappoint adapt yield greater advantag learn contrari hurt web noisi environ mistak costli task interest repeat experi adapt crawler simpler task factor paramet tune extens task tune learn rate train neural net greedi paramet prove benefici observ infospid effici larg frontier perform worsen phenomenon deserv studi current theori larger frontier lead earlier explain gain effici earli reproduct sort suboptim exploit earli evid lead miss good page understand optim reproduct frequenc obtain tune reproduct threshold paramet simpl growth frontier impli inher crawler hard time cope present analysi base small number evalu metric select task discuss paper measur paper base averag topic learn studi characterist topic observ topic featur good perform crawler issu discuss companion paper evalu aspect crawler studi devot resourc obtain statist result analyz data topic larg number experi obviou limit bandwidth sever constrain length crawl carri longer crawl applic support topic portal learn topic random obtain reliabl result reliabl kei understand behavior topic driven crawler complex environ web acknowledg grate soumen steve nick street dave eichmann comment earli stage sigir www review construct critic alberto dave eichmann comput support work fund part nsf career grant fm nlm grant ps refer cc ps yu intellig crawl world wide web arbitrari predic proc intl world wide web page al ad support dynam search comput bharat mr improv algorithm topic distil hyperlink environ proc acm sigir conf research develop inform page brewington cybenko dynam proc intern web brin page anatomi hypertextu web search engin comput van den dom approach web resourc discoveri comput cho evolut web implic increment crawler intern confer larg page effici crawl url order comput size internet white juli de bra post inform retriev world wide make search feasibl proc intl world wide web gori crawl context graph proc intern confer larg page gari william steve lee fran web identif commun ieee jm raghavan infer web commun link topolog proc acm confer hypertext page effici comput pagerank technic stanford mr najork measur search engin qualiti random walk web proc intl world wide web page ur rithm tailor web site map proc intl web kleinberg authorit sourc hyperlink environ journal kleinberg lawrenc structur web sr tomkin trawl web emerg commun comput sr lawrenc cl gile search world wide web sr lawrenc cl gile access inform web menczer link lexic semant web content menczer adapt retriev agent heurist neighborhood inform discoveri proc intern confer machin page menczer complement search engin onlin web mine agent support forthcom menczer rk belew adapt inform agent distribut textual environ proc intern confer autonom page menczer rk belew adapt retriev intern local context scale web machin menczer ae mong scalabl web search adapt onlin infospid case studi intellig inform inform discoveri manag page srinivasan evalu web crawler proc annual intl acm sigir conf research develop inform najork wiener search crawl yield page proc intern world wide web pant menczer evolv intellig web crawler autonom agent menczer explor versu exploit topic driven crawler proc workshop web pinkerton find peopl experi webcrawl intern world wide web porter algorithm suffix strip de ge rj william learn intern error propag de rumelhart jl parallel distribut explor microstructur volum chapter bradford book menczer data evalu ieee submit ce understand web resourc server improv cach proc intl world wide web
DB/1514 3 technic report replic epidem updat joann agraw amr el abbadi depart comput scienc california santa barbara santa ca usa abstract due sever perform penalti synchron interest asynchron replica manag protocol transact execut effect transact incorpor asynchron remot copi asynchron protocol consist serializ transact semant restrict placement data data object updat paper investig epidem updat protocol consist serializ spite capabl conduct experi detail simul replic evalu protocol result establish epidem approach viabl altern tradit eager updat protocol distribut environ consist full serializ introduct data replic distribut import problem investig extens decad spite numer solut effici access replic data remain data replic long tout techniqu improv perform high reliabl distribut data replic deliv due complex maintain integr consist replic data tradit approach replica manag incur perform penalti recent paper entitl danger replic shasha argu convent approach replica manag capabl full serializ impract imposs replica manag techniqu tradit approach requir synchron execut individu read write oper execut set copi transact commit lock protocol execut read oper acquir read write oper execut obtain write lock copi oper transact commit phase commit lock approach requir read obtain lock read copi write obtain lock write copi altern approach promot network distribut oper system commun execut oper local synchron work partial support nsf grant updat propag copi site propag network epidem approach updat ensur eventu updat propag system epidem approach refer asynchron adopt compani informix techniqu safe ensur serializ overcom anderson al breitbart al graph structur site classifi copi primari secondari restrict transact updat copi data object rabinovich al algorithm manag replic data asynchron algorithm eventu consist execut transact semant interest method reduc overhead due version comparison develop hybrid approach transact execut oper commit epidem commun propag updat replica site updat incorpor transact commit approach ensur serializ access restrict exploit advantag epidem asynchron propag execut updat oper system paper explor potenti benefit epidem commun replica manag system ensur serializ detail simul evalu perform protocol result transact commit updat propag approach viabl solut replic problem distribut environ relianc comput data replic replic server import design highli scalabl server import develop explor strategi support replic data effici work paper repres effort direct paper organ section defin system model section discuss specif replic data updat protocol section describ simul program section present result experi paper conclud discuss section system commun model paper distribut system consist number server site maintain copi item refer site server copi copi equal primari copi serial write data item copi secondari updat site site connect effici network site commun network requir reliabl messag arriv unbound amount time lost messag arriv corrupt order accomplish epidem site contact site send inform inform propag transit manner transact sequenc read write oper data item transact origin site initi home site strict lock wide assum concurr control local enforc strict phase lock protocol server copi site event model describ system set oper relat partial order oper relat transit closur ffl local order event occur site total order ffl global order send event receiv event model preserv potenti causal oper captur relat oper causal order effect appli order site lamport relat defin clock properti refer clock lamport clock vector clock extens lamport clock ensur iff vector clock detect relationship event case case denot case concurr addit vector site maintain commun event log transact oper log recoveri log sole epidem commun site exchang respect commun log inform oper occur system inform exchang ensur eventu site incorpor oper occur system due natur commun record includ messag sender recipi messag receiv record bernstein combin commun log vector clock solv distribut dictionari problem effici site correspond recent knowledg vector clock site ensur receiv record event time local reduc commun desir site site receiv record event end predic defin site local time occur true receiv record event site perform updat oper place event record log record oper send messag includ record includ receiv messag appli updat receiv log record updat atom step reflect inform receiv site receiv log record log record causal event receiv previou includ messag refer log properti state respect local copi log site protocol ensur site awar event delet awar causal event epidem updat protocol epidem protocol origin develop singl updat oper describ epidem updat protocol support transact semant successfulli complet oper home local concurr control method phase transact commit time process record readset valu timestamp home site vector clock written local commun log held transact timestamp row compon increment timestamp assign ensur domin transact initi note point possibl transact abort due conflict transact enforc transact abort site contact site initi epidem determin log record receiv transact record record believ unknown site messag time tabl receiv read transact record order determin conflict transact log commit updat time tabl inform oper conflict oper data origin transact write oper vector timestamp transact determin concurr read write set log record determin conflict transact conflict condit ffl incompar execut concurr ffl intersect nonempti execut conflict oper transact involv conflict abort lock hold mark record log abort insert record abort transact retain log site time site knowledg transact termin transact record execut obtain write lock incorpor updat local copi local transact hold conflict abort grant lock transact commit remaind lock abort site knowledg transact protocol ensur serializ shown protocol toler site crash network inform store log remain failur inform transmit relev site viabil asynchron propag approach replic inform demonstr maintain global control inform distribut system main issu remain asynchron approach work replic requir strong consist multipl oper atom altern tradit approach requir transact acquir lock replica receiv acknowledg end atom commit protocol phase rest analyz perform epidem protocol comput simul demonstr varieti fact feasibl approach maintain data asynchron preserv serializ lock tabl cpu data disk log disk dbm site facil site read write set cpu sourc dbm abort commit request network site messag figur model structur singl site simul model simul base standard simul model site model shown figur site sourc thread gener transact transact make read write request site dbm thread maintain enforc maintain commun log initi epidem messag site resourc time transact site dbm recoveri log network transact model sequenc read write oper read write subset readset time success oper request transact set ms site copi page make number data page studi data content issu easili page repres larger studi complet replic assumpt easili relax reflect copi subset site page assum lock granular data disk granular dbm strict lock ensur local serializ maintain check cycl time edg ad deadlock transact highest transact id chosen victim handl singl site deadlock epidem protocol global deadlock system paramet model tabl valu paramet govern gener behavior transact tabl gener transact govern site transact interarriv time made arbitrarili paramet mean transact interarriv time vari number site vari er epidem rate vari number data disk site smallest data disk access time ms maximum data disk access time ms cpu time access disk ms time forc write log ms number log record page probabl cach hit cpu time handl data item lock ms tabl system paramet paramet mean smallest transact read set size maximum read set size percentag read transact smallest write set updat transact maximum write set size cpu time spent data page ms time success oper request ms tabl transact paramet long short correspond queu model system accept request unbound number user set percentag transact reason assumpt transact queri readset size read oper updat transact readset size read oper size write oper subset readset blind write simul model assum network fulli connect site exchang messag directli site assum network fast effici amount cpu time send receiv messag set ms site readi initi epidem session receiv site random remain site epidem rate determin site initi epidem updat result present result varieti experi conduct goal experi evalu perform epidem protocol system load vari evalu perform epidem updat protocol rate messag exchang epidem vari determin impact replic system perform ascertain advantag replic mean improv system perform measur experi made run simul confid interv achiev data point typic transact kei measur abbrevi analysi measur time millisecond state time updat transact record simul time made read request system updat transact time commit time measur millisecond time transact commit record simul time made read request system commit transact commit time updat transact includ measur commit time transact simpli commit commit time transact record separ updat transact exponenti distribut transact interarriv time site made load system multiprogram level limit number activ transact vy resourc data item lock epidem rate epidem rate millisecond site initi epidem commun site busi local actual rate state time analysi commit time pre commit time commit figur time site set analyz time updat transact function system site epidem rate ms result figur show averag commit time transact averag commit time updat transact millisecond greater load repres smaller time requir transact transact commit transact execut affect chang work load low high rate concurr execut transact site high conflict frequent competit resourc easi account time transact transact averag oper request millisecond issu oper ms averag ms cpu time consum process ad ms transact time disk read ms oper hit rate averag ms disk access total ms low transact commit ms total ms spent manag function log lock tabl manag deadlock place lifetim transact competit transact resourc updat transact longer transact forc write updat data recoveri log requir approxim averag cost write slightli higher averag cost read oper updat transact base local execut requir commun time updat transact close time transact commit updat requir commun site system transact commit home site site transact averag delai approxim ms transact commit ms ms addit delai addit time commit spent disk site receiv record write put log send commun cost account time disk commun avoid random natur commun structur consid system site order logic ring site send messag order determinist set comput time commit spent record visit site system commit inform site visit report back origin site round messag ring turn site ring commit time chang significantli random epidem messag figur high system ring topolog commit time random messag time ms commit time order messag time ms commit time situat worsen larg time ring configur due queu effect disk updat record singl messag time spread lot time consum disk ran addit experi cach hit rate read write access memori result shown figur chang result interest wai time faster commit time gap time commit smaller account messag cost replic conjunct ring commit time pre commit time commit time site ring ms disk commit time pre commit time commit time disk figur site ring disk cost updat transact copi incur low overhead evalu result main memori system replic copi current disk site fail transact spread record transact inform lost sourc transact receiv final commit acknowledg detect error site fail transact spread transact inform share site recov vari replic commit time pre commit time commit figur time site commit time pre commit time commit er commit time pre commit time commit er figur time site experi compar system copi site interest commun overhead introduc addit site advantag handl transact recal transact gener execut commit home site site system epidem rate ms system larg number messag site messag millisecond graph show effect number site recal interarriv ms mean transact start ms site site mean transact start ms evalu system load newli gener transact ms site ms site system site system notic number site rel distanc commit time indic addit overhead introduc network site system transact time commit time mean overhead introduc network enabl transact commit ensur serializ site system transact time commit time mean overhead introduc network site system transact time commit time commun overhead time system excess site system handl transact site system handl transact site system handl transact site system successfulli handl possibl handl transact ad site system outweigh addit overhead introduc site optim size paramet maxim transact capac reason site vari epidem rate transact mix vari epidem rate hold paramet constant vari epidem rate ms ms site system ms result show time depend final commit time highli sensit er frequenc commun site transact commit faster interest effect epidem rate ms time slightli higher commit time ms ms ms ms updat time ms ms ms ms epidem rate site constantli send receiv messag inform site timet chosen transact record send time tabl overload cpu result delai process updat transact observ messag ms inform frequent site incom messag wait process advantag shorter epidem rate offset disadvantag larg amount messag process effect pronounc system time commit time pre commit time commit time time commit time pre commit time commit time figur time function epidem rate experi repeat site condit figur show site experi number transact gener figur graph typic experi commit time affect epidem final commit time epidem rate experi learn frequent commun benefici effect commit time epidem rate fast site frequent messag transact record perform system suffer order studi effect updat system vari percentag updat transact gener earlier result time transact unaffect replic break proport updat transact updat commit time pre commit time commit time updat commit time pre commit time commit time figur site proport transact shown figur commit time greater due data content updat transact mean write lock held long time forc reader high load system overwhelm data content greater environ conduct experi higher percentag transact result experi transact depict figur observ percentag transact significantli influenc latenc incur commit updat transact global due content resourc perform gain transact indic commit transact commit local lock commun updat commit home site transact site transact read write lock held commit time recent interest optimist protocol updat transact lock time optimist assum transact succe commit realist system low conflict rate applic recov incorrect ramif optimist note transact lock time conflict serializ abort transact result cascad abort radic approach commit transact time complet execut transact line current commerci system replic oracl develop applic depend reconcili rule conflict resolut mumick languag rule appli order determin set rule unambigu cascad abort applic reconcili rule resolv effect commit conflict transact minim import determin ratio tp site site site figur ratio function er environ frequent transact succe commit measur ratio commit updat transact epidem rate transact remain commit longer suscept conflict subsequ abort investig site system constant load transact result show commun frequent millisecond site updat transact commit encourag moder heavi load ratio site system longer transact lifetim commun unexpect conclud moder size system frequent commun optimist approach probabilist indic commit viabl option deserv investig comparison tradit method section explor advantag epidem base updat versu tradit synchron approach simpl tradit updat protocol local execut transact epidem protocol updat transact home site dbm acquir write lock data page replica site home site dbm send messag site request write lock remot site grant respond acknowledg home site receiv acknowledg transact perform data write proce oper transact complet home site dbm start atom commit protocol phase commit order assess perform epidem protocol model tradit updat protocol simul tradit protocol local global timeout mechan abort transact wait lock past timeout period optim timeout period maxim transact throughput found approxim time updat transact adapt timeout period base estim transact time interarriv time updat commit tradit commit tradit updat commit epidem commit epidem site time updat commit tradit commit tradit updat commit epidem commit epidem site figur time site experi perform tradit protocol system transact paramet epidem experi time epidem tradit protocol contrast site time greater tradit epidem base approach updat transact worth note time site system improv dramat time commit time updat transact ms tradit approach ms epidem base protocol improv differ time system load investig time tradit epidem protocol site system epidem base protocol execut write oper remot site conflict potenti block time transact greatli reduc valid hypothesi measur recal section ms spent disk cpu process hold time remain time commit time consist wait queue disk cpu wait lock data refer block averag wait time disk cpu calcul statist report simul remain time block data item transact epidem protocol spent averag ms wait disk ms block tradit protocol transact spent ms wait ms block higher system load epidem transact spent ms wait ms block tradit transact spent ms wait ms block clear tradit transact spend time block system load worth note disk cpu wait time greater epidem transact differ disk cpu wait time consid appar reason write request remot transact made epidem probabl wait data disk tradit write request remot transact made time ms delai time updat commit tradit commit tradit updat commit epidem commit epidem ten site disk updat commit tradit commit tradit updat commit epidem commit epidem ten disk figur time site disk updat transact longer commit time tradit low system load low system effect data resourc content minim expect effici phase commit advantag random epidem commit process propag depend random commun pattern ran addit experi disk rate log disk time section result show remov effect disk definit effect commit time commit time updat transact tradit protocol reflect forc write recoveri log home site forc write log disk initi phase commit remot site forc log respond affirm commit time updat transact epidem protocol reflect forc write recoveri log home remot site respond write record enabl home site commit transact remot site forc log commit transact remov effect disk remov advantag epidem approach term commit time low system load leav advantag high system disk mean high data content investig perform epidem protocol term total throughput transact commit good time meaningless submit transact abort figur show total throughput transact successfulli commit site system function epidem tradit protocol calcul line show number transact start comparison proport transact throughput result epidem tradit protocol high system load tradit slightli figur show site system submit transact heavier load updat throughput result chang favor epidem protocol high system load epidem protocol advantag tradit approach maintain desir characterist consist serializ reliev limit tradit total throughput start tradit epidem throughput msec total throughput start classic epidem throughput figur epidem tradit approach elimin global deadlock reduc delai block epidem protocol maintain perform system expand site site epidem commun techniqu flexibl synchron commun requir tradit approach order updat transact commit tradit site simultan particip commit epidem site eventu particip epidem asynchron site time great advantag wide distribut system experi transient failur network congest discuss lazi replic bundl commerci product disclaim safeti consist replic protocol includ restrict execut model ensur mutual consist copi lazi replic protocol inconsist execut limit render applic replic limit class applic epidem protocol studi paper ensur transact serializ replica consist requir reliabl commun toler transient network failur result perform evalu moder level epidem replic accept solut serializ system lightli moder transact unaffect replic time predict commit time updat transact predict compar tradit synchron approach result improv time updat transact improv perform note situat high data resourc content number site advantag epidem updat updat site system reason system load time intend pursu investig epidem protocol replic environ issu remain includ restrict network broadcast mechan propag effect network delai perform refer el algorithm replic proc acm symposium principl lw perform altern strategi deal deadlock manag ieee transact softwar decemb mutual proc acm sigmod inter conf manag page june pa concurr control recoveri system addison read silberschatz propag protocol replic proc acm sigmod inter conf manag page june dk vote replic acm symposium oper system page decemb shasha danger replic proc acm sigmod intl conf manag page jn grai oper advanc volum lectur note comput grai transact concept morgan san el perform replic group ieee intern symposium page june hv ao conflict acm symposium principl page perform concurr control mechan central prentic order event distribut commun juli servic distribut acm symposium principl distribut page august global state distribut intern workshop parallel distribut north oracl oracl server distribut replic data mj db mm updat propag weakli consist acm symposium oper system principl saint octob page nh updat propag epidem replic intern confer extend rh major consensu approach concurr control multipl copi acm transact june gt aj solut replic log dictionari acm symposium principl distribut august
HCI/1515 4 ad gener contextu capabl wearabl comput jason comput kent kent unit kingdom abstract increasingli import role plai develop wearabl comput system order defin role identifi gener contextu resourc augment prototyp applic construct explor capabl deploi wearabl system design aid observ game reserv benefit demonstr widespread innov capabl difficulti obtain contextu data remedi situat contextu inform servic introduc instal user wearabl ci common point access client manipul model contextu inform independ underli plethora data format sensor interfac mechan introduct abil program devic state environ form basic requir system increasingli import role plai futur wearabl comput integr wearabl ubiquit comput intim associ user comput wearabl system lead comput resourc access arrai unlik static comput multitud dynam contextu factor exploit wearabl comput paper address contextawar wearabl comput section identifi contextu capabl emploi enhanc wearabl system section case studi demonstr simpl greatli assist user final section introduc contextu inform base develop vital facilit wider contextawar technolog relationship work case studi share gener theme exploit knowledg time place common applic tour machin applic knowledg influenc inform view displai tourist prototyp applic influenc data record design contextu inform servic larg overlook area research contextu servic tend cyberguid navig cartograph project attempt situat comput servic tend offer servic simpli abstract client applic underli sensor ci design provid servic model context term object belong relationship medium oper discret call gener sensor ci seek provid continu servic rich contextu model gain data automat sensor gener capabl schilit al origin defin set gener applic categori subsequ research project defin applic specif categori present set core gener capabl vocabulari identifi describ independ interfac contextu contextu basic level contextawar wearabl comput simpli detect state present user conveni effect augment user sensori system connect locat sensor global posit system receiv deriv latitud longitud locat convei user map displai annot marker contextu adapt user interest contextu data sensori system applic leverag contextu knowledg adapt behavior integr seamlessli user environ provid uniform servic user comput tailor current situat adapt behavior user user presenc turn screen switch commun link current time contextu resourc discoveri contextu adapt appli knowledg wearabl comput context inher equat user step context entiti made inform wearabl comput discov resourc context exploit resourc remain context resourc readili wearabl comput form electron comput equip user wearabl comput limit displai capabl discov displai screen close proxim temporarili displai inform conspicu inform resourc lie user environ servic timet broadcast local infrar transmitt instal transport servic contextawar estim arriv time calcul base present posit import aspect contextu resourc discoveri bridg philosoph gap wearabl ubiquit comput wearabl comput set core servic constantli user whilst contextu bind devic user environ ubiquit complement augment wearabl system contextu augment discuss contextu inform interact environ contextu augment extend capabl augment environ addit inform achiev associ digit data context relat depend user perspect coupl real virtual view digit data augment realiti realiti augment digit data preval applic augment realiti digit data tourist equip applic present inform attract surround approach altern perspect digit data augment address book program augment entri present current locat activ extra user rout phone call phone nearest postpon call meet addit coupl facilit execut program user specif situat extend architectur common major comput system encompass contextu event surround environ observ case studi prototyp tool examin produc part comput environ project fund project experi concept construct prototyp system assist user common task typic broad spectrum subject domain system examin extens observ studi wearabl comput concept domain user larg area crawl thick face condit make carri oper laptop comput complet impract devic move wearabl comput extrem dynam equat fast chang context exploit wearabl comput aspect observ record bite time inform chang approach provis comput resourc sole driven unusu environ natur work field observ user maxim time spend observ whilst minim time spend auxiliari task interact record medium appli larg volum data record short period wearabl comput intim associ attempt seamlessli integr comput resourc environ data collect observ work larger part focu record state user locat observ point record devic greatli assist user make observ state user surround field assist hardwar direct work prototyp explor develop softwar construct hardwar design ergonom solut reflect select readili hardwar run tool develop figur record observ top palmpilot link restrict select comput hardwar devic wide match earlier attribut robust chose palmpilot pda digit small form handwrit recognit design philosophi orient singl suitabl candid replac paper notebook awar time augment knowledg locat attach gp receiv provid foundat build program util simpl understand time place armi equip palmpilot gp receiv left pocket remain user remov palmpilot order note figur cabl devic constantli connect improv perform gp receiv extern discret conceal fabric connect prefer gp receiv option accessori field assist softwar prototyp softwar concentr provid set tool assist observ data collect user record inform environ interest diverg tourist inform author context present context note model basi construct tool electron note made user automat attach current context user creat note note consist messag relat locat context messag attach model extend gener note consist set element describ content context note observ set valu equal describ content context observ depend perspect observ note consist anim describ content context develop program palmpilot user view note main detail creat edit note handl program user creat note templat set type pair creat edit valu user figur assist observ process emploi system knowledg time place automat default locat time field current contextu valu user edit field manual request updat contextu read user context whilst edit deploi number hci techniqu note author tool optim util principl indirect mode oper featur discuss scope paper figur manual edit locat field note button retriev current gp knowledg locat context user record observ exploit visual collect note map figur background detail map data area time construct prototyp futur version incorpor map data gener figur show user current posit rel note note select note icon displai invok note automat load edit offer altern note select mechan simpl sequenti note list field trial prototyp data collect requir studi work carri period divid main observ note observ studi group individu behavior note templat construct common intens activ requir work make observ note automat entri locat time context note elimin oper estim posit difficult homogen comput telescop oper figur workload reduc extent singl complet task veget survei aim survei establish impact feed tree part reserv record inform note automat tag locat prove effect solut sampl sampl routin collect analysi order investig diet note record origin sampl automat provid locat context accompani descript state find figur record behavior addit autom element convent data collect process visual locat context provid function applic task map displai serv orient locat rel note observ pattern distribut major collect area reserv hardwar configur prove good design environ robust attribut equip effect harsh condit physic user make observ devic oper time pocket abil complet remov devic user awar essenti walk area inhabit rhino lion condit user forget comput system devot attent avoid undesir confront fail run fast occlud user simpli accept environ hazard set necessarili desir comput resourc transpar effect remov provid easili manner end trial approxim individu observ record prototyp state system record quicker easier prove success solut evalu prototyp prove contribut limit type time exploit gener capabl contextu contextu augment limit abil effect target area autom data transpar provid contextu inform visual collect observ whilst field deploi area kei factor greatli improv speed volum data provid opportun assess distribut observ whilst field capabl central system success gener prototyp enhanc add level suggest present categor type capabl contextu obviou improv add type context remot context emploi wireless commun queri remot gi meteorolog station obtain contextu data user current locat contextu adapt current capabl provid assist autom action context user prepar data collect strategi determin context sampl point advanc tool automat invok note user enter context contextu resourc discoveri limit set due gener lack infrastructur physic comput resourc possibl discov inform resourc biographi rhino discov anim radio contextu augment work date captur contextu inform form observ data field serv function environ augment varieti inform flood warn messag attach locat weather data past veget survei updat prototyp extend simpl data collect tool structur work access inform relev present situat knowledg area develop benefit advanc hardwar system support larger arrai devic digit magnet rang find wireless commun wearabl configur attempt prototyp context inform servic case studi demonstr modest hardwar contextu great benefit deriv true applic progress integr capabl wearabl comput comput environ wide arrai potenti applic numer applic framework sensor technolog locat context multitud technolog gp activ badg sheer exploit context plethora technolog work creat softwar interact varieti hardwar captur translat desir perform manipul comparison present user difficult timeconsum softwar develop task incorpor locat context prototyp softwar commun gp extract locat convert latitud longitud desir project locat data map displai applic incorpor face sensor devic context support prohibit larg develop overhead widespread adopt contextu capabl remedi situat begun work contextu inform servic servic maintain dynam model contextu provid common access medium current context wearabl comput aim ci offer common contextu model provid client contextu inform minim effort client part model context context subject concept defin entiti perceiv entiti conceiv context locat view tempor perspect emot state person context gener subset physic conceptu state interest entiti implement simpl contextu model form set state automat locat state updat time state updat intern contextu state exist inher specif object locat state attribut object simpl state assumpt made relat locat assum posit comput preclud possibl model state locat user locat colleagu reason ci model object state entiti call artifact ci model consist world artifact artifact turn consist set contextu state world person artifact locat state ci client access state artifact world add artifact ad artifact simpli matter select templat artifact give select person templat suitabl templat exist catalog consist set ad ci state catalog list gener state state format method translat set oper element visibl ad state catalog augment exist client simpli interest gener work locat latitud longitud specif monitor context model infrastructur connect real world sensor arrai arrai popul customiz set sensor sensor program extract contextu data connect hardwar devic extract locat gp program contextu data artifact state level context locat time contextu data sensor rout state artifact monitor monitor singl artifact oper qualiti servic direct locat accur meter monitor util sensor match qualiti servic switch sensor maintain qualiti servic monitor record histori sensor behavior optim perform minim frequenc check gp sensor whilst maintain qualiti servic provid simul valu temporari sensor failur user walk wood gp signal sensor simpli provid current contextu monitor decid valu perform simul state behavior person artifact locat updat lot frequent car artifact slower potenti rate chang relat context final element ci artifact relationship relationship consist anchor root set member explicit link explicitli defin infer link infer relationship offer addit contextu inform chang interpret exist person car expect locat state chang rapidli relationship creat select templat relationship catalog principl artifact option candid artifact type relationship call printer meter rang candid artifact type result group printer relat locat automat updat walk printer leav remov relationship printer approach includ relationship relationship work gener level appli state relationship equal appli temperatur gener characterist issu extens reusabl infinit number artifact state client observ ci address concern provid catalog augment requir model context client simpli select compon artifact world case kind reusabl client share interest part model produc optim model applic depend effici elimin redund duplic process program gener contextu capabl util wearabl system resourc augment select techniqu incorpor wearabl comput prototyp design assist observ prototyp prove success complet work shorter featur attribut critic part system success applic benefit similar wai complex obtain work contextu data util applic overview current work design implement contextu inform servic remedi situat ci encourag develop add featur softwar provid extens share model context transpar underli complex acknowledg peopl make trial special alan manchest metropolitan organ kathi equip studi refer comput ieee workshop mobil comput system tour prototyp mobil augment realiti system explor urban intern symposium wearabl comput octob rapid prototyp mobil cyberguid case acm intern confer mobil comput network novemb situat intern symposium wearabl comput octob global posit system exploit telecommun deliv real time transport iee intern confer road traffic inform forthcom comput scienc issu ubiquit commun gw situat inform space spatial awar palmtop commun comput environ project develop person technolog person submit public laboratori ieee person interact hci workshop human comput interact mobil unit enhanc realiti archaeolog van comput applic archaeolog forthcom activ badg locat acm transact inform mobil ieee person
Agents/1516 1 resourc ecient scalabl approach amin armin depart comput scienc north texa texa usa abstract mobil agent varieti applic agent mobil exploit implement scalabl system level solut network rout domain bene approach shortest path rout algorithm enjoi widespread commun network larg amount rout data exchang algorithm consum substanti make convent rout scheme scalabl rout overhead control control agent popul paper discuss characterist distanc vector rout present implement refer distanc vector rout rout protocol shift task rout mainten node principl calcul shortest path node primari goal provid scalabl resourc ecient rout solut larg commun network compar approach packet level simul discuss merit introduct rout import aspect network commun ect characterist network perform ecient rout mechan signi cantli complex due fact rout involv node deal link node perform drastic ect level network congest rout algorithm main select rout pair exchang protocol inform rout mainten task con ict characterist ecient rout select strategi higher rout resourc overhead resourc ecient exchang rout inform produc path introduc unwant delai rout process de ection rout scheme exchang minimum inform protocol produc optim rout scheme base distanc vector amin armin link state gener optim rout exchang larg number messag exist import low rout delai surpass requir low resourc overhead accept endur rout mainten overhead achiev optim rout contemporari network implement rout strategi base distanc vector rout link state rout amount overhead incur exchang rout messag express scalabl rout scheme scalabl properti system adapt size signi reduct perform convent implement dv ls class rout size network result number protocol messag overhead signi cantli hamper network reduc scalabl rapid develop network limit comput promot import lower resourc overhead incur rout algorithm rout protocol divid main tabl driven rout rout tabl driven rout scheme destin sequenc distanc vector rout wireless rout protocol attempt provid optim rout cost excess inform exchang rout scheme dynam sourc rout distanc vector rout reduc excess exchang protocol inform rout balanc rout approach achiev class hierarch rout hierarch rout scheme zone rout protocol achiev good exibl incorpor characterist tabl driven singl protocol exibl result consumpt substanti comput power individu node motiv simpl rout strategi optim rout reduc excess exchang protocol implement distanc vector rout develop implement approach refer distanc vector rout rout protocol shift task rout mainten node principl calcul shortest path node section describ rout mechan section explain simul environ di erent experi section show analysi rout algorithm section summari overview futur work resourc ecient scalabl rout distanc vector rout algorithm exchang metric repres distanc node destin distanc gener concept includ limit transmiss delai monetari cost resourc reserv send secur level reliabl measur implement inform exchang adjac node form trigger initi chang rout tabl neighbor node receiv updat inform neighbor node updat rout tabl manner adjac repres metric rout node node repres cost link node node node receiv neighbor comput integr rout tabl rout tabl propag chang turn perform algorithm updat rout tabl sequenc updat messag node entir network messag activ convent escal consum signi amount network number messag bound number constitu agent network exchang metric process rout discoveri move node agent rout discoveri manifest movement agent carri rout inform node propag individu updat messag agent formal agent id migrat node node carri rout tabl migrat strategi move adjac node subset rout tabl figur agent start arbitrari node migrat adjac node arriv node agent updat rout tabl base entri base perform frequent compar perform agent select migrat adjac node migrat strategi amin armin node agent make rout data carri node plai import role provid resourc ecient solut agent carri entir rout tabl incur excess overhead transfer redund data hand agent select subset total rout data unnecessarili delai propag import rout inform exibl adopt agent select rout data ect inher intellig acquir import agent execut book function node limit rout data carri minimum ect propag import rout data reduc amount inform propag agent refrain transfer complet rout tabl agent identifi rout tabl entri modi transfer neighbor entri xi rout tabl vector xi boolean ag neighbor node xi xi size xi size neighborhood node select neighbor current node agent carri entri xi xi agent copi entri xi transfer neighbor node data set boolean ag xi ag xi xi facilit robust fault ag xi xi expir time reset xi reset ag enabl node rout updat lost previou transmiss attempt node agent node xi fig select rout tabl entri agent select structur walk edg agent undirect edg connect node increment visit count xy edg xy time migrat resourc ecient scalabl rout node agent select adjac node connect edg minimum yz yi adjac multipl resolv random detail comparison di erent agent movement strategi found simul model analyz properti agent event driven simul construct simul base paradigm includ method singl agent network repres graph gener graph gener node graph repres router node limit bu er queue space process speed link connect node link capac implement rout inform protocol assum variabl size packet maximum byte packet consist byte header variabl payload entri rout tabl occupi byte payload packet characterist figur show simul model node input queue incom packet queu averag servic rate incom queue depend process rate router simul assum process rate rang packet node rout process inspect input queue rout process rout data packet output interfac maintain rout tabl outgo link output queue servic rate restrict transmiss rate link transmiss rate link transmiss time packet experi assum link capac give averag transmiss rate approxim packet clear major queu occur output queue due slow servic rate figur show simul model addit modul agent manag execut agent relat function framework agent popul rout mainten function agent relat packet forward agent manag modul queu agent queue agent activ agent manag modul receiv respect data agent queue updat rout tabl complet agent transmit modul node rout process rout incom packet interfac rout tabl maintain agent amin armin rout tabl process rout input queue node output queue input link output link simul model output queue agent modul agent agent process rout input queue rout tabl agent queue input link node output link simul model fig experi result experi discuss section conduct underli assumpt analysi cover perform network converg rout tabl assum stabl edg node ad delet result experi address link node failur scope paper discuss agent popul assum static experi conduct medium size node network averag nal result repres multipl seed random graph perform analysi base comparison simul chang rout tabl individu node broadcast neighbor entir rout tabl node broadcast period neighbor sequenc event occur asynchron high parallel make highli reactiv small chang singl rout tabl cascad ect initi sequenc broadcast aggress parallel result burst updat messag network messag contribut rout discoveri process messag improv exist wast network resourc implement control parallel number agent network replic behavior rout inform gener propag neighbor approach restrict rout packet due small number concurr rout messag network implement function time network size number concurr rout messag xed equal number constitu agent figur displai cumul rout data exchang node network resourc ecient scalabl rout gener larg number messag initi ow natur smooth distribut messag time import factor rout low resourc commun network larger agent popul improv converg resourc overhead mention scalabl properti system adapt size signi reduct perform base de figur show highli scalabl algorithm respect resourc ecienc network size produc rout load high volum rout data sever degrad perform larg network implement characterist restrict larg network exhibit scalabl characterist rout load bound number agent system rout trac control network manag control number agent implement properti make suit larg network data time agent agent agent rout data exchang network data time node network node network node network node network node network node network rout load di erent network size fig control parallel reduc sensit exhibit slow converg compar figur show total converg algorithm demonstr reactiv faster converg agent displai compar perform observ perform improv ad agent excess number agent incur addit overhead network defeat approach agent popul manual manipul network manag amin armin dynam agent access inform network environ dynam agent popul extrem import aspect dynam network implement discuss scope paper rout discoveri plai import role network perform respect fault toler crucial evalu rout algorithm respect speed node network obtain rout node network rout provid mean measur time network oper user applic figur depict number node acquir complet connect node network time observ aggress parallel burst broadcast messag facilit quick assimil network connect intens broadcast queu delai su er messag slow propag explain rapid initi connect gradual rate connect establish agent ecient migrat strategi forc unvisit path result steadi rate acquir connect converg time agent agent agent total converg node connect time agent agent agent rout discoveri fig simul model assum agent constitut byte packet agent size import factor intellig agent highli intellig agent logic occupi code control paramet result larger size figur demonstr behavior di erent size agent agent reduc rout load reduct rout data reduc intellig ect converg pattern strike optim balanc agent intellig agent size separ area research scope paper rout resourc ecient scalabl rout load reduc rout tabl select mechan implement agent section ongo research distanc vector rout scheme base mobil agent paradigm major disadvantag convent implement distanc vector rout algorithm resourc overhead gener unbound overhead due updat messag size network messag replac popul agent messag activ bound number constitu agent limit number agent order control resourc concurr algorithm emploi restrict conduct number experi analyz perform distanc vector rout scheme rout converg connect compar result time byte agent byte agent byte agent fig comparison agent size show reduct resourc improv scalabl observ converg pattern compar outperform larg number agent prove success candid network requir low overhead loss perform ongo research overcom limit current experi simul model enhanc introduc dynam model capabl handl node link failur handl transmiss error issu dynam agent popul agent intellig discuss scope paper futur public amin armin refer distanc vector rout intern august bertseka data network mobil agent network manag iee commun softwar agent aaai menlo mit press product speci cation cisco seri internet router simul base perform evalu ad hoc network rout protocol mobil network applic juli page understand code mobil ieee softwar engin haa zone rout protocol ad hoc network mobil network work august rout inform protocol rfc june dynam sourc rout ad hoc wireless network mobil editor imielinski hank comput top approach featur internet rout rout commun page prentic wong approach simul larg commun network journal system volum agent base wave control resourc demand intern workshop internet comput june kramer cooper mobil agent map network hungarian nation confer agent base kramer cooper mobil agent dynam network rout softwar agent futur commun isbn motwani random algorithm cambridg jj ecient rout protocol wireless network acm mobil network applic packet product speci cation rout switch ad hoc network addison highli dynam rout mobil comput acm confer commun protocol distanc vector rout ietf juli
ML/1517 6 bivari margin distribut algorithm martin pelikan heinz dept technic gmd forschungszentrum sankt evolutionari margin depend problem abstract paper deal bivari margin distribut algorithm extens univari margin distribut algorithm pair gene depend order improv algorithm simpl univari margin distribut special case factor distribut problem speci knowledg initi stage depend discov optim process paper detail compar di erent algorithm includ simpl genet algorithm di erent crossov method tness function relat problem size number tness evalu converg shown introduct genet algorithm work popul string xed length paper binari string consid current popul string select string gener oper mutat recombin oper combin inform string mutat perform small perturb string order popul introduc inform theori oper base schema theorem oper disrupt schemata larg de ning length bad perform genet algorithm problem schemata obtain optimum lead approach recombin rst line research di erent reorder method method de ning length import schemata valu bit di erent posit thing optim classic genet algorithm order bit featur optim method work problem requir prior knowledg problem memori time consum direct lead express messi genet line research base estim probabl distribut simplest estim distribut univari margin frequenc set select parent margin distribut base algorithm work perfect linear problem shown work problem dont signi depend perform estim varianc decomposit greater rate addit varianc sum higher order perform problem depend di erent gene approach theori extend problem probabl model fda distribut assum probabl written product margin frequenc ideal schema import schemata disrupt pragmat extend bivari margin distribut mimic algorithm distribut assum simpl product bit order chain simpl greedi algorithm rst input univari bivari margin frequenc set select parent rst bit gener univari margin frequenc bit gener condit probabl previou bit present tree structur probabl model tree construct maxim sum mutual inform gene connect bit root tree gener univari frequenc remain bit gener condit probabl parent depend tree univari bivari frequenc calcul increment approach combin method mutual inform depend measur replac pearson order identifi pair independ probabl pair map depend graph algorithm section algorithm term de ned chromosom de ned binari string xed easili reformul nite alphabet rst posit string refer posit paper make equat simpler margin frequenc pearson statist denot length chromosom set binari string length size denot posit posit de ne univari margin frequenc set frequenc string ith posit set posit valu posit de ne bivari margin frequenc set frequenc string posit term probabl frequenc univari bivari margin condit probabl ith posit jth posit calcul jx pearson statist de ned expect pair observ quantiti number pair valu posit posit number pair valu easili calcul basic probabl theori expect quantiti term univari bivari frequenc total number point posit np np posit independ pearson statist inequ hold construct depend graph section construct depend graph graph de ned set set edg set vertex connect compon depend graph node correspond posit string correspond vertic posit string set vertic vertex correspond ith posit clear construct depend graph connect mean form tree depend graph acycl set tree mutual connect gener string depend number connect compon depend graph talk frequenc set creation depend graph descript algorithm meant denot set vertic process start algorithm set edg ad smaller algorithm end equal empti set mean vertic process set denot set pair independ equat algorithm construct depend tree de ned algorithm construct depend graph set set set vertex add remov vertic set nish depend set vertex maxim add edg set edg basic idea algorithm simpl similar algorithm obtain largest span tree arbitrari vertex ad graph vertex greatest depend ad vertic edg depend ad graph step repeat depend ad vertic rest arbitrari vertex ad graph process repeat process repeat vertic ad graph ect acycl graph maxim sum statist valu connect vertic construct result graph mention rst vertex compon success creat ad vertic ad ad set set special compon result set initi nite set vertic cycl vertex remov algorithm nish ned time complex algorithm gener individu gener depend graph individu valu posit gener univari margin frequenc exist posit gener connect gener posit set edg gener condit probabl equat posit posit step repeat valu posit gener descript algorithm gener import set de ning graph denot stand set posit gener individu string length denot ith bit denot algorithm gener individu set gener univari set probabl set nish exist connect graph gener condit probabl set probabl remov set set initi nite set cycl vertex remov connect vertex gener rst algorithm ned gener individu step gener di erent individu independ algorithm gener individu suit parallel bivari margin distribut algorithm de ned algorithm construct depend graph gener bivari margin distribut algorithm popul randomli gener rst individu select univari bivari margin frequenc individu calcul depend graph construct section depend individu gener section individu ad popul individu origin select replac worst number individu popul remain constant individu select start select individu end ad individu repeat termin criteria met termin criteria algorithm stop found optimum popul low optimum unknown condit import low individu popul mean inform popul creat individu problem found bivari margin distribut algorithm set randomli gener initi popul select parent calcul univari frequenc bivari frequenc select set creat depend graph frequenc gener set individu depend graph frequenc replac individu individu set termin criteria termin criterion due lack de ned univari frequenc closer algorithm termin algorithm termin criterion probabl model nr jx return vertex connect vertex ad sooner vertex algorithm construct depend graph section vertex ith vertex correspond compon vertex locat factor special case factor consid work distribut base condit probabl pair posit depend inform estim current popul string binari function xn function order higher order talk function order rst class depend graph construct fairli easili connect vertic equal graph construct acycl graph acycl achiev delet serv depend graph gener individu found depend graph gener perform perform linear function perform reli detect depend knowledg initi stage empir part paper shown depend found gener mention graph acycl properti sati ed delet signi cantli unimport depend problem imposs solv model problem possibl solv term condit independ condit probabl posit posit valu set posit account problem approach mention knowledg problem solv learn structur problem inform depend unclear pair posit independ approxim gradual accur ectiv method predict complex model tness function model simpler correct model serv case demonstr good perform nonlinear problem choic accur model simpl model univari margin distribut charact class algorithm complex predict model due amount inform problem problem optim function addit order tness distribut cover model model close origin distribut discoveri higher order depend signi cantli time space complex hard worthi follow enlarg block account lack inform problem predict complex model depend fda experi show perform problem higher order depend higher order depend substitut depend structur model experi experi di erent tness function choic tness function make behavior algorithm clear comparison method main section explan behavior size paper account algorithm possibl compet solv problem problem decomposit problem shown make thing clear experi order paramet measur converg order paramet de ned vector univari margin frequenc closer paramet popul tness function permut variabl permut denot ng permut ned divid de ned mod ident permut chang order posit string show behavior di erent algorithm respect permut experi xed select method select half popul replac individu tness function tness function simpl linear function singl bit equal mean sum bit ith posit string tness function permut input paramet permut bit input string function order basic form mean give good result function shown work class problem small popul size converg optimum complex distribut make correct depend present problem discov popul size enlarg set paramet chosen make converg optimum total independ run algorithm termin criterion shown figur converg slower simpl genet algorithm uniform crossov statist method discov depend requir enlarg popul bit independ inform perform ga uniform crossov great crossov rate perform similar perform linear problem genet algorithm crossov depend neighbor bit disadvantag linear problem figur averag number tness evalu converg independ run shown figur evolut order paramet randomli chosen run shown quadrat function quadrat tness function comparison section de ned quadrat size problem figur number tness evalu rang popul size ga ga truncat select number function evalu figur order paramet popul size truncat select de ned argument equal di erent argument argument equal optimum string posit criteria converg requir converg independ run choic optim paramet algorithm section comparison perform method averag number function evalu converg run account function decept hard optimum simpl ga ideal function order de depend form cycl quadrat permut discuss experi shown function big problem solv simpl perform ga crossov number tness evalu grow faster size problem figur ga uniform crossov perform signi cantli ga crossov figur notic number tness evalu bad perform ga similar tness valu lead schemata opposit fact disrupt signi cantli tness gure averag number tness evalu converg independ run shown permut comparison spread pair posit distanc half size string reorder bit di erent ect di erent algorithm ect algorithm independ posit bit simpl ga uniform crossov situat analog problem simpl ga crossov algorithm perform poorli problem size ga crossov requir time tness evalu gap enlarg size problem result simpl ga uniform crossov slightli di erent result permut decept function order decept function comparison di erent optim method decept decept averag tness low order schemata present optimum lower averag tness altern properti make class function hard solv simpl genet algorithm evolutionari algorithm algorithm base superior posit low order schemata match optimum tness function de ned bit permut order de ned size problem figur number tness evalu quadrat rang popul size ga truncat select di erent order permut equat oper mix posit bit string neighbor bit posit distanc length chromosom problem permut depend distribut wide import schemata greater de ning length origin result problem size shown tabl tabl number tness evalu popul size permut ga permut popul size ga permut ga permut achiev converg popul larger lower bound number tness evalu truncat select tness eval tness eval ga ga size problem figur number tness evalu quadrat rang popul size ga ga truncat select nk tness function import input paramet nk tness function length input string number neighbor account function posit string chosen posit random fashion group length posit group denot fp ith group group randomli gener combin valu posit mean ith gener valu denot function return gener combin valu fx posit ith group matrix posit vector function gener initi tness function de ned neighbor pick random make permut reorder posit nk tness function order random gener neighbor valu reduc chanc case small di erent matrix vector function gener rst gener set paramet result algorithm present tabl optimum found number optim algorithm requir converg number problem space explor algorithm popul larg real optimum optimum found number found optimum di erent chang comparison result tabl number tness evalu popul size ga ga popul size ga ga truncat select ga ga linear quadrat work explain probabilist distribut base pair depend gener individu linear problem ga uniform crossov perform ga crossov perform similarli converg slow discov probabilist model optim rst quadrat perform compar algorithm ga crossov perform algorithm fail de ning length import schemata enlarg di erent order bit string experi shown gap algorithm quadrat function larg di erenc algorithm linear function context problem problem depend higher order class model search space approxim decept tness function order converg slower ga crossov ga uniform crossov converg mislead case huge popul size import length schemata ga crossov perform poor huge popul size number tness evalu perform remain result quadrat evid ga crossov ectiv discov schemata larg de ning length work short build block uniform crossov independ length schemata disrupt depend disrupt depend account depend order independ length schemata disrupt depend order disrupt depend higher order depend higher order substitut structur depend order solut problem factor distribut algorithm requir problem speci knowledg initi stage requir ga fda perform problem acknowledg author depart mathemat technic german nation center inform technolog technic support project martin pelikan stai gmd support academ program foreign special vladimir comment prepar complet paper refer goldberg genet algorithm machin learn ma kargupta gene express messi genet algorithm ieee intern confer evolutionari comput pp equat select predict evolutionari comput rodriguez distribut graphic model evolutionari submit public de bonet ch viola find optima estim probabl densiti mozer jordan petsch advanc neural inform process system mit cambridg baluja davi optim combinatori learn structur search space report number carnegi mellon pa nonparametr method social scienc publish ca pelikan hill climb learn abstract genet neural network world baluja increment method integr genet search base function optim competit learn report number carnegi mellon pa man origin select evolut oxford ny
HCI/1518 4 ware tog info net vi june evalu stereo motion cue visual inform net dimens colin ware faculti comput scienc brunswick po box nb submit acm transact graphic brunswick technic document februari brunswick ware tog info net vi june evalu stereo motion cue visual inform net dimens colin ware faculti comput scienc brunswick po box nb abstract paper concern benefit present abstract data experi show motion cue combin stereo view substanti size graph perceiv experi design provid quantit measur understood displai configur imag monitor coupl user actual ey posit updat user stereo effect local displai locat vicin comput monitor result studi show stereo view size abstract graph understood factor stereo provid factor head coupl produc factor experi examin varieti motion cue provid head coupl perspect virtual realiti hand guid motion automat rotat stereo result show structur motion stereo view kind motion improv stereo cue result provid strong reason advanc graphic interact larg varieti inform structur kei word virtual inform network visual introduct interest method examin structur coupl perspect stereoscop view scene user ey posit updat view realtim user move kei element high resolut monitor capabl run high frame stereo glass method track user head posit figur posit user ey comput head posit separ imag gener show correct perspect view set virtual object vicin monitor screen result local environ number advantag virtual realiti everydai workspac file mug ware tog info net vi june exclud previou work call tank local natur distinguish full vr advantag fish tank vr convent object fairli obviou industri design design telephon mechan engin part insert real thing abstract data base network human structur code hypertext mean clear diagram offer advantag repres kind inform present paper strong evid diagram offer advantag view condit present evid review evid advanc view techniqu view inform network discuss type anecdot dimens visual discuss term visual space everydai perceiv area ignor dimens color textur naiv move displai vastli amount inform repres comput displai line perceiv distinct plane perceiv distinct pixel extend logic displai distinct voxel volum relat succinctli express equat repres inform perceiv displai flaw gener perceiv volum perceiv detail insid layout surfac space place upper bound amount inform repres space naiv view argu stereo view base input ey doubl amount inform effect binocular independ imag ey perceiv fact extract depth inform highli correl inform present ey altern pessimist view express equat constant correl view suggest move yield small benefit understand abstract data view correct worthwhil abstract network view equal effect simpler produc view base ecolog argument evolv inform present process easili visual system ware tog info net vi june network inform inher geometr brain prefer layout layout effect convei inform brain capabl integr inform sequenc view world obtain move amount inform view highli correl displai simpli perspect stereo perspect pictur requir imag accur actual viewpoint observ move larg part space percept rel movement import interpret spatial head result motion parallax object rotat give kinet depth effect movement brain integr spatial inform stereo displai view understand scene rel movement head object continuum stereo glass virtual graph head track figur prefer method visual complex network inform head coupl stereo view result virtual view network vicin monitor anecdot evid grow evid repres diagram complex inform comprehend influenti work project user visual larg knowledg base node arc space attempt made quantifi advantag mode view layout current interest abstract data visual trace studi cone tree techniqu develop robertson al capac show tree structur data convent layout cone tree children node displai base cone space principl ware tog info net vi june appli author claim thousand node cone tree visual clutter cone tree requir user manipul access inform side argument layout scheme claim amount inform empir evid relev displai inform network work shown number error detect path tree structur substanti reduc displai method milgram show scene rotat reduc error path trace task motion condit stimulu pattern rock back vertic axi perspect imageri coupl head found motion valuabl reduc error subject requir discov tree root highlight leaf node attach similar experi ware al similar task head coupl stereo displai perspect view coupl measur ey posit observ ware al displai motion head result similar obtain milgram geometr transform imag occur head coupl scene rotat similar reason visual mechan involv case construct interpret world simpl model integr depth cue weight addit model brain comput weight sum inform determin depth perceiv milgram found data suggest relationship depth percept percent correct path trace task made clear data ware al reserv link model data appli experi result lower error ceil effect undoubtedli present motiv studi number unansw question pose studi fundament question gain move complet gener answer question expect answer extent task answer deriv abstract task path trace network node arc gener larg set problem repres profound question relat issu depth inform cue integr brain measur task perform seri graph size view condit determin function relat error rate graph size condit function belong famili model relationship question result milgram ware al gener arbitrari graph tree import tree layout understood process trivial lai pair tree plane overlap visual problem pose previou studi easili solv resort displai case arbitrari graph layout problem difficult advantag visual pronounc work layout direct ware tog info net vi june graph direct minim arc algorithm complex visual extent reduc graph cross problem arc longer plane screen question kind motion perceiv structur inform motion induc perspect coupl ey automat rotat motion link user hand movement object milgram ware al show advantag motion inform percept kind motion scene rotat case kinet depth head motion motion note motion viewpoint produc similar transform rotat scene vertic axi center scene lead hypothesi kind structur transform contribut space percept similar wai enhanc network activ search view mode critic understand condit user control view scene experi design address experi design supplement yield incomplet answer experi design address question experi displai path trace experi provid quantit estim improv graph understand offer ad head coupl stereo dispar cue displai chose path trace graph graph gener data structur inform network chose error rate depend variabl previou studi shown highli sensit mode view abil trace inform path accur fundament understand inform network answer form head coupl stereo size graph understood factor order make evalu design experi rang graph size hope data yield famili curv rate function graph valid comparison view condit view condit initi graph project plane orthograph project remov axi depth inform present head coupl correct perspect view gener ey posit apparatu shown figur perspect continu updat base measur head posit deriv ey subject hardwar ware tog info net vi june equip experi consist corpor lcd shutter glass provid corpor ultrason built frame glass comput produc displai silicon graphic stereo mode system top bottom half frame buffer left imag imag vertic expand repeat line displai time result half vertic resolut line drawn doubl thick vertic direct featur stereo mode monitor run ey receiv updat rate synchron shutter glass figur show wear vr lcd glass triangl top monitor refer sound sourc microphon frame glass figur insert slide imag figur setup procedur subject task decid path length connect node highlight randomli laid graph trial path length interven node highlight probabl occur comput gener graph consist number arrang simul cm volum shown figur node divid group group leaf group intermedi node node leaf group connect arc node intermedi group produc total connect arc node randomli work volum node drawn dark grai highlight bright light appli node effect size node set centimet side arc white drawn line arc drawn line perspect size affect appar size line due artifact section vertic thick doubl horizont thick background flat light grai minim contrast ghost effect stereo screen imag shown figur stereo pair illustr figur figur insert slide imag figur photograph show graph node arc displai monitor condit node color red subject task determin path length red node ware tog info net vi june figur stimulu pattern consist set node arc laid volum render varieti stereo head coupl perspect stereo pair line draw simul screen displai node arc imag set cross ey view invert view stereo view devic ey parallel requir graph size view condit graph result combin examin separ set trial subject give total trial condit graph remain trial trial pair node highlight highlight node connect randomli determin subject experi divid session administ separ dai complet set condit order dai begin experi subject short present trial complex middl condit prior block trial subject told condit expect trial subject time requir respond press button time valid record due graph high number polygon draw complex updat rate reduc updat condit scene frame buffer time video refresh rate hz hz subject stereo glass condit requir order avoid effect relat sole reduc lumin glass eleven subject part similar apparatu graphic system ware tog info net vi june error number node stereo head coupl perspect figur error rate data experi vertic bar repres standard error result discuss experi result experi summar figur error head coupl stereo condit dramat reduc compar obtain condit analysi varianc reveal highli main interact number node result reflect larg differ error rate error due graph fact error curv flat compar time data summar figur analysi varianc data reveal main effect number effect condit interact time graph data suggest import determin time number node problem experi result show greater advantag view assum condit node yield larg error rate error rate low rang graph size test order make ware tog info net vi june estim rel advantag larger graph condit experi design remedi defici defer interpret result present experi time number node stereo head coupl perspect figur time data experi vertic bar repres standard error experi base result experi redesign experi rang graph complex condit ad condit answer question rel benefit head coupl stereo condit condit condit experi graph project plane orthograph project remov axi overlap inform stereo condit made pair lcd shutter glass provid dispar depth cue head coupl scene perspect project chang continu subject measur head perspect project defin singl viewpoint center ey head coupl stereo correct view gener ey posit ware tog info net vi june number node condit obtain number arc multipli procedur experi respect ident experi number trial combin reduc session time manag size experi involv similar environ person experi part experi result discuss experi figur summar error data data experi includ comparison show sequenc curv vari gradient roughli multipli respect graph size error rate directli proport number gradient condit error number node stereo perspect head coupl perspect stereo head coupl perspect stereo head coupl perspect ware tog info net vi june figur error data experi vertic bar repres standard error broad straight line repres simpl model text determin model famili ran seri polynomi regress independ curv found paramet form error number node account varianc paramet fit account varianc comparison condit view success paramet model decid adopt reason approxim data line condit multipl advantag direct comparison condit result fit shown broad line figur coeffici paramet fit condit coeffici stereo perspect head coupl perspect head coupl perspect basi conclud graph understood head coupl stereo time larg graph error rate ratio ad stereo graph size approxim factor ad head coupl graph size factor test differ divid subject mean number node condit remov covari due number node conduct varianc result reveal condit significantli condit condit condit condit condit condit differ larg safe assum transit conclud condit respect error rate averag time complet data summar figur complet time depend number node arc graph view mode shown experi evid asymptot view mode time approxim node curv level part curv suggest time process data depend number asymptot repres amount time subject feel extract usefulli data asymptot lower view graph sooner view mode found fit data function logarithm number time log function repres broad line shown figur ware tog info net vi june number node stereo perspect head coupl perspect stereo head coupl perspect stereo head coupl perspect figur time complet data experi vertic bar repres standard error broad curv repres approxim function text experi view experi provid compel evid applic head coupl stereo greater inform previou work introduct kind rotat enhanc tree structur issu rel merit view rotat mode data visual condit experi includ experi addit condit rotat ad hand motion condit rotat happen automat complet set includ condit static perspect view overlap size perspect inform order experi manag length singl graph size condit method eighteen trial conduct condit node arc trial method experi eleven subject subject ware tog info net vi june exposur similar particip involv experi condit graph project plane orthograph project remov axi overlap inform static essenti task graph displai perspect project depth cue rel size condit perspect project condit made pair lcd shutter glass provid dispar depth cue passiv scene rotat constant angular veloc vertic axi passiv stereo hand hand movement rotat scene vertic movement subject rotat scene horizont axi movement restrict vertic axi tilt horizont hand stereo head coupl scene project chang continu subject head perspect project defin singl viewpoint center ey head coupl stereo correct view gener ey posit fish tank vr result experi result summar figur main differ condit found error rate rang high condit low stereo hand coupl condit appli combin condit result tabl result larg number treat caution statist differ posit condit gave significantli higher error rate condit differ significantli find stereo condit motion stereo condit motion stereo hand rotat condit significantli condit rotat condit head rotat condit significantli stereo rotat condit ware tog info net vi june data confirm combin stereo motion effect error suggest method produc motion import differ found combin stereo motion condit averag motion condit averag stereo condit find experi motion stereo differ rotat stereo condit reach statist worth point data involv comparison made experi account discrep figur result experi small differ time condit larg differ error rate vertic bar repres standard error ware tog info net vi june tabl error rate comparison perspect stereo pass stereo pass hand stereo hand head stereo head time uniform condit fact time approxim consist data experi number node fix tabl time comparison perspect stereo pass stereo pass hand stereo hand head stereo head multipl reveal differ hand head motion condit slower condit differ stereo head coupl condit slower stereo passiv rotat condit major contribut paper provid quantit estim benefit stereo view motion parallax perceiv inform net result prepar theoret view outlin introduct correct ad view minim benefit abstract data visual task factor improv measur head coupl stereo provid strong encourag develop applic view inform manag system result suggest effort make rotat stereo view includ data present static perspect imag add comparison diagram ad real time rotat import ad stereo structur motion stereo requir minimum ten screen updat ware tog info net vi june durat stereo pair requir comput imag practic experi varieti method introduc structur motion type motion depend applic select object import automat rotat desir select move object difficult head coupl select motor control system visual guid hand placement evolv work conjunct simultan head motion theoret issu addit depth cue find slight cue stereo motion improv stereo improv head coupl add improv obtain previou result milgram make observ find hard simpl model account complex space percept altern interpret result reli space percept pattern inher ambigu pattern path resolv due overlap network node arc argu main advantag view simpli fact motion resolut ambigu arc destin mechan made node displai move random work simpl motion resolv pattern abstract data interest possibl detract practic util find penalti head coupl view number subject state found view graph head coupl stereo mode stress part due difficulti task perceiv path node arc easi suspect improv technolog head track system briefli frozen imag unix system function irrit head coupl view mode adopt virtual realiti metaphor brain expect visual world feel problem improv head track displai technolog solv acknowledg primari sourc support research nserc canada strateg grant grate arthur ibm toronto lab encourag support assist provid code analysi tool tim bell northern research provid initi impetu start project ongo enthusiast support refer ks evalu human perform virtual realiti acm transact inform ml depth percept motion academ press je percept layout journal ware tog info net vi june gg jd inform inform workspac high resolut virtual realiti comput draw direct graph ieee workshop visual languag se gw graphic larg knowledg base cognit scienc applic interact ed raymond lawrenc erlbaum jj ow flock motion parallax determin perceiv depth journal psycholog role spatial dimens softwar visual acm transact inform lc select attent control binocular percept lai visual larg tree hyperbol space acm symposium user interfac softwar marina del rei ca program ieee workshop visual languag displai correl point size point color graphic interfac experi graphic interfac binari relat interact dg al object detect configur enhanc percept jd cone anim visual hierarch inform rl compar studi rotat stereoscop comput graphic depth cue human factor societi annual rl effect stereoscop rotat displai task human ks virtual realiti technic paper visual object orient softwar dimens ibm canada nrc octob
ML/1519 6 individu learn coordin knowledg sandip sen sekaran depart mathemat comput scienc south colleg avenu abstract social human inhabit world multipl activ coordin activ agent share proper coordin interf plan coordin scheme agent effect achiev local goal affect capabl agent research field distribut artifici intellig develop varieti coordin scheme assumpt agent capabl relationship research motiv human cognit approach engin problem design effect coordin architectur protocol evalu individu concurr learn autonom agent mean acquir coordin knowledg show uniform reinforc learn algorithm suffic coordin mechan cooper adversari situat number multiag learn scenario tight coupl agent delai demonstr agent consist develop effect polici coordin action explicit inform share demonstr viabil algorithm genet algorithm base classifi system payoff bucket algorithm profit share plan develop agent coordin domain show scheme action select prefer tradit fit select scheme classifi system introduct primari goal research artifici intellig commun develop autonom agent knowledg cogniz carri routin activ perform human extrem difficult decad research relat area serv highlight complex magnitud research develop interest result crucial area knowledg cooper problem solv equal import analyz experi result subfield benefit develop ai long advanc field demonstr noteworthi advanc ai effect subfield provid agent knowledg requir solv difficult problem appli recent research develop reinforc learn literatur coordin problem multiag system reinforc learn agent action base receiv scalar feedback base past expect develop map percept action maxim feedback multiag system type distribut ai system autonom intellig agent inhabit world global control global consist knowledg contrast cooper problem solver agent multiag system resourc capabl possess agent coordin activ achiev local goal benefit receiv inform plan send inform influenc previou research develop agent coordin mechan offlin design agent behavior negoti recogn agent oper dynam environ flexibl adapt chang demand opportun individu agent forc engag agent vari lifespan effect util opportun present avoid agent learn agent adapt local behavior base group composit dynam machin learn multiag learn problem violat stationari environ assumpt machin learn system multipl agent learn feedback receiv agent action vari stationari environ assumpt current machin learn system rapidli chang environ discuss reinforc learn techniqu develop polici optim map percept multipl agent learn coordin strategi reli share inform agent work common unawar capabl agent cogniz goal achiev show repeat agent develop polici maxim feedback interpret goal achiev viewpoint extern observ demonstr domain agent develop polici complement evalu applic reinforc learn scheme enabl multiag chose investig number multiag domain vari characterist design environ characterist agent domain action agent strongli frequent affect plan agent coupl domain action agent weakli infrequ affect plan agent coupl agent agent multiag system kind mutual ffl act group solv common problem ffl preset disposit interact common resourc ffl interest discuss group class domain domain feedback agent knowledg effect feedback action period delai optim behavior behavior combin particip agent optim solv task vari infinit domain paper concentr domain agent domain inform capabl goal agent assumpt make coordin problem hard evid fact coordin mechan reli heavili domain knowledg share inform agent goal work replac develop coordin complement provid coordin techniqu domain scheme effect domain agent provid difficult challeng coordin scheme content problem solv perform feedback receiv environ effect reinforc base learn agent circumv lack common knowledg verifi intuit decid investig reinforc learn algorithm develop watkin classifi system method develop holland algorithm inspir theori dynam program classifi system interest blend reason comput inspir natur genet classifi system gener reinforc learn framework achiev agent coordin multiag system research open dimens construct coordin strategi multiag system differ work recent public area multiag learn research previou learn techniqu coordin multipl agent reli prior knowledg cooper domain unrestrict inform share percentag research concentr cooper learn commun agent agent share knowledg experi provost prasad research commun aid agent group jointli decid action isol instanc research mal explicit commun concentr domain sandholm strongli learn coordin polici commun role plai competit cooper domain argument fact commun invalu tool agent group coordin activ time commun effect mechan coordin behavior commun aid group coordin behavior detract problem solv activ carefulli control agent overli commun sever affect qualiti commun commun incorrect mislead time commun riski fatal combat situat adversari intercept commun commun feasibl prudent agent predict behavior agent past possibl adjust plan share resourc explicitli arriv contract commun consum valuabl time perform contract arriv commun possibl effect problem solv activ involv hard strive realiz maximum potenti system commun commun ad augment perform system desir effici level design philosophi lead system agent flood commun channel inform agent shift maze useless data locat inform goal mind investig acquir coordin strategi share inform sen expand bodi work explor advantag limit learn commun mean gener coordin behavior autonom agent rest paper organ section present highlight previou approach develop coordin strategi autonom section categor multiag system identifi learn scenario present sampl prior multiag learn section review reinforc learn techniqu util section present result experi genet algorithm base reinforc learn system block robot resourc share domain section summar lesson learnt research outlin futur research direct coordin multipl agent world inhabit multipl coordin kei group individu success coordin action share coordin action base expect action coordin essenti adversari agent comput interest develop comput mechan domain independ robust presenc inform research area multiag system produc techniqu multipl share common coordin action individu ration action affect system effici gasser coordin problem irrespect selfish kei issu design effect multiag system search domainindepend coordin mechan yield class coordin scheme influenti class coordin mechan develop date ffl protocol base contract ffl distribut search formal yokoo ffl organiz social law march ffl plan ffl game theoret negoti gmytrasiewicz zlotkin ffl linguist approach work architectur protocol design shoham coordin acquir coordin knowledg gmytrasiewicz coordin scheme develop date assum explicit implicit share inform explicit form inform agent commun partial result speech act resourc avail agent facilit process coordin implicit form inform agent knowledg capabl agent genesereth zlotkin aid local approach benefit agent depend share flexibl arriv coordin adapt chang environ flexibl adapt kei aspect intellig autonom interest investig mechan agent acquir coordin knowledg interact environ includ reli share inform argu coordin strategi quickli inadequ system design model world environ agent situat chang dynam coordin strategi incorpor learn adapt compon robust effect realist scenario agent advantag opportun deal present environ foreseen design time learn multiag system highlight learn opportun inher multiag develop categor multiag problem natur learn mechan problem categor present tabl meant definit taxonomi field dimens taxonomi agent relationship commun explicitli commun cooper domain categor domain base author dimens necessarili complet share make feasibl explicit commun term cooper relationship refer situat multipl agent work common goal local subgoal common goal subgoal number domain fall spectrum includ competit scenario agent gain agent scenario agent coordin avoid conflict mention share learn group cooper agent receiv attent mal literatur prasad agent learn individu commun share pertin inform provost learn cooper explicit inform share base primarili feedback observ agent action research investig approach learn explicit commun treat oppon part environ explicit model learn explicit competitor model sandholm work date learn compet explicit commun scenario investig area includ learn strength weak competitor intercept probe oppon gather inform prefer previou work reinforc learn coordin multipl agent reli explicit inform share concentr system agent share knowledg show agent independ reinforc learn techniqu optim global coordin multipl agent emerg explicit implicit inform share agent act independ affect commun delai agent failur kei agent control inform exchang worri reliabl inform receiv inform commun agent result system robust schaerf al studi reinforc learn base agent load balanc distribut system histori past perform make inform choic resourc submit job parker studi emerg coordin simul robot group simpl adapt scheme alter robot motiv major differ work simul robot work build explicit model robot research reinforc learn develop effect group physic robot matar concentr intermedi feedback subgoal fulfil learn contrast evalu learn effect vari interact agent focu work work stein involv reinforc learn techniqu evolv effect commun protocol cooper robot complementari approach learn coordin absenc commun agent view learn scalar feedback receiv environ prevent result directli field learn automata recent work theoret issu multiag reinforc learn produc framework investig problem address paper reinforc learn reinforc learn problem kaelbl reactiv adapt agent descript current state action set action maxim scalar reinforc feedback receiv action learner environ model discret finit markov process repres ri probabl move state perform action scalar reward function agent maintain map current state desir perform state expect discount sum futur reward polici state fl def ef fl random variabl reward receiv learn agent time step start polici state fl discount rate fl reinforc learn strategi agent develop polici maxim reward accumul time evalu classifi system paradigm multiag reinforc compar qlearn design find polici maxim fl state polici repres estim discount reward pair valu defin fl fl denot event sequenc action current action base polici perform state chosen expect maxim fl max fl action state produc reinforc transit state modifi fi fl max updat rule similar holland algorithm classifi system sutton learn scheme similar classifi system analyz classifi system rule base system learn adjust rule strength feedback discov rule genet algorithm simplifi classifi system messag action pair explicitli store classifi condit action assumpt similar made dorigo notat describ classifi condit action part classifi strength classifi time step describ classifi system perform discuss feedback distribut bucket algorithm profit share plan classifi initi default strength time step problem input messag receiv environ match classifi rule form classifi chosen fire base feedback receiv environ strength classifi rule adjust cycl repeat number time step seri cycl constitut trial classifi system classifi chosen strength feedback fraction ff strength remov ad strength classifi fire time cycl classifi fire time step produc extern feedback classifi fire time equat strength updat classifi ff describ profit share plan scheme classifi system problem solv divid episod receipt extern reward rule activ period fire cycl episod end episod strength activ rule episod updat ff extern reward receiv end episod experi method classifi fire tradit classifi time chosen probabl call fit method action classifi highest fit chosen random classifi chosen rest case action mechan call stop run algebra differ polici end neighbor trial threshold consecut trial converg classifi system ran long collect reason data ran classifi system determinist action choic entir trial stop run classifi system differ total feedback receiv system neighbor determinist trial small threshold consecut determinist trial perform studi effect concurr learner develop effect coordin block push domain compar perform classifi system resourc share robot navig domain characterist domain block concurr learn agent strongli coupl multipl optim behavior resourc agent learn adapt agent behavior delai strongli coupl singl optim behavior robot concurr learn multipl agent variabl multipl optim behavior block push problem independ assign move start goal euclidean space agent awar capabl action individu joint task complet agent knowledg system perceiv current distanc desir path goal state action restrict agent exert forc max object angl agent push forc angl offset block direct unit direct unit net result forc block found vector addit individu calcul posit block assum unit displac unit forc direct result forc block locat provid feedback agent block path jx distanc dimens block desir feedback agent action agent agent block ideal path goal posit field plai time step agent push forc angl potenti path sin sin sin agent agent combin effect figur block push problem field plai restrict rectangl endpoint trial consist agent start initi posit appli forc goal posit reach block leav field plai figur abort trial number agent action fail block goal prevent agent learn polici appli forc block rest optim path goal goal agent requir repeat push block path goal agent solut methodolog appli modif problem arbitrari number agent implement polici chose intern discret extern continu space space dimens uniformli discret discret forc action select middl continu rang actual forc angl appli block problem time step outcom agent action depend action agent present system conduct experi cooper push block common vie push block individu situat run consist number trial system paramet learn problem agent held constant stop criteria run agent succe push block goal consecut trial maximum number trial execut case report run standard procedur literatur initi valu suitabl task feedback infrequ opportun explor action feedback receiv action found agent entir path trial start trial state action chosen start trial similar reason hold action chosen trial fix fraction action random probabl distribut action stochast lead slow converg chose initi larg posit number enforc explor action option converg reason number trial primari metric perform evalu averag number trial system converg inform acquisit coordin knowledg obtain averag distanc actual path desir path data plot tabl paper averag run experi cooper domain extens perform domain agent assign task push block goal locat section provid detail result choic system paramet agent learn push block desir reward receiv action choic step equal maximum valu ss optim action choic calcul ss ss fi fl ss solv ss equat yield order agent explor action initi requir similar show case experi fix maximum reward fl fi agent vari magnitud angl forc appli block problem start goal posit initi experi found number discret interv chosen angl agent push line parallel odd discret interv angl dimens number discret interv forc dimens chosen vari number discret interv state space found averag number trial converg respect run converg limit trial suggest state agent find difficult learn optim polici number interv coarser variat reward agent action state discret state map larger rang continu space agent start end physic result vari learn rate experi vari learn fi result averag distanc actual path desir path run plot figur fi valu case straight path optim sequenc action put block dimens repres agent updat polici matrix success step calcul number updat requir optim action reach steadi state note system optim action arriv steadi state block initi long agent optim reach posit number updat reach steadi state optim action proport number trial converg run updat initi equat fact optim action start reinforc receiv state current fi fl fi fi constant defin equal fi fi equat differ equat solv obtain defin converg criteria js ffl arbitrarili small posit number updat requir converg calcul avg distanc optim trial vari beta beta variat step converg beta trial converg figur variat averag distanc actual path desir path number updat converg optim chang fi fi fl constant express shown function fi corrobor experi vari fi hold fl figur fi agent number trial converg optim set action requir follow desir path plot figur present comparison theoret converg trend curv plot repres function number updat requir reach steadi state ffl curv repres averag number trial requir run scale constant factor actual ratio number trial converg valu express hand side inequ fi equal averag number trial valu express fact result averag claim theoret analysi good estim rel time requir converg learn rate chang vari agent capabl set experi design demonstr effect agent capabl time requir converg optim set action current set agent chosen exert forc agent chang angl appli constant forc block agent vari forc angl agent vari forc angl averag number trial converg experi interest result experi agent learn coordin action achiev desir behavior faster singl agent act simplifi problem activ agent restrict choic select angl learn solv problem quickli fix angl activ vari magnitud problem trivial chosen angl ident angl desir path start unsolv transfer learn design set experi demonstr learn situat learn perform similar situat problem start goal locat refer problem problem start locat goal locat desir path obtain figur optim action choic select state agent polici matric end success run join start goal locat straight line demonstr transfer store polici matric agent converg origin problem ran set experi agent start store polici matric found linear number trial converg goal problem farther goal initi problem determin due pure distanc desir due difficulti learn follow ran experi problem agent start uniform polici experi reveal angl desir path longer agent converg learn origin solv evidenc save number trial converg agent start learn polici found differ confid level result demonstr transfer learn knowledg similar situat complimentari learn section shown effect system paramet agent capabl rate agent converg optim set action discuss set mean agent agent cogniz actual constraint goal knew elementari independ calcul desir action state enter result polici ident plan capac knowledg encod polici matrix figur end successfulli converg agent believ action choic state world action choic agent state repres straight line angl scale repres magnitud forc immedi notic individu polici complimentari ident combin action bring block closer desir path agent push wrong direct agent larger forc bring block closer desir path case occur state edg field visit infrequ complementar individu visibl state experi domain design set experi agent provid feedback block locat agent assign push block goal path action affect goal achiev agent maximum forc refer agent chosen maximum forc agent vari variabl number discret action option forc rang dispar strength stronger agent weaker succe push block goal locat figur averag number trial converg tabl figur trial agent conflict goal strength weaker agent stronger agent find increasingli difficult attain goal strong weak agent maximum forc option number forc discret weak agent find stronger agent find difficult push block goal maximum forc weak agent closer maximum forc stronger find push block desir goal find final converg path li individu desir path strength weaker agent path move desir path stronger ultim li individu desir path agent equal strong agent agent stronger answer li stochast variabl feedback receiv action determinist choic action maxim polici matrix entri agent action state receiv feedback depend action chosen agent defin optim action choic state action highest averag feedback time agent action state receiv feedback receiv feedback action state option state agent time state action correspond higher polici matrix entri steadi state polici matrix entri action state greater polici matrix entri action obtain receiv feedback action agent converg polici tradeoff happen action gener number distinct feedback action stronger agent produc distinct feedback discret weaker agent simpl remedi situat proport action randomli action probabl distribut polici matrix valu result exponenti trial converg develop simul anneal base procedur result proport random choic polici matrix converg steadi state robot navig problem design problem find optim path grid start locat respect agent world hold figur depict potenti path agent learn process goal agent learn move quickli respect goal locat collid agent agent receiv feedback base make move receiv feedback make move receiv feedback make move result chang distanc goal receiv feedback make move result feedback comput depict fig agent learn figur robot navig problem time updat individu polici figur feedback agent type action agent robot navig task domain agent coupl vari time agent locat interact agent behavior tightli coupl move interact behavior coupl robot navig problem produc reward time method payoff distribut classifi system system paramet fi fl ff result robot navig domain compar system payoff distribut displai figur plot show averag number step agent reach goal lower valu paramet mean agent learn find direct path goal collid result averag run system time longer converg compar final number step agent slightli smaller number step agent make converg criteria strict solut evolv comput effort interest aspect experi agent learn simultan obviou find good path typic show agent stop posit pass avoid path small optim perform fi compar present figur interest note experi set fi ff system attain converg trial step trial averag number step robot navig task figur comparison robot navig problem resourc share problem resourc share problem assum agent share common resourc distribut load system achiev maximum util version assum agent appli load distribut fix time agent learn distribut load system knowledg current distribut maximum load appli system point time excess receiv util reciev load appli util curv figur curv depict util receiv load agent channel appli load system time step agent appli util receiv util function figur maximum load system total feedback end time step problem requir agent distribut load load agent order obtain maximum util problem agent direct inform load distribut system typic situat reinforc learn problem agent action base scalar feedback formul load balanc problem mal literatur feedback agent maximum load time maximum time figur resourc share problem singl trial consist episod appli load time step complet agent exhaust whichev occur earlier consecut trial agent learn distribut load system optim fashion figur present load distribut agent optim load distribut agent problem experi resourc share problem system agent action interact time step domain consid agent common agent coordin achiev util benefici resourc share problem produc reward seri action perform method payoff distribut classifi system payoff distribut initi experi show perform problem paramet valu fi fl ff set experi converg trial result compar base classifi system resourc share problem displai figur result averag run system method find optim load distribut settl good distribut long converg produc load distribut averag differ perform found confid level activ rule directli share feedback end trial extern feedback pass back polici element earli trial success trial action sequenc share polici element produc converg solut averag util trial resourc share problem figur comparison resourc share problem typic solut produc differ import characterist solut save load empti solut load util empti time slot produc util result show agent effect classifi system coordin action effect knowledg action agent common action choic mechan effect method classifi system commonli action choic scheme ran set experi domain agent learn concurr agent submit load distribut submit load distribut give feedback util learn techniqu gener effect coordin agent set limit individu learn tightli coupl domain delai feedback extrem good coordin evolv agent learn time true optim behavior pair futur research paper address problem develop multiag coordin strategi minim domain knowledg inform share agent compar classifi system base method reinforc learn investig resourc share robot navig problem experi show classifi base method perform competit gener good solut problem work resourc share agent adapt fix strategi feedback receiv infrequ result encourag robot navig agent learn simultan classifi system payoff distribut agent coordin movement deviat significantli optim path start goal locat experi conduct task demonstr agent coordin solv problem develop model develop verifi theoret predict effect system learn system converg experi show util acquir learn similar situat demonstr agent coordin learn knowledg reinforc learn shown agent learn achiev goal cooper adversari domain prior knowledg domain characterist explicit model capabl agent requir paradigm system friend foe concurr acquir coordin knowledg limit approach identifi inabl concurr learn develop effect coordin agent action strongli feedback optim behavior combin partial fix problem sort learn mode agent learn execut current polici modif switch back agent synchron behavior learn fix polici vice versa perfect synchron learn mode effect concurr learn mode paper drawback reinforc learn gener coordin polici requir amount domain agent repeatedli perform similar task learn algorithm data requir possibl explor overcom limit paper demonstr classifi system effect achiev solut quickli illustr experi conduct robot navig task enforc rigid converg classifi system achiev solut larger number illustr result obtain resourc share domain classifi system produc result domain identifi distinguish featur domain scheme perform focu futur research shown choic action product commonli choic action payoff distribut mechan plan compar mechan method payoff distribut investig effect problem complex number trial converg robot navig vari size grid number agent move grid find effect solut qualiti converg time plan experi includ world model classifi system combin featur learn multiag coordin strategi acknowledg research nation scienc foundat research initi award career award refer sequenti problem neural network confer neural inform process read distribut artifici intellig morgan kaufmann san ca classifi system genet algorithm artifici classifi system learn intern world model machin van de learn distribut system environ european work session lectur note berlin springer verlag negoti agent learn prefer thirteenth nation confer artifici page menlo ca aaai press incorpor oppon model adversari search thirteenth nation confer artifici page menlo ca aaai press element theori speech act cognit multistag negoti distribut plan read distribut artifici page morgan kaufman comparison classifi system anim intern confer simul adapt behavior partial global coordin framework distribut hypothesi format ieee transact coher cooper commun problem solver ieee transact trend cooper distribut problem solv ieee transact knowledg data coordin distribut search hierarch behavior space ieee transact organiz view distribut system ieee transact multiag learn collect memori work note aaai symposium learn multiag page stanford ca editor distribut artifici volum research note artifici intellig pitman cooper commun nation confer artifici page pennsylvania approach coordin multiag interact twelfth intern joint confer artifici page credit assign rule discoveri system machin framework distribut reinforc learn adapt learn lectur note artifici page springer berlin knowledg common knowledg distribut environ journal preliminari version proc acm symposium principl distribut learn case rule conflict resolut multiag system intern journal studi natur artifici system michigan ann mi escap possibl learn algorithm appli parallel system machin artifici intellig volum ii morgan lo ca editor distribut artifici intellig morgan kaufmann reinforc survei journal ai optim simul multiag emerg ai acm comput markov game framework reinforc learn eleventh intern confer machin page discount discount reinforc case studi compar learn learn tenth intern confer machin page model coordin organ market manag publish read distribut artifici alan bond le page morgan organ john wilei son learn system adapt learn lectur note artifici page springer berlin learn introduct prentic hall adapt action select cooper robot team proc intern confer simul adapt page ma mit press cooper learn composit search experi design system thirteenth nation confer artifici page scale distribut machin learn cooper thirteenth nation confer artifici page menlo ca aaai press synchron plan nation confer artifici page pennsylvania multiag domain adapt learn lectur note artifici page springer berlin adapt load studi multiag learn journal artifici intellig gener method reinforc learn unrestrict environ work note aaai symposium learn multiag page stanford ca learn friend foe sixteenth annual confer cognit scienc page workshop adapt learn multiag system ai learn coordin share inform nation confer artifici page synthesi social law artifici agent societi nation confer artifici page san california adapt base cooper learn system decentr volum page elsevi scienc public contract net commun control distribut problem solver ieee transact tempor credit assign reinforc learn phd massachusett amherst reinforc independ cooper agent tenth intern confer machin page learn delai reward phd king cambridg learn coordin action system intern joint confer artifici page editor distribut artifici intellig meet machin learn environ lectur note artifici intellig springer berlin editor adapt learn system lectur note artifici intellig springer berlin cooper unifi theori commun social structur distribut artifici volum research note artifici page pitman adapt commun protocol cooper mobil robot anim proc intern confer simul adapt page ma mit press cooper relationship relationship learn share learn commun agent agent tabl categor multiag domain identifi learn opportun fa fb trial reach goal agent tabl trial agent reach goal act agent reach goal forc appli agent fa fb distribut constraint satisfact formal distribut problem solv twelfth intern confer distribut comput page negoti conflict resolut domain nation confer artifici page
DB/1520 3 reactiv servic xml repositori activ rule abstract politecnico di milano da itali øó øó ø ø ï áò óò øó óò øó øó ó ï óò øó óð categori subject descriptor à á èöó gener term keyword copyright held hong kong acm stefano ceri politecnico di milano da itali stefano paraboschi politecnico di milano da itali introduct ø øó ó ëù øó øó ðó óò øóô øó òóø áò óò óð óòðý çùö óö ó óð ø òóø ï øó áò óò çùö ùö óò øûó øó áø øó ñù óòðý ø øó øó ðó øó øó ôöó ðó øó øó ó ý óð óùö øó óð óð ï óð ëù óð óò óùö óð øó óö øó óò øóô óò relat work øó óö øó óò áò óò ó øó óùòø óò óùö øó øó øó óò óö øó òóø øó øó øó áò óùö ùò øó òóø øðý øó øóö óò óò óö óò áò øó óö óò óñ øó óò óò øó øó øó óùö óò øó ôöó óò óò óö óð øó òóø øó áò ø ý øó øó øó óö øó áò óùö òóø activ rule xml óò óò event óö øó ó ø ï øó ø øó óò óùö ñù óö ø ó óò øó óö óò óò óò øó óò ó ùô øó øó óò óò øóô øó condit øó óò øó øó óò ó óñ óò óò ó øó øûó óò ï ø ôöó ø øó óò óò óö óò ø øûó øó øó øó óò øó action øó ø øó øó øó áò ñù òó óö øó áò òóø òóø øó óò øó áø øó øó áø øó øó øó óò áò øó ø øó applic scenario ù øùöò óò ø óö øó øó òó óð øó øó óò ó øûó øó óð øó óö øó ø ø óð øó øó ôóöø óð øó øó øó øó øó øó øó øó óð áò øðý óö øó applic óò óö øûó óö óö ðó ó óò ý òó øó óò ìó øó ø óð øó øó óö ø áò øó óùø øó ø óò ý óò óñ óñ óñ ðó óò óñ servic broker rule repositori rule broker rule subscript request human rule subscript protocol rule web mail interfac client óñ òó ý óñ ðó rule rule xml repositori rule servic servic supplier rule engin ë architectur framework áò óð øó øó óð request protocol ø ø çùö øó øó ø ø øó øó óò çò ðó øó óö øó øó øó óö óòðý øó øó øó ø øó øó ø óò ø òóø òóø ø òóø óö òóø òóø øó ø ø ø óò rule packag øó øó ø øó ø áò øó óö óö áò øó áø ùðø øó ø óò implement áò óùö óò ôöó ôöó øó óò ôöó øó øûó áò ôöó øó ôöó óö óò òóø ôöó øó áò óò øðý øûó ó øó çò ôöó óò øó óò ó ùö áò ø óò óò óò øó øó ý øó ø óòðý øó øó ôó áò óùö òóø øó øó øó óò øó óò øó óùö ôöó øó áò óùö óòðý óò óòðý øó òóø áò ý áò áò øó ó óùö áò óò refer ë ä ì áò èöó å å áò óñ ó áò ë ë óò ë ë áò óò ó èöó ì â å å ç ø û óñ ë ê â â ëù áò ë ë è ë ä áò ë å ë â áò ë ê ê èöó áò óò â ù áò ï û â ë áò èöó â û óñ øó áò èöó å ù ëù áò ø ï û òý óñ óñ è û ë à ê áò óò ó óò èöó æ ä å ä ë â èöó áò óð ø óð ú óð å ë ê â ë à èöó ìó áò óò èöó óò ø ø óñ â ø óð ï û óñ ø óñ è à áò ï â áò ç óð ï û üô ç óñ óñ ê ê â à
DB/1521 3 lossless regular view diego giusepp de giacomo maurizio lenzerini dipartimento di informatica sistemistica universit di roma itali mosh vardi depart comput scienc rice po box tx usa abstract inform set question sucient answer complet queri set view lossless respect matter answer queri sole reli content view question lossless queri mobil data data integr studi problem context queri view express regular path queri form present class prevent appli result case rst address problem check lossless case view materi fact view extens make case solvabl extend techniqu studi complex version abstract speci view extens address problem check answer queri obtain reli view extens show problem solvabl connect queri answer constraint satisfact investig comput complex version problem introduct queri process problem comput answer queri base set view problem recent receiv attent applic mobil queri data data integr larg number result report acm sigact sigmod sigart symposium principl system method recent method base idea rst comput rewrit queri respect evalu rewrit view extens direct comput tupl satisfi queri consist basi view de nition view extens comparison approach report observ notion answer depend interpret coher view interpret assum view sound complet consist view sound view assumpt extens view subset result evalu view express assum view provid data obtain queri express view call exact view consid view sound complet consist view exact view assumpt extens view coincid result evalu view express independ strategi assumpt question inform content view sucient answer complet queri set view lossless respect matter answer queri sole reli content view question relev mobil interest check set cach data deriv request inform access network data determin materi view sucient call complet view complet answer queri relev posit answer queri data ensur user deriv sensit inform question import design view select problem measur qualiti choic view materi data data interest check relev queri answer access set sourc point design data integr select minim subset sourc access lose power de nition lossless reli set view lossless respect answer queri comput answer base view extens version lossless sound view lossless exact view assumpt rst version weaker view lossless respect queri sound view point inform complet answer incomplet view extens prevent form obtain answer lossless respect queri exact view inform complet answer point view recent paper explicitli question lossless result present refer case lossless sound view assumpt author introduc notion materi exploit notion deriv result lossless restrict class aggreg queri problem studi variant conjunct queri queri queri rel set extens answer queri subset answer shown rel complet case conjunct queri view result rel extend case view limit access pattern result present notion view set view set answer power answer queri answer result base fact case conjunct queri set answer queri obtain datalog program check rel amount check datalog program exploit conclud check lossless set conjunct view respect conjunct queri check queri datalog program comput answer relat question problem check maxim rewrit queri respect set view queri method check exact regular rewrit report class regular path regular path queri regular rewrit sucient comput answer check lossless set regular path view respect regular path queri reduc check exact rewrit queri respect view studi problem lossless context semistructur form label queri view express regular path queri presenc regular path limit prevent appli result case result lossless check valid set problem reduc check queri respect queri express repres maxim rewrit directli appli method case main contribut work address problem check lossless case view view extens version lossless relev data view model data view extens correspond data access integr system answer queri lossless determin rel data present method search counterexampl coher view di er answer queri show avail view extens make case solvabl extend techniqu studi gener version abstract speci view extens lossless question case consist check answer queri obtain comput answer basi view extens version lossless situat inform design time data situat view extens expect chang measur lossless current view extens meaningless search counterexampl dicult due presenc quanti cation view extens show problem solvabl sound view assumpt prove restrict attent counterexampl linear method connect queri answer constraint satisfact present comparison case lossless exact view algorithm present show queri maxim regular rewrit respect view lossless respect sound view assumpt studi comput complex check lossless regular view sound view assumpt show xed view check lossless data complex respect size view wrt queri view de nition gener show problem wrt view de provid expspac upper bound respect queri paper organ section introduc regular path de nition lossless view section recal connect queri answer constraint satisfact section present method check lossless respect view extens section section address gener version case sound view exact section present discuss comparison notion lossless notion maxim rewrit section conclud paper preliminari graph node repres edg label element alphabet assum nite node repres di erent edg node node label denot repres fact relat hold object repres object repres restrict attent queri express regular express automaton evalu comput set pair node connect path conform regular languag de ned path sequenc form ym rm ym ym path rm ym conform rm path simpl node sequenc access collect view answer basi knowledg view speci collect view repres tupl vk view de nition tupl ek view extens view pair view de nition alphabet view extens set pair object assum object repres constant adopt uniqu assumpt di erent constant denot di erent di erent node denot set object denot view extens vk denot kg consist sound view assumpt consist sound view assumpt consist kg note de nition make clear sound view assumpt model situat view extens provid subset result appli view express sound view tupl tupl exact view assumpt model situat view extens provid sound complet inform data sati es view express queri answer base exact view mean basic appli close world assumpt view consist exact view assumpt consist exact view assumpt consist kg view de nition view extens queri set answer sound exact view assumpt respect set pair consist assumpt queri answer consist decid pair object answer respect view de nition queri denot cert sound exact function view extens return set answer sound view assumpt view respect de ne notion lossless collect view respect queri rst refer case view extens definit view de nition view extens queri lossless respect rel sound view assumpt view cert sound cert exact alphabet queri view extens lossless respect rel sound view assumpt constitut singl path easi verifi cert sound check lossless respect rel exact view assumpt due fact view consist pair node extend notion case abstract view extens case lossless respect mean matter di erenc issu comput answer basi data satisfi view definit view de nition queri lossless respect sound view assumpt view cert sound cert exact alphabet queri view lossless respect sound exact view assumpt due fact path conform form form rst path conform case conform notic rewrit queri respect view section lossless respect view extens address problem queri view de nition view extens lossless respect rel deal rst lossless sound view de lossless respect rel sound view assumpt exist pair object exist cert sound condit correspond check answer sound view assumpt respect condit correspond check answer sound view assumpt respect algorithm determin lossless rel extens techniqu check kind condit deal case note trivial cert sound case check condit basic idea includ object extens chang extens view object stand repres object algorithm check pair object satisfi condit proce iter pair object check condit hold add object view extens de nition symbol alphabet origin view queri iter object pair pair check condit hold add pair object view extens de nition check condit hold algorithm return check true theorem lossless respect rel algorithm return true check perform algorithm pspace measur complex respect view extens data check np upper bound theorem check lossless respect rel sound view assumpt pspace wrt conp wrt complex bound tight theorem check lossless respect rel sound view assumpt wrt wrt wrt proof theorem sucient show hard show pspace hard result reduct regular express show wrt reduc regular express alphabet respect rel symbol observ pair object satisfi condit pair sati es condit show wrt reduc regular express alphabet respect rel observ pair object cert sound pair object satisfi condit exist pair object satisfi condit show wrt exploit idea reduc graph rel extens loss connect graph edg alphabet rb br gb bg rs reg connect vertic color rs addit symbol view ve vg rs ve vg rb br gb bg queri rs regular express symbol describ path pair mismatch color pair pair rb denot edg red node green gb graph check object de ne extens ee es ng ee ng repres symmetr direct es ee connect node graph connect edg rgb answer cert sound exist result present section extend immedi case lossless respect view extens exact view de lossless respect rel exact view assumpt exist pair object exist cert exact check lossless simpli appli algorithm sound algorithm comput answer respect exact view check condit upper bound lossless sound view assumpt respect lower easi proof theorem appli exact view conclud theorem theorem check lossless respect rel exact view assumpt wrt wrt wrt lossless abstract view extens deal check lossless abstract view extens discuss lossless sound exact view assumpt separ techniqu check lossless sound view assumpt make connect constraint satisfact view base queri answer brie recal queri answer problem ned term set set set assign variabl valu sati es constraint csp term homomorph relat structur vocabulari set ariti relat structur domain interpret function assign predic relat ariti homomorph relat structur vocabulari map cn predic vocabulari class nite relat structur problem structur structur homomorph denot instanc homomorph exist sati consist singl relat structur set relat structur vocabulari denot xed input structur tight relationship queri answer sound view assumpt illustr reduct queri answer nonuniform csp develop queri view de nition vk constraint templat ct wrt structur de ned vocabulari denot binari uc ud denot unari predic aq automaton structur exist word extend set state word usual view extens ek pair object constraint instanc structur de ned fdg theorem view de view pair object cert sound homomorph ct lossless sound view show check lossless sound view assumpt techniqu base search counterexampl lossless counterexampl lossless view de nition respect queri pair object cert sound linear counterexampl counterexampl form singl simpl path turn loss concentr linear counterexampl show exploit correspond csp queri answer discuss rst prove technic lemma lemma view de view pair object exist homomorph cert sound impli cert sound proof cert sound theorem exist homomorph constraint instanc constraint templat ct map obtain homomorph ct theorem cert sound crux result queri answer monoton set mean pair object answer queri respect view add extens pair object equal identifi pair object answer exploit result show concentr linear counterexampl lossless theorem counterexampl lossless respect sound view linear counterexampl proof exist pair object cert sound path rm ym ym rm observ necessarili distinct de ne consist distinct object dm edg mg dm extens view pair object dh dh map map homomorph cert sound lemma dm cert sound fact restrict attent linear counterexampl show decid fairli easili result theorem comput pair answer express csp csp express existenti monad logic classic result monad sentenc word translat automata set linear counterexampl construct automaton accept check empti decid provid good upper bound complex show obtain bound loss search linear counterexampl form rm xm rm theorem xm cert sound homomorph constraint templat ct cert sound function label xm set state automaton aq condit call pair object xh view de nition rh exist word word form rm set state aq repres sati es condit construct automaton accept word check empti automaton alphabet obtain cross product accept word consist altern symbol symbol start symbol end symbol project obtain intersect straightforward automata check condit automaton check condit obtain aq ad state subset transit number state polynomi depend automaton de ne view binari relat exist word note decid pspace hold relat construct time exponenti size aq linear size construct automaton read guess posit check rh size automaton linear exponenti aq rememb comput obtain union automata complement theorem lossless respect sound view assumpt automaton proof lossless respect theorem exist linear counterexampl form rm rm cert sound theorem exist label object xm state aq hold word word accept accept word exist linear form rm label object xm state aq de ned mg accept rm accept hold theorem cert sound lossless respect automata theoret upper bound verifi lossless theorem check lossless respect pspace respect expspac respect suce check languag accept automaton obtain aq chang initi nal state proof number state automaton polynomi depend relat construct time exponenti size linear size number state exponenti polynomi requir number state doubl exponenti exponenti empti automata number state construct automata check claim theorem show upper bound tight theorem check set view lossless respect queri sound view assumpt wrt proof theorem suce show hard reduc regular express alphabet lossless respect shown proof theorem lossless respect rel extens lossless respect view trivial lossless theorem check set view lossless respect queri sound view assumpt wrt proof theorem suce show hard reduct tile problem tile problem hor ver ned nite set tile horizont adjac relat hor vertic adjac relat ver consist determin exist tile region integ plane size tile type adjac condit sati ed tile call good tile reduc problem check hor admit good tile problem check set view lossless respect queri sound view assumpt theorem linear counterexampl form refer word encod tile word good block vector word call good refer subword form tile type block repres tile idea vector provid address intend address start behav counter block refer left address address intent address ident sequenc block call segment segment address repres horizont row exponenti length addit tile call call symbol symbol counterexampl queri word symbol conform intend block distinct success address success tile satisfi horizont tile constraint accept word mix symbol call error error bad good regular express bad size linear size tile system describ bad express bad rst part challeng relat block repres vertic adjac tile block address block address view rst view bad cert sound mean bad accept bad word view intent view connect xs node left address bit view de ned symbol pair xs connect word form singl letter call nonstandard interpret view intent view connect node address bit view de ned symbol nonstandard interpret view error de ned constrain sion bn symbol constraint subword occur construct regular express size quadrat word obei pair error connect word form singl letter call nonstandard interpret de ne queri sum term bad good rst show good counterexampl af word describ good tile claim af xf counterexampl good xf show xf cert sound displai xf note bad good view connect xs node left address bit nonstandard interpret assum xs connect letter handl analog error describ good repres vertic adjac tile address address di er bit address bit nonstandard interpret connect singl letter show xs connect word bad word good possibl xs connect word mean xs connect connect connect xf left address bit address bit connect address di er contradict remain show good tile provid counterexampl assum good tile show cert sound xs connect bad word xs connect good word xs connect xf word rst xf bad mean xs connect xf bad word xf error xf error view standard nonstandard interpret interpret xs connect good xf interpret standard xs connect xf bad word mix interpret mean xs connect connect connect xf remain case xs connect good word bad word repres tile vertic error address tile tile address ver tile vertic adjac posit error arbitrari error case nonstandard interpret mean connect ng standard interpret mean connect word case bit address xf xs connect word connect connect xf word xf case arbitrari bit address xf xf nonstandard path mix standard good path xs good counterexampl lossless exact view remind reader set view lossless respect exact view assumpt cert exact de verifi lossless sound view impli lossless exact view show context regular path lossless exact view impli lossless sound view alphabet queri view easi lossless respect sound view counterexampl exist lossless respect exact view assum pair object object possibl coincid path abc path path abc case case case contradict assumpt note interest consequ search linear counterexampl sucient decid lossless exact view mean directli extend techniqu deal case question lossless exact view larg unexplor techniqu case conjunct queri view question interest direct continu work present relationship rewrit notion lossless compar queri answer deriv collect view lossless introduc previou section perform comparison previou attempt de ning view lossless term queri rewrit show context regular path notion strictli gener brie recal notion queri rewrit set view assum alphabet consist symbol view de nition languag denot expand languag de ned expand wn wh regular languag rewrit queri respect view expand rewrit respect maxim rewrit rewrit respect expand expand determin queri maxim rewrit check lossless sound view notion coincid theorem demonstr lossless gener theorem maxim rewrit respect view lossless respect sound view assumpt proof path label maxim rewrit respect exist word wn wn path label word belong lossless respect sound view assumpt show case queri maxim rewrit respect view view lossless respect queri sound view assumpt alphabet queri view easi maxim rewrit respect empti path path lossless respect sound view assumpt applic question set view lossless respect inform content view sucient answer complet queri address question context queri view express regular path queri shown case view extens problem solvabl extend techniqu gener version abstract speci view studi di erent set rst lossless check assum view necessarili complet illustr techniqu comput complex problem view consid exact sound question lossless exact view larg investig plan address problem continu work present interest investig lossless sound exact class queri semistructur regular path queri conjunct regular path queri acknowledg work support part nsf grant murst project mine heterogen data refer abiteboul queri data proc int conf theori page suciu data relat semistructur data xml morgan lo abiteboul duschka complex answer queri materi view proc acm sigact sigmod sigart symp principl system page buneman semistructur data proc acm sigact sigmod sigart symp principl system page de vardi rewrit regular express regular path queri proc acm sigact sigmod sigart symp principl system page de vardi answer regular path queri view proc ieee int conf data engin page de vardi queri process view regular path queri proc acm sigact sigmod sigart symp principl system page de vardi queri process constraint satisfact proc ieee symp logic comput scienc page suciu formal perspect view select problem proc int conf larg data base page duschka genesereth answer queri view proc acm sigact sigmod sigart symp principl system page feder vardi comput structur monoton monad snp constraint satisfact siam garei johnson comput intract guid freeman san francisco grahn mendelzon tableau techniqu queri inform sourc global schema proc int conf theori volum lectur note comput page grumbach content materi aggreg view proc acm sigact sigmod sigart symp principl system page theori answer queri view sigmod srivastava answer queri view proc acm sigact sigmod sigart symp principl system page ullman minim view set power proc int conf theori page li chang answer queri presenc limit access pattern proc int conf theori page friedman queri data integr system proc acm sigact sigmod sigart symp principl system page reiter close world data base gallair logic page plenum publ thoma logic handbook formal languag volum page ullman inform integr logic view proc int conf theori volum lectur note comput page van emd boa conveni tile volum lectur note pure appli page marcel dekker
DB/1522 3 physic world philipp johann gehrk praveen seshadri cornel hall ny million sensor mobil devic integr memori commun capabl network devic wide deploi detect surveil applic user queri larg collect devic manner exist system reli server provid declar access data extract devic system lack flexibl data extract predefin scale larg number devic raw data transfer devic server concept devic queri process tightli integr network devic detail approach show devic system overcom limit exist system introduct widespread actuat mobil devic transform physic world comput platform comput storag commun capabl temperatur sensor motion door light bulb cellular kei ring emerg network techniqu ensur devic interconnect access network comput applic enabl peopl interact portion physic world larg class user monitor environ exampl praveen seshadri leav microsoft wa monitor applic includ gather inform disast item factori organ vehicl traffic larg citi concret base exist flood detect applic twenti year alert system deploi state typic alert instal consist sensor rainfal water level weather predefin set data regularli extract transfer central site store system user queri sensor data store graphic user interfac rainfal displai averag level rainfal current level rainfal sensor displai locat sensor level rainfal greater show monitor devic network declar user submit queri devic network physic structur organ system contact devic process queri effici system data extract predefin process flexibl suit queri aggreg queri histor averag level rainfal level rain account onlin queri emerg fire depart requir specif data access group site order decid action displai rainfal level queri answer tradit system data extract sensor hour solut continu extract data devic transfer due larg amount sensor data solut feasibl practic system transfer larg amount raw data devic server scale larg number devic valuabl resourc transfer data data transfer local process network bandwidth limit modern devic includ process capabl process data local reduc data transfer group sensor send data back server reduc sensor locat counti order overcom limit system access devic depend queri workload predefin advantag process capabl devic system requir tight integr queri process devic network defin devic system system queri process reli directli devic network figur illustr shown figur popul data extract devic queri evalu local data devic shown figur includ queri evalu devic devic network queri process design goal devic devic network queri process flexibl access devic user express onlin queri access devic low system minim amount time moment data gener devic moment answer report user control resourc system minim total amount resourc io commun consum system order process queri energi limit devic remain limit futur law appli condit devic network chang devic network topolog batteri recharg devic system adapt chang condit gracefulli reduc administr devic network grow shrink limit administr devic system obstacl dynam evolut devic network add overhead administr investig issu devic system project cornel initi challeng design devic system repres devic schema devic repres devic intern involv queri defin onlin queri devic express queri present displai rainfal level devic system advantag process capabl offer modern devic system process queri effici context devic introduc notion devic system specif address question mention remaind paper organ section describ concept devic describ abstract repres devic explain queri formul section show queri analyt model illustr benefit approach devic system call physic object comput commun capabl devic smart devic emb comput commun capabl sophist sensor physic object connect extern comput rainfal sensor connect devic interconnect access network devic constantli attach devic mobil intermitt connect devic conceptu devic support set function amount process directli devic function store process data measur rainfal trigger action physic world kind function return result statu report error distinguish synchron asynchron function synchron function return result time point time current rainfal asynchron function return result arbitrari point time detect abnorm rainfal environ devic network comput power node resembl mobil comput environ devic differ mobil host devic inher serv extern request initi request abstract repres devic order tightli integr devic queri repres level distinguish level user devic model intern devic repres compon perform queri devic schema support abstract data type object singl attribut valu encapsul collect relat data note natur parallel devic adt adt devic provid control access encapsul data interfac build observ model type devic network adt public interfac adt correspond specif function support devic actual adt object correspond physic devic real world model schema flood detect introduct simplifi schema consist relat area record relat attribut call adt repres physic rainfal sensor actual sensor data locat rainfal adt sensor method access data return current level rainfal measur mm attribut denot locat sensor coordin system area relat record regist associ area locat defin rectangl identifi coordin top left corner bottom corner intern discuss intern adt recal background knowledg queri process intern system queri process proce system accept sql produc queri execut execut plan produc answer execut plan intern blueprint evalu queri combin relat oper join serv basic build block manipul relat set execut plan gener repres tree relat oper select join condit project repres variabl predic express adt method repres express virtual relat method repres express adt method evalu function call obtain return assum return readili time assumpt hold devic system function devic adt method locat devic asynchron virtual relat tabular record virtual relat input argument output argument method relat call virtual base defin schema virtual relat explicitli queri execut plan base relat access virtual relat access virtual scan call function implement method adt obtain result return virtual record relat oper virtual scan repres invoc adt method execut method perform parallel devic adt object overlap method execut kei advantag repres remot method asynchron method method schema virtual relat vr attribut correspond uniqu identifi devic identifi actual devic adt attribut correspond input argument attribut correspond output attribut time stamp point time output obtain schema consist base relat virtual relat method method input virtual relat identifi sensor level rainfal measur timestamp observ devic virtual relat natur partit devic repres devic adt observ interest devic invoc method adt repres virtual join virtual relat base relat devic adt attribut intern repres distribut devic accommod partit virtual relat base relat store central server partit devic discuss distribut architectur devic system section queri devic schema distinguish categori queri devic snapshot queri concern devic network point current rainfal level sensor queri concern devic network time retriev rainfal level sensor conveni user formul queri associ time sql queri formul sql queri devic schema introduc previou section queri retriev rainfal level sensor counti select area rx ry rx ry snapshot queri queri depend time current durat time repetit method time queri space describ complet queri semant interest reader refer bonnet al detail architectur devic system devic distinguish queri submit devic particip execut queri includ server devic includ special queri execut engin access virtual interest partit base relat refer devic adt system devic frequent join leav partit base relat avoid maintain central inform devic system relat process fragment queri plan involv virtual relat describ virtual relat flood detect server locat devic network case applic user locat physic region cover devic network architectur preclud locat devic devic extens cornel predat system queri proxi evalu queri fragment queri proxi implement virtual relat oper access virtual relat virtual scan argument function call possibl argument repetit rate virtual scan call function obtain tag time stamp return virtual record manag durat queri send explicit messag devic stop execut virtual scan queri process devic system concentr simpl give overview queri process show benefit approach space cover issu relat queri process devic system defin perform metric discuss perform metric process system construct execut plan queri optim gener execut plan minim cost function tradit perform metric system throughput time throughput averag number queri process unit depend total work perform system evalu queri total work defin sum time spent compon system process queri cost model total work linear combin network express time time system produc answer queri execut queri pipelin record flow oper execut plan server devic realist major vendor server repres process capabl expect devic futur compani provid server time time slowest oper execut plan execut pipelin time equal total work long run queri devic tradit perform metric queri time queri run time vari resourc usag total work defin metric correspond perform goal devic resourc total amount energi consum system execut queri resourc usag express reaction interv time call return time answer produc reaction time express problem defin cost model resourc usag reaction time obtain maintain correct set system paramet cost set reflect statu devic system time resourc usag reaction time obtain linear combin storag network cost cost directli queri process model classic cost link network harder model cost transport data point vari drastic depend network rout algorithm method access medium model repres network cost gener encompass wide rang devic network interest accuraci network model fresh set valu overhead maintain defin accur scalabl cost model network cost account open research issu introduc section goal cover issu relat queri process devic illustr exist distribut techniqu appli context devic system discuss characterist devic system respect exist distribut system analyt model illustr benefit approach vr select area rx ry rx ry figur show queri graph queri queri graph show intern queri sql code present figur sql queri user obtain replac devic adt method virtual vertic queri graph repres relat identifi abbrevi edg repres join condit rectangl relat repres select condit queri involv base relat virtual relat select condit select counti hundr area store relat join condit select devic locat join condit vr select half devic rainfal cardin relat cardin relat record devic system rainfal sensor partit vr queri run snapshot queri record insert partit virtual relat run queri interv hour rainfal level measur case record insert partit virtual relat distribut queri execut plan sql space execut plan obtain shape tree relat permut posit relat oper implement relat oper system implement set join nest permut rel posit distribut execut plan reflect distribut natur queri relat assign execut site dimens ad space execut queri fragment queri strategi transfer data site materi vr tradit plan vr vr vr plan plan figur present execut plan queri plan tree relat oper manipul base virtual relat scan repres graph tradit plan repres execut plan gener tradit system alert data extract devic materi relat vr locat frontend grai execut plan linear tree success join oper join concern relat relat join condit result join relat join condit rx ry rx ry join execut vr vr vr vr vr vr execut plan concern devic system illustr exist distribut techniqu plan linear tree relat join consist join relat locat relat vr partit set devic white execut plan evalu devic measur rainfal level transfer result virtual record back record produc site snapshot repetit virtual record arriv join relat result record locat attribut obtain join relat execut plan devic rainfal sensor transmit data frontend queri concern sensor locat altern execut plan push join devic trade process devic reduc network traffic plan describ execut plan join push devic record answer queri transfer back note order perform join relat origin locat copi devic involv queri execut plan retriev data devic counti compar previou reduc amount data devic cost comput plan describ execut plan join relat select devic locat counti place result join call virtual relat locat devic call outer project join attribut relat devic id sensor obtain join send result relat devic rainfal level measur join perform local virtual relat relat join condit devic id list join produc record record ident virtual record back join complet record relat join execut sensor counti send data back frontend note compar previou execut amount data devic reduc locat attribut relat relat amount process devic reduc outperform classic join distribut system compar cost execut plan section characterist queri process devic system show virtual relat abstract join algorithm develop exist distribut includ algorithm bloom filter fit devic system distribut system constitut devic system aspect queri process specif devic relat call virtual introduc access virtual relat section virtual scan call obtain tag time stamp return virtual record record virtual relat access virtual relat read repetit explicitli materi object minim latenc suggest avoid materi virtual relat virtual relat part pipelin virtual relat particip join relat join involv virtual relat symmetr hash join constraint optim account devic system advantag rout characterist devic network primit rout strategi broadcast queri fragment devic network queri fragment devic type rainfal level devic predic satisfi devic locat observ primit rout compar file scan form rout compar index scan exact match rang devic administr declar rout capabl declar index structur file implement solut devic system rout techniqu benefit techniqu develop manag search index structur mention issu cost model includ accur scalabl model network cost open research issu queri optim gener queri execut plan minim cost condit devic network chang significantli interv queri run devic involv queri devic join ad partit exist virtual relat concept develop distribut system jini provid resili servic investig concept appli provid adapt queri process devic system analyt model simpl rough analyt model compar cost execut plan identifi previou section model illustr assum singl hop topolog cluster base connect devic assum model base node read call rout task send messag destin access medium provid frame period msec system paramet list figur paramet set cpu mip cpu devic mip disk transfer rate mbyte sec devic network bandwidth number base node devic network size control messag byte cpu instruct send messag cpu instruct rout messag cpu instruct evalu express analyt comput total work reaction time total work reaction time express linear combin number messag number byte compon convert millisecond weight factor instanc weight cpu compon express millisecond instruct cpu weight obtain paramet list figur figur show graph total work figur trace behavior ran snapshot figur trace behavior ran queri rainfal level measur thirti graph show plan ratio total work plan total work tradit approach extract total work total work approach plan plan plan plan reduc total amount work respect tradit approach plan plan ran snapshot price send addit data devic higher benefit reduc traffic obtain send back snapshot devic send back devic repetit send data back cost initi send data devic amort period queri run ratio diminish significantli plan plan figur figur ratio diminish slowli plan devic rainfal sensor repetit send back data plan devic send back data repetit tradit approach total work plan lower plan ensur minimum amount data initi devic reaction time msec plan plan plan plan plan figur show reaction time plan reaction time domin network latenc method access reaction time plan total work total work initi approach plan plan plan plan significantli higher plan devic involv queri send back simultan buffer time spent buffer msec wait process import factor reaction time show plan plan devic counti send back buffer plan perform slightli plan plan join process devic plan perform reaction time measur tradit data regularli extract independ queri reaction time depend extract process devic process commun capabl deploi physic provid power comput platform shown technolog adapt advantag comput platform provid flexibl scalabl access larg collect devic concept devic devic repres abstract data devic schema method devic adt repres function provid actual rainfal sensor function measur rainfal level sql queri includ devic method access collect point time snapshot interv show virtual relat repres devic method devic distribut exist queri process techniqu develop distribut system context devic system introduc metric measur perform devic gave overview characterist queri process rough analyt distribut techniqu tradit techniqu data extract devic network server process devic system field research identifi open research issu queri process issu includ transact process administr remain explor acknowledg sensit commun interest discuss issu discuss paper work sponsor advanc research project agenc air forc research air forc materi agreement number view author interpret necessarili repres offici polici express advanc research project agenc air forc research govern refer alert home ph devic system poster paper intern confer data engin san queri process devic system cornel technic report submit public algebra compress framework queri result intern confer data engin san core jini sun microsystem press java seri centuri scalabl coordin sensor network data manag system mcgraw data manag mobil comput sigmod record optim valid perform evalu distribut queri intern vldb page august manag system queri extens acm sigmod confer june cornel predat review current rout ad hoc mobil wireless network ieee person architectur transform passiv dbm activ dbm vldb seshadri enhanc abstract data type vldb journal pm dataflow queri execut parallel environ distribut parallel distribut queri process queri process system
ML/1523 6 form neural network effici adapt coevolut david inform scienc institut southern california marina del ca miikkulainen depart comput scienc texa austin tx abstract articl demonstr advantag search difficult control problem sane system popul neuron cooper form function neural network neuron assum overlap result robust encod control behavior sane shown maintain higher level common popul approach empir studi illustr emerg neuron special role neuron assum popul neural research perform texa austin support part nation scienc foundat grant introduct artifici evolut increasingli popular method form control polici difficult problem applic function optim task evolutionari algorithm appli longer desir converg popul converg hinder adapt popul dynam environ larg number fit evalu freeli grant standard ea toi domain real world problem clear complex structur neural network kind evolutionari algorithm cooper algorithm de whitehead offer altern canon ea difficult dynam problem kei differ cooper model compar standard model individu repres partial solut problem complet solut form group individu goal individu optim piec solut cooper partial solut optim piec hypothesi parallel search piec solut effici singl search entir solut maintain solut piec singl popul converg singl individu maintain ea util recombin oper evolut articl demonstr advantag algorithm difficult control problem system call sane adapt sane design effici method build neural network dynam environ unlik oper popul neural sane evolv popul neuron neuron task involv establish connect neuron popul form function neural network sane perform improv standard ea neural network learn twofold sane recogn neuron function compon neural accur search evalu genet build block neuron perform evolutionari pressur exist evolv neuron type special sane maintain popul bodi articl organ section background motiv sane approach section implement detail sane section empir evalu sane compar standard approach mobil robot task section illustr special sane popul uncov role neuron assum network work relat sane present section section describ success applic outlin futur direct symbiot evolut section draw final section import find combin genet build evolutionari algorithm continu select breed individu popul popul lose eventu converg singl individu converg undesir popul converg suboptim peak converg popul adapt task environ problem limit effect standard function larg consequ evolv strategi complex dynam domain evolutionari algorithm converg popul proce randomli mutat singl solut produc slow ineffici search genet search continu util recombin gener structur make larger solut space shorter period time complex search effici paramount gener effect polici time manner equal import occur domain task dynam unstabl polici quickli avoid costli effect popul make modif domain clear converg evolutionari algorithm kind search strategi difficult control problem maintain difficult remain open research issu evolutionari algorithm commun common method aggress genet select strategi high rate mutat weak select strategi ensur slow evolut delai converg popul slower evolut prevent prematur slower search section present experi demonstr phenomenon mutat artifici inject popul obviou method gener produc search behavior converg adopt commonplac sane system demonstr aggress select recombin strategi work temper effect pressur intellig method develop enforc popul includ fit share crowd local mate techniqu reli extern genet function prevent converg genet materi achiev oper goldberg fit share similar individu forc share larg portion singl fit share solut point share fit similar individu evolut select individu nich fit share effect maintain incur heavi comput share requir similar comparison size popul larg popul larg method local mate simpli practic recent techniqu ensur term implicit fit share smith comparison made individu pressur built task cooper behavior individu popul individu longer repres complet solut repres partial solut cooper individu form full solut reduc capac individu evolut search type individu solv problem implicit fit share present nice side effect evolut search individu optim aspect perform parallel search decomposit solut greatli speed evolut core evolutionari strategi sane present borrow idea implicit fit share model notion cooper individu repres partial solut incorpor sane promot search effici tailor implicit fit share evolv neural network highlight section relat work section symbiot adapt evolv symbiot neuron approach individu popul repres complet neural network evalu independ network popul koza nolfi whitlei previou treat member full evolutionari algorithm search singl domin individu concentr greatli search progress complex dynam task sane method restrict scope individu singl neuron individu repres hidden neuron neural network complet neural network built combin neuron figur illustr differ standard perform sane singl neuron perform task neuron optim aspect neural network connect neuron optim aspect evolutionari pressur exist evolv type special neuron neuron form symbiot relationship evolut perform sane symbiot evolut defin symbiot evolut type coevolut individu explicitli cooper reli presenc individu surviv symbiot evolut distinct individu compet cooper surviv detail discuss relationship symbiot competit coevolut present relat work section term special speci neuron repres full solut problem biolog speci sane special figur individu sane popul hidden neuron defin hidden neuron defin seri weight connect made input layer output layer gene specifi connect output unit weight encod shown simplifi form sane actual neuron section advantag symbiot evolut twofold neuron special ensur discourag converg popul singl neuron popul achiev high fit special present special member combin special popul redund partial solut receiv benefit special incur lower fit evalu evolutionari pressur present select member domin special standard evolutionari converg global local symbiot solut found popul maintain sane continu recombin oper build effect neural structur addit maintain evolut neuron level accur evalu genet build block neuron implement neuron encod chromosom figur good neuron exist chromosom subsequ lost neuron chromosom poor neuron continu recombin neuron produc accur evalu neural network build block evolut advantag priori knowledg individu neuron constitut basic compon neural network evolut explicitli select recombin evalu evalu evalu evalu evalu select recombin stage neuron standard sane stage stage neural network neural network stage stage stage neuron network evalu normal fit combin network figur illustr perform sane compar standard approach standard approach maintain popul neural network evalu independ sane maintain popul neuron evalu conjunct neuron step evalu sane broken substep neuron continu combin result network evalu task neuron receiv normal fit base perform network particip genet build block popul build network evolut evolv neuron level evolutionari algorithm longer reli identifi neuron import build neuron object evolut maintain effect neuron collect neuron evolut suffici power gener complex network difficult task knowledg combin neuron maintain exploit combin neuron intellig direct undesir reason neuron combin neuron work good neuron ineffect combin gener problem qualiti network vari greatli evolut earli gener work search produc type network find effect neuron search focu inconsist network stall search prevent global optima locat experi section demonstr phenomenon outer loop mechan maintain knowledg good neuron combin approach perform record rang maintain complex tabl record fit neuron combin neuron simpli rememb top neuron combin previou gener memori requir method make impract neuron build network popul complet record neuron combin entri method maintain inform histori neuron provid limit benefit intermedi solut current method maintain neuron combin sane evolv layer neural network record blueprint top neuron evolut blueprint popul maintain record effect neuron combin found current popul neuron knowledg basi form neural network gener figur show relationship blueprint neuron popul blueprint specifi collect neuron perform maintain network blueprint produc accur neuron evalu concentr search neural network neuron systemat connect base past consist combin neuron perform neuron pointer blueprint popul particip greater number network neuron particip histor neuron accur evalu top neuron newer neuron receiv trial accur evalu alloc trial top neuron produc improv uniform neuron particip primari advantag evolv network exploit network blueprint popul neuron popul figur overview network blueprint popul relat neuron popul member neuron popul specifi seri connect made input layer output layer neural network member blueprint popul specifi seri pointer specif neuron build neural network neuron popul search effect partial blueprint popul search effect combin partial network network found evolut evolv blueprint neuron combin recombin form potenti collect neuron blueprint level evolut exploit search build network found evolut focu search gener sane implement sane maintain evolv popul neuron popul network blueprint individu neuron popul specifi set connect made neural network individu network blueprint popul specifi set neuron includ neural network neuron evolut search effect partial blueprint evolut search effect combin partial network sourc code obtain neural network home input layer output layer label weight figur form output unit neural network hidden neuron definit chromosom hidden neuron shown left network hidden neuron connect individu neuron popul repres hidden neuron network neuron defin chromosom encod seri connect consist label field weight field absolut label determin connect made neuron connect input output layer decim greater connect made output unit mod total number output unit equal connect made input unit mod total number input unit weight field encod float point weight connect figur show neural network form sampl hidden neuron definit individu blueprint popul seri neuron pointer blueprint chromosom size address pointer neuron structur figur illustr blueprint popul integr neuron popul chromosom pointer randomli assign neuron neuron popul neuron evalu subpopul neuron select base blueprint arrai pointer sane oper bit string mutat search strategi fall genet algorithm method evolutionari comput sane gener genet algorithm oper main evalu recombin evalu goal evalu fit neuron network blueprint popul blueprint evalu base clear fit neuron blueprint select neuron popul blueprint creat neural network select neuron evalu network task assign blueprint evalu network fit repeat step individu blueprint popul assign neuron evalu network particip perform crossov mutat oper popul tabl basic step gener sane manc neural network neuron evalu combin neuron basic step evalu phase tabl evalu blueprint select neuron subpopul size form neural network blueprint receiv fit evalu result network neuron receiv sum fit evalu network particip calcul fit neuron discourag select neuron crucial ineffect poor network robot arm manipul neuron special small movement target effect network posit arm close useless network target neuron import popul penal poor network evalu neuron popul rank base fit valu neuron top mate select randomli top mate oper creat child creat crossov oper copi parent chromosom offspr produc crossov chosen random enter popul copi parent offspr reduc effect neuron mutat evolut effect explain context blueprint evolut section offspr replac neuron popul popul replac offspr mutat rate bit posit perform entir popul step gener elitist breed strategi evolutionari lead quick converg popul sane neuron perform aggress select strong evolutionari pressur converg blueprint chromosom made address pointer crossov occur pointer offspr receiv address pointer parent chromosom parent chromosom pointer specif offspr point neuron current evolutionari algorithm blueprint level ident aggress strategi neuron similar essenti evolutionari algorithm method evolutionari comput aggress strategi blueprint level coupl strong mutat strategi outperform evolutionari algorithm avoid converg problem blueprint mutat strategi emploi pointer offspr blueprint randomli reassign member neuron popul rate strategi promot particip neuron top neuron subsequ network neuron particip network acquir pointer particip gener mutat occur blueprint neuron pointer top blueprint preserv mutat compon select strategi design advantag structur creat neuron evolut recal breed neuron produc copi result crossov oper breed neuron neuron offspr similar potenti parent neuron blueprint evolut knowledg replac pointer breed neuron pointer offspr neuron experi pointer switch breed neuron offspr probabl mutat perform offspr pointer top blueprint preserv select mutat mechan advantag pointer reassign neuron offspr result blueprint evolut explor neuron structur pointer reassign offspr form copi blueprint resili mutat neuron evolut pointer reassign blueprint point exact mutat neuron affect blueprint point pointer reassign mutat limit blueprint effect similar schema promot standard evolutionari algorithm popul highli fit schema neuron preval mutat copi schema affect copi popul perform evalu search sane standard import evalu perform improv section empir evalu sane comparison standard approach experi show advantag sane symbiot search strategi term search adapt khepera robot simul domain chosen evalu sane mobil control khepera mobil robot michel develop simul khepera window util visual neural network control network architectur activ view simul activ robot sensor motor real world sensori input motor make khepera simul excel util evalu featur compon sane khepera tini robot cm design research teach khepera infrar light sensor posit robot easi control khepera real world sensori inform requir strong ground motor output effect maneuv robot resourc simul design accur reflect real robot infrar sensor detect proxim object light reflect return valu inform khepera found figur interfac khepera simul window show view khepera configur artifici world depend color level object object touch sensor khepera control separ receiv speed rang figur show snapshot simul window layout khepera world khepera robot world specif allot move euclidean start posit collid obstacl effect control accur translat infrar sensori inform specif motor output move robot forward maneuv robot obstacl setup experi design compar sane symbiot evolut standard techniqu evolutionari approach test khepera standard approach aggress select strategi standard approach tournament select version sane network blueprint popul specif world khepera simul packag standard approach evolv popul neural network individu chromosom consist neuron encod fashion sane differ standard approach underli genet select strategi standard elitist select strategi sane differ sane standard elit level evolut sane perform evolut neuron level standard elit approach network level comparison sane standard elit approach demonstr pressur neuron evolut aggress search perform poorli standard evolutionari algorithm prematur converg standard approach aggress binari tournament select strategi call standard tournament random individu select individu higher fit recombin strategi creat select bia top individu preclud recombin poor individu contrast sane elitist top popul particip half recombin binari tournament select aggress recent research shown tournament select prefer method genet select term growth ratio discourag prematur converg comparison sane standard tournament approach demonstr perform symbiot search rel genet search strategi fourth evolutionari neuron symbiot neuron search blueprint evolut popul network blueprint form neural neuron sane form network randomli select subpopul neuron comparison sane neuron sane effect gaug contribut evolut focu comparison strategi choic paramet preliminari experi run discov effect paramet valu approach tabl summar paramet choic method standard popul size network found effect popul number network evalu gener constant neuron popul size sane neuron sane perform mutat rate approach sane neuron sane standard elit standard tournament neuron popul network popul tabl implement paramet method neuron sane requir smaller popul sane neuron evalu random combin popul small neuron particip network gener randomli select neuron network neuron popul neuron expect network particip rate network gener neuron popul neuron particip dictat network blueprint sane skew particip rate neuron leav neuron unevalu gener unevalu neuron blueprint build network experi run compar perform adapt analysi result experi averag simul perform analysi experi test learn speed solut qualiti evolutionari approach popul evolv khepera simul gener network robot random posit khepera network move robot hit obstacl maximum number exhaust fit network maximum euclidean distanc robot move start posit gener learn network gener test test set averag distanc test set defin perform gener learn curv plot perform found gener learn curv show qualiti solut expect gener figur show learn curv perform analysi tabl show averag number gener reach specif level distanc test set sane neuron sane standard elit standard tournament tabl averag number gener reach desir level distanc posit test set sane requir gener averag gener network averag cm distanc test set sane evolut effici requir half evalu standard approach reach top level perform standard approach aggress select strategi perform poorli search found good network stall poor characterist converg search search converg good tweak mutat great network remain stuck suboptim solut experi confirm network level tournament select select strategi sane perform effici find network averag cm distanc half gener standard tournament search half gener standard elit search unlik standard elit sane aggress search consist sane simul return final network averag cm sane suscept prematur converg aggress evolutionari algorithm oper popul neural network version sane effici sane earli unabl maintain effici gener mechan propag knowledg good network difficult neuron sane build network poor late perform strong evid problem effect show contribut network blueprint evolut neuron sane perform compar standard tournament approach show differ curv statist appli singl tail find confid interv differ sane approach gener sane neuron sane standard elit standard tournament figur comparison learn speed evolutionari approach distanc refer averag distanc posit test set network found gener distanc averag simul simul run point standard approach began plateau learn curv demonstr effici gain neuron blueprint popul differ averag distanc gener neuron standard elit standard tournament statist differ perform sane gener approach analysi experi test level popul evolut goal test demonstr differ standard approach popul evolv gener popul measur gener averag ham distanc divid length popul length ham distanc chromosom repres probabl bit specif posit chromosom bit posit chromosom random popul probabl bit posit differ figur show averag level gener converg standard elit approach dramat bit posit ident phenomenon lead evolutionari algorithm implementor aggress select strategi conserv approach tournament select tournament standard approach converg gener bit posit ident sane neuron sane maintain popul confirm hypothesi sane perform aggress search maintain high level aggress balanc core sane search strategi set current approach sane improv network gener demonstr adapt chang environ adapt analysi experi test abil approach adapt domain popul evolv gener experi back sensor khepera robot popul evolv gener sensor set constant obstacl rear robot popul learn ignor malfunct sensor reli back sensor experi design give realist situat adapt behavior figur plot learn curv simul adapt analysi axi repres differ perform rel perform level achiev malfunct sensor horizont line axi repres point search achiev gener sane neuron sane standard elit standard tournament figur popul simul approach maintain high level approach converg singl solut perform domain chang rel distanc plot absolut distanc approach achiev level perform gener converg popul adapt popul sensor approach lost amount approxim cm distanc averag sane quickli match surpass previou perform averag gener neuron sane requir gener fulli adapt standard approach achiev perform level reach correct sensor gener perform sane neuron sane demonstr evolut popul capabl quickli gener solut task environ evolut limit gener structur time manner analysi symbiot neuron section sane neuron converg singl form subpopul fill import role neural network gener sane neuron sane standard elit standard tournament figur adapt comparison evolv back sensor fix graph plot differ perform perform previou gener experi section illustr process context khepera describ neuron special emerg princip compon analysi order visual sane method displai neuron princip compon analysi tool visual rel distanc vector pca perform coordin transform set data point dimens chosen direct varianc data chosen perpendicular account remain varianc dimens princip compon chosen similar fashion final result coordin system order varianc pca perform reduct data reduc data point pca run determin dimens maximum varianc data point plot coordin coordin result plot account data varianc dimens initi function vector nil build neural network neuron hidden unit input unit set input propag activ output layer append output layer activ function vector tabl step comput function neuron function vector repres actual function neuron perform neural network pca reduc genet chromosom plot approach pca reduct vector princip compon captur data varianc compon accur repres plot pca plot raw genet chromosom accur repres function similar neuron similar genotyp produc similar phenotyp network hidden neuron ident bit weight differ bit posit label allel creat vastli network architectur pca plot base chromosom neuron place close function differ strategi comput function vector neuron describ role neural network function vector reduc pca result accur visual neuron role gener neuron implement hidden unit network network output layer activ record function vector captur neuron input unit activ unlik basic chromosom function vector repres direct behavior neuron neural network function vector produc function term task khepera task output layer activ interpret motor command output layer definit section activ translat motor command function vector creat accur effect neuron robot final function vector consist dimens reduc dimens pca preserv varianc figur plot function neuron popul simul khepera task simul produc similar plot snapshot popul gener gener show fairli uniform distribut reflect initi random popul popul neuron begin cluster form subpopul special final special distinct graph plot neuron includ top network gener graph show network util neuron subpopul demonstr special plai activ role neural network addit subpopul plot exampl neuron locat cluster isol neuron neuron creat member special function isol neuron pca demonstr sane build neuron role exist role neuron pioneer explor neuron role effect role subpopul neuron form isol neuron phenomenon figur gener singl neuron exist point popul neuron begin cluster lead origin neuron discov valuabl neuron role pca analysi confirm hypothesi sane evolv type neuron singl popul popul neuron merg special optim aspect neural network special provid suffici form neural structur special phenomena uniqu evolutionari approach coevolut evolv separ speci segreg subpopul island sane form motor differ posit neg direct multipli maximum motor gener gener gener gener gener neuron top network network network network figur pca simul posit pca graph necessarili correspond posit pca graph dimens determin separ plot gener held true neuron point gener similar function neuron point gener tion natur singl popul advantag inher produc explor search lesion studi emerg special clear pca function labor understand role special neural simul lesion studi conduct lesion biolog neural network identifi function function area brain lesion result loss brain conclud lesion area involv carri function similar experi perform artifici neural remov neuron observ behavior modifi network figur show close final pca popul simul special repres network final gener label group neuron current lesion experi interest special includ top neural network type lesion experi conduct specif neuron neuron capabl test neuron necess test capabl neuron implement form entir hidden layer experi design show function neuron aid neuron popul capabl test effect demonstr singl neuron perform entir task test necess neuron function neural network remov necess test show crucial specif neuron perform neural network tabl show neuron includ final network fit perform lesion test network neuron special neuron number repres singl point figur member special special label neuron form effect hidden layer capabl highest score neuron achiev perform level euclidean distanc khepera perform entir network neuron neuron figur principl compon analysi neuron popul final gener special includ top network label gener robot rapidli direct neuron spin move straight line neuron move straight nearest wall capabl test number illustr symbiot natur sane neuron popul special repres function presenc neuron hidden layer necess test show import neuron network neuron lesion perform case consist drop demonstr neuron serv import role neuron similar special exhibit similar perform degrad lesion neuron member special lesion result perform neuron neuron explan dispar neuron encompass neuron function neuron weak member special confirm experi conduct entir special lesion network figur summar perform number special lesion experi member neuron rank special capabl necess tabl lesion result simul neuron top network implement lesion network result network test khepera task complet network achiev perform level capabl test show neuron perform entir task necess test show network robust neuron plai import role tion network experienc dramat perform drop differ perform member lesion perform neuron lesion confirm neuron provid function special result previou necess function loss neuron neuron weak member special understand actual function motor specif sensori analyz tabl show motor neuron sensor activ robot motor output activ shown output number repres activ robot motor neuron give attent singl sensor direct chang output sensor activ neuron produc consist motor activ left left sensor activ output illustr neuron demonstr sensor neuron respond type elicit capabl neuron robot move straight line lesion special perform tabl special lesion member special remov network result network test khepera task complet network achiev perform level special crucial achiev network top perform implement behavior repres motor output activ tabl neuron provid consist posit activ robot move forward differ constitut differ special sensit sensori input neuron reduc posit motor activ left sensor activ neuron forward sensor activ elicit neuron slow robot sensor activ neuron provid thrust robot long slow robot obstacl present neuron provid actual obstacl avoid slow robot special perform turn neuron member special neuron provid strong posit left motor strong neg motor activ robot spin fast direct special evolv symbiot relationship special spin robot direct net result robot spin balanc attain motor activ explain perform drop neuron exclud special respond activ front sensor reduc left motor motor activ reduc spin robot begin turn direct effect special veer robot left avoid object front special mirror special veer robot avoid object left motor activ specif sensor neuron rank special left forward rear tabl individu neuron specif sensori input output number refer speed neuron drive left motor neuron receiv input front gener motor output neuron specif pca graph plot distinct subgroup proxim special exhibit motor special reduc normal spin sensor activ normal spin modifi spin neuron strong special neuron mutant special spin make robot make turn object left shown necess network perform poorli neuron remov special similar relationship special neuron special special neuron spin robot counter direct reduc spin left sensor activ magnitud spin special fine tune turn role neuron top network forward activ slow object left veer robot avoid object left veer robot left avoid object small object left addit spin special veer robot left avoid object forward activ balanc spin neuron slow robot object front veer robot avoid object left lesion studi conduct khepera simul produc similar result separ special evolv control forward left turn simul evolv neuron special produc motor activ sensori input neuron effect network behavior evolv exist special suffici solv task import note neuron role redund special neural network special maneuv object left member includ final network suggest sane develop minim set distribut import function neuron multipl special produc robust damag singl neuron overcom redund function neuron shown tabl loss neuron result dramat drop perform lesion studi demonstr symbiot natur sane neuron neuron perform neuron achiev network top perform level studi confirm hypothesi sane perform parallel search subgroup neuron popul analysi role special show clear labor largest forward motor left turn turn neuron subpopul special refin major sane continu improv special parallel search set sane exist approach sane effici solv difficult problem relat work section relat sane symbiot evolut approach numer exampl coevolut highlight method maintain problem evolv partial solut cooper form global solut search behavior symbiot evolut similar implicit fit share genet algorithm smith al smith grai immun system smith grai evolv artifici recogn match artifici match popul guard varieti genet algorithm model base competit cooper compet surviv subpopul recogn fit individu reflect match cooper individu depend recognit interact implicitli competit horn al differ weak cooper strong cooper approach similar effect term popul research discov rel strength weak method smith method learn classifi system map neural network hidden node repres classifi rule compet hidden node competit evolut perform neuron level network level unlik pure approach entir popul neuron repres final solut subpopul repres solut implement variant cascad correl algorithm comput fit level neuron neuron fit level activ correl correct output neural network base credit assign correct current implement reinforc primari direct sane sequenti correct behavior unknown potter de jong develop symbiot evolutionari strategi call cooper genet algorithm appli neural network system potter de potter evolv partial solut distribut individu differ sane individu singl evolv special distinct subpopul island member subpopul elimin destruct recombin domin remov special evolv distinct subpopul place heavier burden priori knowledg number special form effect complet solut number distribut special determin implicitli evolut network hidden neuron requir type hidden neuron sane evolv special redundantli select final network subpopul repres share inform forc find redund special independ potter de jong method automat determin number partial solut increment ad random subpopul approach motiv research compar singl popul increment subpopul approach applic sane evolutionari search sane scale real world applic section describ applic demonstr sane scope scale potenti applic approach paper engin occur input output layer game tree search minimax search standard method game tree search minimax reli heurist evalu function inaccur mislead gener error propag tree minimax select poor move sane implement gener neural network serv filter inform lead good sane network implement world champion program bill significantli improv perform sane applic game plai demonstr develop advanc wide studi problem control chao week burgess appli sane difficult task control chao unstabl system chao dynam behavior unpredict long period obei simpl law chao control appli small perturb system variabl achiev stabil fix point chaotic behavior futur system behavior easili accur predict week burgess demonstr sane effici evolv neural network control chao unstabl system unlik exist method requir knowledg underli system sane form network simpli trial error rel stabil system feedback sane method shown stabil system stabl state result show sane effect control chaotic behavior applic unstabl system includ system poorli understood robot arm control neural network applic robot arm control learn coordin train method backpropag conjug gradient descent requir train exampl demonstr correct map input output current approach gener train exampl robot arm control limit ineffect uncertain domain learn techniqu integr target reach obstacl avoid requir exampl learn intermedi joint rotat avoid obstacl simpli trial error movement appli simul robot sane learn maneuv random obstacl reach randomli place target sane learn system successfulli combin target reach obstacl avoid strategi robot arm futur work symbiot evolut uniqu connectionist provid insight area machin learn applic emploi symbiot evolut evolv rule base classif current machin learn techniqu directli induc share intermedi concept multipl typic intermedi state categori anim classif mammal concept share learn separ specif mammal share advantag classif accuraci categori appli gener knowledg attain categori possibl unfamiliar categori symbiot capabl form share intermedi concept simultan evolv rule classifi multipl categori initi random rule subpopul rule select form domain theori domain theori evalu theori refin measur accuraci domain theori amount refin evalu score domain theori particip rule process select evalu random subpopul repeat rule averag util crossov mutat oper appli form rule base share intermedi state gener requir theori refin produc accur evolutionari pressur select cooper rule connect form share intermedi concept symbiot evolut gener applic neural network compat approach emerg natur current neural network collect hidden preliminari experi type popul individu network unsuccess import facet sane neuron form complet input output make neuron primit solut sane form architectur neuron provid crude solut neuron perform function fix problem crude solut preliminari studi simpl classif task uncov subsumpt behavior sane neuron import focu futur research analyz function evolv hidden neuron studi algorithm offer altern standard ea method dynam control task method aggress search discourag converg suboptim solut popul adapt readili fluctuat environ sane system incorpor search strategi call symbiot evolut form neural network difficult task compar standard approach mobil robot sane form solut maintain higher level popul adapt domain shift princip compon analysi lesion studi illustr sane neuron special singl popul fill role special heart sane search effici reduc solut space sane search parallel decomposit complet neural network maintain high level search coupl outer loop blueprint evolut extend difficult problem refer evolv genet algorithm connectionist learn artifici life ii ma intellig artifici select massiv parallel genet algorithm fourth intern confer genet pp san ca morgan kaufmann de analysi behavior class genet adapt system phd ann mi learn architectur advanc neural inform process system pp morgan san ca genet algorithm optim machin learn ma compar analysi select scheme genet algorithm foundat genet pp genet algorithm share multimod function optim intern confer genet pp san ca morgan kaufmann learn sequenti rule simul model competit machin adapt natur artifici introductori analysi applic control artifici intellig michigan ann mi implicit nich learn classifi natur evolutionari princip compon analysi ny genet gener weight architectur neural network intern joint confer neural vol pp ny ieee develop world class program artifici khepera simul version user manual html mobil robot tool investig control algorithm intern symposium pp japan symbiot evolut neural network sequenti task phd depart comput texa austin evolv neural network focu minimax search twelfth nation confer artifici intellig pp wa mit press effici reinforc learn symbiot evolut machin evolv obstacl avoid behavior robot arm anim fourth intern confer simul adapt behavior pp cape ma grow neural network artifici life iii ma theori refin combin analyt method artifici comput artifici design analysi comput model cooper coevolut phd georg mason de evolv neural network collabor speci summer comput simul confer canada de approach learn sequenti rule sixth intern confer genet algorithm pa learn classifi system type neural evolutionari search cooper popul genet algorithm evolutionari genet strategi tech rep depart engin scienc alabama explor symbiot search space master stage depart comput netherland evolv artifici neural network control chao phy rev cooper competit genet evolut radial basi function center width time seri predict ieee transact neural network genet reinforc learn neurocontrol problem machin
ML/1524 6 current state art distribut autonom mobil robot lynn parker center engin scienc advanc comput scienc mathemat oak ridg nation oak ridg tn usa distribut cooper system abstract research progress distribut robot aspect system explor articl survei current state art distribut mobil robot system focu princip research demonstr physic robot implement identifi primari research topic system biolog object transport motion reconfigur learn discuss current state research area describ research identifi kei open issu team research conclud identifi addit open research issu distribut mobil robot system introduct field distribut robot origin research began investig issu multipl mobil robot system prior research concentr singl robot system distribut system involv robot compon topic interest earli distribut robot work cellular robot work al cellular robot system work cyclic swarm motion work traffic control work movement format al wang architectur work al earli research distribut mobil field grown wider varieti topic address paper examin current state art autonom multipl mobil robot system field cooper autonom mobil robot topic area domain consid matur area explor commun begin understand develop control aspect team summar research taxonomi system dudek cao previou relat organ research princip topic area gener level extent limit space present identifi kei open research issu topic area conclud suggest addit research issu extens grow interest distribut autonom system biolog inspir work cooper mobil robot began robot paradigm control paradigm strong influenc cooper mobil robot research paradigm mobil robot root biolog cooper robot research found instruct examin social insect appli find design system common applic knowledg simpl local control rule biolog societi bird develop similar behavior cooper robot system work vein demonstr abil team follow trail applic dynam ecosystem appli develop team demonstr emerg cooper result act selfish interest cooper higher wolf gener advanc cooper control studi system primarili simul competit found higher anim includ begin studi domain soccer area biolog inspir applic team fairli understood recent biolog topic relev includ imit higher detail analysi type biolog system bergen call differenti relationship cooper robot work anim learn physic interconnect demonstr insect ant enabl collect navig challeng terrain commun issu commun team extens studi incept distribut robot research distinct implicit explicit commun implicit commun occur explicit commun specif act design sole convei inform robot team research studi effect commun perform team varieti conclud commun benefit type task research found commun small amount inform lead great benefit recent work commun languag ground physic world work extend achiev fault toler set maintain distribut commun network ensur reliabl commun progress made recent issu work remain enabl team oper reliabl faulti commun environ task control great deal research distribut robot develop task plan control research area address issu action deleg author commun heterogen versu homogen achiev coher local resolut relat issu architectur develop multirobot team focu provid specif type capabl distribut robot team capabl emphasi includ task plan fault toler swarm control human design mission plan gener research question vein special ture type robot team applic domain gener architectur develop easili tailor fit wider rang system previou work aim unifi architectur architectur unwieldi implement practic applic remain singl gener architectur multirobot team develop applic wider varieti domain exist architectur explor extens amount research carri area explor singl autonom robot fairli recent work appli team work aim environ research exist algorithm develop singl robot extend multipl develop algorithm fundament distribut except work advantag multipl robot improv posit accuraci singl robot case singl robot approach research version familiar categori base landmark graph rang sensor sonar vision sensor singl robot version problem fairli remain studi version question effect team extent ad addit robot bring diminish return issu begun studi remain determin varieti approach explor object transport manipul enabl multipl robot cooper manipul common object goal system research project dealt topic fewer project demonstr physic robot system research area number practic applic make interest studi numer variat task area includ constrain unconstrain team versu compliant versu grasp clutter versu global system model versu distribut demonstr task involv cooper transport push object team task inher easier carri multipl robot grip common object navig destin coordin fashion form transport wrap object move trajectori previou work area work involv robot move flat surfac challeng open issu area cooper transport uneven outdoor terrain motion coordin popular topic studi team motion coordin research theme domain studi path plan traffic control format gener format issu fairli demonstr techniqu physic team limit recent issu studi motion coordin context target track target search dock behavior previou work aim work aim environ limit characterist exist path plan work comput complex approach comput processor speed comput time care characterist limit factor applic path plan research robot team reconfigur robot earliest research distribut robot concept reconfigur distribut system work area year recent work result number actual physic robot system reconfigur motiv work achiev function individu connect wai gener desir shape serv function system theoret capabl show great work area involv ident modul mechan manual automat reconfigur system demonstr form navig includ roll track motion snake motion spider motion system emploi modul connect wai form matric lattic specif function research area system develop perform simpl laboratori experi potenti larg number robot modul demonstr uncommon implement involv dozen physic modul practic applic system progress made direct rich area continu advanc multirobot system learn research approach potenti develop cooper control mechan autonom learn amount work area learn work accomplish date learn type applic typic studi area learn vari characterist applic includ box push forag soccer cooper target observ challeng domain learn task inher cooper task util action robot depend current action team member inher cooper task independ subtask solv distribut robot team success team execut measur combin action robot individu robot action type task challeng due difficulti assign credit individu action robot team member learn inher cooper task learn area research system remain addit open issu distribut autonom mobil robot clear incept field distribut autonom mobil robot decad progress made number import issu field good understand biolog parallel commun design architectur control progress made cooper object motion coordin recent progress begin advanc area reconfigur robot learn area fulli identifi kei open research challeng area previou section research challeng identifi quantifi fundament advantag characterist easili enabl human control scale demonstr involv dozen passiv action recognit team enabl physic system work hard complex task environ affect design issu cooper research commun busi year acknowledg work sponsor engin research program oc basic energi depart energi govern retain publish reproduc publish form govern oak ridg nation laboratori manag llc dept energi contract refer robert cooper martha project ieee robot autom suzuki avoid multipl robot virtual intellig robot system page ronald arkin integr world knowledg reactiv navig robot autonom ishida design autonom distribut robot intern workshop intellig robot page balch arkin format control team ieee transact robot decemb tucker balch ronald arkin commun reactiv multiag robot system autonom optim cooper knowledg sourc technic report boe ai august concept cellular robot ieee symposium intellig page hogg emerg structur robot ieee intern confer robot page rodnei brook robust layer control system mobil robot ieee journal robot march thrun collabor explor ieee intern confer robot page uni alex andrew frank meng cooper mobil direct intern confer intellig robot system page autonom modul reconfigur robot intern symposium distribut autonom robot system match algorithm cooper map autonom robot intern symposium distribut autonom robot system collect transport object unpredict environ sa symposium flexibl page ru distribut manipul multipl object ieee intern confer robot page alexi drogoul jacqu ferber tom thumb experi forag robot intern confer simul adapt page gregori dudek al taxonomi swarm robot ieee intern confer intellig robot system page thrun collabor explor autonom fukuda nakagawa dynam reconfigur robot system system optim page thoma hayn sandip sen evolv behavior strategi predat prei gerard weiss sandip adapt learn page collect ground robot intern confer distribut autonom robot system david jung alexand zelinski ground symbol commun heterogen cooper robot autonom juli vehicl coordin mobil manipul decentr cooper intern confer intellig robot page motwani find unpredict target workspac obstacl submit intern confer robot cameron multiag mission specif execut autonom bruce synthet approach studi commun interdisciplinari workshop synthesi simul live page mahadevan connel automat program robot reinforc learn page tamb experi acquir design robocup team annual confer autonom page maja matar design emerg tom local interact collect intellig proc intl conf simul adapt page mit maja matar interact intellig behavior phd massachusett institut david robot cooper intern confer simul adapt page mit behavior dock mobil robot intern symposium distribut autonom robot system stark commun fault toler distribut robot system intern symposium distribut autonom robot system parker adapt action select cooper agent team herbert stewart intern confer simul adapt page mit parker architectur oper ieee transact robot parker learn cooper observ task intern symposium distribut autonom robot system cooper multipl autonom mobil robot ieee intern workshop intellig robot page rao terrain model acquisit mobil robot team intern symposium distribut autonom robot system milio explor multipl robot intern symposium distribut autonom robot system rilei veloso behavior classif adversari intern symposium distribut autonom robot system bekei distribut local intern symposium distribut autonom robot system jen move furnitur team autonom robot intern confer intellig robot page ru physic implement robot ieee intern confer robot page daniel john bai develop materi transport system robot ieee intern confer robot page stone veloso layer approach learn client behavior robocup soccer server appli artifici design modular robot system ieee intern confer robot page wang navig strategi multipl autonom mobil robot intern confer intellig robot system page control method multipl robot system cooper object transport intern symposium distribut autonom robot system gerhard weiss sandip editor adapt learn system distribut data collect broken ad hoc wireless connect network mobil robot intern symposium distribut autonom robot system motion plan cooper transport larg object multipl mobil robot environ ieee intern confer robot page modular reconfigur robot ieee intern confer robot page dn micro robot system shape memori intern symposium distribut autonom robot system
IR/1525 5 hand transcrib retriev mark sanderson depart inform studi sheffield western uk abstract paper describ issu preliminari work involv creation inform retriev system manag retriev collect speech ordinari text document previou shown recognit ordinari document gener retriev prefer mean correct elimin observ bia subject paper initi idea preliminari result present gener term keyword inform spoken document mix collect introduct main stream inform retriev research remain homogen data collect progress multimedia trend search heterogen data collect grow mind intern digit project author work typic case research mind address issu peopl remot access great heterogen distribut multimedia digit librari audio data speech document order cope effect mass subset digit librari relev document search result obtain resourc fuse merg singl result mean resourc select data fusion achiev bia rank document collect relat weight scheme retriev model assum document creat equal presenc absenc queri word number time word occur document assum collect document length collect document creat collect ordinari speech collect depart inform studi sheffield western uk speech document recognit accuraci vari assumpt retriev spoken document view success speech recognit system accur retriev oper accept level spoken document retriev intern corpor web search engin word error rate audio document retriev relev document gener queri term high term frequenc long term occurr relev document retriev collect speech ordinari text tf document ordinari document retriev prefer problem found collect spoken audio document accur queri term higher tf badli framework mind assum remot digit librari provid uninterest unwil provid detail data content desir determin inform independ paper approach deal problem speech automat identif spoken document subsequ estim word error rate document inform document retriev score adjust ensur rank rest paper describ past work descript method system preliminari work outlin final conclud past work great deal research conduct retriev corrupt scan text speech translat foreign languag problem queri term occurr import address past work document singhal multipl discuss document work investig notion vari level corrupt retriev reason expect variat sanderson crestani briefli address problem retriev collect ordinari spoken document report convent weight ordinari document retriev prefer spoken document research area cross languag inform retriev commun retriev collect document written languag requir translat accuraci poorli translat document retriev effect method deal situat identifi languag document rank algorithm base train data deriv cross languag test collect report problem techniqu assumpt corrupt translat error consist document assumpt corrupt recognit mind method mean provid fair rank deal collect document ordinari spoken document spoken document vari level accuraci requir spoken document identif method estim word error rate spoken document identif spot piec text written automat view spoken document identif form languag identif identifi kind languag document written techniqu appli languag identif train word charact base model output ordinari surfac cue document identifi output speech recognit speech gener insert punctuat fine granular level clear boundari sentenc paragraph raw speech data human correct examin ratio punctuat ratio letter provid suffici clue identif task solut check document common spell mistak speech work vocabulari misspel word total word total punctuat sophist approach determin document word lexicon speech lexicon lexicon method gener appli tabl show preliminari result compar punctuat upper case word speech hand transcrib file collect show magnitud differ percentag punctuat speech hand transcrib collect punctuat speech document full stop mark hand transcript evenli distribut parenthesi question mark full stop examin speech full stop address finish sentenc abbrevi strictli count full magnitud differ punctuat percentag affect includ speech document experi format file word capit letter true speech file lower case letter experi cover situat extrem high low rate upper case word indic speech document identif word error rate estim document identifi gener stage determin error transcript speech convent method measur word error rate compar output accur hand transcript situat anticip transcript seek automat method estim error speech determin sequenc word spoken addit acoust model modern sr system languag model deriv larg corpora determin word sequenc set phonem model appli small slide window utter word effect improv recognit qualiti incorrectli model produc text level word pair tripl make form word sequenc world poor speech world unlik win word pair view percent punctuat total upper case word percent upper case word speech file hand transcript tabl comparison punctuat upper case word speech hand transcrib file search text unusu word pair tripl estim wer fruit examin attribut document local context method base observ made retriev experi previou work author ordinari document found retriev prefer speech reason lower tf queri term document compar hand transcrib sr system fail occurr document word replac word postul poorer recognit accuraci audio greater number singl occurr word transcript produc test small initi experi conduct trec sdr collect approxim short document transcrib report averag number occurr word document comput averag number calcul document collect result singl provid simpl measur word repeat collect document effort sdr track particip transcript sr run made fellow particip hand share run experi report al wer run vari run error rate list tabl rank wer averag term occurr measur transcript score hand transcript comput result shown tabl transcript order score hand transcript word rare score notabl except nist rank system wer closer examin nist transcript reason high term occurr measur due word low idf repeat time document experi repeat highest frequenc word measur result experi shown tabl occurr rate measur lower expect remov frequent simpl correl rank produc alter measur closer rank system descript wer hand transcript audio data cu htk cambridg htk toolkit dragon massachusett dragon system att nist nist system shef sheffield system nist nist system defenc evalu research uk defenc evalu research uk rank system wer rank cu htk att nist nist dragon shef tabl sr system rank term occurr measur tabl descript wer sdr sr system rank system wer rank cu htk nist att dragon shef nist tabl system rank modifi occurr measur wer rate rank paper futur work paper retriev problem mind project initi work tackl import problem retriev collect document vari level error short experi show idea deserv investig rememb method illustr mean rank transcript desir mean determin level error rate singl transcript achiev challeng acknowledg work fund eu framework refer renal broadcast document ieee pp js hoc multilingu inform retriev seventh text retriev confer novemb js em ba spoken document retriev track overview darpa broadcast john ellen trec spoken document retriev success text retriev confer novemb scan document document european colloquium ir april automat languag identif june languag june resourc select data fusion multimedia intern digit june steve renal dave sdr system june mark sanderson fabio merg spoken document european confer digit septemb lectur note comput scienc springer germani ma mj st jone ag experi spoken document retriev text retriev confer novemb amit fernando speech sigir van david anna beth pedro moreno michael speech recognit base audio index system intern confer inform recherch par april pp pedro jm van beth blair matthew search index multimedia ieee confer compaq spoken document retriev
IR/1526 5 text jonathan comput scienc dept univ san diego la ca abstract paper describ implement relev text implement search engin perform keyword queri request user user requir user score document result set relev irrelev implement adaboost algorithm word separ relev document random document set exampl neg document set test queri refin queri present result system keyword request context keyword prove construct queri refin term predict system return notic result result inexact fit design adaboost capabl googl back end engin motiv text search engin good job index retriev document keyword experi googl found difficult queri answer engin keyword queri limit abil user effect queri easier user provid sampl formul queri retriev document interest user provid posit sampl inform queri small set keyword posit sampl set queri consid user exampl engin find similar document reason failur keyword improv addit inform posit sampl set keyword queri fail desir result hidden requir keyword paper queri goal present queri search engin find inform larg number guitar descript analysi consid great complex condit difficult keyword result lower result match hidden return great util search engin attribut abil correct hidden condit relat keyword searcher tend document peopl found document link result found posit set qbe inform hidden requir queri discov arbitrari hidden requir significantli improv keyword queri perform poorli vocabulari queri overli limit queri guitar call guitar player call number word place keyword queri effect select subset document talk good standard inform retriev issu synonymi reduc recal set posit exampl discov wider rang vocabulari deal desir topic word separ posit set random set document corpu good search term posit sampl set good gener search term topic user locat background qbe imag retriev product sourc qbe research imag textual descript creat textual descript larg set peopl investig altern keyword base search imag impress approach imag retriev introduc viola produc react small subset imag adaboost select featur separ small posit sampl set imag slightli larger set neg exampl posit exampl consist sampl neg exampl consist randomli chosen imag author mention similar structur natur languag natur languag document larg featur word empir studi natur languag word distribut suggest word highli select featur suggest techniqu qbe work text queri deal textual qbe call relev feedback usual approach keyword result opinion result refin initi queri qbe strongli relat text filter text classif adaboost text filter favor result problem subset text classif posit larg featur train fast condit suggest support vector machin classifi prove effect adaboost algorithm adaboost introduc schapir method combin classifi creat weak learner creat stronger classifi algorithm proven converg error train set assumpt learner adaboost requir set posit neg exampl weight import normal adaboost weight initi assign adaboost call weak learner algorithm return classifi input exampl classifi ad set classifi gener exampl exampl classifi misclassifi boost classifi simpli combin weak classifi weak vote weight classifi influenc weak learner learn algorithm gener classifi correct half exampl gener wide varieti classifi class predict artifici correl viola modifi implement adaboost spread half weight posit sampl half weight neg sampl dispar sampl size felt result correct word exist weak classifi exist word document weak binari arbitrari set posit document neg document pick arbitrari word exist basi classif pc nc count posit exampl word neg exampl pi ni count incorrect classif base word accuraci classifi accuraci greater exist word weak classifi posit sampl accuraci exist word weak classifi neg sampl accuraci case word weak classifi weak learn algorithm system simpli examin word posit neg exampl word classif accuraci farthest accuraci lack word classifi exist word search word exist weak weak classifi return suffici practic ti classif error broken calcul total score ty word posit exampl word highest score stand term document frequenc term frequenc number time word document document frequenc total number document posit neg set df df number document word occur fairli standard measur import term document tie break work favor term import document posit sampl set practic applic googl order test effect qbe creat wrapper search site user present keyword search screen enter keyword queri result return googl displai beneath rate option present user click result link view separ window user rate result point scale good bad distinct bad import addit option pure flexibl user evalu includ posit refin queri refin button posit rate result html tag strip plain text page extract neg includ neg rate construct set pass adaboost algorithm adaboost algorithm select singl word separ sampl return word submit googl search rate process begin construct neg set user hit refin button sourc neg exampl random sampl document internet provid good sourc neg exampl posit match random set user explicitli separ set close neg result set sampl report refin result hard queri neg sampl set random sampl document retriev spider start random document neg sampl user neg sampl user sampl queri refin good metric test result refin simpli present exampl refin mechan action interest reader system form opinion chose queri unabl find result set definit good result top return minut queri queri return definit good result margin depend unknown intern state queri engin margin result intermitt version page return good result margin result discuss guitar player good slightli topic interest result useless messag board real commerci site sell guitar relat list popular guitar player addit justif popular result set margin result neg exampl qbe algorithm posit result queri random neg guitar guitar texa australia music plai concert uniqu acoust blue uniqu texa bit record thousand bui record robert unfamiliar effect jazz johnson north plai park plai perfectli speed concert blue rai equal thousand impress internet tabl refin neg set neg sampl produc slightli result ad margin result repeat refin test sensit algorithm posit sampl set interest similar term posit correl posit sampl set result distribut posit neg sampl easier find word posit sampl neg sampl find word larg number neg sampl posit sampl tabl column hold word pick adaboost neg sampl set random repres random neg exampl includ margin posit document posit sampl random sampl set combin neg rank document neg neg rank document set result report tabl refin produc interest document posit result sampl document return origin result set algorithm sensit posit sampl expect number posit sampl small interest part result set word suggest refin origin queri word select random neg sampl provid origin queri addit margin good result result suggest possibl guitar music combin random neg rank exampl produc vocabulari separ close posit close neg suggest web page talk guitar player uniqu plai drew thousand site talk town neg rank result benefici intuit immedi suggest addit queri queri blue queri produc addit interest result intuit quickli led speed uniqu queri retriev good result top result duplic good result return origin queri result search weak setup setup obviou shortcom adaboost produc list weak classifi weight vote depend error classifi googl weight search inform lost difficult develop metric techniqu search process requir human aid refin step corpu understood advantag setup naiv user system difficulti base fairli familiar interfac difficult conclud firm refin mechan lack metric suggest queri term significantli perform compar origin queri refin process suggest reason keyword combin human keyword aid construct queri system form futur work chose random document neg sampl random document provid suffici standard vocabulari weak learner algorithm make good choic result improv thousand neg exampl requir preprocess summari distribut hundr thousand document weak learn hard calcul classif accuraci summari difficult measur perform algorithm select document requir human creat sampl corpu human rate document posit sampl document set corpu benefit chang algorithm perform establish test larg group naiv user standard text classif corpora start point interest appli approach refin latent semant space random neg sampl set word vector space unigram bigram featur result compar unigram acknowledg charl elkan larg system design suggest googl search implement refin system web gener bite project googl permiss affili parallel url project prove fetch web page parallel refer yoav freund robert schapir experi boost algorithm proc intern confer machin googl thoma hofmann probabilist latent semant index research develop inform lau horvitz pattern analyz model web queri refin seventh intern confer user model acm christoph man hinrich foundat statist natur languag process mit robert girosi support vector train applic technic report robert yoram amit singhal boost rocchio appli text filter intern confer research page acm press paul viola boost imag retriev
ML/1527 6 autom robot behavior recognit appli robot soccer han manuela veloso comput scienc depart carnegi mellon pa abstract autom recognit behavior robot increasingli varieti develop autonom robot gener inform process agent environ multipl autonom robot make base behavior robot interest intellig narrat agent observ robot automat identifi robot behavior introduc framework hidden markov model repres recogn strateg behavior robot agent introduc perceiv signal term state featur show hmm captur defin robot behavior final present recognit algorithm orchestr select hmm real time robot soccer domain substrat empir simul real robot robot adapt behavior function autonom recogn behavior teammat oppon introduct intellig autonom robot perform task behavior assum robot act set fulli partial agent abil observ robot autonom identifi behavior robot perform question drive work report paper situat work domain robot potenti advantag predict agent behavior robot soccer develop simul real robot import aspect oppon model develop simul real robot physic robot agent comput control onboard radio commun simul real agent fulli human oper game start robot simul agent observ state includ posit select action base observ state make possibl limit memori process past state infer includ agent intern state state observ predict lowlevel action coordin current predict locat concern level extract strategi behavior observ markovian exampl behavior main task autonom analysi agent behavior adapt strategi team robot individu robot chang strategi function recogn behavior agent automat recognit team strategi challeng problem repres instanc gener plan recognit problem uncertain nondeterminist domain aim repres recogn behavior narr agent research aim develop autonom narr agent soccer agent high behavior level provid interest midfield dribbl goalkeep align ball pass intercept ball shoot paper contribut hidden markov model recognit robot behavior observ view perceiv robot perform process algorithm inspir high conceptu level abstract level tempor nondeterminist signal understand speech music recognit work cast develop recognit robot behavior robot behavior hidden markov model base approach hidden markov model recognit speech recognit gestur recognit robot skill learn paper organ section discuss behavior model follow briefli present robot soccer framework describ robot perceiv signal behavior recognit section introduc behavior hidden markov illustr exampl formal introduc gener behavior hidden markov model independ domain section present detail recognit algorithm section show illustr approach multipl behavior experi perform simul real robot section conclud paper behavior approach input robot signal robot observ observ robot agent situat oper world act reaction environ observ intern state os goal infer rs perceiv rs physic action state recognit goal futil process knowledg rs intern endless possibl behavior perform state problem behavior membership act set behavior act reactiv behavior match current state model set behavior perform hmm suitabl recognit intern state observ agent natur state featur provid observ hmm introduc perceiv state robot soccer robot soccer mobil robot number robot move ball global vision system captur locat object soccer field time depend team robot robot state encod locat orient ball state encod locat veloc discret dimens time seri time granular depend speed vision sec success read goal recognit algorithm time seri gener scene descript major applic algorithm gener algorithm onlin algorithm repres behavior hidden markov model overview hidden markov model describ adapt model behavior recognit hidden markov model system repres set discret state time system state state transit place probabl distribut transit probabl js state transit denot ij state system time directli observ set state depend observ variabl necessarili set continu distribut state observ probabl defin discret continu robot soccer domain natur complex agent behavior exponenti number agent work found robot behavior robot limit number agent ball proce describ appli hmm behavior recognit robot soccer domain unobserv observ environ hidden markov model consist discret set state discret set observ applic hmm behavior set markov state correspond model mental state agent set observ correspond physic state agent explain behavior gener process agent situat environ make sensor input complex agent behavior broken stage robot execut behavior stage behavior behavior rotat front worth note stage behavior explicitli implement behavior model abstract potenti complex behavior hmm recogn behavior consist repres state probabilist state model system discrep model actual behavior markov state map physic worth note necessarili case physic locat markov state distinct model behavior hidden markov result model unnecessarili complex algorithm hmm execut concurr recognit hmm structur behavior behavior hmm consist type ffl initi state state robot start execut behavior complex initi state ffl accept state success complet robot accept state accept state serv signal success detect ffl intermedi state complex behavior number intermedi stage stage captur behavior hmm intermedi state reach accept state initi intermedi state ffl reject state naiv behavior recogn give ambigu output observ gener behavior hmm partial includ behavior reject state serv label state behavior reach behavior recogn detect robot front recogn give reject state high signifi robot highli state relev behavior singl reject state fall state recognit mean sequenc conform definit behavior hmm figur show hidden markov model behavior behavior hmm type state initi intermedi accept reject state initi captur state robot ball robot move closer captur transit robot state continu move closer transit robot move ball captur reject state robot move close ball move behavior accept state repres complet behavior robot transit state state transit denot arrow probabl transit predefin observ identifi figur figur behavior repres behavior hmm observ featur extract observ gener locat object field natur gener method depend behavior recogn gener fall ffl absolut posit locat object directli comput continu space segment correspond ffl object rel rel locat object rel object comput behavior robot ball robot ball base continu segment space finit ffl dynam dynam properti object comput robot behavior guid predict measur extend kalman filter recogn recogn emploi similar techniqu ball veloc segment robot rel locat region probabl observ captur observ fb figur show observ behavior hmm region rel ball segment region concentr circl region label robot locat insid region trigger respect observ ball figur observ behavior hmm formal behavior hmm formal augment version hmm call behavior hidden markov model behavior hidden markov model ffl fs initi intermedi accept reject state union accept reject state ffl fo observ space ffl fa ij state transit ij js ffl fb observ probabl ffl initi state distribut behavior recognit question perform behavior recognit state directli infer probabl state state probabl likelihood correspond state actual mental state robot type behavior show high accept probabl time behavior necessarili mutual order intercept robot ball show high accept probabl robot observ question observ sequenc probabl interest jo hidden markov model paramet jo ff jo ff ff ff comput ff ff ji behavior segment restart assumpt requir behavior sequenc state assum behavior start initi complet accept state execut robot idl start execut complic thing robot termin execut behavior start execut possibl behavior hidden markov model recogn singl execut provid instanti time real behavior start execut behavior reliabl recognit longer akin word segment speech perform behavior segment order appli hmm robot soccer domain unlik speech segment robot behavior defin execut sequenc robot behavior continu easili perceiv behavior hard segment point behavior scheme segment problem chose instanti recogn regular interv spend effort search segment point success execut ignor point hope recogn instanti point time close behavior start time granular interv interv result recogn miss begin behavior instanti regular number control recognit system run continu soccer game updat larg amount overload processor mechan remov system separ scheme determin remov timeout set type behavior assum behavior amount time discard hmm reach high probabl reject state robot continu updat figur robot trajectori algorithm ffl behavior recogn type instanti initi copi record start time mark instanc activ ffl forev obtain object locat vision system activ behavior recogn comput current observ vision data updat current state probabl state updat find state signal continu recogn instanc reject signal mark instanc inact continu recogn instanc comput time instanc larger timeout threshold mark instanc inact instanti behavior recogn type instanti initi copi record start time mark instanc activ result algorithm implement implement robot trajectori behavior shown figur robot attempt moment abort behavior head ball behavior hmm instanti manual recogn order facilit illustr simpl restart mechan close ball region ball ball region reject figur behavior hmm probabl instanti time robot start execut behavior result behavior hmm figur result singl run behavior hmm figur set result show run recogn restart robot trajectori shown figur trajectori continu execut behavior robot start leav ball ball figur show trace output behavior hmm instanti bar correspond life span section show chang state time white section black section accept state short section cross denot reject state reject automat shift posit denot period instanti behavior set set intermedi robot arriv state show accept robot leav behavior longer conform specif immedi reject creat captur execut behavior successfulli captur complet behavior reject end recognit hmm behavior predict intermedi state probabl indic behavior progress anticip futur state robot robot soccer game address challeng problem autonom robot behavior recognit observ state featur paper contribut formul robot behavior hidden left side ball side ball front ball reject close ball region ball region ball reject ball accept figur behavior hmm probabl markov model state hmm correspond abstract decomposit robot behavior transit state probabilist achiev observ world state introduc behavior hmm final paper present recognit algorithm orchestr multipl behavior repres hmm algorithm test simul real robot illustr experi shown demonstr perform recognit algorithm refer balch rc arkin commun reactiv multiag robot system autonom kim charact design soccer commentari minoru asada hiroaki robot soccer world cup ii springer mike peter manuela veloso predict memori inaccess environ work note workshop novemb rodnei brook robust layer control system mobil robot ieee journal robot han manuela veloso reactiv visual control multipl robot agent intern confer robot figur robot trajectori accept state reject state state time hmm instanc figur behavior restart yang al hidden markov model approach skill applic telerobot ieee transact robot octob hiroaki milind peter manuela hitoshi itsuki minoru asada robocup synthet agent challeng fifteenth intern joint confer artifici page san morgan kaufmann christoph lee xu interact learn gestur interfac ieee intern confer robot page maja matar interact intellig behavior mit eec phd thesi mit ai august lr rabin tutori hidden markov model select applic speech recognit volum page feb milind tamb agent architectur practic teamwork menlo aaai press manuela peter han world champion team ai
IR/1528 5 adapt algorithm inform extract text fabio depart comput sheffield uk abstract algorithm adapt inform extract text induc symbol rule learn corpu tag sgml tag induct perform exampl train corpu train perform initi set tag rule addit rule induc correct mistak tag shallow nlp rule flat word structur gener coverag unseen limit data overfit train phase experi publicli corpora algorithm outperform algorithm present literatur test corpora experi show gain nlp term effect reduct train time train corpu size paper present machin learn algorithm rule induct focu strategi prune search space final rule set introduct gener agreement main barrier wide commerci inform extract text difficulti adapt system applic classic system reli approach base natur languag process al grishman current system requir involv expert applic develop limit wider accept internet backbon afford hire specialist reason interest appli machin learn order build adapt system ml approach order reduc amount work nlp expert port system free text base scenario miller al al year inform extract text progress text muc confer due reduct strateg fund potenti applic web realm web central role text usenet post web page structur html document stereotyp element convei inform linguist intens approach classic system humphrei al difficult unnecessari ineffect case reason research stream adapt arisen converg inform integr machin learn goal produc algorithm system adapt knowledg knowledg califf muslea al freitag mccallum soderland freitag kushmerick result success commerci product creat interest internet market technolog effect appli highli structur html effect unstructur text free success algorithm tend avoid flat word sequenc appli unstructur data problem data relev size train data exampl qualiti data gener rule applic limit number overfit train affect effect unseen case paper present pattern languag adapt algorithm design stream research make shallow nlp order overcom data confront nl effect highli structur text algorithm outperform algorithm present literatur number testb focu machin learn algorithm rule strategi prune search space final rule set type induc rule learn rule set exampl mark sgml tag train corpu induc type symbol tag rule correct rule section present type rule algorithm section rule tag rule tag rule left hand pattern condit connect sequenc hand side action insert sgml tag text rule insert singl sgml make adapt rule recogn slot filler insert freitag multi posit exampl tag rule induct algorithm sgml tag insert user train corpu rest corpu consid pool neg exampl posit build initi gener rule gener initi rule main loop start select tag train corpu extract text window word left word inform store word window transform condit initi rule word condit action insert tag seminar pm figur start rule nlp insert sentenc seminar pm condit creat initi rule retain rule part rule pool rule enter instanc cover rule remov posit exampl longer rule induct sequenti cover rule induct continu select instanc learn rule pool posit exampl void contextu rule appli test rule pool good result term limit effect term recal mean rule insert tag tag gener correct limit number rule match absolut reliabl condit requir select order reach accept identifi addit rule recal affect recov rule constrain applic make reliabl interdepend tag exploit constrain applic rule learn rule insert tag independ tag tag tag repres requir slot concaten linguist pattern presenc slot good indic presenc insert summar indic presenc singl tag rule model context reintroduc extern constraint improv reliabl rule reconsid low rule applic context tag insert rule rule close slot rule open close select rule call contextu rule rule insert tag capit word word rule report high reliabl close open appli rule recogn open exampl relat case intuit condit action word wrong tag move tag pm figur correct rule action shift tag wrong correct posit context found rule space applic anchor tag left opposit case tag reliabl contextu rule comput error rate rule tag rule set rule pool contextu rule correct rule tag rule appli test corpu report slot filler boundari detect typic mistak part time express reason induc rule shift wrongli posit tag correct posit learn mistak made tag train corpu correct rule ident tag pattern match tag insert tag rule action shift misplac tag ad initi correct rule shift pm shown figur induct algorithm tag rule shift initi instanc test select posit neg shift correctli assign count shift rule accept report accept error rate rule applic test inform extract word condit addit knowledg action index word lemma case tag art low seminar seminar noun low prep low digit low pm pm low verb low figur rule figur nlp knowledg test corpu initi contextu correct valid rule pool initi tag text contextu rule appli context introduc tag appli tag contextu rule match tag insert contextu rule correct rule correct final tag insert algorithm valid mean produc start tag close tag vice uncoupl tag remov valid phase rule induct algorithm type rule mention induc algorithm initi rule pattern match condit word string found window instanc rule import natur languag data due high flexibl natur languag form avoid mean produc big rule set rule cover limit number case rule set produc good result train limit accuraci test corpu problem overfit train hand system learn number rule cover unrel case found rule appli test time low hand rule set error train error prevent rule deriv correct exampl accept report error recal produc spuriou result test time import hand plain word surfac train order produc rule overcom data hand prune result rule set order reduc explain remaind section rule wai algorithm word condit action index word lemma case tag digit figur rule initi induc hand constraint initi pattern drop pattern reduc length form wildcard model case slightli differ pm pm model rule hand condit singl element relax inform shallow natur languag process associ addit knowledg word initi pattern morpholog lemma case po tagger userdefin dictionari condit element rule pattern relax substitut constraint word constraint part addit knowledg mention pm pm rule case rule wildcard implement strategi rule naïv version algorithm corpu gener rule parallel test separ train corpu error score calcul initi loop loop return loop distanc distanc current word tag insert collect figur basic algorithm figur pattern seminar pm window word rule action insert part pattern tag insert match insert tag field corpu rule appli report cover posit cover part input naïv comput term describ effici version algorithm gener specif beam search rule similar aq start model specif instanc gener rule empti rule match greedili ad constraint constraint ad increment length rule ad condit term figur show search space type case condit set word induct algorithm shown figur algorithm effect naïv effici rule test matter fact match rule comput intersect match gener make test order magnitud effici figur actual algorithm complex relax condit word rule pattern condit part addit knowledg word order introduc type algorithm figur modifi ruleset longer set rule deriv loop loop loop distanc distanc current word tag insert concurr lexic item final algorithm shown figur rule set prune figur final algorithm rule start initi rule prune perform effici reason reduc search space reduc overfit prune remov rule coverag overlap rule type high error rate perform poorli train report limit number match train easi behaviour test time order prune final rule set rule accuraci test maximum error threshold set user run algorithm rule pass test discard gener test longer consid consid reliabl addit constraint end train algorithm error threshold restrict rule select exclud rule test result reduc rule set train corpu stop prune moment reduct accuraci loop condit collect rule ruleset collect rule loop ru ruleset return return rule prune induct time cover case train corpu safe test time amount train data safe behaviour run time rule detect gener time depend stop search space rule reduc algorithm effici threshold minimum coverag set rule gener figur user set priori minimum coverag threshold threshold end train similar error threshold level prune base overlap rule rule coverag subsum gener remov select rule set goal determin minimum subset rule accuraci train corpu rule coverag subsum rule safe contribut final result irrelev type prune requir compar reliabl involv rule algorithm produc empti initi gener rule subsum rule error rate safe remov rule induct rule subsum error rate prune final error cover threshold subsum rule surviv rule prune process problem prune level rule cover set exampl error rate case heurist number cover case specif condit chosen condit train corpu provid evid rule reliabl rule requir sequenc word produc spuriou hmm srv rapier whisk speaker locat slot figur result obtain cmu seminar experi corpu train detail experi slot rapier slot rapier id platform titl applic compani area salari recruit state citi countri post date languag slot figur corpu train whisk obtain lower accuraci compar test limit subset slot result test time requir sequenc condit addit knowledg lexic rule gener condit select test lexic provid coverag test corpu result test number task figur effect reduc data number rule cover number case show english italian report result standard task adapt cmu seminar announc austin job announc task consist uniqu identifi speaker start end time locat seminar figur show accuraci obtain compar obtain state art algorithm outperform approach wrt rapier wrt whisk outperform approach wrt kushmerick wrt mccallum algorithm result slot task concern job announc outperform rapier whisk discuss main featur contribut excel experi singl tag correct rule shallow nlp process point discuss focu effect induc rule instanc shallow nlp process exampl train corpu reduc data captur gener aspect simpl flat word structur morpholog overcom data due word aspect relev morpholog rich slot ng speaker locat slot ng averag rule coverag select rule rule cover case rule cover case rule cover case figur comparison version corpora version ng languag po tag inform lexic categori principl type produc rule qualiti match flat word rule tend effect unseen case morpholog po tag gener nlp process perform equal unseen rule reli result appli success unseen case intuit confirm outperform version nlp pattern length test corpu speaker locat slot figur effect window size learn tag rule field affect window size speaker gen speaker gen figur effect train data quantiti cmu seminar task version converg immedi optim show posit trend nlp base version show overfit slowli converg compar result train corpu produc gener rule cover case nlp reduc risk overfit train exampl figur show avoid overfit speaker field rise train corpu ng present clear problem overfit effect exampl produc gener rule impli cover algorithm converg rapidli rule tend cover case mean exampl order rule reduc train corpu size figur show converg optim valu exampl accuraci ng slowli train reach accuraci half corpu train surprisingli role shallow nlp reduct data relev free text cmu highli structur document html note rule select phase adopt level nlp inform task experi text written mix english po tagger complet italian part input reach effect analog rule nlp inform automat discard final interest note rule pattern length affect accuraci slot longer pattern import inform monitor window size strongli influenc train time futur work success algorithm outperform state art algorithm scientif experi popular task outperform algorithm make nlp inform rapier whisk term accuraci cmu due tag correct base learn algorithm exploit nlp inform rapier tag approach tag step induc express rule make power wild randomli base compress rule mechan produc rule provid spuriou whisk sophist nlp work output parser rule data train lead low recal tag approach gener rule base tag phase tend sophist machin learn approach learn singl tag rule larg rule exampl learner poorli order deriv addit rule rule formal includ number wildcard contribut radic result type nlp preprocess slightli outperform experi opinion due combin effect contextu tag correct phase nlp relev complet comparison state art success basi build tool adapt applic commerci success number applic develop commerci compani number industri compani applic futur work involv improv rule formal express wild shallow nlp hand cascad entiti implement entiti class speaker class hand compat form shallow chunk preprocess text insert tag chunk border improv border reduc correct acknowledg develop naiv version la ricerca itali properti ml part paper publish common copyright associ comput linguist refer califf relat learn techniqu natur languag inform phd univ clair cardi method inform ai inform extract european confer artifici io press tag inform extract workshop machin learn inform extract text rule induct intern joint confer artifici intellig august shallow nlp adapt inform extract confer empir method natur languag process june freitag extract applic gener learn nation confer artifici intellig freitag extract hmm workshop machin learn freitag wrapper workshop machin learn grishman techniqu challeng inform multidisciplinari approach emerg inform mt springer verlag sheffield system proc messag understand confer kushmerick induct inform proc intern confer artifici multi increment learn system test applic medic nation confer artifici morgan kaufmann publish stone descript sift system proc messag understand induct inform proc confer autonom learn discoveri schapir singer boost algorithm proc eleventh annual confer comput learn theori inform extract rule free machin acquisit domain knowledg inform extract proc cole intern confer comput
ML/1529 6 indoor visual navig chen weng depart comput scienc michigan state east mi abstract investig navig hierarch optim subspac learn infer framework incorpor state visual attent mechan problem formul markov model realiz partit regress stochast partit tree map preprocess current input raw imag previou state current state control effici partit regress learn learn sampl learn reject scheme successfulli appli indoor navig increment markov nearest neighbor regress introduct progress made autonom navig mobil indoor outdoor sensori visual input import human driver earli navig system road road edg detect road region segment due variat condit natur road edg road region detect edg region base approach face robust problem handl varieti navig system emploi adapt rang simpl adapt color threshold complic learn mechan artifici neural network investig project develop adapt mechan outdoor drive environ navig system call design handl road adapt color classif navig system dealt structur road explicitli model constraint singl techniqu road detect fail road group kalman filter feedback control visual detect road featur observ meng kak work indoor navig hough transform detect edg intens imag fed neural network produc qualit output semant base plan system predefin type featur system type method requir human programm featur navig adapt environ learn process navig system belong perceptron train learn map input imag output steer signal autonom robin ann radial basi function neural network map input imag output steer signal neural network method simpl navig speed achiev successfulli test varieti condit road extens includ virtual camera drive lane transit intersect lane mark greatli enhanc adapt drive shown ralph subspac appli statist method directli imag belong type method requir predefin featur gain popular recent year start applic face recognit method appli navig independ group research hancock thorp global linear regress method outdoor road chen weng local adapt regress realiz partit tree gener automat train sampl time sampl queri learn sampl control vector local adapt regress method gener vehicl control signal learn accomplish increment low logarithm time local nonparametr regress stabl statist tool principl compon analysi handl space complex navig control global parametr regress mlp recent work demonstr perform comparison mlp show advantag call type method method learn directli imag intens pattern mlp artifici neural statist tool method develop autonom navig deal monolith view entir scene treat singl entiti case global view scene similar differ salient local part global view system state view correctli stateless system distinguish complex limit gener power present systemat framework system state defin learn onlin deal situat stateless system visual attent requir approach teacher defin state onlin preprogram control rule static control scheme learn scheme potenti handl complex navig challeng indoor navig remaind paper organ section show framework formul markov model realiz nearest neighbor regress nearest neighbor regress comput effici stochast partit tree shown section issu relat indoor navig discuss section section present result section compar approach futur work discuss section state markov model landmark import navig landmark actual object subpart scene capabl attend subpart scene train sampl deal complex visual scene fig show imag corner navig path robot imag similar judg entir imag context impli distanc small requir turn left subregion mark white box fig differ salient visual view error head comput global view shown fig local view shown fig comput slide imag direct assum pixel imag boundari white point high correl black point low correl larger white blob sensit view chang robot head direct translat depth camera fix top height white blob roughli sensit translat depth width roughli sensit chang head direct compar fig fig local view exhibit smaller blob global view sensit head direct translat depth height white blob fig smaller fig local view sensit time make left turn notic partial wall left end left wall corner local view advantag global view local view uniform wall global view partial select attent properli greatli facilit navig deal complex scene partial view chosen improperli system extrem difficult system automat determin attent window environ introduc train method train system local view base method method normal intens pixel directli requir human defin featur method publish advantag automat deriv featur train sampl adapt virtual incorpor local view autonom navig studi stochast machin method typic indoor navig global view suffici make navig time partial view difficult corner intersect system time local act differ global local problem solv system state histori inform system accept observ imag time denot space imag global view scene local view state current system vector compon equal intens pixel normal process linearli transform intens pixel pixel unit varianc system set state set predefin control signal navig set control signal attent select outcom system time consist observ outcom random covari time vector present past input imag past figur state show imag corner white box attent window attent imag shown show correl imag pad peripheri resiz spatial resolut fx defin regress function jd random mathemat expect markov model goal estim eq markov model rewritten train set consist tripl form total number learn sampl current previou current outcom effici high partit tree approxim function denot sampl learn set input output train sampl sampl nearest neighbor base nearest neighbor estim euclidean space wide function nearest neighbor estim approxim markov time seri nonparametr includ kernel estim nearest neighbor predict markov time jx successfulli appli nearest neighbor estim predict time seri gener converg nearest neighbor estim jx markov time seri prove converg properti prove assumpt refer due observ space state larg number train nearest neighbor comput explain section approxim approxim markov model markov chain hidden markov model partial observ markov process successfulli appli indoor navig research koenig simmon appli pomdp integr topolog metric inform navig xavier sonar rang sensor differ exist hmm normal hmm stationari transit probabl depend input transit probabl markov model explicitli depend observ time step markov model nonstationari autonom navig vision sonar rang difficult vision sensor higher imag intens give rang inform directli relat spatial rang inform conveni navig similar imag requir navig action outcom state control signal mobil visual attent signal attent window observ preprocess input imag time step estim equat markov outcom state normal map function recurr variabl singl approxim approxim estim output vector estim architectur navig shown fig singl tree estim current input imag previou state deriv control signal attent signal current state real control motion mobil robot extract subsequ attent window video camera attent action extract partial view global view camera stochast partit tree nearest neighbor regress main challeng high number sampl typic smaller tradit classif regress cart design low space describ address problem navig retriev problem navig train perform complic function map input output att mobil robot figur vision guid navig stand train set train imag build learn sampl record desir pair construct batch train train sampl construct input imag high imag linear subspac low automat build space partit hierarchi partit space explicitli detect train sampl part input part output part root train sampl input part comput princip compon vm unit eigenvector sampl covari matrix largest eigenvalu eigenvector orthogon direct sampl distribut sampl variat minim number project comput reach furthest space result binari tree sampl project give ff comput project ff ff ff split root hyperplan sampl belong left belong child child partit space similar child sampl assign comput principl compon normal hyperplan project normal point hyperplan pass split partit region belong node subregion partit continu train sampl fall node output part quantiz output part vector attent control signal perform newli grab input current state retriev input hyperplan decid child input belong explor explor process continu leaf node output part estim output input principl compon analysi automat guid hyperplan split cut direct sampl variat automat neglect direct sampl vari search necessarili find nearest neighbor origin space input lead good match explor parallel path measur distanc project principl compon project sampl child node addit search path explain addit child node explor distanc smallest leaf node obtain nearest leaf node found node averag time complex retriev input binari roughli input number leaf node build balanc principl compon analysi intern node logarithm time complex crucial applic increment train batch train suitabl simpl task number sampl small task hand complex number sampl larg store batch train mode trainer dynam select case current perform train start scratch train set chang increment trainer store entir train set updat sampl time train sampl discard increment comput eigenvector data covari matrix estim input column vector averag sampl domin eigenvector estim comput power method quotient conjug gradient method domin eigenvector estim estim covari matrix prerequisit author address problem stochast approxim stochast approxim shown high accuraci requir eigenvector estim appli oja karhunen method stochast approxim domin eigenvector stochast matric finit constant oja karhunen iter repres learn rate denot vector comput domin eigenvector covari matrix set outer product oja karhunen comput increment converg stochast approxim prove theorem bound symmetr matric mutual statist independ largest eigenvalu unit multipl probabl densiti bound uniformli neighborhood eigenvector largest eigenvalu increment learn sampl conduct learn domin eigenvector updat increment child updat process list list sampl list child node vector domin eigenvector child node process child node shown accept list parent node form list delet sampl updat insert sampl updat obtain list child node figur increment updat node search path case studi indoor navig compar outdoor road indoor navig face tremend challeng stabl featur floor edg stabl contrast pattern typic navig path type environ sever problem function approxim due complex function indoor corridor type shown fig notat corridor left left straight corridor figur type corridor structur indoor navig corner situat group exit corner intersect reduc number state merg indoor corridor section type repres shown fig approach corner intersect repres singl ambigu state transit transit loop jump depend current visual imag previou state transit state depend current observ previou state estim visual attent local view state disambigu state true approach global view finit number sampl desir capabl gener local view period greatli disambigu type turn turn made immedi case raw input imag averag window reduc half size global left local attent window subregion raw input imag center size attent signal binari flag global view local view koenig simmon sonar sensori input observ hmm figur markov model indoor repres state action local attent view singl global view arc current observ local view global view transit correspond larg number imag transit determin model defin state spatial grid hallwai path larg number state similar hmm directli appli complex train hmm extrem intens imag higher sonar navig task challeng visual imag relat control directli rang data visual imag number state greatli reduc visual input richer inform system inform model shown fig input output shown fig binari field repres state predict current predict attent binari flag indic global view attent window output control signal current pair field mark solid box concaten form singl long vector input field dash box predict associ quantiti train data collect quadrupl control signal mobil robot consist requir head direct speed state transit markov model train preprocess raw imag input part output part figur input output part result mobil robot rome mobil built made test algorithm train robot navig loop figur map test site test loop thick solid line corner intersect train test mark arab number shown fig floor msu engin build floor plan cover area approxim squar meter type local corridor structur shown fig sampl train imag corner junction shown fig scene width straight corridor segment navig singl camera environ challeng method predefin presenc featur irregular figur sampl train imag corner intersect set consecut imag corner intersect test loop interact train robot corridor input imag grab previou state desir control signal differ current head head interact correct head direct read robot intern regist human suppli current state explain input imag normal unit varianc suppress effect absolut light bright contrast variat preprocess raw input imag previou state inform queri retriev output error sampl reject sampl updat process avoid unnecessari updat tree tree good human interact robot amount train sampl section goal cover basic variat scene robot reject recent move learn section robot reject sampl set rome free rome roam speed slow correct head direct larger ffi enter state behavior train interact human trainer order remov spuriou state transit resort higher order markov vote scheme state histori step histogram histori state comput state transit confirm number vote current state unchang fig show sampl state transit pass test loop shown fig corner transit state confirm corner intersect state fig smooth scheme achiev stabl navig behavior state sequenti time step state sequenti time step raw output state output state smooth figur sampl state transit cover pass continu run test loop state code explain fig provid visual navig sampl control signal state show fig robot turn left fig fig robot turn left corner fig observ straight robot turn smaller magnitud result smooth navig behavior state attent train system similar state vector absent call stateless explain mean local view stateless experienc difficulti guid robot navig test loop fail make fig show fail displai plot collect sampl navig trajectori fig show failur case state fig show case robot retriev imag left turn critic turn visual posit similar imag left corner robot turn left ran wall fig show case robot fail make corner fig show robot perform state inform robot successfulli made turn state crucial disambigu critic scenario control state sequenti time step control state sequenti time step corner corner control sequenti time step control state sequenti time step corner corner figur sampl control signal state control signal plot set figur correct head direct case left turn turn left turn straight section corner chang correct head straight section smaller order provid smoothli robot navig stabl behavior measur robot navig trajectori start posit time robot start locat center hallwai fig show detail plot sampl drive corner turn turn difficult turn entir test loop trajectori collect attach marker center rear bumper coordin sampl trajectori point manual collect test site accuraci data plot inch fig trajectori start posit tend displai deviat make figur sampl trajectori corner show state robot navig show failur case state upcom wall show robot successfulli made turn state turn cover distanc fig show robot navig corner fig show mobil robot view navig corner imag grab updat control singl time step retriev input perform frequenc hz onboard sun workstat onboard robot increment learn conduct workstat separ batch train set sampl sun workstat time record shown fig maxim time learn sampl train increment learn imag frame increment learn time uniform train depend number sampl redistribut intern node search algorithm fig conduct test repeat run observ perform stabil learn robot pass autonom navig test loop minut robot observ continu run longer hour time onboard provid low dozen test conduct robot perform hit wall hallwai door navig pass natur mobil robot larg automat deriv principl compon figur sampl trajectori corner robot start posit robot start posit mark solid size robot cover entir imag comparison approach gener comput tool approxim function high space popular artifici neural network navig perceptron radial basi function network robin compar type neural network separ set set set comparison set data collect separ occas floor engin build train set train sampl result gave success perform test train loop set set sampl set redund cover scene set map current head output output pattern train sampl gaussian distribut peak desir head simul implement mlp output layer figur rome navig autonom corner imag video sequenc robot imag front robot figur mobil robot view corner real navig sequenc show robot approach successfulli made turn enter straight section node resolut sampl train pair shown fig neural network output head peak gaussian fit output neuron output layer perceptron simul feedforward neural function matlab neural network toolbox function adapt adjust learn rate similar hidden node simul simul show complex indoor imag perceptron converg reason weight start random initi weight studi set time sequenti imag number figur time record increment learn set train imag learn time record sun workstat figur sampl train top part imag row output gaussian distribut peak desir head direct row binari state field field valu shown intens valu data addit set set set real imag straight hallwai set imag head ffi ffi ffi ffi ffi class sampl set full set real imag set imag train navig includ imag straight hallwai section imag corner section imag collect corner straight section connect corner set synthet data set gener road map road white part scene black shown fig synthet sampl imag gener orient translat trajectori squar road map fig typic set consist synthet imag ffi ffi ffi ffi ffi sampl imag shown fig road map dark area white area road sampl imag figur sampl imag gener locat orient simul navig path imag gener perspect project camera model size problem number imag small size imag train feedforward network successfulli train start random initi weight mlp reason error rate found input dimens mlp start random initi weight converg reason solut ran matlab script file time random guess initi weight train epoch set larg converg local minimum fig show sum error mlp set hidden node fig show weight converg good solut train trial provid solut small error shown fig simul set similar learn process easili stuck poor local minimum result larg ss sum squar error trial sum squar error trial node output layer absolut error frequenc target output error histogram node output layer output node output layer output class output class output node output layer node output layer node output layer output class output class output class figur train mlp set trial random guess initi weight record sum squar error trial minim mark circl target output class train sampl ffi ffi ffi ffi ffi error histogram retriev head direct train set mlp record small network output overlap target output output mlp target output plot solid line dot line avoid problem random initi guess sophist gener initi similar spirit call princip compon regress weight hidden node initi princip compon input output node initi linear regress desir output hidden node initi mlp led converg experi shown fig set train epoch learn process converg quickli result small error compar fig fig network output initi smoother network output error node output layer output node output layer output class output class output node output layer node output layer node output layer output class output class output class figur train set initi weight network output overlap target output network output target output plot solid line dot line radial basi function network robin present navig implement robin typic rbf network normal recept field normal unit sum neuron layer normal improv interpol shown refer site center select rosenblum davi cluster algorithm center select result satisfactori manual assign subset input pattern center procedur implement compar studi orthogon squar automat center select perform comparison report result comparison mlp discuss set train set test head error histogram plot fig method perfect retriev train error histogram concentr singl bin error addit head error comparison shown fig compar accuraci method current imag previou state map current state state label map regress map numer number network mlp linear output layer perform discrimin analysi classif hidden state predict number output node number code binari pattern network node highest correspond predict state number node hidden layer rang number node hidden layer rang classif similar state code binari pattern number output node number state output node highest predict state explain center automat select orthogon squar techniqu set data train role train set test set accuraci state predict report tabl tendenc overfit train result poor gener perform test set determin number epoch simpl crossvalid check state predict accuraci train set test set absolut error absolut error frequenc absolut error absolut error frequenc feedforward network absolut error absolut error frequenc rbf network figur comparison mlp rbf network obtain error histogram train set shown left column error histogram test set shown column number epoch lead balanc perform train test set chosen set redund set train set lead perform test disjoint set tabl clear perform mlp train test mlp tabl comparison approach state predict speed method report tabl train learn mechan set time millisecond record sun workstat record time cpu time spend map input includ time requir grab imag camera time program network comput learn paramet comput matlab mlp time ms ms ms tabl comparison method time input qualit comparison summar tabl major power stem local adapt nonparametr flexibl global parametr regress partit tree good tradeoff speed perform project pursuit adapt algorithm function high comput complex friedman excel discuss subject mlp global parametr regress minim global squar error learn mlp perform learn sampl deterior problem rbf network navig shown experi memori loss problem rosenblum davi memori loss problem allevi due local nonparametr regress dynam tree node local para hierarch time space hardwar correct global compl compl conv learn mlp global suit trial mem loss global suit ol hard local full log suit feasibl tabl qualit comparison method notat input number hidden node number center number store sampl abbrevi parametr memori mlp rbf experi show problem train network deal corner network corner situat deterior mlp fail navig test corner fig method set train data experienc similar problem road condit pomerleau method arbitr individu network train specif road integr arbitr network difficult task state inform systemat accomplish task explicit rule network arbitr involv method experi advantag perform train mlp give reason random trial initi weight random initi weight rbf network provid perform good train sampl rbf network act nearest neighbor comput complex prohibit number train sampl larg superior perform pai extra cost store prototyp train sampl payoff extra storag enabl reach good perform accuraci speed challeng indoor environ train significantli faster mlp rbf network map ann architectur learn algorithm easili map ann architectur domin eigenvector binari partit node comput neural learn algorithm oja refer tree structur map ann architectur binari tree split leav split implement weight sum threshold mechan ann architectur network topolog tree futur work characterist algorithm summar markov model navig state inform visual attent incorpor systemat framework deal complex scene realiz nonparametr regress method stochast partit tree effici comput match visual input data learn algorithm local nonparametr adapt exhibit flexibl perform global parametr regress mlp rbf network method compar navig approach sonar visual intens imag richer inform number state greatli reduc method automat deriv featur princip compon flat space kirbi sirovich turk pentland requir human defin difficult ad hoc task futur research extens test navig environ capabl approach deal factor light issu common road recent studi discrimin analysi demonstr power deal unrel studi import issu direct command make turn intersect current framework state includ inform desir turn direct feasibl framework util futur studi refer environ mobil ieee tran robot vol pp classif regress chapman squar learn algorithm radial basi function ieee tran neural vol pp chen autonom navig technic report michigan state nearest neighbor ieee transact inform jan analysi time recent statist vol pp percept exploit lectur seri capabl dynam intern joint confer artifici intellig nagoya august frank statist review regress vol pp adapt regress spline annal vol pp hancock eigenvector land vehicl imag dec annal vol pp hidden markov model speech edinburgh tactic technic report robot januari kirbi procedur human ieee tran pattern anal machin intel vol pp model robot road vision carnegi mellon pp koenig robot navig architectur base partial observ markov process artifici intellig base mobil case studi success robot rp murphi mit line segment indoor mobil ieee tran robot vol pp meng robot navig neural network environ ieee control pp construct tree multidisciplinari data mine knowledg oja stochast approxim eigenvector eigenvalu expect random math analysi vol pp minor linear neural neural vol pp program machin san morgan network percept mobil robot academ rapidli adapt posit proc ieee symposium intellig sept tutori hidden markov model select applic speech vol pp rosenblum improv radial basi function network visual autonom road ieee tran neural vol pp tree perform enhanc artifici neural network artifici neural network statist pattern recognit ik sethi ak pp simmon probabilist robot navig partial observ fourteenth intern joint confer artifici intellig pp swet discrimin imag ieee tran pattern anal machin vol pp vision carnegi mellon pp autonom cmu ieee pp turk journal cognit vol pp webb optim intern classifi network perform nonlinear discrimin neural vol pp weng learn proc intl conf pattern vol pp aug weng navig neural vol method time seri time ser vol pp densiti regress estim markov sequenc mix journal multivari vol pp regress model time vol pp
IR/1530 5 search engin specif queri transform question answer abstract eugen £ columbia ny introduc method learn queri transform improv abil retriev answer question inform retriev system train stage method involv automat learn phrase featur classifi question automat gener candid queri transform train set automat evalu candid transform target inform retriev system gener search engin run question transform set perform document retriev present prototyp search appli method web search engin blind evalu set real queri web search engin log show method significantli outperform underli web search engin commerci search engin special question answer keyword web queri question inform retriev introduct number natur languag question hard submit search engin web number search servic web specif target natur languag question proprietari servic facilit interact human expert web search engin altavista googl typic treat natur languag question list term retriev document similar origin queri document answer term origin queri rank low search engin queri answer search engin recogn question question hard document queri compani websit disk storag return £ work partial author intern nec research institut summer copyright held hong kong acm steve lawrenc nec research institut nj lui gravano columbia ny search hardwar tutori glossari page definit descript hard disk good answer rigid magnet disk rotat central head store definit retriev transform origin question queri requir phrase bia search engin retriev answer document present automat learn transform natur languag question queri term phrase expect document answer question evalu set question chosen randomli excit queri compar qualiti document retriev document retriev system blind evalu relat work larg bodi research recent repres text retriev evalu confer track involv retriev short byte answer set test question work gener class answer user interest multipl answer question wai peopl part relev work retriev document collect system latest trec evalu submit origin question inform retriev system task number system aim extract answer document abnei al describ system document return smart inform retriev system process extract answer question classifi set identifi type entiti answer document tag recogn passag surround entiti correct type question rank set heurist moldovan al present system postprocess result regular inform retriev system goal return passag cardi al describ system combin statist linguist knowledg question answer emploi sophist linguist filter postprocess retriev document extract passag answer question system gener approach retriev document passag similar origin question variat standard term weight scheme passag chosen document return heurist regular express approach document similar question initi retriev user document answer document term origin question import retriev document limit number case web search engin system attempt modifi queri order improv chanc retriev answer lawrenc gile introduc specif express question transform specif phrase answer question transform phrase refer main differ current work transform hand craft set queri submit search engin differ queri syntax search engin sanderson set queri transform order retriev document descript phrase proper noun al describ system transform question hierarchi question type hierarchi built bootstrap techniqu mckeown describ experi automat build lexicon phrase collect document goal build index collect suit question answer relat larg bodi research describ method automat expand queri base relev term document interest approach present describ automat expand queri base term queri term document origin queri automat queri system expand queri run time basi initi set document return inform system origin queri contrast previou present system automat learn multipl queri optim specif search goal maxim probabl inform retriev system return document answer question exploit inher regular power natur languag transform natur languag question set effect search engin queri system suffici submit natur languag question tie search engin origin form search engin treat queri bag term retriev document similar origin queri document answer term origin queri document rank low search examin typic user page result answer natur languag approach automat reformul question queri term phrase expect document answer origin question section defin strategi transform natur languag question effect search engin queri section describ system learn reformul question section show evalu queri run time appli transform gener question phrase question train data gener candid transform answer train data evalu candid transform search engin output transform search engin figur outlin process train system question type question tabl question type phrase evalu learn transform question effect queri attempt find transform natur languag question effect queri term phrase expect document answer question learn process shown figur select question phrase stage learn process figur gener set phrase identifi categori question question categori similar goal question hard impli user definit descript hard disk goal question infer question phrase input stage set question question answer constitut train data gener potenti question phrase comput frequenc length anchor begin question result occur time output stage set question phrase quickli classifi question respect question type sampl question automat gener question train collect shown tabl method select question phrase produc includ number phrase specif wide applic stage train process limit resourc chose limit train result report phrase match regular express shown figur regular express match common concentr resourc phrase featur select natur languag process techniqu filter gener question phrase altern approach identifi categori approach number advantag approach process larg train set approach domain work languag minor modif evalu question run time categor question phrase match incorpor neglig overhead process time queri figur regular express filter automat gener question phrase candid transform gener filter candid transform stage learn algorithm figur gener candid term phrase reformul question appli filter procedur reduc comput requir stage candid transform search engin step figur candid transform gener question phrase previou learn stage procedur gener candid transform question phrase qp consist number gener initi candid transform filter phrase minimum weight filter remain phrase step detail stage learn process collect pair sampl origin collect figur describ stage learn process oper collect tag assign syntact part speech word text tagger wide natur languag process commun pair train collect match gener potenti answer phrase word prefix answer length start word boundari byte answer text sampl answer phrase gener step shown tabl phrase heavili electron comput domain phrase gener larg portion document train collect technolog relat topic phrase chang intend topic queri recal transform learn improv accuraci retriev set preserv topic origin queri filter phrase intuit good transform gener question address problem filter candid transform phrase noun observ queri noun content word express topic queri queri noun content word word noun filter candid transform phrase check gener answer phrase phrase discard part speech comput collect begin subsect result highest frequenc count appli ir techniqu term weight rank candid transform initi term weight assign candid transform appli term weight scheme term weight okapi question phrase candid transform tabl sampl candid transform gener disregard phrase noun rank formula okapi inform retriev system particip trec confer inform retriev system vector space model comput similar similar comput dot product vector repres document element vector calcul combin term weight term frequenc term document metric similar idea origin definit term document assign jone term weight respect specif queri topic calcul ö ê ö ò ö æ ò ê ö ö number relev document æ number document ê number relev ò number document weight design high term tend occur relev document smooth normal account potenti relev inform train data origin definit term weight specif queri topic appli metric task weight candid transform incorpor modif interpret queri topic question type relev document answer train collect correspond question phrase estim select candid transform respect specif question type extend term weight scheme phrase appli consist weight scheme treat singl word term comput weight candid transform comput count pair answer question match qp number relev number remain pair answer appli formula equat comput term select candid transform context select term automat queri û count term weight comput respect qp term rank strategi exploit statist relev weight aim filter assign higher weight term phrase high discriminatori measur phrase occur answer relev question type tabl phrase discrimin question question phrase candid transform û tabl sampl candid transform frequenc count term weight û result term select weight transform length candid transform tabl sampl candid transform group bucket transform length transform gener question phrase phrase occur ultim rank higher tradeoff discrimin frequenc expect explor futur work sampl output stage shown tabl candid transform sort bucket number word transform highest valu bucket expect longer phrase process differ search step order includ potenti higher transform set candid primarili shorter transform higher frequenc count chosen tabl show sampl phrase highest select weight candid transform bucket weight transform search engin final stage evalu perform candid web search engin figur show algorithm rank set candid transform singl question phrase search engin procedur repeat question phrase search engin interest step algorithm retriev set pair train exampl sort pair collect order answer pair question begin qp sort step evalu accur question shorter topic futur research set candid transform gener previou stage appli transform question time question question question remain term tion transform remov question phrase rewrit question queri candid transform question phrase pair lisp machin lisp machin comput optim run lisp appli transform question obtain rewritten queri queri lisp machin queri syntax search engin encod transform treat phrase search engin syntax queri interfac vari search engin altavista oper found oper produc significantli result preliminari experi actual queri submit altavista lisp machin googl treat term submit queri implicit semant absenc explicit oper note googl incorpor proxim queri term document rank discard word stopword list possibl rewrit requir requir part queri match combin multipl transform singl queri step figur rewritten queri queri submit search engin se top result return se retriev return document analyz step step gener step similar answer found step score count updat base similar respect detail step follow step gener document calcul accur similar measur origin answer document document retriev transform queri make assumpt answer kei phrase close proxim length overlap minim possibl answer queri document break overlap start success posit step calcul score document respect answer maximum similar extens metric modifi incorpor phrase calcul equat origin metric relev weight topic frequenc defin ã ã document length averag document length relev weight queri topic frequenc simplifi version metric trec exampl exampl candid transform queri result document result figur automat evalu effect candid transform summat includ weight learn train data previou subsect weight term phrase ø calcul û defin ø ø ø defin ø ø è ø assign procedur term encount present train collect idf document high rare low common weight deriv larger sampl million web obtain collect page trec web track case order handl phrase present train data assign weight phrase ø proport probabl term ø scale weight occurr phrase higher heurist work preliminari improv work document rank import run time oper system section result set document focu work goal rank candid transform weight highli transform tend return relev document origin document step calcul weight transform averag similar origin train answer document return transform è ë sum calcul pair set exampl result final stage train set automat rank respect effect retriev answer question match qp search engin se sampl highli rank transform qp optim altavista search engin googl search shown tabl run time queri reformul set transform automat train question store transform rule evalu question procedur figur search transform search transform engin engin altavista googl tabl top rank transform question phrase automat optim altavista googl step system determin reformul question match question prefer longer phrase prefer step set transform retriev top transform step transform rewrit origin transform result queri step transform queri submit search engin page result retriev step return document analyz score base similar document respect transform queri process score document section import differ step document retriev applic multipl final score document maximum individu document score step return document rank respect final document step top rank document return final result produc system set section present set evalu perform section detail train evalu section list retriev system comparison section introduc evalu metric perform retriev detail queri evalu relev judgment report section train collect approxim pair obtain frequent qp queri result document result maximum score document score updat maximum score document score sort document order document score return highest score question answer lisp machin comput lisp optim run lisp effici machin provid good environ program field monitor design listen field area sound speaker domin significantli indirect reflect sound bounc consol figur sampl pair train collect type pair collect tabl number train question question type question file subject figur show sampl pair obtain faq file project evalu question type number train pair collect question type shown tabl number paramet train process perform valu paramet result paramet shown tabl test paramet exhaust improv perform system retriev system compar learn queri transform specif tailor search engin evalu popular search googl altavista compar result produc system search transform evalu comparison system evalu googl googl search engin figur evalu question run time paramet descript min frequenc gener question phrase min frequenc gener candid transform max length question phrase max length answer phrase min length question phrase min length answer phrase max length prefix answer candid transform gener length document similar calcul set high includ complet answer similar calcul max number highest rank candid transform length final weight stage number pair evalu candid transform question phrase individu page timeout tabl train paramet optim googl retriev system result transform user question multipl queri transform specif learn combin queri result googl section altavista altavista search engin optim altavista retriev system result transform user question multipl queri transform specif learn combin queri result altavista section result search special answer natur languag question evalu metric inform retriev system compar base retriev document set quantifi recal document collect hand judg relev queri calcul fraction relev document document recal measur coverag system fraction relev document collect system retriev measur recal collect mark document collect relev evalu queri daunt task larg document essenti imposs billion document research address problem develop standard document collect queri relev limit domain document judg trec incorpor web track emploi collect web document rel size collect document valuabl resourc evalu inform retriev algorithm web data collect suit evalu system aim transform user queri obtain improv result exist search engin googl oper web larg evalu rigor defin altern set evalu inspect top ã page return system compar queri describ comput relev judgment document section relev evalu answer system produc metric definit ã retriev system ë queri õ percentag document relev õ top ã document return ë õ queri õ top document return googl queri judg document relev õ googl õ comput percentag question system perform system definit system ë queri õ system document cutoff ã queri õ perform system highest number relev document top ã document system note multipl system ident perform case consid queri top document return googl top document return altavista queri document relev õ top googl document top altavista googl consid perform document cutoff õ googl õ retriev system queri evalu queri relev judgment train discuss evalu perform retriev system section metric section real user question log queri receiv excit search engin portion log access consist million estim type total present evalu judg total queri total question tabl number question question type excit queri log paramet descript max number transform appli size max length queri phrase timeout individu page timeout tabl paramet evalu english question focu evalu basic question common type question found excit estim account natur languag question submit search engin set test question gener scan question phrase queri log random sampl question chosen question type sampl manual filter remov queri return document check question present verbatim train collect test question tune paramet test question type submit system modif origin question retriev url rank result url store top document document fewer retriev top document return altavista top document return googl top document return transform optim altavista paramet tabl top document return transform optim googl paramet tabl top document return special step process result page result return link question similar select editor list term question user answer page user found question similar retriev result top result bring total number retriev page assign relev judgment result url system mix present random order number volunt volunt blind system return url set evalu script present volunt result page queri page volunt judg page queri volunt told criteria judg document good page answer test question page page link link document page judg page view reason server broken result evalu result section report result evalu methodolog previou section figur show averag ã vari ã altavista googl test question optim googl highest valu document cutoff ã note perform underli search engin show larg improv altavista figur show percentag question system perform term number relev document return document cutoff test question perform question system perform poorli perform compar origin altavista search engin lower perform system perform small number comparison lower perform system metric consid possibl document return retriev simpli examin document return search engin origin queri report percentag document origin queri document examin figur figur report percentag document top æ origin queri figur plot percentag top document origin search engin figur show percentag relev document origin search engin result top document relev judgement assign figur show overlap result set retriev transform document retriev origin queri overlap low document slowli level top relev document figur averag ã altavista googl test vari number top document examin ã consist outperform underli search engin base perform system origin googl document examin experi fraction relev document retriev found underli search engin figur percentag question system return relev document vari number top document examin ã search engin altavista googl test queri highest number relev document question return multipl search engin consid return relev document lower perform system perform small number comparison lower perform system metric tabl report averag ã document set retriev separ question phrase examin document lower gener case reason document select human editor answer question note system higher top rank document question phrase figur averag percentag top relev top document top æ document return origin queri underli search engin figur averag ã altavista googl question figur report averag ã document set retriev altavista googl separ question type note system highest ã question type figur ã googl highest impress perform question due common practic web link page peopl find solv specif natur good answer type question googl exploit anchor text document achiev high result type question interest note system perform uniformli question subtyp basic question type explain phenomenon observ question question fall question typic express request definit explan term request list characterist featur concept volunt judg complain question hardest evalu answer test question creat direct creat free html web host web design softwar manual clear judg page relev type question note perform type question suggest approach rout question search perform question type transform question manner optim search engin note small number question categori limit accuraci result individu question type futur work summari avenu futur research improv system exist method extract passag document implement domain natur languag techniqu improv identif question type multipl transform combin singl queri question rout search engin perform question type multipl search engin simultan plan investig creat phrase transform content word question plan make transform process dynam transform expect high submit base system lower transform fall back origin queri introduc method learn queri transform improv abil retriev answer question inform retriev system method involv classifi question question gener candid queri transform train set question question system type phrase ã aj av tabl averag ã altavista googl separ question type question ã document evalu candid transform target inform retriev system techniqu process natur languag question applic wide rang inform retriev system implement evalu method appli web search engin blind evalu set real queri web search engin show method significantli outperform underli web search engin common question type acknowledg author acknowledg nec research institut bulk research support nation scienc foundat grant robin burk give train collect faq file format nick craswel give document frequenc count collect million web page eric glover regina kathi anonym comment final great peopl time busi schedul evalu regina nicola david john eric tobia sharon eugen carl roman michael brian anonym refer singhal answer extract real world implement answer extract intern workshop expert natur languag inform system brill simpl part speech tagger confer appli natur languag process brin page anatomi hypertextu web search engin intern world wide web confer inform retriev text aaai fall symposium ai applic knowledg navig page bucklei examin role statist linguist knowledg sourc system experi textual question answer harman result challeng web search evalu intern world wide web confer sanderson retriev descript phrase larg amount free text cikm lawrenc gile context page analysi improv web search ieee internet bucklei improv automat queri acm ru tool surf answer net robertson term select queri journal volum page robertson jone relev weight search term journal american societi inform robertson walker relev weight relev inform sigir beaulieu okapi automat ad vlc interact track salton automat text retriev inform comput mckeown experi autom lexicon build text search elicit queri excit web search engin cikm overview eighth text retriev confer question answer track report xu croft improv effect inform retriev local context analysi acm transact inform system
HCI/1531 4 gestur visual mediat interact jonathan howel buxton school cognit comput brighton uk abstract paper report initi research support visual mediat interact develop gener gestur model control activ camera describ variant radial basi function network evalu perform simpl point wave hand gestur imag sequenc result present show high level perform obtain type gestur recognit individu set individu characterist visual evid automat select individu depend task demand introduct robust track object human bodi difficult due rapid ambigu segment model match ongo research mit media lab shown progress model interpret human bodi activ simpl approach action recognit similar attempt made microsoft research system attempt intent track model control activ camera visual mediat interact previou work camera control base execut script set defin camera action system fix wide angl camera virtual window control model exploit set gestur reactiv visual control interpret user intent live control activ camera adapt view direct attent focu point wave import delib control reactiv camera movement provid visual context applic group autom studio direct grow interest human gestur video nonverb modal interact main approach involv comput featur motion form tempor trajectori track hidden markov model dynam time warp explor british machin vision confer potenti simpl differ video sequenc conjunct power connectionist learn paradigm account variabl set predefin gestur adapt learn compon base rbf identifi valuabl model wide rang research main advantag comput simplic robust support mathemat theori studi video sequenc recognit point wave gestur involv rbf provid fast train perform interact requir applic activ camera control main paper present result show high level perform type gestur recognit obtain techniqu individu set individu characterist visual evid automat select individu depend task demand rbf model dynam neural network construct ad recurr connect standard perceptron form contextu memori predict time partial recurr neural network train backpropag problem stabil long train sequenc dynam simpl mechan conjunct rbf term robust solut difficult problem neural network model hertz al incorpor concept order process tempor successfulli appli speech handwrit recognit task structur design spatiotempor reduct trainabl paramet rbf network hybrid learn network combin layer hidden output unit layer input hidden unit network model individu radial gaussian function hidden simul effect overlap local tune recept field version creat combin data fix time singl vector input construct approach rbf train combin idea slide input window standard network train procedur ad adjust rbf unit requir simpler success previou work rbf network rbf unit train simpl process calcul weight method simpl experi made network learn simpl behaviour base head rotat distinguish movement static head pose network shown maintain british machin vision confer gestur bodi movement behaviour point hand left point left point hand point wave hand head urgent wave wave hand head wave tabl definit gestur high level perform test data individu train task simplifi constant arbitrari short segment sequenc identifi direct head turn address complex point wave hand due complex motion involv characterist part complet action time window present network order gestur context activ camera control concentr specif behaviour move camera adapt field interpret request pass camera implement zoom pan point interpret request camera implement pan zoom type give gestur shown tabl collect exampl gestur sequenc sequenc imag collect roughli total imag imag sequenc result collabor project gong queen mari westfield london stephen mckenna research face detect track standard rbf network shown work imag sequenc face recognit task specif interest area motion frame differenc previou pixel current frame pixel previou frame discard fig count number pixel retain frame process segment gestur simpl threshold signal frame number chang fig frame threshold discard align start point gestur sequenc pad end nil valu length longest gestur give equal length sequenc integr layer network combin result success time give smooth serial action sequenc reli tempor segment give singl frame posit classif arrang gabor filter preprocess differenc imag british machin vision confer initi discard correct sequenc correct discard tabl averag result train test gestur sequenc singl person data sampl scale orient sine cosin compon total coeffici frame result tabl result obtain split separ train test column show actual number sequenc part experi show raw rate network adapt measur shown power method improv remov ambigu result column classif discard correct show final rate result output gestur model creat train test data individu sequenc person separ turn distinguish class learnt tabl list result train averag set data show task learnt extrem train gestur provid exampl reduc number indic effect separ gestur class network gestur model combin data peopl network group train test distinguish class learnt result tabl slightli final result lower level train exampl gestur cope speed adapt train data explicitli demonstr class speed simpl appli train sequenc cut repeat frame time british machin vision confer figur differenc consecut frame result hand figur imag sequenc differenc frame previou hand demonstr type variabl present singl subject start frame automat determin frame end frame subject start frame end frame british machin vision confer window initi discard correct sequenc correct discard fix warp tabl result train test gestur sequenc peopl fix window train sequenc origin warp window version train sequenc initi discard correct sequenc correct discard tabl result gener train gestur sequenc test window shorten lengthen train sequenc shorter longer version sequenc meant time train exampl previou experi fix time result shown tabl vari length rate improv make reduct proport output discard low confid note global method limit address gestur speed gener gestur model test network singl gestur peopl gestur effect absenc class network exampl person test tabl pattern previou test train exampl network learn classif task person effect data peopl abil potenti specif peopl appli gener data british machin vision confer initi discard correct sequenc correct discard tabl result train test gestur sequenc ident gestur combin gestur ident model final test identifi ident gestur class learnt tabl result test compar result tabl proport test data correctli classifi postur form addit evid face recognit applic discuss berthold integr layer cope shift scale event discuss cope speed movement start frame gestur variabl speed variat handl recurr train data explicitli demonstr class speed simplifi result integr layer test stage movement effect identifi start end point robust gener scene person anticip ad integr layer improv extra variat start point test sequenc iter applic success give extra contextu inform identif observ point simpl preprocess techniqu frame differenc threshold effect extract motion inform segment gestur time type network train distinguish gestur specif time gestur train test person gestur train test group individu british machin vision confer gener gestur train test peopl network shown distinguish arbitrari high level benefit integr layer threshold time gestur singl time window appli consecut posit characterist express gestur suffici distinct identifi person rbf network show perform gestur recognit creat gener gestur model result rbf techniqu high potenti present highli constrain interpret predefin gestur individu aim develop evalu user behaviour model base tempor predict continu pose gestur chang user minim awar system aim estim predict essenti bodi paramet head point wave gestur express model essenti order provid behaviour interpret predict import note attempt model full work human bodi aim exploit approxim effici rbf support partial suffici express gestur dynam scene avoid unnecessari comput cost dynam scene interpret exist recurr network model long time simpl rbf network provid fast effect method identifi arbitrari behaviour main problem altern strategi learn behaviour model difficult classifi behaviour evolv speed singl solut problem requir subdivid behaviour fast slower version merg stage behaviour analysi flexibl turn advantag practic intent forc fast point action slower action plan explor full gener rnn gener behaviour control learnt increment exampl rbf individu intent control learnt rapidli exampl acknowledg author gratefulli acknowledg invalu facil provid gong stephen mckenna develop construct gestur british machin vision confer refer tresp solut miss featur problem vision advanc neural inform process volum page san morgan kaufmann berthold time delai radial basi function network phonem recognit ieee intern confer neural volum page ieee comput societi press bishop neural network pattern recognit oxford bobick comput action fisher british machin vision page press buxton gong visual surveil dynam uncertain world artifici cutler turk interpret optic flow gestur recognit ieee intern confer automat face gestur page ieee comput societi press elman find structur time cognit gong visual observ reactiv learn spie intern confer adapt learn page palmer introduct theori neural comput redwood citi hinton ghahramani gener model discov distribut philosoph transact royal societi seri howel buxton recept field function face recognit intern workshop parallel model neural oper pattern page howel buxton face recognit radial basi function neural network fisher british machin vision page press howel buxton unconstrain face recognit imag sequenc intern confer automat face gestur page ieee comput societi press howel buxton simpl behaviour rbf network neural process jordan serial distribut process approach elman advanc connectionist speech lawrenc le jackel backpropag appli handwritten zip code recognit neural mckenna gong track face intern confer automat face gestur page ieee comput societi press raja face recognit dynam scene british machin vision page press moodi darken learn local recept field connectionist model summer page morgan kaufmann moodi darken fast learn network process unit neural british machin vision confer mozer neural net architectur tempor sequenc process weigend time seri predict futur understand page redwood pentland smart room scientif bobick approxim world incorpor qualit linguist inform vision system page gong model trajectori face signatur partial recurr neural network ieee intern confer neural volum page gong track segment peopl vari light condit colour ieee intern confer automat face gestur page ieee comput societi press turk visual interact lifelik charact intern confer automat face gestur page ieee comput societi press lang phonem recognit neural network ieee transact signal pentland track human bodi intern confer automat face gestur page ieee comput societi press wren pentland dynam model human motion ieee intern confer automat face gestur page ieee comput societi press
ML/1532 6 cellular neural associ arrai symbol vision christo jame austin advanc comput architectur group comput scienc york uk abstract system combin descript power symbol parallel distribut process model cellular automata speed robust connectionist symbol process cellular automata base aim system transform initi symbol descript pattern object level descript order identifi pattern complex noisi scene learn algorithm base hierarch structur analysi learn symbol descript object underli symbol process engin system neural base associ memori enabl system oper high speed distribut effici commun compact storag rule introduct basic featur syntact structur pattern recognit system structur pattern order classifi approach pattern complex structur relationship system pattern repres symbol data structur symbol repres basic pattern primit structur method reli prototyp match compar unknown pattern set model syntact system follow concept formal languag theori aim repres class pattern grammar method successfulli appli number drawback comput complex sensit error pattern lack gener robust learn abil relat syntact problem grammat infer combin abil grammar complex sensit import obstacl address fund project state scholarship foundat greec author particip workshop tmr hybrid theori research project ec order deal problem high occur entir pattern treat entiti decentr distribut approach descript pattern achiev set simpl homogen symbol process unit approach comput framework similar cellular automata node appli set rule dictat state problem overcom portion object segment process node commun node individu decid segment hold part object question answer approach grammar pattern held rule grammar set handl effici toler provid approach base cellular associ neural network learn underli grammar object scene outlin similar idea grammar parallel grammar system remain problem gener complex infer model idea extend associ neural network order effici handl larg set simpl symbol rule hierarch approach learn structur pattern produc set rule make commun grammar paper present basic architectur learn method initi result simpl evalu cellular associ neural network cann cellular arrai associ processor concept base cellular automata associ neural network mention main characterist cellular automata oper connectionist symbol process aura model neural associ memori initi label imag arrai symbol produc label raw pixel imag featur recognit stage recognit iter cellular arrai correspond higher level symbol higher level structur corner part recognit node arrai label indic featur beneath cell repres messag exchang cell arrai iter cell awar state distant cell oper cann depict figur cell structur perform set symbol rule oper locat invari cell made number aura base associ memori fig recognit object oper cann object consist featur intermedi state time cell initi featur label recognit perform iter process symbol alphabet form state cell arrai messag commun cell symbol rule govern converg properti system produc learn algorithm hierarch approach describ structur pattern recal rule emploi constraint gener detail descript aspect system aura advanc uncertain reason architectur set method build associ memori system capabl symbol process cell cann paper made number modul modul rule match engin construct aura method detail scope paper present architectur stage set binari correl matrix memori determin rule fire set enhanc index store post condit rule basic schemat diagram oper aura model depict figur aura handl symbol rule form precondit postcondit precondit set variabl pair connect logic oper variabl uniqu binari vector input form tensor product vector input direct number precondit rule identifi rule uniqu binari pattern pattern ariti ariti ariti token lexic token convert symbol bind separ identifi separ fig schemat diagram aura constant number bit set distribut pattern call separ input relev separ kei order store relev postcondit input appli vector sum valu produc output convert number separ threshold method method set highest sum rest number bit initi set separ pattern separ identifi recov binari pattern postcondit retriev aura power symbol process engin essenti part system learn high speed learn recal perform parallel data queri give multipl capabl partial combinatori match rule direct hardwar implement system presenc architectur high speed process cell structur cell cann consist kind passer combin perform convert input form suitabl spread direct combin incom inform inform pass neighbour unit oper symbol combin current state inform neighbour produc state processor processor commun neighbour depict figur incorpor gate prevent symbol pass unit cell imag featur input prevent inform pathwai passer satur passer oper distanc messag akin system state corner featur hop combin unit inform pass passer distant featur current inform part object cell translat high level descript featur input symbol translat featur suitabl passer obtain symbol pass direct oper output combin input iter arrai passer passer combin fig associ processor pattern train messag rule inform cann repres symbol messag consist symbol symbol belong alphabet input alphabet set symbol repres primit pattern featur thought set termin grammar system set transit symbol evolut process cann symbol correspond grammar system repres combin symbol format set output alphabet thought set start symbol grammar system repres complet pattern object level symbol system modul set symbol rule set modul type oper locat dent rule form input condit output input condit combin messag output transit symbol symbol output alphabet connect schemata determin connect pattern arrai cell connect directli neighbour exchang messag cell awar state distant cell number iter case connect schema defin messag form input modul output modul direct form connect type modul number import commun state determin unit processor connect schemata uniformli appli processor type current experi deriv depict figur result present paper modul effect spread messag direct effect problem address learn session set rule oper cann produc learn session rule transit initi symbol imag object level descript modul set approach combin symbol input modul recogniz postcondit retriev transit symbol assign postcondit current format input rule store relev rule produc append set mention due propag cell awar state distant cell reflect state finit number iter number depend size input cell state uniqu arrai uniqu state uniqu format input pattern divid termin condit learn algorithm correspond configur entropi cellular arrai maximum precondit exist input combin modul symbol output alphabet pattern present beauti learn process complex pattern learn manual result rule recognit presenc imag dealt recognit relax method recal session recal symbol imag present cann learn approach grammar perform transform input symbol nearest object level descript descript pattern train present system converg object level symbol pattern similar pattern object level symbol common area unknown pattern system label format pattern primit recogn cell give object level due corrupt differ input pattern compar train exampl gener relax postcondit combin input found constraint relax incomplet precondit match accept system achiev access relev modul reduc threshold determin valid separ retriev output toler cell alter state cell fail output separ case complet decentr oper due partial match output symbol modul messag state consist symbol wai multipl symbol precondit present modul consecut simultan present input trade speed size present input faster larger rule precondit symbol present precondit symbol precondit consecut ariti access time combin combin result combin form multipl symbol messag simultan approach access case binari pattern symbol consecut approach number time access depend number symbol exist simultan method access major advantag aura method rule match cann recal session stop alter configur threshold preset maximum number experi recognit object noisi scene aim system applic found specif area analysi electron mechan draw long term aim build adapt gener pattern recognit system paramet system test set prototyp pattern includ connect schemata effect effect simultan compar consecut present paramet aura modul behaviour system complex pattern train scale variat train pattern test initi result complex pattern present result experi symbol inject train pattern present pattern train figur explain number iter complet learn session depend size pattern number rule produc depend level similar pattern common format repres rule symbol insert input imag initi label process posit symbol imag categori absenc symbol replac addit symbol test random inject train set pattern level predefin valu probabl type symbol ff present exist posit ten version level test pattern result pattern graph figur graph figur show averag recognit success recal noisi version pattern standard deviat averag pattern shown graph figur result toler combin modul passer modul result toler modul toler combin passer mean precondit match input combin modul passer effect relax obviou graph object level symbol averag occurr highest percentag symbol repres pattern due similar exist pattern notic level percentag symbol output pattern randomli creat belong pattern behaviour toler demonstr capabl aura uncertain reason partial match robust pattern combin toler passer pattern combin toler passer fig percentag correct object level label recal noisi version pattern toler combin passer modul toler combin passer modul appli distribut process approach relax combin effect product state unit messag miss relax passer enabl messag overcom obstacl empti space erron condit import note behaviour system good local relax consecut present experi recognit pattern achiev iter small fluctuat percentag learn number iter recognit achiev depend size pattern softwar simul aura model run silicon graphic workstat experi summari cellular system combin enhanc power symbol descript robust associ inform process present homogen associ processor cellular arrai interact distribut decentr fashion processor commun state determin unit process rule global grammar rule produc learn method hierarch approach cellular automata approach recognit complex geometr alter pattern util abil underli associ symbol process high speed handl partial match larg set symbol transform input imag object level output imag perform descript comput potenti parallel grammar system studi demonstr similar approach system present paper demonstr incorpor power connectionist symbol process mechan simpl effect learn algorithm result flexibl pattern recognit system direct hardwar implement refer structur syntact pattern recognit handbook pattern recognit comput page world structur syntact method line draw extend work advanc syntact structur pattern int page tanaka theoret aspect syntact pattern recognit pattern editor modern cellular theori applic plenum network parallel languag processor page austin lee neural architectur fast rule match artifici neural network expert system dec dj op hc associ memori jun high capac pattern recognit associ processor neural austin tj distribut associ memori scene analysi imag vision parallel architectur binari neural network intern confer microelectron neural evolutionari fuzzi system page sep editor handbook formal austin cellular system pattern recognit associ neural network ieee intern workshop cellular neural network page april editor trend formal languag lnc
IR/1533 5 method build web search engin takashi toru ishida depart social informat kyoto kyoto japan laboratori imag inform scienc technolog abstract paper present method build web search engin previou method elimin irrelev document page access heurist base human knowledg domain question hard build appli domain keyword improv search perform ad call keyword input modifi queri forward search engin keyword effect discov automat web document build high qualiti search engin domain requir collect heurist knowledg describ machin learn type learn extract keyword demonstr conduct experi domain cook result confirm excel perform method term recal introduct internet number user problem inform retriev artifici intellig gather inform web difficult task novic user search engin user experi skill find relev page larg number document cover wide varieti topic solut build present ntt ¤ ¥ present electr depart inform commun engin osaka citi osaka japan search engin return web page relev topic question paper method build domainspecif search engin automat base appli machin learn technolog determin keyword occurr web document author popular search engin find beef input obviou keyword top return page pertain recip hit idea ad keyword point return recip approach ingredi chicken improv search perform possibl make search engin simpli ad keyword queri forward modifi queri search engin keyword method gener find research paper web search servic straightforward approach build web search engin make indic domain document run spider collect relev page cora search engin comput scienc research paper spider effect explor web reinforc learn techniqu crawler system offer sophist search function establish local appli machin learn knowledg techniqu data domain person figur filter model build web search engin page cook web handl spider time network bandwidth consum excess type system suitabl domain web site larg indic search engin build clever search engin special find person homepag forward queri search engin sift irrelev document return filter call filter model build search engin learn mechan assess pattern relev url previou success accuraci basic depend human knowledg solut problem make domain filter automat sampl document automat text classifi document relev nonrelev major inform machin machin learn algorithm find filter train consist document randomli sampl web manual make train exampl real barrier web randomli sampl web provid small likelihood encount domain question studi text classif appli net web document limit site ratio posit exampl high previou method text classif directli appli problem build web search engin method consid web page figur keyword model build domainspecif web search engin figur sampl input keyword ratio posit exampl input queri web page elimin problem find posit exampl enabl make search engin low cost remaind paper organ section present idea build search engin keyword section describ machin learn algorithm discov keyword section evalu method section keyword model build web search engin introduc notat defin machin learn problem denot set web denot set document relev domain target function ideal domain correctli classifi document set keyword domain hypothesi space boolean express keyword regard boolean variabl adopt boolean hypothesi space commerci search engin accept queri written boolean express boolean express keyword regard function assign word keyword document filter problem build domain filter equal find hypothesi minim error rate quantiti keyword model filter document return search engin extend input queri boolean express classifi domain pass extend queri search engin model filter model method base idea build web search web page input queri web page figur scope sampl reduc set web set web page input keyword ratio tive exampl idea make easier creat train set build domain random sampl domain filter modifi input queri return document includ domain keyword domain algorithm extract keyword identifi keyword easi find good keyword input word problem find keyword provid gener handl futur user keyword denot probabl user input keyword search engin expect error rate user locat domain document system figur tree classifi document recip home recip figur boolean express convert tree figur boolean express minim expect effect keyword make train exampl start modifi statist input keyword collect input keyword candid cook domain assum candid probabl occurr collect number document keyword section split exampl disjoint train set identifi initi keyword valid set simplifi keyword section appli tree learn algorithm discov keyword easi convert tree boolean accept commerci search engin tree learn keyword attribut document figur show simpl tree classifi document node branch leaf class order classifi start root examin document attribut branch process continu reach leaf document assert belong class leaf tree classifi web document web includ figur tree induc web document belong class make initi tree inform gain greedi search prune techniqu real number attribut larg make tree correctli classifi exampl train set path induc tree end posit make boolean express conjoin keyword keyword treat posit liter neg liter path aim make boolean express queri specifi domain document enter search posit path make boolean express make disjunct conjunct make disjunct normal form boolean initi form keyword figur boolean express convert tree figur simplifi keyword figur show tree induc collect web document experi section tree grow larg trigger problem queri accept commerci search engin simplifi induc boolean express develop simplif algorithm rule conjunct remov keyword simplifi origin keyword remov conjunct disjunct normal form simplifi inform retriev recal queri evalu ratio number relev document number return document recal ratio number relev document return number relev document exist recal defin valid set set relev document classifi human set document boolean express identifi relev valid set harmon recal jr criterion remov harmon weight low valu heavili high valu high valu occur recal high simplifi keyword result high obtain keyword term recal stage simplif treat conjunct independ boolean express calcul harmon recal valid set remov keyword result maximum improv harmon repeat process keyword remov harmon remov keyword conjunct recal remain unchang conjunct yield high low recal remov keyword result improv recal exchang harmon weight lower recal valu heavili remov keyword conjunct harmon problem initi conjunct relev algorithm make conjunct larg number irrelev document remov conjunct keyword algorithm simplifi disjunct stage remov conjunct disjunct normal form simplifi keyword remov conjunct maxim harmon repeat process conjunct remov harmon ¥ gener input keyword estim distribut collect web page keyword classifi posit neg exampl hand split exampl disjoint train gener initi valid simplifi make initi tree inform gain measur prune techniqu convert tree learn set posit conjunct creat conjunct path root node leaf classifi posit exampl make disjunct normal form boolean express make disjunct posit conjunct conjunct repeat remov keyword junction result maximum harmon measur recal measur valid set keyword remov end repeat remov conjunct compon disjunct normal form result maximum harmon measur recal measur valid set conjunct remov return figur keyword extract algorithm stage conjunct gener chang cover exampl recal conjunct cover irrelev document remov conjunct larg improv slight reduct recal compon cover irrelev document remov conjunct cover relev document remov defect conjunct larg reduct recal yield simpl keyword conjunct simplif return keyword domain algorithm extract keyword summar figur tabl collect web document cook domain keyword relev irrelev total beef chicken tomato total tabl prune result trial initi conjunct keyword step conjunct keyword step keyword evalu cook domain set previou gather thousand sampl page cook domain keyword sake tomato search engin find download web page input keyword collect hundr sampl page initi keyword examin page collect classifi relev irrelev hand split collect document train set valid paid attent keyword input set randomli document input keyword perform trial sampl page split randomli fashion tabl show prune result step earli induc tree larg translat tree number keyword conjunct number larg permit entri commerci search engin step number keyword reduc step remov redund conjunct keyword number reduc number keyword accept commerci search engin trial yield keyword figur ingredi special figur extract keyword tabl averag queri index search engin queri input queri queri keyword tabl estim recal queri keyword index search engin queri estim recal keyword discov trial keyword subsequ experi conduct realist test extern commerci search keyword gener keyword figur compar valu queri keyword queri keyword input keyword check top page rank search engin number page view input queri keyword stai high tabl list averag top return result higher queri estim recal easi achiev high address high difficult recal queri harder calcul set relev document unknown estim result return search engin search engin show total number document match queri calcul estim number relev document search index averag queri top return document figur queri forward search engin number document found input input number relev document found queri calcul number document found queri keyword figur queri forward queri keyword reason consist find web page link search engin estim recal queri tabl show estim recal valu queri index high recal method filter document drop inform search process compar result figur show result submit queri averag estim recal top return document show systemat method yield great improv search perform method domain specif web search base idea keyword boolean express ad input queri improv search perform commerci search engin method build search engin domain heurist practic learn algorithm extract power keyword algorithm turn complic initi tree small boolean express accept search engin experi extern search engin yield good result keyword field higher high estim search index confirm domain cook develop search servic domain restaur page person homepag input keyword select human make train exampl criteria input keyword select discuss section suffici make exampl base distribut input queri plan open recip search system public web obtain futur work studi input keyword form train exampl affect perform system acknowledg research partial support laboratori imag inform scienc technolog ministri sport scientif refer ricardo modern inform retriev william cohen inform system reason structur collect text page mark dan dayn andrew tom kamal slatteri learn extract symbol knowledg world wide web page oren etzioni move inform food deploi softbot world wide web page andrew kamal jason seymor machin learn approach build search engin page tom mitchel machin learn ross quinlan induct tree machin ross quinlan machin learn morgan jonathan marc oren etzioni dynam refer case studi homepag domain intern world wide web page jr shaw robert patrick howel perform standard evalu ir test retriev model inform process
IR/1534 5 greedi strike improv facil locat algorithm guha dept comput scienc stanford ca comput scienc dept umiac maryland colleg md abstract fundament facil locat problem locat industri plant minim cost satisfi demand commod cost locat transport cost distribut commod problem commonli refer facil locat problem applic bank account locat relat piec discuss constant factor approxim algorithm problem obtain show simpl greedi heurist combin algorithm deriv approxim discuss variant demonstr approxim factor restrict version problem show problem max constant deriv max snp hard close relat problem set prove lower bound approxim ratio introduct facil locat set locat build facil locat cost set demand locat client requir servic client locat demand assign facil locat incur servic cost ij object minim total cost build facil servic client assum servic cost support aro muri grant nsf award match fund shell xerox corpor email research support nsf career award email ij symmetr form metric problem approxim algorithm factor ae polynomi time algorithm produc solut total cost ae time optim solut cost show approxim factor greedi algorithm gave constant factor approxim algorithm achiev approxim ratio algorithm base method introduc lin vitter round fraction solut linear program relax recent rajaraman shown local search heurist hamburg achiev constant approxim variant problem facil locat problem wide studi oper research literatur problem studi cluster analysi machin schedul inform commun network extens survei close relat work read chapter outlin result easi show problem max prove polynomi time algorithm approxim problem factor np dt log hard result establish hard proof set cover problem show simpl natur greedi algorithm combin algorithm yield approxim factor algorithm proof section section present simpl famili exampl integr fraction solut lp formul factor hard result proven assum facil cost locat ident special case facil cost improv approxim ratio section model locat facil demand vertex refer problem complet metric facil locat problem techniqu show simplifi version facil built facil cost bound np dt log facil built locat unit give algorithm achiev approxim demonstr vari hard approxim factor variat basic problem preliminari section discuss basic notat paper set locat ng subset locat open subset locat assign open facil locat posit demand ship assign locat locat cost open facil servic cost assign locat open facil ij unit demand ship assum ij cost symmetr satisfi triangl inequ find assign locat open facil minim total cost incur facil locat problem state problem integ program problem variabl indic facil open locat variabl ij client assign facil min ij ij subject ij ij ij deriv algorithm base solv linear relax integ round fraction solut integ solut defin cost open facil optim servic cost optim solut linear program formul extra constraint bound fraction cost open facil add constraint cost construct center elimin facil construct cost object simpli minim servic cost reason clear discuss algorithm notic ad fraction solut servic cost facil construct cost hard result max snp hard problem shown max papadimitri yannakaki graph node bound constant find minimum cardin vertex cover theorem facil locat problem max prove result reduc cover cover problem shown max papadimitri yannakaki show ffl approxim algorithm impli approxim cover construct instanc problem vertic correspond facil edg correspond demand locat distanc facil vertex demand locat edg edg incid vertex optim vertex cover size cost open facil jej bk demand problem approxim factor ffl ffl vertex cover optim exist assign cost jej solut cost jej ffl jej jej algorithm facil cover edg distanc total cost fi jej jej cost bound jej jej fi tb vertic open facil vertex obtain vertex cover bk size vertex cover lower bound vertex cover problem give strong hard bound present scheme produc stronger lower base recent result hard approxim set cover improv hard result establish relationship set cover problem show polynomi time algorithm problem approxim factor smaller polynomi time approxim algorithm set cover approxim ratio ln jxj recent impli np dt log instanc set cover defin set element fx collect set defin fs sm assum size minimum set cover run set cover algorithm lemma set cover instanc minimum set cover size polynomi time algorithm pick set constant cover jxj fi fi np dt log jxj run algorithm find partial cover delet cover element set run algorithm remain element iter number uncov element start iter algorithm pick fi set cover fi jxj iter total number set pick fi approxim factor fi jxj ln jxj ln fact fi fi ln fi ln fi ln ln jxj result impli np dt log lemma essenti argu pick fi time number set optim cover fi fraction element theorem polynomi time algorithm approxim factor smaller metric facil locat problem np dt log transform instanc set cover instanc problem set construct ident ij distanc set element belong extend ij metric shortest path set client basic idea approxim algorithm solv find partial solut set cover repeatedli run algorithm algorithm repeatedli find small partial cover larg fraction lemma show argu np dt log algorithm cover larg fraction obtain lower bound approxim ratio describ proof formal algorithm solv instanc set cover fl constant set cover creat instanc fl jdj client cover cost fl jdj cost facil iter jdj cost facil solut size set cover problem cover solut facil locat problem cost build facil locat set servic cost recal jdj ff approxim obtain solut cost fl total cost solut obtain approxim algorithm open fi center cost number client distanc center client distanc cost solut fi cost obtain divid ff fi ff fi fix comput minimum function fi comput smallest rh lower bound approxim ratio deriv respect fi minimum achiev fi ln fl substitut fi ff fl fl ln fl fl ff fi algorithm pick fi set cover element time run algorithm lemma conclud set cover algorithm approxim ln np dt log notic proof distanc metric distanc distanc metric arbitrari cost develop algorithm achiev approxim ratio uniform cost arbitrari distanc present algorithm approxim factor interest cost distanc improv lower bound gener problem improv approxim algorithm background review linear program relax integ program discuss section guess facil cost optimum factor fix ffl add constraint rest section assum guess facil cost ffl factor budget facil construct simplifi object function includ servic cost fraction solut lp servic cost fraction solut servic cost optim integ program facil serv demand locat iff ij demand locat order facil serv locat order servic cost ij outlin algorithm defin ff set facil lowest servic cost serv valu sum ff ff ff threshold denot defin servic distanc farthest facil set ff unsatisfi demand node minimum cheapest facil ff demand node open facil cost factor ff node ff ff serv facil chosen node mark satisfi easi argu node serv servic distanc node chosen minimum trivial true node mark serv servic distanc minim open facil correspond disjoint ff cost facil ff servic cost defin algorithm develop facil construct cost ff servic cost lemma function satisfi properti ij ij cost fraction solut establish claim observ monoton step function polynomi step design return greedi approxim denot solut facil cost servic cost ff approxim give algorithm cost time optim assum approxim problem assum provid scheme give solut approxim kei idea open facil reduc servic cost denot minimum servic cost set facil shortest path member greedi improv initi set facil form repeat step facil cost facil step find facil highest step fv facil posit gain return set facil theorem total cost paid algorithm ln start iter set facil iter servic cost exce add facil optim servic cost reduc exist set facil total cost total gain facil lemma start iter exist facil gain cost ratio facil gain cost ratio strictli smaller optim set total facil cost servic cost add facil current set facil gain notic add facil set facil gain smaller cost facil add facil time facil chang servic cost facil ad definit sum replac obtain servic cost drop add facil denot cost set facil chose facil maximum gain cost stop servic cost cross threshold iter fact total cost suffici show theorem hold end iter rearrang equat subtract observ solut notic algorithm halt exce ln facil construct servic cost give approxim bound ln situat occur iter exce distanc cost assum algorithm stop iter rewrit cost paid iter ignor facil cost exce conclud rewrit relat cost paid earlier iter bound ln ln total cost paid ln ln deriv wrt term notic neg due relat term greatest approach prove theorem corollari metric distanc approxim pick center bound servic cost formula fl ln fl approxim facil greedili approxim improv approxim algorithm combin idea section present full algorithm final step solv lp formul section notic step function polynomi step step ff function run greedi improv step solut minim cost step theorem algorithm yield solut cost time optim assum contrari fl ff facil cost ff fl ff servic cost ff fl ff immedi obtain factor approxim fl ff monoton step inequ valid ff step extend inequ hold ff inequ ff fl ff fl greedi algorithm cost fl ln fl fl quantiti factor approxim step function ff fl fl ff integr interv ff fl fl fl fl fl fl ff dff fl fl ff dff fl fl ln fl fl fl ff dff call function rh verifi posit fl guess servic cost introduc factor term involv ff notic suitabl small contradict lemma uniform facil cost facil cost chang round integr solut central theme section reli fact center profit open center nearest demand point defin neighborhood ff threshold defin distanc farthest facil set ff denot distanc closest facil suppli flow min fc ij jx ij quantiti defin analog iter pick node smallest demand node achiev minimum open facil locat closest facil open observ distanc facil node ff intersect set ff incur cost choic sum servic cost integr optim fraction servic cost notic integr exce reason proof distanc cost exce greedi improv lower assum achiev factor fl ff ff fl ff integr side inequ ff dff set case depend fl ff dff ff dff verifi valu rh exce lh ff dff ff dff ff dff verifi relat rang rh greater lh gap fraction integr solut question mind read paper issu integr fraction solut show round fraction solut integr solut total object function cost factor inher limit constant hope give famili exampl round strategi integr solut forc cost factor set set vertic set set demand creat demand subset ae size demand point servic distanc facil subset note distanc facil demand point adjac facil cost minimum fraction solut linear program formul solut obtain assign fraction center demand point adjac set fraction satisfi cost optim integr solut min cost obtain center set number demand point distanc set chosen center ratio min min min fi xc obtain min fi min fi fix minim fi ln yield ln function encount proof theorem maximum obtain complet metric facil locat recal version problem lower bound techniqu show hard set minimum domin set problem domin set problem smallest subset vertic vertex belong adjac vertex subset set cover reduc problem approxim preserv hard approxim problem factor ln np dt log similar line argument subsect argu size minimum domin set node domin fraction node rest node distanc facil cost solut fi fi minimum domin set solut cost minim fi ratio fl ln fl fl exce fl upper bound uniform cost modifi round scheme defin lp guess center optim solut pick node order facil fig serv node order servic distanc ij defin ff set facil closest serv valu sum ff threshold denot defin servic distanc farthest facil set ff ij ij servic cost fraction solut unsatisfi node minimum place facil node ff ff serv node mark satisfi easi argu node serv servic distanc notic facil correspond disjoint ff cost facil ff ff approxim relat hold techniqu previou algorithm integr exce fl result acknowledg neal young uri discuss relat hard bound mose rajeev motwani yoram discuss chandra chekuri comment earlier draft david provid copi refer find integ solut linear proc ibm scientif comput symposium combinatori page facil locat discret locat theori page threshold ln approxim acm symposium theori page fix cost median mathemat approxim algorithm pw publish local search heurist facil locat problem annual symposium discret heurist program locat manag lin algorithm geometr median inform process lund hard approxim minim journal locat manag lagrangian relax concentr locat network cluster applic lagrangian manag scienc papadimitri complex class journal comput system scienc algorithm facil locat acm symposium theori page work model plant number farm
Agents/1535 1 transact electron commerc andrei research group institut inform system eth switzerland intern workshop foundat model languag data transact dynam schloss springer lnc abstract electron commerc rapidli grow area gain import interrel busi electron everydai consumpt individu perform internet custom electron electron commerc interdisciplinari lot impact commun goal paper identifi summar impact electron commerc transact point view highlight open problem transact manag electron commerc applic reflect discuss work group electron held workshop motiv exchang electron data compani import issu busi interact recent internet rapid propag person comput led enorm diversif ubiqu busi perform electron oper distribut heterogen encompass electron commerc coupl problem context affect commun infrastructur busi model cryptographi aspect inform inform transact process fair interact particip presenc potenti malici enforc complex busi process transact execut support holist electron commerc infrastructur exampl problem dealt order provid feasibl solut paper summar work group electron commerc held workshop point benefit transact particip work group alphabet de andrei offer protocol applic electron commerc open problem exist area section impact internet electron commerc discuss section gener idea distribut transact address transact workflow order cope special requir electron system architectur secur transact legal issu discuss summari section internet transact import characterist electron commerc interact place internet atom commit import requir distribut electron commerc transact execut transact heterogen lack transact commun protocol consid unlik tradit phase commit limit applic common approach xa applic program interfac standard necessit effort transact internet protocol tandem microsoft aim overcom mention problem internet transact highli electron commerc applic main idea tip pipe separ applic commun protocol commun transact manag level atom commit import build block electron commerc consid suffici dynam aspect flexibl mechan ensur correct complet electron commerc workflow process requir transact workflow interact electron commerc structur inher complex long durat workflow process mean encompass depend electron commerc interact identifi transact properti crucial requir order make process viabl electron commerc applic transact properti correct singl process correct concurr execut process access share resourc address transact process manag approach exploit electron commerc applic import aspect area exploit flexibl offer workflow technolog respect failur handl altern execut abil prove correct process transact electron commerc payment process import applic transact workflow electron commerc gener approach cover phase trade interact negoti requir order provid complet holist solut agent transact system wide consid mean cope complex larg inform system decoupl small easili manag agent electron commerc agent import mean support particip custom broker system mobil singl compon dynam emerg continu ad remov transact properti agent interact crucial problem intersect agent technolog transact manag correct singl agent spite hierarch structur plan made level basic prerequisit correct system agent architectur agent implement enhanc transact support multilevel transact approach present concurr agent interact dealt transact requir order ensur correct system time dynam system context transact agent technolog compon applic secur transact discuss previou electron commerc applic scenario encompass transact interact implement eventu dynam process basi respect eventu implement local cryptograph mechan tightli coupl kind inform exchang electron commerc transact order integr author authent seamless project higher atom isol protect inform ensur particip cheat andrei extend notion transact transact model protocol messag order prove case parti corrupt protocol addit inform ad protocol enabl trust particip check correct commit scenario mention implement test easier secur custom move transact wider area applic profit model question extend formal describ secur formal descript secur automat check correct secur requir trust parti encompass secur act parti ensur anonym particip secur transact legal issu secret law busi regul countri nation commun instanc usa neglig strong impact electron commerc softwar develop side atlant custom pai receiv usa pai prior receipt lead electron commerc scenario europ usa solut area electron commerc reflect legisl differ permit homogen landscap electron commerc solut lead higher integr compani contin order understand concret legisl differ clear classif scenario addit busi model vari tax appli countri state reinforc heterogen problem encount electron commerc applic necessit support coher solut persist data gather electron commerc transact requir order fulfil legal regul requir posteriori verifi fair transact persist ethic problem term privaci extent data subsequ exploit transact electron commerc close electron commerc clear transact execut interact involv particip import prerequisit topic identifi kei properti electron commerc solut form transact point languag support specif languag transact logic model interact depend electron commerc transact add addit properti transact instanc wrt integr essenti aspect electron commerc transact specif level base specif electron commerc valid mechan ad model environ order formal prove absenc valid properti transact electron commerc specif support execut electron commerc enforc requir order support busi interact infrastructur gener electron commerc transact provid offer possibl plug build advantag approach valid compon extens tight link model environ automat transform specif execut electron commerc transact complet effort viabl electron commerc system offer mention characterist order provid feasibl coher system tool electron commerc applic fit commerci collabor commun requir transact varieti aspect discuss paper consid acknowledg author comment earli draft work group summari activ particip work group electron contribut andrei refer busi busi intern workshop research issu data engin inform technolog virtual page march ieee comput societi bonner kifer logic program chapter kluwer academ march chomicki editor logic inform system kluwer academ march grai reuter transact concept techniqu morgan klein transact internet protocol version network work request comment juli weikum workflow technolog electron commerc net march implement model agent layer architectur transact environ st intern workshop inform system june schek concurr control recoveri transact process manag acm symposium principl system page acm press schek execut electron commerc payment intern workshop foundat model languag data transact dynam page schloss septemb preprint magdeburg springer lnc alonso transact coordin agent composit system intern engin applic symposium page august ieee comput societi secur electron market place transact mobil electron commerc intern workshop foundat model languag data transact dynam page schloss septemb preprint magdeburg agent achiev serializ presenc failur heterogen intern confer parallel applic page miami march ieee comput societi
ML/1536 6 video index tv broadcast hidden markov model stefan stefan uller faculti electr engin germani abstract paper present approach video index hidden markov model approach featur vector calcul imag video sequenc featur vector model classifi hmm approach advantag compar video index approach system automat learn capabl train present manual index video sequenc improv system video classif complex video sequenc present approach work time faster test system tv broadcast rate correctli classifi frame show effici system introduct amount digit video multimedia result demand techniqu automat access video data year approach video index rough categor approach yield main class class approach address problem video sequenc tv studio approach video sequenc segment shot extract shot store librari refer video tape sequenc access scene user present queri imag retriev system search similar depend predefin featur textur approach extend techniqu imag retriev retriev imag sequenc class approach inform retriev video sequenc address content mean queri main articl month broadcast user list articl view video sequenc store approach class present base stage scene classif scheme stage video order extract scene stage assign scene compet class main problem method scene extract scene classif separ step error scene extract correct classif extract scene imposs import scene separ easili bound edit manifold tv hard detect index approach base content class repres hmm featur vector deriv frame video sequenc probabilist decod procedur calcul sequenc maxim probabl gener featur vector sequenc procedur superior compar stage index perform stage hmm capabl combin scene model complet video model tv assign frame state model automat learn capabl hmm effect process larg amount video data automat analyz characterist video content video index system base hmm content class video model tv broadcast index tv broadcast defin content class tv defin main content class similar tv station hand side screen newscast read left hand side displai headlin imag relat topic introduct sequenc newscast newscast end sequenc interview newscast interview person weather class weather map anim static symbol type weather condit singl shot report class includ scene belong defin class class defin edit scene shot boundari edit effect dissolv report wipe delimit consecut report figur frame class newscast window chang newscast effect separ topic includ knowledg broadcast index defin video model tv broadcast video model defin content class determin transit fig video model present transit arc featur extract section describ calcul featur input hmm featur vector calcul frame input sequenc import featur video index base differ imag motion main object scene differ imag deriv origin video sequenc absolut differ lumin valu adjac frame frame differ imag sequenc chang part frame compar previou frame differ imag repres motion imag directli size grai valu frame differ imag sequenc consid indic intens motion posit imag suitabl featur motion distribut center graviti vector interpret imag abil hmm model movement includ delta featur featur vector delta featur defin featur averag absolut deviat motion point imag center motion oe defin oe oe featur similar translat invari moment robust imag sequenc consid import featur express xy featur describ characterist show featur detect video sequenc report influenc flash photograph frame flash result high eq recogn classif process avoid smaller motion intens frame min xy shown differ imag featur suitabl recognit complex movement featur featur similar recogn gestur high accuraci hmm case classif investig serv insight experi order studi possibl stochast model video final led basic principl approach present paper report intens differ histogram featur cut detect confid cut detect significantli intens differ histogram base histogram defin hg hg defin bin frame move object front uniformli color background small influenc histogram result low differ histogram edit effect produc high valu reduc effect flash photograph eq smaller featur frame min hg begin cut window chang newscast newscast interview cut dissolv wipe cut report weather forecast cut cut end interview newscast newscast interview person cut cut figur video model tv broadcast detect rate cut improv median eq base median remov imag differ filter origin detector static inform result improv classif result averag color compon frame add featur vector xy special featur design detect dissolv edit effect dissolv pixel similar interpol adjac pixel valu condit true static ratio differ pixel differ interpol pixel imag video sampl audio signal assign logarithm energi improv segment ln addit cepstral vector calcul sampl frame enhanc segment classif result featur extract method featur vector consist featur statist classif hidden markov model effici tool model pattern sequenc successfulli speech onlin handwrit recognit approach hidden markov model build stochast model content class hmm train defin content class present sampl data algorithm order hidden markov model state continu output distribut model content class video model broadcast convert superior hmm content class state output classif evalu optim path result viterbi algorithm assign content class frame video sequenc video model restrict optim path sequenc content class occur defin model automat incorpor model hmm framework decod semant constraint video model fulli integr recognit procedur automat video model integr major advantag statist approach video index note model edit effect plai major role serv import node model displai fig upper part fig show insight nest structur content class interview hmm order detect optim path class experi result experi record tv tv station tv captur vh video tape imag resolut pixel rate frame audio signal sampl rate khz obtain result carri tv station depend tv station independ index experi tv broadcast station depend test system record ten tv tv station length rang minut maximum amount train test data method mean train system segment boundari segment insert delet accuraci classif tv station depend tv station independ tabl recognit result tv content class correct detect detect newscast report begin end weather forecast interview wipe window chang dissolv tabl tv station depend test remain sequenc test procedur repeat video final calcul measur defin averag recognit rate broadcast content class tab show recognit result insert delet rate segment accuraci segment boundari frame rate correct classifi content class tab correct detect detect rate content class detect class newscast sequenc press similar movement compar newscast weather forecast lower recognit rate main content class featur suitabl recognit class featur includ system textur featur suitabl improv model weather forecast station independ experi record addit broadcast tv station similar style experi recognit system train station depend test test addit tab show recognit rate broadcast averag segment classif rate video index system work time faster realtim index minut tv comput time minut pc advantag time consum futur work present approach video index show high recognit rate task tv broadcast index begin index result convinc video index incorpor advantag comparison standard exploit automat learn capabl hmm possibl learn larg amount train data scene classif scene boundari detect process automat incorpor stochast video model capabl futur appli index approach complic task content class sport classif refer motion color base video index aug picard societi model video imag librari perceptu comput section technic report mit media christel applic informedia sept zhang video index retriev ieee approach video index hidden markov model workshop imag analysi multimedia interact servic page june wilcox hidden markov model framework video segment audio imag featur proc ieee digit video index multimedia system proc workshop index multimedia system aug improv featur extract method high perform imag sequenc recognit proc ieee page apr rabin tutori hidden markov model select applic speech recognit proc measur evalu video index system technic faculti electr engin comput
DB/1537 3 queri scrambl initi delai urhan maryland michael franklin maryland laurent irisa abstract remot data access dispar sourc network internet problemat due unpredict natur commun medium lack knowledg load potenti delai remot site queri process approach break environ unabl adapt unexpect delai queri scrambl address problem scrambl modifi queri execut plan delai encount runtim origin scrambl base simpl provid good perform shown suscept problem result bad scrambl paper address shortcom investig wai exploit queri optim technolog aid make intellig scrambl choic approach queri optim scrambl approach optim total work construct partial complet altern plan random queri distribut queri process workload deriv queri tpcd evalu approach compar abil cope initi delai access remot sourc result show effect hide initi absenc good predict expect delai fundament tradeoff risk effect introduct ubiqu connect led tremend distribut data sourc access desktop access work partial support nsf grant offic naval research contract number order number ibm share research award laurent work partial support inria fellowship perform work maryland perform navig hyperlink perform search search engin distribut queri develop relat object relat plai role data access benefit declar queri express power queri autom optim queri larg unavail access data sourc internet absenc declar queri process place unnecessari restrict type applic exploit interconnect data sourc sever limit demonstr recent battl system oodb approach remain larg nich approach embrac major vendor import declar queri process natur investig wai provid function wealth data current network queri process distribut environ pose number difficult technic challeng issu semant manipul resourc discoveri locat relev subject research recent year sad problem daunt gener pragmat approach provid function typic situat start solut base model techniqu provid abstract implement applic util multipl sourc internet effort address semant issu data effort put solv perform problem inher access kei perform issu distribut inform system unpredict data access network involv larg number remot data intermedi commun vulner congest failur problem unpredict delai access inform remot sourc tradit distribut queri process strategi break environ unabl adapt unexpect delai queri execut plan typic gener set cost perform oper cost obtain data due appar random delai optim delai priori execut static optim queri plan presenc time problem inevit queri queri scrambl address issu unpredict delai dynam approach queri execut call queri scrambl queri scrambl react unexpect delai oper queri execut remot access queri scrambl hide delai encount obtain data remot sourc perform transfer perform queri schedul point execut queri scrambl defin consist reschedul schedul oper activ queri plan chang delai oper synthesi phase queri plan typic creat oper current queri plan origin phase algorithm set heurist rule activ delai obtain remot data detect heurist paper shown effect hide delai shown prone make poor scrambl case heurist result perform simpli wait delai data arriv address shortcom investig wai introduc queri optim scrambl make process focu problem initi delai manifest problem receiv tupl remot sourc initi delai typic difficulti establish connect remot sourc sourc heavili load absenc global queri optim optim consid cost queri site remot sourc initi delai remot sourc perform amount work return tupl make number fundament issu exploit queri optim technolog scrambl basic question object function optim base total work time relat optim aim reduc total work cost model classic system optim includ term cpu disk model overlap cpu disk process distribut extens optim system ad addit term messag model overlap cost optim predict overlap work addit total amount work time optim plan higher total work parallel plan work higher sequenti notion remot access inher time issu delai incur work postpon complet queri investig optim queri scrambl major result work optim estim expect place access delai data proper point queri execut plan qualiti placement depend accuraci delai predict current delai predict internet primit investig approach integr optim scrambl process approach aggress scrambl assum delai approach conserv develop algorithm perform scrambl optim base total work rest paper organ section overview cost base queri scrambl describ integr queri optim scrambl section describ environ experi section analyz cost base scrambl algorithm distribut queri process workload deriv queri benchmark relat work discuss section final section present queri scrambl queri scrambl overview paper assum queri execut environ consist queri site number remot data sourc process work queri split queri sourc remot site queri plan produc queri optim base cost object function arrang typic mediat integr data heterogen sourc queri execut plan environ shown figur queri involv base relat store site relat resid separ remot relat resid local queri relat fourth site site site site join select commun link site queri result figur complex queri tree static schedul remot access queri plan suscept delai access data iter approach data access request tupl relat site delai access site scan entir queri block site recov queri scrambl react delai wai phase phase ffl reschedul execut plan queri dynam reschedul delai detect basic shape queri plan remain unchang queri scrambl treat remot sourc black remot data comput oper sole queri site addit oper ad discuss section ffl oper synthesi oper join relat directli join origin creat oper execut shape queri plan significantli modifi remov rearrang queri oper queri scrambl iter work repeatedli appli techniqu queri plan assum queri shown figur stall retriev tupl wait remot site queri scrambl perform retriev tupl unavail tupl store temporarili queri site obtain reschedul invok trigger execut site join result oper synthesi invok creat join oper initi queri scrambl experi scrambl invok assum scrambl step reschedul queri execut system check avail delai data delai data access step step arriv delai data check delai data iter scrambl algorithm begun delai access remot current scrambl step start discuss section origin formul scrambl address shortcom earlier approach incorpor queri optim scrambl process focu paper phase appli make phase briefli describ cost inform phase describ approach integr cost inform phase comparison approach address detail remaind paper reschedul phase start identifi runnabl plan made oper block runnabl schedul order insert oper root root parent materi oper issu call root save result temporari relat result origin scrambl algorithm reschedul simpli queri plan left run runnabl runnabl parent oper encount origin algorithm queri optim scrambl queri optim comput expect cost term total runnabl cost runnabl mw cost write materi temporari result produc cost read temporari disk cost execut note mw mr repres addit cost incur run order note mw mr differ depend rel cost disk write read system effici runnabl comput intuit mr work save futur schedul mw durat scrambl oper ratio improv time unit scrambl execut phase runnabl order effici effici threshold set execut phase approach cost favor runnabl materi origin plan effici produc small result iter runnabl run check delai data start arriv scrambl termin point delai data iter scrambl initi oper synthesi phase queri scrambl invok progress made phase unlik phase simpli schedul exist phase creat typic oper studi approach queri optim phase optim strategi state section optim integr scrambl object function base total work time deal type optim differ optim natur suit queri scrambl estim total work work overlap abil overlap exploit queri scrambl simpli optim long data sourc optim coerc find plan perform work overlap delai work optim schedul overlap delai delai data queri optim deal order gener valid queri plan problem requir durat delai sourc priori scrambl deal delai remot sourc internet current state predict primit note line bottom browser approach paper optim provid fix estim expect delai durat invok approach call includ simpli long queri delai durat optim push access delai data back plan call estim delai initi assum delai subsequ estim delai turn longer earlier guess altern optim tradit object function base total work ignor potenti mr mw root oper write result disk regular queri schedul adequ cope notion delai delai inform account object function solut problem simpli remov access delai data queri paper explor approach call optim gener plan individu join polici phase origin scrambl algorithm section briefli describ ed pair pair approach total optim construct queri plan singl join relat block optim relat share join predic avoid cartesian calcul cost join join total cost execut cost comput includ cost materi result result join materi scrambl iter addit avoid cartesian pair polici avoid join produc result longer read disk comput scratch end polici check arriv delai data data iter begun pair run qualifi join delai scrambl simpli halt wait arriv pair polici construct singl queri tree comput result normal execut resum scrambl pair polici maintain complet queri plan repres final work pair relat call reconstruct util optim find optim queri plan includ delai contrast pair iter scrambl gener complet altern plan delai data optim told delai durat larg time longer expect time approach result delai access push back plan schedul interest note optim push access end schedul incur excess work delai data result perform optim natur recogn situat place delai access plan issu optim manner optim plan ultim result time delai give delai harm decid initi work order hide commit perform entir step refer durat step risk potenti improv time benefit optim plan greatest benefit risk overlap expect delai durat problem delai turn short order introduc paramet call prevent optim plan small potenti gain plan express ratio amount benefit optim give save risk effect make polici conserv perform knob studi section estim delai estim delai approach work similarli start assum huge short success delai estim motiv approach assum larg delai initi optim pick riski plan high payoff long hurt perform short delai delai estim scrambl render ineffect larger delai optim run high pai plan ed work start pick estim delai equal origin queri time delai data iter repeat estim delai long progress made iter small origin queri time final origin time scheme scrambl perform iter low make progress event delai turn scrambl hurt event longer ed attempt plan note polici gener impact ed conserv polici environ experi perform detail simul distribut queri process random queri workload base queri benchmark describ section simul environ studi perform scrambl approach implement top simul model environ capabl realiz schedul queri oper singl join hybrid hash tabl show main paramet configur simul main set studi type site data store base data queri execut queri site cpu speed mip buffer pool size current simul configur singl queri site remot data sourc site experi addit load sourc site gener queri request simul charg function perform queri oper move tupl system cost disk process network protocol overhead disk model detail set adapt model disk model includ cost random sequenti physic access charg paramet descript number data sourc site mip cpu speed number disk site size disk page size disk write buffer size data request size data transfer compar appli predic hash tupl move copi byte queri site memori size data sourc memori size network bandwidth instruct send receiv messag instruct byte instruct read page disk tabl simul paramet main set softwar oper implement unit disk page size disk prefetch page read perform current version page obtain read access request made disk addit disk charg instruct disk access disk deliv data averag rate approxim sequenti rate approxim random disk queri site temporarili store intermedi queri result data obtain remot sourc queri execut small base relat perman store queri site base relat store disk sourc section sourc configur workload experi perform server memori cach queri relat remot site access experi base relat read sourc disk queri execut select project base data requir queri perform sourc data ship queri site queri scrambl buffer manag special polici pin data scrambl iter cach data manag lru polici case amount pin data prevent alloc addit buffer space pin data imag local disk access earli plan prefer remain memori relat disk write intermedi result buffer group order amount sequenti join memori write page network model point point connect sourc queri site link failur independ speed link set slightli higher speed sequenti disk access data order make network speed bottleneck experi detail network technolog model cost send model simul charg messag size network cpu instruct network protocol consist fix cost messag cost base size messag cost paid sender receiv queri execut model approach remot data access oper run queri site remot send request sourc wait repli sourc respond block byte data queri site emploi prefetch reduc network latenc delai model simpli block link remot sourc queri site delai model suspend process sourc connect sourc queri method queri optim optim similar optim run iter improv algorithm simul anneal trade qualiti chosen queri plan optim time chang control number start point search space number iter perform start point ii phase variabl tabl scale number relat queri number plan gener optim quadrat number relat search space optim includ left deep bushi plan paramet descript nr start point search space nr iter perform start point nr variabl number relat queri optim knob tabl optim paramet main set optim provid object function rate altern queri plan function base total base time time model deriv defin calcul expect time potenti parallel addit work queri oper optim inform relat particip queri includ data join predic select predic relat select factor predic depend scrambl approach inform subset relat optim estim delai includ delai approach provid inform relat estim long delai expect recal section approach special control tradeoff made optim default knob aggress set effect conserv set investig section workload state examin perform approach queri deriv benchmark base scale factor tabl tabl show data size relat model effect project tupl process queri site reduc size project tupl site fix amount select project push data sourc remot sourc read page disk scan relat transmit page queri sourc project appli sourc possibl fewer select predic byte size tupl produc join tabl tupl tupl page project primari kei size page region nation supplier custom order part tabl schema data size relat small chang copi maintain access queri site remain base tabl separ remot server term chosen queri experi queri chosen fairli complex provid opportun interest scrambl behavior simul model aggreg group order modifi origin queri slightli modifi version section note goal queri start point examin approach realist join claim draw perform actual benchmark methodolog graph shown section plot durat initi delai remot sourc time achiev scrambl approach result approach tend exhibit step behavior due iter natur scrambl process graph gener combin memori delai ran scrambl approach long delai find delai durat point iter occur approach delai durat interv queri time show time pick delai interv run scrambl approach obtain time delai durat time time entir interv random care initi plan scrambl plan gener good plan bad plan result spuriou effect due scrambl approach ensur good plan gener interv higher valu ii paramet search run repeat time ensur repeat scrambl iter interv ran data point combin delai scrambl memori delai time normal optim paramet check plan gener point conform interv found gener time accur minu sec sec sec sec sec tabl optim time number base relat result report section includ time requir run queri optim goal avoid mix number real queri optim simul system tabl optim time obtain optim ibm small compar time queri time obtain optim tune reduc optim time expect lower order handl queri larger join experi result experi nation market share begin studi perform approach delai encount execut modifi version queri nation market share queri sql statement shown figur select nation nation region europ small plate steel figur modifi nation market share queri join select part relat figur show queri graph queri queri abbrevi relat letter edg relat join predic relat edg label join select predic queri detail relat queri site refer type date region figur queri graph queri figur queri plan memori box select select predic list fraction select box run queri memori alloc identifi tabl assum select project appli remot data amount data process queri site significantli sum raw relat size memori alloc page suffici run hash partit smaller memori alloc largest relat result partit order join initi queri plan gener optim page page alloc shown figur initi plan memori size ident figur binari oper shown figur hash bold edg join requir relat partit turn result experi figur show result page page memori graph shown paper initi delai remot relat part queri time addit curv scrambl graph parallel diagon line lower line simpli magnitud delai queri complet relev data line repres time higher diagon label repres time obtain scrambl delai relat optim queri plan part valuabl relat plan reason iter execut model activ oper delai relat leav remain work absenc scrambl queri part relat plai role reduc largest relat schema select predic fact particip function join assum uniform distribut independ join attribut select part reduc size intermedi select select predic presenc part import significantli reduc number tupl process queri queri larg memori alloc turn page case scrambl approach effect hide delai part ed effect hide delai delai knee time virtual unchang approach effect hide delai equal origin time entir queri case delai scrambl run addit work time parallel delai differ time line delai line repres amount work delai tupl begin arriv note pair approach perform slightli ed materi intermedi result disk case phase run scrambl materi relat custom iter phase begin approach find altern plan perform shown figur initi plan basic graph left part delai imposs start end queri graph left pick reduc queri result comput phase reduc access larg relat contrast origin scrambl algorithm polici execut runnabl queri result join order absenc region algorithm shown page join requir result larg perform hit time obtain approach jump delai long delai algorithm perform significantli simpli wait delai relat arriv ran experi memori alloc page case approach perform ident page case page suffici run scrambl plan main differ larg memori approxim time alloc origin queri algorithm perform roughli approach perform due fact extra memori ineffici join pick run partit cpu cost neglig portion queri execut time avoid extra materi due implement pair avoid sophist memori manag approach simul case origin heurist base algorithm work time memori alloc origin queri time delai pair ed delai figur part time delai pair ed delai figur part lead reason perform tradeoff algorithm similar rest experi show result algorithm focu tradeoff approach queri small memori alloc smaller memori alloc shown figur stori significantli page suffici run queri delai reason effici time slightli higher larger memori smaller problem scrambl requir result perform approach queri scrambl start run phase custom result subsequ step scrambl algorithm approach aggress assum delai part initi lot scrambl work order hide delai approach simpli push part queri join remain relat order previou case join lack memori result partit local delai worst perform scrambl perform scrambl rang delai manag perform work queri perform delai ed approach conserv begin join result comput phase region supplier step bring write local wait part arriv curv conserv behavior result perform shorter ultim perform longer work remain tupl part eventu begin arriv pair initi perform step ed stop perform join requir long addit join eventu pai pair similar perform delai interest note pair perform join delai rang perform pair gener complet make local pair time make intellig partit result result subsequ oper word pair polici recogn interest order ass futur save due execut slightli plan gener interest order asa pair simpli materi intermedi partit repartit gener amount random experi local supplier volum turn set modifi version queri call sql queri shown figur queri join select predic shown figur queri graph unlik graph previou experi select region figur modifi local supplier volum queri figur show initi optim queri plan memori alloc page greater memori alloc notic larger memori bulk queri execut proce direct join cycl smaller alloc execut opposit join requir partit memori delai custom larg memori hash tabl supplier built date region figur queri graph queri figur queri plan gener time delai pair ed delai figur custom time delai pair ed delai figur custom memori region nation comput custom determin block small memori case delai relat encount immedi queri larg memori alloc figur show result initi delai custom memori alloc page custom import relat queri plan transmit select predic region order larg relat algorithm provid benefit scrambl delai approxim hide delai durat pair approach perform similarli basic execut pair produc plan join join requir partit involv order reduc join region initi time scrambl plan initi plan ed perform short delai due conserv approach bring order remot site store local disk commit scrambl move fetch order risk short custom arriv order queri ed slight perform penalti delai result fact order repartit custom arriv time ed ed pai small penalti conserv approach delai rang order win advantag small delai result memori alloc shown figur case initi plan presenc scrambl plan produc larger scrambl plan execut partit provid excel protect delai approxim queri experi pair pai slight penalti due temporari result local disk queri small memori alloc experi queri small memori alloc custom delai case scrambl approach perform time basic flat delai durat time phase scrambl perform join involv custom figur creat oper entir comput order nation supplier simpli execut reschedul approach plai experi product type profit measur set experi describ perform modifi version shown figur queri shown figur obtain similar result memori show result page alloc initi queri plan case shown figur delai reduc queri select nation pname figur modifi profit perform scrambl approach vari delai part shown figur approach join relat queri result intermedi result time larger part intermedi result propag entir result move pair approach perform join perform reduc risk short incur addit overhead long due partit intermedi result save local disk similar effect queri conserv ed approach perform good pair polici delai ed avoid join larg simpli wait delai relat point usual result penalti longer penalti outweigh advantag shorter delai experi demonstr potenti benefit make conserv scrambl recal ed approach incorpor knob time base prevent polici plan small potenti gain plan experi knob set tabl mean optim give unit potenti benefit long delai plan total work unit result riski behavior short delai studi effect set repeat experi valu result similar result default set conserv set impact result set shown figur knob effect pair approach base total notion risk benefit ed approach conserv set greater impact conserv set result substanti perform short delai delai time delai time compar rang aggress set addit pai cost term amount delai hide long cost delai advantag short delai outweigh cost higher delai interest note conserv knob requir scrambl iter delai greater iter produc plan leav work remain delai relat conserv set lesser effect ed approach ed favor conserv small delai higher knob prevent ed perform ultim benefit risk result ed perform delai aggress knob set summari result experi section demonstr import result queri scrambl briefli summar result experi show suffici approach effect hide initi delai realist data process queri delai relat encount earli queri delai long normal time queri complet absorb origin perform significantli simpli wait delai end substanti extra memori dedic scrambl absenc reason predict delai durat tradeoff conserv safer short aggress approach lead bigger save event long delai amount delai hidden scrambl absenc creat addit discuss limit normal time queri hide delai perform abil hide delai limit amount work delai normal origin benefit scrambl total execut time begin argument lead favor conserv polici larger risk memori scrambl scrambl plan gener longer delai durat requir order scrambl pai situat scrambl absenc predict delai danger show aggress ed polici adjust paramet optim give potenti gain long delai order reduc risk short delai state tradeoff make absenc accur predict delai durat final import result approach lack global view scrambl plan unnecessari work pair relat pair unabl pick slightli suboptim plan gener interest order order complet scrambl optim time object function optim delai relat proper point plan predict complet altern queri plan gener conduct experi delai relat synthet gener queri found relat risk scrambl favor conserv algorithm color ps figur queri graph queri ps figur queri plan gener time delai pair ed delai part time delai pair ed delai figur part relat work briefli discuss relat work volcano optim dynam queri schedul introduc plan set altern subplan order lack inform system paramet compil time queri startup time subplan chosen depend current paramet relat approach gener multipl altern queri initi adapt system paramet occur queri execut approach multipl execut logic oper start time execut oper determin execut winner execut complet work close relat mind heterogen project perform optim queri execut queri divid subqueri subqueri particip site execut result increment dynam introduc oper process result arriv algorithm resembl pair algorithm set heurist reli statist techniqu order avoid bad queri improv reorder join tree bushi join tree creat cost reorder algorithm present work limit queri assum reorder compil plan run possibl slight total work bushi plan gener vulner delai branch tree found directli affect delai execut independ research prototyp commerci successor heterogen distribut perform dynam queri optim construct queri plan step queri optim dynam inform intermedi relat cardin system perform advantag static gener plan dynam account sourc respond futur work investig approach queri optim make intellig choic queri scrambl approach optim object function base approach tradit optim base total work time optim advantag construct complet queri execut plan includ access delai data base estim expect delai optim place delai data proper place plan poor state current estim techniqu data wai optim demonstr approach exhibit fundament tradeoff risk short abil hide larg delai show case algorithm effect hide delai wide rang approach hide delai durat equal time queri situat due grow import data chaotic futur work scrambl relat dynam techniqu discuss scrambl adapt type bursti site repeatedli stall recov delai introduc number schedul memori manag issu address scrambl investig delai predict techniqu scrambl approach addit techniqu requir deal long period unlik techniqu necessarili chang answer return number interest semant question addit question address current focu incorpor cost base queri scrambl queri engin predat extend ad remot access capabl plan system test bed queri scrambl internet refer urhan improv access ieee data engin vol dynam queri oper schedul remot access journal distribut parallel vol juli urhan scrambl queri plan unexpect delai pdi dynam queri optim icd brown workload specif languag master yu distribut queri process multipl system ieee journal select area dewitt object decad vldb cole graef optim dynam queri execut plan acmsigmod dayal reduc queri tree balanc acmsigmod san krishnamurthi queri optim parallel execut acm sigmod san graef queri evalu techniqu larg acm comput kang random algorithm optim larg join queri acm atlant selli parametr queri optim vldb wong queri optim simul anneal acm sigmod san kim modern object acm milo queri world wide web pdi lohman optim valid perform evalu distribut queri vldb dogac dynam queri optim data engin vol wimmer garlic project acm sigmod price select relat manag system acm sigmod kent modern object chapter heterogen inform manag system acm shapiro join process system larg main memori acm tran vol ramakrishnan case enhanc abstract data type vldb van deal complex feder access vldb transact process council tpc benchmark standard rev valduriez scale heterogen design disco icdc hong
DB/1538 3 consist queri answer inconsist arena universidad de chile de departamento de ciencia de santiago chile universidad de chile de departamento de ciencia de santiago chile jan chomicki depart comput scienc west long nj abstract paper problem logic notion consist answer relat violat integr constraint notion captur term repair version method comput consist answer sound complet class constraint prove method base iter procedur termin class constraint prove introduct integr constraint captur import norm aspect applic case satisfact exist inconsist instanc import queri answer consist integr constraint provid logic consist queri answer relat inconsist integr constraint answer queri pose violat integr constraint consist answer obtain minim repair version origin provid method comput answer prove properti basi queri method iter queri tw evalu consist return set consist answer origin queri applic result number data wareh data data sourc typic satisfi integr constraint usual approach clean data remov inconsist data store result make determin data clean proce safe remov data scenario inconsist remov queri answer mark inform loss due data clean prevent integr integr provid singl unifi view user integr difficult requir resolut kind discrep integr discrep due set integr constraint integr local satisfi integr constraint global violat assign address student conflict fail resolv inconsist data autonomi import find set local integr queri answer return integr consist constraint activ reactiv violat integr constraint accept provis repair futur stock level fall requir minimum replenish order temporari queri answer give indic consist constraint problem acut activ consist result evalu trigger condit consist integr constraint treat differ isnt present basic intuit notion consist queri answer subject oe instanc violat constraint queri return answer consist integr constraint plan paper section introduc basic notion includ repair consist queri answer section show method comput queri tw firstord queri subsequ properti method sound section complet section termin section section discuss relat work section conclud outlin prospect futur work area proof appendix basic notion paper assum fix schema fix infinit domain order languag base schema element assum element domain instanc schema finit structur interpret order languag share domain relat instanc finit activ domain subset predic infinit ident instanc set integr constraint express instanc expect satisfi assum ic consist instanc make true definit instanc consist satisfi ic standard ffl inconsist paper address issu obtain queri answer consist obtain queri answer consist challeng part deal inconsist repair instanc denot set formula ffl ps relat ground tupl definit distanc instanc symmetr definit instanc distanc equal distanc notic predic contribut ds fix ident instanc definit instanc repair ffl ic class instanc satisfi ic constitut repair depend set integr constraint assum set fix schema unari relat domain assum instanc ic oe satisfi ic ffl case possibl repair falsifi obtain instanc make obtain instanc definit repair satisfi desir expect properti consist satisfi minim condit wrt relat repair repair satisfi finit ic supplier item class oe instanc violat suppli class repair suppli class suppli class oe item suppli item inconsist suppli instanc suppli suppli student mean student student student address ic state argument kei relat oe oe inconsist instanc student student student consist queri answer assum queri prefix disjunct normal form definit formula queri syntact sequenc quantifi predic queri existenti possibl queri definit tupl answer queri instanc tupl answer set queri fq definit set integr tupl consist answer queri instanc write repair ffl true consist answer write repair ffl consist answer queri pose instanc consist answer queri pose instanc repair instanc obtain consist answer queri pose queri obtain answer gener approach present method comput consist answer queri queri queri defin base notion residu develop context semant queri optim context deduct optim process answer queri semant knowledg domain ic basic assumpt ic satisfi inconsist assum satisfact ic answer queri attempt obtain consist answer queri queri queri ic obtain answer db inconsist iter modifi queri residu obtain queri properti set answer set consist answer shown properti hold restrict class queri gener residu relat db constraint begin transform integr constraint standard format definit integr constraint standard format form repres closur tupl variabl formula mention equal notic ic constant push usual ic db transform standard function set depend form oe transit constraint form oe usual ic deduct rule accommod includ rule disjunct logic negat head depend form oe transform standard format rule schema gener instanc expand obtain deduct semant queri optim neg posit occurr ic standard treat separ gener residu rule motiv ic true make true gener queri residu attach queri ic standard format posit occurr predic residu gener sequenc quantifi variabl formula residu rule variabl residu rule gener neg occurr predic residu gener sequenc quantifi variabl formula residu rule residu rule gener notic rule posit rule neg predic posit occurr residu comput function subsequ residu redund case transit multipl residu redund ic standard format ic rule notic rule gener predic residu fix extens contribut violat ic modifi make ic true ic satisfi ic made true make rule simplifi residu rule form auxiliari quantif introduc step elimin quantifi variabl residu process appli rule form comput tw order determin consist answer queri arbitrari make famili oper consist tw definit applic oper queri defin induct mean rule empti predic rule negat predic rule formula disjunct normal sequenc quantifi formula includ definit applic oper tw queri defin tw ft queri final reach fix point tw show oper tw conserv extend standard queri evalu consist proposit instanc set integr constraint ffl queri natur number ffl corollari instanc set integr constraint ffl queri tupl ffl ffl tw sound show relationship consist answer queri instanc answer queri tw show tw return consist answer theorem ic set integr constraint queri definit ffl tw domain consist answer definit condit theorem exclud domain depend queri ic transform standard format rule instanc violat ic pose queri item class directli obtain pose queri tw obtain elimin consist answer standard ic form rule gener inconsist instanc pose queri student number obtain pose queri tw obtain answer consist answer case tw oper establish student number obtain list regist pose queri grade student obtain tw conjunct origin obtain empti set tupl answer intuit number student consequ find regist set answer obtain tw oper coincid set consist answer empti complet binari ic definit binari integr constraint sentenc form formula predic exampl bic function symmetri set depend form oe definit set sentenc languag schema sentenc denot ffl db fact instanc ffl ffl theorem set ic binari integr liter ic oper tw ground liter ffl ffl tw theorem consist answer queri form captur tw oper proposit appendix complet theorem easili extend case queri conjunct liter notic finit tw part hypothesi theorem hypothesi theorem requir ic answer liter queri definit knowledg liter bic queri conjunct liter oper tw gave consist impli theorem corollari ic set function depend ic oper tw complet consist answer queri conjunct liter fd bic oper tw found consist queri conjunct show condit show gener complet obtain queri conjunct liter oe inconsist instanc queri true repair easi tw logic tw consist answer true captur oper tw constraint theorem appli arbitrari ic gener theorem theorem ic set integr form mg tupl ic db sg impli mg ffl impli ffl tw theorem extend conjunct liter notic theorem requir condit applic simplifi iter termin issu analyz section termin termin mean oper tw return finit set formula import set consist answer comput evalu finit queri distinguish notion termin definit set ic queri tw syntact finit syntact semant finit tm valid semant finit instanc tm number case call point finit clear impli impli full version show implic proper evalu tw result evalu instanc case tw semant sound set consist answer defin syntact finit notion syntact finit import tm tw finit set formula point finit detect syntact compar consecut step iter simplif rule iter procedur fulli determinist introduc suffici condit syntact finit definit set integr constraint ic acycl exist function predic negat predic natur fp integr constraint ic liter complementari set ic ic function defin satisfi condit definit set ic ic function attempt satisfi condit definit integr constraint obtain obtain contradict theorem set integr constraint ic acycl iff liter tw syntact finit theorem extend class queri satisfi definit set integr constraint acycl case tw infinit ic acycl tw tw tw tw ft tw tw tw tw corollari function depend queri tw syntact finit semant finit definit constraint clausal form uniform liter set variabl set variabl set constraint uniform constraint uniform exampl uniform constraint includ set depend form oe theorem set integr constraint ic liter tw semant finit point finit bound function number variabl number predic queri ic theorem liter oe tm valid theorem detect point finit compar consecut step wrt logic implic undecid appli autom theorem prove successfulli made case involv set constraint acycl uniform exampl includ multivalu function depend set depend multivalu theorem theorem complet tw neg liter criterion theorem applic uniform constraint provid potenti faster termin detect proof theorem instanc base semant finit theorem domain independ instanc notic theorem includ case neg case theorem relat work bry author notion consist queri answer inconsist defin consist queri answer base provabl minim proof procedur comput mechan obtain answer didnt address issu sound complet wide recogn integr integr data inconsist integr constraint typic solut augment data model repres disjunct inform explain solut kind function depend oe integr function depend violat satisfi depend fact replac disjunct integr function depend longer violat solv kind problem introduc notion flexibl relat tupl set valu set stand approach limit primari kei function depend subsequ gener kei function depend disjunct datalog tabl introduc flexibl relat algebra queri flexibl flexibl relat calculu subset translat flexibl relat remain paper discuss queri languag reli exist approach queri disjunct datalog tabl import differ approach reli construct singl instanc delet conflict tupl underli incorpor integr introduc disjunct inform interest compar scope comput requir approach note approach underli requir recomput entir instanc approach context tupl insert repair integr violat case consist queri answer queri answer obtain singl instanc integr constraint oe fact instanc consist satisfi integr constraint common solut remov violat delet approach insert repair consequ infer approach return true repair approach return true undefin work connect research belief implicit notion determin set repair correspond suitabl categor theori describ set integr constraint queri inconsist expect correct answer correspond queri theori restrict easi notion repair relat case local semant introduc restrict perform start singl model obtain oper satisfi postul relat introduc definit partial order model determin concentr comput model repair comput queri pose modifi queri view methodolog repres queri simultan repair mean queri motiv start point belief attempt direct advantag semant inform integr constraint order answer mean repair inconsist interest inform relat queri queri refer consist portion answer repair reason presenc inconsist import research problem area knowledg goal design logic formal limit infer inconsist set formula infer formula requir classic prefer infer formula negat formal satisfi proposit distinguish integr constraint fact data violat integr constraint longer infer accept assum integr constraint fact approach infer chang captur longer infer involv method directli applic problem comput consist queri answer deontic logic modal logic oper captur permiss specif integr constraint oblig oper distinguish integr constraint hold fact happen hold deontic oper describ polici violat caught handl issu repair constraint minim consist queri answer address techniqu algorithm comput repair constraint violat issu queri answer presenc inconsist address work work paper repres step develop research area deal theori applic consist queri answer consist theoret result present preliminari prove gener sound result result complet termin partial pure constraint includ gener depend forthcom paper describ methodolog autom theorem prove termin order obtain complet disjunct existenti quantifi queri move tw oper queri upper bound size tw lower bound complex comput consist answer class queri constraint studi shown proposit sat reduc polynomi time problem decid arbitrari formula evalu proposit give true correct repair problem interest connect modal logic definit write mean true repair instanc evid shown logic modal logic acknowledg research partial support grant nsf grant part research author sabbat technic berlin support refer flexibl approach integr data possibl inconsist ieee intern confer data kifer queri inconsist prepar subrahmanian combin knowledg base consist firstord theori comput bry queri answer inform system integr constraint ifip wg work confer integr control inform system chapman minker approach semant queri optim acm transact chaudhuri dayal overview data wareh olap technolog sigmod march chomicki editor logic inform system kluwer academ chou winslett belief system autom phan dung integr data possibl inconsist intern confer cooper inform belief handbook logic artifici intellig logic volum page oxford diagnosi repair constraint violat system phd universitat minker integr semant applic chomicki saak chapter mendelzon proposit knowledg base minim chang artifici kl deontic approach integr annal mathemat artifici lin semant reason consist presenc inconsist artifici lin mendelzon merg constraint intern journal cooper inform ww refer manual guid argonn nation technic report dignum role deontic logic specif inform system chomicki saak chapter nicola logic improv integr check relat data base acta ullman principl vol comput scienc proof result technic lemma state proof full proof found file lemma ffl tw ground repair hold ffl lemma ffl tw ground repair hold ffl lemma ffl tw conjunct repair ffl lemma queri ffl tw ground tupl repair ffl lemma domain independ queri ffl tw ground tupl repair ffl proof theorem lemma proposit set ic integr ground ic repair ffl ffl proof proposit assum ffl hypothesi ic exist instanc ffl ic set instanc fr jr ffl ic exist minim repair fact conclud ffl ffl assum ffl ffl contradict proof theorem theorem proof corollari case tupl ic empti instanc empti base satisfi tupl ic instanc relat tupl relat satisfi proof theorem ffl repair ffl proposit ffl ffl prove sequenc ground tupl ffl prove sequenc ground tupl ffl immedi obtain ffl assum ffl mention repair ffl conclud repair ffl proposit conclud ffl condit hypothesi theorem conclud ffl proof theorem ic exist definit prove induct liter liter integr constraint form mention builtin predic liter integr properti true sequenc quantifi variabl definit liter previou induct hypothesi liter tw finit liter exist natur number defin function liter natur show defin function behav definit form sequenc quantifi variabl form definit form conclud definit proof corollari stratif function liter relat proof theorem uniform constraint residu quantifi variabl occur finit formula tw finit lemma lemma ground tupl ffl ffl proof theorem natur number oe valid sentenc prove oe valid induct hypothesi oe valid sentenc ground tupl tm ffl lemma mention predic ffl lemma conclud oe valid sentenc proof theorem domain independ queri instanc defin ffl fa wg famili subset finit domain independ queri exist minim element hold
Agents/1539 1 control state motiv agenc steve allen deduct multiag system group german research centr artifici intellig germani abstract challeng face research behaviour model charact develop systemat framework question type intern state charact state interact solut base cognit inspir agent architectur delib research methodolog design gradual explanatori power account phenomena interest describ varieti complet agent show design mental state aim provid rich deep explanatori framework explor motiv autonom agenc earli experi concentr requir emerg perturb relationship person introduct conjectur human mental concept ground implicit assumpt underli inform process architectur aim paper provid framework explor make underli architectur assumpt explicit breakdown inabl concentr due recurr thought lost love place requir architectur place requir architectur reactiv mechan respond quickli potenti unexpect event research part cognit affect project birmingham uk intend interest build autonom agent order elucid mental restrict intent model reli knowledg level descript approach ration agent knowledg action lead select action page mental state interest includ emerg automat ration process descript cognit inspir agent framework partit architectur made function regard emerg properti architectur except al architectur partit investig learn emerg properti captur motiv charact person understand emerg systemat studi attribut emerg state relat layer architectur build complet agent meet requir abil rapid consid incomplet inconsist multipl compet dynam possibl hostil environ structur paper paper section role plai motiv control state agent ty answer basic question control section introduc motiv agent describ research methodolog cognit inspir section discuss rang motiv control state term section discuss theoret aspect motiv control state concret societi mind final section present summari approach control state complex system collect control function question type control state complex system control state interact thermostat repres control thermostat hold belief room desir temperatur intent radiat control state restrict classic bdi formal control state oper multipl level architectur control complex control system mind human capabl support type control state belief desir simpl thermostat peopl regularli base predict observ bad refer desir belief observ agent fact predictor behaviour good indic control state scientif form qualif call control state inform process control system defin type attribut control state section attribut refer quantit attribut structur attribut describ control state structur attribut link agent plan attribut statu partial structur attribut valid proposit import subset structur attribut reflect mechan modifi mechan transform belief standard modifi exit belief basi goal valu attribut express term structur attribut durat emot express term emerg perturb state motiv repeatedli grab hold attent flexibl classif scheme explor requir control state commit rigid form figur show variat scope durat cope common control state humanlik motiv agenc long term hard slow effect indirect short term specif semant content skill standard emot plan figur scope durat control state control state view odd standard notion control system physicist control engin convent control system fix behaviour complet system partial differenti equat intellig control system describ fix capabl evolv lifetim agent intellig control state exhibit chang structur chang valu numer variabl belief rigid learnt behaviour home skill control state oper agent architectur control state impli exist mechan belief evalu execut case mechan differenti metal strip belief curvatur strip belief make break electr contact belief evalu execut control state requir specif support mechan architectur control state emerg interact lower level share common differ interact control state motiv hard fast rule determin number natur control state motiv agenc success agent built classic bdi principl agent reduc pure reactiv architectur definit benefit gain work level distinguish reflex skill behaviour architectur figur feel typic rang control state investig context charact plan reflex goal motiv skill belief standard attitud concern imag behaviour figur control state motiv agent motiv agent framework initi descript motiv control state inevit vagu unsatisfactori build agent give deeper understand function emerg properti agent defin common base requir analysi control system attempt support multipl motiv rapidli chang hostil environ research methodolog produc understand complex system requir design process understand problem solut systemat improv involv parallel thread mixtur analysi design thread repres common engin thread add scientif requir analysi system includ main hard soft constraint design specif work describ major compon function relationship design compon replic thread success work scope amount detail typic project develop theoret mathemat techniqu empir analysi design meet articul requir identifi suggest improv requir design futur iter analysi similar design altern obtain deeper understand involv motiv agent architectur term refer motiv control state move agent desir physic mental state light agent belief concern motiv subclass inform structur disposit power determin action intern subsum intent motiv agent architectur base basic mechan motiv agent possess logan mechan shown pictori figur alarm reactiv process motiv activ work longterm memori action percept process delib process environ variabl threshold attent filter process activ figur motiv agent architectur manag process dedic circuit respond automat trigger condit environ consid construct plan explicit evalu altern option behaviour concept form modif associ strength rel weight autom process reinforc learn reactiv process form hierarch control perceptu action low level reactiv circuit continu analogu natur simpl feedback connect achiev high level inform process move circuit digit natur form discret behaviour abstract concept genet determin circuit act alarm trigger emerg pattern behaviour conflict share resourc handl simpl mechan spread vector addit network agent surviv genet determin provid environ present problem gener determin solut fail attent manag process gener resourc focu address current primari concern agent reusabl mechan space dynam process inher serial resourc limit access concurr memori inher serial due problem attent process world model construct evalu plan goal action select requir work memori facilit comparison memori store individu step construct plan percept requir resolv ambigu constrain search path candid concept action requir carri complex task behaviour establish attent delib process thought thread run reactiv substrat attent filter mechan protect resourc limit attent process excess interrupt reactiv motiv filter threshold set reflect perceiv current attent task motiv motiv insist level higher threshold pass filter grab attent insist assign penetr base heurist measur motiv import urgenc process agent adapt monitor control reactiv attent manag mechan approach work agent earli develop agent environ intern chang process enhanc agent adapt robust continu evalu agent current perform longterm gener object object includ thing fail achiev goal wast lot time problem turn achiev process percept action act attent state agent motiv control state vagu terminolog describ attribut control state discuss attempt situat attribut motiv agent framework section build gener definit motiv mechan tend select action light concern belief concern disposit desir occurr kind situat page goal state affair agent direct standard belief case simpli case attitud thing dislik refer standard goal clore collin attitud chang tend chang slowli motiv move agent desir motiv perform function direct function steer behaviour allevi activ function anim agent function combin individu behaviour direct function motiv match event agent motiv direct behaviour allevi concern figur norman concern serv standard situat test complianc desir activ function motiv motiv agent motiv activ effect attent delib manag level motiv gener delib reason part reactiv motiv initi automat behaviour reflex epistem prepar agent action action readi chang relat affect state section gener manag goal interrupt attent manag process agent surviv reactiv make implicit assumpt concern encod reactiv layer mean concern high surviv perform achiev reactiv motiv interrupt ongo manag process event match agent concern motiv gener reactiv process larg ignor current state manag manag attent protect excess irrelev attent filter control reactiv gener motiv assign insist level evalu pass proport perceiv motiv motiv insist level greater current filter penetr captur manag resourc activ function depict graphic figur motiv motiv attent motiv manag motiv gener control monitor attent filter belief concern belief concern belief concern figur role attent filter abil reactiv motiv interrupt attent process depend interact separ reactiv insist assign repres urgenc import reactiv filter threshold assign adopt motiv process lower filter threshold manag process factor affect filter threshold number motiv manag assess current manag abil manag process cope current situat function motiv motiv behaviour adopt manag process motiv insist level higher filter threshold pass simpli pass filter motiv adopt manag process figur motiv surfac filter decid motiv remain manag resourc continu devot adopt delib motiv temporarili distract attent chang ongo plan action epistem event reflex action readi gener action gener physiolog chang gener motiv gener filter adopt motiv ignor motiv reactiv process attent manag process attent filter decid motiv figur motiv adopt emot emot form class motiv control state make resolv situat gener observ theorist stress emot base system primarili studi effect reactiv stress emot disappoint relat phase execut studi effect stress emot involv loss control thought process studi process involv layer identifi main class emot primari emot sexual typic trigger pattern earli sensori input detect global alarm system emot state call prime primari emot damasio picard secondari emot depend exist delib layer plan futur creat execut relev risk progress success alarm system capabl detect featur cognit gener pattern produc global reaction event thought process concern agent damasio term cognit gener emot state secondari emot tertiari emot feel difficulti focu attent urgent import task emot occur layer concept relev sort evalu control thought loss lose dont tertiari emot correspond secondari emot reduc emot classif scheme form map common usag emot label fear gener innat situat event primari cognit identifi threat secondari extrem involv loss control mechan tertiari emot scheme map nice research field psycholog neurolog ledoux person webster dictionari defin person complex characterist distinguish individu nation total individu behaviour emot phrase acknowledg person refer behaviour emot characterist individu emot person cluster concept psycholog model compet psycholog model attempt identifi fundament dimens person pattern covari trait specif attribut individu john model factor model dimens open real consensu gener variat dimens factor model blend agreeabl adequ descript individu differ classifi person type offer hope specif direct charact develop intent model person complement occ collin model emot feel import identifi inform process structur depend lie beneath perspect understand interact control state order build consist model agent start process compon centric model develop cognit comput scienc offer process centric model process centric model person basi person trait theori mention attempt marriag trait inform process process agent architectur good reason marriag simpli person trait theori base analysi relationship commonli person term map natur human inform process process inclin focu process level aspect perceiv low high alert expect realiti imagin realist reason low high ration undesir effect fact desir effect pessimist object optimist learn low high curiou learn learn select decid low high insecur reaction good thought act low intermedi high passiv activ task task result task interact low high threat exchang inform hostil neutral friendli reveal low high secret open lie truth honest feel emot low high sensit selfish figur dimens person rousseau dimens person figur bear strong famili resembl factor model slightli dimens view distinct architectur constraint confer depend perceiv reason compet delib reveal interact cope strategi process centric model provid intermedi step person trait psycholog theori architectur requir agent architectur compon centric model elliott page identifi compon interpret person rudimentari agent individu respect interpret situat uniqu individu manifest person rudimentari agent individu respect express manifest emot tabl list typic determin agent person determin agent type agent concern standard interpret motiv profil agent interpret sensit emot state interpret balanc spontan plan affect event manifest persist attain goal mood manifest choic word style script manifest tabl agent person agent emot behaviour characterist individu essenti determin individu concern sourc concern explicitli encod activ plan lie standard encod autonom reflex skill motiv rel weight class motiv give broad motiv profil agent base motiv profil work tabl creat profil ach learn imagin agent held user desir achiev goal learn user requir motiv human agent interpret agent motiv profil physiolog energi safeti feel threaten safe affili affect state user achiev achiev goal learn user requir learn tabl motiv profil similar rizzo al offer model person base rel relev event concern ford resourc give valid avoid selfish behaviour materi amount monei tangibl good avoid loss monei materi possess social interperson meet social role conform social moral rule avoid social illeg conduct build maintain commun avoid feel social isol separ receiv posit evalu realm compet evalu moral sphere evalu avoid social experienc excit avoid stress inact classif person type spite map high level altruist norm selfish spite resourc combin motiv class lead person trait sensit emot state differenti concern lead emerg emot state support dimens person emot motiv definit emot state subject highli depend underli inform process architectur agent motiv agent emerg perturb state natur outcom interact heurist reactiv insist assign subsequ delib manag process reactiv delib balanc reactiv plan term thought agent attent filter threshold creat thought agent attent classic assign high insist level reactiv level creat agent tendenc event final demon layer determin quickli agent abandon goal frustrat current progress persist attain goal process determin agent assign activ motiv choic express express behaviour includ choic facial vocal inton motiv control state agent express behaviour believ manner societi mind agent architectur start point investig concern mediat adopt motiv societi mind architectur minski abbott architectur captur number concern process unifi framework twin approach affect amplifi modifi abbott architectur figur implement toolkit poli explor interrelationship agent emot person alarm sensor agent bodi state tactil sensor agent direct agent map agent extern stimuli percept extern stimuli ey sensor agent attent extern stimuli agent control signal physiolog variabl action propriocept feedback primari emot agent alarm secondari emot agent motiv manag agent stimuli drive attent manag motiv agent manag effector agent action behaviour agent manag agent motiv activ extern stimuli attent filter agent emot select agent bright sensor agent bodi agent meta manag motiv control signal figur modifi abbott architectur biolog model adopt etholog inspir model review simplifi task differenti emot retain flavour architectur angl easili relat work research psycholog neurosci explicit drive mechan make implement reactiv motiv gener cleaner main modif origin architectur centr clarifi role emot agent chemic control signal separ drive mechan affect amplif mechan investig ad affect base alarm manag mechan function system emot agent partit lend primari secondari emot state respond cognit gener event emot select attent filter agent architectur support complet action select algorithm societi mind framework link behaviour result execut behaviour made disposit behaviour agent longer directli alter physiolog variabl effector bodi select basi expect effect expect volum instruct mouth agent token expect level anger agent person abbott main motiv path consist percept direct reactiv motiv gener activ abbott equip action tendenc maintain bodi state action tendenc repres architectur motiv agent monitor statu singl control variabl control variabl maintain desir rang time order blood sugar abbott walk find energi motiv select attent filter activ motiv manag motiv manag agent select behaviour satisfi current activ main motiv path modifi path emot path gener motiv extern event convert discret event continu modifi percept prepar action reduc sensit pain make type action perform simpl motiv manag switch task current action modifi compon abbott rudimentari person agent attent filter make abbott modifi rel motiv agent chang abbott motiv profil ongo futur research build success complet agent architectur integr control state motiv agent framework research goal implement refin attent layer start captur requir true delib layer multipl sourc motiv consid attent level integr emot base learn architectur order investig motiv control state build artifici autonom agent lifelik find refer agent underli architectur familiar mentalist term appli mentalist term implicitli assum type inform process architectur architectur specif mechan concept concept refer emerg mechan emploi satisfi similar requir mentalist concept mislead logan mentalist concept place requir architectur support motiv attitud goal achiev argu approach studi motiv autonom agent adopt inform level feel offer rich explanatori framework explor mental state term inform process control function agent architectur acknowledg author aaron sloman member cognit affect project birmingham motiv member multiag system intellig user interfac group german research centr artifici intellig ongo support live discuss refer goal process autonom agent phd school comput birmingham prime integr view motiv emot psycholog vol page model motiv behaviour intellig agent virtual world confer virtual world simul model motiv emot basi intellig behavior intern symposium autonom marina del februari acm press descart error publish intent stanc mit press affect process model emot system phd northwestern institut learn scienc tech report dimens criteria taxonom paradigm person individu vol page motiv human person agenc belief sage emot cambridg press behavior base cognit emerg behavior autonom agent technic report buffalo april societi mind william motiv harper person paramet program petta creat person synthet autonom person agent page agent knowledg system laboratori report decemb motiv agent knowledg system laboratori report juli cognit structur emot cambridg press knowledg level artifici vol page direct plan attent agent phd thesi dai depart electron queen mari westfield colleg affect comput mit press social behavior believ agent aaai fall symposium intellig aaai press technic report pp believ social emot agent phd thesi technic report school comput carnegi mellon pa person comput charact work note workshop aaai menlo emot mysteri underpin emot life simon schuster introduct model applic special issu applic journal person mind control system peterson royal institut philosophi confer philosophi cognit scienc cambridg page architectur requir agent natur artifici sort machin dautenhahn human cognit social agent john benjamin publish architectur tool ritter young european confer cognit model nottingham page toolkit explor agent design ijcai workshop agent theori architectur languag lectur note comput comput mechan action select phd edinburgh emot agent phd school comput birmingham
Agents/1540 1 approach integr mobil agent exist web infrastructur paulo paulo silva portug abstract mobil agent provid abstract deploi function exist internet infrastructur work project overcom limit found term programm usabl mobil agent paradigm real applic framework agent platform applic simpl javabean compon paper present architectur web server capabl send receiv agent easi exist web infrastructur gain potenti make agent technolog approach involv wrap compon insid java servlet includ web server support servlet specif servlet enabl server receiv send agent queri local enabl agent behav servlet framework exist commerci web secur mechan framework correctli run integr secur architectur server mobil web compon introduct mobil agent small thread execut migrat machin perform oper local interest applic area mobil agent internet comput mobil agent provid attract paradigm area agent launch navig collect inform perform final return home good result scenario attract wireless mobil devic place user launch agent shutdown devic reconnect hour collect agent result kei applic agent internet comput inform gather collect inform web site distribut final present owner shop deal perform commerci present result owner make manag carri inform select web site make distribut monitor migrat select web site monitor inform stock warn owner event happen perform action event mobil agent provid attract conceptu framework comput small thread migrat server perform difficulti address difficulti prevent widespread adopt technolog kei problem user provid psycholog infrastructur reliabl kei problem secur deploi mobil agent secur critic issu carefulli consid point examin mobil agent secur agent arriv host mechan prevent agent damag host access inform permiss agent execut open machin extrem vulner attack host steal inform make perform action voluntarili give inform entiti agent protect attack agent run host mechan protect host agent agent attack agent mechan base proper authent author todai major technic problem protect host mobil agent mobil agent system todai implement java due fact java dynam code load object easi effici implement paradigm java platform secur feasibl resourc control make agent perform attack alloc huge amount network bandwidth burn cpu cycl protect agent host technic difficult agent execut host access state code agent approach solv comput encrypt function code obfusc problem solv psycholog resist term mobil term mobil code strong neg connot user afraid instal agent platform receiv execut code permiss thing user associ mobil agent comput mobil code present technolog rmi jini main differ technolog user shield exist mobil mobil code agent wide visibl user prevent adopt bring ad interest subject extens discuss user resist instal agent platform machin web host administr convinc peopl send agent machin potenti danger peopl run agent spend resourc open system econom side question user interest agent roam host host host provid shop desir problem static search constantli block infrastructur integr relev issu web site integr mobil agent platform infrastructur system follow basic approach involv instal agent platform complet unawar web server agent migrat agent platform interact web server normal differ local approach oper queri inform monitor limit function implement agent hard agent publish inform extend function server migrat agent agent repres web page server user remot interact approach consist develop web server host agent problem typic web site replac exist infrastructur typic web server robust scalabl site difficult web site accept replac web infrastructur technolog approach problem prevent adopt technolog implement mobil agent platform receiv agent standard masif fipa cover interfac agent system migrat agent system web host support agent support lock number potenti client servic support mean addit problem vulner approach abstract common function exist agent platform middlewar agent system migrat common problem approach agent advantag advanc featur platform reliabl import question reliabl user send agent thing wrong make agent lost simpl server crash kill agent run routin oper server shutdown lead loss agent run server mechan appli ensur agent persist storag techniqu import carefulli reliabl requir deploi agent infrastructur web outlook mobil agent paradigm good conceptu model develop distribut internet applic import problem address point view solvabl depend adopt basic resourc control method java platform protect agent complic problem gener approach web agent approach give secur agent run carefulli requir agent internet domain resist user mobil provid stronger focu applic agent user awar agent agent platform interact applic convinc web host introduc technolog site basic question matur agent technolog technolog point provid assur danger deploi framework give function user differenti provid servic custom infrastructur reliabl technic problem address part matur process technolog paper address infrastructur integr problem work work project overcom limit found term programm usabl mobil agent paradigm framework agent platform applic simpl javabean compon applic develop current objectori approach send receiv agent binari softwar compon approach agent arriv departur directli interact insid paper discuss experi integr framework compon web enabl receiv send agent approach involv wrap compon insid java servlet includ web server support servlet specif servlet enabl server receiv send agent queri local enabl agent behav servlet experi framework web secur mechan framework correctli run integr secur architectur server paper basic address infrastructur integr problem approach involv deploi agent server integr web requir special web server provid framework exist web give capabl agent oper framework strong secur authent author mechan control incom cryptograph primit protect integr confidenti agent essenti infrastructur deploi open environ framework user distrust mobil agent address framework user awar mobil agent technolog awar posit result technolog import point made specif complet stori research conduct problem limit lesson learn inform simpli give final architectur discuss problem found make system work rest paper organ section overview framework section explor approach section discuss final architectur section present perform result section relat work section conclud paper overview distinct characterist approach agent platform agent arriv leav applic part agent platform applic incorpor binari softwar compon code compon give applic capabl receiv interact mobil agent applic develop current industri softwar method integr mobil compon call approach applic centric mobil agent system applic central mobil agent part system plai specif role consequ design applic agent agent back pair distribut program technolog secur integr applic secur complet gener agent interact directli applic insid elimin setup interfac agent secur polici agent platform instal maintain distribut applic instal simpler manag separ infrastructur share larg number distribut applic polici requir agent accept applic mobil agent end user ad agent simpl program programm visual compon compon palett configur properti interconnect framework implement javabean compon framework center mobil compon compon basic support agent migrat extens mechan compon connect compon implement function commun persist import aspect extens mechan base event model servic compon regist mobil notifi state transit occur agent agent listen examin interact event secur compon notifi agent verifi credenti examin state find agent prohibit agent arriv complet discuss project framework scope paper interest reader refer addit detail integr web server approach motiv interest build support mobil agent web server necess valid easi exist applic framework web creation interest applic field paradigm fit web experi made jigsaw web server interest jigsaw extens architectur servic easili introduc implement simpl adapt case perfect adapt mobil compon agent behav web resourc publish user web browser access interact dynam gener web page agent queri local inform present web server agent perform manag oper server requir base interest stud mobil agent distribut network applic manag architectur meet requir architectur depict figur jigsaw class overridden class call make object configur jigsaw resourc class overrid mobil compon wrapper listen time state agent publish inform uri mean user access web site agent present run server inform publish agent accompani includ ident agent user click agent ident pass request recogn request handl forward run agent ident match paramet wrapper agent receiv event save refer agent migrat wrapper receiv event refer bottom line user interact agent run web server simpli access start page interest point approach framework agent arriv interact applic agent access intern object applic mean agent access manag inform present insid jigsaw enabl agent perform mainten task insid featur import aim project studi applic framework develop distribut manag applic prototyp simpl manag applic mobil agent collect inform web perform simpl administr oper http request http mobil wrapper interfac jigsaw web server mobil compon jigsaw intern object figur jigsaw lesson learn main experi straightforward integr mobil agent import point agent interact applic access intern open possibl term distribut applic manag agent web shortcom approach address problem approach applic web server discuss content provid typic replac web infrastructur simpli ad featur believ gener integr mobil agent web server problem concern secur framework compon point make experi secur turn main reason jigsaw instanti care secur java secur manag run turn secur work compon framework thought open issu secur import point address realiz wrapper interact agent request directli forward method implement agent agent process request visibl web site point motiv develop approach web server time agent arriv departur directli benefit advantag agent regist interest process http examin characterist request mobil servlet kei idea build support mobil agent interfac provid provid servlet specif provid hook map uri object insid web server respond http request accomplish servlet servlet technolog simpl mechan extend function web uri object instanc instanc call process http request web server support servlet servlet engin connect web server provid servlet function migrat wrapper servlet run framework web server servlet engin support specif issu brought migrat concern heavi run framework servlet engin expect main small footprint run offer good scalabl point consid uniform manner agent access inform web server make agent behav data sourc uri servlet forward request agent problem agent access inform store local web server straightforward agent read inform ordinari http client small perform agent data sourc interfac larg bandwidth architectur implement servlet base guidelin mobil import web server decoupl servlet servlet function web server provid map uri forward request servlet request correspond interact forward mobil servlet pass agent secur compon framework instanti provid secur featur run host figur show approach note decoupl web server servlet engin web server support servlet specif instal configur web server figur mobil servlet biggest chang architectur visibl forward process place agent interact web resourc framework concept servic agent mean agent arriv host queri request object implement servic interfac idea implement agent arriv web queri local web servic instanc behav publish inform agent requir object publish object pass requir agent implement servlet interfac http request made agent full inform request includ ip accept session inform import agent distinguish act agent request servic requir deni list onlin figur agent behav servlet secur secur compon instanti protect servic agent host compon agent migrat host prevent tamper eavesdrop content agent implement author mechan agent correct permiss perform read directli connect host network compon implement cryptograph primit secur protocol inform gather mobil implement easi main problem solv secur resourc control java platform includ method complic issu investig possibl resourc control librari implic term runtim penalti ad servic interest aspect system servic instanti made agent runtim make framework flexibl implement featur web site programm implement marketplac agent negoti consult publish inform web site programm basic architectur configur mobil compon load compon implement commun mechan agent negoti execut web site current perspect experi framework web server servlet posit result test system jigsaw web server jw servlet engin test apach web server experi built prototyp applic interest applic electron commerc base agent user login number item bui autonom agent creat navig web collect inform item time user affect oper agent user log agent agent return item agent found make mode oper user initi give credit item user give credit offer agent found agent return user item agent make manual applic develop distribut system mobil user specifi site agent jump site perform index local build complet index site requir page site agent perform oper local term time bandwidth bring complet site local machin perform result applic discuss section experi framework nice approach integr mobil agent exist web infrastructur fascin characterist approach basic infrastructur deploi function easili introduc exist web infrastructur requir simpli code requir agent agent behav send migrat target web server main limit found framework resourc control framework usabl secur intranet extranet type network creat account author log mechan present hold user account futur resourc control mechan introduc java perform result examin perform result distribut crawler applic extens show perform gain expect mobil approach build distribut applic setup understand mobil agent approach work decid setup framework test approach approach index web site ident machin configur web client machin configur router special program bandwidth machin control index web index packag project index web site rang mbyte mbyte import understand size text present media type index chosen bandwidth test kbp kbp bandwidth repres valu peopl nowadai internet result figur summar result obtain test refer mobil agent xxx kbp xxx kbp line due space present result result show mobil agent perform perform rang kbp setup kbp time size figur mobil agent perform interest point speedup remain constant size result expect result index directli proport size speedup directli relat time bring web site remot locat local machin time bring result index import note speedup curv slightli declin size web site agent migrat web site index web server agent process machin workload remot machin speedup declin easier perceiv larger site agent size process creat lot temporari intens process speedup declin small kei point retain result mobil agent obtain larg perform compar tradit solut mobil agent scale constant speedup size work agent high load target speedup diminish machin approach point import situat larg number user migrat agent perform oper local exist import perform degrad mean deploi infrastructur care plan resourc server number agent concurr execut relat work kbp kbp kbp figur perform agent compar exist approach integr mobil agent reli build mobil agent platform support http build web server support mobil put standard mobil agent platform web limit integr discuss approach agent platform support autom internet platform receiv agent queri local web owner forward agent platform object simpli agent access local web inform agent capabl publish inform similar approach case domain expert implement mobil navig web inform system built top mole mobil agent roth describ agent platform mobil agent implement act web execut servlet case agent conceptu ident build web server top agent platform discuss implement web server integr agent platform receiv execut mobil agent agent queri publish inform web server futur work author intend extend approach web server statu work time implement web server featur support execut mobil object framework integr web server support servlet agent queri local publish inform site act ordinari servlet paper present experi framework develop web mobil agent compon framework ad exist applic provid support receiv send agent easi built architectur web server support servlet specif receiv agent main featur architectur web server support servlet specif receiv send agent execut agent restrict proper authent author long exist secur manag modifi compat java secur deleg mechan agent process http session act regular servlet dynam load ad featur run time make approach configur capabl address requir site small footprint lightweight execut environ perform measur show mobil agent approach obtain larg perform save bandwidth solut constitut good approach exist infrastructur long order address problem discuss present solut present intranet user held account acknowledg investig partial support project refer unit refer mobil gener magic softwar agent ieee commun vol pp mobil issu proc nation inform system secur mobil agent ieee vol pp agent sun microsystem java model attack malici host mobil present workshop mobil object secur internet mobil sander mobil proc ieee symposium secur code phd pari institut approach solv problem malici present ecoop workshop secur internet mobil juli applic mobil agent proc ieee intern confer open architectur network program april omg mobil agent system proc intern workshop mobil agent foundat physic agent specif object orient mobil agent present ecoop workshop mobil object oper system secur program sophia june reliabl proc annual hawai intern confer system januari comput result proc intern workshop mobil agent mechan mobil agent electron proc ieee symposium reliabl distribut octob sun microsystem servlet specif sun microsystem specif question platform extens mobil agent proc intern icsc symposium mobil agent virtual organ decemb mobil agent develop mobil agent proc intern confer softwar engin applic la novemb jigsaw web apach apach web apach sun microsystem java web agent autom proc acm expert inform retriev world wide proc int workshop cooper inform agent concept mobil agent world wide web vol applic mobil agent person assist electron proc confer practic applic intellig agent agent april integr mobil agent web proc ieee workshop collabor agent distribut web boston june design architectur infrastructur web world wide web vol
HCI/1541 4 septemb influenc design techniqu user experi air traffic control christoph chatti avenu franc abstract graphic user interfac limit term inform bandwidth provid user system redesign system base physic inform appropri share cognit user reduc parallel research user interact systemat visual design techniqu reliev limit articl explor techniqu design experi user interfac prototyp develop research program air traffic control make touch screen serv basi research graphic design techniqu user interfac paper describ lesson learnt experi argu techniqu font care graphic design techniqu augment possibl user interfac design improv usabl system final enhanc brought commun system user user interact graphic gestur mutual air traffic control introduct air traffic oper set evolut air traffic control current tool fulli environ goal ten year ago inevit technic process slow difficulti manag transit term tool work method true current paper strip board control build strategi hard match system assum transit suitabl goal topic kind difficulti appar design set rue franc rue de franc tool control detect monitor conflict aircraft mere transposit strip board fail support effici work method constrain interact style comput forc research imagin tool support major achiev approach difficulti reproduc flow inform support current system inform flow user manipul tool note inform flow system notif code aircraft inform code gener introduc data event inform flow distribut cognit control plai import role work current system support subtl wai design user interfac support flow challeng input bandwidth graphic user interfac physic restrain devic instanc interfac restrain output bandwidth provid comput turn restrain limit graphic capabl comput attempt improv bandwidth gener specif field air traffic research input techniqu visual techniqu anim alarm relat seri design experi aim explor bandwidth limit push achiev experi set design guidelin build interfac describ context demonstr develop mention relat work relat present technolog elicit guidelin visual touch gestur recognit categor gain kind user user system final present implic design air traffic control workstat project control workstat test user interfac architectur current architectur chose closer earlier workstat design recent wimp vertic larg screen situat horizont area dedic work aid impli touch screen horizont part work aim find screen leav question kind inform manipul organ horizont question remain address kind visual interact style order support commun user recent prototyp explor issu altern menu note enter data system revisit problem electron strip relat work literatur design good descript differ touch screen wimp interfac describ issu close relat touch screen explor pen comput touch screen gestur recognit air traffic control gener field graphic interfac approach problem interact effici fundament approach perform model predict model steer law provid solid foundat understand mechan hint design practic approach ergonom guidelin rule deriv experi complex bodi knowledg present inform visual design techniqu user interfac design design disciplin evid design techniqu appli excel except rest report lesson septemb learnt design guidelin deriv start visual design graphic design anim font good graphic design dedic carefulli design font graphic displai inform make legibl find displai print inform french paper strip strip screen figur current select instruct displai textur color code interfac line text textur color reason limit number color outperform home comput state color reduc abil build traffic strong statement fact influenc larg satur red conflict code claim number color assign mean limit statement interpret limit total number color screen color wai select current instruct color requir train cognit effort rememb textur code zone user handl strip move left figur subtl code remind user limit grip zone figur strip hand written font font convei system design reluct font code inform bad idea code state flight font slant bold attribut type code difficult memor recogn distinguish data user input data font legibl code easi rememb figur easi detect glanc flight clearanc mention transfer flight level distinguish standard control modifi negoti sector code font good choic level code font convei number subtl perceiv nuanc aircraft paramet distinguish radar data radar displai font anim graphic design displai anim interfac explicit state explicit result action macintosh desktop user send document reveal event arriv email mailbox complet action give indic job advanc anim alarm discuss anim anim give anim exampl anim facilit user push shift flight strip strip move move altogeth displai result anim user perceiv result action read compar call sign electron anim septemb figur anim insert strip anim user quickli detect wrong case minor interact error observ perform evalu demonstr similar anim manag messag flight list anim improv menu open report user miss feedback end input menu user felt flight radar displai menu appli short simpl anim menu open close anim feedback flight input open begin menu grow menu open unnot involuntari touch user chanc menu shrink strip input appli feedback user perceiv mistakenli input data wrong menu color select move modifi field confirm user input user cancel input touch screen menu state input made avoid ambigu mistak figur menu open close anim enhanc scroll wimp menu enter data clear flight level open current flight level control scroll input displai scroll instantan anim similar case horizont bar menu left arrow user scroll valu move show set valu user interrupt scroll anim desir move bounc anim notifi user scroll bar reach end anim notifi paper control notic slight printer wimp messag element flight list bare notifi user anim strip arriv move left bottom touch screen user notic seamless figur arriv strip septemb anim make explicit effect anim show happen user strip strip close slight rectangl show strip trash anim system reaction time complex tool interfac give feedback success failur request team charg develop interfac tool ad anim approxim system answer request user interfac chanc notic anim result vision anim enhanc mutual control work student control work instanc import abil support collabor work underestim anim make explicit control claim properti paper strip mutual anim make differ design design touch screen design wimp interfac touch screen aspect size finger limit singl button balanc gain abil gestur avoid small graphic costli good guidelin design touch screen mind object point hand applic stand give advantag rule usabl design touch screen base interfac touch screen touch screen favor touch screen direct interact devic point directli graphic indirect trackbal mean user interact visual attent mode screen target point finger target tremend visual attent imposs touch screen favor mutual colleagu hand touch screen clue activ control point screen show colleg dedic implement wimp interfac touch screen share work colleagu front notic difficult share touch screen current technolog simultan interact touch share interact altern design touch screen interfac design touch graphic button behav differ ui toolkit potter touch strategi call click strategi user drag finger screen button select finger lift touch screen ui toolkit button select touch finger move button strategi select bar menu simpl gestur past studi pen comput gestur recognit appli design stroke easi draw easi rememb easi recogn difficult imposs current technolog implement simpl effici stroke recogn stroke simpl dramat improv touch screen base interfac gestur open data input obtain combin simpl gestur recognit markup open menu open clear flight level vertic gestur drawn flight level strip gestur easi select lower level valu straight higher level valu straight input horizont stroke stroke open menu stroke open dialog quick easi rememb touch screen permit touch screen technolog stylu passiv activ depend easi implement free write recognit septemb control write special inform associ support benefit send system sector demonstr function top figur combin graphic anim touch anim graphic design import touch screen base interfac inform user express strong feel touch concret convinc merg techniqu dramat enhanc prove experi perform evalu compar perform user execut manipul scenario rai touch screen perform manipul error typolog analysi detail experi show perform differ touch screen perform quicker subject drag object touch screen significantli quicker touch screen compar time includ manipul error correct error slightli numer touch screen touch screen quicker mean train touch screen user perform touch screen manipul error easili parallax error manipul flat screen enhanc commun gain expect graphic touch screen gestur recognit gain relat commun bandwidth tabl summar advantag provid term commun column input output commun system user column inform flow multipl user system directli user anim control perceiv understand seamless colleagu anim control perceiv system notif primarili send colleagu system input system output output user user graphic design anim touch screen gestur implic workstat posit feedback obtain air traffic control qualit trigger enthusiasm french commun long histori research prototyp user evalu turn good brought real world due rel simplic evalu carri compar level system good group work task scalabl degrad care analyz consequ research design lesson learnt design method techniqu experi confirm care graphic design posit influenc usabl accept system inform evalu confirm effici anim improv usabl interfac safeti system find hard prove current evid suffici gener techniqu workstat interact techniqu posit feedback hint architectur chose interact techniqu air traffic control worth studi confid high potenti touch screen ad futur work aid workstat consciou preliminari evalu result recommend implement applic chosen design prove inadequ ad function miss prototyp strip paper work method control remain ideal replac paper strip prototyp user interfac air traffic septemb control descript support argument import visual design user interfac possibl base interact set guidelin design interfac discuss impact techniqu commun potenti consequ research plan work formal evalu techniqu explor question design altern workstat air traffic control acknowledg daniel etienn develop bright idea visual design recod enhanc peopl gave time idea inspir bibliographi zhai perform evalu input devic applic steer law addison human factor alarm notif evalu confer design interact devic academ guidelin color displai june nation technic inform virginia usa interact tool vol human machin intuit approach hutchin cognit consequ pattern inform flow understand experi commun mark menu addison evalu tool contraint intern report chatti rhythmic interact base rhythm break la de charg cognit par de act edit jl touch input screen effici human comput interact intern symposium aviat psycholog ohio push limit user interfac jl confer pen comput technolog overview vision sigchi pp septemb design visual prentic spark innov comput shneiderman ablex nj edit develop mileston tool work interact vol pp gold comput augment environ special issu commun juli
DB/1542 3 predict system multimedia internet zhong depart comput scienc beij abstract rapid develop internet result multimedia web content due limit bandwidth huge size multimedia user suffer long time wait predict web object page user view user view current perceiv network latenc significantli reduc present base model util path profil user larg web log predict futur request model base simpl extens exist model result show sacrif applic gain great deal predict present effici method compress predict model size fit main memori result potenti appli wide rang applic includ enhanc recommend system web cach polici experi base realist web log prove effect scheme web markov multimedia introduct internet global dynam inform repositori vast amount digit inform multimedia form amount inform pose great challeng school comput scienc simon fraser bc canada zhang microsoft research china sigma center beij internet user struggl access inform time manner limit access bandwidth effect reduc reduc perceiv latenc load catch request multimedia data client end user view current web page object achiev scheme accur predict futur request predict increasingli feasibl inform web log paper present effect scheme predict action web base inform web log due web amount work predict model web popular predict url base present url regard markov model graph current probabl access node list requir knowledg context web page exampl system system system step focu make predict send document ahead time accur predict potenti shorten access time reduc network traffic handl correctli predict model point base path base draw small amount inform session predict potenti inaccur model confid measur futur document accuraci work model past model built base previou path potenti accur gener belief suffer lower applic sequenc long length rare aim paper myth show larg web access log work perform author visit microsoft research china beij build accur predict model high applic web url numer valu predict work base url task string symbol predict symbol past histori symbol string present probabilist predict model inspir predict model commonli commun found predict accuraci substanti moder applic present combin approach multipl model organ manner experi show approach achiev reason balanc applic provid effici method reduc model size work assum knowledg user profil requir syskil webert knowledg linkag structur web site requir webwatch requir user session web access log successfulli requir realist appli wide rang multimedia applic paper organ section relat list previou work work section present algorithm construct detail present predict algorithm section evalu perform section present method web document base predic result final section summari work work predict topic interest tradit comput system research al examin compress model techniqu track event item prove techniqu converg optim onlin algorithm test work memori access pattern object orient cad system al adapt partial manner problem domain examin file system access pattern hit ratio cach higher cach lru avail web relat inform inspir amount work user action predict work recommend provid suggest futur visit web base machin learn data mine algorithm webwatch system make recommend futur hyperlink user visit base model obtain reinforc learn recommend system includ letizia system anticip action make forward explor syskil webert system learn rate page predict model obtain build sequenc user request long length user action user log predict action request base statist analysi sequenc inform due bandwidth user internet experienc delai obtain desir document research design system make predict learn model document work zukerman al albrecht al belong class markov model learn train web server log base time interv inform document sequenc inform predict document cach size client side ahead time lau horvitz classifi user queri built bayesian model predict queri goal intent base previou queri time interv work relat studi complet web search sequenc work silverstein provid detail statist analysi log data compar algorithm make predict action gather inform action long sequenc request user observ make short sequenc make predict user make random visit action predict close relat work present predict model compar power model offer hybrid model paper work relat collabor filter evalu work work base point sequenc model correl model requir comput resourc appli real time web predict note system recommend system requir knowledg web site link structur horvitz present polici guid web content situat limit costli bandwidth studi model found predict base model model built log file preprocess collect user session index uniqu user id start time session sequenc request request correspond visit web page repres request alphabet log consist set session algorithm build predict model base occurr frequenc length serv indic count tabl algorithm scan record occurr frequenc request click session maximum occur request probabl ε predict step algorithm build model algorithm length predict log begin filter log file extract session initi hash tabl store occurr document step initi hash tabl store result model total session number current session length previou request current posit set distinct page request current posit item updat highest ε end end end end return end filter step web log remov data gener search engin server import system extract session data adjac page time interv visit greater time threshold visit consid belong session user session consid sequenc url request singl user find reason set threshold hour nasa data present hour msn data remov request low visit frequenc url access count threshold remov log base empir test discuss section reason time web server log show filter process applic drop experi set θ simpl log file consist request construct model set algorithm return hash tabl predict predict algorithm base predict model construct log make predict click real time predict model built model predict probabl request step algorithm algorithm step current click minim path begin length return begin max max length predict index hash tabl predict return end end return end end end comparison experi test individu algorithm defin algorithm step current click begin length index predict return end return end assum built section observ current click sequenc consist click predict algorithm check index exist find index exist check model index predict click evalu measur set session log file sequenc length greater build model subset train separ remain test sequenc appli train model test correct predict incorrect predict remov infrequ union subset set request defin measur learn predict model applic similar mean inform retriev applic measur recal notion applic request origin number request predict model domain analysi evalu analyz data set data set zukerman work predict request al albrecht consist server log data collect period time includ total user request uniqu consist session import piec inform server data reveal figur horizont axi show integ log design number user visit curv figur upper curv percentag page visit time user lower curv show percentag accumul visit visit log page visit time si repres visit count ten time upper curv show page visit time total number visit repres visit percentag page request time request figur page request percentag monash data set repeat page request ratio data nasa data shown figur nasa data set month worth http request nasa kennedi space center www server florida log collect august august period request timestamp resolut total uniqu request total session total uniqu page request msn data shown figur log obtain server log ident user strip consist data collect jan mar total user request log uniqu request uniqu page log uniqu request group user submit proxi length session long long session rang consecut request request percentag page request request time figur page request percentag nasa data set percentag page request request time figur page request percentag data set figur present distribut chart monash nasa data set session statist distribut session consecut request server chart number session request row number request session length greater predict algorithm aim session reason choic session length equal difficult make predict accuraci base pure statist inform hypothesi support individu experi shown figur predict error reduc significantli predict base sequenc compar data occur session length figur session length distribut monash data occur session length figur session length distribut nasa data data domain follow larg proport web page correspond low access visit page entir visit count small percentag total request remov train set small amount filter process reduc predict model origin size data figur compar raw data filter data model nasa data figur show filter process experi set θ path repeat time justifi filter oper step algorithm appli model construct built hash tabl store learn model compress model elimin infrequ occur pattern model store memori give indic monash log tabl size shown tabl model size origin size hash tabl gram gram gram gram tabl size tabl hash tabl size implement model log train data set remain test log record applic inform equat record predict function path length sequenc predict figur show applic product monash scale subsequ mark length repres obtain appli algorithm ngram remain mark repres experi data consist session length greater equal train test predict combin model achiev higher predict find highest predict abil figur appli train test nasa msn log data shown figur result confirm similar visit log msn data curv place curv sudden drop tendenc curv confirm applic gram model figur applic function session length data ngram repres record session length greater gram model figur applic data applic gram model figur applic function session length nasa data log gram model figur applic nasa data applic gram model figur applic function session length msn data log figur applic msn data figur compar predict window size set observ larger window size figur compar window size data figur compar window size nasa data document algorithm observ path document request user window size predict document occur window set document model predict access user access alloc buffer client document user buffer buffer size fill subset interest document window size measur tradit measur defin percentag relev document store buffer relev document recal number document occur path document access subset predict document request user window recal defin recal extend earlier definit account document predict access ir expect recal complement buffer size run experi nasa shown figur set window size predict document buffer size buffer size recal dramat observ buffer size model make combin recal ngram model recal correspondingli strengthen import concept learn section lowest model compar model measur perform measur recal recal buffer size figur recal nasa data set window size figur distribut request interv log figur show distribut request interv log horizont axi interv sequenti request vertic axi frequenc interv log log averag interv request minut great user visit page big size compon audio video data simul data predict algorithm set buffer size experi strategi request document transfer complet request receiv server side document algorithm process cancel request user predict result true request receiv server side averag reduc wait figur reduc user request wait time bandwidth condit algorithm log experi test time save result shown fig function network bandwidth wait time reduc document reduct bandwidth futur work present base model util path profil user larg web log predict futur request work aim reduc perceiv latenc user web multimedia object give web page algorithm base idea model greater result gain predict accuraci maintain reason applic experi result show base predict greater gain order realist web log combin algorithm show higher individu model slightli lower time applic equal model higher model show algorithm appli portion web log result show train predict algorithm appli real time set algorithm applic web server recommend system work core compon undergo framework adapt content deliveri improv applic predic import featur work develop scheme integr predic algorithm cost model catch multimedia content acknowledg steven johnson msr web support group david zukerman monash share web log data refer document compar studi sixteenth intern joint confer artifici intellig explor versu exploit learn user model text recommend user model interact heckerman kadi empir analysi predict algorithm collabor filter fourteenth confer uncertainti artifici krishnan vitter practic prefetch data compress sigmod jun continu comput polici prefetch seventh acm confer inform knowledg novemb tour world wide web ijcai fifteenth intern joint confer artifici darrel de predict futur action prior event usenix annual technic confer jan lau pattern analyz model web queri refin user model automat speech develop sphinx system netherland agent assist web fourteenth intern joint confer artifici build model agent support web searcher user sixth intern syskil identifi interest web site aaai analysi larg altavista queri log technic report digit system research palo ca pitkow pirolli mine longest repeat subsequ predict www surf usenix annual technic confer md path profil predict http request seventh intern world wide web confer australia albrecht predict request www seventh intern confer user model
DB/1543 3 systemat chang manag data wareh salteni slivinska jensen depart comput aalborg fredrik aalborg denmark abstract widespread data wareh design effect data mainten focu attent independ area tempor activ area research decad articl identifi shortcom star wide industri abil handl chang subsequ studi applic tempor techniqu solv shortcom star schema repres approach design gain widespread popular data attract star schema contend slowli chang dimens data studi tempor star schema provid solut identifi problem fundament chang design approach studi rel size queri perform regular star schema tempor counterpart data offer insight rel understand queri regular tempor star schema introduct data wareh fastest grow segment manag biggest market softwar area data wareh grown support met exist manag technolog data data resid belong system aim support busi term oper data system term transact process system oper system kimbal oltp system design meet turn wheel system meet watch wheel find wai make turn object data wareh meet enabl exploit data enter oper data store base busi care accumul data captur past perform enabl data system typic emploi hardwar softwar separ oper system data extract oper data load data accumul make data year process load oper data typic perform regular night architectur impli life cycl data consist altern short load data queri data queri data data organ queri analyz wai requir analyst easi formul execut queri queri larg answer execut involv scan huge amount data requir make queri run fast fulfil organ data data consid carefulli data model main techniqu star schema serv mean repres data relat wide possess desir star schema contend slowli chang dimens occur record inform remain valid durat record account balanc bank paper studi techniqu tempor solv problem describ tempor star schema empir comparison tempor star schema regular star size queri formul queri tempor star schema consid captur valid time time fact store true model opposit transact concern fact current notion tempor star schema introduc white paper perform schema tempor data object studi awar work studi queri tempor star schema paper outlin section introduc star distinct identifi problem motiv studi section describ tempor star cover data present section proce describ set comparison tempor regular star schema section compar size queri section conclud paper star schema problem precursor present identifi problem regular star data data star schema star schema collect tabl central fact foreign kei dimens foreign kei fact tabl row typic addit foreign kei measur typic describ busi process row dimens tabl typic describ aspect row fact tabl presenc time dimens describ measur valu effect defin properti data compani chain store sell product row fact tabl model sale product record quantiti sold dimens tabl time describ product store product time product sold star schema shown figur fact tabl row store inform april store sold item product address citi store product year time sale figur sampl star schema granular measur valu fact tabl row product store dai singl row record sale singl product singl store occur singl dai granular time dimens includ month choic granular affect level detail record inform size differ attribut fact versu dimens tabl attribut valu fact tabl numer vari store dai sell quantiti product contrast dimens tabl attribut store address product serv constraint busi analyst queri attribut dimens tabl method ensur data remain correct consist attribut valu call slowli chang dimens discuss detail section distinguish orient data data exampl data type inventori transact store concern data exampl data account inventori level event state model complementari construct state span state construct repres state data star schema repres event depend data orient type data repres row fact tabl correspond event real life data repres fact tabl row repres event state object data repres row fact tabl repres state fix point independ state object correspond revisit issu section problem handl slowli chang dimens previou assum implicitli dimens tabl independ easili dimens depend time dimens price product product dimens chang time term dimens slowli chang presenc lead potenti consist correct handl price product chang reflect product repres correct price sale record fact tabl product fact tabl row insert chang refer fact tabl row refer price kimbal method handl slowli chang dimens method fidel describ method star schema fact term record account balanc dimens tabl account record custom account inform account assum custom john smith chang address januari popular method handl slowli chang dimens creat addit dimens row time chang attribut descript figur balanc custom balanc custom gk bal gk cid address gk bal gk cid address john john john figur method balanc custom tabl creat row custom dimens john smith address field row uniqu kei social secur number custom kei valu custom john smith social secur number independ address creat gener kei requir special handl consum addit space data shortcom newli updat valu dimens older fact vice bank branch exist track histori term branch method gener creat solut problem handl slowli chang dimens problem ineffect handl chang data mention data repres event identifi potenti data size queri perform problem manag state data realist inadvert lead loss inform repetit inform bank record balanc account sampl balanc hour complet account inform occur transact singl account hour sampl minut redund enorm account entri minut independ balanc chang difficult proper time granular balanc chang chang rare suitabl state transit occur regularli real world event row fact tabl balanc chang loss inform record fact event event adequ record fact balanc independ time balanc chang chang event avoid redund inform balanc chang gener row data event creat queri perform problem frequent entir period state persist time balanc remain constant effici find time dimens row give period find end period simpl cheap comput present tempor star repres solut problem mention section tempor star schema base previou conclud problem handl slowli chang dimens fulli satisfactori conceptu clean solut regular star schema tempor star schema systemat solv problem reason tempor star schema achiev good queri perform compact data idea tempor approach thing observ chang system captur repres histor inform natur tempor star schema differ tradit treatment time tradit star schema treat time tempor star schema omit time dimens tabl timestamp row tabl treat fact tabl dimens tabl equal respect time ad detail observ data data repres differ tempor star schema event mean row fact tabl repres event captur event occurr time emploi state mean row tabl describ state begin end time period state persist figur transact date transact amount begin date end date account balanc figur event state data event advantag store timestamp natur type suit data queri queri question state object period time result comparison timestamp row execut slower state occupi suit data queri closer data tabl observ dimens tabl predominantli store data impli timestamp dimens independ fact tabl repres event state bank left figur fact tabl row repres bank transact branch dimens row timestamp branch oper juli origin dealt save upgrad provid loan april branch dimens tabl row branch timestamp juli april dimens tabl timestamp occur dimens model object chang describ world object inventori statu dimens inventori track data dimens list valu inventori statu tempor star problem handl slowli chang dimens disappear gener kei data repres diminish potenti queri perform size problem occur event regular star schema worth note tempor approach inform regular star star associ exact date histor inform presenc period timestamp issu repres maximum date referenti integr constraint maintain primari kei tabl augment timestamp origin kei timestamp join tabl row origin kei timestamp overlap set comparison star schema previou section compar regular tempor star schema conceptu level data size queri perform consid investig repres wai regular star schema tempor star lead comparison data regular regular event tempor state attempt repres size execut speed queri gener differ order present concret number size speed measur give real feel base experi case studi data bank assum custom account type inform singl account custom intend support time regular dimens time granular fact tabl row show total sum account balanc fix dai week type account open branch type custom order load data addit assumpt assum aggreg balanc chang fact tabl event state entri fact tabl exclud duplic valu total balanc custom older live aalborg remain fact repres event state fact tabl row term number correspond actual chang rate relev combin branch account type custom type custom type combin branch live aalborg open account branch locat copenhagen assum dimens chang time slowli chang dimens branch schema regular data tempor tabl schema regular branch fact tabl time tabl exist branch tabl regular gener kei tempor branch tabl timestamp attribut fact tabl regular foreign kei attribut balanc attribut fact tabl tempor includ foreign kei time addit timestamp attribut balanc creat index fact tabl regular fact creat primari index foreign kei tempor fact tabl creat index foreign kei attribut tempor experi primari index includ attribut sql sourc code creation tabl index size estim attribut valu tabl found refer experi carri oracl dbm data size proce compar size data size size fact dimens index dimens tabl gener small rel fact tabl impact total fact tabl index size tabl determin number size row gener formula comput size tempor state regular event regular function return number row fact tabl assum row fact number row size row comput exact number data block oracl data block lead section state actual chang rate bank case relev combin record data week row fact tabl row fact tabl event state regular schema event tempor schema suit repres occur real world difficult imposs sampl rate regular schema remain function formula comput fact tabl row length index entri length formula function quantiti formula defin tabl rh eh rid notat definit rh row header size byte sum size kei attribut fact tabl sum size foreign kei attribut fact tabl number fact tabl attribut eh index entri header size byte rid row identifi size byte sum size index kei attribut fact tabl number attribut index defin fact tabl tabl definit notat fact tabl row length regular event differ tempor differ presenc timestamp attribut fact tabl tempor presenc gener kei refer slowli chang branch fact tabl regular presenc foreign kei refer time tabl fact tabl regular size fact total size data bank case tabl structur fact tabl index total size tabl data size year data bank case studi characterist defin index number length index entri number index entri number fact tabl row index attribut length store oracl attribut averag length byte store length entri length affect space usag index attribut tempor presenc refer slowli chang presenc refer time dimens tabl regular base formula number provid tabl determin size function actual chang figur state size smaller size actual chang rate smaller state index includ state event mb figur data size function actual chang rate attribut index index size total size state give actual chang rate point equal approxim speed queri import achiev space analyz queri perform queri perform experi compar queri perform data begin gener observ optim queri execut scenario give type queri present draw gener observ special structur star notabl presenc huge fact tabl number small dimens greatli impact set queri execut strategi data queri tabl size differ distribut valu tabl optim emploi dimens optim scenario execut queri data begin full scan dimens identifi dimens tabl row satisfi constraint dimens attribut queri step perform cartesian product kei qualifi row composit kei lookup fact tabl identifi qualifi fact tabl row main idea access fact tabl late primari index index usag rang perform uniqu kei lookup index depend order kei attribut dimens composit primari kei fact tabl index set constraint concret queri benefici index constraint dimens kei composit kei fact tabl index fairli compar queri execut speed step ensur queri execut optim execut time provid section measur extens care tune queri queri type queri goal queri perform experi find affect queri perform regular tempor accomplish defin broad queri type investig repres queri type differ handl type queri defin base type tempor predic emploi retriev chosen type queri figur queri type type tempor predic retriev time point time period time durat tempor figur queri type find reason assum differ queri involv time oper lead differ queri perform chosen type queri cover broad rang aspect queri perform identifi potenti differ queri queri type perform give sampl queri queri type queri give illustr type custom live zip code ag save account septemb monei save account septemb custom type biggest amount save account compar custom live zip code ag save account septemb octob type custom live zip code ag save account august novemb custom type account type averag april balanc save account custom younger live zip code type custom type balanc save account type balanc save account custom younger live zip code bigger perform result evalu queri previou section total measur actual execut time figur execut time shown figur queri tempor measur index includ index yield perform queri execut time normal respect longest execut top column addit includ actual tune sql queri execut provid state event figur queri execut time percent slowest queri figur queri tempor case effici queri event main reason event difficult find time period state valid row fact tabl repres begin order end locat subqueri addit affect subqueri reduc readabl understand subqueri present nest queri type event face problem find time period current balanc state valid accomplish addit subqueri union select statement catch event factor reduc queri perform fact tabl duplic valu bigger fact tabl fact tabl row satisfi queri constraint block read disk main reason poor perform queri fact tabl row index entri bigger tempor disk block read requir number row regular differ present absenc time dimens tempor elimin join tabl price time tabl date attribut fact lower perform queri queri type event access fact tabl row affect answer access fact tabl row test time constraint hold tempor date index date present queri tempor forc access row result disk access slow queri execut experienc date comparison oracl clear lot date check hold queri worst perform tempor index mean fact tabl row tempor check timestamp row determin overlap period join slowli chang dimens tempor complic regular check fact dimens row timestamp made ensur fact row timestamp overlap dimens row timestamp issu queri type tempor queri languag make significantli easier formul tempor join queri problem tempor explain queri perform time seri slightli state systemat handl slowli chang dimens tempor star schema lead complex tempor attract handl slowli chang dimens regular star schema gener kei branch dimens complic queri valu kei identifi real branch entiti exist gener kei queri regular subqueri constraint branch main join branch subqueri make queri difficult write hard comprehend import point virtual queri requir manual tune oracl achiev reason perform gener queri event tend complex time queri tempor stai simpler run faster extend version paper elabor issu discuss section futur research data model star schema typic approach design data regular star schema treat time equal assum independ data captur event event state repres event star schema star schema fundament difficulti handl slowli chang dimens chang state record potenti larg amount redund event difficulti queri perform fall short captur actual time dimens chang solut tempor star schema systemat captur fact dimens tabl alik tempor star time independ dimens dimens tabl repres attribut tabl data repres event time attribut fact data state time tempor star schema tempor star handl natur systemat storag full correct histori data investig data size queri perform repres conclud queri easier write run faster tempor state regular event tempor state size smaller regular tempor state redund inform conveni comput period state queri addit studi shed light properti tempor star schema experi carri real data real queri issu effici studi updat exist row tempor regular insert row interest analyz tempor star schema includ time tabl compact timestamp make comparison effici join time dimens tabl requir research direct investig advanc join techniqu join techniqu involv precomput join perform gain result usag precomput join visibl tempor regular tempor join complex regular join acknowledg research support part danish technic research council grant chorochrono fund european commiss dg xii research network activ train mobil research contract refer snodgrass partit storag tempor inform jensen systemat chang manag data wareh feb inmon build data john wilei ed jensen al consensu test suit tempor queri dept mathemat comput aalborg jensen consensu glossari tempor concept acm sigmod jensen snodgrass semant inform inform kimbal data toolkit john wilei son ensur kei referenti integr tempor languag intern baltic pp support tempor data feb red brick star schema process complex queri feb ahn taxonomi time acm pp snodgrass tempor ieee snodgrass al tempor queri languag kluwer academ publish valduriez join indic acm
IR/1544 5 fact content digit librari finn nichola kushmerick barri smyth smart media depart comput colleg dublin abstract web vast repositori valuabl hidden user natur www present uniqu challeng inform extract categor view www valuabl resourc gather inform digit librari paper describ process extract classifi inform www integr digit librari focu wai automat classifi articl present opinion report fact describ evalu system develop automat recommend web articl sport polit domain introduct www vast resourc digit inform potenti inform sourc digit librari alongsid great potenti inform overload problem user locat inform limit potenti web abil automat retriev categor document www import step forward structur inform web order full potenti valuabl asset digit librari system retriev classifi document web present uniqu set challeng inform www transient tradit method prove inadequ approach requir transient natur inform web characterist sourc inform digit librari inform disappear web obsolet date inform extrem current abil quickli retriev current topic inform channel user import servic digit librari valuabl servic digit librari user paper outlin system discuss issu involv automat classifi web articl factual opinion detail construct includ text extract compon automat identifi bodi text web articl final evalu accuraci result system abil gener unseen domain larg bodi relat work inform retriev automat mention sampl area wrapper induct techniqu automat gener wrapper extract inform web page learn classifi document part ontolog discuss shopbot system appli machin learn techniqu problem automat extract inform web system automat classifi web site industri categori cora project machin learn techniqu automat construct domain search engin subject sentenc level discuss nave detail articl layer url www opinion fact classif agent user www agent user figur system overview research issu main aim research promptli retriev classifi articl develop system scale gracefulli transfer easili classifi articl vari unusu criteria recogn tone articl articl present opinion factual enabl person retriev document class interest user fig present architectur meet object instanti architectur www servic monitor web site articl number text creat person digit librari content ad system grow built domain featur order facilit domain transfer system paper describ preliminari result core system articl act central inform repositori part system set www agent retriev inform web store url agent watch web site articl store url agent sec extract main bodi text articl text algorithm sec set agent classifi articl class built hand explor techniqu autom process incorpor opinion anticip ad futur remaind paper focu element automat extract bodi subject document www opinion recogn articl express opinion author articl kind form column editori articl contrast report fact focu form user requir prefer type articl prefer develop opinion motiv exclud domain featur order easili migrat domain train system domain footbal gener appropri test polit articl figur typic articl bodi text extract articl publish www extran clutter articl consist main bodi constitut relev part page surround bodi irrelev inform copyright link identifi main bodi articl base featur occur area anticip improv accuraci imag link occur bodi relev articl imag link bodi provid interest inform articl similarli extract text web page text extract articl bodi mislead text extract surround clutter fig show typic articl main bodi text mark bodi gener copyright side link unrel articl automat identifi region web page main bodi text build found text bodi articl relev document mislead text identifi main bodi web page gener robust manner inform extract problem approach view web page consist kind html tag token text token html page repres sequenc bit bn indic nth token bn indic tag fig show graph cumul distribut function posit articl fig extract algorithm base idea end middl distribut correspond point main bodi articl begin end problem view optim problem identifi point maxim number tag token simultan maxim number text token text extract chose simpl object function bn bn bn advantag method text extract requir extract text web site site wrapper text extract algorithm extract bodi text web page algorithm perl modul project figur cumul distribut function posit document central correspond bodi text highlight fig motiv observ text main bodi misl opinion built base text extract bodi articl system oper watch site articl classifi articl site report articl present opinion author good articl reuter form column editori investig possibl automat recogn opinion articl build opinion main aim high domain transfer classifi base featur uniqu footbal gener test polit consid occurr word text conjunct nave anticip word occur text featur produc gener expect approach transfer domain perform articl site experi approach led develop method bodi text extract found text web page mislead provid predict featur strong site train data produc opinion copyright notic page provid strong featur featur singl domain classifi articl polit contrast approach examin type languag document expect kind languag opinion document express factual articl number type adject sentenc indic subject element languag style languag content hope produc capabl gener unseen domain process document brill tagger repres document fraction word po learn tree base po featur hybrid approach word lexic featur preliminari experi reli po featur evalu experi document footbal order evalu accuraci domain transfer corpu document spider web manual figur opinion accuraci class class tabl sampl rule opinion corpu footbal articl opinion polit articl opinion experi cross split compar occurr word featur conjunct nave po statist conjunct result shown fig vertic axi show percentag articl test set correctli horizont axi train test data fp train footbal document test polit document result shown nave sampl rule gener learn algorithm shown tabl result show base po statist perform base word occurr statist case conclud kind languag document indic subject content document case train test domain accuraci impress footbal domain nb approach nb perform closer polit relev content subject vari domain expect base po statist gener domain test train domain test domain pf perform nave fp perform slightli nave conclud po approach suit gener domain compar nave algorithm note result stabl nb result case train test domain return approxim accuraci case train test domain return approxim result content document vari relev subject type languag reliabl indic subject automat document import bring order web kei enabl technolog gener digit librari system paper problem deal recogn natur web articl term repres report fact author opinion result accur classifi document repres fact opinion result demonstr achiev high level accuraci statist featur experi bear intuit kind languag document indic subject actual content document implement subject agent agent ad system footbal major footbal club potenti construct automat sourc train data team home implement demonstr system user provid feedback accuraci agent facilit experi ultim goal person digit librari approach user present articl class interest system build interest articl read acknowledg research fund part grant naval research refer eric brill advanc part speech tag mark dan dayn andrew mccallum learn extract symbol knowledg world wide web oren daniel weld scalabl agent web acm agent nichola daniel robert doorenbo wrapper induct inform extract sean lee david jame hendler web agent andrew mccallum nigam event model naiv text workshop learn text categor andrew kamal jason seymor machin learn approach build search engin john pierr autom web site linkop electron articl comput inform volum ross quinlan program machin learn morgan wieb learn subject adject corpora
AI/1545 2 learn model continu plan matthew tim paul cohen comput scienc box ma abstract interest natur activ structur behavior nontrivi durat intellig agent develop activ continu process simpler activ form sophist hierarch fashion success failur planner depend model abil implement plan world describ approach gener dynam model activ experi explain appli plan continu state space introduct interest problem activ emerg intellig agent activ plai critic role develop cognit goal deriv implement theori develop activ intellig agent implement mobil robot model develop activ broken continu ongo model plan process model agent endeavor repres effect action observ environ pioneer begin model process primit action sensor primit action move robot forward turn lower gripper pioneer primit sensor includ veloc bump read blob vision system pioneer attempt model primit action affect pattern observ primit sensor model creat plan process begin model simpl plan achiev goal plan planner creat activ achiev increasingli sophist goal result process hierarchi activ serv basi conceptu develop class focu paper detail model process enabl plan describ transform model effect activ follow discuss model instanti gener simpl control serv basi plan continu space mobil robot conclud short discuss state system futur work plan learn dynam experi model activ explain sensori pattern robot expect engag activ engag move activ result robot veloc encod ramp distanc object robot obstruct attempt move veloc encod report robot bump sensor report sonar report chang primit action offer hand qualit outcom step robot differenti multipl outcom activ time seri sensor data result applic activ typic outcom characterist sensori pattern figur trace distanc agent object experi move activ data left experi robot move past object incid data repres robot push object figur show characterist sensori pattern move activ plot distanc agent object slowli sharpli meter meter object disappear indic robot pass object experi distanc object close constant pattern characterist movement object push approach differenti outcom signatur pattern basi cluster cluster experi common cluster algorithm reli kind similar call distanc judg data singl cluster distanc metric make characterist pattern time seri data judg similar simpl distanc metric judg distanc time seri simpli comput squar differ time seri pattern figur larg distanc due sharp plot left simpl distanc metric robust differ experi pass object pass object pass differ time drastic squar result distanc experi greater distanc plot figur robust distanc metric abstract differ time durat perform tempor util algorithm call dynam time warp dynam time warp algorithm stretch compress oper creat tempor map time seri minim squar differ stretch oper extend time scale region time map interv durat ffi interv durat preserv tempor order data point compress oper map interv durat ffi interv durat previou pass dynam time warp simpli compress lead object disappear sight interv warp time seri small squar differ pass seri compress stretch obscur differ time seri figur distanc time seri greater differ pass experi dynam warp algorithm appli task warp experi find tempor map minim differ arbitrari subset sensor time seri subset correl sensor reliev algorithm subtl pattern found visual sensor overshadow wild noisi pattern sonar minim squar differ experi comput dynam time warp algorithm distanc metric cluster emploi simpl agglom cluster algorithm collect experi warp distanc small type cluster scheme begin experi separ merg cluster lowest distanc experi cluster merg continu distribut distanc judg significantli distribut distanc cluster oper model result cluster algorithm partit agent experi cluster correspond outcom activ cluster serv predict oper model make practic subject cluster transform repres cluster prototyp experi cluster prototyp experi creat averag sensori time seri experi belong cluster averag serv smooth noisi sensor data reduc volum data consid make predict prototyp experi time seri linear fit recal variabl natur activ activ hour crucial inform plan perspect rate thing chang linear fit retain rate inform planner project variabl durat return issu predict section fit algorithm approach line fit pass window size calcul differ slope fit left side window statist comput drastic chang slope data threshold algorithm split time seri drastic slope invok line fit algorithm piec algorithm continu drastic slope chang piec longer piec fit screen shot fit algorithm result shown figur model entail process robot experi action cluster dynam group similar outcom cluster repres prototyp experi sensori trace line fit algorithm robot readi cluster plan continu space plan gener activ plan requir analysi similar strip planner planner design cope continu environ system prodigi planner adapt plan domain mobil robot discret action state space discret behavior predic reason symbol introduc rate chang tempor quantif introduc tempor constraint continu chang symbol plan approach work directli sensor creat control achiev goal learn oper model process creat control learn oper model call oper instanti describ languag implement simpl control detail oper instanti process control languag goal design control languag creat languag express human engin implement hierarch control arbitrari simpl planner gener type control achiev goal result possess simpl lisp type syntax primit power implement conceiv behavior basic construct acl activ deactiv condit construct declar control program termin control program illustr program grasp translat figur sensor trace move activ shown linear fit trace translat veloc trace visual sensor record distanc blob track vision system grei vertic bar activ deactiv time move number marker left graph denot phase gener linear fit find move agent grasp line control program make macro simpli run subprogram subprogram complet form initi activ specifi termin gripper beam note condit call program finish termin depend statu subprogram grasp program initi acl languag control agent oper continu space form elementari build block output oper instanti process oper instanti recal oper instanti process oper model achiev specif goal acl oper instanti process block gener oper model intend achiev goal discuss oper instanti break oper model interv call describ sensori pattern observ oper activ activ interv repres experi lifetim activ deactiv interv describ activ deactiv interv delin vertic line figur interv interest oper instanti activ deactiv interv activ interv repres behavior control agent agent limit control deactiv activ deactiv interv repres behavior control agent agent deactiv deactiv move kei oper instanti comput deactiv activ agent rest goal step acl program section agent move object grasp gripper beam trigger deactiv move activ simpl ideal stop gripper beam mere ahead back gripper robot expect activ reliabl bump object grasp stop unaccept object tip reliabl solut pioneer vision system measur robot distanc account robot movement step end equal task oper instanti comput termin condit move activ result goal achiev effect deactiv phase occur deactiv point comput start goal work fit oper model deactiv phase fit part activ phase unavoid ad goal cumul effect deactiv phase modifi goal deactiv point activ approach object grasp select oper model prototyp pictur graph figur start goal oper instanti begin ad effect phase slope phase linear fit phase effect goal phase slope mm sec durat phase robot approxim half long effect comput subtract origin goal phase activ phase phase deactiv comput deactiv criteria move activ movement block grasp program futur work end end system explain develop structur activ intellig agent system divid develop model process agent learn dynam activ plan process agent exist disciplin activ model process account fact singl activ singl outcom vari durat gener oper model cluster experi cluster linear model run model system experi pioneer primit action gener cluster subset pioneer primit sensor cluster separ experi group categor versu obstruct pass object left versu pass implement oper instanti test cluster small number simpl discuss section oper instanti acl code correctli project termin criteria arriv simpl goal continu test area order test reliabl ensur treat deactiv phase fix interv express handl activ outcom acknowledg research support advanc research project usaf contract govern author reproduc distribut reprint notwithstand copyright notat view author interpret necessarili repres offici polici express govern refer jaim oren robert craig steve manuela veloso integr architectur plan learn work note aaai spring symposium integr agent brian everitt cluster analysi john wilei weld tempor plan continu chang twelfth nation confer artifici menlo press sacerdoti plan hierarchi abstract space artifici intellig septemb david joseph kruskal editor time string theori practic sequenc comparison addisonweslei publish
IR/1546 5 interact queri search semistructur roi jennif widom stanford abstract semistructur store web data languag queri data complex casual web user queri approach advantag interact typic web profici iter refin web explor paper model interact queri search semistructur user begin simpl keyword dynam structur submit refin queri enabl model requir semistructur appar tradit demonstr import effici keyword structur summari queri support pointer describ preliminari solut technic issu introduct queri web understand gather attent research industri search entir search engin success technolog search engin assum semant work dispar data sourc make web search singl web search engin tool larg web thousand attract million user sport site page million page view dai larg site fundament web singl site control point administr consist assign site semant data relationship enabl express search larg commerci web cnn abc user limit queri abil larg amount data site user menu examin subject search engin specif menu time subject index limit scope keyword search engin locat relev doesnt advantag conceptu data relationship maintain site web site conveni ffl photo bill clinton ffl articl snow written summer ffl team won night point queri site data store numer research semistructur data languag queri web data mag argu semistructur requir explicit suit tradit system store dynam data web discuss queri data typic queri feel larg import group client simpli casual web pose interest queri site data typic web user pose casual user type queri languag unrealist handl queri user fill approach natur limit queri flexibl previou work dataguid interact queri tool present dynam structur summari semistructur data user queri dataguid work support air forc rome laboratori darpa contract summar path start root dynam summari import basic technolog reason present user summari path root forc explor unnecessari structur target casual strategi model exploit kei techniqu web user intim familiar simpl queri begin keyword explor refin result support simpl queri user relev data search engin web shown keyword search easi effect techniqu begin search enabl summar structur queri result dynam build present dataguid summar path object return queri result user repeat process submit queri dataguid addit ultim locat desir result discuss context lore project oem data model lorel queri languag result applic similar data emerg xml standard defin semant structur html document rest provid background context section section present simpl motiv illustr function semistructur system support interact queri search session model section section cover requir ffl keyword search effici data structur index techniqu quickli find object match keyword search criteria borrow heavili inform retriev context graph suffici simpl set document warrant investig ffl dataguid comput dataguid queri result develop algorithm comput present dataguid comput demand ffl pointer fulli structur context queri crucial exploit pointer creat dataguid submit refin queri support pointer major model semistructur data base direct pointer consid queri languag background set stage rest briefli describ oem data introduc lorel queri summar dataguid object object identifi atom complex atom valu data complex oem collect oem link parent descript textual label oem thought direct graph left side figur tini subset oem stanford describ root object lorel queri base oql evalu queri base path express describ special edg root design serv entri point figur simpl lorel queri return set object queri return answer object creat object result made children answer answer edg success queri identifi label assign edg connect answer queri result base edg reach object queri evalu label titl lorel queri creat complic object structur queri simplic ignor queri work easili gener member member project public titl year public public titl year titl year olap oltp sql jone project figur sampl oem java dataguid dataguid dynam structur summari oem oem object summar oem distinct label path root path root path root correspond path exist carefulli chosen figur dataguid atom sequenc path real member object public object java dataguid present hierarch user interact explor side figur show java dataguid sampl click arrow expand complex object expand cycl expand deepest project member arrow user queri directli java dataguid simpl select path queri ad filter condit diamond dataguid correspond label path click user condit path select path queri result filter condit render diamond select path highlight java dataguid figur show queri select project public dataguid gener lorel lore server evalu web user format queri result hierarch html easi motiv section trace motiv sampl present figur user find public seemingli simpl queri previou sampl queri found public write lorel queri find casual user enter textual lorel queri illustr limit dataguid locat inform simpl numer path larger situat dataguid good job summar path user interest data independ topolog typic web user comfort enter user type start address case user type discuss issu multipl keyword section system gener collect public answer identifi answer initi search focu public approach object year public year titl figur dataguid construct result find public larger difficult dynam gener dataguid shown figur notic titl year object reachabl numer path origin consolid figur shown java user mark public select enter filter condit year retriev public result origin dataguid requir condit path public scenario motiv effici keyword search effici dataguid creation queri result show featur essenti forc system support pointer user type answer sampl singleton set dataguid result empti result atom object illustr user gener area result subobject structur encapsul dataguid present user requir pointer year public year creat descript dataguid result queri search session model defin lore session initi root initi dataguid sequenc queri queri dataguid list advanc arbitrari lorel queri object return queri access complex object answer gener present dataguid user object queri result counterintuit notion narrow restrict queri grow monoton queri dataguid focu user queri restrict data discuss technolog enabl effici realiz model interact keyword search ir keyword search typic return rank list document keyword semistructur pertin inform found atom valu label edg make identifi atom object match object match incom label user enter return object point atom object word data approach similar spirit keyword search handl search result categori site match keyword keyword search valu label express queri languag lorel issu effici execut address built index handl type queri index map word atom object limit ir capabl index map word edg match label interest issu handl multipl keyword limit restrict search find multipl keyword singl oem object model encourag decomposit small object effici identifi object edg keyword term link distanc investig issu explor topic group rank essenti aspect search engin return larg answer set dataguid motiv build dataguid queri result ignor issu pointer shown comput dataguid worst case run time exponenti size larg linear run time slow interact session introduc techniqu improv run time exploit auxiliari data structur built provid increment dataguid mainten structur recomput construct figur user search queri return singleton set dataguid reachabl origin dataguid dynam determin fact singl hash tabl addit comput observ interact user rare explor entir dataguid experi show initi user rare explor level reason user structur object object queri result modifi origin dataguid construct algorithm work chang algorithm build dataguid piec time user differ transpar respect speed user click arrow region hasnt scene send request lore gener return dataguid mainten structur make easi interrupt dataguid comput continu redund work pointer direct graph popular choic model semistructur queri languag close ti model power regular express forward essenti languag support problem directli pointer motiv parent import child locat specif data ad pointer affect level semistructur includ object creation dataguid summar queri languag queri execut pointer cluster object data store separ index make access pointer seamless object incom label object conceptu make child label edg treat part addit forward edg focu pointer affect graph queri queri execut dataguid extend dataguid summar forward link link simpli ad modifi dataguid algorithm approach yield unintuit result oem object identifi incom label object incom public edg basic assumpt summar group object ident incom label poor job identifi object object incom song dataguid group unrel object user initi search librari find titl object figur show atom object result dash link show surround structur figur answer titl titl titl plai artist song author book titl titl titl figur oem queri result potenti dataguid show standard dataguid answer problem label shown algorithm group unrel object label directli result includ titl song address modifi dataguid algorithm slightli object reachabl link base link object figur show intuit refer panoram dataguid note ad pointer dataguid creation add edg object origin make support dataguid import queri languag user queri origin user queri panoram dataguid figur user select author find author book titl initi result support direct access gener queri select queri essenti perform join titl answer book titl entir return author book wildcard repres wildcard naiv execut strategi effici execut base forward pointer depend index quickli return book object support index lore store pointer train optim exploit find book object perform system simpli follow forward pointer titl initi result difficult recogn optim case approach link directli path express languag implement statu interact queri search support featur discuss develop lore project onlin lore demo reflect design complet visit refer wiener lorel queri languag semistructur data journal digit novemb suciu queri languag optim techniqu unstructur data acm sigmod intern confer manag page june suciu program construct unstructur data intern workshop program languag cattel object morgan san world wide web consortium extens markup languag decemb recommend digit equip corp technolog suciu queri languag manag system sigmod septemb goldman widom enabl queri formul optim semistructur data intern confer larg data inktomi corp technolog hotbot white paper widom manag system semistructur data sigmod septemb widom object exchang heterogen inform sourc eleventh intern confer data page march corp corp surpass billion page view decemb press
IR/1547 5 introduct adapt inform extract sublanguag analysi inform extract made progress decad develop effici approach yield modest level perform gener text good perform text year work adapt topic recent workshop system rapidli automat move extract task develop influenc linguist studi text trend linguist analysi earli system full case deep semant analysi limit full method decad gave common methodolog base limit simpl pattern match adapt system case syntact analysi learn pattern base pure word sequenc regular express markov moonei freitag mccallum method oper directli word sequenc fact proven effect pattern occurr repeat syntact cue minim system built relat sea fact choic relat gener driven practic demand research support nation scienc foundat grant advanc research project agenc grant space naval warfar system center san diego paper necessarili reflect posit polici govern ralph grishman comput scienc depart york ny gain confid creat limit set sight higher system extract broad rang fact text subject domain refer domain extract build identifi fact address gain guidanc linguist studi issu studi sublanguag sublanguag inform structur sublanguag sublanguag special form natur languag domain subject matter exampl sublanguag languag weather aircraft repair scientif articl hospit radiolog real estat sublanguag special semant case special syntax focuss primarili scientif technic sublanguag incorpor formal notion sublanguag mathemat theori languag sublanguag subset gener clear notion sentenc unaccept accept gener languag accept biochemistri articl wash acid wash subset close syntact oper gener languag mean sentenc accept syntact transform enzym activ process activ subset constitut sublanguag term set sublanguag word class combin class languag syntact word class class involv domainspecif entiti cell enzym studi issu interest develop adapt discoveri method inform format idea discoveri method central work structur linguist level linguist descript coupl method discov descript text case syntact regular reduc complex sentenc simpl canon syntact structur simpl activ declar harri term kernel structur exhibit repetit pattern word captur term sublanguag word class sublanguag sentenc structur class analysi linguist structur text domain insight inform structur basic class object relat object combin kernel sentenc structur modifi connect creat set canon structur captur inform sublanguag text harri direct studi develop inform structur scienc sublanguag al studi scientif medic develop inform extract procedur fill structur type medic text al differ sublanguag studi scienc sublanguag ideal sharpli defin goal inform structur captur inform sublanguag text open domain extract seek identifi import relat text boundari domain sharpli defin heart goal discov text essenti inform relationship linguist express relationship learn method develop method pattern discoveri methodolog develop year lightli adapt close discoveri sublanguag kernel pattern work adapt train involv annot recent experi start raw text area extract pattern work riloff corpu divid document mark relev relev extract task corpu relev pull word combin predefin set syntact relat compar frequenc combin relev text text occur significantli frequent relev text good candid extract pattern approach extend al recent corpu complet unmark discoveri start word pattern good indic topic interest pattern retriev relev relev document identifi addit pattern method similar process expand relev document set pattern set relat method al appli inform retriev method obtain relev document build pattern document specif judg relev extract task document relat state term pattern natur extend approach broader cover entir domain pattern retriev expect cover singl event rang event common event type domain similar earlier experi aim gather sublanguag kernel pattern automat text al build inform structur manual sublanguag inform order minim number syntact regular appli combin pattern includ simpl thing reduc form reduc singl form involv combin verbal nomin form limit comput regular perform automat experi work involv fix set separ syntact involv regular structur sublanguag analyz emploi extens nomin extens automat syntact regular benefit seek relat structur lexic semant synonymi identifi relat pattern hand sublanguag imagin lexic semant resourc part pattern discoveri basic sublanguag kernel combin limit note assembl larger inform structur combin kernel modifi modifi kernel regularli connect larger structur manual inspect fact retriev process peopl design combin type relationship singl templat manual receiv guidanc distribut analysi word class discoveri sublanguag experi adapt extract sourc word class inform sublanguag discoveri sublanguag lexicon list main sublanguag class experi extract pattern discoveri unannot classifi entiti tagger job sourc word class inform significantli enhanc pattern discoveri unannot text word class discoveri object experi riloff jone develop class extract task assembl set context class discov class pattern discoveri work similar long histori experi find sublanguag word class distribut experi al experi sublanguag analysi pattern creation word class creation process tightli coupl futur adapt system prospect idea adapt inform extract appeal hold hope automat identifi primari creat system extract relationship provid data base user retriev answer question point challeng similar linguist identifi inform structur sublanguag experi sublanguag discoveri adapt task easi pattern linguist analyz good broader entiti analysi find class good text analyz level word complex commerci sublanguag parser regular reliabl linguist data noisi analysi perform sophist distribut analysi coupl pattern word class build structur kernel level ingredi steadi progress adapt entiti analysi decad adapt excit refer moonei mari elain califf raymond moonei relat learn rule inform extract proc nation confer artifici intellig mccallum dayn freitag andrew inform extract hmm shrinkag proc workshop machin learn inform ralph grishman richard editor analyz languag restrict sublanguag descript process lawrenc erlbaum al ralph discoveri procedur sublanguag select initi experi comput linguist harri mathemat structur languag al michael thoma paul ann harri form inform analysi immunolog sublanguag kluwer academ al ralph automat word class format inform process manag ellen riloff automat gener extract pattern untag text proc nation conf artifici intellig jone ellen riloff rosi jone learn dictionari inform extract multilevel bootstrap proc nation conf artifici intellig linguist comput tool al carol margaret medic languag comput manag narr data al ralph grishman automat pattern acquisit inform extract proc san al roman ralph discoveri pattern inform extract proc sixth appli natur languag process al roman ralph automat acquisit domain knowledg inform extract proc intl conf comput linguist august
IR/1548 5 machin fl kluwer academ boston manufactur netherland adapt retriev intern local context scale web filippo menczer richard belew comput scienc engin depart california san diego la ca usa jaim yime william cohen abstract paper machin learn abstract spring ecolog evolutionari adapt local select queri intern signal outlin number experi point feasibl perform method gener class graph environ describ method appli intellig retriev inform distribut network environ paper discuss distribut evolutionari algorithm construct popul adapt web agent infospid search inform relev hyperlink autonom intellig fashion adapt spatial tempor regular local context result suggest infospid complement current search engin technolog start search engin stop engin provid global start base statist featur search space infospid topolog featur guid subsequ search show approach overcom limit current state deal problem local distribut inform world wide evolutionari local reinforc neural relev linkag relev select queri graph adapt agent introduct inform environ tool assist user wai scale growth environ adapt person prefer user user condit situat unlik face ecolog organ adapt natur environ natur agent adapt topolog intern behavior evolut learn signal cue perceiv lead featur correl fit intern ant associ pheromon food intern ant behavior behavior implement ant central ant resort random implement absenc signal capabl ant coloni intern distribut integr extern driven endogen behavior highli desir properti agent carri task complex artifici environ paper machin learn abstract spring ecolog applic intellig retriev inform distribut network environ section discuss limit current state section suggest wai limit overcom emploi adapt agent idea test graph abstract inform discoveri section illustr section context implement adapt web retriev agent system evalu section section discuss main machin learn contribut work domain network inform contrast approach address similar problem section conclud outlin direct futur research state art exploit proven techniqu inform search engin growth web provid user assist attempt locat retriev inform web search engin continu grow servic offer success multipl popular model search engin draw effici process inform collect document produc amort cost process larg number queri access index index basic invert file map word collect set document word addit process involv step remov conflat word stem word weight scheme sourc search engin opinion limit fact assum collect case earlier inform retriev system case collect highli document move time index reduc web continu updat crawler exhaust visit period revisit web page time index inaccur stale inform recent delet move incomplet miss inform recent ad chang compound huge size hinder search engin capabl satisfi user queri user face larg hit low retriev page relev respect stale inform factor make user invest time manual neighborhood subset hit list scenario requir attent user suggest queri imagin user profil track inform relev interest user subscrib mail digest human form high price case singl resourc perfectli match user multipl resourc cover wider set interest user user profil requir consciou effort subscrib inform sourc problem partial address advent push limit choic channel broad scope question extend tradit inform retriev techniqu address answer suggest popul autonom adapt inform agent effect deal problem autom work user crawler autom inform gather task build search engin endow similar agent limit amount adapt capabl work behalf user subsect discuss wai agent improv current state art linkag topolog index process build statist topolog document space vector document queri view vector larg featur space word correspond dimens document document relev respect angl respect vector small search engin show similar document effect creat fly topolog base word statist model user immedi make assumpt content retriev fact word network inform environ addit structur provid user cue focu linkag inform basi hypertext markup languag web submit search engin queri document link space store inform scale exponenti linkag inform lost construct exploit fact navig document document tabl measur ten queri submit lyco onlin minimum score paramet lyco full http refer consid articl refer eb queri repres boolean search queri color blind photographi einstein bach cinema internet evolut select red wine link argu linkag topolog spatial structur document number link preciou asset web unstructur portion author tend cluster document relat topic point link linkag topolog browser expect link provid guidanc wast time quantifi notion ad linkag topolog conjectur captur extent linkag topolog relev respect imagin user agent random walk strategi defin condit probabl random link current document lead relev current document relev call relev autocorrel defin probabl document fraction relev document call gener random probabl find relev document jr probabl current document relev linkag topolog random lead relev document higher random frequenc order occur inequ simplifi express linkag topolog ad quantiti realiti measur queri coupl search engin relev autocorrel statist collect count fraction document relev point back document set gener statist collect normal size relev set size collect gross base assumpt set return search engin correspond relev set conjectur ad linkag topolog confirm larg valu shown tabl note document structur linkag topolog driven smaller size collect valu significantli posit independ evid linkag topolog found bibliometr studi web approach web page categor discoveri link constitut cue exploit autonom agent user agent exploit linkag inform confid unreason task autonom agent note inform encod word linkag topolog arguabl complimentari construct manual point page reflect author attempt relat write word topolog consequ word vocabulari choic made page make agent perceptu sensit word topolog featur capabl act link expect find interest relationship manual linkag web author word scalabl discuss previou scalabl major issu limit effect search engin factor contribut problem larg size rapid growth highli dynam natur order index crawler revisit document delet crawler exhaust visit document index complet crawler behavior load document examin period heurist estim frequent document chang accuraci statist highli volatil network load scale number document web time scale time visit document longer stale inform index number queri answer search engin unit amort cost queri scale agent search web scale problem search current environ run stale inform effici search engin amort cost search queri assum user cope longer wait queri search engin answer impact search agent network scale make index free suffici network resourc complet absorb impact search search engin factor inform index correspondingli stale maintain constant amort cost refin result queri search amount network resourc scale ffl ffl imagin visit web page accept ffl achiev impact network load satisfi condit assum number queri pose constant time current growth web assur condit met simpl shift network impact search ffl achiev balanc network load search engin crawler agent context sampl includ document index web search depend heavili share context document author make intend audienc document medium academ typic reader understand intend thing web huge audienc bring share author intend context vagu linguist concern concret manifest global word frequenc statist collect web search engin util index discrimin relev irrelev muddi averag applic distinct word mean situat reli local coher keyword distribut exploit structur proxim agent intern featur describ current document discrimin relev page agent page attribut weight word depend queri satisfi music sport agent situat environ local context analyz word mean situat approach word surround link document provid agent valuabl inform evalu link guid path statist approach action select index construct knowledg queri user pose rank scheme gener good specif queri user person agent adapt user chang time intern user prefer respect word rel import term local person aspect context usag search engin provid person agent captur featur local person context adapt improv search perform search agent idea discuss previou section agent framework goal address limit search engin respect adapt algorithm advantag statist linkag topolog distribut inform environ argu agent person browser approach achiev properti base idea system problem simpler address simpl agent perform simpl oper philosophi drive view agent document document make autonom link adjust strategi local context person prefer user dynam bia search area framework individu agent popul adapt individu learn solut reinforc captur global featur search space user heterogen solut complic intern model model make learn problem difficult adapt evolutionari system prone prematur converg genet evolv solut reflect inappropri due individu agent incap learn life reason motiv hybrid genet algorithm local search reflect gener problem machin learn techniqu environ larg featur space local select long agent live global made agent die order bia search answer question satisfactori algorithm motiv model ecolog organ initi popul energi foreach aliv process sensori input produc motor action updat energi state option learn reinforc reproduc split energi offspr die replenish resourc figur pseudocod evolutionari algorithm base local select ing natur environ provid wai remain agnost question algorithm illustr figur step agent popul initi random search behavior initi reservoir algorithm implement agent call random order avoid spuriou execut parallel step depend sensori motor apparatu agent gener assum action incur work possibl energi intern energi reservoir updat step interact environ result cue reward penalti signal exploit reinforc learn step agent adapt lifetim step central point algorithm differ evolutionari algorithm agent kill select reproduct energi conserv event select threshold constant independ rest popul select local fact reduc commun agent process minimum import consequ agent compet situat portion environ share resourc environ drive competit consequ select pressur process strictli local central made long agent frequent die search directli environ size popul ag distribut determin emerg carri capac environ determin energi replenish resourc occur step replenish independ popul adapt make algorithm amen cover optim good solut repres popul standard converg criteria true respect search bia exploit resourc locat singl resourc multimod optim inform goal locat relev sourc inform algorithm paralleliz lend ideal distribut case agent execut remot server server comput algorithm achiev speedup proport size popul local select disadvantag limit imagin popul agent execut code remot server distribut inform data client machin page access typic situat central page cach commun overhead synchron parallel speedup achiev case hinder scenario feasibl distribut implement evolutionari algorithm base local select requir environ data structur natur agent environ local interact advantag previou experi applic trivial case physic state sensor provid situat agent histori inform object resourc softwar agent provid execut environ capabl access local storag capabl requir solut dynam resourc servic payment transact local select algorithm immedi appli arbitrari problem problem space lend data structur mark environ continu function optim impli discret search space unclear map resourc situat map arbitrari feasibl local data structur difficult isomorph problem resourc model appli successfulli associ resourc partial solut combinatori optim problem requir decomposit properti problem unknown possess problem network inform search pose challeng local select algorithm limit local select weak select pressur energi level agent lifetim depict figur agent reproduc time give half energi offspr final agent run energi di shortli time select event rare energi time figur typic energi dynam agent lifetim higher curv plot level accumul energi function result instantan energi plot lower curv select threshold except reproduct energi level integr lower curv long energi level fluctuat select pressur issu address section intern agent interact sensor pick signal pure inform correl perform agent agent access reinforc signal environ assess appropri signal reward penalti signal adjust agent behavior life basi reinforc learn framework agent perform complex network inform access signal problem signal identifi cue correl perform agent discrimin good bad behavior discuss section inform agent deal problem assum agent learn posit correl perform imagin energi chang comput step algorithm figur instantan energi chang correspond time deriv agent energi plot figur signal continu sign repres perfect cue reinforc learn scheme adjust behavior agent action perceiv lead reward action perceiv lead penalti discourag consist reward time figur warrant lead earlier prevail penalti incur time lead delai death effect intern signal reinforc learn lifetim agent obviat problem weak local select pressur agent pick cue detect time scale evolutionari adapt select base signal integr longer time averag produc agent behavior robust face cue evolut local select intern reinforc learn face process inform environ improv reinforc unit agent signal sampl unit popul signal integr time view local select extens reinforc learn individu reinforc evolut form adapt integr cover tempor spatial scale cue detect search random graph section outlin number experi point feasibl perform local select intern abstract class graph environ problem broadli search larg graph sublinear time imagin larg node payoff popul agent visit graph agent edg goal maxim collect payoff visit time visit fraction node graph framework studi theoret case problem find optim path unknown node weight graph agent heurist search graph problem interest typic graph agent charg cost edg evalu node payoff issu distribut algorithm central problem class graph search task gener reduc interest special case node model hypertext edg payoff measur problem network inform explor search strategi simul inform model relev graph model environ agent posit move reach goal typic task situat robot instanc graph search node assign payoff uniform probabl distribut unit interv link annot real compon idea properli guid agent predict payoff node base featur link point node make agent genotyp neural net vector weight wn agent receiv outgo link node link featur vector algorithm figur neural net comput wn predict payoff node point final agent link pick stochast selector link current probabl distribut fi paramet compon agent genotyp describ import attribut link predict exist construct optim weight vector neural net predict payoff accuraci agent genotyp follow link achiev optim fit payoff energet benefit action payoff newli visit provid visit agent node track environ node yield energi constant energi cost charg node visit smaller cost charg visit prevent endless path visit node reproduct agent genotyp clone mutat obtain offspr genotyp fi weight mutat addit uniform constraint fi studi effect local select isol recombin oper appli random graph gener number distinct accuraci minimum achiev error payoff predict gener equal densiti payoff threshold section carri capac section tabl graph search problem multimod number cluster relev node distinct optim weight irrelev background optim weight vector autocorrel defin condit probabl relev node link node cluster cf relev autocorrel section graph construct experi section averag featur construct accuraci local versu global select graph environ compar local global select binari determinist tournament select chosen global scheme comparison natur step algorithm modifi tournament select energi level randomli chosen member popul place reproduct death algorithm stop node visit figur illustr differ perform typic observ select scheme graph recal level relev node visit plot function time node visit local select popul continu discov constant rate good tournament popul tend converg prematur notic linkag topolog inform fact situat correspond worst perform local select perform slightli random walk random walker expect recal equal fraction node experi repeat wide rang graph shown tabl graph local select significantli consist outperform tournament select improv vari depend graph gener recal fraction node visit ls tournament recal fraction node visit ls tournament recal fraction node visit ls tournament recal fraction node visit ls tournament recal fraction node visit ls tournament recal fraction node visit ls tournament recal fraction node visit ls tournament recal fraction node visit ls tournament figur perform local select tournament select typic random graph valu error bar standard error multipl run algorithm graph paramet ls tournament figur perform select scheme search graph valu ls tournament figur perform graph valu vari densiti good result notic trend condit figur show base case lowest recal level plot record node visit ls tournament figur perform graph valu correl good import agent situat greater consequ determin futur expect local select perform improv figur show case unimod graph intermedi observ perform tournament select yield consist advantag favor local select make problem multimod expect tournament select degrad perform due prematur converg figur illustr trend case high intermedi advantag favor local select predict intern global cue set goal test capabl agent evolv local select algorithm intern global cue signal consid accuraci payoff predict base link potenti accuraci optim evolv agent high optim agent strategi low intern link predict accuraci impli evolv fi valu strategi implement agent stochast selector run ten experi graph averag consist noisi accur fi initi uniform distribut figur correl link predict accuraci evolv fi averag agent popul linear regress shown rang measur node access figur fi valu evolv popul correl accuraci cue posit correl fi coeffici popul successfulli intern cue accuraci agent behavior intern local cue experi graph aim test local cue intern reinforc learn occur lifetim individu agent endow agent capabl adjust neural net algorithm figur algorithm chosen easi implement connectionist framework agent agent neural net natur function approxim agent compar payoff current node predict base featur link visit node perceptron weight adjust delta rule improv accuraci link predictor net instantan energi chang minu reinforc futur valu discount factor learn weight inherit offspr reproduct run experi graph experi disabl fraction node visit ls ls figur effect recal perform figur show improv perform agent base network weight correctli predict payoff intern local featur relev cluster versu irrelev background infospid implement method discuss appli construct popul inform agent infospid system implement test perform person agent web section describ infospid implement discuss detail distribut evolutionari algorithm agent algorithm infospid search inform relev make autonom link follow figur show infospid implement local select algorithm central part system relev feedback user assess relev document visit infospid point relev assess place asynchron respect alter subsequ behavior agent chang energi landscap environ process akin replenish user initi energi foreach aliv agent pick link current document fetch document reinforc signal process option relev feedback user figur pseudocod evolutionari algorithm base local select distribut inform agent environ bia search process overview algorithm high detail subsect user initi list keyword list start form bookmark file step popul initi start document agent document random behavior initi reservoir energi step agent local neighborhood analyz text document situat relev neighbor document point hyperlink current estim base link relev step agent link current document step agent energi updat energi order surviv continu visit document behalf user energi agent reward energi visit document relev function agent evalu relev document document visit assess user assess document visit relev estim mechan implement speed process minim duplic transfer document implement infospid pose cach form commun bottleneck perform distribut agent distribut agent local cach current implement simul perform distribut simpli assum cach set cach size energi agent charg energi cost network load incur transfer document cost function depend transfer latenc document size simplic assum constant cost access constant cost access stationari back pair discourag graph instantan energi step signal agent adapt lifetim adapt process agent modifi behavior base prior learn predict link follow step agent kill select reproduct case offspr recombin type crossov local agent recombin agent resid agent recombin agent popul local crossov distribut infospid minim commun overhead remaind paper offspr provid variat adapt agent evolut step user system relev feedback process option place direct interact agent user assess visit document feedback word document automat assess updat encount word word integ count initi updat time document assess word feedback list maintain global profil word relev user output algorithm flux link rank relev estim modulo relev assess user algorithm stop popul extinct lack relev inform termin user agent architectur figur illustr architectur infospid agent agent interact inform consist actual network collect data local disk relev feedback data cach user interact environ access data local client statu web document suggest make relev assess save local client distribut cach inform environ user agent keyword vector neural net weight link estim selector learn reproduct death document relev estim raw html document html parser word remov stemmer document assess word index weight compact document infospid relev feedback lib file figur architectur infospid access agent subsequ report direct interact user agent infospid prototyp written run unix platform web interfac base librari agent emploi standard inform retriev tool filter word stemmer base porter algorithm agent store effici visit document share cach client machin document repres list link stem keyword cach reach size lru recent replac strategi adapt agent figur highlight central depend infospid system agent describ adapt infospid consist determin behavior agent pass offspr actual mechan genotyp implement search strategi compon agent genotyp consist paramet fi repres agent trust descript page outgo link fi initi fi agent genotyp list initi queri term neural net versatil model adapt standard comput devic figur genotyp vector initi randomli uniform distribut small interv keyword repres agent opinion term discrimin document relev user rest weight repres interact term respect relev neural net input keyword genotyp singl output unit input activ valu network neg possibl neg correl perceiv term relev reason network hyperbol tangent squash input activ valu part system base action select agent perform action select comput relev estim link current document feed agent neural net activ small set keyword sensit input unit neural net receiv weight count frequenc keyword occur vicin link experi report distanc weight function keyword occurr close link question link keyword neural net receiv ith occurr simpl count interven link maximum window size link neural link instanc sum match weight agent neural net figur agent estim link current document link input neural net comput count document word match keyword weight decai distanc link network sum activ unit comput activ jk bia jk incom input lower layer output network activ output process illustr figur repeat link current document agent stochast selector pick link probabl fi fi relev estim feedback link chosen document agent determin energi gain depend document visit document user assess agent receiv energi decai decai factor fl paramet avoid popul due energi relev feedback user provid system relev word feedback list repres profil interest current accur origin queri list estim relev unvisit assess energi tanh frequenc term document normal document weight term base relev feedback extens tf idf document index weight scheme word feedback list initi queri term weight user infospid relev feedback case weight updat ff log fraction cach document ff inertia term weight formula differ tradit tf idf scheme respect aim weight term base describ correl relev emploi algebra term frequenc account neg contribut document term relev comput document frequenc base content cach entir collect hyperbol tangent normal energi rang rang neural net predict agent compar relev current document estim link led connectionist version neural net train predict valu link base local context agent visit document intern gener reinforc signal comput teach max futur discount factor predict link neural net weight updat error learn weight inherit offspr reproduct treatment absenc relev reinforc learn algorithm environ reinforc signal relev feedback alter function modifi environ provid exampl relev infospid integr adapt form relev feedback reproduct offspr clone recombin agent crossov appli keyword subset mate keyword splice offspr keyword vector offspr mutat provid evolutionari algorithm power explor offspr fi fi fi fi fi paramet uniform distribut valu fi clip fi max maintain exploratori behavior neural net mutat ad random fraction weight network connect keyword vector mutat probabl term arg min replac term expect justifi agent perform respect user assess order singl keyword mutat term select probabl distribut ji document birth factor captur local context select word describ document led energi result reproduct factor captur global context set user select word discrimin user prefer learn care adjust neural net weight keyword evolut keyword local mutat crossov implement form select queri base relev feedback local queri adapt time place popul agent embodi heterogen model relev possibl inconsist featur agent small set maintain model remain manag face huge featur search space infospid evalu section report result experi analysi aim evalu perform infospid respond queri search web onlin extend preliminari result tabl infospid paramet descript valu experi report paper paramet descript initi popul size reproduct threshold energi cost document tmax max number page visit queri fi initi fi fi fi mutat rang fi max max fi ae link estim slide window keyword mutat rate layer neural net layer initi neural net weight rang iw neural net weight mutat rate neural net weight mutat rang neural net rate discount factor ff inertia word feedback weight fl decai factor document assess max number word feedback entri jcj tmax max cach size section algorithm paramet mention tabl show valu paramet experi section cost agent visit irrelev document run energi effect cach size consid experi effici cach larg visit cost assess document cach algorithm effect simul behavior distribut infospid search stop popul meet success criterion subsect extinct visit total tmax eb search graph difficulti evalu retriev system stem multipl factor lack rank function document problem address subsect gener difficulti lack queri relev set overcom special chunk web select test environ advantag make readili relev set articl larg number queri hyperlink index hyperlink index figur distribut histogram eb human societi graph subset eb topic roughli tenth collect environ made organ hypertext graph page articl constitut index form connect graph remain node form hierarch topic call figur show statist search graph articl manual classifi hierarchi skill human editor titl node queri access social organ public privat activ allevi human human societi jane foundat peac corp famili welfar disast relief hull index relev set queri figur schemat eb search space actual show titl relev articl relev set depict light grai dark grai remov search space articl classifi categori exhaust knowledg document subject set articl root queri node relev set queri topolog defin agent search make problem navig relev set easi remov search space node relev agent access relev node directli index node illustr schemat figur queri section tabl show statist exampl queri experi queri node depth tree group queri span depth depth minim distanc stare node human societi root relev part search actual shortest path relev articl deeper queri harder infospid gener carri relev set farther start point number tabl queri statist exampl depth queri measur branch privat substant procedur law govern econom transact law commerci transact princip form busi associ state util queri vari depth multipl measur obtain singl queri restart search initi condit seed random number perform evalu quantit analyz behavior infospid algorithm eb corpu infospid access subset document rank collect make imposs standard inform retriev perform analysi method requir rank similar measur control paramet metric lend assess perform retriev system search length defin number irrelev document order list retriev front fraction relev set easili extend method imagin visit document list retriev order visit time rank length refer wait time retriev system mean wait fraction relev set count total number document visit time queri experi discuss search length measur recal level ne relev articl visit compar infospid global search algorithm search annot optim strategi algorithm case web admiss criterion appli suitabl lower bound distanc closest relev node trivial admiss heurist trivial reduc infospid implement search strategi similar bf evolv high valu fi local singl respect global search space assum bf upper bound global search compar perform infospid implement bf mean prioriti queue link estim global sort estim relev point document visit queu order determin prioriti complic due potenti distribut implement sequenti visit document retriev server resid analyz local client machin case cach minim number repeat document request network case bf arbitrarili long unvisit document contribut measur search length expect algorithm implement distribut fashion order make part system requir commun agent share access global differenti cost visit crossov sake comparison disallow includ document visit search length agent request document network load document cach agent execut search length maximum number document visit agent lineag measur experi track number link accumul gener agent start run run experi compar search length achiev bf variant relev feedback relev feedback newli visit document case assess automat gener document visit belong relev set figur show percentag queri successfulli complet algorithm case relev page found tmax limit visit page complet queri infospid run prioriti queue run visit area perform degrad queri depth infospid higher success rate relev feedback afford improv deepest queri due evolutionari reinforc provid relev agent move direct receiv energi boost greater chanc reach relev cluster figur plot search length versu queri depth search length averag complet queri plot infospid search length depth global heurist show depend observ depth rang bf outperform infospid deep queri practic case expect search start desir page search engin seed initi popul infospid realist queri lower queri depth complet queri prioriti queue infospid infospid figur percentag queri successfulli complet bf version infospid queri depth prioriti queue infospid infospid figur perform infospid relev versu bf error bar correspond standard error tabl default initi word feedback list queri organ public privat servic social human activ allevi distribut natur infospid result significantli shorter search time requir bf figur show user relev feedback discoveri relev point agent direct improv statist deep queri due fewer measur micro analysi illustr goal set adapt inform agent achiev close typic agent adapt singl search queri organ public privat activ allevi human remov stop word result keyword vector shown tabl simplifi analysi run simpl perceptron repres agent agent complet vector keyword vector weight keyword bia fi paramet ran search popul visit provid popul relev feedback page adapt context infospid intern word featur spatial local linkag adapt spatial context answer question born time place born time sequenti execut popul collect visit page born time effect contemporari tempor context global inform result relev assess time partial shown tabl tabl part word feedback list weight time tabl star mark term present origin queri note correspond articl word remov correspond ordin number centuri rank foundat red mission social cross hull hou organ servic activ public human privat allevi tabl keyword vector agent organ organ public public servic servic social social human human activ activ hull hull tabl frequent term document agent born word frequenc normal total number word document da db hou hull poor social centuri american tabl origin queri word displac top posit replac term privat allevi low foundat red highest correl relev feedback time bs keyword vector shown tabl evolut lead queri term lost genotyp gener parent lost allevi mutat favor hull privat mutat gener allevi privat replac hull mutat crossov keyword vector demonstr featur correl relev intern agent behavior differ attribut evolutionari adapt spatial local context born document da db word frequenc distribut partli shown tabl repres place frequent term repres place tabl part word feedback list weight time rank servic social organ foundat nation public activ hull privat human allevi american frequent term intern situat agent suit respect spatial context adapt context adapt tempor dimens infospid intern featur captur tempor context answer question born place tabl time born time tempor context global inform result relev assess time partial shown tabl bs tempor context tabl make observ tabl relev document origin queri term gain top posit rel posit privat surpass human word lost presenc bs cs birth page db hull maintain strong term made american repres db present word feedback list time tabl keyword vector agent tabl organ organ public public privat servic servic social social human american activ activ hull hull tabl show differ agent differ reflect time agent born correl relev true born intern term consist chang tempor context time cs birth american small posit global presenc term db pick imposs due term absenc earlier word feedback list evolv intern agent adapt respect tempor chang time user relev agent effect achiev person learn experi question infospid intern local context smaller spatial scale shorter time agent initi popul live end run success born time search path life experi tabl show weight vector ds es neural net end run weight adapt agent estim document relev link clear strategi learn paid special attent public es predict presenc public demonstr local context experienc live diverg respect word reinforc agent intern neural net perceiv correl featur relev tabl learn neural net weight agent organ public privat servic social human activ allevi bia relat work distinct machin learn inform retriev issu blur reflect approach section discuss main connect contribut area categor issu complet discuss mean complet machin learn contribut evolutionari algorithm local select gener adapt paradigm distribut agent shown approach suitabl domain combinatori optim local select proven success multimod optim problem requir heterogen cover search space converg perceiv global optimum evolutionari algorithm commun behavior refer nich select notabl select variat explicitli aim nich crowd fit share method select alter account measur similar lead popul select time complex individu popul size requir maintain cover nich grow rapidli number nich local select natur enforc mainten popul implicitli nich commun overhead afford effici central distribut task local select reinforc learn agent intern featur fashion infospid integr adapt learn seamless global optim advantag signal spatial tempor scale plenti data noisi inconsist compar manual construct relev adapt algorithm advantag cheap realist actual search environ connectionist model infospid learn estim link relev reminisc neural network learn probabl distribut text retriev logist regress relev assess user activ learn advantag shown improv perform retriev system system integr adapt driven relev feedback model local select relev feedback interact asynchron agent relev feedback selfish process user standpoint agent modifi reward improv model relev perform distribut text collect typic massiv data set challeng machin learn techniqu due huge featur space infospid deal reduct situat agent intern word maxim correl object local context model featur select size learn problem manag individu popul larger set heterogen featur inform retriev contribut learn appli extens inform automat classif cluster differ infospid approach adapt driven local singl agent intend learn global optim document link relev estim strategi heterogen network inform retriev task view averag asset improv perform local level local adapt system relev feedback mainstream text retriev closest learn estim word probabl distribut main differ infospid cue provid user assess conjunct local agent wast limit resourc pai attent word current search user word lot featur select inform retriev queri case word featur intern agent adapt mutat user constitut highli dynam heterogen queri necessarili forev infospid select perform queri respect local context popul deal scalabl agent collect select agent learn task harder idea incorpor infospid framework step address challeng pose text classif machin extend inform retriev deal document user heterogen collect web search make classif problem simpler class irrelev respect current relev class heterogen user class membership chang time user shift interest aspect asset construct retriev system relat work idea decentr process divid task local perform set central perform set suggest earli dai web harvest project linkag topolog consid context motiv link enhanc relev judgment incorpor queri formul improv search fish search search system time infospid inspir idea artifici life fish search base popul search agent web driven intern gener energi measur base relev estim popul central cach effici algorithm extend distribut agent intern local context due mixtur depth breadth cutoff level difficulti fish search approach determin cutoff level possibl result search behavior webwatch agent learn mimic user shoulder perform search user suggest link follow letizia autonom interfac agent assist user web make suggest page interest user agent learn predict object function track user prefer unlik webwatch letizia singl importantli user order autonom search fab amalthaea adapt filter system inspir genet artifici market model term weight relev feedback adapt match set discoveri agent search engin set user profil system learn divid problem simpler deal heterogen dynam profil queri system perform activ autonom improv scale limit index exploit mechan infospid decid stop run energi admittedli crude approach solid fact suggest agent approxim optim stop criterion idea weigh diminish return continu accumul visit futur option evalu market summari result suggest inform agent complement current index technolog start search engin stop engin provid global start base statist featur search space agent topolog featur guid subsequ search shown approach extend current state art deal problem local evalu infospid collect perform encourag support popul locat relev document larg distribut corpora faster advantag distribut model implement shown infospid outperform exhaust search domain order perform receiv boost synergi individu learn relev feedback micro analysi enabl determin singl agent fact intern import local featur environ intern collect ecolog captur heterogen snapshot featur correl user relev agent strategi evolv time chang agent agent agent depend tempor spatial context part environ experienc futur direct earli experi interest behavior agent carefulli control structur corpu full expect agent interact real web remain demonstr shown diverg featur agent success topic area encyclopedia real evolutionari method adapt wider variat found web media expect role type sensit wide vari user effect search dispar corpora extens evalu approach actual web verifi goal make problem evalu open environ high prioriti aspect model explor greater detail futur effect cach cach size perform consid sequenti infospid role distribut cach studi distribut implement weight scheme suggest idf local relev estim mechan inappropri global featur term weight mutat process modifi queri absenc relev base sole correl easili achiev replac factor ji ji probabl distribut keyword mutat section form direct agent interact consid crossov agent reproduct recombin intern nearbi situat server intern experi relev proxim model interact agent worth explor domain agent learn agent agent commun languag exampl activ research area opposit argu distribut agent suit perform task distribut environ point view agent interact minimum call studi interact implicit current central repositori resourc relev feedback begun explor issu distribut agent mobil agent execut server machin inform current agent code agent intellig select inform back user inform provid opinion interest trade cpu cycl improv network bandwidth secur languag protocol trust autonom agent agent research provid system technolog thrust make mobil agent feasibl integr search search engin put test hybrid system construct search engin provid agent good stare base statist topolog search space crucial shown section perform distribut search degrad distanc start point relev cluster person agent continu search adapt user current context popul autonom agent search engin understand mutual benefit approach potenti synergi ensu acknowledg author grate make cd collect experi data part infospid code free softwar massachusett institut matthia dan sourc make softwar gnu gener public infospid project origin collabor wolfram mong wrote graphic interfac earli demo david lewi provid annot bibliographi machin learn inform retriev member cognit comput scienc research group cse depart ucsd discuss suggest note similar argument appli web inform retriev system base search engin queri make conserv assumpt obtain lower bound ad linkag topolog conjectur cluster hypothesi hypertext deriv definit associ retriev set view relev set queri alta time write estim conserv growth rate doubl condit met year list typic obtain consult search engin altern distribut implement crossov agent situat server gener statist account remov relev node length prioriti queue set equal initi size infospid scenario infospid imagin agent carri small local cach refer mitchel learn world wide web aaai spring symposium inform gather distribut ao ga mihaila applic web queri languag proc intern world wide web balabanov adapt web page recommend servic proc intern confer autonom rk belew editor adapt individu evolv model algorithm santa fe institut studi scienc complex addison cm pb mf schwartz scalabl internet resourc research problem approach commun kleinberg automat resourc compil analyz hyperlink structur text proc intern world wide web ws cooper expect search singl measur retriev effect base weak order action retriev system journal american societi inform de bra post inform retriev world wide make search feasibl proc intern world wide web ka de jong analysi behavior class genet adapt system phd ka de jong decentr select algorithm proc intern confer genet digit equip corpor fox lexic analysi stop list inform data structur algorithm wb frake stem algorithm inform data structur algorithm de goldberg richardson genet algorithm share multimod function optim proc intern confer genet harik find multimod solut restrict tournament select proc intern confer genet harman relev feedback queri modif techniqu inform data structur algorithm hart rk belew optim genet algorithm hybrid local search adapt individu evolv model algorithm addison yannakaki search fix graph proc intern colloquium languag page rr larson bibliometr world wide exploratori analysi intellectu structur cyberspac proc annual asi dd lewi activ relev feedback inform retriev aaai fall symposium activ dd lewi inform retriev statist larg data set proc nrc massiv data set dd lewi challeng machin learn text classif proc annual confer comput learn lieberman autonom interfac agent proc acm confer comput human lin reactiv agent base reinforc teach machin rm ba huberman surf real option proc comput econom lyco sw popul size share method foundat genet algorithm sw comparison parallel sequenti nich method proc intern confer genet menczer adapt retriev agent heurist neighborhood inform discoveri proc intern confer machin menczer rk belew complex environ complex behavior adapt menczer rk belew latent energi environ adapt individu evolv model algorithm addison menczer rk belew adapt inform agent distribut textual environ proc intern confer autonom menczer rk belew local select proc annual confer evolutionari san rk belew endogen fit paradigm adapt inform agent cikm workshop intellig inform mitchel machin chapter mouka evolv inform filter solut amalthaea proc intern confer autonom pack ml aw moor reinforc survei journal artifici intellig shneiderman navig design toolbox commun se robertson spark jone relev weight search term journal american societi inform page de ge rj william learn intern error propag de rumelhart jl parallel distribut explor microstructur volum bradford book kotz transport inform agent proc intern confer autonom salton bucklei improv retriev perform relev feedback journal american societi inform salton mj mcgill introduct modern inform retriev sparck jone statist interpret term specif applic retriev journal sparck jone experi relev weight search term inform process spertu mine structur inform web proc intern world wide web person commun steier statist semant phrase hierarch context phd comput scienc engin san steier rk belew export statist analysi topic languag casei symposium document analysi inform sutton reinforc learn inform access aaai spring symposium machin learn inform cj van rijsbergen inform retriev edit refer librari version dk hierarch network search engin exploit hypertext cluster proc seventh acm confer
Agents/1549 1 behavior interfac simul interact real time abstract paper show approach model control interact object simul virtual human agent real time interact essenti gener conceptu made model object behavior inform complet plan interact virtual human behavior simpl primit actual trend standard scene graph file format connect languag movement event creat interact anim special attent correctli interpret object behavior situat arriv human agent interact time object virtual virtual object object script deform introduct necess interact object virtual environ applic comput anim simul field offer interact due popular standard graphic file format user easili control behavior object evolut virtual realiti model languag graphic file format version version option write script command rout user event scene action complex situat applic control interact object virtual human agent refer exampl applic autonom agent virtual human factor daniel thalmann epfl comput graphic lab lausann switzerland virtual design good overview area present badler applic train equip usag virtual human present johnson al model interact object smart object concept previou work adject smart refer comput understand human action object call smart abil describ interact kei idea smart object concept object detail descript perform interact plan script command command describ object behavior access import paramet defin model phase mean friendli graphic user interfac applic special locat agent put hand paramet model tool save object descript simul paramet retriev order feed motion gener anim agent provid simul program difficult plan reason task real time requir present nowadai interest minim oper simul give locat usual graspabl site kinemat algorithm directli move agent arm correct direct adopt solut data gain greater user control real time end loss individu interact deform algorithm gener data displai shape real time exampl morph algorithm smooth shape deform includ object agent action trigger object shape chang system literatur similar idea object specif reason creat relat tabl inform object specif data object graspabl site inform grasp task interest model object complex interact agent time good object smart lift deal simultan agent crowd simul insid virtual citi environ lift shown previou work object automat door escal figur smart lift inform control agent enter floor floor connect script languag object movement state program complex object function script languag control human agent versatil shown improv system import maintain intuit script command order design achiev design dedic script languag describ set behavior type defin object level detail inform behavior chang current displai resolut behavior chang speed move control agent make perform interact object modul control lead virtual environ knowledg object work scene autonom agent learn retriev inform insid object previou work show detail smart object gave exampl object behavior discuss applic base smart object present import solut adopt current behavior show describ interact maintain simplic present concurr program techniqu synchron agent interpret object behavior time show integr behavior option permit creat class bird object chang shape deform data comp real time requir remind paper organ section overview model smart object section describ solut adopt current script languag defin object exampl section depict approach concurr interpret behavior script control agent time section present class shape deform algorithm consid section conclud present futur work model smart object follow featur model approach vast topic engin field basic idea identifi model interest featur object scope applic defin class object movement descript semant kei text descript object interact posit interact part hand shape object depend object state automat door behavior close agent pass door open expect agent object behavior situat agent locat reach object properti interact inform model graphic user interfac figur show model section slot machin usual locat closer grasp handl figur show desk identifi figur model session smart interact user interfac defin move part specif inform control agent kei posit hand locat import interact model inform object describ data synchron object movement agent movement account possibl agent interact object order dedic script common trend commerci product section show languag design defin object behavior order object behav simul script languag consist keyword group behavior definit keyword trigger movement give instruct chang state variabl call approach shown easi straightforward describ object common object complex lift figur observ simplic longer present overcom classifi behavior definit templat behavior complex challeng achiev set keyword find import format gener directli user interfac essenti design program behavior object geometri principl mind provid high level behavior fact current applic simul virtual citi demand complex behavior user rare graspabl complex automat machin bui train ticket machin main behavior make agent walk close make put monei press sequenc button ticket list show behavior definit model smart tabl parti simul tabl graspabl fruit main agent nearest fruit grasp eat behavior put back tabl fruit eaten figur show scene simul tabl figur smart tabl parti simul social behavior simul group agent parti easili integr option agent fruit tabl list show behavior tabl code observ simpl script describ complex interact script carefulli design correctli interpret agent time simul explain deal kind parallel execut section behavior subroutin lefthand lefthand end behavior end behavior end list behavior definit smart tabl import point observ script kind list complic design creat minim difficulti introduc kind behavior templat idea collect common behavior definit includ connect object simpl dialog box illustr featur show exampl simpl button behavior definit press behavior definit object chang speed move part list show templat defin button behavior model design interact model shape desir hand gestur press specifi locat reach hand select templat open dialog box correctli merg behavior insid list model behavior button user enter paramet keyword list make behavior depend variabl state state control import agent intend press button behavior unavail avoid agent press button press kind consist control tricki program usag templat facilit design process section explain usag state variabl synchron control agent templat button press state variabl hand gestur hand hand button movement behavior true hand end behavior end templat list behavior templat button list show templat model bird fish behavior move part continu simul fly swim templat command movement open command movement close behavior end behavior behavior end behavior end templat list behavior templat definit bird fish behavior shown list made model bird move wing design model geometri bird bodi rotat movement open close wing rotat movement open wing receiv common execut parallel trigger rotat close wing templat design model rotat behavior definit correctli merg object design defin similar fish design defin rotat movement link fin behavior correctli merg figur show flock bird real time simul applic control veloc move wing posit orient bird figur show model phase fish insert type simul behavior interfac bird figur upper figur show simul bird wing movement control behavior lower figur show model phase fish behavior control concurr interpret object behavior agent interact singl object correctli synchron interpret behavior script deal problem simultan access resourc difficulti studi area concurr parallel program behavior parti tabl time simul program send agent perform process creat interpret behavior trigger agent object command share figur illustr process creation behavior agent smart object behavior behavior agent behavior agent figur agent start perform interact process creat interpret behavior script synchron check state variabl global process talk simul concurr interpret script execut program call perform function process infinit main loop applic solut describ correctli time perform function interpret script process advanc script interpret special care interpret script problem execut line script time step simul time agent interpret command command search closer current posit time process control agent execut command find nearest posit collid arriv posit result happen grasp fruit avoid special keyword process stop interpret script leav process work place keyword forc process agent execut leav control agent process interpret find process invalid posit chang simpler solut adopt keyword script fix properti stop execut process jump directli command script keyword trigger long action process send relat action agent object leav control process action complet long action action arm object movement keyword call compar execut lock main loop long action found script finish criterion shown solv conflict current object synchron reli share global variabl state process synchron shown button list global variabl avoid agent press button press agent solut find exampl avoid deadlock situat difficult solv situat simul simultan access resourc call dine philosoph deal complic exampl lift shown figur interact main kinemat control walk motor script command trigger motion motor correct manag motion control techniqu appli agent environ main task smart object control modul synchron object movement action paramet initi motion model phase object command behavior script activ main kinemat action make hand move locat activ complementari make agent reach goal interpol current hand shape agent behavior select behavior end smart object behavior end agent agent action walk reach figur behavior script command convert action coher manag blend facial anim express control modul behavior chang shape order enhanc possibl smart shape deform capabl incorpor idea behavior interfac trigger deform effect object shape heavi deform calcul simul interest specif skin deform modul fish obtain smooth bodi motion simul target applic deal complex scene import real time frame rate interest deform algorithm run offlin gener data file describ result deform huge literatur algorithm calcul smooth level detail multi progress mesh present deform algorithm case polyhedr morph morph algorithm divid solv correspond interpol problem correspond interpol evalu real time figur show morph result obtain previou work output algorithm set trajectori pass model vertic obtain morph make vertex move trajectori gradual global give shape transform effect figur morph transform obtain move vertic gradual global scale deform algorithm easili integr model muscl deform system muscl deform calcul size muscl main axi intermedi gener trajectori pass vertic linear trajectori maxim minim axi length exampl illustr possibl shape deform low comput cost perform basic interpol techniqu updat posit model vertic figur deform muscl shape move vertic trajectori deform relat length muscl main axi connect deform simpl command call behavior definit desir paramet trigger shape chang easi connect shape agent movement action object shape agent touch object resolut base distanc camera approach limit shape deform soft surfac forc appli region surfac back agent touch region work deform similar keyfram anim evolut surfac vertic futur work show articl smart object approach model interact object real time simul essenti idea smart object seri preprogram behavior control complex move shape detail control agent time interact discuss approach complet plan desir interact easi usag obtain mean graphic interfac program model object interact program object behavior behavior adopt approach select design defin script part model approach autonom aspect agent basic sequenc level autonomi explor level directli interpret sequenc analyz decid extern plan reason algorithm action aid synthet vision level autonom capac decid interact select leav action plan experi show simul environ grow number simul paramet control prefer concentr leav low level interact inform smart object situat commonli occur virtual citi simul applic futur investig main perform simul autonom agent percept modul identifi object interact order achiev high level goal extend smart object concept interact real human vr data glove user place hand place virtual object trigger script behavior acknowledg author grate dr provid data deform muscl simul involv crowd smart fish model design research support swiss nation foundat scientif research brazilian nation council scientif technolog develop refer principl isbn publish human ieee workshop articul puerto june prioriti formul kinemat control highli redund articul ieee victoria featur interfac geometr ed martin inform cap global human walk model real time kinemat visual thalmann humanoid environ interact anim multipl deform human eurograph august septemb motion control techniqu virtual human avatar step virtual human manag urban environ workshop intellig virtual architectur agent search manipul technic report anim pedagog agent procedur train virtual sigart acm vol number polyhedr model field direct defin journal brazilian comput societi issn vol num april special issu comput graphic imag object interact eurograph workshop anim portug carlson transform polyhedr plan act phd dept comput inform model human crowd group detect eurograph workshop comput anim time muscl deform ieee comput societi digit actor base synthet comput volum number understand human intern forum frontier telecom japan system script interact actor virtual architectur guid crowd base behaviour autonom vrml web
DB/1550 3 execut strategi transact process lan huang comput scienc depart state york stoni brook stoni ny abstract perform transact process system complet critic depend amount physic disk requir paper describ transact process system call aim reduc concurr control overhead minim perform disk lock content delai exist transact process transact block lock content forc wait transact hold contend lock perform physic disk substanti portion lock content delai attribut disk perform transact charm implement transact execut make data page transact lock page charm support optimist version strategi elimin unnecessari manc overhead charm successfulli implement berkelei db packag complet transpar exist applic modif applic requir perform measur fulli oper charm prototyp base workload demonstr charm convent transact process system tion time transact throughput rate empir measur result oper system research introduct transact process system interest grow publicli report electron trade system stock brokerag perceiv time transact consist cpu process disk wait time due lock content transact process system bank stock trade cpu time typic disk time underli fulli read disk complet elimin log data persist requir write disk manag system transact cess equip larg amount physic memori reduc number disk necessarili luxuri entir lock content delai depend amount disk exist transact system transact hold lock perform disk lengthen wait time transact block held lock extens research concurr control area improv put transact process paper present implement ation transact execut strategi orthogon complementari exist concurr control algorithm order execut oper individu transact execut strategi paper greatli reduc averag time individu transact improv throughput transact process system author strategi concurr control goal reduc number lock reduc content delai lock conflict goal reduc lock content delai transact process system level experienc transact process system run transact fetch stage oper stage fetch bring data page requir transact pin main memori lock acquir stage oper execut transact tradit transact process wait data page requir transact oper content transact run stage ident case transact run resid lock content turn transact process system transact process system decoupl disk lock fetch transact perform disk vice versa oper stage invari hold true ideal decoupl transact process lock content delai transact experi includ disk time transact due practic implement issu data share invari hold abil reduc lock content incur addit perform overhead develop optim techniqu effect reduc extra perform cost implement charm prototyp base berkelei db version includ perform carri detail perform studi prototyp standard transact process rest paper organ section review previou relat research effort reduct concurr control cost section describ detail optim variant section present result analysi detail perform studi charm prototyp section conclud paper summari main result research outlin work relat work idea origin analyz exploit concept access invari perform specul disk compar combin optimist concurr control lock studi work includ optimist hybrid scheme discuss paper charm implement tion process softwar paper report empir perform measur concurr control algorithm newer concurr control algorithm exploit semant transact object abstract data type lock earli complet approach remov disk time lock content delai superfici similar optimist concurr control algorithm optimist adopt rollback mechan undo effect write specul assumpt hold underli condit algorithm optimist concurr control assum lock content proce data access acquir lock requir roll back transact lock conflict detect end transact assum disk undo intermedi write detect transact perform physic disk optimist concurr control attempt reduc lock aim reduc portion lock content delai attribut disk idea decoupl architectur comput architectur literatur partial motiv strategi origin bridg speed gap cpu execut memori extend address perform differ memori disk main idea static split program comput part data access run data access part ahead comput part data requir comput part brought cach memori time disk wait wait figur scenario transact block due lock content experi delai physic disk perform transact fetch stage essenti perfect prefetch mechan perform advantag disk data li data access reduct lock content delai transact contend lock held recent chang develop automat binari modif tool modifi exist binari perform specul execut order gener prefetch hint file system prefetch research goal cut number physic disk decoupl disk lock acquisit size applic access pattern effect file prefetch method transact encount disk hold lock transact execut basic algorithm fundament observ motiv transact execut strategi averag lock content delai main memori system smaller resid system absenc disk figur transact block read access transact transact block read access transact transact experi delai disk perform transact delai physic disk part time multipl transact ultim goal ensur disk access delai contribut time initi disk tabl show averag percentag lock content delai due disk perform measur berkelei db packag run workload paramet set tabl meant illustr extent potenti perform improv disk complet decoupl lock content lock content delai elimin number concurr transact number concurr transact percentag delai due true data content start domin concurr percentag lock content transact delai due disk tabl averag percentag lock content delai transact experi due disk perform content versu number concurr transact measur collect berkelei db packag run workload paramet set basic idea split execut transact stage fetch perform disk bring data page transact main memori pin execut transact updat implement fetch stage local copi updat commit end transact skip updat oper bring page main memori oper transact execut convent transact process architectur fetch stage bring memori requir data transact oper stage access disk long access invari hold case access invari properti transact perform disk oper stage execut transact fetch stage special aspect transact execut stage lock item access transact hold lock imposs transact fetch stage wait lock held transact construct transact oper stage access page brought memori fetch stage transact block lock wait delai disk perform transact hold lock lock content delai cpu execut queu time smaller convent transact process architectur transact acquir lock access modifi data fetch transact perform read disk fetch includ data page written comput address gener data page skip write oper result execut transact ident convent transact process architectur separ disk lock acquisit mutual elimin possibl long lock content delai due disk incur addit perform overhead fact execut transact mean redund work compar convent transact process system transact cpu time redund work overshadow perform gain cpu process time typic small compar disk delai applic requir high transact throughput stock trade applic acquir data page chosen brought memori fetch stage oper stage reason fetch oper page transact chang read disk perform fetch stage useless redund disk correspond deliveri transact fulfil oldest order start previou deliveri transact finish prefetch data record current previou deliveri transact complet lead transact perform read disk oper stage retriev page fetch stage brought invari transact wait transact perform physic disk hold transact except execut access page typic memori resid lock hold period short access data structur current charm access intermedi leaf node lock acquisit fetch stage separ treatment intermedi leaf node prevent outdat potenti dangl reduc probabl minor perform cost optimist reduc redund cpu comput develop optimist version algorithm transact perform physic disk fetch stage attempt achiev fetch make data page oper stage main redund case run transact start transact oper stage data page access hit transact complet successfulli stage transact access fetch stage instanc subsequ proce oper stage standard transit oper fetch stage involv step effect write data access lock acquir oper stage data page transact touch pin prepar subsequ oper stage compar elimin fetch stage altogeth data page requir transact incur addit overhead due transit oper fetch stage transact perform physic disk major compon overhead attribut undo earlier write show perform gain result elimin unnecessari fetch stage typic overhead roll back buffer hit ratio physic disk requir hybrid overhead exist reduc develop variant call hybrid classifi transact transact encount transact complet stage transact complet stage run type transact tradit transact process start oper stage convert fetch stage physic disk run type transact directli fetch gener run type transact oper stage convert fetch stage physic disk uniqu featur requir priori knowledg data access behavior transact execut convent transact process model made dynam execut transact type collect accumul statist instanc call percentag data access lead physic disk oper call percentag execut instanc transact type requir stage complet transact ratio futur instanc execut convent transact transact ratio futur instanc continu execut futur instanc transact type execut prototyp implement implement prototyp berkelei db version evolv transact process softwar librari highli visibl compani amazon yahoo berkelei db support lock error recoveri log berkelei db support asynchron log mechan bypass disk due log long system log buffer buffer full log disk log buffer full fundament differ tradit transact process system li fetch stage prototyp execut input transact skip lock acquisit request updat fetch stage pin buffer page brought memori stage transact execut process berkelei db implement modifi berkelei db start transact oper pin data page access transact encount buffer miss system convert transact oper fetch stage lock acquir transact effect write state roll back begin transact transact miss buffer time fetch stage charm requir modif program interfac berkelei db applic oper detail complet hidden interfac transpar applic built berkelei interfac execut transact oper transact idempot execut stage result persist side effect perform evalu experi setup evalu perform ran prototyp machin mbyte physic memori run linux compar manc measur berkelei correspond tradit transact process system input standard transact process mark modif kei valu queri chang uniformli random distribut distribut form access remain meant access local result workload bound sensit lock content delai bia essenti model transact process definit bound appli access custom item tabl tabl small size time perform result present constru quantit data understand perform number benchmark paramet set total size grow test run record insert buffer size studi mbyte data point averag result ten consist transact run ran number transact warm buffer number transact transact execut separ user number concurr transact remain fix run transact report measur perform user level kernel level run assum lock set log buffer size mbyte turn asynchron log elimin disk transact commit test test run singl comput report perform measur includ network access standard compar berkelei vari number concurr number transact buffer hit number disk maximum number concurr transact experi limit prevent workload bound comparison perform metric sum time individu transact ratio total number transact succe time requir complet run test transact note transact run abort resolv deadlock berkelei db packag serv baselin case correspond standard lock implement figur show time throughput comparison berkelei db number concurr transact execut simultan number physic disk number transact buffer hit ratio berkelei db time concurr throughput concurr berkelei db case number concurr transact lock content delai reduc place perform differ berkelei db initi number concurr transact concurr reach lock content delai domin transact time reduct lock content delai afford plai increasingli import role lock content delai concurr disk subsystem begin disk time gradual domin transact time perform differ berkelei db start number concurr transact reduct lock content delai respect time throughput ¥ ¥ ¢ berkelei db number concurr process ¢ number concurr process £ £ ¤ berkelei db figur time throughput comparison berkelei db number concurr transact execut simultan number disk number transact number measur transact run ¤ lock content delai ¥ ¢ berkelei db number concurr process figur averag lock content delai transact comparison berkelei db vari number concurr transact transact time minor benefit reduc lock content delai number deadlock complet transact successfulli period time berkelei contribut perform factor throughput differ berkelei db understand berkelei examin compon disk lock content averag comput time transact slightli longer berkelei db execut figur show comparison berkelei db averag disk lock content time transact significantli reduc lock content factor compar berkelei db experi notic lock content fetch stage lead physic disk oper turn lengthen lock content time transact concurr probabl grow higher data content larger number concurr differ lock content delai berkelei db £ ¤ disk time ¥ berkelei db ¢ number concurr process figur averag disk time comparison transact berkelei db vari number concurr transact £ ¤ fare berkelei db averag disk time concurr transact execut simultan transact perform disk disk cluster experi longer disk queu delai berkelei db disk spread transact interlock lock content strategi present interest design lock content delai disk time easier invest hardwar address problem longer disk queu delai ad lower lock content delai repres effect approach build scalabl transact process system advantag hardwar resourc sensit paramet demonstr disk queu delai longer disk vari number disk disk time throughput result shown figur multipl disk stripe tabl disk simpli chose disk tabl disk concurr perform differ berkelei db quickli escal number disk number disk perform gap berkelei db start disk reduc disk time indirectli lock content berkelei db perform edg berkelei db pronounc amount physic disk figur show perform differ berkelei db number transact warm buffer fore test run number transact buffer hit ratio workload workload disk time domin transact reduct lock content delai enabl plai role rel term workload physic disk achiev reduct lock content delai small technic imposs applic requir high transact process order transact run oper point econom elimin disk memori hold entir oper point transact process system achiev transact understand perform impact softwar hardwar perform berkelei db paramet set correspond initi size mbyte transact grow gbyte figur show time time throughput £ £ number disk number disk ¢ ¢ berkelei db berkelei db figur time throughput comparison berkelei db number disk subsystem number concurr transact number transact total time £ buffer hit ratio buffer hit ratio ¢ ¢ berkelei db berkelei db figur time throughput comparison berkelei db ferent hit result appli number transact number insid parenthesi number transact number concurr transact case number disk throughput comparison berkelei db vari number concurr transact shown figur perform advantag berkelei total time occur concurr perform advantag berkelei db real reason buffer hit amount physic disk requir run averag buffer hit ratio compar case shown fix buffer hit perform advantag berkelei db remain size underli detail analysi potenti perform problem variant transact oper stage perform physic disk prolong lock content delai tabl show averag percentag transact run perform physic disk oper stage case probabl lock turn grow number concurr transact size underli versu probabl true data content fix number concurr transact probabl absolut percentag transact low case case result demonstr perform cost due explain berkelei db concurr percentag transact tabl percentag transact perform physic disk oper stage vari number concurr transact entri case case number disk number transact number measur transact run compar berkelei incur addit process overhead execut transact correct problem avoid addit process overhead data page transact resid memori evalu time ¥ throughput ¥ ¢ berkelei db number concurr process ¢ number concurr process £ £ ¤ berkelei db figur total time transact process throughput comparison berkelei db number concurr transact execut simultan paramet number disk number transact number measur transact run ¤ impact cpu time perform comparison berkelei ad idl loop measur total time complet run figur show perform comparison berkelei db buffer hit ratio vari idl loop idl loop transact cpu time small msec addit process overhead perform berkelei db optimist optim compar transact cpu time high msec perform differ berkelei db addit process overhead portion perform gain lock content delai reduct berkelei db buffer hit ratio highest effect address defici perform berkelei db case result demonstr robust compar transact type undo time time memori usag kbyte payment kbyte kbyte kbyte deliveri kbyte tabl averag undo execut physic memori requir transact instanc type transact benchmark number disk transact concurr number transact perform undo oper convert case perform gain elimin unnecessari fetch stage tabl compar averag undo overhead tion time type transact undo cost smaller addit cost execut transact worst case deliveri undo overhead transact cpu time cpu time transact low compar practic undo overhead expect smaller compar transact execut time data brought main memori fetch stage pin buffer page ensur remain oper stage tabl includ averag physic memori usag transact type show maximum physic memori requir system run transact simultan modest machin addit memori pressur introduc practic total time total time ¢ buffer hit transact idl loop berkelei db buffer hit transact idl loop berkelei db figur comparison berkelei db transact comput time buffer hit result appli number transact notat correspond buffer hit ratio percentag transact number disk transact concurr paper present evalu transact execut engin call charm attempt reduc lock content delai due disk minimum basic idea separ disk lock transact compet lock requir page memori execut lock content delai time individu transact significantli reduc total time number transact improv demonstr perform advantag standard lock provid comparison modifi benchmark perform aspect transact process system research ignor overhead transact commit standard industri practic reduc commit cost group batch size chosen typic smaller work work log scheme minim perform impact due disk result transact plan integr log solv perform problem read write transact process system interest extens execut transact oper stage ly idea transact stage run data run transact context hurt improv system unnecessari context switch synchron overhead oper stage requir physic disk case physic disk sequenti execut transact lead undesir plan studi detail perform tradeoff special instanc implement hope elimin perform problem presenc complic transact process workload refer berkelei db modular transact winter usenix san usa jan perform assert concurr control intern confer data usa feb transact ieee action versu optimist concurr control abstract data acm transact march optimist method concurr acm action june simul studi decoupl architectur ieee transact aug system extens disk comput scienc suni stoni januari adapt object prefetch polici orient intern confer data uk april parallel prefetch perform evalu acm lock concurr oper acm action dec pa al control high content acm action june pa al invari high content sixth intern confer data lo usa feb transact pipelin intern workshop high perform transact pacif sep hint gener specul symposium oper system design usa feb
DB/1551 3 million sensor mobil devic integr commun capabl network devic wide deploi monitor applic user queri larg collect devic ad hoc manner exist system reli central system collect devic data system lack flexibl data extract predefin scale larg number devic larg volum raw data transfer concept devic distribut queri execut techniqu appli leverag comput capabl reduc commun defin abstract repres devic network describ distribut queri process techniqu appli context queri physic world philipp johann praveen cornel widespread mobil devic transform physic world comput platform find comput commun capabl temperatur sensor motion door light cellular kei ring emerg network techniqu ensur devic interconnect access network comput user interact portion physic world larg class user monitor phenomena environ exampl monitor applic includ gather inform disast item factori control vehicl traffic larg citi concret exist flood detect system twenti year alert system deploi state typic alert instal consist type sensor rainfal water level weather predefin set data regularli extract transfer central site store system user queri system graphic user interfac queri user rainfal displai averag level rainfal displai current level rainfal sensor displai locat sensor level rainfal greater queri process devic network flood detect system monitor declar user submit queri devic network physic structur organ monitor user typic kind histor typic aggreg queri histor data obtain devic rainfal displai averag level rainfal praveen leav microsoft ieee snapshot queri concern devic network point current rainfal level sensor queri concern devic network time retriev rainfal level sensor exist alert system implement wareh data extract devic predefin store central system queri process wareh approach suit aggreg queri histor major wareh approach dissoci access devic queri workload emerg fire depart requir specif data access group site order decid action displai rainfal level obtain sensor queri answer tradit system data extract sensor infrequ solut continu extract data devic transfer server solut feasibl practic extract data sensor camera measur direct measur data direct transmit continu flow raw data devic network wareh approach valuabl resourc transfer larg amount raw data devic server excess resourc consum devic network transmit larg volum data gener extract data devic network answer queri group sensor send data back server reduc sensor locat counti modern devic includ process capabl process data local reduc data transfer energi consumpt altern wareh approach distribut approach queri workload determin data extract remot possibl portion ieee person commun octob queri execut devic approach system control resourc primarili target snapshot queri aggreg queri histor data evalu materi data store devic central server call system enabl distribut queri process devic network devic system studi system devic project cornel dataspac project rutger recogn advantag distribut approach wareh approach queri devic network devic encapsul data control network primit develop relev devic contact queri evalu devic system explain concept devic area fruit direct research describ abstract repres devic illustr queri formul sql minim addit languag show distribut queri process techniqu appli context devic system analyt model illustr benefit approach point method articl repres gener system core compon system implement fulli function demonstr system intel comput continuum confer note articl address specif research challeng lie queri process strategi leverag comput capabl queri process strategi adapt chang condit decentr administr overview issu conclud devic system call physic object comput commun capabl devic devic emb comput commun capabl win sensor node smart dust cell physic object connect extern comput door actuat connect desktop devic interconnect access network devic devic connect intermitt articl concentr stationari devic abstract repres devic wareh discuss devic part access predefin extract procedur popul relat central system goal devic system access devic directli process queri repres devic system refin definit devic devic support set function process portion queri directli server devic realist major vendor server repres process capabl expect devic futur devic function store process data trigger action physic world kind function return result statu report error distinguish synchron asynchron function synchron function return result monitor continu function return rainfal level asynchron function return result arbitrari period monitor threshold function detect abnorm rainfal level function provid intermitt connect devic return result devic asynchron function stationari rainfal support synchron asynchron function repres set function provid devic level distinguish level user devic model intern devic repres user objectori support abstract data type object valu encapsul collect relat data note natur parallel devic adt adt devic provid control access encapsul data defin interfac build observ model type devic network adt public interfac adt correspond specif function support devic actual adt object correspond physic devic real world model schema flood detect earlier simplifi schema consist record relat attribut call adt repres physic rainfal sensor actual sensor data locat rainfal adt sensor function access data return current level rainfal measur mm attribut denot locat sensor coordin system intern discuss intern adt recal background knowledg queri process intern system queri process classic proce system accept produc queri execut execut plan produc answer execut plan intern blueprint evalu queri combin algebra oper join oper relat serv basic build block manipul data relat set adt function repres express join involv virtual relat express adt function function call obtain tabl function defin ibm associ function virtual relat ieee person commun octob return assum return readili assumpt hold devic system reason function devic adt function incur high latenc due distant locat server devic function asynchron call function incur arbitrari delai virtual relat tabular function record virtual relat virtual input argument output argument function relat call virtual defin base relat virtual relat intern devic function devic function schema virtual relat attribut correspond uniqu identifi devic identifi actual devic adt attribut correspond input argument attribut correspond output attribut time stamp point time output obtain assum global time time stamp determin posit order domain share devic virtual relat consid sequenc schema consist base relat virtual relat function function input virtual relat identifi sensor level rainfal timestamp note virtual relat specif virtual relat record insert virtual relat devic function return result record virtual relat updat delet virtual relat natur partit devic repres devic adt devic function contribut portion virtual relat observ interest collect devic intern repres distribut virtual relat partit set devic base relat store central server partit devic system consist server connect set devic includ server devic includ lightweight queri execut engin access virtual relat process queri fragment involv virtual relat queri devic recal histor snapshot queri devic network histor assum loss gener devic function return extens gener case straightforward note mobil integr locat devic addit attribut virtual relat interest partit base relat refer devic adt system devic frequent join leav partit base relat avoid maintain central inform devic system snapshot queri natur formul declar queri sql queri formul sql modif languag add durat choic syntax arbitrari space describ complet queri semant interest reader refer bonnet al detail note queri involv time window aggreg time express tempor extens relat model sequenc model provid queri base flood detect applic present earlier queri rainfal level greater select function specifi record insert virtual relat function record propag queri execut plan chosen possibl answer gener note queri evalu repeatedli execut declar queri record insert virtual relat form poll introduc arbitrari delai process devic queri process devic system concentr simpl give overview queri process show benefit distribut queri process approach versu wareh approach space cover issu relat queri process devic system defin perform metric discuss perform metric process system construct execut plan queri optim gener execut plan minim cost function tradit perform metric system throughput time throughput averag number queri process unit depend total work perform system evalu queri time time system produc answer record queri queri devic tradit perform metric queri time queri run time vari resourc usag defin metric correspond perform goal devic resourc total amount energi consum devic execut queri resourc usag express reaction interv time call return time answer produc reaction time express problem defin cost model resourc usag reaction time ieee person commun octob plan plan materi vr plan vr vr vr figur execut plan queri σ vr σ vr obtain maintain correct set system paramet cost set reflect statu devic system time goal section cover issu relat queri process devic illustr exist distribut techniqu appli context discuss characterist devic system respect exist distribut system analyt model illustr benefit approach queri rainfal level greater select queri result rewrit queri virtual relat queri monitor evolut rainfal flood area system cardin relat record queri run queri durat hour rainfal level measur virtual record insert partit virtual relat distribut queri execut plan sql queri larg space execut plan obtain shape tree relat permut posit relat oper implement relat oper system implement set join nest permut rel posit distribut execut plan reflect distribut natur queri relat assign execut site vr plan vr dimens ad space execut candid execut queri fragment execut strategi transfer data site figur present execut plan vr plan tree relat oper manipul base virtual relat plan repres execut plan gener queri tradit system alert data extract devic materi relat vr locat darker shade execut plan simpl tree join oper relat relat vr join condit join execut front end execut plan illustr σ distribut techniqu devic system plan simpl tree vr join front end relat vr partit set devic lighter shade execut plan evalu front end devic measur rainfal level transfer result virtual record back front end record produc site snapshot repetit virtual record arriv front end join relat execut plan devic rainfal sensor transmit data front end queri concern sensor measur rainfal level greater altern execut plan push join trade process devic reduc network traffic push join vr plan defin relat partit virtual relat vr locat devic project join attribut relat devic id send result relat avoid transfer complet relat devic rainfal level virtual record gener join portion relat front end join condit join condit virtual record back front join complet record relat join sensor rainfal level greater send data back front end execut plan push select record verifi condit back front join relat plan repres execut plan compar plan subset relat transmit devic compar resourc usag execut plan section analyt model simpl analyt model compar cost execut plan identifi previou section assum win network cluster devic total energi consum sensor node linear combin cpu cost memori cost send cost send byte ieee person commun octob cost cpu ram weight factor transfer compon cost tabl list weight factor experi factor obtain kaiser measur win network sensor node corp energi processor oper domin energi set cost record join select comp instruct model cost invok devic function cost messag due synchron send receiv node node meter case cost send byte capac batteri win sensor node assum size virtual record byte studi resourc usag sensor node directli involv queri node partit virtual relat resourc usag node commun sensor node satisfi condit queri probabl trace resourc usag extrem sensor node locat flood area rainfal level greater sensor node locat insid flood area figur trace resourc usag express function time rainfal level measur node locat flood area plan data back front end gener plan plan join push devic condit rainfal level check devic devic locat flood area send data back front end plan pai initi cost transfer fragment relat devic initi cost amort plan lifespan queri cost plan plan plan time figur resourc usag sensor locat flood area tabl paramet set model resourc usag figur trace resourc usag express function time rainfal level measur node locat insid flood area data back front end initi cost plan amort plan plan similar illustr cost perform select low compar cost send data push select plan optim choic intuit queri filter uninterest event gener devic push select devic system trade effici process devic reduc commun devic process commun capabl deploi physic provid power comput platform gener cornel system demonstr applic technolog comput platform show provid flexibl scalabl access larg collect devic work introduc set research provid overview question ongo research current distribut optim assum global optim access exact complet system devic assum singl site maintain global knowledg system larg scale dynam natur devic incur administr overhead maintain decentr util inform good queri queri queri process advantag comput capabl devic order minim total amount resourc consum devic network minim reaction time condit devic network chang time devic network topolog batteri recharg queri plan adapt dynam cost plan plan plan time figur resourc usag sensor locat insid flood area ieee person commun octob chang network condit show robust devic failur queri condit devic network chang significantli queri run acknowledg stephan tobia debug earlier version review comment articl benefit interact sensit commun bill kaiser provid valuabl inform win network work sponsor advanc research project agenc air forc research air forc materi agreement number nation scienc foundat grant eia nsf grant grant microsoft research philipp bonnet refer heidemann commun vol estrin centuri scalabl coordin sensor mobicom pp imielinski queri monitor deepli network collect physic pp bonnet poster proc conf data engin san mar intel comput continuum network smart intl conf mobil comput network aug integr network sensor principl commun vol abstract data type vldb vol pp architectur transform passiv dbm activ pp model sequenc icd bonnet process devic cornel technic report oct tansel tempor design tempor jan maryland technic report submit acm tran system optim valid perform evalu distribut proc vldb pp aug manag system pp queri queri process pp ramakrishnan manag mcgraw biographi philipp bonnet receiv phd universit de research associ depart comput scienc cornel current research interest involv devic system member acm ieee comput societi johann gehrk receiv phd wisconsin assist professor depart comput scienc cornel research area data mine system recipi ibm faculti award serv editori board knowledg inform system textbook manag system publish mcgraw hill member acm ieee comput societi praveen seshadri receiv phd assist professor depart comput scienc cornel leav microsoft research area system data manag person devic receiv ibm faculti award nsf career award member acm ieee comput societi ieee person commun octob
Agents/1552 1 ration agent statechart util function oliv informatik universit institut ur rheinau koblenz ration agent statechart util function oliv universitat ai research group rheinau germani abstract aid develop robot soccer simul leagu team method specif team statechart introduc result year competit show team behav adapt unknown situat design adapt agent method straightforward manner paper extend approach adapt action select mechan facilit explicit goal agent introduct creat team autonom agent dynam environ simul robot soccer difficult agent encount number situat design time creation statechart visual approach formal complex system describ behavior system level granular specif transform straightforward manner run prolog code method facilit high rule check cycl proof develop simul team approach competit amsterdam melbourn turn team perform situat situat team behav adapt clear team cross ball front goal match high loss high win design adapt team approach intens hierarch structur statechart research support grant fu german research foundat dfg goal agent determin implicitli action paper extend approach adapt action select mechan facilit explicit goal agent idea approach script agent script predefin plan agent select applic script current goal goal agent set belief chang script action select mechan predefin plan chosen carefulli situat step adapt alter predefin focu sooner aspect paper provid mechan evalu util script commit select option account possibl gener agent program specif approach system statechart introduc method behavior statechart translat statechart code design soccer statechart natur describ sequenc action design design typic situat player action situat situat action formal statechart agent design consist number script time agent applic script execut step find action goal agent implicit agent behavior precondit action action execut condit regard order specif rule regard specif rule resort default rule appli long specif rule mechan ensur script agent execut applic script action select ration agent maxim perform measur case expect success action measur expect success boolean condit edg statechart action edg applic condit expect success agent option execut applic select adapt action select mechan evalu applic option execut intend side effect improv option evalu explicit goal agent model closer bdi model util script architectur action select base prefer probabl success introduc option score execut score option depend prefer probabl success option reward probabl valu hand written subject reinforc learn option evalu paper player ball singl player decid execut simul situat evalu anew approach support construct reactiv agent behav local optim respect inform disadvantag build complex plan consist step includ team mate happen implicitli intellig select prefer valu build agent option select mechan player team import long agent remain commit option situat advantag continu local behavior system agent switch behavior due small agent reli kinni found agent strong commit plan behav superior cautiou agent reconsid rapidli chang environ prefer probabl statechart statechart prefer consist finit disjoint set set set set guard condit set action transit state state label annot form set event set guard set action mean annot agent state event agent execut action find state provid condit hold structur statechart hierarch hierarch structur transit state state belong configur statechart root tree state step configur happen simul step agent save current script configur simul soccer agent return control soccer server wait simul cycl start belief updat agent continu script save configur chang statechart agent estim prefer action annot transit prefer script depend current belief bdi state environ import paramet prefer script current state statechart execut initi state script progress begin current execut script state prefer function map agent belief state statechart prefer script regard uncertainti script prefer script probabl success make util script event transit label annot prefer function return evalu prefer annot agent belief environ prefer function consist condit approach definit set state set bel current belief agent state world attribut function sa bel prefer agent action set attribut transit state difficulti li select valu option prefer option higher score turn agent combin attribut instanc prefer pass depend possibl kick distanc team mate posit oppon make simplifi assumpt attribut independ advantag approach multipl function conjunct definit attribut function prefer function weight prefer function max maximum prefer prefer function prefer prefer function prefer prefer function prefer prefer function prefer action product valu weight attribut attribut weight disjunct maximum attribut prefer negat prefer function max minu probabl action succe probabl measur util action probabl action succe estim statist collect seri match team probabl action multipli prefer respect action commit time advantag agent continu plan start switch behavior time situat agent stop current plan restart script evalu statechart doubl pass global outgo edg select plai mode select statechart intend time agent develop agent evalu altern emit current continu statechart lead termin state configur statechart reset step agent evalu util annot edg emit initi state statechart current agent find action statechart reset configur current statechart initi state start progress transit statechart begin initi state order reflect stronger commit select util script state unequ initi state multipli commit factor commit factor global easi adjust tendenc agent switch behavior case circular edg circular edg instanc success dash wait pass util script step script execut number time case case step unsuccess wait receiv ball longer wait low number repetit influenc util instanc dash posit provid mean distinguish pass execut state number current pass estim util script state statechart util action exponenti number pass state denot initi state stand pass state commit agent action defin equat paramet estim util probabl success prefer function product attribut commit select option current state current pass util equat run teammat pass distanc oppon ball pass ball ball teammat pass distanc ball approach ball ball goal close kick goal doubl pass goal kick ball dribbl ball oppon close goal close oppon close figur statechart prefer util action current statechart lower util applic action state pass reset fig statechart kind behavior agent design annot transit attribut action weight statechart state agent program evalu prefer transit state state execut annot pass ball dribbl case specif team behavior transit state script perform agent annot prefer function role respect agent descript situat agent work configur collabor agent state environ descript transit statechart describ behavior particip agent select action prefer situat teamwork prefer function assign higher behavior multiag script resolv mismatch current state commun pass ball ball teammat pass distanc run teammat pass distanc oppon ball ball teammat pass distanc pass ball pass posit teammat ball teammat pass distanc dribbl teammat pass distanc ball ball approach ball doubl pass ball approach ball figur statechart agent translat statechart prefer code advantag approach statechart translat easili prolog code translat statechart util function run assum system attribut function defin previou section interfac action agent design specifi statechart typic situat design combin attribut function weight util function annot transit pair complic find condit valu weight leav calibr learn procedur simul approach prefer valu truth valu point adjust valu refin translat statechart run system equip control loop process result script outlin agent control fig true updat belief guard condit current transit hold reset state pass current script end calcul util script make script highest util current script execut step current script end figur agent control loop map relev part belief action real assum system attribut function depend type continu binari function attribut encod player ball binari attribut team mate pass distanc emploi sigmoid translat procedur transit state produc code fig unlik type rule estim util action execut action closest pass util closest teammat teammat power kick figur prolog code transit statechart relat work work approach provid mean creat complex agent system end user end user domain programm high level behavior agent approach edit graphic tool diagram user creat translat behavior base behavior run parallel activ function end user chang lower level contrast specif method low level high level behavior specif user interfac tailor soccer domain user behavior directli soccer field tackl problem action select extend behavior network continu domain goal agent activ compet modul assign goal activ execut activ modul li behavior execut dix al author present gener framework deal uncertainti agent provid semant probabilist agent program base deontic logic action defin agent set probabilist rule agent forbidden action address problem select action pool introduc independ choic logic framework problem system approach express combin advantag markov influenc diagram logic program paper introduc statechart util method autonom agent specif agent translat run program automat result agent program reactiv commit action start compar previou improv adapt agent futur investig learn method estim prefer valu weight offlin learn aid develop design process onlin learn contribut adapt behavior refer jurgen subrahmanian probabilist agent program acm transact comput klau behavior network continu domain motiv intern joint confer intellig page david harel visual formal complex system scienc comput june david kinni michael georgeff commit effect situat agent twelfth intern joint confer artifici intellig jan murrai soccer agent uml master universitat fachbereich jan oliv frieder stolzenburg koblenz peter tucker gerhard robot soccer world cup lectur note artifici page team descript jan oliv frieder stolzenburg logic approach soccer agent engin peter tucker gerhard robot soccer world cup lectur note artifici page david pool independ choic logic model multipl agent uncertainti artifici special issu econom principl system anand rao michael georgeff model ration agent technic note australian artifici intellig februari stuart russel peter norvig artifici intellig modern approach prentic englewood paul johan end user specif robocup team robot soccer world cup number page frieder stolzenburg reason cognit robot system reinhard bernhard und de peter stone david mcallest architectur action select robot soccer submit intern confer autonom research report oliv ration agent statechart util function torsten urgen ebert conceptu model web site gener graph technolog carlo che urgen frieder relat normal logic program transform properti harri andrea winter appli gupro geo case studi pascal von stephan model concurr algorithm urgen bernt franz lehner workshop softwar reengin mai stephan workshop und fur jan oliv frieder stolzenburg logic approach soccer agent engin peter zhang ftp intern workshop theorem st juli frieder garc carlo che introduc gener specif logic program manfr specif symbol implement constraint peter fabio tame richard andrea andi sch standard exchang format urgen roger formal ulrich fuzzi techniqu cach memori jen implement urgen bernt franz lehner workshop mai peter michael abduct model construct urgen bernt andrea winter interchang format reengin tool frieder oliv jan bj spatial agent implement logic express languag kurt carlo simon zur hybrid system frieder stolzenburg power model gener peter jd bruce spencer merg path improv minim model hyper tableaux urgen roger uh worldwid peter norbert ulrich furbach confluent connect calculu bernt andrea winter queri enabl technolog softwar reengin urgen georg pick program urgen ulrich ilkka niemel nonmonoton effici calculi implement urgen steffen infer mechan theori applic ws ki jose urgen mauricio claudia semant logic program stefan urgen teodor przymusinski super logic program urgen dix logic program paradigm stefan urgen burkhard ulrich zukowski comput model manfr kamp greql ein fur da peter urgen angelika manfr andrea winter und formal grundlagen peter da org thoma marx workflow model wfmc dieter obel schedul criteria ag constraint process hard system ulrich furbach disjunct logic program horn program control program andrea schmid solut count infin problem distanc vector rout ulrich michael frieder stolzenburg proof debug peter sch model elimin simplif applic softwar verif bernt andrea peter urgen ebert program system urgen jorg lobo logic program nonmonoton reason kurt carlo jan technischen anwendungen manfr kamp manag softwar repositori program tool gener approach
Agents/1553 1 semant agent commun languag yanni labrou tim finin comput scienc electr engin baltimor md usa semant agent commun languag yanni labrou tim finin comput scienc electr engin depart maryland baltimor counti baltimor md usa abstract address issu semant agent commun languag semant knowledg queri manipul languag investig kqml languag protocol support commun softwar agent base idea speech act present semant descript kqml associ state agent languag primit approach describ semant set reserv kqml perform research offer method speech act semant descript languag commun act languag commun act address issu commun softwar applic level abstract prove emerg softwar agent paradigm softwar design develop introduct research concern commun softwar agent softwar agent paradigm suggest view exist technolog tool build softwar applic dynam interact commun environ local resourc comput autonom fashion agent program commun protocol agent design build softwar essenti properti success applic todai paradigm network comput abil effect commun exchang knowledg differ hardwar oper architectur program languag crucial part solut problem commun work support part air forc offic scientif research contract advanc research project agenc monitor usaf contract rome laboratori medium attitud content exchang softwar agent commun languag suggest content commun form queri knowledg queri manipul languag agent commun languag consist primit agent commun attitud agent find agent suitabl process request research semant kqml framework semant descript languag agent commun avoid commit agent model interact protocol kqml primit intuit thought speech act intend provid paradigm linguist commun softwar theori scheme semant descript speech act gener start introduct kqml challeng semant follow coverag speech act theori relev describ semant framework give semant small set kqml perform approach describ full set kqml discuss semant approach respect research agent commun languag kqml kqml languag exchang inform knowledg softwar messag type express attitud actual express exchang kqml prolog foo kqml perform express languag kqml messag repres content commun act paramet introduc valu provid context interpret hold inform facilit process messag queri symbol agent prolog truth statu kqml term coin austin suggest verb utter perform action term agent refer kind program applic messag identifi ontolog foo provid addit inform interpret environ agent special agent call facilit broker denot similarli intend agent agent servic assist find agent provid servic kqml collect commun primit assumpt simpl model interag commun abstract design agent thing implement mean kqml interpret compil languag offer hardwar platform abstract machin agent speak kqml librari commun reserv mean applic programm expect provid code process perform agent languag knowledg framework problem semant kqml kqml semant formal defin goal provid semant descript captur intuit express exist document faith linguist origin make commit specif agent model coordin protocol order ensur widest applic languag good reason supplement kqml formal semant lack semant kqml sourc critic kqml implement agreement exact mean perform framework defin mean problem semant approach address agent semant definit perform order make infer result kqml commun primit semant perform specif interact agent treat kqml perform speech act adopt descript framework speech act illocutionari act suggest searl semant approach suggest minimum set precondit postcondit govern condit suggest final state success perform speech act express describ relev exchang agent state proposit attitud intent descript agent intend view ontolog repositori semant primarili pragmat knowledg domain speech act theori speech act theori theoret framework develop philosoph linguist account human commun extens formal extend field comput linguist ai gener model commun arbitrari agent austin point major role kind action suggest speaker simpli utter sentenc true perform speech action speech act theori concern languag action speech act consid minim unit human commun utter speech primari understand utter action sort distinct action identifi speech actual physic utter context convei speaker intent action occur result order shut utter command shut door listen shut door elementari speech act perform success utter form illocutionari forc proposit content illocutionari act illocutionari forc classifi speech act class classif declar express extend austin suffici condit success perform speech involv intent particip introduc formal illocutionari analyz illocutionari forc attempt captur aspect illocutionari act illocutionari forc regard sum illocutionari strength illocutionari mode proposit content preparatori sincer strength sincer condit framework semant kqml perform perform speech act provid definit suggest agent commonli symbol displai function commonli view intent level descript state view consist mental compon intent descript abstract model view softwar actual implement make claim describ relat speech account state agent perform treat proposit content condit precondit listen preparatori agent view precondit state speaker effect provid state process messag provid state send messag object interpret suggest desir effect sender illocutionari point perform eventu queri satisfi answer appropri illocutionari act satisfi requir exchang provid complet state affair complet illocutionari act postcondit complet condit describ state involv agent constitut semant descript constitut semant descript natur languag descript perform intuit mean express describ content illocutionari act practic formal natur languag descript precondit state agent order send perform receiv accept successfulli process precondit hold error postcondit describ state interlocutor success utter perform receipt process counter messag postcondit hold error order suggest unsuccess process messag complet condit perform final possibl place intent suggest perform start fulfil comment find suitabl enhanc understand perform describ agent state express formal defin state agent describ postcondit complet condit perform express oper stand proposit attitud reserv mean oper mean true express nativ languag agent express knowledg state descript hold agent desir cognit state occur futur intent commit action achiev futur introduc instanc refer action process kqml messag messag receiv valid kqml messag piec code design process perform applic process proper process messag conform code semant refer action send kqml messag argument bel express agent implement languag true agent assum axiom bel int stand psycholog state desir agent state descript cognit state argument agent express refer agent state agent state descript commun commun valid stand express agent knowledg store state descript research year problem formal captur notion desir intent formal exist consid definit adopt offer formal belief exist formal accommod modest int framework nativ languag applic modal oper analysi assum languag notat agent state kqml messag perform speech act point listen proposit content speech act place refer instanc kqml messag letter begin alphabet agent letter end alphabet proposit content perform underscor quantifi variabl stand perform paramet valu kqml capit case letter question mark existenti quantifi variabl express languag denot agent state agent state action occur agent mental state conjunct disjunct express stand agent state result express repres agent scope int proposit agent nativ languag scope bel bel proposit argument int action argument interpret action int action argument action argument action place futur negat mental state mental state hold infer symbol qualifi express true agent provabl knowledg base mean depend detail agent make assumpt semant kqml perform present semant kqml perform support interest agent illustr approach state process messag receiv commit kqml messag perform semant complet set commit sender process suggest announc intent process facilit interchang semant agent facilit believ truth statu content necessarili instanti believ necessarili believ negat languag logic case system suggest proper establish comment section state believ content true complet condit error suggest bs inabl acknowledg case perform state process provid kqml messag identifi id messag messag postcondit complet condit dispatch perform result satisfi mental state qualifi infer true result messag hold establish previou decid addit alter intern state respect agent perform perform entail request set perform present fall categori send receiv call send messag semant situat break semant descript pair involv transact semant mean awar utter agent ffl broker send agent process eventu forward agent back agent agent facilit process perform ascrib facilit statu agent agent agent contact request stand process messag case case infer wai provid infer suggest abil process proc suggest agent process dispatch messag piec code handl perform forward present mean basic intuit paramet refer origin perform final forward forward messag gener broker agent offer understand impli ds wrap forward ds omit ds semant mean exchang mean repercuss addit exchang semant call major differ exchang empti exchang prior knowledg interlocutor state applic lack case exchang mention eventu mean agent bel ident semant agent agent ffl agent agent believ truth statu content necessarili instanti ds ident remain unknown unawar belief truth statu discuss speech act thought plan oper plan tradit ai cohen introduc treatment speech act approach bear similar appelt work supplement tradit semant modal recent cohen suggest model ration turn framework semant descript illocutionari act sadek similar task defin ration agenc defin commun act top singh model agenc differ cohen framework semant treatment speech act draw directli speech act result framework reminisc plan thought oper transit agent approach provid formal semant formal similar modal oper restrict scope subsum similar modal semant provid intent theori agenc complex formal prohibit intend audienc semant descript includ applic develop support kqml softwar agent expect user kqml fluent modal agent implement complex agent theori kqml develop semant definit refer model conform establish virtu declar adopt refer model larger problem theori agenc substrat semant commun research provid account common element mention approach strictli declar definit primit postcondit complet condit framework suggest oper hope implementor provid code process commun primit attempt semant commun act theori formal semant proposit attitud give interest inferenc agent send infer assum weak model base kqml semant addit inform inform infer similar observ made modal trade formal semant proposit inevit defin model agenc simpler formal agent theori independ lost addit inform agent theori hold agent suppli part kqml exchang kqml subsequ inferenc object choic mean chose attribut perform semant suggest agent offer unsolicit inform agent easili amend introduc call semant descript empti agent send agent process request implicit prefer model agent servic agent mediat find agent process request version introduc direct queri semant descript differ empti kqml tradit open kqml user commun decid perform semant descript introduc perform agent directli inquir agent process request kqml languag agent commun semant attempt made complet semant descript full set kqml perform literatur semant framework semant descript languag commun model speech linguist commun softwar agent semant framework separ commun languag agent model coordin protocol approach provid semant full set kqml primit present framework semant descript hand perform languag agent commun address issu knowledg exchang layer separ issu issu commun commun primit opaqu content carri express attitud translat languag knowledg scheme mean share ontolog commit softwar agent support languag medium knowledg share softwar agent refer dougla appelt plan english sentenc cambridg arpa knowledg share initi specif kqml languag arpa knowledg share extern interfac work group work juli jl austin thing word harvard bruce schmidt belief system languag understand technic report bolt newman januari philip cohen hector levesqu intent choic commit artifici philip cohen hj levesqu commun action artifici agent intern confer system aaai june pr cohen cr perrault element theori speech act alan bond le read distribut artifici page morgan kaufman san keith mike katia sycara matchmak broker intern confer system decemb daniel dennett philosoph essai mind psycholog bradford mckai al overview knowledg queri manipul languag technic depart comput maryland baltimor yanni labrou semant agent commun languag phd baltimor august yanni labrou timothi finin semant agent commun languag fifteenth intern joint confer artifici intellig august charl petri intellig ieee decemb md sadek studi logic intent confer principl knowledg reason page searl foundat illocutionari logic cambridg john searl speech act cambridg mp singh logic intent belief journal philosoph mp singh semant speech act annal mathemat artifici ira smith philip cohen semant agent commun languag base nation confer artifici intellig august
Agents/1554 1 multiag agent interact agent organ michael michael frank daniela german research center artifici intellig germani depart technolog assess technic germani abstract paper suggest sociolog concept studi organ multiag system discuss concept organ typic dai sociolog point view concept miss special qualiti organ social entiti present concept organ base theori pierr refer organ view social compet organ domain describ framework robust multiag system sociolog characterist organ framework deleg central concept defin organiz form relationship task assign multiag system introduct subject discuss question interrelationship system environ disciplin dai decad interdisciplinari notion theoret approach common call kind system determin intern structur environ boundari system structur relat determin factor system chang adapt intern organ logic dynam process cope interrelationship intern organ selforgan system environ term linear causal system defin sum relat organ system deriv singl element result recent social notion primit sociolog describ social entiti point social order emerg social entiti complet deriv social constraint deriv intent interact singl agent social order emerg exist independ singl intent field enorm bodi literatur interpret term jen critic interdisciplinari notion mention found attent ma literatur concept mass partial consid research interest design match structur perform studi conceiv environ usual set constraint ma accord suggest sociolog concept studi selforgan ma paper share opinion sociolog theori overcom difficulti model ma refer theori pierr describ organ social entiti concept critic discuss select concept deal pattern ma argu concept miss special qualiti organ social entiti sociolog point view introduc framework robust ma restrict ma design domain agent act environ analog electron market market consist group provid custom custom task possibl repres human user avatar provid agent perform task perform subtask task view factor provid cope detail kind task perform agent concentr effect organ group provid great deal author term combin refer human term organ gener agent system carri form joint action differenti coordin task member discuss concept ma deal joint cognit process notion organ adopt consid advantag human organ overcom tempor institut limit individu agenc organ persist group interact agent formal structur regul aim group constraint import organ joint action achiev separ end motiv paid member organ monei act motiv comparison interact organ fall agent stop interact organ anticip anticip lead effici perform organ formal structur exist independ action intent singular constrain agent consid major advantag organ research dai adapt organiz concept social scienc design ma agent explicitli construct cooper achiev act zambonelli al suggest analyz firstli requir organ defin organiz form fit requir design constrain agent creat formal structur creat control regim design role organiz assign agent comparison social interact design flexibl due formal structur advantag organ turn requir organ chang environ ma situat open dynam rigid role static organiz structur sever problem ma manag problem fluctuat number task profil empir research social organ human societi inform form social organ specif advantag disadvantag depend institut environ scott express insight sociolog organ gener principl applic organ time place organ equal effect organiz structur irrelev organ perform organ depend natur environ organ relat organ design depend condit cope research dai call determin organiz structur system adapt chang structur environ model selforgan build turner jen selforgan scalabl issu organ plai import role improv system perform individu abil determin commun structur system chang structur environ involv heterogen ma intermediari agent work similar restrict analysi structur perform homogen ma note commun link agent natur arrang commun natur channel interpret common mean process adapt chang organiz result individu choic set agent engag interact organiz pattern sociolog point suggest mean process adapt chang organiz explan process defin organiz structur result individu choic set agent engag interact organiz pattern contradict sociolog point view social order social system organ emerg social order intend interact agent definit mention impli organ sum interact singl agent social order reduc link singl agent definit mean model social exist persist independ singl intent goal react goal action agent time exploit advantag organ definit organ exist social structur independ singl agent constrain agent adapt structur action result structur reflect intent goal singl agent base contribut sociolog model transform organ chapter organiz theori multiag system work organ suggest concept habitu social field fruit start point studi theori offer explan reproduct chang social order level social aggreg theori describ organ social field autonom field term field theori analyt categori defin field histor develop object consist link object relat posit posit defin determin present potenti composit sort capit social symbol relat posit structur capit agent hold decid access specif profit stake field posit conceiv role activ activ posit find book make agent act posit practic term field thought independ term habitu vice versa habitu agent defin set disposit specif wai perform action disposit bound posit agent social structur field depend histori individu agent field experienc past disposit incorpor learn observ acquir advic agent capabl posit disposit acquir field enabl perceiv specif chanc act object possibl social field assum agent specif interest depend object posit interest social shape compar field game field contrast explicit norm obei individu product intent regular practic assum agent act field player game improv rel posit field distribut sort capit regular object attempt influenc structur field favor social structur interest view agent forc chang reproduct social structur field field defin charact regular field make autonom comparison field make logic econom field logic exclud game logic field emerg social entiti emerg social entiti field field show object structur relat posit structur field agent unabl act agent act posit practic detail autonom structur regular field chang agent attempt improv posit logic field field boundari field dynam determin field autonom field organ basic insight organ social field point distinguish organ social field group interact agent field econom polit field summar basic characterist organ adopt field concept member organ conceiv measur carri empow individu agent act determin limit rest world field sourc consid corpor agent organ field organ societi corpor agent compet agent improv object posit organ habitu lack special feel practic cope constraint field organ corpor social field agent compet member repres aim achiev posit improv posit organ basic characterist distinguish kind social formal structur structur regul aim compet distribut profit contradict theori organ static formal appar orient common function social structur organ field cultur polit construct domin domin agent agent domin properti practic power resourc symbol capit social structur organ form relat power domin agent aim reproduc posit challeng domin agent conquer higher posit organiz distribut power author formal structur measur carri object agent chang favor kind capit resourc agent favor interest constraint agent act conform benefici work organ work concept fruit organ format group organ deleg empow speak organ make organ visibl social environ fact agent speak repres agent incur commit control repres agent offici task deleg repres interest organ due posit organ deleg interest deviat organ limit field difficult state organ earlier organ analyt separ market hierarchi organiz network import organiz form determin limit formal organ market relat organ difficult remark field situat point effect field suggest defin network organiz organ hybrid complet econom legal partial integr contract share specif interest jointli fabric result effect field boundari hybrid effect field declin member network produc product offer sale form framework robust ma present framework robust multiag system motiv argument close connect robust term scalabl scenario detail concentr aspect ma form inspir sociolog research genesi social form organ social structur field transport logist matrix deleg grammar ma organ form deleg deleg task deleg task agent ma research domain long time involv distribut task agent model deleg restrict kind set agent design share common set agent simul author relationship distribut problem appli open ma deleg choic deleg result reason process mean agent gener decid case case basi deleg task recent work deleg extens shown deleg complex concept highli relev system mechan deleg make pass task creat plan extract individu special individu task mode social deleg repres group team essenti mechan deal social process coordin structur point refer concept develop ma applic domain task subtask perform agent domain hierarch task mean analyz domain show task requir combin activ agent model combin activ concept holon agent holon introduc found applic holon manufactur system holon agent consist part call bodi turn holon agent holon agent part contribut achiev goal superior holon agent capabl emerg composit bodi agent action bodi agent perform bodi agent give part autonomi holon holon repres distinguish head moder activ bodi agent repres holon type associ holon bodi agent build feder share common goal time separ regul object bodi agent give autonomi merg agent nuanc spectrum scenario agent give autonomi retain case flexibl task autonomi subject negoti agent particip matter design holon social deleg task distribut set task agent fat tree bypass critic commun massiv parallel distribut task commun resolv bottleneck make social deleg principl action context flexibl holon basic function selforgan decentr control task social deleg respect task mention involv depend deleg agent repres fact agent speak repres agent incur commit control repres agent author structur constitut social deleg social deleg refer trust task deleg base econom principl justifi differenti type task deleg goal achiev social consist creat solut product repres group organ type deleg essenti organ reli independ individu make describ explain phenomena interest level social structur power relat field organ econom exchang gift exchang author vote task deleg social deleg figur deleg matrix show mode deleg mechan perform mode combin mode mechan multiag organ type remain explain action deleg perform observ distinct mechan deleg figur econom exchang standard mode deleg paid deleg task econom good task exchang involv parti assum similar author mechan repres method organ distribut problem solv impli set power relationship deleg perform order gift sociolog denot mutual deviat econom exchang market situat motiv gift exchang expect reciproc reciproc indic involv parti state relationship organiz field distribut power resourc kind exchang entail possibl conflict explicit manag relationship agent aim mechan accumul strength relationship futur mechan group equal determin deleg vote mechan distinguish properti observ mechan perform mechan deleg agent deleg descript mandat circumst vote mechan integr part oper descript mechan access particip suggest figur mechan work type econom exchang social deleg task deleg possibl set mechan mechan occur human organ cover combin mechan spectrum organ model organiz field requir identifi organiz scheme organiz form mechan gener task deleg social deleg membership profit distribut number describ organiz form deriv empir case studi emerg organ autonom compani field transport logist case studi base sociolog concept matrix deleg note current model singl agent repres individu virtual virtual coupl set compani organ merg core compet order produc specif product portfolio singl agent singl compani stai wide econom legal integr integr manag model organiz form introduc longer term social deleg specif singl type task agent agent virtual holon accept task holon act task head agent carri task queri agent holon assist mechan econom exchang gift exchang role gift exchang strengthen relationship pave tighter organiz integr share econom cooper cooper organiz form virtual manifest contract particip contract creat formal structur regul condit relationship collect control manag cooper incur valuabl reput contact custom agent impli power advantag larg social network relat quit agent custom contact loss social model organiz present detail capit custom prefer interact supplier agent acquaint matter organ belong incent join cooper stabil focal particip reput due power elect social deleg vote repres cooper profit distribut head bodi agent perform task econom exchang gift exchang creation cooper agent ratio case fix describ profit split head agent bodi agent involv perform task group group compani strateg network requir member organ involv compar organiz form fundament differ worth refer possibl leav cooper group compani singl compani decid exit depend hold compani bound contract group organ equip uniform manag power control mechan relationship enact task deleg author similar strateg consequ singl membership restrict head inform task bodi agent econom exchang regul constitut gift exchang requir relationship defin contract downsid head agent requir matter order acquir head agent pai bodi agent variabl cost fix incom time unit spectrum build present organiz form model approach individu agent depend situat interest proce join organ organiz form advantag transit benefici light current market situat worth note form organ introduc restrict paper present gener interdisciplinari definit order achiev form framework inspir theoret sociolog research organ pierr empir sociolog research organiz form domain transport logist contrast previou work organ metaphor ma extend form model commun author topolog mechan deleg gift exchang built vote mechan coordin attribut organ notabl membership limit mechan social form overcom dualiti model interact system model static contrast complex organiz static membership multipl organ explicitli organiz structur dynam adapt current task profil environ form model refer die stuttgart deleg und rede und frankfurt press invit reflex press comput organiz theori gerhard multiag modern approach distribut artifici intellig mit press theori deleg system robot autonom system und ein ed theori der praxi tune collabor level autonom principl theori workshop interact autonom agent flexibl autonomi holon multiag system aaai spring symposium agent adjust autonomi zur und einer revolut der de frankfurt manifesto scienc system proc workshop system perspect agil schedul intellig system manufactur kluwer academ publish rule encount mit press adjust side workshop deleg group bound social model adapt theori model artifici societi hybrid organ ecai definit robust open system intern confer autonom agent natur open system englewood prentic hall design organ comput agent comput mathemat organ theori improv scalabl system intern workshop infrastructur scalabl june lectur note artifici vol verlag holon collabor inform ecosystem workshop autonom cooper agent autonom agent rule abstract analysi design system int softwar engin knowledg engin
ML/1555 6 face detector dan roth yang narendra ahuja depart comput scienc beckman institut illinoi il abstract learn approach human face detect network linear unit present snow learn architectur network linear function increment learn featur space specif tailor learn presenc larg number featur wide rang face imag express light condit train set captur variat human face result commonli benchmark data set wide rang face imag show approach outperform method neural bayesian support vector machin learn evalu method significantli effici method introduct grow interest intellig human comput interact motiv recent surg research problem face pose face express gestur recognit assum human face input imag detect local singl imag sequenc goal face detect identifi locat human face pose illumin support autom solut effici robustli challeng build effici robust system problem stem fact human face highli object high variabl color textur numer method recent detect human face singl imag sequenc imag sung poggio report learn approach locat vertic frontal view human face number gaussian cluster model distribut face pattern small window move imag determin face exist estim distribut detect algorithm combin templat match detect method hierarch markov random field maximum posteriori probabl estim huang appli kullback rel inform maxim discrimin posit neg exampl face famili discret markov process model face background pattern estim densiti function detect face base likelihood ratio comput train moghaddam pentland probabilist method base densiti estim high space eigenspac decomposit rowlei al ensembl neural network learn face pattern face detect schneiderman al describ probabilist method base local princip compon analysi method preliminari result profil face detect hidden markov model higher order statist support vector machin appli face detect demonstr success detect upright frontal face light condit present face detect method snow learn architectur detect face featur light condit snow network network linear function util winnow updat rule snow specif tailor learn domain potenti number featur part unknown priori characterist learn architectur connect alloc featur link data driven mechan util effici updat rule snow successfulli varieti larg scale learn task natur languag domain time visual process domain train face set face imag olivetti umist harvard yale feret captur variat face pattern order compar approach experi involv benchmark data set work face detect result benchmark data set consist imag show method outperform method evalu includ neural network kullback rel inform naiv support vector machin significantli effici result describ experi provid insight theoret practic learn system studi effect learn primit discuss sourc success approach snow system snow network learn architectur network linear unit common increment learn featur space node input layer network repres simpl relat input input featur linear unit call target node repres relat interest input current target node face pattern pattern set relat type interest input input imag map set featur activ present input layer snow propag target node binari indic fact featur activ real reflect current featur binari sec target node link weight edg input featur fi set featur activ link target node linear unit activ weight edg connect ith featur target node threshold current applic singl snow unit includ treat autonom target imag label face posit face target neg learn polici updat rule snow success updat work variant littleston winnow updat multipl updat rule tailor situat set input featur infinit attribut model mechan implement architectur snow input featur alloc data driven input node featur alloc featur activ input imag link exist target node featur activ imag label architectur support augment featur type extern sourc flexibl option current work winnow updat rule addit threshold target updat promot paramet ff demot paramet fi updat current target set weight mistak predict made fi mg set activ featur link target node algorithm predict receiv label activ weight current promot multipl ff algorithm predict receiv label activ weight current fi weight unchang kei featur winnow updat rule number exampl requir learn linear function grow linearli number relev featur logarithm total number featur properti crucial domain number potenti featur small number relev small number winnow learn effici linear threshold function robust presenc kind case function make perfect maintain depend number total relev attribut target subnetwork learn network support mechan select domin activ target node snow unit mechan produc final predict unit output cach process output snow unit produc coher output learn detect face set face imag olivetti umist harvard yale feret wide variat facial express light condit sampl neg exampl start exampl imag extrem difficult collect repres set bootstrap method includ exampl train posit face sampl manual crop normal align vertic size pixel make detect method set phrase term impli converg pac sensit scale rotat face exampl gener origin sampl imag produc randomli rotat imag scale produc face sampl histogram equal perform map intens valu expand rang intens procedur appli input imag detect phase primit featur face detector make boolean featur encod posit intens valu pixel pixel imag width height intens inform encod featur index ensur point space map featur featur index activ intens posit valu face sampl normal imag pixel note number potenti featur activ plausibl featur activ algorithm complex depend number activ featur total number ensur effici featur vision problem util featur captur structur object extract detail featur edg region inform segment task snow paradigm extract boolean featur repres inform similar sec case addit varianc pixel hope featur captur inform requir featur simplifi learn problem uninform featur quickli assign low weight learn algorithm degrad perform face sampl normal rectangular imag suffic rectangular vari size face gener featur term mean varianc intens valu empir result show face effect absolut valu varianc encod discret valu predefin number class distribut valu varianc valu discret finer mean distribut total number valu determin empir end scheme sec map intens intens space boolean featur space separ pixel featur vector consist activ featur scale number activ featur total number featur larger empir result test approach set featur set imag collect rowlei sung imag scan rectangular window determin face exist window detect face input imag repeatedli subsampl factor scan iter tabl show report result face detector face detect system benchmark data set data set consist imag frontal face data set consist imag frontal face hand drawn face cartoon face set method intens valu system discard hand drawn cartoon face imag face test set imag face test set report detect rate comput base ratio detect face system number face imag identifi human report detect repres number detect face difficult evalu perform method benchmark data set criteria train number train exampl execut number scan window appli favor tune paramet method detect rate number detect method neural network kullback rel inform naiv report result base set paramet tabl summar detect rate detect method method highest detect rate benchmark significantli number detect evid face detector outperform term perform detect rate detect result show tabl result imag test set imag test set imag text test set test set method detect rate detect detect rate detect snow primit featur snow featur mixtur factor analyz fisher linear discrimin neural network naiv kullback rel inform support vector machin credibl snow exhibit improv achiev express featur elabor gener flexibl yield improv addit studi start investig reason success snow discuss briefli potenti contribut winnow updat rule architectur studi updat rule independ snow architectur result winnow simpli discrimin fairli poor test set primit similar result test set result winnow discrimin posit weight investig architectur isol reveal weight discard featur base contribut mistak crucial activ featur uniformli face yield poor result studi result snow network show total number featur activ featur total number activ featur face clear set imag neg rel restrict set imag constitut face phenomenon occur number show slightli featur activ test imag face imag exhibit learn regim updat rule contribut significantli success approach figur show detect face experi note profil face face heavi illumin detect note exist detect face window drawn detect face clear present result show profil face face illumin detect method figur sampl result method imag benchmark data set detect face shown window discuss issu address theoret learn system sort detect face effici robustli gener condit term face detect present method detect rotat face recent method address problem build upright face detector rotat test sampl upright posit suffer degrad detect rate detect snow adapt similar gener detect face gener condit term snow main ingredi understood work requir understand strength increasingli interest architectur found perform problem natur languag domain contribut paper summar introduc snow learn architectur domain visual process approach detect face facial featur illumin condit result show method outperform method term detect rate number effici learn evalu refer kriegman eigenfac recognit class specif linear project ieee transact pattern analysi machin blum learn boolean function infinit attribut space machin huang face detect maximum discrimin ieee comput societi confer comput vision pattern page gold roth winnow base approach spell correct machin special issu machin learn natur languag graham virtual gener face recognit face theori volum nato asi seri comput system page deform model face recognit arbitrari light condit phd harvard warmuth weak learn journal comput system june warmuth gradient versu gradient descent linear predictor annual acm symposium theori littleston learn quickli irrelev attribut algorithm machin littleston redund noisi attribut linear threshold learn winnow fourth annual workshop comput learn page moghaddam pentland probabilist visual learn object recognit ieee transact pattern analysi machin girosi train support vector applic face detect ieee comput societi confer comput vision pattern page rauss feret evalu face theori volum nato asi seri comput system page qian huang object detect hierarch map estim ieee comput societi confer comput vision pattern page patil find face photograph sixth intern confer comput page roth learn resolv natur languag unifi approach fifteenth nation confer artifici page roth snow learn technic report uiuc comput scienc roth part speech tag network linear separ intern confer comput page kanad neural face detect ieee transact pattern analysi machin kanad rotat invari neural face detect ieee comput societi confer comput vision pattern page face recognit hidden markov model phd schneiderman kanad probabilist model local spatial relationship object recognit ieee comput societi confer comput vision pattern page sung poggio learn human face detect ieee transact pattern analysi machin valiant theori learnabl commun nov kriegman face detect mixtur factor analyz ieee intern confer imag kriegman mixtur linear subspac face detect ieee intern confer comput submit
IR/1556 5 dynam model learn user profil person agent thesi submit oc graduat studi texa partial ful llment requir master scienc major comput scienc dynam model learn user profil person agent thesi submit texa partial ful llment requir master scienc approv style content john yen thoma ioerger major comput scienc iii abstract dynam model learn user pro le person agent institut chair advisori dr john yen find relev inform ectiv internet challeng task inform wide explor web site nding inform relev user interest tediou task softwar agent emploi perform autonom inform gather ltere behalf user critic issu agent capabl agent model user adapt time chang user interest scheme learn user pro le scheme design handl multipl domain user interest learn posit neg user feedback interest categori approach develop achiev object learn algorithm deriv imit human person assist task base scheme perform adapt quickli signi user interest iv wife daughter acknowledg express gratitud dr john advisori provid valuabl time guid research learn conduct good research dr thoma fruit discuss construct suggest research great amount time spent write thesi special dr support encourag special comput scienc softwar agent group anna chri stimul discuss brainstorm research thesi part support armi research laboratori project grant number dr jame wall texa center appli texa ltc robert armi research laboratori driven complet work express deepest gratitud ministri educ cultur republ indonesia provid year fellowship pursu master educ engin develop project debt opportun experi studi vi tabl content chapter page introduct background object approach contribut organ write ii literatur review document text analysi keyword weight normal term frequenc weight scheme term frequenc document frequenc weight scheme measur featur vector similar previou work system ad hoc approach neural network approach genet algorithm approach limit previou work iii model learn user profil model user pro le user pro le model structur user pro le inform filter learn user pro le person agent learn algorithm measur interest categori relev updat featur vector learn explicit feedback learn interest learn implicit feedback iv sensit analysi vii chapter page learn rate sensit threshold sensit person agent person agent architectur agent function agent compon implement retriev learn modul meta search engin user interfac modul process user registr open person page handl user feedback perform search request vi perform evalu perform evalu criteria accuraci normal perform measur spearman correl coecient averag document score versu recal methodolog procedur experi scenario feedback feedback scenario algorithm feedback scenario perform comparison result accuraci normal perform measur spearman correl coecient averag document score versu recal vii summari research viii chapter page futur work extend scheme incorpor collabor filter extend learn capabl direct manipul pro le refer appendix appendix appendix appendix vita ix list tabl tabl page di erenc system base learn process learn approach ii di erenc system base type feedback iii paramet recal iv accuraci model di erent number keyword accuraci model di erent document sourc feedback vi accuraci model di erent number recommend list figur figur page user pro le natur chang interest categori posit feedback categori neg feedback ect learn rate chang document rank ect threshold categori architectur person agent main entri person agent person page diagram experi procedur relat user satisfact learn rate relat document score learn rate accuraci model threshold accuraci system recommend averag accuraci model system perform averag perform model system perform spearman correl coecient xi figur page perform model spearman coecient system perform averag document score perform model averag document score versu recal chapter introduct background advanc network internet technolog recent driven rapid develop spread world wide web inform sourc inform subtl problem exist search relev inform easier obtain site task list web site super cialli amount time requir check surf site relev inform found focu search divert occurr seemingli interest web site add amount search time back track search tool nding main explor web site remain peopl softwar agent explor inform sourc deliv relev document user agent softwar agent agent comput program perform inform gather ltere behalf user maintain pro le user repres current user interest pro set relev document retriev world wide web recommend user agent perform autonom inform gather surf internet period collect articl onlin newspap magazin night journal model comput journal articl examin meta content articl relev user pro le local repositori user sign agent proactiv er list rank articl interest user agent adapt dynam user interest learn chang user interest user feedback user provid explicit feedback express dislik articl recommend pro le user modi ed agent learn user implicit feedback observ user action system object user model essenti compon intellig inform gather ltere system model repres current user date model major concern object research thesi develop dynam model user pro le learn algorithm adapt chang user inform interest time design model aim applic person inform provid speci calli person agent approach thesi scheme model learn user pro le scheme consist user pro le structur learn algorithm structur user pro le design accommod multipl interest interest recognit explicit interest area level interest base learn algorithm deriv imit human person assist task approach emploi scheme repres interest categori descriptor maintain interest descriptor deal learn learn descriptor ect posit feedback interest level posit descriptor interest level neg descriptor neg feedback interest level neg descriptor reduc interest level posit descriptor updat descriptor model ect reluct interest chang learn long run updat posit neg descriptor model ect reactiv behavior interest contribut main contribut research distinguish relat work introduct scheme repres categori interest learn algorithm handl interact compar similar work model interest categori scheme er advantag model scheme handl except interest interest categori learn interest simultan disadvantag approach complex pro le structur updat issu problem domain model simpl updat limit learn approach easili forget previou learn interest high learn rate hard learn interest low learn rate fail repres except interest broader scope interest categori learn handl simultan scheme scheme thesi extend learn capabl previou approach cover multipl interest categori perform onlin learn learn implicit feedback handl except interest categori maintain chang interest simultan organ write clariti rest thesi organ literatur review studi work relat thesi research chapter ii chapter iii describ detail idea research descript includ design detail model learn applic model inform ltere analysi model discuss chapter iv analysi sensit paramet govern behavior model chapter prototyp system emploi model research present demonstr system function detail implement chapter perform evalu model discuss chapter vi chapter discuss methodolog perform evalu procedur result present discuss summari futur direct research present chapter vii chapter ii literatur review basic altern techniqu consid develop user model algorithm inform ltere altern document select approach learn algorithm chapter describ altern rst section rst section present techniqu repres analyz document section describ system di erent approach algorithm learn user interest inform ltere discuss limit previou work present document text analysi document commonli base vector space model document repres vector space document mechan requir transform document vector dimens repres distinct term extract document vector call document featur document hyperspac interest area de ned base document featur vector document vector space model weight term measur featur vector similar rst issu deal assign weight term issu concern nding determin close document interest keyword weight import task textual document analysi extract term document assign weight ect presum import content identi cation luhn pioneer automat index measur word signi canc justi ed fact author repeat word advanc vari argument elabor aspect subject distinct term textual document arrang order frequenc occurr characterist vocabulari constant law zipf law state product term frequenc rank order term approxim equal product frequenc term rank base zipf luhn conjectur relev term extract document text peak term medium term good content identi er method deriv weight keyword textual document base basic term probabilist document signal discrimin latent semant index simpl term frequenc normal problem distinguish long short document rest method su er prior knowledg requir collect document refer keyword weight dicult extend dynam chang describ heurist keyword weight popular normal term frequenc term frequenc document normal term frequenc weight scheme normal term frequenc suitabl method keyword weight domain independ system set keyword introduc extra ort keyword automat remov system domain system explor work environ content inform vari chang dynam method work document step weight keyword comput frequenc keyword occurr divid length document document length total number keyword extract document featur vector document repres fv keyword de ned equat assign weight keyword prior knowledg obtain document collect deriv directli document text exibl domain independ system weight scheme account context keyword document ect keyword import remov common stem word identifi bigram term frequenc document frequenc weight scheme tfidf scheme vector space model inform retriev literatur base term import proport occurr frequenc term document proport total number document document collect term occur assum keyword fewer document discrimin document keyword smaller document frequenc assign higher import larger document frequenc weight keyword document product term frequenc tf document frequenc idf shown equat tf idf log df number document document df document frequenc term document frequenc term de ned number document document collect term term frequenc tf number term occurr document avoid favor long term frequenc normal divid length document equat measur featur vector similar state similar measur requir determin close document interest similar measur deriv describ proxim vector asymmetr cosin measur cosin wide similar measur measur emploi measur vector similar research cosin similar measur di erenc direct irrespect length di erenc angl vector cosin similar measur calcul cosin angl vector hyperspac de ned fv fv ik fv jk ik jk featur vector repres di erent document total measur cosin similar vector approach featur vector coincid con denc document similar high inform document consid relev queri interest area cosin similar vector space close previou work system system develop learn user pro le ltere vector space model repres document user emploi standard weight scheme previou section signi di erenc system algorithm updat pro le learn process system emploi learn algorithm adopt neural network genet develop hoc approach di erenc system view learn process system increment learn learn process perform tabl di erenc system base learn process learn approach learn process approach increment batch genet algorithm neural network al wiener al menczer al info fab webmat pin anytim inform system batch learn batch learn process perform period time amount inform obtain type feedback learn user interest system user feedback posit explicit implicit posit neg feedback user dislik implicit feedback feedback infer system base user action tabl summar system work di erenc base learn process learn approach di erenc base feedback type learn user pro le illustr tabl ii previou work address problem inform ltere learn user interest di erent pro le learn algorithm di erent perform evalu criteria show ectiv approach squar error evalu criteria commonli describ perform ad hoc neural tabl ii di erenc system base type feedback feedback posit neg explicit implicit wiener menczer info fab webmat pin network approach fit accumul energi typic perform measur system genet algorithm base dicult compar perform system di erenc evalu set di erent data result di erent perform perform evalu criterion subsect describ previou work categor base learn approach ad hoc approach mock develop info filter organiz featur vector repres user interest info intellig inform ltere system reduc user load select interest articl usenet articl system learn automat adapt intern user model content articl collabor user learn process featur manipul techniqu hybrid approach claim improv accuraci keyword support domain knowledg retain system scalabl chen develop agent user ectiv search web webmat track user interest di erent domain multipl vector weight tfidf techniqu domain learn automat user give posit domain categori creat feedback number domain upper limit number domain reach maximum document learn modifi vector greatest similar webmat introduc trigger pair model automat extract keyword document search nement develop adapt system web page recommend repres user pro le singl featur vector weight tfidf method vector weight updat explicit posit neg user feedback weight base type feedback learn document featur vector system extend user interest latest system interfac user manag inform present monitor user click system learn implicit feedback user neural network approach neural network techniqu explor learn user pro le al nonlinear neural network topic spot nonlinear neural network classi er extend logist regress model term interact boundari input space modular architectur lsi improv perform network learn problem set smaller problem rst compon architectur meta topic network train full train set compon set network group meta topic group separ network train corpu correspond meta topic group document meta topic network determin document topic base output local network deploi emploi connectionist model lter articl internet addit system context occur repres user pro le system oper mode rst mode learn sampl document present system mode comparison retriev document sourc ltere user system enter learn phase learn addit interest document connectionist rst layer receiv input articl build intern script structur creat statist analysi word combin frequenc output layer fed input layer layer act supervisor monitor activ rst layer comparison mode neural network techniqu adapt reson associ map incorpor tan person system latent semant index weight techniqu reduc dimens techniqu call singular decomposit person inform network organ inform categori semant similar user pro le model associ inform categori relev factor keyword weight intens level user interest encod directli network weight weight keyword comput normal term frequenc model onlin learn integr ned keyword knowledg singl framework genet algorithm approach success applic genet algorithm learn user interest introduc sheth ltere inform agent develop model popul pro le pro le activ search document recommend close pro le posit neg user feedback chang pro le tness le pro le inform url address inform number group categori sourc system usenet network internet extens develop mouka multi agent ecosystem person inform monitor inform sourc system introduc type inform ltere agent inform discoveri agent inform ltere agent system person track user interest inform discoveri agent fetch inform user interest learn inform resourc type agent evolv mean genet algorithm separ popul relationship interact base simpl econom model inform agent receiv rate directli user depend perform base assign credit inform discoveri agent retriev inform user rate ect tness ect surviv evolv user interest encod featur vector weight tfidf method vector augment inform author interest eld activ keyword ltere agent explicitli speci ed user approach inspir arti cial life theori menczer al evolv agent approach repres user interest keyword agent evolv base energi singl currenc agent die agent simpl cycl receiv input environ intern perform comput act action reduc agent result energi agent perform task averag reproduc colon popul agent energi exce xed threshold produc spring clone die energi reduc depend document present user meet user feedback provid user agent energi limit previou work perform system previou work improv learn user address ectiv approach adapt chang interest work sheth evalu assum user interest approxim chang evalu process real assumpt complet true user interest chang time distinguish interest interest interest result accumul experi long interest interest event basi approach develop sheth mouka address problem genet algorithm ectiv system adapt user requir larg number gener great amount ort user bring system back equilibrium state capabl adapt user interest ectiv interest simultan time unsolv problem previou work chapter iii model learn user profil capabl model learn user pro le heart person agent main research issu design pro le structur learn algorithm adapt chang user interest issu address section discuss underli concept model user pro le structur base underli section present model user pro le inform ltere detail learn algorithm section model user pro le user pro le model softwar agent perform task behalf user analog situat human person assist person observ behavior employ agent approxim model user resembl human person assist task base agent behavior de ned intuit agent learn user interest explicit implicit feedback user agent dislik document recommend explicit agent idea attitud user piec inform model user modi ed user prefer advantag explicit feedback agent con dent inform user action strong posit neg feedback result signi chang pro le feedback user piec inform agent similar inform futur recommend document make similar document present top rank document pose reactiv behavior agent adapt rapid chang user interest strong neg posit feedback agent poss capabl handl moder user interest feedback moder intens pro le updat gradual ect moder neg feedback lower rank document similar content moder posit feedback put similar document higher rank document consist give feedback moder intens level time ect strong feedback disadvantag explicit feedback burden user cognit task research ideal softwar agent avoid task agent infer user interest implicitli observ user action accur infer user interest implicit feedback dicult task requir sophist tool todai tool recogn user facial simpli ed approach develop enabl observ durat user read approach inaccur infer user interest due pitfal method explicit feedback user inevit obtain accur predict disadvantag capabl agent infer user interest implicit feedback make agent friendli person implicit feedback low con denc acquir assum argument list articl sampl sentenc rst paragraph user predict roughli content articl user select read articl infer implicitli interest content articl unread articl period time session articl present consid uninterest base articl user read pro le modi ed learn rate set low avoid ect misinterpret assumpt fail hold assumpt hold low con denc except condit unread articl articl interest happen user busi thing time read articl interest user read articl recommend due instant content articl read user interest anymor give explicit neg feedback beauti approach except condit rare happen chang signi ect user pro le user consist read articl topic time give posit small chang implicit feedback accumul rank articl gradual contrari situat occur consist unread articl user multipl interest categori time interest categori repres domain interest number categori grow shrink adapt dynam user interest area interest introduc agent categori repres interest creat posit neg feedback chang interest level pro le categori categori lt posit descriptor descriptor km wm neg descriptor keyword keyword weight lt descriptor interest level fig user pro le categori dynam interest level categori neg implicit feedback gradual remov user pro le point interest categori cover broad scope case except interest categori structur user pro le basic structur interest categori featur vector consist list keyword weight import featur vector describ area interest part interest categori interest categori posit neg lt descriptor figur illustr structur user pro le scheme posit neg tor maintain featur vector learn document posit neg feedback descriptor maintain featur vector document obtain type feedback descriptor descriptor weight repres interest level descriptor interest categori interest weight lt describ level interest neg descriptor interest categori repres lt neg descriptor describ interest area posit interest addit document counter maintain total number document observ interest categori ag statu provid infer implicit feedback ag statu lag articl interest categori read period session present ag statu categori set articl interest categori read user interest categori written categori hf lag lt lt mention user multipl interest categori pro le user interest categori repres il categori categori pro le learn algorithm model user pro le develop accommod intuit de ned agent behavior earlier inform filter base pro le structur previou ltere process perform select relev document set document document level user interest document content assess match interest categori pro le interest categori assess calcul numer assign document score document respect pro le consid base document rank relev document obtain top rank document document score weight posit score document interest document neg score uninterest document featur vector fv score fv base pro le comput find relev categori user pro le de nition relev categori explain section calcul score descriptor interest categori greatest po fv neg fv long lt lt fv comput nal document score max long po min long neg interest categori posit neg interest descriptor interest opposit nal document score fusion score posit po neg neg interest score longterm interest long contribut posit neg interest depend sign learn user pro le person agent learn algorithm develop research increment learn onlin learn enabl reactiv learn long run learn clariti learn algorithm present descript prior explain detail algorithm learn algorithm learn process person agent reli feedback provid user feedback inform ect user attitud document system intern pro le user feedback incorpor futur ltere feedback consist feedback type document learn fv learn rate feedback type posit neg feedback repres user dislik document content learn rate describ user prefer algorithm learn user pro le de ned find relev categori user pro le fv fv fv end search perform relev interest categori base document learn greatest relev interest categori fall threshold interest categori creat interest categori modi ed feedback document featur vector learn rate person explicit posit neg feedback implicit posit feedback trigger implicit neg feedback trigger system articl recommend measur interest categori relev document categori relev measur match categori pro le categori relev measur similar featur vector document interest categori user pro le emploi cosin relev interest categori document featur vector fv de ned fv fv fv lt fv categori relev maximum similar document featur vector neg descriptor measur relev inform content document document interest updat featur vector reactiv learn requir handl strong feedback ect immedi futur recommend behavior modi cation featur vector interest categori contribut ture vector learn formula modifi featur vector gener handl feedback updat featur vector interest categori perform gener weight lt categori weight fv keyword lt categori keyword fv learn rate descriptor interest categori featur vector document keyword weight incorpor comput learn rate adjust contribut vector depend intens level desir chang rang paramet learn rate strong feedback learn rate implicit feedback low descriptor document featur vector weight keyword incorpor keyword updat depend learn rate modifi weight learn explicit feedback pro le set interest repres di erent domain interest featur vector descriptor interest categori neg repres area interest interest level categori encod interest weight descriptor descriptor repres group interest interest level posit neg descriptor interest level posit descriptor reduc interest level neg vice versa modi cation descriptor di erent posit neg due di erent natur interest chang interest reactiv accommod chang interest short interest chang gradual long feedback fv correspond interest categori modi cation perform updat lt interest weight descriptor unlimit gradual chang captur reluct interest chang learn long bipolar sigmoid logist function consid govern chang descriptor interest weight function rang lower upper limit approach argument valu figur illustr bipolar sigmoid logist govern chang lt function current learn rate current project learn rate ad lt lt lt fig natur chang interest posit feedback subtract neg feedback project back ordin equat implement modi cation weight descriptor posit feedback neg feedback bipolar sigmoid logist exp updat descriptor lt learn document featur vector fv equat set learn rate equat feedback contribut recent learn document smaller learn interest preserv constant set small prevent complet converg limit learn descriptor learn number learn exampl number document descriptor updat posit descriptor posit feedback neg descriptor neg feedback equat learn rate depend intens level feedback updat interest level descriptor depend learn interest level descriptor current ensur descriptor interest weight support reactiv learn interest posit neg feedback comput similar learn document featur vector fv neg descriptor posit feedback posit descriptor neg reduc interest weight descriptor similar vector scheme opposit descriptor similar featur vector close interest weight valu formula fv posit fv neg feedback depend type feedback posit step step modi ed step interest level descriptor posit feedback neg feedback step contribut document featur vector depend number document observ categori learn rate step intens level feedback strong feedback high vice versa posit feedback step reduc interest level neg descriptor interest level posit descriptor reduc due neg feedback learn interest categori ad user pro le featur vector learn document classi ed categori pro le determin document content belong threshold de ned similar learn document descriptor greatest categori relev pro le categori repres interest creat addit exist categori fv featur vector document learn learn rate categori creat creat templat categori set descriptor featur vector learn document set interest level descriptor equat interest level descriptor set initi result lt fv lt posit lt fv lt neg feedback bipolar logist sigmoid function set posit descriptor posit feedback neg descriptor neg feedback featur vector learn document set interest level descriptor equat posit feedback neg feedback initi set variabl assign fv posit fv neg feedback set neg descriptor posit feedback empti vector set interest level descriptor fg posit fg neg feedback idea algorithm clear descriptor assign learn document featur vector posit neg feedback assign posit neg descriptor distinguish type feedback posit posit pro le categori posit descriptor descriptor fv fv fg neg descriptor fig categori posit feedback descriptor set featur vector learn document neg descriptor left empti posit descriptor left empti neg descriptor assign featur vector learn document neg feedback figur illustr step pictori learn implicit feedback unlik explicit feedback result signi descriptor interest implicit feedback ect slightli implicit posit feedback trigger user open read articl present small interest level long term posit descriptor obtain feedback articl weight interest level neg descriptor implicit posit feedback proport similar open document pro le categori posit descriptor descriptor fv fv fg neg descriptor fig categori neg feedback neg descriptor con denc feedback reduct interest level limit small rang step modifi user pro le implicit posit feedback appli learn explicit feedback earlier low learn rate lag set lag period time articl interest categori penalti interest categori trigger implicit neg feedback step modifi user pro le implicit neg feedback lag lag lag paramet approach ag equal set ag penalti result reduct interest level descriptor interest level descriptor fall point interest categori remov pro le chapter iv sensit analysi due complex interact model paramet varieti input sensit analysi conduct analyt analysi result experi observ sensit major paramet present type experi perform observ sensit learn rate chang document rank posit experi perform observ sensit threshold categori result experi model characterist behavior model de ned choic model paramet valu learn rate sensit analysi sensit learn rate answer question posit neg feedback learn rate rank posit document ect system learn html document retriev onlin newspap magazin topic monei document obtain onlin newspap magazin internet busi week document document set step experi observ sensit learn rate posit feedback gener pro le give random posit neg feedback equal probabl document document set rank document base pro le gener step select lowest rank document feedback learn rate observ learn feedback rank document modi ed pro le record rank posit document repeat step di erent learn rate rang experi procedur observ sensit learn rate neg feedback slight modi cation experi neg highest rank document select lowest neg feedback step posit feedback figur show result percentil averag experi di erent document set document set form pick randomli document topic illustr curv smooth transit learn rate learn rate result signi chang rank posit rate chang rank posit constant chang learn rate result give idea learn rate expect ect expect signi learn rate set strong feedback moder feedback learn rate weak feedback learn rate result rank chang learn rate learn rate sensit fig ect learn rate chang document rank suggest infer implicit posit weak learn rate chang pro le slightli signi impact assumpt infer implicit posit feedback fail hold gradual chang user pro le result signi ect user consist interest frequent implicit posit feedback gener ect feedback rank document observ learn rate slight shift rel rank constel document rank chang document show scheme handl except interest categori nice threshold sensit threshold mention determin categori pro le obviou threshold set number document form pro number categori creat set threshold result number categori pro le number document feedback learn process similar instanc base learn techniqu categori pro le deriv document set fewer categori pro le categori requir memori maintain lessen process time feedback learn inform ltere problem learn long run document learn tradeo process time learn accuraci consid analysi observ sensit threshold conduct answer question threshold categori gener learn document document feedback sourc cover broad categori learn rate chosen randomli equal probabl set learn posit neg feedback document gener pro number categori count experi repeat threshold valu rang figur summar result averag experi threshold ordin express ratio number categori pro le number document feedback small ratio obtain threshold threshold rate categori document il fig ect threshold categori threshold lower ratio linearli slow threshold approach threshold chapter person agent chapter describ implement person agent descript implement includ agent function detail process agent compon person agent architectur figur show gener architectur person agent consist main learn meta search engin user interfac compon resid web server user interfac partli client site type data user pro le meta document retriev explor collect web page onlin newspap magazin activ compon initi schedul run background process schedul determin retriev start collect onlin newspap web page retriev document internet document ltere system user pro le person web page rebuilt user meta inform select document store local repositori document delet learn modul build maintain user model creat user initi pro le ned topic provid user lling subscript form base user explicit implicit feedback recommend learn modul modi es user model model adapt user interest feedback learn local repositori retriev onlin newspap magazin schedul learn modul user pro le user interfac user meta search engin www search engin fig architectur person agent system posit neg con denc meta search engin provid architectur user explor interest exist search engin search user open web page provid meta search engin give explicit feedback system learn content web page user interfac manag interact user system server creat html interfac convei inform messag system user vice versa internet browser internet redirect messag internet user system compon client site user user interfac mean user send messag give read fig main entri person agent agent function front page shown figur agent set topic weather gener user topic list relat articl rank base similar articl topic topic system ned pro le structur system user pro le user provid feedback articl provid gener user interest regist user sign system articl provid feedback system system learn interest function main entri meta search engin search inform world wide web di erent type search engin internet user page subscrib obtain regist user sign open person page fig person page regist user log person page present user illustr figur page list titl sampl sentenc extract earlier paragraph articl articl titl order match user pro le articl titl number repres system predict interest level user articl top page pointer articl list ned topic util util user displai pro le link pro system rebuild person page base latest pro le link rebuild rst articl input form provid search page meta search engin di erent search engin altavista user search engin user open implicit posit feedback system automat user read list ned user comment provid top user window enabl user give explicit feedback articl read comment list show articl strong posit feedback moder posit feedback weak posit feedback moder neg feedback show articl strong neg feedback addit system send neg implicit feedback user pro le show read learn activ period time agent compon implement implement agent compon program tool includ perl html html interfac interact user user browser perl script pass inform user browser agent compon languag implement learn modul meta search engin retriev retriev period retriev articl onlin newspap magazin modul run background process retriev process internet initi schedul start schedul load retriev schedul de ned le le appendix inform entri url maximum depth type sourc weekli time retriev entri process start depth level explor site perform html document link depth limit reach base explor link depth level repres document provid onlin sourc accept time explor depth level result long retriev process explor visit site record avoid retriev site process manner site explor document retriev link document quick check perform determin document articl simpl heurist appli detect exist long paragraph document minimum charact paragraph tag set minimum paragraph length exist elig articl document remov document onlin sourc step extract content retriev document html java script inform link remov document process extract content inform document link output process head paragraph articl text le format occur html document inform remov part content articl copyright stage convert plain text articl document featur vector common word remov stop list appendix number word stop list prototyp word extract word stem porter stem word frequenc count perform occurr phrase detect count phrase identi ed detect occurr success word word count featur vector document obtain normal word phrase frequenc count featur document sampl content rst long document url address save meta document appendix stage perform retriev score rank document pro le user score document calcul base pro le top document order document score inform gener person page user sign system retriev document process retriev document onlin sourc mark statu ag explor schedul wait retriev schedul learn modul main task learn modul learn user pro le adapt user interest mention system learn pro le user user explicit implicit feedback explicit posit neg feedback obtain user comment implicit posit feedback user browser user open document person page learn implicit neg feedback trigger perform dai begin process initi pro le user creat base inform provid user registr process subscript user list interest chosen option cover interest categori health world interest system featur vector acquir averag featur vector document categori featur vector build initi pro le user submit complet subscript form learn learn rate strong explicit feedback set ensur learn similar document futur ltere process score high posit feedback low neg feedback learn rate moder explicit feedback set moder user pro le learn rate set weak posit feedback slight chang ect feedback give ect gradual chang implicit posit learn rate modul process sourc document learn meta document system local repositori web page internet feedback document provid system feedback search result meta search engin meta search engin search meta search engin carri send search command search engin internet search result state ve di erent search engin construct meta search engin di erent search queri syntax di erent format search output separ code written search engin queri search output search engin receiv meta search titl url address custom meta search engin output gener custom small code insert link web page link invok perl script gener frame feedback control user rate document search result system learn document user interfac modul client user interfac form html document run user browser interfac browser user open front sign person send search open give feedback user interfac code static dynam gener server user interfac consist perl script activ user interfac user browser script inform user process user request request process subscript form user open person search web valid user identi cation handl util command content user pro le rebuild custom page base latest pro le script work independ invok learn modul meta search engin process process user registr front user subscrib obtain account person page featur subscript form issu user complet time registr inform suppli user identi cation option user provid list ned interest categori user prefer user press submit inform form server script le invok script inform check valid user identi cation password inform provid subscript form valid user identi cation uniqu password inform ad user tabl store oracl process registr form continu extract user interest inform invok learn modul creat user pro le ltere process process subscript form user noti ed open person page regist person page open provid valid user identi cation password valid perform cross check user tabl problem person page creat person page creat output obtain retriev list titl sampl content order user prefer titl articl link open articl small code insert link invok perl script script gener frame feedback control user browser handl user feedback user open articl click titl articl person frame region gener user browser top client feedback rest client area displai articl bottom user scroll articl ect feedback control top frame feedback control ve di erent rate provid user feedback rang strong posit feedback left strong neg feedback small code encod comment identifi type feedback document identi er feedback document identi er meta document store system local url address web page open bottom frame click comment invok perl script server process user feedback similar perl perl script feedback process rst feedback inform user browser learn modul invok process messag user end process user ect feedback click rebuild profil link perform search request search process invok search form page user browser perl script handl search process invok user press button search form search process perform type search engin speci ed user user search user queri search engin invok meta search search result back user browser search engin search engin queri sequenti search result merg result output previou search engin search engin queri chapter vi perform evalu perform evalu conduct measur perform scheme learn algorithm perform measur depend approach di erent techniqu di erent perform evalu criteria di erent experi procedur rst section chapter describ criteria evalu perform model procedur perform experi criteria evalu intend observ behavior model learn algorithm di erent perspect result result perform criteria analyz perform evalu criteria di erent perform criteria emploi measur observ behavior scheme criteria spearman correl averag document recal experi basic involv ltere set document learn pro le compar select target pro le avoid term de ned user pro le denot target user pro le model system system user pro le refer user model learn system document set involv comput de ned denot set document recommend system denot set document sourc document normal perform measur ltere document set repres document set prefer target user pro le set pref ltere number document document set pref accuraci accuraci refer number document user system document set document set comparison pref ltere refer formal de nition accuraci express equat pref pref user system rate document highest rank document accuraci de ned percentag document document chosen user system normal perform measur shown user studi human judg consist time make rel judgment absolut judgment measur distanc rel rank user system rank measur de ned refer pair document rank rel rank pair document set document evalu deriv numer valu obtain system rate comput equat prefer relat set document repres di erent document pro le rate rank predict target user pro le rank predict system user pro distanc document respect rank de ned base user system partial order distanc rank document pair user system order pair contradict order document pair rank distanc full measur obtain sum distanc rank document pair normal divid total number document pair document set perform system base measur approach spearman correl coecient rank document ds base user rank document ds base system rank spearman correl coecient de ned equat coecient deriv distanc ordin rank user system rank perform perfect order user system rank coecient coecient result rank opposit order rank correl advantag robust resist unanticip defect data averag document score document score repres rate pro le document evalu document score raw score deriv directli equat rang neg posit score document uninterest interest interest human user approxim user pro le model target user pro document score ect absolut judgment user document set document perform measur base averag document score fv averag document score comput document recommend set document score perform user perform base averag document score approach versu recal versu recal typic perform measur inform retriev system procedur evalu perform measur di erent earlier tabl iii describ paramet comput recal assum relev measur binari valu base recal comput tabl iii paramet recal relev irrelev retriev retriev recal number relev document number retriev total number relev document document collect de ned portion relev document retriev recal refer portion relev document retriev total number relev document document collect retriev document measur recal rang adjust paramet lower vice versa methodolog procedur experi figur illustr procedur evalu model perform arti cial user place human user advantag arti cial user fold ensur user consist rate document relev base pro le cut evalu simul user feedback scenario target user pro le gener feedback evalu document system system user pro le learn feedback evalu document rank document retriev document document collect retriev document fig diagram experi procedur time month human user believ model adapt dynam user interest simul adapt human user real world inform sourc figur show procedur measur model perform base system spearman correl averag document score step experi detail step gener target user pro le randomli set system user pro le empti pro le rank document document collect target user pro le select highest rank document ext retriev set document select document randomli document collect rank retriev document system user pro le select highest rank document measur averag document spearman correl cient document set target system user le rank retriev document target user pro le select highest rank document pref measur accuraci system predict document set pref give feedback provid posit neg exampl document set ext pref system learn feedback modifi system user pro le step time invert target user pro le step document collect experi articl html format collect di erent onlin newspap magazin di erent time collect document di erent gener world nancial technolog sport length document vari averag number distinct term document remov html stop identifi bigram target user pro le step gener provid feedback initi empti pro le randomli chosen document document collect number feedback gener target user pro le vari equal probabl set posit neg feedback random learn rate target user pro le approxim system start empti system user pro le step document document set select randomli document collect step perform evalu cycl simul chang inform content onlin newspap magazin document set gener step repres person articl ltere system user pro le measur accuraci system document set pref gener rate document set target user pro le pref repres document set prefer user document set percentag document pref accuraci system predict user inform perform criteria measur document set step document feedback system system explor user explor system recommend document articl ltere system speci user base system user pro le user di erent set document inform sourc system explor document articl retriev system base system ned pro le prefer user part system recommend document pro le cover topic intend gener user world user explor document articl search user internet meta search engin feedback sourc repres document set pref ext system learn user interest user good feedback scenario requir guid system approxim user model step rst evalu learn target user pro le invert scenario intend observ adapt system signi chang user interest target user pro le perform swap posit neg descriptor interest chang sign interest level descriptor scenario feedback scenario feedback design ect behavior ideal human user teach system learn interest system reli user feedback modifi user feedback determin system approxim target user pro le ectiv user plai import role guid system learn user model feedback scenario feedback paramet feedback type posit document evalu learn rate feedback type depend user judgment document interest document base user point view classi ed document posit feedback categor neg feedback signi canc document determin intens level system learn user interest relat document provid document match current user hot learn rate high user dislik document similar document high learn rate neg feedback type similar document user sourc document feedback import consid system learn ectiv document posit feedback obtain document set provid system document set gener system user give posit feedback document set introduc concept uninterest document suppli system good system learn neg feedback system identifi document categori user model neg interest rate document similar categori low neg feedback system recommend user teach system neg long system posit user model system maintain document set system recommend interest document sourc recommend system speci user good sourc posit feedback system learn concept cover current user model document sourc ectiv feedback user found document set manag system feedback system learn broaden scope interest topic current system domain import aspect user judgment document document recommend document set system learn give feedback high learn rate document match current user demand system learn low user sati ed system perform probabl give feedback occur low algorithm feedback scenario scenario develop handl di erent feedback sourc rst scenario document feedback system recommend algorithm rst scenario comput averag document score averag score posit step equal probabl score lowest rank document give neg feedback learn rate score highest rank document give posit feedback learn rate pick document posit document score randomli give posit feedback learn rate give neg feedback lowest rank document learn rate score highest rank document give posit feedback learn rate end user satisfact fig relat user satisfact learn rate learn rate step deriv function figur exp function chosen captur relat user satisfact system learn neg feedback user satisfact level learn rate set high equat low learn rate user satisfact level high step learn rate deriv directli score document feedback base target user pro le scenario provid feedback obtain system user explor step algorithm scenario comput averag document score document score fig relat document score learn rate set probabl give deriv equat pick highest rank document document set probabl give posit feedback learn rate probabl provid feedback occur set refer user satisfact feedback user satisfact level high probabl low learn rate posit feedback set equat figur exp equat chosen describ relat paramet perform comparison compar perform algorithm learn user pro le emploi webmat system base line algorithm chosen reason similar user pro le pro le webmat list interest repres di erent domain interest featur vector weight tfidf interest categori webmat repres model approach cluster train exampl base greatest similar learn interest categori di erenc cluster strategi webmat develop thesi cluster creat base threshold unlimit number cluster webmat xed cluster learn creat number cluster pro le upper limit detail algorithm learn user pro le webmat adapt perform comparison html document remov html delet stop stem word identifi bigram weight extract keyword tfidf calcul cosin similar vector vm vector greatest similar comput posit neg feedback sort weight highest element make algorithm compar develop phrase identi cation ad origin algorithm reward keyword document titl header appli origin algorithm elimin modi ed algorithm import di erenc webmat origin design learn neg feedback make comparison version system implement learn neg feedback perform subtract featur vector learn document match categori pro le denot modi ed algorithm learn posit neg denot learn posit feedback refer algorithm develop research result result section averag consist evalu figur depict accuraci model threshold keyword keyword weight tfidf obtain highest keyword document remov stop word base perform peak achiev threshold degrad higher threshold valu tendenc bit threshold fig accuraci model threshold expect threshold valu perform higher threshold undesir due larger size pro le result good coincid perform versu memori requir tradeo requir determin threshold tabl iv describ accuraci model di erent number keyword repres area threshold set column averag accuraci rst evalu repres perform pro le tabl show perform peak obtain number keyword perform degrad number keyword fewer keyword remov import keyword includ unimport keyword tabl iv accuraci model di erent number keyword number pro le pro le averag keyword condit result inaccuraci document content base perform comparison number keyword repres document content limit keyword maximum number cluster model set threshold scheme result threshold sensit experi chapter appli feedback evalu cycl base feedback trial model consist evalu threshold result pro le number categori close scheme end evalu addit compar perform experi intend observ perform model di erent weight normal term frequenc tfidf perform plot di erent threshold valu perform threshold averag evalu trial rst twentieth evalu count feedback system system learn rst system pro le empti twentieth system learn signi chang target pro le perform measur accuraci figur illustr perform comparison model base accuraci evalu criterion perform system emploi approach interest categori outperform model illustr figur model tfidf weight scheme normal term frequenc threshold figur show perform scheme rapidli rst feedback steadi state di erent set document set provid document learn introduc document interest learn rst perform drop lowest valu due base experi signi chang user interest target user pro le invert adapt sudden perform reach stabl state target user pro le perform high trend perform end evalu accuraci evalu perform evalu fig accuraci system recommend accuraci threshold perform evalu tfidf fig averag accuraci model phenomenon ect learn target pro le invert interest level descriptor neg pro le invert ort start empti pro le posit neg descriptor system adapt quickli sudden chang document descriptor prohibit reactiv behavior due slow descriptor interest level bipolar sigmoid function govern chang descriptor work repres reluct system chang long run learn process role interest inhibit system adapt chang interest clear observ result model special treatment behavior system adapt slowli chang interest learn long run compar signi canc scheme obviou user interest chang suddenli model adapt quickli chang interest model learn posit feedback adapt slowli improv achiev model learn neg feedback perform model addit experi experi run di erent document sourc feedback previou result di erent sourc document set system system explor user explor trial perform feedback sourc system recommend system trial document system tabl accuraci model di erent document sourc feedback feedback sourc tfidf normal tf random pro le system recommend system explor user explor tabl vi accuraci model di erent number recommend top top top tfidf normal tf random pro le set threshold result experi shown tabl signi perform drop result experi document set system recommend highest perform achiev includ sourc experi vari number articl recommend system result shown tabl vi perform model tfidf weight scheme number recommend opposit tendenc system perform random pro le random pro number recommend correspond directli probabl document pick document probabl correct evalu perform evalu fig system perform document close result normal perform measur experi result base criterion shown figur perform base criterion model model errat result model measur explain learn system perform criterion improv signi due system user pro le modi ed design rel rank user interest longterm descriptor maintain averag learn document featur vector posit neg descriptor reactiv potenti forget threshold perform evalu tfidf fig averag perform model featur vector learn previou feedback perform measur uctuat depend current valu posit neg descriptor perform gener random feedback descriptor featur vector highest lowest interest document posit neg interest rank high low necessarili correct order document improv system perform model optim respect criterion criterion shown figur perform model tfidf weight scheme averag outperform normal term frequenc spearman evalu perform evalu fig system perform spearman correl coecient spearman threshold perform evalu tfidf fig perform model spearman coecient spearman correl coecient figur show result base spearman correl consist criteria perform model outperform scheme explan result evalu criterion illustr figur approach weight tfidf averag document score figur show system perform base averag document score result similar accuraci evalu criterion model scheme learn posit neg feedback outperform learn posit feedback di erent evalu scheme normal term frequenc weight scheme outperform tfidf threshold shown figur versu recal measur model perform term versu recal di erent experi procedur document recogniz topic test set document weather relat topic set document weather relat topic train set identi cation document document le encod repres topic experi procedur gener user pro le give posit feedback document train set document select randomli learn rate avg score evalu perform evalu fig system perform averag document score avg score threshold perform evalu tfidf fig perform model averag document score fig versu recal feedback model set random number sort document test set pro le obtain step rank search document weather topic highest rank document continu search lower rank document document weather topic found found comput recal valu result experi illustr figur averag experi document train set build user pro le experi number document repeat time result show static interest built posit perform model tfidf weight scheme ident suggest model typic inform ltere system degrad perform approach improv capabl approach learn ectiv chang interest earlier chapter vii summari research person inform ltere model user pro le essenti featur model repres current user interest model date main research issu number model algorithm learn user pro le address issu model address issu di erent point view model previou address problem chang user interest solut ectiv handl interest simultan approach feasibl ectiv learn dynam user interest system learn quickli empti pro le adapt gradual signi chang user interest problem adapt interest simultan handl scheme base sensit learn algorithm emploi maintain interest adapt accommod chang interest logic consequ capabl system abil distinguish di erent level interest interest categori scheme algorithm work vector space model improv model obtain term weight scheme base perform evalu di erent heurist show tfidf weight scheme normal term frequenc evalu criteria account document frequenc tfidf heurist feasibl express context term document person agent learn user interest user user plai import role learn process ectiv user awar interest provid relev inform feedback interest user understand system work crucial impli user cognit task teach system learn interest reduc burden infer implicit feedback user action disadvantag result infer implicit feedback minim appli minim chang learn type feedback explicit implicit feedback consid advantag feedback futur work scheme model learn chang user interest current evalu approach feasibl approach person agent implement thesi demonstr lesson learn work develop method inform gather ltere system consid integr part develop applic method work extend direct futur address issu concept inform gather ltere extend scheme abil model learn chang interest due addit inform maintain user pro le interest pro le inform interest inform posit neg interest interest addit extend incorpor descriptor descriptor result interest categori descriptor posit neg descriptor interest addit descriptor intend chang descriptor learn rate nth descriptor posit neg descriptor modi ed learn rate scheme enhanc sound good captur smooth transit interest di erent rang disadvantag enhanc obviou space requir pro le larger question improv result worth price paid size pro answer question requir research experi futur incorpor collabor filter ltere scheme emploi thesi classi ed ltere ltere process base sole content document evalu content extract document match pro le rank match complet di erent approach account design person inform ltere addit ltere approach call collabor social ltere content social ltere bene experi user perform inform ltere number techniqu develop perform collabor ltere techniqu solv collabor ltere problem di erent point view challeng issu area unifi techniqu singl framework scheme social ltere solv unobserv problem issu explor incorpor social ltere nding nice eleg integr social ltere ltere advantag disadvantag question answer switch collabor ltere vice integr approach simultan advantag ltere research answer question extend learn capabl person agent develop thesi learn user pro le base feedback user pro le modi ed system point learn capabl expand learn attribut tendenc inform sourc agent expect identifi inform sourc futur avoid exploit provid interest inform base user pro le ectiv process improv challeng issu due fact inform sourc world wide web heterogen domain unstructur subject chang time direct manipul pro le ltere process develop thesi perform user pro le pro le learn automat user provid feedback learn process semant clue consid extract keyword reli frequenc keyword occurr document result inaccuraci keyword extract document unimport keyword occur user pro le current user control chang keyword provid posit neg advanc ne pro le remov keyword import ad import keyword improv system perform desir provid option advanc user ne pro le directli refer person agent search intern confer autonom st pp acm ny learn system adapt web page recommend phd depart comput stanford palo ca neural network approach topic spot fourth annual symposium document analysi inform la learn user pro le person inform dissemin intern joint confer neural pp ny adapt web page recommend servic intern confer autonom marina del pp acm ny automat creation literatur abstract ibm journal research human behavior principl ort addison weslei ma inform retriev system theori implement kluwer academ ma introduct modern inform retriev ny probabilist analysi rocchio algorithm tfidf text categor fourteenth intern confer machin pp morgan kaufmann san ca index latent semant analysi journal american societi inform techniqu intellig filter thirteenth nation confer arti cial pp aaai menlo ca evolutionari connectionist approach person inform filter fourth irish neural network pp learn approach person inform filter ms depart electr engin comput massachusett institut ma evolv inform filter solut intern confer autonom marina del pp acm ny endogen fit paradigm adapt inform agent workshop intellig inform ps measur retriev ectiv base user prefer document journal american societi inform collabor filter weav inform tapestri commun appendix sourc inform de nition inform sourc daili format weekli format monthli appendix stop list list stop word modi ed stop list obtain internet act ago air amp area aren back began big bodi boi brought call car case copyright didn don door earli end feet felt eld rst ve free gave give god good half heard held high import kind knew larg left made major make make man mind mr mr night number open order page part past pm put real report set show small thing thing thought time time todai turn war white year year york appendix interest categori content interest categori neg descriptor long term descriptor posit descriptor lt secur server solari enterpri nt sun server user nt user system server web manag upgrad base solari bit product network manag system applic exodu window isp data microsoft network java product includ project internet enterpri tool enterpri spider servic sourc gemston secur perform version reliabl enabl disk custom analysi pc le manag data featur map sun microsoft creat winnt relea perform servic internet network base nt report san transact java hardwar internet exodu er version easi appendix meta document number keyword nt server window microsoft zdnet current system offer product advanc link cluster desktop window store microsoft provid price deliveri note window price deviat current nt price offici window advanc server cheaper current vita graduat cum institut obtain bs comput scienc undergradu thesi research area arti cial intellig construct infer engin equat join informat depart institut teach sta member earli award year fellowship ministri educ cultur republ indonesia pursu ms unit state america reach depart comput scienc texa perman address jl indonesia
HCI/1557 4 learn visual model social engag bradlei thad starner colleg georgia institut ga april abstract introduc face detector wearabl comput exploit constraint face scale orient proxim particip social interact method describ wearabl system perceiv wearer begin interact individu system prove accur test wearabl video data captur confer individu captur social data separ independ train test set metric balanc perform face recognit context wearabl interfac discuss recogn social engag user wearabl comput context data determin user interrupt social engag detect incorpor user interfac improv qualiti mobil face recognit softwar user cue face recognit system social grace turn slightli speaker condit recognit favor introduct casual social easi forget ident meet consequ rang reintroduc miss busi contact organ social tag assist memori electron tag rememb contact inform everydai situat tag face recognit system provid associ aid recollect prior interact partner implement system place camera environ user meet acquaint method cost perspect wearabl face recogn implement wearabl function environ special infrastructur face recognit resourc wearer intellig interfac agent implement top system provid associ suggest earlier rhode accur label system inform retriev agent wearabl interfac appli understand wearer context indirectli provid problem solv user system balanc comput human burden wearabl comput interrupt wearer social interact alert wireless telephon disrupt detect social engag block delai interrupt appropri hall defin social feet separ particip segment casual social interact identifi social engag stage social parti exchang desir commun verbal behavior start social interplai scope refer reader hall harrison topic identifi social engag visual featur engag ey pattern chang head social chang visual spatial content relev uncertain featur requir induc set behavior assist comput face recognit wearer align xs displai ey subject recogn learn applic method sampl data extend recognit algorithm includ behavior social engag weak constraint exploit face recognit detect search scale orient limit typic social interact distanc method determin type social interact profit work visual model human interact includ hidden markov model coupl stochast grammar work primarili conduct perspect surveil serv model work hmm stochast grammar moor model complex action hmm success recognit american sign languag gestur locat similar problem exist etholog inspir robot breazeal author code high level knowledg social behavior robot part level hybrid architectur knowledg social constraint enhanc situat awar process video obtain robot ey appli constrain refin successor subset visual inform mann starner describ manual align target face calibr mark overlaid head mount displai user explicitli request recognit align face likelihood sort list candid present wearer human select paper quantifi perform human comput detect recognit detect load human processor algorithm detect recognit desir vetter mobil system militari polic identifi crimin present system combin commerci face recognit softwar variabl bandwidth infrastructur limit notabl fail vari light condit common mobil usag al method wearabl face recognit prototyp test data acquir wearabl comput system address discuss algorithm perform bandwidth problem central mobil comput face recognit algorithm literatur consid potenti solut task recogn social engag context human behavior environ face presenc import featur segment engag face detect consist search scale toler plane rotat prior work hmm face detect model face recognit face detect hmm work demonstr feasibl hmm face recognit detect scale perform background model classic detect background content examin standard face found background content variat scene obtain camera everydai life highli vari scene background current gener detector due search scale low posit rate import interfac comput price special hardwar gener unaccept algorithm comput reason chanc face exist fine grain local requir detail comparison metric decid method satisfi interfac requir engag dataset face detect face recognit dataset construct goal understand separ face background separ ident face imag face collect control camera orient clear result deriv previou experi applic environ everydai human interact occur collect video data wearabl camera academ set repres social interact wearer acquaint captur environ highli unconstrain rang direct sunlight darken confer hall figur repres data set figur mark user align face captur apparatu mate subject captur time hour captur video imag figur locat video annot wearer face assembl prototyp wearabl camera system acquir preliminari test data figur apparatu consist color sensit black white ir digit record video charact audio tone ion batteri dv charact tone camera dsp system camera head mount infrar illumin mount plastic helmet stabil captur infrar sensit camera infrar emit illumin night time captur oper data captur confer make illumin sunlight light provid ir radiat captur output camera split video distribut amplifi displai ey head mount displai signal annot charact space center horizont top video frame copi signal save dv tape captur face wearer approach subject align person ey charact charact repres locat subject ey video feed mark len focu ideal calibr footag normal distanc subject mark wearer push button inject easili detect tone dv deck audio channel recoveri audio tone serv marker train method result video data automat extract partit divid class frame annot wearer class engag due fact wearer annot highli filter remain facial interact misclassifi edit protect privaci experi number engag gestur hour interact smaller number exampl garbag class time window select base prior belief engag time window approxim half wearer line xs ey view presenc face safe frame subregion dv frame annot locat video face present engag larg respect subregion convert correct imag pixel subregion gaussian reduc size imag pixel featur vector consist element model face class state hmm shown figur class complex model requir state ergod model captur interplai garbag type scene shown figur plot valu state output probabl presenc face import accept engag model state rough blob state repres align portion gestur final state sharper featur state consist engag class imag horizon dark light scene complex model wider variat scene loss accuraci clear environ viewpoint deriv model structur user locat specif model deriv adapt improv gener detect strategi singl user learn model refer visual model locat accuraci result shown tabl matric tabl tabl tabl accuraci engag detect experi train set independ test video stream figur engag class figur class tabl matrix engag detect train data train engag engag evalu metric separ face recognit wearabl batteri life processor speed result specif evalu criteria system leverag detect social engag compar continu run face construct wearabl face recognit system engag combin social engag detector local tabl matrix engag detect independ test data test engag engag face recogn cost social engag detector small larger cost local recognit inequ total resourc fix cost run engag detect fix cost run recognit method rate suppli respect detector frame determin fraction posit fp multipli maximum input frame rate rate user ident ui equat fp ui note fixat camera true face frame deliv face recogn assum user updat quickli repeatedli ui assum rate posit greater rate user leav fp comparison assum averag time frame process local recognit process repres multipl averag detect time multipli determin maximum rate posit face detect process fp note local recognit process run faster face detect process situat impli perform face detect separ face local recognit save process time local recognit run continu realtim face recognit primari posit rate fp solv equat determin maximum time local recognit process compar detect process fp fp set heurist determin separ face detect face local recognit profit discuss applic appli metric previou section fp solv recognit method time slower engag detect method limit frame rate frame detect algorithm run knowledg princip compon analysi base face recognit align run faster roughli time feel engag detect success foundat wearabl face recognit output detect elimin posit recognit due final state output method provid reason estim locat fine grain local begin model modal engag behavior engag detect failur modal discount addit sensor user selker discuss ey fixat ey fixat social engag parti meet time meet sound provid modal detect social engag person utter common social engag simpl rang sensor sonar ir mount camera determin presenc object social interact distanc trigger activ camera classifi detect head interest indic reduc posit applic technolog face recognit wearabl platform aid protect militari law enforc field provid personnel abil conduct comparison view subject record crimin tool ideal augment poster visual reduc human reduc time reduc legal cost directli aid border patrol system configur function daylight night medic benefit realiz peopl restor abil learn recogn face directli system associ larg number face salesperson politician suddenli recal person previou salient interact final creation attent manag protect wearer stimulu overload detect context kei handl cellular phone intellig fashion examin publicli face face detect recognit wearabl comput significantli scenario larg variat camera posit occur situat tradit system exploit constraint user environ improv accuraci detect platform built captur data wearabl user perspect detail method engag detect wearabl comput present metric determin separ face recognit detect recognit compon profit architectur standpoint construct prototyp face recognit wearabl detect engag method order valid initi result deriv wearabl data refer scassellati humanoid kind tool ieee intellig august ullman face problem illumin direct pattern analysi machin juli resnick thing augment tag ibm system social constraint anim vision ieee intellig august vetter integr portabl system suspect identif track assess technolog law visual augment memori fourth intern symposium wearabl ieee fast accur face detector base neural network pattern analysi machin januari hall silent languag empir studi orient share workspac interperson space collabor technic report ontario distinct descript face process british machin vision page septemb wearabl face recognit aid confer signal process grimson video surveil interact cvpr workshop visual fort novemb ieee perona find face clutter scene random label graph match inter confer comput mann mediat wearabl applic disabl tr mit media februari face color research electron martinez ar face tr june moor recognit action context phd georgia institut hidden markov approach face detect recognit phd georgia institut august pentland statist model human interact cvpr workshop interpret visual page santa ieee pentland ubiquit wearabl comput pattern analysi machin jan turk experi eigenfac peopl august psycholog imag collect stirl reev face interest motiv rhode mae inform retriev agent ibm system journal special issu mit media kanad neural face detect ieee transact pattern analysi machin januari starner find locat omnidirect video wearabl comput platform intern symposium wearabl octob ieee harter stochast model human face identif ieee workshop applic comput decemb ieee schneiderman kanad probabilist model local spatial relationship object recognit comput vision pattern page juli schneiderman kanad statist model object detect appli face car comput vision pattern recognit june martinez ey motion detect interfac starner symbiot interfac wearabl face recognit workshop wearabl august lawrenc erlbaum pentland augment realiti wearabl comput presenc special issu augment starner pentland american sign languag recognit desktop wearabl comput base video pattern analysi machin decemb pentland visual contextu awar wearabl comput intern symposium wearabl sung poggio learn human face detect pattern analysi machin januari
HCI/1558 4 detect track facial featur video sequenc schmidt de campo roberto cesar junior creativ vision research group depart comput scienc paulo brazil abstract work present real time system detect track facial featur video sequenc system visual commun virtual intellig statist model segment region imag presenc absenc face region verifi mean ey base effici templat match scheme face lip corner locat facial featur track imag perform real time process introduct detect track face facial featur video sequenc fundament challeng problem comput vision research area applic face identif gaze present real time system perform facial featur detect track imag sequenc interest develop intellig interfac system step give comput abil good improv interact approach detect presenc human face imag gaussian distribut model gener mean set obtain color face input imag compar gener model order identifi face region presenc absenc face region verifi ey detector base effici templat match scheme biolog evid ey plai import role human face detect face lip corner locat track video sequenc system fast robust small face pose rotat variat remaind paper organ section review techniqu relat work section describ statist model lectur note artifici vol pp april press section explain segment region section describ ey detector perform face verif process section detect track facial featur obtain result show section section address research direct relat work automat detect facial featur video sequenc face detect frame approach detect face static princip compon analysi cluster neural net techniqu obtain good detect alarm comput achiev perform silva al call edg pixel detect track facial featur video sequenc method base fact higher edg concentr observ vicin facial slightli featur edg concentr observ spite method fail presenc clutter system perform face detect track imag sequenc process color faster process facial featur color orient invari light condit properti make motion estim easier translat model work yang alex waibel present statist adapt peopl light condit work extend detect track face real time achiev rate workstat canon camera oliv al darrel al obtain good result detect track peopl real time yang present method similar detect track facial featur imag sequenc main differ lie face verif process iter threshold search pupil adopt effici templat match scheme detect ey model statist model gener mean set obtain color face face imag imag obtain peopl ag vari illumin condit figur illustr train region select rgb store train cluster color illustr figur common peopl differ significantli due exist race occur larger differ bright intens color reduc varianc cluster intens color chromat color figur illustr cluster chromat space fig select region fig cluster color space fig cluster chromat space distribut chromat space approxim gaussian model avg avg avg avg bb ba ab aa gaussian gener train illustr figur fig gaussian model imag segment segment process consist identifi region input imag frame video base gener model pixel input imag convert chromat space gaussian imag gener intens pixel imag repres probabl figur illustr process pixel present stronger identifi region threshold process threshold chosen empir due distort input result threshold gener region spuriou pixel binari imag order solv appli morpholog close oper obtain blob median filter elimin spuriou pixel figur show obtain binari imag threshold result morpholog close oper median filter fig identif fig threshold morpholog close median filter boundari region determin region grow algorithm binari imag region size imag size elimin structur aspect consid region present face structur remov show method decid detect region correspond face verif process main goal identifi region input imag reduc search space face import note detect region face correspond part human correspond object color similar skin verifi presenc absenc face detect region accomplish ey detector base effici templat match scheme worth biolog evid ey plai import role human face detect ey templat illustr figur resolut grai level fig ey templat ey detector procedur convert region order perform templat match import properti techniqu ey templat resiz skin region size exist method templat scale accomplish detect work poggio templat scale detect ey imag method obtain good comput suitabl real time process method estim person ey resiz ey templat templat match perform upper portion detect region correl coeffici comput posit skin ey templat imag patch specif posit skin region function cov equat return covari correl coeffici assum valu rang threshold determin decid ey detect ey found report presenc face system detect facial featur proce track section import note strategi detect frame face frontal view detect track facial featur face system proce search lip corner facial featur track video sequenc approach similar work yang search pupil assum frontal view face locat pupil dark pixel satisfi geometr constraint lie ey region detect templat match search lip corner approxim posit lip corner posit face pupil small region point extract sobel horizont edg detector appli approxim horizont boundari lip determin comput vertic integr project horizont edg intens function horizont edg width height search approxim left boundari lip locat exce threshold fall threshold averag project vertic posit left lip corner simpli locat search pixel column left estim boundari lip search region search similar search locat search dark satisfi geometr constraint search region restrict area pupil lip figur illustr detect facial featur fig detect facial featur track track pupil video simpl pixel find search window posit order track lip detect process perform small region lip corner posit obtain result real time facial featur tracker obtain good result video sequenc frontal view face detect perform procedur ey templat scale incorrectli estim case occur skin region human bodi hand occlud object note face miss small strong vari illumin face detect procedur proven robust identifi peopl ag gender worth region smaller person face light skin face facial featur locat track imag sequenc face bigger face consid track verifi system fail larg movement perform person due vari featur miss sequenc track modul show robust small face pose rotat variat figur show track process frame imag observ fig track process paper real time system detect track facial featur video sequenc statist model detect region effici templat match scheme appli report presenc absenc face region detect lip corner locat track imag sequenc system teleconferenc interact futur work includ pose estim head track posit lip corner intend improv system robust develop recoveri modul motion accuraci detect track facial featur acknowledg roberto cesar jr grate support campo grate grate carlo hitoshi morimoto discuss refer moghaddam pentland recognit modular proc automat system identif inspect spie vol juli moghaddam pentland visual learn object intern confer comput pp june sung poggio learn human face paper baluja kanad face ieee transact pattern analysi machin vol pp januari track facial proc spie visual commun imag taiwan lu waibel model cmu cs technic yang waibel face proc ieee workshop applic comput pp pentland lip face tracker facial express proc comput vision pattern recognit darrel pentland track human proc vol pp yang track multimod human comput poggio featur versu ieee transact pattern analysi machin vol pp octob
IR/1559 5 system genom annot keith carl denni michaud comput inform scienc depart de abstract growth genom express exemplifi human genom fertil domain applic inform gather technolog hundr econom import organ studi requir effici autom analysi tool multiag approach provid paper give progress report decaf toolkit build reusabl inform gather system bioinformat briefli summar bioinformat classic applic inform decaf support recent extens underwai support analysi path genom inform introduct massiv amount raw data gener biologist sequenc organ raw data analyz applic comput program public web typic raw data valuabl deriv knowledg remain gener unavail publish natur languag text journal articl import note tremend amount genet materi similar organ fruit human mean biologist studi figur gene biologist guess similar gene organ plai similar role huge popul sequenc data function annot sequenc routin compar sequenc clue function larg amount work bioinformat past ten year develop algorithm support work gene function biologist web combin publish site special inform topic protein motif work support nation scienc foundat grant comput scienc problem larg set heterogen dynam chang inform bring bear biolog problem determin genom function biologist produc thousand function case largest sequenc hand singl research student inform gather system lot contribut effort featur make approach problem inform distinct inform content inform content constantli annot work gene biologist make find wide retain control type analysi sourc data constantli system toolkit base retsina taem construct prototyp system autom annot storag sequenc data result system elimin tediou hand make data annot research agent level queri process web site initi open natur multiag solut expand system wai make biologist studi wai paper briefli describ approach inform base work decaf initi annot extens function est metabol pathwai reason decaf decaf agent toolkit creat system tool develop specif prototyp inform gather system intern architectur decaf agent design oper set servic soft execut agent action decaf consist set defin control modul concurr work concert control life cycl core task structur share control modul meant agent develop quickli api approach programm creat orchestr architectur agent action section discuss intern architectur gener discuss tool middl system debug inform extract agent built implement inform gather system intern architectur decaf shown figur modul run thread detail decaf implement found plan file incom kqml messag incom messag queue agent initi task templat pend hashtabl action queue domain fact belief object queue task queue outgo kqml messag decaf task control structur agenda queue dispatch planner schedul executor action result queue fig decaf architectur overview action modul decaf support info gather decaf core intern architectur support secondari user util decaf plan includ altern chosen dynam runtim depend user constraint answer resourc constraint decaf support build inform gather system provid middl agent shell quickli build inform extract agent wrap web site agent server essenti compon agent commun work fashion similar dn resolv agent host port address matchmak serv assist agent find servic task complet broker agent act kind assist agent collect servic broker provid larger servic singl provid manag larg group agent effect proxi agent web page java applet commun decaf agent locat server applet agent manag agent ma design entir run set agent spread internet share singl agent server design queri statu individu agent watch record messag pass traffic inform extract agent shell main function inform extract agent fulfil request extern sourc shot queri price monitor extern sourc period inform price ibm monitor sourc call inform monitor request price ibm function written gener code share agent domain iea oper inform gather extern inform sourc agent set wrapper wrapper induct algorithm stalker extract relev inform web page shown exampl inform gather store local iea java wrapper parka make fairli easi forc difficult part problem back kb ontolog product tool wrap web page dynam answer queri page annot make site wrap easier syntact solv ontolog project decaf system genom analysi tool put creat prototyp system type genom analysi chosen simplifi queri subsystem materi annot remov sophist queri plan reason simplif work fairli small genom gene larger organ construct consensu explicitli figur show overview system overlap organ basic sequenc charg integr remot gene sequenc annot sourc gene sequenc local manag agent complex queri web interfac function annot collect inform make inform guess function specif gene ontolog fourth est process enabl analysi express sequenc tag produc gene sequenc annot organ import featur note annot analysi servic organ specif result system build queri organ origin subsystem annot simpl queri built annot newli sequenc turkei compar sequenc work begin build chicken extend depth kb viru clinic organ transplant patient sequenc addit applet proxi agent sequenc sourc process agent iea iea annot agent basic sequenc annot iea function annot applet proxi agent ontolog reason agent info extract agent iea ontolog agent genom db iea user queri applet proxi agent queri process agent function annot queri sequenc iea est entri proxi agent est process process est consensu sequenc fig overview decaf system genom analysi basic sequenc annot queri process figur show interact detail basic sequenc annot queri subsystem describ agent retsina classif sequenc addit applet independ task agent annot agent info extract agent info extract agent user queri applet proxi agent queri process agent sequenc sourc process agent task agent info extract agent interfac agent matchmak agent agent server agent local local local local manag agent agent manag agent agent inform extract info extract agent agent fig basic annot queri agent organ inform extract agent agent base iea shell wrap public web site wrapper primarili suppli sequenc similar gene world answer give biologist clue function gene biologist function chang answer queri wrapper primari protein motif pattern search view protein string amino motif regular express match part string kind function protein motif place protein modifi translat addit group wrapper access system estim locat encod protein wrapper access inform encod protein domain similar motif larger move resourc wrap level biologist local manag agent slightli member class unlik iea store data agent messag queri extern data sourc annot genet inform queri answer updat raw sequenc data indirectli user sequenc addit interfac automat annot control annot task agent queri separ research limit comput knowledg creat sharabl annot sequenc exist wrapper analysi tool necessarili download instal modern relat data storag back end queri limit kb inferenc task agent domain task rest gener middl agent earlier annot agent direct inform annot sequenc store raw sequenc make queri wrap web store indic proven data annot sequenc sourc process agent raw sequenc data format output typic sequenc estim program store main function agent test input intern consist interfac agent interfac applet commun proxi agent agent system orient ad sequenc local queri complet annot kb multipl interfac scratch surfac queri big problem biologist comfort complex queri languag simpl interfac simpl conjunct disjunct queri dynam menu annot applet runtim actual local advanc compar exist public site textual keyword search function annot subsystem assist biologist difficult problem make function annot gene million gene sequenc fairli comput function simpli free natur languag descript fairli larg group repres primari organ creat consortium dedic creat gene ontolog annot gene function basic biolog process gene plai molecular function gene cellular local subsystem support ontolog biologist sequenc ad eventu lead power analysi result kb inform extract agent gene sequenc bank wrap gene sequenc mu organ part gene ontolog spent time make proper function annot find close homolog unannot gene annot homolog annot gene task agent task ontolog agent fipa ontolog agent specif start point ontolog agent ontolog map term iea ontolog agent map term record term organ db iea agent map ontolog descript string actual uniqu id servic provid ontolog agent explicitli mention fipa ontolog agent ontolog reason agent term relat ontolog ontolog reason agent queri build minimum span tree term return homolog organ inform displai inform graphic biologist interfac agent interfac agent function interfac consist top pane displai gene bottom displai gener homolog natur languag annot pane displai ontolog molecular cellular mark color homolog organ est process broaden applic system accept kind basic input data annot process broaden reach system start est sequenc complet sequenc agent wrap standard softwar creat sequenc point exist system est part approach sequenc directli sequenc genom method produc short sequenc partial overlap find overlap short eventu reconstruct entir sequenc express gene approach reli statist sheer number experi eventu produc complet sequenc side effect inform produc find singl polymorph snp chang singl gene individu conserv strain marker import identif function effect inform extract agent process consensu sequenc build snp identif requir extern iea gene sequenc annot est process add store est inform discuss earli sequenc thousand est overlap form contigu est ad process daili task agent task agent deal process essenti set signal rel strength wavelength lumin tag standard unix analysi program exist process essenti posit process agent wrap analysi separ produc uncertainti score convert output standard remov part sequenc byproduct sequenc part organ sequenc consensu sequenc assembl agent program est found produc set candid gene appropri splice short est sequenc produc set candid gene ad gene sequenc annot process earlier commenc agent oper program est sequenc kb uncertainti score produc nomin singl polymorph interfac agent simpl interfac particip enter data system data origin calcul uncertainti call est call origin accommod build consensu find snp gene express process kind genom data swamp amount sequenc data gene express quantit gene product express point time develop system line genom metabol pathwai knowledg extend gene express analysi incorpor relationship analysi express data significantli improv pure statist method system integr exist agent eventu relev genom inform made system exist iea metabol pathwai interest investig identifi encyclopedia gene wrapper analysi gene express data perform agent execut statist packag includ cluster pca analysi method result present user web page hyperlink relev entri current techniqu gene express analysi primarili cluster group gene similar express pattern gene express data noisi complic pathwai organ gener express significantli limit benefit standard cluster analysi order separ gene pattern gene express process organ develop gather inform order express data function categori cluster reduc data set find gene regul system discov regulatori connect pathwai advantag entri organ ec easili map gene specif organ interest relat work work gener algorithm queri select optim ai tsimmi infosleuth sim appli agent embodi algorithm compar work creat raw work organ retriev small work comput scienc direct biolog data area heterogen natur data make difficult store usefulli commerci relat work begun appli work wrapper mediat biolog tambi system differ pure implement technolog dynam support persist secondari user util form time resourc limit agent technolog make area word popular connot singl comput program bid found promot materi stand persist queri homolog found collabor commun agent project domain infosleuth annot genet sampl flow inform similar system system set notic public integr data sourc secondari user util system autom annot base wrapper mediat annot protein await manual annot entri dispatch agent control applic potenti complex sequenc wrapper system support detect inconsist reveal annot project true system annot genom primari design criterion observ sourc data annot constantli updat express idea sourc analysi tool easi integr plai open system describ detail primari differ open system achiev clear possibl corba base share architectur support reason secondari user util comparison decaf simplifi languag call bal discuss system oper web work interfac strongli orient biologist comput support process biologist analyz data primit nonexist annot store form impress biologist work compar manual annot flat ascii file recent ad approxim publicli sequenc strain human african result immedi result queri local biologist interest relationship result futur biolog work summer begin test biologist thing system excit biologist rel add type annot analysi fact system build similar system chicken open system concept matchmak annot agent access annot servic initi written secondari user util biologist face make simpl offic queri check result public underli decaf system evalu respect parallel comput resourc singl agent compon execut action run parallel efficaci schedul effici solv restrict subset schedul problem run gene annot system system result true time spent remot access parallel hardwar agent local intens task involv est process futur work paper discuss real problem make tremend amount genet sequenc inform produc inform publicli access inform sourc result singl research content primari sourc chang sourc techniqu analysi constantli develop cast sequenc annot problem gener inform gather system implement basic heterogen problem problem ma solut mechan deal chang dynam mind secondari util characterist obviou distribut process achiev parallel concurr possibl handl secur organiz concern part agent organ mirror human offer system publicli sequenc system base chicken est end intend broaden annot coverag add complex estim physic locat gene function biologist long record trait physic region trait chicken resist gene physic locat region strong indic genet function design interfac biologist full advantag materi data uncomfort complex queri languag build graphic interfac creat commonli analysi queri save futur share agent namespac major subsystem agent link analyz gene express data turn metabol pathwai analysi system data link sequenc function power analysi link question chemic prevent club root refer aren ca knoblock intellig data inform server proc intl conf info da benson al nucleic acid dt jone appli agent bioinformat proc int collab info widom tsimmi integr heterogen inform sourc proc info proc soc dec davidson al digit librari research digit schmidt system autom genom annot intl conf autonom williamson design behavior inform agent proc intl conf autonom page williamson internet proc page decker lesser quantit model complex comput task environ proc page decker sycara intellig adapt inform agent journal intellig inform nodin infosleuth coordin inform analysi complex applic mb pt po cluster analysi displai express pattern proc nat acad sci graham ks decker agent framework intellig agent page springer graham schedul system phd hendler taylor advanc high perform knowledg technic report maryland institut advanc comput ca hsu cooper agent inform retriev proc intl conf cooper inform system univ toronto schroeder consist integr heterogen inform appli annot protein journal comput knoblock learn expect rule inform sourc paper workshop ai inform technic report southern california nodin unruh facilit open commun agent infosleuth infrastructur intellig agent page steven al transpar access multipl bioinformat inform sourc zeng distribut intellig agent ieee decemb gene ontolog consortium gene tool unif biologi natur lesser complex goal criteria applic schedul proc
IR/1560 5 report search web distribut collect jacqu justin picard institut dinformatiqu universit de web summari internet paradigm permit inform search made network inform web page document collect digit librari distribut inform environ reveal challeng problem ir commun trec experi investig question relat inform search web digit analysi impact hyperlink improv retriev studi techniqu select text select problem encount face multipl includ evalu merg strategi effect rank list present user merg introduct interest hypertext digit librari effect web search due huge number page view adequ search introduct tabl content classifi list effect mechan access inform search engin web cover inform drawback order enhanc retriev ignor hypertext link recent work ir web acknowledg hyperlink structur valuabl locat inform chakrabarti al signifi judgment page author fraction citat citat semant relat materi relev page reason indic relev reliabl rule fall rapidli radiu averag multipl citat singl document cite semant relat document small similar cite author previou studi citat scheme tend suggest citat inform improv averag order good retriev scheme chapter paper verifi hyperlink improv retriev effect describ experi ad hoc track acknowledg difficult store manag grow document collect singl comput recent advanc network technolog dissemin inform sourc partit singl huge corpu distribut heterogen network retriev mechan base convent ir model central document collect assum access distribut ir model send request separ select text search impli merg result output list form singl list present user approach address problem select set inform server queri select convert inform format readabl select search engin base protocol retriev start model select sort result list obtain inform server form uniqu result list merg chapter paper reflect interest address view evalu smart system test bed implement weight scheme okapi probabilist model year experi conduct intel pentium eid experi fulli autom small web track particip web track address hyperlink provid evid enhanc search engin statist describ web collect list tabl characterist note corpu possess hyperlink lead averag hyperlink page primarili navig web rel web estim million web page test collect view small risk larg portion hyperlink page url ip destin node collect hyperlink page repres total link group cluster web page site point web page order proce averag eleven recal base retriev item request determin search strategi rule rule thumb provid serv differ averag gener consid differ consid materi jone origin www retain logic delimit document common tag remov text delimit tag remov classic stem procedur appli stopword remov feedback recogn feedback techniqu enhanc retriev effect evalu okapi search model queri verifi techniqu improv retriev perform face queri formul techniqu adopt rocchio approach system add search term origin queri feedback extract rank document result retriev effect depict tabl feedback result satisfactori enhanc baselin perform improv import deal short queri search term tabl show retriev time significantli procedur size mb web page extract url distinct index term collect distinct index term web page standard error median maximum minimum index term web page standard error median maximum minimum time requir build invert file time relev web page topic topic topic topic tabl small web collect statist model queri titl titl desc desc narr doc queri queri tabl averag blind queri search time sec search time request search time request tabl search time request hyperlink base previou studi citat scheme hyperlink account improv retriev effect common point spread activ techniqu previou work probabilist argument system link improv initi rank document directli hyperlink understand relat relev estim relationship hold appli spread activ techniqu pa integr link retriev process final draw potenti offer link retriev regard result obtain relationship hyperlink relev hypothesi underli experi hyperlink inform relev start understand link sourc evid relev enlighten determin techniqu fit situat hand main idea hyperlink propag score probabl link propag inform document link document expect probabl link document link higher greater link inform relev interest estim probabl train order idea expect link topic techniqu estim link probabl relev comput fraction link document comput averag fraction queri object method document link relev higher probabl relev avoid upward exclud document comput probabl algorithm link probabl vari larg number relev document vari order magnitud order queri domin algorithm comput median result probabl estim tabl data depict tabl find depend algorithm estim vari greatli experi present subsect make direct work smallest estim found algorithm find strongli suggest estim link probabl lower estim found cacm collect bibliograph refer displai evalu impact document probabl link rank document link rank document affect probabl relev slightli higher rank result confirm hyperlink small impact retriev effect experi consid link document initi rank score comput retriev statu support integr link inform document rerank support experi simpl techniqu spread activ match document initi comput ir system propag link document number cycl propag factor simplifi version cycl fix propag factor link type final retriev statu document link document estim method incom link outgo link algorithm algorithm algorithm tabl probabl estim link algorithm experi valu propag factor smallest valu deterior retriev effect deterior monoton paramet valu show simpl intuit produc satisfactori result retriev perform situat opinion hyperlink provid inform bibliograph refer scheme previou studi set probabilist argument system simplifi version approach document support affect direct neighbor case track deriv simpl formula understood refin spread activ propag document propag probabl relev probabl multipli probabl denot assess section comput probabl relev document rank fit logist regress rank set train topic individu contribut document spread activ techniqu case document sourc evid indic spread activ techniqu sum individu contribut pa initi rank document contribut link document consid sourc evid sourc evid probabl support document comput probabl sourc evid valid dsp experi incom outgo link demonstr improv decid includ import sourc initi rank document incom document outgo document dsp rank rank link rank link valu comput algorithm obtain improv topic valu probabl yield higher retriev effect result obtain topic tabl hyperlink valuabl citat inform defin cluster visual relationship individu paper offici web run offici run result averag time median queri displai result relat offici run content show small degrad averag perform offici run averag median tabl summari offici run web track summari result experi carri web track show hyperlink result improv implement link inform margin retriev retriev system produc high retriev feedback techniqu queri result improv search time factor ten distribut collect evalu retriev effect distribut ir form separ subcollect sourc document tabl summar statist depict gener statist collect studi distribut ir assum search engin index scheme retriev procedur distribut context reflect local area network close internet search engin collabor search inform approach close identifi characterist stage base current ir model select set search base select queri select text depend system merg singl result list present user describ collect select collect fusion section identifi retriev effect measur achiev search model collect result evalu investig limit singl search model search lead gener environ order obtain rough idea retriev effect compar conduct experi weight model smart appendix okapi probabilist model adjust underli paramet okapi search weight set paramet slope pivot result depict tabl show retriev effect higher rememb number queri number relev document inform good select procedur enhanc retriev effect compar averag achiev collect collect ft fr fbi la time size mb mb mb mb mb document distinct index term document standard error median maximum minimum index term document standard error median maximum minimum distinct index term min idf max df time build invert file topic relev document queri topic relev document queri topic relev document queri tabl statist collect collect ft fr fbi la time queri queri queri queri queri model rel rel rel rel rel okapi ltc atn ltc ltc lnc ltc lnc lnc anc ltc tabl averag isol collect desc select strategi attempt defin select strategi base current produc binari underli pertin challeng defin automat procedur answer question collect search provid satisfactori answer relev expect answer integ number record retriev underli binari outcom comput awar limit verifi past request sourc evid select achiev defin select procedur base neighbor techniqu work topic system found nearest neighbor set exist request cosin rank past request retriev system determin underli pertin record base major system decid conduct search underli subcollect test stage system topic notic ft subcollect pertin inform queri total la subcollect relev document queri request search ft la subcollect select procedur base train request fr collect produc relev inform queri fbi appli select procedur subcollect complet evalu rule tabl tabl system repres row true state natur depict column number time system decid retriev inform fr correct select procedur produc fr decid time conduct search corpu hold relev inform correct comput accuraci rule divid number correct answer posit true number case evalu measur depict tabl neighbor techniqu result satisfactori perform select rule sensit fail conduct search select procedur perfect retriev perform achiev affect poor shown column tabl section column tabl averag achiev document form singl huge collect depict column averag perform expect decid search merg result list base merg strategi section head list averag obtain select ignor relev inform queri fr true state fbi true state predict retriev retriev predict retriev retriev retriev retriev retriev retriev total total tabl evalu select procedur measur collect fr fbi accuraci correct sensit true posit posit specif true neg neg tabl evalu measur select rule strategi singl select optim select collect select approach ltc atn ltc ltc lnc ltc lnc lnc anc ltc tabl averag select strategi merg strategi desc collect merg recent work suggest solut merg separ answer list obtain distribut inform servic assum approxim number pertin item distribut relev document server answer base rank retriev interleav result fashion previou studi retriev effect interleav scheme perform achiev singl retriev scheme singl huge collect repres entir set document column tabl confirm find lesser extent order account score achiev retriev formul hypothesi inform server appli similar search strategi similar valu directli compar call produc final sort retriev statu comput separ search engin demonstr dumai statist document queri weight vari wide phenomenon invalid merg hypothesi fourth column tabl retriev effect merg show interest perform case merg simpl valid approach huge collect distribut network oper retriev scheme merg normal retriev statu divid result list maximum column tabl show averag repres surprisingli poor retriev effect reduct suggest logist regress approach resolv merg problem shown interest perform level merg heterogen result list produc search model rank retriev item kei merg current explanatori variabl logarithm rank retriev item score averag achiev method shown column tabl similar merg strategi offici ad hoc run offici run ad short result averag time greater median queri reveal result offici run ad long result averag time greater median queri reveal result result obtain okapi retriev scheme blind queri system add search term origin queri ad term extract rank document deal distribut collect local area network retriev model experi show select base worthwhil base search approach valid attempt merg result list provid retriev model acknowledg author bucklei give opportun smart studi conduct research support nation scienc grant author yve comput logist regress coeffici estim strategi singl round normal logist model merg score regress ltc atn ltc ltc lnc ltc lnc lnc anc ltc tabl averag merg strategi desc offici run averag median tabl summari offici ad hoc run refer hypertext lesson acm experi barrett societi social construct mit cambridg web commun improv algorithm topic distil hyperlink environ melbourn august applic model phenomena inform process anatomi hypertextu web search engin brisban april retriev approach smart gaithersburg nist public search distribut collect infer network seattl van den approach web resourc discoveri toronto inform retriev constrain spread activ semant network inform process experi select search engin metasearch acm transact inform latent semant index gaithersburg nist public approach select network ir acm transact inform find inform world wide retriev effect search engin inform process start stanford protocol internet retriev search comput system stanford stanford reflect issu gener hypermedia system commun method inform server select acm transact inform result challeng web search evalu toronto interfac distribut system inform server journal american societi inform authorit sourc hyperlink environ symposium discret januari rout retriev threshold experi gaithersburg nist public lee access inform web natur juli le merg strategi base logist regress inform process world wide web search servic journal american societi inform quest correct inform hyper search engin santa clara april inform retriev system larg document collect gaithersburg nist public model combin evid provid document relationship probabl argument system melbourn larg test collect experi interact okapi trec inform process automat text retriev inform comput read learn scheme inform retriev hypertext inform process citat scheme hypertext inform retriev inform retriev smeaton amsterdam report combin probabilist scheme nist public gaithersburg octob rank scheme hybrid boolean approach journal american societi inform visual scienc citat map journal american societi inform jone sparck research automat index technic comput uk learn collect fusion strategi seattl siemen experi merg nist public gaithersburg effect retriev distribut collect melbourn
AI/1561 2 acta informatica reason proposit formula depend khardon depart comput scienc edinburgh scotland mannila depart comput scienc helsinki finland dan roth depart comput scienc illinoi usa august abstract concret exampl behav intuit deriv drawback method necessarili give correct result condit deduct obtain correct complet infer procedur case boolean formula type integr constraint armstrong show approach close relationship prove result exist size armstrong relat boolean depend exhibit close relat question find kei relat find abduct explan applic correspond approach discuss introduct major task system artifici intellig system express knowledg domain question knowledg determin valid queri domain involv settl semant implic relat respect knowledg languag express statement structur class set denot knowledg domain statement oe contact dept comput king edinburgh fax work author harvard support aro contract work author harvard support nsf grant darpa singl repres queri question interest logic impli structur sentenc true oe true argu check semant implic relat definit explicitli imposs due larg number find effici implement sound complet axiomat problem theori human reason claim human typic argu select structur check oe true structur make correct impli oe true exampl conclud impli oe wrong domain infer type yield correct answer dramat give hong prove type geometr statement real suffici prove disprov geometr theorem line circl plane show polynomi number digit respect number object mention paper area reason exampl show method close relat area integr call armstrong relat serv singl captur implic set sentenc set depend armstrong relat relat oe impli oe satisfi oe semant implic relat reduc truth singl relat area autom reason model recent studi assum languag consist proposit structur model truth set model suffici set exampl oe oe true impli oe object determin semant suffici object set characterist model properti applic import relat set exampl deduct size issu treat depend proposit formula show applic area gener idea reason close relat show characterist model essenti intersect gener set function depend correspond hold gener characterist model introduc appli correspond result prove bound size armstrong relat type depend present famili bound disjunct depend gener class function depend show famili enjoi armstrong deriv size bound armstrong relat show correspond domain abduct explan proposit formula correspond kei relat schema boolean depend show result develop independ domain fact applic shown deriv problem translat set sentenc armstrong vice translat relat set depend studi context design relat corollari result characterist model complex translat problem polynomi reduct approxim solut problem deriv result comput learn theori impli abduct algorithm find kei subset attribut paper organ section describ theori reason model section introduc basic notion relat discuss correspond notion boolean domain section show armstrong relat characterist appli relat result domain relat section discuss close relat studi abduct explan boolean domain kei relat reason model section describ theori reason give applic boolean domain start notat boolean function element set fx call variabl assign denot denot number bit assign liter variabl posit negat neg disjunct liter cnf formula conjunct cnf formula term conjunct liter dnf formula disjunct term dnf formula term cnf formula horn posit liter note boolean function cnf dnf size cnf dnf number number term assign satisfi assign call model impli denot model model identifi boolean function set observ connect boolean function connect subset theori start describ result monoton theori boolean introduc present theori reason develop proof section found monoton theori definit denot usual partial order lattic induc order assign defin addit modulo order relat ith bit normal order relat monoton extens respect fx monoton extens respect fx set minim assign respect min fz claim list properti claim boolean function oper satisfi claim exist min claim monoton extens claim monoton extens respect assign smallest assign respect order question find small set neg exampl repres definit set basi basi class function basi function yield suffici condit describ posit corollari basi basi element exist min size basi function bound size cnf size min bound size dnf exist function basi exponenti size dnf deduct recal ff model model ff interest answer deduct queri form knowledg studi model base approach answer queri set model present queri perform model check approach yield correct deduct function exist approach deduct repres explicitli check model plausibl approach feasibl support correct deduct small knowledg base correct reason definit class function knowledg base defin set characterist model set minim assign respect basi fz min discuss notion upper bound boolean function relat monoton theori usag reason definit class boolean function upper bound ae ae theorem boolean function class boolean function basi lub bound theorem show logic function repres set basi lub suffici support exact deduct respect queri theorem basi ff ff set decid impli set applic appli gener theori develop specif class boolean function queri common common function class defin note fix basi uniqu famili boolean function repres wai class function correspond basi subset definit class function common small fix basi shown import function class common formula neg formula gener horn theori posit liter formula log formula basi class formula set assign bh fu basi class formula set assign bh fu kg flip bit basi element basi class basi class log formula deriv combinatori construct call set detail jb log note common correspondingli base union base union combin class denot lc set formula repres cnf lc common class denot basi lc bc theorem boolean function variabl exist fix set model bc common queri ff lc deduct correct size size import factor complex reason lemma bound size lemma basi boolean function denot size dnf size jbj note bound tight function size dnf exponenti gap case function exponenti size dnf linear size interest compar size size function exampl show case formula small exponenti vice versa discuss issu relat section introduc basic notion relat discuss correspond notion boolean domain relat depend assum finit set attribut tupl map domain relat set tupl tupl denot restrict relat rg attribut tupl refer column function depend relat obei fd tupl fd hold fd hold violat fd boolean arbitrari boolean combin attribut semant defin line function depend depend mean tupl boolean depend express function depend disjunct boolean depend extens associ attribut relat ea domain defin hold tupl ea eb ec express statement insur polici holder assum attribut defin relat ag group premium group state constraint polici holder belong ag premium class sequel boolean extens class straightforward set depend oe singl logic impli denot oe depend hold relat oe hold relat oe oe obei oe map boolean depend boolean function simpli map attribut boolean variabl assum set attribut size correspondingli discuss boolean cube map attribut set boolean variabl fx denot fd correspond boolean formula oe notat discuss relat set set attribut attribut relat defin fx pair distinct tupl relat associ set assign set attribut fx associ element bit attribut denot set assign correspond set relat agr claim relat obei boolean depend oe agr oe relat obei oe tupl satisfi oe assum obei oe tupl set attribut counterexampl oe satisfi oe theorem show small semant depend boolean formula theorem report small caveat report impli hold restrict discuss issu briefli definit relat obei fd tupl distinct turn choic yield interpret semant boolean formula implic sourc problem tupl assign agr agr solut problem order consist standard definit semant order logic restrict discuss boolean depend avoid problem altogeth result depend choic hold solut refer boolean depend boolean depend satisfi assign theorem set boolean oe boolean depend oe boolean function oe oe armstrong relat introduc notion armstrong relat turn analog notion characterist model boolean case armstrong relat appeal notion reason exampl test depend knowledg test hold armstrong relat decid unlik boolean case exist set model properti depend priori exist finit set relat check yield correct result recal relat oe oe obei oe class set depend definit armstrong relat respect relat obei oe obei oe armstrong relat respect global relat simultan serv role wit oe oe consequ set depend armstrong relat enjoi armstrong relat armstrong relat properti class depend singl depend discuss exist armstrong gener result armstrong relat fd prove definit boolean function clip written conjunct posit liter depend variabl satisfi assign definit set assign clip set attribut fx assign assign liter set liter set easi observ function clip set model set fd clip claim class claim boolean function clip uniqu minim model set model clip uniqu minim model set liter definit assign liter set liter set uniqu minim model uniqu minim model set variabl set model variabl map minimum assign liter set liter set set model clip clip show clip set assign build relat agr set correspond set essenti construct claim clip set assign relat number tupl agr case order assign assign construct pair tupl ith assign construct tupl attribut map tupl bit assign assign map bit assign map assign tupl ad tupl gener assign set sibl tupl correspond bit assign gener agr set attribut variabl assign assign construct relat attribut set attribut construct set sibl tupl correspond assign gener set tupl correspond assign attribut map attribut map claim class clip boolean depend enjoi armstrong relat set boolean counterpart observ reason model set model correct boolean queri denot set relat claim agr claim impli armstrong relat gener result armstrong relat fd observ boolean function set model reason singl relat captur assign set set singl relat restrict clip function armstrong relat characterist model boolean possibl reason clear reason function exampl set model problem exist small set model support correct deduct discuss situat depend depend statement arbitrari relat possibl infinit priori exist finit set relat check yield correct result discuss exist issu earlier show result theori reason introduc section studi armstrong relat concept defin introduc beeri al studi armstrong relat function depend set set attribut subset close depend ae ae easi intersect close set minim close set set attribut denot famili close set defin gen intersect gener famili subset finit close smallest set fs set intersect gener easi show uniqu defin similar definit boolean domain denot boolean counterpart gen subset gen construct assign construct set agr theorem show notion coincid notion characterist model theorem set fd boolean counterpart bh theorem altern definit set gen denot max collect attribut set exist attribut superset theorem set fd max gen function depend enjoi armstrong relat beeri al shown correspond gener armstrong relat function depend theorem set relat armstrong relat respect gen talk set relat serv armstrong set singl relat easi observ set tupl relat separ collat relat pursu theorem theori reason model show properti hold gener theorem set boolean basi set depend class set model agr armstrong relat respect armstrong relat respect agr part theorem note ad model set harm correct reason part observ agr assign assign falsifi depend class theorem set set boolean function repres set depend class set model armstrong relat respect agr exist armstrong relat agr agr show function impli hold yield contradict defin function agr element agr satisfi assign lub definit mean obei minim model respect respect element impli impli note differ previou theorem theorem show element construct order correct deduct proof show exist function class repres necessit element note basi function class repres class theorem yield result note base bh bh present class horn function function repres class function repres bh bound disjunct depend deriv corollari armstrong relat characterist model claim show armstrong relat exist class clip function deriv bound size relat special case class fx set attribut disjunct depend oe statement form semant disjunct depend boolean depend easi boolean depend transform set disjunct depend simpli conjunct normal form cnf boolean note show legal boolean depend previou satisfi fact definit disjunct depend statement form case definit correspond case definit correspond case refer case type note defin clip class enjoi armstrong relat easi show restrict class enjoi armstrong relat deriv bound size minim armstrong relat theorem follow combin theorem claim lemma bound size basi class theorem set size minim armstrong relat respect sagiv al studi class depend show bd set depend call semant bd statement form easili subset function impli theorem set fd size minim armstrong relat respect fd fd empti set depend theorem set fd size minim armstrong relat respect claim combin theorem theorem claim lemma bound size bh note add fd empti set depend necessarili clip fx clip bound size armstrong relat union class argument theorem note basi function basi horn function theorem set set size minim armstrong relat respect queri fd case theorem hold lower bound mention basi bh correspond class function restrict definit type violat exact correspond denot class type type restrict remov mention class enjoi armstrong relat set depend class armstrong relat respect class type case lower bound hold theorem set size minim armstrong relat respect basi function function proof observ set relat tupl theorem claim abduct explan kei section show connect notion theori proposit domain show close relat abduct explan proposit domain kei relat abduct task find minim explan observ formal reason boolean function kb background set proposit letter assumpt queri letter assumpt base explan respect background theori minim subset abduct involv test entail search explan pass test set assumpt includ proposit set simpli call explan case task comput explan input comput explan respect kb set function depend set kei respect set boolean set proper subset properti kei minim set attribut function determin attribut task comput kei input comput kei respect class boolean includ depend form class function class class boolean function correspond theorem problem comput abduct explan respect function polynomi problem comput kei respect depend assum set boolean depend set attribut algorithm comput abduct explan comput kei boolean function variabl fx addit proposit letter denot kb background theori consist function kb kei respect explan respect kb explan explan variabl theorem kei observ search procedur decid set kei easi kei uniqu kei output search procedur uniqu procedur decid kei procedur comput explan boolean function fx assum explan start test kei explan theorem minim set iter attribut attribut set test fx kei replac fx notic rule ad form theorem point kei explan clear minim explan ad rule reduc size procedur set explan determin turn determin procedur find minim explan illustr reduct set depend easi kei bd reduct translat abcd abcd introduc letter construct express kb appeal search procedur find explan easi minim explan bd kei cast special kind explan reduct show explan search kei kb assum explan case minim ab bd procedur check abd kei answer minim set abd assum test remov construct check ab kei answer attempt minim ab result ab correspond explan ab requir bd found similar expect similar result deriv domain case horn theorem algorithm produc number proposit variabl number occurr symbol correspond result show comput kei respect set depend consist definit horn result theorem find explan time number variabl result explan theorem show determin proposit letter occur explan correspond late result determin attribut occur kei task comput assumpt base explan input proposit express input set characterist model task polynomi time algorithm algorithm appli find restrict subset input armstrong relat reveal connect theori relat theori autom reason notion armstrong relat relat shown notion characterist model theori autom reason corollari correspond develop result autom reason domain deriv bound size armstrong relat function depend present famili bound disjunct gener class fd famili enjoi armstrong similar size bound deriv shown close relat kei abduct explan similar result found independ field applic shown deriv studi characterist model boolean domain yield result relev problem translat set sentenc armstrong problem studi domain impli abduct algorithm find kei subset attribut studi correspond field fruit refer roth construct asymptot good code graph ieee transact inform structur relat function depend journal berman wj posit boolean depend inform process exact learn monoton theori inform fagin horn depend journal ronald fagin armstrong research report san hong prove gap theorem proc ieee symposium foundat comput scienc page mental model harvard selman horn approxim empir data artifici khardon translat horn express characterist model technic report aiken comput harvard februari khardon learn compet phd appli harvard technic report aiken comput harvard khardon roth reason model nation confer artifici page full technic report aiken comput harvard januari kundu improv algorithm find kei relat fourth acm symposium principl system page acm osborn candid kei relat journal comput system mannila design applic armstrong relat journal comput system reiter de kleer foundat truth mainten system nation confer artifici page fagin relat depend fragment proposit logic journal selman kautz knowledg compil theori approxim journal march selman levesqu abduct default comput core nation confer artifici page
Agents/1562 1 task assign multiag system base auction level commit contract felix brandt gerhard institut technisch germani abstract kei problem address area multiag system autom assign multipl task execut agent autom multiag task assign requir individu agent common protocol prescrib interact order agreement nal agreement contract speci es commit result assign work report paper part broader research ort aim design analysi approach autom multiag task assign combin auction protocol level commit contract primari advantag approach applic broad rang realist scenario negoti agent feasibl futur requir agent breach contract exampl standard auction protocol english dutch vickrei auction combin auction level commit contract paper focu combin auction level commit contract introduct area multiag system concern system technic entiti call agent act interact intellig achiev steadili grow interest past decad kei problem address area autom assign multipl task execut agent criteria ecienc reliabl autom task assign requir agent common protocol prescrib interact order agreement nal agreement formal contract protocol concern act process nding task contract concern consequ commit result assign agent standard type task assign fix agreement process agreement negoti auction autom task assign level commit dutch english vickrei fig autom task assign protocol protocol protocol exampl wide appli auction protocol english dutch vickrei auction compar protocol show distinct advantag easili enforc ecient assign agreement scenario agent possess knowledg standard type task assign contract contract common form contract contract level commit contract compar contract er signi agent act dynam environ exibl react futur make exist contract unfavor figur summar rough overview approach autom task assign work report part broader research ort aim design analysi approach autom multiag task assign combin auction protocol level commit contract primari advantag approach expect applic broad rang realist scenario negoti agent feasibl futur requir agent breach contract combin auction level commit contract work paper focu combin auction protocol level commit contract basic descript vickrei seal bid found gener discuss advantag limit auction protocol provid compar auction vickrei auction advantag durat priori interest agent bid domin bid strategi bid true valuat make vickrei auction interest applic comput set paper structur section describ combin detail section present initi result combin section conclud paper overview basic research direct evok idea combin auction level commit contract combin auction level commit contract inform descript di erent task assign view protocol scenario investig paper type seller contractor er buyer execut task contractor associ prime cost task execut contractor pai price lower interest task price higher cost contractor con ict maxim pro ts di erenc cost price task type agent behav contractor announc interest calcul seal bid inform announc contractor submit lowest bid declar winner lowest bid price announc contractor pai price win turn execut task equal win winner pick kind auction view standard vickrei auction submit highest bid good resourc win auction highest bid kind auction call auction appeal comput applic main reason winner determin bid domain domin strategi vickrei auction bid true desir avoid wast broad rang competit set order limit assum involv contract time assumpt easili relax simultan involv extens decommit contract simpli pai decommit penalti contractor enabl legal breach contract pro tabl task announc penalti speci cation part contract penalti assum variabl condit futur kind contract level commit contrast contract level commit determin amount penalti pai breach task assign approach paper combin auction highli exibl form contract basic notat basic notat remain paper cr ce refer contractor number assum greater number contractor ensur bidder particip auction prime cost contractor cr denot prime cost ce execut task announc cr denot loss gener assum cost lower contractor claim min cr max min ce max ce max cr min contractor interest sign contract price task announc contractor cr lowest denot decommit penal ce pai contractor cr denot indic drop order avoid unnecessari type penalti investig penalti de ned fraction price decommit penalti de ned fraction prime cost concern contractor cr price cost constant call price penalti rate cost penalti contractor cr ce sign individu pro ts cr ce sum penalti ce paid round bid detail spectrum bid strategi realiz chosen intuit easili ecient realiz contractor cr initi auction announc potenti ce calcul bid calcul ce involv contract current auction bid bid dp ji dp ji variabl factor call desir pro ce wrt task announc contractor cr ce win auction task announc contractor cr factor dp ji dp ji dp ji constant ensur win auction initi contractor submit higher bid auction initi contractor futur pro ce win auction initi cr reduc dp ji dp ji dp ji constant situat sophist ce involv contract sign contractor cr case ce di erenc potenti gain exist penalti penalti pai decommit assumpt ce commit cr current auction ce calcul bid task announc cr bid ji dp ji de ned de nition decommit contract contract result higher pro initi result experi achiev basic understand ect combin auction level commit contract set auction proce success round round contractor sequenti er task contractor initi singl auction task task task tabl cost tabl scenario contractor sequenc randomli vari round round auction round consist set simul scenario task execut repeatedli time analyz agent pro ts vari time result present section base paramet set dp ji initi intend make pro begin round potenti involv contract penalti set paramet chosen simul price bid integ valu scenario di er number contractor reason care evalu approach compar contract full commit contract mean sign contract auction round sign join auction round variant bid calcul formula applic di erenc variant origin approach number experi vari paramet set vari number contractor result obtain report reason limit qualit coincid report paper contractor tabl show prime cost tabl entri agent prime cost chosen interv de ned paramet ce min ce max cr min cr max subsect consist contractor rst shown tabl tabl summar result obtain scenario wrt pro ts accumul contractor round di erent commit level full commit di erent penalti interest observ follow result rst kei observ data level commit contract full commit contract lower prime cost ectiv make pro rel higher prime cost data show fair correl level commit easili compar pro ts made ce accomplish task cheapest pro ts pro ts made ce ce level pro ce infer tabl ratio ce pro sum profit full ratio equal equal illustr figur kei observ competit contractor signi cantli level commit immedi compar pro made contractor di erent commit level column tabl observ task assign scheme global ect dynam electron market occupi agent contractor consid figur show price develop di erent commit illustr observ task sold auction round assum ensur price paid contractor gure show level commit compar full commit result obviou price pressur typic lower price competit task accomplish low cost reason involv contract contribut task price particip auction price task lower compar full commit contract ce particip auction sign contract kei observ remark di erenc penalti ect achiev choic penalti mode long penalti mode chosen exibl decommit contract observ impact design assign scheme base level commit contract contractor order investig competit addit ad scenario tabl result scenario summar tabl show detail price pro curv scenario includ reason limit result competit result lower price lower pro ts higher pro ts contractor kei observ mention scenario hold scenario result show comput approach section fact realiz intuit expect level commit autom task assign combin protocol level commit contract de ne eld research area multiag system result combin result exibl assign scheme show desir fair properti wrt pro ts made import issu appli assign scheme level commit result level commun cost scheme appli carefulli domain commun cost critic paramet work paper understood rst step understand limit bene ts combin auction level commit contract open research issu remain address formal analysi broad rang theoret work price stabil converg extens approach scenario contractor breach contract extens parallel auction extens combinatori auction extens learn agent adapt protocol import autom task assign multiag broad applic rang multiag task assign base auction level commit encourag initi result kei observ report paper justifi explor relat issu refer mr andersson tw sandholm level commit contract myopic strateg agent nation confer arti cial intellig page brandt explor level commit contract part auction technic report institut technisch brandt al explor level commit contract part auction technic institut technisch sh editor paradigm distribut resourc alloc world scienti se vr ra meyer multistag negoti distribut constraint satisfact ieee transact ks decker vr lesser design famili coordin algorithm intern confer system page ke ms miller incent engin comput resourc manag ba ecolog comput ferber system introduct distribut arti cial intellig john wilei son huberman sh clearwat multiag system control build environ intern confer system page mn huhn mp editor read agent morgan san krau agent contract task environ nation confer arti cial page se lander vr lesser negoti organ cooper search heterogen expert agent ohar nr editor foundat distribut arti cial intellig john wilei son rai art scienc negoti harvard game inform basil rosenschein zlotkin rule encount mit sandholm implement contract net protocol base margin cost calcul nation confer arti cial page sandholm limit vickrei auction comput multiag system intern confer multiag system page menlo aaai press tw sandholm vr lesser issu autom negoti electron extend contract net framework intern confer system page tw sandholm vr lesser advantag level commit contract protocol nation confer arti cial intellig page rg smith commun control distribut problem solver ieee transact vickrei counter competit seal tender journal schmidt incent comput tractabl intern journal cooper inform editor multiag system modern approach distribut arti cial intellig mit accumul pro scenario commit broken ce full price penalti level cost penalti full price penalti level cost penalti tabl number broken contract pro ts accumul round scenario di erent commit level accumul pro scenario commit cr full price penalti level cost penalti full price penalti level cost penalti tabl contractor pro ts accumul round scenario di erent commit level auction round fig accumul pro scenario full commit contract auction round fig accumul pro scenario price penalti auction round fig accumul pro scenario price penalti auction round task task task fig price develop scenario full commit contract auction round task task task fig price develop scenario price penalti auction round task task task fig price develop scenario price penalti
HCI/1563 4 ieee publish hawaii intern confer system januari hawaii user interfac group collabor abstract flexibl user interfac custom meet task hand import group collabor paper present user interfac system collabor inform process system synchron groupwar multimod interfac enhanc support share compon bean runtim import share workspac interconnect complex compon import compon user tailor interfac present softwar architectur custom interfac interfac includ manag system share multipl modal concurr applic multimod manag system loadabl demand strongli framework multimod user experi creat flexibl user enabl user tailor specif report inform laboratori experi framework test varieti applic discuss limit user interfac multimod user end user program introduct design flexibl dynam configur user interfac difficult develop solut problem user user custom easili notic prefer offic desktop design major goal easi custom ui synchron synchron groupwar main session establish monitor applic data share approach offer architectur custom html document loadabl softwar compon multimod interfac boi ivan center advanc inform process rutger state jersei nj enhanc architectur integr part system provid individu group multimod interfac base compon technolog commun develop center interfac significantli advanc past peopl keyboard altern devic tactil gaze track proven conveni effici specif task har potenti power applic develop effici access applic peopl comput daili disabl interfac interest applic environ convent system emerg servic soldier field groupwar infrastructur defin commun pull inform collabor share inform build share coordin user interfac groupwar requir understand group peopl work understand network technolog aspect technolog delai synchron affect user experi paper flexibl user interfac dynam adapt flexibl address group level applic level group share workspac adapt load java compon reflect collabor coordin dimens groupwar user interfac applic user multipl sensori modal interact applic target java applet compli javabean specif compon reusabl softwar modul capabl publish regist interfac context compon support visual event custom repres strong trend softwar industri standard softwar develop exampl compon includ singl button graphic user small interest interfac modul imag segment program distribut object compon combin compon comput distribut network form applic compon deploi server network commun servic interfac collabor major problem widespread accept groupwar difficulti find collabor establish meet session user interfac creat session tend unfriendli groupwar link task group group share data metaphor order user framework gui consist desktop commun center includ view collabor workspac meet place collabor desktop kei function user interfac effect visual collabor space collabor space essenti directori peopl user collabor structur reflect relationship visual abstract model virtual physic model simplest abstract show simpl list collabor place complex structur place tree node higher hierarch layer correspond complex posit similar place proxim distanc measur physic space repres virtual user walk street corridor reach collabor place place model topic physic abstract physic desktop workspac manag creat enter inform exist workspac activ user insid visual medium inform user current activ custom medium specif applic visual abstract model view group user militari desktop render inform group medic inform present dynam state applic featur gui view model describ state applic collabor share collabor applic share separ view model problem user interfac user person digit assist workstat filter metaphor render data support notion separ view data render inform collabor descript extens markup languag handl render style java support xml present standard reliabl circumv problem power achiev separ view data simpl html implement desktop window order render place user descript figur present view profil collabor user enter meet place meet place reflect specif view depend domain user collabor inform filter user snapshot person web page full inform user provid style appli html browser render user inform predefin style sheet creation time group collabor workspac design collabor workspac start observ organ schedul group difficult individu group interact style hard individu characterist determin studi conduct group vari interact long ¢ £ ¤ ¥ ¤ figur commun center view collabor space structur meet user filter render user inform view style user boi enter meet place medic militari window desktop util user inform select item common tool chat conferenc queri window find provid group affect commun pattern group chang quickli group format process design interfac meet requir complic fact groupwar user background dynam collabor difficult studi group behavior gener group groupwar system maxim human interact minim technolog metaphor collabor space visual open session enter room easi novic user corpor cultur chang groupwar technolog support team structur real floor build contrast trend futur work place work group real imagin virtual build virtual floor virtual room bit base observ chose meet place paradigm meet resourc present environ condit evolut small dynam group workspac client visual meet place offer individu view place environ applet compon provid basic tool handl share support workspac window automat launch user enter place window show bean place share bean collabor easi point url bean load local file system load web server toolbar top open bean browser list chang telepoint color toolbar button sharabl bean show radar view bean load support updat state synchron state exist remot bean workspac provid singl seamless ui environ high level consist case desktop workspac requir strictli view posit bean locat workspac bean present limit consist view action uncov entir semant bean track user action provid telepoint radar view telepoint widget user track remot cursor radar view widget provid global view applic color overlai repres local view region provid bean level user free adjust size posit bean workspac workspac screen user edit profil person url address web properti awar widget repres remot peer telepoint radar time collabor multimod interfac previou section address flexibl group interact level present section provid flexibl interact applic applic interfac keyboard voic interact suitabl word process applic figur snapshot user view collabor meet place tool user load bean internet import meet place java bean chat show activ url link filter messag chat topic user interconnect displai geograph area militari test applic multimod enhanc compon tactil gaze multimod manag provid interfac custom point devic gestur suitabl applic spatial content goal provid user multipl modal commun user pick prefer interact mode goal work develop singl optim multimod interfac specif task base experi previou implement multimod fusion integr manag agent develop integr environ agent deal content select modal alloc modal modal realiz integr multipl modal recogn input modal hand gener contextu output modal depend current interfac custom prototyp multimod workstat illustr figur implement provid modal multipl applic collabor provid librari applic develop demonstr militari mission plan applic enhanc tradit user interfac sensori sound microsoft whisper speech system touch rutger master ii tactil glove gestur recognit softwar sight gaze tracker make interfac modal platform pluggabl connect multimod interfac manag tcp connect manag provid modal concurr applic implement multimod user interfac manag architectur main function manag manag modal figur system multimod interact common fusion pattern fusion pattern specifi modal integr applic fusion manag provid common function applic programm modal manag multimod manag system virtual modal applic exist applic share modal main issu access control manag applic configur rout messag applic manag modal fusion behavior applic design commun protocol multimod manag applic applic discov receiv input send feedback pointer event deliv window underneath cursor map input workspac establish point refer workspac cursor point devic messag rout modal applic notion activ applic workspac possess focu activ applic modal input recogn phrase speech recogn activ applic rout messag applic modal output implement straightforward output appli textual feedback dialog box time figur interact applic agent modal address adapt behavior applic notion activ applic appli switch applic modal reconfigur mean speech recognit grammar vocabulari chang accur action gestur chang fusion behavior modal integr chang glove perform emul applic multimod fusion agent perform multimod fusion addit manag modal multimod fusion applic combin action specif modal gener manag implement gener combin provid consist environ user allevi programm redund work agent fuse input event histori event data event event event event sequenc recogn carri semant inform exampl sentenc speech recogn keyboard gestur recogn tactil symbol recogn write tablet action properli user fail provid inform lead insuffici data perform recogn command system deal respond error messag action fusion agent perform gener fake event gestur includ repertoir tactil glove call emul implement perform perform perform normal movement gestur bend thumb user hold stick button point gestur index action work arbitrari applic applic awar multimod manag receiv event expand number gestur action ad gestur make recognit robust learn curv steeper user control behavior modal multimod fusion implement control speech input wai found discuss speech recogn recogn utter made disturb found wai suppress toggl activ button configur panel turn inconveni speech found enabl command enabl random solut workabl burden user gaze ignor speech recogn gaze cursor accur calibr work good solut idea gaze confirm peopl tend person talk user screen user fusion agent assum user talk user escap command avoid frustrat user troubl peopl wear hard contact addit speech command implement enabl disabl gaze confirm good multimod fusion wai user switch applic user combin speech gaze speech stare window option essenti extens gaze user stare system assum intend perform action integr share workspac multimod manag extend user interfac workspac workspac applic manag speech command close bean simpl speech command addit modal make easier user multimod environ particip collabor session custom interfac interact share applic rest group speech command grammar applic focu manag dynam extend grammar addit command manag applic speech input conflict ambigu grammar grammar problem speech capabl handl redund grammar make attempt detect problem extend send grammar problem parser handl give prioriti sentenc activ applic fail recogn manag assum meant applic command user avoid introduc escap command prefix word creat make imposs applic command start limit prefix word natur situat attract attent person call clear address dynam custom interfac collabor framework introduc possibl interfac custom end user figur present bean multimod interact load privat bean user prefer augment workspac modal load activ multimod user dynam select modal ey gaze interact workspac load collabor compon user vari awar confer particip select concurr control algorithm appli bean flexibl desktop type desktop portabl wearabl comput peopl figur ma iv wearabl comput collabor experi user interfac consist displai point wireless network batteri pack comput work earli experi heterogen collabor environ desktop workstat wearabl comput link wireless dynam adapt user interfac wearabl tactil speech gaze track emul keyboard desktop workstat wearabl comput excel platform test claim portabl interfac custom basic pc user interfac desktop machin suitabl environ setup keyboard desktop speech recogn make found dictat softwar reliabl imposs word recogn dictat knowledg enter user workspac login dialog issu button replac round button tilt direct move user practic novic user hard time steer cursor user inclin voic command displai resolut system small modern pixel desktop system nowadai typic displai pixel found design applic desktop displai inform small comfort handl system perform applic flexibl system make benefit applic run chang applic test applic experi implement chat whiteboard bean basic commun tool insid workspac chat bean figur messag filter chat topic user post note activ link form text user select url document point url shown default browser oper system collabor work includ share sketch primari mean commun idea whiteboard simultan interact imag edit annot special applic support type mission plan system diagnosi system blood sampl mission plan system design militari oper plan disast relief plan involv manipul asset terrain icon repres asset link inform resourc cloth suppli shown figur base version access multimod interfac version gaze command intens manipul map tactil input capabl medic applic comput vision techniqu aid doctor diagnosi blood cell analyz base color type cell normal cell search closest match applic combin tactil input major sourc feedback demonstr laboratori visitor reason visitor prior knowledg system capabl open explor parallel visitor introduc disturb flow interact system time result random command background phrase interpret speech recognit system strictli figur medic diagnosi support applic desktop doctor receiv imag remot microscop select region interest segment imag select cell kernel extract search similar cell candid rank similar demonstr closer actual everydai experi inform laboratori experi multimod interfac show modal present believ natur keyboard afford greater flexibl function realiti primit stage develop extens refin experi show learn curv modal natur human commun greatest limit simplist languag understand compon intellig fusion capabl current set voic command simpli power cover broad rang interact individu modal experi suggest gain intellig improv command interpret modul knowledg applic relat work collabor architectur user interfac uniqu combin featur found compar environ flexibl support share java applet synchron collabor reli version java develop kit make primarili target unanticip share spontan collabor user initi share time execut applic start due collabor provid visual collabor space workspac accept applet time multipl applic microsoft netmeet share imag send parti cooper synchron offer hierarch view collabor netmeet primit concept collabor directori server user repres session session collabor framework provid multimod user interfac manag access abstract framework similar implement manag run multipl applic concurr multimod applic framework develop support multipl concurr applic exampl exist multimod system develop optim multimod interfac specif task unlik aim develop architectur suitabl gener easi interfac custom end user support multipl concurr applic multimod groupwar applic quickset pen speech integr collabor electron map applic run version ms window built concept commun agent classroom multimod collabor distanc learn student mark point materi question agent search faq list teacher answer question gellersen maui librari facilit multimod interfac develop applic specif multipl support multipl concurr applic share environ written eiffel multipl inherit make java implement hard compat exist gui librari maui librari design run multipl applic simultan quickset classroom applic singl grammar vocabulari multimod system support multipl concurr applic kei principl design flexibl composit user visual share applic user interfac compon design present exist composit simultan support applic uniqu framework paper present design implement framework synchron collabor interact share java compon mechan control cooper featur manner interfac open customiz respect context user uniqu featur framework simultan support applic abil support ad hoc collabor group softwar compon recent gain great interest mean make customiz applic approach flexibl extend custom user interfac user interfac user tailor interfac task hand applic framework approach present advantag commonli toolkit approach toolkit approach applic design make applic function approach end user make closer realiti usag real task hand collabor develop implement test parti bean bean set applic includ graphic collabor map speech signal acquisit imag analysi militari mission plan extens whiteboard medic diagnosi system diagnosi updat inform free sourc softwar download web site acknowledg dr multimod interfac design cristian wen li contribut develop current version commun infrastructur research report support darpa contract nsf stimul contract nsf contract rutger center advanc inform process refer jb mb ca worker independ collabor acm symposium user interfac softwar technolog san forc touch feedback virtual john wilei pr multimod interfac distribut interact acm symposium user interfac softwar technolog demonstr pr multimod interact simul appli natur languag process meet system interact index retriev patholog ieee workshop applic comput vision desktop design synchron graphic interfac jl measur benefit multimod ieee intern confer signal process hw captur logic interact design abstract interfac st ercim workshop interfac applic framework synchron collabor java intern confer system scienc ca jl interfac mission aaai spring symposium intellig microsoft netmeet microsoft corpor window highli intellig speech mitr corpor collabor virtual workspac oviatt theme multimod intern confer spoken languag acoust jl user interfac hci intern sun javabean extens markup xml usabl effici natur languag cscw hypermedia australasian natur languag process summer
Agents/1564 1 algorithm optim winner determin combinatori auction gener tuoma sandholm suri depart comput scienc washington st mo abstract combinatori auction reach cient resourc task alloc multiag system item complementari determin winner recent shown optim search algorithm averag paper present sophist search algorithm optim winner includ structur improv reduc search tree faster data optim search node base drive identifi solv tractabl special case uncov gener tractabl special design algorithm solv solv tractabl special case substanti faster gener combinatori auction multipl unit reserv price singleton combinatori substitut present algorithm determin winner gener introduct auction import mechan resourc task alloc multiag system bidder valuat combin item sum individu item case electr equiti bandwidth transport exchang pollut auction airport land slot tradit auction format item auction separ decid bid agent estim item receiv requir intract lookahead game tree residu uncertainti remain due incomplet inform bidder lead cient alloc bidder combin combin combinatori auction overcom de cienci sandholm bidder submit bid combin item bidder express complementar item copyright american associ arti cial intellig reserv ing specul item valuat impact possibl complementari item winner determin problem auction set buyer submit set bid tupl bj sj set item pj price assum relax pj assum bid concern set sk multipl bid concern set highest bid discard preprocess break ti winner determin problem label bid win lose maxim auction revenu constraint item alloc max nx st xj problem weight set problem solv dynam time independ approach solv problem approxim shoham shoham recent shown maximum polynomi time algorithm solut close optimum special case approxim slightli review approach restrict bid tennenholtz sever small fraction combin bid winner determin polynomi time restrict bid give rise econom cienci prevail auction bidder bid combin prefer approach solv unrestrict problem search shown work scale optim winner determin hundr item thousand bid depend problem instanc distribut improv algorithm develop shoham vein paper present sophist algorithm optim winner determin enhanc includ structur improv reduc search tree faster data optim search node base drive identifi solv tractabl special case uncov gener tractabl design algorithm solv solv tractabl case substanti faster gener ca auction multipl unit auction reserv price singleton combinatori substitut give algorithm determin winner gener present result auction auction seller bidder result appli directli auction auction bui bidder sell sophist search algorithm section present algorithm optim winner determin improv previou algorithm classi ed structur capit tractabl subproblem faster data structur structur improv section present improv reduc search tree size chang structur branch bid skeleton algorithm rst tree search branch bid set bid label win path current search node call set bid win alloc found solut found store time bj exclud bid path initi ej set item revenu bid xj search path upper bound item contribut search invok call algorithm max return bound pj jsj bid bk ek branch bid return ek bj bk ej ej bj bk ej ek return previou search algorithm winner de branch item shoham children search node bid includ smallest item share item bid path preprocess dummi bid price submit individu item receiv bid repres fact auction proven leav tree correspond feasibl solut winner determin problem branch factor dummi depth complex bob branch bid xj item branch factor depth naiv analysi show bob exponenti bid node interior correspond feasibl solut winner determin problem number node tree number leav formul prove bob polynomi bid desir auction control item control bid submit complex exponenti bound averag case signi cantli dynam program algorithm exponenti item case main advantag bob compar earlier search formul bob line ai principl commit choic step commit formul choic item commit remain bid includ item bob ned search bid order techniqu paper capit heavili possibl secondari advantag bob dummi bid bid order heurist search speed improv prune occur step algorithm construct alloc earli bid order step bid contribut lot retract potenti tion bid item search pj bid maxim avoid scan list bid bid sort descend order search ej prefer bid prefer bid item recent shown greedi algorithm simpli insert bid highest rst order bid bid pj jsj share item worst case bound shoham necessarili bid order greedi construct alloc unlik greedi construct alloc earli chanc bid item lead deeper search bid item bid item exclud bid due overlap prefer bid item number alloc earli set slightli addit nding optim solut faster bid order improv algorithm anytim faster lower bound prune lower greedi algorithm node updat reduc search enhanc prune root current search node exploit decomposit set item divid subset bid includ item winner determin subset separ search superlinear size problem decomposit lead speedup search step algorithm check problem maintain vertic bid ej vertic share edg bid share item call set edg jvj algorithm check graph tree correspond independ subproblem bid subset winner determin call bob subproblem separ subproblem mark ej upper lower bound subproblem straightforward approach call bob subproblem decomposit check preprocessor node achiev exploit inform independ subproblem subproblem current search node ofth subproblem solv fq optim solut found subproblem hq subproblem lq lower bound greedi algorithm lq subproblem solv subproblem subproblem solv subproblem lower bound greedi algorithm item subproblem contribut gz subproblem hz subproblem kx kx search node subproblem updat global lower bound maxf solv gz updat cut search path gz hz straightforward approach approach search path algorithm step due upper lower bound order tackl subproblem make di erenc provid opportun optim subproblem order forc decomposit articul bid addit check decomposit algorithm strive decomposit bid choic step pick bid lead bid exist bid delet disconnect call articul bid articul bid identi ed assign node number order node root number order identifi articul assign addit de ned child vg back hq lq fq articul bid multipl articul branch minim size larger measur number bid strategi branch articul bid con ict branch scheme necessarili domin answer de ne class de nition bid bid branch articul bid exist ti resolv case articul bid exist de nition bid bid branch bk arg pk tive function ti resolv prefer bid articul proposit bid scheme bid instanc lead fewer search instanc lead fewer search node bid articul lead decomposit bid assign lead decomposit assign win remov bid neighbor reason assign bid branch win assign lose bid order give rst prefer articul prefer bid articul win branch prefer bid articul branch bid order algorithm shallow bid identifi combin bid disconnect bid identi ed bid small branch rst search identifi smallest tractabl subproblem node search drive identifi solv tractabl special case avoid branch short bid bid includ small number item lead signi cantli deeper search bid item exclud bid due overlap item previou search algorithm scale thousand bid bid hundr bid bid item call bid item short proof omit version due limit space bid long winner optim determin short case time weight maxim match algorithm problem short bid solv problem long short bid integr edmond algorithm search algorithm achiev optim branch short bid step bid choic restrict long bid step edmond algorithm execut short bid ej return set win revenu fe remain chang step fe fe delet item includ bid previou short bid static de ned improv dynam size determin item belong long bid size ectiv reduc optim move long bid short reduc search tree size optim search track bid item interv bid consid import special case item linearli bid concern contigu interv item speci assum item bid interv item dynam rothkopf al solv problem time di erent algorithm solv special case time asymptot optim algorithm read item bid input brie describ algorithm bid interv call item rst item item item sort bid order bid smaller rst item earlier sort order set item bound size bucket sort bid time dynam program comput optim solut pre interv form denot optim solut problem bid item rang bid item ci denot set bid item pb price bid fb smallest index item maxim term de ne short problem npcomplet item bid rst term correspond accept bid case optim solut subproblem term correspond accept case optim alloc item solv problem order comput time proport size ci ci total time complex optim alloc proposit bid interv bid linearli order set item optim alloc comput time interv bid sj winner determin optim time cut circl item posit solv problem bid span cut algorithm fastest prior algorithm case time identifi linear order interest limit auction interv bid recogn remain problem search node fall special case solv special fast algorithm requir algorithm check exist linear order item set bid interv bid turn problem phrase interv graph recognit solut exist graph interv graph vertic put correspond interv real line interv overlap edg vertic interv interv graph recognit problem decid interv construct interv algorithm solv problem time interv easili produc linear order item figur show figur bid graph valid linear order case bid identi ed time algorithm recogn remain graph circular subgraph bid item fast algorithm case subsum substanti gener interv bid model item structur tree valid bid correspond connect subgraph figur strict gener linear order correspond special case path tree model distinct model tree node correspond bid figur subgraph applic special structur prevail web shop scenario good structur web page descript good link children good page tent link camp bug link fuel ll user bui item continu number children bui item submit bid price subgraph user chosen exit submit bid develop algorithm solv winner determin problem subgraph bid item pick arbitrari node root item tree assign distanc root level bid denot smallest level item sort bid order break ti arbitrarili dynam program comput optim solut node order level ci denot set bid includ level level algorithm comput function optim solut problem bid item goal comput bid item give level remov item disconnect tree root ub set root forest max pb pb price bid bottom comput node tree proposit recurr correctli comput optim solut bid item time bid dag special case bid item sharp slight gener make problem proposit set item structur direct acycl graph bid winner determin faster data structur bid graph adjac list bid graph cient insert delet oper bid track count ej bid delet correspond ej bid delet correspond ej arrai store node arrai entri node point list bid share item edg creat list list entri access time delet node current neighbor list mark node node arrai link list access posit bi delet cost reinsert node edg ej label rst remov node arrai insert front neighbor insert front js neighbor set cost bob branch xj neighbor delet store search list edg ect edg includ edg includ js neighbor backtrack reinsert js neighbor edg bob branch xj backtrack reinsert edg maintain heurist function heurist earlier winner determin algorithm implement time search comput faster approxim heurist shoham data structur comput fast store item dynam list support insert delet time item point heap maintain bid includ heap support delet time requir pointer item heurist function requir item maximum pj bid delet concern item talli current heurist function updat time bid delet reinsert delet bid item point posit item list delet js entri heap item updat heurist calcul di erenc updat reinsert heap item concern search updat heurist function log summat bid delet reinsert algorithm heap heap perform ordinari improv amort complex insert delet remain insert delet oper bob improv perform preprocess preprocess techniqu recent winner determin problem directli conjunct algorithm gener ca section discuss gener ca auction server prototyp support gener separ combin continu oper decemb multipl unit item multipl indistinguish unit item sale compress bid speed winner determin treat unit separ bidder care unit item de ne bid set bj request number unit item pj price winner determin problem nx nx max st xj ui ui number unit item sale basic free equal constraint place inequ previou winner determin algorithm set branch item shoham unit treat separ earlier algorithm integ bob talli number unit alloc search path decomposit techniqu dec art appli bid graph share edg st bid assign win remov neighbor bid remov unlik basic ca remov demand unit item remain item remov bid reinsert backtrack data structur improv mai appli chang admiss heurist set max pj vg set bid remain ned heurist construct give di erent item di erent weight search path cut lower bound techniqu low upper lower bound subproblem bid order bid pj descend order combinatori exchang combinatori buyer seller submit combinatori bid bid valu price repres sell bui winner determin problem maxim max nx st nx xj unlik earlier algorithm branch item shoham bob set basic ca optim solut occur leaf combinatori optim solut occur interior node search tree talli net number unit demand suppli neg path decomposit techniqu dec art appli bid graph share edg bid assign win remov neighbor bid remov unlik basic ca remov possibl match exchang charg base transact current exchang maxim volum max constraint algorithm appli case surplu maxim advoc surplu maxim maxim social welfar bidder item st item st vg set remain bid remov bid reinsert backtrack data structur improv mai appli modi cation upper bound lower bound techniqu discuss earlier paper construct function comput upper bound bound upper bound lower bound techniqu subproblem appli bid order branch maxim pj bid sort order preprocess step avoid sort algorithm strive alloc lead enhanc prune branch ij bid minim algorithm reach feasibl solut faster case free lead enhanc prune addit prune achiev branch bid pj bid pj pj branch search cut switch bid pj occur bid order case remain bid achiev prune reserv price seller reserv price ri item sell easili incorpor algorithm ad revenu collect bid sum reserv price item alloc bidder stricter interpret reserv price constraint requir auction payo collect bidder reserv price item addit item alloc addit item bidder easili incorpor algorithm concern auction payo alloc set item turn requir coincid maxim social welfar auction payo bidder payo bidder payo valuat bundl good minu assum altern branch bid pj test altern split bid set price cut item bidder enter true valuat auction enter true reserv price chang maxim max trivial incorpor item reserv price simpli subtract bid price preprocess step method exchang side place combinatori bid side bid bid side consid reserv fast winner determin algorithm ca exchang optim clear auction seller submit reserv price combin item express substitut reserv handl algorithm treat exchang seller reserv price bid algorithm combinatori exchang optim clear market substitut auction discuss bidder express combin greater equal sum valu part express aka substitut bid bidder solut prefer express extend directli gener ca present case reserv price bidder combin bid potenti join dummi item shoham bid share dummi alloc bob rst method ad edg pair bid combin xor addit constraint speed search optim mai bob support method directli optim appli prefer requir exponenti dummi item express acknowledg support nsf career award grant grant combinatori auction reach cient resourc task alloc multiag system item complementari determin winner recent shown optim search algorithm averag paper present sophist search algorithm optim ner includ structur improv reduc search tree faster data optim search node base drive identifi solv tractabl special case discov gener tractabl special design algorithm solv solv tractabl special case substanti faster gener combinatori auction multipl unit reserv price singleton combinatori substitut develop algorithm determin winner gener refer maximum match polyhedron vertic nat standard algorithm graph recognit acm sym discret algorithm tame comput complex combinatori optim approxim approach increment algorithm recogn interv graph siam journal comput truth revel approxim cient combinatori auction acm confer electron commerc bid alloc combinatori preliminari version hebrew sept combinatori auction mechan airport time slot alloc manag combinatori auction manag scienc implement contract net protocol base margin cost calcul limit vickrei auction comput multiag system algorithm optim winner determin combinatori auction extend version rst washington comp sci jan gener electron commerc server agent earli workshop ai electron pp juli tractabl combinatori auction draft israel data structur algorithm analysi edit
ML/1565 6 learn autom text fabrizio sebastiani dell itali autom text topic categori long date back earli late effect approach problem manual build automat classifi mean manual defin set rule encod expert knowledg classifi document set categori product avail autom text wit renew prompt machin learn paradigm automat classifi construct emerg approach machin learn gener induct process automat build classifi call set classifi characterist categori advantag approach good save term expert domain independ survei main approach automat text gener machin learn paradigm issu pertain document classifi classifi discuss detail final section devot techniqu specif emerg applic automat classif web page hierarch structur set categori categori subject storag content analysi storag inform search storag system evalu gener theori addit kei word machin text text classif introduct ten year autom document manag task gain promin statu inform system larg due widespread continu avail document digit consequenti part user access flexibl wai text text activ label natur languag text themat categori predefin task tc long date back earli earli larg due applic interest avail power disciplin major field investig inform system disciplin istituto di dell pisa sebastiani tc applic rang automat document index base control document autom metadata word popul hierarch catalogu web gener applic requir document select dispatch commerci tc system widespread commerci inform retriev tc system long past prototyp stage al consolid bodi literatur root solid methodolog bodi literatur present paper attempt review late effect approach tc manual build automat tc system mean manual defin set logic rule encod expert knowledg classifi document set categori perspect machin learn paradigm autom tc emerg approach machin learn gener induct process automat build automat text classifi set classifi characterist categori interest advantag approach accuraci compar human perform save term expert knowledg engin domain expert current dai tc meet point machin learn inform retriev disciplin concern autom document manag tc enjoi rich literatur fairli scatter intern journal devot special issu topic al lewi textbook journal devot tc textbook machin learn section devot section warn reader term text literatur thing discuss paper automat assign document predefin set main topic term automat definit set categori refer automat assign document set categori predefin task nowadai refer reader mind earli date period terminolog settl paper section formal defin tc task section review import applic tc put includ automat index boolean ir document filter section describ main notion machin learn approach includ notion train test set valid set discuss text classif start section introduc issu relat transform textual document form amen interpret algorithm classifi built issu includ term weight reduct section machin learn autom text le central issu induct construct text classifi train set manual classifi document algorithm induct construct tradit ir machin review includ probabilist neural regress tree dnf rule induct support vector classifi classifi built algorithm output confid correct classif interv order arriv polici individu threshold map interv set boolean topic section section tackl central issu evalu classifi induc mean method section fairli sensit wide believ evalu protocol yield reliabl comparison discuss measur import benchmark carri experi lead section slight detour main path discuss specif applic web page hierarch applic rise specif solut problem classifi classifi evalu section discuss open issu avenu research tc text task text defin task determin assign entri aij matrix dj dn ci aij cm set set document classifi aij file dj file dj ci task approxim unknown total function describ document mean total function coincid defin measur coincid call discuss detail section fundament understand task categori symbol label addit knowledg procedur declar assum sebastiani process build classifi mean constitut categori label sport attribut document categori basi semant basi metadata public document public document base sole endogen knowledg knowledg extract document exogen knowledg data provid extern semant document inher subject fundament notion relev document decid determinist exemplifi phenomenon inconsist human classifi document dj categori fact high frequenc articl case file depend subject judgment classifi notion relev document categori basic coincid notion relev document inform ir constraint enforc depend applic integ element assign element categori evenli popul section integ element assign element case mccallum cohen guthri al koller sahami joachim larkei li jain moulini ganascia al call case categori gener case number categori assign document dub case theoret point case gener algorithm classif classif simpli transform problem classif categori independ problem classif categori categori stochast independ depend assum case rule dealt section true algorithm perform machin learn autom text case classif fact obviou singl categori categori classifi attach document equal techniqu paper applic irrespect constraint discuss section enforc assum constraint sort enforc concern greater gener mean view classif problem matrix consist independ problem classifi document categori ci function approxim unknown function fi import distinct fill matrix row time fill column time distinct pragmat import set categori document entireti start relev choic method build method method section construct classifi definit slant classif style suitabl document time long span case user submit document time submit batch task form rank categori order estim appropri document call classif classif suitabl possibl categori insert exist set categori number document evalu mean document evalu task form rank document order estim appropri categori symmetr previou call classif commonli case document submit time common case newer categori dynam crop specif techniqu appli proport threshold method discuss section appli except techniqu discuss paper construct classifi capabl work mode sebastiani applic document automat tc back earli semin work number applic briefli review import applic explicitli discuss reason space speech mean combin speech recognit tc singer multimedia document caption analysi author identif literari text unknown disput authorship automat essai grade automat index boolean inform retriev system automat text classifi put applic spawn earli research field field grai heap maron automat document index inform retriev system reli control dictionari promin ir system boolean system document assign keyword describ keyword belong finit set word call control dictionari consist hierarch thesauru nasa thesauru aerospac mesh thesauru cover medic assign perform train human extrem costli activ entri thesauru view document index instanc document address automat techniqu paper recal section note case typic constraint keyword assign typic document classifi automat document classifi explicitli address document index applic fuhr al fuhr al robertson hard issu automat index control dictionari close relat topic autom metadata gener digit librari interest tag document metadata describ varieti aspect creation document type metadata role describ semant document mean bibliograph keyword gener metadata view problem document index control tackl mean automat tc techniqu system autom metadata gener tc techniqu system machin learn autom text document issu pertain document person document repositori address automat techniqu offic incom ad prior categori scheme adopt typic categori car real newspap handl applic deal high daili number classifi ad prefer automat system suitabl categori ad case typic constraint categori assign document polici make lean style similar applic automat file newspap articl section home automat group confer paper session document case paper document electron make document search easier interest approach system classifi search patent patent trademark larkei system document describ patent classifi hierarch set categori patent offic personnel search exist patent relat claim invent greater document filter document filter refer activ classifi dynam collect typic form stream incom document dispatch asynchron inform produc inform consum croft typic case inform produc agenc reuter inform consum newspap filter system block deliveri consum document consum interest case sport filter case incom document disjoint relev irrelev filter system perform topic categori document deem relev articl sport deem sport deal individu journalist individu sport access document high prospect interest filter train classifi filter topic categori interest user document filter system instal produc case role rout inform interest consum consum case role block deliveri inform deem uninterest user case system build updat sebastiani consum serv al case refer rest singl profil profil initi resembl stand ir updat system feedback inform provid user relev deliv messag trec commun hull call adapt case profil call rout batch depend document rank order estim relev inform scienc document filter tradit date back address system vari autom deal case discuss call select dissemin inform current awar chapter avail digit boost import system nowadai includ creation web select usenet construct inform filter system mean machin learn techniqu wide discuss crestani hull hull al lang lewi al schapir al al singhal al weiss al word disambigu word disambigu refer activ occurr text ambigu polysem word occurr english word bank bank england bank river engin task decid occurr bank week borrow monei bank refer import number includ index document word word ir document manag applic task view word occurr context document word categori case categori assign choic view tc task number work al hearst gener issu resolv natur languag import problem comput linguist instanc tackl mean tc techniqu line discuss spell preposit phrase part speech word choic select machin translat excel introduct field machin learn autom text wheat farm wheat wheat commod wheat export wheat wheat agricultur wheat wheat wheat wheat winter soft wheat fig classifi wheat categori constru keyword occur document categori small cap al search space automat document recent lot interest internet applic automat classifi web categori make commerci hierarch catalogu embodi web document catalogu address gener queri web search searcher find easier navig hierarchi categori issu search restrict search categori interest automat classifi web page obviou manual larg subset web problemat unlik previou case typic categori popul set categori ad obsolet delet automat web page site hierarch catalogu discuss recent paper al baker mccallum chakrabarti al mccallum al extens discuss section machin learn approach text main approach automat document classifi consist manual construct manual build expert system capabl expert system typic consist set manual defin rule type boolean effect document satisfi boolean stand normal classifi typic approach constru system al built carnegi group reuter agenc sampl rule constru illustr figur effect measur benchmark select author report figur exampl approach construct text classifi jacob drawback approach construct automat classifi exist knowledg acquisit similarli expert system rule manual defin knowledg engin aid domain expert expert document relev sebastiani expert judgment wheat wheat classifi wheat judgment wheat fig effect classifi figur measur subset reuter collect al chosen set set categori train interven classifi port complet domain set work repeat anew suggest approach give good effect al report result section subset reuter test figur outperform classifi built late machin learn techniqu classifi test dataset constru tabl clear dataset select reuter collect random favour subset convincingli argu result confid effect result obtain gener case earli approach construct automat document classifi machin learn gain promin eventu domin introduct machin approach gener induct process call automat build classifi categori ci characterist set document classifi manual ci domain induct process glean characterist document order classifi ci machin learn classif problem activ learn process knowledg categori train instanc belong advantag approach previou engin effort construct automat builder classifi mean origin set categori system port complet automat construct classifi set manual classifi requir domain expert knowledg engin term classifi built mean machin learn techniqu nowadai achiev impress level perform section make automat classif qualit viabl altern manual classif area document manag learn activ document cluster machin learn autom text train set test set machin learn approach reli exist corpu document classifi set categori system oper mean initi corpu correct matrix train set test set dg ds ca ci ca cai cm ca cam interpret indic expert file dj interpret indic expert file dj ci document dj call posit ci ci tc reformul task approxim function unknown mean function evalu stage classifi construct initi corpu typic divid necessarili equal train set tr set document observ characterist classifi categori test set te set test effect induc classifi document te fed classifi compar expert measur classif effect base valu obtain classifi match valu provid expert note order give scientif charact experi document te particip induct construct condit result obtain unrealist good page approach call approach altern approach approach page classifi induc partit initi corpu disjoint set iter appli approach pair result classifi gener train averag yield final classifi approach reminisc approach discuss section adopt initi corpu small train process afford lose inform present test document case tc initi corpora larg sebastiani case order intern paramet tune test valu paramet yield effect order make time safeguard scientif set split train set tr classifi induct valid set va call repeat test induc classifi aim paramet corpu defin gener categori ci percentag document belong train set gener valid set gener test set gener categori ci defin obviou substitut equat inform retriev techniqu text machin learn approach classifi construct heavili reli basic machineri inform retriev reason ir tc document manag share characterist ir techniqu phase text classifi life index perform document initi corpu oper phase techniqu queri induct construct evalu effect classifi perform approach classif differ tackl step case approach step step main theme section index reduct text amen interpret classifi algorithm index procedur map text succinct content invok numer index method index procedur uniformli appli valid test document alik choic text depend textual unit problem lexic natur languag rule combin unit problem composit true ir document repres vector freedom express denot document train set valid set includ document submit classifi oper phase machin learn autom text weight index term simpli occur differ approach account wai understand term wai weight term typic choic issu identifi term word occur document refer bag word approach document number experi al dumai al lewi found sophist yield confirm similar result ir bucklei number author noun individu index result found date irrespect notion motiv phrase grammar languag al lewi phrase grammat word occur contigu high frequenc collect al lewi argu reason discourag result index languag base phrase superior semant inferior statist qualiti respect index languag base singl word notwithstand discourag investig effect phrase index activ pursu true statist motiv phrase singer schapir al case argument appli smaller issu weight rang loss gener assum author al koller sahami lewi ringuett li jain moulini al moulini ganascia schapir singer al binari due natur learn system denot presenc absenc term document frequent case determin weight term tk document dj index techniqu repres document vector weight term standard tfidf weight function bucklei defin log denot number time tk occur denot number document tr tk occur document frequenc term function encod intuit term occur repres sebastiani content document term occur discrimin note formula index weight import term document term occurr deem null import order term occur document syntact role semant document reduc lexic semant term occur disregard issu composit semant except techniqu foil system sleep expert system singer order make weight fall interv document repres vector equal weight result tfidf cosin set term occur tr tfidf popular index function includ probabilist index method al techniqu index structur document croft function tfidf train set entireti start document frequenc data adapt empir substitut tfidf emploi al section remov function word word perform stem word share morpholog controversi benefici step tc similarli term cluster section stem report hurt effect mccallum recent tendenc adopt croft ng al al wiener al yang reduc term space section level stochast depend term section depend full text document select part index option except exist patent applic larkei consid twenti line background section claim novelti invent approach made fact document describ patent structur document titl pai extra import word al cohen singer weiss al tfidf class differ term correct factor appli formula instanc bucklei variat theme machin learn autom text applic document flat identif relev part document task reduct unlik tc high term space fact number term occur corpu problemat typic match algorithm ir cosin scale high valu sophist learn algorithm classifi induct algorithm chute techniqu reduct emploi effect reduc vector space reduct benefici reduc problem phenomenon classifi tune characterist train classifi overfit train data tend extrem good classifi data train remark classifi data classifi categori car sale train posit exampl concern sale yellow result classifi deem properti train constitut properti categori shown order avoid overfit number train exampl roughli proport number term fuhr bucklei page suggest train exampl term tc task mean dr overfit avoid smaller amount train exampl dr inform theori linear algebra rel merit test evalu variat effect classifi undergo applic function term space oper distinct wai view depend task approach local individu isol categori term chosen support classif categori ci al lewi ringuett li jain ng al al wiener al document dj categori mean subset origin classifi categori author adopt approach tend adopt valu overfit problem refer view exemplifi sahami briefli discuss section sebastiani term chosen support classif categori yang yang pedersen distinct impact kind techniqu chosen dr techniqu local global dr alik orthogon distinct drawn term natur result reduct term chosen term subset origin reduct term term subset origin term homogen origin term chosen term word obtain combin transform origin unlik previou wai dr tackl distinct tackl separ section reduct term select fix techniqu term select call term space reduct origin set term document yield smallest reduct effect respect effect obtain result publish literatur pedersen shown moder effect term space reduct depend aggress techniqu moulini al experi wrapper term select term set identifi mean learn method induc classifi al start initi term term set gener ad remov term term set classifi base induc test valid set term set result effect chosen approach advantag definit tune learn algorithm local number term categori depend categori easili separ approach qualifi brute forc number term set render cost prohibit standard tc applic easier altern wrapper approach filter approach al term score highest predetermin numer function measur term task explor solut rest section document frequenc simpl surprisingli effect global function document frequenc term al machin learn autom text systemat studi pedersen note section interpret event space set document train probabilist document frequenc written yang pedersen shown irrespect adopt classifi initi corpu term select techniqu reduc term space factor loss effect reduct factor bring small result valuabl term occur frequent collect contradict inform term document frequenc bucklei result contradict al overwhelm major word occur corpu extrem low document mean perform factor document word word high document frequenc preserv stop word remov perform form reduct word remain reduct note slightli empir form term select document frequenc adopt remov term occur train document valu rang form reduct al appli sophist form al li jain wiener al variant polici remov term occur time collect al joachim joachim popular valu rang mccallum al cohen term select function sophist function al yang pedersen yang liu correl coeffici al ruiz srinivasan inform gain lewi lewi ringuett moulini ganascia yang pedersen yang liu mutual inform al lam al larkei croft lewi ringuett li jain moulini al ruiz srinivasan yang pedersen odd ratio ruiz srinivasan relev score al simplifi al mathemat definit measur conveni tabl probabl interpret usual event space document mean probabl random document term tk occur belong categori estim count occurr train set function captur intuit valuabl term ci distribut differ set posit neg exampl categori sebastiani function denot mathemat form document frequenc inform gain log log mutual inform log χ correl coeffici relev score log odd ratio simplifi tabl main function term space reduct inform gain expect mutual lewi page larkei χ cc cardin train set formula constant damp factor function result document yang pedersen shown classifi initi sophist techniqu ig χ reduc term space factor loss small effect complex measur readili interpret result measur function clear ng al observ χ squar numer effect equat factor posit correl term categori neg correl squar root χ respect intuit result ng al show superior χ remark result refer term space reduct applic fuhr al step observ χ factor numer equal pair presenc denomin extrem rare yang pedersen shown effect machin learn autom text tc presenc denomin extrem rare extrem counterintuit elimin factor yield function test reuter collect section varieti result outperform obtain mean χ final note report improv perform function achiev gener statement properti function experi involv carri control condit varieti situat initi compar evalu report yang pedersen respect reduct term extract fix term extract origin set set term obtain effect synthet natur term due problem term optim dimens document content method term extract aim solv problem creat artifici term suffer problem approach kind experi tc term cluster latent semant index term cluster term cluster aim group word high semant cluster term dimens vector space term cluster term address problem term redund synonym target term term cluster method method group word method convert origin document dj base newli dimens lewi investig impact term cluster tc method call reciproc nearest neighbour consist creat cluster term similar measur similar result inferior obtain possibl due disappoint perform cluster lewi page relationship captur cluster systemat relationship hope approach work li jain view semant word term train document techniqu context hierarch cluster algorithm wit margin effect sebastiani small size experi section hard reach li jain provid exampl cluster activ guid categori label attach document baker mccallum provid distribut cluster method emploi cluster term tend presenc group categori carri context naïv show effect loss aggress show effect improv aggress level reduct latent semant index latent semant index al techniqu reduct origin develop context ir order address problem deriv polysem word dimens document queri techniqu compress vector repres document queri vector space dimens obtain combin origin dimens pattern lsi infer depend origin term corpu depend newli independ dimens function map origin vector vector obtain appli singular decomposit incid matrix form origin document vector context techniqu appli deriv map function train set appli test document produc space characterist lsi reduct function newli obtain dimens unlik case term select term intuit interpret tend work bring semant structur vocabulari corpu al page discuss case classif categori demograph shift econom impact neural network classifi experi discuss case document posit test instanc reveal sentenc nation grew million peopl american left industri agricultur south classifi incorrect local reduct perform χ term select retain top origin correct task tackl mean lsi exemplifi lsi sentenc term relev categori select χ possibl word concur produc lsi term gener document space categori al page put great number term contribut small amount critic combin evid major problem drawback origin term good discrimin discriminatori power lost vector space machin learn autom text wiener al lsi altern local creat lsi specif individu global creat singl lsi entir categori set result show approach perform approach shown perform simpl term select techniqu base relev score measur tabl al compar term extract χ term select classifi induct techniqu linear discrimin logist regress neural rout applic result show lsi effect χ method perform equal case neural network classifi work tc made lsi similar term extract techniqu li jain weigend al yang method induct construct problem induct construct text classifi tackl varieti wai describ detail method proven popular time mention exist standard approach induct construct classifi categori ci consist definit function document return statu number roughli repres evid fact dj classifi ci function mean approach discuss section defin term approach discuss section measur vector close definit threshold interpret classifi dj interpret classifi dj ci case occur classifi binari judgement al moulini al threshold trivial open interv issu subject section section concentr issu discuss number approach tc literatur section present algorithm qualit focu method classifi induct perform classifi induc mean tackl section sebastiani probabilist classifi start present method classifi induct discuss probabilist approach apt text classifi report literatur probabilist probabilist classifi view term probabl document repres vector dj term fall categori attempt comput probabl applic probabl interpret space repres probabl randomli pick document vector dj probabl randomli pick document fall categori ci estim equat number vector dj high hold reason clear shortli concern order allevi common make assumpt coordin document vector view random statist independ independ assumpt encod equat probabilist classifi make assumpt call naïv account probabilist approach tc report literatur koller sahami larkei croft lewi lewi gale li jain robertson hard charact classifi due fact assumpt verifi natur occur document corpora naïv approach binari independ classifi sparck jone result vector document write pki short factor equat written ki pki pki observ tc applic document space partit ci complement plug equat equat log obtain log log point full independ assumpt equat made naïv assumpt wire naïv weaker link depend written machin learn autom text pki log log pki pki log pki log ki write pki short convert equat singl equat subtract equat equat obtain log log log pki pki pki log pki note monoton function directli note factor log log ki factor constant disregard defin classifi categori ci basic requir estim paramet ri train obviou matter probabilist classifi call parametr induct construct consist estim probabilist paramet train data note gener classif document requir comput sum presenc log ki ki factor account vast major document vector binari independ classifi illustr variant naïv common denomin equat recent paper lewi excel roadmap direct research naïv classifi import direct lewi highlight aim relax constraint term vector repres document weight index techniqu fuhr bucklei salton bucklei account term tk document dj plai kei role ir introduc document length model clear equat log higher long document document valu irrespect semant ci document length account easi approach classif section problemat probabilist section answer method section adopt case categori document dj chosen mean fix document dj factor formula influenc choic categori file dj sebastiani adopt baker mccallum switch interpret naïv document term event case multipl binomi random variabl case singl multinomi random variabl account document length natur note drawback occurr word document view assumpt strikingli standard word independ assumpt similar suffer guthri al relax independ assumpt hardest rout inevit produc classifi higher comput cost harder paramet estim problem earlier effort direct field probabilist ir rijsbergen shown perform improv hope fact binari independ assumpt seldom harm effect theoret justif pazzani quotat ir research paragraph casual unlik type literatur probabilist classifi intertwin probabilist ir al review attempt determin probabl document fall categori denot approach ir relev notion essenti involv central model controversi point applic naïv tc term select appli induc degrad perform classifi li jain report disastr perform term space reduct base mutual inform appli naïv applic reduct techniqu degrad effect appli tree classifi joachim shown naïv classifi work term space consist term rank lowest inform gain measur perform random classifi show uninform word text joachim inform term classifi work baker mccallum discuss section contradict work lewi ringuett safe conclud systemat experi issu discuss naïv classifi excel tree classifi probabilist induct method essenti quantit effect readili interpret human class algorithm suffer agricultur wheat wheat machin learn autom text soft wheat farm winter wheat commod export wheat wheat wheat fig tree dnf rule figur edg label term leav label categori denot problem symbol induct rule learner discuss section tree induc import exampl tree text classifi section consist tree intern node label branch depart label test weight term test leaf node label necessarili categori classifi test document dj test weight term label intern node leaf node label leaf node assign dj text classifi assum binari document consist binari tree tree illustr figur number standard packag induct tree train tree approach tc made packag popular packag al cohen singer joachim lewi catlett jain tc endeavour base tree packag includ al lewi ringuett weiss al procedur induct tree categori ci set train exampl consist strategi check train exampl label ci select term partit train exampl class document place class separ process repeat leaf node sebastiani tree gener train exampl assign categori chosen label leaf node kei step process choic term tk oper choic gener made inform gain entropi criterion tree prone branch excess specif train data tree induct method includ method grow tree prune remov overli specif branch probabl misclassifi test document variat basic schema tree induct interest reader refer section tree text classifi main classif tool al lewi catlett lewi ringuett baselin classifi singer joachim member classifi jain schapir al schapir singer weiss al project tree tc special place occupi system al system import constitut final result air import endeavour histori tc air span durat ten year fuhr al fuhr al produc system oper emploi classif corpora scientif literatur million import theoret field probabilist index fuhr bucklei approach tc darmstadt index approach meant section term control synonym tc dia extend index vocabulari bucklei dia base preliminari comput associ factor free text term tk categori proport train document tk classifi ci factor call coeffici earli paper tc robertson hard comput associ dia train tree step descript occurr tx kj term tk train document descript updat characterist occurr tx kj section dj tx kj relev descript transform vector tree algorithm select attribut vector partit train vector class ident vector applic system al applic index physic richli document seri paper doctor written german interest reader consult al detail bibliographi machin learn autom text classifi test document descript step appli dl probabl correct attribut ci dl identifi percentag train vector assign class correspond correct rule classifi classifi categori ci built induct rule learn method consist disjunct normal form conjunct condit formula type manual built constru system illustr figur denot presenc absenc term test head denot classifi ci dnf induct method equal power tree method machin learn theori advantag tend gener compact classifi tree induc rule induct method attempt select cover rule rule correctli classifi train minim criterion tree typic induc dnf rule induc fashion start induct classifi train view term document equal ci ci document posit neg ci set dnf classifi score tremend high term overfit induct algorithm emploi process rule simplifi seri modif remov merg compact time affect properti classifi end phase similar spirit emploi tree abil correctli classifi train exampl trade gener individu dnf rule learner vari wide term heurist criteria emploi prune induct dnf rule learner appli tc charad ganascia ripper cohen cohen singer al al mention dnf induct method mention deal rule proposit logic research carri rule order obtain induct logic program method cohen extens compar proposit order induct tc applic compar proposit learner ripper order version conclud addit power order logic bring modest benefit sebastiani regress model tc endeavour made regress model al lewi gale al statist learn regress refer problem approxim function mean function ˆ fit train data page describ linear squar fit yang chute document dj vector input vector standard vector weight output vector consist vector repres categori weight vector binari case train standard case test classif task determin output vector test document input vector build classifi boil comput matrix ˆ ˆ comput matrix train data comput linear fit minim error train set formula arg min arg stand usual argument def repres norm matrix column input vector train matrix column output vector train document ˆ matrix comput perform singular decomposit train set result matrix ˆ gener entri repres associ categori ci term tk shown effect text classifi date comput cost comput ˆ matrix higher competitor tc arena linear classifi linear classifi categori interest term vector ci belong space document correspond product document vector categori vector interest notic classifi document weight equat product vector correspond cosin kj ki repres cosin angl α separ vector interest li fact similar measur queri document comput standard ir mean turn linear classifi classif perform invok machin learn autom text standard ir engin linear classifi call reli extract explicit profil prototyp categori train set obviou advantag term profil readili interpret human neural network classifi linear classifi partit broad batch classifi classifi batch induct method build classifi train set tc batch induct method linear discrimin model stochast depend term reli covari matric categori al hull al foremost batch linear classifi rocchio import tc literatur discuss separ section section concentr classifi induct method build classifi examin train increment refin examin advantag tc applic train set entireti categori chang adapt filter extrem apt applic expect user classifi provid feedback test document case train perform oper phase exploit user feedback applic kind interact classif croft section adapt filter simpl method perceptron tc applic al wiener al subsequ experi al ng al classifi ci set weight posit train dj vector binari classifi built attempt classifi result classif examin correct wrong weight classifi dj posit ci weight term tk fix quantiti learn dj neg ci weight α note stage train phase classifi reach reason level fact weight low mean tk neg contribut classif behaviour discard perceptron algorithm increment induct sort term space al section perceptron classifi shown good effect experi quot perceptron algorithm addit algorithm multipl variant perceptron posit winnow al differ perceptron constant sebastiani promot demot promot demot achiev balanc winnow al koster variant posit classifi consist weight ki ki term final weight comput product differ ki ki misclassif posit activ term ki weight promot ki weight case neg instanc ki promot ki demot promot demot posit balanc winnow neg perceptron algorithm posit winnow weight posit experi conduct dagan al posit winnow show effect perceptron algorithm turn outperform version balanc winnow result confirm analyt intuit algorithm discuss theoret learn literatur exampl classifi refin call exponenti gradient classifi appli time tc al sleep expert algorithm singer koster version balanc winnow addit multipl kei differ algorithm algorithm updat classifi misclassifi train classifi updat weight term activ linear classifi lend tc classifi ci queri set test document case test document dj queri set classifi worth notic induct linear classifi typic local term space import term categori ci select measur function illustr tabl measur measur comput posit train exampl categori ci entir train set rocchio classifi rocchio classifi reli adapt tc case formula relev feedback tc method root lie ir tradit machin learn adapt hull rocchio classifi object research al joachim koster schapir al singhal al baselin classifi singer fuhr al joachim lewi al schapir singer al member classifi croft section machin learn autom text method comput classifi categori ci mean formula β γ weight term tk document dj β γ control paramet set rel import posit neg exampl β set γ al hull joachim al correspond view profil ci centroid posit train exampl rocchio classifi reward close test document centroid posit train distanc centroid neg train exampl time role neg exampl set β high γ low cohen singer al joachim β γ method easi result classifi tend effici al term drawback document categori tend occur disjoint cluster set newspap articl fall sport categori deal box rocchio classifi miss centroid document fall cluster figur rocchio linear disadvantag basic divid space document document fall case classifi document fall situat graphic depict figur document classifi ci fall circl note posit train exampl classifi correctli classifi due fact rocchio basic averag posit averag partli repres set enhanc basic rocchio framework issu applic rocchio formula profil extract set neg train instanc tr consid sampl set posit neg train select γ contribut factor difficult document relev document correspond queri zone method ir singhal al method origin observ origin rocchio formula relev feedback tend gener document user judgment tend score highest previou rank earli applic rocchio formula tc al gener make distinct gener neg schapir al individu issu sebastiani fig comparison behaviour rocchio classifi small cross circl denot posit neg train big circl denot classifi rocchio queri consist centroid posit train exampl document base consist neg train similar fuhr al identifi categori ci posit exampl sibl categori applic work page hierarch catalogu section notion categori similar polici adopt al ruiz srinivasan queri zone method enhanc statist method call dynam feedback schapir al shown rocchio classifi achiev level effect compar machin learn method section time quicker train recent result doubt bring renew interest rocchio punch bag sophist learn method singer joachim lewi al al yang neural network neural network classifi network input unit repres output repres categori categori weight edg connect unit repres condit depend relat classifi test document term weight assign input activ unit propag forward output consequ determin typic train neural network term weight train document load input misclassif occur error machin learn autom text chang paramet network elimin error simplest type neural network classifi perceptron al ng al linear classifi extens discuss section type linear neural network classifi implement form logist regress experi al wiener al good effect result neural network srinivasan al weigend al wiener al yang liu network addit tc repres higherord interact term network learn compar experi relat neural network linear counterpart yield improv al small improv al classifi classifi build declar categori judgment expert train document similar test document method call lazi learn defer gener train data queri instanc introduct method call reason tc literatur due masand colleagu al masand al tc endeavour method emploi includ lam al larkei larkei li jain yang pedersen yang liu present approach base nearest algorithm implement yang system decid dj classifi train document similar dj classifi answer posit larg proport posit neg version section fact similar document classifi ci weight similar test document classifi document mean comput set document dz maximum valu correct matrix section repres measur semant test document dj train document match probabilist croft rank ir system method repres graphic figur sebastiani knn classifi request rj request weight term train document weight train document categori assign categori fig graphic method node dj weight equal weight flow left multipli weight edg weight incom node sum weight node ci receiv result process evid approach natur gear arc train document categori cm result network classifi categori ci origin network run classifi categori run document time unaccept entir train set de facto reason construct classifi involv determin threshold indic train document consid comput threshold determin valid set larkei croft yang found yield effect experi shown significantli degrad perform note unlik linear subdivid document space suffer problem discuss end section graphic depict figur charact respect rocchio appreci remark proven number experi section advantag classif document categori interest machin learn autom text perform time linear cardin train set remark learn method effici method classif train phase perform comput classif time techniqu nearest neighbour techniqu tc literatur cohen implement classifi extend standard relat dbm technolog soft whirl system score function altern equat obtain small statist improv version equat experi show techniqu outperform number tree classifi ripper dnf classifi interest variant basic approach reinterpret equat redefin posit ci neg ci differ origin approach train document dz similar test document dj belong inform discard consid neg weight neg classifi dj ci combin method present ho work system place train author call instanc approach result train obtain set cluster cli linear classifi document belong cluster algorithm discuss section linear classifi place train comput def tr posit instanc process tr repres instanc repres weight sebastiani fig induct support vector classifi small cross circl repres posit neg train line repres surfac surfac thicker middl element widest set parallel surfac minimum distanc train small box support vector exploit superior effect illustr figur nn linear classifi time avoid sensit presenc posit instanc ci region document space posit instanc ci train document build classifi support vector machin applic support vector machin method tc recent joachim subsequ al yang liu geometr method attempt surfac space separ posit neg train exampl surfac mean separ posit neg widest separ properti invari respect widest shift yield parallel surfac σ method practic applic socal structur risk minim surfac true probabl misclassif randomli unseen test concept understood case posit neg linearli case surfac case figur set parallel line chosen surfac support vector method set parallel line middl σ machin learn autom text distanc element set highest noteworthi surfac determin small set train call support vector method applic case posit neg exampl linearli separ yang liu compar linear case assumpt made categori linearli case standard obtain slightli result case joachim support vector machin offer import advantag term select support vector machin suffer overfit scale human machin effort paramet tune valid set theoret choic paramet shown provid effect dumai al recent test algorithm train svm text classifi shown bring train speed compar easi method rocchio classifi method classifi base idea task requir expert knowledg expert individu judgment appropri combin idea appli classifi task decid document dj classifi categori combin outcom appropri classifi choic choic combin machin learn literatur order good classifi form independ possibl base radic intuit classif perform classifi term index approach term induct method appli order induc avenu explor combin rule experi literatur simplest rule major vote binari classif judgment obtain classifi pool classif reach major vote odd jain lier tadep method suit case includ classifi empir attempt implement principl present version balanc winnow algorithm al classifi touch previou section fit sleep expert singer al discuss section sebastiani binari function rule weight linear combin weight sum individu produc classifi yield final weight wj meant reflect expect rel effect classifi wj weight valid set croft polici dynam classifi select classifi yield effect valid exampl similar dj judgment adopt jain intermedi adapt classifi combin judgment classifi sum individu contribut weight effect shown valid exampl similar dj jain classifi mix result tc larkei croft combin naïv rule experi combin classifi outperform individu classifi combin classifi improv combin result give strong support idea classifi profit complementari strength individu member small size test set suggest reach li jain experi form combin naïv nearest neighbour tree classifi induc mean combin rule work dc acc case form naïv subspac classifi combin mean acc narrow individu classifi attempt classifi acc gave result mv light fact approach cost trivial amount sum comput cost individu classifi cost incur comput combin remark small size experi test set document draw definit approach adopt boost boost method al schapir singer occupi special place classifi classifi form obtain mean learn learn method call weak tree classifi weak result form tree classifi kei intuit boost classifi train conceptu parallel independ classifi train classifi account classifi perform train concentr machin learn autom text exampl perform worst induct classifi pair attribut ij ij set equal pair meant repres hard correct pair classifi weight exploit induct classifi special tune solv correctli pair higher import weight induc classifi appli train result weight ij updat ij updat pair correctli classifi import weight pair misclassifi weight classifi weight linear combin rule appli yield final weight attribut contribut classifi function effect shown train set system singer boost algorithm provid experi tree weak learner algorithm simpli call adaboost al explicitli gear maxim aim minim rank loss correct categori rank individu experi conduct test schapir al shown adaboost outperform sleep classifi prove effect experi singer experi schapir singer show adaboost sleep naïv standard rocchio classifi boost jain tree classifi weak author report improv effect pure weak learner approach similar boost emploi weiss al work author experi tree averag leav complex simpl tree singer eventu combin simpl mv rule combin rule similarli mechan document misclassifi previou tree enforc author determin approach yield excel effect gain individu tree case excel effect tout gain rise tree case reach plateau tree method previou section give overview complet approach autom tc exhaust respect recent disciplin brought fragment term learn schapir al show simpl modif polici evalu classifi base section effect sebastiani fall squar class remain isol attempt reason space discuss mention exist approach base bayesian infer network al lam al genet algorithm al determin threshold polici determin threshold discuss begin section depend constraint applic polici threshold singer schapir al wiener al call probabl threshold case probabilist classifi case threshold function lewi consid fix threshold τ equal note result assign test document categori ci assign singl test document categori cj consid threshold categori ci establish probabl estim suggest result differ effect variant yang threshold categori ci threshold test valu valid set yield chosen effect function popular polici proport threshold larkei lewi lewi ringuett wiener al call aim polici set threshold test set gener categori ci close train set gener idea encod principl percentag document train test set classifi ci drawback threshold polici obviou lend yang refin version factor multipli obtain yang claim empir determin valid smoother recal obtain section found optim valu lie rang depend fix threshold polici threshold stipul fix number equal assign document dj applic tc autom document index lam al strictli threshold polici defin begin section happen classifi polici home machin learn autom text fact equal document system term lewi found proport polici superior threshold effect test slightli inferior section yang found threshold superior proport threshold due valid found fix threshold consist inferior polici fact result obtain classifi doubt reinforc choic threshold polici influenc appli text classifi document index boolean system fix threshold polici proport threshold method chosen web page classif catalogu final note recal applic threshold return origin produc function binari obtain mean threshold typic case interact classif system croft document dj system meant suggest rank list categori apt classifi dj final list categori ci rank expert flat set relev categori produc threshold interact classif system qualiti train data train data trust repres sampl unseen data result complet automat classifi trust complet evalu issu text case ir evalu document classifi typic conduct analyt reason tendenc order evalu system analyt prove system correct formal specif problem system solv respect correct complet central notion tc relev document due subject inher evalu concentr issu evalu effect capabl measur effect recal classif effect measur term classic ir notion recal adapt case document wrt ci defin condit probabl aix probabl random document dx classifi correct recal wrt ci defin condit probabl probabl sebastiani categori expert judgment ci classifi judgment tabl tabl categori ci random document dx classifi valu discuss obtain pr valu global categori set borrow terminolog pr view classifi wrt categori set view wrt defin pri rei pr line yao subject valu measur expect user system behav correctli classifi random document ci probabl estim term tabl categori ci test set tabl posit wrt error number document test set incorrectli classifi neg wrt posit wrt neg wrt error defin estim wrt ci recal wrt ci obtain ˆ pri obtain estim recal rel categori method recal obtain global sum individu pr ˆ µ tp tp fp µ tp tp fn superscript stand tabl shown tabl obtain sum tabl recal evalu averag result pr ˆ ˆ pri machin learn autom text categori set expert judgment classifi tp fp judgment fn tn tabl global tabl ˆ rei superscript stand import method give categori classifi perform categori larg number posit test effect complet agreement author perform mislead frequent topic weight heavier al page favour reward classifi perform robustli presenc skew categori distribut major topic count lean assum drop subscript rest section adapt case obviou measur effect measur altern pr commonli machin learn accuraci estim error estim ˆ er wide tc reason yang typic larg denomin tc make insensit variat number correct pr show ac evalu case low def repres averag percentag categori test trivial classifi set aij classifi document outperform classifi section consequ adopt ac paramet tune classifi valid set result paramet choic make classifi behav trivial effect measur section suggest base recal valu sebastiani cess failur valu rel case posit dj categori classifi score binari confid classifi fact dj classifi system receiv partial credit system lean correct direct directli confid correct modifi method offer evalu confid page measur reward choic good threshold autonom classif system interact classifi type confid classifi influenc categori rank system measur altern effect criteria effect seldom classifi evalu effici import applic seldom sole yardstick evalu compar due volatil paramet evalu rest effici criterion classifi similar effect interest evalu carri dumai al compar classifi induct method train effici averag time build classifi categori ci train set tr induct classif effici averag time classifi document dj categori ci refer interest reader al detail except domin effect criterion tc evalu class measur theori extend effect econom criteria gain loss util base defin util matrix tabl numer valu repres econom gain brought true neg true greater effect case trivial case util schapir al experi util matric machin learn autom text categori set expert judgment classifi judgment tabl util matrix matrix matrix matrix correspond effect util measur tc discuss detail lewi work util measur emploi crestani cohen singer hull al lewi catlett matter util text filter trec evalu recent util measur hull problem util effect valu util matrix extrem needless evalu measur add element difficulti classif system section classifi compar util matric mention fact effect measur discuss section includ adjac score coverag singer singer pearson correl recal croft top candid croft top croft attempt discuss detail effect measur relationship standard point fact tc disciplin make consist effort agreement evalu issu understand rel merit method combin effect measur recal make isol order obtain classifi set threshold obtain trivial acceptor classifi set aij classifi document case low equal averag test set gener everydai ir practic higher trivial tempt infer symmetri trivial undefin denomin case trivial tabl clear definit tp depend posit split true posit tp posit depend cardin sebastiani recal tp tp fp trivial undefin trivial acceptor trivial collect trivial collect tp tp fp tp tp fp tp tp fn fn tp tp tp tp fn undefin tabl trivial case text tn fp tn tn tn fp undefin tn fp tn tn tn fn tn tn fn undefin fn tn tn level obtain price low recal tune threshold classif algorithm tune word riloff lehnert liber improv detriment conserv pr detriment classifi measur mean effect measur pr concur determin measur effect comput averag threshold success set valu recal valu threshold comput averag result valu methodolog complet analog standard evalu methodolog rank retriev categori place ir queri frequent classifi rank test document appropri categori al yang yang yang pedersen test document place ir queri categori place document frequent classifi rank categori appropri test document al larkei croft schapir singer wiener al note case posit recal point view classifi judgment dichotomi tp interest trivial acceptor trivial recal tp tn trivial trivial fact arbitrarili set threshold recal viceversa true classifi emploi threshold tree classifi dnf rule classifi produc binari tune difficult al page machin learn autom text redefin basi note measur make classifi perform recal absolut number vari effect comput breakeven pr equal al cohen singer dagan al joachim joachim lewi lewi ringuett moulini ganascia ng al yang reason classifi pr equal pr monoton def monoton valu pr set pr interpol breakeven comput averag valu note pr close interpol breakeven reliabl indic effect effect comput β cohen singer lewi gale lewi moulini al ruiz srinivasan formula β rel import attribut pr β coincid β coincid β attribut equal import pr shown al yang breakeven classifi φ equal effect measur classifi tune threshold intern paramet result effect achiev classifi tune paramet threshold mean perform repeat experi valid set valu paramet pk fix default case paramet chosen paramet pk valu paramet end yield effect chosen benchmark collect standard benchmark collect initi corpora tc public domain wide reuter consist set newswir stori classifi categori relat econom reuter collect account work tc accomplish translat reliabl compar experi carri subtli condit order sebastiani result classifi directli experi perform classifi experi collect document effect measur complet set categori choic train set test set made effect measur complet test set effect measur depend paramet depend util matrix paramet choic made classifi lot reuter perform caveat mind experi classifi version yang shown lack complianc condit significantli influenc result tabl list result experi perform major version reuter experi comput breakeven result popular effect measur readili compar note result belong column directli compar yang show experi carri directli compar strang includ percentag test document neg exampl tend depress effect experi perform compar collect consist restrict popul categori collect collect frequent tc evalu ohsum set hersh al lam ho lam al lewi al ruiz srinivasan yang pedersen document titl medic journal consist subset medlin document categori term mesh thesauru collect freeli download consid variant reuter decid cover experi perform variant reuter benchmark list small number author experi variant make report result difficult interpret includ experi perform origin al singer ohsum collect freeli download machin learn autom text system type result report document train document test document categori word probabilist probabilist probabilist probabilist probabilist probabilist nb probabilist liu tree tree ind tree ringuett rule ripper rule singer rule singer rule charad rule ganascia charad rule regress regress liu linear linear ho rocchio batch linear singer batch linear rocchio batch linear rocchio batch linear ho rocchio batch linear classi neural network neural network liu neural network ho ho liu svm svm svm svm liu singer bayesian net bayesian net tabl compar result classifi obtain version reuter collect entri breakeven measur boldfac perform collect sebastiani newsgroup set lang mccallum joachim mccallum nigam mccallum al nigam al schapir singer document messag post usenet categori newsgroup ap cohen cohen singer lewi catlett lewi gale lewi al schapir singer schapir al al schapir al al cover experi perform collect reason illustr footnot case number author experi collect make comparison difficult classifi publish list tabl attempt compar perform tc method discuss order bear mind comparison tend reliabl concern experi perform author carefulli control condit problemat involv experi perform peopl case extran learn algorithm influenc result choic classifi paramet standard complianc safe scientif practic tune paramet test set separ valid discuss publish paper method appli comparison classifi classifi φ φ compar test benchmark collect typic team research background condit method yield reliabl result classifi φ φ compar test collect bc bc typic team research possibl background condit classifi test tc tc direct comparison method test indic rel result test obtain indic rel effect φ φ reason discuss method yield reliabl result number interest drawn tabl method rel bc machin learn autom text bc bc harder collect bc evid fact inequ direct consequ peculiar characterist discuss section rel perform rememb attempt classifi support vector regress method deliv perform suffici evid opt effici issu plai role break close tie network linear classifi work slightli mention method linear classifi probabilist naïv classifi worst classifi result confirm earlier result al found classifi base linear discrimin linear neural perform rocchio recent result schapir singer rank rocchio perform train data tabl suffici tree classifi note recent work dumai al version tree classifi shown perform top perform system support vector machin renew interest type text interest previou result report earlier literatur singer joachim lewi catlett lewi ringuett lowest perform displai classifi implement yang includ learn compon show learn techniqu automat tc complet recal highest perform report literatur reuter collect belong manual construct classifi classifi test standard variant reuter mention tabl clear test set breakeven obtain chosen word base comparison document categori treat vector weight term vector space model word implement yang determin differ effect ad learn compon classifi bring word call str yang chute classifi al sebastiani safe scientif practic demand fact figur indic perform manual approach convincingli question import bear mind absolut final judgment compar effect tc method reason applic context exhibit characterist found classifi respond differ characterist studi joachim involv support vector rocchio naïv show classifi similar effect categori posit train exampl categori fact experi involv method score vector worst naïv tabl result indic fact condit reuter invalid drawn note worth statist test author troubl valid result mean test test verifi strongli result support claim system φ system φ verifi differ setup affect measur effect system φ hull al work valid result mean anova test friedman aim determin differ effect method term ratio differ effect variabl conduct similar test rank posit method categori yang liu defin full suit appli effect appli systemat comparison infer rel effect exampl test tc cohen cohen joachim koller sahami lewi al wiener al automat web page recent applic tc interest web hierarch set categori reason discuss separ rest paper rise set techniqu specif tackl problem term classifi induct evalu reason applic rise specif techniqu web page special kind consist text set incom outgo pointer index reduct al index techniqu specif web document base notion document figur test machin learn autom text fig document document form text window hypertextu pointer document dj akin short web author written dj author claim dj faith content dj document dj classifi mean tradit learn method differ dj mean tradit text index method order obtain dj fuhr al variant tradit index obtain document dj combin index dj document point dj choic dictat fact web page interest web site page interest web site collect entri point children page site tradit index method classifi easili dismiss root page method subordin page contribut defin mean koller sahami method term select classifi induct specif address situat categori hierarch intern node ci hierarchi set term select base train document belong ci categori sebastiani term select discrimin children categori ci term select ci classifi built decid categori document classifi ci classifi note discuss section case term select ci meant support classifi document ci case term meant support document classifi ci classifi document dj classifi categori submit classifi root node classifi level intern node classifi classif document involv invoc length path root node leaf node mean author classif task number simpler classif radic reduc number term individu classifi base factor mean avoid overfit easili afford sophist classifi complex depend number term individu step classifi induct chakrabarti al method induct web page classifi arc system automat web page base hypothesi pair paramet author measur dj ci term number page point hub measur dj ci term number page point arc topic authorit inform web page deal aim find web page relev ci arc issu queri ci altavista search initi set document relev ci phase document distant step dj forward citat graph ad set iter algorithm appli page dj substitut sum valu page dx point substitut sum valu page dy point formal intuit hub page high page point author page high page refer page author report algorithm ident top author hub page approxim iter method induct classifi hierarch structur categori set ruiz srinivasan system hierarch structur set gate network expert network gate network categori ci neural network decid document dj machin learn autom text plausibl candid children categori dj propag children node neg document propag expert network categori ci neural network decid document dj classifi cj leaf node consist expert network intern node includ gate possibl includ expert network document receiv node process whichev gate expert network present document dj intern node leaf node desir case intern node repres higher level concept experi perform system yield effect neural network built technolog individu gate expert network evalu larkei croft section work web defin effect measur explicitli gear case hierarch structur apt web case idea redefin effect success notat section failur defin case categori ci attribut system dj categori ck sibl ci correct autom tc establish major area inform system number domain applic numer document digit form bound dramat number import applic sheer number document classifi short time applic make manual altern dramat improv product human classifi applic classif final human expert judgment croft provid tool quickli plausibl reach effect level compar obtain manual tc involv train effect manual tc improv progress research level effect autom tc grow steadi plausibl eventu reach plateau plateau higher effect level manual tc reason earli onward effect level text classifi dramat entranc tc arena machin sebastiani learn method back strong theoret motiv exampl multipl weight updat winnow adapt resampl support vector provid sharp contrast theoret weak method rocchio field machin learn found challeng dataset consist hundr thousand document ten thousand term wide mean tc good benchmark check learn applic fairli scale substanti size mean activ involv machin learn commun autom tc disciplin bound grow success stori autom tc encourag extens method techniqu neighbour field applic techniqu typic autom tc extend successfulli autom document express slightli classif noisi text result optic charact tackl al author proven emploi noisi text train phase text affect sourc work test effect level compar obtain case standard text achiev classif speech tackl schapir singer author classifi answer phone request rout call oper call type radic current situat bright current research automat document themat categori text medium interest attempt imag base textual reason captur real semant content automat index media open research problem system attempt detect content imag colour distribut gener problem imag semant unsolv main reason fact natur languag text admit fewer variat emploi media concept natur languag express trigger imag colour view solv multimedia index problem satisfactori gener methodolog classifi discuss paper text appli autom multimedia reason effect level high add common sentiment research autom index multimedia document machin learn autom text acknowledg comment earlier draft refer probabilist learn select dissemin inform inform process manag autom learn rule text categor acm transact inform system automat web page categor link context analysi european symposium hypermedia artifici intellig pp distribut cluster word text acm intern confer research develop inform retriev pp inform filter inform side commun acm automat index system research applic acm intern confer research develop inform retriev pp reprint jone willett pp automat document natur langag process expert system techniqu acm intern confer research develop inform retriev pp automat document classif journal associ comput machineri guest editori special issu text categor machin learn forthcom automat resourc compil analyz hyperlink structur text comput network isdn system autonom document classif busi intern confer autonom agent del pp optim conveni onlin access bibliograph inform servic reprint pp learn classifi english text ilp method de raedt advanc induct logic program io press text categor relat learn intern confer machin learn pp learn rule classifi aaai spring symposium machin learn inform access pp join text classif whirl intern confer knowledg discoveri data mine pp learn method text categor acm transact inform system inconsist probabilist inform retriev acm transact inform system sebastiani trade mip memori knowledg classifi censu return connect machin commun acm van document survei probabilist model inform retriev acm comput survei learn text categor confer empir method natur languag process pp index latent semant index journal american societi inform scienc optim simpl bayesian classifi loss machin learn induct learn algorithm text categor acm intern confer inform knowledg manag pp automat index project ifip congress pp automat automat assign index classif free index journal document direct text categor gammerman causal model intellig data pp springer probabilist model automat index intern confer par pp model retriev probabilist index inform process manag probabilist learn approach document index acm transact inform system final prototyp project commiss european multistag index system larg subject field intern confer par pp retriev test evalu autom index acm intern confer research develop inform retriev pp sistema modular la di dipartimento di università di method disambigu word larg corpu comput human classifi confer innov applic artifici intellig pp index inform storag retriev document classif theori practic intern confer comput linguist pp machin learn autom text automat document classif system pattern recognit techniqu annual meet american societi inform scienc pp titl automat document classif journal american societi inform scienc shell text categor ieee confer artifici intellig applic pp theori relev automat document classif inform control noun disambigu local context larg corpora annual confer waterloo centr oxford english dictionari pp interact retriev evalu larg text collect research acm intern confer research develop inform retriev pp automat index gener classif algorithm inform storag retriev improv text retriev rout problem latent semant index acm intern confer research develop inform retriev pp filter descript analysi text retriev confer pp method combin document filter acm intern confer research develop inform retriev pp text categor low qualiti imag annual symposium document analysi inform retriev pp text comparison categori search strategi acm intern confer research develop inform retriev pp probabilist analysi rocchio algorithm tfidf text categor intern confer machin learn pp text categor support vector learn relev featur european confer machin learn pp transduct infer text classif support vector machin intern confer machin learn irrelev featur subset select problem intern confer machin learn pp index technic literatur inform storag retriev techniqu index inform storag retriev hierarch classifi document word intern confer machin learn pp sebastiani inform storag retriev wilei comput gener instanc set automat text categor acm intern confer research develop inform retriev pp bayesian network induct approach text categor intern joint confer artifici intellig pp automat text categor applic text retriev ieee transact knowledg data engin forthcom learn filter netnew intern confer machin learn pp automat essai grade text categor techniqu acm intern confer research develop inform retriev pp patent search classif system acm confer digit librari pp combin classifi text categor acm intern confer research develop inform retriev pp evalu phrasal cluster text categor task acm intern confer research develop inform retriev pp evalu autonom text classif system acm intern confer research develop inform retriev pp sequenti algorithm train text addit data sigir forum filter descript analysi text retriev confer pp naiv independ assumpt inform retriev european confer machin learn pp heterogen uncertainti sampl learn intern confer machin learn pp sequenti algorithm train text classifi acm intern confer research develop inform retriev pp guest editori special issu text categor acm transact inform system comparison learn algorithm text categor annual symposium document analysi inform retriev pp train algorithm linear text classifi acm intern confer research develop inform retriev pp softwar platform onlin text classif acm intern confer research develop inform retriev pp text classif stochast list acm intern confer inform knowledg manag pp machin learn autom text classif text document comput journal text categor multipl user base semant featur dictionari acm transact inform system activ learn text categor confer american associ artifici intellig pp learnabl visual keyword imag classif acm confer digit librari pp automat inquiri journal associ comput machineri classifi stori reason acm intern confer research develop inform retriev pp emploi em activ learn text classif intern confer machin learn pp improv text classif shrinkag hierarchi class intern confer machin learn pp machin learn mcgraw featur subset select text learn european confer machin learn pp turn automat web page classifi european confer artifici intellig pp appli exist machin learn algorithm text categor scheler symbol approach learn natur languag process pp springer verlag publish note comput number text symbol approach annual symposium document analysi inform retriev featur perceptron usabl case studi text categor acm intern confer research develop inform retriev pp learn classifi text label unlabel document confer american associ artifici intellig pp extend version forthcom machin learn text classif algorithm compar dutch corpu acm intern confer research develop inform retriev pp creat segment free text text retriev acm intern confer research develop inform retriev pp inform extract basi text classif acm transact inform system probabilist automat index learn human index journal document sebastiani sparck relev weight search term journal american societi inform scienc reprint pp learn resolv natur languag unifi approach confer american associ artifici intellig pp hierarch neural network text categor acm intern confer research develop inform retriev pp approach categor imag european confer research advanc technolog digit librari pp approach automat text retriev inform process manag reprint jone willett pp vector space model automat index commun acm reprint jone willett pp review framework notion inform scienc journal american societi inform scienc reprint jone willett pp system text categor machin learn forthcom boost rocchio appli text filter acm intern confer research develop inform retriev pp automat word discrimin comput linguist comparison classifi document rout problem acm intern confer research develop inform retriev pp learn rout queri queri zone acm intern confer research develop inform retriev pp sparck ed read inform retriev morgan san featur select svm text categor confer american associ artifici intellig pp automat index base bayesian infer network acm intern confer research develop inform retriev pp van theoret basi data inform retriev journal document exploit hierarchi text categor inform retriev maxim perform ieee intellig system neural network approach topic spot annual symposium document analysi inform retriev pp ed document retriev system taylor uk machin learn autom text recent trend hierarch document critic review inform process manag automat classif fulltext document sigir forum model inform retriev probabilist infer acm transact inform system expert effect effici learn human text retriev acm intern confer research develop inform retriev pp reduct statist approach text categor acm intern confer research develop inform retriev pp evalu statist approach text categor inform retriev map method text categor retriev acm transact inform system text categor method acm intern confer research develop inform retriev pp compar studi featur select text categor intern confer machin learn pp
ML/1566 6 optim camera paramet select state estim applic object recognit cm brown chair pattern depart comput scienc universitat erlangen comput scienc depart usa abstract paper introduc formal optim camera paramet select iter state estim framework base shannon inform theori select camera paramet maxim mutual inform captur imag convei true state system techniqu explicitli account priori probabl govern comput mutual inform sequenti process form treat posteriori probabl current time step process priori probabl time step converg process proven demonstr benefit approach activ object recognit scenario result show sequenti process outperform random recognit rate number view return introduct state estim noisi imag data kei problem comput vision inher difficulti develop state estim return decent result import question optim state estim sensor data input chosen sensor data big influenc result state estim gener contigu discuss detail dozen paper area activ vision main goal select sensor data solv problem paper tackl problem optim sensor data select state estim adjust camera paramet optim camera paramet found minim uncertainti ambigu state estim sensor data present formal inform theoret metric inform restrict approach acquir sensor data approach cycl action select sensor data acquisit stage sensor data decid depend state estim current time step import properti sequenti process converg proven optim reduct uncertainti ambigu demonstr approach activ object recognit scenario gener problem optim sensor data acquisit discuss exampl found area activ robot local activ object recognit similar metric sequenti implement miss relat applic point theoret point view work differ improv work discuss similar found work bayesian approach approach reinforc learn present optim select viewpoint activ object recognit approach theoret justifi extens work interest relat work area control theori paper structur section describ problem formal manner introduc metric optim step sequenti process section build sequenti process give sketch converg proof found detail activ object recognit scenario section result summar section paper conclud summari outlook futur work formal problem statement figur gener reduc uncertainti ambigu multipl pdf state action problem solut depict figur sequenc probabl densiti function state space shown sequenc start uniform state system action appli select sensor data time step state estim process result probabl distribut state space step end unimod distribut small varianc mode close true state system problem measur success chosen close pdf unimod distribut small varianc comput bring closer distribut question answer inform theoret concept inform theori entropi pdf defin measur amount uncertainti outcom random experi unpredict outcom larger entropi reach maximum uniform pdf minimum delta unambigu outcom answer question found inform theori assum system state state observ observ relat state pdf pdf condit action inform theori concept mutual inform hint action chosen mi log dx differ entropi condit entropi describ uncertainti reduc true state observ introduc depend action influenc reduct uncertainti select action maxim mi argmax likelihood function priori probabl similar approach activ object recognit except priori inform assum uniform case section extend approach sequenti process converg proven import differ explicitli account inher chang prior prior sensor data inform true state optim iter sensor data select previou section action select sensor data reduc uncertainti state estim definit mi channel observ paramet figur sequenti process maximum mutual inform camera paramet select bayesian updat base observ featur obviou reduct reach consequ observ action result uncertainti problem sensor data acquisit step resolv ambigu present section area object recognit deal problem form sequenti process account inform acquir select action sequenti process consist select action base maximum mutual inform applic rule comput posterior probabl observ made posterior fed back prior time step justifi fact posterior inform acquir sensor data fusion implicitli step figur sequenti process depict definit iter process optim step optim respect prior state posterior prior time step assur action select knowledg acquir import fact sequenti process pdf state space converg distribut sketch proof initi distribut markov chain converg uniqu stationari minimum stationari distribut markov chain irreduc markov chain stationari distribut exist kei point converg proof irreduc markov chain defin repres sequenti process give proof converg distanc distribut markov chain time distanc distribut markov chain stationari distribut markov chain time stationari distribut converg distribut minimum leibler distanc stationari distribut irreduc markov chain stationari distribut end converg distribut markov chain distribut difficult comput result sequenti process converg converg import practic stop process practic converg observ experi area activ object recognit distribut converg optimum distribut respect minimum entropi depend accuraci likelihood function result distribut identifi state likelihood relationship state sequenti process improv state estim hand state estim optim sensor data provid state estim hand big bayesian state estim hand combin sequenti process ambigu observ state estim improv method due lack space restrict descript main principl detail discuss underli inform theoret concept evalu differenti mutual inform mont carlo techniqu found reader find error bound estim mutual inform activ object recognit viewpoint select appli method chosen object recognit scenario select statist eigenspac approach introduc appli state estim classif kei idea project imag eigenspac assum classif comput minimum distanc eigenspac project test imag manifold class maxim posteriori probabl consequ prior explicitli account class statist measur match viewpoint select likelihood function viewpoint estim train case maximum likelihood estim paramet gaussian perform due lack space summari method detail found experi result toi form data set figur view object distinguish main differ object small item carri setup consist turntabl robot arm camera mount move turntabl action defin posit camera object statist eigenspac approach classifi state class object figur view ambigu respect object imag view distinct object distinguish object object similar argument hold object shown imag compar viewpoint plan random strategi viewpoint select tabl summar result plan base maximum mutual inform outperform random recognit rate number view classif case object recogn view latest maximum posteriori probabl class larger viewpoint indic confid final object contrast viewpoint select base reinforc learn train optim sequenc inform encod likelihood provid bayesian classifi plan viewpoint control random viewpoint control object rec rate view max poster prob rec rate view max poster prob band lamp gun averag tabl result viewpoint plan random viewpoint control trial recognit number maximum posteriori probabl class figur mi shown begin sequenti prior assum uniform move turntabl robot select posit camera valu correspond rotat turntabl robot arm mi comput mont carlo simul maximum function case viewpoint select defin action chosen figur view object shown object viewpoint presenc lamp object distinguish figur mi viewpoint select assum uniform prior mont carlo turntabl robot axi mi plot view decid maximum mi object band shown gener comput time depend number action number class viewpoint select pentium comput action class total action present gener framework sensor data select state estim approach appli optim select camera paramet activ object recognit worth note approach restrict camera paramet select appli situat sensor acquisit process influenc exampl gaze paramet camera chang adapt chang illumin enhanc relev featur approach present paper independ state estim hand requir state estim provid likelihood function observ state big advantag fact state estim improv method long state estim return systemat wrong result compar publish work approach form sequenti process converg proven contrast reinforc learn approach activ object train optim sequenc typic tradeoff exploit explor reinforc learn exist framework relev inform decid optim action encod likelihood function prior prior comput step step recognit process likelihood function assum provid state estim experi show framework work object recognit scenario state art classifi outperform random strategi current work extend approach state estim dynam system modifi algorithm continu action space handl refer fp ferri viewpoint select navig entropi map seventh intern confer comput base activ object recognit imag vision classifi independ viewpoint select object recognit ch page septemb springer brown optim select camera paramet state estim static inform theoret approach technic report comput scienc cm brown inform theoret sensor data select activ object recognit state estim ieee transact pattern analysi machin intellig thrun activ markov local mobil robot technic carnegi mellon jm hf sensor manag decentr data fusion confer page nayar visual learn recognit object intern journal comput ca kj entropi measur fusion perform iee target track data page learn tempor context activ object recognit bayesian analysi intern confer pattern volum page schiel jl crowlei activ object recognit sixth intern confer comput
DB/1567 3 control datatyp view formal februari christin pascal institut universit pari avenu franc universit de nant rue de la bp nant cedex franc abstract deal mix specif formal static dynam part formal base symbol transit system system abstract level avoid state st kind guard finit diagram state transit label open term dynam static part object unifi formal structur call view compon interpret structur show deriv view structur system structur mean collect object tempor logic glue compon altogeth express gener form synchron product show view structur interpret structur obtain formal explain simplifi phone servic mix symbol transit formal requir deal mix specif formal part static dynam part system loto sdl uml extens mix formal aim work provid integr static dynam part specif achiev formal structur call view aim structur specif interest point work provid framework combin integr structur concept inherit import specif program work account main concurr data type defin specif formal care good balanc axi readabl express abstract defin plane combin axi power notat plane call good adequ abstract express level deal abil proof gener code specif formal method close relat formal specif languag call intend design level end requir uml code method formal defin subsequ gener loto sdl specif explain gener code paper deal formal aspect specif method present view structur model st great interest enabl defin compon abstract readabl give map structur view defin inherit basic view static dynam defin view structur retriev composit compon view retriev base retriev algebra part view comput global st composit illustr view model phone servic case studi formal explain simplifi phone servic specif sketch section full specif found appendix societi develop phone servic distribut system phone servic enabl client commun central server requir client client user identifi digit person number client simpl client subscrib commun caller request parti call call potenti call parti client commun call client activ list depend ordinari client subscrib ordinari client server subscrib involv commun call server call subscrib request commun commun request accept commun request call subscrib interrupt commun subscrib subscrib back ordinari client request involv commun server regist client potenti call parti server delet client potenti call parti server start commun client withdraw commun request made commun interrupt time central server central server unit connect unit manag unit disconnect unit manag unit unit handl statu chang request manag updat subscrib potenti call parti connect unit unit handl commun request send request parti call commun request issu establish connect caller parti call disconnect unit unit handl disconnect request central server decid interrupt connect unit subscrib subscrib potenti call parti unit regist request potenti call parti modif unit knowledg current caller parti call commun caller parti call caller subscrib parti regist potenti parti call commun place issu commun request view model specif framework present view view model present concept model identifi symbol transit system identifi step object orient identifi commun mechan compon identifi identifi simpl term pid sort compon class pid sort pid correspond relat compon class import relat object equal object structur object equal express object identifi denot object structur express fact object object identifi prefix id identifi build structur object composit wide deal compon built symbol transit system symbol transit system form guard automata free variabl guard transit st origin symbol transit graph definit transit symbol transit graph direct graph node label set free variabl branch label guard action boolean guard action ff bind variabl denot branch label node set bound free variabl action defin obviou fxg empti st enabl reduc problem provid good level abstract unbound buffer natur oper put buffer usual transit system state recept variabl process paramet instanti vertic recept infin natur horizont process paramet infin buffer content size valu horizont put put put put put vertic fig unbound buffer state transit system abstract buffer content focu fact buffer empti quot transit system separ data process st readabl formal work view structur defin oper state automata close transit system commonli accept notat equip tool design verif put empti empti put fig unbound buffer symbol transit system st equip tool deal tempor model check bisimul view class defin intern structur view abstract express fact order design express aspect static dynam aspect identifi structur level object structur level extern express fact object object object simpl intern structur view integr composit object integr view follow encapsul static part access dynam part identifi class diagram view model figur integr view view static view dynam view intern structur view extern structur view composit view fig view model class diagram view unifi view describ aspect compon extern definit view compon tripl data ff abstract dynam layer data part address function issu compon oper algebra abstract defin point view dynam layer address sequenc oper compon perform definit data data part view structur algebra specif compon ax set import basic algebra specif set formal paramet algebra specif paramet variabl ax signatur axiom order hidden oper definit dynam signatur loto form enrich argument explicit commun scheme simpl correspond dynam usual comm messag comm constructor comm pid comm messag comm constructor comm observ comm msg observ comm id pid view dynam layer describ sequenc action compon perform main idea defin oper term effect condit build compon abstract precondit postcondit definit dynam dynam layer view structur tupl id identifi sort id set oper requir dynam pre erm precondit postcondit hidden member precondit order formula express oper requir term valu condit erm argument io specif buffer oper buffer precondit full belong pc belong io postcondit set order formula express oper valu condit oper appli term valu condit cl condit erm argument io oper appli put case buffer abstract built postcondit fq empti full empti full buffer full put oper full limit condit express postcondit full ff condit predic defin class finit number class definit abstract ff view structur tupl finit set predic cl finit set condit postcondit oper ax set formula member ax formula member syntax view figur specif part correspond abstract part oper part state explicitli retriev identifi identifi compon composit structur st obtain uniqu abstract oper part fs jcj oeg fs sj fog io io fog io io state composit condit satisfi relat condit initi state state satisfi initi formula transit retriev automat pre postcondit experi show requir express condit valu postcondit view specif import gener variabl hide op axiom ax abstract condit limit condit cl initi oper fig syntax trivial abstract oper part deriv st idea give condit condit defin pre postcondit view defin altern symbol transit system abstract oper part altern syntax figur note st part view dynam signatur definit part textual st graphic readabl figur view specif import gener variabl hide op axiom ax st transit fig altern syntax interest properti view abstract describ class compon st obtain view state class number class st finit describ static dynam view unifi dynam view static view full algebra specif signatur element id fact dynam view focu commun abstract static view static view describ static aspect compon definit static view sv compon view static view correspond set user set static view figur defin usual set abstract empti dynam view defin extens dynam view empti empti set static view set specif import nat gener op set add set set member set bool size set nat set bool remov set set empti set bool axiom abstract condit empti limit condit initi empti oper size true add true remov empti fig set static view dynam view dynam view describ behaviour aspect process activ dynam commun protocol term emitt definit output term input partial view global semant definit dynam view dv compon view dynam signatur sort ax dynam view figur idl comm server server call server comm comm server server mean end transmiss dynam view specif import msg gener op st ffl idl idl call server comm comm comm comm comm comm fig dynam view extern structur view extern structur view global semant compon integr view composit extern structur view global semant definit structur extern structur view compon tripl option data composit layer paramet basic algebra data type definit data data part structur made compon set import basic algebra specif set formal paramet algebra specif paramet variabl hidden oper describ compon glu altogeth definit glue glue part structur tupl formula built member compon view formula relat transit compon st gener form synchron product vector formula express initi state compon coher composit id id implicitli quantifi time coupl mean ag state transit formula simpl fixpoint special modal express tempor logic crl main point express express glue compon complex logic defin verifi model properti state transit formula defin definit composit composit layer composit view structur tupl obj id id id identifi sort id obj id famili object view composit identifi follow equal structur principl id set term instanti compon paramet issu global semant aspect address focu obtain view structur composit compon integr composit view scope paper syntax extern structur view figur figur defin server composit unit express compon ag denot extern structur view specif import gener variabl hide composit id obj initi fig syntax structur extern structur view server composit uc uc connect unit um um manag unit ud ud disconnect unit unit initi true fig server inherit view inherit basic form inherit consist ad condit oper static dynam view overrid subclass superclass oper state combin condit subclass state hierarch state st superclass implicitli present transit explicitli form inherit simpl practic defin phone simpl user call complex user call user view structur give view altern structur order turn wai give view structur compon view obtain fig view structur idl call server server comm server idl server subscrib server server server fig dynam view view compon view view structur view fig obtain view structur altern view structur obtain fig altern view structur function map view structur altern view structur diagram commut simplic arrow work st part easier work part obtain rule ax part instanti remov instanti remov instanti ax renam index axiom rule index build product type renam axiom consist index oper type interest type compon axiom posit st part obtain rule st part extens synchron product synchron vector replac part mechan implement gener class automata gener synchron product function defin rule st part fs fs ft remov access state present formal express static dynam part mix specif order provid framework integr defin formal structur call view make symbol transit system system abstract level avoid state structur specif mean collect object tempor logic glue compon altogeth express gener form synchron product interest point work provid framework combin integr structur defin map structur view defin view structur retriev composit compon view defin inherit basic view dynam formal suit achiev good balanc express abstract properti specif present strong link exist aspect singl build global semant provid set rule st account composit aspect step defin proof mechan model check specif refer andr arnold de transit de recherch en informatiqu reggio formal method bidoit volum lectur note comput page paul kelli michael phillip introduct formal method ieee custom integr circuit ed introduct iso specif languag loto comput network isdn januari christin pascal global semant view rapport de recherch web page christin pascal control datatyp view formal present jan dieter sdl formal languag commun system fernandez de verif par reduct de de universit joseph mai hennessi lin symbol bisimul theoret comput formal descript techniqu base extend state transit model intern organ formal descript techniqu base tempor order observ behaviour intern organ thoma symbol modal logic loto northern formal method workshop verif de de programm phd institut nation polytechniqu de hubert tool tempor logic intern workshop softwar tool technolog transfer christel class librari automata python de universit de pascal christin concurr data specif method loto recent trend algebra develop select paper intern workshop algebra develop techniqu volum lectur note comput page pascal christin inform requir concurr automata approach jm formal world congress formal method develop comput volum lectur note comput page hennessi local model check process martin abadi intern symposium theoret aspect comput softwar volum lectur note comput page jose felix costa object specif logic journal logic ed symbol bisimul full loto algebra methodolog softwar technolog volum lectur note comput page smith semant integr csp specif concurr system cb formal method europ volum lectur note comput page ration softwar al unifi model version technic ration softwar septemb method group develop method seri phone servic specif give appendix full specif phone servic phone servic method develop mix specif basic specif phone servic user basic full user inherit server composit full composit user server build phone servic commun compon studi figur user uc ud server um fig compon phone servic basic specif give specif basic element current empti static view algebra specif coupl specif case group term static view empti view compon static part built idl initi state enabl transit static view specif st ffl idl fig static view empti static view set figur static view set set oper signatur axiom defin set abstract empti empti oper precondit postcondit defin express effect empti condit simpl condit precondit postcondit stand condit oper place prime condit stand condit oper place axiom obtain st deriv principl static view set specif import nat gener op set add set set member set bool size set nat set bool remov set set empti set bool axiom abstract condit empti limit condit initi empti oper size true add true remov empti fig static view set figur graphic st part static view set argument oper compon implicit omit oper member size defin modifi condit valu oper call condit observ super state order simplifi st graphic empti empti set fig graphic set st algebra specif coupl figur algebra specif coupl specif specif model coupl user commun oper correspond project coupl coupl gener import bool op coupl coupl constructor coupl bool equal coupl coupl element selector coupl element selector axiom fig algebra specif coupl basic user dynam view basic user figur dynam view basic user figur graphic st part dynam view basic user integr view basic user basic user static view figur integr view basic user dynam view specif import msg gener op call server server server comm comm server server st ffl idl idl call server comm comm comm comm comm comm fig dynam view basic user server idl comm server comm comm server server server call fig graphic basic user dynam view st integr view specif gener composit true initi true fig integr view basic user full user dynam view full user figur dynam view full user view inherit basic user dynam view add condit oper defin condit subscrib true full user st defin hierarch state valu condit st hierarch state hierarch state st dynam view view inherit state hierarch state refer usual prefix notat idl state subscrib hierarch inherit st state place formula state precondit postcondit subscrib oper precondit state subscrib condit statu idl condit unchang postcondit implicit omit dynam view extend specif op subscrib server server server server server server call server abstract condit subscrib initi subscrib oper subscrib idl subscrib idl subscrib subscrib subscrib idl subscrib fg call idl subscrib fig dynam view full user figur graphic st part dynam view full user idl call server server comm server idl server subscrib server server server fig graphic full user dynam view st integr view full user figur integr view full user static part full user set correspond set relat sort user full user glue part state full user add author commun user connect unit dynam view connect unit figur dynam view connect unit figur graphic st part dynam view connect unit integr view connect unit connect unit static view empti figur integr view connect unit disconnect unit dynam view disconnect unit figur dynam view disconnect unit integr view specif import pid gener composit set server server server initi true fig integr view full user dynam view specif import pid gener op call pid pid call pid pid pid st ffl idl idl call user test test call cancel call call ffl cancel ffl user ffl ffl idl cancel user idl fig dynam view connect unit test idl call user user call call cancel user fig graphic connect unit dynam view st integr view specif gener composit true initi true fig integr view connect unit dynam view specif import pid gener op st ffl idl idl idl ffl ffl ffl ffl ffl ffl ffl ffl idl fig dynam view disconnect unit figur graphic st part dynam view disconnect unit idl fig graphic disconnect unit dynam view st integr view disconnect unit disconnect unit static view empti figur integr view disconnect unit integr view specif gener composit true initi true fig integr view disconnect unit manag unit dynam view manag unit figur dynam view manag unit dynam view specif import pid gener op st ffl idl idl user ffl idl user ffl ffl idl ffl idl idl user ffl idl user ffl ffl idl ffl idl fig dynam view manag unit figur graphic st part dynam view manag unit idl fig graphic manag unit dynam view st integr view manag unit manag unit static view empti figur integr view manag unit unit dynam view unit figur dynam view unit integr view specif gener composit true initi true fig integr view manag unit dynam view specif import pid gener op um um um um uc ud ud ud ud uc uc uc st ffl idl idl um idl idl um idl idl um idl idl um idl idl uc idl idl ud ud idl idl ud ud idl idl uc uc idl uc idl fig dynam view unit figur graphic st part dynam view unit ud ud idl ud ud uc uc uc uc um um um fig graphic unit dynam view st integr view unit figur integr view unit static part made static view sl set subscrib user pid al correspond coupl author caller cl coupl user commun extens integr view static dynam view static view correspond free composit static view solut make trivial dynam oper static dynam view static integr dynam view empti static integr composit view server figur graphic composit server term compon commun compon figur composit view server instanc ud creat paramet process integr view specif gener composit sl set al set cl set ud ud ud initi true fig integr view unit um uc ud server fig graphic server composit composit view server composit uc uc um um ud ud initi true fig composit view server composit view phone servic figur graphic composit phone servic term compon commun compon figur composit view phone servic phone servic gener number basic number full user user creat rang oper oper shorthand set pid user shorthand user user user rang oper glue formula um user uc ud server call comm comm call fig graphic composit phone servic composit view specif gener natur composit server user initi true fig composit view phone servic
IR/1568 5 witten dept comput scienc waikato zealand power build digit librari collect abstract digit librari system focu princip consum materi constitut librari paper describ interfac make easi peopl build librari collect collect built serv local web remot share digit librari host end user easili build collect style exist materi web local collect updat brought time intend end model wide commerci softwar instal packag prospect end user build collect share describ interfac administr user maintain digit librari instal introduct digit librari softwar zealand digit librari project organ inform make internet collect inform typic thousand million uniform interfac provid document collect librari includ organ strong famili resembl present collect wide publicli web wide distribut develop countri creat behalf organ health world health unit nation cover topic rang basic concern disast david dept comput scienc waikato zealand stefan boddi dept comput scienc waikato zealand relief titl includ food nutrit world human develop medic health virtual disast collect critic global issu detail obtain recent enhanc facil call collect provok work digit librari develop observ effect human develop gift dissemin inform origin develop collect develop countri effect strategi sustain develop dissemin capabl creat inform collect collect develop countri particip activ inform societi observ stimul creation industri ensur intellectu properti remain hand produc collect build call model popular instal softwar frequent call softwar term appeal connot utter interact style suit novic user simplifi choic present core softwar address collector address peopl build distribut collect class vital instal system configur softwar suit local enabl class set file includ previou administr user check statu alter interact sensit flexibl administr support essenti end user build collect paper begin synopsi featur extent section overlap materi present featur extend report remaind paper complet examin interact interfac collect extend domain applic encourag end user creat digit librari collect structur collect determin configur briefli examin file turn interfac describ facil final discuss design process usabl evalu system softwar convei breadth coverag provid start overview facil detail access web browser collect access standard web netscap internet explor browser local remot run person comput remot central librari server run window unix collect serv window unix system serv collect internet integr web server version extern apach field search user search full text index built part document collect index full index index index index search word phrase queri rank term stem flexibl facil user list list list hierarch classif collect offer collect broad varieti interfac search interfac construct build process collect configur inform creat access structur automat collect easi maintain search structur built directli document link insert hand mean document format merg collect automat exist hypertext link origin lead preserv make metadata metadata form raw materi document individu section document metadata provid explicitli accompani deriv automat sourc document dublin core scheme provis made scheme plugin classifi extend capabl modul perl written accommod document type exist plugin process plain text html microsoft proprietari format collect includ sourc document pipelin plugin form document pass plugin recogn document format process plugin gener task directori structur document order build index analog scheme classifi written creat index kind base metadata document unicod languag process consist search properli collect built arab english convert unicod alphabet support web browser plugin automat identif languag multilingu separ index built user interfac interfac present multipl languag arab english languag ad easili multimedia collect collect audio video clip materi link textual document accompani textual descript figur caption descript search architectur gener permit implement plugin classifi data classifi hierarch hierarch phrase index creat standard classifi interfac gutwin al al design collect collect million make system suitabl collect gigabyt compress reduc size index text small index ad bonu faster retriev collect dynam collect updat brought bring system process user interfac notic period collect add list present user collect publish collect interact ident access collect web provid time faster predict collect larger multi solut implement distribut collect support flexibl process structur collect serv present user web part digit librari protocol access extern server present collect extern client digit librari zealand digit librari term gnu gener public figur collector build collect softwar includ web collect plugin classifi varieti sourc document type includ featur easi instal window unix collector concept digit librari captur collect digit includ method access organ mainten collect organ mainten address paper view book acquir physic librari integr exist catalog basi easili add digit librari edit content strive manual materi immedi compon librari accomplish process import document librari collect xml standard explicitli state metadata updat search structur structur collect determin collect set includ thing sourc displai sourc facil search index search result displai collect easi add document long format exist metadata scheme collect build basic creat collect structur exist creat collect structur exist add materi exist modifi structur exist delet write exist collect figur show collector creat case set html file store local figur user decid work exist collect build case cover option cover remaind show collect built exist collector support creation complet collect form complet inform log log note user access facil build collect server arbitrari peopl build collect reason secur system forc peopl build collect log central system offer servic build inform collect server make user run comput build collect log peopl view web page build collect dialog structur complet page figur show sequenc step involv collect build collect inform sourc data configur collect build collect view collect step inform sourc data figur adjust configur requir understand advanc user fourth step work process system make index gather inform requir make collect oper step check collect creat step displai linear sequenc grai button bottom screen figur bottom page gener collector displai user track process button click continu sequenc shown green inform figur grai button figur inact button chang yellow proce user return earlier step click yellow button diagram displai model wide commerci softwar guid user step involv instal softwar collect inform step collect shown figur creat enter inform contact email descript collect titl short phrase digit librari identifi content mention titl food nutrit world email address specifi point contact problem encount collect softwar detect diagnost report address descript statement describ principl govern includ collect head collect page collect present lesk recommend digit librari articul principl govern includ collect organ collect design address point care includ list access mechan automat gener system base search facil includ collect current posit sequenc arrow displai bottom figur collect inform stage user proce figur click green sourc data button figur sourc data figur point user specifi sourc text collect collect exist creat total collect complet structur exist major interact collector interfac design effect creat collect base structur exist clone choic current collect displai menu good chanc suitabl structur exist prefer document file type collect cater metadata metadata equip default document file unexpect format simpli omit collect warn messag metadata structur unavail document simpli omit structur altern clone exist collect creat complet collect configur file provid accept wide rang document type gener searchabl index full text alphabet titl browser titl metadata document microsoft collect download creator maintain public true beta true index plugin plugin plugin plugin plugin plugin plugin classifi histori collect excerpt demonstr base histori primari sourc collect consist sourc inform histori gather web site world collect case eman inform frequent incorrect user ignor microsoft featur box provid sourc document separ input sourc kind directori server system address begin file download web address begin file download ftp case collect includ file directori file directori directori filenam file includ collect mirror web site collect document local file system remot web mirror build form resourc composit configur collect figur show stage construct present collect control specif special collect configur file advanc user page alter configur set proce directli final stage user made small modif default configur file includ flag html plugin flag url metadata insert figur configur file collect gener figur base filenam convent adopt mirror packag metadata collect reader refer origin sourc local copi build collect figur show stage dialog record temporari file build stage action place intern chosen base titl suppli avoid clash exist directori structur creat includ file index present sourc document retriev sourc document file file system copi command retriev file web mirror packag copi site relat imag file document convert xml plugin perform oper collect configur file copi file collect augment inform store xml file search collect configur file creat assum oper content build process move area activ collect precaut ensur version collect continu serv readi persist document identifi ensur user build stage potenti small collect minut larg dai web support environ lengthi kind activ user stop build process immedi button figur reliabl prevent user leav build detect case collector continu build collect instal build termin progress displai statu area bottom part figur updat messag visibl figur snapshot titl metadata extract input file warn written input figur administr facil file url request exist plugin process plugin find imag file html document intent user monitor progress window open browser error process record statu area view collect collect built sequenc button visibl bottom figur bottom figur view collect button activ user directli newli built collect email contact email collect creat check monitor happen system work exist collect facil provid work exist add modifi delet write add materi exist dialog structur illustr figur entri figur data copi convert join exist import materi document replac treat difficult determin document ad collect textual ident exist imperfect practic structur suffici clear make straightforward ignor aim collector support common task straightforward care updat command line modifi structur exist collect essenti mean edit configur file option dialog enter stage figur delet collect simpli requir collect select delet confirm collect built collector collect built advanc user work command includ select list nice select delet materi collect function exist present command line inspect file system order write exist collect file automat disk imag standard directori collect configur file part collect configur file collect built figur shown figur full figur process updat collect configur file format support wider varieti embark detail explan line mean inform file email address collect descript gather user collector dialog essenc studi exist standard express inform index line build singl index text document classifi line build alphabet classifi titl metadata list plugin design permiss uncompress zip plugin oper pipelin output decompress plugin ensur document import xml process properli collect rebuilt process document identifi file extens expand pour content ensur arbitrari directori hierarchi indic power gener structur figur facil ad ten index titl ad addit index line encod web page html index author ad augment index line author alphabet author browser requir addit classifi line word pdf document includ plugin languag metadata infer option plugin languag metadata separ index built document text languag acronym extract text automat list acronym ad extract document browser ad phrase hierarchi extract full text document made format document search result alter statement skill user add featur collect make small chang panel figur anticip casual user oper provis made collector edit step build collect type arrang expert construct prototyp collect desir proce clone collect structur materi support system administr facil includ instal entri shown figur inform collect offer system note collect home page short full publicli run click abbrevi column link figur bring inform gather collect configur file intern structur creat collect collect public click full collect collect built histori visibl bottom figur figur show inform displai link click section inform configur size collect million section intern inform relat commun protocol collect access filter option show option valu queri collect administr facil present configur inform instal modifi facilit examin error log record intern user log record usag enabl user author build collect add materi exist facil access interact menu item side figur configur file configur file control site configur file main configur file configur softwar site instal design configur option site exampl includ directori softwar http address facil inform common interfac collect serv site includ email address system statu collector page cooki identifi user log kind log usag error log initi log interest peopl maintain softwar user page user record person includ log disabl enabl includ instruct main system configur file line user log record page page gener inspect log ip address timestamp squar cgi argument browser call sampl split annot cgi identif code gener ip number timestamp access digit librari user authent incorpor authent scheme emploi control access facil restrict peopl enter collector administr function document protect individu basi access regist user present cumbersom develop authent request user password illustr figur administr page user delet abil user administr privileg add user user belong extant group member group add remov chang group member access facil build collect alter exist user call admin belong group password user set instal process user creat password user belong recommend give user abil build collect user inform record file structur inform relat user temporari kei creat page expir half hour inact user technic inform link technic inform head access technic inform includ directori thing store user evalu collector administr page produc refin long period iter design inform test design reach version present paper detail thrash meet digit librari individu varieti disciplin includ librari notabl comput field human comput interact idea progress bar bottom page conceiv satisfi tool ad public softwar feedback obtain mail gener arena current issu futur develop user gain technic assist problem filter sourc specif remark collector administr page reveal technic extens prior script perform incorrectli version oper system question fell categori collector technic question tool dearth question suggest perform adequ member group present conduct usabl studi design establish suitabl interfac perform intend task volunt final year comput scienc class observ perform set tool origin set command line instruct complet user fill questionnair result work main difficulti formal usabl test inevit artifici task work environ motiv user artifici paramet oper tightli prescrib real world question pose tool user perform task design user step design unfair collector design simplifi commonli execut task user familiar tool natur expect question open vital import resolut open sourc natur project continu iter develop tool base feedback field trial user comment incorpor featur ad activ develop code paper tool integr environ guid end user build maintain step step detail support includ administr mainten site system integr runtim system abil view creat user control access collect build tool user digit access retriev obviou domin digit librari collect creation import element deserv care attent develop includ capabl digit librari system move larg static entiti evolv dynam environ refer rm ih intern cooper digit proc int joint confer artifici sweden san morgan kaufmann pp digit librari support system novemb practic digit librari san morgan kaufmann sj larg case proc acm confer digit san pp june tc manag compress index document edit san morgan kaufmann mf digit librari develop sj digit librari softwar proc digit librari san pp ih compress identifi acronym proc data compress edit ja cohn ieee press lo version work paper depart comput
AI/1569 2 institut ur informationssystem system technisch universit wien austria institut ur informationssystem system complex express power logic program georg gottlob thoma eiter andrei voronkov research report februari research report research report februari complex express power logic program thoma georg andrei voronkov abstract paper survei complex express result form logic program main focu decid form logic proposit logic program mention gener logic program function symbol classic result plain logic program horn recent result import extens logic program survei includ logic program form disjunct logic logic program constraint logic program comput scienc uppsala box sweden institut und ludwig wittgenstein labor fur technisch universitat austria institut und ludwig wittgenstein labor fur technisch universitat austria comput scienc uppsala box sweden partial support grant andrei voronkov partial support grant paper extend version preliminari abstract express logic annual ieee confer comput complex june pp copyright fl author rr content introduct preliminari syntax logic program semant logic program datalog complex class ture machin notat complex class reduct complex plain logic program simul determinist ture machin logic program proposit logic program complex datalog logic program function issu complex logic program negat stratifi negat negat stabl model semant inflationari semant semant negat disjunct logic program express power logic program order mismatch relat machin express power logic program complex valu unif complex logic program equal equat theori complex complex logic program equal constraint logic program complex constraint logic program express constraint index rr introduct logic program declar method knowledg program base idea languag logic repres data describ desir output logic program develop earli base work autom theorem prove kowalski robinson resolut principl pure logic program consist set call definit horn rule form head head logic atom bodi conjunct logic atom logic semant rule implic bodi head section note semant pure logic program complet independ order order singl atom rule bodi advent program languag prolog paradigm logic program readi practic applic area successfulli implement prolog note prolog approxim fulli declar logic program match backtrack algorithm core prolog sensit order program atom rule bodi prolog popular program languag taught comput scienc research pure logic program extens thereof applic area knowledg subfield artifici predomin full pure logic program knowledg declar extens pure logic negat rule bodi disjunct rule formal common reason queri languag datalog design intens studi ullman gottlob tanca interest complex result logic program result limit complex theori express result descript complex theori shown slight extens datalog express polynomi comput queri order datalog express captur complex class order similar result obtain variant extens datalog turn major variant datalog suitabl complex class complex theori import tool compar logic program formal paper survei complex express result form logic program aim paper twofold broad survei pointer literatur order give flavor complex issu logic fundament topic explain greater basic result plain logic program fundament issu relat descript complex section written tutori style section written succinct survei style note present paper consist list publish complex result logic subject choic result interest result mention space result found schaerf schlipf result abduct logic program gottlob leon inou sakama sakama inou nerod intuitionist logic program bonner prolog rr paper organ section defin syntax semant logic describ datalog introduc complex measur comput model complex notat discuss section section present main complex result plain logic program datalog section discuss semant logic program negat respect complex result section deal disjunct logic program section studi express power datalog logic program complex valu section complex unif section deal logic program extend equal section describ complex result constraint logic program articl extend version gottlob voronkov preliminari introduc basic concept logic program due space present necessarili detail apt apt baral gelfond letter predic function bold face version letter denot list symbol respect type logic denot predic function symbol arbitrari string syntax logic program logic program formul languag predic function nonneg function constant languag function ariti greater term induct defin variabl constant function symbol term term variabl occur herbrand denot ul set ground term form function constant atom formula predic symbol ariti term atom ground herbrand base languag denot bl set ground atom form predic term ul horn rule form atom part left call head bodi rule form bodi call ground call ground fact logic program finit set horn logic program variabl logic program associ languag consist function constant occur constant occur add constant technic reason state underli simplifi notat herbrand interpret logic program subset herbrand base atom herbrand model herbrand interpret rr rule interpret satisfi logic formula list variabl rule proposit logic program logic program predic ariti atom proposit proposit logic captur knowledg simplifi steam engin equip signal gaug shut shut leak leak valv pressur loss valv close signal pressur loss signal signal signal signal rule program system shut danger state state connect signal respect rule fact signal signal state signal observ note proposit logic program set proposit atom interpret subset semant logic program notion herbrand interpret model gener infinit set natur set ground set defin oper bp bp bp denot set herbrand interpret fa rule fa hold oper call consequ yield atom deriv singl applic rule atom theorem denot kleen theorem limit sequenc ground atom call consequ set write negat ground atom consequ denot semant set ground denot defin set consist atom negat fa ag rr program signal pressur fixpoint reach shutdown set coincid uniqu herbrand model model smaller model proper subset emden kowalski semant logic program defin ground languag denot set obtain substitut element ul variabl logic program defin write oper bp bp defin program fixpoint gener case gener exponenti size comput order determin atom complet strategi deriv atom logic program develop strategi base variant famou resolut principl robinson major variant apt van emden goal conjunct substitut function map variabl term result simultan replac variabl term express denot goal program find substitut logic initi goal repeatedli transform empti goal obtain transform step base applic resolut rule select atom goal bm unifi head find substitut rr substitut call unifi unifi gener essenti chosen goal transform bm apt lloyd resolut gener complex unif dealt section datalog interest logic gave rise field deduct overview develop area logic program suitabl formal queri relat logic program base queri languag datalog extens thereof defin context logic relat identifi set ground fact ground fact predic symbol repres data relat set predic symbol occur possibl infinit domain argument constant call schema associ finit ud constant encompass constant possibl classic ud identifi set constant datalog larger ud suitabl case deriv assert item explicitli occur understand datalog clarifi ground fact schema set relat symbol domain string string associ finit ud susan note susan includ ud datalog program comput ancestor relationship rel program father mother input call predic interpret fix input predic ancestor person output predic parent auxiliari predic output predic rr comput visibl result auxiliari predic introduc repres intermedi consid part final result datalog program input comput result schema ground fact susan includ constant ud fact harri constant finit ud schema consist finit set relat ariti countabl domain schema denot herbrand base languag predic symbol constant symbol schema finit subset herbrand base finit ud constant write ud denot extens relat denot set datalog queri datalog program logic program input schema output schema complet schema predic symbol predic symbol rule head mean predic input redefin datalog formal semant datalog program input schema output schema complet schema partial map instanc instanc result instanc regard result queri defin instanc constant occur ud map ud relat jp fa ground defin section languag extend constant ud ground atom write write semant datalog inherit semant logic program similar semant extens datalog inherit extens logic program rr main kind complex connect plain datalog extens ffl data complex complex check datalog program input ground atom input ffl program complex call express complex check input datalog program ground atom input ffl combin complex complex check input datalog program ground atom input note plain version datalog consid combin complex program complex respect reduct due fact respect deriv ground pair hd easili reduc pair hd empti instanc constant obtain straightforward encod ud fc je disregard combin complex materi datalog due fix program complex slightli sharper upper bound combin complex approach measur complex queri languag parametr complex yannakaki complex express function paramet paramet number variabl queri paramet motiv shown data program complex close number queri variabl logic program gener combin complex regard main complex measur speak complex fragment logic kind ffl complex fragment logic program complex check variabl program ground atom complex class section definit complex class encount survei relat definit detail exposit complex notion found follow notat definit complex class articl found ture machin determinist ture machin ture machin devic read write content local access chang comput determinist ture machin defin quadrupl finit rr set finit alphabet ffi transit initi state alphabet special symbol call blank transit function ffi map ffi denot addit state occur denot motion direct assum loss machin move cursor leftmost ensur proper design ffi tape divid cell symbol cursor move tape initi state cursor point leftmost cell tape input string written tape cell ji denot length symbol cell machin success step comput ffi assum state cursor point symbol oe tape oe current state overwrit oe move cursor cursor move previou cell cursor remain posit state halt accept input halt reject input case halt halt output comput denot defin string initi segment tape end blank nondeterminist ture machin nondeterminist ture defin quadrupl oper machin longer function tupl member oe specifi action current state symbol point cursor oe number tupl greater nondeterminist oper unlik case definit accept reject asymmetr accept input sequenc choic lead state reject input sequenc choic lead time space bound time expend input defin number step start halt halt time consid infinit defin time expend accept comput output minimum number step accept output comput text assum special symbol mark left end tape symbol elimin proper redesign machin simpler model left end marker conveni rr space requir number cell visit cursor comput case space defin accept comput output minimum number cell visit tape accept output comput function posit integ halt time exist posit integ time expend input length greater halt space space requir input length greater posit integ assum halt time posit integ call halt polynomi time halt space call notat complex class finit alphabet languag set finit string accept reject decid halt time decid time halt space decid space observ sublinear ture machin halt space read input produc larg output remedi ture machin equip output tape work input string output comput time space requir defin space work tape count case halt sublinear time random access input symbol provid tape serv index regist assum machin decid languag sublinear bound function posit integ defin set fl decid time fl decid time fl decid space fl decid space set exampl complex exampl note function lead complex class unnatur properti function expon complex class complex class interest class function union union polynomi form abbrevi denot main complex class rr np exptim nexptim pspace expspac nl list abbrevi nondeterminist counterpart pspace expspac coincid class pspace coincid class expspac complementari class complex class complementari class denot defin languag denot set fl cg polynomi hierarchi defin polynomi hierarchi introduc oracl ture machin languag oracl call oracl thought ordinari augment addit queri tape addit state state comput proce usual write queri state depend string written queri tape belong queri tape instantan case ordinari expend time number step requir space number cell tape queri tape oracl defin augment set languag defin complex class np languag np languag oracl decid polynomi hierarchi consist class defin np class ph defin exponenti time exptim mention paper class comput exponenti time class defin rr dn dn captur linear expon polynomi expon class exptim view mean level exponenti doubl tripl captur class defin nondeterminist counterpart defin replac reduct languag assum input string denot output input halt space call reduct reduc set languag languag call languag reduc call complet notion complex theori consid kind reduct ture reduct kind reduct mean reduct note result review state proof establish hold reduct result hold weaker reduct reduct case weak case comput sublinear resourc problem input string matter concern problem complex johnson reader request origin sourc detail complex plain logic program survei basic result complex plain logic program section written slightli tutori style section order reader familiar logic program reader familiar complex theori grasp kei issu relat complex theori logic program rr simul determinist ture machin logic program comput input string section describ logic program goal accept step transit function ffi singl tape repres tabl row tupl oe di tupl express time instant state cursor point cell number cell symbol oe instant state cell number symbol oe cursor point cell number describ complet evolut input string initi configur time instant configur instant proposit logic program achiev defin class proposit symbol ff ff intuit instant cell number symbol ff intuit instant cursor point cell number state intuit instant state accept intuit reach state denot symbol string ji initi configur input reflect initi fact symbol oe oe symbol state entri oe di transit tabl ffi translat proposit horn call transit rule assert symbol oe state symbol oe state symbol oe state state symbol oe perfectli describ happen state transit instant instant forgotten tape cell chang transit valu instant reflect term inertia rule rule assert time instant tape cell number rr symbol oe symbol oe symbol oe symbol oe group term accept rule deriv proposit atom accept configur reach accept state denot logic program note initi configur time instant fixpoint reach ground atom ad describ configur input time instant fixpoint accept accept configur reach comput step lemma accept accept input string step simul determinist ture machin logic program author note simul ture machin horn logic deduct long idea simul ture machin logic deduct back ture origin paper ture introduc abstract machin concept time comput consid felt show logic deduct reduc model comput reduct full logic reduct horn formula function buri exposit form basi theori formal present thesi idea code ture machin logic horn formula explicitli seri paper lewi lewi obtain undecid complex result author reduct observ show logic program complet earliest refer found state result explicitli slightli weaker result translat refer found recent book gurevich proposit logic program simul proposit logic section order determin complex proposit logic complex decid hold logic program ground atom theorem vardi proposit logic program rr proof membership obviou fixpoint oper program comput polynomi number iter applic bound number rule iter step feasibl polynomi time hard languag decid step polynomi transform instanc logic program section lemma accept reach accept state step translat simpl feasibl logarithm rule gener independ size logarithm note number syntact constitu rule constant size shown languag reduc proposit logic program proposit logic program theorem prove simpler reduct monoton circuit problem proof principl comput natur logic program basic framework form result deriv slight adapt sequel notic standard program proposit logic program feasibl linear time data result decid horn satisfi gallier problem solvabl linear model comput gallier ram reduct gener polynomi input theorem hold stronger reduct hold requir reduct reduct map problem problem determinist ture machin bit separ input tape cell access index regist encod logic program highli easili reduct syntact restrict program lead complet class insid denot logic program atom bodi result easili theorem proof membership membership part establish reduc problem graph direct graph vertic decid reachabl graph reachabl nl nl close reduct reduc problem problem nl impli nl program question node true reachabl node direct graph vertex set rr set atom edg set edg direct rule edg fact graph construct logarithm space problem nl hard graph reachabl easili transform program graph reachabl result establish observ encod easili modifi program syntact restrict yield problem complet reduct stronger omit complex datalog turn data complex ground input yield polynomi size complex proposit logic program upper bound data complex hold variant datalog sequel complex proposit logic program lower bound theorem datalog data complet result proof theorem altern proof write simpl datalog proposit constant repres rule tupl ha relat proposit atom program store evalu fix datalog program relat rule intuit mean atom true data complex datalog theorem program complex exponenti higher theorem datalog program complet exptim proof membership ground lead proposit program size exponenti size fix input theorem program complex exptim hard order prove show halt step input simul datalog program fix input empti emploi scheme encod logic program predic symbol oe state proposit letter symbol oe state time point tape posit rr repres tupl function realiz mean successor succ linear order induct succ element linear order ariti rule succ succ succ succ succ provid usual order provid relat ground fact succ initi fact symbol oe readili translat datalog rule symbol oe repres posit similarli fact state remain initi fact symbol translat rule symbol repres number order easili defin succ succ transit inertia rule easili translat datalog rule realiz bodi atom succ symbol oe state symbol oe translat symbol oe state symbol oe succ translat accept rule straightforward result datalog program hold accept accept input step easi construct logarithm space datalog program complex note straightforward simplif construct omit part gener hard part theorem obtain appli complex upgrad techniqu yannakaki lozano briefli outlin rest section techniqu util lemma al form succinct variant instanc boolean circuit comput bit al rr strongest form lemma monoton project reduc lemma rise upgrad subsequ sharpen al gottlob mannila leon state strongest form complex class denot string length binari lead belong theorem complex class hard hard monoton project reduct remark monoton project reduct special encod succinct problem observ section obtain monoton project program store repres binari string standard reduc evalu datalog program fix succinct instanc boolean circuit boolean circuit comput construct negat input gate circuit simul straightforward datalog rule input gate rule rule observ boolean circuit arbitrari negat easili simul stratifi datalog papadimitri disjunct datalog gottlob mannila desir program rule boolean circuit rule metainterpret adapt binari encod domain binari tupl ariti dlog ju je construct feasibl logarithm program complex datalog refer reader al gottlob mannila gottlob al technic detail logic program function function symbol logic program entail atom longer decid prove reduc hilbert tenth problem queri answer full logic program natur number repres constant successor function addit multipl express simpl logic undecid full logic program undecid equat show full logic program express languag fixpoint logic program set show logic program rr theorem logic program theorem prove simpl encod ture machin similar encod proof theorem term repres cell posit time interest note assert time logic program close relat result essenti minim model semant logic program arithmet yield set theorem gener express martelli sharpen syntact class logic program binari horn program simul ture machin transform binari horn ik show class logic program call stratifi section complet prove variant restrict size explicitli singl type proof show function express fragment natur decid fragment logic program function intuit predic depend syntact section complex theorem theorem voronkov logic program membership establish appli constraint size deriv turn exponenti prove reduct tile problem squar fragment logic program function symbol decid result establish simul altern ture machin logic program vice versa theorem logic program function symbol rule restrict bodi size head greater equal number occurr variabl bodi equal number occurr head simul assum input altern ture machin written extend simul distinguish show class logic program logarithm complex complex maxim size subgoal term occur proof tree goal relat notion complex normal form defin term comput tree studi refer fit fit materi issu relat logic program context reduc languag understood term ture decid oracl reduct rr issu data combin complex aspect logic program context datalog discuss issu receiv broad attent strongli restrict class logic program consid literatur class singl rule program program consist rule rule atom long decid problem lp function consist uniqu rule set ground ground goal hold problem horn implic check closur horn logic impli closur horn problem shown undecid decid special case problem studi gottlob undecid result infer satisfi problem restrict form atom rule found datalog exptim complet respect program combin remain true datalog consist uniqu rule fact decid closur datalog logic impli closur datalog exptim problem evalu horn function set ground fact merlin fix set ground determin rule problem problem evalu boolean conjunct queri datalog bodi input subsumpt problem johnson parametr complex conjunct queri studi yannakaki respect data datalog complet gener inher sequenti kanellaki interest special case queri evalu parallel insid parallel issu van gelder polynomi fring properti studi datalog program polynomi fring properti goal deriv tree fring set polynomi size data complex datalog program polynomi fring properti class languag reduc logarithm space languag subclass nc highli paralleliz problem program fring log nc van gelder kanellaki nc level complex class nc class defin famili uniform boolean circuit depth program polynomi fring properti linearli exist nonlinear linear nc rr polynomi properti width consid datalog program properti deriv atom obtain deriv tree polynomi size deriv tree gener deriv node repres ground atom width polynomi properti coincid polynomi fring higher properli gener kanellaki show data complex datalog program polynomi properti fix constant width hypergraph horn conjunct queri set vertic set variabl occur set hyperedg atom rule bodi hyperedg consist variabl occur hypergraph rule evalu problem feasibl polynomi time complet highli paralleliz leon scarcello gener result type acycl leon scarcello determin datalog program data complex gener undecid van gelder sagiv vardi problem complet resolv papadimitri interest relev class call simpl chain queri logic program singl rule hand side consist binari relat form chain involv predic afrati papadimitri show simpl chain queri complet nc give simpl chain queri paper devot decid problem datalog program datalog program exist constant number iter step order comput fix point bound independ depend interest shown gurevich datalog program bound queri import relat result datalog vardi undecid gener datalog program shown al linear queri larg number paper discuss decid syntact restrict datalog program variant uniform good survei earli work incomplet list paper import result relev refer decid issu uniform vardi suffici condit nicola sagiv ioannidi vardi naughton naughton sagiv naughton sagiv subsumpt issu studi repeatedli context queri optim queri queri datalog program input schema output schema rr input output output relat shown shmueli undecid datalog stronger form uniform decid case conjunct complet remain consist singl conjunct queri merlin domain linear order comparison liter rule problem singl conjunct queri der meyden result gener set conjunct queri shown der meyden conjunct queri relat polynomi addit sequenti restrict order liter datalog program datalog program rewritten set conjunct decid conjunct queri arbitrari datalog program kanellaki lewi chaudhuri vardi investig datalog program datalog program show problem gener set conjunct queri show decid datalog program observ problem conjunct queri subsumpt problem subsum exist substitut subsumpt algorithm discuss gottlob ramakrishnan ramakrishnan extend set conjunct essenc datalog program yannakaki discuss notion logic subsumpt problem plai import role field induct logic program complex result ilp consult dzeroski leon scarcello problem relat subsumpt remov redund complex result algorithm found complex evalu problem relat problem gener herbrand nonground studi complex logic program negat stratifi negat liter atom posit negat atom neg liter liter denot complementari set lit normal rule form lm atom liter normal logic program finit set normal semant normal logic program numer exist bidoit apt gener consensu stratifi normal logic program rr normal logic program stratifi blair walker assign integ predic predic head predic neg reconsid steam turbin scenario add rule program check sensor signal error signal error valv signal error pressur signal error rule express knowledg potenti signal handl check sensor augment program assign signal atom occur condit stratif satisfi reduct normal logic program herbrand interpret lifschitz denot set ground obtain remov neg liter bodi remov neg liter remain rule notic set ground horn semant stratifi normal program defin arbitrari stratif str denot set rule str head predic defin sequenc herbrand herbrand model str semant str depend stratif str al note proposit case str polynomi comput program stratif list introduc sensor signal signal error signal valv pressur str theorem al stratifi proposit logic program negat stratifi datalog negat data complet program complet exptim full logic stratifi negat yield arithmet hierarchi theorem blair logic program level stratifi negat complet rr signatur negat pspace pspace nexptim nexptim negat pspace pspace log log negat pspace pspace pspace nexptim negat pspace pspace pspace log log tabl summari result recal denot relat natur number defin arithmet mean formula free variabl quantifi altern set complex result stratif found case stratifi negat logic program program stratif predic occur defin stratum head rule theorem vardi proposit logic program negat datalog negat program complet data complex class ac languag recogn unbound circuit polynomi size constant depth voronkov classifi complex logic program depend presenc negat call variabl occur occur posit liter bodi program number good domainindepend present result voronkov explain notat signatur paper tupl denot signatur unari function symbol function symbol ariti complex logic program summar tabl tabl mean class function comput altern ture machin kozen altern time branch class close polylin run polynomi time logarithm output linearli bound input complex class connect complex logic theori berman order defin defin function recal problem call elementari decid time bound fix natur number class problem lower upper time bound form case tabl complet complex case lower upper bound linearli grow tower huge differ datalog negat logic program negat program pspace result languag polynomi data rr complex theorem voronkov logic program negat polynomi data complex negat roughli semant ross schlipf assign atom defin negat wf defin subrahmanian oper greatest denot mean program wf wf note stratifi wf stratifi semant coincid theorem gelder van gelder al proposit logic program negat wf datalog negat wf data complet program complet exptim question wf decid linear time open schlipf franco fragment datalog negat linear data complex linear combin recent identifi call datalog express tempor properti finit state system repres kripk structur express ctl tempor logic automat verif full logic theorem logic program negat wf class belong analyt hierarchi relat relat defin formula tupl predic variabl oe formula free variabl detail class context logic eiter gottlob stabl model semant interpret normal logic program stabl model lifschitz herbrand model normal logic program multipl stabl model sleep work stabl model rr denot set stabl model mean st stabl model semant st note stratifi uniqu stabl stratifi stabl semant coincid rule complex theorem truszczynski bidoit proposit normal logic program decid proof membership polynomi time comput stabl model guess check polynomi time hard modifi encod section nondeterminist ture machin state symbol introduc atom transit oe add bodi transit rule oe rule rule nondeterminist select transit oe time instant transit rule enabl add rule accept ensur accept true stabl model stabl model result program correspond accept run easi obtain theorem truszczynski schlipf cf papadimitri logic program negat sm datalog negat sm data complet program complet full logic sm complex wf theorem nerod logic program negat sm result stabl model logic program found nerod complex aspect stabl model includ compact stabl model semant nonground logic program subrahmanian lu subrahmanian optim issu determin symmetri stabl model gottlob leon rr inflationari semant inflationari semant hull vianu inspir inflationari fixpoint logic place limit sequenc inflationari oper comput polynomi time proposit program coincid horn program theorem vianu implicit logic program negat inf datalog negat inf data complet program complet exptim semant version abiteboul page place limit sequenc undefin similar algebra queri languag earlier harel vardi datalog partial fixpoint logic vianu abiteboul al easili proposit program comput polynomi bound tight theorem vianu abiteboul al logic program negat datalog negat data complet pspace program complet expspac semant negat number interest semant logic program negat partial stabl maxim partial stabl regular perfect fixpoint complet yuan kolaiti papadimitri papadimitri yannakaki semant remain kolaiti papadimitri papadimitri yannakaki detail complex result extens logic program negat handl kind strong default negat gelfond lifschitz pearc wagner semant consid default negat singl kind negat kind negat suitabl logic program knowledg formal gelfond approach gelfond lifschitz strong negat interpret classic negat rule rr natur express bird fli default negat classic negat languag extend logic program treat liter classic negat default negat appli notion answer set program defin natur gener concept stabl model gelfond lifschitz extend logic program normal logic program sm theorem dechter proposit extend logic program decid answer set extend logic program complex result extend logic program rule prioriti found eiter extens logic program hierarch modul leon rullo disjunct logic program disjunct logic program extend logic program ad disjunct rule order suitabl knowledg express natur repres person male femal disjunct logic program set lm atom liter minker rajasekar recent semant disjunct logic program base minim herbrand model exist gener consist singl minim model fpg fqg denot set minim herbrand model gener close world assumpt amount mean fl lg proposit program describ behavior review review good bad paper happi good angri bad smoke happi smoke angri paper rr model gcwa gcwa good gcwa theorem gottlob eiter al proposit disjunct logic program proposit atom decid gcwa decid gcwa proof hard argu atom gcwa pc pc classic logic consequ relat hard argu set repres suitabl disjunct logic program part obviou part membership gcwa exist guess verifi oracl np polynomi membership problem hard show encod altern ture machin kozen recal atm set state partit existenti state machin reach input accept comput continu successor configur accept simul assum singl tape bound atm start transit run solv problem kozen adapt construct proof theorem show machin input simul disjunct logic program gcwa loss assum run bound diaz start construct input proof theorem drop accept replac oe logic disjunct minim model atom mean branch run current constitut proposit program deriv accept gcwa accept state rr respect time point set state state symbol oe state state state rule state run enter relev fact involv time point true run tilt set termin state state true run end state result program minim model correspond accept run minim model correspond partial run initi state complet run end accept state impli minim model accept input gcwa minim model accept input clear program construct logarithm space decid gcwa note problem field nonmonoton reason gottlob eiter gottlob eiter gottlob stabl negat natur extend disjunct logic adopt stabl model disjunct logic program gelfond lifschitz disjunct stabl model semant subsum disjunct stratifi semant natur extens semant dix przymusinski appeal attempt direct easili theorem gottlob eiter al gottlob mannila proposit dlp sm complet disjunct datalog sm data complet program complet np result deriv util complex upgrad techniqu section remark sophist algorithm comput stabl model proposit disjunct logic mirror complex problem rullo scarcello full theorem subrahmanian dlp gcwa theorem gottlob full dlp sm rr disjunct add complex gcwa sm finit herbrand infinit intuit explain fact dlp sm correspond weak fragment translat semant dlp analyz complex lower coincid world model semant sakama inou causal model semant gottlob marek higher regular model semant maxim partial stabl model semant leon typic proposit case extend disjunct logic program default classic defin analog case logic program lifschitz notion answer set gener stabl model program disjunct complex disjunct stabl extend disjunct logic program proposit case gottlob fragment lower complex import fragment program distinct atom mutual depend posit default negat occur head rule shown dechter extend disjunct logic program program transform normal logic program stabl model semant gener default negat head studi sakama author complex arbitrari program extens disjunct logic program complex studi truszczynski rajasekar minker ruiz leon rullo al rosati rosati leon rullo analyz effect kind constraint stabl model weak constraint violat lead notion stabl model complex optim problem al disjunct logic program extend classic negat modular featur complex paper rosati address complex epistem oper minim knowledg belief disjunct logic program express power logic program express power queri languag datalog topic common theori al finit model theori attract attent commun express power queri understand set queri express languag note mention queri languag formal formal logic finit model theori logic finit structur fixpoint logic definit consult queri defin map assign suitabl input fix input result fix output logic queri defin global relat reason queri invari isomorph mean permut rr domain speak gener queri express power queri languag set map queri express languag queri express syntact express commonli identifi semant queri simpl call queri import research task context compar queri languag express power mean set queri express proper subset queri express strictli express show queri languag express denot research relat complex determin absolut express power queri languag achiev prove queri languag express queri evalu complex complex class captur write simpli evalu complex queri complex check atom belong queri case boolean queri evalu true gurevich note substanti differ show queri evalu problem queri languag show captur evalu problem queri express captur express queri evalu prove captur involv prove evalu note queri languag captur complex class complet problem exist problem logic finit structur captur polynomi hierarchi complet problem exist complet problem ph impli finit wide believ theori finit model theori deal descript express power queri languag relat logic formal complex class call descript complex theori earli foundat result field fagin theorem state existenti logic captur np eighti descript complex theori flourish disciplin deep result prove queri languag captur complex class show finit structur input comput gener queri repres express languag slight mismatch ordinari machin logic queri ture machin work string encod input encod implicit linear order element ud ture machin profit order order comput long gener logic ud pure set unord queri languag inher nondeterminist natur level np order ud nondeterminist guess queri complex class gener linear order feasibl assum linear order element explicitli input order order finit schema special relat symbol interpret successor relat linear order determin element rr element order import predefin linear order evid theorem highlight small mismatch ture machin datalog set ture machin input bit independ plain datalog program detect atom part input due peculiar posit inform present neg inform understood close world assumpt slightli augment syntax datalog assum input predic negat datalog rule result languag datalog extrem limit form negat weaker stratifi easili circumv adopt theorem harel datalog proof show exist datalog program input number element plain datalog negat input defin monoton output grow monoton datalog express queri comput polynomi time natur question datalog express monoton queri comput polynomi time shown yannakaki answer neg datalog express set linear constraint form order al decid direct graph path length perfect squar express datalog datalog augment languag datalog studi shmueli show express plain datalog properti express aspect languag studi al lakshmanan mendelzon gurevich kolaiti vardi afrati perfect squar queri express datalog order corollari result theorem implicit order datalog captur proof theorem queri answer fix datalog program remain show finit input simul datalog program show make simplifi assumpt ud initi segment natur linear order segment input schema consist singl binari relat predefin predic graph gi oper ju comput boolean predic rr simul akin simul proof theorem recal framework section spirit suffic encod number fix datalog program achiev hx variabl rang encod integ time point tape encod input graph recal section reflect initi fact symbol oe translat rule datalog spend word input graph repres binari string graph gi encod binari string length ju true bit number bit bit posit integ integ repres bi true input initi rule translat datalog rule symbol symbol rule time point bit number tape true rule state bit note rule appli negat input predic rule entir datalog program negat rule simul time point cell string initi rule section easili translat datalog rule rule translat datalog linear order easi defin datalog linear order succ proof theorem succ succ transit inertia rule accept rule easili translat datalog proof theorem output schema result datalog program defin clear program evalu true input accept accept gener set simplifi assumpt made straightforward omit assumpt easili lift comput output predic case output scheme singl binari relat output comput graph encod similar input binari string length ju machin enter halt string ju cell tape obtain posit fact output relat add symbol state halt rr remark result similar theorem independ obtain state succinctli interest result datalog promin queri languag fixpoint logic extens logic fixpoint oper predic occur posit formula tupl free variabl return fixpoint oper defin fa refer harel abiteboul al detail shown harel express proper subset queri datalog relat theorem harel datalog datalog coincid fragment negat restrict relat existenti quantifi express gurevich shown datalog queri formula express existenti logic ad stratifi negat preserv datalog fixpoint logic theorem theorem implicit stratifi datalog theorem obviou time coincid languag base respect statement harel fragment datalog coincid queri languag theorem abiteboul al datalog negat relat algebra relat calculu datalog negat logic function express power relat algebra fragment queri languag sql sql group aggreg express power sql discuss wong libkin wong libkin negat yield higher express power theorem datalog wf gelder datalog inf vianu recent result hold total wf model ludasch remark variant datalog mention defin queri express logic finit variabl vardi queri defin languag true size grow infin vardi easi boolean domain input fix number true comput polynomi express variant datalog order theorem theorem section impli rr theorem order queri languag captur stratifi datalog datalog wf syntact restrict captur class datalog fragment datalog rule predic datalog fragment datalog predic occur rule head theorem order datalog captur nl restrict datalog captur due inher stabl semant express theorem datalog sm captur note result order input stabl model order guess check program fagin impli datalog sm existenti fragment logic finit structur theorem order datalog captur pspace order interest result formul term vianu datalog inf datalog arbitrari finit pspace direct proof direct involv rare exampl translat open relationship determinist complex class relationship queri languag briefli address express power disjunct logic program theorem al gottlob mannila disjunct datalog sm captur fragment disjunct datalog interest properti disjunct datalog express subset queri express express credul notion true stabl model credul consequ queri datalog express disjunct datalog inequ predic recogn full logic program input arbitrari necessarili relat genuin herbrand program theorem eiter gottlob logic program logic program dlp sm captur ad disjunct express power normal logic program reason disjunct logic program express weak fragment class case infinit herbrand code fragment express result logic program leon captur variant circumscrib datalog rr class polynomi hierarchi captur variant stabl model leon modular logic program gottlob al result express stabl model semant disjunct set ground found eiter conclud subsect express result nondeterminist queri nondeterminist queri map input set output view function queri return output hamiltonian cycl input graph nondeterminist queri queri consid special case nondeterminist queri shown class nondeterminist queri comput polynomi time captur suitabl nondeterminist variant variant vianu datalog extend choic datalog stabl model pedreschi pedreschi class nondeterminist queri comput polynomi captur nondeterminist variant datalog vianu tutori survei relat determinist recommend issu nondeterminist refer zaniolo grumbach order mismatch relat machin result captur complex class logic languag suffer order mismatch result vardi show pspace datalog inf datalog coincid order order code input standard comput ture semant datalog logic defin directli term logic order element overcom vianu abiteboul vianu introduc relat complex comput unord structur model relat machin vianu abiteboul vianu vardi vianu relat complex class polynomi np nondeterminist polynomi pspace polynomi exptim exponenti separ result standard complex class translat separ result relat complex class np np datalog semant captur relat complex class unord theorem theorem datalog inf captur datalog captur pspace note correspond separ result standard complex class relat complex theorem impli datalog inf coincid datalog pspace result vianu abiteboul vianu abiteboul al provid correspond question comput descript complex rr express power logic program complex valu express power datalog queri defin term input output finit set tupl order extend notion express power logic program complex defin input case plain logic input finit set ground finit set tree case logic program input set element set model languag deal complex valu abiteboul kanellaki abiteboul grumbach kifer wu lausen wu abiteboul beeri tannen suciu wong abiteboul al function approach languag domin logic program extend variant nest relat algebra al bound fixpoint construct fixpoint construct libkin compar express power languag complex valu studi abiteboul grumbach suciu abiteboul beeri abiteboul beeri introduc model restrict combin tupl set queri includ algebra logic program prove languag defin class queri voronkov show logic program negat express power datalog negat natur data datalog gain express result logic program negat ac absolut express power languag complex valu studi suciu grumbach vianu van gucht suciu express queri faith extens studi wong wong paredaen van gucht result express power form logic program constraint found kuper kuper revesz libkin wong gyssen van gucht unlik research express power mainstream research express power logic program complex valu extens declar queri languag complex valu activ studi theori unif complex complex queri answer simpl logic program consist problem lead problem solv equat unif problem unif li heart implement logic program autom reason system atom term call unifi exist substitut make term substitut call unifi unif problem term robinson algorithm solv problem answer comput gener unifi term algorithm exponenti time space complex term string symbol rr direct acycl robinson algorithm improv linear time montanari theorem kanellaki mitchel kanellaki unif problem unif problem prove reduct version circuit problem al al state unifi complet al counterexampl proof quadrat time linear time unif algorithm algorithm suitabl applic gener survei main unif algorithm mention martelli montanari algorithm base idea back herbrand famou work modif algorithm wide unif equat theori rewrit system time complex martelli montanari algorithm function function grow slowli logic program equal relat model data deal simpl tupl consist atom compon gener formal handl complex valu nest tupl section beeri formal express term logic program equal gallier voronkov constraint logic program consid section equat theori languag equal predic equat atom term equat theori set equat close logic consequ set satisfi equat function symbol substitut syntax logic program equat theori coincid ordinari logic program semant defin gener semant logic program term identifi equal demonstr logic program equal logic program process finit set finit set typic complex valu handl repres finit set ground term constant fg denot empti repres set ground term ft sg repres set ftg ftg necessarili equal set defin ident term equal equat theori term consid equal repres equal set omit axiomat rr simpl program check set nonempti intersect program consist fact empti fx check set common queri empti answer posit system equat solut equat theori fx fx set note repres set list plain logic program encod empti intersect requir complex logic program depend complex solv system term equat problem system term equat solvabl equat theori problem simultan substitut call term equat logic consequ theori problem problem exist term ordinari unif view trivial equat natur solut equat theori complex solv equat tradit subject mathemat result solv equat system view result practic imposs overview result complex restrict survei case close connect logic program gener theori found equat theori binari function symbol infix call associ symbol equat variabl call abbrevi associ call stand call equat constant belong theorem baader schulz kapur equat theori defin function symbol associ symbol logic consequ upper lower bound complex problem problem problem algorithm unif associ base algorithm word equat upper bound obtain theorem popular kind equat theori rr theorem kapur baader schulz equat theori defin symbol kind theori equat problem complex logic program equal case ordinari simpl reduc solvabl finit system equat solvabl singl equat kind solvabl exist equat theori solvabl problem equat solvabl system equat undecid otto simultan determin decid logic program theorem voronkov equat theori logic program decid problem simultan decid equat theori call problem solvabl equat system np equat theori finit set mention equat theori bag finit equat theori tree equat voronkov theorem voronkov logic program equat theori nexptim theori finit combin logic program constraint logic program constraint logic program extend logic program involv addit condit term condit express inequ term semant constraint predefin depend logic program illustr clp standard solv letter variabl rang decim digit letter denot digit puzzl solv constraint logic program domain integ program written rr queri answer solut structur defin interpret languag nonempti set structur defin standard interpret languag consist constant successor function symbol equal predic set natur number structur denot exampl structur obtain replac set ration complex denot structur similar mind standard interpret arithmet function symbol number set symbol stand multipl denot unari function multipl number similarli structur assum equal symbol structur atom term languag call constraint constraint logic program finit set rule predic symbol occur languag list variabl semant clp defin natur gener semant logic program jaffar maher function symbol interpret tree constructor equal term interpret ordinari clp extens logic program clp regard extens datalog constraint complex constraint logic program sourc complex complex solv system constraint complex logic program scheme interact compon lead complex higher sum complex datalog linear arithmet constraint satisfi problem np integ ration number undecid theorem clp hold rr proof fact clp defin addit multipl term successor equat express fragment clp simpler constraint order infinit domain complex datalog theorem clp hold decid fragment clp complex structur obtain restrict constraint logic program conserv clp rule satisfi variabl occur bodi occur head theorem al conserv clp linear inequ ration linear inequ polynomi inequ polynomi equat complex number proof base result complex algorithm algebra structur nonground replac gener formal logic program constraint constraint model introduc kuper revesz defin constraint formula mathemat structur field real simplest finit relat constraint finit repres infinit number tupl investig data complex logic datalog constraint prove case real fo queri constraint parallel complex class datalog queri finit libkin improv nc upper bound parallel class tc languag recogn constant depth threshold circuit express constraint set express issu logic program formal constraint studi express logic datalog constraint intens research area theori import paper subject found recent icdt lic confer detail uniform treatment scope paper limit descript number relev close relat set al symposium principl icdt intern confer lic ieee symposium logic comput scienc rr main research issu question properti pariti express fo stratifi datalog express respect formal extend constraint question depend interpret variabl queri activ interpret restrict domain valu variabl valu effect activ natur interpret make restrict variabl interpret underli domain note interpret coincid classic relat calculu su libkin activ interpret constraint question solv independ al otto van den bussch shown gener queri express fo constraint express fo linear order pariti express constraint set express problem datalog constraint resolv libkin ramsei theori analog result shown datalog constraint express datalog linear order natur shown su queri defin fo polynomi constraint natur number shown su al similar result hold real al shown field gener queri firstord logic constraint rewritten queri natur order result van den bussch van gucht gener queri logic constraint natur interpret express queri activ interpret express bound activ interpret hold previou pariti express libkin libkin shown polynomi constraint activ natur semant coincid result gener care fixpoint logic datalog libkin function symbol occur bodi datalog queri express hybrid approach fixpoint comput restrict activ domain quantif refer natur similar fo fixpoint logic datalog result real gener larg class structur quantifi elimin acknowledg jan van den michael leonid mosh colleagu comment previou version paper suggest improv extrem valuabl comment leonid libkin refer horn complex boolean function cook scandinavian logic aalborg pp undecid datalog program singl inform process letter rr power languag manipul complex vldb journal languag complex ceri technolog intern confer extend vol lectur note comput springer pp foundat publish object ident queri languag sigmod symposium manag data pp acm relat comput journal associ comput machineri extens queri journal comput system scienc gener comput acm symp theori pp journal comput system scienc ariti queri journal comput system scienc express restrict symposium theori comput pp datalog polynomi journal comput system scienc parallel complex simpl logic journal associ comput machineri versu journal comput system scienc gener complet horn predic logic program acta publish version report entitl complet logic van leeuwen chapter arithmet classif perfect model stratifi kowalski joint intern confer symposium logic program mit pp theori declar deduct logic morgan pp program journal logic program van theori logic journal associ comput machineri unif union disjoint equat combin intern confer autom deduct vol lectur note artifici pp rr union disjoint equat combin procedur journal symbol comput unif hogger logic artifici intellig logic oxford press subsumpt algorithm base search colloquium tree algebra program number note comput springer pp structur complex springer complex algorithm problem succinct plenum pp program knowledg journal logic program altern semant logic program nonmonoton journal autom reason semant disjunct logic annal mathemat artifici intellig match journal symbol comput relat express power constraint queri symposium principl system pp structur queri constraint queri ieee confer logic comput scienc ieee comput societi pp languag relat interpret symposium principl system pp comput semant nerod intern confer logic program nonmonoton reason number note artifici springer pp bound arithmet real preliminari ieee intern confer foundat comput scienc pp complex logic theoret comput scienc theoret comput scienc default theoret comput scienc complex semant predic logic program languag inform control complex local fundamenta informatica disjunct nonmonoton theoret comput scienc complex theoret comput scienc rr deduct polynomi time journal logic program und phd univ zur de auf von mit archiv ur mathematisch logik problem predic colloquium north pp classic perspect mathemat berlin disjunct semant base partial int conf logic mit pp prefer answer set extend logic schubert sixth intern confer principl knowledg reason pp full paper artifici intellig express power uniqu total stabl model languag program intern vol lectur note comput pp strong weak constraint disjunct intern confer logic program nonmonoton reason number note comput pp full paper ieee transact knowledg data engin disjunct order semant schubert sixth intern confer principl knowledg reason pp full paper annal mathemat artifici intellig machin mathematisch program complex object collect theoret comput scienc express power theoret comput scienc survei complex result journal logic program algebra geometr comput twentieth annual acm symposium theori pp logic program survei comput springer verlag world semant disjunct ieee transact knowledg data engin complex relat journal comput system scienc queri journal logic program rr implic depend infer symposium theori comput pp journal associ comput machineri optim implement conjunct queri relat ninth acm symposium theori pp complex datalog symposium principl system pp datalog journal comput system scienc close world assumpt inform process letter tractabl iter mechan bag afrati intern confer theori number note comput springer greec system de commun en technic group de recherch en intellig universit ii datalog choic comput tanaka intern confer deduct vol lectur note comput pp express symposium principl system pp parallel evalu rule symposium principl system pp express constraint technic report european comput industri research center procedur extens logic select mit pp comput complex constraint logic program languag extend mit pp skolem normal form theori number note comput springer pp complex express power logic twelfth annual ieee confer comput pp bag set technic report uppsala comput scienc depart complex queri answer logic complex foundat comput scienc intern vol lectur note comput pp express power data complex logic uppsala comput scienc research report uppsala comput scienc depart rr bag set ed york note semant logic program equal base complet set journal logic program tool studi halt problem time complex term rewrit system logic theoret comput scienc horn journal logic program halt problem binari horn finkel tenth symposium theoret aspect comput number pp comput complex prolog theoret comput scienc disjunct semant fundamenta informatica local properti queri int conf vol lectur note comput springer pp algorithm test satisfi proposit horn journal logic program sequenti natur journal logic program algorithm term siam journal comput finit model perspect mathemat springer verlag complex proposit knowledg base counterfactu artifici intellig circumscript extend close world reason theoret comput scienc complex journal associ comput machineri comput cost disjunct logic proposit annal mathemat artifici intellig stabl model semant disjunct logic program function journal logic program logic semant theoret comput scienc indiscern individu logic journal logic comput ad disjunct symposium principl system pp acm transact system rr modular logic gener furbach intern confer logic program nonmonoton reason vol lectur note artifici springer pp power complex partial model disjunct deduct theoret comput scienc stabl european journal artifici intellig preliminari abstract proc lnc page springer gener spectra recogniz american mathemat pp model oper behavior logic theoret comput scienc comput logic oxford press oper modular logic journal logic program total partial datalog afrati intern confer theori number note comput pp undecid optim problem logic ieee confer logic comput scienc ieee comput societi pp extend method horn equal base logic pp equat horn journal logic program comput san francisco stabl model semant logic intern confer symposium logic mit pp negat logic program disjunct gener comput deduct annal mathemat artifici intellig choic comput journal logic program inform process letter result nonmonoton journal logic comput complex datalog prepar redund artifici intellig datalog deduct versu tempor reason automat verif submit public rr fast subsumpt european confer comput algebra volum research vol lectur note comput springer pp effici journal associ comput machineri complex induct logic program lavrac intern workshop induct logic vol pp version gener comput complex acycl conjunct ieee intern confer foundat comput scienc tractabl queri submit public logic weak exponenti confer mathemat foundat comput scienc vol lectur note comput pp full annal pure appli realiz stabl theoret comput scienc work complex result atom herbrand model submit public complex class fragment order theoret comput scienc datalog data knowledg engin express power lectur note comput scienc determinist semant complex express intern confer deduct vol lectur note comput pp applic theorem prove phd comput scienc stanford system polynomi inequ journal symbol comput machin annal mathemat artifici intellig defin constraint montanari confer principl practic constraint program pp linear constraint queri express power comput pp queri languag complex object journal comput system scienc logic challeng comput trend theoret comput comput scienc chapter pp rr extens annal pure appli logic van polynomi bound fixpoint construct nest workshop program itali springer electron public smallest binari inform process letter integr function logic theori journal logic program logic harvard press problem datalog journal logic program foundat equat logic vol lectur note artifici springer verlag independ relat acta informatica quantifi elimin theori annual acm symposium theori pp queri comput polynomi inform control captur complex siam journal comput descript graduat text comput springer york transform abduct logic program disjunct pp failur journal logic program time bound materi defin algorithmica complex measur logic journal logic program logic journal logic program catalog complex van leeuwen chapter problem determinist polynomi theoret comput scienc logic program parallel deduct logic morgan pp element relat van leeuwen chapter constraint program queri constraint queri symposium principl system pp rr queri journal comput system scienc set unif match intern confer autom deduct vol lectur note comput pp unif problem journal autom reason logic program sigart bulletin foundat journal associ comput machineri logic program complex journal comput system scienc express power stratifi logic inform comput negat journal comput system scienc fixpoint logic logic ieee confer logic comput scienc ieee comput societi pp express power tool case journal comput system scienc journal associ comput machineri predic logic program north pp resolut select artifici intellig induct pebbl game express power symposium principl system pp decid horn class klein workshop comput scienc vol lectur note comput springer pp resolut springer verlag decid horn implic problem order semant intern symposium comput intellig sept pp comput journal comput system scienc complex search intern workshop foundat model languag data object pp stabl unfound fixpoint semant inform comput unsolv class quantif mass rr complet inform process letter form local finit ieee confer logic comput scienc pp queri languag optim sigmod symposium manag data pp queri incomplet inform inform process letter techniqu studi set bag languag aggreg symposium principl system pp set graph gottlob intern confer theori vol lectur note comput springer pp set comput graph theoret comput scienc relat model process automat document mathemat linguist foundat logic program springer verlag foundat disjunct logic logic program mit press logic minker pp problem solvabl equat free mat russian english translat american mathemat soc translat vol method prove undecid uniform singl rule ternari datalog symposium theori comput vol lectur note comput springer pp datalog uniform ieee confer logic comput scienc ieee comput societi pp undecid implic ieee intern confer foundat comput scienc ieee comput societi pp stabl model predic logic journal logic program complic set stabl model logic annal pure appli logic complex ieee confer logic comput scienc ieee comput societi pp journal associ comput machineri extend disjunct logic annal mathemat artifici intellig rr design methodolog prolog van pp unif linear time structur technic report pisa effici unif acm transact program languag system set soviet mathemat pp indefinit data base close world intern confer autom deduct number note comput springer pp disjunct logic annal mathemat artifici intellig logic year intern workshop logic number san pp ed foundat deduct logic morgan washington dc axiom deduct inform system disjunct logic program explicit default fundamenta informatica induct logic logic academ pp result equat int conf autom vol lectur note artifici pp independ deduct journal comput system scienc decid class bound symposium principl system pp simpl uniform class journal logic program normal form complex comput logic klein workshop comput scienc vol lectur note comput springer pp van den queri infinit inform process letter complex symposium principl system pp logic program local theoret comput scienc note express power bulletin comput rr note succinct inform control semant structur journal comput system scienc van den van queri finit structur siam journal comput van nest algebra express flat algebra acm transact system journal comput system scienc logic year intern workshop extens logic program number pp declar semant deduct logic deduct logic morgan pp semant disjunct gener comput semant normal disjunct logic annal mathemat artifici intellig faster pspace algorithm decid existenti theori ieee intern confer foundat comput scienc white pp logic base resolut journal associ comput machineri knowledg framework base autoepistem logic minim nation confer artifici intellig aaai pp express complex nonmonoton knowledg proposit european confer ai pp determinist nondeterminist stabl model semant unbound datalog intern confer theori vol lectur note comput pp express power stabl model bound unbound datalog journal comput system scienc comput restrict project repres symposium principl system pp optim datalog minker pp relat express union differ journal associ comput machineri altern approach semant disjunct logic program deduct journal autom reason disjunct abduct logic pp nondeterminist determinist tape journal comput system scienc rr data base theoret comput scienc undecid result logic annal mathemat artifici intellig express power logic program journal comput system scienc abstract proc pod pp ug der berlin horn program academ pp comput complex logic journal logic program decid express aspect logic symposium principl system acm pp defin bulletin theori formal princeton jersei annal mathemat studi vol logic program number pp logic journal logic program complex theoret comput scienc bit comput applic london mathemat societi seri correct ture famou demonstr formal limit comput base proof halt problem undecid reprint vol comput scienc press vol comput scienc press van complex logic queri algorithmica power languag symposium principl system pp van der complex queri indefinit data linearli order journal comput system scienc preliminari abstract proc pod van semant predic logic program journal associ comput machineri van altern fixpoint logic program symposium principl system pp van semant gener logic journal associ comput machineri van ed handbook theoret comput elsevi scienc rr van express power relat constraint queri intern confer principl practic constraint number note comput pp complex relat queri symposium theori comput san pp decid undecid result linear symposium principl system pp complex symposium principl system pp logic reduc finit model master inform system tu austria leaf project inform comput annal mathemat artifici intellig complex logic program complex symposium principl system acm pp comput logic annal mathemat artifici intellig form conserv extens properti queri languag collect journal comput system scienc algorithm acycl confer larg ieee comput societi pp parallel comput complex confer gener comput pp semant normal logic journal logic program index symbol bp herbrand base bl herbrand base extens problem applic fp oper time space measur consequ relat datalog reduct tp consequ oper herbrand ul herbrand complex class polynomi hierarchi complex class complex class polynomi hierarchi complex class polynomi hierarchi complex class arithmet hierarchi languag semant mean gcwa str stratifi semant wf semant st stabl model semant ac nc nc np np oracl ph complex class oracl tc class complementari consequ relat liter set liter complementari domain schema set relat ground ground ground logic program atom bodi set minim herbrand model set stabl model blank symbol halt halt state state state tp oper tp inflationari oper ji length complex class complex class accept rule accept associ symbol atom auxiliari predic blank bodi bound datalog program captur cell clp combin complex complement languag complementari complementari class complet complex complex class conjunct queri consequ conserv clp constant constraint constraint logic program constraint logic program cursor data complex rr instanc predic schema datalog program queri datalog lite datalog datalog decid definit horn descript complex theori determinist ture machin disjunct logic program disjunct logic program disjunct stabl model dlp domain oracl elementari problem equat equat theori evalu complex exptim express power expspac extend logic program fact fixpoint logic function languag gcwa gener close world assumpt goal ground atom ground ground fact ground logic program ground term ground halt polynomi time hard head program herbrand base herbrand interpret herbrand model herbrand horn consequ oper nonground program inertia rule logic inflationari oper inflationari semant inf initi state initi fact input predic input string knowledg languag herbrand model liter reduct logic program logic program equat theori logic program reduct minim herbrand model motion direct neg liter nexptim rr nl nondeterminist ture machin semant program normal normal logic program np equat theori oracl oracl order mismatch order order finit structur output output predic perfect squar queri polylin reduct reduct polynomi hierarchi ture machin ture machin posit liter predic prioriti program complex prolog pspace queri monoton nondeterminist queri queri express queri languag queri tape reduc reduct reject relat complex theori relat exponenti time relat machin relat nondeterminist polynomi time relat polynomi space relat polynomi time resolut principl rule schema select atom semant set ground simultan sm solut space stabl model stabl model semant state step stratifi program stratifi semant structur substitut subsumpt symbol tape term time transit function transit rule unifi unifi semant wf
ML/1570 6 relat learn techniqu natur languag inform extract mari elain califf depart comput scienc texa austin tx abstract recent growth onlin inform form natur languag document creat greater comput system abil process document simplifi access inform type process task inform type text skim retriev specif type inform text inform extract system exist system gener built hand domain specif make difficult port domain research begun appli machin learn inform extract work involv appli learn piec larger system paper present rule specif natur languag learn learn inform extract rule rapier pair document fill templat indic inform extract learn pattern extract filler slot templat present initi result small corpu job post preliminari version rapier futur research involv enhanc rapier test domain extens addit natur languag process task intend extend rule algorithm type constraint support plan incorpor activ sampl specif queri rapier method potenti substanti reduc amount annot requir explor issu distinguish relev irrelev rapier extract messag assum relev intend run larger test rapier multipl domain includ terror domain fourth messag comparison system plan demonstr gener algorithm appli natur languag process task word disambigu introduct growth amount inform network comput form natur languag document varieti search engin exist retriev document answer question inform requir deeper natur languag provid inform extract inform extract task locat specif piec data natur languag focu arpa muc program extract inform store queri standard queri languag natur languag interfac difficulti inform extract system difficult gener highli make port domain effici mean develop inform extract system desir recent research comput linguist empir method approach develop effici natur languag process system brill method autom acquisit complex knowledg requir nlp train suitabl annot natur languag treebank sentenc empir nlp method emploi statist techniqu hidden markov model probabilist context free grammar research appli method languag process recent languag research symbol recent system successfulli emploi tree transform rule symbol method success empir nlp research recent begun appli learn method construct inform extract system kim symbol statist method gener part larger inform extract system system rapier autom product inform extract learn rule complet inform extract rule produc desir inform piec directli document prior postprocess structur symbol learn classif corpu document pair fill rapier learn pattern make limit syntact semant freeli robust knowledg sourc tagger lexicon rule built pattern unbound give advantag limit rich requir learn algorithm capabl deal complex rapier emploi relat learn algorithm techniqu induct logic program system techniqu develop work relat logic algorithm incorpor idea ilp consist primarili specif gener search present preliminari result rapier small corpu job post recal compar report inform extract system oper varieti domain result approach show plan test algorithm multipl inform extract task appli system area natur languag process remaind organ section present background materi inform extract learn section describ rule rapier learn algorithm section present analyz preliminari result obtain rapier section outlin futur research includ extens rapier plan extens test multipl domain section discuss relat work appli learn inform extract task final section discuss goal research background inform extract inform extract task locat specif piec data natur languag focu arpa messag understand confer data extract templat list slot annot document set valu string directli document figur show pair document templat inform extract task domain job post templat includ slot fill string directli latin american terror templat includ slot type inform extract varieti domain muc task latin american joint compani manag inform extract track medic patient record track compani merger domain light deal wealth onlin extract inform text document order creat easili searchabl make wealth text onlin easili access inform extract job post usenet newsgroup creat easili searchabl job post newsgroup programm nov post servic softwar programm posit softwar programm experienc gener softwar voic mail system experienc program familiar commun control voic prefer experi natur microsystem prefer year experi pc base voic year find senior level person board pick code train present oper system unix futur repli kim anderson fax fill templat softwar programm tn pc unix voic mail nov figur sampl messag fill templat job post domain document jan author report minist gener lopez di todai lima consequ terrorist attack lopez armi command gener minist bullet young individu car open park lot commerci center neighborhood san lopez drive car shot time chest minist rush air forc hospit di fill templat id templat date jan locat lima san type attack stage execut accomplish instrument id instrument type incid categori individu id young organ id organ confid phy id phy type phy number phy foreign nation phy effect incid phy total number hum lopez hum descript armi command gener mi lopez hum type govern offici activ mil lopez hum number lopez hum foreign nation hum effect incid lopez hum total number figur sampl messag fill templat muc terror domain inform extract nl messag semant lexicon logic queri queri processor queri parser nl queri answer figur complet system architectur part complet nlp system support natur languag queri system architectur complet system shown figur queri parser learn system learn parser sentenc pair semant lexicon produc system learn lexicon sentenc pair semant inform extract system gener domain specif incorpor special process modul handl issu inform extract system built incorpor learn modul relat learn symbol relat empir work natur languag process emploi statist section discuss potenti advantag symbol relat learn order accur estim probabl limit statist techniqu base limit bigram trigram word nlp frequent base larger context includ varieti pragmat cue research begun emploi learn techniqu handl larger tree exemplar method ng techniqu requir system develop finit set featur make develop set featur requir engin exclud import contextu inform relat learn method induct structur exampl includ logic predic function unbound data structur list tree induct logic program studi induct rule firstord logic ilp system induc varieti basic prolog program potenti rule base import biolog problem detail comparison ilp induct demonstr advantag relat languag relat text categor gener past english verb advantag techniqu abil background knowledg symbol rule make easier system develop understand verifi result system edit learn knowledg respect background ilp system prolog definit set predic bodi learn rule rapier ilp relat learn algorithm learn structur rule algorithm inspir idea ilp system idea design unbound section briefli describ system directli influenc rapier algorithm ilp algorithm base construct rel idea gener item find gener item cover origin pair fairli simpl comput rel set background relat difficulti introduc background predic defin algorithm oper randomli select pair posit exampl comput determin pair constrain valid substitut variabl bodi result greatest coverag posit exampl gener comput select randomli chosen posit exampl gener process stop coverag longer system combin ilp techniqu algorithm start specif definit set posit introduc gener make definit compact gener creat select pair definit comput result cover neg special ad liter fashion search liter carri inform gain metric evalu liter similar search emploi foil case correct learn exist background attempt construct predic distinguish cover neg exampl cover posit number gener produc greatest compact theori process repeat notion empir mean gener prove posit exampl remov definit progol progol combin search mode declar provid background predic predic construct specif random seed mode declar argument predic argument type variabl bound predic variabl bound predic specif progol emploi search set liter order find simplest consist gener add definit advantag progol constraint search make fairli type task approach search find simplest consist gener exist liter primari problem system mode declar fact small prevent progol learn correct larg search explod nlp resourc part research make resourc natur languag process provid syntact semant inform spend human time develop special parser lexicon plan primari type exist system basic syntact inform emploi program sentenc input label word symbol sentenc tag doesnt provid inform tagger faster robust full parser present eric brill tagger train wall street journal corpu advantag tagger train domain improv perform semant plan emploi lexicon includ semant possibl supplement domain specif lexicon plan wordnet lexic word semant hierarchi form hypernym link filler lead max figur rule extract area filler rapier algorithm rule rapier rule pattern make limit syntact semant inform initi primarili difficulti produc robust parser unrestrict text simpler pattern type repres extract rule domain extract rule index templat slot consist pattern match text immedi pattern match actual slot pattern match text immedi filler pattern sequenc length case pattern item pattern list pattern item match word symbol document meet item constraint pattern list specifi maximum length match word symbol document match list constraint constraint list match document list match document item po list semant class document item belong negat list semant match document item figur show rule creat hand extract area filler document phrase telecommun firm valu nn nn syntact constraint match word tag common noun plural common noun learn algorithm note inspir ilp primarili consist specif gener search rapier begin specif definit attempt compact definit replac rule gener rule pattern creat filler slot word tag filler context entir document pattern item word begin document word immedi filler constraint item consist word po tag filler pattern item word pattern item word end filler end document maxim specif rapier attempt compress gener rule slot rule creat select exist rule creat gener aim make small gener cover posit exampl cover standard approach gener pair rule unconstrain overli specif case constraint creat disjunct remov constraint multipl gener pair item combin fact pattern vari make number gener long pattern extrem make comput cost produc interest gener complet rule prohibit arbitrarili limit length import part pattern close filler start comput gener filler pattern rule creat rule gener maintain list rule creat special rule ad piec gener pattern seed work outward filler rule order inform metric weight size rule smaller al number correct filler extract rule type task provid neg notion implicit neg count number spuriou filler rule extract train exampl size rule comput simpl count constraint pattern pattern list rule size divid simpli valu inform size compon simpli encourag system prefer gener prefer smaller rule case rule inform rule produc neg special rule ad rule rule empir subsum remov special abandon rule improv special iter compress rule base slot abandon number success iter compress algorithm fail produc compress rule exce limit number rule slot outlin algorithm figur priorit list rule search similar beam search limit number rule rule expand creation gener rule base phrase kansa rule creat phrase citi slot initi specif rule document templat learn rule compress fail fewer lim time randomli select find set gener filler creat rule evalu initi rule produc spuriou filler weight inform rule improv increment special rule gener item pattern add special special rule gener item pattern add special rule produc valid filler add remov empir subsum rule figur rapier algorithm induc inform extract rule filler locat atlanta nnp georgia nnp filler offic kansa nn nnp citi missouri nnp nnp filler gener produc rule empti pattern filler item gener list word word constraint gener disjunct word constraint tag constraint item gener rule tag constraint word belong singl semant class semant remain unconstrain filler produc filler max nnp filler max nnp rule cover spuriou add gener item produc comma ident unchang assum lexicon semant class gener state produc semant constraint class tag constraint nnp word constraint disjunct state final rule filler max nnp nnp state evalu section present preliminari result obtain current version rapier job post domain task chosen initi test rapier extract inform job post creat job job post templat includ inform job requir languag platform multipl valu slot valu string directli rapier handl type slot current result emploi semant word result brill po tagger neg constraint experi present data set document pair fill templat averag document length word divid data distinct test set train remain document evalu perform system vari amount train ran test smaller subset train exampl test set produc learn curv test machin learn system measur simpl number exampl correctli classifi type dont set number exampl simpl accuraci clear mean measur percentag slot filler system find percentag slot filler correct templat found system recal result complet correct lower system produc spuriou rule overli gener lower recal system fail find correct rule specif recent muc confer introduc combin recal order provid singl number measur inform extract system report recal weight equal default valu paramet rapier stop failur abandon special special iter fail produc rule figur show perform rapier test data train averag averag recal number compar measur perform inform extract system domain perform compar crystal medic domain task autoslog part terror task compar favor typic system perform muc task comparison task rapier note close document natur coupl fact algorithm train exampl recal figur perform job post coverag encourag creat fairli specif lead high recal recal continu improv number train exampl rule rapier learn type fairli simpl memor word phrase consist includ thing program languag oper system aix mv fill platform slot rule slot filler nnp constrain filler aix tag proper noun rule memor word phrase requir specif phrase circumst valid filler mere memor word phrase seldom rule learn context constrain part speech filler rule extract slot filler filler max token ad system denot end sentenc distinct fragment denot punctuat netnew post futur research plan address number issu futur research fall primari area enhanc plan make rapier algorithm plan incorpor activ learn rapier system order reduc work involv tag corpora amount train data achiev accept level perform extens evalu rapier job post domain addit domain intend explor applic rapier basic algorithm natur languag process task area futur research discuss detail enhanc rapier version rapier preliminari plan enhanc examin rule produc rapier select singl random pair time produc gener pair rule gener larg number potenti gener rule produc system good gener cover number simpli disjunct complet unrel item rule produc rule area filler max rule result gener fairli unrel intuit good gener studi trace algorithm show lot time effort wast explor pair rule hope produc rule intend modifi algorithm similar start randomli select pair rule singl pair algorithm find pair rule gener mechan deal semant constraint present implement interfac lexicon provid semant inform make semant constraint plan connect system wordnet freeli lexicon provid kind semant inform sourc semant inform dictionari program lexicon introduc semant plan algorithm creat semant class singl pattern item word constraint consist disjunct long list semant class creat consist word word constraint replac semant constraint semant class system gener rule develop background knowledg analog predic invent ilp zell interest attempt incorpor word exist semant class semant class consist program languag expand automat incorpor languag addit plan algorithm add neg semant class text match item list constraint constraint found compar correct filler found rule spuriou filler produc produc constraint element spuriou filler constraint match larg percentag spuriou correct filler ad result ad list consid rule extend rule wai possibl weve consid incorpor morpholog inform morpholog function wordnet constraint root inflect word surfac form word form syntact eventu order simpli pattern element syntact phrase singl word arbitrari list emploi plan explor altern rule evalu metric current metric evalu rule base inform rule penal size rule explor variat metric explor metric base minimum descript length idea mdl gener minim size descript data develop theori describ mdl metric seek minim size theori correct theori handl exampl correctli handl theori simpli exampl difficulti mdl determin calcul size correct spuriou filler produc determin empir metric advantag domain examin explor possibl accept rule produc spuriou filler cover larg number advantag mdl metric metric handl paramet system empir tune paramet includ width beam beam number failur improv rule beam search number failur find rule compress rule base compress rule slot abandon size paramet lead rule base lead longer train time valu trial present simpli choic reason default paramet test ideal tradeoff fall discuss current rapier system extract valu string directli origin document text select set valu slot terror task templat type stage execut incid categori instrument categori physic extend algorithm handl extract valu type system straightforward rule modifi includ set case set valu indic string match filler pattern extract case handl gener process modifi slightli account extract interest pair rule gener extract extract string document train data provid system extens actual system portion document creat pattern extract case string simpli occurr string document anchor rule portion document anchor rule rule identifi stage execut terrorist incid anchor phrase mass kidnap point document incid accomplish attempt threaten anchor provid rapier heurist start point work explor possibl find word phrase common document share slot rare document word phrase anchor rule final issu address rapier system identifi relev document experi present document train test relev job post job fulli autom system deal relev irrelev relev templat job system categor engin kind job irrelev post rapier system stand address consid altern deal option run document rapier extract rule templat result extract determin document relev templat highest percentag slot document complet irrelev slot fill system learn slot make relev slot highli specif easili fill irrelev document date job offer post inform inform extract netnew post extract filler number year experi requir strong evid messag job distinguish comput job kind job option deal issu distinguish relev irrelev document determin set templat standard inform retriev techniqu frake classifi document initi pass document inform extract templat made extend rapier handl document classif task separ slot fix valu primari difficulti issu anchor feasibl person identifi portion document place anchor rule determin classif document idea find phrase distinguish filler valu phrase anchor allevi problem option potenti weak strength empir test requir determin method handl classif issu activ learn addit intend activ learn specif select sampl lewi dagan reduc annot effort train exampl equal learn carefulli select annot effort dramat reduc approach successfulli train tagger inform extract activ learn involv construct select inform train exampl passiv accept raw text wide sampl subset exampl annot style activ learn natur languag applic learner maintain multipl definit consist current train data multipl element version space categor unlabel exampl select label exampl disagr cohn singl potenti inform exampl accuraci gain label significantli fewer exampl compar random select intend appli select sampl version queri initi form initi label data unlabel member label request label add train updat consist current train data larger select annot probabl proport amount disagr label learn algorithm retrain select time sampl select batch rapier emploi random sampl pair seed gener member gener random sampl order fairli sampl version space avoid prefer encourag hypothesi specif induct algorithm perform combin alter wai control gener learn rule option requir level compress rule slot vari level compress rule set inform slot treat separ user provid valu slot messag slot found context recogn learn absent tendenc rapier algorithm produc rule high low recal exampl member filler probabilist request slot priori probabl messag provid slot determin exist train activ learn reduc annot test activ learn techniqu compar perform system train set randomli select exampl perform select sampl build train set size activ learn valuabl recal quickli learn curv show job post rapier learn rule repres case requir data activ learn elimin exampl fit easili learn case focu learn common extens addit domain import reason build inform extract system learn rule data easi appli system multipl domain import part research demonstr system work multipl domain expand test system incorpor addit type job job post intent creat inform extract templat addit type job commonli engin job creat gener job templat provid inform job post dont fall specif categori domain examin latin american terror fourth messag understand confer data domain consist document fill templat document half document consid irrelev task slot fill string directli origin text plan experi involv slot experi full templat rapier modifi handl type slot filler feel experi import opportun compar perform inform extract system learn rule system plan addit domain appli rapier addit type newsgroup applic involv web page intellig agent search web specif type inform product price case shop rule type learn rapier extract inform case system learn rule extens natur languag process task rapier basic algorithm prove natur languag process task inform extract task learn rule word disambigu task easili map current system templat creat word templat slot word filler case word system learn pattern select word desir content filler rule interest result run rule determin word filler select altern map word disambigu task inform extract task templat consist singl slot fix set valu word intend run experi word disambigu corpora learn system rapier algorithm success task hope find addit natur languag process task algorithm possibl text classif pattern automat anchor slot good text classif requir multipl pattern anchor part text learn singl rule relat work previou research gener appli machin learn piec inform extract task system typic requir human interact provid text fill templat earliest attempt learn inform extract system autoslog autoslog creat dictionari extract pattern special set gener syntact pattern pattern larger inform extract system includ parser analysi modul autoslog major drawback requir human expert examin pattern produc determin extract pattern dictionari speed construct fulli autom special set gener pattern time doesnt account number correct exampl special number time sampl data pattern trigger incorrectli reason human expert examin valid pattern gener newer potenti pattern statist pattern match relev irrelev document system autoslog reli score pattern base number time templat annot human determin slot extract pattern earlier system human gener pattern select system crystal recent attempt appli machin learn creation inform extract pattern train instanc creat sentenc analyz identifi syntact constitu object tag word semant class crystal requir semant hierarchi domain list concept domain crystal extract pattern syntact consist constraint syntact constitu instanc constraint thing word semant root verb definit instanc extract slot crystal gener initi concept definit seed instanc relax constraint constitu cover addit instanc extract slot gener end neg exampl cover relax constraint system learn inform extract pattern repres rule constrain root verb semant constraint phrase extract gener special rule move semant hierarchi ad disjunct semant class limit inabl place word constraint noun preposit failur place semant constraint noun preposit phrase extract previou reli prior sentenc analysi identifi syntact element relationship learn inform extract pattern function autoslog learn pattern extract multipl singl slot pattern extract rule syntact constraint syntact relationship sentenc element find relationship link element ad element form path extract element extract pattern semant gener learn algorithm seed rule test rule train set primari limit requir sentenc analyz identifi noun make semant assum inform entiti extract primari thing distinguish rapier system learn extract pattern rapier intend handl inform extract task part larger inform extract system system requir sentenc requir part full inform extract system clean output crystal requir semant hierarchi freeli tagger lexicon output distinguish characterist rapier learn algorithm system crystal gener applic machin learn techniqu creat gener train exampl autoslog set heurist creat gener singl evalu gener train set make perform pattern train data evalu gener base coverag train simpli gener base pick doesnt make train exampl gener process train exampl guid gener algorithm highli domain specif gener special consist move semant hierarchi ad disjunct semant class rapier base gener relat learn specif domain repres prove applic nlp task inform extract abil extract desir piec inform natur languag text import task grow number potenti applic task requir locat specif data newsgroup messag web page applic manual construct inform extract system labori learn method potenti autom develop process rapier system relat learn construct unbound rule inform extract text fill templat learn pattern emploi limit syntact semant inform identifi potenti slot filler surround context result extract inform newsgroup job post shown realist fairli accur rule learn small set exampl futur enhanc rapier includ improv learn incorpor semant incorpor activ learn techniqu rapier test addit inform extract includ perform directli compar inform extract system rapier appli area natur languag process refer evalu autom manual acquisit anaphora resolut strategi annual meet associ comput pp ma arpa fourth darpa messag understand evalu san ca morgan kaufman arpa darpa messag understand evalu san ca morgan kaufman eighth intern workshop machin part vi learn il automat grammar induct free approach annual meet associ comput pp ohio learn natur languag case studi tag comput confer empir method natur languag process pa advanc part speech tag twelfth nation confer artifici intellig knowledg acquisit sentenc analysi eleventh nation confer artifici pp statist languag learn mit press introduct special issu comput linguist larg corpora comput text categor relat learn twelfth intern confer machin pp san ca morgan kaufman learn rule classifi paper aaai fall symposium ai applic knowledg navig pp aaai press improv gener activ learn machin sampl train probabilist classifi twelfth intern confer machin pp san ca morgan kaufman minim manual annot cost train corpora annual meet associ comput santa ca inform data structur algorithm prentic hall learn inform extract pattern exampl symbol approach learn natur languag lectur note artifici pp springer construct induct logic program tenth nation confer artifici pp san ca acquisit linguist pattern inform extract ieee transact knowledg induct logic techniqu applic elli horwood perform evalu technolog ai heterogen uncertainti sampl learn eleventh intern confer machin pp san ca morgan kaufman statist model annual meet associ comput pp ma build larg annot corpu penn treebank comput tree resolut fourteenth intern joint confer artifici pp subsymbol natur languag integr model memori mit ma introduct lexic ftp fulli statist approach natur languag interfac annual meet associ comput pp santa ca gener search artifici compar experi disambigu word illustr role bia machin learn confer empir method natur languag pp pa induct result learn past english verb journal artifici intellig effici induct logic program induct logic pp academ york protein secondari structur predict machin learn protein induct logic program academ ny entail progol gener comput integr multipl knowledg sourc disambigu word approach annual meet associ comput pp santa ca note induct gener machin intellig elsevi york infer tree minimum descript length principl inform learn logic definit relat machin connectionist approach natur languag process lawrenc erlbaum nj automat construct dictionari inform extract task eleventh nation confer artifici pp automat gener extract pattern untag text thirteenth nation confer artifici pp automat text analysi retriev inform comput queri acm workshop comput learn theori pa induc conceptu dictionari fourteenth intern joint confer artifici pp issu induct learn text extract rule symbol approach learn natur languag lectur note artifici pp springer theori studi induct artifici acquisit lexicon semant sentenc annual meet associ comput pp ma comput program studi natur languag commun men machin commun associ comput symbol approach learn natur languag process springer berlin combin method induct logic program eleventh intern confer machin pp nj learn queri induct logic program thirteenth nation confer artifici intellig
ML/1571 6 global face space laboratori comput neurosci york ny lawrenc sirovich laboratori appli mathemat mount medic center levi ny abstract sensori signal kei solv comput problem encount vision princip compon analysi past reduc deriv practic compact object class human face studi pca larg face show order interpret pca probabilist object criteria judg gener properti ensembl show eigenfac gener properti depend strongli ensembl composit size statist popul larg stationari interpret call show assumpt mirror symmetri ensembl improv qualiti result substanti essenti regim discuss shortcom pca suggest solut introduct typic imag digit set pixel intens grid face subject featur extract recognit kei process accur estim probabl major part research made william baker gener extend gratefulli accept indebt feigenbaum hospit qualiti paper improv substanti numer suggest knight discuss comment submit oct set face space imag paramet probabl densiti estim finit set train exampl paramount number low order reliabl avoid speed accuraci algorithm critic depend princip compon analysi method deriv optim appli successfulli ensembl facial region full face pca face discrimin recognit build probabilist model serv basi linear fisher discrimin analysi investig percept race sex shown robust gap data uncorrel wide applic probabilist question face space size statist robust estim model paramet open answer studi role mirror symmetri qualiti result face space properli regist normal face repres imag intens valu fxg face regist semiautomat pinpoint center normal affin transform make line pixel crop grid includ pixel tighter crop typic chosen includ background hair preserv facial ident express inform fig pixel grid pixel ensembl face denot foe briefli pca oe oe rank foe correl matric oe tt oe oe fa respect orthonorm eigenvector pictur eigenfac ensembl averag signal power ensembl tv joe tr tr rm oe pca optim subspac eigenfac span captur signal tr rn arbitrari face coeffici pca oe respect reconstruct error oe rec oe oe err oe oe rec standard gaussian model probabl densiti entropi reconstruct log rec ja gener face term captur inform diagon call snapshot method eigenfac possibl eigenfac throw ensembl exampl ey glass feret shown fig initi regim captur sourc variabl intuit mode relat variabl facial rest attribut tempt conclud reason truncat notabl facial structur strong decai persist end eigenfac sequenc perceptu qualiti order verifi adequ estim perceptu qualiti oe rec residu oe err ratio evid fig oe rec snr perceptu ident inform error true oe rec snr notic improv ident captur reconstruct snr detail develop snr notabl teeth eyebrow reason reconstruct rel entrop cost find oe rec captur ident mode regim adequ evid fig weak facial content possibl discrep ensembl gener reconstruct oe rec oe improb fig show entropi qualiti plot parametr function regim rapid snr gain snr achiev low entrop gradual cost compon snr snr entrop cost term context ensembl evid fig support ensembl gener regim figur eigenfac ensembl rest oe err oe err oe err oe err oe err oe err oe err oe err figur success reconstruct regim ensembl reconstruct oe rec label ratio snr log err shown top respect residu oe err shown bottom error amplifi regim gener properti ensembl evid shown fig ensembl gener genuin inform face space relat artifact larg statist section convinc evid ensembl pca coeffici adequ observ open question reconstruct regim ensembl exampl face evid fig eigenfac mode stronger mode fig move mode fig move slightli refer phenomenon mode featur develop facial inform pixel regim genuin inform extend reinforc curv fig constant regim regim ensembl correl regim spectra larger ensembl probe deeper structur face space achiev snr term reconstruct lower entrop cost mirror symmetr section larg statist paramount qualiti result pca explor priori knowledg global symmetri ratio signal residu signal residu figur log spectra ensembl log tr ratio signal power oe total signal tr shown solid residu signal power truncat total signal log tr tr dash signal power residu signal dot line horizont line pixel quantiz level power exponenti residu constant power power law spectrum figur eigenfac ensembl rest prove construct ensembl includ mirror total statist small statist comparison reconstruct qualiti symmetr ensembl shown fig mirror version oe probabl context asymmetr direct ensembl result limit statist probabl context symmetr ensembl fall asymmetr evid fig symmetr reconstruct higher snr lower entrop cost typic probe oe priori reason chose mirror consid context result ident larg statist mirror crucial ensembl poor richer ensembl regim fast entrop snr ensembl fig transform moder growth symmetr evid fig plateau regim extend snr reliabl entrop cheap probe deep structur face space eigenfac effect mirror symmetr eigenfac larg ensembl fig show eigenfac symmetr ensembl strike effect mode necessarili odd symmetr forc lead princip compon intuit understand incarn typic exampl priori reason notabl liber asymmetr figur eigenfac symmetr ensembl entropi compon snr reconstruct figur gener analysi reconstruct ensembl ensembl rel entrop ja ratio fig shown function reconstruct fig illustr depend curv mark open point fn mod ensembl composit special normal scale entropi slightli safe compar shape absolut full depend ensembl shown fig curv ensembl obscur tendenc mix symmetr similar eigenvalu refer phenomenon mode mix face content pronounc clean regim evid extend plateau regim fig extend regim spectrum entropi compon snr reconstruct ensembl mirror figur gener analysi reconstruct ensembl mirror imag symmetr depend fig plot ensembl mirror imag symmetr exampl particip entropi compar directli discuss pca basi face space serv execut facial imag probabl studi success regim structur face space function begin global facial featur featur featur rippl pixel end fig regim evid power exponenti decai fig correspond rapid qualiti entrop energi entropi facial imag fig ensembl mirror symmetr ensembl mirror symmetr figur gener analysi fig reconstruct ensembl mirror imag symmetr shown full part show snr adequ perceptu reconstruct face fig requir mode regim spectrum fig estim face space studi statist reliabl estim requir found tight crop statist stationari show global mirror symmetr rich ensembl method choic enforc correct subspac affili make typic variabl easili evid intuit effect enrich symmetr retriev clear inform probabl face space phenomena dealt natur context pca mode mix fact facial compon similar cumul linear combin eigenfac resolut ambigu base context independ compon analysi top explicit flexibl provid local featur analysi refer kriegman eigenfac class specif linear project ieee transact pattern analysi machin juli blind identif independ compon statist proc workshop page chellappa discrimin analysi recognit human face imag journal optic societi america aug sirovich transform incomplet data journal optic societi america neural network bia varianc dilemma neural princip compon analysi york berlin heidelberg karhunen zur ann acad sci kirbi sirovich applic ev procedur human face ieee transact pattern analysi machin januari loev probabl theori van moghaddam pentland probabilist visual learn object ieee tran pattern analysi machin juli pentland probabilist match face recognit ieee intl conf automat face gestur page ieee bartlett classifi face race sex memori train recognit hammond proc thirteenth annual conf cognit scienc page local featur statist theori inform transmiss phd local featur gener statist theori object comput neural starner modular eigenspac face recognit ieee confer comput vision pattern page ieee der feret recognit algorithm develop test report technic report armi research sirovich dynam coher structur appl sirovich kirbi procedur human face journal optic societi america swet weng discrimin imag retriev ieee tran pattern analysi machin august turk pentland eigenfac recognit journal cognit
ML/1572 6 hierarch reinforc learn depart comput scienc michigan state east mi sridhar mahadevan depart comput scienc michigan state east mi abstract kei challeng reinforc learn scale larg partial observ domain show hierarchi behavior creat select variabl length memori task higher level agent abstract detail back variabl number time formal idea framework solv partial sequenti task call hierarch memori qlearn method rapidli propag delai reward long sequenc show framework outperform relat reinforc learn techniqu realist corridor navig task introduct reinforc learn encompass class machin learn problem agent learn experi interact environ fundament challeng face reinforc learn agent problem state space long delai reward receiv previou work address problem break larg problem hierarchi subtask abstract behavior approach includ decomposit learn real robot learn polici task set decomposit task subtask level hierarchi subset state space relev activ dicult issu frequent environ problem perceptu di erent world state gener observ strategi deal perceptu add memori past percept memori consist linear sequenc primit action shown strategi memori uniform resolut primit action scale poorli task long sequenc level primit level navig level corner dead end figur hierarch memori structur navig task abstract observ occur intersect lower observ occur corridor gure illustr make level hierarchi current point shown star point examin past experi state similar histori abstract state space improv scale complet observ larg partial observ environ similar bene result space past experi variabl resolut hierarch strategi rapidli bring bear past experi consid task navig long corridor environ made continu onward intersect navig intersect depend percept intersect sequenc percept corridor issu memori variabl granular show past experi resolut speed learn greatli improv perform perceptu result call hierarch memori gener techniqu solv perceptu task hierarch memori emploi memori abstract involv run hierarchi appli memori inform level abstract import ect agent point step back time ignor exact sequenc observ action figur illustr method descript abstract level choic point potenti futur examin histori level set past choic point execut incom histori close match current point call set instanc highest averag discount sum reward vote set explor strategi event counter current choic point level execut result reward durat abstract action number primit environ transit execut abstract note environ transit state state reward discount accumul reward updat discount updat current point updat analog instanc vote durat valu record instanc learn max implement hierarchi principl hierarch reinforc learn method hierarchi abstract machin framework parr russel abstract machin execut partial polici return control caller termin ham learn rule modi ed rule shown converg optim polici restrict space polici consist ham decomposit requir techniqu memori varieti altern implement nearest sequenc memori algorithm mccallum record raw experi linear chain agent evalu outcom neighbor experi chain evalu close state match length sux chain state chain grown ind experi replac chain reach maximum length navig task test navig task simul corridor environ figur task robot center junction robot receiv reward goal intersect small neg reward primit step agent equip sonar infrar environ present signi perceptu ambigu robot nding sensor identifi unambigu identifi locat robot environ sensor read agent goal make task dicult activ execut concurr level navig problem level root task navig goal lower level task physic avoid maintain align figur corridor environ nomad robot simul goal junction robot shown middl robot equip infrar sonar sensor gure environ obstacl robot maneuv primari testb simul agent nomad robot simul simul robot equip bumper sonar infrar arrang radial dynam simul nomad simul realist repres noisi sensor input actuat note size robot rel environ figur implement learn agent compar learn basic ham agent memori abstract memori multipl level agent design behavior hierarchi order build set behavior hallwai hierarchi top abstract level basic choic state hallwai navig direct figur nomin direct agent make agent learn abstract machin reach intersect top level machin control regain control intersect level hierarchi machin hallwai behavior shown figur machin level execut reactiv strategi corridor level hierarchi implement strategi primit action follow wall obstacl avoid ob obstacl intersect start stop intersect maintain head avoid ob follow wall stop intersect stop intersect forward left backward goal forward forward figur hierarch structur behavior hallwai navig figur show abstract level navig environ figur show implement machin machin figur figur machin choic point wall strategi train exploit power hierarch framework design ham agent ham agent behavior hierarchi singl choic top agent learn coordin choic tabl tabl index current percept chosen action abstract ham agent discount learn rate explor simpl strategi design agent rst agent memori abstract level behavior hierarchi ham make abstract extract updat method section agent histori length discount learn rate explor simpl strategi perform agent studi control complex memori agent agent memori abstract navig level intermedi level behavior decomposit abstract navig level previou agent agent memori abstract level learn strategi navig corridor behavior turn machin make base memori machin level memori learn coordin strategi behavior corridor version machin shown figur machin memori maintain maximum chain length explor simpl strategi case design flat agent compar agent agent design solv task agent track perceptu perceptu inform ham identifi addit perceptu data align wall avoid angl wall group agent primit learn make simultan learn align wall avoid obstacl agent histori length discount learn rate explor simpl strategi result figur learn perform agent navig task graph show perform advantag agent agent agent expect agent carri perceptu data perform high behavior point view result long string uninform corridor state inform intersect state agent longer discov pattern learn navig successfulli goal hierarch agent outperform ham agent ham agent navig agent abstract perceptu corridor state unabl distinguish intersect abil lead dead ham agent perform agent outperform agent agent tune strategi characterist clutter hallwai memori intermedi level number step memori memori memori flat number step memori memori memori flat figur learn perform navig task curv averag ve trial agent trial agent reach goal futur work paper framework solv larg perceptu task hierarch memori method approach kei advantag hierarch behavior structur agent abil conduct ecient initi explor environ wast time obstacl avoid time learn strategi direct ort solv navig task organ past experi hierarch scale problem long sequenc organ past experi linear chain primit observ action hierarch experi agent solv navig task observ wide separ long string experi corridor hard agent ectiv gener experi order learn goal present experi compar di erent learn show hierarch memori produc perform perceptu corridor navig task work paper extend direct nal version expect includ result sophist memori variant util sux memori kei limit current framework abstract level examin histori level extens permit interact memori stream level hierarchi navig task intersect depend observ corridor abstract level abil inspect experi greater detail depend context behavior expect pursuit gener techniqu manag past experi variabl granular lead strategi control gracefulli scale partial observ problem acknowledg research support part knowledg distribut intellig grant nation scienc foundat refer thoma dietterich maxq method hierarch reinforc learn autonom robot special issu learn autonom mahadevan connel automat program robot reinforc learn arti cial andrew mccallum reinforc learn select percept hidden state phd ron parr hierarch control learn markov process phd california singh learn tempor abstract action intern confer machin page
IR/1573 5 inform extract rule extend domain ontolog posit statement workshop ontolog learn michael marku van andrea abeck german research center artifici intellig knowledg manag group po box germani ontolog project project aim develop distribut organiz start observ knowledg heavili distribut organ accept fact imperfect state overcom ontolog structur inform natur situat introduct om system normal start focuss system maintain case collabor virtual team deeper integr inform system main goal project develop extens om middlewar built easi integr compon link collabor compon build framework om relax constraint origin idea central om set organiz ontolog technic provis highli dynam lai special emphasi method realiz scenario industri practic industri question smooth introduct technolog human factor organiz question model tool method support knowledg ontolog structur om part factor predomin essenti knowledg matter cost formal relat potenti benefit inform part scenario econom reason implic method build formal model afford fact ontolog compon built remain live element commun system repres knowledg continu chang world assumpt lead characterist learn ontolog inform text document main compon scenario set goal sketch method orient knowledg model realiz amalgam commonkad suit method build knowledg acquisit model tool extend modul visual work integr commerci text analysi workbench emploi statist document featur extract document analysi function order cope complex dynam usag scenario ontolog distribut develop methodolog framework understand organ oblig actor constitut ontolog societi om system workshop discuss primarili approach extend learn techniqu ilp logic program algorithm elabor document model cope sourc sophist background knowledg ontolog learn inform extract rule figur illustr idea build ontolog learn inform extract rule start seed ontolog reason qualiti relev type relationship ontolog concept domain initi set document repres substanti part knowledg repres formal seed ontolog figur approach ontolog learn inform extract rule assum similar ontolog fact relationship hold concept concept express text similar wai medic domain fact treat relationship cure instanc relationship headach cure medic headach address cancer treat cancer treat surgeri main idea text explain ontolog text suffici similar respect question similar factual statement textual pair textual posit exampl specif ontolog statement reflect text possibl extract base seed system signatur relat link search occurr instanc concept class maximum posit exampl relationship approach seed document domain specif textbook user seed document marker manual highlight interest passag instanc relationship approach faster learn result emploi approach successfulli industri inform extract project emploi pattern learn algorithm automat construct inform extract rule abstract specif creat gener statement text pattern evid ontolog relationship inform extract rule order detect instanc cure search instanc concept synonym word distanc search word distanc directli instanc concept cure order learn inform extract suffici detail document includ word usual learn suffici power formal extract pattern learn algorithm direct access background knowledg seed ontolog statement concept wordnet lexic knowledg link word synonym give access superclass synonym present rule learner specif adapt task text classif solv method inform extract task ontolog learn fulfil requir rule learner reli document order word preserv learn text pattern test order distanc specif word shown implement concept map standard ilp show express power respect pattern extend full lp formal includ rule elabor bit integr background knowledg wordnet appli learn inform extract rule text document discov formal instanc relationship applic domain statu algorithm implement test requir prerequisit contact applic project nuclear chemic order test data critic factor success approach question typic textual specif statement seed document compar ontolog learn approach note techniqu restrict learn taxonom arbitrari relationship applic domain expect contrast statist orient tend result candid result possibl relev word approach input assum found relationship candid correct higher probabl refer project van framework distribut organ mileston requir analysi system architectur dfki document prepar partial german technolog organiz memori ieee intellig proactiv deliveri project intern journal inform system buckingham balanc formal requir knowledg manag technolog aaai spring symposium artifici intellig knowledg stanford palo ca aaai press de van de knowledg engin commonkad methodolog mit press inform integr concurr engin method report ma knowledg model millennium design evolut stanford medic lab product descript insid inform manag kaiserslautern german van servic distribut inform infrastructur submit thirteenth intern confer softwar engin knowledg june air induct logic techniqu applic elli horwood project descript lernen von für die dissert fachbereich informatik universität kaiserslautern german learn complex pattern document categor workshop learn text categor usa exploit thesauru knowledg rule induct text classif recent advanc pp learn text categor inform extract ilp learn languag lnc
AI/1574 2 champion team manuela michael peter stone comput scienc depart carnegi mellon pa decemb abstract robot soccer present larg spectrum challeng research opportun present main research technic contribut champion small robot team team multiag robot system global distribut cognit action describ main featur hardwar design physic includ differenti robust mechan kick devic introduc robot motion algorithm reactiv gener motion control account target desir robot obstacl avoid robot exhibit success motion highli dynam robot soccer environ strateg present behavior robot agent team collabor remark achiev algorithm team agent anticip collabor opportun robot posit strateg open posit pass opportun articl termin summari result game small robot team score total goal suffer goal game plai mobil reactiv motion multipl collabor compet agent research sponsor part advanc research project agenc air forc research laboratori agreement number part depart offic naval research contract number view document author interpret necessarili repres offici polici express air depart offic naval research unit state govern introduct robot team autonom architectur physic robot global vision process camera plai client mind robot player fig sketch build block architectur transmit interfac client modul client modul client modul client modul client modul raw vision data action code action code object posit figur cmunit architectur global percept distribut reaction complet system fulli autonom consist challeng process cycl global vision algorithm perceiv dynam environ process give posit robot ball inform control distribut agent algorithm agent evalu world state strateg knowledg make action motion command control radio frequenc commun command broadcast directli individu agent robot identif binari code onboard detect command intend robot motion perfectli execut due inher mechan inaccuraci unforeseen agent effect action uncertain physic robot size fig show robot differenti drive mechan robot motor integr gear box wheel differenti drive chosen due simplic due size constraint size robot conform robocup competit rule emploi differenti drive mechan mean robot make robot control problem challeng fit vision system robot small interest quickli move strateg multiag team global vision system fact percept achiev video camera overlook complet field offer opportun global view world state setup simplifi share inform multipl present challeng reliabl process movement multipl mobil robot robot oppon team articl present main technic contribut small robot team problem motion control robot strategi vision process figur robot team system team section present motion plan approach robot includ path plan intercept move target obstacl avoid section introduc individu team behavior robot introduc concept anticip robot effect receiv pass teammat section summar result game section draw motion control goal low level motion control fast remain accur reliabl challeng due lack feedback forc control visual feedback motion control algorithm robust address stationari move target integr obstacl avoid algorithm make effect predict ball trajectori provid filter achiev motion control function reactiv control mechan direct differenti drive robot target configur base motion control includ number major improv target configur motion planner extend target configur cartesian direct robot requir face arriv target posit obstacl avoid integr control target configur function time control reason intercept trajectori move target differenti drive control posit direct basic control rule improv rule set reactiv equat deriv left wheel order reach target oe sin direct target point oe robot desir speed fig aspect equat deserv explan sin restrict valu interv bound magnitud comput wheel veloc equat necessarili drive robot possibl drive robot backward target figur paramet reach target configur target orient adjust reach target configur form oe extend equat target configur form oe goal robot reach target point face direct oe achiev min tan target ff differ angl target point oe distanc target clearanc paramet fig robot distanc target point circl line target oe target substitut equat deriv wheel veloc addit motion control comput desir wheel return estim time reach target oe estim crucial compon robot strategi lowlevel ball section oe comput simpl linear function oe ff ff angl measur respect fix coordin system weight set simpl empir measur robot translat robot rotat ff speed robot circl interest note crude time estim build complex discuss articl obstacl avoid obstacl avoid integr motion control adjust target direct robot base obstacl path adjust fig figur adjust avoid obstacl target direct pass close direct adjust run tangent preset clearanc obstacl motion control mechan run obstacl analysi constantli replan path continu replan robot handl highli dynam environ immedi advantag short live opportun move target real challeng robot soccer control robot intercept move ball capabl essenti ball pass behavior robot successfulli intercept move ball goal score capabl intercept capabl achiev extens control algorithm aim stationari target fig illustr control path reach stationari target specif control mechan extens target configur function correspond oe point comput target control rule stationari point find wheel veloc estim time reach hypothet target stationari time estim reach target inform reach allot time goal find nearest point futur target reach find stationari control rule reach addit scale robot speed cross target point easili comput reason approxim discret time small find smallest discret time point satisfi estim constraint shown fig goal hit move ball figur control stationari target control move target target configur function time comput ball predict trajectori control algorithm stationari point find path time estim discret point target point select strategi main focu research develop algorithm collabor agent team member capabl individu autonom contribut team goal introduc flexibl team architectur agent organ format unit agent plai role unit format build team architectur defin set role agent introduc improv architectur address highli dynam environ attack format involv singl goalkeep attack goalkeep ideal goali behavior reach expect entri point ball goal ball reach assum predict ball trajectori correct robot uniform state ideal goali predict veloc goali ball distanc goali ball predict entri dg vg ffl small posit account goali reach entri point slightli ball ball easili veloc movement robot uniform uncertain switch behavior goali base threshold ball estim trajectori ball estim speed higher preset goali move directli ball predict entri goal point goali select posit minim largest portion goal area find locat bisect angl ball goal post illustr fig figur goalkeep posit minim goal area predict ball veloc goali behavior shown effect game defend penalti due accuraci predict ball trajectori robot push ball defend team defend experi made understand defend behavior stop oppon score endang goal goal defend role goal result uncertain ball handl robot robot easili push ball unexpectedli wrong direct perform difficult maneuv achiev implement behavior defend illustr fig similar goalkeep behavior defend posit goal line illustr fig push ball defend area find largest angular direct free obstacl robot push ball illustr fig similar goalkeep behavior robot posit ball oppon nearest effort oppon reach ball select behavior import effect defend clear ball close goal bounc block clear annoi figur defend behavior dark light robot repres defend oppon back lead score goal tree fig select action perform base current state attribut ball safe binari ball test ball oppon defend safe clear test open area larger preset angl threshold ball ball closer goal defend robot annoi attack robot annoi behavior select oppon robot annoi oppon robot attack current annoi behavior annoi plan improv behavior safe clear clear annoi block ball figur tree heurist defend select behavior ball defend clear depend safe clear clear shown coupl goal score directli clear action defend attack activ teammat anticip attack involv opportun innov develop techniqu find exploit opportun agent assign specif task solv moment view agent activ agent team member passiv wait achiev task assist activ simplist distinct activ passiv agent captur teamwork realiz agent ball view activ teammat passiv significantli extend simplist view theoret algorithm select activ techniqu passiv agent anticip futur collabor passiv agent activ anticip opportun collabor collabor built robust individu behavior individu behavior develop individu behavior pass shoot pass shoot handl effect motion control target configur ball estim target direct goal teammat robust accur individu behavior handl obstacl intercept move ball theoret action select individu select activ agent behavior theoret analysi singl step agent amount choic action involv shoot pass agent agent shoot estim probabl success pass shot comput time estim complet provid motion control action pr pass pr shoot time action largest determin activ agent behavior tabl illustr valu select import note action select occur iter approxim time probabl estim valu continu recomput quick action shoot opportun collabor agent dynam posit clear action activ unclear passiv agent team multiag system robot success goal probabl success attack action pass shoot shoot pass shoot pass tabl action choic comput valu base probabl success estim time action select achiev depend introduc concept team agent team architectur passiv agent flexibl vari posit role function posit ball goal anticip find ball futur anticip individu goal achiev introduc notion individu anticip passiv team member posit strateg optim chanc teammat successfulli collabor pass posit agent attack addit posit anticip futur contribut team strateg posit account posit robot oppon goal posit found solut function attract point introduc ffl number agent ffl current posit ffl current posit ffl current posit activ teammat ffl posit oppon ffl desir posit passiv agent anticip pass defin formal algorithm strateg call spar strateg posit attract extend similar approach potenti field highli domain probabl collabor directli relat posit success pass spar maxim robot minim attract ball ffl oppon maxim distanc ffl teammat maxim distanc passiv max ffl attract min ffl attract oppon min function solv optim restat function function approach appli simul team term function relev stai close goal import stai function term weight term wo wb wg weight weight hand tune creat proper balanc weight max wo wb wg optim problem solv set ffl block direct shot activ teammat ffl stand difficult posit receiv pass activ teammat solut optim problem constraint target locat agent fig illustr set constraint fig show combin constraint result posit anticip passiv teammat posit effect attack robot effect dynam adapt posit robot spar anticip algorithm creat number opportun pass led goal score chanc approach repres major step team multiag system term incorpor anticip kei aspect teamwork result successfulli defend titl small robot champion pari competit involv team countri consist preliminari round advanc team plai won sweep score total goal score suffer individu result game tabl dont block goal shot avoid difficult anticip optim collabor posit collabor figur constraint dynam anticip algorithm repres shade show oppon current posit illustr posit passiv agent dark squar return spar phase oppon affili score ix ix japan portug franc cambridg uk final australia tabl score game game mark half time number technic problem preliminari includ radio commun problem worst game robot respond command spin circl led half time clear loss good team end place commun problem isol dealt prior round game competit strength team strong lot traffic front goal team obstacl avoid manag find path creat score chanc defend final game close good oppon intercept test includ block power shot deflect back goal final game demonstr dynam final involv pass strateg posit teammat success due technic includ robust hardwar effect vision reliabl base robot motion obstacl dynam team approach team demonstr occas collabor capabl result robot behavior introduc concept passiv robot strateg posit attract maxim chanc success pass team repres integr effort combin solid research approach hardwar vision individu team robot behavior acknowledg member team contribut success han design build robot han develop vision system refer minoru hosoda behavior acquisit real robot reinforc learn machin latomb robot motion plan kluwer academ michael alan rod stewart control robot testb ieee intern confer page randi bill carl ann wright dynam object captur fast vision track ai spring peter stone manuela veloso simul team hiroaki robot soccer world cup springer peter manuela patrick rilei champion simul team minoru asada hiroaki robot soccer world cup ii springer manuela peter han world champion team ai manuela peter team hiroaki robot soccer world cup page springer
Agents/1575 1 learn network design asynchron team lar patricia avila engin design research center carnegi mellon pittsburgh pa power system technolog rede de sa spain abstract asynchron team network agent memori result design effect solv difficult comput problem main design issu structur network complement resolv intuit experi paper describ procedur good structur learn experi procedur base regular express encod capabl network introduct asynchron team problem solv architectur consist collect agent memori connect strongli cyclic direct network memori form node agent form arc figur show network memori hold popul trial solut solut necessarili solut problem solv memori dedic subproblem relax agent copi solut input modifi write result output memori agent autonom decid work solut work agent cooper work result agent divid construct agent produc destruct agent exist solut output memori construct agent consist transform solut solut type decid agent run decemb memori memori memori memori memori memori fig consist memori agent decid solut oper work destruct agent oper miss skill destruct agent li abil solut output memori solv hard problem lot improv heurist singl heurist perform satisfactorili case good result achiev combin heurist improv heurist turn agent ad schedul selector develop number difficult includ set nonlinear equat travel salesman problem build design reconfigur robot design diagnosi fault electr network control electr network protein structur analysi schedul constraint satisfact builder design topolog network problem trial hand paper explor techniqu automat learn good network design techniqu reli method measur agent cooper present section give present extend version method section develop concept regular express probabl calcul effect network topolog show result section obtain good network topolog section conclud paper comput result measur agent cooper section present parametr model agent cooper show maximum likelihood estim estim paramet model real model definit memori space solut store memori subset accept final solut find solut happi subset ffl ffl solut exist agent turn solut accept final solut posit probabl ffl solut earlier exist agent turn solut solut sn posit probabl solut sn word solut finit sequenc agent posit probabl turn solut accept final solut solut sn distanc goal comput class sn solut belong underli optim problem solv attack kind greedi heurist paper concern difficult realist scenario distinguish accept final solut solut oracl answer solut accept final solut solut qualiti work produc solut probabl depend solut solut closer distanc goal solut thing simpl assum sn step goal sn automat hold agent definit appli agent solut tripl probabl probabl step closer goal probabl solut step goal probabl solut distanc goal model agent cooper definit pair agent matrix model agent chang solut modifi run agent run agent solut agent gener solut solut run agent solut simpl complet parametr model describ work definit agent randomli chosen solut definit probabl random start solut model wai agent cooper captur model situat run agent good pair agent run model framework estim model paramet assum lot inform form histor run number sequenc sequenc termin sequenc agent appli random start solut accept final solut found system stop report maximum number agent appli accept solut found sequenc termin vector denot specif paramet model comput probabl reach goal manner histor sequenc sequenc termin seek probabl goal reach appli sequenc agent sequenc length termin seek probabl agent appli goal agent appli goal reach higher probabl histor histor sequenc explain paramet valu explain histor set paramet correct set paramet describ work function comput probabl exact observ function paramet valu call likelihood function statist likelihood function case write written program pretti good job maxim set paramet valu maxim likelihood function maximum likelihood estim unknown paramet scope mild condit agent sequenc observ chosen maximum likelihood estim converg necessarili correct underli paramet set valu predict perfectli behavior model design good network topolog task design good network topolog consist major subtask import subtask decid good decomposit problem relat relax problem task applic specif hard formal section focu aspect good topolog type memori relat agent read write type memori network agent memori topolog low overhead select fundament observ network topolog network topolog sequenc agent appli initi seed solut topolog fig sequenc cs topolog fig sequenc consist cs solut seed left memori decemb memori memori memori memori memori memori fig sequenc decemb memori memori memori memori memori memori fig sequenc consist number number cs appli solut start left memori individu selector agent restrict sequenc bad sequenc cheapli avoid network structur make imposs singl memori memori hold sum type individu solut memori hold solut type selector agent select solut memori fit requir input type mention multipl memori make select problem agent easier topolog effect examin effect topolog fix select schedul strategi agent agent random select agent schedul constant frequenc memori copi agent work memori schedul frequenc result assumpt solut perspect probabl agent work solut constant ff depend rel frequenc agent hook memori solut estim paramet model section comput expect wait time earliest creation accept final solut demonstr topolog comput expect total discount drift fl fl discount random variabl measur drift iter larger expect discount topolog chosen agent wai discount factor mathemat trick make sum compar system constant drift agent applic discount factor drift prefer make prefer drift import object find final accept solut fast sooner drift sooner accept final solut found regular express finit state automaton calcul expect discount drift goal track set sequenc agent gener string expect concept regular regular express finit state automaton borrow comput scienc instanc definit alphabet finit set symbol fa ang element alphabet call symbol charact sentenc word finit sequenc letter languag set string concaten string written xy sequenc letter form write letter form letter form concaten ward concaten languag lm string string mg languag ln concaten time languag consist empti string union languag fx string string mg languag consist string made concaten finit string posit defin regular express regular languag definit definit regular express alphabet express form construct rule express regular languag definit languag construct rule special symbol ffl regular express denot languag consist empti string letter regular express denot languag consist singl string regular express denot languag regular express denot languag regular express denot concaten regular express denot avoid write defin oper hierarchi defin highest concaten final union oper parenthesi omit regular languag denot definit nondeterminist finit state automaton finit set call state finit set call alphabet ffi relat ffi ae call transit special call initi state ae subset state call accept state machin read string letter alphabet time machin finit state machin start special initi state time letter read machin transit state set state depend current state symbol read current state symbol read state ffi automaton call nondeterminist definit accept string exist state ffi accept string machin accept state read string set string accept call languag accept result comput scienc instanc theorem languag accept regular regular languag exist repres network regular express theorem import network memori agent term regular express calcul total expect discount drift goal directli network memori agent translat network regular calcul total expect drift goal base sequenc agent produc regular express theorem network memori agent form proof network memori fm mn distinct agent type fa defin relat ffi ae fm fa fm mn network arc agent type read memori write memori fm mn fa accept sequenc agent appli solut seed memori machin accept string machin gener string set string gener set string machin accept machin gener random string nondeterminist start set current state special initi state current state stop pick random transit delta coordin anew write anew set goto includ schedul frequenc problem standard standard regular express includ inform probabl string agent gener repres string gener includ inform probabl ff agent work solut memori case easili defin probabl definit nondeterminist finit state automaton probabl ffi ffi ae ffi mean transit consist write move probabl appli machin state similarli add probabl regular express ordinari regular express definit definit regular express probabl alphabet express form construct rule express regular languag probabl string languag special symbol ffl rep denot languag consist empti string ffl probabl letter rep denot languag consist singl string probabl rep denot rep denot languag string probabl string probabl string probabl rep denot concaten probabl string sum pair string rep denot languag probabl sum set string probabl occur flip skew coin probabl head tail tail immedi wise goto ii gener random string string probabl iii goto mean effect geometr distribut number string concaten formula sum wai string gener problem convert rep vice versa complic simpl process convert back regular express ordinari proof theorem rep exist exist rep set string gener set string gener rep theorem probabl gener string demonstr calcul expect total drift goal rep base agent interact matric model calcul total expect discount drift goal rep notat fl discount factor denot probabl solut gener agent step closer step goal distanc compar solut agent read shorthand entir vector pn system agent matrix describ run agent big matrix describ run agent agent block defin definit total expect discount drift goal run random sequenc agent languag defin rep start solut vector note definit valid vector give complet algorithm comput note simpl properti calcul simpl expect drift goal appli agent solut relev coordin agent note linear real number fl expect total discount drift goal appli ing agent solut agent pm rewrit hand side notat includ discount factor fl defin agent case pq formula nice gener pair rep theorem pair rep exist matrix depend pq proof give construct proof show comput possibl ffl case empti sequenc sequenc chang random sequenc note ident matrix block diagon fact case defin block diagon form ff case sequenc agent run sequenc probabl ff sequenc probabl ff matric describ chang run random sequenc block diagon form case run random sequenc agent chang pq random sequenc agent run chang pq note matric block product form rememb denot rep string consist random sequenc probabl fact linear coordin infinit sum depend ff comput invert note easi block diagon note case block diagon block diagon matrix basic form block wai comput subexpress maintain properti block diagon rep show comput rep formula ffl agent run relev coordin agent pq run random sequenc start state state system pq definit ff sequenc agent chosen probabl ff complic comput run sequenc agent chang order summat ff ff ff ff ff substitut easi calcul block diagon make easi invert appli method appli method hook agent read write memori collect observ run instanc problem solv observ gather estim paramet agent cooper model estim discount drift rep calcul step free tediou time consum task experi network topolog rep high drift translat rep hook agent network travel salesman heurist solv simpl randomli swap citi tour regard chang tour length combin knowledg work feel gener strategi random swap lift lk local minima main improv tour length lk power method present paper uncov optim network inform sequenc agent fast goal reach collect data run random sequenc agent citi instanc tsp termin tour length percent optimum found termin tour found agent applic observ estim paramet cooper maximum likelihood agent agent random citi swap line probabl random initi solut sn line appli initi solut notic estim expect lk make progress appli initi expect random citi swap leav solut distanc appli initi solut state lk leav solut distanc goal probabl citi swap move solut step goal paramet estim offset paramet state solut start closer goal agent agent run agent citi swap run agent yield local optimum respect lk captur estim move probabl mass final lk run agent lk compar found manual inspect citi swap lk run lk pretti high probabl simpli undo find local minimum earlier agent appli tour suffici lk find local minimum run term estim lk run agent comput vector initi agent rep case discount factor fl ff rep implement singl memori agent read write iter agent run probabl ff agent probabl ff optim drift found occur ff equal total discount drift case rep repres repeatedli run lk random number swap requir memori implement lk read memori write copi swap agent read write copi swap agent read memori write optim drift found occur ff correspond run averag applic swap agent pair lk applic total discount drift drift slightli achiev singl memori requir memori implement lk read write copi swap agent read write copi read write yield discount drift goal clear superior topolog fact optim sequenc agent appli random sequenc appli futur work obviou step search strategi automat search space rep optim rep good feel structur space rep incorpor run time requir agent model approach discount factor agent agent longer run smaller discount factor agent run quickli refer de genet algorithm asynchron team fourth intern confer genet algorithm morgan lo asynchron procedur parallel process ieee tran vol nov de asynchron organ problem ph dept electr comput carnegi mellon asynchron design architectur behavior ph depart carnegi mellon synergi cooper design manipul task specif phd dept electr comput carnegi mellon bayesian net power system fault diagnosi phd electr comput engin carnegi mellon parallel global optim algorithm applic problem power industri comput applic sadeh team asynchron agent workshop schedul autom probabilist method assign backbon protein solv train schedul problem phd electr comput engin solv constraint satisfact problem de cooper scheme autonom agent review improv cooper autonom agent asynchron team submit journal comput mathemat organiz theori principl compil design addison weslei
DB/1576 3 relat transduc electron commerc serg abiteboul victor vianu uc san diego brad oracl corpor yesha abstract electron commerc emerg major applic requir support introduc studi declar specif busi approach spirit activ busi model relat transduc map sequenc input relat sequenc output relat semant trace exchang sequenc log relat problem motiv electron commerc log verifi tempor properti compar relat transduc posit result obtain restrict class relat transduc call transduc output cumul argu captur wide rang practic busi model introduct electron commerc emerg major applic electron commerc support busi transact multipl parti network activ includ electron design busi model electron commerc requir involv handl larg amount data product yellow provid concurr distribut recoveri argu approach provid backbon wide rang electron commerc applic support provid specif semant electron work perform part abiteboul visit stanford visit inria abiteboul support part vianu support part nation scienc foundat grant number yesha support part ibm center advanc canada commerc form declar specif busi model busi model protocol exchang partner semant primarili behavior specif strong dynam reminisc activ transact workflow electron commerc context specif focu present paper busi model formal state applic relat interact world captur sequenc input relat applic respond sequenc output relat model view machin translat input sequenc relat output sequenc relat call machin relat transduc transduc languag relat transduc state transit function output function program languag electron commerc context import specif busi model easi particip exchang understand busi busi model subject busi model specif carri contractu valu declar specif busi model desir motiv focu simpl specif relat transduc semant relat transduc map induc input sequenc output sequenc import motiv electron commerc applic input output semant repres syntact sugar render interfac payment deliveri product consid inquiri price remind pend bill captur distinct notion restrict sequenc design relat circumst semant relat transduc rel log problem studi relat design verif busi model relat transduc class problem relat individu includ ffl log test log sequenc gener input sequenc problem instanc effici relat transduc supplier run custom site trace provid log supplier valid transact carri custom ffl goal busi model gear achiev deliv product condit goal reachabl check set goal reach run transduc ffl tempor verif desir tempor properti busi product deliv payment problem involv relat transduc import test valid log transduc valid main motiv question custom busi model current electron busi model tend user unnecessari constraint limit desir user custom basic busi model conveni conform regul verifi busi model conform origin valid log custom model remain valid origin model weaker criterion compat busi partner procedur conduct codifi respect busi model model contradictori custom requir deliveri supplier requir payment deliveri compat verifi exist run achiev desir goal satisfi busi model problem undecid unrestrict relat transduc state output function defin main object paper restrict class transduc satisfi declar rich wide rang practic busi question effect answer restrict call cumul state transduc state simpli accumul input receiv output defin current set datalog rule argu simpl model captur practic set busi model prove enforc class tempor properti run show question decid transduc complex nexptim np number variabl note complex line classic problem conjunct queri question involv static analysi transduc show undecid remov restrict transduc result suggest transduc achiev appeal balanc express tractabl relat work work motiv electron commerc framework relat relat transduc view activ trigger question logic background relat calculu static aspect tempor logic tempor aspect deal interact work view gener context algebra calculi concurr relat busi model petri net notion transduc base log spirit observ busi model relat workflow manag workflow typic involv perform distribut task approach context view interact relat store extern world question introduc model adopt exist practic reason build electron commerc applic relat simplic approach clear advantag busi model approach natur lead treatment queri optim parallel evalu techniqu develop electron commerc applic activ consid work motiv back idea present paper prototyp system spirit activ electron commerc applic base gurevich evolv algebra build top postgr applic implement product environ specif languag rich formal verif lead descript busi model easi understand user prime motiv present work organ section introduc busi model main problem address paper mean inform formal defin relat transduc section present model decid undecid result section relat transduc begin inform discuss formal defin relat transduc inform discuss simpl busi model custom order bill deliveri compani decid provid busi transduc short schema state rule output rule program specifi relat transduc consist schema specif log state transit program output program relat price moment custom interact system insert tupl input order pai system respond produc output relat deliv imagin presenc tupl relat actual action send email bill physic deliv product system track histori busi transact state state output relat state program output program set input fact transduc react execut simultan state program output program rule obviou fire parallel state rule semant state relat simpli input fact output cumul run transduc consist sequenc sequenc output gener transduc restrict sequenc relat log note run complet determin sequenc input input output sequenc run short shown figur price note compon schema consist log subset input output relat relat consid semant result action import carri legal valid run transduc defin relat log restrict sequenc run log relat simpli call log run transduc describ simpl busi model shortli realist gener arbitrarili complex state output advoc simpl program style suffici practic easi properti log assum log consist input output relat interest static verifi mention properti log check problem relat fraud detect conveni custom conduct busi supplier run local supplier busi model supplier provid log run detect supplier verifi log log supplier model supplier verifi exist sequenc input gener log problem trivial input log partial log make log smaller full point run transduc custom site reduc amount data exchang network minim log relat problem minim find minimum log suffici reconstruct log run easi previou remov relat deliv log lose inform easi reconstruct occurr run occurr price program shorter log verif goal reachabl progress goal reachabl goal achiev run possibl precondit short verifi achiev goal long hold gener problem complic notion progress relat question classic case custom lost intricaci busi model user interest achiev goal told action make system progress goal check tempor properti question slightli flavor verifi tempor properti satisfi run supplier verifi product deliv paid modal oper obviou amount verifi tempor modifi compar relat transduc short program captur basic semant simpl applic user friendli user order unavail warn output program recast short transduc friendli relat input sequenc output sequenc figur input output sequenc run short input sequenc output sequenc figur input output sequenc run friendli state rule output rule run program shown figur program friendli custom friendli short issu warn messag product payment incorrect item paid answer request remind pend bill easili verifi short friendli yield set valid log semant interchang custom custom short friendli violat origin model custom problem relat transduc rel log similar observ style note valid log accept criterion sound valid log custom transduc valid respect origin custom intern regul limit electron model disallow bui specif product supplier easi modifi friendli constraint result set valid log strictli set valid log short remain accept supplier conclud mention class import question address present paper concern interact transduc problem particip exchang busi model codifi relat transduc output transduc fed input possibl gener feedback loop question consist system transduc formal model assum familiar relat model relat schema sequenc finit sequenc finit instanc transduc schema express compon relat disjoint log schema transduc schema relat transduc schema tripl oe map instanc instanc state map oe call state function output function sequenc input instanc run state sequenc sn output sequenc log sequenc defin log empti denot output log sequenc run omit understood recal inform discuss role relat describ input user system db relat repres system larg state relat repres inform system rememb current run relat captur reaction log relat design semant input output log log partial note write program copi current input includ loss gener restrict log output relat note db merg state relat distinct import restrict class transduc consid restat term relat transduc question discuss inform relat transduc defin log valid sequenc ln input sequenc ln log input ln goal reachabl sentenc hold output run variat question goal reachabl partial run rm continu rn run satisfi output run transduc log relat log valid log valid log set valid jn jn transduc focu simpl class relat call appeal reason question discuss decid set languag remain power busi model practic interest defin show decid import properti involv singl transduc transduc explor transduc restrict valid input output sequenc definit transduc relat transduc restrict state relat simpli accumul output relat defin datalog program inequ stand output cumul schema transduc schema transduc relat transduc state ariti defin finit set rule form ffl posit liter ffl form state ffl variabl rule occur posit bodi rule semant program standard datalog program transduc short friendli turn transduc show simplic limit state transduc control capabl provid illustr transduc input output output proposit time call proposit transduc set output sequenc gener transduc denot view word finit alphabet output proposit transduc gener prefix word languag ab input relat state relat output relat state rule output rule note control input output prevent input produc languag gener proposit transduc regular languag accept finit automata cycl loop due inflationari natur state return previou state prefix closur ab prefix closur recal refer input remain unrestrict examin section mechan restrict express dramat verifi singl transduc return basic question transduc formul previou section show decid framework transduc show slight strengthen model lead undecid mention open question begin properti singl transduc goal properti note decid result shown reduct finit satisfi fo sentenc relat form xk ym prefix class denot fo similar notat prefix class fo obviou mean decid finit satisfi fo sentenc shown proven problem complet nexptim np fix number log valid question trivial log run transduc input sequenc verifi log obtain transduc partial theorem transduc fix instanc log decid number variabl input sequenc log valid exist input sequenc gener view instanc relat schema obtain replic time input relat yield problem reduc question satisfi fo sentenc relat schema state yield log state input relat record log valu output relat determin tupl belong input relat fo sentenc tupl input relat log requir fo sentenc output due restrict form rule defin output includ fact variabl rule occur written fo decid nexptim slightli care analysi show complex number variabl complex np fix number quantifi note similar result hold decid exist db log valid conclud section remark previou log valid remain output relat defin conjunct queri state relat view consist view defin conjunct queri problem simplifi transduc reachabl posit goal decid ptime restrict impact complex denot properti express oe oe np procedur consid investig transduc design question log valid decid restrict rule slightli relax log valid remain decid state defin posit rule free variabl bodi variabl state rule amount log valid undecid shown reduct implic problem function depend undecid set fd relat transduc state rule input store state relat project involv output violat violat store check output rule store project log consist iff log valid illustr construct binari relat case obtain input relat state relat state rule output rule goal reachabl busi model aim achiev deliv product minimum check make model achiev goal formal goal fl sentenc form posit neg liter output variabl occur posit liter relat transduc fl goal goal reachabl run fl satisfi output theorem transduc goal decid nexptim number variabl exist run output satisfi fl proof spirit theorem consist find bound length run consid bound equal number posit liter reduc problem satisfi fo sentenc schema consist copi input number variabl number quantifi yield np complex note limit output goal make simpl tempor statement involv entir histori input shown includ output relev part state current input check tempor statement type output explor formal tempor statement gener check tempor properti run suggest techniqu theorem verifi tempor properti run set tempor sentenc form boolean combin liter db state run satisfi sentenc sentenc verifi stage run current state relat note state atom form hold input make tempor statement involv past input statement output sentenc slight extens techniqu theorem theorem relat transduc sentenc decid nexptim number variabl run satisfi problem involv relationship transduc transduc relationship run transduc recal transduc transduc log log problem undecid shown theorem transduc undecid fix proof reduct implic problem function depend idea reminisc construct previou intric due absenc project state rule transduc set fd construct involv gener state arbitrari instanc project relev achiev input tupl project step run difficulti make input fact gener instanc observ run provid output relat violat fd verifi output rule project check build transduc tg check violat tg check violat iff tg special case practic interest problem decid transduc transduc construct augment addit input output view custom version friendli custom version custom accept long log run valid run turn decid theorem transduc input schema log schema full decid nexptim number variabl similarli previou proof involv show input sequenc consequ theorem transduc full log corollari transduc schema full decid nexptim number variabl fix mention theorem import verifi custom correct altern verif provid suffici syntact condit custom program preserv valid log natur possibl ad long log syntact unaffect input path input relat log depend graph friendli obtain short manner consid restrict input sequenc tempor restrict express state pattern input occur past reflect fact model output driven unrestrict input arriv order make applic distinguish valid invalid sequenc input make requir input mechan notion run control input sequenc basic transduc model enrich wai order accept sequenc transduc languag theori acceptor mention wai defin distinguish output relat error run valid output liter error defin distinguish output relat run valid output set sequenc liter defin distinguish output relat accept run valid iff finit output set accept mechan incompar transduc enforc natur restrict input turn restrict enforc enforc restrict input set run input enforc subtleti comparison affect log full set valid log input sequenc defin defin present focu run restrict practic interest enforc properti run suggest valid run tempor properti input sequenc make set conjunct sentenc form conjunct liter variabl occur posit liter disjunct posit liter variabl run satisfi sentenc iff sentenc satisfi transit current input exampl interest filter run sentenc cost valid input pai cancel amount paid item order correct price cancel order turn restrict enforc run transduc specif simplic show theorem formula exist transduc input sequenc run satisfi understand specif power run case output proposit simplifi transduc proposit output call transduc output sequenc view word finit alphabet output proposit languag gen consist word output finit run show theorem languag alphabet equal gen transduc iff languag languag gen prefix close languag accept ture machin idea build transduc error rule enforc sequenc input encod consecut configur comput input word encod intric due inflationari natur state relat accept state reach comput start output letter time output entir requir input sequenc short prefix output altern requir languag form verifi properti run natur question point verifi run transduc satisfi sentenc problem solv interest case error defin set rule negat state liter state undecid result theorem transduc sentenc run satisfi proof similar theorem reduct implic function depend theorem sentenc transduc neg state liter occur rule defin decid nexptim number variabl run satisfi proof techniqu similar previou decid reduc question satisfi fo sentenc schema fix observ run length bound number occurr oe state liter consid compar transduc run run turn full log theorem transduc undecid run run full log similar proof theorem decid obtain restrict similarli theorem theorem transduc schema full log neg state liter occur rule defin error decid nexptim number variabl run run relat transduc introduc formal captur busi model restrict transduc put forward candid model desir understand declar decid question abil captur wide rang busi model practic interest question remain unansw desir identifi reason restrict log valid ptime respect verifi log restrict condit altern exhibit set rule modifi relat transduc preserv valid log goal provid user facilit sound custom busi model argu transduc captur class busi model partli substanti claim result abil transduc valid sequenc input output interest implement busi model base framework valid approach problem address make approach practic import issu optim comput state advantag increment updat techniqu manag trigger activ relat transduc basic carri form trigger challeng remain issu interact relat transduc busi model particip complex exchang transduc combin output transduc input share state relat issu relat verif interact system busi includ detect resolv deadlock plan investig question futur work acknowledg al aho alberto mendelzon discuss topic refer abiteboul duschka complex answer queri materi http vianu foundat gurevich classic problem zum der logik math chandra vardi implic problem function depend undecid siam ea emerson tempor modal logic van handbook theoret comput page yesha evolv applic electron commerc intern engin applic symposium gurevich evolv algebra specif valid method oxford lewi complex result class quantif formula journal comput system milner calculu commun system volum milner oper algebra semant concurr process van handbook theoret comput page mitchel infer rule function depend proc acm symp principl page park concurr automata infinit sequenc theoret comput volum page semant express issu activ comput system ramsei problem formal logic proc london math petri net theoret comput volum stonebrak row design postgr proc acm sigmod symp manag page ullman beat datalog proc acm symp principl page widom ceri activ trigger rule advanc process san special issu workflow extend transact system data engin yesha adam electron overview adam electron commerc lectur note comput
DB/1577 3 graph structur view increment mainten zhuge hector comput scienc depart stanford ca usa abstract studi problem maintain materi view graph structur data base data consist record identifi record data repres tradit object class repres lower level data structur defin simpl view materi view graph structur analyz option repres record ident refer view develop increment mainten algorithm view introduct relat view control data content cach remot data manag task paper studi extend view concept mainten algorithm call graph structur collect object repres web lotu note semistructur repres graph data structur circuit design graph structur figur show graph structur figur graph structur node graph repres direct edg repres relationship object user graph work support advanc research develop commun manag project massiv digit data system program start object edg assum object graph object identifi field describ section view defin cach content queri filter set interrel web page assum page url page graph edg user interest web page word copi local disk faster access construct defin user defin materi view select object possibl copi origin object materi view increment mainten algorithm discuss section view date simpl type view object access queri parent restrict access children subset web page defin virtual view web page user identifi interest set web set start point futur queri virtual defin construct data model paper notion object class inherit figur object indistinguish system concern make model gener wide applic web applic requir class underli data store system system identifi class object ad special system field tag object link object object inherit object special system pointer instanc view machineri discuss paper cach control access underli data structur implement structur model notion view similar relat number challeng due richer natur model view collect includ edg figur view includ portion graph dot line edg offici part user access view link clear achiev user retriev content pointer view simpli object simpler track view modifi content longer pointer arbitrari materi object complic view mainten materi view question object identifi oid copi identifi origin materi copi pointer object copi materi choic materi problem increment maintain origin data modifi harder problem relat view modifi tupl view defin relat impact simpl chang ad link object dramat chang set object view clearer discuss view increment view mainten complex matter feasibl simpl view paper address challeng contribut ffl formal defin notion virtual materi view result view definit make defin view view queri view queri properti hold relat view make ffl present simpl languag defin mechan restrict access object view discuss implement issu relat queri materi view ffl present algorithm increment maintain simpl materi view algorithm input view definit sequenc updat base propag copi queri base data relat work work base previou work materi view mainten object technolog queri object orient semistructur data model rest subsect specif compar view relat view object view defin object class increment view mainten work relat view relat view major mention view schema constrain relat relat impact view refer relat relationship object preserv view view data pointer base access control defin increment view mainten algorithm repres graph data relat relat store simpli exist relat mainten algorithm discuss section directli relat algorithm graph data effect previou research object view object class view defin ad hide attribut base class class concept view defin queri express view defin ad hide attribut object class subset view defin path express view consid research virtual view work virtual materi view recent work materi object view multiview group michigan major differ approach defin view virtual system real method singl physic copi materi view store oid base view mainten algorithm worri duplic propag valu updat object perform advantag queri materi view reduc access object materi view access approach difficult adapt distribut environ materi view design paper abil duplic object pointer independ maintain relationship object duplic work relat paper view mainten method data model tree similar model queri languag unql defin algebra approach maintain view find comput delta view base data approach work view defin updat concaten replac disjoint graph view defin view extens oql design increment view mainten algorithm common delet updat oper view defin paper gener handl techniqu discuss data model section introduc object model oem model object type oid object uniqu identifi label string explain mean object uniqu object atom integ set type set object set oid object show collect object collect object object pair angl bracket show type field order indent visual aid show hierarch relationship object alto object root refer object set object children repres professor student secretari notic subobject professor structur differ professor object atom object refer label object refer os set object repres graph figur atom omit type infer set show oid label show outgo edg exampl arbitrari figur graph structur introduc notion data model object set oid object simpli group object object group semant frequent access physic locat site object object person notic special type simpli conceptu aid discuss view select data model studi import view manag issu model algorithm present easili gener model object multipl field repres model object object repres fix format record repres model repeat field object schema defin field record field salari record repres object graph structur data model valu label edg model map note model conceptu actual implement differ oid field store infer record locat disk repeat label valu compress wai object defin physic object simpli region disk defin terminolog paper path sequenc object label separ path denot set object reach path object oid ancestor descend label label direct label label figur node descend root reach node root path path express regular express path path express path path express path instanc path express wild card substitut path obtain path express defin union object instanc set oper object type set set object defin object defin object assum result object arbitrari uniqu oid label oper manipul object queri appli set object languag queri simpl repres languag studi view manag issu basic syntax select path exp path int queri answer format set oid evalu queri option system consid object path exp object system check satisfi condit path boolean function accept set atom return true object valu satisfi condit condit queri select return answer write user provid entri root entri point obtain previou term node object interchang typic set oper object label user db entri point mean search start object db notic queri span multipl object case point object queri select return queri insensit object relat queri relat tupl belong option defin attempt control queri part tradit queri pose queri view limit search singl effect oid complet queri node sampl queri empti result int specifi answer object intersect object yield final answer mean answer object constrain evalu follow remot pointer figur node queri int return node queri return empti set int restrict queri answer object restrict user queri return object view stress select simpl featur featur discuss simpl view manag featur oql lorel multipl path select multipl condit easili ad languag featur make increment view manag complex view materi view view set imaginari object defin real object view hide restructur object underli view object cach perform reason discuss section defin view introduc challeng problem structur control materi defin queri answer view queri situat relat context queri answer simpli set oid origin data relat view relev data differ relat view richer nest object view process view mainten algorithm substanti virtual view start defin virtual view result illustr view interest person person defin view vj select person object view vj object notic label view view label gener queri virtual view defin view definit queri view object set oid return view definit queri object view refer object examin queri evalu view base object object belong refer base virtual view queri wai view constrain queri result int queri select int vj return answer object exclud queri answer int ad queri writer author system user queri automat expand includ int union view user author access user access author data retriev author view easi dynam modifi privileg user virtual view queri view vj defin set person object subobject interest ag person write full queri write queri select subobject object view vj label ag view import intermedi result process queri view make queri simpler view concept view set object defin view essenti add structur applic view defin object figur defin view prof select defin view student select origin professor student object reachabl depth creat prof student student subobject professor includ queri access hierarchi view start point start student reach inform student constrain queri view int restrict answer student materi view materi view store copi object view materi copi view store physic close base remot site view typic materi improv queri perform data data expect access frequent includ materi view materi view access control queri start virtual view view base object deleg object materi view deleg object real object label type origin object assum deleg origin discuss variat deleg object oid follow paragraph relat deleg object back origin relationship crucial view mainten oid view object record relationship base object oid os deleg object materi view obtain concaten view oid materi view deleg base object oid approach similar semant oid object identifi materi view chang arbitrarili storag system semant oid system assign view manag system gener tabl map local oid storag system semant oid view manag materi view ordinari ordinari object mv oid view oid deleg object illustr materi view materi view express defin materi copi view defin select person keyword view materi materi view shown figur object deleg materi view view object shown figur figur materi view view materi affect queri long valu deleg origin object queri pose return result queri pose vj notic make deleg origin mean deleg oid base object view oid object person user queri access queri access remot object relationship object materi view implicitli child object person system implement view detect exist chang call oper edg mean chang base oid oid deleg affect result queri system manag decid edg improv perform scenario materi view store site base case edg enhanc queri perform local access referenc object scenario queri materi view mv start point mv case make easier enforc mv queri select return answer object edg easi check edg check pointer start system decid follow link check deleg ad answer materi view store independ base chang object valu affect base object care queri modifi view give result origin materi view virtual chang view arbitrari make imposs maintain view automat case modif materi view chose edg materi view remov remain base oid deleg object user queri object mv restrict access mv object similar attach mv ident queri retriev view object oid base view modif add timestamp auxiliari inform deleg object queri refer auxiliari virtual view notic remot site defin view share common end multipl deleg base object share deleg object interrel view interest idea plan investig queri view view ordinari object view queri system process queri view depend view materi view system access store object differ normal queri process materi view date base data topic view process queri view rewrit queri queri base object queri rewrit relat view lack algebra brute forc rewrit result huge queri difficult optim method answer queri virtual view materi view queri queri evalu materi view problem method view larg number object queri access small number result lot wast work make view definit simpl virtual simplic make queri rewrit feasibl materi simplic make mainten feasibl complex view relationship break multipl simpl stage simpl increment mainten algorithm simpl view increment view mainten algorithm produc view base object increment view mainten algorithm develop relat model central distribut case section develop algorithm view central base materi view resid site view mainten algorithm direct access base data briefli review basic updat describ type view develop mainten algorithm design increment view mainten illustr exampl discuss algorithm basic updat type basic updat oid add oid set object child oper remov oid assum child object object point garbag collect discuss garbag collect atom object insert delet oper add delet edg base graph updat oper creation object creat object point object impact effect view ad object db model updat oper repres seri base updat chang set object treat insert delet compon chang label consid simpl materi view focu group simpl view definit queri involv tree path path express studi simpl type view illustr fundament problem view mainten exampl problem base updat materi view determin insert delet increment view mainten effici recomput entir section briefli discuss relax assumpt maintain gener view materi view mv defin express defin mv select path select path start object root path sel path cond path sequenc object label wild card function defin section return true object valu path make condit true state assum base tree structur assumpt crucial simplifi algorithm materi view mv set deleg object section view object gener view defin view object mv type set compon deleg object view basic updat view mainten interest professor younger defin view yp object defin yp select current materi view shown left hand side figur view yp includ view object yp object deleg base object figur chang materi view assum updat occur atom object object satisfi condit definit view yp insert yp figur show correct view process updat notic label object arbitrari repeat object child object label ag insert object subobject label view object mainten algorithm scenario increment mainten algorithm base object deleg object insert exist deleg delet view task increment view mainten algorithm discov deleg model materi view collect mainten algorithm worri maintain edg defin construct algorithm tree clear path repres path path start label direct children end label algorithm increment mainten view mv sel path arbitrari path cond sel path arbitrari path cond path arbitrari path cond sel path cond cond end algorithm ancestor kn defin ancestor object satisfi exist defin return set object make true function return object satisfi condit satisfi condit view deleg object creat ad view part view copi content make oid object object type assum oid valu base oid defin oper creat deleg object insert assum object oid child insert stai defin oper remov object delet oper oper view object child oper garbag collect algorithm show identifi object argument function return true satisfi condit deleg insert delet mv identifi object intend develop algorithm eventu appli distribut wareh algorithm provid isol comput access base base data oper examin base data encapsul function algorithm trigger updat base object central view mainten perform transact trigger algorithm base trigger updat updat root root root locat object deleg potenti affect delet base algorithm examin sel cond path updat object repres object deleg potenti atom descend condit test algorithm locat test origin condit make view chang recent updat insert delet view notic delet occur ancestor simpli delet descend make condit true result label assumpt condit reexamin figur show relationship path object algorithm left figur correspond object layout scenario base updat insert rightmost figur correspond base updat increment view mainten illustr execut algorithm scenario step updat occur step sel path professor cond path true sel path step object insert enabl ancestor insert view step node view child yp prove algorithm show start initi correct materi view consist base data process updat deleg view object extra object mv detail correct proof omit discuss import issu cost increment compar recomput entir view algorithm major cost li evalu function involv access base recomput view involv access base cost approach depend specif size type cost queri process index structur base base node find evalu straightforward exist evalu function requir root increment mainten superior recomput entir view view deleg object case recomput updat impact easili identifi object question increment view mainten algorithm relat model repres base data view appli exist relat view mainten algorithm repres object relat fashion object shown relat repres tabl tabl oid label tabl oid object type set children oid atom object valu assum attribut relat hold data type union person oid label root person professor professor student parent child root root root oid type string integ relat principl increment maintain disadvantag relat singl object updat involv multipl tabl insert atom object modifi tabl requir invoc relat increment mainten lead inconsist updat reflect materi view incorrect tupl tabl tabl view defin path section defin express increment maintain view evalu hidden relat cach path suggest earlier harder notion path explicit view mainten increment mainten materi view view store site separ data data discuss handl relat issu realiz function algorithm commun remot cach relev inform reduc queri cost view mainten paper studi definit realiz view provid procedur algorithm maintain type view method view materi view storag manag serv step solv practic problem view develop increment view mainten algorithm group simplifi view illustr fundament problem due space describ detail gener materi view maintain note relax restrict view definit section easi handl view select path condit straightforward relax assumpt import ffl sel path cond path gener path express wild card maintain type mainten algorithm test path gener path express path path express view defin express select insert root descend node deleg object insert view ffl complex structur base base arbitrari graph mainten algorithm similar algorithm path object actual implement comput difficult addit mainten algorithm gener open challeng issu view start address illustr issu ffl defin maintain view edg explicitli shown ffl defin handl view deleg object obtain base aggreg ffl defin maintain partial materi view materi level object leav rest pointer back base type view cach data interest ffl maintain materi view updat base updat queri gener salari person view salari person unaffect refer abiteboul bonner object view page wiener lorel queri languag semistructur data journal digit nov editor build stori morgan suciu queri languag optim techniqu unstructur data page june editor object morgan cluet delobel gener framework optim queri page june gupta mumick mainten materi applic ieee data engin special issu materi view data june hull yoshikawa declar creation manipul object identifi page aug sagiv queri object orient page june konopnicki shmueli queri system world wide web page sept object fusion mediat system sept widom object exchang heterogen inform sourc page mar widom queri semistructur heterogen inform page dec rundenstein methodolog support multipl view page aug suciu queri decomposit view mainten queri languag unstructur data page sept editor workshop manag semistructur zhuge graph structur view increment mainten technic stanford oct
IR/1578 5 boost document rout raj iyer david lewi robert schapir yoram singer amit singhal lab research shannon laboratori park avenu florham nj usa abstract recent algorithm learn rank function simpl implement strong justif comput learn theori describ algorithm present result appli document rout problem set result appli text produc modern term weight method perform inferior rout algorithm complex theoret justifi achiev compar perform algorithm combin featur select heurist set result examin behavior learn rank function aspect term weight raw data perform good term weight function implicit result rank function approach easili adapt mixtur textual data text introduct recent year applic machin learn inform retriev benefit interest algorithm clear theoret abil handl textual effect attent fallen subset ir classif task text categor document filter classif behavior ir system interest rank rank document current live wisdom colleg palo ca research conduct visit lab support nsf graduat fellowship contact author current school comput scienc hebrew jerusalem israel research conduct lab permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee ninth intern confer inform knowledg manag copyright acm measur relev extrem effect interfac million time dai world wide web search engin ir develop approach train model rank document appli interact search exist call priorit document arriv task call rout ir techniqu rank facet select weight term inform textual queri process call queri weight train data form document judg process call relev feedback interact context optim rout term model fit techniqu similar explor machin learn goal rank classif facet rank techniqu textual document token index term numer vector process associ numer occurr index term document call document document term weight term term weight receiv attent ir paper report attempt bring machin learn approach bear facet rank adapt boost algorithm design produc model rank wide studi rout task studi appli document repres modern ir term weight techniqu compar abil fit rout model rank algorithm appli text studi discard modern term weight test simultan learn term weight function rout start raw textual data repres form result show overfit absenc addit featur select mechan restrict featur set result substanti train data interest term weight function learn number suggest approach term weight nonstandard text begin section discuss previou approach term weight model fit rank section describ algorithm section discuss featur engin support learn term weight function section review benchmark method section detail experi present result section conclud studi point futur direct background relev feedback rout scenario input learn algorithm set document classifi binari relev train model produc rank futur document binari classif reconcil mismatch train model estim probabl document belong relev class rank document base probabl probabilist retriev base paramet estim independ framework common approach train view relev matter binari relev judgment reflect train algorithm observ judgment train document attempt produc model estim underli rank document earli vector space retriev relev feedback algorithm embodi construct prototyp relev vector similar measur recent ir research work framework comput power search model optim rank effect train data result algorithm common techniqu machin learn lack theoret proof pursu machin learn machin learn devot attent area statist social scienc paid bit attent literatur survei boost rank section describ approach document rout boost algorithm base freund schapir adaboost algorithm recent successor develop schapir singer goal produc statist model appli set order fashion approxim true order relev true order obtain human expert provid feedback form relev judgment expect true order rank relev document formal partial order goal produc order place relev document top method measur similar approxim order true order attempt minim measur call disagr number pair document approxim order respect true order studi simpli number pair document approxim rank order feedback judg relev approxim true order combin simpl rank document simpl rank consid studi base frequenc order document time word rank set document frequenc singl term place document relev document idea boost gener combin simpl rank principl manner produc singl highli accur order simpl rank function call weak rank document refer score assign order boost assum access algorithm subroutin gener call weak learner boost algorithm call weak learner time gener combin singl order call final combin hypothesi boost algorithm proce round main featur assign import weight pair train document weight repres import weak learner differenti document determin weight maintain document boost algorithm goal order relev document crucial document pair form feedback judg relev weak learner simpl rank correctli order pair account greater import correctli order pair assign greater weight algorithm pair document hard differenti correctli higher weight pair easi differenti lower weight effect forc weak learner concentr document pair deriv simpl rank final hypothesi order set document assign score score document weight combin score assign document weak descript shown figur input set train document disjoint set relev document set document judg human call weak learner repeatedli seri round round set import weight pair train document comput weak hypothesi hs document assign score discuss weak learner experi import weight maintain formal distribut pair train document distribut denot distribut round ds weight pair train document relev distribut ds written maintain condit ds understood sum pair initi set weight goal weak learner find simpl rank document pair rel distribut ds weak learner attempt find weak hypothesi hs low weight disagr hs error interpret probabl document pair chosen randomli distribut ds obtain hypothesi hs ff import assign hs comput discuss updat weight document pair pair correctli order hs hs hs lower weight pair higher weight moment ff ensur weight form distribut renorm result updat rule shown figur process gener weak updat weight repeat round decid discuss section ht valu ff ff set document order score assign final hypothesi document ff hs predict weak evalu document averag weight ff form score assign gener order set document sort score discuss exact choic ff freund al prove disagr final hypothesi bound product normal zs minim eq round ff minim zs gener weak learner assign document arbitrari real suggest find ff numer search method combin weak learner discuss section gener weak learner rang case weak freund al provid direct calcul ff ff ln rs rs rs hs understand choic highli accur weak hypothesi hs found rs close ff larg translat drastic updat distribut greater weight assign predict hs comput final hypothesi hs accur random rank rs close ff close updat distribut predict hs final hypothesi receiv low weight ff neg case weak hypothesi hs found rs indic hs neg correl data hypothesi opposit predict weak hypothesi output multipl time boost cumul weight ff neg restrict reduc danger overfit implement effici version freund al behavior pseudocod figur code figur run time proport effici code due lack run time proport speedup larg text collect trec note time includ run time similar speedup weak learner experi input set document separ disjoint subset relev document initi jx train distribut ds return weak hypothesi hs comput ff ds exp hs zs zs normal zs ds exp hs output final ff hs figur algorithm document rout weak learner discuss weak learner experi weak learner call round notat previou omit subscript weak learner input distribut document pair set rank featur rank featur function assign score document rank featur leav document rank featur equal term frequenc word equal document weak learner rank featur form weak attempt find small disagr rel distribut minim quantiti weak learner find weak hypothesi minim normal constant figur upper bound discuss previou section describ weak learner differ type weak gener weak simpli select rank featur weak hypothesi weak function score treat score weak weak select rank convert binari function threshold score threshold featur judg document score threshold relev document score threshold score map studi map weak learner search rank featur minim achiev rank algorithm calcul ff minim run newton method fix number step implement numer search time proport sum featur number document rank featur omit lack rank featur number size invert index term weak learner set rank featur ff output weak hypothesi form ae implement weak learner search topic rel test tabl averag result term occur posit train document featur version base term reuter line result restrict topic relev test document jrj defin eq minim justifi freund al show binari weak weight ff comput eq search check threshold featur freund al show search carri time proport run time implement experi note treat unrank document rank rank document number round set number round boost run final hypothesi output grow larger complic larger final hypothesi predict accur train overfit gener futur data train data select fashion minim risk overfit theoret number round boost tend give practic heurist estim good number round boost found rule yield good result run number featur featur set section number posit exampl train set smaller term weight weak hypothesi format typic learn approach rank function produc common linear model appli term weight term weight approach handl document frequenc document length highli optim linear reason explor altern term weight approach rank function linear combin threshold featur model structur rare ir appli standard term weight function peculiar featur valu simpli threshold explor possibl raw document content implicitli construct separ term weight function term weight multipl threshold weak term describ section natur term weight function produc raw text topic rel test document top rel tabl averag result restrict featur nonzero weight version reuter line result topic relev test document trec line result top test document rank remain relev test document simplest case defin rank term equal raw tf term document occurr view featur rank document tf effect call weak hypothesi produc boost ae tf tf tf document frequenc term hypothesi weight ff boost hypothesi contribut ff document score tf select term contribut final hypothesi rank document weight combin weak form weak base index term hypothesi threshold weight ff contribut term document ds score step function produc sum weak deriv wn tf tf tf tf tf tf set threshold weak term result sum ff weak base term threshold note impli wn discuss section forc produc nonneg weight weak hypothesi convent document weight larger valu tf term larger contribut document score differ document weight function step function continu function log function learn prespecifi term avg prec avg prec rocchio avg prec avg prec rocchio figur comparison text collect point scatterplot show test averag compet algorithm singl topic point give test averag topic length featur common term weight document length reduc score long document long document tend higher tf valu actual content document document length normal approach cosin normal pivot normal normal formula rank task present investig learn custom document length normal rank task defin rank equal neg document length term occur document negat length posit weight test shorter document boost longer weak hypothesi base length featur ae length length inequ write negat document length weak weight ff cumul effect weak base length featur step function larg posit contribut short document contribut document length refer includ length featur length featur long document defin featur document length affect term differ defin multipl rank featur tf observ term train corpu featur document negat document length term tf document select featur implicitli threshold tf explicitli threshold negat length result weak hypothesi base avg prec avg prec avg prec avg prec figur comparison weak text collect qr figur ae tf length call quadrant set document assign weak hypothesi quadrant length tf space cumul effect weak base singl term complic function document length tf figur function learn manner similar possibl superior convent term weight function section examin question method section review dataset test boost algorithm standard ir techniqu compar dataset studi dataset studi boost text classif procedur process dataset rout dataset consist train document test document distribut trec disk fifti trec topic relev judgment rout evalu textual queri topic exist experi rout dataset trec rout collect wide benchmark machin learn rank size problemat prototyp code dataset smaller collect collect consist document reuter newswir document categor respect topic categori split data train test document categori posit train instanc posit test instanc split result present set categori posit train instanc posit test instanc test set averag figur errat categori detail collect dataset index standard smart phrase format experi raw tf tripl log tf pivot normal version data produc smart note studi effect measur binari classif surrog rout evalu result averag wide measur rank effect averag comput standard trec evalu softwar compar rout method wide rang highli tune learn algorithm produc rank function explor trec rout evalu consist success approach optim algorithm initi rocchio relev feedback formula compar effect latest seri algorithm call incorpor dynam feedback optim queri zone algorithm phase detail experi report result appli train rank model studi issu model studi charact learn term weight function studi boost weak studi properti weak learner appli standard ir context standard text document consist weight word phrase rank featur term weight document result final hypothesi linear combin document weight set term ran candid weak term occur posit train instanc class featur perform reuter collect gave averag averag averag restrict topic test differ initi result suggest job weight featur select conjectur restrict high qualiti featur set result effect test simpli restrict featur select significantli improv effect tabl perform slightli figur show scatterplot compar topic reuter collect outperform advantag topic ti remain disagr test number round queri queri figur disagr test set measur function number round boost compar featur collect current implement slow run train featur select train top document rank remain relev document train entir corpu tabl figur perform averag averag origin run inferior perform data due larg part limit dataset statist properti entir train set entir test set test evalu test set select similar manner train top test document rank remain relev document limit test perform averag compar tabl effect chang evalu trec evalu softwar account top retriev document comput effect problemat aspect number round boost perform heurist present section critic choic number found tend exhibit sort behavior overfit mean disagr test function number round quickli reach minimum rose significantli learn curv topic figur disagr continu eventu reach asymptot behavior figur topic case occur topic relev case perform perform case overfit topic relev document featur rocchio featur featur rocchio featur tabl averag result text version restrict featur select rocchio qr data lost due bug failur studi learn function raw data studi test abil extract effect term weight function raw data began raw tf vector convert set rank featur form section document length comput sum raw tf valu word document produc prune set rank featur topic featur assign nonzero weight studi refer prune featur set qr result featur set slightli concentr weak learner appli train data repres form boost stop number round heurist section learn model run test data repres type rank featur train result summar tabl restrict featur chosen hurt larger amount label data reuter due greater rang document length case averag exce tabl compar qr result figur plot data detail substanti outperform qr result mix trec threshold method produc term weight good tradit highli tune method section select multipl weak base term learn document weight function happen weak term variant boost select threshold rank featur rank featur substanti overlap posit neg train instanc substanti variat raw tf valu instanc document length document length raw tf document length document length raw tf figur contribut dollar tf valu document length qr featur valu document length vari tf select multipl threshold common give interest section learn weight function figur plot term weight function term dollar reuter topic dlr predictor dlr nonzero tf reuter train drawn posit train instanc dlr topic plot document raw tf dollar grai scale intens encod contribut dollar make score document length dollar tf intens normal averag length document dollar tf intens graph upper left plot show contribut dollar model total weak threshold select round document length explicitli repres featur model account give high tf slightli weight bare color compar upper left upper plot upper plot show contribut dollar weak cover model contribut dollar tf abil long model impact larger tf length featur long document inappropri high score model fact incorpor weak deriv length featur combin effect contribut document document length document length greater lower left plot show effect weak dollar qr model weak distinct repres tf threshold length threshold effect similar standard term weight contribut tf sublinear high tf impact long document short plot show problem result term weight function document length greater contribut matter time problem train set longest posit advantag set threshold longer length approach system bia favor infinit length threshold lower plot show contribut dollar weight function sum comput hypothet document grid plot actual dollar weight reuter train test document pattern notabl similar learn qr show term induc term weight function raw data futur work present preliminari evid simpl boost algorithm strong theoret learn rank model effect roughli compar lead edg rout algorithm develop ir strengthen case replac featur select choic made simpler theoret motiv featur select method hope produc effici implement elimin select result show boost approach appli raw document content weight document learn term weight function similar ir distinct weak give crude treatment term weight term attempt learn separ term weight function term size train set altern great flexibl learn term weight forc function term view autom version exploratori data analysi approach term weight approach induc term weight function raw data interest rank base textual featur highli refin term weight method rank base mix studi task interest text mine applic final experi assum binari relev equal work grade relev judgment possibl learn complet relev exampl long judgment partial relev web plan investig refer bt gw rk belew automat combin multipl rank retriev system annual intern confer research develop inform chri jame gerard salton automat rout retriev trec text retriev page chri bucklei gerard salton optim relev feedback weight annual intern confer research develop inform page juli william robert yoram singer learn order thing journal artifici intellig yoav raj robert yoram singer effici boost algorithm combin prefer machin fifteenth intern yoav freund robert schapir gener learn applic boost journal comput system august warren theori term weight base exploratori data analysi intern confer research develop inform page donna harman overview text retriev confer text retriev page robertson probabl rank principl ir journal decemb okapi text retriev page rocchio relev feedback inform retriev smart retriev automat document page prentic jj rocchio document retriev evalu phd harvard comput gerard salton christoph bucklei approach automat text retriev inform process robert yoav peter wee sun lee boost explan effect vote method annal octob robert schapir yoram singer improv boost algorithm predict machin decemb robert yoram amit singhal boost rocchio appli text filter annual intern confer research develop inform amit chri mitra pivot document length normal annual intern confer research develop inform page amit chri bucklei learn rout queri queri zone annual intern confer research develop inform page howard turtl bruce croft infer network document retriev annual intern confer research develop inform page van rijsbergen inform retriev em dk harman overview sixth text retriev confer sixth text retriev page
HCI/1579 4 architectur overview system descript marku swedish institut comput box sweden abstract report present architectur overview system descript system system servic user electron servic open extend servic infrastructur user control accomplish collect servic individu user virtual servic form servic compon includ logic mobil follow user move host termin specif build servic compon infrastructur handl present refer implement specif extens form servic compon report serv technic refer develop servic softwar infrastructur build technolog keyword electron person servic user servic softwar engin sic technic report issn introduct electron servic spread increasingli broader group grow support continu interact multipl type sort place locat desir assur user control person inform servic gather maintain user control servic collabor demand repres current research topic privaci context electron servic servic ubiquit user interfac design system design solut research cater research system assum client server model uniform client servic specif function access server case world wide access server channel virtual servic support access type devic user interfac privat individu store servic compon servic logic data servic provid servic provid split servic part part commonli function user specif data execut store virtual part function data common user servic mobil follow user host host local partial network independ access servic compon high system consist part core specif api program develop servic compon servic infrastructur build technolog implement api adher design guidelin accompani assur compat servic servic infrastructur origin refer implement develop develop runtim environ servic compon sampl implement server report structur section describ number basic concept entiti section specifi main requir influenc design system section detail descript core specif section describ refer section conclud summari architectur overview system descript basic concept system build concept person servic environ person servic environ individu collect tailor set user time servic retriev servic provid retriev partial independ internet access person servic environ user network interact state servic save person servic environ move host internet continu interact session user servic switch interact devic remind person servic environ refer servic environ simpli environ system defin main servic servic servic server servic compon entiti servic servic compon servic environ collect class definit resourc defin compon load execut person servic environ servic compon collabor content user interfac handl servic data structur person servic environ store servic servic compon save execut state servic set includ function creat servic compon servic server constitut api offer servic handl creat servic start servic creat person servic environ base servic synchron instanc servic servic server illustr part system relat fig comput mark server servic environ execut case user sit comput servic environ cloud servic compon execut make standard gui interact comput mark ii host servic environ remot interfac user web browser interact user wap phone store servic form servic migrat comput run server remind document refer server combin servic server server softwar person servic environ execut design requir design goal system open user control open impli add servic compon user system affect part system user control impli system give user control servic inform user servic servic user chose make possibl user control exist user control usag situat practic mean servic reachabl type user devic publicli devic open user control analyz term specif continu requir close relat person servic environ discuss detail requir heterogen profound impact design implement discuss web kiosk servic server servic environ multipl user servic server servic environ singl user html ui gui wml ui wap gatewai servic iii ii iv fig main entiti system relat architectur overview system descript heterogen electron servic form commerci research product sound requir open infrastructur interact heterogen mix servic compon util featur approach requir heterogen number wai system implement java bring reason chanc creat platform independ system easi integr java base electron servic infrastructur system put constraint implement servic make integr servic infrastructur straightforward develop servic compon chose implement function servic place function server network case servic compon serv proxi network base combin altern integr exist servic system servic compon free commun extern resourc protocol commun limit system extend open impli demand extend servic ad system add support protocol make add function commun servic collabor servic enhanc secur current design approach requir extend wai function servic compon target user provid function servic compon user servic environ make easi extend system function servic compon build includ exist java packag system separ core specif refer implement core specif includ api order implement server compat api ensur servic compon execut implement server core specif includ method server dynam load implement commun protocol server commun protocol implement java servic compon server function constant mobil implement monitor persist implement implement implement implement implement implement tabl main class interfac core specif core specif core specif consist java class interfac order implement servic compon server total size specif kb tabl list import class interfac relat servic compon server function appendix full list class interfac api overview basic architectur core specif entiti fig servic servic servic servic context entiti briefli section servic constitut context servic compon execut servic context offer servic compon api compon regist subscrib manag servic compon architectur overview system descript servic compon servic compon creat implement java interfac class definit servic compon packag jar file manifest inform compon servic compon lifecycl defin set state state transit graph servic compon extend persist mobil packag distribut servic compon servic compon packag distribut jar file class definit resourc servic compon includ inform structur servic compon import part jar file set class file defin function servic compon class file includ jar file directli main jar entri usual nest jar file conveni servic compon depend extern packag jar file class includ intern class path jar manifest servic compon regist servic servic compon export class definit jar file servic compon class interfac definit order servic export simplest singl interfac advanc servic packag export class definit export jar manifest resourc form store file includ jar file resourc made servic compon servic form byte arrai servic server server servic context servic person servic environ servic compon servic compon servic compon fig overview basic architectur core specif jar file servic compon manifest inform servic compon list entri manifest symbol servic compon fulli qualifi class class servic compon implement interfac intern class path jar file comma separ list jar entri jar stand class root jar list entri search class definit order comma separ list packag fulli qualifi class export servic compon list servic servic servic compon depend list permiss grant servic compon function system section jar manifest servic compon list jar file includ nest jar file includ servic compon servic compon export class class servic compon servic compon lifecycl lifecycl servic compon set state state transit graph fig half transit initi servic context half servic compon servic context initi state occur result servic context call method servic compon servic compon initi transit occur wai servic compon initi state chang return state method servic context state chang delai return explicitli set state call method servic context descript state servic compon inact servic compon newli creat recent remov servic environ state servic compon sampl servic compon list jar manifest servic compon list permiss packag packag omit architectur overview system descript interact servic context servic compon initi servic compon automat reach state servic context call initi method servic compon step add compon servic environ servic compon expect perform initi lifetim servic compon chanc servic compon interact servic interact servic compon servic compon signal initi initi method return initi continu return initi call servic context case neg number return initi method signal initi finish initi servic compon reach state finish initi start servic compon automat reach state servic context call start method servic compon servic compon perform task time start interact servic context servic compon servic compon signal start start method return start continu return start call servic context case neg number return start method signal start finish activ servic compon reach state finish start state lifecycl servic compon spent servic compon interact servic context servic compon inact initi stop initi stop activ start suspend resum suspend resum return return return return return fig state graph describ lifecycl servic compon suspend servic compon automat reach state servic context call suspend method servic compon step suspend compon servic compon expect unregist servic offer servic servic servic compon servic compon interact servic context state interact servic handl servic compon signal suspend method return continu return suspend call servic context case neg number return suspend method signal finish suspend servic compon reach state finish state servic compon interact servic context servic compon servic compon save persist media move server resum servic compon automat reach state servic context call resum method servic compon step resum compon state compar initi except state occur servic compon signal resumpt resum method return resumpt continu return resum call servic context case neg number return resum method signal resumpt finish resum servic compon reach state finish resumpt stop servic compon automat reach state servic context call stop method servic compon step stop compon servic compon expect unregist servic offer servic servic servic compon servic compon interact servic context state interact servic handl servic compon signal stop stop method return stop continu return stop call servic context case neg number return stop method signal stop finish stop servic compon reach state finish stop state servic compon reach end lifecycl reload save copi creat instanc servic compon bring servic compon back servic environ state servic compon interact servic context servic compon architectur overview system descript import import public class implement runnabl thread implement interfac public int initi comput intens return public int start sc public int suspend return public int resum comput intens return public int stop return implement interfac runnabl public void ct run comput intens catch instanceof suspend comput intens instanceof stop comput intens ct misc public void ce sc list sampl implement thread servic compon state handl list state handl thread servic compon code requir lot comput call execut separ thread initi comput intens run thread servic context call initi start thread servic compon state activ enter servic compon execut thread stop handl thread servic suspend stop call thread servic compon run handl initi resum persist mobil servic compon made persist execut state serial object constitut servic save servic made mobil mean follow servic migrat server servic compon made persist implement interfac requir servic compon implement freez list servic call freez method save servic compon occur servic compon reach state state resum reach freez method prepar serial optim remov data structur servic compon compact hash tabl empti media cach effici storag return freez method extern refer refer servic file socket handl set null servic call method save version servic compon load occur freez method call vm state resum reach method recreat data structur remov refer declar transient import import public class implement persist vector user vector user inform hashtabl media cach video clip implement interfac persist public void compact vector user remov media cach public void recreat media cach list implement interfac persist architectur overview system descript convert freez method refer set null freez method serial servic compon made mobil implement marker interfac servic includ servic compon migrat host properti servic compon persist mobil orthogon persist servic compon mobil save state migrat node mobil servic compon save local time servic compon restart start scratch fine power servic compon combin properti servic compon save state migrat tabl list exemplifi combin properti servic context servic context runtim handl servic compon control lifecycl servic compon set state compon context inform servic compon reason state chang send event servic context servic compon access kind properti store context api commun servic handl servic compon server servic compon privileg grant compon base permiss event servic context control state servic compon call method stop activ object compon method refer servic context subclass inform reason marker interfac interfac empti bodi interfac signal implement interfac consid properti case mobil mobil persist user preserv state follow user preserv state printer user preserv state proxi web base follow user preserv state driver tabl exampl type servic compon state chang servic compon inform decid act state chang main type event servic compon state inact resum state activ exampl event includ servic compon state stop state suspend exampl event includ servic compon state inact stop state stop exampl event includ document event packag detail descript inform individu event carri appendix properti servic context administ set properti store set kind local properti deal set share person servic environ server refer mean interact user local properti set chang servic context individu servic administr server control properti stationari properti share bound server store set user ui differ server stationari properti creat modifi servic context individu servic compon mobil properti stationari contrast vari server mobil properti typic deal set locat depend user inform type properti conveni push server set servic compon save share inform servic compon mobil servic compon commun servic compon commun collabor offer servic establish servic relationship fig servic compon offer servic compon servic process initi sca regist servic servic sca pass servic servic interfac factori implement interfac servic context creat interfac servic architectur overview system descript ii request proxi servic sca regist servic context servic proxi type servic request iii servic start subscript servic servic proxi servic interfac factori sca provid creat interfac servic iv servic invok method servic interfac note type servic interfac scheme effect descript relationship altern wai phase ii happen phase exist attempt start subscript servic regist result refer servic interfac servic proxi includ function handl situat request servic call wait servic compon regist listen notif case start subscript provid servic compon unregist servic time consum servic oblig stop servic server servic compon handl servic context api servic compon handl server servic compon api servic compon synchron servic shut servic environ case servic context servic compon servic compon servic interfac factori servic interfac servic proxi ii iii iv fig graph describ establish servic relationship api servic compon save servic compon servic compon partial control lifecycl compon forc compon stop servic compon control lifecycl api request servic context stop servic compon permiss servic context function handl servic environ servic compon protect permiss permiss specif includ core arrang hierarchi specif gener permiss fig extend interfac permiss combin permiss implement permiss servic compon list class correspond permiss includ jar manifest list servic servic function load save servic compon storag jar file servic persist servic properti servic serializ store persist media content synchron servic server function servic deleg servic initi occur implicitli result ad compon servic environ start occur automat compon finish initi resum permiss permiss handl servic environ handl servic compon handl runtim handl compon handl suspend stop resum creat load save reload save shutdown synchron permiss permiss fig hierarchi permiss access servic context function architectur overview system descript servic compon servic storag serial handl individu servic compon includ function save servic store persist servic cach jar file servic compon servic compon creation load requir class loader provid server implement server typic separ class loader servic compon system ensur servic compon manipul servic compon permiss servic state import step synchron content servic compar state servic servic state includ creation chang jar mobil servic compon servic user id password function servic protect user id password creation servic user provid user id password user id uniqu identifi owner move server synchron content instanc provid method assign uniqu identifi user user encourag exist uniqu internet identifi user id password encrypt algorithm store servic bit long password order protect user provid encrypt compar origin password note user id password mean repres partial protect servic scheme illustr protect true protect servic includ authent encrypt content implement user freeli select part servic server servic server api servic handl creat remov exist start stop execut person servic environ api includ function move servic synchron content instanc server api java interfac commun server design commun server java interfac suffici miss protocol capabl wrap server interfac java rmi http protocol special characterist strength imposs select prefer protocol reason chosen protocol core specif interfac access implement servic server note solut commun implement type secur commun scheme server proxi implement protocol secur authent avoid synchron servic fake server type channel encrypt protocol ensur inform integr easili implement fig illustr commun path servic server commun protocol local servic server establish commun link creat instanc xxx server proxi implement server proxi creat xxx remot servic server server proxi act server incom protocol xxx commun remot servic server case server proxi act factori remot servic server servic synchron servic synchron process involv servic synchron content instanc servic server note process concern synchron servic instanc user time number step initi server request state servic instanc server initi request mobil properti servic instanc particip base particip state mobil initi gener state set mobil properti repres upto state mobil properti set servic local servic server commun protocol xxx java vm host protocol xxx server proxi protocol xxx remot servic server local servic server java vm host protocol xxx server proxi protocol xxx remot servic server fig graph describ commun servic server protocol xxx architectur overview system descript initi gener instanc servic reflect latest state involv request servic compon particip initi gener updat instanc servic account inform make particip updat instanc particip crucial servic instanc initi particip consist behavior servic equip monitor servic server prevent modif servic monitor design concurr modif servic unlock import handl initi particip failur synchron process accomplish wrap synchron process modifi version commit transact protocol process synchron transact fig transact coordin send abort messag initi particip particip receiv abort messag servic messag simpli reset transact unlock synchron transact initi transact coordin synchron transact particip invit particip vote commit global commit global commit request servic state compil state latest request mobil properti compil updat instanc updat servic acknowledg global acknowledg lock servic lock servic updat unlock servic updat unlock servic fig diagram describ synchron process transact handl servic happen time transact coordin initi long abort messag particip receiv servic updat discard initi receiv abort messag acknowledg transact reset synchron restart initi updat servic abort synchron process requir fewer step initi instanc servic note matter abort occur particip updat updat retri refer implement refer implement system develop serv develop runtim environ develop servic compon serv sampl implement core specif develop server function freeli download web site current implement refer implement base standard version implement core base number packag runtim librari list current version refer implement alpha support featur core specif intend fulli scalabl runtim environ support featur limit limit serv person servic environ time support retriev date implement consist class size kb list packag refer implement built architectur overview system descript extens refer implement includ ip socket base implement server proxi commun wrapper section implement server commun ip socket base protocol order open core specif includ ui handl left task servic compon handl refer implement includ servic compon handl user interfac gui java swing html wml user interfac complement set user interfac refer implement includ set servic compon handl miscellan function manag servic compon regist mailbox servic compon post messag spontan commun servic compon prefer manag offer rudimentari handl prefer entri user servic compon store fetch subscrib prefer user inspect control servic access entri prefer manag store prefer entri mobil properti architectur basic design implement system design motiv requir open user control demand heterogen extend influenc design order extens system separ core specif api main compon refer implement develop compon server function develop runtim environ core specif build roughli main servic servic servic server combin compon servic electron servic open extens servic infrastructur user control acknowledg design implement report build author experi particip develop similar system work present report fund swedish institut inform technolog member laboratori swedish institut comput scienc fredrik inspir thought comment special boman anna implement refer servic environ open user control swedish institut comput sic technic report servic gatewai specif open servic gatewai dynam distribut intellig agent framework base jini msc maryland baltimor distribut agent network present intern symposium agent system intern symposium mobil agent featur dartmouth workshop transport la marriott resort palm compon base architectur mobil inform depart comput scienc electr maryland baltimor technic march file sun april rivest messag digest mit rsa data april remot method invok sun april object access protocol world wide web note juli hypertext transfer protocol world wide web april open agent architectur support multimedia servic public inform present practic applic intellig agent manag user interact multipl royal institut technolog stockholm interact system present webnet confer www architectur overview system descript design open servic royal institut technolog stockholm appendix appendix full java document core document document automat gener tool packag core class summari er callback callback thread constant set constant serv iv bri ce mobil servic compon ce bri synchroni persist servic compon offer state ng ce bri synchroni save wrap ns remot se server ni ant ap se server serv iv compon wi execut ce bri li ce compon state superclass compon ns speci ii ap envi ronment er event context ce compon regi compon si ce event ce compon request proxi context wrap case ni order make provi de ti wrap case ni order make provi de ti wrap case ni order make provi de ti class callback er callback callback thread monitor exclu si access ns subclass deleg load class classload ng compon super class ce compon event serv er wrap jar andi ce superclass ce context event except thrown ce compon attempt call method hold call ti ni thrown se server request experi enc fatal error ti ni thrown serv iv context request ii ce fatal error class summari callback callback declar public class callback implement alli descript li callback callback thread constructor public creat callback object wit callback arrai refer object type callback type member summari constructor public creat callback object wi callback gi wi arrai wi refer object method public void member summari method inherit class wait callback arg paramet callback listen li call method public void ii callback declar public interfac descript li callback callback thread method public void call callback thread ng type callback type arg paramet callback member summari method public void call callback thread start constant constant declar public interfac constant descript set constant ce implement si easi access constant member summari field public static final activ compon state public static final inact newli creat recent remov envi public static final initi compon state public static final initi alli reach state ce context call ni ti li method compon public static final est kei tor compon public static final est kei compon public static final est kei li compon depend public static final est kei li class ce compon export compon public static final public static final est kei compon public static final est kei li si grant ce compon ri func lic system public static final resum compon state public static final resum alli reach state ce context call resum method compon constant activ field public static final int activ ce compon reach state ni state li spent ce context compon ve public static final int inact ei newli creat recent remov ronment state toi hei ir ce context compon ni ti ali public static final int initi ce compon reach state ng public static final int initi compon state context call method compon step add compon envi ronment expect ni li compon chanc compon wi ce ce compon si er method return ng public static final ry properti kei li server public static final start alli reach state ce context call start method compon public static final arrai state compon public static final stop compon state public static final stop alli reach state ce context call stop method compon public static final suspend compon state suspen public static final suspend alli reach state ce context call suspend method compon member summari constant context case number return method si fi public static final jar mani est kei compon kei fulli ed class class compon face public static final path jar mani kei compon kei comma jar stand root jar li search class order public static final jar mani est kei ce compon depend kei comma public static final jar mani est kei li st class compon export compon kei comma packag fulli quali ii class public static final public static final jar mani kei compon si public static final ion jar mani kei li si grant compon ri ty system kei comma separ lid packag fi ed class resum public static final int um constant resum ce compon reach state shed public static final int resum compon reach state context call resum method compon fi st step resum compon state compar initi state occur compon si resum method return resum context case ve number return resum method si public static final ari properti kei server bri vi si ted kei ce bri server public static final int compon calli reach state context call start method compon compon perform task ti mei start wi compon compon si start method return ng start context case ve number return start method si gi fi ni shed public static final arrai state compon state class work asi ng stop public static final int top compon reach state state ce compon reach end ts li reload save copi stanc compon bri compon back envi state ii ce context compon ng public static final int top compon state ce context call stop method compon step stop compon expect ter offer constant suspend compon ce context state iti act compon si er stop method return ng es stop context case number return stop method si suspend public static final int suspend compon reach state ni state ii er context compon compon save tent move server public static final int suspend compon state ce context call suspend method compon fi rst step suspend compon expect ter offer compon toi ce state iti toi ce compon er ng suspend method return ue suspend context case ve number return suspend method si fi ni shed mobil suspend declar public descript servic compon ll case ir monitor suspend declar public tor descript implement tor access cri free enter ll si consum ng call method enter call clai owner shi access guard method protect code wi perform protect action object perform action requir ownership member summari constructor public method public synchron void ve access public void enter public synchron void monitor constructor public method public synchron void throw access method block ve ns consum leav tor ref object synchroni consum fi owner consum leav public void enter tor method block public synchron public void access member summari method inherit class wait member summari monitor public void access declar public class extend alli descript subclass deleg class classload adopt sun microsystem excerpt li demonstr file sun grant modifi bean demonstr includ bean box sourc code form provid util demo manner hold sun harmless claim relat distrib ion demo distrib ion limit sourc code demo specif exclud modifi distrib graphic imag demo member summari constructor public loader method public classload protect class classload ng system class member summari field inherit interfac constructor public throw loader method public protect throw classload system class method inherit class skip method inherit class wait method inherit interfac skip method inherit class stream member summari class declar public class extend alli descript thrown compon attempt call method hold call constructor public member summari constructor public construct win null asi ts error messag public construct win speci messag member summari method inherit class wait method inherit class construct null ii error messag public construct ed messag error messag ng method class messag persist tent declar public nt extend le le descript servic compon ll offer save state ce save method public boolean case call freez method save compon occur compon reach state state resum reach freez method prepar iti ng data structur compon compact hash tabl empti cach ent storag freez method extern refer refer socket handl set null compon chang si public void bri call method save load occur freez method call yi vm ferent state reach method recreat data structur remov freez method refer set freez method member summari method public boolean ce bri call freez method save compon public void bri call method save load declar public interfac descript remot server method public return protocol server protocol server public throw except creat proxi case server uri ur ser vii case server connect refer case server repres remot server except member summari method public string return protocol server nt public creat proxi br server public creat proxi part public void method call case server call made arti public throw except creat proxi parti uri ur server connect refer server repres remot server except public alif throw except method call server call made refer local bri server arg paramet case server except li declar public class case implement alli descript ng compon storag jar properti ce casei andi store content wi es server casei deleg case storag seri compon ti tent ng jar compon es class separ class loader system ensur compon mani member summari constructor public creat case wi public creat empti bri method public void lock bri public final boolean auth owner br public final void password case public void enter public void public properti return br ii case properti constructor public creat ed public return compon correspond gi set kei public return correspond kei public synchron string return arrai ns kei si case public properti return current state bri public properti return ry case public static load br stream public synchron void ii public synchron void remov ner correspond kei public void case public static void save br gi output stream public void set le case public synchron void set tor monitor public void set ry properti br public creat compon br public void updat case set compon member summari method inherit class wait member summari ari uid user owner case password owner case public creat empti ce bri uid user owner case password owner case method public void throw case ref object consum public final boolean cate owner case uid user owner case password owner case se public final void password case uid user owner case password owner password owner bri public void enter tor method block public public return uid user owner case password owner case case public return compon correspond set kei kei arrai kei correspond set compon uid user owner case password owner case arrai correspond speci ic arrai ce compon kei public return er correspond kei kei kei uid user owner case password owner case er wi kei public synchron return arrai kei ser vii si case uid user owner case password owner case arrai kei bri public return current state bri uid user owner case password owner case state arrai properti public return uid user owner case password owner case case public static throw load case stream order load load method ani stream ch case read load case public synchron void put servic ner uid user owner case password owner case public synchron remov correspond kei kei kei uid user owner case password owner case public void unlock case public static void throw save gi output stream order save save method sb ce br ii case save os output stream save bri save public void erti set properti case prop le properti es uid user owner case password owner case public synchron set case monitor monitor public void set bri prop properti uid user owner case password owner case public creat compon uid user owner case password owner case clone compon public void updat set compon le properti es kei arrai ner updat uid user owner case password owner case declar public descript speci ic case server method exchang es method public throw return member summari method public properti return case public string return user br server public return ce bri public return backup case public properti return arrai kei compon public return arrai compon correspond arrai compon kei public void creat ce bri public void remov ce bri server public void start envi public void stop envi public void updat br remot case server properti es uid user case owner password ce brie case owner ani denti method respond properti case server bri speci ic ui public throw return user case server arrai user public throw return ser vii case uid user case owner password ce brie case owner bri user case server bri speci ic ui public throw return backup case wi ll return latest ti speci fi paramet date uid user case owner password ce brie case owner date bri backup backup case user case server bri speci ic ui ser vii brie case server backup bri public throw return arrai kei compon uid user case owner password ce brie case owner arrai er set ce compon ani denti method respond case server bri speci ic ui public throw return arrai compon correspond arrai compon kei uid user case owner password ce brie case owner kei arrai kei er fetch ani denti method respond arrai compon case server bri speci ic ui public void throw creat case uid user case owner password ce brie case owner case server bri speci ic ui public void throw remov ce bri server uid user case owner password ce brie case owner case server bri speci ic ui public void throw start envi uid user case owner password ce brie case owner case server bri speci ic ui public void throw stop uid user case owner password ce brie case owner case server bri speci ic ui public void throw updat case remot ce bri server wi uid user case owner password ce brie case owner ce compon bri le properti es case ani denti method respond case server bri speci ic ui declar public class extend alli descript thrown case server request ir ce fatal error member summari field public detail nest hold wrap constructor public construct spec messag public construct speci ed messag public construct speci ed messag method public string return messag nest public void messag public void messag stack trace speci fi stream ps public void messag stack trace speci fi nt pw field detail public nest hold constructor public construct messag public construct speci ii messag messag public construct speci ic messag nest messag nest method public return dii messag nest member summari method inherit class wait method inherit class class public pri nt te messag class public prim te messag stack trace speci ed stream ps class ps stream public prim te messag stack trace ed pri nt pw class pw li nt declar public descript compon sh ch compon execut method public lit ce compon method execut fast fi ni ti method return ei return ni case compon call ni si readi start context handl context ng state chang valuei ni public int member summari method public int instruct compon public int instruct compon resum public int instruct compon start public int instruct compon stop public int instruct compon suspend instruct compon resum method execut fast method return ei return toi ng case compon call si readi start context handl context ng state chang valuei public int instruct compon start method execut fast ce start method return ei return ve case compon call wi start ve context handl context ng state chang valuei public int ce compon stop method execut fast ce stop method return ei return toi gi case compon call stop compon context handl context ng state chang ce valuei public int instruct compon suspend method execut fast sh method return ei return case compon call suspen si si suspend context handl context ng state chang ve valuei declar public class descript super class compon event constructor public int creat compon ce compon state kei kei compon member summari constructor public creat compon compon state method public string return kei compon public string return ce compon public int return state compon member summari method inherit class wait compon state current state compon method public return kei compon kei compon public return compon compon public int return state compon state compon declar public er descript li compon state method public void call state compon chang event ng state compon member summari method public void call state compon chang declar public descript superclass ce compon packag full ned si field descript public static final textual fi eld grant access member summari field public static final descript textual declar public class iv implement alli seri descript wrap jar andi member summari field protect activ protect protect protect protect kei protect mobil protect transient monitor public static final public static final public static final public static final public static final public static final public static final protect persist protect constructor public load compon speci creat ner kei method public creat compon base cach speci jar public date return date current jar public date return date latest chang public date return date public byte return spec compon byte arrai public return spec compon stream public string return url compon ii jar public string return kei compon public properti return public byte return compon public boolean return true compon declar mobil public boolean return true compon declar tent persist public static load ni stream public load ly save copi ner public void merg content gi public void empti jar cach public static void save seri ali output stream public void save compon protect void set chang date ner protect void set date public void set tor ner monitor public void set compon public return clone jar public return clone compon public string return ng ner public void te compon member summari method inherit class member summari tor field activ protect protect protect protect kei protect kei mobil protect monitor protect transient tor public static final public static final public static final public static final public static final wait member summari le public static final tent public static final persist protect boolean ent protect constructor public throw load compon speci creat compon wit gi kei method creat compon se url jar compon kei compon kei method public creat throw illeg creat compon base cach speci loader class loader compon newli creat compon public return date current jar latest cach date public return date latest chang public return date date public return speci compon byte arrai byte arrai compon public return speci ani stream ii ut compon public return url al ii ner jar fi url jar fi le compon public return kei compon kei compon public return properti es properti es ce compon chang date jar url ori speci ce compon date jar fi de valu show tent le public return compon compon arrai byte public return true compon declar mobil true compon declar public return compon declar tent persist compon declar public static throw load ser iri gi ii ut stream servic order load load method ani stream ch case read kei kei load ce compon load case public load throw load ly save copi ce er loader class loader compon newli load compon public void merg content gi en ner sc merg public void jar cach public static void throw save er output stream servic order save save method sb save os output stream save save public void throw save compon er compon save protect void set chang date chang date protect void set date ce ner date public void set monitor monitor public void set compon ner ce compon public return clone jar er public vi return clone compon er public return er class er public es jar compon ifi turn ii updat declar public extend constant descript speci ii envi speci method compon mai envi state compon compon access type ts local control ni server envi ronment execut properti es read set modi ii compon stationari properti es modi ii compon local speci fi ed properti follow case server server member summari method public void add ali compon event speci ic ce compon public void add ali context event public void creat add compon base jar fi le spec compon public string jar ce compon public byte jar entri jar compon public string search speci kei local public string search speci kei local properti li st public string search speci kei properti li public string search speci kei properti li public proxi public int return state public string search speci kei properti li st public string search speci kei properti li st public void load add save compon ani stream public void regi ce public void reset envi save state public void schedul compon remov public void remov compon serv envi public void remov li ce compon event speci ic compon public void remov ali context event public void resum ce compon public void save state envi case public void set properti speci ic properti li st public void set state public void set properti speci fi kei ry public void perform shutdown envi wi public void schedul compon public void stop compon public void schedul compon public void suspend compon public void ce default bri server public void serv member summari field inherit interfac constant member summari serv method public void throw add ali compon event compon kei kei compon li ten listen li add compon speci ii public void add add ali context event listen li add public void throw creat add compon base jar speci compon url jar creat public le compon jar public jar entri le compon jar entri jar entri ed entri public search ed local properti li st method return null properti found kei properti kei valuei local properti li speci kei public search speci ic local properti li method return default found kei properti kei def default valuei local properti li speci kei public search properti speci method return null properti found kei properti kei valuei le speci ii kei public search speci ic st method return default found kei properti kei def default valuei le speci ii kei public ce regi proxi public int return state state public search properti wi speci properti li method return found kei properti kei valuei speci ii kei public search properti speci properti li method return default found kei properti kei def default valuei speci ii kei public void throw load add save compon put stream ii ut stream load load public ter factori factori iti face ed compon public void throw reset save state ll shutdown data wi lost reload fai led public void schedul compon remov public void throw remov compon envi kei kei compon remov compon speci ii public void throw remov ali compon event compon kei kei compon remov listen li remov compon speci ii public void remov ali context event listen li remov public void throw resum ce compon kei kei resum event reason compon speci ii public void throw save state envi case method envi ronment shutdown save fai ed public void set properti ed properti li kei properti kei properti public void set set state ve state chang call state modi yi return ve cate state modi state state public void set set properti ed ari st kei properti kei properti public void throw perform shutdown envi ut ng data lost led public void schedul compon public void throw stop ce compon kei kei stop event reason stop compon speci ii public void schedul compon public void throw suspend compon kei kei suspend event reason compon speci ii public void synchroni throw bri default ce br ii case method wi envi shutdown public void declar public class direct descript superclass ce context event packag full li ed context event constructor public member summari constructor public member summari method inherit class wait serv declar public class extend alli descript thrown context enc fatal error member summari field public detail nest hold wrap constructor public construct spec messag public construct speci ed messag public construct speci fi messag nest method public string return messag nest public void messag public void messag stack trace speci fi stream ps public void messag stack trace speci fi nt pw field detail public nest hold constructor public construct speci fi messag public construct speci messag messag public construct speci messag messag nest method public return dii messag nest member summari method inherit class wait method inherit class class public pri nt te messag class public prim te messag stack trace speci ed stream ps class ps stream public prim te messag stack trace ed pri nt pw class pw declar public descript li event context method public si ad rst creat newli ad compon public si remov creat compon remov member summari method public void isi ad envi public void isi remov envi declar public descript compon ce compon face class context regi andi compon request method public invok creat ce compon kei compon creat face ii ce member summari method public object invok creat compon declar public descript er event method public regi public ter member summari method public void invok regi ter public void invok ter declar public descript compon wi request proxi ts context vi ce compon regi ter ter ce regi order compon proxi method public void add li proxi li ce repres proxi ter listen object ce public void remov li proxi listen li object remov member summari method public void add eli proxi public void remov li proxi public object repres proxi public object repres proxi public void ce repres proxi public repres proxi ii null regi public throw repres proxi regi wai timeout regi ce regi return null number mi wai ter ii regi fi public void repres proxi declar public interfac descript wrap case order make atom ii provi except si method public void abort public void order acknowledg complet successfulli tp ant acknowledg member summari method public void abort public void nt order acknowledg complet successfulli declar public interfac ian descript wrap case order make atom ii provi except face method public void method ts acknowledg complet successfulli public void method ant vote ant favor arrai ant tp arrai parti favor member summari method public void dii tor call method parti ii nt acknowledg complet successfulli public void dii tor call method parti ii nt vote parti ii tie declar public interfac descript wrap case order make atom ii provi except parti citi face method public void throw except call ni readi start tc refer except public boolean throw except call vote true abort except member summari method public void call readi start public boolean call vote parti packag class summari class start compon st ti creat start ce load suspend ce compon ce envi move synchroni server stop compon ce envi ronment envi ronment stop stop ce compon ti remov ce envi ronment serv ii bri stop stop serv iv compon server suspend serv ii compon ng serv iv case stop compon envi ronment super class start event super class stop event super class suspend event stop compon updat declar public class extend descript start compon fi creat constructor public member summari constructor public member summari method inherit class wait declar public class extend descript start ronment load constructor public member summari constructor public member summari method inherit class wait declar public class extend descript suspend compon envi move synchroni server constructor public member summari constructor public member summari method inherit class wait declar public class extend descript stop ment constructor public member summari constructor public member summari method inherit class wait declar public class extend descript stop stop compon ti remov envi bri constructor public member summari constructor public member summari method inherit class wait declar public class extend descript stop stop compon server constructor public member summari constructor public member summari method inherit class wait declar public class extend descript suspend ce compon case constructor public member summari constructor public member summari method inherit class wait declar public class extend descript stop compon envi constructor public member summari constructor public member summari method inherit class wait declar public class extend direct descript super class start event constructor public member summari constructor public member summari method inherit class wait declar public class extend direct descript super class stop event constructor public member summari constructor public member summari method inherit class wait declar public class extend direct descript super class suspend event constructor public member summari constructor public member summari method inherit class wait declar public class extend descript stop compon updat constructor public member summari constructor public member summari method inherit class wait packag class summari protect ac ns remov compon ce compon load ce compon compon ns ng ce compon ng ce compon envi ronment remov ce compon ce compon ng ce compon ng ce compon envi remov serv iv ng sti ng ce compon ng ce envi ronment synchroni shutdown envi ronment ng ce compon suspen ce compon envi declar public extend descript protect field descript public static final textual fi eld grant access member summari field public static final descript textual ng declar public interfac ng extend descript remov compon field descript public static final member summari field public static final descript declar public interfac descript compon field descript public static final member summari field public static final descript declar public interfac ng descript ng compon field descript public static final member summari field public static final descript declar public interfac extend descript compon field descript public static final textual fi eld grant access member summari field public static final descript textual declar public extend descript compon field descript public static final textual fi eld grant access member summari field public static final descript textual declar public extend descript compon si field descript public static final textual fi eld grant access member summari field public static final descript textual declar public interfac nt extend ng descript envi ronment field descript public static final textual fi eld grant access member summari field public static final descript textual declar public interfac descript remov compon field descript public static final member summari field public static final descript declar public interfac ng descript compon field descript public static final member summari field public static final descript declar public extend descript ng compon field descript public static final member summari field public static final descript declar public interfac ng descript compon field descript public static final member summari field public static final descript declar public ronment extend ng descript envi field descript public static final textual fi eld grant access member summari field public static final descript textual declar public ng extend descript remov ce compon field descript public static final member summari field public static final descript declar public extend descript envi synchroni field descript public static final textual fi eld grant access member summari field public static final descript textual declar public interfac ment extend ng descript shutdown field descript public static final textual fi eld grant access member summari field public static final descript textual declar public interfac descript compon field descript public static final member summari field public static final descript declar public interfac descript compon field descript public static final member summari field public static final descript synchroni ronment declar public interfac ronment extend ng descript field descript public static final textual fi eld grant access member summari field public static final descript textual legend present class andi packag li st ts order method constructor sort model style il excel book java develop nest class face alli shown ii packag class superclass extend ch extend object class thread schedul ii cate modi fi constructor symbol modi er symbol return type method declar type ti blank constructor method sort nest class li member modifi abstract nal fi nal protect constructor field constructor object runnabl schedul void void schedul void void throw void throw object run le lin con tan descrip tion callback void er void compon descrip tion con tan activ inact initi initi resum resum en object en object mobil object tor start stop stop suspend suspend descrip tion descrip tion mobil monitor void throw tion void void void object en object han lin permiss han mission permiss han object de permiss han classload classload throw tion class throw ion nn descrip tion han descrip tion ion permiss descrip tion boolean void iron object object object run run lin men descrip tion descrip tion descrip tion run descrip tion descrip tion object en object men descrip tion throw exc ion tran action string throw tion void throw ion void throw tion boolean void string string void void string tain er string string throw tion string string void string void void throw ion erti erti string void string void object void string string string string throw tion throw ion throw tion throw tion string throw tion string throw ion void throw tion void throw tion void string throw ion void stop throw ion void string string throw tion ep ion detail stop object han lin listen permiss object er le string int han descrip tion listen er void permiss descrip tion activ throw tion boolean boolean tain kei tain er string throw tion xt con tan throw tion void boolean mobil mon monitor boolean void void throw ion void throw tion string throw tion void void void void tain er strip tain er strip void servic con ext void throw ion void void throw ion string string string object object void throw ion void void throw ion void void throw ion void throw ion void void throw ion void throw ion void string void void string void throw tion void stop void stop throw ion void void throw ion void throw ion void tion detail pa pa pa er iron er iron en object en object er void void servic en iron en descrip tion object void void void void object object throw tion void shutdown iron men descrip tion run object suspen en run object en syn iron en tran tran tran en descrip tion stop event po suspen ny descrip tion su ps syn en iron en descrip tion tran tor void void ant tp tran nn void void tran void throw ion boolean throw tion object
IR/1580 5 optim activ learn sampl estim error reduct nichola roi robot carnegi mellon pa usa andrew mccallum lab henri pa usa abstract paper present activ learn method directli optim expect futur error contrast popular techniqu aim reduc version space size method popular learn close form calcul expect futur error intract approach made feasibl sampl approach estim expect reduct error due label queri result data set reach high accuraci time fewer label exampl compet method introduct tradit learn method set paramet train data activ learn framework learner freedom select data point ad train set activ learner begin small number label carefulli select addit exampl request learn result carefulli exampl request activ learner aim reach high perform label exampl activ learn invalu common case limit resourc label obtain label difficult cohn al describ statist optim solut problem method select train label ad train expect result lowest error futur test exampl develop method simpl regress problem question answer close form task model optim select effici found close form wide activ learn method attain practic optim criterion uncertainti sampl select current learner lowest freund select exampl reduc size version space size subset paramet space correctli classifi label tong koller support vector machin method base reduc version space size method directli optim metric learner ultim learner expect error futur test exampl uncertainti sampl fail select exampl high label doesnt learner bulk test distribut reduc fail spend effort elimin area paramet space effect error rate method immun select mccallum nigam exampl paper present activ learn method combin world method select optim criterion error rate futur test solv practic problem sampl estim describ method framework document classif appli form classif gener sampl describ implement term naiv techniqu appli learn method increment train support vector machin method estim futur error rate entropi posterior class distribut sampl unlabel posterior probabl probabl class sampl unlabel exampl round activ select label sampl unlabel ad train set sampl estim result futur error rate seemingli daunt sampl made effici number rearrang care sampl effici increment train procedur underli learner show result document classif comparison reach full perform number train exampl optim activ learn sampl estim optim activ learner label exampl incorpor result lowest expect error test set unknown condit distribut output fy yn margin distribut learner label train consist iid input pair drawn estim classif function input produc estim output distribut pd write expect error learner pd pd loss function measur disappoint differ true learner pd common loss function log pd arg max pd markov activ learn aim select queri label ad train learner train result set lower error concern activ learner larg unlabel exampl sampl queri chosen pool pool finit set estim paper sampl approach error estim choic queri estim expect error full measur sampl pool true output distribut unknown sampl estim current learner log loss result estim error entropi learner posterior write label document log loss pd jp pd pd loss pd jp max pd make true label unknown current learn classifi estim distribut true label pd expect calcul calcul estim error fy yn averag weight current classifi pd pd current learner estim true label loss function learner select exampl maxim sharp learner posterior belief unlabel exampl select dramat reinforc learner exist belief unlabel exampl unsur select instanc label reason label consist learner prior belief major unlabel exampl algorithm consist train classifi current label exampl unlabel pool candid label request add pair train set ii classifi enlarg train iii estim result expect loss equat equat assign averag expect loss weight current classifi pd select label unlabel gener lowest expect error exampl implement algorithm ineffici thought order reduc varianc estim creat train set sampl replac label set averag result posterior class distribut section detail rearrang number optim approxim make algorithm effici learn algorithm algorithm effici increment train cost ad train set entir set naiv event count increment svm effici procedur learner effici algorithm increment exampl pool increment part comput redon chang result addit train instanc naiv svm exampl algorithm permit ad candid queri train error exampl effect candid train set case mean simpli skip exampl candid skip exampl featur overlap featur candid invert exampl featur list make extrem effici pool candid queri reduc random remov outlier criteria suboptim activ learn method make good expect error estim subsampl pool pool good estim form hundr exampl remaind paper describ naiv implement discuss relat present result data set show method significantli outperform method optim indirect queri uncertainti outlin futur work naiv text classif text classif task tremend practic interest problem machin learn involv unusu larg number requir estim unusu larg number paramet domain obtain label data human effort read assign document categori requir larg number paramet estim small amount label data train data estim paramet larg number simpl learn model data support estim featur correl complex interact classif method perform surprisingli simplic naiv naiv perform classif algorithm text continu wide effici simpl significantli complex rare trail accuraci paper sampl approach activ learn appli learner appli naiv sake simplic explan implement experi learner item futur work naiv bayesian classifi base gener model data produc select gener featur independ class text common variant naiv unord word count multinomi gener word word dictionari word jy paramet prior probabl class written jy probabl gener word multinomi class written jy jy probabl gener ith jx ik jy ik kth word document probabl document gener class jx jx ik jy jx ik jy maximum posteriori paramet estim perform ratio jy jdj jx jv jvj jdj jx jdj jx jy jdj number time word occur document jx indic variabl document label fast naiv updat equat show pool unlabel document estim chang classifi error label document order candid pool unlabel document train classifi jp time classifi jp document perform classif queri larg document pool reduc total number classif advantag data structur naiv classifi effici retrain classifi relabel unlabel document recal equat class probabl unlabel document product word probabl label comput class probabl unlabel document make approxim modifi word probabl product equat propag word probabl word put label gain substanti comput save compar retrain document classifi learn train data add document label train data updat class probabl class unlabel document jx jx word probabl word probabl denomin divid multinomi previou classifi product hand side numer multipli word probabl result ad put label document multinomi divid equat multinomi numer obtain rapidli increment ad word term numer denomin ad count rest numer jy jdj jx jx jv jvj jdj jx word count word put label document label probabl put label label probabl remain unchang obtain smoother posterior naiv activ learn method reli obtain accur class posterior classif procedur naiv violat independ overli sharp probabl win class close lose class probabl close address problem approach varianc bag origin label train set size train set creat sampl time replac origin learner creat classifi procedur repeat final class posterior instanc unweight averag class posterior classifi round queri train set bag put label document temporarili ad bag turn region uncertain classif case classifi sampl give answer posterior individu classifi complet bag posterior smooth reflect true uncertainti approach shown necessarili reduc overfit give posterior probabl interest aspect approach appli dont give class posterior probabl distribut classifi paramet unclear sampl distribut classifi previou work relat relat work section detail relat work cohn al statist activ demonstr construct queri maxim error reduct minim learner varianc advantag fact learner minim expect error expect sum squar error learner minim varianc learner estim distribut estim expect varianc learner queri solut expect varianc text classifi difficult comput construct queri maxim pool queri cohn al queri approach contrast seung al unlabel data present learner learner queri sampl pool lewi gale present uncertainti sampl algorithm greatest uncertainti predict label freund al show uncertainti sampl converg optim classifi quickli algorithm method reduc error learner instanc label minim size version space consist label exampl explicitli determin size version predict label unlabel gener draw probabilist version distribut concept version space predict label exampl arriv label predict label approach exampl version space part compar probabl data effici logarithm desir probabl error number made lier tadep winnow learner text dagan natur languag process algorithm differ estim error al simpli estim disagr point select view mont carlo method estim label distribut label data ab bag boost approach maxim classifi accuraci test data approach suggest maxim margin train accuraci test data approach success algorithm approach fail maxim margin unlabel queri singl instanc smallest margin mccallum nigam extend earlier approach disagr metric approach classifi level disagr unlabel chosen dagan suggest probabilist measur base mccallum nigam explicitli measur disagr diverg pereira recogn error metric measur impact label document classifi uncertainti unlabel document factor document densiti error likelihood uncertain document outlier document densiti rough heurist specif text directli measur impact document label predict label tong koller activ learn support vector machin text classif svm approach reduc classifi uncertainti estim reduct version space size function queri instanc explicitli reduc version space implicitli reduc futur expect error activ learn techniqu make strong assumpt linear separ data similar approach al examin activ learn minim expect error nearest neighbor classifi approach similar respect loss maxim expect util minim error loss function smooth label distribut bag tong koller describ method activ learn learn paramet net posterior similar expect error equat slightli loss function averag loss estim loss maximum posteriori distribut method learn good joint distribut instanc advantag creat gener necessarili lead queri discrimin model result newsgroup domain set experi ken lang articl evenli divid usenet discuss group perform experi perform binari classif experi class data remov usenet header binari data word form contigu sequenc alphabet charact word remov stoplist common fewer document mccallum nigam featur select stem perform result vocabulari word result report averag trial data set document split train set test document test activ learn random queri document random uncertainti sampl document largest label document greatest disagr predict measur weight document number sampl method introduc paper document maxim reduct total predict label equat error equat number bag algorithm initi label class document unlabel randomli sampl larger pool unlabel document candid label error metric comput put label remain unlabel document sampl figur show activ learn process vertic axi show classif accuraci test queri result report averag trial solid grai line show maximum accuraci unlabel data label sampl algorithm reach maximum accuraci queri reach point time maintain lower accuraci remaind queri interest compar document chosen algorithm initi label document chosen document chosen sampl algorithm tutori time ten document chosen algorithm faq time high incid highli inform document initi phase quantit suggest learner behavior intuit sampl perform essenti random explan perform interest result real activ learn algorithm run unlabel data feasibl set number ad label exampl accuraci sampl uncertainti sampl random figur averag test set accuraci sampl algorithm reach maximum compar document algorithm error bar local maximum reduc clutter newsgroup experi chosen easi distinguish difficult problem classifi newsgroup document result vocabulari size data set document split train set test document unlabel data sampl randomli document candid label sampl error measur unlabel document examin document chosen algorithm initi phase sampl averag incid faq compar intuit behavior suffici algorithm learner requir document begin achiev reason accuraci solid grai line show maximum accuraci unlabel data label sampl algorithm reach maximum accuraci algorithm reach accuraci time slowli job categori domain set experi data set collect lab job categori data set document job descript categori educ engin categori number ad label exampl accuraci sampl uncertainti sampl random figur averag test set accuraci sampl algorithm reach maximum compar document algorithm error bar local maximum ken subcategori data set collect automat spider compani job open label hand select engin job articl engin oper document remov job rare stoplist word experi train naiv classifi distinguish job categori remain data point averag trial job averag job categori sampl algorithm reach accuraci maximum accuraci document job categori data set easili similar accuraci achiev document random region interest evalu domain initi stage shown figur algorithm catch sampl algorithm reach high accuraci quickli summari unlik earlier work approach aim maxim expect error reduct directli pool unlabel data estim expect error current determin impact potenti label request expect error reduc varianc error estim averag learner creat sampl label data approach compar exist number ad label exampl accuraci job categor sampl uncertainti sampl random figur averag test set accuraci job categori distinguish job categori sampl algorithm reach accuraci compar document random algorithm statist techniqu comput reduct error close approxim reduct error repeat sampl attempt bridg gap statist activ learn recent work mccallum present result newsgroup domain job categori domain result show sampl algorithm outperform exist algorithm achiev high level accuraci fewer label queri requir naiv implement approach complex compar exist algorithm shown number optim approxim make algorithm effici tractabl comput complex number queri decid favor fewer requir human loop human label typic requir label time comput activ learner select larg pool document result present typic requir comput time queri algorithm unlabel data gener pool candid iter initi fairli restrict pool candid pool time algorithm consid anytim algorithm techniqu perform strongli number ad label exampl accuraci job categor sampl figur magnifi view averag test set accuraci job categori distinguish job categori sampl algorithm reach high level accuraci algorithm model complex complex paramet region relev perform data set situat activ learn method base version space reduct expect work expend effort exclud portion version space impact expect error plan extend activ learn techniqu support vector machin recent work poggio describ techniqu effici increment updat svm appli approach acknowledg author support lab work author andrew ng advic suggest fernando kamal simon tong pedro domingo provid valuabl feedback suggest earlier version anonym review refer queri learn strategi boost bag intern confer machin learn sampl select probabilist classifi journal artifici intellig bag predictor machin increment decrement support vector machin learn advanc neural inform process activ learn statist model journal artifici intellig bayesian averag classifi overfit problem intern confer machin learn select sampl queri algorithm machin boost maxim margin learn ensembl proc fifteenth nation confer artifici intellig text categor support vector learn relev featur european confer machin learn sequenti algorithm train text classifi intern confer research develop inform retriev activ learn text categor nation confer artifici intellig ri diverg measur base shannon entropi ieee transact inform select sampl nearest neighbor classifi sixteenth nation confer artifici intellig comparison event model naiv text classif workshop text emploi em activ learn text classif proc fifteenth inter confer machin learn gener search artifici maximum entropi text classif workshop inform filter distribut cluster english word acl queri annual acm workshop comput learn theori support vector machin activ learn applic text classif proc seventeenth intern confer machin learn activ learn paramet estim bayesian network advanc neural inform process
Agents/1581 1 configur manag system joseph robot carnegi mellon pa robot carnegi mellon pa katia sycara robot carnegi mellon pa abstract heterogen distribut system present challeng configur manag issu problem alloc agent launch remot agent monitor runtim statu manag comput resourc effect present retsina configur describ agent infrastructur servic assist system administr monitor heterogen distribut agent system distribut network comput environ introduct manag alloc statu ten softwar agent oper requir network comput environ complex task part problem li call connect find comput resourc match agent configur requir solv problem matchmak techniqu automat match descript agent requir runtim environ descript resourc offer comput control system inher solut difficulti anticip descript repres agent alloc host comput author acknowledg contribut matthew earlier exhaust implement configur manag program cm design research sponsor part darpa grant offic naval research grant permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee canada copyright acm problem monitor runtim statu monitor avail platform run singl point control uniform logic interfac add complex problem paper present retsina configur attempt address problem system configur manag matchmak agent descript descript comput platform launch execut agent control agent dialogu provid system administr fast accur knowledg runtim statu ma administr configur comput load time administr real avail descript comput launch run agent architectur retsina configur manag organ architectur server instal comput automat launch comput start server profil describ host comput receiv request launch agent oper paramet profil repres featur execut environ requir agent version path interpret virtual graphic type resolut screen profil encod xml permit structur data field server receiv request launch agent request arriv form xml environ descript environ descript definit environ launch command line specif launch agent comput server translat xml descript execut shell script batch spawn agent launch client system administr singl point control distribut system client profil describ figur graphic interfac agent launch target machin agent profil repres requir host specif launch environ path environ command line gener client match merg host platform descript agent profil descript figur illustr client interfac top left box show host profil top box show agent profil profil entri expand reveal detail host platform agent user select agent launch repres larger icon user select agent client show comput assign larger icon user assign agent assign bottom box show alloc runtim statu facilit launch agent web ad launch launch wait paramet tabl client discov server servic discoveri protocol dynam server discoveri process client awar current avail agent platform part servic discoveri protocol part retsina agent dramat simplifi manag agent log agent launch order rel agent figur illustr agent discoveri occur appli manag agent applic consist compon retsina applic work reason reduc overhead match agent comput matchmak techniqu match agent resourc descript profil describ comput platform launch match techniqu toler arbitrari descript figur infrastructur discoveri agent requir profil chang ad hoc time show agent discoveri ma configur manag wai permit ma administr maintain knowledg comput platform run comput reduc number paramet pass agent agent discov infrastructur agent servic matchmak agent discoveri cm elimin depend agent start wait agent depend runtim crash needless featur render agent system robust failur crash final featur work involv human interfac ma cm interfac make easi user visual identifi comput assign identifi agent run comput interfac make easi user identifi runtim statu offer command agent suspend heterogen multiag agent written comput control singl irrespect oper system remot execut environ host comput interest system resolut heterogen ma configur manag problem critic feel model begin address issu refer davi smith negoti metaphor distribut problem solv artifici januari williamson internet intern joint confer artifici intellig august lu dynam servic matchmak agent open inform environ journal acm sigmod record issu semant global inform sheth march
DB/1582 3 logic program semant logic program base partial evalu stefan urgen dix present gener approach comput logic program semant disjunct program result interest special normal program framework consist semant semant defin abstract weakest semant satisfi bottomup method base oper work condit fact concentr paper set abstract properti import unfold partial evalu properti defin semant extend wf gcwa mention fit comp schlipf stabl introduc rajasekar captur framework comput program residu program show origin program gener condit semant static queri respect semant answer basi residu program complet wf gcwa leav dept rheinau germani address correspond jurgen dept comput colleg maryland stefan school inform north pa complet extend version paper present intern confer logic june journal logic program fl elsevi scienc avenu ny introduct normal lot disjunct number possibl explod overview disjunct introduc power framework analyz defin comput semant base elementari program transform requir rule evalu delet rule bodi semant delet tautolog rule chang mean essenti step classic logic program semant clark complet stronger nonmonoton deduct semant wf import transform unfold evalu neg bodi liter trivial case approach semant comput consequ respect semant main result standard semant gener close world assumpt gcwa weakest semant elementari transform meant inform ground liter truth obviou simpl transform undefin model show natur wf gcwa disjunct transform defin disjunct extens call disjunct counterpart wf good properti natur import transform definit exemplifi method semant depth case work set program transform definit semant studi fit version comp clark complet schlipf wellfound case semant stabl captur transform rule interest result appli idea slightli modifi framework import space chanc semant semant unknown show subset transform semant minim model syntax approach contribut comput semant develop comput semant elementari show normal call residu construct elementari transform logic program residu program consist condit ground rule posit bodi liter condit fact result delai neg bodi liter evalu logic program delai liter attach deriv condit fact studi gener tp reduct introduc bry disjunct case main result relat comput elementari program transform consequ residu program origin program semant elementari program transform semant instanc stabl model semant normal disjunct semant static stationari semant satisfi condit comput residu program preprocess origin ground posit bodi liter neg bodi case wf truth ground atom trivial decid base residu fact occur rule ground atom undefin stabl model remain evalu techniqu directli result semant transform chang ad atom true model subsect import properti extens recent method niemel simon comput stabl model wf quadrat locat level stabl properti comput wf harm set stabl model restrict form cautiou pai comput viewpoint origin develop program transform declar semant satisfi natur prove complet result respect appli program comput normal form directli work calculu transform confluent termin normal form uniqu termin transform work detail refer reader articl final mention relat work transform approach consid abstract properti speed queri evalu main focu program transform make explicit disjunct inform process residu program partial evalu studi paper structur section introduc abstract notion logic program semant defin elementari program transform paper defin semant weakest abstract semant transform end section explain method defin semant fact appli semant section develop queri evalu algorithm base condit fact residu program give altern residu program gener infinit program program function symbol section main result show comput semant abstractli semant prove fact residu program reach origin program mean elementari transform uniqu determin normal comput residu program preprocess step semant prove nice semant subset transform term minim model conclud section proof evalu liter truth model semant transform claim import properti comput stabl model effici comput stabl model npcomplet polynomi algorithm substanti claim subject futur research section explain relat semant establish classic semant program gener close world assumpt posit disjunct program show result give nice classic wf comput properti shortli discuss section give short summari outlook futur work section proof delai appendix abstract semant transform disjunct datalog program fix finit signatur semant part ground instanti claim semant assign mean program instanti variabl shorthand denot ground program compact mean semant work proposit program comput ineffici comput ground instanti program make variabl rule occur posit bodi liter rule variabl bound constant true manag ground program complet instanti program rule instanc possibl true bodi liter rule instanc posit bodi liter match deriv final clarifi requir work fix finit signatur signatur program transform chang set occur syntact base theorem instanti program finit import fruit lead nice theori practic avoid infinit loop note arbitrari wellfound semant highli undecid captur semant construct transform rule semant assumpt real shown semant framework gener arbitrari disjunct program introduc rule rule transform rule contrast rule test appli program decid similar local procedur introduc easili gener handl infinit proposit program subsect assumpt suitabl properti ensur feasibl essenti restrict framework definit logic program finit set rule form bm cn variabl rule identifi rule tripl consist set atom fa fb bm fc cn write set logic program denot lp definit possibl true write rule oper arbitrari infinit proposit program full instanti respect set ground atom occur rule head logic program semant definit logic program semant gener simpli assum semant map logic program set pure ground disjunct call disjunct deduc simpli mean follow semant includ instanc stabl model defin set model logic program simpli deduc ground disjunct true model semant assign program complet order pure disjunct follow complet pure disjunct consist posit neg atom neg liter time mix question interest deduc pure ground ffl nonground formula deduc logic program ffl natur assum impli impli semant freedom decid conjunct impli disjunct impli suffic impli ground liter ffl pure disjunct differ logic program system automat theorem prover conclud impli interest answer queri static semant unfold long impli pure unfold transform consequ logic unfold bodi liter yield logic program program impli rule true program static semant program static semant long pure disjunct minim model program ffl defin paper disjunct extens wellfound semant standard semant normal program defin set posit neg ground liter conclud program natur extend disjunct case posit neg ground disjunct larg part theori depend exact definit consid real framework subsect definit semant map assign logic program lp set pure disjunct ground liter satisfi disjunct atom write gener practic semant fit framework argu point definit fact closur logic consequ program semant conclud semant close logic consequ prove bad strang semant begin stronger start weak requir basic definit note notion semant restrict main underli signatur addit occur program addit constant effect avoid problem relat program transform base discuss abstract properti logic program semant requir elementari transform chang semant logic definit program transform binari relat instanti logic program sake ground logic program semant part requir definit semant complet defin valu ground program note program transform elementari delet singl tautolog rule make simpler prove semant transform shown rewrit system consist transform termin confluent definit call transform transform iff ground program semant transform import transform partial evalu oper principl partial evalu consid sakama seki partial ground normal logic unfold simpli mean replac posit bodi liter bodi rule liter head rule unfold rule rule origin rule replac result program case disjunct treat disjunct context unfold liter rule head formal definit definit ground program result ground program unfold iff rule fbg fi fi rule weak version elimin origin add result definit ground program result ground gram weak unfold iff rule fi fi rule properti tautolog influenc semant logic program note tautolog impli fact program order deriv mean disjunct rule impli subsum disjunct irrelev properti correspond principl requir delet redund rule definit ground program result ground program elimin tautolog iff rule fa cg lemma semant unfold elimin weak unfold proof unfold liter tautolog unfold weak unfold give rule head fbg reproduc insert hold fb bg fb bg explain hold transform delet rule stronger rule rule transform semant normal program case disjunct delet rule rule satisfi semant interpret definit ground program result ground program elimin rule iff distinct rule fa cg requir deriv rule head evalu bodi liter delet rule posit reduct replac rule head definit ground program result ground program posit reduct iff rule fa cg logic program atom rule bodi entir rule delet neg reduct definit ground program iff rule true fa cg notion reduct introduc normal program disjunct program turn applic principl reduc size program liter decid true introduc interest combin elementari definit ffl combin weak elimin tautolog ffl combin transform ffl combin transform ffl combin transform semant transform weak unfold redund lemma ffl transform chang minim model note properti make semant gcwa defin posit resp normal class program close transform definit disjunct semant space abstract semant transform show uniqu determin weakest semant definit call semant weaker semant iff program lemma set semant order complet lattic proof partial order denot program pure fi fi fi fi upper bound greatest lower bound comput standard powerset union resp intersect set easi check result map semant definit introduc notat weakest semant bottom element definit disjunct semant defin posit ground disjunct true neg ground disjunct lemma sem set semant transform proof ground program sem greatest lower work lub theorem transform uniqu weakest semant transform proof simpli greatest lower bound semant transform lemma construct proof denot transit closur transform construct clear invari transform semant properti deriv definit semant defin weakest semant elimin tautolog posit neg weakest semant transform note point semant failur defin promin semant stabl simpli requir properti strong clear semant consist weak semant note restrict finit signatur essenti section reduct infinit program consist singl rule infinit ground defin program deriv program ground instanti consid program finit mention definit rule deriv framework defin semant conclud section note method defin semant fact gener idea defin space candid semant map logic program satisfi minim requir semant order relat select number good properti semant import properti inherit greatest lower bound semant satisfi automat satisfi properti form consid program transform chang relat deriv order comparison program semant properti defin semant map assign logic program set herbrand model condit atom occur interpret consist set herbrand interpret semant stronger iff defin order show captur introduc transform rule definit ground program result ground program elimin contradict iff rule fa cg ground program result ground program appli iff atom mean classic entail view proposit theori atom elimin contradict mean elimin rule contradict mean atom classic program classic atom safe ad program formal properti semant strong classic logic state proof found theorem theorem theorem theorem stabl weakest gcwa weakest semant posit disjunct program satisfi posit neg elimin tautolog stabl weakest semant arbitrari disjunct program satisfi posit neg elimin tautolog elimin contradict weakest semant program satisfi posit neg elimin tautolog elimin tautolog import ingredi captur semant transform hold special case success failur definit appli program rule success remov posit occurr bodi rule appli program atom occur head rule failur remov rule posit bodi theorem theorem theorem weakest fit semant comp defin weakest semant program satisfi posit neg reduct tabl overview semant transform entri mean properti mean hold includ entri posit neg condit hold semant list properti semant semant domain clark comp ffl ffl ffl ffl fit comp ffl ffl gcwa po ffl ffl ffl ffl ffl po ffl stabl di ffl ffl ffl ffl ffl wf ffl ffl ffl ffl ffl ffl ffl strong wf di static di ffl ffl ffl strongli conjectur interest result achiev modifi basic requir semant possibl properti result techniqu paper remain refer program transform queri evalu section explain comput normal form call residu program contrast longer work instanti program bind variabl avoid flounder approach base notion develop bry idea delai evalu neg bodi attach condit deriv fact definit condit fact rule posit bodi form cm ground atom necess ground automat restrict comput deriv condit fact usual fixpoint comput condit simpli store condit fact addit argument deriv fact union condit fact match bodi liter instanc neg bodi liter rule demonstr semant introduc disjunct appli oper ad fact disjunct context implement techniqu suggest consequ oper gener condit fact definit consequ set condit fact tp ni fb fi fi fi ground instanc bm rule cond fact illustr idea fact deriv condit fact appli rule condit rule lemma oper tp monoton continu lattic set condit fact order proof proof standard case comput smallest fixpoint tp start iter tp happen finit predic constant build ground atom occur condit finit subset atom head oper tp idea condit fact work bry program relat approach normal semant reduc program neg liter applic reduct logic program rule posit bodi liter step queri evalu algorithm simplifi mean posit neg elimin rule lead reduct oper set condit fact gener reduct studi definit condit set condit fact head iter oper total number atom occur reduc process end program applic evalu applic delet rule end definit logic call residu program oper tp resembl fit oper program differ oper condit appli program empti program deriv fit oper leav undefin notion residu program straightforward defin semant implement point view construct evalu definit defin map logic program set pure ground disjunct defin semant turn semant subject section verifi map lemma map satisfi condit semant lemma set condit result reduct phase invari elimin rule posit neg reduct impli confluenc set condit fact implement import reduct fact perform sequenc discuss data structur altern reduct phase critic reduct phase standard fixpoint gener infinit case tp oper nice properti standard defin program infinit ground instanti solv problem give altern construct residu program base insight reduct oper posit disjunct atom longer possibl true definit set condit fact set pure ground write posit disjunct neg ground liter reduct respect defin fi fi definit pure set condit defin oper deriv pure ground disjunct pure ground lemma oper monoton standard powerset theorem show construct definit residu program theorem logic main result section introduc framework defin semant abstract map program semant domain studi elementari program transform set section construct bottom procedur comput normal form program show section approach close relat prove comput semant ident semant sound complet algorithm result appli semant transform show nice relat subset transform minim model possibl definit semant residu program program sound residu program comput semant unfold elimin appli part theorem fact construct set deriv condit fact construct ground instanti program appli weak elimin tautolog hold program lemma semant unfold elimin tautolog automat weak corollari impli condit semant unfold elimin hold program semant unfold elimin transform weak condit appli comput impli condit fact preprocess step algorithm comput arbitrari handl ground program posit bodi liter semant addit elimin rule posit neg applic reduct oper chang semant program corollari yield residu hold program residu program reach ground instanti appli elementari transform introduc section corollari residu semant unfold elimin tautolog posit neg program semant definit semant impli sound algorithm show direct theorem result show sound comput stabl model transform origin program residu program stabl model stabl model semant theorem corollari result independ exact definit map logic program semant domain comput stabl model residu program residu ground liter decid true element valid consequ stabl semant hard remain stratifi residu program simpli set uniqu stabl model perfect model queri answer basi residu program complet stabl algorithm good treat gener ineffici simpler case algorithm profit comput residu program preprocess phase algorithm remain work comput stabl model disjunct clark applic prototyp implement static semant consist comput residu program algorithm treat remain hard case gener algorithm ineffici appli directli origin good evalu neg bodi liter remain residu program gener algorithm treat posit bodi liter variabl relat minim model defin semant stabl relat transform minim model interest stress import transform show semant unfold elimin elimin rule minim model syntax program requir program minim model defin minim definit model logic program set ground liter ground instanc bm cn rule fb bm cn fa model treat distinct unrel atom true model correspond classic model introduc predic predic replac trick refer detail investig definit model program minim model set neg posit liter strict subset definit minim model inspir construct static minim interpret fix notion stabl model defin minim model total ground atom theorem notion semant descript set deriv condit lemma program oper tp correct condit fact logic consequ condit fact logic consequ minim mean logic consequ satisfi transform unfold elimin tautolog elimin rule chang set minim model trivial elimin tautolog logic chang set model lemma minim model program minim transform direct proven show pair distinct ground program irreduc respect interpret minim model theorem minim semant unfold elimin elimin rule satisfi program set minim model confluenc rewrit system consist weak elimin tautolog elimin rule immedi transform chang set minim model rewrit system ground program irreduc program comput set impli condit fact theorem appli elimin rule long irreduc program set minim model ground program reach irreduc program appli irreduc program question confluenc termin investig semant defin residu program return comput simpler stabl directli answer residu program complet algorithm order prove theorem interest theorem residu ground program residu program invari elementari program transform consid paper corollari satisfi unfold elimin tautolog posit neg reduct proof mean defin semant residu extend arbitrari program automat satisfi properti ensur defin map semant notion simpl notion import note model model support model model hold normal model defin lemma suffici condit model model program residu fp rg rg herbrand model corollari immedi semant requir properti weakest semant miss corollari true head note corollari exact corollari formul unfold posit neg elimin tautolog rule transform final note theorem corollari immedi confluenc closur logic consequ prove close logic consequ order restrict model residu program ensur model origin program mention hold support model residu program support model kind model definit interpret normal model program iff minim model atom disjunct fact true lemma normal model normal model theorem logic program pure ground disjunct implic meant respect notion model treat interpret construct proof consist cumul section show interest properti residu nice comput implic comput stabl model disjunct stabl model fa ident make ffl step comput stabl ad disjunct true properti notic case schlipf theorem case mean pai comput wellfound semant polynomi comput stabl level higher polynomi result simplifi program main techniqu emploi fastest method comput stabl model lemma condit impli cg addit cg proof obviou definit corollari semant proof lemma cg cg cg cg residu program sound transform disjunct stabl model gener theorem schlipf formul program theorem theorem cumul semant program ident stabl model note strengthen assumpt cumul condit hold comparison approach compar semant standard semant program disjunct stabl model semant static semant gcwa posit disjunct note semant defin arbitrari program restrict datalog program appli procedur part turn wf gcwa restrict class program semant defin strictli weaker disjunct stabl semant static semant mean deriv fact gener conclud nice standard semant import contribut paper simpl algorithm comput model residu program comput implic consid section relat semant import note semant theorem ground program model properti proven unfold consid possibl unfold immedi theorem worth mention wf corollari model residu program equal model origin program result immedi framework residu due simpl easi prove standard semant semant gener semant disjunct program theorem extend program ground liter nice standard corollari wf weakest semant satisfi elimin elimin rule posit neg reduct elimin rule semant comput wellfound model subsect point note simpl algorithm comput model residu corollari program posit ground liter wf neg ground liter wf head relat disjunct stabl semant stabl model semant invari theorem ground program set stabl model stabl semant fact select model directli determin set impli pure ground disjunct turn semant defin section stabl model stabl semant transform defin weakest semant immedi weaker equal stabl approxim consequ consequ stabl conclud corollari weaker logic program hold stabl model perfect show strictli weaker stratifi disjunct weaker stratifi disjunct logic program due semant leav undefin perfect model semant conclud requir semant depend applic conclud notr similar due mean mean mean cancel reserv journei direct comparison perfect model semant disjunct program unfold destroi stratif case disjunct program happen destroi stratifi perfect qg rg strong model introduc similar strang behaviour demonstr fp pg strong model deriv gcwa perfect model semant counterexampl theorem show unfold slightli modifi definit order avoid counterexampl remov asymmetri deduct rule modifi semant unfold appli bodi liter logic program stratifi naiv appli definit perfect find program perfect model stabl model semant stabl model program relat static semant static semant defin arbitrari theori autoepistem logic belief larger class class disjunct logic program conjectur time static semant restrict domain disjunct logic program pure ground disjunct consequ neg liter translat static semant directli assum disjunct belief liter disjunct logic program static semant static semant behav similarli gener belief theori express form restrict class belief theori queri disjunct logic program turn strictli weaker static semant failur conjectur note logic program residu follow follow static minim true static semant impli implic clear true minim true static semant transform consequ restrict pure posit pure neg approxim static static relat static semant investig relat gcwa gener close world assumpt gcwa defin posit program program neg bodi transform appli introduc neg liter easi gcwa gcwa minim satisfi elimin tautolog elimin rule theorem posit neg reduct trivial applic posit program corollari mean gcwa set minim posit disjunct easi gcwa case theorem extend posit program neg ground liter requir neg liter arbitrari pure origin definit gcwa declar set neg liter deriv set deriv posit disjunct true minim model section theorem remain true posit ground disjunct comput neg pure disjunct neg make deriv program hold minim model call follow idea simpl residu program comput declar subsum weak version disjunct wf gcwa elimin rule program remov disjunct conclud argu applic interpret negat ground atom assum head applic rule defin defin similar version call simpli replac reduct oper weaker version remov condit definit reduct set condit head case origin reduct oper total number atom occur reduc step process end finit step definit residu logic call weak residu program definit semant defin oper definit weakest semant elimin posit neg reduct turn elimin rule import block assumpt negat elimin tautolog show origin corollari applic easi show directli reduct oper posit theorem extend posit program posit ground disjunct neg ground liter semant program order comput elimin rule corollari program posit ground liter wf neg ground liter wf head theorem definit immedi ground program rewrit system nice confluenc program irreduc program fpg qg weak residu comput properti make short comment comput aspect approach investig comput residu program detail disjunct program program queri evalu algorithm handl program delai neg ground liter condit import featur approach delai comput understood sourc code level special data structur improv understand correct method algorithm strong relat classic altern fixpoint comput wf restrict condit fact head liter bit indic bodi manag version true fact possibl true fact loss recomput condit fact step reduct phase optim start comput true comput possibl true fact combin reduct exponenti deriv condit fact rare circumst wf comput polynomi accept comput complet residu program residu program intermedi step comput stabl exponenti growth big stabl semant solut avoid exponenti invent chen warren delai neg posit liter depend delai neg liter idea adapt practic algorithm comput model program present algorithm consist appli transform posit neg rule special case transform linear complex algorithm provabl van gelder altern fixpoint oper interest result framework lead effici algorithm interest posit neg reduct oper evalu delai posit bodi liter trivial case correspond fixpoint fit oper theorem implement wf delai posit liter lead problem posit current solut eleg effici approach present problem simpli occur import optim approach interleav comput deriv condit fact reduct ground atom deriv condit fact immedi evalu delai bodi liter number ground atom true improv order comput predic depend comput residu program local strongli connect compon program stratifi delai neg bodi liter standard confluenc result optim chang order applic transform variant rewrit techniqu make program disjunct program research depend semant transform stabl semant violat properti comput present gener approach defin semant disjunct logic program simpli postul properti appli framework set method restrict handl comp stabl subsect investig result semant turn extend wf strong relat przymusinski static similar weaker disjunct stabl model abstract definit develop queri evalu algorithm import note definit partial evalu instanti bottomup procedur work program comput residu program semant properti semant properti disjunct stabl semant static prove valid comput semant clear procedur link set declar transform rule approach base notion condit develop independ bry delai neg bodi liter implicit queri evalu algorithm nice level program level implement approach greatli enhanc gener understand algorithm detail hidden real understand difficult byproduct standard wf weakest semant unfold elimin posit neg reduct similar result hold comp suitabl subset transform appli directli program comput residu program effici wf comp queri answer immedi residu program ident definit underli reason confluenc topic investig articl simpl prototyp approach algorithm subject futur research interest appli framework result disjunct stabl semant anonym valuabl comment hint refer aravindan phan dung correct unfold transform normal extend logic program journal logic septemb jurgen mauricio osorio confluent rewrit system logic program semant technic report tr depart comput rheinau octob stefan brass jurgen dix gener approach comput disjunct semant nonmonoton extens logic lnai page stefan brass jurgen dix disjunct semant base partial evalu leon int conf logic page mit june stefan brass jurgen dix disjunct stabl semant partial evalu journal logic abstract stabl semant partial evalu intern page lnc stefan brass jurgen dix disjunct wellfound confluent calculi iter gcwa journal autom abstract confluenc iter gcwa logic artifici jelia page lnc gerhard brewka jurgen dix knowledg extend logic program gabbai handbook philosoph volum chapter reidel stefan jurgen ilkka teodor przymusinski comparison static disjunct semant implement principl knowledg sixth intern confer san morgan tr koblenz stefan jurgen teodor przymusinski super logic program principl knowledg intern confer page san morgan stefan brass udo gener queri evalu alain claud georg advanc technolog int number page springer colin raymond subrahmanian mix integ program method comput deduct journal novemb stefan brass improv queri evalu posit disjunct bernd bei workshop disjunct logic program disjunct page springer stefan brass queri evalu extend deduct universitat fachbereich bry logic program formal applic proc eighth acm symposium principl system page bry negat logic formal construct logic dimitri inform system artifici integr page springer stefan ulrich burkhard freitag comput model jurgen lui moniz teodor extens logic program number page chang richard lee symbol logic mechan theorem prove academ static semant program transform comput nonmonoton extens logic lnai page keith clark negat failur gallair logic page david warren effici comput queri semant journal logic chen david warren goal orient approach comput semant journal logic chen david warren comput stabl model integr logic queri process ieee transact knowledg data chen david warren tabl evalu delai gener logic program journal januari jurgen ulrich ilkka niemela nonmonoton effici calculi implement andrei voronkov alan handbook autom reason jurgen dix framework repres semant logic program principl knowledg intern confer page san morgan jurgen dix semant normal logic strong properti fundamenta jurgen dix semant normal logic ii weak properti fundamenta jurgen dix semant logic intuit formal properti overview andr fuhrmann han action inform essai logic philosophi artifici page dung fixpoint approach declar semant logic program el ra north american confer usa mit octob dung natur semant logic program negat el ra confer foundat softwar technolog theoret comput springer jurgen dix martin muller implement semant disjunct logic program fring abstract properti lui moniz pereira logic program intern page juli mit press jurgen dix martin muller axiomat framework repres semant disjunct logic program pascal van int conf logic page june jurgen dix martin muller partial evalu relev approxim stabl semant ra int symp methodolog intellig lnai page springer jurgen dix mauricio osorio semant suitabl aggreg jan logic intern page mit jurgen dix mauricio osorio provabl closur logic program instituto intern symposium comput scienc page jurgen dix frieder stolzenburg framework incorpor nonmonoton reason constraint logic program journal logic special issu constraint logic guest kim marriott peter stuckei fit semant logic program journal logic michael gelfond vladimir lifschitz stabl model semant logic program kowalski confer logic page mit michael gelfond vladimir lifschitz classic negat logic program disjunct gener abstract logic program classic negat intern logic program page mit michael teodor przymusinski extend close world assumpt relationship parallel circumscript principl michael teodor przymusinski relationship minim model minim herbrand model semant intern journal intellig yong hu li yan yuan extend model semant gener logic program int conf logic page june david peter divesh srivastava magic set evalu model vijai int symposium logic page june jack minker indefinit close world assumpt confer autom page springer jack minker rajasekar fixpoint semant disjunct logic program journal logic ilkka niemela simon effici implement wellfound stabl model semant joint intern confer symposium logic page septemb mit press teodor przymusinski semant disjunct logic program deduct claud michael deduct int conf number page springer teodor przymusinski stabl semant disjunct program gener comput abstract extend stabl semant normal disjunct logic program intern logic program page mit teodor przymusinski static semant normal disjunct logic program annal mathemat artifici jorg jack minker weak gener close world assumpt journal autom kenneth ross semant disjunct logic program intern confer deduct object orient page kenneth ross rodnei topor infer neg inform disjunct journal autom john schlipf formal logic logic program annal mathemat artifici john schlipf express power logic program semant journal comput system wf branch bound stabl model ieee transact knowledg data sakama seki partial deduct disjunct logic declar approach logic program synthesi transform meta program lnc page springer sakama seki partial deduct disjunct logic program journal logic allen van gelder altern fixpoint logic program negat proc acm symposium principl page acm march allen van kenneth john schlipf semant gener logic program journal ulrich stefan burkhard freitag improv altern transform approach proc int conf logic program reason number page proof theorem section lemma map satisfi condit semant proof variabl complet instanti comput condit fact condit fact comput base input phase comput result residu program ident possibl weaken obviou definit true reason result residu program disjunct fact true residu program ae case atom deriv disjunct fact head liter present head reduct oper introduc head head mean lemma set condit result reduct phase invari elimin rule posit neg reduct proof proof induct number applic oper comput prove slightli stronger induct addit prove reduct step prove assum induct show impli condit fact delet appli reduct oper delet head oe head hold addit rule mean differ neg bodi liter evalu true occur bodi liter head evalu true evalu true oper possibl rule fnot ag elimin rule rule delet bodi delet true applic reduct oper delet head oe head appli induct hypothesi reduct step appli induct hypothesi iter final appli induct hypothesi applic proven half induct proposit lemma oper monoton standard powerset proof posit mean hold neg mean case ffl ffl condit weaker replac superset theorem logic proof clear number occur liter irreduc respect lemma standard construct finit fixpoint reach mean mean prove proof theorem goal show reach seri weak unfold proof simpler care condit fact restrict rule prove stronger eleg result exampl illustr hope result hold fq rg unfold replac rule note tautolog sourc deriv simpli elimin tautolog unfold step order avoid deriv critic condit fact program appli tautolog condit fact tautolog occur intermedi result unfold contrast evalu bodi liter time unfold bodi applic yield result lemma ground logic program rule bm addit rule result bm ad rule proof simplifi case real neg bodi liter move head distinguish make predic symbol disjoint posit rule appli disjunct fact result disjunct fact fb fb distinguish case show condit fact deriv case fill hole case natur idea deriv disjunct fact appli rule fb fb enter bm result fb fb fb fb simplifi assum order hole treat case assum loss simplifi notat appli rule bm enter bodi liter result fb fb gener disjunct fact insert fb fb fb fb fb check fb fb simplifi fb combin rule tautolog assum case express current situat loss enter rule result fb fb fb gener disjunct fact insert rule bm insert result fb fb fb fb fb fb fb check duplic bodi term fb fb entail fb fb result effect total correct result combin rule tautolog elimin result explain assum case remain hole case simplifi appli rule bm insert result fb fb fb appli rule insert construct disjunct fact construct disjunct fact result fb fb fb fb fb fb fb result ffl ffl ffl duplic bodi atom effect fb make combin rule tautolog appli fb fb fb fb fb note ffl ffl ffl order express case current situat result disjunct fact ffl ffl ffl ffl appli rule case natur risk result appli rule case result insert result fb fb fb directli rest intermedi result simpli carri lemma instanti logic program rule bm condit fact bm proof deriv rule condit fact theorem fact construct set deriv condit fact construct ground instanti program appli weak elimin tautolog hold program proof construct ground instanti weak elimin tautolog note finit restrict appli weak unfold directli applic weak delet newli gener result appli condit fact ad rule set deriv condit fact lemma lemma mean gener condit fact condit fact rule bn appli condit fact result fb appli bodi fb bn appli insert delet rule posit bodi liter appli unfold order delet tautolog delet immedi tautolog unfold posit bodi liter gener rule bodi liter bodi liter vanish rule introduc unfold occur posit bodi liter elimin note rule creat program due phase set condit fact rule remain proof lemma lemma theorem lemma program oper tp correct complet condit fact logic consequ view classic condit fact logic consequ minim mean logic consequ satisfi proof consequ oper tp condit fact similar oper ident case posit logic program defin logic program posit logic program translat rule bm cn cn bm atom predic symbol disjunct fact deriv translat back condit fact atom occur rule particip resolut correct complet comput disjunct fact logic consequ comput minim disjunct fact respect view fact set lemma minim model proof unfold appli atom rule fbg order show minim show minim model model vice ffl model minim combin rule logic consequ model ffl minim model rule possibl fbg violat rule bodi liter includ true head liter interpret minim model model differ truth model violat rule head model assign independ truth valu posit neg truth rule rule result unfold contradict assumpt violat unfold rule violat rule mean true fbg violat combin fbg assum model show minim model show direct minim model minim model direct complet analog interchang minim model shown model smaller model minim model smaller equal smaller shown model contradict assum minim lemma distinct ground program irreduc respect unfold elimin rule interpret minim model proof unfold applic rule posit bodi liter consist condit fact program condit fact program condit fact distinguish condit program contradict irreduc respect elimin loss gener assum condit fact interpret neg liter posit liter true model condit fact satisfi condit fact occur minim model smaller equal violat condit fact neg bodi liter interpret interpret posit liter switch true remain theorem minim semant unfold elimin elimin rule satisfi program set minim model proof semant elimin tautolog elimin rule logic program set minim model result elimin rule theorem minim model chang unfold elimin tautolog elimin minim model minim model minim lemma minim model program elimin elimin rule transform chang set minim model proven lemma transform chang model proof theorem lemma ground logic program result weak elimin tautolog elimin proof condit fact deriv deriv case lemma minim model transform transform chang model lemma minim condit differ condit fact result remov fact shown lemma theorem residu ground program residu program invari elementari program transform consid paper proof lemma proof posit neg reduct miss show resp intuit reason neg bodi liter attach condit fact deriv rule directli indirectli evalu true deriv impli condit evalu result condit fact rule delet disjunct fact true easi show induct number deriv step condit fact satisfi neg liter evalu true easi show induct number deriv step condit fact fcg vice condit fact fcg lemma yield proof lemma theorem lemma normal model normal model proof show ground program consist interpret normal model normal model elimin tautolog elimin rule weak unfold chang set unfold chang set minim model lemma transform introduc head condit atom occur head interpret stronger satisfi automat satisfi disjunct fact delet stronger disjunct fact posit reduct neg bodi liter delet rule posit reduct make rule model occur rule head smaller model satisfi model contradict assum posit reduct make addit restrict interpret neg liter stronger result form neg reduct rule delet disjunct fact true normal model make negat atom automat model smaller model model contradict minim remov rule addit restrict stronger corollari show induct length deriv normal model result induct step theorem logic program pure ground disjunct proof show construct normal model disjunct neg ground rule head ffl iff head ffl iff head model minim model smaller equal normal model lemma model model head disjunct posit ground liter disjunct fact true ffl iff head ffl iff head neg bodi liter queri subsum disjunct interpret model smaller minim model clear normal model model satisfi proof theorem section theorem ground program model proof altern fixpoint construct model immedi show semant properti minim model syntax rule applic fundament sp construct minim model specif interpret neg theorem applic show wf elimin elimin rule weak unfold lemma show semant posit reduct neg liter evalu true rule head note interpret satisfi minim model minim model prove set neg ground liter minim model interpret neg liter satisfi fixpoint fixpoint altern fixpoint oper defin impli fixpoint consist requir hold fixpoint rule iter make interpret neg ident minim model consist minim model consid applic ident fixpoint opposit fixpoint fixpoint shown analog proof neg reduct similar note neg reduct simpler case gener suffic singl neg liter minim model interpret theorem extend program ground liter proof wf transform conclud corollari model residu program equal model origin program result note transform introduc problem wf defin program write set ground liter special form residu easi show wf direct fixpoint head atom fact order prove semant make ground atom show fi fi head fixpoint fact negat atom assum deriv atom head complement program wf wf theorem ground program set stabl model proof stabl model semant minim simpli select minim model total consist theorem applic show stabl elimin elimin rule weak unfold lemma proven properti unfold independ establish posit neg liter evalu true stabl model occur rule model smaller model model assum stabl minim stabl model clear model smaller model model contradict minim neg rule delet fact true stabl model model smaller model model contradict assum minim stabl model model smaller model model contradict minim theorem extend posit program neg ground liter proof posit program posit neg reduct construct residu reach weak elimin tautolog elimin rule transform chang set minim model chang neg liter assum gcwa suffic residu program case set minim posit disjunct assum minim gcwa assum disjunct aa interpret make atom true aa minim model smaller minim model true assum gcwa
DB/1583 3 group data integr sattler gunter saak depart comput magdeburg po box germani abstract data integr requir varieti applic data inform system integr make great demand featur deal overlap inconsist data data manag system todai provid limit concept deal requir gener concept group aggreg fit paradigm current issu data common form group number problem remain unsolv extens concept introduc year function aggreg group exist extens group oper simpl deriv valu meet requir data integr applic gener interfac group aggreg part sql complex instanc integr data mine algorithm discuss languag primit common applic illustr approach introduc concept duplic detect elimin approach implement optim issu consid introduct year number applic common characterist integr larg data set gain focu research practic includ integr inform driven grow number sourc relat inform global scope www local scenario depart compani make inform uniform inconsist redund data level view data requir similar requir exist prepar data data analyt process step data mine onlin analyt process exampl includ inform prepar data subscrib inform problem homogen data commun mobil system common problem mention applic scenario elimin duplic data conflict identifi attribut valu duplic exist redundantli due error input reason user public integr digit singl articl list sourc part integr view duplic elimin approach usabl varieti includ instanc prepar data data gener histogram opportun analyt data process integr featur current technolog flexibl approach base gener concept group aggreg current paradigm limit equal base group restrict aggreg power oper extend support complex relationship advanc aggreg function gener concept group introduc support holist group function great number applic possibl complex group aggreg function level extens implement present special languag extens offer optim gener base function intend final answer approach describ trade criteria motiv implement introduc special languag construct suitabl duplic elimin similar develop extens driven investig data integr requir extens present paper implement part queri languag languag power queri oper address problem integr transform heterogen data suitabl platform build framework data prepar integr concept introduc implement top exist dbm extens interfac section give overview relat work field extend queri process field duplic detect elimin section give detail descript exist problem motiv approach basi current implement extens aggreg group oper introduc section basic semant section concept special approach group explain detail section discuss implement optim issu section paper end outlook section relat work approach paper intend data integr scenario relat topic run entiti advanc concept group aggreg relev research field analyt data process paper illustr approach problem entiti identif duplic elimin problem discuss extens research area inform system integr data clean inform dissemin earli approach base equal attribut valu deriv valu newer research result deal advanc requir identif base similar approach includ special algorithm applic method area data mine machin learn interest result specif applic instanc digit librari overview problem relat entiti identif lim al describ equal base includ overview approach list requir entiti identif process mong elkan describ effici algorithm identifi similar tupl entiti identif reconcil figur similar base duplic elimin base distanc measur build transit cluster galharda al framework data clean sql extens support data clean issu duplic elimin cluster similar relationship express languag cluster strategi deal transit conflict al slide window approach duplic identif neighborhood conserv kei deriv describ effici implement close relat similar base entiti identif integr probabilist concept data manag data integr issu problem probabilist approach verifi yield result whirl system languag cohen similar data access datalog integr data heterogen sourc import extend concept group aggreg inform integr hellerstein al aggreg support commerci ibm informix system translat code recent version approach call usag data mine discuss extens classic group sql import extens data cube oper present support commerci system introduc variabl rang group qualifi red function support predefin aggreg cumul aggreg olap vendor provid similar concept motiv section inform introduc approach extend group aggreg describ problem common standard extens made year illustr motiv concept focu problem duplic common applic mention approach limit specif problem equal base duplic elimin standard featur scenario mention section sophist solut requir deal inconsist convent typic heterogen environ assum instanc data model resolv approach implement part system featur deal conflict detail duplic elimin consid process illustr figur consist entiti identif reconcili entiti identif group object potenti describ object creat mind similar criterion strategi step deriv relationship remain number entiti entiti separ tupl deriv sampl data evalu user domain knowledg qualiti measur tune step design phase entiti reconcili step group found entiti identif input deriv integr object repres group merg sum sale number product busi addit knowledg integr instanc data qualiti aggreg function concept reconcili task step highli order support similar base duplic elimin system provid concept describ characterist step discuss level requir address current technolog languag offer suffici solut support oper gener concept group aggreg power framework handl integr issu describ shortcom exist oper requir extens group standard equal base process tupl identifi group tupl belong deriv valu tupl implicit explicit relationship tupl true current extens function deriv valu domain relat attribut simpl usag select rc weather group rc complex relationship instanc transit symmetr fit requir special algorithm data includ domainspecif knowledg goal offer wai separ gener aspect common task data integr approach queri perform duplic elimin bibliograph record sourc describ similar criterion strategi build group select dblp union springer union ncstrl group transit similar isbn threshold similar criterion probabilist logic express function advantag domain knowledg method instanc common data type advantag knowledg semant attribut string vector distanc measur longer text field keyword list edit distanc deal shorter string appli case exploit domain fact abbrevi written function implement function compar valu tupl return float valu deriv distanc measur usag isbn compar valu equal return tupl similar evalu logic express threshold similar relationship strategi establish relat requir build group case simpli transit closur similar relat strategi detail basic concept section exist approach offer declar wai handl mention capabl deal kind data inconsist grow level access data overlap kei issu futur inform system concept present extens relat queri languag queri basic applic wai access present includ data extens group aggreg group duplic identif aggreg reconcili depend heavili problem domain rare case simpl aggreg function suffici reconcili support group aggreg function gener concept extens group aggreg basi provid function applic domain aggreg consid current sql standard document support commerci system ibm knowledg group address sql simpl group attribut olap extens sql enabl usag predefin function group paramet queri languag support implement extern class written java interfac class consist public interfac ¢ void init boolean iter object result £ begin process method init call tupl iter method invok final result obtain class instanti relat aggreg store function deriv repres group valu repres concept implement regist creat aggreg return extern languag java concept aggreg implement detail group distinguish case assign tupl group base equal attribut tupl time group membership comput attribut valu assign tupl group base attribut compar current member group group depend comparison decid group membership differ group address group group usual approach sql extend enabl arbitrari express group paramet group implement express includ invoc extern function section group support base group problem group membership tupl determin tupl relat process discuss section group constant process group split merg due similar relationship tupl function implement class public interfac ¢ void init boolean iter void finish void void £ mean method process perform step start step input relat init method call initi tupl process invok iter method final finish method call group partit number group assign tupl fix project aggreg appli individu group method navig group return group identifi navig tupl return tupl identifi group group identifi illustr principl function group function build group tupl gap float valu column ¤ greater basic repres special case creat transit closur simpl similar easili implement optim obviou figur group store tupl retriev actual tupl step special treatment group express addit select group context group provid direct implement similar group motiv section form gener framework implement kind group introduc section serv gener view explain semant introduc concept section semant extens group aggreg section sketch semant oper extend standard relat algebra gener group oper group function reconcili function figur illustr applic oper input relat consist column ¤ group similar valu ¤ section result group group reconcili function deriv singl tupl figur applic group oper function requir assum relat schema defin signatur bool hold function appli tupl time return true tupl belong group holist function test membership group perform context relat extend version function depend relat bool kind function comput transit closur part binari similar oper base group function defin group oper iff true reconcili function signatur consist list aggreg function max introduc section result tupl tupl type input relat function denot reconcili group gener function reconcili function final defin group concept group implement commonli oper util exist order group attribut hash tabl deriv group membership find relev group add tupl creat group relev group found process tupl group membership fix properti tupl gener concept group introduc paper requir complex comput looser similar introduc simpl strategi build group gener framework algorithm outlin shown fig iter process input relat consid framework ensur iter order impact result group creat group add group group figur framework similar group oper fulfil requir relat semant burden implement discard specif applic relax major differ group part hidden possibl complex determin relev group naiv implement instanc requir comparison analyz deriv distanc measur resolut conflict involv complex modif group structur split illustr concept similar base group introduc section repres special gener group declar group tupl similar optim approach section select group ¢ transit strict £ similar threshold usag similar measur introduc section tupl similar express evalu tupl consid return express threshold base group build strategi figur group transit strict similar simpl strategi introduc illustr figur depend applic scenario closur strategi build group simpli transit closur tupl group strategi result big group potenti tupl conserv strategi strict demand similar tupl group split group case conflict unlimit number strategi specif similar relationship consid approach cluster classif share common result group process depend input repres holist function respect framework present implement transit closur strategi outlin fig group tupl group threshold add break endfor endfor return merg group figur naiv algorithm similar group tupl find group tupl similar similar criterion group simpli merg group build transit closur strict strategi check tupl group conflict group conflict match group strict strategi conflict handl complet split group tupl group implement impli complex realist applic scenario section discuss optim implement optim understand implement optim issu kind scenario concept integr data exist applic data inform meta search engin web applic requir data volum user expect perform support system integr platform time complex naiv implement introduc concept section prohibit scenario mention provid effici implement index structur speed integr heterogen deal index support index support reli current research work field index structur support similar commonli index structur hash support equal match hash structur hash function appli deriv actual threshold scalar valu similar detect consid rang rang deriv threshold predic specif distribut present approach effici search string similar edit distanc limit deriv threshold approach data integr reason support deriv trie support instanc token index abbrevi invert longer text attribut techniqu area inform retriev appli global index versu autonomi integr major problem fact integr system remain autonom data access integr layer physic store sourc system index structur speed integr question store main memori cach secondari creat maintain creat fly updat index structur sourc open index interfac focu data integr scenario view integr index structur creat fly main memori usag exist index structur sourc system persist storag mainten integr system subject futur research dedic solut group open possibl appli index optim strategi avoid gener cost comparison tupl equal base duplic elimin optim develop similar usag group similar criterion attribut valu implement approach limit similar measur strategi build group group techniqu cluster data requir extens transform expr disjunct normal form find predic conjunct result conjunct result index support predic involv attribut endfor ni predic group tupl threshold remov break endfor endfor endfor return figur algorithm find relev group sketch algorithm fig group base gener framework section optim avoid evalu nest loop appli lookup relev group input set iter id titl year odb manifesto odb manifesto oodbm manifesto odbm manifesto null null group found creat group index lookup predic group found creat group index lookup predic figur build group appli index support evalu merg evalu add tupl handl conflict similar express initi transform disjunct normal form predic check index support iter conflict manag ident framework present section requir addit build index fly evalu conjunct index support predic process result set possibl relev group predic index support intersect previou evalu input simpl loop assum index evalu return group approxim constant size independ cost loop constant result complex threshold truncat evalu express limit search index support predic shortcut util parallel chang complex algorithm reason simplic simpl select ncstrl union dblp union union group transit similar threshold similar measur repres edit distanc support trie index lookup algorithm similar match index support simpli accept miss valu differ valu year figur queri process sketch build group data set involv conflict resolut assum threshold translat edit distanc titl match edit distanc previou tupl relev group found conflict resolv merg group strategi transit similar gener concept implement optim burden implement task common applic merg split support implement framework offer basic function primit implement group base sort hash detail express intermedi result appli express sort order simplifi partit relat group nest loop approach applic gener case result optim linear order attribut group slide window approach mention present group oper implement languag extens shown section top commerci system system support call pipelin tabl function accept cursor paramet return tabl featur oper implement tabl function process cursor input similar express threshold return relat group time complex special select tabl context cursor implement function algorithm fig requir type declar function implement approach lack support usag approach group open broad rang applic disadvantag higher complex develop group function focu solut similar group implement top vice versa group group function common tion implement packag cartridg modern system kind sql simplifi develop aggreg group function make implement function transpar queri processor queri optim process issu subject futur work outlook data reconcili import task data integr kei issu data reconcil aim identifi elimin duplic tupl repres object common problem context match tupl decid base equal attribut valu similar criteria identifi group potenti describ realworld repres object group chosen paper present extens queri address problem open mechan appli function group special languag construct top context awar group build group similar tupl context awar group approach leav burden implement complex group function implement special construct similar group effici implement complex group function merg tupl identifi group perform aggreg function advanc group aggreg form power framework data reconcili part extend sql queri appli applic scenario improv system util extend cartridg present extens implement part feder queri engin languag context languag concept advanc data reconcili plan sql implement group aggreg function order support declar function establish basi optim group queri queri part function import task util optim potenti applic set similar function dedic index cach parallel properti requir function account queri optim evalu refer de rosati principl approach data integr reconcili data wareh intern workshop design manag data ka ross queri multipl featur group relat tm ap nl proc int conf larg data base mumbai page morgan cohen integr heterogen common domain queri base textual similar haa sigmod acm sigmod intern confer manag june page acm dei sarkar probabilist relat model algebra acm transact septemb fuhr probabilist datalog logic power retriev method eighteenth annual intern acm sigir confer research develop inform retriev page simon extens data clean tool jefferi philip acm sigmod intern confer manag volum page lawrenc automat citat index system acm intern confer digit page graef queri evalu techniqu larg acm comput pirahesh data relat aggreg oper gener int conf data engin page ieee comput open data integr ieee data engin stolfo problem larg michael carei acm sigmod intern confer manag page san huffman steier heurist join integr structur heterogen data aaai spring symposium inform identifi merg relat bibliograph record technic report massachusett institut februari kent breakdown inform model system sigmod decemb li knowledg gather match heterogen aaai spring symposium inform richardson entiti identif integr intern confer data page lo april ieee comput societi press mong elkan field match algorithm applic jia wei intern confer knowledg discoveri data mine page aaai mong elkan effici algorithm detect approxim duplic record workshop research issu data mine knowledg discoveri sattler data prepar framework base languag proc int engin applic symposium saak ad conflict resolut featur queri languag feder australian journal inform approxim string match ieee transact knowledg data yang probabilist approach queri process heterogen system intern workshop research issu data transact queri page wang zaniolo sql build aggreg extend relat system el ml proc int conf larg data base page morgan yan duplic remov inform dissemin intern confer larg data base page san septemb morgan kaufmann object match materi integr heterogen proc intl conf cooper inform system
Agents/1584 1 translat paradigm model program departamento de ciencia de la universidad del sur abstract softwar system evolv program system construct cooper found objectori applic cooper system difficult verifi show automat translat paradigm model proposit linear tempor logic base program interest hand declar view paradigm result translat execut specif show work verifi correct properti automat mean contribut enhanc usabl develop relat method softwar engin knowledg engin commun introduct paradigm model languag design parallel cooper system sublanguag model object coordin cooper paradigm receiv notabl attent softwar knowledg engin commun describ adapt softwar process industri mainten typic problem area describ blackboard system problem juan carlo depart electron comput scienc southampton unit kingdom area ke argu paradigm find import applic area multiag system show uml design multiag system benefit capabl paradigm work consult detail multiag coordin proposit linear tempor logic specif dynam system verif behavior correct specif verif system notabl step spin step framework system translat fair transit system behavior properti express tempor logic formula verifi deduct approach spin framework system languag repres system conceiv global state automata tempor logic formula verifi case model check techniqu approach verif base complex tempor assumpt branch focu linear time leav verif branch time issu futur explor show automat translat paradigm model obtain execut specif real system program number logic rule current state process execut rule gener inform provid paradigm model benefit expect translat tempor logic framework prove correct properti automat mean properti express queri interpret logic program knowledg base implement deduct system interpret subset cover properti discuss end articl program simul process execut trace situat interest featur design stage softwar chang paradigm translat logic studi process behavior function system requir met logic approach offer declar studi paradigm model featur contribut enhanc usabl develop relat method softwar engin knowledg engin commun paper organ section explain main concept paradigm section explain logic framework outcom translat process translat process conceptu explain section section show algorithm implement translat section show exampl verif properti section paradigm paradigm model dynam system set parallel process process model state transit diagram assign role manag manag coordin prescrib proper set subprocess subprocess tempor constraint behavior model std inherit subset state mean long subprocess prescrib achiev part complet behavior control behavior anytim result composit behavior assign prescrib subprocess perform transit prescrib subprocess sake assum process paradigm model activ trap model point execut coordin defin subset subprocess state enter state defin manag prescrib subprocess trap perform transit insid trap manag state assign set set prescrib long manag remain subprocess prescrib manag state manag subprocess manag transit assign set mean trap enter transit perform execut proce trap manag prescrib set chang behavior manag proce insid trap interest paradigm model explain tempor logic section devot introduc tempor languag specif tempor properti give short introduct tempor logic layer detail formal extend prolog tempor oper algorithm implement interpret result found conceiv dynam system paradigm discret sequenc step linear concept time order relat system evolv sequenc state σ initi state system final state sf reactiv class system paradigm equip deal state si defin set atom true state set properti θ assum hold initi state step comput σ state time refer stage system assum proposit languag lp base tradit tempor oper true futur true state simplif articl futur fragment oper past fragment ad futur interest benefit verif stage set form formula tempor languag defin induct φ atom proposit defin proposit φ true st process iff st atom st mean true iff iff iff iff iff exist φ iff foral φ languag give set form formula complex encod declar paradigm specif repres schema formula queri result tempor logic program order verifi correct behavior exampl formula framework assum set proposit cardin depend set manag prohibit larg set modular demand manag process set small give tempor logic persist semant mean proposit consid true time assert time time proposit explicit assert express time inform model proposit consid valid time time period express assert time time remain true translat outcom goal translat process produc simul behavior process includ paradigm model evolut process execut express sequenc proposit proposit sp tp true anytim process remain state anytim subprocess sp remain prescrib anytim remain insid trap tp assum proposit denot subprocess trap uniqu proposit process state subprocess prescrib remain trap program construct collect rule model aspect paradigm model dynam assert deni truth sp tp depend global execut state semant logic framework model time period proposit assert denial rule conceptu introduc section paramount import model transit manag process core system execut state paradigm process transform global execut state time gt futur global state time program model global execut state time set proposit sp tp valid global execut state restrict state transform global state manag rule model state schema set precondit hold global state gt chang po set postcondit hold global state chang note rule express chang eventu time process spend state time transit provid paradigm model respect order rule reflect order state visit rule explain extract fig show part paradigm model automat teller machin reader find detail process check magnet card person identif call process process manag figur process figur subprocess wrt manag show subset proper coordin relationship prescrib set subprocess fig show subprocess prescrib manag includ import show subprocess prescrib atm trap shown shade box model transit transit state sti chang perform sti includ subprocess prescrib chang longer sti set manag si set subprocess prescrib mi spi spi rule model transit figur subprocess wrt manag atm figur process figur subprocess figur manag process sti state chang connect verifi fig show transit subprocess prescrib fig show prescrib matter subprocess atm prescrib state chang perform express rule optim strategi kind rule found model manag transit transit state sti manag chang perform sti insid trap relat chang perform longer sti subprocess prescrib sti longer prescrib remain prescrib subprocess prescrib set trap relat set subprocess prescrib state sti set trap includ subprocess rule model transit sti transit state wait verifi manag chang perform trap enter state wait manag prescrib subprocess mean manag chang state verifi state call fig state prepar accept call fig manag state proce leav trap manag prescrib trap left includ proposit express fact longer prescrib trap left fig show subprocess remain prescrib state leav trap mean proce end job proposit rule shown express fact prescrib remain prescrib previou rule assert valid period proposit mean time manag process remain state depend valid period proposit sp tp rule assert knowledg model subprocess prescript kind rule model time subprocess remain prescrib state manag process rule express set subprocess prescrib manag remain state sti manag state si set subprocess prescrib state translat process gener set subprocess prescrib state wait verifi label cp va denot subprocess denot subprocess subprocess label gm pt belong figur show found model trap kind rule model time remain insid trap trap tp subprocess subprocess rule express insid tp set state defin trap remain insid tp long sp remain prescrib remain state sti translat gener rule express fact remain insid trap long prescrib subprocess remain state verifi check introduc kind rule produc translat algorithm rule provid coordin start process execut enabl consist simul paradigm model simul perform suppli initi global simplic initi condit gener translat perfectli inform suppli user global state obtain simul process assum start state explicitli mark initi paradigm model model initi condit process start execut coordin subprocess prescrib time relat set initi state manag process init proposit hold initi set initi state process translat gener rule init init initi condit process wait initi state manag state wait impli subprocess prescrib fig init finish section warn reader program defin union rule gener translat process translat algorithm section translat process set step paradigm model input gener program output paradigm model assum inform algorithm produc program matter element paradigm model algorithm notic section transit label gener rule element includ trap relationship collect set suitabl form futur implement obtain algorithm primit algorithm input present set provid translat perform encod element paradigm assum tool construct set chosen set label denot subprocess trap differ figur label obviou easi recogn ensur uniqu manag state verifi renam state prefix denot process belong subprocess label long renam prefix process belong number subprocess denot subprocess input set finit set emp denot process instanc emp finit set man denot manag process instanc atm man finit set denot set transit process pi denot process denot transit state state process pi instanc finit set denot set subprocess prescrib manag state sti denot manag state spj denot subprocess prescrib sti instanc finit set denot set state defin trap denot trap denot state insid trap instanc finit set denot set trap subprocess spi denot subprocess denot trap spi instanc finit set set subprocess manag ei denot mj denot manag ei denot subprocess prescrib mj instanc finit set denot initi state process sti denot initi state process instanc finit set set subprocess includ denot transit state sti state denot subprocess transit instanc finit set denot set trap enter state chang manag process perform denot transit manag state sti state denot trap enter transit perform instanc algorithm step describ translat algorithm set input set gener kind rule program assum exist procedur perform output rule program variabl consid local step environ set variabl denot element variabl denot ital constant element denot ital model transit process input emp repeat ø begin te repeat ø begin se sm sm ij sm sm ij end end model transit manag process input man repeat ø begin tm repeat ø begin tp end end model subprocess prescript input repeat ø begin end model trap input repeat ø begin repeat begin tp end end model initi condit input init init algorithm run polynomi time offer proof size paradigm model input size translat algorithm function express execut time translat algorithm sp tp set subprocess trap input set deriv set obtain shown section model verif section show link output verif procedur correct initi paradigm specif show properti system verif literatur natur translat stage research involv link notion tool spin step safeti account accept atm report pin check verifi system reach state verifi stage procedur eventu reach state pin atm request verifi posit stage verifi account impli check account accept step process recurr process check pin cyclic verif process gener level function system level trap subprocess translat coupl easili verifi tempor properti altern includ system step spin mention spin base model check techniqu space state global automata explor tool restrict finit state system hand highli effici algorithm made tool industri applic step collect tool deduct approach model check support deduct system deal infinit state specif provid scalabl tool center spin work order link step work make explicit tempor relationship implicitli encod paradigm specif accomplish futur find translat paradigm show translat extend version linear tempor logic specif languag spin research support spin profit tool verifi paradigm algorithm translat paradigm model program work translat automata final input spin found flexibl languag easili encod wide rang distinct featur relat trap conjectur encod notion formal reader notic model checker deal formula oper past fragment encod notion fair transit case global case matter learnt import insight dynam involv paradigm base specif give step improv verif possibl knowledg softwar engin paradigm work introduc translat process paradigm specif input gener tempor logic base program declar dynam behavior specif program trace process interact queri system verif classic properti queri verifi correct paradigm model translat algorithm base primit prove run polynomi time test current implement prolog relat work consid oper semant paradigm semant argu compar paradigm sake semant translat execut model verif translat procedur automat obtain semant paradigm model interest issu consid work involv rule enhanc model process case real system translat extend express constraint includ paradigm model affect system dynam includ paradigm model perspect system inform order process call refer arai stolzenburg multiag system specif uml statechart aim intellig manufactur technic universität procedur translat paradigm specif proposit linear tempor logic applic verif technic depart electron comput properti reactiv step tutori formal method system logic foundat implement extens tempor prolog journal comput scienc technolog sponsor scienc technolog educ de industri mainten model fourth intern confer softwar process page ieee comput societi formal technic report universität tempor logic intern confer verif page criteria analysi coordin applic carolyn coordin model intern coordin april volum lectur note comput page de oper semant coordin paradigm carolyn coordin model intern april volum lectur note comput page model checker spin ieee transact softwar manna pnueli anchor version tempor framework linear branch time partial order logic model page springer manna pnueli tempor logic reactiv concurr system springer pnueli deduct forev invit talk formal adapt softwar process model paradigm van parallel control modular parallel commun intellig autonom page blackboard system model universität verif tool system springer intern journal softwar tool technolog
HCI/1585 4 bowman depart comput scienc virginia polytechn institut state ernst scienc architectur joseph jr comput scienc depart brown ivan soni comput scienc lab japan vol februari massachusett institut technolog volum number introduct user interfac design abstract user interfac design critic compon virtual environ applic present broad overview action user interfac discuss effect common ve hardwar devic user interact techniqu gener task tradit interact style environ divid interact task system control focu present techniqu practic guidelin interact design wide held myth discuss approach interact design applic complex interact requir present annot onlin bibliographi refer companion articl introduct user interfac comput applic standard part dition wimp devic interfac compon rapidli includ spatial input vice point devic gestur input output stereoscop project displai spatial audio haptic common problem reveal peopl inher understand space perform action free space van live act physic world cue understand constraint afford action repres accur comput simul great care design user interfac interact techniqu applic clear simpli adapt tradit wimp interact style dimens provid complet solut problem user base interact develop paper broad overview current state art user interfac interact summar major compon author includ symposium virtual realiti softwar technolog goal describ major interact techniqu interfac compon develop virtual environ provid reader practic guidelin design user interfac realworld applic impract list small fraction refer materi overview refer reader centuri continu updat annot list refer onlin bibliographi creat author member mail onlin commun research input output devic input output devic import compon build user interfac ve applic interact design understand limit devic natur intuit map interact techniqu hardwar liter hundr devic ve analysi scope paper date discuss devic group common characterist interact design criteria examin group discuss interfac design issu output devic commonli term displai describ output common displai import displai channel context user interfac visual displai roughli categor fulli devic fulli mount displai virtual retin occlud real world ment except physic object requir graphic virtual world input devic stereo virtual realiti user physic world number interfac issu displai user hand front inadvert block virtual object closer hand problem occur frequent manipul task allevi virtual object offset hand visibl problem late stereo shutter glass requir disrupt stereo effect interfac design avoid interact techniqu user move hand physic object line sight glass emitt addit visual haptic displai promin user interfac ve auditori displai main interfac goal gener type inform auditori output interfac particip virtual world substitut miss tactil haptic feedback sound substitut feel press button haptic tactil plai import compon user interfac activ area research user touch feel virtual world extrem object manipul detect bowman al volum number input devic distinct made input devic interact techniqu input devic physic tool implement interact techniqu interact techniqu map input devic question appropri input devic work techniqu input devic govern freedom input devic smaller number dof emul devic dof addit button kei input devic roughli categor base type event gener devic gener event time base user consid devic button press action signal boolean develop devic user signal contrast devic gener stream event common devic tracker transmit bend angl devic combin discret continu event form devic call combin devic exampl hybrid devic includ ring small devic worn combin ultrason track popular ve applic give user abil interact dimens speech input uniqu human voic speech nice complement input devic natur combin mode input speech input valuabl tool user hand occupi major myth speech recognit good speech recogn solv problem issu consid deal speech input comput listen voic issu user issu speech command talk person wai avoid problem implicit scheme interfac user applic speak order maintain natur speech emb exist interact techniqu user burden rememb signal applic voic command issu interact techniqu navig task navig preval user action present challeng support spatial provid comfort movement distant make navig lightweight user focu task subdivid navig motor compon call travel cognit compon call navig task gener categori explor navig explicit user simpli investig environ search task involv move target locat maneuv task movement place viewpoint advantag locat perform task travel conceptu simpl movement viewpoint locat viewpoint orient handl ve head techniqu set viewpoint posit consid common metaphor travel interact publish interact techniqu travel physic bodi motion travel environ exampl includ motion walk figur travel techniqu virtual motion physic movement travel techniqu place marker map techniqu locomot devic stationari bicycl techniqu enhanc presenc requir applic requir user experi physic exert travel manual viewpoint hand motion effect travel user pull virtual type techniqu select object center point user motion techniqu easi fatigu steer continu direct motion common bowman al travel metaphor includ techniqu steer head orient determin direct point hand orient steer techniqu gener user system handl actual movement form user jump immedi system perform transit movement start point destin techniqu simpl point view rout user path volum number system handl actual movement user manipul icon draw path map space actual environ order plan rout techniqu user control travel retain abil perform task motion design issu travel techniqu includ veloc control constraint guid aid travel bowman al perform varieti evalu bowman result quantit comparison techniqu serv basi design guidelin design travel end servic task user focu relev import guidelin user train instruct import techniqu user sophist strategi remain spatial orient travel strategi counterpart cognit process path acquir spatial knowledg build cognit map environ spatial knowledg consist survei knowledg usag acquisit spatial knowledg factor refer frame egocentr travel techniqu user receiv support ve travel individu user wide rang spatial extra freedom ve easili case ve goal transfer knowledg ve real applic environ design support transfer techniqu discuss train session easili support subdivid center support support includ factor larg visual motion support audio cue substanti impact requir research support partit structur organ cue structur organ part environ relat part good structur set legibl techniqu cue consist principl transfer ve commonli appli cue grid categori includ architectur cue natur environ cue horizon perspect studi map ve shown perform gain addit evalu perform learn content environ applic cue cue appli environ strongli relat environ support carefulli implement navig environ select manipul interact techniqu manipul ve provid mean accomplish basic object object object rotat direct hand manipul major interact modal virtual world natur physic design interact techniqu object select manipul profound effect qualiti entir ve user interfac classic approach design manipul techniqu provid user shape human movement correspond movement hand tracker select manipul figur virtual hand techniqu nonlinear map function techniqu involv touch posit orient virtual hand ve virtual hand techniqu intuit simul interact object area reach pick number techniqu suggest overcom problem techniqu extens reach nonlinear map appli hand extens user extend hand farther threshold distanc map nonlinear virtual arm map function achiev gain real virtual hand common select manipul object ve point virtual rai eman virtual hand virtual rai intersect pick manipul variat rai cast develop user select small object spotlight techniqu conic select object fall cone easili select object fall bowman al disambigu target object requir apertur techniqu conic pointer direct locat ey head hand sensor user control size select volum simpli bring hand sensor closer move farther imag plane famili interact techniqu develop extend idea techniqu provid user tool select reach virtual world altern approach user manipul rel scale virtual world earliest approach model user manipul object size techniqu handheld model ve user indirectli manipul virtual object interact wim manipul techniqu strength number attempt made integr combin featur volum number figur techniqu apertur techniqu virtual combin rai cast select manipul techniqu navig control tool exampl homer techniqu world scale grab doll varieti report interact techniqu overwhelm develop gener principl choic manipul techniqu state techniqu perform task environ depend techniqu perform base real world import implement constraint limit dof evalu virtual manipul techniqu quantifi perform import ongo research area system control system control refer task command appli chang state system mode interact issu command includ select element set similar system control object select techniqu desktop command receiv attent interact style desktop menu usabl ve basic problem ve system control task reduc effect tradit techniqu touch menu item space select menu item task import constraint physic desk rest miss evalu result techniqu ad hoc implement system control studi structur categor techniqu ve graphic menu voic command access gestur interact set access tool object implicit function hybrid techniqu exist combin type system control integr interact task due avoid disturb action main interact task user stai task interact mode ideal support easi access interfac natur spatial posit rel head placement interfac guidelin applic graphic tool strong spatial refer method seamless integr system control action multimod system control interfac access select command set function structur item achiev method commun hierarchi item design prevent mode error provid user feedback select command mode error highli disrupt action applic evalu test techniqu realist applic domain research determin perform techniqu applic applic situat interact environ common misconcept user interfac design applic world user manipul interact design space util interact interact offer number distinct advantag interact techniqu task haptic tactil displai interact physic surfac feedback creat annot tion select techniqu essenti manipul requir interact techniqu advantag interact creat interfac applic easier intuit user seamless integr interact niqu critic design physic logic perspect physic integr import make user switch devic cal integr import devic applic interact contextu inform reduc load bowman al interfac roughli categori note type physic surfac requir input characterist interfac physic surfac util categori cover applic fulli displai user physic surfac surfac piec track plastic user graphic surfac order virtual world exampl type virtual system write annot vr virtual habitat categori interfac cover applic displai workbench physic interact surfac top workbench displai user directli interact displai transpar tablet user hold hand graphic project primari displai virtual surfac tablet exampl categori system model applic physic displai surfac transpar clear tablet volum number user hold interact landscap design applic categori separ displai handheld comput lcd tablet type interfac palm pilot devic geometri control open research issu deal wireless technolog weight devic philosophi interact design techniqu guidelin present paper year work research debat effect methodolog philosophi develop good user interfac compar contrast philosophi design systemat philosophi strategi complement insight lead good systemat vice versa approach lead effect principl guidelin design artist philosophi shneiderman success user interfac guidelin user interfac softwar expert review usabl test pillar major sourc guid design macintosh human interfac guidelin interfac api provid part macintosh oper system outlin implement basic element desktop user visual guidelin tool provid design basic interfac build liber necess invent implement clear vision interfac block design user interfac product design interfac reach state matur interfac paradigm similar wimp paradigm desktop user interfac interact techniqu report literatur issu interact common vision research result combin form pictur guid interfac design design build spatial interfac reason design space user interfac larger larg portion remain unexplor design deal larg varieti input output devic technolog rapidli displai sensor requir innov interact techniqu consequ reevalu accumul design experi knowledg develop approach interfac success interfac design exist research human factor comput system interact techniqu idea develop research emploi creativ simpl approach invent interfac interact techniqu exist design model strategi interfac design exampl basic principl directli interfac design includ research interact kassel sensori multimod basic guidelin applic interfac requir error techniqu invent interfac broadli categor borrow real world base exampl realist techniqu includ exact simul physic interact human borrow area human activ movi adapt real world tool form borrow design idea user interfac magic approach involv design interact techniqu cultur carpet magic wand consciou violat user assumpt person techniqu design ad provid foundat scrutini evalu idea give rise systemat approach interfac design discuss systemat philosophi systemat approach interact design studi user exist interact characterist system affect perform approach slow increment improv perform sudden leap import compon systemat philosophi form taxonomi task gain deeper understand provid framework design techniqu evalu exist type base hierarch decomposit task list techniqu compon lend guid taxonomi gener interact techniqu design approach implement softwar interact techniqu prototyp test extrem quickli crucial aspect systemat approach evalu design evalu separ fact tightli connect iter design process standard hci context appli ve evalu design result evalu area basic evalu interact techniqu form summ abil evalu ve applic applic illustr practic usag concept earlier present applic case studi section explor complex data visual cubic complex visual system widespread applic domain automobil medic oil ga industri visual system handl massiv amount visual appli effect interact techniqu inspect manipul data tradit input devic form bottleneck interact due regular mode german nation research center inform technolog research visual led input devic call cubic cubic devic rod primari ax magnet sensor track orient posit cubic support highli interact complex data set entir devic creat viewpoint rod translat rotat object scene constrain inform formal user show comparison glove prefer cubic manipul multimod interfac ve bowman al multimod interact combin multipl input output modal volum number figur cubic provid user richer set interact compar tradit unimod interfac output modal combin sensori substitut parallel process inform basic wai combin input modal includ complementar input modal complement combin issu singl concurr input modal concurr issu command overlap transfer input modal transfer inform receiv inform inform complet multimod input style implement context visual applic multimod visual tool user view interact data set util hand gestur voic input input combin style complementar transfer remov visual tool user applic tool show place tool user concurr manipul data set visual tool issu voic command rememb import viewpoint record anim type interact present natur interfac user ve design educ architectur design tout applic area virtual environ ideal walkthrough valid applic design virtual habitat constrain design space gener design environ aim goal virtual habitat student appli principl design student virtual zoo exhibit interact design tool make locat rock locat view angl visitor viewpoint task design made student start blank environ design tool constrain task exhibit design principl good design virtual habitat exhibit complex interact user select manipul control displai inform system support type task user prefer provid wai direct techniqu action place indirect techniqu interfac displai tablet interact techniqu chosen base result experi compar manipul techniqu usabl studi shown applic perform intend domain user system complet design session hour interact research continu grow import ve complex widespread introduct issu involv design effect user interfac reader consult refer bibliographi join email mail devot discuss research area principl tradit user interfac design appli directli user interfac interact uniqu characterist requir design discuss gener principl user interfac design state base current state art area interfac place task requir product natur interact replic physic world import interact techniqu base requir applic set techniqu work situat limit requir freedom input provid physic virtual constraint guid user input advantag afford multimod input give user structur support manag complex unansw question research issu interact import unresolv issu standard interfac interact chang displai devic hmd ve support complex task larg set menu determin interact niqu work interact style affect hope overview encourag work interact user interfac applic stress research continu perform evalu usabl guidelin develop effect interfac research direct impact accept ve level user satisfact product ve applic refer sound virtual realiti media academ press maintain spatial orient travel virtual environ virtual evalu niqu grab manipul remot object virtual environ acm symposium interact testb evalu ve interact techniqu acm symposium virtual realiti softwar design anim habitat ve ieee comput graphic travel virtual evalu point motion control techniqu virtual realiti annual intern forc touch feedback virtual wilei intersci model mount displai acm symposium map usag virtual orient issu ieee virtual apertur base select virtual environ ing acm symposium user interfac softwar bowman al volum number framework interact intern project technolog workshop cubic devic input acm chi van leng interact sigchi cooper bimanu action human factor comput design evalu visual virtual environ ieee virtual legibl enhanc inform visual ieee speech input virtual environ unpublish depart comput brown multimod tion tool iast intern confer comput graphic imag highli interact model system comput theoret framework softwar tool multimod interfac john lee intellig multimod multimedia interfac aaai press move object exploit propriocept virtual environ interact acm person commun imag plane interact techniqu environ acm interact seamless interact multipl scale virtual ment acm symposium interact interact ping direct manipul vr acm symposium user interfac softwar centuri annot bibliographi user interfac centuri virtual handwrit vr virtual realiti annual intern ing transpar prop interact virtual tabl acm symposium interact design user interfac addison weslei longman virtual iti interact world miniatur human factor comput differ knowledg obtain map navig tive handheld comput interact devic virtual environ project technolog workshop virtual interfac virtual realiti acm symposium user interfac softwar review virtual environ interfac ogi paper institut analysi
HCI/1586 4 user navig virtual environ awar virtual space tim marsh smith interact depart comput uk abstract navig virtual environ difficult contribut factor problem user major lack navig cue environ problem navig close virtual world object previou work develop inform cinematographi construct virtual environ aid user virtual reduc user paper describ valid guidelin user studi involv navig task virtual result suggest guidelin reduc incid user guidelin impact abil construct environ introduct usabl problem navig explor virtual environ attribut lack navig cue guid user environ problem displai screen reduc colour textur whilst navig close virtual object cognit load user restrict displai screen combin result user problemat navig typic central frequent perform activ virtual environ present result studi test guidelin construct virtual environ promot navig work carri part inquisit project research project fund uk epsrc group york laboratori aim project develop method principl improv design interfac virtual environ work paper common usabl problem navig explor virtual environ user background marsh wright design inform cinematographi construct virtual environ aid order reduc user space exist confin border current view port restrict displai head mount displai project anticip applic guidelin provid user visual cue unconsci predict content shape surround space addit displai restrict space displai screen impli addit space current view port space user provid greater knowledg immedi surround virtual space aid navig virtual environ guidelin defin marsh wright involv cinematographi convent exit entri point partial frame context virtual identifi exit entri point road lead screen partial frame familiar object shown partli current view frame guidelin convent exit entri clear user exist option exit area confin displai screen partial placement object virtual environ object partial user field view paper describ studi investig valid guidelin current work guidelin lesser guidelin partial frame manipul anticip guidelin natur support user navig reduc number usabl problem walk virtual reduc user work part larger effort develop design principl maintain interact virtual space virtual realiti experi studi studi develop test effect marsh guidelin attempt reduc usabl problem navig explor virtual reduc user studi consist group requir carri navig task virtual design guidelin implement virtual environ guidelin test virtual environ studi maze implement window version gnu detect turn subject walk virtual object maze guidelin consist pictur wall mount wall virtual corridor placement accord guidelin partial frame maze window exit corridor pathwai connect entri exit point guidelin entri exit point futur refer guidelin appli partial frame guidelin shown figur figur portion virtual guidelin studi attempt answer question natur identifi guidelin provid visual cue guid particip virtual space impli user exist space confin restrict impli virtual space aid construct mental map interact virtual space particip virtual realiti experi method eighteen paid volunt recruit notic board intern web site part studi consist femal thirteen male ag rang eighteen previou experi comput describ novic experienc user vr desktop hmd vr subject alloc studi time slot altern guidelin person perspect subject move virtual build control movement kei standard keyboard exit reach immedi navig subject identifi plan view map map figur map maze studi video record studi made analysi simplifi maze actual maze complex maze result figur corridor virtual build twelv subject rate speed movement corridor accept fast slow novic experienc subject thought movement experienc subject found movement slow sixteen subject found keyboard control easi novic user found difficult shown tabl subject group collid wall occur similar amount time subject guidelin walk contrast guidelin subject chose correct map guidelin chose incorrect map opt map guidelin guidelin collid wall walk wall awar activ extern studi task break attent tabl summari studi result debrief questionnair subject acknowledg feel point move ve guidelin identifi walk wall guidelin identifi walk colour move environ unabl subject awar activ extern studi navig task peopl walk studi sound type distanc awar studi subject acknowledg break attent concentr studi navig task identifi walk wall guidelin colour wall subject guidelin time studi task admir pictur wall discuss number subject group momentarili collid corridor wall occur similar number time subject guidelin walk wall time guidelin demonstr guidelin studi effect guid subject virtual corridor aid navig virtual environ studi maze recognit subject guidelin surprisingli score lower guidelin subject chose correct maze guidelin explan partial visual cue impli content shape virtual space immedi surround displai screen guid subject virtual anticip predict space displai plai part construct knowledg spatial layout environ major subject guidelin opt complex map suggest guidelin partial frame addit impli complex environ subject acknowledg guidelin momentarili break attent studi navig task admir pictur wall pictur guidelin evok interest reason suggest concentr momentarili broken studi navig task remain attach creat virtual environ remain subject guidelin mention guidelin placement broken concentr studi task identifi suggest guidelin transpar subject blend natur studi virtual environ subject felt point virtual guidelin identifi walk wall guidelin identifi identifi walk identifi colour subject identifi move window pillar bear subject guidelin acknowledg awar activ extern navig task studi studi contrast subject work studi carri virtual corridor detect appli analysi result underwai comparison work present paper made acknowledg author jon cook jame peter wright barnei comment work support part uk epsrc inquisit grant refer darken sibert strategi behaviour larg virtual world chi human factor comput acm inquisit project improv interact virtual environ interfac inform marsh tim peter wright evalu desktop virtual realiti workshop user center design implement virtual smith harrison king marsh peter wright david boyd spatial evalu stereoscop head mount virtual realiti marsh tim peter wright cinematographi convent inform design evalu virtual aaai spring symposium aaai marsh tim peter maintain interact virtual presenc intern workshop gnu manchest virtual environ interfac aig neal factor influenc spatial awar orient desktop virtual environ human factor ergonom societi st annual human factor ergonom smith david duke peter wright resourc model virtual environ workshop user center design implement virtual smith harrison king
IR/1587 5 comput function uncertainti pennsylvania tan pennsylvania abstract studi problem comput function actual valu variabl uncertainti variabl interv fall interv interv probe obtain actual underli cost probe goal adapt identifi minimum cost sequenc probe actual valu function comput design onlin algorithm problem select function aggreg function sum averag natur model give algorithm model analyz algorithm framework competit analysi show algorithm asymptot optim studi onlin algorithm function obtain select aggreg function introduct cach data improv perform data retriev environ speed data cach client reduc total bandwidth requir avoid lookup server data server updat data data obtain cach stale tradeoff issu perform stale data subject research variat problem cach support part alfr sloan research fellowship support part digit librari ii store upper bound lower bound specifi rang current resid comput perform client toler data cach quickli comput result comput result base data cach error requir updat valu cach recomput result client find minimum set element store cach valu element unknown upper lower bound underli client state paramet specifi find element deviat actual minimum imposs identifi element bound obtain valu element set element obtain server involv addit cost identifi minimum cost set element base valu find element comput function minim cost obtain accur valu element underli comput function requir collect accur valu underli tradeoff identifi small subset data valu pin accur tradeoff cost wide varieti set price inform sourc network environ internet avoid pai cost retriev inform provid stale copi inform cach locat assum cach item diverg function initi chang time assum server updat cach server fall rang valu store cach problem statement abstract scenario outlin comput function actual variabl unknown interv actual variabl cost probe determin exact cost goal adapt identifi minimum cost sequenc variabl probe actual valu function determin accuraci result set valu interv wit proof li requir accuraci goal design onlin algorithm find wit minimum cost studi perform algorithm framework competit analysi onlin algorithm instanc denot cost algorithm instanc denot cost optim algorithm competit ratio onlin algorithm defin fi finit input fi notic optim algorithm find wit minimum cost difficulti find wit small simpl find minimum variabl interv instanc construct adversari variabl probe onlin algorithm assign variabl probe assign onlin algorithm make probe ascertain minimum optim algorithm simpli probe variabl immedi ascertain minimum competit ratio onlin algorithm problem result studi problem choic function basic queri aggreg oper sum select oper output element rank order set design onlin algorithm problem state establish match upper lower bound competit ratio design competit onlin algorithm function obtain oper interest aspect result highlight structur paramet determin complex instanc essenti function consid structur paramet maximum cliqu size interv graph set input interv aggreg basic measur comput function rel model absolut model rel answer actual function multipl factor ff answer focu rel model natur model absolut model effect knowledg magnitud actual answer harder design analyz algorithm rel model sum problem variabl unit cost simpl greedi algorithm shown optim absolut model show rel onlin algorithm made time variabl probe optim algorithm maximum cliqu size interv graph select addit natur model rank model answer problem identifi element rank rank element output rang aggreg function sum design onlin algorithm show onlin algorithm achiev asymptot competit ratio select design algorithm ff show onlin algorithm achiev competit ratio model design analyz onlin algorithm function obtain oper studi studi comput form rang oper sum averag composit complex problem complex individu oper minimum sum problem significantli harder underli oper relat work problem consid studi widom replic system aim perform cach interv actual actual store larg reduc likelihood sourc requir updat cach sourc consist cach updat made cach chang sourc fall rang constraint incom queri answer cach valu larg interv continu cach valu answer sum queri absolut cach problem give cach valu dynam achiev perform vari workload investig situat constraint incom queri sourc valu queri actual valu order answer queri requir problem studi incom queri sum averag minimum maximum absolut model import differ work author oblivi algorithm set variabl probe determin manner gener select problem find smallest element element absolut model studi feder al analyz benefit onlin strategi oblivi algorithm show ratio worst case perform oblivi algorithm worst case onlin algorithm bound probe cost unit amount cost probe arbitrari note ratio worst case perform oblivi algorithm optim algorithm bound unit cost case infinit arbitrari cost case find minimum element ident absolut easi oblivi algorithm probe element optim algorithm requir probe interv unit cost ratio number probe requir oblivi algorithm optim algorithm cost interv infinit cost interv unit ratio infinit arbitrari cost case focu paper measur perform onlin algorithm optim algorithm input note rel model select aggreg rank model select consid earlier work work select fagin chaudhuri gravano goal find result queri involv multimedia attribut imag audio predic type attribut involv exact goal find tupl match predic worthwhil point differ select problem rank model problem select queri input problem set interv input select problem underli data sourc rank goal select problem find interv rank actual valu interv return result hold top valu select output grade sequenc element order element highest grade signifi answer match predic organ section describ notat terminolog section section design analyz algorithm select aggreg oper section algorithm function consid oper preliminari denot rang valu interv repres left interv variabl interv probe simpli probe variabl determin interv cost probe denot cost interv assum denot actual underli interv probe interv return left interv answer interv overlap interv iff vice versa interv graph set interv ing defin vertex set vertex interv edg set edg overlap width defin size largest cliqu equal largest number interv overlap fact collect interv width partit set sk interv overlap frequent partit design algorithm denot ff width instanc select select problem find largest element set element studi select problem model discuss assum partit interv variabl set interv denot sk select rank rank object return element rank li rang adapt probe minimum cost set interv gener problem find element rank rang set interv element rank li rang iff rank rang unit cost model show rank element rank rang exist interv left interv notic true partit interv wit element rank rang outcom actual valu interv proof proposit straightforward found appendix proposit lj fi rj fi interv element rank li rang jlj jrj set interv shown figur element li rank rang interv left interv element rank rang figur set interv width set interv width select respect rank main algorithm adapt find interv li interv left interv identifi suffic return answer present algorithm subroutin main algorithm subroutin input rank return subset interv element interv ensur select set interv denot interv set rank strictli greater select denot made interv interv rank strictli nice properti cardin exploit achiev algorithm problem algorithm select leftmost interv partit interv smallest left index remain interv left valu order denot sequenc interv note select interv find rightmost interv partit fs interv largest index remain interv valu order denot sequenc select interv denot set observ includ interv select algorithm shown figur lemma largest element origin instanc largest element largest element origin instanc kth largest element proof sketch case depend show interv rank greater observ largest element largest element show element rank element largest element kth largest element full proof shown appendix show algorithm find element rank rang algorithm algorithm set interv set interv leftmost valu set interv remain interv rightmost left valu depend boundari select interv probe index input interv endpoint order interv endpoint index sequenc interv order rx denot largest interv rx index remain interv left endpoint order interv left endpoint sequenc denot interv order denot smallest left interv exist interv rx return element rank lie rx probe interv rx return ii rx subset interv fjg observ rightmost interv probe rightmost interv jm denot interv probe manner return largest iii subset interv fjg leftmost interv probe leftmost interv jm denot interv probe manner return smallest rx invok algorithm find subset interv depend probe interv return ly figur situat step jxj jy probe interv return kth correct algorithm observ step algorithm find collect interv construct wit proposit element rank lie requir rang easi exist interv ly wit collect algorithm find probe step total interv jm jg largest claim rank rank happen belong partit lie jm jg rightmost interv belong partit overlap note left overlap jm jg interv jm jg impli largest interv rank similar argument situat step step correct lemma show onlin algorithm achiev competit ratio theorem algorithm proof easi optim algorithm present wit probe algorithm find wit collect step probe step algorithm make probe total return answer step claim optim algorithm requir probe return answer algorithm make probe ratio proof claim shown appendix theorem onlin algorithm achiev competit ratio proof instanc input interv interv rang interv interv find element minimum optim algorithm requir probe onlin algorithm made probe interv return probe probe observ input interv rang onlin algorithm requir probe arbitrari cost model briefli describ algorithm interv arbitrari cost algorithm determin divid interv interv leftmost endpoint interv rightmost left endpoint step algorithm interv return left endpoint interv identifi set interv size interv left interv rank interv interv rank greater found invok algorithm rightmost interv left partit leftmost interv observ interv probe interv order cost find wit theorem algorithm onlin algorithm achiev competit ratio proof observ divid interv select onlin algorithm requir probe perform optim algorithm show optim algorithm probe interv optim algorithm probe interv left order reveal interv requir rank rang leftmost interv rank greater contradict interv rank strictli similar argument show optim algorithm probe interv optim algorithm probe interv onlin algorithm probe interv smallest cost obtain algorithm lower bound theorem select rel absolut recal find element rank rel ff return actual deviat multipl factor ff ff absolut goal return actual differ ff ff observ feder al smallest rang smallest largest select rel interv shown figur largest element li interv largest element rel largest element absolut main result algorithm problem rel cost model show asymptot optim case unit cost model describ onlin algorithm introduc absolut model show easili adapt rel algorithm largest left left endpoint largest endpoint ff ff requir absolut return answer probe interv repeat algorithm interv interv algorithm essenti algorithm condit ff replac ff ff requir rel theorem algorithm proof sequenc rs valu obtain onlin algorithm iter sequenc interv chosen probe js observ smallest left larg largest remain opposit smallest left larg largest small rs overlap set interv width theorem onlin algorithm achiev competit ratio proof rel instanc input interv interv rang interv rest interv find minimum element ff rel ff optim algorithm simpli probe interv return answer onlin algorithm made probe return probe probe absolut input instanc absolut requir interv rest interv find minimum optim algorithm requir probe probe interv return answer onlin algorithm made probe interv return probe final arbitrari cost model describ algorithm select problem model arbitrari cost algorithm identifi set interv size interv left interv rank interv rank greater found invok algorithm xr rightmost interv left xr leftmost interv probe interv order cost smallest left largest requir accuraci theorem algorithm onlin algorithm achiev competit ratio proof claim optim algorithm probe interv optim algorithm probe interv left reveal largest leftmost interv rank greater contradict interv rank optim algorithm probe reveal smallest left call show smallest arriv contradict interv ir interv ir interv ly left interv left equal interv rightmost interv valu greater equal interv rightmost interv select select interv larger valu set notic interv left interv impli select set ir contradict assum interv left equal interv left reveal interv left worst interv left valu smaller rank similar argument made show algorithm probe interv lower bound theorem sum averag sum problem find sum variabl averag variabl differ sum fix factor result problem directli adapt loss gener restrict discuss sum problem unit cost model ing set interv underli variabl xn defin ratio simpli return answer continu probe interv till condit true greedi onlin algorithm find interv maxim probe analyz perform algorithm show essenti algorithm fix optim strategi state onlin algorithm make probe partit interv interv probe onlin algorithm interv probe optim set interv probe algorithm interv probe onlin optim algorithm assum onlin algorithm reach stop condit denot observ optim algorithm ensur onlin algorithm case greedi properti onlin largest size interv size smallest interv substitut ff ff ff ff ff ff rearrang ff ff ff ff ff ff compar coeffici conclud ff total cost onlin algorithm bound compar cost incur optim conclud onlin algorithm incur cost time optim conclud lemma lemma algorithm sum problem rel unit cost obtain perform paramet ff larg compar width instanc lemma ff algorithm sum problem rel unit cost proof fix partit input instanc set sk interv set rm set interv claim determin sum variabl underli rel simpli probe interv rm observ pm denot interv rm singl probe determin sum rel combin algorithm obtain result show bound tight theorem algorithm sum problem rel unit cost proof ff ff greedi algorithm achiev strategi outlin lemma achiev rel theorem theorem onlin algorithm achiev competit ratio sum problem rel unit cost proof input instanc consist kg rang interv rest ff optim algorithm probe interv immedi achiev requir ff onlin algorithm made probe ff interv return ff probe final ff optim algorithm make probe interv achiev rel onlin algorithm made probe interv arbitrari cost model interv arbitrari natur extens greedi algorithm consid previou section probe interv order densiti densiti interv defin algorithm greedili probe interv order condit ff satisfi easi construct exampl greedi approach lead solut arbitrarili larg cost compar optim problem interv greedi algorithm lemma formal lemma ip sequenc interv probe onlin algorithm opt cost incur optim algorithm proof proof similar lemma case interv higher densiti interv smallest densiti interv larg largest densiti interv total cost interv analysi similar shown section ff denot total cost incur onlin algorithm probe interv interv ip cost interv opt lemma suggest greedi strategi work bound cost interv probe algorithm onlin algorithm knew optim cost opt greedi algorithm simpli discard interv cost greater opt lemma immedi conclud algorithm onlin algorithm optim guess care manner modifi greedi algorithm base idea guess opt iter denot current sum left endpoint reflect sum valu iter interv probe initi counter set opt return answer find interv largest densiti opt increment counter goto step total cost cost exce increment counter goto step probe goto step ff satisfi counter iter termin opt iter greedi algorithm incur cost total cost incur greedi algorithm ratio total cost incur greedi algorithm optim cost lemma lemma algorithm sum problem rel arbitrari cost explor perform achiev restrict width instanc unit cost show lower bound set interv width sum left valu interv defin ff cost interv infinit cost interv interv rest easi optim algorithm requir probe probe interv obtain ff ff show onlin algorithm requir make probe denot number probe made onlin algorithm prior probe ff impli ff onlin algorithm made probe interv order achiev ff onlin algorithm theorem onlin algorithm achiev competit ratio sum problem rel arbitrari cost theorem algorithm sum problem rel arbitrari cost proof lemma probe interv order cost ff achiev show fact obtain onlin algorithm achiev lemma algorithm sum problem rel arbitrari cost achiev proof assum partit interv set sk opt denot cost incur optim algorithm set interv cost equal opt rest interv observ set interv probe optim algorithm denot set rightmost interv note observ lemma show simpl approach obtain equal observ obtain algorithm lower bound obtain probe interv ff denot obtain optim algorithm ff easi obtain onlin algorithm procedur suggest obtain competit algorithm achiev opt guess opt set opt power check interv check condit return answer opt factor repeat process total cost incur onlin algorithm iter optim assum algorithm stop iter opt guess mean opt cost incur iter bound probe interv total cost incur ratio compar optim theorem algorithm sum problem rel arbitrari cost achiev rel proof theorem previou lemma algorithm achiev ff observ lemma algorithm lemma function briefli describ result function obtain function sum averag composit ffi form outer oper oper studi unit cost case denot set interv fx xin nm total number interv assum partit interv set sk oper min singl applic min ident result appli averag sum oper sum easi direct applic sum oper earlier result appli averag describ log algorithm problem lower bound remain open algorithm observ ff log ff algorithm lemma sum problem scale input approach partit interv cluster log jg set interv probe rightmost interv estim scale estim easi estim averag combin scale estim obtain estim averag sum oper averag procedur estim scale max oper min oper vice problem min sum sum sum figur input instanc min ffi sum function difficult give algorithm case easi lower bound remain open exist competit algorithm problem denot smallest interv observ jg minimum minimum interv left equal interv exce loss assum index order fg pair element smallest left strictli greater discard repeat process element discard jgj width input interv contradict jg jgj total remain interv probe interv return smallest element smallest return largest aggreg oper min give algorithm similar idea earlier assum sum min oper denot leftmost rightmost valu interv observ view input sum function simpli set interv rm ff partit interv rm set sk width origin instanc rightmost interv probe interv return minimum element size probe interv estim sum lemma ff view sum problem unit cost appli greedi strategi lemma pick interv probe interv return minimum element algorithm ff oper min max aggreg show onlin algorithm input instanc width shown figur min sum set input interv width result sum node interv result interv sum input min oper instanc width easi adversari strategi make onlin algorithm make probe optim obtain minimum probe refer onlin comput competit analysi cambridg shekita data cach tradeoff dbm architectur proc acm sigmod intl conf manag page chaudhuri gravano evalu select queri proc intl conf larg data base page fagin combin fuzzi inform multipl system proc symposium principl system page fagin fuzzi queri multimedia system proc acm sigmod intl conf manag page widom comput median uncertainti proc symposium theori page shivakumar safeguard charg inform internet proc intl conf data algorithm graph theori academ widom adapt set cach approxim valu proc acm sigmod intl conf manag widom offer tradeoff aggreg queri replic data proc intl conf larg data page appendix section proposit lj fi rj fi interv element rank li rang jlj jrj proof interv jlj jrj show rank set interv extrem valu interv greater rank case jlj requir rang interv valu rank case jlj jlj jlj jrj jrj lemma largest element origin instanc largest element largest element origin instanc kth largest element proof denot set interv interv order interv select mean select interv graph fig size maximum cliqu includ interv graph overlap interv rm rm largest interv interv left belong interv left rank jm set interv fig overlap interv li left interv left interv left overlap rest interv addit interv left total interv left give rank denot set interv observ jrj element argument show element rank element interv largest show rank partit belong claim interv contrari interv loss assum left observ observ select interv largest contradict assumpt interv impli contradict assumpt argument conclud contradict assumpt element left element rank observ element rank kth largest largest claim situat rx optim algorithm probe proof show optim algorithm probe show optim algorithm produc wit probe shown case analysi type interv optim algorithm probe rest denot interv probe optim algorithm denot collect interv obtain step probe denot rightmost leftmost boundari denot probe interv boundari cross gap ffl optim algorithm probe interv type shown figur interv type valu strictli rx interv select rx fjg fj newli select set interv remain boundari remain cross ffl optim algorithm probe interv type interv type left valu strictli greater valu greater equal rx rx rx type interv strictli greater rx rx rx collect interv collect essenti probe boundari remain cross rx chang discard rightmost includ probe interv lose acquir interv fk boundari rx rx interv acquir boundari remain cross case rx subsum discuss ffl optim algorithm probe interv type rx rx gap produc probe show divid interv ly gap rx probe interv collect gap produc divid interv ly gap contradict assumpt rx rx fjg fj boundari remain cross fjg select prefer rx rx shift includ includ fk leftmost interv rx produc gap divid interv fk arriv contradict ffl show similar argument optim algorithm probe interv type gap produc probe show divid interv ly gap rx rx fjg fj rx interv li gap impli contradict rx gap produc fj fjg fk rightmost interv includ interv notic drop includ rx interv li gap rx rx newli includ interv discard interv observ point interv origin interv rx rx rx fjg ffl optim algorithm probe interv rx rx fj rightmost interv gap produc situat interv gap belong belong fk fk leftmost interv newli includ interv rx gap present interv li gap rx rx interv discard newli includ interv observ point interv origin interv rx rx algorithm select interv li gap belong fk belong observ rx interv exclud point rx rx leftmost interv rx gap produc rx interv ly gap rx rx rx
HCI/1588 4 pennsylvania suit pa februari site nsf scienc technolog center research cognit scienc irc report institut research cognit scienc semant contrast inform structur inton spoken languag gener scott allan prevost semant contrast inform structur inton spoken languag gener scott allan prevost dissert comput inform scienc present faculti pennsylvania partial fulfil requir doctor philosophi mark steedman supervisor dissert peter buneman graduat group fl copyright scott allan prevost acknowledg deepli indebt mark motiv patient guidanc thought advic year graduat student mark taught mean conduct scientif research provid skill comput linguist cognit scientist time research receiv tremend benefit interact student faculti member penn comput linguist commun grate mark steedman research patient listen idea present notion present ellen princ open ey import model context work justin cassel catherin pelachaud broaden research interest spoken provid insight facet human commun matthew hoffman provid numer invalu suggest constantli challeng wai webber marcu provid valuabl advic introduc work research work domain piano david energi taught problem listen critic music speech grate advic support ellen mark liberman kathi construct critic guid research greatli improv result document support dissert iii deepli indebt kri provid kind friendship encourag peopl privileg endur discuss research mediev deserv chri dana kim friend undergradu year carnegi instrument pursu phd colleagu bell laboratori provid encourag make leap academia graduat friendship kri tom matthew stone doug perspect stai connect world penn kri final dai dissert write busi sleep neglect eat regular interv grate love encourag drew support aspir champion partner robert ow deepest debt gratitud patienc infinit toler demand doctor research instrument surviv graduat school embark project grate strong influenc loui isabel memori dissert dedic knowledg love confid work iv abstract dissert present model determin inton contour context provid implement system appli theori problem gener spoken languag inton semant theori implement present base inform structur framework mediat inton encod proper level semant inform account accentu pattern inton phrase structur similar linguist level basi select combinatori categori grammar steedman model spoken languag product model congruent prosod inform structur constitu repres simplif model prosodi develop syntact tradit framework previou mention wide model determin inton shown inadequ handl broad rang exampl involv semant requir pitch accent alloc base abil discrimin entiti model address introduc model determin accentu pattern base set altern entiti knowledg base algorithm build inform structur encod semant inton suppli foundat comput implement implement demonstr theoret model appli problem produc spoken output natur languag gener framework provid platform increment test refin underli theori content acknowledg iii abstract introduct motiv present research overview dissert claim contribut literatur review relev research area syntact semant account inton contrast stress natur languag gener research summari inton inton contour mean abstract inton descript notat tone break indic hybrid inton notat composit inton vi mean pitch accent mean boundari contrast stress pattern contrast pronoun contrast stress natur occur inform structur inform structur formal inton approach inform structur model coher summari semant focu assign algorithm prosod phrase identif pitch accent specif summari inton combinatori categori grammar combinatori categori grammar formal definit natur languag prosodi groundwork prosod grammar build prosod gener summari inton natur languag gener implement queri result evalu result gener framework vii implement gener content gener sentenc plan surfac gener result rang exampl limit summari applic relat research facial express synchron link facial express speech tempor characterist facial action ey behavior ey movement ey environ gaze speech coordin blink head movement implement system summari sampl lexicon sampl gener bibliographi viii list tabl tobi break indic contrast occurr corpu inform structur nomenclatur center theori transit state inventori tune inventori tune contrast ix list figur architectur spoken languag gener architectur queri architectur gener gaze facial movement chapter introduct characterist spoken includ variat phrase system inton inton contour carri semant particip alter mean utter manner utter interpret listen order produc inton automat gener synthet comput approach simul melodi spoken languag dissert address problem theoret framework link inton properti contextu inform comput implement embodi inton compet theori demonstr appropri model automat gener spoken descript object inton context princip assumpt underli theori present dissert inton link semant context demonstr numer exampl chapter stress partial indic canon semant natur examin respect set altern entiti properti put context effect context inton complic fact languag reli syntact phenomena morpholog phenomena convei type semant subtleti produc rich inton system english order account dispar intermedi level inform describ inform utter packag respect bridg structur inton inton compet model present framework combinatori categori grammar steedman mildli grammat formal congruent prosod inform structur repres simplif compet model prosodi develop syntact tradit framework transform grammar hall structur isomorph linguist entiti model languag gener consid involv singl path semant spoken requir addit structur map surfac syntact form inton domain simplifi model speech product demonstr program gener contextu inton annot output program serv input speech turn produc utter proper inton introductori motiv examin role inton spoken languag reason adopt present section section broad overview research essenti provid road map guid reader remaind dissert section briefli summar princip claim contribut dissert motiv present research role inton spoken english provid contextu framework analyz mean relat mean utter connect belief system speaker listen function inton convei small set inton paramet phrase accentu pattern set pair kind music older brother older brother art form older brother older brother brother prefer older older sibl prefer older capit letter inform inton phrase promin sententi stress fundament frequenc answer exampl ident string possess strikingli inton contour fact contour interchang sound distinctli unnatur clear evid effect context inton theori put explain accentu pattern underspecifi accent predict synthet discuss chapter model emploi effect comput approach make accent placement basi previou mention word class hirschberg hirschberg model predict open class word receiv item mention model account case fail account instanc contrast answer explicitli question possibl account accent answer older brother prefer impressionist older brother secondari stress identifi reader assum featur present previou exampl demonstr inton contour sound natur effect context inton matter aesthet famou origin provid lakoff choic accentu pattern determin semant interpret utter john call bill insult john call bill insult choic contour case interpret make assumpt speaker believ call republican insult act notion inton context exampl attempt describ invok import close relationship inton context appar structur orthogon inton phrase tradit notion syntact constitu demand context make inton group word odd demand made syntax problem illustr subject noun phrase transit verb prosod phrase violat tradit branch syntact structur np kind music older brother older brother previou exampl problem determin inton contour context remark complex includ address pure theoret comput standpoint primari goal dissert address inton annot util deriv notat system beckman hirschberg detail chapter chapter includ discuss distinct intermedi inton matter ignor present defici previou approach present theori comput implement handl instanc contrast connect structur syntax unifi framework inton studi type framework briefli outlin kei question endeavor studi inton gener synthesi perspect sole analyz natur occur deepest insight inton precipit speech observ normal build theori aspect inton experienc spoken easili test theori due sparsiti interact linguist difficulti involv symbol repres inton transcrib speech studi inton gener theori develop easili increment refin output system gener task avoid interact prosod phenomena difficult unrestrict natur speech addit theoret justif pursu present compel practic unnatur inton greatest obstacl win accept output varieti applic spoken word natur method effect commun overview dissert theori mean structur inton advanc past decad chapter primarili dedic examin model theoret practic standpoint analysi theoret model follow argu inton link semant analysi reveal handl contrast stress recent workshop prosodi natur speech amaz particip notat inton transcript wide varieti exampl comput framework practic chapter examin approach assign inton contour synthet speech hirschberg hirschberg al approach reli heurist base notion word class previou mention heurist proven effect fail account contrast accentu pattern chapter lai groundwork describ relationship mean inton contour structur section chapter address rang issu inton pattern respect issu referenti contrast stress section describ inform structur level bridg gap context inton chapter conclud discuss relationship inform structur local coher address present research beckman describ contour respect constitu includ pitch phrasal tone boundari tone pitch accent repres rel minima maxima gener effect lexic item occur phrasal boundari tone delimit intermedi inton phrase matter warrant discuss section crucial differ notat notat adopt granular inton phrase break system phrase break pronounc sentenc break set inton distinct crucial order account vari phrasal present approach adopt break indic tobi break annot system al issu contrast stress address section number exampl demonstr weak previou mention model analysi inton pronoun natur occur speech evid assert section inform form link inton pattern model inform structur packag semant content utter respect context spoken share knowledg interlocutor section review inform structur formal offer introduc structur adopt present research illustr higher tier articul borrow term hallidai steedman theme correspond part utter link previou utter correspond part utter form core speaker contribut narrow foci theme repres tier american amplifi produc muddi kind british amplifi british amplifi theme steedman inton tune accompani utter underli inform structur tune accompani theme mark particip talk tune accompani mark interest theme unreason assum associ hold type knowledg base comput implement chapter inform fictiti stereo compon exampl present dissert allud object restrict paradigm simpl declar statement choic tune locat pitch accent tune equal import inton pitch accent mark word occur interpret constitu bear tune element interpret varieti includ make contrast distinct salient entiti connect inform structur organ address section princip respect center theori al joshi weinstein framework origin formul describ local coher present research appeal center theori gener coher model differ center model track proposit entiti simpli track entiti establish connect inton context chapter inform structur act chapter describ algorithm process inform build semant inform structur algorithm handl issu referenti contrast stress appeal set altern inspir model track success theme chapter structur congruenc inton inform evid form basi select syntact framework present research chapter describ formal argu applic task describ prosod prosod class simpl produc implement adopt model product inton speech crucial flexibl notion syntact constitu level process tandem simplifi comput model avoid separ syntact term segment prosod prosod modul comput syntact prosod surfac form inton theori present implement system gener spoken object simpl knowledg base chapter process natur languag accord recent literatur divid content sentenc surfac gener crucial point role inton gener process inton phrase depend utter theme relat consecut sentenc matter inform structur inton larg resolv plan phase accentu made respect linguist realiz properti entiti choic refer matter fulli resolv sentenc plan phase high level content plan phase differ previou algorithm incorpor inform structur emploi hybrid compet method organ inform variat schemata approach ensur adher constraint present inform order inform convei depend knowledg commun intent speaker belief hearer knowledg approach base rhetor structur theori rearrang proposit order make rhetor relationship salient written defin limit set task primari test hypothesi involv languag abstract semant proposit surfac phonolog syntact treat structur isomorph consequ spoken languag gener view exemplifi implement architectur shown figur secondari implement provid platform increment test refin compet model inton embodi categori rule present result consequ emploi methodolog rule accent assign rule content gener sentenc planner surfac gener speech commun goal intent prosod annot spoken output model knowledg base figur architectur spoken languag gener natur extens present relationship inton mode commun examin comput framework chapter chapter present implement system pelachaud prevost anim lip movement facial express graphic model directli inton pattern speech test synchroni speech facial express develop understand relationship express context inform structur chapter conclud discuss theori formal evalu claim contribut present compet model spoken languag product comput implement gener prosod entiti simpl knowledg base theori convei proper inton distinct contrast emphasi respect knowledg commun goal intent model speaker produc speech vari serv vehicl evalu refin inton compet model chapter discuss issu outlin previou section framework advanc model inton assign pitch accent base distinct mention inform account accentu pattern serv distinguish contrast entiti properti ii type explicitli referenti contrast stress accentu pattern distinguish salient predict model altern set respect context iii inform structur effect map context inton level semant detail account inton accentu coher iv inform structur syntax structur congruent instrument encod relationship inform structur syntax vi problem gener natur languag facilit inform structur associ content plan phase articul sentenc plan phase focal distinct theme vii inform structur serv uniform mechan incorpor compet model content plan rhetor structur approach hybrid framework organ text claim immedi provabl chapter numer exampl constitut proof contradict claim intend exhaust cover phenomena label contrast substanti algorithm chapter remain claim inher chapter explic reason advanc chapter evid claim form basi workabl model spoken languag product chapter literatur review task gener spoken languag inton encompass collect topic field comput includ prosod phonolog relat categori inform semant natur languag gener research area circumscrib varieti relev present research complic topic investig research varieti includ theoret comput scienc artifici intellig disciplin concern necessarili affect research methodolog present result issu pertain broad collect topic examin research attempt integr unifi framework implement test goal present chapter critic analyz topic order provid reader background inform analyt tool understand theoret comput contribut subsequ chapter wealth topic present complet review relev research topic space singl chapter approach delv detail import descript conveni locat subsequ chapter directli relev topic detail chapter treat briefli section broad overview manner area research relat identifi relev portion comput linguist comput scienc literatur remaind chapter divid separ section relev research conclud section summar recent attempt deriv inton applic relev research area research prosod aspect inton flourish twenti lag research area linguist slow develop inton theori attribut observ prosod structur orthogon tradit notion syntact posit transform grammar syntax guid forc linguist studi relationship prosodi syntax point prosod aspect languag receiv attent linguist began recogn descript inton structur connect driven natur linguist claim syntact prosod structur special case view put chomski hall sound pattern english root gener grammar hall spe approach sought account case stress specif declin account chomski hall regard perform theori lakoff berman continu work syntact model nuclear stress recent work continu framework gener grammar notion normal stress research spe wide accept correct part due prevail natur linguist number linguist began explor logic hypothesi relationship syntax prosodi claim syntact prosod structur necessarili account data prove troublesom spe suffer undesir properti requir complex cognit model languag process linguist accept hypothesi forc accept model human languag product handl syntact prosod aspect speech separ order address research adopt prosod structur distinct tradit syntact structur defin autonom hierarch prosod structur unlik introduc research concentr semant aspect languag defin inton domain assign accent account produc group includ account semant notion focu sentenc accent assign rule principl iv relat predic argument stress level literatur english stress pattern argument theori research hirschberg conduct research distinct entiti relat inton work retain semant bent fit neatli comput framework predict inton pattern comput model base involv separ syntact inton flourish hirschberg syntact bia linguist hypothesi relationship syntax prosodi recent larg overlook make matter cooper varieti experi role type syntact relat speech process altogeth claim syntact structur prosod structur semant view prosod flexibl notion syntact constitu tradit grammat formal steedman strongest propon combinatori categori grammar form basi unifi account inton inform structur advantag framework present simpler cognit model languag process involv multipl autonom possibl compon fact origin account pure syntact phenomena evid congruenc syntact inton constitu linguist motiv relationship inton number pure inton issu address present work primari area concern defin meant examin constitu part inton contour describ part fit reli princip work janet landmark dissert present remark complet model physic element inton notat system wide emploi linguist unit state spawn system silverman al close relat discuss inton refer wide arrai fundament frequenc inton tune varieti pitch accent possess distinct physic includ shape align lexic stress vast major semant pragmat account stress neglect fine resort singl notion stress physic similar argument made relat categori framework physic characterist pitch contour manifest plot fundament frequenc axi time axi graph gener refer pitch track characterist left complet unspecifi account incorpor stress level differenti accent term hirschberg fill obviou gap examin mean varieti inton contour analysi necessit complex observ incorpor inton model present discuss chapter major contribut dissert examin mean entiti proposit contrast encod notion contrast stress literatur english inton dismiss special case chomski hall call normal stress opinion phenomenon vari wide linguist studi evidenc ffl object classifi stress contrast basi contrast state affair ffl concur assert nonetheless contend notion linguist ffl claim specif inton contour contrast ffl correctli refut claim ffl al discuss contrast respect sentenc ffl contend instanc narrow contrast focu fact result broad focu section examin concern contrast conclud studi contrast stress pure analyt standpoint contribut argu concern concept contrast stress directli applic gener model contrast stress dissert semant pragmat notion link inton relev present research call narrow phonolog accent stress literatur crucial determin minima maxima inton contour call topic center crucial maintain coher utter notion focu refer simpli repres phonolog literatur hirschberg beckman bird fuch focu examin formal semant jacob formal semant work concentr particl altern set associ entiti group altern entiti form basi present model contrast stress particl directli address steedman describ inton framework consist notion focu allud relat inform structur utter inform structur refer segment sentenc separ contigu part base context prior number convent inform structur roughli map terminolog hallidai borrow steedman hallidai theme roughli mark cognit start point part sentenc link prior hallidai roughli correspond part sentenc speaker contribut salient kuno term start borrow descript featur reader note princ hoffman make similar inform structur distinct detail chapter inform structur describ singl utter relat present research concern structur interest linear order sentenc hierarch order set sentenc call segment appeal center theori joshi weinstein joshi weinstein friedman pollard origin conceiv theori local coher theori track call sequenc utter describ relationship center consecut sentenc discuss similar framework track consid entiti gradual fade set refer concern structur hierarch structur sentenc address work grosz sidner due limit natur type investig present concern global structur discuss author research rhetor structur theori mann thompson relev rst formal hierarch relat phrase sentenc base set rhetor predic chapter gener account appli principl rst determin organ futur research warrant understand segment handl present system fit rst hierarch model addit theoret aspect research mention hallidai made restrict inform structur wide assert theme literatur structur emploi term manner usag mention focu refer inform center gener themat natur inform structur inform materi focu avoid dissert term denot narrow phonolog focu number comput aspect includ problem gener natur languag problem incorpor inton theori synthet speech process gener text divid content goal satisfi structur surfac proposit convert sentenc number research intermedi level call sentenc map highlevel abstract semant fulli constrain eventu surfac realiz argu reiter dale number issu lexic handl sentenc plan level reiter compel argument psycholinguist plausibl architectur import comput aspect present research problem determin inton paramet synthet speech problem produc speech prepar refer address hirschberg framework distinct complex task produc speech term address davi hirschberg al previou version present research steedman provid gener overview research topic relev present turn attent detail discuss import issu stem topic syntact semant account inton relationship semant inton state hypothesi inton structur complet determin surfac syntact structur chomski hall hypothesi inton structur reflect semant content syntact structur syntact inadequ describ placement nuclear stress hypothesi inton syntact structur reflect semant content inform structur prevost steedman hypothesi reli notion normal gener stress result focu unspecifi entir sentenc assum focu minim pair exampl origin newman notion normal stress shown utter context answer question instruct leav told instruct leav plan leav order account modif chomski hall nuclear stress rule syntact affect phonolog lakoff berman advanc modif maintain focu syntact structur refut modif exampl explan pure syntact transform point point make note word assign nuclear stress mark letter exampl secondari stress left unmark end chapter reserv problem end chapter reserv problem solv exampl call question rule determin normal notion normal stress receiv critic camp critic notion normal stress requir assumpt utter exist contextu vacuum famou dy unit state shown make point di johnson di pronounc utter time health wide poor immin death unexpect johnson death report ill role context determin accentu pattern utter clear note subject read sentenc context placement stress gener support notion stress assign john physic professor assum unknown reader john di physic professor di goal dissert gener speech contextu handl normal stress definit normal insuffici task counterexampl pose modifi account hypothesi foundat present work reason turn hypothesi hypothesi base belief accent placement possibl natur propon lean furthest belief process accentu pure semant pragmat natur account english stress summar clever journal articl titl predict mind essenti contend accent word mark predict word highlight claim problem relat assert word accent depend contextu wilson notion make appeal scale relat accent produc contextu effect hearer share view hypothesi except assert rel semant weight account accentu pattern cite exampl verb unpredict stress verb predict shown coat door open account sentenc stress base principl item utter treat speaker fail assign stress ii verb receiv lower stress subject direct predic receiv lower stress irrespect linear posit surfac structur iii sequenc stress equal greater stress inton stress promin present work contrast formul import demand inform foreground produc contextu effect hearer inform hearer iv stress topic comment claim principl applic sentenc sentenc broad focu terminolog principl strongli challeng object disregard focu structur principl iv address focu suffer assumpt topic account fact comment gener receiv stress topic appli principl iii immedi appli principl iv sentenc utter strategi fail altern approach base note singl accent focu domain identifi focu structur multipl focu structur utter defin assign featur constitu set domain accent rule accent assign produc segment utter focu domain assign accent domain sentenc accent assign rule formul shown featur denot squar bracket delimit focu asterisk signifi accent stand predic condit variabl categori domain assign accent assign accent support number reproduc ap og disappear og ear og mysteri disappear account appeal focu structur mediat strong semant account account fail address relev issu pose strike examin sentenc contrast item line focu structur line result appli gilbert love georg hate love hate account focu fail rel contextu impact item semant predic stand direct contrast lexic item stress approach hirschberg similar focu account deploi sentenc accent base distinct implement number comput fail account appar instanc contrast stress section review speech product system reli chapter includ detail account techniqu unabl account contrast stress phenomena final point model fall hypothesi worth note model attempt explain placement fail address issu inton boundari chapter type boundari locat fact contribut semant interpret utter hirschberg interpret focu domain delimit intermedi inton predict focu domain odd natur inton phrase distribut domain consist inton phrase group word part reason difficulti determin prosod boundari appar orthogon syntact inton model hypothesi reason research adopt hypothesi syntact structur utter reflect inton structur inform structur idea integr inform structur syntact framework steedman idea integr inform structur model inton phrase put number includ bird order captur congruenc relat inform structur inton steedman emploi mildli grammat formal call combinatori categori grammar formul steedman combinatori categori grammar origin motiv pure syntact coordin english depend illustr handl inton phrase structur evid exampl demonstr inton phonolog focu inform structur articul sentenc british amplifi produc clean john mari newest member team jan mari al jan mari swim jan mari american amplifi produc muddi kind british amplifi british amplifi theme american amplifi produc muddi clean british clean theme exampl illustr unlik transform grammar formal discuss deriv reflect inton context utter notion normal stress complet absent previou model inton gener make claim inton contour null context steedman unlik gener grammar formal make predict inton phrase pitch accent placement framework realiz inton made inform structur level integr linguist system concern present research discuss theoret aspect categori grammar mildli formal provid chapter devot construct inton combinatori grammar contrast stress contrast stress phenomenon receiv formal studi great number inform mention linguist literatur reason doubt li content contrast formal definit easi construct exampl placement stress signifi hearer entiti proposit consid altern demonstr discuss exampl issu examin determin contrast stress differenti type stress phonolog investig correl semant contrast stress dont turn left turn georg hate love didnt watch watch john call mari insult theori contrast stress mark inton contour differ mark type stress put forward defeat hard press gener shape pitch contour context question john john walk postal posit slightli conserv theori assign absolut higher level stress contrast item accept tend make accent promin affect contend contrast accent overshadow absolut level stress interpret hearer contrast writer nuclear stress mark capit letter secondari accent mark small capit assert offer evid absolut level stress model contrast contrast pair mark level stress issu relationship semant contrast stress pure phonolog issu discuss main concern notion contrast stress easili constrain cite exampl assert stand contrast stand contrast physic item conclud make similar conclud smaller set stress contrast candid presid black woman white hammer top black board size set altern affect interpret contrast reason base assert entir notion contrast stress point writer attribut dismiss contrast stress pure analyt framework work view problem hearer forc reconstruct intend set altern base placement accent chapter demonstr gener languag set altern entiti proposit make accent refer express show proposit contrast stress model absolut note prosod grammar present chapter refut contradict listen certainti height singl pitch accent speaker intend accent item contrast item task gener speech high level semant dictat item semant mark contrast realiz slightli higher pitch accent violat assert rel pitch level prosod grammar chapter account multipl contrast inton phrase mark level stress restrict set altern entiti proposit explicitli mention chapter present algorithm emploi altern set produc accentu pattern gener text natur languag gener task natur languag gener divid content goal satisfi structur surfac proposit convert sentenc approach emploi effect mckeown gener text structur pari al number theoret issu plausibl model human languag processor remain unresolv linguist phenomena languag belong content possess featur inher surfac gener linguist phenomena fall choic lexic influenc issu distinct content plan surfac remain unclear issu lexic choic concern construct model human linguist abil recent nlg research posit intermedi gener term sentenc abstract semant map fulli constrain sententi realiz reiter mellish elhadad robin elhadad mckeown robin consequ approach content gener oper concern grammat constraint languag surfac gener oper concern global structur issu address sentenc plan level includ lexic choic reiter inform introduct problem sentenc plan mckeown elhadad robin mckeown robin construct refer express descript explicit green car phase base primarili comput reduc excess feedback high low level gener reiter argu psycholinguist plausibl architectur present research role inton spoken languag point consid inton phrase depend utter theme relat consecut sentenc matter inform structur inton larg resolv plan phase accentu made respect linguist realiz properti entiti choic refer matter fulli resolv sentenc plan phase issu focu debat natur languag gener commun methodolog organ proposit content gener phase schemata approach mckeown involv select proper schema convei desir messag flesh detail base inform templat essenti written regular express option potenti repeat great deal flexibl result text approach proven effect practic pari al inher limit set schemata appli equal domain room replan case text commun effect time reader desir clarif schemata approach remain research rhetor structur theori mann thompson basi content determin organ rst framework base set rhetor predic repres relat level inform text rhetor relat includ primari support materi formul rst relat plan includ subgoal hovi build text structur tree output hovi system produc tree left syntact constraint increment realiz hierarch structur reminisc earlier work mcdonald direct approach gener plan problem offer plan describ architectur floor plan gener produc tree proposit link rhetor relat structur includ physic spatial properti repres extent structur text relat structur entiti talk coher approach content gener sentenc plan process surfac gener phase translat semant surfac work hinrich schabe hoffman model tactic gener prevost steedman share similar schabe model tree adjoin grammar manner syntact semant tightli coupl research earli attempt produc inton speech reli innov algorithm produc inton contour promin role semant level constraint allen al result attempt algorithm unabl appropri alter inton properti speech accommod context research attempt occas build system produc contextu inton vari success earli work tt young speech synthesi concept inform actual text produc inton young approach emploi sophist techniqu model context syntact structur constitut major step remaind section describ advanc field specif recent work consid semant structur addit syntact orthograph featur determin accent boundari locat netherland conduct ongo research inton synthesi past decad earli work ipo hart al root perceptu experi listen determin similar contour gener inton grammar hart cohen hart grammar creat abstract pitch movement corpu contour dutch research concentr describ function inton respect focu distinct line research concern determin rel level entiti appli pitch accent work area recent continu davi hirschberg hirschberg al relationship hierarchi accent lexic item establish import context determin inton contextu cue drawn semant clear system exploit contextu inform linguist area bound produc natur inton system reli sole orthograph cue scope languag gener constrain limit comput access semant structur tt system fall reli contextu inform handl unrestrict emploi semant pragmat relat produc utter tightli constrain domain remaind section describ system pitch accent assign unrestrict attempt limit domain system gain contextu knowledg julia hirschberg interfac bell laboratori tt design assign pitch speak phrase unrestrict text base syntact inform structur inform infer orthograph cue hirschberg base grosz sidner issu accent determin respect incorpor contextu inform semant pragmat restrict notion lexic word system improperli accent item establish synonymi implic system complet incap assign accent basi semant contrast type error contribut percept unnatur note author drawback inher amount inton inform correctli crude syntact orthograph cue make system worth explor structur stack local focu space push pop base segment infer paragraph cue phrase focu space root word content word noun global focu space store root item occur topic sentenc initi algorithm accent item occur local global focu space part nomin compound flaw system due fact algorithm assign pitch accent base word class lexic advanc model read unrestrict text offer recent work problem inher handl unrestrict text predict davi hirschberg year system produc describ modul direct assist davi hirschberg allud defici unrestrict tt system make synthesi reli primarili structur inform determin inton speech abstract messag convei emploi richer sourc hirschberg direct assist applic determin rout spoken direct travel point boston road map hirschberg limit abil assign type semant utter readili appar issu resolv base semant factor pure lexic factor fact system gener text complet control avoid problem infer structur textual cue system make limit semant level complet ignor notion contrast focu direct assist work manner sequenc map set descript schema empti fill valu abstract rout segment structur determin segment relationship schema segment focu space set potenti accent entiti semant annot pitch accent assign base respect focu space item occur text accompani pitch accent item lexic semant focu space addit determin pitch accent direct assist program segment inform determin pitch final durat segment aspect inton natur spoken direct benefit improv algorithm pitch accent assign make semant inform convei contrast relat model domain stark contrast great street turn left turn bridg blue white direct assist project share differ avail semant inform research edinburgh similar develop model inton unrestrict text highli constrain text rich semant al issu address davi relat differ restrict unrestrict address edinburgh research design similar attempt read unrestrict text reason inton goal necessarili produc natur produc accept neutral inton accept inton defin inton necessarili natur neutral inton defin inton leav focu structur ambigu factor specif note neutral inton exclud contrast stress phenomena basic idea underli term accept neutral inton produc prosod domain sound reason listen easili construct context prosodi highli accept correctli note human read text reason inton necessarili comprehend system claim model naiv inton work identifi phonolog domain call simpli locat boundari type tg major syntact constitu noun phrase verb full complet sentenc major syntact constitu boundari glean syntact intermedi domain boundari sententi boundari determin basi punctuat type inform emploi determin phonolog domain similar kind inform util determin structur lack hierarch structur exhibit segment algorithm emploi pitch accent locat reminisc elabor depend context level stress assign basi rule content word noun proper assign primari main adverb assign secondari stress function word receiv stress strategi assign fact rectifi rhythm rule delet accent rightmost primari reduct delet secondari left primari appli set condit phonolog domain ensur accent inadvert delet delet potenti accent basi lexic delet potenti accent prosod domain basi rhythmic altern inton assign algorithm form basi inton compon bridg research inton dialogu project develop edinburgh al direct assist goal bridg project produc natur inton constrain applic gener text scratch simpli read incorpor elabor semant structur unlik direct bridg design work dialogu bridg project reli program produc dialogu map task agent map commun map rout agent similar necessarili map linguist issu share knowledg map task similar issu houghton pearson system pearson dialogu produc jam restrict map semant structur readili infer modul assign accent boundari contextu inform repres collect card file histori convei inform store file system util manner similar focu space direct assist resolv issu due varieti move declar utter map choic inton tune import locat accent map tune choic potenti bridg system exhibit similar system present section type question pose queri system affect choic tune question boundari accent assign bridg program manner similar addit particip semant cue contextu inform factor determin accent placement bridg linear order prefer rightmost prefer content word function prefer semant content word content prefer item contextu work predat bridg isard pearson undertak similar task assign inton dialogu pearson houghton houghton isard dialogu involv agent cooper manipul object world consist lock block boundari produc dialogu transform syntact tree accent domain tree appli rule delet node accent determin basi syntact word class main tenet underli wealth tt research semant pragmat inform vital produc accept natur inton contour speech present adopt basic principl attempt appli greater extent system discuss system make pitch accent placement basi semant shown basi contrast direct assist project bridg project attempt make distinct clear evid contrast stress relev map relat applic domain method emploi system determin prosod domain base primarili syntact orthograph cue structur model advoc system system handl limit type model produc prosod natur accent boundari summari chapter includ overview major issu formal theori comput model spoken languag product standpoint issu relationship prosodi syntax matter major disagr evid inton intim relat semant pragmat aspect languag linguist reject associ inton syntax categori present syntact framework intertwin notion syntact semant elimin complex model map orthogon syntact inton structur formul serv foundat present constitut attract compet theori spoken languag product controversi surround issu contrast stress evid support uniqu contrast inton pattern pitch accent placement serv identifi entiti set altern previou mention heurist emploi program inadequ account accentu pattern theori present address problem explicitli model altern set semant appeal notion inform structur focu task natur languag gener divid content goal satisfi structur surfac proposit convert sentenc nlg research posit intermedi sentenc plan gener abstract semant map fulli constrain surfac structur present work address problem determin inform structur correl inton featur gener framework chapter inton spoken prosod characterist utter determin listen perceiv mean inform convei accommod listen model model theoret abstract describ relationship proposit concept connect inton exampl previou chapter illustr exampl focu primarili contextu effect accent inton phrase affect semant content prior utter aim present chapter present inform structur formal mediat inton account contextu bound accentu pattern inton phrase chapter begin introduct inton includ review composit approach inton structur mean beckman hirschberg analysi stress partial indic contrast section relat inton phrase accentu pattern utter inform defin inform utter packag context manner utter organ organ relat inform structur examin final section chapter relationship inform structur form foundat phrase accentu algorithm chapter inton contour mean relationship inton characterist utter surround context consid pure standpoint natur accentu pattern sound convei messag connect inton simpl matter aural felic modifi inton complet alter mean illustr accentu pattern elid verb phrase ambigu read john thought bill didnt bill didnt succe john thought bill didnt bill didnt bill succe case inton varianc explicitli alter semant content variat mislead hearer choic bottl red wine bottl white utter convei mean complet impli speaker believ altern wine argu hearer add belief knowledg ill white wine ill white wine accentu pattern affect rel import salienc illustr nuclear stress placement answer import context determin inton pattern exampl evidenc fact answer interchang sound distinctli demonstr previou exampl inform denot inton contour capit stress word ow close relat webber similar exampl suggest kind music gilbert gilbert prefer jazz musician prefer gilbert prefer jazz kind music gilbert prefer jazz musician prefer prefer jazz problem analyz inappropri inton contour instanc unnatur sound analysi fail involv stream word exchang interlocutor particip continu make proposit infer state world belief system counterpart base number includ facial express gestur movement assum unnatur sound inton easili accommod listen model inton contour question possibl respond misinterpret inquiri discuss previou link inton contour context semant highlight incorpor focal articul inton framework explor issu examin physic characterist english inton settl notat describ problem turn abstract inton descript inton descript emploi dissert base theori inton modifi beckman chapter examin relationship inton facial express comput framework describ fundament frequenc term rel emerg earlier theori metric phonolog inton fundament frequenc symbol collect discret inton includ pitch phrasal tone boundari tone symbol infinit variabl fundament frequenc shape map finit set inton categori system suit establish connect class inton contour role hirschberg notat system wide emploi unit state slightli modifi version system recent integr tobi break transcript system al beckman hirschberg al tobi combin annot inton level descript break indic inton present research concentr restrict number inton contour subtl differ tobi convent address notion break shown crucial import problem gener inton describ relev aspect tobi section conclud descript hybrid notat convent describ tune break indic gener problem notat inton encompass varieti prosod includ pitch rang phrase model inton english doctor dissert identifi core set inton compon inton contour construct compon fall pitch phrasal tone boundari tone appeal analog origin refer phrasal tone writer adopt term notion accent class grammat part speech defin finit set element combin infinit number wai identifi wai phrasal tone boundari tone combin form essenti defin syntax english inton syntax present section prepar discuss inton semant word english languag simpl lexic stress pattern assign syllabl greatest rel promin word utter determin inton contour type promin pitch align lexic item utter rel minima maxima fundament frequenc contour basic pitch accent accent word realiz tone occur high speaker pitch rang peak occur lexic stress syllabl word realiz tone occur low speaker pitch rang similarli align stress syllabl addit simpl pitch word mark complex tone mark asterisk align lexic stress syllabl tone repres rise fall natur accent pitch accent word comput inton low pitch rise distinct high syllabl addit pitch effect inton phrasal boundari demarc phrase phrasal occur success pitch delimit intermedi phrase phrasal tone effect control pitch recent pitch accent end phrase boundari follow intermedi phrase sequenc intermedi phrase form full inton phrase simpli boundari tone describ gener direct contour end inton lengthen stretch stress term unambigu refer pitch accent realiz boundari tone affect phrasal tone phrasal process call boundari immedi type tone introduc term rel mechan realiz melodi sequenc tone necessit success accent realiz constant high pitch notic dip accent complex pitch accent involv process call compress pitch rang accent sequenc accent realiz descend horizont part wave fall stress syllabl effect negat intermedi phrase boundari tone break indic research prosodi respect comput standard notat system prosod phenomena appar tobi system al specifi convent annot speech sampl break index design specif mind tobi tier repres slight modif annot discrep system affect tune discuss tobi convent high pitch adopt present approach emploi accent accent mark sequenc notat written primari reason tobi convent break index describ natur junctur orthograph item note boundari tone creat equal respect lengthen distinguish boundari boundari gener inton distinct crucial break index descript word boundari weak phrase strong boundari intermedi phrase boundari inton phrase boundari tabl tobi break indic mark lesser boundari break index tier tobi annot tabl begin address situat associ valu intermedi inton phrase break hybrid inton notat task gener inton requir greater granular descript phrasal speech annot includ break indic inton descript gener tobi system offer mechan introduc fail make distinct requir account differ intermedi phrase inton phrase boundari phrase boundari order account boundari distinctli mark boundari break index fall indic tobi scale issu indic tobi classif notat differenti full inton phrase boundari mark phrase set emploi boundari note make distinct intermedi inton break indic inton tobi break index assign lower index boundari perceiv stronger intermedi boundari model blur intermedi phrase end place utter boundari tone natur occur intermedi phrase consid full inton phrase boundari tone effect answer utter hesit annot notat piano piano care analysi fundament frequenc contour show rise tail end unclear rise attribut high boundari tone end phrase effect accent immedi answer hesit warrant context natur occur word game show scenario host reveal correct answer demonstr boundari warrant gener applic phrasal tone hirschberg note phrase accent separ current phrase subsequ phrase accent current phrase form part larger composit interpret unit host pose question write piano written studi earli ag march wide perform consid repres matur franz piano im long piano primarili concern manner phrasal tone affect fundament frequenc contour end intermedi exampl illustr phrasal tone serv delin segment utter boundari tone fact phrase demand high boundari tone impli choic boundari tone random reflect relationship phrase demonstr relationship hold phrase reason pitch rise intend phrasal low tone notic delai onset inton phrase intend phonem segment lost phrase contract effect intend rise boundari mask natur rise pitch accent subsequ phrase situat mark notat place boundari phrase utter annot tune realiz pitch rise end phrase lexic item bear accent hesit notat encod fact end slight fact exhibit boundari uniform treatment full inton phrase intermedi phrase inform structur notion prove develop inton grammar shown chapter notat convent phrase boundari combin phrasal tone boundari tone rewritten shown piano import featur notat true notat tobi inton contour regard part utter appli contour basic shape cover singl word complet utter contour similar differ pitch rang intens peak inton element convei distinct contrast proposit attitud sidner hirschberg liberman ward hirschberg wang hirschberg prevost steedman prevost serv statu current phrase respect surround phrase composit inton previou section singl inton contour interpret varieti depend context contour share featur type accent boundari share aspect mean hirschberg assert intermedi phrase behav term inform structur role complet inton assert distinct intermedi inton phrase warrant prosod theori concern inton phrase inform structur section remaind chapter treat intermedi inton phrase inform structur counterpart uniform manner pitch accent identifi inform exchang speaker listen salient scope entir inton relationship current phrase successor high boundari tone frequent impli speaker continu speak mean current phrase interpret respect successor low boundari tone denot end segment speech question end high boundari leav topic discuss final statement gener mark low boundari mean inton contour utter encompass relationship semant content utter belief particip mean tune commun speaker belief proposit put belief proposit interpret hearer choic tune convei speaker belief natur relationship proposit put consecut utter phrase complex role belief system determin inton date theori inton semant claim cover wide rang prosod variat english remaind briefli discuss recent composit approach inton mean relat gener task hand inton contour pitch phrasal tone boundari tone physic recent research suggest mean inton contour view composit mean inton part hirschberg theori differ previou approach analyz inton mean level complet phrase contour attempt defin map tune speaker attitud ward hirschberg princip advantag composit model captur fact tune share featur convei similar mean composit approach suit integr composit semant framework semant string word semant constitu inton semant deriv inton semant part composit natur inton prove benefici examin mean inton constitu tune present gener system reli heavili prematur invok tune wide emploi simpl statement bracket interpret select element stand occurr symbol occur compon primari interest pitch accent boundari mean pitch accent accent gener appli item salient hirschberg item case item bear accent establish requir emphasi stand contrast salient item question occurr answer inform contrast item mark util instanti variabl open proposit convei rest utter updat hearer belief hirschberg prefer brown al id al accent mark contrast shown accent contrast accent strongli variabl open accent mark contrast fulli instanti background part open note demonstr fred bean mean boundari phrasal tone effect delimit segment interpret separ subsequ segment hirschberg recal reason present approach disregard semant distinct intermedi inton phrase phrasal tone includ primari set tune handl present phrase distinct maintain boundari tone consid mark relationship consecut phrase boundari tone frequent impli speaker continu speak mean current phrase interpret respect successor boundari tone denot end segment speech interpret interpret correct adequ account situat open proposit carri tune interpret respect phrase maintain belief high boundari mark inform incomplet contrast stress pattern due inabl easili deriv semant inform unrestrict system gener forc reli crude syntact word classif make judgement accent word strategi previou word occur restrict segment text previou text divid segment basi cue phrase paragraph boundari system differ system manner semant pragmat inform exploit assign inton featur system emploi applic domain semant level knowledg readili effect previou mention strategi improv semant addit lexic decid word enhanc prove effect exhibit defici note propon foremost inabl strategi model seemingli contrast natur accentu pattern spoken languag contrast stress error sound unnatur worst case mislead hearer problem attribut strategi tendenc includ accent potenti result inabl hearer determin import aspect speaker intend messag remaind section address problem explicitli model contrast system potenti solut strategi work ffl assign accent item content ffl assign accent item function ffl word mention local segment applic user configur stereo system produc spoken descript system compon assum type compon cd speaker assum compon model pair compon made countri necessarili prefer program expect produc type output shown user fail includ essenti compon audio system configur system includ amplifi british amplifi highli recommend algorithm produc accentu pattern np british amplifi stress amplifi explicitli mention previou sentenc user select configur consist manufactur great britain illustr excerpt descript produc altern success utter system includ british amplifi select highli rate british amplifi select highli rate british amplifi select highli rate british amplifi select highli rate accentu possibl np british amplifi sentenc exampl accept correctli accent contrast distinguish type compon base content strategi produc accentu pattern illustr inappropri inton hearer infer compon configur british consid term british amplifi prior utter configur select strategi attempt term np requir form altern strategi case plausibl strategi exhibit similar problem equal simpl exampl problem strategi system rectifi explicitli model contrast stress program initi user configur includ british british british program construct explicit set altern stereo compon accentu pattern determin note altern differ manufactur actual type program easili decid stress amplifi british algorithm contrast stress assign detail chapter explicitli model contrast problem strategi avoid stereo configur american amplifi british amplifi describ system produc utter shown american amplifi power strategi lead accentu pattern subject noun phrase amplifi mention american amplifi power contrast stress algorithm briefli sketch recogn crucial distinct american british properti system amplifi assign stress produc output amplifi bear pitch accent chapter describ approach model contrast stress type stress occur item american amplifi power contrast pronoun exampl demonstr accentu pattern assist hearer correct identif referenti item exampl illustr close relat issu system decid modifi descript dale inadequaci notion sole model determin accentu evid previou mention heurist suffici foundat assign accent provid presenc stress occur natur speech contextu failur appropri stress modifi refer express sound awkward lead failur appropri stress pronoun frequent affect semant content proposit convei recal repeat accentu alter mean elid verb phrase john thought bill didnt bill didnt succe john thought bill didnt bill didnt bill succe exampl exhibit similar semant shift pronoun stress bill ralph bill bill bill ralph ralph ralph bill ralph ralph bill john call bill insult john insult bill john call bill insult bill insult john recent work effect pitch accent pronoun refer reader note lack pitch accent logic entail proposit call republican insult contrast stress natur occur contriv exampl section stress pronoun pose problem previou mention strategi assign pitch accent address issu common stress pronoun phenomenon address frequenc occurr issu examin natur occur speech isol exampl contrast stress pronoun princip concern approach subject natur definit contrast discuss previou chapter conduct broad simpler approach involv explicitli contrast construct present experi determin subject pronoun stress explicitli contrast utter data experi restrict includ utter form occurr stress utter readili attribut contrast utter syntact mark convei contrast inform subject remov experi data experi extract collect digit telephon collect texa instrument corpu gener tool studi numer aspect speech subject awar natur present experi inton theori writer occurr extract corpu exhibit accentu determin combin subject judgment pitch track occurr stress elimin exampl contrast stress immedi ten support interpret remain stress pronoun establish previou utter result present tabl show subject pronoun explicitli mark contrast construct form receiv disc stress contrast contrast total tabl contrast occurr corpu stress attribut contrast statu imposs extrapol data case contrast construct mark explic coordin data provid clear evid statu elig receiv stress analysi data experi reveal distinct pattern contrast stress shown consid altern fa verb exampl natur occur dialogu corpu follow pattern exampl sake exampl explicitli show stress reader conclud word bear notic pitch accent boi identifi peopl written bui piec person dont mark husband august moon husband restaur lion august pretti good isnt favorit dont kind case directli contrast element contrast entiti explicitli mention prior contrast contrast proposit rang direct requir bit knowledg world contrast hit ball straight middl hit long requir knowledg game golf speak game golf short short weakest part time made trip mississippi march cold march hope warm weather peopl plai longer ball husband find straight middl win quarter hole rough rough left end plai exampl contrast stress pronoun individu contrast individu repres pronoun salient set individu statement contrast crimin wait period crimin intent reason object wait period lot time rememb gui austin guess lee harvei sane bought bought mail data demonstr inadequaci notion predict accent placement stress subject pronoun syntact mark contrast construct shown occur frequenc overlook develop theori accent placement context work determin frequenc stress pronoun type preliminari data model accent placement suit handl contrast accentu pattern previou mention heurist emploi issu contrast stress address comput standpoint chapter chapter chapter illustr interact inform structur contrast pattern shown emploi appropri stress contrast item automat gener speech inform structur inform structur refer organ inform utter inform structur defin inform convei sentenc relat knowledg interlocutor structur sentenc convei proposit content context share inform structur simpler inform structur refer semant content utter amount instruct updat inform model particip realiz inform structur differ languag languag inton carri burden inform languag word convei inform structur syntact present conveni view inform structur bridg inton bridg connect realiz inton contour structur possess inform target languag method commun contextu inform languag inform structur form compet model semant context remaind section examin notion inform structur framework set terminolog section conclud discuss relationship model coher inform packag inform structur formal great number comput linguist theori inform lack consist terminolog compet model formid obstacl understand theori relationship framework inform structur share similar highest theori segment segment repres cognit link relev knowledg repres contribut sentenc knowledg pool level segment intertwin notion exposit previou section accentu present approach treat issu separ higher level inform structur segment issu delv vocabulari inform conveni introduc simpl shown chef rh materi subscript correspond link prior pointer file card framework cf hoffman file card repres entiti utter materi mark rh subscript correspond contribut speaker make hearer model inform store file capit mark locat pitch accent phonolog focu term broad interpret term inform structur nomenclatur describ rh materi tabl present term appli segment select research list cover core inform structur literatur system differ segment top includ focu tail present previou includ background inform occur focu case background inform question split part answer team scott win stanlei cup assum distinct inform structur segment account entri hallidai slightli mislead hallidai refer segment illustr term structur chef cook spam hallidai lyon theme steedman link focu kuno topic comment hoffman topic focu princ open proposit focu presupposit focu grosz sidner focu tabl inform structur nomenclatur accentu pattern exhibit element segment receiv pitch accent note distinct equal account stress pattern inform inform receiv accent order handl inton phenomena syntact demand order deeper level inform structur akin phonolog focu requir formal advoc present research accomplish addit level inform section inton approach inform structur concept focu prosodi literatur frequent phonolog term topic focu emploi chosen follow steedman hallidai term theme describ inform structur categori illustr hallidai assumpt theme occur base type situat found exampl american amplifi produc muddi kind british amplifi british amplifi theme american amplifi produc muddi clean british clean theme steedman prevost steedman argu class utter exemplifi utter occur inton phrase bear simpl tune variant abstract inton notat section write tune theme case fact includ accent bear written recal ignor distinct intermedi inton phrase boundari differ inton boundari li lengthen similarli symbol repres boundari symbol repres boundari distinct left implicit written boundari speech distinct import utter boundari accompani greater lengthen note effect phrasal low tone boundari propag effect back recent pitch accent phrase map inform structur constitu inton tune clear determin tune boundari inform sentenc relat surround note simpli string word tune appli impli proper word place accent tune address issu accent fall possibl inform mention question discuss section properti clean distinguish mention answer mention question exampl theme exhibit combin background narrowli materi differenti instanc mark contrast item instanc mark contrast item distinguish contrast case append marker end categori shown exampl differenti consist distinct present contrast focu support distinct provid account contrast foci finnish note inform structur prevent occurr multipl theme model coher inform structur adopt previou section encod level semant specif account inton phrase accentu present section address problem link inform structur model concern matter issu utter organ notion refer coher joshi weinstein coher analyz respect global defin segment multipl utter relat local defin consecut utter segment relat discuss summari framework coher discuss relev model inform structur global structur refer manner segment arrang respect grosz sidner refer aspect global organ intent structur segment segment contribut gener hirschberg specul hierarch relationship dsp signal boundari exemplifi construct utter elabor immedi prior utter observ indic relationship inform structur dsp themat focal articul unclear warrant research claim made present research global structur addit global intent grosz sidner postul model attent state repres interlocutor focu attent attent state segment local focu space salient entiti segment salient entiti includ item explicitli mention item made salient inferenti reason term refer entiti odd inform structur notion focu contrast inform present grosz sidner terminolog avoid similar structur call entiti list emploi implement chapter construct referenti express resolv issu grosz sidner model attent state framework track entiti appeal center theori model al joshi weinstein al describ local coher relationship consecut utter center theori formal trace entiti segment describ relationship consecut utter origin formul predict theori recent work demonstr theori resolv pronoun ambigu describ constraint interpret topic center theori base set featur utter includ set prefer center center entiti link current utter previou utter center list set entiti realiz current utter order possibl languag specif potenti subsequ utter highli rank center call prefer coher consecut utter defin set rule transit state primari constraint state utter highli rank item list occur previou direct rule dictat realiz pronoun member realiz pronoun transit defin coher relationship consecut order prefer shown defin shown tabl continu retain notion theme section share similar notion center theme gener establish link current utter previou utter unlik restrict theme proposit entiti strongest claim nomenclatur transit state drawn walker al continu retain tabl center theori transit state make relationship theme utter realiz theme utter simpl part theme john heard immedi call friend bill told good rh theme defin term link prior hypothesi put reason evid occur john insult bill bill rh theme matter tune main phonolog focu utter nuclear file card entiti bill updat john dictat john complic relationship discrep attribut fact list utter ident inform realiz theme theme ident fact creat link prior utter strike similar center notion transit utter prefer adopt abandon inform structur establish previou section transit utter share themat materi akin continu retain transit center theori materi utter realiz theme conclud similar center shift transit occur center theori inform structur strictli similar warrant inform structur model coher perspect form basi organ utter produc program chapter summari chapter present inform structur formal mediat inton encod proper level semant inform account accentu pattern inton phrase analysi link inton divid ffl inton inton affect mean interpret utter physic aspect inton contour defin physic aspect mean inton contour deriv mean compon inton reflect semant contrast signal placement pitch accent studi contrast pronoun natur occur speech evid assert ffl inform inform structur utter refer organ inform utter defin semant materi relat knowledg interlocutor structur number nomenclatur inform structur due conflat inform structur phonolog definit terminolog term order avoid adopt term repres phonolog notion focu theme correspond inform structur inton tune permit semant level encod contextu aspect account type inton phenomena ffl notion coher inher center theori share strike similar inform structur notion utter unlik theme limit proposit entiti model center theori inform structur strictli similar warrant inform structur model coher congruenc inton inform structur similar model exploit combinatori categori grammar formal present chapter relationship provid framework comput approach spoken languag gener problem chapter semant focu assign algorithm task assign inton contour utter divid determin inton phrase boundari determin placement shape pitch accent phrase previou inton phrase articul inform structur placement accent inton phrase focal articul theme chapter describ algorithm produc inform structur utter section describ center theori model coher appli problem identifi themat structur proposit convei speaker algorithm contrast base set altern properti present section inton assign algorithm present emploi program gener natur languag descript object knowledg chapter recal familiar exampl amplifi produc clean clean rh british rh clean british speaker produc muddi kind british amplifi rh british amplifi rh note answer exact string inton pattern note inform structur bracket correspond standard branch grammat bracket np semant chunk themat materi correspond tradit notion syntact algorithm present reli grammat formal call combinatori categori grammar steedman realiz inton make surfac form detail chapter flexibl notion constitu tradit grammar order account prosod phrase syntact phenomena coordin give detail algorithm determin inform structur bracket assign foci theme prosod phrase identif map inform structur constitu inton tune section turn attent problem determin divid utter theme exampl clear make context explicitli model hierarch model sidner involv segment discret chunk base varieti segment criteria attent intent describ segment relat concern global coher theori center theori joshi weinstein concern local coher segment defin segment paragraph primarili singl object concern local coher sentenc segment center theori formal track entiti segment describ relationship consecut utter theori identifi center entiti link current utter previou utter theori posit list call forward center list order languag potenti subsequ utter utter highli rank item list occur previou highli rank center call prefer relat relat determin type transit utter continu retain occur primari transit appli text tightli coupl descript singl entiti notion theme section share similar notion center theme establish unlik restrict defin proposit entiti center coher utter theme determin examin theme establish model consist collect theme deriv previou utter order call inform structur store compar theme entri correspond abstract semant theme string word realiz remaind term theme refer semant complet theme determin variabl search unifi theme found base center theori model local recent match give prefer themat definit result prefer continu retain transit determin theme determin abstract theme full semant complet semant semant themat abstract argument determin semant scenario natur languag gener intent produc spoken descript entiti knowledg amplifi bootstrap assum sole entri determin theme semant shown base prior repres compar theme top store semant form repres utter question updat includ repeat theme abstract variabl add proposit futur utter element semant theme lambda function center transit clean rh pitch accent specif establish framework identifi inform structur problem identifi proper placement constitu address previou section explain length previou mention strategi predict pitch accent system system adopt basic includ algorithm assign contrast focu serv distinguish multipl salient entiti previou mention strategi invok predic semant system track evok process semant system check boolean flag determin clean system consid concept repres symbol phonolog focu mark semant ffi shown consequ make move eventu gener accentu pattern ffi clean ffi produc clean rh demonstr section previou mention strategi fail accentu item stress order distinguish compet limit type system attempt gener short ignor problem determin long evok entiti fade model item address introduc form phonolog call contrast mark item requir focu ffl predic semant context question system produc shown eventu lead accentu pattern shown kind ffl clean rh base instrument analysi spoken data corpu tool slightli promin pitch accent assign item bear contrast focu eventu output accent higher pitch target accent presenc level pitch accent left implicit notat model explicitli system gener inton basic model contrast focu assign stand object set altern distinguish refer succe gener construct refer express includ number properti express common element set altern mark contrast focu oper ffl data structur notat convent describ algorithm collect entiti evok prior order recenc list limit size recent entiti push list retriev set altern object object belong class defin knowledg base set altern object restrict refer express set properti subset properti accent contrast list properti object order grammar nomin properti properti assign contrast focu themat begin isol entiti constitu entiti structur defin initi true fy set altern fxg fy fg algorithm fg fy restrict made base properti properti elimin member fpg endif fpg endfor object list properti set set altern restrict includ initi object explicitli refer prior set properti contrast empti properti restrict includ object satisfi properti knowledg base restrict properti cardin properti serv distinguish salient altern evok prior ad contrast set restrict properti chang properti distinguish ad algorithm easili understood work simpl prolog entiti set altern question entiti british amplifi british amplifi american amplifi produc clean success state algorithm illustr initi data attempt made restrict element base properti properti list stereo compon mention question left unchang add amplifi properti contrast set algorithm consid british alter exclud procedur share properti manufactur great britain restrict chang british properti ad contrast set reduc algorithm produc eventu answer accent linguist materi properti british clean produc accentu pattern british properti remain due question british amplifi american amplifi produc clean initi state fg amplifi properti restrict fg british properti restrict result result british clean fact restrict properti serv distinguish subset element set illustr case modifi contrast modifi realiz question reason british american restrict type object model amplifi fact leav british impli remain slight modif algorithm present possibl proposit make restrict base recent larger previou iter perform british properti restrict base british enter contrast set note modif affect question british amplifi british produc clean initi state fg amplifi properti restrict british properti restrict result ffl amplifi result british clean result simpler exampl shown algorithm remain produc proper result exampl requir multipl shown exampl present illustr simpl version altern set semant determin accent assign convei contrast distinct refer express summari chapter present algorithm process inform build semant inform structur gener inton utter theme base collect theme prior utter call theme utter determin manner similar determin question british amplifi american produc clean initi state fg amplifi properti restrict british properti restrict result ffl amplifi result british clean center theori articul produc phase algorithm phase invok previou mention heurist similar earlier relat work account instanc base set altern properti entiti salient algorithm work success properti entiti respect abil distinguish entiti altern chapter exampl algorithm effect question british american amplifi british produc clean initi state fg amplifi properti restrict british properti restrict result ffl amplifi result british clean chapter inton combinatori categori grammar structur introduc previou chapter form basi compet model organ proposit put spoken job syntact compet model dictat map proposit string spoken word prosod model natur languag gener structur constraint orthogon tradit notion syntact constitu pair theme answer includ subject np cross tradit bracket american amplifi produc muddi kind british amplifi british amplifi theme grammat formal transform syntact bracket orthogon prosod structur utter forbid syntact bracket isomorph prosod structur accept compet model introduc separ prosod syntact compon comput model aim simul spoken languag product separ process oper dispar structur necessarili introduc comput complex obfusc issu semant interpret assign syntact constitu inton phrase reason adopt flexibl notion syntact constitu offer combinatori categori grammar formal advoc handl construct involv syntact constitu shown john mari newest member team mari member team john admir john gave dog flower note steedman type constitu requir account prosod phrase coincid requir type constitu motiv develop grammar chapter present combinatori categori grammar govern syntax demonstr grammar util tandem restrict space utter section present simpl algorithm produc semant inform structur prosod annot utter algorithm sentenc inton mark semant messag present section combinatori categori grammar grammar attract comput requir power natur languag process limit natur languag gener believ fall class languag postal base construct depend dutch comput linguist turn mildli grammar tractabl polynomi gener languag class combinatori categori grammar steedman extens pure categori grammar bar lexic grammar gener mildli languag lexic grammar lexic item set constraint determin wai combin lexic item syntact constitu grammar gener small set rule oper govern syntact deriv grammar natur gener impoverish lexic includ larg number rule govern syntact deriv choic syntact compon tradit grammar fundament maintain abil process portion utter semant prosod phrase pure cg includ function applic rule weakli cfg type grammat formal adapt properti varieti categori formal produc similar type syntact constitu grammar grammar shown possess gener power weakli weak defin definit weakli set string gener ident set string gener underli deriv structur string ident formal definit combinatori categori grammar set vn atom base atom complet set defin definit atom categori vn categori vn set atom categori ii categori categori iii nc categori categori categori nc function categori argument categori result categori function categori written forward backward slash set vn atom categori left type slash left categori form unambigu written vertic slash variabl rang set ng definit defin vn definit def vn finit set lexic item deriv vn finit set atom subset complet set categori deriv tree distinguish element vn function map element finit subset power set finit set finit set combinatori rule govern categori combin gener power depend set combinatori rule basic rule categori grammar function applic definit note slash categori dictat appli categori left definit adjac combin forward function applic variabl definit adjac combin backward function applic variabl combinatori rule capabl gener languag unabl gener languag bg simpl gener shown deriv string involv forward function applic rule gener rule definit introduc rule set gener power expand languag present type function composit rule type rule type rule function categori mathemat function function ffi creat result serv input type function composit includ present gener forward composit prove english deriv definit adjac combin forward function composit variabl rule reduc forward applic rule note simpl forward composit rule deriv string grammar deriv structur illustr type rule categori switch function argument role deriv categori consum function applic categori form type categori function categori return result function categori composit type rule expand gener power formal stem abil adequ restrict power gener subset languag natur languag english problem address natur languag combinatori categori grammar emploi describ syntact phenomena number natur languag steedman shown varieti english dutch subordin cross illustr jan mari al jan mari swim jan mari hoffman present extens call handl free word order phenomena present describ simpl english involv set atom categori function applic composit rule write syntact categori transit verb simpl produc includ agreement featur syntact categori transform atom categori np term argument agreement featur person argument agreement featur number categori transit verb produc produc subj obj obj produc subj obj obj produc obj obj produc obj obj remaind follow prolog convent identifi variabl capit letter categori list variabl obj rang set subj obj rang set variabl instanti invoc deriv rule build semant conveni assign semant interpret categori simpl approach associ term lambda calculu syntact categori lambda express categori produc note order curri variabl express depend constraint syntact categori syntact categori produc princip function object np np semant interpret function interpret object np comparison syntact categori semant reveal correspond syntact semant notat simplifi directli associ syntact categori semant interpret accomplish infix colon oper higher forward backward lower syntact semant term connect categori verb produc written shown variabl semant interpret noun phrase produc produc subj obj obj produc produc subj obj obj produc produc obj obj produc produc obj obj categori verb produc function noun phrase function singular noun phrase sentenc produc type categori shown convei inform rel word deriv rule combin word prohibit deriv rule defin semant interpret combin categori deriv rule oper fulli illustr rule necessarili unif constraint variabl syntact agreement featur semant interpret instanti deriv number featur categori voic verb featur omit present exampl avoid unnecessari interest reader refer appendix numer exampl featur repres discuss forward backward applic rule suffici perform deriv rule function categori unifi expect argument proper side direct combin assign result categori function applic rule english shown definit definit adjac categori unifi combin forward function applic forward applic abbrevi symbol definit adjac categori unifi combin backward function applic backward applic abbrevi symbol applic easili deriv sentenc tradit branch shown speaker produc sound provid rang deriv requir account prosod structur flexibl surfac constitu requir note effect rule unif constraint produc semant interpret result categori english construct illustr order handl english minim includ forward composit rule restrict type extend power formal fragment restrict forward composit shown definit function combin result categori function unifi argument categori left function definit adjac categori unifi combin forward function composit forward composit identifi deriv symbol reminisc curri composit combin stipul argument verb possess categori categori subject noun phrase function predic verb shown categori object noun phrase categori function transit verb left predic categori function sentenc miss object complet sentenc speaker speaker sound subj subj subj subj obj obj sound sound sound result includ forward composit simpl transit sentenc produc deriv branch left branch shown exampl sake np categori shown agreement featur speaker produc sound speaker produc sound deriv produc interpret ident syntact bracket flexibl notion constitu permit syntact bracket prosod phrase structur isomorph bracket correspond prosodi expect sentenc utter question produc shown bracket correspond prosodi expect sentenc utter question speaker shown prosodi exampl previou section serv illustr flexibl natur syntact constitu inher formal syntact bracket exampl structur isomorph prosod phrase context grammar inton produc prosod constitu reflect structur valid syntact bracket requir complet separ process handl syntax grammar emploi tandem gener spoken sentenc remaind section devot defin prosod grammar illustr constrain syntact deriv basic strategi invok syntact prosod grammar concert prosod constitu condit definit condit stipul grammar oper constitu combin yield larger constitu rule combin syntact prosod definit prosod constitu combin syntact categori syntact combinatori rule prosod categori combin prosod combinatori rule comput complex grammar oper tandem depend individu gener capac prosod grammar exce syntact grammar affect comput tractabl prosod present requir forward backward function applic rule limit composit fall class grammar prosod constitu condit defin prosod grammar link syntact grammar establish methodolog construct prosod grammar discuss introduc methodolog appeal similar prosod syntact constraint groundwork prosod grammar linguist build grammar describ syntact model subset natur languag english idea gener illustr type grammat formal handl interest syntact construct necessarili involv full complex languag model comput linguist build highli constrain grammar specif requir comput applic mind present grammar govern similar approach prosod grammar offer intend cover wide rang inton pattern model prosod variat tightli constrain mode present prosod grammar present methodolog construct prosod grammar emploi tandem syntact grammar construct singl prosod grammar illustr stage prosod grammar increment develop delv process describ prosod clarifi import distinct framework set recal defin inton phrase collect intermedi phrase boundari intermedi phrase defin sequenc pitch accent phrasal tone approach born pure analysi spoken data attempt gener prosod paramet artifici speech notat minim number inton fail make distinct lengthen boundari notat method differenti prosod ident present research aim prescrib set rule govern prosodi synthet distinct crucial tune descript complet partial theme theme tabl inventori tune tune descript complet partial theme theme tabl inventori tune contrast recal notat handl granular boundari speech synthesi section notat map inform structur constitu inton contour establish section subset contour gener simpl statement easili defin tabl show basic inventori tune concern present research stipul lexic item bear contrast accent receiv tune shown tabl admit model base notat convent map properti form basi construct prosod grammar boundari combin pitch accent left boundari combin boundari constitu prosod unmark freeli combin correspond tune inform structur constitu base limit type discuss reader infer tune portrai function situat constitu bear prosod inform multipl pitch accent occur inton phrase complet inton phrase combin complet inton phrase constitu length bear pitch accent promot full themat inton phrase theme promot assumpt deriv system modifi assumpt relat inform structur aspect prosod grammar constitu recal process model present chapter postul inform structur unit theme updat model discov stipul complet phrase complet theme combin complet grammar necessarili prohibit assign constitu categori complet phrase surround constitu potenti part phrase ambigu point deriv model updat structur isomorph inton syntact structur inform prosod base assumpt list oper tandem accord prosod constitu essenti synchron grammar addit addit wai grammar interact grammar associ placement pitch accent utter element structur accomplish lexicon associ lexic item categori categori produc shown assum categori bear pitch accent mark assum categori bear pitch accent mark contrast inform produc produc produc produc prosod syntact grammar interact govern categori assign inton boundari prosod effect boundari stretch word inappropri associ singl lexic item manner pitch accent correspond lexic item boundari link categori prosod grammar link boundari categori categori prosod unif constraint syntact part boundari categori gener copi categori left categori constitu inton mark complet inform structur theme captur intent assumpt simpl approach build prosod grammar base assumpt assign pitch accent categori function previou version present research steedman prosod categori constitu bear pitch accent note combin complet inton phrase depend boundari evidenc fact theme possess boundari tone demand break order encod inform function categori pitch creat distinct result type type boundari pitch accent includ categori prosod lexicon pitch fact pitch accent occur frequent speech boundari impli deriv search space substanti larger combinatori properti complet phrase encod boundari categori type boundari function pitch accent boundari categori appropri encod inform combin complet inton phrase build prosod inton pattern discuss previou simplest type utter includ singl themat phrase singl phrase singl phrase singl themat phrase numer exampl illustr contour simpl offer assign categori utter constitu themat phrase utter level phrase level rh grammar detail illustr suitabl model prosod possibl grammar instanc multipl phonolog focu multipl pitch fail distinguish contrast focu grammar account word occur pitch accent illustr begin chapter chapter regular express requir occurr item mark variabl exampl rang syntact type rang set stand grammar pitch accent variabl boundari interest aspect grammar warrant discuss type categori assign pitch function boundari function pitch accent type similar pitch accent combin invoc function applic similar pitch accent combin instanc function instanc composit applic note composit rule requir case gener composit rule definit prosod composit rule restrict case rightmost categori argument result captur definit prosod forward function composit definit adjac prosod categori unifi combin forward prosod function composit forward composit abbrevi symbol lexic item pitch assign null tone categori combin pitch accent categori forward pitch accent categori left forward prosod yield constitu bear pitch accent categori item bear null tone categori combin item prosod function composit null tone categori inton tune spread arbitrarili long constitu lexic item constitu pitch accent addit constraint null tone categori unifi categori unifi ensur lexic item bear pitch accent combin boundari categori preserv properti boundari combin complet phrasal constitu boundari singl lexic assign categori syntact grammar boundari categori prosod grammar includ prosod part boundari combin complet phrase part boundari categori combin backward applic categori yield categori annot prosod categori categori repres complet inton inform phrase deriv prosod categori infix higher categori slash point illustr note deriv involv syntact prosod combinatori symbol denot combinatori rule involv deriv step written immedi symbol denot syntact rule ffi oper repres asterisk british amplifi categori form combin categori applic rule set addit rule reduc categori includ defin definit syntact categori reduc categori syntact combinatori rule valid deriv step prosod combinatori rule valid deriv step effect rule complet inton inform phrase combin complet inton desir categori shown combin form categori repres type result deriv def def grammar cover rang prosod possibl limit examin chapter recal account prosodi inform structur multipl gener proposit realiz result inton phrase proposit abstract open proposit repres entiti open proposit respect oper lambda john john proposit realiz sentenc shown attend accent contrast mark order simplifi construct grammar cover exampl multipl phrase combin assign categori constitu shown scheme number phrase left utter final number phrase combin form utter initi exampl type utter scheme shown prosod constraint captur grammar assign categori boundari love joan utter level phrase level rh grammar pitch accent variabl nz boundari illustr deriv phrase utter british highli inton question amplifi british amplifi distinct contrast repres crucial element theori focu chapter encod distinct prosod grammar grammar encod fact referenti contrast item heavili stress item handl contrast item occur phrase requir level discuss section illustr utter phrase level constitu grammar produc recal pitch accent assign subscript subscript mark pitch accent option carri contrast superscript mark success occurr pitch accent occur order realiz contrast pitch accent synthet theme categori assign rel accent height valu phrase level utter level constitu scheme present appeal assert accent contrast item overshadow accent phrase writer contrast accent accent reliabl evid suggest contrast pitch accent realiz pitch rang absolut higher pitch rang accent assert forc contrast accent determin overshadow gener simplifi model set default level contrast accent overshadow accent grammar multipl contrast accent forc realiz level stress pitch accent boundari categori grammar utter level fh fh fh phrase level fh fh fh grammar pitch accent variabl nz boundari note categori combin high pitch accent note pitch accent combin pitch accent properti grammar encod fact multipl contrast pitch accent phrase gener realiz pitch level discuss formal properti abil encod semant prosod aspect turn problem gener abil captur inform structur prosod aspect constitu parser capabl produc output richer simpl syntact tree parser easili construct semant determin articul assign focu inform structur constitu theme establish salient contrast word realiz theme prosod unmark give parser access prosod unmark theme identifi match candid theme establish theme current implement work accept match recent establish theme model theme parser longest string prosod unmark word theme themat constitu interpret model updat includ parser produc influenc interpret subsequ utter simplest kind parser type previou section parser current implement emploi parser prefer reduc shift make direct theori deriv interpret semant theme type parser transpar strategi effect realiz multipl contrast appli equal polynomi respect underli theori gener parser sketch readili made construct interpret inform structur shown specif mark easi gener prosod annot string semant theme start describ syntact semant aspect tactic defer discuss prosodi moment design option includ semant model hinrich schabe adopt hybrid emploi basic strategi advantag notion avoid search techniqu exhibit ineffici characterist advantag reli specif semant requir semant composit prolog gener procedur independ grammar modular charact system develop compet grammar offer basi prove complet implement respect compet theori syntact gener written work start syntact constitu fulli lexic semant invok reduct rule determin combin yield origin invok gener gener base case occur categori gener unifi hoffman develop approach gener word order backtrack gener multipl lexic realiz input appropri compet realiz made lexic higher level sentenc consid fulli encod input issu lexic choic address detail chapter categori lexicon gener utter categori walk categori unifi categori program check combin rule order backward function applic categori walk walk variabl call gener walk find unifi categori walk lexic item walk unif forc complementari categori unifi np gilbert yield lexic item gilbert gener invok concaten result gener string natur gener scheme number import consequ order gener postul determin gener succe chosen gener walk enter potenti infinit unifi categori lexicon gener gener act function head act argument combinatori rule strictli observ ensur semant inform constrain search space prohibit spuriou unif incorrect item lexicon refer gener scheme approach disadvantag gener techniqu suscept nontermin problem path search space lead unif item condit abort path question search depth note function applic rule act function head curri argument parent english limit number argument function categori abort search path limit number curri argument categori possess current implement categori minimum construct involv verb note strategi prohibit gener categori argument complex categori categori indirect categori composit rule curri argument parent bound type necessarili avoid endless case gener categori form fulli instanti express variabl function applic rule fail produc gener reli composit rule ident categori renam continu indefinit rectifi situat invok composit rule origin categori instanti argument result solut limit type deriv retain simplic transpar algorithm limit depth gener solut exampl type sentenc gener piano graduat student gener piano scott gener procedur immedi appli prosod augment grammar enforc prosod constitu condit step gener pair consid combin pair prosod consid gener prosod combinatori rule exampl illustr gener inton theme utter patient left patient exampl manifest inton result move themat focu proposit semant theme patient patient summari chapter present inton compet model framework combinatori categori grammar mildli grammat formal congruent prosod inform structur repres simplif compet model prosodi develop syntact tradit framework transform grammar hall structur similar linguist entiti model languag gener symbol separ syntact categori prosod categori lexic item mark consid involv singl path semant spoken requir addit structur map surfac syntact form inton domain issu ffl formal definit provid inform analysi potenti gener mildli languag combinatori notion function gener function composit introduc demonstr numer exampl ffl suitabl describ syntact phenomena natur languag exhibit english construct forward composit shown permit deriv simpl sentenc violat typic syntact gener semant structur constitu render handl inton phrase cross tradit syntact boundari ffl interlac prosod syntact govern prosod constitu stipul syntact deriv categori combin prosod categori combin ffl techniqu build prosod demonstr increment develop grammar grammar section encod level inton detail account type inform structur develop chapter level inton detail grammar instrument develop natur languag gener program develop chapter ffl simpl parser present deriv semant inform structur sentenc ffl driven algorithm gener sentenc inton annot introduc gener algorithm shown applic broader natur languag gener task chapter congruenc inform formal grammar present form ideal framework model spoken languag product chapter adopt framework task gener spoken languag semant chapter inton natur languag gener difficult give collect word rhythm emphasi phrase sentenc import sound good includ tone accord content intent result monoton voic sound nichola previou establish necess model inton context provid framework spoken languag product integr level inform inform structur constitu chapter present algorithm build inform structur turn gener algorithm chapter produc sentenc prosod annot present chapter comput implement demonstr algorithm fit produc spoken output natur languag gener framework work present fulli address rang prosod problem exhibit result illustr model contrast system implement section section present program spoken type input inton annot program demonstr abil model previou chapter gener radic inton contour singl sentenc depend context steedman question gener respect simpl knowledg rule lexicon system gener short describ object knowledg base respect context vari inton featur appropri task involv organ gener multipl sentenc coher draw research natur languag gener structur section content gener sentenc plan issu introduc discuss respect gener framework chapter conclud descript gener program relat model spoken languag product set chapter implement queri implement system present serv justifi appropri spoken languag model present consid narrowli limit assign theme straightforward context question arrang highlight contrast relationship contrast inform structur task section base inform structur focu previou utter produc direct question task easili elicit broad rang possibl articul focu placement task speech spoken inton parser prosod annot question content gener gener prosod annot model figur architectur queri architectur queri shown figur identifi kei modul relationship knowledg base underli depend input output process begin fulli segment prosod annot spoken shown simpl make direct combinatori prosodi theori identifi semant question prosod categori grammar parser determin inform structur question mark item ffi ffl warrant inform structur note program start speech obtain hypothet system translat wave string word inton mark question illustr compon produc muddi compon produc clean case theme question prosod parser match candid constitu establish model constitu unifi recent theme model theme question match theme question longest prosod unmark constitu syntact order facilit interpret subsequ parser updat model newli discov theme input stream act pure passiv produc side effect model content gener task determin semant inform structur reli simplifi assumpt foremost notion question sole determin theme includ specif focu placement type pitch accent eventu mark differ pitch accent mark question semant structur determin instanti variabl lambda express simpl prolog queri syntact semant syntact semant theme work rule syntact semant complement theme respect semant intend utter assign variabl instanti prolog work scratch basi altern set entiti knowledg focu assign algorithm chapter question content gener produc np output content gener scheme chapter produc string word mark repres shown amplifi produc clean bass final aspect gener involv translat string form usabl suitabl speech current implement bell laboratori tt system speech wave overrid default inton specif produc present program tt system unmodifi program fine tune lexicon tt easi output queri program easili adapt previou version present research involv medic domain medic expert system develop pennsylvania al due special entri ad tt pronunci dictionari result queri system previou section produc sharp distinct inton contour case manifest basic combinatori possibl pitch accent placement tune select produc program sentenc exampl illustr system abil produc appropri inton contour singl string word control context exampl result sound distinctli unnatur context exampl illustr necess distinct pitch accent locat exampl occur altern theme tune convei intend proposit context exampl show system make distinct focu placement theme base context utter possess inton pitch accent locat crucial convei contrast properti amplifi produc clean amplifi produc clean british amplifi produc clean amplifi produc muddi amplifi produc clean british amplifi produc clean wave file exampl section anonym ftp directori british compon produc clean british compon produc clean british amplifi produc clean british compon produc muddi british compon produc clean british amplifi produc clean american amplifi produc muddi kind british amplifi british amplifi produc clean american amplifi produc clean clean rang british amplifi british amplifi produc clean british speaker produc muddi kind british amplifi british amplifi produc clean british speaker produc clean clean rang british amplifi british amplifi produc clean evalu result formal evalu output shown left futur research complex design simpl experi subject rate rel pair produc encourag consciou judgment make result difficult evalu typic psycholog experi requir subject awar variabl test simpl experi mention requir subject activ variabl case inton experi conduct approach evalu output experi present synthet speech test abil subject correctli identifi refer experi includ task method manipul irrelev variabl syntax segment aspect speech experi avoid problem mention scope make suit examin psychologist psycholinguist assert experi produc encourag result base inform present output confer steedman gener framework task natur languag gener divid content goal satisfi structur surfac proposit convert sentenc nlg research posit intermedi gener term sentenc abstract semant map fulli constrain sententi realiz reiter mellish elhadad trend nlg commun architectur model present implement previou research includ determin inton contour gener issu address recal identifi distinct level inform articul focu placement theme model chapter coher defin sequenc relationship content utter themat materi utter ui decid utter relat previou utter semant inform share consecut utter process organ highest level concern proposit theme handl content determin phase stage nlg model content gener ensur consecut pair utter share semant materi order utter exist process determin foci theme divid determin entiti proposit determin linguist realiz mark convei focu task handl content phase nlg model reli construct refer consid domain sentenc plan stage entiti determin stand contrast appeal model salient pool method contrast distinguish placement pitch accent resolv choic refer express made recent gener research emploi level refer express separ intend semant content determin sentenc process stage present approach resolv issu contrast focu assign sentenc process stage content gener content utter plan base previou gener base construct schemata rhetor structur schemata put mckeown involv select proper templat convei desir messag flesh detail base inform templat essenti written regular express option potenti repeat great deal flexibl result text sound repetit set templat appli equal domain set templat design medic applic produc natur text busi applic system mckeown gener real research incorpor flexibl gener process emploi rhetor structur theori mann thompson hovi attempt organ text identifi rhetor relat proposit knowledg base approach theoret exhibit number problem difficulti defin finit set rhetor predic approach gener plan problem offer plan describ architectur layout gener produc tree proposit link rhetor relat physic spatial properti repres present framework organ content hybrid approach mention present produc descript object knowledg base inton make proper distinct contrast salient entiti requir object identifi defin begin reminisc mckeown schemata strict rule order inform order determin domain specif knowledg commun intent belief hearer knowledg system includ set rhetor constraint rearrang order present inform order make rhetor relationship salient approach proven effect present research requir determin broader rang type implement gener queri system section demonstr abil theori laid previou chapter model inton base relianc explicit mark inton contour question greatli diminish practic applic system queri system model context limit relationship question demonstr underli theori abil handl subtl type contrast situat real gener program attempt address issu produc inton contour base connect sentenc singl object system exhibit abil contrast altern entiti properti explicitli evok occur interven sentenc rule accent assign rule content gener sentenc planner surfac gener speech commun goal intent prosod annot spoken output model knowledg base figur architectur gener content gener architectur gener program shown figur arrow repres comput flow line repres depend modul remaind section descript comput path system respect singl input program goal describ object knowledg case varieti fact hypothet stereo compon input commun intent goal affect ultim shown goal intent result radic intent describ domain knowledg base complet divorc gener algorithm easili modifi encompass similar domain inform knowledg base select includ output set relat mutual believ speaker determin knowledg base fact rule support commun intent speaker program intent persuad hearer bui offer proposit believ hearer import make relev proposit result output system vari hearer system model rel fact knowledg base support intent speaker system convei proposit moder support intent make hearer bui rule program consult fact knowledg verifi properti hold includ fact set properti convei shown section content gener modul organ relev inform knowledg base hybrid text plan schemata rhetor structur theori approach hovi rule shown standard prolog horn variabl encod simplist notion knowledg base domain structur approach content gener start simpl descript templat specifi object explicitli identifi defin proposit put relev proposit object question linearli organ belief contribut intent analog domain structur gener small set rhetor predic rearrang linear order proposit set sentenc stand interest rhetor relationship realiz output rhetor predic assist maintain coher output conjunct predic specifi proposit share theme realiz order avoid excess topic shift contrast predic specifi pair proposit explicitli contrast realiz rhetor constraint tempor easili ad current domain result set properti roughli order support intent properti order set entiti content gener ensur convei inform entiti refer succe hearer accomplish invok content gener item goal describ simpl intent inform hearer refer complet inform convei program organ hierarch relationship shown proposit select program hearer believ interest design amplifi review amplifi receiv belief hearer interest bui power amplifi justifi includ inform cost power rate schemata approach templat type case type approach straightforward templat generaliz domain rst approach attempt organ text identifi rhetor relat proposit knowledg base approach maxim dramat search space identifi set rhetor relat cover wide rang exampl mean trivial task set proposit gener hearer note proposit combin larger proposit accomplish rhetor constraint determin proposit contrast belong set altern entiti knowledg base belong set altern proposit knowledg base phase content gener recogn depend relationship properti convei base share entiti repres extens rhetor arrang proposit ensur consecut utter share semant materi theme utter effect strong bia center continu retain section determin segment proposit care arrang proposit ensur share semant materi consecut utter similar approach shaw produc summari activ telephon rout plan arrang messag share inform output conjunct ellipsi effici convei inform avoid repetit sentenc plan coher constraint previou section sentenc planner make form proposit realiz accomplish simpl set includ definit isa properti realiz matrix verb isa properti realiz noun noun phrase properti properti realiz matrix verb properti realiz modifi rel illustr part result appli rule output content gener center shift rare necessit short describ singl object shift gener proposit entiti mention fit singl sentenc invoc algorithm describ entiti produc inform refer situat seldom occur rule suffici produc text broad rang inton gener approach incorpor detail rule replac robin robin mckeown emploi techniqu addit inform ad sentenc plan level addit deep syntact specif similar properti robin approach properti hook exist deep syntact specif locat varieti form dss sentenc score elabor score career high number linguist interest aspect sentenc import aspect present determin focu assign algorithm emploi sentenc access model knowledg work set chapter properti entiti semant inform structur mark mention assign made respect entiti list section similar structur evok properti aspect semant form consid correspond interpret item function word item assign focu base implement previou mention heurist assign ffi focu shown support step focu assign algorithm check presenc contrast proposit structur store histori inform structur proposit consid contrast contrast pair contrast pair entiti contrast functor situat illustr john mari john hate entiti determin belong set altern knowledg set infer defin class hierarchi trace search common size set altern assert put contrast effect proport size set effect similarli relat distanc entiti knowledg base present implement consid entiti parent grandpar class altern contrast graduat approach entail contrast effect contrast focu algorithm easili shown examin gener utter contrast utter shown gener program finish gener output exampl assign goal describ entiti amplifi appli step focu assign contrast entiti mark ffl shown instanc class amplifi describ class amplifi pair entiti consid stand contrast relationship support step algorithm determin abstract entiti properti stand step contrast focu algorithm section determin element contrast refer succe specifi stand contrast properti tube design design convei hearer appli step focu assign result shown contrast desir support final step sentenc plan phase gener comput serv input gener section modul straightforward procedur build refer express guidelin state entiti part theme current realiz previou utter restrict realiz pronoun entiti explicit realiz modifi includ determin definit realiz noun phrase modifi result semant form shown present focu sentenc planner concern determin inform structur correl inton pattern accentu number issu gener consid sentenc planner minim treatment issu lexic choic verb handl directli map proposit verb lexicon noun lexic choic made respect algorithm construct refer express research mckeown elhadad robin mckeown robin studi problem lexic choic gener framework encourag result system produc sentenc depend manner constraint convei preposit phrase verb techniqu conflict inform structur aspect present sentenc stand incorpor futur research denver nugget beat boston narrow denver nugget edg boston surfac gener result output sentenc surfac gener modul section consult grammar dictat gener syntact prosod produc string word prosod shown output modul easili translat form suitabl speech produc spoken output desir inton tube amplifi modul shown figur implement prolog system produc type output shown interpret singl satisfi goal describ system bell laboratori tt implement easili adapt object note paragraph includ similar type radic inton due context inton pattern exampl result speech sound highli unnatur exampl show contrast focu occur item establish exemplifi contrast accent pronoun complet output program exampl found appendix describ amplifi cost hundr produc hundr audio audio journal recal result inton assign slightli higher pitch accent bear subscript mark contrast focu determin algorithm section wave file exampl acquir anonym ftp directori describ tube amplifi cost hundr produc hundr aspect output shown worth note includ inform output base inform support commun intent recal intent descript shown convinc hearer audio compon program model inform consid hearer import make posit determin proposit put utter program assum hearer specif knowledg object knowledg base note proposit put gener assum incorpor hearer set belief descript phrase audio inform paragraph omit present proposit audio gener recogn similar proposit proposit abstract singl variabl open proposit audio program properti produc audio aspect contrast inton effect exampl deserv attent content gener rhetor contrast item elig receiv stress order convei contrast contrast item mention phenomenon illustr contrast stress utter situat produc contrast proposit gather content planner singl invoc gener identifi contrast rhetor predic appli contrast stress due applic conjunct rhetor predic content gener proposit merg singl proposit entiti creat insert model initi set altern focu placement algorithm chapter includ entiti compon initi list properti includ conj restrict base properti elimin singl element restrict conj properti requir order elimin conjoin altern set conj properti elimin receiv contrast focu word stress final output rang exampl implement work rang exampl fall categori descript system displai larg flexibl select inform present base program model hearer belief relationship belief program commun intent rhetor constraint inform packag base semant relationship inton phrase accentu made base cumul context set chapter inform elig receiv stress stand contrast mention inform strike exampl pronoun receiv stress inton gener produc effect exampl illustr point list exampl entiti knowledg gear hearer hearer believ interest distinct characterist amplifi function inform uniqu histori hearer believ concern function inform detail note hearer inform alexand graham bell occup program inform hearer inform believ interest modern stereo system amplifi design albert built alexand graham bell cost hundr dollar tube amplifi cost hundr produc watt channel built alexand graham inventor tube amplifi exampl consecut illustr abil program contrast object knowledg base note program describ slightli type inform convei intend hearer proposit stand direct contrast realiz accent british cd player cost hundr plai american amplifi cost hundr produc hundr watt channel limit result present support theoret aspect model spoken languag gener previou comput implement model limit number wai implement place restrict constitut set altern entiti knowledg base program consid entiti parent grandpar class consid altern program unabl produc output type shown requir semant dispar item knowledg base specif engin handl exampl mari john hockei game didnt intent watch watch game mention sentenc accent sentenc comput basi altern set previou mention heurist order present algorithm includ contrast knowledg base includ class fairli directli link object sport knowledg extrem robust order account occurr contrast accentu gener make strict limit lexic map high level concept directli word note model present complet compat sophist lexic choic algorithm mckeown elhadad robin mckeown robin futur focu placement algorithm easili adapt oper type intermedi lexic structur produc gener theori implement reli select size domain complex issu domain requir set rhetor predic organ inform content plan phase gener narr domain requir tempor constraint determin order event rhetor constraint process time necessarili constraint requir proposit set select content planner compar proposit total number comparison constraint polynomi size set proposit select includ compar set fact describ program hearer consid import respect underli intent speech size knowledg base number comparison polynomi size knowledg base size knowledg base affect runtim space complex size lexicon consequ input surfac gener assum fulli lexic logic program perform linear scan collect item algorithm halt solut spuriou unif incorrect item lexicon runtim surfac gener unaffect initi linear scan modest theori implement applic applic involv tightli constrain interfac expert system summari chapter present implement demonstr theori previou chapter model spoken languag product implement spoken type input inton annot program abil gener radic inton contour singl sentenc depend context question gener respect simpl knowledg rule lexicon implement gener spoken object simpl knowledg base process natur languag accord recent literatur divid content sentenc surfac gener point role inton gener process inton phrase depend utter theme relat consecut sentenc matter inform structur inton larg resolv plan phase accentu made respect linguist realiz properti entiti choic refer matter fulli resolv sentenc plan phase primari implement test hypothesi involv languag abstract semant proposit surfac phonolog syntact treat structur congruent consequ spoken languag gener view exemplifi architectur shown figur secondari implement provid platform increment test refin compet model inton embodi categori rule chapter applic relat research princip tenet underli dissert inton semant link number research begun explor semant form commun facial convei attitud finer semant nuanc similar convei inton examin facial express inton featur act commun messag specif context chapter summari relat work mean facial express relat inton theori comput model previou chapter section comput implement link gener chapter task automat produc facial anim note theori facial express discuss contest implement advoc theori assum theori plausibl model describ human facial express intent present implement provid comput platform refin evalu discuss research implement chapter repres joint effort catherin facial express thought convei word facial express facial verbal messag facial express accompani flow speech synchron verbal punctuat accent phonem segment facial express substitut word string spoken messag facial express necessarili occur synchron speech kendon behavior person presenc absenc feedback affect behavior particip consist exchang utter physic manifest speaker punctuat reinforc speech nod smile varieti facial gestur listen interact vocal shift gaze particip facial express gaze behavior import aspect interact serv control flow speech regul exchang express depend heavili relationship individu attitud social ident consciou influenc particip synchron hypothesi link inton properti facial express bodi tend occur synchroni sander impli occur speech bodi movement time synchroni boundari end inton phrase gestur establish congruenc pattern speech gestur bodi pelachaud preliminari version present text prevost part chang direct movement sustain direct boundari form cluster isomorph abstract transform word begin ey hand head eyebrow complet end word addit synchroni speaker inton gestur facial listen tend move synchroni speaker boundari listen gestur coincid boundari speaker exhibit independ type movement interact synchroni occur word level subject directli involv directli move coordin speaker particip react speaker flow speech synchroni bodi facial motion occur level includ inton phrase utter movement adapt phonem level ey occur word level phrase level hand facial express denot emphasi gener match segment major chang topic complet chang bodi postur occur link facial express speech facial express occur continu complement reinforc inform deliv audio channel eyebrow complement speech signal punctuat element speech ekman differenti facial express emot signal signal ti inton gener concert emot learn stereotyp perform unconsci speaker facial express classifi model order obtain believ facial anim produc replac common verbal express correspond movement mean cultur depend nod directli translat verbal statement produc speaker occur word peopl order icon accentu emot call referenti express mock made convei signal emot speaker common nose speak referenti movement part emot nose part facial express signal call made accentu involv movement eyebrow ekman found eyebrow frown commonli signal head ey motion illustr accent word accompani rapid head movement al bull blink occur stress vowel signal accent term stretch syntact portion sentenc gener call underlin punctuat movement occur due hesit signal punctuat mark comma distinct type head movement occur boundari point intermedi phrase underlin slow movement final coincid al ey blink smile occur fill serv signal speaker search frequent accompani frown brow ey eyebrow end utter signal reflect context anxieti question mark accompani movement utter statu question base inton syntax regul movement interact speaker listen section detail group facial action listen part regul involv listen speaker listen feedback speaker smile eyebrow head nod signal listen understand speaker commun eyebrow signifi listen frown mark misunderstand manipul correspond biolog requir blink ey wet lip affect displai facial express emot tempor characterist facial action facial movement tempor onset long express apex long express remain apex posit offset long express disappear facial express emot differ paramet express sad slow express happi short onset express listen polit smile smile differ emot express durat late earli paramet extrem import anim data valu vision system extract tempor paramet yacoob davi pelachaud al paramet facial express al emploi attack sustain ey behavior visual behavior import featur main function regul flow signal search feedback request express emot influenc person behavior walker human sensit ey behavior perceiv chang ey direct ey contact import method establish relationship commun ey contact friendship speaker person ly experienc difficulti organ speech peopl tend seek mutual gaze ey movement defin direct point point percentag ey contact gaze durat ey contact cook common metric ey behavior ey glanc object interest longer period time ey movement ey saccad movement point ey forc fix visual field blur examin ey scan salient featur repeat cycl pictur viewer found primarili ey mouth remain region face scan time cook chang focu focu distant easili perceiv correspond displac closer close focu distant focu ey environ ey attract object surround environ ffl ey attract move object tend pursu ffl ey fix object task length depend chang state complex task ffl ey local import object ffl ey hand movement coordin ey follow phase hand manipul object al gaze speech gaze plai import role process inform social interact synchron determin inform sought gaze link inton pattern control commun process cook ey contact broken stop reestablish particip begin speak listen speaker speaker listen repli speaker break gaze gener listen fluent speech hesit tendenc end phrase direct gaze maintain phrase boundari begin phrase movement similar punctuat mark written text gaze behavior part system determin peopl negoti speak turn meet duncan signal system ffl displai begin speak speaker turn head listen start speaker ffl speaker speak turn assur listen occur complet grammat speaker turn head listen frequent listen emit signal show involv turn speaker turn ffl occur gener signal speaker doesnt emit signal gaze listen emit probabl action listen vari action speaker signal emit speaker listen react behavior speaker signal gener visual head head gaze includ audio cue audio cue consist complet speaker emit vocal agreement clarif restat speaker utter signal part regul group facial express introduc section ffl frequent signal speaker turn head listen ffl emit speaker give speak turn signal consist gestur syntact clue speaker turn head listen end assum relax posit termin hand bodi part ffl listen request speak turn listen gener speaker smooth turn exchang speak turn overlap occur speaker listen emit coordin peopl break ey contact avoid gaze move head chang direct gaze frequent accompani head movement cook lincoln sad person tendenc downward turn head downward case predict head gener start move eventu follow rapid movement found fast ey turn unexpect sudden event gener head turn millisecond ey move faster stop movement fix target head ey rotat opposit direct order maintain focu target blink ey blink serv accentu satisfi biolog blink ey utter blink ffl start time ey closur ffl amount time ey close ffl start time open ey ffl amount time ey complet open form blink ffl period blink correspond biolog necess ey wet cook sec closur sec close sec apertur time occurr blink emot depend experienc emot excit amount blink attent concentr thought ffl reflex blink occur irrit sudden event bright light fast move object approach occur ffl voluntari blink serv speech accentu word head movement continu sequenc head movement support verbal stream head movement shake agreement mainten flow turn direct head link emot sad person turn head act deictic indic head movement reflect difficulti coincid verbal hesit colleagu examin relationship junctur bodi movement establish link tempor aspect movement prosod distinguish class head motion base amplitud frequenc slow movement found occur ordinari movement rapid movement hz postur shift defin linear movement movement chang axi wide amplitud result experi show distinct pattern movement accompani linguist featur primari accent tend mark rapid ordinari movement tend termin point rapid movement occur postur shift occur prior onset speech long al rapid movement occur speech mark repetit syllabl word short speech occurr postur shift begin speak turn grammat impli involv speech regul identifi syntact boundari implement system pelachaud al examin facial inton emot link extens cassel al behavior agent dialogu situat approach pelachaud prevost appli similar techniqu task anim face automat gener section head movement facial express placement respect linguist utter transmit inform ffl syntact function accompani flow speech synchron verbal level facial movement nod head blink cost hundr occur accent syllabl ffl dialog regul flow speech gaze behavior classifi primari categori depend role plan correspond phase turn speaker organ thought comment accompani occur parallel accent emphasi control regul exchang feedback util collect seek feedback listen signal start end accent punctuat signal coincid blink occur punctuat synchron phonem level facial express repres time occurr type gaze gener call parallel transit network becket schedul mechan make execut action rule coordin action encod finit state automata execut parallel dialog function correspond node determin action perform arc node correspond condit action perform gaze enter transit made node condit true figur action perform includ head head shake head nod action modul depend function head nod occur comment feedback differ comput present section section briefli describ system work utter produc gener section cost hundr inform capit letter mark accent word utter sequenc phonem durat read state file exit initi state figur gaze accent shown ih tt kk ao ss tt ss nn ay nn hh ah nn dd rr ih dd dd aa ll er zz correspond high pitch accent rise pitch accent notat chapter correspond low phrasal tone algorithm comput lip shape program output list action unit describ movement muscl muscl phonem segment word dollar lip shape segment effect rule dd au intens backward au intens ih hundr au intens effect aa lip au intens shape au intens aa au intens extens lip au intens small open lip au intens ll au intens forward au intens er au intens propag lip au intens shape aa lip extens er au intens lip shape au intens zz au intens jaw rotat au intens propag lip au intens shape er lip shape program comput facial express link inton ffl signal occur accent word eyebrow movement start initi phonem end final blink ey part signal similar movement word illustr figur ffl punctuat signal repres end blink head movement calcul ffl begin head speaker move listen part speaker gather thought prepar figur facial movement ffl accent word speaker gaze listen punctuat word head nod ffl control speak speaker gaze listen end signal give control listen summari chapter summari relat work mean facial express relat inton theori comput model previou chapter section comput implement link gener chapter task automat produc facial anim facial express import commun channel studi convei attitud type semant nuanc encod inform structur present dissert examin synthesi facial express inton featur commun messag specif context serv platform test relationship interact commun channel chapter dissert present model determin inton contour context provid implement system appli theori problem gener spoken inton semant earlier approach produc inton semant reli previou mention pitch accent assign lexic item base occur demonstr inadequaci previou mention approach handl broad rang exampl involv semant requir pitch accent alloc base abil discrimin entiti model present model base pattern accentu set altern entiti argu suit task handl contrast focu present approach emploi inform structur mediat inton model higher inform structur divid utter link prior speaker contribut materi theme inton delin congruent inton phrase inform structur mark lexic item bear pitch accent basi present abil distinguish altern model couch inform structur inton framework combinatori categori present model treat level linguist detail structur congruent adopt compet model spoken languag product simplifi path concept speech elimin separ prosod syntact process major claim dissert summar ffl model inton assign pitch accent base distinct mention inform account accentu pattern serv distinguish contrast entiti properti ffl type explicitli referenti contrast stress accentu pattern distinguish salient predict model altern set respect context ffl inform structur effect map context inton level semant detail account inton accentu coher ffl inform structur syntax structur congruent ffl instrument encod relationship inform structur syntax ffl problem gener natur languag facilit inform structur associ content plan phase articul sentenc plan phase focal distinct theme ffl inform structur serv mechan incorpor compet model content plan rhetor structur approach hybrid framework organ text chapter introduc disput issu surround mean interpret inton contour dissert combin theoret work syntax process begin chapter bodi appli research artifici intellig speech synthesi chapter present inform structur formal mediat inton encod proper level semant inform account contextu bound accentu pattern inton phrase chapter present algorithm process inform build semant inform structur gener inton utter theme calcul respect collect theme prior reminisc calcul center theori articul produc algorithm consid previou mention heurist altern set properti entiti model chapter inton compet model framework combinatori categori mildli grammat formal congruent prosod inform structur repres simplif compet model handl syntact prosod aspect speech separ construct prosod grammar cover rang inton possibl descript demonstr appropri model spoken languag product claim substanti implement chapter serv platform test refin inton compet model formal evalu appropri speech produc complic number factor explic chapter gener model present chapter introduc number uniqu method organ content plan sentenc inform structur articul theme incorpor hybrid content select organ approach draw schemata rhetor structur theori focu inform structur constitu calcul sentenc plan phase approach repres time notion inform structur emploi ensur coher natur languag gener chapter discuss relat work mode commun connect inton facial produc comput implement gener facial anim speech semant inton gener program implement serv model test relationship facial express speech lack contextu aspect inton speech diminish effect natur languag interfac gener spoken languag concept model make contribut resolut problem addit address varieti comput research direct studi semant inton product prosodi appendix sampl lexicon lexicon excerpt stand open circl semant stand bullet semant proper noun noun determin adject transit verb auxiliari verb preposit appendix sampl gener plan sentenc contrast plan sentenc contrast hundr plan sentenc contrast stereo journal plan sentenc contrast amplifi plan sentenc contrast cost hundr dollar produc hundr plan sentenc contrast bibliographi die studia english translat polish logic oxford page text system cambridg cambridg bodili commun london gaze mutual gaze cambridg press coordin sequenti task philosoph transact royal societi notat syntact descript sequenti tempor pattern speech gaze dialogu nonverb page jack lisp api technic report graphic lab pennsylvania tobi annot convent ohio state inton structur english phonolog observ sententi stress focu phrase unif categori grammar declar perspect page edinburgh coordin movement scientif human percept perform engin data aerospac medic research laboratori contrast accent contrast stress accent predict mind inton stanford press center approach pronoun annual meet associ comput page stanford sentenc stress syntact transform depend dutch linguist bodi movement emphasi speech journal nonverb effect pitch accent pronoun refer resolut annual meet associ comput page anim gener facial gestur spoken inton multipl agent comput graphic page syntact structur hagu sound pattern english harper york emot express lawrenc erlbaum associ segment behavior journal speech bodi motion synchroni percept page academ press synchroni demonstr movement adult speech child syntax speech harvard press contrast inton mode essai present ernst page gunter narr verlag inton cambridg press stress focu english content determin gener refer express comput assign inton featur spoken annual meet associ comput page buffalo topolog focu phenomena referenc phonem unit speech decod journal person social type function conjunct categori grammar natur languag page dordrecht grammar dyadic structur interact speak turn languag signal rule speak turn nonverb commun oxford press argument evid facial express emot handbook social page argument control lexic function unif implement phd columbia float constraint lexic choic comput linguist control content realiz function unif grammar aspect autom natur languag page springer berlin inform packag grammar approach integr inform structur categori approach report amsterdam synthesi facial express phd media ma default accent accent studi page de berlin interact genuin critiqu recent research journal nonverb natur languag gener categori unif grammar cole intern confer comput page helsinki phonolog phd massachusett institut technolog human facial express comput theori interpret unpublish manuscript intent structur comput mode nucleu journal grammar semant sentenc accent head movement correl junctur stress sentenc level languag kinemat head movement accompani speech human movement relationship head movement speech languag meet point linguist artifici intellig artifici intellig page elsevi scienc north holland order principl journal topic focu sentenc pattern text text constitut de berlin inton grammar british english hagu languag structur languag function horizon page penguin verb phrase mean process phd pennsylvania file chang semant familiar theori definit von interpret page de berlin accent assign pitch accent synthet speech eighth nation confer artifici page comput analysi syntax interpret word order phd philadelphia product languag comput model phd sussex model cognit wilei product spoken dialogu advanc natur languag interdisciplinari vol london plan coher text annual meet associ comput page buffalo natur languag gener technic report rome laboratori air forc materiel command autom gener structur relat artifici semant interpret gener grammar mit ma semant modal particl particl descript theoret investig pragmat properti particl german john amsterdam requir provid reason structur grammar natur languag comput theoret page cambridg york control role aspect structur center intern joint confer artifici page vancouv facial anim system model comput graphic function social interact acta relationship bodi motion speech studi dyadic page pergamon movement coordin social exampl nonverb commun oxford press composit semant multipl focu page verlag theme speaker reexamin relativ phenomena subject page academ york structur inton mean indiana bloomington focu normal stress journal presupposit rel interdisciplinari reader linguist page cambridg press global structur nuclear stress rule inton system english phd massachusett institut technolog structur usag current bell lab text speech program technic tm bell laboratori inton invari pitch rang length languag sound studi phonolog present morri hall mit ma volum ii cambridg press rhetor structur descript construct text structur natur languag result artifici psycholog page kluwer academ boston descript direct implic natur languag gener read natur languag page morgan kaufmann practic issu automat document gener fourth acl confer appli natur languag page stuttgart associ comput linguist text strategi focu constraint gener natur languag text cambridg cambridg strategi gener natur languag text read natur languag page morgan kaufmann bridg gener gap text plan linguist realiz comput inton system phd edinburgh categori investig digit alfr york prosod phonolog dordrecht stress system english evid phonem encod unit languag composit function basi grammat analysi categori grammar natur languag page dordrecht fundament frequenc rule system confer speech signal page york ieee cat assp explicit model text tailor user level phd columbia gener facial express speech cognit scienc sight gener facial express spoken inton context workshop speech page ny coordin vocal visual paramet virtual agent eurograph workshop virtual mont carlo talk linguist cognit issu facial anim note comput graphic intern phonolog phonet english inton phd massachusett institut technolog distribut indiana linguist mean inton contour interpret intent page mit ma evalu prosod transcript label reliabl tobi framework intern confer spoken languag process yokohama formal model structur journal page limit phrase structur grammar structur page prentic englewood nj limit interpret theori anaphora linguist contextu aspect prosodi gener ijcai workshop context natur languag process gener contextu inton confer european chapter associ comput page utrecht context inton speech synthesi proc european conf speech commun technolog page berlin inform base inton synthesi human languag technolog page inton context speech synthesi speech taxonomi distinct radic page academ london syntact mark open proposit journal chicago linguist page appli text gener confer appli natur languag process page pragmat analysi sentenc topic model lexic choic noun comput consensu nl gener architectur psycholinguist seventh intern workshop natur languag page fast algorithm gener refer express cole intern confer comput page classif gener text annual meet associ comput page gener architectur report fact histor context concept natur languag realiz page york gener natur languag summari provid histor implement evalu phd columbia corpu analysi gener complex sentenc eleventh nation confer artifici page focu gener grammar john philadelphia associ focu phd amherst theori focu interpret natur languag predict global shape intern confer speech signal page function nonverb sign st social physiolog context page lawrenc erlbaum associ aspect english sentenc stress texa austin phonolog syntax mit ma evid natur languag linguist gener synchron grammar comput local increment gener text phd massachusett gener text tree comput special issu natur languag standard label english prosodi intern confer spoken languag process volum page banff colloc languag gener comput commun cognit harvard ma depend coordin grammar dutch english gap constitu coordin linguist structur inton spoken languag understand annual meet associ comput page pittsburgh structur inton page surfac focu natur languag esprit page brussel surfac inton mean spoken languag challeng natur languag process cambridg press categori grammar annual meet associ comput page berkelei inton perceptu quest journal integr level phonet analysi journal distribut accent instruct function structur languag word repres effect persist grammat function surfac posit languag visual routin visual page elsevi scienc amsterdam inform compon phd philadelphia free word order syntax function helsinki center cole intern confer comput page helsinki process center comput express function ey flash journal nonverb predict inton phrase text annual meet associ comput page berkelei implic pragmat inton page flexibl support manag reason plan artifici intellig power ey springer publish compani mildli grammar formal phd pennsylvania journal page comput human face comput vision pattern recognit page ieee comput societi speech synthesi method speech output inform system journal acoust societi basic research inton dialogu gener technic edinburgh unpublish manuscript
HCI/1589 4 acm confer human factor comput system acm york pp interact landscap creativ innov norbert torsten christian wolfgang peter ralf steinmetz gmd german nation research center inform technolog ipsi integr public inform system germani abstract describ environ constitut vision workspac case support cooper work dynam team chang requir form interact form cooper work design base integr inform architectur implic work practic empir requir studi inform design consist object integr room element inform technolog present current realiz term interact electron interact complement descript creativ support applic technolog infrastructur paper accompani video figur video program keyword integr interact architectur virtual inform augment ubiquit cooper creativ dynam team workspac futur introduct present approach design implement innov workspac base integr design virtual inform space equal weight real architectur space gener approach workspac futur applic wide rang applic focu paper specif support creativ team result approach present term interact landscap creativ innov approach issu involv perspect discuss relationship afford provid physic object architectur space digit inform object virtual inform space discuss implic work practic result organiz innov requir design collabor workspac perspect repres gener conceptu framework order make idea illustr scenario guid function design perspect provid technolog develop augment realiti ubiquit comput fourth perspect provid result empir requir studi inform design current work practic exist team expect futur work environ perspect set stage central part introduct concept descript prototyp implement term environ paper end discuss approach respect relat work direct futur work conceptu framework vision workspac futur individu group environ interfac inform form case integr design inform architectur space advent inform technolog result shift situat inform store commun mean comput result virtual world place inform interfac inform realiz perspect reduc displai desktop comput virtual realiti live work environ highli determin architectur space build constitut rich inform space due inher afford concret direct inform sourc provid ambient inform exampl distribut avail physic object photo copi window calendar hang wall physic layout workplac offic meet room architectur environ posit shelv offic result exist work practic characterist constrain current group activ term structur form subgroup team work meet room depend flexibl furnitur access multipl inform devic architectur space serv inform cooper space spread desktop comput situat chang dramat monitor desktop comput entranc inform tendenc inform comput desktop comput turn bottleneck limit parallel access sourc type inform limit screen space result complex handl window convinc ag inform technolog physic object placement architectur space provid valuabl organ content inform meta inform work process individu group afford complement augment physic environ rich inform digit inform space requir present inform physic object correspond underli digit inform wai approach design goal relat approach work practic work cooper organ mobil todai develop exampl demand ad hoc format virtual physic distribut mobil desk share initi exampl work practic organiz innov expect content particip process structur collabor chang wai rate innov cycl role physic offic space chang time reflect develop design equal mobil work environ demand ad hoc format team requir power method tool support work phase team empir studi evalu develop meet support system found provis hypermedia function facilit labor team work result result group problem solv activ empir studi investig combin person public inform devic network comput mount interact electron role collabor meet result show group develop balanc proport individu subgroup work full group achiev result group stai time work configur flexibl work mode larg determin rang combin inform devic provid team result obtain electron meet constel provid flexibl assign workspac area meet room subgroup individu standard electron meet room emploi larg static tabl comput top mount tabl past combin furnitur comput devic flexibl high prioriti design goal provid environ high spatial flexibl mobil emploi inform devic sampl scenario order concret exampl transform gener approach work develop sampl scenario guid idea work cooper futur present scenario meet colleagu chanc hallwai start discuss result intent explain draw sketch wall annot scribbl fact accept offic tradit wall support store modifi element discuss search relat inform background inform base link inform sketch scribbl wall turn wall wall high resolut electron provid function wall great inform commun scenario group team divid work assign subtask break individu subgroup work full team meet discuss result form basi phase cooper reduc cycl time full team subgroup meet altern provid wai subgroup split meet work rejoin immedi merg result provid adequ support scenario requir team project room equip compon resourc flexibl reconfigur dynam order meet requir chang team work situat analysi situat subgroup constel full team sit chair face public displai subgroup work peopl move chair group corner discuss task exchang idea subgroup walk ad hoc meet stand view edit tabl diagram subgroup walk larg draw sketch annot scribbl vision whiteboard interact electron devic provid adequ support interact cooper situat suggest place individu search background call paper suggest mobil scan paper document content immedi network fig present visual idea start project spring show parallel work subgroup individu fig visual vision environ technolog framework convinc desktop order realiz vision present obviou goal requir technolog setup offic area recent develop augment realiti ubiquit comput augment realiti area reflect view real world interfac inform sit front monitor desktop comput cyberspac wear order virtual augment realiti concern comput devic order augment percept interact physic world overview initi work earli exampl digitaldesk relat approach notion user interfac ubiquit comput pursu approach augment realiti larger scale requir spread network inform devic displai provid function concept ubiquit comput relat ubiquit media size devic rang small larg devic stand recogn environ physic space fill multipl set issu transfer inform intuit direct interact desir posit devic state room build issu techniqu concept issu requir set infrastructur local technolog awar collect inform devic user problem respect privaci issu combin idea augment realiti ubiquit comput emploi approach call reactiv environ requir analysi innov vision scenario advanc basic technolog import make principl design suffici develop system inform design requir anticip user group conduct empir studi order investig current work situat team requir futur environ method empir studi select compani automobil oil industri consult busi compani select special work group call label work area strateg identifi futur design market expect team good candid work innov tool creativ idea requir futur work environ team work interview repres visit project team room hold distribut questionnair team member total number peopl team ag rang year academ educ educ comput busi design distribut questionnair return interview site visit provid valuabl inform result empir studi due limit report select result relev design detail facil tradit meet room furnish standard equip larg solid tabl flip overhead projector coupl scanner printer perman instal meet room peopl bring laptop order project comput displai wall configur prepar present activ creation content meet aid comput creativ techniqu fashion result current state room contrari expect expect usag technolog meet situat chang requir futur larg room requir flexibl setup mobil compon configur room charact market place landscap provid opportun spontan encount inform commun quot meet anymor conduct meet room provid environ situat encount furnitur flexibl current situat great open support support inform gather prepar meet access intern extern data special mention advanc version call support wide rang creativ techniqu flexibl configur tailor underli support present style deviat tradit situat involv activ fashion label support visual inspir enhanc creativ support commun experienc content channel tactil emphasi videoconferenc team stress import person presenc essenti creat stimul product mention busi creativ time plan organ work motiv request support document meet prepar minut support strongli comput background quot creativ issu creation label room team freedom physic environ inform environ approach meet requir flexibl configur dynam alloc resourc integr physic inform environ base concept call object result integr room furnitur inform devic gener goal develop make progress design integr real architectur space virtual inform space perspect augment realiti context support team compon tailor form flexibl dynam serv multipl project team present inform goal common requir develop form interact present exampl current focu design workspac colloc team environ easili extend provid support global cooper distribut team design implement initi set compon consist interact electron wall interact electron tabl mobil network chair integr interact devic assembl order form version environ object provid devic serv project room larg area assembl sheet paper cover wall creat organ inform consid electron repres inform devic current realiz total displai size width height cover side room complet softwar develop enabl team displai interact larg inform structur collabor fig peopl cooper person work individu parallel share displai space size challeng interact cumbersom drag object window hold distanc develop mechan address problem featur inform object walk contact put displai throw object side opposit side caught team member initi design idea present result implement work fig usag mobil chair comput repres type furnitur combin mobil comfort inform technolog fig version dock facil peopl bring laptop comput drop desk part version integr comput built desk fig fig remot annot peopl commun share inform peopl stand front interact make person note privat space interact remot share make remot annot fig cooper function provid beach softwar maximum flexibl mobil chair provid wireless network independ power suppli initi design idea present result implement interact interact mobil interact tabl design discuss annot inform object group peopl stand current version interact built vertic project unit lcd project imag top tabl provid horizont displai cm cm fig discuss subgroup interact peopl write draw pen interact finger pen gestur inform object wireless keyboard extens text input horizont displai peopl stand interact area predefin orient top left desktop comput horizont round displai requir form interact develop gestur rotat shuffl individu group inform object surfac accommod easi view perspect fig rotat window interact passag concept passag describ eleg mechan connect inform structur virtual world comput object detect physic bookmark virtual world assign inform carri physic simpli put devic call inform displai immedi locat longer open hierarchi worri mount passag concept bind content object intuit inform offic meet room passeng special physic object uniqu detect physic object passeng inform structur store passeng link peopl turn object arbitrari object restrict passeng identifi bridg uniqu fig fig show small wooden block passeng margin interact bridg devic current passag implement weight physic object identif scale built bridg detect support creativ work current applic support team work focu creativ innov softwar develop support type creativ techniqu relat gener function visual knowledg structur beach softwar form focu support brainstorm techniqu project organ shown brainstorm result number idea verbal brainstorm limit exist brainstorm system overcom softwar enabl team work network hypermedia structur provid adequ idea base earlier hypermedia work combin concept possibl displai larg inform structur opportun innov idea creation concept present mode develop includ visual metaphor present content structur technolog infrastructur compon present full benefit integr combin integr requir network infrastructur provid connect compon softwar infrastructur provid wide rang cooper share capabl extend mobil team member compon lab build identifi locat requir local infrastructur plan futur network infrastructur current combin local area network instal build wireless network maximum flexibl mobil compon connect wireless network equip antenna laptop wireless adapt carri return busi plug dock station team member join meet reconfigur comput fix compon connect cabl lan network connect wireless access lan realiz act bridg ethernet transfer rate rf channel upgrad mbp softwar infrastructur order meet function integr requir develop beach softwar infrastructur cooper share inform devic combin form interact requir enabl compon beach design layer architectur lowest level coast framework develop function replic synchron inform object framework creat share inform space compon coupl physic separ compon logic homogen workspac import larg interact area build separ segment limit displai level beach cover interact user devic softwar care input output characterist displai size vari small huge displai orient fix respect displai desktop arbitrari chang time interact input devic resp touch gener gestur recognit crucial realiz interact form top beach mechan structur collabor basic metaphor defin work topic data virtual locat virtual counterpart physic meet meet room attach virtual locat meet virtual locat time task project strong correspond physic place virtual locat team decid meet split subgroup area meet room build continu collabor softwar recogn decoupl previou homogen automat creat share workspac subgroup achiev creat subgroup team virtual physic beach develop smalltalk parc place visual work environ discuss futur work present design implement innov collabor workspac base integr design real architectur virtual inform space approach relat inspir develop augment ubiquit comput cooper meet support system develop idea interact appli design collabor work environ extend interact techniqu cooper function creat ubiquit collabor workspac space discuss relationship work exampl compar work augment digitaldesk interact interact displai project avoid problem shadow overlai video project real surfac digitaldesk passag mechan inspir idea answer extend physic object repres voic digit inform mean physic transport compon ubiquit approach concentr devic chair architectur element door wall techniqu relat mechan requir special pen base gestur compar work meet support system includ previou work approach due flexibl mobil compon flexibl dynam creation alloc workspac part room build correspond mode group activ fix set chair static tabl comput enabl method establish cooper share inform subgroup form simpli move chair close spatial proxim reactiv environ due focu special issu video conferenc room environ introduc form humancomput interact evalu usabl spirit previou evalu studi systemat fashion control empir experi plan track posit compon peopl room posit orient compon interact devic softwar mention process inform automat initi coupl session share displai move form subgroup distanc defin threshold environ implement approach part gener framework call introduc discuss panel repres global vision design acknowledg michel jochen daniel valuabl contribut part project ambient dan russel fruit discuss earli phase work anonym review comment submit version refer live augment ubiquit media reactiv environ commun reactiv throw keyboard commun situat inform space spatial awar palmtop comput commun lai foundat graspabl user interfac lm wh unblock brainstorm journal appli throw work effici interact wall chi tangibl seamless interfac bit atom hypermedia group chang strategi comput support cooper journal collabor commun exampl mobil compon jf ro dd electron meet ten year lesson learn technolog applic close comparison group design process simpl group editor streitz special issu cscw acm toi hand rock cradl id intern design magazin direct manipul techniqu multipl comput environ user cooper environ consist multipl digit devic pp world comput augment interact real world environ proc acm jm design synchron groupwar coast cscw confer acm press comput support collabor problem solv meet comm integr meet support local desktop environ cscw acm press cooper integr design architectur space inform space pp cooper build proc cscw cooper build integr organ architectur intern workshop cooper build februari lectur note comput scienc heidelberg investig role person public inform devic combin meet room collabor kluwer academ publish für und proc comput centuri scientif comput scienc issu ubiquit comput comm interact paper digitaldesk comm back real world commun
ML/1590 6 train reinforc neurocontrol polytop algorithm isaac depart comput scienc po box gr greec depart comput scienc po box gr greec abstract train algorithm present delai reinforc learn problem assum exist critic model emploi polytop optim algorithm adjust weight action network simpl direct measur train perform maxim result applic method pole balanc problem improv train perform compar genet reinforc approach reinforc polytop pole genet reinforc train reinforc neurocontrol polytop algorithm abstract train algorithm present delai reinforc learn problem assum exist critic model emploi polytop optim algorithm adjust weight action network simpl direct measur train perform maxim result applic method pole balanc problem improv train perform compar genet reinforc approach reinforc polytop pole genet reinforc introduct framework delai reinforc system receiv input decid proper sequenc execut receiv reinforc grade made system instant state variabl object broad class reinforc learn control system state variabl remain time prescrib rang system violat penal receiv polici make influenc exampl kind pole balanc teach autonom robot avoid ball beam problem gener distinguish kind approach develop delai reinforc problem approach direct approach approach exhibit similar approach adapt heurist critic method assum separ action model receiv current system state select action evalu model output predict evalu current state evalu model feedforward neural network train method tempor minim error ffi receiv reinforc fl discount factor action model feedforward network output vector probabl action select base network train backpropag error ffi direct approach delai reinforc learn problem consid reinforc learn gener optim problem object function straightforward formul difficult optim case action model provid action polici optim techniqu emploi adjust paramet action model stochast function maxim function proport number success action lead receipt penalti previou direct approach delai reinforc problem emploi genet algorithm perform optim task present studi optim strategi base polytop method random restart detail approach present section result applic method pole balanc problem compar perform method evolutionari approach train algorithm method belong categori direct approach delai reinforc problem action model consid case architectur perceptron input unit accept system state time sigmoid output unit provid output valu rang action valu made stochast determinist case output unit repres probabl final output final output obtain determinist final output learn proce cycl start system random initi posit end failur signal object train network system ideal receiv failur number time step cycl constitut perform measur optim train problem consid function optim problem adjust paramet weight action network function length cycl obtain current weight valu length cycl exce preset maximum number control adequ train criterion termin train process train termin number unsuccess cycl function evalu reach maximum exce preset upper bound function optim defin deriv tradit optim techniqu emploi function amount random initi state specif action select earli step perform random hand incorpor random disrupt optim process evalu network radic learn process misl global search benefit control clear direct approach advantag summar list ffl updat strategi action perform updat end cycl polici action network affect cycl network perform continu adjust weight action network lead due corrupt correct polici system acquir ffl optim techniqu emploi naiv stochast gradient descent ffl stochast action select earli step fact stochast action select lead choic suggest current polici ffl critic absenc critic small number weight updat contribut train speed main disadvantag direct approach perform reli effect optim strategi due characterist function optim kind optim approach suitabl train previou reinforc learn approach direct emploi optim techniqu base genet algorithm good result term train speed number present optim strategi base polytop algorithm polytop algorithm polytop algorithm belong class direct search method optim simplex method linear program origin algorithm design al refin mead polytop construct vertic defin volum element instanc dimens simplex dimens case vertex point describ paramet action network input algorithm paramet minor initi point algorithm bring simplex area adapt local final shrink minim iter method proce minimum manipul popul point simplex expect toler determinist natur step iter denot object function simplex examin termin criteria decid stop number simplex vertic sequenc sort ascend order calcul centroid invert vertex ff set step endif expand fl set set endif step endif contract fi contract endif set shrink polytop set endif step endif essenc polytop algorithm consid step popul action network weight vector properli adjust order obtain action network high evalu polytop develop exhibit analog genet algorithm base recombin popul point initi simplex construct wai approach pick vertex random rest vertic obtain line search origin direct initi scheme prove effect pole balanc scheme random initi vertic constrain random vertic predefin work termin criterion reli compar measur polytop user preset small posit number specif algorithm return jf ffl polytop algorithm advantag robust presenc simpl implement oper characterist make algorithm suitabl candid optim tool direct reinforc learn scheme method effect depend partli initi weight valu train strategi emploi polytop algorithm random restart clear applic present section stress techniqu make assumpt architectur action case kind action model action model emploi architectur applic pole balanc problem pole balanc problem constitut reinforc learn consist singl pole hing cart move left horizont track finit length pole freedom hing control object push cart left forc pole remain balanc cart track limit state variabl describ statu system time horizont posit cart cart veloc angl pole angular veloc step action network decid direct magnitud forc exert cart detail equat motion system found euler approxim method simul system equat time step sec assum system equat motion perceiv state vector time step assum failur occur jxj train successfulli complet pole remain balanc time step version problem exist magnitud appli forc concern case magnitud fix control decid direct forc time step control problem difficult case magnitud comparison present fix magnitud approach architectur effici assum number cycl method worst sd polytop tabl train perform term requir number train cycl continu valu forc magnitud polytop method merlin packag optim provid merlin test roll result satisfactori polytop algorithm effect balanc pole rel number cycl case mention previou polytop method effect depend partli initi weight valu reason emploi optim strategi base polytop algorithm random restart run start randomli initi point weight space construct initi polytop perform line minim direct polytop algorithm run function evalu optim progress monitor cycl found applic polytop algorithm continu addit initi polytop proper random restart place random restart perform addit function evalu algorithm cycl encount step maximum suggest experi present articl maximum restart strategi consid termin restart perform total number function evalu greater strategi implement program languag part merlin optim environ initi weight valu restart randomli select rang experi conduct consid rang obtain result show method exhibit robust initi weight concern comparison action network architectur architectur report perceptron input unit hidden layer sigmoid unit sigmoid unit output layer direct connect input unit output unit specif appli forc characterist output perform ten step cycl specif probabl equal remain step specif random introduc function evalu process assist escap plateau shallow local minima experi conduct assess perform train method term train speed gener capabl comparison implement approach result genet reinforc approach problem motion equat network architectur report train speed measur term number cycl requir achiev success cycl seri experi conduct cycl start random initi state variabl obtain result summar tabl result genet reinforc case popul network exhibit gener perform accord previou publish method manag find solut experi displai result concern valu obtain success experi train strategi success experi exhibit significantli perform respect case term requir train cycl displai result clear polytop method outperform genet method test gener perform obtain action network experi success cycl start arbitrari initi impli system exhibit accept perform start initi state vector gener experi conduct guidelin suggest action network obtain experi polytop method seri test perform random initi state count percentag success test method worst sd polytop tabl gener perform term percentag success test test network balanc pole time step failur criteria train test tabl displai averag result obtain test action network obtain polytop method case success train gener result provid test criteria result action network obtain method exhibit compar gener perform note gener perform stricter stop criteria train algorithm note concern polytop connect train time gener network result longer train time exhibit gener capabl result clear direct approach delai reinforc learn problem constitut altern approach approach base eleg formul base tempor differ stochast dynam direct approach base success power optim scheme emploi optim scheme base polytop algorithm random restart present work prove success deal pole balanc problem futur work employ kind action model rbf explor optim scheme acknowledg partial support gener research technolog contract ed refer cw strategi learn connectionist technic report gte ma cw learn control invert pendulum neural ieee control system vol pp ag rs sutton cw element solv difficult control ieee tran man vol pp hr learn tune fuzzi logic control ieee tran neural vol pp cs dg optim orient program comput physic vol pp ga jp merlin portabl system comput physic commun vol pp dg cs enhanc programm comput physic vol pp practic academ littman reinforc journal artifici intellig vol pp effici reinforc learn strategi pole balanc proc pp lin reinforc learn fuzzi adapt learn control ieee tran neural vol pp ja simplex method function comput vol pp nash nonlinear sequenti applic simplex design optim evolutionari vol pp watkin learn delai machin vol pp da cw genet reinforc learn neurocontrol machin vol pp
ML/1591 6 gener method make classifi pedro domingo artifici intellig group instituto superior lisbon portug abstract research machin statist relat field produc wide varieti algorithm classif algorithm assum error seldom case kdd lem individu make classif learner paper principl method make arbitrari classifi wrap procedur call treat underli classifi black requir knowledg function chang unlik applic number class arbitrari cost matric empir trial larg suit benchmark show produc larg cost reduct compar classifi form stratif test identifi kei compon vari substanti loss experi larger scale introduct classif primari task data mine subject research machin pattern network area decad approach includ rule induct tree induct learn linear neural classifi bayesian learn classif goal correctli assign exampl vector finit number class algorithm classif design minim loss error number incorrect predict made probabl make incorrect predict implicitli assum error kdd applic case market cost mail cost mail respond entir profit lost misclassif cost arbitrari cost matrix cost predict belong class fact belong class realiz applic cost rule except led recent year interest algorithm classif discuss section relat turnei onlin bibliographi work make individu algorithm ll literatur obviou perform potenti solut procedur convert broad varieti classifi procedur type frequenc class train data proport cost approach shortcom distort distribut affect perform algorithm reduc data stratif carri learn applic problem multiclass problem type cost cost misclassifi independ predict paper procedur sensit classif attenu elimin disadvantag stratif base wrap stage classifi classifi effect minim cost seek minim loss section describ detail reason lead section describ extens empir evalu compar stratif investig paper conclud discuss relat direct futur summari result algorithm order obtain procedur make classifi start basic notion probabl class optim predict class minim condit risk condit risk expect cost predict belong class optim predict achiev lowest cost lowest expect cost oil exampl weight probabl rule impli partit space class optim predict region classif find frontier explicitli implicitli complic depend cost matrix misclassifi exampl class rel misclassifi region predict expand region class probabl remain unchang optim predict exampl train depend cost coincid class exampl label exampl train set relabel class cost matrix classifi appli learn optim exampl label frontier consist learner learn frontier finit learner principl find frontier find loss frontier train set procedur base idea order train exampl find estim class probabl note find class probabl unseen estim import influenc final frontier probabl estim poor lead optim long class minim risk estim probabl minim true possibl standard probabl estim kernel densiti estim success learn classifi approach requir machin learn bia implicit classifi probabl estim valid applic domain strictli imposs classifi densiti estim mismatch probabl estim classif stage found hurt perform context similar present relat work section tree rule induc effect learner domain found domain probabl estim techniqu kernel densiti mixtur model effect assumpt user chosen classifi characterist suit classifi classifi yield class probabl estim poor tree rule learner work attempt drive class probabl result estim correspondingli classifi produc class requir robust method obtain class probabl estim classifi suggest recent research model ensembl author breiman found modern learner highli appli slightli train set produc model correspondingli predict accuraci remain broadli unchang accuraci improv learn model combin vote estim class probabl learn multipl classifi classs fraction total vote estim probabl learner unstabl fashion method appli learner discuss section futur variant breiman bag ensembl method bag train set size resampl construct sampl replac train set train set size origin exampl procedur repeat result model aggreg uniform vote unclassifi ensembl label class predict greatest number differ bag number exampl resampl smaller train set size effici classifi produc class classs vote estim unweight averag probabl model estim class probabl train model gener learn resampl includ type estim lower base larger number lower statist influenc exampl class train set work form multipl bootstrap replic train learn classifi estim classs probabl fraction vote receiv equat train estim optim reappli classifi relabel train set procedur shown tabl note cost matrix final learn stage singl run classifi empir evalu question reduc cost compar classifi stratif studi empir benchmark es uci repositori tree learner classifi de facto role standard empir comparison convert tree set improv accuraci produc result tion refer abbrevi experi carri randomli select exampl tabl algorithm train classif learn cost number resampl number exampl true iff produc class true iff resampl procedur resampl exampl mi model produc appli si class produc mi class predict rang rang xs class model produc appli return train remain measur cost predict result report averag run report result experi multiclass experi lesion studi studi larger complet section multiclass problem experi conduct type cost model chosen random uniform distribut chosen random fix interv cost gener run conduct standard deviat report incorpor effect vari cost matrix chosen tabl averag cost standard deviat multiclass problem cost fix interv cost interv anneal audiolog glass iri led lung cancer pr tumor solar soybean splice wine chosen uniform probabl interv probabl occurr class train set expect mean highest cost misclassifi rare class frequent lowest mimic situat found practic market domain mention class import identifi correctli low error rate achiev simpli ignor minor cost high learn import problem cost matrix gener run stratif directli appli arbitrari multiclass cost breiman al suggest make cost misclassifi class irrespect class predict train set resampl make classs probabl equal pp detail justif exampl class highest fraction exampl class chosen random resampl train set frequent type disadvantag reduc data cost exampl class lowest exampl class duplic approxim time train set avoid loss train significantli learn superlinear algorithm appli model rule class gener size equal origin train set tabl result obtain shown tabl graphic figur obtain variant report section lesion form stratif effect reduc approxim made order appli true reduc cost compar compar close match assumpt appli reduc cost compar achiev lower cost form stratif averag cost reduct obtain compar approxim larg obtain time set cost obtain lower algorithm confid sign wilcoxon test result support multiclass multiclass multiclass figur comparison cost point correspond type cost matrix point line outperform altern classifi reduct method choic multiclass problem problem problem stratif appli approxim make minor class major experi conduct cost set altern note absolut valu irrelev algorithm comparison ratio result set shown tabl graphic figur effect reduc cost cost ratio effect reduc cost compar cost ratio cost obtain lower algorithm confid sign wilcoxon test sign test confid result support method choic problem stratif appli approxim lesion studi question connect result sensit number resampl simpli class probabl produc singl run classifi full train perform model relabel irrespect learn class probabl produc probabl class estim simpli fraction model predict section answer question carri relev experi sake result result multiclass broadli similar tabl report result obtain variat resampl relabel train exampl class probabl produc singl run data ignor class probabl produc model relabel tabl averag cost standard deviat problem cost ratio breast cancer credit diabet heart hepat labor liver promot sonar vote breast cancer credit diabet heart hepat labor liver promot sonar vote breast cancer credit diabet heart hepat labor liver promot sonar vote set previou section main observ made compar tabl tabl cost number resampl gradual differ cost obtain cost reduc cost compar form stratif cost ratio data produc result dataset cost ratio perform similarli outperform ignor class probabl cost major rel differ gener minor form outperform type stratif larg major cost ratio multipl run estim class probabl essenti singl run model cost tabl averag cost standard deviat version cost ratio prob vote ms breast cancer credit diabet heart hepat labor liver promot sonar vote breast cancer credit diabet heart hepat labor liver promot sonar vote breast cancer credit diabet heart hepat labor liver promot sonar vote case rel differ gener perform stratif gener similar crucial element multipl run estim class number run low suffici excel perform class probabl benefici estim exampl class probabl exclud model learn scale obviou potenti disadvantag learn time compar classifi previou learn time order fraction arguabl immateri larger limit time fix factor number asymptot time complex order constant critic applic solut li fact multipl run classifi requir form probabl estim complet independ trivial reduc time factor tabl cost cpu time minut variant shuttl algorithm cost time cost time potenti solut requir parallel process resampl smaller origin train set addit small number smaller resampl result higher conceiv lower obtain learner worthwhil cost learn class probabl smaller sampl offset reduct obtain multipl model idea breiman success method scale learner reduc resampl size reduc run factor learner superlinear run time classifi run time quadrat number tenth exampl reduc run time resampl factor resampl make cpu time probabl estim phase order magnitud smaller singl run classifi test approach experi carri largest uci shuttl goal state space shuttl radiat set sensor read problem suit test larg major class easi obtain low error rate cost miss rare state potenti higher make error rate inappropri measur perform numer read exampl shuttl flight flight test run carri mhz pentium comput cost set obtain result run expand train set memori result previou high probabl tabl show cost run time combin function train set size true tabl reduc cost resampl tenth size origin train set reduc cost order run time similar number resampl resampl size predict run reduc cost reduc resampl size train set size cost poor result obtain suggest excel perform due problem requir small number exampl achiev low cost check repeat experi class ad train test set probabl exampl class chang class probabl result shown tabl cost run time higher effect reduc perform produc improv order magnitud faster reduc cost order magnitud due fact estim class probabl averag model learn small subsampl effect filter produc cleaner run faster origin examin algorithm output show induc singl short rule state make normal state output order magnitud larger ineffici larg noisi result gener learner strong indic appli effect larg reduc cost significantli run time suggest noisi method speed learn relat work learn subject space review point reader onlin bibliographi section discuss element previou research close relat chan stolfo variat stratif involv learn multipl classifi stratifi subsampl combin classifi output input method produc singl output hard produc singl model similar complex classifi compar stratif chan stolfo method avoid loss train applic present problem ad hoc lack clear foundat resampl scheme unlik requir repeat run time cost matrix test singl domain fraud ting zheng variant boost ensembl tree easili adapt creat learner multipl run chan stolfo produc singl model compar regular ad lack perform train data requir repeat run time cost matrix base publish produc substanti smaller cost reduct architectur respect similar combin multipl model singl goal reduc goal retain accuraci gain multipl model model ensembl relabel train label addit exampl combin conceiv bring advantag futur work item futur work carri experi addit larg learner interest appli algorithm unstabl respect variat train neighbor naiv present effect altern readili suggest result method consist learn multipl model subset subset exampl neighbor naiv unstabl respect attribut method found reduc algorithm error extent similar bag learner readili incorpor applic larg improv stratifi subsampl partit bag similar phase chan stolfo avoid lose inform resampl correct probabl estim obtain effect stratif interest comparison perform probabl estim kernel phase multipl run classifi gener previou result success domain combin probabl estim classifi effect perform qualiti probabl estim investig synthet true class probabl interest roc analysi vari probabl threshold exampl relabel class current version base bag altern method construct model ble boost boost achiev lower rate produc reduct cost kdd applic hinder lack power learner convert individu learner tediou difficult altern stratif limit number disadvantag paper evalu procedur make classifi base relabel train exampl estim appli learner train set experi show systemat reduc cost compar classif larg effici appli larg acknowledg research partli fund praxi xxi program author grate provid dataset empir studi refer albert base algorithm machin bai combin nearest neighbor classifi multipl featur subset proc intl conf machin pp bishop neural network pattern recognit oxford uci repositori machin learn dept inform comput ht ml breiman bag predictor machin breiman past bite predict larg data set technic statist california breiman estim technic statist california stone classif regress tree chan stolfo scalabl learn class cost distribut proc jth intl conf knowledg discoveri data pp editor proc integr multipl learn model improv scale machin learn algorithm aaai editor nearest neighbor nn pattern classif techniqu ieee comput societi lo domingo rule induct proc intl conf knowledg discoveri data pp domingo knowledg acquisit ple multipl model proc intl conf machin pp domingo bag bayesian account implic proc intl conf knowledg discoveri data pp newport domingo simpl cost model machin learn applic proc methodolog appli machin pp domingo pazzani optim simpl bayesian classifi loss machin duda hart pattern classif scene analysi smyth data mine knowledg overview advanc knowledg discoveri data pp aaai menlo freund schapir experi boost algorithm proc intl conf machin pp michalski theori methodolog induct learn artifici provost fawcett analysi classifi perform proc intl conf knowledg discoveri data pp newport kohavi case accuraci estim compar induct algorithm proc intl conf machin pp quinlan program machin learn morgan san ting zheng boost tree sensit classif proc european conf machin pp turnei learn phy onlin institut inform technolog nation research zheng naiv classifi proc european conf machin pp
IR/1592 5 accept ieee copyright ieee digit librari autonom citat index steve lee kurt bollack nec research independ nj abstract world wide web research access scientif inform articl increasingli made homepag author journal web onlin archiv scientif inform web larg articl introduc creation digit librari incorpor autonom citat index aci autonom creat citat indic similar scienc citat index aci system autonom locat extract identifi ident citat occur identifi context citat bodi articl aci organ literatur provid advantag tradit citat literatur search citat evalu articl base citat statist aci provid advantag tradit citat indic manual effort requir result reduct cost avail citat indic aci system provid indic literatur index articl technic confer aci make easi context citat research quickli easili subsequ research articl digit librari incorpor aci significantli improv scientif dissemin feedback short autonom citat index autom construct citat indic similar scienc citat index aci aim improv dissemin retriev scientif improv citat digit inform scientif literatur search introduct rapid volum scientif literatur led research constantli fight inform overload pursuit knowledg stai date literatur increasingli imposs fundament problem research face obtain relev articl experi vari time essenti journal held major academ librari pass common reason cite price inflat journal librari person budget web make scientif articl easili person materi permit permiss materi promot creat collect work resal redistribut server copyright compon work work obtain ieee scientist print journal provid access articl number electron journal continu journal number archiv physic archiv gov make research articl access scientif literatur web remain remark scientist post relev preprint web find articl time fashion difficult web search engin difficulti date index content postscript pdf research time find evalu articl web interest autonom citat index address problem citat index citat index index citat articl link articl cite work citat indic origin design inform retriev navig literatur uniqu wai paper locat independ word languag citat index navig backward time list cite forward time subsequ articl cite current citat index valuabl tool literatur research find subsequ paper cite paper citat index improv scientif commun limit wast duplic prior reveal relationship draw attent import correct retract publish identifi improv critic earlier work citat indic find articl cite provid indic import analyz research identifi emerg area scienc digit librari citat index institut scientif inform produc multidisciplinari citat indic includ scienc citat index index scientif journal isi construct manual assist human index isi web scienc web version isi citat indic isi number limit limit low coverag show context citat limit tradit citat index system expand section citat link bibliographi articl abstract cite start limit domain web press lead web scientif includ citat link journal publish open journal project investig provis link intend provid citat link journal site publish scientif paper web provid form citat link cameron bibliograph citat link scholarli work written system publish research searchabl scholar internet access includ citat link date cameron system avoid requir manual assist citat index transfer manual effort author institut author institut requir provid citat inform specif format requir work author institut major factor prevent realiz cameron autonom citat index detail overcom problem complet autom citat index process requir extra effort author institut aci previou extract make context citat quickli easili improv literatur search evalu limit current tool project elsevi test system network deliveri involv extens user evalu date final report summar user access inform effect search fast download high imag text suffici journal time link document current access scientif inform web meet sourc scientif inform queri interfac vari servic coverag current servic meet requir citat index perform web scienc limit coverag requir manual assist index citat index valuabl tool greatli enhanc digit librari scientif articl citat index receiv critic econom reason qualiti isi primarili index journal sci recurr critic sci index journal select process select journal chang fail develop journal literatur restrict journal articl research field comput scienc result confer journal form month journal detail limit tradit citat indic discuss section autonom citat index address limit autonom citat index autonom citat index autonom creat citat index literatur electron format aci system autonom locat extract identifi citat articl occur identifi context citat bodi articl viabil autonom citat index depend abil perform function accur built prototyp digit librari aci call perform task suffici accur work download paper made world wide convert paper extract citat context citat made bodi store inform includ index articl citat locat paper keyword search citat link paper relat paper locat common citat inform word vector similar paper displai context paper cite subsequ public oper complet autonom section describ document document process queri aspect locat document find articl accomplish search monitor mail list newsgroup announc direct link publish familiar aci research send notif paper paper index immedi journal paper increasingli made onlin journal web site journal typic charg access onlin index paper make agreement publish aci system benefici user direct journal web subscript web search engin heurist locat good start point crawl web search page word locat download postscript pdf file duplic url file avoid document process download postscript pdf file convert text prescript zealand digit librari project text file check verifi document valid research test exist refer bibliographi section postscript file print page order detect reorder document autonom find citat articl locat section refer identifi section header citat list detect insert figur page number document refer list set refer individu citat extract list citat typic format citat vertic indent delin individu citat citat heurist extract field year page citat identifi citat identifi find locat document bodi citat extract context citat variat citat list author vari handl regular express heurist citat construct philosophi subfield citat uniform syntact indic posit composit previou label citat mark context exist begin citat format uniform citat articl regular featur citat trend syntact relationship subfield identifi identifi predict desir subfield exist author inform titl inform author journal identifi subfield citat citat articl made significantli wai figur show sampl citat articl extract machin learn public web aci deriv abil recogn citat refer articl abil detail list cite articl show instanc citat multipl articl identifi variant form citat articl enabl statist citat frequenc estim import articl learn machin learn kibler learn algorithm machin learn kluwer academ learn algorithm draft submiss machin learn figur sampl citat paper show typic variat citat format citat extract machin learn public web suggest citat figur problem complet trivial includ author year public routin error autonom determin subfield citat easi comma separ separ list titl full stop separ denot abbrevi punctuat field consid broad class method identifi group citat ident string distanc edit distanc distanc amount differ string symbol distanc edit distanc differ string simpli number substitut requir transform string recent sophist intellig string comparison algorithm introduc yianilo word frequenc word occurr measur base statist word common string word frequenc measur term frequenc document frequenc common inform retriev knowledg subfield structur data case subfield author year probabilist model train bibliograph inform order identifi subfield word structur citat subfield previou method investig algorithm perform quantit test extract number set citat onlin manual group ident tune algorithm train compar correct group autom group test set algorithm base normal sort match word phrase test cover algorithm result autom group error respect correct group citat citat incorrectli group incorrect citat group mark entir group algorithm suffici practic avenu improv learn techniqu probabilist estim base train set bibliograph data boost perform substanti larg quantiti bibliograph inform freeli web collect comput scienc bibliographi inform label train data learn techniqu order associ word structur citat subfield chose model train specif word initi sole model bia error made system error made train data potenti neg impact scientif preliminari investig suggest probabilist inform specif word learn techniqu provid good futur research ad techniqu method method improv citat match perform user correct error aci system benefit abil identifi bibliograph detail paper index properli analyz graph form citat detect citat specif public advantag regular individu articl order autonom extract item high accuraci paper autonom locat research homepag problem difficult investig problem determin author titl inform postscript pdf file autonom found web analyz font easi extract titl author accur identifi author author address simpl detect header detect mark citat author locat header index articl avenu accur extract author address arbitrari articl recogn form articl author bibliograph learn techniqu enabl accur author identif arbitrari articl sole learn techniqu base specif word inform prefer potenti error queri queri keyword return list citat match list index articl literatur link articl made citat figur show sampl queri quinlan digit librari machin learn literatur number citat articl leftmost column column number uniqu host articl citat origin column number citat paper predict end graph show number citat versu year public cite articl number includ main number citat graph index full text citat provid full boolean search phrase iti support search default mode oper retriev citat match group citat ident order result number citat paper includ order date field perform special process order account variant wai referenc proper boolean proxim support cover variant form author author uniqu suffici search word word typic exclud search phrase initi search full text return header match document context articl keyword occur document order number citat citat import articl review date detail includ full list relat document obtain initi keyword search user digit librari citat link user find paper cite public paper cite includ context citat figur list paper cite articl figur context citat click link figur context citat literatur author evalu context summari author limit critic origin subsequ work build origin articl context citat research determin cite cite articl read full find articl relat articl number algorithm word vector tfidf scheme locat articl similar edit distanc comparison articl header find similar algorithm call common citat document frequenc find articl similar combin previou algorithm scheme interest citat hand pick author relat intuit citat inform judg document analog word orient consid common citat pair document weight frequenc citat common citat methodolog paper weight view detail displai relat document discuss nec research plan make freeli research current contact subscrib announc mail send messag text subscrib bodi messag practic avenu improv dissemin access scientif inform web print literatur process ocr store effici technolog imag compress technolog digit librari aci provid addit servic current awar commun featur paper research topic link search option add document feedback search quinlan machin learn test document citat retriev citat citat found click link cite document context citat track document citat articl quinlan program machin learn morgan kaufmann publish san context bib track check induct tree machin context bib track check quinlan logic definit machin learn context bib track check effici classif procedur applic chess end machin artifici intellig palo context bib track check jr simplifi tree intern journal context bib track check quinlan rivest infer tree minimum descript length principl inform context bib track check section delet includ graph main number citat figur digit librari aci group citat paper rank paper base number citat show result search author quinlan small test digit librari machin learn literatur attempt index machin learn literatur context link show context individu sampl figur bib link provid bibliograph detail respect track link activ track context citat email check link show variant form check error group algorithm host number number distinct host cite articl found number citat predict graph bottom show number citat versu year public cite articl titl articl automat quinlan program machin learn morgan kaufmann publish san summari detail paper cite framework reason simon kasif steven salzberg david waltz john david aha detail featur vdm adapt distanc metric adjust retriev section method partit data region tree tree defin relev local neighborhood tree classif devic mbr tree defin static partit space region distanc data instanc group quinlan program machin learn morgan kaufmann san learn symbol rule artifici neural network mark craven shavlik comput scienc depart wisconsin west dayton st wi machin tenth intern utgoff morgan san detail design techniqu improv gener neural explor mean facilit rule extract present experi difficult learn method learn rule accur rule induc quinlan system rule extract train network compar rule induc term complex understand towel shavlik demonstr accur symbol rule extract restrict case program machin learn morgan san ca design evalu rise learn system pedro domingo technic report august depart inform comput scienc irvin california usa detail domain difficulti sacrif speed introduct motiv current machin learn approach induct concept definit exampl fall conquer method partit instanc space region roughli constant class membership obtain approach work plagu sampl result made statist support quinlan program machin learn morgan san section delet figur aci system show context citat articl list cite articl shown context specif form citat shown sentenc citat automat highlight detail link view full detail articl sourc relat summari link show summari cite document citat context discuss area scientist post formal inform research sign receiv email citat found articl index match person post paper interest addit autonom citat project encompass area locat effici inform displai summari citat hub relat document detect overlap current user error graph analysi consid complementari commerci citat indic sci suffici accur sci provid greater area index inform citat referenc work art bodi avenu improv algorithm enabl aci combin method identifi citat articl substanti improv learn techniqu improv aspect system citat indic sci limit number journal index process requir manual econom reward justif select index small number journal account bulk scientif result fact small set journal account larg percentag citat partial due inform overload research read small set journal miss result publish argu citat indic journal index form scientif commun widespread digit librari aci promot dissemin literatur definit disadvantag limit journal select journal select typic review necessarili mean articl make journal worthi index unavail citat index limit journal exclud technic preprint index import find convei short confer justifi journal idea feedback previou work requir lengthi paper present idea feedback present technic work confer paper advanc journal public area comput work present confer journal area rapidli time confer journal public broader coverag provid aci literatur scientist find work cite relev scientist research featur journal indic preprint specif feedback research work work reach journal broader coverag technic confer provid advantag point limit start research limit reduc duplic work reach journal public import connect scientif commun citat statist wide evalu evalu base citat statist lead erron author receiv similar number citat small number research cite influenc research produc significantli quantiti citat paper underli assumpt citat impli scholarli impact true cite document typic consid evalu citat statist evalu base journal citat statist delai journal review public mean statist recent work citat exist confer preprint make context citat easili quickli aci accur evalu import individu contribut index broader select literatur includ confer paper aci provid time evalu articl aci facilit possibl autonom classifi context citat learn larg number citat paper investig classif citat context class expect accuraci compar expect learn techniqu provid predict analyz manner citat usag word sentenc surround citat citat occur group citat classif probabl paper cite time cite paper summari world wide web peopl access inform research institut increasingli make articl homepag author onlin archiv scientif inform web larg articl introduc creation digit librari incorpor autonom citat index aci system autonom locat extract identifi ident citat occur identifi context citat bodi articl built practic prototyp oper paper electron form specif system locat index rapidli number articl made word wide web aci limit index literatur web literatur print articl convert electron form optic charact recognit compar current commerci citat cover journal lower accuraci disadvantag expect time advantag compar current citat indic index articl greater research find recent relev date requir manual effort lead wider lower cost make context citat easili facilit effici literatur inform estim impact articl cover recent work oper facilit rate dissemin feedback revolut web brought inform dissemin due avail inform amount inform long improv effici access inform digit librari incorpor aci organ significantli improv effici scientif dissemin feedback transit scholarli electron publish slow aci speed transit link network literatur encourag scientist pursu cation avenu make work onlin network quickli creat impact acknowledg haym bob michael michael craig comment suggest refer han albert karen van der rob ter paul final brook evid complex motiv journal american societi inform robert cameron citat catalyst reform scholarli commun sl ml nelson evolut scientif technic inform distribut journal american societi inform eugen garfield citat theori applic human lee kurt steve lawrenc automat citat index system ian rob frank shipman digit librari acm confer digit page june acm press step electron research commun comput hall citat improv access onlin journal robert allen edi acm intern confer digit page acm steve lawrenc lee gile search world wide web loss good tradit scholarli journal intern journal jame isi journal select peter yianilo intellig string comparison facil technic report nec research
ML/1593 6 optim search hybrid david goldberg siegfri illig report januari depart gener engin illinoi transport build south mathew avenu il optim search hybrid david goldberg illinoi genet algorithm laboratori depart gener engin illinoi illinoi usa siegfri depart system oper research stanford california usa abstract paper develop framework optim hybrid search optim procedur paper start ideal search problem search global algorithm accept meet basin attract lead accept target local search algorithm paper continu abstract set probabl successfulli hit target basin coeffici equat written account total time search probabilist success reach accept solut optim problem formul local versu global search time optim solut time accept reliabl minim reliabl solut time maxim optim criterion deriv appli import repres problem continu extens work theori immedi understand economi hybrid introduct genet evolutionari algorithm explicit combin underli local search procedur good argument made implicit hybrid combin action select hand variat usual motiv hybrid optim practic achiev effici seek adequ solut qualiti minimum time seek maximum qualiti rare state goal theori adopt formul hybrid detail oper design remain understand effici hybrid system level paper consid theoret framework creat effici hybrid optim procedur paper motiv practic genet evolutionari framework fairli gener work set paper start review hybrid practic theori continu establish ideal optim search method space enabl construct theori time account reliabl condit written yield maximum reliabl fix time minimum time reliabl framework optim optim hybrid appli number repres situat paper conclud comment abstract extend real hybrid set review hybrid part hybrid improv effici search smith grefenstett present earli hybrid algorithm small prototyp skolnick incorpor hybrid techniqu commerci viabl system design ga turbin engin davi foremost advoc hybrid point rare applic undertaken kind combin special search method made contribut state hybrid knowledg distinct made learn hinton nowlan import suggest local search method append effect genotyp termin point local search algorithm davi support point view empir deriv rule suggest ten trial order popul overli disturb theoret thread pick literatur adapt frequenc oper number view probabilist mixtur oper adapt achiev search goal pick earli literatur evolut strategi schwefel good theme pick fairli earli genet algorithm tradit theme map problem lobo goldberg recast problem stochast automaton form perform empir test simpl test problem whitlei formul differ equat markov chain model genet algorithm hybrid number step local search updat formul clever appli result exact differ markov chain equat tough thwart kind understand seek forego contribut import hybrid detail analysi common studi leav framework hybrid matter section abstract hybrid scheme build model optim hybrid address tradeoff requir abstract critic featur search problem solv searcher combin passiv dead zone activ dead zone figur sketch ideal search space depict target island basin attract local method fi type dead activ passiv hybrid scheme coordin searcher section construct draw heavili idea develop ideal hybrid algorithm simpli oper solut minim problem oe accomod inequ sign hybrid work coordin activ global method local method invok unit loss gener candid solut multipl invoc consum time max process proce time solut accuraci target oe oe reach straightforward outlin clue view solut make progress effici question solut target oe oe identifi level set oe subdivid level set discret island target depict figur combin lead target thing understand success call union target global rg denot probabl hit rg singl invoc global searcher pg calcul pg detail note uniform random pg calcul sum area target divid total area space random search probabl calcul requir integr distribut target involv global calcul difficult searcher random probabl paramet assum vari slowli constant valu provid approxim rg describ cost interact invoc ideal search space famili paramet recogn local search dynam work iter start posit solut simplifi thing assum usual case converg solut defin local valu averag number time unit requir target start basin attract fi figur basin shown tessel gener basin geometri expect occur kei thing weve identifi local time constant valu quantifi time arriv start point basin result arriv time basin accur formul treat arriv time thing simpl interpret local constant valu basin note target singl possibl pictur make partit target basin attract solut minor point pursu paramet analysi suggest basin fi difficult hit target directli chanc hit basin converg target good quantifi probabl hit basin fi target invoc pg fairli straightforward imagin calcul chosen random search fix probabl distribut addit featur space mention optim ideal hybrid land global zone tractabl place search point space lead global zone local search case land basin fi local search lead solut meet criterion oe basin fail converg max time unit call type region dead zone type dead zone distinguish converg solut inadequ type ii dead distinguish indic converg solut permit consum remain comput time dead zone place calcul probabl hit dead zone pd pg dead zone left global zone tractabl basin probabl hit dead zone complement hit union global zone tractabl basin note count dead zone basin reach accept solut permit variat optim comput global local ignor tractabl long highlight posit time reliabl optim matter section account time reliabl ideal section examin kei relationship paramet section solut time reliabl optim condit decid alloc time wise local global search start account time calcul probabl meet criterion account time straightforward kei make set hybrid determin split local global search call local time constant averag local time constant write solut time consum iter loss global search assum occupi unit cost measur rel relationship depend rule explor turn calcul reliabl relationship goal hybrid converg limit time local search target local constant valu count success probabl success hybrid iter determin sum probabl hit global zone initi probabl valu target constant call probabl calcul pg probabl success level probabl hit global zone sum probabl hit basin lead target time set singl trial calcul success probabl success iter elementari probabl limit reliabl time condit requir auxiliari relationship depend rule imagin run time unit converg statu local searcher calcul proce conveni case treat upper limit run time calcul max pd calcul case remaind wai optim primari make effici hybrid spend global search versu local search formul requir time spent local search wai case constraint requir solut achiev solut maxim probabl achiev fix time minim time achiev solut reliabl formul optim problem equat previou section minimum time minim time subject reliabl easili recast problem term probabl reach criterion call probabilist error simpli error symbol ff denot quantiti assum error ff reliabl condit rewritten ff logarithm rearrang yield ln ff recogn restrict posit minimum time formul condit consequ substitut relationship time account obtain min ln ff basin target probabl local search time condit determin optim local time maximum reliabl maxim reliabl result similar condit coeffici constraint assum total time rearrang time relat yield ta posit main concern perform iter condit suggest maximum time set max substitut express reliabl condit minim error yield condit min ta comparison equat logarithm equat show constant ff versu differ sign ff integ constraint exist practic place greater restrict reliabl call singl iter constraint solut basin condit section fairli case basin detail solut sound restrict point condit appli gener discret case proper interpret rearrang optim condit import physic insight tradeoff global local search basin basin probabl local time constant basin possibl unclear ahead time prefer altern fruit cumul probabl success result higher reliabl minim error fix suggest prefer basin algebra yield small approxim condit worthwhil spend local search cumul probabl success suffici small success probabl growth quickli ratio constant deriv section appli condit gener discret case order basin order low high local optim check move list success check ith basin global optim determin local optimum error approach solv problem basin continu probabl distribut function total cost solut formul ident publish context genet algorithm popul size optim conveni test develop requir compar actual probabl distribut exponenti exponenti curv indic local maximum minimum reader interest deriv detail consult origin comput point view test simpl applic theori turn appli theori number repres pg uniform pg uniform analyz chang improv analyz chang relax criterion remaind consid turn case pg uniform probabl hit global find solut uniform essenti tradeoff afford local search correct set time criterion paramet error time figur case pg calcul fail suffici time permit singl iter local search make mistak hit dead zone case pd optim error written straight ff figur show optim error function time assumpt uniform approxim met local solver rapid converg rate approxim equal basin assumpt global zone approxim met difficult problem easi problem success criterion reach global search case pg uniform case simpl tradeoff simpli set time criterion uniform algorithm rip introduct global interest probabl hit target probabl pg possibl set set uniform special case calcul earlier cumul probabl hit global zone basin lead success complement dead zone probabl pg pd elimin time rearrang yield pd pg larg global small dead larg uniform situat effici combin work examin case calcul critic time criterion error set pd pg solv critic yield ln pd ln pg uniform greater critic case improv global searcher opportun improv global search algorithm expect global local search assum model case ii qualit improv probabl hit target origin global zone probabl pg imagin expand factor improv global searcher reduc probabl hit dead imagin reduc reduct coeffici ae equat permit calcul ratio critic valu improv ln pd ln pd pg pg rewritten fl ffi fl ln ln ffi solvabl problem dead zone reduct fl interpret ffi aid recogn small ffi global zone enhanc dead zone reduct tend work expect global zone enhanc tend push hybrid greater usag dead zone reduct condit fix rg enlarg probabl success case relax criterion user decid relax accuraci criterion case ii recogn effect reduct criterion make easier global search hit reduc size dead zone effect fairli straightforward easi larger target easier global searcher hit effect criterion relax dead zone reason relax criterion mean type dead zone previou fix point suffici accur meet criterion pass type ii dead zone wander function valu meet criterion result tendenc relax criterion dead zone reduc size notic case iv essenti case analysi ratio modif proof principl experi section present result experi support forego theori chosen simpl function minim test bed variabl close interv function consist basin cy radiu depth surround area function figur testb function basin attract shown top view cx cy figur displai function global minimum global search algorithm chosen random search uniform probabl distribut local search algorithm chosen standard algorithm geometr similar basin uniform time unit averag probabl hit dead zone pd experi carri simul termin criterion maximum error experi pg uniform set oe chanc hit target pg figur probabilist error ff sim obtain simul plot function compar theoret result plot show good match theori experi experi larg pg uniform lower threshold accept global zone case find accept solut local search larg global zone effici global search pd pg show thing experi pd pg set oe lead pg equat predict probabilist error ff smaller verifi compar result analyt model figur show chanc find accept optimum significantli lower add comput overhead benefit search case observ analyt model predict experi figur probabilist error ff shown function time theori experi theori match expect theori experi theori experi figur error ff function time show good agreement theori experi demonstr correct optim condit consist lower error time ff result adequ note theoret curv integ stair step plot ramif extens forego attempt step theoret understand optim hybrid effort note connect common stark abil integr compon abil address answer effici analysi number difficult question assum knowledg paramet depend complex wai problem solv searcher calcul paramet trivial problem searcher paramet assum remain vari probabilist benefit simpl analysi procedur permit start answer outweigh inact understand effici hybrid number continu extens work suggest perform addit empir investig model ideal real problem solver perform investig calcul valu gs perform investig valu type solver basin attract estim mean optim hybrid practic extens includ multipl realist step item undertaken demand effici design optim hybrid paper construct theori effici hybrid appli theori number base outlin number continu extens work ideal hybrid consist step global solver step local solver ideal search space consist basin attract lead accept framework problem hybrid search singl iter result global searcher hit case job global searcher hit potenti basin case local search lead target wild framework requir set characterist probabl valu hit target basin coeffici quantifi length time expect reach accept solut paramet suitabl equat account time result theori permit user calcul optim balanc local global search hybrid long genet evolutionari algorithm usag ad hoc benefit theori result paper aid user understand proper balanc global local solver find solut accur acknowledg paper conceiv professor goldberg sabbat section medic informat stanford mark russ john koza invit stanford grate fernando lobo number shape author martin pelikan care read sharpen argument author jacob figur professor goldberg contribut paper sponsor air forc offic scientif air forc materiel grant research fund project provid grant armi research laboratori feder laboratori cooper agreement govern author reproduc distribut reprint govern notwithstand copyright notat thereon view author interpret necessarili repres offici polici express air forc offic scientif research govern refer evolut strategi variant comput implement genet algorithm engin comput scienc john wilei adapt oper probabl genet algorithm intern confer genet handbook genet algorithm van nostrand reinhold genet virtual block complex publish illig van genet algorithm travel salesman problem intern confer genet algorithm learn guid evolut complex combin optim method michalewicz handbook evolutionari comput oxford press make hybrid genet algorithm ieee intern confer optim popul size constant comput cost parallel problem solv genet combinatori feasibl constraint intern confer genet domain machin learn design optim intern confer genet numer recip cambridg press adapt genet optim techniqu genet algorithm intern confer genet bin pack adapt search intern confer genet algorithm model hybrid genet algorithm genet algorithm engin comput scienc john wilei
AI/1594 2 decemb comput scienc ibm research report ai ibm research se june hong ibm research thoma watson research center yorktown ny research almaden austin beij watson tokyo zurich limit distribut report submit public ibm copyright accept public issu research report earli dissemin content view transfer copyright distribut ibm prior public limit peer commun specif request request fill reprint legal obtain copi articl payment copi request ibm watson research center box yorktown ny usa report internet ai ibm research apt morgenstern se june hong tj watson research center ibm research yorktown ny abstract ibm plai activ role ai research incept year ago trend reflect demand applic behav ibm todai carri ai research interdisciplinari fashion combin ai techniqu comput techniqu solv difficult technic problem introduct background contribut artifici intellig research date back arthur checker program made histori demonstr comput program plai checker beat human learn experi plai human player geometr theorem prover axiom geometri diagrammat inform prove basic theorem geometri earli dai ibm rich histori research broad spectrum ai research area activ ibm form ai group earli notabl contribut earli includ system queri natur languag comput algebra system subsequ commerci axiom system robot conceptu graph knowledg system develop pharmacolog knowledg expert system epistem logic nonmonoton reason ai research ibm base symbol paradigm research continu recent year trend statist ai applic area machin learn natur languag process led growth area statist learn theori bayesian network activ area inquiri report recent research tradit newer area ai section ai activ ibm research introduc extent ai ibm comput scienc research broad statist write reason research knowledg span wide varieti includ logic nonmonoton plan intellig agent discuss logic program nonmonoton reason ibm tradit logic program nonmonoton reason research watson lab forefront develop constraint logic variant logic program facilit arithmet reason gener reason comput system base constraint recent research logic program includ work benjamin logic program logic program specif scope potenti conflict mutual specif prioriti prioriti resolv conflict rule logic program form priorit logic type priorit default share high complex express form priorit default logic program implement common java librari enabl commun busi polici price promot retail custom applic includ xml format busi call busi rule markup languag pilot million industri consortium develop suppli chain integr manufactur default reason busi rule studi morgenstern singh develop network knowledg structur enabl effici reason potenti conflict busi rule fan extend tradit paradigm semant network inherit except attach logic formula node provid method determin formula node case method determin rule save discard involv inform inher topolog special rule give prefer class busi rule fan paradigm work busi straightforward interpret busi case situat node busi rule logic formula fan ibm develop expert system benefit inquiri medic insur system dynam configur bank insur product network scheme natur languag understand project ibm network structur innov wai improv perform difficult task text stori understand ibm research lab nobel gerd lead seek develop system understand mean natur languag research team depart standard natur languag process center anaphora word object identif system center world knowledg achiev slot grammar set transform rule gener textual input innov li transform repres understood textual input central part analysi fractal hierarch network arbitrari order organ input text structur isomorph exist fractal network isomorph facilit comparison text effort ibm research kr structur understand natur languag andrew index stori project seek organ larg knowledg base stori strategi motiv gordon develop languag repres strategi close model standard ai plan techniqu addit index languag applic interact entertain explicit reason strategi enrich interact experi erik work stori understand natur languag templat gener principl cognit behavior understand goal action system combin art natur languag process knowledg agent interact work extend earlier work fuse ai techniqu cognit psycholog intellig schedul research intellig agent develop core technolog facilit quick implement intellig explor foundat principl applic auction schedul build learn project led joe build hybrid intellig agent reason learn framework consist set core javabean set javabean agent construct compon editor standard environ project plan call build platform compat fipa intellig physic agent standard java intellig agent technolog form central part inform economi project head jeff studi role intellig agent set price varieti situat auction negoti situat vari wide term amount knowledg assum particip amount comput reason particip expect perform group studi strategi base set formal analyz behavior algorithm base strategi theoret analysi complement implement intellig agent program implement strategi retail consum kephart colleagu studi role reinforc inform inform bundl environ intellig agent technolog manag plan schedul problem richard colleagu examin difficult problem schedul multipl machin multipl object constraint problem examin schedul paper manufactur job factor batch size downstream schedul consequ consid simultan difficult problem achiev optim solut case minim total tardi machin group tackl problem develop agent architectur agent solut cooper exchang result algorithm implement basic result shown impress result achiev effici manner work receiv daniel wagner prize excel oper research practic contribut statist ai term statist ai denot area research methodolog ai statist brought achiev higher level intellig perform domain integr notic effect speech handwrit natur languag knowledg discoveri data mine relat applic machin learn speech handwrit recognit speech recognit technolog pioneer ibm earli largest group world dedic solv problem speech languag uniqu statist model approach long term research effort initi jelinek continu led highli success retail dictat product languag recognit project includ transcript radio broadcast relat activ includ speech biometr verif speech speech speaker recognit emerg thrust research activ combin speech recognit technolog natur languag process includ dialog natur languag statist spoken languag understand work lead system user speak natur tongu control applic person style emphasi scalabl dialog system capabl handl simultan input modal prototyp system applic rang stock mutual fund trade phone air travel shop languag includ spanish prefer handwrit clear pen paper suit task handwrit frequent conveni simpler current comput altern comput clear pen paper prefer task pen paper note frequent conveni simpler current comput altern pen technolog group tj watson research center believ tremend market pen comput system capabl satisfi high expect goal creat pen technolog group research aspect pen user interfac recent ongo algorithm research includ method perform handwritten document retriev improv handwrit recognit accuraci statist languag model natur languag process natur languag process ibm dynam research area span wide rang frequent overlap project human comput interact data mine commun pioneer algorithm system significantli understand field creat research direct accomplish includ earli machin translat system year air forc natur languag queri statist machin translat paradigm statist mathemat investig natur algorithm text categor base symbol rule induct statist theori pattern recognit work theoret issu comput linguist practic algorithm text machin translat knowledg manag algorithm develop colleagu extract inform enorm collect document web investig driven question answer user specif question mind valid answer differ level individu kei summari research lexic navig permit user find relat document connect origin document base set techniqu extract vocabulari item entiti domain relat link lexic network link concept amount inform present web comput explod abil read absorb remain essenti fix develop machin learn algorithm mine recur pattern linguist associ wealth data develop approach linear classif train quickli accur recent applic includ text categor email rout interact search web base concept dialog categor develop current algorithm automat topic discoveri newswir feed product aid analyz call automat identifi topic number call develop algorithm structur extract inform support automat updat unstructur text intent futur nlp system adapt domain mandatori manual enabl applic machin translat technolog crucial due wide usag internet exchang inform commun peopl world mt effort princip conduct research fulli automat machin translat algorithm explor method assist manual translat process linguist annot tool develop grammar check control languag check step make text machin translat develop extrem rapid statist machin translat algorithm specif tune inform retriev larg multilingu document collect effort advantag slot grammar base bilingu lexicon transform system produc accur machin translat broad coverag slot grammar parser european asian languag develop english slot grammar parser basi grammar check control languag check machin learn relat area ongo rapid growth data due internet widespread creat knowledg discoveri data mine methodolog challeng extract knowledg data draw princip research data pattern machin learn ibm research forefront excit area begin kei advanc robust scalabl data mine method fast pattern detect larg text web innov busi intellig applic worldwid research laboratori kei focu area kdd research ibm continu high perform scalabl data mine techniqu data repositori earli lead area establish quest colleagu associ rule sequenti pattern technolog effici detect pattern fast scalabl tree model invent technolog scalabl parallel data mine develop part project provid origin basi impetu data mine intellig miner principl focu area research kdd learn system predict data focu area research weiss rule base predict model integr data mine framework work result data mine middlewar rule base probabilist estim probe framework colleagu combin machin learn principl statist learn theori data manag technolog innov busi intellig applic area insur risk manag retail target market focu area applic machin learn perform manag manag kind comput web transact electron order good servic avail research ibm seek level autom perform manag work conduct earli includ expert system colleagu autom manag mv oper consol current work includ studi predict detect al advanc knowledg perform event mine form data mine recogn situat requir specif action ensur good perform intellig tutor system construct model understand interact student base model learn place group research scientist ibm expand paradigm interact team student develop intellig tutor system monitor manag team student collabor solv problem techniqu includ defin typolog collabor problemsolv store evid individu group perform bayesian network close relat area machin learn applic pattern recognit techniqu comput biologi solut discoveri repeat pattern amino acid sequenc gene function identif advanc pattern match algorithm develop bioinformat group activ pursu mine inform sequenc vision intellig vision requir abil understand imag camera sensori devic produc requir provid comput background comput inferenti method understand imag exploratori vision group ibm head studi vision system applic rang biometr video autom object recognit supermarket vari research reli innov technolog ibm research scientist develop method transform ordinari video camera segment function hand pose fingertip gestur imag iri research develop method recogn object partli occlud technolog develop includ color segment techniqu base simul method visual motion method face gestur innov sensor motion trajectori extrapol track motion techniqu foundat project ibm research biometr project explor wai secur system enhanc fingerprint recognit face recognit techniqu video analysi project explor video video function akin search string bodi harder perform high accuraci reason time constraint face recognit event recognit techniqu central project human comput interact aim aim emploi devic user commun aim touch specif hand gestur point grasp work intend partli peopl sever handicap troubl tradit devic face gestur recognit technolog central project project explor autom object recognit supermarket applic studi recognit veget regist problem difficult veget recogn tradit supermarket plastic partli occlud combin background subtract separ veget superflu inform concaten relev inform featur matcher find compar item memori regist number case close clerk correct match system learn mistak field test scanner manufactur program applic histori game plai began arthur samuel develop expert program learn experi forti year ibm research continu break ground develop program chess famou program deep blue made headlin beat gari program defeat world champion develop program long challeng problem ai program combin evalu function determin good posit effect search techniqu search space state difficulti develop program li fact state space larg branch factor number state reach state sophist evalu chess posit difficult develop perform deep develop murrai joe jerri chess champion joel reli combin brute forc sophist knowledg chess fundament success ibm sp comput power processor node yield processor work tandem net result system capabl calcul million move deep understand chess strategi implement evalu consid materi chess king safeti measur board tempo measur relat aggress rel game seemingli simpler game develop program prove difficult random element introduc game roll dice make appar intellectu game make branch ration higher hundr solut reli brute forc comput power primari techniqu gerald tesauro develop program reli form reinforc learn tempor differ learn explor machin train neural network learn complex function function evalu function evalu game posit plan strategi reli sophist evalu function learn expert expert chang mind board probabilist natur game mean expert rare interest game tesauro believ program learn evalu function applic program program valu ibm research solv challeng ai lai foundat crucial applic develop technolog deep blue central ongo work deep comput institut seek integr power intens comput advanc analyt area applic area comput bioinformat pattern data optim neural network technolog develop enhanc softwar horizon machin develop ibm hope leverag extend horizon comput aspect ai techniqu conclud remark contrast earliest artifici intellig consid ai recogn central part comput scienc transform attitud due chang natur comput live comput comput devic ubiquit everydai applic easier user applic understand anticip behav intellig ai integr part inform revolut clear combin ai disciplin work successfulli solv challeng technolog problem reflect technolog academ set ai techniqu found larg proport comput scienc depart trend evid ibm ibm research todai larg motiv project gener organ problem technolog tradit academ disciplin work hard ensur commun scientist similar research interest ibm research past year organ interest commun close parallel tradit academ disciplin pic augment replac tradit project organ ai strong compon project pic organ ibm research ai technolog plai major role project comput scienc research ibm current pic close relat ai artifici intellig pic area knowledg discoveri data human comput natur languag perform model comput biologi inform pic internet addit websit reachabl previou includ speech handwrit recognit acknowledg ai research ibm work introduc provid inform paper refer swami mine associ rule set item larg acm sigmod confer manag page white probabilist estim base data mine discov insur risk ieee intellig lr pv de ps ma robust method featur model continu speech recogn proc int conf signal volum page tool improv document qualiti confer appli natur languag associ comput page agent build learn environ project jh object imag system patent pf sa vj ps statist approach machin translat comput campbel knowledg discoveri deep blue commun novemb cooper byrd lexic navig visual prompt queri refin diglib damerau transform queri answer system oper statist american journal comput davi ibm telephoni system applic volum page jy vardi reason knowledg mit fipa websit foundat intellig physic agent gelernt realiz geometri theorem prove machin intern confer inform page gordon plai chess improv interact entertain spring symposium ai interact kephart shopbot thoma sixteenth intern joint confer artifici page morgan jh system acm page octob hy chan declar approach busi rule logic program xml michael acm confer electron acm sj hong iter approach gener minim rule exampl ieee transact knowledg data jf touretzki skeptic theori inherit nonmonoton semant network artifici ibm deep comput home page ibm ibm jaffar jl constraint logic program confer principl program languag rs scientif comput system york numer algorithm group isbn isbn page ts jl hellerstein rish recogn transact perform manag jk real time expert system jk jh sj base consult market ai white biolog inspir comput fourteenth intern joint confer artifici intellig page morgan yeh cooper multiobject support paper industri ma jl hellerstein mine partial period event pattern unknown period intern confer data mahadevan connel automat program robot reinforc learn artifici ol scalabl express medic terminolog mc transform system page mc slot grammar morgenstern inherit appli nonmonoton techniqu problem industri artifici mueller human comput model stream thought sh mae instanti speech biometr modul natur languag implement telephoni icassp june perceptu interfac inform joint process audio visual inform interact intern confer spoken languag volum page mp perron sd connel mean cluster hidden markov model workshop frontier handwrit jf eh quantifi contribut languag model writer independ line handwrit recognit workshop frontier handwrit radev predict annot combinatori pattern discoveri biolog algorithm samuel studi machin learn game checker ibm journal research visual inform improv speaker recognit speech process confer santa august mehta scalabl parallel classifi data mine intern confer larg boll automat text extract video annot retriev intern confer pattern mk algebra support teamwork manag role collabor learn environ cooper work jf sowa principl semant network morgan stein morgenstern motiv action formal theori causal reason artifici similar measur writer cluster workshop frontier handwrit tesauro achiev plai neural sm weiss oper data improv predict comput pattern detect intern workshop distribut oper manag mc improv natur languag process linguist document annot cole workshop semant annot intellig page sm weiss lightweight rule induct intern confer machin learn zhang ol text categor base regular linear classif method inform retriev
HCI/1595 4 interact concept hierarchi studi submit partial fulfil requir master scienc inform manag sheffield clair septemb abstract queri process supplement origin queri addit term order refin search retriev effect queri user system work expand queri system suggest term user select add queri studi shown interact queri potenti improv retriev rare succe achiev potenti shown user desir control process order achiev function system repres user interfac main aim studi focu small aspect interfac investig method present potenti queri term effect retriev effect tool test studi automat gener hierarch concept document set word phrase extract document retriev queri process subsumpt term hierarch present user set hierarch menu order evalu hierarch retriev effect menu structur compar flat list term result show differ retriev effect expand queri origin differ perform queri expand menu expand list subject menu found significantli faster select term add significantli fewer term queri subject list suggest hierarch menu benefici inform retriev assist user expand queri quickli effici degrad retriev effect user percept hierarch menu structur subject appreci simplic interfac navig problem identifi type term extract subsumpt process posit opinion subject advantag menu queri flat list demand develop tool conduct tabl content abstract tabl content introduct interact queri compar studi search behaviour human comput interact system background motiv cluster system develop visual methodolog methodolog theori method investig subject topic system design procedur result subject characterist system effect recal task complet time term select summari topic characterist user percept system discuss result retriev perform term present user percept tool difficulti impress system interfac document summari relat previou work search assist pathfind network summari recommend limit studi choic subject design system futur work system develop interfac develop aim refer appendix appendix appendix appendix appendix introduct queri process ad term origin queri attempt refin inform search improv retriev effect queri automat interact manual queri user simpli reformul queri alter delet term resubmit queri retriev system automat queri occur system identifi term add origin queri assist user aq shown effect improv retriev perform interact queri system user particip process system offer user select potenti term select user ad origin queri state process queri sourc term method select term term sourc aq iq stem term manual construct thesauri relev feedback relev feedback document relev user previou iter search sourc queri term method shown effect enhanc retriev perform success relev feedback major studi iq relev feedback sourc term sourc term identifi number method select term sourc method base rank term term document frequenc term inform appli aq iq aim studi conduct user test multipl document tool hope effect method interact queri base interact queri support tool automat gener concept hierarchi term set document retriev queri document retriev initi queri sourc term addit term origin queri salient word phrase extract process form term word phrase arrang concept hierarchi gener parent term subsum specif child term concept hierarchi present user set browsabl hierarch menu structur user expand origin queri hierarch menu select term add queri tool term found document retriev hope concept hierarchi provid user overview relev document collect relationship term anticip overview document collect assist user select term research aim studi establish present potenti term set hierarch menu assist user select term successfulli improv retriev effect interact queri aim experi establish interact effect improv retriev establish present term set hierarch menu enhanc retriev obtain user percept queri tool specif object experi establish interact concept hierarchi enhanc recal flat list establish interact concept hierarchi improv document retriev flat list determin variat topic affect effect assess usabl learnabl concept hierarchi obtain user percept interfac support concept obtain user evalu concept hierarchi tool compar tool obtain preliminari opinion overview document collect order achiev subject particip queri interfac displai term suggest set hierarch menu interfac displai term flat list subject expand queri number topic subject complet questionnair assess understand topic difficulti expand queri queri complet subject opinion tool user interfac interview section identifi kei area research relev studi section discuss interact queri retriev section discuss research influenc develop tool describ develop section briefli review literatur surround method term present section section discuss methodolog adopt studi describ procedur result present section discuss relat previou work section recommend futur work section interact queri interact queri user offer number search term suggest retriev system queri term user select term add queri order retriev document satisfi inform determin term system aq varieti sourc indic word relat term relev feedback vast major studi relev feedback sourc term iq iq method implement number system porter wade unclear iq function significantli retriev effect compar studi surprisingli studi compar rel effect aq iq cranfield test harman show ad term gener number automat method improv effect origin queri achiev improv effect obtain simul perfect user select term list term gener relev feedback varieti statist techniqu rank term top twenti term automat expand origin queri optim result aq relev feedback show perform improv queri perform degrad queri simul user select term term top twenti relev document unseen user expand queri simul iq produc improv retriev effect perform queri enhanc degrad studi illustr iq potenti improv retriev result fail show real user achiev retriev standard van rijsbergen studi retriev effect aq iq multipl iter argu realist view queri iter process singl event aq found effect number iter compar simul experienc real inexperienc user aq found improv retriev effect simul experienc user aq found inexperienc searcher iq fail improv aq retriev effect text retriev confer test collect twenti document retriev initi queri relev feedback perform document rank list twenti queri term produc aq condit term rank ad initi queri twenti document retriev iter queri execut search found produc larg improv retriev effect queri iter search experienc term select simul rank list twenti queri term util term calcul relev feedback term weight function appli relev document retriev document set term rank ad initi queri twenti document retriev iter search gave retriev effect consid measur experienc user perform improv topic compar aq search experienc user iq outperform aq result show potenti iq enhanc retriev effect multipl iter establish inexperienc user achiev potenti improv retriev effect van rijsbergen recruit subject search topic execut iter queri search retriev document suggest term ident simul experienc user condit subject present twenti relev feedback term queri select select term ad queri found iq inexperienc user retriev effect aq compar automat improv search degrad ten studi suggest iq potenti greatli retriev singl multipl iter queri actual effect achiev real searcher fail reach potenti van rijsbergen suggest effect train user term select search strategi studi real user perform iq inconsist result unclear actual retriev effect iq significantli greater aq found retriev perform iq function interfac onlin librari catalogu effect aq function interfac iq function instal librari catalogu notic system invit searcher initi user queri system displai search result extract keyword document select user relev top term displai user select term add origin queri reformul queri execut result shown user user conduct iter search search system log found reformul iq function class number retriev effect iq function assess searcher select relev document expand result list retriev effect found iq function lead document relev al compar result earlier experi aq led select relev item occas aq iq compar directli iq function oper system fail retriev effect aq mechan studi real user fail achiev potenti retriev effect offer iq al suggest iq effect give user control queri system user control relev judgement retriev document suggest term suggest balanc reach system user control belkin investig effect retriev perform differ user control relev feedback function found greater user control retriev effect user satisfact belkin design interfac user control relev feedback function baselin interfac relev opaqu interfac user document relev order retriev similar document feedback function transpar interfac show user term ad queri relev feedback final penetr interfac present user list feedback term user select term add queri relev feedback function execut user conduct search baselin system offer relev feedback relev feedback system subject retriev thirti document search relev document top thirti document result show subject relev feedback system perform subject baselin condit feedback option subject penetr feedback condit perform subject opaqu transpar condit differ retriev effect opaqu transpar group result show penetr group requir fewer iter retriev relev document baselin group equal good number relev document opaqu transpar group result suggest user control iq benefit retriev effect reduc number iter requir conduct effect search addit user state prefer system relev feedback function system feedback discuss shown interact queri great potenti improv retriev effect automat queri user studi disappoint fail show real searcher iq improv aq consist retriev effect iq vari search task searcher experi encourag result suggest correct balanc user system control relev achiev improv retriev effect user prefer control queri reformul search behaviour major research iq searcher behaviour process queri effect studi concern searcher select sourc term searcher behav situat trec interact track provid test ground interact queri okapi team conduct studi searcher behaviour interact inform retriev includ behaviour iq relev feedback relev feedback searcher item similar searcher primarili ad term aid document recal proport relev document retriev user gener perceiv increment queri facil okapi system effect actual retriev effect poor walker beaulieu compar okapi system relev feedback control system relev feedback found control system searcher requir iter complet search okapi relev feedback function searcher found prefer control system okapi offer control search process search perceiv easier control system relev searcher confid result okapi system suggest user relev feedback function okapi perceiv effect find appeal easier studi searcher behaviour okapi system conduct sanderson studi search behaviour relat searcher topic characterist found queri reformul half search reformul independ system control okapi system relev feedback okapi system relev feedback searcher reformul queri retriev small number relev document strong correl number neg relev judgement made number iter search found evid suggest avail relev feedback encourag user reformul queri beaulieu al found queri gener reformul wai queri expand term suggest relev feedback function alter user alter term suggest term list ad user alter list search topic difficult identifi relev document control okapi system prefer subject relev feedback system requir unwant term remov thought time consum process user express desir control search term suggest relev feedback present control rutger particip trec interact track inqueri system investig searcher understand posit neg relev feedback compar control user prefer inqueri system relev feedback found control system easier prefer inqueri perceiv power flexibl control system sophist perez xie subject comment posit relev feedback function neg relev feedback function elimin item term suggest neg feedback function frequent term suggest posit feedback function user state difficult consequ term neg feedback list posit neg term creat cognit load perez studi illustr user tend express desir control reformul search reformul process complic difficult execut find relev feedback effect concern process hard understand effort part user select term output iq techniqu implic develop user interfac system interfac reflect underli function system user desir control search process queri human comput interact rodden argu relev feedback shown effect improv searcher reluct process relev feedback repres user interfac reason relev feedback facilit incorpor visual search process user interfac make relev feedback process enabl user compil effect search function system repres level user interfac describ okapi team develop okapi system facilit user interact interfac abandon favour graphic user interfac repres search process seri phase includ queri reformul implement iq prefer aq user control search process evalu usabl navig displai import interfac design found gui pose problem attent paid layout window legibl beaulieu describ experi evalu retriev effect usabl interfac design experi illustr import close relationship system function interfac design interfac displai present inform screen time system carri aq told user document relev process underli relev feedback function reveal user order reduc cognit load aq facil led select relev document search aq searcher claim notic prompt felt understand term ad queri difficult control direct search interfac consist gui overlap window window gener stage newli creat window overlap repres search process game searcher system turn user relev document press button order iq term suggest displai window user select add origin queri posit select term remov unwant suggest featur give user control retriev effect greatli reduc compar interfac user comment judg relev retriev found difficult judg relev term suggest relev feedback function unsur term chosen user comment interfac found overlap window distract window displai difficult read addit cognit load user make relev judgement select relev reduc effect system artefact interfac interfac interfac design repres function present inform clearer illustr iq function develop interfac consist singl window multipl pane depict iq function view result user enter queri system displai top document retriev list suggest term user add queri pane continu displai work queri term ad delet relationship queri reformul search result system increment queri alter list suggest term select relev item user effect relev judgement deal fewer suggest term time increment queri closer interact system user evalu interfac reveal iq facil improv retriev effect compar gui overlap window experi illustr import repres underli function system interfac order support queri essenti assess integr usabl function system interact import cognit process inform retriev consequ interfac cognit load user depend extent process visibl amount control system user interact system function usabl account design interfac user approach potenti effect inform retriev iq offer investig import user interfac retriev process visual relev research effect present term retriev perform main aim studi focu small aspect interfac investig method present potenti queri term effect inform retriev term extract document return queri present user set hierarch menu list term retriev effect method term present evalu system tool test studi develop sanderson croft method automat gener hierarch concept document set word phrase extract document process type word word phrase hierarch present user set hierarch menu hope user menu gain overview document collect assist user select term menu order effect expand queri background motiv debat inform retriev effect retriev approach retriev relat manual construct thesauri subject classif decim classif scheme retriev approach world wide web onlin resourc success yahoo search manual construct subject hierarchi searcher hierarchi retriev web page medlin searcher medic subject head explor content hierarch mesh mesh term search term manual construct hierarchi retriev construct labour intens larg document found hierarchi fail suffici specif concept effect inform retriev difficult hierarchi constantli reflect frequent chang document www method automat gener subject classif scheme document collect great benefit inform retriev automat assign document classif scheme reflect content document user gain overview subject content easili locat document relev specif subject cluster cluster wide method automat gener hierarch subject classif scheme set document document collect divid defin set term made word phrase document match cluster similar term term defin cluster gener hierarchi initi cluster produc level specif cluster process repeat individu document remain cluster hypothesi state similar document relev queri recal enhanc gener group document cluster aid inform retriev gener group document techniqu pedersen tukei hierarch cluster document collect facilit system divid document collect small number document cluster present user short summari document cluster user initi cluster select interest select cluster combin present select interest cluster smaller individu document hierarch cluster suit search initi set cluster provid user outlin document collect requir user provid initi search term hearst pedersen shown techniqu effect view retriev document suggest topic orient cluster identifi subset relev find exampl relev document relev feedback elimin subset irrelev document user submit queri system document retriev rank order user request document cluster explor manner similar hearst pedersen compar retriev effect rank document cluster origin rank retriev result trec queri found averag higher document cluster number document origin rank retriev result list suggest cluster hypothesi similar document relev queri valid assumpt hierarch cluster techniqu effect inform retriev cluster automat gener hierarch thesauru avail thesauru shown substanti improv retriev system test collect willett cluster successfulli gener automat classif file document de hierarch cluster method queri techniqu argu list retriev document long user examin document relev document automat cluster retriev document topic hierarch classif cluster algorithm evalu algorithm de al cluster top rank document retriev trec queri select cluster queri number relev document found higher hierarch classif techniqu cluster method queri suggest cluster techniqu effect enhanc retriev de al suggest cluster retriev document user structur text retriev document improv retriev discuss illustr automat gener hierarchi cluster method benefit inform includ queri main concern cluster retriev inform cluster defin number term difficult establish topic cover cluster term describ method describ displai list repres term displai kei passag cluster kei document method convei topic cluster user concern cluster document present cluster cluster central theme document assign cluster base possess portion term defin defin term document cluster relat central topic system develop addit cluster techniqu cluster document possess term defin cluster cluster gener possess defin cluster consist group document defin term cluster base subject hierarchi similar manual construct classif scheme gener concept hierarchi specif document collect advantag type cluster defin term cluster label cluster aid definit document cluster concern topic cluster advantag valuabl retriev inform tool test studi develop sanderson croft method automat construct hierarchi singl term cluster hierarchi gener set document retriev queri present user set hierarch menu menu provid user overview set retriev document build hierarchi term extract set sanderson croft develop design term hierarchi extract document reflect topic parent term refer gener concept child relat type relationship hold transit descend construct strict child consid structur direct acycl ambigu term expect separ entri term document creat concept term techniqu subsumpt extract word phrase document collect subsumpt term associ reflect relationship found concept parent term subsum concept children sanderson croft state subsum condit mean subsum set document occur set document occur frequent subsum result parent examin term pair extract document condit reveal condit overli term pair fail meet condit occurr condit relax subsumpt process redefin mean subsum set document occur set document occur occas term term merg cluster term select process creat initi queri document retriev initi queri expand local context analysi passag document retriev queri examin word frequent ad initi expand document retriev queri term word extract passag document compar term document frequenc frequenc term collect occur threshold consid valid phrase method construct concept hierarchi test test collect queri expand queri retriev perform inqueri search engin top document retriev queri word phrase extract passag chosen method term select select term compar term identifi subsumpt relationship relationship concept hierarchi displai set hierarch menu full descript construct concept hierarchi found sanderson croft sanderson user studi conduct evalu properti hierarch structur test relationship parent term children user present term pair thought relationship term interest relationship consid user identifi type relationship child parent user child aspect hypernym type hypernym relationship denot child specif concept parent found subsumpt pair judg interest possess hypernym compar pair term hierarchi gener random process pair interest hypernym relationship suggest concept hierarchi produc possess gener term led specif dictat design principl order establish document hierarchi tool find relev sanderson assess hierarchi order find relev document easi user discov pathwai relev document develop algorithm estim relev document base number menu number document examin path length assign relev document miss relev document assign path length minu path length relev document hierarchi sum sanderson compar averag path length concept hierarchi gener random subsumpt process found path length randomli gener hierarchi longer path length concept hierarchi path length concept hierarchi found shorter path length rank list retriev document result suggest concept hierarchi tool find relev document retriev queri beaulieu sanderson suggest concept hierarchi produc set relev document retriev queri tool interact queri concept hierarchi user overview document retriev concept topic document beaulieu sanderson argu concept term extract retriev document valuabl sourc queri term overview document collect user select good term studi investig valid assess retriev effect concept term effect present term retriev effect visual mention section visual retriev process import improv interact user system import interfac evalu detail studi aspect effect method term rare beaulieu sanderson user provid overview document retriev queri mean abstract document select term improv retriev perform retriev system discuss mcdonald al present potenti term set network system select repres index term document retriev queri calcul term creat network pathfind network algorithm pathfind network consist index link repres associ term base frequenc user expand queri interact graphic network found user present network displai sourc queri time identifi topic aspect success retriev effect searcher control term present method hearst present method displai larg interact categori hierarchi describ interact user interfac aim integr categori hierarchi retriev result document assign multipl categori graphic hierarchi separ interact categori document observ categori explor retriev result displai page displai categori individu retriev document abstract cone displai portion hierarchi categori label explor click expand portion hierarchi displai order expand user specif categori label hierarchi displai execut search previou search save bookshelf referr queri facil beaulieu sanderson argu present queri term hierarch structur benefici retriev issu address develop concept hierarchi present structur user method includ hierarch bullet point seri web page decid present concept hierarchi hierarch menu structur singl web page reach thought probabl larg hierarch menu structur fit singl user familiar compon menu structur easili path term easili determin retrac main aim studi investig effect hierarch menu method term present order evalu hierarch retriev effect hierarch menu structur compar retriev effect flat list term methodolog methodolog theori survei interact retriev evalu perform order establish method evalu studi date recent framework identifi methodolog interact inform retriev repres process inform seek realist carri control environ set consist involv potenti user test applic dynam individu inform dynam relev judgement argu method combin main approach evalu inform retriev cognit approach research inform retriev fund work conduct develop evalu framework multimedia inform retriev applic interact retriev research advoc user view part inform retriev system system evalu approach interest identifi framework divid inform retriev system compon evalu compon draper identifi approach heavi approach inform retriev evalu acknowledg inform retriev evalu framework work advoc incorpor wider compon framework test collect framework state larg input develop interact trec introduct surfac interact test collect methodolog trec approach inform retriev research approach tradit test collect paradigm base evalu measur recal interact approach inform retriev pose problem tradit test collect approach includ retriev evalu introduc set variabl experi difficult control trec attempt overcom problem pose introduc user retriev evalu develop interact aim develop method evalu interact retriev control environ interact trec creat difficulti simul real inform retriev process interact trec methodolog continu evalu improv progress made incorpor framework test collect methodolog express interest lighter method interact inform retriev evalu harper harper set number rule thumb evalu compon interact inform retriev system defin compon focal concept comput techniqu interfac dialogu narrow definit previou approach advoc break larg hypothesi system discret focu small aspect system promot greater insight system argu evalu light approach suitabl design system tool test studi develop exist prototyp consid due constraint harper evalu light approach studi studi focu compon interest present term gener hierarch menu establish effect develop attempt develop trec test collect work trec topic combin trec approach evalu light studi test collect evalu small compon system decid questionnair interview assess user percept compon test result detail studi focal hierarch system quantit qualit approach method investig subject total subject particip experi major subject recruit depart inform studi sheffield remain subject authori member graduat sheffield subject reward particip experi subject particip trec experi experi tool demograph characterist subject previou experi inform retriev system detail section topic topic experi sixth text retriev confer interact track test collect concept hierarchi menu creat topic relev document retriev queri topic remov collect decid remov topic produc small concept hierarchi topic gener hierarchi level term remov result remov topic total topic remain experi decid topic train topic system prototyp system section adapt order conduct experi concept hierarchi menu gener document retriev topic titl initi titl topic descript decid shorten queri order make realist user tend enter short queri retriev system van topic subject shown topic descript narr addit origin queri ensur subject understood user requir reflect queri order enabl make good judgement relev suggest term decid provid subject topic descript narr word present term bia term select add queri thought focu experi method present displai descript narr hinder result long displai topic condit system interfac alter document displai consid displai document return expand queri influenc select term remov focu experi method term present displai document depend uncertain connect america fulli function number concept hierarchi menu show number document term occur probabl parent term subsum remov provid addit inform subject distract window creat term select expand queri displai subject term select version interfac displai term displai hierarch menu respect interfac ident log file creat record time topic select term topic time select exampl interfac found appendix design subject altern assign control group group present interfac concept hierarchi menu gener queri control group present interfac list term includ ident term concept hierarchi menu term list order alphabet consid arbitrari order present term subject shown queri relat topic descript narr queri alloc subject systemat distribut counteract order topic effect appendix list queri present subject imagin submit queri turn retriev system queri subject select term add origin queri order retriev greatest number document highli relev queri assess subject searcher skill experi familiar topic subject interview obtain percept system procedur subject complet questionnair assess searcher skill experi subject explan reason experi subject told tool attempt gener summari document retriev queri process queri term extract document retriev shown screen indic document collect experi hope show tool lead effect queri user idea content subject told role experi subject told imagin submit queri retriev system respond show set term ad queri select term add queri order retriev highest number relev document subject present train queri topic descript illustr procedur exclud subject demonstr system system select term train topic menu list subject carri queri search task subject complet questionnair establish familiar search perceiv difficulti execut search confid expand queri retriev relev document origin queri experi subject interview ascertain percept difficulti system dislik opinion document tool result subject characterist menu group consist femal male ag year ag rang year subject group student inform studi subject menu group averag year experi onlin search rang year list group consist femal male ag year ag rang year subject inform subject bachelor inform subject bachelor subject phd student area librari scienc subject obtain phd subject inform studi test reveal differ menu list group measur ag year experi onlin search squar test show differ number male femal group df independ sampl test reveal differ group ag onlin search experi state result decim place deviat freedom test normal conduct execut parametr data found normal test carri previou search experi type search system assess experi great deal experi rate standard deviat menu list group shown tabl tabl rate standard deviat search experi menu list system menu list group gui catalogu commerci www sd sd test reveal group significantli differ previou search experi gui onlin librari catalogu commerci onlin system www search engin system frequenc subject conduct search assess point great deal subject menu group report conduct search averag rate subject list group averag rate great subject rate amount receiv conduct inform search menu group averag rate list group averag rate mann whitnei test show differ group rate conduct search extent enjoi carri inform search result show differ demograph characterist search experi menu list group find suggest differ found group measur retriev effect artefact group differ search skill experi demograph characterist differ retriev effect attribut condit system effect assess retriev effect retriev effect expand queri list menu group compar retriev effect origin queri measur recal differ amount time select queri term subject list menu group compar recal recal defin proport relev document retriev proport retriev document relev figur show averag point recal result queri queri expand list menu group figur curv queri queri expand list menu group recal list menu figur show queri retriev document higher level lower level recal higher level recal queri expand list menu retriev document higher level graph show queri expand menu perform slightli expand list tabl displai recal figur queri queri expand list menu standard deviat tabl recal figur queri queri expand list menu group recal list menu sd sd tabl measur recal list menu expand queri perform origin queri queri expand list group improv retriev queri expand menu group tabl show list menu group retriev document queri expand menu group perform averag queri expand list group queri retriev relev list expand queri retriev relev document menu expand queri retriev relev document whitnei test reveal differ recal queri menu expand queri queri list expand queri list expand queri menu expand queri result show expand queri averag improv recal retriev relev document compar origin queri differ perform statist result improv perform list group menu group test reveal differ averag queri menu expand queri queri list expand queri list expand queri menu expand queri result show measur menu list expand queri reduc retriev perform compar origin queri differ perform result show measur recal expand queri improv retriev perform compar origin queri queri expand list perform slightli expand menu result measur expand queri degrad perform origin menu perform list shown higher level recal menu list expand queri queri measur result statist task complet time amount time subject select term add origin queri assess list menu group time select term term chosen calcul queri time term select subject list group time subject menu group test reveal differ time select term list menu group differ significantli level subject menu group significantli faster select term subject list group term select number term ad origin queri list menu group calcul number term ad subject list group number term ad subject menu group proport term queri ad origin queri calcul proport term ad subject list group proport term ad subject menu group test reveal differ proport term ad origin queri list menu group statist level result show averag subject list group ad higher proport term origin queri subject menu group summari result show retriev effect group differ significantli retriev effect queri measur expand queri perform slightli measur recal queri result show queri expand list group improv retriev slightli queri expand menu group measur recal menu group perform slightli list group measur result result illustr subject menu group significantli faster select term subject list group list group ad significantli higher proport term origin queri menu group topic characterist subject familiar search topic assess familiar familiar rate menu list group test reveal differ group level familiar topic subject confid understand queri requir search assess confid confid rate menu list group test reveal differ group level confid understand search requir topic subject term add queri assess easi easi rate menu list group test reveal differ group select term topic subject confid term select find highest number relev document assess confid confid rate menu list group test reveal differ group confid choic term find highest number relev document topic result show list menu group differ experi topic differ retriev perform attribut condit correl rank data conduct rate topic characterist question recal retriev effect expand queri tabl show correl rate topic characterist question recal effect expand queri list menu group correl present tabl present correl rate topic characterist question effect expand queri correl tabl correl rate topic characterist recal recal list menu tabl correl rate topic characterist list menu level tabl show correl rate familiar confid understand requir term select confid relev document retriev recal list menu group tabl show correl rate topic characterist list group tabl show posit correl select term confid queri retriev high number relev document menu group correl menu group result show subject menu group thought term select confid select retriev document greater user percept system subject rate easi tool learn assess easi easi rate menu list group indic list group found tool easier learn menu group test reveal differ group rate easi tool learn subject rate easi tool assess easi easi rate menu list group indic list group found tool easier menu group whitnei test reveal differ group rate easi tool subject rate easi tool understand assess easi easi rate menu list group indic list group found tool easier understand menu group test reveal differ group rate easi tool understand result show averag list group found tool easier learn easier easier understand menu group result user percept compar difficulti user opinion user system interfac preliminari evalu document tool discuss section discuss result research aim experi establish present potenti term set hierarch menu assist user select term successfulli improv retriev effect interact queri achiev aim experi address effect interact tool improv retriev effect present term set hierarch user percept queri tool result studi discuss relat issu retriev perform result section reveal queri expand list menu group fail statist improv retriev effect queri measur recal result interact queri term gener subsumpt process improv retriev effect suggest subsumpt process ineffect tool import system compar control queri process system prototyp develop iter queri order evalu retriev effect system compar control system perform assess subsumpt process establish number investig trec test collect evalu system trec control system rel perform system assess belkin walker queri expand term suggest subsumpt process compar origin order prevent effect queri system perform compar control enabl system compar system discuss section shown interact queri inconsist improv retriev effect fail reach potenti choic term add queri interact imposs conclud subsumpt process ineffect queri interact choic term gener subsumpt process affect retriev perform process order determin interact choic term affect interact queri compar automat queri term gener subsumpt process establish subsumpt process effect aid queri queri expand list menu group fail significantli improv retriev perform origin expand queri slightli improv recal margin degrad typic effect queri suggest subsumpt process small posit effect retriev perform benefici inform user expand queri tend favour improv recal system prototyp develop result encourag suggest retriev perform enhanc improv prototyp beaulieu sanderson suggest improv concept identif compon subsumpt process emploi entiti locat common text form telephon concept suggest resolv find refer concept remov duplic concept hierarchi final experi consist iter search studi shown queri improv number iter van slight improv recal expand iter search significantli improv retriev effect prototyp system fulli develop establish retriev document queri incomplet multipl iter search imposs discuss show result encourag expand queri show slight recal queri suggest improv prototyp system benefici retriev perform term present result section show statist differ retriev effect queri expand menu list group measur recal set expand queri significantli improv retriev effect origin queri result suggest studi method term present effect retriev perform hierarch menu method term present effect improv retriev flat list analysi section time complet task show subject menu group significantli faster select term subject list group menu group faster subject list group search list term term displai menu group hierarch menu lower level visibl parent term meant subject menu group control term examin view hierarch menu displai compact list fit screen list long subject scroll refer back queri descript inform ad task complet time result support mcdonald al found subject network displai show term relationship faster complet recal task subject control system suggest term improv speed interact queri section show subject list group ad significantli higher proport term origin queri menu group list displai term subject list group forc examin menu group hierarch menu ad smaller proport term queri contribut speed menu group complet ad significantli fewer term queri quicker task subject list group addit larger number term queri list group account differ list menu group differ menu group averag perform list group measur harman shown declin larger number suggest addit term list group contribut reduc compar menu group discuss shown statist differ retriev effect queri expand menu list menu group significantli faster select term select significantli smaller proport term list group suggest hierarch menu benefici inform retriev flat level retriev effect achiev shorter time fewer term user percept complet user interview ascertain percept establish difficulti system dislik thought tool provid adequ overview document retriev user percept system report discuss tool fifteen subject menu list group report function relev feedback facil retriev system subject facil report relev feedback tool found similar document select subject list compar tool fairli neg easier add term manual queri scroll list subject found term provid inform difficult dissemin comment term present subject list group flat list structur subject menu group posit subject comment complic choic term subject argu effort part activ term number subject comment difficult compar perform tool prototyp fulli function encourag major subject menu group higher opinion tool subject list group subject label menu list number order test difficulti subject report difficulti relat subsumpt process topic queri difficulti interfac report section difficulti report result subsumpt process comment subject menu list group number subject felt present proper potenti term unfamiliar reveal topic user problem overcom develop algorithm identifi proper remov hierarchi addit unfamiliar proper subject comment term technic hard understand find mean subject suggest solut problem link tool unfamiliar term explain subject state larg number seemingli irrelev term artefact incomplet state document retriev queri displai user document retriev displai term highlight document show context assist user appreci relev establish mean subject comment term lot term join made difficult ident term unclear long term term length limit implement term extract stage prevent overli long term present user larg number subject found simpli term present specif tool easier limit term present user fix number hierarch level shown order specif term subject state tool difficult difficult understand mechan work meant unsur term select subject express desir control system interfac made mechan clear suggest fulli develop benefit penetr feedback interfac belkin section repres search process user interfac subject difficulti tool result topic experi comment tool difficult unfamiliar subject area hinder subject suggest easier explor tool suggest queri problem overcom complet develop test tool real inform explain posit correl select term confid queri retriev high number relev document menu group subject confid knowledg topic select term expand queri difficulti result incomplet state document displai user effect term select document retriev subject express desir execut iter search impress system interfac subject list menu group gener made encourag remark system interfac appeal featur interfac subject remark subject facil displai select term enabl identifi term select subject menu group comment menu easi read easi easi navig sensit movement click enter hierarch level prototyp state tool account problem subject encount interfac number subject remov term term list ad subject complain term ad term list displai scroll list problem easili solv implement tool subject list group dislik scroll long list term necess scroll refer back descript inform subject found add term list subject menu group found level hierarchi search term hierarchi disappear screen result number term present user solv fewer term select hierarch menu subject suggest addit term term select displai colour unselect term duplic term hierarchi identifi subject complain hierarchi sensit disappear easili subject comment break hierarchi leav term minor problem easili solv fulli implement tool major complaint subject menu group concern menu level start fold back deeper level problem resolv displai fewer term user remov specif term hierarchi document order gain indic abil provid overview document retriev subject list menu group explor felt idea content retriev document subject list group claim list gave idea content subject comment term varieti articl subject menu group state menu gave idea content document retriev subject argu hierarchi gave idea type document collect find decent answer queri fact subject menu group felt tool gave idea content document retriev subject list group support hypothesi adequ document retriev queri subsumpt process effect summari user percept tool encourag subject menu group posit tool queri list group due fact subject menu group felt tool provid overview document retriev queri subject list group subject number difficulti opinion express develop tool subject difficulti natur term inappropri length unnecessari express desir understand underli retriev mechan subject appreci simplic interfac abil view term ad queri major problem level improv review select term present user relat previou work search assist develop tool similar attempt aid inform retriev provid user terminolog feedback aid queri search assist measur lexic identifi retriev document set gener hierarchi relat lexic compound hierarchi present user explor aid queri refin lexic hypothesi state lexic number compound word document identifi main concept theme document set word high number word word defin concept document set test hypothesi number complet document collect set document retriev queri found word highest lexic repres kei theme respect document collect compound word tend reflect relat concept kei theme identifi refer facet deriv set document retriev queri assist user reason domain assess content retriev document refin search pa implement top altavista search engin user submit search document retriev displai fifteen highli rank facet user facet click reveal word compound facet term retriev document set time user select facet queri execut result list show document relev facet facet recalcul reflect origin queri addit user execut search select facet set facet displai relat result list user expand queri ad facet origin combin queri execut refin search preliminari result show user pa view valu insid select box session select valu execut search session option replac origin queri select expand origin queri ad facet rare result obtain make system user log result search subject receiv train explan system work croft compar hierarchi gener pa studi effect cluster hierarchi hierarchi compar abil assist user find relev document total path length requir find relev document queri calcul hierarchi algorithm assess number menu number document consult croft found averag significantli shorter path relev path relev document found cluster term extract pa process hierarchi creat result significantli shorter path length hierarchi gener extract term result show compar hierarch menu gener user find relev document quickli subject menu group faster select term list group shorter path length relev document prove valuabl tool effici inform retriev croft shown cluster term creat hierarchi benefici retriev perform suggest improv includ aspect examin method term relationship recognit addit subsumpt develop enhanc interfac pa increment queri focu search user make judgement relev term affect search execut expand queri pathfind network pathfind network extract semant inform text plate consist node join link show strength relationship node method pathfind network extract inform text base frequenc term occurr frequent term occur stronger relationship term data piec text function pathfind network scale algorithm appli data strongest relationship includ pathfind network data shown provid inform mean word pathfind network inform retriev explor wilson fowler pathfind network mean visual repres term search includ interact queri common network structur illustr document content term relationship queri achiev select term displai difficulti navig system orient overcom view overview diagram system common visual associ thesauru document content overview diagram show complet network thesauru user system user idea frequent term user enter pathfind network produc visual relev document term repres node frequent term length link dictat size relationship term user expand queri drag term network queri window network produc associ show associ term document retriev network view techniqu displai object close current focu detail farther overview thesauru consist term occur aid navig indic user network inform user explor associ thesauru defin queri expand drag term associ network queri window common visual stage search process pathfind network incorpor fulli develop visual similar hierarchi present assist initi queri formul displai thesauri method displai hierarchi user explor incorpor techniqu current focu shown detail rest avoid problem unnecessari specif summari discuss illustr subsumpt process fail improv retriev perform queri inform retriev interact tool expand queri perform inher difficulti interact queri prototyp state tool made evalu effect difficult differ retriev effect queri expand list menu subject menu group significantli faster select term subject list group subject menu group ad significantli smaller proport term queri menu group significantli faster select term select fewer term significantli reduc recal suggest improv prototyp system yield improv perform user posit user interfac problem encount due develop state tool specif complaint concern natur meaningless seemingli irrelev long term specif term present opinion hierarch menu displai favour result experi relat previou includ method term creat hierarchi displai network provid overview document collect suggest made incorpor success compon system develop recommend limit studi number wai studi improv problem identifi concern choic design system choic subject limit studi concern choic subject particip experi major subject student depart inform studi sheffield graduat subsequ pool subject fairli homogen group differ previou search experi educ level suggest subject characterist affect result result popul novic ag subject educ level achiev result experi design number limit design concern queri alloc subject group methodolog subject complain topic queri remark unfamiliar technic subject suggest easier add term queri expand queri problem artefact trec test collect evalu system order overcom system fulli function implement real inform retriev environ alloc subject singl group made imposs obtain rel user percept method term benefit studi prefer subject execut search task method term present order present method half subject menu expand queri list half subject list menu counteract order effect subject experi method term present subject comment task repetit lose concentr end experi order reduc effect diminish concentr search larger number subject test fewer queri execut methodolog approach adopt studi addit test collect limit evalu tool dictat topic lack document return queri detriment effect result decid present subject return document partli reli uncertain connect studi adopt evalu light approach inform retriev concentr aspect method term present number subject comment absenc result search made difficult assess relev term effect term document retriev suggest studi specif aspect system ensur aspect studi larg obtain fair evalu system problem evalu light test collect approach inform retriev overcom adopt method interact inform retriev evalu method adopt heavi approach interact inform retriev advantag interact compon term present method relev judgement retriev evalu final concern design time dissert plan execut project insuffici time alloc program longer expect meant time subject test system limit system due system time experi inabl system return document queri degrad choic make relev judgement term observ context term led complaint irrelev unfamiliar method establish mean term fact iter search execut detriment experi subject undertak full search fulli explor function hierarchi futur work system develop benefici complet develop order fulli evalu interact queri tool issu address includ effect subsumpt process extract term term subject identifi inappropri proper domain specif irrelev term long term benefici prevent extract proper limit length term limit number term extract attempt specif term irrelev term limit number term extract document benefit system reduc number level hierarchi make present easier link term thesauru assist user defin unfamiliar term likelihood effect inform retriev relev judgement term improv includ explor method term relationship emploi pa cluster term extract relev document creation hierarchi interfac develop main develop system interfac make inform retriev mechan clear user ensur function system repres interfac shown interact queri interfac repres function system effect interact interfac limit system function subject express desir control system interfac benefici system evid subject find difficult judg relev term uncertain term chosen care visual repres process cognit load user subject simplic interfac effort made interfac displai term chosen add queri method present explor subject suggest term ad queri displai colour actual hierarchi method present hierarch structur extract subsumpt process incorpor featur pathfind network hierarch menu appreci sensit movement usabl complet interfac refer navig displai window aim rel perform assess compar retriev perform control system comparison retriev effect system comparison interact queri hierarch menu automat queri term extract subsumpt process conduct order establish effect subsumpt techniqu develop made research aim studi establish present potenti term set hierarch menu assist user select term successfulli improv retriev effect interact queri subject particip expand number queri hierarch list displai term extract subsumpt process retriev document shown differ retriev perform queri expand subject menu group list group origin queri suggest interact term extract subsumpt process enhanc retriev effect method term present affect retriev perform find suggest interact queri achiev potenti find expand queri slightli recal queri suggest subsumpt process small posit effect retriev perform subject menu group found faster select term select fewer term subject list group degrad retriev effect suggest hierarch displai term benefit inform retriev provid effici method queri posit comment particip experi appreci hierarch menu displai suggest develop benefit inform retriev refer pg search terminolog feedback iter inform annual intern acm sigir confer research develop inform retriev august acm interfac support queri journal okapi sheffield em dk eighth text retriev confer novemb nist mm mj okapi em dk sixth text retriev confer novemb nist em dk text retriev confer novemb nist interact queri support tool perez sy interact track em seventh text retriev confer novemb nist perez interact track em dk sixth text retriev confer novemb nist rc mh text retriev dynam hypertext em seventh text retriev confer novemb nist compon evalu interact inform retriev journal develop method evalu interact inform retriev journal cj approach thesauru eleventh intern confer research develop inform retriev june acm jo jw approach larg document fifteenth annual intern acm sigir confer research develop inform retriev june acm de classif retriev em seventh text retriev confer novemb nist te search onlin inform technolog sw md ir impact interact multimedia inform retriev review hypermedia md interact evalu inform invit paper journal american societi inform accept en annual review inform scienc document cluster ward acm confer research develop inform retriev septemb acm chang face librari qualit analysi inform seek behaviour user percept retriev process highli interact inform retriev sheffield rh dw retriev pathfind rw pathfind associ studi knowledg ablex ba wal inform system associ network displai technic report depart comput pan american tx evalu interact queri onlin librari catalogu graphic user journal interact queri eleventh intern confer research develop inform retriev june acm feedback fifteenth annual intern acm sigir confer research develop inform retriev june acm workshop novemb glasgow comput scienc research report ma interact interfac search view retriev result larg categori annual intern acm sigir confer research develop inform retriev juli acm ma jo cluster retriev annual intern acm sigir confer research develop inform retriev august acm interact inform retriev relev confer human factor comput system april acm nj case studi interact inform retriev behaviour confer human factor comput system april acm wb compar topic riao april cj potenti actual effect interact queri annual intern acm sigir confer research develop inform retriev juli acm inform retriev term relationship em dk sixth text retriev confer novemb nist ta rw pathfind extract semant inform rw pathfind associ studi knowledg ablex work place evalu complex advanc appli ergonom intern confer appli ergonom usa publish corpor mf feedback public access catalogu research scott polar research mm automat ad vlc interact em seventh text retriev confer novemb nist dk fourth text retriev confer novemb nist million document match confer human factor comput system lo april acm wb concept hierarchi annual intern acm sigir confer research develop inform retriev august acm test appli concept wb advanc inform recent research kluwer academ publish rw pathfind associ studi knowledg organ ablex em dk sixth text retriev confer em dk sixth text retriev confer novemb nist em dk sixth text retriev confer novemb nist wb local global document annual intern acm sigir confer research develop inform retriev august acm sj teach packag method inform retriev part iii cluster queri appendix figur sampl interfac show hierarch menu displai figur sampl interfac show list displai appendix tabl queri present individu subject menu list group subject queri appendix questionnair subject qualif expect year experi onlin experi circl great deal graphic user interfac search librari catalogu local search system search commerci onlin system search www search servic search system conduct search kind extent enjoi carri inform particip trec appendix questionnair subject familiar confid understood queri requir search find easi term add confid term select find highest number relev circl fairli extrem comment task appendix interview schedul subject easi learn easi tool understand fairli extrem relev feedback queri function retriev tool compar tool difficulti subject explor feel idea content comment tool
IR/1596 5 compar top list ronald fagin ravi kumar ibm almaden research center harri road san ca abstract motiv introduc distanc measur distanc measur distanc show metric seemingli unrel satisfi relax version polygon metric posit constant multipl bound measur show notion metric formal ident base defin distanc measur bound constant multipl identifi larg robust class distanc measur applic task identifi good notion top result impli approxim algorithm rank aggreg problem respect larg class distanc measur siam discret mathemat extend abstract symposium discret algorithm introduct notion ubiquit field inform retriev top typic result search engin standard wai measur system recal valu method compar top list recal base method yield compar top list compar limit method typic give absolut rate top give binari measur distanc inform retriev context clear notion ground truth recal harder observ lead question discret defin reason distanc measur top motiv studi problem sketch applic applic group applic describ comparison search variat search engin natur compar search engin compar visibl output top import compar variat slightli rank search aid design rank function methodolog test effect top list rank heurist search engin similar issu includ understand effect augment data add index data type pdf complex applic search engin rank function composit algorithm build simpler rank question interest compon final rank similar top composit output top similar compon good quantit measur methodolog valuabl tool decid compon delet design rank algorithm methodolog compar engin compon search order understand metasearch engin align compon section report result comparison popular web search engin compar metasearch engin compon group applic classifi fairli simpl system draw search result sake popular heurist send queri return server respond import ensur qualiti result affect approxim quantit measur estim differ top list approxim subtl categori methodolog successfulli carmel al explor effect prune index inform search engin verifi distanc prune techniqu small effect top moder valu user essenti top conclud prune index result space time effect search result scenario similar vein area approxim common techniqu categor problem import goal understand differ approxim exact matter top problem natur applic compar top list process data log discov emerg trend search engin comput top queri dai differ dai month exampl includ process inventori log sale log retail log stock trade spike differ top list trigger closer analysi action add good notion differ top list context good composit rank function simpler rank aggreg problem top goal find top list consolid list problem formul aggreg minimum total distanc respect distanc comput distanc measur interest choic distanc measur turn direct bear complex comput distanc measur lead optim admit solut main algorithm consequ work enabl design effici approxim algorithm aggreg problem respect larg class distanc measur achiev identifi class distanc measur constant factor result approach problem defin distanc measur top list angl make distanc base motiv intuit base rigor mathemat plethora measur good wide pose challeng question understand rel make sound choic compet main contribut unifi framework catalog organ distanc measur notion class distanc measur place distanc measur larg class dub big class encompass measur intuit appeal mathemat properti deriv rigor mathemat lack intuit justif user main messag class concept constant factor depend distanc measur class essenti class properti distanc measur class metric usual mathemat class make forego idea present distinct seemingli unrel definit relax version natur extens standard triangl exist metric posit constant multipl bound measur prove result notion metric result task distanc measur ir applic simplifi consciou choic user make class distanc measur person favorit big class rich varieti underli intuit mathemat clean algorithm simpl method includ obtain approxim algorithm rank aggreg problem respect distanc measur big class achiev fact rank aggreg problem optim solv polynomi time minimum cost perfect distanc measur class section present illustr applic method context search metasearch base result user studi similar top list popular web search similar top list metasearch engin built search engin quantit comparison search engin top result bring qualit fact light experi reveal aol search msn search yield similar fact competitor analysi reveal crawl data search engin search engin part inktomi fact top result hotbot moder similar aol msn suggest crawl data hotbot rank function aol msn studi make excel case applic quantit method compar top list methodolog special case top list permut object fix standard method compar kendal tau spearman textbook simpli appli deal compar permut element class distanc measur top list obtain natur modif standard notion distanc permut sophist attempt defin metric comput intersect top list approach fact paper inform retriev order obtain notion symmetr differ minu appropri scale adequ top distanc top list declar natur extens idea lead robust metric top list idea truncat top list point comput symmetr differ metric result top suitabl combin type notion distanc top list distanc measur base intersect metric distanc measur gener metric turn distanc measur show seemingli satisfi properti metric metric posit constant domain metric metric constant multipl relax polygon constant remark show fact seemingli unrel notion note relax polygon inequ immedi impli relax triangl inequ constant domain relax triangl polygon inequ suggest notion measur interestingli notion requir relax polygon simpli relax triangl relax triangl inequ suffici impli metric properti organ section review metric form basi distanc measur defin studi section develop distanc measur top list section present notion show metric relax polygon inequ section defin notion distanc show distanc measur larg robust call distanc measur top list introduc section metric metric section give algorithm applic exploit distanc measur class metric permut studi metric permut classic book kendal gibbon detail account method formal treatment metric permut review notion metric permut permut oe biject set oe call set size jdj sd denot set permut permut interpret posit element ahead oe pd jg dg set unord pair distinct element oe oe member sd kendal tau metric permut defin pair jg distinct member order oe oe oe opposit order ahead oe ahead oe oe kendal tau oe oe maximum oe occur oe oe oe oe kendal tau turn equal number exchang bubbl sort convert permut spearman metric distanc permut defin oe joe oe maximum oe case oe odd kendal maximum occur oe oe discuss variat spearman call measur compar top list discuss modif metric case top member order top list map domain member top top list similar convent interpret rank ahead top list oe oe extens denot oe assum top list give measur distanc begin recal definit formal defin distanc measur binari function call symmetr domain call regular defin distanc measur regular binari function metric distanc measur satisfi triangl inequ domain measur close top list consid distanc measur global notat set global notat paper top list write note jsj jt jdj kendal tau natur wai gener kendal tau measur distanc top list begin gener definit set top list defin pd set pair distinct element top list minim kendal distanc min defin minimum oe oe oe permut oe oe top list averag kendal distanc avg defin expect oe oe oe permut oe oe expect extens equal approach show minim kendal distanc averag kendal distanc special case fix paramet similarli definit oe permut oe oe defin penalti top list jg case case top list order ahead top correspond jg opposit order ahead ahead penalti case top list top list ahead penalti ahead case top list top list penalti ahead ahead concern case top list top list interest case case option penalti call pair jg special pair penalti base defin kendal distanc penalti paramet correspond intuit assign nonzero penalti score pair jg inform opposit order top list correspond intuit inform penalti score assign neutral nonzero penalti score show optimist approach min neutral approach avg lemma find lemma pz proof analyz case definit obtain formula term global notat case situat pair contribut pair case situat pair denot element element case element fix zg element rank top list contribut element ahead denot net contribut obtain express total number element ahead belong rest belong sum contribut case contribut sum term case contribut case situat pair total contribut case jsj jt case situat pair total contribut case jsj jt ad equat obtain pz finit set object case object metric distanc object interest case kendal distanc hausdorff distanc max ae max oe min oe oe max oe min oe oe oe hausdorff distanc metric fairli explain quantiti min oe oe distanc oe set quantiti max oe min oe oe maxim distanc member set quantiti max oe min oe oe maxim distanc member set hausdorff distanc maxim distanc member set hausdorff distanc member distanc member set hausdorff distanc metric hausdorff distanc defin distanc measur top list metric distanc defin distanc top list max ae max oe min oe oe max oe min oe oe oe assum fix domain oe oe rang permut domain distanc measur special case hausdorff metric interest version hausdorff distanc paper assum fix domain defin hausdorff version kendal distanc top equat oe kendal distanc oe unlik oe oe permut obtain close form version equat oe kendal distanc oe size underli domain oe oe show equat replac obtain close form lemma show min avg show result hausdorff distanc equal proposit min proof top list show min defin oe extens element element order element order top element top element order element oe similarli defin extens oe role show min oe show oe suffici show oe arbitrari extens oe arbitrari extens jg arbitrari member oe oe jg special pair jg fall case definit equal order oe oe oe oe forc jg special oe hold shown min oe show oe show show oe pair jg automat jg special pair jg special oe conclud proof proposit avg proof top list avg oe oe oe show oe prove avg result substitut oe similarli jg special oe hold jg special show avg show jg special oe assum loss gener order oe forc correspond permut oe extend extend correspond determin simpli switch choic oe half choic oe oe oe oe desir show set formula lemma obtain side equat lemma give direct requir lemma requir formula equat top list max ae max oe min oe oe max oe min oe oe oe oe permut oe oe oe member order easi max oe min oe oe min oe oe fact min oe oe oe permut oe oe oe member order easi min oe oe oe oe show oe definit contribut pair jg compar contribut oe case definit easi jg contribut oe case jg special top list top list contribut contribut oe contribut contribut oe pair jg type type total contribut pair jg case oe prove spearman gener spearman method determin distanc top kendal tau top list minim distanc min defin minimum oe oe oe permut oe oe top list averag distanc avg defin expect oe oe oe permut oe oe expect extens equal real number greater distanc locat paramet denot place miss element list posit comput usual distanc top list defin function domain similarli defin defin set natur choic make choic experi denot simpli lemma find lemma proof similarli definit defin hausdorff version distanc top equat oe distanc oe oe oe permut kendal consid version equat oe distanc oe fix domain size obtain close replac obtain close form lemma equal obtain formal substitut formula lemma version depend min avg formula min avg note averag number size correspond intuit miss element averag result formula avg unlik situat min avg proposit min avg hausdorff distanc share common proposit min avg proof show min avg top list oe oe oe oe permut oe oe extend oe oe extend show oe oe show oe oe oe held symmetri oe held oe oe oe oe oe desir oe joe oe show joe oe joe oe joe oe joe oe joe oe similarli joe oe joe oe joe oe oe oe joe oe joe oe prove complet suffici prove joe oe joe oe oe oe oe oe similarli oe oe suffici prove oe oe oe oe prove oe oe side side equal jdj equal complet proof min avg shown minim min oe oe oe permut oe oe equal averag avg minim equal averag clear valu oe necessarili easili equal common min avg metric properti introduc distinct measur close top min avg special case choic min equal avg natur main subject metric preview main begin observ distanc measur defin min min avg avg metric proposit distanc measur metric choic locat paramet proof show triangl inequ hold top list jd defin vector defin vector vector easi distanc similarli triangl inequ immedi triangl inequ norm vector euclidean space distinct distanc min show top list top item order top list top item order top list top item order straightforward verifi triangl inequ matter choic penalti paramet proposit min avg metric counterexampl show min metric easi verifi min min min triangl inequ min min min fact min avg metric show special case metric contrast situat kendal min avg special case note version defin domain fix class motiv fact distanc measur metric strang measur notion min obtain result notion notion metric base triangl inequ polygon metric satisfi definit binari function satisfi inequ domain binari function satisfi inequ domain notion rare studi paper pattern match context travel salesperson problem inequ studi definit metric distanc measur satisfi inequ metric distanc measur satisfi inequ metric metric theorem relax metric metric constant focu stronger notion metric notion metric discuss base bound distanc measur posit constant multipl metric definit distanc measur distanc measur metric posit constant note loss replac metric metric bound theorem unexpect result notion metric theorem result distanc measur metric iff proof assum metric defin min min show metric polygon inequ constant symmetri immedi symmetri satisfi triangl min min min min min min metric show equat easili equat polygon inequ constant cd assum cd show satisfi inequ cd metric symmetr metric inspir theorem defin mean distanc measur robust notion distanc measur definit distanc measur top list metric constant independ distanc measur metric definit distanc distanc measur top list posit constant pair top list easi definit relat theorem distanc measur metric metric notion inspir classic result graham state permut oe oe oe oe oe deal distanc top graham dealt distanc show notion metric compar notion metric classic topolog notion gener topolog theorem metric relax metric metric constant proof clear metric metric show fail defin space clear symmetr function iff show ff fi fl ff fi function jx yj metric squar ff fi fl fact geometr bound make constant independ distanc measur make assumpt independ simpli distanc measur finit constant constant assum independ arithmet obtain ff metric arbitrari posit defin converg constant satisfi polygon inequ metric metric constant theorem metric topolog fail restrict attent distanc measur proof topolog space induc binari function topolog space open set union set form fy topolog space metric induc topolog topolog metric binari function topolog induc theorem smirnov pp topolog space regular basi countabl collect famili proof direct modifi obviou manner show topolog space induc relax metric regular basi countabl collect famili topolog space induc metric metric topolog metric show fail restrict attent distanc measur nonneg function symmetr satisfi iff defin space jy xj hard verifi induc topolog usual metric jx yj intuit fy minor distort fy dm dm jx yj depend function dm local induc topolog usual metric jx yj condit hold ball fy jx yj ball jx yj ffl topolog metric show metric show constant impli relax metric substitut obtain easi hold suffici larg metric metric metric topolog implic hold relationship measur main result show distanc measur discuss bound constant multipl connect prove proof method direct count argument relat min relat measur relat measur subtl connect min min link measur base kendal tau measur base spearman prove appli graham inequ permut oe oe theorem result distanc measur min avg choic min avg choic class fact metric impli distanc measur metric corollari min min avg avg metric discuss proof theorem shortli refer class distanc measur big class big class robust consist distanc metric find conveni deal normal version distanc divid distanc measur maximum normal version distanc measur li interv normal version metric origin version metric origin version metric easi distanc measur normal version theorem proven make theorem proposit bound theorem tight improv complic goal simpli prove obtain theorem obtain tight compar pair distanc measur versu arbitrari theorem top list min min min min proof inequ part oe oe permut oe oe min oe min oe oe min inequ fact min minimum extens oe oe inequ part oe oe permut oe oe min oe min oe oe min inequ fact min minimum extens oe oe oe oe permut oe oe min oe vector recal distanc vector jv joe oe jv joe joe oe oe oe case similar jv joe oe definit oe min prove inequ prove inequ min joe oe joe oe joe oe metric kendal tau spearman standard normal lie interv situat permut situat permut equal note jr joe oe joe oe oe oe oe list valu oe sum yield joe oe oe equat joe oe equat min formula lemma inequ equat prove inequ inequ hold assum divid side equat obtain inequ follow equat show deriv formula proof lemma contribut case contribut case desir formula lemma inequ equat prove inequ inequ hold assum divid side equat obtain inequ follow equat show equat observ jsj jt element contribut posit algorithm applic context algorithm notion metric applic rank list full list top rank aggreg problem respect distanc measur comput list full list union domain top minim problem context inform result search queri order respect obtain order top good aggreg rank order produc argu kendal tau variant good measur context full list top list experi ibm almaden section confirm produc order small kendal tau distanc yield qualit excel result comput optim aggreg full top list kendal measur notion class distanc measur handi proposit class distanc measur distanc measur rank aggreg problem respect exact approxim approxim algorithm rank aggreg problem respect proof denot aggreg respect factor aggreg respect denot posit constant oe full oe oe oe denot aggreg respect cc cc applic perfect rank aggreg problem solv optim polynomi time metric theorem impli polynomi time approxim algorithm rank aggreg problem respect kendal measur approach spearman spearman distanc permut oe joe oe shown metric maximum oe occur oe oe spearman popular metric permut analog defin notion ae min ae avg ae big reason case full permut element fix ae min ae avg ae equal ae maximum ae ae min ae avg ae class normal version distanc discuss theorem show normal version ae min ae avg ae normal version big class distanc denot normal version proposit distanc measur ae min ae avg ae belong big distanc measur normal proof full list show ae bound constant multipl present famili pair full oe oe ne assum larg defin permut oe element order defin permut oe element order unnorm version spearman spearman easili calcul oe oe maximum ae oe oe ae bound constant ae min ae avg ae belong normal version big class spearman defin expon squar root turn drop expon result distanc measur metric intersect metric natur approach defin distanc top list captur extent overlap defin robust version distanc measur denot restrict top list item ffi jd ffi ffi repres symmetr differ straightforward verifi ffi li maxim occur disjoint ffi defin instanti gener convex combin ffi yield metric top list show distanc measur ffi metric proposit ffi metric proof suffic show ffi metric show show set jb assum loss gener contribut establish inequ ffi bound ffi big class ffi show ffi normal version big class proposit ffi belong distanc measur normal proof top list top element order top list top element order normal calcul ffi ffi bound constant ffi belong normal version big class interpol criterion practic situat compar top nice distanc natur interpret extrem relationship top element exact opposit disjoint feel desir case valu case denot distanc measur top list analog normal footnot section obtain normal version map distanc valu interv iff iff achiev linear map form question close element exact opposit turn answer asymptot asymptot min min min ff ff prefer distanc measur min fi includ experi compar web search engin mention import applic compar top list provid object compar output search engin illustr method compar output popular web search altavista lyco alltheweb hotbot northernlight aol search msn search compar output manner shed light similar underli indic rank function search engin select min measur comparison search engin choic argu chosen measur big class made made real user metasearch engin develop ibm almaden research center web search engin obtain top list comput normal min distanc pair search engin output averag distanc queri result tabul tabl valu normal lie smaller valu repres closer match tabl symmetr main diagon altavista lyco alltheweb hotbot northernlight aol search msn search altavista lyco alltheweb hotbot northernlight aol search msn search tabl min distanc search engin interest deriv tabl substanti allianc search engin detail account aol search msn search yield similar reason behavior aol search msn search index similar set page fairli similar rank function substanti fact aol search search data msn search looksmart inktomi hotbot moder similar aol search msn search work slightli smaller search engin return duplic lyco alltheweb yield similar result reason lyco main result alltheweb altavista index rank search engin plausibl crawl index portion web rank function complet unrel rank function search engin fact min metric draw addit interest infer tabl observ work allianc partnership mention exploit transit obtain infer data servic looksmart closer result suggest similar support fact lyco hotbot main result power evalu metasearch engin recal metasearch engin combin rank search engin produc aggreg rank metasearch engin web list popular site metasearch engin popular abil mitig coverag resist spam mention method evalu behavior metasearch engin analysi provid evid metasearch highli search engin search engin metasearch engin develop metasearch engin markov chain approach aggreg rank underli theori method found version metasearch engin combin output search engin measur averag min distanc metasearch engin output output search engin set queri result tabul tabl tabl tabl note strong bia aol altavista lyco alltheweb hotbot northernlight aol search msn search tabl min distanc metasearch engin sourc search bia bia altavista northernlight kind inform extrem valuabl metasearch design scope number show output metasearch engin reason aggreg simpli copi exclud compon metasearch engin align search engin depend reinforc output search engin correl distanc measur experi aim studi distanc measur seek understand inform distanc measur reveal goal experi find empir support belief motiv work distanc measur class behav class aim captur aspect distanc list denot top list top element order distanc measur top list element randomli chosen top random variabl denot distanc measur experi random top list pick main question list extent predict address basic notion inform theori recal entropi random variabl log truncat digit logarithm base entropi quantiti real number pick digit worth uncertainti condit entropi random variabl respect random variabl condit entropi measur uncertainti assum random uncertainti left pair distanc measur measur present result tabl element choic enabl exhaust top list perform experi entri tabl denot closer inform reveal interest roughli correspond predict lead digit drawn tabl distanc measur reveal lot inform symmetr differ ffi reason ffi distinct valu sharp yield finer inform suggest measur prefer symmetr differ distanc measur ae reveal inform evid row ae column ae measur reveal inform ae weight symmetr differ metric ffi fairli unrel measur big class stronger correl class measur min strongli correl measur evid entri kendal measur min avg strongli correl suggest kendal measur form class sit insid big class acknowledg naor aggarw suggest chose condit entropi statist notion correl reason correl divid product standard measur linear relationship random variabl constant ff correl absolut uncertainti correl condit measur arbitrari function relationship random variabl fix function ffi ffi ae min min avg ffi ffi ae min min avg tabl condit entropi valu pair distanc measur entri tabl interpret averag uncertainti assum refer andrea perform approxim algorithm depend parametr triangl inequ siam journal discret chekuri perform tsp triangl inequ inform process static index prune inform retriev system acm sigir confer research develop inform page find frequent item data stream intern colloquium metric method analyz partial rank data number lectur note statist graham spearman measur journal royal statist seri group probabl statist number im lectur seri institut mathemat rank aggreg method web intern world wide web page topolog fagin relax triangl inequ pattern match intern journal comput kendal gibbon rank correl method edward lee combin multipl evid properti weight scheme acm sigir confer research develop inform page lee combin multipl evid relev feedback method system advanc page
AI/1597 2 comparison neural network rule extract techniqu diagnosi disord hayashi depart comput scienc japan rudi setiono school comput nation singapor lower kent ridg singapor katsumi yoshida depart prevent medicin st school medicin japan abstract neural network wide tool predict medicin expect applic neural network medic diagnosi recent develop neural network rule extract algorithm make process train network express classif rule rule human user classif process network involv complex nonlinear map input data paper report result neural network rule extract appli diagnosi disord data set consist measur collect patient hospit measur continu valu gener linear discrimin function data set continu measur discret domain expert appli discret data set gener symbol classif rule compar rule gener techniqu find rule gener origin continu valu data set slightli accur rule gener discret data set neural network rule introduct artifici neural network tool aid human make medic field report recent paper result neural network perform solv complex pattern classif problem due abil model nonlinear relationship neural network robust handl data miss valu due inher parallel data process recent develop algorithm extract rule train neural network expect lead wider neural network pattern classif extract rule add featur network classif process algorithm extract classif rule preserv high accuraci network extract unlik classif process train neural extract rule provid human user capabl explain pattern data set classifi rule verifi give insight data present result empir studi disord appli techniqu extract rule train neural network techniqu share common train prune fulli connect network singl hidden layer cluster hidden unit activ valu prune network gener rule explain network output term cluster activ valu gener rule explain cluster activ valu term origin attribut input data merg set rule gener step obtain set rule explain network output term origin attribut input data algorithm li preprocess input data assum data restrict symbol classif rule gener data discret attribut linear discrimin function gener data continu attribut discret attribut valu repres binari input thermomet code continu attribut normal rang interv appli data studi collect total patient admit hospit japan measur test obtain patient addit sex patient record discret data set gener divid measur interv subinterv level set manual consult domain expert avail set origin continu valu data set data perform compar studi rule extract algorithm result accuraci network train origin data set discret data set prune network train origin data set continu attribut valu fewer connect averag network train discret data set expect extract fewer rule paper organ section describ neural network architectur studi descript collect data result neural network train prune present section section present exampl rule extract compar accuraci rule previou studi emploi fuzzi neural expert system convent linear discrimin analysi section conclud paper neural network train prune figur section describ neural network topolog classif train prune network standard feedforward network singl hidden layer illustr fig input pattern network output unit ip hidden unit activ jp comput ip ij jp jp jk kp kp input unit pattern jk weight connect input unit hidden unit ij weight connect hidden unit output unit sigmoid function hyperbol tangent function number hidden unit input pattern belong class cc target output pattern output unit denot ip binari classif singl output unit binari encod classif problem output unit network pattern belong class cp ip train network minim augment error function ip log ip ip ip penalti term ij ij jk jk ij jk posit paramet error function shown improv converg network train standard error function penalti function ad encourag weight decai network connect nonzero weight incur cost minim augment error function expect connect classifi pattern small weight experi augment error function show produc network relev irrelev network connect distinguish magnitud weight find set network weight minim error function cast unconstrain nonlinear optim problem implement version method compar standard backpropag method shown converg faster iter posit definit matrix approxim hessian error function comput descent direct obtain multipli matrix neg gradient function line search suitabl step size comput ensur total error weight modifi comput descent direct algorithm total error iter properti algorithm standard backpropag algorithm possess network local minimum point error function redund network connect identifi remov connect small magnitud remov classif accuraci network criteria find connect develop present earlier paper neural network disord tabl record consist patient sex result biochem test disord measur obtain test gamma blood volum red blood cell total unit minimum maximum valu level discret measur summar tabl test result total patient collect patient clinic patholog physician hospit japan alcohol liver damag primari liver data set divid randomli train set test set train set consist record test set consist remain record set experi conduct origin data discret data rule extract network train data discret data experi experi origin data set thirti neural network train prune network patient sex addit input constant input implement hidden unit bia number output unit number hidden unit record patient lc assign target output experi discret data set thirti neural network train prune measur divid input unit measur thermomet code level fall subinterv code binari valu fall subinterv repres binari encod data total number input unit network number hidden unit number output unit target output encod experi input data set criteria measur correct network classif criteria previou studi criterion highest output network found output unit correspond posit binari encod target output correctli criterion relax criterion output unit highest highest output correspond posit target consid correctli result set experi summar tabl show averag accuraci rate prune network train data set averag accuraci test data set comput criteria give averag number connect left network prune number connect prune network import note expect extract simpler set classif rule network connect network connect tabl tabl observ averag accuraci prune network train continu data discret data number connect left prune fewer hidden unit connect prune network mean rule extract rule extract section illustr rule set extract techniqu extract rule rule extract figur prune network select rule extract relev input network classif accuraci rate predict accuraci rate record network record network output unit highest activ highest activ total combin occur train data set cluster hidden unit activ valu network gener rule distinguish outcom achiev term network hidden unit activ rule obtain depict step replac split condit tree condit involv relev input data leav node tree involv hidden unit connect input find condit satisfi patient male greater hidden unit connect input male patient greater conclud patient greater greater rule classifi disord primari alcohol liver damag replac split condit obtain set rule term origin input measur shown fig predict accuraci rule set prune network figur rule extract thirti prune network continu input connect left hidden unit hidden unit receiv input hidden unit receiv input fourth hidden unit connect input classif accuraci rate network criteria accuraci predict accuraci rate similar gener tree hidden unit activ valu correctli classifi pattern tree replac tree split condit condit involv origin input branch tree chosen illustr linear function hidden unit connect input weight equal hidden unit bia input normal figur denomin smallest largest valu found train data set similar find hidden unit connect obliqu hyperplan unlik hidden unit obtain hyperplan complet set rule obtain shown fig figur comparison method tabl data set diagnosi disord excel platform compar perform origin data set consist measur continu discret data set compar result method appli data set result linear discrimin analysi fuzzi neural network shown tabl result rule extract techniqu column show number correct classif total number pattern class worth note accuraci rate higher lda predict accuraci rate disord higher neural network achiev perform complex pattern classif problem method linear discrimin analysi tree method disadvantag neural network complex classif process easi explain rule user algorithm extract classif rule train neural network develop recent overcom disadvantag present result applic neural network rule extract techniqu diagnosi disord extract type rule work continu data extract linear discrimin work discret data gener symbol classif rule rule set find set consist rule set rule involv obliqu hard rule set rule involv function easier understand rule addit produc rule extract techniqu data attribut result network prune algorithm remov irrelev data attribut illustr prune network present measur collect found classif input present prune network predict accuraci time monei save collect measur futur patient exampl present paper show complex real world data set consist pattern enabl extract set rule preserv accuraci neural network enjoi high predict accuraci train network explain classif made refer survei critiqu techniqu extract rule train artifici neural knowledg base system ga carpent rule neural architectur symbol connect scienc cho ja multipl disord diagnosi adapt competit neural artifici intellig medicin neural network recogn pattern artifici intellig medicin je jr rb numer method unconstrain optim nonlinear equat db ec em vw evolv artifici neural network screen featur artifici intellig medicin lm neural network comput intellig neural expert system fuzzi teach input applic medic inform applic rg introduct theori neural fuzzi mlp base expert system medic fuzzi set system cd emploi neural artifici intellig medicin treatment miss data valu neural network base support system acut artifici intellig medicin jr quinlan program machin learn morgan extract rule prune neural network breast cancer artifici intellig medicin extract rule neural network prune neural comput symbol neural ieee comput neural network obliqu neurocomput neural network construct algorithm maxim likelihood connect scienc penalti function approach prune feedforward neural neural comput neural network statist model nostrand symbol interpret artifici neural ieee transact knowledg data engin gg towel jw extract refin rule neural machin learn rl learn algorithm connectionist appli gradient method nonlinear proc ieee int conf neural san van improv converg backpropag neural network list tabl caption tabl measur data set tabl averag accuraci rate complex neural network train prune disord figur standard deviat tabl comparison accuraci rate obtain method diagnosi disord list figur caption figur fulli connect feedforward neural network singl hidden layer figur prune neural network classif accuraci predict accuraci figur rule extract disord classif figur rule extract disord classif measur unit min max level unit unit fl pg accuraci train data train data test data test data network complex number hidden unit number connect network complex number hidden unit number connect linear da fuzzi neural network ph lc total hidden layer input layer output layer ij jk bia lc ph femal male endif
IR/1598 5 decad statist languag abstract statist languag model estim distribut natur languag phenomena speech recognit languag technolog model attempt made improv state art review point argu bayesian approach integr linguist theori data outlin statist languag model attempt captur regular natur languag improv perform natur languag applic statist languag model amount estim probabl distribut linguist document statist languag model crucial larg varieti languag technolog applic includ speech recognit machin document classif optic charact inform handwrit spell machin pure statist approach introduc research approach found benefici introduc element statist estim inform languag model approach recent theoret approach develop emploi statist estim techniqu languag train text categor natur larg vocabulari peopl natur statist techniqu estim larg number depend critic avail larg amount train data ronald rosenfeld school comput scienc carnegi mellon pa usa past twenti success larger amount text type onlin domain data qualiti languag model dramat improv begin asymptot onlin text continu accumul exponenti rate doubt growth rate qualiti statist languag model improv factor inform estim ibm show bigram model effect satur hundr million trigram model satur billion word domain data success techniqu knowledg languag popular languag model advantag fact model languag sequenc arbitrari deep intent thought reason situat knowledg impoverish data optim techniqu work knowledg base approach knowledg word propon statist approach languag fred languag back languag hand attempt made date incorpor linguist theori knowledg statist languag attempt success section introduc statist languag model discuss potenti improv area section overview major establish techniqu section list current research direct section suggest interact approach bayesian approach tion linguist knowledg point encod knowledg main challeng face field statist languag model definit statist languag model simpli probabl distribut sentenc ¤ instruct compar statist languag model comput linguist field fuzzi great deal overlap differ word sequenc surfac hidden structur word statist languag model estim pr ¢ comput linguist estim pr ¢ estim joint pr ¢ pr ¢ pr ¢ deriv feasibl statist languag model context plai role prior likelihood function automat speech acoust signal goal find sentenc ¤ spoken bayesian solut languag model plai role prior document document goal find class belong exampl document class languag model construct solut languag model ¢ plai role similar deriv role languag model bayesian classifi languag technolog list measur progress assess qualiti languag model likelihood data commonli averag log likelihood random sampl spoken linguist unit data languag model quantiti view empir estim cross entropi true data distribut regard model distribut actual perform languag model report term perplex perplex interpret averag branch factor languag model function languag model consid function measur good model lower consid function estim languag qualiti languag model measur effect specif applic effect error rate applic error rate typic poorli understood function languag model lower perplex result lower error plenti counterexampl literatur rough rule reduct perplex practic reduct translat improv applic perplex improv good baselin attempt made metric correl applic error rate easier optim error rate attempt met limit success perplex continu prefer metric practic languag model construct weak current model simplest languag model drastic effect applic observ remov languag model speech recognit current languag model techniqu optim evid brittl current languag model extrem sensit topic genr text train model casual phone million word transcript million word transcript tv radio broadcast effect strong trivial languag model train newswir text perplex doubl appli similar press newswir text time period independ order remain virtual exist languag model techniqu assum form independ portion document commonli assum probabl word sentenc depend ident word natur text prove assumpt patent independ assumpt statist model lead overli sharp distribut happen languag document posterior comput equat extrem reach virtual class virtual true averag classif error rate typic greater claud shannon pioneer techniqu elicit human knowledg languag human subject predict element text shannon techniqu bound entropi english formul setup deriv estim entropi english speech languag research group ibm perform potenti sourc languag model improv identifi observ analyz perform human subject predict correct text experi perform research perform experi aim establish potenti languag model improv specif linguist area common observ experi peopl improv perform languag model routin substanti appar reason common domain level survei major techniqu section briefli review major establish techniqu detail technic languag model date probabl sentenc product condit pr def pr word call histori def current speech recognit technolog virtual commerci speech recognit product form reduc estim problem model languag markov sourc order trade stabil estim appropri trigram common choic larg train corpora bigram smaller deriv trigram bigram probabl estim larg corpora observ trigram consecut word million worth newspap full trigram articl sourc observ vast major occur major rest similarli low count straightforward maximum likelihood estim gram probabl count smooth techniqu develop includ discount ml estim back lower order linearli interpol order approach includ lattic approach work compar perfect smooth techniqu condit good recent analysi found toolkit implement techniqu dissemin battl vocabulari cluster class word assign model structur pr pr pr pr pr pr pr pr pr ¢ pr ¢ pr ¢ qualiti result model depend cluster narrow domain good result achiev manual cluster semant categori constrain manual cluster linguist categori part improv model iter cluster inform theoret criteria appli larg corpora reduc perplex model interpol counterpart tree model tree algorithm appli languag model tree arbitrarili partit space histori arbitrari binari question histori intern node train data leaf struct probabl distribut pr reduc varianc leaf distribut interpol distribut found path root tree grown greedili inform question judg reduct prune cross valid appli cart technolog languag model word space histori larg word sequenc word space question larger question restrict individu word question strong bia restrict class question consid greedi search algorithm support optim question algorithm develop rapid optim binari partit vocabulari attempt lm histori window word restrict question individu complic question consist composit simpl question month result fell short reduct perplex baselin reduct interpol attempt stronger bia vocabulari cluster binari hierarchi word assign repres path lead root tree question restrict ident bit word histori reduc candid set hand question node result approach larg abandon tree repres ultim partit base model tree exist significantli outperform ngram find comput data reason linguist motiv model inspir intuit view model actual linguist content neglig directli deriv grammar commonli linguist context free grammar crude understood model natur languag cfg defin set symbol set product transit rule sentenc start initi repeat applic transit transform sequenc termin sequenc achiev specif cfg creat base annot corpora coverag data probabilist context free grammar put probabl distribut transit eman induc distribut set sentenc transit probabl estim annot corpora algorithm algorithm likelihood surfac model tend local local maxim likelihood point found algorithm fall short global maximum global ml estim gener believ context sensit transit probabl adequ account actual behavior languag effici train algorithm situat spite successfulli incorpor cfg knowledg sourc achiev reduct speech recognit error rate ati domain utter cfg produc sequenc grammat fragment construct trigram fragment type standard ngram link grammar lexic grammar word order set type link connect similarli type link word sentenc legal consist satisfi link sentenc planar graph link grammar express power arguabl conform human linguist intuit link grammar english construct manual good coverag probabilist form link grammar attempt link grammar relat depend discuss section exponenti model model discuss suffer data detail model necessarili result paramet estim data appar tree leav fewer fewer data point fragment avoid exponenti model ¢ normal ¢ featur arbitrari function pair train ml estim shown satisfi ¢ ¢ empir distribut train corpu ml estim shown coincid maximum entropi distribut highest entropi distribut satisfi equat uniqu solut found iter procedur gener suggest languag model success strength li incorpor arbitrari knowledg sourc avoid fragment convent long distanc word pair encod result perplex reduct speech recognit word error rate reduct trigram baselin model eleg weak train model altogeth model cpu explicit normal unnorm model attempt smooth analyz rel success model attent remain problem featur select featur includ model automat iter procedur select featur candid set interact procedur elicit candid set languag model remain subject intens adapt model treat languag homogen sourc fact natur languag highli vari genr style test data sourc languag model train adapt inform current document common effect techniqu exploit inform histori turn dynam interpol static weight optim data cach lm introduc report reduct report reduct recognit error rate introduc adapt scheme test data sourc train consist subset vari adapt proce cluster train corpu dimens topic identifi topic set topic test data locat subset train build specif model combin specif model model statist shrink specif model gener trade varianc linear word probabl level sentenc probabl level special case small amount data target domain larg amount domain relev step combin model domain outcom train data domain surprisingli benefit model domain million word wsj corpu million word bn corpu improv percentag point applic perform model train million word improv difficult nonetheless disappoint amount data involv estim million word data model million word data suggest adapt techniqu crude current direct section discuss current research direct subject show depend model depend grammar describ sentenc term asymmetr relationship word singl word sentenc depend call head parent singl except serv head entir sentenc probabilist dg algorithm learn corpora probabilist depend grammar suit style word predict base small number word main differ convent structur model word predict word immedi word serv predictor depend depend hidden variabl typic implement sentenc ¤ gener depend graph attend probabl comput gener probabl gram style final estim complet sentenc probabl approxim deriv sentenc ¤ approxim singl score model parser gener candid train paramet maximum entropi probabilist link grammar mention section fall roughli categori emploi parser probabilist algorithm encourag result recognit word error rate reduct notori difficult method combin hidden linguist structur yield linguist ground tractabl model reduct reason languag hard model statist extrem larg number dimens prime vocabulari languag vocabulari larg set unrel entri bank closer loan bank brazil result larg number paramet linguist intuit great deal structur relationship word feel dimens vocabulari lower phenomena underli space moder low topic adapt topic probabl word vocabulari chang document straightforward approach requir inordin number paramet underli topic space model fewer dimens motiv techniqu latent semant analysi simultan reduc vocabulari topic space occurr vocabulari word document tabul larg matrix reduc singular decomposit lower dimens smaller matrix captur salient correl specif combin word hand cluster document decomposit yield matric project combin space document project combin effect classifi combin fundament underli adapt type adapt combin perplex reduct trigram baselin report techniqu develop found reduc recognit error trigram baselin sentenc model languag model chain rule probabl sentenc product condit probabl type pr facilit estim rel count decomposit approxim exact equal languag model larg reduc model distribut singl word turn hindranc model linguist linguist phenomena imposs awkward condit framework includ featur person number semant length extern influenc sentenc previou factor predict small compound address sentenc exponenti compar condit exponenti model equat true elimin burden normal featur captur arbitrari properti entir sentenc train model requir sampl exponenti task mont carlo markov chain sampl method languag studi sampl effici crucial bottleneck model number featur amount rare featur accur model shown benefit common featur featur semant featur discuss interact methodolog featur induct methodolog lead formul train problem logist practic benefit ml train challeng frustrat aspect statist languag model contrast intuit speaker natur languag natur success model nativ feel strongli languag deep structur articul encod probabilist framework establish linguist theori surprisingli goal draw line properli languag goal problem cluster vocabulari word discuss section mention automat iter method tabl list word class deriv method placement word place word count corpu insuffici reliabl assign word benefit cluster reliabl tabl data driven word class commiss panel attornei surgeon action activ attach warfar center associ facet institut word assign benefit assign vocabulari cluster solut inject human knowledg languag process interact model optim human knowledg make plai complementari role intertwin iter process vocabulari cluster mean human put arbitr borderlin overrid human decid belong cluster occur time occur approach interact featur induct methodolog encod knowledg prior human knowledg wrong solut encod knowledg prior bayesian updat scheme phenomena suffici repres train corpu continu captur prior data overrid prior vocabulari cluster belief relationship vocabulari entri suitabl cluster paradigm chang optim posterior measur data exist separ phrase god encod linguist knowledg prior excit challeng attempt includ defin distanc metric word stochast version structur word ontolog wordnet syntact includ bayesian version manual creat lexic grammar bayesian framework interact process advantag superior theoret foundat comput advantag acknowledg grate john lafferti bob moor comment refer peter john stephen della vincent della frederick john robert paul statist approach machin translat comput june ralf brown robert appli statist english languag model symbol machin translat intern confer theoret methodolog issu machin translat page juli pont bruce croft languag model approach inform retriev intern confer research develop inform retriev page adam berger john lafferti inform retriev statist translat annual confer research develop inform retriev page fred jelinek languag model summer workshop john hopkin close remark jim frederick robert mercer perplex measur difficulti speech recognit task program meet acoust societi america acoust soc stanlei dougla ronald rosenfeld evalu metric languag model darpa broadcast transcript understand page ronald rosenfeld maximum entropi approach adapt statist languag model comput speech longer version publish statist languag maximum entropi phd comput scienc carnegi mellon tr april ce shannon mathemat theori commun bell system technic ce shannon predict entropi print english bell system technic januari tm cover rc king converg estim entropi english ieee transact inform linguist sophist improv languag annual meet frederick jelinek statist method speech recognit mit ij good popul frequenc speci estim popul paramet ian witten timothi bell estim probabl event adapt text compress ieee transact inform juli katz estim probabl data languag model compon speech recogn ieee transact speech signal march hermann ut reinhard structur probabilist depend stochast languag model comput speech reinhard hermann improv languag model ieee intern confer speech signal volum page frederick jelinek robert mercer interpol estim markov sourc paramet data workshop pattern recognit page tishbi power advanc neural inform process system page san guyon pereira design linguist variabl memori length markov model page reinhard statist languag model variabl context length volum page octob thoma philip woodland categori languag model comput speech siu mari variabl extens speech languag model ieee transact speech audio pierr ronald rosenfeld lattic base languag model technic report carnegi mellon depart comput septemb stanlei chen joshua goodman empir studi smooth techniqu languag model annual meet page santa june ronald rosenfeld cmu statist languag model toolkit arpa csr evalu spoken languag system technolog page januari philip clarkson ronald rosenfeld statist languag model toolkit european confer speech commun technolog andrea stolck sri languag model toolkit stanlei chen languag model tool guid decemb patti price evalu spoken languag ati domain darpa speech natur languag june wayn ward cmu air travel inform understand spontan speech darpa speech natur languag page june peter vincent della peter jennif robert mercer model natur languag comput decemb reinhard hermann improv cluster techniqu statist languag model european confer speech commun technolog leo jerom richard charl stone classif regress tree wadsworth advanc book peter peter de robert mercer statist languag model natur languag speech recognit ieee transact speech signal juli arthur david michael jeffrei powel iter approxim inform split construct tree ieee intern confer speech signal peter steven della vincent della robert philip resnik languag model tree research ibm yorktown build larg annot corpu penn comput jame baker trainabl grammar speech recognit spring confer acoust societi page june frederick john robert mercer basic method probabilist grammar de speech recognit recent volum comput system page springer moran combin linguist statist knowledg sourc process ati spoken languag system technolog page februari morgan kaufmann danni davi english link grammar technic report comput scienc carnegi mellon octob john danni davi grammat probabilist model link grammar aaai fall symposium probabilist approach natur octob jayn inform theori statist mechan physic jn gener iter scale model annal mathemat della della lafferti induc featur random field ieee transact pattern analysi machin april della della rl adapt languag model minimum discrimin estim speech natur languag darpa februari raymond ronald languag maximum entropi approach page april adam stephen della vincent della pietra maximum entropi approach natur languag process comput stanlei ronald rosenfeld topic adapt languag model unnorm exponenti model stan chen ronald rosenfeld survei smooth techniqu model ieee transact speech audio ronald larri zhu interact featur induct logist regress sentenc exponenti languag model ieee workshop automat speech recognit decemb doug adam john lafferti model lexic attract annual meet associ comput page john lafferti bernard cluster iter scale maximum entropi languag model hanson maximum entropi bayesian page kluwer academ jochen peter dietrich compact maximum entropi languag model ieee workshop automat speech recognit decemb jun wu maximum entropi languag model integr topic depend speech recognit ieee intern confer speech signal jun wu combin syntact depend languag model european confer speech commun technolog roland kuhn speech recognit frequenc recent modifi markov model natur languag intern confer comput page august kupiec probabilist model short long distanc word depend run text darpa workshop speech natur page februari roland kuhn de mori natur languag model speech reproduct ieee transact pattern analysi machin roland kuhn de mori correct natur languag model speech reproduct ieee transact pattern analysi machin june fred bernard strauss dynam languag model speech recognit darpa workshop speech natur page februari reinhard volker dynam adapt stochast languag model ieee confer speech signal page volum ii iyer mari model long distanc depend topic mixtur dynam cach model ieee transact speech audio process seymor ronald rosenfeld stori topic languag model adapt european confer speech commun technolog stanlei ronald rosenfeld nonlinear interpol topic model languag model adapt jj ec telephon speech corpu research develop ieee intern confer speech signal volum page march dougla paul janet baker design wall street csr corpu darpa speech natur languag page februari david broadcast speech languag model corpu darpa workshop spoken languag page ronald rajeev bill mark elizabeth jack vidal error analysi model domain intern confer speech languag carrol eugen charniak experi learn probabilist depend grammar corpora technic report tr comput scienc brown david frederick victor harri eric ronald andrea wu structur perform depend languag model european confer speech commun technolog page volum michael collin statist parser base bigram lexic depend annual meet associ comput page fred jelinek recognit perform structur languag model european confer speech commun technolog page volum jerom languag model framework larg vocabulari speech recognit ieee transact speech audio harshman index latent semant analysi soc inform jerom larg vocabulari speech recognit statist languag model ieee transact speech audio stanlei chen ronald rosenfeld effici sampl featur select sentenc maximum entropi languag model stanlei ronald rosenfeld linguist featur sentenc maximum entropi languag model european confer speech commun technolog stanlei chen unpublish work christian editor electron lexic speech commun mit
HCI/1599 4 accommod variabl posit track accuraci mobil augment realiti system abstract tobia höllerer steven feiner accuraci mobil system chang dynam function locat variabl specif tracker technolog problemat mobil augment realiti ideal requir extrem posit track achiev level accuraci ignor variabl posit accuraci augment realiti user make accuraci virtual object nomin regist real address describ earli stage mobil augment realiti system adapt user interfac automat accommod track accuraci system emploi technolog track result wide variat posit indoor ultrason tracker outdoor kinemat gp system area rang introduc approach combin orient tracker knowledg express spatial map access graph present preliminari result approach context navig guidanc system user orient unfamiliar environ system inferenc path plan guid user target introduct strongest advantag mobil wearabl comput system abil support offer servic inform relev current local comput system told current absolut refer coordin system rel landmark system augment realiti overlai spatial regist inform experi real offer potenti power user interfac comput regist visual audio virtual inform augment realiti system accur estim posit head orient compet track vari greatli physic spatial tempor accuraci affect properti environ appeal approach combin multipl track technolog creat hybrid depart comput scienc columbia west cs build ny ent technolog simultan depend current environ inform registr techniqu design accur track emploi tracker accuraci virtual inform posit result mislead user interfac address develop mobil augment realiti system adapt user interfac automat accommod track accuraci system emploi technolog track result wide variat posit accuraci technolog includ ultrason tracker cover portion indoor kinemat gp system cover outdoor area adequ visibl sky area rang track develop approach combin orient tracker knowledg express spatial map access graph adapt user interfac design serv navig user orient unfamiliar environ inferenc path plan compon knowledg guid user target remaind describ previou relat work section section present hybrid track concentr method improv accuraci dead reckon spatial map access graph section introduc adapt augment realiti user interfac navig guidanc accommod differ posit accuraci describ intellig navig aid develop system section section present plan futur work previou work approach posit track requir environ equip beacon visual fiduci tether posit orient track system attain high accuraci area magnet optic includ arrai optic beacon infrar beacon support track entir build lower accuraci mobil phone technolog provid posit track potenti unlimit area british mobil phone compani bt offer cell identif cell broadcast inform custom code area give access local servic achiev resolut area good emploi triangul measur inform radio signal transceiv base station outdoor global posit system receiv track posit satellit yield roughli accuraci differenti gp system broadcast correct inform stationari base station base compar comput posit posit carefulli survei refer substanti improv track accuraci mile refer achiev accuraci kinemat gp inform gp carrier phase base station rover reach accuraci gp line sight lose track easili tree tall build terrestri gp transmitt supplement satellit signal replac altogeth gp signal loss address reli local sensor method form class track techniqu posit updat report rel previou result error accumul time posit period synchron absolut valu reliabl sourc knowledg environ constraint navig serv import sourc inform correct inaccuraci track system choic studi found field mobil concept call model match posit sensor technolog commonli model match comput vision track make orient track accur augment realiti comput vision posit updat unconstrain environ challeng strateg place visual fiduci accur posit track demonstr larger fiduci wider area outdoor indoor track track approach compar featur record imageri catalogu gather featur make identifi discret enter room recent work attempt identifi continu path environ base omnidirect imageri captur head wide rang strength weak track technolog approach combin set complementari technolog creat hybrid tracker robust accur individu technolog reli hybrid track system develop commerci product research prototyp hybrid track technolog experi larg variat accuraci point time specif technolog phase research begun explor question user interfac account track error factor macintyr introduc notion filter augment comput registr error select set altern specif augment notion singl pose measur error extend distinguish posit error explor orient account vari track characterist updat rate likelihood colleagu describ adapt graphic gener system navig guidanc project share concentr user interfac augment initi implement small portabl devic stationari displai complementari track mode adapt mobil augment realiti user interfac describ paper intend assist user navig unfamiliar environ design backpack base intel pentium iii mx graphic connect campu backbon ieee wireless network user interfac present soni implement java system reli technolog track posit part research laboratori serv ceil indoor hallwai room ceil tracker outdoor orient track pro hybrid tracker track head bodi orient connect sensor unit walk switch magnet compon tracker avoid affect magnet field nearbi lab section reli pure inerti orient inform outdoor line sight gp system posit track surveyor differenti gp system indoor point research modul mark ii wireless ultrason beacon system detect beacon rang mark ii ceil tracker mark ii tracker connect stationari track server posit updat roam disk beacon relai wearabl comput distribut augment realiti infrastructur track accuraci updat rate vari wide posit track approach mark ii ceil tracker track posit resolut cm hz outdoor differenti gp system maximum track resolut cm updat rate hz gp accuraci degrad fewer satellit visibl lose commun gp base fall back regular gp accuraci augment realiti user interfac navig guidanc adapt level posit track accuraci track mode focu ceil tracker track mode wide area indoor track dead reckon user rang ceil system reli local sensor knowledg environ determin approxim posit unlik exist hybrid approach indoor posit track minim amount addit sensor inform collect process addit sensor orient tracker part mobil augment realiti compar digit compass inform head environ deal discuss decid reli inerti orient track correct result drift posit error approach mean knowledg form spatial map access graph environ dead reckon approach inform determin user orient inform accur pro orient tracker magnetomet hybrid approach accur prone magnet distort option pro track mode figur illustr problem indoor environ pose track plot correspond user walk outer hallwai floor research pro tracker hybrid mode plot reflect lot magnet distort present build loop path left edg plot dramat reflect locat magnet reson imag devic materi test floor indoor environ magnet distort proport decid magnet tracker inform complet reli inerti orient data figur show result user travel orient track pro tracker pure inerti mode plot show line linear path segment linear degrad orient inform due result effect form rectangl figur show result correct method inform indoor environ plot show similar path outer hallwai plot plot show path lab door hallwai east center corridor south head west north hallwai back north end center corridor perform build infrastructur spatial map access graph spatial map accur model build geometri access graph give coarser account main path user figur compar small portion environ spatial map access graph model trace scan build model program develop spatial map model wall obstacl door repres special line segment denot dash line connect door addit role track access graph main data structur path plan compon section step regist account head comput orient dead reckon algorithm check spatial map determin user cross boundari angl comput angl threshold conflict classifi artifact orient drift direct inform correct correspond head parallel obstacl boundari angl greater system search segment access graph close figur track plot indoor environ magnet orient inerti orient inerti orient knowledg figur small part build spatial access graph assum access assum posit separ check spatial map data closest match direct orient assum head inform system assum user locat begin segment step transport user door handl special case sensit door area assum larger wall continu door side trigger door event user attempt cross case door angl determin angl system behav door simpl wall segment passag occur angl greater system assum user enter door proce correspondingli angl system continu access graph search initi result approach plot figur correspond path user successfulli pass door lab door east end south door north end middl center deviat correct posit process collect quantit result adequaci approach adapt augment realiti user interfac figur show view displai user accur posit track ceil tracker system overlai featur surround case wirefram model consist wall static object interest rear project room neighborhood label realiz java polygon transpar textur repres label text label anchor world closer object bigger label color scheme highlight import object result navig section current room main roam mobil ceil outdoor gp depend system posit data accur orient track posit track leverag superior orient accuraci chosen situat overlaid materi roam context world miniatur model figur augment realiti user interfac accur track mode label featur wirefram lab regist physic environ environ wim stabl posit rel orient rel surround physic world hover front move walk turn time maintain orient surround environ model relat work navig darken colleagu explor wai present map inform user navig virtual environ conclud scheme map map prefer static map target search wim extens option work posit user constant consum displai requir attent track hand arm posit wim exce bound restrict field user review head bodi orient independ track wim incorpor model environ avatar posit orient environ context path displai user queri rout locat interest user move rang ceil posit track shift tracker notifi user replac regist world overlai wim properli regist wim interpol scale posit destin configur figur show user interfac transit align constant posit project wim rel displai similar differ posit orient bodi rel world reveal wim world align orient imag includ rout arrow point path locat user request nearest user suggest arrow show segment wim displai entir difficult figur problem imag figur augment realiti user interfac mode wim arrow wim user posit orient displai legibl view path shown figur direct show real world graphic intellig navig aid figur user menu request path nearest elev system respond queri solut repres figur brighter path liter nearest elev plot bright path nearest reason compon determin user explicitli interest interest mean present solut path begin track posit repres wim find vertex nearest access node underli access repres set path knowledg knowledg physic domain resourc resid persist load tabl structur implement rudimentari descript logic domain concept class resourc found floor build lab locat lowest concept includ thing subsumpt concept gener parent creat conceptu culmin entir set resourc model build tbox handl terminolog knowledg includ list subsum parent abox handl assert knowledg includ list individu concept specif path node locat avail world load time run infer gener concept membership metric hierarchi path node emploi graph search techniqu algorithm repres figur navig guidanc user queri solut path wim graph path data structur set node abox tabl independ individu resourc list set path node associ world posit separ tabl repres edg graph pair node descript logic constructor role load individu node edg role access undirect planar user system path individu shortest path calcul graph structur algorithm user nearest kind comparison made length shortest edg candid metric minim user search accept default number nearest shown figur solut show length shortest path posit path node individu concept elev shortest path south elev choic greater system note concept elev subsum proce evalu member parent subsum concept east nearer south path plot promin graphic presenc count set system level found solut shorter path gener set found path promin graphic characterist futur work mobil augment realiti system emploi mode track result wide variat posit accuraci mode track mode establish track modul make orient appli correct deriv knowledg environ form area map access graph present earli stage augment realiti user interfac automat adapt track accuraci track modifi visual final introduc compon augment realiti user interfac navig guidanc research date interest question stabil manner respect invit offer measur navig advantag map implicit wim significantli power question suggest taxonomi navig princip dimens taxonomi spatial posit orient align number issu address user studi wim fix head wim remain head bodi stabil user wim centroid physic bodi posit conjectur design situat wim centroid entir front user directli wim avoid indirect potenti distract implicit repres wim offset presum disadvantag physic bodi displac realist user miniatur version floor meter front virtual locu wim stabil posit repres virtual overlai real thing back centroid physic acknowledg research fund part onr contract nsf grant gift mitsubishi contribut earlier stage graphic user valuabl discuss appli descript logic theori navig simon write version map navig interfac conduct experi gu rashid develop softwar easili creat floor spatial access graph blueprint refer pentland realtim person posit system wearabl comput proc iswc int symp wearabl page san octob maguir judg locat awar mobil comput proc ict int conf registr outdoor augment realiti applic comput vision techniqu hybrid sensor proc ieee virtual realiti page march feng navig mobil system techniqu augment build infrar inform intern symposium augment realiti page ieee comput societi oct hybrid indoor navig system intern confer intellig user acm cambridg posit system cursor mobil locat technolog tech cell broadcast technolog pentland recogn user context wearabl sensor proc iswc int symp wearabl page octob darken map usag virtual orient issu ieee vr page deer version sun garcia mountain ca aug dijkstra note problem graph schaerf reason descript logic principl knowledg studi languag page csli global posit system ieee dec gold lesh indoor navig set wearabl sensor proc iswc int symp wearabl page san octob webster anatomi applic proc int conf mobil comput network page aug explor develop indoor outdoor user interfac mobil augment realiti system comput wide area motion tracker virtual object manipul ar environ intern symposium augment realiti page ieee comput societi oct laerhoven teach proc iswc int symp wearabl page octob lee mase person indoor navig system wearabl sensor proc int symp mix page march rock field test result arrai proc institut navig salt lake sept macintyr adapt dynam registr error level error filter proc symposium augment page octob navig locomot virtual world flight handheld miniatur proc siggraph page jone magnet posit orient track system ieee tran aerospac electron septemb starner find locat omnidirect video wearabl comput platform proc iswc int symp wearabl page octob locust locat messag system proc iswc int symp wearabl page octob pentland visual contextu awar wearabl comput proc iswc int symp wearabl page octob pausch virtual realiti interact world miniatur human factor comput system page de piekarski augment realiti person applic proc iswc int symp wearabl page octob navig automat vehicl locat dead reckon azuma hybrid inerti vision track augment realiti registr proc ieee virtual realiti page march
DB/1600 3 permiss distribut factor autom infer edward scior abstract extend model handl administr permiss distribut kei idea permiss simpler administ sound infer rule model enabl simplifi administr separ concern technic dba domain justifi fulli autom infer permiss factor show approach coexist current practic base sql permiss access deriv introduct secur greatli improv data access permiss appropri consist granular system rare meet goal connect privileg data multipl finer grain protect provid organ reduc administr cost granul entir grand challeng data secur make administr easi ordinari organ organ good job protect individu fine granular vendor execut estim sql secur featur manag secur directli role granular applic gener grant tabl granular organ move make inform wide multipl interfac copi multipl machin difficulti object type tabl administ sql grant appli singl physic copi deriv interfac administ separ complex make harder planner determin user permiss job permiss deriv product consist natur desir consist discuss current hope give clear guidanc data administr mitr bedford usa edward boston usa mitr oracl person commun current secur model extend administr site infer permiss deriv inform base permiss grant sourc resid system autom infer maintain consist abil split expert domain secur advantag subsect argu capabl amen crucial problem autom permiss infer organ set goal captur fact redund make provid fact part multipl multipl materi isol goal grant access permiss local defin permiss affect deriv tabl grant access permiss feder current situat assum feder administr trust knowledg make grant autom permiss infer permiss defin infer elimin redund grant system assist administr understand grant affect entir administr deriv data trust knowledg autom permiss easili system consist sourc tabl deriv tabl simpli copi permiss answer depend circumst shown hold inform capit nation holidai resid sensit militari resid public server permiss hold inform public web site make user interfac requir subscript fee fewer permiss genet limit power bandwidth gene publish access data weekli download tabl tabl access local user select public part system handl million small transact data larg absorb cpu hold lock clerk permiss analyst proper behavior differ drastic situat trivial case requir human review infer rule privileg inform deriv privileg administr infer privileg appli deriv product intuit privileg propag step formul state permiss privileg propag data privileg extra work feder view dbm administr abstract infer guidanc make compar specif risk problem monolith permiss administr multipl factor decid permiss user user access data comput factor requir requir busi domain determin tradeoff benefit risk greater requir technic judgement system issu perform vulner current permiss specif intertwin make explicit factor hidden singl review hidden permiss permiss platform connect dbm section illustr intertwin view inform tabl factor impact ultim permiss infer automat treat factor clearer pictur inform content global natur inform inform physic platform concern local permiss execut oper machin necessarili impli permiss mine current dba requir kind exacerb shortag skill personnel kind industri revolut eli whitnei switch skill perform part manufactur divid work collect narrow task requir skill prone autom split permiss administr busi expert system administr roadmap paper theori explicitli permiss split kind factor inform permiss permiss section introduc permiss factor infer rule discuss permiss factor provid infer rule section consid implement permiss discard dbmss outlin requir capabl algorithm separ permiss manag intellig manag factor permiss pm commun dbmss support factor discuss factor introduc assum relat section assum view logic requir permiss code public polici data polici deleg administr author grant option split permiss factor permiss oper request submit subject subject role expect role common form subject distribut system issu authent assign user manag role hierarchi scope perform middlewar secur server directori subject submit request system request express store procedur invoc oper abstract action oper tabl granular full permiss author oper full permiss explicitli infer permiss full permiss denot subject author oper θ explicit permiss grant individu pair bulk predic oper oper oper mark oper data store support predic implement burden author recogn desir captur knowledg request implement nativ code call addit requir permiss request determin oper subject execut request full permiss exist relat oper set select emp dept mean subject execut request read permiss underli tabl oper set delet dept assum relat emp record reassign default depart support permiss view oper subject lack permiss base tabl defin store action view grant execut permiss procedur interpret view treat separ store resolut occur secur system permiss factor exist full permiss execut θ demand discuss section easi administ permiss larg question user full requir judgement base rang issu main thesi treat full permiss conjunct special permiss factor compar full permiss factor typic present simpler problem administr question pose permiss factor typic concret answer typic depend narrow slice technic domain knowledg possess explicit definit amen autom mainten assum system set factor type permiss factor tripl specifi subject execut θ respect fi permiss factor relat full permiss definit execut θ iff permiss factor θ respect factor type model administr author permiss factor convent full manag grant revok factor type partit inform factor type factor type inform factor type concern inform alter factor type concern result obtain machin subsect give exampl factor type chang full permiss permiss factor amount administr amount contend reduc specif effort explicit split simplifi handl system reduc mainten effort error singl permiss factor modifi revisit make factor type consid storag cheap permiss factor combin grant time user request inform factor type inform content consist fact drug fact physic multipl interfac inform factor type enabl permiss grant inform content read permiss data subject updat permiss author updat affect physic copi permiss technolog independ unaffect system system receiv request reorgan central distribut administr inform factor permiss busi concern busi data share data protect technolog expert identifi inform factor type ordinari overrid differ semant ordinari permiss gener fine grant wide deleg busi expert union ordinari grant constitut ordinari inform permiss entir system danger administr larg administr lost weed grant permiss violat organiz polici permiss high secur consciou administr limit effect ordinari permiss grant anticip administr overrid permiss organ differenti ignor adopt default public overrid defin factor ordinari overrid execut θ factor grant administr grant ordinari permiss θ subject administr grant ordinari permiss θ permiss factor grant administr grant overrid polici permiss net result execut θ grant factor type factor type simpl neg permiss facil power potenti multipl level neg permiss broad brush limit permiss object explor approach limit permiss grant user onward enabl limit grant grant deriv violat factor type factor type concern execut oper server middlewar permiss result local fact analyst read salari budget machin payrol machin organ appli consist constraint server model identifi factor type illustr section correspond limit paid potenti hacker control workload dba secur offic administ factor type dba tune perform administ factor type predic oper certifi resourc dba sale manag negoti permiss factor type overrid factor act type restrict requir permiss depend mechan updat transact updat sourc materi deriv updat subject permiss object replic process updat permiss sourc replic manag permiss run code machin system achiev effect permiss control extern oper system middlewar server extern system permiss manag environ creat local permiss manag present administr unifi answer question access tabl factor type account infer rule infer infer permiss request set permiss infer permiss suffici request infer permiss infer set permiss inform establish permiss data compar permiss busi infer rule state user permiss factor request permiss factor action made infer rule request defin action permiss factor infer permiss factor rule infer permiss factor base permiss factor underli tabl definit infer rule appli inform factor type request popul instanc produc result queri return updat produc user permiss request perform infer rule request request theori wide queri optim explicitli declin extend theori part secur system extens wider applic queri optim secur facil requir function ad queri languag inform determin queri includ expand view refer definit rule rewrit queri term perform queri simplif base constraint exampl revisit case section show permiss factor captur case limit denot role narrow public sensit free versu subscript servic biologist publish commun short long present feder suppli actual permiss determin underli sourc handl chang augment feder oper explicit oper repres run code feder server execut queri θ refer full permiss desir effect obtain permiss exist ti emp access underli data access feder sound complet examin relev theoret criteria complet sound incomplet toler weak infer todai inevit infer algorithm problem undecid equal reli declar constraint oper incomplet describ real situat sound wit violat lead improp approv subject submit wit place origin request replac inform trust attack declar constraint attack read declar constraint spuriou inform system infer frustrat attack ensur subject possess read updat access declar constraint system restrict constraint creation tabl owner control view definit infer rule state request subject lack permiss request run subject read view definit sourc text gener express knowledg view queri level inform hide worst case black box predict tabl oper invok rule rewrit imposs step subject form insight queri function call queri opaqu case handl secret constant opaqu final level entir queri text queri simplif rewrit permiss manag suggest approach creat system support factor permiss section discuss argu step creation permiss manag sketch interfac interact dbm bulk section permiss administ manag section briefli present wai support administr issu factor permiss section address coexist permiss set permiss manag commerci system extend handl factor permiss led approach base metadata manag tool manag call permiss manag ad system manag framework permiss manag work authent manag directori server pm access metadata local dbm view perform receiv grant command full factor directli replic permiss grant dbm perform infer instal infer full permiss local dbm infer current request request permit tabl administr add factor support exist permiss legaci full factor type report oper administr permiss protect data enabl work proce permiss maintain singl logic pm physic distribut administr privileg tabl assum uniqu schema request refer tabl deriv tabl materi metadata manag awar offer option establish permiss granular pm permiss infer maintain global local dbm retain main enforc runtim reason tamper code run satisfactorili dbm check interfac data call level usag trick improv earli bind permiss check object code modul coverag effici costli duplic dbm deni user permiss manag suggest altern request pm shown reject invit find rewrit resourc gave exampl queri rewritten view addit permiss view carrier secur metadata visibl local system file primit secur enforc permiss distribut queri processor assum distribut queri processor consid altern tabl data sourc base smart copi request permiss execut administ permiss factor permiss factor inform factor type permiss manag conflict permiss warn grant permiss exist warn issu intend protect negoti dba permiss permiss factor type pm check permiss impli addit inform made provid conveni give permiss factor gener full permiss factor type handl add task import restrict order administ permiss role negoti machin access identifi detail inform depend personnel avail aggreg split permiss permiss manag deal legaci permiss factor split factor instantli chang exist permiss factor user prefer factor assum tree factor root node repres full level split info refin infer rule extend definit section includ tree factor infer rule factor type partit basic approach support permiss express intern node direct support gener leaf permiss direct support straightforward tree augment explicit specif factor true iff author administr grant child factor implement rule preorder approach pm maintain permiss factor permiss factor express intern node factor automat replac infer permiss exist full permiss impli valid permiss factor factor type pm grant pm detect wider permiss avoid side effect obviou automat approach grant default miss permiss factor easi side imagin pm decid grant extend permiss factor tabl exist permiss factor spuriou full permiss infer automat default satisfi set permiss factor ad work real benefit factor design separ issu provid extra main problem legaci full permiss mixtur discuss section automat intent simplest simpli pm queri altern permiss remain administr suppli knowledg factor conclud observ deriv relationship set full permiss factor permiss granular trivial simul grant permiss public grant full permiss inform permiss tree easili repres altern pursu gener observ factor type manag coarser granular desir full permiss simul full permiss manag granular inform permiss tabl manag permiss dbmss θ denot oper copi dbmss machin copi hold base data messag full permiss permiss desir full permiss granul encompass θ combin contradict full permiss info permiss entir dbmss case simul rang copi treatment summari goal reduc labor skill requir administ access explor ramif simpl idea separ concern administr provid smaller requir broad chang easier revisit factor inform permiss exploit power infer theori infer fulli autom permiss simul case handl permit fine administr contribut feder techniqu appli view tabl singl tabl dbm administr trust user perform theori implement permiss manag administr elicit intent inform readabl step make consid repres full permiss assimil full permiss dbm support user uninterest chang state infer rule high level properti infer effici evalu algorithm remain open research question outstand pragmat challeng implement tool support approach find wai make attract administr challeng rewrit capabl exploit logic rewrit capabl queri processor refer flexibl author mechan relat data manag acm tran inform vol april pp de di author specif enforc feder journal comput vol pp de di mg autom deriv global author journal comput vol pp administr deriv ifip work confer seattl paper secur basi data secur workshop design manag data grant oper limit ifip workshop august access control ieee model base administr acm tran inform system feb
DB/1601 3 path constraint semistructur structur data peter buneman pennsylvania present class path constraint interest structur semistructur investig implic problem path constraint capabl express natur integr constraint fundament part import queri show semistructur spite simpl syntax implic problem complet implic problem complet establish implic problem fragment path constraint demonstr fragment express import semant inform relationship local constraint commonli found show presenc analysi path constraint implic delic demonstr simpl decid result practic data model introduct path constraint studi context semistructur data class class work partli support armi research nsf grant support irc graduat fellowship support nsf grant fan pennsylvania scott weinstein pennsylvania student student enrol enrol enrol figur school assum declar student entri point declar provid full tion intend structur expect inform state straint student ak student occur extent dent enrol student similarli occur call constraint tent constraint note natur analog extent constraint depend develop relat expect relationship hold enrol wai enabl state enforc extent straint relationship objectstor presenc constraint import queri optim develop formal notat describ constraint borrow idea exploit semistructur data model semistructur data graph consist express root node edg eman label student connect node repres student edg eman describ ture student student singl edg connect string multipl edg connect node figur graph data examin kind constraint extent constraint edg label binari constraint form state constraint exampl implic problem word constraint shown decid semistructur constraint common respect enrol express constraint express word constraint gener path constraint local constraint integr desir make compon build bring number write class defin defin constraint hold compon hold member school set refer compon member set school local constraint local constraint extend graph tion ad school edg root node root local local extent constraint state word constraint give rise question natur gener constraint captur slightli complic form class path constraint form form repres path node node class path constraint express constraint encount path constraint optim describ context structur data semistructur data implic problem mild gener word constraint undecid semistructur restrict case case express constraint issu interact constraint type system type system schema view constraint data gener longer expect result develop semistructur data hold type data proof decid word constraint implic break presenc type constraint restrict type system result word constraint implic rest paper organ section present path constraint undecid implic lem context semistructur section fragment show plicat implic problem fragment decid semistructur tion studi interact type constraint path establish simpl decid result type orient type system type system base manag system popular biologist section summar result direct work path constraint untyp data investig path constraint languag implic problem context semistructur data ture constrain schema present semistructur path constraint term logic show simpl syntax languag implic problem complet implic problem complet assum standard notat logic path constraint languag semistructur data repres direct unql oem survei semistructur data model abstract semistructur logic structur signatur constant denot root set binari relat denot edg label sequenc repres logic formula free variabl path formula denot call empti path free variabl denot tail head node write paramet clear context path constraint languag formal path constraint express forward form backward form path path call path denot set path constraint denot path constraint present section constraint set identifi special subclass call path constraint simpl path constraint form form set simpl path constraint denot ps proper subclass simpl path call word constraint denot introduc gate word constraint repres path observ word constraint simpl path express sentenc logic fragment order logic consist relat sentenc distinct variabl shown problem establish sentenc model size exponenti length sentenc implic implic problem word constraint immedi directli establish refer implic problem word constraint ptime contrast word path constraint express structur figur easi style game distinguish path constraint express show figur structur distinguish implic problem implic problem problem set sentenc satisfi model theorem implic problem implic problem result hold proper subclass pf set constraint forward form set pf theorem immedi theorem implic problem implic problem complet theorem implic problem pf implic problem pf complet proof theorem prove reduct halt problem machin idea proof show set conserv reduct class show function set show conserv reduct prove exist reduct function establish conserv reduct subclass subclass conserv reduct class establish exist reduct encod machin sentenc machin halt state sentenc halt state halt state exist machin establish detail proof theorem proof theorem similar found restrict path constraint implic untyp data undecid result section suggest search fragment implic lem retain express power full languag identifi ment share properti properli set word constraint includ logic formul semant tion interest point view extent relationship local constraint possess decid implic problem context ture present basic notat concaten path denot simpli path form path length path introduc fragment demonstr express establish decid implic problem present mild gener show decid fragment investig section hold analog fragment restrict implic implic problem simpl path view restrict form implic problem implic problem ps implic problem subset implic constraint subset empti path replac restrict weaker restrict implic problem subset call strict subset constraint set length restrict implic problem problem restrict subset model model implic problem word constraint special case restrict implic problem contrast word constraint restrict implic state variabl logic conveni argument constraint restrict subset case integr constraint implic commonli found exampl restrict plicat problem implic constraint local constraint set consist local constraint section constraint set restrict subset restrict implic plicat constraint theorem restrict implic implic problem decid semistructur proof idea proof establish small model properti restrict implic sp restrict subset show function model size stand length establish small model properti path label criterion sentenc sp model sentenc label node path path label collect label node path label structur structur size establish exist model detail proof case path constraint implic exampl restrict implic set consist extent constraint constraint section restrict subset constraint path constraint straint set simpl path constraint path constraint denot note class word constraint proper subset constraint express logic constraint theorem implic implic lem decid semistructur proof proof rem establish small model properti set path label mechan similar emploi proof theorem model sentenc appli mechan label node path obtain label respect show model node uniqu path label size bound cardin label respect small model properti establish detail proof found decid implic nite implic problem queri optim illustr section ture absenc schema enrol student syntax lorel languag queri semistructur queri express select extent constraint straint section shown express select show constraint thing note constraint languag impli extent constraint section mention decid implic problem form basi determin implic note case cient compli familiar principl origin relat perform select earli extend implic set consist local extent constraint local constraint set restrict subset set constraint set share low constraint augment common school repres global path constraint local augment mon motiv extens path constraint extens denot constraint forward backward path lt rt tion path subset extens subset set call extend subset extend implic problem lem extend subset model el set extend subset note implic problem special case extend implic problem implic word constraint special case extend implic extend implic state logic theorem extend implic plicat problem decid semistructur proof prove theorem reduct plicat problem decid establish theorem denot set set extend subset recal set proof theorem surject map extens show path model size model size proof theorem argument small model properti model size detail proof conjunct path constraint show decid result hold extens path constraint extens conjunct path constraint forward form backward form set note path denot set conjunct path constraint denot conjunct path constraint describ structur semistructur data conjunct path context structur constraint constraint ta depart student ta intersect student fragment analog fragment discuss subset call restrict subset path length restrict implic problem problem restrict set model model simpl conjunct path constraint constraint conjunct path constraint constraint set simpl conjunct path constraint conjunct path constraint denot path constraint extens denot constraint forward backward form path subset extens subset set call extend subset extend implic problem lem extend subset model el decid result analog theorem theorem restrict implic implic problem decid semistructur theorem implic implic lem decid semistructur theorem extend implic plicat problem decid semistructur path constraint type data investig path constraint structur data constrain schema show interact path straint type constraint result path constraint implic context semistructur longer hold type context investig class word constraint model model strictli type data model orient model base consid semistructur model fact separ type system type present abstract model term establish abil word constraint implic model impact type constraint structur path constraint implic strict schema implic problem path constraint schema problem set path instanc satisfi model instanc schema structur instanc satisfi type constraint semistructur free type constraint address question interact tween type constraint path constraint show result path constraint implic ture longer hold presenc type implic problem path constraint languag context semistructur establish theorem implic problem undecid type implic problem schema decid long schema referenti data structur instanc navig path languag schema sentenc implic problem decid illustr impact type word constraint implic proof decid word constraint implic ture present show proof break data model interact type constraint path investig path constraint implic type context focu class word properli eri fragment path constraint languag studi section model investig word constraint implic data model data model present data model assum countabl set set base set class set type type ftg ln li notat ftg ln repres set type record reserv rang type schema tripl set type type schema consist singl class map erson record type fp instanc schema tripl oid assign map set map oid fv ln ln vi db denot domain base type repres entri point denot set instanc schema abstract present abstract orient model structur data view semistructur data constrain line abstract semistructur section repres structur logic structur satisfi type constraint determin schema structur depict root direct structur properti determin schema signatur determin schema compon signatur schema set binari relat set type determin denot smallest set ftg ln ln ti li note present type constraint distinguish binari relat denot set membership relat slightli tation section signatur determin schema tripl constant set binari relat set unari relat signatur determin schema instanc schema intend rp type constraint determin schema sentenc logic count extens count count tic structur exist uniqu element present type constraint constraint sentenc ftg ln ln rt type constraint schema sentenc present abstract model paper abstract schema structur signatur denot set abstract schema uf denot set structur natur satisfi set type denot unari relat word constraint present word constraint presenc type path type path schema schema set path type path induct empti path ftg path ln ln li ti untyp path repres formula free variabl denot tail head node word constraint schema express form denot set word constraint schema simpli pw understood sentenc word constraint schema instanc stand project record attribut subset constraint person set person person illustr word constraint schema natur interpret instanc notion instanc constraint agreement abstract respect word constraint reveal lemma abstract proof lemma straightforward found lemma schema uf hold word constraint implic implic problem schema problem subset uf model decid word constraint implic text semistructur establish show set infer rule sound complet implic set consist transit congruenc set rule longer complet word constraint plicat proof longer hold type context constraint ple hard set infer rule provabl shown provabl set length strictli length type constraint pose schema hold instanc schema satisfi jsj denot cardin type constraint record jsj jdj show word straint implic decid proposit arbitrari schema orient implic implic lem word constraint decid proof decid implic low decid problem logic count type straint express logic count word constraint decid implic show implic implic incid arbitrari schema subset model model uf detail proof special word constraint implic decid ptime word constraint implic record schema tain set type refer implic constraint form path concaten oper section proof proposit follow close argument ptime decid word straint implic semistructur found proposit arbitrari record schema implic tion problem word constraint decid ptime size implic size schema proof set infer rule consist congruenc commut sound complet implic record schema proposit arbitrari schema orient implic tion problem word constraint decid ptime size implic size schema model word constraint implic orient model base model explicit set interpret record type function attribut respond domain record type ln subset denot domain ti base model model abstract word constraint model constraint record type ln rt proposit arbitrari schema implic implic problem word constraint decid ptime size implic size schema present class path gate implic problem constraint import structur semistructur data natur integr constraint fundament part semant import queri optim familiar constraint occur state path constraint context semistructur shown simpl syntax languag implic problem complet tion problem complet light abil fragment express interest semant relat local constraint establish decid implic implic problem fragment context structur shown type constraint interact path constraint investig word constraint tion context practic model present abstract model term establish decid word constraint implic model work remain path constraint implic gener type system path constraint implic presenc type rich sourc question set data model constraint languag great number implic problem investig word constraint implic context practic restrict type system question left open includ implic problem fragment section context gener data model complex reason path constraint complex path constraint implic improv investig methodolog autom tool reason path constraint satisfactori perform practic increment path constraint satisfact satisfact check essenti issu connect path straint equal import increment path constraint satisfact dynam subject updat small updat larg small outcom challeng check path constraint satisfact increment part entir scratch tal satisfact approach maintain path constraint requir research methodolog constraint optim path constraint queri optim address paper studi quest queri optim base path constraint algebra rewrit rule acknowledg author victor val tannen susan davidson discuss refer abiteboul proc icdt lorel queri languag semistructur journal digit abiteboul vianu path queri proc acm symp principl editor build stori morgan san closur journal symbol gurevich classic problem queri languag optim techniqu unstructur proc acm sigmod nation conf manag pp weinstein implic problem path report depart comput inform weinstein abil restrict implic problem path technic report ment comput inform weinstein straint presenc technic report depart comput inform cattel morgan san vardi problem bulletin symbol objectstor comm acm octob durbin data base technic report mrc laboratori molecular wang proc symp mathemat theori polytechn pp
ML/1602 6 emploi em activ learn text classif andrew mccallum kamal nigam research henri street pa school comput scienc carnegi mellon pa abstract paper show text classifi label train document reduc advantag larg pool unlabel document modifi method activ learn unlabel pool explicitli estim document densiti select exampl label activ learn combin order class label document remain unlabel result show improv activ learn requir label train exampl previou combin em activ learn requir slightli half label train exampl achiev accuraci improv activ learn em introduct obtain label train exampl text classif gather larg quantiti unlabel exampl cheap task learn web page user find interest user patienc thousand train page interest multitud unlabel page readili internet paper present techniqu larg pool unlabel document improv text classif label train data enhanc activ learn algorithm select label request entir pool unlabel explicitli pool estim region document densiti combin activ learn order advantag word inform document remain unlabel pool previou work al show combin evid label unlabel document em reduc text classif error treat absent label variabl em fill em improv classifi altern current classifi guess hidden current guess advanc classifi train em find classifi paramet local maxim probabl label unlabel data activ learn approach problem unlik em activ learner request true class label unlabel document select request consid oper point perform queri activ learn aim select inform set defin class label maxim reduc classif error varianc distribut exampl jordan calcul prohibit algorithm al select document high classif varianc measur varianc examin disagr class label assign set classifi sampl probabl distribut result label train exampl paper show pool unlabel exampl benefit activ learn em activ learn queri synthet gener awkward select exampl stream ineffici model data advoc select exampl entir pool unlabel document pool explicitli model call scheme sampl result text data techniqu shown reduc label document previou approach show combin em learn fewer label exampl label exampl em discuss initi approach richer combin call sampl interleav activ learn em em model unlabel data inform select activ learn queri probabilist framework text classif section present bayesian probabilist framework text classif section add em activ learn build framework approach task text classif bayesian learn assum document gener parametr train data calcul estim model paramet estim classifi test document turn gener model calcul probabl class gener test document select probabl class parametr model naiv base commonli assumpt joachim assum text document gener mixtur model correspond class label mixtur compon notat fc jcj jth compon jth class compon disjoint subset assumpt document creat select class prior class compon gener document distribut jc likelihood document sum total probabl gener jcj jc document consid order list word event write ik word posit document subscript index vocabulari hw jv make standard naiv word document gener independ independ word document class assum probabl word independ posit document express probabl document product probabl independ word jc jd ik jc assum length jd distribut independ class individu class compon collect word jc jc jv jg jc paramet model class prior probabl probabl select mixtur compon underli assumpt data task learn text classifi consist form estim written base set train data label train fd jdj calcul estim paramet model gener document calcul probabl word jc simpli count fraction time word occur data augment prior smooth prevent probabl infrequ occur word word probabl estim jc jc jdj jd jv jv jdj jd count number time word occur document jd class label class prior estim fashion jdj jd jdj estim paramet calcul train turn gener model calcul probabl class compon gener document formul applic substitut equat jd jd ik jc jcj jd ik jc task classifi test document singl simpli select class highest posterior arg max jd note assumpt gener text document violat naiv good job classifi text document ringuett craven al joachim paradox explain fact classif estim function sign binari function estim domingo pazzani note formul naiv assum multinomi event model gener produc text classif accuraci formul assum bernoulli nigam em unlabel data naiv small set label train classif accuraci suffer varianc paramet estim gener model high augment small set larg set unlabel data combin pool improv paramet estim section describ em combin pool probabilist framework previou section em class iter algorithm maximum likelihood estim problem incomplet data rubin model data data miss em altern current model estim miss miss estim improv model em local maxim likelihood gener give estim miss valu text classif treat class label unlabel document miss appli em result naiv paramet estim give significantli improv classif accuraci test set pool label exampl small al em special case gener miss valu formul jordan em iter process calcul class jd unlabel document current estim equat calcul maximum likelihood estim label origin probabilist equat initi process paramet estim label train iter reach fix point al detail activ learn em estim class label unlabel em activ learn request true class label unlabel document select optim activ learner select document label incorpor minim classif error distribut futur document probabilist framework activ learn aim minim expect classif varianc document distribut note naiv independ assumpt prior introduc bia varianc domin bia classif error focu reduc varianc method activ learn measur varianc indirectli al sampl time classifi paramet distribut result train class correspond natur cluster em hurt accuraci previou work describ method avoid detriment effect order creat classifi variant approxim entir classifi distribut classifi unlabel document measur disagr approxim classif varianc document strongli select label request newli label document includ train sampl make set request section present step explain integr em implement algorithm summar tabl member creat sampl classifi distribut classifi paramet train data probabl naiv paramet class dirichlet sampl paramet jc posterior dirichlet distribut base train data word perform draw tj word class gamma tj ff prior set paramet jc normal weight jc tj sj sampl creat classifi result member individu member denot metric measur disagr emploi vote entropi engelson entropi class label distribut result member probabl mass win class disadvantag vote entropi confid member class probabl pm jd member captur measur disagr document diverg lee unlik vote compar member top rank kl diverg measur strength certainti disagr calcul differ member class pm naiv accur probabl estim pazzani naiv classif score correl fact naiv score successfulli make ffl calcul densiti document ffl loop ad build initi estim label document loop creat member sampl class dirichlet distribut start sampl classifi appli em unlabel data loop paramet current classifi probabilist label unlabel document recalcul classifi paramet label current classifi probabilist label unlabel document calcul disagr unlabel document multipli request class label highest score ffl build classifi label data ffl start appli em tabl activ learn algorithm tradit omit em work set member produc posterior class pm random variabl class kl diverg averag kl diverg distribut avg avg class distribut avg pm kl measur differ captur number extra requir send messag sampl distribut code optim kl diverg distribut jcj log disagr document select class label request document time comput wai select previou applic engelson lier tadep simul stream unlabel document document produc approach measur classif disagr base select document label dagan engelson heurist divid vote entropi maximum entropi creat probabl select document disadvantag sampl sampl full distribut document label label made document irrespect altern altern aim address problem sampl select unlabel document pool largest disagr lose benefit implicit model data select document high popul region retain distribut inform select document classif disagr region document sampl method prefer document high classif varianc similar document stream approach approxim accomplish label small number model densiti explicitli approxim densiti region document measur averag distanc document document individu document measur exponenti kl jd jj jd random variabl word jd maximum likelihood estim word sampl document jd margin distribut paramet determin smooth encod distribut ensur prevent infinit fi paramet determin sharp distanc metric averag kl diverg document measur overlap exponenti convert number scalar distanc calcul averag distanc document effici calcul geometr arithmet distanc document share word word calcul make correct word geometr defin document jdj combin densiti metric disagr select document largest product densiti disagr sampl select document repres confid disagr combin activ learn em activ learn combin em run em converg activ select train data label understood activ learn select start point em hill randomli select document label start point interest term interleav em activ em build result activ em inform activ learn run em converg member perform disagr calcul intend effect avoid request label exampl label reliabl fill encourag select exampl em find local maximum higher classif accuraci accur pick inform document label complet activ learn summar tabl unlik set queri gener previou work unlabel data stream engelson lier tadep freund al assumpt avail pool unlabel data make improv activ learn pool present task effici label text learn relat work similar approach activ dagan engelson sampl vote entropi advoc sampl kl metric select member dirichlet distribut classifi approxim normal distribut studi investig activ learn text categor lewi gale examin uncertainti sampl relev sampl set gale lewi techniqu select queri base singl classifi approxim classif varianc lier tadep winnow learner activ text learn select document randomli select member class label previou show em unlabel data reduc text classif error al studi em combin label unlabel data activ learn task ghahramani jordan em mixtur model fill miss featur valu result section evid combin activ learn em perform individu result base data set usenet reuter data set internet newsgroup data collect ken articl evenli divid usenet discuss group class data set token skip usenet header discard subject token form contigu alphabet remov word stoplist common word perform obtain featur normal word count document length result remov word occur word document randomli select placement test set split reuter distribut data set consist reuter newswir articl overlap topic categori studi lier tadep build binari classifi popul class ignor word stem result vocabulari word result report complet test set breakeven standard inform retriev measur binari classif initi classifi train label document class activ learn proce tabl newsgroup experi run activ learn round select document label reuter experi run round select document label smooth paramet sharp paramet fi made effort tune fi tune size initi experi show size effect em run perform em found classif accuraci improv seventh iter result present averag ten run condit top graph figur show comparison disagr metric select strategi em sampl kl diverg disagr metric achiev accuraci acquir label document reach unweight sampl kl disagr label document switch kl disagr label accuraci random select baselin requir label document number train document kl diverg kl diverg kl diverg random vote entropi number train document random figur comparison disagr metric select strategi show kl sampl metric combin em outperform em kl sampl note order legend match order curv vertic ax rang vote entropi slightli document threshold sampl kl metric statist significantli method interest note document select approach faq newsgroup pool unlabel data notabl improv activ learn contrast earlier work tag engelson vote entropi perform document classif vote entropi select short unusu conjectur occur short document document consist infrequ occur word document easili classif chang perturb classifi paramet classif varianc differ magnitud classif score winner loser small vote prime select kl diverg account magnitud measur confid disagr incorpor select longer document word distribut repres consid gener label long short document label long document inform word dagan engelson vari length document classif addit em learn scheme em baselin random select run em straightforward method combin em activ learn run em activ learn complet interleav em activ run em member includ postprocess run em document select previou experi random select em repeat previou experi comparison bottom graph figur show result combin em activ learn start label mark reach accuraci interleav lag requir label document accuraci label document label label document reach accuraci statist significantli statist significantli method threshold result combin em activ learn larg benefit interleav em perform expect interleav method label document em reliabl label document provid benefici start point em ongo work examin close investig improv number train document initi random initi initi random initi figur comparison random initi label initi label document select sampl note initi label domin random initi label case applic unlabel pool guid activ learn select initi label exampl previou implement engelson lewi gale lewi learner provid collect label exampl begin activ learn obtain label initi exampl make exampl proposit method begin label sampl dirichlet distribut select metric usual figur show result experi begin label structur unlabel data pool select initi label request approach conveni perform label select document region label initi document class attain averag initi kl diverg select attain averag perform rise activ learn begin label document differ statist method successfulli find label request cover class request tend faq inform document comparison previou activ learn studi text classif domain gale lier tadep magnitud classif accuraci modest number train document random number train document random number train document random figur activ learn result categori reuter top order frequenc note activ learn outperform random select magnitud improv larger infrequ class previou studi binari classifi skew distribut posit class small prior probabl infrequ posit random select perform extrem poorli document select label neg class task class prior random select perform improv activ learn dramat ey test perform subset previou experi reuter data skew prior compar random unweight sampl kl disagr metric figur show result ten binari classif task frequenc posit class corn trade acq class frequenc activ learn result repres spectrum ten class activ learn classif accur random improv accuraci random acq distinct trend ten categori frequent occur posit class show larger improv activ learn conclud earlier accuraci improv class random select strong perform baselin paper demonstr leverag larg pool unlabel document em strongli reduc label exampl futur explor direct approxim expect reduct classif varianc distribut effect poor probabl estim naiv explor classifi give realist probabl estim investig wai interleav activ learn em achiev addit benefit acknowledg grate larri wasserman theoret aspect work doug baker format reuter data set anonym review provid comment research support part darpa program contract refer activ learn statist model journal artifici intellig research neural network explor optim experi design nip learn extract symbol knowledg world wide web sampl train probabilist classifi maximum likelihood incomplet data em algorithm journal royal statist seri optim simpl bayesian classifi loss machin learn select sampl queri algorithm machin learn data mine knowledg discoveri learn incomplet data em approach nip probabilist analysi rocchio algorithm tfidf text categor text categor support vector learn relev featur sequenti algorithm train text classifi acm sigir comparison learn algorithm text categor annual symposium document analysi inform sequenti algorithm train text addit data sigir forum activ learn text categor comparison event model naiv text classif workshop learn text categor mixtur expert classifi learn base label unlabel data nip learn classifi text label unlabel document distribut cluster english word acl effect unlabel sampl reduc small sampl size problem mitig hugh phenomenon ieee tran remot
DB/1603 3 proc queri tempor constraint network ptime koubaraki dept athen build greec dept electr comput engin nation technic athen greec abstract start assumpt tempor knowledg captur constraint network repres queri effect scheme indefinit constraint koubaraki queri evalu scheme gener hard comput demonstr interest case queri evalu ptime tractabl result origin subsum previou result van consol introduct tempor constraint network node repres time fact event event start end label node natur languag express arc tempor tempor constraint network queri wai queri event walk happen event event event al van beek kind knowledg queri collect place queri situat understood tempor reason system tempor reason combin gener knowledg system implement system includ natur languag system telo al mcdermott tempor reason copyright american associ artifici intellig reserv schubert telo subclass allen interv algebra network differ constraint pearl paper start assumpt tempor knowledg captur constraint network repres effect network complement store inform typic label node network combin system queri order modal queri languag assumpt made explic system mcdermott tempor relat model al express scheme indefinit constraint paper redefin scheme order logic relat formal present contribut point queri evalu presenc indefinit tempor inform hard problem possibl queri certainti motiv neg discov tractabl subclass gener queri answer problem achiev adopt approach start assumpt class constraint satisfi variabl elimin problem solv ptime demonstr gener class indefinit constraint queri queri evalu ptime data complex restat result rang interest class tempor constraint tractabl queri answer problem identifi bound interest tempor reason research extens tractabl problem identifi van beek organ paper section present preliminari present proc model indefinit constraint section develop contribut preliminari paper order constraint languag languag lc assum intend structur mc interpret formula lc denot theori structur languag lc class formula call lc defin lin order languag linear constraint ration intend structur lin set ration number deal class lin ffl class linear inequ lin ffl class horn disjunct linear constraint constraint disjunct arbitrari number linear weak linear inequ ffl class linear constraint variabl inequ unit coeffici constraint linear constraint ax constraint defin subsum interest class tempor constraint constraint consid jaffar al constraint subsum tempor constraint studi spatial applic defin kind polygon arbitrari kind triangl class give express power limit form neg inform remov point straight line assum reader familiar concept satisfi set concept variabl elimin theorem satisfi set constraint decid ptime nice theorem variabl elimin class fact variabl elimin ptime lin set linear describ result variabl elimin oper set linear inequ size exponenti number elimin variabl result extend similar result theorem set constraint elimin number variabl time number number variabl scheme indefinit constraint section present scheme indefinit constraint origin follow spirit origin order logic relat theori lc constraint languag mc intend structur assum class lc admit variabl elimin weakli close negat negat lc disjunct lc interest constraint languag properti languag lin defin start introduc formal tool make present easi follow order languag equal countabl infinit set constant symbol intend structur interpret equal constant equal constraint formula form variabl constant formal develop constant repres entiti special semant john lc order constraint languag denot union lc intend structur mc denot final defin order languag obtain augment lc sort symbol entiti special equal symbol sort countabl infinit set predic symbol countabl infinit set variabl sort word obtain introduc countabl infinit set predic symbol ariti queri lc order constraint languag section symbol denot vector sort lc symbol denot vector compon sort indefinit lc queri special formula defin definit lc order constraint languag indefinit lc formula local ffl conjunct lc skolem constant proc ffl local conjunct lc variabl skolem constant constraint variabl part formula defin constraint store store conjunct lc correspond constraint network vector skolem constant denot entiti point interv partial knowledg partial knowledg code constraint store languag lc part formula set defin predic refer skolem constant constraint store tempor reason constraint store constraint network predic encod event fact node tempor constraint network db conjunct formula denot clariti write set conjunct conjunct word db pair set feel free whichev definit fit rest chapter machineri indefinit constraint scheme comparison relat prolog skolem constant constraint store repres skolem constant essenti combin constraint indefinit defin revesz mark null grahn indefinit lin constraint mari mari inform event walk paper mari particip tempor inform indefinit exact constraint skolem constant defin queri concept queri defin express queri languag tempor constraint network al van beek similar queri languag definit order modal queri indefinit lc express form op oe formula op modal oper modal queri distinguish certainti necess queri possibl queri queri possibl walk read defin concept answer queri definit queri indefinit lc db answer formula form local local conjunct lc variabl variabl variabl assign variabl exist model db mc interpret symbol lc satisfi satisfi vice versa definit answer case certainti queri defin skolem constant present answer modal queri answer queri queri evalu indefinit lc view quantifi elimin theori admit quantifi elimin consequ assumpt begin section theorem essenti theorem db indefinit lc local queri answer disjunct conjunct variabl lc variabl obtain elimin quantifi formula proc formula vector skolem constant substitut vector appropri quantifi variabl vector sort lc obtain substitut atom formula predic disjunct conjunct lc constraint disjunct obtain consult definit local predic db certainti queri obtain elimin quantifi formula oe defin due lack space give exampl procedur exampl found close section point defin scheme choic lc develop formal studi kind indefinit inform tempor complex result section develop similar spirit talk arbitrari constraint class satisfi properti instanti result class tempor constraint final section paper tractabl queri evalu indefinit constraint paper complex queri evalu measur notion data complex data measur complex queri evalu function size size queri consid fix assumpt made previou work queri constraint network beek case assum size integ constant logarithm size revesz evalu possibl queri indefinit constraint equal inequ constraint atom valu grahn evalu certainti queri import seek tractabl instanc queri evalu paper start assumpt class constraint nice comput closur properti show class indefinit constraint modal queri evalu ptime data complex reach tractabl case queri evalu restrict class queri framework introduc concept queri type type make distinct queri type queri type tupl argument queri type distinguish close open queri queri call close free variabl queri free variabl call open argument modal repres possibl necess queri argument denot queri posit existenti form oe involv logic symbol denot queri form op vector vector predic symbol op modal oper fourth argument constraint denot class constraint queri condit queri class lin type type tupl form ariti ariti constraint class definit class constraint constraint store ariti valu monad result type consist singl predic defin constraint class constraint constraint store belong class special type repres complex result definit definit class constraint class constraint defin constraint iff disjunct negat proc definit class constraint problem decid set constraint satisfi denot sat problem elimin arbitrari number variabl set constraint class denot number variabl fix problem denot fv lemma theorem section assum sat fv ptime implicit paramet interest size input constraint set present result assum data complex measur close queri lemma class constraint evalu queri class indefinit constraint class decid consist set formula form cs conjunct theorem class constraint sat fv solv ptime db indefinit constraint class queri class problem decid solv ptime data complex lemma class constraint evalu queri class indefinit constraint class decid consist formula form cs conjunct theorem class constraint sat fv solv ptime db indefinit constraint class queri class problem decid solv ptime data complex turn attent tractabl queri evalu open queri lemma class constraint evalu queri class indefinit constraint class elimin quantifi set formula form cs conjunct vector free variabl queri theorem class constraint ptime db indefinit constraint class queri class problem evalu solv ptime data complex lemma class constraint close negat evalu queri class indefinit constraint class elimin quantifi formula form cs conjunct vector free variabl queri number disjunct disjunct defin singl predic refer queri theorem class constraint close negat ptime db indefinit constraint class queri class problem evalu solv ptime data complex applic tempor reason special gener complex result present previou section interest tempor spatial domain class ffl lin defin earlier ffl subclass lin linear equal ffl ia interv algebra allen ffl ia includ interv relat translat conjunct order constraint endpoint interv beek cohen ffl ia includ interv relat translat conjunct constraint endpoint interv constraint disjunct weak inequ form form addit constraint number inequ exce proc ffl pa pa point algebra van beek pa includ relat ffl trivial constraint true theorem evalu queri queri queri queri perform ptime data complex part theorem extens ptime result possibl queri network tempor constraint form theorem mention constraint higherord object explicitli tempor reason problem involv point luckili true result interv constraint deduc immedi account subsumpt relat class interv point constraint part theorem impli evalu queri ptime data complex extens ptime result beek possibl queri network constraint deriv extens ptime result beek certainti queri simpl modif definit queri detail long version paper theorem constrain ariti predic der meyden shown evalu queri ptime part theorem move binari queri answer problem npcomplet der meyden unlik der meyden proven lower bound result paper research draw inform pictur tractabl intract queri answer problem indefinit constraint acknowledg research partial support project chorochrono fund eu framework programm support postgradu fellowship nato work perform author dept uk refer queri set world theoret comput scienc maintain knowledg tempor interv commun acm gener manag tempor inform vol lnc extend tempor relat deal qualit tempor inform recent advanc tempor workshop comput springer comput complex queri bound differ constraint artifici intellig tempor data base manag artifici intellig tempor constraint network artifici intellig effici algorithm qualit reason time artifici intellig problem incomplet inform relat vol lnc springer verlag incomplet inform relat journal acm finit domain vol springer verlag linear program approach tempor reason constraint queri languag tractabl disjunct linear constraint intern confer principl practic constraint program local global consist tempor constraint network theoret comput scienc complex queri evalu indefinit tempor constraint theoret comput scienc languag repres knowledg inform system acm transact inform system reason tempor maxim tractabl subclass allen interv algebra journal acm manag disjunct practic tempor reason decid linear inequ comput loop residu journal acm van tempor queri process indefinit inform artifici intellig medicin van exact approxim reason tempor relat comput intellig van der complex queri indefinit data linearli order domain full version pp complex relat queri languag van constraint propag algorithm tempor report de read qualit reason physic system morgan kaufmann express combinatori optim problem linear program proc
ML/1604 6 autonom learn sequenti experi ron sun todd peterson nec research independ nj al august hybrid reinforc rule markov sequenti make work support part offic naval research grant helen susan support simul navig task provid nrl diana jim alan ed merril relat work dave diana marco dorigo comment anonym review suggest paper present learn model hybrid model base approach sun model integr symbol learn method perform learn learn neural symbol model util procedur declar knowledg neural symbol tap synergi type process appli deal sequenti task experi wai report shed light advantag model obstacl agent target figur navig introduct paper present model unifi reinforc learn address deal autonom situat agent learn autonom experi data set concept priori model learn procedur knowledg declar knowledg tradit reinforc learn discuss learn declar knowledg acquir agent experi interact world mediat procedur knowledg differ learn procedur knowledg acquir extern declar knowledg anderson sequenti task involv select perform sequenc action accomplish object basi perceptu inform abstract specif sequenti task agent set finit set action perform time step select base current state world world present sensori state vector sequenc state vector point agent receiv payoff reinforc action perform prior current state agent perform credit assign attribut action point time tempor credit assign accord aspect state structur credit assign gener teacher provid addit input agent start priori knowledg learn navig figur discuss essenti motiv project cognit model understand human learn sequenti make sun sun al paper focu comput experi model develop goal paper detail specif model design demonstr aspect perform advantag remaind section present model section present experi navig domain section section relat model exist work section end paper conclud remark model procedur declar knowledg great deal work demonstr differ procedur knowledg declar anderson keil damasio al sun believ balanc essenti develop complex cognit agent base line argument ampl psycholog data support distinct procedur declar knowledg anderson initi distinct base human data problem solv keil sun subsequ made similar point base psycholog data philosoph argument make distinct achiev balanc distinct analyt intuit smolenski distinct conceptu process distinct consciou jame sun inadequaci system ignor point deal full rang complex intellig behavior lend addit support argument aim captur dichotomi denot dichotomi serv justif main declar knowledg procedur distinguish differ access knowledg easili access linguist procedur knowledg anderson sun declar knowledg advantag make learn agent fact procedur knowledg effici easier learn advantag ffl guid explor reduc time develop skill situat transfer learn skill shown psycholog al ffl declar knowledg speed learn properli explicit knowledg extract procedur learn facilit learn process al stanlei al ffl declar knowledg commun learn knowledg skill agent model framework repres type knowledg integr model encompass model connectionist learn adapt rule induct similar model sun specif design skill learn sequenti task consist bottom level procedur knowledg top level declar knowledg form proposit rule discuss level detail base idea sun indic differ level li psycholog evid captur procedur prefer subsymbol distribut provid backpropag network implicit natur procedur knowledg function approxim due larg state term prefer reinforc learn tempor differ handl sequenti sutton sequenti task uniqu correct action roughli equal learn procedur applic good action bad measur good action signal adjust made paramet chanc select action lead posit reinforc reduc chanc select action lead neg reinforc captur declar prefer symbol unit clear conceptu mean declar knowledg highli access infer perform explicitli conceptu level sun focu proposit rule learn make level network train reinforc learn embodi procedur knowledg complet separ learn mechan top level extract inform form explicit rule dynam acquir rule modifi rule subsequ human learn true rule learn specif discuss al sketchi algorithm describ oper explain notion observ current state comput bottom level valu action find action top base input rule place action valu perform action observ state reinforc updat bottom level accord updat top level back step bottom level reinforc learn evalu action desir action state consist sensori acquir algorithm tempor differ estim maximum discount cumul reinforc agent receiv current state updat base minim call bellman fl discount max state result action updat base tempor differ evalu current state action chosen success updat agent learn account futur step longer longer notabl explicit plan implement implement chose layer form backpropag network comput fourth layer perform stochast make output layer output layer backpropag action individu node fourth layer determin probabilist action perform base boltzmann distribut control random process train backpropag network base error err index output node repres action action perform backpropag procedur appli usual adjust weight top level rule encod declar knowledg captur simpl proposit rule form directli symbol rule facilit correspond bottom level encourag uniform chose connectionist model connect node repres condit rule node repres towel shavlik directli translat structur rule set network detail discuss rule learn rule learn algorithm accord task concurr lack teacher input priori knowledg basic idea perform rule learn subsequ step action decid bottom level success measur present agent extract rule correspond add rule rule network subsequ interact agent verifi extract rule outcom appli outcom success measur rule made specif current outcom agent gener rule make refin version algorithm flesh rule learn detail step lookup tabl implement feasibl continu input space result huge state space navig task function approxim lin mahadevan connel tesauro result converg learn tsitsikli observ current state calcul action current find rule match current state match rule appli combin outcom previou step weight sum base combin valu select action perform boltzmann distribut perform action enter state result action possibl receiv reinforc calcul updat statist rule variat check current criterion rule extract result success current criterion defin rule match state perform extract state action add extract rule rule network result unsuccess current criterion match rule shrink delet remov match rule rule network add version rule rule network result success current gener match rule creat rule add expand rule rule network replac origin rule perform merg combin exist rule updat bottom level detail rule encod learn examin detail rule encod assum input state made number dimens dimens number valu rule side conjunct individu element refer dimens input rang dimens fv side action recommend element side repres individu node set link connect node repres element side rule node repres side rule element posit link carri posit weight set carri neg weight sigmoid function dimens ordin nomin focu ordin nomin valu handl similarli binari dimens special case discret ordin dimens node activ obviou function threshold node set number incom link number element condit lead repres select make case node activ element condit activ element condit met activ consid activ consid rule fact discret version rule learn includ determinist version statist version criteria version measur step success rule detail oper focu statist version sun peterson criteria rule determin inform gain measur basic compar qualiti candid calcul inform gain examin state action state action reinforc receiv action base updat posit neg match count rule condit variat rule condit input regard action perform updat pm posit nm neg pm equal number time input match condit action result posit nm equal number time input match condit action result neg determin inequ bellman max action good analysi sun peterson rule lead intermedi node creat element side rule link intermedi intermedi node link node repres complex rule form includ predic rule variabl sun rule learn complex ilp techniqu lavrac dzeroski statist updat stat stat stat stand pm nm end discount stat stat result nonstationari situat base calcul inform gain log pm pm log pm pm condit lead action measur compar essenti percentag posit match condit laplac lavrac dzeroski improv percentag consid rule compar rule rule condit match rule consid success decid shrink decid construct rule base simpl success criterion fulli determin current step ffl bellman residu action perform state result state current step rule cover step top set rule specifi valu input dimens criterion appli shrink base inform gain measur amount ad addit input dimens condit rule opportun match shrink amount remov input dimens condit opportun match input detail descript ffl max current condit match refer rule regard action modifi condit input current rule success expand condit potenti set argmax condit rule reset rule statist rule cover expand rule children list wide induct logic program justifi empir ground lavrac dzeroski children list rule creat make inact rule specif fulli current rule rule delet rule children list reactiv longer cover ffl max current condit match refer rule regard action modifi condit minu input current rule shrunk condit set argmax condit rule reset rule statist restor rule children list origin rule cover shrunk rule ffl includ shrink shrink condit make imposs rule match input delet rule ffl condit rule close rule rule cover complet put children list rule cover produc rule cover note accumul statist acquisit refin rule contrast bottom level model step make final action incorpor outcom level method combin outcom level good method stochast method combin valu action level weight top level action activ rule bottom level activ final outcom stochast make boltzmann distribut base weight sum perform select action action rel weight level automat set base probabl match rel perform level commonli observ anim success rate made top level success rate bottom level weight top level bottom level avoid oscil current action probabl action preliminari contrast characterist level top level rigor verifi random learn fashion bottom level rigor random learn gradual cumul fashion complement note gener rule complement gener bottom bottom level gener rule gener top level term captur kind regular possess level learn combin stochast result improv perform similar basic motiv averag techniqu bear resembl work combin multipl heterogen learner improv domingo martinez tempor differ determin rule learn bellman residu max encourag action lead improv lead state higher posit tempor differ action worth explor respect lead learn learn action action larg tempor agent ignor action proven effect larg achiev combin outcom rule network high bottom level encourag agent action learn action lead posit tempor differ tend action posit tempor differ mean action lead state compar state result action neighbor action due network output surfac select action tempor differ criterion lead rule mean state percentag rule match recommend action error rate account bellman probabl residu occur optim optim rule rule supplement approxim function approxim neural section note rule learn part model learn perform tempor credit assign perform tempor credit mechan compar power rule learn base bottom level rule extract bottom level improv perform discuss experi task set test simul navig task shown figur agent navig underwat vessel reach target locat agent receiv inform number instrument shown figur sonar gaug show close mine equal area rang left agent fuel gaug show time left fuel run bear gaug show direct target present direct agent rang gaug show target current locat base agent decid turn fast move time allot agent episod step allot time reach target hit mine run time failur episod start agent side target episod end target time run agent hit mine random mine layout gener episod mine randomli start point agent target simul navig learn statist averag account result state action rule extract erron due state transit outcom state lead larg tempor differ rule delet rule process inform gain frequenc state transit model setup input bottom gaug repres set node discret analog input valu case discret node fuel input node rang input node bear input node sonar input node node lot straight input state case analog gaug repres continu valu highest lowest scale deal problem high input lookup tabl implement bottom level high lin function backpropag tsitsikli action output bottom level consist cluster cluster node valu slightli slightli cluster node valu top altern input bottom secondari featur input zhang dietterich featur input node input node input node input node input node input node input node compar perform type found differ figur navig input displai upper left corner fuel vertic upper corner rang round middl bear sonar gaug bottom input node input node node binari node node averag distanc calcul averag sonar valu result node cluster node similar individu sonar gaug featur intern paramet set optim hand hidden unit backpropag momentum paramet network weight randomli initi discount rate temperatur stochast make set schedul gradual lower learn rate ff ff cs ff current learn ff initi learn success rate percentag success episod previou block threshold rule extract set threshold limit number rule top institut upper limit rule rule creat purg exist rank order rule basi ag rule defin number step occur applic rule fix combin weight level reinforc agent produc sourc gradient proport chang read chang distanc end determin success agent end secondari featur set led impact learn perform discuss distinguish primari secondari featur set agent reinforc gr episod end reward agent reach target allot proport distanc agent run time blown result learn speed figur show data analog input bottom level secondari featur top term learn measur number success episod total episod train column figur show differ bottom level pure higher mine densiti difficult significantli compar bottom level superior bottom level statist perform statist case figur show learn curv data point averag percentag success episod block transfer block figur show transfer transfer measur percentag success episod set train model train model appli number mine total data averag data gener pattern higher mine densiti lower success rate perform model gener train higher mine densiti train high mine learn strategi suitabl outperform bottom level transfer higher mine higher mine pronounc differ differ statist case compar transfer perform top bottom system train notic system perform level synergi level system perform learn rule improv transfer perform distanc travel target direct maximum distanc agent reinforc gr agent run reinforc er distanc target agent blown reinforc er mine densiti model train bottom top bottom top bottom top sd sd figur learn transfer refer bottom level sole learn method train total number success episod train block perform data mine densiti train model top bottom mine densiti model train bottom top bottom top bottom top sd sd figur learn transfer refer bottom level sole learn method train total number success episod train block perform data mine densiti train model top bottom mine densiti model train bottom top bottom top bottom top sd sd figur learn transfer refer bottom level sole learn method train total number success episod train block perform data mine densiti train model top bottom episod learn curv episod learn curv episod learn curv figur learn curv set train perform block figur train perform block figur show train perform train block figur show train perform train block figur show train perform train train perform defin percentag success episod set train train model train model appli total data averag higher mine notic train perform bottom level compar perform system level separ level train notic system perform bottom level top level strongli suggest synergi level appendix exampl rule learn top level trace navig plot snapshot trajectori random mine layout train repetit show progress agent train select episod agent oper mine layout occur regularli train select total episod agent mine layout figur shown agent complet reason path eventu optim path goal strictli monoton regress back earlier behavior eventu behavior result train sourc power object appar advantag model improv exhibit experi pure due high random network bottom level counter temperatur result invari outperform bottom level high mine densiti figur illustr case effect temperatur point goal start start goal goal start goal start start goal start goal goal start start goal start goal start goal figur sampl trajectori learn start goal start goal start goal start goal start goal start goal start goal start goal figur sampl trajectori learn temperatur perform sd perform sd figur perform train temperatur perform measur number success episod train episod mine densiti made stochast polici determinist polici action maximum boltzmann train necess compar perform type found averag stochast polici outperform determinist polici possibl action top supposedli bottom sourc power true reduc action action maximum activ valu test gradient reward great type reward encourag agent neighborhood turn learn slightli case sourc power model attribut absenc hidden unit top level test remov hidden unit bottom level improv perform result hidden unit remov bottom model bottom level great difficulti learn task tesauro simpli remov hidden unit bottom level sourc perform improv relat test make activ function node bottom level discret steep sigmoid ad threshold term top improv perform result ad hidden unit top level made node discret turn top level backpropag perform model import discret top level result complementari level explor possibl insuffici number hidden unit bottom level led improv perform top level top level supplement capac number hidden hidden unit perform sd perform sd figur perform train number hidden unit bottom level perform measur number success episod train episod found increasingli hidden perform improv bottom level improv system appli figur illustr case effect number hidden unit confirm advantag architectur test rule learn sourc power compar frequenc rule learn readi paramet readi determin time rule extract criterion list satisfi rule vari readi extract result perform differ extend readi higher perform model deterior significantli rule learn partial explan model advantag test rule learn criterion sourc power amount direct reward receiv agent step maximum state max criterion indic action state directli fail account sequenc action criterion concern action close maximum indic optim action result show adopt criteria lead significantli perform power model attribut complementari discret complementari learn rule learn gradual proper rule learn criterion base note rule learn independ bottom level criteria rule learn base tempor credit assign proper discret rule approxim guid action gener backpropag huge state space version perform sd ep ep figur perform playback perform measur number success episod train episod mine densiti version perform sd em em figur perform episod memori perform measur number success episod train episod mine densiti bellman residu addit techniqu test number techniqu literatur episod playback lin involv train network encount plai backward direct run episod reason fulli util inform previou speed learn playback test exponenti updat rate backward similar idea elig sutton singh sutton playback test constant updat rate found figur episod memori altern techniqu speed step set previou step includ randomli select train network bottom level lin episod memori speed appli bottom level model outperform bottom level higher mine densiti difficult figur altern neural architectur combin tree network rule learn top learn combin output bottom level period tree set newli accumul instanc mine densiti perform sd perform sd figur perform combin tree perform measur number success episod train episod step includ randomli instanc determin posit depend posit measur explain appli posit instanc learn tree action quinlan vari includ frequenc tree number instanc instanc select combin paramet result altern architectur invari figur set data explan perform tree forc cover case rule learn limit case model suffici experi leav bottom level handl case gener rule lead perform gener suit sequenti compar backpropag network bottom partit method state space divid region handl learner gate al jordan jacob popular learn involv linear gate network assign input learner adapt sequenti task result obtain show perform possibl combin result multipl train entir state space combin straight averag weight weight determin perform gradient descent error combin outcom learner diversifi paramet valu initi number hidden learn shown advantag term obtain combin outcom sun peterson result show averag weight averag achiev averag perform bottom level perform form pocket algorithm observ improv perform compar exist techniqu report analyz role rule rule combin complement set input state rule episod high input possibl examin repres state illustr shown figur turn inadequ guid behavior agent state shown action recommend action highest state recommend action incorrect state optim verifi action input state descript input figur suboptim uniform action recommend result function approxim backpropag network comput due action recommend produc input inappropri system behav essenti success rate kei resolv paradox li rule learn produc correct action recommend state outcom rule figur combin correct action recommend produc input state verifi action input figur led success rate system shown figur run paramet basic correct state shown figur good rule learn complet cover input state shown figur complet coverag adequ state outcom rule combin result correct action recommend state compar perform produc run case demonstr scenario regard combin pattern episod subject slight straight slight left left stand slow normal fast fast pattern episod subject slight straight slight left left stand slow normal fast fast figur complementar refer output measur number rule make action recommend specif input figur pattern episod subject slight straight slight left left stand slow normal fast fast pattern episod subject slight straight slight left left stand slow normal fast fast figur incomplet rule set refer output measur number rule make action recommend specif input figur input state bear sonar valu figur descript input state bear valu clock posit sonar valu mine current posit episod rule data rule figur rule learn complementari redund accomplish case expect combin case analysi rule rule figur rule defin percentag step exist rule top level match action made model step shown measur gradual role top level plai rule data stabil rule top rule rate rule shrink shown figur result point eventu stabl set rule top level content eventu rule set vari run analysi previou effort verifi role rule test result rule top accumul instanc step includ tree algorithm induc tree base rule base subset randomli select instanc step induc rule view recommend action view class label episod rule data extract delet shrink expand figur gradual rule extract learn sourc tree tree size fit valid fit rule instanc figur comparison tree result rule instanc accumul appli tree remain half accumul instanc valid shown figur found rule led tree result rule fit data gener found valid test test remain tree produc compar tree result rule smaller result suggest learn rule set inform higher inform content sampl set rule includ appendix tree induc includ appendix complex time complex comparison pure bottom level assum size input state space size encod input state number size action space number hidden unit safe assum assum maximum number instanc determin posit base posit measur explain earlier appli posit instanc induc action perform respect classif rule maximum number rule calcul approxim step activ propag set order relat network size top rule activ step compar rule input order empir found limit suffici rule activ polynomi time close calcul term bottom approxim step updat order relat network size top rule updat relev statist step rule base statist step time linear regard total time learn rule close top level space store space store activ space complex order bottom level backpropag weight storag space store set space complex order relat work hybrid model hybrid model reactiv popular model includ hendler gelfand al miikkulainen dyer sun sun overview hybrid connectionist model implement type knowledg kind network barnden sun implement knowledg miikkulainen dyer hinton touretzki implement knowledg distribut network sun gelfand al attempt develop principl dichotomi conceptu architectur model incorpor tend simpli side dichotomi attempt explor synergi exist hybrid model perform sun barnden sophist perform learn batch miikkulainen dyer learn task difficult perform learn al cognit plausibl ecolog realist regard al capabl integr learn develop subsymbol symbol side unlik exist model exist learn model explor learn advic extern declar knowledg turn procedur knowledg gelfand al maclin shavlik anderson explor demonstr knowledg emerg interact world mediat procedur knowledg rule extract compar connectionist rule extract algorithm fu exhaust search base algorithm extract conjunct rule perceptron network find learner search combin posit condit lead found combin posit learner search neg condit ad case learner extract separ set integr substitut towel shavlik rule altern true believ rule express close resembl comput neural order avoid combinatori discern structur procedur extract group similarli weight elimin form rule remain group exhaust search rule extract algorithm meant appli end train network rule modif rule train network agent extract modifi rule dynam connectionist reinforc learn rule learn work util synergi algorithm improv learn extract modifi rule dynam minim search separ search process addit neural network learn towel shavlik fu search process incur slightli cost step learn complex analysi agent adapt chang environ addit remov rule time avoid examin detail network rule extract focu behavior network acquir rule basi rule learn ai turn rule learn method tradit ai learn tackl task dealt tradit ai rule learn algorithm learn algorithm aq michalski quinlan requir consist data requir agent obtain data learn mean higher space slow start extra appli directli task perform tempor credit assign increment varieti learn version space algorithm mitchel utgoff requir consist descript handl sequenc learn fisher stepp michalski unsuit feedback direct feedback order achiev tempor credit assign complet descript instanc system base argu problem sequenc avoid evalu valu state action static static evalu reli great deal priori knowledg task natur assum minim priori knowledg agent martinez shen incorpor varieti learn strive incorpor learn method cognit principl sun sequenti make review exist method sequenti learn good method reinforc sutton watkin reduc stop neural network learn earli obtain good necessarili rule set fu towel shavlik shorten neural network shorten search process rule extract watkin sutton variat adopt altern reinforc learn exist work show good lin mahadevan connel reinforc learn problemat input space continu case reinforc learn tabl lookup longer applic neural network implement success learn tesauro experi suggest rule complement function approxim neural detect correct section reinforc learn tesauro zhang dietterich larg compar larger navig task model aim practic model motiv cognit model simul understand human cognit base dichotomi procedur declar sun al model techniqu directli applic varieti techniqu speed sutton lin maclin shavlik mccallum moor atkeson singh zhang dietterich singh sutton techniqu includ previou experi lin gradual enhanc state space moor atkeson hierarch learn construct highlevel featur dietterich test previou experi construct deriv featur section compar requir larg amount priori knowledg requir maclin shavlik design deal pomdp goal mccallum relat speedup techniqu answer gener framework extract declar knowledg reinforc learn network sake improv method appli top exist reinforc learn techniqu sutton lin mccallum singh sutton implement neural extract rule section work combin learn reinforc learn agent extract specif rule situat examin infer situat identifi relev condit infer gordon grefenstett explain gener reactiv base set rule domain model bear remot resembl speed task reli extern knowledg requir examin altern reinforc learn altern handl sequenc explicit symbol plan tradit agent gener number subgoal accomplish number goal accomplish step approach suitabl substanti amount priori knowledg readili unnatur describ simpl sequenti behavior chapman altern neural network recurr backpropag network network hidden node repres record past state hidden node connect recurr previou state account present problem network requir learn unsuit task techniqu problem requir teacher input gener slower lack proper tempor credit assign mechan altern genet algorithm schultz ga weak method heurist search updat knowledg base acquir experi entir gener member end individu experi step episod learn time requir algorithm expect longer work differ previou work sun dealt sequenti make sun al dealt psycholog issu model human sequenti make sun peterson primit algorithm rule learn present experi domain conclud remark paper present model unifi reinforc learn method tackl learn sequenti task develop procedur declar knowledg autonom explor bottomup direct util principl dichotomi procedur declar learn perform transfer effect model neglect dichotomi experi demonstr aspect potenti advantag suggest combin type knowledg yield synergist result model perform cognit plausibl sampl rule due show subset rule deriv secondari straight ahead center center close fast straight ahead center center close fast straight ahead close fast straight left close close close turn fast left close close close turn straight ahead close close close turn slightli fast left left left close close turn fast left left close close turn fast tree bear left turn left bear left turn left bear straight straight bear turn left bear turn left bear turn left turn close turn slightli averag turn bear left turn bear left turn bear straight turn slightli bear turn bear turn bear turn turn slightli close turn slightli averag straight turn slightli turn refer architectur harvard ma rule mind lawrenc erlbaum associ nj learn sequenti gabriel moor learn comput neurosci mit press ma free encod connectionist data confer cognit scienc lawrenc erlbaum nj bertseka program athena ma bag predictor machin damasio neural region knowledg access cold spring harbor symp quantit press peopl discov unifi induct machin learn mind mit press ma mind free ny knowledg acquisit increment conceptu cluster machin learn lm rule learn search adapt connectionist expert system commun integr system neural network robot skill morgan san ca integr framework learn reason journal artifici intellig research al nrl navig avoid naval research lab dc gordon explan empir deriv reactiv plan machin learn confer morgan san ca evolut strategi multiag environ adapt behavior marker pass morgan san ca gener version space machin principl psycholog york cognit develop mit press ma experi increment concept machin learn reactiv agent base reinforc teach machin learn maclin incorpor advic agent learn reinforc morgan san ca mae learn coordin nation confer artifici intellig morgan san ca mahadevan connel automat program robot reinforc learn learn select attent mem ori task proc confer simul adapt behavior mit ma increment approach develop intellig neural network control robot adapt behavior theori methodolog induct learn artifici intellig miikkulainen natur languag process modular pdp network distribut lexicon cognit scienc gener search artifici moor algorithm variabl resolut reinforc learn state space machin learn model classif learn psycholog review induct learn tree machin learn preliminari analysi soar architectur basi gener intellig artifici intellig genet algorithm learn strategi local navig intern symp unman technolog durham simpl associ systemat tech report pa discoveri autonom learn environ machin learn singh reinforc learn replac elig trace machin proper treatment behavior brain stepp conceptu cluster michalski al machin ii morgan lo ca insight interact instruct practic simul process control task quarterli journal psycholog variabl bind connectionist connect integr rule robust reason john wilei ny robust integr reason artifici intellig hybrid approach model neural special issu sun comput architectur integr neural symbol process kluwer academ publish ma sun hybrid model learn sequenti navig proc ieee intern symposium comput intellig robot autom ca ieee press sun experi hybrid model learn sequenti make inform scienc skill learn reactiv sequenti task cognit scienc societi lawrenc erlbaum nj skill learn hybrid model proc intern confer cognit korea august integr architectur react base approxim dynam program seventh intern confer machin learn morgan kaufmann san ca sutton modern theori adapt expect predict psycholog practic issu tempor differ learn machin learn touretzki symbol morgan kaufman towel extract refin rule neural machin learn utgoff increment induct tree machin learn learn delai reward phd cambridg uk develop procedur knowledg journal cognit zhang reinforc learn approach schedul proc intern joint confer morgan san francisco
Agents/1605 1 feasibl format coalit autonom agent environ shehori robot institut forb av pa usa krau dept math comput bar israel institut advanc comput maryland colleg md usa abstract cooper share resourc creat coalit agent import autonom agent execut task maxim payoff coalit form member coalit gain join coalit gain wai creat coalit divid joint payoff member paper present algorithm coalit format payoff distribut environ focu coalit format algorithm properti algorithm examin simul shown model benefit agent reason time coalit format provid benefit agent kei word distribut coalit system materi base work support part nsf grant lab contract order armi research lab contract preliminari version paper content introduct environ descript protocol strategi equilibrium assumpt definit kernel coalit format model approach protocol method comput coalit valu coalit configur pc complex discuss cfm polynomi approach protocol strategi protocol detail coalit make structur design wait time complex simul result relat work dai game theori distribut ai game theori introduct cooper autonom agent mutual benefici agent maxim expect payoff import method cooper system coalit format membership coalit agent abil satisfi goal maxim person payoff occas format coalit benefici method satisfi goal situat agent cooper form coalit agent member environ cost cooper ascend function number cooper partit agent subgroup reduc cost coordin commun paper address solut type game theori refer environ work game theori describ coalit form game player distribut benefit cooper provid algorithm coalit format specif constraint commun cost limit comput time paper present approach coalit format problem distribut procedur type includ extens comput minor vastli negoti activ mechan stem qualiti solut speed reach aspect qualiti sum payoff agent receiv form search exponenti number solut order solut bound term payoff maxim shown aspect qualiti stabil solut stabil refer state stabl solut agent incent search solut incent weaker type stabil type commonli discuss context coalit game theori search exponenti number solut lead format stabl coalit maxim individu payoff agent search exponenti solut space bound stabil depend assumpt regul vari concept concentr defin paper choic practic prove effici show optimum addit attempt reduc comput time search limit polynomi number solut case bound optimum sum payoff lead stabil effici coalit format anytim algorithm satisfi requir polynomi search reduc comput worst case payoff agent receiv bound optim payoff show averag case payoff close optim mechan provid paper facilit coalit format autonom task access resourc fulfil task coalit format util enhanc abil agent satisfi task cooper environ autonom comput agent repres taxi driver transport capabl result payoff cooper coalit format abil achiev greater complex transport capabl exampl cooper coalit format emploi solv ai problem transport domain electr plant domain inform agent domain coalit format method develop paper serv basi coalit format inform present main contribut paper algorithm agent environ section algorithm insepar issu optim stabl solut limit commun comput system algorithm add test discuss outlin paper introduc basic concept strategi equilibrium defin specif type equilibrium strategi equilibrium paper follow section assumpt coalit format environ definit coalit concept borrow game theori modifi fit specif properti problem introduc kernel stabil concept coalit format mechan subsequ section base section introduc coalit format mechan support distribut algorithm provid detail method comput section algorithm complex broadli solut maxim payoff specif coalit configur analysi section section introduc develop concept polynomi kernel provid detail algorithm section protocol strategi complement algorithm complex analysi algorithm result simul present section relat dai game discuss section section close paper discuss environ descript protocol strategi research distribut ai divid basic cooper distribut problem solv system research consid effort requir solv problem distribut number modul research ma concern coordin intellig behavior collect autonom heterogen intellig agent ma global global consist global share goal success criteria exist class extrem pole dai research spectrum research fall closer ma pole deal interact ration autonom agent interact agent requir protocol protocol enforc amount commun requir reach benefici agreement protocol contradictori ration individu agent environ heterogen protocol enforc design deviat protocol reveal protocol design agent provid advantag type leav opportun individu agent util resourc strength protocol note situat cooper demand coalit constraint coalit activ trap endless loop reject suggest coalit format protocol regul interact agent specif strategi enabl strength improv individu outcom defin concept coalit coalit limit result coalit format algorithm strategi individu agent fulfil task benefit method agent emploi handl section strategi agent provid strategi forc strategi payoff individu agent satisfi equilibrium requir defin equilibrium varieti definit equilibrium commonli nash equilibrium strategi profil equilibrium singl agent maxim expect util respect strategi entiti follow strategi search strategi space coalit format process comput expect util outcom strategi intract comput limit polynomi time case comput nash equilibria avoid excess time requir search inform evalu leav entiti resourc task execut recogn research approach proce insist cost obtain process inform comput expect util incorpor model main drawback approach vast complex analyt intract bound emploi notion equilibria approxim rule thumb make entiti model preserv greater analyt find wai entiti inform order make combin approach defin concept strategi profil equilibrium entiti inform obtain depth maxim expect util respect strategi bound comput time entiti follow strategi comput expect util outcom action wrt time entiti believ benefici alloc entiti belief action expect util comput bound time entiti act strategi equilibrium note implicitli assum agent prefer acquir benefit necessarili acquir benefit engag coalit provid particip addit effort comput strategi leav agreement benefit equilibrium coalit format environ comput costli coalit benefit entiti form coalit result comput time spent negoti format process benefit point time process accomplish reason amount comput detail necessarili design inform assumpt set comput time depth search strategi design reduc risk avoid benefici coalit format occur benefit form coalit lesser cost excess assumpt definit definit assumpt coalit format approach ffl inform agent task payoff function access agent begin cooper phase access inform costli inform dynam coalit format necessarili access ffl agent commun negoti make agreement commun costli ffl monetari system monei util agent monetari system evalu resourc product ffl resourc monei transfer agent agent reach agreement form coalit monei modifi definit classic coalit format adjust ma requir fa group autonom agent agent provid access resourc exist resourc vector ae ae ae ae quantiti resourc agent resourc execut task outcom express payoff function exchang resourc monetari unit resourc agent attempt maxim person payoff assumpt reason case consist dozen address algorithm present case algorithm coordin hundr agent found specif domain consist ann barbara locat victoria station london map section figur carri passeng cost mile mile insur fee pound dai taxi pound dai penni process fee taxi driver gross incom base rate trip mile end trip driver return profit trip daili profit sum profit singl trip minu insur cost depend cooper coalit format driver transport capabl coalit equal coalit form enlarg domain insur fee satisfi assumpt coalit group agent decid cooper total benefit distribut definit coalit group agent resourc domain coalit quadrupl ae uc nc ae ae ae coalit resourc ae ae quantiti resourc coalit set resourc vector redistribut ae member nc satisfi ae uc hu jn coalit payoff payoff agent redistribut payoff work assum differenti tendenc coalit base tendenc significantli affect result coalit coalit attach game theori function calcul definit coalit ae uc member nc reach joint payoff payoff function agent redistribut coalit enabl agent evalu coalit note specif distribut resourc member coalit strongli affect result reason larger group requir result price drive back consid taxi passeng mile number mile price trip notat uc payoff distribut coalit notat subscript payoff distribut specif coalit payoff affect total coalit payoff case singleton coalit agent coalit agent resourc uniqu specif coalit uniqu uniqu proper resourc redistribut result maxim complex comput depend type payoff function coalit member linear payoff function polynomi function requir approxim method polynomi comput time socal hidden complex hinder coalit format framework assum coalit depend coalit form calcul coalit valu essenti coalit view separ research present result investig futur research game theori depend nc depend negoti distribut environ requir agreement uniqu coalit nc proper protocol forc agent calcul uniqu nc hold case maxim maxim benefici case calcul time constraint assumpt coalit join agent join coalit benefit coalit benefit agent benefit fulfil receiv payoff loss resourc task assumpt call game theori requir payoff agent defin hu payoff vector payoff defin uc payoff vector specif coalit stage coalit format agent coalit configur set coalit fc pair payoff vector coalit configur denot pc assum individu ration method approxim method part unpublish research note number agent small deviat exact coalit valu modifi result coalit format effect stabil configur exact valu calcul avoid comput complex depend explicitli present resourc rest articl exampl calcul valu simul individu ration payment configur denot game defin coalit configur space payment configur space cc set coalit configur pc set pc pc consist pair payoff vector cc cc set fug payoff vector magnitud fug pc infinit space repres payoff payoff vector rang finit set vector lemma cc size magnitud cc order proof straightforward standard combinatori method payoff vector payoff vector domin payoff vector agent specif payoff vector necessarili agent group payoff vector agent prefer payoff vector insuffici evalu coalit present concept stabil issu stabil studi game theori context game develop protocol coalit game theorist concentr stabl coalit form notion stabil develop coalit form coalit format procedur member coalit appli techniqu distribut coalit game theorist solut relat stabil notion stabil notion motiv method measur rel strength particip agent paper concentr kernel solut concept kernel kernel stabil concept coalit configur coalit configur stabl payoff distribut kernel provid coalit configur provid method agent move coalit configur kernel provid method comput payment agent stabl method test stabil specif coalit configur payoff vector coalit format includ dynam algorithm stabil provid kernel import properti seek form incorpor solut kernel pc coalit configur pc stabl pair agent member coalit pc equilibrium equilibrium outweigh common coalit agent outweigh stronger strength refer potenti agent successfulli claim part payoff agent pc detail formal definit kernel provid coalit agent kernel solut concept object payoff distribut attach coalit configur object agent threaten outweigh common coalit object agent make base excess concept recal relev definit definit excess excess coalit respect coalit configur pc defin payoff agent pc necessarili coalit coalit configur coalit coalit definit number excess import properti kernel solut concept specif number excess respect specif coalit configur excess payoff vector result set requir recalcul excess agent excess measur rel strength higher excess correl ration agent search highest excess respect specif maximum defin surplu detail definit surplu outweigh maximum surplu ij agent agent respect pc defin ij max excess coalit includ exclud coalit current coalit configur agent outweigh agent ij ji coalit agent singl agent coalit coalit configur payoff agent compar maximum larger maximum surplu stronger stronger agent claim part weaker agent payoff coalit claim limit individu ration requir mean suggest agent receiv payoff coalit agent outweigh hold condit ij ji ij ji ij ji concept kernel stabil definit kernel pc agent coalit agent equilibrium pc kernel iff kernel stabil concept stabl payoff distribut coalit configur cc provid coalit configur determin payoff distribut coalit configur coalit format agent compar coalit configur check stabil direct agent specif coalit configur coalit format model develop perform direct bargain set solut exist coalit configur cc solut concept empti kernel advantag bargain set properti kernel symmetr agent receiv equal payoff agent bargain strength express ident set gain equal payoff design agent prefer symmetri case agent strength equal receiv payoff agent symmetri solut concept bargain import properti kernel magnitud kernel bargain set subset pc ration subset bargain significantli smaller mathemat formal kernel divid calcul small polynomi simplifi gener exponenti case comput scheme kernel solut stearn present transfer scheme coalit configur arbitrari payoff converg element kernel transfer scheme base possibl infinit number iter case explicitli show size kernel smaller bargain set order magnitud relat specif case set coincid paper present modif stearn transfer scheme modif enabl fast converg finit error agent smaller maximum pass part payoff agent bigger maximum coalit reduc differ approach equilibria method present detail converg proven due select kernel basi coalit format model kernel subset bargain agent kernel protocol prepar bargain set fit kernel world agent successfulli evalu kernel protocol solut concept game detail refer reader game theori literatur find concept adequ distribut coalit format agent multiag environ concentr kernel coalit format model section present coalit format model lead pc strongli base kernel solut concept calcul kernel exponenti complex model present section exponenti case commun comput cheap case small number exponenti coalit format model adequ approach comput pc introduc concept local definit local pareto optim payoff vector hu set payoff vector fu payoff vector hu verbal modifi express special case mean set vector calcul singl mean calcul pair agent import properti pc kernel specif coalit configur pc kernel set pc prove lemma specif coalit configur pc pc set pc consist payoff vector specif coalit configur pc pc pc pc proof pc impli sum payoff agent receiv coalit equal coalit sum element fug set payoff vector correspond coalit configur equal sum coalit valu coalit payoff vector fug payoff agent bigger payoff payoff vector fug vector sum element greater sum element contradict equal membership kernel impli pc element kernel respect pc coalit necessarili respect coalit configur element kernel coalit agent demonstr properti wg coalit valu singl coalit configur payoff vector respect payoff vector correspond coalit configur refer coalit size payoff vector agent protocol distribut cooper model sought present coalit format attempt minim comput commun overhead distribut strictli regul element model part protocol method comput strategi step protocol protocol distribut protocol coalit format agent comput coalit calcul coalit valu transmit agent agent assign uniqu random integ distribut random agent comput coalit configur consist coalit comput coalit find pc comput construct list pc suppli agent step agent merg person pc list list pc joint pc found merg process ffl merg process perform sequenc iter iter agent mod merg pc list agent ffl pc respect merg list found held agent mod ffl merg iter termin agent approach happen ne iter agent make method section pc list construct previou step chosen agent form coalit agent design chosen pc agent involv choic pc transmit agent detail calcul led specif pc pc reveal cancel receiv calcul case process repeat coalit util function resourc comput coalit uniqu discuss section page agent calcul valu coalit yield result properti check valu calcul agent prevent valu agent calcul configur monitor protocol agent transmit monitor put effort reduc complex merg process linear benefit complex mechan exponenti merit reduct reduc comput reduc main overhead distribut approach ma oper commun extrem slow compar comput reduc commun overhead desir properti protocol law incorpor agent design enforc consist penalti case design fail agent deviat protocol deviat agent protocol reveal protocol requir step protocol valu singl agent calcul agent valu reveal assum penalti agent avoid calcul pc calcul win pc reveal check pc cancel avoid pc calcul algorithm section replac algorithm result pc reason comput effort complic calcul easier check agent deviat calcul pc requir achiev part posit probabl pc check agent employ stochast method decid agent receiv random number lead equal expect valu calcul effort calcul equal prior calcul configur size agent predict configur provid largest payoff agent motiv calcul configur size configur easili deviat reveal complet agent result pc distribut calcul comput agent perform part chang comput complex addit commun oper stem distribut requir agent transmit calcul configur coalit format termin process lg result upper limit number requir transmiss configur agent london victoria station park gate oxford st garden sussex figur locat central london method comput studi present comput method detail coalit valu coalit configur calcul coalit requir evalu maxim coalit payoff payoff function resourc variabl effort put maxim function substitut quantiti resourc produc maximum payoff calcul found recal taxi driver driver receiv peopl sussex garden passeng road passeng gate passeng oxford street locat illustr figur typic payoff function coalit cm tran cm member tran number mile transport back base number mile avoid due parallel rout coalit member number transport singl perform due number passeng task coalit insur function size cs cs note payoff function coalit linear maxim simpl requir substitut resourc function coalit ad comput cooper ad enabl avoid mile drive design coalit configur simpler calcul coalit valu comput creation set permut agent avoid repetit number coalit configur greater number coalit valu pc complex comput payoff vector high exponenti order present algorithm perform introduc concept concept intend slightli extend scope kernel small modif vastli reduc comput effort reach pc discuss section comput method reli transfer scheme stearn order present scheme present definit demand function found stearn definit demand function demand function ij agent agent defin ij ij ji ij ji payoff agent agent coalit pc demand function modifi payoff agent order reach pc definit similar definit concept defin model measur differ payoff vector element kernel defin note rout problem polynomi approxim algorithm solut rout problem scope paper definit coalit configur payoff vector ij surplu agent respect agent pc error payoff vector respect kernel largest differ mutual max ij ji agent coalit pc interest size size strongli reli size payoff payoff vector interest measur enabl comparison error respect payoff vector payoff measur provid rel definit pc rel error pc respect defin pc rel error ratio sum payoff agent pc pc rel examin proxim payoff vector kernel algorithm lead pc attempt determin small constant confin process pc calcul defin pc boundari error small posit constant design agent advanc pc comput subject denot definit proce present algorithm comput pc kernel algorithm modifi transfer scheme stearn emploi modifi scheme reach payoff vector transfer scheme stearn converg payoff vector requir infinit number iter order converg algorithm stop finit time modif suggest converg finit number iter implement modifi transfer scheme agent comput payoff vector coalit perform real negoti reach pc algorithm algorithm truncat transfer scheme modifi transfer scheme begin payoff vector iter transfer scheme consist start payoff vector case sum payoff agent greater sum coalit correct initi payoff vector determin strategi agent protocol payoff vector perform wu entail subtract nth differ sum payoff sum coalit payoff calcul mutual demand function respect find demand function greatest ij pass part ff ij payoff agent agent result payoff vector modifi payoff vector form stop return result algorithm iter process stop previou algorithm proce iter respect finit sequenc iter truncat transfer scheme reduct magnitud differ lead converg kernel impli proof iter approach lead initi payoff vector iter depend payoff vector element differ element kernel small detail relationship complex algorithm section lemma transfer scheme perform coalit configur design step protocol comput process present complex complex exponenti comput complex wu correct mean iter transfer scheme singl correct begin iter algorithm stearn scheme deal effici payoff vector paper confin set demand function calcul transfer scheme ff rang ff ij lead ff ij fastest converg transfer found case pc boundari error agent result pc approxim kernel comput coalit valu configur requir comput coalit valu design coalit configur discuss lemma step protocol comput complex stage calcul distribut complex remain comput pc emploi transfer scheme algorithm calcul pc discuss complex iter transfer scheme algorithm construct ffl excess calcul step calcul excess order definit ffl search excess surplu calcul order ffl greatest found oper ffl addit calcul lower complex requir complet iter transfer scheme total complex iter transfer scheme iter perform reach converg transfer scheme reason assumpt number iter order agent payoff partial transfer process number iter converg affect boundari error exact relationship lemma result payoff vector algorithm converg element kernel rel error greater log initi pc rel error proof iter transfer half greatest differ pass payoff agent payoff agent largest differ iter half origin sequenc iter lead magnitud greatest differ smaller initi demand impli log agent approach agent approach approach multipli result algorithm perform element calcul time conclud complex comput due order complex comput divid addit commun order discuss lead format coalit pc kernel result prefer design agent unconstrain time strong comput pc good qualiti agent present game theoret game theoret research section distribut model agent detail method coalit format agent begin singl agent gradual form coalit common game theori agent begin coalit pass coalit configur calcul payoff vector provid distribut approach enabl autonom agent benefit high comput prevent benefici coalit format provid agent cfm radic cut number pc exponenti number polynomi number pc consid respect coalit configur exponenti cfm cfm present reduc cost cfm base negoti agent cfm consist step coalit accept reject creat share resourc task distribut common payoff start agent proce sequenc step section compar case central commun complex stage coalit attempt improv payoff member make coalit format coalit accept improv situat agent involv continu agent reach steadi defin alloc negoti end definit steadi state steadi state agent environ state agent arrang pc condit agent reach agent reach pc benefici transmit agent coalit configur form agent reach steadi state stabl stabil definit anytim algorithm termin limit number step reach steadi agent pc polynomi approach reduct complex calcul pc exponenti polynomi perform polynomi polynomi concept introduc defin polynomi excess excess calcul polynomi set coalit design agent protocol direct agent defin polynomi set coalit order reach suggest design integr constant coalit size rang consid excess calcul valu small size directli influenc order polynomi complex section leav design agent freedom predefin constant freedom enabl develop specif set agent work fit algorithm specif environ agent ks contradictori object base ks accept agent comput polynomi excess order outweigh introduc polynomi recognit configur consid definit polynomi surplu polynomi maximum surplu sp maximum surplu comput polynomi set excess agent polynomi order outweigh examin pc order find definit kernel coalit ij sp ji specif coalit configur arbitrari payoff comput pc polynomi truncat modif converg transfer scheme algorithm step modif entail calcul mutual respect bound constant method protocol section protocol protocol advanc agent coalit configur payoff specif coalit agent find correspond stabl payoff vector converg algorithm protocol provid denot coalit coalit xy protocol negoti protocol preliminari prior agent calcul valu coalit rang size calcul method coalit member receiv member coalit coalit coordin action repres vote detail section coalit iter perform coalit receiv offer destruct ffl transmit target wait detail wait section pr detail joint coalit coalit configur pc consist resourc task redistribut payoff distribut calcul respect payoff vector payoff pc includ coalit remain unchang pc ffl accept rp pr rp send accept messag multipl pair coalit mutual equal pair pair accept ffl pr accept mutual confirm form pr detail coalit repres ffl notifi coalit accept rp send reject messag ap sequenc repeat steadi state reach definit design end enabl percept steadi coalit announc statu announc valid current iter agent run comput time steadi state algorithm termin pc hold stage coalit follow sequenc step stage involv address singl pc payoff lead agent leav previou coalit coalit destruct payoff vector valid point basi futur negoti note agent deviat report limit wait time accept wait agent assum reject earli notif reject benefici wait pai ensur motiv send agent deviat role current coalit make report pc coalit longer steadi state stage end steadi state reach comput time end pc coalit configur calcul addit iter enabl percept steadi coalit announc statu transmit announc stage depend announc stage protocol enforc deviat demonstr address immedi detect agent accept deviat current coalit coalit member follow coalit detect agent wait act deviat immedi detect prohibit send simultan increment payoff agent easili check agent deviat limit destruct coalit avoid stage radic shorten coalit format process avoid comput commun stage number iter steadi state reach stage option stage stage agent addit time comput resourc proce reach pc time end find pc pc complex time constraint stage averag person payoff agent pc averag expect final person payoff stage suffici reason coalit shown result simul perform section design respect relev inform task payoff function agent protocol requir begin coalit agent transmit inform transmiss inform agent report resourc task execut agent report fewer resourc consid valuabl cooper benefit avoid dynam chang note steadi state stage steadi state stage restrict stage infinit loop emerg inform coalit form transmit agent involv agent transmiss agent reveal properti make inform transmiss requir enforc state accept impli accept payoff vector agent chang payoff agent directli involv negoti react iter receiv greater payoff larger coalit gain greater expect payoff agent larger protocol enlarg coalit prefer design agent averag expect outcom observ simul result receiv transport task cooper task execut common payoff cooper requir driver drive drive origin task drive paid addit cost driver order creat coalit illustr implement singl step scheme requir driver decid driver interest form joint coalit driver rank driver suggest strategi expect payoff form coalit estim result order list prefer estim made respect task divid member futur coalit pass addit expect payoff redistribut concentr list observ ds bs er close sg passeng pick passeng trip cooper mutual prefer calcul coalit valu driver design transmit target driver design transmit find stabl payoff vector coalit configur distanc coalit valu join drive mile save insur coalit payoff vector design find payoff transfer scheme set coalit size consid transfer scheme coalit valu condit polynomi kernel transfer scheme lead iter payoff transmit part pad strategi protocol detail protocol requir coalit decid coalit approach suggest strategi strategi coalit comput bound pure nash equilibrium mix strategi nash equilibrium probabl transmiss compact defin refer coalit expect outcom coalit ij bound comput time ij probabl send pc time spent comput coalit configur defin ij probabl pair coalit mutual send offer note ij express mean sum product permut ij detail exhaust minor interest denot number coalit configur exce strategi rank select rank select coalit valu time threshold px coalit coalit perform multipl rank coalit payoff expect member receiv form joint coalit select rank method comput explicitli calcul joint coalit payoff vector calcul complex design complet ii estim expect payoff estim check quantiti resourc coalit examin previou payoff member coalit receiv comput highli rank coalit assign px strategi multipl pr pr set pc comput pr strategi wrt pc put pr pr select pr pr comput ar ar receiv coalit ar comput ar wrt pc pr ar ar ar ar pr design pr design pr pr assign px pr coalit decid coalit send comput ij address select coalit assign ii ij comput ij denot set coalit ca note coalit ca receiv ar network flaw occur coalit decid send coalit iii calcul solut found begin smallest assign probabl ij ij solv set equat pair ij ik ij ij ij ik ik ik il iv associ probabl pr pr randomli pr wrt attach probabl assign px px select benefici offer announc steadi state note number equat probabl comput item strategi greater number probabl strictli mathemat impli solut game finit game equilibrium mix strategi game solut equat detail calcul strategi section comput depend simplest evalu reli payoff stem kernel comput restrict time quota perform addit search solut space show suggest strategi satisfi equilibrium requir show agent deviat comput result introduct time threshold coalit reli inform provid agent comput effort excess comput result miss prohibit coalit format benefit deviat strategi entail addit comput reduct expect coalit follow strategi avoid deviat deviat avoid comput addit comput time threshold benefit risk type deviat avoid belief expect util wrt time agent deviat strategi agent follow show explain agent follow smaller smaller set equat simpler solv note solut equat probabl carri strategi order comput probabl comput set equat select method provid strategi case superior simpl superior accept equilibrium strategi accept choic expect benefit irrat behavior superior inferior select case inferior probabl comput strategi result equal expect util pr pr agent follow strategi coalit follow strategi mix strategi nash equilibrium time constraint coalit make state protocol agent design send coalit agent vote method order make coalit design select fit agent comput capabl vote strong agent comput prefer vote result requir extens comput design attempt minim agent comput commun prefer agent elect repres perform coalit comput reduct varianc distribut calcul member coalit achiev replac repres iter calcul distribut homogen advantag repres role distribut design method prevent situat agent act reach conflict situat avoid cooper vote select design comput coalit select prefer result vote method repres design adopt repres approach agent accept repres job addit forc protocol accept role design adopt repres agent coalit repres vote method exampl note vote suggest result differ due tendenc ration agent comput save time effort part agent negoti reach reason agent deviat vote algorithm consid absent vote structur design part protocol gener coalit design current coalit denot coalit design transmit coalit receiv coalit denot suggest strategi design strategi design design joint coalit respect protocol current pc coalit task payoff function pc coalit perform ffl calcul coalit ffl quit design specif ffl jc retriev store memori previou call calcul store futur ffl calcul payoff vector pc form remain algorithm current payoff vector current input polynomi subject ffl compar current pc stop design specif note calcul coalit restrict payoff function low polynomi complex polynomi linear function linear complex recal design payoff vector transmit part full includ coalit configur resourc task redistribut redistribut reduc drive parallel rout os continu sg pick return add unit distanc os sg unit drive back chang enabl complet origin task trip passeng requir drive ds passeng left requir trip avoid trip sg back save unit distanc net reduct distanc unit reduct affect ds total express coalit strategi requir check proce calcul coalit valu coalit size method valu coalit calcul polynomi payoff vector algorithm begin current payoff result payoff vector transfer scheme pc boundari error result compar current pc calcul pc current pc send wait time predefin time period wait pr wait wait wait time commit answer receiv wait oblig respect pr expir wait time protocol simpli enforc case deviat harm report affect enforc coalit wait wait lose good opportun cooper benefit cooper wait design agent complex analysi complex refer stage design complex strongli affect differ agent comput polynomi set coalit valu coalit configur complex calcul order number coalit consid relat hold exponenti case number coalit consid wait respect assumpt design network latenc wait greater expect averag prefer greater agent wait unrealist amount time calcul coalit express polynomi order sum constant number largest order sum requir comput coalit coalit valu requir design coalit configur number coalit configur comput depend time constraint part strategi configur comput iter number part strategi emploi coalit pc calcul algorithm iter algorithm construct ffl state payoff vector specif coalit coalit excess excess calcul calcul excess order definit ffl coalit excess search excess surplu calcul order coalit ffl greatest found coalit oper ffl lemma result payoff vector algorithm converg element rel error greater log initi pc rel error complex iter algorithm coalit refer case time algorithm perform coalit configur protocol iter distribut comput agent reduct complex factor complex coalit comput case time strictli complex coalit comput commun complex order coalit proce option number coalit configur depend time constraint upper limit order stabil calcul configur remain polynomi stage cheap term comput reach pc perform contradictori exponenti low cost stage encourag cooper coalit format simul result develop simul tool examin perform note simul restrict form strategi rank phase perform reduc comput complex tool run varieti agent result summar simul present coalit form ac payoff vector negoti continu coalit payoff vector result simul result achiev limit limit result obtain run result depend order offer negoti error increment reduc comput pc test perform respect constant set perform hundr run simul result report averag algorithm simul process polynomi payoff function assumpt independ resourc linear payoff function comput complex led constant rang simul run reach exponenti solut number agent small comput coalit drawn resourc valu wrt uniform normal check case valu artifici shift linear payoff distribut coalit valu similar resourc valu coalit simul rang found extrem uneven distribut larg view stage suffici reach benefici stabl coalit order suggest base rank prefer vice versa ac prefer suggest mean coalit consid excess comput intract figur number agent particip coalit averag coalit differ detect evolut perform simul coalit format run simul provid averag dozen run shown simul reach stabl pc reason time stage found set continu improv agent termin halt artifici main result simul averag coalit number agent particip coalit monoton function averag potenti coalit valu averag coalit valu figur paramet agent join coalit analyt result logarithm function figur observ number coalit member linearli respect averag coalit result unresolv conflict present environ conflict prohibit format coalit examin exponenti curv fit error curv greater obtain logarithm curv prohibit exist fit figur format coalit agent excess benefit result cooper grow function number coalit format case cooper coalit format agent benefit observ addit util respect util grow function number coalit format mean benefici form format coalit averag benefit expect due individu ration agent time coalit format bound ks exponenti function number agent result support simul result present observ graph figur expon hold case bound ks quadrat curv fit result simul low error system agent implement intel comput time agent approxim minut reason time implement transport present system comput time agent minut time long implement implement model faster machin optim simultan reduc comput time order benefici coalit format enabl choic payoff function resourc produc coalit valu valu larger coalit greater valu smaller figur time coalit format bound ks low polynomi curv fit result quadrat case implement shown simul reach stabl pc reason time small stage found set continu improv agent termin halt artifici good coalit format model ma environ relat work dai game theori research appli modifi game theori techniqu dai environ discuss relev work distribut ai dai research work complex subject construct agent cooper task individu benefit system benefit ma agent assum achiev goal maxim person payoff agent assum common goal maxim system global payoff present ma refer design control agent ma case labor negoti sycara present model combin reason optim util sycara deal pair agent conflict discuss multipl agent necessarili conflict gasser social aspect agent knowledg action system human social mechan dynam emerg commun program modifi codifi local languag interact gasser approach effect agent interact environ interact continu evolv domain research social interact agent design coalit format protocol krau al provid autonom agent negoti mechan enabl cooper negoti reach agreement work deal time constraint effici result agreement agreement involv grand coalit form conflict agent prevent agreement prevent case cooper benefici agent suggest algorithm format member cooper person payoff krau time includ payoff function research explicitli introduc time time consid restrict factor research zlotkin rosenschein concentr definit illustr class domain initi work concentr cooper pair agent recent work coalit format explicitli dealt discuss special case domain domain correl environ coalit format environ discuss ketchpel work discuss design agent explicit mechan multipl agent sandholm lesser develop coalit format model bound ration agent present gener classif coalit game coalit depend comput configur coalit consid comput stabl solut problem comput time coalit valu polynomi concentr polynomi number coalit configur util distribut provid polynomi concept stabil ephrati rosenschein suggest format coalit agent format perform vote mechan work format coalit consist necessarili emploi negoti mean coalit format closer ma work sonenberg al deal joint introduc languag present central approach team format team format procedur format process dictat team leader team leader send joint joint role plai potenti team particip approach offer team particip agent individu motiv present distribut algorithm agent free design transmit coalit format game theori state game theori wide dealt coalit discuss stabil benefit algorithm format find public relev work solut game stabil partial discuss interest dynam approach coalit format refer dynam coalit format method differ work contribut dai approach present dynam theori bargain set found stearn stearn present method player game enabl start arbitrari payoff coalit configur vari stearn reach stabl payoff configur kernel section bargain set work concentr provid method specif coalit stabl payoff alloc provid method enabl agent begin initi coalit configur proce model coalit benefici interest stabl payoff adopt stearn approach modifi algorithm adjust ma order gener payoff alloc coalit configur modifi transfer scheme enabl construct coalit format transfer scheme build block main defici dynam theori bargain set dynam limit deal sole situat coalit configur payoff transfer coalit configur chang real dynam coalit configur insepar part situat research main focu work evolut coalit configur context dynam theori find work wu wu present transfer scheme converg core interest properti wu model implicitli pass coalit configur necessarili concentr specif coalit configur properti essenti model transfer scheme lead point core provid algorithm pass coalit configur pass point core model necessarili lead coalit configur reach model specif step reach coalit configur step model zhou present bargain set coalit payoff vector answer game zhou predict coalit form situat bargain set predict coalit configur bargain set coalit configur form zhou provid dynam algorithm format coalit zhou bargain set endogen answer question coalit format payoff provid answer coalit form procedur lead answer work concept coalit stabil introduc coalit stabil introduc work determin happen coalit interact possibl happen defin gener type stabl similar von stabl defin condit set outcom individu outcom approach fit requir individu ration agent kernel serv basi coalit format algorithm limit tu game limit stem necess pass part excess reach stabil introduc reinterpret kernel result kernel solut concept game import addit kernel includ specif implement concept autonom agent common game main issu stabl configur singl agent act order reach outcom coalit context game theori discuss discuss approach coalit concentr core bargain specif consist cooper coalit theori discuss kernel provid method coalit format studi coalit format present discuss solut concept properti research coalit form payoff assign agent discuss coalit format process action singl agent part recent research game theori discuss game reach agreement approach repeat game fairli coalit format grand advanc game theori provid good basi address issu import explicit protocol strategi agent form coalit coalit format import execut task maxim payoff autonom agent environ coalit format algorithm reach stabl pc reason time period reason comput effort gener problem exponenti develop exponenti algorithm reach solut modif reduc complex polynomi order algorithm present lead coalit format payoff coalit member distribut algorithm agent stabl coalit configur payoff vector instanc small number agent time comput cheap solut coalit format environ distribut agent suffici comput resourc instanc number agent larg ten comput costli time limit model lead coalit format polynomi time polynomi amount calcul abil reach low complex due approach present polynomi lead distribut calcul commun vast reduct comput complex anytim halt negoti agent set form coalit defici polynomi time pc reach calcul coalit configur cc polynomi method find import advantag algorithm averag expect payoff agent function time effort spent agent perform step option cooper benefici improv payoff distribut advantag proven simul perform model present suitabl environ restrict environ coalit format algorithm dai gener model make applic handl autonomi requir decentr ration inform agent present method terminolog knowledg coalit format inform minor coalit format enabl benefici inform gather remot respect autonomi requir repres comput agent form coalit major solut concept present game present detail method individu agent act order form coalit person payoff give exampl illustr model show applic due algorithm adopt design agent agent cooper form coalit order benefit environ refer editor handbook game theori econom applic elsevi scienc bargain set cooper game advanc game princeton press collect coin robust vote game minima banzhaf valu proc ieee symposium foundat comput page bond gasser analysi problem research dai bond read distribut artifici page morgan kaufmann san coalit stabil journal econom se vr ra meyer multistag negoti distribut satisfact ieee transact special issu distribut artifici decemb shehori coalit format power transmiss plan environ davi kernel cooper game naval research logist thoma dean mark boddi analysi plan page st ephrati rosenschein clark tax consensu mechan autom agent proc page ephrati rosenschein plan dynam search social consensu page friedman game theori applic econom oxford gasser social knowledg social action page mr ml rosenschein cooper commun proc nation confer artifici page hart model bargain discuss paper center ration interact hebrew jen control cooper problem solv industri system joint intent artifici intellig theori coalit format lawrenc erlbaum ketchpel form coalit face uncertain reward proc page klusch shehori coalit format ration inform agent van de veld lectur note artifici intellig agent break page klusch shehori polynomi coalit format algorithm ration inform agent proc page zlotkin multiag negoti time constraint artifici luce raiffa game john wilei nash equilibrium point game nation academi page von neumann morgenstern theori game econom behavior princeton kernel game canadian journal mathemat game theoret analysi vote cambridg behavior long finit live journal econom game theori rosenschein zlotkin rule design convent autom negoti comput mit anytim coalit structur gener proc sandholm implement contract net protocol base margin cost calcul proc page washington sandholm lesser coalit format bound ration agent proc page reinterpret kernel technic report brown dept game theori econom rand santa shehori krau coalit format autonom strategi complex castelfranchi lectur note artifici intellig reaction page shehori krau cooper commun proc page shehori krau model gener implement result proc page bargain set coalit format technic report brown dept rao plan team activ technic report australian artifici intellig stearn converg transfer scheme game transact american mathemat sycara argument negoti theori coalit approach cooper technic report brown dept wu dynam theori class game nonempti core siam journal appli zhou bargain set game endogen coalit format game econom zlotkin rosenschein mechan coalit format task orient domain proc page
Agents/1606 1 la ricerca povo itali transact orient comput model system bailei busetta decemb technic report istituto di limit distribut notic report itc copyright accept public issu technic dissemin content view copi tot distribut public limit peer commun materi form author copyright owner transact orient comput model system ramamohanarao depart comput scienc melbourn australia jame bailei depart comput scienc melbourn australia paolo busetta itali novemb abstract bdi matur commonli adopt architectur intellig agent current comput model adopt bdi number problem concurr predict hinder construct agent robust predict behaviour conceptu practic tool build depend agent resili fault unexpect earli stage research idea establish technolog adjunct bdi agent system long envisag layer model distribut system develop upper call consist concept techniqu agent research lower call base tradit comput technolog implement action decid upper layer emphasi upper behaviour layer flexibl softwar develop order effect applic domain difficult rapidli chang main focu lower control layer rigor effici implement boundari discuss develop agent system comput model correct criteria hardwir robust behaviour agent defin notion correct exist semant level verif undertaken desir level abstract introduct intellig agent activ area ai research possess high potenti practic applic area rang interact inform system activ network agent architectur bdi matur adopt number research industri applic bdi agent autonom entiti work team react chang condit formal definit research gener comput program call ration dynam partial unpredict environ show characterist oper continu social interact agent possibl percept world insid act react quasi behaviour reactiv driven intern initi bdi architectur product number applic rang air traffic control air combat telephon call centr handl malfunct nasa space shuttl bdi approach base studi mental attitud tackl problem tradit plan situat requir reactiv belief repres inform state bdi world desir goal motiv agent achiev typic bdi agent procedur knowledg constitut set plan defin sequenc action test perform achiev goal react specif situat intent repres delib state plan agent chosen eventu execut addit characterist social reactiv argu agent possess addit properti robust predict current comput model adopt bdi problem concurr control gener hinder construct agent robust predict behaviour conceptu practic tool build depend agent resili fault unexpect earli stage research architectur lack paradigm concurr control intent perform conflict manipul set belief time problem resolv write polici addit write meta plan discov handl race condit challeng task potenti duplic effort softwar engin point view import featur miss bdi architectur except handl mechan prescrib report fault infrastructur agent team happen asynchron execut intent left applic develop provid adequ failur detect recoveri mechan argu current bdi architectur lack adequ comput model express activ agent perform time relat task move agent host analog checkpoint disk recov trivial world chang meantim state account agent issu belief agent goal intent move import architectur exist languag resolv issu engin larg agent system difficult task bdi architectur multipl agent multipl thread complex design system place high demand programm anecdot evid suggest facil full programm resort program style close rememb rule write tradit eca singl rule time schedul execut atom style dramat simplifi analysi behaviour lack adequ comput model hard understand control idea establish technolog adjunct bdi agent system long envisag layer model distribut system develop figur upper call consist concept techniqu agent research lower call base tradit comput technolog implement action decid upper layer emphasi upper behaviour layer flexibl softwar develop order effect applic domain difficult rapidli chang main focu lower control layer rigor effici implement boundari reliev programm burden explicitli write code handl concurr recoveri behaviour control manipul inform base action mental attribut abstract data technolog type algorithm framework bdi architectur oo program relat layer compet mechan repres figur layer model distribut system background bdi agent architectur figur extract show basic compon typic bdi agent belief repres inform state world desir goal motiv agent achiev typic bdi agent procedur knowledg constitut set plan defin sequenc action test step perform achiev goal react specif situat intent repres delib state plan agent chosen eventu execut agent react gener modif addit goal messag arriv extern world event invok agent commit execut intent intent execut step time step queri chang perform action extern suspend execut condit submit goal oper perform step gener event start intent intent succe step fail condit guard execut test action perform report agent appli set default polici select plan schedul activ overridden user defin invok mechan plan import case intent agent reconsid reason commit intent agent examin trigger case default polici success sign goal standard polici select execut plan altern point goal consid unachiev automat mechan deal environ lack accur inform time plan similar case bdi abstract architectur famili parallel distribut environ sensor effector ka librari monitor interpret intent structur goal gener command figur bdi agent structur system acid transact discuss concept transact process descript base tradit transact process system prevent inconsist integr problem satisfi acid properti durabl atom mean transact oper perform consist mean transact maintain integr constraint object manipul isol mean transact execut run concurr transact durabl mean made successfulli termin commit transact surviv subsequ failur acid properti defin abstract comput model transact run failur programm focu develop consist handl concurr failur deleg underli engin describ scenario run remaind paper scenario simul airport runwai air traffic control agent arriv aircraft arriv aircraft notifi current posit earliest arriv control runwai land aircraft notifi emerg requir prompt alloc earliest time desir runwai nest transact nest transact extens acid transact idea break normal acid transact main transact number subtransact invok subtransact invok subtransact set transact root descend form famili nest transact framework execut underli semant intent nest combin automat mechan goal provid flexibl framework manag partial failur figur show nest transact subtransact doesnt durabl acid transact subtransact action descend perform sibl parent affect begin work invok subtransact invok subtransact commit work begin work commit work begin work rollback work begin work invok subtransact commit work begin work subtransact begin work commit work begin work invok subtransact commit work invok subtransact invok subtransact invok subtransact commit work tk subtransact transact figur nest transact model figur show nest transact insid singl agent return plane enter airport send messag air traffic control agent request land slot agent control execut plan top level transact goal arrang slot book plane top level transact carri plan transact work schedul find free slot lock entri data structur record slot usag plan transact send messag pilot aircraft confirm offer slot plan transact write record interact control pilot log file plan fail agent unabl find free plan examin runwai length failur transact root transact subtransact subtransact subtransact transact plan transact plan plan transact plan transact figur nest transact insid singl agent altern plan plan search runwai length launch subtransact plan obtain free slot plan plan transact fail pilot decid doesnt land airport transact includ constraint plan transact fail abort transact rollback plan effect free slot entri lock earlier observ agent run transact concurr transact event arriv aircraft request runwai slot handl concurr automat transact manag explicitli write code check intent exist separ top level transact hold lock slot data lock slot runwai length lock slot runwai length transact explicitli awar semant intent advantag term program intent safe abort transact system deadlock agent appli techniqu face emerg situat forc execut higher prioriti activ similar mechan agent mobil transact transact scheme discuss section error transact execut result transact back initi state disadvantag action agent roll affect state real world longer undon inappropri model subtransact accompani transact job perform similar failur occur return aircraft section constraint slot reserv plan confirm receiv pilot pilot assign slot prefer happen nest transact model pilot minut respond confirm request plan plan fail transact fail includ constraint plan transact rollback plan transact conform desir semant solut user defin entiti transact effect agent state constraint hold constraint depend goal agent possess transact transact logic undo altern action definit transact fail return logic top level transact sequenc transact execut plan reserv sequenti execut subtransact execut plan transact plan logic receiv confirm time fg reserv plan kei point rollback plan longer automat occur plan fail condit time desir transact addit flexibl model depend failur action transact exist type action kei question type transact defin transact discuss perspect action nest transact top level transact transact section describ techniqu transact chop model execut plan give rise difficulti addit challeng rollback type action difficulti lock object held durat transact case transact consequ lock durat transact result content resourc transact wait access execut entir plan transact suffici dynam chang effect transact visibl transact complet address issu perform interact techniqu transact chop chop transact idea system theori shorten transact singl transact automat seri smaller transact smaller transact run perform potenti separ problemat interact transact rework run plane enter airport send messag air traffic control agent request land slot agent control execut top level transact subtransact find confirm slot pilot subtransact assign dock bai plane final land complet complet execut subject lengthi pilot confirm land slot time manner solut case chop separ run independ concurr techniqu transact chop provid autom techniqu achiev transact chop potenti product plan desir goal user point transact requir system automat chop origin transact merg addit transact activ observ agent system common technolog activ rule evalu dition perform action event rule execut welldefin transact context direct research includ integr activ technolog agent technolog intent identifi featur agent languag translat level form activ retain desir semant correct properti emploi method activ rule analysi assist analysi higher level relat futur work previou work design languag bdi agent flavour ai commun tend oper independ research ai tend excit featur whilst work aspect predict lag previou work formal attempt undertaken develop transact orient system result proof concept system bdi agent architectur nest transact model core framework programm select underli semant intent nest acid transact polici analyz prototyp toma specif program languag tool system analysi develop area investig extend idea design implement agent languag base extend transact notion correct system exhibit properti reliabl predict acid transact combin agent work present plan agent creat transact possibl cooper plan agent work joint goal tree simpl agent encapsul acid transact tree control paramet control flow rule connect includ transact event failur plan achiev origin goal subgoal tree pass execut perform action tree order control system appli distribut action agent consist queri updat work extend transact model cater workflow applic relev doesnt directli address model bdi agent hope line work paper promot cross result disciplin relev work identifi correspond bdi agent activ rule evalu condit perform action event similar agent method behaviour activ rule highli desir seri paper present fundament result rule rang decid issu approxim method base abstract interpret summari transact notion design bdi agent transact understood commun possess acid properti design understand semant execut correct notion exist semant hardwir robust fault toler behaviour agent plan nest transact provid good facil execut agent plan situat transact granular loss discuss plan transact chop refer ramamohanarao structur issu activ rule system sixth intern confer lnc page ramamohanarao decid undecid result termin problem activ rule acm symposium principl page ramamohanarao activ agent system comparison intern workshop rule lnc page bailei express issu problem activ rule intern confer theori lnc page bailei abstract interpret framework termin analysi activ rule intern workshop program languag lnc page bailei dynam approach termin analysi activ rule lectur note comput scienc intern confer comput logic bernstein newcom principl transact process system morgan busetta transact base architectur master depart comput busetta architectur mobil bdi agent acm symposium appli comput acm februari march extend version technic report depart comput georgeff ingrand make reason system intern joint confer artifici grai reuter transact concept techniqu morgan kaufmann khale model simul cooper transact environ workshop infrastructur system scalabl intern confer autonom agent june ramamritham pano chrysanthi advanc concurr control transact process execut ieee comput societi anand rao bdi agent speak logic comput languag european workshop model autonom agent lnai januari anand rao michael georgeff abstract architectur ration agent swartout rich intern confer principl knowledg reason san morgan kaufmann publish valduriez transact algorithm perform studi acm transact yoav shoham program artifici wooldridg jen intellig theori practic knowledg engin
Agents/1607 1 draft classif scheme negoti electron commerc lomuscio michael wooldridg nichola jen depart comput imperi colleg technolog medicin london unit kingdom depart comput scienc liverpool liverpool unit kingdom depart electron comput scienc southampton southampton unit kingdom abstract year wit surg commerc oper internet current electron commerc system electron catalogu user product predetermin inflex term condit year gener electron commerc system base autom negoti identifi main paramet autom negoti depend show applic classif repres sampl promin negoti model exist literatur research support epsrc grant previou version work paper benefit comment anonym draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft introduct hard work paid paper accept confer review smile quickli worri read instruct venu marina del popular tourist resort expect busi confer book flight earli hour effort find reason fare latest shop agent talk launch quickli menu enter person detail prefer flexibl date partner join dai confer half hour receiv report standard fare flight avail good fare travel immedi confer avail limit economi fare includ report special arrang negoti behalf airlin comput system cost discount standard price obtain fly dai confer discount offer regular unexpect lack demand date ticket paid full dai cost discount standard price offer negoti offer bui seat negoti return flight major improv small load factor view annual gener meet offer special condit multipl ticket paid full hour cost offer charter airlin ticket book immedi fare discount obtain pai immedi futur travel airlin financ major restructur oper flight advanc contact warn airlin histori delai cancel flight draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft decid option instruct put seat hold confirm tomorrow save search quit program start electron commerc term gener denot advanc step modern commerc figur buyer seller replac electron entiti wide believ reduc cost provid custom bargain tool autom exploit contract combinatori complex set extens comparison perform wide varieti good natur task involv suggest agent technolog plai import role develop agent plai role mediat inform provid agent autom part busi task involv current applic classifi system server connect internet user catalogu commod compact comput make typic mean credit card transact case system client basic internet browser user reduc limit advanc form gener countless introduc main featur frequent call shop abil perform merchant broker behalf user merchant broker stage consum bui behaviour buyer chosen product deal shop assist firefli offer servic earlier transact buyer product broker stage stage consum bui behaviour made product buyer advanc shop notabl attempt follow buyer phase transact perform product merchant primit form negoti kei problem system aspect price price main stage consum bui behaviour broadli thought product merchant payment servic evalu detail consum bui behaviour draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft case custom price concern aim acquir maintain regular whilst custom interest aspect deliveri track record vendor cope advanc form shop assist requir softwar deal complet rang issu relev user complex shop assist emerg user paramet price travel qualiti number max connect flight fair import paramet price paramount assist user bid price date form tradeoff paramet present face reach agreement varieti human make negoti autom negoti domin mode oper shop assist agent autom negoti significantli reduc negoti time larg volum transact small amount remov human engag negoti embarrass negoti receiv great deal attent system commun past decad develop practic autom negoti facilit develop shop assist perform negoti behalf user negoti strategi properti depend heavili specif characterist scenario economist game theorist distinguish scenario good common agent typic good privat differ agent agent agent good common differ agent valuat common knowledg privat illustr paramet negoti mechan crucial depend paramet plai kei role shape negoti principl aim paper defin negoti space electron commerc aim identifi paramet classifi negoti mechan electron commerc classif import step develop sophist shop assist defin delimit design space agent interact classif paper analyt point view offer practic aim provid draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft conceptu framework protocol strategi negoti classifi reason argu compon negoti space identifi constitut complex space unabl find distinct negoti scenario manner classif illustr taxonomi classifi number promin model autom negoti gener literatur subject remaind paper structur section discuss classifi main variabl negoti electron commerc depend section classifi number refer literatur taxonomi conclud section discuss futur direct autom negoti negoti space autom negoti involv design protocol agent interact theme negoti present field definit literatur scope paper discuss merit simpli adopt negoti process group agent commun reach agreement matter common interest basic compon import design automat negoti negoti protocol negoti strategi specifi encount negoti particip protocol defin circumst interact agent deal made sequenc offer agent reach agreement negoti protocol negoti proper begin reach agreement negoti strategi process agent negoti strategi specif sequenc action offer agent plan make negoti strategi compat produc outcom agent round bargain hard negoti privat timeout reach negoti strategi agent emploi critic respect outcom negoti clear strategi perform protocol necessarili choic strategi function specif negoti protocol draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft negoti mechan consist negoti protocol negoti strategi agent involv properti gener consid desir negoti mechan comput ideal seek negoti mechan effici user constantli faster scope negoti algorithm commun thing mechan handl commun agent effici broadcast agent ideal respect individu mechan individu ration agent involv agent independ interest particip negoti ration agent group util made compon agent privat util distribut mechan distribut comput agent involv prefer server perform comput system prefer includ desir avoid disrupt effect singl point perform bottleneck pareto outcom pareto effici outcom improv lot agent make agent thing pareto effici solut prefer broad guidelin mechan design mechan depend specif characterist negoti set negoti game section investig space detail order separ kei orthogon compon paramet negoti space design negoti scenario crucial depend number gener space negoti scenario preliminari attempt classifi space wurman al care comput complex design negoti strategi compar complex execut strategi usefulli carri offlin reduc comput cost agent carri manag draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft identifi variabl auction server design paramet introduc present concern classif gener divid paramet negoti place broad cardin agent environ good event inform alloc paramet agent negoti strategi simpli characterist structur characterist protocol detail kei paramet inform alloc protocol result definit discuss paramet classif detail point understand classifi literatur mechan discuss criteria similar classif obtain find describ adequ task cardin negoti distinguish cardin negoti domain interact negoti domain negoti thought simpli set tupl agent negoti tupl repres issu agreement made element tupl correspond issu deliveri case negoti issu tupl singleton case issu relat publicli util function make process bid formul easier agent comput util function agent involv negoti interact agent classifi term number agent particip negoti negoti draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft agent negoti import theoret practic reason import technic difficulti appar simpl set game result negoti proven multipl equilibria naiv applic tool import emerg role relat scenario negoti agent negoti standard set popular internet time agent plai role plai role buyer set seller case price comparison engin negoti agent negoti constitut complex scenario continu complex scenario notic negoti determin simpli number agent conceiv larg set arrang negoti place basi agent characterist agent comput entiti particip negoti process agent assum capabl rate evalu deal agent depend social bid strategi agent interact negoti continu role plai negoti negoti buyer seller lead intermediari import role ration model perfect bound assumpt perfect ration gener amount agent perform arbitrarili larg comput constant time practic scenario draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft agent abil perform forc bid withdraw basi finit comput negoti model assum perfect ration game approxim model explicitli assum bound ration realist agent knowledg good bid possibl knowledg agent good depend knowledg agent bid strategi agent hold privat inform crucial import design agent bid strategi intern valuat oppon util function import paramet agent strategi level commit present made agent oblig stop bid similar good accept counter offer receiv agent mechan process contract built origin negoti agent act individu altruist unit strike balanc plai distinct entiti effect pursu order deal conveni agent bid strategi ultim compon decid place accept make counter offer withdraw negoti conceptu independ reason imagin bid strategi relat social behaviour agent standard assumpt agent individu bid strategi accept deal result enter deal environ negoti environ static dynam static environ variabl price import constant dynam environ chang time static dynam environ simplif dynam environ affect design util function agent subtl util function agent reflect static imagin agent learn process maintain fix util behaviour produc posit payoff dynam environ characterist good crucial defin negoti draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft natur good agent good differ depend intend privat depend agent privat public valuat plai part bui car prefer car preserv time case interest sell object negoti discret continu set negoti deadlin complet negoti set time continu simplif made respect granular countabl finit set deadlin depend fine model simplif reduc size negoti space simplest case set singleton event paramet negoti protocol influenc wai offer event place negoti regul form import part specif protocol negoti distinguish bid bid clear schedul quot schedul item specifi import part criteria valid bid bid offer time satisfi constraint english auction bid made auction call bid progress higher procedur place bid present negoti visibl bid relev case negoti bid privat messag pass buyer broadcast agent configur subset agent select messag coalit format event produc alloc buyer seller clear schedul random time event offer match buyer bid phase english auction round termin draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft temporari alloc good auction prospect buyer meet auction call timeout determin close transform clear final agreement buyer seller transact clear timeout depend alloc paramet quot gener negoti number frequenc part event regul excess number request quot significantli slow negoti mechan inform paramet inform bid pass negoti particip messag inform buyer seller reach inform limit produc agent bui sell good messag benefici order save comput time agent distinguish price transact argument quot gener seller request prospect buyer indic price seller start negoti reduc negoti time similar mechan place case seller bid buyer histori similar transact seller agent order give credibl inform offer potenti buyer agent trust transact histori form basi negoti protocol aim bridg gap negoti perform human artifici societi expert human negoti focu reason offer accept persuad counterpart characterist agreement includ artifici negoti offer counterpart explicitli motiv agreement sever limit limit flexibl negoti accompani argument form provid import contextu inform assist deliv requir good quicker order final leav pai price good time sold lower draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft alloc paramet alloc paramet appli scenario govern winner auction agent shown interest good alloc studi auction theori mth price alloc polici cover number receiv bid note negoti order mechan work commonli function issu produc util order offer requir alloc polici appli classif scheme dimens autom negoti section seek demonstr efficaci classif framework number promin negoti model framework exemplar model chosen provid repres sampl work autom negoti aim provid exhaust classif extant demonstr model typic extrem valu kei dimens classif scheme exemplar model show classif scheme group seemingli dispar model similar differenti seemingli similar model differ negoti cooper domain influenti paper zlotkin introduc formal task orient domain encount tod tod incorpor set task agent monoton cost function subset task encount tod distribut task agent pure deal encount redistribut task zlotkin start assumpt agent util cost studi properti monoton concess protocol oper space deal individu ration agent deal initi pareto optim negoti proce round agent suggest deal util agent favour util offer deal offer previou round negoti termin agent happi deal reach agent fail agent benefit deal result agreement draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft zlotkin al extens properti negoti strategi strategi respect strategi base loss agent suffer reach step negoti agent defin risk risk risk util util util util denot deal agent time util denot util deal agent index refer strategi work round agent offer deal negoti set round agent calcul risk risk risk risk agent minimum deal risk balanc agent present nash mean agent benefici agent strategi reason step risk agent strategi benefit reli agent make concess extens extend extend strategi termin nash equilibrium product individu util view offer section cardin negoti domain space task agent set task assum finit set agent negoti subset set negoti domain base singl issu negoti algorithm design interact agent characterist agent homogen role buyer seller agent reach agreement redistribut task domain bid strategi emploi extend strategi agent assum perfectli assum comput negoti domain enter negoti assum comput util subset task constant time draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft agent perfect knowledg agent util function comput util agent offer agent total commit negoti process deal pull back restart negoti agent global benefit consequ specif characterist negoti domain protocol agent team format good task domain public util function agent domain task public negoti carri set natur discret event paramet valid offer regul monoton concess protocol negoti run bid visibl clear schedul present quot applic inform paramet price quot present agent comput util agent arrang negoti space negoti histori past negoti consid agent assum perfect recal negoti alloc paramet alloc paramet applic result proven set extend book scenario incomplet inform circumst domain negoti affect negoti strategi studi incomplet inform studi strategi privat util discuss negoti cooper domain wooldridg al solut common industri factori product sequenc problem involv manufactur plant decid sequenc process satisfi current factori cost state orient domain wealth orient domain introduc review draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft product sequenc treat negoti product cell factori negoti product sequenc order distribut cost total factori cost algorithm wooldridg al extens monoton concess protocol strategi negoti proce agent activ part deal deal make agent negoti end successfulli negoti proce subset activ agent agent deal repres case agent unabl make make case agent agent exhaust set deal case plai part negoti agent round put forward deal round negoti proce agent possibl find deal order select deal agent initi put forward prefer deal agent put forward deal previou round order decid agent concept strategi idea agent risk risk risk agent time comput risk util util util denot deal agent time util denot util deal agent agent put forward identifi deal comput set deal improv lot make agent comput set deal improv global draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft find prefer deal suffici chang balanc risk agent subsequ wooldridg al prove algorithm show appli product sequenc problem techniqu ultim provid rule thumb effici negoti difficulti find negoti techniqu stem fact negoti occur agent extens case agent work report previou subsect paramet cardin interact bid strategi negoti time constraint krau al number problem relat resourc alloc task distribut ration autonom agent approach differ present import passag time negoti motiv reason symmetr scenario resourc passag time cost parti involv beg question research mechan quickli converg agreement scenario symmetr negoti time cost agent benefit author make formal machineri provid game theori differ make assumpt agent give relev negoti histori comput offer import assumpt line krau al make altern offer protocol author concern design protocol enjoi properti stabil section crucial tackl issu instantan negoti cost negoti end quickli possibl round krau al provid analysi famili negoti share characterist assumpt made discuss agent step agent activ negoti agent ration util krau al focu agent complet inform negoti share altern deal case agent negoti resourc present control draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft agent complet inform negoti common altern deal agent complet inform negoti share access altern deal agent incomplet inform negoti share access altern deal agent complet inform negoti common altern deal view taxonomi present section made cardin negoti singl issu agent agent fulli fulli act buyer seller bid strategi level knowledg vari depend scenario good good public alloc paramet applic context turn detail scenario discuss author agent perfect inform negoti share altern deal complet inform assum util function agent main condit disagr worst outcom time valuabl agent natur good assum continuum krau al prove exist perfect equilibrium strategi termin negoti process round agent perfect inform negoti common altern deal case differ agent assum empow pull negoti agent technic condit agent util function scenario refer reader paper draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft good assum discret natur number report made converg mechan disagr worst outcom time action good costli opt deal costli time ad converg detail found author prove agent perfect equilibrium strategi agreement reach round negoti agent perfect inform negoti share access altern deal standard asymmetr scenario agent gain lose set present condit disagr worst outcom condit agent gain time lose introduc term negoti cost author show threat weaker agent pull negoti end round maximum agent incomplet inform negoti share access altern deal essenti point discuss requir complet inform relax incomplet inform game complex requir shift notion perfect equilibrium sequenti equilibrium scope review discuss technic aspect involv belief updat point assumpt made author sequenti ration futur negoti made agent attempt payoff strategi oppon rule updat belief agent belief consist initi belief author prove agent sequenti equilibrium strategi forc negoti termin discuss extent high probabl attach event negoti end agreement refer interest reader paper detail agent complet inform negoti common altern deal compar scenario involv shift concern negoti draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft distribut agent complet inform assum agent opt suffici negoti stop mechan protocol regul offer put forward negoti agent negoti stop offer gener vote round start author show agent negoti stop agreement round reach result main assumpt util function action good negoti carri time agreement prefer opt negoti progress negoti mix domain faratin al develop gener suit model follow heurist approach negoti cooper competit set approach chosen combat comput tradit game theoret model gener heurist method acknowledg cost comput make seek search negoti space fashion effect heurist method aim produc optim solut negoti model deploi domain busi process manag telecommun network manag central concern line work heurist model agent make negoti chosen negoti protocol sequenti model offer iter exchang agent fulli commit utter utter privat space agreement quantit repres contract valu issu agent rate point space outcom prefer captur util function offer singl point space search termin time reach agreement mutual accept intersect joint space outcom reach agent architectur model involv search mutual accept solut develop protocol norm describ order make mechan describ set agent strategi protocol strategi captur negoti architectur delib mechan make mechan base linear combin simpl function call manipul util contract draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft subdivid issu manipul mechan gener offer manipul offer mechan make attract oppon achiev provid contract oppon offer issu manipul mechan aim likelihood agreement ad remov issu negoti set issu manipul mechan dynam alter structur negoti escap local minima negoti dynam set outcom negoti remov issu obstruct negoti progress mechan repres continuum make rang behaviour exhibit greater awar resourc solut behaviour attempt acquir solut qualiti independ resourc consumpt depend tactic strategi set repres cooper negoti situat agent seek find solut competit situat agent seek individu util term negoti taxonomi previou model target negoti model seri interact deal contract multipl issu term model describ negoti behaviour buyer agent bound ration kei driver agent assum limit inform negoti oppon reserv valu util agent make bind commit pai penalti model altruist negoti behaviour environ negoti place assum dynam agent updat util function negoti good agent negoti assum privat rang issu cover negoti contract qualit quantit negoti parson al develop negoti model agent justifi negoti posit send basic role argument agent justifi negoti stanc agent compel reason adopt negoti stanc compani legal entitl sell type product type consum item stock deliveri draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft month abil provid justif attitud issu oppon fulli agent constraint behaviour basi agent persuad chang negoti stanc agent activ chang oppon agreement rate order deal agent seek construct argument make oppon favour argument seek identifi opportun chang car salesman throw stereo car creat opportun chang car salesman add dimens rate function highlight car secur modifi exist assess criteria car salesman buyer chang evalu function convinc secur import high negoti provid argument support stanc addit gener negoti seek make attract provid addit inform form argument posit natur type argument vari enorm common categori threat accept mean neg happen reward mean posit happen appeal prefer option altern role support argument modifi recipi region accept rate function region argument potenti likelihood speed agreement reach persuad agent accept deal reject convinc agent accept oppon posit issu negoti concentr specif model parson argument fit gener negoti process defin simpl negoti protocol trade augment seri pass argument pass argument move mark transit negoti protocol separ argument poorli design argument system potenti length negoti merit argument debat poor design aspect negoti technolog similarli effect long negoti specif negoti agent prefer argument lead argument requir metric agreement prove argument lead quicker agreement draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft protocol defin rule game carri argument dialogu protocol dialogu suggest argument dialogu agent make transit pick negoti dialogu exact argument mechan emploi build work argument approach handl reason make agent handl contradictori statement frequent occur conflict argument resolv argument real agent simpl collect logic mean handl complex agent mental integr argument mechan complex agent architectur issu discuss shown augment standard model argument work agent reason desir intent model implement system repres agent mental attitud term negoti taxonomi previou model deal multipl negoti issu set model symmetr buyer seller assum agent perfectli ration agent limit inform negoti oppon reserv valu rate model cooper negoti seek develop joint plan competit agent seek individu negoti good assum privat cover rang qualit quantit issu main type event relat negoti protocol similar model faratin argument protocol protocol determin argument model rich flexibl set inform paramet exchang agent argument negoti sycara develop framework comput support goal conflict resolut negoti argument work present seri includ conceptu model implement persuad integr comput program act mediat disput relat labour market framework distinguish work assum agent incomplet inform agent model util belief util function belief framework aim tackl negoti scenario agent goal conflict sycara argu problem planner resolut goal share common characterist planner aim draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft handl feedback parti gener improv evalu lead environ agent util planner gener argument put agent order chanc reach agreement persuad system negoti parti engag parallel negoti parti offer exchang action agent provid agent persuad system execut loop mediat gener put forward parti motiv disagr agreement reach mediat gener put argument put disagr parti aim chang posit briefli review step order perform task persuad integr techniqu reason theori detail found initi offer gener reason instanc similar negoti case store memori review process perform previou case applic instanc persuad prefer analysi util theori comput accept attempt persuad refut parti made persuad answer comment receiv reject argument modul work agent util function assum linear combin persuad produc argument modifi import agent chang issu order achiev persuad maintain constantli updat model agent goal belief system introduc goal util substitut turn motiv goal abandon attempt persuad motiv chang reserv price agent end threat refer interest reader detail phase argument termin techniqu relat gener produc amend offer put loop restart taxonomi section framework persuad flexibl respect cardin negoti negoti system structur agent negoti set mediat facilit agreement draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft agent model conceptu negoti ration bound knowledg agent mediat agent hold privat inform model negoti part relat agent make assumpt commit agent involv agent persuad reason term agent pull full commit agent bid strategi emploi accept reject advanc persuad assumpt linear util function refer reader paper environ persuad period check modif world model task negoti place privat natur measur discret continu quantiti event paramet handl mediat restrict valid offer parti involv handl persuad reach agreement parti put offer timeout introduc valid negoti object persuad flexibl term inform paramet modul handl messag price past year wit rapid busi carri onlin current system offer advantag consum case amount electron catalogu credit card payment arrang onlin class system start emerg autom softwar agent particip trade activ behalf user specif autom negoti kei type interact system autom human broad encompass disciplin import understand dimens rang option preliminari step develop classif scheme specif target autom negoti set classif scheme illustr rang promin negoti model result tabl scheme systemat basi object compar contrast negoti model classif scheme vital develop gener system mean differenti compet altern choic draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft model autom negoti exploit negoti design step identifi tool techniqu specif region space techniqu method approach domin field rang altern select domain circumst act map negoti space manner produc design repositori interact electron commerc repositori constitut valuabl resourc enabl design share develop refer parson model dialogu argument int confer multiag bailei exploratori studi emerg role electron intermediari intern journal electron inform process theori consum choic fun game heath davi smith negoti metaphor distribut problem solv artifici engel blackwel consum behavior colleg sierra autonom negoti provis virtual privat network complaint agent proc int conf practic applic intellig agent system page friedman editor doubl auction theori evid jen negoti function autonom agent int journal robot autonom draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft jen similar criteria make negoti proc aaai int conf multiag system design delib autom negoti proc aaai workshop settl conflict identifi page mae electron survei knowledg engin hammond integr theori memori phd yale howard sheth theori buyer behavior wooldridg autom method challeng group autonom agent busi process manag intern journal appli artifici faratin autom negoti intern confer practic applic intellig agent system kuwabara lesser extend protocol negoti ninth workshop distribut artifici septemb von martial negoti framework autonom agent european workshop model autonom agent multi agent august keenei raiffa multipl object john wilei krau strateg negoti multiag environ mit reach agreement logic model implement artifici octob draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft wilson sequenti equilibria zlotkin multiag negoti time constraint artifici octob lee strategi effect model negoti phd depart comput juli jen agent mediat electron european chapter classif scheme negoti electron page springer consum market implic prentic osborn rubinstein game theori mit parson jen negoti preliminari report proc int conf page jen agent reason negoti argu journal logic june electron auction confer practic applic intellig agent multiag technolog page april rosenschein zlotkin rule design convent autom negoti comput mit sandholm distribut ration make multiag modern introduct distribut artifici page mit draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft nick jen negoti model autonom agent proc int workshop model autonom agent page carl nick pablo simon parson framework negoti intellig agent iv volum page jen system engin execut agent proc int workshop agent theori architectur languag page sycara resolv adversari approach integr analyt method phd georgia institut june sycara resolv goal conflict negoti tom reid nation confer artifici page st august morgan kaufmann sycara plan agent plan page august sycara problem restructur negoti manag fernando negoti reason choic jon doyl work paper aaai spring symposium qualit prefer practic page menlo american associ artifici american associ artifici intellig vickrei competit seal tender journal jen effici mechan suppli servic environ journal support product sequenc negoti intern confer practic applic intellig agent technolog page draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft wooldridg jen intellig theori practic knowledg engin walsh michigan internet configur auction server human softwar agent sycara intern confer autonom agent page acm press problem econom warfar routledg zlotkin jeffrei rosenschein negoti task share autonom agent cooper domain eleventh intern joint confer artifici page august draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft agent homogen bid agent homogen bid bid public bid desc public total tran complet complet agent bid agent bid negoti perfect public draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft draft agent heterogen bid desc negoti bound privat variabl
HCI/1608 4 wearabl comput remembr agent rhode paper overview field wearabl comput cover kei differ wearabl portabl discuss issu design applic wearabl specif wearabl remembr agent proactiv memori aid paper conclud discuss futur direct research applic inspir prototyp introduct field engin issu latest support wearabl comput clip throat displai pair normal glass job repair larg build complex unfamiliar approach complex wearabl whisper remind report build direct current posit check remind recent fault fix fix suitabl equip wearabl notifi virtual remind left instal engin read remind displai start work start note similar fault brought attent make easier track problem case colleagu point specialist area talk background wearabl finish repair interest wearabl show number fault happen time dai indic common scenario sound practic technolog support aim paper describ technolog detail give indic current statu paper start describ featur wearabl comput current laptop person digit assist describ number gener applic area wearabl current wearabl technolog design bt technol vol juli descript remembr agent wearabl memori aid continu remind wearer potenti relev inform base current physic virtual context paper discuss extens ad current prototyp system wearabl comput simpli comput user host applic set applic power local comput power advanc sensor potenti applic develop case year comput power requir achiev machin wearabl realm scienc fiction practic proposit fuzzi definit wearabl comput comput comfort easi cloth definit unsatisfactori detail consid convei wearabl comput small specif definit wearabl comput characterist portabl oper distinguish featur wearabl walk move distinguish wearabl desktop laptop distinguish portabl phone sensor addit normal user wearabl sensor physic environ locat enabl militari industri applic wearabl concentr speech input displai voic output wearabl joystick ty hand applic inform provid sensor reli direct user guid environ proactiv wearabl convei inform user activ comput commun inform immedi default wearabl act normal sit pocket switch task gener discuss wearabl interpret guidelin absolut good wearabl comput design depend greatli applic intend devic potenti applic comput chip smaller dai comput disappear spare centimet kind applic expect bulk portabl pc disappear process power machin applic limit qualiti input network capabl thing rang applic proactiv monitor sensori devic monitor vital bodi wearabl start power person health monitor wearabl collat inform regular pass process ensur symptom lead medic condit track identifi earli stage augment realiti wearabl comput sensori devic track gaze applic real world part interfac applic overlai object real world annot describ object draw attent item guid direct graphic overlai spatial audio augment intellig rang data captur devic gather inform environ activ time locat combin form higher level sensor captur user talk contextu inform host applic memori guidanc proactiv inform wearabl workgroup remot intellig improv radio network bandwidth limit expect group interact natur physic locat applic exist act remot relai inform back build site remot evalu car insur claim inform simpli audio extend forward individu act sensor survei comput access current context comput environ access word file view user talk wearabl comput give opportun bring sensor technolog everydai piec physic context inform wearabl comput provid support user design wearabl make portabl comput pda wearabl comput design requir portabl longer appli environ section rang requir cover comfort bt technol vol juli wearabl comput user input devic tradit keyboard input devic move reli steadi surfac effect walk tradit keyboard larg hidden view import social situat keyboard replac chord keyboard chord input rate word minut attach oper applic case accept solut robust keyboard keyboard exploit symmetri left hand bat chord keyboard user hand time speech recognit system singl short phrase recognit system matur accur sequenc dictat control environ long problem wearabl control user quiet control system normal speech input complet oper input devic develop robust menu select devic input dial touch data gestur recognit system radio control output devic visual screen displai attach close firmli ey solut current practic leav desir term aesthet small displai privat ey displai fig section resolut low power consumpt major lcd displai give crisp imag colour greyscal virtual approach displai leav clear user displai front recent advanc dragon natur speak voic command bt technol vol juli displai glass shown fig larg extent make headmount displai social accept depend feasibl displai pocket displai rang pda flexibl posit displai abil make discret fig thad starner wear displai pixel imag project left ey audio audio detract user screen displai audio output user involv delic visual impair roi al give overview audio input output medium audio convei inform touch tactil plai import role wearabl comput familiar pager mobil phone made vibrat bring attent messag techniqu simpl direct devic vibrat point user direct sophist tactil displai imag skin tan pentland review tactil displai environ sensor kei benefit wearabl comput abil make environ applic base augment realiti intellig augment briefli environ posit environ effect crude posit locat achiev gp system give posit inform metr differenti speed direct user move insid build problem difficult build adorn kind locat beacon pick wearabl wearabl user manual updat posit posit factor potenti sensor wearabl simpl sensor measur light combin imag voic recognit system sensor provid excel basi model environ order provid cue applic network number exist technolog gener network connect gener cellular modem popular give reason data rate uk gsm give shortli packet radio give potenti indoor wireless lan mobil telecommun system give flexibl bandwidth micro macro cell architectur network connect vari depend network essenti applic achiev process disk space local wearabl power power consumpt limit applic wearabl comput disk process power consum network connect lesser type sensor wearabl wireless network local storag process power trade remot requir hard manual input devic simpl wearabl system readili highqual ion batteri light good number hour pentium mb gb disk consum expect perform dedic project specifi pocket comput base arm risc post paul mccarti wearabl comput processor tabl show compar power consumpt processor architectur tabl compar processor power consumpt processor power pentium pentium wearabl thought term applic interfac technolog built choic input process power requir clearer discuss term applic substanti section applic wearabl remembr agent wearabl remembr agent current memori aid develop make life easier person common method access comput data filenam user recal user scan list method easi program requir user memori task hierarch directori structur data calendar program data break file queri fit redesign structur search work user set word uniqu identifi search remembr agent bt link microsoft word watch user read write text editor activ suggest person text document relev user focu primari task case write deleg search support materi remembr agent system daili year suggest produc journal abstract past year ra suggest paper user edit document bt technol vol juli wearabl comput remembr agent port wearabl comput year ago wearabl base case consist processor run linux displai input fig show displai fig show sampl result remembr agent system final port wearabl comput applic appar note confer remembr agent suggest document lead question speaker wearabl ra offer suggest base note laptop comput advantag displai wearer expect suggest order receiv common practic wearabl user confer type person met shake hand ra remind wearer person enter met suggest note previou prefer wearabl area user type sensor automat face recognit activ badg system fig displai remembr agent human memori oper space pair context rememb episod lot cue recal cue includ physic locat bt technol vol juli happen happen immedi inform recal event partial associ current environ past experi relat wearabl remembr agent augment automat detect physic context determin relev inform context inform tag retriev salton note wearabl tag context inform store retriev current physic context find relev inform sensor data system wearer type addit context inform current version wearabl remembr agent context cue produc relev physic locat inform provid indoor locat locat enter explicitli user chord peopl inform activ badg wearabl enter subject enter wearer extra index extract header field subject line date stamp note file singl chord extract structur data inform system inform bodi turn keyword analysi inform wearer read write usabl suggest summari line fig desir complet refer singl chord hit chord keyboard bring fig output remembr agent line show suggest match shown date subject suggest suggest refer main buffer suggest file ra automat jump relev point file displai system daili design issu appar prototyp issu drive set biggest design ra make continu suggest versu flash suggest continu displai design toler posit distract wearer real world continu displai wearer receiv suggest liter blink ey keyboard button suggest displai relev suggest wearer tendenc distrust displai week experi suggest wearer ignor displai screen suggest version ra cull hit leav displai trustworthi suggest flash screen time accompani notif judg import miss notif schedul event flash wearabl commun system current mount satisfactori attent case lesson learn interfac commun system screen radic chang import messag wearer read text import alert commun system print larg line lower half quickli determin messag arriv made show lot text screen versu show import text larger font current design show entir column produc text wearer scan carri futur version experi variabl font size anim habitu issu current system user set hand ra bia featur physic futur automat chang context user enter locat import factor inform show wearabl comput locat ra bia newer inform relat work closest system wearabl ra system develop rank xerox research centr pda system record user store queri differ ra ra retriev specif textual inform diari ra capac proactiv suggest answer queri system exist provid contextu cue manag inform tradit desktop system project complet file manag system base abil tag futur meet time trigger alarm shortli occur system exist recommend web page base page user build effect wearabl comput system care displai input devic wearabl wai lucki user happi put ideal made easier design ra concentr applic side improv wearabl ra featur abil search bodi messag search person speak difficult mobil remind prove motiv scenario introduct technic feasibl acknowledg jan code remembr agent jerri review paper bt technol vol juli wearabl comput refer starner mann rhode healei russel levin pentland comput augment technic media lab vision model group mit taxonomi enhanc realiti intern symposium wearabl comput boston comput applic mobil video system construct bt technol pp mackenzi buxton pp page system architectur bt technol pp bass martin siewiorek smailag design wearabl chi confer human factor comput pp starner weaver pentland wearabl comput base american sign languag intern symposium wearabl pp roi sawhnei schmandt pentland survei interact tan pentland displai wearabl intern symposium wearabl usa starner kirsh locust locat messag ieee intern symposium wearabl comput rhode starner continu run autom inform retriev intern confer practic applic intellig agent pp moghaddam pentland probabilist match face ieee intern confer automat face gestur japan bt technol vol juli episod clarendon press salton smart retriev system experi automat document englewood small cooper chi companion lam flynn intim comput support human intern symposium gener human japan freeman gelernt storag model person acm sigmod bulletin lieberman agent assist web intern joint confer artifici montreal armstrong freitag joachim mitchel learn world wide aaai spring symposium inform ca barri join bt complet physic bath number year softwar develop move field artifici intellig begin system autom diagnosi workforc manag move work distribut problem adapt system technic advisor research technolog interest intellig agent wearabl comput bradlei rhode work softwar agent group mit media focu design provid inform base current environ work cross artifici intellig cognit scienc interact design current research work build autonom charact interact fiction automat storytel system
IR/1609 5 practic automat extract ian gordon carl gutwin craig dept comput zealand dept comput canada googl york usa abstract provid semant metadata summar document paper describ algorithm automat extract text identifi candid lexic calcul featur valu algorithm predict candid good machin learn scheme build predict model train document model find document larg test corpu evalu effect term correctli identifi system gnu gener public paper instruct introduct provid summari document content larg document collect digit librari summari inform keyword interpret individu independ inform retriev system descript document return basi search document cluster techniqu user feel content provid entri point show queri facilit document skim visual document term subsum import offer power mean measur document similar gutwin chosen manual academ author assign document written index phrase predefin relev domain hand great major document assign manual tediou process requir knowledg subject matter automat extract techniqu potenti great benefit fundament approach problem automat gener assign extract machin learn requir train set document attach assign seek select phrase control vocabulari describ document train data associ set document phrase build classifi phrase document process assign model classifi posit dumai assign train data protocol atom transact execut electron commerc neural gaug theori disord system proof comput anonym atom auction electron commerc privaci secur transact atom auction custom electron commerc intrud merchant protocol secur parti transact disord system gaug field neural neural network disord gaug gaug field interpol kernel length scale smooth linear logic proof net share graph type cut cut elimin garbag proof net weaken tabl paper approach control text emploi lexic inform retriev techniqu extract phrase document text train data tune paramet extract algorithm paper describ extract algorithm simpl perform current state art nave machin learn algorithm train extract implement zealand digit librari project build work turnei treat problem problem learn exampl heurist extract document method neural network mutual inform heurist discov larg list phrase great deal relat research gener extract summari inform text johnson kupiec attempt extract complet sentenc keyword output illustr tabl show titl research articl set articl set assign oder zur zur al auf ein bei und mit dem und da problem einer multivari regress integr tabl abstract german determin automat articl full text phrase common set author difficult guess phrase author addit good author list provid reason descript paper case choic valuabl resourc encount articl time algorithm stemmer stopword list depend tabl show german languag case document abstract paper german sociolog journal list pair author phrase common stem author phrase singl rel lack phase characterist german compound word serv role phrase english abstract full extract lower correspond author tabl goal provid metadata exist evalu perform compar author expect equal extract reason summari text give valuabl tool design user digit librari remaind paper describ section detail design algorithm give predict model gener show assess candid report experi design test effect explor effect vari paramet extract process appendix describ download run system algorithm extract algorithm creat model identifi train document author model process outlin figur stage set candid phrase input calcul valu attribut candid describ step outlin train extract stage detail candid phrase candid phrase step clean input identifi final stem phrase input clean ascii input file filter regular text determin initi phrase boundari input stream split token digit intern modif punctuat number replac phrase hyphen word split remain charact token letter result set sequenc token letter acronym retain singl token phrase identif consid subsequ line determin suitabl candid phrase investig method determin noun found rule simpl candid phrase limit maximum length candid phrase proper singl word initi candid phrase begin end stopword stopword list word syntact class word list dictionari ad list adject introduc word subclass ad overlap sixti common word brown corpu ad word subclass contigu sequenc word input line test rule yield set candid phrase note candid line read program demonstr method gener program demonstr program demonstr method candid stopword list stem final step determin candid phrase word stem iter method involv classic stemmer discard candid phrase identif ion phrase document frequenc ion candid phrase identif candid phrase identif global corpu train document test document learn gener model keyword rank df train extract figur train extract process repeat process stem remain chang phrase cut elimin cut stem treat variat phrase thing proof net proof net essenti stem treat phrase stem version compar output author successfulli identifi stem tabl phrase cut proof net proof consid retain word origin present user case phrase turn capit frequent version chosen featur calcul featur calcul candid phrase train extract measur phrase frequenc document compar gener distanc document phrase tfidf featur compar frequenc phrase document frequenc phrase gener gener usag repres document number document phrase larg corpu phrase document frequenc common phrase build document frequenc file corpu document stem candid phrase gener document corpu method document frequenc file store phrase count number document stemmer file tfidf phrase document tfidf log number time occur number word number document global corpu size global corpu term equat log probabl phrase document corpu probabl document part global increment term simul corpu occurr calcul number word phrase divid number word document result number repres document phrase discret featur real convert nomin data scheme train discret tabl featur deriv train data tabl set numer rang valu replac rang fall discret accomplish discret method fayyad irani build model train stage set train document author train candid phrase identifi featur valu calcul reduc size train discard phrase occur document phrase mark actual document binari featur class featur machin learn scheme scheme gener model predict class valu featur experi number machin learn nave techniqu domingo simpl yield good result scheme learn set numer weight discret featur set appli posit exampl neg instanc model section extract select determin candid phrase featur appli model built train model determin probabl candid oper select set nave model candid phrase featur valu quantiti tfidf distanc similar express number posit instanc train number neg candid phrase laplac estim avoid probabl simpli replac probabl candid phrase candid phrase rank step carri tfidf phrase equal probabl remov list phrase phrase remain rank phrase number request extract illustr nave model exhibit model extract learn show applic phrase sampl model tabl show model train tfidf discret fix occurr level discret boundari top tabl featur weight posit exampl neg tfidf proport posit exampl discret tfidf valu learn weight shown middl tabl final compon learn model number posit neg instanc train shown bottom tabl determin prior probabl candid phrase absenc inform applic model phrase cut stem cut time paper tabl size paper phrase word document global cut paper global count increment discret tabl featur discret rang tfidf distanc class probabl featur valu discret rang tfidf distanc prior probabl class train instanc prior probabl tabl learn model identif cut featur valu tfidf distanc posteriori likelihood phrase class calcul equat probabl calcul equat make candid phrase probabl order return provid request individu word cut candid phrase cut probabl cut rank higher tfidf chosen matter probabl lower evalu carri empir evalu document zealand digit librari goal assess investig effect vari paramet extract process measur qualiti count number match output origin chosen document author section outlin methodolog report result methodolog procedur evalu comput scienc technic report collect document chose author suppli randomli chose test set leav pool select train document larg test set reduc measur result close approxim expect valu document set document chosen random remaind cstr global build file carri experi effect effect chang size sourc global corpu effect chang number train document perform abstract full text result experi describ qualiti discuss advantag disadvantag standard measur assess effect count chosen document fix number extract measur common metric recal reason singl easili interpret valu recal easi maxim recal return singl candid recal return measur fit expect behaviour number document calcul divid measur number phrase retriev chose measur choic document author method evalu carri comparison extract scheme disadvantag author author describ content paper author phrase slant work maxim chanc notic searcher chosen document final argu author case poorli qualifi phrase describ work problem issu varianc author choic make difficult automat extract scheme perform incorrect choic match author necessarili poor reveal approach human judg independ assess qualiti origin author choic result effect experi assess extract test document experi train standard test global corpu document select result shown tabl illustr figur figur lowest line show averag number correct identif upper line show limit perform show author algorithm measur success asymptot show test set averag document line top number document text method extract possibl identifi text number candid phrase section figur illustr lose ground differ middl line repres select candid select process number number phrase output assign author assign text candid phrase figur perform extract averag match author tabl perform differ bottom line repres machin learn scheme conceiv find author candid error bar lowest line small bare repres varianc due choic train document consid popul train set size chanc popul li error bar train set document repres realist situat document result train set figur accur portrai expect result train set effect size sourc global corpu carri seri test determin size sourc global corpu affect perform section global corpu build document frequenc file tfidf calcul interest corpu size larger global corpu close approxim phrase true frequenc gener interest sourc global corpu similar document test document affect perform test effect built global independ set similar train train test test set set document kind materi global corpu significantli outperform number document file phrase output phrase output number train document phrase output phrase output figur effect number document calcul tfidf figur perform number train file document corpu averag match averag match tabl effect vari global corpu size test effect global corpu test size train set standard test set global form randomli cstr document shown tabl figur gain size global corpu ten improv file crucial good perform drop dramat figur plot number match size global corpu error bar give confid interv number correct extract test train set number assign author abstract text candid phrase assign figur number correct number phrase extract effect train set size experi investig number train document affect perform interest practic problem train document good result standard global corpu cstr standard test set vari size train set test perform set result figur show perform improv steadili train set smaller gain made train set hold document figur plot number phrase number document train error bar show confid limit result good extract perform small set train document situat collect train document averag match averag match tabl effect vari train set size document length averag match averag match full text abstract tabl effect vari document length human expert read assign document order extract rest collect effect document length final experi consid perform suffer abstract document extract compar perform full text experi standard global corpu document abstract train document test tabl show number correct extract short full document extract fewer abstract full document text figur plot curv short document trial solid top number assign number shorten number candid number correctli identifi dash line number correct identifi full document text main reason reduc perform abstract fewer author abstract found entir document evalu algorithm automat extract text result show averag match chosen averag author collect good perform find half author thousand highli human select set phrase origin author perform suffici applic design provid support search cluster case manual assign greatli assist design user larg document collect acknowledg peter turnei share experi refer lr automat electron public sentenc inform process fast simpl stem algorithm german technic report center fr berlin optim simpl bayesian classifi machin heckerman sahami learn algorithm text intern confer inform knowledg pp um kb discret attribut classif proc cg proc sixteenth intern joint confer artifici morgan kaufmann san pp cg digit librari support vol nov pp wj ap applic linguist process automat abstract document text manag gw extract document digit evalu journal american societi inform scienc technolog user inform interest extract semant aaai spring symposium machin learn inform march wn comput analysi american english brown provid trainabl document proc acm jb stem mechan translat comput kei word gener document hierarch cluster art intellig data rk statist analysi topic proc symposium document analysi inform pd algorithm inform ih digit proc australasian comput scienc ih data practic machin learn tool techniqu java implement morgan san francisco latest version java implement basic idea present differ slightli version step candid global frequenc base train data separ corpu onlin document detail inform distribut gnu gener public download includ version machin learn workbench full form gnu gener public instal instal download archiv file jar util includ standard java distribut expand creat directori call implement set java class run java virtual machin class add directori environ variabl java virtual machin set add environ variabl gener automat sourc locat directori call doc document bookmark web browser start build extract model extract build extract model set document prefer document domain intend extract creat directori document train renam document file directori end suffix delet document put separ file document file call move file call separ line build extract model run java document build extract save shown tabl argument option mean specifi directori specifi model specifi encod turn debug mode frequenc statist disallow intern period set maximum phrase length set minimum phrase length minimum number time phrase occur list stopword stemmer check proper noun tabl option option specifi charact encod support java extract document encod option gener output show progress model builder frequenc attribut model improv accuraci train test document domain extract paper train document option phrase intern period candid import full stop white space document adapt languag chang list polici capit word keyword extract extract place document empti directori renam end suffix extract model appli document java document creat kei file extract exist kei file overwritten present file option mean specifi directori specifi model specifi encod specifi number phrase output turn debug mode write stem phrase score file tabl option evalu extract model compar stem extract phrase stem version phrase kei file report number hit total number extract phrase document kei file tabl show option good input text html tag input document delet model built extract document exampl archiv file small split train test directori note collect includ show system appli actual document due lack accuraci low exampl collect collect abstract comput scienc technic report build model train java evalu model test java collect small collect document encod build model train java evalu model test java
IR/1610 5 agent deliv person content base semant metadata helsinki technolog finland marko media corp finland abstract project editor add semant metadata inform flow content creat metadata filter inform flow provid end user person servic person deliveri process model softwar user deleg task sift incom inform kei compon architectur focu project shift pilot implement test idea practic introduct internet onlin distribut chang rule publish physic constraint media product kei factor publish process newspap bottleneck fit paper todai publish capabl creat method person distribut increment price publish internet neglig limit factor produc content deliv user locat relev inform time consum custom person inform flow trust inform sourc servic adapt custom chang interest main goal bring satisfi publish custom achiev target person inform flow content provid metadata make inform searchabl usabl web organ deliv target copyright american associ artifici intellig reserv inform base fix limit metadata scheme specif proprietari content provid provid share metadata format wide newswir content header descript author augment inform flow rich metadata descript deliveri process inform filter base textual inform flow manual classif scheme flow system semant metadata person custom deleg filter task softwar agent agent possess machin intellig match chang custom continu inform flow content provid agent autonomi flexibl ad function chang system work fly content provid user person deliveri agent figur agent content deliveri inform filter textual inform flow analyz variat term vector model mcgill manual classif typic base keyword make simpl boolean logic approach fundament classif system reli human expert make categori inform cover term vector model base approach treat inform term vector model process abstract lend fulli automat person deliveri vision combin metadata inform filter mean materi enrich semant metadata content high qualiti metadata express power function surrog entir content inform filter compar simpl keyword metadata express wider coverag express facilit accur person metadata filter elimin transfer diminish requir bandwidth fundament question inform filter user provid piec inform question answer stage content deliveri process simpl categor domain expert implicitli target content earli process agent arm user knowledg base fetch inform analyz decid user inform creation deliveri softwar agent stage process select match result person feed suitabl task agent user deleg task sift inform agent intellig requir task depend natur inform materi materi ascii agent task hard principl agent mimic user thought read textual inform task order magnitud inform sound video structur document relev carri inform compon relat document agent inform work structur part document head describ content compact form develop idea augment inform content inform flow tag potenti user content provid agent job rout relev inform end user extrem optim distribut intellig agent inform flow describ content express import aspect end user interest job agent demand compar descript piec content user interest make deliveri base match approach natur drawback develop model captur import aspect cover interest group user easi task express model limit compar express natur mention subtl semant introduc layout structur tempor structur sound video approach definit advantag agent system make analysi work made interest parti achiev econom scale figur altern person content deliveri content creation manual categor deliveri filter categori end user content provid content creation deliveri filter textual content end user content provid content creation manual categor deliveri categori end user content provid content creation metadata creation person deliveri filter metadata end user content provid make human machin resourc metadata creation process work properli pro con earli bandwidth save advantag mobil uniform loss rich metadata deliv late flexibl full materi judgment requir inform flow nonuniform tabl posit content analysi filter process gener metadata content develop architectur reli compact structur metadata metadata mean machin understand inform inform introduct metadata standard found figur articl semant metadata approach requir provid deliveri process actual content structur descript content semant turn lead gener metadata content develop figur step content develop process amount type requir metadata depend media end product creat raw content metadata gener content creation separ product content format public phase issu relat gener semant inform content develop process discuss autom gener fulli autom analysi inform semant interpret content reli human metadata tool assist gener leav judgment classif human expert interpret content interpret side stori object systemat method describ reli conceptu model extend expert content creation content format phase author creator editor assist tool sourc idea thought content phase process aspect content tradit publish rule ensur brand structur similar tradit media world onlin produc bound product facil real estat easi imit media add possibl interpret content semant inform accept content provid reli descript improv perceiv qualiti coordin semant inform exist inform instanc requir inform develop method gener store turn lead ineffici repetit analysi content vari storag method content descript distribut lead consist problem semant analysi metadata gener tightli integr author mean content creation phase author gener requir semant inform support yen geographi asia north america japan tokyo sourc industri content yen dollar senat tool tool gener suggest suitabl semant inform inform author make modif publish inform actual content figur content provid tool metadata analysi creation metadata inform filter precondit met successfulli metadata inform filter express coverag metadata system cover user interest suffici make person understand qualiti custom inform flow express metadata structur defin structur difficult custom interpret priorit content machin understand metadata agent process human assist origin content structur compat agent requir uniform compat metadata format process content origin sourc dictat format flexibl express accommod describ media format video audio materi languag semant compat addit common agent share understand metadata semant achiev common vocabulari describ type content metadata format multipl descript instanc agent resolv compat task requir deep understand content standard effort creat uniform metadata structur resourc descript rdf swick data model describ attribut relat document rdf implement extens markup xml effort dublin core miller defin set attribut store bibliograph inform inform content concern logist inform republish electron content metadata effort defin usabl semant describ content chosen rdf metadata interchang format develop method describ topic cover articl method consist independ dimens dimens describ aspect content geograph stori type subject area dimens data model describ subject area materi extend simpl hierarch categori system document relat concept express weight leaf node hierarch concept model express rel import concept weight gain lot express power compar simpl binari relat model natur summar relat lower level topic higher level concept current model content provid determin concept defin refin feedback user sport water sport track field wind surf dive sail literatur stock market econom figur simplifi hierarch model architectur part project implement work prototyp inform target environ underli goal develop framework content produc provid multitud custom inform feed end user filter incom feed person inform servic architectur rest assumpt semant metadata assum creat domain specif ontolog capabl express facet end user decid interest inform item assum commerci viabl enhanc content metadata descript creat reli high qualiti metadata content content produc sourc metadata flow describ introduct content produc multimedia flow distribut interest act actual content metadata flow content refer deliv user type system implement monolith inform system base central system independ softwar entiti todai network inform marketplac rigid central system environ content provid longer control distribut chain internet servic portal manag interfac end user high qualiti content grow distribut system channel high qualiti content user system exist major agent type task involv manag user match incom metadata record deliv inform user divid process facilit dynam collabor agent coordin agent ontolog agent task agent flexibl distribut process chang flow inform fly distribut task organiz boundari profil agent profil agent task involv manag profil user inform user enter system fresh creat wai user rank sampl document system deriv profil inform user give explicit keyword describ profil pick prototyp profil baselin profil start adapt interest profil creat store perman user option deliv result inform filter process profil inform system act suffici interest materi system judg user interest incom document exce threshold direct action send email messag deliv suggest passiv deliveri option list ten interest suggest user retriev discret figur profil agent administr view figur main agent type profil agent manag profil handl feedback match agent match document metadata regist profil metadata flow content produc deliveri agent commun user web sm email push channel end user adapt import part system requir implicit explicit feedback user user feedback system document suggest profil agent job modifi content interest profil line feedback receiv time mean profil agent maintain explicit feedback histori histori document suggest user user reaction depend implement adapt algorithm histori inform store summari form complet log locat profil agent content provid mediat consum chain bear function profil store manag end user machin inform make aspect commun social filter harder implement user carri devic profil system mobil platform locat distribut profil manag make softwar upgrad troublesom made profil agent network host inform broker profil agent provid servic manag profil modifi profil user interact system user contact agent make independ devic separ function deliveri chain necessit trust profil user interest inform user ident hidden match agent content provid cover user profil foundat explor social inform filter mae similar profil detect common area interest uncov individu profil user benefit analysi profil suggest miss match agent actual match process carri match agent interact profil agent match agent function profil agent express user interest area send compact interest match agent user abstract identif interest profil deliveri option minimum interest defin incom suggest figur match agent statu view task match agent compar incom metadata record base regist profil agent listen incom decod arriv compar profil comparison base distanc measur measur document profil develop asymmetr distanc measur consid document fit part profil match document cover area user interest system symmetr distanc cosin measur term vector model figur suggest distanc measur optim comput requir scalabl match process model content descript hierarch summar user interest top level categori offer natur limit number profil consid match agent account profil common document top level hierarchi deliveri agent match agent decid suggest refer user hand deliveri agent deliveri agent role deliv suggest user user deliveri option deliveri agent modul actor commun suggest user deliveri process involv commun restrict channel user current suggest send short messag mobil phone deliveri agent return suggest list basic idea separ deliveri agent separ end user commun detail high level interag commun commun interact mechan ad basic setup ontolog agent incom metadata flow profil manag profil agent common match agent make comparison match agent understand digit compat conceptu level doubt creat conceptu model wide scale adopt singl model imposs real world account ontolog agent translat content produc ontolog agent offer partial bridg semant island system remain specif singl sourc inform coordin agent individu agent discov coordin agent case dynam introduct ontolog deliveri servic necessit system servic announc avail contact inform central coordin agent act current capabl system linear distribut chain consist singl tripl match profil agent deliveri agent automat coordin techniqu agent interconnect hard code set dynam reconfigur agenthood appli model easili admit compon agent creator system possess knowledg work regard determinist system observ system user point system ration entiti capabl learn user recommend interest inform common definit agenthood analyz common agent qualiti compar exist futur architectur mediat agent intellig middlewar modul mediat resourc custom agent task consid mediat servic access data multipl repres inform integr homogen packag user resourc model custom model mediat servic conceptu base hierarchi genesereth aggreg model hierarch approach kei function match agent matchmak metadata resourc custom model repres end user agent act logic mediat connect user inform function match agent similar rout matchmak profil agent encapsul user interest repres user agent system provid mediat servic function gatekeep reveal privat inform adapt profil agent act interfac agent monitor user learn adapt user mean chang user interest profil monitor behavior user provid feedback suggest system adapt chang interest system act adapt agent learn improv perform experi cooper commun shoham defin agenthood softwar entiti function continu autonom inhabit agent social mean agent possess explicit model exist moment agent knowledg interior agent commun directli data structur agent collabor filter function incorpor futur version system facil recommend document base peopl interest collabor filter qualifi question common semant understand content commun part system gener agent commun languag reli java remot method invoc mechan commun agent coordin ontolog translat servic current implement commun mechan agent system proprietari concept main advantag separ agent task relat load scalabl issu privaci futur multipl content provid conceptu model requir acl access ontolog agent consolid inform sourc provid user coher servic autonomi system act proactiv reactiv depend point view custom point view system proactiv abil monitor environ recommend materi inform push facil observ system content provid act reactiv angl system activ distribut inform trigger deliveri materi relev custom system act autonom initi mobil current model divid task model requir agent mobil task divid migrat function agent bandwidth save motiv mobil agent architectur approach kershenbaum relat work inform filter system agent analyz inform complet origin form creat index document match mae al match agent compar metadata descript incom materi user profil materi publish comput requir match process greatli reduc inform len al system inform filter work environ insid organ user creat agent filter inform base metadata materi person newspap receiv materi multipl inform sourc system topic definit match incom materi topic significantli speed person process reader agent learn find categor inform sampl document select user extract semant phrase document learn optim search queri categori project swedish institut comput scienc edit adapt hypermedia combin human machin intellig filter process hk human expert act inform broker inform sourc reader user collabor annot categor inform approach test system filter confer call messag al assum human metadata creation locat inform sourc intermediari human broker possibl flexibl user defin classif schema worth explor push technolog tout solut inform overload problem inform distribut channel metaphor user switch channel type inform content commerci base static user model deriv data enter directli user work person leav push technolog option deliveri earlier gener architectur filter al introduc idea edit semant metadata filter process al futur work present paper inform deliveri architectur base semant metadata agent author gener content semant agent add flexibl deliveri perform user document match deliveri task idea approach author perform semant analysi content earli creation actual content express semant gener person inform flow straightforward comput incorpor semant inform agent concentr deliveri understand content idea lead accur target higher qualiti inform flow custom paper describ work progress work strong emphasi methodolog content profil match algorithm present implement system proof concept work artifici data profil current focu shift pilot implement test idea continu data flow futur work project includ field trial commerci onlin servic idea present paper back media industri scenario viabl applic todai onlin media current result pure idea fulli valid complet pilot phase acknowledg research part project sponsor finnish technolog develop centr nokia research centr group refer wireless servic transmiss guidelin report number american newspap publish associ dc introduct softwar agent softwar aaai press mit press usa person ieee intern workshop commun network integr multimedia servic home june usa kershenbaum mobil good ibm research tj watson research center yorktown usa metadata resourc learn user interest heurist phrase extract ieee support inform retriev matchmak work note aaai spring symposium inform gather distribut environ technic report aaai resourc descript framework model syntax specif work draft octob agent reduc work inform overload commun vol grant cohen intellig system commun vol pp lam multilevel approach intellig inform evalu acm transact inform vol octob pp evolv inform filter discoveri system www autonom agent pp interact adapt intranet newslett sixth intern confer user june logic structur hypermedia newspap inform process vol pp mj introduct modern inform retriev york metadata base match document user profil human artifici inform finnish artifici intellig pp finnish artifici intellig societi social inform algorithm autom usa overview program softwar aaai press mit press usa architectur servic intern confer practic applic intellig agent april uk metadata activ technolog societi extens markup languag tm architectur inform content exchang protocol submiss world wide web dublin core metadata element set www homepag inform servic research base sic technic report octob mediat architectur futur inform system vol march pp conceptu basi mediat servic ieee pp
HCI/1611 4 design storytel technolog encourag collabor young children steve benford benjamin bederson victor allison druin pr hansson juan pablo rob ingram helen neal clair kristian dana park uk royal institut kth sweden swedish institut comput sic sweden colleg md usa abstract describ iter design collabor storytel technolog young focu idea design interfac subtli encourag collabor children invit discov ad benefit work idea motiv experi earli version technolog school sweden uk compar approach encourag collabor approach synchron share interfac describ technolog encourag collabor reflect design suggest made children keyword singl displai groupwar comput support cooper work comput support collabor learn introduct collabor import skill young children learn educ research found work pair small group benefici effect learn earli year primari educ technolog offer opportun support facilit collabor learn respect comput provid common frame refer support develop idea children learn collabor occur simpli children share comput numer factor interfac todai technolog design support individu individu collabor individu comput classroom comput involv pair small group share primari elementari school call distinct distribut support todai interfac explor design storytel technolog develop collabor skill children ag year interest group work previou research shown abil collabor effect ag rang young children find difficult collabor effect inform observ behavior project found children difficulti work collabor work effect group greater introduc approach design share interfac involv subtli encourag children explor possibl forc aim provid opportun children discov posit benefit work creat graphic effect stori encourag collabor proactiv enabl collabor gain work children work independ rigid enforc demand children synchron action order approach posit gain term individu develop approach encourag collabor intend hcil technic report combin educ goal learn collabor skill design philosophi give children control suspect educ gain made children discov collabor hci point term enabl enforc collabor relat previou approach design share interfac earli approach enforc strict synchron user view share workspac subsequ approach coupl techniqu promot awar concurr control mechan interleav user action focuss enabl possibl collabor retain high individu autonomi approach encourag collabor li offer variant approach design share interfac research carri collabor classroom children year unit state goal project develop collabor storytel technolog young children technolog base approach singl displai groupwar children interact singl displai multipl input independ mice work share draw tool call share environ call applic dive collabor virtual environ system initi multipl mice method cooper inquiri involv children technolog design partner interdisciplinari design team accomplish seri technolog design session conduct school england sweden involv children section describ initi technolog introduc approach design interfac encourag collabor describ redesign initi version work collabor storytel enabl children creat stori differ deriv draw model describ start extend encourag collabor share draw tool incorpor zoom interfac children bring stori life zoom draw element figur zoom spatial structur lie heart enabl children add narr structur stori dynam move part draw creation stori involv creat link zoom zoom deeper intend develop complex structur stori stori make salient link scene structur stori anticip focu children attent featur stori structur provid opportun complementari creation stori tradit draw packag interfac design seri graphic children pick appli figur sequenc view zoom simpl stori left top tool colour creat draw element arrow select tool pick move object delet draw element magic wand creat zoom draw element child select draw element start zoom destin element arrow link hand activ zoom stori told select start point zoom initi anim zoom end point turn aliv tool anim stori element outlin make aliv bulletin board tool enabl children save stori bulletin board toolbox special tool organ open close singl displai groupwar mean support mice plug singl comput children independ grab tool time mice free tool pick children cursor initi version enabl collabor children work individu figur show interfac figur initi version show toolbox open simultan user built jazz mid open sourc java toolkit jazz support zoomabl user interfac jazz mid creat hierarch graphic mid support multipl input devic java contrast draw base approach storytel base model approach collabor storytel tool base amorph object textur deform polygon textur colour make sound manipul figur show imag stretch textur figur deform model object children manipul time intend storytel tool structur aim provid start point gener stori charact blank page explor properti lead creation simpl stori intend flexibl amorph natur inspir wide rang stori support synchron access displai children cursor enabl collabor initi version manipul stretch point surfac grab pull deform shape option switch pull singl vertex group chang kind deform occur singl vertex option pull thin volum group vertic pull thick volum button return back origin spheric shape textur varieti textur appli surfac select button interfac textur facial express ad front side give enabl background color chang rotat textur surfac grasp rotat posit make varieti sound reflect manipul interfac encourag collabor core technic innov paper idea design interfac encourag invit children collabor motiv experi initi version sweden school year part program activ contextu inquiri session observ children work exist storytel technolog collabor participatori design initi session establish children role design partner session aim elicit specif design suggest reflect redesign technolog evalu technolog observ children initi version combin activ result fifti session school involv hundr year peak weekli participatori design contextu inquiri session children observ respect collabor behavior abil technolog stori children teacher encourag provid feedback technolog design collabor storytel activ perform evid children found collabor difficult interfac encourag collabor address problem interfac provid opportun children discov posit benefit work achiev subtl natur avoid forc solut note encourag collabor proactiv enabl case initi version hand extrem strictli requir demand children press button achiev approach approach encourag collabor enforc requir singl child achiev action children achiev effici fun relax singl child carri major class action support work children achiev subtl extens variat action singl child children work independ creat function draw children collabor creat enhanc relax approach adopt describ briefli gener relationship approach encourag collabor previou work design share interfac detail relationship previou work share interfac introduc idea interfac encourag collabor context educ applic broader relationship cscw compar approach synchron share interfac synchron share interfac major concern cscw research predominantli distribut groupwar multipl user share common share sketch tool virtual separ displai connect comput network problem synchron broadli broken part synchron user approach wysiwi user displai forc part virtual workspac experi wysiwi led strictli coupl approach call relax wysiwi user view diverg system adopt approach typic introduc addit function support user awar form awar view workspac visibl user embodi system synchron object cscw system user collabor manipul chang state exampl includ jointli edit share document grasp move object virtual world problem prevent conflict updat common solut form includ simpl optimist lock serial protocol particip interleav action granular option social lock suffici mutual user negoti mutual access minim system suggest strategi locat extent constrain individu autonomi demand collabor leav user free act independ extrem continuum involv call enforc user lock step wysiwi strict found work foot modifi input standard comput student enter inform time succe kind dual kei control found enforc collabor improv individu cognit develop extrem call enabl user act mutual awar free coordin action social lock found approach encourag collabor li strict requir user work explicit motiv term ad benefit note encourag collabor interpret wai case singl user achiev multipl user achiev easier fun li enabl end continuum case singl user carri gener class multipl user achiev enhanc action li enforc end note singl cscw system approach action collabor virtual environ enabl collabor viewpoint control user steer made awar viewpoint enforc object manipul lock protocol grab virtual discuss question approach encourag collabor appli area educ applic applic area entertain game applic particip pool abil resourc mutual benefit subtl approach situat particip benefit share cost peopl increasingli pai network video audio stream user receiv manipul inform reward share cost redesign encourag collabor describ redesign lesson learn school session strategi introduc design satisfi encourag collabor reflect project educ agenda react observ note base children design emerg cooper inquiri process gener approach frequent occur children idea basi decid realiz function approach redesign basic approach redesign encourag collabor support tool children tool time tool give enhanc function concret oper initi version provid color frequent design suggest children provid color immedi ad wasnt final solut enabl children collabor combin produc color children draw close result fill area color mix children prevent draw gain addit benefit color fill work appli approach involv examin combin action interest benefit effect action combin select tool action combin happen child rotat stretch effect natur contriv work draw fill area color mix color introduc collabor color ad mix color fill area encourag collabor ad tool figur ad special tool make copi tool children tool type simultan figur show redesign interfac children mix figur redesign interfac mix note inact tool fade activ creat area built mix capabl multipl magic wand toolbox add special behavior act natur extens behavior singl user felt design ideal import order make easi children anticip mix behavior mix behavior ad arrow children squash stretch select draw object user bit draw children entir draw object hand children zoom move hand closer turn aliv children control anim properti wiggl object move turn aliv tool closer redesign redesign encourag combin action stretch textur stretch initi version enabl toggl mode pull singl vertex pull group vertic version enabl singl child pull singl vertex children synchron pull vertic close result pull group vertic ad benefit collabor make shape deform textur redesign version enabl children appli limit number textur surfac press button textur repres happi sad face background textur primari color appli independ combin face background color press button children arriv combin textur face laugh happi kind express happi cry sad background color select make combin color combin singl user select combin textur select button short time requir speed skill extend sound made provid feedback collabor effect figur show interfac center laugh face red background left button appli happi sad face textur button appli color button toggl stretch rotat red button bottom return origin shape figur show differ collabor stretch left result singl user stretch pull singl vertex collabor stretch pull group make larger deform figur show facial express obtain button left interfac face obtain singl user press button face obtain user select combin button happi happi sad sad sad initi reflect interfac formal program evalu carri version test group children version introduc school nottingham pair children common goal recreat children collabor work separ part stori join collabor tool color pictur figur interfac figur singl user collabor stretch figur facial express children uk test version children explor featur includ collabor show interest work result explicit goal issu consid develop tool encourag children collabor young children carri collabor result effect obviou notic effect displai children carri action independ version inform test small group children design partner maryland humancomput interact lab form evalu show experi children make collabor tool session boi minut children discov collabor featur children previou occas collabor version twenti minut shown collabor featur adult comment enjoi chang face mix color form studi carri children ag hour half children work show strong differ collabor children children form team work comput mice children form children form group introduc collabor tool children freeli explor tool minut children creat stori zoom experienc children troubl creat stori collabor make extens collabor tool start possibl interestingli collabor tool behavior actual stori creation children time harder time collabor creat stori tend experi includ collabor tool behavior scribbl group found hard identifi cursor negoti collabor earli observ suggest young children collabor featur enjoi featur work made obviou case discov place problem point adult occas realiz design show result highlight advanc possibl exist begun explicitli show potenti collabor figur recent version dot ey close color mix fill happen hope step children discov collabor possibl summari futur work approach design share interfac intend support children learn collabor call encourag children work ad benefit work demonstr approach appli design storytel technolog gener framework cooper inquiri uk swedish school compar approach user interfac mechan cscw futur work involv design reflect earli experi undertak rigor programm evalu includ develop intric code verbal collabor track video record children comput track children interact acknowledg fund esprit school environ initi deepli grate partner infant school england sweden summer evalu team children maryland hcil refer ma understand collabor learn process technolog rich case children disagr proc cscl extens graphic toolkit maryland comput scienc tech report local altern tool palett uist user interfac architectur share editor singl screen uist pp collabor interact microcomput keyboard educ studi input chi pp cooper develop technolog children children pp design collabor educ chi pp brown space base model user interact share synthet real time groupwar distribut concurr control effect design design tradeoff power workspac effect protocol children learn collabor environ proc graphic interfac canadian inform process pp design comput system support peer european journal psycholog vol cognit develop social context oxford oxford wysiwi earli experi acm comput support collabor problem solv singl displai model collabor chi pp hand enhanc collabor singl displai groupwar extend pp cooper learn peer overview collabor learn overview educ psycholog model cognit
HCI/1612 4 live lab research facil ubiquit comput research programm posit chi distribut disappear ui ubiquit comput pano center eindhoven technolog den eindhoven netherland introduct interest topic workshop stem current involv set research facil eindhoven technolog facil call live similar relat project globe aim studi peopl experi ubiquit comput inhabit prolong period time vacat campu project initi phase white paper describ concept research work involv stakehold depart electr technolog local industri remain posit outlin research concept programm concept vacat campu live cross tradit resid usabl laboratori technolog product period hour tradit usabl situat closer normal daili life subject contrari smart home type intend lab integr vision home futur intent lab test facil orthogon technolog primari research agenda focu ubiquit comput technolog design fit daili live lab inhabit plan partnership compani depart interest adapt system air qualiti requir develop ubiquit comput prolong usag technolog implicit extend notion usabl usabl evalu test implicit continu interact adapt environ awar home compar tradit concept usabl iso suffici talk effect stretch term intend mean target system design part dai life requir test methodolog concern live mirror aloud video observ protect privaci make clear control complet video record methodolog issu import compon research agenda live lab research programm current research programm evolut earlier research video base commun elderli assess sustain video base aim support social life elderli peopl live inform applianc home ipo develop experi minimalist applic famili messag applianc train provid basic function user interact children develop interact concept base mix implicit explicit interact research field build strong human comput interact home electron current state feel convinc applic technolog larg real benefit implicit interact reap concept requir extrem complex comput vision middlewar solut switch light transfer audio video stream room control heat compel demonstr potenti step stone build complex ubiquit comput fail deliv user benefit explicit interact interact easili guid light control redirect video audio session content drive approach research field true benefit awar environ situat replac explicit health child actuat behaviour awar environ great user educ reactiv behaviour system observ parent configur environ watch doctor reconfigur patient monitor system meet condit depth understand target human activ build design test system live lab earlier part long term research effort refer live lab white ipo annual progress dg part configur equip individu explor intuit interact style home inform applianc present interact video poster chi de social presenc presenc
DB/1613 3 theori answer queri view alon depart comput scienc engin washington abstract problem answer queri view ecient method answer queri set materi view access relat problem recent receiv signi attent relev wide varieti data manag queri mainten physic data data integr data wareh articl survei theoret issu problem answer queri view introduct problem answer queri view rewrit queri recent receiv signi attent relev wide varieti data manag queri mainten physic data data integr data design inform problem queri set view de nition vn schema answer queri answer view vn access view cheapest queri execut plan answer maxim set answer obtain articl survei theoret aspect answer queri view survei materi rst context encount problem answer queri view queri optim design context queri comput queri materi view speed queri author levi ing part comput queri comput view save signi support applic view queri group aggreg context view de nition provid mechan support independ physic view data logic view independ enabl modifi storag schema data physic chang logic schema author describ storag schema set view logic schema descript problem comput queri execut plan access physic involv gure view answer queri context problem data integr data integr system uniform interfac multitud data sourc user data integr system pose queri mediat schema data store system catalog includ set sourc provid semant map relat mediat schema data sourc problem reformul user pose mediat queri refer directli sourc schema problem answer queri view solut problem answer queri view di er context number view sourc complet extens view context problem answer queri view data design design semant data cach applic problem answer queri view spur rang theoret foundat algorithm design implement commerci system treatment problem di er includ speci queri languag rewrit view assum tupl de nition import distinct made theoret work problem queri rewrit output queri express comput answer problem queri result set answer obtain queri view section formal de ne problem dimens section survei work rewrit problem section discuss work queri section describ treatment extens articl limit theoret aspect problem complet survei discuss larg bodi work incorpor materi view queri speci algorithm answer queri view complet treatment queri group aggreg problem de nition datalog notat paper conjunct form xn predic predic refer relat atom call head refer answer relat atom xn subgoal bodi queri tupl xn variabl constant requir queri xn variabl head queri subgoal predic arithmet comparison requir variabl subgoal comparison ordinari subgoal denot result comput queri refer queri refer view queri refer result comput view comput paper assum set semant queri result notion queri queri enabl comparison di erent reformul queri test correct rewrit queri term set view problem queri studi extens literatur deserv survei de nition queri queri denot set tupl comput subset comput queri queri rewrit queri view de nition vm rewrit view queri express subgoal view relat vm comparison predic interest rewrit refer conceptu case introduc diculti distinguish type queri rewrit rewrit context queri optim maintain physic data independ rewrit de nition queri vm set view de nition queri rewrit subgoal relat comparison simpl schema relat store pair public cite relat store pair public topic unari relat store paper publish sigmod vldb queri pair paper topic cite assum view view store pair paper cite store pair paper topic cite paper rewrit check unfold view de nition obtain show nding map context data view describ content data sourc queri data integr system rst reformul refer data view rewrit queri sourc provid data problem nding rewrit note maxim rewrit de ned wrt queri de nition vm set view de queri languag queri rewrit wrt queri refer view comparison rewrit rewrit rewrit refer rewrit domain data pair sigmod paper cite sourc queri previou sourc rewrit comput note rewrit union conjunct describ multipl wai obtain answer queri sourc rewrit miss pair paper sigmod dont data sourc provid pair sourc tupl de nition rewrit di erent view similar de nition speci sourc ident descript queri plan replac fundament question answer set view de nition extens find rewrit queri view evalu rewrit view candid algorithm rewrit answer rewrit queri set view provid answer obtain view reason rewrit wrt speci queri queri express languag provid answer problem nding answer queri set view formal notion answer de nition distinguish case view extens assum complet case view partial de nition queri vm set view de nition schema rn set tupl vm extens view vm tupl answer queri assumpt vm tupl answer queri assumpt vm intuit de nition answer extens vn de ne uniqu extens relat extens view partial inform real state tupl answer queri answer extens consist extens view schema includ singl relat view extens extens assumpt tupl answer assumpt answer dimens treatment problem answer queri view consid dimens dimens mention versu view assum complet algorithm result answer queri view depend crucial languag express view queri problem consid conjunct queri queri languag problem consid presenc integr constraint constraint express descript logic kei dimens expect output algorithm queri set view output algorithm express refer view queri execut plan answer view possibl answer assum extens view rewrit problem section problem rewrit queri set algorithm produc queri express output rst question algorithm rewrit queri view algorithm sound queri set view algorithm rewrit complex problem rst answer question class queri view express conjunct queri paper shown queri comparison predic exist conjunct rewrit rewrit subgoal corollari problem nding rewrit queri set view suce guess rewrit check correct shown problem nding rewrit independ number wai map singl view number wai combin map di erent view queri shown problem nding rewrit author exploit close connect rewrit show case rewrit analog case problem queri bound size rewrit search space led success algorithm attempt ecient search space bucket algorithm algorithm algorithm focu queri rewrit data integr compar show outperform scale hundr view access pattern limit context data data sourc model limit access path data queri internet movi simpli tupl suppli actor obtain set movi involv model limit access path attach set adorn data sourc sourc model view adorn consist string length note check correct rewrit guess rewrit extend guess map show rewrit queri letter mean letter adorn sourc valu attribut posit mean letter adorn sourc doesnt attribut posit adorn bf mean tupl obtain provid valu attribut work consid problem answer queri view view adorn describ limit access pattern shown bound length rewrit hold anymor view bf requir rst argument sourc limit access pattern queri paper cite paper bound requir exist size queri rewrit case author show presenc limit sucient slightli larger bound size number subgoal queri number variabl queri problem nding rewrit queri set view situat complic rewrit bound size rewrit sourc store set paper limit return paper cite paper return paper award winner sourc descript bf queri paper won sourc requir input queri directli solut queri obtain set paper sourc perform depend join sourc begin retriev paper join result sourc obtain paper cite paper join result sourc rewrit follow length citat chain begin paper obtain answer queri possibl obtain shorter chain bound length rewrit queri view shown nite rewrit queri albeit datalog rewrit obtain answer view kei construct program de ne intermedi relat paper extens set paper reachabl citat chain paper de ned transit closur view shown rewrit queri view obtain view conjunct dont comparison predic author describ addit optim basic algorithm addit case rewrit queri presenc function depend schema view union suce case addit semant inform class hierarchi object express descript logic queri answer queri view produc result independ state view mean produc answer recal answer extens vn view vn answer give rise view extens rewrit view produc subset answer state maxim de ned wrt rewrit queri languag question remain appli rewritten queri view algorithm question nding answer consid detail analysi distinguish case assumpt assumpt extens view assum tupl result appli view de nition extens view miss tupl incorrect shown practic nding answer polynomi time answer found appli rewrit extens view problem union languag de ning predic languag de ning queri assumpt situat view queri de ned conjunct queri comparison problem nding answer interest note connect establish problem nding answer comput condit tabl partial inform set view encod condit tabl formal studi connect point import properti view formal describ data speci abil formal captur partial inform data sourc work consid case view incorrect tupl shown comparison predic view view complet incorrect nding answer polynomi time size view extens problem consid problem rel queri set answer queri set answer queri paper show conjunct queri view comparison predic problem problem decid presenc access pattern limit queri languag extens brie discuss result answer queri view queri languag extens emerg xml standard share data www spur signi interest build system integr xml data multipl sourc emerg formal model xml data variat label direct model data model label direct graph suit model irregular lack schema inher xml data work start problem answer queri view view queri express languag queri data main diculti context queri languag enabl regular path express express navig queri data structur priori regular path express essenti provid limit kind queri languag author problem rewrit regular path queri set regular path show problem check rewrit author problem nding answer queri view express regular path show problem data complex size view consid author extend result path express includ forward backward graph problem context stem rich restructur capabl enabl creation arbitrari graph output output graph includ node exist input data author rewrit problem case queri creat answer queri involv regular path express nite number work consid problem answer queri view presenc nite number view motiv seemingli curiou problem data sourc capabl perform local model set view singl answer queri sourc queri send set queri answer shown import case problem answer queri nite set view decid note case set view sourc answer nite unfold datalog program descript descript logic famili logic model complex hierarch structur descript logic enabl de ne set object reason relationship set work consid problem answer queri view descript logic model domain shown answer queri view context present case obtain rewrit queri datalog complex answer queri view express descript logic includ studi author rewrit problem view union presenc depend relat introduc subtleti queri rewrit consid work formal aspect answer queri view presenc group aggreg present case shown rewrit algorithm rewrit exist algorithm base insight problem queri queri group aggreg author consid queri rewrit languag enabl queri schema data attribut data constant extens view problem answer queri view multitud rang theoret foundat practic natur algorithm answer queri view incorpor commerci system algorithm import data integr system data design issu remain open realm note studi rewrit algorithm presenc wider class integr constraint view studi ect restructur capabl queri languag queri data challeng develop algorithm select view materi data web environ data spread multipl devic work research infanc wealth techniqu develop answer queri view kei develop realm acknowledg phil mike leonid todd rachel valuabl comment paper acknowledg support sloan fellowship nsf grant refer abiteboul duschka complex answer queri materi view proc serg peter dan suciu data web morgan afrati person answer queri materi view disjunct proc surajit autom select materi view index microsoft sql server proc alon rousset rewrit queri view descript logic proc randal karl alan jame jim william harri andrew moham materi view oracl proc page alex borgida descript logic data manag ieee tran data de vardi rewrit regular express regular path queri proc de vardi answer regular path queri view proc de vardi queri process regular path queri proc diego giusepp de maurizio lenzerini answer queri view descript logic work note krdb ak chandra pm merlin optim implement conjunct queri relat ninth annual acm symposium theori page chekuri rajaraman conjunct queri revisit proc rada michael genesereth linearli bound reformul conjunct proc rewrit aggreg queri view proc page shaul michael divesh michael tan semant data cach replac proc page jan van den bussch remark complex answer queri view inform process val tannen physic data constraint optim plan proc oliv michael alon levi queri plan data integr journal logic special issu logic base heterogen inform oliv duschka queri plan optim inform integr phd stanford oliv duschka michael genesereth answer queri view proc daniela alon dan khale optim manag data intens web site proc daniela florescu search space queri optim phd pari friedman weld ecient execut inform gather plan intern joint confer arti cial grahn alberto mendelzon tableau techniqu queri inform sourc global schema proc stephan maurizio queri aggreg data proc page stephan grumbach content aggreg view proc gryz queri fold depend proc alon answer queri survei vldb imielinski incomplet inform relat journal yeung selforgan data share commun system demonstr proc chung kwok daniel weld plan gather inform aaai thirteenth nation confer arti cial eric optim inform gather plan intern joint confer arti cial alon alberto divesh srivastava answer queri view proc san alon anand joann ordil queri heterogen inform sourc sourc descript proc alon anand je rei ullman answer queri limit extern processor proc miller schemat heterogen structur proc page todd alon marc friedman queri data integr system proc yanni papakonstantin vassalo queri rewrit data proc rachel alon levi scalabl algorithm answer queri view proc anand je rei ullman answer queri templat bind pattern proc san yanni ioannidi versatil tool physic data independ vldb vassalo yanni papakonstantin describ queri capabl heterogen sourc proc page yang larson queri transform proc page marko georg monica answer complex sql queri automat summari tabl proc
HCI/1614 4 map cluster classif sensor data kristof van laerhoven starlab research laboratori belgium abstract mobil contextu profil quickli switch behavior achiev automat context analysi small hardwar fundament problem interact map sensor data context difficult problem involv classif train pattern noisi sensor signal paper adapt approach kohonen augment cluster classif incom sensor data overwrit prototyp phase avoid refin cluster label input vector introduct interact research suggest applic make obviou user bother crucial step paradigm enabl system captur context activ state devic establish ad modul pattern match incom data hardwar sensor context awar hot topic research field user interfac wearabl comput ubiquit comput exampl context awar improv applic mobil phone notif behavior ring vi context handheld comput start applic depend context recogn context requir inform sensor recognit algorithm hardwar sensor support process compon effici small bottleneck context awar algorithm interpret sensor data line adapt algorithm recogn context result effici deal problem copyright springer design user decid context system label incom sensor data context descript sourc inform process artifici neural network algorithm tackl problem adapt algorithm context awar mention previou sensor effect easi enhanc raw sensor data preprocess simpl featur standard deviat replac raw valu advantag approach algorithm deal time throughput data slow drawback inform lost due small interv featur calcul lack qualiti featur featur solv throughput problem input lead slower learn algorithm due fast stream raw sensor data filter calcul featur context recognit achiev object map possibl featur context descript central approach kohonen map build topolog map input data kohonen map kohonen map base earlier work von der malsburg classifi learn neural network store prototyp ij codebook input vector time neuron grid neuron store closest prototyp input vector euclidean metric chosen winner arg min xi wij prototyp vector initi small random valu winner neuron updat prototyp make sensit present type input cell train type data achiev topolog neighbor winner neuron adjust prototyp vector input vector lesser depend winner radial symmetr gaussian neighborhood function η α ij ij ij learn rate α neighborhood function η time spend current rate crucial cluster lead overwrit prototyp vector map plastic dilemma neuron map sensit type input input vector present neuron closer grid tend respond input closer input space learn smooth map input space neuron grid space map creat visual feedback user network main reason tradit method yield accur result cluster scale found suitabl process sensor data cluster classif cluster algorithm minim sum squar distanc input prototyp vector perform topolog map variant cluster algorithm involv iter scheme oper fix number cluster minim sum euclidean distanc input prototyp vector version find cluster closest prototyp vector updat updat neighbor cluster input classif wij ijk fig diagram algorithm som cluster preserv label input vector cluster time algorithm label winner neuron label input vector simpl mean classif eagerli overwrit learn initi stage refer main teacher decid train classif label suppli input neuron initi train prototyp vector overwritten belong label class prototyp vector converg class error highli unstabl initi make stai unstabl avoid layer cluster label input vector figur introduc win neuron label copyright springer found search winner retriev label closest neuron label input vector store layer small number chosen layer larg comput overhead incom data input vector cluster win ti λ algorithm initi cluster simpli fill input unlabel data classifi search closest label cell vote result label determin final classif experi result hard evalu exact perform requir fulfil track percentag correct classif experi progress verifi stabil algorithm converg accept recognit acc sit stand user label refer annot walk run time walk bicycl fig part raw sensor data gener acceleromet black grai box label user record data sensor experi stabil algorithm initi phase focu paper acceleromet measur motion knee person recogn everydai run bicycl data label sporad user captur record data annot enabl evalu algorithm figur standard deviat recalcul slide window data tenth speed raw data stream illustr detriment effect overwrit initi learn rate neighborhood radiu set α linearli function time spent context perform good immedi train context figur overwritten context train converg occur win neuron context slightli qualit long run success rat time sit stand walk run bicycl fig perform kohonen map initi learn rate neighborhood radiu decai linearli class due initi learn concept deterior lead slow converg data layer ad illustr figur paramet set low theoret limit maximum number cluster number met cluster form figur confirm perform substanti show trace overwrit main reason hierarch structur refin earli cluster secur data topolog map cluster typic larg dimens inp ut noisi irregular train make context awar challeng problem learn algorithm paper algorithm cope process sensor data onlin user decid train occur kohonen map initi stage paramet control flexibl high avoid extend layer label cluster assur rapid vector quantiz memor gradual creat topolog map experi show result stabl topolog map execut sensor data copyright springer success rate time sit stand walk run bicycl fig averag perform experi ident paramet figur cluster layer acknowledg peopl erol ronald review draft steven prototyp softwar experi research paper partli fund wear partner support refer context awar wearabl ubiquit comput intern symposium wearabl comput ieee press van teach fourth intern symposium wearabl comput ieee press adapt control process princeton press map von der malsburg orient sensit cell striat cortex vol verlag adapt pattern classif parallel develop code neural featur detector biolog cybernet limit map vector quantiz mozer advanc neural inform process system mit converg partit minimum averag ann math statist
Agents/1615 1 collabor agent simul teamwork john thoma michael richard volz depart comput scienc bright build texa colleg tx usa abstract psycholog studi teamwork shown effect team anticip inform teammat base share mental model exist model teamwork limit abil support proactiv inform exchang teammat address develop implement architectur call cast simul teamwork support proactiv inform exchang dynam environ present formal model proactiv inform exchang knowledg structur process team languag call belief share team process state repres petri net base cast agent offer inform proactiv algorithm call empir evalu synthet testb applic cast enhanc effect teamwork agent sacrif high cost commun introduct teamwork focu great deal span disciplin busi manag psycholog type hierarch team dynam task fly measur perform team involv measur comput model teamwork develop produc cooper behavior intellig agent fundament aspect team distinguish group interact agent share common goal bdi framework wooldridg mental state team goal term joint intent tamb steam group shown mental state establish maintain commun protocol framework model team intent step approach shown effect simul teamwork wide rang environ tidhar stone exist teamwork model design support mix team human loop place addit constraint interact teammat natur exchang import inform excess redund commun effici teamwork reli heavili inform dynam judici overwhelm human particip messag pass kei suppli relev requir reason goal team motiv develop cast agent simul architectur simul support teamwork ultim goal involv support human paper focu reduc commun softwar agent prepar step architectur mechan build virtual team softwar agent give overview goal issu address cast formal foundat proactiv inform exchang cast introduc descript major compon featur cast architectur empir evalu assess effect teamwork simul cast summar main contribut work cast overview cast design achiev goal aim model effect teamwork captur team structur teamwork process team structur base role teamwork process specifi plan accomplish goal common prior knowledg structur process team enabl member team develop share mental sourc team member reason state major critic approach goal lack flexibl deal dynam environ equal import goal enabl agent team flexibl adapt environ assign suitabl agent adapt current state world team goal conflict emphasi predefin team structur process reduc flexibl maxim flexibl team requir make ambigu role assign balanc conflict practic flexibl comput framework repres reason overlap share mental model amo ng teammat framework enabl agent dynam reason statu entir team adapt behavior repres share mental model challeng problem view kind belief gener intract content share mental model rang share domain knowledg common relev pictur situat tackl problem specif share mental make teamwork effici anticip action expect inform exchang provid inform proactiv accomplish avoid issu comput complex belief reason modal petri net approxim finit comput model mental state petri net natur parallel action synchron world transit repres input place output place effect extend standard petri net formal special kind place call control node belief node control node repres belief agent current goal activ team belief node repres belief agent coupl repres includ dynam fact infer world addit serv share mental petri net plai dual role monitor track execut team plan cast gener petri kind team structur teamwork process knowledg individu team knowledg languag call languag encod petri net team member repres background knowledg individu role integr rest team base share mental cast kernel enabl cast agent decid fly accomplish desir select commit proactiv assist effect commun team achiev dynam role select proactiv inform chang give detail descript section formal foundat proactiv inform flow discuss formal foundat underli type inform exchang address cast import ideal inform exchang time inform exchang orient improv effici perform desir minimum avoid cost commun overhead defin quantit util function incorpor cost steam evalu tradeoff decid commun team approach optim inform exchang defin narrow criteria exchang critic inform agent fact commun teammat inform present context carri involv complex reason belief track state agent infer team member make intellig select interact start defin simpl belief languag model theori talk mental state model belief modal oper bill joe usual world semant talk present context refer syntact semant constraint world satisfi express refer specif step plan agent make commit formal condit inform exchang place inform agent agent agent agent believ agent current goal achiev depend accomplish knew tempor oper oper determin inform agent achiev goal commun suppress believ believ belief truth incorrectli believ messag assum agent share common knowledg team goal role oper approach requir monitor mental term belief goal easi highli observ requir extens commun case verbal updat teammat agent probabilist mechan bayesian reason infer state base observ effect action reflect environ difficult state estim track definit describ ideal condit commun restrict commun case infer algorithm design approxim team knowledg briefli describ team knowledg languag cast descriptor encod knowledg oper plan individu definit role team import ontolog commit role fundament treat refer specif step team agent team extern assign mean role defin step team plan dedic agent plai role carri syntax base prefix notat variabl prefix oper simpli atom action environ oper list set conjunct liter predic climb type individu oper team oper individu oper assum execut agent time team oper possibl invok set agent plai agent handl team oper depend identifi mode requir simultan action agent involv xor requir agent act avoid execut agent conflict team oper extra compon defin oper lift heavi object written plan essenti design describ process process consist invoc atom arbitrari combin construct iter syntax process defin obviou intuit condit oper plan instanti construct describ complex process semant formal dynam logic individu plan process descript team plan similar individu extra featur relat assign role declar role variabl form constraint conjunct set condit put restrict role candid satisfi team plan requir carrier fighter role fighter agent addit satisfi predic carrier fighter gener idea agent meet constraint select set assign plai bound role variabl plan role variabl process agent step import implic constraint role specif introduc flexibl teamwork process select role made dynam run time assur constraint satisfi elabor role select scheme section simpl descriptor defin member role capabl capabl treat simplist static associ agent mean interest similar defin agent ti specif step context specif plan agent oper mean action agent act coordin share descript convert petri net reason algorithm oper gener algorithm construct transit atom oper team connect control link input output belief node base plan expand call gener algorithm link main petri net control node action node ground oper team singl petri net describ plan solv place token petri move forward step agent track progress team agent involv model team plan form common understand goal determin individu action fit primari constitu share mental model knowledg compil perform static analysi onlin algorithm relat defin info predic list agent provid list agent inform determin inform analyz oper agent determin potenti provid inform analyz oper agent postcondit oper assum agent execut expect agent consequ action cast agent kernel cast kernel refer set algorithm cast agent determin action commun time step cast agent execut standard loop make queri simul server updat knowledg state world agent check queue messag agent time decid agent examin team plan pend action case agent commun order determin action final agent attempt determin interact initi proactiv inform accomplish cast call implement make infer domain knowledg written form separ knowledg base determin condit constraint evalu interpret express dynam role select algorithm dynam role select support reason role assign gener interact agent correctli execut team plan actor step main set agent potenti involv remov agent incap action remov agent satisfi role defin step step step step xor activ step team plan mark token process dr start determin set agent involv wai order step form return step form return foral agent assign plai step refer oper op agent assign return foral agent return agent foral agent assign specif agent consid role agent assign role step plan agent role directli search involv agent expand agent gener action undefin perform agent team ultim step plan jointli commit determin set agent potenti involv agent unaccept filter agent incap perform remov set constraint role agent satisfi constraint retain accomplish make queri knowledg base construct conjunct condit constraint substitut variabl bound current replac variabl ident candid agent satisfi queri remov set involv agent factor consid remov agent workload high determin set involv step agent decid base size set set simpli team wait accept agent singl agent involv agent act coordin cast agent intellig act illustr sourc effici teamwork gain priori role assign agent figur multipl agent involv step depend type oper involv agent act simultan synchron accomplish broadcast readi signal wait heard agent oper agent action commit carri succe perform act requir agent broadcast success messag complet point agent involv permit drop commit mean step dr algorithm step refer xor agent involv occur agent action disambigu accomplish varieti requir commun agent exchang messag select agent make commit action current algorithm dynam role select produc flexibl teamwork adapt specif handl situat agent lose connect incap dynam team react adjust oper possibl rang spectrum complex redund role assign provid backup behavior dynam team featur ad dr left futur work algorithm algorithm rule extens identifi opportun proactiv inform exchang send inform provid agent track teamwork statu send inform relev current agent inform moment make algorithm dynam run agent independ decisionmak result agent send addit messag agent attempt identifi piec inform agent inform oper agent inform figur gener oper infer accomplish partli examin coupl analysi current state team piec action knowledg assert knowledg base match predic includ agent agent plai role activ activ step plan involv oper refer inform flow match predic select agent provid agent algorithm design gener commun base approxim criteria set section ideal condit desir exchang inform agent commun minim network traffic formal criteria difficult achiev due belief reason model complet belief state static analysi inform flow identifi agent inform base involv team plan action inform due action effect action agent observ inform send messag restrict agent conceiv inform agent piec inform depend support current predict activ node petri net algorithm perfectli optim inform flow depend observ infer assum agent inform chang dynam rate agent observ make problem maintain consist correct distribut knowledg team difficult gener algorithm implement level support interact mix requir direct access simul mental state team deriv potenti inform flow base analysi common knowledg team current state assum monitor member team testb applic construct testb applic base extens world agent act part team plai role shoot carri gold find gener inform flow team type role capabl carrier exact locat adjac room cave experi team plan individu relat teamwork find kill multipl collect gold agent commun proactiv broadcast broadcast control token coordin tabl team experi team team commun dr carrier fighter work proactiv exchang info broadcast info proactiv exchang info proactiv exchang info order evalu effect featur support cast share mental proactiv inform dynam role select set experi team comparison differ team list tabl experi run team team team show benefit share mental model proactiv inform exchang experi run team team show benefit dynam role select experi team team proactiv inform exchang algorithm turn agent team broadcast piec inform member team agent team specif team plan requir carrier find navig fighter room adjac shoot agent team wander independ shoot gold pick make comparison agent team team individu plan perform wander behavior busi teamwork base share mental model team plan agent team team team commun teamwork experi meant show benefit dynam role select team similar team team team dynam role select team implement dynam role select protocol agent team knowledg base reason environ determin prioriti action tabl comparison perform team differ teamwork inform exchang team static averag std dev averag std dev averag std dev kill arrow gold found messag broadcast proactiv inform exchang experi perform randomli gener map world cell pile gold team oper fix number total action perform team case measur number number arrow amount gold gather number messag number proactiv messag averag standard deviat experi summar tabl shown tabl team team achiev compar ident share mental model team higher commun overhead team team perform term number teamwork agent team team carrier team team find fighter kill team chanc kill pick gold individu differ team advantag team fighter arrow shoot locat achiev carrier agent fighter agent proactiv locat infer fighter inform navig fighter team randomli direct shoot carrier locat team consum number arrow half team team resourc util perform measur number kill complex problem measur number pit dynam role select dynam role select figur comparison teamwork dynam role select increasingli complex environ experi perform set randomli gener map world pile gold differ set map increment complex world chang number pit pit team oper fix number action perform team case measur metric experi perform differ shown figur figur dynam role team perform team differ larger complex problem scale fighter chosen kill carrier find kill limit number action world harder fighter navig closest fighter import world pit carrier teamwork imposs perform team drop significantli develop comput framework captur share mental model member effect team challeng critic issu applic rang team train support teamwork cast architectur support flexibl teamwork knowledg specif dynam role select run time leverag share knowledg structur process team reason inform teammat effici cast architectur achiev reason tradeoff flexibl effici simul proactiv inform exchang teammat result demonstr anticip benefit reveal limit current cast implement plan extend role select method find backup agent di hope simul complex teamwork behavior acknowledg research paper support dod muri grant administ afosr partial support intern seed fund colleg engin train system scienc technolog initi refer framework develop team perform measur team perform assess lawrenc erlbaum nj pr hj intent choic commit artifici pr hj teamwork collabor plan complex group action artifici jy guid complet complex modal logic knowledg artifici dynam logic handbook philosoph logic reidel publish perspect san academ control cooper problem solv industri system joint intent artifici autom intellig pilot combat flight simul ai mp model ration agent bdi architectur principl knowledg intern norvig artifici modern approach prentic zyda zyda network virtual environ acm jf knowledg comput foundat pacif task dynam role commun strateg teamwork artifici flexibl teamwork journal artifici intellig fly ing model air mission team journal appli intellig theori practic knowledg engin ra approach design intellig team train system proc fourth intern confer autonom pp
DB/1616 3 approxim nearest neighbor search multimedia amr el abbadi santa barbara abstract develop gener framework approxim nearest neighbor queri categor current approach nearest neighbor queri process base abil reduc data set abil reduc size data object modif wellknown techniqu support progress process approxim nearest neighbor queri user stop retriev process inform return develop techniqu base cluster merg benefit gener class approach approach user progress explor approxim result accuraci metric evalu approxim nearest neighbor search techniqu tradit analyz compar techniqu detail perform evalu demonstr feasibl effici approxim nearest neighbor search perform experi real data set establish superior techniqu exist techniqu approxim nearest neighbor search introduct rapid type inform amount data process rapidli gener approach modern applic gener featur vector repres origin data object similar queri defin find similar data object data set queri object imag similar queri find imag similar imag imag repres featur vector similar imag defin distanc euclidean featur vector problem defin find similar featur vector work partial support nsf grant queri point close relat queri queri featur vector ffl neighborhood queri point retriev typic amount data larg tradit techniqu recent exact result exact defin term featur vector distanc function exact result difficult obtain typic multimedia applic lead ineffici system mean highli subject natur multimedia applic pursu exact answer applic usag inform obtain incomplet inaccur data resourc search resourc give inform typic case data approxim real world entiti gener featur vector origin object base heurist semant queri strict exact queri relat queri closest italian restaur move car easili miss closest includ satisfi driver definit subject depend featur vector creat distanc function defin featur vector featur vector extract method distanc criterion accept case human definit similar differ depend viewer expect user result base similar expect close approxim good human percept featur vector care featur vector model real accuraci develop gener framework approxim nearest neighbor queri categor current approach base abil reduc data set abil reduc size data object high search user satisfi incomplet result queri lead uninterest data modif techniqu support progress process approxim nearest neighbor queri user stop retriev process inform return benefici obtain exact result long fact unnecessari develop techniqu base cluster merg benefit gener class approach approach user progress retriev approxim result accuraci discuss main metric evalu approxim nearest neighbor queri section discuss categor current approach section develop simpl progress approxim techniqu section integr approach section includ detail perform analysi demonstr advantag integr techniqu section conclud paper discuss approxim qualiti metric similar qualiti result set measur combin import qualiti recal complet retriev puriti recal measur retriev find relev object extent includ irrelev object measur system find relev object extent skip relev object irrelev object result set call hit relev object result set dismiss approxim nearest neighbor number hit number dismiss result set size approxim dismiss replac hit comput number captur tradit error refer metric metric evalu techniqu figur queri number hit dismiss captur import inform qualiti approxim figur nearest neighbor queri point point closest point euclidean distanc point close queri point user potenti interest satisfi answer point chanc user interest point approxim return return result queri tradit error metric number hit techniqu number worst error metric techniqu error differenti qualiti answer set point figur fourth closest point spatial close interest user import note rank point term close queri captur inform qualiti approxim point figur interest fourth closest point metric give higher error figur figur deal approxim import develop metric account qualiti answer respect close queri object introduc altern error metric approxim search approxim algorithm return result set real result set comput underli distanc function defin error metric rel approxim squar euclidean approach approxim nearest neighbor queri classifi gener approach solv approxim search problem develop techniqu exampl class data set repres featur vector typic number data object larg problem high dimens scalabl problem larg data set partial offset structur support approxim search approxim search techniqu maxim accuraci minim cost process domin number oper effect approxim search niqu organ data accept accuraci achiev time number page retriev result queri minim nearest neighbor queri answer examin entir repres data object gener class approach approxim search problem natur ffl retriev set data organ small subset data object examin answer nearest neighbor queri ffl repres size repres data set organ partial object examin retriev set reduct approach import scalabl larg data set approxim nn search techniqu retriev featur vector relat subset data set outperform techniqu retriev featur vector entir data set repres size reduct approach crucial high data dimens time dramat degrad effici high queri process briefli discuss techniqu base basic idea retriev set entir data search techniqu portion data ideal relev data queri effect solut index data approach index data set tree structur goal index structur reduc size data set retriev result queri queri retriev subset size exact algorithm consist minimum bound rectangl amount data retriev reduc prune mbr closest data retriev set includ queri result set includ irrelev object context approxim search mechan natur question achiev faster time approach domain develop effect algorithm approxim search techniqu specif focu queri defin find neighbor queri point factor distanc true nn algorithm error bound ffl probabl ffi prior inform distanc distribut queri point local sensit hash structur creat random procedur nn point found constant probabl hash reduc retriev set dismiss disadvantag ffl exponenti repres size index tree effect low dimens queri perform degrad significantli dimens time dramat degrad effici high queri process work reduc set effect approach problem typic repres size reduct reduct approach high data reduc lower dimens search conduct lower space common approach found literatur reduct method transform applic mathemat transform discret fourier transform wavelet transform transform distanc gener approach transform high featur vector lower vector creat lead coeffici transform vector gener idea techniqu depend observ small subset dimens high portion inform featur vector effect repres size reduct approach high nn search basic sequenti list approxim featur base quantiz origin featur vector total size set reduc amount va extens origin handl cluster data set weber bohm state perform previou approach approxim reason approxim close linear approxim search techniqu base overcom bottleneck techniqu omit step exact nn search algorithm speedup achiev approxim nn search techniqu applic va simpl progress approxim approach develop simpl approxim techniqu instanc retriev set reduct repres size reduct approach approach modifi techniqu adapt support progress retriev approxim inform base nn queri sequenti scan retriev set obviou simpl implement retriev set reduct sequenti scan portion data set basic idea access portion data set answer queri base portion read sequenti scan altern index techniqu high data set natur start discuss approxim queri sequenti scan simpl idea summar data set store storag index structur queri data scan sequenti start page data page read order store nn comput portion data set read search stop answer base portion retriev data set repres size reduct illustr distanc preserv transform reduct techniqu adapt progress approxim search distanc preserv suitabl interact approxim search retriev featur vector strategi split featur vector block perform multipl pass featur vector retriev block order import gather import dimens featur earlier step gather import inform wait pass featur system provid user accur approxim result obtain set dimens high amount energi approach set organ base distanc preserv transform work featur high typic transform transform set vector creat set set featur vector maximum energi compact properti data set reduct accumul data energi fix number dimens featur vector divid fix number featur vector store consecut featur vector store separ loss gener simplic valu dimens vector store consecut secondari dimens valu store queri page dimens vector read storag dimens consid similar dimens read similar comput made base dimens read partial result store memori consecut step user stop search queri answer base result found point evalu perform simpl approach compar approach integr approach approxim nearest neighbor search retriev data set repres size reduct strong motiv consid import develop techniqu combin advantag retriev set repres size reduct techniqu effect combin class approach singl reduc size retriev set featur vector size effici approxim search retriev portion data reduc cluster adapt cluster featur vector cluster organ support interact approxim search perform data point data set reduct dimens domain determin base statist analysi data simpl minimum number dimens total averag energi establish domain store high amount energi analysi real data modifi cluster algorithm low domain origin algorithm iter construct number cluster repres cluster error minim detail algorithm figur close observ total scatter monoton algorithm converg algorithm found applic learn pattern imag vector quantiz design start set cluster center set fix ffl denot cluster data point tn assign assign data point tn cluster set comput centroid center mass data point assign cluster tn total number data point assign cluster comput total scatter stop set step figur algorithm signal compress modif introduc algorithm limit size cluster size upper cluster split size lower cluster centroid list centroid split duplic cluster perturb exact copi randomli algorithm sensit initi split start cluster centroid chosen start singl algorithm automat creat cluster popul cluster threshold demonstr lower threshold cluster queri answer retriev small number cluster limit cluster size avoid extrem unbalanc distribut data cluster minimum maximum cluster size domin factor perform reason valu set design expect expect readabl queri result typic minimum cluster size compar expect valu maximum cluster size pick function minimum cluster time minimum cluster size pick initi huge maximum cluster gradual algorithm number cluster reason bound adopt approach work integr algorithm approxim nearest neighbor search work transform find cluster point fall read disk point fall cluster sort point domain base distanc queri point point sort level approxim answer set direct progress refin queri dimens point cluster read disk improv distanc accuraci orthogon direct read neighbor point fall cluster cluster read heurist centroid closest queri point design domain closest read base layer read cluster improv candid point cluster point dimens dimens point cluster dimens point cluster cluster point dimens point cluster dimens dimens point cluster dimens cluster point read dimens point cluster figur chosen progress refin path follow path progress refin framework figur illustr step algorithm high data progress refin structur summar read dimens refin read cluster refin direct import detail read dimens point read read read reach node graph repres stage cluster dimens consid approxim result design page chang reach node path lead portion data consid path node result number page access approxim result set path framework approxim algorithm chosen path import intermedi step path node averag tradeoff path perform path discuss perform evalu section path chosen design path queri node page access partial scan page access partial scan number hit figur achiev approxim search techniqu figur repres initi step algorithm node illustr case dimens cluster comput answer queri analysi perform evalu approxim nearest neighbor techniqu perform detail perform analysi current techniqu describ perform evalu setup data set briefli evalu perform basic partial sequenti va feasibl effici approxim search observ simpl approxim search analyz perform integr approach compar current approach data set demonstr cluster base approach lead improv exist techniqu maintain superior data set size data set applic domain data color color imag histogram data set size vector repres color histogram comput commerci data stock data set dai stock price movement data point data satellit imag textur size vector repres textur featur imag data set challeng problem high index wide high index similar search research color histogram data set page capac assum approxim page size imag data set size page size case illustr result queri data point data queri point type metric discuss perform averag number page access versu averag number hit dismiss averag number page access versu averag ratio total distanc note sequenti search hit read imag color histogram data set data set imag data set size evalu perform simpl progress approach discuss partial sequenti va base approxim nn search metric discuss demonstr feasibl effici approxim nn search perform result establish simpl extend adapt approxim search effect techniqu discuss paper user stop queri anytim result error figur illustr clear demonstr time accuraci achiev approxim nn approach color histogram data set retriev number page qualiti approxim import adapt approxim qualiti user refer point user accur queri run desir page access total distanc ratio cluster page access cluster figur comparison perform cluster va color histogram result obtain data wait end typic long user stop search understand data set desir answer step interact expect qualiti estim data section perform origin approach close simpl techniqu va file base approxim outperform method color histogram data reach partial sequenti scan techniqu retriev approxim time page techniqu techniqu retriev time page va techniqu read partial sequenti scan techniqu achiev va file techniqu achiev perform behavior techniqu similar data set figur depict number hit approxim techniqu implement techniqu analyz perform queri illustr comparison va base approxim techniqu outperform method summar result data color stock imag textur illustr detail perform evalu imag color histogram data summar result stock imag textur featur data set start experi color histogram data reduct perform point data set implement modifi cluster algorithm creat cluster cluster centroid minimum cluster size number cluster scenario repres amount storag repres data set repres minimum cluster size result storag repres percentag larger data set data set higher imag featur data set perform evalu largest ratio addit storag repres entir data set imag data set size repres set process repres neglig compar entir data set cluster page dimens access hit tabl perform achiev cluster analyz perform progress refin discuss read dimens refin read cluster refin direct perform algorithm minimum cluster size present tabl perform result similar minimum cluster size path row bold charact tabl path correspond path illustr figur path error measur path found dynam program techniqu path progress refin framework goal achiev accuraci retriev minim number page perform comparison va base plot figur illustr read algorithm achiev error va techniqu reach error level achiev accuraci cluster base techniqu achiev read va techniqu read page techniqu achiev speedup compar va techniqu mention size repres neglig compar size data set overhead due repres addit page access cluster size data exact seq seq va va cluster cluster seq seq va va cluster cluster tabl comparison number page access data set object metric analyz scalabl techniqu data set size grow evalu perform full partial sequenti va cluster base techniqu compar number page access data set size grow tabl illustr comparison techniqu term number page access queri data set data averag number hit va base approach achiev speedup compar full partial sequenti techniqu cluster base approach achiev high speedup compar techniqu scale data size grow data set data techniqu access time page sequenti time partial sequenti time final time va approach access data size speedup achiev techniqu data object techniqu achiev speedup compar full sequenti partial sequenti va base speedup higher case repeat similar experi similar result metric perform improv data set achiev cluster base techniqu read averag page va read averag page cluster base techniqu read averag va read averag page queri speedup achiev speedup achiev speedup imag color histogram data detail comparison repeat experi imag data set textur featur vector data set size page size speedup achiev data set color histogram data set compar data set result show cluster base techniqu maintain superior larg data set figur illustr sampl perform comparison va cluster base techniqu metric achiev cluster base techniqu read averag page read averag page cluster base techniqu read averag read averag page queri speedup achiev speedup achiev discuss develop gener framework approxim nearest neighbor queri categor current approach retriev set reduct base reduc data set repres size reduct base reduc data object develop simpl progress approxim nn techniqu instanc search partial sequenti scan search page access cluster page access cluster figur comparison perform cluster va data base user stop retriev process inform retriev techniqu effect combin advantag class approach singl reduc size retriev set featur vector size effici approxim search retriev portion data reduc cluster adapt featur vector cluster organ support effici interact approxim search approach user progress explor approxim result accuraci evalu approach context real data demonstr feasibl effici approxim nearest neighbor search main metric discuss paper show superior techniqu current techniqu approxim search perform experi real data set obtain techniqu current approach refer swami effici similar search sequenc int confer foundat data organ page arya mount approxim rang search annual symposium comput page june ullman asilomar report research acm sigmod decemb shaft int conf page januari ciaccia pac nearest neighbor approxim control search metric space proc int conf data page san march dynam reduct similar distanc comput product approxim acm int conf inform knowledg page novemb el abbadi approxim nearest neighbor search multimedia technic report comp sci santa el abbadi vector approxim base index high data set acm int conf inform knowledg page novemb gunther access method acm comput motwani similar search high dimens hash int conf larg data page septemb karhunen linear der ann acad scienc grai algorithm vector quantiz design ieee transact januari method classif analysi multivari observ berkelei symposium math stat volum page manjunath dataset vincent nearest neighbor queri proc acm sigmod int conf manag page san subrahmanian principl multimedia system morgan kaufmann san weber bohm trade qualiti time nearestneighbor search proc int conf extend page march quantit analysi perform studi method space int conf larg data page york august
Agents/1617 1 istituto la ricerca povo itali model check multiag system serafini august technic report fl istituto di limit distribut notic report submit public itc copyright accept public issu technic report earli dissemin content view copyright distribut itc prior public limit peer commun specif request request fill reprint legal obtain copi articl model check multiag system giunchiglia serafini universita degli studi di itali irst istituto di itali abstract model check success techniqu appli design verif finit state concurr reactiv process paper show techniqu lift applic multiag system approach technolog tool develop model design verifi multiag system modular increment effici model check algorithm introduct model check success automat techniqu design verif finit state reactiv sequenti circuit commun safeti critic control system evid model success approach formal method verif order induct theorem tableau base reason modal nowadai effici develop tool implement model spin tool successfulli appli real case industri goal paper show model check applic multiag system variat technolog tool develop model modular design verif multiag system featur exploit huge amount technolog tool develop model check featur order deal real world complex system discuss model check model concurr reactiv finit state process model agent concurr reactiv finit state process paper accept public journal logic comput publish time materi paper definit develop version logic model check algorithm properti call bdi desir intent detail bdi specif agent orthogon tempor aspect aspect kei idea underli approach aspect separ practic thing work ffl tempor evolut agent treat bdi atom atom formula express atom proposit fact formula talk bdi attitud ffl deal bdi attitud fact agent bdi attitud agent model fact access process bdi time verifi truth bdi atom af simpli test af oe hold bdi attitud essenti control process oper iter obviou case nest bdi attitud agent model set process achiev requir set section techniqu develop model check achiev modular process bdi attitud enforc relat independ defin paper structur section describ motiv formal studi rest paper basic ingredi model check proposit tempor logic write languag describ system set verifi finit state model check procedur effici automat determin specif satisfi graph gener system automaton section describ ingredi multiag model check descript increment standard model check notion adopt ctl proposit tempor logic state specif import section show algorithm effici visit smallest conclud detail discuss relev work multiag system conclud remark motiv scenario involv receiv sender continu read subject sensor standard read inform believ correct knowledg subject order minim traffic receiv acknowledg fact back initi state proposit loop initi state loop figur rs algorithm implement scenario fipa compliant architectur network interact figur give algorithm descript commun languag subject inform exchang truth proposit atom return messag sender receiv content fipa primit put commun messag read read standard input oper repres belief perceiv dualli notic commun protocol belief behav coincid figur model fact commun protocol behav correctli nest belief oper belief principl true figur intuit mean necessarili reach state perform action algorithm figur codifi fact protocol implement inform flow fact deliv messag deliv properti prove input languag spin model checker initi state proposit loop set proposit begin end begin end end set proposit begin end begin end figur commun protocol algorithm ffl bdi eventu ffl live read futur notic present aspect interest formal involv multiag formal commun agent agent bound bdi attitud level nest kind properti system properti properti agent multiag tempor logic intuit logic call tempor basic composit formal tempor formal bdi attitud exploit fact introduc step start tempor compon ctl give detail present hierarch metalog formal bdi attitud variat logic introduc integr logic ctl ctl branch time proposit tempor logic turn languag semant languag set proposit set ctl formula oe defin induct oe oe intuit oe mean path oe true mean true state futur oe true state mean exist path true state futur oe true state abbrevi def def oe oe def af oe def ef oe def ag oe def oe def ax oe def semant semant ctl formula standard tempor semant base ctl structur tupl set initi total binari relat label associ state set proposit atom true path infinit sequenc state rs satisfi formula oe ctl structur state defin ffl iff ffl iff ffl oe iff oe ffl oe iff sr ffl iff path ffl iff path oe ffl oe iff oe ds bs br dr ir figur set view section turn semant model situat set agent agent intent agent adopt ffl oe mean agent believ ffl oe mean agent desir ffl oe mean agent intent bring call bdi oper agent simpli bdi denot bdi oper agent ig set bdi attitud oi set set finit string form call ff oi view view oi repres nest bdi attitud empti ffl intuit ffl repres view extern observ behavior multiag system depend extern observ repres person design select process multiag system privileg statu section extern observ point view commun protocol view ffl belief commun view br belief agent final belief belief formal view view view principl view instanc view ir rs view arbitrarili deep nest bdi attitud figur graphic repres situat dark circl repres view exist white repres notic principl infinit case real applic hard applic deeper depth nest bdi make reason multiag system feasibl fact gener complex grow combinatori depth bdi attitud import notic figur crucial notion view tree root view extern observ bs notic view agent agent gener agent section model fact belief associ logic languag ff view ff oi ff languag express true ff languag ffl speak multiag system formula ffl ffl mean true believ languag ii languag adopt repres desir languag belief js section formula dr mean receiv desir true sender believ notic put restrict languag ff oe atom formula ff oe formula studi condit modifi order captur interest empti languag ffl empti talk multiag system extrem flexibl modular defin languag view essenti independ import featur system crucial featur scale complex system agent view agent semant defin semant famili languag fl ff drop index ff oi understand semant understand kei fact hand semant formula depend view formula view written bs express fact believ true formula view br express fact believ true semant associ local view ff set ff interpret ff hand formula view intend mean instanc believ believ true impli subset interpret view truth valu formula intend mean captur notion compat introduc notion tree defin tree famili set ft ff ff ff interpret ff defin compat relat set tree ts element ff fi fi assign truth valu formula intend mean detail discuss intuit technic interpret ffl interpret bs interpret br interpret ffl br bs figur tree section figur show tree associ ffl interpret white box number associ bs associ empti set interpret view relev defin semant start satisfi local view view ff satisfi relat ff formula ff denot satisfi relat symbol context make clear relat step defin satisfi account tree notat denot satisfi tree extend satisfi relat set model ff oe iff ff oe tree satisfi formula formula satisfi element tree associ view introduc notat mean ff ff ff readi defin notion model hm satisfi hm structur formula view definit set tree fl ff close hierarch fl ff ffl ff ff ff impli ff oe intuit underli definit detail condit extern observ consist view condit view correct bdi time oe hold view oe hold view level condit dual properti ensur complet view hm structur formula oe view ff oe read oe true oe hold oe satisfi view defin ff oe iff ff oe intuit order check satisfi oe view ff check interpret ff compat tree result show hm structur defin logic essenti modal oper multimod logic number agent turn semant defin kind languag ff ctl languag view languag fp ff famili set proposit atom ff definit languag call languag fp ff view bdi extend proposit atom bdi atom famili languag fp ff famili ctl languag fl ff ff smallest ctl languag set proposit atom ff bdi atom oe formula oe model fact set rg extern point view commun protocol set proposit atom commun protocol proposit atom worri rs bdi ffl sender belief proposit atom action read send messag receiv messag pb proposit atom languag true state action result easili extend result stronger modal paper stick modal perform effect action sender intern state simpli proposit atom true analog intuit proposit atom form effect action set variabl true sender ascrib receiv belief proposit atom fpg receiv belief proposit atom action send messag receiv messag bdi attitud ff ff famili set proposit atom set bdi atom set defin famili languag fl ff ff ff empti languag formula form oe lb bdi atom form oe oe final ffl bdi atom form oe oe form oe oe lb formula ffl mean receiv futur messag semant semant famili languag defin term hm semant local view set ctl structur ctl structur li state ctl structur obtain replac initi state definit structur fp ff hm structur famili languag fp ff ctl structur ff state ff structur kind hm structur notion satisfi structur formula oe view ff oe read oe true view defin ff oe iff ff oe definit understood basi crucial mutual nest ctl oper bdi oper view structur ctl structur differ initi state redund admit sake clean formal semant section show structur present structur nest ctl oper insid bdi oper ff oe comput notion satisfi ctl structur tree link fact bdi atom hold initi state ctl structur view fact argument hold initi state ctl structur view instanc tree ctl structur view ffl fm hs ig bs fm hs ig br fm hs ig fm hs ig model fact process commun protocol state state protocol believ sender process state sender state believ receiv process state protocol believ receiv process state exp intuit mean sender state possibl mean formula exp bs compat formula true exp true state ctl structur figur exampl constraint kind tree crucial observ concern nest bdi oper insid tempor oper oper involv bdi atom treat ctl jump instanc formula assess truth assess truth futur state ctl structur li establish request tree access view ctl structur fact tree connect ctl structur hold initi solut request initi state ctl structur ffl fact tempor oper state fact state ctl oper repeat state definit bdi live properti introduc section formul bs af ffl oe afb afb turn properti hold intuit hold sender read true bs br exp protocol receiv sender exp exp sender receiv figur tree structur section inform receipt acknowledg set true concern proof statement suffici notic fact properti proof system proof carri notic initi set depend truth eventu proof statement prove step step finit state present system section multiag finit state machin structur gener infinit structur ctl structur infinit number label function map infinit number hm structur infinit number tree infinit compat tree infinit branch infinit number attitud agent infinit number infinit long tree case unbound nest bdi interest extend model check multiag model check model check deal finit ctl ctl structur finit set label function map finit number atom crucial observ finit ctl structur finit state machin fsm object li solut extend notion fsm multiag finit state machin roughli finit set fsm step direct restrict finit hm hm structur finit number finit number view ff ff empti limit number depth finit hm structur infinit number bdi atom finit number process model fsm solv problem introduc notion explicit bdi atom formal fl ff famili finit subset bdi atom ff element call explicit bdi atom definit fl ff famili languag fp ff multiag finit state machin ff ff fl ff total function ffl view ff oi ae oi oi associ finit set ff fsm languag ff view ff oi oi ff condit condit ffl section condit definit hm structur section reason deal finit deal finit set atom construct section essenti thing work concentr process view proposit atom proposit atom specif bdi atom defin oe bdi atom ff oe formula set explicit bdi atom bdi atom set specif intuit explicit bdi atom chang implicit bdi atom chang consequ explicit bdi atom identifi set state variabl space state construct directli transit finit state automaton fix set state fsm extract specif differ initi state state variabl initi state extract top part specif view fsm initi fsm choic initi state initi state complet fsm multipl fsm view defin specif languag issu detail fsm process leav reader definit state transit fsm view br initi state complet defin fsm view proposit atom view concentr explicit bdi atom fsm ffl fsm gener protocol fsm fb fsm gener sender fb set explicit bdi atom empti fsm fsm gener receiv empti set fsm section give algorithm specif view true inform natur languag specif state variabl fsm state variabl formal fact initi state state transit fsm view ff bdi atom specif mention notion step give notion satisfi start notion satisfi ctl formula fsm state notion defin ctl structur determin satisfi proposit explicit bdi atom formula belong formula machineri bdi attitud machineri order deal number bdi atom memor set implicit bdi atom view written defin subset bdi atom ff explicit bdi fo oe ff defin foe oe consist formula oe explicit bdi atom oe true restrict explicit bdi set formula satisfi condit correct definit hm definit section defin satisfi suffici fact comput suffici ctl satisfi compar result relev ctl exploit comput implicit bdi atom satisfi condit correct complet definit ff li ff state formula oe ff satisfi relat oe defin proposit atom explicit bdi fsm satisfi proposit connect ctl fsm oe implicit bdi iff state oe oe oe iff ff oe iff ff ff oe iff ff oe definit item crucial step conjunct element set formula order comput formula oe oe implicit bdi atom end section bdi oper strength modal oe oe theorem view oe oe theorem view set fo oe oe remain item natur counterpart respect definit structur item state fsm satisfi formula formula satisfi initi state item state formula satisfi view satisfi fsm view final item state label formula ff oe satisfi oe satisfi view label prove defin satisfi formula ffl oe afb afb notic formula implicit bdi afb reason fsm ffl item definit impli item definit impli fb state oe fb fsm gener sender sender send sender send messag oe oe oe af oe valid ctl oe afb item definit afb oe oe af oe valid ctl afb afb case item sender send messag oe item definit infer ffl fsm gener protocol ffl path start state item definit impli state oe fsm gener oe item definit impli fsm ffl gener path start state item definit impli fb state oe fb fsm gener oe afb item definit afb notic path start state path start state afb conclud path start afb definit ctl afb afb reach case item item conclud oe afb afb ffl ffl oe afb afb step relat notion satisfi notion satisfi structur structur view satisfi set formula proposit structur finit hm structur vice versa proof view ff set ctl structur finit occur ff tree label function ctl structur label infinit set bdi atom restrict finit subset bdi atom explicit bdi ff ctl structur select subset set ctl structur defin fo oe oe oe oe formula ctl structur view start build label dag acycl set node fs label dag disjoint union fs ff ff li ff sg set label arc defin arc label connect fsm fs ff fs iff foe oe structur tree subgraph label graph defin set formula satisfi ff comput extend label function fsm satisfi implicit bdi atom model check introduc data structur algorithm data structur basic oper standard ctl model check algorithm extend label function fsm consid proposit subformula formula model check call extend fsm fsm context make clear result oper gener extend fsm reli fact label function explicitli defin truth atom problem fsm label function defin implicit bdi truth left truth valu implicit bdi atom occur formula model check definit satisfi definit fix problem implicit bdi state oe crucial observ gener label function finit properti independ formula model store data inform bdi oper coi call compat relat relat defin subset explicit bdi atom view ff coi state foe oe start view ff set explicit bdi atom coi collect fsm state view satisfi argument chosen explicit bdi atom notic version compat relat defin section hm restrict explicit bdi atom subset priori explicit bdi atom relev comput truth implicit bdi atom implicit bdi atom evalu state easili hf coi iff oe iff hf coi oe oe implicit bdi atom set explicit bdi atom satisfi state ff model check algorithm reli global data data structur set fsm ff data structur oper set explicit bdi atom data structur modal oper compat relat coi algorithm multiag model check algorithm view ff formula oe ff model check return true ff notic model check view subpart multiag ff ffl model check multiag ff length model check singl ff length model check view agent algorithm shown figur call algorithm view ff set formula input view ff set formula ff label subformula formula return truth simpli test oe label set initi state fsm ff section fsm satisfi formula initi state satisfi denot set subformula oe oe atom subformula insid distinguish main phase global variabl fo oeg oe explicit bdi atom ff ff ff set fsm ff coi ig fsm state algorithm ff oe end end algorithm oe oi foe oe endif end ff implicit bdi oi foe oe hf coi hs end end end endif end end figur multiag model check algorithm phase initi line collect subformula formula phase model check implicit bdi atom phase correspond loop loop consid turn pair oi step comput set set formula oe argument implicit bdi atom oe subformula notic step perform set explicit bdi atom set implicit bdi atom set infinit notic knowledg formula model check restrict finit set implicit bdi atom relev satisfi formula step call view set phase visit tree structur model extend label function visit fsm leav tree view model check implicit bdi due fact implicit bdi atom occur set formula input notic tree visit tree constitu view comput implicit bdi atom mention top level goal formula input phase phase loop fsm current view ff loop iter perform phase label implicit bdi atom phase correspond level loop enter view implicit bdi atom occur input formula algorithm extend label function true implicit bdi atom oe occur step comput definit satisfi implicit bdi atom set true explicit bdi atom state fsm view ff hf fsm state view compat true explicit bdi atom comput innermost loop comput store argument implicit bdi atom occur true pair hf end loop set implicit bdi atom true current state set extend label phase model check point state current label atom proposit explicit implicit bdi occur suffici appli usual ctl model check algorithm input fsm set formula extend label function subformula instanc notic call model checker black box result state solv model check problem theorem li ff ff state oe iff appli construct oe state proof proce induct nest bdi oper occur oe oe ctl formula subformula oe bdi atom phase leav unchang fact call iter loop phase perform correct consequ correct assum thesi hold maximum number nest bdi oper bdi atom equat state iff hf coi induct phase fsm hs view phase algorithm extend label set state ff bdi atom pair hf coi iff phase label function extend atom phase appli ctl model extend label function subformula oe thesi correct ctl model check algorithm relat work work paper root previou work develop author collabor idea defin modal logic proposit attitud descend tree hierarch metalog introduc idea exploit modular exist system order model complex multiag system introduc idea give semant hierarch metalog chain introduc idea treat belief atom proposit atom exploit fact order achiev comput effici introduc work paper complet deal problem tempor show implement effici multiag model check literatur multiag system theori huge start semin work bratman lot work develop bdi architectur relev work line found formal verif multiag system notic except wooldridg fisher work concurr approach issu proof theoret point rao georgeff work develop satisfi base procedur class bdi logic closest work work rao georgeff face problem appli model check techniqu multiag system similarli emploi class logic obtain combin tempor logic logic bdi attitud result logic similar main differ multiag system uniqu languag semant consist uniqu kripk structur tempor access relat access relat bdi attitud singl make lose modular increment structur correspond agent specif structur model notic import featur give import advantag definit model check algorithm deal natur case bound implement multiag model check directli standard model check implement algorithm visit smallest properti possess algorithm label world improv work dont face problem automat gener model start specif multiag system notic current standard model check languag extend gener model multiag system paper defin base procedur multiag system shown compon model check specif languag finit state model check algorithm extend multiag system approach achiev technolog tool develop model multiag system procedur defin effici begin lot work remain individu class interest defin interest subclass logic defin implement logic full system construct extens model checker test result system applic interest refer bratman plan practic reason harvard long model check intern summer school deduct program fipa foundat intellig physic agent fipa draft giunchiglia giunchiglia ideal real belief belief practic intern confer formal appli practic number lectur note artifici page springer giunchiglia local model contextu reason local compat technic report februari aaai fall symposium context kr nl giunchiglia sebastiani build procedur modal logic proposit procedur case studi modal proc confer autom lectur note artifici intellig august springer verlag report report giunchiglia serafini hierarch logic modal artifici report itali editor intern confer springer gj design valid comput protocol prentic jen control cooper problem solv industri system joint intent artifici kl mcmillan symbol model check kluwer academ rao georgeff model ration agent bdi architectur intern confer principl knowledg reason morgan kaufmann rao georgeff approach verif situat reason system thirteenth intern joint confer artifici intellig page rao georgeff formal model procedur multiag system technic note australian ai level la june wooldridg fisher procedur tempor belief logic gabbai tempor logic intern confer volum page juli
Agents/1618 1 commun agent depart inform scienc uppsala box sweden depart comput imperi colleg queen london uk novemb abstract studi problem endow agent reason belief belief agent commun skill show commun perform exist agent commun languag precondit ect express agent term agent belief illustr result languag program agent mean exampl introduct earlier paper approach agent combin approach agent kowalski sadri approach al similarli kowalski sadri agent hybrid exhibit ration reactiv behaviour reason core agent proof procedur combin forward backward reason backward reason primarili problem solv delib activ forward reason primarili reactiv possibl includ agent proof procedur execut cycl agent alert environ react plan proof procedur agent architectur deal tempor inform proof procedur proof procedur treat input environ agent action abduc adapt techniqu agent capabl reason belief belief agent extend approach agent ning commun capabl agent provid agent commun capabl bene ts commun wide document literatur model agent servic possibl agent provid servic result framework ration hybrid agent reason belief belief agent commun proactiv agent behaviour regul rule friendli agent prove agent adopt primit treat abduc cycl agent architectur predic de ned told express passiv recept messag agent recept inform activ request remaind paper structur section give basic de nition agent section de ne approach commun agent section illustr framework mean section commun perform agent commun fipa acl show express semant term basic primit section conclud discuss futur work agent abduct logic program abduct logic program tripl normal logic set predic languag refer abduc set integr implic ln ln liter possibl variabl integr constraint implicitli quanti scope entir integr constraint atom built abduc predic refer abduc loss gener assum abduc predic de nition abduc thought extend logic program order provid explan conjunct liter variabl implicitli existenti quanti ed explan requir integr constraint di erent notion explan satisfact literatur simplest notion satisfact consist explan program integr constraint function predic symbol written sequenc charact style variabl written sequenc charact ital style start charact bui predic tom constant citi variabl abduct logic program repres bodi inform determin agent behaviour abduct logic program ii monei monei repres belief agent order agent bui object steal repres action agent perform bui observ agent perform repres agent bui monei agent queri repres goal agent actual observ explan repres plan action agent achiev observ queri set abduc explan satisfi queri set abduc inconsist abduct logic program formul behaviour control execut abduct proof procedur autom comput explan queri agent architectur adopt speci abduct proof procedur underli engin architectur reli interleav execut abduct proof procedur observ event place environ agent situat execut action gener abduct proof procedur part plan partial plan agent select execut repres intent interleav agent reactiv environ includ possibl interact abduct logic program tempor event calculu action gener intent time time constrain commun abduct logic program agent abduct logic program repres commun perform abduct part explan plan queri observ paper basic commun perform activ request voluntari provis inform atom repres perform agent time messag identi er agent time messag identi er note agent agent id repres question agent agent time jim manag answer agent agent id recept activ request voluntari provis repres predic de ned term agent told agent time activ earlier time messag identi er id posit answer question messag identi ed con time repli messag note rule logic redund clarifi commun primit context abduct agent gener plan agent agent inform requir explicit time repres appropri order question answer note viewpoint cycl agent action select action execut agent solv match input commun give rise belief agent repres mean predic solv extend intend mean predic de ned repres fact agent believ time adopt monoton belief strategi express agent believ told agent time altern ned strategi express agent believ told agent reliabl time introduct solv predic abduct logic program rise metalog program languag extend term de ned di erent order includ intend repres express languag adopt convent ectiv prolog make distinct variabl metavari introduc metavari substitut intend function predic symbol function predic write conveni repres metavari written sequenc charact ital style start compound term atom repres term term term function symbol constant stand variabl note introduct solv problem link belief ignor time paramet present transform achiev ect ection atom knowledg base agent rst assert atom form provabl provabl axiom schemata explicitli present abduct logic nite logic program rule integr constraint advantag time explicit paramet solv correct dynam belief assum agent belief grow monoton adopt gener tempor reason theori scope paper assum solv atom atom argument sequel omit messag identi er atom predic omiss loss clariti section omit time argument told solv ignor tempor reason issu abbrevi program agent agent repres abduct logic program ii car good offer good agent believ told agent fourth fth agent desir car free good price integr constraint agent desir told agent good price make er note accur integr constraint includ time note agent symbol agent send direct messag speci agent receiv sender messag messag lost treat action agent agent cycl agent select commun action form agent agent agent attempt execut attempt record agent agent conjoin observ agent agent addit input attempt record agent agent conjoin observ agent agent borrow demonstr execut proof procedur agent action proactiv commun agent volunt inform plan phase inform choic intent regist place pari make travel arrang pari simplic omit peter origin goal repres peter earli send date ticket ticket trust trust ticket credit told told ned page travel citi date date train plane deadlin earli registr jelia citi date mean make book journei make peter avail ticket agent make con subgoal solv note repres transact time book made time case extra argument told repres transact time ignor issu simplic peter believ told agent peter trust told topic relat topic ticket agent trustworthi subject avail ticket relat travel detail peter credit card peter set integr constraint earli ticket ticket ticket state peter polici regist confer advantag earli registr state make reserv mode transport subject strike state peter request reserv ticket agent peter respect peter answer ticket answer peter set abduc ticket agent ticket credit ticket agent respond agent request reserv reserv ticket agent trust agent agent paid agent told credit card detail ticket agent set integr constraint ticket ticket ticket ticket ticket ticket ticket agent agent inquir ticket agent relat origin queri ticket agent send con reserv make ticket agent respond request reserv give cycl agent run parallel commun place agent omit detail goal order provid overview goal underlin action select perform respect agent assum includ commun success peter ticket agent send ticket id ticket id ticket id ticket id ticket id ticket credit id ticket credit id id ticket id commun primit consid commun exist commun kqml fipa acl commun includ addit achiev unachiev kqml fipa mention section show perform fipa acl express de nition framework ignor paramet fipa acl ontolog plai role formal semant agent commun problem semant perform languag check agent behaviour conform semant kqml fipa acl semant express precondit ect perform distinct commun fipa section express precondit ect perform fipa acl integr constraint de framework remaind time argument atom section perform inform fipa acl directli correspond perform precondit agent inform agent agent express integr note integr constraint replac ect agent believ inform express note ned version agent believ provid trustworthi agent trust subject relat perform fipa acl directli correspond perform precondit agent proposit prior knowledg agent express integr stand knowledg time ect agent repli posit answer believ proposit express integr perform inform domain object descriptor correspond inform sati es properti precondit express integr integr constraint replac express perform fipa acl extend integr constraint commun perform request mean agent request agent perform properti express true extens approach subject futur work order express perform extend framework addit stand uncertain time confirm express precondit express integr constraint con rm proposit believ believ uncertain present approach agent reason belief belief agent commun approach extend mean commun approach agent illustr approach mean number exampl approach present paper reli basic commun shown commun primit exist commun languag express term de nition integr constraint framework semant directli express framework conform behaviour agent semant obtain sound proof procedur appli agent cycl investig remain addit perform primit exist commun languag agent de ned integr constraint commun agent alongsid atom treatment time time plai import role agent applic explicitli account implicitli assum di erent agent share content languag assumpt essenti de act mediat agent di erent content languag virtu metalog featur languag interest applic agent virtual marketplac web user creat autonom agent bui sell good behalf chavez mae user creat sell bui agent give descript item sell bui main goal approach user negoti buyer sell good higher user advantag process speed commun bandwidth chavez mae agent sell contact interest parti bui negoti negoti make requir user chavez mae point agent lack experi demonstr desir agent make process close mimic peopl direct motiv approach agent reactiv input ration adopt approach applic issu futur research acknowledg author grate anonym comment rst author support praxi scholarship author support uk epsrc project refer sadek ration agent kernel cooper spoken dialogu implement logic theori interact jp nr intellig agent iii springer lnai chavez mae agent marketplac bui sell good proc intl conf practic applic intellig agent page practic applic cohen levesqu commun action arti cial agent proc intl conf multiag aaai page mit ectiv agent metalog program alberto lnc page metalog program semant applic int theoret arti cial sadri toni combin introspect commun ration reactiv agent furbach del proc european workshop logic arti cial intellig lnai springer page eld kqml agent commun languag bradshaw softwar agent mit foundat intellig physic agent speci cation part agent commun languag fung kowalski iff proof procedur abduct logic program logic toni role abduct logic program handbook logic arti cial intellig logic volum page oxford kowalski sadri logic program system annal mathemat arti cial intellig kowalski sergot calculu event gener labrou finin semant agent commun languag huhn read page san morgan kaufmann singh formal theori commun multiag system proc intl joint conf arti cial page morgan kaufmann van van der ch meyer commun ration agent nebel advanc arti cial lnai page dignum cooper inform agent commun kandzia cooper inform lnai page wagner secur multiag system kandzia cooper inform lnai page
HCI/1619 4 open agent framework build distribut softwar system david martin adam cheyer dougla moran artifici intellig center sri intern avenu menlo ca usa abbrevi open agent architectur abstract open agent architectur develop year sri make softwar servic provid cooper effort distribut collect autonom agent commun cooper agent broker match user descript capabl agent gener requir user agent number agent involv satisfi request oaa structur minim effort involv creat agent legaci written languag oper encourag exist dynam flexibl agent commun distinguish featur oaa compar relat work includ extrem flexibl deleg complex data manag provis multimod user support includ user privileg member agent commun paper explain structur element system construct oaa characterist major compon oaa infrastructur includ agent interag commun capabl servic manag data autonom monitor trigger provid technic describ motiv oaa situat featur realm altern softwar paradigm summari system built descript introduct evolut model design construct softwar system driven forward close interrel ffl adopt network comput model lead greatli relianc distribut site data process resourc report comput ad internet paradigm shift comput move requir relev data program resid user desktop machin data routin access comput spread world increasingli rich multimedia audio video popular includ program download execut local machin increasingli network approach softwar design flexibl composit distribut process element dynam chang unstabl environ ffl varieti applic design user expect softwar applic push persist monitor inform mainten user person share exampl simplest manifest trend commerci introduc significantli advanc case emploi recent research result artifici data machin field ffl complex develop avail multimedia materi environ creat demand intuit user interfac system provid sophist servic longer lend familiar model individu user master fix select command provid singl applic ubiquit network brought situat typic user softwar servic access servic infrequ time accommod usag pattern call approach input modal wide speech recognit abil manag present system multipl media provid opportun fashion style interact draw heavili experi interact open agent architectur architectur framework construct multiag system develop artifici intellig center sri open agent architectur oaa trademark sri intern brand product trademark regist trademark respect holder desir accommod develop area integr suitabl practic section review approach distribut situat approach scope relat work briefli rang system built date subsequ section provid detail descript work oaa motiv concept earli version oaa present system martin martin moor moran moran paper present detail technic explan resourc provid oaa technolog distribut comput briefli review disadvantag relev approach distribut includ distribut mobil softwar engin distribut object approach provid advanc standard procedur languag respect reusabl modular ffl encourag creation librari interfac minim depend underli algorithm data structur program intern made date requir modif code librari ffl permit extens modif librari routin data requir sourc code origin librari ffl bodi code work arbitrari number data type program languag build monolith program object build distribut object technolog omg corba microsoft dcom creation program compon spread multipl machin implement relationship distribut object system registri mechan registri call object request store interfac descript object orb client transpar invok method remot server orb find object implement pass invok return result client awar object program oper system aspect part object interfac distribut object offer power paradigm creat network aspect approach perfectli tailor constantli chang environ internet major restrict approach interact object fix explicitli code instruct applic develop impli difficult object applic bring inher depend object interfac definit explicit method restrict approach result relianc remot procedur call style commun easi singl thread execut model facilit program exploit potenti parallel comput expect distribut environ rpc block scheme scale transact mobil object mobil call mobil bit code move execut site programmat effici interact local environ commerci instanti technolog includ aglet concordia voyag objectspac type mobil object paradigm offer advantag tradit distribut object approach advantag includ ffl network queri electron commerc effici perform test data bring test data bring larg amount data test program ffl mobil agent spawn parallel accomplish task disadvantag mobil agent approach ffl fashion similar agent develop programmat interact target environ ffl gener coordin support encourag interact multipl particip ffl agent written program languag support execut distribut technolog support heterogen commun written program languag blackboard architectur blackboard schwartz gelernt linda multipl process commun read write tupl global data store process watch item perform comput base state add partial result queri process blackboard architectur provid flexibl framework problem solv dynam commun distribut process blackboard approach solut elimin tightli bound interact link distribut technolog requir commun advantag programm refer specif process framework provid programmat control case practic softwar engin research commun approach distribut comput cast problem model commun cooper autonom entiti effect commun independ actor requir transport mechan carri messag asynchron interact protocol defin type commun interchang social implic expect content languag permit express interpret set share vocabulari mean concept call mechan permit richer style interact particip express distribut object rpc model blackboard architectur central exchang approach wide foundat technolog softwar engin knowledg queri manipul languag finin specifi interact conjunct knowledg interchang format content ad hoc formal ontolog kqml introduc symbol perform captur inform place creat standard interact import aspect multiag kqml limit relianc fix core set atom inevit difficulti arriv set capabl express kind interact servic request influenti make stronger assumpt knowledg process individu base structur agent activ concept intent bdi emphasi higher level abstract extrem import give direct work applic limit structur requir individu difficulti legaci system philosophi goal oaa approach distribut comput share common paradigm outlin distribut object primari goal oaa provid mean integr heterogen applic distribut infrastructur sought incorpor dynam extens blackboard effici mobil rich complex interact commun agent spell greater detail goal categor gener head user softwar engin versatil mechan cooper refer abil distribut softwar compon agent commun meaningfulli framework provid mechan level framework face import challeng area true primarili individu necessit greater flexibl interact commun agent coordin refer mechan commun agent work product task goal framework ffl provid flexibl assembl commun autonom servic provid develop time runtim agent conform linguist ontolog requir effect commun particip agent minim prerequisit knowledg characterist player agent duplic overlap capabl coexist system make redund ffl provid flexibl structur cooper interact member commun agent framework provid econom mean set varieti interact pattern requir inordin amount complex infrastructur individu agent provis servic depend configur agent ffl amount structur individu agent approach construct multiag system requir individu agent kqml neutral content minim structur requir individu agent bdi paradigm demand make assumpt natur program element individu agent oaa fall goal provid rich set preclud softwar engin goal defin ffl includ legaci applic legaci impli establish system fulli control system refer applic develop partial control exampl data sourc servic world wide simpl applic cooper virtual remain properti separ corpor entiti class applic member agent requir overwhelm integr effort user interfac system multipl distribut possibl dynam configur requir craft intuit user interfac ffl provid conceptu natur mean interact multipl distribut compon numer dispar complex task implement user express request detail knowledg individu agent speech handwrit natur languag technolog agent architectur prepar form input plai role task agent commun ffl treat user privileg member agent commun provid level task specif softwar reusabl mean translat level level human construct interact seamlessli incorpor type ffl support collabor work share data process user agent realist softwar engin requir framework address practic concern express ffl minim effort requir creat wrap exist applic ffl encourag compon concept agent object natur conceptu framework long mechan encapsul interact structur appropri ffl support mobil platform platform serv host requir instal massiv environ construct individu agent small modest process requir ffl minim platform languag barrier creation wrap exist requir adopt languag environ overview oaa present overview describ basic compon structur illustr concept sampl applic oaa system structur figur present structur typic small oaa show user interfac agent applic agent organ commun peer common relationship facilit agent facilit special server agent coordin agent commun cooper facilit provid global data store client adopt blackboard style interact note system configur limit singl facilit larger system assembl multipl sort structur shown figur categori agent illustr applic user interfac agent categori recogn convent formal distinguish system applic agent specialist provid collect servic sort servic technolog speech natur languag form data retriev data travel plan reserv applic agent base legaci applic case agent wrapper call api role assist facilit agent coordin activ agent facilit possess coordin augment knowledg reason learn user interfac agent plai extrem import interest role oaa system agent implement collect monitor input modal pen collabor produc interpret current input shown figur modal agent agent facilit refer client agent call act client commun essenti servic client client agent make connect parent facilit agent inform parent facilit servic provid agent facilit send request express interag commun languag agent process return answer statu report facilit process agent make varieti capabl provid oaa icl request servic set read write share data facilit client agent maintain share common infrastructur construct agent suppli agent program languag librari design minim effort requir construct maxim legaci system agentifi sampl interact obtain intuit oaa typic function briefli oaa appli real applic autom offic mobil execut telephon laptop comput access task commerci applic email system run back offic depict figur applic agent wrapper make function natur languag vocabulari agent commun registr facilit user interfac shown figur run user local laptop accept user send request facilit deleg displai result distribut comput user interact directli specif remot applic click activ area call form window make queri standard interfac dialog mechan user express task execut spoken english explicitli agent agent perform task question written user request ui turn natur languag agent translat queri icl accomplish nl agent make request agent commun resolv unknown word ui agent respond current calendar agent defin result icl express rout facilit agent calendar execut request result back ui agent displai spoken request mail arriv notifi produc slightli complex involv commun agent system translat icl facilit instal trigger mail agent messag secur messag arriv mail trigger facilit match action part trigger capabl publish notif agent notif agent make rule optim output modal speech gener inform individu user prefer determin relai messag media transfer applic agent competit parallel locat user calendar agent guess find cooper parallel produc requir inform number user audio file email telephon agent call verifi ident plai messag kei idea illustr exampl agent connect regist capabl specif natur languag user dynam interpret execut task distribut agent defin set input system singl request produc cooper flexibl commun written program languag spread multipl machin detail view open agent order present begin mean group agent work mechan support share data repositori final describ basic infrastructur underli construct individu agent illustr technic aspect describ applic implement oaa mechan cooper cooper agent oaa system achiev messag express common structur provid servic regist capabl specif request servic construct goal relai facilit coordin effort servic provid satisfi goal interag commun languag oaa interag commun languag task coordin languag share platform run comput languag program icl agent task subset agent explicit control constrain manner oaa agent emploi icl perform execut exchang set manipul data agent commun fundament program element express icl event activ commun structur transmiss handl event event serv messag regul activ individu thought goal satisfi event set content agent librari procedur oaa solv agent request servic agent call oaa code agent result event form ev post ev post solv goal param list paramet content paramet vari type event icl includ layer similar spirit provid content analog provid kif layer icl defin event paramet list event type content layer consist specif data element event protocol approach aspect element interag repres select event combin select valu orthogon set paramet approach offer greater express approach base sole fix select speech embodi kqml request satisfi queri emploi perform type request express event type ev post solut paramet posit integ request solut omiss solut limit request accompani combin refin semant forc desir perform chosen singl captur entir commun requir difficult challeng languag select set perform desir function unmanag larg debat set perform consum discuss kqml commun content layer icl design extens prolog program advantag unif featur prolog oaa agent librari provid support manipul icl express emb content express languag icl advantag express content icl primari reason facilit access deleg request give facilit inform natur make facilit compound individu deleg import declar program element repres icl express addit capabl request trigger share data element provid servic agent particip system defin publish set capabl express describ servic declar establish interfac agent interfac facilit commun deleg servic request part agent partli due prolog basi refer capabl declar solvabl major type solvabl procedur solvabl data solvabl procedur solvabl perform test data solvabl access collect data creat agent mail procedur solvabl defin send messag test messag subject arriv mail displai messag onscreen wrapper defin distinct data solvabl relat present data solvabl provid share data agent requir permiss primari differ type solvabl procedur solvabl handler declar defin data solvabl handl request data solvabl provid transpar agent data solvabl dynam collect fact modifi agent provid agent requir special data facilit maintain fact featur mention section spite note mean mean agent request type solvabl request servic section request agent servic arriv form event agent facilit handler deal event handler code fashion depend natur avail librari legaci hard requir handler return express icl depend natur indic success list solut request data agent librari set procedur agent modifi time connect facilit specif solvabl solvabl list list declar format goal syntact form icl logic servic provid solvabl icl structur consist functor argument structur prolog goal argument structur option includ paramet refin semant solvabl type paramet solvabl data procedur type paramet handler solvabl paramet data solvabl mention section case data privat paramet restrict solvabl declar agent paramet valuabl agent intend solvabl sole intern advantag oaa mechan access agent solvabl agent select time support agent chang statu solvabl privat time permiss solvabl provid mean agent control access servic agent restrict call write solvabl select agent mean request servic encapsul write mean modifi collect fact data solvabl default solvabl data solvabl solvabl permiss chang agent provid solvabl solvabl simpl email agent includ symbol indic input output present document paramet permiss default specif default valu omit paramet permiss list programm defin agent capabl term solvabl declar creat vocabulari agent commun agent problem ensur agent speak languag share unambigu semant call ontolog problem oaa tool agent develop tool servic translat solvabl minim oaa reli vocabulari formal engin ontolog specif domain ontolog construct increment develop bodi agent applic oaa hard restrict basic form solvabl common usag convent illustr util solvabl ffl class servic tag type solvabl special modifi serv execut select specif type messag ffl action gener written imper verb functor direct object item argument requir argument extens paramet list argument paramet list hold option inform usabl function gener natur languag parser make paramet list store preposit phrase adject illustr mail bob translat send bob leav transport unspecifi enabl messag transfer agent compet opportun carri request request servic agent request servic commun deleg task goal facilit request call agent option specifi paramet advic facilit determin execut task import note call solvabl requir agent agent agent handl call agent address paramet situat gener advantag leav deleg facilit program style greatli reduc depend compon find distribut framework oaa librari provid agent unifi point entri request servic librari procedur oaa solv style logic oaa solv retriev data initi action put call data solvabl call procedur solvabl compound goal power featur oaa abil client agent submit compound goal facilit compound goal oper similar emploi comma arrow condit execut extens prolog syntax semant interest oper disjunct execut simultan subgoal execut subgoal compound goal address set paramet attach subgoal form address paramet option specifi agent handl emploi type refer uniqu symbol shorthand agent uniqu assign reli network address scheme ensur global uniqu agent symbol uniqu address includ symbol facilit agent call shorthand includ refer agent address goal subgoal option address facilit job suppli explain section capabl develop distribut execut compound goal power conjunct natur languag queri function distinct agent combin simpl spoken utter bill smith translat compound icl refin servic request paramet goal draw featur refin request mean frequent import solut return repli valu goal queri data cach paramet request local cach fact solvabl remain paramet fall advic feedback feedback paramet servic request receiv inform facilit goal handl feedback includ thing ident agent involv satisfi amount time expend satisfact goal advic paramet give constraint guidanc facilit complet interpret goal solut limit paramet request solut interest facilit servic provid free inform optim effort time limit long request wait solut level limit remot facilit consult search solut prioriti paramet request urgent previou request satisfi advic paramet facilit parallel satisfact part goal combin filter result arriv multipl solver request consid candid solver subgoal request mention section advic paramet intend provid extens set orthogon paramet capabl combin icl goal languag fulli express inform flow particip multipl paramet group group result advic paramet express concept analog kqml defin classif problem type kqml perform repres combin valu paramet parallel solut limit problem strategi send queri math solver collect signal conflict answer return strategi send request signal problem return answer ident facilit receiv compound job construct goal satisfact plan satisfact effici manner consist advic facilit facilit plai central role oaa notion facilit similar genesereth facilit maintain knowledg base record capabl collect knowledg assist request provid servic make contact notion facilit stronger respect encompass gener notion transpar mean request agent gener facilit manag satisfact request knowledg ident locat satisfi agent request data request agent oblivi number agent involv satisfi request transpar deleg agent capabl treat abstract descript entri point librari bodi code oaa facilit distinguish handl compound goal section involv type determin specif execut compound goal rout result optim complet includ parallel interpret optim goal deleg step result goal unambigu mean agent particip satisfi complet address goal involv select agent handl subgoal subgoal select facilit knowledg capabl client agent possibl strategi advic explain optim step result goal interpret requir exchang facilit satisfi exploit parallel effort satisfi affect goal mean interpret goal involv coordin request satisfi assembl coher return request respect oaa facilit extend basic concept facilit facilit emploi strategi advic request result varieti interact pattern instanti satisfact request strategi mention section addit possibl mention section oaa concept facilit gener handl distribut data updat request request instal strategi emploi deleg servic request data mainten mechan discuss section note relianc facilit hard requir request servic match interag commun facilit mention support agent librari explicit address plan support oaa design encourag develop emploi paradigm minim develop effort advantag facilit provis transpar deleg handl compound goal stress facilit view cooper task complet facilit initi respond request manag satisfact updat data instal trigger agent agent approach make agent advantag facilit knowledg current membership dynam commun facilit coordin servic develop lessen complex individu result manag softwar develop enabl creation lightweight agent maintain data repositori agent librari support form data solvabl creation data solvabl requir explain section queri data access oaa solv clarifi wai solvabl maintain mention featur data solvabl conceptu relat relat fact solvabl maintain agent handl incom messag queri data solvabl refin default behavior librari manag paramet solvabl declar paramet singl solvabl singl fact point time paramet uniqu valu duplic valu store paramet data solvabl make concept ownership persist data solvabl implement share maintain record agent creat fact agent consid fact owner agent fact remov agent offlin agent longer particip agent termin data solvabl declar fact automat maintain persist data solvabl retain fact explicitli remov agent librari procedur agent updat fact belong data local requir permiss procedur refin paramet appli servic request address paramet agent updat request appli servic updat request agent provid relev data solvabl default behavior maintain coordin copi data set multipl support collabor activ feedback connect oaa data mainten request abil provid data solvabl limit client data solvabl maintain request client mainten share facilit client strategi stabl collect facilit workload predict blackboard style commun data solvabl publicli readabl thought global data cooper group agent combin agent organ effort style commun agent exist natur languag process natur languag process servic varieti peer expect agent vocabulari prepar indic word part logic form result word make nl agent instal data solvabl basic part speech facilit solvabl empti list solvabl permiss paramet accept default permiss paramet provid offic assist agent make servic agent librari procedur oaa post noun boss concept autonom monitor trigger oaa trigger provid gener mechan request action set condit met agent instal trigger facilit peer agent type time addit trigger specifi condit express icl condit circumst trigger action happen fire trigger set fire unlimit number number posit integ trigger wide varieti wai oaa monitor extern sensor execut track progress complex coordin commun agent essenti synchron relat task instal trigger agent thought agent commit carri condit hold true type trigger inform ffl commun trigger incom outgo event monitor simpl commun trigger solut goal return send result present manag displai ffl data trigger monitor state data repositori maintain facilit client data trigger condit test replac fact belong data solvabl data trigger user simultan log send alert messag system ffl task trigger arbitrari condit test process incom event timeout occur event poll condit goal execut local icl test solvabl satisfi task trigger check intern condit case condit captur case mail agent watch incom airlin agent monitor flight arriv schedul task trigger mail arriv notifi ffl time trigger monitor time condit alarm trigger set fire singl fix point time decemb recur basi minut trigger implement data declar implicitli agent request trigger agent paramet appli servic data mainten request import featur oaa trigger contrast program agent trigger instal evalu condit part consequ trigger action deleg facilit execut commerci mail program rule form mail arriv delet archiv action user select fix set consequ compound goal execut dynam commun agent agent defin function unanticip agent fax join modif exist code requir user make mail fax bill agent librari oaa agent infrastructur construct program includ visual delphi mention goal librari design minim effort requir construct maxim legaci system agentifi librari famili provid function mention lack space declar agent registr manag procedur oaa oaa oaa updat data solvabl accomplish famili procedur includ oaa oaa oaa trigger maintain procedur oaa oaa oaa essenti element protocol detail messag encapsul servic request provid made transpar applic code simpler enabl develop focu desir detail messag construct commun request servic agent call librari procedur oaa solv call result messag exchang messag servic send messag desir result request agent result return argument oaa solv messag involv scenario explicitli construct agent develop descript synchron oaa agent librari interag mechan support intern structur individu mechan cooper worth note infrastructur cut mechan support agent intern agent interact integr fashion servic provid agent access agent procedur emploi request servic agent differ address paramet accompani develop code avoid redund entri point function characterist construct messag integr interag appli librari function includ data manag tempor control mechan oaa applic oaa implement fifteen applic integr technolog imag speech text virtual realiti tabl partial list applic exampl illustr qualiti import framework unifi messag unifi messag applic extend autom offic present section emphasi ubiquit access dynam present inform servic support agent commun agent applic depict figur real dialog current system provid insight system built oaa telephon plan trip boston give present capit sentenc phrase spoken user telephon process phone agent spoken system gener sri intern enter user id password id good adam cheyer listen user interfac includ telephon identifi user inform resolv anaphor refer multipl user interfac oper user work todai todai schedul adam meet dave present softwar agent end schedul user oper graphic user interfac conjunct autom offic result spoken request displai calendar window current schedul graphic displai gen nl agent task produc spoken plai phone gen nl share dynam vocabulari phrasal rule natur languag parser strategi produc queri simpl multimedia utter find fridai weather boston weather boston fridai sunni morn partli afternoon percent chanc late high mid addit data access legaci content retriev agent provid oaa wrapper websit find mail messag messag messag mark entitl messag messag jennif entitl plai messag messag part part part speaker confer schedul post homepag part part present home page print messag command execut mail messag longer simpl text consist multipl subpart audio attach user plai complex email messag agent implic translat request challeng develop system enabl agent cooper flexibl manner allevi explicit code agent interact combin oaa agent concentr leav work deleg agent commun printer defin solvabl defin basic postscript text print object refer find document refer document postscript object type text print type type email messag salient mail agent receiv request produc messag postscript mail agent save text messag webpag messag part simpli send oaa solv request agent accomplish task user telephon user interfac move start web access url referenc mail messag record messag record voic messag start speak updat web page present schedul messag record web page note trigger ad request local agent interfac web browser return current page solut request web nl agent trigger instal web agent monitor page notifi agent find user transmit webpag messag media transfer mechan base unifi messag applic intend show oaa concept produc simpl extens solut multiag problem difficult implement rigid framework applic support adapt present queri dynam complex share context refer resolut flexibl translat multimedia data present applic highlight parallel competit cooper agent multimod fusion multimod map goal multimod map applic explor natur wai commun commun agent inspir professor instruct student combin underlin multimod map interact interfac user write speak travel plan domain inform includ data retriev distribut softwar agent commerci internet site type user interact multimod issu handl applic illustr scenario featur work exampl current system sara plan busi trip san schedul activ weekend turn laptop execut map select san francisco map scroll area draw show hotel icon repres hotel textual descript hotel pool hotel disappear hotel close hotel disappear show photo hotel photo photo price price previou hotel draw scroll displai adjust draw arrow distanc hotel distanc displai place distanc distanc displai sara decid human advic pick call travel write start collabor synchron displai present ident input action remot speak circl im hotel draw area nice visit walk hotel map scroll area hotel select visit show video video lot fun main research focu gener interpret incom stream multimod input provid user interfac dynam set distribut applic built agent oaa coordin competit cooper inform work parallel resolv ambigu level interpret ffl process data pen input interpret gestur handwrit separ recognit process multipl return modal recognit compon ffl anaphora resolv anaphor separ inform sourc contribut resolv context object utter photo natur languag compon return list hotel talk combin spoken utter photo arrow gestur desir object deictic refer occur accompani verbal command visual request photo user interfac agent determin hotel visibl desir refer object inform agent combin result resolut strategi exampl photo hotel menlo provid sourc inform phrase list mean exhaust exampl resolut method includ spatial reason hotel user prefer favorit ffl multipl modal modal reinforc disambigu interpret interpret arrow gestur vari accompani verbal command info system account accur unambigu arrow select singl hotel ffl addit collabor human autom agent share workspac pen spoken utter meant system implement multimod map applic exploit featur ffl refer resolut task deleg handl distribut fashion parallel paramet oaa encod rule facilit make prioriti knowledg sourc ffl basic collabor handl oaa data manag servic map user interfac publish data solvabl element screen defin element attribut updat public automat replic member collabor callback produc visibl effect data chang ad remov ffl function record playback session easili implement ad agent member collabor commun agent record data read replic share environ ffl code interpret travel plan dialog cleanli separ natur pen map user interfac agent compon modif add multimod map capabl applic activ crisi tool video analyst relat work system shown distribut problem solv foundat work agent technolog interag commun protocol pattern agent interact basic facilit includ agent server type registri servic insuffici space cover gamut work agent restrict mention project evolv notion facilit genesereth role facilit genesereth describ facilit base logic reason facilit share emphasi rout synthesi complex deleg oaa servic request influenc strategi facilit infosleuth system emploi matchmak agent abil reason deduct express requir match capabl servic provid kqml finin broker broker perform suitabl structur basic interact player facilit note provid commun protocol specif strategi emploi mean facilit select scope kqml specif sycara al delin concept facilit explor tradeoff inher approach find broker facilit system exhibit dramat perform base matchmak futur direct work remain implement conceptu level area investig includ robust improv develop runtim improv facilit strategi servic facilit offer advantag weak respect scalabl fault toler group facilit collect client agent natur build block construct larger system minu potenti facilit commun critic point failur task requir sequenc exchang facilit assist find establish step commun dedic channel straightforward extens plan incorpor complex task gener area explor address issu varieti topolog exploit construct larg system investig exhibit desir properti respect scalabl fault toler modular facilit kei function goal plan readili separ goal execut configur execut task distribut free facilit incorpor mechan basic transact period save state agent facilit roll back latest save state event failur agent respect agent develop plan updat initi work area design improv linguist graphic monitor agent desir work agent research demonstr autonomi individu agent categori inform filter person smarter autonom facilit mean coordin multipl critic evolut multiag system experi date shown handl compound advic facilit advic discret facilit limit interest explor sophist strategi guid higher level advic draw exist work field plan field queri plan facilit benefit richer agent capabl summari open agent architectur framework construct distribut softwar facilit cooper task complet dynam configur autonom agent present underli compar featur distribut summar applic built date major compon oaa mechan assembl system mechan includ gener approach achiev cooper organ declar capabl construct goal user role facilit coordin satisfact subject advic constraint accompani facil creat maintain share repositori trigger instanti commit agent refer adam cheyer luc julia multimod approach proc intern confer cooper multimod commun adam cheyer luc julia multimod tool video analyst intern confer intellig user interfac san januari adam luc martin unifi framework construct multimod applic confer cooper multimod commun san januari philip adam michel open agent architectur proc aaai spring symposium seri softwar page march american associ artifici intellig tim yanni jame mayfield kqml agent commun languag jeff softwar agent mit cambridg fipa foundat intellig physic agent specif onlin gelernt mirror world oxford york michael genesereth richard fike knowledg interchang format version refer manual technic report stanford ca onlin genesereth softwar agent commun genesereth singh knowledg share approach softwar technic report depart comput stanford ca adam luc kurt konolig robot make short report sri intern robot team ai yanni labrou tim finin kqml specif technic report comput scienc electr engin maryland baltimor md februari onlin david adam lee agent develop tool open agent architectur intern confer practic applic intellig agent page april practic applic compani david dougla adam cheyer inform broker agent architectur intern confer practic applic intellig agent april practic applic compani microsoft distribut compon object model protocol onlin dcom robert john harri mark adam cheyer interfac battlefield simul technic artifici intellig sri june dougla moran adam cheyer intellig user interfac proc intern workshop human interfac technolog page octob dougla adam luc david martin open agent architectur multimod user interfac intern confer intellig user interfac januari nodin unruh facilit open commun agent infosleuth infrastructur technic report microelectron comput technolog texa april object manag group complet specif onlin rao georgeff bdi agent theori practic technic note april david schwartz cooper heterogen system kluwer academ dordrecht williamson matchmak broker proc intern confer system decemb figur oaa system structur applic descript autom offic mobil interfac integr commun commerci offic applic ai technolog speaker text natur languag interpret unifi messag ubiquit access web messag servic multimod map interfac distribut web data anim voic interact interfac web live demo speech recognit interfac control simul forc spoken dialog summar system summar spontan spoken dialog languag tutor speech recognit foreign languag incorpor user model adapt lesson disast wireless interfac emerg team integr natur imag process technolog video analyst oaa mediat facilit heterogen structur semistructur datasourc oaa rental agent monitor web notifi user classifi meet user specif agent develop tool guid agent develop step requir creat agent control team robot work assign task aaai offic navig surgic forc feedback train simul surgeri physic virtual entiti model oaa agent tabl partial list applic written oaa figur autom offic agent figur user interfac autom offic applic figur unifi messag agent figur multimod map applic
HCI/1620 4 digit photographi framework enabl affect awar home commun olivi inform system laboratori japan ichikawa inform system laboratori japan abstract transform person comput commun internet initi true home comput revolut comput mediat commun technolog increasingli domest chang peopl touch rel friend articl cmc tool point benefit limit tool support explicit interperson provid medium sustain tool support implicit interact natur effortless argu idea affect awar introduc gener touch famili friend enabl affect awar exchang digit make observ annot snapshot easi effortless discuss keyword affect ambient calm comput mediat digit home implicit social social role home ubiquit world wide web introduct comput made home decad ago true revolut initi recent addit commun featur wide popular internet explain profound social impact home comput access net transform devic real domest function applianc extens inform entertain interperson commun person comput entir famili task task perform effect dramat previou telephon emerg commun technolog deepli affect peopl word peopl touch interact true true home peopl offer wai maintain relationship famili wai establish contact local global social impact comput mediat commun technolog gener clear posit neg internet medium remov spatial tempor constraint peopl extend social network fear commun lead social isol reduc import engin comput scientist account observ recommend ethnograph studi impact technolog field adopt approach make uniqu commun infrastructur matter internet flexibl top build wide tool support social interact challeng figur tool gener popul imagin effort address leverag potenti global ubiquit network goal exist cmc technolog point discuss number idea overcom limit recogn merit current argu augment function spectrum cover introduc idea affect discuss benefit tool support effortless emot interperson commun share experi commun explain technolog requir tradit person tradit interact illustr idea design interperson commun framework base exchang digit photograph framework consist varieti hardwar softwar support observ annot photograph foremost motiv design framework observ social role plai home reflect emerg digit photographi technolog affect role famili snapshot power artifact creat strengthen affect emot link peopl digit imag technolog potenti make easier share observ amplifi interperson commun function home photographi achiev goal requir care design system brown juli natur merg architectur space al privileg aesthet artist qualiti remain section articl organ section current comput mediat commun technolog domest environ discuss function interact mode support exist tool problem limit point number field studi social impact home comput import implic design commun technolog highlight idea affect awar final introduc context relat work discuss stress tool enabl affect awar augment tradit technolog electron mail section illustr introduc idea design support affect awar electron mediat home photographi social role home photographi discuss refer visual anthropolog explain number emerg digit imag technolog affect amplifi role compon framework explain support view annot digit photograph note implement framework progress prototyp compon integr fulli complet main object articl report design framework attent emerg domest applic digit photographi foster research area comput mediat commun home comput mediat commun cover broad spectrum electron mail videoconferenc mud technolog support enabl interact mode develop support work relat support task household requir work domest environ clear current cmc tool fit home user cmc perform home tool work environ case technolog put emphasi entertain fun criteria review popular cmc technolog home point limit number field studi social impact home comput highlight import implic technolog design comput scientist final introduc idea affect awar review relat work comput support cooper work comput interact literatur current cmc technolog applic servic develop top internet infrastructur categor wai distinguish interperson mass commun tool interperson commun tool support direct exchang inform small particip electron surrog paper mail telephon commun mass commun tool dissemin inform publish possibl larg number consum compar tradit media radio press fundament differ internet barrier entri extrem low virtual access mass media inform publish distinct interperson mass commun technolog fact gener mass commun medium site design visit small number peopl web site publish visit member friend main role support interperson commun electron mail interperson conjunct larg distribut similar mass commun tool electron mail home electron mail common cmc technolog domest essenti sustain friend peopl met interact commerci administr entiti custom support servic tax factor explain wide popular email easi requir long learn curv famili access requir technic time email email address technolog interact larg number peopl email interest altern tradit commun tool paper benefit offer low cost deliveri interest applic email exemplifi parent easili touch children leav home write email requir effort write bui stamp find mailbox write email cheaper make phone call factor contribut level commun member famili live posit social impact contribut strengthen social relationship electron mail ultim interperson commun tool altern extens search problem electron mail tediou requir lot time peopl reduc frequenc daili qualiti limit state weather messag appar messag useless import content simpl fact messag mere connect sender receiv send email case similar wave smile real function email support exchang explicit messag convei gener connect defin affect tool develop support function appropri section develop idea exchang textual peopl maintain mutual affect awar exchang photograph impress photograph present advantag time constrain snapshot effort write richer smile convei stronger impress read weather electron mail exchang factual inform electron mail augment conjunct tool focu lightweight inform commun matter exampl technolog root electron target user mail softwar tremend popular japan standard uniqu user interfac function inspir famou artifici creatur main window repres live small anim pink user send email cute creatur travel cyberspac enter receiv live room creatur plai great user applic illustr import aspect cmc perform entertain fun electron greet card servic offer internet compani user categori mother send annot draw view standard web browser send electron similar send paper main function commun factual express sender receiv limit electron requir receiv pc requir time difficult peopl older peopl idea special displai screen automat shown deliveri make system easier natur world wide web world wide web popular applic home wai household act inform consum case kid search inform parent famili surf web entertain web potenti substitut watch group activ peopl easili watch tv share experi exchang surf web individu activ collabor agent al attempt make web collabor activ household www inform produc home user design maintain web site easi avail gui design tool possibl free storag space internet portal site peopl opportun introduc famili give inform hobbi share photograph famili web site support interact specif event web site creat announc rememb wed celebr inform offer guest short comment stori ad site web site creat popular term web site digit extens physic dwell social place famili interact visitor rare reason reason difficult grasp activ occur web track visitor publish web site visitor site visitor reason physic electron world separ peopl engag activ physic world read awar happen digit world visitor digit home percept inhabit physic prevent interact discuss problem previou articl al introduc metaphor window bridg physic comput world window user hear sound event detect site hear bird dog page access relat approach al idea virtual connect real organ note famili attempt creat bridg real virtual put live room camera period pictur visibl web creat link real world virtual opposit direct obviou privaci issu commun popular cmc applic support onlin commun virtual world mud recent www portal site technolog onlin commun women guitar bound geograph commun foreign live tokyo resid san francisco bai categori offer good internet offer possibl meet peopl remov spatial tempor psycholog barrier shy peopl find easier initi interact protect anonym argu kind interact shallow interact imag spend time front comput easili mind case peopl benefit report line commun peopl share problem comfort interest aspect discuss descript commun particip primarili interest share feel support exchang factual inform current cmc tool suit support commun usual interact mechan limit lack channel convei feel compass commun design user potenti improv qualiti life thousand peopl interest aspect commun make easier augment interact interact point met interest peopl discuss meet easi peopl europ japan meet commun internet presenc instant messag relat technolog recent receiv larg echo press internet presenc instant messag exist long time unix mechan million peopl person comput connect internet internet presenc make group peopl call connect idea statu instant messag send short messag peopl instant messag immedi receiv displai messag store interest aspect im support level awar user window dynam reflect statu user convei approach impress reachabl interest home user member famili live closer continu basi room develop ip im statu inform limit im creat artifici addit inform benefici idea current field studi implic social implic home comput interest number scholar year behavior usag pattern examin field import observ made implic polici maker technolog design import studi import observ design digit commun technolog highlight al al examin impact home comput time alloc analyz behavior user observ introduct pc home time spent time spent famili friend clear case comput lead social isol author observ shift activ note time applic target home user home comput tool home interest point author tradit interact paradigm plai kei role time realloc time alloc phenomenon comput respect person oper mean interact machin popular person comput exemplifi problem interact person comput gener requir user isol rest physic mental reason comput room individu room group live pc user room dont spend situat comput public live room user share physic environ famili member isol reason pc public space includ factor poor aesthet unavail space disturb observ place home comput technolog public kitchen live reduc risk social isol user requir care design nice integr architectur space reason difficult time bodi entir attent user gener mobil interact good illustr problem peopl feel tire comput hour task write report word process difficult overcom problem interact user comput achiev requir keyboard distribut electron mention good issu automat shown displai scatter home advantag altern current situat peopl dedic amount time task consult incom mail pc switch launch fetch turn continu seamlessli notic observ interact mechan mental physic attent user reduc risk social isol requir design user interact support gestur mean studi publish venkatesh compar situat home comput earli explain number factor contribut delai comput announc comput home addit commun featur avail softwar support household task factor explain greater accept home comput critic factor understand technolog innov happen happen work transfer observ comput technolog transfer work domest environ develop home user observ made author gain accept comput compet exist technolog support exist task effici enabl activ comput design digit commun mean radic wai support interact peopl search observ digit commun technolog mimic tradit commun media enabl function commun infrastructur studi import implic field trial research group carnegi mellon observ onlin behavior household year internet address al find home user internet inform acquisit interperson answer respect web browser access inform electron mail client interperson compar time collect data suggest user gener prefer email web internet home motiv interperson inform access opinion tendenc focu primarili inform access entertain commerci develop internet servic public polici initi date inform entertain interperson implic comput scientist effort made improv exist interperson commun applic mean worth investig form interperson strong demand observ interperson commun peopl internet special effort made improv exist interperson commun question examin studi titl articl al social technolog reduc social involv psycholog clear social impact internet posit author collect data identifi correl internet social involv psycholog social involv measur famili size local social size distant social network social support psycholog measur term stress depress find research greater internet declin social depress order explain author made hypothesi neg impact due fact internet requir abandon read book talk famili member problem mention analysi al impact home comput author argu current cmc tool social interact good telephon interact suggest effort made develop interperson commun technolog internet affect awar interest applic cmc home set offer effici wai peopl touch famili friend notion gener aspect current technolog primarili support idea support explicit exchang factual inform mean touch explicitli initi encod messag type final transmit messag pace messag back particip depend technolog email exchang dai synchron commun chat exchang kind interact requir effort establish commun small repres barrier commun potenti reduc amount social interact peopl share situat famili peopl wai interact easili guess emot condit idea daili schedul bodi dress facial express natur channel convei inform peopl interact explicitli exchang messag feel import thing effort interact share physic space suffici recent survei conduct understand commun pattern children parent result show parent children spend hour dai parent children spend minut dai interpret neg author wai level commun parent kid encourag result point mechan parent kid build affect relationship digit mediat social interact support mean call affect awar gener close famili friend affect awar achiev peopl engag share experi affect emot state watch funni tv observ paint art enjoi good plai game simpl activ perform make peopl feel close cmc technolog recreat kind interact benefici user requir frequent social interact distribut famili requir explicit interact user avoid problem mention previou section risk social isol extend period comput matter similar issu studi work environ distribut work group similar difficulti maintain context commun notion awar extens discuss comput support cooper work literatur bellotti dourish bly gutwin greenberg al al awar identifi awar peopl maintain seamlessli close number system develop artifici recreat awar distribut group media space al pedersen ambient user interfac al calm technolog brown juli relat idea inspir work import aspect interact achiev convent instal comput environ close integr architectur surround user temperatur tangibl artifact ullmer creat interfac physic digit environ valuabl address issu previou requir user cut social environ cmc technolog interest note media space technolog reli continu network long confin offic set continu internet connect realiti home make develop similar system domest affect awar digit home photographi previou section argu augment exist cmc technolog tool support affect awar benefit applic support implicit social suggest engag remot particip share emot effect achiev goal explain home photographi context enabl affect awar digit environ social role tradit home photographi discuss refer visual anthropolog descript made integr hardwar softwar compon support observ annot photograph framework support affect awar categori photograph affect link creat direct connect photograph receiv snapshot reaction captur notifi back turn feel connect process achiev compon displai photograph snapshot feedback integr live requir user interact person comput descript framework illustr number emerg digit imag digit servic innov displai social role home photographi photographi consid visual art scientif instrument photographi support rang social function photograph peopl memori discov cultur studi function foremost interest visual home photographi type concern creation util pictori artifact context home broad includ famili home movi home videotap includ digit artifact support digit camera photo album richard visual interest studi function home photographi ethnograph studi understand peopl displai share pictur import implic design digit imag support social interact home media popular cultur describ photograph highlight differ cultur question interest condit peopl made photograph displai show peopl understand photograph describ exampl photograph refer share highlight fact peopl share pictur friend colleagu call household relat displai photograph home interest observ gener pictur displai unlik home illustr fact function photographi depend cultur factor work snapshot displai work differ japan tend pictur time tend displai snapshot work reason greater separ privat public common practic carri snapshot famili tourist photographi observ made interest reason show photograph social artifact trigger affect process peopl displai photograph home peopl carri photograph photograph portrait natur lead person recal memori affect provok sad depend situat show share photograph social process connect peopl social oblig regularli exchang snapshot friend parti peopl exchang reprint snapshot function serv strengthen relationship reinforc group situat illustr social function snapshot exchang grandpar receiv pictur feel touch reason snapshot natur lead children fact photograph children forget comfort import posit outcom exchang matter observ foremost motiv design framework relat phenomenon mention tremend success print club japan locat street machin high school student photograph smile decor cute draw print small exchang friend organ larg collect interest print comput devic stress social function photograph studi differ video imag examin effect recal memori qualit perceiv home user question answer basi interview conduct particip evalu rel merit video imag media home photographi observ video recreat past greater fidel amount inform larger suit reproduc watch video particip survei gener video brought memori made duplic live experi past studi suggest video tape prefer snapshot photo contrari idea inform peopl explain prefer imagin rememb peopl event captur watch past recreat viewer passiv video observ pictur requir make imagin trigger process bound repres pictur idea mention interview pictur havent long time person person movement video unimport home gather imagin reason peopl prefer pictur videotap social interact gener watch group peopl case peopl watch tv screen level commun low group peopl watch pictur photo context stori exchang comment pictur suit gener interact peopl interest implic design visual cmc technolog ultim interperson commun tool rich interact recreat condit meet case memori video situat peopl join talk mean dont talk commun interrupt cmc tool base pure exchang photograph gener interest intellectu affect process person receiv snapshot rememb imagin peopl affect advantag approach privaci issu awar system point make synchron commun medium creat affect link peopl thing trigger mental process artifact tangibl event sound indic person smile idea foundat introduc framework defin interperson commun framework support affect awar home photographi word mean impress feel suggest goal framework support exchang explicit convei gener user goal achiev exchang photograph reaction photograph distribut observ snapshot perform number digit imag distribut internet interact user system base watch photograph person connect person watch person connect illustr figur categori photograph photograph digit camera snapshot distribut rel observ reaction captur notifi back photograph support distribut photograph public channel buffer limit pictur success photograph defin channel decid distribut photograph channel subscrib channel interest motiv larg photo collect continu make system dynam channel limit notic easili make system interest reinforc impress activ system activ interpret manifest social interact captur distribut photograph affect awar displai photograph feedback displai feedback captur feedback figur affect awar snapshot annot initi distribut distribut photograph distribut digit camera kiosk awar monitor photograph metadata access notif architectur support function depict figur photograph pictur digit possibl add comment short contextu inform locat gp sensor automat ad camera photograph digit camera initi public process pictur publish pictur transfer maintain state public channel camera equip wireless internet step perform directli user kiosk mean storag media pictur card smart remov camera insert devic connect internet pc card devic establish connect server transfer pictur receiv observ snapshot tool interfac ubiquit photograph server tool make comment express server photograph metadata maintain state channel receiv pictur photograph serv pictur monitor access channel ubiquit displai emot captur figur framework architectur channel www interfac feedback captur emot laugh feedback final notifi photograph call awar monitor make photograph virtual hear friend laugh cry observ pictur explicit commun photograph affect link creat digit camera import compon framework devic creat digit camera recent digit camera inform integr hardwar oper commun capabl user interfac process store inform graphic contextu metadata locat titl photograph digit camera integr program make uniqu platform develop innov applic real insur medicin field benefit enabl automat classif effici retriev interest devic recent introduc consum market applianc time mobil digit camera equip locat sensor interest note prototyp wearabl comput integr digit picard devic chang behavior home photograph low avail ergonom carri camera glass quantiti photograph electron natur combin make extrem cheap easi duplic share pictur exchang digit photograph attach email clear solut design main requir initi distribut photograph effortless peopl regularli similar problem email updat web discuss section good idea implement function directli advantag task perform snapshot singl tool task perform matter find pc wait boot digit camera offer limit number access user interfac gener lcd button switch interest includ model kodak oper system standard oper system imag devic includ user interestingli script languag extend function camera implement interest applic script control hardwar zoom write text file read control gui widget option inform text access number data field store metadata pictur script organ hierarch easili access user arrow kei button part implement script run kodak camera pictur channel publish screenshot digit camera screen reproduc figur repres user interfac step execut script user defin pictur publish step consist mark publish user select script menu predefin channel scroll list script list mark pictur updat metadata field refer select channel complet messag final displai screen process repeat time actual public photograph user perform script invok script list photograph store camera check content metadata field assign script script gener xml document specifi photograph publish document metadata creat camera automat xml document snapshot transfer camera directli kiosk figur mark snapshot public figur select script figur select channel channel kiosk pictur directli photograph case email publish channel manag server photograph push inform pull inform server essenti function accept photograph maintain state channel handl request give access channel server implement extend function http server collect java servlet java servlet approach dynam content web altern cgi advantag server built extens http directli access www make system readili access standard web browser possibl channel requir explain digit camera establish wireless internet connect make send photograph figur interfac channel directli camera server case decid introduc kiosk architectur initi public run user simpli extract storag media camera insert kiosk prototyp role kiosk plai pc card reader softwar run kiosk read xml document gener specifi photograph fetch read special file store pictur describ server user account connect establish server photograph list xml document push channel introduc extra step kiosk publish process simpl requir effort user inform gather directli number commerci servic support function enabl server kodak onlin user store digit photograph photo album album famili friend visitor order reprint accessori interest point peopl send regular film develop tick option digit publish make public easi handl onlin photo servic limit overcom difficult pictur publish photograph period check web requir substanti effort photograph dont famili friend watch mechan pictur web browser wai perform task suggest earlier electron applic point digit photo access number research issu term effici retriev interest system system al make manual annot photograph easier achiev narr structur organ photograph collect organ process transform storytel user tool server http standard web browser observ photograph publish channel user interfac develop simpl web page show photograph push complex javascript creat interact user interfac repres figur left thumbnail pictur channel displai user click center larg textual descript pictur defin digit displai user click button situat photograph chang size center photograph feedback button messag photograph publish photograph receiv notif virtual hear laugh user interfac develop proof subtl wai collect feedback examin web browser provid practic solut watch pictur publish access www ubiquit requir hardwar softwar make start system web interfac perfectli suitabl true collect photograph accept person keyboard watch comment photograph provid kind interfac section person comput present risk social isol reason pc requir tradit interact user physic intellectu faculti motiv design framework level social interact peopl live goal achiev level interact peopl live situat achiev user spend time explor photo unabl interact member household solut problem consist provid addit user interact system seamless wai interfac enabl process user remain give input system watch tv interfac integr architectur space home popul wide rang displai includ comput screen inform displai digit mirror window displai found domest environ specif inact long period wast interact displai cmc system support social awar peopl displai show photograph publish channel figur show devic kitchen toshiba palmtop shut immedi interest comment make devic daili basi gener peopl tabl mean interact devic gener famili member keyboard rare requir user interfac point devic integr side displai make devic natur bodi posit commun email web interact devic initi social process household good author wife trigger incom email activ write email figur monitor kitchen devic perfectli suitabl integr plai role digit pictur frame digit pictur frame similar tradit pictur shape move differ imag displai frame digit easili automat chang interest note soni introduc digit pictur frame consum market devic network connect pictur transfer memori stick storag devic home photographi applic digit imag devic displai photograph requir care user interfac design thing main function support explor photo collect case automat displai requir user gather feedback feedback captur automat requir sensor softwar recogn emot difficult issu remain open lot research area al picard automat emot recognit user interfac make easi user give feedback requir keyboard prototyp built provid user interfac figur show tool difficult good idea dynam interact behavior static descript lower part photograph publish channel scroll left user remain passiv simpli watch incom photograph upper left corner user express emot inspir photograph move circular cursor point pie chart show emot fear intens emot variabl determin long user press button visual feedback size emot visual feedback upper portion vertic scroll text size word intens feel express user size strong small size moder feedback gather user notifi person publish photograph function support messag infrastructur integr framework user feedback visual feedback photograph weak feel figur monitor strong feel awar monitor photograph previou compon framework support flow inform photograph goal make distribut visual photograph easi natur import user perceiv pictur share activ process regularli share photograph internet email web requir time effort requir technic knowledg master averag consum contribut limit amount digit photograph exchang home user origin aspect framework enabl flow inform opposit photograph photograph rel friend watch feel connect richer experi achiev idea peopl felt watch pictur support function requir captur feedback explain requir photograph special tool notifi social activ gener snapshot tool call awar monitor architectur tool displai photograph appli awar monitor ideal requir standard pc nice integr live environ idea awar photograph interact system receiv access feedback task awar monitor design limit imagin simpl audio visual signal notifi activ occur system elabor involv tangibl ambient channel develop tool base audio al visual ichikawa interfac gener case notifi activ occur web site interfac easili integr access comment person web site similar access comment person photograph prototyp specif develop fit awar monitor tool imag java featur support notif receiv awar photograph caption indic ident fade displai notif specifi sound plai devic photograph caption fade hear laugh cyberspac devic find pictur natur requir effort user note user interfac suitabl synchron notif import support asynchron notif user system question activ activ gener group activ gener group idea address implement left futur work articl examin role comput mediat commun domest environ exist technolog benefit limit relat ethnograph studi social impact home comput import implic technolog design highlight discuss insist fact current technolog support explicit social creat medium merit support implicit social interact notion affect awar introduc defin gener feel touch rel friend explain engag peopl share experi affect possibl creat affect awar interperson commun framework support affect awar digit home photographi social role home photographi refer visual anthropolog explain framework integr rang hardwar softwar compon make observ annot photograph natur effortless work support govern scholarship award author author kodak provid digit scienc digit camera implement prototyp system refer acm confer comput support cooper work bring peopl audio comput commun vol pp java futur world wide web vol pp photograph dynam interpret commun home media popular popular cultur british snapshot version bowl green state popular oper system imag dourish coordin share cm confer comput support cooper work dourish support awar distribut work acm sigchi confer human factor comput system gutwin design tradeoff power workspac acm confer comput support cooper work healei cybernet wearabl ieee intern symposium wearabl desktop environ support plan acm confer comput support cooper work ishii seamless interfac bit acm sigchi confer human factor comput system dwell place intern workshop cooper build altern internet acm sigchi confer human factor comput system lo social technolog reduc social involv psycholog american vol pp consum multimedia organ retriev acm sigchi confer human factor comput system van collabor web intern confer intellig user visual interact mechan awar ieee intern symposium visual user interfac social awar world wide person vol pp histor account invent develop person ieee intern symposium wearabl recognit synthesi system intern confer multimedia comput system recognit applic comput agent spontan interact intern confer multimedia comput system team technolog vol pp pedersen abstract presenc support mutual acm sigchi confer human factor comput system connect affect comput mit vol pp virtual commun explor media vol pp anthropolog journal photograph pp social awar design acm confer comput support cooper work interact technolog commun vol pp shift time alloc pattern commun vol pp weiser calm vol version juli turn architectur space interfac peopl digit intern workshop cooper build
Agents/1621 1 methodolog configur heterogen atm environ intellig mobil agent john bernard toni white depart system comput engin carleton drive canada address correspond prof pagurek abstract function enabl configur perman virtual connect heterogen asynchron transfer mode environ accomplish technolog approach suffer number problem area extens network increasingli complex paradigm appar paper concern analysi solut intellig mobil agent util provid autonom network configur manag function configur methodolog base singl mobil agent act serial multipl mobil agent act parallel compar term time durat network load small expert system provid intellig handl error situat investig test environ simul atm switch node develop valid keyword asynchron transfer activ autonom network expert intellig mobil perman virtual connect author attend workshop present paper methodolog configur heterogen atm environ intellig mobil agent john bernard toni white depart system comput engin carleton canada introduct network manag domin system base paradigm impli distribut agent server side central inquir manag client side approach suffer number problem area extens effici agent static devic specif manag monolith complex overhead data transmit network manag princip network manag task asynchron transfer mode environ configur perman virtual connect dispar proprietari manag procedur provid individu atm switch vendor creat environ uniform method configur imposs autom configur necessit switch servic manual situat increasingli futur network continu develop volatil paper concern analysi solut base mobil agent move node node perform manag function demand disappear longer mobil agent perform singl manag gener smaller static agent discuss abil carri persist state inform migrat autonom collabor task mobil agent design commun facil small expert system intellig perform diagnost correct activ incorpor appli larg complex manag task divid smaller simpler manag task assign specif mobil agent overhead data transmit network manag distribut evenli reduc inform bottleneck improv network perform network manag function extens capabl handl network futur specif applic domain discuss network configur manag heterogen atm environ divid number smaller simpler configur configur divid subtask set trace function configur manag subtask implement special mobil agent number configur methodolog mobil agent provid network manag function individu collabor mobil agent methodolog develop provid configur manag function involv singl mobil agent act autonom migrat node node path backtrack error condit involv multipl mobil agent act node commun messag negoti error condit paradigm discuss requir mobil agent capabl reliabl increasingli complex natur configur manag activ dictat control incorpor level intellig level intellig suffici perform diagnost correct activ oper condit order leverag result research area artifici investig perform small expert system provid intellig requir activ respond normal erron situat order mobil agent view access network node uniform manner individu vendor specif detail atm switch abstract creat gener model common attribut compon object extract common interfac atm switch configur develop gener model base previou research detail concept mobil agent configur introduc origin contribut paper analysi altern configur serial parallel examin expert system introduc intellig except handl valid test environ simul atm switch node construct prototyp implement mobil agent specif capabl requir set construct serial parallel methodolog develop set test case serial serial parallel parallel parallel execut result perform metric analyz java chosen implement test environ prototyp mobil agent due platform independ support code mobil robust java expert system shell chosen investig small expert system due compat java underli framework code mobil provid mobil code toolkit develop depart system comput engin carleton comparison mobil agent approach agent solut base flexibl static softwar agent configur accomplish definit skill plug intellig individu softwar agent section paper describ network manag mobil agent section discuss expert system mobil agent section analysi solut section outlin configur subtask section illustr configur methodolog section analyz discuss interest result research section conclud observ remark futur work network manag mobil agent tradit network manag system base paradigm tend devic requir overhead data transmit network manag network manag task increasingli network complex dynam solut reli mobil agent provid network manag function mobil agent smaller tradit static agent combin migrat overhead data transmit network manag distribut evenli network result reduct inform bottleneck improv network perform flexibl motiv benefit benefit mobil agent network manag larg provid number practic advantag static counterpart motiv approach set anticip benefit mind anticip benefit reduc commun cost network fault toler limit local resourc configur softwar distribut protocol agreement asynchron process flexibl dynam servic provis flexibl distribut comput environ mobil code infrastructur order perform network manag function mobil infrastructur framework code mobil infrastructur support function develop part mobil project depart system comput engin carleton chosen develop infrastructur java program languag order deriv advantag inher platform independ support code mobil robust figur mobil code infrastructur network compon mobil code daemon run java virtual machin number servic facilit execut mobil agent includ runtim migrat facilit transport mobil agent commun facilit collabor local remot mobil interfac access manag object nc migrat facilit enabl migrat mobil agent mobil agent authent instanti thread jvm maintain handl instanti mobil code mobil code manag mobil agent access manag object nc virtual manag compon mib mf nc jvm cf nc jvm nc jvm commun facilit migrat facilit java virtual machin manag inform base mobil code daemon network compon mobil code manag virtual manag compon uniform access manag object independ underli platform implement detail mobil agent obtain handl expert system intellig mobil agent context gener mobil code expert system provid intellig resid mobil agent combin migrat collabor agent system develop effect correct network fault raw data effect dissemin abstract form understand applic domain fault manag java expert system shell java expert system shell expert system shell written java program languag jess support develop expert system tightli coupl java abil manipul directli reason java object jess number factor add suitabl intellig mobil includ support knowledg valid jess support program program knowledg repres heurist set action perform situat program complex system model modular compon jess written java portabl port system java virtual machin jess java class easili extend user protocol jess includ number featur support valid expert system includ support modular static dynam constraint check slot valu function argument semant analysi rule pattern determin inconsist prevent rule fire gener error figur includ jess java code typic expert system fix set rule list fact continu case gener list fact fix rule oper number fact chang unit time small jess situat advantag base infer engin rete algorithm rete algorithm rememb past test result iter rule fact test set rule greatli effici implement system analysi order valid solut mobil agent provid configur manag prototyp implement develop java program languag import import jess librari io stream rete engin rete rete rete expert system engin fi open input file stream jess parser execut construct catch error report configur manag system develop gener view atm switch user abil set atm network order gather perform atm network consist simul atm switch node execut realist atm environ physic devic provid underli function replac simul switch assumpt system reli number assumpt result simplif develop process assumpt made isol central issu paper maintain applic extens solut assumpt atm switch simplifi function relat configur ignor configur svc gener oper atm qualiti servic paramet dealt peak cell consid maximum bandwidth alloc connect atm servic class dealt bit rate consid offer effort servic hard user knowledg switch connect mean connect rout predefin rout made requir solut valid system provid specif set network manag constrain set requir relat simplifi applic domain requir separ consid develop perspect consid user perspect requir develop perspect gener manag inform base atm switch configur gener interfac atm switch configur requir user perspect simul atm switch configur set mobil agent perform set serial parallel methodolog set mobil agent perform trace serial parallel methodolog set mobil agent perform serial parallel methodolog configur manag applet graphic interfac architectur constraint system develop user requir gener architectur develop context mobil code infrastructur discuss compon architectur work satisfi requir flexibl extens manner architectur system made number compon map compon mobil code infrastructur earlier softwar element prototyp implement java program languag atm switch mib map gener mib compon switch map gener compon mobil agent placehold map gener compon switch interfac consid switch user switch interfac transpar develop perspect switch interfac constraint function servic provid switch configur manag inject ma system figur configur manag system architectur atm switch mib compon part gener atm attribut atm switch defin structur manag inform format prototyp atm switch mib object correspond configur implement set intern data structur simul atm switch switch interfac compon part gener atm defin public method mobil agent requir access resourc manag switch method paramet return valu interact switch switch compon access manag resourc atm switch implement interfac defin switch interfac compon atm switch run java virtual compon system resid nc run separ host switch implement nativ protocol atm switch order manag resourc mobil agent compon intellig configur atm network number mobil agent implement perform configur function function provid switch intellig mobil agent provid small expert system configur manag compon inject mobil agent atm network configur manag specifi set switch initi bandwidth valu configur subtask mobil agent perform configur function specif methodolog investig paper involv singl mobil agent act autonom migrat atm switch path backtrack error condit involv multipl mobil agent act atm switch commun messag negoti error condit context configur subtask set examin atm switch mib switch mf nc jvm cf ma switch interfac configur manag inject setup setup mobil agent set path set atm switch atm network order set mobil agent function reserv object resourc path process set consist reserv vl intermedi destin switch vl intermedi switch failur occur select interfac index exist maximum number vc support reach select valu unavail select valu reserv select resourc failur occur maximum number virtual connect support reach select low interfac index higher select high interfac index request topolog support traffic qualiti servic paramet select virtual link compat select resourc trace trace mobil agent trace path set atm switch atm network order trace mobil agent function discov record inform switch path process trace consist discov ident intermedi destin switch record inform intermedi destin switch failur occur switch select virtual connect valid failur occur select interfac index exist select valu unavail select valu mobil agent path set atm switch atm network order mobil agent function object resourc path process consist virtual intermedi switch virtual link intermedi destin switch failur occur select interfac index exist select valu unavail select valu configur methodolog order illustr configur methodolog analyz full set messag sequenc chart includ chart includ oper error configur serial serial serial parallel parallel trace parallel chart includ oper error setup configur serial setup parallel setup configur methodolog serial parallel deleg serial singl mobil agent author intellig perform specif configur task inject network sourc switch node mobil agent function migrat autonom network configur switch backtrack reconfigur previou switch node error condit occur parallel mobil agent author intellig perform specif configur task inject network switch node network path mobil agent provid function configur respect switch node inform commun messag error condit reconfigur perform predefin negoti sequenc mobil agent messag sequenc chart includ oper error remain configur task due fact error task error setup configur task occur valu select incom interfac bandwidth request virtual link unavail negoti process previou switch initi resolv error error messag sequenc chart notat appli vertic axi time action time list lower messag sequenc chart action mobil agent solid horizont arrow action mobil agent regular dash horizont arrow messag agent irregular dash horizont arrow error star point error error recoveri negoti sequenc light grai highlight serial setup path atm sequenc event serial setup sequenc error condit occur agent migrat reserv migrat reserv reserv migrat reserv migrat reserv migrat report data gener event sequenc path atm sequenc event occur ident event repeat intermedi switch path atm sequenc event serial setup sequenc error condit occur agent migrat reserv migrat reserv migrat reserv migrat reserv reserv migrat reserv migrat reserv migrat report data error reserv virtual link event gener error recoveri negoti sequenc event recoveri sequenc complet remaind configur oper perform manner ident case error condit serial trace path atm sequenc event serial trace sequenc error condit occur agent migrat switch migrat switch migrat record data migrat record data migrat record data report data gener event sequenc path atm sequenc event occur ident event repeat intermedi switch serial path atm sequenc event serial sequenc error condit occur agent migrat switch migrat switch migrat migrat migrat report data gener event sequenc path atm sequenc event occur ident event repeat intermedi switch parallel setup path atm sequenc event parallel setup sequenc error condit occur migrat migrat migrat reserv reserv messag messag reserv reserv messag reserv report data gener event sequenc path atm sequenc event occur ident event repeat intermedi switch path atm sequenc event parallel setup sequenc error condit occur migrat migrat migrat reserv reserv messag messag reserv reserv messag reserv messag reserv messag reserv messag report data error reserv virtual link event gener error recoveri negoti sequenc event recoveri sequenc complet remaind configur oper perform manner ident case error condit parallel trace path atm sequenc event parallel trace sequenc error condit occur migrat switch migrat switch migrat messag messag record data record data record data messag messag report data gener event sequenc path atm sequenc event occur ident event repeat intermedi switch parallel path atm sequenc event parallel sequenc error condit occur migrat switch migrat switch migrat messag messag messag report data gener event sequenc path atm sequenc event occur ident event repeat intermedi switch result creation function implement configur manag system number interest result issu small expert system insid mobil agent discuss perform system term time durat network load analyz expert system attempt implement jess mobil agent import discoveri made implement infer engin intern jess perform match rule fact serializ serializ refer abil object transform standard encapsul state inform mobil code infrastructur serial mobil agent order perform migrat activ retain state inform investig structur jess reveal java class store intern state inform infer includ current templat function class serializ discoveri rule possibl run instanc jess mobil agent attempt number option consid option possibl load state inform run separ instanc jess mobil agent initi switch remov state inform destroi instanc mobil agent migrat option discard due time durat involv initi load instanc jess multipl time network option possibl incorpor jess switch mobil leav instanc jess run switch requir mobil agent load remov fact state network order perform manag function switch option discard involv knowledg manag function fact repres return tradit static agent paradigm remov perceiv advantag mobil agent addit disadvantag jess mobil agent significantli size mobil agent jess class includ network load transfer mobil agent network discard decid avoid jess mobil agent provid intellig agent procedur program techniqu comparison time durat comparison time durat serial methodolog significantli faster parallel methodolog time durat approxim millisecond averag configur task serial methodolog time durat approxim millisecond averag configur task parallel methodolog factor contribut result thread block agent lookup methodolog setup trace averag serial parallel figur time durat perform summari valu thread block contribut factor comparison time durat thread block case parallel configur task perform messag transfer individu mobil agent simul atm switch node send receiv function facilit messag synchron natur thread mobil agent block complet execut system multipl mobil agent commun dynam scenario potenti exist individu mobil agent experi period time execut block delai directli depend sequenc interact occur mobil agent determin specif detail implement agent lookup contribut factor comparison time durat agent lookup case parallel messag transfer send mobil agent receiv mobil agent send mobil agent determin locat receiv mobil agent accomplish remot extern entiti resid node network maintain lookup tabl entri mobil agent system entri current locat mobil agent order retriev inform remot mediat send mobil agent send mobil agent locat request messag remot subsequ respond messag locat receiv mobil agent execut request sequenc occur thread execut send agent time durat individu messag transfer comparison network load comparison network load serial methodolog margin effici parallel methodolog network load approxim byte averag configur task serial methodolog network load overhead approxim byte averag configur task parallel methodolog factor contribut result messag acknowledg agent lookup methodolog setup trace averag serial parallel figur network load perform summari valu messag acknowledg contribut factor comparison network load messag acknowledg case parallel messag transfer mobil agent initi specif seri acknowledg messag send mobil agent receiv network layer acknowledg receiv mobil agent synchron messag send mobil agent receiv transport layer acknowledg receiv mobil agent network layer acknowledg messag deliv mailbox receiv mobil agent transport layer acknowledg receiv mobil agent receiv messag agent lookup contribut factor comparison network load agent lookup case parallel messag transfer send mobil agent receiv mobil agent send mobil agent determin locat receiv mobil agent discuss addit time durat messag initi messag transfer network applic messag transfer applic messag small overhead paper solut configur problem base concept intellig mobil agent provid manag function demand methodolog mobil agent develop provid configur manag function involv singl mobil agent act serial involv multipl mobil agent act parallel investig perform small expert system provid intellig handl error situat prototyp implement configur manag system develop java program languag implement system develop paper valid mobil agent configur heterogen atm environ configur task set mobil agent implement extens effici manner overhead data transmit network manag distribut evenli reduc inform bottleneck improv network perform individu mobil agent perform small specif reduc complex expect manag agent make fast easi develop investig small expert system shell provid intellig mobil agent make evid expert system exist todai suit incorpor mobil agent jess suffer condit expert system implement suffer area portabl excess size expert system realist compon gener mobil code adapt suit mobil agent mobil order provid benefit procedur program approach situat manag task configur manag expert system provid benefit outweigh overhead argument made expert system manag task complex argument disregard fundament concept mobil code divid larg complex manag task smaller simpler manag task assign specif mobil agent situat manag task solut incorpor expert system leverag inher advantag mobil code paradigm divid manag task number mobil agent cooper accomplish task comparison result gener configur methodolog reveal interest comparison averag time durat serial methodolog significantli fast parallel methodolog contribut factor greater time durat parallel methodolog send receiv function transfer messag synchron natur thread mobil agent block complet execut messag transfer mobil agent send mobil agent determin locat receiv mobil agent sequenc remot mediat comparison averag network load serial methodolog margin effici parallel methodolog contribut factor greater network load parallel methodolog messag transfer receiv acknowledg network transport layer determin locat receiv agent messag transfer initi addit messag transfer applic messag transfer characterist methodolog superior advantag serial methodolog parallel methodolog specif applic appar determin factor serial methodolog simpler implement parallel methodolog primari advantag mobil agent framework network manag task implement serial methodolog fulli promot interest result discov valid process time durat methodolog remot oper switch local oper switch result major time configur task due process switch commun switch multipl switch entiti host local place strain process capabl host slow switch entiti distribut multipl host processor load distribut conclud result algorithm effici configur process determin factor minim configur time commun entiti neglig comparison addit methodolog consid paper possibl replic mobil agent switch migrat occur case error condit handl messag back replic agent previou switch backtrack investig methodolog methodolog fact composit origin methodolog theoret experi perform rang exhibit develop set agent appli methodolog interest research area refer manag object atm manag version ietf august softwar agent automat provis atm mobil network fault manag sixth intern symposium integr network pp expert system good ibm research ibm watson research knowledg engin review volum number agent system facil omg tc document configur manag heterogen atm intern workshop agent telecommun applic pp expert network manag white survei uni signal system protocol atm comput commun review volum number advanc network manag base mobil network oper manag symposium isbn prentic configur atm virtual connect simpl time volum number
IR/1622 5 build effici wireless sensor network £ john heidemann ý ramesh govindan ý ý scienc institut admir marina del usa distribut node commun leverag topolog locat node independ applic investig emerg class distribut system commun reli network topolog locat commun base attribut extern network topolog relev applic combin kind data enabl process data collabor signal similar problem approach essenti emerg applic sensor network resourc bandwidth energi limit paper descript softwar architectur support data process show approach aggreg nest queri significantli affect network traffic experi aggreg reduc traffic nest queri reduc loss rate aggreg studi paper demonstr nest queri form present evalu approach oper testb introduct distribut node £ work support darpa grant part nsf grant part made part due support cisco system fabio silva ý ý deborah estrin þ comput scienc depart lo angel lo usa leverag topolog locat node independ applic commun built commun primit level bind servic map topolog requir internet ip address provid suitabl rout ip address assign address node topolog proxim drawn address prefix logic connect distinct physic topolog assign essenti scale rout system carri forward dn hierarch node system implement ip web search engin provid document object content distribut network add geograph constraint system jini layer approach resourc discoveri ip network devic investig emerg class distribut system commun reli network topolog locat commun base extern network topolog relev base capabl sensor type geograph locat approach kind effici elimin overhead commun requir resolv bind data enabl activ process insid data reduct data gener benefit appli internet bandwidth delai throughput process primari constraint technolog trend condit wireless sensor network sensor network predic assumpt feasibl small devic memori process wireless addit sensor sensor network process time bit commun plenti fast bandwidth bandwidth scenario kaiser observ instruct execut energi cost send bit radio environ encourag comput reduc commun fewer level indirect messag process opaqu packet essenti design sensor network resourc constraint wireless sensor network met system extern frame refer tradit approach build underli topolog scheme ip multipl layer bottleneck ten overhead unreason hundr thousand node vari avail movement domain sensor network profit elimin multipl layer rout data directli term effici attribut base extern frame refer attribut geographi sensor type reduc level bind rout reduc resourc consumpt addit process essenti sensor network suggest comput collabor signal process occur close data collect process depend data trigger attribut data type process data kind process similar activ network differ oper environ sensor network solut illustr process sensor wireless monitor system mixtur light motion sensor vigil sensor microphon camera conserv energi bandwidth audio sensor trigger light sensor comput distribut network queri label sensor type system design time queri network handl node match sensor relev geograph region applic hear relev sensor respond sensor trigger move network handl directli light audio sensor altern architectur central directori activ sensor central applic interrog monitor specif trigger goal elimin commun cost maintain central inform provid robust network spite chang move limit batteri power explor approach work section quantifi potenti save section demonstr exist simpl architectur commun achiev highli energi effici applic design kei contribut work identifi specif scheme flexibl match rule ground share framework attribut sensor type show approach enabl process local data quantifi benefit run system previou work discuss commun primit constitut direct work understand design space network protocol underli direct evalu perform find scalabl good number node traffic work develop softwar architectur realiz attribut process oper system emploi simplifi attribut scheme aggreg simul necessit approxim effect radio paramet simul set match sensor network hardwar paper evalu design question process encount deploi sensor present result data testb detail implement mac numer earli system develop gener approach softwar design sensor network work uniqu replac augment underli network rout match rule effici implement express cover wide rang process relat work work build prior work sensor network system larg amount work gener special domain intern structur mechan servic research industri develop numer system layer top network univ arizona design provid servic discoveri group comput print unload includ attribut build standard internet protocol commun commerci system ldap oper internet rout provid primarili hierarch organ depend address rout limit add substanti overhead appli system highli environ sensor network approach servic locat smart space requir servic ip host servic registr process system provid process altern provid system commun structur distribut system linda structur distribut program cpu common memori call tupl space implement basic commun implement assum uniform rapid commun processor system isi inform bu provid approach inform provid publish inform client subscrib subset inform system design robust assum commun node approach directli applic sensor network process process close process manual configur specif work primit solut specif problem srm suggest data fundament data unit reliabl multicast demonstr approach distribut whiteboard work inspir differ provid wider rang match oper ad process leverag sensor oper directli commun protocol internet multicast infrastructur process recent work activ network activ servic examin wai provid process internet sampl applic includ inform network cach work built augment extend assum node individu address build directli commun primit identifi data node work differ activ servic assum commun cost node vari greatli activ servic assum roughli distanc node differ activ network primarili target target sensor network bandwidth energi comput power compar plenti activ network typic consid domain bandwidth ratio comput power bandwidth energi issu approach distribut code question code safeti portabl problem central sensor network devot singl complex network benefit execut environ support upgrad recent work adapt web cach file share system explor process unlik activ network approach protocol design applic work run directli commun virtual network layer internet system sensor network research activ advanc sensor node radio hardwar work instrument clarifi comput commun process focu process motiv work work base sensor primari differ work structur data commun internet ad hoc rout al survei protocol sensor network ad hoc rout recreat requir kind directori servic locat unlik approach attribut ad hoc rout support process jini resourc discoveri system built internet protocol directori servic java distribut process user make suit network high bandwidth multicast distribut directori network process intermedi system address problem wireless network servic discoveri servic locat object network collabor server target high bandwidth resourc work present fundament advanc network commun network devic work static hierarchi network host similar tier architectur full data dynam process spin evalu variant flood wireless sensor network data spin identifi metadata assum individu sensor address attribut data global uniqu identifi spin process intent system system oper overlai network internet attribut structur mechan method cope dynam locat devic similar approach motiv mechan primari differ assum commun basic commun primit construct overlai network internet architectur impli distribut match small commun node manag resolv cooper manag part namespac detail match system work sophist hierarch attribut ing procedur approach modest comparison smaller add compar oper addit equal analyz perform rout mechan data compress commun compress reduc energi consumpt compress kind process support flow opportun aggreg work mechan activ dataspac describ attribut base mechan queri physic object produc store local data dataspac divid smaller administr logic logic group address network level multicast address correspond geograph valu attribut serv network indic queri result involv aggreg specif queri address approach similar map attribut geometri larg number multicast group rout directli attribut indirect explor process devic system distribut queri sensor network move data central site sensor data repres abstract data type public interfac correspond specif signal process function support sensor type perform join aggreg network central comput queri plan work common emphasi studi nest queri inspir work primari differ work placement process determin filter nest queri enabl placement central translat queri assign process distribut incur overhead central collect network inform queri optim declar rout lincoln lab closest work api defin collabor develop independ implement primari differ work focu process evalu work complet section architectur commun architectur base direct match filter direct dissemin inform distribut system data manag list tupl match rule identifi data arriv intermedi filter process data approach provid extern framework relev applic compon balanc gener servic match rule attribut filter describ compon direct direct data commun mechan sensor network data sourc sink attribut identifi inform provid interest goal direct establish effici commun sourc sink direct commun paradigm commun tradit network describ element simpl sensor network design track anim wilder user network track movement anim remot park direct track task repres interest interest list pair describ task scheme describ detail attribut attribut describ data desir sensor type possibl geograph region identifi contact relev sensor term sink denot node origin interest destin data interest propag sensor node region kei featur direct sensor node node store interpret simpli forward sensor node receiv interest rememb neighbor neighbor interest set gradient gradient repres direct data match interest statu demand activ inact possibl desir updat set sensor node redistribut interest neighbor node infer potenti sourc geograph inform exist similar interest forward subset neighbor simpli broadcast interest neighbor sensor node match interest applic activ local sensor begin collect data activ expect sensor sensor node gener data messag match interest direct data repres scheme sensor node gener event descript term sourc data cach intermedi node propag sink cach data level core mechan cach suppress duplic messag prevent preferenti forward interest core primarili interest exact hash attribut comput compar complet cach data process data detect singl object sensor merg singl base criteria initi data messag sourc mark exploratori neighbor match gradient sink multipl receiv subsequ data messag interest prefer neighbor deliv copi data sink reinforc prefer turn reinforc prefer upstream event sourc interest interest propag sink event sourc gradient initi gradient set node prefer path sensor node attempt local repair fail path sink neg reinforc current prefer neighbor neighbor deliv sensor data neg reinforc propag remov gradient exist path longer neg reinforc suppress loop duplic path due network dynam initi exploratori data subsequ messag reinforc path period sourc send addit exploratori data messag adjust gradient case network node energi temporari network recov lost exploratori messag recoveri data loss left applic simpl applic transient data sensor report state addit recoveri develop retransmiss scheme applic transfer persist data object simplifi descript point kei featur differ tradit network commun sensor network interest data commun unlik tradit data network commun node sensor network corollari previou observ sensor network sensor node interpret data interest messag design choic justifi sensor network sensor network commun network node global uniqu identifi global uniqu address regular oper distinguish neighbor individu node process perform coordin close phenomena perform data result energi save describ usag direct paradigm type figur paradigm gener discuss applic section attribut tupl match rule messag applic interest tupl attribut identifi uniqu sink event sourc figur simplifi schemat direct data deliveri reinforc path attribut set attribut formal match attribut actual compar match true match return return true sink figur match algorithm kei drawn central author practic implement simpl number assum coordin internet protocol number attribut implicitli data format float point valu uninterpret binari data oper field defin data messag interest interact oper usual binari comparison match user actual oper formal comparison paramet comparison match compar formal paramet attribut set actual formal paramet miss match actual attribut set match fail gt actual match lt gt set attribut complet match match succe direct attribut set match match algorithm succe match style similar rule languag linda add match rang oper addit equal multipl attribut oper present effect formal satisfi match success approach strike balanc implement flexibl simpl bound set oper implement ten line code rectangular region attribut match continu section user sensor network track anim queri translat interest attribut eq interv durat ge le ge le implicit attribut ad identifi messag interest interest specifi detect anim region rectangl inform frequent data return long queri sensor network program anim search routin time download mobil sensor watch interest anim express interest interest attribut eq type interest arriv sensor activ sensor paramet provid repli detect sensor detect data messag includ attribut instanc intens confid timestamp class messag satisfi origin interest encod attribut addit inform confid sender detect illustr detail specif queri show data conveni encod geometri attribut simpl match rule work applic applic subset omit geograph constraint small sensor singl attribut sensor found primit provid good build block rang describ section match perfectli cover scenario task simpl match case approxim code refin choic perfect rectangl align coordin system insuffici describ arbitrari geometr shape shape accomplish multipl smallest bound rectangl applic ignor request insid rectangl requir region applic gener attribut clarifi paramet subtyp filter applic influenc process filter filter mechan code run network assist process applic provid filter sensor principl filter distribut mobil code packag filter regist kind data handl trigger time kind data enter node filter arbitrarili manipul cach influenc gener messag filter access intern inform includ gradient list neighbor node filter typic tive signal similar task benefit control data movement addit found debug monitor continu filter suppress concurr detect anim sensor regist interest detect interest data attribut record desir interv repli interv unit suppress repli sensor sophist filter count number detect sensor add addit gener kind aggreg rate applicationspecif manner filter discard reduc unnecessari commun greatli extend oper lifetim describ applic filter section quantifi benefit aggreg scenario section implement implement part architectur current refer implement version compon lab implement attribut match filter implement run linux desktop pc sensor node cpu ram flash figur sensor node node custom figur implement bare subset servic design run tini processor memori sourc code implement found web implement build simpl radio api support broadcast unicast neighbor neighbor kind requir persist persist identifi ethernet mac oper assign identifi basic api refer implement includ network rout api summar figur complet specif sourc api defin approach data handl receiv node subscrib set attribut subscript result interest network set gradient callback function invok relev data arriv node applic gener inform publish send specif data attribut publish call match subscript activ publish data leav node optim sensor node avoid gener data case applic subscrib subscript inform subscript arriv termin api shown figur filter primarili callback procedur call match data arriv oper attribut filter direct access messag includ identifi previou destin node node ucb figur oper platform handl const int handl int int figur basic api handl int void handl void handl figur filter api evalu addit level control optim geograph inform avoid flood exploratori interest expect interfac extend gain experi filter inform requir api design favor program successfulli environ target program avoid synchron error avoid memori perform overhead multithread evid grow softwar suit platform filter applic run memori address space core space oper small sensor node lack memori protect perform optim multipl address space desir robust isol filter applic declar rout dan defin basic api develop independ implement lincoln declar rout system principl applic depend filter run implement level portabl demonstr queri proxi run implement declar rout data similar data differ rout transmiss applic core system primari differ declar rout includ filter applic directli influenc filter critic compon enabl gener data process lincoln declar rout includ direct support energi rout rout select avoid node gener move target geograph area current implement interest exploratori messag flood network gradient set direct commun explor filter optim geograph inform subset approach implement small processor distinguish extrem small memori footprint complementari approach full system subset full retain attribut singl support limit filter result add byte code byte data host oper system full system requir daemon static size librari implement compon add code data support radio photo entir system run memori static configur support activ gradient cach packet relev byte packet requir port requir chang applic accommod case implement strict attribut match reduc logic header format compat full implement implement softwar gatewai implement provid filter essenti compon enabl aggreg plan add intend leverag abil air program filter dynam region sensor distribut photo sensor room detect chang light temperatur sensor fine grain provid sensor data process abil commun node provid addit capabl wireless commun condit envisag tier architectur larger smaller node node form highest tier act gatewai tier tier connect sensor run network program tier node control filter program capabl node implement discuss draw observ experi implement rang implement suggest idea code portabl independ implement main declar primari implement run multipl platform june port progress radio requir modest term cpu speed processor memori megabyt support radio bandwidth radio design packet size small requir moder size packet code fragment demonstr implement subset processor common fulli custom protocol observ suggest preclud due size complex applic techniqu sensor network applic techniqu detail techniqu illustr process build effici applic sensor network approach examin data process reduc data traffic conserv energi approach provid nest queri sensor cue briefli describ applic implement data aggreg anticip sensor applic queri field sensor action sensor activ surveil system notifi biologist anim enter region coverag deploi sensor overlap ensur robust event trigger multipl sensor sensor report detect commun energi cost reduc data aggreg return user data aggreg binari area detect quadrant aggreg infrar sensor chanc detail aggreg common system problem design mechan establish data dissemin path sensor aggreg implement kind data fusion tradit network node order determin sensor present bind servic exist geograph list node identifi sensor region sensor elect algorithm dynam elect network node aggreg data return result architectur realiz opportunist data aggreg sensor select task achiev node geograph attribut data sensor intermedi sensor return path identifi cach relev data achiev run filter intermedi node suppress duplic data simpli propag slightli delai aggreg data multipl sourc experi influenc dynam select aggreg point minim data movement opportunist data aggreg benefit aspect approach filter provid natur approach inject code network attribut match filter remain inact trigger relev data common attribut set mean filter incur network cost interact directori map servic prior work analyz perform aggreg simul section evalu implement real sensor node valid initi result laboratori test nest queri event occur chang person enter room correl light open presenc absenc sunlight sensor network correl trigger secondari sensor base statu effect nest queri insid reduc duti cycl sensor reduc energi consumpt secondari sensor consum energi initi acceleromet trigger gp network traffic trigger imag gener traffic constant video process applic resourc motion sensor trigger user user figur approach implement nest queri squar initi grai circl trigger larg circl user thin dash line repres commun initi bold line commun trigger sensor figur show approach user sensor trigger network case assum sensor locat node commun directli part show direct implement user queri initi sensor sensor user queri trigger sensor small grai altern shown part approach user queri trigger sensor initi sensor nest queri approach grew discuss philipp bonnet queri optim advantag nest queri data initi sensor interpret directli trigger pass user monitor applic initi trigger sensor close cover physic user distant nest queri local data traffic trigger event send distant reduc network traffic latenc network typic reduct latenc reduct aggreg bandwidth user differ overload oper network challeng nest queri robustli match initi trigger sensor select good trigger sensor desir implement direct queri straightforward sensor user subscrib data initi sensor detect request statu trigger sensor subscrib recent direct queri illustr util predefin attribut identifi sensor type make geographi optim rout nest queri implement enabl code trigger sensor watch nest queri code relev initi sensor activ local trigger sensor demand multipl trigger sensor accept reason definit central select tion algorithm algorithm trigger sensor nomin random delai inform peer locat elect approach inspir srm repair timer peer disput claim locat extern frame refer defin node timer weight distanc minim number disput claim section evalu nest queri experi testb applic addit approach explor system research effort research cornel system provid commun applic repres visual sensor field queri proxi sensor node applic attribut identifi sensor run queri proxi pass queri proxi origin idea nest approach nest queri futur work includ understand network inform queri optim altern approach nest queri research bae system pennsylvania state system collabor signal process bae system contribut signal process code system provid sensor fusion algorithm combin system system commun data sensor data time filter architectur interest futur work evalu sensor fusion filter evalu approach paper effici implement improv distribut system sensor net section applic emploi techniqu measur benefit aggreg nest queri verifi raw match perform aggreg benefit section argu easi build sensor network applic filter earlier observ aggreg import perform data valid result actual implement simpl surveil applic filter examin aggreg testb sensor node distribut floor isi sensor connect rpc modem radio provid attenu antenna commun confin space exact topolog vari depend level rf network typic hop evalu effect aggreg sink side topolog node data sourc side node typic hop sourc gener event repres detect figur node posit sensor testb light node remain dark node floor radio rang vari greatli depend node longest stabl link node object rate event experi repeat event artifici physic sensor signal process event gener byte messag sequenc number synchron experi start node configur aggreg filter pass uniqu event suppress subsequ event ident sequenc number scenario abstract detail complet sensor network real signal process captur essenc network compon aggreg compar energi expend receiv event measur directli reason hardwar directli measur energi consumpt run system observ choic mac protocol complet domin energi measur low power mac protocol sleep period domin amount time spent choic protocol protocol sensor network experi mac approach measur energi consumpt estim effect reduc traffic mac duti cycl simpl model energi consumpt ô ø defin rel power time spent send defin requir listen duti cycl fraction time radio listen receiv traffic destin found sensor network pocket sever radio time rel energi oper sensor network timestamp sequenc number requir time synchron global gp sequenc number time experi synchron clock synchron sequenc number timestamp byte receiv distinct suppress suppress number sourc figur byte normal number distinct vari number sourc consumpt measur ratio assum energi consumpt ratio energi usag node duti cycl complet domin energi spent listen duti cycl half energi spent listen duti cycl begin domin send cost duti cycl radio todai radio node duti cycl analysi illustr import mac protocol directli measur energi figur measur byte node system normal number distinct event receiv point graph repres experi confid interv perform sourc basic ident suppress form suppress requir data event multipl sourc experi suppress suppress amount traffic roughli constant number sourc data aggreg show benefit process show traffic repres data control traffic compar traffic suppress show suppress reduc traffic sourc network exhibit high loss rate level traffic current mac perform simpl carrier detect lack messag broken loss singl fragment result loss hidden termin mac perform poorli high load work mac protocol confirm result simpl traffic model approxim messag long add interest messag flood reinforc messag reinforc path sink simpl data messag data reinforc aggreg exploratori data messag data sourc flood turn possibl data messag sourc incur cost full data messag aggreg hop incur hop cost aggreg point messag travel sink sum messag cost normal event expect aggreg provid flat independ number expect byte event aggreg number sourc rise shape predict match absolut term aggreg case differ due experi tend drive middl event gener experi deliv congest portion experi sourc high traffic normal fewer event sourc happen data sourc aggreg amount data lower predict observ longer path experi expect measur aggreg valid previou simul experi wider rang scenario previou simul studi shown aggreg reduc energi consumpt factor larg network activ sourc sink care compar energi byte energi save sourc greater traffic save observ sourc primari reason differ differ ratio exploratori data messag system exploratori messag rate messag select good gradient flood node data messag messag reinforc gradient form path sourc sink simul ratio exploratori data messag sourc messag data messag model testb ratio messag data messag roughli ratio experi small radio bandwidth reason run time larg differ ratio consist larg differ energi traffic save potenti disadvantag data aggreg latenc effect aggreg latenc strongli depend aggreg algorithm algorithm experi affect latenc forward uniqu event immedi recept suppress addit duplic addit neglig cost search aggreg delai transmit sensor read hope aggreg read add latenc understand aggreg sensor fusion algorithm import area futur work quantifi benefit aggreg specif aggreg process exampl rang simpl data audio event deliv number light sensor figur percentag audio event successfulli deliv user cach collabor signal process experi attribut match filter make aggreg similar servic easi enabl notic perform improv nest queri benefit section suggest nest queri reduc network cost argu nest queri implement attribut filter valid claim potenti perform benefit implement measur perform applic nest queri applic similar section figur user request acoust data correl light sensor testb shown figur place user node audio sensor node light sensor node hop light sensor audio hop user node provid reproduc experi simul light data chang automat minut minut light sensor report state special attempt made synchron audio sensor gener simul audio data time light sensor state light audio data messag byte long figur show percentag light chang event successfulli result audio data deliv user point repres experi show confid total number event number time light sourc chang state success event audio data deliv user deliveri rate reflect messag deliveri rate cumul effect send data hop nest flat system primit mac protocol impact congest miss event translat detect latenc sensor network afford miss event retransmit time sensor loss rate unaccept high set interest set data class interest class data task eq task confid gt confid latitud ge latitud latitud le longitud longitud ge target longitud le target figur attribut match experi tional system experi sharpli contrast bandwidth requir nest flat queri sensor flat queri show significantli greater loss nest queri light audio data travel user flat nest queri suffer greater loss sensor queri fall compar deliveri rate nest queri queri show local data sensor import parsimoni bandwidth network expect nest queri oper lower level data traffic queri lower radio duti cycl longer network lifetim cost match attribut match commun applic system technolog trend suggest rapid improv processor sensor node chose hold perform constant leverag technolog reduc price perform consid constraint memori small implement evalu match perform examin cost match data sensor basic match case compar interest data shown figur evalu cost larger data object number attribut data attribut experi sensor node cpu evalu cost singl match measur cost match match loop repeat experi time avoid undu system effect interrupt order attribut set random experi show confid memori cach approach underestim cost basic trend identifi applic oper system expect cost match linear number element confirm figur show cost match number attribut attribut set wai lowest line show case attribut set match set confid set chang match algorithm test formal set increment cost addit attribut set fairli small insensit type attribut ad fail formal set expect cost higher match number attribut set figur match perform number attribut grow measur higher line show cost match attribut succe differ cost addit attribut line show cost addit match line addit attribut formal eq attribut match set addit attribut actual examin requir search current implement complet absolut perform oper reason small attribut set slow match set slow internet router reason sensor network expect event happen frequenc measur suggest potenti optim match perform segreg actual formal reduc search time formal match formal compar attribut static dynam optim move attribut match front plan explor kind optim futur experi discuss experi provid insight sensor network build substanti prior simul studi experi examin nest queri match perform suggest cpu overhead match constraint power sensor node nest queri greatli reduc content local data movement experi explor oper previou simul studi sensor network radio actual hardwar protocol scenario behav qualit sensor network common wireless lan earli oper experi demonstr difficulti oper sensor network high util observ suggest area futur sensor network adapt local node densiti begin explor area work understand paramet map overhead reliabl present frequenc exploratori reinforc applic oper open feedback congest control aspect radio propag prove unexpectedli difficult experi show asymmetr link fine direct poor imposs work asymmetr link provid intermitt connect futur direct send similar data multipl path gain robust face link current simul statist adequ reflect observ propag characterist gener happi approach attribut filter easi build adapt sampl applic debug softwar futur work work describ current approach construct robust distribut sensor network applic suggest area futur work includ enhanc testb appli addit understand build sensor network plan testb hardwar plan move radio rf monolith ucb packet control control rpc rapid approach give complet control mac protocol explor perform simul testb experi aggreg show qualit result evalu step experi parametr simul work repeatedli challeng difficulti understand network dozen physic distribut node current environ augment radio network separ wire network data work develop analysi tool network tool report chang radio observ rate energi permit flexibl accur synchron node clock begun work monitor tool work mac protocol sensor network continu challeng spite publish work area ongo freeli energi awar mac protocol remain explor altern hope solut forthcom balanc control data traffic import system sensor network techniqu constrain control traffic exist protocol wire network approach appli system explor applic sensor network collabor applic remain interest direct explor collabor signal process interact process filter focu wireless sensor techniqu develop relev wire sensor network wire connect greatli reduc bandwidth constraint elimin power reduc system complex decoupl data sourc process reduc latenc improv scalabl prior system separ abstract virtual inform futur direct appli wire sensor network coupl physic world paper approach distribut system built data process attribut extern mean sensor type geograph lowest level approach avoid multipl level bind common approach data turn enabl process support data nest queri similar techniqu critic reduc network traffic conserv energi evalu effect techniqu quantifi benefit process data aggreg nest queri experi found aggreg reduc traffic nest queri reduc loss rate aggreg studi experi evalu techniqu oper testb approach import emerg domain wireless sensor network network power resourc constraint fundament acknowledg dan work defin network rout api van jacobson suggest appli direct sensor network peopl particip develop includ alberto jeremi lewi jerri zhao jerri zhao set debug station jeremi prompt modif rpc devic driver measur paper imposs input group uc berkelei support discuss paper benefit contribut numer includ philipp brian nobl paper sosp review refer design implement intent system symposium oper system page dec acm katz activ servic framework applic multimedia transcod acm sigcomm page sept acm mobil network ieee person commun oct birman process group approach reliabl distribut comput commun dec seshadri queri process devic system technic report cornel oct peterson reason system acm transact program languag nov perform wireless ad hoc network rout protocol intern confer mobil comput page oct acm brook iyengar robust distribut comput algorithm ieee june carriero gelernt linda kernel tenth symposium oper system page dec overview model servic recommend zhao habitat applic driver wireless commun technolog acm sigcomm workshop data commun latin america san costa apr acm hong distribut anonym inform storag retriev system icsi workshop design issu anonym juli silva network rout applic interfac walk dec declar sensor network spie integr command environ san juli spie spie intern symposium optic scienc katz architectur secur servic discoveri servic intern confer mobil comput page aug acm estrin transact identifi dynam sensor network intern confer distribut comput page apr ieee floyd jacobson resourc manag model packet network transact aug rout address assign aggreg strategi rfc internet request sept balakrishnan commun protocol wireless network hawaii intern confer system jan balakrishnan adapt protocol inform dissemin wireless sensor network intern confer mobil comput page aug acm system architectur direct network sensor intern confer architectur support program languag oper page nov acm imielinski goel queri monitor deepli network collect physic space ieee person commun special issu smart space octob estrin direct scalabl robust commun paradigm sensor network intern confer mobil comput page aug acm jacobson compress header serial link rfc internet request feb jacobson adapt web global cach architectur intern world wide web june domain facil rfc internet request nov inform architectur extens distribut system symposium oper system page north dec acm peterson servic network acm sigcomm confer page aug kaiser wireless integr network sensor commun unicast address format rfc internet request jan jacobson scalabl timer soft state protocol ieee apr ieee singh power awar protocol signal ad hoc network acm comput commun juli sensor network confer sept survei activ network research ieee commun jan waldo jini architectur comput commun oct zhang refresh ieee intern confer network oct ieee estrin energi conserv ad hoc rout intern confer mobil comput page juli acm kill lightweight directori access protocol rfc internet request mar govindan geograph rout wireless sensor data dissemin protocol work mar estrin residu energi scan monitor wireless sensor network technic report
AI/1623 2 fl kluwer academ boston manufactur netherland learn histori mobil robot condit michaud maja depart electr comput universit de comput scienc southern lo ca henri maja matar abstract learn mobil robot domain challeng nonstationari condit approach proven make mobil robot work situat behavior manag interact robot observ exploit model interact robot initi set modul algorithm approach dynam adapt select behavior histori approach valid pioneer robot context multirobot forag task result show effect approach advantag regular experienc lead fast adapt special learn robot introduct learn mobil robot domain requir cope number start difficulti robot difficulti percept limit process memori capabl affect robot abil repres environ evalu event place perceptu comput abil robot accompani larger state space learn time complex system stationari condit typic requir enabl robot learn stabl control model environ dynam environ dynam make learn task difficult gener robot control applic proven supplement fundament learn algorithm addit knowledg order make real system work mahadevan method bypass complet autonomi give rasa learn techniqu favor incorpor bia learn process refin alter initi polici dynam chang impli learn place underli situat condit obstacl manag system robust simplic construct shown effect domain mobil robot system adapt dynam environ system commonli collect modul map environ state gate mechan base state behavior action switch execut robot learn algorithm learn associ percept action learn behavior del mahadevan associ percept behavior asada object behavior minim learner state maxim learn trial initi knowledg learn robot form set defin skill handl situat encount environ accomplish goal learn local gate mechan extent initi associ percept behavior program task involv partial state environ incomplet percept interest solut problem explicitli time sequenc observ histori inform learn form percept action larg continu space requir extens train period histori behavior level reduct learn base control resourc manag robot interact oper environ learn model chang robot respond perceiv condit case unpredict environ world dynam difficult design fulli predict captur robot learn algorithm robot monitor interact oper environ alter behavior select robot initi set subset accomplish assign task safe goal algorithm learn select altern behavior adapt robot behavior experienc dynam select base tree histori perform deriv observ past behavior histori behavior algorithm learn model typic repeat dynam demonstr valid approach pioneer robot context forag environ present detail algorithm obtain paper organ section detail explan learn algorithm section describ setup mobil robot section present result discuss properti learn algorithm section section summar relat section conclud paper learn adapt behavior select robot type modul oper environ behavior classifi respect classif analyz interact deriv observ behavior behavior achiev specif oper requir robot accomplish task behavior requir safe navig environ call type type trigger specif condit robot behavior introduc varieti action repertoir call contrast type priori condit activ algorithm describ learn activ behavior robot past experi note behavior activ direct control actual control robot effector base behavior rule gener action subsumpt organ control system section behavior consid control action robot approach mechan repres sequenc behavior evalu recommend mechan select path delet mechan describ turn tree mechan robot accomplish behavior execut sequenc store tree structur repres histori node tree store type behavior repres number time transit node successor shown figur synchron root node tree behavior start task tree task empti increment construct robot task leaf node letter store total perform tree figur tree histori behavior list notat junction indent align path path complet sequenc behavior averag store current perform trial number determin empir comput store show list notat section histori behavior result perform valu give robot abil learn trigger observ dynam metric perform perform evalu varieti factor robot oper dynam environ limit optim difficult defin solut explor time behavior kei evalu metric metric domain task evalu express relat amount time requir accomplish task experienc max tb mb tb max tt tt tb refer mb current cycl evalu activ term relat reflect amount control robot express relationship term posit neg evalu function bound mb larger tb period time greater evalu function discrimin experienc ad correct factor enabl discrimin trial note variat monoton durat interact experienc environ term relat penal robot perform time accomplish task past tt repres averag total number accomplish task updat complet task number determin empir analyz typic establish adapt environ toler poor perform result explor option tt captur dynam environ affect time complet task recommend criteria select addit evalu time decid algorithm make activ behavior set option refer observ recommend activ select criteria compar perform current posit tree expect perform expect perform node sum store perform multipli frequenc rel current posit tree expect perform start posit tree relat refer access perform memor number time node visit expect perform option current posit tree expect perform similar formula express relat simpl applic formula bold node figur current node expect perform expect perform total expect perform node note longer path necessarili lower evalu function influenc number node path time spent behavior expect perform current posit tree choic made algorithm base ffl option maximum expect perform criterion refer tm maximum exist current posit option nearest junction option robot explor option limit depth tree option ffl situat untri option select untri option select criterion refer untri option multipl untri option chosen randomli untri option perform trial option obtain global option tabl arrai past perform index option updat end trial averag result perform option trial case tree provid choic enabl algorithm chose option show global perform past mechan prevent consecut recommend option show prefer untri option order encourag uniform explor avoid earli stage learn choic made algorithm base criteria untri option junction select untri option select option perform global option tabl evalu recommend criteria place node node creat observ occur accomplish robot result node recommend directli set lower tm greater equal condit posit overrid select made tm note path expect perform default option behav robot explor accomplish path delet mechan algorithm noisi delet path interact model tree repres date expect perform weight averag base frequenc occurr option greater influenc variat option make harder modifi chang strategi option fact forget import learn forget path lead explor choic discov world node delet serv regul memori enabl robot respond recent opt delet oldest path tree path store trial number store determin oldest valu node tree updat criteria easili substitut applic setup task descript experi perform real world interfac pioneer mobil robot figur equip sonar fast track vision system robot program mar agenc reactiv languag program multipl concurr process behavior robot left figur robot robot equip contact sensor experi conduct rectangular pen pink block home green cylind color object perceiv robot vision system obstacl wall detect sonar dark stripe wall pen strip cardboard improv sonar reflect robot perceiv pioneer sonar distinguish move obstacl behavior pioneer robot influenc ffl limit vision system robot vision system limit field suffer variat light intens place pen angl approach made robot miss block miss home region time pioneer robot vision front intern state variabl maintain presenc absenc block front affect vision system evenli distribut trial sensor ffl limit control action robot influenc presenc floor gener effector ffl limit process comput resourc pioneer delai act robot continu result turn rate obstacl drop point home garbag collect freez command robot make hit object miss target period figur pioneer robot home robot subsumpt organ behavior experi shown figur behavior control veloc rotat base sonar read visual input robot search block bring home region separ learn tree determin activ robot specif search call home home call activ task make robot move condit activ base presenc absenc block front proxim home behavior activ block push robot drop block home home behavior activ block behavior activ robot close home region avoid behavior handl harm situat robot accomplish task behavior activ home robot carri close approach home region avoid behavior subsum control robot rest activ period time determin ten rest avoid home action behavior level interact model level recommend behavior sequenc tree histori behavior figur organ behavior model learn observ behavior activ behavior search chosen depict bold note behavior design mutual function emerg activ behavior subsumpt organ system home issu command creat emerg function home wall initi bia present subsum organ subsum home order straight chang reach subsum robot turn behavior symbol ad subsum organ symbol sequenc repres behavior process cycl sequenc construct updat interact tree node type search task home identifi actual symbol mainten discrimin situat interact experienc learn robot time current symbol process determin posit tree node tree creat time counter tb mb increment current node expect perform evalu recommend criteria present section task complet task chang tt updat perform store current tree task path delet mechan learn trial robot accomplish task experi goal algorithm learn dynam inappropri start directli domain experi condit make analysi valid properti algorithm extrem difficult gradual address static environ condit complex verifi algorithm learn stationari condit interact environ experi multipl robot perform behavior repertoir set optim retrain vision system paramet color detect object creat situat design adjust behavior priori knowledg environ comput limit amount memori entir robot program kbyte kbyte learn leav kbyte store tree node approxim evalu perform learn collect trace choic junction tt number node ad delet trial analysi collect environ present subsect present result obtain static environ show properti compon learn subsect describ result group experi algorithm make robot learn dynam environ condit describ result obtain search task illustr properti learn algorithm complet descript result found static environ condit configur experi static condit block corner home region fourth corner set pioneer block find back home region experi trial simpl configur main valid algorithm learn strategi involv complex goal find block find home easili perceiv result show algorithm learn robot base tree miss block home region configur block center shown figur find pioneer move boundari pen order block center experi trial hour valid properti algorithm configur box divid pen block region opposit level difficulti find configur shown figur eleven experi approxim trial hour figur configur block center pen tr corner corner corner figur behavior select strategi learn search task configur block center pen figur show behavior strategi learn robot configur block center result good robot loop block time learn strategi involv rest drop block home robot start search block corner corner repres dot behavior corner made robot follow wall block easili bring home region option made robot follow wall directli block visibl follow wall figur result interest emerg function rest found task rest front wall made robot rotat avoid block directli corner interest dynam anticip result strategi effici corner pen robot learn option rest success find block find frequent behavior make robot rotat random angl random reliabl robot block frequent made robot loop block import note discoveri made robot point design pen divid made robot corner corner robot block hit obstacl middl make turn block field view turn time figur configur pen divid region tr figur behavior select strategi learn search task pen divid region corner trajectori depict dot line figur behavior memori locat block turn prevent anticip situat chang behavior repertoir experi state goal robot manag optim behavior design import scale experi kind happen search fix strategi learn robot accomplish search task involv rest robot learn corner avoid move box lose block interest unanticip strategi rest rest front obstacl encount robot figur dynam creat behavior front static obstacl explain result avoid corner robot easili pick block figur rest rest strategi learn search task pen divid region list notat introduc figur figur show tree learn robot trial block center configur valu junction tree shown junction observ option maximum note path depend select option turn option observ lower recommend behavior perform tree figur present tabl learn observ path delet oldest path store prefer path observ option work begin difficult reproduc recommend behavior start trial frequent time trial store result stabl strategi stabl strategi recogn predomin deep surround option ensur prefer option predomin valid corrobor figur show stabil number node indic path tree adequ repres interact experienc robot environ possibl happen made discrimin situat base behavior distinct strategi learn handl case appropri number node tree search task trial number figur graph number node tree search task experi configur block center tabl perform valu store tree shown figur eval number behavior observ rest result obtain configur show compon learn algorithm establish explor adapt exploit stabl behavior select strategi evalu function current situat past experi tree captur sequenc behavior compact fashion make base past experi recommend criteria exploit case case figur search task tree trial experi configur block center compon determin choic make manag process learn tm criterion favor exploit criteria favor explor find option path delet influenc choic made affect tree analysi result reveal import properti learn ffl plai intermedi role explor option node algorithm choic exploit option perform serv memori perform option stabl strategi tm criterion reinforc option part strategi prevent valid strategi modifi small perturb affect experienc perform make learn algorithm adapt easili environ reflect constant fashion perform trial frequent difficult chang evalu made larger number trial subject faster explor exploit outcom recent trial criterion prefer random behavior select favor knowledg deriv past experi blindli explor option ffl establish explor exploit affect delet factor factor creat strategi longer sequenc node small delet factor prevent learn longer requir greater number consecut stabl reproduc event environ delet factor defin storag capabl view principl bia set design factor set number node tree kind adapt design robot manifest number trial requir find stabl strategi stabil learn algorithm adapt choic set paramet show suffici rapidli gener long strategi fast adapt ffl initi strategi serv bia elabor special prevent chang dynam valid experi start configur block chang divid pen region figur show plot junction tree number node tree learn trial experi trial block center result learn stabl strategi behavior chang strategi chang observ option rest trial observ rest option junction tree chang configur occur chang strategi stabil start trial corrobor figur demonstr algorithm quickli adapt environ approach show transfer learn configur configur junction search task trial number figur graph search task tree experi start configur block chang configur divid pen region dynam environ condit multipl robot block brought home put center shown figur robot ad gener environ program move avoid obstacl stai forbidden region contact mount front gripper forbidden region area pen mark dark tile area surround home corner pen control detect obstacl forbidden robot move backward turn move forward move forward freeli constraint motion result great deal dynam dark area inaccess sensor enabl enter area nonetheless fifteen experi trial hour number node tree search task trial number figur graph number node search task tree experi start configur block chang configur divid pen region figur configur pioneer program avoid obstacl area mark dark tile tape learn pioneer robot compar learn strategi addit sourc affect behavior face sonar pioneer robot search block perceiv pursu block push blue pioneer robot red pioneer robot pink block condit presenc movement vari greatli experi stai close home move region block learn primarili depend sequenc past chang experi optim determin task larg amount data statist counter data studi experi video tape order analyz strategi regular found interact algorithm adapt detect interact search learn strategi larg involv rest sequenc option learn observ observ rest rest rest strategi chang time past experi stabl strategi run figur show tree learn robot tabl present perform store tabl perform valu store search task tree experi eval number behavior observ rest figur show trace choic made trial experi data choic delimit consist trial option select criterion posit tree choic made initi favor option strategi remain stabl trial end observ rest strategi prefer trial option explor choic made tm criteria consecut choic valu made posit tree notic trial choic tm criterion overridden made criterion fell shorter path sign robot find block experienc longer sequenc choic gener longer path figur show number node stop start choic case case figur search task tree experi demonstr store path condit figur algorithm robot discrimin situat observ rest rest front static obstacl rest front move obstacl distinct made behavior tm tm tm tr tm tm tm tm tm tm tr tm tm tm tm tm tm tm tm tr tm tm tm tm tm tm tr tm tm tm tm tm tm tm tm tm tm tm tr tm tr tm tm tm tm tr tm tr tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tm tr tm tm tm figur trace choic made search task tree experi special process distinguish move static lead distinct strategi behavior select reveal interest properti learn algorithm addit observ made experi ffl pioneer robot put pen special differ wai accomplish task strategi number node tree search task trial number figur graph number node search task tree experi learn pioneer search task observ rest observ rest learn home learn rest search task pioneer reveal complex interact tree node compar robot environ special strategi base individu experi pioneer pen influenc pioneer abil find stabl dynam interact environ effect ffl mention earlier strategi perform strategi base learn prefer strategi rest strategi learn past rest strategi prefer path memor option phenomenon happen frequent experi elabor longer strategi parallel depend find stabl set strategi suffici number path tree deeper tree make difficult complet path discuss fundament idea present algorithm perform situat system base abil cope exploit dynam interact environ decid behavior control model interact mechan consist framework preserv kei strength emerg add cognit aspect model interact behavior consid implicit model simultan captur factor involv process behavior serv build abstract percept construct experienc evalu robot experi tree situat robot rel creat context evalu similar situat evalu function experi differ commonli approach typic attempt optim extern criteria time requir accomplish total distanc number perform robot situat dynam environ incomplet view world difficult evalu criteria case part typic evalu criteria develop adapt static predict domain case robot decentr distribut framework explicit difficult design optim formula effici repres situat commun robot group polici arbitr scheme question polici appli factor group size group remain reason approach special care design similar impact optim criteria behavior abstract evalu perform grant optim function correctli repres ensur faster learn constrain learn robot condit make difficult evalu learn case show optim formal determin specif experi robot exist effici strategi approach aim effici behavior accord robot abil interact environ evalu learn perform abil approach make consist base past good balanc explor exploit option result demonstr algorithm abil perform function relat enabl learn algorithm make learn independ constraint limit robot specif design behavior subsum group learn robot specif situat gener unanticip behavior select burden behavior design behavior acquir knowledg specif complex dynam system slightli angl camera chang field view constant posit experi approach depend level calibr requir behavior design establish distinct interact dynam deriv effect robot learn strategi difficult design anticip influenc algorithm establish critic point behavior factor recommend activ behavior critic point modifi continu alter behavior variabl robot abil due batteri critic point provid robot abil make expect base previou evalu current perform section kind optim function evalu function learn algorithm context evalu function prove adequ make robot learn inform quickli control behavior stationari condit requir robot special perceptu comput learn algorithm made robot criteria base behavior frequenc studi futur experi extens associ percept action link node discrimin option junction coupl approach knowledg formal encod inform world percept action versu behavior wai repres knowledg mutual system combin explor futur work relat work robot learn approach relat methodolog field machin princip reinforc learn paradigm reinforc learn defin problem face agent learn behavior interact dynam ing task achiev work deal import issu reinforc incomplet imperfect learn prior learn deriv store past experi current situat action form behavior reward base intern measur deduc behavior time kei differ commonli reinforc learn algorithm scalar reinforc complet determin perceiv condit learn learn time depend size learn number option select task set subset limit search distinct task previou approach learn behavior select mahadevan sensori input select criterion approach introduc store histori make learn regular robot interact environ difficult approach reinforc learn behavior full work relat learn observ behavior activ behavior explor reason framework work approach learn behavior activ strategi base histori time window input past behavior activ algorithm retriev similar adapt activ learn associ adapt exist case reward signal maxim consist robot simul valid approach comput complex approach greater approach behavior underli construct model system navig mobil robot landmark environ specif connect behavior network topolog isomorph explor environ behavior store landmark type compass spread activ dynam direct robot goal simpl form behavior select repres histori inform tree inspir work concern learn agent physic comput restrict approach partit state space raw sensori memori featur augment agent perceptu input histori inform interpret context flaw state space bia perceptu constraint encod start root node branch label featur match observ featur perceptu dimens data histori index step leav tree store util estim action mechan successfulli appli learn drive virtual highwai environ approach learn window serv simultan model environ polici algorithm learn strategi behavior behavior abstract addit appli perform approach differ mccallum select criteria algorithm path maximum expect reward random algorithm compar current expect perform tree explor affect path delet statist evalu leaf node approach dynam program approach aim find tabl maxim util valu behavior serv abstract state behavior action behavior process optim fix util function algorithm captur experienc dynam base tree evalu function result continu adapt behavior requir extens train period model nonstationari condit develop algorithm deriv gener control architectur intellig agent base dynam select behavior notion observ behavior call behavior make system monitor proper satisfact express select behavior approach current paper demonstr observ behavior rich sourc inform learn robot interact oper environ evalu inform behavior select learn dynam unpredict challeng problem goal approach enabl robot learn util interact dynam environ behavior learn algorithm histori behavior deriv tree model interact learn model deriv behavior select strategi rel exploit control resourc robot algorithm orient continu adapt learn static polici approach effici demonstr mobil robot dynam noisi condit result show approach consist select behavior condit prevail environ robot past experi demonstr effect approach advantag regular experienc lead fast adapt robot special effici robot learn algorithm dynam prefer attempt learn global optim behavior choic reli perceptu limit long learn interact environ affect dynam robot limit action typic priori approach advoc intern evalu interact advantag valid approach lead learn unanticip behavior strategi perspect robot robot autonomi approach compar learn idiosyncrat special wai behav complex environ predict capabl typic lack make move increasingli mean gener complex behavior acknowledg support postdoctor fellowship michaud provid nserc scienc engin research council research fund offic naval research grant nation scienc foundat infrastructur grant maja matar author barri patienc assist debug program miguel schneider rest interact lab insight comment refer dynam structur everydai life phd massachusett institut ma outlin theori intellig ieee tran coordin multipl behavior acquir reinforc proc intl conf intellig robot germani robust layer control system mobil robot ieee journal robot intellig artifici multipl agenc reactiv system report ma del increment learn navig strategi ieee tran robot develop autonom agent learn artifici evolut home navig real mobil robot ieee tran studi role critic mass adapt task pollack anim proc intl conf simul adapt cape mit press tool design evalu multirobot control proc nation conf artifici intellig ri reinforc survei journal artifici intellig dynam action select proc intl joint conf artifici intellig mi learn coordin behavior proc conf artifici intellig vol automat program robot reinforc learn artifici nsf workshop reinforc summari observ ai magazin integr robot ieee transact robot kei properti implic proc ieee intl conf robot workshop architectur intellig control system franc interact intellig behavior ai lab massachusett institut ma reward function learn cohen proc intl conf machin learn morgan kauffman publish reinforc learn domain autonom hidden state reinforc learn state identif ieee tran learn select attent memori sequenti task pollack anim proc intl conf simul adapt behavior cape mit press reinforc learn select percept hidden state phd depart comput usa architectur de control intellig par select de comport phd depart electr comput universit de canada adapt behavior select observ mobil robot soft comput engin design manufactur learn approach adapt robot behavior select report comput scienc center complex brandei usa control architectur combin motiv situat autonom agent pollack anim proc intl conf simul adapt behavior cape mit press multistrategi learn reactiv control system autonom robot navig
IR/1624 5 bring inform extract environ fabio alberto abstract environ develop inform extract applic applic languag cover write declar resourc inform repres uniformli modul input structur type declar resourc modul implement basic processor share common environ resourc develop debug result environ easi limit train skill introduct exponenti quantiti inform held digit archiv fuel grow interest techniqu inform extract vast major inform textual web electron agenc role inform extract text central system extract piec inform salient user typic output set fill templat extract inform inform data base text inform highlight area natur languag process evalu methodolog defin share larg commun extens evalu carri muc confer applic begin subtask high reliabl gener corpora entiti recognit effort spent ten year number applic implement reason fact emphasi scarc attent paid technolog system suitabl produc applic muc stress specif aspect build applic effect result limit develop import aspect left exist system account aspect relev industri applic opinion factor limit market aspect concern cost applic applic cost consid muc limit port time simplifi perspect potenti applic develop cost person time build applic skill requir la ricerca povo dip di universita di current compet comput linguist requir develop applic skill cl common industri research system modul adopt approach directli deriv basic research base formal methodolog difficult understand layman commerci compani hire group expert specif nlp area inclin hire small group gener compet cl system base architectur modul studi implement separ expert area nlp integr lack uniform architectur modul gener formal develop environ potenti user forc cope varieti formal environ point view current system readi applic aspect evalu technolog avail develop environ definit applic peopl system develop requir possibl port definit declar resourc critic aspect easi integr ffl final applic easili integr user ffl architectur provid facil extens cope recognit complex technic extern modul base commerci technolog morpholog addit interest featur fourth fundament aspect current applic scenario concern document electron languag cope languag multilingu interact realiz ffl extract inform written languag ffl extract inform written languag present problem defin applic domain languag develop start scratch languag current system monolingu attent paid aspect paper present tool quick deliveri multilingu applic design account mention respect step direct bring real paper present architectur discuss organ meet applic environ uniform power set tool applic design aim suppli singl environ account current trend reduc port mention integr applic develop languag cover modifi declar resourc declar resourc modul system emploi modul oper input structur type rule basic environ develop debug resourc uniform architectur uniform simplifi applic develop process reduc requir cost applic singl person gener knowledg cl eventu entir work develop environ deliveri configur develop environ set tool support applic develop end develop deliveri configur produc insert user environ api open architectur case applic specif defin integr modul intern includ modul commerci resourc sharpli separ build applic resourc port applic languag resourc system output compat current evalu muc standard tool develop applic domain system demonstr exist english russian coverag english russian trial applic defin peopl system develop section formal inform introduc section open architectur basic processor default applic present section develop deliveri configur outlin final applic result discuss inform describ architectur introduc formal repres inform share modul lexic element text abstractli repres mean elementari call token token ffl dep tree repres syntact depend token ffl feat featur structur repres syntact semant inform combin token figur relat dep lf sentenc john start eat appl ffl lf quasi logic form provid semant interpret combin token token organ basic data call token chart direct graph vertic token arc repres binari relat dep feat lf arc token chart repres lexic adjac token text process structur process dynam modifi modul oper token chart mean rule organ sequenc cascad descript rule rule perform determinist analysi implement transduc rule increment build updat token access modifi token structur mention syntact semant constraint rule level clarifi token chart rule test semant syntact constraint uniform figur token chart start eat shown relat dep lf rule easili test eat definit indefinit np start arc label part lf reach move arc label dep feat provid inform definit articl architectur architectur main ffl architectur manag control inform flow activ modul order perform ffl set devot specif task set open principl ffl kernel basic machineri modul architectur set modul direct provid architectur manag rest section focu kernel modul move descript default architectur provid kernel kernel set basic processor resourc modul reli intern processor ffl rule engin appli rule token ffl knowledg base manag system formal defin knowledg base basic machineri test consist lf ffl featur structur manag system formal type featur system machineri unif feat declar resourc kernel ffl knowledg base defin ontolog applic domain definit restrict kb comput consist lf ffl type featur basi syntact descript inform feat unifi fsm ffl divid foreground lexicon word map ontolog descript syntact semant featur subcategor inform copi lf feat lexic lookup fl term tightli bound domain gener consist hundr word background lexicon gener dictionari provid default gener inform word fl modul architectur manag activ specif set modul order carri task modul devot task modul divid intern extern extern modul processor integr api gener role modul limit connect applic environ final system integr commerci softwar morpholog intern nativ reli kernel process ffl declar resourc repres cascad ffl processor aim accept control main select token portion token chart modul oper token path parser order list token repres rule engin appli rule token provid result return control main modul intern modul oper token chart eventu modifi import stress intern modul reli kernel process rule rule rule formal primit oper token chart uniform great build applic definit intern modul requir definit sequenc rule cascad wrapper experi modul averag complex defin hour figur commun modul kernel default architectur default architectur provid model present default architectur defin applic cover languag modifi declar resourc knowledg type featur system applic specif architectur defin set modul extend current default architectur consist intern modul implement ffl entiti identif classif proper monetari ffl identif sentenc boundari ffl product suffici approxim complet tree sentenc complet tree relat relev templat fill explicitli relat underspecifi left implicit minim approxim complet tree provid relat differ current system perform partial parser perform kind full text structur produc dep feat lf ffl deriv addit inform lf explicitli mention deriv reason lf person work compani hire compani longer ffl refer resolv implicit relat captur bank japan decid presid result process lf logic form text ffl templat fill lf map applicationspecif templat templat merg recoveri action cope miss inform templat intern repres languag knowledg extern modul default architectur ffl text recogn text part modul defin ffl preprocessor morpholog analysi po tag includ direct facil figur snapshot browser system result show dep lf feat templat browser shown bottom panel control architectur shown top inspect partial preprocess api interfac exist preprocessor interfac provid tool produc tm ffl translat fill templat intern format format default modul produc format fulli compat muc evalu methodolog develop compar system result corpora develop environ deliveri configur environ support user develop applic includ facil ffl resourc compil kernel resourc lexicon type editor compil rule ffl resourc panel run system text set effect rule token rule cascad fsm consist browser token special browser dep feat lf templat ffl applic comparison system result templat provid human corpora muc uniform edit debug environ import applic develop process avoid problem current system base formal debug environ framework singl person build applic possibl automat compar system result result continu monitor resourc develop custom object evalu qualiti result final applic end applic develop deliveri configur produc reduc hardwar softwar requir configur compil debug facil graphic interfac resourc compil lisp code longer requir rule engin architectur frozen final applic insert user environ applic result applic demonstr languag develop domain italian applic bond issu fulli develop reach level demonstr compani demonstr develop english partial russian italian applic bond system reach text develop agenc sole newspap agenc word figur show adopt templat effect automat calcul compar system result result muc develop cycl templat applic organ resourc develop inspect text corpu system compar corpu reach final resourc tune corpu text reach suffici result term system analyz sparc ultra ram italian entiti test stand modul gener corpora domain reach blind test word corpu train word corpu futur work paper present environ develop run applic appeal facil environ ffl adapt applic limit develop declar resourc ffl architectur open insert intern extern modul ffl uniform architectur intern modul implement basic processor improv effici obtain modifi implement kernel year rule engin reimplement week system perform doubl ffl uniform common environ resourc develop debug user requir learn formal featur structur knowledg ffl rule organ sequenc cascad cascad easi control debug methodolog suggest sequenc maxim separ linguist knowledg domain knowledg simplifi port ffl environ limit knowledg comput phd student defin resourc cover reason subset english develop demonstr applic demonstr capabl cope languag test underli approach compat applic demonstr develop studi experi applic requir port languag requir discuss pilot project big american corpor applic field pharmacolog english text continu work domain futur work concern applic machin learn techniqu order simplifi rule write lexicon develop current applic develop cycl figur templat fill bond issu requir month person intend reduc week refer fabio tag inform proc ecai workshop machin learn inform fabio alberto text cascad inform extract confer european chapter associ comput fabio alberto luca johann william fabio david classifi text integr pattern match inform sixteenth intern joint confer artifici fabio alberto daniela fabio languag resourc applic intern confer languag resourc fabio alberto cascad grammar organ inform technic report aaron messag understand confer score softwar user robert kevin architectur multilingu inform inform multidisciplinari approach emerg inform maria springer ralph techniqu inform multidisciplinari emerg springer jerri gener inform extract messag sundheim morgan kaufmann jerri dougla john david mark cascad transduc extract inform natur languag finit state languag yve mit descript extractor system seventh messag understand confer seventh messag understand confer
DB/1625 3 persist improv oid index tempor system depart comput inform scienc norwegian scienc norwai abstract tempor oid index map oid physic locat object transact time tempor index object version index call object descriptor includ commit timestamp transact creat object version oodb updat object tempor updat time object updat previou studi shown potenti present persist cach approach reduc index updat lookup cost tempor oodb develop cost model show reduc averag access cost fraction cost primari context report oid index tempor appli gener secondari benefici applic updat cluster introduct transact time tempor system updat object creat version version access system maintain timestamp object commit time transact creat version object technic report norwegian scienc norwai import featur object uniqu identifi object identifi object access oid oid mean disk page object directli mean oid index map logic oid physic locat object logic oid reason object frequent index object version entri call object descriptor administr includ inform map logic oid physic commit timestamp typic size order size mean small part oid index fit main oid index retriev bottleneck effici access buffer strategi appli import differ manag version object updat object creat effici focu optim lookup updat time object updat object updat creat object delet previou od version insert index page gener low local uniqu part oid integ assign monoton result index updat bottleneck reduc disk index recent index page index page buffer page gener low probabl find od map oid physic recent index entri separ od shore oodb low local index separ od cach util memori space wast larg page small part od cach reduc index lookup cost extend reduc index updat cost od updat costli present approach reduc updat cost note main reason bottleneck low local entri tree intermedi disk resid buffer main memori call persist cach typic larger main memori smaller entri manag lru main memori cach addit reduc updat reduc lookup cost describ analyz perform cost function studi optim size buffer node main memori optim perform note primari context report oid result relev entri access cost index entri cach gener secondari index organ rest report section give overview relat work section describ object index manag section describ section develop oid access cost section cost model studi memori index access pattern affect perform section conclud report outlin issu research relat work tempor system gener immatur case transact time awar prototyp tempor oid perform result present small index fit main expect larger number bottleneck similar hierarchi index import differ entri level regularli move lru improv write read effici cost model report base previou work model oodb tempor oodb model extend includ aspect buffer tree model support version exist tempor oper compar simul detail result simul index buffer index page access found work report part project object index manag start descript oid index version manag outlin base exist design close make integr current oodb basi oid index tempor oid index tradit realiz hash file od oid kei version access current version effici access read current effici od repres current version od repres histor object previou problem time version updat index link list version object access type version object oid effici altern link list version object access valid time costli object chain approach index index current previou version effici access method suitabl search rang oid search perfect assum current version flexibl combin kei rang time rang impli extra high lookup cost current version search assum od object store includ commit time time concaten oid index kei od oid cluster leaf sort commit time search current version oid retriev time interv oid effici object oid od append index tree case monoton oper effici object od version insert tree note ineffici typic tempor queri addit secondari index good candid support navig main featur oodb compar relat system optim variant nest tree focu elabor subject tempor object manag space alloc object updat object impli object previou version object physic locat version previou updat object creat delet assum access current version object access effici benefit object current object previou version histor object updat previou version move histor version store current updat time object updat long modifi od written log updat immedi postpon checkpoint od written log index page written disk buffer replac data interest current version improv system made awar data defin version object updat costli updat object modifi import oodb effici support tempor data reduc perform applic util featur persist index entri cach od access uniformli distribut index leaf node od cach make read access od updat checkpoint interv resid leaf node low local mean good object cluster includ histor object current object studi implic result studi updat object necessarili necessit alloc space updat leaf node updat index node instal read node larg access node random disk instal read costli reduc averag access persist cach subset entri goal frequent od contrast main memori od write entri back checkpoint interv main provid intermedi storag area persist od size gener larger size main smaller size content maintain lru mechan result high local access reduc total number instal make checkpoint costli averag lookup cost avoid denot index tree combin index entri illustr figur organ index relat main memori illustr figur number node small make store pointer node main memori copi od node access order leaf node node rang node store interv oid vulner avoid partit dynam chang oid rang boundari main base updat access rate node high updat access rate node result smaller interv alloc node node frequent repartit repres extra cost import note read node random disk access small seek node cluster random read small seek time node read request elev cost read low lru manag node oper ordinari main memori entri store node disk main memori node buffer od cach figur overview index node node buffer exist entri provid access access tabl maintain bit entri clock algorithm lru approxim access bit set time entri access storag access access tabl node store node problem node discard main memori entri node written back entri chang desir access tabl maintain main main memori resid node node due buffer tabl discard problem access bit map approxim entri discard access tabl maintain main memori node problem tabl node size tabl small bit entri repres problem long larg system content access tabl wrong cach system restart affect perform startup od commit oper safe disk reduc amount wrong cach startup store access tabl node node written disk note differ option node written back updat od store node base observ conclud maintain access tabl main memori node approach addit access node tabl track statu entri respect dirti bit entri dirti bit set time entri modifi insert node dirti entri written back entri mark modifi safe discard updat oper emploi insert od result object updat entri directli insert od impli discard od base lru strategi prefer discard synchron dirti entri avoid slot dirti entri regularli copi asynchron background effici sequenti read sequenti instal read subsequ write node object creation object creation appli directli od result object creation effici append oper creat object part hot write directli od part hot set retriev node discard buffer od access insert read oper read oper belong navig scan oper singl object read read oper check entri access od cach found search search result disk access actual node buffer rang candid disk access access result disk access node buffer od insert od cach od insert od immedi note candid node resid probe search od manag high hit rate optim od cach size small case note od addit entri dirti entri result updat oper instal insert od discard od cach good memori space od od cach candid node resid discard probe insert od insert entri updat oper reli od cach frequent access effici updat strategi delai updat mean entri collect batch updat option depend access pattern instal read option make od retriev read oper insert case option option report scan oper scan oper treat singl object read singl scan oper make current content discard od retriev scan oper gener chanc collect repres hot set number od retriev larger number od fit scan hit probabl similar gener buffer manag case scan oper scan oper updat consult recent updat od actual resid content physic cach cluster page extra cost read page margin updat write dirti entri background read instal dirti entri node number sequenti read write scan avoid buffer node access oper affect rest buffer make node remov buffer rate tune question give higher frequent entri probabl synchron singl entri updat result node full dirti entri higher prioriti mean disk bandwidth od updat penultim dirti od instal checkpoint period case period time content node written back short avoid overflow dirti od buffer buffer share node explain necessarili give optim perform access pollut result low hit rate node avoid separ buffer pin number upper level advantag strict lru optim buffer node index tree analyt model analyt model research cost cost reason cpu process parallel transfer make cpu cost amount main memori necessarili cpu cost easili incorpor analyt orthogon issu discuss report cpu cost affect qualit result import aspect amount main buffer characterist buffer space reflect model tradit disk cost read block disk sum start cost start transfer cost transfer averag start cost set time disk revolut transfer cost directli proport block read disk track transfer cost equal block size amount data track total time transfer block start transfer index cost reduc partit index disk declust node node disk straightforward time read write random index page tp sp index page size cost read write object log oper cost independ index separ issu orthogon studi report focu reduc access time reduc access time disk space disk capac expect extra space worthwhil illustr figur amount reserv index page buffer reserv od cach assum size od od overhead byte entri od number entri fit od cach approxim od hash tabl clock algorithm number index page fit buffer approxim page memori disk address node oid rang boundari lru access tabl occupi total sp od number node index entri access model assum access object system skew object access assum partit rang oid partit size access probabl illustr bottom figur store model stabl total object version index note section perform depend number exist clock algorithm perform close lru storag bit entri oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid oid leaf node logic view tree base oid physic view map root node figur oid index lower part show index logic upper part index realiz physic arrai entri distribut leaf node version total number version analysi model access satisfactori analysi major shortcom estim number distinct object access higher number distinct access object real system reason insid hot spot area smaller higher access probabl import tempor access small number current version larg number previou hot spot area smaller typic reflect model index tree size assum index tree space util number leaf node tree od fanout intern node size entri intern node number level tree tree number node level tree tree tree total number node tree tree tree buffer perform model buffer model extens dan dia lru buffer model due space present import aspect model detail descript found bdd model size data granul partit partit partit fraction fi data ff access partit distribut partit assum access assum independ denot partit set ff fi fi short actual od access partit set bdd steadi state averag buffer hit probabl denot buf number data granul fit buffer buffer hit probabl data granul belong partit denot buf bdd model calcul total number distinct data granul access access distinct od cach hit rate access od cach assum follow assumpt bdd independ random request appli model object entri data granul probabl od cach hit buf gener index buffer model bdd lru buffer model model access model buffer hierarch access complic search leaf page consid random node access tree independ extend origin model analyz buffer perform case hierarch index access base observ level tree access probabl root leaf tree initi partit partit size tree tree number index page level tree access probabl partit account hot divid leaf page partit fraction fi li leaf access probabl ff li rel leaf page partit partit size fi li tree access probabl ff li partit hot spot leaf page level make access node upper level long fanout suffici hot spot area treat access node upper level uniformli distribut level partit illustr figur tree level leaf page partit partit partit node node figur access partit index page access model assum low local index page oid entri partit cluster index illustr figur leaf node index entri unrel entri partit mean access pattern leaf node access pattern logic view initi od partit od access basi deriv leaf node access partit hit rate denot probabl od note actual page memori disk number od node sp od total number od fit sp od probabl od node approxim buf buffer model share page model reflect access probabl node node lru manag hit rate buffer partit illustr figur level tree leaf node partit divid reflect exist hot spot node belong leaf node partit physic adjac page lookup access lookup access lookup result averag page access total access probabl ff pc pc fraction access page part partit access probabl ff idx pc pc total number index page tree fi pc tree fi idx tree tree page partit partit partit denot result partit share denot node buffer hit probabl buf pc pc buf tree share buf idx buf tree share note section advantag separ buffer pc buffer page reserv buffer page reserv pc denot tree partit tree buffer hit probabl separ buffer buf pc pc buf buf tree tree lookup cost assum pointer page rang partit disk access lookup page read replac page dirti read od insert page written back alloc space node number node read time schedul dirti empti slot read extra write cost margin compar read time pointer node written back place time approxim lookup cost lookup pc buf pc access entri level root leaf page buf disk access averag cost lookup lookup buf probabl oid entri request od access probabl pc entri access averag cost retriev entri interest note thing file system parallel base lookup lookup pc lookup updat cost updat index page immedi updat probabl updat index page written back calcul averag index updat cost total index updat cost divid number updat defin checkpoint interv number object written checkpoint number written includ creat updat object written object creation written object updat exist object assum od cach larg dirti od checkpoint delet compact page background mean strategi wrote larger amount od log instal od instal search log check log newer version creation od object descriptor creat object creat number creat object ncr object od append index distribut entri node rightmost node cluster updat object creation directli contribut ncr od creat leaf page index height sn hs page total cost creat object descriptor cost write sn index page instal read page assum disk page written sp modif exist od object object version od insert number updat object checkpoint interv nu ncr od insert page number updat checkpoint interv larger number effici updat read sequenti number updat write continu segment assum high assum insert entri entri remov cost write pc sp number node cost slot entri insert run continu background period round ideal long node full dirti entri process cost equal read number node write dirti entri back assum node full process entri write back node dirti fill amount dirti entri node ideal close avoid delai normal process due overflow dirti entri suffici calcul report number updat object round call super checkpoint period updat index involv page instal page version resid read page buffer cost lookup distinct object modifi number distinct updat object distinct note section object tempor denot fraction data access tempor object tempor updat object alter updat nontempor object number distinct updat tempor object du tempor number leaf page access part instal nm distinct du tree space od leaf insert node written back space node process possibl root node parent node updat case root node height tree possibl page determin updat cost difficult suffici entri index probabl page split small neglect insert page gener updat object checkpoint rememb updat creat entri insert includ page split cost function probabl split order approxim split od page written updat parent node note split affect parent written back result total write back cost split nm split equat assum averag entri insert leaf node case long checkpoint interv suffici effici read complet updat index write back memori larg read write sequenti cost tree sp lookup idx averag index updat cost averag index updat cost object total cost updat divid number updat updat write pc note total super checkpoint updat object creat cost ordinari checkpoint period access cost system lookup cost lookup lookup write back od checkpoint interv similar write back ncr entri make difficult effici averag updat cost set fi fi fi ff ff ff tabl partit size partit access probabl partit set studi updat calcul equat ncr calcul calcul buffer hit index page buffer absenc memori pointer tabl perform studi deriv cost function calcul averag cost access system paramet access section studi valu paramet affect access condit optim size mix updat lookup affect optim paramet studi denot probabl oper write averag index access cost averag cost index lookup index updat access write lookup write updat goal minim access measur gain optim paramet gain access access access access access cost rest give size fraction size difficult kind access pattern experienc predict base current access support tempor featur applic develop util wai access pattern report necessarili repres show gain condit access pattern access pattern partit size access probabl summar tabl paramet kb ms sp kb od paramet mill write tempor tabl default paramet oid access pattern index page access pattern partit extens hot spot partit hot spot hot cold area partit set resembl access pattern close expect futur larg cold consist version set analysi hot spot area result number section base calcul default paramet summar tabl note talk main memori index relat main memori object page buffer orthogon issu valu tabl od occupi gb store compactli object occupi time space reflect main memori mb impli total buffer memori mb investig index memori interv mb dynam area access show avail larger amount memori affect perform effect figur illustr typic cost involv default index memori size gain benefici rel small index memori size compar total index size index size gain show section gain larger main memori note paramet combin section repres averag occur write read oper situat adapt tune system paramet set differ system tune cost index memori mb cost index memori mb index memori mb figur access cost emploi access pattern index memori mb index memori mb index memori mb figur optim size access pattern left effect updat ratio access pattern access cost emploi emploi larg index memori size optim size optim size illustr left figur access pattern index memori reserv od store pointer lru tabl hot spot smaller store hot spot area effect updat ratio main updat perform illustr middl figur show gain valu effect larger amount memori figur illustr gain valid larg main memori buffer minimum gain mb gain gain gain slowli amount main memori effect page size page size import factor determin index perform optim page size contradict factor low larg page size mean wast space index page optim page size smaller small page result higher tree case upper level index tree resid tree smaller page size reduc buffer hit probabl strategi larg advantag creation small captur fact low level share studi optim page size access page size kb kb show small page size benefici kb block commonli result relat system start emploi larger page size index structur index access pattern typic relat system index model report relat index scan benefit larg page size separ buffer analysi separ buffer analysi show cost reduct typic found import accur buffer partit assum knowledg current access pattern difficult practic lru buffer manag margin improv separ advic separ buffer futur work report improv perform develop cost model analyz improv perform characterist access memori index size result show oid index cost reduc gain larg gain good optim size optim tune system import access pattern system system detect tune size index page buffer od cach size cost model report valuabl optim automat tune tool strategi lru tabl updat strategi read oper issu interest work combin strategi dynam adapt improv perform make system vulner rapidli chang access pattern variant data skew report improv oid index applic gener secondari interest applic updat low local acknowledg valuabl comment significantli improv work present report refer dia simpl analysi lru buffer polici relationship buffer transient ninth intern confer data principl buffer manag acm transact kossmann perform evalu oid map techniqu vldb time index monoton tempor design implement publish lomet salzberg access method data acm data manag file structur prentic storag manag method object system phd weikum perform histori data access method vldb tempor object storag intern workshop expert system analyt studi object identifi index intern confer expert system optim oid index cost tempor system intern confer foundat data analyt studi object identifi index technic report idi norwegian scienc suzuki develop perform analysi tempor persist object store australasian ullman principl system comput scienc
DB/1626 3 abduct negat failur activ agent sadri toni depart imperi london uk abstract recent work suggest abduct logic program suitabl formal repres activ intellig agent abduc integr abduct logic program repres action rule expect abduct proof procedur provid engin underli activ manag system agent exist abduct proof procedur argu inadequ handl applic inadequaci due treatment neg liter integr constraint abduct proof procedur give exampl proof procedur achiev activ behaviour proactiv reactiv agent introduct abduct logic program power knowledg applic abduct logic program ii consist logic set abduc abduc atom expand set integr set abduc expand theori earlier work show abduct logic program understand implement activ intellig agent belief desir agent bdi architectur understood logic program integr activ rule activ rule determin reactiv behaviour agent system understood integr constraint abduct logic program rule understood declar integr constraint accur reactiv rule interpret product rule goal set abduc atom variabl substitut variabl pair abduct answer wrt abduct logic program entail sati es notion entail satisfact adopt ful llment properti wrt set set abduc answer abduct interpret system activ abduct answer understood accept set action perform consequ case activ observ case agent observ accur accept set action accur gener action chang ect commun action select abduct answer correspond intent bdi architectur agent number proof procedur comput abduct answer proof reactiv activ manag system agent obtain interleav execut proof select abduc partial comput abduct answer process trigger rule interleav rise cycl investig exist procedur produc requir due inadequ treatment neg liter integr constraint altern abduct proof obtain modifi proof procedur prove sound proof procedur wrt semant abduct answer special sound complet wrt stabl model semant preliminari logic program set rule form ln variabl implicitli quanti scope entir rule vector term rule de ne repres vector term repres vector variabl proof procedur reli complet logic program complet predic de ned set rule nition vector implicitli quanti ed scope entir de variabl implicitli existenti quanti ed righthand side de nition left righthand side call head complet predic de ned logic program procedur present comput answer wrt gener logic program set sentenc select complet comp logic program wrt set predic languag union complet predic integr constraint implic form ln possibl possibl variabl implicitli quanti scope entir implic call head call bodi loss gener assum abduc predic abduct logic program ii de ned refer complement set wrt set predic languag set predic motiv exampl number abduct proof procedur de examin behaviour proof procedur refer fk simpl abduct logic program analog appli remain proof procedur note km sldnfa emploi integr constraint special atom assum integr constraint rewritten liter implicitli conjoin initi goal sldnfa similarli fk comp absenc fk sldnfa produc requir illustr ii abduct logic program ll tax program repres personnel depart ned term relat integr constraint repres activ rule ll tax procedur interpret event rule condit instanc satisfi print action execut input fk sldnfa comput intuit correct answer ll tax presenc negat fk sldnfa produc unintuit illustr exampl ii abduct logic program integr constraint repres reactiv rule dust evacu observ fk sldnfa comput intuit correct answer unintuit answer answer arbitrarili abduc incorrect activ system interpret answer minim wrt set ii abduct logic program integr constraint repres reactiv rule diet procedur interpret event occur condit action diet execut observ fk sldnfa comput altern rst intuit correct unintuit behaviour fk sldnfa due inappropri treatment neg occur bodi integr atom abduc de ned abduc proof procedur treat classic negat implic materi implic classic interpret negat occur bodi integr constraint lead treat diet materi implic reactiv rule integr constraint aim repres de ne modi cation fk comput intuit correct answer goal observ activ perspect proof procedur proof procedur select complet comp abduct logic program ii deriv sequenc start initi conjunct conjoin integr constraint variabl liter initi goal free variabl integr constraint initi goal quanti ed goal sequenc deriv appli number infer rule simplifi treatment quanti de nition comp integr constraint assum variabl head atom atom equal variabl simplest goal deriv proof procedur disjunct simpl conjunct form syntax integr addit quanti ed existenti quanti ed free occur disjunct conjunct liter implic implic obtain repeatedli appli infer rule proof procedur integr constraint ii result rewrit neg liter simpl goal declar tree depth liter implic leav tree fk assum infer rule appli goal sequenc deriv proof procedur disjunct simpl goal initi goal simpl goal integr constraint rewrit neg liter proof procedur make assumpt fk proof procedur abduct logic program ii initi goal deriv wrt comp sequenc gn obtain previou formula applic infer atom dn comp atom conjunct simpl goal atom replac dn atom conjunct bodi implic conjunct simpl goal implic replac conjunct dn lm atom implic conjunct simpl goal lm conjoin negat implic conjunct simpl goal implic replac disjunct logic simpli cation true equal rewrit appli equal rewrit simul uni cation algorithm applic substitut negat elimin de ned rest replac rest de nition case implic free existenti quanti ed variabl quanti ed implic conjunct simpl goal implic replac disjunct variabl quanti ed implic correctli existenti quanti ed rst disjunct quanti ed disjunct simpl goal simpl goal replac disjunct note goal deriv disjunct simpl sucient step negat elimin case analysi step split initi goal conjunct liter success infer rule appli success extract pair substitut replac free existenti quanti ed variabl ground sati es equal restrict variabl set abduc atom extract disjunct success initi goal call answer propag negat elimin split unfold rst disjunct split infer rule appli result deriv success deriv extract disjunct note deriv success infer rule appli disjunct answer extract disjunct modi ed proof procedur modi ed proof implic goal mark mean initi integr constraint mark implic obtain rewrit neg liter infer rule fk negat elimin appli mark implic de ne infer rule handl negat condit mark implic negat mark implic replac disjunct infer rule fk leav statu unchang deriv propag negat rewrit split infer rule appli initi goal deriv conjunct liter success deriv infer rule appli success answer extract pair conjunct form extract free existenti quanti ed variabl set abduc atom comp conjunct deriv wrt conjunct infer rule wrt sati es answer extract conjunct obtain replac answer extract disjunct success deriv initi goal call comput answer deriv extract rst disjunct answer extract disjunct belong deriv wrt comp trueg deriv assum automat rewritten illustr requir equal inequ ed answer extract ii tg deriv success infer rule appli disjunct extract answer comp falseg chosen conjunct wrt wrt satisfi denial disjunct correctli answer extract disjunct formal result proof procedur fk answer comput modi ed proof procedur comput fk theorem comput answer initi goal answer proof result extend version paper theorem fk sound wrt semant abduct answer answer initi goal sati es cet cet ordinari logic consequ logic consequ logic refer abduct answer de ned answer sound result wrt semant answer direct corollari theorem corollari comput answer initi goal answer fk complet weak wrt semant answer initi goal exist subset comput answer procedur weak wrt semant abduct answer speci calli design comput unintuit answer proof fault procedur complet wrt semant abduct answer negat occur integr constraint goal case procedur special case logic program empti atom occur integr constraint initi goal proof procedur comput stabl model semant integr constraint logic program agent special case correspond pure reactiv agent ground neg liter goal logic program rule theorem ii abduct logic program initi predic occur belong comput answer stabl model stabl model substitut variabl comput answer note head rule belong stabl model theorem corollari theorem relat special case consid theorem procedur prove sound complet wrt stabl model semant logic program proof procedur appli model gener theorem prover disjunct logic program obtain replac rule form atom rule form comput set model satisfi denial atom ignor model ka atom prove model set atom stabl model stabl model set atom model theorem ii theorem comput answer substitut variabl comput answer futur work de ned abduct proof procedur compar number exist similar proof procedur argu procedur suitabl engin underli activ manag system agent proof procedur underli procedur agent architectur integr constraint close relat product rule negat failur formal studi relationship subject futur work proof procedur extend handl extens cater tempor reason agent futur work includ ning exist prototyp implement proof procedur acknowledg support uk epsrc project multiag author grate bob kowalski challeng discuss anonym comment refer negat failur logic data ny relationship abduct deduct journal logic comput de abduct procedur abduct logic program journal logic program elsevi product system negat failur proc aaai press procedur abduct logic program journal logic program elsevi stabl model semant logic program proc iclp mit press singh mp read morgan kaufman negat failur model gener theorem prover proc cade lnai springer role abduct logic program handbook logic ai logic program abduct logic program workshop reason logic program logic program system annal arti cial intellig execut suspend logic program fundamenta informatica iso press ecient uni cation algorithm acm tran prog lang system logic framework default reason arti cial intellig elsevi georg abstract architectur ration agent proc int conf principl knowledg reason event calculu plan revisit proc european confer plan lnai springer activ trigger rule advanc morgan kaufmann articl process macro packag llnc style
IR/1627 5 depart comput method nichola poland abstract classif reliabl insuffici input overlap distribut sharp definit class face possibl support system case classif elimin improb class elimin construct classifi assign case pool class win class elimin classifi modifi error function real life medic present illustr elimin introduct fuzzi machin learn system appli classifi approxim problem design class problemat reason due approxim natur linguist concept label case chang continu medic develop mild sever intermedi mix give rise strongli overlap class distribut fuzzi label inform provid insuffici distinguish class differenti unknown featur result medic situat reliabl classif comparison result accuraci base number classif error mislead soft class label insuffici number class defin drawn classif probabl system assign unknown case overlap region classif probabl creat mix border class introduct class automat requir close collabor domain elimin classifi hayashi depart comput scienc japan expert altern solv problem elimin improb predict unknown case belong subset class number fix account possibl class distribut overlap region input space system call elimin primari goal elimin high confid class improb model estim probabl classif creat soft class label elimin class predict belong class neural system modifi optim elimin class predict class classif statist discrimin support vector machin tree nearest neighbor method provid sharp classif detail interpret case method explanatori data analysi attempt visual case relat case train classif confid interv calcul goal paper section problem specif class elimin neural network present method estim probabl applic classifi difficult medic problem present fourth section short discuss conclud paper elimin predict classif problem dimens overlap class gaussian tion equal covari matric exp σ theorem posterior probabl class priori class probabl function θ σ θ θ posterior probabl specif logist output function class normal exponenti function softmax obtain normal exponenti function interpret probabl provid natur perceptron network probabl close situat clear belong border area uniqu classif domain expert decid make introduc mix acknowledg insuffici inform accur classif measur classifi perform measur classifi perform base accuraci matric evalu introduct risk matric characterist curv solv problem standard approach fail provid suffici accur result class attempt creat class minim number error temporari class distinct class requir modif standard cost function class predict model probabl class ci case cost function minim classif error quadrat output valu provid model minim risk run class train true class vector function monoton quadrat function function element risk matrix proport risk assign ci class true class cj simplest case specifi adapt paramet variabl procedur classif model affect cost function regular term aim minim complex classif model frequent ad cost avoid overfit problem minim error sum run train exampl model classifi vector refer set comput simplifi version cost function argmax correspond recommend classifi kernel function measur similar class gener express err local regress base minim distanc approach error function desir valu valu predict model kernel function measur influenc refer vector total error sharp high peak function fit valu refer input vector make larg error valu classif problem kernel function determin size neighborhood case accur classif requir element matrix class frequent mix case separ class independ classifi joint class design model train cost train error function possibl border practic classifi classif suffici reliabl probabl elimin subset class join pair class suffici tripl higher combin consid calcul probabl classifi provid clear optim elimin class select probabl class solut independ classifi system real input valu obtain measur carri finit brain larg recept field small recept field extract featur valu crisp number gaussian distribut gx center sx probabl comput classif model perform mont carlo sampl joint gaussian distribut continu featur gx sx defin volum input space influenc comput probabl probabl altern class fuzzi sx defin paramet ρ defin percentag fuzzi rang xi valu ρ valu probabl chang crisp classifi nonzero probabl class altern win class gradual probabl chang show reliabl classif altern worth rememb probabl rapidli ρ case classif border analysi function si featur strong influenc classif displai probabl detail evalu data case analysi rule complic detail analysi probabl base confid interv probabilist confid interv recent present confid interv calcul individu input vector logic rule extract train set confid interv measur maxim deviat featur xi featur vector chang probabl classif vector vector li class border confid interv vector typic class confid interv wide interv facilit interpret analyz stabil set rule classif model probabl calcul analyt crisp rule classifi rule true fulfil gaussian number gx logist function β slope larg uncertainti probabl significantli interv crisp logic rule data gaussian distribut error fuzzi rule membership function defin differ crisp input slope membership determin paramet proport uncertainti input neural model membership function comput network relat slope β input uncertainti calcul probabl agreement mont carlo sampl calcul base softmax neural output present uncertainti input account probabl depend continu interv defin linguist variabl error depend uncertainti input variant model gaussian conic assumpt input neural model transfer function hidden layer matrix comput probabl number error optim error function method minim perform directli present neural network problem special network architectur uncertainti si valu featur treat addit adapt paramet optim avoid adapt paramet optim group replac common ρ factor defin percentag assum uncertainti group approach lead import improv crisp logic rule provid basic descript give maxim probabl class obtain gradient method optim larg set rule uncertainti input si provid addit adapt paramet rule wider classif margin overcom brittl problem system wide classif margin desir optim placement improv gener system vector unknown class typic class ck uncertainti si xi input reason time real estim probabl significantli case close class border analysi function si probabl evalu influenc featur classif simpl rule explan satisfactori gain understand data approach classif explan worth prototyp vector ri construct tree algorithm similar measur introduc posit prototyp vector paramet similar measur adapt paramet system optim gener framework method approach includ radial basi function cluster vector quantiz method gener nearest neighbor method special exampl explan case point similar case prototyp case ri similar result obtain linear discrimin analysi sharp border direct perpendicular lda hyperplan soft logist function neural network sing neuron weight bia fix lda slope function optim disord studi medic record patient admit affili type alcohol liver damag primari liver record includ result biochem test sex patient case test data previou work fuzzi set input assign recommend medic expert fuzzi neural network construct train correct answer obtain train set accuraci test set vari peak quot result tabl imposs find good criteria predict train test set stop fuzzi rule fuzzi network deriv accuraci test set data analyz mitra al fuzzi mlp system result test set rang depend actual fuzzi model dataset classif crisp rule success initi rule obtain procedur gave train test set optim improv result significantli hand fuzzi rule deriv fsm gaussian triangular gave similar accuraci fuzzi neural network neuron achiev indic good border case complex logic rule requir result dataset summar tabl fsm gaussian triangular membership function achiev accuraci rotat function introduc linear combin input improv accuraci made crossvalid test mix data test achiev similar result method give poor result includ variant learn specif design work continu input statist method tabl result disord accuraci train test top result achiev elimin class predict pair class calcul note method train set test set prob class class combin class combin weight network featur method manhattan gaussian function triangular function tree fuzzi neural network cascad correl mlp fuzzi mlp model rule lda crisp logic rule foil naiv pattern recognit method classif result obtain fsm neural network tabl shown reach neighbor manhattan distanc function select featur accuraci detail featur weight train accuraci knn estim method base algorithm complex optim test method give significantli result matrix obtain train data fsm averag run round integ valu column al ph lc ch al ph lc ch matrix notic main problem predict al lc true class ph number vector classifi incorrectli high confid train data test data reject case confid shown fig classif accuraci reject vector figur relat accuraci classif reject rate success count success strongli excit output neuron correct class elimin leav combin probabl case accuraci reach rule extract test set result reach true classif accuraci result method significantli quot tabl reach test set elimin approach defin fsm network classifi case correctli high case reliabl classifi pass elimin pair class made train error function eq obtain true class probabl class correct answer test train set high accuraci drop threshold introduc class case reliabl test case half remain case elimin class assign case mixtur remain class discuss reliabl classif problem imposs provid support classifi predict case high confid elimin reliabl elimin class case belong mixtur remain class elimin build analysi matric train classifi modifi error function classifi provid probabl estim confid obtain probabl mont carlo estim case probabl determin analyt case evalu time medic cost mont carlo simul relev research determin wai elimin class applic approach medic problem refer introduct support vector machin learn cambridg dj cc taylor machin neural statist elli intellig method data intern symposium comput august neural network pattern oxford ja accuraci diagnost vol pp cg aw moor weight artifici intellig vol pp gr optim interpret classifi intellig inform system springer verlag gr methodolog optim applic logic rule intellig inform system pp gr extract logic rule backpropag network neural process letter framework classif intellig inform system june pp setiono comparison neural network rule extract techniqu diagnosi artifici intellig setiono disord rule extract artifici neural pro ieee intern fuzzi system august vol pp crisp logic rule extract method applic medic comput intellig applic springer studi fuzzi soft vol ps springer pp featur space map adapt comput physic commun develop featur space map model conf neural oct pp sk mitra pattern recognit york neural expert system applic medic intern congress cybernet york citi pp base fuzzi mlp classif rule ieee transact neural network
IR/1628 5 subject document digit librari automat word studi find offer hebrew jerusalem abstract contemporari inform million electron document number document make difficult conduct effici search internet studi found associ document subject list topic make easier locat onlin effect catalog inform perform requir extens resourc present inform catalog paper present find studi base softwar tool automat identifi subject document test document subject geographi famili studi present studi earlier examin subject categori industri manag gener manag web document search result identifi topic catalog introduct searchenginewatch report world wide web billion page includ inform host sheer quantiti huge resourc requir unreason expect part inform base catalog world quantiti inform grow rapidli automat catalog inform document necess vital locat inform catalog inform associ inform list predefin subject concept librarian pioneer catalog human develop method associ book collect subsequ subject catalog system classif system decim number divid subject librari congress subject list term catalog librari unit state alongsid tradit addit tool develop associ exist text set categori tool web site directori manual catalog larg number page internet catalog search engin offer limit coverag studi conduct automat organ inform address internet manner inform displai onlin allen develop prototyp displai search result method project arrang text paragraph tabl hierarch similar tabl content marchionini al develop tabl content resembl search librari congress develop maarek featur user search map cluster automat organ group document group document arrang basi similar predefin set categori project bare touch issu crux cite zamir etzioni hearst pedersen sahami al classif mean organ document group appli statist techniqu document categori defin mean system learn behavior document respect defin enabl creation similar categori document method relev content cite chekuri al mladen chen dumai automat natur process fundament challeng textual inform manag korfhag defin basic approach process text semant analysi syntact approach attempt enabl comput understand natur languag sentenc semant analysi attempt identifi semant structur document mean lexic text analysi proven popular effect method statist techniqu base frequenc pinpoint import term document topic keyword list exist document search result list document found displai relat topic locat subject articl seri experi determin effect present inform list search engin result found present subject categori offer user benefit princip advantag user find requir document view list result search read document list displai subject document search result list user focu document subject categori interest ad keyword inform displai search result list cut search compar displai inform includ keyword ad keyword inform displai search result list improv defin search term yield correct compar displai inform includ keyword ad keyword inform displai list search result improv feel compar displai inform includ keyword list subject document categori deriv word list topic document list keyword focu part subject earlier studi conduct number reason address user interfac studi present appendix method appli identifi subject document popular base manual document categori case scientif author specifi keyword digit team add list term relev articl index term acm digit librari staff add categori document directori addit manual accur system requir catalog extens bodi document includ document index catalog system organ network inform emploi combin technolog result queri network inform sourc automat organ document categori internet present absent specif sampl queri user relev priori render item relev irrelev relev irrelev reason frequenc occurr properti term complet document collect composit written grammat function word exhibit approxim equal frequenc occurr document collect function word high occurr frequenc ordinari text word fact relev document content tend occur greatli vari frequenc text collect frequenc occurr word import repres content conduct develop fulli autom softwar analyz text document chosen studi output set word document effect constitut subject document present topic program document text statist analysi determin word text analyz elimin stop list limit process linguist result list word meaningless term repres subject process bilingu document languag process statist element success process linguist element limit linguist process recogn languag inflect word filter mean special stop list specif languag figur program subject document relev word studi examin word offer accur definit subject queri search result list stop list data base text analysi statist analysi figur process document text analysi tabl present sampl result keyword search result list keyword limit linguist process studi determin extent document analysi perform reliabl defin chose set scientif document subject deriv directli keyword titl studi assum word titl keyword offer accur account content effici measur compar document subject defin document subject defin author titl keyword test includ analysi scientif document subject geographi famili studi appendix list journal articl cull altern valid data obtain assign person expert knowledg read articl valid assess word design reliabl determin subject rate word time articl number word case word word time case word rank list word time studi examin word word word list find subject categori analyz separ determin perform differ text subject categori tabl document subject categori keyword word document titl word identifi index term word ad includ list word find word show softwar identifi word document index term keyword identifi titl word identifi index term identifi keyword word identifi titl word word identifi index term word identifi geographi famili studi tabl summari identif rate text reflect keyword titl articl document subject categori famili word document index term word ad includ list ten word find word show identifi word document index term comparison word differ rate identif word word differ rate identif word compar word subject identif evalu word subject identif evalu word subject identif evalu word geographi famili studi tabl summari rate effect identif subject base list design automat identifi subject analyz result valid person expert knowledg read valid indic term identifi reliabl identifi subject articl tabl demonstr correctli identifi subject case word geographi famili studi identif rate declin attempt defin subject base word differ identif base word identif base word tabl studi investig length document influenc effect identif find subject geographi famili longer lower rate effect identif word document index term shortest geographi articl longest word averag word count tabl demonstr length articl affect rate identif titl index term shortest famili studi articl longest word averag word count tabl demonstr length articl affect rate identif titl index term number word document keyword identifi titl word identifi index term word identifi keyword identifi titl word identifi index term word identifi tabl summari identif rate base articl size tabl summari identif rate base articl size found earlier studi differ rate identif subject articl base word word studi sought identifi subject document minim number tabl demonstr rate identif subject base word word articl subject categori subject identif evalu word number word document keyword identifi titl word identifi index term word identifi keyword identifi titl word identifi index term word identifi subject identif evalu word gener manag industri manag geographi famili studi tabl summari identif rate subject articl base design tabl sampl result topic column list keyword automat gener column list origin document titl keyword row articl subject categori row articl subject categori famili studi gener keyword geographi australian volum journal paper issu publish labour parti polit contextu econom zealand minor voter grei explor experi australia compet john tourism mean visitor research cape travel resourc manag lau coastal sustain sampl document titl sampl document keyword develop comment relat part index australian social contextu zealand labour geographi australia journal publish zealand context labour polit social reform explor silent partner explor georg grei edward john australian histori social construct tourist place tourism place mean place promot social construct quantit assess cape area contrast approach manag common properti institut analysi develop strategi solomon island north queensland scotland island solomon island lau commun polici resourc manag sustain resourc base parent train behavior child program evalu famili children famili ethic scientist educ principl guidelin student child adopt parent mother score famili commun model public knowledg parent life research famili sibl fair farm conflict transfer agreement relationship guidelin evalu parent train program develop teach ethic principl guidelin famili scientist adjust adopt role matern famili scienc famili model commun partnership famili sibl conflict transfer farm tabl sampl result topic parent train program evalu model ethic educ ethic principl guidelin nation council famili relat ethic adjust adopt extern symptom famili commun marriag educ parent parent educ fair famili conflict famili farm farm transfer relat sibl relationship find lead word identifi softwar tool reliabl reflect subject document time expert opinion valid subject longer lower rate effect identif subject rate keyword identif slightli significantli rate identif word document titl practic document lack design document titl differ respect identif rate keyword word document case keyword identif rate differ type materi subject examin rate identif subject lower articl subject categori geographi articl articl subject categori famili studi benefici search engin user administr lack categori keyword locat regist autom tool summari recommend research studi examin autom softwar tool identifi subject displai document titl search result list softwar develop perform statist word text gener list word meant repres subject hundr scientif articl examin specif subject categori rate effect identif calcul word identifi conform keyword word titl length document influenc rate effect identif subject current studi challeng softwar develop rate success identif subject note comment improv softwar includ process meaningless word weight calcul attempt improv algorithm order refin perform area warrant studi abil defin subject document base word account specif terminolog collect articl studi homogen subject categori research larger collect subject categori acknowledg katz studi refer acm digit librari digit librari interfac exploit hierarch electron publish inform web search autom classif sixth intern world wide web bring order automat categor search result acm sigchi confer human factor comput system text element context displai search result inform retriev system inform door inform search hypertext link workshop held conjunct acm hypertext acm digit librari san improv displai search result inform retriev system studi technic report center research comput jerusalem benefit displai addit intern document inform textual search result european confer research advanc technolog digit librari septemb lnc frequent occur word identifi subject technic report center research comput school comput scienc hebrew reexamin cluster retriev annual intern confer august acm inform storag john system dynam tailor site map intern world wide web interfac tool librari congress nation digit librari program inform process turn yahoo automat web page european confer artifici intellig enhanc usabl text comput deliveri form project hypertext elli servic organ network inform acm digit librari acm automat text retriev inform searchenginewatch web document feasibl demonstr intern acm sigir confer research develop inform retriev dynam cluster interfac web search result appendix list journal articl studi geographi econom geographi journal geographi higher educ canadian geograph australian geograph famili studi famili relat journal marriag famili appendix user interfac
Agents/1629 1 collect robot applic base emerg fabric beat comput scienc pai group du muse switzerland abstract paper present collect robot consist make pool robot regroup object distribut environ innov aspect approach rest system integr autonom robot make global task achiev virtu emerg introduct work fit framework artifici intellig ai autonom agent concern collect phenomena issu carri solut system achiev global task virtu emerg work support type involv simul involv real robot paper present collect robot consist make pool autonom robot regroup object distribut environ paper organ section short overview state art autonom reader basic kei concept understand framework work section start introduc collect robot briefli present robot descript behavior implement robot section describ discuss result obtain section conclud paper autonom agent ai refer ai autonom agent intellig biolog featur notion refer enact intellig consid agent capac interact environ intern ai concern system exhibit autonom agent behav environ autonom agent consid embodi design fulfil intern extern goal action continu interact environ unpredict concern interact agent environ deal interact lead natur concept emerg behavior function emerg offer bridg necess complex adapt behavior macro level mechan multipl action micro level system behavior consid emerg descript categori describ behavior constitu compon steel add emerg behavior lead emerg function behavior contribut system system build autonomi autonom type autonomi commonli point oper autonomi behavior autonomi type idea automat autonomi distinct level design steel oper environ impact wai benefici agent task crucial exist franklin autonom agent system situat part environ environ act pursuit agenda effect futur oper autonomi defin capac oper human remot control behavior autonomi basi origin agent capac form adapt principl behavior freedom human freedom form principl behavior partli broad class design engin approach oper learn approach behavior autonomi engin approach base function decomposit control typic form finit state automaton commonli approach type subsumpt architectur learn approach consist endow agent learn capabl agent adapt behavior artifici neural inherit earlier gener agent embodi autonom agent embodi system form embodi instanc consid physic embodi agent interact environ mean sensori percept motor control robot form work consid simul embodi agent interact artifici environ simul robot form work deal system made physic embodi autonomi global function level base emerg khepera robot applic framework applic tackl common problem collect robot lot robot seek object distribut environ order regroup solv problem innov aspect approach rest system integr autonom robot system freedom act robot decid action basi strictli local privat system type master type cooper system fault toler work highli parallel fashion work relat work framework collect robot focu collect capabl system creat cluster object eventu singl cluster basi coordin robot major contribut work relat work li richer percept capabl endow robot abil area interest random move wast lot time collect robot khepera robot khepera miniatur cylindr robot develop epfl sa switzerland basic featur bit processor run energi autonomi half infrar sensor front robot refer left back refer wheel control dc motor ir sensor khepera evalu proxim obstacl basi reflect light obstacl evalu depend level ambient fulfil specif requir khepera endow gripper robot pick drop object vision modul focu term robot term agent becker al exploit coordin robot coordin mean liter work product ing imag line pixel pixel encod grai robot displai figur figur khepera robot gripper vision extens built environ squar meter plane surfac surround wall height cm environ recov white materi properti light reflect good object environ cylindr shape diamet cm height cm bottom object recov white plastic height rest recov black plastic structur environ limit sensor robot detect discrimin obstacl object robot made easier process inform return vision modul khepera find object black imag process inform ir sensor robot avoid obstacl object reach border environ follow border design implement famili control algorithm famili robot level global behavior coordin elementari seek object wander section pick object section reach border section follow border section drop object section figur displai set behavior primit relationship famili robot aim famili robot roam find pick drop close object border small limit behavior fact object locat close border outset robot drop object pick section object pick close border case object close solut resort human ensur object locat border environ prior drop object solut satisfactori concern expect task achiev fulli autonom fact robot act parallel system make human difficult tediou task solut consist conceiv famili robot charg ensur object close border system fulli autonom requir extern role famili close consist roam find pick drop border endow robot regularli drop object border seek object wander behavior figur seek object wander behavior implement endow khepera roam environ reach object roam khepera implement neural network coupl valu ir sensor speed wheel figur obstacl present side move object present move straight ahead wander primit typic activ period distanc cover khepera step figur distanc cover encount khepera opportun activ inhibit wander primit primit consist grab imag analyz order check object seek object wander pick object reach border follow border drop object figur behavior primit famili seek object wander pick object reach border drop object figur behavior primit famili rotat appli robot chanc find object imag line process iter maximum wander primit inhibit primit solut adopt avoid robot trap kind robot infinit achiev success rotat move depth view vision sensor robot cover partial environ case object present imag rotat angl calcul rotat appli order ensur optic axi robot intersect object environ rotat oper object stand front robot multipl object present imag strategi simpl strategi consist select object closest optic axi robot read ir valu stop move backward vision posit avoid obstacl wander obstacl figur seek object wander behavior robot detect obstacl front front immedi stop oper slight move backward backward scan imag line examin natur obstacl made robot stop obstacl pick robot align pick object condit activ pick object behavior obstacl border robot activ avoid obstacl primit move obstacl excitatori connect inhibitori connect basic speed robot wheel figur neural network khepera roam pick object behavior figur pick object behavior implement endow robot pick object behavior assum robot posit rel object pick robot lower arm arm check achiev optic barrier gripper object parasit robot arm activ primit obstacl avoid activ seek object wander behavior robot slightli move forward closer object forward close gripper grasp object gripper arm arm rotat reach border behavior activ presenc arm avoid obstacl move forward close gripper arm rotat lower arm figur pick object behavior reach border behavior figur reach border behavior implement endow robot carri object move border environ wander primit robot detect obstacl front front immedi stop oper slight move backward backward scan imag line examin natur obstacl made robot stop obstacl avoid object primit activ avoid object robot continu border robot rotat activ follow border behavior follow border behavior figur follow border behavior implement endow robot carri object follow border environ reach object robot move border ensur border wander primit convent arbitrarili decid read ir valu stop move backward vision move forward rotat avoid object wander obstacl figur reach border behavior read ir valu stop move backward vision move forward rotat wander rotat move forward obstacl obstacl obstacl figur follow border behavior robot follow wall side sensor side detect anymor rotat oper robot slight move forward forward robot border cover kind tooth trajectori procedur robot stai close border bound implicitli defin threshold appli valu ir sensor procedur reach border behavior reactiv move robot detect obstacl front front robot possibl follow wall side immedi stop oper slight move backward backward scan imag line examin natur obstacl made robot stop obstacl pick robot activ drop object behavior obstacl corner robot slightli move forward forward oper rotat order continu follow border environ side drop object behavior figur drop object behavior implement endow robot drop object behavior robot lower arm arm open gripper gripper arm arm make move object drop avoid immedi robot readi pick object reactiv seek object wander behavior lower arm open gripper arm figur drop object behavior result run numer experi object randomli distribut environ number robot rang case robot famili constraint satisfi ensur object locat border outset experi system start creat heap object close object limit instanc human access human influenc outcom system place object close border outset experi ensur heap object end experi order avoid drawback necessit human interven pool robot robot famili system fulli matter object close border environ outset object close border time pick robot famili regularli drop object close border object drop close border creat singl heap collect system build cluster object number robot perform system system exhibit emerg robot particip achiev global task object regroup object awar explicit cooper virtu design intern base oper autonomi robot encod specifi regroup object environ regroup locat shape object end regroup experi result robot interact result human experi robot illustr featur locat heap object determin advanc type posit system navig major advantag collect case applic place unknown partial unknown environ numer simul experi realiz swarm simul system quantifi perform system bet global task achiev examin control algorithm preempt manner achiev due determin system collect behavior system implicitli driven individu behavior robot speak behavior autonomi level system autonomi oper level present collect robot applic consist make pool autonom robot regroup object distribut environ innov aspect approach rest system integr autonom robot decid time action relat intern state supervisor system global task regroup encod explicitli environ repres robot exist explicit cooper protocol robot global task achiev virtu emerg advantag approach adapt fault robot ad remov system extent run sever troubl global task achiev emerg extern instanc perform till oper autonomi robot engin approach stage work consist studi behavior autonomi learn order adapt system point improv process percept visual inform vision discrimin larg heap object small heap object isol object instanc pick isol object object belong small drop larg heap task global behavior system converg faster desir achiev task object regroup advantag possibl regroup object environ close refer oe jl deneubourg local action global stigmergi collect robot ra brook fourth workshop artifici mit press base implicit cooper robot swarm intern confer autonom agent bonabeau theraulaz intellig collect ra brook robust layer control system mobil robot ieee robot ra brook intellig reason courant statist issu world cybernet informat intern confer inform system analysi synthesi juli august courant conflict simpl multiag system workshop agent juli floreano mondada evolut plastic neurocontrol situat agent anim animat ja wilson mit press forrest emerg collect cooper phenomena natur artifici comput network physica franklin graesser agent taxonomi autonom agent jp mj nr workshop intellig agent iii agent number page august gaussier constructivist approach autonom agent thalmann artifici life virtual page john wilei son jc deneubourg al dynam collect ant robot ja mayer sw simul adapt anim page mit lp ml aw moor reinforc survei artifici intellig swarm simul toolkit build simul technic santa fe courant poster artifici life mae artifici intellig fifteenth annual meet cognit scienc page lawrenc erlbaum mondada collect cooper group biolog inspir experi robot fourth symposium robot june juli mondada probabilist model collect experi real robot intern symposium distribut autonom robot system mj matar minim complex control mobil robot popul intern confer robot lo ieee comput societi press mj matar integr robot steel artifici life rout artifici intellig build situat page lawrenc mj matar local interact collect intellig biologi technolog intellig autonom page nato asi fj varela tree biolog root human understand scienc mobil robot tool investig control algorithm octob experi compet acquisit autonom mobil robot phd pfeifer build design principl autonom agent fourth intern confer simul adapt volum anim mit book steel robot intellig autonom robot autonom steel brook artifici life rout artifici intellig build situat agent lawrenc rs sutton ag barto learn comput foundat adapt chapter model reinforc gabriel fj rosch embodi cognit scienc human experi mit adapt behavior autonom agent autonom adapt behavior distribut simul
AI/1630 2 achiev robust commun susan mcroi depart electr engin comput scienc depart mathemat scienc wi novemb abstract paper describ comput approach robust interact approach reli declar content structur interact comput system build interact show system recogn repair misunderstand human comput demonstr util show facilit repair process introduct dialog peopl peopl understand uncertain process goal belief particip interpret event dialog believ complet interpret intend analyst misunderstand occur particip misunderstand problem manifest interact particip circumv misunderstand plan action carefulli correct appar misconcept clarifi potenti ambigu predomin approach particip belief goal differ imposs prevent misunderstand peopl recogn commun broken particip reli judgment understood misunderstand fulli particip continu commun detect repair problem particip notic anomali attribut misunderstand particip interrupt dialog initi repair misunderstand particip access refer gener notion commun continu number action particip refer subclass interact necessarili restrict speech intern dialog evalu reason action mcroi construct earlier interpret paper describ comput commun support flexibl coher dialog incorpor collabor tutor call medic student practic skill receiv natur languag explan complex statist relationship primari modal interact natur modal support particip dialog make gener request action initi repair action ambigu context dialog student tutor system student system question ct test rule medic case follow support robust dialog case unexpect dialog system explain student decid restor coher model produc explan requir system make assumpt particip believ explan part system understand dialog knowledg serv basi system reason includ inform ct stand comput diagnost test stand test languag languag fact inform content structur prior framework repres inform mix level abstract detail inform repres compon concept relev level task hand framework integr inform sourc captur vagu ambigu present utter form design model work build mcroi hirst previou work recognit repair speech act misunderstand project mcroi mcroi work unifi theori repair combin intent social account interact constrain amount reason identifi plausibl interpret develop common lisp program languag analog tool creat underli knowledg domain inform shapiro shapiro develop state york network process tool build reason node proposit semant network defin semant network graphic develop java program languag run network netscap interfac user commun program initi lisp process bayesian network softwar execut lisp foreign focu paper describ intern dialog construct tutor system show facilit reason understand misunderstand problem scope section begin review previou approach misunderstand section introduc kind inform section describ account coher dialog section explain model construct dialog paper conclud section background previou work interact aspect interpret gener typic understand treat gener plan place grammar rule lambert limit applic approach interact fit plan flexibl commun peopl ffl user attent aspect present system expect url site server program run ffl user understand verbal descript graphic imag meant convei ffl user lack requisit knowledg domain interpret explan model includ action particip infer action evid misunderstand explan system user comput system includ inform misunderstand intend interpret deal potenti altern prevent system focu process interpret avoid extend approach mcroi hirst combin intent social account captur expect constrain requir extend infer plan intent speaker expect decid interpret speaker identifi goal account process speaker goal achiev sociolog account provid interact resolut misunderstand normal activ guid social convent convent includ expect sequenc approach extend intent account expect deriv social convent guid interpret requir reason mutual belief multipl level avoid mutual belief form infer requir approach prototyp system implement framework default abduct reason system includ axiomat mcroi hirst theori expect action understood misunderstand lead unexpect action utter specif theori discuss section form basi current action explain manifest misunderstand prior plausibl reason misunderstand occur system build model dialog commun model includ speech act interpret system gave utter produc includ tempor order relat speech belief speech act express model enabl system form expect type speech act expect occur model enabl system detect inconsist belief express dialog resolv inconsist provid interpret previou utter prototyp simul involv detect correct misunderstand occur discuss literatur version system talk initi belief work demonstr util combin multipl sourc prototyp implement ineffici practic repres semant inform account misunderstand word inform work attempt address shortcom repres work work unifi theori interact address extend pure intent approach approach formul knowledg recip akin strip oper fike precondit constraint true action effect goal action previou approach litman lambert carberri interpret recogn find relat link utter previou context utter coher seek gain inform state constraint variat domain plan introduc action manag interact system dialog consist structur includ instanti plan recip mean relat precondit utter made particip valu instanti recip includ specif instanc action complex mutual belief goal al extend algorithm misunderstand recogn system fail find relat failur action result subgoal post resolv repair action perform satisfi goal comparison mcroi action post goal find altern place theorem prover attempt prove altern effect question speaker hearer mutual speaker commun intent express speaker goal hearer adopt goal answer question exist strength pure approach uniform domain inform avail algorithm work al account type includ ambigu pragmat primari weak provid explicit account constraint focu search emb control structur algorithm domain number effort identifi minim design model flexibl base model approach mcroi hirst address uniform effici repres knowledg semant network discuss section kind inform model inform repres system model combin inform level action perform interpret user utter dialogu shown figur test rule ct figur dialogu system medic student dialogu lead assert number proposit system interpret action relat prior exchang knowledg includ fact gloss shown figur system test rule student system system ct student system interpret system test rule student answer test rule system disconfirm test rule system inform ct test rule student ct test rule relat interpret interpret interpret interpret interpret accept accept accept justifi figur proposit ad model model interpret student utter gener system user produc parser gener surfac content form attitud model build interpret utter captur complet proposit content relationship model specifi particip express believ model system greater flexibl previou explan enabl system judg ffl student understood question produc evalu answer ffl student reject question question ffl student question produc analyz determin repair misunderstand student answer utter good indic question respond patient indic feel inform medic case correct answer determin system gener model augment includ relat system output produc answer question respond request model level shown figur utter level repres linguist graphic form commun user system utter sequenc level repres tempor order utter interpret level repres commun role utter achiev domain plan invok exchang level repres relationship determin commun act accept understood exchang repres accept failur exchang exchang system interpret utter sequenc utter utter level interpret exchang figur level level captur content express student relat link action ongo system give question request procedur oper queri system recov misunderstand model includ type commun includ statement fact languag system repres domain knowledg knowledg uniform framework proposit semant network proposit semant network framework repres concept cognit agent languag term inform repres graph node label direct arc proposit semant proposit repres arc repres binari relat node semant network framework shapiro analog framework addit node repres uniqu concept concept repres network repres uniqu node knowledg repres concept repres structur entir network connect node repres concept constraint effici infer process natur languag network repres complex descript medic support resolut ellipsi gener reason task concept subsumpt shapiro shapiro proposit express case frame case frame set arc eman node express isa case node member arc class arc dictionari dictionari standard case frame semant network addit case frame defin knowledg assert mechan proposit believ cognit agent implement system node repres descript includ user utter system decid accept inform credibl basi infer assert node treat concept belief network point node believ result infer perform import advantag uniform domain probabilist knowledg bayesian repres knowledg base infer process uniform facilit interact process task domain level level model start utter shown bottom figur achiev robust understand detail knowledg ali mcroi utter level parser produc surfac system add model part occurr event type describ syntact structur utter semant inform grammar broad linguist coverag winograd accommod varieti structur peopl varieti domain grammar build utter ambigu utter requir extens reason domain model fulli system avoid unnecessari infer produc shallow deep depend time creat hirst matter shallow surfac syntact text string deep convent ai knowledg account aspect languag understand lexic mark case attach modifi uncertain refer quantifi distinguish descript noun phrase unlik primarili storag subject logic infer reason deeper semant analysi make occur interpret phase system add addit annot account refer express system recogn stori refer descript medic underspecifi mean relat system recogn possess relat patient arm refer patient utter content user utter repres liter medic tutor student request stori problem imper sentenc declar sentenc express desir figur includ exampl imper declar interrog interrog sentenc syntact object move stori figur stori figur figur figur shown figur squar node correspond potenti round node proposit concept node entiti utter node case frame repres structur includ syntact form mental attitud express content repres node node proposit hearer perform action node node type object action indirect object action node repres attitud term content sentenc describ mental state state affair event attitud mean main verb entiti express noun phrase subject impli object direct object node case frame noun phrase express pronoun attach node syntact case frame express semant case frame express entiti member class stori arc mark lex word speaker word discrimin achiev attach addit inform entiti interpret medic attitud form utter imper action content agent act object lex pronoun action member class lex np det lex member object pronoun lex class lex figur node repres utter form content proposit hearer stori speaker pronoun lex object member lex class np det lex attitud content decl form utter desir lex act agent pronoun object action member class lex object pronoun lex utter compl form attitud action content agent act action member lex class figur node repres utter form declar content speaker hearer stori speaker lex member attitud content form utter int object pronoun object object properti lex class member class lex figur node repres utter form interrog content proposit object design queri type test attitud action content form utter int lex agent lex class member object action act object object pronoun lex figur node repres utter form interrog content proposit detect object design sequenc utter level correspond sequenc utter level compar linguist structur model grosz semant repres sequenc utter assert proposit case frame order utter occur determin structur test rule case test rule ct test rule figur sequenc utter dialog shown figur shown figur figur assert proposit node repres event utter node assert user assert node encod order utter node assert event user occur system test rule proposit express written ital repres subgraph semant network gloss reason space act agent agent agent agent act act act lex system action user lex lex action action action figur node repres sequenc utter produc system shown figur node repres proposit event immedi event interpret level repres system interpret utter utter event level system repres interpret case frame interpret utter shown figur network utter interpret request system describ case user system distinguish multipl interpret believ correct build case frame assert believ chang belief repres assert knowledg framework incorpor truth mainten system deal agent act lex lex action agent act lex action member class lex interpret lex figur node proposit interpret stori gloss node proposit user request system describ case user case pronoun utter level interpret exchang exchang interpret level fourth level model exchang interpret exchang pair interpret event fit convent structur dialog relat notion adjac pair exchang sequenc utter exchang nest defer answer question clarifi question figur test rule ultrasound ultrasound ct figur pair nest exchang system knowledg includ specif structur cue recogn exchang interpret indic understood indic abandon understood case repair system step back histori exchang identifi misunderstand discuss section utter interpret complet open exchang start evid failur understand figur network exchang interpret node repres exchang system question user answer determin type action type node case proposit node assert node exchang proposit node repres system interpret user accept system question user understood question requir proposit node repres system belief node interpret exchang repres node lex action exchang lex member system user lex lex lex answer class agent act lex accept action action act agent act agent interpret figur node repres proposit node exchang event proposit user answer test rule node repres proposit interpret event proposit user accept question system event interact level advantag network knowledg share level term knowledg share associ occur uniform concept repres uniqu node retriev make inform repres network arc connect proposit node system explain user follow link node figur system interpret node figur determin ffl user utter understood answer exchang ffl user answer accept understand point explain system believ user understood system question associ network vital interact start system reassess interpret user previou utter belief user interpret system utter account coher dialog model repres system interpret occur interact user system possibl belief automat belief make basi interpret context prior belief withdrawn face contradictori evid mcroi hirst provid comput theori coher dialog account factor social expect linguist inform link act belief mental intent action consist belief express consist belief express prior action factor enabl system distinguish action fulli expect incorrect answer clarif action indic misunderstand core theori includ gener schema interpret exchang relationship schema appli dialog dialog particip share act actor definit schema assum model subject perspect dialog particip definit term system assum system understand dialog assum system initi definit appli user initi plan adopt plan system begin exchang utter count coher attempt initi exchang ffl action system user definit appli user point interpret differ system misunderstand mcroi discuss show result copi system commun ffl action expect utter addit coher constraint belief express system utter express user consist belief express system test rule plan question creat expect answer plan adopt student make request system system accept user continu exchang affirm previou utter role context provid answer question legitim question displai user understand action count accept action creat expect addit constraint belief express actor consist express accept student respond test rule dont user utter explain system manifest misunderstand user user utter manifest deriv express belief model process refin minim includ discuss displai altern interpret earlier utter system displai accept lead repair figur utter manifest user misunderstand system system expect answer patient user utter make refer express neg ultrasound replac ultrasound user action explain result misunderstand system action count sign system ffl user action inconsist belief express earlier utter ffl prior utter altern interpret render user action consist lead system produc repair figur system belief silent figur system interpret utter indic expect user acknowledg question accept answer utter repair system initi repair perform user repair misunderstand user addit constraint fulfil system origin intent probabl neg ultrasound ultrasound probabl neg test figur repair repair shown figur system user appar neg ultrasound posit attempt recov salient term repair system initi repair misunderstand system addit constraint fulfil user origin intent terminolog repair repair turn count locat problemat turn repair initi actor produc demonstr repair initi actor misunderstand action perform produc receiv feedback troubl earlier note particip perspect problem repair particip trigger repair interpret event slightli view turn repair initi repair shown figur user request explan system interpret request explain result respect current includ probabl relationship user reject gener includ underli utter recogn utter produc type explan posit suggest case mr probabl posit test result probabl reason detect figur dialog illustr repair schema guid construct upper level model facilit reason schema system repres inform network provid mechan reason inform effici shown figur greater detail figur illustr utter exchang level result start top system user probabl relat system user causal relat probabl posit result case mr probabl user request system explain relat posit suggest user request system explain causal relat exchang lex interpret interpret detect user request repair altern interpret earlier interpret member class class member interpret interpret figur figur show gloss utter level utter gloss interpret level dialog repair ffl node repres sequenc relat hold utter row box gloss subnetwork utter similar discuss section system produc simplist natur languag output shown work improv text plan part system sequenc node construct utter level produc parser ffl node repres interpret utter time row box gloss subnetwork similar discuss section interpret correspond speaker action domain interpret deriv utter basi linguist social plan deriv interpret system reason user unspecifi relat concept bayesian interpret request system perform action node interpret system find terminolog previou explain case explain utter act accept interpret ffl node identifi exchang structur utter origin exchang structur utter repair node recogn accept node complet exchang proposit exchang exchang structur system step back structur reason altern interpret exchang structur speaker displai understand previou utter utter sequenc provid inform exchang nest insid clarifi interpret begin exchang complet open determin linguist form expect creat previou system fail find domain plan request displai part plan request clarifi previou utter answer question consid evid failur surfac form utter suggest back altern domain plan find utter admit altern altern domain interpret result repair action system accept altern domain system form interpret utter case subsequ user provid inform result dialog process detail network proposit content utter produc system role system belief understood system explain produc utter recov situat commun fail system user flexibl initi task follow misunderstand system examin evid provid user action sequenc verifi understand occur system abil deviat plan sequenc action address appar failur consid approach robust interact reli declar content structur interact includ ffl utter level repres linguist graphic form commun user system ffl utter sequenc level repres tempor order utter ffl interpret level repres commun role utter achiev domain plan invok ffl exchang level repres relationship determin commun act accept understood ffl exchang repres accept failur exchang structur grow aspect made tractabl interact system knowledg share associ structur level occur uniform concept repres uniqu node retriev make inform repres network arc connect proposit node system defer build elabor interpret inform readili build interact system recogn repair record invok plan evid success reevalu evid light possibl contradictori observ construct facilit framework repres inform network provid mechan reason inform effici acknowledg due susan sy ali contribut work comment paper hirst contribut work work support nation scienc refer ali sy susan susan dialog process submit public sy ali logic languag natur languag process biennial canadian artifici intellig page sy ali natur languag process knowledg phd state york comput januari jame allen recogn intent natur languag utter michael robert jame comput model page mit guido model misunderstand cooper dialogu intern journal randal util user model handl ambigu misconcept robust plan recognit user model sandra carberri plan recognit natur languag dialogu mit sandra carberri approach flexibl plan recognit dialogu user model fike fike nil nilsson approach applic theorem prove problem solv artifici bradlei goodman repair refer identif failur relax annual meet associ comput page grosz grosz sidner structur comput elizabeth ann linguist pragmat constraint utter interpret phd depart comput publish rochest comput scienc technic report hirst hirst mark ryan natur languag text paul intellig system lawrenc erlbaum lambert lynn lambert sandra carberri model dialogu annual meet associ comput page dian litman linguist altern annual meet associ comput page shapiro concept proposit semant network cognit reprint brachman ed read knowledg morgan lo kathleen role perspect respond properti misconcept ninth intern joint confer artifici volum page mcroi susan mcroi hirst abduct explan dialogu misunderstand confer european chapter associ comput page mcroi susan mcroi hirst repair speech act misunderstand abduct infer comput decemb mcroi susan mcroi hirst repair speech act misunderstand abduct infer comput decemb mcroi susan susan sy ali uniform knowledg nlp system journal natur languag susan mcroi abduct interpret reinterpret natur languag utter phd depart comput technic report depart comput scienc susan mcroi misunderstand negoti mean susan mcroi misunderstand negoti mean david karen ward mutual belief multipl comput model collabor air traffic control nation confer artifici intellig harvei sack open close repair structur provid american journal shapiro stuart shapiro implement group user manual depart comput suni shapiro shapiro consid fulli proposit semant network cercon knowledg page shapiro stuart shapiro william famili comput mathemat shapiro stuart william susan jason kumar dictionari case terri winograd languag cognit volum syntax zukerman avoid concept explan annual confer cognit scienc page
AI/1631 2 small robot team manuela peter comput scienc depart carnegi mellon pa robot world cup soccer game kitano springer berlin abstract robot soccer challeng research domain involv multipl agent collabor adversari environ achiev specif object describ team small robot agent develop enter competit design built robot vision develop implement algorithm strateg collabor robot uncertain dynam environ robot organ hold specif pursu goal game demonstr collabor behavior multipl occas robot switch role maxim perform team present overview vision process algorithm successfulli track multipl move object predict trajectori paper focuss agent behavior rang individu behavior strateg team behavior cmunit won competit japan introduct robot adept oper real issu collabor adversari plan learn situat import interest emerg domain studi issu robot activ pursu robocup initi realist simul environ exist import physic robot agent order address full complex task robot soccer real robot challeng domain reason natur domain necessit coupl quick behav make behavior make process rang simpl reactiv move directli arbitrarili complex reason procedur account action perceiv strategi teammat oppon innov techniqu abound advantag robot soccer enabl direct comparison match competit system design specif robot team compet plai scientif opportun involv effort enorm scientif focu multiag system coupl collabor adversari learn environ requir dynam plan paper describ architectur robot soccer system combin robust intellig control repres challeng successfulli meet work paper fulli implement robocup team won competit japan team score total thirteen goal suffer figur show pictur robot agent fig robot team compet specif contribut robot present complet design develop robot robust navig commun hardwar reliabl percept extens filter vision process algorithm track multipl move predict object inevit sharp trajectori occur multiag strateg reason collabor robot achiev flexibl approach task space agent assign flexibl team structur agent organ homogen agent flexibl switch role agent switch format altern plan collabor pass control metric evalu architectur architectur system address combin lowlevel reason view system combin vision camera plai field connect central interfac client mind robot player figur sketch build block architectur transmit interfac client modul client modul client modul client modul client modul raw vision data action code action code object posit fig architectur global percept distribut reaction complet system fulli autonom consist challeng process cycl global vision algorithm perceiv dynam environ process give posit robot ball inform control distribut agent algorithm agent evalu world state strateg knowledg decid action motion command control radio commun command broadcast directli individu agent robot identif binari code detect command intend robot fact percept achiev video camera complet field offer opportun global view world state setup simplifi share inform multipl present challeng reliabl process movement multipl move object agent agent team section robot built dc motor magnet encod speed valu obtain special motion control processor control robot equip radio data exchang process unit wireless commun link enabl send receiv data robot speed interest characterist robot core electron separ frame robot dimens limit size circuit actual total length depend frame limit size wheel motor size base frame elong frame wide frame lb base frame configur final extern frame frame articul edg made perfor steel strip sheet flexibl frame structur easi access compon easi variat function robot robot weight made batteri pack onboard electron includ memori byte kbyte fm mhz radio dimens circuit board adapt fit shape size main frame smaller board stack insid main make incorpor compon requir creat command server handl command individu robot reason process radio control processor connect server comput serial link individu network machin commun robot server comput command server role collect translat command send radio control processor percept multipl agent vision requir robot soccer examin research system type recent year found reactiv soccer robot requir vision system high process cycl time due rich visual research found dedic processor dsp transfer camera pentium processor dedic vision process detect robocup rule defin color object field major cue object detect color base teammat oppon identifi blue yellow circl add addit pink patch robot determin teammat orient ball orang golf ball figur inher vision system detect current system magnitud spuriou detect frame system elimin detect method color patch size match robot discard techniqu filter data associ detect elimin data associ detect algorithm return unord list robot frame control system associ detect robot field robot identif robot fit color top attempt made differenti color hue experi shown order differenti robot significantli hue rule robocup game elimin green white orang blue yellow list possibl inevit variat light condit area field system make detect scheme impract robot fit robot team ident visual system data associ address problem retain robot identif subsequ frame algorithm retain associ base spatial locat robot assum start posit robot trivial locat robot start time subsequ frame locat robot chang due robot movement control action adversari associ achiev make complementari robot displac consecut frame vision system detect object constant frame rate measur maximum robot subsequ robot move radiu circular region knowledg basi associ techniqu assumpt provid basi minimum distanc scheme retain associ consecut frame consecut associ maintain search object minimum displac current robot posit match closest posit previou frame greedi algorithm search smallest distanc pair upward match pair greedili accept match pair due detect system leav robot undetect number robot detect past frame larger number robot current frame greedi match remain unmatch posit past frame carri current frame robot unmatch locat assum stationari note miss rate detect algorithm high minimum distanc associ techniqu easili lose robot greedi algorithm show reliabl combin accur robust vision detect system track predict set robot soccer abil detect locat object field real soccer essenti robot predict futur locat ball extend filter ball movement predict ekf estim possibl system involv iter updat propag current estim system state error covari comput iter updat current observ refin current estim recomput covari propag state covari system time step calcul system equat process altern updat propag step captur ball state ball ball veloc direct friction paramet surfac system repres differ equat model ball simpl friction term discount veloc time size predict equat ff kn ff kn ff kn ae predict equat deriv solv equat obtain substitut interest predict spatial locat ball explicitli calcul predict veloc care adjust filter paramet model achiev success track predict ball sharp bounc occur vision process approach work perfectli game detect track object oppon predict provid ekf goalkeep ahead time predict defend posit goal suffer due predict ball posit multiag strategi control achiev multiag strategi combin accur individu collabor behavior agent reason persist reactiv behavior develop aim reach team object behavior order successfulli agent requir robust basic skill skill includ abil gener path abil handl direct ball intercept move ball skill execut avoid obstacl wall robot path gener path plan problem address algorithm deal static world gener global path robot soccer domain inher dynam time high world dynam includ robot make map path ineffect unnecessari implement reactiv control deal dynam recov noisi command execut reactiv control gener due local minima introduc failur recoveri routin handl failur navig movement control robot reactiv control control rule inspir vehicl love vehicl defin reactiv control mechan direct robot target similar behavior requir love vehicl control mechan simplist start converg goal slowli modifi set reactiv control formula effect adjust control ae sin fi fi desir translat rotat direct target rel robot fi rotat ff fi base translat rotat translat rotat veloc translat differenti drive paramet invert linear transform set control formula differ love vehicl account orient robot respect target explicitli add rotat control set control rule implicitli head control rule forward backward whichev effici execut figur show actual run reactiv control algorithm fig sampl trace execut reactiv control algorithm target point mark cross ball handl robot accur direct ball target approach ball direct ball predict vision robot aim point side target posit robot equip method ball move ball target ball wait ball cross path intercept move ball target ball collect robot consid line target posit ball current predict depend ball move robot plan path point line ball hit ball end face target posit robot target figur illustr behavior ball intercept behavior robot consid line target posit determin ball path intersect line robot posit line point intersect time ball arriv robot ball handl routin base ball eventu cross path point robot intercept goal robot ball intercept ball collect robot ball line line intermedi target final ball target line line ball robot final ball target point intercept predict target intermedi fig behavior enabl team collabor ball collect pass ball intercept ball aim ball predict locat fix time futur eventu posit place intercept ball target obstacl avoid robot soccer obstacl robot goal locat robot avoid plan path obstacl due highli dynam natur obstacl avoid algorithm control robot continu replan goal posit obstacl event obstacl block direct path goal robot aim side obstacl posit move directli origin goal plan entir path goal locat robot ahead obstacl assumpt robot continu move reactiv control robot continu reevalu target posit figur robot start straight final target line line robot intermedi target final robot target obstacl fig obstacl avoid dynam gener intermedi target obstacl distanc line aim intermedi target slightli obstacl robot obstacl short edg field reactiv robot continu recomput line obstacl longer path aim addit intermedi target obtain path final target obstacl avoid robot stuck robot wall oppon robot obstacl inevit unabl robot identifi sourc problem closest obstacl move normal control resum multiag behavior behavior effect singl robot robot simultan chase ball shoot chao result order achiev coordin multiag organ robot flexibl team structur team defin set posit behavior robot dynam map posit robot equip knowledg requir plai posit format posit area field robot move default situat activ mode determin robot move ball robot ball shoot pass teammat pass evalu function multiag behavior origin develop simul transfer code pass evalu function redefin flexibl team activ mode posit defin flexibl region player attempt move ball robot plai posit remain side field oppon goal ball posit classifi forward base locat region behavior specif term posit consid potenti time robot plai posit field robot knowledg plai posit robot posit fly robot switch posit robot chase ball region robot robot continu chase robot move posit vacat posit player collect commonli format collect posit consist attack format consist defend attack figur fig defin format notic posit format case robot switch format base condit team lose time left robot switch format format condit switch posit format decid call order elimin complex negoti protocol default action robot posit face activ mode robot default behavior occur robot inact state ball robot activ state activ robot move attempt pass teammat shoot goal base evalu function account teammat oppon posit robot intend receiv pass move auxiliari state intercept move ball goal current function set robot closest ball activ intend receiv robot auxiliari robot inact state evalu collabor opportun main featur robot abil collabor pass ball activ robot evalu function account teammat oppon posit determin pass ball shoot part format posit set posit consid pass defend pass forward forward pass backward midfield defend posit occupi robot evalu pass posit evalu shot evalu robot comput line segment ball receiv shoot ball figur case line segment consid pass shot product relev robot pass shoot multipli valu factor determin rel proxim activ robot potenti receiv goal robot pass shot maximum line segment comput algorithm correspond figur oppon comput distanc distanc ls end ball kick robot figur defin constant oppon farther consid discount distanc consid larger figur oppon goal evalu actual distanc ball reason distanc oppon time block extra distanc longer return reflect easili oppon intercept pass subsequ shot closer oppon line farther chanc intercept ball goalkeep goalkeep robot special hardwar special softwar switch posit activ mode goalkeep physic frame distinct robot long rule block goal goalkeep role prevent ball enter goal stai parallel close aim directli ball coordin field simpli stai ball ball past goalkeep robot fast ball defeat behavior goalkeep continu monitor ball trajectori case move line line line oppon ball robot teammat fig pass evalu base posit oppon ball predict destin point ahead time move predict ball posit crucial illustr figur goalkeep robot account predict veloc direct ball select move ball fast slow ball fig goalkeep discuss successfulli demonstr feasibl effect team multiag robot system major challeng integr rang percept strateg multiag reason cmunit fulli implement multiag system loop close implement interest strateg includ agent collabor evalu altern action gener difficult accumul scientif result test team robot extend run prohibit batteri limit difficulti robot oper concurr resourc build singl team spare offer restrict evalu cmunit base result effect game plai includ anecdot evid multiag capabl robot soccer team tabl show result game oppon score institut scienc japan pari vi franc spain japan total tabl score cmunit game small robot leagu won game score thirteen goal score cmunit goalkeep attack situat franc refin goalkeep goal present observ goalkeep error match spectat notic team behavior paper robot switch posit success pass impress goal tournament result pass robot pass robot pass back robot robot pass robot shot ball goal robot behavior visual appeal entertain spectat peopl attain appreci difficulti task control singl robot joystick program develop peopl children found difficult maneuv singl robot direct ball open goal peopl impress facil robot autonom defend awar issu open research develop systemat identifi address team version plan enhanc robot behavior machin learn techniqu develop techniqu accumul analyz real robot data acknowledg research sponsor part advanc research project agenc rome air forc materiel agreement number part depart offic naval research contract number view document author interpret necessarili repres offici polici express air depart offic naval research unit state govern refer minoru alexi maja peter hiroaki kitano robocup physic agent appli artifici intellig minoru hosoda behavior acquisit real robot reinforc learn machin vehicl experi synthet psycholog mit motion plan dynam environ han manuela veloso physic model base track predict work note aaai fall symposium mit hiroaki itsuki minoru hitoshi osawa challeng problem ai ai spring hiroaki milind peter manuela hitoshi itsuki minoru asada robocup synthet agent challeng fifteenth intern joint confer artifici san morgan kaufman latomb robot motion plan kluwer academ mackworth robot basu comput page world scientif itsuki noda soccer server simul robocup ai symposium page societi decemb michael intellig behaviour dynam robot master british michael alan rod stewart control robot testb ieee intern confer page randi bill carl ann wright dynam object captur fast vision track ai spring peter stone manuela veloso simul team robot world cup soccer game confer springer volum articl process macro packag llnc style
ML/1632 6 learn improv plan effici qualiti report artifici intellig laboratori texa austin tx copyright learn improv plan effici qualiti bs dissert present faculti graduat school texa austin partial fulfil requir doctor philosophi texa austin learn improv plan effici qualiti approv dissert raymond moonei benjamin kuiper miikkulainen steven minton bruce porter give belief accomplish set mind acknowledg peopl support contribut research rai guidanc time graduat student work rai continu learn experi point direct grate advic teach member includ bruce ben miikkulainen steve minton suggest comment give special david david encourag consid phd david listen concern question provid support time brought back realiti lost worri thing peopl offic mate colleagu year miss enjoi countless offic dan john jeff paul gui time made laugh begin stuck taylor didnt bad special john zell start research path provid advic friend colleagu offer support distract break mari elain andrea charl lanc colleagu depart made research id mention ai group washington prodigi group carnegi mellon provid code inspir research research support nasa graduat student research grant vi texa austin vii learn improv plan effici qualiti technic report phd texa raymond moonei artifici intellig plan system import tool autom wide varieti task current plan algorithm suffer major problem requir amount comput time solv problem domain return solut plan fact return solut address problem provid plan system control guid planner search path machin learn techniqu enabl plan system automat acquir knowledg applic amount plan learn research devot acquir rule improv plan speedup learn work learn knowledg improv qualiti essenti featur plan system research acquir control knowledg improv metric learn system present call uniqu approach learn control knowledg plan scope learn control rule planner improv plan effici plan system learn control knowledg plan scope architectur integr learn techniqu induct logic program ebl constrain induct search control heurist planner compet plan refin scope flexibl train learn algorithm easili prefer search path evalu metric scope extens test plan includ logist transport domain product manufactur domain shown significantli improv plan effici qualiti shown robust compet approach viii content acknowledg vi abstract viii chapter introduct acquir plan control knowledg control knowledg acquisit system organ dissert summari chapter background plan method plan problem search method plan evalu metric summari chapter learn plan control knowledg ebl induct gener induct method induct logic program ilp control learn summari chapter learn control plan planner planner quantif algorithm prolog plan point control rule format summari ix chapter scope learn system analysi control rule induct foil scope build control rule proof tree type program special phase pure induct learn control rule pure ebl learn control rule improv plan metric improv learn time cach relat increment train summari chapter evalu improv effici plan length domain descript scope improv effici plan length design result scalabl train simpl problem train harder problem ablat result learn time summari chapter evalu improv effici plan cost domain descript plan qualiti process plan domain scope improv effici plan cost design effici result qualiti result learn time summari chapter evalu improv effici design effici result qualiti result summari chapter relat work learn control problem solv learn control planner perform system appli planner system appli planner system appli decomposit planner learn control plan qualiti chapter futur work enhanc scope algorithm construct induct share concept learn point evalu control rule util induct bia emploi failur inform evalu appli scope plan system chapter appendix domain definit domain version domain logist transport domain process plan domain process plan oper process plan axiom process plan function appendix learn control rule bibliographi xi chapter introduct plan ubiquit integr part dai life plan groceri dog walk small task simpl drive restaur larger task extens complic plan instanc build requir set long detail plan correctli plan import role workplac varieti task build piec machineri design effici deliveri rout time effort requir construct correct effici plan problem human hour spent process artifici intellig plan system provid autom plan task set ai planner gener search list relev domain action correct list action found achiev desir goal system save countless hour quickli construct step perform task construct optim plan perform task manner import manufactur plan build machineri minim type resourc consumpt import packag deliveri servic design deliveri rout deliveri packag plan construct plan wai plan pass human oper carri step option give plan comput execut agent perform task human plan system power popular tool perform rang manufactur semiconductor clean schedul antenna commun orbit spacecraft desir autom grow preval todai effici intellig plan system grow acquir plan control knowledg research introduc numer approach plan test util varieti toi domain newest plan algorithm suffer major drawback requir larg amount tion solv simpl problem tractabl handl realist problem algorithm return return solut plan problem return optim solut critic import return solut quickli address problem provid planner amount extra knowledg domain addit domain inform term planner achiev goal control knowledg repres form rule heurist easili util planner control rule inform action ad achiev order problem goal examin simpl plan problem shown figur logist transport domain creat veloso packag deliv locat citi packag transport citi airplan citi truck figur packag transport austin airport chicago airport solut problem shown figur problem figur planner perform unnecessari search arriv solut achiev planner ad action continu search path final fail truck deliveri avoid unnecessari control rule shown figur util rule check goal locat packag chicago current packag locat austin citi condit found control rule direct planner select action rule expand check benefici check goal locat airport rule appli domain situat control rule shown figur normal correct planner oper planner return correct plan time plan exist control knowledg address drawback mention control rule planner avoid search direct search path earli plan process rule shown figur type knowledg rule direct planner optim solut figur plan satisfactori plan requir fewer step control rule ad direct planner find plan find plan addit control planner unabl produc solut reason amount solut produc consid low qualiti control rule import compon plan system construct control rule domain labori task acquir rule consult domain expert acquir domain inform expert code inform form usabl planner hard imposs task problem form figur problem logist transport domain problem specifi problem initi state side list goal achiev goal problem packag move austin airport chicago airport figur plan problem shown figur oper figur simpl control rule logist transport domain rule direct planner action object airplan plane locat current goal object locat loc true xs locat current world state citi goal locat expert easili relai inform construct good inform inform form plan control rule difficult expert easili access domain work time domain appli planner acquir set control rule research plan machin learn attempt address problem acquir usabl control knowledg develop method automat build rule domain examin past plan learn system construct control heurist planner perform futur problem past number learn system built learn control knowledg plan system rare plan system promin todai reason past learn system design learn control rule planner plan older method plan infrequ planner common current style plan shown effect plan domain kambhampati past learn appli planner due relianc approach reason learn system arent major concentr improv planner speedup learn import goal improv qualiti final plan qualiti plan refer measur predefin metric measur plan qualiti number step plan optim plan number step qualiti metric import depend domain learn system address problem improv plan produc plan import plan domain work learn rule improv effici qualiti research examin metric successfulli improv simultan tradeoff improv dissert present approach learn plan control knowledg learn rule varieti plan includ plan techniqu approach shown improv effici current plan system qualiti final solut address research intend strengthen bridg build ai plan system appli system successfulli problem control knowledg acquisit system scope learn system approach acquir knowledg plan scope stand search control optim plan experi system automat construct control rule plan refin plan refin modif ad action order constraint instanc control rule action ad plan order achiev goal rule avoid inappropri plan refin applic planner find solut quickli lead planner solut path acquir rule scope uniqu combin machin learn techniqu combin form learn dejong techniqu induct logic program lavrac integr scope effici build gener control knowledg appli unseen plan problem control rule built perform induct search space control goal build gener effect rule lead planner good search path order perform induct search search gener direct search inform found solv previou plan exampl unlik past scope algorithm ti type intend appli style problem solver scope effect appli promin style plan learn approach ineffect learn control rule type planner differ scope past approach scope flexibl architectur train improv plan metric scope improv plan effici final plan qualiti learn system concentr improv plan effici system improv factor scope algorithm evalu number plan problem includ transport domain product manufactur domain scope shown significantli improv plan effici qualiti problem scope shown significantli planner order shown produc optim plan solut problem scope shown robust compet approach provid speedup type domain definit organ dissert rest dissert organ chapter present background knowledg plan system learn plan control knowledg chapter discuss learn control rule plan present plan algorithm testb scope chapter present scope approach learn control rule plan detail featur algorithm chapter discuss scope evalu plan domain present result evalu chapter discuss relat work area learn control rule plan type problem solver chapter present idea futur research direct chapter review idea result present dissert discuss relev summari control inform plai import role plan system system solv problem effici system produc high qualiti solut machin learn techniqu emploi automat acquir control result knowledg direct improv improv effici improv qualiti work learn control rule improv metric dissert introduc scope learn system learn rule plan improv effici qualiti scope uniqu combin machin learn techniqu acquir control rule unlik past scope effect appli style plan improv effici plan qualiti chapter background plan method learn inform plan depend type plan system emploi part chapter discuss meant plan gener review method form plan part chapter present main metric evalu plan effici plan qualiti metric defin method measur discuss plan problem plan problem defin consist main set set action planner oper begin empti plan add action time solut found planner perform number includ good action add current detect solut recogn search path abandon plan problem introduc figur part problem defin ffl ffl set inform set depend task problem domain standard approach domain action repres strip oper format consist list add list delet list definit action logist transport domain shown figur order action appli precondit satisfi current state world order appli logist action true current state object locat truck locat action condit add list ad current world state delet condit remov action add delet list describ action world add delet add delet add delet figur oper schema logist transport domain action format insuffici express realist plan domain order perform plan action format extend research includ express construct format action descript languag addit construct adl extend includ item condit quantif precondit effect disjunct precondit chien construct domain writer creat complic express oper definit domain addit definit process plan domain appendix search method plan search method develop find correct plan classic includ origin strip emploi search planner maintain current world state guid search correct plan search domain shown figur planner start initi state search state state goal true reach state creat appli domain action type plan involv simpl forward search initi shown figur sophist search reason backward goal state search techniqu select oper add plan reduc differ goal state current state action plan order respect action current state world determin type plan algorithm term approach current plan maintain figur plan search planner search space world state state reach problem goal true complet order list action style plan emploi search maintain current world state proce type planner begin null plan search space plan find solut action ad current plan solut save plan complet order list current plan repres set action order save postpon plan process inform order constraint includ current valid order oper exist planner typic proce repeatedli identifi unachiev goal select oper achiev ad instanti version oper current plan order constraint situat plan action plan planner attempt add addit constraint resolv problem plan cycl continu goal achiev figur show plan type planner refer planner planner discuss research plan power effici plan strategi prematur order commit delai inform order made kambhampati minton barrett weld show basic plan algorithm significantli outperform plan algorithm number includ domain independ serializ heterogen set complex import distinct made plan algorithm planner linear nonlinear term acquir connot mistaken term common mean refer type goal select strategi emploi planner linear equat typic examin goal goal goal subgoal stack stack stack stack stack stack figur plan search planner search space partial plan plan goal achiev found type search plan achiev goal consid nonlinear planner emploi linear restrict examin goal order planner typic nonlinear requir linear nonlinear plan algorithm emploi approach veloso term linear planner nonlinear planner recent author refer planner plan evalu metric main metric commonli evalu plan algorithm receiv attent plan effici plan system current plan problem difficult solv toi quickli intract problem difficulti intract express domain includ condit effect quantif construct import domain greatli contribut plan complex make problem difficult solv past plan research concentr improv plan goal tractabl solv larger harder problem kambhampati effici planner measur wai common measur time find plan solut wai measur effici includ number backtrack planner number partial plan explor solut found metric evalu plan algorithm qualiti output plan flaw current plan method return solut plan problem solut number solut costli execut larger number resourc plan system qualiti final plan time gener plan vital manufactur domain planner produc plan low resourc number step varieti notion make good plan common qualiti metric list ffl length plan total number ffl execut time plan ffl resourc consumpt requir ffl robust plan depend domain qualiti metric vari import research improv plan qualiti goal consist produc optim plan order make plan domain tractabl produc high qualiti research attempt util control knowledg fike langlei knowledg provid planner extra inform make wise earli plan avoid larg amount search planner produc good solut rest dissert discuss techniqu automat produc control knowledg plan system summari method defin find correct plan plan problem promin techniqu current plan save list action learn techniqu acquir control inform appli older style plan maintain state plan evalu metric commonli judg perform plan system main metric util research effici plan system qualiti final solut effici measur plan time requir find solut final plan qualiti measur common number step solut rest dissert discuss learn method appli improv metric chapter learn plan control knowledg plan system automat acquir control knowledg util machin learn techniqu knowledg base directli user input deriv past plan experi system act learn design acquir control inform observ behavior human expert learn system built learn experi human autonom system understand complex difficult frequent desir requir human overhead number past learn system built learn control knowledg user rest section discuss method accomplish task ebl common approach learn control knowledg analyt learn system learn problem solv popular analyt method learn dejong system learn analyz explan behavior ebl system build explan member target concept learn plan control correspond plan target concept explain good bad explan built ebl construct control make futur plan similar origin dissert form call gener acquir control knowledg oper learn set suffici condit member target concept condit acquir gener explan fit target concept definit explan form proof tree infer rule prove member concept figur show input system sampl problem learn definit cup set inform system determin gener train oper definit goal concept definit satisfi criterion work main shown figur step domain theori construct explan goal definit concept learn term properti goal concept cup lowri train goal concept train cup includ domain set rule fact explain train goal concept domain theori cup includ rule specif learn concept definit express oper criterion cup definit term observ weight cup physic part figur requir input system construct explan term domain theori prove train satisfi goal concept branch explan termin express satisfi criterion explan gener cup shown figur determin set suffici condit explan structur hold accomplish regress goal concept explan structur conjunct result regress express constitut desir concept definit regress goal concept explan shown figur definit figur main step process figur explan structur gener member target concept figur show explan construct cup root explan proof target concept cup bottom leav tree correspond oper predic build explan step explan gener regress gener version target concept explan structur oper concept gener explan construct concept util rule correctli classifi concept futur problem learn analyt techniqu consid due abil explain concept definit learn number ebl learn system appli acquir plan control knowledg kambhampati due relianc standard ebl produc control rule gener plan situat situat commonli util problem learn rule cost test applic plan situat outweigh save problem ebl method difficult appli domain hard construct complet tractabl domain theori drawback make difficult successfulli appli ebl method problem induct method learn plan control rule emploi form acquir rule examin number plan exampl form induct techniqu dissert induct logic program combin logic program machin learn provid good platform learn control knowledg figur search tree find solut plan problem solid arrow show solut path tree gener induct method induct learn techniqu acquir plan control rule exampl posit neg plan exampl found solv set train problem extract exampl base good bad plan posit exampl correspond good plan occur search path lead solut neg exampl correspond bad plan search path fail search tree plan problem shown figur node correspond search state made arrow correspond plan oper appli state arrow correspond plan refin made current plan solid arrow show solut path dash arrow show search path fail examin posit exampl plan found solut path exampl plan solut collect neg exampl empir method build control rule perform induct search space gener goal build rule cover posit plan dont cover neg plan induct search guid domainindepend bia commonli bia occam razor prefer simpl rule complex main advantag induct learn techniqu learn method ebl tend learn gener control knowledg examin number exampl qualiti import build control gener control rule effect specif rule successfulli appli plan problem past learn system successfulli util induct learn plan control knowledg porter langlei induct techniqu disadvantag requir larg number exampl acquir effect control inform method quickli intract search larg amount inform build control rule disadvantag prevent induct method successfulli domain induct logic program learn includ emploi techniqu field induct logic program acquir knowledg ilp research address problem induc logic program set exampl field repres intersect standard logic program machin learn due express ilp method learn relat concept repres approach ilp system successfulli induc small program simpl task sort list manipul quinlan perform complic task learn properti organ molecul predict past english verb ilp algorithm dissert version foil induct algorithm foil learn horn definit target concept learn control plan target concept correspond concept appli appli order definit learn target util control rule solv futur problem definit construct foil term input set background predic input foil consist definit target concept definit background predic definit form tupl constant type foil learn definit simpl concept input foil target predic definit learn list set posit exampl concept foil requir neg exampl target suppli directli comput assumpt background predic true list element tail type denot includ list type defin list item type initi definit null remain posit exampl remain empti find cover exampl neg exampl remov exampl cover remain add definit figur basic foil cover algorithm foil learn program time summar figur construct time learn cover posit exampl target concept neg exampl learn member iter loop cover posit exampl element list member cover neg learn cover remain exampl constitut correct program target predic member central part foil algorithm implement search build foil add develop time step foil evalu liter ad select maxim gain heurist heurist prefer liter cover posit exampl fewer neg exampl algorithm maintain set variabl bind tupl posit neg exampl satisfi current includ tupl bind variabl introduc bodi pseudocod figur summar procedur foil consid ad liter variabl combin background predic long type restrict satisfi predic argument exist variabl bound head previou liter bodi liter evalu base number neg tupl prefer liter cover posit neg denot number posit tupl set initi target predic initi posit tupl remain neg tupl neg tupl find liter add form train set posit neg tupl extens tupl extend includ set bind variabl introduc replac figur step foil algorithm chosen liter maxim number tupl extens number current posit tupl cover foil includ addit featur method test ad liter immedi provid gain prevent overfit inform foil found quinlan ilp control argu ilp techniqu tool acquir control inform problem solv strategi easili code logic program learn mechan easili implement framework logic program comput platform build number current learn system emploi ilp techniqu induc horn concept definit foil learn system cast problem learn control rule concept learn induct techniqu successfulli acquir control inform logic program express definit subset definit disjunct liter liter liter repres head liter bodi comput resolut proof strategi existenti quantifi goal simpl logic program sort list shown figur goal program instanti goal true sort version list repres argument goal partit input output argument set consid input output program execut provid goal input argument instanti goal construct prove exist goal meet constraint provid input argument prover produc bind output argument simpl sort goal form produc output bind true true true figur simpl sort program insert insert insert figur improv insert predic prolog program languag practic instanti logic program simpl control strategi search backtrack search proof execut current search path point backtrack path explor search control prolog program view problem select process decid program reduc subgoal program execut option program repres separ unifi head bodi head match type bodi condit test program option select incorrect select solv program applic eventu backtrack match control inform incorpor prolog program form rule rule avoid inappropri greatli reduc backtrack lead program solut path simpl sort program shown figur sort list gener permut list find order permut gener permut tail input list insert head permut tail program perform time nondetermin definit predic insert item begin list tail nondetermin elimin learn control rule correctli predict item head list figur show modifi version insert construct dolphin learn system insert guard control inform attempt inappropri immedi fail appli element insert empti list element head current list cut ad end insert make determinist insert select control condit found backtrack result ad control knowledg insert sort program cohen zell moonei introduc system acquir control heurist improv perform prolog program combin ebl induct learn control rule elimin backtrack logic program combin learn techniqu discuss section dissert present research successfulli extend method appli ilp techniqu control knowledg acquisit complex plan system unlik past scope learn system ilp techniqu learn control rule improv program improv qualiti produc solut learn approach learn control inform combin learn techniqu method attempt combin ebl induct algorithm ebl gener construct control rule rule refin induct main goal method retain benefit domain theori flexibl learn data build complet plausibl learn conjectur member target confirm conjectur empir data system emploi lazi learn gener incomplet explan increment refin knowledg exampl borrajo dissert present learn approach acquisit plan system scope learn system combin ebl induct learn control inform gener control rule ebl induct refin scope build rule induct algorithm ebl focu induct search highli relev piec background inform examin rule techniqu search induct search tractabl level method differ learn techniqu emploi program techniqu type learn combin past learn control rule simpl logic dissert present applic complic plan system summari number learn techniqu util acquir knowledg appli improv plan system popular method construct control rule plan correct incorrect ebl method advantag requir drawback rule construct specif appli futur problem learn techniqu research acquir plan control knowledg induct construct rule examin number exampl exampl perform induct search space rule induct system emploi method field induct logic program ilp techniqu combin method field induct logic program techniqu primarili past induc logic program classifi effect tool acquir control inform logic program good platform repres control knowledg easili incorpor control rule plan system type problem solver induct benefici learn gener control rule easili appli plan situat induct drawback larg number exampl requir learn good induct search find good rule larg intract learn system combin ebl induct acquir control inform combin techniqu advantag util domain theori learn gener control knowledg combin method ebl construct control rule induct refin rule base exampl scope learn system ebl induct approach past learn induct learn rule ebl util bia induct search inform scope emploi induct logic program techniqu learn past learn system chapter learn control plan mention previou research plan learn system base plan algorithm introduct type number sophist plan approach develop typic outperform algorithm acquisit system adapt perform newer plan algorithm style plan acquir promin plan type approach wide current plan system planner identifi good testb scope control rule learn system planner base planner chosen planner step descript includ condit effect quantif proven sound amount plan research base algorithm poet kambhampati planner plan initi set set domain goal determin sequenc action transform initi state state goal satisfi oper action descript languag discuss section extens strip format oper add delet construct condit disjunct quantif search solut space partial plan consist action partial plan set set order constraint set causal set bind constraint variabl action ad current plan step set specifi partial order action order constraint step denot relat mean step constrain exist consist total order plan step causal record depend effect action precondit link repres plan step effect precondit consid link produc consum link detect occur action past causal link current plan exist separ action plan threaten condit ffl ffl effect delet plan work anticip prevent planner check resolv discov threat emploi main threat resolut confront planner add addit order constraint ensur threaten execut link order constraint ad requir execut link confront resolv threat threaten effect condit planner add negat condit effect agenda threaten effect condit consequ ad goal agenda action plan partial threat subject interpret link condit effect possibl incur threat strategi situat wait threat variabl fulli threat resolut strategi handl threat set list bind form constraint constraint repres requir unif variabl variabl constant constraint prohibit variabl constraint appli variabl action quantif quantif action precondit effect easili describ situat quantif imposs action unix remov file directori order implement type express domain develop made simplifi assumpt assum world model static object object creat delet plan object type declar problem initi state block mention predic includ list initi state predic order establish goal quantifi map formula ground formula quantifi variabl replac constant map base quantifi formula base defin quantifi correspond object type block foral base definit extend handl interleav existenti quantifi weld inform algorithm overview algorithm shown figur algorithm plan agenda outstand set action schemata initi plan plan problem fa order fa causal bind fg initi goal state repres initi plan ad action effect correspond initi state precondit correspond desir goal state initi agenda goal agenda repres pair precondit plan step check agenda empti step select goal work goal quantifi base express post agenda goal select goal disjunct conjunct goal formula chosen work origin goal remain goal post agenda establish goal step exist action assert goal action order casual link constraint ad action ad step remov select goal action select assert action precondit ad agenda step check threat resolv found ad addit order constraint demot ad goal agenda confront call agenda empti constraint found determin total order action return final solut algorithm agenda return goal remov goal agenda precondit action quantifi sentenc post base agenda conjunct post hq agenda disjunct nondeterminist post hq agenda liter link exist fail imposs oper exist action action add add fa add fa add updat set bind add action add add updat goal agenda agenda ig add newli precondit list add hq add agenda causal link action threaten causal link add add threaten effect condit consequ add agenda choic consist fail figur plan algorithm prolog order learn control rule logic program version algorithm implement prolog plan point program repres problem option formul separ explain section type control rule easili incorpor program plan algorithm directli base implement differ differ prolog planner oper backtrack search depth bound emploi search strategi kambhampati al run search mode learn system system discuss relat work author system scope learn control rule evalu effici prolog planner compar standard lisp implement experi run problem set test learn algorithm discuss section prolog planner perform compar case perform experi intend promot search strategi program prolog version compat term effici standard lisp version plan point import point algorithm planner select plan refin control rule benefici point planner make point includ goal goal establish exist threat threat resolut point number valid plan refin planner action ad achiev goal absenc control prolog select valid refin refin backtrack plan point logist transport domain shown figur figur figur show simpl problem domain goal deliv packag austin airport chicago airport figur show begin search process find solut problem candid domain ad action achiev goal shown packag transport truck plane refin option lead desir problem packag transport plane defin function return gener unifi prolog planner includ loop detect advic prevent search stuck infinit loop sequenc action ad repeatedli figur simpl problem logist transport domain goal problem deliv packag austin chicago scope design learn control rule backtrack lead fail search goal select threat select affect planner backtrack control rule learn point search control rule remain type establish threat form rule effect rule acquir backtrack control rule point improv planner perform control rule format scope learn control rule form rule defin plan refin appli select rule consist conjunct condit evalu true refin condit refin refin candid evalu shown select rule candid figur control condit select oper establish rule state oper select add action assert object locat citi goal locat order action requir learn control inform incorpor planner attempt select inappropri refin immedi fail plan refin control rule appli time refin control rule evalu true refin appli plan shown figur initi goal start goal start goal figur top search tree find solut problem shown figur plan refin achiev goal rule shown fail refin candid rule attach candid correctli prevent planner select planner move immedi select candid scope make select rule determinist nondeterminist depend accuraci learn rule rule deem fulli prolog cut ad directli call mean rule correctli refin select backtrack summari section outlin plan algorithm control knowledg implement plan domain express construct quantif condit effect oper call goal select agenda oper select achiev goal record partial order relat action verifi consist action exist situat detect action plan possibl appli threat resolut strategi ensur plan correctli execut process continu goal solv threat resolv order stai ilp version implement prolog plan point repres problem control inform easili incorpor scope learn control rule plan backtrack rule form rule evalu plan refin select resolv plan subgoal process learn rule explain detail section chapter scope learn system scope learn system automat acquir control rule plan input scope plan program set train exampl scope exampl induc set control heurist direct planner search path heurist incorpor origin planner plan program produc figur show main phase scope algorithm analysi scope solv train exampl origin planner extract control inform plan made inform pass control rule induct phase gener select rule plan refin learn rule incorpor origin planner program special scope output planner complet algorithm explain detail section analysi analysi train exampl solv exist planner trace plan process solv store proof tree root repres call planner tree node correspond plan procedur call top part sampl proof tree shown figur gener logist problem introduc figur goal proof call planner includ initi agenda initi list plan order input argument argument correspond output plan solut remain proof tree node correspond subsequ plan procedur call find solut proof tree creat train provid scope proof main output set exampl set gener proof tree exampl record success unsuccess applic plan refin gener proof tree provid background bind constraint system maintain set bind explicitli repres plan procedur call train exampl plan program program plan gener proof tree control rule induct program special select rule analysi ebl refin select figur scope architectur context explain success correct plan piec inform explain detail phase build control rule plan refin plan subgoal refin appli correct refin select applic refin found solut path incorrect refin select refin applic backtrack plan problem introduc figur plan subgoal repres figur correspond procedur call shown figur procedur select action add plan achiev goal procedur input includ goal achiev action achiev goal figur show styliz version subgoal introduc figur subgoal identifi posit refin candid figur action classifi neg select candid action posit neg exampl collect set compet plan refin refin consid appli ident plan refin candid shown figur compet refin backtrack occur solv plan problem train produc numer posit neg figur solut proof plan problem figur agenda select establish figur plan subgoal repres point shown figur ampl select exampl induct repres posit neg exampl appli plan refin output analysi phase set gener proof tree inform proof tree util induct phase build control rule gener proof produc procedur standard gener techniqu dejong gener train proof gener perform proof step creat origin trace goal uninstanti input argument goal gener remov proof element depend specif fact maintain proof structur tree node complex list argument argument correspond item list plan list plan order order promot gener control list data structur remain gener proof tree gener directli variabl top part gener proof tree shown figur proof extract solut trace shown figur gener techniqu gener proof context space inform shown action data structur precondit effect list data structur action initi state list effect plan goal figur gener proof tree solut trace figur success correct end analysi set gener proof tree set exampl pass induct phase construct control rule control rule induct goal induct phase produc oper definit appli plan refin refin scope build definit concept subgoal logist transport definit learn refin shown figur control rule learn view relat concept learn number system design tackl type learn problem zell scope emploi version quinlan foil algorithm learn control rule induct choic framework motiv number factor basic foil algorithm easi implement proven effici number domain foil bia produc simpl definit bia import learn rule low match avoid util problem easi bia foil prior knowledg scope util inform gener proof tree plan solut trace bia foil control inform foil scope explain section foil attempt learn concept definit term set background predic definit set horn cover posit exampl neg exampl acquir control rule concept definit learn scope appli plan refin exampl collect analysi phase provid set posit neg exampl refin appli scope version foil background predic defin prolog program requir standard foil match liter set tupl determin cover prolog interpret prove liter satisfi definit expand tupl maintain posit neg exampl target concept altern special develop major drawback foil similar induct hillclimb search good add easili numer background predic larg number argument select foil variabl combin predic make choic search grow exponenti number predic argument scope significantli reduc search util gener proof train exampl examin proof scope identifi small set potenti liter ad current definit liter ad util variabl connect establish proof tree approach nice foil search liter variabl found solv train exampl process util gener proof tree bia foil search explain detail section build control rule proof tree gener proof train exampl give context applic plan refin proof node gener proof tree call predic predic classifi problem build effici concept definit oper node proof repres primit condit satisfi proof succe scope emploi induct attempt identifi small set simpl test provid guidanc determin applic plan refin lead solut test condit verifi plan execut import entir proof surround context instanc planner verifi action establish goal correct plan process check action assert scope emploi gener cover algorithm present figur modifi construct step success special target refin solv train exampl type ad develop pull directli gener proof tree scope type negat proof initi target predic initi posit exampl remain neg exampl neg tupl posit gain found creat set special ad oper liter gener proof tree negat liter gener proof tree constraint variabl determin liter liter defin background knowledg select special score highest foil inform gain metric form train set posit neg exampl replac figur step induct algorithm scope tree determin relat background definit type explain detail section pseudocod figur summar procedur scope ad liter learn definit refin candid figur appli program predic repres type refin shown predic defin argument includ unachiev goal output argument select oper scope begin gener definit gener definit cover candid exampl figur overli gener definit cover posit exampl neg exampl appli candid evalu true special ad bodi special creat unifi head proof subgoal solv appli candid ad oper liter proof tree share variabl subgoal special creat ad type special shown figur proof tree liter ad check exist plan establish goal variabl newli ad connect exist rule head wai unifi rule head gener variabl rule head unifi variabl exist proof tree oper liter proof plan state inform list current plan order causal automat includ argument refin predic true figur process construct scope begin gener definit special ad unifi variabl type share variabl gener subgoal test method initi establish relev variabl connect rule head variabl head newli ad variabl connect establish standard foil techniqu unifi variabl type scope test liter control liter input paramet bound rule head exist liter rule liter extract part proof variabl connect paramet liter unbound paramet scope attempt unifi paramet term type present rule figur unbound match variabl rule scope modifi shown unifi term type rule unbound input variabl unif test special current rule special maxim foil heurist select type scope consid type control rule induct pull liter directli gener proof scope negat proof determin liter repres relat background knowledg negat good reason select candid refin good refin control rule successfulli negat rule compet refin potenti negat refin control rule determin combin set rule compet refin negat copi ad rule wai standard foil add rule neg exampl remov posit left rule creat scope ad negat order cover posit append negat end scope induct algorithm consid conjunct group exist negat procedur number posit exampl cover rule cover addit neg assum induct algorithm ad rule scope form rule shown standard rule consid rule specif origin rule possibl exclud neg exampl gener origin rule cover posit exampl determin liter determin liter introduc variabl liter produc bind liter output significantli induct search space determin liter typic ad standard induct produc gain rule introduc inform rule scope induct determin liter automat ad creat prove unnecessari simpli prune construct end scope consid ad type determin input list plan step output list proposit repres initi final state liter includ control rule easili access inform initi goal state constraint type potenti liter constraint form variabl exist type check variabl benefici check action rule domain rule state action select achiev goal exist establish action requir relat featur ad scope algorithm relat individu liter provid gain test rule group relat conjunct liter provid gain standard combin liter discov liter gain individu search combin liter practic address silverstein pazzani introduc relat suggest potenti combin predic relat learn effici mean search restrict subset space predic combin relat consist abstract descript conjunct predic set constrain predic variabl bind fill pattern scope number relat util successfulli domain test relat pattern list list initi goal state predic list initi goal state predic pattern induct test concept present initi final state defin condit pattern introduc base observ scope behavior logist transport domain check object citi initi state citi goal state current goal move object locat predic determin object transport citi repres gener pattern list pattern made specif ad special descript gener concept initi goal state discov pattern forc found domain transport domain origin inspir relat induct addit rule special gener ad combin predic fit defin pattern restrict special ad pool rule special rule highest gain chosen instanti relat found cach easili futur search requir cach relat discuss section background knowledg type liter defin background provid user liter includ plan program build control rule abil add background knowledg user add liter definit discov normal liter definit seri call plan program predic combin discov number predic involv larg effici relat background liter concept relat qualiti correct plan background definit express featur concept disjunct condit definit found construct rule liter rule check block locat block stack problem initi state liter includ background knowledg made scope ad prolog definit rule special gener liter ad variat background liter variat liter gener match variabl liter variabl type present current rule variabl background liter declar type match rule variabl rule special creat manner ad pool special rule modif select program special phase rule learn select plan rule pass program special phase learn control inform incorpor back figur learn control rule logist domain origin planner basic approach guard plan refin candid learn select inform forc refin applic fail quickli plan subgoal refin appli plan refin control inform incorpor learn control condit repres select refin process similar section copi head learn control append end origin program learn rule ad program refin control relat control rule consid disjunct ad program separ cut append bodi newli ad control reason multipl proof plan refin made control inform made planner determinist refin rule cover incorrect select induct assum rule fulli accur refin candid consid type rule mark determinist ad prolog cut call rule prevent backtrack refin select rule condit true refin rule exclud incorrect previou planner backtrack select refin cut type rule substanti improv plan effici prevent inappropri applic refin figur show learn rule logist transport domain rule select action achiev goal found initi locat citi goal locat goal locat airport rule initi state achiev goal exist action plan move truck locat question brought pure induct algorithm learn control rule bia pure ebl approach section discuss benefit learn approach problem learn search control plan pure induct learn control rule approach learn control rule plan emploi pure induct algorithm similar induct algorithm present bia search background inform provid pool oper plan predic scope construct rule pure induct search set prove gener proof tree induct engin bind variabl learn cost search background predic extrem intract perform explain cost pure induct theori analysi foil algorithm present main element contribut size foil search space number liter search order extend bodi pazzani kibler show number bound red red total number background maximum number variabl maximum ariti predic infer formula addit predic size search space linear ariti predic size search space exponenti search space exponenti number distinct variabl past approach util pure induct search acquir control knowledg search hand simpl predic appli planner induct search condit present current world state oper plan predic scope complic number argument induct search predic prove due exponenti number predic argument scope circumv part search problem inform gener proof tree constrain search variabl combin add liter examin scope variabl bound variabl current liter head extract directli gener proof variabl connect establish tree preserv construct liter unbound scope search liter variabl number search scope search pure foil approach scope extra background predic found plan proof variabl connect made induct engin extra background predic significantli induct search search space examin scope significantli smaller search space examin pure induct approach pure ebl learn control rule learn control rule plan pure approach learn system learn control rule plan util ebl explain plan failur discuss detail chapter learn system successfulli acquir rule improv perform mention section rule learn ebl complex cost appli rule outweigh save section comparison scope present scope shown outperform experi ebl shown effect improv plan perform express combin ebl shown robust appli domain improv plan metric learn rule avoid search path lead scope significantli improv effici planner scope simultan improv qualiti plan method collect train data order improv plan scope train solut plan length qualiti evalu scope train solut plan low number step minim plan execut time desir qualiti scope train solut plan small execut time approach scope collect posit neg exampl appli plan refin base find plan learn rule avoid avoid path lead solut order train scope techniqu emploi gener train problem solut planner simpli search optim solut plan length qualiti search method iter deepen optim solut plan execut time branch bound search find plan metric star search exist admiss heurist qualiti metric techniqu emploi human domain expert solv train problem present domain expert easili provid solut viabl domain expert improv learn time addit featur ad scope learn time tractabl level cach relat emploi method increment train cach relat relat valuabl find accur dramat induct search space number liter combin fit pattern order extra relat consid small number train exampl accur rule learn standard scope procedur small number train scope search relat combin cach instanti gener pattern number train exampl exce predefin limit cach immedi consid addit scope search relat pattern singl liter cach pattern found gain scope find relat combin earli train cach scope avoid extra search train process increment train scope design run increment train save time system scope origin design run batch system train exampl input system time order creat effici scope modifi run increment mode smaller set train exampl input scope scope read small set learn control rule read set train exampl examin learn control rule save trial process work manner set train scope cach learn rule perform induct build rule cach rule test cach rule found fulli accur current set rule highest gain select rule cover largest number posit exampl cover rule remov process repeat accur cach rule found posit exampl cover posit exampl rule set built scratch cover case good control rule learn base small number train exampl techniqu exploit fact cach rule built small amount learn train larger number exampl incur larg amount learn time train increment mode greatli cut learn good rule learn small number train exampl limit set exampl experi discuss dissert summari section present scope learn automat acquir knowledg plan system knowledg acquir main phase scope solv input train exampl origin plan program extract piec control inform set refin select exampl record plan refin successfulli appli solv train exampl set gener proof tree provid background context explain success correct plan construct appli gener techniqu proof train exampl phase piec inform construct control rule foil induct algorithm emploi construct definit appli plan refin inform gener proof tree bia foil search control inform set rule construct appli rule pass phase algorithm incorpor origin planner output plan program chapter present result demonstr scope effect learn control knowledg improv planner perform domain chapter evalu improv effici plan length section describ number experi test scope abil improv effici plan plan qualiti metric solut length experi present domain scope shown significantli improv factor scope shown scale gracefulli increasingli hard problem domain descript logist transport domain veloso adopt set experi packag deliv locat number citi packag transport citi airplan locat citi truck standard set oper nilsson logist domain oper domain oper descript domain found appendix logist plan qualiti measur length shorter plan consid desir goal improv plan effici produc solut minim length scope improv effici plan length order improv plan scope train solut gener optim solut minimum length logist solv train problem reason amount time bootstrap techniqu acquir solut train problem train set simpler problem gener effici solv problem packag scope train problem set control rule gener rule solv problem actual train set major packag techniqu produc optim solut problem solv control rule optim solut problem enter hand train approach scope easili train optim solut harder user design goal experi improv planner effici qualiti gener solut train test problem gener domain random problem gener produc random initi final state logist state produc place packag random locat citi problem domain truck distribut locat citi problem gener techniqu minton block top held arm problem block goal scope train separ exampl set size plan length qualiti metric scope train solut minim length gener solv train gener bootstrap techniqu solv train explain section test set independ gener problem evalu perform trial run train set result averag time limit plan uniform depth bound plan length test problem solv depth bound set logist depth bound set test perform ultra sparc logist domain ultra scope learn control rule train set produc modifi planner scope special origin plan program sound respect origin planner complet control rule special planner solv problem solvabl origin planner order complet final strategi cohen adopt final planner fail find solut test initi plan program solv problem situat occur failur time planner solut time origin planner includ total solut time problem comparison search method solv test problem search evalu solv test problem test standard lisp implement result partial due implement differ prolog lisp solut optim rule special miss optim solut number problem check case optim solut produc result figur figur show measur improv plan effici domain time shown repres number requir solv problem test set scope train number exampl perform occur planner util learn control inform scope produc planner significantli faster origin planner logist planner averag time faster origin planner domain averag time faster point control knowledg backtrack occur planner logist scope learn good control rule train immedi produc speedup train exampl scope pick special control rule reduc plan time logist averag rule learn averag rule learn search perform significantli search scope logist domain solv test plan time requir greater prolog planner search solv larg number problem small number problem great difficulti find solut logist solv test problem plan final plan time fifteen hour larg displai graph plan qualiti improv domain shown figur length shown graph repres averag solut length return test problem averag length optim solut shown produc optim solut logist problem gener reason amount time averag calcul logist scope return significantli shorter solut produc origin averag solut length reduc step step search solv problem domain averag plan length search method shown scope produc planner return return significantli shorter solut return scope reduc averag solut length averag solut length optim solut search gener averag solut length achiev optim produc slightli solut produc scope mention planner produc scope correct complet control rule produc scope special prevent planner solv problem experi present problem occur planner solv test problem solv learn shown planner solv higher percentag test problem origin planner train exampl scope control figur effici perform logist transport domain train exampl scope control figur effici perform domain train exampl scope control figur qualiti perform logist transport domain train exampl optim scope control figur qualiti perform domain figur show percentag test problem solv planner experi present graph show percentag test problem solv train number problem logist planner cover test problem begin train exampl learner train planner cover close test problem planner quickli cover larg percentag test exampl cover close train complet scalabl set experi perform evalu scope perform harder problem test increasingli complex problem logist transport domain experi scope train simpl scope retrain slightli harder problem result evalu test set complex goal experi rule learn simpler problem scale harder problem differ scope train harder problem train simpl problem scope train train problem logist domain distribut locat citi solut gener mention problem level complex solv reason amount time scope perform train simpl problem control rule learn scope scale problem complex test set complex perform evalu number packag rang time limit problem limit solut length test problem depth bound ensur test problem solv depth bound rang step packag problem packag problem result experi shown tabl tabl set column tabl show complex level test set tabl set column show percentag test problem solv time limit learn set column report plan time requir solv test problem tabl set column show averag solut length problem solv number show long averag solut test problem solv planner set column show averag solut length problem solv origin planner control number includ show scope improv solut qualiti number gather problem solv origin planner planner solut length observ train exampl figur number test problem cover planner logist transport domain train exampl figur number test problem cover planner domain test set problem solv solut time num num goal problem rule rule rule rule tabl effici result increasingli complex test problem logist domain test set plan length plan length problem problem solvabl origin num num optim goal problem rule rule rule rule length tabl qualiti result increasingli complex test problem logist domain result shown problem solv planner problem solv origin planner includ tabl averag optim solut length simpler test set dash number due fact problem solv origin planner test scope improv plan percentag problem solv problem scope creat planner time faster origin planner problem scope creat planner time faster improv percentag problem solv packag speedup number test problem solv form difficult gather data plan qualiti improv test set exampl hardest test origin planner find solut time solut length learn compar test set packag scope significantli improv final solut qualiti gener optim solut fourth test set packag scope improv final solut qualiti packag problem solv origin scope improv averag solut length test set packag problem solv origin plan qualiti improv measur test set problem solv solut time num num goal problem rule rule rule rule tabl effici result increasingli complex test problem logist domain train harder problem bootstrap method present section train scope harder problem experi intend test train scope harder problem improv result experi procedur gener train exampl rule experi present solv harder train problem train problem problem previou experi packag section learn rule solv train problem optim solut unsolv problem enter hand scope perform test set test problem result experi shown tabl test scope improv plan percentag problem solv improv greater previou experi train packag scope coverag packag problem train packag coverag greater speedup realiz speedup packag problem packag problem packag solut coverag slightli time limit discuss time limit solut time close limit solut time close time limit train harder problem solut time problem slightli longer time limit solut time problem improv harder problem solv time speedup reflect report result qualiti improv gener remain similar scope produc optim solut packag problem train packag scope improv averag solut length packag problem train packag improv packag length origin improv train packag improv packag solut length remain train harder problem improv plan effect qualiti reason solut produc test set plan length plan length problem problem solvabl origin num num optim goal problem rule rule rule rule length tabl qualiti result increasingli complex test problem logist domain result shown problem solv planner problem solv origin planner experi scope train packag optim close optim room improv harder test qualiti improv problem solv origin qualiti improv difficult measur ablat result set test run evalu featur scope induct algorithm experi test effect type list section scope perform test problem set logist transport domain util set experi section train test problem packag distribut locat solut train gener bootstrap util experi run test import type scope induct algorithm liter straight gener proof type negat version proof tree relat induct algorithm type includ negat determin liter constraint relat extra background incur extra search effici qualiti improv measur scope perform type liter compar result test figur show measur improv plan effici similar previou time shown repres number requir solv problem test set scope train number exampl perform occur scope util type regular proof tree scope improv effici smaller type liter speedup incur regular proof tree liter speedup produc type liter longer converg good set rule train train exampl scope extra ant scope rel background scope figur ablat result effici logist transport domain small number exampl scope plan effici scope construct accur control dont cover neg add cut refin select slower plan time backtrack occur planner special solv test longer revert back planner produc account longer plan time earli train process scope negat determin liter scope improv plan perform access relat background predic scope achiev speedup set control rule learn point scope problem learn fulli accur rule figur show measur improv plan length shown graph repres averag solut length return test problem scope perform standard liter type util scope regular proof tree reduc averag solut length step step control rule direct scope slightli higher qualiti solut rule cover neg planner direct solut path scope extra reduc averag solut length step step standard extra featur control rule direct train exampl scope extra scope rel background scope figur ablat result qualiti logist transport domain planner averag solut length test problem reduc step ablat test show effici qualiti type import factor achiev good perform improv learn time effici result present chapter consid initi final plan time includ learn time section discuss learn time experi incorpor previou result learn time logist experi present section shown figur figur final learn time train exampl logist final learn time includ time learn control rule packag problem includ time requir learn control rule packag solv harder train exampl time includ final learn time logist learn time scope learn system drawback outweigh benefit provid scope learn perform planner gener solv countless problem extra time spent learn process easili justifi amort analysi perform evalu quickli gain realiz domain analysi estim problem system solv train exampl figur learn time logist domain train exampl figur learn time domain make cost learn time result produc gain plan time realiz run test exampl logist gain realiz run planner exampl includ time learn rule packag gain realiz run planner small number problem solv gain effici larger number problem solv achiev number quickli reach test increasingli complex problem planner produc scope significantli number test problem solv scope learn produc optim solut problem base planner control solut lower qualiti solut longer origin planner includ control solut longer logist domain time requir gener optim solut base planner greater time gener valid solut logist planner gener optim solut packag problem run dai summari section present result scope improv plan effici qualiti metric solut length result present logist transport domain domain scope shown produc improv planner produc scope significantli faster origin planner scope produc shorter solut plan set experi present show scope abil scale increasingli complex problem experi perform logist domain scope shown produc planner effici solv problem packag level problem complex scope produc faster scope significantli number test exampl solv planner time limit scope produc improv plan qualiti appli harder problem test scope improv solut qualiti problem solv origin planner shown simpl problem optim solut scope gener optim solut chapter evalu improv effici plan cost section describ experi test scope abil improv effici plan plan qualiti metric solut test scope abil improv metric realist domain experi domain solut cost depend solut longer solut higher qualiti qualiti metric domain defin scope shown improv improv planner effici domain descript domain experi process plan domain creat gil complex domain describ number manufactur process process plan intermedi step product manufactur stage product manufactur product involv produc specif model product satisfi desir set specif design step plan sequenc process perform product part part manufactur product plan part assembl produc final product focu process plan domain autom product step product manufactur problem domain involv find sequenc oper produc part design design goal produc part hole drill side hole depth drill locat part goal sampl solut plan achiev goal shown figur goal requir hole drill side part side part rectangular part hole depth width locat side part sampl solut plan show valid plan achiev goal part clean drill bit mark locat hole bit drill hole goal specif domain includ produc part give part specif metal coat smooth surfac initi state goal solut plan figur problem sampl solut plan process plan domain goal problem hole size drill part locat part adequ level type design varieti altern process number type drill bit drill drill oper perform machin implement domain gil machin oper form plan oper oper drill shown figur oper drill bit drill machin oper number precondit satisfi includ drill machin hold part diamet drill hole match width goal repres process plan domain definit oper set part secur part hold clean remov metal surfac part implement process plan oper process repres domain complex long plan time add delet figur drill oper process plan domain plan qualiti process plan domain plan qualiti process plan domain extrem import goal minim execut time reduc number resourc crucial part product manufactur number qualiti metric measur domain ffl number plan step ffl total execut time plan ffl dollar cost plan ffl number resourc plan ffl feasibl execut plan ffl reliabl plan plan length accur measur plan qualiti process plan oper execut cost case plan step accur qualiti measur total cost measur execut time dollar cost plan step rough measur plan execut time made count number step exist plan step prepar machin part oper place part machin rotat part held machin oper fit categori step import process plan domain longest execut tabl describ qualiti metric perez reflect type qualiti call qualiti metric metric assign oper fix cost lower valu higher qualiti cost plan determin ad cost plan step metric assign higher cost step reflect fact cheaper switch tool machin manipul part qualiti measur defin domain metric creat reflect type plan cost machin product manufactur significantli oper benefici qualiti measur directli reflect machin oper cost tabl describ qualiti call qualiti metric metric state oper mill machin costli drill process plan mill machin chang dimens part drill hole drill machin drill hole qualiti plan goal drill plan drill machin creat hole plan mill plan correct qualiti metric defin tabl prefer plan problem problem shown figur problem chang size part drill hole side solut plan problem shown figur solut plan score differ qualiti metric defin chapter plan score qualiti metric mill machin plan oper plan score qualiti metric requir fewer setup step plan scope improv effici plan cost previou scope shown improv plan effici qualiti metric plan length section improv effici qualiti metric relat type plan cost order improv plan qualiti scope train highqual solut optim plan cost evalu scope train low cost plan train problem process plan complex domain base planner difficulti produc solut reason amount time test shown base planner solv test problem time limit provid solut train problem high qualiti difficult approach gener solut train problem order solv train planner larg set control rule process plan domain rule enabl prodigi planner solv problem domain quicker base planner dissert solut train problem gener set solut creat modifi oper type cost oper machin oper machin hold devic oper tool oper clean oper tabl qualiti metric qualiti metric reflect execut time process plan domain higher cost assign step involv hold move part oper type cost oper mill machin oper drill oper machin hold devic oper tool oper clean oper tabl qualiti metric qualiti metric reflect type execut cost process plan domain higher cost assign step util machin initi state goal solut plan solut plan drill plan qualiti metric qualiti metric plan plan figur problem process plan domain goal problem chang part length hole drill side prodigi set correspond qualiti metric set solut qualiti metric produc examin solut produc solut improv respect qualiti metric modifi hand solut optim procedur produc solut set qualiti metric solut gener prodigi modifi order produc optim solut qualiti metric train set problem solut design goal experi improv plan effici qualiti gener solut experi intend evalu scope improv qualiti metric qualiti metric defin section measur solut qualiti domain scope goal test minim solut lower cost solut consid higher qualiti random problem gener built gener problem process plan domain oper creat random initi state part part tool locat drill machin hold size drill creat random set goal part problem experi concentr goal cut part desir size spot drill hole size locat random locat part problem goal problem train problem creat optim solut qualiti metric produc techniqu section experi qualiti call experi experi experi train problem optim qualiti metric experi train problem optim qualiti metric scope train separ set size trial run experi due time involv gener train solut learn control rule test set independ gener problem evalu perform time limit test problem depth bound plan length step problem solv test perform ultra similar procedur previou scope learn control rule train set produc modifi planner plan program found special fail train initi plan program solv problem situat occur failur time planner solut time origin planner includ total solut time problem comparison search evalu solv test problem test standard lisp implement result partial due implement differ prolog lisp effici result figur show measur improv plan effici experi test scope greatli improv planner effici experi train problem optim qualiti metric scope speedup origin planner factor experi train problem optim qualiti metric scope speedup origin planner factor point control knowledg backtrack occur planner experi scope achiev slightli higher speedup factor experi qualiti relat machin oper cost partli due fact fewer control rule learn experi experi rule learn experi rule learn scope outperform search search faster base planner search scope significantli improv number test exampl solv time shown figur origin base planner solv test problem time limit search solv test problem time limit experi experi planner produc scope solv test scope greatli improv number test problem solv reason amount time speedup coverag improv realiz test show effici improv gener scope depend type qualiti metric qualiti result plan qualiti improv collect wai goal evalu test train scope optim solut qualiti metric produc planner gener solut score metric control rule experi minim qualiti metric control rule experi minim qualiti metric plan qualiti evalu test problem solv final planner test problem solv planner set solut problem produc experi evalu qualiti metric qualiti metric set solut produc experi result evalu shown tabl total cost problem solut gener experi qualiti metric shown train set optim qualiti metric produc control rule turn gener solut minim metric score qualiti metric train set optim qualiti metric produc control rule gener solut minim metric score qualiti metric solut gener experi lower cost qualiti metric solut gener experi solut gener experi lower cost qualiti metric solut gener experi evalu train exampl scope experi scope experi figur effici perform process plan domain experi run optim qualiti metric train exampl scope experi scope experi figur number test problem solv time limit solut set qualiti metric qualiti metric experi experi tabl total cost solut produc evalu qualiti metric solut problem planner solv includ experi train problem optim qualiti metric experi train problem optim qualiti metric solut set qualiti metric qualiti metric scope exp scope exp df bf tabl total cost solut produc evalu qualiti metric solut problem solv planner produc base planner standard includ show scope successfulli improv qualiti metric comparison solut problem solv final planner produc base planner standard lisp version test problem solv planner similar set solut planner evalu qualiti metric qualiti metric result evalu shown tabl train set optim qualiti metric produc control rule turn gener solut minim metric score qualiti metric train set optim qualiti metric produc control rule gener solut minim metric score qualiti metric qualiti lowest cost solut produc planner gener experi solut lower cost solut gener planner experi lower cost solut produc version lower cost solut gener qualiti lowest cost solut produc version solut lower cost solut produc planner experi lower cost solut produc planner experi lower cost solut produc experi optim qualiti metric scope produc solut lower cost produc base planner qualiti base planner output optim solut test problem solv room qualiti improv test problem planner experi produc solut produc base problem produc slightli account differ total plan cost shown figur solut produc experi significantli lower cost solut produc experi search version optim qualiti planner produc scope outperform standard lisp implement outperform qualiti metric slightli qualiti metric planner produc scope produc significantli solut time limit produc implement learn time effici result present chapter consid initi final plan time includ learn time section discuss learn time process plan domain learn time experi shown figur experi final learn time train exampl approxim hour experi final learn time train exampl approxim hour learn time high compar logist domain due fact higher number point process plan domain domain test process plan domain compar logist point control rule learn domain scope examin point control knowledg point benefit learn control knowledg point rare backtrack occur scope spend time examin high learn scope benefici domain unclear speedup scope achiev domain test problem solv base planner time limit emploi time limit run experi present true speedup achiev learn system unclear long base planner control solv test problem planner run dai time limit solv problem scope produc high qualiti solut time requir automat find high qualiti solut time requir find valid planner perform extens search number solut learn time larg easili argu benefit provid scope outweigh drawback introduc larg learn time summari section present result scope improv plan effici qualiti metric execut cost experi perform process plan train exampl experi experi figur learn time process plan domain larg complex domain describ number manufactur process qualiti metric defin process plan domain metric type execut cost experi goal experi scope produc control rule qualiti metric improv plan effici scope significantli improv planner effici number test problem solv time limit scope produc solut chosen qualiti metric result show scope successfulli appli improv plan effici plan result depend qualiti metric show scope effect improv planner perform domain chapter evalu improv effici question brought dont train scope effici gain scope achiev solut optim order investig scope run similar set experi present chapter main chang scope train solut found train solut goal experi test scope produc effici improv train effect improv plan qualiti design experi logist transport domain evalu scope perform set chapter train test solv train exampl iter search util solut found learn algorithm search solv problem reason amount bootstrap train method test set test problem chapter evalu perform trial run train set result averag time limit plan uniform depth bound plan length train test problem bel solv depth bound set ident section depth bound set depth bound set test perform ultra sparc logist domain ultra train exampl scope scope figur effici perform logist transport domain train exampl scope scope figur effici perform domain effici result figur figur show measur improv plan effici domain result previou set experi shown comparison scope produc effici planner origin incorpor learn control inform scope produc planner time faster logist time faster domain logist scope achiev speedup train high previou achiev speedup factor scope produc effici speedup earlier test scope train optim solut speedup factor achiev reason speedup factor scope train solut optim qualiti scope shorter solut mean work final planner solut fewer plan iter place scope learn accur rule experi logist accur rule learn point scope learn good point unabl learn fulli accur set rule explain section rule learn fulli accur cover neg rule cut ad rule refin applic backtrack planner solv test solut time larger backtrack occur exampl scope learn accur cover situat correspond similar plan subgoal solv wai train differ stem close plan depth limit problem shown figur solv goal action planner add block problem return valid plan shown figur depth limit planner plan creat step plan plan minu assert step step achiev wai similar scope hard time learn rule cover scenario planner behavior due depth limit type problem occur experi logist domain reason logist problem solv high depth limit problem solut depth solut found close depth bound difficult depth limit solv train problem reason amount time avoid high depth limit affect solut make hard domain solv train problem reason amount time give learn system method reason depth limit build rule evalu current search path hit depth limit find solut problem problem figur similar problem plan plan figur solut plan problem shown system discuss chapter util extra domain axiom reason failur qualiti result plan qualiti experi shown figur figur result experi previou set experi scope train solut shown comparison train scope produc planner significantli chang plan qualiti logist planner effect plan qualiti planner behav ident origin planner planner produc slightli shorter gener solut remain length origin planner train solut length learn remain similar found learn result demonstr methodolog train scope greatli affect final perform summari section present result scope improv plan effici train solut optim qualiti result present domain chapter logist domain scope shown improv plan effici domain logist effici gain train exampl scope scope figur qualiti perform logist transport domain control scope train result train exampl scope scope figur qualiti perform domain duce compar produc chapter effici gain chapter experi scope difficulti build accur rule due differ solut depth limit plan qualiti present experi scope produc planner significantli chang qualiti solut chapter relat work work discuss dissert touch numer area artifici includ machin plan induct logic program relat work area mention chapter chapter present broader discuss work relat scope imposs mention detail relat summari attempt closest work learn control problem solv earli research learn control rule varieti problem solv symbol problem earli work center learn record success oper sequenc futur problem porter system concentr learn heurist success problem solv behavior acquir control system emploi similar method scope analyz search space posit neg exampl problem solver behavior identifi control heurist learn cover posit exampl rule neg earli approach combin induct ebl learn control inform system construct rule induc complet gener trace induct select piec gener work learn approxim ebl rule ul system acquir conserv approxim ebl rule simpli drop condit ul limit rule unlik induct learn mechan build rule scratch close relat system integr induct mechan learn approxim ebl rule learn control rule appli proof correct control pool candid control rule form approxim approxim form drop rule condit search pool small set rule maxim coverag posit exampl minim coverag neg exampl system weak number approxim grow exponenti limit small valu problem explan subgoal context subgoal condit oper lie proof specif subgoal oper appli dolphin system improv power induct algorithm analyz proof tree entir problem explain individu subgoal success goal dolphin prolog program optim dolphin learn learn control rule determin prolog program solv subgoal rule learn combin gener program dolphin shown success improv perform plan domain util simpl planner origin inspir scope idea introduc number differ system scope dolphin combin ilp techniqu learn control rule improv perform prolog program dolphin appli simpl logic program search space fairli easi analyz appli complex problem requir effici algorithm power induct engin learn control inform dolphin difficulti effici gener explan structur problem gener explan reason amount time difficulti stem larg search space examin induct dolphin algorithm approach limit construct rule express analyz complex found planner dolphin algorithm add rule straight gener proof tree mechan modifi ad rule dolphin addit induct featur ad scope negat relat build simpl control rule scope learn rule improv final plan unlik dolphin improv program perform chang qualiti produc solut learn control planner perform system appli planner amount research learn control knowledg explicitli direct improv perform plan system research concentr planner prodigi plan learn system emploi version call learn control rule planner rule learn plan failur success unforeseen goal interact learn control rule prefer candid type number system appli ebl learn plan static acquir control rule analyz problem domain theori system ebl analyz graph ture captur depend action domain analysi deriv rule prodigi planner design learn control rule domain underli domain theori system planner learn build incomplet explan execut time failur learn approach reli ebl induct approach learn plan control knowledg system learn control rule variabl bind set train set similar form basi control rule rule precondit gener find gener set current state condit hold true begin induct search rule condit small search condit mention chapter appli induct search set requir complic set predic render search perform learn system shown success improv planner perform unlik system architectur limit appli planner rule gener earli system heavili reli assumpt search goal valid planner rule check condit present current state assum current action plan order system difficulti analyz search space planner planner oper process creat gener explan complex remov linear assumpt add complic learn address earli search path consid gener explan learn system built acquir control knowledg style plan recent learn control knowledg nonlinear planner similar combin ebl induct acquir control rule optim solut gather train perform exhaust search problem search space gener bound explan plan increment refin incomplet inaccur explan control rule special found cover neg exampl gener found exclud posit exampl unlik ebl build induct primarili refin learn knowledg planner remov linear restrict examin planner rule condit directli depend current state inform perform planner test small domain qualiti metric plan length perform complex domain improv type qualiti metric successfulli improv effici perform planner logist plan scope test complet plan rough comparison drawn examin result report borrajo veloso result report scope report chapter note scope achiev speedup factor problem achiev speedup problem goal speedup complic problem goal experi number block problem greatli vari scope slightli vari scope produc qualiti improv lower solut length averag produc improv lower solut length result due fact prodigi planner produc solut learn system run complex problem logist transport domain scope train problem packag distribut citi train problem goal packag distribut citi scope achiev speedup factor rang simpl goal problem goal problem goal problem produc small speedup rang simpl goal problem goal problem goal problem system achiev effici gain goal scope improv test problem coverag improv coverag scope significantli improv test problem coverag level complex qualiti system improv base planner greatest improv realiz scope solut length goal problem greatest improv realiz solut length goal problem system significantli improv plan effici extens test scope scope achiev higher speedup factor logist domain improv test problem coverag domain qualiti scope significantli solut length system achiev improv logist domain system appli planner system scope learn control inform plan system learn search control rule improv perform pure approach emploi standard ebl techniqu explan propag rule gener acquir learn past plan failur learn analyt failur search depth limit failur search path cross depth order explain failur search path cross depth system util extra domain defin physic law detect explain inconsist depth limit failur note perform improv report number plan node examin cpu time valid method record plan fail report time spent match possibl achiev speedup limit rule explain failur util learn addit domain difficult imposs explain failur depth limit learn rule avoid long solut path identifi scope util combin ebl induct learn gener control ebl build rule shown improv plan perform domain domain compar scope experi replic kambhampati al experi version domain order test express domain influenc effect learner version simpl proposit precondit condit effect quantif condit quantif domain version present appendix experi consist domain version set train problem set test problem randomli gener problem block goal time limit test problem experi phase run strategi goal strategi experi point emploi learn system run search note scope run prolog version base standard lisp implement experi run machin differ result due factor prolog version solv test problem time limit lisp speedup factor incur system roughli compar tabl show result experi perform shown left scope perform shown perform vari wide domain version strategi speedup realiz goal select achiev high speedup factor scope hand achiev speedup experi experi speedup factor achiev scope low experi achiev greatest perform lower speedup due part fact base planner experi effici test problem time scope speedup train problem train train problem experi speedup factor reach test problem coverag scope outperform robust appli domain result combin induct ebl effect ebl improv perform plan domain scope scratch control scratch control time time time time achiev instanti goal achiev goal order tabl comparison scope improv effici system system appli decomposit planner type learn system develop plan effici approach acquisit learn separ control rule incorpor exist plan build problem solver base set train exampl similar util induct logic program construct combin empir learn train construct decomposit rule cover algorithm combin rule learn rule find gener gener rule form rule shown produc speedup plan includ variant strip world domain control domain produc speedup produc complet planner final planner produc solut test problem approach base learn decomposit base planner directli improv exist plan unlik improv problem solver attempt improv solut qualiti learn control plan qualiti research learn control rule plan direct improv plan effici research concentr improv qualiti plan produc planner promin system qualiti learn system built top nonlinear planner qualiti input set plan domain metric evalu qualiti plan set problem domain analyz differ plan initi produc planner plan qualiti input hand produc planner search solut found learn approach construct control inform lead higher qualiti plan control rule appli local plan gener learn explain plan control knowledg tree make global optim provid estim qualiti plan altern tree consist oper bind node plan problem gener problem search trace qualiti evalu process plan domain shown significantli improv plan qualiti domain qualiti necessarili improv planner effici produc longer plan time qualiti built planner unclear successfulli appli rule condit refer current state inform learn system improv qualiti run prodigi nonlinear planner techniqu develop ebl acquir control rule solut lsi design method similar qualiti learn make qualiti evalu function build rule limit type control rule build system concentr build control unlik qualiti system construct control knowledg tree repres control inform system moder improv planner test problem limit domain learn system address improv plan qualiti built prodigi nonlinear planner discuss section similar scope shown improv plan planner effici logist transport domain qualiti metric examin system length unclear improv qualiti metric mention unclear perform planner work plan qualiti util machin learn techniqu work concentr examin goal interact relat solut qualiti techniqu analyz type goal interact develop strategi deal commit oper plan strategi global view plan make oper select maxim plan qualiti criteria yang promot plan merg techniqu minim plan oper plan group work util theori improv plan qualiti plan system extens find optim plan util model measur qualiti partial plan approach gener high qualiti plan program gener plan machin process domain knowledg featur interact gener minim length plan gari planner gener plan metal cut constraint satisfact domain control knowledg encod gener domain inform form prefer rule chapter futur work number issu interest pursu futur research enhanc benefici scope algorithm includ incorpor method construct induct invent concept learn rule type point consid scope experi evalu perform type domain qualiti compar scope learn method interest appli scope type plan algorithm similar gain produc section discuss topic present idea implement enhanc scope algorithm construct induct share concept enhanc scope incorpor construct induct invent predic pool control rule drawn program predic main plan algorithm complet optim planner problem introduc concept control languag logist predic test object initi citi user provid scope extra concept definit form relat extra background knowledg method system learn concept automat construct induct techniqu implement ilp system zell scope learn accur effici control rule case concept make control plan refin make relat refin construct concept scratch control rule induct easi make newli construct concept simpl ad list predic control rule definit concept incomplet depend set train exampl construct problem remedi approach defin concept found choic cover posit control concept redefin merg origin set control exampl set induc rule cover posit exampl type concept share procedur reduc induct search make scope learn algorithm effici learn point scope design learn control rule point backtrack point portrai select enabl control inform easili incorpor learn success backtrack control inform unnecessari point plan point number past system learn control rule goal select goal select backtrack correct plan found order accur rule learn point backtrack control rule goal select case accur control rule learn scope unabl find rule rule neg exampl incorpor control inform goal select benefici point scope learn control inform select variabl bind establish goal initi state goal unbound variabl bind initi state establish goal initi state bind select backtrack experi test import test type domain test complic problem process plan small number machin made problem initi state number tool machin type control inform point point goal select bind select difficult cast problem prior plan option correspond select item list write examin item list option choic search rest list desir item control rule learn instruct planner select rule evalu accept item chosen search farther list evalu control rule util scope automat includ learn rule final set control rule util individu rule dramat vari rule low util lead lower perform commonli util lessen prevent includ control rule final planner rule util scope creat rule overli complex appli exampl incorpor method scope directli evalu util research introduc varieti techniqu determin rule save markovitch subramanian gratch appli techniqu evalu rule method easi integr scope learn system induct bia improv replac modifi standard foil heurist bia scope induct algorithm good rule result heurist experi heurist benefici possibl replac heurist metric directli measur rule util modif improv perform encourag system select control rule problem current heurist good rule discard cover neg control exampl rule consid cut backtrack potenti loss speedup scope benefit method handl noisi data emploi foil relat system lavrac scope small percentag incorrectli cover exampl treat good rule retain rule mark determinist procedur backtrack result lower solut time exampl problem correctli cover rule handl retain backup origin planner backtrack planner fail quickli incur extra time solv speedup gain exampl make approach benefici emploi failur inform research direct util inform plan failur learn effect control rule scope gener solut proof train exampl bia induct search approach util explan search path fail gener failur explan creat learn system bia induct search approach control rule directli util relev failur inform rule access set condit search path fail solv train exampl inform scope build effect rule accur avoid search path evalu interest conduct experi scope realist domain qualiti metric process plan extens experi run test wider varieti part problem type addit type problem problem requir part surfac finish coat hole part refin tap hole produc thread insid hole cut angular open top number domain test scope um domain extend version logist transport order magnitud larger size action complex featur goal interact packag deliv mode vehicl packag special load rout transport temporarili unavail detail set oper domain provid long plan solut problem scope evalu qualiti metric instanc um domain domain util resourc consumpt import qualiti measur experi compar learn approach scope pure test compar unclear ebl approach greatli affect type domain definit type strategi planner test express domain effect scope abil learn control rule compar system type domain evalu strength weak appli scope plan system futur nice demonstr scope learn limit improv perform type planner type planner promin plan commun todai network planner htn planner plan modif term task reduct rule reduct rule abstract goal lower level task set similar constraint found planner maintain htn planner method resolv conflict htn planner point control knowledg includ task reduct rule constraint resolut method htn planner argu research applic offer flexibl express domain knowledg htn algorithm good testb scope includ develop collag develop nasa research center breed planner consid combin techniqu kambhampati srivastava introduc plan algorithm cast plan method singl framework freedom interleav refin strategi singular plan veloso stone develop approach plan combin refin strategi flexibl approach order commit strategi vari problem domain strategi integr techniqu planner highli benefit learn control knowledg design advantag heurist knowledg choic point breed planner util proposit reason theorem prove techniqu effici solv plan problem kautz type planner oper differ tradit plan plan view search convert plan problem structur call plan systemat search graph solut kautz selman describ method reduc plan problem sat emploi satisfi algorithm stochast algorithm produc solut approach natur type plan unclear learn system scope effect appli improv perform candid benefit scope perform backtrack search plan graph continu attempt find set action map set goal solut found action select achiev goal backtrack benefit learn control knowledg approach reduc plan sat difficult base planner directli emploi satisfi search perform space learn improv perform algorithm benefici worth investig chapter dissert present approach learn control knowledg plan system approach set kei featur learn control rule approv plan effici approach concentr metric emploi program framework cast problem learn problem control inform easili incorpor learn successfulli combin ebl induct acquir control rule learn system develop automat acquir control rule planner examin past plan scenario cast problem prolog learn control knowledg incorpor planner immedi select plan refin control rule acquir combin machin learn techniqu gener bia induct search control rule control inform scope approach shown success learn control rule style plan learn system successfulli appli experi domain show scope significantli speedup planner improv qualiti gener solut logist transport scope produc faster significantli reduc solut optim solut scalabl scope demonstr logist gener planner solv problem higher complex level solv learn experi process plan domain demonstr main goal scope successfulli appli realist order magnitud larger domain test scope improv type qualiti improv effici scope produc set control rule gener solut separ qualiti metric significantli improv plan effici number test problem solv time limit scope demonstr outperform compet approach pure approach acquir control knowledg ebl approach shown improv plan perform type domain scope shown produc improv varieti domain type robust system ebl learn rule experi combin induct ebl effect ebl acquir control knowledg dissert present learn approach acquir plan control learn control inform improv plan effici method proven success learn control rule improv planner appendix domain definit domain definit list format domain oper predic defin op correspond oper precondit correspond list precondit effect correspond list effect domain main domain definit dissert list version domain version compar scope chapter version list version simpl proposit precondit effect version condit effect version quantif precondit logist transport domain logist transport definit dissert list process plan domain process plan definit dissert list domain definit axiom function axiom easili defin extra oper effect domain oper structur format function defin oper precondit call prolog function inform axiom function barrett al process plan oper process plan axiom process plan function temp temp temp true temp temp temp true materi true appendix learn control rule appendix set learn control rule logist transport domain rule learn experi report section scope train train exampl prolog version dissert predic backtrack point control rule learn find action predic select action achiev goal find exist action select exist action achiev goal select action predic decid exist action achiev goal appli constraint predic decid threat resolut strategi resolv threat logist control rule learn appli constraint backtrack experi bibliographi plan emerg marin oil spill ieee um plan domain develop benchmark plan system tech rep institut advanc comput maryland partial order evalu effici gain artifici al user manual tech rep depart comput scienc washington user manual tech rep depart comput scienc washington learn search failur machin fast plan plan graph analysi artifici increment learn control knowledg nonlinear problem solv european confer machin pp springer verlag lazi increment learn control knowledg effici obtain qualiti plan artifici intellig effici induct logic program sigart al manual tutori tech rep school comput carnegi mellon pa approxim learn search control knowledg sixth intern workshop machin pp ny refin learn plan intract domain eleventh intern joint confer artifici pp mi increment reason learn plan intern confer ai plan system chicago autom gener antenna oper approach telecommun data learn approxim control rule high util seventh intern confer machin pp tx altern view machin reprint read machin shavlik dietterich morgan san make antagonist constraint planner artifici htn complex express twelfth nation confer artifici pp seattl sound complet plan procedur hierarch plan intern confer ai plan system chicago learn search control plan thirteenth nation confer artifici pp acquir search control knowledg static analysi artifici statist method analyz speedup learn experi machin plan flexibl semiconductor manufactur environ intellig pp morgan san ca approach applic theorem prove problem solv artifici learn execut gener robot plan artifici theori algorithm plan merg artifici techniqu effect search control prune journal artifici intellig specif manufactur process plan tech rep school comput carnegi mellon pa probabilist solut util problem learn tenth nation confer artifici pp san ca incorpor redund learn preliminari formal analysi ebl eleventh intern joint confer artifici pp mi formal basi heurist determin minimum cost part ieee transact machin model expert level plan process phd robot carnegi mellon planner qualiti goal speedup learn optim problem intern confer ai plan system chicago rel util base plan partial order total order eleventh nation confer artifici pp dc failur driven search control partial order explan base approach artifici classic algorithm unifi plan direct ai pp amsterdam io press push proposit stochast search thirteenth nation confer pp role explicit contextu knowledg learn concept improv perform phd rutger tech report construct induct logic program tenth nation confer artifici pp san ca optim admiss tree search artifici learn weak method domain specif heurist cognit acquisit human plan eighth intern workshop machin pp scope criteria local plan fifteenth intern joint confer artifici pp ca induct logic techniqu applic elli horwood induct approach learn search control rule plan thirteenth intern joint confer artifici pp util method reduc inher harm deduct learn knowledg eleventh intern joint confer artifici pp mi regress plan intern journal intellig quantit result util learn seventh nation confer artifici pp st mn problem solv perspect artifici learn effect search control approach phd pa select gener plan problem solv ninth intern confer pp lo ca total order partial order factor influenc perform intern confer principl knowledg pp learn problem solv heurist machin artifici intellig approach morgan palo ca unifi view machin effect rule util learn eleventh intern joint confer artifici pp mi induct result learn past english verb journal artifici intellig machin invent predic invert resolut intern confer machin pp ann mi protein secondari structur predict machin learn protein induct logic program academ ny principl artifici intellig palo ca util background knowledg induct learn machin partial order planner adl intern confer principl knowledg pp explor middl ground strip situat calculu intern confer principl knowledg reason learn search control knowledg improv plan qualiti phd school comput carnegi mellon repres learn search control knowledg thirteenth intern confer machin learn control knowledg improv plan qualiti intern confer ai plan system il strategi plan eleventh nation confer artifici pp dc plan artifici goal method learn machin learn effici classif procedur applic chess end game machin artifici intellig approach morgan lo ca determin liter induct logic program eighth intern workshop machin learn il midterm report european confer machin pp vienna learn logic definit relat machin learn rule fourteenth intern confer machin pp relat constrain construct induct relat learn eighth intern workshop machin pp il util ebl domain eighth nation confer artifici pp ma lazi solut intract theori problem eleventh intern joint confer artifici intellig mi integr plan prodigi architectur journal theoret artifici intellig plan flexibl commit strategi journal artifici intellig learn analog reason gener problem solv phd school comput carnegi mellon system gener plan tech rep memo depart comput edinburgh introduct commit plan ai plan comput approach human reason ma optim plan util model intern confer ai plan pp chicago learn physic descript function nation confer artifici pp dc combin foil logic program thirteenth intern joint confer artifici pp franc combin method induct logic program eleventh intern confer machin pp nj induc determinist prolog parser machin learn approach twelfth nation confer artifici pp wa learn improv schedul artifici
AI/1633 2 ramif analysi causal map anthoni hunter depart comput scienc colleg london street london septemb abstract oper intellig agent constantli absorb ramif interest question knowledg reason ramif analysi determin outcom event occur event occur formal ramif introduc notion causal map model event existenti event instanc direct event instanc unchang causal propag inform determin ramif ramif term event whilst causal map offer lucid view support autom address problem repres condit ramif translat causal map default proof theori autom reason technolog default logic provid syntax semant causal translat default discuss integr approach engin default handl model graphic knowledg knowledg languag engin introduct order oper intellig agent effect event environ event result agent action result exogen call assess event environ ramif analysi train driver strike tomorrow ramif includ peopl difficulti work time turn mean meet run late poorli effect schedul meet subsequ week formal ramif intellig agent difficult problem gener call reason gener knowledg possibl develop ramif analysi constrain set event limit ramif determin outcom outcom aim determin outcom explor possibl qualit form reason adopt form possibl theori treat possibl equal focuss attent interact interest address issu incomplet reason framework ramif exploit symbol obviat complex integ continu variabl differenti qualit natur system model infer drawn model limit number valu qualit variabl describ inform dont intend restrict inform sourc narrow tv regard broader agent oper real world receiv inform commun agent observ world directli hear handl narrow word import applic ramif analysi short term address applic area detail section causal map outlin specif default theori structur graphic offer causal map facilit develop default theori causal map part approach knowledg engin default logic ramif analysi identifi ramif show causal map repres reason ramif show captur causal map default logic discuss integr causal map languag engin causal map causal captur causal relationship event section defin syntax causal map section present semant term truth valu section conflict reason causal map syntax causal map definit event ground monad predic predic symbol event class argument event event instanc event class set event class unlimit set event valu type event class existenti direct event class ff direct iff ff existenti event class inflat direct event form event class intuit event valu existenti event class ffl posit denot repres ff hold ffl denot repres unknown ff hold ffl neg denot repres ff hold intuit event valu direct event class ffl posit denot repres ff rise ffl denot repres ff unchang ffl neg denot repres ff fall existenti event refer observ hold discret period direct event refer observ measur continu regular point chang direct regard ramif analysi snapshot intuit assign event valu existenti direct event class definit report set event report inform regard point time event report reflect observ ramif analysi intend identifi ramif event report event class inform inflat report captur causal type causal causal defin definit ff fi event class causal relat ff fi iff event ff event fi inflat figur causal map inflat inflat definit ff fi event class causal relat ff fi iff event ff event fi causal strictli monoton function causal strictli monoton function assum hold order event valu causal map set event class connect direct arrow indic direct influenc causal defin causal map definit causal map direct graph set event class set label direct arc node repres event class arc annot direct arc direct influenc causal annot arc type denot causal denot causal arc similarli event class ff event class fi consequ figur inflat causal effect effect causal causal effect effect increasingli causal inflat inflat definit confluenc causal map subgraph head confluenc event class tail confluenc event class ff fi event class head confluenc event class tail confluenc head set tail fl function strictli monoton function iff function strictli monoton function confluenc figur problemat inflat event event confluenc problemat causal map ff event fi event event fl address problem section semant causal map semant causal map adopt semant causal map definit denot denot denot definit interpret function set event class set definit causal map report interpret model condit defin iff iff iff prioriti event report event deriv causal map reflect intuit causal relationship captur possibl report assum certainti definit prioriti propag figur model causal map intuit aspect definit semant interest propag perturb causal map unchang event class block rang possibl item default perturb identifi event default causal map figur model includ causal map figur model includ causal map figur model includ causal map figur model includ definit causal map report model inconsist consist iff definit report event categori condit contradictori proposit report casual map contradictori iff inconsist pair event event class oe event valu interpret definit satisfi condit definit violat condit condit violat condit violat condit contradictori definit transit closur denot smallest set satisfi definit causal map coher iff condit event class fi event class ff causal map proposit causal map coher acycl graph directli condit definit whilst acycl graph desir causal map ramif necessarili requir constraint causal map connect definit causal map report entail relat defin iff model iff model iff model causal map figur proposit casual map report event class definit constraint interpret function definit model complet model iff event class ff iff ff domain uniqu complet model iff complet model complet model proposit causal map report coher necessarili uniqu complet model coher contradictori uniqu complet model causal map necessarili uniqu complet illustr uniqu complet model cg complet model coher uniqu complet model coher cg uniqu complet model reason causal map restrict causal map confluenc includ linear causal figur diverg causal figur head reason straightforward assum causal map figur linear causal map hj figur converg causal map coher report transit closur causal map event infer relat obtain infer infer infer infer infer causal map confluenc restrict gener causal causal map captur figur knowledg aircraft market cost aircraft develop effect observ pronounc deriv unit cost aircraft produc figur diverg causal map downward pressur profit aircraft obtain industri compani aircraft manufactur interest bought aircraft manufactur ramif unrestrict address problem reason confluenc figur inflat remain option introduc extend theori propag introduc extra inform resolv conflict head adopt option defin notion resolut tabl definit resolut tabl head fl denot fl tail ff confluenc column fl label ff column tabl label fl fl combin event valu determin event head resolut tabl tabl confluenc figur find row resolut tabl correct event valu tail read event tail event tail event tail inflat event read event head gener notion causal map formal resolut tabl definit tabul causal map denot causal map set resolut tabl head fl resolut tabl denot fl definit fl resolut tabl head fl fl row fl combin element tabl incomplet fl combin element row fl fl inconsist provid semant tabul causal map definit tabul causal map report interpret model condit hold fl fl fl figur causal map show ramif profit aircraft manufactur inflat hj figur confluenc inflat tabl resolut tabl confluenc figur head fl fl fl fff ff fl resolut tabl row xn fl event event class ff xn event event class ff xn tabul causal map resolut notion requir definit definit tabul causal map report entail relat defin iff model iff model iff model definit tabul causal map report model inconsist consist iff consist definit model complet model iff event class ff iff ff domain uniqu complet model iff complet model complet model proposit tabul causal map report fl complet uniqu complet model ff event event class ff consequ ff head resolut tabl ff uniqu truth hold uniqu complet model resolut tabl consist complet tabul causal reason express classic proposit logic definit tabul causal map function translat set classic proposit formula fff ff ff xn fl fl tg fi fi tabl incomplet resolut row miss truth truth definit tabul causal map report function translat set classic proposit formula ff ff ff ff ff pg proposit tabul causal map coher fl complet report event oe iff oe classic proposit logic consequ relat event class ff valu handl similarli hold hold definit definit hold ff head ff head ff head definit resolut tabl ff head row xn ff ff ff definit ff ff ff definit hold ff head definit handl definit definit proof similarli proposit tabul causal map coher fl complet report event oe hold determin polynomi time calcul determin polynomi time calcul oe hold determin polynomi time tabl inconsist resolut row truth truth set definit algorithm theorem prove definit time upper limit time oe hold whilst argu causal map lucid constitut rout develop ramif requir handl incomplet report resolut tabl handl incomplet resolut tabl autom reason tabul causal map express facil add condit causal relationship confluenc address requir section default logic incorpor causal map default logic graphic offer lucid abstract complex system ramif autom reason causal map translat causal map default logic present method translat gener causal map default theori mean exploit default theori effici causal map default logic technolog autom reason causal map remind default logic basi repres default knowledg emploi default logic origin reiter default logic wide studi default reason offer express lucid languag default knowledg repres default consist set formula set default rule repres default inform default rule fi fl ff fi fl infer rule classic logic special mechan deal default ff infer fl ff call fi call fl call consequ set formula deriv default theori call extens extens set classic formula extens default theori default logic extend classic logic classic infer classic inform default theori deriv default theori augment classic infer default infer deriv default rule method obtain extens default theori definit definit introduc oper set set classic formula definit determin extens default theori definit default set classic set default rule set classic formula function set formula return set classic consequ formula smallest set classic formula condit satisfi default ff fi fl ff fl extens iff view set formula ensur consist justif default rule attempt appli view set default close classic default applic precondit justif satisfi consequ smallest ensur default rule appli ground mean case default rule singl default rule satisfi consequ test ensur set formula justif check consist coincid set default theori condit ensur set classic formula condit ensur extens close classic condit ensur default justif consist consequ extens set default extens chosen default logic formal ramif analysi formal default knowledg rang inferenc technolog develop review default logic offer natur straightforward rout develop ramif analysi translat causal map default logic section identifi number requir causal map resolut tabl address requir proof theori reason causal support autom handl incomplet resolut tabl translat tabul causal map default theori definit map translat function coher tabul causal map report return smallest default theori condit assum element complet consist event class default rule fi default rule fi default rule head fl resolut tabl tupl xn fl event class ff event class xn ff default rule ff ff event class formula oe oe tabl default theori tabl default theori default rule resolut tabl repres default econom number form logic econom set rule repres rule logic tabul causal causal map figur resolut tabl tabl properti causal map default logic proposit model extens iff argument hold result condit definit condit condit ff head default rule condit argument previou case condit default rule ff ff ff ff argument similarli proposit extens model iff analog proposit proposit tabul causal map coher fl consist report event oe iff extens oe oe case proposit tabul causal map coher fl consist report uniqu complet model proposit proposit uniqu extens oe similarli translat tabul map default effici minim model tabul causal model obtain handl incomplet inconsist resolut tabl ad constraint previou address requir section address requir section express causal map facil add condit causal confluenc figur confluenc invest fiction region airlin happi receiv due unexpect sharp rise fuel price happi air issu profit warn knowledg lead happi air airlin issu profit warn due background evalu ramif includ happi air happi air futur ramif ramif ramif invest happi air lost causal gener repres regard default rule gener address ad constraint rule fact compani pharmaceut pharmaceut valu million dollar dollar share dollar share tabl instanti templat summari friendli tabl instanti templat fact gener drive infer appli default deriv view causal map tabul causal map tabul abstract default theori regard causal map tabul map intermedi step develop default regard knowledg engin techniqu integr languag engin languag engin concern technolog inform form natur includ area rang inform inform natur languag natur languag machin translat relev area languag engin call inform extract area concern transform natur languag text reduc refin highlight pertin remov superflu inform integr ramif analysi inform feed extract inform directli ramif analysi inform extract linguist interactor translat system base gener natur languag process appli domain short summari deriv articl specif criteria approach templat incorpor predefin number type slot slot fill inform extract articl schemat base kei type activ templat type slot templat produc sourc articl templat summari slot compani valu slot compani instanti templat deriv articl complet templat reli underli natur languag system incorpor node semant network articl billion inflat tabl instanti templat econom month billion inflat tabl instanti templat econom month cess relat concept articl semant network templat complet search relev inform semant network feed output ramif analysi rule identifi event class determin correct event class event class interest snapshot predict ramif valu templat valu point causal map figur chang tabl tabl obtain event month event default theori outlin section develop approach lexic lexic knowledg increasingli import languag engin interest semant knowledg word reason deriv except context cook lexic knowledg facilit identif relat special word identifi engin relat actor actor terrorist action terror handl lexic knowledg default logic incorpor bridg differ word inform extract word ramif analysi synonym word output inform extract flag ramif analysi sensit actual predic symbol event class paper discuss import ramif analysi agent handl agent determin outcom outcom introduct causal map formal repres reason ramif includ proof theori translat causal map default logic order exploit theoret technolog advantag default discuss integr ramif analysi natur engin causal map view knowledg engin technolog default logic model system term existenti direct causal intuit wider audienc default logic directli open opportun develop graphic tool engin manag kind inform model relat causal cognit map cognit direct label graph captur structur state belief problem cognit map form ramif analysi uncertainti causal handl rang approach bayesian network review direct acycl graph repres causal relat random variabl causal relat identifi independ assumpt random variabl facilit effici reason condit probabl whilst bayesian network provid form ramif natur ramif analysi fundament causal map provid mean ramif chang random variabl dictat probabl distribut axiom probabl theori qualit network qualit form probabilist network review reason qualit network qualit dictat qualit probabl distribut axiom probabl fundament reason causal map limit formal cognit map approach handl uncertainti causal network possibilist network review direct acycl graph repres casual relat possibilist variabl possibilist network provid form ramif natur ramif analysi fundament causal map provid mean ramif chang possibilist variabl dictat possibl distribut axiom possibl theori causal map complementari varieti approach argument exampl formal argument causal map view form argument refer antoni reason mit editor structur cognit map polit elit princeton ph introduct default logic brewka reason cambridg morgan natur languag process automat extract inform articl magazin artifici intellig morgan inform extract system templat articl intern confer inform technolog cowi lehnert inform extract commun gallier algorithm test satisfi proposit horn formula journal logic hunter argument reason classic inconsist inform data knowledg engin formal framework causal model argument gabbai practic number lectur note comput scienc editor handbook logic artifici intellig logic volum reason uncertainti reason oxford kruse background perspect possibilist graphic model hunter applic uncertainti lectur note comput scienc hunter intellig text handl default logic eighth ieee intern confer tool artifici intellig hunter default logic lexic knowledg qualit quantit practic volum lectur note comput page hunter reason lexic knowledg default logic natur languag submit introduct bayesian network ucl parson qualit method reason uncertainti mit argument framework default reason annal mathemat artifici volum logic tool model legal argument reiter default logic artifici autom reason incomplet volum lectur note artifici intellig logic handbook reason uncertainti volum wellman qualit network plan uncertainti uncertainti artifici intellig
HCI/1634 4 interact haptic paint virtual brush bill baxter vincent ming lin depart comput scienc north carolina chapel hill present paint system intuit haptic serv express vehicl interact creat work introduc brush user natur control complex brush stroke forc feedback enhanc realism tactil cue enabl user manipul paint brush develop paint model combin palett enabl easi load complex blend virtual brush gener interest paint effect canva result user artist conceptu paint environ user test start creat origin art work minut human comput paint deform brush model introduct art paint refer aesthet aspect work craft paint deal studi includ paint manipul materi express intent art craft paint close artist divorc recent technolog advanc comput graphic larg center art attent craft commerci paint system recent research gener work final product word describ fusion feel sight produc imag artist impress focu primarili render equal merit recreat action artist process design set artist freeli creativ express tradit paint comput graphic serv conduit craft main contribut primari goal provid express vehicl interact creat origin work comput system present deform brush user control complex brush stroke intuit haptic feedback enhanc realism tactil cue enabl user manipul paint brush figur origin work creat develop paint model combin palett enabl easi load complex blend brush model gener interest paint effect canva attempt provid minimalist interfac requir complex control offer great deal express power haptic paint paint creat devic space bar keyboard comparison exist comput paint approach offer natur express mechan manipul paint includ paint simpl easi load complex blend virtual realist brush footprint gener automat brush intuit familiar feel paint process requir train haptic paint test number user novic user start paint minut simpl instruct fig show paint creat amateur artist familiar conceptu paint artist control virtual brush real brush interfac combin exist interact paint program effect train system paint prior work number research develop automat method transform ordinari imag imagin render develop method simul rai origin program recent approach ca commerci packag painter achiev realist simul natur media clever textur composit trick amount train requir profici commerci paint system complex involv obtain stroke skill painter model research endeavor accur model real brush techniqu heurist model brush arrai swept trajectori defin cubic spline curv work account number effect achiev actual vari wet wong ip defin complex set interrel paramet vari shape footprint account behavior round brush result stroke inform physic behavior physic gener method partial interact approach brush model share similar theme work model physic brush sumi paint techniqu flexibl term brush advantag graphic hardwar user al user paint directli model standard graphic hardwar map brush screen space model commerci deep paint user paint directli accomplish standard brush footprint project surfac object brush advanc commerci support input sophist tablet posit pressur paramet ignor tilt discuss tablet system section idea paint explor rigid brush control input devic color surfac paint system restrict brush organ rest paper organ section overview approach user interfac present model paint brush section forc displai haptic devic section section describ techniqu render paint briefli highlight implement prototyp paint system haptic interfac demonstr featur actual paint volunt section figur system architectur approach section give overview approach user interfac haptic paint system overview develop deform brush model integr haptic interfac haptic stylu serv physic metaphor virtual paint brush posit orient brush displai contact forc brush canva user brush model particl system skeleton surfac brush deform expect collid canva framework wide select brush type made artist paint model support import featur bidirect paint complex brush load surfac palett coat paint model schemat diagram shown fig illustr system compon integr user interfac phantom haptic devic pentium iii pc graphic card processor dedic forc displai comput brush dynam paint transfer blend fig show physic setup system figur haptic paint system artist haptic stylu paint directli virtual canva haptic paint system user paint directli virtual canva displai screen space bar user bring virtual palett paint mix brush put palett paint directli canva user present wide select virtual brush mimic type shape brush tradit paint simpl menu present save load clean paint undo brush quickli dry canva partial fig show snapshot graphic user consist virtual canva paint brush deform physic user move brush canva user creat stroke behav real brush actual footprint brush result stroke gener base manipul brush virtual canva tabl show real model structur surfac stroke gener figur graphic user virtual canva brush portion palett brush palett color mix model brush paint brush regard import tool good set brush enabl compet artist creat virtual effect intric detail subtli blend shift hue sunset describ techniqu model virtual brush introduct brush figur basic brush anatomi fig show anatomi typic brush brush head made varieti natur soft anim synthet materi common style brush paint round simpl shape great varieti stroke flat wider round squar point flat typic longer wide bright shape construct flat typic width equal length thicker collect abil hold paint head type specialti fan versatil wide column tabl show imag type overview model approach model paint brush requir develop geometr model dynam behavior requir interact haptic paint system place constraint brush dynam run interact rate remain stabl type user manipul model brush head surfac mesh wrap particl system skeleton particl system reproduc basic motion behavior brush deform mesh skin skeleton repres actual shape head deriv approxim implicit integr method base exist numer techniqu cloth simul larg integr step maintain stabil brush model simplist design captur essenti qualiti physic brush maintain interact minim comput cost base gener brush adjust kei paramet gener type shape brush mimic physic behavior tabl show geometr structur construct brush section show deform brush make contact canva brush dynam difficulti simul paint brush paint brush numer stiff dynam suffer numer instabl mass energi store induc larg veloc brush behav highli damp system properti improv stabil solver consid evalu numer method particl system found approxim implicit integr present effect primarili stabil simul brush approxim implicit integr variat base dynam dynam motion particl system repres brush mathemat order differenti pair coupl order differenti ú ò vector spatial coordin ò ú ò vector particl ò vector forc particl ò diagon matrix diagon entri form mass particl method simul deform object approxim solut equat motion implicit integr linear forc compon approxim account forc compon deform constraint enforc prevent excess stretch result solut accur integr present witkin stabl demand speed advantag separ linear forc solv equat motion multipli step tion step á ð ü ú ð ü linear forc compon handl integr á ü constant matrix method work gener weak bend brush approxim effect forc compon lead local error angular momentum observ brush solver effect ignor stiff bend lead brush angular motion achiev stiff brush behavior depend skelet structur section discuss brush construct detail final step method applic deform constraint particl assum travel induc excess stretch materi correct simpli alter posit iter contract spring materi elimin deform constraint plai major role stabil system ensur end spring physic plausibl configur handl contact particl found penetr canva project nearest point surfac add friction drag forc collid particl realist result model friction drag coeffici friction dynam real empir obei model lack inertia object move durat forc appli inspir simplifi model simul brush advantag case usabl dynam motion particl system repres singl differenti å object stop move instantli absenc result motion heavili brush behav order simul damp requir ad larg damp forc system cancel larg veloc induc stiff spring physic circumv step modifi approxim implicit integr formula order ð á ü ð ü equat form eqn integr techniqu remain unchang except omit friction damp forc modifi order model effect brush surfac surfac geometr brush head abil repres arbitrari topolog vertic arbitrari valenc easili brush head surfac defin control point anchor rel mass particl interpol approxim scheme brush surfac interpol scheme task reason control vertic rough limit surfac pass vertic level limit facilit chang tessel level mesh due frequent high curvatur result interpol surfac deform smoothli expect brush approxim scheme gener surfac gener smoother difficult place control point achiev desir surfac extens loop approxim scheme present accur model sharp featur fine taper point round brush implement chose triangular base mesh subdivid interpol rule make task gener brush control mesh easier result tabl brush gener dynam model full set brush suitabl creat wide varieti paint type brush model singl spine linear chain ò particl integr method model softer style brush call brush work order dynam make brush solid elimin oscil model oil complic skelet structur basic build block stiff brush mass particl connect spring form pyramid round brush consist particl form base rigidli fix brush handl directli driven input particl serv point brush tabl show summari brush model exampl stroke gener wide brush form gener outer shorter brush structur defin entir famili brush size parametr vari scale cardin ax haptic displai import aspect paint system abil provid suffici good forc feedback emul sensat appli brush stroke canva input devic serv forc output devic align virtual physic posit point forc deliveri coincid point head meet handl virtual brush present approach forc displai decoupl haptic separ forc comput brush deform goal deform constraint approxim implicit solver accept approxim visual aspect brush forc simul forc updat haptic feedback gener close smooth deform calcul proce visual updat rate decoupl forc simul brush dynam simplifi forc comput run khz rate basic forc model root forc model simpl linear function penetr depth brush point penetr depth length brush head project canva forc model ò ò small posit constant model light spring larger posit constant simul actual brush handl canva spring constant normal absolut forc deliv handl hit brush length orient chang simul brush vari stiff compress effect real brush contact canva close stiff initi act strong compress transmit abrupt forc handl pressur compress forc reduc bend forc brush make contact obliqu compress effect plai lesser role forc felt extend linear eqn curv curv defin seri control tupl penetr depth forc linear stiff spring model point deriv empir observ brush head behav compress initi segment curv model compress forc assign initi control tupl fairli strong linear spring constant simul initi strong compress forc modul compress forc angl multipli forc control tupl coeffici angl canva normal negat direct factor result compress forc strongest brush contact canva angl taper brush approach angl canva friction forc final compon forc deliv user small amount tangenti resist small friction forc larg effect perceiv abil control brush damp small oscil hand model friction ø forc opposit current brush ad feedback ø ò ò coeffici friction paint model complement express brush forc present paint model capabl captur complex effect interact paint model incorpor variabl wet conserv paint transfer algorithm support oper techniqu expect oil maintain complet interact blend mix multipl obtain desir color transfer transfer paint brush back canva brush complex brush load fill portion brush head variabl control blend paint previou layer paint partial dry paint layer color opaqu color paint thick volum paint addit medium user gener similar result advanc paint program paint manipul virtual brush similar real order automat gener intend paint effect paint transfer paint inform store canva brush multipl textur section brush surfac tessel polygon surfac surfac intersect canva brush consid contact canva transfer correctli modifi paint textur simul paint volum interchang surfac figur displai brush stroke paint transfer figur paint transfer demonstr drag yellow paint stroke wet purpl paint purpl paint appli dry paint paint transfer problem reduc dimens simplifi comput introduc slight inaccuraci gener project plane chosen maxim area project intersect curv brush canva surfac implement canva plane orthograph project brush achiev polygon raster speed implement project textur brush brush footprint textur updat simul paint transfer mix blend footprint canva discuss section simul brush produc discret instanc brush produc continu stroke blend oper perform line connect current footprint previou centroid footprint polygon endpoint method smooth stroke footprint chang dramat blend updat textur reappli surfac achiev render variat brush surfac mesh surfac vertic project footprint textur coordin updat footprint textur origin surfac textur coordin vertex locat render back textur map paint brush transfer method present combin media type system includ model approxim oil famili paint paint surfac color layer refer layer surfac cover thin surfac underli deep layer surfac layer boundari paint transfer object occur surfac layer complet wet deep layer repres paint complet dry deep layer repres reservoir paint paint transfer surfac layer occur object brush transfer reservoir layer surfac perform surfac layer longer satur paint remain reservoir dry paint surfac layer dry layer occur time interv request user surfac deep layer store color textur volum paint layer store attribut textur surfac layer brush reservoir layer fix point dry layer canva special rel height section paint mix amount volum transfer surfac layer depend volum paint layer volum comput initi transfer ì ì ê result paint comput weight portion remain volum incom volum color î ð î ð essenti addit composit formula easi work predict model mix model model accur composit significantli higher comput cost optic composit gener realist paint wet dry layer canva composit paint volum illustr fig volum wet multipli optic alpha blend wet dry layer dry canva paint model support variabl wet shown fig variabl wet accomplish gradual move paint complet wet surfac layer canva complet dry deep layer figur variabl wet displai yellow paint paint purpl color stripe composit color paint chang dry optic blend function constraint solv dry layer remov wet layer dry layer canva rel height field unlimit volum paint constraint rel chang height height field comput addit blend combin color buffer creat final render imag paint implement result develop prototyp paint combin virtual brush haptic interfac paint paper mention section graphic user interfac consist main palett brush absenc stereo introduc shadow graphic displai enabl user infer rel posit paint brush virtual canva discuss palett painter mix creat unlimit number present possibl simultan unifi interfac creat complex color palett easi creat singl simpli mix constitu color real palett natur interfac color advantag previou comput paint system advantag palett interfac requir virtual brush present paper virtual load complex blend creat palett creat stroke blend combin input offer power simpl interfac paint chose desktop phantom input haptic feedback true input excel low offer fulli programm forc output input devic tablet offer input freedom larg tilt measur pragmat forc feedback enabl user detect maintain contact canva shadow cue provid tablet physic surfac serv sensat rigid pen hard flexibl brush canva user tablet system haptic devic prefer soft feel forc feedback brush simul fulli programm chang feel brush make softer harder instanc plan detail user studi evalu assess forc feedback creat artist programm forc feedback devic true workspac enabl possibl expand system number excit direct cover section user feedback fifteen user paint system group user includ amateur art male ag rang earli late prior experi comput paint program user interfac user pick haptic stylu start paint train detail instruct small select artist creation shown fig addit imag art work creat detail screen supplement materi project websit user work paint program found paint system intuit artist prior paint paint system substanti easier adapt paint offer similar undo brush dry attribut fact offer paint environ advantag skill transfer appeal peopl artist painter comput paint system futur work user type found compel work aspect system extend improv accuraci brush deform continu investig effici integr simul method interest simul greater rang haptic phenomena feel paint variat sensat type brush paint medium natur step paint surfac paint geometr model current paint model extend depict advanc characterist oil paint effect anisotrop multipl wet layer render paint bump interest implement model composit expand set virtual tool includ type brush artist tool interest initi observ small group amateur art novic approach effect plan conduct extens formal user studi larger group user confirm evalu effect contribut factor interfac design acknowledg grate peopl evalu system paint drawn includ paper anonym review comment research support part aro doe ascii nsf nsf nsf onr young investig intel refer paint scan surfac proc symposium interact page acm april witkin larg step cloth simul proc acm page proc page corel painter england model textur paint comput graphic forum barr interact anim structur deform object proc graphic lin interact multiresolut model paint haptic interfac proc ieee vr stuetzl smooth surfac reconstruct acm page deep paint render curv brush stroke multipl size proc acm page direct paint textur shape comput graphic volum page august thompson cohen paint textur haptic interfac ieee virtual realiti process imag video impressionist effect proc page mayer handbook materi techniqu meier render anim siggraph confer page august rai smith paint tm comput graphic juli physic base brush model paint confer abstract page brush comput graphic witkin physic base principl practic acm wong ip virtual synthesi comput figur paint baxter rebecca figur paint rebecca figur paint rebecca figur paint rebecca figur paint andrei state figur paint lauren adam figur paint sarah hoff
HCI/1635 4 context awar mobil phone peter ljungstrand plai research interact sweden paper investig aspect support user mobil call parti mobil stationari phone discuss relat situat properti phone benefit context initi hypothesi mobil phone user commun context inform higher stationari phone user mobil phone user benefit context awar make receiv context inform person reach prior establish call argu technolog requir low amount explicit user lead disrupt call inappropri frustrat call parti call answer comput mediat context distribut context mobil mobil network find context commun social convent determin wai initi commun technolog advanc provid numer possibl commun technolog disallow peopl follow tradit strategi develop interest structur develop result sensit technolog telephon larg man servic order distribut incom call person special secretari assist answer phone proper call call back encourag form commun book work effect inform filter ow hierarch structur plethora commun peopl everydai life overload commun find counterpart secretari assist normal user sensor technolog combin proper london person ubiquit comput softwar automat gather context inform surround filter mechan support recipi call altern adapt contextawar devic role secretari address origin phone call context creat technolog decid import harder present proper inform user decid burden decid receiv messag commun overflow sender part activ place call provid call parti inform current context person make make decid initi commun determin channel paper awar revisit number system develop support awar inform research commerci exampl includ video window porthol onlin instant messag servic icq mobil awar devic hummingbird awar system provid cue proactiv work trigger mechan initi commun absenc trigger commun porthol inform offer user lightweight mean find avail primari porthol function distribut context awar order select commun channel video stream larg amount provid wai select distribut context level abstract depend request phone technolog current phone technolog provid context inform user network caller phone number incom call mobil phone explicitli select predefin context notif cue phone call sound level vibrat possibl phone number overrid current give audibl signal meet filter incom call limit techniqu person call introduc asymmetri exist asymmetri uncomfort caller speak mobil stationari phone current mobil phone inherit design stationari design user natur ring talk phone social act easili understood watch mobil phone differ substanti stationari phone stationari phone typic mobil phone person context place context person call stationari deriv context person call factor time hold true mobil phone extent begin mobil phone common describ contextu situat includ current place describ context person common repeat person describ peopl group call state context present situat convent mobil phone behaviour common mobil phone stationari interest implic appli context al model contextu feedback human distinguish commun check messag situat environ state person call type feedback contextu feedback reduc context infer ambient audio tone speaker current telephon contextu inform abstract transmit verbal great opportun incorpor technolog mobil telephoni system context support recipi automat chang profil context suggest extend distribut context inform context awar mobil phone call call avail function telephoni network lead fewer disturb busi peopl inappropri moment lead frustrat person make instanc phone silent meet cinema person make call wait commun channel email al relat introduc feedback loop contextu inform mobil commun network context inform system call parti select commun channel current situat automat privaci commun present user inform person commun initi system reli user explicitli select mode time icq simpl automat context keyboard activ activ mode type context inform deriv sensor describ state accur explicit user kei factor success system order gain accept ordinari state busi busi privaci concern control inform phone transmit inform peopl privaci user benefit perceiv larg privaci loss accept case gsm posit system caller evid crimin surveil ljungstrand awar system success gain accept larg number user reason awar introduc artifici awar present continu distract case mobil peopl commun context verbal introduc technolog support support exist practic introduc continu attract attent mobil network technolog system avail digit network distribut contextu necessarili person context gather benefit commun contact person reason select commun channel mobil phone call call parti gener access aspect context person commun commun channel phone call discuss appli extent channel interperson commun refer schmidt al advanc interact context gellersen handheld ubiquit lectur note comput scienc ljungberg nunamak hawaii intern confer system scienc ieee comput societi volum dourish bly support awar distribut work group acm holmquist falk support group collabor awar devic person technolog hansson ljungstrand remind subtl notif cue mobil devic extend abstract acm van context expect hci intern citi birth mobil inform societi peopl mobil phone call environ plan societi space van commun context intern workshop mobil comput system applic ljungberg person orient approach mobil commun extend abstract acm correspond peter plai research interact box sweden context awar mobil phone
DB/1636 3 increment mainten materi oql view ali dept comput scienc manchest manchest uk aa fernand dept comput scienc manchest manchest uk norman paton dept comput scienc manchest manchest uk abstract import materi view grown signi cantli advent data wareh olap technolog relev solut problem increment maintain materi view work problem con ned relat set appli object model fallen short provid framework paper contribut solut increment view mainten problem larg class view express queri languag odmg standard object solut appli updat work updat oper view de ned substanti subset odmg type approach present fulli implement preliminari perform result report introduct view de nition facil valuabl applic time pro tabl materi view comput extent time view problem propag materi view made entiti mv de ned costli entir mv time chang made ect gener desir propag comput mv ect materi entir view interest mv result grow awar import role plai data wareh context import greater consid distribut network bottleneck make ecienc gain accru view materi desir view materi unavoid inform integr practic comput view permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee usa copyright acm de ned data sourc work motiv manag data replic context scienti data wareh project genom data case challeng pose complex structur data model complex behaviour make approach option paper structur section introduct technic background section describ solut problem algebra approach section present preliminari perform result implement solut section describ brie research context contribut present paper contrast work research section conclud point futur work technic background section introduc exampl odl oql materi paper brie describ queri process notion speci calli implement odmg standard object includ object de nition languag object queri languag familiar model assum paper odl declar schema ne valid applic type figur odl schema class person extent person attribut string attribut short attribut string class depart extent depart attribut string attribut string relationship set class extend person extent attribut long attribut set relationship depart dept attribut figur odl schema figur depict oql queri figur view de ned queri view de ned assign oql queri speci es variabl provid data valu view select depart defin select depart figur oql queri view system implement monoid calculu monoid algebra odmg object model includ arrai oql queri rst translat express normal translat monoid algebra express optim map physic execut plan execut plan translat compil result evalu origin oql queri adopt queri process approach close resembl mainstream dbmss act essenti translat sourc code exploit function provid shore object dbm solut present paper manipul algebra express db gener oql queri detail monoid algebra figur algebra form fig view figur algebra express top figur algebra oper occur monoid bag indent figur tree level root reduc node join node node children oper speci es extent scan variabl rang object extent retriev condit case true join oper speci es input argument valu join condit speci cation kind join perform natur join denot keyword monoid retriev condit true reduc oper de ne structur result return intern variabl refer instanc structur consist bind express ned attribut bound request ned express algebra express top figur di erent relat bottom oql queri figur make nest unnest oper unnest oper iter collect object object collect project object compon element express subqueri map unnest oper nest oper essenti construct collect element suppli queri figur nest oper figur construct collect type assign ned variabl dep select select figur nest unnest queri odmg solut increment view mainten problem present avail updat made refer mv de current materi state view order achiev goal increment maintain updat assum avail refer base object contribut data base extent requir materi base object extent kind solut work mv refer nabl type arrai dictionari de nabl nest unnest bulk oper monoid algebra valid updat oper odmg standard insert term solut yield increment mainten plan algebra level rst make easier integr solut kind queri process framework mainstream manag system reli mv de ned subsequ de nition kind updat event requir propag mv event includ deriv odmg context result engin requir enforc referenti integr constraint declar mean construct kind algebra imp construct comput requir mv core solut gener imp kind updat event kind imp suce comput requir mv result updat oper odmg standard immedi updat event place impli updat delta state ect made imp evalu comput natur solut respect updat oper requir oid object contribut data mv materi view compil gener mv de nition view de refer oid evalu materi oid object contribut data instanc oid instanc oid space overhead natur induc time present solut exhaust set oper odmg standard keyword distinct oid remov instanc oid instanc distinct deriv keyword order attribut oid extent oid share order extent top part figur show oid gener string ital gener imp start algebra queri tree denot oid contribut object algebra queri tree algorithm start algebra queri tree result compil view de nition deriv refer oid project ident includ attribut oid origin extent occur keyword distinct oid project includ set semant bottom part figur show oid project gener string ital note contrast oid oid project materi extra inform deriv event monitor identi ed imp gener di erent form imp gener depend updat properti plant delta kind construct imp comput requir evalu oid project delta ect base base extent access base extent referenc mv ect insert extent defin oid select distinct ve vd defin oid project select distinct depart figur deriv view fig materi state figur delta insert simpli imp gener solut algebra form top figur di erent evalu plan deriv oid project rang delta access depart imp result instanc oid project input algorithm appli mv oid join delta materi oid kind imp construct system join oid delta order identifi mv object ect updat idea avoid access base extent ect modifi case algebra form bottom figur inform delta identifi object mv ect delta refer updat handl delta instanc mv data contribut ect imp join oid delta oid object imp result input algorithm appli mv oid assumpt underpin remaind section made explicit algorithm oper algebra express repres tree oql express queri part view definit figur algorithm assum straightforward token grammat categori set token categori occur express figur sourc categori interest algebra express shown oper extent object attribut intern categori interest collect depend figur notic global uniqu assum context inform concaten make concaten oid mat figur imp fig modifi constru token function notat denot metadata attribut denot type attribut denot extent type write contrast denot domain valu express drawn relationship denot relationship collect attribut denot type element collect figur show process place wake de nition mv shade box denot compon assum exist clear box denot compon extens exist requir section describ clear box figur oval collect process place updat propag time materi evalu deriv extra inform compil compil materi evalu materi algebra queri tree appl compil mainten gener plan event chang view updat mainten event monitor base type extent initi materi algebra queri tree oql oql base type extent algebra queri tree oql figur process view compil time respect extens box label requir extend evalu subcompon make persist instanc return result execut queri assum materi process encompass set type store data metadata requir process box label deriv extra inform figur simpl syntact map de nition mv addit view de oid oid project mean note oid materi imp oid project materi algebra form construct imp kind event imp pair figur present algorithm de ne function box label event monitor figur abbrevi del mod model note gener event speci cation design updat oper odmg includ collect type dictionari arrai de ned monoid algebra figur view meant express form scope scope var figur view meant list var introduc scan attribut introduc schema de nition relationship relationship refer attribut figur paper function inform de ned return set attribut project type queri figur show arrow event speci cation return view bottom figur arrow sourc syntact featur view de nition induc event speci cation target illustr execut algorithm figur notic updat extent scan view monitor rst iter scan updat attribut collect possibl relationship mention view monitor iter path express view de invok path express scan induc monitor insert delet extent attribut induc monitor modi cation type updat instanc type de ned recal type imp mv plant delta oid project join delta oid box label gener mainten plan figur implement function depend event type mv decid type imp figur de ne condit mv type deriv algebra express repres mv mean oper row algebra express mean mv figur view algebra shown figur join oper view classi ed rightmost function foreach scan extent fin del od foreach od return function case return base case iter scan attribut handl collect relationship mod arg del arg arg collect mod arg collect arg mod collect type arg attr attribut collect element foreach attribut attr model od relationship arg del arg arg collect mod arg collect arg relationship handl continu return figur event monitor eo depart depart select dept depart distinct figur event speci cation fig figur unnest nest reduc join unnest nest figur classi cation algebra oper figur de ne event type mv kind imp gener figur note abbrevi phrase meant attribut occur condit express figur ca ca attribut queri meant data delta ect state updat meant data delta ect state updat state relev object delet longer state essenti mv meant imp gener plant algebra form oid project meant gener imp algebra form join oid similar remark appli note imp gener ca modi case attribut imp gener attribut reconstruct object made mv basi gener imp output imp mv object delet algebra form imp gener plant delta top figur gener join delta oid bottom figur event type attribut question mv exampl figur intuit entri figur access requir base sucient lter data provid delta extent referenc replac delta algebra express plant object creat particip view view evalu delta identifi object contribut view requir access base data avoid access base data discuss improv explor futur work view type case event type plant plant plant plant oid plant plant oid plant plant oid plant plant oid plant plant oid plant plant oid plant plant plant plant plant oid plant plant plant plant figur mainten plan updat oper row figur chang object contribut ect data project view join delta oid sucient identifi object view ect updat modifi attribut includ condit row object view lead object ad view identi ed join oid requir access base data plant unnest inform collect unnest member view increment plan relat view gener requir access base data case data gener link directli object nest collect access base data order comput view increment unnest nest view comput plant relev delta reason omit explicit descript algorithm denot cell figur compar view figur exampl figur idea transform ect algorithm problem broken process place view compil time process run updat place compil process subsect brie describ updat event place db implement odmg model sourc translat shore system monitor updat event activ literatur adorn shore code output compil call code mv de nition evalu materi extra inform event speci cation identi ed imp gener compil applic identifi updat request adorn applic updat call code updat mv request relev match event speci cation deriv mv view compil insert code evalu updat comput figur propag mv detail appli mv omit due space restrict preliminari result preliminari perform evalu carri prototyp solut result brie section experi report carri pc hardwar intel pentium pro scsi hard disk system softwar swap space redhat linux kernel shore data gener random schema figur cardin figur evalu stringent demand made system present perform evalu answer queri materi relat cost perform queri view cost propag increment updat increment mainten view updat includ delet exist materi recomput view store extent mv variant figur refer figur compar perform evalu evalu queri retriev result materi virtual form result signi time gain queri materi version view di erent size figur show rel cost answer vq propag updat event increment idea identifi circumst mv detriment perform applic small increment updat perform cost evalu vq medium larg suggest bene cial larger figur show perform updat case signi cantli outperform case time faster small time faster larg increment updat cost answer mq compar vq size mq vq small medium larg depart small medium larg rel cost answer vq propag size number insert rel cost small medium larg size small medium larg size small medium larg figur preliminari evalu code defin select depart figur mv perform evalu perform cost event case small case larg suggest bene increment size relat work discuss work problem close relat work report paper increment mainten materi view studi detail relat dbmss blakelei al provid di erenti algorithm maintain view approach gener imp plant delta close relat di erenti ectiv richer oo set ceri widom deriv product rule increment updat subset sql view system emploi activ technolog kei inform tabl referenc view de avoid access base tabl solut view increment maintain access base tabl event algorithm provid gupta al increment maintain sql datalog view requir access base tabl updat avoid access base data updat zhuge al eager algorithm adapt environ possibl avoid access base tabl exploit environ base tabl resid remot libkin extend relat algebra bag present algorithm deriv algebra express comput view close resembl express languag amount inform assum algebra approach gupta blakelei extend possibl inform increment maintain spj view materi extend form mv mv store valu base partial base tabl order consum inform store oid contribut object avoid access base extent address view mainten context object dbmss constitut work close relat zhou al system call view de nition languag base oql oql syntax underli queri engin relat support view nest unnest oper materi mediat store local auxiliari inform gener intermedi node algebra queri increment updat plan maintain view auxiliari inform store result intermedi node propag increment updat mv insert delet support updat oper de ned odmg al address problem subset oql view monoid level context system variant odmg object model emphasi work understand properti oql queri aggreg oper determin circumst view materi increment provid directli implement solut establish foundat result solut build kuno provid system call multiview base object model queri algebra oper close relat algebra multiview consid view refer base follow mainstream approach replic actual data view view data wareh data integr context replic part object greatli simplifi make dicult reap bene ts expect data multiview requir access base extent referenc mv order propag updat increment support updat avoid access base extent view arbitrari number join updat oper al present algorithm increment mainten sp view context object model queri languag express fall short applic provid justi cation move relat emphasi record inform perform defer respect view languag process updat propag solut present salient point relat previou work cover problem event speci imp updat rst algebra approach problem context object work wider class mv previou work problem oql view lower space overhead mv solut fulli implement extens give evid perform evalu step problem plan build contribut provid formal result valid solut valid ensur empir test implement system extend subset oql view de nition join aggreg set oper quanti cation acknowledg ali gratefulli acknowledg support scholarship commiss unit kingdom refer increment view mainten object data base advanc inform fernand evalu increment view mainten system technic report depart comput august ecient updat materi view proc page shore persist applic proc page editor object odmg morgan ceri widom deriv product rule increment view mainten proc page fegara queri unnest proc page fegara maier ectiv calculu object queri languag proc page maier dbm proc page sigmod record june scholl increment updat materi oql view proc page libkin increment mainten view duplic proc page gupta blakelei partial inform updat materi view inform subrahmanian maintain view increment proc page kuno increment mainten materi view strategi perform evalu ieee oliv conceptu model genom inform abbadi view deriv graph edg fit adapt data wareh proc king gener data integr mediat materi widom view mainten wareh environ proc page
ML/1637 6 unari binari oper gener result motiv logic hung nguyen mexico state univ la nm usa comp univ texa el paso el tx usa ir goodman code space naval warfar system center san ca usa abstract unari binari oper basic ternari higher oper oper combin unari binari classic binari set truth valu possibl express arbitrari oper term unari binari possibl express arbitrari oper dnf form similar result logic proven previou paper expand result finit logic gener classic analogu fuzzi logic motiv fuzzi logic introduct unari binari oper basic ternari higher oper oper combin unari binari natur question combin arbitrari logic oper repres combin unari binari classic binari set truth valu posit answer question arbitrari logic oper dnf form repres combin unari binari oper interest explain unari binari logic oper basic assum logic human reason possibl transform logic function dnf form explain empir fact classic logic perfect descript human fuzzi uncertainti human reason uncertainti fuzzi logic tradit fuzzi set truth valu entir interv interv natur notion natur restrict continu unari binari oper restrict natur question arbitrari continu function repres composit continu unari binari posit answer question obtain paper fuzzi arbitrari logic oper repres composit unari binari fuzzi logic approxim actual human reason uncertainti describ expert confid statement natur determin expert estim confid scale select accur expert estim confid finer expert select accur expert estim confid finer problem approach expert describ fine scale expert point scale expert pinpoint scale attain adequ descript human modifi tradit fuzzi logic type modif possibl finest scale expert valu scale desir confid approach lead fuzzi set truth valu finit approach successfulli desir check finit oper repres composit unari binari oper problem logic set result truth valu depend scale fix finit describ expert confid interv expert estim confid thing expert confid closer belong interv natur describ confid adequ interv real number real number view case interv idea interv origin zadeh develop recent fuzzi describ describ real lower endpoint upper endpoint step endpoint interv endpoint interv describ real describ lower describ upper fuzzi logic natur question oper fuzzi logic repres composit unari binari uncertainti expert estim reason tradit ffl describ uncertainti singl expert confid strongli depend consensu expert addit dimens describ expert share origin expert ffl expert strongli describ addit numer make result logic logic adequ describ expert confid show logic logic oper repres composit unari binari oper give gener explan empir fact logic mention set truth valu arbitrari logic oper repres composit unari binari oper arbitrari logic oper repres composit negat conjunct disjunct prove true case finit boolean algebra prove set arbitrari logic oper repres composit conjunct disjunct special unari oper call absolut definit arbitrari boolean algebra defin absolut truth oper function similar crude function point similar ffi defin ffi ffi easili ffi proposit finit boolean algebra posit integ oper repres composit constant form tupl defin def equal similar possibl repres arbitrari function linear combin pp xn xn da dan def case variabl integ analogu xn ffi ffi xn result show similar prove result arbitrari finit set theorem finit set posit integ oper repres composit unari binari oper reader proof special proof logic mention arbitrari continu logic oper repres composit unari binari oper result base theorem continu function variabl repres composit continu function variabl result proven kolmogorov solut conjectur formul thirteenth problem problem hilbert challeng xx centuri mathemat problem trace found solut quadrat equat ax bx function variabl repres superposit function arithmet oper squar root similar result obtain function variabl repres solut equat ax bx cx dx prove higher order neg result hilbert conjectur function variabl repres function fewer variabl hilbert conjectur refut kolmogorov chapter student arnold worth mention kolmogorov result theoret speed actual comput result show gener kolmogorov theorem prove similar hold logic posit closur simpli connect bound open set convex set call set truth valu fuzzi theorem set truth valu posit integ continu ari oper repres composit continu unari binari oper proof proof theorem describ desir pick element set denot defin binari ffl defin def def ffl defin arbitrari valu assum ffl defin arbitrari valu assum easili check arbitrari oper xn repres tupl qed proof theorem proof similar present set emb box set point js arbitrari continu function compact set extend entir box assum map prove continu function variabl repres composit continu unari binari function kolmogorov theorem prove base case prove theorem argument idea similar present function variabl input function point fm denot compon point function repres function function map element real number function repres function real variabl function kolmogorov repres composit function variabl repres origin function variabl composit function variabl input function variabl transform element element def def def appli function input element follow oper kolmogorov theorem function def fm def fm desir composit function variabl combin function cm combin function fm singl function function work def def cm def appli combin function valu produc function fm result cm fm fm function repres composit function valu variabl statement proven unari binari function valu origin set truth valu complet function appli linear transform coordin rang compress origin function appli linear unari oper transform origin set larger make unari logic oper set simpli retract ch exist continu map desir unari logic def chang result bring valu back set qed unari binari oper basic tradit unari binari oper justifi possibl repres arbitrari logic oper composit unari binari similar result true fuzzi logic base fuzzi logic approxim actual human reason uncertainti accur descript human reason requir uncertainti valu interv addit uncertainti lead modif fuzzi logic logic show arbitrari logic oper repres composit unari binari justif unari binari logic oper basic valid interv uncertainti acknowledg work support part nasa cooper agreement futur aerospac scienc technolog program center structur integr aerospac effort sponsor air forc offic scientif air forc materiel grant number grant scienc technolog joint fund refer al local fuzzi logic fuzzi logic manag pp lj theori logic oper light checklist proc ieee confer nova oct cb boyer uc histori hl jk function variabl term function physic review vol pp lopez de architectur manag linguist express uncertainti intern journal intellig vol pp ir goodman approxim oper boolean intern journal intellig vol map neural network exist ieee intl conf neural san vol pp lectur deliv intl congress mathemat pari translat bull amer vol pp klir fuzzi set fuzzi theori prentic upper saddl continu function variabl superposit continu function variabl vol pp theorem relev neural vol pp theorem neural neural vol pp ht fuzzi logic expert system sixth intern fuzzi system associ world san juli vol pp gg approxim interv kolmogorov theorem relat neural interv pp version kolmogorov superposit prove construct comput appl vm analogu hilbert abstract intl confer st march pp ht nguyen theorem impact soft rr yager order weight averag theori pp ht nguyen direct mathemat foundat fuzzi contribut mathemat fuzzi nguyen symposium fuzzi system applic pp ht possibl complex valu fuzzi logic repres intern journal intellig vol pp ht form fuzzi logic applic kolmogorov intern journal vol pp ht intern journal system vol pp ht applic interv comput expert system intellig intern journal system vol pp ht nguyen ea fuzzi crc boca sierra special calculu improv expert system research report iiia institut en ib valu fuzzi set base normal fuzzi set vol pp fundament physic equat intern journal theoret vol pp la inform vol pp ah distribut theori transform
AI/1638 2 develop environ architectur build gener intellig user interfac agent scott brown depart electr comput engin air forc institut technolog usa eugen santo jr comput scienc engin connecticut ct usa sheila bank martin abstract exist work forc gener intellig user interfac agent address problem overwhelm human user interfac agent allevi user provid abstract intellig assist softwar agent commun user exist user interfac adapt user behavior benefit gener intellig user interfac agent environ appli highli interact inform intens softwar system freight parcel manag system wall street invest analysi desir address difficulti develop interfac extens number exist comput system make impract build agent hand agent compliant exist user interfac standard busi practic unit state air forc common oper environ standard defin inform infrastructur environ construct intellig interfac agent facilit standard complianc investig feasibl develop integr environ construct gener intellig user interfac agent base design knowledg acquisit tool support specif design interfac agent account complianc exist system user interfac util methodolog interfac agent correct model user adapt base user metric evalu intellig user agent develop user adapt interfac introduct technolog continu progress paradigm modern work forc oper solut oper capabl deliv amount inform human user amount inform user task process inform overwhelm human oper simpli interfac highli complex comput system requir highli special train educ lengthi costli busi exist system solv problem provid abstract intellig assist softwar agent commun user user interfac user oper process inform complet intellig interfac agent capabl adapt user behavior desir address difficulti develop interfac extens number exist comput system make impract build agent scratch agent compliant exist user interfac standard busi practic environ construct intellig interfac agent satisfi standard complianc prior relat work agent develop environ describ exist relat project develop adapt intellig user interfac develop tool aid design specif design system critic agent develop environ immatur similar approach present respect area present approach commerci research project attempt address problem agent develop al lee barbuceanu fox ibm microsoft project provid visual develop method agent agent commun languag provid simpl syntact check agent specif commerci tool focu commun aspect agent develop interact present agent user present form anthropomorph complet discuss research environ interfac agent develop discuss agent develop environ problem activ research area open agent architectur goal open agent architectur project al lee develop open agent architectur accompani user interfac network desktop handheld machin system support multipl agent distribut user task applic subsystem agent build environ tool user gener code popular program languag system includ tool linguist acquisit program interfac agent exist linguist support agent natur languag parser speech recognit creat maintain repositori reusabl agent open agent architectur tool design agent interfac extens prolog agent defin capabl inform facilit agent capabl facilit deleg task base capabl agent commun languag facilit reason capabl determin invoc condit true paramet invoc reason agent explicitli defin intern capabl limit preclud possibl predict agent develop environ agent build shell al fox address issu relat actual program construct intern reason agent develop tool support agent repres includ updat base interact environ agent build shell fox contribut field agent develop environ attent agent intern knowledg reason environ author call agent action situat plan specifi control mechan local maintain current state repres graphic finit state automata error recoveri rule deal incompat current state incom messag invok rule handl current situat rule coordin languag author assum determinist environ assumpt reason interfac agent domain user behavior chose knowledg capabl repres uncertainti ab rule user interfac agent develop environ architectur main problem exist agent build environ fail code develop tool mean commun protocol environ focu commun aspect distribut task multipl agent strength agent abil distribut task special agent handl task calendar inform retriev commun aspect ignor aspect agent specif develop adapt robust system suffer weak lack environ adapt agent knowledg reason mechan system adequ deal interact underli differ softwar engin dynam environ agent includ dynam user address issu explicitli develop address concern agent develop environ softwar engin identifi area agent develop environ defici environ specif exist environ implicitli address environ agent perform explicit environ bring critic domain enabl design identifi domain environ featur interfac agent deal concern sole interfac desir user behavior environ explicit specif domain environ develop techniqu softwar engin al adapt mechan current explicitli address fact agent typic oper dynam environ capabl adapt behavior adapt requir address code address specif determin adapt adapt agent knowledg base reason mechan ibm agent build environ agent build shell fail provid persist knowledg base underli reason mechan agent reason environ react system provid agent react explicit autonom agent agent reason action user attempt autonom act user address ibm solut provid simpl rule control action agent agent perform rule satisfi knowledg base store librari current agent develop environ typic focu autonom system specif develop tend ignor fact interfac abil adapt chang user environ mention develop gener intellig user interfac agent usabl domain gener interfac agent develop requir robust found develop environ address issu explicitli agent develop intellig agent develop environ architectur depict figur number compon architectur complet core interfac agent architectur adapt requir metric complet report al santo bank target system applic programm interfac interfac standard determin priori exist system main compon implement environ discuss agent specif languag environ address current agent develop agent specif languag environ support exist core interfac agent architectur enabl develop easili perform initi knowledg acquisit exist method tool expand capabl coverag agent specif design issu ad extend exist function account adapt interfac agent capabl incorpor user interfac standard inform infrastructur standard independ modul automat drive agent interfac develop methodolog automat updat user interfac standard updat chang knowledg queri manipul languag finin ontolingua knowledg acquisit tool kqml messag format support runtim share knowledg heterogen agent kqml emerg standard agent commun exist number tool includ applic program support kqml integr agent develop environ implement ontolingua languag repres ontolog ontolog specif vocabulari share domain definit object relationship agent ontolog describ concept relationship exist agent commun agent gruber ontolog enabl knowledg share agent ontolog commit agreement vocabulari queri make consist respect theori ontolog ontolingua good repres share poor acquir knowledg due notat inher complex design ontolog design ontolingua provid environ tool knowledg acquir tool encod kqml applic program interfac kqml perform ontolingua content format sharabl agent research commun larg interfac system address agent develop environ defici figur show agent specif languag deriv softwar system user interfac target system applic program interfac specif requir human interfac develop describ environ address defici exist environ environ specif event expect user stimuli user interfac provid agent interfac agent determin figur interfac agent develop environ architectur process flow construct custom intellig user interfac button menu item user exit agent affect environ defin target system api assum design agent direct access target system sourc code elicit explicit agent input output applic suffici captur applic specif stimuli interfac agent develop explicitli deal compon agent system possibl ignor human agent human user goal offer benefici assist captur characterist environ interfac agent human user situat direct impact user behavior environ affect agent interact interfac agent captur user model concern repres user knowledg interact system adapt system user user model mean accur captur intent user appar research field artifici investig wai exploit user model vassileva feel start lesson learn user model impact view interact environ discuss view environ orthogon element action atom entiti agent concern process type process place relationship agent interact approach make explicit reason treat human comput agent account user present unifi model behavior abil accur captur user characterist complet address vassileva viewpoint interact environ difficult typic specif user action environ determin user characterist techniqu user model research field user profil stereotyp user profil repres gener knowledg user typic static user profil elicit user standard assess elicit techniqu construct user profil al simpl oper elicit interest metric author pool pool van defin agent abil perform measur standard score santo jr research investig wai incorpor human factor user model schafer elicit stereotyp user model stereotyp repres repres attribut peopl user classifi belong stereotyp user model research stereotyp profil user model exampl includ stereotyp filter world wide web document base user infer interest user adapt stereotyp acquir expert deriv initi profici estim user level advanc languag learn adapt hypermedia base stereotyp user abil disabl feel work present previou separ work begun address vassileva concern santo bank interest captur user intent repres user intent environ paramount interfac agent predict intent offer assist user benyon murrai state recogn intent underli user action result satisfactori result fail recogn pursuit goal versu murrai santo bank state approach predict user intent identifi salient characterist domain environ specif determin goal user achiev approach base belief user intend environ result event goal achiev reaction stimuli causal relationship human user action user perform step model user characterist applic environ function knowledg acquisit user profil specif user user stereotyp class user techniqu user profil stereotyp suitabl user contend exist causal relationship human user action user direct acycl graph show causal ascrib user intent inher assign probabl arc direct graph approach previou research santo bank adapt mechan kei distinguish factor softwar engin engin deal dynam environ evid exist agent develop adapt dynam environ explicitli consid desir bring requir adapt forefront agent specif guid design area design adapt warrant discuss incorpor adapt mechan section agent knowledg base reason mechan environ ontolingua meant languag effici knowledg reason ontolog defin adapt intellig environ user user goal action achiev goal environ knowledg base handl probabilist reason mention causal relationship exist user action causal construct bayesian network base observ event goal environ bayesian network provid mathemat correct semant sound model repres uncertainti mean show probabilist relationship random variabl case core interfac agent architectur user interfac standard requir complianc softwar system construct interfac fulli separ surfac issu core issu interfac agent perform section intellig interfac agent architectur function proce give short present core interfac agent architectur describ interdepend compon defin detail al santo bank figur overview includ user intent predict continu adapt deleg task ascrib user intent interfac agent compon continu adapt interfac agent user model task share interfac collect correct adapt agent figur show architectur interfac agent correct adapt agent content kqml messag target system observ user action interpret user interfac target human commun agent kqml messag pass api observ store agent evalu histori stack recent observ top observ agent evid user repres bayesian network interfac agent offer assist suggest target system calcul expect util offer assist calcul perform bayesian network belief updat goal random variabl util suggest action achiev underli methodolog util methodolog util requir correct model correct adapt agent remaind defin util requir correct model develop util approach interfac agent assist account salient characterist domain environ goal user achiev santo bank advantag repres user intent ffl goal abstract design detect higher level pursuit lower level goal ffl evid easili intuit ad remov form user interact system ffl goal action explicitli state ffl plan recognit made easier plan recognit task ascrib intent plan agent base observ agent action plan agent unawar plan recognit process atom action goal al ffl natur languag explan action base predict goal easili gener figur bayesian network underli knowledg user model bayesian network sound mathemat basi probabl theori make ideal repres uncertainti found predict user intent note probabl user pursu goal interfac agent concern util offer assist user approach good affect research barri stephanidi horvitz santo bank determin expect util offer assist base probabl action determin perform belief updat bayesian util perform action user pursu goal gener idea interfac agent suggest goal greatest expect util util bayesian techniqu assess hoc approach predict user intent util function account relev goal respect number metric discrimin includ human factor identifi metric explicitli factor impact util goal detail relat construct bayesian network util function found brown al santo bank requir metric function absolut essenti develop measur requir interfac agent requir measur interfac agent effect meet user adapt make user model adapt ad attempt improv interfac agent abil provid benefici assist put dont necess develop measur requir metric determin effect interfac agent environ interfac agent requir possibl ffl adapt abil modifi intern environ environ chang futur react determin user intent improv assist ffl autonomi abil react figur core interfac agent architectur process flow diagram user intent predict continu adapt intellig user interfac agent time environ direct ffl collabor abil commun includ pursu goal offer assist user ffl robust abil degrad assist gracefulli develop set requir metric measur effect interfac agent meet requir detail requir metric set found al requir defin requir util function determin interfac agent util meet requir util function requir defin requir metric weight respect base previou histori requir histori previou action weight factor requir metric util function map real number higher util interfac meet requir util function identifi requir met attempt correct problem alter user model readili present metric design design chose metric determin rel import metric respect determin correct model adapt agent interfac design specifi salient characterist environ target system api applic user interfac standard gener core interfac agent architectur due inher dynam complex system uncertainti accur repres user agent capabl adapt time adapt interfac agent maintain accur user model requir metric requir util util user model measur determin close user model real behavior user user behavior chang deviat origin user model environ accur captur user model adapt techniqu time make user model reflect user behavior approach implement multiag system adapt interfac agent user figur interfac agent correct adapt agent architectur model al figur figur approach correct user model interfac agent request bid request correct adapt agent special agent capabl correct problem user model adapt improv interfac agent requir util adapt mechan encapsul correct adapt agent correct model correct adapt agent suggest interfac agent user model accord correct model base concept contractu bid process correct adapt agent engag recommend interfac agent interfac agent serv manag determin contract announc contract receiv bid bidder agent interfac agent evalu util bid base correct adapt agent abil improv requir util function correct adapt agent improv interfac agent requir util function contract correct user model develop methodolog agent readili appar approach interfac agent develop interfac agent develop environ architectur explicitli includ target system applic user interfac human factor model user util approach probabl adapt user model time accur reflect user interact environ approach holi grail interfac agent develop begin implement approach present uncov unforeseen problem pitfal approach environ address defici current agent develop environ environ agent knowledg base reason mechan desir easili directli incorpor user interfac standard produc compliant intellig interfac agent treat user interfac standard simpli input defin step realiz environ develop support exist core interfac agent correct adapt agent defin detail agent develop concept util requir system approach develop core interfac agent architectur util combin knowledg capabl captur inher uncertainti dynam user hoc approach user intent predict probabilist causal goal action repres approach number graphic knowledg bayesian network influenc diagram state probabilist approach addit advantag plan recognit approach valid relat system al attempt improv work provid knowledg acquisit tool design action improv approach merit investig project stephanidi improv work extend approach heterogen inform sourc correct adapt provid mathemat sound approach uncertainti initi result approach work al refer bayesian model plan recognit larg domain sixth intern confer user model york hybrid architectur inform filter world wide web user sixth intern springer wien york santo usabl test intellig interfac agent sixth intern interfac confer architectur agent build shell intellig agent agent springer adapt intellig tutor autonom agent system santo explicit requir metric interfac agent user model correct intern confer autonom agent santo util user model intellig interfac agent twelfth canadian confer artifici intellig open agent architectur aaai spring user model perceptu formal abduct model recognit present design intern confer user model ai meet user model intellig multimedia artifici intellig review adapt adapt inform access includ disabl elderli user sixth intern springer wien york approach map user model interfac paramet user model intellig applic held conjunct sixth intern confer user model translat approach portabl ontolog specif knowledg acquisit displai inform make eleventh uncertainti artifici agent reflect bayesian method user model user sixth intern springer wien york ibm ibm agent build environ toolkit build intellig agent applic world wide web page numer uncertainti manag user student overview system issu user model interact decid adapt intellig multimedia present system european confer artifici intellig workshop standard refer model intellig multimedia present john wilei pragmat approxim user user fourth intern earli draft invit keynot present agent develop tool open agent architectur intern confer practic applic intellig agent practic applic compani evalu kqml agent commun languag intellig agent agent springer microsoft microsoft agent adapt interfac annual symposium human complex learner model intellig call user sixth intern springer wien york probabilist reason intellig network plausibl infer san morgan kaufmann user individu user model intern journal studi model design prentic hall assess tempor variabl user properti dynam bayesian network user sixth intern springer wien york user model intellig interfac user model intellig applic held conjunct sixth intern confer user model van santo compar comput gener militari actor specif skill societi instrument engin control workshop model simul sensori real virtual environ view interact humancomput environ user sixth intern springer wien york human issu plan recognit interact phd royal institut technolog
DB/1639 3 revisit structur transact record store robert michael henri levi washington abstract number electron mail web person inform handl larg amount homogen data data ectiv repres record manipul simpl record search modern storag system inappropri applic le system store unstructur data limit reliabl relat store structur data provid concurr control relat dicult manag applic paper present transact record store directli address modern applic store combin simplic manag le system interfac select featur manag data describ principl guid design transact record store design present prototyp implement perform evalu introduct success year network data electron mail web person inform manag applic manag data regular structur easili repres record distinct user custom order electron mail messag descript organ set ned order number internet applic exhibit fairli simpl workload sequenti access small number data user descript server process custom order perform simpl set search small record applic typic requir replic avail reliabl expect number applic wider rang comput devic run hardwar comput comput cell provid access user contact messag newer devic pad commerci softwar servic implement highli scalabl network server replic scheme speci calli design mobil environ autom synchron data remot mobil node exist futur applic common data storag manag persist storag remain challeng applic le system fail meet applic dimens file system typic store unstructur data provid limit failur make reliabl store larg number homogen record object store relat manag object provid concurr control reliabl transact object store optim maintain heterogen object link relationship relat complex dicult manag provid support queri batch process function modern network data high cost address lack storag present transact record store combin simplic manag le system interfac select featur manag data record store record tabl share eld type record row tabl eld column organ result hierarch space similar le system simplifi store global uniqu identi er individu record tabl directori ensur good simpl express hint system provid reliabl oper atom transact group oper atom unit record storag system servic idea ibm compaq rm palm comput palm os provid record storag system level question revisit topic structur storag record storag system servic import reason class discuss requir common comput platform er record storag commerci applic ship lead unnecessari applic complex duplic build top relat complex implic build viabl record store obviou make perform primari contribut paper explor rest paper structur section develop principl guid design transact record store section present actual design section describ prototyp implement section ect experi build prototyp perform section review relat work section conclud principl practic record store applic meet requir oper atom face failur crucial econom signi canc internet servic record store implement wide rang comput wearabl devic cluster ectiv support provid exibl perform replic mechan relat tabl store larg number record provid transact reliabl techniqu implement ecient base record store tabl transact relat provid complex queri batch limit network data servic typic implement replic intern lack ectiv support replic scheme kei issu record store featur provid structur interfac guid fundament limit global knowledg knowledg local gener manag primari principl ensur ecient implement scalabl limit global coordin system state dont hide power abstract barrier applic record store hide express power primari principl ensur record store sucient function separ independ concern di erent design data data access separ distinct oper abstract primari principl ensur record store easi replic principl featur follow principl violat principl carefulli weigh requir discuss principl typic favor limit global knowledg aid scalabl design record store collect record record tabl eld type eld store oper tabl ect tabl tabl distinct oper manag schema perform access control data oper access modifi tabl data schema oper applic add chang individu lookup eld retriev list tabl eld tabl organ support typic directori oper entri lookup move directori facilit logic group relat result hierarch space conveni proven interfac manag persist storag ad le separ storag abstract addit tabl make integr record byte string storag singl storag system aid store support symbol link form refer tabl automat resolv lookup call tabl store object provid store oper atom applic transact group oper atom unit provid transact fulli serializ default transact combin separ atom concurr violat principl applic contact manag run cell pai overhead concurr control record store includ option set di erent isol level individu transact speci ed record store form set java interfac except speci cation reli featur uniqu simpli serv descript record store applic program interfac store consist repres simpl descriptor total method except repres speci except condit subclass class reli jini transact speci cation figur guid add record guid data field return guid guid automat gener void write data field record guid list list read field record guid return data result list instanti queri perform instanti return iter result void delet record guid figur ve method access tabl record record delet time guid queri search record criteria return result applic group oper atom unit pass transact paramet ve method throw guid explain detail queri vide avor interfac show ve oper access tabl data rest section structur describ motiv global uniqu identi er queri hint access control conclud section summari design global uniqu identi er primari challeng implement replic scheme structur store identi cation record collect record node boundari implement requir intern identi er uniqu record record store formal identi er associ global uniqu identi er record store object guid repres attract choic identi speci cation guid includ algorithm gener autonom node global uniqu guid store object record creation immut applic record store creat fresh guid explicitli guid applic record store creat guid store object record origin creat node guid store object record propag replica principl limit global record store enforc uniqu guid limit scope store uniqu guid record singl tabl uniqu guid store object local space store guid provid altern store object guid make locat replic store object di erent di erent long store object share common guid store object ectiv di erent node di erent polici organ local store guid provid space tabl eld repres record compar primari kei relat shown figur record delet guid oper manipul record time simplic regular oper simpli es log replic repres undu task access small number record access record guid applic extern identi user book search queri applic search record tabl search mail messag user queri limit record access return record queri select speci es record list sort speci es sort order select list eld speci es eld return select sort record select consist compar eld speci ed queri creation time queri execut time record store creat queri instanti actual execut time figur comparison negat combin conjunct disjunct result queri iter select sort record challeng design queri facil record storag balanc express implement complex perform consist principl limit global oper restrict singl avoid complex support join consist principl hide queri support sort templat sort ensur queri result order applic sort return data record store ectiv schedul prefetch queri result templat applic express structur common result user lling search form record store optim tabl layout index perform queri hint hint successfulli optim cach prefetch behavior le system suggest ectiv mechan optim perform record storag le hint dynam issu applic primarili control dynam behavior le system cach perform record store optim manag optim layout tabl order gener index eld gener record store set hint domin access pattern tabl hint explicitli creat speci tabl static expect chang workload chang individu hint describ delet oper simplifi programmat access weight hint rel import hint read oper eld hint list queri creat hint weight field specifi field read hint specifi queri queri hint void set tabl hint list tabl hint figur tabl oper hint hint creat speci tabl access set method throw throw read hint queri queri perform figur illustr interfac manag hint base record store optim creation index physic layout tabl workload speci ed hint domin record store creat index eld search queri workload balanc read creat index frequent search eld major queri search eld sort store record order eld access control access control model record store dicult common le unix window typic form access control list store le maintain le system number system base access control resourc java secur distribut virtual machin domain type enforc reli central polici descript base resourc author certi cate resourc shown merg le system permiss model dicult settl model develop viabl record store scale wide permiss add add directori tabl write chang directori record read read data delet delet store object record control chang store object record acl layout chang tabl schema hint chang tabl perform hint tabl permiss record store rang comput platform chose standard interfac extern access control implement access control model access control interfac support access control invok record store oper provid access control granular entir individu individu eld order access control interfac permiss repres individu record store shown tabl record store manag acl store object record access control store binari applic access extern object access control convert newli creat store object automat inherit copi parent directori acl newli ad record protect tabl acl complet interfac access control shown figur summari record store organ form hierarch space similar le system ensur scalabl record oper tabl ect sing tabl ensur oper atom applic transact group oper atom unit simplifi record guid access record time applic queri search record criteria applic provid record store optim tabl access layout applic workload access public interfac boolean return true access control acl void guid int check caller permiss store object guid void guid guid list int check caller permiss field record guid tabl guid acl convert binari acl object convert object acl binari figur interfac access control argument method fulli quali ed store object access control record store pass acl protect store object record method method throw check fail control deleg extern access perform check base acl prototyp implement primari goal prototyp implement provid platform valid design meet modern applic ectiv support replic decid implement prototyp relat back store provid nativ implement strang assert relat prototyp relat act simpli reliabl persist store support transact implement written java jdbc access underli consist class line code implement map record store separ tabl store record store tabl tabl store hierarch eld descriptor record store hint record store tabl minim perform overhead implement make extens cach transact implicit properti connect jdbc access implement maintain pool connect map explicit transact record store api connect prepar statement oper record store tabl cach futur cach java object repres store object experi order gain experi implement benchmark program measur execut record store implement measur test straight jdbc benchmark program creat simpl dictionari tabl map integ kei string valu applic implement portion benchmark search book author base implement user support account account updat order simpl mail server support function respond request layer mail server top replic modul intercept call record store copi data peer machin write program gaug record store discov aw record store interfac easier due clean design featur turn automat connect simpli es explicit transact prove simpler associ transact connect experi show interfac sucient power write real applic simpl implement replic top major drawback api turn perform oper singl line sql code requir line build record store data structur api encourag data complex central program demonstr perform record layer top good setup goal evalu prototyp implement rst make implement major impact perform rel jdbc demonstr record store perform workload electron mail show interfac ectiv support replic mechan experi sun server virtual version commerci relat underli storag layer perform commod pc mhz pentium iii mbyte id hard connect mbp switch ethernet report averag ten trial experi rst test overhead introduc record store interfac tabl integ kei string popul queri integ nalli updat guid size string vari byte maximum bu er size jdbc throughput result figur show perform di erenc greater add add add write write write queri queri queri oper size oper jdbc record store figur perform comparison jdbc record store queri byte valu bar repres throughput oper occur small data item store bu er cach repres overhead record store interfac amort read ten byte data larger data overhead drop byte perform write byte valu due underli implement test demonstr overhead introduc record store small sever perform jdbc test simul author web interact oper ecommerc benchmark author tabl book popul set author book titl randomli gener tool provid benchmark speci cation book record eld identifi book author author id test program pick random author queri book author start letter titl author store separ implement top jdbc join oper author id tabl record store implement perform nest loop rst program queri author book tabl queri book author ran test search fty book shown figur illustr number book result jdbc record store figur perform comparison jdbc record store search book author bar repres throughput oper book request signi perform penalti interfac relat oper result search singl book data set small bu er cach due bug record store iter result queri jdbc implement satisfi search singl book record store forc disk result search book demonstr penalti support relat throughput result throughput result fast di erenc account record store implement issu separ queri author sucient number result test demonstr common web search return small number record store perform common di erenc perform occur nal implement request web test tabl user account separ tabl address request user log exist account creat user account address user exit case time account make account read account balanc updat request order user request jdbc record store figur perform comparison jdbc record store simul user session ecommerc site portion session result creation user account vari portion session result order vari bar repres throughput request mark intend highlight mix perform order explor sensit record store mix read write vari percentag user percentag user make order shown figur illustr perform record store neglig loss drop perform write oper test demonstr realist workload read write record store interfac add neglig overhead jdbc nativ implement perform equal replic nal implement simpl mail server program top record store insert replic layer underneath mail server replic layer implement replic protocol cluster mail server design ecient replic small number peer protocol strategi resolv updat con updat rewrit object content mail mail messag typic creat modi ed replic code written layer intercept request record store log updat pass request replic layer background thread read object referenc replic log copi replic peer test mail creat client program gener request send mail read mail user size messag chosen size distribut user read mail chosen random fashion client randomli send mail read mail equal probabl avoid overhead mail protocol ed rpc mechan send serial java object tcp connect machin run client machin run depend data replic figur show result mail server replic handl request client server replic handl request number client result demonstr replic perform drop singl replic scalabl mail system client scalabl reason updat arriv user authent mailbox locat updat arriv overhead process individu request experi show replic readili implement top record store applic scalabl client commun summari record store api simpli es implement applic implement top relat record store introduc small perform overhead applic ectiv platform small number simpl oper modifi data captur replic layer client client client number client mail replic mail figur perform comparison mail server replic client randomli send mail retriev mail user test singl server multipl client replic test split client server replic data bar repres throughput mail system messag relat work storag system cover wide rang design point space storag aspect stand rst aspect data storag system ensur abstract level provid storag system storag system store unstructur structur data le system virtual memori manag basic unstructur data record object tupl relat manag record object notabl xml emerg altern unstructur structur data ecient store queri semistructur data topic activ research file store unstructur complic concurr updat le replic ort explor provid failur atom le system underli disk system le system limit failur atom provid repres altern manag applic state provid transact region virtual memori inher su er similar problem data directli map applic address complic ectiv share applic replic record ibm compaq rm provid storag api includ support index record store layout record lack mechan ensur suitabl underli storag layer record store gener storag abstract applic palm comput palm os distinguish main memori persist storag record storag limit provid possibl sort list record repres lower level abstract object thor provid persist heap object preserv structur applic applic safe share data provid concurr control reliabl failur object store optim store heterogen object maintain relationship store larg collect homogen record tupl javaspac space emerg kind network servic tupl space store object support basic write add read return copi object match remov return object match tupl space support collect homogen object transact limit interfac suit applic frequent modifi data relat speci calli design store larg collect provid concurr control reliabl support sophist queri access data wide underli store server applic increasingli storag substrat person digit assist level abstract provid higher record store support queri languag result system overli complex requir signi manag ort record record store relat manag data store oper atom applic transact group oper atom unit compar system design record store provid simpl interfac specif tune modern network data servic interfac simpler record higher level abstract hide layout simpler relat support advanc cleaner interfac separ di erent concern separ oper abstract repres record store system speci calli design support replic gener network data servic due part success internet applic store retriev simpl data high demand avail requir replic le system provid good match internet applic present transact record store meet requir modern applic design record store base limit global dont hide separ independ concern store combin manag le system interfac select featur manag data record store organ hierarch space simplifi store global uniqu identi er individu record object space ensur good store simpl express hint system provid reliabl oper atom applic transact group oper singl atom unit implement record store top relat show neglig overhead direct access workload domin read write reason overhead workload domin relat oper implement demonstr record store ectiv platform implement replic futur extens record store support refer basic type addit exist binari type applic refer speci record pair record tabl record principl hide power suggest type refer refer provid inform data prefetch support question ensur integr relat provid referenti integr primari foreign kei applic maintain consist relat record referenti integr violat principl limit global knowledg plan investig network data servic util refer order understand requir emerg tupl space kind network servic question ectiv implement tupl space lend storag support multipl version subclass object make map plan determin minim featur set implement tupl space directli record store integr tupl record storag acknowledg brian bershad input earli discuss project david eli swift comment earlier version paper refer el epidem algorithm replic acm symposium principl page wollrath jini speci cation practic domain type enforc unix ieee symposium secur page microsoft repositori intern confer larg data page aug prefetch implement object relat intern confer larg data page edinburgh sept palm os sdk refer technic palm santa jan extens markup languag world wide web feb wilk high perform parallel storag devic strong recoveri technic report hewlett nov episod le system winter usenix page san jan compaq record manag servic refer manual compaq comput jan internet messag access version rfc internet engin task dec certi cate theori rfc internet engin task sept borriello centuri network comput intern confer mobil comput page aug gauthier scalabl network servic acm symposium oper system page oct arnold javaspac practic patt metadata updat perform le system usenix symposium oper system design page nov gong insid java platform api implement june shasha danger replic solut acm sigmod intern confer manag page june grai reuter transact concept techniqu morgan green microsoft ignit war oracl show seattl page novemb de kaashoek atom recoveri failur atom logic disk ieee intern confer distribut comput page hong reimplement le system log group commit acm symposium oper system page nov merg nt unix permiss usenix window nt page aug inform standard intern standard decentr protocol annual acm symposium principl distribut page agarw persist bridg program relat acm sigmod intern confer manag page li comparison algorithm parallel prefetch cach usenix symposium oper system design page oct guid internet draft internet engin task feb provid persist object distribut system european confer volum lectur note comput page june chen free transact rio vista acm symposium oper system page oct soft techniqu elimin synchron write fast usenix annual technic page june microsoft replic sql server white microsoft dec mishra join process relat acm comput mar lesser system concept program procedur qed inform oracl advanc replic technic white oracl redwood feb jr hide ieee mar demer flexibl updat propag weakli consist replic acm symposium oper system page oct rosenblum ousterhout design implement le system acm transact comput feb levi avail perform highli scalabl internet mail servic acm symposium oper system island south dec lightweight virtual memori acm symposium oper system page north dec bershad design implement distribut virtual machin network comput acm symposium oper system page island south dec steer exploit asynchroni set iter reduc aggreg le latenc acm symposium oper system page oct tpc tpc benchmark speci cation transact process perform san feb weiser comput rst centuri scienti sept jdbc api tutori refer june widom data manag research direct ieee data engin sept ford space ibm system
HCI/1640 4 inform search cost perspect design interfac electron commerc ph candid oper inform manag offic gerald assist professor oper inform manag offic school pennsylvania depart oper inform manag hall dietrich hall pennsylvania septemb acknowledg author david fai eric johnson construct comment grate michel enorm amount time spent prepar phone directori research partial support gte laboratori ma direct correspond gerald abstract inform search cost perspect design interfac electron commerc research web develop appli knowledg inform search cost design web site sell consum product servic goal research predict subtl user interfac design influenc inform search cost empir studi compar choic subject made busi patron paper electron telephon directori choic inform search cost media provid theoret basi predict differ inform search research design creat effect web site achiev market object inform search cost perspect design interfac electron commerc introduct electron commerc shop depend great extent user interfac peopl interact comput success depend market understand consum interact inform technolog influenc subsequ consum behavior inform search cost basic econom theori consum inform search empir research inform search behavior long tradit market smith explor effect prior brand percept inform search explicitli consid cognit cost make measur potenti difficulti payn predict cognit effort function number elementari inform process requir execut strategi context electron web develop appli corpu knowledg inform search cost design web site sell consum al specul onlin retail reduc inform search cost price consum price sensit lynch ari systemat vari design onlin store alter inform search cost onlin retail store design made qualiti inform easier search subject price sensit higher product wai present inform onlin alter inform search cost order magnitud media inform search task longer shorter depend web site design al lynch ari describ object techniqu measur level amount inform search context web site design goal research predict subtl user interfac design influenc inform search cost design commerci web site face myriad organ present product inform design influenc inform search cost subsequ choic behavior provid theoret basi predict differ inform search research commun graphic web master design effect web site achiev market object newel lai scientif foundat predict inform process time context interact gom model work extend olson olson theori predict time complet specif task detail task analysi step menu type read beauti paradigm underli scienc direct applic design commerci web site electron commerc true back envelop sort calcul rapid develop environ web studi allud design gom model set set set set select rule compet method goal principl fail provid concret paradigm test design commerci applic notabl busi applic theori design telephon oper workstat save million dollar demonstr differ inform search cost peopl busi patron paper electron yellow page seemingli subtl cost inform search influenc consum choic behavior show choic tradit paper directori onlin directori vari function differ inform search cost yellow page good media test theori ubiquit high usag demograph group import direct media publish tradit paper directori develop yellow page directori yellow page provid context compar differ choic consum make tradit paper electron media appli theori predict differ search cost paper electron yellow page describ experi test predict result multinomi logist regress analysi choic made subject yellow page directori discuss practic implic research conceptu framework newel assum routin cognit skill serial sequenc cognit oper motor activ routin skill time paramet deriv perform task total task complet time sum compon time theori predict ideal time empir data real user longer ideal time lead differ predict actual time goal method predict rel differ inform process time altern inform process task adopt techniqu estim time view read set yellow page ad paper electron directori test predict effort onlin paper yellow page busi displai ad total busi serial posit insert tabl yellow page list busi alphabet order busi posit ad head influenc search process examin compon inform download motor movement numer factor influenc readabl text comput screen studi find read slower comput screen wright found speed accuraci impair text present screen compar paper found read slower comput screen book assum equal readabl paper electron directori assum user read displai ad list yellow page directori head busi assum averag number word displai list assum read word requir newel total read time paper electron directori inform search alphabet list electron directori effort search tradit paper telephon directori addit effort attribut addit wait time load html document motor movement scroll kei system time wide acknowledg major sourc impati stress interact al wait time internet www document typic delai load typic html page wait time add inform process time time ten yellow page motor movement view onlin directori inform search cost select requir view ad view initi close window ad select requir point ad select ad button total time ad moran newel select time add inform process time ad select select electron total time sec read time sec wait time alphabet search electron directori requir time read ad paper directori assum complet inform search displai ad list page yellow page alphabet search electron directori requir time serial posit ad page effect peopl notic serial posit inform busi serial posit matter peopl scan list alphabet order scan peopl notic ad effort requir process ad electron directori predict consum patron busi begin electron list consum electron directori busi begin electron list consum tradit paper directori travel distanc contrast alphabet keyword search effici onlin paper time paramet scenario read word ad head displai list requir compar word work memori requir word compar word read target word work memori busi paper exhaust search busi street requir read time comparison turn assum electron directori list busi proxim travel user search busi street find function point object menu requir addit click button newel user type street dialog box requir move hand keyboard keystrok newel type word requir keystrok total find multipl busi repeat find command note requir street requir point keystrok command repeat search assum busi total search time electron directori search busi street effort electron directori tradit paper directori prior yellow page research tradit directori shown travel distanc import piec inform sought consum butler travel distanc import factor retail store select ahn effort requir search electron directori predict consum electron directori patron busi nearbi consum tradit paper directori consum electron directori busi nearbi consum tradit paper directori displai ad direct relationship size attent document larger ad view ad size import indic reput credibl product servic qualiti product assort busi afford bui larg ad infer good offer wide percept ad size depend abil perceiv differ size ad present ad power law describ relationship perceiv size area judgment power cx β averag valu β area judgment yellow page ad page squar page squar page squar inch page squar inch ratio perceiv size largest smallest ratio actual ratio perceiv size page page ad greater ratio actual power law demonstr peopl judg magnitud area peopl perceiv small area larger actual area peopl perceiv larg area smaller actual area perceiv differ depend area adjac page page paper directori multipl size ad page electron yellow page directori displai ad separ page easier make size comparison area page sequenti present area differ ad size notic paper directori electron directori larg ad longer load onlin make larg ad effort view higher cost view larg ad electron directori reduc number displai ad view lessen impact displai ad choic process consum electron directori busi displai ad consum tradit paper directori yellow page directori method subject head travel busi head real phone number actual busi head repres typic assort ad busi page page displai line line bold anchor list displai ad plain list head page version yellow page directori develop test research refer paper simul tradit directori refer gif version interchang replic html document gif version replic page paper version imag onlin browser refer hyperlink simul format adopt major onlin directori servic publish gte big hyperlink version present alphabet list busi hyperlink busi ad insert figur insert figur paper version print yellow paper bound page directori head page head arrang alphabet head hand side page left hand side page layout head construct gif page paper version convert imag file html document html page includ navig button page move head gif page enlarg ensur legibl page visibl time remaind view scroll hyperlink version list busi head alphabet simul format major internet yellow page directori select hyperlink displai ad separ screen procedur group subject particip separ session particip read instruct studi subject instruct yellow page directori locat product servic particip goal develop dry clean special particip chose busi head patron complet busi subject complet short questionnair yellow page usag busi typic patron particip group student pennsylvania volunt studi subject complet paper version subject assign randomli group ag particip rang year percent male percent femal subject chose busi head total choic miss subject complet gif version complet hyperlink version subject onlin version seat comput termin questionnair subject made choic head total choic gif version choic hyperlink version miss ag particip rang year thirti percent femal seventi percent male ensur subject make choic carefulli reflect true develop incent system form lotteri particip chanc win gift certif busi chose head lotteri determin randomli randomli select subject randomli select head pizza subject receiv gift certif busi select head pizza subject chose busi incent insur choic subject made reflect true prefer result data set record busi head subject miss choic data consist chosen altern busi head subject head chosen altern code domino pizza busi code explanatori variabl data shown tabl restaur head figur page displai mile busi number dummi gif code electron version yellow page directori interact effect gif hyper ad displai serial mile crux statist test research insert tabl data analyz multinomi logist regress model model data set tabl show logist regress analysi maximum likelihood estim model paramet figur graph effect size deviat time model paramet comparison rel import choic insert tabl insert figur predict hypothesi interact gif serial posit hyper serial posit paramet estim neg serial posit effect paper directori choic made onlin electron directori sensit serial posit made tradit paper version subject begin head onlin directori tradit paper directori attribut greater effort involv search busi end list electron directori higher cost alphabet search prior research found consum conduct extens import smith distanc larg effect choic paramet estim neg version busi farther consid subject familiar local road travel distanc inform import determin choic behavior predict hypothesi interact effect hyper mile interact largest effect choic effect time larger gif mile interact part user search text electron gif imag file paper direct relationship ad size consum larg ad effect gif ad size hyper ad size interact ad size influenc choic electron directori displai measur ad displai ad paper displai ad posit effect choic displai ad chosen ad displai ad hyper displai ad interact gif displai ad interact show displai ad neg effect choic electron directori displai ad chosen onlin ad displai ad page facilit comparison displai ad paper directori rel onlin version gif displai ad view simultan easili paper page visibl time hyperlink user view displai ad ad ad time make size effect size tradit paper medium discuss implic linkag electron market interact import contribut research user interfac essenti conduct busi onlin paradigm psycholog interact newel provid solid conceptu foundat impact electron media inform search cost model interact infanc time paramet limit rang task work remain extend basic foundat understand underli inform process task optimist approach gener wider rang complex displai insight design inform product servic electron commerc practic implic inform search cost consum choic environ induc supermarket shopper product lower unit price provid singl list product sort lowest highest unit price applic inform practic serv guid design paradigm find studi direct applic real world view streamlin product list navig approach recognit addit click reduc possibl illustr relev work provid detail quantit model inform process paradigm gener convinc priori quantit predict rel differ inform process time practic implic design evalu commerci web site find displai ad effect tradit paper media electron media import sale market electron yellow page onlin ad extens graphic long download time preclud effect graphic suggest busi opportun market design servic creat effect electron yellow page current design constraint web hypertext applic deliv list hyperlink collect simultan screen simultan view ad gif version hyperlink point addit inform typic yellow page ad current industri practic tradit paper yellow page place larg displai ad begin head reward senior client serial posit head tradit telephon directori publish charg featur influenc price model electron directori charg serial posit yellow page ad busi model internet search engin ventur hype hope li frontier interact market internet onlin servic research begin address basic issu media influenc consum process find print media transfer directli electron media inform process model provid solid theoret basi predict effect understand differ peopl process inform electron media aid develop electron telephon directori servic provid insight develop onlin retail search engin inform product servic refer al interact home manufactur incent particip electron marketplac journal sharon scott extern search investig product categori journal consum research jame eric john payn analysi cognit effort choic organ behavior human dougla yellow page guid consum review raymond st mn kenneth janet lincoln engin data human percept perform daniel averi consum inform attornei account yellow page journal servic stuart thoma alan newel psycholog comput interact lawrenc erlbaum john relat intermedi memori span memori search rate psycholog william element graph data wadsworth publish joel understand yellow page troi yellow page publish associ direct market associ statist fact book direct market associ samuel distribut system locat model journal retail winter ho hierarch model store choic intern journal retail wayn michael project valid gom predict explan task perform ad size indic perceiv cost effect memori percept journal ralph yellow page tool small busi american journal small alan newel engin model stimulu compat reev integr approach ny eric gerald comput base choic approach design marketplac artifici work depart school pennsylvania effect perceiv cost brand percept journal consum wolfram alexand investig induc system time interact gerald cognit model understand graphic comput gerald consum ey movement pattern yellow page journal john dan ari interact home effect search cost price qualiti inform consum price satisfact retent work duke ami industri final grow aug scott appli logist regress sage paper seri quantit applic social seri thousand sage carol linda read text comput screen acm comput survei dec brian consum inform search theori empir analysi journal consum sandra creativ theori practic englewood prentic hall john web yellow page pc walk pc paul read skim comput screen offic behaviour inform technolog judith gari olson growth cognit model comput interact gom john eric johnson adapt maker cambridg press yellow page empir analysi attribut contribut consum journal servic edward unit price inform journal market sa institut user version fourth volum sa institut internet delai user perceiv inform steven confer march acm press steven cost journal consum mechan correl ad recognit journal robert wayn electron inform system evalu format multipl environ journal market loui econom consum inform acquisit journal peter alan text screen paper behaviour inform technolog time sec paramet refer enter keystrok moran newel point menu item moran newel click button moran newel move hand keyboard moran newel turn page bound manual lincoln read word john newel compar word work memori tabl cognit engin time paramet interact variabl descript std dev min max ad size ad size squar inch displai ad mile distanc mile serial serial posit busi tabl variabl includ data analysi paramet standard pr variabl df estim error mile hyper mile gif mile ad size hyper gif serial hyper serial gif serial displai ad hyper displai gif displai tabl logist regress analysi maximum likelihood estim figur rel effect size yellow page ad featur choic hyper mile mile gif serial posit gif mile hyper serial posit hyper displai ad gif displai ad displai ad ad size
IR/1641 5 gener summari summari align text span michel mittal mark jade goldstein research languag technolog institut henri street carnegi mellon pa pa usa usa abstract text summar system base sentenc extract difficult design document differ write style lexic usag lack suitabl corpora summari make difficult evalu improv exist algorithm larg number summari stori paper discuss work gener corpu approxim summari summari discuss align appli problem problem differ previou work align parallel text briefli analyz differ handwritten extract summari introduct text summar system base sentenc extract difficult difficult document differ write style lexic usag lack suitabl corpora summari make difficult evalu improv exist algorithm gener corpora manual practic peopl comfort write summari gener summari select sentenc document summari stori world wide web form valuabl resourc evalu summar develop machin learn approach summar paper discuss approach gener larg corpu summari summari task similar align import differ section discuss differ context previou work section discuss altern approach identifi match span text applic section discuss lexic syntact differ extract summari section conclud discuss experi direct futur work background relat work shown figur goal match sentenc abstract sentenc stori report work gener summari summari closest bodi work research investig problem align text span parallel languag effort align sentenc paragraph score corpora canadian hong kong effort broadli classifi case languag pair share similar surfac famili case languag pair dispar case english effort align text span english abstract text span techniqu case work case main techniqu align text span languag pair famili text span length lexic cue church gale found length text span enabl system find match text span high accuraci work situat text span document align express similar amount inform variat length span due differ underli languag structur length metric work combin sentenc origin document singl complex sentenc abstract vice inform depend number syntact pragmat factor difficult captur addit cue lexic base observ charact sequenc common word languag common charact subsequ system point text span applic armi chief kill sourc armi chief kill unit presid elit guard sourc gener kill camp camp militari resid presid left capit fridai northern step decad absolut power left capit unknown armi chief kill guard armi chief kill unit presid elit guard late fridai sourc earli saturdai gener defenc minist chief armi kill camp resid presid kill camp special presidenti senior western told reuter neighbour telephon circumst death unclear sourc camp unit regular armi bring dsp element control left fridai northern base laurent close capit govern relinquish execut power shortli car posit luxuri hotel promin member administr stai appoint gener full control larg presidenti guard height number militari forc western nation unit franc portug readi evacu foreign break hour sign evacu begin figur sampl abstract document match align shown figur match sentenc found sentenc abstract document system complet charact test align task made difficult virtu fact abstract combin sentenc part origin document sentenc abstract easili wide space sentenc origin center end problem easili cast sentenc align problem cast phrase align verb preposit phrase align text span sentenc fragment abstract order sentenc document fragment middl sentenc fragment sentenc complic make clear altern exploit fact sourc target languag section discuss simpl approach investig align goal exploit advantag uniqu featur target sourc document languag attent match phrase sentenc common token span section describ attempt extract inform retriev method extract relev section text comput score queri rel document passag text extract relev sentenc term length term frequenc term weight algorithm multipli monoton function term length monoton function term frequenc effici scalabl algorithm distribut implement requir inform extern document unlik tfidf updat problem consum resourc number document outperform term score method common good method ad benefit easi implement easili gener word algorithm base philosoph assumpt natur languag assumpt variat suggest languag influenc constrain peopl algorithm assum languag effici exert evolutionari pressur result frequent word shorter word frequent distinguish text tend longer impli close class strongli indic content shorter length compar open class word empir analysi suggest case word syllabl open class item assum word letter open class close class accuraci rate major except rule proper person tend evenli distribut term length yield observ reminisc zipf law word length product term length term document frequenc approxim constant suggest term length substitut document frequenc tfidf term weight yield term weight metric simplest unweight score word measur number charact document devot word ibm found score metric text compress metric identifi word common pair relat bia longer frequent word algorithm document handwritten summari sentenc comput term top term repres queri number uniqu term sentenc equal rel frequenc term match term select match exist max ii top score sentenc iii top score sentenc empir chosen threshold sentenc chosen sentenc analysi approach extract approxim set stori reuter lo angel time experi cover articl period varieti health entertain articl difficult empir evalu qualiti sampl hundr stori summari studi potenti problem approach found perform suffer found import keyword repres approxim uniqu word sentenc term match includ simpl match plural singular form kei fail align sentenc entiti short proper noun small length mismatch abstract stori olga russia won gold winter game sundai women classic style race base algorithm system rank sentenc match base set manual index sentenc includ addit term km rank sentenc record revolutionari equip game open gold russian mother winter sundai snow postpon men downhil ski problem initi approach depend overlook capabl distinguish text span long token treat keyword attach greater weight match token compar equal long longer desir situat section describ logic extens approach incorpor weight combin part speech token tag entiti treat import augment order deal problem discuss previou miss index item incorpor po tagger tag syntact role token document case discuss match sentenc weight set uniti sentenc rank highli mother gold game perform women km ski case includ proper index mix result accur sentenc map algorithm document handwritten summari comput index set po score tag proper noun common noun occur sentenc sentenc sentenc measur overlap attribut point noun overlap match proper increment point ii match common increment point select argmax match empir chosen threshold sentenc chosen sentenc gener extract base summari abstract visual inspect randomli sampl set show major problem remain problem due issu scope approach fact abstract tend critic summar narr set summari addit inform stori individu set problem determin sentenc miss quotat extract handwritten summari comparison extract summari found interest differ extract summari longer length short sentenc extract summari extra comma repres summari summari half number found extract summari suggest differ length due delet inform secondari import sentenc handwritten extract import differ highlight reduc murder convict yesterdai sentenc dai shed serv counti superior reduc convict murder mondai sentenc time serv dai death child summari omit extra detail delet phrase extran adject compact phrase substitut tabl breakdown articl summari origin handwritten extract articl summari summari close class open class noun proper number verb adject adverb replac preposit phrase complex noun yield shorter sentenc summari stori america onlin substitut base group lexic differ extract summari delet adject adverb add compress compani substitut comput instrument journal reduct number stopword pronoun abbrevi month state substitut shorter correct spell error stylist substitut shown tabl extract summari gener system preserv inform densiti repres ratio open class word close class word shown figur po tag significantli improv extract hand case summari evalu yield sentenc close match origin stori summari deviat significantli extract handwritten sport summari discuss final score winner origin articl tend focu detail emot event percent word match sentenc percent sentenc extract po extract figur compar result extract po larg corpora summari make difficult evalu improv exist algorithm larg number extract summari stori paper discuss approach gener larg number summari wide onlin sourc techniqu align text speech transcript close caption sourc find match text span find similar extrem case check futur plan includ test extend techniqu automat recogn align foreign build specif synonym set automat investig machin learn techniqu build templat syntact relat match reliabl inform distribut multipl sentenc refer learn natur languag case studi part speech tag comput linguist approach align parallel text align noisi parallel corpora languag group word pair featur match dynam time warp program align sentenc bilingu corpora annual confer associ comput linguist pp method measur document similar classifi text pittsburgh research patent pend text compress method apparatu tech rep patent ibm introduct modern inform retriev comput scienc seri studi semant philosophi scienc scienc linguist select write benjamin lee ed mit align parallel corpu statist lexic criteria languag houghton pp
IR/1642 5 autom collabor filter applic onlin recruit servic keith barri smyth smart media depart comput colleg dublin ireland abstract onlin recruit servic suffer shortcom due tradit search techniqu user fail construct queri provid adequ accur descript lead search result investig potenti solut combin implicit profil method autom collabor filter techniqu build job recommend strategi implement evalu domain introduct onlin recruit servic emerg success popular inform servic provid job seeker job dedic search engin irish similar internet applic suffer due relianc tradit technolog inform access place burden repres job requir form user user submit poorli construct result search result address problem casper project seek investig role artifici intellig techniqu provid intellig model inform access casper enhanc exist system improv exist search facil reason fuzzi match autom collabor filter techniqu proactiv recommend job user overview casper focu enhanc investig role casper core recommend servic recommend techniqu recommend inform item user base similar user success critic depend avail user grade list inform shown work high expect overlap relat profil dynam limit life mean expect overlap relat user small paper discuss problemat common form describ solut investig casper user profil casper user profil primari knowledg sourc system user profil automat passiv construct mine server log profil built interf user interact unlik relat system requir explicit feedback user fig show part line record singl job access user encod detail time type job user id basic form profil simpli list job user time gener user level interest implicit relev inform profil fig partial user profil show basic grade profil inform casper collect type relev revisit amount time user access inform item shown interest item inform collect casper mislead data click job descript remov job fig sensit measur relev gain report correl user interest casper calcul inform note time differ success request suitabl threshold techniqu elimin spuriou user log read appli mail read read job action revisit activ final reliabl judg user interest job avail onlin applic email facil user email job descript appli job directli action interest job read job descript record casper fig show job user email appli log research examin factor measur relev job highli relev user appli onlin user tend result insuffici data base relev predict relev supplement interest measur common inform filter domain found revisit data correl activ data profil user appli result improv simpl profil incorpor recommend task due number import natur casper profil space expect overlap profil low argu section present problem common techniqu problem relationship recommend strategi draw recommend profil similar user step set user relat target user profil item user target rank recommend target user success depend qualiti recommend partner genuin relat target user section introduc algorithm reli method identifi relev user argu casper direct relationship simplest form gener approach user relat basi direct similar measur overlap profil measur correl coeffici grade list lead lazi form neighbour strategi casper simpl overlap metric calcul similar relev inform pearson correl coeffici compar similar measur simpl overlap metric relev inform item item item item overlap target user job present target profil favour job occur frequent base job occur similar profil target profil fig direct indirect user relationship import thing note form relianc direct user fig ignor potenti indirect relationship user job tast set form expect overlap user profil number user overlap target user low target user recommend base small number profil low similar qualiti result recommend user indirect relationship fortun altern method identifi direct indirect user relationship method cluster techniqu group user prior recommend profil cluster virtual commun user commun fig demonstr common scenario user directli relat user direct relationship indirect transit relationship identifi user belong virtual commun user directli indirectli relat order specif exploit form indirect relationship cluster techniqu threshold version similar metric essenti commun maxim set user user similar greater threshold commun member commun relat user built recommend process proce analog select select member target profil commun benefit possibl identifi larger group user relat target user unrel user directli relat user indirectli relat user direct relationship indirect relationship target user provid richer recommend base disadvantag longer judg direct similar pair profil direct relationship recommend item rank base frequenc commun analysi describ preliminari evalu test qualiti job recommend produc method studi base user profil gener server log job access user profil span uniqu job averag profil size profil job automat evalu recommend produc evalu carri hand restrict small set user ten target user randomli virtual commun commun target user belong cover rang size target receiv recommend list ten target user nearest user rank recommend list produc target user recommend frequent occur job virtual commun set result target user manual grade research involv poor numer base similar recommend job exist job target profil target user receiv cumul grade score recommend job techniqu score divid maximum cumul grade present fig target user fig encod measur cluster size recommend qualiti behav cluster size method fig recommend qualiti result show method outperform small due profil space explain section expect overlap user nearest user target chosen overlap target profil job constitut reliabl recommend partner expect recommend method sourc method base recommend potenti reliabl measur indirect relationship profil experi similar threshold virtual commun implicit relationship base transit overlap job commun member discuss paper enhanc system compon implicit user profil automat gener server log form recommend method method argu casper profil space present problem approach low expect overlap profil casper approach present exploit transit relationship profil argu properti make techniqu casper hypothesi support preliminari result expect add evalu futur refer pazzani learn collabor inform filter intern confer machin learn morgan madison wisc appli collabor filter usenet commun acm implicit rate filter delo workshop filter collabor budapest framework demograph filter artifici intellig review retriev onlin recruit servic annual colloquium inform cambridg surf digit gener guid recommend intern confer munich system share recommend commun acm
IR/1643 5 estim search engin meng liu clement yu wu rish dept comput suni ny dept illinoi il school comput florida intern fl abstract present statist method estim search engin queri estim metasearch engin local search engin invok search engin paper defin combin number document search engin suffici similar queri averag similar document result estim method accur introduct search engin creat internet ordinari user find desir data search engin defin set document search search engin index document creat store search engin speed queri process amount data internet huge believ end million web page rapidli emploi singl search engin data internet unrealist process power storag capabl scale virtual unlimit amount data gather data internet extrem difficult imposs practic approach provid search servic entir internet approach approach gener bottom level local search engin metasearch engin built top metasearch engin interfac maintain index document sophist metasearch engin maintain characterist inform local search engin repres search provid servic research support nsf nasa aro metasearch engin receiv user pass queri local search collect result search engin advantag approach user queri evalu smaller result reduc updat index index local search engin updat document local updat propag metadata repres content local propag infrequ metadata typic statist natur toler local inform gather easili time demand storag space process power local search engin manag number search engin invok metasearch engin ineffici small fraction search engin document queri search engin blindli invok unnecessari network traffic creat queri useless search engin local resourc wast useless search approach identifi search engin provid result queri pass queri identifi search engin challeng approach identifi potenti search engin search engin queri measur pair number number document search engin similar queri measur global similar function higher threshold averag similar document global similar function local similar function emploi local search defin gj jxj denot number element set search engin similar queri document queri simpli set word submit user transform vector term weight document transform vector weight similar queri document measur dot product vector dot product divid product norm norm vector xn pp normal similar similar function normal cosin function paper contribut measur search engin respect queri measur easi understand inform statist method identifi search engin queri estim search engin queri show obtain process addit effort requir comput comparison obtain method yield accur estim demonstr result properti largest similar document queri document search engin max sim max sim max sim threshold retriev set max sim max sim base search engin invok search engin queri singl term queri method identifi correct search engin invok queri constitut portion internet queri consist ideal situat document examin descend order similar method robust yield good result approxim statist data rest paper organ section review relat work section present method estim search engin result present section section conclud paper relat work method identifi potenti search engin metasearch environ repres method estim number global similar document search engin measur method rank search engin difficult understand separ method convert measur number document retriev search engin shortcom measur independ similar threshold number document desir search engin rank document search engin fix probabilist model distribut inform retriev method suitabl feedback document retriev identifi relev irrelev search engin respect queri ggloss defin sum document similar queri greater threshold measur inform measur repres ggloss estim number document estim measur estim method ggloss estim method emploi base restrict assumpt assumpt queri term document queri term document term term disjoint assumpt term term set document term disjoint set document term due restrict estim provid method accur note measur similar sum estim produc method ggloss form lower upper bound true similar sum method separ measur number estim produc method ggloss longer form bound true number document method estim number document binari independ case document repres binari vector ith posit absenc presenc term occurr term document assum independ method extend binari depend case depend term incorpor substanti amount inform lost document repres binari vector seldom practic estim method permit term weight util inform method section method estim present method estim search engin section simpl techniqu improv scalabl method discuss section method search engin distinct term document repres vector dm weight ith term repres queri similarli repres queri um weight similar document defin dot product respect um dm similar normal common normal similar function cosin function case repres pair probabl term document averag weight set document queri um repres estim loss assum impli term document consid gener wr dummi variabl proposit relat coeffici term function probabl document similar proposit defin term independ weight term present document repres coeffici function probabl document similar queri term weight equal weight term queri document document vector compon queri term document queri term weight document vector interpret similarli document document term averag weight term document gener function coeffici function sum probabl document queri term similar probabl document queri term similar coeffici estim probabl document similar expand gener function merg term obtain assum term list descend order proposit probabl document similar expect number document similar queri similar threshold largest integ satisfi expect number document similar queri greater measur queri base threshold number document similar greater estim est note expect sum similar document similar queri expect sum similar document similar queri greater measur queri base threshold averag similar document similar greater estim est estim expand express estim requir addit effort comparison estim gener function estim est est interest note actual document similar higher fourth similar actual unrealist assumpt proposit document term weight term present statist method overcom problem term oe averag standard deviat weight set document probabl term document base term polynomi includ probabl gener function express uw weight term user queri express essenti assum term uniform weight document term term distribut document term weight order magnitud number document term total number document partit weight rang term subrang weight subrang weight subrang weight subrang weight median weight term weight subrang median weight fourth subrang illustr figur distribut term weight approxim term uniform weight document uniform weight uniform weight document uniform weight document weight queri term polynomi gener function replac uw uw uw uw probabl term occur document weight document term assum weight polynomi obtain polynomi probabl document term subrang weight term assum expon polynomi similar due term equal queri term find store approxim assum weight distribut term normal oe standard deviat constant tabl standard normal distribut note constant independ individu term set constant suffici term averag weight term assum term weight standard deviat weight term tabl standard normal note constant independ term probabl document term weight term queri polynomi term gener function divid weight term equal subrang divid weight subrang size experi report section specif special subrang highest maximum normal weight section probabl highest subrang set divid number document probabl underestim document norm document largest normal estim probabl reason note method standard deviat weight term term repres triplet oe probabl term document averag weight term document term oe standard deviat weight document maximum normal weight term highest repres oe mw mw maximum normal weight term result maximum normal weight critic paramet drastic improv estim accuraci search engin provid insight maximum normal weight critic import correctli identifi search engin queri queri singl term similar function wide cosin function queri normal weight similar document queri dot product normal weight document jdj norm weight term normal document term mw maximum normal weight term document compon repres term mw highest subrang maximum normal weight probabl set divid number document gener function queri set number document maximum normal term weight mw term gener function queri obtain replac mw mw express modifi mw largest normal term weight term mw largest mw mw threshold retriev set mw mw estim number document similar greater mw mw estim number document similar greater identifi estim method document similar greater singl term queri identif correct document normal term weight mw document similar equal mw maximum normal weight term arrang descend order mw mw mw mw number threshold set mw mw identifi estim method identif consist ideal situat document similar greater desir document similar greater highest subrang maximum normal weight method correct identif search engin singl term queri argument appli similar function report percentag queri internet high larg percentag internet method optim identif maximum normal weight term util improv scalabl repres estim method larg size rel estim method poor scalabl term occupi byte number averag standard deviat maximum normal occupi byte base estim byte space store repres term tabl document percentag size repres base approach rel size origin document collect size page kb collect size term rep size wsj fr doe statist column document wsj street fr doe collect tabl show size repres rang size actual approach fairli scalabl percentag space repres rel size grow document ad larg number distinct term remain unchang grow slowli simpl method reduc size repres byte number approxim probabl interv valu repres base interv partit interv averag probabl fall small interv comput map origin probabl averag interv result show section approxim neglig impact estim accuraci scheme size repres term drop byte byte size repres size result collect queri experi largest collect stanford test ggloss system snapshot newsgroup stanford cs depart host obtain merg largest obtain merg smallest document document queri real queri submit user sift netnew server user queri internet environ short queri term experi approxim queri experi queri document word remov similar function cosin function similar queri document term weight threshold larger present result repres repres set oe mw standard maximum normal number origin number approxim result compar estim gener method case previou method method similar basic method section paper util standard deviat weight term document dynam adjust averag weight probabl queri term threshold queri result method base disjoint case report shown method method base case present result repres repres set number approxim number investig method toler inaccuraci number repres experi subrang method subrang maximum normal term subrang median percentil note narrow subrang weight larg weight import estim threshold larg present result repres repres set triplet oe number origin number maximum normal weight directli obtain estim percentil averag weight standard deviat median determin manner result show import maximum normal weight estim process origin number queri obtain true obtain compar queri document estim base repres estim formula method previou method repres repres set number origin number estim round integ result summar tabl prev method subrang method tabl comparison prev method subrang method tabl comparison tabl threshold number queri identifi queri document similar greater actual queri identifi comparison approach base criteria report queri identifi base true number queri identifi base estim report number queri identifi base estim realiti queri base true column method case mean queri identifi base true queri identifi base estim queri identifi base approach queri good estim method close close threshold note correctli identifi incorrectli identifi useless miss harm search useless estim method larger compon method compon significantli larger bs consid tabl show approach substanti accur previou method turn substanti accur approach criteria threshold measur estim method averag differ true estim queri identifi base true averag differ queri smaller number estim method tabl show approach previou method threshold turn approach criteria threshold measur estim method averag differ true estim queri identifi base true smaller number estim method tabl show approach substanti accur approach threshold result summar tabl result summar tabl tabl observ made estim method significantli outperform method criteria compon smaller larger largest due inhomogen construct prev method subrang method tabl comparison prev method subrang method tabl comparison prev method subrang method tabl comparison prev method subrang method tabl comparison approxim number section simpl method reduc size repres approxim number averag byte essenti differ perform tabl tabl similar result obtain tabl tabl byte number tabl byte number tabl byte number tabl result maximum weight estim triplet origin number section discuss import maximum normal weight correctli identifi singl term queri singl term queri repres larg fraction queri internet expect weight significantli improv estim accuraci queri queri singl term queri tabl show result maximum normal weight explicitli obtain assum normal weight term set document term satisfi normal distribut maximum normal weight estim percentil base averag weight standard compar result tabl tabl clear maximum normal weight improv estim accuraci substanti similar reach tabl tabl tabl result maximum weight estim tabl result maximum weight estim introduc search engin measur intuit easili understand statist method estim search engin respect queri accur estim measur metasearch engin send queri local search engin process save commun cost local process cost substanti estim method estim make number document desir user threshold unlik method rank search engin independ inform search engin similar document correctli identifi submit queri queri result estim method accur exist method identifi correct search engin estim number potenti document estim averag similar similar document intend perform extens experi involv larger acknowledg grate lui gravano hector stanford provid queri collect refer fox world wide web queri virginia baumgarten probabilist model distribut inform retriev acm bruce croft search distribut collect infer network acm gener gloss broker hierarchi vldb gener gloss broker hierarchi technic cs stanford report discuss estim defin paper disjoint scenario discuss harman overview text retriev confer edit comput system metasearch engin learn search engin queri ai research agenda centuri march saracev real life inform studi user queri web acm sigir inform system corpor wide area inform server technic report machin april koster index web comp network isdn kowalski inform retriev theori implement kluwer academ lee gile search world wide web april yu cluster search algorithm incorpor arbitrari term depend acm septemb rish determin text search internet vldb bucklei mitra pivot document length normal acm salton mcgill introduct modern inform retriev luk siu estim number desir record respect queri acm march meng principl queri process advanc applic morgan san lee server rank distribut text resourc system internet intl conf system adv appli april
DB/1644 3 framework ontolog integr introduct diego giusepp de maurizio lenzerini dipartimento di informatica sistemistica università di roma itali abstract basic problem develop techniqu semant web integr ontolog web constitut varieti inform express order extract inform semant integr reconcili term global ontolog requir address fundament problem map global ontolog local ontolog argu captur map notion queri crucial concept ontolog correspond view ontolog result queri process ontolog integr system strongli relat queri answer data integr basic problem develop techniqu semant web integr ontolog web constitut varieti inform order extract inform semant integr reconcili requir paper deal situat local develop independ requir build global ontolog extract inform local main global ontolog provid unifi view queri local ontolog work carri ontolog semant web languag method build global ontolog basi local ontolog infer layer restrict form express decid dl studi express ontolog semant web address crucial problem semant map global ontolog local ontolog aspect central global ontolog answer queri context semant web simpli local ontolog intermedi step global global ontolog access inform local opinion problem map global local ontolog heart integr deepli investig argu express ontolog specif languag suffici inform integr semant web real world ontolog build organ expect inform repres form level abstract ontolog map concept ontolog concept ontolog correspond view ontolog observ notion crucial express map concept suitabl queri languag ad ontolog specif consid reason spirit result queri process set strongli relat queri answer data integr system distinguish ontolog integr data integr studi data integr assum sourc basic logic theori singl assumpt made ontolog local ontolog arbitrari logic multipl model main contribut paper present gener framework ontolog integr map ontolog express suitabl mechan base illustr framework case studi paper organ section set formal framework ontolog integr section illustr call approach approach discuss approach specif case studi show subtleti involv section briefli present approach integr distinct section conclud paper ontolog integr framework section set formal framework ontolog integr system argu framework basi ontolog integr sake refer simplifi compon oi global local map call system complex situat model extend framework order map local ontolog spirit global ontolog act local respect layer main aspect definit semant queri pose global ontolog thing uniqu semant domain constitut infinit set symbol oi tripl global set local map local ontolog global ontolog denot ag alphabet term global assum global ontolog oi express theori simpli logic lg local ontolog assum set local ontolog sn denot asi alphabet term local ontolog si denot union asi assum asi mutual disjoint alphabet ag assum local ontolog express theori simpli logic lsi denot collect theori sn map map heart specifi concept global ontolog local ontolog map semant semant start model local crucial point model global ontolog assign semant oi start local model interpret model theori call global interpret interpret global interpret global model wrt model satisfi map wrt back notion satisfi map wrt local model semant denot defin exist local model st global model wrt queri queri pose oi express term queri languag qg alphabet ag intend extract set tupl element queri semant queri ariti defin answer set tupl denot result evalu interpret map repres heart oi usual approach ontolog mechan map concept ontolog limit express direct correspond term argu power mechan mechan map concept ontolog queri acquir relev inform navig aggreg concept research data integr distinguish basic approach defin concept global ontolog map queri local ontolog concept local ontolog map queri global ontolog discuss approach section term denot concept ontolog approach approach assum queri languag alphabet map global local ontolog associ term global ontolog local ontolog intend mean associ term queri queri repres instanc concept mechan correspond view exact local model global interpret satisfi correspond wrt tupl satisfi satisfi satisfi correspond wrt tupl satisfi satisfi satisfi correspond wrt set tupl satisfi set tupl satisfi satisfi map wrt satisfi correspond wrt approach adopt data integr system sourc gener relat global ontolog schema repres relat map associ relat global schema relat queri sourc relat common opinion mechan simpl queri process basic reduc unfold queri definit translat queri term access sourc add constraint simpl global queri process shown case studi case studi set framework ontolog base idea develop data integr global schema express model describ main compon ontolog integr provid semant queri answer oi defin global ontolog express model uml class type constraint assign entiti compon mandatori particip instanc entiti particip compon isa relat entiti type function mandatori attribut entiti relationship local ontolog constitut simpli relat alphabet extens relat extens express relat observ assum relat term present local ontolog map set correspond form concept global ontolog queri map associ queri ariti entiti map associ queri ariti entiti attribut queri retriev pair extens local mean attribut entiti instanc argument queri correspond instanc entiti argument correspond valu attribut map associ queri ariti relationship ariti queri retriev tupl extens local mean instanc map associ queri ariti attribut relationship ariti argument queri correspond tupl argument correspond valu intend mean queri concept specifi retriev data global schema start data sourc confirm concept global ontolog defin view concept local ontolog pose constraint languag express queri map extens local ontolog relat simpli assum languag express comput relat semant data integr set tupl extens relat local data satisfi global ontolog singl extens model global ontolog case data integr system literatur show result due presenc semant condit implicit conceptu schema account set extens figur show global schema data integr system ag function student mandatori particip relationship enrol isa isa organ schema model person member student person member student enrol ag organ figur global ontolog enrol constitut map semant oi easi local model situat global model exist data extens local ontolog retriev queri element global ontolog satisfi function attribut constraint global model exist data extens local ontolog retriev queri global concept satisfi isa relationship global ontolog happen wai exist add suitabl object element order satisfi constraint wai yield global model refer local model tupl tupl queri ag map specifi model tupl belong extens ag ag function attribut model exist oi refer local model pair join map model specifi student mandatori particip relationship model enrol kei point accept model interpret differ enrol framework assum problem solv queri extract data extens local ontolog assum function attribut queri implement suitabl data clean strategi ensur local model tupl extens similar condit hold function attribut problem show issu queri answer incomplet inform approach data integr exist multipl global model oi impli queri process simpli reduc evalu queri singl relat principl global model account answer queri interest observ strategi simplifi overcom problem frequent adopt data integr system data integr system adopt simpler data model plain relat data express global schema global data retriev sourc local trivial fit directli consid uniqu process queri answer queri concept global schema consid exact analog previou easi global extens consid form data retriev extens local ontolog observ data extens obei semant condit implicit global singl extens coher global oi inconsist impli queri answer meaningless argu usual case heterogen local data fit global approach oi inconsist fact problem incomplet inform overlook current approach explain observ tradit data integr system follow mention simplifi express global schema set plain sourc exact present algorithm comput set answer queri pose data integr system kei featur algorithm reason queri global ontolog order infer tupl satisfi queri model oi algorithm simpli unfold queri basi data integr system base approach algorithm add answer directli extract local exploit semant condit express conceptu global schema local queri global ontolog algorithm constitut major step queri obtain queri expand element global ontolog knowledg relev compil expand comput queri unfold unfold expand basi map unfold simpli substitut atom expand queri element atom result unfold queri relat local ontolog evalu queri unfold local model step obviou requir find compil queri semant relat hold concept global schema shown queri expand return algorithm exponenti wrt expand union conjunct queri map make entir algorithm polynomi data complex refer queri easi set answer respect semant specifi enrol legal member gener impli evalu approach approach assum queri languag vg alphabet map global local ontolog associ term local ontolog queri global ontolog intend mean associ term queri vg queri repres instanc concept correspond view exact local model global interpret satisfi correspond wrt tupl satisfi satisfi vg satisfi correspond wrt tupl satisfi satisfi vg satisfi correspond wrt set tupl satisfi set tupl satisfi vg satisfi map wrt satisfi correspond wrt recent research work data integr approach major challeng approach order answer queri express global reformul queri term queri sourc approach reformul guid correspond problem requir reason infer sourc answer queri author point approach support dynam local ontolog ad system restructur global ontolog case studi present oi architectur base descript logic repres ontolog adopt descript logic class relat repres introduc illustr logic defin oi descript logic dlr descript logic knowledg formal captur virtual formal artifici softwar distinguish featur logic optim reason practic system implement algorithm project domain interest model mean concept denot class object focu attent dl dlr basic element concept relat assum deal alphabet constitut finit set atom atom denot denot arbitrari relat ariti denot arbitrari built denot compon integ denot ariti integ denot nonneg integ concept relat mean relat ariti combin form express type inherit ariti denot compon relat ariti semant dlr interpret constitut interpret domain interpret function assign constant element uniqu concept subset relat ariti subset condit figur satisfi observ constructor relat express differ complement dlr knowledg base set assert form home page descript logic di di di figur semant rule dlr ariti relat ariti assert satisfi interpret interpret model knowledg base satisfi assert logic impli assert ρ ρ satisfi model introduc notion queri express dlr assum alphabet enrich finit set variabl simpli call variabl queri express dlr knowledg base datalog queri form conj conj conj conjunct variabl conjunct atom form variabl constant relat concept number variabl call ariti ariti relat denot queri observ atom queri express arbitrari dlr concept freeli assert kb interpret queri express ariti interpret set constant substitut ci formula evalu true dlr equip effect reason techniqu sound complet respect semant check assert logic set assert number encod queri check queri model set solvabl dlr oi set framework ontolog base idea develop data integr dlr knowledg base describ main compon ontolog integr provid semant queri answer oi defin global ontolog dlr knowledg base local ontolog set relat give extens ontolog observ knowledg relat map set correspond form relat local vg queri express exact observ partit global ontolog local model knowledg local ontolog wrt reconcil global view ontolog make call interschema assert part relat level simplic deal interschema assert case extend framework present includ queri answer set requir sophist techniqu account knowledg global ontolog map answer queri pose global ontolog data local ontolog queri answer techniqu studi oi od defin global ontolog gd dlr knowledg base american surgeon doctor express american doctor rel surgeon doctor set sd local ontolog consist relat extens map queri express answer ann addit local consist relat extens map correspond constraint gd inform conclud bill answer queri american combin approach approach combin approach unrestrict restrict direct correspond global local ontolog overcom unrestrict queri languag alphabet queri languag vg alphabet map global local ontolog relat view global ontolog view local ontolog intend mean relat view vg global ontolog view local ontolog repres object satisfi vg term concept analog correspond vg exact local model global interpret satisfi correspond wrt tupl satisfi satisfi satisfi vg satisfi correspond wrt tupl satisfi satisfi vg satisfi correspond wrt set tupl satisfi vg set tupl satisfi satisfi map wrt satisfi correspond wrt oi ou gu ontolog form su simpli set relat extens global ontolog gu binari denot research project work denot project research area belong local ontolog binari relat denot person field interest local ontolog binari relat denot research grant assign binari relat denot grant project refer map mu form correspond situat repres approach queri answer approach larg combin difficulti real world approach express power present gener framework ontolog global ontolog provid unifi view queri local semant web framework repres sort design space problem integr ontolog semant web applic argu map global local ontolog main aspect discuss approach map independ stress notion queri crucial task ontolog integr case studi present shown sophist techniqu queri answer ontolog integr system case studi illustr simplifi drawn data integr expect thing complex ontolog integr consid full gener recent base idea express ontolog knowledg descript logic appli autom reason techniqu servic design interact semant web idea extend queri order citizen abil reason refer lenzerini special issu data reconcili inform horrock ad formal semant build top rdf schema proc workshop semant de lenzerini access data integr system conceptu schema proc int conf conceptu model de lenzerini decid queri constraint proc acm sigact sigmod sigart symp principl system page de lenzerini answer queri view descript logic knowledg base proc nat conf artifici intellig page de rosati descript logic framework inform integr proc int conf principl knowledg reason page de rosati inform conceptu model reason support proc int conf cooper inform system page de vardi queri process constraint satisfact proc ieee symp logic comput scienc page nardi descript logic conceptu data model chomicki logic inform page kluwer academ nardi unifi formal artifici intellig wimmer heterogen multimedia inform garlic approach page catarci lenzerini repres interschema knowledg cooper inform system intellig cooper inform van knowledg web proc descript logic workshop page ceur electron workshop navig plan data integr proc nat conf artifici intellig page aaai mit simon extens framework data clean technic report hull manag semant heterogen theoret perspect proc acm sigact sigmod sigart symp principl system levi answer queri survei technic kirk data model queri evalu global inform system intellig inform capabl base mediat tsimmi proc acm sigmod int conf manag page ullman inform integr logic view proc int conf theori volum lectur note comput page
ML/1645 6 linkag learn probabilist model georg harik illig technic report januari illinoi genet algorithm laboratori depart gener engin transport build mathew av il linkag learn probabilist model georg harik abstract goal linkag build block creation effect genet algorithm paper explor relationship problem learn probabl distribut space argu problem simpl effect approach learn implic paper reveal exist algorithm potenti order magnitud faster accur simpl ga introduct linkag learn genet algorithm identif build block conserv crossov theoret studi shown effect ga hold advantag simpl ga task develop algorithm drawn attent past approach develop algorithm evolv problem chromosom solut proven difficult undertak paper reinterpret solv problem context probabilist optim number algorithm develop replac ga popul crossov oper probabilist gener method studi shown close correspond algorithm simpl ga paper show variant pai close attent probabilist model popul successfulli tackl problem begin briefli review work simpl relat algorithm explor close relationship approach optim remaind paper concern ultim consequ relationship argument present consist separ learn good probabl distribut learn linkag good distribut found search jointli small compress popul distribut distribut problem encod argument stand leg empir essenc applic occam razor part paper present probabilist extend compact ga design learn linkag learn good probabl distribut demonstr advantag approach simpl theoret problem test approach paper explor consequ probabilist algorithm ii simplifi simpl ga ga simul genet state popul individu genet state combin chromosom typic includ forc genet deem influenti natur crossov restrict facet problem optim algorithm natur evolut typic lead set individu suit environ control comput natur ga made evolv chromosom suit task optim search set find structur criteria paradigm map readili implement ga structur repres ga popul ga popul current set structur algorithm found interest point repres current state search genet oper natur mutat gener state search current ga goal reach final state good solut problem hand order simplifi assum structur ga optim set binari string fix length binari string simpli consecut sequenc charact restrict make easier visual understand ga oper theori develop paper remain applic wider domain optim space reason ignor moment effect mutat ga popul repeatedli undergo process genet oper crossov converg converg mean type chromosom remain popul good solut oper orthogon goal crossov oper gener chromosom mix part pair chromosom roughli correspond mate reproduct natur select oper weed chromosom unsuit environ poor score current optim focu block select uniform crossov repres possibl gener select crossov oper block larg fraction weakest chromosom popul thrown stronger chromosom place strength measur chosen optim problem optim problem repres fit function map structur real number strongest structur highest fit score block select control specifi fraction popul retain action select figur show effect select popul size popul select fit fit popul select figur chromosom top half popul copi gener uniform popul pair pair chromosom gener replac parent popul child creat parent randomli inherit posit sibl posit parent combin refer gene figur show effect uniform crossov dissimilar chromosom parent crossov children crossov figur note gene conserv crossov parent gene end children optim ga consist random initi repeat applic crossov select optim typic stop popul number stop criteria figur show popul converg number ga shown consist outperform standard optim techniqu reason ga wide consequ effect propag correl high fit figur converg popul type chromosom search structur simpl optim problem maxim fit string number figur show evolut popul gener select crossov note ratio popul higher distribut select number crossov mix attempt combin singl chromosom gene correl high ga successfulli exploit inform select fit fit select fit crossov figur select crossov lead chromosom fit previou reason ga success wide natur structur correl fit debat crux problem complex structur mutual possibl vie explan ga singl gene structur ga effect deal ga process complex consist refer build block studi linkag learn studi make ga process structur complex singl absenc inform gene relat relat roughli mean gene exist tandem provid fit gene provid detect fit signal advanc method margin success justifi comput effort undertak remaind paper address issu develop justifi algorithm learn linkag detour explor set probabilist algorithm close relat ga iii probabilist optim algorithm popul ga repres inform part search space ga crossov select oper ga exploit inform gener potenti solut research notic crossov tend decorrel individu dimens solut select tend chang popul reward success gene born number algorithm replac select number action margin probabl distribut gene idea algorithm rest repres current state search fraction dimens popul popul gener mimick effect consecut crossov alter probabl gene algorithm mimic effect select compact ga exampl simplist algorithm restrict cga slightli simpler cga begin initi probabl vector gene phase correspond random initi phase simpl ga solut gener poll select kth dimens unit uniform random variabl kth probabl gene posit fittest solut reward competit fit solut fittest kth fit solut fittest kth fit solut amount parametr maxim assum figur show evalu place algorithm gener chromosom fit fitter fit origin probabl vector part fitter chromosom note index gene vector due program convent opposit gene unchang leav probabl vector process continu vector impli singl valu cga converg gener chromosom fit figur cga evalu step examin probabl distribut close correl algorithm simpl find difficult guess extent relationship shown simpl ga popul size select rate tournament select close cousin block uniform mimick close cga gener solut algorithm refer probabilist algorithm maintain popul distribut product margin distribut separ gene consid trivial build block iv probabilist optim linkag learn correspond oper cga simpl ga hint deeper connect connect ga popul interpret repres probabl distribut set futur solut explor ga popul consist chromosom favor evolut good distribut popul repres algorithm find good solut role crossov gener chromosom found current popul role plai direct distribut cga popul due select reflect alter probabl distribut probabl distribut chosen model popul crucial algorithm success choic good distribut linkag learn moment explor statement context problem difficult simpl ga solv proper linkag learn linkag learn decept problem begin defin version count problem fit string number case fit recal problem reason call decept problem ga reward increment add solut consist initi concept problem needl optim algorithm expect solv transform requir linkag combin multipl copi decept subproblem larger problem problem form group dimens decept subproblem problem util decept subproblem defin fit string sum subproblem subproblem defin group dimens figur show sampl bit string evalu problem problem decept typic kind problem test linkag learn algorithm fit figur larg partial decept problem form concaten number smaller fulli decept subproblem ga learn linkag oper recombin optim solut bit subproblem optim bit string consist ga learn linkag tend gravit suboptim solut consist simpl ga swap gene break good cross slightli difficulti learn linkag situat gene defin subproblem dont adjac learn ga correctli pick set relat gene small number combin astronom figur show size popul repres set solut partial decept problem illustr depict subproblem chromosom figur ga found good solut margin fit contribut gene uniform crossov shown destroi correl gene lead high averag fit popul probabl repres popul gener solut distribut lead poor solut margin fit figur gene popul crossov recogn build block boundari correspond hold cga simpl ga rear side head unabl deal partial decept linkag learn crucial uniform probabilist fail produc chromosom good solut problem hold dualli realm ga probabilist algorithm crossov oper understand gene break combin repres build block crossov develop swap solut singl gene order algorithm guess correctli gene relat learn linkag probabilist probabl distribut recogn gene repres joint probabl gene configur margin distribut gene independ algorithm model origin popul figur set gene maintain correl gener linkag learn skill easili domain probabilist algorithm remaind paper show oper feasibl search good distribut fulfil tradit task linkag learn make good probabl cga defin mean gener solut current poll margin distribut dimens gene gene posit independ complex algorithm develop match behavior popul algorithm act investig correl gener distribut close poll popul close measur easili measur probabl distribut distanc model behavior valid question pursu train thought ultim reveal flaw prescript directli model behavior poll gener member random select chromosom exist popul behavior rapidli lead algorithm explor structur accur model popul distribut desir action probabilist algorithm correl found vastli superior probabl argument trend continu indefinit model popul progress stop puzzl combin impli complic model popul point hint resolut problem pick distribut model popul solut realiz probabl distribut repres model make current popul popul simpli finit sampl distribut task identifi probabl model induct model gener observ popul search model futil choic select bia search space thing simpler distribut complex simplic defin term complex origin problem encod thing rare remain tradeoff simplic accuraci aim find simpl model nonetheless good explain current popul minimum descript length model motiv ventur hypothesi natur good relianc occam good distribut distribut current popul compress minim definit minimum descript length bia model search distribut directli penal complex model minim model size addit penal inaccur inform theori compress popul mdl restrict margin product model moment explor hypothesi basi compress avail probabl distribut space structur compress calcul bit repres messag messag distribut evalu hypothesi reformul problem find good distribut optim problem find distribut model minim combin model popul remaind paper focu simpl class probabl form product margin distribut partit gene margin product model model similar cga except fact repres probabl distribut gene time model make exposit structur model directli translat linkag partit defin gene tightli link tabl margin probabl model gene make figur show model problem partit chosen mean distribut repres gene gene jointli probabl distribut posit distribut valu mean time popul gener distribut posit fourth posit chromosom form restrict probabl gene repres independ form distribut power cga repres popul half half popul repres bit popul requir bit storag gene repres probabl structur binari structur posit probabl distribut posit probabl repres structur encod bit bit popul recogn bit repres distribut cut fourth amount space store popul probabl string posit probabl entropi distribut averag number bit repres structur randomli pull distribut calibr probabl match number estim distribut compress popul calibr easili compress popul incorrectli model popul possibl order chromosom deem unimport random sampl chromosom project gene subset ident poll subset distribut subset incorpor popul frequenc count repres popul consist partit structur calibr pull frequenc count subset directli popul efficaci distribut defin sum size model popul compress model explor actual equat defin criterion combin complex criterion ith partit subset size sum subset size requir frequenc count defin margin distribut configur gene frequenc count size log popul size total model complex model complex log ith subset repres gene margin distribut subset entropi distribut number averag number bit repres gene popul number greater popul repres ith subset gene ith margin distribut total compress popul complex compress popul complex arm evalu efficaci structur actual probabl margin distribut probabl determin requir condit compress optim calibr structur popul frequenc count form full model add model complex compress popul complex combin complex number model complex compress popul complex section describ simpl algorithm search partit gene space good distribut oper criterion find distribut compress complex suitabl small combin heurist greedi search algorithm invent effici probabilist optim algorithm algorithm gener random popul size undergo tournament select rate model popul greedi search model stop gener popul model return step algorithm stop found solut result algorithm focu featur algorithm requir select popul structur model stabl select replac simpl updat cga concret popul requir crossov step replac probabilist poll algorithm describ greedi search greedi search begin gener postul gene independ perform steepest ascent algorithm attempt merg pair subset larger subset judg merger basi combin complex combin lead combin merger carri process continu pair subset merg result gener search carri gener optim implement cach delta valu pair combin step combin greedi search algorithm minimum descript length search appli task henceforth refer extend compact ga result paper concern theoret justif section show significantli speed solut problem partial decept creation partial decept reli composit small decept problem defin subproblem trap fit reli sole number present chromosom function extens test linkag learn solv proven challeng absenc prior linkag inform begin explor relationship popul size proport subproblem solv correctli simpl ga uniform crossov ad inform algorithm run show comparison number function evalu algorithm achiev compar level optim proce result decept trap function ten copi trap concaten form difficult figur problem compar simpl ga set neighbor gene form optim simpl ga told gene relat group matter size subproblem simpl ga uniform crossov run problem select rate higher simpl ga gather averag number solv popul size measur perform ga optim algorithm typic judg number object function evalu undertak number popul size time number gener tabl show popul size versu averag number solv simpl averag number function evalu tabl popul size solv object evalu tabl simpl ga complex decept subproblem popul size solv object evalu tabl complex decept subproblem differ simpl ga favor consist solv build simpl ga popul size thousand million function popul size thousand function evalu small time faster simpl ga speedup due care attent paid probabilist model speedup theoret greater solv larger problem show success structur success run gener gener gener note structur gener gener make mistak pair gener final result arriv gener complet discern structur problem inform ahead time simpli search optim compress complet subproblem structur arm optim problem faster simpl ga role select role select curiou immedi clear proper level select maintain run model problem structur correctli true aspect simpl dual role probabilist gener select role gener crossov creat chromosom present popul chromosom correl structur boundari structur gene independ gener popul algorithm begin assum gene depend answer question select gene specif combin correl high fit partial decept problem experi select correl group defin common subproblem correl detect level select correl detect gene relat low level select fail point import futur research probabilist algorithm point relat class algorithm learn proper structur explor correl vi futur work paper began review simpl ga relat set probabilist algorithm past work equat algorithm simpl explor relationship point exist gener algorithm class exist point benefit pai close attent probabilist model popul explor paper demonstr proper probabilist model algorithm effect solut problem introduc oper complex criterion distinguish good model bad model result shown learn margin probabl solv difficult problem order magnitud faster simpl ga linkag inform paper reveal strong connect linkag learn proper probabilist model tip iceberg effect optim concern goal linkag small part gener goal learn actual optim problem transform optim space optim design biolog entiti transform fit function defin molecul genet proof techniqu effect author belief search transform framework complex base model question difficulti remain address futur work probabl base optim approach address issu area simpl replac migrat step standard parallel ga probabl model exchang potenti greatli reduc amount commun synchron parallel simpl ga model search potenti pose risk overwhelm function evalu time search comput overhead case simpler probabl cga mimic altern implement fix search algorithm heurist approxim algorithm search encod origin linkag specif approach reduc complex model search sampl popul build correct structur spectrum function evalu time popul analysi bayesian network yield power algorithm paper optim euclidean direct probabilist model offer accur methodolog model arbitrari binari encod space probabl model framework suggest deal trivial extend optim complex structur program issu deserv algorithm complex analysi difficult simpl estim overhead cost simpl ga problem straightforward calcul complex probabl high level select requir solv problem role select correl featur detect probabilist model theori explain depend algorithm select search framework offer partial answer puzzl search mixtur optim decid applic ga oper probabilist approach settl problem problem efficaci question crossov versu mutat theori provid huge advantag optim simpl result extend solut problem refer tm element inform theori john wilei genet intern confer genet algorithm pp genet analysi complex vol pp linkag effici solv problem bound difficulti genet illig technic report illinoi polynomi fast messi genet illig technic report illinoi distribut graphic model evolutionari unpublish manuscript genet standard genet cmu technic report increment method integr genet search base function optim competit cmu technic report compact genet ieee confer evolutionari pp machin learn mcgraw hill de viola find optima estim probabl densiti advanc neural inform process vol genet algorithm search optim machin learn adapt natur artifici system ann model genet continu paramet optim evolutionari vol num crossov genet intern confer genet pp morgan
HCI/1646 4 amulet model effect user interfac softwar develop brad rich rob alan andrew ellen bruce andi alex patrick doan human comput interact institut school comput scienc carnegi mellon pa abstract amulet user interfac develop environ make easier programm creat graphic user interfac softwar window macintosh amulet model undo object system model distinct class instanc method data constraint system object comput arbitrari code support multipl constraint solver anim attach exist object singl line code input user handl object support behavior object output model declar definit graphic support automat refresh command object encapsul inform includ support wai undo kei featur amulet design graphic object behavior object explicitli repres system provid number includ automat displai edit extern analysi control interfac amulet integr capabl flexibl effect manner index user interfac user interfac develop user interfac manag system research sponsor contract arpa order view document author interpret repres offici express govern amulet environ introduct creat user interfac softwar proven difficult challeng modifi studi found averag applic code devot user implement time devot user interfac portion todai toolkit interact tool hard lack flexibl creat kind call add support gestur difficult todai tool user interfac develop environ run window window facilit user interfac research develop amulet aim make implement evalu user interfac significantli support flexibl style amulet includ design implement innov includ model undo addit incorpor innov amulet open architectur enabl user interfac research develop easili investig innov amulet system support multipl constraint solver oper time research easili investig kind constraint solver undo model support design widget implement open fashion amulet research replac modifi widget goal research implement part interest reli amulet librari aim amulet student gener develop make amulet easi learn suffici perform document attract wide audienc stand automat manufactur usabl learnabl editor implement amulet base group substanti experi creat garnet user interfac develop environ implement common lisp amulet bring dynam rapid user interfac design implement capabl garnet provid ad capabl amulet structur implement part user properli call applic framework amulet environ gener refer collect widget button kei reason amulet higher level support system user interfac object inspect manipul standard protocol util provid reimplement applic graphic widget list graphic object move resiz select standard object facil provid amulet includ undo oper save load paper overview part amulet system figur simpl circuit design program creat amulet amulet environ goal import research object amulet project provid support insid applic program convent toolkit macintosh toolbox motif provid collect widget button text input field graphic applic draw cad visual languag chart program user interfac deal content graphic widget user interfac shown figur toolkit provid possibl palett provid main area circuit drawn programm code directli window manag level support amulet support kind graphic automat constraint automat wire attach circuit widget select handl make interact behavior easi edit load directli librari modif facil made amulet model make compon structur user interfac applic visibl manipul standard util distribut amulet feel demonstr innov amulet sound facilit technolog transfer amulet public domain free version amulet juli version version includ complet sourc visit send mail make amulet research research project world includ number thesi project level student aim amulet continu strive make amulet easier learn success suit microsoft visual basic show provid function easi unlik amulet natur growth path complet system amulet ten provid feedback refin interfac amulet environ gener develop amulet gener user interfac softwar construct amulet run window window macintosh provid high level document perform complet refer manual includ tutori commerci product built amulet circuit design build applic circuit design program figur program work standard click palett circuit element work window creat object type grid lai object neatli wire drag sourc gate destin gate usual feedback select handl object object drag standard multipl object select standard hold shift kei click object drag region wire stai attach element drag resiz gate standard edit oper gate attach wire remov oper circuit diagram save file load back program provid advanc program simul oper circuit show valu calcul gate input node toggl output displai correct valu anim make execut understand repeatedli back user gestur creat kind object button option keyboard kei press path start end posit user draw make make make line make dot gestur make easi correct error applic run window window macintosh widget platform amulet environ microsoft foundat visual borland java code applic ten thousand line code entir applic requir line due amulet featur graphic object automat refresh interactor handl standard behavior command object handl edit oper constraint maintain relationship object gestur recognit kind interactor special form constraint rest paper describ featur amulet make creat interact applic easier graphic object import goal make amulet easi learn larg number featur concentr give amulet uniform structur base simpl concept main concept amulet repres object set slot object object system implement top object distinct class object prototyp object slot hold slot hold slot similar member variabl instanc variabl object system import dynam creat run dynam type slot hold integ time string hold method inherit dynam determin instanc local slot object creat make instanc call prototyp instanc start inherit slot valu slot set valu object case immedi copi valu origin creat instanc set slot pictur support separ export amulet start amulet environ object serv prototyp creat object special object amulet librari creat instanc put set oper chain previou code make object simpli ad part window ad screen graphic screen repres object screen accomplish simpli set slot object valu made red execut slot amulet automat object overlap screen appropri updat complet program amulet displai string window cover uncov program page long motif void main amulet window screen default valu text object add window set string window handl input event amulet interactor make object respond instanc interactor object attach graphic type interactor handl type behavior make object interactor attach interactor start left button hit easili chang set slot interactor select amulet environ instanc made object amulet make instanc part button graphic interactor object design make instanc widget instanc primit object set widget amulet librari defin multipl program written compil microsoft window macintosh edit sourc correct feel target platform command object interactor widget oper call alloc instanc command execut method slot method pretti command object slot support redo enabl disabl provid command object amulet librari chang code quit ad window form complet exit button press constraint import featur amulet support relationship declar maintain system amulet support multipl kind main kind formula act spreadsheet formula put slot formula comput slot base slot object object formula constraint arbitrari code work standard method access valu slot invok insid addit return set depend slot amulet constraint depend constraint recalcul left scroll region figur stai amulet environ tool size tool palett formula slot defin formula call return int pixel return macro defin formula object return type argument object argument macro defin procedur execut code macro procedur bodi gestur recognit type interactor object support gestur recognit interact tool call design exampl gestur desir interfac associ string gestur design associ oper command provid standard interfac direct manipul creat delet gestur part code handl gestur circuit program work hold button set object show gestur progress set gestur classifi read file creat tool set command handl gestur recogn list gestur defin set gestur gate add set defin gestur set creat set gestur gate add set set set amulet environ anim amulet flexibl constraint kind constraint solver creat facil creat anim constraint solver anim constraint attach slot slot anim constraint remov reset slot smoothli set slot valu interpol move red number wire circuit code creat anim object creat prototyp number move readi start creat instanc set posit end wire anim anim set left top end time anim make object move smoothli detail design amulet toolkit divid number layer figur layer includ abstract interfac window model set interact layout tool section describ design amulet environ window window macintosh object system constraint system input handl output handl command object graphic input layer widget interfac builder figur structur amulet system abstract interfac window manag amulet portabl interfac window manag call stand graphic event manag gem ordinari object mechan provid simpl graphic input interfac rest amulet code written gem port window system chang toolkit framework provid interfac gem requir graphic underli lowlevel window manag draw interfac typic amulet user gem part amulet framework provid access capabl easier circuit program figur requir program gem layer export gem interfac advanc amulet user programm make call gem directli widget button implement output garnet amulet widget implement effici draw routin object system regist layer amulet implement object system top object amulet environ distinct class object prototyp object slot prototyp inherit prototyp slot instanc overrid felt creat object system due number defici found system dynam rapid prototyp requir user interfac dynam chang slot type content slot import determin complet inform object run time partial address interfac support abil overrid method requir make interfac amulet uniform featur elabor section slot program object system style convent languag code devot defin slot default valu prototyp creat possibl overrid slot creat instanc prototyp program set set slot set type object system dynam slot object ad remov object run type slot chang amulet perform type check type declar slot set work type provid accessor set method standard void amulet special class call type programm store object wrapper amulet handl memori manag wrapper refer count amulet environ overload capabl make interfac conveni class defin number set set set set int set float set char set const compil correct base type note set return origin set code set slot obj overload function chosen base return return special routin primit type code int bool statement work matter type slot line special type permit programm dynam access set type slot inherit instanc object slot inherit valu prototyp object slot prototyp instanc overrid properti chang slot chang easi circuit program run macintosh window chang slot affect local programm amulet inherit slot copi local instanc made slot copi copi slot creat prototyp affect instanc slot declar slot instanc slot hold inform object definit slot hold connect input output wire declar local copi instanc made instanc circuit element uniqu wire amulet environ user duplic circuit amulet ensur copi start input output slot empti inherit mechan import distinct object slot copi instanc prototyp affect instanc amulet model requir slightli prototyp chang properti prototyp effect instanc immedi method import featur amulet object system distinct method instanc overrid inherit method easili inherit data convent model smalltalk instanc method case instanc uniqu convent system mechan regular method creat subclass singl instanc subclass time button widget regular method draw mechan procedur user click instanc button callback draw method callback mechan circuit set method tool panel user select clear method code method put slot data set macro work similarli macro creat method object type argument method object invok function return type argument argument paramet list fourth argument extra set macro defin function method bodi function macro amulet environ hierarchi object system implement hierarchi owner object part group primit line text found hierarchi independ graphic relationship support hierarchi object system amulet provid mean instanc made group instanc instanc prototyp shown figur distinguish slot normal slot refer object instanc pointer object creat instanc result programm creat instanc type object primit system make instanc structur prototyp chang simpl bitmap group bitmap line input output port requir chang prototyp chang pictur instanc part figur object bitmap call output input port instanc line object instanc turn instanc instanc made amulet automat creat instanc part instanc amulet make append number call made part scroll part part visibl amulet environ slot inherit valu prototyp inherit owner constraint mechan easi flexibl suffici constraint slot valu owner prototyp amulet special form group call comput part dynam object constraint build list base singl prototyp call list creat instanc item prototyp set slot instanc list programm defin constraint item prototyp depend copi list note due flexibl amulet constraint system slot item depend list valu suppli list string suppli list object list locat scatter plot featur amulet object system featur programm automat memori manag refer count scheme object type put amulet object full flexibl mechan procedur attach object slot invoc slot chang mechan enabl amulet object graphic properti chang programm creat demon type check slot support programm declar slot hold specif kind complet set queri function object properti examin debug facil applic program perform main disadvantag model convent model perform slot system perform search object slot search prototyp root search method data slot dynam type check add overhead forward backward pointer space type add space overhead system extens compil techniqu remov found perform amulet system good amulet environ notic delai normal size program varieti modern hardwar platform circuit program perform macintosh pc platform optim previou garnet object system speed copi valu prototyp space amulet store local practic half slot discuss advantag model distinct class method mean fewer concept programm learn consist mechan advantag object system dynam flexibl properti object set queri run interact tool easili read set properti todai toolkit implement form hold properti amulet object system significantli flexibl capabl amulet object system system appl gener magic amulet design complet fix number problem experienc includ ad control inherit automat manag hierarchi prototyp instanc support multipl constraint flexibl demon mechan worth point provid dynam slot dynam constraint preprocessor script languag garnet support multipl found constraint mechan copi valu complet flexibl control omit simplifi amulet implement lead easier understand object creation procedur effici search slot elimin ambigu complex programm resolv slot multipl prototyp design support creation graphic amulet user discov object system repres intern applic data flexibl dynam natur object make ideal vari chang data type amulet object amulet environ artifici intellig system ai applic find model constraint system maintain data depend consist data structur constraint amulet integr constraint solv object system mean constant number slot object express comput express refer slot object express automat constraint primarili rendezv kind constraint resembl spreadsheet call amulet constraint express arbitrari call check insid formula invoc addit return set depend link constraint slot amulet syntax constraint macro creat constraint object code constraint object store pointer procedur constraint debug list slot constraint constraint circuit program determin pictur button base note constraint return type constraint return imag amulet bitmap int return return return circuit program custom constraint count constraint built object object constraint width height slot comput dimens base current string formula set slot standard set futur hope add preprocessor support convent notat slot access constraint express insid set procedur amulet environ slot access constraint constant code calcul button widget care imag comput constraint object system ti graphic system demon slot programm set due object automat pictur constraint depend part slot object figur slot object constraint depend input button wire slot button pictur slot constraint depend object wire creat cycl constraint amulet constraint solver handl cycl slot object depend slot object vice versa circuit program button valu input wire present toggl button shown figur constraint constraint button evalu circular amulet simpli cycl constraint evalu programm constraint valu correct effect set mutual depend indirect constraint amulet constraint system support dynam comput object constraint constraint comput object slot refer constraint width maximum updat compon ad remov compon posit circuit amulet environ program gate comput access input wire object input slot indirectli access line object gate calcul int int return illeg constraint system handl kind constraint import support object inherit instanc creat amulet creat instanc constraint object constraint refer object indirectli structur group figur constraint top comput base center sibl pictur return note input output port object share calcul valu pictur place indirect contraint form constraint thought relationship multipl valu paramet librari predefin basic relationship frequent found user interfac worth reiter unlik system suppli predefin amulet code constraint multipl constraint amulet slot multipl constraint time find situat inherit formula correct oper programm addit formula valu flow multipl direct set constraint slot button widget object displai input button widget constraint slot make slot chang valu user click widget constraint coexist amulet constraint system multipl constraint amulet environ invalid request recalcul slot multipl constraint invalid amulet evalu constraint invalid side effect experi garnet suggest peopl put side effect constraint express amulet constraint eagerli evalu arbitrari side creat destroi object constraint object creat instanc item prototyp base list slot constraint creat object constraint evalu formula constraint put singl effect multipl output simpli set slot side effect constraint end point wire put slot set int int side effect effici return unlik previou system rendezv amulet requir programm special mechan side regular set creat call work store constraint evalu queue constraint evalu creat constraint simpli ad end queue amulet continu evalu constraint queue queue point amulet object chang side effect programm care avoid situat creat infinit loop constraint side effect evalu time valu amulet order constraint evalu check cycl discuss programm set set constraint invalid side effect constraint slot set valu matter constraint evalu termin constraint cycl depend side effect constraint calcul set infinit loop result amulet environ multipl solver import research area user interfac softwar creat kind constraint solver amulet architectur multipl solver coexist addit solver amulet support solver call anim constraint solver web constraint arbitrari number input output dynam comput depend formula constraint web track order depend chang solver slot line polygon consist line object set input slot set point base slot call set slot call height set line move chang orient slot width normal formula mechan necessarili evalu constraint correct web maintain origin order slot final result correct anim creat anim constraint solver anim object ad anim interfac difficult task todai situat effect anim constraint detect immedi restor origin slot seri valu interpol origin valu advantag previou approach anim constraint provid significantli modular programm independ control graphic start end valu path time anim anim attach exist widget type vertex list boolean number anim constraint special effect figur show effect constraint ad slot menu librari anim constraint provid includ support effect amulet environ programm creat custom anim suffici figur anim constraint ad slot menu make fade grow top anim constraint ad exist applic singl extra line make easi explor anim undo oper anim object back origin make easier user happen code support anim small number travel wire circuit program line anim construct game figur dynam visual amulet environ figur bullet bomb control simpl move anim bullet top screen simpli attach anim constraint slot set slot design add anim web constraint amulet modifi object system standard protocol solver ad slot list set constraint depend set constraint slot depend messag slot set chang invalid notifi slot current access current messag slot send constraint chang slot notifi constraint slot constraint slot invalid invalid request constraint calcul slot slot send messag slot constraint expect gener constraint option return case slot send messag constraint constraint return slot origin amulet environ valid main research question scheme order constraint multipl solver coordin set polici implement amulet queri constraint order invalid practic constraint graphic polici proven adequ develop constraint continu investig issu perform formula constraint valid correct time regular formula procedur formula call depend formula updat typic found constraint output model graphic object layer amulet call object program aggreg layer hide graphic part gem conveni interfac programm retain object call structur graphic model displai list programm creat instanc graphic object polygon add group window amulet automat part window uncov properti object chang free programm deal refresh object simpli creat delet properti set automat handl object creation layout data displai list tabl make heavi object constraint model amulet graphic object amulet object properti object programm care simpli inherit default valu prototyp ad part graphic group simpli method due structur programm simpli creat instanc copi group primit object system automat make instanc copi part simpl program short retain object model amulet provid facil program applic includ automat shown figur amulet effici algorithm calcul object amulet environ affect object affect object back front doubl buffer provid amulet elimin flicker figur collect object color star chang simpli set amulet star object overlap amulet toolkit includ select handl shown rectangl support move grow object interactor program interact behavior hardest part creat user interfac toolkit window manag provid stream raw input event window programm interpret manag garnet introduc model handl input refin amulet interactor object type implement kind interact move object select set object make graphic object respond programm simpli attach instanc type interactor graphic graphic object handl input event interactor oper similarli wait start event object set object interactor move circuit element figur wait left button circuit element event interactor start run object click process event move interactor process move left button abort event interactor user suppli separ object dot rectangl origin object move interactor abort user hit amulet environ kei program call abort origin object restor origin feedback object interactor back wait start event interactor complet button feedback graphic object updat alloc section interactor highli programm abort object interactor oper aspect grid object select type interactor amulet choic object set user move object interim correct item final feedback show final select choic interactor select set button menu object dynam creat graphic editor paramet choic interactor includ singl multipl item select shot happen immedi event button press object keyboard kei hit graphic object move chang size drag indic widget move grow object graphic editor paramet support grid minimum size point enter creat object user drag rectangl defin object paramet includ point minimum size text edit support edit text string text object paramet includ flexibl kei translat tabl programm easili modifi add edit function function support standard text edit behavior gestur support draw object delet set object select gestur defin gestur trainer figur easili ad convent direct manipul interfac write addit code ad gestur circuit program amulet environ line associ gestur exist command gestur recognit amulet algorithm creat dean rubin figur interact tool gestur creat gestur set circuit program shown file written describ gestur read gestur interactor applic stand trainer base similar tool garnet interactor implement amulet paramet simpli slot programm set leav default valu constraint comput paramet slot interactor constraint depend global constraint singl amulet environ interactor determin object move grown base button held interactor oper object attach import featur amulet interactor oper set object choic interactor select element interactor attach window manipul object ad part window interactor make choic base type object attach programm explicitli desir circuit code creat line note constraint make behavior correct tool palett select creat line drag circuit program select handl widget provid amulet librari select move code written function exampl applic show interactor move select object note simplest object made interact singl line move left button held part ad grown button part select left button discuss interactor model success implement idea smalltalk mvc design model view present control manipul view previou includ origin smalltalk view control tightli control reimplement view chang vice versa system andrew interview amulet environ combin view control object call interactor serv graphic object model implement amulet object regular data structur contrast earlier amulet interactor independ graphic interactor chang chang interactor set graphic modifi chang independ interactor time graphic object confid type interactor suppli amulet suffici cover behavior found todai interfac evid claim applic creat hundr applic creat programm interactor underli window manag event time type interactor fundament kind input speech input standard set method overridden base interactor prototyp common design system graphic object standard set method event select move visual basic design programm code method activ user click drag object number advantag amulet design explicit object repres behavior graphic significantli greater common featur enabl disabl provid singl graphic object manipul behavior object make debug trace enabl extern tutor altern interfac speech gestur control interfac modif graphic object exist behavior logic widget amulet suppli complet set includ check radio widget draw routin microsoft macintosh feel figur amulet widget widget toolkit provid flexibl control programm investig behavior creat amulet environ handl support multipl peopl oper widget time applic widget complet integr constraint command properti widget comput action widget repres command object section easili undon kind button menu widget accept bitmap arbitrari amulet object displai label toolkit string easi amulet standard button queri object size draw circuit actual prototyp gate displai button construct bitmap pictur gate widget easi constraint comput paramet design place circuit enabl disabl widget base global state lai appropri amulet widget extra paramet disabl grei ad actual widget program widget select move click perform normal function featur prove circuit program button prototyp disabl displai tool number grei figur widget amulet window macintosh window run motif widget implement amulet choic control slot default machin set explicitli amulet environ amulet suppli widget insid applic program widget implement familiar squar edg graphic object show select select object move resiz figur circuit program widget disabl grow stai size toolkit requir programm select handl standard behavior programm add instanc widget window command object interactor widget oper simpli set slot object valu comput constraint click button circuit program valu wire comput constraint extra action requir amulet alloc command object call method amulet command provid slot method handl select undo enabl disabl command messag unlik command object provid singl place describ behavior command promot command behavior group undo suppli librari applic chang retain object model mean standard access manipul object circuit program standard oper librari command amulet behavior highlevel command command intern command improv modular command limit local action featur circuit program delet command delet select delet attach wire circuit program command delet attach link command command undo method put wire back amulet environ undo oper amulet support undo programm standard interactor command oper automat write extra code programm creat custom command perform delet wire gate custom undo method written found amulet object constraint model make write undo method easi valu modifi data structur store directli command object applic data structur modifi support undo applic data repres amulet oper implement set slot method simpli save valu slot undo method restor valu part undo method built suppli command move object obj applic implement hidden model part connect view part command object restor view constraint automat propag back model oper global design develop underli data structur directli support case undo method command invok undo method data structur experi suggest vast major store data command object work amulet command support investig undo mechan amulet suppli undo mechan develop singl undo multipl undo microsoft word version form undo previou includ scroll select repeat repeat select figur show dialog box suppli amulet environ support style user select execut command multipl undo command object copi put global undo histori valu command programm put limit number command limit amount memori requir research creat undo mechan integr amulet system figur dialog box user access regular undo redo oper button scroll button oper command select list number undo repeat repeat object show object command button command oper multipl object separ separ command command repeat singl keystrok command mark keyboard kei displai command show object radio button scroll select command deselect set object undon interfac builder interfac builder widget laid interact properti set stand graphic interfac layout tool amulet environ interfac builder support creat dialog box static part interfac substanti enhanc capabl tool easi creat complet applic achiev visual basic tool support interpret provid access amulet mechan debug tool debug interact applic requir addit mechan suppli convent develop environ amulet interact inspector displai object trace execut trace displai depend constraint figur programm set breakpoint messag print slot extens error check debug messag make amulet applic easi develop debug make programm amulet common error messag figur inspect wire circuit constraint slot slot inherit shown blue notic shown constraint object amulet environ statu futur work current version amulet window window macintosh project world figur show exampl applic built amulet investig techniqu support speech web access multipl peopl oper time call cooper work import focu interact tool user interfac convent program ultim goal user interfac design simpli draw exampl graphic demonstr interact behavior show interfac react proven faster write code investig ad interfac builder abil sketch interfac idea earlier silk system tool progress interact tool creat game educ softwar demonstr amulet environ figur exampl applic built amulet top data access visual program design aid programm optim parallel fortran program comput scienc bottom pictur system visual discov analyz softwar specif creat class project craig cmu shown amulet web page relat work amulet build year work user interfac toolkit primarili influenc previou garnet toolkit main research project investig model differ amulet environ amulet integr exist languag pure instanc prototyp reflect instanc support constraint research system support constraint idea indirect constraint integr constraint object system origin garnet integr constraint preprocessor special constraint solver amulet formula constraint integr solver garnet inspir amulet goal provid architectur make kind investig easier rendezv design creat applic lisp rendezv multipl constraint attach variabl rendezv requir variabl explicitli declar implement algorithm rendezv requir constraint defer toolkit provid mechan support constraint system requir write method object anim amulet interactor model base garnet command object support undo introduc system includ interview kati introduc idea hierarch event explor implement issu long histori research undo amulet specif design mechan explor select undo mechan amulet closest mechan add abil repeat previou command undo select scroll amulet user interfac develop environ model undo enabl interact applic creat easili model directli support kind activ common kind provid modular behavior due greater separ behavior graphic amulet research object constraint gestur recognit undo interact specif user interfac amulet environ excit potenti amulet effici platform perform user interfac research hope popular user interfac educ implement real system innov amulet integr model make effect support todai tomorrow user interfac acknowledg user amulet find bug improv system myer refer shneiderman queri inform implement acm confer pp kp mh brown approach construct user comput graphic pp select undo mechan graphic user interfac base command acm transact comput human vol pp effici implement languag base sigplan vol pp acm confer system languag chang ungar cartoon user acm siggraph symposium user interfac softwar technolog pp gleicher graphic toolkit base differenti acm siggraph symposium user interfac softwar technolog pp rendezv architectur languag construct acm transact vol pp se system effici flexibl constraint evalu graphic usabl colleg georgia institut technolog se hudson smith acm siggraph symposium user interfac softwar technolog pp system amulet environ se hudson jt support user interfac reusabl acm siggraph symposium user interfac softwar technolog pp ds ba myer program demonstr hierarch event intern confer lectur note comput vol pp ge st descript user interfac paradigm journal object orient vol pp ba myer sketch earli stage user interfac human factor comput system pp ja ba myer exist user interfac toolkit support gestur human factor comput system pp adjunct ma jm pr user interfac ieee vol pp rg commun confer companion human factor comput system pp ba model handl acm transact inform vol pp ba interfac softwar acm transact comput human vol pp ba amulet refer manual carnegi mellon comput scienc depart system ba vander program program write sigplan vol pp acm confer system languag ba support user ieee vol pp ba myer hierarch command human factor comput system pp ba ad anim interfac acm siggraph symposium user interfac softwar technolog pp amulet environ ba myer mb user interfac human factor comput system pp aj andrew toolkit winter usenix technic confer pp nr ii delin pascal user interfac acm siggraph symposium user interfac softwar technolog hilton pp rubin gestur comput graphic la pp local propag constraint solver user interfac acm siggraph symposium user interfac softwar technolog marina del pp vander increment algorithm satisfi hierarchi dataflow constraint comput scienc vander pointer variabl constraint acm transact comput human vol pp jm vlissid ma framework build domainspecif graphic acm transact inform vol pp program publish compani
DB/1647 3 xml data typecheck revisit alon tel aviv milo tel aviv frank neven universitair dan suciu washington victor vianu uc san diego abstract investig typecheck problem xml static verifi answer queri conform output input satisfi input dtd problem studi subset author simplifi framework captur structur xml document data valu revisit typecheck problem realist case data valu present document test queri extend typecheck quickli undecid remain decid larg class queri dtd practic interest main contribut present paper trace fairli tight boundari decid typecheck data valu complex typecheck decid case consid introduct plai crucial role internet applic rang electron commerc web site manag digit govern applic redefin technolog boundari area emerg extend markup languag standard repres exchang data web confirm central role semistructur data redefin ground rule import xml mark semistructur form data type definit constrain valid xml document benefit dtd numer analog deriv schema inform work support part scienc foundat grant number research fund scientif author support part nation scienc foundat grant number permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee pod santa california usa copyright acm relat queri process importantli context dtd valid data exchang typic user commun common dtd produc xml document valid respect dtd issu verifi compil time xml document result queri appli valid input satisfi output dtd xml standard develop basic document definit languag queri transform xml document state flux languag xml queri transform includ xslt xpath xql quilt variat extens dtd consid xml commun recent effort unifi extens singl framework call previou paper subset author investig typecheck problem limit framework structur xml document abstract order label tree circumv lack gener accept notion regular tree languag type wide varieti xml queri languag address gener model tree transform call shown subsum tree manipul core xsl main result typecheck transduc decid input type output type transduc decid result limit chief absenc data valu model easili typecheck undecid transduc augment comparison data valu present paper extend investig typecheck queri comparison data valu focu queri languag style type dtd variant main contribut paper trace boundari decid typecheck problem presenc data paramet consist featur queri languag dtd decid show typecheck decid queri path arbitrari input output dtd condit number children node label extend dtd regular full regular increasingli restrict queri languag establish lower upper complex bound typecheck algorithm upper bound rang pspace open tight lower bound rang pspace undecid show typecheck undecid main decid case extend slightli extens path express type decoupl tag dtd trace fairli tight boundari decid typecheck data valu relat work typecheck xml transform import research problem intens investig prior work show typecheck decid class transform class incompar class transform discuss appli tree data tree power transform type infer restrict class xml transform consid approach extend type regular path express context free grammar express infer type approach type check xml transform function languag style ml type essenti dtd type decoupl tag function defin xml data pattern match regular express perform static typecheck verifi output function claim output type typecheck algorithm write function return result requir output typecheck reject expect languag express typecheck fail simpl function express type check decid typecheck strengthen goal differ make typecheck applic writer languag work meant studi theoret limit typecheck approach typecheck system semistructur data origin type base unord type queri languag combin datalog skolem admit type infer type infer variabl occur queri consid problem consist find type variabl found infer output type xml transform organ paper organ section develop basic includ abstract xml document variant queri languag section present decid complex result complex result provid section section present undecid result paper end basic framework introduc basic formal includ abstract xml data tree data tree abstract xml document captur nest structur xml data valu fix infinit set data valu denot data tree finit alphabet tripl finit order label map node val map node tree denot set node root refer element tag element assign val data valu note restrict number children data tree unrank denot set data tree set finit label order tree data denot type dtd dtd variant provid type mechan xml document notion type data tree correspond close dtd xml slight continu term dtd consist extend grammar alphabet make distinct termin data tree satisfi dtd tree deriv tree grammar tree valid wrt set data tree satisfi dtd denot note dtd place restrict data valu data concern tag usual dtd regular languag describ sequenc children node weaker specif mechan suffici applic paper altern yield restrict kind dtd understand point view note string alphabet view logic structur vocabulari oe binari relat oe unari relat string repres logic structur oe natur order oe iff oe regular languag defin monad logic logic vocabulari string extend side product regular express termin logic augment quantif set power dtd requir properti valid string express simpli logic correspond subset regular call regular build singl symbol ffl complement call dtd regular express refer unrestrict dtd regular dtd simpler class cardin constraint tag children restrict order dtd order order tag output syntax queri factor logic call inspir syntax languag natur number atom sl formula atom formula formula disjunct formula formula word satisfi atom formula occurr similarli satisfact boolean combin atom formula defin obviou sl formula produc express constraint occur produc occur check languag express sl correspond properti structur vocabulari oe express fo order sl form natur subclass regular express refer dtd languag sl unord dtd defin dtd restrict orthogon extens basic present recent dtd xmlschema motiv sever limit basic definit type tag depend tag context occur mean singleton ftg tree differ natur lead extens dtd special call decoupl defin type tag depend context definit special dtd tupl ffl finit ffl dtd ffl map tree satisfi special dtd set special denot homomorph induc string tree denot tree root sequenc tn tn turn special dtd regular tree automata unrank tree evid special dtd robust natur specif mechan special conjunct regular unord dtd queri languag ql queri languag subset queri construct tree pattern node variabl edg label regular path express comparison data valu variabl extract bind match pattern input tree construct specifi construct answer tree bind nest construct extens restrict languag defin basic queri denot ql fix alphabet assum infinit set var variabl possibl definit zk sequenc variabl denot ql queri pair hold ffl consist finit tree set condit tree root node edg label regular express denot set variabl occur canon order condit form ff ffl construct finit tree label intern node label express form sequenc distinct variabl xn leaf node label express ql queri sequenc distinct variabl node label child label ql variabl occur call queri free variabl discuss paper queri free variabl free variabl definit requir construct outermost queri root node label semant ql defin denot ql queri assum ql queri free defin map defin semant subqueri free order variabl depth tree queri input data tree map fl defin output forest fl defin set bind extend construct fl bind queri nest topmost output forest tree queri construct tree fl map fi extend edg label sequenc path spell word condit data valu satisfi condit ff ff ff data denot bind fl set view bind fl relat attribut usual relat algebra oper appli note order node total order variabl induc lexicograph order set bind bind fl output forest fl fl construct bind fl node contribut set node fl ffl label fl includ pair form fi bind fl node label variabl ffl label fl includ node fi bind fl edg contribut set edg fl label ffl label fi bind fl node child children order bind ffl label fi bind fl root forest children order bind fi xml document hold inform movi possibl root movi movi titl actor actor director review ffl figur repres ql queri collect titl movi actor inform actor actor tag note titl answer actor queri requir actor titl review achiev collect review titl nest queri remark note definit address data valu includ output tree make extract actual valu text wai issu irrelev investig dtd restrict data valu framework augment mechan produc data valu output affect typecheck result typecheck problem input dtd output dtd queri typecheck respect iff show section typecheck full ql unrestrict regular dtd undecid led restrict decid case decid result present section decid result typecheck ql restrict ql output dtd main decid involv increasingli restrict fragment ql increasingli power output ql path express defin finit unord output ql tag variabl construct output ql tag regular output dtd highlight interest queri languag dtd undecid result section show decid result tight result concern ql unord output dtd theorem typecheck problem ql regular input unord output dtd decid proof decid shown bound size input check detect violat output dtd ql regular input unord output dtd show exist exponenti node construct violat exist path nk root node nk tag sequenc children nk violat sl formula satisfi written form distinct symbol integ bound maximum integ occur satisfi satisfi vn subsequ satisfi node path nk root nk vn bind subset consist set node imag movi titl construct construct movi titl review actor director figur allen queri path root node note jbj jqj number node bind number node root node bind bound observ tree restrict depth jqj node note node nk children vn bind present sequenc children nk satisfi satisfi bind bind sequenc children nk satisfi satisfi violat minim tree restrict depth node satisfi satisfi properti violat upper bound number node found node sequenc children written node size bound number state automaton regular languag describ sequenc children node occur depth number node depth jqj bound jqj observ path node depth larger jqj path repeat label pump contradict number node depth jqj bound maximum number node depth jqj time yield total bound jqj size simpli guess exponenti size verifi satisfi violat test exponenti time size input time linear exponenti check node sequenc children match regular express test construct output tree time exponenti inequ assum integ written unari form sl formula time exponenti result formula exponenti size worst check exponenti number exponenti number disjunct decid restrict ql queri extend output dtd theorem typecheck problem ql queri tag variabl construct regular input output decid proof proof reduct case output dtd theorem kei observ regular express distinct symbol exist sl sentenc integ size unari linear comput exptim ak proof straightforward induct structur ql queri tag variabl construct output dtd sibl construct distinct tag elimin restrict tag sequenc sibl node answer form distinct typecheck respect iff typecheck respect unord dtd comput exptim decid upper bound follow theorem fact exponenti problem size integ linear size size counter exponenti integ occur sl formula violat construct queri replac construct tag ak distinct bk variant homomorph map regular express exist sl sentenc integ size unari linear comput exptim ak bk clear typecheck respect iff typecheck respect unord dtd comput exptim decid upper bound follow decid result remov restrict output full regular dtd requir addit restrict ql queri limit project perform queri formal definit ql queri input dtd queri project free respect iff input satisfi queri obtain nest queri node mean node bind variabl function depend syntact suffici condit ensur wrt illustr cinema dtd queri node violat actor children bound replac yield queri figur queri collect actor titl movi nest queri produc actor titl actor act queri actor node uniqu titl actor yield differ nest queri bind fix ancestor titl movi node bind uniqu director child replac show technic challeng section theorem typecheck problem ql queri tag regular input regular output decid remain open theorem hold restrict proof theorem ramsei theorem requir develop technic machineri dedic remaind section develop assum ql queri definit project queri obtain replac nest queri node suffic prove theorem loss assum path express singl label disjunct label add extra recal queri denot set variabl bind fl denot set discuss gener notion appli node construct queri defin auxiliari notion node tag variabl definit ql queri node possibl construct hw queri path root queri input tree defin var defin bind induct bind bind bind fl fl bind node defin label form var bind label nest queri var bind definit node construct label form call tag variabl node label nest queri tag variabl tag root node construct definit node construct label form call tag variabl node label nest queri tag variabl tag root node construct simplifi assum node construct tag cs children distinct gener case tag repeat consid input output dtd violat exist path nk root node nk tag sequenc children nk violat regular express ra note nk construct due node construct tag children construct languag ra readili properti regular languag ra fact union vector triplet natur number jn restrict number word posit integ ff ff mod size titl dir actor construct answer construct movi root root movi titl dir actor figur queri exponenti size ra reason ra negat regular express ra proposit ql input output dtd violat iff construct node tag children cn tag variabl xn vector jn ra st tupl size ff posit integ ff ff mod size refer sequel properti modulo properti remain show input dtd queri node construct vector jn defin decid modulo properti hold tree prove suffic show exist size bound function size number jn decid hold simpli check tree size show bound tree size exist loss assum redund symbol observ regular express suffic tree size jqj path bound length check tree maxim depth bound width actual violat instanc obtain replac tree leav arbitrari deriv tree leaf assum sequel regular express note larg due depth width queri bound depth node depth jqj essenti irrelev tree depth actual violat instanc obtain tree replac tree leav arbitrari deriv tree leaf recal view relat attribut standard terminolog tree tree depth jqj tree satisfi ad node depth greater jqj tree satisfi tree minimum size modulo properti set node consist node vector relat oe node vector triplet node size oe node path root node item argu size bound input gener jqj number cs bound gener jqj jqj node sum number account size bound jqj depend input goal show bigger size set node includ node tree obtain remov belong modulo properti contradict minim chosen result tree longer belong interest delet node leav tree end defin notion delet unit definit tree node consecut subsequ ns children call delet unit tree obtain delet root belong properti show proposit maxim delet node number delet unit jt jqj proof note pump lemma regular size delet unit number sibl separ consecut delet unit node sequenc sibl includ node belong delet unit maxim size tree delet unit tree node children node separ node maxim size tree depth tree node ad tree part delet unit case addit node worst distinct delet unit number node jt delet unit size yield delet unit sum number delet unit bound jqj corollari posit integ tree size larger jqj delet unit includ node corollari deriv requir bound size show larger size delet unit remov affect modulo properti delet unit associ vector tu number tupl node modulo set delet unit size jqj associ vector ts number tupl node modulo ramsei theorem corollari larger bound function call ramsei exist set delet unit includ node st number subset size vector vector subset size larger ramsei set delet unit properti tree obtain remov node note satisfi node hold ffl ffl tupl ffl empti vector relat empti singl show modulo remain prove empti relat size posit integ ff comput exact size comput number vector delet show number modulo observ queri delet node affect tupl total effect delet node formula jxj jxj explain formula count separ node delet unit tupl delet node remov note corollari ramsei theorem mention number imag destroi node essenti entri vector subset size number total sum destroi imag node count time fix subtract pair node number tupl node pair corollari ramsei entri vector subset size deduct note time deduct tupl node count time add triplet node number tupl node constant ad deduct maxim number node tupl bound jqj sum stop size reach chose number element sum divid total number assign lost divid definit pick item tupl empti relat empti project result tupl empti tupl modulo contradict minim state ramsei corollari theorem natur number exist finit number set element jy color famili subset size subset ae size jxj subset size color variant easi consequ ramsei theorem corollari natur number exist finit number set element size jy color famili subset size subset ae size jxj xs subset size color color observ proof simpli vector attach set delet unit color number color simpli jn recal corollari tree size larger jqj delet unit includ node rest immedi corollari recal assum begin proof node construct tag cs children distinct left case repeat tag queri output dtd proof theorem construct queri replac construct tag ak children node label distinct tag bk construct dtd replac regular express map easi typecheck respect iff typecheck respect input dtd remain conclud proof theorem complex theorem provid upper bound complex typecheck ql queri respect unord output ql queri tag variabl output dtd remain open complex tight special case complex typecheck brought pspace case input dtd bound depth impli queri bound restrict practic applic shallow dtd relat natur repres dtd depth show proof theorem root depth corollari fix typecheck ql queri respect input dtd depth unord output dtd typecheck ql queri tag variabl respect input dtd depth dtd pspace proof size smallest counterexampl polynomi test candid input counterexampl requir pspace remain open complex tight show lower bound theorem typecheck ql queri tag variabl respect input dtd depth unord output dtd ql queri condit data ql queri equal data ql queri equal inequ data valu proof reduc valid proposit formula typecheck problem proposit formula variabl xn input dtd root xn queri repres figur nest queri return iff child label input pattern ensur set bind nonempti sl formula output dtd obtain replac posit liter neg liter valid iff typecheck wrt proof simultan reduct proposit valid conjunct queri queri consist concaten independ proposit valid conjunct queri subqueri proposit valid sl briefli describ subqueri conjunct queri conjunct queri relat ariti build input dtd ql queri output unord dtd dtd root queri qs construct root pattern construct answer pattern correspond natur pattern recal dp properti form oe oe oe np oe root answer construct qi root xi qi construct xi qn figur queri proposit valid root occur answer answer queri nest queri root collect bind data valu iff answer answer unord output dtd simpli answer proof reduct conjunct queri complet reduct similar output show pspace lower condit data proposit typecheck ql queri condit data valu tag variabl respect input dtd depth output dtd fo proof reduct quantifi undecid result shown typecheck ql queri decid restrict queri languag output dtd decid result requir ql output dtd special section show restrict larg decid show special output dtd lead undecid typecheck highli restrict queri dtd queri path express limit singl inequ test data tag unord input dtd depth unord output nest queri trade disjunct path express form tag path express ql queri yield undecid typecheck simpl output dtd special conjunct previou decid yield fairli tight boundari decid typecheck result show special output dtd quickli lead undecid stringent assumpt call ql queri conjunct path express singl symbol theorem typecheck undecid conjunct ql queri tag variabl unord input dtd depth unord output dtd special proof proof reduct implic problem fd depend set fd depend relat fd construct input dtd ql queri output dtd restrict typecheck respect iff input dtd root encod relat queri concaten verifi conjunct output depend satisfi illustr kind depend portion queri illustr figur note satisfi iff node child label portion queri repres figur note fd satisfi iff pair node child label eq state special unord dtd depend satisfi typecheck iff similar undecid result shown slightli combin highlight subtl nest queri essenti undecid result show nest queri trade disjunct path express tag variabl construct call ql program disjunct path express form singl symbol proposit typecheck undecid disjunct ql queri tag nest unord input dtd depth unord output dtd special root construct answer root construct figur queri depend root construct answer root construct eq wit figur queri function depend proof proof reduct implic problem function depend decid result section assum ql queri show remov restrict immedi undecid simpl output dtd theorem typecheck undecid ql queri output dtd requir nonempti sequenc children root proof reduc post correspond problem typecheck ql queri respect output dtd requir nonempti sequenc children root uk vk instanc bg encod solut linear data tree singl repres path string posit symbol label data data write string symbol data valu solut encod solut string string consecut posit occur string analog instanc bb solut note encod string input dtd root ffl queri concaten check violat correct form encod solut typecheck iff input yield instanc solut detail omit main contribut present paper shed light feasibl typecheck xml queri make data valu xml document result trace fairli tight boundari decid typecheck show typecheck decid queri path output dtd special special typecheck undecid decid result highlight subtl queri languag output decid shown increasingli power output dtd rang unord coupl increasingli restrict version queri languag show decid case prove bound size counterexampl check technic machineri requir intric case regular output dtd involv combinatori argument base ramsei theorem decid case complex typecheck show lower upper bound undecid result show special output dtd queri render typecheck output dtd typecheck undecid stringent assumpt queri dtd queri path typecheck undecid simpl output dtd special question left futur work show decid typecheck regular output dtd queri restrict project free open restrict remov regard close remain gap lower upper bound remain open focu result paper provid insight xml queri type mechan subtl interplai refer thompson xml schema part structur malhotra xml schema part datatyp wood regular tree languag alphabet unpublish weak arithmet finit automata math logik vol pp chandra vardi implic problem function depend undecid siam florescu xml queri languag heterogen data sourc webdb cluet simeon wrap queri languag effici xml integr proc acm pp clark xml path languag clark xsl transform simeon mediat data proc acm pp suciu queri languag xml proc finit model theori comput guid theori san rl bl ramsei theori pierc xml process languag pierc regular express pattern match xml proc acm harper definit standard ml mit milo suciu type infer queri semistructur data proc acm pp vianu typecheck xml transform proc acm pp mitchel implic problem function depend inform neven xml schema order unpublish papakonstantin vianu dtd infer view xml data proc acm pp problem formal logic london mathemat robi design van der meyden complex queri infinit data linearli order domain thoma logic handbook formal ed rozenberg
ML/1648 6 copyright nation research council canada permiss grant quot short excerpt reproduc figur tabl provid sourc materi fulli acknowledg learn extract text turnei februari nation research council canada institut inform technolog nation de recherch canada institut de de learn extract text februari abstract academ journal author provid list fifteen kei page articl kei word phrase prefer call surprisingli wide varieti task discuss paper recent commerci microsoft word veriti search includ algorithm automat extract document approach problem automat extract text learn task treat document set learn algorithm learn classifi posit neg exampl set experi appli tree induct algorithm learn task set experi appli algorithm task develop algorithm specif task set experi examin perform task metadata rel perform microsoft word fourth final set experi investig perform task rel veriti search result support claim special learn algorithm gener learn algorithm algorithm commerci softwar search content introduct applic measur perform extract algorithm relat work corpora appli extract experi learn extract hybrid genet algorithm experi learn extract experi experi highlight discuss note refer introduct turnei introduct journal author provid list kei word articl call kei phrase singl word defin list short list phrase fifteen noun captur main topic discuss document paper concern automat extract text meant serv multipl goal print page journal goal summar extrem form abstract enabl reader quickli determin articl reader field interest print cumul index goal index enabl reader quickli find relev articl reader specif search engin form field label goal enabl reader make search search document match queri term field yield higher qualiti list hit search term full text document serv goal goal share common requir short list phrase captur main topic discuss document section present softwar applic valuabl part document metadata document document skim easili highlight index term search document collect suggest refin queri search engin analyz usag pattern web server log exampl motiv research show util tool automat creat small minor document todai meta tag enabl author includ keyword common practic todai keyword meta tag bia search engin author keyword meta tag likelihood web page high peopl enter queri web search engin keyword tag typic fill huge list bare relev term term intend human consumpt demand exce current suppli defin automat extract automat select topic phrase bodi document automat extract special case gener task automat gener phrase necessarili bodi document section discuss criteria measur perform automat extract algorithm experi measur perform compar document author bodi document ideal extract algorithm gener phrase match author discuss relat work research section close relat work involv problem automat index gener leung index main differ list index length list introduct learn ing extract text topic phrase document index topic phrase list read judg index read entireti automat extract demand task automat index gener extract distinct inform task studi depth messag understand confer inform extract involv extract specif type inform collect report terrorist inform extract involv find specif kind terrorist type incid extract specif goal extract produc topic type factual document extract work experi paper collect combin total document document list document train learn algorithm test collect present detail section approach automat extract learn task treat document set classifi posit neg exampl classic machin learn problem learn exampl section describ appli tree induct algorithm task unusu aspect classif problem posit exampl constitut total number exampl typic appli balanc class distribut set experi evalu wai appli preliminari experi train found bag improv perform bag work gener tree vote classif experi number tree techniqu sampl train data experi support hypothesi bag improv perform appli automat extract experi special develop specif learn extract achiev result learn section introduc algorithm hybrid genet algorithm extractor extract algorithm patent extractor work assign numer score phrase input document final output extractor essenti list highest score phrase behaviour score function determin dozen numer paramet tune set maxim perform extractor set train exampl set experi support hypothesi special learn algorithm gener learn algorithm strongli special learn algorithm perform weakli learn bia suitabl learn problem result support hypothesi bia built suitabl intend task experi show extract applic turnei clear experi algorithm work commerci softwar section gener metadata compar result metadata metadata gener featur microsoft word find metadata significantli closer metadata experi support claim perform suffici good commerci applic automat metadata gener section appli task highlight text facilit skim compar highlight term term select veriti search find select term similar term select veriti search experi support claim perform suffici good commerci applic automat highlight section present current statu work plan futur work conclud section feasibl learn extract text special learn algorithm achiev perform current commerci algorithm automat extract text applic potenti applic discuss actual applic varieti applic import motiv research learn automat extract document metadata growth internet corpor problem document manag grown research metadata essenti address problem document manag metadata document set document standard document includ dublin core metadata element set onlin comput librari marc format librari gil inform locat standard offic social econom data standard digit geospati standard feder geograph data standard includ field softwar tool edit document includ support metadata creation microsoft word store metadata document automat gener metadata figur show metadata templat microsoft word keyword comment field fill select tool menu titl author field fill hand good algorithm automat gener metadata creation highlight skim scan quickli determin topic document highlight practic kei passag sentenc underlin kei special mark kei text special colour highlight facilit skim applic learn ing extract text softwar tool document manag support skim automat highlight veriti search commerci search engin user enter queri veriti search list match document automat gener summari search summar featur figur show hit list search summari automat select highlight bold font good algorithm automat gener automat highlight index alphabet list collect document part singl long document chapter serv index figur show java applet nrc joel manipul alphabet index document collect articl journal artifici intellig research alphabet list gener window type narrow phrase user enter part java applet list word phrase begin user select phrase reinforc learn list window show titl articl extract user select java applet displai abstract paper interact queri refin search engin iter process user enter examin result hit modifi search engin special featur support iter aspect search figur show search engin figur window show metadata microsoft word applic turnei search journal articl journal artifici intellig research search engin develop support interact queri refin figur user enter queri top frame left frame show match document frame list suggest narrow origin queri suggest extract document list left frame queri term combin hit list left smaller iter ad suggest term result empti hit term necessarili document hit list figur veriti search summari automat select highlight bold font figur java applet user search journal articl manipul list automat gener measur perform extract algorithm learn ing extract text web log analysi web site manag visitor site seek web server log file record inform includ internet address client file request date time request commerci product analyz log web site manag typic tool give summari gener traffic pattern produc order list popular file web site figur show output web log analysi program produc order list popular file web tool produc list popular site web site manag insight topic web site popular measur perform extract algorithm measur perform extract algorithm compar output perform measur base number match phrase phrase defin match phrase describ perform measur calcul number match criteria match phrase author suggest gener algorithm suggest count phrase figur interact queri suggest queri refin frame base automat extract document list left frame measur perform extract algorithm turnei singular plural author suggest algorithm suggest count kind network experi match correspond sequenc stem stem remain remov suffix word match match order sequenc match criteria match word convert stem stem porter stem algorithm popular algorithm stem english word algorithm heurist rule remov transform english suffix approach stem dictionari explicitli list stem word encount text heurist prefer due labour involv construct dictionari comput resourc space execut requir dictionari stemmer aggress porter stemmer stemmer map word make mistak figur web log traffic record web server log analyz frequenc frequenc url automat extract web page server measur perform extract algorithm learn ing extract text stemmer correctli map porter stemmer incorrectli map porter stemmer correctli map stemmer incorrectli map found aggress stem extract conserv stem aggress stem algorithm call iter stemmer algorithm repeatedli appli word stop chang stemmer gener output gener output output iter gener output iter manner necessarili leav aggress stemmer recal view extract classif problem document set word task classifi word phrase evalu automat extract algorithm classif correspond classif outcom appli extract algorithm corpu neatli summar tabl variabl repres number time match variabl repres number time human machin phrase variabl repres number time human machin classif phrase match phrase task classif stem classif phrase iter stemmer transform phrase stem phrase person suggest good interpret classifi stem phrase singl number repres perform extract algorithm suitabl function map singl common accuraci reduc matrix singl tabl matrix classif classifi human classifi human classifi machin classifi machin accuraci relat work turnei problem accuraci problem class distribut highli skew neg exampl phrase posit achiev high accuraci guess major class trivial extract algorithm gener empti set input accuraci typic research inform retriev recal evalu perform search estim probabl search engin classifi document relev user relev recal estim probabl document relev user search engin classifi relev recal optim guess entir document collect recal necessarili close document confid relev guess singl document relev user recal close perform measur yield high score recal balanc experi method measur perform method wide research inform retriev examin varieti number prefer show perform vari user adjust desir number recal averag recal recal averag relat work discuss relat work paper discuss automat extract import paper treat problem learn exampl krulwich heurist extract phrase document heurist base syntact presenc phrase section acronym motiv produc phrase featur automat classifi document algorithm produc larg list low low learn algorithm discov algorithm base adapt reson theori neural network recal recal recal relat work learn ing extract text rithm produc larg list low low algorithm applic steier belew mutual inform statist discov approach limit consid extract produc low list phrase steier belew compar mutual inform word pair specif topic area document concern labour gener collect legal make interest observ phrase highli characterist topic area characterist document concern labour higher mutual inform statist gener collect higher mutual inform gener legal collect topic area labour paper explor task produc summari document extract kei sentenc document marsh johnson salton kupiec jang task similar task difficult extract sentenc lack anaphor refer resolv anaphor pronoun definit noun phrase demonstr refer discuss concept sentenc extract context neighbour imposs difficult reader summari determin refer anaphor johnson al attempt automat resolv system produc overli long summari extract avoid problem anaphor list unlik list list randomli permut consequ paper summar sentenc extract describ algorithm base manual deriv heurist heurist tend effect intend gener domain extend heurist domain involv amount manual work paper describ learn train suppli document target summari jang learn algorithm extend domain work algorithm manual deriv heurist manual work train summari sentenc mean standard abstract suitabl advantag extract standard suitabl train learn major bodi document kupiec al jang bayesian statist model learn extract kei sentenc bayesian approach applic extract bodi relat work address task inform extract inform extract system seek specif inform predefin guidelin guidelin specif topic area topic area report terrorist guidelin inform extract system identifi terrorist organ involv victim type attack inform type expect typic document topic area arpa sponsor seri messag understand relat work turnei confer inform extract system evalu corpora topic includ terrorist attack corpor merger inform extract system manual built singl topic requir larg amount expert labour highest perform messag understand confer achiev cost year intens program effort recent work demonstr learn algorithm perform manual construct system soderland lehnert tree induct learn compon inform extract system view predefin guidelin topic area defin templat fill inform extract system soderland lehnert slot templat handl group tree train special slot node tree base syntact featur presenc word inform extract extract opposit end continuum rang end continuum requir substanti algorithm intermedi point continuum task identifi corpor busi task introduc sixth messag understand confer call entiti recognit task competitor task evalu system achiev score entiti recognit easier extract system linguist rule recogn entiti relat work address problem automat creat index leung leung kan provid good survei work gener class index intend human reader call index intend inform retriev softwar engin search engin index suitabl human index occurr word stop document collect index tend index import occurr interest word phrase search engin index singl phrase research experi extend search engin index phrase result experi phrase impact perform search engin worth extra effort requir gener interest human index relev search engin index leung kan address problem learn assign index term control vocabulari involv build statist model index term control vocabulari statist model attempt captur syntact properti distinguish document index term document inappropri result control vocabulari make difficult compar work algorithm examin studi small sampl control index term found term bodi document corpora learn ing extract text algorithm suitabl automat gener control index term substanti algorithm suitabl automat extract worth note list control index term grow bodi literatur leung kan softwar continu train nakagawa automat extract simpl compound noun technic creat index compound noun score formula base frequenc compon noun document nakagawa evalu algorithm compar index index van rijsbergen simpli minu experi averag correspond suggest index easier gener factor complic comparison nakagawa english nakagawa index gener assist bia result favour algorithm main featur distinguish index list length nakagawa document typic assign index typic index term intend cover index term intend cover small part document extract algorithm gener index break long document section page index gener algorithm gener select index term page book distinguish featur sophist index simpli alphabet list term hierarch major index term indent list relat minor index term corpora experi paper base document list tabl target set gener hand journal articl creat author articl email student creat web page creat author web page journal articl corpu select journal articl list tabl full text articl web author suppli articl journal cognit behavior brain scienc preprint hotel industri intern academi hospit chemistri molecular mix journal variat perform extract algorithm journal field journal field hotel experi chemistri journal challeng automat extract tabl indic statist vari journal corpora turnei author word rare author word final column ag author full text articl keyword test set remain journal train set chose split result roughli train case test case random test abil learn algorithm gener journal random split result train set sampl articl journal test set articl journal repres train set result train document test document tabl document collect corpu descript number train document number test document total number document journal articl articl academ journal email messag email messag nrc aliweb web page web page aliweb search engin nasa web page web page nasa langlei research center fip web page web page govern feder inform process standard total tabl sourc journal articl journal url number document journal intern academi hospit research journal molecular design behavior brain scienc preprint archiv total corpora learn ing extract text email messag corpu collect email messag nrc messag incom intern nrc mail extern mail messag repres typic messag exchang corpor institut environ student creat email messag instruct student creat list kei word email messag select phrase bodi subject field give definit gave student exampl journal articl avoid explain algorithm design student finish creat individu creat corpu homogen journal articl corpu web page corpora tabl show variat statist properti messag journal articl word email corpu tend slightli longer journal corpu reflect tast properti email messag data randomli split test train randomli messag train test result train messag test messag aliweb web page corpu collect web page aliweb search public search engin provid nexor web search engin spider collect web page index spider program gather web page expand initi list url hypertext link web page aliweb unusu spider collect web electron peopl enter url add aliweb index form field store aliweb url tabl statist journal journal averag number standard deviat percentag full text document word word document journal intern academi hospit research journal molecular design behavior brain scienc preprint archiv journal corpora turnei substr search queri string common letter english set maximum number match intent search gather random sampl web page entri list search result delet duplic entri entri poor left distinct web page impress web page typic submit aliweb suppli author web page tabl show statist corpu note web page corpu intern journal articl corpu separ journal email corpu separ recipi word word tend fewer word journal articl corpu email corpu full text web page corpu test data test train set corpu subject lower qualiti corpora test suitabl train nasa web page corpu collect web page nasa langlei research center technolog applic group web page describ technolog web page intend attract tabl statist number messag averag number standard deviat percentag full text document word word document tabl statist aliweb web page corpu descript statist statist averag number document standard deviat averag number word standard deviat averag number word document standard deviat percentag full text corpora learn ing extract text interest potenti industri partner custom page includ list tabl show document short fewer found bodi document corpu corpora corpu test fip web page corpu gather web page govern feder inform process standard document defin standard govern depart conform comput hardwar softwar document includ list tabl document long bodi document unusu number document includ inform process ignor distribut similar distribut email messag corpu corpu test test train learn algorithm perform test data significantli train data inconveni learn algorithm requir type document experi random split document train test set design experi test abil learn algorithm gener data preliminari found learn algorithm gener test data main factor influenc qualiti gener averag length document train compar test set reason learn short document long document tabl select part journal articl corpu train learn algorithm handl long document part email tabl statist nasa web page corpu descript statist statist averag number document standard deviat averag number word standard deviat averag number word document standard deviat percentag full text tabl statist fip web page corpu descript statist statist averag number document standard deviat averag number word standard deviat averag number word document standard deviat percentag full text appli extract turnei messag corpu train learn algorithm handl short document train corpu similar test respect document length appli extract set tree induct algorithm classifi phrase posit neg exampl describ featur set bag method sampl train data featur vector convert document set featur vector make list phrase consecut word document word word iter stemmer section find stem form phrase uniqu stem gener featur tabl access featur build tree leav tree attempt predict class tree predict class vector phrase tree phrase suitabl output human reader stem form evalu perform tree preliminari evalu settl featur tabl tabl show number featur vector gener corpu vector train vector test larg major vector neg exampl paramet set assum user specifi desir number output document standard tree user control tabl correspond test train data test corpu train corpu number document number document journal articl test subset journal articl train subset email messag test subset email messag train subset aliweb web page email messag train subset nasa web page email messag train subset fip web page journal articl train subset appli extract learn ing extract text number featur vector classifi belong class ran gener tree tree gener probabl estim class vector user specifi select vector highest estim probabl class addit option set level confid prune result minim prune option set minimum number exampl form branch tree train set minimum compar default paramet set result bushi tend overfit data tabl descript featur vector featur descript featur type stem form phrase match phrase ignor frequent phrase stem phrase output calcul featur ignor number word phrase continu occurr stem phrase normal divid number word document stop continu occurr earliest occur singl stem word stem phrase normal divid number word document stop continu frequenc stem phrase normal divid number word document stop continu frequenc frequent singl stem word stem phrase normal divid number word document stop continu rel length frequent phrase number charact normal divid averag number charact candid phrase continu phrase proper base frequent phrase phrase end final base frequent phrase phrase common base frequent phrase class stem phrase base match stem form experi learn extract turnei preliminari found bag paramet set work conjunct bag bag tree bag involv gener tree vote classif tree induct algorithm low bia high varianc bag multipl tree improv perform reduc varianc bag impact bia combin probabl estim averag vote preliminari experi train obtain good result bag tree ad tree effect sampl train data standard approach bag randomli sampl train sampl replac preliminari experi train achiev good perform train tree random sampl train data standard approach bag ignor class distribut class sampl correspond distribut train data tabl posit exampl constitut total number exampl modifi random sampl procedur sampl exampl class class improv perform preliminari experi train data strategi suggest kubat al call sampl kubat al found sampl significantli improv perform highli skew data experi learn extract section present experi experi establish baselin perform configur section bag gener randomli sampl train equal number sampl tabl number featur vector corpu corpu number document total number vector averag vector document percent class train journal email test journal email aliweb nasa fip experi learn extract learn ing extract text class experi vari number tree result support hypothesi tree tree experi vari ratio class result support hypothesi sampl improv perform experi vari size random sampl result confirm hypothesi sampl sampl experi baselin algorithm baselin configur bag tree train random sampl train equal sampl class perform measur desir number phrase set measur separ document averag calcul corpu figur show baselin perform plot show test data tabl model gener aliweb nasa journal model gener fip corpu tabl show time requir train tabl show time requir measur time averag time document train involv gener featur vector randomli sampl train build tree tabl show time step test involv gener featur vector document tree tabl show time step code written execut pentium ii run window nt tabl show phrase select baselin configur articl journal articl test desir figur experi baselin desir number extract experi learn extract turnei number phrase set phrase bold match author iter stem algorithm section tabl experi train time baselin configur corpu number document total time make vector random select make tree total journal email tabl experi test time baselin configur corpu number document total time make vector tree total journal email aliweb nasa fip tabl experi exampl select phrase articl base rate author base rate ecolog probabl top base base rate rate probabl cell assembl evid process word author brain cell event relat gamma lexic power spectral synchroni top cell cognit brain word cell evolut author motor system top cognit modern cognit psycholog experi learn extract learn ing extract text experi vari number tree experi test hypothesi bag improv perform task automat extract figur show desir number phrase set number tree set rise number tree except fip corpu note previou difficulti gener journal articl train data fip test data tabl test rise pair tabl show test collect tree significantli desir number phrase set case tree significantli tree fip collect experi vari ratio class experi test hypothesi sampl handl skew class distribut figur show percentag exampl class exampl set fall percentag tabl show test collect drop sampl posit compar figur experi effect vari number tree experi learn extract turnei email collect benefit balanc sampl class reject hypothesi sampl data preliminari experi train data suggest sampl tabl experi comparison tree tree corpu number document number phrase averag standard deviat confid tree tree journal email aliweb nasa fip figur experi effect vari percentag class hybrid genet algorithm extract learn ing extract text hypothesi support test data experi vari size sampl experi test hypothesi sampl train data result larger sampl figur show sampl size sampl size except email messag corpu fip web page corpu tabl test pair tabl show test collect sampl rate yield sampl desir number phrase set support hypothesi small sampl size bag larg sampl bag work combin model heterogen sampl size make model homogen hybrid genet algorithm extract experi wai appli automat extract section present experi algorithm learn extract achiev learn algorithm motiv develop algorithm genet algorithm extractor extract algorithm patent extractor document input produc list output extractor twelv paramet determin process input text paramet extractor tune genet algorithm maxim perform train data tune longer train process complet tabl experi comparison posit exampl posit exampl corpu number document number phrase averag standard deviat confid class class journal email aliweb nasa fip hybrid genet algorithm extract turnei paramet discard learn system call tabl experi comparison sampl rate sampl rate corpu number document number phrase averag standard deviat confid sampl rate sampl rate journal email aliweb nasa fip figur experi effect vari sampl rate hybrid genet algorithm extract learn ing extract text train system call extractor minu extractor conceptu descript extractor algorithm describ extractor abstract level ignor effici actual extractor softwar essenti effici implement algorithm ten step extractor algorithm figur summar ten step step conceptu independ step repres separ sequenc effici actual implement step tabl list paramet descript mean paramet clear algorithm ten step algorithm find singl make list word input text drop word charact drop stop word stop word list convert remain word lower case stem word truncat charact advantag simpl form stem speed flexibl stem truncat faster porter stem algorithm aggress stem adjust chang low stem truncat aggress porter stem high ten add suffix find singl stem score singl stem select top singl stem find stem phrase score stem phrase expand singl stem drop duplic add capit final output figur overview extractor algorithm hybrid genet algorithm extract turnei truncat aggress control level aggress score singl uniqu count stem text note stem word tenth word posit assign score stem score number time stem multipli factor stem multipli frequenc stem multipli frequenc typic greater frequent stem receiv high score rare stem receiv low score control weight earli occurr versu weight frequenc earli occurr frequenc good clue stem obviou clue combin select top singl rank stem order score make list top singl stem cut list list arbitrari improv effici extractor act filter elimin lower qualiti stem find stem make list phrase input text phrase defin sequenc word consecut interven stop word phrase boundari stem phrase truncat word phrase charact phrase word rare extractor consid phrase word extractor phrase stop author tend avoid stop word stop word author prefer tabl twelv paramet sampl valu paramet number paramet sampl descript length final phrase list length work list factor expand word factor expand word low rank word longer short word rank higher definit occurr definit occurr reward occurr penalti occurr maximum charact fix length stem flag suppress proper noun hybrid genet algorithm extract learn ing extract text score stem stem count stem phrase text note assign score step paramet make adjust base number stem phrase stem stem multipli score stem multipli score typic greater adjust score longer phrase phrase stem necessarili frequent frequent singl stem phrase factor design boost score longer fact longer phrase expect lower score shorter phrase expand singl stem list top singl find highest score stem phrase stem singl stem result list stem phrase list order score calcul step singl stem expand stem longer score calcul step score stem phrase replac score singl stem reason adjust score introduc step expand singl stem stem compar rank stem phrase drop list top stem phrase duplic singl stem expand stem phrase delet duplic rank list stem preserv highest rank phrase stem truncat posit list top singl stem truncat tenth posit singl stem expand stem find truncat tenth posit list stem phrase delet phrase tenth posit list fewer stem phrase add remain stem find frequent phrase input text ten time text frequent phrase stem phrase count frequenc phrase end frequenc phrase set end adject adject middl phrase word phrase end adject penal phrase frequenc phrase set check list common verb word noun verb includ list common word verb noun input text hybrid genet algorithm extract turnei stem expand frequenc set end frequenc set list common presenc input text boost score stem measur step likelihood output add phrase suffix find defin word find capit number capit capit capit inconsist capit inconsist word capit pattern proper noun word proper noun capit made consist capit lowest number capit made inconsist capit made consist capit phrase word text word text number inconsist made final order list lower phrase suffix ad list order score calcul step score phrase base score highest score singl stem phrase length list due step form final output phrase list phrase start output phrase pass phrase output reach end list test phrase capit proper flag set proper suppress proper phrase end phrase longer length measur ratio number charact candid phrase number charact averag averag calcul phrase input text consist consecut phrase shorter rank list candid phrase top list phrase fail test capit pattern phrase word commonli phrase match phrase list stop phrase mean equal ignor includ phrase pass test test procedur capit suffix compar step hybrid genet algorithm extract learn ing extract text screen test step base capit suffix step essenti output intend human reader genet algorithm view method optim string techniqu inspir biolog evolut genet algorithm work set bit call popul individu initi popul randomli gener individu bit creat randomli chang exist individu oper call combin substr parent make children oper call individu assign score base measur qualiti bit respect task fitter individu children fit individu genet algorithm individu tend increasingli asymptot genet algorithm contrast genet genesi gener gener genet algorithm updat entir popul result sequenc distinct gener genet algorithm updat popul individu result continu chang distinct gener typic individu replac fit individu current popul whitlei suggest genet algorithm tend aggress greater select gener genet algorithm preliminari compar genesi tune extractor gave similar averag lower varianc perform repeat chose experi report make comparison genet mutat rate popul focu work claim demonstr superior genesi tune extractor extractor paramet extractor set standard machin learn paradigm learn algorithm tune consist document pair target list dataset divid train test subset learn process involv adjust paramet maxim match output extractor target train data success learn process measur examin match test data assum user set desir number fifteen set remain ten paramet set binari string bit repres ten shown tabl run popul size trial default trial consist run extractor paramet set binari process entir train set fit measur binari string base averag train set final output highest score binari string ti broken earlier string averag train set fit discov achiev high averag adjust paramet hybrid genet algorithm extract turnei phrase output modifi fit measur penal phrase penalti factor vari effect number phrase output equal desir number phrase penalti grow approach squar gap desir number phrase actual number phrase preliminari experi train data confirm fit measur led find paramet valu high averag ensur phrase output modifi learn fit measur base stem truncat fit measur base stem chang chang appar actual output list remain constant fit measur iter stemmer ran select bia mutat rate default set adapt mutat oper reduc surrog crossov oper adapt mutat determin level mutat child ham distanc higher mutat rate reduc surrog crossov identifi posit parent string differ crossov point occur posit tabl ten paramet extractor tune type rang paramet number paramet paramet type paramet rang number bit real real real integ integ integ real real integ boolean total number bit binari total number match human total number phrase output number document train set penalti fit penalti experi learn extract learn ing extract text comparison comparison extractor featur vector show learn essenti featur set algorithm access learn kind model section list differ set phrase share stem set phrase share stem member set identifi share stem section repres phrase set member adjust aggress adjust stem train data design yield high accuraci design yield high high necessarili correspond high accuraci model set valu select top probabl featur estim probabl sensit tune extractor differ desir output desir number gener phrase perform measur averag defin equat ensur boost score gener fewer phrase user request experi learn extract set experi compar figur compar baselin configur configur fair test advantag inform test data perform good afford gener figur show averag test desir number phrase set tabl test differ configur tabl show test collect significantli case perform perform tabl show train time tabl show test time train separ fourth column tabl show averag train time singl comparison slower train faster train comput time number match desir number phrase number match actual number phrase experi learn extract turnei tabl present exampl phrase select set match author iter stem tabl comparison corpu number document number phrase averag standard deviat confid journal email aliweb nasa fip figur comparison experi learn extract learn ing extract text bold tabl train time corpu number document time total averag number phrase journal email tabl test time corpu number document time total averag document journal email aliweb nasa fip tabl experi exampl select phrase articl base rate author base rate ecolog probabl top base base rate probabilist inform cell assembl evid process word author brain cell event relat gamma lexic power spectral synchroni top cell cognit evolut author motor system top cognit experi comparison word turnei comparison word metadata metadata clear mean desir number phrase practic answer question compar commerci softwar microsoft word appli metadata gener section microsoft word featur microsoft word complet word process softwar packag concern featur word featur tool menu main function featur identifi import sentenc document edit identifi sentenc highlight separ remaind text user target percentag text mark import fill keyword field document properti properti form file menu gener document distinct singl phrase word lower abbrevi proper noun user word adjust featur experi histogram figur compar word desir number phrase set tabl show significantli test collect higher corpora significantli higher corpora tabl present word metadata sampl match bold comparison search highlight highlight section continu theme previou practic implic tabl experi comparison word metadata task corpu number document number phrase averag standard deviat confid word word journal email aliweb nasa fip experi comparison learn ing extract text perform compar veriti search appli highlight section tabl experi exampl select phrase articl base rate author base rate ecolog probabl word top psycholog cell assembl evid process word author brain cell event relat gamma lexic power spectral synchroni word top process evolut author motor system word top action figur experi comparison word metadata task il nasa fip ll corpu word experi comparison turnei veriti search summar featur veriti search complet text retriev includ search index web crawler concern summar featur search summar featur enabl search engin displai summari document hit usual document titl summari search consist list highlight sentenc user control number sentenc number sentenc desir percentag sourc document desir experi search automat gener summari sentenc list phrase automat highlight search phrase list match iter phrase highlight list search make highlight list intersect summari search extract desir number phrase set fifteen phrase extract phrase summari gener search phrase summari stem word phrase match stem consecut sequenc word summari number phrase highlight list direct partial control indirectli vari number sentenc summari figur plot search highlight function number sentenc summari tabl show significantli higher search test collect tabl show highlight list sampl document tabl comparison search highlight task corpu number document number sentenc averag standard deviat confid search search journal email aliweb nasa fip discuss learn ing extract text section discuss current statu extractor plan futur work current statu extractor extractor compon softwar technolog corp softwar extractor product technolog extractor virtual research assist product facilit extractor softwar extractor written dll link api program api fulli document process separ thread document multithread process web page extractor current time work english french document built set paramet long short document english french algorithm french document algorithm english document section extractor automat detect languag document appli algorithm paramet valu futur work ad german capabl extractor begun figur experi comparison search highlight vari number sentenc turnei work prototyp algorithm significantli algorithm english common abstract level plan add capabl select import automat gener summari document plan add mechan recogn improv perform extract present approach task learn extract text approach appli tree induct algorithm bag sampl experi support claim bag sampl experi led suspect learn algorithm perform algorithm present algorithm experi support claim perform practic implic set experi obviou practic question good answer question peopl subject opinion qualiti mix phrase phrase peopl select survei necessarili answer question phrase good extractor make list averag journal articl quarter speed automat extract make applic econom feasibl tabl perform search highlight task evolut author motor system number search psycholog base intern held imag achiev organ link tradit psycholog oper enabl behavior driven plan mechan unpack singl intern held idea seri action languag mechan pack seri linguist event idea process result monitor speech psycholog plan includ organ grown psycholog cognit neurosci search process search environ learn ing extract text subject superior test practic compar commerci tool perform metadata gener highlight set experi support claim superior word algorithm gener metadata fourth set experi support claim superior search algorithm highlight commerci algorithm machin learn experi lend support claim machin learn valuabl approach automat extract acknowledg elain sin calgari creat email messag corpu joel martin write java applet illustr figur colleagu nrc ottawa construct critic note microsoft word trademark regist trademark microsoft corpor veriti search trademark regist trademark veriti implement porter stem algorithm written jim australia implement includ extens porter origin handl british spell stem implement written implement part mg search develop group peopl australia zealand mg code phrase refer intern crime organ journal author order gener specif order applic consid order import attempt order produc import import commerci call lead english bibliograph scientif technic literatur electr control comput inform technolog produc institut electr engin record field control vocabulari index term free index term inform tree routin written quinlan wrote featur vector gener routin random sampl routin code carefulli written speed extractor written demonstr version extractor demonstr version train user make adjust turnei sourc code sourc code genesi program written add step winnow phrase select step path lead algorithm algorithm point algorithm advantag algorithm adjust stem procedur step path lead gener fewer randomli select phrase phrase perform note fit measur evalu perform phrase match match list trademark regist trademark softwar virtual research assist trademark regist trademark technolog extractor offici mark nation research council canada refer lr automat electron public sentenc select inform process arc classifi technic report statist california berkelei bag predictor machin phrase structur queri inform retriev annual intern acm sigir confer research develop inform pp acm hp method automat extract journal associ comput jl experi automat phrase index document comparison syntact method phd depart comput cornel report york unifi approach automat index inform retriev ieee jj user guid genesi technic report comput scienc jj optim control paramet genet algorithm ieee transact sh develop document summar system effect inform servic riao confer inform search pp canada learn ing extract text ap applic linguist process automat abstract gener journal document text view morpholog infer process sixteenth annual intern acm sigir confer research develop inform learn user inform interest extract semant phrase hearst aaai spring symposium machin learn inform access aaai press descript sra system sixth messag understand confer morgan kaufmann machin learn detect oil spill satellit radar imag machin trainabl document summar ea annual intern acm sigir confer research develop inform pp acm statist learn approach automat index control index term journal american societi inform dd evalu optim autonom text classif system ea annual intern acm sigir confer research develop inform pp acm jb develop stem algorithm mechan translat comput hp automat creation literatur abstract ibm journal research product rule system messag summar american associ artifici pp aaai press messag understand confer morgan kaufmann fourth messag understand confer morgan kaufmann messag understand confer morgan kaufmann sixth messag understand confer morgan kaufmann compound kei word gener document hierarch cluster art model intellig data elsevi turnei extract index word manual riao confer inform search pp canada cd construct literatur abstract techniqu prospect inform process pa identif import concept highli structur technic paper annual intern acm sigir confer research develop inform pp acm mf algorithm suffix strip autom librari inform jr program machin learn morgan kaufmann jr thirteenth nation confer artifici intellig pp aaai press syntact approach automat book index annual meet associ comput pp acm automat theme summar text trainabl modul inform extract journal artifici intellig export statist analysi topic languag casei symposium document analysi inform pp van cj inform retriev edit butterworth algorithm select pressur intern confer genet algorithm pp morgan kaufmann
ML/1649 6 discov associ rule base imag content carlo edward omiecinski colleg comput georgia institut technolog georgia abstract focu data mine paper concern knowledg discoveri imag present data mine algorithm find associ rule color imag algorithm major featur object auxiliari imag creation object mine emphasi data mine imag content auxiliari domain knowledg experi explor feasibl approach synthet imag set geometr shape gener test initi algorithm implement result show imag mine base content compar result rule obtain manual identifi shape analyz reason discrep suggest direct futur work introduct discov knowledg data store typic relat focal point work mine advanc secondari tertiari storag coupl low storag standard data form accumul vast collect imag data mine discov valuabl knowledg problem imag mine combin area imag imag data mine attempt combin associ rule research imag understand comput vision commun initi step tap wealth knowledg mine focu paper feasibl work support part grant lm nation librari medicin trend mine nonstandard multimedia data digit imag consid type multimedia data current knowledg discoveri technolog extract knowledg data type relat work mine imag content mention interest prototyp simon fraser call multimedia miner modul call modul obtain associ rule restrict simpler rule relat inform color descript involv specif object identifi automat import system discov knowledg set imag sky imag analysi tool program studi astronom imag tree statist optim classifi object obtain imag segment process imag mine main theme mine larg collect imag combin data mine larg collect imag data concentr mine algorithm extend straightforward manner handl imag data case involv collect weather satellit imageri citi unit state record extend period time data mine object find pattern exist individu citi pattern exist citi case involv medic imageri patient record develop accur diagnosi prognosi imag data patient data prior health famili examin find interest associ data mine system built top imag retriev system system california berkelei cbir system support queri elimin manual index imag content major advantag manual index massiv collect imag impract prone error cbir system prone retriev imag imag mine background motiv typic data mine problem find associ rule data item retail environ groceri associ rule state custom spaghetti italian red wine determin examin custom transact data specif data item groceri item individu custom transact includ subset item gener subset item sold store case assum imag manual index content feasibl present major deviat typic data mine approach numer data imag effici label semant mine high level concept hundr thousand imposs altern reli analysi imag content mine gener descriptor shape size determin automat object imag determin similar attribut approach implement imag retriev imag retriev system effect effici larg imag cbir user retriev relev imag base content cbir queri facilit gener queri class exampl queri class includ text domain concept color textur queri user formul descript imag retriev term color textur queri pose regard text imag medic imag retriev base imag content addit textual point cbir differ tradit system imag retriev base similar record retriev match attribut valu retriev system queri imag properti color implement queri retriev system develop california berkelei queri queri search imag object approach object recognit berkelei structur sequenc increasingli special group activ produc transform raw pixel data small set local coher region color textual space base imag segment algorithm combin color textur featur salient featur berkelei work approach object recognit approach base construct sequenc success abstract descriptor hierarchi group learn process imag descriptor low level group base spatiotempor coher local descriptor central notion group coher major issu identifi segment imag coher region base integr region contour fuse textur shape inform describ learn techniqu develop relationship object class textur shape classifi object base primit descriptor relationship primit data mine import part knowledg defin autom discoveri potenti inform inform statement describ relationship set object confid statement simpler relationship individu instanc object mine process gener pattern accept certainti interest fact knowledg discoveri deriv success reason techniqu artifici expert machin learn statist paradigm induct learn bayesian statist mathemat taxonomi appli knowledg discoveri knowledg discoveri amalgam concept field effici import comput problem mine determin techniqu appli number wai cluster object cluster learn exponenti algorithm exhaust search cluster impract gener algorithm grow faster larg made great improv effici success relat system busi commun attribut improv techniqu effici access buffer disk understood techniqu develop transact process applic access pattern oltp typic access hundr mine entir tabl scan challeng mine develop effici access optim disk imag mine major issu affect imag data mine process notion similar match gener applic breadth data mine practic point view specif applic domain knowledg improv data mine task data mine reli underli queri capabl cbir base similar user interact refin data mine process essenti compon imag mine identifi similar object imag typic data constrain fix set item explicitli label effici transact requir examin item label transact case data preprocess fix record format field exist item domain boolean indic presenc absenc item transact preprocess automat gener imag mine human label object vast collect imag daunt task intend capit recent work blobworld built data mine system top imag retriev system support queri cbir system elimin manual index imag content cbir system berkelei refer system system produc imag possess number attribut imag made collect ten blob repres region imag homogen respect color textur blob textur spatial descriptor descriptor repres vector limit stem qualiti imag content blobworld data mine base associ rule problem find associ problem gener associ rule introduc algorithm call ai mine associ rule algorithm call solv problem relat oper algorithm call apriori algorithm achiev improv previou algorithm rule gener process extend includ multipl item consequ effici algorithm gener rule present present effici algorithm mine associ rule fundament prior algorithm compar previou algorithm reduc overhead significantli lower cpu overhead case definit ffl associ rule implic form ae set refer item call call consequ rule set consequ call itemset ffl support itemset measur statist call support itemset ae fraction record equal ffl confid rule measur strength call confid defin ratio algorithm mine associ rule problem mine associ rule gener rule support confid greater user minimum support minimum confid problem itemset support user minimum support gener itemset call larg itemset small larg rule minimum confid gener larg itemset ae minimum rule valid rule imag mine algorithm present algorithm perform mine associ context imag major imag mine step featur extract segment imag region identifi region descriptor ideal blob repres object step call segment object identif record creation compar object imag object imag label object id call step preprocess algorithm creat auxiliari imag gener imag identifi object interpret associ rule obtain step page appli data mine algorithm produc object associ rule explain imag mine process detail minimum imag disk featur extract imag access featur store imag blob blob descriptor blob descriptor build arrai featur imag featur extract imag perform object identif blob process perform memori auxiliari imag imag show identifi object imag index search content thai segment arrai record mine imag featur process imag perform independ featur extract sequenti identifi object associ associ rule store sequenti text file interpret result process program work larg number transact limit amount memori occupi discov associ segment step intent describ detail featur extract process blobworld system outlin main step involv identifi coher imag region estim scale color select oe produc featur vector vector summari inform color textur produc cluster featur vector expect maxim method domin color determin number group cluster call minimum descript length principl decid segment imag region spatial group pixel region connect appli filter determin domin color gener blob summari inform region region area greater imag area blob import inform region inform includ area consid relev preprocess algorithm basic algorithm find associ imag similar associ find algorithm partit long preprocess imag data preprocess imag identifi label object imag imag queri process algorithm output preprocess step set object identifi object imag step intens similar search imag descriptor segment fi record id number blob descriptor vector bd fr rng object identifi blob endfor object id time true match time object id object id time endif object id object id mark match endif endif endfor mark match endfor endfor unwant match object figur preprocess algorithm actual data mine step requir similar search preprocess algorithm shown figur initi store object id imag algorithm nest loop loop requir compar blob rest imag miss potenti match note comparison made blob imag assum blob descriptor vector dimens algorithm reason segment step produc high number blob number object imag grow bound algorithm number object number imag render algorithm slow gener algorithm fairli fast usual case practic variabl time gener object id blob match time singl object imag similar object object id blob turn similar add object id record record compar rest record match found object comparison discard avoid futur unnecessari comparison similar function compar blob comput impact perform algorithm segment imag treat record transform set identifi object produc record give direct incorpor inform imag imag mine process algorithm handl inform provid addit attribut treat boolean valu similar function similar function blob essenti imag mine program function blob similar threshold vector standard deviat similar function mathemat defin similar blob blob blob formula blob blob vector summari featur repres vector standard deviat match desir featur power mean divid distanc entri clarifi figur similar measur perfect match desir featur approach match low similar object similar object import note distanc color comput special manner color store coordin point locat refer hue satur distanc comput minimum distanc domin color object color point space affect coordin weight leav unchang comput matrix product color vector weight distanc constitut entri differ vector input bd bd similar std dev output blob blob blob blob dist dist blob blob score dev return score similar threshold figur similar function remain featur distanc comput differ blob entri standard deviat vector permit adjust paramet imag mine process discard featur easi pai close attent specif featur set standard deviat close featur relev mine process set standard deviat high featur blobworld system requir standard deviat specif rang specif standard deviat contrast requir standard deviat maximum roughli area permit remain featur posit standard deviat legal featur consid complet irrelev infin assign entri detail descript similar function blob figur auxiliari imag creation import mention auxiliari imag creation step order user make imag mine result web browser tool integr view imag featur object associ rule associ rule shown user fid id id fid id imag show origin imag geometr shape blob imag match blob blob correspond shape happen discuss blob label object id gener preprocess algorithm id rule step slow involv gener imag match process imag mine program run time imag set step allevi fact unmatch blob displai imag gener show imag link view associ text file associ rule text file gener previou step file associ rule statist inform user interpret verifi correct result point show simpl illustr imag mine algorithm work origin imag blob shown figur associ rule identifi object shown figur chose repres imag imag set creat experi set synthet imag explain detail section figur show origin imag left geometr shape white background imag label imag id imag input data domain knowledg show seri blob blob imag label id obtain preprocess algorithm blob close time posit geometr shape case blob correspond geometr shape instanc imag object correspond triangl object background elimin filter blob note imag circl blob blob correspond set shape case blob imag imag blob imag import note object identifi undesir associ rule algorithm elimin coupl case support low import note object rule involv object triangl imag correspond interest identifi happen imag triangl problem featur extract step paramet object identif set color standard deviat contrast standard deviat imag mine result number mine figur imag blob rule gener number number support number rule figur associ rule identifi object similar threshold similar function set tune paramet experi paramet maxim number associ number undesir match remain paramet improv object identif set synthet imag valu set infin data mine algorithm run support confid output set associ rule support confid threshold rule obtain program shown figur rule explain mark figur prefer show entir output program order give reader truth result rule hexagon rule confid correct similar rule squar triangl note rule correct confid support higher hexagon identifi squar identifi origin problem repeat rule larger rule rule squar circl impli triangl imag shape happen triangl rule lower confid confid rule lower imag triangl circl impli happen circl imag identifi object identifi object rule redund case rule rule hexagon impli hexagon analog case rule squar problem origin assign blob shape larger collect imag case rule discov blob set imag rule shown verifi case support confid higher bit lower object incorrectli differ import note run program lowest support produc incorrect rule rule valid imag valid entir set result synthet imag gener test imag mine algorithm creat synthet imag synthet imag start point show feasibl mine imag constrain imag readili determin weak strength approach imag color jpeg format blobworld softwar ucb specif size import note format lossi compress scheme imag qualiti deterior problem synthet problem imag rich inform photograph imag combin plain geometr shape shape experi irregular shape similar letter shape uniform color black border background white textur shape uniform irregular shape technic reason addit object ad corner imag delimit size object featur extract step discard object area repres total imag area geometr shape size color imag shape similar size respect posit orient differ imag make mine process case overlap shape close part object segment algorithm guidelin mention manual gener basic imag replic imag obtain larger imag set experi tabl show summari inform imag creat partit imag class content complex imag id easi mine imag imag id greater difficult imag complex content easi imag shape background shape posit close overlap difficult imag shape background case shape overlap close make imag mine process difficult stress synthet imag complex imag real world attempt mine associ rule creat simpl imag carefulli studi result categori manual automat associ rule max associ size avg support avg rule confid tabl manual versu automat imag content mine qualiti result mention associ rule happen object incorrectli identifi rule gener incorrect identifi gener found match object shape incorrect match filter support paramet associ rule gener object correctli redund match happen blob repres shape match filter rule support tabl present summari result hundr imag compar result obtain manual identifi object imag gener associ rule identifi result obtain current implement imag mine algorithm produc result manual process tabl standpoint assess qualiti result imag unwant incorrect involv happen support minimum support frequenc experi run paramet object identif small imag paramet object identif valu set color standard deviat contrast standard deviat similar threshold similar function set tune paramet experi paramet maxim number associ error unwant match associ rule program set rule support confid background repres object associ rule background interest elimin object identif step import note object identifi tune object identif step find similar object chang valu paramet manner import featur object color contrast varianc color maximum varianc contrast elimin match involv geometr shape object partial hidden rotat posit consid unimport object imag polar shape uniform textur area weight object area make perfect match object rule high support problem experi shape blob blob descriptor match descriptor shape imag problem rule repeat relat shape rule support confid discard rule found correct case actual higher support higher confid case object match object close locat corner imag object overlap close identifi singl object chang featur store blob problem due ellipsoid shape blob fact geometr shape locat corner chang polar descriptor blob object close corner mean determin adequ radiu blob regular shape squar hexagon easili match imag direct consequ circular blob produc imag segment case posit rotat affect mine process case match case corner shape close overlap import aspect shape paramet mine shape plai import role segment step shape affect imag mine result qualiti rectangl shape easili match shape featur complic shape case number factor affect match shape shape match found big blob gener orient chang domin imag featur obj identif aux imag assoc rule tabl measur time imag mine step imag set size color contrast close shape color merg make dissimilar shape object suggest irregular shape gener make imag mine difficult work color imag black white imag color textur import mine geometr shape creat shape mention shape import black white imag accur shape descriptor provid blob perform evalu ran experi sun multiprocessor comput processor run mb ram imag mine program written matlab step perform matlab featur extract process matlab softwar obtain ucb object identif record creation matlab program develop html page creat matlab interpret result associ rule obtain program written section examin perform compon imag mine shown tabl imag set size time obtain averag time execut imag mine program time run time analysi featur linear number slow reason imag size perform degrad featur extract quadrat imag size step repeat run imag mine algorithm time object identif fast algorithm compar unmatch object number object imag bound result time step scale auxiliari imag creation slow time grow linearli imag basi time find rule lowest step imag mine program run time imag set time fourth step consid imag featur exist auxiliari imag creat applic imag real imag current implement set imag ffl homogen imag type imag content program give useless result imag imag peopl remain imag car ffl simpl imag content imag complex produc blob difficult match associ rule obtain harder interpret high number blur boundari larg number differ object size make imag mine process prone error ffl object imag number object imag greater current implement give accur result blobworld case gener blob imag ffl inform imag give inform inform imag data mine directli futur work result obtain improv aspect research effort work task analyz imag repeat geometr shape obtain simpl associ rule make program gener modif work mine specif rule modifi algorithm produc rule rectangl squar find triangl issu combinatori growth possibl mine complex type condit studi deepli problem mine imag complex shape irregular similar letter systemat approach determin optim similar threshold close high threshold mean perfect match accept low similar threshold object similar object find similar threshold imag type interest problem provid user chang tune algorithm wai tune eleven paramet match blob optim tune specif imag type exist possibl segment algorithm perform faster featur extract import note algorithm give mean compar segment region provid suitabl paramet perform object match order imag mine result clear step bottleneck perform imag mine chang object identif algorithm gener overlap object associ featur algorithm gener object consid similar compar gener overlap associ find rule instanc red rectangular object consid similar rectangular object time similar red object mine posit instanc object posit impli object posit softwar featur extract produc eleven paramet describ blob match object present algorithm perform data mine imag initi perform studi posit point algorithm find associ rule imag implement includ domain produc meaningless autom part neg point valid rule discard low repeat rule object unwant match blob repres slow featur extract care tune paramet work complex imag studi problem context data mine imag mine algorithm major featur object auxiliari imag creation identifi object mine slowest part imag mine featur extract part process cbir slowest oper creat auxiliari blob imag object identif associ rule find fairli fast scale imag set size present improv initi approach imag mine result show potenti futur studi rule refer specif object obtain object object object shape object partial hidden imag mine feasibl obtain simpl rule complex imag simpl object requir human domain knowledg obtain result imag great deal amount knowledg extract enorm work attempt combin associ rule automat identifi object obtain match process segment imag result perfect show discov reliabl knowledg automat discov knowledg acknowledg carson california berkelei setup blobworld system navath comment improv present paper refer swami rule set item larg acm sigmod intern confer manag agraw srikant fast algorithm mine associ rule larg intern confer larg data august malik recognit imag larg learn framework technic report tr uc cs malik imag queri ieee workshop access imag video dunn everitt introduct mathemat taxonomi cambridg mine scientif data commun novemb smyth kdd process extract knowledg volum data commun novemb bregler find pictur object larg collect imag technic uc cs knowledg discoveri chapter knowledg discoveri page mit gudivada raghavan imag retriev system ieee septemb cheeseman bayesian classif theori technic report artifici intellig research nasa research ca data search knowledg technic report swami mine associ rule technic report rj octob omiecinski imag approach data mine technic report georgia institut colleg quinlan induct tree machin navath effici algorithm mine associ rule vldb page septemb chee system prototyp multimedia data mine proc conf manag june
HCI/1650 4 rout privaci preserv commun ubiquit comput environ roi campbel denni seung yi depart comput illinoi abstract ubiquit comput comput interact privaci concern account earli design end creat effect distribut surveil dream true electron stalker present preserv privaci user commun anonym creat conceal user system user user enjoi seamless interact servic entiti wander ubiquit comput environ keyword ubiquit anonym secur introduct major advanc distribut system mobil comput converg enhanc global interconnect fuel idea ubiquit comput activ inform space user access run util harvest comput power anytim gener ubiquit comput enabl deliveri integr servic applic longer bound time locat barrier ubiquit comput promot smart sensor actuat devic perform regular provid extend reach tradit comput physic user interact seamlessli surround environ fund grant nation scienc nsf ccr itr author support grant nation scienc nsf ccr nsf eia nsf eia nsf ccr fund depart energi high perform comput scienc fellowship lo alamo nation livermor nation sandia nation laboratori physic space augment sensor actuat locat detect track whereabout commonplac excit comput paradigm sensor plai major role bridg virtual comput world physic world boost product user avail comput resourc featur sever threaten privaci user mention servic exploit malici system administr track electron user encrypt confidenti hide inform flow commun channel insid system gather network address physic locat commun parti lack privaci network distribut system similar concern ubiquit comput environ approach address problem section solut present concern anonym web trust parti store locat inform user author princip paper aim design implement privaci protocol user ubiquit comput environ roam commun freeli preserv privaci privaci protocol prevent system administr system track user detect physic locat system enabl user commun user access comput resourc authent manner physic locat whereabout user configur level privaci enjoi user interfac run mobil devic plan achiev ubiquit comput environ maintain sensor detect presenc user abil posit identifi user combin rout creat user commun privat introduc overlai network form hierarchi perform preserv privaci hide inform origin sourc final destin refer hierarchi rout combin rout base handl limit cryptographi preserv privaci traffic analyz posit authent registr user achiev higher level make harder infer current locat privaci scheme deploi gaia gaia oper system built reflect middlewar layer gaia develop illinoi provid infrastructur form core servic activ inform space construct plethora run gaia os middlewar top instal oper system gaia os glue devic enabl ubiquit comput environ assumpt privaci fuzzi term overload larg varieti thing import clarifi scope user privaci strive achiev ubiquit comput environ goal achiev locat system user system exact physic locat user decid inform person physic user locat anonym parti decid commun user system commun parti commun endpoint decid inform endpoint commun make content commun system user system read content commun assum public kei infrastructur exist user ubiquit comput environ router system assum exist parti trust safe store sensit inform physic locat instanc remaind paper divid section talk relat work section describ detail system section show implement section pointer futur work section conclud relat work present exist research relat system compar amount research effort direct ubiquit attent paid secur aspect ubiquit comput approach attempt achiev anonym internet project provid hide ident commun open network provid commun channel immun traffic provid anonym describ repres work section marc langheinrich warn possibl current ubiquit comput research continu privaci protect system proce describ design principl ubiquit system principl implement current technolog paper good gener guidelin privaci issu ubiquit comput system crucial point paper privaci concern initi stage ubiquit system end ubiquit surveil system approach fit spirit paper integr privaci concern rout previou research privaci anonym internet classifi roughli user anonym anonym commun user anonym aim provid user anonym network hide ident commun peer research anonym commun provid commun channel immun traffic analysi commun parti anonym anonym user anonym solut provid world wide web user anonym central approach hide web real ident web server access user enjoi anonym rerout http packet replac inform packet header websit infer ident approach problem central trust entiti anonym site track anonym user activ singl point failur crowd rubin al approach anonym commun crowd set voluntarili cooper host messag requir anonym channel crowd host enter loop final crowd arriv destin statist forward crowd effect hide commun pattern user similar approach onion rout user deploi set onion router internet achiev level privaci similar crowd onion router form ring constant tcp connect neighbor constantli transmit packet rout packet encrypt multipl kei form onion router forward packet discov sourc destin inform packet approach counter traffic analysi model traffic pattern node network provid real time rerout pad hide commun pattern approach authent user join servic servic reveal problem exploit malici user servic requir user threaten user render privaci protocol useless user authent registr process threaten commun anonym reveal physic problem knowledg product bit direct freedom server scatter internet crowd hide commun pattern user instal client program end host cryptograph protect call connect web surf email user authent system servic approach achiev featur provid servic addit level privaci reveal locat commun peer time knowledg system stop provid servic show privaci privaci kei issu accept deploi ubiquit comput technolog relat research project cricket locat support system beacon deploi activ inform space provid user locat inform cricket rf ultrasound provid accur estim locat user listen beacon messag determin user reveal inform maintain privaci cricket requir user reveal limit action user acquir locat inform user transmit environ authent process user authent system safe interact preserv privaci system design router deploi hierarch fashion user connect directli leaf level call user set upward hierarchi circuit virtual circuit user special call handl virtual circuit set router path intermedi router deduc end virtual circuit user circuit contact higher level router serv contact point user contact point partial inform rout user refer contact point user hierarchi router kei element system conceal ident locat commun parti rerout packet rout describ detail section router deploi hierarch cluster organ physic space call domain hierarch organ router enhanc flexibl easili deploi multipl domain hierarchi construct physic space domain cooper provid privaci user roam meet requir physic space organ hierarchi natur illustr figur hierarchi construct dynam fashion similar multicast protocol construct tree core base tree build root core bob bob campu router alic cs build router figur hierarchi router hierarchi spread multipl domain make harder corrupt router collud illustr figur router leav hierarchi repres portal view gatewai bridg virtual world physic connect point user activ inform space connect system portal repres varieti hardwar includ fix access point wireless rf transceiv portal system detect presenc user abil posit identifi room detect physic presenc user smart room portal user anonym authent reli exist discoveri locat detect protocol exist user locat discoveri servic gaia os assum space support privaci system surveil camera voic recognit user addit physic precaut protect wear mask stai origin object activ inform space seamless interact virtual physic entiti space mechan interact place spite exist alic leaf router router floor router room room room room blur true ident user hide physic locat access commun resourc maintain user regist system shown figur registr place mobil devic mobil smart devic talk directli portal surround physic space mechan involv design special router user system special router refer user alic router ancestor portal alic connect knowledg true ident partial knowledg rout alic exact physic locat alic portal exact physic locat alic back registr process illustr figur devic send registr request nearbi portal portal repli back list router exist higher level hierarchi act user trust parti trustworthi exist root router access space process similar certif author parti internet user pda custom amount privaci enjoi select router suitabl height hierarchi select tradeoff perform privaci router closer root hierarchi privaci inform infer actual physic locat extra rerout conceal select router closer portal perform limit number rerout level privaci figur alic decid design comput scienc router inform impli alic locat comput scienc build campu alic request registr list router token select alic confirm portal figur regist system hierarchi router impli physic campu ultim privaci achiev user root select suitabl establish refer alic select router discuss circuit detail section circuit make authent alic hide exact physic hide ident select portal connect note alic user move room prompt alic repeatedli select origin goal ubiquit comput solv mobil devic configur automat router alic select devic perform registr process transpar alic move area select longer alic warn prompt select priorit list store mobil registr place transpar circuit circuit emploi rout send data packet back sourc destin combin rout limit encrypt data packet successfulli rout provid higher privaci conceal prevent intermedi node recogn ident actual endpoint physic locat recal establish circuit user select user reveal true ident authent physic locat inform section describ circuit set back alic regist system portal fulfil request registr repli back list router act list return piec inform router entri id uniqu identifi router digit certif router digit certif issu trust parti certif inform hierarchi router list router certif direct packet payload handl id direct packet payload payload handl id type size payload type size bit bit bit bit variabl length figur gener format packet router certif user alic select suitabl portal establish alic gener circuit establish packet gener format packet illustr figur field repres handl uniqu router identifi hop rout field assign handl section field singl bit specifi packet upward hierarchi identifi type intermedi router handl packet assum alic select router figur circuit establish packet handl id direct indic packet upward type field indic circuit establish packet payload consist messag ts session stand concaten uniqu id activ inform space timestamp prevent replai attack random session kei encrypt commun user add addit random encrypt messag token present lookup servic detail lookup servic content token section mean encrypt kei predetermin phrase current string circuit establish actual payload payload digit signatur content circuit establish packet shown figur alic transmit packet downward link downward handl id link upward handl id upward handl id portal presenc tabl rout tabl alic inform portal select portal maintain tabl refer portal detect nearbi peopl posit identifi person enter presenc tabl person portal assign user handl id uniqu tabl scenario depict figur alic repres assign handl id user exist physic space portal commun enter presenc tabl field identifi network link port number portal commun user assum portal support commun physic present recogn user packet receipt circuit establish packet portal replac handl id field handl id assign alic presenc shown portal transmit modifi packet parent router receiv circuit establish packet intermedi router attempt decrypt encrypt portion payload privat kei decrypt predetermin phrase decrypt router infer packet meant packet pass upward parent router maintain rout tabl associ handl id downward connect handl id upward connect note link alic link link link link link link figur circuit setup downward handl id link rout tabl downward handl id link user bind tabl user alic upward handl id downward column rout combin handl id link id uniqu upward column handl id uniqu router current router quick lookup rout tabl entri handl id link receiv packet creat associ upward handl id router substitut handl id newli assign pass messag parent process repeat intermedi router router successfulli decrypt encrypt portion privat user chose current router router act user maintain bind shown figur router authent user verifi signatur check fresh timestamp handl id downward link store user bind actual id user figur show actual entri rout bind tabl user alic regist shade entri figur repres entri process establish alic commun secur note infer alic exist hierarchi underneath router exact locat determin router cooper longer path alic locat complet circuit confirm registr alic send back repli packet format repli shown figur handl id set bound alic packet circuit circuit est est payload payload size size payload payload ts public kei session payload alic figur alic circuit establish packet comm comm payload payload size size payload payload payload ts session figur registr confirm packet downward packet type set intermedi router attempt decrypt rout hop session kei router alic transmit circuit establish packet note improv perform point symmetr encrypt achiev confidenti user chosen timestamp prevent replai packet rout back alic manner similar alic commun secur preserv privaci note intermedi router disconnect rest hierarchi router form overlai network convent failur physic partit hierarchi reestablish children fail router connect parent investig algorithm activ maintain resili failur locat user router act behalf commun user place rout packet user locat current user commun user present approach suitabl perform lookup return locat current base approach involv registr lookup pair ldap server rfc describ lightweight directori access protocol user regist attribut ldap subset attribut user uniqu ldap distinguish user inform user base attribut user base user attribut current retriev web server interest techniqu user maintain webpag webpag updat cgi current locat time user regist updat webpag cgi interfac ident user simpli lookup webpag current locat scheme user awar webpag url secur issu prevent malici attack regist user achiev user construct special token sign privat kei token timestamp uniqu id chosen token propag circuit setup section circuit present token lookup servic present ldap cgi script updat forg replai attack timestamp token discard signatur token discard format id id timestamp id id user id ldap id dn timestamp sign privat kei content encrypt content integr commun setup locat set commun channel system assum user commun setup establish circuit regist respect commun place notat user bob initi commun alic bob alic regist bob gener messag id attribut note messag section payload commun packet handl set direct circuit setup messag travel note intermedi router awar messag arriv uniqu determin messag bob base arriv handl decrypt messag session kei determin messag type commun set alic id includ lookup straightforward bob specifi perform lookup base attribut uniqu match alic found base determin id id lookup timestamp ts prevent replai attack asymmetr kei encrypt determin handl alic avoid detail commun call destin handl figur determin gener uniqu handl bob address alic call handl figur set bind form figur bind call commun bind messag bob arriv tunnel index suppli handl bob set bind form figur bind setup inform bob alic send bob id figur messag correspond alic send alic bob send messag destin alic simpli alic send messag destin bob hide ident intermedi router intermedi router unawar endpoint commun commun bob construct messag messag messag propag upstream reach determin note messag pass handl endpoint commun alic bob free encrypt scheme desir duplic encrypt messag forward send messag subscript suggest messag cross receiv rout messag alic rout messag bob note messag commun messag packet format exchang cross messag user bind tabl handl handl id link user alic commun bind sourc dest alic alic alic user bind tabl handl user handl id link bob commun bind sourc dest bob figur commun setup bob bob bob alic secur issu discuss scheme achiev locat privaci alic bob present enhanc add anonym alic connect privaci note awar ident endpoint awar alic locat privaci alic bob preserv intermedi router unawar endpoint deduc locat alic bob fact alic bob commun anonym respect except respect trust fulli anonym connect provid section describ fulli anonym connect achiev achiev goal preserv alic locat privaci intermedi includ import thing note alic deduc bob deduc locat commun alic bob privaci preserv worth mention portal collud locat ident user note portal user select vice portal emploi approach access collud decrypt initi packet receiv portal user system distribut assum portal span entiti feasibl anonym connect note previou alic bob achiev locat connect anonym situat bob exchang messag alic exchang messag bob case alic bob commun full locat privaci connect inform bob bob commun alic commun detail enhanc protocol achiev modifi messag bob send includ encrypt token id call token encrypt lookup kei assum kei awar ident alic send lookup decrypt id determin lookup server creat token encrypt ident token id determin rest proce bob rout packet alic packet alic provid ident alic commun path alic commun bob repeat commun setup alic token differ time due timestamp mention determin bob talk person bob commun peopl regist note involv commun connect longer anonym collud lookup servic determin ident assum trivial larg number spread domain make harder collud recal certif author trustworthi user pick stronger assur distribut trust center place implement incorpor gaia os implement hierarchi overlai network implement corba compon facilit integr infrastructur current corba implement heavyweight rout packet drawback obstacl router experi core highperform implement basic corba servic lightweight implement small devic limit resourc environ commod devic particip rout implement lookup servic singl certif author issu certif user made demonstr implement instant messag applic preserv privaci applic run mobil devic detail design implement found section futur work protocol enhanc optim commun turn attent figur commun bob alic travel hierarchi final alic commun alic bob similar alic bob pai penalti privaci term extra ideal commun shortest path maintain locat privaci commun anonym respect shortest path common router respect alic bob call redirect commun alic bob maintain privaci anonym connect find suitabl scheme optim commun subject futur research outlin approach section ubiquit comput emerg research area great potenti care user privaci ground fair possibl creat ubiquit system avoid undesir contend privaci anonym user ubiquit comput environ consid carefulli begin system design phase paper present scheme preserv privaci ubiquit comput environ scheme meet privaci object set locat connect confidenti describ commun achiev locat privaci connect anonym circuit session kei phase confidenti messag commun user configur secur commun scheme desir direct applic approach ubiquit comput incorpor system gaia oper system acknowledg author prasad insight refer design uiuc technic report march franci base tree architectur scalabl multicast acm yk rm path forward broadcast commun decemb gaia wei traffic analysi commun ieee militari commun confer novemb design principl ubiquit acm ubicomp connect onion ieee journal select area special issu copyright privaci reiter anonym web acm transact inform system secur volum issu novemb roman enabl activ acm sigop european septemb denmark infrastructur activ technic report illinoi kon desk ieee distribut system onlin special issu reflect juli cricket sixth annual intern confer mobil comput network august big pc brother user encount york septemb
DB/1651 3 manag activ storag hierarchi system applic jr suit el ca john burgess kei west avenu rockvil md abstract paper describ system exploit activ storag hierarchi activ storag hierarchi system storag media store retriev data disk describ activ storag type store raw data convert strateg busi inform describ evolut data call atom data atom data store system atom data defin store histor data valu execut queri histor queri describ data inform flow central data store feed data data mart describ commerci manag rm commerci relat system execut sql queri directli data store storag hierarchi conclud overview real world call detail case studi introduct commerci manag system evolv develop ubiquit rang applic dbm base objectori emerg model except system applic primarili disk media storag hierarch storag manag applic exploit benefit optic storag system analyz system exploit complet activ storag hierarchi kei activ data queri analyz tape farm librari optic figur show size reliabl term activ storag hierarchi queri execut data store media storag media raid magnet tape optic terabyt millisecond gb capac terabyt millisecond gb petabyt gb petabyt tb figur perform size tradeoff provid overview analysi commerci storag system provid updat tape optic perform system analyz vldb paper award talk jim grai emerg disk technolog trend kei disk technolog trend storag process capabl claim discuss panel complet storag hierarchi media address applic atom current econom storag media store data tape approxim cost store data disk cost store data optic store data disk interest byproduct activ storag hierarchi paper atom histor data store directli queri user make data disk queri summar paper data queri data move storag hierarchi media custom todai data archiv rare restor queri atom data store data concept evolut histor atom data store inform mine support bill inmon spawn inform revolut data potenti dw data mart architectur philosophi dw architectur dw detail data store strateg reason implicit detail data argument data ag migrat repositori case ad dw concept dw vendor sell notion store detail ad detail data store migrat architectur oper data store load atom data valu data activ feed data mart manag load data data mart perform cost oper data store oper data store oper data store extract logic process central data store figur architectur commerci relat system support queri data store storag hierarchi handl data placement issu describ analyz storag manag paper concentr relat storag centric found analysi storag commerci product activ storag hierarchi call detail applic paper organ section analyz manag system support storag system section describ manag manag storag devic storag media conclud describ futur work manag major wai system storag hierarch storag manag migrat data optic storag implement strategi place marker move optic queri engin understand access data disk data backup archiv copi move data tape optic storag data backup make complet partial copi order restor case disast data corrupt problem data archiv write data optic tape remov data custom decid data archiv data order archiv user restor data delet cumbersom process practic reason rare atom data histor data store storag hierarchi media system support queri storag hierarchi system design optim store data media feed mart data mart data mart data mart data mart work conjunct specif administ movement relat data sql access platform varieti protocol rm run sun microsystem ultra platform figur show rm architectur compon similar major commerci relat system rm consist user tabl data store access option locat tabl data metadata describ compon magnet relat manag session manag parser resolv optim plan gener dispatch executor manag raid optic sm api tape figur relat manag architectur rm logic physic structur user tabl index resid user metadata resid system user metadata store sm file rm user tabl consist tabl segment tabl segment separ sm file user tabl multipl segment depend size user tabl load data tabl extent tabl index segment rm file resid storag devic rm storag hierarchi file definit extent data extent hold user data control data definit extent inform retriev data map extent index rm read index lookup retain extent magnet disk perform buffer enhanc perform hold index hash index df map extent perform buffer longer tabl data extent speed access data add data rm creat tabl segment hash index segment rang index consist index store meta data hash index consist index segment index segment separ rm file index index segment tabl segment hash index hash index segment tabl segment unix file rm metadata rang index resid manag rm unix file system system system tabl system tabl system tabl index rang index separ unix file user tabl user tabl basic unit data storag rm user tabl hold data rm user tabl rdbm user consist column row data row data valu conform constraint column make row user user tabl user tabl tabl data index index user system system tabl system tabl index log index log figur layout rm user tabl file rm storag hierarchi user tabl resid storag devic hierarchi user defin target storag devic migrat path hierarchi store time critic data raid migrat data tape optic data ag rm softwar automat manag storag migrat base user paramet index index provid effici access tabl data creat index column combin column user tabl index base column simpl index index base column compound index rm support index rang index index work queri return multipl row base rang valu index ascend list valu column group column compound column index index map tabl row search index match column valu row rm effici find request tabl row hash index hash index work queri return specif record base specif hash index index base index map extent hit list proprietari rm algorithm effect locat individu tabl row base individu index valu rang index rang index user tabl multipl segment rang index lowest highest column data valu tabl segment user tabl search multipl tabl rm rang index find specif tabl segment request data valu rm hash index find specif data rang valu tabl segment user user defin tabl hash index index segment store rm storag hierarchi set attribut influenc storag manag backup migrat creat user assign user segment index segment store specif user alloc storag alloc storag identifi volum set file set hash index segment store user multipl volum set file set user depend data access perform requir volum volum unit media data record read magnet worm optic disk cartridg exampl rm media volum set physic volum treat logic unit storag volum set control physic group file user identifi volum set hash index segment tabl index store tabl segment hash index segment volum set volum set file set area storag volum set file store file set tabl segment index segment file store tabl hash index segment file set file set minim volum mount manag storag tabl data index alloc compon manag storag tabl data index wai remov rm alloc separ manag storag tabl data index wai remov rm alloc separ perform backup copi user vulner time factor attribut determin creat perform copi backup copi user tabl index data perform copi resid rm magnet disk perform buffer backup copi resid primari file set design rm media user access time factor work rm migrat function data access rm perform buffer maintain suppli free space user assign valu hash index segment mean retain index segment perform buffer longer data faster queri process metadata metadata system compon rm creat manag compon includ system system tabl system tabl system tabl index log metadata store rm unix file system system system rm creat separ directori rm server call system structur system compon specif system compon separ unix file system tabl tabl log system tabl index system tabl rm automat creat set system tabl store system system tabl inform rm system tabl conduct work rm updat system tabl creat read system tabl verifi compon exist account author access system tabl separ unix file user author user queri system tabl submit select statement system tabl index rm automat creat system tabl index specif system tabl creat system tabl index store unix file directori system tabl file oper transpar system tabl log system tabl system tabl log recov system tabl rm updat system copi record updat system tabl log make chang system tabl transact fail roll rm copi imag back system remov chang transact complet rm empti system tabl log system tabl index log system tabl index log recov system tabl index oper index log tabl log manag control hierarchi storag devic redund arrai independ disk optic disk autom tape librari critic system manag data recoveri storag optim media storag cost applic run microsystem ultra server standard system import function storag manag softwar provid common view storag includ magnet disk automat deal storag hardwar failur avoid system provid access method maintain meta data magnet disk maintain index magnet disk optic order access access volum perform volum mount order tape access serial duplex data separ librari singl point failur creat copi data storag maintain volum directori volum recoveri transport system data optic tape optic direct tape serial access cach activ data magnet disk migrat data optic tape futur work paper base commerci product real custom futur work includ feder develop support type function paper activ storag hierarchi potenti optic disk storag provid defin data call atom data applic exploit atom data central data store feed data data mart analyz sql rdbm store retriev data storag hierarchi acknowledg technic public document freeli borrow descript refer deal grow data march pp charl georg ibm data cacm septemb volum pp activ storag space frontier intellig magazin optim place data tertiari storag vldb pp data cacm septemb volum pp vldb page schedul onlin tertiari storag sigmod pp data qed technic publish measur tertiari storag vldb pp storag larg scale data mine vldb page panel vldb storag system applic socrat
HCI/1652 4 ey interfac franci kh quek electr engin comput scienc depart illinoi chicago il juli abstract comput vision role plai interact devic futur comput input devic serv essenti transduc motion energi human agent machin useabl signal input devic organ comput intent human user outlin role comput vision highlight impedi develop approach overcom impedi prospect vision research area hci includ human face facial express lip head orient ey gaze finger hand hand gestur bodi pose track interfac make embark approach begin studi interact modal seek implement illustr approach discuss work hand gestur work base inform vari disciplin psycholinguist concentr commun argu interpret larg number gestur involv analysi imag dynam identifi gestur locat stroke extrema ordin recogn hand pose stroke extrema detail dynam imag analysi algorithm enforc direct spatial direct path cluster vector motion gestur hand locat comput input devic introduct input evolut vantag point interact measur interfac continuum end human full interact semin comput system past requir human activ bootstrap mechan toggl sequenc hand lie end continuum end continuum lie fulli machin scienc fiction resolv ambigu situat form gener user desir specif observ deduc specif knowledg gener user profil conceiv comput journei continuum evolut real world inhabit creator conceptu technolog advanc endow comput abil adapt human thing dictat limit technolog advanc comput speed comput devot time interfac concern advanc memori technolog permit storag resourc dedic graphic screen sound synthesi speech recognit advanc video graphic technolog facilit implement interfac paradigm metaphor interact virtual realiti interact plethora inform visual present approach paper investig contribut comput vision technolog comput evolut comput chang work comput softwar oper artifici intellig research made mark interfac comput made impact humancomput interfac approxim decad research comput vision research ey interact requir discuss impedi comput vision plai role interact advanc applic comput vision mechan human input discuss comput input gener concentr visual recognit hand gestur concret comput input devic serv essenti transduc motion energi human agent machin useabl signal input devic organ comput intent human user evolut comput technolog evolut comput input interact technolog interfac steadili move center comput center human human throw switch sequenc prepar punch prospect input pen gestur inform visual card paper tape reduc interfac load machin machin read keyboard provid feedback termin video termin pattern termin column line scroll ubiquit comput advanc memori comput technolog permit machin enter era graphic interfac point screen metaphor graphic user interfac stage comput transduc human action data stream amen machin interpret user input devic divid provid symbol input keyboard voic recognit provid spatial inform digit trackbal popular graphic user standard graphic input devic comput made marketplac devic track motion stylu flat displai graphic feedback devic facilit symbol data entri mean charact recognit spatial input spatial input devic discuss previou paragraph work world provid graphic point comput screen work limit success interact move confin comput screen displai environ recognit human oper constantli prompt innov virtual visual interact problem space xerox parc user interfac exploit human spatial cognit system facilit collabor collabor interact tool electron exploit user space locat artifact collabor workspac telerobot control exist control devic typic custom tailor robot requir manual dexter control multipl freedom paradigm input methodolog permit user commun inform input devic oper includ glove detect hand configur varieti head tracker comput vision role plai stage comput input devic mention requir user instrument devic exacerb fact devic typic tether clumsi cabl applic comput vision human commun enabl user interact comput natur fashion dai machin acquir input human user human hear feel semin comput vision research perform human face recognit facial express interpret lip read head orient detect ey gaze track finger point hand impedi comput vision hci track hand gestur interpret bodi pose track nation scienc foundat unit state america recent conclud workshop facial express recognit facial anim area potenti role plai human comput interact futur face recognit permit machin custom prefer characterist user explicit user system design cooper work multipl user share electron physic access control comput system home secur system commun system facial express interpret permit machin detect user frustrat system provid assist facial express mean physic impair commun comput lip read channel input speech recognit facilit develop robust speech comput interfac lip read interfac prove effect interfac speech impair model develop repres facial express lip movement build multimedia document repres affect todai document repres fact document futur permit user emb affect marker comput system face read document affect bodi pose track facilit develop virtual realiti system user move freeli virtual reach touch conduct virtual area deserv research effort resourc highlight area hand gestur interpret illustr research approach philosophi prove fruit issu applic comput vision interfac divid technolog challeng research approach technolog challeng met area cost robust comput vision system process volumin amount data high rate data compress techniqu allevi data transmiss storag comput vision requir process underli data resolut desir interpret real world dynam monocular video stream resolut frame system process million pixel comput vision approach involv featur extract match process inher process add comput cost process load comput vision perform mode comput input imag sequenc process produc output interact process critic percept essenti implement user interfac effect strategi render clumsi time lag hand gestur interfac process latenc relat speed impedi cost idea commit vision hardwar softwar interfac world consid pointer driven graphic user interfac interfac incorpor comput vision prohibit costli luxuri challeng applic comput vision interfac inher vision algorithm interfac requir oper condit vari imag background complex variat comput vision system typic sensit condit robust specif domain fairli constrain environ compound technolog impedi issu research approach resourc dedic intellectu resourc research program comput vision alloc interfac research effort tend machin interact system typic domain vision provid input feedback robot oper navig system markedli requir system design high human interact mind issu comput speed partial address advanc comput hardwar memori desktop machin hundr mip process speed common modern system incorpor dedic processor interfac concern speech speech imag graphic screen manag growth cost imag devic fallen continu fall comput equip camera realtim frame acquisit standard configur true digit camera make presenc felt marketplac issu hand avail comput power imag capabl develop defin comput vision applic user interfac applic comput permit realtim interact implement robust achiev engag interdisciplinari research wait research achiev holi grail autonom gener studi interfac methodolog implement exploit inform algorithm build simpler vision system constrain problem detail interfac approach discuss work hand gestur interfac approach approach gestur interpret basic question reason machin vision chief motiv gestur human facil intuit gestur commun pai lip servic intuit develop system complet ad hoc fashion attend hand track technolog answer explor gestur input technolog gestur transduc glove optic flow gestur dexter hand master dataglov power glove gestur interpret usag human question address technolog visual gestur interpret machin vision interpret motion configur hand survei literatur gener gestur usag american sign languag solut gener gestur interpret problem capabl futur human bring broad rang contextu gener cultur linguist gener cognit bear format interpret gestur extract reduc taxonomi gestur make standpoint human amen machin vision present gestur interpret approach suggest applic cad requir input modal gestur realiti commun design gestur point pick thing input modal choic comput unclear literatur round tabl discuss gestur track interpret motion stylu tablet research mit label track stylu respect refer frame gestur input system gestur input user wear polhemu cube manipul figur ship screen point speak carnegi mellon gestur input project involv user hold detector scan orthogon sweep plane light intersect locat robot move lieu discuss term design configur motion human hand gestur perform space tabl discuss gestur manag document project screen turn mark area user wear glove devic gestur pausch william describ system gestur hand configur drive speech wellner describ system user perform gestur tabl top work track finger hand motion involv special glove devic review repres technolog elabor hand hall effect sensor measur bend joint finger produc special fabric optic fiber determin bend finger joint fiber made leak bent amount determin bend fel develop neural network approach interpret dataglov output measur bend finger flat plastic strain gaug dexter hand master virtual project origin approach accur measur finger displac power glove dexter hand master dataglov mechan track gross motion hand applic devic electromagnet devic hand track polhemu make low frequenc magnet field determin posit cube freedom power glove make ultrason transmitt mount glove receiv mount comput screen determin locat hand quarter inch system requir user wear devic hand essenti hand interfac interfac user user devic pick pen type plai music instrument pick cup conveni stiff gestur transduc glove tether machin render cumbersom highli versatil mode interact electromagnet track technolog work workspac aircraft sonic sensor power glove requir front glove point sensor effort hand gestur interpret report describ system track hand wear silk glove mark downward camera system capabl determin hand orient perspect distort mark determin hand posit accur plane desktop hand move dimens height hand desktop imag size cue determin rang camera demonstr system navig virtual space describ system recogn gestur symbol perform light tabl system recogn static hand pose silhouett light tabl backpropag neural net al studi realtim point typic point gestur system oper directli hand side assum point hand extrem point imag subject finger tip posit point rai project finger tip project screen serv target area calibr system user comput calibr trial user point locat side camera detect abduct angl thumb index finger constitut cipolla al describ approach qualit hand gestur interpret motion parallax make assumpt small neighborhood individu hand point algorithm comput rel distanc point camera qualit partial order point order close camera determin exact mark user hand determin qualit rotat hand frame comput exact rotat user util visual feedback increment posit hand desir orient displai achiev explor gestur commun manipul gestur commun gestur goal appli vision techniqu interpret video stream user gestur hand begin comput vision approach design vision algorithm analyz hand salient aspect gestur extract angl joint accur angular veloc model finger hand articul segment import shape inform locat hand respect commun mode hand gestur mode address facilit mode suit interfac virtual realiti relationship speech gestur question answer determin comput vision primit process hand gestur interpret make distinct gestur intend commun intend manipul object orchestr hand motion intend commun affect interpret inform hand movement meant perturb observ hand finger movement meant commun distinct import gestur interpret commun gestur meant visual interpret visual obscur part hand carri inform understand gestur manipul subject constraint ultim gestur visual interpret manipul gestur unimport intend user manipul object virtual implement glove devic transduc hand motion fact comput keyboard manipul gestur devic detect downward finger thrust manipul gestur amen visual system built import distinct lack discuss gestur interact comput vision literatur rest concentr commun gestur turn work investig deriv gestur perceiv human build interfac system interpret nuanc human gestur limit current technolog invari limit abil human user meet technolog machin vision technolog hold interpret suffici number gestur make hand gestur gestur act symbol mimet referenti modal deictic specif gener symbol act symbol act arbitrari transpar opac figur taxonomi gestur interfac practic begin sift inform human discov reason reduct success applic machin constrain space admiss hand spatiotempor characterist gestur cue segment gestur constrain type gestur movement applic hand gestur interact rel frontier studi human interpret gestur long rich histori studi date back seventeenth centuri field psycholinguist long interest studi gestur gener definit dictionari gestur bodi hand head divid gestur gestur obviou commun direct gestur observ interpret mood desir indic direct suggest order realiz comput machin pick unintend gestur comput interpret bodi languag sign indic user alter content inform restrict investig express movement interest comput determin hand gestur perform instruct machin view gestur term movement intend interpret gestur kind motion serv linguist role sign languag larg symbol movement perform relat directli intend interpret figur outlin taxonomi gestur discuss section symbol gestur natur dichotomi appli commonli gestur initi class symbol transpar gestur immedi evid observ predetermin prior convent anthropolog conclud domin practic referenti modal mimet deictic icon deictic specif gener specif gener autonom gestur class observ gestur extens linguist remain cultur differ neglig gestur thought transpar stage social evolut turn opaqu studi american sign conclud sign transpar icon guess mean addit symbol gestur classifi oper independ design object concept index finger thumb circular referenti monei modal gestur serv conjunct mean commun opinion commun hand result understand listen audio transcript exchang gestur modal statement common continu symbol circular motion hand index finger point give scroll object closer depend context accompani commun mode act gestur divid mimet gestur perform refer motion mouth light gestur gener predetermin convent motion convei intent gestur great interest comput input gestur classifi deictic gestur classif determin sole context gestur issu subject select object locat run program point specif deictic gestur deictic gestur elicit ident class object pick member deictic gestur issu subject point object signifi entiti relat subject point pictur signifi york subject perform deictic gestur point object function point crane robot lift deictic gestur type perform mechan differ higher level deal recognit interpret specif deictic gestur kendon make distinct perform absenc perform concurr phonolog note interact manag head rare gestur listen signal understood perform head point note larg confin segment hand gestur narrat event action portrai spatial structur ffl ffl ffl ffl ffl ffl gestur segment kendon describ experi subject view motion pictur requir describ gestur record varieti hand gestur domin subject describ event space time import predomin role hand gestur relat speech qualifi spatial relat spatial volumetr qualifi turn attent separ gestur movement hand movement commun intent except distinct motion phase typic constitut gestur stroke retract stroke salient gestur movement prepar phase orient hand stroke retract phase return hand rest orient hand gestur stroke kendon call sequenc stroke differenti phase veloc kendon interest report experi subject view film segment time good consensu constitut gestur observ express movement movement sharp boundari onset result sustain chang kei observ relev gestur segment limb movement begin sharp movement bodi return origin posit head movement remain posit movement return origin posit gestur movement involv object manipul movement touch oneself cloth express bodi extract movement slow initi phase rest proce phase rate speed threshold return rest posit gestur configur hand stroke form recogn symbol convent motion rest posit result rest posit gestur interpret motion hand movement work volum consid pertin gestur hand movement adjust ey glass move close bodi subject work volum user requir hold static hand gestur finit period recogn repetit movement workspac deem gestur interpret gestur sign languag hand mind gestur assumpt constraint spatial figur continuum gestur david natur gestur usag involv current research investig gestur perform hand simplif permit extens gestur opac gestur human gestur includ librari convent librari chosen reflect common social convent note address gestur gener mimet gestur deem system codifi includ librari hand gestur perform gestur aim machin vision system common sign perform open palm face camera elimin problem recognit process conceptu space occupi gestur interact li fluid gestur perform human rigidli gestur emploi sign languag sign languag carri linguist inform symbol commun gestur make context serv figur human gestur commun kind shorthand express augment modul commun context clear gestur signifi gestur domin descript human hand gestur usag argu emphasi appli hand gestur interfac comput applic gestur mode specif replac symbol data entri compel reason interfac speech restrict modal gestur class scale modifi determin rel size distanc user instruct robot move issu circular hand motion case speed hand movement determin speed robot move entertain class act point direct placement object viewpoint rotat track gross motion hand determin path similar spatial rel figur discret segment gestur space spatial relationship observ sign american sign languag involv movement finger hand obviou finger movement finger hand move oneself denot human observ find finger movement move hand difficult detect permit make simplifi hand gross gestur movement individu finger unimport gestur finger move respect perform hand hand shape gestur gross hand motion bring hand shape final posit gestur hand advanc close configur point configur hand move function human percept incap extract detail chang rapid gross hand movement mean major hand gestur finger hand shape gestur hand held process extract hand configur start end stroke analyz gross motion stroke disregard shape stroke gestur model defin gestur space front subject gestur gross hand space divid discret subspac figur stroke gestur origin termin subspac commun gestur interpret segment gestur stream identifi stroke point continu larg small stop left farther nearer rotat roll pitch track gestur vocabulari extract imag flow hand gestur point loc larg small left farther nearer rel spatial larg small orient rotat roll pitch track spatial figur gestur vocabulari determin subspac gestur origin termin subspac extrema repetit determin imag dynam hand stroke recogn hand configur end stroke figur set fifteen featur formul rule outlin vocabulari gestur describ spatial structur motion includ simpl referenti symbol ad vocabulari appli applic requir input virtual realiti telerobot symbol primari gestur symbol make gestur perform repetit denot extent space wider time gestur vocabulari direct hand rotat constitut actuat signal gestur motion hand desir motion phase stroke inform segment psychologist dynam differ stroke prepar retract gestur quantifi suggest studi dynam essenti segment hand gestur video sequenc abil extract stoke provid inform start end locat stroke path gestur frame frame frame frame figur frame frame gestur sequenc veloc gestur determin intens inform convei understand imag plane dynam hand gestur video sequenc afford progress hand gestur interpret approach comput set vector track boundari move hand comput stage process imag find locat move comput initi flow field describ veloc move edg refin appli varianc constraint smooth cluster vector find cluster repres move hand figur show frame typic video sequenc process system video sequenc frame cover exhibit fair amount motion blur typic data speed hand gestur captur data frame detect move edg suppress extract edg success video imag comput correspond find move algorithm enhanc move edg edg extract import assumpt made background includ cloth textur make assumpt gestur hand fastest move object gener static imag appli variant move edg detector due hayn jain obtain strong edg hand move imag oper comput tempor spatial gradient consecut imag combin fuzzi oper extract thin edg video scene gestur model signal domain estim partial deriv signal respect time partial deriv signal respect vari comput appli sobel direct sobel oper denot convolut sobel oper yield gradient imag imag measur edg intens combin imag imag perform multipl imag yield oper imag imag imag pixel intens measur move edg intens obtain imag pair imag video sequenc frame frame frame frame suppress figur sobel gradient magnitud frame frame gestur sequenc sobel oper produc ridg locat edg trace top ridg appli achiev idea suppress elimin edg point neighbor pixel greater gradient valu edg direct edg direct comput sobel gradient accur diagon direct diagon edg direct perform suppress horizont vertic direct result miss edg point diagon edg diagon function properli horizont vertic diagon suppress case diagon determin observ sign edg direct shown equat diagon pick arbitrarili final binari move edg imag comput note perform calcul move edg respect calcul move edg respect imag threshold move edg magnitud denot frame frame frame frame jj jj jj jj jj jj jj jj jj jj jj jj figur move edg detect frame frame gestur sequenc defin relat determin diagon vector appli equat figur show gradient magnitud imag comput sobel oper video frame figur displai move edg point comput system absolut differ correl initi flow field comput domin edg point comput edg point correl maxim suppress notic larg number edg point exhibit high gradient magnitud figur elimin move edg imag goal step find veloc move edg edg veloc comput domin edg point veloc comput reduc comput load interest speed edg point correspond edg imag comput correl process edg point veloc calcul chosen edg point chosen pixel window imag system work window move edg point adjac edg point chosen edg point satisfi constraint exist veloc calcul window constraint chanc veloc calcul import edg point imag comput formal window set imag edg coordin order comput veloc edg determin correspond domin edg point imag frame pixel imag frame number difficulti determin veloc chief apertur problem render comput veloc orient perpendicular edg global inform determin true veloc address problem introduc constraint smooth veloc field approach similar smooth constraint vector field conceiv comput smooth set vector origin select set vector endpoint set candid endpoint order set initi vector comput set candid vector endpoint domin edg point section serv vector origin set candid veloc vector edg point obtain set vector determin set candid endpoint correl appli comput point correl minim absolut differ imag region surround vector origin set slide window target imag equat jj jj varianc constraint applic jj jj jj jj jj jj ds ds observ candid match close spatiotempor edg constrain slide window move singl pixel subsequ edg imag gener form modifi threshold remov low correl point candid neighborhood maximum edg displac import notic comput origin intens imag edg imag simpli constrain search space candid match algorithm suffer cumul error previou comput stage obtain initi estim vector field select endpoint yield minimum absolut differ correl figur present initi veloc field comput algorithm frame displai figur vector describ gener direct hand fair number erron vector select set vector endpoint candid set vector chosen minim express repres normal veloc chang imag vector field enforc spatial smooth constraint veloc field equat varianc function minim min veloc pair affect sum minim squar express avoid unnecessari squar root comput find global optim chosen edg point candid minim global smooth function gener problem greedi algorithm work data set approach minim varianc point switch veloc vector point elimin veloc vector frame frame frame frame figur initi veloc field comput frame frame gestur sequenc vector cluster path smooth jj jj jj jj jj jj sd algorithm start estim veloc progress refin refin continu refin make differ threshold maximum iter count refin made iter oper iter summar switch vector vector greatest express switch perform greater small threshold refin permit switch threshold remov point point remov sum threshold point remov add exclud point back point ad sum threshold exclud point ad precomput varianc contribut current set avoid repeat comput contribut initi increment pair refin affect contribut updat figur show smooth veloc field comput video sequenc shown figur observ field significantli compar initi veloc vector shown figur frame righthand figur hand cluster short vector label describ correct hand vector set longer vector nearer center frame origin locat boundari ow strength edg regular set match give rise vector field direct hand movement system deal individu vector final cluster vector determin congruent set cluster coher tempor direct motion vector frame close point gener direct deem belong cluster algorithm determin cluster frame iter fashion vector consid turn exist frame frame frame frame hand figur smooth veloc field comput frame frame gestur sequenc frame number posit pixel posit posit result figur posit plot left hand perform gestur cluster compat creat includ vector includ cluster vector ad centroid vector origin averag direct vector cluster updat vector frame system locat gestur hand fastest move cluster frame appli path criterion locat centroid averag direct cluster predict locat hand frame linear project fastest move path assum repres move hand perform experi video data tape gestur video tape digit sequenc frame frame process data full resolut frame acquisit system figur plot centroid posit cluster vector repres gestur hand centroid comput vector origin gestur gestur perform left hand version gestur gestur vocabulari figur hand move horizont path left video imag cluster constant frame system miss vector repres digit result shift centroid cluster upward figur plot compon averag veloc cluster vector veloc comput absolut differ correl smooth note veloc comput independ centroid posit frame number veloc veloc veloc ii star journei home figur veloc plot left hand perform gestur ur show characterist curv hand move left remain constant horizont gestur figur plot averag vector magnitud direct cluster direct hand motion constant end gestur subject lower hand slightli system process full video quarter frame softwar run mhz silicon graphic workstat reduc imag size system oper half frame scienc fiction motion pictur star crew transport back time present confront contemporari appl macintosh pick great brought mouth inton characterist illustr point paper interfac devic commun comput mean thing result accid histori innov research work tool dai layout result manual comput vision role plai interact devic futur outlin vision role comput vision highlight impedi develop approach overcom impedi illustr approach discuss work hand gestur interfac interfac make embark approach begin studi interact modal seek implement gestur involv familiar relev literatur frame number vector magnitud ector vector magnitud vector direct suppress absolut differ figur magnitud direct vector plot left hand perform gestur vari disciplin psycholinguist involv dialogu research field arm develop model realiz comput vision survei literatur work hand gestur found dynam vision plai kei role interfac human oper dynam world interact domain space time color vision plai role realiz interfac develop system comput motion gestur hand base inform glean human gestur usag system emploi move edg detector accentu move edg suppress stationari edg local algorithm extract domin edg point local edg point seed point correl success imag video stream flow field conform direct spatial direct path comput vector candid gener field minim local direct varianc constraint comput local hill climb algorithm applic varianc constraint effect smooth field vector align local field variat entir imag vector cluster spatial locat direct cluster group frame path determin dynam path trace hand present plot typic output system valid comput approach unoptim code achiev oper gener singl cpu workstat expect target updat rate realtim implement typic point devic updat mean system real oper acknowledg refer byte ieic transact inform system ieee transact pattern analysi machin intellig iec transact journal cognit neural scienc advanc neural inform process system ieee transact pattern analysi machin intellig ieee transact pattern analysi machin intellig system comput japan transact institut inform commun engin acm sigchi bulletin order speed expect interfac methodolog testabl frame goal reachabl parallel faster comput research support nation scienc grant number ma easier vol pp feb extract target imag face identif classif vol pp oct roberto recognit featur versu vol pp oct facial express optic vol pp ma turk ap vol pp ba dt tj neural network identifi sex human ds touretzki morgan san motion estim facial imag vol pp june terzopoulo synthesi facial imag sequenc physic anatom vol pp june mase optic flow vol pp mase read optic vol pp recognit enhanc lip vol pp ieee transact cybernet ieee comput advanc volum iapr workshop machin vision applic commun acm virtual realiti virtual realiti system virtual realiti spring confer virtual realiti fall confer virtual realiti softwar technolog confer ieee transact pattern analysi machin intellig iapr workshop machin vision applic pattern recognit pentland automat visual recognit spoken technic report mit media lab vision realtim head motion detect pp kp te jm dynam calibr vol pp robert jk comput vol pp juli robert jk interact hr hartson pp ablex publish detect point action dec control object vol pp juli christoph control virtual pp comput pp franci gestur interfac pp mar franci gestur franci hand gestur pp aug control graphic vol pp june human motion track method segment imag pp multipl featur vol pp dec ieee engin medicin biologi societi annual intern confer american sign dictionari byte scientif american byte art humancomput interfac design human factor annual meet spie confer intellig robot comput vision scienc spie confer visual displai technolog chi gi byte technolog review peter ronald lawrenc noisi human motion data digit filter spline pp ts tj jc report nsf plan workshop facial express juli august report nsf standard facial anim electron commun report harper row paul vol pp juli jame advanc vol pp oct ss fisher jm virtual vol pp juli ss interfac ss cc mw interfac environ workstat ss cc mw stereoscop displai vol pp steve insid artifici vol pp nov robert vol pp jc chung virtual world vol pp sibert limit accept user interfac gestur input handwrit charact pp cad lab vol pp juli richard vol pp spie confer intellig robot comput vision commun acm commun acm byte chi gi ieee transact neural network iapr workshop machin vision applic natur languag hand manual art rhetor biolog foundat motor semiot aspect hand mind biolog foundat motor semiot aspect transact institut inform commun engin languag neurosci research program bulletin sign languag mark control robot end vol pausch candi children gestur input drive speech vol pp pierr paper vol pp juli howard touch vol pp juli tg zimmerman hand gestur interfac pp built virtual realiti redwood ca ss fel ge neural network interfac dataglov speech vol pp jan roberto visual interpret hand gestur motion dec southern illinoi ar lawrenc erlbaum david chicago ar natur ar pp lawrenc erlbaum richard integr vol pp es vol pp es harvard biolog foundat semiot aspect relationship verbal nonverb commun action comput graphic imag process artifici intellig intern confer pattern recognit adam issu studi ar pp lawrenc erlbaum adam process mr pp mcneill languag activ rj pp john wilei son sm hayn edg vol pp ellen underli measur visual vol pp agarw optic flow cluster trajectori sep
ML/1653 6 lab vision sonar recognit mobil robot wagner ma beacon ma abstract articl overview research project undertaken laboratori boston focu applic neural network techniqu sensori task mobil robot applic share central minim assumpt robot modul varieti robot platform oper real robot mobil mobil robot neural sensor fusion introduct laboratori found goal appli neural network techniqu control guidanc wheel mobil robot research lab cover problem gener area autonom mobil emphasi navig control algorithm oper minim assumpt robot extern section describ research project investig year neural network model classic oper condit learn gener avoid approach movement mobil robot extern project involv visual loom effici techniqu rang local project util neural network base adapt reson theori rang local sensor fusion sonar visual estim distanc fourth project neural time perform object recognit spectral inform ultrason sensor return learn approach avoid behavior anim oper unknown environ learn recogn inform cue predict consequ action learn organ spite insurmount difficulti standard engin noisi unknown kinemat psychologist identifi classic oper condit primari form learn enabl anim acquir causal structur environ classic condit refer act learn recogn inform stimuli dog train learn ring bell arriv bell dog afraid case oper anim learn consequ action anim learn exhibit frequent behavior led exhibit frequent behavior led punish train illumin kei order receiv small food reward grossberg model classic oper design account varieti behavior data learn vertebr model refin subsequ public grossberg levin comput simul major compon condit circuit model explain number phenomena classic condit implement grossberg condit close grossberg levin shown fig present model node upper left fig receiv activ robot rang sensor note knowledg built network kind sensor inform infrar posit sensor robot bodi cs cs cr ucr cs angular veloc map xm sensor read surviv figur condit model obstacl avoid rang sensor activ repres css detector activ uc motor learn occur popul code robot target angular veloc pattern activ rang sensor predict modifi robot angular veloc avoid obstacl figur overhead view khepera environ obstacl avoid light approach behavior bottom fig drive node condit occur drive node activ model robot collid detect bump rang sensor obstacl closer sensor minimum rang neuron figur repres connect motor system model motor popul consist node encod desir angular activ node correspond desir angular veloc robot leftmost node correspond turn left maximum central node correspond straight neural network fig train khepera miniatur mobil robot avoid obstacl approach light robot train make random movement clutter environ robot collid obstacl movement close node largest rang sensor measur prior activ activ drive node case repres kind learn learn coupl sensori node drive node learn angular veloc pattern exist robot light sensor learn light approach behavior activ drive node light sensor read light level differ approach avoid learn activ approach drive node lead excitatori connect popul gener angular activ avoid drive node lead inhibitori connect result robot learn gener movement lead light suppress movement lead addit detail neural network found figur show result panel show khepera robot environ overhead camera workstat track robot pioneer wall sonar color paper refer bar camera figur top view show pioneer grid point experi movement shown figur small dot lead robot current posit figur show typic path khepera avoid obstacl figur show path khepera track move environ model summar proven independ type robot replic result pioneer modif neural network robot learn simultan approach avoid sort sensor rang light visual loom visual loom method extract depth object visual camera biolog vision system loom requir singl camera base relationship displac observ rel result chang size object imag focal plane camera loom algorithm prior report robust rang realiz wide partli loom requir track turn requir segment track real challeng problem solv mobil platform probabl reason rel anonym algorithm rang perform cheapli easili sonar studi found condit loom complement sonar rang attempt segment full algorithm track object color solut place restrict robot number tangenti issu concentr core featur loom algorithm result shown visual loom local object slant rel robot condit notori difficult commonli ultrason rang sensor determin design setup shown fig pioneer mobil robot point locat distanc angl color piec paper attach wall height robot camera start robot move backward forward paper calcul posit paper loom algorithm distanc wall estim pioneer frontal sonar sonar loom measur repeat twenti time point obtain averag figur illustr repres compar distanc estim obtain loom width height track sonar clear wall paper width height sonar distanc actual width height sonar figur sampl result comparison loom sonar plot show polar distanc pioneer object track solid grid figur show point pioneer angl deg deg distanc mm fig distanc measur sonar loom width height measur track object data point averag twenti measur plot part show data sonar provid addit detail accuraci loom measur slant rel robot sonar read complet loom algorithm maintain high accuraci true distanc measur obtain subject effect angl robot head object steeper carri analysi determin theoret limit accuraci loom algorithm presenc realist corrobor show local accuraci rapidli function displac object track sensor fusion rang local human anim rare singl type sensor simplest type recognit local reli inform varieti demonstr behavior anatom studi abil fuse inform multipl sensor highli benefici field robot sensor fusion topic great current scientif interest shown recent neural network adapt accommod input multipl sensor modal neural network combin art learn categor repres desir categori learn place input categori desir output output type neural network shown perform extrem varieti typic perform term speed memori backpropag network tradit classif algorithm nearest neighbor goal project adapt neural network perform local rang multipl sensor mobil robot research mobil robot world interfac cylindr wheel mobil robot equip sonar rang infrar proxim bump sensor camera mount platform robot learn combin visual sonar inform determin distanc object environ learn process complet robot navig process visual sonar pattern track chang intern odometri signal rel sensor input categor art odometri signal categor art network detect infrar bump learn place sensor pattern odometri read network learn recogn typic sensori pattern robot regular interv collid wall suffici activ pattern gener figur local obstacl visual sonar white squar imag show point visual sonar algorithm detect nearest edg visual sonar correctli identifi locat obstacl imag thin floor detect figur local error function distanc slant angl object directli ahead robot return frontal sonar text sensor turn activ node odometri network recogn distanc obstacl front robot scheme appli multipl sensor singl adopt fusion architectur sensor modal visual implement scheme obtain approxim measur distanc camera visual sonar consist bin imag small number search discontinu column start bottom imag assumpt floor flat obstacl distanc discontinu column bottom imag proport distanc robot obstacl fig illustr typic exampl imag camera pass visual sonar identifi locat obstacl front robot point part algorithm correctli identifi part algorithm detect spuriou edg thin visibl print attach floor loom experi earlier visual sonar desir featur work fairli indoor environ suffer shortcom illustr algorithm easili fool color textur gener chang floor materi room cast shadow light shine window distanc metric obtain visual sonar depend height camera floor camera slant regular sonar visual sonar complementari strength robot approach open door chang floor visual sonar incorrectli detect normal sonar correctli identifi space unoccupi robot approach file cabinet slant regular sonar visual sonar fuse inform obtain sonar visual neural network gener correct distanc predict sensori modal systemat test sensor fusion select combin sonar visual sonar train real data collect roam area hour obtain result cumul combin frontal sonar central column visual sonar figur show data obtain sensor compar data obtain sampl sampl bottl frequenc bottl figur typic data type includ echo water power spectral densiti function echo simpl model minimum read frontal sonar consid accur read observ sonar return maximum rang approxim data point repres plot distanc straight ahead robot repres slant object rel robot head repres angular sector shade cell correspond error measur distanc object locat straight ahead distanc slant posit cell lighter shade repres smaller cumul error figur show sonar rang noisi high slant angl larg distanc figur show greatli reduc distanc angl includ applic sensor fusion scheme evid found object recognit sonar sonar extens robot obstacl map typic applic exploit full rang inform carri sonar time arriv detect echo remark perceptu capabl anim bat dolphin suggest sonar convei detail inform environ develop object recognit system base frequenc content ultrason echo result demonstr sonar sensor object recognit mobil robot system consist data acquisit board host comput fuzzi neural network recogn object basi frequenc content echo gener train sonar recognit system identifi offic cardboard box small top bigger metal cylindr trash plastic water bottl train consist place object distanc sonar collect ten echo object extract frequenc inform spectral frequenc inform ten sampl train neural network object posit remain sampl test figur show echo return water bottl distanc fig show power spectral densiti obtain sampl echo approxim frequenc test network abil recogn object discret distanc feet increment yield total train test tabl show basic result matrix classif correct individu object classifi accuraci rang wall trash adjust vigil achiev accuraci recognit task extend result test accuraci train test perform distanc wall chair box bottl wall chair box bottl tabl matrix basic classif result number column real time network recogn object present return wall correctli recogn incorrectli recogn time boldfac number diagon number correct guess number lower corner total number correct guess case maximum total recognit accuraci degrad distanc train test posit train increment feet test increment accuraci train distanc test odd distanc reduc accuraci consid profound influenc distanc characterist chang distanc influenc part object reflect echo surround influenc reflect ultrason signal addit detail project found result suggest sonar sensor simpl object recognit sonar replac shown achiev impress recognit result simpl object commonli found comput easili run mobil robot articl summar research project undertaken laboratori boston project cover broad rang util varieti techniqu common thread project commit robust solut typic problem mobil robot minim assumpt robot achiev high platform make evalu system varieti robot platform acknowledg part work support offic naval naval research laboratori grant refer yr ga gw fusion neural network architectur data fusion classif world congress neural volum page yr ga gw fusion adapt fuzzi network classif intern confer industri fuzzi control intellig page ieee press feng navig mobil system techniqu reynold fuzzi neural network architectur increment learn analog map ieee transact neural reynold learn classif nonstationari data neural network neural rosen fuzzi neural network architectur increment learn analog map ieee transact neural chang applic biolog learn theori mobil robot avoid approach behavior journal complex chang obstacl detect subsequ imag volum page intern societi optic dv dasarathi fusion ieee comput societi lo moss neural network sonar perceptu modal robot patrick van der neural system page academ san grossberg ds levin neural dynam modul secondari reinforc appli horswil avoid segment intern confer intellig robot autonom obstacl avoid visual fixat loom volum page neural network sensor fusion spatial visual spie confer sensor fusion decentr control robot page carpent mobil robot sensor integr intern symposium comput intellig robot page recogn dolphin echo integr gatewai network neural murphi sensor fusion handbook brain theori neural page mit murphi biolog cognit foundat intellig sensor fusion ieee transact visual loom volum page mobil robot rang visual loom intern symposium comput intellig robot page visual loom rang sensor mobil robot anim animat page carpent neural network object recognit sonar robot intern symposium comput intellig robot page
HCI/1654 4 note comput scienc spatial awar local commun system felix michael beigl universität germani abstract paradigm local commun devic ubiquit comput assum multitud everydai applianc commun solv task paradigm base concept locat devic central commun scenario devic defin commun scope spatial criteria paradigm explicit address identif commun partner comparison tradit commun method approach rout discoveri problem deploi highli dynam environ central servic term local commun commun physic restrict local area distinguish term telecommun commun distanc locat inform explicitli hidden commun model introduc base observ human structur environ primarili spatial show spatial awar effici method commun ubiquit comput environ relat commun architectur refer architectur exemplari implement realiz context inform system base system applic commun implement evalu introduct vision devic human obtain access inform vision implement research project stanford workspac gmd class system base idea servic locat ubiquit access parctab project inform text document access world small devic prototyp consid ancestor upcom devic internet enabl person digit assist access virtual internet lectur note comput scienc ubiquit comput system provid local inform global access instanc olivetti project stuff wear electron badg badg track locat system process inform present web context inform collect sensor badg access internet user project address research context inform georgia tech awar home project equip context retriev sensor system great part context inform interest user machin spatial build basi applic identifi locat import context commun devic ubiquit comput kind local commun telecommun explain architectur experi system give closer insight type commun challeng telecommun decad primarili enabl peopl commun great distanc independ locat prefix tele commun remot commun telecommun system abstract locat commun partner telecommun system commun physic present locat caller commun partner chosen pick call specif person ident repres telephon number appli devic internet criterion select remot comput system ident repres ip address dn servic consequ paramet physic locat partner hidden user telecommun system local commun regard commun partner locat physic space local commun physic space perceiv human local devic local commun carri human machin interact room interact room equip comput system greek remot lectur note comput scienc interact room place environ artifact everydai live extend comput commun technolog local commun support provid basic commun easili understand human flexibl administr overhead local commun partner select spatial base ident select process requir user interact administr servic request retriev commun devic nearbi form commun access devic local environ support spatial awar commun import spatial relationship obviou human talk stand front commun person person room ident person talk import scope commun person kind spatial commun relationship transfer commun devic spatial relationship defin area interest base spatial layout recent find cognit scienc human space central understand interact commun involv human local human understand commun process import interact room applic develop user benefit human understand commun research suggest understand effici form commun effici devic commun spatial awar commun devic locat primari attribut select potenti commun partner devic describ scope interest commun depend current state applic run devic commun simul commun behavior human commun partner insid scope accept end paper describ build commun paradigm servic orient local commun locat awar import commun local devic shown exampl build kind commun system achiev goal exist commun telecommun system enhanc lookup lectur note comput scienc servic infrastructur jini mention locat inform hidden telecommun system reintroduc model explicitli servic servic track locat devic select commun partner spatial layout system architectur kind solut drawback usag telecommun system introduc indirect devic dynam map devic identifi posit made rout packet network subnetwork devic locat order forward packet central properti local devic hidden reintroduc explicitli servic introduc overhead indirect devic posit map network map back posit rout deliveri make system ineffici depend dynam set show devic part system complex system term commun scope overhead introduc rise spatial depend commun system present locat telecommun system requir servic render central server current system introduc problem servic avail telecommun system local commun introduc larg overhead genuin local commun system forego problem rout packet mobil devic due fact messag identifi posit target techniqu mobil stem implic local ip address emploi rout flow inform devic constantli chang network topolog depend central servic defin spatial commun introduc problem servic automat configur avail describ commun stack protocol artifact option commun infrastructur present base artifact interact room commun infrastructur manner model abstract concept spatial depend commun describ commun devic spatial relationship physic world devic defin region interest commun describ congruent geometr space physic geometr space defin envelop point relat applic object commun ubicomp event messag german word stand space room lectur note comput scienc ing commun order bound physic locat object part object insid space interest insid commun scope object defin devic physic locat insid envelop locat relat set point physic member system layer function applic layer applic reliabl world abstract present packet applic implement core function system packet broadcast physic transport fig stack architectur system architectur system layer relat defin model major function oper commun model concentr layer complet stack consist layer fig lowest layer call group physic dll layer layer current definit layer exist implement dll physic layer creation commun devic locat rout packet commun relationship creat definit spatial note restrict physic broadcast space medium span layer provid reliabl commun eventu offer abstract event commun servic resid layer rest section focu run explain detail meet fig commun run lectur note comput scienc commun datagram orient applic run devic send datagram packet belong applic packet call event figur show defin receiv event definit event cup insid cup leav remain cup send event technic prevent hear event cup protocol shield applic unwant event object list belong list defin list decid packet process flexibl handl event adopt applic defin kind kind object defin receiv event object insid defin object defin object insid receiv event speaker defin constantli send locat area object insid receiv event object kind negoti devic unknown environ decid receiv datagram pass user applic model lectur note comput scienc defin previou packet accept potenti receiv devic datagram packet locat insid pure geometr requir packet geometr posit devic posit space awar defin locat devic facil detect geometr locat locat system locat tag broadcast datagram packet current posit devic posit inform handl subsystem call locat servic instanc commun locat protocol defin geometr set point union spheric cubic shape stationari move devic defin interfac layer upper layer function open close updat control inform broadcast devic inform protocol manag subsystem call servic data exchang data protocol rout identifi rel identifi shape packet packet fig interfac devic media commun broadcast area medium direct commun devic coupl network segment coupl enabl pda infrar commun interact ordinari network printer applic run desktop comput medium limit form logic local area network origin lan medium thought network local area infrar commun room form ir devic room inform reach room low power radio frequenc transmiss cabl network ethernet exampl lan cover specif geometr room wireless transceiv spot devic connect ethernet region cover lan area room suppli media ir lectur note comput scienc ir ethernet fig infrar ethernet network router commun mention lan coupl devic connect type infrastructur give access lan coupl similar commun telecommun system explicit address commun locat inform commun packet rout locat inform pair definit result address concept locat congruent address local commun rout router cach commun definit adjoin lan compon physic dimens inform fact geometr object decid packet network interfac forward packet interest lan intersect area lan forward case packet forward lan devic receiv cover geometr area lan commun stack check lan packet insid posit inform distinct devic lan packet rout locat inform packet send applic exampl system commun research ubiquit comput stack run desktop palm pilot pic microcontrol router coupl media infrastructur radio ethernet transceiv lan numer ir rf area ethernet room built yield context inform applic human comput interact describ found lectur note comput scienc displai peopl work event place meet progress inform recogn meet progress infer context establish cup cup infrar distribut statu inform temperatur usag specif time interv applic defin shape room relat plate mount door wait context inform emit event event pack datagram infrar link infrar devic devic receiv packet router transceiv receiv check extens defin rout ethernet commun stack applic receiv put recogn storag space put inform interest event interest express receiv oper track presenc room infer context ongo meet write applic spatial awar featur base local context easili natur commun stack hold import inform set applic defin spatial dimens confer room monitor cup turn set emit data messag simpl confer implement pseudo code smart shown sphere world receiv true int commun devic common scenario local commun wireless connect applianc devic digit photo camera commun printer storag medium input devic keyboard bound comput built wireless comput keyboard input text palm pilot connect keyboard palm pilot locat put palm pilot enter text lectur note comput scienc palm pilot defin circular shape current locat filter keyboard event messag keyboard put event palm pilot keyboard insid receiv palm circl event receiv true event relat work idea telecommun system pair lookup servic local commun found system enabl devic select commun partner spatial simpli pass locat inform applic introduct locat inform telecommun environ manag central locat system decentr facil architectur acquisit locat inform diver sourc cover aspect telecommun jini sun microsystem distribut system commun devic regist central lookup servic devic find select partner physic locat plai role select focu li servic compat describ architectur similar function system locat inform introduc telecommun system central locat directori servic directori servic client retriev commun partner spatial depend criteria type special devic locat client notifi devic meet enter area hive massachusett institut technolog system devic commun model agent paradigm central servic devic model function bundl shadow activ agent move cell enabl locat depend commun task semant model rout system interconnect lan base aspect locat inform address scheme wan area studi address combin geograph inform gp posit aid rout describ rout scheme locat inform aid futur work lectur note comput scienc introduc term local contrast telecommun show commun suitabl human local commun topic commun suit interact room multitud artifact commun carri task direct user interact present system commun system architectur system layer relat defin model major function oper commun model concentr layer layer deliveri recept packet spatial area rout packet handl system applic implement top system usag everydai environ septemb experi collect system applic chosen commun paradigm effici environ identifi area interact applianc design network interact room hci issu applianc design focu energi safe design energi save protocol make import contribut area current setup show advantag commun local applic work investig telecommun assembl provid commun basi applic task rout algorithm extend flexibl rout load balanc work architectur research lifetim event support applic languag describ pair refer maguir smith locat base person mobil comput commun intern confer commun signal process septemb michael spatial coordin ubiquit comput handheld ubiquit intern karlsruh michael gellersen ambient workshop chang place april michael albrecht schmidt experi design everydai comput special issu ra brook intellig artifici armando brad pat terri integr inform applianc interact ieee lectur note comput scienc andi andi hopper distribut locat system activ offic ieee cori robert gregori christoph blair elizabeth thad starner wendi awar live laboratori ubiquit comput intern workshop cooper octob david kirsh intellig space artifici intellig page ko rout mobil ad hoc mobicom fourth annual intern confer mobil comput network jeff gener locat servic mobil environ ieee workshop servic distribut network page june support open distribut system depart imperi colleg technolog london hen mobil applic base directori servic mobicom annual intern confer mobil comput network nelson matthew oliv patti mae distribut agent network thing intern symposium agent system applic intern symposium mobil dr scale multipl psycholog space lectur note comput scienc julio tomasz imielinski geograph address rout mobicom annual intern confer mobil comput na moran cooper integr architectur lectur note comput scienc isbn verma wave wait protocol energi save protocol mobil proc intern confer network roi bill norman rich karin david john mark weiser overview parctab ubiquit comput experi ieee person mark weiser comput centuri scientif septemb
HCI/1655 4 proc ieee virtual realiti ann int symp affin object augment realiti jame comput scienc depart rochest ny abstract describ design implement augment realiti system capabl overlai graphic object live video dynam environ kei featur system complet metric inform calibr paramet camera locat dimens environ object requir abil track frame featur point user system initi time world coordin unknown approach base set project point set comput linear combin project point exploit observ track line fiduci point frame repres virtual object affin frame refer project comput linear combin project fiduci point introduct recent advanc displai technolog graphic render techniqu open possibl mix live video camera graphic object regist user environ applic power visual tool includ overlai clinic data live video patient surgic plan develop user interfac approach demonstr potenti augment realiti system interact process object user environ issu uniqu augment figur calibr realiti system requir transform relat coordin system virtual imag produc paper specif top transform figur avoid ffl establish geometr relationship physic virtual locat virtual object initi user environ user interact place ffl render virtual realist augment environ achiev object continu render manner consist assign locat space camera viewpoint ffl dynam modifi relationship real virtual anim virtual object rel user environ consist object assign physic properti heart issu abil describ camera user environ virtual object frame refer typic approach reli posit track devic calibr ensur entir sequenc transform intern refer frame virtual physic camera track user displai camera calibr posit track prone error accumul augment displai initi virtual object requir addit calibr stage camera calibr perform paramet focal chang approach motiv recent approach augment realiti reduc effect calibr error process live video imag view user approach track small number fiduci point user environ weaken system calibr requir calibr error system paper describ design implement augment realiti system kei featur system oper virtual object anim perform reli inform calibr paramet camera locat dimens environ object requir abil track frame featur user system initi world coordin unknown approach base point van ullman set project point set comput linear combin project point exploit observ track line fiduci point frame repres virtual object project comput linear combin project fiduci point result affin virtual object coordin point virtual object rel affin refer frame defin fiduci point affin object topic activ research comput vision context reconstruct recognit result draw heavili affin object model context augment realiti studi show placement affin virtual anim perform effici simpl linear method oper frame rate exploit abil augment realiti system interact user work publish augment realiti system reduc effect calibr error process live video stream system report oper special camera track devic reli assumpt camera fix perfectli calibr system capabl overlai medic data live video patient surgic environ system track circular featur configur invert transform linear method camera calibr camera calibr requir system initi time exact locat track imag featur recov laser rang finder close relat work work kanad system overlai planar diagram live video track featur point unknown configur lie plane diagram calibr avoid express diagram point linear combin featur point studi uncalibr anim interact placement virtual object approach gener extend previou approach wai show repres virtual object affin refer frame perform comput graphic oper project determin directli affin entir video overlai process singl homogen view transform matrix element matrix simpli imag coordin featur point enabl effici estim view transform matrix lead optim estim kalman filter track featur point comput matrix affin model lead simpl method interact place virtual object user environ anim rel physic virtual object effici execut comput graphic oper affin virtual object achiev implement affin project comput directli dedic graphic hardwar geometr foundat accur project virtual object requir combin effect transform homogen coordin project equat point virtual matric homogen matrix model object project imag plane eq implicitli assum coordin frame virtual object relat main idea approach repres object camera coordin frame defin fiduci point track frame real time chang amount homogen transform object camera coordin ffl simplifi project equat eq transform coordin point model combin effect chang object project transform ffl element project simpli imag coordin fiduci point imag locat fiduci point inform project virtual posit calibr paramet camera locat fiduci point unknown problem determin project matrix imag trivial achiev result theori object recent introduc comput vision research import construct virtual object requir inform transform requir abil track frame fiduci basic principl briefli review assum transform model weak perspect project model assumpt analysi present paper directli gener account perspect project model eq hold object repres project frame refer defin fiduci point virtual object perspect project investig figur project model perspect project point project point distanc center project camera focal length weak perspect project point project avg avg avg averag distanc object point center project weak perspect project amount project object orthograph scale imag avg good approxim perspect project camera distanc object larger size object affin point basic oper method comput project virtual object project collect point posit comput project point camera posit affin point point camera posit metric inform point distanc pn collect affin point chang linear transform appli point affin consist point pn affin basi point collect affin coordin point pn express point term origin affin basi point properti affin point properti project origin basi point imag im comput project point affin po po figur properti affin point view real wirefram object shown point defin affin coordin frame world point point point basi point affin coordin comput project imag properti ps project imag comput project basi point properti project basi po po project homogen vector ps affin coordin properti project process camera posit complet determin matrix collect imag coordin affin basi point eq make eq impli affin coordin virtual object object project trivial comput track affin basi point properti suggest extract affin coordin object inform posit camera affin basi properti reconstruct affin coordin pn comput eq project view direct properti show process invert point track frame camera move imag affin coordin point recov solv system equat po po po po section properti exploit interact virtual object environ fiduci point identifi track affin augment realiti previou section suggest affin coordin point virtual object determin rel featur point project trivial comput central idea approach ignor origin object altogeth perform graphic oper affin object relat origin homogen coordin point virtual object express object coordin frame coordin affin frame relat homogen transform affin virtual object power comput object project requir inform camera posit calibr captur properti virtual object maintain affin inform distanc object vertic angl object normal captur affin model show inform maintain suffici correctli render virtual object augment realiti system develop base principl support ffl object effici realist render virtual object requir oper point project perform accur exploit graphic render hardwar made describ entir project process view transform matrix express directli term measur imag ffl interact placement virtual oper virtual object environ simpl interact user system oper effect determin figur real time render affin virtual object object repres tm affin basi point defin intersect line wirefram object track real time virtual object defin respect point section wirefram rotat frame note elimin occur virtual correct resolut real virtual object requir inform real object structur transform map point virtual object affin frame featur point track ffl affin basi determin project matrix render virtual object requir track affin basi point reliabl effici frame system track line real time line intersect defin basi point ffl object virtual object repres term object physic present motion rel object easi metric inform locat camera visibl surfac render project point virtual object complet determin locat featur point defin affin frame kei aspect affin object render oper clip perform accur depth order intersect line plane preserv affin transform reli abil order depth object point project pixel imag oper perform assign object point order point optic axi camera observ render affin object actual assign point irrelev long correct order point maintain achiev order repres camera optic axi affin frame defin featur point order object point axi optic axi camera defin line point project singl pixel imag express mathemat repres optic axi camera homogen vector cross product po po po po po po imag locat affin basi point order point optic axi assign point model equal dot product entir project process singl homogen matrix observ visibl surfac render point affin object achiev appli transform imag coordin ps project ps assign matrix eq affin gener view transform commonli comput graphic describ arbitrari orthograph perspect project euclidean object clip plane kei practic consequ similar euclidean affin view transform matric graphic oper affin object perform exist hardwar engin realtim clip system matrix eq input directli silicon graphic implement oper effici opengl interact object placement virtual object overlaid imag geometr relationship object environ establish approach place virtual object environ borrow simpl result stereo vision point locat uniqu determin point project imag posit camera virtual object affin coordin system user interact figur posit virtual object environ point uniqu project imag distinct line sight point intersect visual eman camera center project pass point project pair arbitrari point imag intersect visual rai suffici condit requir point imag lie epipolar project visual rai imag line determin project matrix object imag environ involv project point virtual object imag affin basi point visibl main question point project user project project determin object affin number point correspond requir determin posit shape virtual object equal number point uniqu determin transform transform uniqu determin locat point virtual object select interact fix locat select point virtual point project imag distinct camera posit interact process akin stereo select interact imag project affin basi point ps affin coordin recov affin reconstruct properti project point select arbitrari fashion defin physic point space ps project project imag lie line satisfi epipolar constraint line comput automat constrain user select imag project matric optic ax defin eq epipolar line set ti epipolar constraint ensur point user provid physic valid placement virtual object project point virtual object point affin coordin determin solv linear system equat eq solv placement problem virtual object entir process shown figur affin object lead natur method constrain user freedom interact placement virtual object constraint point interfac constraint point physic plane environ point virtual constraint li plane impli ps project linear combin project constraint complet determin project imag visibl planar constraint virtual object physic object surfac forc point virtual object lie plane environ select interact affin basi track abil track project point undergo rigid transform respect camera crucial method reli imag inform repres posit orient camera track imag featur subject extens research comput vision describ simpl approach exploit exist minimum number featur point track line automat updat project matrix render virtual object approach base affin coordin collect featur point project matrix chang camera calibr paramet model equat figur step place virtual cube top workstat select point imag posit cube vertic project goal align cube corner corner workstat camera move posit epipolar line point select imag comput automat epipolar line lower corner cube drawn solid cross repres point select user view virtual cube posit overlaid live video line track defin affin frame affin basi point repres cube intersect track line inform camera posit locat affin basi point step chang imag posit featur chang project matrix hold affin coordin featur point eq lead directli kalman filter base method track featur point continu updat project matrix independ constant kalman filter state consist row project matrix time deriv filter measur equat eq featur point affin coordin determin system initi time track bootstrap interact group linear featur initi imag environ featur point defin intersect line featur featur point matrix unit matrix point track frame affin coordin comput affin reconstruct properti eq updat affin basi project matrix track row affin view transform matrix state kalman filter row matrix comput eq rigid anim problem anim virtual object undergo rigid transform challeng camera posit calibr paramet unknown metric inform lost project process base sole object affin arbitrari homogen transform shear scale virtual object transform object rigidli approach rigidli anim affin virtual object twofold note pure translat virtual figur align virtual cross show point select imag dot line show epipolar point select constraint provid planar contact cube parallel cube side side workstat point virtual object interact imag featur point exist object vertic real time overlai virtual cube intens silicon graphic realiti engin sun soni monitor figur configur augment realiti system object correspond rigid translat world coordin frame realiz arbitrari rigid rotat exploit user abil interact augment realiti user effect system transform gener rigid rotat featur point defin affin basi lie singl rigid object object view simultan camera valid rigid user simpli rotat object affin basi front camera imag posit featur point end rotat defin point space affin coordin respect origin affin basi determin affin properti eq coordin defin homogen transform correspond rigid rotat object rotat rigidli repeat process user inform span entir space rotat detail system implement prototyp augment realiti system consist silicon graphic handl graphic oper opengl graphic track subsystem implement run sun video input provid soni stereo head datacub board frame grab paramet camera comput oper system involv initi affin virtual object affin basi track project updat initi affin basi establish frame virtual object repres run system basi point initi intersect line segment select interact initi imag virtual object initi sequenc step shown figur affin coordin point virtual object affin object model transmit graphic subsystem treat defin euclidean frame refer initi affin linear featur defin basi track automat line track run singl processor rate approxim line updat kalman filter estim element project matrix track subsystem thought camera posit return current affin project matrix asynchron request video row project matrix build view transform matrix matrix graphic subsystem figur show snapshot run system imag overlai initi placement method section viewpoint close view figur object rotat sequenc view figur track maintain black squar accuraci imag overlai limit radial distort camera affin approxim perspect project radial distort account order assess limit result affin approxim perspect comput error imag project vertic physic object environ serv ground truth compar project multipl camera posit predict affin comput system imag point project affin basi imag track automat box corner establish track scenario imag overlai point defin affin view transform matrix affin coordin remain vertic box comput affin reconstruct project comput roughli posit camera camera distanc object camera zoom order object size constant error compar result shown figur error remain pixel rang motion consid result show affin approxim perspect lead error distanc object effect strongli suggest util repres virtual object video overlai accuraci imag overlai gener system measur collect line tracker track outlin black squar object figur affin coordin point rigidli attach object error report figur includ effect small inaccuraci due manual corner local figur run system view posit virtual object interact imag box affin basi point defin track outlin black squar world coordin squar unknown imag overlai combin rotat box object defin affin basi limit approach due track error inform determin project matrix track basi track error inevit lead wrong overlai extrem top squar led inaccur track affin basi point snapshot anim virtual wirefram cube comput respect basi defin squar coordin graphic subsystem displai real time small dot predict posit point affin basi point point rotat freeli tracker track imag project point synthet dot provid onlin estim ground truth imag overlai plot coordin track point shown figur conclud remark complet relianc point track gener live video overlai strength major limit augment realiti approach approach suggest track fiduci point inform anim correct overlai graphic object live video camera posit measur inform size ident object camera environ avoid approach limit robust point track camera posit inevit lead track error track fiduci point fast rotat motion camera make track difficult due larg point displac frame difficulti overcom estim techniqu explicitli account featur fiduci effici identifi accur local frame limit specif implement relianc affin approxim inevit introduc error process restrict oper system larg lack mechan correct camera radial exist frame lag virtual object due commun delai track graphic subsystem theoret extend basic approach repres virtual object project refer investig imag synthesi techniqu shade virtual posit posit posit posit posit posit posit posit posit figur error error averag vertic box particip affin basi line style plot correspond camera path shown figur inform camera posit track devic incorpor system practic techniqu correct radial distort plan special fiduci tracker improv track accuraci versatil acknowledg author chri brown discuss constant encourag support work support nation scienc foundat grant maryland subcontract research contract gratefulli acknowledg refer pentland visual control graphic ieee tran pattern anal machin azuma bishop improv static dynam registr optic hmd proc siggraph page merg virtual object real ultrasound imageri patient proc page neumann dynam registr correct augment realiti system ieee comput graphic track data associ academ invari linear method photogrammetri geometr invari comput page mit blake isard attitud shape input video track hand lip acm siggraph page blake editor activ vision mit brown editor comput vision cambridg uncalibr stereo vision point interfac proc iapr workshop machin vision pentland environ situat vision action ieee workshop visual page camera posit figur camera posit comput error plot show compon vector comput optic axi affin camera camera move plot qualit indic path camera move quantifi error path roughli circular box distanc rang vertic box defin affin frame measur affin coordin visibl vertic box comput view posit faugera dimens uncalibr stereo proc european conf comput page faugera comput geometr viewpoint mit augment realiti comm van hugh comput graphic principl practic publish gleicher witkin camera control proc page grimson al automat registr method imag guid enhanc realiti visual proc ieee conf comput vision pattern page van affin structur motion opt soc affin object augment realiti proc imag understand wolfson object recognit affin invari match proc comput vision pattern page murrai affin structur motion imag sequenc proc european conf comput page enhanc realiti visual surgic environ master massachusett institut editor geometr invari comput vision mit dyer complet scene structur point correspond proc int conf comput page bradi motion recoveri affin epipolar geometri int comput geometr invari visual recognit reconstruct view proc ieee workshop qualit page al calibr requir procedur augment realiti system ieee tran visual comput kanad object registr imag overlai proc page ullman recognit linear combin model ieee tran pattern anal mach linear increment acquisit invari shape model imag sequenc proc int conf comput page anderson resolv augment realiti proc symposium interact page figur setup measur accuraci imag overlai affin basi point defin corner black squar affin coordin tip nail rigidli attach object comput subsequ gener overlai overlai accuraci measur independ track nail tip gener overlai tracker figur measur overlai error solid line correspond track imag point dot line track overlai object figur manual lift tabl freeli rotat approxim absolut overlai error direct wu track experi latenc method virtual environ proc acm symp user interfac softwar page
DB/1656 3 versu tempor data model bohlen jensen depart comput scienc aalborg fredrik aalborg denmark abstract associ timestamp data item tupl attribut valu fundament manag inform interv data leav data model varieti choic give mean timestamp data model claim data model claim mean chosen timestamp effect aspect data includ varieti queri languag queri process avail queri optim opportun paper defin notion tempor data provid formal basi tempor data model obtain insight properti queri languag queri model treat snapshot argument relat ident render model insensit coalesc queri model give actual interv gener treat possibl snapshot relat differ paper identifi notion preserv essenti defin properti data model introduct tempor data model includ timestamp attribut relat schema give special semant valu attribut queri languag virtual data model intend practic emploi form interv timestamp valu time domain default timestamp domain gener impract record individu time point fact true interv simpli emploi reason syntact shorthand time data model ch term data model simpli emploi interv timestamp bear real qualiti data model notion data model defin semant level question real defin properti data model paper answer question feel rang semant data relat point versu instruct simpl assum relat definit tempor differ ts ts definit differ oper discuss turn ts ts ts ts result time result consist percept interv abbrevi time definit feel result coalesc tupl ident attribut adjac overlap interv replac singl tupl attribut valu interv union interv origin tupl result natur result tupl definit differ simpli consid interv atom valu actual interv flavor question oper tempor simpli standard differ oper result return tupl interv overlap interv tupl interv qualifi tupl nonetheless split util tempor differ oper kind question result similar time put snapshot differ tupl tupl coalesc version idea definit respect interv tupl argument relat content result oper result oper oper yield result attempt captur gener defin properti data model proven notori difficult led paper gener definit data model contribut clear definit provid foundat decid model knowledg paper devot issu address paper defin data model describ exist data model made statement versu natur data model snodgrass state tempor queri languag canon relat ident snapshot chomicki state import data model tquel interv serv devic truth valu fact model fact singl time interv pair toman state paper establish correspond view tempor tempor languag correspond show queri conveni queri languag mechan translat queri languag literatur reveal research perceiv notion data model differ notion data model remain formal alongsid rigor semant motiv topic explor problem space section introduc notion tempor data model time provid basi formal defin notion tempor data model section section inform discuss aspect section conclud point direct futur research motiv problem space give formal definit section explor properti kind show differ semant express power queri tempor result vari depend argument relat coalesc case select project involv argument timestamp relat figur relat top bottom coalesc relat employ posit ts lar programm lar programm account employ posit ts lar programm account figur coalesc relat instanc employ model job contract compani temporari posit queri return tupl contract sign start return start time exact queri evalu coalesc tupl return illustr exist queri coalesc coalesc instanc employ relat reveal lar sign sign imposs queri answer instanc reason deriv coalesc relat instanc regular sql statement model coalesc relat instanc power model model explor differ data model rel express data model differenti coalesc relat instanc involv data model argu schema design answer queri coalesc model answer model individu contract record uniqu number employ shown figur employ posit ts lar programm lar programm account figur altern model employ lack relat data model argu natur queri answer anticip true introduc addit attribut subtl drawback experienc attribut omit data model relat introduc depend number faithfulli repres contract contract queri process queri optim versu queri languag affect queri process queri optim care process optim strategi respect complex sever restrict possibl manipul transform interv specif timestamp modifi long snapshot system choic timestamp altern languag leav possibl queri optim effici evalu strategi favor system result queri depend specif choic timestamp valu met perform coalesc elimin coalesc queri remain situat coalesc perform ch tempor data model time domain relat data model ai set data set algebra oper defin data structur tempor relat data model relat data model tempor relat underli data oper tempor tempor relat includ tempor attribut exact denot attribut import topic simplic assum denot tupl valid inform record remain attribut tupl true model realiti tupl tempor relat put form hx xn number attribut immateri term xn attribut ts timestamp finit set relat refer timestamp tempor oper tempor gener tempor relat appli tempor relat design tempor data import central aspect choic timestamp fact time point time defin provid common choic interv built time point ch definit infinit set ht time point domain iff defin total order element correspond time point time interv connect subset time interv domain iff set time interv time domain timestamp time point time interv tempor relat tupl timestamp time point time interv time point domain repres tempor relat timestamp point refer timestamp relat ai tempor data model set tempor relat time point domain time interv set time clear usag interv timestamp differ usag point exemplifi assum integ order time point domain reason claim relat inform hai valid instant incorrect interv addit point uniqu delimit start end point part timestamp tupl hai interv end point bear time point timestamp notion end point meaningless predic oper point interv definit tempor data model ch interv predic oper appli interv data properti make meaningless oper start end retriev initi final interv defin section point timestamp tempor storag viewpoint simplest tempor interv abbrevi set point practic reason relat repres interv abbrevi set point depend oper data model point content output tempor oper remain invari set argument relat point interv abbrevi set point properti formal explor data model easi decid data model determin inspect data type timestamp syntact criteria simpl relat major difficulti concern relat involv interv timestamp section defin notion data model data relat correspond relat consid record inform notion snapshot formal definit ht time point domain oper time point map relat nontempor defin iff hxi relat snapshot iff notion snapshot oper appli snapshot yield result snapshot oper faith natur timestamp argument defin data model definit oper fr fr set relat satisfi precondit iff preserv snapshot iff satisfi properti tempor intersect natur join binari oper argument tupl ident explicit join attribut valu contribut result timestamp overlap timestamp result tupl intersect timestamp argument tupl shown oper preserv snapshot coalesc oper unari oper merg tupl mutual ident explicit attribut union timestamp interv merg tupl tempor logic tempor domain consist point union timestamp tempor intersect natur oper snapshot argument yield snapshot result exact trivial case snapshot definit posit defin data model definit tempor data tempor data model ai time point domain iff condit met relat oper lemma tempor data model ai oper relat satisfi precondit lemma illustr start end function mention section defin data model individu interv isol presenc tupl relat start point relat tupl overlap interv comput function data model requir argument relat coalesc definit start express data hold true interv abbrevi set point translat relat relat relationship hold relat iff gener simpli replac tupl tupl time point data model good definit data model exist pure syntact definit defin data model unsatisfactori distinct model orthogon distinguish data model oper data model oper model defin notion data distinguish algebra oper oper easili qualifi statu oper satisfi addit properti qualifi statu interv adopt wai timestamp result relat argument interv timestamp preserv maxim oper regard mean oper requir modif argument interv result interv maxim argument interv properti state largest fragment argument interv timestamp preserv result object remaind section formal notion requir step defin notion minimum requir algebra tempor oper minimum requir defin set time point timestamp result tempor oper includ explan follow formal definit definit ai tempor data model time point domain set relat minimum requir tempor oper formula form timestamp result tupl satisfi requir argument relat necessarili set time point oe includ precondit oper condit sequenc explicit attribut valu set instant minimum requir partit set instant oe defin function formula oe specifi famili split list interv distinct wai deal gener set tempor interv step defin data model set relev argument tupl result defin minimum requir oe oper set argument tupl relev result tupl ai iff determin proper subset definit argument ai tempor data model time point domain set relat oe denot minimum requir tempor tempor relat set time point finit sequenc attribut valu set relev argument tupl wrt oe argument relat result tupl iff ae note necessarili correspond union compat requir result ai satisfi minimum requir origin argument relat restrict form impli assum tempor differ oper integ order underli time point oe denot minimum requir oper assum oe oe oe set relev argument tupl result tupl proper subset satisfi minimum requir illustr set relev argument tupl uniqu defin minimum requir tempor differ formula union assum satisfi minimum requir tempor differ explicit attribut hai input relat relev argument tupl set satisfi note qualifi set relev argument union satisfi oe final auxiliari concept concern notion maxim interv determin decomposit set time point number nonoverlap definit interv set time point maxim interv partit sequenc interv interv partit satisfi condit concept develop defin notion oper definit ai tempor data model time point domain set relat oe denot minimum requir tempor oper tempor oper satisfi oe iff argument tempor relat hold ts correspond maxim interv partit condit definit ensur group tupl explicit attribut valu union timestamp tupl ident set time point identifi minimum requir result timestamp ident condit ensur preserv relev input interv form overlap fragment preserv argument timestamp fragment oper illustr figur relev argument interv hypothet set output time point figur set output interv built top minim decomposit interv result relev input output interv overlap input level solut satisfi condit definit relev input intersect repres form includ output note definit result interv chop merg minimum requir formula tempor union union set relev argument tupl result ai comput definit minimum requir tempor shown made tupl ai figur show altern definit tempor union oper satisfi oe altern repres oper preserv argument relev argument timestamp properli repres altern requir interv altern repres satisfactori solut respect preserv tempor union oper amount standard counterpart usag tempor defin lead singl result tupl form im union tempor oper output point set oper fp oper relev input interv figur altern solut tempor union tempor join oper intersect argument interv satisfi fragment preserv select oper constrain timestamp return tempor relat oe result snapshot argument yield empti result select preserv easi select result interv ident argument interv fragment trivial preserv definit tempor data model definit tempor data tempor data model ai time point domain iff condit met relat oper discuss discuss properti data model start discuss scope approach mix data model final evalu repres tempor data model scope approach scope definit oper tempor extens relat algebra tempor variant deriv basic oper tempor investig tempor data model definit evalu classifi relev input interv output point set output interv output interv figur hypothet oper oper model definit applic tempor oper illustr applic coalesc illustr delimit discuss extens enlarg set oper exist candid oper preserv classifi oper exampl assum regular oper rt return tupl argument relat timestamp shift time unit assum rt rt assum irregular oper tupl argument shift start time unit end time unit assum oper faith argument interv singl interv present input relat classifi definit stricter respect classifi argument interv fragment preserv note regular oper irregular regular move interv tupl argument relat basic properti length rel posit tupl time preserv irregular basic properti input set start end time shift interv meet overlap argument meet overlap result illustr lead violat preserv narrow set oper make make definit restrict current definit oper model interpret timestamp special exampl relat oper period data relat oper oper standard relat oper appli timestamp approach trivial faith argument oper special tempor semant argu oper provid tempor support argument favor classifi oper tempor mix data model orthogon properti class oper coalesc tempor select tempor intersect join irregular oper definit exist tempor data model expect model oper core set oper model includ coalesc oper term model mix evalu tempor data model section touch popular tempor data model evalu criteria note proper tempor algebra oper tempor relat argument return tempor relat section interv data base relat algebra treat interv atom valu special tempor semant mean oper preserv data model oper inherit standard semant normal unnorm oper order convert time point interv special oper snapshot interv fragment mix data model unlik previou emploi tempor algebra special mean timestamp design goal make format timestamp irrelev achiev enforc canon base tempor element oper preserv snapshot defin canon make data model introduc sequenc statement algebra statement provid power regular statement sequenc statement sequenc statement coalesc enforc canon relat natur oper make mix data model research direct provid definit oper data model oper defin emploi notion snapshot notion oper essenc defin mean oper maxim timestamp argument tupl timestamp result tupl base notion fragment provid definit oper explor properti data model direct research identifi map instanc tempor data model instanc explor framework map explor context data model argu data model express data model ad express cost complic oper harder defin understand continu explor rel merit kind model studi refin definit data model illustr oper natur timestamp preserv timestamp transform interest exploit notion obtain detail classif data model acknowledg research support part danish technic research council grant chorochrono fund european commiss dg xii research network activ train mobil research contract refer van den bussch tempor connect versu explicit timestamp tempor queri languag recent advanc tempor page van benthem logic time investig varieti tempor ontolog tempor bohlen jensen seamless integr time sql tr aalborg depart fredrik dec soo coalesc tempor proc vldb page morgan sep chomicki tempor queri survei proc intern conf tempor page chomicki tempor queri survei submit ieee tkde url gadia weak tempor relat proc pod gadia homogen relat model queri languag tempor acm snodgrass unifi tempor model conceptu model inform lorentzo sql extens interv data ieee melton simon understand complet guid morgan snodgrass tempor queri languag tquel acm jun snodgrass tempor queri languag kluwer snodgrass tempor implement toman tempor queri languag proc acm pod page jun
ML/1657 6 genet algorithm discoveri strang circuit principl miller domin job school dept state informat abstract paper examin idea genet evolutionari algorithm inspir discoveri engin illustr context design electron circuit argu connect piec logic test carri desir function discov principl algebra techniqu illustr design binari arithmet demonstr evolv hierarch seri principl build circuit size examin harder case multipl show extend work field genet algorithm produc fulli work circuit lie convent algebra addit issu principl extract evolv data introduct great contrast physic system design blind evolut method emploi human design case entir system construct test situ consciou applic ple system process human emploi collect concept principl curiou organ capabl imagin world oper definit law abstract design process produc mechan blind object surviv argu paper difficult evolutionari algorithm suggest principl principl infer studi evolv seri exampl argu emploi blind evolutionari held assumpt principl concept emerg context examin issu field electron circuit design human design abstract world binari alphabet multipl valu quantiti alphabet definit oper logic max min context object construct electron algebra machin carri definit function number input oper modular construct build larger system electron machin readili appar modern comput reason attempt evolv arithmet circuit illumin circuit modular construct larg system construct smaller build block clear recal multipl process repeat build multipl circuit gate perform elementari multipl binari connect arrang call cellular arrai process classic human design firstli construct build block carri function abstract fundament build larger system manipul build block process abstract reason biolog inspir algorithm evolutionari algorithm design build block assembl part discov amaz number possibl lead main question studi paper import refer fundament question evolv seri extract gener principl discov question immedi lead fundament build extract principl honest answer question context human design build block prove experi principl observ deduc rule found form synthesi wide rang data directli indirectli lead predict test principl mysteri process discoveri origin human mind call intuit creativ firm content answer affirm matter time hope show paper domain electron logic design perfect context studi question give clear extract principl principl human clarifi concept principl principl predict scienc accumul studi lead inevit featur paper show result extract principl evolv circuit data struct class circuit essenti consist rel frequenc circuit entir evolv design method result discuss section process evolv system potenti principl extract extract principl feed back evolutionari algorithm figur principl extract loop paper discuss detail evolutionari refer reader plenti text cover field space binari function truth tabl truth tabl specifi valu output function valu function input special collect oper act binari function properti function repres express involv oper input variabl collect oper set oper refer algebra case binari function wellknown boolean logic algebra refer function complet base algebra function repres class express basic concept shown fig figur reach unknown region space unknown region fig depict logic function written express oper set express region manipul express boolean region clarifi concept give simpl truth tabl discov repres simpli output principl evolutionari algorithm evolv data data mine output gate input control input repres circuit form figur circuit equat function repres boolean region fig express equat repres oper oper oper assum liter implement express actual circuit requir logic gate includ gate requir extrem difficult develop algorithm concept circuit form equat fundament content paper method space explor discuss design logic circuit idea express fig regard analog design process gener space space design evolutionari algorithm assembl electron circuit collect compon idea build electron circuit evolutionari algorithm connect logic gate set type recent begun emerg recent year methodolog circuit perform specif task emploi complex human design principl import theme arisen field evolv hardwar al approach develop iba al show boolean combin logic function involv built genet algorithm evolv connect gate thompson show circuit special devic call field programm gate arrai carri frequenc discrimin task robot control basic techniqu evolv binari configur sequenc program fpga carri desir task human input measur circuit achiev desir remark shown tini circuit evolv effici carri oper wai intens investig clear evolv circuit make properti potenti includ physic properti silicon medium work field al miller al design power techniqu evolv choic function connect arrai digit logic function gener concept envisag simpl figur gate arrai evolv fig gate arrai evolv bit input cin binari input output sum binari output sum repres sum bit addit carri bit chromosom shown figur bold repres function logic cell cell function chosen subset shown tabl ab impli repres oper oper tabl cell function ab bc bc function basic binari function input function binari multiplex input invert multiplex implement simpl statement evolutionari algorithm evolv circuit begin popul randomli initi chromosom case genet algorithm uniform crossov genet chromosom constrain column cell connect cell left ensur result circuit time depend evolutionari algorithm emploi simpl form evolutionari strategi case popul random chromosom randomli gener fittest chromosom select popul fill mutat version random mutat defin percentag gene popul mutat mutat oper respect natur circuit alphabet connect function binari circuit symbol figur binari circuit symbol note diagram small circl input output input output invert appli notat case circuit method section extend circuit logic extens familiar boolean logic alphabet posit integ refer logic familiar oper logic replac minimum maximum oper defin counterpart binari detail approach report al logic gate circuit output invert fig diagrammat function symbol express implement gate found al basic compon design al counterpart binari multiplex figur symbol analyt logic gate result convent depict figur block diagram carri convent circuit diagram convent circuit diagram shown fig requir logic gate type note sum output implement cin sum gate characterist human design evolutionari algorithm strang eleg solut fig depict effici obtain realiti gate built smaller modern devic gate devic gate gate unusu respect set input binari function variabl function special call logic modul figur evolv carri interest featur circuit sum carri part circuit complet nice symmetri suggest gate natur carri elementari gate natur carri process addit thought potenti principl observ human design note circuit evolv separ carri function sum evolv separ evolv constrain geometri difficult ea correctli circuit requir run gener size produc solut shown fig figur evolv carri remark effici circuit genom explain section circuit recent discov person commun john edinburgh principl human construct larger principl block diagram bit shown figur block fig ident depict fig perform calcul posit integ evolv insert hint design shown fig separ sum part circuit carri part figur evolv design evolv circuit common evolv clear carri circuit import part carri circuit lot subtleti subsequ evolv complet carri separ task difficult geometri chosen genet algorithm popul size breed mutat run solut obtain function number requir cell circuit shown sum circuit carri circuit figur evolv compar circuit evolv circuit bit circuit produc connect smaller configur ident shown fig deduc modular design principl build circuit size demonstr principl extract seri evolv exampl case human design multipli process design circuit perform multipl model familiar long multipl process shown figur multipl binari number multipl binari number accomplish gate build circuit multipli integ requir circuit shown fig figur cellular multipli pictur fig cross topmost gate gate requir bit output product obtain figur gate diagram effici multipli obtain plenti suppli fulli function evolv multipli circuit algorithm uniform mutat mutat probabl thousand run gener carri geometri gate type tabl paramet set run circuit produc correct requir gate effici convent circuit shown fig evolv circuit shown figur evolv multipli figur evolv multipli figur evolv multipli examin circuit instantli reveal strang circuit independ involv counter intuit convent model multipl output possibl turn input gate produc gate circuit convent circuit circuit evolv circuit effect convent circuit circuit produc fact appli symbol rule boolean algebra show circuit transform calcul obviou strang featur circuit circuit gate requir addit human concept addit model oper correct desir answer affirm problem evolv multipli discern principl work evolv oper evolv multipli enabl build effici multipli multipli convent cellular multipli repres redund gate remov circuit shown figur effici convent multipli circuit shown fig calcul product integ rang experi chose gate tabl felt evolv multipli shown fig eleg involv gate method explain section felt examin evolv multipli gate stand chanc deduc gener principl obtain reason probabl obtain correct solut found evolv order gener geometri row column maximum mutat probabl chosen ran es time obtain function circuit tabl show number requir gate circuit type effici convent circuit shown fig requir gate circuit equal effici effici note experi multiplex obtain effici circuit tabl result multipli gate run total case figur evolv multipli effici effici evolv multipli shown fig requir gate examin evolv circuit discov gate logic redund remov compar evolv multipli convent notic differ evolv circuit repeat modul output implement circuit evolv circuit convent circuit circuit requir gate evolv circuit comparison gate convent circuit interest featur design evolv circuit depend happen convent circuit true output depend evolv circuit differ circuit mark output depend elementari product firstli notic convent design output evolv circuit elementari product implement elementari product implement involv output evolv circuit convent implement product output clear multipl process model evolv circuit human carri logic lot repres logic function logic algebra specif set logic oper call literatur function complet basi mean implement logic function variabl section space repres function function repres function complet base human develop tool map function specif function complet basi express encount problem combin function complet base repres function econom develop specif logic lot time effort success end process addit procedur map logic function basi disadvantag human design procedur order overcom difficulti binari adopt method assembl test logic set principl obtain logic express note set function complet basi order success potenti discov highli effici altern counter human intuit evolv design output carri logic function valu set term base arithmet sum carri fig give exampl evolv circuit nonstandard set gate note set discuss function complet basi subset gate chosen fig show evolv design carri circuit structur differ li gate analysi result logic express rise equat extrem difficult prove pure algebra manner carri sum carri sum carri sum carri sum carri sum figur evolv circuit ident gate method doesnt explicitli carri formal algebra oper find unusu structur easili figur evolv circuit shown involv type gate unabl find logic design repres function algebra logic incomplet method escap restrict inher algebra fingerprint principl extract type principl potenti extract genotyp evolv circuit fig stage collect evolv data face problem data mine extract knowledg larg collect evolv data identifi gene term base sequenc inherit characterist easi task approach type present evolv genotyp permut find data permut readili identifi form size avoid combinatori occur attempt direct decid evolv genotyp permut term concept shown fig figur principl diagram cell logic gate includ multiplex multiplex input cell ab gate form pair valu gate type avoid input cell cell connect index xyz tripl collat frequenc occurr evolv materi evolv genotyp solut multipli distinct principl occur ten time fig show histogram figur distribut principl occur evolv multipli genotyp frequenc greater highest peak correspond shown tabl correspond human design term ad multipl import principl multipl process connect forward oper frequent occur cell cell cell tabl frequent occur cell cell cell frequenc gate logic ident close rel close rel gate gate input import structur involv convent multipli evolv shown fig histogram shown fig circuit admittedli number histogram plot fundament inspir obviou gate invert evolv solut multipli gate type evolv multipli shown fig clear distinguish input obtain pictur carri analysi multipli solut correct gate fingerprint shown figur distribut principl occur evolv multipli genotyp highest peak correspond occurr highest peak correspond occurr work principl logic behaviour remov occurr gene tripl behaviour account modular subblock fit neatli categori illustr addit multipli circuit shown figur paper put forward view evolutionari algorithm methodolog regard discoveri engin creativ machin design studi idea context digit logic suggest principl discov examin seri evolv arithmet logic circuit examin concept space circuit feel similar idea carri gener field design human design algebra form subset space binari system analog small human principl emploi blind evolutionari techniqu discov principl difficult problem principl extract evolv data feel confid process learn principl blind evolutionari process matter time refer machin learn approach evolv al int conf evolv biologi hardwar lectur note comput scienc pp rj cmo logic design part function realiz ieee tran circuit system fundament theori applic pp fogarti aspect evolv hardwar approach combin circuit design proc int conf evolv system pp sipper al combin circuit evolv hardwar approach proc workshop ultra larg scale integr system associ japan ieee synthesi optim network logic proc int symposium pp ieee evolv digit electron circuit function gener genet algorithm koza genet annual confer morgan kaufmann san pp digit evolv eiben al int conf parallel problem solv natur lectur note comput vol pp aspect digit geometri sipper al int conf evolv biologi hardwar lectur note comput pp design electron circuit evolutionari algorithm arithmet case genet algorithm evolut strategi engin comput al pp view hardwar ieee tran evolutionari pp evolv al int conf evolv biologi hardwar lectur note comput pp
HCI/1658 4 ercim workshop interfac posit paper clair knight malcolm munro research research institut softwar evolut depart comput uk abstract detriment complex data set success requir tailor suit task underli data restrict enabl design task appli accommod style rang data expect normal problem repeat redesign interfac sole depend implement technolog import add issu interfac provid reusabl concept integr rang metaphor displai posit paper examin issu surround interfac present discuss issu introduct aim tailor data set underli exist develop problem posit research commun enabl tailor visual displai common form control panel data item displai relationship part data common provis metaphor interfac requir simpli variabl vari wai work perform assort task time view task data depend extent accept earli attempt inform produc appli wide chang data transform fit necessarili good step provid avenu human insight data translat data affect pattern relationship hidden mass raw inform relat issu task data depend interfac interact suitabl issu number dimens actual case current technolog implement interact mechan good obviou view user suffer disabl affect interact comput technolog accept gener user action itali octob ercim workshop interfac posit paper person kei combin small left user interfac long embrac game game control kei combin user variat interfac interact task viewpoint consid order produc accept tool futur visual explor data set provid opportun human act intellig amplif tool effect aim intellig user interfac requir interfac provid flexibl requir user carri varieti task context configur option user exploit tool augment abil interfac benefit call intellig interfac made data learn techniqu numer user situat guess inform present lend possibl obscur pattern data subtl natur requir human intuit recognit posit paper present issu relat creat configur interfac tool enabl accept flexibl view user control prefer intellig amplif drive forc provid intellig interfac evid section paper system discuss background section overview main area literatur influenc interfac centr applic domain gener theori wide applic rang area set scene idea present paper provid context tool interfac research metaphor metaphor word phrase term graphic word place suggest form analog higher level abstract individu word phrase blackwel pose question abstract metaphor discuss distinct term scope thesi vr perspect metaphor act map concept requir virtual world graphic identifi al construct system vr visual techniqu repres result queri impli definit object object virtual itali octob ercim workshop interfac posit paper benford al natur metaphor aid usabl virtual environ attempt exploit natur understand physic includ spatial factor percept gener familiar common spatial fitzpatrick al appli spatial metaphor level social interact virtual world metaphor space familiar metaphor work encompass mean space virtual independ graphic vr driven social world individu particip multipl social view real world interfac metaphor support schmidt author view type metaphor solv navig issu familiar structur interact possibl system visual user west suggest potenti power vr strength fact closer natur interact form comput system identifi benefit natur make perceptu spatial skill learnt real world virtual environ world metaphor scope direct interact desktop engag perceptu spatial faculti comprehend surround process vast amount inform present potenti directli engag faculti defin characterist virtual realiti environ richer metaphor interact assum greater role manag metaphor virtual environ assum kei obviou design metaphor virtual environ plai larg part usabl term term enabl user carri requir task benefit environ cognit process navig visual interpret shift activ carri daili real thought metaphor hide origin data user expect object capabl view distinct metaphor work direct resembl thing work common attitud thing common attitud direct result extran reason dispar facet hold potenti danger relat expect problem metaphor sum carr metaphor difficult find easi prove metaphor work difficult true wider variabl user task system requir formal assur user sponsor metaphor simpli variabl ideal system itali octob ercim workshop interfac posit paper support rang metaphor cater interfac easier system metaphor accept invalid figur proof studi carri al support metaphor result led initi metaphor base perform enhanc system metaphor studi show system found metaphor outperform system metaphor good spatial orient navig vr environ spatial world model orient navig featur found real world spatial set form base orient found navig movement occur al relat work write readili extend spatial chang posit context space explor inform visibl point view import achiev determin relat current point view inform inform author document problem lost deal spatial virtual environ ingram benford write recent experi virtual realiti suggest user suffer commonli experienc problem navig virtual relat orient navig process cognit map user environ cognit map sort linear map base movement space observ made movement spatial map requir movement space linear map creat time map evolv spatial map explor guidanc environ encourag develop spatial map research provid wai navig problem occur vr west relat problem system metaphor todai cursor desktop lose cyberspac world potenti infinit desktop gener finit space current implement cover screen al discuss design issu import vr system cover orient discuss perceptu consist import creation environ user remain comfort west comment construct virtual aim construct environ correspond human itali octob ercim workshop interfac posit paper perceptu requir back comment made engin environ design avoid repres step necessarili conclud aspect perceptu causal continu experi provid continu virtual realiti natur interact orient impli causal model law time environ continu thing explain ball float mid air consid provid context outer space behaviour perfectli accept attent issu causal west feiner cover concept virtual restrict work paper abstract sort view navig counter virtual space inhabit user time specif data task framework al give reason vr interact interfac intuit natur explor comprehend complex user interfac good spatial inform effect assist user creat author import metaphor navig interfac easi navig orient problem attent design virtual environ make system graphic plain text cognit overload larg suitabl attent paid design virtual metaphor interfac environ suitabl metaphor metaphor great potenti vr virtual environ ia ai intellig amplif comput aid enhanc human intellig artifici intellig aim substitut human comput intellig amplif build skill human augment area lack frederick brook describ belief intellig amplif itali octob ercim workshop interfac posit paper comput system intellig amplif power point comput artifici intellig ai object replac human mind machin program data base ia object build system amplifi human mind provid auxiliari thing mind troubl brook identifi area human skill comput pattern recognit perform context unrel piec inform relat situat walker touch subject intellig amplif discuss challeng natur intuit visual interfac retain critic contribut human perceptu ensur opportun unexpect leap imagin lost program comput major task human sentenc similar skill identifi context sentenc walker essenti talk pattern recognit skill brook intellig amplif import softwar form repres larg complex data set graphic aim user understand content data set aid user tool act intellig amplif tool read thousand piec inform finit graphic space complex possibl tediou task comput simpl data process al make similar connect field vr make vr enabl identifi pattern recognit contextu abil human everydai exist cope filter tremend amount inform consciou thought present form overwhelm easili spatial pattern inform coordin multipl inform stream thing grant solut part vr thesi inform present suitabl process effect directli role system intellig amplif tool system inform user requir al role system select document similar queri displai inform document assist user select document show import challeng research issu handl task provid support transpar chang queri mechan order improv perform situat situat wide applic itali octob ercim workshop interfac posit paper task depend facilit transfer tacit task put role plai design metaphor environ locat import task place design elucid kennedi al framework inform acknowledg analysi dataset visual visual frame interest question answer system accept consid data set analysi task lead insight understand valid tangibl intang main problem softwar form inform creat tangibl inher form aim intang effect effect refer understand user whilst reduc perceiv complex ball problem write physic shape size code file natur softwar hide system walker comment softwar intang part inform system write aspect inform system major compon softwar abstract collat comput lau intang natur softwar softwar softwar commun peopl peopl import point drawn commun aspect softwar intang programm mental effect act common frame refer discuss piec softwar inform colleagu formal particip concur code discuss discuss place softwar provid graphic piec code discuss clariti section discuss place realm mean discuss itali octob ercim workshop interfac posit paper base code repres piec code provid start point common understand literatur show good provid intellig amplifi tool analysi understand complex data set essenti variat statist avenu exist section work date softwar promin inher spatial requir navig virtual space interfac metaphor creat tangibl intang data sourc end result act tool analysi figur show sampl imag softwar paper cite paragraph show view result static analysi line java sourc code figur district softwar world figur overview entir district past issu surround softwar base fact imag essenti node arc issu appli sort scope deal graph layout hard problem layout algorithm long focu comput mathemat properti address aesthet readabl illustr background work figur includ itali octob ercim workshop interfac posit paper figur tradit softwar imag unsolv issu direct impact affect interfac issu pertin evolut scalabl orient autom order provid detail examin section relat interfac highlight section evolut evolut import issu program softwar system chang varieti wai varieti reason overlook issu form data set larg sort suit high probabl aspect data chang gener evolv underli data evolv reflect visual implement issu import metaphor support happen logic constrain framework metaphor happen involv visual great cognit effort part user benefici case gener scratch question tool work task user answer complet adequ time assum evolv affect interact interfac glanc suggest bear due metaphor provid consist chang detail show control interfac affect choic data view part data set part interfac render obsolet case altern metaphor longer work chang consist metaphor itali octob ercim workshop interfac posit paper gener suitabl view affect scalabl scalabl relat abil evolv answer question scalabl requir test vari amount sourc data scale consid evolut depend time base code issu initi develop algorithm handl wide rang data size hard problem design creat accommod wide rang data essenti deal infinit number item mind develop enabl scale smaller develop specif data scale issu accept long design appli data vari size content fact born mind direct impact interfac interact mechan side effect consid tandem issu evolut scale requir interact mechan adapt reflect visual move virtual space expand ten time origin size benefit faster control unaffect navig interact navig import affect usabl design structur navig mind navig featur ad hard add path beacon young munro write structur data terrain result understand layout easier guidelin navig orient citi plan textbook wai human orient space ti navig issu user interact move landscap find inform requir intuit make peopl view tool design user interact comput concern reason flexibl system abil user configur lead accept system itali octob ercim workshop interfac posit paper autom gener data minim configur file prefer accept graphic creat fulli automat manner user gener tweak user result suitabl person cost time produc visual displai high applic aim consist version data prevent system common frame refer discuss creation environ freedom user creat landscap complet destroi notion share workspac user environ unfamiliar solut problem user prefer provid metaphor data set choic metaphor data set valu includ actual automat gener user variabl interfac compon previou highlight area concern touch wai handl problem familiar breed work gener hour exposur data set metaphor view anomali interest area visibl quickli experienc user order impact chang user start applic familiar appli metaphor data set provid data visual highlight open user cite displai reason approach work pluggabl interfac reli compon definit graphic relev option displai data set choic data set isol choic part data set view possibl easi task present choic metaphor provid specif problem defin gener automat whilst construct fulfil scale navig issu identifi compon provid data connect main whilst handl configur option work screenshot current state figur illustr multipl applic framework itali octob ercim workshop interfac posit paper figur multipl interfac design visual provid applic user control compon creator restrict provid compon overcom problem side issu defin specif interfac compon hidden user approach provid step forward handl user prefer provid small set option panel menu achiev goal applic act tool provid facil control user power prescript summari aim interfac creat intellig user interfac believ augment user abil situat replac pattern recognit skill import interfac form autom approach consid hindranc analysi wrong assumpt abstract import area data sort interfac necessarili awar ultim goal current activ contribut intellig amplifi interfac configur great potenti analysi larg complex data set overcom inher overload experienc data worth investig start address interfac usabl displai step direct refer ball softwar visual ieee april itali octob ercim workshop interfac posit paper share artifici acm confer novemb metaphor program annual workshop psycholog program interest effect legaci journal softwar research vol internet bt technolog vol april mind door interfac metaphor improv usabl voic bt technolog vol januari engin perceptu effect visual abstract scientif visual methodolog ieee comput scienc februari feiner world metaphor explor virtual acm symposium user interfac softwar pp octob physic virtual place social studi work acm confer pp novemb visual user interfac support fulltext proc sigir design issu virtual realiti system present eurograph workshop virtual septemb ingram legibl enhanc inform ieee visual octob novemb framework inform acm sigmod special issu inform vol knight virtual environ ieee intern workshop program knight softwar kei research ieee intern confer softwar august septemb virtual softwar phd depart comput june knight user inhabit ieee knowledg media network june itali octob ercim workshop interfac posit paper knight virtual visibl ieee intern confer inform juli visual metaphor posit paper relat patholog metaphor acm press final ontolog present intern confer virtual sc depart comput uk januari coher oper environ larg scale vr present virtual realiti april world topolog virtual present june virtual mandarin multimedia support author user confer human factor comput system user interfac find good chi short paper companion april challeng inform british telecommun engin vol april cognit classif framework inform research report young softwar virtual ieee intern workshop program june itali octob
Agents/1659 1 preprint contextu deontic norm violat independ van der torr depart arti cial vrije universiteit de boelelaan hv netherland paper discuss deontic logic multi agent system central question proce norm violat kei issu deontic logic applic multi agent system bridg logic analysi norm philosophi applic agent practic approach base violat context independ statement introduc combin tradit deontic extend deontic factual independ assumpt show di erent notion encod logic de ning di erent wai independ assumpt deriv explicit manner present show approach give analysi notori paradox deontic logic introduct norm plai import role multi agent open question agent reason norm repres explicitli obviou candid repres norm deontic logic prohibit permiss present branch modal read fp forbidden pp permit deontic logic agent logic architectur norm violat agent reason explicitli violat consequ violat norm occur address multi agenc applic agent act norm system van der torr contextu deontic logic call agent reason norm oblig norm agent norm relev aspect multi agent system autonomi explain section contribut paper start point combin classic deontic logic contrast complic de nition introduc independ statement note distinct oper independ statement test proven success reason bayesian network introduc notion independ introduc notion explain detail section show approach give analysi notori paradox deontic logic claim violat context independ assumpt made deontic paradox test formal system benchmark exampl philosoph introduc exampl norm multi agent system main goal paper bridg work philosoph logic multi agent system applic focu consid main problem reason recov violat issu discuss philosoph logic import multi agent system applic relat oblig paper boutili simpl distinct control uncontrol proposit discuss emerg norm multi agent norm emerg cooper trust paper organ section discuss aspect multi agent system paper formal section discuss problem identi ed formal section discuss relat deontic contextu reason introduc simpl contextu deontic logic section discuss deontic independ analyz deontic paradox final section section show independ assumpt deriv explicit manner show distinct deontic independ factual independ van der torr contextu deontic logic norm agent multi agent system rst discuss role norm deontic logic agent theori discuss norm agent architectur agent speci cation veri cation languag final section compar logic oblig logic desir multi agent system norm consensu agent theori turn major branch arti cial intellig comput scienc due reason individu autonom agent multi agent system cognit concept desir intent proper abstract tool behavior agent system object method abstract program found behavior agent govern speci handl ration balanc desir belief describ inform desir motiv intent delib state social concept coordin cooper proper abstract tool behavior multi agent system interest multi agent system norm agent accord grow interest electron commerc economi transposit concept cognit social scienc comput scienc impli develop comput tool cognit social scienc critic base fact psycholog experi shown human reason concept folk psycholog develop comput model miss point transposit success intent stanc measur psycholog abil verifi complex comput system ecient ectiv success explain psycholog fact human ascrib mental state arti cial system note kind transposit foreign concept comput scienc success led research transposit biolog model neural evolutionari transposit physic model quantum comput van der torr contextu deontic logic agent gap individu autonom agent multi agent system gap cognit social concept import open problem norm agent bridg agent multi agent system part cognit concept oblig main build block complex social notion trust reput autonom agent norm adopt system vote norm norm emerg spontan role norm oblig bridg individu agent multi agent system explain composit model multi agent system figur composit multi agent system consist level level level system agent figur composit multi agent system compon agent oblig agent multi agent system societi question oblig interact oblig interact norm agent interact question relat level level issu call practic agent intent desir lead agent agent behavior uenc level dichotomi behavior agent lead emerg system properti social norm norm reput social game theoret emerg properti uenc behavior van der torr contextu deontic logic violat deontic logic open question deontic logic comput logic multi agent system agent architectur agent speci cation veri cation languag motiv previou section norm multi agent system norm bridg autonom agent level multi agent system instanc dichotomi motiv repres norm multi agent system fact social scienc norm identi ed crucial tool import issu multi agent system cooper reciproc evolutionari game theori trust reason answer question deontic logic multi agent system found histori deontic logic comput scienc deontic logic agent logic architectur norm violat agent reason explicitli violat consequ eighti deontic logic philosoph analyz structur norm languag discov comput scientist logic formal speci cation veri cation wide varieti topic comput scienc overview refer norm violat system reason explicitli violat consequ deontic logic qualit theori repres agent goal comput secur analyz secur issu electron commerc plan schedul problem formal soft constraint advantag soft constraint norm violat creat inconsist formal speci contrast violat hard constraint paper studi proce norm violat norm relev multi agent system reason applic simpl reactiv advanc applic complex agent bdi agent applic social multi agent system van der torr contextu deontic logic norm social agent autonomi agent violat agent cf import concept autonomi multi agent expect agent break norm electron commerc type autonomi great practic experi contract net protocol shown system ecient commit broken level commit import proce norm violat deliveri time due agent oblig pai extra transport wareh cost result delai violat intend violat contract parti breach simpli disrupt execut contract repair control norm deleg control behavior multi agent system agent cooper agent realiz goal negoti organiz social command ecient gener agent deleg deleg plan problem deleg agent capabl deleg achiev norm violat agent reason dicult control kind social interact subsect discuss role norm agent architectur agent speci cation veri cation agent make applic agent deleg agent reason capabl achiev goal hold applic accord exampl human organ task distribut boss head depart boss awar capabl van der torr contextu deontic logic norm agent architectur recent agent architectur explicit dignum extens bdi architectur oblig extens thomason oblig architectur section brie discuss element illustr motiv introduc norm import proce norm violat architectur agent system logic intent desir coher strategi coordin control motiv decomposit reduc complex system divid conquer approach softwar engin model base agent overload typic live complex noisi environ cognit model base attempt reach satisfi ful ll oblig plan variant theori qualit theori cognit model bdi model social concept oblig deontic action program architectur agent main problem nding reach satisfi desir ful ll follow belief intent main problem resolv ict con ict resolut mechan architectur coher strategi coordin control intent desir complet mention di erenc architectur rao georg bdi di erenc deriv thomason base bd compon gener goal belief compon plan goal bdi logic restrain previou intent bdi logic plan schedul crucial part bdi discuss absolut belief condit bdi logic base modal thomason bd logic base reiter normal default logic compar psycholog theori thought attent van der torr contextu deontic logic architectur intern con origin compon intent distinguish extern con origin compon intern con ict distinguish unari subtyp typic con ict oblig obligatori honest obligatori polit extern con ict distinguish binari con ict subtyp bi bd od ternari con ict type quadrupl con ict type follow benchmark exampl con ict obligatori weekend time con ict obligatori weekend plan confer con ict permit smoke smoke area desir smoke oc oc area con ict obligatori smoke smoke area intend smoke smoke area con ict obligatori smoke smoke area desir smoke smoke area con ict intend confer desir stai luxuri hotel obligatori stai luxuri hotel con ict intend confer obligatori spend monei confer pai cheap ight ticket stai pai ight ticket stai budget hotel desir stai hotel secretari book ight ticket architectur architectur coher strategi resolv con ict compon intent desir list benchmark exampl illustr architectur norm violat norm import intent desir invok norm repres deontic logic van der torr contextu deontic logic agent speci cation veri cation logic agent logic describ cognit agent highest abstract level di erent agent abstract manner verifi agent implement program languag intellig comput system make travel arrang scientist includ book ight reserv hotel room bdi logic verifi exist formal state system believ direct ight book cheap intend book hotel room close confer center success intent dennett call explain fact human ascrib mental state arti cial facilit interact clear exist bdi logic system desir cheap room desir room close confer absenc cheap close room prefer cheap close ict desir cheap indirect ight oblig order direct ight overrul deleg oblig arrang ight comput system miss element formal speci cation concept oblig call extens bdi logic oblig logic veri cation speci cation languag develop concern agent micro macro veri cation task assum behavior agent system explain term cognit built concept analog assumpt psycholog human behavior explain term psycholog concept human concept region brain found assign reason ration agent proven formal system classic theori identi ed savag foundat statist base idea agent act behavior understood maxim expect util base subject probabl distribut util function theorem miss cognit agent van der torr contextu deontic logic dichotomi figur languag concern relat level level relat level level reason understood formal analysi made moment clear emerg properti speci cation veri cation task logic di erenc oblig desir agent logic studi desir context bdi question logic aspect oblig di er desir problem comparison tradit logic literatur concept oblig studi intens deontic logic formal legal moral logic desir except logic logic prefer di erenc desir origin agent oblig dynam desir di erent dynam oblig desir studi relat intend oblig studi relat desir con ict con ict oblig case violat oblig issu oblig studi relat di erent type studi oblig uncertainti prima faci section link establish logic desir logic oblig desir formal semant exact relat logic open problem van der torr contextu deontic logic philosoph problem practic implic previou section discuss argument norm interest object studi multi agent system rst argument norm bridg cognit social bridg autonom agent level multi agent system level norm individu agent plai role agent norm multi agent system crucial tool cooper trust argument norm violat plai import role autonomi control multi agent system discuss question norm plai di erent di erent circumst paper restrict deontic logician hardest question reason proce norm huge philosoph literatur deontic consensu commonli accept standard commonli accept list open problem benchmark exampl tradit logic lack concept action repres multi agent arti cial intellig comput scienc complic formal counterintuit properti partli explain deontic logic multi agent system logic desir intent main reason deontic logic wide multi agent system practic deontic logic deal violat except tradit deontic deontic logic deontic logic simpl tradit approach good formal oblig section discuss tradit deontic discuss problem discuss depth analysi section introduc hansson deontic logic discuss multi agent system section argu logic deontic logic formal except norm section inform introduc analysi reason base context independ van der torr contextu deontic logic dyadic standard deontic logic deontic logic normal modal system close infer rule modu ponen necessit proposit tautolog axiom condit oblig satisfactorili formal reason formal forrest paradox sdl intuit consist detail murder jone murder murder jone murder impli murder hansson popular dyadic deontic logic call dyadic standard deontic logic develop formal reason occur forrest notori deontic paradox oblig write hansson write prefer world world consist repres forrest paradox murder jone murder note logic factual sentenc nest modal de nition prefer model set total connect valuat function exist world world permiss de ned def write truth condit refer actual world usual world hansson origin de nition prohibit nite descend minim world exist van der torr contextu deontic logic de nition slightli simpler note discuss lewi deontic logic logic lot work gener hansson fact nest rst axiomat de nition infer relat proposit logic axiomat correct complet set proposit axiom extend concept provabl infer de ned usual fashion multi agent extend wai oblig label norm agent group identi er read norm system agent oblig read norm system group agent bg oblig read norm system agent oblig agent kind identi cation agent norm system implicitli assum deontic logic made interest logic question practic issu oblig group distribut member group distinguish oblig pearl observ contrast deontic logic assum agent proposit boutili express condit prefer logic qualit partit proposit atom control uncontrol proposit variabl paramet lang control proposit umbrella uncontrol van der torr contextu deontic logic proposit rain multi agent case agent set control atom rst extens agent identi er agent set control formal agent violat recov agent violat oblig proposit control agent proposit control agent express agent agent agent recov left agent exampl paper norm agent distinct control uncontrol proposit clear formal simpl leav implicit method develop detach absolut oblig dyadic boutili discuss satisfi principl factual detach complic boutili simpl solut base observ determin prefer base actual ideal world satisfi world satisfi fact kb knowledg base statement condit prefer actual fact fact ideal situat prefer world satisfi kb boutili simpli proposit kb boutili approach trace back von wright discuss monad oblig repres stand actual circumst boutili observ preliminari scheme condit default reason earlier work mechan extend deal irrelev factual inform paper simpl discuss issu irrelev relat independ statement van der torr contextu deontic logic recent author suggest explicitli interpret oblig formula impli except circumst oblig defeat overridden speci oblig logic consist repres speci citi structur eat serv permit motiv suggest logic oblig lack strengthen impli structur similar impli de ned normal world world prefer model de ned argument mistaken reason similar minim world model satisfi repres ideal violat prohibit formula impli contrari deriv sentenc intuit impli forbidden eat eat except impli except normal uncertainti semant argument hold impli subsect give exampl distinct oblig impli formal deriv access relat build semant oblig normal van der torr contextu deontic logic deriv desir formal illustr interpret motiv lead mistaken interpret consist addit strengthen deriv violat violat state ideal oblig longer forc illustr assist neighbor impli deriv oblig assist violat consist forbidden paradox structur similar condit oblig condit simpli analog semant de hint deeper similar relat complex discuss philosoph orient literatur sourc complex di erent type due prima faci oblig oblig uncertainti section detail discuss issu scope motiv practic import recogn case violat except simpl structur properti violat context crucial problem violat context norm reason oblig result oblig longer forc oblig contextdepend case agent violat violat agent violat context oblig distinguish ideal vari context formal reason van der torr contextu deontic logic cur paradox paradox oblig refer ideal context con ict oblig refer context violat context left paradox result counterintuit inconsist interest relat violat context independ analyz sergot motiv studi contextu deontic reason sentenc dog sign sign sergot argu inconsist read contextu oblig ordinari condit oblig regul violat respect primari oblig oblig intend regul norm ignor norm absenc conclud hand sign hand continu variant dog rst sentenc version forrest gentl murder murder murder dog gener accept forrest paradox sergot explain set regul set oblig set logic inconsist case logic dog footnot forrest paradox analyz di erent type kill replac di erent color sergot alphabet door paint door paint left door left impli van der torr contextu deontic logic intuit consist sergot suggest inconsist regul violat respect primari featur impli rst abandon consequenti make logic stronger add constraint make set forbid dog implicitli forbid kind dog consequenti closur disregard determin obligatori sergot conclud di erenc consist inconsist depend critic state explicitli sketch develop entail relat design explicit oblig special statu violat context deontic independ analysi present crucial distinct implicit independ assumpt show oblig inconsist independ assumpt ad sergot simpli mean explicit manner present suggest depend deriv independ explicitli make violat context independ assumpt paradox disappear rst dog fact owner violat violat rst violat violat violat ideal context oblig violat repres context dog context dog oblig dog refer ideal oblig refer context oblig violat sell van der torr contextu deontic logic dog exchang improv present state air gener reason context owner sell reason context sold exchang dog sold exchang depend context refer di erent reason context make di erent violat context optim deriv oblig dog contradictori logic distinguish fact sentenc regul inconsist develop analyz reason interpret extens sdl explicit context interpret longer formal ordinari condit oblig write context repres reason context proposit sentenc formal regul introduc background knowledg sergot repres stand dog reason context ideal context dog forbidden reason context context oblig forc contextu oblig formal hypothet oblig read sell sell exchang contextu deontic logic section introduc contextu deontic logic phrase deontic logic refer logic formula type repres except circumst oblig defeat oblig defeat except circumst mean assum refer violat context longer prefer violat semant simpl dynam prefer van der torr contextu deontic logic tic gener hansson prefer semant de nition basic idea evalu truth condit oblig condit determin relev prefer context determin relev part prefer order oblig true true prefer state de nition cdl set set proposit exiv total connect access valuat function assum stand proposit deriv exist world world prefer world order satisfi prohibit permiss de ned def def write similarli note order order world di erenc context condit relat fact context assum xed condit explain end section de nition analog de nition de nition cdl infer relat proposit logic cdl axiomat correct complet set proposit axiom extend exampl discuss focu infer pattern strengthen cdl split contextu deontic logic repres problemat condit occur oblig notori paradox man backward version paradox restrict cf van der torr contextu deontic logic strengthen context strengthen condit axiom illustr context condit deriv strengthen context block inspect axiom reveal condit strengthen absenc factual repres absenc principl solut spirit boutili simpl approach discuss section base lang extens boutili framework lang distinguish background knowledg repres knowledg repres simpli proposit cdl kb jf extens cdl straightforward technic point pose challeng cdl repres exampl repres knowledg kb repres norm lang work discuss previou section benchmark exampl deontic logic suggest guidelin sentenc repres background knowledg assum xed knowledg notion discuss hansson argu point dyadic deontic logic kind introduc formal assum xed consequ express make sad circumst dyadic deontic detach intuit formal modal oper read implicitli recent approach deontic section relat research distinguish kind sentenc chang sentenc chang sentenc rst type repres background van der torr contextu deontic logic knowledg sentenc murder repres background knowledg interest murder undon sentenc repres interest question murder violat sentenc type repres case reason sentenc dog consid assum situat dog longer fact physic sell dog norm repres distinct norm repres involv reason oblig assum true alter repres repres dog oblig dog meant make sad circumst reach ideal repres issu leav open restrict logic situat demand impli impli impli mean express left issu open exclud unforeseen applic logic end warn deontic logic literatur discuss complic discuss dicult satisfactori inher moral legal reason consequ give guidelin solv problem knowledg consequ good logic consequ paper discuss turn addit tool repres independ assumpt van der torr contextu deontic logic deontic independ section formal de ne show deontic paradox discuss violat context independ assumpt made explicit basic idea set sentenc repres set deontic set background knowledg sentenc kb set knowledg sentenc section partit set deontic sentenc set norm set factual independ statement set deontic independ statement di qualit independ deal irrelev problem default reason bird deriv independ ying contextu deontic reason type qualit independ deal irrelev problem factual independ independ respect deontic independ independ respect context de nition formal notion de nition speci norm speci cation tupl ns dii set cdl kb set proposit di set cdl sentenc form di negat factual deontic factual independ respect oblig context deontic independ respect oblig context factual factual call priori de facto oblig discrimin di erent sergot call formula ac formula call van der torr contextu deontic logic priori de facto negat permit factual deontic independ power oblig deriv oblig permiss permiss case oblig deriv permiss permiss oblig case depend continu show factual independ plai similar role deontic reason independ default reason ns cdl prohibit forbidden fd factual independ exist independ relat deriv prohibit dog forbidden prohibit factual depend blind deriv permiss owner permit dog discuss section distinguish variabl paramet event uncontrol make oblig paramet desir blind infer obligatori forbidden owner blind illustr deontic independ analyz regul ns hn di ns hn di ff di ff di ff fd impli typic cdl model set consist class strang deriv factual depend de ned term exist permiss factual depend statement deriv graph issu discuss section van der torr contextu deontic logic order prefer world world di di ns prohibit deontic depend deontic independ ns prohibit inconsist di inconsist explain sergot problem deontic independ relat suggest explicit manner deontic independ explicitli deontic independ analyz scenario discuss makinson explicit oblig told told secret told told condit conclud deriv negat rst item broken separ told explicit intuit depend priorit speci citi absenc author conclud told ns hn di ns hn di di di impli vice versa typic cdl model consist order prefer world world di di ns oblig deontic depend ns independ suggest explicit manner present set di deriv contradictori independ assumpt set inconsist van der torr contextu deontic logic suggest paradox violat context independ assumpt explicitli full analysi paradox interpret real problem paradox interpret sentenc speci oblig overrid gener ns ns ns oblig factual depend oblig overridden set consist ns factual set inconsist clari es question oblig obligatori formal paradox illustr natur languag ambigu complic exampl violat except formal oblig intend speaker deriv structur natur determin intend behavior oblig deontic independ refer violat factual independ overridden deontic independ factual independ di erent aspect di erenc di erent type independ relat infer explicit discuss section manner present explicitli violat context independ assumpt analyz deontic directli lead practic approach reason oblig ns di repres di perspect knowledg gain van der torr contextu deontic logic introduct di practic reason repres independ relat di typic independ relat deriv graphic bayesian network approach reason reason uncertainti infer independ relat di explicit manner present oblig suggest sergot call syntact semant ident set deriv due syntact present section variant syntact approach simplic assum contextu disjunct negat modal permiss prohibit studi explicit manner present introduc procedur deriv set di de nition induc independ relat deontic independ violat impli explicitli deontic independ consist de nition set contextu oblig cdl set deriv deontic independ statement deriv independ assumpt illustr run exampl set cdl formula consist inconsist set cdl formula rg rg consist inconsist illustr notion deontic independ van der torr contextu deontic logic formal de nition independ relat deriv explicit qg due theorem characterist approach deriv contradictori cdl extend de nition oblig repres consist illustr combin independ oblig strong independ assumpt de nition weaken logic longer hold logic impli valid intuit deriv type deontic logic section present exampl give intuit motiv explan factual independ notic di erent wai formal section illustr di erent notion oblig oblig uncertainti prima faci oblig formal cdl discuss earlier work distinct oblig uncertainti prima faci oblig oblig uncertainti overridden complet prima faci oblig overshadow overrid oblig oblig uncertainti prima oblig de nition oblig uncertainti satisfi reinstat simpl de nition overridden de nition set contextu oblig cdl set deriv factual independ statement overridden overridden van der torr contextu deontic logic stand proposit consist introduc reinstat make de nition de nition oblig overridden speci oblig cycl de nition faci set contextu oblig cdl set deriv factual independ statement rec overridden overridden overridden oblig overridden wealth approach reason reason uncertainti suggest approach deriv independ assumpt discuss scope illustr di erent approach formal cdl end close remark cdl restrict condit restrict ad depend applic logic reason case add disjunct rule approach strengthen popular reason uncertainti select inform model cdl inform model satisfi set oblig deriv deontic independ assumpt de nition dyadic deontic logic illustr deriv factual independ analog deontic independ de nition van der torr contextu deontic logic diamond window close rain window open sun shine deriv contradictori illustr factual independ relat impli explicit weaker deontic independ relat due con ict consequ con speci circumst prima faci oblig prima faci oblig close open window rain sun shine approach obtain replac connect order possibl order prima faci oblig class prefer world sati es develop deriv independ assumpt explicit set interact de nition case de nition account deriv obtain rst deontic independ rst factual independ illustr wai cdl studi interact relat research norm agent origin concept econom gener descript maker classic theori maker ration maxim expect util econom agent call ration ideal agent theori extend multi agent system game theori social choic theori arti cial intellig concept agent call autonom intellig agent close relat notion cognit agent discuss cognit scienc philosophi norm discuss relat autonom cognit agent van der torr contextu deontic logic classic theori game theori suggest norm practic agent cooper stabil coordin agent competit norm reciproc prison dilemma evolutionari game theori favorit agent game call thousand penni game explain nice illustr distinct cognit norm agent game thousand penni tabl agent penni game penni case agent turn penni game penni agent turn agent maxim number penni sum assum agent ration dictat rst agent penni backward induct argument penni agent penni agent call maker thought solut break limit bound ration analysi bdi logic argu agent break backward induct agent reason thousand step deep problem solut agent trust reason step result human reason reason problem observ human arti cial agent month comput power doubl moor expect limit agent trust obtain result altern break backward induct argument introduc norm agent process typic properti norm inform past rst agent penni smart reason thousand step deep agent higher encount social van der torr contextu deontic logic agent cognit scienc suggest agent multi agent system social agent agent part group make di erent agent inspir theori develop fact man social anim thought consequ behavior norm plai import role social theori independ paper shown independ assumpt norm reason consid reason awar notion independ deontic context optim class interpret contextu paramet jone bimod logic recent jone base di erent ideal idea fact settl context context tempor reason discuss context reason semant paper violat context repres implicitli prefer relat repres explicitli di erent wai explicitli repres violat violat explicitli repres class relat wg set optim class explicitli repres norm context prescript oblig deduc prefer violat context optim class introduc explicit context stai close tradit semant simpl introduc notion deontic independ independ studi area studi independ inspir axiom probabl theori disjoint set probabl sum probabl independ relat set variabl import concept reduc complex probabl util function bayesian network van der torr contextu deontic logic default epistem plan goal independ norm independ relat variabl deriv independ permiss pp context studi area recent idea formal context ai literatur mccarthi formal base altern independ assumpt repair approach condit knowledg base idea advantag main featur nonmonoton infer respect rule addit contrari classic legitim expect undesir block ad rule delet conjectur reason basi rank express exibl captur expect behavior norm base open problem repair approach formal reason independ close relat irrelev work relat relev implic relev deontic logic paper consid relev philosoph discuss norm multi agent system discuss argument norm interest object studi multi agent system rst argument norm bridg cognit social bridg autonom agent level multi agent system level norm individu agent plai role agent norm multi agent system crucial tool cooper trust argument norm violat plai import role autonomi control multi agent system subject question norm plai di erent di erent circumst import question deontic logic applic studi paper proce norm violat practic approach van der torr contextu deontic logic reason norm oblig base violat context independ assumpt problem repres reason norm split part rst part concern correct norm weak deontic logic violat context express except express violat oblig factual depend deontic depend violat part concern ecient norm deriv independ relat explicit norm graphic shown violat context independ assumpt repres deontic paradox regul paradox subject research independ assumpt graphic independ independ network approach introduc paper compar repair approach condit knowledg base mention previou section final subject research relev studi philosoph discuss factual deontic relat di erent type independ di erent type observ nalli relat contextu deontic reason tempor reason acknowledg anonym journal insight comment earlier version paper refer ce philosoph foundat deontic logic logic condit meyer deontic logic comput norm system speci page john wilei systemat frame constant deontic logic deontic page kj arrow social choic individu valu prima faci oblig studia van der torr contextu deontic logic axelrod evolut cooper basic bacchu aj grove util independ qualit theori page logic page prade practic handl rule independ inform possibilist logic appli boutili condit logic modal approach arti cial boutili logic qualit theori page bratman practic reason harvard cambridg van der torr con ict intent desir intern confer autonom agent page jone approach oblig deontic page castelfranchi model social action ai agent arti cial rm imper deontic logic pr cohen hj levesqu intent choic commit arti cial dignum autonom norm accept intellig agent lnai page dennett intent stanc mit press bradford dignum autonom agent norm arti cial intellig cavedon social sophist bdi agent fourth intern confer multiag system page explain reason world mit del prade qualit relev roadmap page pick heterogen activ semant arti cial van der torr formal analysi control system page jw forrest gentl journal gobl murder paradox deepen philosoph hansson analysi deontic logic deontic introductori systemat page reidel publish van der torr contextu deontic logic penni backward induct journal trust reason cambridg jf horti moral dilemma nonmonoton logic journal philosoph jf horti nonmonoton foundat deontic logic deontic page jf horti agenc deontic logic oxford je rei logic chicago jen semant deontic logic journal philosoph jone deontic logic jone sergot deontic logic methodolog arti cial intellig jone sergot law comput norm system perspect meyer deontic logic comput scienc john wilei lang condit desir util altern approach qualit theori page van der type con ict desir resolv aaai spring symposium workshop approach agenc van der desir autonom agent multi agent lewi semant analysi dyadic deontic logic logic theori semant page reidel publish luce rai game makinson face minim studia makinson fundament problem deontic logic logic inform system studi deontic logic comput page io makinson van der torr logic journal philosoph makinson van der torr constraint logic journal philosoph lt mccarti deontic reason fundamenta lt mccarti modal model theori page prima faci duti studia van der torr contextu deontic logic pearl probabilist reason intellig system morgan san pearl condit qualit theori page mj sergot oblig studia mj sergot dyadic deontic logic oblig deontic page rao georg model ration agent bdi architectur intern workshop knowledg page rao georg abstract architectur ration agent intern workshop knowledg page ross good oxford sandholm lesser level commit contract strateg breach game econom savag foundat statist wilei schild relationship bdi logic standard logic concurr autonom agent multi agent analysi hansson dyadic deontic logic journal philosoph relev deontic logic journal philosoph thomason deontic logic found logic studi deontic action foundat page thomason desir framework plan infer goal page van der torr violat oblig deontic logic page van der torr logic reusabl proposit output ful constraint basin label appli logic page van der torr tan face deontic logic deontic page extend version van der torr cancel type deontic logic van der torr tan tempor analysi paradox page van der torr tan reason dyadic oblig annal mathemat arti cial van der torr tan diagnosi make norm reason arti cial intellig van der torr tan duti commit agent page van der torr contextu deontic logic van der torr tan contextu deontic violat context factual formal aspect appli logic page van der torr tan dynam norm reason distinguish oblig uncertainti prima faci oblig reason dynam drum handbook extend combin van der torr updat semant prima faci oblig thirteenth european confer arti cial intellig van der torr updat semant oblig fifteenth confer uncertainti arti cial intellig van der torr tan deontic logic van der torr paramet desir qualit theori appli norm autonom agent phd stockholm gh von wright logic prefer edinburgh gh von wright essai deontic logic gener theori action publish gh von wright system deontic logic deontic introductori systemat page reidel publish condit logic workshop theoret foundat knowledg reason springer rj meyer applic deontic logic comput overview meyer deontic logic comput page john wilei
HCI/1660 4 investig wearabl comput task guidanc aircraft inspect jennif ami multimedia inform mobil environ lab school industri system engin georgia tech research institut aerospac engin school industri system engin georgia institut technolog georgia institut technolog ga usa ga usa abstract paper describ preliminari investig capabl wearabl comput provid task guidanc mobil environ studi examin capabl wearabl comput aid user inspect case studi procedur task inspect gener aviat aircraft configur task guidanc system current method inspect compar evalu initi result demonstr relianc comput pilot import user interfac design perform inspector paper conclud recommend direct research keyword task procedur aircraft wearabl comput introduct wearabl comput combin comput person auditori visual displai wearabl comput make access larg amount inform job site hand inform form sound wearabl comput suggest medic applic aid inspect mainten worker navig tour militari commun militari remot memori aid everydai life field test wearabl comput system mobil task studi gener capabl hardwar manual scan wearabl comput field test capabl afford wearabl term displai comput studi warrant wearabl comput chang enhanc user perform mobil task paper describ preliminari studi capabl wearabl comput provid task guidanc aid case studi inspect gener aviat aircraft background section describ wearabl comput studi characterist inspect wearabl comput wearabl comput design mobil user perform task figur show major compon wearabl comput studi comput worn belt waist comput older mhz mb ram size hard drive depend number hard drive manufactur combin visual integr compon visual displai visual inform aid user complet inspect user hear explanatori audio narrat current procedur microphon voic recognit softwar window user control comput voic pack commerci metal recharg batteri power comput headset comput batteri pack worn comput waist compon combin weigh approxim lb figur major compon wearabl comput inspect inspect task ensur plane gener perform pilot fly plane concentr primarili condit exterior plane inspect procedur task gener pilot refer paper checklist task chosen reason task procedur task requir inspector examin plane manner practic task provid ideal condit preliminari realist experienc short time frame task mobil task benefit wearabl procedur maintain safeti problem occur memori problem physic remind step forgotten paper checklist guard forgotten studi shown problem paper checklist paper checklist user distract interrupt skip step addit rememb step involv inspector make step item suitabl flight type identifi concern item finit number distinct state ignit switch discret type continu continu concern item vari infinit number state tire pressur continu infinit number state point state switch accept unaccept addit creat version paper checklist aid memori recal wearabl comput aid inspector provid complet task guidanc aid type requir techniqu discret user correct state provid procedur step continu user standard accept unaccept condit inspect system evalu guid design task guidanc inspect system evalu inspect system develop studi system text refer system text pictur refer system support memori recal task pilot complet procedur correctli text system intend aid pilot discret make clear desir state discret item pictur system support continu provid standard desir state continu item system incorpor procedur oper handbook pilot opportun step voic review step complet system ident word procedur step text system serv basic electron checklist present step involv inspect list step guid pilot inspect aid memori recal ensur miss pilot item complet step shown screen pilot hear text step person auditori displai sampl displai shown figur figur sampl displai text system pictur system electron checklist capabl text system digit photograph item aircraft check addit aid memori recal step pictur system specif exampl inspect step aid accuraci accept aircraft flight figur displai pictur system figur sampl displai pictur system evalu method pilot requir wearabl comput inspect system inspect conduct pilot report problem perceiv constraint present develop preliminari pilot volunt short amount time plane plane damag constraint limit design experi statist standpoint discoveri issu requir intend preliminari investig preset fault aircraft ten preset unaccept condit order evalu fault select fit categori list tabl categori fault identifi procedur list oper handbook wearabl comput wearabl comput aid pilot detect type fault provid indic wearabl comput user reli wearabl comput categori fault item list categori discret fault categori continu fault fault investig result costli perman damag aircraft tabl preset fault aircraft comput miss certif paper towel discret comput altern static sourc select baggag door unlock left elev hing oil low tape cover static sourc continu comput bind fuel low tire pressur low left wing tire particip particip consist pilot fly list show experienc pilot pilot averag year month averag total flight time hour averag total flight time hour eleven pilot learn inspect pilot male averag ag year pilot randomli assign current procedur text pictur system procedur wearabl comput user train wearabl comput voic abbrevi task guidanc program learn task guidanc inspect system abbrevi program led inspect simpl step system pilot wearabl comput straight inspect pilot ident instruct suffici inform judg specif aircraft requir fuel requir wearabl comput user told inspect system content ident pilot oper fit pilot inspect video tape subsequ debrief action video debrief research note pilot thought fault pilot complet background questionnair gather demograph inform determin level experi pilot wearabl comput system survei system thought gave final pilot interview elicit free opinion normal method inspect entir process hour half pilot control group hour wearabl comput user result section cover type result section review fault detect result section discuss process pilot conduct inspect section result questionnair interview pilot fault detect result measur percentag pilot detect shown tabl fault consid detect pilot form justifi opinion fault pilot suggest wearabl comput task guidanc except found pilot open baggag door realiz unlock wearabl comput specifi baggag door pilot state leav baggag door unlock escap rout tabl fault detect result control text pictur comput miss cert paper towel averag comput alt static sourc baggag door unlock elev hing oil low static sourc cover averag comput stick fuel low tire pressur low averag statist differ condit fault type expect found frequent control low detect rate group primari determin detect conspicu fault fault static sourc check altern static sourc valv step comput wearabl comput user check control group wearabl comput user procedur wearabl evolv part extern inspect gener aviat pilot process result addit fault detect videotap inspect review aspect discret activ lack physic contact plane wearabl comput user wearabl comput user jump item comput told pilot wearabl comput continu activ user touch plane wearabl comput user hand comment thought hand free remind good idea rare touch plane infrequ ran hand skin plane touch part plane explicitli mention wearabl comput critic step major control group perform explicitli list wearabl comput procedur top tabl show differ inspect import flight repres administr presenc statist differ control group wearabl comput group statist differ text pictur wearabl comput group case notic differ wearabl comput group text group check control cabl tail section compar pictur group differ pronounc inspect text group check flap compar pictur group data explan emerg differ occur explan pictur complet list requir provid refer remind pilot step explan pictur system inher user pictur system order step clear pictur group requir research thing explicitli mention wearabl pilot control group check bottom tabl detail control group statist significantli lower text pictur group inspect tail control group pilot check fuel open pilot check stall warn hole pilot air filter cleanli procedur ensur item check procedur impoverish item explicitli mention left temper heavi relianc comput procedur fruit area innov comput aid design tabl process analysi item inspect control text pictur comput inspect control cabl inspect flap shake elev shake wing check antenna check exhaust pipe examin top wing averag comput fuel clear stall warn clear air filter clean averag questionnair interview inform questionnair pilot idea hand free felt current hardwar system design make effect aid suggest touch hardwar procedur gener pilot thought wearabl comput cumbersom lighter weight wearabl comput user visual displai pilot entir screen pilot thought visual displai inspect lower expect highli visual task visual displai move check carefulli ey rare pilot move displai move nineti percent wearabl comput user control comput voic retrain comput voic start pilot difficult time larg metal remark good voic recognit result system auditori pilot repli compar visual seventi percent audio inform twenti percent audio inform pilot pilot pictur includ pictur pilot respond pictur troubl spot label pictur bad item type pictur conceiv aid make provid clearer refer wrong pilot wearabl comput custom procedur inspect order step item learn nineti percent wearabl comput user inspect differ procedur list comput pilot report thing order procedur prompt check item pilot check fewer item usual determin pilot carri paper checklist extern inspect twelv pilot inspect effort forget reli habit ensur check result impli pilot wearabl comput chang method emploi specif found pilot felt wearabl comput base novelti condit pilot easier follow system discuss preliminari investig small number wearabl comput system time limit profound differ found group make imposs draw definit observ made investig aspect task effect outcom fact pilot rare find wrong aircraft studi ten thing wrong remind pilot inspect item necessarili fault pilot studi comment correspond studi found person expect event impact percept inspector observ wearabl comput system compel make user inspect control group pilot extens control group comment comput wearabl comput effect pictur system greater specif pictur make system compel inspect relianc comput procedur support result obtain wearabl comput field test cmu research found inspector wearabl comput procedur requir paper procedur procedur ident cmu research occur wearabl comput guid inspector step procedur cmu field test flip side studi alter view comput compel user requir follow procedur follow comput procedur paper procedur procedur complet militari procedur perform enhanc procedur oper investig perform diminish trend match studi show user tend follow advic ignor knowledg time check accuraci comput behavior obviou case knowledg logic incomplet faulti complet complianc comput good procedur correct complet difficult comput correct complet task task depend standard task inspect procedur highli standard task inspect similar manner pilot order item inspect differ slightli pilot pilot differ appar disrupt pilot develop inspect pattern prescrib wearabl comput recommend preliminari investig draw discuss recommend made research inspect aid area explor design comput inspect aid environ rare event assum person person recogn fault fault due human tendenc overlook discount event inspect aid remind inspector item faulti wearabl comput displai comput capabl explor regard issu area addit investig design comput inspect aid user reli sole comput wearabl user expect instruct comput direct correct result studi user detect error fault studi pilot mention complet inspect check indic usual ten pilot wearabl comput extra check comput checklist complet area examin abil aid user highli standard task comput aid limit method complet task method abil flexibl aid user broaden applic wearabl comput implic task guidanc wearabl comput suggest similar applic wearabl comput provid task guidanc import characterist good task guidanc task guidanc develop philosophi philosophi user understand follow provid instruct understand syntax provid procedur philosophi refer syntax philosophi philosophi cognit situat essenti compet perform understand form mean provid procedur philosophi refer semant philosophi philosophi dictat design accompani procedur train implicitli task guidanc conceiv context syntax philosophi assum instruct complet close investig studi shown danger method system knowledg suffici complet suggest semant philosophi task guidanc pursu user encourag higher level cognit abil assess current situat determin adequaci task guidanc evid higher level cognit skill present paper result higher perform cognit abil clear encourag behavior adapt wearabl comput provid task clear type behavior encourag research domain suggest import user activ involv process user assess appropri plan futur decid addit action requir order user awar present instruct meant relationship instruct environ user present instruct fit task context relat environ context provid inform user requir research acknowledg special pilot volunt person plane fifteen pilot kindli volunt time studi studi complet comput resourc multimedia inform mobil environ laboratori georgia tech research institut refer mobil tour guid wireless design wearabl human factor comput system applic wearabl pc digit avion system wearabl comput aid human memori ieee applic wireless research real industri applic mobil comput commun ieee person procedur complex airlin cockpit ieee transact cockpit human tour prototyp mobil augment realiti system explor urban intern symposium wearabl critiqu design strategi engin success cooper system unpublish doctor ohio state interfac nineteenth annual symposium comput applic medic care collabor perform physic effect outcom commun comput support cooper work electron evalu level autom sixth intern symposium aviat psycholog digit experi wearabl intern symposium wearabl percept british journal analysi make nuclear power plant investig aid make klein naturalist lawrenc erlbaum human interact wood cognit engin complex dynam academ press properti advanc autom impact interact report cognit system engin ohio state field usabl evalu wearabl intern symposium wearabl augment realiti wearabl comput
DB/1661 3 tempor aspect semistructur data barbara letizia tanca politecnico di dip di da milano abstract inform histori data dynam aspect import static inform year amount inform access web present challeng academ industri research data relat partial complet consist simpl collect text imag le context semistructur model queri languag extend order dynam aspect present model base label graph repres semistructur data queri languag queri introduct classic model repres static aspect data inform consist data true world inform histori data dynam aspect import static inform record medic histori queri evolut data time constraint restrict occur clear kind queri data chang time evolut account year amount inform access web present challeng academ industri research data relat partial complet consist simpl collect text imag le number research project address problem access uniform kind semistructur data cite lorel unql websql weboql struql common approach repres semistructur data data model base label graph classic data base context semistructur data interest account dynam aspect evolut time eventu consecut order queri restrict data time queri tempor relat languag extend account time coordin context semistructur model queri languag extend order dynam aspect work address problem repres queri semistructur data author introduc queri data model annot node edg oem graph repres annot histori node edg implement annot attach node edg oem od object complex object od requir order repres histori node valu relationship node method growth number node nal graph ectiv appli queri main aim approach overcom adopt model reduc amount annot inform plan appli model check techniqu ectiv solv queri account static dynam aspect semistructur data properti belong class formula problem nding model possess properti decid algorithm run linear time size model formula emploi import size semistructur small sect structur paper sect present graphic data model suitabl repres static dynam aspect semistructur data sect describ semistructur sect introduc queri languag grammar appendix sect sketch line futur sect report graphic tempor data model semistructur data section introduc data model base label repres static dynam aspect relat semistructur data choic gener appli approach present literatur de nition semistructur tempor graph direct label graph set set label edg form label label root mean tn atom set type tempor set type ln set label complex atom object relat requir ln set string concret set interv valid time interv node edg function tn ln context node te le requir tn complex valu atom object label ni tn atom node label ni tn atom label atom node connect parent edg label te tempor valid interv relat edg te tempor le label tempor note node connect provid edg label di erent work assum node semistructur tempor graph identi er label root repres sake exampl omit label type node edg tempor edg repres jag line def distinguish kind complex graphic repres atom depict oval complex object relat complex object possibl number attribut atom object repres object atom exist independ parent complex object reason replic atom object atom connect di erent complex repres printabl inform order repres dynam aspect semistructur queri evolut add inform valid interv object relat graph inform true previou delet updat approach store minim amount fact avoid duplic lot node edg work repres transact time order trace inform deal static rollback approach made recent static record correct error histori activ record order overcom assum instant event store coincid time event occur realiti histori real world record explain associ interv relat edg instant repres start assumpt moment inform true call end repres time instant piec inform true entiti valid present assum constant diculti end valid interv open exampl time granular depend approach encod instant time discret fashion tempor sequenc state call index time domain assum time domain ft discret total order easi obtain semistructur tempor graph snapshot time origin snapshot semistructur tempor graph node arc start time note moment rst object record snapshot time semistructur tempor graph obtain arc object valid interv current snapshot semistructur tempor graph snapshot time object relat valid interv start time constant instant time oper section semistructur semistructur tempor graph modi ed semistructur tempor ve chang oper creat object obj cre creat time cre node label tn ln cre parent obj identi er obj occur obj creat complex creat node label tupl object valid interv cre case parent creat atom creat node label tupl object valid interv cre concret creat edg parent complex object obj atom object connect complex repres properti complex atom object label valid interv cre figur show creation complex object time creation atom object creation creation creation figur object creat remov object rem remov time rem node identi er obj oper consist modifi valid interv start time rem object order leav dangl modifi interv valid ingo outgo atom object edg ni set rem atom object connect set rem figur show delet complex object date delet atom object rem figur object remov creat relat obj cre add time cre edg label label obj obj obj obj exist actual complex object oper add tempor graph relat edg cre obj figur show relat creat date complex object obj creation figur relat creat remov relat complex obj rem remov time rem exist edg oper modi es valid interv edg rem figur show delet relat time obj rem note remov edg obj delet object obj actual object chang oper figur relat remov updat time atom object order comput oper remov atom object obj cancel date creat add node identi er obj set node start time obj creat tempor edg object obj object obj label figur show chang identi er att time chang tempor figur updat creat semistructur creat set object relat figur show teacher element label valid start time end time note object end time creat figur time object valid interv softwar engin mari jone figur initi time add teacher teach previou de object edg valid interv softwar engin john smith mari jone figur teacher ad time add titl valid interv figur teacher mari jone stop teach start teach valid interv correspond relat note valid interv chang exist mari jone data base softwar engin john smith figur ad date titl data shown figur add atom object label data chang valid interv object add tempor edg label atom object softwar engin john smith web data base data base mari jone tempor figur chang date remov delet exist object chang valid interv object relat atom object case chang valid interv node softwar properti ingo edg relat teacher john smith softwar softwar engin john smith web data base data base mari jone tempor figur object delet tempor semistructur queri languag section give inform overview semant concept queri languag syntact speci ed appendix aim queri semistructur data model mean semistructur tempor graph sect concept path identi es path inform graph path express start nish node label wildcard select speci es form result queri mean list path express result set path instanc graph path express di erent wildcard mean repres sequenc note sequenc edg repres sequenc repres sequenc te tempor note sequenc uniqu tempor edg list list root node label semistructur tempor speci es tempor consid inform sourc speci es condit link connect object subobject match select de ne restrict valu atom object valid interv node edg show exampl queri call fig report part semistructur tempor graph note time granular queri report form base grammar appendix correspond graphic work give grammar graphic version intuit associ mean graphic counterpart speci queri work address problem compar translat graph textual queri repres complex object thin line rectangular atom object thin line oval object label valid interv repres gener interv part graph depict thin line repres condit speci ed structur requir bold squar link result queri object speci ed select queri find teacher work teach select faculti exist interv begin end queri requir faculti teacher object connect object mean edg label valid interv year queri requir speci ed graphic depict fig note valid interv report object replac symbol interv edg teach speci ed result queri appli depict fig teacher object mari jone john smith figur visual queri find teacher work queri find teacher teach select faculti interv begin end queri similar previou restrict case exist condit object graphic version fig object speci ed atom object data base figur visual queri find teacher teach queri find current call select faculti peculiar queri tempor edg order current call data base tempor edg requir retriev atom object updat note order call write select faculti data base tempor figur queri find current call data base futur base queri retriev sect lot work face problem access uniform semistructur repres data model base label graph queri retriev activ requir develop graph queri expect extract inform store label activ requir perform kind match graph queri graphic subgraph instanc match isomorph similar queri graph task nding subgraph isomorph npcomplet applic size problem task similar model check consist nding kripk transit system veri es formula formula belong class ctl problem decid algorithm run linear time size kt formula emploi order appli model check algorithm plan associ ctl formula queri model check problem state local kt formula state verifi global kt formula nding state st order ectiv solv queri retriev associ modal logic formula interpret instanc graph kripk transit system nding subgraph instanc graph match queri instanc global model check problem shown obtain kt label graph simpli ad edg repres neg add edg label queri current call data translat tempor tempor ctl formula requir kt state successor label connect mean tempor edg state predic data base hold queri call data translat tempor ef tempor ctl formula requir kt state successor label connect mean sequenc tempor edg state predic data base hold work introduc graphic data model repres static dynam aspect semistructur data queri languag plan give semant graphic counterpart appli model check techniqu algorithm solv ecient queri retriev problem refer arocena mendelzon restructur web proc int confer data pp ieee comput societi suciu queri languag optim techniqu unstructur data proc acm sigmod pp suciu ad structur unstructur data sixth int confer pp widom repres queri semistructur data proc fourteenth pp ieee comput tanca graphic languag queri restructur xml document proc intern world wide web confer pp sistla automat veri cation concurr system tempor logic speci cation acm tran program lang chomicki tempor integr constraint relat ieee data engin pp special issu constraint manag chomicki tempor queri survei proc int confer tempor pp mp consen ao mendelzon visual formal real life proc ninth acm symposium principl base queri retriev proc joint confer declar schemata repres semistructur data proc eighth work confer semant pp subgraph bisimul problem complex technic report di dip di informatica novemb suciu queri languag manag system sigmod record special interest group manag widom manag system semistructur data sigmod milo queri world wide web proc fourth confer parallel distribut inform widom object exchang heterogen inform sourc proc eleventh pp ieee comput tanca declar graphic queri languag ieee tran knowledg data widom queri semistructur inform proc fourth pp snodgrass ahn taxonomi time proc acm sigmod intern confer manag pp grammar select exist interv interv begin end begin end begin end overlap equal intuit mean remain nontermin string node complex node atom node edg label constant string constant interv
DB/1662 3 algorithm larg tempor aggreg £ moon ý fernando vega ý þ comput scienc comput corpor arizona az ca abstract abil model natur essenti applic data wareh mine tempor aspect provid uniqu characterist challeng queri process optim challeng comput tempor complic comput tempor group introduc varieti tempor aggreg algorithm overcom major drawback previou work process time improv significantli algorithm deal substanti larger size memori introduct applic captur natur model import recogn research tempor model queri languag develop report literatur tempor queri languag support tempor aggreg tempor data queri provid uniqu characterist challeng queri process optim challeng comput tempor complic comput tempor group tempor tempor group process partit time tupl group partit aggreg £ work sponsor part nation scienc foundat career award research infrastructur program support de ciencia author assum content paper ue comput group tempor group type partit span group instant group span group base defin length week independ tempor attribut valu tupl instant group depend data store pair consecut instant creat time aggreg remain constant interv call constant interv aggreg base span instant group call span aggreg instant focu comput instant common challeng tempor aggreg comput instant aggreg tupl overlap simpli tupl order relat suffici due vari interv length comput maximum salari involv comput tempor extent maximum requir determin tupl overlap tempor instant figur show tabl tempor repres begin end individu tupl result instant aggreg maximum salari number tabl figur note multipl valu aggreg result singl scalar point period aggreg remain constant collect singl tupl instant aggreg evalu maximum salari depart tempor aggreg process sequenti parallel fashion parallel process technolog size applic grow evidenc olap data wareh environ sequenti parallel algorithm intern confer data engin san march salari dept begin end richard account karen ship nathan market nathan account input tupl count max begin end tempor aggreg result figur sampl tempor aggreg op comput tempor aggreg suffer limit size aggreg restrict memori requir priori knowledg input varieti tempor aggreg algorithm overcom major drawback previou work solut provid benefit state algorithm aggreg requir priori knowledg input improv process time significantli algorithm aggreg reli data partit deal substanti larger size memori note problem comput tempor aggreg relat aggreg data wareh environ data item data wareh environ point data deal tempor data time interv arbitrari length rest paper organ section survei background relat work comput tempor aggreg major limit previou work discuss section section present improv algorithm scalabl solut aggreg base data partit parallel process techniqu section present result evalu solut section summar contribut paper outlook futur work background previou work type aggreg comput convent relat scalar aggreg aggreg function scalar aggreg oper produc singl entir aggreg function partit relat base attribut comput scalar aggreg independ individu partit scalar aggreg aggreg express option qualif simpl algorithm epstein evalu scalar aggreg handl scalar aggreg algorithm comput separ store result singleton refer singleton relat evalu rest queri approach emploi program transform method systemat gener effici iter program aggreg queri approach implement tempor aggreg base extens algorithm constant interv determin aggreg evalu techniqu step separ complet read recent algorithm kline snodgrass tempor aggreg base instant group tupl algorithm call aggreg tree variant aggreg build tree scan algorithm fast requir minim scan build tree memori result tree store inform comput tempor aggreg depth search limit previou method note order tupl insert aggreg tree affect result tupl sort start time insert aggreg tree link insert slower insert balanc binari tree worst case time creat aggreg tree ç æ æ tupl sort time limit aggreg tree approach entir tree memori size aggreg tree proport number distinct timestamp start time end size aggreg tree algorithm deal limit size memori number distinct timestamp tupl circumv variant aggreg call aggreg author aggreg tree advantag tupl enabl garbag collect tree memori requir reduc significantli aggreg tree approach assum tupl tabl order tupl posit posit total order version tabl requir difficult met real system priori knowledg requir extern sort tabl worst case run time aggreg tree algorithm ç æ improv algorithm aggreg present algorithm comput tempor altern aggreg tree algorithm aggreg tree binari similar segment tree bentlei segment tree static balanc set aggreg tree aggreg tree dynam construct tupl scan insert tree structur result aggreg tree depend order tupl insert fact worst case run time ç æ æ tupl order timestamp valu quadrat complex impract costli applic observ common aggreg oper categor avg demand track attribut valu tupl observ led develop algorithm group aggreg oper solut group call balanc tree present section main idea algorithm tree balanc dynam tupl give notion maintain interv tree node solut group call aggreg figur count aggreg sort timestamp tag similar classic algorithm algorithm present section assum memori larg store entir data structur requir aggreg algorithm rest repres group balanc tree algorithm aggreg simpl approach base timestamp sort provid effici solut aggreg approach start load entir tupl memori timestamp valu extract timestamp timestamp start time end time tupl timestamp tag sort order timestamp valu figur sort list timestamp tag sampl figur count aggreg comput scan sort timestamp tag order start counter initi counter increment start tag decrement end tag encount tag counter increment number start tag decrement number end tag figur timestamp counter increment start tag timestamp worst case process time approach ç æ æ æ number tupl input real world tempor case tupl share timestamp valu start time end time approach requir amount memori process time repeat timestamp valu balanc tree algorithm optim perform repeat timestamp valu motiv balanc tree algorithm figur balanc tree construct sort list timestamp built load entir memori timestamp sort increment insert balanc tupl input scan node balanc tree store start time end store tag node store store number tupl start timestamp store number tupl end timestamp color tag store insert algorithm tree balanc dynam figur show process build balanc tree tabl figur show timestamp relev tempor aggreg comput start time record insert empti node creat set result tree singl node shown figur figur illustr snapshot tree tree balanc insert algorithm elabor insert focu paper balanc tree algorithm proce creat tree tree tupl read input balanc tree probe start end time tupl tree start timestamp found node creat insert tree start time end counter node timestamp increment insert node balanc tree algorithm comput aggreg valu perform tree tree node count aggreg increment node sum node store store attribut sum tupl start timestamp store attribut sum tupl end timestamp algorithm balanc tree set empti balanc foreach ì insert node ò ò ts ì ì insert node ò ò ts tend foreach ì count count decrement node balanc tree algorithm summar algorithm elimin redund timestamp valu balanc tree algorithm reduc memori requir tree time substanti small percentag uniqu timestamp balanc tree store inform tempor group aggreg intern node leaf node balanc tree algorithm half node requir aggreg tree store constant interv leaf node algorithm aggreg balanc tree algorithm simpl effici aggreg balanc tree store uniqu timestamp counter count track tupl aliv time instant inform tree figur root node show exist tupl start time tree convei inform life span tupl exact end time specif unlik count imposs comput max aggreg exact life span tupl modifi balanc tree algorithm comput max repeat timestamp valu tree addit data structur dual heap tree dual heap store attribut valu aggreg live tupl dead separ aggreg comput compar maximum valu heap pop match maximum valu heap dual heap track input record nil merg step merg step figur merg max aggreg life span tupl requir comput aggreg lose benefit balanc tree tree node tupl reduct memori requir due repeat addit overhead process heap aggreg call aggreg algorithm classic algorithm base aggreg algorithm comput larger aggreg result merg smaller aggreg result algorithm start merg tupl pair bottom termin final aggreg result obtain top intermedi aggreg defin integ set uniqu timestamp order ø set attribut maximum attribut time interv exist live tupl empti interv consecut valu equal tupl ø input consid ì ì å figur illustr process merg tupl sampl tabl figur sampl tupl line ment figur tupl tabl merg intermedi result tupl merg intermedi result result step shown figur intermedi result merg final aggreg result figur input æ tupl aggreg algorithm gener intermedi aggreg memori algorithm merg intermedi result final aggreg result obtain worst case process time algorithm ç æ æ shown figur size intermedi result smaller tupl cover consecut interv merg singl interv share aggreg maximum amount addit memori requir intermedi result smaller size input count balanc tree remain algorithm choic balanc tree algorithm memori requir number tree minimum build balanc tree increment remov repeat minim process time bucket algorithm aggreg addit algorithm aggreg previou major compon work paper develop techniqu comput tempor aggreg constraint limit buffer space size deal limit size memori crucial tempor aggreg requir constant number due potenti huge amount tempor data prohibit costli number requir scan limit proport size accept solut method requir small constant number scan algorithm base partit tupl import oper relat hash join algorithm ø ø bucket bucket bucket bucket bucket bucket bucket bucket figur partit assign tupl bucket idea data partit relat hash join appli directli tempor aggreg tupl time interv readili partit tempor disjoint class hash time interv tupl length tupl overlap interv tupl check tupl overlap bucket tempor aggreg comput read bucket constant number time circumv assign data object multipl bucket replic approach figur tempor partit disjoint number bucket life span interv tupl assign bucket figur tupl ø assign bucket ø life span properli bucket life span overlap interv life span split piec piec assign bucket turn split tupl impact result figur life span tupl ø ø overlap tupl ø assign bucket ø bucket bucket process entail replic tupl lead duplic tupl minim duplic assign tupl sole bucket start end timestamp lie life span tupl ø overlap bucket tupl ø replic bucket intermedi bucket store tupl ø meta arrai aggreg inform tupl life span overlap intermedi bucket size meta arrai equal number bucket element meta arrai store aggreg bucket ø ø ø bucket bucket bucket bucket bucket bucket bucket bucket meta arrai aggreg figur meta arrai reduc data replic ø ø aggreg bucket bucket combin meta arrai figur step aggreg base data partit meta arrai figur time interv tupl ø span bucket ø split segment ø ø adjust time interv segment properli interv bucket line figur repres adjust time interv split ø ø assign bucket element meta arrai increment similar ø assign bucket element meta arrai increment result data partit meta arrai illustr figur note element meta arrai store valid aggreg tupl life span longer entir tupl scan partit bucket meta arrai tempor aggreg oper perform bucket independ figur show partial result aggreg perform bucket aggreg store meta arrai combin aggreg result bucket simpli ad count final aggreg result obtain merg pair adjac bucket boundari adjac aggreg valu equal ø ø ø ø ø ø ø ø algorithm tempor bucket set time interv bucket foreach tabl bucket bucket bucket bucket perform tempor aggreg bucket combin scalar bucket merg bucket boundari ur show final aggreg result dot vertic bar figur repres merg bucket boundari algorithm outlin tempor aggreg algorithm base data partit algorithm assum entir timelin tabl partit disjoint interv equal bucket note aggreg algorithm previou section aggreg individu bucket provid meta arrai small fit memori suffici memori hold tupl tempor aggreg oper perform read bucket approach requir access read comput tempor aggreg data replic tupl overlap multipl access requir approach extent depend factor life span tupl number bucket worst size tabl origin size replic tupl tabl bucket access requir approach bound small constant number scan show perform impact data replic section parallel bucket algorithm previou attempt develop scalabl method comput tempor aggreg base parallel aggreg tree algorithm approach inherit limit aggreg tree algorithm approach suffer ç æ run time tight limit size deal solut run parallel tempor aggreg algorithm base bucket algorithm present algorithm parallel tempor bucket set particip set time interv bucket proc local processor id ôöó foreach local partit remot processor proc proc ôöó ôöó processor ôöó ôöó ôöó processor ôöó meta local bucket algorithm meta arrai algorithm global combin meta arrai wrt aggreg oper local meta óô ðó ôöó perform tempor aggreg bucket meta algorithm straightforward parallel bucket algorithm distribut bucket particip processor tempor partit è disjoint è number processor local partit disjoint number local bucket global meta arrai local meta arrai processor global meta arrai track tupl life span extend processor local meta track tupl life span extend local bucket parallel aggreg algorithm summar algorithm mention assum entir tabl partit disjoint interv equal bucket distribut è processor rang partit processor assign consecut bucket rang partit scheme minim size global meta arrai arrai element requir processor processor comput global meta arrai independ local è processor commun comput final global meta arrai entir respect oper óô oper óô determin kind aggreg oper óô addit oper count aggreg maximum oper aggreg collect commun comput final global meta arrai implement effici parallel comput network workstat overhead combin global meta arrai expect neglig volum commun è word complet descript parallel bucket algorithm empir evalu empir evalu evalu algorithm empir compar previou work chose max tempor aggreg carri experi oper condit affect perform algorithm focu perform gain algorithm scalabl bucket algorithm set test benchmark perform intel pentium workstat mhz clock rate workstat mbyte memori gbyte disk storag scsi run linux kernel version measur time includ disk access time accur averag time multipl run elimin extrem case avoid system cach effect disk access load irrelev data entir memori consecut run experi gener synthet data million tempor instant consid basic life span life span tupl determin randomli life span tupl determin randomli percent popul tupl fix percent percent start time tupl uniformli distribut tupl byte includ tempor attribut time end attribut synthet gener experi sort tempor attribut state aggreg set experi carri small mbyte byte requir data structur fit memori recal algorithm section aggreg tree algorithm variat requir entir data structur memori balanc tree algorithm aggreg algorithm aggreg figur compar balanc tree aggreg tree algorithm count figur compar aggreg tree algorithm max aggreg balanc tree aggreg algorithm consist perform faster aggreg tree algorithm count max aggreg tree time aggreg higher percentag process time algorithm remain constant percentag tupl note perform aggreg tree algorithm remain unchang algorithm work essenti aggreg figur tupl input sort start expect perform aggreg tree algorithm process time aggreg tree order magnitud slower plot vertic line figur compar aggreg tree algorithm algorithm perform time faster aggreg tree algorithm algorithm outperform aggreg tree aggreg tree consist margin aggreg tree requir priori knowledg algorithm bucket algorithm aggreg fact balanc tree aggreg algorithm design group aggreg algorithm show ident perform behavior previou experi rest present result aggreg set experi carri evalu bucket algorithm section perform aggreg data partit small measur overhead data partit balanc tree algorithm aggreg figur bucket irrespect larg demonstr overhead data partit compar balanc tree algorithm data observ percent process time bucket algorithm addit time time count aggreg small db size byte time max aggreg small db size byte unsort data unsort data count aggreg small db size byte time max aggreg small db size byte sort data sort data figur aggreg time bucket algorithm outperform aggreg tree algorithm significantli figur figur small amount overhead data partit expect smaller larg bucket remain memori written disk step aggreg individu cach bucket disk copi note perform bucket algorithm affect percentag tupl reason obviou tupl replic lead comput time disk access time figur show process time bucket algorithm size mbyte byte number bucket data partit mbyte gbyte larg fit memori except byte aggreg algorithm experi result shown figur demonstr bucket algorithm comput tempor aggreg substanti larger size memori note process time algorithm grow faster linearli size motiv scalabl solut parallel bucket algorithm section reader refer complet descript empir evalu parallel bucket algorithm futur work develop algorithm comput tempor aggreg algorithm provid benefit current state art wai balanc tree aggreg algorithm improv process time significantli small fit memori develop sequenti bucket algorithm base data partit scheme algorithm comput tempor aggreg substanti larger size process data partit sequenti parallel fashion observ factor affect perform includ percentag tupl time bucket bucket balanc tree balanc tree bucket size byte time aggreg bucket algorithm bucket bucket data base size bucket balanc tree bucket algorithm figur aggreg time ber bucket data partit algorithm outperform previou approach consist irrespect worth elabor issu plan studi perform impact factor initi data placement tempor partit data reduct aggreg plan extend data partit approach requir comput aggreg data object extent unlik tempor expect process data partit gener meta arrai sophist refer van de watt collect commun librari page jon loui bentlei algorithm rectangl problem technic report surajit chaudhuri dayal overview data wareh olap technolog sigmod march thoma charl ronald rivest introduct algorithm mcgraw robert epstein techniqu process aggreg relat system technic report februari johann freytag nathan goodman translat aggreg queri iter program vldb page august jose bruce jim richard snodgrass parallel algorithm comput tempor aggreg inter confer data march christian jensen richard snodgrass semant inform nick kline richard snodgrass comput tempor aggreg inter confer data page march donald knuth sort volum art comput program publish fernando vega scalabl algorithm tempor aggreg technic report tr az novemb mackenzi aggreg tempor queri languag tquel ieee transact knowledg data octob tansel al tempor design implement system applic seri redwood paul implement histor aggreg wayn state novemb ye john kean process tempor aggreg parallel ieee inter conf page octob
Agents/1663 1 intent reconsid michael wooldridg simon parson depart electron engin queen mari westfield colleg london london unit kingdom abstract issu design agent successfulli balanc amount time spent reconsid intent amount time spent act achiev review wai problem motiv introduc simpl formal model close relat model agent explicitli equip mechan action control agent action formal defin mean agent optim respect task explor properti agent task environ requir control compon show model captur number interest practic reason illustr notion control easili extend encompass higherord reason conclud discuss pointer futur work introduct research activ intellig agent commun focuss problem design agent achiev effect balanc process decid reason process decid success approach emerg time paradigm develop bdi paradigm great extent driven bratman theori practic reason intent plai central role put agent indefinit action idea eventu commit achiev state devot resourc achiev chosen state affair plai central role futur practic reason major issu design agent base model intent reconsid intent agent simpli maintain stop reconsid intent believ longer achiev agent chang focu drop exist intent adopt kinni georgeff studi intent strategi found dynam environ environ rate world chang high tend favour cautiou intent strategi frequent stop reconsid intent agent incur cost wast effort attempt achiev intent longer exploit opportun static environ rate world chang low tend favour bold intent infrequ reconsid intent aim paper question reconsid versu act formal point contrast standpoint kinni georgeff develop simpl formal model practic reason investig behaviour model type task environ agent close relat bdi model agent intern state set belief agent set intent agent made state world agent reconsid modifi action act current intent function mediat control function metalevel control function simpli action metalevel control function act interpret pr close resembl manag agent intent structur pr remaind paper structur section present formal model defin mean agent optim respect task environ section investig mean task environ real discuss relationship hold agent control compon order agent act optim task environ defin notion sound complet control show optim control function sound complet respect function import class task environ section show formal framework captur number typic practic reason scenario section model control captur reason strategi strategi determin sort reason function integr agent model section present issu futur work agent environ simpl model practic reason agent environ defin run histori agent state control belief input perceptu kei control flow data flow action output intent action fig action architectur practic reason agent environ overview agent model figur discuss model import make point clear architectur intend implement agent architectur intend abstract kei function compon bdi find analysi note architectur close relat bdi model kei differ reader note desir miss desir bdi agent essenti agent agent commit subset intent desir agent process intent kei compon intent primari object studi paper subsum compon architectur implement compon emploi desir analysi plai role return figur agent main data belief set intent set agent belief repres inform agent environ implement agent system pr belief repres simpli variabl program languag belief correspond agent inform state set belief content concern formula determin belief mutual consist agent action moment guid intent repres activ intent thought state affair agent commit bring set intent concern content assum intent express sort logic languag agent local state pair set set intent local state agent intern snapshot inform focu instant set intern state stand member denot belief compon intent compon agent oper situat agent environ extern agent extern compon includ leav explor possibl futur assum environ extern agent set state agent environ make system global state system time pair state agent state environ set global state stand member action figur agent main gener control action function state function thought belief function basi agent current state state determin set belief includ inform agent perceiv agent function percept agent capabl function map compon agent architectur control idea agent choic expend comput resourc decid chang act expend resourc attempt achiev current note assum agent chang focu modifi explicit repres choic versu assum set denot denot action agent metalevel control function action agent subsequ agent subsequ act repres strategi function basi agent intern decid act process agent repres function basi agent intern state belief determin set intent repres delib process function agent decid act achiev intent decid action perform action select compon agent essenti function basi agent current return repres agent chosen perform ac ff set action action select function map ac defin agent metalevel control action select initi state state assumpt result depend note abstractli model compon agent ultim implement program kind write cost time cost idea time cost time cost cost cost assum cost approxim equal cost act cost cost assum cost control smaller cost cost cost run recal agent situat environ set state order repres effect agent action introduc state transform idea input environ state action ff return environ state result perform ff ac implicitli assum environ uncertainti result perform action state assum environ state chang perform action part agent environ static drop assumpt problemat alter make formal convolut leav reader make requir modif defin environ env tripl set environ state state transform initi state env run system thought infinit initi state system initi state environ initi state choic dictat agent control function basi initi state state result agent made choic agent chose act environ state result agent perform chosen action initi intern state result agent updat belief belief function chang intent agent chose time environ remain agent agent belief updat previou agent intent updat function infinit sequenc repres run agent ag environ env iff ae denot run agent ag environ run set run optim behaviour order express util introduc function run assign real number indic run essenti captur standard notion util assum upper bound util assign run function repres perform measur agent measur task environ defin pair env run ir util function agent ag optim respect task environ agent ag essenc standard notion optim agent view agent simpli action select decisionmak map perceptu input action architectur compon agent control function servic make obviou question defin mean compon optim case control control function chose agent lost util agent hit speed chose control function case differ lead control function control function agent obtain higher util optim respect similar defin optim detail left reader notic optim compon defin respect task respect compon agent theorem captur relationship optim agent optim compon theorem agent optim respect task compon agent mutual optim proof ag global optim respect compon assum compon case ag optim respect contradict notic implic theorem strengthen fact compon agent mutual optim impli agent optim agent mutual optim compon global achiev kind local optim achiev make concept valuat function task environ tileworld introduc pollack ringuett kinni georgeff investig agent commit strategi environ agent situat grid move singl step grid world occupi number randomli distribut hole agent block agent move push block ahead agent number block hole valuat function tw tileworld simpli defin denot number block successfulli hole denot number time step block hole note valuat function tw rang agent fail block block hole time agent enter tileworld comput optim plan block variant travel salesman comput plan make tileworld complic fact block disappear random agent advanc hole oper monitor modifi action return tileworld comment issu section remaind concern relationship compon control function compon assum agent function action function fix optim task environ clear perform agent depend natur task environ situat agent perform badli task environ properti understand relationship agent task environ occupi great benefit build agent oper real environ arguabl import everydai class task environ banner put task environ simpli time plai part evalu agent perform identifi sort task agent bring state affair quickli sooner achiev state higher agent requir repeat optim agent repeat task task environ problemat agent oper successfulli successfulli amount time spend amount time spend act agent typic achiev notion reactiv formal defin mean task environ exampl concept encompass number relat properti attempt present gener defin class task environ wast effort argu concept captur aspect task environ agent wast essenti possibl agent wast effort expend resourc attempt achiev intent discuss section agent observ form intent block hole agent attempt achiev intent hole easi construct task optim agent act argu task environ correspond interest situat wast effort reconsid intent similar wast effort occur agent fail exploit serendipit situat hole side make obtain addit type wast effort occur agent act agent engag unnecessari agent tileworld intent block stop agent intent continu push block hole thing util accord agent obtain agent simpli act order formal defin agent wast defin mean agent optim intent agent optim intent good reason chang inform optim function chang agent state situat task environ intent set optim iff note notion optim intent set inher rel specif agent intent set optim agent optim agent ag task environ wast effort iff optim optim task environ wast effort iff optim agent task environ wast effort turn relationship control task environ wast effort interact control task environ tabl extend situat agent optim reason function chose act situat agent time act agent function chang situat essenti situat function chang focu clear reason function optim function intent replac chang intent situat agent optim intent control function correct optim situat agent optim time chang focu control function function optim situat situat situat optim chose chang number tabl practic reason situat function focu control compon agent wast time modifi intent fact reason discuss extract simpl task environ wast control function function chang focu control function sound respect optim function iff chang focu impli complet respect iff chang impli easili establish relat sound complet control strategi task environ wast effort theorem task environ wast optim agent control function sound complet respect function proof assum arbitrari agent optim respect task environ wast effort show sound complet respect start assum sound respect control function function chang wast sound start assum complet respect wast complet optim control function task environ wast effort kind oracl function point control optim control function run function subroutin chang case function chang focu control function defin ae success strategi cost control function approxim equal cost cost cost point requir cost control significantli cost run compon order decid option previou discuss notion task investig relationship control task environ show illustr practic reason scenario repres framework bratman colleagu give variant scenario variant meaningless scenario scenario base basic rosi agent assign task repair malfunct result task decid replac crt believ adopt intent arm replac tube fix rosi arriv find crt contrast turn option fix adjust contrast inform suffici control function decid worth rosi find adjust contrast cheaper replac crt adopt intent adjust contrast adjust contrast complet initi task repres rosi world set proposit proposit interest tabl intend interpret requir addit intend captur presenc addit crt scenario intend captur fact rosi fix adjust contrast option crt carri intend captur fact faulti crt intend captur fact addit crt scenario superior crt carri repres rosi intent tabl captur rosi initi progress pick crt broken belief work crt contrast turn adjust contrast crt fix spare spare intent fix origin crt fix adjust contrast fix fix altern crt tabl rosi belief intent simplic assum intent achiev singl action equal seri action achiev intent ff action achiev intent ff rosi reason initi state world dg crt contrast turn rosi initi intern state fi begin scenario wrongli believ crt burn note rosi belief includ prefer inform initi fix origin part rosi oper decid act execut action ff achiev intent arriv point remov intent move intent adopt intent fix crt brought main focu point identifi real state function updat belief reflect intern state fi state extern world rosi appli control ae situat gloss reason suspect altern repair illustr fragment complet control function rosi believ crt contrast turn adjust contrast mean fix replac crt find result defin fi fi fi function decid adjust fi note check agent mean adopt intent decid adopt rosi unabl adjust contrast wrong kind gripper good solut point chang focu achiev ignor rosi intern state fi extern world remain time ff contrast repair chang world rosi belief state contrast control final state environ rosi intern state complet run scenario scenario rosi arriv find crt fix fix short crt burn inform suffici rosi control function decid worth fix replac crt line unchang intent start scenario rg fi crt fix rosi initi rosi option replac crt move pop intent previou environ state remain unchang rosi intern state fi rosi appli control fact reason suspect lead altern mean repair situat return rosi fix crt option reject idea chang focu establish build plan order fix decid rosi perform ff situat rg complet run scenario scenario scenario rosi arriv find spare crt sit note spare inferior tube brought control mechan advantag tube act rosi replac crt line origin intent scenario begin state sg fi rosi proce time find spare tube belief environ state remain unchang rosi intern state time newli visibl crt carri ff replac crt situat sg complet run scenario scenario scenario rosi arriv find spare crt sit time note spare superior tube brought control mechan advantag tube save cost tube greater cost result adopt intent rosi replac crt line intent scenario time crt superior rosi bring initi situat sg fi move environ unchang rosi intern state fi time fi environ state remain unchang rosi intern state fi rosi proce act ff give global sg complet run scenario point note optim case set action chosen give result easi alter rosi optim happen scenario mean addit crt intent action ff achiev crt chang intent rosi act chang unabl achiev intent revert final point note intent action justifi assumpt time cost typic involv activ build evalu qualiti plan achiev set altern intent activ simpl altern intent overhead reason sketch agent control strategi role strategi plai control refer control strategi strategi strategi act control function thought select control function control function examin agent belief dynam agent environ determin environ highli dynam rate world chang high select cautiou control function frequent agent environ static rate world chang select bold control function favour action easi imagin agent control function select function level idea similar hierarchi incorpor reason formal model mlc set control strategi control strategi discuss defin mlc mlc mlc set control mlc set control agent nth order control function agent compon redefin mean run repres histori agent environ infinit sequenc repres run agent ag environ env iff time time notic agent make control strictli speak power defin earlier agent agent behav point point view agent make divid function agent level investig relationship control compon practic reason architectur relationship investig perspect kinni contrast attempt formal analysi demonstr construct simpl realist model practic reason agent type investig kinni establish basic properti agent type task environ focuss task common class task environ encount attempt formal analysi relationship agent similar spirit work origin attempt relat work russel subramanian agent agent perform agent architectur constraint increasingli larg literatur bdi agent initi investig led area initi anticip investig implic agent bdi model interest research hope investig futur work issu hope move individu agent system acknowledg paper benefit enorm comment van jorg tim barnei martha pollack refer bratman practic reason harvard pollack plan practic reason comput cohen levesqu intent choic commit artifici vardi reason knowledg mit georgeff lanski reactiv reason plan sixth nation confer artifici intellig page kinni georgeff commit effect situat agent twelfth intern joint confer artifici intellig page muller agent thing intellig agent intern workshop agent languag lectur note artifici intellig volum perli meta logic mae architectur page elsevi scienc publish pollack ringuett introduc evalu agent architectur eighth nation confer artifici intellig page rao georgeff procedur bdi logic journal logic russel norvig artifici modern approach russel subramanian provabl agent journal ai schild relationship bdi logic standard logic concurr intellig agent intern workshop agent languag lectur note artifici intellig volum turner truth modal knowledg pitman wooldridg jen intellig theori practic knowledg engin articl process macro packag llnc style
AI/1664 2 knowledg diego giusepp de maurizio lenzerini dipartimento di informatica sistemistica universita di roma itali abstract problem model data import applic area multimedia data biolog digit data integr graph schema al recent simpl eleg formal repres semistructur data schema repres graph edg label unari formula notion conform schema subsumpt schema defin term simul relat author stress extend graph schema type edg exist constraint number outgo edg paper analyz appropri knowledg formal repres reason graph schema extend constraint argu order logic program languag satisfactori present solut base express descript logic provid techniqu complex analysi problem decid schema subsumpt conform interest differ express power specif constraint introduct abil repres data structur rigid strict convent consid crucial aspect modern approach data import applic biolog digit data access web buneman al christophid al milo quass al set home page design faculti web site home page vari extrem hard describ structur rigid form relat structur mechan flexibl tradit data model defin data data strictli type convent system data model al formal eleg data base graph label inform valu schema copyright american associ artifici intellig reserv data label edg schema formula theori notion coher schema term special call graph repres graph repres schema roughli simul correspond edg edg label edg label formula satisfi necessarili notion simul rigid usual notion suitabl reflect deal strict structur data al author point task relat data import reason check subsumpt task decid conform schema conform schema present algorithm analyz complex check subsumpt paper applic extend model type constraint al properti schema express term structur possibl addit exist edg bound number edg eman subgraph intuit suggest knowledg techniqu problem deal repres reason schema constraint basic goal work report paper verifi present result ffl analyz appropri kr formal repres reason graph schema extend demonstr order logic program languag satisfactori ffl show express descript logic studi giacomo lenzerini de giacomo lenzerini tool model reason semistructur data constraint express constraint term dl formula node schema formula node condit conform satisfi node simul ffl languag constraint express present result reason problem show ad type local constraint constraint condit edg eman complex reason present intract result case constraint studi case constraint express power giacomo lenzerini complex condit subgraph present techniqu check subsumpt show problem decid doubl exponenti time present start descript descript logic preliminari describ basic characterist model data descript logic data model data model basi graph model label unari formula order languag languag constitut set includ equal predic constant element schema refer complet decid theori set order formula true element decid check formula valid definit root connect graph edg label unari formula root connect graph edg label constant root graph denot root set node set edg denot edg node node label order establish coher schema gener notion conform subsumpt defin definit conform schema notat exist simul binari relat node impli edg exist edg definit subsum notat impli al algorithm present check subsumpt special case algorithm essenti greatest simul node work time size schema time check formula size valid gener part input problem al assum independ replac constant polynomi size jsj smaller jt make assumpt theori part input reason problem address paper consist descript logic descript logic repres domain interest term concept role concept model class role model relationship class concentr dl studi giacomo lenzerini correspond shown logic call modal emerson recent investig express tempor properti reactiv parallel process emerson view fragment logic fixpoint vianu make standard notion bound free occurr close treat quantifi primit symbol atom atom role call simpli concept form denot atom natur restrict made free occurr scope number negat introduc concept obtain substitut free occurr interpret consist interpret domain interpret function map atom concept subset atom role subset presenc free variabl extend interpret function directli concept logic reason introduc valuat valuat ae interpret map variabl subset valuat denot valuat ident ae fact interpret ae valuat assign mean concept logic associ ae extens function ae map concept subset ae ae ae ae ae ae ae ae fs ae ng ae fe observ oper subset subset syntact restrict enforc oper monoton wrt set construct denot fixpoint greatest fixpoint oper extens close concept independ close concept valuat explicitli knowledg base finit set axiom close concept interpret satisfi axiom model knowledg base satisfi axiom close concept satisfi knowledg base exist model theorem giacomo lenzerini satisfi close concept knowledg base problem kr formal data section discuss technolog kr contribut problem model data constraint start investig verifi order logic suit repres schema observ fol interest express complex constraint schema check fol model notion simul reason approach express schema fol base ffl node make predic nn edg mean node root call root mean edg label fact label satisfi formula repres ffl repres schema mean set suitabl formula fact node outgo edg label repres formula oe nk ffl interpret obtain assign truth ground formula form extend interpret comput extens predic nn basi formula ffl logic model relat edg start object satisfi root obtain structur correspond conform conform correspond logic model extens root predic empti schema node edg label set formula fol oe node edg label valid easi conform correspond extend model observ empti node edg conform correspond correctli captur schema node edg label set simpli oe easi model correspond conform assign true valid extend model simpli extens empti extens result model reflect fact conform show gener problem fol repres schema order semant liber captur notion simul order reflect type semant forc object extens predic evid satisfi predic observ greatest fixpoint semant satisfi properti fol extend fixpoint fol verifi logic program languag complet semant languag suit model schema difficulti schema cycl account schema schema cycl model kr system classic assumpt acycl data schema restrict practic observ order kr technolog model reason semistructur data resort kr formal ffl model graph limit ffl interpret graph make greatest fixpoint ffl express complex constraint ffl provid reason procedur comput subsumpt relat schema show characterist formal defin graph schema constraint reason task schema constraint address problem extend data model order express constraint graph repres schema conceiv constraint schema formula node schema formula express languag role condit conform satisfi node simul constraint addit condit respect impli structur graph definit pair total function node formula constraint languag definit conform notat exist binari relat node impli satisfi edg exist edg constraint contradict incompat structur notion consist relev definit node consist conform equal consist notion subsumpt remain unchang constraint studi consist subsumpt check schema constraint conform special case explicitli deal conform local constraint languag local constraint constraint edg directli eman node inspir dl number restrict formula syntax fl fl denot denot formula fl fl fl constraint form node call outgo edg constraint form call outgo edg node satisfi constraint notat condit iff iff iff fl fl iff fl fl note view node schema check consist schema amount visit graph remov node violat detect local check algorithm subsumpt obtain essenti incorpor local check constraint violat algorithm al theorem consist subsumpt check polynomi time size schema constraint languag constraint express condit edg directli connect node label constraint show simpl constraint inspir dl al al consist subsumpt intract formula fl fl fl addit rule satisfact constraint node iff iff oe observ local constraint node impli constraint adjac node exploit properti hard result al show consist check theorem check consist size edg label true observ check consist reduc check subsumpt wrt inconsist immedi subsumpt theorem show consist stai oracl valid complex check consist presenc constraint li necess verifi topolog determin constraint predict topolog valid checker potenti exponenti calcul note section bib bodi section paper section bib section bodi paper section bodi index item figur case local aspect relat topolog enforc constraint formula fixpoint constraint extend framework express constraint variant show decid consist subsumpt constraint languag set close formula construct syntax denot formula posit fl fl fl fl restrict free occurr fl scope number negat introduc fl fl fl model valuat ae map variabl subset denot valuat ident ae node defin satisfi constraint fl valuat notat iff iff fg iff fl fl fl iff fl fl fl iff fl oe oe iff iff fl iff iff constraint close satisfact independ denot simpli fl schema shown figur repres set web page gener translat articl nest section possibl bibliographi connect page repres content page model notic constraint state complex condit structur constraint rule loop connect section check subsumpt develop techniqu check subsumpt work case theori express term axiom order illustr featur assum interpret fix finit includ unari distinct constant element present finit set predic constant formula label edg boolean combin atom formula languag express form constant defin formula label edg valid notat iff iff iff view simpli replac edg label conform special case subsumpt techniqu check subsumpt base reduct unsatisfi knowledg base differ previou part input subsumpt check reduc problem decid problem decid unsatisfi concept knowledg base defin encod gener properti graph encod gener properti exploit al special role split label edg edg uv introduc intermedi node uv label axiom atom axiom partit interpret domain object denot node edg constant correct link object denot node edg order encod theori introduc concept predic concept constant pair add point restrict simpl kind theori sake approach work gener form oa cp oa observ linear jt encod schema order defin encod defin map constraint express formula ne fl construct node fu characterist concept set mutual node xu xu elimin equat substitut occurr remain equat result equat concept encod observ worst exponenti respect jsj properti encod properti encod establish decid complex check subsumpt constraint theorem subsum model satisfi interpret singleton theorem defin exist knowledg base size polynomi satisfi model interpret satisfi theorem check subsum decid time exponenti respect subsumpt check presenc determinist doubl exponenti time respect size schema construct analog process algebra defin characterist formula process formula satisfi process process bisimul conform result investig express dl interest tool model reason semistructur data constraint analysi present paper show complex subsumpt rise simpl constraint ad justifi approach aim ad express power decid acknowledg work partli support esprit dwq italian space agenc refer foundat addison weslei publ massachussett queri data automata theori semant terminolog cycl ann math ai semant complet algorithm subsumpt classic descript logic artifici intellig research ad structur unstructur data finit model reason descript logic structur document queri facil acm de tbox abox reason express descript logic de uniform framework concept definit descript logic artifici intellig research complex existenti quantif concept languag artif intel autom tempor reason reactiv system logic structur versu volum lnc result proposit theor comp sci foundat logic program extend queri world wide web int digit librari fixpoint induct proof program properti machin volum edinburgh press queri semistructur heterogen inform characterist formula process diverg inform comput modal tempor logic process logic structur versu volum lnc automata theoret procedur proposit inform comput
Agents/1665 1 moral sentiment system ana bazzan john campbel depart comput scienc massachusett amherst ma usa depart comput scienc colleg london london uk abstract present simul societi agent agent belong social iter prison dilemma metaphor social interact phenomenon agent perform chanc perform long run world result suggest agent gener agent posit impact social group individu perform group perform inspir project discuss moral sentiment describ simul condit paramet determin dimens arrang account type composit societi lesson analysi result comparison experi relat work previou anthropolog approach adapt argu agent possess emot impact system impli common notion agent autonomi relat reexamin introduct concern problem adapt agent artifici cultur campbel problem system recent includ issu emot sentiment word interchang model ma discuss inspir idea moral sentiment argu emot miss factor agent displai social autonom agent necessarili selfish luck notion goal adopt social norm castelfranchi base emot stanc inform ma began work report initi result present campbel introduc emot aspect simul iter prison dilemma origin field game area concern ration mutual defect unlik situat prison dilemma ration verifi axelrod comput tournament tactic refer success due axelrod clear idea emploi field ma order explain achiev cooper coordin zlotkin work devot social agent emot reason failur theori base ration choic account social action choic claim cont castelfranchi game theori treat social agent goal process choic agent isol point view agent attempt modifi mental state oppon mark opposit game theorist widespread basi explain complex social interact human extend rule game relat issu social includ moral philosoph aspect peopl cooper peopl behav altruist pd simpli metaphor social intent game theorist territori idea moral sentiment inspir work present section describ section simul assess show result analysi section section discuss result light anthropolog approach agent adapt contrast widespread concept agent autonomi relat notion final section lesson present work mention extens moral prolif sourc idea recent public origin chapter entitl moral make reader notic import influenc work share view express polit implic drawn end text point moral sentiment compass plai fair prevent ration fool peopl fail effect action act earn short term chanc long run peopl reciproc proven selfish past moral sentiment lead ration fundament import social relat creat reput altruist peopl peopl lead kind person good pai futur interact comment role trust pd emot drive belong social group group concern welfar peopl social group moral sentiment dilemma maximum opportun cautiou futur instinct part highli social natur distinct scienc arriv complet sourc make stabl social relat stand advantag alter reward problem commit cooper bring present distant cost arisen ration calcul fact emot advantag cooper term pd isol selfish peopl avoid reciproc real life work emot social deter make cheat pain envi repres earn shame compass elicit reciproc compass love commit peopl perform altruist act ration pai long run refer true fall prei sentiment origin design natur obtain peopl conveni life prison dilemma remark admit light discuss paradox danger consequ wide accept theori term expect emot agent lead agent moral account type instinct note put dilemma trust coordin natur benefici effect calcul human comput agent direct consequ principl bound ma borrow mechan design natur select solv problem innat abil feel moral practic agent seek util function zlotkin miss good opportun order make point import altruist act anticip payoff time reward happen concept relat type invest trustworthi eventu consid ultim school necessarili sentiment refer earlier true ma research human fall prei sentiment end thing advantag long chanc problem agent endow emot show point present work result experi show type altruist behaviour benefit group agent consid main lesson drawn book commit break capabl live stabl social environ emot instinct ration support favour emot stanc point area profit social action enrich individu capabl mean revisit notion concept agent autonomi briefli issu section gener idea inspir concept simul describ discuss elabor chapter read materi complet account similar motiv idea discuss rizzo motiv explor context issu emot mind descript agent moral sentiment paper extend initi result campbel configur agent interact plai unlik experi report popul agent divid group design reflect characterist social investig point effect effect paramet popul percentag agent number altruist present group step simul characterist agent plai random agent decid plai tactic introduc point earn plai standard amount pd payoff individu collect point earn sort bank averag point earn number simul step determin wealth state influenc plai threshold agent state simul step medium threshold vari type societi detail explain differ repres effort put interact agent pai point plai experi individu altruist type agent defect interact plai oppon agent displai fair plai moral sentiment interact agent social group altruist word partner refer agent belong social group pair agent chosen randomli group plai round game ms strategi altruist agent mean cooper partner state oppon understand altruist strategi ms strategi close fact altruist behaviour drop agent note altruist defect defect harm altruist recov advantag partner state import ms oppon term necessarili partner agent altruist avoid exploit partner afford oppon altruist partner agent altruist perspect altruist wrong rememb fact belong social group emot usual agent mean rememb move oppon met past mean design defect learn past experi behaviour pai defect cooper capac rememb altruist memori past move influenc current oppon partner defect lead defect oppon determin factor wealth individu investig scenario combin specif valu paramet mention earlier design situat model characterist relat human report type societi long memori gener middl class societi fair share lm strong characterist histori agent perform past plai rememb classifi type state agent function perform fraction time set histori length hl step societi limit length histori gm aim check perform group agent state advantag ms strategi plai agent state role agent state middl role altruist societi afford practic state wealth societi ps design small proport agent consid belong middl class altruist partner borrow middl class fs wealth classif individu agent depend point earn agent group recent histori group threshold vari simul step constant identifi agent agent group calcul differ wealth group dw gr averag score agent group gr hl step differ wealth group dw gr class agent ms illustr type societi reader interpret easili text perform simul smaller valu introduc result detail studi effect hl comput agent state envisag plai altruist agent partner chosen interact dw gr agent plai ms differ recent earn agent group threshold calcul group simul step emploi factor reflect differ wealth agent group gr dw gr threshold current group defin gr gr tw type societi test agent run low point case oppon agent award point afford price plai step simul import characterist agent schedul plai agent point recov plai neg balanc account variabl percentag agent select plai time aim repres societi opportun agent select agent plai discrimin agent state plai case hope oppon partner plai ms strategi recov peculiar agent select plai pai point repres cost simul sp case agent plai twelv combin type societi simul combin group group form altruist mix variabl proport group group altruist mix group group case repeat variat individu run simul simul horizon step popul agent societi altogeth case verifi effect relev paramet draw ma quest human societi model design effici societi discuss section present result benefit main measur perform altruist perform group accumul point long happen perform poor begin whilst bad perform homogen distinguish type agent belong altruist level perform call subgroup altruist em subgroup homogen group call ah eh compar perform ah em subgroup examin time ah surpass em perform basic type show perform social group observ behaviour individu agent case number agent type depict behaviour eh type import comparison em present small number graph reduc quantit analysi due lack space provid lookup tabl tabl abbrevi introduc facilit read analysi result present section ab definit ab definit homogen group altruist ms moral sentiment strategi mix group lm long memori past earn count wealth homogen group gm gener middl class state plai ah altruist agent homogen group ps societi attenu middl altruist agent mix group fs fair share variabl wealth classif em agent mix group eh agent homogen group sp agent chosen plai tabl lookup tabl abbrevi time altruist overtak measur perform made snapshot simul amount point account differ size accumul group moment measur wealth societi measur number time ms strategi select effect wealth group perform altruist gener result figur perform social group type agent depict graph notat gn mean group agent configur condit paramet introduc present set confirm report campbel major lesson faster group collect point perform mean ration fool earn short term futur perform consequ reciproc charact group altruist accumul point long run time surpass matter percentag agent case valid time surpass fewer point collect percentag agent presenc harm member group long perform stop ration fool recent rang paramet type simul import observ made explicit ms strategi yield perform group mere reciproc account longterm success individu reason figur ad fourth line group graph averag perform make easier altruist note altruist plai ms perform averag figur remark messag understood term analog monei person case person reward situat mention section fall prei sentiment import mechan social bring great person reward normal circumst trustworthi circumst person reward interest group half agent perform agent half perform badli group exact averag improv social altruist citi graph reduc significantli perform graph impli perform import term joint reward earn plai altruist receiv plai similar effect find labour lead societi sum part lesson individu drawback driven emot group ration fool perform emot evolv speci pure individu earn long figur show effect ms strategi graph lm type ms graph fs ms manag threshold variabl interest effect graph group similar easili graph type agent lm societi em agent consist happen societi ms reason altruist exploit selfish partner ms strategi perform mix group higher pure reciproc similar curv good perform group size popul sp conclud larger number agent longer surpass surpass em case begin perform greater total ms true item true number agent fix distribut larger number group larger number agent point group matter number group involv effect number amount ms strategi coher type societi societi monoton relat ps simul step simul lm sp avg altruist simul step simul lm sp ah em eh altruist simul step simul fs sp avg altruist ms simul step simul fs sp ah em eh altruist ms fig effect ms strategi case ms time overtak em lower ms strategi slightli number point accumul discuss end pictur em subgroup mix group perform closer homogen subgroup respect group altruist surplu perform mix group conspicu item conclud effect ms strategi conspicu societi larg partner chanc interact compar sp conclud irrespect agent plai altruist outperform greater margin societi collect point explain fact agent plai small proport opportun exist instant rapidli simul agent ms altruist comparison type societi condit ms visual comparison graph gm fs show overtak em faster fs slightli greater accumul point due ms manag fs compar case defin variat number mix group paramet conclud number perform term accumul point end number item averag ratio type societi variat type ratio similar type total number agent base paramet consid length creat heurist agent decid group join seek attitud profit effect number mix group figur graph simul step simul gm sp ah em eh small percentag simul step simul gm sp ah em eh larg percentag fig effect percentag mix group horizon simul shown graph paper suffici ah perform em trend graph figur show happen case perform case ms perform count altruist cooper fact sake group welfar current drawback fact ms slightli amount accumul point comparison figur care mechan result lower total point group mutual cooper recal condit pd happen partner altruist plai import rememb mechan essenti altruist discern afford cooper partner discuss comment figur futur extens includ sort penalti societi current accumul point due agent partner artifici phenomenon human capit group greater amount monei earn interact engag note decid altruist cooper order prevent clear distinguish altruist partner chang rule pd agent inform oppon strategi artifici distinguish strategi result show long group altruist agent accumul point altruist ration present possibl gain make futur group perform individu failur avoid reciproc pai long run improv perform restrain produc result altruist concern perform improv group verifi homogen group perform short term selfish game agent societi found suffer earn point pai plai step complet mix group intermedi exhibit effect group altruist presenc altruist assur rel develop group agent benevol part anthropolog approach system campbel concern agent emot sentiment agreement emot avoid aspect agenc ma anthropolog draw lesson social thing present cultur spectrum human motiv avoid common cultur agent agent support agent adapt studi present target societi cultur random collect arbitrari habit express instinct superfici differ languag foreign cultur immedi deeper level emot social view emot stanc present ma consid role point work emot relev agent make al bate van gent evid result shown behav altruist prison dilemma ration prevent agent ration secur good perform long run agent extrem case social social group complet notion group lead question current widespread idea ma autonom agent necessarili selfish ma caught viru tradit work util approach genesereth rosenschein zlotkin agent definit repres outlook ma dinverno luck cooper occur parti consid advantag parti autonom agent selfish agent goal view adopt satisfi motiv effect benevol motiv term histori line thought start discuss social power paper direct benevol grant time reloc import phenomenon evolv societi autonom intellig agent explor agent emot issu interest concern agent autonomi cognit view field castelfranchi misconcept autonomi benevol absenc explicit emot compon present ma theori motiv necessarili idea termin interest adopt defin cont castelfranchi mention possibl autonom agent adopt interest concentr emot aspect agent book usual mean agent act adopt goal individu goal benevol agent state benevol agent undertak mode goal adopt call claim type adopt common earli dai ma assum agent adopt agent fulli perfect ground dinverno luck definit context point agent autonom pursu individu goal motiv ultim selfish problem artifici mechan model benevol individu goal due lack process recal import consequ emot stanc abil exploit societ interact discuss role emot human social natur emot process balanc ration process process autonom agent round agent autonomi necessarili concern fulfil agent selfish freedom behav resourc depend mean influenc emot requir specif part agent architectur deal observ result simul prevent agent ration fool put altruist interest futur reward give emot import mechan complex brand social interact human experi worth recov notion benefit ma main advantag simul present verifi yield insight issu discuss note whilst quantit result simul present appli ma metaphor assumpt made exist make line present section appli highlevel argument support suggest design gener ma architectur emot aspect tradit ration gener architectur sort agent specif relat refer area assert paper aim specif implement emot agent architectur attempt gener agent architectur sloman poli poli sim agent architectur believ mention idea moral sentiment relat close paper volum emot agent undoubtedli relat issu format norm autonom agent dignum easi emot import attach agent social mention emot import mechan design societi maintain collect contrari plausibl emot basi autonom agent autonom behav altruist argu studi emot agent architectur understand autonom agent form essenti social behaviour interest issu address research similar motiv dignum found reli sociolog econom approach defin call structur coordin mechan social structur autonom agent behaviour econom approach determin outcom process social coordin main point appar social action individu societi reflect societi social structur behaviour respect social structur constrain individu choic prescrib behaviour ensur condit surviv societi case dignum concern social action agent connect notion emot moral sentiment recent de falcon import emot domain usual support argument comment reason agent person includ natur societi agent person import construct aim model person agent emot cognit reproduc relev featur human interact sourc guidanc work ma origin defin field distribut artifici intellig concern coordin intellig behaviour collect autonom intellig agent build agent ration inspir human counterpart fail provid import human mechan find built ration collabor ration fool human societi analogu undesir consequ individu result suggest strongli ration fool earn short term perform long altruist perform begin end result show altruist group individu point impli group perform significantli pure reciproc conclud behav ration classic game attitud long run group concern present ma yield societ surplu resembl notion societi sum emot stanc amalgam present relat present work anthropolog approach remark consequenti view notion agent autonomi relat deserv reevalu test variat extens simul comment futur paper mention earlier strategi attempt join group earn mention section futur extens account burden agent social current accumul point ms strategi plan investig robust strategi type simul fit agent learn reinforc behaviour regain trustworthi societi plan introduc mechan agent discov charact eventu freedom partner futur social argu case human acknowledg acknowledg valuabl comment anonym review paper relat gratefulli acknowledg cape govern agenc postgradu grant phd colleg london refer emot commit foundat control structur system van de seventh workshop model autonom agent world number lectur note artifici springerverlag evolut cooper basic book role emot believ agent commun acm agent moral sentiment iter prison dilemma aaai fall symposium social intellig menlo aaai press aaai press technic report review axelrod complex model competit journal artifici societi social simul anthropolog approach agent adapt intern workshop decentr intellig system dom ascript ontolog anthropolog descript system intern workshop cooper inform agent volum lectur note artifici contribut anthropolog approach cultur adapt agent phd london cheat potenti solut prison dilemma de social attitud person agent aaai fall symposium social intellig agent social point miss dai hci decentr ai european workshop model autonom agent world elsevi scienc bv riski robust social attitud system perform intern confer system menlo aaai press cognit social action ucl press autonom intellig agent intern workshop agent languag lectur note artifici intellig springerverlag volum selfish gene oxford edit understand autonom interact european confer artifici intellig simul collect journal artifici societi social simul social agent artifici societi intern confer system agent ieee comput societi press extend abstract invit talk distribut coordin task intellig agent scandinavian confer artifici intellig van multiag collabor direct intern confer system san menlo aaai press mit press agent thing intellig agent intern workshop agent languag lectur note artifici intellig volum social structur artifici agent implic autonom agent intellig agent intern workshop agent languag lectur note artifici intellig volum origin virtu press social behavior believ agent aaai fall symposium social intellig agent deal ration agent ninth intern joint confer artifici intellig lo aaai press morgan kaufmann rule encount mit press mechan social select success scienc sim toolkit explor agent design intellig agent ii intern workshop agent languag held part august number lectur note artifici
Agents/1666 1 process algebra formal mobil agent data integr case studi xavier paolo dip di automatica informatica politecnico di torino degli itali abstract paper show cryptograph protocol mobil agent data integr properti formal spi extens calculu cryptograph properti mean case shown specif techniqu initi conceiv classic cryptograph protocol context mobil agent case studi includ spi calculu specif sampl mobil agent data integr protocol secur properti introduct softwar architectur base mobil agent develop distribut comput system gain attent exhibit advantag tradit paradigm applic make mobil agent wide paradigm distribut manag secur problem adopt problem gener fall main categori protect host malici agent hand protect agent malici host network intrud kind problem studi moment partial solut solut adopt ensur secur properti distribut system base kind cryptograph protocol basic cryptograph oper encrypt digit signatur appar protocol reveal error difficulti gener found attack behavior parallel protocol session lot attent paid formal method develop protocol analyz vulner exist protocol method successfulli emploi formal verifi secur properti classic authent appli analyz secur system worth note specif verif secur issu relat mobil agent system involv aspect encount classic cryptograph protocol addit classic relat alter messag model fact correct behavior agent agent execut untrust host mean behavior agent potenti unpredict time visit untrust host paper address aspect explor possibl appli exist formal specif techniqu cryptograph mechan specif design protect agent emphasi agent data typic properti interest sampl protocol mobil agent data integr mobil agent program migrat network host execut mobil agent execut agent interpret run host commun messag pass agent migrat host host consist static typic includ agent code static dynam includ agent element chang time show model process algebra simpl protocol aim integr data gather mobil agent run possibl untrust host agent host simpli pick piec data agent shop agent dispatch visit compani find price sell select cheapest compani data integr agent mean host tamper data collect detect classic problem protocol specif protocol corradi al idea agent carri cryptograph proof data gather proof prevent host tamper data collect detect descript protocol notat cryptograph hash function invert deduc ü spi calculu privat public part kei host à denot à encrypt data ü privat kei host à denot notat mic stand integr cryptograph proof increment success applic agent list collect data host data collect decid agent host visit host order visit à ò host data collect initi initi creat send end receiv collect data host ò piec data collect agent collect data mic agent left success valu cryptograph counter denot cid code agent sign trust parti authent carri host host agent agent move host host repres messag inform protocol descript à gener secret number creat agent pass agent encrypt à access à move à carri encrypt à collect data list initi mic empti host à agent reach à à decrypt à obtain collect comput increment cryptograph counter comput hop agent encrypt move host carri collect data cryptograph proof cryptograph counter encrypt public host à decrypt agent collect append collect data comput comput proof increment cryptograph counter agent encrypt à move back à carri data comput checksum à à receiv agent à valu à comput check receiv agent differ agent data consid invalid integr collect data host modifi collect basic retriev à modifi reconstruct valid mic note solut work agent visit host collect data malici host cooper advantag method intermedi host read data gather model mobil agent system formal model cryptograph protocol typic set princip send messag protocol repres activ attack intrud perform kind overhear transmit learn intercept messag send messag creat item nonc intrud fake messag session model meant reveal secur flaw protocol flaw cryptographi model abstract assum mean decrypt encrypt messag encrypt messag reveal kei encrypt suffici redund messag decrypt algorithm detect ciphertext encrypt expect kei assumpt complet true real repres properti ideal isol flaw protocol flaw found model real protocol model reveal weak due order model mobil agent techniqu similar base assumpt perfect cryptographi intrud agent model autonom mobil system repres lower level closer real system princip repres host agent execut execut mobil agent code migrat agent host host repres exchang princip repres involv agent code data integr static agent code static agent data problem share mobil solv ma independ function agent interest valid part assum problem solv reliabl model code transmiss simpli assum trust host execut code agent hop repres messag dynam part agent data model sampl protocol messag collect data mic valu main aspect mobil agent cryptograph protocol respect classic authent protocol possibl attack due network intrud untrust host alter behavior agent host execut platform unpredict model agent messag exchang host issu account assum singl untrust host attack due account model give intrud possibl total replac obtain give intrud secret coincid à privat kei privat kei à intrud total replac intercept messag direct à decrypt forg messag à ù produc intrud incorpor behavior network intrud untrust host model kind malici behavior à includ modif execut mobil agent à case agent host approach easili extend model environ untrust insert privat kei initi intrud knowledg correspond model untrust host cooper intrud process kei untrust host replac total knowledg model untrust host cooper adequ applic solut found case model untrust host unabl cooper case difficult model model approach explain specifi control intrud thing intrud initi knowledg model cooper untrust host special host analyz find attack includ requir untrust host cooper problem analyz attack report analysi tool filter involv cooper untrust host concern specif data integr express authent properti classic authent protocol requir data consid valid site deliv expect authent properti spi calculu model sampl protocol introduct spi extens add cryptograph primit hash privat public kei encrypt order process address mobil explicitli syntax semant found give overview construct paper system set concurr commun process basic comput step synchron mechan term å commun output process input process channel ñ term basic data variabl pair æ ä turn term output process ñ å readi output å channel ñ interact term å commun ñ process è run input process ñ ü readi input channel ñ interact occur term å commun process oper liter substitut variabl ü term å composit è behav process è é run parallel interact channel world independ restrict è process make privat ò behav è oper data intrud pair split process ý è term å pair process stuck kind term introduc repres cryptograph oper term à encrypt term å public kei denot à term form decrypt privat kei à process ý è behav è ý à stuck descript spi calculu introduc test kind observ express secur properti process è readi synchron immedi channel è exhibit write è exhibit immedi intern write è test pair ê test process test pass process è è test formal defin è é è ú é é ú è agent trust host initi host untrust host figur model instanc corradi protocol preorder ú defin è ú é è è ú é iff test pass è pass é process test iff pass indistinguish test sampl protocol model section show model spi instanc protocol section deal fairli small instanc protocol instanc agent initi à visit identifi à à back à data gather agent à à host à à à express integr properti assert data collect à modifi agent pass à extend model incorpor arbitrari number visit host multipl session agent initi agent move à à channel à cryptograph counter data movement agent à à simpli model à send encrypt à à à pass agent à channel à time agent data mic cryptograph counter complet descript behavior à à à ý ý à à à encrypt cryptograph counter receiv à variabl à ý decrypt à privat kei obtain ý à agent build mic compon à receiv agent execut agent code section à send agent back à channel à à à ü ý à à à à receiv check correspond initi secret collect data complet descript à à à à à ü ü ý à ü à ü notat ò ü denot function appli ò time ü note comput à send channel à step ad test protocol test section protocol instanc è à à à à untrust host secur properti interest agent tamper à network intrud detect write specif à à à à à à ü ü ý à ü à protocol à à reader equat differ equat line process à process readi output à incom agent pass valid test prove specif test model prove protocol ensur integr agent data à receiv tamper specif model output valu channel à test formal express integr agent è equat integr specif addit properti equat paper explor formal specif origin develop model secur properti cryptograph appli model integr properti mobil agent mobil agent system model mean messag exchang host similar authent protocol host model simpli make secret intrud clear formal specif import unambigu describ mobil agent secur mechan properti express content exchang aspect relev secur properti includ check messag receiv formal specif kind valid practic basi correct implement refer abadi gordon calculu cryptograph spi calculu research report digit equip corpor system research jan shorten version report inform comput stefanelli mobil agent integr applic ieee intern confer distribut comput system workshop page june ieee comput societi press swarup secur mobil issu requir nation inform system secur page octob protect comput result agent rothermel intern workshop mobil volum lectur note comput page walker calculu mobil process part ii inform tschudin mobil agent secur intellig inform ration adapt inform gather lectur note comput page vigna cryptograph trace mobil agent mobil agent lectur note comput scienc page okamoto secur inform gather agent internet trade zhang australian workshop distribut artifici intellig system applic volum page juli springer yee mobil agent technic report uc san depart comput scienc apr
HCI/1667 4 present ieee intern conf multimedia comput june interact map digit video librari michael christel cs dept hci institut carnegi mellon pa usa abstract informedia digit video librari hour video automat descriptor deriv video improv librari access extens video process extract geograph refer descriptor oper librari interfac show geograph entiti address highlight region discuss point video map displai synchron video playback map queri user search terabyt librari stori place select area interest introduct informedia project carnegi mellon investig util speech imag natur languag process techniqu improv search discoveri video medium project video cnn video british open qed discoveri numer unit state govern agenc nation park servic survei result digit video librari hour continu grow rate hour week sheer volum video data reveal issu interfac digit video librari futur good queri engin suffici candid result set grow number librari grow interfac librari defin librari subset result queri increasingli import andrea comput scienc depart carnegi mellon pa usa user interest quickli find set video stori segment relev librari order hundr statist word queri engin adequ provid focu user enter text small set segment return sort queri relev score altern video view time present aid user decid segment worth full view style librari interfac shown figur figur informedia interfac imag repres video text headlin segment librari grew thousand queri return hundr overwhelm user web search engin return list length default order longer meet user inform visual interfac develop user result space resort frustrat list result emploi visual techniqu user retriev video informedia librari base date word occurr realiz potenti rich vein inform overlook documentari stori deal locat inform inform dimens present overview video summar multipl video queri mechan find segment deal region interest remaind paper discuss interact map informedia digit video librari extract video geograph refer transcript narr greatest sourc geograph refer inform video informedia librari carnegi mellon sphinx speech recognit engin transcrib content video word error rate proport amount process time devot task text exist integr output recogn final text transcript synchron word level video sphinx process narr mention snow switzerland video time mention captur process transcript primari sourc geograph sole sourc locat overlaid informedia video ocr process identifi video frame probabl text part horizont differenti filter binari threshold filter probabl text region multipl video frame improv qualiti imag input ocr process commerci ocr softwar convert final filter imag symbol text text potenti sourc geograph refer video segment discuss activ includ shot overlaid text state transcript text video time sphinx speech text video time imag process identifi frame probabl text region descriptor informedia librari includ product automat topic user annot user type speak comment pertain portion video addit sourc text includ locat user comment lo angel compress audio video sphinx text video natur languag context adjust term match time duplic elimin gazett citi geograph term remov common term locat metadata video figur ad locat inform video figur show process ad geograph refer video segment match spatial coordin video begin text metadata sourc materi process set place spatial chosen resolv geograph refer gazett informedia librari deriv subset data world gazett system research institut consist approxim administr entiti major citi worldwid postprocess step ad expand gazett includ relat identifi countri remov common term subsequ citi text associ text video match term geograph map geograph text term latitud longitud end result tag video sequenc latitud longitud address fix field address compon street street research document extract place text video transcript idea complic address address tend place call main st provid consist simpli match set address coordin priori portion transcript refer place text metadata extract candid portion sentenc repres place simpli elimin word commonli examin remaind text dot item figur portion process greatli improv addit includ step part phrase text contextu inform resolv phrase resolv locat inform context term match proper noun refer western state unit capit contextu cue time georg distinguish mean contextu analysi sourc system classifi proper noun accur assign locat inform hidden markov model achiev level analysi hmm proven effect automat tag includ text output speech text lack punctuat cue explor hmm dot task figur expect hmm approach deliv accur geograph referenc current quick process baselin context remov common ambigu term gazett match enforc strict term match studi determin accuraci benefit addit process enabl geograph refer unit inform retriev informedia librari video segment strategi work singl stori hour broadcast consist segment list construct process consist place mention segment place repres list number refer includ entri place enabl subsequ interfac locat visual base frequent place mention process establish relationship video place video time place referenc interv time interv quickli access place identifi transcript sentenc sentenc place mention track place mention begin end millisecond begin sentenc mention time interv place place mention time span start sentenc place refer end sentenc mention place time transcript word video access informedia sphinx speech recognit process place identifi text metadata start end time text metadata time span approxim durat overlaid text video place occur multipl time time span extend start time mention end time final mention video segment result list written convert shape file format capabl gazett shape file index geograph order optim spatial search tabl show entri attribut output algorithm tabl entri row column result text type admin countri start time end time eastern india india citi china china south korea korea japan japan north korea korea brussel citi belgium map video segment figur show inform incorpor informedia interfac video segment plai option window pop map displai place discuss segment function provid librari creat written microsoft visual basic glanc overview show segment cover countri india citi user interact map toolbar left support oper zoom reveal detail area zoom show area detail pan area resolut select area search return full map extent show countri world spatial icon underli oper suppli directli librari integr function digit video librari user access detail relev video content video segment figur point cnn footag show illustr produc cnn video recogn import geograph detail detail automat extract displai process figur gener map function provid user interact figur user check box enabl text displai base movement map figur map overview locat refer video segment window result map displai similar produc cnn shot real map interfac displai locat inform video segment produc ad map video data stori map part map automat produc reflect area discuss stori benefit user interact interfac map toolbar icon addit interact imag map encod part video stream user zoom area figur map displai detail port citi map accompani video static displai anim synchron video playback place highlight map countri administr area state area respect polygon boundari highlight chang color shade area cover time video segment color video frame area discuss area color orang citi marker color chang blue red label shown glanc map show area current figur show stori current focu north korea south korea russia mention stori highlight time show stori flow video segment classic research area studi accur effect displai data anim map begin address depend number featur import avoid map show difficult read limit text label citi administr area time discuss accompani video countri label displai figur video point label red portion video plai segment longer activ refer time store tabl marker locat remain color text strategi video segment citi refer broad area label refer drawn overlap amount inform displai video segment plan user chang default set map displai futur set includ type entiti mark citi figur anim map highlight video plai scroll transcript symbol label color style mark overview figur highlight video time figur default set depend type video shown broadcast mention major citi countri serv current default set corpu video european soccer leagu citi label displai default access video spatial queri map informedia interfac present locat queri arrow icon toolbar map window drag rectangular region map serv identifi region interest figur user select region encompass function provid librari perform queri video geograph refer informedia librari produc locat row form shown tabl search result displai headlin repres thumbnail result word queri displai shown figur feedback provid map locat queri produc result figur feedback shown white circl indic countri found result set video segment headlin sixth result show stori roller video subsequ map chang imag figur belgium initi color show mention stori color chang video frame discuss figur origin spatial queri shown figur user search time word mark match word locat video match locat vertic line drawn video scroll bar shown beneath video playback area video segment found spatial match locat report numer match place found rectangular queri place video time time draw match line figur match line video scroll bar correspond time north south korea mention place region interest defin queri shown figur addit user quickli seek video locat interest discuss figur map request video segment deal locat figur spatial queri produc video segment figur result queri region shape rectangl recogn support power spatial queri mechan user click number bound polygon select number countri region match polit geograph refer area includ return set video segment extens rectangular search search map inform countri provid featur geograph inform system includ librari hidden assumpt user expect drawn area request locat drawn area area request user expect relationship relationship work alexandria digit librari address ambigu formul spatial queri hold great digit video librari futur work dot box figur show area ripe work natur languag process hmm accur extract place candid text expand place resolv expand set match interfac improv exposur greater gi leverag lesson learn digit librari project map inform size prototyp empir test effect commun inform video librari informedia digit video librari interfac support word imag queri spatial queri map interest area work enabl mix modal find video segment mention area find face face countri present inform improv util inform dimens dimens locat result word queri visual reveal interest pattern search volcano show stori concentr ring pacif ocean empow user manipul metadata video pattern reveal search terror bomb show hot spot activ geograph area earli hot spot area late geograph informedia interfac serv user quest search discoveri video medium acknowledg paper base work support darpa contract support informedia partner team member complet list found inform effort refer hd mg ag learn creation terabyt digit video ieee comput pp mg db cr abstract digit video proc acm confer digit pp mg christel dj visual digit video intellig info system pp ocr digit proc workshop access imag video lo pp spatial analysi crime base weight spatial adapt filter chaotic cellular forecast applic street level drug phd carnegi mellon pittsburgh system research home entiti extract proc darpa workshop broadcast understand februari model digit librari proc ieee metadata septemb tr rb bs digit librari geograph referenc ieee comput pp
DB/1668 3 increment mainten materi view semistructur data serg abiteboul jason mchugh michael ry vassalo janet wiener le franc stanford ca usa abstract semistructur data strictli type relat data irregular incomplet heterogen data sourc integr data world wide web view semistructur data filter data restructur provid structur achiev fast queri view materi paper increment mainten algorithm materi view semistructur data data model oem queri languag develop framework work algorithm produc set queri comput updat view base updat sourc develop analyt cost model compar cost execut increment mainten algorithm recomput view show type effici appli increment mainten algorithm view recomput view thousand updat introduct view flexibl system adapt data user applic view frequent materi speed queri underli data remot time critic view content maintain order preserv consist base data mainten perform recomput view content research partial support nsf grant air forc contract swiss nation scienc foundat permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow vldb confer ing increment updat view base updat studi mainten materi view semistructur data simpl view specif mechan algorithm increment mainten demonstr algorithm strength mainten cost analysi unlik relat semistructur data conform fix schema data irregular heterogen data sourc integr data extract world wide web view semistructur data filter data restructur provid structur filter crucial semistructur data encount applic interest small portion data specif data view restructur semistructur data control perform view semistructur data materi queri semistructur data long mike carei argu recent materi view isol data subsequ queri run data set materi view rewrit queri base data improv queri perform queri materi view advantag standard queri optim techniqu access method structur underli base data view semistructur view mechan algorithm materi view mainten studi extens context relat model increment mainten shown dramat improv perform relat view view richer object world languag queri materi view significantli intric previou result increment view mainten guid restaur restaur rate rate ingredi ingredi restaur ingredi rate ingredi figur simpl oem object nest data base extens type inform semistructur data type techniqu appli subobject share absenc schema make difficult detect updat affect view colleagu view mainten scheme limit linear oql view definit subobject nontrivi semistructur view definit make approach context suciu consid increment view mainten semistructur data view specif languag limit queri consid insert approach join view queri handl updat zhuge investig graph structur view increment mainten view consist object collect includ edg object mainten algorithm work view approach handl join arbitrari work base object exchang model semistructur data label graph oem strong similar xml standard format data web view specif languag base lorel queri languag oem view specif extens lorel introduc set object part specifi primari object import view part specifi path primari object adjunct object path adjunct object view distinct set object user simplifi discuss increment mainten algorithm view algorithm produc set mainten evalu yield set view instal updat view demonstr advantag algorithm cost model perform evalu compar cost recomput cost increment comput view result show increment mainten algorithm order magnitud faster recomput view insert delet edg object increment mainten cheaper small number atom substanti portion cost effect recomput view present mainten algorithm mainten defer mainten view techniqu present applic queri languag semistructur data web queri languag hypertext document view specif lore system investig materi view mainten semistructur data introduc data model lorel queri view specif updat oper provid detail lorel view specif oem data model oem direct graph small figur vertex graph repres object uniqu object identifi atom object atom audio object complex object lore set pair figur object atom object complex special label serv alia singl entri point figur guid denot object notion schema oem semant inform includ part data chang dynam oem oem design handl incomplet structur type heterogen exhibit figur observ restaur object restaur lorel queri languag lore familiar syntax consid extens oql power path express data extens coercion rule forgiv type system featur oper semistructur environ lorel queri select queri subobject restaur object restaur ingredi result queri figur set express path express describ path express path form bound set label outgo design set object reach start object set edg label path describ singl step data written yi lorel support wai path combin path elimin wild path clariti path express quantifi implicitli existenti quantifi lorel semant view specif lorel view specif statement lorel import object edg sourc view object edg creat view view specif languag identifi object import arbitrari add remov object view lorel queri updat oper extend statement path express path begin variabl select object edg path includ view statement return flat set object import structur view return reachabl select object call object includ view part view specif primari object object includ view adjunct object object primari adjunct object view view definit consist view specif concentr view defin singl statement view specif defin view result queri written syntax ingredi subobject view defin view select exist exist object bound primari subobject discov adjunct object view simpl collect object satisfi edg subobject present materi view explain view materi simpl queri evalu strategi evalu obtain bind variabl satisfi select evalu bind primari object identifi select augment subobject edg import object repres deleg object figur show materi view appli figur object figur provid bind sole primari object adjunct object deleg object view ingredi figur materi view updat oper lorel updat statement elementari updat oper affect materi ffl insert delet edg label object oid object oid denot ffl chang atom object oid denot view mainten updat oper affect materi view maintain consist view consid consist db evalu view specif yield view instanc db updat db updat view order preserv consist increment mainten algorithm comput state materi view current state updat similar relat view mainten increment mainten algorithm updat minim portion examin comput view updat algorithm appli import subset lorel handl view specif statement wild negat atom simplifi exampl select form select overview mainten algorithm treat primari adjunct object prim adj separ mainten algorithm input shown figur view specif updat state db updat comput view mainten statement lorel syntax statement gener set extend lorel explicit object identifi statement view specif statement select vk vn variabl sequenc jk jk jq jq updat ali state db view instanc figur increment mainten algorithm input add prim del prim add adj del adj object edg add remov view figur abbrevi vn condit written disjunct normal form boolean sql check relev updat view instanc defin view specif gener set relev variabl stop gener mainten statement creat gener mainten statement creat instal figur basic structur increment mainten algorithm figur outlin step view mainten algorithm describ algorithm oper singl updat check updat relev updat chang view instanc algorithm creat lorel statement gener add prim del prim statement identifi primari object add remov explicitli bind object updat view specif algorithm creat set mainten statement gener add adj del adj add adj del adj adjunct object edg add remov variabl adjunct object affect newli insert delet primari current adjunct object sourc insert delet atom relev updat avoid gener unnecessari mainten perform function view specif updat object relev return find variabl relev updat var foreach updat object relev vi var updat atom simpl syntact check foreach var constant compar foreach predic view spec chang return figur return view specif variabl updat relev ple relev check auxiliari data inform schema structur object identifi object touch evalu view pair variabl object eventu view check quickli updat possibl affect view object updat examin view evalu updat syntact check specif atom affect view comparison view specif involv constant compar constant updat satisfi chang affect view figur present function determin set variabl queri updat bound view specif object figur chang infer updat affect view view specif mention chang constant comparison updat relev attempt quantifi save achiev paper note view defin small portion updat irrelev gener mainten statement describ gener mainten statement type edg edg atom chang edg insert edg delet case path view gener mainten statement check updat edg bind statement produc updat view auxiliari data structur repres path view specif prim adj path prim view specif yg note set small depend queri edg insert edg updat gener primari object mainten statement pair bind procedur figur add prim updat perform figur cafe restaur ingredi view return set feg gener statement add prim select exist exist mainten statement evalu effici origin view show section gener mainten statement adjunct object case adjunct object attach primari object add prim adjunct object newli connect view insert edg adjunct gener mainten statement start set add prim test insert edg match relev variabl match label gener set mainten procedur view specif relev variabl foreach place updat substitut view specif foreach write mainten statement base view specif copi replac replac replac add disjunct add disjunct figur gener add prim mainten statement procedur view specif primari object add adjunct object path foreach hw jk jk write mainten statement base view specif add jk adj select hw jk jk jk jk place edg adjunct edg foreach foreach jk write set mainten statement start ad add insert edg view add jk adj select add edg add adj select similar includ path foreach hw add adj select hw figur gener add adj mainten statement statement add insert edg subsequ path adj case handl procedur figur add adj gener mainten statement updat add adj select add prim add adj select add prim insert edg connect exist adjunct object adjunct object statement gener half addit edg absenc negat gener del prim del adj edg delet updat delet edg irrelev affect primari object directli view remov addit adjunct edg remov view delet edg updat gener mainten statement similar insert edg updat delet edg statement simul exist delet edg view determin origin contribut object edg view delet edg statement check potenti delet object edg remain view due path involv delet edg object figur appli updat remov object view figur show procedur gener mainten statement primari object procedur view specif relev variabl foreach place updat substitut view spec foreach write mainten statement base view copi replac reconstruct state replac replac remain replac handl normal bound variabl replac replac replac replac add disjunct add disjunct duplic test subqueri ensur object bound view reason add exist variabl addit select variabl figur gener mainten statement del prim origin increment statement gener rule st chang fo st figur transform increment mainten statement del prim updat appli figur object remov view gener statement del prim select exist exist exist select exist exist statement add bind view specif reconstruct delet edg bind transform origin queri summar tabl shown figur gener mainten statement adjunct object edg object primari adjunct object edg includ view due multipl path reachabl delet edg suffici condit delet adjunct object explain subqueri variabl bind edg remov bind edg delet due space omit procedur del adj updat procedur creat mainten statement path adj del adj select del prim del adj select del prim statement simpl includ complex atom chang updat chang insert updat chang irrelev view due object object incom edg label origin edg find object possibl relev edg bind chang object variabl identifi procedur separ mainten statement variabl singl mainten statement handl case atom chang addit object view treat similarli edg insert edg edg atom object view evalu delet case similar note optim execut mainten statement track chang potenti addit versu remov object due space constraint omit procedur atom includ illustr updat identifi relev variabl atom chang result ad object materi satisfi condit bound condit true object longer view gener del prim delet label del prim select exist exist exist select exist exist base del prim del adj del adj calcul shown instal mainten repres add prim add adj del prim del adj instal materi view duplic object delet instal view insert view object primari remain view adjunct object vice versa updat atom chang object instal deleg object add prim add adj del prim del adj instal process indic identifi object edg view cost model present analyt model evalu cost view recomput increment mainten updat detail cost model similar approach system present present complex cost model lore cost model queri optim set recomput increment maintain view figur path express evalu statist ab bc cost assign plan estim number object fetch queri process complex cost model object orient reli heavili object cluster system absenc count number object accur determin advanc object page cost formula reli queri execut section strategi result data start object queri execut strategi semistructur investig quantiti part statist system ffl estim averag number children label descend object set object bound variabl variabl bound path express figur object set singl child set refer set object bound ffl estim number object set figur jcj ffl estim number object fetch order subobject edg label origin object result object set cost comput jxj path express bc figur evalu cost bc jbj jaj object cost evalu path express increment mainten statement bind variabl object updat bind prune search space execut proce variabl bound updat encount object bound updat evalu short circuit bind bound variabl lower cost comput rest path express limit remain portion path object reachabl bound variabl insert delet provid object atom chang cost model formula ignor object reduc actual cost appli cost formula view specif full cost recomput view show cost formula appli mainten statement updat cost insert set path express mainten statement prim prim set path express mainten statement bind provid prim prim prim prim depend number bind select prim jej evalu evalu program accept singl view specif singl comput cost recomput increment mainten cost model present cost varieti view updat auxiliari structur cost actual cost increment mainten lower case cost shown axi logarithm scale base cost updat oper recomput insert edg delet edg atom chang updat oper mainten cost figur base cost updat oper shown figur cost updat oper view specif test averag ingredi portion comput maintain view irrelev assum fix select bar show cost maintain view singl updat updat oper recomput time increment mainten insert delet edg oper save due bind variabl insert delet edg smaller portion execut increment view mainten statement compar view specif statement maintain view edg insert significantli cheaper edg delet delet edg mainten statement requir subqueri mainten cost atom chang vari wildli procedur increment algorithm gener mainten statement condit statement incorpor variabl bind chang bind depend bind mainten statement cost vari slightli cheaper cost recomput recomput cost effect view test singl atom chang condit cost shown figur relev test determin condit relev evalu mainten statement condit cheaper recomput bound variabl posit updat oper recomput delet delet delet delet delet delet delet figur vari posit bound variabl posit bound variabl affect cost increment mainten view specif chain path defin view vf select al singl object subobject averag subobject ten subobject delet edg ho valu turn figur show recomput time increment mainten bound variabl middl path effect divid path shorter comput total cost shorter path ad multipli section variabl bind provid newli insert delet edg benefici effect occur middl path express length number variabl affect cost increment mainten length path express mainten cost recomput insert edg delet edg figur vari length view specif pattern vari length path express path defin view vf select al section view insert edg ho bound middl variabl path figur show number variabl recomput cost addit edg relev portion factor ten increment mainten cost lower slowli due bound variabl insert edg cost bound variabl advantag posit path express size number object mainten cost recomput insert edg insert edg insert edg ingredi figur vari size fourth view specif section vari size relev portion number restaur averag number ingredi number restaur size relev portion doubl mainten cost edg insert shown figur cost recomput consist time higher cost increment maintain view size neglig effect insert insert edg provid bind specif restaur insert ingredi placement bound variabl execut cost mainten statement grew linearli size remain order magnitud lower cost recomput recomput cost grew linearli size relev portion entir relev portion select select mainten cost recomput increment insert edg ingredi figur vari select figur show result experi view definit structur section vari select select object includ recomput cost reflect rise cost locat ad adjunct object increment mainten cost atom influenc significantli select select atom screen syntact relev test run queri select object includ object ad view chang syntact relev test appli atom affect mainten cost edg insert chang base atom valu select note select fix shown figur heavili disadvantag increment mainten algorithm number label occurr final vari number time label insert delet edg match label view specif view specif statement defin view vl select al xl exist exist xl recomput number occur label figur vari number occurr label view specif insert delet edg ho chang label view specif label sourc legend shown figur subobject object distinct label recomput cost unaffect specif structur remain increment mainten cost label requir addit mainten statement label time view increment mainten time cheaper recomput approach increment view mainten reli schema gener mainten statement increment mainten algorithm view data algorithm comput view base inform view updat state auxiliari data structur gener popul view evalu result show increment mainten algorithm outperform recomput larg number insert delet edg updat increment mainten full recomput view singl atom due simpl queri execut strategi assum cost model evalu show algorithm scale size implement view materi lore plan implement increment mainten algorithm optim increment mainten algorithm plan extend algorithm handl set updat data tree mainten statement elimin subqueri delet object edg incorpor queri rewrit queri optim techniqu semistructur data provid queri tion choic queri optim infer schemat inform dataguid graph schema optim view mainten zhuge organ group discuss eventu led paper jennif widom rest lore team stanford interest discuss comment refer abiteboul queri semistructur data proc page abiteboul bonner object view proc page zhuge view semistructur data workshop manag semistructur page wiener increment mainten materi view semistructur data technic stanford wiener lorel queri languag semistructur data journal digit jan beeri logic queri languag hypertext system proc page bertino view mechan proc page bertino model cost function ieee effici updat materi view proc page buneman semistructur data proc page suciu ad structur unstructur data proc page suciu program construct unstructur data proc carei panel semistructur data workshop manag semistructur al object morgan scholl structur document queri facil proc page moerkott evalu queri gener path proc page algorithm defer view mainten proc page fernandez suciu optim regular path express graph schema proc tang cost model cluster proc page scholl increment updat materi oql view proc page goldman widom enabl queri formul optim semistructur proc page griffin libkin view duplic proc page gupta mumick mainten materi applic bulletin june subrahmanian maintain view increment proc page hanson perform analysi view strategi proc page ross implement increment view mainten nest data model proc konopnicki shmueli queri system world wide web proc page snapshot differenti refresh algorithm proc page widom manag system semistructur data sigmod sept mchugh widom queri optim semistructur data technic stanford milo queri world wide web proc page microsoft corpor extens markup languag chawath repres semistructur hierarch data proc page ullman mediat system base declar specif proc page widom object exchang heterogen inform sourc proc page papakonstantin vassalo queri rewrit semistructur view technic stanford ramakrishnan manag system papakonstantin maryland adm view bulletin june rundenstein methodolog support multipl view proc page aug schek parallel map object model relat system proc page updat view proc page delobel virtual schema base proc page suciu queri decomposit view mainten queri languag unstructur data proc page ullman widom system prentic zhuge graph structur view increment mainten proc
DB/1669 3 plan theori practic ari jonsson paul morri nicola muscettola nasa research ms ca ben smith jet laboratori ca abstract nasa activ time run flight processor spacecraft part remot agent experi demonstr plan state infer failur recoveri paper describ term underli plan framework term field planner plan network built increment consult model dynam spacecraft plan procedur formal defin prove complet gener plan tempor execut system adjust actual plan execut condit break plan practic develop mission critic requir pai attent import engin issu design method programm search knowledg acquisit planner valid result system capabl build concurr plan hundr task perform requir softwar introduct week remot agent autonom softwar control spacecraft mission part uniqu technolog valid remot agent control nasa millennium deep space spacecraft al bernard al experi successfulli demonstr applic plan state infer failur recoveri compon autonom control remot agent experi copyright american associ artifici intellig reserv author alphabet order plan expert search engin heurist domain model plan goal initi state plan plan engin knowledg base figur architectur drove command spacecraft involv gener plan safe execut board spacecraft achiev goal plan account activ requir give rise subgoal satisfi complex flight safeti rule activ interact describ remot agent experi theoret practic perspect architectur plan system shown figur domain model describ dynam system planner appli deep space spacecraft plan consist initi state set initi plan search engin modifi plan gener complet valid execut agent heurist plan expert part core integr part plan system board deep space heurist provid guidanc search engin plan expert provid uniform interfac extern attitud control input planner account theori system base framework plan schedul significantli classic strip plan action occur concurr durat goal includ time mainten condit describ ps framework theoret perspect start describ parallel activ defin domain rule candid plan describ semant candid point view plan deriv realist definit valid plan present plan process framework prove complet timelin state variabl reason concurr tempor action instanc state term tempor interv link constraint approach call interv plan jonsson includ approach build interv timelin model reason concurr activ elimin distinct action fluent greater express domain constraint human find natur view world term interact object attribut concern attribut state chang time attribut call state variabl histori state state variabl period time call timelin figur show engin attitud state portion timelin spacecraft applic attitud spacecraft orient period engin thrust direct achiev correct thrust spacecraft attitud maintain point direct turn action chang attitud spacecraft classic plan nilsson mcallest earlier interv dichotomi fluent action transit term interv result interv describ fluent valu implicit distinct idl idl engin timelin time attitud figur plan parallel timelin spacecraft thrust direct regard state impli point action point precondit persist fluent valu tempor interv activ enforc maintain verifi make distinct fluent action plan construct describ fluent action point view state variabl repres singl thread execut concurr system thread execut singl procedur procedur np paramet type state variabl map roc set state variabl set procedur state variabl specifi procedur possibl execut timelin consist sequenc involv singl procedur interv procedur structur call timelin token resid definit timelin final timelin token undetermin plan refer token timelin float token token describ procedur state variabl paramet valu time valu defin interv specif multipl express rang start variabl start end time valu token token tupl variabl denot state procedur element variabl denot paramet procedur numer variabl indic start end time token includ paramet domain valu assign variabl particip constraint combin valid token repres camera paramet bright level target object paramet ifi choic camera filter durat token depend bright level filter constraint link start end time paramet gener notion token special gener call constraint singl correspond sequenc invoc drawn set procedur actual invoc sequenc determin execut constraint token overlap long overlap permit valid procedur invoc timelin repres resourc usag constraint token repres resourc demand combin overlap demand exce resourc intersect region overlap demand determin procedur assign check avail approach model track power usag remot agent experi limit space prevent cover gener detail articl domain constraint complex procedur invok arbitrarili procedur call work procedur execut parallel procedur thread procedur turn occur procedur maintain attitud procedur maintain attitud thrust procedur execut procedur maintain correct spacecraft attitud ground configur constraint call compat determin correl procedur invoc legal procedur procedur invoc support compat disjunct constraint defin term constraint organ disjunct normal compat procedur invoc disjunct procedur invoc valid configur conjunct subgoal form token constraint valu variabl token involv gener form appropri specifi relat token structur limit express make plan constraint propag limit conjunct equal constraint paramet variabl token simpl tempor constraint start end variabl term metric version allen tempor algebra relat relat rise bound distanc tempor variabl bound express function start end variabl subgoal constraint state variabl execut procedur instantan switch procedur invoc mean requir state variabl met successor concept subgoal gener notion precondit classic plan add enforc meet subgoal delet precondit correspond met subgoal precondit action repres subgoal compat appli ground procedur invoc larg number invoc share constraint process execut attitud turn irrespect turn start end determin set applic compat plan process reason flexibl token variabl assign singl accomplish index compat hierarch mechan illustr figur basic idea associ compat set cartesian product token variabl domain subset planner map token relev compar domain procedur invoc fall set permit set constraint minor attitud set attitud requir procedur invoc small adjust exclud figur round box repres compat associ compat appli token fall set straight mark repres token easi determin restrict compat figur illustr hierarch index mechan compat cabl token gener determin singl compat cartesian valid procedur invoc set origin destin attitud relat set start end time addit local constraint set term procedur constraint al enforc arbitrari constraint partial instanti token intersect singl compat instanc local constraint lp automat post compat box made planner start satisfi set subgoal plan laid plan turn attent planner repres reason data structur call plan basic plan repres current candid essenti set timelin interrel current set made formal candid plan consist horizon pair tempor valu satisfi timelin state token order constraint enforc constraint limit token variabl domain set timelin set constraint cn relat set variabl includ equal local procedur constraint constraint candid plan give rise constraint consist variabl token constraint link token variabl wai network determin set legal instanti token candid plan inconsist underli constraint network part valid plan import aspect underli constraint network infer restrict valu token variabl constraint propag method elimin valu proven solut constraint network remov constraint propag prove solut elimin valu variabl impli candid plan invalid addit candid plan set made correspond flaw candid aspect candid prevent complet valid plan type uninstanti float open disjunct unsatisfi compat subgoal flaw plan rise choic flaw resolv resolv flaw reason step map categor type list choic resolv flaw plan variabl restrict flaw resolv select subset variabl domain restrict variabl domain restrict result token match uniqu compat open disjunct flaw ad chosen domain flaw remov float token flaw resolv select adjac token timelin insert float token float token flaw remov order constraint impli insert ad open disjunct flaw resolv select necessarili fail find empti domain exist solut item disjunct requir made true open disjunct flaw remov set unsatisfi subgoal flaw ad impli constraint ad constraint set unsatisfi subgoal flaw resolv find exist token satisfi ad token satisfi subgoal unsatisfi subgoal flaw remov result constraint ad impli order constraint token gener import note resolv flaw order plan valid plan permit flexibl token start end turn mean variabl domain singleton requir token satisfi applic compat subgoal disjunct satisfi token fulli support plan system behavior base notion introduc turn attent semant candid task develop formal definit valid plan valid plan defin abstract base candid plan domain model approach valid plan real world inher ti mechan execut address start discuss basic plan execut deriv realist definit constitut valid plan point execut agent execut plan concurr program interpret execut dynam system recal plan variabl circumst procedur instanti variabl correspond system current exec actual system compar valu determin procedur execut exec fail match valu valu exec trigger put system safe state start recoveri question exec succe match valu select procedur invoc depend part reason exec perform depend reason exec capabl time invoc activ exec reason capabl permit time execut process simpl plan simplest procedur call fulli invoc variabl complet determin brittl match valu simplest plan correspond singl evolut system refer potenti behavior system definit candid plan potenti behavior system token timelin fulli support timelin fulli cover schedul horizon timelin token variabl bound singl candid plan gener number gap timelin token fulli variabl uninstanti order instanti singl flaw resolv successfulli execut agent time reason plan viabl plan lack commit execut agent flaw resolut fit actual condit execut remot agent system advantag exec map task execut freed planner gener procedur execut procedur fit actual execut execut depend execut agent question depend primarili flexibl candid plan cover system restrict candid plan execut identifi execut import issu make determin solv plan problem repres abil execut plan identif function identifi execut candid map candid plan valu intent candid recogn candid recogn execut permit great deal variat execut respond candid requir plan identif function behav consist respect aspect mention function reject plan finit horizon requir modifi slightli start end token timelin predecessor subgoal appli successor subgoal candid basi restrict accept restrict candid lead formal constitut plan identif definit plan identif function execut agent function map set candid plan extend truth set candid plan candid plan extend candid token condit strictli execut capabl solv plan interest limit execut agent solv constraint satisfact problem notion plan identif provid formal definit constitut definit repres plan identif function candid plan plan plan process turn attent plan gener process input plan process initi candid includ initi token set float set constraint token question element give rise initi plan goal plan process extend initi candid complet valid plan point view tradit initi plan specifi initi state goal approach permit express specif goal request spacecraft sequenc pictur parallel provid level thrust plan process defin framework instanti method control select propag plan process function select resolut flaw current plan outlin process shown figur plan process result plan satisfi plan identif function plan process complet plan found initi candid plan extend valid plan plan process find valid plan extend stronger complet plan hold gener reason identif function return plan process address remain flaw plan begin return return fail flaw flaw resolut flaw appli return end figur plan process plan consist candid plan set flaw highlight import identifi properti sound complet plan framework theorem domain plan identif function initi plan valid plan extend plan process gener valid plan extend extend basic idea proof defin oracl specifi resolv flaw plan process order suitabl plan straightforward target plan set flaw defin token target flaw consid oracl specifi variabl domain assign variabl domain token insert free token satisfi order token timelin compat disjunct satisfi subgoal satisfact token satisfi subgoal candid add token show oracl result suitabl show flaw arriv final plan eventu step candid extend final function return intermedi candid plan step straightforward show induct criterion maintain process true step plan process preserv chosen flaw resolut compat criterion fact plan identif function return candid plan return candid plan extend includ final plan prove step flaw note show token gener plan process automat give rise variabl domain compat satisfact flaw token recal initi candid plan initi token timelin note compat specifi successor token token timelin rise compat flaw produc token timelin straightforward induct prove plan process gener token practic ps extend theoret framework system system oper stringent perform resourc requir deep space flight processor mhz rad processor mb memori lisp imag full remot agent perform order magnitud current desktop comput technolog peak cpu rest flight softwar section describ engin aspect ps system describ plan develop found describ mechan search control planner give inform develop process method interact extern softwar plan expert ps plan engin discuss produc planner requir specif plan identif function specif implement nondetermin flaw resolut strategi ps design planner step defin basic plan gener search procedur theoret complet design method program search engin restrict amount search find solut section talk plan engin thing clarifi constitut desir plan flight experi plan flexibl tempor dimens tempor flexibl plan variabl bound singl tempor variabl token start end easi assumpt constraint plan simpl tempor network pearl mean planner arc consist determin model size state variabl procedur type plan size token variabl constraint perform search node search tabl plan size perform ps plan behavior execut adjust flexibl plan actual execut condit fast increment propag morri translat plan identif function defin appli candid check arc consist candid return candid arc return candid fulli support variabl case balanc complet implement simpl implement chronolog backtrack planner return plan found plan engin provid default flaw select strategi choic point backtrack search tempor variabl flaw flaw select resolut made randomli search control basic plan engin gener plan flight experi ps includ addit search control mechan local backtrack reflect perform figur tabl search measur ratio minimum number search node total number explor achiev kind perform easi requir engin outlin princip aspect rest section flaw agenda manag ps made programm search control default flaw select strategi search control oracl proof complet advanc knowledg plan oracl select correct solut choic backtrack practic control strategi make flaw resolut basi partial plan develop search control ps program approxim oracl list search control rule list figur search control rule unsatisfi subgoal priorit flaw sort strategi choic flaw select figur search control rule rule appli unsatisfi subgoal flaw token requir turn token note model camera reach readi state immedi procedur turn execut match token type subgoal uniqu identifi prioriti flaw minimum plan planner attempt resolv flaw resolut method order case planner token insert earliest timelin gap standard sort method resolut method subgoal plan automat forc start end token occur horizon defer method succe readi token token timelin search control engin rule languag search control design extrem flexibl permit introduct sort standard method prove prune solut method satisfi resolut altern schedul token earli fail meant complet longer hand fine tune planner design search control trade script planner behavior explor benefit shallow backtrack issu address interact model desir domain model search control method complet separ constraint describ domain describ search control narrow desir declar domain model domain expert spacecraft system problem solv expert mission accumul accumul accumul figur plan fragment implement thrust accumul plan horizon domain inform problem solv method significantli complic inspect verif modul plan system ideal separ achiev model specif logic correct turn requir discoveri simpl properti extens search token sequenc token standard method defin auxiliari token variabl search control enforc specif turn prune undesir altern constraint propag includ control inform model level fragil domain initi stage project weak grasp control search global control search control requir rule reli sole local inform variabl restrict rule reli inform token variabl belong global inform make control planner schedul correct amount accumul thrust plan horizon requir track sum durat thrust token candid plan thrust token gener sum exce limit solut adopt appropri program domain constraint propag mechan comput global inform includ extra thrust accumul timelin token effect act global timer token timelin captur start end time rang thrust token variabl subgoal local constraint perform summat subgoal propag sum thrust accumul subgoal token control control rule thought search experi confirm program languag pain error prone assembl languag strong foundat build higher level control languag found captur control knowledg mission oper declar semant subsystem state variabl type constraint comment model mode activ imag camera demonstr fault inject recoveri devic part dai scenario navig schedul orbit determin base pictur activ thrust base thrust schedul gener nav planner gener plan activ ip specif interv base constraint domain model complex set timelin subsystem control planner attitud enabl planner schedul constant point attitud spacecraft maintain panel sun target constant point attitud imag earth thrust direct ip power mgmt planner ensur adequ power schedul numer activ simultan execut model low level sequenc bypass planner model give mission op abil run sequenc mode ra planner schedul execut request plan horizon mission mission manag planner coordin activ base seri schedul horizon updat mission op entir mission figur timelin domain model domain model open possibl automat understand depend point effect search control strategi compil control rule work progress explor viabil method allevi burden control search program develop test iter refin process develop domain model domain model base fix scenario scenario involv amount thrust commun window pictur activ scenario fragil model immedi appar planner converg resourc bound critic compon scenario drove planner test develop scenario cover modif fault condit scenario run automat test har autom verif tool report case planner fail planner gener incorrect plan test process fulli al interact plan expert legaci special softwar extern planner special knowledg develop plan fragment call softwar plan expert framework practic solut direct integr knowledg plan process expert wrap adaptor present product directli declar model illustr describ detail interact optic navig system revolutionari technolog valid nomin period command pictur beacon triangul posit spacecraft estim spacecraft simpli provid sourc plan beacon imag plan detail activ commun goal work planner extend plan time perform imag activ point search control rule explicitli invok result set float token rel tempor constraint deposit plan principl planner reject constraint post design search control rule ensur normal circumst planner schedul goal linearli time higher prioriti goal schedul start reject goal ran time allot tempor window develop principl interact plan system legaci control softwar topic activ import practic accept plan technolog planner flight remot agent experi conduct week experi achiev technolog valid object notabl occur earli morn team realiz remot agent command spacecraft healthi hour problem analyz telemetri data spacecraft inspect sourc code problem turn low probabl deadlock condit due miss critic section exec code hour team develop potenti softwar develop complet scenario complet achiev remot agent valid valid scenario run flight analog hardwar scenario activ morn spite problem commun softwar extern remot experi complet achiev valid object perform planner experi simpli resum interrupt tight time constraint test approv sequenc complex activ spacecraft requir dai mission scenario develop hour worth note test valid involv run full hour scenario flight real time potenti catastroph softwar fault turn unexpect plan technolog reduc cost futur robot space mission detail actual flight run al al present overview remot agent experi theoret practic point view theoret underli plan wai tradit plan approach framework abil plan concurr activ express plan complex interact includ mainten goal practic discuss problem solv implement test planner flight present solut problem research develop autonom plan capabl solv real continu scientist field work present step step autonom plan space acknowledg author acknowledg support complet remot agent team nasa jpl steve scott greg david yan contribut flight experi jeremi david anonym review comment refer gener theori action time artifici intellig spacecraft autonomi flight remot agent experi aiaa confer mexico design remot agent experi spacecraft autonomi ieee aerospac tempor constraint network artifici intellig approach applic theorem prove problem solv artifici intellig control tempor planner intern confer artifici intellig plan system gener remot agent planner intern symposium artifici robot autom space complex polynomi network consist algorithm constraint satisfact problem artifici intellig systemat nonlinear plan ninth nation confer artifici remot ai system artifici intellig integr plan schedul intellig schedul morgan kaufman wen valid remot agent experi intern symposium artifici robot autom space netherland person commun marc chief mission manag wen valid verif remot agent spacecraft autonomi ieee aerospac confer bridg gap plan schedul knowledg engin review repres plan set constraint model intern confer artifici intellig plan system fast transform tempor plan execut nation confer artifici intellig confer innov applic artifici intellig menlo aaai press
DB/1670 3 binari tempor relat back en staab institut appli informat formal descript method karlsruh germani abstract paper approach tempor reason present scale tempor relat commonli allen qualit interv calculu quantit tempor constraint satisfact problem includ interv relat tempor rule relat reason scheme gener method constraint determin consist comput minim network simpler scheme binari relat level granular plai major role appli techniqu express framework technic preliminari provid apt investig switch di erent granular exploit tradeo express ecienc tempor reason scheme side express understand side introduct express tempor reason sought multitud natur languag plan tempor common approach qualit reason quantit reason integr ful lled requir tempor reason di erent level major problem remain tackl er toolbox exibl tractabl tempor reason mechan broad submit part paper publish preprint submit elsevi preprint decemb rang applic investig framework express mechan cite tempor relat princip scheme network relat relat consist disjunct conjoin constraint constraint form time interv constraint denot contrast previou scheme interv relat augment distanc disjoint interv tempor rule point point point point relat interv section inform section formal gener larg overlap exist tempor constraint network common algebra oper relat subsumpt determin consist straightforwardli carri gener investig major factor underli interv relat network ect implic typic hold simpler scheme uenc reason process notion path consist carri slightli weaker call weakli gener path consist reach constraint propag basi determin consist face fundament express approach achiev smooth previou mechan reason problem handl previou model constraint propag mechan order comput complex construct ad extens complex constraint propag smoothli determin consist comput minim network major task face tempor reason scheme framework build basic assumpt de nition minim transfer relat gener notion minim network make level granular explicit minim comput exibl ecienc requir mention framework exhibit advantag express meiri research enrich languag facilit model involv reason task constraint john leav home arriv work incorpor ing scheme suit switch smoothli di erent level granular research switch ect reason princip tradeo express ecienc add deeper touch express side tempor reason balanc express understand consid tempor reason mechan dimens factor express tempor reason technolog ai laboratori al cf section start summari fundament reason mechan build mention make part larger ort understand reason natur languag express network allen calculu facilit understand distinguish featur gain introduc basic concept model gener give short survei simpl tempor problem cf dechter al gener form integr meiri allen calculu allen data structur underli approach graph vertic time point time interv variabl edg annot relat goal determin consist network comput minim network consist comput enforc path consist network convex relat montanari singleton backtrack path consist enforc repeatedli intersect relat restrict comput composit relat turn comput minim network state term comput consist network set time point variabl singl interv constraint pair variabl addit intersect interv real denot time point unit paper assum constraint simpl interv constraint time relat group constraint earlier time point unit earlier comput path consist determin conclud unit earlier network similar disjunct interv constraint point instanc pp relat fig unit unit earlier unit earlier conclud unit earlier unit earlier applic interv addit union result set intersect allen calculu consid disjunct primit mutual relat interv ii relat fig overlap interv overlap interv meet overlap primit relat composit disjunct union result composit primit relat de ned intersect set primit interv relat integr allen calculu fig requir full mechan reason allen calculu meiri intermedi layer subnetwork relat fig commun pp ii level depend type relat pp pi ii composit intersect oper chosen time point unit earlier time point fig constraint infer constraint ii relat pp relat pi relat fig integr allen calculu relat notwithstand bene integr meiri scale complex tempor tempor rule constraint interv integr number interv relat cover captur mechan jame shuttl driver major hotel york duti includ coach guest airport train station hotel todai schedul post mr mr meyer mr meyer mr georg sidnei transport hotel clerk told mr mr meyer ticket di erent ight pari ny mr schedul arriv ny local mr meyer arriv ny hour arrang share ight arriv ny local time mr meyer arriv ny immedi call mr train ny ny hour husband arriv mr georg ight leav sidnei ny long ight order jame servic reconsid relat exempli ed fig express integr model allen denot term constraint time point pp relat disjunct singl constraint time point assum denot constraint time point write pp relat pi relat ect time point pi relat fig denot basic assumpt illustr fig fig begin time point interv end disjunct conjoin underli constraint fig disjunct denot reduc pi relat ordin di erenc pp relat number edg denot open interv pi ii relat ab ae bb basic assumpt relat fig pi ii relat tween time point variabl consid simultan type interv ii relat ect time point basic assumpt end interv remain edg annot ordin analog pi relat fig relat overlap fig figur adapt illustr allen primit relat interact show allen primit relat relat vice versa proce straightforward algorithm similar proposit made pi relat exchang notat reveal dimens express rst account number constraint conjoin relat algebra structur underli composit intersect loosen structur requir implicit meiri integr model underli free choic disjunct conjoin constraint scheme model problem end mr end mr meyer arriv mr meyer begin mr georg end mr georg mr arriv mr meyer arriv hour arriv mr meyer arriv hour mr georg long mr georg ight start order answer question state solut problem gener propag de ned consist network minim network inform dealt di erent level granular high level interfac provid rest paper dedic question begin formal descript approach relat di si oi mi fig chang gener tempor network turn formal data structur model data refer gener tempor network build interv constraint time point interv di erent structur adapt de nition interv structur quadrupl set domain close composit intersect interv structur paper ration ordin ration interv structur de ned interv line ration number de ned intersect de ned set intersect comput ration number approxim real ordin interv structur io restrict interv convex union data structur oper de ned network binari interv constraint time de nition gener tempor network tripl fi vertic relat constraint famili interv structur fi fv ji ng set time point variabl fr jr fp jl mg set relat consist disjunct conjoin constraint exist topolog fe jk mg cover vg call network topolog fp set primit constraint rst compon interv structur note shorthand write fp conjunct proposit make carri qualit al reli structur properti transfer treatment weaken statement make neglect rest paper primit constraint vertic form network fv model time point ft relat partial determin network topolog relat exhibit topolog element result ft interest special case unambigu de nition unambigu gener tempor network relat consist singl fp start de ne project interv map order approach de nition composit de nition project binari function select constraint fr constrain edg de ned level simpl conjoin disjunct conjoin constraint conjoin relat input refer set jk incorpor inform illustr applic project elimin lemma fr rm constraint fr rm entail constraint rm proof level project de conjunct simpl project conjunct elimin lemma hold level disjunct conjoin proposit hold de level entail induct length entail lemma hold level de nition project level reduc level level appli distribut lemma hold level order constraint di erent interv interv map establish commun restrict de nition interv map function ir interv properti ful ir requir ir result quantit constraint map common ordin iq iq iq de nition composit relat de ned comput consequ entail network return network de ned amount version de nition implicitli assum interv iq establish common ground conjoin constraint di erent interv structur assum common ground exist determin consist problem solut found comput consequ determin consist approach consist propag relat propag insuci determin solv simpl constraint problem achiev path consist approxim consist dicult reason problem weakli gener path consist contrast simpler repeat applic composit lead path consist version figur show case relat cover edg relat cover edg problem instanti pair number path consist assign valu path inconsist due network topolog repeat composit detect inconsist repeat composit enforc path consist reader note problem incur composit de ned prevail result relat propag restrict relat exist fig pc comput repeat composit slightli criterion path consist weakli gener path enforc independ network topolog repeat composit de nition relat weakli gener path consist regard vertex path relat path impli relat regard vertex path relat path relat inconsist detect intuit project relat binari time result network binari relat path consist propag relat figur yield ad constraint relat binari relat binari relat project path consist lemma relat regard relat path length proof trivial induct length relat path induct start theorem relat regard relat path length induct relat vertex path relat path implic def hold structur induct assumpt relat regard induct assumpt regard valu due induct assumpt valu order appli abstract model underli relat syntact criterion allen easili comput compar constraint og subsum mg subsumpt hard syntact criterion impli semant impli semant subsumpt assign model euclidean space relat compar de nition relat fp jl relat fp jl interpret jv partial boundari denot set di erenc lemma associ notion model relat lemma model relat assign valu time point variabl model relat proof assum interpret assign valu fx ji ng time point variabl model construct impli de nition ful ll restrict result input result result due transit subsumpt relat give syntact check theorem proof due lemma show theorem hold relat path length true de nition lemma constraint propag theorem mean comput suppli composit de ned prevent ecient comput benign case pair relat yield disjunct iter relat involv number disjunct exponenti simpl problem incur fragment render number disjunct relat exponenti number relat network relat nite number network base io comput optim result proce iter optim naiv simpli disjunct nest granular remov redund call naiv simplist method involv unnecessari abund assum granular disjunct simpl relat conceiv optim minim number disjunct lemma local optim disjunct found je proof sketch optim disjunct set disjunct proce candid possibl upper lower boundari je dimens test disjunct test complet disjunct je je primit algebra oper optim optim process time je je je result local pair substitut singl conjunct clear repeat shrink grow produc global result fewer ecient parallel implement readili build optim procedur current implement ecient optim discard disjunct relat cf elabor exposit algorithm comput fi begin select delet set fr foral od rest mention test perform je je algebra oper theorem comput algorithm relat node common intersect result relat tighten relat comput consist triplet time point variabl achiev assum intersect oper de ned boolean function return true prove theorem algorithm incomplet base sole fi termin algorithm result network proof actual oper network optim lemma model model vice versa comput consequ sound conjoin restrict oper sound restrict sound project sound lemma de ned sound similar outlin actual erat sound sound condit network base complet substructur tripl theorem initi queue pair fr ensur criterion check tripl criterion establish tripl valid check tripl ect condit ful lled tripl queue empti algorithm stop note network constraint io freeli fail enforc condit oper iq map result composit back coarser constraint mix network network repres allen interv relat model network allen path propag incomplet network path consist path consist allen model entail model achiev termin algorithm inconsist detect incomplet network model allen relat constraint propag approxim determin consist fare lemma weakli gener path consist admiss valu relat consist proof weakli gener path consist path consist path consist admiss valu relat consist ecienc appli algorithm enforc search backtrack space underli determin consist directli algorithm approxim algorithm perform crucial depend comput complex theorem algorithm termin max min maxim rang singl constraint max je maximum number edg relat partit naiv optim algorithm termin proof involv time determin path consist singl relat disjunct mean path consist comput time enforc path consist number vertic network enforc path consist network time singl composit comput time time result consid enforc path consist requir step naiv optim seamlessli integr comput disjunct result disjunct appli current strategi invest step comput comput oper time amount optim neglect small constant worst case ort relat set queue bound optim scheme naiv optim relat updat time tn relat set put queue algorithm termin naiv optim edg partit relat xed algorithm termin naiv optim rst result good optim incur higher cost naiv counterpart reason result straightforward optim process produc bene ts worst requir comput process footnot preliminari assum integ rang ration constraint transform integ constraint practic experi optim scheme improv perform algorithm show reason comput perform smoothli comparison constraint propag algorithm express mechan recogn larger part comput complex stem numer fragment occur gener relat incur comput complex qualit gener small constant complex order allen propag interv relat quantit interv structur di erenc scheme approach stem paramet mirror express term complic relat assum disregard trivial constraint propag algorithm show behavior rang factor comput complex propag algorithm prove hard live applic delv deepli issu trade express ecienc section postpon discuss strategi confront matter section comput minim network major proposit commonli sought tempor constraint network concern consist minim network move tempor reason mean consist remain larg una rethink constraint propag problem comput switch level granular turn illumin common de nition de nition minim network network tightest network network tight constraint subsum constraint underli assumpt common de nition dicult tempor relat assum comparison tight relat easili comput assum exist tightest relat set relat figur show simpl network illustr part problem impli assumpt singl relat network cover edg singleton label relat consid tighter model depict relat creat linear depend restrict relat semant relat fig singleton label rst tempt trace diculti de nition recogn gener comparison tight constraint intric hard task true subsumpt relat hard decid similar oper criterion practic frequent explicitli atom level relat minim network allen comput network split depend atom level disjunct enforc path consist entail minim union singl result form minim relat ecienc actual result comput minim network depend granular relat consid atom relat meiri integr decid allen atom perfect minim label relat constraint enforc tighter relat explicit speci cation atom level break label turn tighter label enforc network order make underli assumpt granular atom relat transpar gener introduc notion minim level granular rst formal notion granular level de nition level set relat fr jk describ granular level topolog fe jk mg valid instanti relat topolog domain relev condit de nition describ criterion atom set instanti relat describ level granular atom relat depend view system allen relat consid atom point split unit enforc combin ensur comparison relat instanti proposit lemma addit lemma relat fp fp proper instanti proper instanti proof ensur fp subset minim network fp subset arbitrari network due instanti fp proper instanti fp constraint fp tighter fp euclidean model condit de nition instanti time point priori de nition granular network topolog minim granular level de ned topolog relat split ks ks ks consist instanti chosen rest network corollari relat topolog minim regard chosen granular proof directli lemmata minim comput split split relat granular comput consist result granular union singl result interest result build io cation nite number ordin relat bound max establish minim level granular origin notion minim ordin allen network abstract reason level express effici ventur binari tempor relat ecienc understand switch back express tempor theori sparser access comput possibl human section model order provid apt foundat switch di erent level reason base interv bring level tempor reason gener frame refer switch coarser model rel dimens interv structur di erent granular permit abstract quantit constraint ordin io granular week bettini al chandra al disjunct conjoin constraint exist primit qualit relat time point time point sophist level move sparser abstract proposit level giunchiglia walsh figur excerpt network tempor reason scheme arrow point express denot base interv structur io stand disjunct quantit constraint dechter al term integr stand integr allen model dechter schema view propag limit number disjunct step remain polynomi number relat constraint constraint number relat comput complex determin exponenti polynomi polynomi allen calculu integr point algebra fig express reason scheme mirror express ecienc determin consist point algebra network approxim constraint propag algorithm larg rang embodi network attempt deal complex bottleneck provid smooth shift di erent level express strategi simpli cation tractabl local approxim inform shift perform famili oper introduc rst interdepend constraint input disregard disjunct ir switch di erent interv illustr inform formal framework requir je assum je read ideal abstract network detail constraint coarser ecient reason express trade ecienc disregard structur project inform ecient solvabl point algebra coarser level small directli ect tighter bound constraint propag theorem control extent constraint propag order determin consist crude heurist encompass framework explicit control shown decid reason point algebra edg exploit bene cial comput properti pa incur incomplet sound abstract oper ensur de nition oper lemma oper illustr abstract mechan tempor reason problem order retriev qualit order determin arriv desir move point algebra relev piec knowledg composit oper mr arriv mr meyer arriv hour arriv iq iq move drawn mr meyer arriv hour iq easili read mr mr meyer mr meyer arriv men arriv simultan neglect knowledg mr georg arriv order respect reason level account background knowledg durat ight assum interv structur al refer ight time common ground hour unit long hour link context ight comput staab hahn inform mr georg arriv tempor reason mechan famili abstract plai major altern dechter encount fragment ect highli worst case bound theorem restrict propag convex constraint oper abstract gener relat limit number convex disjunct render constraint propag similarli ecient account disadvantag remain result network similarli relev statu interv path consist determin strategi tackl fragment problem deriv exibl account switch back level tempor reason adapt level reason ner grain size ident oper oper lift reason coarser level notabl except granular level directli combin render power comput strategi problem requir comput express perform comput cheap level reason rst consist point easi result earli easili full advantag easi map result back reason express level order determin hard trade express ecienc solv easi task render hard task imposs abstract interfac level express understand express applic power abstract mechan mediat di erent level reason applic tempor reason system thirteen primit interv relat allen calculu disjunct interv constraint pose problem human deal relat complic structur relat unwieldi tempor queri languag modul larger applic requir text understand gener system deal schedul problem account complex proposit mean conceptu long arriv typic emploi system translat express tempor reason requir bridg conceptu introduc interfac level abstract unnecessari detail gener relev distinct made provid de nition abstract relat move interfac level reason level direct switch interfac reason pose queri tempor reason simpli expand de nition abstract relat tabl show exampl de nition switch output abstract relat interfac answer queri pose requir reason criteria select interfac relat suit abstract relat de ne notion month week tabl sampl abstract relat interv meet interv toler interv interv interv interv unit disjoint time point time point time point time point time point order time point time point time point time point time point correl time point de nition set abstract relat relat smallest upper approxim relat regard relat greatest lower approxim relat regard de nition yield smallest upper greatest lower approxim uniqu upper approxim conjunct upper uniqu lower approxim disjunct lower bound present algorithm comput approxim illustr scope de macro graphic intersect primit fig appropri depend heavili abstract relat tempor reason system obviou problem illustr abstract relat quantit paramet proper instanti free paramet actual valu relat redund variat symmetr relat point unit requir point unit yield inform addit constraint control proper instanti abstract relat de nition tabl supplement ontolog restrict form interv pair time point determin interv talk gener avoid addit constraint consid plausibl abstract relat uniqu assumpt uni cation variabl abstract relat tabl illustr notion gener exampl assum mine result interest complex rule rst interest tempor rule arriv time mr uenc schedul mr meyer add unconstrain relat relat project result gener abstract relat appli tabl requir interv time point di erent number time point approxim abstract relat gener point speci instanti approxim abstract relat speci relat mr georg arriv correl mr mr meyer qualit inform length mr georg reason qualit interv structur sake ignor intric presupposit involv algebra oper qualit durat simpli present result deriv infer result gener point medium time correl medium time time point conceptu interfac level combin singl evid gener text understand repres grade inform disk faster hard disk relat hahn al relat handl compar formal deal complex utter block size kb data throughput requir express costli reason exibl assign reason task level entir understand process execut feasibl bound repres relat case reason ner level remain feasibl complic relat resort reason coarser level approxim eventu abstract interfac level make gener access user myriad tini bit detail relat work level granular tempor static calculi discuss section deriv fact constraint system stand di erent level express arrow fig limit calculi point algebra express allen calculu fairli gener integr model allen calculu metric reason framework introduc gener gener tempor network express exce mention descript relat scale smoothli binari includ propag quantit qualit constraint network comput minim network di erent granular tempor reason scheme lai foundat formal tempor constraint di erent level granular weaker constraint system choic applic requir speci constraint er bonu side tractabl reason algorithm express comput complex strateg manner lead idea navig graph di erent el express demand depend applic idea er express tempor reason dynam shift express cheaper system express start point research agenda long time hobb al meiri exibl granular principl method side condit constitut main di erenc approach common reason system implement metric system bettini al extend network order repres interv structur larg rang granular level includ structur busi approxim reason algorithm propag constraint parallel network singl granular oper map constraint granular commun di erent network proposit de ned oper neglect approach tempor reason system similar line cf earlier work chandra al dean neglig drawback regard perform issu approach ecient tempor reason approxim propag mechan dechter heurist optim search process koubaraki lack compar empir determin criteria import inferenc task consist point path consist qualit polynomi granular switch comput coarser result nement level postpon subsequ round optim scheme termin termin due exhaust time budget set anytim cf russel zilberstein network assert similarli ned state cascad di erent granular complementari made permit repres seemingli contradictori inform di erent level level perceiv interv ner level recogn rst tini bit abstract oper ect percept chang switch di erent level tempor reason granular issu interest due express reason facil marin al extend time point algebra comparison approach complementari express relat jonsson koubaraki network relat mean posit liter exist conjunct achiev subclass allen calculu interv relat quantiti consist determin polynomi time disadvantag disjunct formul specul class backtrack ecient gener surg interest constraint recent gener constraint problem handl falt comput arc consist constraint network global consist hard tackl point achiev gener problem falt treat ternari constraint problem relat gener ariti transform ternari de ne consist gener binari path consist tempor reason applic main drawback restrict convex relat prohibit express line research neglect actual algebra oper tempor composit implic line cf sum approach abstract ecienc understand exist approach tempor cf shahar cheng abstract move tempor reason conceiv summari depend ontolog knowledg tempor occurr summar medic descript nice complement approach work motiv urgent integr relat tempor reason order extend rang common reason problem make progress uni ed theori tempor popular version tempor reason turn deriv paramet set gener framework identi ed dimens crucial regard express ecienc express interv structur relat network topolog investig major task tempor constraint determin comput minim ect paramet provid switch smoothli dimens di erent granular reason proper commun interfac concern abstract interfac level achiev approxim tempor relat macro de research issu knowledg dealt complementari dimens exist give rise possibl constraint scheme cf comparison distanc marin repeat structur morri al begin simplest assum point pursu extens reach region determin consist network fast unifi theori subscrib method ts provid famili method interdepend understood access switch advantag combin similarli approach major open issu bring level abstract plai gener solut problem research environ work natur languag text understand choic adequ abstract level author choic speci linguist express occur semant interpret progress text al xed start proce cheapest level turn express level proper text understand acknowledg research report paper fund dfg scholarship graduat program arti cial intellig freiburg bmbf grant project karlsruh special udo susann holger stefan schulz valuabl comment ferent stage oliv inspir discuss optim anonym review give hint improv present refer aaai nation confer arti cial intellig innov applic arti cial intellig confer juli menlo aaai mit press jf allen maintain knowledg tempor interv commun hybrid tempor reason plan schedul proc intern workshop tempor lo ieee comput societi jc arc consist gener constraint preliminari result ijcai page xs ss jajodia sati abil quantit tempor constraint multipl granular principl practic constraint program cp lnc page implement calendar tempor rule gener proc intern confer data engin page lo ieee comput societi press di qualit posit inform arti cial dean arti cial tempor hierarchi ecient maintain larg tempor journal pearl tempor constraint network arti cial editor proc workshop constraint ijcai algebra approach granular qualit space time proc intern joint confer arti cial intellig ca august page san morgan kaufmann falt local consist ternari numer constraint ijcai page tempor reason base arti cial schubert tempor disjoint arti cial giunchiglia walsh theori abstract arti cial schulz knowledg drive match medic ontolog medic languag process arti cial intellig jr hobb granular proc intern joint confer arti cial page morgan proc intern joint confer arti cial intellig japan august san morgan kaufmann proc intern joint confer arti cial intellig sweden august san morgan kaufmann jonsson linear program approach tempor reason aaai nation confer arti cial intellig innov applic arti cial intellig page menlo aaai mit press jonsson unifi approach tempor constraint reason arti cial comput complex relat time point interv arti cial ha kautz pb integr metric qualit tempor reason aaai nation confer arti cial page menlo aaai mit press koubaraki tractabl disjunct linear constraint principl practic constraint program cp lnc page visual method time express point plane page usabl issu knowledg system aaai page meiri combin qualit quantit constraint tempor reason arti cial montanari network fundament properti applic pictur process inform ra wd khatib path consist network nonconvex interv proc intern joint confer arti cial intellig august septemb page san morgan kaufmann tempor structur narr comput marin qualit tempor reason point durat ijcai page gv interv durat network australian joint confer arti cial page framework reason interv durat ijcai page sj russel zilberstein system proc intern joint confer arti cial intellig august page san morgan kaufmann bv falt solv convex csp continu domain principl practic constraint program cp lnc page ms greenberg activ knowledg project manag ieee transact pattern analysi machin intellig dechter process disjunct tempor constraint network arti cial shahar cheng visual tempor abstract page staab tempor relat proc european confer arti cial intellig august page wilei staab grade knowledg extract inform text lnai staab hahn compar ijcai page staab hahn scalabl tempor reason ijcai page koubaraki backtrack algorithm disjunct tempor constraint aaai proc intern workshop tempor lo ieee comput societi van beek constraint propag algorithm tempor report ds weld de read qualit reason page morgan tempor reason qualit quantit inform point durat aaai page
DB/1671 3 august answer queri semant gryz answer queri semant cach park godfrei depart comput scienc maryland colleg usa gryz depart comput scienc york canada abstract grow interest semant queri cach aid queri evalu semant cach simpli result select relat inform chosen evalu cach local complex environ heterogen data semant cach optim queri reduc network load resourc usag present gener logic framework semant cach relat oper cach answer possibl answer queri partial answer cach address answer answer cach notion semant semant semant queri remaind work relev semant address conjunct issu pertin effect semant cach evalu queri due case overli simplifi assumpt effect cach case lack formal framework attempt establish framework illustr issu involv semant cach queri evalu show applic semant relat work area studi establish agenda accomplish make semant queri cach viabl technolog introduct grow interest semant queri cach aid queri evalu semant cach simpli result queri cach select relat inform chosen strategi cach local complex inform environ mediat heterogen data semant cach optim queri reduc network load resourc usag concept basic comput scienc integr circuit central process unit high speed memori cach reduc fetch main memori oper system emploi essenti complex cach strategi decid virtual page main reduc fetch secondari memori relat manag system emploi buffer manag strategi reduc fetch data page distribut layer cach cach inform server client cach page cach tupl cach memori page tupl studi context semant queri cach offer approach shown semant cach gener outperform page tupl cach approach due semant subsequ queri relat conceptu previou ultim pull data logic sourc semant cach august answer queri semant gryz answer current queri distribut unclear page tupl cach adapt semant appli environ present gener logic foundat semant queri cach explor wai queri answer semant elucid numer issu address implement semant queri cach extend paradigm semant cach cach composit answer relat oper cach store local relat call relat express cach cach express notion semant cach simpl answer set store relat label queri result answer semant cach answer queri complex requir reason queri cach formula determin relat semant current system facil reason queri receiv order semant queri specif tool reason cach queri express determin cach partial queri address topic decid answer extract answer semant overlap semant semant remaind interest case determin answer queri inform local answer recov cach differ topic topic queri cach express queri topic gener case queri cach express direct topic remaind queri found repres queri answer cach topic challeng defin attempt provid insight section provid overview semant cach discuss applic section provid logic formal datalog logic model semant queri address topic turn section discuss relat work topic address work relev semant queri provid summari work relat issu semant cach remain open conclud section semant queri cach overview start inform descript relationship queri answer set tupl store explicitli comput cach box figur abstractli repres relat tabl clear box repres answer tupl cach shade box repres answer tupl queri box repres relat tabl repres evalu queri involv type reason queri reason abil compar emploi inform queri support applic august answer queri semant gryz queri cach queri case cach case cach queri case cach queri case cach queri case cach queri case figur relat cach current queri tupl attribut assum initi oper perform queri select project current queri overlap cach queri number wai queri comput cach partial case repres call vertic partit queri project cach cach kei column relat miss column import join cach local case repres situat answer queri refer case horizont partit queri case repres mix partit queri scenario gener cach queri involv join white box figur repres result arbitrari join cach store local simplest case column interest queri imposs comput answer set queri inform server cach queri result join rn current queri join rn comput valu join column relat evalu cach case introduc modifi queri part queri evalu cach evalu subsequ depend primarili answer set pipelin gener benefit heavier cach case optim queri time mislead figur interest answer set queri cach overlap actual tupl share interest subset answer queri cach share case queri cach semant relat queri cach semant cach answer queri relat stock holder assum base relat queri call remaind queri trim queri august answer queri semant gryz content tabl affect stock vice versa tabl share valu stock holder determin queri cach evalu queri view relat defin part base relat queri emploi view relat cach determin semant share answer determin queri express evalu cach retriev answer topic paper express queri cach logic emploi analyt tool develop logic decid cach combin partial queri basic infer determin conjunct queri conjunct queri queri queri answer answer queri test suffici simplest singl refer partial answer queri queri cach requir sophist inferenc applic semant queri cach address number issu distribut environ contend critic optim environ ffl queri optim improv queri time queri process client workload server reduc answer set queri comput part client save network commun queri evalu client rest evalu server reduc time evalu substanti save monei environ monetari charg electron cach techniqu optim monetari cost comput optim queri answer cardin queri answer set determin advanc number answer queri cach cach answer set determin work optim queri batch queri user applic request union answer collect queri evalu part subsequ queri answer answer determin obtain previou part subsequ queri semant independ previou queri evalu ffl data secur limit shuttl sensit data network store client cach data consist complet defin part tabl view defin ffl fault toler access time queri partial comput answer return user base exist integr constraint relationship determin semant affect stock holder scope paper august answer queri semant gryz ffl approxim answer good approxim aggreg valu averag obtain cach determin cach repres sampl tupl aggreg function evalu cach ffl user interact answer set pipelin subset answer comput client cach return user remain answer evalu indirect answer inform queri cach user requir sequenc queri determin queri add tupl retriev limit size answer set user interest retriev satisfi subset complet answer case user termin queri evalu find answer set larger expect queri process termin retriev answer cach evalu queri cach logic notat emploi terminolog logic datalog db defin consist edb db edb collect fact db collect rule integr constraint assum predic defin rule db call defin fact edb call rule horn logic sentenc atom shorthand notat list variabl xn shorthand notat free variabl formula scope quantifi notat existenti quantif rule written shorthand quantif understood queri datalog posit atom remov written case atom notat conveni logic program system deduct system find answer queri mean refut proof queri fcg queri repres answer answer wit ground prove inconsist find conveni work queri conjunct form queri defin queri formula existenti conjunct formula integr constraint paper august answer queri semant gryz refer queri formula simpli understood context refer free variabl variabl distinguish variabl variabl existenti variabl queri formula simpli negat queri indic variabl consid distinguish defin unfold queri unfold simpli resolut resolv queri match rule standard resolut step prolog loss gener unifi variabl appropri standard predic unfold unfold simpli sequenc unfold appli sequenti start queri end finit call unfold simpli unfold defin unfold queri formula queri formula unfold queri distinguish variabl ad variabl introduc unfold existenti defin abbrevi queri formula formula call abbrevi formula call abbrevi formula note free variabl distinguish subset set free variabl answer answer project logic defin answer respect db ground substitut free variabl db answer set respect db set qs answer denot answer set db simpli db understood relat tabl synonym answer set semant queri cach semant cach pair queri formula answer presum queri answer set store local relat tabl label queri formula simpli refer queri formula cach cach formula cach answer set cach tabl term cach refer cach clear context determin answer cach describ formal condit satisfi queri answer set cach cm case depict figur repres relat queri cach queri distinguish variabl call cach subset cach cm cach express express existenti conjunct queri cach august answer queri semant gryz formula variabl constant repres select variabl appropri ffl answer queri cach finit collect cach express en db en ffl abbrevi answer abbrevi cach abbrevi finit collect cach express db en note db left hand side entail oper definit mean infer rule db hand side hold respect db exampl illustr case queri benefit cach store younger older answer union answer set valu benefit imposs distinguish tupl repres answer tupl union cach defin queri ssn benefit queri answer combin project tupl union cach find answer cach illustr test describ suffici answer queri retriev cach state condit provid august answer queri semant gryz ffl answer retriev cach exist cach express db ffl answer abbrevi retriev cach abbrevi cach express db case queri complet answer cach easi state simpl combin condit answer retriev cach finit collect cach express en db en db ng condit essenti establish union note gener procedur establish queri test direct ultim goal applic answer queri cach satisfi semant overlap semant independ case figur queri cach express overlap direct wai queri cach express unfold answer partial answer previou section formula determin collect cach express composit complet answer queri partial answer cach express unfold answer rest qs unfold complet answer cach queri cach express semant unfold complet share finer grain view tax defin payrol posit tax payrol nation payrol offici posit compani set tax payrol nation peopl payrol handl peopl payrol nation compani handl tax tax cach current queri queri vice versa clear semant mutual reli tabl payrol answer queri potenti cach figur queri overlap mutual reli sourc show logic captur queri cach formula semant overlap august answer queri semant gryz queri overlap iff exist queri formula overlap exist queri formula overlap suffici overlap condit state share common share ultim evalu queri incompat select overlap condit overlap formula share resourc construct condit ensur overlap payrol posit payrol nation overlap overlap wit payrol overlap formula payrol posit nation defin gener overlap formula overlap formula exist overlap formula answer overlap formula answer queri cach overlap evalu overlap partial answer queri gener overlap formula determin maxim set mutual answer definit overlap complex test examin unfold overlap arbitrari unfold queri overlap respect db iff respect unfold fq overlap state db overlap call overlap iff free variabl free variabl case figur call abbrevi overlap abbrevi overlap cach express case figur abbrevi overlap answer part queri depend user cooper answer issu call queri semant independ respect db iff overlap respect db case figur note semant overlap defin introduc notion semant independ determin overlap gener cach express found partial answer queri local overlap express evalu local tabl view overlap express appar local discov note definit queri formula disjunct tautolog contradict august answer queri semant gryz worthwhil small tabl suffici answer queri evalu queri server overlap offer choic evalu strategi emploi semant cach semant remaind partial answer queri evalu rest queri answer simplest action evalu entir queri pipelin answer suffici user answer cach queri evalu strategi optim evalu effort unaccept cach secur reason comput queri return remain answer answer retriev cach queri cach benefit partial answer save network comput server ship result back requir comput join benefit server introduc notat repres remaind queri result remov introduc notat call discount queri queri discount respect queri concept gener call remaind queri discount queri satisfi condit respect queri cach express partial answer ffl sound answer condit hold uniformli applic semant cach ffl complet answer answer retriev provid complet answer set condit hold applic ffl minim semant independ semant answer retriev cach recomput server cach secur semant independ enforc cost queri cost effect recomput answer queri lead effici resourc enforc semant independ simpli defin consid negat paper introduc discuss section queri evalu answer minu standard relat set minu oper august answer queri semant gryz make evalu shown captur intend queri overlap cach discuss definit type queri ensur semant independ cost effect ffl condit defin discount trivial hold defin trivial hold randomli evalu hold evalu evalu result defin ensur uniform ffl cost evalu cost evalu condit state differ depend applic comput environ cost measur process time answer retriev comput suffici cost evalu cost measur amount monei paid defin cost effect long nonempti interest defin semant wai evalu produc introduc type optim call queri optim idea unfold view queri evalu empti evalu local introduc defin weaker version queri collect unfold denot unfold explor approach evalu method rewrit queri algebra result queri evalu explor complex issu rewrit techniqu approach develop special evalu strategi evalu discount queri directli introduc method call tupl tag method optim discount queri evalu queri show evid defin limit notion find collect unfold answer captur stronger overlap semant import applic version type semant data secur support provid defin correctli evalu strategi gener evalu strategi condit mean method optim set minu set minu increasingli import relat oper analysi data wareh optim techniqu worthwhil call syntact call semant discount august answer queri semant gryz relat work work previou current work problem similar discuss paper address queri queri optim problem queri answer queri semant discuss section special case overlap queri shown answer set queri subset answer set queri conjunct queri queri logic conjunct involv studi problem shown conjunct queri identifi algorithm test conjunct queri permit negat present involv arithmet comparison queri respect datalog program datalog question datalog program gener undecid question datalog program conjunct queri doubli exponenti extens queri problem problem rewrit queri mean queri queri fold problem consid context heterogen system queri rewrit materi view conjunct queri consid practic issu discov exploit queri overlap consid context multipl queri optim goal optim evalu batch set optim singl queri develop techniqu gear find common set queri idea cach queri result optim process subsequ queri studi develop techniqu restrict subset conjunct queri techniqu find queri origin queri evalu subset origin queri answer set implement adm includ queri cach system base algorithm extend paradigm queri cach cach provid partial answer queri semant cach queri answer obtain singl cach project select oper framework effici implement semant queri answer cach found semant cach strategi design explicitli queri applic consid queri cach heterogen environ investig approach join cach queri futur work agenda extend paradigm relat oper perform cach cach consid combin join answer queri previou focu cach tabl project select answer partial queri restrict cach effici implement greatli restrict opportun answer queri cach goal greater express effici cach formal gener conjunct queri simpli call conjunct queri august answer queri semant gryz framework semant cach test reason queri cach gener framework queri answer queri evalu determin remaind find remain answer queri found evalu discuss section remaind queri applic remaind queri receiv attent previou work consid limit context import note comput discount method sound complet return answer return applic tool opportunist gain semant queri optim appli tool complet analysi queri benefit semant queri optim applic tighter queri secur assur secur portion queri success issu resolv standard issu cach project address effici algorithm develop applic includ gener cach express answer answer set comput remaind queri evalu server heurist develop decid cach bring desir benefit issu cach mainten includ cach replac maintain cach currenc merg semant similar cach mainten issu recent cach mainten consid domain www inform sourc semant cach mainten issu address present gener logic framework condit determin partial queri present retriev cach framework extend previou work area wai criteria check cach answer queri complet answer retriev relat combin cach express discov criteria work queri cach cach make approach pertin data wareh mediat environ extend notion partial answer queri account case subset request attribut return user answer shown heterogen environ data sourc introduc concept semant overlap queri cach queri cach consid semant overlap possibl exploit cach answer queri introduc richer formal remaind call discount outlin issu involv defin formal semant refer subrahmanian queri cach optim distribut mediat system proc page june august answer queri semant gryz ullman effici optim class relat express ullman relat express siam journal shahabi optim inform agent select materi data workshop artifici intellig inform page juli held conjunct share page server system chandra merlin optim implement conjunct queri relat proc ninth acm symposium theori page shim optim queri materi view page chaudhuri vardi datalog program page chen roussopoulo implement perform evalu adm queri integr queri result cach match proc edbt tan semant data cach replac studi altern architectur system finkelstein common express analysi applic page godfrei gryz framework queri optim workshop deduct logic nr page sept held conjunct godfrei gryz queri optim technic report dept comput colleg md oct godfrei gryz overview dynam queri evalu queri optim page dec longer version godfrei gryz semant queri cach heterogen krdb aug godfrei gryz strategi partial evalu view godfrei gryz view disassembl johnson klug optim conjunct queri untyp variabl siam journal keller basu cach scheme architectur vldb apr klug conjunct queri inequ journal august answer queri semant gryz larson yang comput queri deriv relat proc page levi sagiv queri independ updat proc page srivastava answer queri view proc page ordil queri heterogen inform sourc sourc descript proc lloyd foundat logic program symbol intellig leverag mediat cost model heterogen data sourc fourteenth intern confer data page feb qian queri fold intern confer data page ren dunham semant cach queri process technic report depart comput scienc selli ghosh optim problem june shmueli decid express aspect logic queri proc acm symposium principl page ullman principl volum ii principl comput scienc seri comput scienc ullman inform integr logic view sixth intern confer theori jan
HCI/1672 4 easi develop physic interfac physic widget abstract physic widget physic user interfac widget graphic user interfac similar abstract packag input output hide implement construct function interact interfac displai control devic state unlik connect manag track devic link softwar physic simul mode programm debug test physic interfac physic devic present evalu show everydai programm rapidli develop physic interfac introduct movement embrac humancomput interfac design includ physic user interfac augment comput power includ ubiquit comput calm technolog comput tangibl user interfac inform applianc comput research area demonstr simpl excit exampl physic user interfac ishii tangibl media group develop eleg ambient fixtur commun inform peripheri human percept includ rotat program control bottl plai sound open touch counter track displai physic object water lamp project water rippl surfac hudson tanaka built inform air bubbl rise tube water creat scroll displai greenberg illustr devic serv digit physic surrog remot cite greenberg easi develop physic interfac physic widget acm uist symposium user interfac softwar novemb florida acm press saul greenberg depart comput scienc calgari canada present remot serv commun react appropri implicit explicit action al detail microsoft displai numer respond user action media artist creat artist interact instal combin comput physic devic respond peopl move space siggraph art excit everydai programm face hurdl creat simpl physic user interfac easili sheer difficulti develop combin physic devic interfac convent program languag specif problem list simpl devic made cheap readili electr compon hard build background hobbi circuit design electr engin comput scientist human comput interact specialist lack commerci devic publish interfac program devic exampl includ hack dourish edward email notif hack greenberg lego document commerci devic design applic set typic configur api level abstract suit build kind physic devic protocol develop control secur applianc limit gener devic develop programm logic control construct control devic abstract low design requir extens comput permiss make copi part materi fee grant provid copi made distribut profit commerci acm titl public date notic copyright permiss associ comput copi post server redistribut requir specif permiss fee train difficult program simplest thing construct kit orient market behaviour construct kit lego target children educ kit target perform develop devic readili earli stage program due ship cost program written difficult test debug frustrat st experi experi echo problem design reactiv media space environ illustr figur built simpl proxim servo light switch small video displai focu media space design found select electr compon hobbi circuit board microprocessor wire protocol fortun comput visit collabor profici work assum burden expend time develop debug devic relat softwar success project tale end softwar devic imposs maintain devic visibl figur rotat servo motor light sensor figur activ hydra proxim detector ultrason sensor hydra unit microphon disassembl mess problem built work consid individu devic softwar modifi wai experi echo discuss research artist develop physic user interfac physic devic comment invest time learn basic microprocessor program bring specialist electr engin knowledg common devic easili develop peopl develop evolv limit form reusabl modul research concept consequ made concert effort packag physic devic softwar easi develop physic user interfac goal creat simpl develop concentr modif recombin devic physic user interfac devic construct easi averag programm program extend approach develop physic direct analog graphic user interfac widget packag softwar applic primari belief widget make gui easi make gener physic user interfac easi develop softwar architectur commun connect softwar api devic simul option onscreen compon interact devic gui widget success gui widget greatli simplifi develop interact softwar abstract packag standard input output control hide implement function api simpl interconnect work concert toolkit widget give programm good repertoir graphic compon assembl interfac result contrast input programm compon repres physic devic programm widget concentr gui interfac design graphic program servo control requir convent gui figur motor import idea present programm easili entiti insert applic provid abstract widget graphic interact physic entiti hide detail entiti implement unlik requir connect manag gui widget applic run physic devic disappear run time devic intermitt connect job connect manag monitor commun attach inform applic program disappear give programm devic identif link softwar physic counterpart problem devic attach singl devic identif issu devic type end attach type number devic ahead time clear identif scheme requir simul mode softwar develop code work simul mode softwar design debug test system actual physic devic part absent includ extend api set simul characterist graphic person option interact devic state built design built softwar hardwar complet type support featur list digit led digit connector analog connector digit connector analog digit switch figur host led connect complet list prefix abbrevi research laboratori programm control devic servo motor posit motor set programmat resembl standard power bar outlet programm programmat rapidli turn individu outlet figur plug combin sensor programm control digit output devic led retriev state digit input devic type inspect state analog sensor connect forc light sensor earlier built includ motion proxim anim updat current progress figur note connect circuit board visibl insid softwar hardwar architectur abstract architectur illustr figur illustr detail physic devic packag physic unit physic creat physic interfac end user left physic devic includ primit input output devic compon circuit board commun layer primit devic compon actual servo sensor switch plug built circuit board semiconductor control electron commun layer base commun handl commun protocol host comput devic packag depend illustr figur deliv small circuit board cm illustr figur devic design option attach servo motor contrast packag power bar adapt commerci electron hidden insid wire protocol commun protocol physic devic host comput ms window visibl end programm current set commun standard wrote softwar window set manag basic commun physic devic plug window devic atop devic transmit type transmit string identif number uniqu instanc type point devic transmit inform specif type event devic state host comput transmit request host devic set posit motor angl object includ api commun standard built atop microchip connect serial port experi wireless protocol object standard distribut includ softwar modul physic interfac physic design primit devic compon circuit board commun layer end user wire protocol softwar interfac programm activex control object manag commun layer physic devic comput softwar figur architectur connect manag point major api element count integ item programm api discov attach devic event automat gener physic devic connect disconnect comput event return refer interfac programm identifi devic end user plug event automat fire return refer programm discov programm find attach count properti implement layer abstract built atop commun layer monitor devic system creat object pass back interfac object event manag serv transport mediat commun upper layer layer visibl programm object creat manag devic object correspond directli physic devic physic devic correspond defin binari interfac access varieti program languag devic object commun match physic devic object creat run time devic plug interfac gener special interfac requir interfac provid object gener identifi basic properti object return manag devic string boolean long programm discov kind devic refer assign interfac specif serial physic devic attach programm test attach devic option check discrimin multipl instanc attach assign object special interfac interfac superset api special object object api includ properti event handl integ integ integ posit programm find motor set posit receiv event motor reposit object api special interfac programm directli control devic feedback state activex control wrap object give interfac simul capabl activex control correspond graphic standard packag widget wrap special object visual region displai programm choic visibl activex control simul capabl simpler counterpart unlik control visual interfac displai real simul state option mean end user interact programm easili drop visual interfac builder visual control option oper simul mode actual physic devic connect point softwar mimic behavior control includ extens api manag featur activex control illustr figur graphic motor user interact rotat motor posit drag motor reposit actual motor devic attach exampl extend api enabl boolean boolean properti set color control control interact control simul physic devic attach sound architectur surprisingli easi practic section illustr program visual basic program figur shown run figur illustr complet sourc toi applic control servo motor programm interfac builder develop interfac drop activex control convent label displai text messag slider set return valu label textual feedback simul devic connect individu slider posit motor programm set motor posit simul option initi routin connect disconnect physic servo devic event handler end user set posit directli rotat imag motor programm updat posit notifi event handler motor posit chang figur screen snapshot program program work simul mode servo plug behavior simul screen end user interact devic plug physic motor automat rotat current simul motor set program easili detect outlet turn line code slightli complex input output valu input valu gener return event event handler detect print valu gener light report privat index print index end program modest complex peopl replic previou interfac pioneer dangl foot plastic string vibrat amount local ethernet traffic easili recreat program similar illustr figur part code retriev ethernet traffic read motor toi fan broadcast quickli built atop control motor spin hudson inform tube displai pattern bubbl built rapidli switch pump similar origin version built privat pm manag privat set pm manag true servo devic feedback end connect servo devic attach plug privat servo devic set link servo feedback end end servo automat continu simul privat set devic feedback end end servo gener event time posit chang reset posit slider privat posit end user move rotat servo posit privat end figur complet visual basic program interact servo motor architectur extens enrich kind applic build includ softwar compon notif server version notif server implement share dictionari distribut process publish pair dictionari process subscrib pattern match automat inform pair event simpl program groupwar base physic devic applic captur presenc publish share dictionari applic subscrib inform activ physic devic applic rotat shown figur turn lamp program control interconnect devic surprisingli short easi code creat widget similar combin abstract publish contextu read share applic valu monitor react contextu current architectur handl limit manag abstract commun layer architectur compon extend support commun bluetooth evalu mention goal provid programm physic devic simpl develop concentr modif recombin devic physic user interfac lowlevel devic construct easi averag programm program extend evalu design achiev gave hardwar softwar comput scienc undergradu human comput interact student prior experi build physic devic student worth final grade comput scienc professor design varieti plan demonstr confer make demonstr show practic design imagin interfac interfac creat fun gear offic peopl formal evalu metric student design found difficult program result student successfulli complet project student report spend modest time rang hour dai report effort spent physic build interact devic displai exampl report time work softwar develop easi student trivial chosen sensor switch connector student demonstr project teach hci graduat student particip impress high qualiti work creativ demonstr frequent accompani posit illustr student project necessarili chosen illustr print video figur illustr exampl flower bloom arrang made artifici flower central larg flower bloom program control continuum rang close fulli bloom heart servo motor control guidelin retract flower pull leav power power lamp brant abil vari voltag suppli provid built screw servo motor rotat program control vari amount power close figur flower bloom partial bloom fulli bloom outlet servo motor rotat shade fan figur power figur power lamp figur open fulli open attach volt outlet creat power plug fan mount beneath lamp rotat rotat adjust intens light fan turn affect rotat lamp shade harp oliv began commerci circul water small make figur harp cradl phone miss call dial figur miss call continu light base water ad light sensor clai funnel water sensor water beneath program backend softwar music chord plai light sensor block small time durat effect produc peopl water move finger block music chord plai ey construct fake string glue ey open close posit servo pupil light led connect interfac miss call devic call miss cell phone carri made cardboard cradl cell forc sensor connect monitor read softwar program detect phone phone vibrat rang softwar displai phone statu icon window task physic cardboard dial dial posit control servo motor dial show phone cradl time call answer person phone automat reset exampl project includ illustr figur due lack space reli inform publish share dictionari track statu remot peopl water lamp project pattern light ceil show statu peopl light project water servo motor corner select disturb water rate disturb depend onlin activ valu peopl applianc similar bird bird wiggl remot person contact owner place cloth set statu share dictionari bird control light sensor detect sudden dark cardboard vertic gaug temperatur humid inform major citi extract exist internet gaug servo motor manual lift lower string hold point correct posit gaug softwar includ abil calibr physic gaug combin servo motor dip bubbl stick bubbl rotat stick posit front fan connect bubbl email email cardboard posit desk rotat face round mail disk soft shoot hit fall lap servo motor rotat pull trigger gun hidden insid box evalu summari clear creativ scope project goal design met exampl student concentr interfac design lowlevel electron devic combin extend fairli simpl imagin wai state widget make gui easi make gener physic interfac easi develop relat work list exampl physic user built custom devic softwar idea wrap physic devic make easi program replic obviou find systemat work design isol instanc devic commerci video camera board includ sdk wrap access physic camera easi program devic hack version graphic entiti welldefin api varieti circuit board develop programm work hardwar tini internet handi peopl experi robot control applic micro control mit laboratori programm control varieti raw devic digit analog ir output lcd dc motor resembl physic handi board target person educ robot project programm develop program download board run autonom behav side architectur figur miss suspect handi board version fashion straightforward version handi board context toolkit leverag notion widget creat context widget context widget gather contextu inform abstract make inform programm sourc contextu inform actual physic devic call intern defin part api activ widget api attribut give abstract activ callback activ actual gener base implement inform infrar video imag context widget combin abstract inform collect gener context toolkit facilit build gener gener simplifi actual devic incorpor context widget previou work lower level abstract handi higher level context recogn idea found scatter product differ concept empow averag programm build physic user contribut systemat descript architectur design main messag packag devic physic widget greatli simplifi program turn design concentr physic user interfac craft implement detail revolutionari suspect exist packag devic intern real push standard commerci devic real peopl talk develop system base physic start scratch left evolv de facto standard set exist gui virtual set includ list text box unclear includ standard set candid includ built suggest devic includ physic user gui set provid programm conceptu build block individu assembl design build rich physic interfac critic mass huge mass wide adopt program commun softwar hardwar avail softwar decid distribut hardwar schemat contact author inform acknowledg creativ student undergradu project includ exampl michael boyl contribut greatli discuss architectur collabor start microsoft research collabor multimedia nation scienc engin research council alberta softwar engin research consortium partial fund work refer human interact comput ibm system journal water lamp ambient project digit inform architectur space summari chi conceptu framework toolkit support rapid prototyp applic comput vol digit physic surrog mediat commun privaci media space person technolog elsevi displai casual awar demonstr acm inform ambient inform displai decor object proc acm tangibl seamless interfac bit atom proc acm bottl minim interfac access digit inform extend abstract acm softwar tool programm embodi agent proc acm guid lego robot press state art user interfac softwar tool read human comput year morgan da comput mit notif server synchron groupwar proc acm behavior construct kit commun acm design calm technolog design interact electron label physic proc acm chi
DB/1673 3 ldap directori cach sophi cluet inria rocquencourt olga divesh srivastava introduct ldap directori access network directori recent growth larg number directori server implement compani critic sun tandem wide varieti applic store address book contact inform person network resourc network servic polici network directori highli distribut inform system directori entri organ hierarch namespac access distinguish declar queri system provid mean manag conceptu uniti autonomi multipl directori server network achiev fast perform high avail desir cach inform close applic access directori inform client cach establish effect scale perform architectur physic cach directori entri occur ldap cach data restrict access distinguish object refer oo access declar queri recent interest area client cach effici handl declar queri semant inform reason semant inform includ client autonomi reduc commun problem cach ldap directori entri answer ldap queri develop suit queri transform captur semant ldap design sound complet algorithm determin conjunct ldap queri posit queri templat demonstr practic algorithm real applic preliminari perform base sampl queri directori enabl applic lab relat problem find complet rewrit queri view kei conceptu differ due fact seek rewrit origin queri term semant cach evalu origin queri cach directori instanc differ ldap data model queri languag make previou result section ldap directori data model queri languag ldap directori schema ldap directori schema consist set class class set requir attribut set attribut schema defin independ set class model maintain global attribut class type mean figur fragment ldap directori schema lab schema exampl paper ldap directori entri ldap model forest singl data structur call node forest entri entri distinguish consist set pair hold singl piec inform type definit entri captur ffl schema entri valu attribut belong class attribut ffl requir entri requir attribut class class extern class class lip class requir requir requir requir cn cn local cn tel mail tel figur schema ldap directori ffl class entri belong class distinguish induc hierarchi entri directori instanc note oo class hierarchi schema element detail german result techniqu directori entri schema figur sophi ldap queri languag ldap directori entri access declar ldap queri ldap queri consist base search set project attribut atom ldap filter compar individu attribut test presenc substr comparison attribut atom ldap filter combin standard boolean complex ldap filter retriev entri pose answer queri set consist entri queri restrict project attribut analog relat point view import note project attribut queri includ attribut ensur answer queri directori closur properti satisfi ldap queri scope base scope search space queri paper extens algorithm result difficult repres ldap queri filter set project attribut set attribut schema queri sourc flexibl advantag ldap make attract network applic ldap data model defin hierarch namespac entri enabl highli distribut manag entri directori server permit conceptu unifi view data directori data model repres manipul heterogen inher network entiti natur flexibl critic ensur autonomi directori entri valu attribut definit requir singl class union attribut oo model entri belong set class attribut directori entri multipl valu attribut ldap directori data model share flexibl model data time effect address specif network directori applic ldap directori cach client cach store subset data succinctli identifi subset ldap directori cach store subset entri directori semant descript data semant descript consist schema ldap directori set qt cach queri templat cach answer queri templat semant descript cach decoupl data store cach answer individu templat cach directori instanc made fact answer queri distinguish input directori instanc directori cach avoid replic cach entri directli manag independ directori templat cach pose gener pose exact mechan templat creat scope paper queri evalu cach directori instanc result complet miss data sound negat compar result queri evalu directori address problem determin queri complet answer directori semant descript qt directori cach lack posit conjunct posit conjunct templat semant cach descript algorithm build algorithm determin step start simpl case templat restrict kind directori schema add project templat illustr impact merg entri cach queri schema simpl case schema singl class attribut lip figur attribut templat qt suffici condit queri exist templat qt qt syntact restrict qt qt easili check simplifi filter standard condit ldap queri syntact constrain relat oo select entri belong specif class queri templat qt directori constrain entri class lip directori data cach qt make schema class explicit conjoin express form queri sound complet algorithm simpl case ad project templat remov restrict templat qt check simpl cach entri satisfi queri cach entri project attribut queri note entri merg attribut cach entri obtain result templat queri templat qt qt qt qt order check queri filter cach entri attribut mention queri absenc attribut modifi queri result queri templat qt qt satisfi cach entri gender qt entri gender directori algorithm sc syntact essenti check condit compar queri templat cach algorithm make addit fs present lack space remov attribut project attribut present directori entri answer fs simplifi filter standard condit complet connect project attribut exist attribut algorithm conjunct aq return aq attribut fq aq templat qt qt return posit return fq pure pure neg attribut conjunct return aq return return illustr queri qt qt qt cach entri valu cn attribut algorithm conjunct aq attribut aq conjunct queri return algorithm conjunct aq aq fa aq return algorithm ac attribut materi inform make explicit semistructur natur fact entri satisfi queri filter project consid answer queri split queri conjunct answer valu answer queri valu attribut note ac gener conjunct origin queri gener ldap schema schema requir attribut flexibl ldap model result queri standard logic captur axiom section present algorithm pe posit captur infer axiom posit atom conjunct form queri filter expand conjoin class schema attribut requir attribut class conjoin filter util algorithm pe illustr queri templat qt gender attribut class requir attribut qt algorithm conjunct aq posit conjunct fq queri return algorithm conjunct aq fq temp class aq temp temp return temp algorithm class temp true temp return temp conjunct underlin filter treat special algorithm sc conjunct test queri filter syntact restrict templat templat project attribut check attribut exclud initi algorithm sc check cach entri belong class suffic origin directori entri valu requir attribut class present transform pe input conjunct comput set conjunct queri conjunct queri syntact check algorithm sc posit templat posit transform combin sound complet algorithm result order evalu practic benefit approach implement algorithm conduct experi sampl queri directori enabl applic lab observ queri conjunct result show algorithm larg number execut time algorithm small compar time evalu queri directori scalabl implement queri transform algorithm scalabl fashion templat store hash tabl base set class attribut mention templat fast retriev relev templat queri good scalabl number templat augment version complet netscap directori server schema vari number templat conjunct averag execut time multipl run randomli select averag time ldap directori local machin client ldap directori distant machin local area directori thousand indic relev attribut effici answer queri tabl maximum averag ratio execut time algorithm queri evalu time directori ratio total execut time cach queri queri evalu time directori server min max avg min max avg assum hit rate cach achiev reduct averag queri time larger ratio result higher benefit futur work problem remain mention pursu determin arbitrari conjunct cach answer portion cach refer wiener lorel queri languag semistructur data journal digit suciu queri languag optim techniqu unstructur data acm sigmod confer manag june tan semant data cach replac intern confer larg page naughton cach queri chunk acm sigmod confer manag suciu queri languag manag system sigmod sept franklin client data foundat high perform object system kluwer academ ldap world implement survei srivastava answer queri view acm symposium principl san papakonstantin adm view ieee data engin june
ML/1674 6 neural comput research group dept comput scienc appli mathemat birmingham unit kingdom mixtur probabilist princip compon michael tip microsoft research st georg street cambridg uk christoph bishop microsoft research st georg street cambridg uk technic report juli neural comput abstract princip compon analysi popular techniqu compress ectiv limit global linear nonlinear variant pca altern paradigm captur data complex combin local linear pca project convent pca correspond probabl uniqu combin pca model previou attempt formul mixtur model pca extent ad hoc pca formul base speci form gaussian latent variabl model lead ned mixtur model probabilist princip compon paramet determin em algorithm discuss advantag model context densiti model local demonstr applic imag compress handwritten digit recognit mixtur probabilist princip compon introduct princip compon analysi proven exceedingli popular techniqu reduct discuss length text multivari analysi applic area includ data imag pattern regress time seri predict common de nition due hotel set observ data vector ft princip ax orthonorm ax retain varianc project maxim shown vector domin eigenvector largest sampl covari matrix sw sampl vector xn reduc observ vector complementari properti close relat origin discuss pearson project princip subspac minim squar reconstruct error kt optim linear reconstruct xn orthogon column span space lead eigenvector princip compon project transform limit disadvantag de nition pca absenc probabl densiti gener model deriv pca perspect densiti estim er number import advantag includ likelihood permit comparison techniqu facilit statist test bayesian infer method appli model combin likelihood prior classi pca model posterior probabl class membership comput contrast altern applic pca classi cation oja hinton al probabl densiti function measur novelti data altern approach al petsch al pca probabl model er methodolog obtain princip compon project data valu miss singl pca model extend mixtur model nal advantag signi pca de ne linear project scope applic necessarili limit natur motiv develop nonlinear princip compon analysi ort retain greater proport varianc fewer compon exampl includ princip curv stuetzl tibshirani neural network approach webb gener topograph william altern paradigm global nonlinear approach model nonlinear structur local linear mixtur probabilist princip compon philosophi attract expert techniqu regress jacob number implement pca de ne di erent variat varieti approach consequ ambigu formul model current method local pca gener necessit partit data space estim princip subspac partit standard euclidean cluster perform partit reconstruct error criterion cluster assign convei advantag common cost measur stage recent model adopt cost measur de ne di erent algorithm leen varieti altern approach combin local pca model al bregler omohundro hinton al haykin algorithm de ne probabl densiti implement cluster partit phase leen cost function inevit erenti ness problem partit assign data algorithm data point assign princip compon share author absenc probabl model pca limit approach jth reconstruct data point nj exp exp reconstruct cost model determin maxim explicit algorithm unnecessari requir introduct varianc paramet probabl densiti de ned kei result deriv probabilist model pca mixtur local pca model natur extens model paramet estim maxim singl likelihood function lead de ned uniqu convei advantag probabl densiti function nal model bene ts outlin section describ concept latent variabl model introduc probabilist princip compon analysi section show princip subspac set data vector obtain framework extend result mixtur model section outlin em algorithm estim model paramet mixtur probabilist princip compon partit data estim local princip ax automat link algorithm implicitli incorpor soft cluster similar implement hinton al paramet natur model simpl interpret determin em procedur updat model paramet mixtur model wide discuss advantag distinct perspect section reduct data compress local linear model demonstr oper algorithm simpl toi compar perform explicit model method synthet dataset perspect gener gaussian mixtur mixtur model er mixtur probabilist princip compon control number paramet estim covari structur high model exibl demonstr properti section appli approach classi cation imag handwritten digit proof kei result algorithm detail left latent variabl model pca latent variabl model latent variabl model seek relat observ data vector vector latent variabl function latent variabl paramet process latent variabl er parsimoni descript data de ning prior distribut distribut equat induc distribut data model paramet determin techniqu model term data vector gener sampl distribut appli factor analysi common latent variabl model statist factor analysi map linear function latent variabl de ned independ gaussian unit model gaussian paramet matrix factor load paramet permit data model observ vector distribut model covari result invari orthogon rotat kei motiv model diagon observ variabl independ latent intent depend data variabl explain smaller number latent variabl repres varianc uniqu observ variabl contrast convent ectiv treat varianc covari ident note analyt solut valu determin iter procedur link factor analysi pca factor analysi subspac de ned column gener correspond princip subspac data link method note observ factor load princip ax mixtur probabilist princip compon similar situat estim element turn approxim equal rao impli result fact model pca emerg smallest eigenvalu sampl covari matrix equal residu consid case model covari ident data sampl counterpart factor load varianc identi correct choic determin analyt resort iter establish link pca requir minor eigenvalu sampl covari matrix equal impli covari model exact assumpt rare justi ed exploit pca requir exact covari structur minor inform ectiv real interest residu model form solut model covari ident data sampl counterpart show section pca emerg case approxim model link factor analysi pca partial explor earli factor analysi literatur anderson rubin author show solut approxim case relat eigenvector sampl covari show princip eigenvector made addit assumpt section appendix extend earlier work give full properti model term speci column estim wml shown span princip subspac data probabilist pca probabl model case isotrop equat impli probabl distribut form exp kt wx gaussian prior latent variabl de ned exp obtain margin distribut form jcj exp model covari mixtur probabilist princip compon posterior distribut latent variabl observ mj exp posterior covari matrix note observ data model ln ln jcj tr sampl covari matrix observ ft properti estim easili estim paramet ml estim paramet weight matrix maxim column span princip subspac data show deriv respect sc appendix shown stationari point occur column vector matrix eigenvector eigenvalu diagon matrix arbitrari orthogon rotat matrix shown stationari point global maximum likelihood occur princip eigenvector eigenvalu eigenvalu index order magnitud combin eigenvector repres likelihood surfac latent variabl model de ned equat ect map latent space princip subspac observ data mixtur probabilist princip compon varianc shown wml estim ml smallest eigenvalu ml clear interpret averag varianc discard dimens reduct optim reconstruct implement probabilist gener rst comput usual approach ml found wml de ne densiti model advantag list section exploit convent transform data point xn reconstruct xn similarli achiev formul note probabilist gener model de ned equat repres map latent space data space probabilist analogu reduct process convent pca invert condit distribut equat give data point repres latent space singl gaussian posterior distribut de ned altern standard pca project conveni summari distribut posterior ml quantiti natur comput em implement consid section covari posterior distribut constant data point equat wml optim linear reconstruct fact wml orthogon project consequ gaussian prior posterior project skew origin limit project wml wml ml wml ml orthogon convent densiti model singular und ned limit optim linear reconstruct data posterior vector obtain appendix wml ml wml ident reconstruct error convent pca reason probabilist eleg exploit posterior vector materi bene note addit convent pca vector xn ml equal loss reconstruct wml ml wml xn mixtur probabilist princip compon em algorithm simpl extens em formul paramet estim standard linear factor analysi model thayer obtain princip compon project maxim likelihood function suggest approach necessarili adopt probabilist pca princip ax estim convent subsequ incorpor probabl model equat advantag outlin introduct discuss appendix advantag em approach larg present requir comput covari explicit deriv em algorithm properti comput perspect appendix factor analysi revisit probabilist pca algorithm obtain introduc constraint matrix factor analysi latent variabl model appar minor modi cation lead signi di erenc behaviour method show covari properti model ident convent di erent standard factor analysi linear transform data transform maximum likelihood solut transform ml ml covari matrix transform asa latent variabl ln tr gener covari matrix transform log likelihood transform ln jaj wml ml maximum likelihood solut origin maximum likelihood solut transform data set gener form solut preserv transform special case diagon case factor analysi remain diagon provid diagon matrix factor analysi covari rescal data scale factor simpli absorb rescal row rescal factor case transform covari aa proport unit matrix word orthogon matrix transform data vector multipl orthogon matrix correspond rotat coordin system covari properti share standard pca rotat coordin induc rotat princip ax factor analysi covari pca covari illustr figur mixtur probabilist princip compon figur factor analysi covari rescal data variabl pca probabilist pca covari rotat data space coordin mixtur probabilist princip compon associ probabl model pca er tempt prospect model complex data structur combin local pca model mechan mixtur probabilist princip compon bishop formul permit model paramet determin partit data determin respect princip ax occur automat likelihood maxim observ data set mixtur model ln ln singl model mix note separ vector mixtur paramet relat model recent exploit data visual tip similar base standard factor analysi diagon emploi handwritten digit recognit al implement pca mixtur probabilist princip compon gener model mixtur case requir random choic mixtur compon proport sampl distribut appli equat singl model care paramet data point posterior distribut latent space develop iter em algorithm optim model paramet ni posterior mixtur gener data point ni appendix shown obtain paramet ni ni ni updat correspond standard gaussian mixtur formul bishop appendix shown combin lead intuit result ax varianc determin local covari ni standard manner singl model note earlier section appendix larger valu data comput advantag obtain updat iter em schedul discuss mixtur model appendix iter equat sequenc comput equat iter updat appendix local maximum converg algorithm weight matrix span princip subspac respect section applic mixtur begin data compress reconstruct task gener densiti model section local linear reduct section begin give illustr applic mixtur algorithm synthet data set realist exampl emphasi case princip compon approach motiv object deriv data reconstruct minimum error contrast cluster mechan mixtur model hard cluster approach base explicitli reconstruct error typic algorithm mixtur probabilist princip compon illustr synthet data demonstr mixtur gener synthet dataset data point sampl uniformli surfac addit gaussian figur show data mixtur probabilist princip compon tted data em algorithm outlin previou latent space probabilist gener model data de ned plot set data obtain sampl tted gener model data point shown figur histogram distanc data point accuraci model captur structur underli gener distanc sphere distanc sphere figur model noisi data synthet histogram euclidean distanc data point sphere similarli data gener tted mixtur model cluster mechan gener local pca model form illustr prompt ultim goal accur data reconstruct motiv leen hinton al squar reconstruct error cluster criterion mixtur probabilist princip compon partit phase haykin adopt similar approach imag model set independ paramet reconstruct data point assign compon reconstruct lowest princip ax cluster mixtur data point assign mixtur compon soft ni mixtur compon gener ni constant ni gain insight cluster probabl densiti compon data point jc exp ni ni express matrix term singular decomposit individu mixtur compon subscript omit notat matrix orthonorm column vector arbitrari orthogon matrix singular valu loss term diagon matrix data point express term basi vector vector perpendicular complet orthonorm set de ne zn written zn diagon matrix rec partit element project subspac span project perpendicular subspac rec squar reconstruct error interpret error term note matrix eigenvector local covari matrix ni exp rec equal prior cluster assign soft cluster data point li subspac distant compon reconstruct li close compon ect varianc moder contribut rec compon data point assign nearer compon reconstruct error distant larg mixtur probabilist princip compon mixtur cluster result nal reconstruct error inferior cluster model base explicitli reconstruct criterion clear cluster data proxim subspac necessarili result partit note consid relationship algorithm probabilist simpli illustr figur collect convent pca model tted algorithm leen de ned select initi cluster centr random point assign data point nearest term euclidean cluster centr set vector rst princip ax covari matrix cluster assign data point cluster reconstruct set data point assign cluster repeat cluster alloc constant figur comparison partit ect model mixtur model illustr boundari delin region reconstruct local pca model region shown shade cluster reconstruct error result partit circular ect occur princip compon plane intersect beneath surfac figur data point sampl alloc cluster reconstruct left plot show partit lowest reconstruct model obtain run algorithm plot show similar partit greatest mixtur model number run note boundari illustr plot obtain assign base reconstruct error nal ident fashion probabilist partit form cluster reconstruct error exempli ed shade compon phenomenon contrari philosophi local reduct indirect consequ fact local pca model data probabilist expect algorithm er perform term reconstruct error nal design explicitli optim mixtur probabilist princip compon data set descript synthet data oil diagnost measur oil pipelin ow digit imag handwritten digit digit imag handwritten digit imag block photograph imag eeg delai vector eeg time seri signal tabl dataset comparison cluster criteria oil imag eeg dataset train set oil imag eeg dataset test set figur reconstruct error local pca mixtur error shown rel averag run random initi con gurat measur order test compar algorithm mixtur model data detail tabl figur reconstruct error respect model perform expect note interest aspect result case nal reconstruct error model train test set fact partit data space base partial reconstruct error behaviour mixtur probabilist princip compon result structur dataset oil data number local cluster structur bishop tip visual oil observ model found algorithm exhibit partit shown figur span disjoint cluster structur evid figur suggest model repres poor local minima reconstruct error cost function mixtur algorithm low likelihood due local impli densiti model experi avoid poor mixtur model solut lower reconstruct error observ appli case oil dataset digit imag eeg train data manifold disjoint explicit superior digit algorithm approxim aspect figur suggest mixtur model algorithm sensit tting compar train error test set algorithm error comparison isnt shown figur except case digit data mixtur model smaller ect dramat imag data superior test set test exampl deriv separ portion imag test set statist expect di er signi cantli respect train set exampl explan cluster mixtur inher ect occur estim local set princip ax set ax determin local covari matrix gener uenc data subset cluster implement paramet matrix cluster constrain data point neighbour cluster extent notion discuss context regress jordan jacob motiv expert author note reduc varianc term draw rm limit set evid figur point presenc ect imag compress practic applic mixtur model block transform imag code figur show origin imag pixel imag segment give total dataset vector half left half train data half reserv ed portion test imag shown figur reconstruct entir imag base rst princip compon singl pca model determin left half imag shown figur mixtur probabilist princip compon figur origin imag detail figur pca reconstruct figur mixtur reconstruct figur mixtur probabilist princip compon figur show reconstruct origin imag model mixtur probabilist princip compon model paramet estim left half imag compon model likelihood imag code perform fashion alloc data compon lowest reconstruct error result code imag uniformli bit alloc equal transform reconstruct order give nal compress figur cost encod mixtur compon label includ simpl princip subspac test error mixtur algorithm gave test error densiti model popular approach densiti estim gaussian mixtur model model su er limit gaussian compon full covari independ covari paramet estim mixtur compon data space number data point requir paramet reliabl prohibit altern reduc number paramet place constraint form covari matrix introduc prior paramet full covari implement tresp common constraint restrict covari isotrop diagon isotrop model highli constrain assign singl paramet describ entir covari structur full dimens diagon model princip ax ellipt gaussian align data ax individu mixtur compon unabl captur correl variabl mixtur covari gaussian relat dq free paramet term account number paramet arbitrari rotat permit number paramet control choic model isotrop gaussian gener covari gaussian recov synthet noisi spiral data util mixtur approach demonstr simpl point data set gener spiral con gurat ad gaussian data model mixtur model mixtur diagon covari mixtur compon mixtur varianc paramet compon compar diagon model result figur illustr project data orient diagon model coincid local data result axial align constraint consequ diagon mean implicitli constrain tend lie tangent spiral parallel axi end elev qualit altern mixtur factor implement hinton al paramet mixtur probabilist princip compon diagon gaussian mixtur figur comparison diagon varianc gaussian mixtur model mixtur model upper plot give view perpendicular major axi lower plot show end elev covari structur mixtur compon shown project unit mahalanobi distanc bracket gure superior approach underlin quantit data point bracket gure result expect model extra paramet mixtur similar result observ spiral space higher extra paramet relev intuit axial align constraint diagon model inappropri model smooth continu lower manifold higher approach track spiral manifold successfulli demonstr import number paramet model spiral data set data point number data point reduc diagon full covari gaussian mixtur mixtur model data point train data unseen test set data tabl expect case limit full covari model exhibit likelihood train test set perform mixtur mixtur probabilist princip compon isotrop diagon full train test tabl data point measur train test set gaussian mixtur model compon train set simpl intermedi isotrop full covari case realist model er choic rang determin standard techniqu model select note advantag limit mixtur equal exploit case singl gaussian distribut handwritten digit recognit potenti applic densiti model handwritten digit recognit exampl pixel imag digit gener lie smooth continu geometri determin properti digit scale thick stroke approach classi cation digit necessarili build model digit classifi unseen digit model hinton al gave excel discuss handwritten digit appli mixtur pca soft classi cation scale smooth imag postal servic model construct subset data set split train valid test set classi ed model reconstruct digit repeat experi data mixtur approach choic paramet valu nal mean compon illustr digit form gure digit classi method classi model valid set misclassi ed digit test set hinton al report error expect improv result partli cluster valu global advantag methodolog de nition densiti model permit posterior probabl class membership comput digit subsequ classi reconstruct error classi cation largest posterior probabl model result invest signi ort optim paramet model provid compar perform classi er valid set misclassi ed test set addit bene posterior probabl reject proport test sampl classi er improv classi cation perform approach reject test exampl result misclassi cation rate avail posterior advantag form mixtur probabilist princip compon figur vector illustr ten digit model model digit mixtur ten centr pixel vector shown row note di erent compon captur di erent style digit model complex data combin simpl linear model attract paradigm er comput algorithm advantag interpret paper exploit de nition probabilist model pca order combin local pca model framework probabilist mixtur paramet determin em algorithm addit ned natur result primari advantag approach de nition observ densiti model disadvantag probabilist approach combin local pca model optim likelihood mixtur model directli minim squar reconstruct error applic salient algorithm explicitli minim reconstruct error expect superior experi show gener import caveat consid rm drawn suitabl model dataset consid paper nal mixtur model superior squar reconstruct train set demonstr algorithm incorpor cluster necessarili gener local cluster reason dataset number disjoint data phenomenon lead poor local minima minima found densiti mixtur probabilist princip compon model approach evid smooth impli soft cluster inher mixtur model reduc case imag compress experi statist test data set di er train data exampl instanc reconstruct test error model lower term gaussian mixtur mixtur probabilist princip compon enabl data model high dimens free time gener inappropri constraint covari structur number free paramet control choic latent space dimens interpol model complex isotrop full covari structur demonstr perform handwritten digit recognit task work support epsrc contract neural network visual high data michael suppli handwritten digit data process form refer asymptot theori princip compon analysi annal mathemat statist rubin statist infer factor analysi berkelei symposium mathemat statist volum pp latent variabl model factor analysi charl statist factor analysi relat method wilei neural network pattern recognit clarendon press william gener topograph map neural comput tip hierarch latent variabl model data visual ieee transact pattern analysi machin intellig omohundro nonlinear imag interpol manifold learn leen advanc neural inform process system pp mit press rand local adapt base dynam system nonlinear rubin maximum likelihood incomplet data em algorithm journal royal statist haykin optim adapt transform code ieee transact imag process stuetzl princip curv journal american statist associ model manifold imag handwritten digit ieee transact neural network dayan recogn handwritten digit mixtur linear model leen advanc neural inform process system pp mit press analysi complex statist variabl princip compon journal educ psycholog mixtur probabilist princip compon handwritten text recognit research ieee transact pattern analysi machin intellig novelti detect approach classi cation fourteenth intern confer arti cial pp princip compon analysi jacob hierarch mixtur expert em algorithm neural comput local model gaussian mixtur model statist data process ph oregon graduat center spoken languag understand leen dimens reduct local princip compon analysi neural comput nonlinear princip compon analysi neural network journal marriott multivari analysi part classi covari structur repeat measur edward arnold modi ed method estim factor analysi larg sampl result uppsala symposium psycholog factor number monograph pp subspac method pattern recognit john wilei tresp improv gaussian mixtur densiti estim bayesian penalti term network averag hasselmo advanc neural inform process system pp mit press line plane closest system point space edinburgh dublin philosoph magazin journal sixth seri neural network induct motor failur predict hasselmo advanc neural inform process system pp mit press estim test signi canc factor analysi thayer em algorithm ml factor analysi princip curv revisit statist comput bishop mixtur princip compon iee intern confer arti cial neural pp iee statist analysi finit mixtur distribut wilei approach nonlinear princip radial symmetr kernel function statist comput mixtur probabilist princip compon pca stationari point gradient respect obtain standard matrix di erenti result marriott sc stationari sc assum exist condit densiti model remain restrict case shortli assumpt impli loss practic class solut equat shown minimum covari model discuss pp consid section unrealist case exact covari smallest eigenvalu ident equal identi squar matrix column eigenvector diagon matrix arbitrari orthogon matrix sc interest case model covari equal sampl covari express weight matrix term singular matrix orthonorm column diagon matrix singular orthogon matrix stationari sc impli equat impli column vector eigenvector eigenvalu mixtur probabilist princip compon arbitrari recov case potenti solut written matrix column eigenvector diagon matrix eigenvalu case arbitrari orthogon rotat princip subspac global maximum likelihood matrix eigenvector identifi maxim express substitut function give ln number eigenvalu maxim respect ln note impli state earlier maximum respect choic retain fq dg exploit constanc sum eigenvalu respect condit maxim likelihood express minim quantiti ln conveni depend discard valu minim rst assum discard eigenvalu chosen di singl ect mixtur probabilist princip compon convex singl minimum equal discard eigenvalu eigenvalu discret exchang retain eigenvalu li current retain swap eigenvalu combin discard eigenvalu includ occupi retain sequenc adjac eigenvalu lower minim discard eigenvalu chosen adjac order eigenvalu show smallest eigenvalu discard order maxim likelihood constraint equat impli real solut stationari equat retain eigenvalu averag discard condit violat smallest eigenvalu discard combin previou minim smallest eigenvalu maxim princip eigenvalu note respect fewest term sum occur minim case natur stationari point stationari point repres minor eigenvector solut stabl maxima local maxim em algorithm princip eigenvector minor eigenvector solut fact saddl point likelihood surfac stationari point arbitrari eigenvector eigenvalu examin natur stationari point small perturb form arbitrarili small posit constant matrix column eigenvector potenti eigenvector individu appli column elucid natur stationari point evalu product perturb gradient treat paramet matrix deriv singl column product neg stationari point stabl repres maximum de ning evalu cg sc ignor term cg mixtur probabilist princip compon stationari point substitut cg matrix diagon element eigenvalu sign product gradient perturb sign sign pr sign sign posit de nite kw diagon element posit kw express neg maximum stabl saddl point case kw stationari point gener stabl averag eigenvalu ident case consid shortli perturb stabl maximum occur princip equal eigenvalu equal princip eigenvalu ect maximum likelihood estim term convent instanc minor equal ident retain eigenvalu case sampl covari extract compon data covari matrix possess eigenvalu princip axi uniqu de ned minor subspac spheric distribut de ned addit explain residu optim explain princip compon equat ectiv singl vector combin singl vector distribut repres maximum eigenvector de ned em algorithm em approach latent variabl data valu estim straightforward equat appli standard techniqu dont xn gener joint distribut observ latent calcul expect em algorithm calcul respect posterior distribut xn observ comput paramet valu determin maxim expect mixtur probabilist princip compon likelihood local maximum rubin lc ln xn equat xn exp kt exp xn expect respect distribut jt ln tr kt tr omit term independ model paramet note statist comput current valu simpli posterior equat equat conjunct posterior covari equat maxim respect di erenti equat set deriv kt tr maxim likelihood statist posterior distribut calcul equat maxim equat equat iter sequenc algorithm judg converg gain insight oper equat substitut care manipul lead combin tr mixtur probabilist princip compon note rst instanc equat instanc calcul equat equat data enter em formul covari matrix expect algebra conveni express em algorithm term note care implement obtain comput save explicitli evalu covari comput inspect complex ect fact term sw tr comput complex sw comput form nding explicitli comput singl model case em algorithm potenti gain depend number iter requir obtain desir accuraci ratio implement model data found iter approach rotat ambigu determin iter method maxim likelihood wml desir true princip ax princip arbitrari rotat matrix present rotat ambigu exist factor iter pca algorithm determin actual princip ax algorithm contraint ax probabilist found ml wml impli comput matrix eigenvector matrix ml wml found invert rotat wml rotat ambigu resolv consequ scale eigenvector prior rotat ml wml eigenvector remain ambigu note nding eigenvector directli requir obtain wml requir optim reconstruct motiv adopt pca notabl data properti optim linear reconstruct orthogon project reconstruct error rec kt ba minim column span princip subspac data covari simpli loss assum data mixtur probabilist princip compon similarli obtain properti probabilist determin exact orthogon project nding optim reconstruct posterior vector simpli minim rec kt ik reconstruct matrix linear regress problem give substitut gener result project wml optim reconstruct matrix expect orthogon project implic data compress maximum likelihood variabl transmit channel origin data vector optim reconstruct equat paramet substitut equat rec term repres expect squar reconstruct error dimens em mixtur probabilist pca mixtur probabilist princip compon mixtur latent variabl model model distribut form singl probabilist pca model mix proport paramet mixtur model determin extens em algorithm begin standard form em algorithm model highlight number limit show form em lead algorithm rst note addit set ni model miss data includ variabl ni label model gener data point point deriv standard em algorithm log likelihood form lc ni ni start valu paramet rst evalu posterior probabl ni similarli evalu expect hx ni hx ni ni hx ni hx ni ni hx ni ni mixtur probabilist princip compon expect lc respect posterior distribut obtain ni ln ln tr ni ni kt ni hx ni tr hx ni ni denot expect respect posterior distribut ni ni term independ model paramet omit involv maxim respect obtain valu paramet maxim respect account constraint achiev lagrang multipli bishop maxim result maxim respect remain equat ni ni ni hx ni ni ni ni ni hx ni ni ni ni kt ni hx ni ni tr hx ni ni symbol denot quantiti adjust note equat manipul requir obtain explicit solut simpli cation improv speed adopt em procedur likelihood function maxim ln compon label ni miss ignor presenc latent variabl expect log likelihood lc ni ln mixtur probabilist princip compon ni repres posterior probabl expect valu ni maxim respect lagrang equat maxim respect rst stage combin em procedur order updat seek lc maxim correspond em algorithm lc likelihood interest introduc miss ni perform cycl em respect paramet stage lc desir advantag approach valu calcul rst stage comput statist posterior distribut ni stage updat valu comput lead improv converg speed advantag stage em simpli cation expand hx ni hx ni ni term inspect expect log likelihood form ni ln ln tr ni ni kt ni hx ni iw tr hx ni ni maxim respect obtain simpli ed tr ni iter equat equat sequenc local maximum likelihood comparison equat earlier show updat mixtur case ident singl local covari matrix substitut global covari matrix stationari weight matrix eigenvector respect local covari matrix perform local data point weight soft similar introduc hinton al automat ect establish result singl iter updat determin likelihood maximum discuss appendix mixtur probabilist princip compon iter em scheme er comput iter approach equat care evalu ni note mixtur unlik singl iter em ni chang nal comput calcul requir matrix oper ww fi comput matrix
DB/1675 3 develop comput aid geograph design system marco antonio claudia ic cp sp brazil de oliveira instituto de informatica cp brazil abstract paper present prototyp develop planner applic ultim goal system present reduc mismatch view geograph realiti implement geograph inform system prototyp offer user possibl applic concept closer view mean object orient geograph data model specif map system intermedi object orient transform underli target geograph dbm prototyp implement object orient dbm introduct geograph inform system short softwar perform data manag retriev oper data term refer data geograph phenomena spatial referenc earth gi increasingli varieti serv develop platform wide rang applic urban plan type applic deal scale properti gi reli dbm data manag oper dbm total encapsul proprietari system system requir user train design manag low level data structur user seldom comput scienc hamper effici gi gi frequent poorli disregard data share evolut cost develop geograph user creat duplic data sourc time applic basic data schema order diminish research group develop object orient call analysi project environ reflect function indian word water amazon area huge leav complex ecosystem present user nice interfac manipul complex structur gi user work plan design applic concept closer understand result design phase map intermedi object orient transform target gi geograph mean special translat base main build ffl geograph object orient data user defin term closer daili work ffl applic design guid user specif step methodolog design applic develop valid distinct applic ffl object orient repres intermedi storag specif level user definit underli geograph dbm paper present version implement prototyp basic consist set tool user design geograph exist data integr design prompt user design ensur proper document design part phd thesi design develop interfac part phd thesi prototyp integr result msc dissert remaind paper organ section outlin data model section introduc architectur prototyp section real section present futur work geograph data model section describ object orient geograph data model adopt spatial data model challeng earli model primarili structur support data geometri topolog model abstract featur relat geograph object orient static tempor evolut account dynam model treat pure mathemat point view exist result year work user area applic conceiv mind user defin applic concept closer view world differ major geograph data model recent literatur ffl usual static process dynam essenti implement constraint function manag data evolut ffl support specif data ffl cf make clear distinct conceptu model geograph data scheme base main class object orient connect class relationship instanc class tempor instanc vari time figur show basic class structur omt notat addit class figur part ad support class discuss section instanc class process document instanc class denot figur thicker associ simplifi notat static model class structur extend relationship tempor facil basic instanc object spatial compon convent describ real world entiti agricultur plan applic handl inform sugar speci fertil store convent class instanc class instanc sugar instanc complex convent compon describ crop distinct convent applic share applic design data spatial dimens instanc model instanc describ region earth surfac special class user model world causal document relationship convent aggreg gener associ version rule process relat time convent project studi area figur basic class discret continu perspect phenomena instanc instanc class spatial descript real world vari accuraci type devic data captur phase order model introduc class hierarchi shown root class time subclass class model distinct type time characterist discret versu versu line variat data acquir tempor properti composit time hierarchi object geograph data model ignor possibl model relationship real world phenomena concern main relationship type express version causal causal relationship dynam model model cover user ffl scalar associ entiti predefin ffl conceptu qualit consid conceptu ffl mathemat quantit defin formula function aggreg relationship directli support object orient notion user treat aggreg relationship associ correspond gener relationship er user establish type connect entiti wood path version relationship user determin connect version singl concept histor version connect distinct scenario plan project dynam model dynam model kei issu simul execut applic user data model ignor requir dynam model abstract tempor behaviour geograph phenomena consid applic user gener state model term chain event trigger geograph entiti condit support activ mechan dynam model base class rule rule instanc repres tupl condit action coher classic approach repres dynam model aspect finit state machin support specif world rule specif integr constraint causal relationship defin design model model chain model phenomena soil type area directli affect veget characterist causal relationship common studi influenc human activ studi impact natur causal relationship global specif fundament process model correspond integr constraint process model process real world typic tempor complex process defin set oper perform comput updat store data process mathemat quantit relationship land surfac model reli heavili flow mechan state formal process paramet describ current water flow updat accomplish execut mathemat model water flow surfac rain factor evapor potenti class process specif process process instanc defin basic tupl input output data function execut constraint ensur process reliabl class model view studi user instanc deriv instanc convent figur symbol obtain process land comput combin data relief econom activ region architectur implement organ conceiv softwar layer coupl gi figur layer correspond intermedi storag translat underli gi user concept data model share mean driver bottom figur logic partit ffl data schema import user request gi enter data schemata ffl data schema defin eventu migrat ffl data schema specif class order design applic add class document context applic design shade box figur class part inher user model treat basic class class project instanc store descript problem object applic class studi area instanc describ spatial extens geograph applic act project studi area class document user record document model user describ mathemat model emploi assumpt made model gi figur partit class defin subclass import driver translat request queri gi export driver map schema point made driver gi depend interfac semant rich defin properti support underli gi tempor user warn export time softwar modul implement figur outlin softwar architectur consist basic modul architectur organ layer user deal higher level enabl dialog user environ layer encapsul modul support user activ model design data retriev manipul activ coordin methodolog encapsul applic design methodolog design layer encapsul data schema translat driver commun underli gi model manipul user interfac methodolog retriev advisor design user gi driver figur modul logic view present built oodbm implement characterist ffl interfac offer direct manipul interfac main task provid facil model design applic methodolog graphic characterist interfac shown screen shot section architectur interfac base implement extend work ffl model design manag dynam process model present user perform static model specif dynam process model restrict specif rule process class associ exist definit object orient method tempor class support tempor data manag featur finish incorpor user prompt schema interact tool section ffl retriev manipul retriev manipul data import retriev modul implement coupl open interfac main type interact present extens permit visual data exploratori permit navig schema instanc convent spatial present data manipul oper updat spatial analysi implement ffl methodolog advisor aid user model design methodolog modul implement model design modul modul directli guid user design prompt provid relev inform request instanti document instanc provid relationship methodolog appli model simplif harm modular architectur ffl driver translat schema data implement test conduct import geograph data directli prompt user design step applic design methodolog defin methodolog reflect work pattern user work map softwar engin applic design procedur consid basic develop evalu plan correspond activ perform prior softwar document object document class definit determin area specif analysi methodolog inventori phase specif data qualiti paramet complement data gather inventori partial support prototyp user exist data enabl data user project document defin similar problem found develop correspond model run simul model gi activ expect perform impli case monitor correspond cross check result applic real life chang applic impli updat data schema mention updat implement prototyp case studi section briefli describ geograph model design test case applic correspond real life develop research state paulo goal applic develop methodolog strategi forecast forest fire risk station paulo state user prompt instanti instanc project design defin data project document studi area instanc creat user prompt exist check data avail figur show screen topmost screen window figur show visual class instanc project instanc creat begin session window visual schema detail object initi activ user start defin process basic involv special identifi relationship user instanc class defin deriv process constraint applic dynam model object class rule action defin rule refer instanc class process schema user prompt system instanti document instanc figur show screen shot definit document instanc describ process creat land class instanc figur show basic class structur applic soil correspond subclass class instanc correspond deriv soil instanc defin process model document requir user includ definit process instanc document class identifi user applic subsequ map ffl convent famili data famili live area ffl power local path highwai class creat subclass instanc correspond discret real world object object view ffl air air humid basic map class creat subclass instanc repres matric grid sampl correspond satellit imag valu obtain remot sensor air interpol surfac area area studi relationship figur defin document properti process ffl power line local causal restrict power local path ffl highwai soil associ relationship indic land buffer parallel road construct ffl air humid air causal relationship trigger comput fire risk factor dry dai dynam model abstract ffl power local path descript geograph coincid power line ffl dai comput fire risk index constraint user constraint rule instanc specif prototyp transform constraint rule instanc process model perform inform layer process gener identifi ffl land instanc combin data soil construct ffl construct appli neighborhood km distanc studi area repres basic map ffl access comput combin highwai local path ffl determin comput relief fire risk defin process correspond process instanc combin instanc air humid air temperatur futur work paper present model design environ gear applic main idea softwar reduc difficulti found user develop geograph applic gi result year work user work research faculti agricultur engin civil engin unlik static dynam advantag intermedi storag system grant independ specif gi data user defin term closer daili work gap user mental model gi implement system valid distinct applic domain figur applic class present subset class implement user access time class causal relationship implement cover specif model reason shown section implement data handl facil finish incorpor version prototyp dynam process model restrict guid user creat rule process class instanc enhanc facil requir adapt extend work develop restrict handl rule context geograph integr constraint user commun design exist data connect underli gi driver preliminari test simul gi extens implement requir write code dedic gi acknowledg project develop de program research report paper partial support research grant grant project dbm bought grant icdt project financ european commun figur refer languag architectur geograph phd decemb carter fundament geograph inform chapter defin geograph inform page american societi photogrammetri remot em sistema de master model object manipul field proc acm workshop advanc page em de para sig xii de de page gi model model page oxford nascimento extens framework scientif applic proc tenth intl conf scientif statist manag evalu fire risk forest area gi technic depart rural geograph data model comput manag time gi proc gi page mainten binari topolog constraint activ proc acm workshop advanc page oliveira queri object orient proc intl conf inform knowledg page oliveira design implement user interfac geograph applic system phd decemb oliveira direct manipul user interfac queri geograph proc int confer applic page environ model design geograph applic de para master octob autom environ model geograph applic phd decemb park design develop architectur geograph inform system proc intl conf inform knowledg page livingston develop spatial model design intl journal geograph inform rumbaugh object orient model design prentic worboi unifi model spatial tempor inform comput
ML/1676 6 proc ieee comput societi confer comput vision pattern june ft pp learn visual discrimin strategi comput scienc depart massachusett ma abstract human learn strategi visual discrimin interact environ discrimin skill refin demand task priori determin featur set task typic incomplet evolv continu work present gener framework learn visual discrimin address characterist base infinit combinatori featur space consist primit featur orient textur composit thereof featur progress sampl space manner simpl recognit procedur queri learn featur rule candid object class suffici exhibit queri featur train imag present sequenti learn increment discov featur recognit result geometr object illustr applic framework introduct extract inform visual data hard problem true artifici half human brain devot directli indirectli vision mechan underli human visual percept poorli substanti evid human visual learn facilit coupl percept action interact learn pai attent perceptu cue behavior import learn recogn distinguish individu object form categori basi relev human abil perceiv distinct primarili determin recognit method emploi visual system work support part nation scienc foundat grant air forc research grant larg learn make distinct demand environ human learn recognit princip identifi schema sensori input match intern object built refin experi differenti hypothesi postul contrast relat learn serv distinguish item psycholog evid argu strong role differenti learn discrimin featur discov unclear featur discoveri hard problem human long time learn distinguish appar base statist featur spatial intens varianc contour densiti infant begin note simpl geometr perform poorli presenc distract cue consist pai attent contour shape ag children begin discov detail geometr relationship skill continu grow childhood work machin recognit concentr schema method compon perform characterist exist machin vision system larg determin priori design featur match algorithm remark effort recent led sophist featur recognit algorithm perform impress close task train data outset work aim improv recognit perform achiev system present method learn discrimin capabl base infinit featur space principl express identifi distinct object featur learn resembl human outlin method design open task visual scene present number natur categori learn initi system section introduc featur space section describ approach high section present detail recognit featur discoveri algorithm result discuss section featur order learn distinct level detail initi larg featur space method gener featur space practic imposs make optim larg featur set emploi simplifi strategi partial order featur space categor featur level structur complex underli assumpt structur simpl featur easier discov discrimin potenti complic aspect learn problem exhaust search featur space sampl featur featur begin lowest level sophist featur requir argu strategi parallel emploi human infant obviou gener infinit partial order featur space primit featur wai yield turn type local imag properti potenti serv primit featur context interact vision gener framework encompass tempor cue addit convent imag properti system emploi type primit orient step edg point imag orient comput effici properti orient tan gaussian geometr combin aspect shape vector multipl orient filter scale scale deriv basi consist filter specif orient comput express local textur characterist primit steer specif orient properti achiev invari respect rotat refer point figur geometr featur order primit featur defin angl distanc orient specif instanc denot primit intuit express type featur composit geometr relat rel angl distanc particip featur long geometr composit assert presenc particip featur make statement geometr topolog relationship featur type primit geometr featur geometr featur note type composit constitut extrem continuum conceiv defin composit assert relax geometr topolog relationship constitu featur comput gener success subsampl imag factor achiev scale invari composit inher toler scale arrang shown figur appli equal triangl size desir properti featur reli explicit contour extract segment avoid open provid robust kind imag degrad paradigm imaginari agent visual distinct possess recognit skill abil search featur space featur interact encount visual scene note behavior relev learn featur scene predict relev gener scenario captur aspect childhood develop contrast current approach machin learn inher sequenti remaind disregard interact aspect simplic discuss system context sequenti object recognit scenario system specif featur task train imag present system predict correct class label system discov featur conjunct learn improv capabl sampl evalu system capabl store train call imag specif recognit algorithm emploi work varieti method appli featur sought recognit featur learn work specif recognit mechan preliminari implement adopt simpl recognit serv illustr interplai featur select recognit recognit idea underli recognit procedur individu featur provid vari evid favor design presenc featur unknown imag consid absenc serv robust respect partial absenc mean impli system uniqu discern class assum learn procedur provid set featur set imag recognit procedur queri individu featur maintain list candid class queri featur serv rule candid leav candid list unalt goal recognit reduc list candid length find featur emploi gener distanc competit tree metric return maxim differ cumul distribut variabl variabl queri maxim metric variabl variabl featur maximum strength max featur imag comput maximum strength involv assert presenc featur measur locat scale assert geometr featur order locat local orient comput equat locat orient refer point featur figur coordin orient point featur comput valu featur strength product strength compon featur strength filter desir orient comput steer equat sin normal maximum occur entir imag strength maximum normal vector pattern vector achiev rotat comput correl vector question steer orient pattern orient comput largest scale toler rel angl grant smooth wide peak sum toler distanc provid size gaussian kernel requir align pixel accuraci strength featur similarli product maximum strength constitu assert featur point suffici small subset salient point imag long point area imag choic salienc function critic emploi canni edg detector low threshold note max comput imag store futur subset candid featur queri maxim imag class featur strength max comput queri imag max made basi accord possibl featur present occlud weaken imag featur recomput candid max max identifi class major imag max remov list candid class notic procedur analog convent step constitut major simplif candid class split current maintain entireti assum densiti unimod gener true practic procedur effect avoid overfit case potenti dynam featur set critic tabl recogn imag fall featur return max ensur max step class major imag max jcj step return typic classif problem involv fix set train imag distinguish effect gener properti result classifi forc system learn featur assumpt unimod close true restrict applic current system object possess characterist featur visibl properti share recognit scheme commonli overcom train multipl object pose procedur iter situat candid class return classif candid mean system total unabl make statement classif featur set exhaust remain list candid class return classif case case classif recognit fail case featur sought solv section entir recognit procedur summar tabl note threshold principl construct special type tree expect time recogn unknown imag logarithm number directli depend number featur number store imag featur discoveri recognit object imag ad set max comput run recognit procedur chang advantag recognit fail featur sought properti requir note recognit fail correct class rule stage recognit system run suitabl featur return set class label correct find featur emploi recognit procedur place tabl learn imag recogn stop add imag comput max recogn stop note fail recognit step gener candid max add set step maximum number featur step ture rule true class achiev greater subset class stage recognit process set class return recognit case class correspond split place major class major class featur present imag stronger chosen satisfi max sought randomli sampl featur imag sampl proce number geometr featur gener randomli point salient pixel note angl distanc applic featur distanc sampl limit exist geometr featur learn augment geometr featur sampl primit note result respect refer point parent featur randomli chosen pair learn newli sampl candid featur featur sampl process termin featur achiev max maximum number composit step complet success suitabl featur ad current train imag run recognit procedur properti featur featur chosen stage fail recognit correct class rule stage chosen earlier stage recognit process recognit fail featur sampl process iter featur learn procedur summar tabl time note featur composit process involv iter featur newli sampl candid total comput requir process imag class averag proport total number accumul imag learn featur time complex order small constant give maximum number composit step number featur directli relat number accumul find featur time proport accept recognit problem suitabl heurist reduc factor complex term identifi exampl illustr oper train simpl object recognit view simpl geometr object consist synthet object render high qualiti cover horizont vertic view sphere imag real geometr object view view cone random view cube imag class includ sphere imag class cube differ size learn system train task imag train set iter present system random system learn train set featur found entir pass train set misclassif learn featur sampl pair set geometr preexist candid featur augment number featur gener tabl show result obtain stratifi test recognit procedur return singl class label synthet object learn perfectli task harder object vari size present random forc system find larg featur algorithm mistak sphere cone sphere lack featur distinguish cone ly reveal circular base misclassifi cone imag view hide characterist conic shape ci cube figur view exampl featur learn sphere cone cube figur view exampl featur learn figur includ exampl featur found learn grai line salient point sampl featur mark small geometr relat solid connect broken line pass train set learn train imag train set perfectli happen run synthet run real task number accumul imag vari synthet real task featur learn run half consult train test imag half featur stage train futur work interact agent biolog artifici benefit learn visual distinct turn relev task behavior learn process inher unknown outset present framework progress learn visual discrimin task base combinatori featur space tabl matric summar perform proport correct recognit synthet real object classif result synthet cube cube result real sphere cube cone sphere cube cone potenti infinit size framework gener incorpor type local spatial tempor imag properti featur varieti mean featur structur partial order featur space permit featur search polynomi time featur sampl gener optim respect heurist intuit prefer simplic complex assum distinct object class express term sampl expend effort area featur space success occur psycholog data strategi human current featur sampl method limit search featur space essenti blind guid requir featur present scene simpl local heurist identif search method lead improv perform system learn heurist optim systemat strategi discov featur limit current system simplic recognit procedur limit gener applic approach sequenti queri featur hard candid class step make strong assumpt natur unrealist interest tree approach requir newli sampl candid featur evalu store imag recognit procedur scale larg problem ideal recognit procedur permit sequenti accumul evid avoid hard inform theoret measur guid search evid evalu util newli sampl featur case approxim current work address goal system emploi bayesian network tree refer amit geman shape quantiz recognit random tree neural wilder joint induct shape featur tree classifi ieee tran pattern anal mach cho dunn learn shape class ieee tran pattern anal mach kittler compar studi techniqu featur select pattern recognit practic page elsevi scienc freeman design filter ieee tran pattern anal mach gibson develop percept handbook child psycholog vol cognit chapter page mel combin textur histogram approach visual object recognit neural nayar visual learn recognit object int comput nelson approach object recognit int conf comput pick improv visual form discrimin exp rao ballard activ vision architectur base icon artifici schiel crowlei object recognit recept field histogram fourth europ conf comput apr silver effect visual verbal form discrimin children exp child sur mit press utgoff metric tree induct comput scienc technic report oppenheim effect train method perceptu learn children child
Agents/1677 1 learn base web queri process lu chen tian depart comput scienc depart comput scienc hong kong scienc technolog hong china china abstract describ web queri process approach learn capabl user queri form keyword search engin emploi find url web site requir inform url present user queri processor learn inform requir user user navig hyperlink locat inform learn process rest url produc queri result form segment web page user involv preliminari result approach process rang web queri satisfactori perform architectur queri techniqu model html knowledg queri process discuss experi effect requir train strategi present introduct internet web chang estim publicli index web million encompass approxim terabyt text data web permiss copi fee part materi grant provid copi made distribut direct commerci vldb copyright notic titl public date notic copi permiss larg data base endow copi requir fee special permiss endow intern confer larg inform sourc huge number peopl search web inform price research excit electron commerc internet common platform conduct busi usag web dramat search engin wide locat inform web user retriev inform search web frustrat find lowest price part simpl sql statement job cost hour search lowest price find problem search web search engin return larg hit list low user sift relev document irrelev manual fetch page discourag aspect url page return search result answer user queri part page field retriev page leav task search insid page web user aspect remain web user freed heavi burden page locat requir inform obtain search inher limit dissimilar queri web queri fundament differ web research disciplin improv situat wide rang research work report ir improv easi effect queri includ develop classif build effect search strategi rank intellig agent user origin ai commun context queri agent learn user profil model user search emploi learn knowledg predic url interest provid suggest user assist syskil webert webwatch user interact mode assist fab infospid heurist work autonom find interest page research commun approach view web larg distribut system appli technolog web queri relat effort includ web queri languag design wrapper gener web queri languag classifi gener includ websql aim unifi content base queri link structur base queri gener web queri weboql struql abil access structur web object creat complex structur queri result research work wrapper gener tackl fundament difficulti queri web page structur schema describ content web page exploit format inform web page hypothesi underli structur page structur wrapper facilit queri page gener issu web queri process approach tackl describ paper effort build onlin queri process system enabl user queri web obtain result fashion user issu kei word queri pass gener search engin search engin return url web page request inform web page retriev present user system record segment web page queri result sequenc hyperlink user navig find queri result user action analyz user system user capabl scan web page locat queri result final system present user segment web page origin web page segment paragraph tabl list queri process system process ad hoc queri html page automat extract segment page queri result superfici similar larg bodi relat system uniqu unlik inform retriev system intellig agent return url web page queri system return segment document queri answer relat field field tabl system requir prior knowledg user user profil requir preprocess web page gener wrapper system suit process ad hoc queri handl static hypertext analysi agent system wrapper system exploit page format linkag inform simultan autom queri process recent surg research work hyperlink web search intern structur html page wrapper gener inform extract combin context queri process system pose great challeng call approach approach system learn exact queri requir effici locat inform queri process result system deliv user result match form learn approach bring advantag queri process system user express queri easiest casual web user user familiar vocabulari inform queri specif vagu bridg gap issu keyword real user system learn requir user system capabl navig neighborhood page keyword occur result page keyword link true keyword learn navig enabl system find result keyword search fail find learn knowledg make hit list return search engin user reliev dozen hundr web page order obtain requir inform background process learn user minim effort click mark site requir prototyp system implement approach preliminari result encourag user queri requir navig heurist queri analyz search engin user interfac inter session control retriev parser web learner locat figur system architectur knowledg base captur store simpl form set user make system capabl locat queri segment deni web site correct rate higher remaind paper organ section describ learn base web queri process approach detail knowledg acquisit process section section describ user queri process learn knowledg experi conduct evalu approach present section section conclud paper discuss futur work web queri process describ architectur web queri process system explain user queri process queri process system figur depict refer architectur web queri process system consist major user session queri retriev knowledg base user interfac user friendli environ work system accept user queri present result browser extend capabl captur user action import compon user web record type user hyperlink mark segment requir reject site requir inform queri analyz analyz user queri convert search condit requir browser user action url session control result train segment buffer strategi graph queri result check queri result present learn process locat process script figur queri session learner knowledg base locat search engin emploi return url web set url pass session control input compon system system work learn mode process mode system work learn learner activ session control gener knowledg captur action locat queri result learn knowledg store knowledg base system work process locat activ appli knowledg locat segment requir inform work mode switch back base train strategi main task session control coordin interact compon system result search engin set retriev integr system retriev web page parser retriev page gener intern data structur learn queri process queri session understand queri describ queri session detail session control receiv system work learn mode process mode type process locat process figur depict detail process data flow retriev parser omit session control activ process train strategi store train strategi modul train strategi defin learn process invok learn mode process mode interleav strategi support system sequenti train partit url return search engin set origin order system work learn mode system process set process mode queri session complet random train similar sequenti system work learn mode turn process mode randomli pick number site return url train randomli pick site repres top return list interleav train interleav train system switch back learn mode process mode stop criterion met work begin queri system learn mode site system locat result process mode long user confirm result remain process mode user find incorrect system switch learn mode learn incorrectli process site process stop criterion interleav train number process accuraci met system remain process mode site process session control retriev parser retriev page transform segment tree add tree segment intern data structur maintain segment graph modul tree segment graph defin control send tree browser tree present user system process page process repeat user mark queri segment reject site user link mark record segment graph successfulli locat control gener intermedi knowledg script segment graph script final learner knowledg gener locat session control receiv segment tree retriev parser add tree segment graph send tree locat locat return find segment reject site link system process page locat make process end locat find queri segment reject site locat segment result buffer modul commun queri result present interfac present result interleav train stop criteria train queri result present user check result system return wrong process activ current site differ normal process page fetch directli segment graph queri session termin url return search engin process url heurist termin session learn user queri process facilit web queri data web properli model system knowledg navig web locat inform page effici obtain knowledg learn user section present approach major issu model web site web consist number web page connect hyperlink order obtain queri inform larg number web intern structur web page linkag web page captur begin model singl web page web page html document sequenc tag delimit data element atom element inform meet queri segment group element unit model partit document segment serv candid answer queri major segment type list head segment segment includ number html document largest segment segment consist textual data scope delimit start tag end tag includ content content check segment meet queri requir facilit design segment discuss summar content heurist descript tabl segment tabl caption titl row special type element html repres segment anchor descript url content advantag hierarch hyperlink parent smallest segment notat web page model segment root web page intern node segment leav atom minim unit model node attribut anchor includ parent segment technic issu includ parent segment text hotel room special promot segment hyperlink paragraph content document tabl figur html document segment tree hyperlink html page segment tree shown figur web page connect hyperlink view web page node graph hyperlink direct edg page point web page site repres direct graph ignor backward link point part link point page current web site model segment call segment graph enter point url return form search root graph refer collect web page reachabl root base url root defin depth segment number hyperlink reach web page segment note segment web page depth path segment root page depth level segment minim depth hyperlink path segment graph intent provid complet sound model web page web sole object model figur segment graph list link content content tabl content type singl standard execut suit ¥ ¤ content ¢ £ ¤ ¥ ¤ ¥ ¤ ¤ facilit retriev queri result form segment small size carri suffici semant segment graph combin structur linkag serv graph present figur knowledg locat queri segment task web queri process system exhaust search segment graph relev segment problem simplifi hypertext classif feasibl line queri processor segment graph larg restrict search navig root termin system find segment page meet queri requir conclud page relev lead relev document find give page made hyperlink intern page structur extens studi made link segment made link segment requir type data structur compar observ concern convent hypertext document hyperlink convei descript inform point document segment meet queri requir descript inform queri result retriev admiss requir graduat applic anchor link point page relat admiss requir queri segment descript inform admiss concret requir test score link structur present inform compar mechan make queri system type knowledg design navig knowledg concern descript inform find path url queri segment web page type knowledg examin segment meet queri requir descript inform result refer classif knowledg fact classifi segment queri result attribut content attribut descript design navig knowledg classif note length link segment differ remark assum descript segment summar semant segment navig avoid bia element length bring descript languag extens markup element serv natur element descript model carri directli navig knowledg navig knowledg gener user action hyperlink locat queri result path start enter page site end queri segment call navig repres mean number occurr segment figur queri navig path hyperlink occur segment document inform segment determin link captur extend navig path segment link call extend navig path extend navig path locat segment link extend navig path call compon extend navig path easili obtain segment graph process gener navig knowledg extend navig step assign denot compon path weight close compon relat queri result intuit closer queri higher weight compon issu rate weight compon decai extend navig path assum queri segment close relat weight path length determin rate depth queri segment page ni number compon path weight compon page compon ij weight scheme weight compon page page term ensur depth specif inform segment weight child segment weight parent link weight segment continu figur compon path assign weight depth depth depth compon depth compon depth compon depth step assign weight term describ compon path descript repres compon word descript consist alphabet letter select stop list stem appli deriv word call term term descript compon assign equal weight compon divid number term descript weight term import lead queri segment weight determin posit compon term number term descript term weight accumul process navig repres set store navig knowledg base classif knowledg task examin segment meet queri requir cast bayesian learn framework provid good perform text hypertext applic bernoulli model multinomi model framework report multinomi model outperform bernoulli model adopt multinomi model classif knowledg knowledg bayesian classifi classif knowledg form set number occurr content queri number occurr content segment meet queri requir figur locat algorithm knowledg gener involv featur gener select train sampl featur extract content segment unlik ir system english word valu complex data type defin basic featur english word alphabet special word special complex featur email telephon number lexic program regular express extract featur train segment treat posit sampl neg segment page mark segment select page mark segment discard avoid excess neg sampl gener classif knowledg straightforward user mark queri system collect content number occurr segment page number occurr number occurr class accumul process type knowledg involv organ effici access queri process learn knowledg describ learn knowledg locat queri segment locat process algorithm locat queri segment locat process url return search engin entranc site segment graph built fly onlin web queri system perform badli gener graph search approach search hyperlink segment page simultan complic search process learn knowledg system locat queri result effici effect choic hyperlink segment page determin navig site hyperlink locat process point page fail find queri segment make choic unvisit hyperlink unprocess segment segment classif knowledg appli check meet queri requir return queri result navig termin choic made unvisit hyperlink process segment result found link segment locat process backtrack process run fashion kei issu make choic hyperlink segment web page navig knowledg analyz descript inform link segment web assign weight weight uniformli close link relat queri result link type sort assign weight element highest weight chosen process figur present locat algorithm url pass retriev web page segment tree function separ store link segment push atom segment segment segment stack classifi decid segment answer queri function assign weight segment link navig knowledg sort order weight pass insid loop make choic link highest weight segment highest weight chang weight segment function appli classif knowledg segment page determin meet queri requir retriev page internet time process number segment local machin reason assum segment inform queri result link segment find result page hyperlink function termin navig locat process visit number page visit applic navig knowledg function assign weight segment link navig knowledg learn sort weight descend order assign segment term extract descript term weight wn comput max function equat return set term weight top highest navig knowledg base top term segment link remot relat queri result filter return empti set segment link consist term low weight empti weight equal segment remov stack sort process function descript inform segment link averag function weight return max function relev segment link convei word convent html page short inform sentenc fragment true result segment link assign weight expect repres relev applic classif knowledg function call naïv bayesian classifi appli classif knowledg multipl segment classifi adopt modif begin classif segment featur extract content class label segment arg ck arg ck ck max arg ck class label fi featur segment estim probabl featur fi condit class class prior comput classif knowledg fi ck tk tk tk tripl ck handl probabl featur occur train smooth vocabulari size classif knowledg find queri segment segment function estim confid segment classifi class denot calcul ek α α α α ek denot class queri segment set segment dm function filter segment classif confid lower threshold segment largest arg max classif confid class label assign segment dj segment lower return result locat process perform evalu prototyp system implement base approach system implement visual extern engin url web page match process seri experi conduct evalu approach studi relat issu describ test discuss result evalu metric queri url return search system return segment result found relat web site label case found found wrong system make correct queri result belong categori queri segment segment satisfi user queri requir queri segment found wrong segment queri segment irrelev site return segment return irrelev site wrong system fail locat queri segment site evalu metric found found recal found site queri segment correct site site process definit site number site system make correct locat queri correctli site queri segment evalu visit page measur time process page compar retriev page internet measur defin absolut path length number visit page locat queri segment conclud queri segment found site rel path length locat queri segment ratio absolut path length level queri segment length shortest path locat metric present absolut path length visit page figur sampl output rel path length visit page level queri segment system capabl quantit analysi system present sampl queri result capabl system user post queri consist hong kong intent find hotel room rate hong kong queri pass set url shown left frame figur snapshot system output frame show queri result success process system learn knowledg queri frame present result locat site result featur system addit url page titl ordinari search engin system return segment web page queri inform result site list site tabl queri result inform user note segment site input keyword meet requir room rate keyword queri system learn queri requir user segment page url directli return system learn follow hyperlink page queri segment queri url select url train test tabl url queri process tabl basic perform system effect system relev queri found found correct recal present result queri illustr effect system queri hong kong hotel room hong kong hotel intent user locat room rate hotel hong kong process usag url return summar tabl url chosen process url remov exampl remov url includ url point document url point sequenti train strategi number url train shown column train relev site determin examin page content manual result experi summar tabl observ sequenti correct queri reach big discrep keyword express user queri exact result encourag justifi basic approach previou section understand system fail locat queri examin case system chose segment meet queri requir major reason return segment word close locat queri segment return segment elizabeth standbi fare dai cross famou ship nov york doubl occup dec sail singl supplement segment word symbol number import clue locat segment room rate hotel process dynam web page develop accuraci queri tabl effect type knowledg tabl analysi type knowledg number reason system fail locat queri segment case low confid classifi queri defici gener classif knowledg case result html tag origin hyperlink imag element content leav attribut alt tag img blank system find descript inform link path lead queri segment effect knowledg queri type knowledg bayesian navig recal correct queri queri type knowledg bayesian navig mean irrelev verifi effect type navig modifi system configur appli type knowledg process learn locat queri test environ tabl result summar tabl result type knowledg includ easi comparison system emploi type knowledg perform emploi type knowledg analyz reason poor perform type classifi site level queri segment tabl titl cell specifi level distribut fraction stand test belong level coarser site belong level correct group report tabl cell find system type knowledg work queri segment occur page abil filter irrelev site navig hyperlink limit emploi type knowledg manifest good perform irrelev filter navig queri segment type knowledg accur type knowledg coordin navig knowledg classif knowledg good process web queri effect train strategi system support train sequenti random train interleav train group experi design find train strategi perform term accuraci effici train train size focu part onlin queri user site impract vari train size train method interleav stop criterion train number train size queri hotel room rate observ report figur omit interest space random train perform badli term effect effici assumpt randomli pick site repres top return list true train size differ sequenti train interleav train enlarg train interleav train beat sequenti train effect metric perform interleav train updat knowledg updat system make mistak term interleav train strategi rel path length segment rang mean system navig short path locat result absolut path length page final note interleav train strategi train number wrong reduc tabl knowledg learn interleav train improv greatli experi rang queri made observ issu relat implement web queri processor queri room rate hotel evalu effect effici test rang queri queri requir distinct characterist select room rate hong kong hotel target defin easi identifi user process system expect extract price inform locat process queri requir keyword queri room rate hong kong hotel admiss requir graduat applic tabl queri requir keyword queri perform kong hotel room kong graduat data mine research mine tabl result rang queri correct recal rel path length absolut path length admiss requir user exact queri requir issu keyword queri make clear requir concern concret item system expect extract item queri result compar qr queri result larger varianc set item data mine research queri target fact concept user extract segment page evid person data mine research hard human reader segment subject user data mine research reflect research research system expect recogn piec evid return correct segment queri issu keyword queri keyword queri list tabl keyword url return collect top clean test interleav train strategi train size quantit result present tabl system work queri accuraci queri reach recal high queri fortun system capabl filter irrelev make correct good rel path length locat queri segment close absolut path length irrelev site page manual check site test prevent enlarg url list assum system process url perform observ perform system affect keyword queri user worri exact word issu queri process requir action system learn locat process approach process queri web user issu queri free text sentenc result form segment requir inform minimum involv requir user train system process search engin emploi initi relev input seri locat process system learn user requir navig hyperlink locat segment meet queri requir locat learn knowledg appli locat queri segment larg number web page interact user preliminari experi produc encourag show approach tackl difficult problem queri web prototyp system develop base approach experi conduct futur work includ knowledg sophist algorithm learn appli knowledg process wide rang web html page segment issu deserv studi acknowledg work partial support grant nation project china grant research grant council hong kong special administr china refer knoblock wrapper gener semistructur internet sourc sigmod pp dec arocena mendelzon restructur web proc icd pp feb balabanov adapt web page recommend servic proc st intern confer autonom pp page anatomi hypertextu web search engin proc www pp nigam slatteri learn extract symbol knowledg world wide web proc dom indyk enhanc hypertext categor hyperlink proc sigmod pp jun dipasquo html format aid natur languag process world wide web senior honor school comput ng discoveri web document proc pp dan suciu queri languag manag system sigmod pp levi mendelzon techniqu world wide survei sigmod pp sep kleinberg raghavan infer web commun link topolog proc acm hypertext pp jun yerneni wrapper tsimmi system proc pp mitchel tour guid world wide web proc intern joint confer artifici pp aug shmueli queri system world wide web proc vldb pp lawrenc cl gile access inform web pp jul tang base wrapper gener web inform extract pp belew adapt retriev intern local context scale web technic report san milo queri world wide web intern journal digit pp nigam comparison event model naïv text classif work note workshop learn text pp billsu syskil identifi interest web site proc pp build wrapper legaci web proc vldb pp sep
IR/1678 5 mediat infrastructur digit librari servic sergei hector andrea paepck stanford stanford ca usa abstract digit librari mediat inform servic paper describ flexibl dynam mediat infrastructur mediat set modul modul implement mediat protocol queri result merg inform includ mediat logic repres rdf graph illustr approach mediat scenario involv discuss potenti advantag weak framework compon design introduct heterogen main challeng face digit librari document store collect search dispar queri search servic access incompat intellectu properti protect access scheme retriev inform return dissimilar rank inconsist wai inform share vital work digit librari recent bridg gap inform system import advanc specif develop mediat access inform multipl sourc mediat typic receiv request submit translat version request digit collect merg present user todai mediat import ffl current mediat hard extend initi set servic design ffl difficult incorpor mediat compon develop queri translat algorithm implement hard replac queri translat packag ffl mediat tackl protocol differ mediat assum target commun http ffl easi extend mediat task mediat design queri multipl search hard make mediat payment mechan document summar servic paper mediat framework address shortcom framework present flexibl environ compon call combin address specif mediat task translat protocol compon receiv singl synchron messag turn issu sequenc asynchron messag perform request task framework revolutionari idea number exist compon base softwar extens program oper system combin suit digit librari environ stress advanc claim complet solv heterogen problem framework offer substanti introduc perform overhead addit complex clear approach scale scenario larg number servic mediat task mediat approach scale initi experi framework low complex framework good import quickli adapt servic inform import experi mediat compon algorithm start section briefli illustr typic mediat scenario section present reconfigur extens mediat framework section discuss potenti drawback section comment current statu implement prototyp section review relat work case studi section illustr principl compon mediat infrastructur digit librari illustr depict figur base retriev servic client figur issu queri protocol develop part project simpli exampl illustr digit librari server left access ncstrl document collect server implement protocol client encod queri xml wait asynchron deliveri portion search result ncstrl server deploi stateless model accept queri server expect queri polish notat encod server return number search result client retriev subset result separ request client server nativ compon mediat scenario wrapper shown figur hide heterogen nativ compon wrapper commun nativ compon nativ wrapper provid homogen environ mediat center figur mediat perform dynam broker request translat request request combin inform receiv pass client mediat shield nativ compon deal semant incompat inform provid wrapper major problem ffl protocol stateless protocol client ncstrl server languag wrapper wrapper wrapper mediat interfac descript interfac descript mediat specif interfac descript figur mediat architectur show client access ncstrl server ncstrl server state protocol deploi server map state protocol client ffl queri queri translat ncstrl queri ffl data search result deliv server merg translat client understand ncstrl server return set bibliograph record base bib attribut deploi client expect dublin core record protocol translat assum mediat queri submit translat ncstrl send ncstrl retriev result encod translat dublin asynchron send result client send translat queri server return size result set mediat fetch result chunk convert marc dublin forward chunk client formal algorithm depict figur automaton label arc event action perform automaton transit state notat specifi messag type arriv channel store memori cell channel correspond ncstrl label figur bang denot send messag pseudo code express denot applic function figur machin mediat messag yield result describ rest figur goal fulli defin automaton formal argu formal describ protocol translat run formal conveni repres work mechan petri java suit scenario implement formal introduc queri translat exampl type machineri describ mediat task queri translat assum client scenario submit search request music record author lou origin queri repres xml specif shown top left part figur wrapper client receiv search request queri nativ interfac wrapper convert request logic top part figur show logic structur nativ queri repres rdf model rdf descript framework metadata standard recommend consortium describ object relationship choic rdf queri made design wrapper inform repres node graph node label properti link node rdf queri figur leftmost node label root queri structur type properti search properti link boolean condit select document rest node compon search condit mediat receiv rdf model repres queri translat rdf suitabl wrapper ncstrl server server wrapper turn transform logic queri queri syntax ncstrl nativ encod rdf model target queri depict bottom part figur translat mediat call queri translat compon figur call correspond task queri translat compon transform queri chosen wrapper ncstrl wrapper queri translat account capabl support attribut attribut model server server searchabl field author submit client concaten format proper translat queri step refer predic rewrit predic rewrit hard full solut exist rule base system perform common rewrit illustr rule refer complet discuss queri translat rule translat search predic ncstrl queri specifi conjunct search condit firstnam lastnam valu bound variabl left hand side rule yield condit ncstrl queri condit search full concaten variabl rule rewrit predic server analog appli rewrit queri graph shown figur convert gener queri tree search predic leav intern node repres boolean oper lou lou eq type type type type prop prop liter liter type type operand term type author ncstrl operand operand figur nativ queri ncstrl logic model applic rewrit gener queri tree map queri graph chosen ncstrl wrapper data translat problem mediat address wrapper deliv search result mediat convert semant incompat data instanc return search servic wrapper format support client wrapper server return set bibliograph record map attribut model marc dublin core set datalog rule map marc attribut dublin core shown letter denot variabl rule transform graph return search result graph rule specifi node connect arc label sourc arc destin graph map classif schema server client express similar approach server librari congress subject head translat decim classif implement rule set music appli marc record shown top figur set rule produc dublin core record depict bottom figur solut implement mediat sampl scenario section write larg program favorit languag program implement logic automaton figur hard code queri translat develop data structur repres rule code interpret rule data hard code develop curiou instrument music form origin rio de number catalog book figur result bibliograph record gener rule execut machineri mediat written todai approach flexibl chang mind queri server faster time requir rewrit part mediat recompil add search server execut server queri parallel serial requir major effort similar issu queri data translat develop gener queri translat packag rule queri select implement rule interpret queri lot work maintain attribut model server evolv search retriev aspect digit librari eventu extend mediat cover servic citat extract difficult add mediat function monolith program solut paper plug plai mediat mediat task execut replac modul predic rewrit task perform queri translat modul mediat configur translat call call plug plai modul blade analog system blade turn analog blade blade code languag suit task repres inform conveni term mediat detect configur blade plug plai oper system automat detect configur hardwar approach modular extrem make mediat logic figur blade mean chang logic mediat serial parallel queri simpli replac mediat blade automaton find automaton conveni insert type repres logic petri net repres protocol dynam call main blade drive mediat execut dynam blade captur dynam natur mediat push analog plug plai hardwar replac dynam blade mediat chang oper system window linux build mediat set reconfigur blade attract mediat repres type coordin inform pass rest section answer describ plug plai mediat framework implement flexibl advoc mix specif languag challeng face describ mediat task inform formal plug seamless achiev encod express dispar datalog uniform requir establish relationship express state languag automaton descript point link queri rule invok mediat infrastructur rdf illustr languag encod transit state automaton figur top part figur present rdf encod transit transit center node label ff node ff properti origin state destin state addit type properti indic ff transit notic properti liter transit event figur mix declar transit machin queri rewrit rule encod rdf fix string part languag model point subgraph describ trigger event recept messag type channel automaton move figur perform descript shown middl part figur action transit shown central part figur center node label repres assign statement action bottom center node repres set rule implement queri rewrit subgraph center node ffi repres translat rule rest condit variabl make rule discuss detail figur illustr formal machin predic rewrit rule repres singl figur illustr easi link rdf connect transit descript node ff finit automata assign statement action execut repres link ff configur formal mediat specif process separ blade challeng blade dynam interact enabl introduc special call blade manag manag orchestr call act mediat blade manag encount specif predic rewrit rule make queri translat blade call evalu rule manag statement languag blade execut statement blade manag initi learn resourc configur suggest figur initi blade manag url point mediat configur configur descript blade factori blade factori execut modul gener rdf configur rdf descript blade blade manag figur execut mediat blade manag specif blade mediat factori dynam load call gener load execut illustr walk initi blade instanti illustr figur configur read blade manag blade factori regist factori download local instal java modul modul gener blade configur includ descript action mediat structur shown figur call complet structur model blade manag instanti dynam blade execut main logic mediat manag instal factori gener question regist factori factori offer default interfac call public interfac public blade model paramet model id identifi subgraph model requir blade interpret id identifi portion model captur mediat logic includ transit ff shown figur method factori recogn id structur oper return null factori eventu call recogn paramet id id recogn factori understand automata descript factori gener return dynam blade blade manag blade execut logic descript id factori logic descript compil execut compil work strategi effici interpret rdf descript time invok perform action dynam blade instal blade mediat process start dynam blade offer method start blade manag invok method bind commun channel dynam blade channel actual connect client server wrapper blade manag connect dynam blade wait incom request start state request arriv channel figur dynam blade match request recept event event transit defin state messag arriv blade verifi blade decid execut statement dynam blade execut statement blade manag figur locat blade task blade manag contact factori examin statement question id identifi queri translat factori determin resourc id involv ncstrl recogn factori gener return blade factori decid compil blade oper effici blade manag receiv queri translat manag record cach paramet gener blade ident blade manag invok method gener check cach blade exist blade search match factori skip altogeth queri translat blade manag call perform tion dynam offer gener interfac extend blade model singl paramet evalu context context object includ perform blade servic queri translat blade obtain queri rewritten context blade initi creat blade call blade blade store data subsequ call context blade manag invok comput queri translat blade extract operand transform queri translat repres rdf graph type return blade turn return dynam blade desir statement comput translat dynam blade complet transit state examin transit state send translat queri store channel ncstrl wrapper descript blade omit implement main step messag receiv dynam blade verifi prototyp datalog rule great flexibl blade dynam blade made call manag queri translat statement execut easili design dynam blade packag action transit singl block statement dynam blade blade execut entir block unit blade input interpret make call execut statement scheme isol statement execut logic state transit enhanc modular mediat scenario singl dynam state machin number static datalog interpret queri translat compon blade execut code compil interpret rdf graph encod action initi dynam blade interpret rdf descript state automaton queri translat blade execut rule repres compact notat gener blade formal link blade manag plug plai mediat offer tremend flexibl rule logic descript easili chang modifi rdf descript mediat configur formal languag describ rule oper logic long blade work formal ad flexibl approach impli higher perform compar monolith approach introduc earlier classic flexibl versu perform tradeoff digit librari mediat server client vari chang flexibl mediat rapidli adapt prefer faster work limit case wrapper wrapper conceptu similar translat nativ compon mediat figur wrapper gatewai mediat server mediat machineri wrapper mediat core wrapper blade manag load suitabl modul runtim configur wrapper describ find interfac descript specifi dynam blade defin program languag sine deal intricaci nativ protocol advoc wrapper simpl wrapper deal syntact queri nativ string nativ protocol translat messag simpli encod rdf actual queri protocol translat work left mediat wrapper simpl encourag construct wrapper deal nativ compon develop peopl run nativ servic client work wrapper develop provid wrapper inform nativ compon mediat mediat harder translat mediat work challeng system section varieti advantag design mediat suggest graph base queri submiss idea transform graph place comput program introduc finit state machin model dynam protocol approach queri translat build block compon combin code segment construct mediat blade intent approach introduc maximum flexibl construct mediat modul protocol made object construct transform execut intend result interact creation conveni mediat modul challeng issu potenti complex approach comput program effici repres oper data structur graph give displai connect program part drawback approach difficult complex quickli challeng construct mediat develop tool balanc advantag textual program graphic counterpart mediat design protocol interfac overwhelm cognit complex standard measur program mainten tradit program approach prove applic digit librari approach superior challeng support debug system tend inher parallel natur make difficult debug order analyz rule fire system undergo state tradit debug techniqu adapt challeng scalabl perform interpret system slower compil approach interpret program languag reli processor speed make perform accept success approach depend part optim techniqu speed execut program languag optim techniqu current implement section briefli describ implement detail framework framework implement mediat wrapper scenario figur wrapper interfac repres state machin state ncstrl error condit consid action state machin describ wrapper interfac implement nativ java modul statist describ amount code declar automata descript nativ librari wrapper wrapper base toolkit develop project amount nativ java code wrapper line ncstrl wrapper implement scratch http server librari line code implement wrapper librari develop oclc code line code addit librari implement mediat involv blade blade factori execut mediat specif mediat ten state depict figur blade manag implement java line code major blade scenario creat blade interpret rdf specif automaton interpret line code built top infer engin develop karlsruh implement factori requir line code translat rule nativ encod infer rule support infer engin blade gener datalog factori pass translat rule infer engin infer engin invok java virtual run separ process queri translat hard code java work implement queri rewrit blade factori declar rule implement mediat scenario hard wire mediat refer implement provid perform comparison tradit approach addit scenario figur implement prototyp mediat document format servic mediat capabl map complex interfac simpl state automaton cgi wrapper state request client pass server object handl document convert specif sourc destin format server issu callback client determin size increment fetch piec document content convert postscript pdf deliv handl convert object client client fetch content convert object analog interfac machin state mediat automaton base ten state mediat deploi blade datalog retriev scenario current wrapper mediat exchang rdf model network standard rdf serial xml commun interfac implement asynchron exchang serial rdf model connect conceiv order support build provid rdf api manipul rdf model accompani lightweight rdf relat work focu work integr inform process servic digit librari wealth prior work address heterogen data sourc system support tsimmi inform manifold garlic sim infomast momi work present consid mediat approach updat data sourc rich interact user servic examin approach integr discuss digit librari servic extens address stanford servic attribut translat metadata servic distribut object implement interfac framework approach wrapper implement set common interfac extens infrastructur relax rigid interfac typic distribut comput detail comparison approach digit librari found formal mediat infrastructur languag data translat queri exampl mechan descript mediat task studi protocol data queri architectur borrow area comput scienc draw varieti tradit experi compon base softwar engin tradit commerci data analog mediat blade design limit blade facil introduc reach extens open entir modif modul open oodb texa instrument project enabl design chang modul order introduc optim function oper system commun experi compon base approach famou mach oper system offer analog blade design insert virtual memori manag program languag design explor compon base approach protocol make system intern class object manipul fundament behavior languag chang approach heavili base interfac descript corba base system separ interfac implement reli finit state machin portion approach inspir corba inabl describ dynam interact system extens expert system design specif process rule infer engin support variant datalog negat implement prototyp rule system paper explor build flexibl dynam digit librari adapt servic technolog evolv model inform extens execut environ perform mediat orchestr blade manag approach hold environ target servic mediat task fix high perform main object refer young kernel foundat unix develop summer usenix technic confer june allen garlan formal basi architectur connect acm tran softwar engin juli hsu queri process sim inform mediat advanc plan austin tate aaai menlo woelk semant integr inform open dynam environ proc acm sigmod page vincini semant integr semistructur structur data sourc sigmod record march ja wj graef experi build open oodb queri optim proc acm sigmod chang approxim queri translat technic report octob chang mind queri map heterogen inform sourc proc acm june mediat data acm sigmod int page studer ontolog base access distribut inform semant semant issu multimedia ifip eighth work confer semant page widom tsimmi approach data model languag journal intellig inform system page inform integr system proc acm sigmod thoma problem structur heterogen approach solut vldb journal de bobrow art protocol mit lassila swick resourc descript framework model syntax specif ncstrl approach open architectur digit librari decemb ordil queri heterogen inform sourc sourc descript proc vldb page septemb ludasch gupta model interact web sourc inform mediat intl workshop web conceptu model sheth approach queri process global inform system base ontolog distribut parallel omg homepag distribut object build stanford digit librari ieee februari winograd digit librari worldwid commun april ullman mediat system base declar specif proc intl conf data page virtual memori manag page uniprocessor multiprocessor architectur proc asplo int conf comput societi roth schwarz dont scrap wrap wrapper architectur legaci data sourc proc vldb rosenth semant valu facilit heterogen system acm transact simpl digit librari protocol protocol specif compon adaptor acm transact program languag mar
ML/1679 6 rough fuzzi modular rule gener evalu senior ieee mitra methodolog evolv multi layer perceptron modular concept genet algorithm obtain structur network suitabl classif rule extract modular base train compact network suitabl gener minimum number rule high certainti valu concept variabl mutat oper introduc preserv local structur constitut knowledg base integr evolv rough set depend rule gener directli real valu attribut tabl fuzzi membership valu indic defin evalu quantit qualiti rule effect model rule extract algorithm extens demonstr experi comparison soft fuzzi rough genet pattern rule knowledg data mine introduct soft comput consortium work flexibl inform process capabl handl real life ambigu situat aim exploit toler approxim reason partial truth order achiev low cost solut close resembl human guid principl method comput lead accept solut low cost seek approxim solut formul problem ongo effort past decad integr fuzzi artifici neural network genet algorithm build effici system soft comput paradigm theori rough set emerg mathemat tool deal uncertainti inexact incomplet soft comput mlp layer develop recent pattern combin rough set fuzzi set neural network build effici connectionist system fuzzi set handl linguist input inform ambigu output rough set extract domain knowledg determin author machin intellig indian statist india work partli support grant india work paramet attempt rough set individu combin fuzzi design neural network system rough set gener network rough neuron level incorpor note util ga determin network paramet topolog notic past decad algorithm develop extract form symbol hybrid network import issu adequ address methodolog lengthi train time poor interpret network major disadvantag neural network learn larg scale task high comput time requir local minima slow knowledg base network offer partial solut problem methodolog link weight network uniformli distribut network suitabl extract crisp rule compact network structur weight valu desir respect network interpret introduc concept modular learn evolutionari deal problem recent trend neural network design larg scale problem split origin task simpler subnetwork modul subtask modul combin obtain final solut advantag modular approach includ clear neural divid conquer strategi lead speedup train avoid learn number paramet reduc lead gener perform compact size crisp extract rule present articl modular evolutionari approach adopt design hybrid connectionist system soft comput framework classif rule gener basic build block mlp mention earlier origin classif task split subtask number mlp obtain subtask subnetwork modul integr manner preserv crude domain knowledg encod rough set pool integr network evolv ga restrict mutat oper util domain knowledg train preserv local rule structur potenti solut paramet input output fuzzi membership function network tune ga link weight modifi exist procedur gener rough set depend rule handl directli real valu attribut tabl fuzzi membership valu preserv class repres point depend rule adapt appli threshold automat care shape membership function unlik previou attempt knowledg base network design infer contribut final solut ga context benefici model major repres popul fair chanc network synthesi part rule extract base hybrid present perform rule evalu quantit measur defin indic certainti indic exist measur evalu qualiti rule quantit comparison rule extract algorithm made exist subset real life artifici gener data set dimens rang class boundari overlap organ articl section ii mlp definit rough set theori relev design detail modular evolutionari algorithm present section iii rule extract method quantit perform measur present section iv effect model comparison relat provid section ii mlp mlp briefli section explain fuzzi conveni definit rough set theori discuss methodolog extract rough set depend rule knowledg encod algorithm map rule paramet fuzzi mlp explain fuzzi mlp fuzzi mlp model incorpor fuzzi input output level capabl handl exact inexact form input data input featur term combin membership valu linguist properti set low medium high class membership valu pattern repres output layer fuzzi mlp weight updat backpropag error respect membership valu contribut uncertain vector automat reduc feedforward mlp output neuron layer input layer ji state ith neuron layer ji weight connect ith neuron layer jth neuron layer node input correspond jth compon input vector note ji input vector pattern repres vector valu membership function linguist medium high featur axi refer activ neuron input layer input featur set rang repres kf kf ck kf kf ck radiu central point note featur linguist set form handl framework output problem domain node output layer vector kl kl denot standard deviat numer train data kth class weight distanc train pattern kth class defin ik ij kj kj ij jth compon ith pattern point membership ith pattern class ly rang defin ik fd fe posit constant denomin exponenti fuzzi gener control amount fuzzi class membership set rough definit present preliminari rough set relev articl detail refer inform system pair finit set call finit set attribut attribut regard function domain set system inform system form attribut element call condit attribut inform system repres row label object column attribut system repres tabl subset attribut easili associ relat set fx xg fx denot class object rel call approxim denot bx bx observ bx greatest set bx smallest set defin notion relev knowledg reduct aim obtain irreduc essenti part knowledg encod inform constitut reduct system maxim set attribut initi set induc partit domain essenc inform remain superflu attribut remov reduct nice discern matric discern function fx xn fa inform system discern matrix meant ij fa discern function fs function boolean variabl attribut defin fs ij ij ij disjunct variabl ij fa reduct prime implic disjunct normal fs rough depend rule gener princip task method rule gener comput reduct rel kind inform system version matric function basic tool comput matric methodolog fd set condit attribut divid tabl tabl attribut fd fx set object occur fb discern matrix matrix defin ij fa object discern function defin ij ij ij disjunct member ij brought conjunct normal form obtain depend rule disjunct normal form depend factor df df po lower approxim respect case df knowledg encod case featur class class problem domain input repres sampl map featur space ij ij ij repres method consid multipl object class separ tabl gener class number object absolut distanc pair object comput attribut modifi eqn directli handl attribut tabl consist fuzzi membership valu defin ij fa adapt threshold note adapt threshold depend inher shape membership function fig illustr adapt threshold membership function figur correspond membership function steeper compar observ result implicit adapt comput ij discern matrix directli attribut li novelti method type threshold enabl discern matrix repres present class model multimod class distribut design initi structur union rule class consid input layer consist attribut valu output layer repres class hidden layer node model level oper part conjunct disjunct output layer node model outer level conjunct disjunct level output class depend hidden node dedic input attribut connect hidden turn connect output node outer level oper model output layer join hidden node note singl attribut level directli connect output node hidden maintain uniform rule map depend factor depend rule class df ff eqn weight ki hidden node output node set ff fac fac refer number outer level operand rule small random number destroi symmetri weight note fac hidden node connect output node initi weight hidden node denot fi weight ia attribut correspond low medium high hidden node set fi number attribut connect level oper problem domain hidden node mention number hidden node determin directli depend rule depend form present rule iii modular evolut mlp design procedur modular neural network involv broad step effect decomposit problem subproblem solv compact effici combin train network gain term train network size accuraci detail section step involv characterist featur algorithm phase classif problem split problem set input output node rough set theoret concept encod domain knowledg eqn explain section number hidden node connect subnetwork automat determin problem lead gener crude encod rule constitut pool obtain pool modul pool perturb gener total nm pool constitut initi popul evolv independ genet algorithm end problem concaten form initi network phase inter modul link initi small random valu depict figur set concaten network form initi popul ga mutat probabl link set high link set lower sort restrict mutat preserv local rule extract potenti solut initi popul ga entir network form combin individu network modul random perturb ensur complex pattern distribut repres point remain popul algorithm search reduc space network topolog step summar step step gener rough set depend rule methodolog section step map depend rule separ subnetwork modul methodolog section step partial evolv subnetwork convent ga step concaten subnetwork modul obtain complet network concaten input output usual link link assign small random modul modul modul fig intra inter modul link link left unchang link initi low random valu note subnetwork solv classif concaten network solv actual problem combin subnetwork modul gener form pool network step pool network evolv modifi ga mutat oper mutat probabl set low link high link problem classifi data class input fuzzifi map featur featur space sampl set rule obtain rough set theori correspond phase ga pool crude subnetwork class crude subnetwork class partial train subnetwork result pool concaten form network popul final phase ga form network perturb step obtain final network illustr figur note figur explain chromosom intra link characterist featur rough set knowledg encod establish mathemat framework network decomposit knowledg encod produc initi network close optim reduc search space initi network topolog automat determin good build block ga earlier concurr algorithm neural network exist guidelin decomposit network modul arbitrari subnetwork assign class network class featur obtain rough set theori modul rule crude subnetwork gener rough set theori ga ga ga partial train subnetwork combin subnetwork modul normal link link small random final popul ga mutat probabl final train network pool pool pool fig step design sampl modular mlp number hidden node class lead case simpl class poor learn complex class rough set theori circumv problem suffici reduct train time approach parallel ga extent search string ga subnetwork linear search time obtain small number train cycl requir refin network close solut note modular aspect algorithm similar algorithm solv larg scale problem ea split problem problem bear analog divid conquer strategi speed search procedur significantli smaller chromosom popul allevi extent complex problem algorithm indirectli constrain solut manner structur connect weight subsequ result network obtain strong interconnect node process amount optim problem number node requir higher network redund natur object function consid modular knowledg base methodolog enabl suffici amount link prune total number link found significantli restrict mutat defin section minim destruct encod rule structur knowledg base network set subnetwork encod separ rule combin subnetwork consid final evolutionari greater popul result faster converg ga util multipl theori domain ensur cluster featur space adequ repres final solut evolutionari design discuss featur genet algorithm relev algorithm chromosom problem variabl consist weight valu fuzzif paramet weight encod binari word bit decod decod addit bit assign weight presenc absenc link fuzzif paramet tune center radiu linguist attribut medium high output fuzzifi code bit string rang input decod decod time maximum attain featur train set chromosom obtain concaten string sampl valu string length bit size network weight bit link tag bit fuzzi paramet bit initi popul gener code network obtain rough set base knowledg random perturb popul size consid weight weight string weight fuzzi paramet fig variat mutat probabl encod string crossov obviou due larg string singl point crossov effect multipl point crossov distanc crossov point random variabl bit ensur high probabl crossov point occur word encod singl weight crossov probabl fix mutat search string influenc mutat search compar crossov mutat probabl variat maximum chosen minimum mutat probabl vari encod bit link assign probabl link assign probabl ensur alter structur individu modul evolv mutat oper indirectli incorpor domain knowledg extract rough set theori choic fit function object function form chosen ff ff correctli classifi sampl train set sampl train set link present link ff ff determin rel weight factor ff ff give import classif score compar network size term number link note optim network weight fuzzif paramet simultan select wheel method probabl calcul basi rank individu term object object function elit incorpor select process prevent oscil fit function gener fit individu gener compar current gener higher individu replac randomli select individu popul iv rule gener quantit evalu extract methodolog algorithm rule gener neural network fall categori pedagog decomposit algorithm categor decomposit comput posit posit weight weight greater similarli calcul neg weight hidden output unit weight greater search posit rule weight search negat rule subset method search combin posit weight neg weight greater exce bia similarli search neg weight posit weight find rule associ rule confid factor cf inf node path ji ji ji ith incom link weight node train algorithm structur result network strong valu separ rule extract algorithm gener rule small number comput step comput complex algorithm network number hidden output node make assumpt fraction weight similarli fraction neg weight comput complex import order applic rule rule base real life pattern noisi rule base obtain total consist multipl rule fire singl exist approach appli rule sequenti lead degrad perform rule extract method confid factor multipl rule strongest rule highest confid exist rule extract similar spirit subset method method major problem subset algorithm cost find subset grow size power set link unit requir exhaust search size node extract larg set upto fi fi fi number subset posit neg weight link gener rule permut rule care automat knowledg train network extract comput complex algorithm number exampl rule extract procedur involv backpropag step requir comput time algorithm good gener degrad note consid group link gener bound number rule establish ceil number quantit measur provid measur order evalu perform rule certainti reflect confid ambigu newli defin note aspect consid earlier matrix element ij number pattern belong class classifi class correct classif provid rule test set defin ic equal number point class ic point correctli classifi user accuraci point found classifi class user accuraci defin ic measur confid classifi attribut region belong class denot level puriti region kappa coeffici agreement call measur relationship chanc agreement expect disagr cell diagon element estim kappa proport agreement chanc agreement remov kappa class defin ic numer denomin kappa obtain sum respect numer denomin separ class fidel repres close rule base approxim parent neural network model measur percentag test set network rule base output note fidel greater accuraci measur quantifi goal restrict minimum number properti higher level make ij ij defin conf ij ij ij jg class problem lower conf lesser number class occur ideal rule extract cover cluster region pattern space percentag exampl test set rule fire measur uncov region rule base smaller uncov region superior rule base measur term number rule lower compact rule base comput present cpu time requir certainti rule base quantifi confid rule defin certainti factor cf implement result algorithm implement real life artifici gener data dataset methodolog term model model compar model ordinari mlp train backpropag weight decai model fuzzi perceptron train bp weight model fuzzi perceptron train bp weight initi knowledg encod rough set model modular fuzzi perceptron train ga tune fuzzif paramet term modular refer subnetwork concaten ga speech data vowel deal indian vowel sound utter context male speaker ag group year data set vowel frequenc obtain spectrum analysi speech data figur depict project fig project plane vowel data fig artifici gener linearli pattern pat vowel class overlap class denot synthet data pat consist pattern point space depict figur linearli pattern class figur mark class class correspond background region medic data consist input featur pattern deal disord patient case input featur result biochem gamma blood volum red blood cell total disord alcohol liver damag primari liver constitut class refer classif recognit score obtain data soft modular network present tabl ii show comparison relat classif method sampl train remain sampl test set featur featur featur fig input data distribut axi vowel data solid line repres initi function dash line repres function obtain final tune ga horizont dot line repres threshold level ten independ run perform standard deviat classif comput present tabl ii depend gener rough set theori encod shown tabl vowel valu input fuzzif paramet present tabl shown figur featur illustr tabl stand medium denot properti ith featur integr network hidden node singl layer pat medic data combin network obtain initi popul ga form network case phase ga model fm subnetwork partial train sweep classif accuraci obtain model statist test perform inequ mean obtain algorithm method compar pair varianc pair unknown gener version context problem classic problem hypothesi suitabl test statist tabl test statist form standard number observ experi perform ten independ random train set test confid level consid tabl rough set depend rule vowel data input fuzzif paramet valu fuzzif featur cl cm ch featur cl cm ch featur cl cm ch tabl present standard deviat accuraci mean test statist comput exce tabl mean unequ statist higher accuraci significantli superior lower observ tabl ii model perform model vowel data model medic network size number sweep model vowel data model medic classif perform test set margin model significantli higher number link train sweep requir compar model observ incorpor domain knowledg rough set boost perform modular approach ga improv effici model model encompass principl model result redund effect model variat classif accuraci model iter studi model found high recognit score begin evolutionari valu attain model lowest attain model backpropag case vowel figur model converg iter provid highest accuraci compar model backpropag base model requir iter converg note train algorithm suggest success structur connect weight figur vowel weight valu fuzzi mlp train bp tabl ii compar perform model model model model model model fm model train test train test train test train test train test vowel data link sweep pat data link sweep medic data link iter standard deviat fig histogram plot distribut weight valu model model vowel data uniformli distribut maximum minimum valu modular mlp weight valu major weight high infer model result network weak incorpor rough modular concept ga produc network strong link suitabl rule extract connect train network shown figur rule extract algorithm explain section extract rule train network rule compar obtain subset method method pedagog method fig posit connect network obtain vowel model line weight greater valu method term perform measur set rule extract network present tabl iv certainti factor valu fuzzif paramet membership function mention medic data present fuzzif paramet featur extract rule comparison perform indic extract rule present tabl iii network obtain model fewer gener rule number high certainti factor possess higher percentag uncov accuraci suffer subset algorithm achiev highest requir largest number rule comput time time subset method margin model size rule base significantli model accuraci achiev model pat data user accuraci perform obtain model algorithm requir comput time achiev tabl iii comparison perform rule extract method pat medic data algorithm accuraci user kappa uncov cpu time conf accuraci region rule model subset model subset model subset al rule conf index minimum rule extract model high fidel pat medic data part conduct comparison model fm rule extract observ perform degrad substanti network structur compar model rule extract vi discuss methodolog modular evolut genet algorithm design network pattern classif rule gener present algorithm involv synthesi mlp encod rough set rule class modul refin ga genet oper implement preserv modular structur evolv methodolog modular network decomposit result train network compar classif compar earlier hybrid model develop rule extract algorithm extract rule compar relat rule extract techniqu basi quantit perform indic introduc evalu confid ambigu found satisfactori observ methodolog extract rule high certainti factor low comput time soft comput potenti applic larg scale problem involv knowledg discoveri task case base reason relat mine classif rule refer neural soft commun vol pp rough theoret aspect reason kluwer intern journal comput inform vol pp pal rough fuzzi trend springer fuzzi knowledg encod ieee transact neural vol pp issu vol network rough set approach lectur note artifici intellig pp springer classifi neural intern journal comput inform vol pp fault high voltag power rough fuzzi neural comput direct rough data mine granular soft pp springer jf rough neural comput base rough neural intern confer rough set current trend comput banff pp pal optimum set weight layer network genet inform vol pp pal genet algorithm pattern crc boca truth direct challeng extract knowledg train artifici neural ieee transact neural vol pp mitra rule survei soft comput ieee transact neural vol pp evolut modular neural network neural vol pp domain ieee transact vol pp towel refin rule tabl iv rule extract train network pat medic data input fuzzif paramet valu vowel data cf cf cf cf cf cf cf cf cf cf featur cl cm ch featur featur cl cm ch featur featur cl cm ch featur pat data cf cf cf cf cf cf cf cf featur cl cm ch featur featur cl cm ch featur medic data cf cf cf cf cf cf cf featur cl cm ch featur featur cl cm ch featur featur cl cm ch featur featur cl cm ch featur neural machin vol pp liu fast rule ieee intern confer system man pp pal fuzzi set ieee transact neural vol pp pal fuzzi mathemat approach pattern john wilei skowron discern matric function inform intellig handbook applic advanc rough set pp kluwer skowron rule base discern matric intern workshop rough set soft san pp algorithm neural network ieee intern confer neural pp genet algorithm optim machin interpret artifici neural ieee transact knowledg data vol pp survei critiqu techniqu extract rule train artifici neural vol pp rosenfeld agreement measur themat classif engin remot vol pp test statist john comparison accuraci involv vol pp ross program machin morgan mine soft comput ieee transact neural soft comput case base springer professor distinguish scientist indian statist found head machin intellig unit receiv tech phd radio physic electron receiv phd electr engin imperi london work berkelei colleg park visit nasa johnson space texa guest investig senior research hong kong polytechn hong kong visit professor serv distinguish visitor ieee comput societi region prof pal fellow world academi nation academi scienc india research interest includ pattern imag data soft neural genet fuzzi system book includ fuzzi mathemat approach pattern john wilei pattern recognit method soft john ny hundr research public receiv prize award scientist research nasa tech ieee tran neural network outstand paper nasa patent applic ram gold om foundat award scientif intern award republ sy indian nation scienc academi prof pal associ ieee tran neural network pattern recognit int pattern recognit artifici appli inform fuzzi set fundamenta execut advisori editori ieee tran fuzzi int journal imag int journal approxim guest editor journal includ ieee comput obtain sc physic tech tech comput scienc phd comput scienc indian statist european laboratori intellig techniqu german academ exchang servic fellow associ professor indian statist join recipi nation talent search scholarship nation council educ research ieee outstand paper award fellowship book pattern method soft comput paradigm publish john fifti research public visit professor japan research interest includ data pattern fuzzi artifici neural network soft comput obtain tech electr engin indian work scientist center artifici intellig india senior research fellow indian statist research interest area data mine knowledg pattern learn theori soft comput
ML/1680 6 author jami queen mari west eld colleg depart comput scienc mile end london uk data jami research fellow machin vision group queen mari west eld london jami receiv honour comput system engin australia embark project imag analysi group sydnei investig symmetri detect data set jami return adelaid undertak phd collabor research centr signal inform investig genet program pattern recognit jami receiv phd research interest includ pattern adapt human track behaviour model gong reader comput vision learn england receiv inform theori measur electron scienc technolog china comput vision oxford recipi queen research scientist award royal societi research fellow industri research fellow research fellow european esprit ii project view current research interest includ dynam model human gestur tempor predict visual bayesian statist learn visual surveil visual mediat interact summari paradigm perceptu fusion robust solut comput vision problem combin output multipl vision assumpt constraint modul factor result robust system integr di erent modul regard form data fusion framework fuse di erent inform sourc estim covari observ framework demonstr face pose track system fuse measur skin colour track head pose face posit singl camera track head pose face posit perform simultan algorithm covari state quantiti learn exampl order estim state propag densiti correl face head posit model observ likelihood function data fusion covari introduc constraint tracker robustli estim head pose track face posit simultan fusion perceptu cue robust track head pose posit jami gong depart comput scienc queen mari west eld colleg london uk abstract paradigm perceptu fusion robust solut comput vision problem combin output multipl vision assumpt constraint modul factor result robust system integr di erent modul regard form data fusion framework fuse di erent inform sourc estim covari observ framework demonstr face pose track system fuse measur skin colour track head pose face posit data fusion covari introduc constraint tracker robustli estim head pose track face posit simultan kei data pose similar face recognit introduct approach comput refer perceptu involv integr multipl sensori modul arriv singl output sensori modul physic video comput di erent inform data fusion approach integr di erent sourc perceptu inform data fusion accuraci measur overcom sensor uncertainti part work fund epsrc project preprint submit elsevi preprint march sensor output bene data fusion comput vision problem di erent sourc undergo fusion base di erent invalid time perform data assumpt fusion reduc system depend invalid priori assumpt make system robust data fusion bene cial primari issu combin fuse output system possibl dispar covari estim fuse output perceptu sourc covari modul output estim train system constraint mutual constraint observ approach improv robust advantag constraint deriv practic measur heurist demonstr approach case studi pose estim implicitli requir accur face posit align track time section describ head pose estim base similar prototyp track pose face posit perform algorithm covari state quantiti learn exampl order estim state propag densiti correl face head posit model observ likelihood function experi section draw section fusion head pose posit align robust pose estim video sequenc real time nontrivi implicitli requir face detect develop method pose estim base similar face prototyp suitabl tempor trajectori tilt yaw angl comput video sequenc criterion noisi local face posit imag determin independ exist method reli polhemu orient posit sensor worn subject obtain face posit reli ident subject describ method track head pose face posit fuse similar measur skin colour inform made robust estim covari pose estim similar space face repres vector similar prototyp face concept illustr figur pose similar vector face comput pose compar vector pose case similar measur euclidean expect magnitud vector correct pose minimum correct pose criterion subject local minima constrain criterion focu relev assum similar vector vari smoothli subject compound criterion includ distanc current previou similar similar vector time mix paramet major problem automat pose track current imag face locat initi posit pose assign search region pose imag space seek minimum criterion method criterion subject sourc local optima distract search wrong scale input face poorli align illumin condit imag poorli align posit pose similar measur incorpor visual cue track pose similar measur track algorithm requir simultan track face posit scale di erent quantiti fuse tracker approach fail quantiti assum independ tracker state covari estim track tracker constrain robust tracker easili misl local optima similar measur lose track face posit pose tracker made robust incorpor addit visual inform skin colour determin approxim face posit skin colour ectiv visual cue easili comput frame skin separ head tracker suppli bound box head posit imag head box gener larger face displac head face box posit addit constraint correl head pose displac exploit track adopt densiti algorithm particl ltere method model arbitrari state distribut maintain popul state sampl likelihood compar kalman lter singl gaussian densiti base commonli adopt tempor gener exibl due propag arbitrari densiti model state sampl consid multipl current state suit recov distract distract gener manifest local optima face similar measur criterion measur state sampl probabl updat drift di state sampl modi ed determinist compon obtain knowledg random perturb base probabl distribut state step equat sampl distribut measur state distribut calcul likelihood jx state sampl likelihood function knowledg problem track head pose face state de ned consist face posit respect scale face head yaw head tilt scale ratio face box size prototyp imag size similar measur tracker input imag head box posit independ skin colour tracker track state distribut jx model model distribut track measur quantiti fuse covari estim fuse state quantiti state propag distribut previou applic heurist drift arbitrarili ad independ gaussian element state approach problem paramet estim tracker lose lock assumpt independ state element search space comput resourc tracker distract local optima approach fuse state element estim covari person turn correl chang face box posit state chang frame state transit covari matrix estim train video sequenc peopl vari head pose freeli number scene result sampl frame head pose face posit measur polhemu sensor attach subject head estim state transit covari matrix distanc measur pixel angl measur size measur pixel chang ratio correl state intuit appeal strong correl chang tilt horizont quantiti higher magnitud vertic quantiti constraint make state sampl robust ecient assum correl independ absolut pose state updat distribut model exp fuse measur distribut jx base similar criterion displac face head posit sign erenc centr face head box distribut jx weight function model densiti function express depend face box yaw angl function incorpor observ correl absolut face posit pose displac due vari neck hair colour illumin condit compon work constrain tracker correct pose face posit constitu densiti de ned weight function high probabl low vice exp min min minimum standard deviat observ set train sequenc displac densiti function base observ facial posit displac correl pose subject turn head box surround face move box surround head stai central covari absolut face posit head pose rel face posit function constrain face posit lie close head posit tracker distract displac densiti model shown schemat figur densiti function model gaussian distribut standard deviat depend yaw angl solid line gure show vari yaw displac measur video sequenc extrem yaw frontal view high probabl small extrem yaw high probabl larger sign displac state face posit head tracker posit low probabl experi system base method develop test record live video sequenc subject constantli vari head pose sequenc shown illustr sequenc frame long initi face posit detect support vector machin base gener face model svm classi er face view frame track figur show initi face box detect svm box obtain spatial cluster pixel svm search box face box head tracker perform search face box obtain head box simplifi subject initi assum face camera give polhemu sensor worn subject obtain approxim head pose angl comparison pose tracker imag independ polhemu yaw tilt angl estim track time tracker compar measur polhemu figur hundr state sampl tracker tracker approxim track head tilt yaw angl exampl continu visual output tracker shown figur frame show imag crop track face track head pose intuit dial tracker accur face head pose time tracker momentarili lose lock face posit start move face regain lock system start lose pose recov gradual time abil tracker recov loss lock demonstr import fuse face posit pose tracker wander incorrect pose demonstr role covari estim tracker remov covari inform tracker step requir element state covari matrix set remov distribut tracker fulli lose lock recov frame result shown figur rst frame track pose angl deviat face box goal similar criterion local tracker unabl regain lock concept data fusion covari estim demonstr face posit align pose track system face posit head pose fuse form state updat measur model pose tracker principl approach fusion di erent visual cue addit constraint improv robust refer mj black ad jepson probabilist framework match tempor recognit gestur express page jj clark al yuill data fusion sensori inform process system kluwer academ mckenna learn associ face view vector space similar prototyp british machin vision volum page septemb isard blake condit densiti propag visual track support vector regress classi cation base face detect recognit ieee int conf face gestur march mckenna gong real time pose estim intern journal real time special issu visual monitor inspect ng gong learn support vector machin face model british machin vision page septemb ng gong support vector machin face detect pose estim frontal pro le view ieee intern workshop track face gestur realtim page septemb gong track segment peopl vari light condit colour proc ieee int conf automat face gestur page fig illustr face di erent peopl di erent pose angl face compar prototyp face pose similar function similar measur concaten similar vector eleven prototyp repres face similar vector pose dimens yaw fig illustr head face box set probabl densiti skin colour face region head tracker box fig inform pose tracker time yaw track polhemu yaw time track polhemu tilt time yaw track polhemu yaw time track polhemu tilt fig measur track head pose angl test sequenc fig continu face posit align pose track time frame show imag crop track face track head pose time yaw track polhemu time track polhemu yaw tilt angl rst frame test sequenc camera track face pose dial frame fig result pose tracker sequenc covari
Agents/1681 1 framework transact laboratoir swiss feder institut technolog switzerland daniel andrew technolog center dr usa abstract internet technolog creat revolut peopl interact busi interact rapidli transform evolv dynam autom solut commerci servic repres fundament compon develop suppli main idea provid support deploi softwar instrument enabl autom transact current autom servic web interfac ad hoc tool requir lot human interact agent technolog approach evolv flexibl dynam solut social softwar entiti act behalf final busi oper direct human involv paper describ system support autom busi transact aim evalu main potenti major limit suppli servic deploi agent softwar environ keyword electron ontolog introduct internet technolog rapidli evolv radic modifi peopl interact number virtual facilit transact bring vast number potenti buyer seller busi interact busi custom busi busi rapidli transform dynam autom solut servic repres fundament basi develop electron commerci activ main idea provid support deploi softwar instrument enabl task autom improv broader set servic offer common exampl autom servic reli combin instanc credit card grow electron system autom web interfac ad hoc tool requir larg human interact transact payment perform human enter code press button specif graphic interfac servic offer final combin inform facil differenti servic provid integr kind approach evolv custom channel autom fulli integr busi applic drive product servic consum analyst predict futur peopl physic institut branch log internet deal bank task human deleg manag bank loan credit person electron assist import concept softwar entiti act behalf human servic provid autom electron busi commerci activ servic market trend servic price negoti scenario facilit servic increasingli incorpor part larger packag primari product credit insur develop specif tool bill payment detail found transform retail andersen consult industri intern public conjunct car agent technolog approach design implement intellig social electron assist softwar agent evalu util specif action gather process huge amount inform follow specif strategi effici rapidli human tradit mechan argu agent futur busi transact agent properli implement servic softwar environ true current agent technolog field opportun influenc servic suppli order evalu main potenti major limit transact system develop fat system entiti person assist agent act behalf final agent repres institut kind exist onlin busi specif agreement form relationship exist busi entiti dynam interact enabl agent modifi contact offer cancel previou plan paper concentr basic mechan support servic environ describ fat system show agent support replac human tradit busi aim evalu potenti autonom agent evolv transact requir support evalu preliminari step prove desir integr agent technolog exist electron market section detail overview trend servic provis develop central part paper fat system section depict specif section section discuss approach hope stimul contribut product discuss main challeng success autom section current achiev work comment futur develop area trend busi defin entir set process mechan support busi activ electron involv inform process ffl electron product access product price ffl autom transact servic level busi busi custom ffl direct sell sell end user world interact interact figur consid final servic offer fundament compon servic activ content sell sell ffl set access manag oper account credit card servic trade stock market fund manag properti life insur manag mortgag loan wealth manag set integr servic includ plan facil consid final servic offer fundament compon servic activ deploi mechan electron fund figur evolut servic plai import kei role futur transact tradit approach evolv autom control unabl cope servic grow urgent dynam servic interact agent approach support evolut busi driver main factor interest agent technolog divid applic pull busi orient innov solut increasingli cope technolog push technolog develop techniqu make agent real place ffl market rapid growth electron market commerc forc major busi oper practic servic includ servic provid competit kick start industri wide drive effici ffl flexibl usag market differenti custom demand flexibl servic servic provid offer onlin servic appli bank account onlin servic offer good flexibl final end full autom advanc ffl servic number distinct continu grow diversif creat complex heterogen network infrastructur technolog challeng provid uniform coher servic integr servic forc move virtual place lack integr servic contribut complic scenario driver combin produc complex electron market architectur requir major profil chang salari pictur chang life mortgag car order financ relat provid inform order accur date solut issu secur interact servic increasingli replac concern busi provid complex integr partli address gener electron wealth manag custom relationship manag meet challeng list map requir plan dynam technolog push factor agent applic remain small pilot project research laboratori kei reason network architectur agent chang ffl larg number toolkit enabl develop quickli build system product initi includ jade open sourc compani offer servic exampl found implement fipa standard specif jatlit jack mobil agent system aglet dagent top toolkit includ reason capabl gui manag tool deploi agent ffl virtual market deploi agent al explor auction mechan rout servic demand telecom network manag softwar agent al develop market model resourc alloc al deploi price approach differenti internet servic offer agent identifi strategi broker al model power load manag comput market ffl collabor framework worldwid initi design realiz commerci research potenti applic object construct worldwid network agent platform base fipa standard platform support institut host popul agent access servic result design experi agent verifi impact technolog larg popul potenti custom act unifi system facilit develop interact potenti provid market servic offer integr includ servic agent technolog matur softwar develop paradigm develop environ standard build confid agent techniqu compani invest agent technolog tool provid final applic current european ist project investig benefit agent technolog field includ busi integr inform import initi involv agent technolog initi mit develop workshop sig vision agent technolog plai fundament role chang relationship consum fipa group aim promot emerg servic equip relationship onlin busi servic provid distinct partner custom control access wider rang servic servic provid dynam interact aggreg exist ad gener complet servic packag reli heavili custom model specif appli insur polici basic access electron interfac electron assist interact insur provid creat tailor solut base specif consum requir prefer softwar agent provid wide rang invest possibl dynam manag portfolio servic sophist facil negoti coordin make handl complex heterogen situat agent offer broader rang servic due greater dynam combin servic partner avail detail knowledg custom profil dynam suppli person assist servic provid agent offer complet tailor packag match custom requir challeng requir complex interact system individu develop robust inform reason system evolut agent major challeng lie vision flexibl autom integr busi system rise fore ffl integr agent infrastructur exist base environ legaci task complex diversifi access channel embrac mobil atm ffl develop usabl simpl agent commun framework includ complex formal semant logic model agent commun content express ontolog dynam flexibl agent coordin servic aggreg easili implement ffl secur interact build busi system reli electron platform notion trust redefin main characterist electron environ emerg technolog account build appropri secur framework fat framework repres electron market econom transact reli mechan suppli softwar agent requir model type trade servic entiti access market specif market infrastructur mean ffl defin infrastructur make softwar entiti capabl particip transact reason capabl busi ffl implement technic facil enabl specif interact ad hoc interact negoti ffl defin common knowledg ontolog includ fundament bank agent commun suffici abstract manner ffl defin secur polici regul transact combin data encrypt mechan implement polici develop tool deploi implement fat system ffl jade ffl java develop kit sun microsystem ffl tool facilit model jade softwar develop framework aim develop system applic conform fipa standard intellig agent jade suppli main agent platform packag develop java agent model good servic abstract gener type offer fat market order enabl autom transact electron entiti repres busi formal common interpret trade distinct entiti market intern common global minim agreement common express agreement correspond adopt common ontolog refer speak similar concept ontolog definit ontolog repres common vocabulari includ definit describ specif domain system work share ontolog share ontolog implicit explicit implicit ontolog typic repres convent procedur explicit ontolog explicit declar defin knowledg languag defin ontolog design underli model domain term action token symbol term refer element assign encod rule constraint captur import aspect domain model fix fat ontolog model bank servic model sick insur servic extrem complex swiss sick insur simplifi model implement larger number exist sick insur vocabulari action ontolog defin frame frame tabl divid type reserv valu frame defin concept agent column frame slot slot attribut defin frame short explan slot column data type displai column data type repres list long float point descript complex type defin slot specif valu reserv valu displai column extens effort provid machin access descript data adopt xml base busi context futur work includ xml version interact protocol ongo agent fall typic pattern messag sequenc expect point messag expect follow typic pattern messag call interact protocol fat order facilit effect agent develop context standard fipa interact protocol adopt ip ffl protocol agent request agent perform receiv agent perform action ffl receiv agent request perform kind inform action ffl agent solicit agent issu call specifi task formal ontolog recov page eco xml basi defin framework busi interact condit manag place execut task contractor includ precondit contractor set time task market actor fat distinct softwar entiti differ role cover servic offer transact softwar agent plai role good servic gener agent buyer seller depend specif transact order facilit task decomposit agent distinguish person assist agent act buyer servic provid agent act essenti seller transact servic provid agent buyer servic main type agent implement person assist agent final end user consid potenti offer fat market access bank servic order ffl open close account check credit card ffl inform account special rate ffl order payment monei fund transfer interact provid agent fat market order good access servic consid global person assist act behalf final end user situat meet travel paper focu primarili negoti potenti seller insur polici interact bank agent servic provid agent servic provid good repres agent capabl negoti agent market negoti potenti custom peer provid place find agreement servic properti good sale deliveri handl form choic payment option spa offer depend kind relationship establish acquir bank card compani focu provis insur insur provid agent offer main ffl inform retriev polici term ffl creation closur ffl polici manag coverag ipa interact bank institut relationship establish bank agent act behalf bank institut bank busi provid accept credit card call acquir bank provid account deposit batch card sale bank acquir batch sale slip credit provid account bank submit bank charg interchang network directli bank extend credit custom bank card account call bank ba act acquir bank main kind servic offer ba ffl inform retriev bank servic inform ffl creation closur bank credit card ffl dynam manag inform servic ba support main ffl check balanc current account check ffl transfer custom multipl bank account initi fund transfer account account holder transfer monei person bank account extern ffl view ffl electron view bill request pai check account check account transfer monei save check pai ffl credit card servic fat insur servic provis mention order show autom bank servic deploi basi busi insur servic provis integr fat system kind relationship establish ba ipa consid interact transact place distinct ba ba ipa ipa electron bill electron notif payment order electron notif verif figur main phase payment monei transfer descript simul scenario decomposit interact basic step defin specif servic capabl softwar agent market support insur servic provis insur agent inform custom health insur offer access polici price offer sale channel major task describ characterist type insur attribut main type health insur ffl basic compulsori insur cover risk accid matern ffl complementari insur offer servic prevent home base gener simplifi model swiss sick insur system implement idea provid insur servic orthogon market framework base futur gener servic provid expect provid movement provid wealth manag servic final plan tool aggreg includ insur singl integr view scenario implement main evalu feasibl effect autom transact payment order scenario figur mari stipul insur polici mari order bank agent transfer mari bank account account mari account ub bank ba manag negoti negoti success agent find common agreement insur polici price depend specif polici agent negoti final agreement includ inform specif kind contract kind agent plai role buyer agent plai role seller negoti termin pai ipa seller suppli servic buyer depend type payment method explicit interact ba requir make payment ipa bank account inform ba transfer amount monei ipa account ba account monei transfer inform provid transfer transfer ba verifi mari account monei make payment ba transfer amount monei buyer account seller account case monei mari check ba notifi mari decid autonom transfer monei save account check account notifi transfer monei check notifi fact payment servic negoti fail ipa deliv servic deliveri subordin payment complet depend agreement ipa reach negoti ipa final interact ba order verifi monei transfer account interact initi payment order mari stipul insur polici mari order ub bank transfer mari bank account account account manag bank agent bank step case previou scenario make differ interact transfer monei independ servic deliveri servic deliveri monei transfer ub cs focu develop techniqu mechan support agent relationship credit card base payment scenario figur mari stipul insur polici mari pai amount monei mari credit card account bank ipa payment order electron receipt payment order electron receipt acquir bank figur main phase credit card payment scenario bank agent act acquir mari success negoti termin agreement specif insur polici price mari pai mari credit card account ub bank bank ipa negoti type credit card accept payment american depend kind exist payment infrastructur instal servic provid ipa accept specif card exist electron infrastructur accept visa credit mari secur submit credit card inform ipa interact payment wai relat kind agreement acquir stipul ipa submit custom payment data amount monei credit card credit card verif electron receipt forward ipa credit card inform messag back failur messag explain failur reason interrupt ba report complet transact custom receiv electron receipt ipa previou enabl mari eventu print receipt refer discuss fat system implement rough estim aspect feasibl effect autom transact current trend aggreg servic includ mechan challeng problem futur onlin busi face area concept agent es technolog architectur gap current system great potenti agent provid mean ffl abstract technolog technolog improv ffl enabl richer flexibl interact user provid provid provid interact automat exchang task agent servic potenti import main challeng effect tradit issu build softwar instanc address commun interact complic introduct busi mechan produc agent impli addit specif time rule polici difficult implement virtual import commun overhead number agent scale capabl reason quickli adapt dynam chang introduct import comput support order behav strateg inher problem busi transact internet data travel public network easili affect custom busi owner compani find wai ensur secur sensit applic commun agent bring question research issu fundament understand dynam mechan order converg notion trust number busi transact reli credit charg bank card specif payment mechan involv relationship root trust good faith final end user trust institut issu credit card pai merchant good servic merchant trust card pai card trust end user pai bill time month monei advanc behalf build busi system reli electron platform notion trust redefin main characterist electron environ emerg technolog account build trust model fact comput paradigm creat open evolv world reli partial autonom make risk unpredict trust crucial work secur fat system aim provid secur mechan protect regul agent transact start concret aim final converg trust model gener valid softwar agent industri fundament impact futur develop servic busi tradit bank activ plai import current trend suggest autom solut prefer electron advisor autom product servic bring benefit custom institut term servic servic number intellig agent orient project fipa standard run year aim build publicli fipa agent base servic main idea fat possibl integr bank insur servic evalu realist kind impact servic larger popul level servic integr secur mechan servic evolv vast differenti electron environ acknowledg freder fundament work implement fat system steven preciou suggest refer mae electron survei knowledg engin kumar feldman internet auction technic market base approach distribut resourc alloc applic commun network control paradigm distribut resourc page world ma jen nr dynam resourc alloc rout telecommun network intern workshop intellig agent telecommun applic juli tuoma sandholm gener electron commerc server carl gini jeffrei intern confer autonom agent page june acm press market price differenti internet servic proc intern workshop qualiti servic june tan walter trust model electron commerc appli artifici intellig septemb fredrik han akkerman power load manag comput market victor intern confer system mit
Agents/1682 1 la ricerca povo itali softwar develop model diagram giunchiglia mylopoulo novemb technic report istituto di limit distribut notic report itc copyright accept public issu technic dissemin content view copi tot distribut public limit peer commun materi form author copyright owner softwar develop model diagram giunchiglia depart inform commun technolog trento itali john mylopoulo depart comput scienc toronto canada anna itali abstract softwar develop methodolog found kei notion plan knowledg level concept fundament primit uniformli softwar develop crucial role assign requir analysi specif analyz respect intend environ paper detail account methodolog describ basic concept found type model build analysi process design flow extern system actor goal analysi deleg provid abstract syntax diagram linguist construct keyword softwar engin introduct applic area applic servic provis comput call softwar system evolv oper robustli exploit resourc environ build practic softwar engin discov import mechan coordin softwar compon expect turn multiag system technolog methodolog guidanc support build softwar system futur expect detail account process cover phase softwar develop requir analysi implement permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee copyright acm object orient structur softwar develop methodolog exampl breadth depth detail expect paper problem provid detail account softwar system develop softwar engin system methodolog begin model environ eventu oper model term goal interdepend increment model extend includ repres actor deleg goal plan execut resourc furnish languag found small set concept tool techniqu build model repres actor posit intent model captur intent stakehold system respect architectur system detail design model provid common interfac softwar develop earli requir implement part document softwar system oper mainten kei featur knowledg level plan phase softwar pivot role assign requir analysi environ analyz phase cover methodolog earli phase relev stakehold respect stakehold repres object repres late introduc actor relat stakehold actor term actor oblig system system expect actor architectur system actor introduc assign subgoal subtask goal task assign detail system actor defin includ specif commun coordin produc detail transform skeleton implement map construct agent program platform jack code ad skeleton program languag support program platform methodolog motiv illustr case studi paper present methodolog detail rest paper structur section present primit knowledg level concept build type illustr exampl section describ analysi process guid model evolut develop phase model languag defin section term uml relat work discuss section direct research present section concept model conceptu model diagram develop instanc intent social belief discuss turn actor notion actor model entiti strateg goal actor repres physic agent softwar agent role posit role abstract behavior actor special posit repres set typic plai agent agent occupi posit cover role notic notion actor gener classic ai notion softwar instanc discuss issu found goal goal repres strateg interest actor framework distinguish hard goal definit criteria satisfi model softwar qualiti perform maintain depend depend actor actor depend order attain execut deliv resourc actor call call object plan depend center call depend actor achiev goal unabl achiev depend vulner fail deliv depend affect abil achiev goal internet cultur inform citizen museum provid cultur servic visitor enjoi visit actor goal goal depend depend pat tax spent figur actor diagram stakehold system plan plan repres satisfi goal resourc resourc repres physic inform entiti actor deliv capabl capabl repres abil actor execut plan fulfil oper environ belief belief repres actor knowledg world notic notion goal plan kei concept bdi framework notion capabl agent notabl jack agent program platform notion resourc stem straightforwardli analysi aim identifi model concept softwar develop process notion interest turn import model intent actor knowledg similar role associ uml class concept build type model develop process illustr exampl extract substanti softwar system develop govern di partial system call broker cultur inform servic provinc includ inform obtain cultur organ event varieti includ citizen visitor exampl goal plan model type model discuss pat system provid servic usabl system system portabl scalabl tempor virtual visit educ servic provid info make reserv cultur info logist info extens system flexibl system internet technolog user friendli system figur actor diagram includ pat system goal diagram system lack exampl actor depend model actor depend model result analysi social system goal depend goal achiev type model built earli requir phase focu applic domain intent depend interleav actor depend model graphic repres actor diagram actor depict goal oval cloud shape network depend relationship actor depict arrow line connect graphic symbol vari plan resourc figur show actor diagram domain result earli requir analysi actor citizen singl relev cultur actor visitor enjoi visit similar actor pat internet actor museum provid cultur servic actor model extend late requir phase ad social actor figur actor pat deleg set goal system actor goal depend provid goal contribut main goal pat internet extens flexibl usabl internet technolog actor model architectur design level provid detail account actor intern structur structur term subsystem interconnect data control flow model depend model basi capabl activ start architectur design map system actor softwar agent figur illustr portion actor diagram built system reserv broker system interfac user interfac system interfac manag user interfac manag info broker provid info educ servic make reserv virtual visit provid interfac educ broker virtual visit broker system manag figur actor diagram architectur organ system ing architectur design system actor deleg goal system depend info broker provid educ broker provid educ reserv broker make virtual visit broker provid virtual system manag provid interfac goal plan model goal plan model design analyz goal plan perspect specif actor basic reason contribut decomposit analysi proce refin goal subgoal order identifi resourc provid mean achiev goal contribut analysi design point goal contribut posit neg reach goal analyz contribut analysi consid special case mean goal decomposit combin decomposit root goal refin goal structur goal model develop earli requir actor goal figur show portion goal model rel goal citizen deleg pat earlier goal analysi goal plan model depict goal diagram repres perspect specif actor balloon graph node goal plan arc repres type relationship identifi node figur goal internet system serv contribut goal build system actor analysi perform identifi posit neg contribut goal tax spent posit contribut good goal internet pat tax spent internet infrastructur system educ citizen reason good cultur servic museum system good servic build system offer infrastructur provid servic analysi provid interest system figur goal diagram pat build system goal model plai analog role identifi actor depend late requir architectur design figur show goal diagram develop late requir analysi concentr goal provid servic usabl system goal provid servic subgoal make provid educ servic virtual visit goal provis logist info cultur info logist info concern timet visit inform cultur info concern cultur content special cultur museum content includ descript imag histor object histori region virtual visit servic citizen pai virtual visit citi past rome educ servic includ present histor cultur materi level detail high school undergradu onlin evalu student grasp materi make reserv citizen make reserv cultur guid museum visit develop process previou section introduc primit concept support kind model build term softwar develop project section focu gener design process model construct process basic analyz goal behalf term determinist concurr includ complet criterion note process carri softwar engin softwar process begin number list root goal includ root goal analyz perspect respect subgoal deleg actor deal analysi carri concurr respect root goal process requir introduct actor deleg goal task process complet goal dealt satisfact actor design assum includ finit set list goal actor store assum includ list goal actor undertaken achiev person plan select goal empti includ list depend includ plan pair indic mean actor achiev goal store goal graph gener design process root goal initi actor link treat global variabl access updat procedur present paramet variabl procedur global procedur begin actor end end end concurr end concurr end procedur procedur conduct concurr goal analysi root goal root goal analysi conduct initi goal actor root goal creat goal deleg exist actor note concurr statement spawn concurr call element list call spawn root goal ad concurr assum termin thread predic satisfi check root goal satisfi predic comput term label propag algorithm detail scope paper succe set select current execut procedur lead satisfact root goal procedur conduct concurr goal analysi subgoal root goal root goal concurr select concurr goal decid adopt person deleg exist goal treat unsatisfi goal subgoal ad augment includ goal relationship parent goal note select actor deleg goal creation actor oper highlight font point design softwar system creativ design procedur concurr goal case expand begin end end solv deleg begin actor end begin actor end fail deni end case end concurr end procedur lack left imagin reader add goal actor goal list goal deleg actor goal root goal respect actor deleg call spawn updat procedur simpli select plan goal actor handl person actor capabl list process present provid extens capabl list deal newli assign goal level descript exampl meta basic languag metamodel structur element entiti metamodel knowledg level notion depend domain applic domain entiti museum instanc domain model instanc instanc citizen tabl level architectur metamodel procedur begin goal end end procedur procedur begin plan plan satisfi end end procedur earli process analyz goal extern actor point introduc actor deleg subgoal gener analysi architectur system actor introduc deleg subgoal goal gener goal actor order fulfil goal extern develop process includ specif step phase consist node model shown figur specif formal languag detail specif add captur semant subject domain specif simul model check technolog valid model languag model languag core methodolog abstract syntax languag defin section term uml metamodel standard approach metamodel organ shown tabl architectur make languag extens construct ad semant languag power fragment tempor logic handl wont discuss level basi metamodel extens languag primit construct metamodel level construct model knowledg level entiti concept domain model level entiti concept specif applic built instanc metamodel level construct exampl section illustr portion domain model instanc model level instanc domain model lack focu metamodel actor goal depend actor depend belief plan resourc goal believ figur actor concept metamodel actor portion metamodel concept actor shown uml class diagram figur actor repres uml class actor goal uml class goal repres hard goal uml associ relationship actor belief belief believ actor actor depend relationship repres uml class depend relat defin option reason depend exampl depend relationship shown figur earli requir model depict figur show depend actor citizen pat metamodel concept defin analog partial descript report complet descript languag metamodel found tax actor citizen pat plai role depend analysi goal resourc plan decomposit root root contribut contribut contribut actor end figur goal concept metamodel goal concept goal repres class goal uml class diagram depict figur distinct hard captur special goal subclass goal point view perform contribut analysi decomposit order turn analysi ternari relationship defin point view repres goal resourc goal analysi weak form consist discoveri plan resourc provid mean reach goal analysi model shown figur goal educ citizen provid provid interest system mean achiev goal internet contribut analysi ternari relationship point view goal contribut analysi strive identifi goal contribut posit neg fulfil goal associ relationship label contribut figur contribut annot qualit denot goal contribut posit goal metric analog plan contribut posit goal metric fulfil label goal plan contribut repres posit tion goal analyz label dual situat repres suffici partial neg contribut fulfil goal exampl contribut analysi shown figur instanc goal fund museum system contribut posit provid interest system good cultur contribut posit good servic contribut analysi appli evalu requir decomposit ternari relationship defin root goal subgoal case root goal singl subgoal contribut relat work import featur methodolog aspir span softwar develop earli requir implement repres figur show rel coverag kao gaia mase auml kao earli late requir detail design architectur design requir gaia auml mase figur comparison softwar develop methodolog cover full rang softwar develop time exist work earli late requir advantag work requir engin eric yu methodolog interest note methodolog combin softwar develop paradigm earli develop phase uml phase work auml exploit exist uml techniqu version softwar develop figur idea adopt auml detail design phase metamodel present section develop spirit uml metamodel class diagram comparison uml class diagram diagram present section distinct ontolog level class diagram actor diagram softwar knowledg contrast defin kei differ develop methodolog agent actor thought special object class argu previou paper differ result ontolog shift note crucial notion uml plai role actor diagram isn final current state level view implicit adopt auml detail design phase paper detail account agent orient softwar develop methodolog span softwar develop process earli requir implement agent orient softwar paper present discuss phase support develop process model creat diagram describ model uniform small set knowledg level notion phase softwar develop provid actor goal refin algorithm refin process phase refin instanti differ phase long term object provid complet detail account methodolog structur softwar develop methodolog exampl breadth depth detail expect softwar develop methodolog remain achiev goal work open develop formal analysi techniqu formal transform process term primit transform refin strategi definit catalogu architectur style system adopt concept organ theori strateg allianc literatur develop tool support methodolog phase broad coverag softwar develop process essenti softwar engin earli requir phase methodolog provid convinc argument instanc methodolog methodolog inher found notion inher found ontolog primit fundament differ show softwar develop environ eventu oper understand environ call cri knowledg level model primit program paradigm program paradigm gracefulli seamlessli integr intent model earli develop phase implement phase argument justifi softwar time bright futur acknowledg project peopl work trento toronto special fabrizio complet master thesi model languag refer odel agent formal multiag softwar system int journal softwar engin knowledg jacobson unifi model languag user guid object technolog seri mylopoulo model earli requir transform base approach wooldridg al luca jack intellig agent compon intellig agent java technic report jan agent orient analysi wooldridg al mylopoulo develop methodolog proc int conf advanc inform system engin june mylopoulo requir softwar engin kluwer symbol model checker intern journal softwar tool technolog transfer march clark emerson design synthesi synchron skeleton branch time tempor logic workshop logic volum lectur note comput page yorktown kinni rao methodolog model techniqu system bdi agent de veld agent break proc european workshop model autonom agent van ficka requir acquisit scienc comput deloach analysi design mase agenttool midwest artifici intellig cognit scienc confer miami march april model check earli requir specif proc ieee intern symposium requir aug mylopoulo organiz perspect architectur proc int workshop agent languag august nixon repres approach ieee transact softwar june newel knowledg level artifici nwana softwar overview knowledg engin review novemb bauer extend uml agent proc inform system workshop nation confer artifici page omg omg unifi model languag version alpha januari mylopoulo knowledg level softwar engin methodolog agent orient program proc int confer autonom montreal acm una ed di visual master giunchiglia model languag user guid technic dec editor proc int workshop softwar engin kinni gaia methodolog analysi design journal autonom agent yu model strateg relationship process reengin phd depart comput yu softwar versu world softwar engin lnc
Agents/1683 1 scalabl issu queri rout servic discoveri nichola multimedia dept electron comput scienc unit kingdom wendi hall multimedia dept electron comput scienc unit kingdom abstract discuss relationship system servic discoveri techniqu queri rout resourc discoveri distribut inform system construct model queri rout task examin complex scalabl characterist number commonli encount architectur resourc servic discoveri keyword queri servic resourc middl scalabl introduct common problem encount multiag system locat agent provid servic connect problem servic discoveri problem system exibl interact compon agent wai necessarili foreseen design servic discoveri servic prerequisit multiag involv interact agent priori awar author note servic essenti compon system scalabl system depend extent scalabl mean system perform servic discoveri task develop scalabl techniqu servic discoveri kei import design larg scale system kei compon system address servic discoveri problem middl agent tackl servic discoveri maintain model capabl assess abil agent satisfi servic goal servic request pass agent satisfi servic discoveri task close relat resourc discoveri commonli found distribut inform system world wide web resourc discoveri task search distribut inform system order locat resourc characterist satisfi queri criteria resourc discoveri view servic resourc discoveri search data object sati es queri criteria view servic discoveri search agent provid access data object satisfi criteria size growth world wide web demonstr resourc discoveri system reli singl mediat scale agent system commonli reli singl mediat servic discoveri evolut scalabl system search world wide web er valuabl insight design scalabl system mediat agent servic discoveri recent develop le share perform resourc discoveri concentr distribut prime server interact peer structur system natur interact coupl make interest agent commun give overview techniqu queri approach distribut servic resourc discoveri describ relat queri rout mediat agent complex scalabl studi queri major empir studi system result studi gener applic choic dataset distribut data topolog queri rout ect behaviour system great extent analyt studi describ queri rout system term resourc discoveri remaind paper system er gener applic result paper present simpl model queri rout system examin complex scalabl number system topolog commonli encount queri rout mediat system queri rout queri rout type inform distribut search commonli resourc rst ned project search resourc distribut environ requir queri evalu server hold resourc distribut system queri rout server process queri descript summari form content server summari descript forward view partial knowledg capabl server client search queri rout exhaust queri server system queri singl server redirect replic queri remaind system server hold desir forward knowledg prune search space restrict scope search server queri replic server satisfi queri server queri rout system compar queri forward knowledg express determin server hold forward knowledg satisfi queri comparison satisfi pass process queri queri rout common mediat agent servic discoveri capabl model mediat agent forward knowledg queri rout restrict scope search mechan agent servic agent locat mechan present list acquaint replic capabl model restrict notion matchmak broker introduc notion referr deleg queri rout system matchmak referr client issu queri mediat respond refer server answer queri client commun request directli server broker deleg client issu queri mediat mediat pass queri directli server satisfi mediat receiv pass back client client mediat server figur matchmak referr server client mediat figur broker deleg forward knowledg mediat gener referr deleg queri result priori exchang data server mediat commun classi ed term independ qualiti exchang rst qualiti concern entiti initi data exchang initi call pull model forward knowledg initi call push model choic push versu pull import ect latenc forward pull model tradeo cost mediat poll server potenti forward knowledg poll lead increasingli date forward knowledg summari content carri server carri mediat potenti problem di erent techniqu appli di erent server mediat combin summari mediat avoid problem integr dissimilar costli perform mediat fetch entir content server order build summari appli queri rout mediat system import di erenc type system queri rout frequent assumpt made mediat hold forward knowledg capabl mediat resourc server queri rout system mediat forward knowledg repres abil servic request redirect queri entiti process request item forward knowledg mediat summari forward knowledg mediat hold entiti forward knowledg mediat queri rout queri pass chain mediat arriv server satisfi mediat chain mediat hold item forward knowledg successor satisfi process queri termin reach server end chain mediat system assign forward knowledg valid chain mediat exist queri discuss topolog queri rout scheme distribut forward knowledg queri sati ed server valid chain initi queri mediat server satisfi queri discuss scalabl queri rout system includ analysi complex process construct network forward knowledg queri process place queri rout search model model queri rout system model process queri match forward knowledg model graph topolog forward knowledg network identifi condit queri satisfact lai foundat explor ect di erent forward knowledg topolog scalabl knowledg match construct simpl model match process combin adapt tradit model inform retriev descript logic alu inform retriev model consist set set resourc descript set queri figur set relat function assign descript function map queri descript relev function combin previou function model map queri set resourc relev queri queri space descript space resourc space figur ir model model modi cation tradit model combin queri descript set give uni ed set resourc treat queri partial descript incomplet describ resourc semant descript primit concept primit role top bottom concept complement concept conjunct concept disjunct fx fx existenti tabl syntax semant alu treat forward knowledg summari partial de nition describ resourc model match process descript logic alu domain resourc queri resourc descript queri concept logic tabl interpret function denot semant logic map concept extens correspond map ir model resourc relev queri express lie extens resourc forward knowledg express lie extens note notion relev object binari resourc relev queri odd de nition relev literatur larg subject concern user inform retriev resourc satisfi classifi resourc relev slide scale subject relev system er full text search larg unstructur queri rout resourc discoveri servic discoveri system highli structur resourc ontolog capabl descript sort give object de nition relev base structur match uni cation subsumpt set concept extens singleton set correspond set tradit maxim speci resourc descript describ resourc descript thought analog ground term concept logic correspond queri forward gener express describ resourc express term construct forward knowledg express describ set resourc speci singleton concept descript resourc forward knowledg summari set resourc express subsum maxim speci descript resourc subsumpt relev test queri maxim speci resourc resourc relev queri extens maxim speci descript resourc subsum queri relev test queri forward knowledg express varieti exist queri rout system group system subsumpt relev test forward group includ group includ test express share element extens introduc symmetr relat repres relev test relat complet simpl model resourc forward knowledg summari queri notion relev forward knowledg graph queri present queri rout system sati identifi chain mediat initi server queri target server relev resourc gener referr deleg referr forward knowledg express gener relev queri precursor examin ect forward knowledg distribut complex queri rout model forward knowledg identifi properti graph made forward knowledg model forward knowledg adapt path calculu direct ei node edg label concept descript logic model match queri forward knowledg repres label function node label resourc held edg label repres forward knowledg held node set concept express descript logic de ned domain vi notion edg label extend label path adjac forward knowledg graph path label gener express satisfi edg express relev sucient referr gener vn figur path extens vn figur path summari parallel path propag queri path end hold resourc relev path vn oper extens oper give path label determin vn edg order vn queri process real associ forward knowledg graph path initi node target de ne summari oper combin label path order give express denot queri answer target start initi node system symmetr relat relev speci summari oper aggreg label vn path vn vn immedi summari oper system subsumpt relev relat envisag graph path vn vn label summari label path formul queri sati ed vn singl path summari label suggest queri smaller hold summari oper formul break part queri sati ed di erent path vn summari oper combin diverg repres rout figur path summari diverg path initi node figur summari path queri express relev path scalabl queri rout topolog forward knowledg queri rout search system plai great part ecienc scalabl system forward knowledg direct queri relev server effort queri server exhaust ideal ort expend grow slowli number server system expand ort requir construct suitabl network forward knowledg consid studi scalabl system order implicit network forward knowledg major exist queri rout search system server arrang hierarch manner omnisci root server group indirectli awar content server demonstr scale system domain system requir control exert server forc hierarchi di erent approach treat server peer model interact social major server close server knowledg distant server result graph disord make assumpt exist central author control structur network type kei aim properli label path exist server queri enter server server satisfi queri order network topolog provid simpl rule forward knowledg disord network bene techniqu akin convent rout algorithm effici measur inform retriev research focuss ectiv measur assess inform retriev concentr improv accuraci result system return ecienc commonli consid lesser concern ectiv system return poor qualiti result quickli return result recent studi note recent collect semin research paper singl paper ecienc advent rise distribut inform retriev chang state air extent web search engin pressur deliv result process evalu queri perceiv user complex link impact inform retriev system environ network resourc build index process vital import web search engin place heavi load network deem unaccept exist studi inform retriev ecienc made measur time process queri size index byte wholli empir studi exist model behaviour hypothet system abstract complex measur strongli relat amen studi ad model complex network latenc queri complex queri submit number request messag gener system compon messag measur commun complex queri process rate grow rel number server network indic scalabl individu messag trac server system show presenc server contribut global messag trac explicitli system oper mean referr deleg singl referr gener messag singl deleg system oper referr prone make redund queri server queri state queri store locat make easi remov duplic system deleg expect send redund exact ect quanti ed detail knowledg exact structur forward knowledg graph queri hypothet system oper synchron parallel round time entiti network commun neighbour run time queri process number round requir client receiv answer queri control complex messag trac gener submit queri measur system load normal process queri forward knowledg system forward knowledg built pass messag forward knowledg summari server forward knowledg graph ect queri messag constrain type referr inform graph messag exchang initi order construct graph messag control messag commun network build rout number control messag system commun complex forward knowledg build oper control messag system control messag result dynam time resourc held server consid queri messag trac measur time complex count number round system complet task system reach state server sucient forward knowledg resourc relev queri rout tabl size number control messag show commun overhead inher build forward knowledg size rout tabl held server result control messag show space requir store rout inform system control messag trac larg server retain messag measur size control inform order mediat network singl mediat simplest hierarch network queri rout consist set server hold resourc system singl mediat summari content server shown figur queri submit forward knowledg propag queri relev server arrang servic napster internet engin figur singl mediat model system direct graph ei distinguish singl mediat edg form vi content server element set denot vertex label data server pass summari content simpl show queri sati ed content exist path mediat server label sati es queri sati ed data server submit gener queri messag constant system size request mediat chosen run time queri complex mediat queri present system process number control messag push mediat scale number server system number entri rout tabl held mediat scale hierarch mediat system capabl rout queri relev data scale number data server limit factor size mediat rout tabl load natur expand system hierarchi order address rst concern good exampl lowest layer system consist server pass forward knowledg tree mediat pass turn parent client present queri system send root forward queri mediat pass data server queri reach figur hierarch mediat ei direct layer graph set vertic partit set ln edg form set root element system graph denot root vertex conveni de ne function fx xi map vertex children function vi map vertex parent vertic label function describ content server ln summari resourc describ mediat content previou edg label function function di er previou de nition ad summari edg label layer queri data server ln relev document chain forward knowledg root server data server satisfi queri sati ed singl data server submit gener queri messag trac queri run time scale depth hierarchi number control messag initi scale server mediat pass forward knowledg root control run time scale number entri rout tabl held includ constant system equal breadth hierarchi number direct children singl mediat root mediat bottleneck process messag partial rectifi situat control messag pass hierarchi server forward knowledg capabl mediat doubl number control messag control run repres label graph queri start leaf server refer upward reach root relev reduc number queri handl root server constant factor distribut complet mediat network server content server figur messag trac gener queri system constant constant time process server requir rout tabl size control messag trac scale graph jv edg run time control messag constant figur complet network mediat mediat council council cross complet network hierarchi introduc server divid jv group member complet forward server content server group repres council chosen member group pattern repeat council fulli connect make higher level provid jv council control complex queri control messag hierarchi figur mediat council ort requir exchang control messag group peer grow control messag complex approach complet network run time jv queri messag complex run time council jv group server constant entri rout tabl worst case server repres group server rout tabl size scale jv server handl larg number messag gatewai messag great extent root server hierarch network load share peer disord mediat network hierarch network simpl abstract studi behaviour queri rout note similar real world system order base model disord system forward knowledg famili random network scale free network complex network acquaint network hyperlink structur world wide web network order graph ring rectangular lattic edg random give graph larg local distanc edg scale free network start small complet graph add vertic link exist vertic weight exist vertic vertic preferenti link vertic behaviour result graph slightli larger number vertic construct di erent graph famili share properti low graph diamet log jv assum server system cluster interest form neighbourhood base real world network distanc criteria edg disord graph show basic mutual awar server edg chain tradit network rout techniqu produc shortest path server common famili rout distanc vector link state fundament di erenc network rout queri treatment address network address uniqu object identifi server rout process address construct path sourc destin server bear server rout tabl index destin address queri rout queri uniqu identifi attempt construct path sourc destin server satisfi queri express rout tabl entri present problem rout tabl entri express refer content di erent server retain separ refer server contract singl ambigu resolv includ server content summari capabl rout bring light di erent question server rout tabl data queri shortcut destin directli path gener rout queri directli knowledg accumul intermedi server cach brought bear queri distanc vector distanc vector distribut rout algorithm wide internet implement call rout inform protocol server send period updat neighbour estim path length destin maintain rout tabl shortest path destin tabl size system queri messag trac run time proport graph diamet scale jv dv extrem poorli scale algorithm term control creat trac converg link state link state open shortest path descript local network topolog server calcul rout tabl base complet topolog knowledg queri complex run time control complex oper messag trac log jv converg jv graph diamet scale log jv algorithm accomplish task amen complex algorithm introduc commun complex log jv converg jv examin complex scalabl number network topolog queri rout system resourc servic discoveri tabl end construct suitabl abstract model queri rout process order network council er reason ecienc pure hierarch system bottleneck provid group size smaller system size order system drawback costli polit scalabl order system reli compon run larg user administr simpl leaf compon make system vulner attempt disrupt recent closur napster servic exist fulli distribut system le reli messag creat rout inform process lead scalabl problem adapt network rout algorithm queri rout suggest approach link state creat scalabl system queri rout servic resourc discoveri area requir investig ect updat system complex made assumpt capabl agent system remain agent join forward knowledg network case real world system studi complex strategi propag increment updat forward knowledg network topolog examin paper refer homepag albert emerg scale random network clark distribut inform storag retriev system ba rivest introduct algorithm mit williamson internet fifteenth intern joint confer arti cial intellig sycara matchmak broker intern confer system topolog control trac control time queri trac queri time rout tabl singl constant constant constant hierarchi jv jv jv constant complet constant constant constant council jv jv jv constant distanc vector jv jv link state log jv jv jv jv link state log jv jv jv jv tabl complex summari architectur servic rfc internet engin task aug schaerf reason descript logic principl knowledg studi languag page csli frieder ecienc scalabl inform retriev server journal digit dec gasser ma infrastructur de prospect workshop infrastructur scalabl system fourth intern confer autonom resourc discoveri distribut network eighteenth annual acm symposium principl distribut page rout inform protocol rfc internet engin task itu inform technolog open system interconnect overview model servic itu recommend intern telecommun nov jen softwar engin arti cial lawrenc gile access inform web juli dean framework develop multiag architectur ieee lynch distribut algorithm morgan relev inform interact domain concept facil rfc internet engin task nov version rfc internet engin task juli ordil internet project rfc internet engin task jan salton mathemat inform retriev journal mar shehori scalabl agent locat mechan intellig agent vi sixth intern workshop agent architectur languag volum lectur note arti cial page sparck jone editor read inform retriev morgan watt collect dynam network referr protocol rfc internet engin task june
IR/1684 5 build corpor memori august rose olivi corbi rout de bp franc abstract paper interest xml corpor knowledg manag account advantag world wide web ontolog knowledg present tool enabl guid search xml document part corpor memori world wide knowledg corpor inform retriev introduct extend definit corpor memori persist knowledg inform order facilit access member task build reli step detect corpor construct corpor corpor corpor evalu corpor mainten evolut corpor memori techniqu adopt build corpor kind document exploit corpor memori document link specif product design design test contractu technic refer bibl visual document scan technic scientif technic archiv technolog user refer busi work situat context knowledg manag actual compani virtual made distribut organ team peopl meet work focu corpor distribut web main problem solv describ document paper extens paper publish part corpor memori improv retriev knowledg show interest web ontolog knowledg present interest xml corpor knowledg manag describ system offer guid search xml document exploit knowledg manag corpor knowledg individu organ advantag remark possibl access inform knowledg provid internet knowledg compani exploit access internet intranet insid internet web technolog dramat chang inform manag web serv basi inform distribut uniform independ inform store reli knowledg server web public web kind element access document electron html document knowledg case articl digit kind knowledg server thought document ontolog knowledg base journal server digit librari main problem solv retriev element corpor memori answer request adapt answer user corpor memori restrict sole intern corpor memori reli intern compet map insid compani extern corpor memori includ inform knowledg stem extern world work retriev integr inform explicitli put web compani work area interest extern corpor memori intranet exploit construct intern corpor extern memori reli extranet connect compani privileg partner internet web case technolog intellig notic kind intellig interest technolog intellig order follow exist emerg competit intellig order product servic competitor actor market inform retriev web corpor memori adequ member case corpor notic import inform adapt user activ work environ problem tackl user express improv hypertext navig retriev element corpor memori answer addit knowledg user filter inform infer capabl inform search addit tradit search engin tool intellig agent type agent web search function launch parallel search search engin compil result tool obtain result suffer imposs function complet answer intellig agent softwar type number consult search depth form number back backup automat gener bookmark oper reli paramet set choic search launch automat record elimin ident gener summari updat search detect page advantag agent backup found link conserv search histori disadvantag cost time resourc complex intellig addit previou carri inform learn intellig manag result advantag obtain relev disadvantag cost resourc compar web search tool criteria distribut tool gener explicitli present aim knowledg framework inform retriev corpor memori intern corpor memori extern corpor guid search web thesauru ontolog model applic corpor knowledg manag ontolog knowledg manag ontolog knowledg manag exampl ontolog knowledg manag domain ontolog vehicl ontolog automobil ontolog describ model compani corpor memori compani includ domain ontolog explicit model exampl ontolog ontolog aiai consist market virtual ontolog framework project reli servic ontolog guid inform search web interest ontolog exploit guid search web research project aim intellig guid inform search web ontobrok offer extens html languag annot document inform relat order guid search ontolog ontobrok inform search guid ontolog current version author ontolog knowledg acquisit commun ontobrok offer formal formul enabl ontolog ontolog annot html document consist request search engin infer engin shoe html ontolog tool search inform reli extens html grammar creation ontolog shoe aim semant organ document addit simpl textual arrang infer engin marri system exploit ontolog natur languag analysi inform search web server commonkad model start user deliv model web offer hypertext navig model inform search model queri navig model entiti model annot link document annot link model entiti search inform level document guid knowledg model focu exploit inform search web framework corpor memori distribut web intranet xml knowledg manag web natur reli html popular languag web document html drawback design world wide web consortium order obviat drawback suggest reli xml corpor memori drawback html introduc detail featur xml interest knowledg manag html xml html suffer major inform structur translat html process inform embodi html html markup languag inform knowledg server overload search inform perform format process server answer time request view data request summar weak point html user creat tag attribut order semant qualifi data extens html support specif deep structur repres schema hierarchi structur html support languag specif applic check structur valid import data valid order obviat work group creat xml markup intend standard creation markup languag xml design distribut structur document web kind light simplifi meet web requir work group develop common standard link markup languag develop xml develop common standard layout document encod languag xml metalanguag deriv sgml gener markup specif xml found notion document defin dtd type syntact specif model xml document document consid valid respect dtd element attach attribut defin xml user defin tag defin data nest document structur level make applic test structur valid xml document option descript grammar applic perform structur extract data xml document advantag xml corpor memori standard xml major advantag corpor memori mix sgml web advantag summar view data xml enabl manag inform knowledg uniqu structur enabl process knowledg server retriev inform client charg present user adapt interfac user context account present view gener graphic tabl content show data data load client process xml data process java applet xml repres data java repres transpar portabl machin oper system document built heterogen data xml enabl manag structur document structur data uniform xml format design enabl document descript arbitrari data descript mix data document order build virtual document issu sourc data technic data base text document manag environ annot document model ontolog standard inform exchang order facilit commun inform commun group compani compani relat provid defin standard orient vocabulari mean dtd type dtd syntact specif model xml document document consid valid respect dtd document data express defin xml markup exchang markup document format xml companion formal call xsl stylesheet defin present format xsl present document gener gener postprocess gener standard output format xsl enabl elementari document process gener tabl reorgan document structur defin output format document xsl document transform format languag write publish digit interest corpor memori manag hypertext xml offer tool build power hypertext document mean link languag enabl navig document structur implement major hypertext function found dedic link extern link extern document annot modifi sourc inform search xml facilit inform search document structur consid reli standard markup search inform structur commun integr xml technolog search languag annot metadata spirit rdf shoe ontobrok annot document metadata describ abstract synthet document predefin standard ontolog semant markup markup part text document tag semant establish relationship ontolog knowledg model markup interpret hypertext link ontolog exploit search engin xml memori manag xml structur document open standard good candid facilit migrat system softwar long time period document exist independ process tool proprietari format document document xml interest build corpor memori aim access intranet compani model guid search xml document account interest featur develop techniqu search xml document inform search guid knowledg model object main object perform inform search document guid knowledg model result search includ relev answer web document correspond semant request develop specif extens html support ontolog ontobrok handl xml format xml standard knowledg model guid search commonkad repres standard commonkad model languag system search inform retriev integr global fig global architectur approach main phase creation xml document adequ semant document found answer request document creation perform author document corpor memori search inform xml document carri request corpor memori user creation document document annot ontolog inform order semant enabl retriev fig link xml ontolog inform stem ontolog develop compani languag offer commonkad method order repres commonkad model xml document knowledg model user request answer ontolog express dtd annot xml xml document ontolog annot translat valid ted extern compani member dtd gener system document cm respect dtd element ontolog annot document requir compani member directli dtd dtd difficult prefer requir compani member ontolog repres order enabl annot semant document system gener automat dtd base ontolog ontolog built independ xml document se compon corpor memori search inform order answer user system seek ontolog part ontolog answer present ontolog filter engin find document answer candid document system find exact exploit ontolog seek approxim exploit concept hierarchi find answer subconcept concept initi request scenario inform retriev shown figur scenario inform user express request browser netscap explor type basic basic request gener user constrain attribut find page project basic request specif user constrain attribut find page project geni hybrid queri made basic find report written compani project geni request transmit classic search accept logic keyword request focu search user url consid root url site context compani realist case virtual root url exist user explicitli site organ part virtual search engin visit identifi document follow xml seek occurr keyword user request previou search keyword compani report find xml document keyword occur request basic request document back search tool process ontolog filter engin identifi document ontolog inform answer request return form url result give answer url document ontolog inform geni descript de de de rapport final du lot nada olivi corbi inria fig scenario inform search xml document request find report written compani project find document ontolog inform previou implement system translat engin dtd environ dedic commonkad model languag built program environ gener specif syntax semant program gener specif program environ dedic languag gener syntax semant languag made set tool enabl build verifi commonkad request basic request gener type find valu attribut object basic request specif type find document attribut object search classic search engin site search recogn document xml document search tag keyword user request candid document ontolog filter engin gener type recogn occurr tag attribut keyword specif type extract properti test answer request xml document result ontolog part textual part xml document result ontolog part textual part candid document candid document model build abstract syntax tree program languag program manipul mean abstract syntax tree built translat model dtd detail implement tool printer gener manag object inherit mechan order abstract syntax tree readabl formal enabl programm gener textual start abstract syntax tree program exploit order abstract syntax tree adequ xml element constitut dtd part translat concept part concept properti map xml relat translat translat cardin concept attribut express concept ontolog concept report end concept report dtd gener dtd author creat xml respect specif dtd translat properti choic xml attribut xml element prefer repres properti entiti xml attlist xml gener repres characterist element repres structur data valid engin valid engin check syntax dtd document compani valid parser offer web chose parser xml java ibm develop parser includ api dom object describ interfac xml basic object sax api interfac valid document compani make document constitut answer filter engin valid facilit work data extract ontolog filter engin object ontolog filter engin determin xml element present xml test semant presenc concept xml document definit call semant presenc attribut xml fact attribut xml document tag ontolog part notat replac keyword tag occur head part html document ontolog inform regard visibl browser test kind basic request reli semant basic request gener test consist control keyword request document account basic request specif test consist check keyword request request present semant document tool sax interfac publish web sax applic program interfac sax send back event time meet type event depend type data encount sax requir work chose parser ibm kernel ontolog filter engin exampl detail engin distinguish document answer candid document ontolog express translat inherit dtd gener valid parser xml document element attribut extract ontolog filter engin fig intern architectur queri find report written compani project xml document geni descript de de de rapport final du lot nada olivi corbi inria function ontolog engin engin exploit event emit sax interfac test element xml geni answer test presenc tag answer url xml document back answer implement implement extens aiai ontolog ontolog translat dtd exploit ibm valid parser xml order valid xml document wrt dtd implement ontolog filter engin queri interfac remain integr ontolog filter engin browser browser xml paper stress advantag xml corpor knowledg manag discuss interest web ontolog knowledg manag interest featur xml knowledg manag present offer search xml document comparison relat work aspect experi compar research inform search web reli commonkad method extens aiai ontolog implement translat dtd implement exploit xml html lack exploit axiom main differ ontobrok shoe compar classic search inform search keyword semant exploit xml browser integr final version rdf offici recommend exploit formal build automat translat ontolog rdf principl translat dtd advantag approach spite drawback lack approach interest compani provid ontolog ontolog describ organ domain ontolog describ consensu knowledg handl profess ontolog filter base semant document found find relev document classic search engin fact automat translat compani ontolog translat order obtain dtd remain ensur consist annot dtd gener modifi ontolog approach reli xml standard web commonkad consid standard ontolog engin acknowledg raja complet implement start august refer wood document object model world wide web journal le de fensel gomez knowledg manag ontolog intern confer practic aspect knowledg switzerland system proc symp softwar develop acm pp novemb futur web march extens markup languag recommend environ commonkad conceptu model languag proc european confer ai august commonkad model web proc int symposium manag industri corpor knowledg inria manual manuel de du pretti printer ii suciu queri languag xml submiss world wide web method tool corpor knowledg manag musen proc workshop knowledg model manag intern journal special issu organiz memori knowledg corpor memori cooper creation knowledg base system proc novemb studer enabl intellig access www musen proc lm introduct xml kent parser ibm xml java http xml world wide web journal swick descript framework model de recherch internet intranet hendler web agent proc int confer autonom technolog sax simpl api xml oleari knowledg manag march aid la recherch sur le web guid par de de corbi xml corpor knowledg manag proc european workshop knowledg manag springer lnai intellig sur internet la recherch sur van de commonkad conceptu model languag steel futur knowl proc lnai toronto canada integr laboratori ontolog ontolog knowledg engin vol special issu put ontolog van van der organ corpor memori musen proc relev inform retriev al proc workshop intellig inform
ML/1685 6 inform extract aid discoveri predict rule text yong depart comput scienc tx raymond moonei depart comput scienc tx abstract text mine inform extract topic signi recent interest text mine concern appli data aka knowledg discoveri techniqu unstructur text inform extract form shallow text understand locat speci piec data natur languag transform unstructur text structur paper describ system call combin kdd method perform text mine discov predict rule corpora initi version construct integr modul base rapier ripper present encourag result appli techniqu corpu comput job post internet newsgroup introduct problem text discov knowledg unstructur attract attent paper suggest framework text mine base integr inform extract tradit knowledg discoveri tradit data mine assum inform form relat electron inform form unstructur document structur inform task attract attent start messag understand confer address problem transform corpu textual document structur suggest obviou role plai text mine combin standard kdd illustr figur modul locat speci piec data raw result provid kdd modul mine text text data mine inform extract rule base kdd db figur overview text mine framework construct system dicult signi recent progress machin learn method autom construct system manual annot small number document inform fairli accur system induc label corpu appli larg bodi raw text construct larg mine small amount label train data learn system automat transform larg structur inform readi mine tradit kdd method learn system rapier induc system transform newsgroup job post relat appli standard rule induct method job automat extract discov interest relationship job requir knowledg java graphic requir knowledg accuraci current built manual induc limit automat extract inevit number error import question knowledg discov signi cantli reliabl knowledg discov cleaner tradit paper present experi demonstr knowledg discov automat extract close accuraci discov manual construct demonstr combin kdd viabl approach text mine remaind paper organ section describ system call sampl job post lead internet provid cut edg web technolog austin accept applic senior softwar develop candid year softwar includ code experi bs higher comput scienc relat eld requir perl javascript program experi de nite posit requir develop applic meet custom de ne develop implement applic emphasi web site develop java rdbm outstand bene stock type full time fill job templat senior softwar develop austin window requir year requir bs figur sampl text fill templat text combin kdd technolog discov predict rule section present discuss result obtain corpu job post newsgroup section review relat section discuss direct futur section present system inform extract goal system locat speci data text data extract typic templat speci es list slot lled substr document varieti recent internet web document recent applic includ homepag rental ad job announc task extract post usenet figur show sampl messag newsgroup lled job templat slot multipl ller slot area slot relat job titl locat ller moder post document relev task resum post job post construct ltere irrelev document newsgroup train text categor post collect classi ed human expert relev irrelev text categor train data identifi relev document rainbow packag result categor accuraci lter irrelev document origin post rapier system induc rule extract inform construct modul rapier relat rule learner acquir rule corpu label train exampl learn pattern describ constraint slot ller surround context speci search constraint pattern speci semant class token demonstr rapier perform fairli realist applic usenet job post seminar announc experi rapier train label point accuraci extract inform extract extract slot ller extract recal correct ller train rapier small corpu order demonstr label small number document result learn extractor capabl build accur knowledg discov rule induct construct system extract desir set slot construct corpu text appli extractor document creat collect structur record standard kdd techniqu appli result discov interest relationship speci induc rule predict piec inform eld inform record standard classi cation method emploi task order discov predict treat pair extract distinct binari learn rule predict featur featur similar slot ller rst standard term popular ller platform win titl slot abbrevi term uniqu slot valu predict rule mine data small synonym dictionari identifi similar term trivial case handl manual contriv rule appli induc rule qa activ server visual figur sampl mine rule job post result binari data learn tree translat prune rule ripper appli learn predict rule ripper run signi cantli faster abil handl featur avoid step explicitli translat slot ller larg number binari featur discov knowledg describ relationship slot valu written form product rule tendenc web area slot applic repres product rule predict absenc ller slot sampl rule mine job extract usenet newsgroup shown figur system architectur architectur shown figur document annot user provid rapier train data rule induc train set store rule base subsequ extract modul learn system unlabel text transform provid kdd compon train set construct knowledg base predict rule train data kdd includ document train larger set automat extract raw text includ capabl improv recal learn system addit slot ller base learn predict rule detail aspect system found order test accuraci discov predict inform disjoint exampl test predict present absent inform averag perform featur test exampl comput rule produc ripper found similar experi paper emploi ripper comput time space complex induct extract output valu exampl train exampl kdd rule base system rule predict rule base induct rule predict figur system architectur signi cantli result methodolog discov knowledg inform accur discov uk correl data import measur accuraci discov knowledg independ test data primari question address experi section knowledg discov automat extract data reliabl compar knowledg discov manual construct test job post newsgroup collect manual annot correct extract templat cross valid gener train test set rule induc predict ller area lled multipl ller obviou potenti relationship valu total number experi languag area classi cation accuraci predict absenc presenc slot ller inform perform metric high accuraci achiev simpli assum slot ller absent classi cation accuraci strategi accuraci set potenti slot ller larg xed small fraction ller present evalu perform perform metric regard predict slot ller present absent predict present predict absent tabl expect outcom random guess metric de ned resent recal alu harmon recal comput weight measur recal order obtain bound simpl random guess method benchmark approach guess base frequenc occurr train data occur program languag job train approach guess occur time test data simul analyt calcul expect recal expect outcom strategi summar tabl percentag time train total number test exampl number time occur test data inform recal determin recal benchmark probabl occurr estim test data recal probabl occurr estim train data di erenc due sampl error result di erent train phase question train set train realist reason train data mine human ort expend correctli extract data text illustr di erenc mine rst show comparison disjoint train set train data thrown train extractor make normal number extract error data perform remain exampl order evalu data mine order illustr impact mine automat extract set train exampl provid kdd system di erenc train data automat extract rapier train disjoint set exampl system test data identifi qualiti rule produc figur show learn curv small amount result achiev perform fairli compar train manual construct poorli figur rst train quickli improv addit exampl result show start level bit due fact extract error put lower ceil perform eventu achiev figur present perform individu slot program languag slot number valu show area slot valu poorli interest fact di erent slot show di erent learn rate figur show learn curv scenario train set provid consist provid part train set approach start train system proce discov knowledg data automat extract raw fairli close track perform system train addit data labori extract human expert case advantag small set data start perform closer achiev mine result present emploi label exampl train system followup examin ect number train exampl obtain accur extractor vari number train exampl rapier exampl mine ripper size test set previou experi figur show result number train exampl improv accuraci mine rule approach accuraci ripper train data accuraci improv slowli addit train data result train set data mine automat label modul larg achiev fairli good perform small amount ort devot label train number train exampl ripper train data figur disjoint train set exampl relat research research explor integr kdd kdt discoveri textual allud text mine text manual tag limit number xed categori label kdt autom text categor fact discov associ keyword text automat label document keyword approach similar method discov semant relationship term collect document parser place inform extract extract process nding syntact semant relat term futur work preliminari result job post fuller evalu appli larger job corpora realist domain plan discov knowledg extract busi articl mine extract doctor english note record medic patient applic area step perform manual similar ller extract data canon map window uniqu term autom cluster slot ller distanc metric base textual number train exampl ripper train data figur recal disjoint train set number train exampl ripper train data figur disjoint train set number train exampl program languag platform applic area figur slot number train exampl ripper train data figur train set number train exampl ripper train data figur recal train set number train exampl ripper train data figur train set number train exampl figur perform vari size train set charact edit distanc semant similar determin word cluster requir creat canon ller match altern approach partial match ller discoveri process soft match text string discov rule import aspect text mine requir exist rule induct method text string tradit import aspect tradit kdd adequ address explor discoveri rule soft match ller adapt rise approach unifi learn method whirl approach tfidf metric inform retriev exampl close exact match condit rule appli preliminari version system descript extract discov rule titl substr di erenc found review synopsi book histori titl book includ slot year provid rule miner addit input featur predict slot predict continu valu regress method categor techniqu area futur research procedur select slot rule mine autom current manual chose ve slot job templat titl slot job post valu dicult predict identifi quantifi correl slot autom grow interest gener topic text mine work system detail evalu util exist kdd system develop rapidli evalu exist corpora present approach automat learn system extract structur text mine tradit kdd tool preliminari result demonstr knowledg discov automat extract close accuraci knowledg discov manual construct text mine research area intersect data machin inform retriev appropri integr techniqu method discov knowledg larg text corpora develop grow interact comput linguist machin learn critic develop ectiv system acknowledg research support nation scienc foundat grant refer modern inform retriev acm relat learn techniqu natur languag inform extract phd depart comput august arti cial intellig laboratori technic report ai editor paper workshop machin learn inform aaai press moonei relat learn rule inform extract sixteenth nation confer arti cial page juli cardi empir method inform extract ai cardi moonei machin learn natur languag special issu natur languag machin gener inform extract sixteenth nation confer arti cial page juli cohen fast ectiv rule induct twelfth intern confer machin page cohen learn tree rule featur thirteenth nation confer arti cial page august cohen hirsh join text classi cation whirl fourth intern confer knowledg discoveri data page editor darpa messag understand evalu san morgan kaufman editor messag understand san morgan kaufman domingo unifi induct machin feldman dagan knowledg discoveri textual intern confer knowledg discoveri data feldman hirsh mine associ text presenc background knowledg intern confer knowledg discoveri data page august extract semant relationship method intern workshop ontolog engin global inform page dagstuhl freitag inform extract applic gener learn approach fifteenth nation confer arti cial page hearst text data mine annual meet associ comput page mccallum nigam comparison event model naiv text classi cation paper aaai workshop text page mccallum toolkit statist languag text class cation mitchel machin learn moonei mutual bene cial integr data mine inform extract seventeenth nation confer arti cial juli lee distribut cluster english word annual meet associ comput page quinlan program machin learn morgan san yianilo learn string edit distanc ieee transact pattern analysi machin soderland learn inform extract rule free text machin
Agents/1686 1 tupl space tupl centr enrico denti andrea omicini universita di vial itali abstract tupl centr tupl space behaviour program mean transact reaction standard commun event paper de ne notion tupl show impact adopt coordin medium distribut system system design system cienci kei distribut softwar softwar design system introduct softwar system domin applic paradigm internet role coordin enabl compon work separ activ relev issu coordin model crucial engin complex softwar applic implicitli recent interest internet commun coordin coordin sun javaspac ibm space ground coordin model origin linda initi exploit eld parallel program featur work carri nancial support italian murst project design methodolog tool high perform system distribut applic author preprint submit elsevi preprint februari make coordin heterogen system motiv interest di erent research group coordin internet agent softwar agent interact exchang order collect inform item agent cooper tupl space read consum tupl associ main bene ts model neat separ comput coordin gener associ access interact space rst featur promot cleaner agent comput coordin distinct gener commun make uncoupl agent spatial mandatori unpredict environ mobil agent concern associ access commun inform make model deal heterogen dynam system standard notion tupl space fall short provid exibl control requir complex discuss section section present concept tupl centr tupl space enhanc notion programm behaviour speci section sketch respect languag program behaviour tupl centr section show bene ts coordin base tupl centr term applic design system cienci respect simpl tupl limit main advantag interact tupl space coordin agent cooper compet base inform share produc inform make interact protocol simpl inform form tupl main problem coordin base tupl space distinct inform convei tupl tupl separ inform inform percept agent instanc dine philosoph discuss section tupl repres singli pair adjac rst choic natur domain easili lead deadlock philosoph enabl atom choic solv deadlock introduc ensur coher longer express coordin polici directli support standard tupl space emb coordin medium load coordin gener charg coordin made mean agent abstract coordin emb code interact protocol requir implement coordin polici requir comput coordin issu undesir merg agent make unnecessarili complex dine philosoph avoid deadlock repres singli requir philosoph agent tupl space lock uniqu semaphor tupl token tupl space figur global agreement approach make commun load tupl ad remov mean ensur philosoph adher requir lock enforc law coordin tupl idea inform percept separ limit overcom enabl agent interact protocol desir agent percept commun independ actual content term tupl properli put inform percept coordin media charg coordin whichev coordin law requir support directli coordin medium dine philosoph repres singl tupl tupl enabl philosoph agent perceiv acquir mean singl tupl space oper simpl request tupl succe result remov tupl space tupl obtain maintain standard tupl space time make enrich behaviour tupl space term state transit occurr standard commun event motiv notion tupl tupl space enrich notion programm behaviour speci cation tupl centr interfac standard tupl behav complet di erent behaviour encapsul coordin rule govern interact tupl centr behaviour speci cation consist collect reaction speci associ standard tupl space commun primit speci comput call reaction semant commun event longer constrain simpl linda model remov made complex requir speci applic reaction freeli access modifi inform collect tupl access inform relat trigger commun event perform oper tupl made complet observ commun event trigger multipl reaction carri singl transit tupl centr commun event serv agent result invoc commun primit sum ect primit reaction perceiv altogeth transit tupl centr state unlik standard tupl state transit constrain read delet singl tupl centr transit made complex make uncoupl agent view tupl centr standard tupl tupl centr actual relat emb coordin law respect tupl centr respect languag tupl centr behaviour speci cation assum commun languag base tupl ground admiss tupl tupl match mechan interact entiti perceiv respect tupl centr logic tupl space access standard commun oper de ne respect coordin languag work expect model put tupl tupl queri primit provid tupl templat pre expect match tupl back tupl centr post inp delet match tupl tupl leav wait suit tupl inp fail tupl found respect reaction de ned logic speci cation tupl associ event gener incom commun oper op reaction reaction de ned sequenc reaction access properti occur commun perform simpl term manipul tupl tupl centr oper tupl space work similarli commun trigger reaction chain reaction goal execut reaction success fail depend reaction goal succe reaction execut transact success reaction atom modifi tupl centr fail reaction yield result reaction trigger commun event execut account serv commun ensur agent perceiv nal result execut commun event set trigger reaction discuss section make embodi observ behaviour tupl transpar agent respect comput coordin law encapsul coordin medium tupl centr store data behaviour speci cation cation coher distribut natur make spread intellig distribut system uniform agent manipul data tupl behaviour speci cation tupl adopt conceptu protocol intellig agent behaviour interact system straightforward commun read tupl bene ts order show tupl centr lead cleaner design cient implement wrt tupl set simpl multiag system model classic dine philosoph problem philosoph agent share requir eat spaghetti bowl philosoph share adjac acquir atom avoid atom ensur fair tupl space tupl space tupl centr main cycl acquisit main cycl acquisit main cycl acquisit fig tupl space tupl philosoph system built exploit technolog enabl java agent interact respect logic tupl centr philosoph commun occur tupl work tupl space behaviour speci cation empti avail repres logic tupl logic tupl state philosoph eat perform class standard tupl space tupl space coordin agent tupl centr coordin rst class mere result system featur requir properti repres di erent approach ad global properti system chang agent interact protocol chang behaviour coordin medium design advantag tupl centr coordin emerg simpl comparison chunk shown figur abstract actual code agent tupl space charg load deadlock avoid acquisit fig respect speci cation coordin dine philosoph fair philosoph requir adopt instanc semaphor tupl token acquir prevent separ comput promot coordin model languag lift design issu improperli merg figur tupl centr charg coordin agent free interact suitabl abstract coordin law behaviour speci cation suitabl agent viewpoint view pair repres singli philosoph eat acquir pair mean singl eat mean singl oper bridg agent percept tupl centr program shown figur comput coordin issu neatli separ design philosoph shown figur system design global system properti coordin agent deadlock avoid charg global abstract coordin conceptu improperli distribut interact agent make modifi law coordin transpar agent tupl centr coordin improv system reduc global commun load figur show cycl cost commun oper rst case fail addit comput cost extra charg reaction tupl space tupl space tupl centr fig perform result system agent neglig respect gain network commun tupl centr coordin notabl improv agent system perform respect simpl tupl space coordin con rmed result report figur valu rst obtain averag time measur system run eat time leav system valu signi test made singl ect network distribut cost commun oper make tupl centr approach ectiv relat work notion tupl present programm coordin de ned gener notion exploit recent coordin model system tucson adopt version respect tupl centr present mar mobil agent reactiv space sun javaspac reaction java reaction model complex space coordin media base reaction commun primit de ned freeli space full power cope open unpredict typic complex distribut environ internet linda local proxi agent program intercept commun oper possibl chang semant account secur cienci emphasi local prevent linda easili express global coordin polici refer zambonelli reactiv tupl space mobil agent coordin workshop mobil volum lnc septemb ciancarini coordin model languag softwar integr acm comput june coordin multiag applic refer architectur ieee transact softwar omicini programm coordin media coordin languag volum page omicini express power languag program coordin media acm symposium appli comput marriott februari march gelernt carriero coordin languag signi canc commun februari tj wave commun distribut architectur acm confer orient program languag applic volum acm sigplan page novemb minski linda coordin model model volum page agent coordin control logic theori topic arti cial volum page omicini zambonelli coordin internet applic develop autonom agent special issu coordin mechan pattern web agent andrea omicini semant coordin model acm symposium appli comput februari march javaspac tm speci cation technic sun
DB/1687 3 cach manag corba distribut object system qi tang lin depart comput scienc rmit australia abstract distribut data intens default remot invoc corba object client accept perform degrad cach enabl client invok oper local distribut object fetch remot server paper address design implement specif cach approach system remov algorithm doubl link structur hash tabl evict present variat optimist phase lock consist requir lock client side cach design experi demonstr cach approach import perform cach half buffer save access time cach full buffer save access time common object request broker architectur advantag exist commun protocol remot procedur call oper system program languag transpar core object request broker provid problem messag overhead network bandwidth corba client applic perform remot invoc request data intens distribut default remot invoc corba object client accept result perform degrad cach enabl client invok oper local distribut object fetch remot server cach substanti address area system network file server web system work corba environ corba system specif requir object includ function requir relat model object semant entiti data requir issu consid design cach design evict techniqu object remov cach design consist techniqu object cach consist server paper solut issu context corba environ extens lru call enhanc lru aim overhead distribut sort process paper present variat optimist phase lock consist requir lock client side appli cach design experi perform demonstr corba cach approach import perform cach half buffer save access time cach full buffer save access time paper section describ exist approach deal issu cach replac data consist appli approach context section discuss cach section describ suitabl cach approach corba ment section detail implement algorithm detail seri test demonstr perform gain cach corba applic section present outlin futur work relat work work area area system world wide web briefli explain cach detail found cach replac cach buffer data evict data evict remain issu develop cach replac algorithm appli corba size polici recent algorithm wide cach replac algorithm handl object polici remov object requir obtain suffici space newli access object involv replac time object object promot head frequent chain action track access data item sort list cost object order variant lru model ag includ size part remov incorpor threshold size frequent algorithm evict object access frequent object assign frequenc access count object sort ascend order frequenc count evict start object frequenc access size object remov base largest object remov lru techniqu requir data size order object equal gener order remov base access time major limit approach track object size access time variant size polici log log cach consist algorithm data server updat make cach object inconsist techniqu control cach lock avoid problem lock techniqu callback phase optimist phase lock callback lock algorithm context andrew file system maintain consist cach file client obtain lock server access data page commit time lock retain transact termin transact access cach object retain lock client request cach object evict cach wrong lock transact updat object read obtain proper lock server server broadcast messag client incompat lock object request lock server base phase lock server copi object treat primari copi object client transact obtain proper lock server access data item callback lock variant call cach data cach client transact boundari consist maintain transact request read lock page cach client send log sequenc number found copi page lock request server respond lock request latest copi page determin site copi longer valid deadlock cach resolv abort transact involv deadlock optimist phase lock scheme cach data page optimist form lock cach algorithm defer detect lock cach multipl site transact commit time client updat perform permit migrat back server buffer updat transact enter commit phase client read oper execut local case cach miss found cach data client request server obtain latest copi data server track page cach system client inform server drop page buffer pool inform messag send server server data conserv approach size polici equal prioriti object unrealist size approach context corba environ recent cach object stai cach longer access lru algorithm limit deal updat object middl chain base characterist cach replac algorithm shown tabl opt lru approach extend includ data structur doubl link improv lru limit approach call enhanc lru combin idea lru updat admiss lru algorithm sort cach object evict subject overhead sort migrat activ time object updat move object end list latenc reduc perform activ updat time compar lock consist shown tabl found cach access remot server frequent remot access impact system perform callback lock retain lock transact unnecessarili induc poor perform found optimist consist algorithm callback featur retain lock assign lock client optimist drawback callback lock implement lock manag client side impract context corba aim design algorithm base optimist enhanc includ design client cach architectur section describ cach architectur show compon commun illustr figur cach architectur cach monitor lock manag cach manag decid client perform local access remot access client make read cach manag contact data found cach return data client write request pass server cach replac cach buffer cach data item evict client perform read fetch data server side creat read client contact cach manag task cach manag contact data found contact server data put latest data manag coordin server resourc callback oper client contact server cach manag construct client side manag inform cach manag creat client make write manag notifi client updat invalid data role monitor control consist object independ process monitor oper access server enhanc optimist lock algorithm monitor lock manag lock oper access server site data oper unlock complet design lock manag illustr algorithm attribut involv action refer lru time access evict object access longest time frequenc access evict unpopular object frequenc access size size evict largest object time access prefer small tabl summari evict polici algorithm retain client assign callback event trigger refer lock lock action remot access callback cach wrong lock cach optimist cach commit time tabl summari consist mechan os kernel os subsystem network adapt os kernel os subsystem network adapt extend stub code standard languag map orb specif interfac standard interfac queue idl orb core interfac orb adapt object iiop manag connect idl skeleton extend stub object object ref client arg arg return valu monitor lock manag cach manag manag figur cach refer architectur section figur show interact compon cach architectur client make read request handl cach manag cach manag contact empti begin cach manag decid contact server object copi monitor intercept client request acknowledg lock manag assign lock oper lock manag check oper assign proper lock oper pass server client cach manag monitor server manag return object search empti remot access lock unlock search data found remot access invalid lock unlock notifi notifi return object process object process object return cach object creat creat proxi figur sequenc diagram cach design section detail corba cach approach discuss previou section gener deal issu cach callback filter cach manag cach manag manag client resourc cach object commun server object simplifi algorithm cach manag read updat oper shown algorithm algorithm read kei obj return tail obj obj end algorithm updat kei obj obj updat propag back server server obj cach replac explain base extens lru includ doubl link list object drop client inform server oper requir object client contact server import object lru chain oper store doubl link list hash tabl construct quickli find object hash function base string search improv featur featur convert string integ perform hash search find correct slot object object kei retain string format object locat return empti locat case linear search perform object figur show chain structur data member insid structur object ident kei object state provid inform object current statu valid object object access link pointer previou object link pointer object link object list quickli remov object list object treat type object type link sn sn hash tabl tail head kei found sn queue evict popular object hit popular object hit figur pattern object lock locat middl list list implement hash function perform lookup shown figur kei object link previou object queue remov object promot tail queue object arriv cach buffer object queue object append end queue server invalid object object found simpli ignor server notic object found object invalid give detail illustr figur client refer object kei hash function perform data kei object promot top lru chain immedi previou link forward link destroi link data ad tail queue lock filter lock manag part monitor assign lock oper access server data unlock oper finish process data oper process data retain lock cach algorithm combin cach client local lock lock manag locat server side read client access local cach lock requir cach data found cach buffer cach data client make remot access call server lock implement assign log sequenc number oper lock manag data oper process write oper client make remot call updat data server side primari data server wait hold repli send request approach differ client updat perform save lot messag exchang confirm lock server track object locat system filter intercept messag gener develop addit inform execut oper code execut execut type filter filter filter control applic attribut call leav enter client server address filter concern individu object filter implement monitor illustr design briefli describ element shown figur filter class ten method monitor transact recept oper oper client address space oper oper paramet ad request queue oper paramet ad request queue server address space oper target object oper paramet remov request queue oper target oper paramet remov return ad queue return paramet ad method failur process queue queue queue queue server client client request client process server process failur server repli failur unlock lock figur filter diagram implement test section show cach approach implement system wide build scalabl heterogen distribut applic section describ workload test result obtain implement detail consid scenario bank applic multipl read updat oper typic scenario involv instanc bank creat account object regist account instanc server client proxi creat instanc bank server notifi client updat occur interest client notif invok interfac method defin client proxi cach manag inherit class gener standard proxi factori class singl instanc proxi factori class creat user defin proxi construct commun factori creat proxi refer object interfac pass back paramet return refer remot object enter address space bind function object call interfac filter oper figur lock unlock oper implement inherit super class filter rewrit method perform function lock manag sun solari protect share data maximum share lock limit object lock manag method lock assign lock number function call class server manag inherit class server manag callback client callback happen client perform write oper section part server manag relat write oper workload gener studi workload world wide web distribut file system hard gener perfect design workload base initi assumpt system distribut applic distribut file system workload suitabl princeton workload select evalu cach approach implement bank applic workload number object invoc object creation tempor access type transfer data size number object invoc princeton trace object due resourc limit os object invoc request client made time princeton workload long workload object creation time request request exist object object object creation rate decid object creat al suggest object creation rate found insuffici evalu system blaze suggest file creation rate object creation rate chosen tempor local suggest object access previou gener access time long base number select recalcul figur shown tabl access access type determin read write oper object rate select workload gener data transfer averag data size kb toronto studi percentag object chosen object access tabl tempor local implement workload gener rate decid time stamp oper gener event event object creation rate determin object creat exist object access case access exist access type gener access type rate tempor local appli decid perform object access object creation object creat determin creation rate test result test experi buffer size test perform buffer size cach miss rate defin full buffer size point miss rate buffer size ur show full buffer size object object select half size object buffer size test full buffer size situat experi conduct solari memori server side mb client object object buffer size separ maximum number client current network bandwidth mb miss rate total number object miss rate write oper figur miss rate buffer size shown figur perform cach approach approach object averag data size equal kb cach half buffer size save access cach full buffer size save access time full buffer size cach show slightli perform yield half buffer size cach half buffer cach full buffer cach outperform phenomena show effici hash tabl averag time millisecond client cach cach full buffer object cach half buffer object figur client invoc object base result compil figur found number client approach exhaust invoc server side server satur crash reach memori limit cach test reach memori limit situat lot read request handl client side prove previou statement cach reduc network congest problem server crash symptom memori limit test conduct measur perform number object invoc object invoc object invoc test perform experi tempor local object object recalcul separ full buffer size half buffer size figur object object separ base result depict figur found cach approach outperform lot client request perform local object cach client side object found client side object client perform remot request contrast approach network congest number object object invoc test crash server number client equal monitor test found server reach current memori limit cach full buffer object cach cach half buffer object averag time millisecond client figur client invoc object show full buffer cach full buffer object cach cach half buffer object client averag time millisecond figur client invoc object cach half buffer full buffer cach evict probabl object fetch full buffer size higher half buffer size full buffer size cach space object result affect workload implement object refer object fetch quickli tail queue oper reason half buffer full buffer object invoc client space object invoc access time object object review import cach approach evict algorithm corba cach suggest algorithm includ doubl link list hash tabl object refer middl object remov quickli queue examin consist algorithm base lock mechan variat optimist client requir retain object remain consist design futur work consist implement cach approach orb contribut orb vendor independ approach standard plan studi cach issu make network cach local area network work cooper cluster refer consist protocol distribut servic ieee transact parallel distribut vol sep pp ma distribut file phd buffer acm transact dec pp mj mj cach altern acm transact vol sep pp ds hs case studi file system workload distribut proc acm sigmetr confer measur model comput pp jh ml da rn mj perform distribut file system acm transact comput system vol feb pp mn bb jk network file acm transact comput vol feb pp la consist concurr control dbm proc acm sigmod confer manag pp cr ea polici network cach proc acm palo aug pp fundament distribut object corba perspect john
HCI/1688 4 static schedul distribut system abstract paper address static schedul distribut system suggest previou reduc discharg current level shape distribut essenti extend batteri lifespan static schedul scheme optim discharg power profil order maxim util batteri capac target distribut system process element perform schedul effici slack time reduc averag discharg power consumpt flatten discharg power profil scheme hard constraint relationship distribut system specif base previou develop batteri lifespan evalu metric awar shape discharg power profil result show batteri lifespan optim discharg power file scheme batteri lifespan scheme scheme realloc introduct portabl system wide mobil wireless inform wearabl comput industri militari applic system complex incorpor reduc energi consumpt extend batteri lifespan critic aspect design system distribut system gener network heterogen process element pe integr field programm gate arrai analog circuit input specif system typic form task graph task graph direct acycl graph node task edg amount data transfer work support darpa contract permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee june la usa copyright acm luo jha depart electr engin princeton connect task period task graph time interv execut hard time task node complet exist sink node intermedi node hard deadlin met system multipl task graph period goal schedul algorithm deadlin period task graph honor relationship task due import energi schedul scheme energi power optim techniqu present literatur repres work includ voltag scale refer vari speed processor chang clock frequenc suppli power refer mode processor devic idl order reduc power consumpt reduc power consumpt research begun studi batteri behavior effect batteri discharg pattern batteri capac paper address issu schedul distribut system goal schedul algorithm extend batteri lifespan meet hard constraint relationship task schedul algorithm vari voltag pe voltag scalabl order reduc power manag power profil system order achiev improv batteri effici work motiv idea present suggest reduc discharg current level shape distribut essenti reduc batteri capac loss reduct averag discharg current level achiev voltag scale pe optim discharg current profil achiev seri schedul transform start initi valid schedul schedul transform aim shape discharg current profil improv util ideal batteri maintain valid origin schedul work simultan address issu optim power consumpt profil distribut system improv batteri hard constraint relationship tradit task distribut schedul previou work distribut system consist perform schedul effici slack time reduc averag discharg power consumpt flatten discharg power hard constraint relationship scheme power maxim batteri lifespan batteri behavior model capac batteri cell defin term factor influenc perform characterist actual capac drawn batteri batteri capac discharg current fig show curv batteri capac versu discharg discharg rate load current repres normal batteri rate capac work explor fact batteri effici influenc averag discharg current averag discharg current profil defin actual power drawn batteri di act averag discharg current period time probabl densiti function discharg voltag assum fix util ratio batteri capac term discharg current ideal batteri capac repres batteri effici compar ideal condit durat batteri servic life equal divid act work show constraint averag power consumpt pave di discharg act current distribut lead maximum batteri life achiev varianc discharg current distribut minim result support studi base simul rate fig origin valid schedul discharg rate fig perform cell temperatur discharg rate work studi effect intermitt discharg capac recharg batteri demonstr peak power predict batteri capac averag power work emploi batteri model evalu instantan batteri capac basi batteri recoveri effect commun devic studi motiv exampl section present exampl motiv work act paper equat evalu actual power drawn batteri batteri cell voltag assum relationship batteri capac discharg current hold discharg power formula empir equat evalu relationship batteri capac discharg current α α constant assum α fig system specif consist task graph assum simplic period distribut system implement task graph consist connect bu fig give feasibl schedul period execut time alloc pe execut time alloc pe execut time commun edg bu averag power consumpt number schedul event shown bracket unit base tradit assumpt distribut assum time assum buffer fig task graph fig valid schedul assum power consumpt state part overhead enter leav state present make assumpt discharg power system summat power consumpt pe buse schedul fig discharg power distribut approxim schedul fig discharg power distribut equat actual power drawn batteri schedul fig schedul fig constant schedul result reduct actual power drawn correspondingli improv batteri lifespan illustr effect voltag scale distribut system pe relationship clock suppli voltag power calcul power present processor clock express term suppli dd threshold constant assum processor express term switch suppli dd dd task graph shown fig fig feasibl static schedul distribut system consist connect bu assum power suppli voltag execut time alloc pe execut time alloc pe execut time commun edg assum averag power consumpt task averag power consumpt commun edg unit fig feasibl schedul schedul slot interchang shift schedul fig fig task graph origin feasibl schedul schedul fig origin schedul schedul schedul fig schedul schedul slot shift swap schedul fig origin schedul origin feasibl schedul feasibl schedul perform voltag scale schedul extend execut time task latest finish time schedul shown fig fig fig schedul time instant finish late time instant speed scale ratio suppli voltag scale extend actual run length fig work voltag task fig work voltag task task perform metric includ averag power consumpt batteri servic life evalu equat averag power shown tabl tabl constant tabl perform characterist schedul schedul averag power consumpt system servic life evalu base averag power consumpt fig fig fig compar schedul fig schedul fig result reduct averag system power consumpt improv batteri servic life evalu base averag power consumpt schedul fig reduct averag system power consumpt improv batteri servic life evalu base averag power compar schedul fig voltag scale reduc system power consumpt batteri lifespan effici voltag scale scheme lead differ fig fig show static resourc assign schedul static resourc assign schedul algorithm system synthesi tool present list schedul algorithm gener static pe commun link schedul task commun event common multipl task graph period system specif exist feasibl schedul period task graph exist feasibl schedul list schedul scheme system synthesi order gener distribut architectur feasibl schedul schedul scheme optim power consumpt modifi static schedul stage seri schedul discuss section schedul scheme present schedul scheme aim optim system discharg power profil heurist optim batteri suggest section base minim peak power consumpt reduct varianc discharg current profil goal schedul scheme reduc act averag actual power drawn evalu act dt power consumpt time cp batteri util factor evalu time note equat variat equat summat power consumpt pe system compon draw power batteri assum compon system power consumpt easili incorpor repres fix contribut assum averag power consumpt execut time simul analysi tool energi consumpt pe idl period ip system enter sleep state model ei pe wi pw ip ei wi delai overhead power consumpt enter sleep state power consumpt state pe assum sleep state minim ec defin variabl function present heurist defin list static schedul event order start time pe bu arrai pe buse schedul event period task commun event static event start finish execut time event schedul schedul event refer pe commun edg enter commun edg refer edg parent task child task assign pe deadlin task task finish constraint schedul optim scheme part initi schedul optim global shift goal reduc peak power consumpt flexibl schedul local schedul transform emploi optim discharg power profil detail schedul scheme present subsect local schedul transform local schedul transform rank time point order highest power consumpt time point lowest interchang adjac event shift forward shift backward event time goal reduc cost function act evalu equat order valid schedul interchang schedul event shift forward schedul event shift backward schedul event violat evalu possibl shift forward shift backward amount case shift forward child task shift backward parent task amount case commun effect act local schedul transform perform violat relationship hard time act reduc round power profil process repeat longer chang illustr scheme task graph fig initi schedul fig fig illustr step involv appli method schedul fig rank time period term power profil initi step involv interchang reduc power consumpt time period interchang shift backward deal time period result schedul shown fig rank time period term updat shift forward relax current peak power consumpt time period act result schedul shown fig reduc origin schedul schedul step fig schedul transform step task graph fig global shift scheme local transform scheme depend good initi solut illustr fig show system specif consist task graph fig feasibl static schedul distribut system consist connect bu execut time alloc pe execut time alloc pe execut time commun edg bu power consumpt number schedul event shown bracket schedul opportun local movement order reduc act schedul fig schedul optim batteri effici fig task graph order good initi process schedul global shift shift schedul slot global manner goal reduc peak power consumpt flexibl schedul process start initi schedul schedul event shift backward earli posit creat event process queue initi insert event commun edg shift task commun event process queue late long posit task commun event shift averag power consumpt durat exce threshold neg result chang group idl threshold shift forward schedul event posit term reduct act task commun event ad process queue event data depend finish shift shift forward late flexibl schedul opportun open schedul transform global shift scheme illustr initi schedul fig valid local act movement reduc averag power consumpt assum global shift slot averag power consumpt time period shift late time period shift late global shift schedul shown fig interchang reduc act violat relationship hard constraint final schedul shown fig compar schedul fig varianc discharg power profil reduc schedul fig initi schedul schedul global shift schedul global shift final schedul schedul interchang fig optim schedul scheme system processor voltag scale high potenti reduc system energi algorithm tune facilit possibl scale voltag task defin slack time schedul task differ finish time slack time distribut schedul make scale voltag sacrif constraint schedul scheme alloc slack time optim improv perform consequ voltag scale assum task execut time slack ei execut pi power consumpt maximum voltag max summat slack time task pe initi summat execut time task pe approxim total slack time task equat evalu effect voltag task speed reduct ratio scale di ei work voltag ei ei vi vt vt β max di β di β object minim energi consumpt task voltag pi di vi pi ei vi task constraint di slack di threshold voltag close optim solut approxim pi long di ei alloc slack time perform global schedul shift schedul slot interchang match optim slack di ei task result present result task graph gener aid random task graph evalu perform schedul scheme present section actual power consumpt drawn batteri evalu equat evalu averag power consumpt durat averag match order time constant chang discharg assum evalu batteri effici base data extract specif batteri evalu test base task graph set rate batteri capac term test set averag power consumpt system result origin schedul schedul optim term discharg power profil compar tabl av tabl averag power consumpt system optim schedul result improv batteri lifespan rang test set experi show sacrif perform constraint introduc overhead shape discharg power profil boost batteri perform effect optim scheme power stringent discharg lower temperatur limit batteri batteri capac loss pronounc discharg rate high shown test set rate batteri capac compar test set optim batteri discharg power profil effect batteri perform evalu perform schedul scheme present section compar schedul slack time schedul slack time evalu batteri perform shape discharg power profil result shown tabl set task graph scheme achiev averag power reduct rang compar scheme scheme term batteri lifespan act evalu scheme result improv rang scheme scheme term batteri lifespan comput batteri capac averag power divid averag power scheme result improv rang scheme scheme observ improv pronounc shape discharg power profil act evalu base scheme reduc averag discharg power level varianc scheme power boost batteri perform tabl comparison schedul scheme power consumpt test pe buse av act batteri optim optim batteri lifespan present scheme optim batteri lifespan distribut system reduc averag discharg power profil shape distribut scheme optim discharg power profil scheme perform schedul effici distribut system pe reduc averag discharg power consumpt minim varianc discharg power profil scheme batteri lifespan constraint test relationship distribut base evalu metric awar shape discharg power profil futur evalu metric incorpor batteri recoveri effect refer cf rr batteri discharg commun proc pp aug power system issu cpu mobil phd carnegi mellon depart electr comput aug handbook proc design autom pp june de effici design batteri power proc int symp low power electron pp aug power manag base markov proc design autom pp june de power manag adapt learn proc int conf pp nov optim ieee tran vol pp dec shin consciou fix prioriti schedul hard proc design autom pp june luo joint schedul period task graph aperiod task distribut proc int conf pp nov dick multiobject system proc design autom test europ pp mar task graph proc int workshop pp mar period occur task multipl inform process vol pp feb estim softwar instruct cach proc int conf pp nov design energi estim proc design autom pp june tabl comparison scheme act batteri lifespan evalu act batteri lifespan act av power consumpt batteri lifespan evalu averag power consumpt
HCI/1689 4 extens commun protocol benchmark multimedia inform retriev system wolfgang hen thierri pun david mcg squir christoph de vri comput vision comput scienc switzerland comput scienc softwar monash australia ergonom ecol polytechniqu de switzerland medic biolog deutsch germani netherland abstract area relat ensur common commun protocol content base imag retriev system multimedia retriev system lack common queri languag common commun protocol obviou short term system crucial exchang analysi user data present describ extens queri markup call retriev markup primarili design ensur di erent multimedia retriev system research preserv freedom extend system encapsul multimedia queri enabl multimedia queri mm content mm queri mm user interfac grow independ reach maximum ensur maximum freedom develop bene ting simpl design principl respect extend privat design extens framework detail paper implement test cbir user interfac part gnu project download site commun evalu introduct past decad interest research cbir attract cbir research multidisciplinari wide rang research issu human interfac queri featur extract index prune perform evalu rich great challeng cbir research research eld build entir system address aspect problem interest research work small team great diculti construct state art system typic phd multimedia retriev markup framework compon cbir system built exchang state art compon cbir system made research bene opportun focu investig area greatest interest imag retriev system connect interfac function part program program provid web instal local speci oper system compon user develop anew make share user data comparison system perform dicult order address chang al queri taxonomi multimedia initi formul requir system enabl commun multimedia client approach translat extens protocol paper present markup languag multimedia queri design facilit develop separ commun problem search queri languag multimedia design ful ll imag research design cater develop standard queri standard method transmit queri improv multimedia sql odbc exampl develop relat aim similar promot medic imag system di erent vendor address urgent common tool facilit develop evalu multimedia system facilit develop common benchmark cbir similar textual inform retriev paradigm relev feedback search paradigm emploi current provid extens qbe facil tool develop made freeli gnu public accept part gnu project brie section includ cbir search engin act interfac act client script perl made provid basi creation standard cbir benchmark overview evalu method annot imag test dataset advoc order research group test extens approv emploi develop model permit phase independ growth subsequ code merg section present main featur section show extend suit stai coher common standard commun protocol exibl benchmark system support multipl type section articl volum circu initi design facilit cooper research group main program testb origin ecol polytechniqu de lausann geneva link singl interfac di erent cbir link mirror dbm develop imag search engin base techniqu commonli text retriev er ecient access larg number featur simpl color textur local detail descript found circu server framework support multipl imag retriev method algorithm method base lsi wavelet decomposit support client applic written java portabl er queri multipl posit neg queri multipl collect algorithm scatter plot result aspect similar basket imag multimedia retriev markup languag formal speci ed framework separ queri formul actual queri ship design markup queri multimedia enabl separ interfac queri engin independ develop exist system ort mean standard parser process commun messag code cbir system basic implement end commun toolkit test phase applic base protocol benchmark system engin develop design extens independ group research platform extens part common design goal import section mind prioriti account design obviou short term cbir commun fact interfac cbir client server speci ed hamper research topic bene engin queri queri engin assembl result construct engin requir de ne protocol abstract layer di erent queri system common protocol save substanti amount work aim compar impact di erent user interfac perform ident queri test engin ident interfac ensur compat engin type evalu evalu queri design benchmark packag connect send set queri evalu result extens administr goal provid commun protocol extend standard bodi permiss enabl independ develop extens describ section invit user render extens access stabl extens ad common version common log le area cbir ground truth user data human easi format log commun cbir client server maximum data interest comput learn extens design order send addit data simplic design minim implement overhead incur maximum exibl xml elimin valid parser maintain exibl featur commun structur remot procedur client connect send stai connect server server break connect server shut connect send messag answer request protocol advantag implement server limit perform loss frequent send request part singl messag extens protocol permit negoti perman connect plan current speci cation support request capabl descript open close session select data collect classi ed queri request collect queri select con gurat queri classi ed queri permit run time con gurat formul qbe transmiss user interact data nal featur ect strong belief ectiv comput plai role eld multimedia retriev support log user interact data grace independ develop common base grace degrad kei success independ extens basic principl summar server client recogn xml element attribut encount text complet ignor extens design standard inform remain gener user exampl section principl provid guidelin independ extens avoid con ict di er extens order plan maintain promot central registr document extens facilit user log extend log cbir sever log cbir con gurat speci cation queri formul queri step depend queri paradigm er interfac search engin includ design extens paradigm basic qbe queri consist list imag relev level assign user user mark imag posit imag neg queri imag refer url server return retriev result list repres url queri group transact formul log complex queri appli system process singl queri varieti version system lee al import case preserv log knowledg queri logic relat extend demonstr exibl small illustr design guidelin design show extend region queri show easili multimedia descript interleav region queri extens cbir system concentr queri complet imag rst system region blobworld user present segment imag segment relev queri give express qbe queri augment segment inform usual inform bene client receiv understand main part queri speci ed chain code give outlin region chain code region give start point give direct start point case rst pixel north mark rectangular region de ning region move direct describ segment fig describ imag background request di erent background classic queri languag simpli cdata section express queri queri languag figur extens user request background di erent present perform qbe queri imag shown fig region queri base prolog fact imag prolog atom queri result weight rank prolog queri rank obtain qbe queri design share document intern multimedia content descript larg collect descript aim describ aspect multimedia data data descript xml schema xml schema consid replac xml dtd type de speci es grammar text dtd gear text xml schema gear data transfer de nition type system basi speci cation time parser meet aspect speci cation text xml problem pipe multimedia content descript queri processor process recogn tag act tag simpli method structur annot ds demonstr geneva meet binari data prefer mechan transfer binari data send url data found binari data retriev url primari goal enabl share log data suggest transfer big chunk data binari data stai constant session imag media item queri transfer log le data access binari data queri process le imag qbe queri access transfer attribut attribut binari mime type prefer design proper extens provid access readabl result log develop model state develop extend extens noti cation central bodi make extens work maxim present set document extens intend provid forum group extend similar direct develop extens fashion search rst page document extens implement exist author exist extens document understood add aliat list extens implement submit document extens aliat inform analyz log merg extens proven present extens framework cbir multimedia retriev system section describ benchmark preliminari step cbir commun develop common benchmark comparison evalu techniqu found fig give uml sequenc diagram describ benchmark system serv separ benchmark system benchmark system begin benchmark bs establish connect con gure session algorithm input paramet relev data repositori result queri evalu hand number test user bs send test user test queri queri relev data gener feedback pose data evalu learn capac queri result store result comparison di erent run di erent queri engin replac compon permit implement feedback strategi benchmark qbe system imag consid relev case imag browser notion sucient support notion rel relev extend benchmark system support notion relev volum result repositori formul feedback queri repositori benchmark system parser dispatch queri time queri test user result imag benchmark system benchmark system connect figur sequenc diagram benchmark architectur commun benchmark system benchmark system compon mark benchmark system part benchmark system meta queri engin conceiv meta queri engin queri compliant server plan method similar describ meta queri engin qbe queri call meta queri engin queri set queri qe qe queri qe qe list algorithm collect signal open connect list collect algorithm di erent qe choic di erent level simpl give user choic di erent hand choic algorithm properti sheet con gurat algorithm complex build complex properti enabl distribut queri multipl queri processor give full con gurat choic user open session qe rst queri open session qe con gure user queri pass queri qe con gure user receiv answer queri engin merg pass merg result client develop rst tool establish common framework fast develop cbir applic rst gener commun protocol cbir implement sourc code interfac queri engin freeli develop retriev engin develop user interfac develop complet system basi exist compon extens test shown stabil protocol test compon free extens avail applic tool support protocol facilit develop cbir applic support queri paradigm import opinion fact adopt lead possibl compar di erent cbir applic object develop system make easi benchmark system similar benchmark exist inform retriev commun possibl share user log provid tool share user interact data learn evalu acknowledg project support swiss nation foundat scienti research grant number refer mage tm ibm queri imag taxonomi multimedia al symposium video data multimedia object queri intern workshop multimedia inform pp septemb de multimedia queri process extens fourteenth twent workshop languag technolog languag technolog multimedia inform pp decemb cook book implement philip medic seventh text retriev confer seventh text retriev pp novemb evalu imag overview pattern recognit letter depart comput scienc fair benchmark imag internet multimedia manag vol spie novemb inform technolog de van mirror intern confer larg pp septemb technic demo access method imag retriev invert al symposium video data queri imag inspir text invert weight relev scandinavian confer imag analysi pp june retriev latent semant nal year graduat commun ecol polytechniqu de june de extens standard multimedia queri benchmark draft tech rep comput vision comput rue octob engin symposium electron multimedia process applic storag retriev imag video san ectiv mit move extens bayesian method multimedia al symposium video data base user relev feedback imag al symposium video data imag ieee confer comput vision pattern recognit ieee comput puerto june encod arbitrari geometr con ir tran electron comput pp evalu imag overview tech rep comput vision comput rue decemb multimedia storag archiv system iv vol spie septemb symposium video data
Agents/1690 1 limit logic belief analysi antonio moreno superior universitat de spain abstract process ration inquiri defin evolut belief ration agent consequ intern infer procedur interact environ belief model formal doxast logic world model kripk semant provid intuit semant commit model agent logic omnisci perfect reason problem avoid syntact view defin arbitrari set sentenc proposit belief logic articl syntact view world dynam analysi agent belief suggest order model process ration inquiri agent perman engag compon logic dimens analysi perform modifi version analyt tableaux model evolut belief due agent infer power shown reason achiev agent deduct abil control restrict tautolog logic agent oblig perform exhaust analysi initi tableau document extend version limit logic belief februari introduct aim work model process ration transform belief intellig agent time classic philosoph tradit consid compon ration consist applic infer procedur actual belief addit infer belief discoveri incompat empir add remov belief result observ perform agent environ dimens shown section logic belief tool formal reason belief perform intellig agent logic modal logic necess oper interpret belief formula languag semant interpret world model kripk semant semant postul set world binari access relat connect world world real agent belief agent proposit world iff true world world st drawback appar logic model agent process ration inquiri main problem model agent logic omnisci classic perfect reason belief close classic deduct properti agent design model ideal agent children muddi children inadequ realist agent consid argument logic omnisci perfect reason ffl agent unawar fact halpern fact account logic gener ffl agent limit resourc time requir space perform evid ration agent implement real comput ffl agent ignor relev rule agent told rule modu view consid konolig phd thesi agent model base set belief set infer rule fund european human capit mobil project virtual contract limit logic belief februari goal overcom develop model process ration inquiri evolut belief ration agent time consequ interact world intern inferenti world model kripk semant natur intuit semant modal avoid logic omnisci perfect reason syntact view world defin world set formula proposit doxast languag condit partial fact actual world inconsist inconsist appar hidden deduct argu favour kind world number ffl logic inconsist world model instanc situat agent unabl belief account subset draw consist context inconsist belief consid remark shoham fagin halpern model situat logic local consid idea ffl defin interest procedur inquiri inconsist set belief shown ffl situat tautolog inform believ model instanc initi state inform rasa theori lock rousseau world situat conceiv agent world impli world fail tautolog logic omnisci deduct close agent perfect ai literatur author deal problem introduc imposs world logic connect behav usual tautolog inconsist formula hold imposs world world world situat semant approach allevi problem logic omnisci perfect problem detail review main inconveni syntact approach defin world set agent limit logic belief februari minim set infer capabl author argu make analysi agent belief rest document show belief evolv time consequ analysi dynam belief analysi evolut agent belief time due dynam analysi ffl logic dimens model inferenti process carri ffl dimens model belief interact agent environ rest document describ logic analysi descript side analysi pictur belief system found basic idea side analysi agent order corrobor falsifi result obtain logic fashion belief obtain logic analysi falsifi belief procedur chang initi belief agent proce logic analysi set belief logic analysi languag finit fix set basic proposit logic oper modal belief oper formula languag restrict standard proposit prefix negat possibl sequenc modal oper world defin set formula logic analysi agent gener sequenc access relat standard kripk defin set belief logic analysi model evolut agent belief time due intern deduct infer evolut illustr small agent belief world conjunct materi implic defin negat disjunct usual agent subset proposit modal logic consid restrict overcom futur work limit logic belief februari world defin set formula initi set belief agent gener initi access appli standard kripk semant world world iff formula believ agent belief agent world restrict proposit doxast proposit common access world belief ontolog world defin repres figur rs ff figur world doxast altern world repres rectangl left repres ffl formula ffl formula ffl formula believ ffl formula believ class world repres world class world class ff world logic analysi agent belief perform modifi version analyt tableaux method tableau divid left column analysi start tableau left column initi nest belief consid similar analyt tableaux tree level nest exampl initi set belief negat belief treatment tricki column includ rectangl reinforc interpret belief figur fourth column column ff differ respect classic analyt set formula limit logic belief februari set belief agent light previou argu repres agent belief descript world initi connect belief true world repres ff tableau repres class world proposit tableau true tableau repres world formula left column formula column explicit neg inform analyt tableaux enrich kind situat model standard world model semant formula classic pictur neg inform includ situat explicit inform consid model situat ffl agent thought ff ffl situat intermedi step complet stage ffl situat agent thought believ negat split rule analyt tableaux method modifi appli disjunct left column tableaux gener oe left oe left column left column oe column rule agent explor possibl account truth member true formula applic rule disjunct situat shown figur reach partit class ff ffl ff world ff ffl ff world ff note impli recal classic analyt tableaux analysi disjunct gener ff fi minor modif respect classic conveni talk formula open tableaux longer cumbersom formula branch tableaux tree limit logic belief februari sp sp sp figur split rule appli ffl ff world ff ffl ff world ff tableau repres class world ff repres ff repres ff world class ff consid analyt tableaux model initi set formula model set fail true tableaux analysi tableau close circumst ffl tableau formula negat left world belong class world repres tableau explicit consid logic imposs elimin analysi ffl tableau formula left column repres world repres empti set world dismiss analysi reason tableaux posit neg easier pictur analysi disjunct partit class doxast classic class world repres gener split rule world belong class world close condit classic method situat instanc replac limit logic belief februari left agent class world repres tableaux ff ff logic imposs rid world close dismiss branch logic analysi remain tableaux tree effect analysi formula restrict doxast altern shrink ff ff applic split rule model gener access restrict set world restrict shown figur rs sp sp ff ff ff ff sp sp sp ff figur reduct belief altern world class ff world class ff chang access relat impli chang belief agent belief point notic limit logic belief februari restrict belief altern addit formula belief includ world ff world ff includ world ff analysi show belief agent fact reflect figur addit fourth column agent pursu analysi belief gener access disjunct obtain result shown figur sp sp sp sp figur analysi intuit interpret restrict result partit ff subclass ffl ff world ff posit belief formula column class doxast neg belief formula column class doxast altern limit logic belief februari ffl ff world ff ffl ff world ff ffl ff world ff world ff world subclass ff ff ff ff ff ff ff repres tableaux situat depict figur ff sp rs sp sp ff sp ff ff sp ff ff ff ff ff sp sp sp figur reduct belief altern notic set posit belief formula common world common world set neg belief limit logic belief februari doxast altern world ff situat world class ff believ fact reflect fourth column rectangl repres figur disjunct open end analysi agent perform introduc instanc topic consid section introduc tautolog shown section classic analyt tableaux method modifi number ffl tableau set formula left repres set world formula left column formula column ffl split rule gener member disjunct left left column column repres world disjunct hold ffl appli split proposit formula tableau maintain result delet agent add tag proposit recal import modif classic analyt tableaux method agent add open tableau tautolog classic analyt tableaux tautolog introduc open tableau notic agent belief stage analysi formula open tableaux agent freeli introduc tautolog open logic omnisci avoid case agent reach deduct consequ initi set perfect reason split rule disjunct left rule order formula gener negat formula form column rest document initi posit disjunct split except explain formula ff logic consequ initi set belief obtain logic analysi belief introduc formula open tableaux exhaust tableaux close situat eventu reach set inconsist limit logic belief februari forbid tautolog drastic avoid logic omnisci perfect put sever limit agent deduct capabl definit formula deriv initi set iff perform logic analyt tableaux method section initi tableau left left column open tableaux recal open tableaux repres class doxast point logic analysi open tableaux formula formula doxast altern kripk belief agent point set potenti belief equal set deriv formula set definit set ffl fc st subsum ffl fc st ffl ffl lemma iff ffl formula ffl negat ffl inconsist condit trivial call tc rest formula automat set deriv belief creat tableau immedi close condit state remov gener inconsist set assum formula sake assum rest document formula initi set formula transform conjunct normal form open formula deriv inconsist consequ avoid model limit logic belief februari deriv iff tableau fc happen iff set inconsist tautolog set deriv formula small subset logic consequ initi set tautolog logic omnisci perfect reason unavoid fact suggest interest control agent deduct tautolog logic analysi instanc agent instanc axiom exclud tautolog natur agent believ formula negat except permit introduct formula split column agent explor altern logic analysi guid search exampl give side doubt possibl ad kind tautolog analyt tableaux idea tradit classic proof suggest hintikka interrog model inquiri model process scientif inquiri plai interrog game plai inquir natur inquir seek true perform deduct move analyt interrog question put natur interrog hintikka introduct instanc left side formula formula substitut instanc subformula formula respect introduct instanc control set formula believ agent set deriv formula depend kind instanc put restrict principl constrain set obtain formula set potenti assum restrict deriv defin definit agent introduc open tableau logic analysi instanc initi set belief logic logic analysi agent rule tableau close classic analyt tableaux simpli proof deriv immedi close left column hintikka classic analyt limit logic belief februari formula initi set iff perform logic analysi left column open tableaux set formula larger set deriv shown lemma iff tc ffl ffl agent trivial condit tc previou iff formula introduc open tableaux eventu tableaux formula left column formula set kind idea push tautolog consid preliminari studi instanc tautolog logic main point logic analysi logic omnisci perfect reason potenti belief agent control restrict tautolog agent logic analysi logic analysi suggest document introduc model imperfect reason classic analyt tableaux method order prove ff consequ set fail build model exhaust analyz tableau close analyt tableaux tree analysi import agent oblig exhaust analyz tableau model imperfect reason due lack previou kind imperfect model agent perfect deduct power agent decid stop logic analysi point deriv proce task make test order corrobor falsifi current belief obtain logic deriv agent extra tableau formula left column gener formula tableaux obtain analysi hintikka model set wait model agent limit logic belief februari summari futur work articl dynam analysi ration agent set belief logic dimens logic analysi perform modifi version analyt tableaux agent deduc fact initi set belief logic omnisci perfect reason avoid ffl deduct power agent control restrict instanc tautolog introduc open tableaux ffl agent decid perform exhaust logic intermedi belief good guid behaviour serv basi analysi futur work constraint studi discov tautolog yield interest set deduct consequ kei issu research studi interact strand analysi preliminari studi refer mathemat north semant entail formal van de van logic logic journal philosoph logic framework logic explicit comput intellig awar limit reason mit mose guid complet complex modal logic knowledg artifici intellig limit logic belief februari knowledg cornel world journal philosoph logic logic interrog model scientif reason knowledg paradigm epistem interrog model inquiri gener theori argument commun cognit introduct modal una la logica ed calculi construct institut languag dissert seri deduct model morgan semant analysi modal logic normal modal proposit fur mathematisch logik und grundlagen mathematik logic implicit explicit knowledg comput intellig dynam belief fourth intern colloquium cognit extend version research report depart technic belief research report human commun research de la vi confer spanish associ belief submit limit logic belief februari logic belief submit logic scientif hutchinson logic reason knowledg knowledg engin review logic varieti artifici intellig mathemat theori academ springer
IR/1691 5 exploit redund question answer charl clark gordon cormack thoma depart comput canada abstract goal automat answer factual question form battl wrote wind answer question found problem reduc nding potenti answer larg volum data valid accuraci appli method arbitrari passag retriev rst half problem demonstr answer redund address half success approach depend idea volum web data larg suppli answer factual question multipl time multipl context queri gener question queri select short passag answer larg collect web data passag analyz identifi candid answer frequenc candid passag answer approach test question test collect addit approach extend answer multipl choic question form typic game show question answer question answer recent receiv attent inform retriev inform extract extens tradit interest area intersect typic qa task requir answer short factual larg target corpu sourc answer answer form text fragment contrast tradit ir accept qa system retriev full paragraph larg text question contrast tradit ed domain permiss make digit hard copi part work person classroom grant fee provid copi made distribut profit commerci advantag copi bear notic full citat page copi post server redistribut requir prior specif permiss fee septemb usa copyright acm restrict type deal topic past work question answer encourag question answer task work trec confer sponsor annual nation institut standard technolog recent task consist question pose target corpu newspap answer question corpu answer form text fragment extract target corpu ve attempt answer question attempt primari evalu measur base rank rst fragment correct answer type run di er maximum length text byte figur simpli ed overview qa gener run parser analyz question extract type queri submiss passag retriev set select rule guid process extract answer passag passag retriev compon execut queri target retriev rank list top passag analysi answer select compon select rule includ answer categori identi es gener type inform sought question answer select compon identi es answer passag rank candid varieti heurist heurist account number time candid retriev locat candid retriev rank passag candid likelihood candid match assign answer inform provid select rule gener approach question analysi ir ubiquit qa system simpl question answer select compon qa system good perform qa task system top run experi trec qa task speci featur make greatest contribut passag retriev question answer passag select rule queri corpu select answer figur qa system architectur perform system exibl parser make reason choic face unexpect question type format basic passag retriev produc passag analysi candid redund answer select compon combin evid multipl passag identifi answer candid answer top rank passag strong indic import candid exploit redund question answer main subject present paper remaind paper organ section detail passag retriev form basi remaind work section outlin role redund experi discuss contribut perform qa system section examin impact redund broader context remov answer corpu requir exact text fragment answer larg collect web data target corpu work extend section question drawn popular game show test redund paper conclud overview addit relat research discuss futur work passag retriev qa question answer system incorpor ir compon passag retriev sentenc segment treat separ document retriev techniqu appli retriev obviou ir method ideal suit question answer environ text fragment suppli answer question topic question incid topic document paragraph fragment evid support answer question samuel johnson friend suppli text fragment cultur comment stanlei plai boswel samuel jazz music primari concern document drawn similar current paper answer dozen unrel question question answer passag retriev techniqu depend prede ned retriev document substr target corpu techniqu appli question answer experi outlin paper section addit justi cation techniqu brie discuss ecient implement document corpu treat order sequenc passag repres extent order pair coordin correspond subsequ begin posit end posit du queri gener origin question form term extent sati es term set subsequ de ned extent occurr term extent cover sati es subsequ subsequ sati es exist extent sati es extent cover term set comput score extent respect ect likelihood answer question extent close proxim model document sequenc independ gener term assum xed probabl term match document locat note simplifi assumpt multipl term match locat extent length probabl extent occurr lp lp probabl extent term lp jt estim term frequenc target corpu total number time target corpu total length document corpu score extent length term jt equat assign higher score passag probabl occurr lower higher score directli impli greater likelihood answer close empir evid suggest relationship hold run submit qa experi base sole passag retriev techniqu simpli elimin stopword answer simpli submit fragment center extent simplic answer question ve fragment submit system system queri gener cover subset rank equat highest rank passag document discard top analysi implement techniqu depend fast algorithm comput cover subset extent queri subsequ de ned extent distinct term extent es shorter extent es appendix refer present algorithm gener set time jj set cover subset simpli union experi import redund appar analysi qa result run approach outlin figur passag retriev techniqu present section retriev top passag symmetr expand term analysi complet discuss question answer select compon provid paper remaind focu redund answer select compon goal qa experi select answer fragment retriev answer select techniqu gener run attempt identifi candid exact complet answer candid singl natur term depend categori question question proper candid consist term match simpl syntact pattern proper question candid consist numer valu question classi candid simpli consist term retriev passag identi candid term assign weight account number distinct passag term rel frequenc term number distinct passag repres redund candid weight candid select answer fragment retriev passag fragment retriev passag consid answer score fragment comput sum weight candid term text fragment set candid score fragment score modi ed number heurist account rank passag fragment locat fragment rel select rule gener parser heurist minor ect system perform fragment weight candid fragment reduc fragment fragment select process repeat ve fragment select weight assign candid combin redund factor factor individu contribut ascertain set constant measur result impact question answer perform figur compar di erent formul weight qa test collect candid weight experi answer answer number percent number percent reciproc rank correct correct reciproc rank correct correct raw passag figur result discuss weight ignor candid essenti candid equal number time passag weight treat candid term frequenc redund account nal row gure present result fragment center top ve duplic techniqu figur report ectiv measur reciproc rank standard trec ectiv measur report nist trec qa run comput question assign score rank rst fragment judg correct answer fragment question assign score score question averag produc run addit gure report number percent question correct answer found ve fragment measur comput automat judg script develop redund appar run elimin redund factor reduc number question answer correctli elimin term frequenc factor lesser reduc number correct question raw passag lower answer fewer question raw passag exhibit good harm answer select redund term frequenc factor exploit redund trec text fragment report answer explor redund question answer simpli ed compon figur elimin confound question select rule singl categori requir person attempt redund mean isol requir top rank passag identifi candid answer simpl syntact pattern match written match includ proper noun hypothesi redund substitut deeper correct answer distinguish candid sole repeat occurr proxim passag identi ed question qa collect requir person answer typic exampl femal gure wrote book question gener queri question tradit ir approach elimin stopword provid greater potenti redund provid opportun studi impact size qa corpu favor larger trec corpu corpu di er qa corpu import respect qa corpu consist newspap articl corpu arbitrari web gener expect document corpu lower qualiti answer qa question present qa case corpu curiou discov extent small collect web data answer set independ creat question simpl syntact pattern identifi candid answer sequenc token separ whitespac singl hyphen consid candid token de ned letter letter letter period capit stopword consid candid answer consist initi simpl pattern reject valid includ inappropri candid identi cation proper includ understood problem felt bene ts transpar outweigh bene ts accur candid identi cation answer speci calli examin abil redund overcom low inher crude cation techniqu interest queri retriev top passag equat passag expand symmetr byte experi vari paramet refer depth width candid answer identi ed candid consist queri term elimin remain candid assign score simpli count number distinct passag candid candid rank depth width reciproc rank number correct percent correct top passag top passag figur impact redund ti broken appli simpl rule account distanc candid passag passag candid distanc passag closest occurr candid record averag distanc break candid smaller averag rank higher preliminari experi question suggest depth width produc reason result question answer correctli correct answer rank rst top ve candid question world war hong kong prime minist rst candid consid correct mixtur invalid proper noun multipl valid answer typic result top ve candid question femal gure yamaguchi followup follow hard nanci fourth fth candid consid correct candid artifact creat primarili inappropri term queri gener seri relat post messag board addit independ data tend reduc rank candid rank remain candid top ve candid question wrote mark tom finn samuel connecticut includ author pen real princip charact exact answer identifi peopl count correct candid accept answer question charl candid accept answer candid accept answer leader india judg script design identifi exact determin correct answer requir combin automat manual process automat script base judg script analyz output run ag potenti correct answer result script manual check determin answer consist sole person run automat check verifi answer judg run ran experi rang depth width valu result report figur addit run redund gure report run comparison run repres simpl strategi extract candid answer retriev passag label top consist ve distinct candid closest top passag retriev candid rank distanc run paramet label top passag consist singl candid select top ve passag candid closest select candid select closest candid select rang produc minor slight tendenc improv stabil consid rang data size repres retriev passag data analyz data analyz question origin target corpu size reciproc rank percent correct figur uenc size nding multipl occurr answer context retriev ed question keyword order ascertain impact size result ran question subset full corpu document order randomli increasingli larger subset target corpu result present figur potenti remain addit improv size correct answer report top ve run report addit data forc correct answer top ve rank question requir answer candid select pattern fail match crude techniqu queri gener candid identi cation easili expect ect improv larg orthogon ect redund ect improv run phone friend popular game show air prime time american duplic local countri addit approach previou section extend answer question pose contest show question present multipl choic format question rst prime minist candid answer pierr elliot john john loui prize monei award correctli answer question rang contest start continu answer question correctli roughli doubl nal question reach contest elimin answer question incorrectli quit voluntarili attempt answer prize monei highest question correctli answer exist close set candid answer es vote process complic passag retriev process question continu treat retriev candid answer match phrase term answer contribut score passag retriev engin modi ed return highest score passag equat phrase match answer weight answer term higher incorrect choic intend joke red answer treat comput weight term phrase form everydai speech write top passag retriev question passag match candid passag expand width passag match candid answer count vote candid candid rank term number vote receiv appli approach question program rst broadcast abc network unit state octob novemb novemb result shown figur gure question total question number correct percent correct figur split question categori question intend easier question human relationship held system system answer question correctli addit question correct answer rank ti rst remain question essenti thing correct answer select exhibit characterist question correct answer rank case question refer event occur web crawl creat corpu answer context year question numer valu answer valu treat stopword corpu index question system crash execut behavior treat incorrect answer conclud discuss redund exploit method answer valid question answer system analysi qa result redund plai import role process select answer fragment top passag retriev question exact answer experi simpl vote algorithm demonstr redund ectiv method rank candid answer bene ts gain exploit redund larg independ bene ts gain improv compon qa system qa system misl passag inaccur answer tice page provid illustr problem discuss question rst american corpu passag wilson senat defeat jerri call rst american redund exploit experi report section corpu arbitrari web advanc question answer corpu appar corpu size sucient answer roughli question redund main answer select techniqu web data view low identifi page major problem web search system case question qualiti individu page import result page combin produc consensu quantiti ectiv substitut qualiti publish answer select algorithm make explicit redund algorithm studi context system design similar algorithm share featur algorithm present section develop system identifi redund major contributor perform report perform answer select exploit redund ve system run qa kupiec incorpor relat form answer valid secondari queri con rm relationship candid question term kupiec question lm pit humphrei florida text return initi queri suggest big kei treasur sierra candid set plot lm secondari queri phrase veri es relationship exist candid di erent form answer valid abduct infer techniqu al incorpor qa system candid text fragment candid abduct semant knowledg give logic cation correct candid reject justi cation experi report measur redund simpl count number passag candid extend measur encompass inform passag inform includ score rank passag minimum distanc candid passag answer select compon inform account make nal adjust score text adjust strictli ad hoc natur hope undertak theoret empir examin inform continu improv aspect qa system particip trec plan call extens qa experi varieti challeng direct refer eric john david marc mani question answer larg document collect aaai fall symposium question answer north sergei brin lawrenc page anatomi hypertextu web search engin seventh world wide web april clair cardi empir method inform extract ai winter clair vincent david chri bucklei examin role statist linguist knowledg sourc system sixth appli natur languag process page question answer passag select text retriev charl gordon elizabeth relev rank term queri inform process fast automat passag rank text retriev novemb ann nanci elizabeth question question answer track text retriev ralph grishman beth sundheim design evalu messag understand steven find answer larg collect paragraph index abduct infer aaai fall symposium question answer page north dan rada paul boost knowledg answer engin text retriev david nick paul donna harman result challeng web search evalu world wide web page mike text retriev abraham martin ratnaparkhi ibm statist question answer system text retriev kupiec robust linguist approach question answer encyclopedia annual intern acm sigir confer research develop inform page john eric radev predict annot annual intern acm sigir confer research develop inform page august john eric predict annot question answer text retriev john rank suspect answer natur languag question predict annot confer appli natur languag alan smeaton inform head natur languag process inform multidisciplinari approach emerg inform page juli reprint lectur note arti cial intellig wei li inform extract support question answer text retriev ellen donna editor ninth text retriev ellen dawn tice build question answer test collect annual intern acm sigir confer research develop inform page august stephen paul ann houston question answer text retriev zhu susan gauch incorpor qualiti metric inform retriev www annual intern acm sigir confer research develop inform page august
DB/1692 3 activ system norman paton oscar depart comput oxford manchest uk de sistema san spain activ system support mechan enabl respond automat event place system effort direct improv understand system recent made applic suggest high level activ yield standard approach integr activ function convent led improv understand activ behavior descript execut model architectur paper present fundament characterist activ describ collect repres system common consid consequ implement design discuss tool develop activ applic categori subject system gener system addit kei word activ relat introduct system view repositori store inform requir access user program interact interfac rang tool system support requir applic system begin appli rang domain highli complex inform substanti quantiti highli stringent perform convent environ prove unsatisfactori result trend research function requir applic support system give rise system facil model structur behavior aspect applic field receiv attent recent year view enhanc behavior facil system tempor spatial multimedia deduct activ paper tradit manag system passiv command execut nw paton diaz request user applic program situat effect model pattern railwai data store fare access termin circumst public cultur benefici add addit coach specif train number spare seat month advanc threshold option administr passiv system seek support requir add addit monitor function book program situat check time seat sold approach lead semant monitor task replic hidden applic program approach reli poll mechan period check number seat unlik semant applic repres singl difficulti stem ascertain poll frequenc cost penalti reaction late coach custom turn activ support applic move reactiv behavior applic poll dbm activ monitor react specif circumst relev applic reactiv semant central handl time manner activ system provid knowledg model descript execut model runtim support reactiv behavior common approach knowledg model rule condit action event part rule describ happen rule respond condit part rule examin context event place action describ task carri rule relev event place condit evalu true activ system support rule compon rule event condit miss implicit event result rule product rule condit result rule rule introduct activ rule system straightforward practic made support wide function issu distinguish express event scope access state condit time condit action evalu rel event function specif system influenc number includ natur passiv data model categori applic support activ applic mention research aim extend rang facil system repres applic concept addit activ system capabl larg depend applic target case activ categori applic system extens activ rule primit mechan support implement part system eca rule support integr constraint al diaz materi view al widom al deriv data coordin distribut comput al ceri widom transact model dittrich advanc data model construct al automat screen updat context chang al paton al extens core function support defin syntax extend map set activ rule al present constraint languag implement activ illustr applic model power distribut system constraint restrict wire voltag greater type express type constraint violat rang updat oper wire creat exist monitor set system gener activ rule check violat constraint insert activ rule insert wire type defin event insert tupl wire express specifi action inform event refer condit access voltag type newli insert tupl reserv word insert action defin wai updat oper block abort constraint repair chang voltag insert close applic categori applic involv activ function describ behavior manifest softwar system refer extern devic system rule describ repair action model monitor sale stock control propag load calcul architectur design anticip market activ portfolio manag applic map descript activ rule languag eca rule directli support semant nw paton diaz applic portfolio manag rule written delet stock holder portfolio time record holder distinct updat holder begin delet holder insert valu end event monitor updat attribut holder relat condit check element assign attribut action delet updat tupl holder insert inform delet tupl relat worth note condit action rule requir access inform updat trigger rule open applic categori conjunct monitor devic record respond situat rule command control applic respond evolv battlefield scenario al medic applic warn physician patient condit al transport applic anticip traffic control detect potenti danger aircraft movement aircraft monitor rule adapt inform control aircraft approach updat po aircraft exist aircraft messag event monitor posit aircraft notifi extern action chang displai air traffic control monitor po affect event access condit outlin paper paper overview recent research activ system section introduc applic paper section present structur characterist activ section show execut model interpret set rule section facil manag rule section describ compar rang repres activ activ system holder stock price countri fig diagram portfolio system framework present section section architectur featur import implement activ system section consid facil support develop applic activ function section present applic section introduc portfolio manag paper exemplifi function activ system segev rang applic stand benefit presenc activ function monitor identifi unusu pattern enforc integr maintain deriv gener time perform period process relev entiti relationship depict graphic figur holder individu organ stock holder uniqu registr countri total stock held organ float stock market repres entiti type attribut record share total number share uniqu identif number referenc relationship holder possess item kind stock relat schema implement sql present figur specif exampl activ behavior applic introduc illustr present group rule present syntax specif activ rule notat base sql requir minim explan knowledg model knowledg model activ system activ rule system contrast execut determin set rule behav present section knowledg model essenti support descript activ featur dealt section direct nw paton diaz creat tabl holder countri real creat tabl stock price int creat tabl int refer int refer int fig relat tabl store portfolio inform syntax rule languag rule languag illustr featur knowledg section base number dimens activ extend present al dimens essenti make explicit space design activ rule system endeavor provid formal descript semant specif rule topic dealt section concept consid section dimens aim provid framework activ introduc terminolog familiar reader paper al widom finkelstein stonebrak al dimens rule function consid paper present tabular form symbol ae dimens valu list altern knowledg model activ rule consid princip condit action dimens structur compon activ rule present tabl discuss subsect event event point time event involv provid descript happen monitor natur descript event detect larg depend sourc gener event altern case event oper piec structur insert updat access activ system tabl dimens knowledg model event sourc ae behavior granular ae type ae composit oper ae consumpt mode ae continu role condit role context ae fdb bind action option ae behavior abort context ae fdb bind dba case event execut oper messag displai object type common event languag event oper execut case event transact command case program mechan applic program signal occurr event explicitli inform enter case event result except produc attempt made access data case event point time al gatziu dittrich absolut novemb rel dai share period dai time event report literatur case event happen temperatur read al event granular event event defin object set instanc subset staff member specif member set prevent unauthor access specif enabl updat specif widget object present screen al type event case event occurr belong categori sourc event insert monitor insert tupl relat case event combin primit composit event rang oper constitut event algebra rang event oper vari system system common disjunct occur conjunct nw paton diaz occur sequenc occur occur closur closur int time occurr time interv histori int signal event occur time time interv note detect event interv int rule composit rule enforc constraint attribut stock amount record updat holder updat stock insert stock delet stock insert holder delet holder exist stock abort detect stock price chang work dai event updat price stock rich event algebra rang includ al dittrich od al sentinel al composit event handl present challeng term semant effici fulli address detect composit event occurr event form composit event composit event ce sequenc event ev ev occurr event ev occurr event ev question instanc ce possibl includ altern distinguish consumpt polici al consumpt polici recent consid recent set event construct composit previou detect longer consid detect chronicl consum event chronolog order signal longer consid detect continu defin slide window start composit primit event place sequenc event begin construct sequenc event signal cumul accumul primit event composit event final sequenc event signal paramet sequenc activ system event condit action db db db db bind bind fig context rule process includ occurr context found al role event event activ explicit event role event rule significantli function implement section role event rule rule role mandatori support condit role condit condit gener option condit role rule result system event condit case context set condit evalu compon rule evalu isol evalu quick section process singl rule potenti db start current event condit dba action execut activ rule system support facil condit rule access state db provid access bind event avail inform compon rule illustr figur posit complex portrai figur state event place multipl rule trigger execut complet execut singl action util unlik continu event occurr particip composit comput cumul context nw paton diaz rule respond situat stock held holder drop updat holder inform event identifi field set made holder inform holder fund exampl condit action access event paramet refer data item held event updat insert refer newli insert delet refer recent delet updat refer attribut data item unaffect updat event action rang task perform action option action updat structur rule perform behavior invoc extern inform user system administr abort altern action al attempt made delet tupl holder relat oper system manag inform attempt delet holder system contrast standard tupl delet system manag delet holder system context action similar inform illustr figur inform pass condit rule action util context rule data store attribut holder tupl affect chang price updat price stock true updat holder set valu price access state time updat activ system tabl dimens execut model ae ae transit granular ae polici nog cycl polici ae prioriti schedul fall error handl ae execut model execut model specifi set rule treat dimens present tabl execut model rule system close relat aspect underli dbm data transact number phase rule illustr figur transcend relat specif softwar signal phase refer event occurr event sourc trigger phase event produc trigger rule associ rule event occurr form rule instanti evalu phase evalu condit trigger rule rule conflict set form rule instanti condit satisfi schedul phase rule conflict set process execut carri action chosen rule instanti action execut event turn produc cascad rule fire event trigger rule evalu rule select rule event sourc signal trigger evalu schedul execut fig princip step place rule execut phase necessarili execut depend coupl mode determin condit evalu rel event trigger rule coupl mode action execut rel evalu condit option coupl mode frequent support case condit evalu immedi event case condit evalu transact event necessarili nw paton diaz earliest opportun process left end transact author jaim coupl mode condit evalu time event signal similar effect support starburst finkelstein user invok rule process transact issu special process process ruleset process rule command invok rule process trigger rule subset uniqu rule case condit evalu transact event execut action depend independ commit transact event place condit evalu natur relationship event rule trigger partial captur transit granular relationship event occurr rule instanti transit granular singl event occurr trigger singl rule transit granular collect event occurr trigger rule rule coupl mode defer monitor event occurr place transit granular instanti creat trigger phase transit granular tupl separ instanti creat transit granular set singl instanti creat respond set event fe featur influenc relationship event rule trigger net effect net effect event occurr individu event occurr consid differ strategi stem case updat data item consid singl instanc updat net effect delet origin instanc insert net effect insert updat instanc insert net effect modif question event signal evalu condit action rule address cycl polici execut model option cycl polici event signal condit action evalu combin origin event sourc illustr figur subsequ consum rule global repositori signal event mean condit action evalu suspend made event signal condit action cycl polici event signal condit action evalu condit action rule monitor event process earliest opportun cycl polici consid system support rule activ system system support cycl polici rule iter cycl polici defer rule schedul phase rule evalu determin multipl rule trigger time princip issu select rule fire topic receiv attent expert system fundament understand control behavior set rule rule order strongli influenc result reflect kind reason system exampl dynam approach conflict resolut priorit rule base recenc updat time event complex condit make system focu line recent modifi data recent fire rule search space reflect assumpt condit complex specif rule extent rule fit current mechan activ cope larg quantiti data effici context determinist behavior held highli tend support prioriti scheme rule prioriti static static prioriti determin system base rule creation user attribut rule rule select collect simultan fire rule execut prioriti mechan rule order numer rule absolut prioriti al indic rel prioriti rule state explicitli rule fire trigger time al number rule fire option includ fire rule instanti sequenti fire rule instanti parallel fire instanti specif rule rule fire rule satur fire rule approach depend task support rule altern suitabl rule support integr updat success constraint valid option bid encourag effici rule process option popular yield infer approach fourth option support deriv data deriv criteria support aspect consid error handl support rule fire system simpli abort standard behavior altern conveni widom ignor rule error continu process backtrack state rule process start restart rule process continu adopt plan recov error possibl nw paton diaz tabl dimens rule manag descript ae queri oper ae adapt run data model extend programm support ae except mechan underli system manag section structur characterist individu activ rule evalu set rule section consid facil provid system manag rule specif oper appli rule program support rule dimens shown tabl descript rule refer rule express program languag al buchmann al queri languag finkelstein stonebrak al object al diaz al categori extend queri languag facil arrang rule store object creation oper commonli found deactiv signal activ rule make system start monitor rule event condit rule persist long mechan administr temporarili switch rule delet deactiv mechan conveni improv loop prevent deactiv rule mechan individu rule rule set structur rule speed rule process oper signal requir support abstract invok explicitli applic notifi rule system extern occurr activ dbmss support creation delet differ level adapt support system chang rule applic recompil applic rule modifi compil time support dynam run time rule includ abil rule action modifi rule base slide scale adapt context system rule creat recompil applic code consid support run time adapt extent data model activ rule system independ dimens rule system function data model significantli influenc design activ rule includ dimens programm support paramount import activ rule activ system adopt mainstream implement technolog busi environ import facil support develop rule base includ abil queri rule base trace monitor rule system behavior support applic develop discuss fulli section activ rule system previou section introduc princip featur activ constitut framework activ function section framework appli present rang promin activ highlight import similar differ relat system activ behavior model facil relat commerci system includ trigger mechan number research prototyp develop seek provid support activ rule includ activ behavior relat system rang common stem natur underli passiv system rule gener trigger system defin oper structur insert modifi relat system rare support oper anticip futur activ rule system relat extend primit event includ execut store function support system review relat languag sql provid facil express condit perform rule descript languag extens queri languag activ mechan relat support limit rang coupl limit support composit event detect fundament restrict relat extend emerg due tabl activ behavior relat ariel fit framework introduc previou section subsect describ distinct featur exampl activ extens system larg relat data model present al al zaniolo harrison dietrich bayer jonker reddi al starburst starburst activ rule system add activ function extens relat system finkelstein testb number intern includ integr constraint al materi view widom noteworthi featur starburst rule system execut rule trigger net effect set data store oper place monitor natur chang log transit tabl entri nw paton diaz tabl dimens appli activ relat system dimens starburst postgr ariel knowledg model sourc structur op structur op structur op structur op granular set set set member set oper polici cumul role mandatori mandatori option mandatori role option option option option context bind bind bind bind option structur op structur op structur op structur op abort abort behavior inv extern context bind bind bind bind dba execut model defer defer defer tran gran set tupl set set polici cycl polici iter iter prioriti rel numer schedul sequenti sequenti sequenti sequenti error handl abort abort abort backtrack except manag descript queri lang queri lang queri lang queri lang oper activ deactiv adapt run time run time compil time run time prog support activ system tabl account subsequ updat oper tupl insert log insert updat tupl insert oper place inform store transit tabl trigger rule rule assert place end transact event trigger rule directli fact event occur record transit tabl subsequ time order specif event account schedul rule monitor event access updat relev consid rule rule fire multipl time singl access place fire rule starburst rule system consid conserv modest fix set facil support semant rule execut starburst argu support facil lead rule set difficult understand maintain postgr activ rule system number extens relat model support postgr facilit object oper postgr rule system consid section relat featur postgr bear design rule system postgr rule consid kei distinct postgr rule system consequ event effect defer rule assert point ariel import characterist ariel distinguish starburst postgr option event ariel princip support rule consequ distinct implement rule system consid section suitabl rule compar depend context circumst make event part rule explicit captur semant applic applic section gener polici total stock cautiou invest kind captur rule hname stock quantiti rule effect sell kind stock regard reason rel total nw paton diaz held cautiou invest prefer distinguish event condit true condit true result updat block condit true result price portfolio manag action approach support updat hname stock abort updat price stock hname portfolio consid describ context rule rule advantag programm rule system describ situat captur rule event defin monitor insert tupl attribut updat attribut provid ariel offer world context commerci relat support trigger mechan knowledg execut model mechan differ system system view provid consist support activ mechan relat trigger includ emerg standard al survei featur standard current commerci expect commerci system drift standard due commerci support row level trigger transit granular statement level trigger transit granular statement level trigger execut updat oper matter tupl affect updat import featur standard make explicit trigger interact featur found relat declar integr check mechan activ system system unlik relat support close associ behavior data behavior gener express method attach class structur data store hide aspect structur object mean task perform activ behavior relat support method code system activ extens oodb earli made year work passiv oodb rapid extens research activ encourag tendenc oodb advanc behavior manag facil greater tradit domain natur applic encourag investig activ construct significantli power relat system figur tabl shown select system tabl power extens relat common differ primit event activ oodb method invoc access updat structur partli deriv desir avoid reduc data independ link activ behavior structur partli fact system layer architectur straightforward event basi structur oper subsect outlin princip featur project develop activ base persist system featur tabl base extens sentinel featur figur tabl exampl activ extens oodb present etzion al naqvi thoma jone dinn al project al chakravarthi dayal pioneer import idea activ coupl mode composit result design fulli implement passiv oodb object model store activ extens distinct featur parallel execut trigger rule extens queri algebra oper access delta relat monitor net effect set identif applic benefit activ facil exact extens activ rule manag al diaz jaim add activ facil oodb rule event repres uniformli object content support control inform rare refer singl rule set rule support applic requir execut model support exact extens rule model collect rule nw paton diaz tabl dimens appli activ system dimens exact chimera knowledg model sourc structur op behavior inv structur op structur op behavior inv transact behavior inv behavior inv transact except transact clock extern program abstract abstract abstract granular set set oper time seq polici cumul cumul role mandatori mandatori mandatori mandatori role option mandatori option mandatori context bind bind bind bind db option structur op behavior inv structur op structur op behavior inv updat rule behavior inv behavior inv updat rule abort updat rule abort abort extern extern extern context bind bind bind bind dba dba dba db dba execut model defer defer defer defer detach defer defer detach tran gran set tupl set set prioriti rel rel rel rel numer polici cycl polici iter iter iter schedul parallel sequenti sequenti sequenti error handl ignor abort abort manag descript object object queri lang queri lang oper activ activ activ activ deactiv deactiv deactiv deactiv signal signal renam adapt compil time prog support queri trace queri trace activ system tabl dimens appli activ system base dimens od sentinel reach knowledg model sourc behavior inv behavior inv behavior inv structur op transact transact behavior inv abstract clock transact clock granular set oper time time polici chronicl recent recent chronicl chronicl continu cumul role mandatori mandatori mandatori role mandatori mandatori option mandatori context bind bind option behavior inv structur op structur op structur op behavior inv behavior inv inform inform abort abort abort context dba bind bind bind dba execut model defer defer defer detach detach defer defer detach detach tran gran tupl tupl tupl prioriti rel rel numer cycl polici iter iter schedul sequenti sequenti parallel parallel polici error handl abort abort manag descript prog lang object object prog lang object oper activ activ activ activ deactiv deactiv deactiv deactiv adapt prog support trace trace nw paton diaz share similar function special gener rule manag facil provid system exact develop advanc facil paton al diaz al al activ rule system commerci oodb al implement part kernel layer top sanction develop commerci activ oodb support exploit provid declar express condit oql power action express execut model slightli support process iter process defer rule rule system formal denot semant collet work optim chimera chimera al activ rule system uniqu survei build deduct system al deduct languag condit express encourag view rule inform pass event condit queri event histori unusu featur chimera rule condit action access past start current rule fire chimera implement compil user statement intern form interpret system store rule system data extend relat storag manag od od system defin manipul program extend facil categori rule semant divid constraint syntax execut model jagadish trigger support author argu distinct clarifi role facilit effici implement constraint trigger defin class subject inherit properti class constraint consist predic state object singl action execut condit action system check condit transact abort coupl option support depend constraint check immedi hard defer end transact soft multipl updat affect hard constraint transact constraint evalu soft constraint check carri end transact constraint affect instanc perman activ activ system unlik trigger explicitli activ object trigger condit action execut trigger declar automat deactiv declar reactiv automat user explicitli deactiv trigger command deactiv unlik trigger condit evalu true execut separ transact current transact commit coupl mode coupl mode detach note process support trigger od open interpret wai trigger consid equal valid interpret rule event defin rich event algebra boolean mask al gatziu dittrich activ facil top objectstor commerci oodb develop access sourc activ system implement layer top part kernel featur event semant base petri implement graph structur reflect structur petri net event languag present user seri oper share system event al sentinel al reach al sentinel sentinel al chakravarthi al activ extens base system texa instrument al focu project provis event specif rule integr rule system sophist transact manag consumpt mode wide accept provid descript construct paramet composit event rule system tupl level transit granular implement sentinel reach reach al common activ extens emphasi reach project develop understand rule manag interact complex transact view support open applic al exampl coupl mode support reach open applic mind sequenti causal rule execut separ transact trigger event trigger transact causal rule execut separ transact trigger event trigger transact abort architectur issu section consid characterist activ system present section implement address nw paton diaz refer made abstract architectur activ system present figur figur make explicit princip process data store implement function illustr figur histori queri evalu event detector schedul notif detect event trigger rule action execut condit evalu rule base read conflict set condit monitor situat monitor fig abstract activ rule system architectur princip process event ascertain event interest rule system primit event notifi extern composit event construct incom primit event inform past event obtain histori condit evalu condit rule event detect system support explicit statement event actual implement monitor primit event distinct implement strategi system consid section compar recent trigger rule updat conflict fire rule schedul process queri execut queri action access requir current state past order support monitor evolv function compon depend knowledg execut model activ system activ system turn influenc environ activ develop princip categori activ activ compon develop layer softwar top unchang passiv system approach advantag access requir sourc code passiv result activ system easili portabl passiv system lack access kernel underli impact perform limit function support term primit event coupl mode optim activ compon develop chang sourc exist passiv system approach free design activ system limit layer prefer model develop industri strength system worth number requir kernel system support activ capabl effect practic system develop larg layer small number hook kernel systemat perform evalu activ system architectur provid al subsect address rang implement issu detail event detect princip aspect implement event detect monitor primit event accumul inform relev composit event detect primit event involv form check kernel characterist mean activ function implement layer top exist system detect updat made tupl updat oper system identifi primit event specif updat perform event invoc user defin case event detector notifi event method dispatch specif techniqu detect primit event system discuss gatziu dittrich chakravarthi al kim al broadli achiev mechan diaz lead activ event detect undertaken applic dbm applic chang relev messag main drawback approach detect distribut applic encapsul mainten approach base monitor messag activ oper extend origin code provid user nw paton diaz signal event detector extra code call wrapper typic execut origin method approach gener found layer primit event detect implement preprocess applic kernel requir mechan offer gener solut place signal code insid system mechan monitor rang aspect system includ transact structur primit behavior invoc approach requir kernel found system integr architectur composit event involv record inform partial detect composit event fulli detect futur composit event place fact record place event detect expir composit event compon primit event origin boundari singl end transact mark end monitor partial event remov sourc transact composit event form event origin valid interv requir composit determin smallest valid interv event al fig sentinel event graph rang structur implement composit event event algebra dittrich describ color implement event al finit state al event graph link directli queri graph express condit rule inform partial detect event figur show event graph describ event event event graph decor instanc primit event consum composit event detect figur event consumpt mode activ system recent mention section occurr occurr occurr store anticip subsequ match occurr process practic care design composit event detector ensur histori figur extrem larg condit monitor event combin condit describ situat monitor close associ event detector condit monitor event detector initi process condit inform event occur pass event detector condit monitor sophist event complex inform pass condit monitor case primit event insert inform pass condit monitor event insert tupl event relev inform event complex conjunct inform condit rule event conjunct event signal rule detect event retriev rule base bound paramet pass queri evalu establish rule satisfi condit queri processor extens passiv rule condit bind access past state starburst al transit log record tabl chang support access condit rule accumul event trigger rule compar mechan requir system support rule process base net effect set accumul content histori specif rule system depend natur event specif languag scope access past state rule condit languag base declar queri languag underli possibl appli optim techniqu rule condit exist optim appli directli optim gain perform experienc event paramet restrict inform access condit similar theme explor widom shown exploit intermedi inform held rule manag speed condit approach gain repeat trigger individu rule system rich event algebra match specif valu optim move select condit event detector shown detail analysi rule condit action identifi rule amen parallel execut nw paton diaz design implement effect situat monitor activ system balanc provis express facil effici process express event algebra enabl situat monitor event part turn lead frequent invoc simplifi rule condit reduc cost condit evalu balanc overhead composit event detect definit posit involv situat monitor await theoret empir altern approach action execut rule condit satisfi prepar execut maintain conflict set trigger rule fire complex schedul vari system system postgr al schedul rule fire prioriti scheme requir rule fire specif order starburst al schedul complex rule fire order consist prioriti rule remov conflict set fire process rule base net effect underli rule schedul action pass queri turn updat histori action rule access inform event rule trigger bind pass data retriev condit rule set object integr constraint bind support wai explicitli paramet provid access current event predic current rule condit action exact obtain paramet event occurr trigger rule starburst store bind inform transit tabl record net effect tupl modif queri process transit tabl queri condit action rule unlik postgr simplifi current tupl consid correl provid access current tupl modif transact manag case sophist facil passiv system function activ mechan activ system made abil associ rule share activ behavior inherit hierarchi implement activ system convent flat transact rule process complet transact event led trigger activ system sophist transact manag facil exploit flexibl convent rule addit featur support advanc applic rich transact model underpin rang behavior extens execut model milo nest transact transact number compon subtransact nest transact creat wait termin model extend nest transact run concurr subtransact rothermel speed process result model activ system action rule unabl carri task assign chanc transact potenti undo amount work action rule execut separ subtransact trigger parent transact trigger free decid respond failur repeat action set number fire altern underli function made rule programm extens rule definit describ respond failur number issu identifi relat relationship concurr control coupl mode trigger trigger transact execut depend concurr control method trigger transact commit trigger transact execut potenti behavior concept effect al fall line schedul obei trigger transact serial trigger trigger transact commit trigger transact commit user obei causal principl trigger transact execut freeli terminolog introduc section option correspond detach depend detach independ coupl product rule algorithm architectur present figur make explicit role event detect situat ariel amo support product rule explicit event specif primit updat event detect product truth condit chang consequ underli figur potenti architectur implement product rule algorithm commonli improv effici condit evalu gener appli context rule process context nw paton diaz match set conflict resolut act match match phase identifi rule condit true respect state add conflict essenti queue trigger rule wait fire conflict resolut step select singl rule conflict set process act execut statement action select rule naiv evalu match phase evalu condit rule find rule consid process approach prohibit small part condit act chang cycl method seek avoid recomput entir condit rule store inform partial comput condit rule cycl relat figur illustr princip approach typic product rule ariel notat relat data monitor uk base owner ibm holder queri express condit involv join relat stock holder princip notion rete match origin implement product rule store partial comput condit rule cycl rule effect conflict set comput minim addit effort partial comput condit rule store graph structur discrimin network queri repres rete discrimin network figur rete network number node type root node serv entri point root node number node repres base node repres store filter appli singl condit relat filter tupl satisfi condit filter store ff memori tabl node parent perform join parent result store fi memori node bottom tree result node hold conflict set rete match phase oper pass inform network root holder tupl enter test countri equal uk store ff memori node tupl join ff memori node tupl result store fi memori node activ system root conflict set holder stock fig rete network rule tupl join ff memori node yield addit data conflict set rete commerci number larg space overhead ff fi memori store intermedi result mainten delet overhead work identif altern rete explor princip issu relat intermedi store spectrum storag intermedi result storag intermedi result rete storag intens end ff fi memori variat rete ff fi memori treat rete case hanson recent research shown rule identifi level intermedi storag suitabl al nw paton diaz idl idl relat db idl idl event sourc idl detector event idl rule manag schedul condit monitor db system file corba corba detect event signal event fig activ rule system move distribut set store algorithm treat built directli top relat storag research identifi structur improv aspect condit monitor exploit interv skip list reduc cost search updat ff mirank special index structur improv join perform activ rule distribut environ paper assum activ behavior support central modern applic distribut number made exploit activ behavior distribut system activ mechan set cooper object distribut network autonom node event event manag rule manag servic cooper offer function bundl monolith activ mechan standard corba al provid commun middlewar requir cooper distribut set figur overview architectur present figur adapt set pioneer work al illustr approach system enabl eca rule base process report event complex situat system heterogen distribut inform sourc limit experi insight implic distribut activ rule support architectur rule manag longer central distribut figur suggest compon central locat event detect distribut site al site local event detector global event detector basic correspond activ system detector found central monitor composit event global event detector event regist interest es compon detector detect global event distribut site event signal detector regist interest rule manag support offer distinct central rule manag maintain global rule set rule manag distinct site local rule set rule manag global rule set al distribut architectur altern commun overhead corba includ event servic support asynchron commun object commun achiev event channel event channel queue event supplier remov consum model provid event base initi commun push model supplier event initi transfer event data consum pull model permit consum event request event data supplier option consid address commun distinct compon support activ function signal phase involv commun event sourc event follow push model pull model model central event detector event relev system import commun overhead event commun event detector model incur bigger process overhead al commun event detector rule manag trigger follow approach impli explicit subscript rule manag set event approach leav rule manag poll event collect period al architectur knowledg execut model move distribut set knowledg heterogen event sourc lead addit classif found central system workflow data sourc lack singl requir set context condit action perform complex problem time stamp central system singl local clock total order event instanc base occurr time distinct primit event order occur vice versa time composit event occurr deriv occurr time compon distribut system global kei supplier consum awar event process initi event process violat principl paradigm corba explicitli support composit event nw paton diaz site local event occur simultan site event contribut composit event origin event timestamp global local clock synchron special time server transmit time inform delai synchron site paramet obtain maximum time differ tick local clock sum time stamp local construct composit global timestamp canon form detect composit event execut model case error handl dimens extend commun delai disrupt face messag compon activ mechan solut vari depend compon impact error commun delai signal event detector event sourc global event detector receiv event order actual occurr action opt asynchron evalu synchron evalu ignor fact delai event begin evalu suitabl event occurr arriv composit event detector event account order event detect block delai event faster event site disjunct detect detect synchron evalu wait delai evalu proce relev event arriv site global event detector synchron evalu respect occurr order evalu block transmiss disrupt site failur previou disjunct site check relev event disjunct event occurr detect check reveal relev event detect disrupt occur delai arriv relev event global detector check consumpt polici properli support point strategi depend applic failur data sourc access due node condit evalu action execut address option rang action execut action al detail distribut activ rule manag futur servic offer supplier corrobor event mechan independ activ dbm support debug commun integr distribut applic krishnamurthi develop activ applic support activ mechan system experi applic activ activ system facil suitabl perform rang straightforward difficulti includ obviou part applic support activ perform penalti result rule exacerb lack design methodolog function larg rule base difficult rule interact complex wai singl descript control flow applic tool activ rule system support monitor debug activ rule point reflect design rule analysi tool debug explan recent advanc area outlin rule design techniqu design descript structur aspect inform domain turn alongsid mechan describ process data flow captur semant complet applic activ behavior close link structur store rule action carri task view clear techniqu suitabl easili adapt function support activ rule requir design techniqu provid guidanc aspect support activ address facil made method explicit support activ extens exist structur data model al extens er model support descript event rule map activ rule facil similar found commerci relat adapt model construct semant data model hull describ composit includ map activ rule case target languag power case facil includ tempor provid extend model languag assum activ rule surfac explicitli design question part applic support activ techniqu altern focu idea methodolog fraternali initi insight high level descript languag stage develop map trigger found commerci nw paton diaz fig graph depict rule trigger depend rule analysi semant activ system literatur inform repres exampl section paper al widom finkelstein number disadvantag approach specif descript incomplet difficult compar function basi build tool support formal analysi rule base formal specif develop activ system denot semant collet al combin techniqu tanca fernand al clarifi inform definit specif basi reason rule base number characterist rule behavior rule analyz search al rule process rule process fail termin cycl exist graph node repres rule edg repres relationship trigger graph figur fire rule fire rule initi seri rule fire fail termin static analysi rule base set rule fail termin straightforward approach analysi relationship insert edg rule rule action perform updat relat monitor event approach potenti detect practic rule termin rule definit relat unari relat rel integ attribut activ system ri rj fig graph depict confluent rule behavior creat rule insert rel num insert rel valu approach consid potenti sourc practic directli tupl insert action lead condit rule conserv approach rule termin analysi examin condit action rule result system present widom result rule process independ order simultan trigger rule select polici holder relat section attribut role attribut interpret differ rule rule maintain number item stock insert updat updat holder affect amount stock held holder attribut altern interpret treat maximum number stock holder give rise insert updat updat holder stock held holder rang stock held holder nw paton diaz rule implement inconsist polici stock rule prioriti present rule base time updat nondeterminist affect stock held confluenc understood fire rule state lead creation state rule trigger potenti successor state illustr figur state successor result fire rule rule base confluent rule trigger initi state singl final state reach order subsequ simultan trigger rule select fire figur note action rule trigger addit rule transit state behavior subsequ trigger rule account confluenc entir rule base work confluenc analysi develop algorithm analyz complet rule base al effect updat truth condit widom levi sagiv context behavior exhibit der effect rule process observ user system independ order trigger rule select notion seek extend determinist rule system behavior boundari rule implement confluent observ nondeterminist messag rule schedul fire user receiv messag transact abort rule schedul transact messag user initi research static analysi activ rule base significantli develop activ applic rule analyz gener suppli activ obviou action potenti sourc nontermin detect rang made rule prioriti tailor order rule rule condit action modifi chang rule implement conflict polici drop develop effect activ system rule analysi system await work commun result analysi experi base implement rule analyz rule debug user reluct appli activ facil anticip problem behavior lack control motiv develop debug environ defin safe rule set rule compli confluenc observ determin properti properti easi ascertain rule languag compil research rule analysi declar languag author activ rule system necessarili implement rule system integr imper program languag fact rule base exhibit termin confluent behavior impli correct rule languag rang applic rule debug environ increasingli press tradit debugg model adequ debug rule convent debugg provid exhaust inform state execut process program subroutin user monitor evolut state inform make rule debug challeng task wai rule interact main sourc incorrect unexpect control exhibit activ rule demand debugg unlik tradit program sequenti control explicitli static activ rule fire dynam system base previou flow event advanc rule fire rule elig repres conflict depend event extern reveal context rule trigger conflict set event present sequenti trace trigger rule debugg exact al attempt address issu show intertwin cycl rule event user ascertain rule event trigger rule transact instruct rule execut event cycl permit identif context event place term recent trigger rule figur show cycl coupl mode tree root artifici creat node label direct descend event node repres event event node altern rule node arc event node rule node mean event trigger rule arc form rule node event node mean event produc result execut action rule nw paton diaz fig intertwin cycl tion tree construct figur event happen event leftmost occurr rule rule leftmost occurr rule rule figur make explicit conflict set simultan trigger conflict rule resolv rule manag indic rule particip conflict set restrict number rule complex interact occur build tree altern investig visual tool rule analysi vital al show trace trigger graph creat analysi figur color code event state rule state trigger execut proce color displai textual trace execut displai separ window vital statist manag calcul record statist behavior rule processor number tupl delet modifi rule execut number time rule data identifi potenti infinit find erron rule declar ascertain monitor size relev size uniform suggest cycl termin erron rule condit declar activ system suspect number time rule execut low compar number time rule trigger featur statist data point potenti abnorm behavior seq tran tran tran fig trace composit event sentinel approach displai interleav event restrict primit event monitor composit event occurr complic task due larg number occurr shown intric wai event combin obtain composit event occurr approach issu present part sentinel system al sentinel debug tool inform execut store log file consult debug tool simul runtim activ event tree creat primit event leaf node composit event parent compon event color code repres event statu tree grow primit event root transact tree describ trigger rule root node repres child node repres rule fire context parent node user transact rule execut color code repres state suspend commit rule line drawn connect transact node current rule trigger event figur detect event lead happen conjunct event turn trigger rule tran rule fire context run tran child transact tran nw paton diaz version rule event produc lead clutter visual al advanc rule remain customiz visual rule automat gener test activ rule system function effect present user visual research activ similar line earli research wo